From 82d67b6413876469932adabf9d0d30215702ad84 Mon Sep 17 00:00:00 2001 From: "fix94.1" Date: Sat, 21 Jan 2012 20:57:41 +0000 Subject: [PATCH] mirrored wiiflow r417 --- Makefile | 262 + data/app_booter.bin | Bin 0 -> 800 bytes data/images/background.png | Bin 0 -> 5427 bytes data/images/balanceboard.png | Bin 0 -> 4743 bytes data/images/balanceboardR.png | Bin 0 -> 5789 bytes data/images/btnchannel.png | Bin 0 -> 7327 bytes data/images/btnchannels.png | Bin 0 -> 7679 bytes data/images/btnconfig.png | Bin 0 -> 4014 bytes data/images/btnconfigs.png | Bin 0 -> 4779 bytes data/images/btndvd.png | Bin 0 -> 7321 bytes data/images/btndvds.png | Bin 0 -> 7752 bytes data/images/btngamecfg.png | Bin 0 -> 2383 bytes data/images/btngamecfgs.png | Bin 0 -> 1980 bytes data/images/btnhomebrew.png | Bin 0 -> 5358 bytes data/images/btninfo.png | Bin 0 -> 3904 bytes data/images/btninfos.png | Bin 0 -> 4593 bytes data/images/btnminus.png | Bin 0 -> 2800 bytes data/images/btnminuss.png | Bin 0 -> 3203 bytes data/images/btnnext.png | Bin 0 -> 6115 bytes data/images/btnnexts.png | Bin 0 -> 8509 bytes data/images/btnplus.png | Bin 0 -> 3223 bytes data/images/btnpluss.png | Bin 0 -> 3558 bytes data/images/btnprev.png | Bin 0 -> 6155 bytes data/images/btnprevs.png | Bin 0 -> 8514 bytes data/images/btnquit.png | Bin 0 -> 3808 bytes data/images/btnquits.png | Bin 0 -> 4527 bytes data/images/btnusb.png | Bin 0 -> 7598 bytes data/images/btnusbs.png | Bin 0 -> 7938 bytes data/images/butcenter.png | Bin 0 -> 563 bytes data/images/butleft.png | Bin 0 -> 2619 bytes data/images/butright.png | Bin 0 -> 2853 bytes data/images/butscenter.png | Bin 0 -> 496 bytes data/images/butsleft.png | Bin 0 -> 3057 bytes data/images/butsright.png | Bin 0 -> 3429 bytes data/images/cero_a.png | Bin 0 -> 7510 bytes data/images/cero_b.png | Bin 0 -> 7076 bytes data/images/cero_c.png | Bin 0 -> 7737 bytes data/images/cero_d.png | Bin 0 -> 7287 bytes data/images/cero_z.png | Bin 0 -> 6989 bytes data/images/classiccontroller.png | Bin 0 -> 4814 bytes data/images/dancepad.png | Bin 0 -> 2503 bytes data/images/dancepadR.png | Bin 0 -> 3027 bytes data/images/delete.png | Bin 0 -> 1475 bytes data/images/deletes.png | Bin 0 -> 1472 bytes data/images/drums.png | Bin 0 -> 6710 bytes data/images/drumsR.png | Bin 0 -> 7117 bytes data/images/dvdskin.png | Bin 0 -> 4852 bytes data/images/dvdskin_black.png | Bin 0 -> 3998 bytes data/images/dvdskin_red.png | Bin 0 -> 5831 bytes data/images/error.png | Bin 0 -> 6107 bytes data/images/esrb_ao.png | Bin 0 -> 2884 bytes data/images/esrb_e.png | Bin 0 -> 2592 bytes data/images/esrb_ec.png | Bin 0 -> 2859 bytes data/images/esrb_eten.png | Bin 0 -> 2764 bytes data/images/esrb_m.png | Bin 0 -> 2815 bytes data/images/esrb_t.png | Bin 0 -> 2334 bytes data/images/favoritesoff.png | Bin 0 -> 3368 bytes data/images/favoritesoffs.png | Bin 0 -> 2741 bytes data/images/favoriteson.png | Bin 0 -> 4945 bytes data/images/favoritesons.png | Bin 0 -> 4128 bytes data/images/flatloading.png | Bin 0 -> 11185 bytes data/images/flatnopic.png | Bin 0 -> 3950 bytes data/images/gcncontroller.png | Bin 0 -> 6373 bytes data/images/generic_point.png | Bin 0 -> 2200 bytes data/images/guitar.png | Bin 0 -> 5645 bytes data/images/guitarR.png | Bin 0 -> 5741 bytes data/images/loading.png | Bin 0 -> 13658 bytes data/images/microphone.png | Bin 0 -> 2030 bytes data/images/microphoneR.png | Bin 0 -> 2298 bytes data/images/motionplus.png | Bin 0 -> 1700 bytes data/images/motionplusR.png | Bin 0 -> 1964 bytes data/images/nopic.png | Bin 0 -> 6770 bytes data/images/norating.png | Bin 0 -> 5727 bytes data/images/nunchuk.png | Bin 0 -> 2643 bytes data/images/nunchukR.png | Bin 0 -> 3060 bytes data/images/pbarcenter.png | Bin 0 -> 245 bytes data/images/pbarcenters.png | Bin 0 -> 158 bytes data/images/pbarleft.png | Bin 0 -> 357 bytes data/images/pbarlefts.png | Bin 0 -> 442 bytes data/images/pbarright.png | Bin 0 -> 350 bytes data/images/pbarrights.png | Bin 0 -> 391 bytes data/images/pegi_12.png | Bin 0 -> 6122 bytes data/images/pegi_16.png | Bin 0 -> 5962 bytes data/images/pegi_18.png | Bin 0 -> 6575 bytes data/images/pegi_3.png | Bin 0 -> 6294 bytes data/images/pegi_7.png | Bin 0 -> 6158 bytes data/images/player1_point.png | Bin 0 -> 2339 bytes data/images/player2_point.png | Bin 0 -> 2500 bytes data/images/player3_point.png | Bin 0 -> 2527 bytes data/images/player4_point.png | Bin 0 -> 2474 bytes data/images/stopkidoff.png | Bin 0 -> 2447 bytes data/images/stopkidoffs.png | Bin 0 -> 1863 bytes data/images/stopkidon.png | Bin 0 -> 2818 bytes data/images/stopkidons.png | Bin 0 -> 2720 bytes data/images/wait_01.png | Bin 0 -> 6331 bytes data/images/wait_02.png | Bin 0 -> 6444 bytes data/images/wait_03.png | Bin 0 -> 6571 bytes data/images/wait_04.png | Bin 0 -> 6645 bytes data/images/wait_05.png | Bin 0 -> 6748 bytes data/images/wait_06.png | Bin 0 -> 6331 bytes data/images/wait_07.png | Bin 0 -> 6446 bytes data/images/wait_08.png | Bin 0 -> 6566 bytes data/images/wait_09.png | Bin 0 -> 6642 bytes data/images/wait_10.png | Bin 0 -> 6752 bytes data/images/wheel.png | Bin 0 -> 2451 bytes data/images/wifi1.png | Bin 0 -> 4847 bytes data/images/wifi12.png | Bin 0 -> 5408 bytes data/images/wifi16.png | Bin 0 -> 5186 bytes data/images/wifi2.png | Bin 0 -> 5110 bytes data/images/wifi3.png | Bin 0 -> 5164 bytes data/images/wifi32.png | Bin 0 -> 5805 bytes data/images/wifi4.png | Bin 0 -> 5037 bytes data/images/wifi8.png | Bin 0 -> 4952 bytes data/images/wiimote1.png | Bin 0 -> 4232 bytes data/images/wiimote2.png | Bin 0 -> 4340 bytes data/images/wiimote3.png | Bin 0 -> 4326 bytes data/images/wiimote4.png | Bin 0 -> 4305 bytes data/images/wiimote8.png | Bin 0 -> 4168 bytes data/images/wiispeak.png | Bin 0 -> 5214 bytes data/images/zapper.png | Bin 0 -> 4976 bytes data/sounds/camera.wav | Bin 0 -> 6970 bytes data/sounds/click.wav | Bin 0 -> 10328 bytes data/sounds/hover.wav | Bin 0 -> 6400 bytes docs/Content.txt | 172 + docs/Requirements.txt | 6 + docs/versions.txt | 49 + portlibs/include/ext2.h | 99 + portlibs/include/ext2_frag.h | 16 + portlibs/include/fat.h | 104 + portlibs/include/fatfile_frag.h | 16 + portlibs/include/freetype/config/ftconfig.h | 500 ++ portlibs/include/freetype/config/ftheader.h | 780 ++ portlibs/include/freetype/config/ftmodule.h | 32 + portlibs/include/freetype/config/ftoption.h | 693 ++ portlibs/include/freetype/config/ftstdlib.h | 172 + portlibs/include/freetype/freetype.h | 3863 ++++++++++ portlibs/include/freetype/ftadvanc.h | 179 + portlibs/include/freetype/ftbbox.h | 94 + portlibs/include/freetype/ftbdf.h | 209 + portlibs/include/freetype/ftbitmap.h | 227 + portlibs/include/freetype/ftcache.h | 1125 +++ portlibs/include/freetype/ftchapters.h | 103 + portlibs/include/freetype/ftcid.h | 98 + portlibs/include/freetype/fterrdef.h | 239 + portlibs/include/freetype/fterrors.h | 206 + portlibs/include/freetype/ftgasp.h | 120 + portlibs/include/freetype/ftglyph.h | 613 ++ portlibs/include/freetype/ftgxval.h | 358 + portlibs/include/freetype/ftgzip.h | 102 + portlibs/include/freetype/ftimage.h | 1254 +++ portlibs/include/freetype/ftincrem.h | 349 + portlibs/include/freetype/ftlcdfil.h | 172 + portlibs/include/freetype/ftlist.h | 273 + portlibs/include/freetype/ftlzw.h | 99 + portlibs/include/freetype/ftmac.h | 274 + portlibs/include/freetype/ftmm.h | 378 + portlibs/include/freetype/ftmodapi.h | 441 ++ portlibs/include/freetype/ftmoderr.h | 155 + portlibs/include/freetype/ftotval.h | 203 + portlibs/include/freetype/ftoutln.h | 539 ++ portlibs/include/freetype/ftpfr.h | 172 + portlibs/include/freetype/ftrender.h | 234 + portlibs/include/freetype/ftsizes.h | 159 + portlibs/include/freetype/ftsnames.h | 170 + portlibs/include/freetype/ftstroke.h | 716 ++ portlibs/include/freetype/ftsynth.h | 80 + portlibs/include/freetype/ftsystem.h | 346 + portlibs/include/freetype/fttrigon.h | 350 + portlibs/include/freetype/fttypes.h | 587 ++ portlibs/include/freetype/ftwinfnt.h | 274 + portlibs/include/freetype/ftxf86.h | 80 + portlibs/include/freetype/internal/autohint.h | 205 + portlibs/include/freetype/internal/ftcalc.h | 178 + portlibs/include/freetype/internal/ftdebug.h | 250 + portlibs/include/freetype/internal/ftdriver.h | 249 + portlibs/include/freetype/internal/ftgloadr.h | 168 + portlibs/include/freetype/internal/ftmemory.h | 368 + portlibs/include/freetype/internal/ftobjs.h | 875 +++ portlibs/include/freetype/internal/ftrfork.h | 196 + portlibs/include/freetype/internal/ftserv.h | 328 + portlibs/include/freetype/internal/ftstream.h | 539 ++ portlibs/include/freetype/internal/fttrace.h | 134 + portlibs/include/freetype/internal/ftvalid.h | 150 + portlibs/include/freetype/internal/internal.h | 50 + portlibs/include/freetype/internal/pcftypes.h | 56 + portlibs/include/freetype/internal/psaux.h | 875 +++ portlibs/include/freetype/internal/pshints.h | 687 ++ .../freetype/internal/services/svbdf.h | 57 + .../freetype/internal/services/svcid.h | 49 + .../freetype/internal/services/svgldict.h | 60 + .../freetype/internal/services/svgxval.h | 72 + .../freetype/internal/services/svkern.h | 51 + .../include/freetype/internal/services/svmm.h | 79 + .../freetype/internal/services/svotval.h | 55 + .../freetype/internal/services/svpfr.h | 66 + .../freetype/internal/services/svpostnm.h | 58 + .../freetype/internal/services/svpscmap.h | 129 + .../freetype/internal/services/svpsinfo.h | 60 + .../freetype/internal/services/svsfnt.h | 80 + .../freetype/internal/services/svttcmap.h | 85 + .../freetype/internal/services/svtteng.h | 53 + .../freetype/internal/services/svttglyf.h | 48 + .../freetype/internal/services/svwinfnt.h | 50 + .../freetype/internal/services/svxf86nm.h | 55 + portlibs/include/freetype/internal/sfnt.h | 762 ++ portlibs/include/freetype/internal/t1types.h | 254 + portlibs/include/freetype/internal/tttypes.h | 1543 ++++ portlibs/include/freetype/t1tables.h | 508 ++ portlibs/include/freetype/ttnameid.h | 1247 +++ portlibs/include/freetype/tttables.h | 756 ++ portlibs/include/freetype/tttags.h | 107 + portlibs/include/freetype/ttunpat.h | 59 + portlibs/include/ft2build.h | 39 + portlibs/include/jconfig.h | 45 + portlibs/include/jerror.h | 304 + portlibs/include/jmorecfg.h | 370 + portlibs/include/jpeglib.h | 1138 +++ portlibs/include/modplay/defines.h | 11 + portlibs/include/modplay/envelope.h | 57 + portlibs/include/modplay/mixer.h | 77 + portlibs/include/modplay/modplay.h | 55 + portlibs/include/modplay/modplay_core.h | 212 + portlibs/include/ntfs.h | 147 + portlibs/include/ntfsfile_frag.h | 15 + portlibs/include/pngconf.h | 1487 ++++ portlibs/include/pngu/pngu.h | 173 + portlibs/include/tremor/config_types.h | 26 + portlibs/include/tremor/ivorbiscodec.h | 104 + portlibs/include/tremor/ivorbisfile.h | 122 + portlibs/include/tremor/ogg.h | 206 + portlibs/include/tremor/os_types.h | 94 + portlibs/include/wiilight.h | 21 + portlibs/include/zconf.h | 332 + portlibs/include/zlib.h | 1357 ++++ portlibs/sources/libext2fs/AUTHORS | 11 + portlibs/sources/libext2fs/CREDITS | 9 + portlibs/sources/libext2fs/LICENSE | 340 + portlibs/sources/libext2fs/Makefile | 25 + portlibs/sources/libext2fs/include/ext2.h | 99 + portlibs/sources/libext2fs/source/Makefile | 133 + portlibs/sources/libext2fs/source/alloc.c | 308 + portlibs/sources/libext2fs/source/alloc_sb.c | 86 + .../sources/libext2fs/source/alloc_stats.c | 106 + .../sources/libext2fs/source/alloc_tables.c | 239 + portlibs/sources/libext2fs/source/badblocks.c | 327 + portlibs/sources/libext2fs/source/bb_compat.c | 63 + portlibs/sources/libext2fs/source/bb_inode.c | 266 + portlibs/sources/libext2fs/source/bit_ops.h | 57 + portlibs/sources/libext2fs/source/bitmaps.c | 256 + portlibs/sources/libext2fs/source/bitops.c | 117 + portlibs/sources/libext2fs/source/bitops.h | 638 ++ .../sources/libext2fs/source/blkmap64_ba.c | 327 + portlibs/sources/libext2fs/source/blknum.c | 477 ++ portlibs/sources/libext2fs/source/block.c | 623 ++ portlibs/sources/libext2fs/source/bmap.c | 335 + portlibs/sources/libext2fs/source/bmap64.h | 61 + portlibs/sources/libext2fs/source/bmove.c | 166 + portlibs/sources/libext2fs/source/brel.h | 86 + portlibs/sources/libext2fs/source/brel_ma.c | 198 + .../sources/libext2fs/source/check_desc.c | 103 + portlibs/sources/libext2fs/source/closefs.c | 461 ++ portlibs/sources/libext2fs/source/com_err.c | 35 + portlibs/sources/libext2fs/source/com_err.h | 70 + portlibs/sources/libext2fs/source/config.h | 10 + portlibs/sources/libext2fs/source/crc16.c | 73 + portlibs/sources/libext2fs/source/crc16.h | 26 + portlibs/sources/libext2fs/source/csum.c | 288 + portlibs/sources/libext2fs/source/dblist.c | 414 + .../sources/libext2fs/source/dblist_dir.c | 79 + .../sources/libext2fs/source/dir_iterate.c | 270 + portlibs/sources/libext2fs/source/dirblock.c | 126 + portlibs/sources/libext2fs/source/dirhash.c | 257 + .../sources/libext2fs/source/disc_cache.c | 374 + .../sources/libext2fs/source/disc_cache.h | 118 + portlibs/sources/libext2fs/source/dupfs.c | 96 + portlibs/sources/libext2fs/source/e2image.h | 51 + portlibs/sources/libext2fs/source/expanddir.c | 126 + portlibs/sources/libext2fs/source/ext2.c | 420 + portlibs/sources/libext2fs/source/ext2_err.h | 152 + .../sources/libext2fs/source/ext2_ext_attr.h | 71 + portlibs/sources/libext2fs/source/ext2_frag.c | 60 + portlibs/sources/libext2fs/source/ext2_frag.h | 16 + portlibs/sources/libext2fs/source/ext2_fs.h | 799 ++ .../sources/libext2fs/source/ext2_internal.c | 1076 +++ .../sources/libext2fs/source/ext2_internal.h | 102 + portlibs/sources/libext2fs/source/ext2_io.h | 144 + .../sources/libext2fs/source/ext2_types.h | 18 + portlibs/sources/libext2fs/source/ext2dir.c | 657 ++ portlibs/sources/libext2fs/source/ext2dir.h | 69 + portlibs/sources/libext2fs/source/ext2file.c | 413 + portlibs/sources/libext2fs/source/ext2file.h | 60 + portlibs/sources/libext2fs/source/ext2fs.h | 1572 ++++ portlibs/sources/libext2fs/source/ext2fsP.h | 143 + .../sources/libext2fs/source/ext3_extents.h | 109 + portlibs/sources/libext2fs/source/ext_attr.c | 155 + portlibs/sources/libext2fs/source/extent.c | 2007 +++++ portlibs/sources/libext2fs/source/fiemap.h | 68 + portlibs/sources/libext2fs/source/fileio.c | 412 + portlibs/sources/libext2fs/source/finddev.c | 208 + portlibs/sources/libext2fs/source/flushb.c | 74 + portlibs/sources/libext2fs/source/freefs.c | 112 + portlibs/sources/libext2fs/source/gekko_io.c | 561 ++ portlibs/sources/libext2fs/source/gekko_io.h | 53 + .../sources/libext2fs/source/gen_bitmap.c | 560 ++ .../sources/libext2fs/source/gen_bitmap64.c | 563 ++ .../sources/libext2fs/source/get_pathname.c | 160 + .../sources/libext2fs/source/getsectsize.c | 91 + portlibs/sources/libext2fs/source/getsize.c | 311 + portlibs/sources/libext2fs/source/i_block.c | 89 + portlibs/sources/libext2fs/source/icount.c | 862 +++ portlibs/sources/libext2fs/source/imager.c | 408 + portlibs/sources/libext2fs/source/ind_block.c | 66 + .../sources/libext2fs/source/initialize.c | 447 ++ portlibs/sources/libext2fs/source/inline.c | 32 + portlibs/sources/libext2fs/source/inode.c | 834 ++ portlibs/sources/libext2fs/source/inode_io.c | 291 + .../sources/libext2fs/source/io_manager.c | 112 + portlibs/sources/libext2fs/source/irel.h | 114 + portlibs/sources/libext2fs/source/irel_ma.c | 372 + portlibs/sources/libext2fs/source/ismounted.c | 383 + .../sources/libext2fs/source/jfs_compat.h | 68 + portlibs/sources/libext2fs/source/jfs_dat.h | 64 + portlibs/sources/libext2fs/source/jfs_user.h | 8 + .../sources/libext2fs/source/kernel-jbd.h | 952 +++ .../sources/libext2fs/source/kernel-list.h | 112 + portlibs/sources/libext2fs/source/link.c | 153 + portlibs/sources/libext2fs/source/llseek.c | 139 + portlibs/sources/libext2fs/source/lookup.c | 69 + portlibs/sources/libext2fs/source/mem2.h | 27 + .../sources/libext2fs/source/mem_allocate.h | 24 + portlibs/sources/libext2fs/source/mkdir.c | 142 + portlibs/sources/libext2fs/source/mkjournal.c | 601 ++ portlibs/sources/libext2fs/source/namei.c | 206 + portlibs/sources/libext2fs/source/native.c | 27 + portlibs/sources/libext2fs/source/newdir.c | 77 + portlibs/sources/libext2fs/source/openfs.c | 411 + .../sources/libext2fs/source/partitions.h | 49 + portlibs/sources/libext2fs/source/progress.c | 86 + portlibs/sources/libext2fs/source/punch.c | 324 + portlibs/sources/libext2fs/source/read_bb.c | 102 + .../sources/libext2fs/source/read_bb_file.c | 105 + portlibs/sources/libext2fs/source/res_gdt.c | 220 + .../sources/libext2fs/source/rw_bitmaps.c | 351 + portlibs/sources/libext2fs/source/sparse.c | 52 + portlibs/sources/libext2fs/source/swapfs.c | 315 + portlibs/sources/libext2fs/source/tdb.c | 4145 ++++++++++ portlibs/sources/libext2fs/source/tdb.h | 215 + portlibs/sources/libext2fs/source/unlink.c | 99 + portlibs/sources/libext2fs/source/valid_blk.c | 55 + portlibs/sources/libext2fs/source/version.c | 54 + .../sources/libext2fs/source/write_bb_file.c | 34 + portlibs/sources/libfat/Makefile | 32 + portlibs/sources/libfat/bit_ops.h | 57 + portlibs/sources/libfat/cache.c | 323 + portlibs/sources/libfat/cache.h | 128 + portlibs/sources/libfat/common.h | 78 + portlibs/sources/libfat/directory.c | 1120 +++ portlibs/sources/libfat/directory.h | 178 + portlibs/sources/libfat/disc.c | 111 + portlibs/sources/libfat/disc.h | 110 + portlibs/sources/libfat/fat.h | 104 + portlibs/sources/libfat/fatdir.c | 619 ++ portlibs/sources/libfat/fatdir.h | 73 + portlibs/sources/libfat/fatfile.c | 1133 +++ portlibs/sources/libfat/fatfile.h | 105 + portlibs/sources/libfat/fatfile_frag.c | 63 + portlibs/sources/libfat/fatfile_frag.h | 16 + .../sources/libfat/file_allocation_table.c | 393 + .../sources/libfat/file_allocation_table.h | 70 + portlibs/sources/libfat/filetime.c | 107 + portlibs/sources/libfat/filetime.h | 41 + portlibs/sources/libfat/libfat.c | 249 + portlibs/sources/libfat/libfatversion.h | 10 + portlibs/sources/libfat/lock.c | 29 + portlibs/sources/libfat/lock.h | 72 + portlibs/sources/libfat/mem2.h | 27 + portlibs/sources/libfat/mem_allocate.h | 50 + portlibs/sources/libfat/partition.c | 455 ++ portlibs/sources/libfat/partition.h | 107 + portlibs/sources/libmodplay/Makefile | 128 + portlibs/sources/libmodplay/source/defines.h | 11 + portlibs/sources/libmodplay/source/effects.c | 1708 +++++ portlibs/sources/libmodplay/source/effects.h | 88 + portlibs/sources/libmodplay/source/envelope.c | 125 + portlibs/sources/libmodplay/source/envelope.h | 57 + portlibs/sources/libmodplay/source/mixer.c | 546 ++ portlibs/sources/libmodplay/source/mixer.h | 77 + portlibs/sources/libmodplay/source/mod.c | 600 ++ portlibs/sources/libmodplay/source/mod.h | 30 + portlibs/sources/libmodplay/source/modplay.c | 651 ++ portlibs/sources/libmodplay/source/modplay.h | 55 + .../sources/libmodplay/source/modplay_core.c | 760 ++ .../sources/libmodplay/source/modplay_core.h | 212 + portlibs/sources/libmodplay/source/s3m.c | 575 ++ portlibs/sources/libmodplay/source/s3m.h | 27 + portlibs/sources/libmodplay/source/xm.c | 769 ++ portlibs/sources/libmodplay/source/xm.h | 28 + portlibs/sources/libntfs/Makefile | 32 + portlibs/sources/libntfs/acls.c | 4266 +++++++++++ portlibs/sources/libntfs/acls.h | 199 + portlibs/sources/libntfs/attrib.c | 6773 +++++++++++++++++ portlibs/sources/libntfs/attrib.h | 394 + portlibs/sources/libntfs/attrib_frag.c | 369 + portlibs/sources/libntfs/attrlist.c | 314 + portlibs/sources/libntfs/attrlist.h | 51 + portlibs/sources/libntfs/bit_ops.h | 57 + portlibs/sources/libntfs/bitmap.c | 300 + portlibs/sources/libntfs/bitmap.h | 96 + portlibs/sources/libntfs/bootsect.c | 285 + portlibs/sources/libntfs/bootsect.h | 42 + portlibs/sources/libntfs/cache.c | 609 ++ portlibs/sources/libntfs/cache.h | 118 + portlibs/sources/libntfs/cache2.c | 374 + portlibs/sources/libntfs/cache2.h | 135 + portlibs/sources/libntfs/collate.c | 271 + portlibs/sources/libntfs/collate.h | 34 + portlibs/sources/libntfs/compat.c | 250 + portlibs/sources/libntfs/compat.h | 86 + portlibs/sources/libntfs/compress.c | 1836 +++++ portlibs/sources/libntfs/compress.h | 41 + portlibs/sources/libntfs/config.h | 388 + portlibs/sources/libntfs/debug.c | 79 + portlibs/sources/libntfs/debug.h | 47 + portlibs/sources/libntfs/device.c | 753 ++ portlibs/sources/libntfs/device.h | 134 + portlibs/sources/libntfs/device_io.c | 40 + portlibs/sources/libntfs/device_io.h | 82 + portlibs/sources/libntfs/dir.c | 2661 +++++++ portlibs/sources/libntfs/dir.h | 128 + portlibs/sources/libntfs/efs.c | 439 ++ portlibs/sources/libntfs/efs.h | 30 + portlibs/sources/libntfs/endians.h | 203 + portlibs/sources/libntfs/gekko_io.c | 658 ++ portlibs/sources/libntfs/gekko_io.h | 58 + portlibs/sources/libntfs/index.c | 2085 +++++ portlibs/sources/libntfs/index.h | 167 + portlibs/sources/libntfs/inode.c | 1575 ++++ portlibs/sources/libntfs/inode.h | 225 + portlibs/sources/libntfs/layout.h | 2662 +++++++ portlibs/sources/libntfs/lcnalloc.c | 771 ++ portlibs/sources/libntfs/lcnalloc.h | 51 + portlibs/sources/libntfs/logfile.c | 738 ++ portlibs/sources/libntfs/logfile.h | 394 + portlibs/sources/libntfs/logging.c | 637 ++ portlibs/sources/libntfs/logging.h | 121 + portlibs/sources/libntfs/mem2.h | 27 + portlibs/sources/libntfs/mem_allocate.h | 45 + portlibs/sources/libntfs/mft.c | 1909 +++++ portlibs/sources/libntfs/mft.h | 132 + portlibs/sources/libntfs/misc.c | 65 + portlibs/sources/libntfs/misc.h | 30 + portlibs/sources/libntfs/mst.c | 231 + portlibs/sources/libntfs/mst.h | 34 + portlibs/sources/libntfs/ntfs.c | 662 ++ portlibs/sources/libntfs/ntfs.h | 147 + portlibs/sources/libntfs/ntfsdir.c | 636 ++ portlibs/sources/libntfs/ntfsdir.h | 68 + portlibs/sources/libntfs/ntfsfile.c | 526 ++ portlibs/sources/libntfs/ntfsfile.h | 65 + portlibs/sources/libntfs/ntfsfile_frag.c | 121 + portlibs/sources/libntfs/ntfsfile_frag.h | 15 + portlibs/sources/libntfs/ntfsinternal.c | 868 +++ portlibs/sources/libntfs/ntfsinternal.h | 178 + portlibs/sources/libntfs/ntfstime.h | 121 + portlibs/sources/libntfs/object_id.c | 641 ++ portlibs/sources/libntfs/object_id.h | 35 + portlibs/sources/libntfs/param.h | 101 + portlibs/sources/libntfs/reparse.c | 1227 +++ portlibs/sources/libntfs/reparse.h | 39 + portlibs/sources/libntfs/runlist.c | 2171 ++++++ portlibs/sources/libntfs/runlist.h | 90 + portlibs/sources/libntfs/security.c | 5099 +++++++++++++ portlibs/sources/libntfs/security.h | 361 + portlibs/sources/libntfs/support.h | 85 + portlibs/sources/libntfs/types.h | 141 + portlibs/sources/libntfs/unistr.c | 1521 ++++ portlibs/sources/libntfs/unistr.h | 119 + portlibs/sources/libntfs/volume.c | 1732 +++++ portlibs/sources/libntfs/volume.h | 307 + portlibs/sources/libntfs/xattrs.c | 791 ++ portlibs/sources/libntfs/xattrs.h | 75 + resources/app_booter/Makefile | 158 + resources/app_booter/forwarder.pnproj | 1 + resources/app_booter/forwarder.pnps | 1 + resources/app_booter/readme.txt | 6 + resources/app_booter/source/crt0.s | 21 + resources/app_booter/source/dolloader.c | 56 + resources/app_booter/source/dolloader.h | 17 + resources/app_booter/source/elf_abi.h | 593 ++ resources/app_booter/source/elfloader.c | 92 + resources/app_booter/source/elfloader.h | 16 + resources/app_booter/source/link.ld | 27 + resources/app_booter/source/main.c | 39 + resources/app_booter/source/string.c | 25 + resources/app_booter/source/string.h | 9 + resources/app_booter/source/sync.c | 18 + resources/app_booter/source/sync.h | 8 + resources/dvdskin(original).png | Bin 0 -> 7713 bytes scripts/buildtype.sh | 30 + scripts/rvl.ld | 304 + scripts/svnrev.sh | 42 + source/btnmap.h | 215 + source/channel/MD5.c | 633 ++ source/channel/MD5.h | 244 + source/channel/banner.cpp | 184 + source/channel/banner.h | 85 + source/channel/channel_launcher.c | 301 + source/channel/channel_launcher.h | 25 + source/channel/channels.cpp | 285 + source/channel/channels.h | 84 + source/channel/lz77.c | 218 + source/channel/lz77.h | 34 + source/channel/nand.cpp | 176 + source/channel/nand.hpp | 72 + source/channel/stub.s | 18 + source/cheats/gct.cpp | 363 + source/cheats/gct.h | 94 + source/config/config.cpp | 525 ++ source/config/config.hpp | 73 + source/defines.h | 31 + source/devicemounter/DeviceHandler.cpp | 332 + source/devicemounter/DeviceHandler.hpp | 121 + source/devicemounter/PartitionHandle.cpp | 385 + source/devicemounter/PartitionHandle.h | 218 + source/devicemounter/libwbfs/libwbfs.c | 720 ++ source/devicemounter/libwbfs/libwbfs.h | 239 + source/devicemounter/libwbfs/libwbfs_os.h | 37 + source/devicemounter/libwbfs/rijndael.c | 432 ++ source/devicemounter/libwbfs/wiidisc.c | 370 + source/devicemounter/libwbfs/wiidisc.h | 67 + source/devicemounter/sdhc.c | 228 + source/devicemounter/sdhc.h | 18 + source/devicemounter/usbstorage.c | 297 + source/devicemounter/usbstorage.h | 22 + source/fonts.h | 20 + source/gecko/gecko.c | 123 + source/gecko/gecko.h | 21 + source/gecko/wifi_gecko.c | 135 + source/gecko/wifi_gecko.h | 45 + source/gui/FreeTypeGX.cpp | 705 ++ source/gui/FreeTypeGX.h | 281 + source/gui/GameTDB.cpp | 1006 +++ source/gui/GameTDB.hpp | 160 + source/gui/Metaphrasis.cpp | 384 + source/gui/Metaphrasis.h | 116 + source/gui/Timer.h | 18 + source/gui/WiiMovie.cpp | 352 + source/gui/WiiMovie.hpp | 61 + source/gui/boxmesh.cpp | 186 + source/gui/boxmesh.hpp | 41 + source/gui/coverflow.cpp | 2656 +++++++ source/gui/coverflow.hpp | 343 + source/gui/cursor.cpp | 218 + source/gui/cursor.hpp | 31 + source/gui/fanart.cpp | 301 + source/gui/fanart.hpp | 92 + source/gui/gcvid.cpp | 826 ++ source/gui/gcvid.h | 333 + source/gui/gui.cpp | 917 +++ source/gui/gui.hpp | 159 + source/gui/png.h | 3569 +++++++++ source/gui/pngconf.h | 1481 ++++ source/gui/pngu.c | 1257 +++ source/gui/pngu.h | 174 + source/gui/text.cpp | 482 ++ source/gui/text.hpp | 71 + source/gui/texture.cpp | 538 ++ source/gui/texture.hpp | 36 + source/gui/vector.hpp | 168 + source/gui/video.cpp | 650 ++ source/gui/video.hpp | 119 + source/homebrew/homebrew.cpp | 137 + source/homebrew/homebrew.h | 10 + source/list/cache.cpp | 162 + source/list/cache.hpp | 49 + source/list/cachedlist.cpp | 131 + source/list/cachedlist.hpp | 74 + source/list/list.cpp | 360 + source/list/list.hpp | 32 + source/loader/alt_ios.cpp | 113 + source/loader/alt_ios.h | 18 + source/loader/alt_ios_gen.c | 2 + source/loader/apploader.c | 280 + source/loader/apploader.h | 10 + source/loader/cios.cpp | 105 + source/loader/cios.hpp | 23 + source/loader/codehandler.h | 277 + source/loader/codehandleronly.h | 180 + source/loader/disc.c | 425 ++ source/loader/disc.h | 113 + source/loader/frag.c | 300 + source/loader/frag.h | 51 + source/loader/fs.c | 45 + source/loader/fs.h | 15 + source/loader/fst.c | 648 ++ source/loader/fst.h | 41 + source/loader/multidol.c | 36 + source/loader/multidol.h | 14 + source/loader/patchcode.c | 277 + source/loader/patchcode.h | 42 + source/loader/patchhook.S | 505 ++ source/loader/playlog.c | 129 + source/loader/playlog.h | 18 + source/loader/ppc.h | 83 + source/loader/savefile.c | 113 + source/loader/savefile.h | 17 + source/loader/sha1.c | 172 + source/loader/sha1.h | 12 + source/loader/splits.c | 319 + source/loader/splits.h | 42 + source/loader/sys.c | 115 + source/loader/sys.h | 36 + source/loader/utils.c | 61 + source/loader/utils.h | 49 + source/loader/videopatch.c | 327 + source/loader/videopatch.h | 9 + source/loader/wbfs.c | 369 + source/loader/wbfs.h | 51 + source/loader/wbfs_ext.c | 251 + source/loader/wbfs_ext.h | 27 + source/loader/wdvd.c | 348 + source/loader/wdvd.h | 34 + source/loader/wip.c | 130 + source/loader/wip.h | 17 + source/lockMutex.hpp | 12 + source/main.cpp | 132 + source/memory/mem2.cpp | 245 + source/memory/mem2.hpp | 34 + source/memory/mem2alloc.cpp | 232 + source/memory/mem2alloc.hpp | 42 + source/memory/smartalloc.cpp | 27 + source/memory/smartptr.hpp | 76 + source/menu/menu.cpp | 1774 +++++ source/menu/menu.hpp | 775 ++ source/menu/menu_about.cpp | 159 + source/menu/menu_categories.cpp | 101 + source/menu/menu_cftheme.cpp | 584 ++ source/menu/menu_cheat.cpp | 373 + source/menu/menu_code.cpp | 142 + source/menu/menu_config.cpp | 293 + source/menu/menu_config3.cpp | 177 + source/menu/menu_config4.cpp | 222 + source/menu/menu_config_adv.cpp | 251 + source/menu/menu_config_game.cpp | 617 ++ source/menu/menu_config_screen.cpp | 186 + source/menu/menu_configsnd.cpp | 211 + source/menu/menu_download.cpp | 1018 +++ source/menu/menu_error.cpp | 77 + source/menu/menu_game.cpp | 1147 +++ source/menu/menu_gameinfo.cpp | 617 ++ source/menu/menu_input.cpp | 573 ++ source/menu/menu_main.cpp | 860 +++ source/menu/menu_search.cpp | 46 + source/menu/menu_system.cpp | 271 + source/menu/menu_wbfs.cpp | 263 + source/music/AifDecoder.cpp | 214 + source/music/AifDecoder.hpp | 50 + source/music/BNSDecoder.cpp | 360 + source/music/BNSDecoder.hpp | 59 + source/music/BufferCircle.cpp | 138 + source/music/BufferCircle.hpp | 92 + source/music/File.cpp | 146 + source/music/File.hpp | 30 + source/music/Mp3Decoder.cpp | 214 + source/music/Mp3Decoder.hpp | 51 + source/music/OggDecoder.cpp | 144 + source/music/OggDecoder.hpp | 45 + source/music/SoundDecoder.cpp | 155 + source/music/SoundDecoder.hpp | 90 + source/music/SoundHandler.cpp | 282 + source/music/SoundHandler.hpp | 68 + source/music/WavDecoder.cpp | 154 + source/music/WavDecoder.hpp | 75 + source/music/gui_sound.cpp | 509 ++ source/music/gui_sound.h | 105 + source/music/musicplayer.cpp | 167 + source/music/musicplayer.h | 63 + source/network/dns.c | 119 + source/network/dns.h | 14 + source/network/gcard.c | 66 + source/network/gcard.h | 18 + source/network/http.c | 225 + source/network/http.h | 33 + source/safe_vector.hpp | 96 + source/svnrev.h | 1 + source/unzip/U8Archive.c | 75 + source/unzip/U8Archive.h | 69 + source/unzip/ZipFile.cpp | 178 + source/unzip/ZipFile.h | 58 + source/unzip/crypt.h | 126 + source/unzip/inflate.c | 62 + source/unzip/inflate.h | 18 + source/unzip/ioapi.c | 177 + source/unzip/ioapi.h | 74 + source/unzip/miniunz.c | 280 + source/unzip/miniunz.h | 17 + source/unzip/mztools.c | 281 + source/unzip/mztools.h | 31 + source/unzip/unzip.c | 1574 ++++ source/unzip/unzip.h | 354 + source/wstringEx/wstringEx.cpp | 152 + source/wstringEx/wstringEx.hpp | 21 + wii/apps/wiiflow/icon.png | Bin 0 -> 19236 bytes wii/apps/wiiflow/meta.xml | 50 + wii/apps/wiiflow/wiiflow.ini | 121 + wii/docs/Controls.txt | 40 + wii/docs/FAQ.txt | 73 + wii/docs/Readme.txt | 97 + wii/wiiflow/Languages/arab.ini | 177 + wii/wiiflow/Languages/brazilian.ini | 177 + wii/wiiflow/Languages/chinese_s.ini | 184 + wii/wiiflow/Languages/chinese_t.ini | 132 + wii/wiiflow/Languages/danish.ini | 196 + wii/wiiflow/Languages/dutch.ini | 177 + wii/wiiflow/Languages/english.ini | 177 + wii/wiiflow/Languages/finnish.ini | 132 + wii/wiiflow/Languages/french.ini | 177 + wii/wiiflow/Languages/gallego.ini | 133 + wii/wiiflow/Languages/german.ini | 177 + wii/wiiflow/Languages/hungarian.ini | 132 + wii/wiiflow/Languages/italian.ini | 177 + wii/wiiflow/Languages/japanese.ini | 197 + wii/wiiflow/Languages/norwegian.ini | 186 + wii/wiiflow/Languages/polish.ini | 132 + wii/wiiflow/Languages/portuguese.ini | 181 + wii/wiiflow/Languages/russian.ini | 132 + wii/wiiflow/Languages/spanish.ini | 177 + wii/wiiflow/Languages/swedish.ini | 132 + wii/wiiflow/Languages/tagalog.ini | 132 + wii/wiiflow/Languages/turkish.ini | 132 + wii/wiiflow/boxcovers/JODI.png | Bin 0 -> 410197 bytes wii/wiiflow/fanart/GAMEID.ini | 34 + wii/wiiflow/settings/gameconfig1.ini | 19 + wii/wiiflow/settings/gameconfig2.ini | 20 + wii/wiiflow/themes/default.ini | 1239 +++ wiiflow.pnproj | 1 + wiiflow.pnps | 1 + 737 files changed, 191406 insertions(+) create mode 100644 Makefile create mode 100644 data/app_booter.bin create mode 100644 data/images/background.png create mode 100644 data/images/balanceboard.png create mode 100644 data/images/balanceboardR.png create mode 100644 data/images/btnchannel.png create mode 100644 data/images/btnchannels.png create mode 100644 data/images/btnconfig.png create mode 100644 data/images/btnconfigs.png create mode 100644 data/images/btndvd.png create mode 100644 data/images/btndvds.png create mode 100644 data/images/btngamecfg.png create mode 100644 data/images/btngamecfgs.png create mode 100644 data/images/btnhomebrew.png create mode 100644 data/images/btninfo.png create mode 100644 data/images/btninfos.png create mode 100644 data/images/btnminus.png create mode 100644 data/images/btnminuss.png create mode 100644 data/images/btnnext.png create mode 100644 data/images/btnnexts.png create mode 100644 data/images/btnplus.png create mode 100644 data/images/btnpluss.png create mode 100644 data/images/btnprev.png create mode 100644 data/images/btnprevs.png create mode 100644 data/images/btnquit.png create mode 100644 data/images/btnquits.png create mode 100644 data/images/btnusb.png create mode 100644 data/images/btnusbs.png create mode 100644 data/images/butcenter.png create mode 100644 data/images/butleft.png create mode 100644 data/images/butright.png create mode 100644 data/images/butscenter.png create mode 100644 data/images/butsleft.png create mode 100644 data/images/butsright.png create mode 100644 data/images/cero_a.png create mode 100644 data/images/cero_b.png create mode 100644 data/images/cero_c.png create mode 100644 data/images/cero_d.png create mode 100644 data/images/cero_z.png create mode 100644 data/images/classiccontroller.png create mode 100644 data/images/dancepad.png create mode 100644 data/images/dancepadR.png create mode 100644 data/images/delete.png create mode 100644 data/images/deletes.png create mode 100644 data/images/drums.png create mode 100644 data/images/drumsR.png create mode 100644 data/images/dvdskin.png create mode 100644 data/images/dvdskin_black.png create mode 100644 data/images/dvdskin_red.png create mode 100644 data/images/error.png create mode 100644 data/images/esrb_ao.png create mode 100644 data/images/esrb_e.png create mode 100644 data/images/esrb_ec.png create mode 100644 data/images/esrb_eten.png create mode 100644 data/images/esrb_m.png create mode 100644 data/images/esrb_t.png create mode 100644 data/images/favoritesoff.png create mode 100644 data/images/favoritesoffs.png create mode 100644 data/images/favoriteson.png create mode 100644 data/images/favoritesons.png create mode 100644 data/images/flatloading.png create mode 100644 data/images/flatnopic.png create mode 100644 data/images/gcncontroller.png create mode 100644 data/images/generic_point.png create mode 100644 data/images/guitar.png create mode 100644 data/images/guitarR.png create mode 100644 data/images/loading.png create mode 100644 data/images/microphone.png create mode 100644 data/images/microphoneR.png create mode 100644 data/images/motionplus.png create mode 100644 data/images/motionplusR.png create mode 100644 data/images/nopic.png create mode 100644 data/images/norating.png create mode 100644 data/images/nunchuk.png create mode 100644 data/images/nunchukR.png create mode 100644 data/images/pbarcenter.png create mode 100644 data/images/pbarcenters.png create mode 100644 data/images/pbarleft.png create mode 100644 data/images/pbarlefts.png create mode 100644 data/images/pbarright.png create mode 100644 data/images/pbarrights.png create mode 100644 data/images/pegi_12.png create mode 100644 data/images/pegi_16.png create mode 100644 data/images/pegi_18.png create mode 100644 data/images/pegi_3.png create mode 100644 data/images/pegi_7.png create mode 100644 data/images/player1_point.png create mode 100644 data/images/player2_point.png create mode 100644 data/images/player3_point.png create mode 100644 data/images/player4_point.png create mode 100644 data/images/stopkidoff.png create mode 100644 data/images/stopkidoffs.png create mode 100644 data/images/stopkidon.png create mode 100644 data/images/stopkidons.png create mode 100644 data/images/wait_01.png create mode 100644 data/images/wait_02.png create mode 100644 data/images/wait_03.png create mode 100644 data/images/wait_04.png create mode 100644 data/images/wait_05.png create mode 100644 data/images/wait_06.png create mode 100644 data/images/wait_07.png create mode 100644 data/images/wait_08.png create mode 100644 data/images/wait_09.png create mode 100644 data/images/wait_10.png create mode 100644 data/images/wheel.png create mode 100644 data/images/wifi1.png create mode 100644 data/images/wifi12.png create mode 100644 data/images/wifi16.png create mode 100644 data/images/wifi2.png create mode 100644 data/images/wifi3.png create mode 100644 data/images/wifi32.png create mode 100644 data/images/wifi4.png create mode 100644 data/images/wifi8.png create mode 100644 data/images/wiimote1.png create mode 100644 data/images/wiimote2.png create mode 100644 data/images/wiimote3.png create mode 100644 data/images/wiimote4.png create mode 100644 data/images/wiimote8.png create mode 100644 data/images/wiispeak.png create mode 100644 data/images/zapper.png create mode 100644 data/sounds/camera.wav create mode 100644 data/sounds/click.wav create mode 100644 data/sounds/hover.wav create mode 100644 docs/Content.txt create mode 100644 docs/Requirements.txt create mode 100644 docs/versions.txt create mode 100644 portlibs/include/ext2.h create mode 100644 portlibs/include/ext2_frag.h create mode 100644 portlibs/include/fat.h create mode 100644 portlibs/include/fatfile_frag.h create mode 100644 portlibs/include/freetype/config/ftconfig.h create mode 100644 portlibs/include/freetype/config/ftheader.h create mode 100644 portlibs/include/freetype/config/ftmodule.h create mode 100644 portlibs/include/freetype/config/ftoption.h create mode 100644 portlibs/include/freetype/config/ftstdlib.h create mode 100644 portlibs/include/freetype/freetype.h create mode 100644 portlibs/include/freetype/ftadvanc.h create mode 100644 portlibs/include/freetype/ftbbox.h create mode 100644 portlibs/include/freetype/ftbdf.h create mode 100644 portlibs/include/freetype/ftbitmap.h create mode 100644 portlibs/include/freetype/ftcache.h create mode 100644 portlibs/include/freetype/ftchapters.h create mode 100644 portlibs/include/freetype/ftcid.h create mode 100644 portlibs/include/freetype/fterrdef.h create mode 100644 portlibs/include/freetype/fterrors.h create mode 100644 portlibs/include/freetype/ftgasp.h create mode 100644 portlibs/include/freetype/ftglyph.h create mode 100644 portlibs/include/freetype/ftgxval.h create mode 100644 portlibs/include/freetype/ftgzip.h create mode 100644 portlibs/include/freetype/ftimage.h create mode 100644 portlibs/include/freetype/ftincrem.h create mode 100644 portlibs/include/freetype/ftlcdfil.h create mode 100644 portlibs/include/freetype/ftlist.h create mode 100644 portlibs/include/freetype/ftlzw.h create mode 100644 portlibs/include/freetype/ftmac.h create mode 100644 portlibs/include/freetype/ftmm.h create mode 100644 portlibs/include/freetype/ftmodapi.h create mode 100644 portlibs/include/freetype/ftmoderr.h create mode 100644 portlibs/include/freetype/ftotval.h create mode 100644 portlibs/include/freetype/ftoutln.h create mode 100644 portlibs/include/freetype/ftpfr.h create mode 100644 portlibs/include/freetype/ftrender.h create mode 100644 portlibs/include/freetype/ftsizes.h create mode 100644 portlibs/include/freetype/ftsnames.h create mode 100644 portlibs/include/freetype/ftstroke.h create mode 100644 portlibs/include/freetype/ftsynth.h create mode 100644 portlibs/include/freetype/ftsystem.h create mode 100644 portlibs/include/freetype/fttrigon.h create mode 100644 portlibs/include/freetype/fttypes.h create mode 100644 portlibs/include/freetype/ftwinfnt.h create mode 100644 portlibs/include/freetype/ftxf86.h create mode 100644 portlibs/include/freetype/internal/autohint.h create mode 100644 portlibs/include/freetype/internal/ftcalc.h create mode 100644 portlibs/include/freetype/internal/ftdebug.h create mode 100644 portlibs/include/freetype/internal/ftdriver.h create mode 100644 portlibs/include/freetype/internal/ftgloadr.h create mode 100644 portlibs/include/freetype/internal/ftmemory.h create mode 100644 portlibs/include/freetype/internal/ftobjs.h create mode 100644 portlibs/include/freetype/internal/ftrfork.h create mode 100644 portlibs/include/freetype/internal/ftserv.h create mode 100644 portlibs/include/freetype/internal/ftstream.h create mode 100644 portlibs/include/freetype/internal/fttrace.h create mode 100644 portlibs/include/freetype/internal/ftvalid.h create mode 100644 portlibs/include/freetype/internal/internal.h create mode 100644 portlibs/include/freetype/internal/pcftypes.h create mode 100644 portlibs/include/freetype/internal/psaux.h create mode 100644 portlibs/include/freetype/internal/pshints.h create mode 100644 portlibs/include/freetype/internal/services/svbdf.h create mode 100644 portlibs/include/freetype/internal/services/svcid.h create mode 100644 portlibs/include/freetype/internal/services/svgldict.h create mode 100644 portlibs/include/freetype/internal/services/svgxval.h create mode 100644 portlibs/include/freetype/internal/services/svkern.h create mode 100644 portlibs/include/freetype/internal/services/svmm.h create mode 100644 portlibs/include/freetype/internal/services/svotval.h create mode 100644 portlibs/include/freetype/internal/services/svpfr.h create mode 100644 portlibs/include/freetype/internal/services/svpostnm.h create mode 100644 portlibs/include/freetype/internal/services/svpscmap.h create mode 100644 portlibs/include/freetype/internal/services/svpsinfo.h create mode 100644 portlibs/include/freetype/internal/services/svsfnt.h create mode 100644 portlibs/include/freetype/internal/services/svttcmap.h create mode 100644 portlibs/include/freetype/internal/services/svtteng.h create mode 100644 portlibs/include/freetype/internal/services/svttglyf.h create mode 100644 portlibs/include/freetype/internal/services/svwinfnt.h create mode 100644 portlibs/include/freetype/internal/services/svxf86nm.h create mode 100644 portlibs/include/freetype/internal/sfnt.h create mode 100644 portlibs/include/freetype/internal/t1types.h create mode 100644 portlibs/include/freetype/internal/tttypes.h create mode 100644 portlibs/include/freetype/t1tables.h create mode 100644 portlibs/include/freetype/ttnameid.h create mode 100644 portlibs/include/freetype/tttables.h create mode 100644 portlibs/include/freetype/tttags.h create mode 100644 portlibs/include/freetype/ttunpat.h create mode 100644 portlibs/include/ft2build.h create mode 100644 portlibs/include/jconfig.h create mode 100644 portlibs/include/jerror.h create mode 100644 portlibs/include/jmorecfg.h create mode 100644 portlibs/include/jpeglib.h create mode 100644 portlibs/include/modplay/defines.h create mode 100644 portlibs/include/modplay/envelope.h create mode 100644 portlibs/include/modplay/mixer.h create mode 100644 portlibs/include/modplay/modplay.h create mode 100644 portlibs/include/modplay/modplay_core.h create mode 100644 portlibs/include/ntfs.h create mode 100644 portlibs/include/ntfsfile_frag.h create mode 100644 portlibs/include/pngconf.h create mode 100644 portlibs/include/pngu/pngu.h create mode 100644 portlibs/include/tremor/config_types.h create mode 100644 portlibs/include/tremor/ivorbiscodec.h create mode 100644 portlibs/include/tremor/ivorbisfile.h create mode 100644 portlibs/include/tremor/ogg.h create mode 100644 portlibs/include/tremor/os_types.h create mode 100644 portlibs/include/wiilight.h create mode 100644 portlibs/include/zconf.h create mode 100644 portlibs/include/zlib.h create mode 100644 portlibs/sources/libext2fs/AUTHORS create mode 100644 portlibs/sources/libext2fs/CREDITS create mode 100644 portlibs/sources/libext2fs/LICENSE create mode 100644 portlibs/sources/libext2fs/Makefile create mode 100644 portlibs/sources/libext2fs/include/ext2.h create mode 100644 portlibs/sources/libext2fs/source/Makefile create mode 100644 portlibs/sources/libext2fs/source/alloc.c create mode 100644 portlibs/sources/libext2fs/source/alloc_sb.c create mode 100644 portlibs/sources/libext2fs/source/alloc_stats.c create mode 100644 portlibs/sources/libext2fs/source/alloc_tables.c create mode 100644 portlibs/sources/libext2fs/source/badblocks.c create mode 100644 portlibs/sources/libext2fs/source/bb_compat.c create mode 100644 portlibs/sources/libext2fs/source/bb_inode.c create mode 100644 portlibs/sources/libext2fs/source/bit_ops.h create mode 100644 portlibs/sources/libext2fs/source/bitmaps.c create mode 100644 portlibs/sources/libext2fs/source/bitops.c create mode 100644 portlibs/sources/libext2fs/source/bitops.h create mode 100644 portlibs/sources/libext2fs/source/blkmap64_ba.c create mode 100644 portlibs/sources/libext2fs/source/blknum.c create mode 100644 portlibs/sources/libext2fs/source/block.c create mode 100644 portlibs/sources/libext2fs/source/bmap.c create mode 100644 portlibs/sources/libext2fs/source/bmap64.h create mode 100644 portlibs/sources/libext2fs/source/bmove.c create mode 100644 portlibs/sources/libext2fs/source/brel.h create mode 100644 portlibs/sources/libext2fs/source/brel_ma.c create mode 100644 portlibs/sources/libext2fs/source/check_desc.c create mode 100644 portlibs/sources/libext2fs/source/closefs.c create mode 100644 portlibs/sources/libext2fs/source/com_err.c create mode 100644 portlibs/sources/libext2fs/source/com_err.h create mode 100644 portlibs/sources/libext2fs/source/config.h create mode 100644 portlibs/sources/libext2fs/source/crc16.c create mode 100644 portlibs/sources/libext2fs/source/crc16.h create mode 100644 portlibs/sources/libext2fs/source/csum.c create mode 100644 portlibs/sources/libext2fs/source/dblist.c create mode 100644 portlibs/sources/libext2fs/source/dblist_dir.c create mode 100644 portlibs/sources/libext2fs/source/dir_iterate.c create mode 100644 portlibs/sources/libext2fs/source/dirblock.c create mode 100644 portlibs/sources/libext2fs/source/dirhash.c create mode 100644 portlibs/sources/libext2fs/source/disc_cache.c create mode 100644 portlibs/sources/libext2fs/source/disc_cache.h create mode 100644 portlibs/sources/libext2fs/source/dupfs.c create mode 100644 portlibs/sources/libext2fs/source/e2image.h create mode 100644 portlibs/sources/libext2fs/source/expanddir.c create mode 100644 portlibs/sources/libext2fs/source/ext2.c create mode 100644 portlibs/sources/libext2fs/source/ext2_err.h create mode 100644 portlibs/sources/libext2fs/source/ext2_ext_attr.h create mode 100644 portlibs/sources/libext2fs/source/ext2_frag.c create mode 100644 portlibs/sources/libext2fs/source/ext2_frag.h create mode 100644 portlibs/sources/libext2fs/source/ext2_fs.h create mode 100644 portlibs/sources/libext2fs/source/ext2_internal.c create mode 100644 portlibs/sources/libext2fs/source/ext2_internal.h create mode 100644 portlibs/sources/libext2fs/source/ext2_io.h create mode 100644 portlibs/sources/libext2fs/source/ext2_types.h create mode 100644 portlibs/sources/libext2fs/source/ext2dir.c create mode 100644 portlibs/sources/libext2fs/source/ext2dir.h create mode 100644 portlibs/sources/libext2fs/source/ext2file.c create mode 100644 portlibs/sources/libext2fs/source/ext2file.h create mode 100644 portlibs/sources/libext2fs/source/ext2fs.h create mode 100644 portlibs/sources/libext2fs/source/ext2fsP.h create mode 100644 portlibs/sources/libext2fs/source/ext3_extents.h create mode 100644 portlibs/sources/libext2fs/source/ext_attr.c create mode 100644 portlibs/sources/libext2fs/source/extent.c create mode 100644 portlibs/sources/libext2fs/source/fiemap.h create mode 100644 portlibs/sources/libext2fs/source/fileio.c create mode 100644 portlibs/sources/libext2fs/source/finddev.c create mode 100644 portlibs/sources/libext2fs/source/flushb.c create mode 100644 portlibs/sources/libext2fs/source/freefs.c create mode 100644 portlibs/sources/libext2fs/source/gekko_io.c create mode 100644 portlibs/sources/libext2fs/source/gekko_io.h create mode 100644 portlibs/sources/libext2fs/source/gen_bitmap.c create mode 100644 portlibs/sources/libext2fs/source/gen_bitmap64.c create mode 100644 portlibs/sources/libext2fs/source/get_pathname.c create mode 100644 portlibs/sources/libext2fs/source/getsectsize.c create mode 100644 portlibs/sources/libext2fs/source/getsize.c create mode 100644 portlibs/sources/libext2fs/source/i_block.c create mode 100644 portlibs/sources/libext2fs/source/icount.c create mode 100644 portlibs/sources/libext2fs/source/imager.c create mode 100644 portlibs/sources/libext2fs/source/ind_block.c create mode 100644 portlibs/sources/libext2fs/source/initialize.c create mode 100644 portlibs/sources/libext2fs/source/inline.c create mode 100644 portlibs/sources/libext2fs/source/inode.c create mode 100644 portlibs/sources/libext2fs/source/inode_io.c create mode 100644 portlibs/sources/libext2fs/source/io_manager.c create mode 100644 portlibs/sources/libext2fs/source/irel.h create mode 100644 portlibs/sources/libext2fs/source/irel_ma.c create mode 100644 portlibs/sources/libext2fs/source/ismounted.c create mode 100644 portlibs/sources/libext2fs/source/jfs_compat.h create mode 100644 portlibs/sources/libext2fs/source/jfs_dat.h create mode 100644 portlibs/sources/libext2fs/source/jfs_user.h create mode 100644 portlibs/sources/libext2fs/source/kernel-jbd.h create mode 100644 portlibs/sources/libext2fs/source/kernel-list.h create mode 100644 portlibs/sources/libext2fs/source/link.c create mode 100644 portlibs/sources/libext2fs/source/llseek.c create mode 100644 portlibs/sources/libext2fs/source/lookup.c create mode 100644 portlibs/sources/libext2fs/source/mem2.h create mode 100644 portlibs/sources/libext2fs/source/mem_allocate.h create mode 100644 portlibs/sources/libext2fs/source/mkdir.c create mode 100644 portlibs/sources/libext2fs/source/mkjournal.c create mode 100644 portlibs/sources/libext2fs/source/namei.c create mode 100644 portlibs/sources/libext2fs/source/native.c create mode 100644 portlibs/sources/libext2fs/source/newdir.c create mode 100644 portlibs/sources/libext2fs/source/openfs.c create mode 100644 portlibs/sources/libext2fs/source/partitions.h create mode 100644 portlibs/sources/libext2fs/source/progress.c create mode 100644 portlibs/sources/libext2fs/source/punch.c create mode 100644 portlibs/sources/libext2fs/source/read_bb.c create mode 100644 portlibs/sources/libext2fs/source/read_bb_file.c create mode 100644 portlibs/sources/libext2fs/source/res_gdt.c create mode 100644 portlibs/sources/libext2fs/source/rw_bitmaps.c create mode 100644 portlibs/sources/libext2fs/source/sparse.c create mode 100644 portlibs/sources/libext2fs/source/swapfs.c create mode 100644 portlibs/sources/libext2fs/source/tdb.c create mode 100644 portlibs/sources/libext2fs/source/tdb.h create mode 100644 portlibs/sources/libext2fs/source/unlink.c create mode 100644 portlibs/sources/libext2fs/source/valid_blk.c create mode 100644 portlibs/sources/libext2fs/source/version.c create mode 100644 portlibs/sources/libext2fs/source/write_bb_file.c create mode 100644 portlibs/sources/libfat/Makefile create mode 100644 portlibs/sources/libfat/bit_ops.h create mode 100644 portlibs/sources/libfat/cache.c create mode 100644 portlibs/sources/libfat/cache.h create mode 100644 portlibs/sources/libfat/common.h create mode 100644 portlibs/sources/libfat/directory.c create mode 100644 portlibs/sources/libfat/directory.h create mode 100644 portlibs/sources/libfat/disc.c create mode 100644 portlibs/sources/libfat/disc.h create mode 100644 portlibs/sources/libfat/fat.h create mode 100644 portlibs/sources/libfat/fatdir.c create mode 100644 portlibs/sources/libfat/fatdir.h create mode 100644 portlibs/sources/libfat/fatfile.c create mode 100644 portlibs/sources/libfat/fatfile.h create mode 100644 portlibs/sources/libfat/fatfile_frag.c create mode 100644 portlibs/sources/libfat/fatfile_frag.h create mode 100644 portlibs/sources/libfat/file_allocation_table.c create mode 100644 portlibs/sources/libfat/file_allocation_table.h create mode 100644 portlibs/sources/libfat/filetime.c create mode 100644 portlibs/sources/libfat/filetime.h create mode 100644 portlibs/sources/libfat/libfat.c create mode 100644 portlibs/sources/libfat/libfatversion.h create mode 100644 portlibs/sources/libfat/lock.c create mode 100644 portlibs/sources/libfat/lock.h create mode 100644 portlibs/sources/libfat/mem2.h create mode 100644 portlibs/sources/libfat/mem_allocate.h create mode 100644 portlibs/sources/libfat/partition.c create mode 100644 portlibs/sources/libfat/partition.h create mode 100644 portlibs/sources/libmodplay/Makefile create mode 100644 portlibs/sources/libmodplay/source/defines.h create mode 100644 portlibs/sources/libmodplay/source/effects.c create mode 100644 portlibs/sources/libmodplay/source/effects.h create mode 100644 portlibs/sources/libmodplay/source/envelope.c create mode 100644 portlibs/sources/libmodplay/source/envelope.h create mode 100644 portlibs/sources/libmodplay/source/mixer.c create mode 100644 portlibs/sources/libmodplay/source/mixer.h create mode 100644 portlibs/sources/libmodplay/source/mod.c create mode 100644 portlibs/sources/libmodplay/source/mod.h create mode 100644 portlibs/sources/libmodplay/source/modplay.c create mode 100644 portlibs/sources/libmodplay/source/modplay.h create mode 100644 portlibs/sources/libmodplay/source/modplay_core.c create mode 100644 portlibs/sources/libmodplay/source/modplay_core.h create mode 100644 portlibs/sources/libmodplay/source/s3m.c create mode 100644 portlibs/sources/libmodplay/source/s3m.h create mode 100644 portlibs/sources/libmodplay/source/xm.c create mode 100644 portlibs/sources/libmodplay/source/xm.h create mode 100644 portlibs/sources/libntfs/Makefile create mode 100644 portlibs/sources/libntfs/acls.c create mode 100644 portlibs/sources/libntfs/acls.h create mode 100644 portlibs/sources/libntfs/attrib.c create mode 100644 portlibs/sources/libntfs/attrib.h create mode 100644 portlibs/sources/libntfs/attrib_frag.c create mode 100644 portlibs/sources/libntfs/attrlist.c create mode 100644 portlibs/sources/libntfs/attrlist.h create mode 100644 portlibs/sources/libntfs/bit_ops.h create mode 100644 portlibs/sources/libntfs/bitmap.c create mode 100644 portlibs/sources/libntfs/bitmap.h create mode 100644 portlibs/sources/libntfs/bootsect.c create mode 100644 portlibs/sources/libntfs/bootsect.h create mode 100644 portlibs/sources/libntfs/cache.c create mode 100644 portlibs/sources/libntfs/cache.h create mode 100644 portlibs/sources/libntfs/cache2.c create mode 100644 portlibs/sources/libntfs/cache2.h create mode 100644 portlibs/sources/libntfs/collate.c create mode 100644 portlibs/sources/libntfs/collate.h create mode 100644 portlibs/sources/libntfs/compat.c create mode 100644 portlibs/sources/libntfs/compat.h create mode 100644 portlibs/sources/libntfs/compress.c create mode 100644 portlibs/sources/libntfs/compress.h create mode 100644 portlibs/sources/libntfs/config.h create mode 100644 portlibs/sources/libntfs/debug.c create mode 100644 portlibs/sources/libntfs/debug.h create mode 100644 portlibs/sources/libntfs/device.c create mode 100644 portlibs/sources/libntfs/device.h create mode 100644 portlibs/sources/libntfs/device_io.c create mode 100644 portlibs/sources/libntfs/device_io.h create mode 100644 portlibs/sources/libntfs/dir.c create mode 100644 portlibs/sources/libntfs/dir.h create mode 100644 portlibs/sources/libntfs/efs.c create mode 100644 portlibs/sources/libntfs/efs.h create mode 100644 portlibs/sources/libntfs/endians.h create mode 100644 portlibs/sources/libntfs/gekko_io.c create mode 100644 portlibs/sources/libntfs/gekko_io.h create mode 100644 portlibs/sources/libntfs/index.c create mode 100644 portlibs/sources/libntfs/index.h create mode 100644 portlibs/sources/libntfs/inode.c create mode 100644 portlibs/sources/libntfs/inode.h create mode 100644 portlibs/sources/libntfs/layout.h create mode 100644 portlibs/sources/libntfs/lcnalloc.c create mode 100644 portlibs/sources/libntfs/lcnalloc.h create mode 100644 portlibs/sources/libntfs/logfile.c create mode 100644 portlibs/sources/libntfs/logfile.h create mode 100644 portlibs/sources/libntfs/logging.c create mode 100644 portlibs/sources/libntfs/logging.h create mode 100644 portlibs/sources/libntfs/mem2.h create mode 100644 portlibs/sources/libntfs/mem_allocate.h create mode 100644 portlibs/sources/libntfs/mft.c create mode 100644 portlibs/sources/libntfs/mft.h create mode 100644 portlibs/sources/libntfs/misc.c create mode 100644 portlibs/sources/libntfs/misc.h create mode 100644 portlibs/sources/libntfs/mst.c create mode 100644 portlibs/sources/libntfs/mst.h create mode 100644 portlibs/sources/libntfs/ntfs.c create mode 100644 portlibs/sources/libntfs/ntfs.h create mode 100644 portlibs/sources/libntfs/ntfsdir.c create mode 100644 portlibs/sources/libntfs/ntfsdir.h create mode 100644 portlibs/sources/libntfs/ntfsfile.c create mode 100644 portlibs/sources/libntfs/ntfsfile.h create mode 100644 portlibs/sources/libntfs/ntfsfile_frag.c create mode 100644 portlibs/sources/libntfs/ntfsfile_frag.h create mode 100644 portlibs/sources/libntfs/ntfsinternal.c create mode 100644 portlibs/sources/libntfs/ntfsinternal.h create mode 100644 portlibs/sources/libntfs/ntfstime.h create mode 100644 portlibs/sources/libntfs/object_id.c create mode 100644 portlibs/sources/libntfs/object_id.h create mode 100644 portlibs/sources/libntfs/param.h create mode 100644 portlibs/sources/libntfs/reparse.c create mode 100644 portlibs/sources/libntfs/reparse.h create mode 100644 portlibs/sources/libntfs/runlist.c create mode 100644 portlibs/sources/libntfs/runlist.h create mode 100644 portlibs/sources/libntfs/security.c create mode 100644 portlibs/sources/libntfs/security.h create mode 100644 portlibs/sources/libntfs/support.h create mode 100644 portlibs/sources/libntfs/types.h create mode 100644 portlibs/sources/libntfs/unistr.c create mode 100644 portlibs/sources/libntfs/unistr.h create mode 100644 portlibs/sources/libntfs/volume.c create mode 100644 portlibs/sources/libntfs/volume.h create mode 100644 portlibs/sources/libntfs/xattrs.c create mode 100644 portlibs/sources/libntfs/xattrs.h create mode 100644 resources/app_booter/Makefile create mode 100644 resources/app_booter/forwarder.pnproj create mode 100644 resources/app_booter/forwarder.pnps create mode 100644 resources/app_booter/readme.txt create mode 100644 resources/app_booter/source/crt0.s create mode 100644 resources/app_booter/source/dolloader.c create mode 100644 resources/app_booter/source/dolloader.h create mode 100644 resources/app_booter/source/elf_abi.h create mode 100644 resources/app_booter/source/elfloader.c create mode 100644 resources/app_booter/source/elfloader.h create mode 100644 resources/app_booter/source/link.ld create mode 100644 resources/app_booter/source/main.c create mode 100644 resources/app_booter/source/string.c create mode 100644 resources/app_booter/source/string.h create mode 100644 resources/app_booter/source/sync.c create mode 100644 resources/app_booter/source/sync.h create mode 100644 resources/dvdskin(original).png create mode 100644 scripts/buildtype.sh create mode 100644 scripts/rvl.ld create mode 100644 scripts/svnrev.sh create mode 100644 source/btnmap.h create mode 100644 source/channel/MD5.c create mode 100644 source/channel/MD5.h create mode 100644 source/channel/banner.cpp create mode 100644 source/channel/banner.h create mode 100644 source/channel/channel_launcher.c create mode 100644 source/channel/channel_launcher.h create mode 100644 source/channel/channels.cpp create mode 100644 source/channel/channels.h create mode 100644 source/channel/lz77.c create mode 100644 source/channel/lz77.h create mode 100644 source/channel/nand.cpp create mode 100644 source/channel/nand.hpp create mode 100644 source/channel/stub.s create mode 100644 source/cheats/gct.cpp create mode 100644 source/cheats/gct.h create mode 100644 source/config/config.cpp create mode 100644 source/config/config.hpp create mode 100644 source/defines.h create mode 100644 source/devicemounter/DeviceHandler.cpp create mode 100644 source/devicemounter/DeviceHandler.hpp create mode 100644 source/devicemounter/PartitionHandle.cpp create mode 100644 source/devicemounter/PartitionHandle.h create mode 100644 source/devicemounter/libwbfs/libwbfs.c create mode 100644 source/devicemounter/libwbfs/libwbfs.h create mode 100644 source/devicemounter/libwbfs/libwbfs_os.h create mode 100644 source/devicemounter/libwbfs/rijndael.c create mode 100644 source/devicemounter/libwbfs/wiidisc.c create mode 100644 source/devicemounter/libwbfs/wiidisc.h create mode 100644 source/devicemounter/sdhc.c create mode 100644 source/devicemounter/sdhc.h create mode 100644 source/devicemounter/usbstorage.c create mode 100644 source/devicemounter/usbstorage.h create mode 100644 source/fonts.h create mode 100644 source/gecko/gecko.c create mode 100644 source/gecko/gecko.h create mode 100644 source/gecko/wifi_gecko.c create mode 100644 source/gecko/wifi_gecko.h create mode 100644 source/gui/FreeTypeGX.cpp create mode 100644 source/gui/FreeTypeGX.h create mode 100644 source/gui/GameTDB.cpp create mode 100644 source/gui/GameTDB.hpp create mode 100644 source/gui/Metaphrasis.cpp create mode 100644 source/gui/Metaphrasis.h create mode 100644 source/gui/Timer.h create mode 100644 source/gui/WiiMovie.cpp create mode 100644 source/gui/WiiMovie.hpp create mode 100644 source/gui/boxmesh.cpp create mode 100644 source/gui/boxmesh.hpp create mode 100644 source/gui/coverflow.cpp create mode 100644 source/gui/coverflow.hpp create mode 100644 source/gui/cursor.cpp create mode 100644 source/gui/cursor.hpp create mode 100644 source/gui/fanart.cpp create mode 100644 source/gui/fanart.hpp create mode 100644 source/gui/gcvid.cpp create mode 100644 source/gui/gcvid.h create mode 100644 source/gui/gui.cpp create mode 100644 source/gui/gui.hpp create mode 100644 source/gui/png.h create mode 100644 source/gui/pngconf.h create mode 100644 source/gui/pngu.c create mode 100644 source/gui/pngu.h create mode 100644 source/gui/text.cpp create mode 100644 source/gui/text.hpp create mode 100644 source/gui/texture.cpp create mode 100644 source/gui/texture.hpp create mode 100644 source/gui/vector.hpp create mode 100644 source/gui/video.cpp create mode 100644 source/gui/video.hpp create mode 100644 source/homebrew/homebrew.cpp create mode 100644 source/homebrew/homebrew.h create mode 100644 source/list/cache.cpp create mode 100644 source/list/cache.hpp create mode 100644 source/list/cachedlist.cpp create mode 100644 source/list/cachedlist.hpp create mode 100644 source/list/list.cpp create mode 100644 source/list/list.hpp create mode 100644 source/loader/alt_ios.cpp create mode 100644 source/loader/alt_ios.h create mode 100644 source/loader/alt_ios_gen.c create mode 100644 source/loader/apploader.c create mode 100644 source/loader/apploader.h create mode 100644 source/loader/cios.cpp create mode 100644 source/loader/cios.hpp create mode 100644 source/loader/codehandler.h create mode 100644 source/loader/codehandleronly.h create mode 100644 source/loader/disc.c create mode 100644 source/loader/disc.h create mode 100644 source/loader/frag.c create mode 100644 source/loader/frag.h create mode 100644 source/loader/fs.c create mode 100644 source/loader/fs.h create mode 100644 source/loader/fst.c create mode 100644 source/loader/fst.h create mode 100644 source/loader/multidol.c create mode 100644 source/loader/multidol.h create mode 100644 source/loader/patchcode.c create mode 100644 source/loader/patchcode.h create mode 100644 source/loader/patchhook.S create mode 100644 source/loader/playlog.c create mode 100644 source/loader/playlog.h create mode 100644 source/loader/ppc.h create mode 100644 source/loader/savefile.c create mode 100644 source/loader/savefile.h create mode 100644 source/loader/sha1.c create mode 100644 source/loader/sha1.h create mode 100644 source/loader/splits.c create mode 100644 source/loader/splits.h create mode 100644 source/loader/sys.c create mode 100644 source/loader/sys.h create mode 100644 source/loader/utils.c create mode 100644 source/loader/utils.h create mode 100644 source/loader/videopatch.c create mode 100644 source/loader/videopatch.h create mode 100644 source/loader/wbfs.c create mode 100644 source/loader/wbfs.h create mode 100644 source/loader/wbfs_ext.c create mode 100644 source/loader/wbfs_ext.h create mode 100644 source/loader/wdvd.c create mode 100644 source/loader/wdvd.h create mode 100644 source/loader/wip.c create mode 100644 source/loader/wip.h create mode 100644 source/lockMutex.hpp create mode 100644 source/main.cpp create mode 100644 source/memory/mem2.cpp create mode 100644 source/memory/mem2.hpp create mode 100644 source/memory/mem2alloc.cpp create mode 100644 source/memory/mem2alloc.hpp create mode 100644 source/memory/smartalloc.cpp create mode 100644 source/memory/smartptr.hpp create mode 100644 source/menu/menu.cpp create mode 100644 source/menu/menu.hpp create mode 100644 source/menu/menu_about.cpp create mode 100644 source/menu/menu_categories.cpp create mode 100644 source/menu/menu_cftheme.cpp create mode 100644 source/menu/menu_cheat.cpp create mode 100644 source/menu/menu_code.cpp create mode 100644 source/menu/menu_config.cpp create mode 100644 source/menu/menu_config3.cpp create mode 100644 source/menu/menu_config4.cpp create mode 100644 source/menu/menu_config_adv.cpp create mode 100644 source/menu/menu_config_game.cpp create mode 100644 source/menu/menu_config_screen.cpp create mode 100644 source/menu/menu_configsnd.cpp create mode 100644 source/menu/menu_download.cpp create mode 100644 source/menu/menu_error.cpp create mode 100644 source/menu/menu_game.cpp create mode 100644 source/menu/menu_gameinfo.cpp create mode 100644 source/menu/menu_input.cpp create mode 100644 source/menu/menu_main.cpp create mode 100644 source/menu/menu_search.cpp create mode 100644 source/menu/menu_system.cpp create mode 100644 source/menu/menu_wbfs.cpp create mode 100644 source/music/AifDecoder.cpp create mode 100644 source/music/AifDecoder.hpp create mode 100644 source/music/BNSDecoder.cpp create mode 100644 source/music/BNSDecoder.hpp create mode 100644 source/music/BufferCircle.cpp create mode 100644 source/music/BufferCircle.hpp create mode 100644 source/music/File.cpp create mode 100644 source/music/File.hpp create mode 100644 source/music/Mp3Decoder.cpp create mode 100644 source/music/Mp3Decoder.hpp create mode 100644 source/music/OggDecoder.cpp create mode 100644 source/music/OggDecoder.hpp create mode 100644 source/music/SoundDecoder.cpp create mode 100644 source/music/SoundDecoder.hpp create mode 100644 source/music/SoundHandler.cpp create mode 100644 source/music/SoundHandler.hpp create mode 100644 source/music/WavDecoder.cpp create mode 100644 source/music/WavDecoder.hpp create mode 100644 source/music/gui_sound.cpp create mode 100644 source/music/gui_sound.h create mode 100644 source/music/musicplayer.cpp create mode 100644 source/music/musicplayer.h create mode 100644 source/network/dns.c create mode 100644 source/network/dns.h create mode 100644 source/network/gcard.c create mode 100644 source/network/gcard.h create mode 100644 source/network/http.c create mode 100644 source/network/http.h create mode 100644 source/safe_vector.hpp create mode 100644 source/svnrev.h create mode 100644 source/unzip/U8Archive.c create mode 100644 source/unzip/U8Archive.h create mode 100644 source/unzip/ZipFile.cpp create mode 100644 source/unzip/ZipFile.h create mode 100644 source/unzip/crypt.h create mode 100644 source/unzip/inflate.c create mode 100644 source/unzip/inflate.h create mode 100644 source/unzip/ioapi.c create mode 100644 source/unzip/ioapi.h create mode 100644 source/unzip/miniunz.c create mode 100644 source/unzip/miniunz.h create mode 100644 source/unzip/mztools.c create mode 100644 source/unzip/mztools.h create mode 100644 source/unzip/unzip.c create mode 100644 source/unzip/unzip.h create mode 100644 source/wstringEx/wstringEx.cpp create mode 100644 source/wstringEx/wstringEx.hpp create mode 100644 wii/apps/wiiflow/icon.png create mode 100644 wii/apps/wiiflow/meta.xml create mode 100644 wii/apps/wiiflow/wiiflow.ini create mode 100644 wii/docs/Controls.txt create mode 100644 wii/docs/FAQ.txt create mode 100644 wii/docs/Readme.txt create mode 100644 wii/wiiflow/Languages/arab.ini create mode 100644 wii/wiiflow/Languages/brazilian.ini create mode 100644 wii/wiiflow/Languages/chinese_s.ini create mode 100644 wii/wiiflow/Languages/chinese_t.ini create mode 100644 wii/wiiflow/Languages/danish.ini create mode 100644 wii/wiiflow/Languages/dutch.ini create mode 100644 wii/wiiflow/Languages/english.ini create mode 100644 wii/wiiflow/Languages/finnish.ini create mode 100644 wii/wiiflow/Languages/french.ini create mode 100644 wii/wiiflow/Languages/gallego.ini create mode 100644 wii/wiiflow/Languages/german.ini create mode 100644 wii/wiiflow/Languages/hungarian.ini create mode 100644 wii/wiiflow/Languages/italian.ini create mode 100644 wii/wiiflow/Languages/japanese.ini create mode 100644 wii/wiiflow/Languages/norwegian.ini create mode 100644 wii/wiiflow/Languages/polish.ini create mode 100644 wii/wiiflow/Languages/portuguese.ini create mode 100644 wii/wiiflow/Languages/russian.ini create mode 100644 wii/wiiflow/Languages/spanish.ini create mode 100644 wii/wiiflow/Languages/swedish.ini create mode 100644 wii/wiiflow/Languages/tagalog.ini create mode 100644 wii/wiiflow/Languages/turkish.ini create mode 100644 wii/wiiflow/boxcovers/JODI.png create mode 100644 wii/wiiflow/fanart/GAMEID.ini create mode 100644 wii/wiiflow/settings/gameconfig1.ini create mode 100644 wii/wiiflow/settings/gameconfig2.ini create mode 100644 wii/wiiflow/themes/default.ini create mode 100644 wiiflow.pnproj create mode 100644 wiiflow.pnps diff --git a/Makefile b/Makefile new file mode 100644 index 00000000..f68ec4bf --- /dev/null +++ b/Makefile @@ -0,0 +1,262 @@ +#--------------------------------------------------------------------------------- +# Clear the implicit built in rules +#--------------------------------------------------------------------------------- +.SUFFIXES: +#--------------------------------------------------------------------------------- +ifeq ($(strip $(DEVKITPPC)),) +$(error "Please set DEVKITPPC in your environment. export DEVKITPPC=devkitPPC") +endif + +include $(DEVKITPPC)/wii_rules + +#--------------------------------------------------------------------------------- +# TARGET is the name of the output +# BUILD is the directory where object files & intermediate files will be placed +# SOURCES is a list of directories containing source code +# INCLUDES is a list of directories containing extra header files +#--------------------------------------------------------------------------------- +TARGET := boot +BUILD := build +SOURCES := source \ + source/cheats \ + source/config \ + source/data \ + source/devicemounter \ + source/gecko \ + source/gui \ + source/list \ + source/loader \ + source/channel \ + source/homebrew \ + source/memory \ + source/menu \ + source/music \ + source/network \ + source/unzip \ + source/xml \ + source/wstringEx \ + source/devicemounter/libwbfs + +DATA := data \ + data/images \ + data/sounds + +INCLUDES := source \ + source/cheats \ + source/config \ + source/devicemounter \ + source/gecko \ + source/gui \ + source/list \ + source/loader \ + source/channel \ + source/homebrew \ + source/memory \ + source/menu \ + source/music \ + source/network \ + source/unzip \ + source/wstringEx \ + source/xml + +#--------------------------------------------------------------------------------- +# Default build shell script options +#--------------------------------------------------------------------------------- +ios := 249 +#--------------------------------------------------------------------------------- +# options for code generation +#--------------------------------------------------------------------------------- +CFLAGS = -g -Os -Wall $(MACHDEP) $(INCLUDE) -DHAVE_CONFIG_H +CXXFLAGS = -g -Os -Wall -Wextra -Wno-multichar $(MACHDEP) $(INCLUDE) -DHAVE_CONFIG_H + +LDFLAGS = -g $(MACHDEP) -Wl,-Map,$(notdir $@).map,--section-start,.init=0x80A00000,-wrap,malloc,-wrap,free,-wrap,memalign,-wrap,calloc,-wrap,realloc,-wrap,malloc_usable_size -T../scripts/rvl.ld + +#--------------------------------------------------------------------------------- +# any extra libraries we wish to link with the project +#--------------------------------------------------------------------------------- +LIBS := -lpng -lm -lz -lwiiuse -lbte -lasnd -logc -lfreetype -lvorbisidec -lmad -ljpeg -lwiilight -lntfs -lfat -lext2fs -lmodplay + +#--------------------------------------------------------------------------------- +# list of directories containing libraries, this must be the top level containing +# include and lib +#--------------------------------------------------------------------------------- +LIBDIRS := $(CURDIR)/portlibs +#--------------------------------------------------------------------------------- +# no real need to edit anything past this point unless you need to add additional +# rules for different file extensions +#--------------------------------------------------------------------------------- +ifneq ($(BUILD),$(notdir $(CURDIR))) +#--------------------------------------------------------------------------------- +export OUTPUT := $(CURDIR)/$(TARGET) + +export VPATH := $(foreach dir,$(SOURCES),$(CURDIR)/$(dir)) \ + $(foreach dir,$(DATA),$(CURDIR)/$(dir)) + +export DEPSDIR := $(CURDIR)/$(BUILD) + +#--------------------------------------------------------------------------------- +# automatically build a list of object files for our project +#--------------------------------------------------------------------------------- +SVNREV := $(shell bash ./scripts/svnrev.sh) + +export CFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.c))) +export CPPFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.cpp))) + +sFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.s))) +SFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.S))) + +BINFILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.bin))) +TTFFILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.ttf))) +PNGFILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.png))) + +MP3FILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.mp3))) +OGGFILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.ogg))) +PCMFILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.pcm))) +WAVFILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.wav))) + +DOLFILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.dol))) +ELFFILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.elf))) + +#--------------------------------------------------------------------------------- +# use CXX for linking C++ projects, CC for standard C +#--------------------------------------------------------------------------------- +ifeq ($(strip $(CPPFILES)),) + export LD := $(CC) +else + export LD := $(CXX) +endif + +export OFILES := $(CPPFILES:.cpp=.o) $(CFILES:.c=.o) \ + $(sFILES:.s=.o) $(SFILES:.S=.o) \ + $(TTFFILES:.ttf=.ttf.o) $(PNGFILES:.png=.png.o) $(DOLFILES:.dol=.dol.o) \ + $(OGGFILES:.ogg=.ogg.o) $(PCMFILES:.pcm=.pcm.o) $(MP3FILES:.mp3=.mp3.o) \ + $(WAVFILES:.wav=.wav.o) $(ELFFILES:.elf=.elf.o) $(BINFILES:.bin=.bin.o) + +#--------------------------------------------------------------------------------- +# build a list of include paths +#--------------------------------------------------------------------------------- +export INCLUDE := $(foreach dir,$(INCLUDES), -I$(CURDIR)/$(dir)) \ + $(foreach dir,$(LIBDIRS),-I$(dir)/include) \ + -I$(CURDIR)/$(BUILD) \ + -I$(LIBOGC_INC) + +#--------------------------------------------------------------------------------- +# build a list of library paths +#--------------------------------------------------------------------------------- +export LIBPATHS := $(foreach dir,$(LIBDIRS),-L$(dir)/lib) \ + -L$(LIBOGC_LIB) + +export OUTPUT := $(CURDIR)/$(TARGET) + +#--------------------------------------------------------------------------------- +.PHONY: $(BUILD) all clean run +#--------------------------------------------------------------------------------- +$(BUILD): + @echo Building for IOS $(ios). + @bash ./scripts/buildtype.sh $(ios) + @[ -d $@ ] || mkdir -p $@ + @$(MAKE) --no-print-directory -C $(BUILD) -f $(CURDIR)/Makefile + +#--------------------------------------------------------------------------------- +clean: + @echo clean ... + @rm -fr $(BUILD) $(OUTPUT).elf $(OUTPUT).dol + +#--------------------------------------------------------------------------------- +run: + wiiload $(TARGET).dol + +#--------------------------------------------------------------------------------- +gdb: + @echo Loading GDB with symbols from boot.elf, type quit to exit. + @powerpc-eabi-gdb boot.elf + +#--------------------------------------------------------------------------------- +addr: + @echo Loading addr2line with symbols from boot.elf.. + @echo Press ctrl+c to exit. + @echo Enter an address from the stack dump: + @powerpc-eabi-addr2line -f -e boot.elf + +#--------------------------------------------------------------------------------- +else + +DEPENDS := $(OFILES:.o=.d) + +#--------------------------------------------------------------------------------- +# main targets +#--------------------------------------------------------------------------------- +$(OUTPUT).dol: $(OUTPUT).elf +$(OUTPUT).elf: $(OFILES) alt_ios_gen.o + +#--------------------------------------------------------------------------------- +$(BUILD)/alt_ios_gen.o: alt_ios_gen.c + +#--------------------------------------------------------------------------------- +# This rule links in binary data with the .png extension +#--------------------------------------------------------------------------------- +%.png.o : %.png + @echo $(notdir $<) + @bin2s -a 32 $< | $(AS) -o $(@) + +#--------------------------------------------------------------------------------- +# This rule links in binary data with the .ttf extension +#--------------------------------------------------------------------------------- +%.ttf.o : %.ttf + @echo $(notdir $<) + @bin2s -a 32 $< | $(AS) -o $(@) + +#--------------------------------------------------------------------------------- +# This rule links in binary data with the .ogg extension +#--------------------------------------------------------------------------------- +%.ogg.o : %.ogg + @echo $(notdir $<) + @bin2s -a 32 $< | $(AS) -o $(@) + +#--------------------------------------------------------------------------------- +# This rule links in binary data with the .pcm extension +#--------------------------------------------------------------------------------- +%.pcm.o : %.pcm + @echo $(notdir $<) + @bin2s -a 32 $< | $(AS) -o $(@) + +#--------------------------------------------------------------------------------- +# This rule links in binary data with the .wav extension +#--------------------------------------------------------------------------------- +%.wav.o : %.wav + @echo $(notdir $<) + @bin2s -a 32 $< | $(AS) -o $(@) + +#--------------------------------------------------------------------------------- +# This rule links in binary data with the .mp3 extension +#--------------------------------------------------------------------------------- +%.mp3.o : %.mp3 + @echo $(notdir $<) + @bin2s -a 32 $< | $(AS) -o $(@) + +#--------------------------------------------------------------------------------- +# This rule links in binary data with the .bin extension +#--------------------------------------------------------------------------------- +%.bin.o : %.bin + @echo $(notdir $<) + @bin2s -a 32 $< | $(AS) -o $(@) + +#--------------------------------------------------------------------------------- +# This rule links in binary data with the .dol extension +#--------------------------------------------------------------------------------- +%.dol.o : %.dol + @echo $(notdir $<) + @bin2s -a 32 $< | $(AS) -o $(@) + +#--------------------------------------------------------------------------------- +# This rule links in binary data with the .elf extension +#--------------------------------------------------------------------------------- +%.elf.o : %.elf + @echo $(notdir $<) + @bin2s -a 32 $< | $(AS) -o $(@) + +-include $(DEPENDS) + +#--------------------------------------------------------------------------------- +endif +#--------------------------------------------------------------------------------- diff --git a/data/app_booter.bin b/data/app_booter.bin new file mode 100644 index 0000000000000000000000000000000000000000..00e1d1020322c5d2c5751de947d546a73ed7cb57 GIT binary patch literal 800 zcmZuw!D>@M6g`tfNhLy*CsY%fiOHhX!rOH5!i)GKRf4Ue5W$r`Ns9=&5f>4ror!4| z1sB0|(M6I*Y6C*(2Pl1U;U~D3h%1Rp1vhrQlhPpK?%Xr?p1J1?BYbpA<;Xq1%prW1 zT?CuW^9FO$HO~RC$@GW3-+)sNb4LOB4&mJ}7dz9piU>U_f_>Ud>w$=dy8SBRVkPms z&X9F{pzs1)G8k55e^_y8R`pT0*NJaqT1gZy)}Xz8B-J(`TIVg&%Nd^PI^o-P6USYR zh}#77+WMnAAdLXMvBoNv#u{xT4>j0NMZ9XGM;a&XZJcmFlZHOjP%9WH+V4H>>ZHL% zG~B(Zz^fVZ26@%T;x)Me7W3fH+Rv-6HTzrA9TQd*>;uIMr75GGg{I zK(52PGlO6`qfnQK6^R-hTz-$9P%L2Vd+O%x-bRFKB&=G-8MNfYBL*OjO8=cZoN6 zbq09C??15B(}$E@*4;rguNqwL3@c6tlQer{gw+Ty%Wvi#BI*C_2c|NE2@Z4@Ylb8=M1$zKyfHx2P`CkoVbL(Yw-w zjTJ!(3h;oYsOybJgoC;mD zw-poB?<}IpC0@GI4aaLgJ}L&|xaU78$Dc%9didX;D6Nbl}n zGVXky>mT!Kx!bw#@1eg$NCUgh|6wk^mE+;q$Bb%;wX5UV zB-7&O=>k{91)!>9N?VkOktx3mPIHjhsoXK^@gVnggq2}6eYH7j+OdRBSh%yC)v7ZS z0X@%!7VNbx--o^K@z_dOdM`V zT}|Bx%iji73|^kIc8Ebbz4v3{`NqI?-6C=MC5Y;GUQ!9^%;r%H+j@R z^GoP!^rbSPz{cLwSLLRhH71L|+B`fXHX>?^>#y22` z9ANJ!&;!P$17O4kOnXvk^NLZ#1oGq_$%+tSN-XB>1A*nuL!;@n{ug7} zJC(MqQp`Kf+RlurC)Vk3MUvrsNnTK9os^X$d$jXc&TLc5Hq)j2~-~%MQ2wy ztxS5rHh}%TC1(CD&yfViF9@auvZbO*Xo< z5@Ohfn*?p@jq%f*Hb{L~iKYY2AD#Vab`$%kEXvTb^w$gzx!j^m*E;Zc7%E@}X&Pd! zbT4XpET1@QmLR$^vPVF5xb^t@SK_+h0pO3d97vM=a~Lg9_Hz5dygSt^@8*A|&Y`-_ zlgL_H6WLkLR)z7(23f_Jbd1=*2S^Pt^!S-2=hU@1TIC5zic_#=%6c@GL{^9Z-+;}V zJbLR=_-k)9Ua^bWoEJBnrPy=x$zh#eQMibb5ue@OEumqoP@UqqU248XG(G{>&LE0$ z*DcX+RJ+Vlwtl^e?atQ9GWI>AiNFTrLG{}wwX`}gEefINl-N{eJ#-qrqgofj*Qh-i zg@yL#*H)N2Ly4(X^wq-CcEp-Uq#96AtHq^M6V%1DykEJ}ra&2uH!OR78Cmv}dP9B} zWSvY`Gc{A^`8CdBBrU5gWf*r2<7gMs z-DD@7m#9S>Idv?{3%iF$V_+W;YuNVFE3r%;8S298O%*dk9LKiq zt=37c$G%#oxpx)*X7ody4V&^yi0}(N3WG8|NFje}ncq^-B|FXR;B(FfyPws2%cIge zH#E9>fcKs1Yh#b^U8vt4|4)|=tmS>11I$A!s#V;i5RVJ`~|v{pKh%-@UWLo72;Svo@30V zUwe1zhlFt(j8sbA7N-oPlB?v4-~v_YqfHb;$-A?6ZQ=bfYuB{Wv)WAB zUK7hzW>S)70lI+Y63mMUhVk$G4*8G9KE(xaz1uXt*I+a3_yY_y?-3I4;iy?2KID`y zRg79hrTn-LV~2o^dtO-ZNa6SEvfmN63^wNBiQO%j_?yL1CDe(qNN?lPp}!er@EVJz z9+z5SOY~tTMr=3!XKJb!MKM0NuKt61u`nRCe=l(96?6=PRuOx_a|3p5Xa4M<`(r+~ zxj*0g|GmUfxk^UZWt}q76bnQHU@0K%+=#-HczVUcgALdTM84y+P9*2_VBALMZ0CyO z!`Q{uqth)F$HhD!U}uE7E~0;>SIfh7ZT-Cqdg6WN%#dx55hvEcLrR_6?gO zn9z%~Dj6%I&T9f!A3FBOLj7(g{)|ZDOXxj;^L0xP9=|t*>1>qST2I zVPusrUe|3}!_xl^V1d3NDJQgD#~9<0Z4pJ~o3Vfu*;|Y{C{cVlHPKnrZ&Omq*?J`= zMO@^^n&S_eRH7$}_UBQ?g2&m`b8!>E3a5E<(LP1?Y5rr6qZM+2Ya((eB?v~a#AFIKV?Wn1tDcqC!;bLu~xE%#{{z8LDuWVd)@CszE9^x-hpurj_ z)86_rmL@y;SvkFs;M*fpC>kGhweO{3MPN_mt&=nM{^TbpWFVpRo92EYOPe9U0^`1J zjU1Qa>VR!KT%bW5&op`M*d#ME@B+(T6iR1H7OnGO?Wu#p^~xiA;{XE{6uiM&VC)3Mghk9b z#`zGR7FYGcCOE|p$ysbaqGKm&FN^Nu6;&)3$FX~7Q??-8gIxu)zMp&1`o8m}E4)?1 zc8D^5?HUf@EBB&(OnrYSJ^CAa+h&MQw#6(&Gie3fYq$pBL za{%js+7NU@r!RMSx}Y1(pOT!E)%kQFUL|8(ysWs>qwIA{JvMKbD`(3pb)Hk7M}6+r z4QPd4QVCG#*IzZmuF8ge_Y zc!}oGu#LLZTBh!Wk%tDMRJv`xkwa7>adLpPAu=jz4zr7v_X$lKPP+ zyw!;$BEc|}VTV;0eXB48#iToQIxy1}%#CT@51FR2F&ReK`)HPr+;c2HzLx5h(jH1N z_8|2B>2a=g;H{h&>n7a2N5ws9<@W4hlG7J?HL*< zF7Tu3mGhBjg8_Qb8b9lfiIv*i{ZvIGdTKR72Mb*=nL0^hX7|>?w*kQc?uKc$+vqxQ zzYtuPpwKEuIc=bfkNYU|6=DJ*qx@N|FH8iqhdCnMpiUpwihfSC);j4X3M3~lvI`!h z9O`uD$PFVL68WFcb@^VVac%HJqed$}_MWyB0z-6Td^q+g_f6NLtH{Hd#f8A0L`gK| zj@+cB$EH>|xVE8_JZ1hqt)KD60OwF3V{<*eS$D=#CZonw&_F^ulW2N3C*tZq%lob+ zl(*mpG(uaxqIy2ltFfZ%TUXfPXgXTz&5qQa6B8qWn_24>!p_g;4i^rBn{@RAGyqLd z@zAd0^Rkw&6j~3yB5N}$FZ^z6m@L8{s2x`NomfA?9Q=d*UfHu^@fYxs!O?bUT6~5M zvp$t)2Qa03?HhcvW&@1$8Bc0q>9Nvvb(W;#B9u`1fiB1Gj=S>9sHYlu=_$0%?uD#E z60z|7_3>4cojBlGTs$}?fj_P3{!&2lOr76ivbaM^4}5QYd=Z%wG<|e$X@B-7QCuxU zph!FMzr`@9+BRiH?^IBSQt;%W60>uLpc`eK)I>f|tt1_z<=w^N=sWGv(7#-KsUr0F zih9ddr5b|_eOsLPvaoeSGV9^DX?k;in^J4=3rbLt!uy9u^~Mjx^+YjiLG!+2FH4i` zMtK}w5hump^tp}G$uqWl$;3Ih|A}&(kXMKqo5*_Uwx)oE4o3i^tAJj1K7}4NSN>!F z)wugnm3Bu&OQYv`vg4Q2joIF{v~{lmP+drNYK?w&YIOBAWBwc-7OQ?5e&@k=XAU0M z1aL8{$-SvVB4szfHL7pQe#FvFts6A^V7=L|6?3OCc;RbWsyZeECfAzQ969mQR>J(g zUL1GtTnz+5)>%wyTx?jWgzhuNmcRni|Lb;k}=|8QS@LP`%|u^}1Vu1>S(fN_ROsV=wU~A9$KFliAPc zD=c8O4@*+WI_-ITkF9R#-nxB-&W2ql$j;t@p|9{gu;L5?+J};1g8xHS{6%;XCoON* z`UtX8#r&sNv-yt{+#NlAmlPM4Kq#Cf(7sk@T(#fzRKS-EtVGXn@>+%>!?A}%ts(mA z{8*8wH}fLNUU#Jkz6!Gr!q@^J%kE&ck~VSa8@=Fj&Z{$5`VZZfWUdp;0jvK)HDeGg zkq#p;(+NJWoO_u~{QQMSgOL8{2GSm92)L-!wlFGhZ}|C*OGV}-RYCs- zQGmQ=Tf|3>7c-jpbS%W?xn%HP6`rNC zXLgcB&r`pjbFBo2BD2kAHRH?sz(?VCz{}BxoFE?>BRspVHA}TdPcgmu%UC$~=$8U& zI?<6QS5)bC!~xH;!+UUaEZB5O?PUU{U?n~=WRXhpgK0xSo20z;Gmlfl^|{>#c)ps< zWqm#;EDjP46cd7`N73Nq_V6_c0RpllI$BmoZplhI0c5Y0u_Zc|YFx zvT)Iulq6w5QvrLtS%HKR@oH~Wnkt-J6na#P^@^I6$9-#{6I`+Lo1ap7*0 zW^0wwce9f0)B?xTX9uhjhP^|yPkFThJ~$}q*(9JOsGu$3!)ovlZBIuJM%8)0p4SrR zg0x?nvez&}+rbUGdTZ{0CeD;DDfz0Nbo?uLm%PBJ%D~D^sh@i}2lxzv)OSf2(0hQM zO;>lcJhx?XAAHzouY;3at@^S@TK)ZA%h|+o0H4r$vMW6IY`o?d4nn=nVH)2@Dty0n zLusxuSKjQ$~~eps0#d8ee*0fpwc^5b84_Pd^;d_<>&P)0jz=`&J4MPUVHo zX9m(7=4HLSHm_E-jAlJrdokzA{luODZtT(e8~-A!P1_Vu662Sh;p7-jeMznlPbCd{ zkUwgzi+z``KB~MBMXFC=7?OVmBXoVLWA}sAoBK)xDn)UAVJD_FHg$ilkyAO}y08^^ zfHXN|5sryIx&$*M!;}*6J(omt_<*gzFyYgaWrEnn&I=rkq{3iMNMC4{ZGI5W`v@7i zzt|Qa5}K7is^ezOwj*5V6xLn0?C{H=J1zOlC9u?VV)w-01|qxTALvmfKDe*i@t^nC zf49578T`r&IG6SMk!e_|sAl{Y{t2=P@}_B{vJ9 literal 0 HcmV?d00001 diff --git a/data/images/balanceboard.png b/data/images/balanceboard.png new file mode 100644 index 0000000000000000000000000000000000000000..d713380b0bae777b7a79a25c09757d982d97e063 GIT binary patch literal 4743 zcmZ8jWmJ@17kx&MF6ow%l1_o4dng$OXeHuA9=;wvP9C0Y+N!E-p57jg&aMss@M-~Rgn$|C(8`}L zpQ`A@grw+rKxqirpek`8)QQ~u?1U7M81{mB8pG}f>gu>mgZVKy@$n(=X$%EO-Vx2= zZ?J!g4=;>)H+;DoSm-j-cD^-s(=e;BU3r46AII+^AW72_H}=P8r-FbDPw>_h5Q4nO3xqgKqtHxlY;?ZQ*g1en~w;Z;%>o=R@6`o1}u<9E$aU&pH z&lnCpkM({ti{zw!)SrYjiY9y@2EogaO^;8HVDP7}$sUOqUfo^;)gr_E&(`a0{cOZ`4E3)B*j-2~qWnT7`?x=k&A)lc z-q|iI@h{ezgvGHHy$@Tw~pSf z-a!^rueq47SWZ_?cVKLE?9T`v%1KkC)Zz>&ZXJ?E37U z{nEvn1E~Y&gXpEaQHeahTr+W>Z@q)6KMXe~6p8avMO;=YgA7y+LJu67mRy zz=;i24z;*G!>5~2vOR7FAYX8*I)Rwamq6RWGf)Gi5 zg>s=6;05Uxi5A6vAxE>(X;Y-BwyO@aj1Ygdl)G!k%GLf!^cr%Fcs-CVLwL~2GoS#| za~fGfTP8#)Ae*M78>9au<+m~ge<|(zN5@qDkK%~}dRTf89KsV)6ESnDmi(;x$6EY) zuakZywn+wXeHBLuY&J*mlznW|CDp}d%jVK%y<~F}lb3B54Npq^=%rH5u9u8P>>{=t zUyf8dMAqGWb&qQlW=+K(a;g7VdEZQs2(4256K2jk%a31&a4>P~9E%;6Nvp_xJhnet zKfL%+I_EI&cAv6`ay1E!iqbI=WHH@puY4g>2lfhBBwDAr|2XOyUM0Bc9h%>5+Mr_J zB)vMQo%^+(OX&0N;jr!okjoyiG0|q^+r6dPeJcY~VY8J6_`fJ5lLAfbyK3r1x^$Z0 zIo_pLn@rIj!=0H+DPPJe`kL*>9VZ=kww48REy&W!)3?&e+)3vbzL2gw`?CM%Onp%} zeT;XpH5{$lT-XV2YI7(V!i>o&!ir$0uzxVAgGp=yeD=b9;(#fz?M&j=^rA)E`L)7O z$D%RFSZ~^K+Tl|Bvi@ALI<|c0BJI-6s!HF@YkvS|66YG9lMFrE{C%2bQXU3Pn0dUX zNjC7X;|6)?FGwmyYWyLme~r^qEns8koN(owl~i`&<@>^j%ROH(rp}$Kui=WVe z+jf|h7vvs?Efl`1lj^r|+j4Dk7|Y`(-{ZQ)O)8TnldKw9YqwqBUGPovl)*r2PHR?m zv!zS(!Rz*hK*#ePrd(+Z_Ow0Vi1v17I#)&>+kW!ee z&7jTtRB2y%UKJZXt!QzxG{e;Yfktourz1$}X zGBRt5-q$-B*gLZ&25}U3&~Qi~T+Q ztQ|wI#6_Qp!O z7PJG3etVkISStw%C$)_NdNu(HYY}C=?|s|_e z66gXN+l*&l;YR$k?B*qoGaLRX4vsR#d)avL-6!#=y_VdO%^A|(3%TFIY~NF$h)_ij zH@9ntprG9SeK#O!h$~ht%vYAhx(r4%QU~Ks_KKjGl+eQ`00c%}lV2FGM^x`wM8RF( zs!&Hlhi}*j>Xhg~XW*K`g~o%+4wk3_LjhX1@e_$zKfYARk#QM}H+=-~_4gN-lvFn` z7+(nqc7l`zcLd+wke?r5#dT1WQAgc75WXG}@JyY(SZuMgQxGv)NZsyoB2-LF z>|WRLv3F(7Gw^ut`Spbdih9$V0R>x9c$rJ|V37mGh1B=i#;|m@w_mUH-`w0J=;-J; zel`W$*x+&zgf+c2T4}Wkpeh6+#SF&WAR=fwq7XyeWyj^~UnY1ot8+ zL}SdAG@~>=94v$i)5Zx13TCDYS^b;%2we+!Zp8zqPtxVi%*e>EuTOT|bDZ@HI9j_O z7#K)OI^`!XwZ+>7r?)kuU0+{6Jv*bs?H(|(X6L1iYkTuIX@7s;RMU6-1YDFtk9Mme zAtQTk_WZd5g-R6M^JGhJcvEaVPccCrtCa#JV5g_2|8cgz2!3-xG2lhU>#o6pm3CiZ zBe<6<9~hN#Y>G96<;Vx7Sv0zf%FB-(92|hK;o;$P=yqG6)7Q_>YRFzpwR(>uLJ2Yy zNlZtfA|fvC!#1km_-kQ-F$yjsD?7ZlX4|{Xs7--;dVZd)%iSD&s{kF2O7u3JnVG2- zh+AES)6&weIo%Q6@l^qx1V7aIQ_Y7Q>yJ24DW9sUK47ufSABj~w?Ap*8$W+m=1z8g zqV-`WLd$iLJ8zr{7gX#lg_3KzV;gj=|JlMS+&1r;2IFtI*GAEmMzLnHh~9hVfPxw2 z%9qglP7|@KO|=S39`sRj=nr=tHadV@SB0;v6`gDz(OCuLQ6w8uAE)i!OEpQe z3lIL(7fq=-=r@?qYS0zgZ_e}suH>O&y6BaxXsTG;E)BP%r&=iJVW(u*#IsBY3KC*O zJSR<3cr2s3Ic*%2|c6f=atVACL<4M8IF!ViU&_ z4@z0TNsLv5X~fCGAlQ|;xeF^4RGCj*QxiXT`*TMJD?)J0^$bowIX|y0l+KwqJ{ut3 zLSEb2YSAdpi*oYt(1Z;A`}Z&O(vZV9MbOY;c6k}o?6W<$w4}zT&XM?IG*kR`LSp}X z<8Y+KrZuE2fq3W6!lD##(ACA@$K0%}dp2-*K{Yr9 zDyE>Ik3jGk> zt^$FHd zsMs0CPjjd88cFfI-2xlI&z+raKdjx!;ktcra9($}vV@+Cx%8VSYj<;tG8Lf2RnF<6 zCc1Aq%Q9>)wvP9E3WLEs{cQTap0QWt)#aHWCnu+6XAm+qHMKY;3a({s{ZR4hH%rQubf1&jCwXboy1_lF%YVZ60W8+T#JLJiXaPsqO zz~H1pBIoDLgseM8Qy-gTWvx6w9c>Izot>RA){zZ>V*X`hXWQA@h7Ao375B)Mr)_O* z%`GgH>u8&pnC$%e#VkhB+f`R7tJG3$BtV;qM7lkB=mHtR*&qCEj`!QMow`H1gPup z$##MOSy2jp#!&J%R3f&)*O@yR?&><~;o=fl%!k4N!Nc1p!N|Nkp1kn^8#1c39bd*N ziEw^)R*i_JV&`FrvG%OOPq%Rt9Il1b1h*0c%GERl*EHN3iSvGf(?Q8i-foq=D7YnBV>M OfVR56TD6Kz*#7{k=JKEb literal 0 HcmV?d00001 diff --git a/data/images/balanceboardR.png b/data/images/balanceboardR.png new file mode 100644 index 0000000000000000000000000000000000000000..ee2de74256a47fcf4d5bc5358f7796b468737de3 GIT binary patch literal 5789 zcmV;O7Gmj%P)KLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000ZfNklNPoK3<%!_nfLFiQq-B3aYES>(qIk|MU5Op0`9*`AvEle#0IMzze_&zze_&zze_& zzze_&z`w3X6afF&*y$6`9i;b99q#_Vot|H^*R60J_&IP3*ae2b9bgLV6|VpT;MYaW z1z0P7?*N;{>lvUAYytNH4>;xO&WXGF^3ZiU7W>et_~pdPSAf3*yr}AV;FH$}>61@A zcgRl6(Bix1t=SdI}H^_9XKwPKoY}{K|3W<<8h~d+fPAa@-kv?oB-RQjY;% zzZUVt8&`SVTKs3gUyG{#?at7BdXfdlQdpe$D>aRdO17 z75_2jNzaN{T?v6ACa_`S0U=X&;L1bqFxs_A`D@$OVvf3zodv`+DuJOJLOZ?UIN0lc;Y2=** z_X>@edF5@J38!MiTign<5fUpTlD~FD=olf1@@FR!y0H+6@brGl{Yw^O zYUQ+*5uu`OuWc_yJUd7kJEb4xvJxvKMu>~Q%V%PWXYuLe5?BBf({2 zp-PpXi53zLmM&A9;A8B1WGxD%PYB^UpUIJrb)w`hYNkn)Wi37C;4Q= zd|B06%q$q~Isn(f5Y6}zFN zhZCnf_CSw`@AAjr-zTxsxMY|qpMK*i2>ivfhx8+9r0ghDK6GW7%PSFo`TP+bBh|nl z^TyNQ=A%q```Lum7(VsAd!#;()PH)%nYFH!E-)?uM^5QDudFAQPUh*_d=OZUa^fD+ zzOaadmd56}m=wdtT5RZ8X*ke|k`(=ZEjBDg(r8VI(OkBHC7a6*BcZyNZ?-)Fj6&B4 zkr7s7g9Dr@PFVwbz}VEP5=p>_W@vPaO-Z4E`r6YXuaX*JsA;orwug{;E2Z+9HmM22 z99kqL7(+u6R{~zXJN9R?pigR>wFGUUVP(lFoU|sMR}H;6#+XYj+vG=UvZFeuMd}=$ zu8=yoGj?0RN(i_!aoY0%FljNZnSr5A^0gilRqKX1)6Ptjx=M>F%^L_R4&5RdjZt$> zbd~=aI}#uc0k7PhxPIofS%}))GT3^EwtzM~R$D`v9Wl`sGtyV-^K;0Gw3t_8s%y)U zyiM*;+-kYkE&*@fn|d;xKNN(cSv9q2^Xx){1;7jm*4A2wCfjP{zMuVFXr`LB7LGC} zeWZvar*LoT0X9l?W8l8qV@K+BCdAs|tHBPry|tJrI#PtNVFr97q%|<2Ftf$f)>b5( zwHu?S%tpi1E4RlU;9|Kj-2krco_I3fqKhF}*XA~4rV>iM4XJWYf;qZ@RjZ%0qN>py zWVUdXQC4kUbau=PU!B74*a2JxHVm+-$|J9g9g!_ah1O3Wdc4hSS{1Uq9#e1rwYAO- zkw~x+30F6!*hPg4fGQfoL87%RP_1`rr7SD3d*V>#5nwX{9^RX{OD`U0M1@3agrn5+ zz-9*{FmYP-UGcRC=dEmE?09-o#zn>e`1R;Jr5n*`-@UM=#E$cCGNO-3jlx(BsL6SNZo_ zbg1PpfpZwgzxW8`M`rqeCDB5{$pocx3Tul zDkxS?;oZ?T zvdqU{zf9IDywW273d9H}&hw>f2izE>)u}_9fmM^12er+8lodE~h3wZZ^Z3-K78xM@ujB+*l-CP2=it6 z@pZ0y)yh*Nug%e}n3prJs0t&e7!$N0Q)kMH#~Gjd(E%1gOwN5v6{^Fuu#YQbh3uY{ z1{LKmT0@f2yszi6keq}KAvOjg~jy*pg<_F?~spsC* zBQpO$y!y(+#OV{y{?A`|I0Wt%JEGnHk6(FMe2ZrRcma3;cma3;cma3;cma3;cmeqT b{`lnpRsAd`O5#9I00000NkvXXu0mjf;^!nO literal 0 HcmV?d00001 diff --git a/data/images/btnchannel.png b/data/images/btnchannel.png new file mode 100644 index 0000000000000000000000000000000000000000..c87424272c66d34fbf6cfb2b440b80a750ab5b40 GIT binary patch literal 7327 zcmV;Q9AM*#P)KLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000rnNklf30~a)zsEQ1hL{)cG z`M)N%|JT3q>wicBr>}c+fBc7ektu|N%a=bi0C*dK9|LeNfV%-K%q*+fp{X)iqMBwi zn{rA;&0Iv*B6u2*XU**8fAwp>c5{NW*7*OMfQiBc^1&;YM-cY`_-O#|0Qqp7zmJO#l&_RX9B=_Vj*Fa@%h{JmfL z;9mvsvm$sa2_>ik7$6i;Nv3K!NlHnx4U)%fIi;SACADOtssKa)GRP9)-dg)ktL>@n zcKhj%|JKKj_pPzj^5zo|Rj8_d=)nhn6oOv>@lF6M0(R#EL=>h;QWi~l&@^Tp^Qc2k zmeZ&?nDMF1ZV%3TB#0KJ{L!XOYeF-w|~>M)Ep41*5iU_%;p7zfKKX);r@(+U6qB0R`u zG;7+D1xo!30>1rtbMlVG(mnxAKJD8NUI7u{@|CMefcF8oHvet{ptvJ=Re_4iV1w8& z*svIE9JA$duyGu0%nQpyZzD~nSydn^gg_7s54yK-cdxa2t<|Se%QWq`QR|bt{qB)} z^P9i9-tVXHJ(sVSz}2f)lK_7iz-0i7Ie57vbf^JIlUUB0^1{Ypv|(7Jaj{I}xX8mW z=5aCRoQIrp&SohmOUW#oB{fkqGgVU)RTU8tkRtu>STOEZvkUj#cmE4dedR082>uCL z=vIvH1@PdEF!D!#Lm?_KHPMtc=TY-8SRTeSjEgjmW6DF$!;n(W*>cKeW~Qdv167EC z02qNla0!)i81k=IAzJnCQvm_4UcLHL0REAxjsO%Qe`ITk3RF!j zWlee1JdQTp4n7aVFyvv({UfEEa!M&BOO~vkx|x}ZsH#FmO?o5tXOj?+ASn!&2wr;N z{s-=Q|NGwm+>>8=(n-F41s;0n+B*cetY!lM1POXL5rp)iRy9p|w3M@08Z_lGrQDCZ zA9>D}=9rV2CF>Q?(+czhQBg$DgRV@XB7MGMAm~mHXY)2%xN4;LmQwzYDE>3zby{d{ zz7JT=Kax^P1nA8pScDLc-&hLBev9aU3mKQizhIN3c!%Y1*!j;O>l^qj}Sml3Gn>+727>cRu{^N51;o zAN$yMPpgpb?45_MUHj`f=by~OFq)c1M1b@N4Fu)lrAy17zx)s1zgQiv`oQ&9mfdFm z{Qvy?3!C*xJ9GBz^8TOu+Yi_<3_Lv)5^dVno8S2AEBoE9Etji&{?9+~XKYv`2uK0~ z(5L)8h7u+-E{E$Nag)4~Q?F6n~y^_uBZ{=ZF4T~X*n0PI% zg}A~*40`6=`C)NzxH@~`u8Zi63vaE7;OOA+aGa)z%frLbh9M8D!=bKMyP899xEn(d^CimIrpsHs3iL_|H}-fItk`0c;*iATQacVfDk z{bU~UJBGy~=V6ho&zl-VQ~*_xJS?(A=N6VyQnO^1Od!ydEv2L>Ck+NDB7lg9s;H$iq11 zlvB2BqG}?l0-gDUnh-$%MDIZghzN(Ob{K&QM2NY+<_;kw2vYzGQdK~Za-S$L=ju%>=?=VA>pS_q%;* zt@&=ZD`mIaNsx2>0S0T`m#IuG=uul~ZNDjqzIG`GXh8YH%x?ewkdPrbNWt;U>(luS(&>Sc=keiz;vxZ9O@>G|)bJgA5u5aF%WX}6uW zo6Xd`xqFT39?d=6Bj!qw5sV;6p8drS{Ng?7;g5XeyjZ%&ayFfp4Z!HcL`9%N5n-rI z+sVKC$}5}gW>c2SgPevTvHu)Fh??nUvqM0m?58^9Y$;hX6$`pVxG+LIrf9V`l?_CM zh=|&1EoCaxeyZ;7&D~pTQELrvEn16kcSfHH1F!_}wxnhkEa`!nC7q`pgutZp28gH# zBB>0EQSW~1TMy1(ylXWqR#{Uv65MY$<>dIdG?Hl;bh%s(hpW{%3^}QpiNI=^V%lw- zK&Yq;%T*fkU?Pg3$KYE>J{Iy@We|30f)khl$_t=~qtzZ87*S>XhbUZCrtNiDF;=S)& zE|<$$?gQbNrrq@FH=cWCvpFt{7O{UsZh`?gG%&W8K4iC>?x~P^+ z0oGcp0vN_cGFz7+XB!vG#dvV$jHoCGMtC?$&87sXmNYL{!?-%Lf|&}5i146XM9VAA_UsF|gl)sjJg6olB!kpoaw z1v_l@c>;q$LKqab;!Yy^8Je0VBM1=(2)ai<{aRZswGV@PMEH!P0nD&YNK!Baovr|< zG*tv9Dq^ZCs!2suk_rf@+)fw*F;S=~0Jc79gaTw>hWdF`1w0rIM1;7g;&fq&h|Dsd ztu>#feJy43+N#%D!re)da+^kzf&d_i^NK* zZf2MOi0~Hs^?I}2Z1(%IFWdDRoAr7V5e^8VFEsAgC!3SwqkXHb)#A~-(PLihcZir7 zh8h%`MB>{X^(5TS21xW;xmRWZVABW54x$1*HdU4VRN8v8 zsSzQ^M@Q3hU;6y>2Zv|IJme%$A%olPW;!`K+U>Uc+DfbYFaFnOmdj-#f{gGw6A%OB^7kyUQ21Elvbyy?RV?goE$T!8KlCa zOxw2K?%I00t{#={jdcIx!Jq0bLQqL=(#Ie9?Qj2sU;WkB-0NGy8<~uE=wA^{YS}F! z#WEQV4i1+GXU?RYm!{Uod$-@W&3e;HYg~+DI(zQiVtKF{wWAEGSD&`q{n5>vtqC{` zqnW}#%nuYgm zrrjD)5uqiuOj|CN`R9J=SAHhvF$W@~g*W%uo*b=T_{x(n9v>Z*a~IAp-~ChXd*?VF zE~p|(ko4GY*PG{`{KE6oepk<)Ju}?$rnHO$uFNAzgEe> z_jaxc03N{l>FdwDl;)v$u1sa$YF(uvK_#ear&K~!P0YyEYL$m^wOAaUIS>&cgWg*6 z2(Ate7n|KK4h{~+#p+U%}gzu zslr6n$X-KB$!=LOB1!=S6cwSEsic%TEe9MkZi|Y(v1J=V*%R`=ce`y-0Qj9pK5^Wf zU!JC2t)(WTDajoB$w5j7PNcAeUVKxdBNj2wNLwR!J|21nA+>IeoMyda?Q?63cG8+pdqN)@p1{j;6BT6#_>y0U$~4cbnaIvn~{fs-9ANc3KjFu9Cm~ z#HT*>m6&}}xecy@D_5=_jEm(zUL7p&Tb?X=X_*Wr+Z4 zEwS6|T4^;>N_wz5Ov5-BM1w@oTitAq_cvaBbvy00EoGC%FxohbNoLs*(YRi(%kj+{ z({8Fk`mKiX@R$kF5rB_=^6|%C^m#v|JJvHEd;HPuwQCRm{%$|L&2m;XvmuF@N&qwu z;re9VuwGY)bpxV%nsRy`rIeVaS0@o6$u6#1ZLQ3mNuo?sl-)kuTVZ$?@9rc(AtWU= ziXtLNj{qGc8-V`>;H7vyZtbH**XEA z+3f5-_j|B@?j%e_0P9%3|{p8d6$Pg`z_nb`mpRZwpYj;eO|MpYCN9gbV8wU%0U zwUj@Ih>t(<#3#SW;171i1OU%o|9ZXtwWpuD@80(u)@b)2AnYyLiy%Pnc*^YpvfmS( z>I$4XoU_4ss^{i|5U_8!h-l4gtz}UpSbC*zWIyp`C3#Sx_0f7nErA~>Hcw8o*x#2*QtHl*(7yH2rSSUwGnEpQ>e={&e4JAfix%UAgkhZ?$B9Gv$0= zPQ#DnA>X>u6E$eEr0jQVGP{{hI--#twKgyAbzi4eYHc^d_b<2bFMRg*Kl9A~s7$3) ze!r9dq2KJ$kwtLj%9U&>T{KHSV@V%KW4=PjKpQ`rRtGUU{pp1rPtq-+zmUyiJo`GPS!Q@}sIM zfN77PM+|pLxu7G1_1r*HwP8viCzEz002ovPDHLk FV1g)fDc%48 literal 0 HcmV?d00001 diff --git a/data/images/btnchannels.png b/data/images/btnchannels.png new file mode 100644 index 0000000000000000000000000000000000000000..c5a12d433b2ca8b7eed016bf1c783e946dfa37df GIT binary patch literal 7679 zcmVKLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000vzNkl?Lm2?>D&DvA&lCb3;n^(6t4AZQZ@;>JFSuZ`o_C-(8VdY^q+ zmpSJcS>+xq&EQV8XyL&m`d5<8yld^Un z&9__#79#@y^M#e+IV0KmR;$dh{E80B~&R7C(}Q{v!k) zC}lXA<_mP)HS3pi&)qUu$qF%SgnYmfc>1Cy&pgPZ@wI`G-E{RYVotmeD_ zJoSr{Z+z=)_u30j%=>G*smP*~Bvcf*3sjXVLKPy!AVC{wR0a(UO&}2|8W2juxY5RA zx4&y+`^+5;r$;U)mtSjU>%aZ*L$h6Xz}>z#2OfR8BUSHQ?!Wn~C6^Cf{PxrK-RGW| z@9$mgY|+uY6mf?WP?8b@f+|%bLsW(k8AFs10z(KCRS29UVN{R?hMBbOx*oap-s#bs z?`A*P6V3Y8KZ}!%7e4y#*4+Ki=fLCNOak&LZC zyVD^g2thSc8Dhg214E1wnuak%i6Kx`DIySZysyLE-Ca-$5gO(6_$}?JyS~4b+4@eq zdHNSc@YK)U-{wCq6Mw7&pLu!_-2KCr`cGZ>*4eEW{?F&GF5kSE3(Pzf01glkI79

N57LMHc;Kt_7??}StAIJ5r z$A12yHd*mM*#Uxh?3qDQ>OYdZ#cw zG*O$jk)~}l#;DC<`2-aer3gt9By06J%*@P6ww$u1RGlbHfKL7N9q(?pZ@mxg<_&+7 zqW}A6?^k9&`@{@?e8`CbME&hZ~Wh$=J&P?aGz5@KYiHLe<>hETsl z{aGKXsyaT8uc-zNLC4p$CMZS;Q6)sBs#4A9%igb?durazuWXjo{gcn0T^)h&kH`Rp z06$Q2{)v~L`qFZ>cr!tj;s%JjnL%R1_4N&%&ek==Rx|`r4RkY>+&e*Onn{?>W}%tX z25w@MAWF~)H;|-=KtqI(aKPMM%w31R&z&RZY!EFbB{PR)tJN+qy!7Pi<_CW4ee*Xj z{(?~cjiGil4~ydQXVcO7{?7lp`21J5U;g@kyH?WRCFlAm+05YUn_GJS2OqveW2>P1 zVH`@oELUFo+MA_YVPkVE9=q?yPD*T54l_p*RyaD|6||3cD|HcOX%@uQ%FPqQ+d93 z^5V!_7+FavOdNT5gnNz|d>V?VOif}2x>*Bh>08s>ECvoH6r=Bux~xP<4wzPNVz zW?`rf^sD(_F&l2b{QB9Yus{MRH3uYx6rskN4RdoCK(Bb1PG`v2$*9&;< zi}6ulX2_m=m>=Zbi?3Qr-B0|+SKnL@Ksf1c4_tfWJ1fuPA|f;(qj&`@kRTv}oCfPx zi|l4AhXDo>j?^zw>X*4#v6P2msmmZ-C=>!hftA5Z%I5AUr8q1b3mjHzCILqtEcLyc zS&c_UX*cuwS}90ru$?P!*v83QZdT8?2GHJVHXK{*oF7P6Qb(R+1W8a(N1*#^vB{uf_lL#)wfCm(APhsdf{-Gh0ichF zDTD~%MNrIqe}8xAR?8ehq-d;-BDHyAXr%9ZQ07QOV$(JZsuER6LRBa*kj(WKUf^zC zN*&cX=Q5;JN+~w}ZPk$s%h|1DxC>LaXT#opXpc7U36|{Mez9+*?-&CJ))^ty_!0F9 z(4iVQTi*!N*_vvM)DQ(Ai)A1B&dkh20%Oy1I$KvADTE5eOJ>fAZU!L{LZoV-6E1G9 zR@}P|J|s&i+mN#7TnV0);w2l*;FQ8)$UZFhLOgZ)&Jd@~y{S9!h)gg*K)49Zj7out z!llqbPG%Fn^GAQ?4vDS64Xk7md03^3&wu4&->odRjcnij-cun?L!Buj@v&s(^|QM< zWsglGyz%}`N)*6ctoHXL4SDtZU%oJ;14}7c%GpcGUW&Q7RpyuBZiOYS#L%7zG~Z0C zB@u#;p$6PZB~VBTC{&m_V$+B=tv1t*w$5&MFXkY;X(lpsoy9m2kw&$h#yWXG5N?CR zAxJ5Eh>Z)C5?l2{dg$(E#XutEREFw+pT zG%G+cT&KMbm=(|Fo^rC1i zzjjeV;J6rj&dIvvL7wmJrc#QR>&9EZ$L|ijAt=IB1<91DX&xTbpsRwpAQ{Hi+5tp_%MY*H5kw z2Xnd?7ad7@#UKcUt|o0e;cf5v$c-9X8S$cy#eSJDyzs=O#lgN!r)zTRo*z6Gr?cSZ z0L9^s+;{21i(kEX(D%7%TRDB-`_F{QG{7A2Iwt%1-te8Lzi?r-nD_3Zyn>Ofl0YD( znX%bCi5T1N*iCnRF%*$Y6540CZaDe=`IT3@T#7h!>V1lhCbJLu@A+XX_zOH=D{zSm!KvJTwhSHw_x%WE$JG%}Kp7V3yrHBQ_JQi@{qm z2wlcN21wg-^Te6xf>(|5UHRKTa$*U$|1mv!YsPd<3L98;*$-hLwH5 zE5Gu=+YSUUOg2w^DN4Asb>fyb#MWSdnb#nUghnc>AV!Vy@Y*u&P86Y&;_io0e=CM# zIXIj!L)Fe%MK-UyT-`dxRnr~3zEu(kgao2#X5r|m+X6XRn&H0=LvI2HL~$Xm9sMus zr*9u(Ga*Gr6AmSzT1ujXvoZzu;_%AZecWn=LUSYB;BIba?p7*d5U?^LYtAF@0*vln zX#z-Akfb<8AfuoVsFcZ6+hfP#u`_o^mhz<|r|){clu`l!eC!9d(`SBf=kbk=6A#Z% z-m!JU2y^x07t#VESfWndnPpK?|A6FuRZg-IW3oNrH823 zz1xa+%X#TAFQYC2kw70c2ZD4ntQH40?)YYA#jTW_({%=CRy+@bf$mm{k2p|K+Y3dN zaD^xt+I6mPAD7d2+ygf8)u_!QX|*b=-Ge`rah7Hum9=a`S5p_^QHeGZPXnosmF9}`{^)Q`;{ihr;Des^PT75wnTxs zfG~H;p(1wJARI^T^>Yh?beECWj(|=x5fVSfwPm}u%_C>-YTK?57cdA+!ovg@WZT(f^Jm|^-wbtRTZhSdk~3HG&Z75l%`$N>E=;6dgI-C{Kj`K zwP`;yJ8|RZe)XpxTJ7v!@IUd0DTIhe&Mqh2eD`Ci+xrJsUVe6C=hYWV!W=S~jdYu1 zs7GC2-gY@Z+_|cr<5pLQaj*63OVQyz!$V~c(zM>L&-BRgyX?d*_bnOYBeRW@pZ>(p zynFw`8|Mw4{&Z(#Aw+rP_YNYMe`tQ?(!W|P&mX_^;x~rXeBUv21|$$d@H%lFk3Qb| zvI=@$Djhx)>kiLK+#R4g=n6o{xQTXSOOD@qugo@1Ty2{0FV>Eo`TXDi$i4IZql?(X8Y6%R(?}r`yW2>v+ui@Q32?!>wOhw+vVGiivbI9@ z-`PBU$G`o1KYrV})X)3eC1lTk@t>6tjd=9zs@c1G{uY@1q^15R>EUMYmu=r4Gp=<&|_g{7|i<$hX) zBwPTNRv!7r?lijGv~%gz54zj?no0W(H91joS#x@T1|yR@ZAF(W{jz)2y_`LA=9Vvz t?aROXp*yb)y9cF|gkk9a%(ndB0RT5g$UN}ch!p?;002ovPDHLkV1jG=Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^q2uVai zRA@u3Sx0YU=M^1$l1Uspb>*~O5Wou~NMbl~0IzHySr~|8k2LDN_g<+&QdFf#HL6l< zVi6@$63b(!8mZpPNHb$Q$!|zj2C~RKPkc0`Q6CTRf#lQU<2m=9bMN=vdF{cs`0w%K z$KR*NeUH}9UVr`dUq5{K@HJWw=sjNl^XSo|e|`P+*Z)(gRR8@JfA-ZLMWElN^*34t zv^r=FKY8+GBsMm7G$A2jEIBz@o|cxT$jr=C=H}+A^7He@3JVKcXhjtj6}{Wo*!Z1S zLvYV;6VN}=DxxI=Xl_MEN1p?qo}RAA$;nX_6cnh7i;E{pOG~w7Wo6omiV9tMdAW|> zcb1ftd`_=#-V@5*zD7Xbqs5N|&ApF`iW-iIi5ZQLk7pyFk&&Uu%ga*%I6zlbRq5;M z>I^&{Z<1U1TwPtQCqi-}5=-mR-4NaK?vPZnF9Xh9gLEzfUs+kHtFN!0Y-(yU^7;H} zp->oJ_>AlLI|vfdE+X;%En(g6HUjtuT5Z>XNA#il#KgpNkwxUZ(B#y}+0)&z`y{Oy}!TT*4x`_?e6ZL3lT9P8@08yAfY9r=f9H43GAOQn)E6H&_1G1 z)kZ--tbs`pQGl07Bo=@j9v)^!M@OAwV`Hw+a?&*i$PhUzNaB8wMkZi*GJo#9NQ5GP zuEJaeo|6xvk5Y-~LDMZQEhc~;92~UE<#Lx&sq|oF zB#p6~NI?H+T96MShSEq;G(q!_48RlEd6UVsG&eW5Y_V7ZShKUU0khe>3?e$6&W{X1 zQpg0z!`ScxNeNj{P+9))MiK-jH!dMzJSinbg%uYcKTd>3uggM0a_Ts*Ys4YwQMig4 z1ZG68y}f+~W+hN=M4o^y5$K@ZZeL*-X4T=^&Y)Lp&?1gC@U*VnVOoKbtM6cb}PVV=jTu678V*ab8_^^0!N@i*k^53FsmZDEtrs+ zso+TPWmAhBfexA4!x2CvXC3p~j)nCjJL6mfSOE9=e4Bp1f79#rZsIepBNNCHvV|?S{(c#H&Z@)x>H2*;|fd%-2(o!=P-Y2J~syPCcq5&HSU^UC87OLBZ z7{Rc4sZHTn;|TQYoohX#T3`PV8F$(mbOaAy_%=?y@~!NgAo>6e@bmNYTlBhx&$te0 z!5{DnDig9t1m@5H;i*UhadB}kXMv($o{^KID=aHBmsC~F6<1Wu<`xtfBMB7qI%YTm zk*{q;s8j7^B{Vp_u&uBJ_H@qmBeQ?|gb5xz_ia4=(&Ae_L8J-r#zg{<666(0Kr>|x zYVCnNslvEWd6ofILdXDh{9elbTj4CA@{m-<^NNb5N~^0a<+ZgoB4Mc&b$jy5YNnr1 zB}z=oR@O^Yp34Z}8VE>qo{a&ce_KAgygR|H9Zq|M$C&lD%;Az zqhy0x=cqm)0qtYW2RDuadoTXIxby6vzV+iT$TM4W{>@{M*HRGr z49>mc@(Lq%wK!LxT%&AL1}eh@5|fk5b4V`bH8s}ih6V>Mr>K8?rF()oAOhQM3j6wX z;PJP1{@=Z;y zn#M*~MO{53>{kXm)wd(S`QR)Iel`nAYj9uh+F-o^DG`Ym-u0(n0<1T%eN37UK=m^@L6Gv&=k>wK12q7 zgL)71BJ#C-z6T_#csxh5ba<&t&Fr=-?Hjit&_*)qP&rvI^ioCQNT_VVeH}&A=-E6b zA}1P)?_fkO_fAZjm(1?feUi*6qz2CjrLy_4Y2RkoklNcK9d+V4cpkt*rg@c3(-8#z z{vati`J?Q-JOlKP$k!2phSv6Z(SUrdOJUvPdc8{de*CFP9$39kTvop zKB#Dwxh_7GYjzw7XczqfQUDRiN~)MyZt0fU1?^HxW4n~$_l){`)RrLh-e>S_Np+sh z?un3W$X6|+bAcx@v6pQq&j>(5Wg!WP`i9rUa>JffYdP)HJ5Hrq=BP`<`rsuQ6*hF* zE)vKps?u{(gC}5YNQxywT81H!6&9$5SuH9q)#4D;&>^#fD1amCoaRy8@Vw088snuI zNJvclBTS6W3lrA~1fF_W3xItzJW|r~H_1(&F=g(~rzw}!~DDhkwt)d176N3Ox)ar*9di4%gMpTV< zF3UnWzsC}nm@LOi&nwfy12>gh(U>(@-=`1cH}`mB;^O7#tf^TA>eg{)RXA!1#%C9^ z(T;u+Gg{d)U@H>zx<8AGjx;aV2R?j2+lU`hBO7BI8IQ-1ky!!)Nq?a4%*@Ebv6wY8 zvvuZ$>-)iVe@E4V*)KaFC1>QRQnLy*HyvRk{{9}jok&PZ;Ub=Wzo**Pnz zjuTWQG&Z&`yaEX{z9+HquSy~+On{>Ckj}zFlv8XeC<`u_7+$~mZrgp3>!Jt%zQpe09%W&l&CwiRp|~Snug3P zD2t_y;#r~1gCQfyih+~izO`{wfWie2=Fqdk$a;!o>@?EM(LLBa?BF$n; z4Jow_jBS8`WMb}FeQWz7Hhnx%hfg%1SR)cg=n*(KG)l((l>(`)gx5aTI?nE1Su!cq zq;5k1Kmi&PLCmMHFj&L2&~y;9+FxEfouiw7Ps1!Z`T`7%?hF$AF6k1ltz(fhHc0Th z`0MHu5t7Ib2w z0&^%#LZAe^$2AZL1t9ju(IRf3FGS%Xm{PFkWaW+>dSz9yfw5r8R>iQFbOL_RP#}_#%nm8hf6m z9s=)F(0GQn=r+g@nJFqSp8=^tn)tDc-s2k1;>F}QEWF1=5Cl?bE{kkMMMnetPwxbt zyE#N66LP{sF|lJ0`#3w3FD_;STk$ZF&~yVM8W6(wFmnPiZXsJ(98nNJCXgY>j-(^J zH~2`#l*SA?{L8aQ3Plt-{3t+S;};^r_KR~F;mCwC!%aKz9e65C>?~7Oc9a=fnux?-$WVP4!C-QY9}E*Y%ZM9|kChkalhA88Gm$bQIU*B~803U=Ib=h>fl``q zC&S)WU+C5_H`0qyWS9s=5C%qMLs@YnGwg`w4D^{lDEcVNkQ1T~570AM$xwz>q?=5Of?~oKeqS6~fjj4+KQcZQghO$&m1hXmH9~1BoFwVT|^RK%9|2(O3 UNZEBgFaQ7m07*qoM6N<$f+dJpNB{r; literal 0 HcmV?d00001 diff --git a/data/images/btnconfigs.png b/data/images/btnconfigs.png new file mode 100644 index 0000000000000000000000000000000000000000..ff3d94a632a49f0816b256b7f7d03b239f9e2866 GIT binary patch literal 4779 zcmV;c5>)MpP)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^t1xZ9f zRA@u3T3JwAX?DgvODCDibZTa*Gn1rKsZ?GjFOxh>)zl;}c}X79Nv0>p?EAinRbcj2 z2*kc45L%Fskl2kEpuu3UF?O3>7?8xO6-g|%aj#x-z6+wkZ47OPs^5~X?!7wS`M$IK z=lX)vJN~t)pTGCw`Lho$y!YNeJp1a)-@bV9{2%F-|NQdhi(fc7U3htcx&O=e=$|Ka z&ixn9pKIU$$xrXReDOl}(#dJh^*8T7e@7GE?(){zuYRhU|K{JN6WdMA<2G&cUE6l! z(AsW!$HaD_q|cJq&}GW4Rp~kP?fOFD6=S)4$Xeg?*-rDV)yJ(9);;+>+eY(kQ(Nog z(~s#sfAMx!yv0?mGhci_Kj__j*FHmQx1#HT{W7m{Eif`c?dIt-eaXdj($&><(%s#C z%G1+x%GcL-Iv^lmCO9~FHasG7jujiHzMRQfF05B<3a?G=s_xq!%O|Xwmiv2AZS&85 z_7*0c?-Iq-7e7|ce)Vzlgnd>tYTV1^cN+u3W7W>imnJV>y!gPeTwGix-Q3(Jy}Y~_ z zPtIr6InPqgee+AnxJ^JF-{uN$nEgUo^B0|+kBoL0f9cYt*BZ}avF2fLVq)UL<;#~B zl9Q7kIu<_Tcv^P;a;<7;OL@=wL_DhRX`T70rd$MtGWrvkopmDzB za>C=sy$|VlczB%fd`wKtJe$o{!{GGv^u?^Kti|l?>?Oy-=d`pm0AhgT7T2swN3>65 zcT6j)`DedXsh=O@f$#e#pL%+MjQ_Wm&mOImDDT+41H)#I8~f_}M2Twj$sh^#ni8l4Ke}df8$csxycdAY8ts%oXSwsxhiu5J|z@2jh; zSMVLcfgP~n01+FXuuv%<*rF`8MK=BJTojP*enpy}DpiizJiPs8&hotDdt@FTAD?NY zOGqavDQST`x(M%9R8;6-Y(qoCT2oWgnouZQr&p{s90Qoj%1RyB08;<~IVB_{sAJ+1 z)HUs+Ht8MHCS}3DeIp3f+&Aw_?pT`|2DCeVA(8X0Zf;W~jj6LhK>x`5kPozvR0#th z3rGgW3j~5Su~@t=l}a~cG8wb*ULuif00^JYUj;(|0VWU=2<+I{*!kFm%L}5x>4+}ykYRsaG_Ku!QpS&O+B;wd?| zSW7HCrHb$KS^%W64@f$*T+wxlkH7z%Z$QADx1ZmfyQk+2JnR7A9S}PEYDNl+C2!Za z8wv$o#?&01=1@LMWQYddhjH*Y3~p;{Gjw!x7&<#U4ejmi2Kua5C=?6`FabFsz>%rI z0s7Mr*j5FD%y3<+8A3k;n1Bo-V1SSk6- zS=CB?Mx}hy-OKMNxKoOSYYqTeMKvqO0BB`xS4vv-8u5 z?Q0{GJG}#=Hh3RK!}u##t{8iIdKeHm4rw7K5G%+`U=P8J0*IIb0Dph~nY=ocUNmOV zE9bwaZujtya{hlbk6U-6*s05*k&zE0qNA6>S*%5{a2!B5J9E(i;P`7c0m`duGZZ#< z8Oy}IrdmaxMc6U4)zUj^>lnCezdG_@N7>tFJ|QVc`!WV`7$~;^LMg=rtidPZty! zyKo6b%Ey0(&8c2_9RM85B>)8toyHQ;6;pM~b+e%D(=BPwh_$V6+Pz%+@ftdP_O` z^$(qBL-KR-{%U$@(`FcXJvt#l6U}C8;!@Ie+=e!DZk@`MUMAVdsA$+_I`}+_85L-P=~Q zQReBnZtl4;wAIAaeay!!J2Kpa3uTt35s z2`tpN_FF`qHBSSY1fsFGc0qy!MM-di>$F##jH2#D(1u&tr7k!d9$8vs;X8?)8Rx=eZ8LQQ^Y z?FyWLm_l;MC&$1+VX?^z*ozcOhqeU6>myDr_jf0Xn)|E>UU;4WtN=s|n@yFqbe&VL zGUwDNjb}*+-)EDIa%&G*;898~6(4{A6HVmN=I&uD*l1AnSW3$)R_X+jby-)x1%{K< zY!Zr@wEUvADoK|S`+_u1nHKlK{gCA#(;!yT0*Y!*U57z@+oE%lPS~~i4ee&=AD&N0 zNm)tE$Xd%RuF`YrWafN+n>nZUbO0Gu3O&1^VLgFUvzA^dXJWx2B?kz25^`uzeafU) zE{{6T!Xga-Noa{XZ(0GcK{a4W=kRp-RpQOK%zSMMr;HLwr!kLWE2%`J4~j`%baruN zdb4DnU`;q`v^dG`*|oXVG9!ypCp^!s6I0-{+e^fqcFF)&%0w2*L`Ks1cLEs|*)KGD z{*MN)O{xiUjM2I2vS5Xg#KE!jxRDbyrqwhYaBa zWH;Q;k0v0;e=C_rIaG};h=CcNz!R0dA8 z8izm-;4lmZB3ohk_yx{jeiRrUJ8pORjEH=ytsWLS{3oTlHxbvQ77ZFvi=EO>}CZCM<=k`=j%v6C0}n$-q|Auzrjf z*k<$l79WL2$1EasB8`H9w0s_EvfV~3*mzAx!F;Z&{3Za%TJEQ8RXzQJX1x7F-Z=dL zFakYU(>u3Ub9GKY&D^tpm5iD8qLb1!2xO$v)O_9sdEbs;Mm8#@U_OY20~XHHTAT(V zA-8hntS#zU-}}&rr)gyKbHUJ>ixcgGKcr@EBdwUf5l(G%Y*Lc8uwJ@VCh6Q}ve5wu z8&WFM8&PX1zcpY}cU&mYiDk?lWX_5>}H zPyQetGd_+?NM4RaM@rc!DLr!)v4F*`msk%A8zUuDXQsHFqf0$aO71@XXKMX*0KEKy zA)kGI|8m^Xj*JGWKSN)E))_l8G;&NZAEnf+HAg%gNa-LRX#Vd2@kTkNls0erQCf^h z%wA%1YF2{SS=zVterkz$y=i#UMl+(nJh8E-t~5?CsCyg{o4Dj)A^s3R8mDmMC>}^k zCqNJr6cdKi*uX}}%_rc5w?CoQ<81&SOY!?PPwH+g*2*V8KRIe_o%!k)lG~P5PD7_T z1S}lx4NwOXODJ@Kttdu-W1UrK^|E)(ry!?aDrFR$#qcIV5b9bM{!h0MGiAjD)+JDL) z&?cWcnWM4Yp9x3w*J`iLJ_?VCU&0>YaFer=lAFJgn3cWm2yB2zgMS=}CFW*@h=U7aYb$lidV|?i_8q+|Ugv@&R_{`!yZXO=f zo-|OX>Ym)K?^~Xxc>VLU=A(Z{J;rL0Y`_*86}^b!hT3pEs2v~@nReqK#io|>&0sA! zJe-*)`ONc+PDa2GhgXlkdeGz#hI;$@&H}t&K)^f(YPcRCJiL8oID%di zd4Ie4?)I&Nb;xY2`1tQE2T%Y26G35-3;BXx3p_6zF$A|v?*H)I z-amd~>+F{oXm0v1^jOtUcYSs*E}f$bC9mNJVH6ra#Kvii9D-q(aZEdK4Ppw50S2as zU5qked~|Y_rmE|+Jt|h)f}87qP)vXM{XG9Vr1Y5e@0)IJ42o`T?xUHDh)-gEki2;S zLDu!;~B)oL2Mit4)2rUkQ2O)7>I~tFJ)DT4g9`` z`@)gU9m?~m^6AgtoGRZ17CpuJC3Ua4qFV-&aCrS`iG0wOQc%4Sos_DLjEi3e7{~(5 zIL4F+enu(?YC4C`)ua?uZ4^uU?d0*Nq7nUeecuwFnEvZ`vF+T~$|s**AVxlv+};Xo zy16z^tn3O$R`=_AryiHc`t4lWH{?``jG3i;eO4*okWKHY0ko8~^xJE%Jb2tRr2AYv zX4s|C;7r4(S~kVmucY^O-(BnHMsVyz0`ep3%ReGkF4Dun8j`_X$sNKLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000rhNkl$MAb^g{`d+#%k`?9ZJiSr_f6F(9l1X2hUv{kDjKs2!p3D6%} zseemjqB}2!D2r~`#zBagC`lk@o;cG*A*uiR zbDur$4$Qvy<_`a5z9bBC!r{XYCIEW@+zMbnfSmw(A`)3-PMAGNa2Adt(!>y27EvNv zC&H5eofeUEfAy(PU1^}6v;F@%AjA*?edNgD3XX#S?gg+9z+ieeW@ZrswzsXl2lca zD)uC%u8cScM`i*sIS2%EQ*+f~s;W6>%{gn+=C*0-vE}@ONj>?}-+cb_>vi2+yD#6! zful!{1_Is<;4pyR)OgxrI#__ffh0x_u_uH6AXL469L~?j!C+YRdi|>3@5Pv^m{Lq4 zA&N*4i6Vi8SVV+bScsX4hzRaP-8o`zJ6UAg!GnjMKK8^D>Sq3Pl+cEa?*#C`6k+Jq zpI{IZgoPv~NvS7Qzn|upcW>Ky{oZA%dW$=E?ie(s1YzM}zp~4hF1Ja1Ji2;$ByKek z6o8w-5R|2CI^onM+0_Q_?Y*grA*J})OpcQEXOs{DM~@tR2Y^3fW_EXSz~R0zwTKBK zfkH^3H^11s?$$eQ+;ziEH!bhlwH#AQOr0e$3b6zb95DpAxvLgkyLx%;^2_IcBDuZ- z*X)3Lv0|D_F1gfoqitQ6x~@x8PwKjD$4%3GFUI)ypZ<$a*J|o-n1PRd?4g?oILsmm z0L&e(rVew^)B$2jRX;7?eB0jrZ@>4z()Jz8Ad1;c%t2rvFvGhlhp?ciftkS)WZTX? z+qUi8wK!f~S-P1T>rpy-J*|zQT#P|=`8}tAXaMz)` zJ}EKoi!lZk>B`a7LGDBhV&>QzREO?=|6AXB-+S*F&do0wAps=rMgYJ}01=qzbxC$2 zxH|#Fu}W!SdB@VY$x*85Ct$-Gjr{Fz=*>=zwv?l_8mNQtAVN+q)r0{Gl!`I1Q5~8QZUno@!kCO zX`nmb)Qq+-Z||>;+o0pMRRYvayZ=(WXz|=R;JK8A0|yVBICHc6mLqs zUW}<1M1pjzhKRdLkUQ^v?_K-vdfTmPNL|!B!vVmt=|m}tq6#yExud9c*>Q)eb(cBJ z45cX4L3J*2^S)bmd4K6TRTBpoLfSdqnAyhr8?Vi& zX;k*ydfVPn@i}t?Y@;Q7nm0_(-j}LsJIgc!A;ud-+dQ}nsv&=&fAog4Obe%QAvM&D|@z2?F+2*r$dUU&WWmDU$?$xu}%TvNmGHG#KvCDdG|_ms1U*zlxMX zpeiM1CNfn7VXxbq+tOlgPz|oGk6`AsaW^Lb2JN7hs{Wv_9EZ@+YAMBwX4hF3+zCMC zz)}#AMPcbnN7RX!2o7Q;>o)QpvliMKk#2BzWh8+)D+a9Uxn$F#Zl-P>rExeIj_m>N%S6Pf%E?=Dmg9t;lG$O1-;1~iu_rkgL=bn1{k`U;ITW(q2fBRb& z4TccJ>a1;uAz0H+8=p3a;zn;cgCtZrXVX$lRn5(voMvUrM83NV`P6or4G!-*N+d|X z-;bpzyT2YeI*4>oH~5ta5GHanJNwLYmrFevm!=*6`1u#EOzNf(O&N!qkpo^7s=j$o z?aWpn5!N-PIl4C$}O|Hz0xBv=pikN>Mazwn1Oz9rxV5 z|Lse}!fkH7EyW#>aZ^)U3WON?8gx(wNC@N6dgI!fnz~PE$@DV>kOA&N%_nZunERkZ z1D`e&5fgFS*0s7%hsf(?G;0@se6zGt~uicY^zjy^#|l zbX-qrbK+|{006BTt&c`=e%PNMPwKUPucE7KYb8pQj)}UPsn<<53UPSh@=9vj35aB) ze0+*+M1Yx^wmGk@TwV#e_-oGXh7M5R_(_0TqghqEDWNbhq$9)5OcC{XeRX9tSXc~Z z&YMw~-K&#E*T!RV(A>hX&*QpTkE#|#J6v&x!bn0KUb(tDTwPgZVgiwM;^?gPm_SA# zf?d7*lNDXPvO-L+bznBBvb&Gu_=)4|ci(;YyF&`wV~B}6Ho+U~JF#C`ANO|bzHUj? zc%ymo>cicDx^5`vHpZ&oCn9k`ido2Ry{6dwD;F>KR#(=$;l#|DP z@Kj#Cbe`}!`PTs`!7sV_@z5y)cC57dR_$34(+*mBO7xg9Ub*y2&h6e})&q#Hr6{{~ z#*8Knjm8&(1Q`ko+zXnvpvf&@P9g#90-*Iz- zlL^6`K+`grp_tlqkC-h&#iN9B>WLpd)3dxvM1D=#hoA(U8;vL9Fm>RZmGVN)c^FHI zEW+gE+;uZzh_-h1{PXqt4Lc;Jp_wzhLk6Gfj60Th;QBo~5rlE^(p97sP>SNm=U>8s zeYas{eI31C4}*S%(iXh*%0;Y?MpG)%6^aPkl}i_{TzUS?sl@a~TDy@`?Vx8SlW{8m zaPq{H?SVsgEf8aW2qA`!l@fS1oq-gCoqh4e@!p%>va_^>&AW)gfm9{jd-nmvAXu6o z;2*YXkq3-<0_#`<`IOP8-~h!Ezk>^?g7t$+S*gkJ8{ z?rS=ra6Ajbf1NyWy6Kvg+)Hl1m78`gw@q7AOIHrlCMBXEg6kI2rBlcL=S=EHGdI`i z?mIUaV*BDe`YEAq3%+~&M>zf5i(qCHReb;P6NoW@7%($Dcm5T;a`6((46PO~W-9Rd zf4}peKNQ#V40dMef_LpFLjV2suYG-eJXznIAk0h;ef;4EtKQ%vbMteLI~I)e*VM{zCF45_Jel}=NIP3bwi`cmbbK|J+t=0nJ4BVR)UC=FflQ+Fmn)|iA(0@rj`MG55Tuio;-PNZPd-Z z!JyDNYf0DSF{M;@`C zsZNuyeDa}(|1ed9_wsOS53!*rK;7*_!HL^~GXYz%`g~@``*x*JOdMO>9bTzZMsGZtf z$jrsNF|*ZrceSo%vlT1aSSimr@P$Vnd1Un$ctYcT^2t+q|DF5JIN5eH-#K0P8NBga zdt*J`cs(U}wn59g1;Wj`6$Hc#=dO>5sB11_VkQQeJIu6{oO7G=B)9EZGyCGBkN)F} zZvKlsVgi8Er_SV4C!RcZaQ~fi*~%^$$h+mMO9D;XatopNsen$iy#h0Zb1HDo7T9SZ z2vcfjW~FG(xvkr_UCB-RteSrAD_?o^CABwxZv0ana2VXp@3`~MACb_is_rt?%FSkS zEBQ=t26Ynj)UO%o^^U&N)ER7w8s<~AO3k#iZE17cPMWs4Q0nrymi!O@^wmeNXvuH> zLHCqh)5jiqXqkjR8bUZ!rT$XtC5a*RI0fMlSinpKW+8&J&uBA2r^=(5!QEB0sHqjr zR@%DFxzV;6wb@@TP4iWAefrVI9?Nah{Azz{K*V5y969pQ>m|r*+iUOGuL*Vbavmb~KHURL+B z-j=7DCO`d+Z+>&E^~gp)N7Uc+uT`)q&doX#AOHPN?k1wW9AsHoc7o_e=1wWKLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000wnNkl6qu-us+$UvuY84mqSKQV&yeK8y9B=XW#W+-}?3;{D{|cXDSy2%S3WlI@tOc!GDCf zd5lE5U;+sdtOBBA3Ds*7s`IVcy)P)^oTy%Z@_1bSD8ElX%tOz-T37%JWuAUAl=;BtFf&<=$#xRA zbo+gsxqU|>YILtx%KtWMw!i%ICz^d#KvjM;1)g~&Co<-6I@tUb5&7A*b0__!)87~k z2Wy$6B?m|_Do_F#OvV{lYsr{eSnC`)Yq=KQ5i^5Gi3m`&fDw>saFWcJ+1rjb<`3LS zMJay~wY$ISlFr#Dj>n>^Kb!*3ovs)}$FfoXx3cZc!{@&JCxffseQ6M?Ttq=oRY1W6 z5DcudWUL|QB67}>b&hQmk+Y7SwPcJTW(E^YepjKYs><+z;37kfg@f^)J0Fa>+3v+N zE5FE$lb^pY_TS4B-&297Um06f{fzkX->;oJ)qUd|U%sAhu2;gM8f5ZlEj%-Wts`SB zxyVuEB6e{^&PD8;V`m-PsREY4U=Xzah-wI;!3PaNi5!Q>H0|t>2Rbtc?yi`kf9=}c zXP-O~R}%F5Q{cHX6<1a9xX<%nzxK|nb7#Kx>}HwvDhYr>cOE4oSSGNwWUM9UVsg&0 zi(-zFh@&XtI(!^k!)%PLLx>q51prkMl^_x-uRc^-dIeO0sO6ULe8A1^yJM`T^~I#! zedhD`CjpSZT!H6a3k2xB`FQx>*Ur7tJoA5^-YABBFHm5Y0f-oe42)wkHX`R7HM@(A z`F*P`o3t8x_N_!&;n}dEb~Do6#zsh3s%*PgSp-i+b@V7iL`6a+zN)0Ef|gzor~*tw zR}LSK=WaWOcxLYxh|M?u!F@({r-c20`4va9(e{77_RcHa*Z%zX*Yn}Fzcq=77={hl z7&12E#oO+j-Fx`x!qWcLRun~SjDd(?&RNvS3LIKlL|+q#uXM0+z1+HbDUCv&DO4aD zykRgA057Vg!mC!2%GI}DDipTWUBzz))t?9G#Dl24pfkt;eS~>B^ylW&~V~jD(hK*%r%WNz$6TwuPrCV4#_flpI z9vW?4`vnH=7@psceLtU$`d_^E_IGIW(wUKEM}`eE^Hg?XCXh9J-=}`|(0va*yy7cQ zL3GEu01$!zs_-HRAwcB)t}3F?Nsg)lRpk+a(DJ>1v*X))<^V7=voS=5m>7mgiL??7 z)-U@T=g$_f{4bw=rP#;J?)!g0K9|sWS;n5kUwF2?1UNstQ$w1ljR~O#Y^-@IjDf1r8s(uT`~{=ZH{y-7uI5 zOa}0k24DKkci&2@QNJOoUg3h}J^Zb#ccN!3O|96#~l2@A_Yu<6BqW$t@IYn3xIRi3`bqTl4KZ?m5=U@&Z#Bqau@~ zb>i+4K8hkN%+F$eZUzf;9n8&k;GBc6LLEjEtLv^@m|kg?W8dLB8vR^i716rOsfq^m z5+syW=v})|Fh{pD>p=_XT_WY;X!E_C*%=TBASDWlItOU~o%hZ|CqnN^+Nt%Y$txmQ zURr?o(uX|t%1|K!8^bfr#L!I3Zfy1;UcpSeV9ERWL-pPi%`SJs#>G*Pph1F45CrjB zRVu^YM&VI5dsi<$%-MGD6IDJoRXPk{1v7)7b?YHQrD6^qxvQOK*~E=HDTlT2Q^7?9 z^YdNJ2K~(ERGTN<#+RcQWwKUsqAh9IrpkFP_&%k^CfiT)BtzM9{+EE4@`6_4# zL461ab$^kfEG0{~oOA9jcCkBJb9AfshLEe;Kf3MwH6_S9ieycA3}h24p~6tgI7Pzg`gS)DpFF& zM}cgz->T|Nm8Aq$!UVG@Y5+q_)NFR65c~&{ZFkL2k_1JTmXS3osjg34n1n1g|1qrT%~gFapi9 zu|R#>0t#Q|3fL(iAdsTgfw2&kT!+uiIDC39Vfr0}48s~rAqdXD`TD38Suw`Y#?_1C z&Cz|awG0q6crVr@kRUr%?ba)J0UOIz2pW7)5vhR{Gbw_I4%b1xR64h@qs$#_V@0q5?!95HT_3**K^wT-k>N*=hY#NT8}H%Mxs@@xJc1!z{;R zKlxa3C@U>1FJMDOULr`?+2_`!sz}E}FFvS-putZ-At`}`t#Kqw z!K!LulNRZ8!k%OSF+(_z%X=OGGU}kl;QE0HD9;NtW;;=trDYrmu5a|i(!#8H;_rWM zh5(F$X5N9|(>$17-g{ULg%6X438^C^03op2xM5hdvJ(6o zQQVq`SXPy~0Rxb_i-8DLk>%=xr|%iBAz(btx!r2Vqw%n4x0q~z)1`|zsplCYI zLStqoUcb>dRawDB?gM+72~5t@Ow#SGJepLh>FgzJ)WMmk)uj+{$@;Q*+qOHOvXN1h zP!Fm#{sGsMS6QyVUedzd@vVux`x=hMAa2L4)(nlaQR%EvE~~(Gbq@I}qg7;^3^s^=t2CF66~dSOcgNhKOU!akFWPtbdVPi!0xV;%oX8{Qv;c z@yHj~-|aOl?Pd~cfMXmQ^DCC)Mzyed_|F(hYk+xuZsl-76QXQ~Kq3Il)ai7plW(mJ zmS_XsSCfI|=2eyj(mX?&rSLvroTcb(^)MU_(H{&TBFOR_<8+MSXoRY&;Dg_p&}s-? zppnEl`Qo47Xjm$-n}Y(t#ISLT=k^_rDaa)eT(M7{NQ(dZ{Ci*NEFXGAn=NRSDMOX& zhlxO7HlX49*0ti!ma)bKxw$8JAF#MEk3)y{gNShH@>R52O^7JoIQu4k{Gq>rt5>gM zrrXB++zk4I5iVZ1jLLf$mPs`dL@vUOYge=C`o(qkf&RcSE~2R2GIM(lFf=^>Paa+# zGXONYOJ60X8_NfdwImpo8h``P2^9irH)46~)QdObIMQijn?eay#m7z@1pqA0cJOx} z{W09Ox(A>B_&xaSXCB4s-UZApbaD6LRrIz7c;b=cICyXs*#zNw9}q;qjPS|}|NC-e zIP4HUb=rcN$k@a#uHGFHM*|W4qsseG$294+DCzvp{Gp@HHJhwKATllbHFhUv+S9Sw z*^^(t(QGtoR>6Bz-eX~Y4u_Uzuy>)0AOU~)!YQ17?QOIo3nt)8&;1dO9N3HbnFbE- zU&bGwd<$>AeICXblvUl(8gU}u{@VY%+;uW~pF`paxFk^0;Kt&L-Fw^7hLq)>F6_JW zO^6Di<}&c~scdDuz483jvoAK+-}u&;tr8nclhK|4Ooni1TI8M82Oe82%91PZVT}PZ z!y1dhXjnHPYZ18!qjXf0Tv4I9G{s;v!Z^!djDf16 z-E3pj-$-A5{(qfsN!n*-B4%P^*jU5H7`u5ziP>&9Ute2ad*|$Twphh?+HE-J5JIRc zN>!l-cXh3=Cgsvui*~aKqoMrn=@-|w&b{=`e8Z#@LW>PE8)MlR$2N+|B`w?OE}8vz zJ?OxE-dXphD$hec9DN8oO~8NqX8(AeZvXz~rPtc;zWPGn7~z_rn~rM)C@`IlnG8mG z=|&p0I`exP?U}jAxX4Tq5lN<^MK>`PGzRd$6xSi`fskC|4wq{>|YF6 zy)o8-jj0DudcQ-083cyv4(9@>s;FoPK}4j!n|#-hJnUFac8NknFeav`HG{d8yWQe} zqnT|s{!4Ry-+%fSKYiDDNm)(^&UmP%3#L8eYpqk95 zov;G$+D=i^{#wtnDysDWuamKH_w+G&q-MU^S#^!3onJXhdk)=~!`RrXwhuN)1Bxb5azq zw_hLkufCakEh|gpNG!-qGLpa`2C0G+Dlh=3K9*#fMxU}tU|hn<+#I?~M>y^-mlCSq zH7@$?U;aA}Ui04jB2WKnUp094bhU4=apj*f;YpRSw0-4bG3Z?=s?Cj3qg*O+q%4so zQK_tgJOUG0iq$$&Xas8s*3MEgzZlvJdkneOSiJw*?7k!a@fRQ7cR{PM4`qP=|D4kQ z&@X#Dcg9EC8&?iM$72yvQ&>8q={MvbJT=!R$Z%EMp4JZ zx*%}xk?Pk;@#VSIyU+cjPj+)(6%xwu*Za20Euqz9=GETS^Pg6gAB&R4F+*lKh;NaQ zqlkgvD;Sg#^ja}a-%$;(Ebc$_C&45af9Y?n^s6)%kqW;0fnQd^{~G|L0_$0pKr@E` O0000Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^jsYygZ zRA@u(nOSUARTPFnaYV!*AyLr;Vn~bzhnS!sF~*pPnh@nhqfct^l?UUC(O`nc_@tN^ zqtOtcrO+}D1THuxHmoZxEe*=b%ED1zULI6bR0JnZoCr>xIu#r^aNx?yl`EgRW4*9->()Xa z{PE+*gOevu24~Kk362~&637G3-th#?@-FzAnwp@bqyz%b-Esob_A6VqY$@NdV@I!a zyi_uH$OR!#Q_|AX7G!5<*F}LpckWy$E4{lw&)@5lShHr$`;u7g;lqd9H*Vbcm7W=Q zQ-})Ktel*jCe!wzLx*DP*RM|(kO{gsbKSaifA8A0tLfmugE5{tcI;T-TORQB_4VOU zO!V&Cx35Ho_)K#=0?5qF%#Rc&U6(Ik4tjceg7fFkU)#KS^AeG`dsHL_UtJd zk=5-bQkPO#uHT#ip1_PJE!PWfW+J$e5%K{vQX;)JHa3RWAZ^+wy^>}npMJ^swGopL zfm!?a@9%Y+GeFTAs~U%ky2GA>gn5CWwm>!#cmWb7rKYB)(38l@z>|3hbhR((Bi8@g zwQGMenE(jzWE`~>g8-3}4I={>o+U{2{6D(i&-X-9!V?$;%LAU`M%7jtZlupj$_q+W zFQ`BHRZ+i;q2R5ztYZBQc^%C{#2wscKt@3Or1Re;li9NVR1upYaEmnR@J2i-QK?yr z_%QHXlM!fHHmSK=#!wIT*Xq@)3GAVbo-RD0om4}-%4^`UpaLt*^)>)xp9ctC6^VuM zET&{IU9oe{_68Qv!~=4I80%wsz!M`7B1X8!d#r~M)g6B^WDT;7w0%S6b*n4{^78UR zX)yTCu+e!8^I(pm%- zz!H47!FLAMQ+&)xL_qJ4(>hf=4+$(wdSzf~C55)$zH8y3KQ=$}RX z0T_Y1s)?T*F5omrCSEf`@UD&A+}tq5;tf|eF8E;y!~>6uu{Z>n+#OgBg6eZ(s+`Xc zM?m!>AJ4inG&!n)4CiJ()*HxVgKdf_B+>&>;N2dE&+dR6B#@A@*q4b2$kLB1DYRI9 zz^m?nfD4}Iz~r|wHxN(?eM1t6xkn(jAptD9BrA{s_-un~+=m1%*PggR8De@A2|f3l zrCinmprvE3Ylk;z`6%#^Q98{SvW80bc;(q_wu-W3zaqUK7aDk~<;9B^!z#>YQXT)@ zjDhP}ROz@vMR2BDK{ek5-T%?{3f4~<8UE9na2SSc3_M^JaUPD5j zn5&F5pCNZvV_^f|*47qIjAtk|5aJ%*Adg$-AUG8d-Me@1&K95_)N%fy_i8l4O}`aK ztK3$}$#C3vEl+9}mc>f*^BMB)Jb_Q{U`&nN&j7>PfM++wKt}W_RxxP+T&aIN29izh#8DCs}V!c|&h(B&quqRK+w`?kNJjJ9}KD6D1`#k6SAAz2NU3-1~qh zsR;bLBeK4|q`dwKf$X2zASnXc&UyInN-16;ibnvi;3XeC1avCWAp-Y}ihz#$K300X z7ViWB&kzsjA1S$6$ z)*lYMk&slcD}{cTDuF3lAeQXm6VI^`C#V4j5zc_fhI~A-6Nsv}av%`T$T4>+R z^8iO$QD?APzeCmct(4^BJ}l-BtM}OElTeZBRqtM^V2xpUJ4LY8!neGEcRNcC4EWta z`d+Nlhf4RD210;WEY2MC1?rd;q ze~~Boyq@e_x9vH$l4K~22fcA~e)qj?%>JW={{^M-1i?~W2vYz6002ovPDHLkV1m)Z Bc-{a2 literal 0 HcmV?d00001 diff --git a/data/images/btngamecfgs.png b/data/images/btngamecfgs.png new file mode 100644 index 0000000000000000000000000000000000000000..39bc6f885c9bb5d6446d71741d11abfa2d41ed87 GIT binary patch literal 1980 zcmV;t2SfOYP)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^i7D+@w zRA@u(nOkTbRTPF>t=C#BS_*0vTBIOKy&zOui--tT1<}4J`lM1{`yjrEq7X%V(h4Gq zQVJG9@j=moeThkPA%?_+gftHLuPTI7BflbaivoHU@ z*1y(Xd(WCR|NkwuKzVujCfYr;dtKYg_e(BndsS9eKG4|M*xTCL8d+;=Ym3_3+x2~> zy1M%9i<(4TUEQ}`U0qSwdU|@IzP`SwzrR0%%v421#jO{u7wYTlYdm-n5cq+CfvB^y zGr|LR{3i$qcnE%QaL@?cx#|Sa_WfA534KqaZg2QVx@Vk)C7=8>Drzfcney|#=wt^j6|cOqtV#dSTsI9E|BwByoEK&=nwXP!CTXF zjPqv6B$#*?;Ds1%bq{`GVj?oYA`}AmB=E#Lxk)hKGW2}%e1lH{9{!FI zW{APZb4dvTH#RpnFKD`0^Ol!La-!*EjMKSj(WAP~UMx ze84LEgn?{nRQrJD5*a;DlZ_|F9Dhm9xd^B;gSMi-#v~F3URqZR3EDHi4=AAJ33)`G z@`3BYLwt%rei=oq%}t;{VmpDnm_mKF5kP_U-bo{1=~M({9LXw9PJlm4dVO(4wG+Yf zBt_Vqx2^!D$txsaDb=!4m{!dj-V-844E|D*)oqYc7ZUn8&brca*7)!Q{NAANTEn~` zG9rKn=8*A&C6j=_POLxet*^|YmNh$tfoxu|{lWGK&85!3|832hh8w=l}+Tct_?8WcJ5d3^{Hic6#h=V6k8%EEOAgNy^f$o@t!ck`YNR zuPj+Z*~Y5LxO^_~YC0y`XaB!2`Il+#X8c}cITMl)5o<~gvV0PF+bHqI51zm?o#;;?Y6E@y9L6emXR1CbCUYvAKbm1P7-p%2S~;T4GA`lU@} z0IOx}f0!vaL!2TZY)c{m*^e#d#-(COD71VWco~Xx`qh#(Ag~@*M|D)BgKD2SP2`V* zB4DR0{r4F|ph(9pcw$GmgEHR+z`ti_g>c`n&)PIC%Y{WEYtDs@`A3+0d3h}ov^`kx zDK*@A(jNzHBMLVg?}UK+kX(TKV zZTBoj!fGzBd1U>4?gPECK~7f^RP`#Z!n3R@Mx|4ECrwIOvPoELdGJaqfPbPS>)RlL z@dZi4A2KWRXWI9-K76%X;hg7;DhM;LtS4MZUAr78z7M=5F1{R zW`4KD{pD`EH(<5xA$VCWtlKYi!X~4r%i9M_a6)|yL@)h-4pV-Vby_U zT~Mi4Z!H1(D^0Iu7aKuZfqWjyI@bm3r=z4Y6zyu)&dqz@3&!j`E&LB4z0;aMxX>sicS#qC^1n} z^cF;k8l5ZWJLi1&k9+QZp1t4lthIjSUH`m0&eT|!o`#bK007YI>%q(~M#%4%isIsH zb?GqnVz`Rew#HkaUGaW!ECQh6f_6dx^^tHlggFB465!o~Pyql)fgYCDcx$7ZP-iq! z68;+_>5s%*umJ!SHGd4;*%N^WIw9OVP^tny8(Rc`9xkc^R&quVBa9Zp-9s-Bi?9eZ zwsa2kbXIZ^P`d$C@rParAQ5;t&>!iA!a@C21^(29Ud(@Qg9U(pLhzod0{==vhL!=;Jh%{JA8YHCvm63)*Ai%#Kfs1HZ7gwk` zOy{py7b{f(cRU^g1%v(k{3QKkB+*zmu#}RL(r*oEY0w1%gbP67;r<{LPVjF97y{>v z^}ygg&?w+Uo~+Hz8|+AzhxxiGY|4-$dG|IKyzFIVQT4p^16^)-o8TL*sQa|tsg`CXLgW|FJMDLQ^)GI7l5@Q6f1T|L%SC&2Dj10LIynopa$CX&W zRg*l`%pXU{s0`gh@ACLfz{etW%NOTbjuJ!;&=WyF!BTypmw6}XIH~&7=@c(bRb^2# z3}L8$07NG?aNtcL6_YNE$Xa>@~_DtlwwpeC1lLmH+f?zkv5!!8^9hf&bX{{_hl=)2Gbv{u~$R& zDI${d!4OAUo>ZWqu*9WNmW>L%fl94ED&8MHwS~yb0<}BqVU>`Js0qphrAuHbcypo3i#&2ZJJJ2hO zo=w|D?}r>*dedZtO@vuw4b7apIFV(yhxF(R4J-^cX|7qyKioL!|9R$s@O3>ZG0Lo! zt&A}{p^N6<QriZ_WkkQUzl?s3!TOz(25ISrB9T4yB@Sf8&+1$%{|}s#b^Gw>vOkv z@V0o^DQn2)%!g9lnS;11<1dK&n!FFB9ZQ5w+!Op*C>=x@s3`;ZP`W=pjPfSg?FrK_ zI#|+RUqrafaSC}SdDy$%c}54kOfgHvO{bdD9!R_xF896NWq)%#7tR)~B{R;E-F&ylR(8}?NyJ#@-Mky#CK-?=+#fM33)ktW?P5}l zmrDPBpg%o4_+EI&ZrR(I3pf9Qa$`DPX<+Xv08rbyGJa~_(-TX+s9zwwA#1toVJhF( z%W%V#tJ z4#HIs4+7vT$j3b{Y$(TJE#_vHjv-WM=-Xy#C)5e0jw$GA_*Yc*adDdq*V#Cv7!+2RBu5UUor!kr>?GCG7bFY8L;MlegyQM3$;?Jiy`^wH~Utl z_+;DwKxpy&wj`{3s^jrfW5sEv3_a4VEZ=_ibiHX1e?Z z5v}F-(Phs#yUI;Y7O$vTl85;6uZqurr~!!5X!b0LpjTxz$Z6M4eG(nzMaFr)fVfh# zyNm_>K4~MQW^EcuKlX$OH{7X6F}x#$mzI&*xolaa)h^51F_`C+M;tnUi0L*aaUZrG zNW3|SqTO)G;F@9Km{4JgC1-}O4v+!!da^t{P%JszT%q2;z+jH~!R(8QmzeBA`3Bh_ zU-#~*%)U{d2xlkbk4e$@MYNNVL%au;&T&%qQ&U-H*3;$#zIF4a4Xquu?qL12ET;?%)!<0x3V;H*DD0Ni+8azGM_}F z!3m-%qB3kVPvLXH^cCPfROigX4Jyfkffa}w?}&%j(!rSxlEVkKcYl4A5Sa9XJm}Dt zJu~MI{K#Ww&Je0Aq@)gXZv@(k^)+?UW%ET_kKI8xr-p!ZiT;Z5YQ8+zM0cEu?ELL( zdmdfp78jRmSUlR|QJAQDXGxQePqHJ<1jOO<6}y9oZz{4HJ(a_?TSnd)3o6K3E(ZG_ zSDUfWayTlpTneGvid`a)TkQOV>bDsm#Zn1 z#h;c0KNMY7pT5G8^Z7RA!vZEI4jVcheZ8M?#Eqwwk^Fy4x-$tM5@7|Oa9Ge#b4$! zLh4gA&z@#p?!&AN6sTB^IH)r|8D> z6r~;K81VjGld{4>h~sH>d;Y57BCt+cIiX~EAo0gNI8}uGy(q=v<1r@te1HD-vG3Gg zIMm>Nxv0;u-t3!uNSNKbQZ0lLE~{e=I6&9e5FGIirOrktg8J01-fEd~!2i83Sz?1}|abU{}=bt3~9QmuYIuO;LSQ^f=9mn%>oH z->$$XXQti?mvTqr5v1qKz0)<2OH=o7lZkhQC9oE@eraj)xa7HJ(0rql{gXz4Tv#5< z87i*b2Z}D`PzmprEMNwaCmAuYZ;%X(`oDz z`=fb(`Q>f;EW)e(qhQ{)`%~gIr#>m0aQb_L^yB2(${oeV&qH}SeT#LDVXG$FDpg69 zc3HNZQ?ETlDW-0G3c)Y$S6MHvmj>2zm58eiFWh=XMDU;%j7)~;^o2l z(^2qtFt@H(XyEl{{)>ecP@1&Oezrcb5jjAb(fp4RUqRV{a9!Sz4p)!ud0Au5WyLGY zinjv}uT#A+Kn9&C5!@f(We$y3 zN7K$%VBb)ZkrYDDy-f~(j&xc%sBAm!ya21XH;!K?s-4?C2%Vpv7mXWEPgLJAE7RTr z>#yPnxbC|FxY-k-HFsdQO!4fYgPvMBOhlw2rp5wX?$c^pF5mbXQk;BF4C~KPJ-Ul7 zHVYz&0Y~&+ZU}x_X@>pj+#h;Qspdbw!x%F43ke$Xot#*kU}14*ha`Qs71r(@^yQOH z`YMsQ`i?z~?fY& z=5~W8%D|2dtg`#w8cI`xJ}2eQ!ArFpjp!BoTDIpwXJ3E4&|+-j*4bjSnI59~Xoc$T zSrAvxfv0||DGETX^m`^467pWf$S1)|luTdI4Lzhdb(~!uF4Z*Nukz(c$(8q#d+X~g zY?B48=lINS^&0QtTsTFx%(g)*4BD$N=xofrMK_j@2d^A>a#&bRW{2)R(p~T9=s3T$ zR_$#&VHAXZ8#SgG4^WL?3>cMGXB8CDzp6Q&Ws8zqy5wR5;35@=QR^l@bFS?jiu}b~ zW^98z(KlkNju6wjo_FTP?{7T5(SiH6*-H~o{jF+D47Um~j7uX`+g^J|e73ce)B9S(Ub=3U!z*+lK7JjW;=JQHC)MtXk{u zga=#>+D@N58suf3%X_oi9aQp2qv{PJe&DGMg`coD2sbY3t|dc13ZEvcITBIZYdt?d z21FwAWdnNWNQ$)8mc2JJv8^HLfb}|ViM%A74(+hk)Ci&d6-+x* zJhm%1U4D$R-aCXRb%b^iyc&=;e(kE6FXSWWFMW&IEvqtTUZ>_=DVj<186DO5+^o!= z;H0`S#pG(6!p)pLL;-u8x0S^1^Mpr><>ARrOK{lXtlHr)=?mpS~O=vgr2zAa%Mz5Wm}=S z*CuQoJa+ACiK4N|`FL{Z$l1KwQPv&t967E}0WZ=``7^uyBPiIkxh!(LG*)b5uep#u zX!%%3{sa4Px&kP$)Y?GxCOvekFih3if^hbMFLWRvX!;;$KYIS0j00e5`rv5j#}kd; Pe<1a>jbRmRl{ literal 0 HcmV?d00001 diff --git a/data/images/btninfo.png b/data/images/btninfo.png new file mode 100644 index 0000000000000000000000000000000000000000..ebf1c941f96fdeb84fe6e28f1c87fd7d38de3f60 GIT binary patch literal 3904 zcmV-G55MqPx#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^pnn^@K zRA@uBS@}<6=M^QLNvgI|(l%-;MQPNeQl(05l~$F~N{ON>sj5nmx`iFH?`9eHeII6k zffeW8?#1oJz8{`|La{Wm`Q7q0)2$z)%?z@I()qX767 z*iT^}!%|=su-d@Dz{cRjA;JxYT>3smK%FN7EWo2cl zVZC^L@xp}*|HSosXM}UQuL0zpSiGS6Nv(SXEW!F}~-0e$I6uT7mTXptQ8~{0X5Qzs#L3RfhrR zeR`j%Bauj+15d95jEx>q&&`7!8o<1aZmn$c|Y7VCP`J zKMJ_`ndp6{4s%}gJiI$_>Cz=VK{qxwjx{$o8(UghXyd##H8mNpUcEZ%CNjkJOe>}w zB9VONlyZar0M~0LA>i$O{ID`7Cr3?>5cL}k3SO$x93j;UQ8d+`}7`jx~8tdAnVmR`i9M}0h4oGZ<*cDn;feH z!^Q=bN^Msvl{SS!F-bBc$7q0rK_tPNKw&FTOG&3nCwI=bLlR{G*Ku3~NPxx5!c9p@ zRbH%b8JFp-u72D4tr6$;-SPRo`gS(C+LG7n> zre@@*YumLB`RL+JwRL@O$bR#Vac=h>!B4H+edJiX_r$sJ;K|I!gQqm-`n@N%rJehF zgK^2^D@KYRdk;p&Op7GZ z-Q8_vI-w>;SwCVF*a*?h>)@!@4;){LHoU_zPYaw;w$N ziO;8&w(k!O8|Ii!U0q!kDioEeyu5sXwZJq&1bQ%*NDm~y@gO8Lw36Txq|*MxloVZD zVxopoIEsKII-#ecZP0nWe`ej6!07DGJ*(^XLwNu3?B>I#1WVw{yHCDY*?THn`5web z;;Gr`+R7ckO0WvMF1?pr(|U4X$i^6 z{Si@7y@wI-4+!iisOz%Ss~u~NZURi9uOr|g@C2#zbbj;hk)+gA z-BARjxfKI7y_3uJD#z+It#iF)aBibxWWNS{#7gLA?5P=$yc*8>gO7kvKMV6eFHkgr@H=0#YU?hp8 zw6uZ9=xF6(5h%H?nz{n;w5wX@TJyl{M*Hx>&7Se)9gTJU*6{S!9fN&kS3hc6G#CtX zCX;E=YPGti?2c8}&ZB2cBbQeMoa^_W810K&P$Q<$IBS4SjWxjLh$8OhsKS8}!txgn z0VvI%qvPUKY4Cb>Vc~dAQIRP#FK>*51Oh=pod>BphRGNAORL|eywbx zN@ke5(l@nwt>3xcq;qaGYplyx+m%x_@F3MhE|*&&_zr77R^}QaiD5 z>%oX)eXkjVov8m}@p8I#tB;UAURXZ#L;AcIpOn;{fug173o0rm3(Cu_OeHE2m5JT> zxN$<<&_E$%QBhICNS#wq+~3q|m{XdTceRu2xAcyicc@Hb=no_#*xc^@(V3llddKGN z4u#giyl3H(JX43y;q#dLEMB+w#Vzb#{lX(6K8D_FS+w+gAql`(2UH~V1zlKpc+YX; zgt)2Uk4PlpT^af1gY^pI0%es&O=(qI*7o`#uk6yClZHTuR~?2vnZ__zed+Qri1rOox<#D z(#>qN4$W;+T02LVwz`eWJ0#MFQ9}hXf|*x#o4a+>Wfhe|!=mC)^9i1wKLY&o1PHdE ztZbhEjAU5IY;05_*1<{AC{~)Ks#V%n8r0Kk>OJ=sOdHmfTQ)r>A6`zAelvvtzNoU&Cf31)oE$@3Qj%6kqhp4;(1@7s z^40;T*c&)vus^U%lL-4n^Wf~pbHm6aoT+WSmNU!He(f`leRW zi))6lu7fGzYa-wifc7Txp&v%*H{snzp^+6Ao0vKTFA#7?fojCTj!`(Q7TA@myNvS( z5g_=S>J}rL-f{ip6rZ&Equ@%HB}5V_f58NJUiGu*wv~{`PcfA$Ie}7nP|SjydKWZhmUY54B*6|% z5=Y zcxs`d!V?9t9yoT3Bod@4y7H#pnR>N-qh4iS|C+=;ks5{76_t>xJPk;WEbRJJJ4V+h zO-l|v7ZRcn7FNWjg@PU7NbTJhJn4j9!7lCII~%HRXqK*NrnVZ?_DvrmLPV0Y%XG&P z5J2MqjhiP51eK1)*CgVe!|L#ycaA)rLoK`yt#9MG5L1b=>RS(De;|qM!lLo=hPIi; ze%oH7c53IU50M&$c_lVELrsqopm^RYyr!371kGAP3U{-vn3hyJ;bai^+}&>qf|V7BwbX7BM}}^H@CN2A-7#ufO-d;yTs$ z;iZ@Hqi>*7eu|vU#|Ux_(kJIcOVuJsL1om z1uaJI{uuwB`VF-E6Evk@fXqW`rdffPa9sM~?%i!1P}aAdUd+bBY51 O0000Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^sOG!jQ zRA@u3T4_+5X>!J%E0wLS%^s=Q%~_R6%~mqCNhOu7F!rtar&Nr&C1vB92^|{vD1|+AHMu__tyspU;fQoZ@>4^fz!c{oDQxyU7^pva+U5J zIQ`%2*RPbnd;R(94}S8CQF^TX-NAv)`S0KT;(NOA?cXkyfBrVv`?b@%|05c+RFf@K z4R4ytx|gl_kEV^;wS5~Im2Kwq(q>~u`6FYNu*00+FkmU`m^F(Aw06m;!7iCFFN()a z4K-s%SE=IF&l?wBzWwbz`3~=pF1-A4{oH4s;%BxAGJ8SmtUd98$PgHrwCLvTFL!pi z^}^ZNdG6-Tn=f2lU0-;5dd~a!_$>JQ`^!T@!<3P+@#@61oRyr)CSz6C{El?mwkMe| zsp@9-f}54Ee)b()y4+hD7e4=?RQ|<()jYGQ1cU4L)bhtB@8AgKwd*(LKK}UQS=Mgc zxWPE@=H|vY@8{>Y5EK+74+#lTgolSKBO@bKQBhH<=;&y&7JnE;=U-lFQoQ;=G;XaFj+)IG0-4b-jHkZt?D93o0pR-e>vJwH zE_0`y=W@A9I2{`stB#M4hb^8kH7_n+eJ3M#rMR)rT0dd53kO%*Br`i7Nflp!Lf`$b zS@G&Bk@Q#MNyk)quhtfoTA(}2aW?uWom;nVeJ%2cdQ41=3JxbHCokQ-dv_@%C1sg4 zJWfhV0w8rPFHU{0P`EB0)a=%d8?{Z!*Zg4z$9L~td(A>X&AEwR9%F^OCGc!|@mX@{*Ac={Ii?}}F zcAAFYJZx{6v{@ySj+>N;cfJ(}BGXkkFMj4wW=jT*uAaUNZ*m^5os51!K!7|fER2af zoQH$=$>H4G+?59p9;`fk_)y1MUS8fxc6PQF-~bZY0EpQ5q@@z+kd+8-sC{O?N!hqu zCYn`WUZJ%8iXyMQtn(}Y)IOrm;cyhF`P+9>mml&g*DA!#n>9@`i{w$4rM9WVEUazV zC@U*l<@5Ra;^JaGzyKVwk(!!%3?iBotEh3nBAMJWlTW{HQGIzah-T%Ne=VNep3au^ zZ@GE-$uEjL`#Q)A)$yn3C#7a-3#wa;qV`dH!_z58OaJrjwxPM5CnNJaons5TUE}iI zC&RNl()Op8s_Gg;X=&+dQBjc|*+Gf1AfQx{F+6o)67pCGQv*~R6>4QJ;U7lF8T?b^Rm%} z-KXP<-JWO4z23<~>z+{T$p)vk#gc}N^73*91WF2-KskZf5fKr}C|=THRo~)nWuLZ- z8t5OL3xWXrclC(L9FtzKddtmi0p@b^<~%w04aqzS3Iz5E;3(2dB!;4fK5Kc)(3Yru zjG{m3XdRf{M&#jq@1$z4e_FjaFszrJsKd1Udh9!;8@C%B*d>4_1vv7QL zZuyh37n)CSi^s@D9|3Ib8rZ6+s8~Z5a&mICD5JQzI5m0+Bg?T#i-JDQe&xXG-A4K6 zUrB3|^40s|3EQ)bidKtXP_R0X!&!s@h^xE%xd5(RyFM3{lCR4UbeP@@K(UJ`4?J7g z?Hifi9+;Th87BZN2xJAN)lEQ!q8bB~31tK_qXA<4003Vw@a5pJuqDcZngGbp%YZ+Zr%o+vHD*+HnC=T@=3FYF!uno@ z12r9Am5^-c`S#<^K5KJJ%Vuk9tFf)E%{1~{z0U#|CIBce5WK#n!*mJ&lYzj%K)IKf z*L(mcLM0qE?pOBf!x#X~s#oudMlCf3k0u@d6!j2tJ~T2?0}y_JfoeAok8=U=GRs!e z$$3~N0m!N8vJ}+yT1%S;x2oGmZS`G~jz-zgmbgy3SzB9ckV>VSEiEm^w)S@O$m}8m zU}SEY;RO+zQKhDiUMs1Q4$Tc5KvM$;&>R7PIQb&4am-%UqZuO6`2zy*<)4Yh%+y{@iqqp7KBv#Wp9hT3O{OwJ#2K(z;@l0NCT78DeM#89CnbaPCy zm})&dJmw+SaarZ7G!Yw#yB`pM*Z*2Iv~G$_PS=H!)8R2OD-p4=E674XaPXqLr>C4o zL5ndxkFUQ&5yZ?>P*9+QM2e`sTV=i0{wd`i zoQ9!v;5^e4s8>i@I?bs6^z?M5{?P|e|K8r-3+VJ1S^Pp{R26+I4(eClPDI}LvZt!8 z(5P4qH#%Ay$>Zr@$V32@6ai422LM?Ck#D+r&U^RKL<&WfOMH zNn{S(iaSQ_1r-uQQqm!5S?7IyeHr4irE^lw<8!Lkg(D^l0kCV+O6trYEg}y9Fk}PI zL5Y}de2x;GrA`51vFfzaCL>fSueO_!*5bx~YiZNK7J$&GVG}$aIkZPZw(MfT8n!Vs zEGP~%AI>B4XE~4WjLG2ZMH5!r5deva0dSOoqb%scj(7kfV=}#HD#h#A+|p>_zbANN zqPfb94vqc*Ao+DYOryiRR7{pzDc$5Hr!K?k;NW1!amXd~9yO1$K}nv~NMkZe^feP( z1YpvkxmVt7f$p;<6qA_v6%V*vh6hX;T`<(SxO&Vd-hdGU{Q+H?0YVwcB`{f) zkBxDux!NF3D5LL)Hk^jiz;Q$!ghkC`R6i?l3At74)njHVp-HbCa^P_~Og(=%Q=T$O<3NZkNauHBPkc|C^v+w-uR`#&losfCX@p%*X=Eg|ifi z_UDB=#f_V10Z4jKv+jJ;?NTCek@I-nhfW0PoNBwcV z9H!`Rg3Qt6xNk_b>f>{C{M$yInS2?g6RlJEY!*LJ{Ow5q??`6$xMkgodt6?!7BdjC z5OvfOPOB2;rehG4i2!cwVp>`2H}oF^S6IS5&Gj43zZdoK3J6n{$W;4e#ZvjJcfWQr zLF?K3w3)4@m$g^|Lqfme!Z$(an1u(VW)}YdRYDej{hpx1LJiAIB!(S>NhxhHx_bv) z`h<_o47xtljv1fnTnZ9QBC$c*?;!I2`I%=!wNpDjRfB7`*t7?07^P45g%g?3v0a)& z4e-uG!RCEohc&aR!*Ui7KN{{XQ!;QA%M;2HN(W;~lz?zzQw5 z69fo1FK>Bj*&{P4kF`Xm{LO{G6VU1ORcdbkOnk6p(j*xa8h!}kC=(}VC01fFelXiy zLXti{J$pSlyJ#amBX2DmJ^| ziWGj6iOy?xDtcD_z3%y^7ay+!VdKJY-x5zbJcPrWM9#-F=tV4}Kd_uQ4dOHqT!+#E z(T@(vmV-h=m(VDoUPrcs=OEiSL<8q=AHu+Z_77C1lJn@e75(~X`hoGS3!{JX0y=Ja z7a%ATW+JDR6B)}m1LxS?`E*IK+Z>Y-91c)ckU6}EOp7j$dF!MhyD;z#0GLdKa2M0c zTg=p8cPjeyG4=DmeeYX2&t5E*zkG}2^$l+-Q)A$%LEZL9lpUw=LBwJ=E&7e>UN_4y?rMS*m(W}{` zG5I;aOZ}TB`4^X~`OBn-YVfDDJ4A>^jFz&e%KelgiHW3E6U^lvX9Q6_$_fMK*p7~B z7{x-=shrrTbE0CG?-q!ReA&W&)sSJQv}-Y?ykGxjsl1HC=UqcTF8m2eTB>l!uu4sD z|3UqLBPq9hBQi0ChP_xV$_r(2RQGKCACj70!!?nKcXi3RWrkcyuR}1X|CBz*T-vGT z(`Wz1_wnu0@1-BV-=*{U4+H~i5f#1KalwGzT-m$4UEDUaohRvWWLCCVQ;S5VyZHhm zEUl=-G_p^ZcB<-2p2#DJTfd~4=5U_> b9)JH2lTvXpm`_In00000NkvXXu0mjfvmDnq literal 0 HcmV?d00001 diff --git a/data/images/btnminus.png b/data/images/btnminus.png new file mode 100644 index 0000000000000000000000000000000000000000..1a6b3e08310e054743ea6d1c8443119df9efa6f5 GIT binary patch literal 2800 zcmV*(P)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^lN=ZaP zRA@uZncHt;R~5!5ofc9kq9c_G6$!P{fJzZ}A=FW+Kox3*-~||op`F|lC%)f~eU9(9 zB#s@&nK+pyPNJF7Pzi}gKnPXsQ{jOJXn|7rZ}`6Dy`Ak7$79E7X{4nyaU9S3t@W+7 z*It>p^fCRqdGqE3T>Au!Pkuc#F){Jv<;#~RKQ=DI$%kQ|fqf44H0&zudDzcj*I~1; zIoSNv)YQVv%uE;-pPikJ&(F_W3kwU@M+(EJ!XAS?3wsgv6Xj$G&p0gMHaMP`o}Ny^ zaT|`?aNL38&eGCSYI%7%{hOCj=Xl>>=3WuoqzSu)YO&9w1$;jJ(TvM!o1bPC1*+ zt`>{M_0`qYjgbN16uSr`PRCDmjd5OMx6z%3#cD)8pGYLcc}BflF0WUs)!HV$h6YfM zU&Avvj+29am(gd@>Vj3W5$98>R5_o|i}M>B8}%)GwOXz12LdR$Jfk{F{3f~sJA`TY zSyI`#Gs1rFjy?-E7K=%-QZ_pB+WGzc{nkJL<@{Ii4AWtx*q)x5acGE^!|$hP_}RD+ z{0wG5YoC3d-9|^hP$;b7YlE`c+1Y8*`Qzi`+h+p6A-2Vr@WD|yY|qTjIFoT%LVA92F|)9=lwH7+-_HVs5a$J;<5s2hPO^IN_n=+APXL~_Zh%ZC zQ!xQ<-@d(bczC#X@7}%kDF8VCD4c&0PFeUsMmtTXmzI}vu)MMyU*pgCo>2iz$LYKY zz*&a?T0(s?&^QwS&R>Ro7Y@ZF>WK8B$CF$3dJ8Lle@V>eD|%K|3Va<|$nbqq3nz7O zriA)AegaUs&l&)Lty*X%91iE$``Lk51MBPStbqo*&%wdL?wvb#P9y}!C*Z`_;e3Em zrSpt79rgu-Wq&BNO7jH*WxmFr2>{;vAb>%Rn*clqR2y|TIs}8ktl5Psl}eQ@bbEWd z$t)Zl9i0@hNN0L_3Yxa5Z*d+Gr_;emWGxttuH(7R@A>_qQaHY^yNY&f*k{l#-6w!P57hiGBeZU*x*l*MuTf65TCFYskiau= zA~L6><3;r8D4mblb|daMTd)QpBn!w4GE`)y_&a_p+qPC)e@<5S-yPOr_xm(}hER8b z?mfVilRB9zrBZ4A5<3q7z6b4F?C&c2tBf|B-?UPxrj<@N`HTYwuh&=;lu^ho+)1qM z{l%^xya$KqJnVcBCV&f~=X7Ra_uL2I{3PrK#V5aK z7UKD}H|*-`e|2i@f7%=Ef7lxr4`9kk&q(@^;~4=Ex!7DnMu}rTl;zt1SGHM`c7BTvMjYUiC z3qU@rABbd67~Vq*L5GoSj5cDjU2I`MMy;M$hQcnV}TG$m^MYcVh1FpFk#N z0Fjg#i6b^45K-NkR87eF&;!ApH~pwOz;w;?+M1NBxi&Pp$fbuAgVTarsz?eAl?%YsgZE1@&+3ScTQ?a z&=2Mm(7?qO0JvUxfg1|xPU@b_`vMD<18{5~L-cwgpHOK&QSTU(u%9>}J9;JIbx zXb?4)vql&Im6bKt32LpxjmHwkdUip!a|1}S)7=JkHX-%{0aRggWAPO1S8BB7qKjJ# zxjRd3KNj(^dX4akvdU_AumkQy;v_IGt6U@DnFNXBT#BD z#k&i^MglNE9)%vSLRM_IQE9i#2$x_AMDEn8M(CK_>;}O=VqKVy%$htHSz`p^XK5(j z7}?hSm=w+hV1RrQS$Pf_c~whG%~Dx*EJls(Q??rl2CcP8=|Dn~8OcsAC!>0gshW}O z0Epv?g4$wsV~`!e#sY9j>ncEg3R~2NAnSx_W?`yYsW5tsBxOb?SObvSHXDG>kdj>Y z4kGsu1*^N7jP&@O3jr`d_?P#`A+Kuyxd9M%E*VR>?NdwQJY~l0sIA{RfMowfAWB9g zcLJrsI<;hg@cRn|Fh7jz8bI*xY2U!}$B>wxC%gVTgJh?(_0Dri#_^rS%A(~`L1jsn zYHByt;K{DmJd~8!hX&yOU@nhgpM`x3K(C+y{2Wj#IIQ@mC5N>`C}v5?PBKO5aiJ`5 zDBSLz7Lcs1j|{+_9p1$uwJU)6B0!!6&?|Ue2heNC(jsKHj6a}Q0866(+W>O_CN-u1 zR>3>V{{>*sf2yR%O$jepUm_fUz5;s=P}g8TFztV1+~=tNF@vW70000Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^m-AP12 zRA@uZnrTd1*%ikzq?44|`PF?idU>d(tF8LeIH**L^mdS!PtEtB0QqKEHeZ zXSwH@nA9FZf-kv*lya)F_e)a6} zXG?Eh@AmNEyjfaW`tB`n7o6?Tk|0?a63@d57m0Q|* zr@FXx{9NAAE2FtB{S!HjmvkAmUD}k&*2(0GQ*wdM^@po}K!7%Y%hhsuJngpv&@lXRXXEIrJ@tdn{#bra z7X!O|64v#c#>>{Evg5OnX{FQBh&VG}Bs2I0@U%WYzIXTS+qdHK_4U2WEHK_*8vw?0 z!FV2zr{nYax@`jhX}kkk{-~yRc5i9Noz&8{TWtj=25+WSx0|9eE3C4Jcnf2&&d1kR zyPCo5`_ynhKfh&$3j_jPP*Bj;0YJ~Yn#UJ^QQbQuC~3QS_TbqYH`1#+W^k9q%4m~6 zFHpDE4zIWKbk||W$*xnwMIw=2EEelGyQog>*vpPYlk;td|+UpPAC-WsNqtn)DRL9V%QKs)7ZQx$mB<$?Y*$$DP^6L16lPw z26bx5J%LzZ@Pz<#M;dFr$H&KqXr8_EXgta#I5=1@kx2A%x!e#M8fpj&3p2V6&^)oY z6QuIXBLfd&E4uYpbDR6js-yyIV6fcauBP3AL*uFDQ8skvQ7&ja?z&Q`G^$i8V`OBc zXl$B6`*iowcnnyod6W&^ zd1`!OVxnbL00`0_XojBsz4E-VEw81|j#-5#lIUTVAaBEhREXE@^a5M^uDh>LC=B7@ z;Y2pL^9czFmXwr~6ZW=49%4vp<)wgAdU9LQZz9ZGs4r zM@-|Q09dFf0BT<*lR52vTwI(vDJjX4o}PZs$pg(33!V+b&p&}c6_$0}9!srin*rl3 z{#>5U52_$69h7k$WC-#aK^&e~rIN0te>7T^TJjrOrB}Dl$s*#2@n|&k9=ZT1BxJ$wc#l9(FKhsSZ8#dw2EZ6t&jTw0 zfabmH2cLconWi^ObHOf+h(+V|Xe=~MdLEyz=LH6mE56428wFU&a5eyDA=e3~uZRwqfNG_P>@&&|5G?*_C7y^YtviJ-H13=<} z1oIjmSj%u%0Q`Sg#Apq`0)}xwvk;_E)BgSYP1Fknpn2l;o+ASf!w;Srx5O7}W(ATE zBQYL~MWY2lL5_v5@xD6%?ikJnz)fHmGIlDZb-*MhP;f9=_&fCi$_V3t1hR_Fjo zwBIzw<{z08h~-8!4h<#7i^WEfL}J2)zYE|VN{S28asXg^4Eo)S;jRGG3n(Sp`>#=v z3BZ?7tm^WP_S?haGOav;kOV6liUtQur6#%%f_edCg9dVtLT#hzkQ%hnE2hzv&H`)* z*UAhHozX)x^jvu8g6UdLWG0DRZpJIVCSHJ;z+i@c-xiTp z`Z6lJnxw+5ELQ-wCs>`S&b6)fsK5T?KuOyTV_MbOha#EMggc7{io{}v@sf}bGlf7e z$Rc8A)#+u#aJsf)JgoyOWiooCbUl@!H?YwIfT!`rt)sfcl4iRQvJa6D0)U~o>ryaY zs!*8m8XBEwkIX248I@DL$TogEAXf4K1)^sJj0;x~^gx0G00P(v0HlM4%fr;x$jpjY z(K$7Xbb-;!AR@OQrL_RqAQT2caCy{Udwihe?1VAx(3uq_ga9&y!U7Oes-(Op4gi4J zPA|9vz?K*V@qqS02EEVC?1pb1NR(0k3t}b%q4rTivd~ZqF7$>fF_(aBr<67dKw&%@ z#}@tsS*QV82z%&(G%J@6{SL$drb{LcoB+@pBrcRHYj{G=lkI}oGyqiMPb<0&*+s3R zGcmc5idl&51qy*dE)G%N3yaTwyj3}E1z=a*wa5Q}ao=EiZN~#hk))Nt zJkL(2Bo-JM(JS6V2vVt~3X3u>YZ-{U>2=cpFj0fq<>IGs0y|K2YG^JtuLiwfz`h?_ z1}7;o5OSr`f(tCL+>A)Z{$xgIiqUVK`f_qgECRj@7v01G*EqJc6K~gSTTFeR0Auos%_QZo3+mItG8640> zCxhT2^wPS+U8oT|U_SaqS?8Uk;?pAr$WRZ%6LO~@C=Kj`KdWAt*p-_N;uIrH{lH)+ z$5r;38)2Z3((w&z4&@lAQK)qR=o{eZ=?$~e-@y|_c#=4(&8Y31Q^sUi2?)x{#Utc2 z$F$?H^G<1(f>5tuF=U_m(4!=Sfp<}A>~Riyo(<+U0L@bM*PnfK_#5j#%RBGX7M!@Q zg~y*$VR2bgf?ydr=;Ok)NzT+XV=>24+L}8$Tc(;jS`+5rL|~Z0h#8Lpp_kcE2(}>r z`eq1lFOb#;)xEP{LE+OBo*FWwRkht$rxe>n@^FZex9-P&iap&R>6d|7)*!m{S)^fP z0kJ(qWrtv!0-%4?F!F)}53lhV!mr`^L2lv6!Qp}v*Q`n9C+*>hc~hbgm5Cepwk2T? z$*`8-hf^TjZ30BQUPf|G%_H8UP!tT_za;?r#~OG7U)?wB4Rh7c!6RS8^Mn&Hrnv=^ z4s&8j3mH{PRR_%2s^i#(3!b6gL5-6pkeNTxNeF>*0V5fX0ioAz0bu_V&F~BOI>9S% zcnJ7;MVJ2Hg(n7UAq@}ZAGLJ_gd3y+U*I&jrOSY zQkyb1!zxq7Si}mIIY=spfR(@~^KBLi#B9Wx(Go~l-#P&M1E59mg06QLeEr}VgKO pcm`m*i&{r|O3vQsg-2jl{|k2zve?}NKVJX<002ovPDHLkV1lHh`TGC> literal 0 HcmV?d00001 diff --git a/data/images/btnnext.png b/data/images/btnnext.png new file mode 100644 index 0000000000000000000000000000000000000000..7dfab931ad207a154fddc48d0c51290f67ebb53c GIT binary patch literal 6115 zcmV<97aZt`P)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^yJxN4C zRCr$PoCi}JNt%ZD*X-^@+&{TBH?ta9qwq3t|y*)WOxjiK%r64sm^~dz|^q&~t_thWa+dIIrC01cEz+8Ag z|NQe?Ri45_b-)V(2ehoLtX@WTc6OgT1xiB21^K;8moAxr5d;s_p(bD`w6e0Y zp^A!%VI5UfRU-`jyS%)77_b0Vki5q?Yubr?oZoEqZ}oc`ZC$fPdB8(Km?z3oaKNgq ztsRvy7Bp&VYDN_(uMzNrya(^~&H2c~s!ri))Wvj3RWxAW^MHrRa=|DFHK8uR0POMO z$Ky|)JQ@GxmtQ7=2In6=dNdAXK%z)hqlMV})zxTyUEIhTPjx}+!*n&;y2`_3QIJ)f z0SB0BdY)oO<=@RfN&h)D(IB`t>xAdW`ctPeH00D=RBU)TA9Ho-M@V!b5=? zc{Olo#Jzw2ehLZz@DJXIurUKUIh)1rPOU^u>IM zy!bxUM>(dZi__;qU3dTyI19k)@9$q87#LU?92{I38XEEj$2iy5*SDk~few5iV$yzy zL}ygb=i@@|+__V9qDpk(iF%q7Mb|{<0Z8zW$lFGffV9Q0KKvCIirI4U7T%)3SpwL| z$jGXUwb9YhwXw0Wb%y-D&avU);Z>dkOjL@c(GLiK#M?VNdzk1c>;(6RP!b0Q}uCCL|oK|`6)br01jy5mkE?vIN zXy;LaK9iY3hRckn^eULm`+PJ`A(PEP)3YKmlxOYHBMIiEO(=j%~}iEuI5N z6p0#xAaa9<&IBqx7Zqa4+)Px+cat0Z!;v8hpuYhRXjiUY?MS+MwUcorDX9a9DDo&O z1fc8x)O?A&M8~I3pT?+Q1*qu@ z05x^Ne2KjHDb$DQiRmt5wx~+s0c(DK{=>q;0^{T2;^IdhIVR^mSdd1In6)2bYisK) zDUPa;{19J=72pfii~%T?^3Ov<6m{iXPD*MQSY0<$QhJkb-Rfi9Oik?tB8tSUj}lZA zAOQq3QGoa%ax^txE|N&9>cebN9`FDMw56q`PmJZ|Wi$Alzyx z;0sYdR-k5V{a`2GQy?DPl*M%a0vwbEu+-bP2h#4`8DylSrS;!PN$J6q4+=0nyJYBY zLCxsJ%So-8L}S8!fG9xxkq1zM#~djO!2nZ4eV8q96rMo)yt1z3`_f8-TLw+BhMpVKO^6&&+H1eIOS|1jg+41E}x< zAR2!NbbKd1)D0&1K^hMS1xW5H{`)WcLPUL-=Qb34Fn%obF8iCap9>fRQ zRAvzup+UqSh21<*0g`@EhBE)N2cn$(E0H(l_U(SuhvER2Us^iDkl!PiF#sj4>A!a4 zMi&*zQG8%&efOgJK>$8!9$u|$A6swi4sX8ck8HOM&wc0#Eqxk{tnT!WMYj9;2TZpm zAeGS^(2K_YRL16mrZT||kPDKSQy$th##AGebN)nHD-os}P#^$lgfIuR2cY=Af07^* zWsUlZiXsJNWwVTY8F?io(*Oi6d7%L8J}N*Wu>$n`VC$%uacHBdZ)&?`X!d>A_~OUD z$(5avnT=m37PfyIk1T#18=u&))rcwM++F8)8Z39S%N<CH(1R6qFeP1KB^cZ`b}hqvAi zOuuU%nYSuj`!Y7S_3!Y~`~RL^{rG!ier+c_IkknNfN0IxB-T2dlFmfmfE;jv9FQcM z9MEsRG*(HXDdW_9nYTuPPVN8a7>JlJ!Gp9V*Q&3uqGGB_A)CM$x zx4-}-rc6*FwYeqL3C}-{39A`bG)AMbt3uZoiYb5UpIqG;7E@M;)2p9;pI!g_$Nc8b z|IRLN{yG(jc3-rur7bP(#t?uA97JA%k~UVg6GI87tt?d^2|ns$&PL6bsR&1byM9p2 z_rHj~q$v0~@p&^SuehpefdNDVP?RaT-~>4$l?plIL3)DzL|Q8n{GeZjzZhS*8<8>P z?un&O15>*YG3Ut2$KO$-f}B}g{}KwD&dY|jumEQ})62j^c^Wvh{?#@X&0OsR5;3QzkE* z^86tXG3OyM=h4~Ce-l^~WJG);FlW|2{vMiH{yaP~X6jwiAHdN#z~@nQ&;tY>Jx7J7 zEiC3k{Jzg0Jly`L2T%gSPoyTs|4F(cCOZeTlIrS3h62<`Y^sse)IQUZp(p5DDCz$@ z9zZo?R7h#35t)Ee*FL@nBIev1TK+sRwPs8jkmK`P9!!8n$GhK#LlVimdrZTCX;7Ws zbQ`EF_i*PzwEIGz64PbYP}lARU84)Ii>?dli}8Qr^NOSJmOOxRj6gz!_LAuXc4YPg z==nmaOx%Fthe&=H4J`8?jT*x%JNU+->9sGYa%6VnSN|Z7>>QlfeAV>Yw5)V;U6mIP zo|>*kUZ3xC{a`eZcmYHz4IttFtoi`B1WZhtd@v{yC-Q>{0oueGQ;rAmWp{WBh*T=A zl4t`GMfQjyd&A40`^CHgx;s{OP-~CC?i`!{*wj9-^7zTq33o2oorSaWAD-V+c)rN% zUkBs>l)yl#W&?;Z-_n{I15j0nZ?u7AJWUdAz?;^7g1M1I09Azql^}@t#CpjQUvz~w z@r%14XWtWKfY~{=uxD_b^R2_P?*ae1Z))r5%l5gVlCmMYR#0c(OxIbJr+zO1JYYrv zN<{4@Fc5)>wx~@3D#VyTBA`uM>wtdnAOPb*B)uW95S{Uh^%7hF`AQlOulpj~z$Ebo zkbiKT!Seu5dPH!lYad-NfATVNKQp@*<>B-E@PeXlfFIlo5Hk$~D2l{4=HUlzO-$X) zoCz~@`_;q;1sDX89FcmNMB4-DC=!@7As9df6hn`3o`Hg&w~ue2X8bGfSNpnuIlrnd zl$@H@Nv-Re?LK}ljt^85j{3kD1zHsvKNyryCo<#105lM-Pt@oPL?W~c5(q|>0>mg& z00j+m-a=DwQFwzZye~dCuev^b`AW1|Z~(L2KZu~PH~^O%Gmg0VV4?}8!vc)9{i7Wl z;}<1Dljc;(1*;+-T2-ntffF=1uLEe5jS8-yws9&sEu&jg6>StGO3R${Q4^*$MH)ku zK^jvert12@7(eJUW82y?WnH|a`X~UsYQ+bVAfqq=s>(EQ;tZa{a~ZrgzxKtX3+|Ar z+p9pCASwg|b*@RIrRos1EtX0I2A&R}`puYV%rvK&Czhl-$QK?5;O<0}DAEs8l&R_j zOuPYfo|jkCFnJ?2{WyyAr!movjFxg4PAO+A5kElJjHgL^w8gIt)}WN;BmgQ%HE&GZ zHFGuhpvT;*`tbFX+g+IG5zI918gQ=?31}v0B#r{CtzA|X+N9c4C7M)Y{`;x$qyf4x z_xnAoqArwl^H%2}eA=NF%zFTR-RO`BB(|J0W(+_J(Nrcv5sZE$)+0voEv4@%q0`oRUy5BgL{PUxvnUc*!XYiKkgy8-2_0G<^%3ov$KNzAz2 zw)96aO{XH+HDjL&wZ)~gbmET7ivJU6YrQZEq`)D zAPT?{0k?Quc;5oJK>z0fymTo~s}ird>L%3+&!Kks2r6QSpYl| z#BT_k`oGvIP0x&FbprDo%#V;%?;A{lOqtwJI@UyTCZ2d7=8qo~RgFv1yL4EH-yk>u z?p>AO<}*akJyV?Igj(9UD%^#*XWj&VNSQ~^Fsq~{RQ{rS#X?+4q{MF&TyXUDFHsPu z|97K8NsP@Jnf+24Cn~#jG6{BObQy?&m{a~}s-m%H4Txn8-OHlHK#1QsxZvo!XN`v( zVAYjTAt{YB(T)mDM6RicRwe-ziuywXQGyB(3#y;aR=w)o@IzFS{vN>X8$9BwP<^5J zwS6P9-yc$?*ok(VG)6(z3ZRMk&ilkNzUQU_V(bs9CT z*?}dW?~ZuiB}i;>kEt)TeZuH^89U)_RT!Ha#({_u%bqsKLdt;;(n5b%-PF5T_^5F% z_3nc~o93APCc1s>tU&TPd?uew8xE`Eai8z8cTM1aL|HFLd1se=mT{E8-8W)ZuS(MZzoy+9T>`SF)N_2IyF7%~nZ=r-Mxr!Hw+j+Q za#38Q3zP3)%?_whu=p%zaLn!|ZRZA<4U%$0fCD6eaiee_q-hMZeNEbMJjZLr?QZ2g z9z2C8Uosaz#fOXOnH3C&fvD4>x>QaVZ1Nsv^}ho$T~a6AQf6SvMO%fKO^#}Ax^pz< zF=~=gg#k=%gaSk5EDYtn5rX8WgZxd&X`3HiKsOsGcNa??&2;1BhPm8PdWQI~BSJLm zY`g%&(qX%RT@^_!jgQo=WqP3iFdH5PDg)J+A>YS9vd4Lj!Xj9a%kq7BKa{THjvV8? zy}f?|-)!OCRo}_Mb6Q?z4_zQc8(2J_=uftNRg11YG?7|B+MNJqI|VDixIw_g!~x2M zD^yep7?flHSx7D@swiH^l4N{0n}p2Z{iMv~y-*{-QLImWClAl<*tihwihdJV%(6J! zKin_4_!li1(~g3iGd?n^N?=A<@TohcfJzhxY|!AlaGvKe%q}Zu=uNQzO%~wnJXO;@ zJ$Q~1^VFPC0CyG>L`Ax`IwrWpNp)gCTGQ4w*}6NxY_pK}CGglyKM{PVfh%e?JE`n$ zD)aa5@XqtyJXPDEWz;8TuZ>@8x~C7%HD>|~cMxB~Zcei~hwTw8P_k;=7i8?D{q9ma z3)2Rjd6W%M7pm@IaUXS45DIpI8x=?Q`b~H{PNVS5W}!2O=SF9I2g~EwB0&$4=7Y%< z{z2ir1LQdUxf6vjW0{X;L5us77+L{Q|JjF=vL|)1s=?Eoytr6DLtYaq8!7#nOsjB=^j%unlcV^qmr z7Hi^e0P+%baVWk1v6CDPN6iEkAU#D!P1{6lXDdYv zOeYm`7dGwjk=`aCc2e02$Mbh$1>8hOb;e|=@44ZJy|y!ZzExwc{>KkYhKyf#zl%v3 zA8GdDv6<0<>H16K_uPSE?WP|GoVO9u2^5ruCdV^#GW>@T33j%o{`;AMIPM2|Amy&x zf1T2U8IkOg&(~ z1JW^V{18RF{cj*6TsRF1oIQREC=3(|BpswjHvc213lr_BDok2peVjH0tm5*%YjA<} zbQEMB7fAU;4oNKvOq2->fZ{Vzs8$rV!l3$~tTQE@g*Kp#S&ghLQK1=pTnqZPx#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^*mq|oH zRCr#^od;0d*?q?)`OZF{WBcsbu_uW$9?y+aoH#SiOgwg+amtK6&ZJBxr<0Hns33{n z5ds7%hz_EP4$Hze7LWjS33UlX@4bl5E*(VO)t&PDKK^g{vs${OyPJ8ltKI+pm;YzK zzxv+$-_9Lh(0}rZ7rVal{`=p0?B@bg!%{&dHVS3lXYW9MJ)+`045=ui59p6^`w zr@eYb|JLnz^-A;V)vFeI-nnbnu7S@#|4g$uKR0>cmmhup1zpO!``Vm_&%T~h|MFvX zo&FPb{mUSFo};LmZIM?@YZVpKqpIrp7pkhcm&%G4dU@HDPEj_=hO&H0r>dIP=hV!- zRM*VTtEyg%DJ!RjmF468bdG#=y*`A_X-4P#Yen_^AHBOPdI#T>@pSa7s+z^0(8ZY( zz!XL0i$+Doi!nvz%zW0f@x_cMnuXN6&u3yTS58DIAB}{`?r8&43J1<5sQdln)qUp^ za{2<2a{EIiR|cb04~AoNi${~LR!?L;d_Jox)hwzj#&vmBQ+jpv%!I0JtdD?738-au zt?pxa`SjP`!6m+(uTa%4d`K7ZYf?ra!7El&%}mJ3CiMUof4y-kSb9f$GBoA6t-D|I zq2ms9X6BaFd-s}E?b)-Z(#*`Pa^JpvRp#dARR<0ns5*G?VD+IxhpLYpIZ|`<=&@Q` z2j_ZM&r?m_{$XuF7iB#c)%QoFMa|RdQtd)s^`t(xYHChZ`J#coH=JPp3%QGLzMZRl z3unzLoBX=Ej=R#XJ3G5Ndwcsj2M32b2S>*`H&5@TGoi7avGSWkS@&9B zh=Gg+wk(sYu>W5srQssbAOjzrwdk8&UTQg&PyH-Ekx!N zk9q{eby^&;t~G|n;eGn)rwrcSy?dGRpgJ);fU~x?Hh=>(Cnu+RXJ=BPt80Uso7;+U z(&uzbP+Ue&>eaIGoKnrg<(esdcGaYYTu5|wo&FaYCFAeE1?_D8l;q>SOXg}t=K7QZ z!o2i}b|FIbc*OBkaGROAMYULI#?N=}-d(XCJgzu^6GQXx@Mz%U#EBD)82sPv?(PjI zJiQzJBNDoj^NUAw%K-9)URn8~NmZw_SJuq`VCz@>hCV4To8CpxenuveKz?RCt8_va zTTngWdgemMdf<#r7s}hefB$RB13Z|jqoZTJi;GJ=)CNd^<>lpt(PV0zJbBUp^u$T; zroiab=aQSXlev}S`kbn%+00_?Rb|cMFXWXoUwK0~Hg}rr>V*#o-hWcmDDpPyf|se$)>e0%_x zfrKKxPMv9qlw2NAJnosxtDe>?E2e75MZhd1;o&MVd&Ouo{+bJ)f)W;RpOgj1m zweHz#wjwaB2a*R4?)P}K6~lwc0-m5a1`fc^oH^5c_Uze~bLY;P9C#nc;dpOv?V8qZR&NxwmAteVuT%0?#1f;@8?UjFgsB(%k&Rke%Xqc1zHs#zG!DjCxSOK)or zSv%FQ2g}s^-1l+QMXG{m%gvT65AdKS4i3-)0s>kC0|VIz3JPis4i0X^BYzF=<2Vjd ztVaAG-lxyE#Hot3>hcj?PUX}r2?B}z+x3g2xIaw>at7lx%zhZoPr=l1WnI9#(8 zcs%lo)d$l(e*8E~QQ-5q@^JB|PoHk);5e|*(9pK9u&~z#UI$RX4$V;^I0lUcAT#p2x<V-O8tZb84z$AQTAZjX-1#fQFZjs+##BY4PwPl(%=E`L^Kk z=*!I)z7OiNwY6oYi--xQj|&yU0}u`^K0dxPF)^_VBPl7#FcK0Hy6C+w0OcT|R=@{D zsL>cAl5rKMX^*maU_QHYa+a>yH@D%lZ*2=AonROJ691#Dp6fz62A{Vbv*qdo zKvW&5buBF|S*d2MKKLtKD9jcY4|t@m4uAu&Q&Ur)r=_K_f#-M)@8KB0 zgen0NpEm^&X%3<@RPX5I(h!oU>dP)0UR0HjO;eg?E-RhddY+h5|Jlz-fkm>?34O5i zmS(@@p_)&rz6r=pBwci zH=s-S0E$YeFy>_luVrRtGME4fMM90HAmRstk42Qn_dNmGMSYvKsQFFk;q85+) z&CP3|M40n-0HWgp1p**XU0}XY1ul-%*A^We-2q<)vxTZSJb=p1&hAsI)okSCptI-%D0t-?cu0rI8@P)7fWCAuewsq&@WWCDLkww|F(LNH?uQsGX0{0=A zZ>YR{YCblu!0W8~%Kv4Q7+36NrlP$JA3eiVTPxg&xKkIL|cJU7IT$vQv|E)5qimyW3_&V zFPz-KQsT``*cc!bAO?t>4;M?muL}U6K7~TTlm|$Fb?MS2HZEVjJb;1c07>un1F`^- znKP-d8-5i26n+){l~l+|KBP=yfG}eOH_vn7?OBfp=H$;tr^uB5JEvidfTC{De}e$V zC@QArFJwO&J$&4z;qcL;^;XA^H_&Lr;~|0wsQbu_Hww_fJFxXU&2#uCL|*{p!2{-tfB_%?!{Gs1et!OnA%e)1$bBMy1h@jI5CCz0n6baVe+!~M z+y{@w0Epbw>ge&>h^*Ths4%m5_$Hb1N2{uk;QdBfHPb11)W6_yE}|2#j#^tc9<#M= zI!@!5jZGr~ZGb6n1t1_|1SA&>oH!TNVRh8HPHe)f0fgysfCv^)A5yJ+?~7DF z9<#ExZL}hI)^>JHHVzKW7{}?k)v;sS1{j!nWgs~H>R<>BpP;x-dq?L6_#I;(hzmpn zh6%3)5a0?63k?Gh0aq|(1QiyU1v558WR!boJgf)s&=ISe2w9ORA!_L{c1uBF|Zx>(ynK1x{ zNR|Lb%5DzDD(`3#vWv7437I|T{Fi!tNMpoNm-0Wd~!M-!iYSDTXeK%0K~;c$G0xv0f;c;qZCL0aQ}e=EScU&8pEToA&3w_?gs(z zLe|ZpX!&gob%-^IIrp_`1Tgc;lM(r~;?Ztfh3^Qbx%ai{`Hz?i71v8f)wj#WF5RsdE4W`do>O>R zo0%nNiV~YMQX4*aNhhw0SIGfeO_?wEe`56kAPRtU33>fkq9T2&y+rN44|dQpjPDZ7 zeCj$Z`d&!sMcN{$uieGdv)$FxvjY%e#`XY6?;8N3p|F9rmMH}ykOWd7K{^wfaeXNo z%LNsxmsBVzcr*+ZDsMa+%^?+DzFRR~_@H|H>ci@ZOV{pd=VzBmf@7!%`*-j-fb{ns13^F0PzSjhB7G^Y(|cVdYAxKZx`TeDinMnB62b! zGMTcpa4Dd`9|9uGIiJiKYUChuuNG;gnX+C0<1H*iZgFQC%0p^|z`^TZ-o`>R7w}NN zarN=&%jd5FaG%AY>ezy+39K@sKym;8ZK?Vgi@8)hVe90~QWs}IeQsV}9T-f7^co^D z6bgW-htZMQNKep|3A2(;2qt0`Mo>gvHf2CWR9=F(WX>g{*|$n5u#_7>7Tm95FbfH) zD*vV?HBHiuR0Y9;s}3m(st)9r0=#ApkGHU3y2hysS0AP!0C4xGdn&^e4~J!C6FOoS z1QU)?Rn5#qX5Sw}r2$CH_YpLL*NMRavPev+45|?VSjRdt)R|r{m01lSH{)d$3W>Fl z*089oUWSOsoO$)>i2VAJ8UZqg0!(hv5==hwNTr$TD}ym{@m+jEiBE5e8>lE9(S=^> z|1BrZ=u^UUF>5GRAHUAP^y@>kcvDaDLxw1vO*P(2`sGIq{*M4cdG6lc3?QBZDoh(D zj!12}iDY^$fXlvcWk88Ef|w|zH{7JN2qYFbWI#oOsZ~nvOY$F$M5icveNUfl z;XOaJ&$#m7_mK0MN?QqHu@2Apn z0FTcG$E0_=x}Rvo@)2IH@r2n}d8=KQ>)FT-T0A;W=}bES-jF^S(4CFR=!btpx?&8F zt56(B&|KZ9AKVDQ)gU6hVS$CBGs->qMSzSKKmsNbZvZkLcpU@B0NzFV96lc{yQw)H zme6Hm=THxL@Oj4Y;QLnd?M|mc+9Zz$=V{KUhXB63nfYXp07@A^m?=^iZo(cuJ_a*} zA9N&zqNFp_#6o9!t#oFi08K$;Iiiqgi$QWlGMJR|utAUj3WL9f_c3rhDjld9t^tXA zsN~v^S3pcBIxR?+xzAhAqLu&-&C}|%-W{~=9Pq600B<~&|tF-Sn*s)RC^0KGo&9tMu*-~bQj!g=9yy+e|^D5Ee`8|!5i zWWw##Se>V(E}aDMWxlLrSQnU-GlU=lg>eOPfE=Q6K8Wr#n;%(cf@!k=#W^BxzOoKB zT`*T9OdB9DpiBmvOp`mQ#;C#YUo*%Y$sN<;$&-K;=$btx!b7aQNNThS*W#ccy zGOrJ#%3x)jkqNJ7#)ihiDiiHn0cdD_aWx8EY#ymOOs-5QYPEr5`0@B5e8N_OThC;T zf%-;e_E2Y9m;Ru)1^|<3E7igU#oaN~xh#>Us)Of&>zOg4G0HkNPrS-^y_Ye)H zZGd@Y5FH&rS!)0~j`I#netz(n-KG_143Pe&L3zcLKC@)>7IkCv?$pYfh{<^}VePQg z!biH|MrjM8udx}kq*^HJc!wG-e%@d;^=rNffE*+@Z0+LnRWmg9_sRqJNAe-E4Sa@8;Qx2+Jbz8UW!V#qBLjxUZ$cHw{n>bFJr| z!HHcKRyMWk`LxZvzwdx$b@b)(akR9kt$!G`@ZZZy#|9-2dlp=L{M%VMM}fqY9~1`@ zmQ)MP1vXPBYV#Yb@LdCZ8{jzP!!}O!v^jD%{n6k&iSIW6_FYVw9#SvKy@m&FYo8UM=M_Oe8^-&b=AourUnDBc9Fq$HFJ6M4ZwvUnq2{kpiK-GY%-IP~H~6cL|OyilT+}7u3|Spg9pLfjtbfa-_hY z%Sy)j(jWB9yPP`TZkQJl8mq?9ctu`F$FK<}3O;zH4yH{?EBSg*Jy% z6|z7j@NW$OX&vyl2%-uT>;4Ir*1o7NUPXn=T^b>vu!(mvWfql%3Wc_TwQV$V zzU!#EnF#C|l-NbN-y#K&CgQcct4UTlyOSK^aaq~;Y+OO*l(nM^n;YhnOU6mHQF7e@ zQ|6OS22-Y}%ok!honin7w+iu#Qk)pB+5Q7n5vnJnv?EoYQq+|st1#N-Nqc_(hSo$k z(@M+*&+}1Tm_Qc?6E`H)Mv3)nrYv-<5y>%c0)L1y&)GMmoswPv+!Vww12_)R#?7}m zjdr9`17RY&cJVi_EiRH*&3&B`!#G*#xISE7G>gyH{PIN^gEdzEDQN zL?4oIopM6EWfhueFqo>71%Jq@6y%41=z0Fa^WgMCjToX>jbB!90Ql*iy_M$@FAc!= zrQYwQRat9niNykHGUGqUN+&hx54z`QrB(;`g)1Vm314X3^1|_$h=&rrf}*-ZB!yaI zh$lk~MgEqyOKc{Bu68W)R8xZ=f85!t38_masgH6$Gxb`F%ppxx-6Ewl`UE-o!pQ7L zLU{_Ro8#Eu^pV0B>tM#3$|jxkzb^w_o%fER;#iV zTYSw7gDAB8SF2QnH8t&i;c6#z+PnJiJ=5IEh7Q+HZnxHs5n1-iNo5B_o@K z#sUJs0h+LF4L_hT*pJC~U}43D>)9yGzERyvk+)9w`!%;Xh#e#O!mp7p^q@A^Z1Szv z8FXp*qD!=~gc9$ye&K39(c3?`+r#f{Cjt^8JNzQbJ|x^0CP3mMm^y?_joXFE)yARG ziUY&8HSD^=;6Eg@2>MQ9LQnQXH&w75pOH0;(27X{>nVJD}Kwh*Syl;xNTPx!>X{H1=Z# z^TftT8XOv6AvZ1%7Czo6x8+r<^`Gyg za^=^w2Be-=F6aVME)5;Gb7(}Rfe6dGH74dx*31)^mdUYP5o$z~M$&BrlI?`TMT%h> zc8Ll=7+9>?6Aiq^O%iSa1Lpu7w%3o&YuL6%KN@lyXD11lSbBwWBjzW5Z|m__}Mp z`k#TM>IW4J-%rr+@W0SyWdxB27DVUOAc`mH4QdoXaz(N| zDN7rBkUlXJ7Xf8Z0fi}*l*FG4`}x?OKDIrL)XcW1(dXg2;d9v#&WGcmMgTuxVOi_w z9nh9|qiGtu^D~}k3n-Aj+1sDsgya*`XdCQY@}1UM&%oH{M{R7Ee4-Fo4C@Lx#Pw4h zgITi*hA(IrREhJ7fU*dVf$uamZ0L1%48g|_fYeJo@H$ucau#s7&eboZox>w{b(^m9 zr*A}g#wVftkhX*A(`dKOZ0g<4IV8l#?Cb%t2`0!=oaNQ6odz|o;Ty$k5XEb<`R)L; z$#7l-9=_>^JqmF7PAcQa74OsE230eFJZNF-?vbN)Cjw%+Qtq_RKzZc%?oh=2nXK}~ z=I@cPQQ~CEe?btVpOaCSg(iv$D0Ta3 z!ky=D4<3h1H{gL!JV#B3X<5mLE-L%cn3MO}wqv$SJ3E<4(?zhg)OrDDC_sQY@GeNwE8&pWCn;oIJ zH|pjW)WLlt%$kFQIz*+F5D{WzI5f{a*^f{zrN_iHdYP_Y76z{4gW!Hn_4@cn$kuF@73EXdzEp73phpH8{c zHcKloXp5F+f>sttXuImiX-~FTVQd$gsn63L&psft{x{lya+PiqGL0HKwWxhIgh0Ca z1$J0FII#%G_aF;<@tB|FTgte9+jj56X4q&pNBW!Lo1cfC~d>EoIR~y^MEOdBm9G#n;PWra_Mx^vbsUMEh zw8T8!X#;m2TBOpfj+&wS=|}#4!tHkuWw%Q*kM1><+xXe{$gKZ29t+TP0N+u(fMPt;l9`=uy4W5Zi?(++e@AIaq0H5Hf9y~uy zubsb`H5e)>7{;;qOv;_+*^Gxhi*%DPo$T4L4h;{=OUQ4UX(t1z94-l zj7QxIQW}}G9Yao=f|iaOT+DdbhgDMD$+z36-LCgw=Wc-7UT*!CbsM>uFT*j)>V*%f zN%0dh^WV~iThn7K{_hTH_j?;8kNewbCr}SXbS;fxX^FNcPx#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^m@kvBM zRA@uZS=m!t=N69fXjC zHUttv2qYvV5Mq%)?E5PA)fi*Dsof-P`d{>+k8U4&&ZqkcAr>!yQ_Y+~y7$w)=bYd6 zU2!ohE9=Guye?k6c;WKp%i=Fy|GISP(!Z} z;No9-jBB`-->I#wt;aR$crA!wlnP+VA0gyt!1sZ(O*cACmw98m-R=Y_@M~zqtI3U* z$K!E(z24^I(A?aNB_4MZUM`obk-{j5*P;zP7fumiG2`e<&0p0z^kgM=K!S^El6Q9oO@F6w2$+07i<}W@I3SX+|M7 z2&sV(6{7zR#9Td9ib>)=pRXB2d?ZAYU0q#m;cz$@iA36adwWCCX!HPhjNtk1?(Se` zXJ;El@%w1GQj7+9>28yg!_o12@&v;>dw+}hgO1lLgzz9+=c07Xbd3SnxpP8bcm4v0vO1P3UGDF-VC zY#Me5*G?3G9PUE+1$o|_L{?W<$3bv%YinzIdwYBK_U+qqJ3Bk`ckbLFVzK3oZD0$> z=5T%v>t-kj-b!O9)~%x>!HYBBncqwa={iY~I7#pB?#Axky}P)#wSw6WJazWC+9{=-BR<>Qv5TsHQ1;{9HC%|0+q96qrb8>PD zGcz;aNKa4y+M#Gj0nB0Cbd&<`uyb|=mYwpey1ZbwoDnH1SjH=^no4>l)Z@?~aaue5>q0DYTqYw7E1DHJ}h1Xo)`sr z0_IbI7DxkrAOtWEm90d89fF+#Lc(mV%1|3%H(^xdP#d0@TMzY5KZ;}OVS8VkbTB&c z=|1t1``)ghJx|BL-KO^bJFd3q?FN5%waM4k%bhC=mqU#EqNB*8bqexI>Lin=05$Ln z5e4q)=>|IjI|Fx`oSZ3JiwOHU>x9wi85~~>M8+QMWAuSPJaV6Id%K4BnmY&YdO`!c zAihK5&Opz$qb0m)_jYa6dOFsujcxPQb*>O6F#5h|n=)U$y};4U5Yi1k zNwFg^yxglW)a(>2IF5h$jNobQ93{a7{1K3iY|&-uw5_?5q}Q$P&?<cgI?dJG3SVSHo$Gt8Li~(k5r?lCd6+JNyg!I^TlM?gjDY`O4bn zxyl;PT!qy=OO%_Oqj@D7&oL>J?Ebz0Ryx}itDbug2;wgj;z6HXK|biqUn3YPv&|JD zv1BOjF419=@44&pKz`H0Y)7mf>) z6qYKGA`8@20XlaQl3hLN{WCb8nnv+9`h+|?D)+Sc<@&(W5#UTH>*h;*p2%HgdDd5-O9e=nvZvkgaoC0!yYl%n9^Ad0l#7RC6cpKP%Dm!Zd z=R{og{a=Cal><*?XC>eqiIY4ZVo3h*@2IC0@QlQ{Efz?gGxC`7H??(>{BI69FT?P> z0-ln%?iQb-lxhD-TAKbyC~K00ND)~$_M=3>9`y^Ccub2ws+|f4CbvQqQ(K>wo?b{_1`hvp_@sXps4FX7Usr^lJas# zu|!!}UGY8~c<(4GEv-{vhZ%Nh1_e^QAdlz>=QA=4Og9!X$TC&fU0!)6$5RFAOeUY! zX!HWjl?DUh(NtB%q1U@Bbh;)rq185)YqhSj%E|_c1)QZ6N^uaSkQY%z`UuyVS|qO2 z8PlZ#_!9_oFY}#K5tl;r7KJni3f{x#pM&fTbd2jDdmUZlRlNTO2)^`{kUT-a{{XM;LuJs+WOx7o002ov JPDHLkV1grB_*4J@ literal 0 HcmV?d00001 diff --git a/data/images/btnpluss.png b/data/images/btnpluss.png new file mode 100644 index 0000000000000000000000000000000000000000..a3ab92745e11c6e374d7e4ac1de5c9bea3837b6c GIT binary patch literal 3558 zcmVPx#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^oKuJVF zRA@uRS?N<-_Z7u)nx#pcPTTa0n|3i?fZcl@`pHi$1{;!k=2${+JLleW z@9)0%4rqG6Hh9p#0|yS!e@|a|`t-@;gRj0m`ReO$jXzmix#RIp_}UX3`+xnHR-&IyFR7W%P#C6j%UbM`ijG-H)d`DK*K@nj zaMoDTe9=%k#f%99um^c&%aN z5k=yA{O9ZEH}2=}Kj9w`FcBCSG!YyeG7%giFouSOo5F-qW}zs~B1%ZH#*4G3lCx#g z8M1PFzNTTWsJ6$UY`Nqp?;e@Z_TC)QbPxBIpT3o@>!1Bwc*{41+s;=s@{Jrk_{hu3#AHGpH_|5)jCnO}qMVb)?(dg)Cvq&T| z$Hc^#V`F1oh>MFe1N`5x54T@jf+a3lY!&CoY+2Yz>hq`0HtnL~dRCSG%tGdTN zt?IYGUqAft^}3;N_eTsOjR=D@BTNJ>@$vDN#Kc4n$;rvj1@=iuNZ^ivIEWF6NK{W)sjPc=nyhw3**Pewxw`aQvf7(_wiprTE{F>=vMDJk*0i)VYkGRR zH6tTq63EQVoXpC~;(+e}+lKwHe`;!~6=InnCI;DzCP9g5*^@b?dPiwf-%{DhF$*<> zy6Ouv|7aRp{c+>y=$=uxBsl2?rsr>x>DTzd~3HTk`Y2T^r z>}>8h91k%#AH*OtxCVl>E<|LGqq@l~(%Op+XB=hSBSz|E)fJzcKdHTT_dUwWixoa2 zj);OZNF6(NY^tE3z$TN)Y=wn|wxXh=n9PCqc z4u4Y7H}!7)$iwYB7N0yK&4`1rPN$o#si|?)*48@e>gqTc3LA)@Ef*cKkN@NI38Jp5M%^dg|%QSWP^!7 z?V)*~Q=z!g%CUfAAq^3P8b!&OlTv-}qN-!iPMOf?F3tU-Vf69l0*B|}cUS-yW>E(z zM*R5k(_Er^(z~NAS>0?)h-bT3`D?ED0EmBb%6p$m%`e? zuLlUA$-o#ylR;!cnl-PYV?oh5#lK>MC7#N88 z%oq`yV$Ib;#PE!~W2lf;^23ygXLiC#5g|kh7ew?B#rpbsW*aX0TMBTBNGBmcj?%EA zsx;hz0G0)GuiXf6TF4~;Gn%ij?*t8-6Jeqxt3-Edv9x2zrs}zs+Az9u$kk?1#4HPR zF|O;dEIyv>eA+XtX2@$EOXcNDun(FAvk%%SikR7lbs=USkoTt%ALPBgy~mFpJv#0e z6k<%3RnN-XuHPXMEhONBrW>mVJa96sz*uE&?I^uEg4?Tx+Ey_&!b0g3!)P(d6g&0 zO2bxV_YDEfP;Yyn6QH1wR`hD58A8xn*-Fe`)F7x(t-r^MG@`zm#v{E>zIGMl*HN>Y zQbdqdK1#`w&hyA~_Z)~k?nkyE&k6YKv(IjO`vp!Ud{1OywYfy@;)U0#y6UvKq*dUy}39}~mBOTz-gzqRCUd@>6b`2;t8 z--7T)(tH8zdu*=yL2zXJ46_VB^6a~pkN-rntZKHX`SK#Q(;g30I@%Sg-j5ayv@oY2 z?na;8Gb2lwRgkF|aoz&o3eWq#716DJOORHrFvRAn9(ef#n6?v;vMyjrb@JvZ4`;f# zb_MVSVI_npWC_BUxTvJ;`P~xRX+J)3d>1C?Ep11hvygv~F^w!#)O=-$MvHb2rV?ob zm>~M(77&05gE$}}KI5eYY$VM7-if%Yhy_AZUe(D(dB@ zuC)IA1oqU!=a#p*aeAlX-D>-8YG6Nz zbL5YB-lp-voTKerC~3bwOEZwFqHpp&dRV-ESGL~*_KP?p9~2&A&QLay=LeRhb>~`D zJvV=C7~(yl*e?P5N!&#~BF3Cv+Av4HUoL34&_M&-9~(wCJVV{9fc+-UJRcM;GG}R8 z7mA2H_5CxNQ{%s(qTT$Y?qvnMFmcTEJkWwT?)sZIE_?aF+9icHCy%2XeB6g6G4)8cfVdc2_gtnpX$f@9}L>U?!U0)aUwB*YvD z1P5~n0D^){eE0_jnsx#|7zhH(1eaYR9vCV#i_!~i*%a~O<5w2QF8w8KgW>us3y0~Y z-_CZ~DlMTA5mrC|goj&zkgzZpf4r$%zb|P+))SUi8QgbGTZpJ^N=Q@Xo_=~*@+pZ|M$gfA= zEd%_hbG9N&ZHzQX`;(sqk#Ux2@iAL!k!~)Ro}3}lg-!h?S>uHhw1Nud9U~uAU!Ffy zbM4;#kmieVd7hC3Q5S+u0U=}=@@|MQ))F3d%=8Mp?u8QS$IrBHKXZ#q@cEZ1HDB=jdU23Gp^9Ixp5m_9{Tr`_)xd z_m};OuHkdkgU?blPb*H0wko?uwS~=>rFqpoVj}FNJbCkDx{?09?(*DE=>@}^go8Aj g?5zOzN}i7YAD4xRPPx#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^yWl2Oq zRCr$PoQYOcNw$XjX}Y`Cx^HrOs%lF`!2u9QM41E`L>$TzMJy-gd4>d%AxTJPLBOfB z#;&?AbN3e+`w)4^WHQlmt#++gKxUHU`Og3Ey<-| zeICDJ6&3@`h4=N>Uq4mlDLhmMym;V%cInckHpb=4m)qSTkCn>v|MPi}+2T`LwQW+G zUwMh(VOik0ip$B#G0<{zbKCRs^4bdu3OX2tg@v6A{h6=4M!+8Y>_F}moPyN2r!i0C zox)R_DmdU=xpJkmsHmv(>eZ{=B_$;>qqw-Zi|2R^uLZP#|N654DNwdmT)eoKl9FN) zMm%_^4mANop_P`Fc9)lz_vomosOV+r&t+w0J%9zUg5*8^u-4u##`$flKWp66Z0p(< zbI;Peo=yRbiJb(zCNnmw!bWC@4c1F6ox+2}(-QM6a zo@;M!pHh%O2R;z7v>zhb8P)Um2_a|Co-InM5?y$ro@d)-*X^DMAjv~AZ#_){$`-%+ zh*w-Fw&mh2ys*HT0$6Wv?~IJuzP`TM{{H?shI~KAV?8}RGrR_vs1mjE`w9_DD@4j1 zvNJWNTA7=fREPip+`&VKY7ZSgTqg;jRv^@F2P)C?BoGCt_NC@i^>I;TT-1mC6dphT z2eg5Kfw@2+Fh4Xjw7?i19$t{27X}9h7v#BlfGSAT=!b|BiHY1O)J{@SD|0gmDdLPT zKUj$ZDi>gfQ&Q?vjvQe$@KusP-CiMT0wMls>4JTz`84*S5G+Rw!?xHGcz^*Ez(z(! z7K6dyk~`$FC3$X<*8mblqQ-a-xj|%S5*2?J6=G#>CMx8!$qoKu&kzOB-+%|SqiJc4 zscC6VjH9WkjX*?^dr=_(-T0^WCG(OU@7%c)qdqPk2nr8yqobosV`F2_$H&K)CnhG$ z;Cp#&S)O|iNR%mxG-`|ok?^2ac2%gckkEod_6!hsM~)tCNIiC}>G;W$EyvT-TlkuG z{CE?OW9I{Vh=~eN%NGD@>4JU9yu>NghxNp|)7TbODLi0>LZOw($w|hGa5(&euRJEt ztyqvojo8``v97LeoDxS>NPS2w#0A7cwJ`w2DgWFxL{V4nk<`=%fz^C6Bcm<-)TwsH z$;`|)AfiZYy_ck-07)R&L;(_qsL|BETqK!P)rW0S9`FDMw5h47RmSx6v>ANQoe`OtU7ufGe?Pmp@;#7& zO^n3OBp%+2c#5)7xWw5}W;m2gEE!V=c|Mr{$$&0E>;*tg9@rNUsy?ea58T|`{HvuGuYO#4{nKyDuYde)?)mCFM~TEl z63aZHfNYMksSo)()z#I*WPQR13goi@P!kCXWNk*`_FuP!i28_cC(_effpzZU#oqIm zF7;oKA>a3%K6kDgD=WYciGh9#ZvoK6KLC;}0E1mooCogBPrt9c`T753{4NlGpBI2Y z_N$Ouk&uA0xj~dklr$Eg7YE}3l$lfBwg6Ed*2Su*F8lK3fs1*00U3h=aR3#%06!!K z>MSHt4CDgIz}U_YFcO(rUtD?l1F!)1;_b!&;==OUdmsZF=)_K9sGCfPgESs?3Xs}W z;`d*+goygE=;`z4yDtd5O9cf(mkJAq`I?=ZI{?&V0OZ5?0b(DL2n8-RAW1}HAoeo~ z3{9@gEUvy=dileDmZR`?0+59AoQzBy)RHD1Kuse47>I=}z`rE~DC+yiG0D1_V%_sO zIej_#`GMRkS4MJ+ibgIAM3e}?j1RQ1JC)Nyn#nwK((Bi+n^}mKF`9)31_KMBnZ?($ zBDICJ_rD6j-=4qv@i(i$-&KKXW1j+7{0dYH+fv5FK>l{TEX<9jZnXew69P;@eUf3Z zDV7CZUUBg#1Bd`64q|U?P7>Km4D`>1$#yyuArsmr!Z7ivxwUO-ASgDRUwc2b^!lfn zmA607ufF?rVg3DofJnknh*pi;#z0%jgb5LvMEqIUtpgPxL zx&!s0IKUN@l#DUt`ye(3pp-Qo$4;DRW`?qt80dCm+-3sxm)3&SH4jIcy8;XS6AQ0~ zreW#I0++f_0JiKE zpf*(f?JQ;hW!EZttDm)ooBBg5?Zc7v-m&>tf$;OU!N`ku6Z7jogqL3Z6ovTxFIahT zJqmG2pm{@no?Uw3)q#Hd($UdE+9r?yGZAel#LK{HUkmW*CV(=(Elii>LD@pm09avJ z+4z;RvI)NOGpeMdp}a{3K(`~4opZVE`rXH)H7$XKr=6qE8+t=4t%0f4uHfv;{)xrc zLsQFdMTPG|3ob-aB6hYQfyuz$k@@FusTqM6rv{v)2Be6l2K3vP#wuZjX`I@Zb!!yp z%>Dly0}=a@JSbc8top8$mxqe3T?+vb8()@~NGX#HfZRzw)X9ufO$8NIfm=^HBX{fj z=c=0m^N-p_7Hhl5mmB*gU!cOC(Ycocp`|x!Wfvkb5jD=OGT!|f9pC>Fo?U!R)^_1( z{ioTNL`65ood>&(1gC&D_O9tf{?49~3h zh?N!M=*;T7@wv74p@o+}kXWXlzcIE3CWG%MrsrO2H-^~|3t zi*=G*0Er@7MUibo(`y}KZ-DBkZ|j)>8i@jMlqzIfcP-dmg|q7)Ufff7zRc_22jl>h z#K2U|CJ_v9iWPKSW~UeaX%bnga{O z#SM_-%On|KHuX=&j7RltVW7D?v?!EO9SOtk71Y%?({)zmY24ce9x$T-C8M^G7|6h6 zThyii6=F;x5zwZsC2{b0dS**@(ak}!>P}%LdR;t-ls6<6vNLh=Z6&A(Ln*n0exBx|w#KwH$plNO84-{Ol z8ZUd$94W1CnHDJF4+W@6#Z@BN`NrceQ{s3a9Yq3@l7|6Q6w0_={bZEvs(Yp>kSS9% z)2d}j7`EG7=h}9QxR)RXs)eI5Fh+q^g(eP0>%rn+dDWBI%17;sv_I zFolNVuq)u)9-q@`+0BO0sD)`wQN}RKpo}RJtGY2TCJs6_*4Eak^Eq94*Y5`fVp41z zQ{q@PDoBcMg$YnqChBxYLHX?gRK{RRhE3I~)OVUF;>>Y(4^S3}u24ub&oza#%sNDE z;S$Nfz|#R#&&GCMOg3hjlXc?br_QuqDz6$!mX+Q2F|!swOi`w)6R7UUDX#28VGIT4 zLffO_{BWZk8J)_VbEa~3CgKO^+ISSpYl~kStdumVCr>pA$iRMpRC@zdr-GWj-LDr4 zul49GLRCfwNc(wv*^=V_9d9NQrKC;VD%^m$Y2Ac)$TW|h zp$l;*G0|VV?#0^s2r#~V6{1|=-;D~TFgAN+wkm0ytnAK{DX?>*+d!fa9VKdF+3j-Z zZWXy-05@gdcn`4a%BYZ%##v}bg(f3cRz_zgab_qQ4-G^~DnR6Yd=SkJ|J_V|baHo^2!Pe2(($_$1W zX%00?DDhxgp#FH}g3{+ad)h;i3JqA4RUBI*ln|4-J}0D@n-_N%)^@<+W@IU@_1uWr zy(&!uEUDcZ-2$>{s^`Q+cY6rGXEtk!8p+ZW-7ZKJ$whIIE=)dywH;8SV2N4I;4yoe zw1FF74oJ!k0S=G=#*HF;P^K}=@il3~@fxocw{etrZ`SpLlnO;3)-e2rQ%sxW}bjZk2yoQ&&EqI#74V;T@}e(ni#1^%k)A4 zU=BPAR0gUsLq3mzWFO}>3X5b#`NZet{ZP7&v+@}4?VbG-_@?o(p}yq7b4nX?hAu8d zn^?S<=r6W?vliWZXfm~cv?l?~aSC>Taf5(~#R1BND^yep7?flHSx7D@W>Neei!EIiNa80M6fGxVldfTjv?PM)fD_Ya<<#C)|g3gFISK~$uBt7DQ& zf>I|2q_wv0$=1^W=9q=NFNwz<`Uw&{4O~&HIZ0(tQ<+U~1*Ulss?jW&*)12mT4#y+dpk&p!CCJ!C`;D!17N$))A(RbJ7pk6Nalh)JAQbEZ zH!6;v^&9j~oJQf9!$Kb&o;PQf>`d%ndmKk3=poX4Ftwsw1eWynT5s%ljajUBcRn~f zAUv3+1ag3CCO5|~02>_>X4o?=s#-mwwh3OeJ7kt%KN&o?@xWc=Zqh)d%rU1t3k!#^ z8XGn}TeItb7a(^7R8^`82?d&jWKWr%lcd39fCOl5+rWQo!2gM}m-;xVzhh@Cb;Lz# zFVtwx8WS6%XYLG0qsZvt9ZmokW!W9D+p3cFX?<;sDmlwyE$${DuTYoJLYAhqF`c03 ze^tPeYi?2@B;(DboAD2;#wKbs0yPU%fbWpQX-*dy0alQNU9#)MeHezcmL&dMB-^EfUMw+vD9A2$852W06`(LNDVk3%OidJRmvvJ2u1_9aSIyh2TeGMO0w zl)z7Mu5(?!2eN6v+W$RC+g)r9<$eB87xyVYjC8=il>hkRD`|NC+Z_Vz-#jj*($4=2 drjKwT{}1m~((K4aLqh-n002ovPDHLkV1hB!mLvcG literal 0 HcmV?d00001 diff --git a/data/images/btnprevs.png b/data/images/btnprevs.png new file mode 100644 index 0000000000000000000000000000000000000000..c486c81f5a08839173d88ed80f7f2895ac491235 GIT binary patch literal 8514 zcmV-IA-&#-P)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^*oJmAM zRCr#^odE3DhOjdoM_+_k!v!cjWhd`oHDr&#Iup`DWhivgN<}fBxTJ zeeeBm=Z-JwKV|ugU0-?s{cpYZmG^)6#j96;x?{(ypX}JN^DlSq-1%qpCw)NAcP{_a zUcI7!Yj(VPHTde)t7dxMv1`|^zAwJ`d~k7oZqn$NAARv9oyxoW+2s1qzn)z8@?&+a z_EUA;OAmUUoKQL2tSp}%N+_QmRaMQuP*u*oOe}w)RhCX^5=tl8NGzMus4Azm$<=c& z)z!1}s>&B*i4{}BiDl!xbc}R$oz{zvX+X#P>x8QLKYDj(^bUS0rf~GDs_Mm`(8(DR z!0?2M7YzyJFUAroX6ECcjxWX(3@$`Gel`=3Rx#m|m^X4o@npz7{C3~PV0G`MAa&2> z;N%{+(3D>9=sW#>s+{4#l%mnlyHyi$xzA=*C4-CV@^MXS<&;)kH8Y_q9qS>Wu>{m4 zsYdg$vTXWm@8A@-=OEPVkBnDrY7XrIT6!3%cJhPlbVjLB+m(`zj3$4J(a|j4BTtI8b%);K8cHhYwdDIdZhd z(%P=h!TC(1%cU!=9yb)-H`Li9u~|*i>XM;_)T&8sO6Am?s^UdG{q9wQ`7h)yzPUYT zxeZ5+FP;3lx|YDzy$npOob4dBkl-U2AP)Q|svL(s~JF%bWx z zNC9C!wqR(%N0mQfbH=mPz|go#RGR$x?%lh~*Mi3t2XG=ZCnu+RK2DrC(SX7Kef;?G z`V-DB4VQd^JHyh8MpH@w@`X0B;zgsXR&y+|dj1C+KjSU>rm}Q;7eV_OnMg4Cneq6N z2~FUwstJel*V@+tCpTRvZ~y-NZzvD&V5&AYHg)#)_H|GjAOY5?Q>QQ*^^KD!PwIf4 zIO)>p?jP|iI-_PXrD9y0TsbuxS2T1tv3l_r%8HqE5xn`R zoSwOJ*OPioOf70xQ=Isos6N2s0Rujd`#ZpcxpHs-17K&)oN07*b!|L*_H2{Bf%i|J zJ`K1GBouk-%=u>D=(N6s{O-Bbs%dRv`BXKzoZU3ut#3@O)qb16StnM_b|}jxwbyS~ zPuiUJXxX#ZU|C>T3nUL5-0$&dE5d`x0-mHe1`fc^pFiJp;lhRHix)5I9e5v~!{=RG zTp9r$%02Gn)Np})K5EC~XM{r37rQrw@Y>oguoH4DSBg~N*%f>L_- z8y~9P2s|EnMfJgS&CJYLiUOak| z{3cAALv(O-YVZtB=t(Taq#IwlANH*{s zui-s>1~8#YfW-IpK}4E^=nU1{*xJ{7g{XRxN{1I!WnzsbSs@=03Zl&m9mKDj_-4TNL_g3u-PFh33tY6BdAii(Qr zijI!%ij9rsqdO)hrV9h_0VoH_)hLGupNIf6{k)ceIh7)-91&?t(BI;q0? zWpcw8vfku6bO|3oQ3(~seBkY>Nz-Ev4SV+Pt=wxs9TR$_AW*qch&+J6|MAoX=8K$< z`#z`-CI=q|1wnZL0x*C?;JV}EWWD%RV*1~fzNF+LIuvw&hUN9)Q6J?1P%|7luG4ujKsvm=PH$o4Lrxd>-Y>HL#6nh zK8SD++#iZ6#Kk;y@k(24PUmc5*_eh**^wZwzqd%q^3N#}6)B#MX)at>^%|NSs5Ue< zt~N3@uEFDeL&It)5$3!ZfathDfdI%;7nm~vVrG-36LU0C=uoiKZ?MD+z~;AM`idzo*Uv~vJQ~7ef^EJ zk}*{|8o~Xk#OB*;LZtBhPYLBS9WnX+3nwo7cLLaf!-wk*nVPb3;LxF3BNLMvm@~|H zD*-|QB0%JPI9c+2od5v!B_t#;T)l#fCXp;!oa^XvI|B48L$BzDwNDv z7m-o!q4BU5z=MZPt9=w%LkVRQH<_4W_RzCWhmQ5;t|xai^))ODCZ0hpzYO|zA) zZ8ILtj~#1-DQ|@Wkx0t{vNjV15hS?C0TDz*9|#jpQYZJ`e_SwW#}n$YC-MDYEZX$w2YCNkRw zg4T4*-o6FH%FeDCDuhXI7NA(l@kAOeEYzgP17S`)jp0!^CN{1+{XzC{W^vu*lhVei zoU*2=-124}M6N(?#xeymfT99L6Gke7-^6cofQZ5fBKZ4Q!{gAAn!xmmab@X*HmOeQ zm{2wMx;mjA--lFnM3Iea+`>`^$#m-h3*f9B9N55f00lrq;?4L#c`b}Tlvg5BBF&lz z@K1p^f;tm!-XFM=TQ!kUSUd5kxPJ0+NyC&5A_WXliRuB9FpwEBL!m zY62h<|Fiy7_0YUeM0R%-sqi~G6;kl{E1JJ;h|cR-a6IqT0rkObZ3vw0@#C!+fCw`_ zLV*MT_Zu0pWO^fMjM$A4n+Y%-?guZsd$xwfr}idgJRM7WTt0p~r)vCuLCwU&qPodU z31T*>P*fs7VnCTv6z)aJgVYD+&vQW}<~)sot3cj~a!yR70T4|N5umxfOJh`S&s=QL z$OKJ~{-Xf!a|4>k9S^!!Gi71xzygLfDbCKxsg*{XEj`*eI<{I8R77Irg@zKq&D6v4 zb`~lCnu=`n36ATIPR|`t+$$PUWjq~C%_y4Ys8u#CWop6(#pqag@uMhcZ>m~Zp$tj z-pKvD<1&V!Fs42N26*--PPE|>|Arq#I)n6PD*%ce84D}xx{E%c&u%1U4u+;=4@ITt z4aeOn7)iKaJgR2YvIq4wn*x0vv+oGb8vQU2Sk|hF#x3Z zbpX*&*kD_W`@sVTO>0iM1$11Exi{dad^iwD0E5*}hQe>=3`gI}8-@xKA3PmR&MeiL zvIy}J1r?|<>uJMeR*5v|dHRDVLoi!ZFB~4CFM@{{eYyI$`N9`tUIyk1_X737QUDKa zI6GJG)|kSfg_y#@7E1emw1ZNYzfCNkX^DaVb9HNn`9f`g=5X?4I|e|)oDoQL0I9J6 zAGlF~Xv{j&1iX91?S8N5d;M2p?+^GYG6n(?9u3||${Gww&K`rnov$-x4)GQ# zk%G$jz5HqxSZGYbtN{}P&u`w#97L~BR36}=Il&vNyb~j~vgFYhGlpD!@b`zU9O@~E z%*GXuOc20d5kT#4DY6WQKWdt>c5-Qj`9f__9tVg=m@$+|xnL7=MAX9su#gYnxk{%C*rRFeGj=fzlqP$l$3V#TQ zFlYEg1Qrew0Y)52w=xD$wuzl-C=VST1P)&R@-`NlxqyfAjjNAGUp{{gfcuOORt4Uw zoWLqG3M57VXi3$_SisGq2}@f$mb%zU>T^7GsvU!=kX}P1hC%@l^)Naz>+K1O;4ahp zKMXe-fanoVwMxz}=tiskoAmJFF<3&=5Nhm~eoqa%RRiDSHf+1|Tut zN6-jf2L=boA~B^hs7452E$hfoXL_|%Mjtp15Rc1Mc#o;jmmvBp9}O<~!`BdFZsm`} z-7OqZ-d|E9KqgawNuekWRf;28mDUHv@d+h9y(u3dKNz<|_Q4@j=sChjTvdh^iuxjXY=mPzDj{ z4GSz3ow;8G$RG(MU?TB`GR5H)7}>=aTcX0?;6&B&W&wPj93Fh%O1|Cpj8|)Pe*Zkp z8FdrDml<&d{RA+U0fd<%h2bXbbo#W;jNu1uNTDd{ENtwWPrCVcxrL_>xKS>*5n%eh zBZtUxL@C7)L2^Yhn3VFcK~SMkj7!%-IuTvj8fvLMg+Re0EjL-fV_%!F1Q759fUnKi(Xr*cUu3UW^z9*!$lDy?mO-QovMf3S zqIb-4knoROl~5*tisPL3jSf^5FjH=-TybKJ%cJdj;YlXkMvc{ZTI$k40AHpniib7s zp~(XXB2XAtAP2}H%JV@hN9X1G67T^ zF7E#AA}|h(D-PgLqH%CAS)S{y)nQ^mgvvQG<0d51$;#64msjHM52MOpWt_}}S2APX z+A_7WYdGZ{`ixF|OCd6lT#XV)B;6uRu1uJ@I8I#jX+tfG0sjUw<)(`KP6W4>$;yGc z`o(oqXIc}L^Sl}W!)Pnj!nK6QW2kdkB285X&jVL7V_p{{8l$X3RdT@0s@B;vq;sqM zp?DlrEpNiS)6dljsN!%q>)i^4VQ^p~w6{^593X_EET7WG6^}loZjAOgwX!Axk_#rx zt(RK(NLL&wZ9(*vn=wnOrLvB9sL|r*4OU!DV^fQo?E=Zon*rsOj1;|j0K%g!ZL#20 z1n;E4MAvJkE1EGK!&~tfr5q{|za3N%{}=sZBs8P`#W6?c7DQMUiB|y#A1SuCFyYQs zC@wnMZjh@f-P*;yWi4N}k@xo*nN<0wm5rmNMQ!~ZH}Cc%Ilve@%;t>zfa?ST;agt=_?`K zq90sMg}gTAr5$`BTd^Q5`OxQ>-zCWH0%$|ZhWaQ9x0Cz(F--V90_abXSnCyicL4IrkfX$8msbXyeu!I&#(z63O;13H*r;Agu%b7C}^DV*OIEsvnc*thF!H#Ve@rb$KTR6gKfrrp%(U;1Ac+ z`rk^B+X2woBczjZzeNfljl}Eqt|mpr>`rosW{T4B+3U9|rp#^Z+1xOnT#_f%vgEoQ zrpzaubf!#ESzL&@9wqX$VkGL$stwQT3{{lNc6rjC-@lX3D5g_zDL2Ln*b{6vT~!+)99$ zNTS;n^rQX_ebn}pHd^Xm>Pw3Ue@78!I5N9y&i;&BJJ!g&g$kGXL-ZE0Fq1FH)G3iB z|(sY}D=OI8RddLc^7;`s7lp5mZ; zgEVKeYFr8AS^xnJ7Y}<~P&M)0SNwwF{k;@zR-!< zT(e;hTV~Lu;fpTO#*#|BH~NLE`9#1+Ktg1PUqsmlH5%&yiIZUJkTx~GElhwsY-z8% z4FOjhhei!n-L^ICy29WWl34`(uBnw{L(sj3Ddzj0bVX9?vQ+o3_dg2Ne@=G)NLezb z^-C@ox3qI=LWzfltG<~#eQFdZsSAI=vKbz7b|EfMh$N zaFQZS-7ZlH2m=d~7Y1JACJDEIfnxv;+v`Wi)ooj&i-sO1-@b;=u-`K@s&e(CJ$A(- zi_!UmW2C&_M&%FhdTW6Af}(8tJu+n@s{f{9^7|If`o;7dq1=!y0oDg`_2|sj*zlP> zzV4c@{%0Vm`a!hjTgqVGTp<7|nj7CaDt{CdwhS0l4&TeRtdZ)m1M48U5Uze^#x#y! z3h1E8qB#Jh`+a%S`LBPMrasEl^FmZUPZi2+RCf2gi&tuD|bY5oCT#eEK zcCJV$96l1Ngr5{oR8kAfoteCB&?nz|`{WtcT&k8m%UGa8&u5z@}PySyN8d|o^T8349{$vf%3@jWm3fb znWEyw+utK$y~N3s|AHX;DN811X;tW5IR|Hu$C>q)Q@jw##ZMk#9nvg6W%DST~#ti0>i4KBu5A3r!T= zqSWoD!I{st4<3h1H{gL!yhu%lX+`mf#xE&v%+}>X>ru<4ot@02=_J@%YZ*ws=5Vzt zMqHQ3SIBaosayEY!2&KHZ~;qhU`e%ni<$_Je5a+OON)2h!;x5;iA0SXmD{U?FxD%g zE%_X_ztfDKX?*c$7iRQAA2iOKxf1rACZ(9;hsnUybY{I0$Tj>VhbgF&`As=cu2QzM zN>ZSpyrrm4KKrD{^{$}1)zj!W(OsCvLLM|7QyGiwIE}# zJ$b(MN_@sJ_5;#QgtQ?U&E0f!jo;C&mp7N^ZB~vkMPoaYsuzDu3FldY*oQ7o!=0;smSOUd|E(&wCv3<-^hliFNH`$(aZFTht@9|UT zj?=WnJl$yncOF`#(yW%6q5J6~e?R!qJBYHIC7DY1no4Q-{Ci~9{~MD(cpHnC6eXkD z_~Ic=2S$rovvuQRaw|kLp5~fi+9oC@XLAhx&`M3yLyY~s1>qm6U z`R&i^HVbJz-;c-}*hMEqw-9~#39ZX^qAu^<*n+`M+M_Z_+bkB9B_mplxWYaH+qD>* z_iQ0HR~mU;3$ZlfXgh|IHU%wxu75Emw+E}Fy22i{QoCL2#ExALwY}W+F->W(SsYooP04e>=I wPjKIA8dmh3f2CaXW4c+|H^QDg|5B9p|AOFPx#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^pI!Q!9 zRA@uZS@&;S=M`0ICq-KzX&W>Jf;4DSpg@7PNQ(k#0S7^m6h(mmU9qjbtWE7jZHZcz zWLeYNgOo^#5-Eui#U)Cnwy3>qS$4dV0R5qVL4p2~p7Zn``?N=lq6RJ=MLs^>^WAgK zz2E1Tyk6kHPe1+iH9YRMOP4Oa`qfuoeIM7C5MGxrU;YNJ|H5bg#P#2;t*!rffj@ik zMu!0^UA+7GBWh3sj2M%;)Cye`+OOl@opsfBSaLU{;1^n9;nme z=jSKThRMgo#Auj&dU|?qc6N4Oetv#`VPT=MsHn&j{G0FdbKVD_D$wgnUS8hiGp2U> zZ6aNYj!T^HbM;A`fPjE~$#d0_Oh1#pdGqFAMMZ_Fva-?>{JW&2WRO63AFBZnZ2%r{ zdS<8Gfy6E$etS~l(r41@lRD(QwDMS8LuqO0Ad{}CsWI2r*N@)0bBAH!wXUviw5qCV zLrKR<7Ma#-7OiYl;Ha9n0VWIZ6wl;?p zc+b|*&|o1rf@C!aA~Q2n55adq{1F!dA+G$Hl9%Wstv**TJ3FVZ>Q1XoGvIJHwFn8@ z)oQh~ySsZ_tJO~Ebh-(?)@U?Nf+09o10aSa5Yz;Ot$~)J&qXJZ^UbitRwUPQS_KGz z;-zqDm&%MxeRY$@sk1I@4NR==3_0Cfz5RpJdcEFdFc>C{M&lHtzrTNy?-2~au{xyK z?c28n5OgZIQxEz@cVuK_FrNL*Q-NH&e*JCmxx~lUx1Hhb zt!(TX*Nn_;^o=dwH%+eZT4%Q&*=IL)hevG-!^6WfBO@cT43o(;J2*HvLm)jpJ$DI$ zloBgpqOe6O>CgoE{NJAn0LjPr`uleT1_x^xe*XTQti(xGpnwAd1KXpbW4cOe+8rIH z*$ti5y=@#{-7!yZK6EVHe>}1D;Hhir-ebqOYt?GCF4%0g1&hV9U^biQ0Az+0A&Ab- z&N0#nni!$@r7Ezp=;jqzsMn7LaoyYdL;rw)mXI4av|*8vJ)vP?+JK-S4H7&RKv+bS zrl?lqY&1@;b&kw!_S%>34c=XQV4dB5h;BLQ$c@b&X6Wb%;;MPF2GY=3xE zR4=P=8UX*GkdA`d?(u5f*peK;kZbLMZEpKBtp1a!)rZgKHXeVzu=V7Nh0VvGPcJOr zAD@_5CJ=&PB|s-ZC#*taW22R>q*AGj>$F_J64kS=$92AmQ zKmc&>89{tGyS(*qY|ObtT^t2~LS{FYC`16LKp8;1;Q;`rc^6b^jfsypCMlI8DVdq0 z1Q8t{ZwL+z?LJ(AtIfd?aoq(ChN+Tv%Y2Clpi1Xls_(nI+BP(^-VG5O##aOpkGbzZ zcCG9_6*RE<7!}y70%Kw8@fTBWIF-%rrVdCUxDhF2p$6F0r~x)dh`5uZ3I|3Q%bz>| z;52^>4G-7FW7Si$vMg!Y+16yG(o8@C0B`R$xeMJ;r05D7jZ;iqiZZp$U8x;gs?|@d zG!IU%Ys~XoddHrP%5^Zi{@LdQA!q@?*L-hcZf$4CG&~C@5=6{?z}bo2oTE1fL+&eR z*K|Etd$I=rRzEcg+)v5KFsJ9_*p#`sc2+@=m^csuCjw#*07aV0P}DL!D^H%UZ+6<; zk`5Z6gLYV{R`Fj-eQ@YXg+N0-8nlZEf=sD?icX{`zZF=>Awx`cU{&V~w z|JesPS5d$seYpB;uEmHSc%fN+H~7YlTS(T(mCwk_b1+y53Yk_)0N1X2wsRdGrAe`=3fUpsI}mdVsWdvj)$3TIpm&C+Hg+xS$^gQIr69#dXEq<1TYq1qEZI5}hbQ5!;th*6b*0 zH+%Sg90*pSOl=pmP}92yqIGC`U2UG*B%S)5EB9HAAtXvLLQHP#vf&vac#a;tk2c(F zbgg6;mYbrYqPs#uLORHOidS5HX$$*jufU+7kKp%uik2&%MF0ruAPJhtD84;bP~S6^ zTibINF~K;g64Zi3B?$!Rv`%a78eQ1Z!Cv*K2$Stc@XEh+HY9GETy56d-Ss-le3g1+ zwzNs_ic8Mum8f%I^$9}Z1)u*|6!0ilKC7_MNf4|?az@4|ok-}$G9eShX;hMfptUw( z#9%cDgey#HNx=&7{qovYI~|9fkKs+jl|Lc*{Q#J3W`6!200hBM$ZTwMB2K2#RC*i$ zxYJBrX30Q!e0pzGQl?&!lHC`t%rhissf=m4#e5Ro|6xm1{8-Wgygde3&$lLB&MYehet>2{R0El7`26=?l=Id zrom};XK9bjA3k_Klv|G77xYovJFy}~P4C2Vwa&S$EVyN2;#_s^FT{p*(tbqYg~Wb` z1iRRINgL9K0C-jA<=I&oj1)pg=HB3}0Hjr-=p-OaD!s7AT!FcXZY2-CmzY&LK)?)o z{Q4asYT+0Dxicujsfs=wSFDjbvIdOS4ga zeJ=+&_dyW<;|gSXhB?saXYl$C%svAgAy5Smjbx5wr6ZwI{i=rEnbJPnC=h(dqy006IFLlttl8zbN0J{~uc97&ju#J*76)Hh$IwyczPS{IM1#7Rx= zq|eTw0iIX=WZ$+D7WoOL(r!+mbRLLVuv599X|vSH&DQ?qiZ1K=iw1EH0Pz6ut$hIa z1}4)6&P7rc=t2iUa7L==Fs|L!TDSK=SXXX#T9>e`{Mywx2Y_E5c`^Yi{Y|I>HZmS9 zs8pURNP4JL8#k+atUCa)bqgTM)z(!3#Mh*h1b`z8yFTYHZf6giOXVJWE+kaJ-#?p8 z3xYLqq?Y#usTx(9f$dtoZMOy>sA5}*TDi@UVLvItjOOvoxRaq{I!2%DyGG8hohDNe#{Tt0|PCj#IN0C5cu z=)x#%;69l%kpM!ZQ&IJu`I5R8cX4g=LQzfATwztiY<^|^RBn0g-K^3or?Rlpo>ov{ zNy#fSC*_omBxaWmGr5G!;-P(k_xM>-&dm|rI~tvsYGAWua3@F*!qMj55UE7Gdg|Gz zbOZDdh6kuQLI|6Eu@Y!(`!peJfG~d0p*V^NM>6Oa9K&N05{#@Qc6|CUCIxCTF_L;5|ITQQ&?C|K{hcfH*+rohx~QpdN6@8$uA=)L_RpB56WC@Oj1#84%vbo`Ff$ zEFF?@&rMKquxTOin(y%_hg;VKXpXPhObGzTJX#(yL%^BH<;^p%y!=Lj5G&EmN^sQR zDhqpO8Kva2lcyp)9Kd}%C;%WUdkexsV5z7QudEh>BRlm*0IUS7#F+~YRB++s|8z4MXbmelNG>7I^h+;_vDq~s3OsfD^EIc8s^p&qOF1J_`k5^ z<)9#_*8wC3)o5dx=~4oay%RkvS5~Zw0LBxjl2iejfpBz*?{L-m3_gqh4}oVFg7fd5 zYLyofgzQVOwYTtNLHN-st{TS=c5gO6f+5!lh^x$?ZUoL#)O09_m@CfnSUjT%&q~3n zzxQ?XI@kBHN-yI_-$1AQ1f0#l2vQB}>)=F7*J6@_%ZTp79iRB0CR%`QK;ng<Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^s2}wjj zRA@uJT4_*QX?Df#EtRRM$xM>!nXFamR8J*clT=cfN`6k|M}8%#B-P%*X5T? zHi5x_5Rw2%h((CS25hsM%@~`u4O&40v1vg_V)1l3m7fTnpYp}?(Y7f*QryVKL2w2m%F>K|LVQ>Kl*IfYxhT9yQjQP(fgk| zO&7af|MTkAOU-XzeZBO9pZsi`{x<%0ch_2Wl1!{O zP|VhinyrGqd3$-sBTI4P;99=urY)~VY00ncuoTsI+sa#p*9F~=ZIWT5Q$D`xluz39 zvisH+>4e2wp?>+(*4gLpfB#J0;uVV7=RaC(5?@T~Iz-(}EuqrYtS`(L;qD##!Stt>;S?cc0Y$+Z& zcI1;*ZPWBlxKi`-58fiBlf9&M_Uj)iR4@KR`oN(T-&=9!)OK0@!(%mP&YpYn`RAWM zX5-wsb4>C+K0ZwHK|w*YVPRpa$jC@_OiYX>E-p?RA0MwxNJyaI>e8~W8LOK6>`mj# zzixTxSdvb;F1M(j|L9~{o#0uDndhh4)Gt4g+_#JB$8ENJajzvPI!Sl-{Dp5N4ghD* zo_%uR!i6UXljm?a8YG>Vn5auhNkQm6LYI`BqRY(ZEmXA*+M6dW&iZ>xH|5h?pDENY zV4=7FQL0~_CX@a`HsyL)J79Fg=Ts~nmN>imkj|w`m%g>~SamL!t3|@;>FIM>Sy^-0 z+1c}K;P14wGyu{iCMD~x-KbxY-7{=A-nSUrG_U?%seN_&tq`=#eD!|w)BpZ=`SiA- zM1IfV8yupBjNn~d_!SjA;MTxRAj{Of`S4=Zf@>8fTX6T z>hb)m8My|&a@5%}<*>`ATo;Ln555-&GSg`!FMHt96wB{fynO>_-;_M=d9Hp)NQf#r zI+|JejLghAB#2~rJl;ZCS=qw%>(>|AC@n2rC@wBG0vtes4S+~YNt>%yjM&NGtBntw z7m1CNF`?AHK1Hz#m(&SkH&^}f_A|gT!&F2-BE$}5u3$N@tl3u8+tTgfYe8f^s zP0bRntE#F@00VGfBPSByY}_*Ae5Tde<_>Vd{itS+VJrU zQXRMQ?0uLQRR`sgbg#|lRhh)f0lU0=%-M8v$S$grtO$j|<+{4M<%WiamHPVn6>X;lqh4I1xI1O2@tK@fodY#6iJxOo*z zmwbF?5f?6AoS_82Q!+h4!N6!*0f9lP^n&t5e)HXRv2t*uv3t~^?3;Am9D20bJNkI* z&dBs;dsnwjp-`CH+S<&mt*z$f=H@k-OtuO}0OH1t8;qRb378)&L`6lZ(~GK2lF{X@ zx_he;hXNpt{Y3h}sVk`KwfY7Gs(t73hjzz-($^wduN~$5zwQ zXRq%V-e~F>!|HGLjC`?mcl_!0;Nc6(?Yn~` zj;^koRsaDTO-)T}BqzovV4#0VKBCnxLBOPI2pn5GvG8lH)Um$F(_Uw>0t+cYmf zmQ6Yy!1b}#7zWhc27btmdUgaVNw?a{;^}3|ng8?@Hl28BrneE{z z_0Gs6&9l*I?X$6I?M~nDxU;LP%StR*NKR|;gjg(IMrDGGU}iKxj2{3H7!<6^R;@$KvU)C();VqNN%bjG%`{j5fd{X9vwYLEa(V;>L>;-?CN8@2rd31~+84_DpjTX_|-~lu>cmT~20LYV1OIs(Lf_}pY6`kK90I&Z&-2wCd6E z@kS1pYmAJIH3Wr)?E#<()6>KlE3Wbyki40V>}rMOT5Y?fSlnf;koB$$TKnyi&b>0~ z>4U)ssyz^l7c|T@9_t<$cgPy$s{(;wsiL9+CPo#SLpR4Hi>da?l`AtS*U3e-OEeK% z$h)5qfLH%qH?m@lOV3-3qNHQE+=bZ0#09Vr5+1IT;J-RHK2(*=;1v1YJX3x5u7rb=)0y)YOWWq5r(R zJVyWM1JJ*}zyB;cJw}$GD6UpGxZt9Gxg)aJ7)!WH(0~f~Ia;M$R<@YhKJ(SbdBuC@5IWBH7@Ecw}YNOa5r)kM&|sO^1axS&Lqc4_(Fr zQHLG+$I2&My$S%P*rcR|$k;doypd8YTuCYrEK@8Y-oymFkn5Hb3j%UNX%#94nDR=D zFv&{0Mws9DTTGAhrkXj$oamh+U7x|RAd>pB5&8gr|g zY%ncW9sm$v1COB+G2Pe$JwO~MB~K72t=FYJ3>yFfZ$MgXfFV4dRZzBoii4UT=wA85 zk_QXie7;FCX?M5*$gK+88%tRM2U79)L9_o$)kXj~PL3d_>;)6YpSWw3k zGmDLo7W#!}p!~)pXU!pTtU3$}&0|zQY>>Rlt6OQ9u#tqOoa$of9XmQNWP{ZQ0Q`mz z7#X=cGP^f8DS(4OkW|do{P|oQcu}?T3_KPdpQ;C7#8HW}@0m@b3jtX5A{tuD+s19- zoS1o(Q5FEp0=jY-%4tBrJ`3L$faeNEaI@#oGrkj4p3x+a+dSd^nKNgf6iTTejG8CB z>PFV`YHq6>k<`dgI$>la?*_0}jffo#b{H$b!n*=EssNl6024v-(kT6F z{%vi>{*H|Hmw#M8X3^%>wArvHK;^+W!Fqu;G~1oCD;li%g0^)Q#9?weF4@EG9|r(K z+|^Ra3dzS@)uaAvPXHgtr*}AlKK%|SDcy*w0~X@lJ>g(g%Bzyv3Pj2c76jz4SZNWuj2fxWQ}aZ~{ajF>$T7&7N1Iut8ERkhhUlNKCRGnOmE6OaVeUbG2pT2ka2kk{5Hw9p!53%-yG&=aH*TVFX{YH-=x1*{AC*7a`J4JN z^Fop2_C|P2+#F^hbYljDTTbZ(ytT}da&t!Ub#r=Q*;-lwZ#5;acqK8rU@0LZ&lH=Q zv%pEoG)5(57$Uf7^Wh1p^GGf%{_3{^k3}S;%|~+6=keU2h$y`ujVuW41OdXw&tH`z z=&(`cu~+wMes%2k1avxmnwr}`k{{L!>UwNpQ89ZU+)Q}RN^FV6_<;%q$uUPV)GyFe zf@v>-6F&c-p#7wf7!yd8rd+zmoC0EC45mW__BFVF#XnG;&2O{PdF__4f8k%7zWDO^ z<8>fxo&C*wvWKoK^`qvMYvL{%^kV1HA6QQu1aTM;^bG9s+=pcIVNp?Y0EL4ycg*22 zlx-ZM!E?CAK>`ChI8;N21Xgrh;gBhTzF>Us*wy!Z0v)$}2oS`Ct)Q;k9ub$wBm)ra z-kFt@=j_DJPt4%}u>$7s8VV!2JmxLW0AmRF4FDJ>B02ip+IAZ?*e&6piQ7E$n~%O% z^6Zlps^{-fdHpA1VwvANvz3^`Tf&Fn0~sKcB)oAHBkcYf5@TfMKJkF35HSP}puiN~ zH#jU@AD3QWs_dHH5)ZG~MT4e)qtAc0FTlwUr)gID2hreSKTWM$s4|@7bR+f;w32&3 z_D(aH#>aqRdx!g)-Dk5P&?NCX$PCg9i=stINHJtrHCcoMh8-G{zu@1|{i;p%;$)gX z2|c92->1DptYplxF1V|CmR%{gQmHkBb2$5qU{&3$Fktq>eN=;ckQ7E0cGV-|6X&xk zBo=<}?6bO&)vcO4`s~^v)0<1>NfJKlIrQbiA5lrmsUKNgqNew(ta;d##;aY6OUxYVr0be>?9Cm(Q$@0q@&_p#O7*751R|Lk3IJMnAj%kK~A zeEt*h@N%qhz<6IgY_f?4<~OTuPH&dV`&|X1c6&~x#F|wuwjgpVrM5zPtW@6Ts_J^U zE$q{6(f3_663KLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000u%Nkl9&xJ z|Ksod?uQY;-hH3!;lIdD!k{3$_~Mr;00#j)1>hKfeE=E}Nh~rg%%P&e!bwEhq}s8F z5z#gg&I5EwM6UgZ-~R3O78W`C|6d1$7($?5KmB5jzzG1)12_U;I9ZLES%d{5!lFt^ zl~t8h6p{qYECeaUZ~z@5u6g)H0{x%g`JI2i({|%x#r}RBAQlJ%iG=>ezx?%I0q_rr z@JIwW5KMpo6hura%#xH;m6KGI>Lf|EcSe*&g_s!t5fI@Kox52n}WLl_Ba3Y zf7u+D5+!$^+yP<+GxL{Tc;QhH{y74l0x%3f9$bKkA*`f{SX0GXC$3X1lB%SfxTzRP z6GVlH1k6B0z&+fpcq!Id&ZV_-DRy{5P;#J1!4T>xUXoz>BBP=<(ynz5w7i08C9BW;|d#Gl7|@ zl8RDQOWh2lX=2u)rJ z;>z70`Sdf-9XNIJ)H~^IX@|n+kDmypK#9+`= zU6Hd&ckkwSs!5)bG7&Q~m{^Fw#MG}H0YU^Kg2Ij5W9ih%Q_G+K<7iKmDB7)t+ID`pMN&vhHgjtwd6f3p3F}r@Q>$=Ot_!Ibpr|_>G zTmrr*DIG{vrCL=YqQnd$?n@;R5sMI~L@bF#RWv1$lvGmEEuLFE^w^X81}RaKQX~jEpef=9t^gu?) zgSqq7uYK(wrK>CCMF^U!VnY@76F92yPH{*Qo>3J zGaE3`;@LOP{xBFoJmA2YGiOpt>9?x7-d{CU5={bln7c(9oB-OZ|!IqZ8gZd3o8faM&lM|Uw?CBKW(hd*S5R#)Tu{w;oy?Y99XOt4lWM& zA6h>C#`*C5n~Ey#tX;nLU2u__+(`&TU3KkU}EzT&mJzRnw$Y zH7cUgvl=2MOwKV81rf7QPaBj)CdkB0%uFnds!nC5igutju9X9Xn3BkIRpiC#CW7nA zqG_@=O;pVQX*k%dhV`(F2JN_2^s(N%K%kEbVMIej|M!@|S6-4KdUWdH;fhN?gqk(47MU}jOwqgbE!#VpJ$tQaCZfZ&KY zs?a}V08rIuQdLP(6=r5;5}+>*!9+pK1mfw(jz7No_>+$YOU0VBr!m4L!ojLdGu1qC z`0(Uisj|?f1^TaeHN`BY+HEoRz=W}v>Fa;KKIV$@%uk|?e=nG zw-%;&1edn!y3%#6<*xIbv*(iCiiNv{_mn0OU<4Kw5lcigpuM~SQ4j?&kqT2*VJ^KR z5dabS5Zmjv@spi9Kk?ms?8vNn7Q1(KeY(clR8xmAv6*St<#_kQJJ{IVMb~vP&IF<) zJiod$x4bfc_4-vCz^)^gX`UJ99+heuG*q@aR{Vx`~m zy`0|zj=Ll=?Q++3U2fZP$vKzYWwT;tX6|m`f$*Ny zfO<$!MmPbW{xNZ%)d?|?F!#KZh)J0VAUGI7M1k?ft(_09eRywvX2_rY+-FxyvoN2# zqV5iJN9o(rn4X%_`PD-+GY1bpvaqr`fBEXo?$Terc72)dUY{QhHW;y6a&FshoX73B zbY0u0P|22a=VlfW5%dv_jvzPy(wIO5db|rl58!>aFo|fdlyET+F#_JxR*T48dGFlo z?+>TuW$4g!l&N);Sb)IGTz_>xcAInRrtAQPcC}t{L(w`Z(lw8+KuI*-=3MC z+IB)NT{g3>lrCGzt#w^zCFeeUCWklN;d>7B#NL4jIrZ$bt0^^~)+#lss(nk;*Pj63 z;qK<{#XZ8K&q5+*0g;4wXLr`_Zf{33wSQ%0zMfs2zqz(ms%SeM4AXFNWhJGQl;Cf^ zb!p?)TYqwGc}8!|&P;8CqO($pm9BI-TgjbuUFVjI<*sFBU>A&A^31c( zsU&_rr8F%mDKS0B-Vh$);n726c=YB6xQ~vCB2mfr*6wbt?Ud%x#}3ZTE-cNi?-mT3 zM6*l#mx>3!arVO9dlz5(U}o;U=KML|u3>D`uq>%cWQ;#VmJTa`s}yJ?C&Mlbrt>wbB6K6fuIw zE$)>8KU=z-&AhmqxyOC|f{BPlSu4Hogh*me%B(E+H4zbF;TWXobo<(kcg~-?wz0l3 zLcmERSjCGQ%-qd#f0gWR*-I&IR>H0H>~pUS$HVLob71@Y#S2$>awy*J+HPEOww}6r z&>pkz!9ckWf~u-&C913@I;cfLD*^3*Ibj;U(Wo|O`K51l6v9FxY5K)n_! z%$#`gMu=G~O$}F{Jo&`JzLlj^HI0aO7U|m>5Lj9wT5PP|)OwL=Tw= zz4o1Ne`kBNyB!Pw?tzzI{?@L${c$_)+T6BXvA(IBAT)p=Cg}$l(i_eq!oB1#%n*ob zJ-sknrz)v(Z@%;$8w-=F%5XTWr&kXzmf~q5!4Yxv@FPsb6AH68DiLMgle7CS`T8rb zzWUaxrm6|=I=6f$6DPz!KxyJK&X;1_lmmH-eS==$w5rLq6wy8k)}#Ik$Wbb zaKcTPzyS~mr@E=kyn;&Gw@MPh2nr5Rz=8;S@|*WqMtvi*1>l=rO4tM+_yGs-t(RXK znU(MDj@ylHJRWzsn485UK_}=;)bA5B3r+S6ObjM3zPYh6R*?6dD1o?d+Lag#gjw-> z>+6{aV5UBt$}B20`Yh|;(x}>Doq3l z*GwFApHBn*viD^hA_NI6)^2{V-gc*!hqE&hwkJ3P-p`Y4ZEbzL@xi6dSrsQ1?r-IQ zJOH5qI1H9yIm{!%09*m^?U!D9$v;+|zHsqEoWFSC(#d1Tmcy|h1Y#Be6FB;9Bmi+= z>FR$In1G;~+V;xr5w9LNFqKp$qN<0NVmEKD?f&VX{`pPa{@~WkbTd}DFNXD1fQ4CP zLc~1!Uf7D~auvY8d+A%>+Wh$j98Prf_|Z!snsJL2W^g|fn8++NVdQwAOi%z!Aw=Oj z_jb;`bG6-daND+iXMMeW`>%ew^@Bfu?S|fa=hnhZy`3~o#60c|@81#y$lYOGDJAD| z$@#sA_)jmr^wRCWB9yz)P; zlx%+^xXH&2`7T|2Cto~w{_KfkPfuqr`{DgQ2M`SEyPxP2>LaES#6Sp9)JaRCQffsz zY*HQ$2U$~!o+S1IenLvr3& zy;a8LO)L4o|Ia^oW!*~t>8G!J^{Y!H{AE==SyzMks;MMt)o`W4sw`lpe)>cR zj>+DFU=wN6-4PLHR?N+dWiQ>h%el3#-RW}NC~f-(9`^1lufCeQw*CA4ssRy$1#(BHoX#{8iiLcfb2be>Af3j_>>&yZ(v4t#bd)2|FbazW$rPu|h-# zS!GFB_JQb8W+p(mw?8(*KLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000y%Nkl@X2U!-il-vSP~#^&lxzTrR0yE-iA&UG9Uk zJMZb|z4ugAe%$We6=)%mW#5_8-55;wtvdBpeP7jS!Vh>o`RyvIVHIw74f{Jk%&6`q zZr@MlbIt@(BMJb_2d3pYQ@zldU;Vlhy<+eiAAh7#{vh|Kzs#GSc(Dio7R&MAJ*g~y znt+E?%ay7>z<9iC#jx*bJPf7@Ol%>G5*tlwwz^f`Y&T-Fp^$9H-CuIYml|`cf9$5) zzxYU_`fGRKi8JG_s(vJm2fysFC&XwnaDy!L{9rTbUM2V3Q8*54NqVrDSWg?pRYrn*d)4%Xwp1xNkzNZ8K5r3XYt-6r`BH`g*15WscY-qykKGQ)P6YJ+*QprnX4L6 zWX+@%=I?xDX7}e!EA6C%;{>yMHK+hrf39l`}JEzxMlE z!|ltZrP4el0QGJ#5kvw+0)>!K7Bh-5=a@A(G&-@da__<`qbAyO3n9%OUnD}7#Ta7D z>Xqjb^Gvcl<17mtGlr?jxaj%DYo|whSI(2`;GY-${h$Bb3x)gz=Dz(epFf)jME7eo z{*8?bXS*+d^~vpVZ!2kXSe;b>5r`Sg0W6UuM2ay|j5&v_HmYnLS(esZ1MVn_0_%4@ z(t4{OJ2A!>V~AN6LzEC=$Rx&z6EUMa1P}=<^{S2Ud~2}x=J}j$^sfnc?03&rw}Lmh z!guXH6X3XW)Z72fjaN^1&OiNyo$+8tUEOa_BmzTNz#_yUlEgp~a}HUQEM|hN(_B3I z;OuBrK%zh^MeJl0mhPGXpy;>j^tk1(5}7qT;T}qxx@IZ zx_<(o(}2G{0z|;)&WvXVdpG{+@ZkFK3(xpGP*sdT#OiavN+s_PQfiOd+ zi7SCwqDTl5BuG!2?FSC8b=s{KTFo{jFhU4ucUqX4?Vx+)p@xG+M0mQGSwuvHSy%!y z2WAPxOynW?Xtam7UVU!Fg2(#X8=qvl^`A&Z$PvV1?TcRg#xnfXQTE*%n6!~XU)EyrU|~}hu-_~ceJmnraA|n zJX?jTEIyL@`zsq4zP-;x>@4o=Ze&WtAO_q)lLV$ZG{Tc@V_{)t=0?UkBinl%dlJ)u z#P-Rh{k>i9Uwvi#@QH327YMtvkIbn8stOT-FkxwR4Oh=TJ6@zq+ste%3}FHj17+z+ zJndY4Z8W!jeEuNmul%>?d!PB(qpgAgz|EJ^u>Z?9-uQMo?(Hg*kOZN+(hw0d5tx{{ zeoghN-C_oaK}1AMAfh1bd0@+hOgMnSXy?&qn$a3r=EIVCP(lh9DG{XbOiE=LlpIx+ zZzUW74w#c$k$iZtmA2k^We87yYp{Fc2vewYpcwUk!mK=Ttznt3H-pFKR^SUx%5?B3Bv$cR#92isT1)Vne~6sd4fjW&ph2p9qf8Hmgb?CuC5 zOvq3mfgvIw@YH0u*Su3Ng_$9_I`w;LZ{wnMmXCb!x1ZVmtpJ1-cYA2}+Up}v?99w$ zK!Q4mroSL&SU%Tk9J+sT_3n2rjf-2_MDmv0vA7xozpMSmnXl|0i$%`?a)M_uLIT%D z8C)&Fl0ibOiAbbo7O4YhR$FgYKbV@Extp1rDypiqoy}`DvvTx^csj-)yVtB-9PC`J zh+LS22sM`L#i;R3h>NEdW)I&xKN>4iN^p088S0MVcnp%jhwgl2W^->498h()5CRBX zqd*O2j`?mE-Gv2oIvo%*+MO2eSZJZuYPqU@_p;gnb%(k^i^_`qy|U0U-@ShMy*xPB z{gGFik*AE|SNY-LY z1xO+^m3Hp**UIhJPam9IX%=Sc$;`7nf=Qris8Rv}xcKZB2gyJ*vz9;jj(3MM-+Zdt zyZ*+wop#3U`ApT_$|`wE$&)5GRo7%NgA*&2W%6>kAL8oTogp@}`>JuzBNBlE7zAgA znUN5~Sm3N=4iYBo`tYFt${&qRzufF(-J>&)z5k<&o7b+1PKa@Iq`OeXEO%99 zN{ap6eQa-S*AYk+2=KLz4-c@=Y9Br&FTMD@jV?VixbMhvPg5sVsY+E@Syfe5rQ}*A zS2Z^`cXwEVyD4ckVnezySj~0 zRaL41SWAJv;MH4Ej~26bn=nbTbJLoE9bw_ zJ26-FW1f%8vPxxHrm`rstV*j=WvQyXx|zsY^8w5&7&NJ?Gc%h3Fb(4Fgj(}Y^gft~ zc~X~ziJ2fwb)oTC-o*S$!FVLxX{M5?+*mE-@GbdFeRVBc^(Q2{h^Vznn&8?h# zsCoH~SJUPzU)w)EQ}$xs7#CHQin2;YS!!99R#layvYaNgn<~uB%^c=N>Q2N!FhX#! zhnR~&KvbdLU?+luh>2jt%w+0Rt3ZQ;922-zo9Avk{eS*v<9#3e=*+W5hj;$`sT)fj zE6tqP3X4iwm} zn=aot`^=Yj=4NJi?T3DR(N-Q=VG%0I!cu>uKew>Z2T_$$(v*^FN}8%EVI|Y5uKVdW zLCIgb@>a( zLZDW=MUD2HI{XZ?*~=ko95g#CfCqA8C-|fdu93pTL{hs#!bB`n@jq=C>PXa$0S>jw z{Wre#hu3dhd!x)_-Hwu*nyS?bW3uBDy<;}Tx8i9zj7G<+5h%p~8 zAHM5PSedVL$j{ClT8R=^!CLF^Nh41+d~P-~bv%ffWs(!qm~bt}@wFerfYoMxBTqcg4;@tgd2-m^S}+n+WU zjwLkPtdzkfOjS1~R1;clZ2cfiEEAh2PSlKDqfRM{ojc#Vx^~yQW(UIx5^}ol$3L>v zi-!-DWyx0SVwO1;dlp>i4(!h(1<}E{fWQ1Jnr1H z=9Z}L=e-`IPvLT#-E_07Bp?tt5VEWl7FLf3qQ=k+e^i!*F&tpQTd}?Hd!4ltWy~5x z%ucu+Np+sG5V6QDqbJdr;EI`;$6;Y+^~gQVay){QLx?~UP$vu&`{mT5>sh72Gpn;FSvs-1&){`?c%e|SE zlY!A-^LlbN1!L_5Pv=B8v0pEt$=I2xIo}8&)KxT%Sh zU#h2Ow?2DX=r}OPAbGPJmR3*3*8JjV@$kw2^r@dZUW^8#x~cax_D}xU;^i!F{`=Kq z4|qPmfIu0eZeQzsnCuQ1w>iNilQJtzL?j%uCIdi-j>te@27Qp=rA@ z&83?^bwq;%j(Ma;XO8C%9hT+8caP2WiGTRB4_-(gFI zfmuRek&Hu@N!FYVo$j)%oxB^A#fwq0$E(puM|-{R9xb{S_{5LQZ8tjI&&2lX&cYo( zL{fKClkxyJchF?4J}FRBF1|S-^8Q=HVmz|E*#r?GOm^Lg(3zdZ##>jC9K1G^Aefe9 zxoNzxguo$W6!MI-W`}3GU0Jx}?l3cZc%M1^yMOt2Km6vfKlHavr`-Xq3N+i@7eb@` zt6AXBs#js>^>c6=LSfDzm^(4m0}xDVKGCG)60p?v(fL37^8Ul``PupQY@5ur9`I&O z?A+L}(_j6A{q+`)V~lV&skg+z(?dOCkO)L_%G+I`+~U`YUQb8G zo`2618X?Bx&-Y_l4nI-s?fv7;D=&4ouAVP#+;cKuI_Rb8dneegCl9qpW=0$R(C)0? zGcz-PC?qFrZd|UmUO&@6l<)SMjb>T%OkIWSwrUS1gwUj{HH-N}r+9Jw?tbjFey6!` z$AA9xhwtlOzkd1ueZ&+(#N%g%jd6eP0>A@$uHo%4a|Q za}OW9b?vIbtN*_d}1890y;_d*6gIwy&inGXP=6LDYecYN^-paD@8|}sQFa3j`zOR2U z?4vr^`~FTT0~7x1nUag$8}HU~_-WPRU7MF)w*J57Tw*l?@JSQeF zBn$ZM=XRF{J6oRwrC%xbZ_MsqzL0u**ODdG;8pO--C1E$A3(wD2^J|(2Z|hUD2WRL zWa5$qP?+IHr|F%AW1e+aM=Nj))vEeAD?{`)h%^@E*j ze~&eN)YZHDH!ksbccUx@Tjl~dC0NA)Yz|j~XLYg4f(elm*g3!%9n0sItkGREX|zX3 z{?*yFlmFrGzyJ89s^}MKTp@Y-tN*S9OT-grM%n(>)uS-`8LNt)ArD8q80JOMOU3vg z*Hjo%NeLynF*42wAsA;tBR2}P8bua6ql)ZC@a#DPzSKQ@_u0SwzNN7h1FOdR*ZXZ1 zB7!qOn)Bl??lq(H;hpOjKj3bUWsUqEF<#cBZ6^t<8 literal 0 HcmV?d00001 diff --git a/data/images/butcenter.png b/data/images/butcenter.png new file mode 100644 index 0000000000000000000000000000000000000000..63afae677704966ba76bcf16ae6406ea9eb29a5d GIT binary patch literal 563 zcmV-30?hr1P)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^cjY&j7 zR5(w~(Ft;@Ko9`X_Ex#XKY|v-XcQHzM2Rd43bIH7h%5ozw{!k!qJ|@6s$Rh~Oixcw zrCzVU02!4^1s?#7Mx#wIsM%~X&}y}$cDr3*7)F9#uQx#~%TD|K{uDTlQ_*lZL^BWs zVNPhGC~A@<>7Xczp{lAeo6U^*d~Ska7`ADeOUtsBwrxA`MTYCTU!Lc=zVCYwhT$rT zqE#HnL6RhENYgaTvMkzcHqmywjbXRjCHwt8IUEk(r_(8gdB2b^3k zmz+#Cx7%%71jyIl09pH7f`0h)EmXc`F!8t?DZGU&3bjygXy81TGP7>$+) zcuDfhU_6-wWiS#&uMGMeXO%&VVfZqrzrFn{`wtPoXCHeRhoS%g002ovPDHLkV1loy B<#qr7 literal 0 HcmV?d00001 diff --git a/data/images/butleft.png b/data/images/butleft.png new file mode 100644 index 0000000000000000000000000000000000000000..5f78be261348188faf8033b4fd064d6760b643f0 GIT binary patch literal 2619 zcmV-B3dHq^P)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^kl}SWF zRA@uZnfq_sXBEbqb%P9sSfw$cA)!qwXbiyy2%%MD0!?TWf?t42l+j%5*l`j&aeTkq zN$fg_n>x*<>Q!z3Q=ZT9`#Rq^PMXHPozp$z&S&e15%L zE;nnnTI)gp^vhmTysh|55mpQp;6(s=u~PYg+9SAT;kXCTplIKvwoK9BU&$5 zM;lANR4Q%M>vcM_>E<`@1g$;OO#!bCk?YxdRRn4850kap8{O_k-0(u<3N# z#0qVE<$dz^@891)6M#$pmwF~iSS>D0&&(7FRjbJVrwF|_DhNJ<4tVb4^SF(#exuR2 zrLQe$v$wa`CHW^$p4>YXfD*zMzt9J#lyG5YcD6Vh3Y9|Pum%6-HGm9&xKJ0o?*jn8 z*CAy97LIgqAqwG6Xg~l8&O$56WU_|$<3MPj-EO0S9o*-^g9isspFTaJkUn5S zN&H&LC#WjPQ*9DnT3+6WudK9)r9@(b*LcqW=zGTnfOEjvXpzxjd3m`SbfIRmxrv4D z?(TN!!sEw}k3?+LnVy~!rwj1gl2^q^dUEWm5%L6V7NvbB;wseHaetO^935T%;>o;4@r zlDE=PI{*NG9=Q46Mrd!TUJp8vZ$YQ+?d^^M5CuL^600FcokdljL`gnfDC}g4#XE`} zKv);l8FgrlPVqC|O2+}fgK)b*e-8-K$(_v2_4W1kC7ee9{-7kX_`9oqi)t(R+u2g7 zn=O~SJTn5L*SFDx(I^&c^mQ;MC-Sq>;6j5YuvUb9Y#&halZqSA$G9(tA;DBG*HO}U za+S(%zEZi%lmGiJKrz5ZqR|?<87GZ`AcDKFKja(`TWl_=@{@`iB!RQ2vg<3Nj}o=& z=d0Dbg=%$=XRch{^<6MAdpDAu>NCb>r-Ku#AG5Jo4mv-r0%Qo{+oHh~x>tI1t^msN_Jj+<0*`AGtAm)IH%`0MwHA z#IJcf$aK2mE_gl3QE6N#*aZ*5>A}th8!>t_(s2;4xD(a^p?qB+zF?;DqeNfKt_xJ% zcfmgcqCNtFGclkGc1CF2;H1XI7{TqJ z>+KEYzC(?<8^<;>Rp|SQFIBB+CZ~yGbn?33z@r-(H#;SJ6RZt@(8`?30fDZ8n~g!8 zyb#P;*D61DAo`tPiSc_vU{d9 zU?-`TKhM?Tq$u@Afrzp%bE)NTDgs+uhxtgf=^uEpgI-vs*gC zC71(ZJGIjYiP>g%78p^??;MV1T@FSx1|UAmgJNUE*5jHKE(9O|s<|C=x8he0zml7``e<|H37LH zAUKzeCCo$alDH1d=#IPfYYULwKLH5J80C&Yd0;&)xvqIYV+9cWFs^F^g1@JItmj`v zu{bBY|2uE)`st>{89$P3>^9yK5dOW%0@Y41TbHFrxfW@f!j9 zN(S&xfm+aE#h;dnXa`Vq$3Lm%{;MuUM7x;&fRYuky!^i)U_}8lP5Hl7u(SMM0G#zp9rd^=VZr(t-~{LwijM^9 dn&MBv_#e_o=nD6-hnN5W002ovPDHLkV1hbM>QDdx literal 0 HcmV?d00001 diff --git a/data/images/butright.png b/data/images/butright.png new file mode 100644 index 0000000000000000000000000000000000000000..28a63befe4c290d2054020f49a18ec4ba18a94f6 GIT binary patch literal 2853 zcmV+=3)=LFP)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^le@R3^ zRA@uhnaOWk*BQlSyKdYTofa;VERv#45j$zKDPR;`G)V(=(V{5OEDW@9B#{&~Pn1Mb z6sdW(HBYu>OV(sdmORRXJkQfV(?yqV7d^kLdznX?lI_S&ss|j1eDA*Z&iRIO@1?c` z0)gFGI<{=tlC^EyHuG1 zqN1W`Nl8hxw6wIMyu7@yqN1WG6bcnrRaFJ5tE<1Lsj1l;4u?Myc10qQclCFt{(fKQ zw|;BFL^@tvTpTYeD@%xQePv~3g9tZ@RHFzsiC|MS8f|u{t*vd2#bPZ&gFbWkgum+g zCmQ>XKELseiczHN73Bs+*bs&&1ncVRS`&#xYkhrvTSG%bdt+l`ds9MC?)@e!X6SI4>lcA~JgH*s+5mdw6bc zZv6Q1<3~@NIB|4gVPOKCJb7}`f$#J4^An8G*dsGDGl#99F~lQ=%nS_;4UiQlM7`2Q zxl*<&-xgd=BH|M8gGjsOr*_m_a&dmyQ z>Cm-V#+*KVdU|njaSBlgo}HZ?=Xqq1Y`UxvELE2&Et;Ne&>x7v0Y$z+B7Cy+4>cFP zm=In<^my^o($X==KzMn1`S`_)7w0cuzPzxqvU2jul`D%5`o73Hu4&A|g$ox>oIihl zPGV*ye3}4wg-~J$u^H*7>uGqhL8E&`VCk~C&Zn zNM5~qb?L^98>esHym{uyLN3!1W(_-ef#X4J9p0Cy?b~0-o1Ml?%%%; zE?QjBxn*5n*0^&B(tW4M5<&D=?4!UTzvTO;pIn<9;HC%E^!TU2qimY zMIx4XmI8u^8M4cJl6R9&fCFJU#+ULbYkql5GR=_35N`9zZ~?1k~o{=K3Y#t&}X-CZ>$0 zsasb@WWg%}k}eZA@{TT+#vDNj;YLhy%+$;a^Z<4$ zCu+1!oD|^m`JxgK`BI0n@WZ4CY?KG%;iQ^UA`>d5MIuQ=64|#{Z`n)5H2oMRJz`HUfE6kb@pv1@y6A{E{ zd_ONH1#@QjJrP zcBX%~M<7!W1bn76+ZY{|Y;=JG-r6}R7G7VuiFg(NV#>^7I&aiHsV~D$Q@kV`( zlJQ3WD*-6SuIPHAAwm2yVK(}>g4^i3Un3xt2}D<8%tQoP?sbHzZ&xOcw4Gf|lgb{W zBK^FGXBL1x@en$m8P5sgMa+Z}mB7{@K+3VXwZL`8F`i&>KhGgRF4ERnl4U})J@%MR za=q_3(Vi@B20REj&qWkz<%L#U3~?_40^#oCInD}gq|N)jCTXvrLJ4?3%VSF^YTZlH z1v;V6`|G`bt#@qj{Hl#^@F6dg@>e;wTD<=ve0Q@7C>8m4%~E2MX5f$Fy}G&CgaU%% zyfeAQ+++d@#P`FLUD+lQfbai7*q*W@+av6_6Uh3X%R) zc(I?`1HoVd`1A7O{y@OM7YNiDWFp|M>8}~jeL^5F&panDKffLX3ks6pyLpes@k~RW zz^#&x+UOVATL1C7C6iu8#bsqJMWv-Jg(W4;g~i291)!)1G=luX!c^GvW{e%red(~z z;ob%(K!VfBvpy;oJ`>&)p8e_YdH*a3)zoxX3KiAWUFB6(ouDif>ab`ptE_A2{m$zOj;^~4S@%TWvuC8C` ztBJ)xZ*^_$Dx%Szsz~HO2!zA?E5qULikg}(#0s6|2t}MkS@I@}DjySdN(+6Sv!Du2e7)c}s!tpp_`aNQLswBh+aG45)I?0M6zZ!9oPDWd` z?x}N3p-iN6MfP*ymo%sF>i*Sgqu*a+GeG1aOym`DL)w*9GScc7N+dnfo)RI_KH+1L zeMi{wN}`>qA57gVqORs`WRoR9Gv=#t4cTCjdQNqcoScxNoGr3{v-Zctv$21jKCf}T z*KrBRxo8?23-U$-`hu!ue%{_IzMqTm?}hh-H#HId00(((QC?4w zh<%cVkM;exBD-6Tu}frk$u-{A=kJN&8{Z1abp-qm0EE(|1Kmo{00000NkvXXu0mjf DQixtE literal 0 HcmV?d00001 diff --git a/data/images/butscenter.png b/data/images/butscenter.png new file mode 100644 index 0000000000000000000000000000000000000000..b507826c96c40e703cbfacd28b61c3627d2b9432 GIT binary patch literal 496 zcmVPx#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^cN=ZaP zR5(x7&{=N6Fc1ddpMwHQAPEUhOxPhH!XlQiscO~d9)WXIRUi8TSqb-O$12DVy+AE} zmUqug;pOys0=0tZ0srakO9qqi$YhNN=(-*f!!QJxrWp~-vIN++9TCTINDS9?<7Trd zv|6ng-EKD_ylem0#>v)OEx&FAwg7K_Doxm*gX)#{4%dYx}J zn>+}De7oJ|puujpBe%oha05;D`@NVPkHPx#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^mOG!jQ zRA@uZT3KvV=N0zYG*CyOX%i(OZ7Q`&B2|_8&_#+`wLG?cX(P3LiG;UVJ)X_ub!>z8 z9q$WX!3*|`7j}aeY;XYE81QZu!|cO&9iS8_U<~d#zwdv!GhP_NIH{#y;~8Ch&Uemt z&iT%{m*@3=@Y6i8#9Myx!pF;Nc`J{{^W}Ma`z|dmzWeyWosW1tA7Ae+Ti$`sK6?7_ z{-?_?o^SW^;=Nd2UjFti*Nr~mHH|HPuX+60JB>q+eo}K`_SfZ|H~v}PITcaXem%du z>t=0f+r;UDLl?*LTL&idn$8=t>$~;o)ooL0RmZ2&Dv#VwDL*umRMcQkEUcf#v*{=r zhad5pCl7 zv>_h6d<@Q&yrv8G)QThXF`4Bvis(eEP^vTq1PSzhe*U+1?b@~G@%Q(?#T+m`P#*-w z^TBw5KwuCGg$9oS0BXDiT>h}GZ+>Ta=go}r_Ur9MM~ALu)^=E8_g2}J(MdMOV1u8( zzkWS~xt~+R0|Ek887>x!4Z*>|Zw>(Xysc$o>F2e5bK|x_ULMwsQ`>EDMjb z1PVlkjXeA+&r`31$BEae;Zmv8D3i&I-zWmw(Z}9Rx;*JQ|O52?+@?%H?vSN~JP|g@u_SA|lLg18A9C z+6q+p#lgY52~|DDOZhGR)~M7XyC_6ua+lNYfJ5Uc=aDwl^GFvo9=#qO9&V0`iZaK< z#8_Slpk?AYdi|$0=Vug^-G+-$o98td`(}hvg=rUf%N?WKy@v5Vo3L1AkT&RfpbTq# zbab>iE-uazA0Kbs5J2<9v$q?rJosH@xA8#9iP5Q)iX(Hf@Hgl9M%<^~N8>SJDd&+k z)brH%l#~?Px&R9(@dnDyitaF`iM=J_p9z0{H?% z0CYh(25933s1W2m0%0SuPA7Gj|9G9d0FsiDtZ8X!w(RU|X8^$Y_v!{5lFHNi;jG$@ z1!Z(1F&>Qu?O_OlMnVq!j-L?_GzuO9fI0B02&@SJIPcpy^x!L~G<`YRvkpac0vc~b zV?i_-1wx@wAQF*Re2<@d8UR)y*CeJDh~_|SY%IwEOyJDS%#{d$=idU=_?wEZTkZL+ zeRI)iMKgS%m>7u$3&moSNFpIe$bet~kh~zt?12c-GKx)%_5f^Pm;0tJ04F!h=91)3o?E?v!%YR;@Vbx*1cx1eXyK&ec|8ZQqGwNen=C^*r`!?MB!1Y2I| zIEm3fp$7mSB$c*}8B)qx91^HLggyuW=z?BXfbj~o+KR6Tf71AN(FR#OHFG&N(8J^QKWwvziFI zGWG>dLOX$2t2&`xVg#Sl+~DD8up=cz;_UR%svbjZ>B(_xdi4nw1STg@r;I-0mR1VFl~UY}P1P$I zMQOkA5D=%K9(SGx2mk%E>NA#v;^QN>)bhg%DDb$EARyME6AOZ&6iIN#kB?Dc51E)ec=fCB_Otvh4t znu{&i3-RE*SJywktD@t^K#sQeF5Eqt5e3Ugb)tHS&I@ZL_qsrs=0_wsBszCVuxef7 zMr79C%t3jDIeGj3UfZ7`5@!kz4cZe+baNqUjfGSwnitryIntXpJlEXd$`IN+&;cyH zT*0hFhUhDnW(*)^J4nXQS1xyx>{1{!DsZRO6M0 zA0GJH{*TJ8oApIUujt|S=X6A3&a^m0Nd|p9$ZaxH(~8B6rK~h(BncPDDlp9OgcXkh z!YFe=A+Xm1Kre;__W^3XU)wkTB{V*5@$q3(W=;DYO?v69R22z1vQn{7PjR;!r2H~q zRtZEGokiyl8XfLjPHBh0z7YWWN4n9+Jh*v{_Yi&s_Yd-mj}46!9ldN%tvu$4OevU_ zhDKTVq7_NPU6Nrh!7rzPkZJ@FRlQ87cM^}Bp^6=G;rcfMK>t_^ci?OL=Y3(X`WZyz zE4ZI<6xKA?VbftvDQhLGN=4KjD@t`-+wdVWG&;y}1Vr~wbQ3~Axd0;-jsZenJpzFH zPqZVC;c?;C{5VJU@ zJ6Pno6DXh_3rwjb!xTLp2jKb-;jX<8J{xiH(!I|sI&bh#vvgLIUOcNwE1daO0j&3BKsg@(_kE~rKdSDvdPx#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^nzez+v zRA@uhS!q*S=M{!H&C;Y!r)~PhO*@_Gq|;?G)68_*nf!oGJJaS%X4)@d-vnY2Aod;1 zCd48@5(2S<*vxJgFO4zAb^xDT>d?%%)n<&kHfUwQWVm-P4U-nr#<@9t;b&px;H!b`7g zdLKFRsn`AcpV9CyXu{pUzwz8X%>BRqWLLJVqZt0+VN}invsR^y3^Nlnx`Cp?pnU{TG!H@7rU45Jo8_t z5=y{DA^;CJip64PQBhGaQ%p>ZNg|Oji;ayn#l^)vwD@?FRGMf`PRp`p7L?iwtDBtV zEyG*t-l;9^*pjjC)U}D4lS?&?6PCZUU-|SWx`o>>w9ozf@S_tE5#a{S0Rw1!e7spI zm6{V063mH-iEc|uN;1QQ-(d_Jmy}{jO3$)p6_nYERILt0+qko4aK>CSJU6EvUaV7( zEWgt@Wq++>;r8?G^Pe3K8F(5V251hL09ulhlP#&Ksm#*T)1PPiQ@EO6)#y;PpW3M%Sy&^fT~-av$y%p(ennDy@u?+7z}be_n1jv8$gpN-XIpb} za;&+zxht@|yu6j;$B#3^-!Og+<1jumGt&yPoDe62XvPzv)a?9~g6bA$b@#+h?dYKnd}k6_qa}D zSM&4p**we#8LS5~hz$0ClO7O}nv*DR@+!1;h3<^Ac4W~=m8_}$J@eabvmd`oQTcj_ z&w<0E01Z$jB_*q+rKPsAvNBtFdAY5kqGAoEP$-!3|M7|I7)x_(mT18{S5v!k`O)!Ek8=4@|oXQtEX+<)U*OG}Fr<3I>x zFdyq6DncU26-Wy?;z@!>A~G`47!#Lh&XQ~FmEDuKlmoK{_1M26D8YZITl{=)63{uq zk4@o84jiBXwzIQyqpPcHqr1C%qo=0_w&^nV9j;>>#)AyzBWfUmh#;zv7G#BJa1zKp z6c1D?BsWSq4p1DV5#mUrG(B%c-ZH+e9-OmNBs9$zH-6f=^yQ-o4$VXFkN`I3UI!=+ z{KSb9o4vign|*zKyA0ofjF1ST($v)CCIQEQ1SEw-hh&i#NN`jsoE^e^00HU@j3Vj` zVpFoMMfHPQ%At9ua(Jmi`%la3x`oeolMoVs3_t+hgl7Q^-~qh9zkhRJU|>sV_zu@V zgp+{GcqAYxI0nT4azc^dQQ!oS)F`p2Oy~qSfv~VJ^k>GH#0+bp79_L| zO+%D4%_?g?wOu_pZ&Qz5&+J^fbJSgCk;FU-v>B^9JPIHIP>>0i5C97e-y=#M5nvSy z4sj(k%L6VUly004u4=R^2hf|Lx#R=_0|WJeLBR%Tj@(w-F|niQn=z|KK6txfa{UEH z0-8jEVFP#y9s>y;37*KpBnDuZXEJm72)u9S-bbwy1!T1d=hvcA0I}*$Jb9Em6&an>n3g~dS|XToL_s#3m$+cTrKsk&J<*D z@IYe1t`vzcG{_Ivg^e6Qdo*$^S)q6AiBs1@GP^X-WaIKYz;g?Yj58HCjc->EEw0s` z*2}!G2o^&>f>MS}I2l9+l>%YM@ee@!J^=u^@vakNFcx!o)5dE&FOwWNuQb6_CO!22 zK=XTm2Z_MYaAQt&$3}VgrJbsQD}7!_7=#a}A15QcOTz&pytQ=QQnF@DVC)u?-&(>6 zh$=wCF}y`!C#;}E3W1~25NHOTOGfB<{4d?0!31=#buP_e{R)Hu3bH8{7S9A2(*6WDJuCwS1$ z{nq;?*L}#TQHhx-qc{?3>-BlQ@l@#eVNwLjY|=s;tgVz(1i1bhduN`dfN>@yxe^0JJYj z&0mqVoIyLirs$jX*S=?YnYGi0t<%F^&&S922DK070`1UN<-ipO^+4+SiIrFBVex~z zvcul+FxLZkQFMYiSJh3LpSdY-Ki8)oyY>s+yx5$c~P{~d|cDFRYBmX?w`?|(*Kf@_R%MGhqdXx>!7C>7#)au z_y2-+**_@65SJ;l$y!cR!p_>r`}vI*){nV0@A=Sl-;D)}A84!xNC1ULA8RfmxLFB} zj5TGHH#^F@E^L)|O?@b9JsVB^&X1q?-fh>y*zBRP-slPTaI65JyZ1qR?CPcb&>IQ+ zBUkIp_NM*d_1N^n)xw71ZSwdINoJV(oIiHVfBv0)pHlk=1Q?k4`x|Hz*n`ak8}i1C zeG0F;=3uUS9a<|OFmRXgYkYkW^C3fL8IwYf^-&^wXPnewPF4-f{jK@p=J)mm&IbgC zhMMRtr7;K=9Ly{b78LYk)F7a8`6*wA0~q zo@%_f?yT|W^nzpmN9sa$BC*&kiij|W!NS9tg~CK4lh8uK!c6;_&>3(7j|7V@0S}9m zn58-8wtVuq;>6`GlFL+O|6Fv-<*j4%(r=l;Cm>4Te42zDoz#^ie+!h`gX<;T7 zTNqg~PL>k|F@Q%DIdFJ9ASl=~ro}?30QZ=~vX49q3qph=_91dt98Mo#+NC0(PxG6M(BtzPbkR)27 zlQLK0GmC9>Q(@1k)@|a}jzDgb9L$Q|_vhrgb3+6;g`O7tzHR1{@9Pfoj_bhX<}m}4 z^A+nU1y%NxBBeb|R%6d7t9KAMM_x^joy<|79duIo*GfCinaPZ0o#&TG!_x$|lfY-u zrw_^E56YpXWAqZ@Wjb`eUKM#-0-Es;r`01LOeu#K&QT3MOWr)KJh{}T8eY2B!;=@97>K~gE{T0&B~L8M!{mQauskp_{jA5cOX{>wQm zvu9^_?wv2*_xUFJnU*px78Mo*LAa_a3cBFP3to~KXy89RLhJ?{Fx^y4JRu01_~C^F zW#v#n5SI2!dHHA099_L!Jsn-$=vC$A>D@eB?O!_EL6FZvuAYOw-Y%Kc`L9zsb$IXx zbyrI;*kF<*R!#;?0yQ{8;XJ8MFQK9$3iVI{963HdIF3{Yh7*G|hrYp36dzU$ zj~TvR^)G%k(|Nu%cGom3y!Alc$kH06EX@(RWj)d?^5>>|tCV`&% z#mjwyo+=>)=Vq|#K?Nv~<%o^-I`oVSvSbU|nu3CJFEag+pywYLNRbMXAbMguxB}!T z0aZ;H#wbF@yby`K`hXZT#|81K8riErbuAELoB+E4!oY!eb>I;k5Q;x!ImE=|1BGWo zBud9dl7FAn5NvaTNM$xiwlRw-hCIjMaz{5Z;-+ICS0#T!B5d`@D(fkCpKm55e~2Ld z?~_poDo7#)cYAW{Gmcj?J}w;JjAy~M*MoM?Xl=cIw>eSi_7s9vy#goiU_6af!4hb} zE_X#NhbWHb*adISW9=L8pEf}Sy9-7qZV$0hEKF>hpWocrm{S{&du}ys6maLzXMr%f zb-oOgyg5Jn-Mz*f!v7*f8Rg=4-{`4E3C%<@X1MjzR)X?P3-rIRZH>+h7_GOOC2gIrhl0I$BOko}W)?1ra)qktuF?+yiAh1?N+W;0Rm zjY1Tnh`csW2}&CeHQ ztO8@2Axa?TA@GOG4~Q@mMa%QEwIx1Mt^cV1gXo9SkJq|PyRhdly3{RuNu(B zKEUXo3`K0@ZuD;mY*24796!g(wSMaU@j`EnU3b_?jdGJrj9BnZme^PrnW}n8by4aRl_R<1`ODfJuXe)aR64En??yjHc9nP1 zcaTrLad0C^!v^6F?3CFQ=oAi=-W0VN8lNbqVkrmpc}4j4GqyAFGhGdgIh#4(ktPje zrK+W}rc!hA=$BV~s`yobZE#{RqMuN1t`|_FWFVloUXJ-QtwoX46kr2Bj1Dw4Y1aa&A)rg*^zNe z+Yu{OQC=t}FQ6u1)Tn#%!CnS^J;VJX$4d)yo4qvsBrxU|$q~mI2lXdGjW#|zvsV>q z>1oE5DwR5w%KKfyH3y}+pSlz~Os+%lWCzvQ%-ED262?(;xAo@rmP@fp$uyV=$m=!_&eL!${pH)WeMJ+%bE|*ra#eb!jAM+}h{KGwh%-(h`9;Xx zRg#uxaPhB>{EPml@+DTOR_UwZNo|vo#nVdfmGI+Uel=TXUU&KG^0k;1jg^5_U2{+K zFiTgn?Gwi*2@MI2!LiY?qOqAwp=>F>S^n+p?d;j?l@?1=A5&O!S#ztMYQu)m8x^AS!Oz_J4y*l+q6=&D)VL>`s@BSe`_vpp{(1SLtCtAc4-c< zap%gt`g z?mH-3tUVMye0dnPls_t%&yi;$;Q76ONdC9Z=A;aEek$*)m8w8(dF>E~rfnu38=fSi z>e;%M67Pz0t0Qvhf6^ZL>(c9zBER^5nOKa9AXvy^ulti{@C?0h z^DP|jJB=tME9WMHiKji)fNP0<_#;ceSwW=gZe zp2L>?+mR}}h=#i_uVY(y=u*+Yy=qLXLN(#SYL@%7qi@PS%Zc9LU}t3CGZsB8mR6bf zWb9zHadWDdyY-7J?>SytMfz4c-fP_Xh0nMvhMy14 z{wXfr&Lc7!#{w-xtDwszW;ej6W?kkS9Bf2x0_FMRl8xyfqw;`QVqwSVV7!T+Wg zpLd?$N`LEKG(a-YoVK5~yH>q!JeR47uGqauyLNd|t>xl=Fo^sE`4*iCuX(oZ=QQmP zDSh39nJ4?oc!Q6-?{bg4xp0MX4c_N`U1M@n@ZH!w$6Pt5!xdk68|PoOiaz!DEv*AB zkCR;1ah6iHUe@(<>*wv-qtcTzd%yf{louc4=Lkxg_^O@ge|x#G8#E_I&B`0{C&?_aX}ndv++spYN{KiBgw=VvQq%Yhzj zx8oxn^WJQS)t%a%7N<`SWas6Vqo!q^-!07@Ed@CtybDeymz2-ZBElx_lFkzFtjy{O}-tn^jOz(T?bqZxl$~_8l z#>tJ10N3IJcG{@uYC@173j_s+LD1zrIPOBw8vv$zmJlSK0YT)h$rfLfAc!bLRY6wY zXJNoJKwsZr_I|m|yHfxMnTfBAmx=eCC;|MD+|M6T%sK+8{8%d3u;)&zkEflcPuK%s zMwPWPoY+4V^^=qGQ*FZ4e*Pd0N#x*+M>=+4AP^WDEuVCEe*JSVLSXTV$Q>0G0exh25nwk(U9UThaT;nr zubX(TTbr3B1sa6ljl1AZQbF+Iz%jVfv0u|OLct1*NQ3SoaY(@WLOWa7g^`gFY~Qu}l2sF|n-}oUWN&Yek+EoD!4wMZdD}=3 zY$Vjq1cCZL?~a1TjrO<@!cnlOyW9MuL(8K3e{+1sFfw)$Ea!#K zsyFtH^Ynx$vNXo+Uge^@nF0>4=NyHzaZ5@{cr!J?rDAqu^MdYtofn%QJ}axP{=$?X zxwdMBA{*>q2zFHOzODozT2=yM+uOy%!^7zr7?48g3rb2hBQ-%ufB*RtG)7WlB7Hn| zD0H|m4MOy(wZf>@{LC$+I3!#4y%I9?tX%*5t`{gLIv=MdD%YM{VdMG{7E6feM z!}rAgzxhUVh=7D79CX2CS3Bj!<#xXN<}m5T_V#*B$Dy2pLb!^9qoax-Po{?Oo+MU; z+|Nkrd@Bl-8pW#G+Nh~r6lmbfm*_1)!d4e5sJ)|Oa%F{w9}fx$2w>;o8KidY3|U*V zh7idt>VHnBw2`5!>uZpm-UgVQoZRaIo>aBMsomcmZEkx%IT938Ta7TG?)y7`FE1|$ z0!50Ssn7?@Gr2bXt;O;vq_;WG^FMkDzFARG0f!G+@+NAqGC?1JY|+xv z+O{l~7Zf1Ej7oG>MKGXXU0vO>hKA%Etx^g&93FUkX7td@(F$@=_>WmdTFtokj*d#> zsM6FMCI>KbT(v9Phl{tbhdRaC@0dh|$PH6}Lp+pgCS1Om#H z3CfF%iYjkvI_uFn7ne>|W8qUPNv<*P60dNX$P_>af%z?p_x}BRQSZZ?9Tt#}-|Op4 zbia+$B7pW1S~)smAR{9`V<#!11Y-8NrA5B*8NH~ev83|6v+(Dprf4q~B1}OlTyO&g zy5*pP!+~rV!_ufP^f*%~43KT4aQX>G8o(y`a0GVm4}Y$&ugm9Xu=X2MQH&i~P+u&$ zxqQrpVTAH>R%at+YHU%Wzb0*VU5OtZ9mPb>r>2Mu>9s_pXiNJ(KOrKdXfo9VYS^N| zEGS3-?83rnc(mdQxw*LmCpTOZwT6|d9uj>#W~~I`xp)%ZhYD}s{`+`mWkQyjnK{=T zAOS)`#$|eXUm7Ci|L>WyGWyFVQ=rPF-{d?!1;%p3Qh-VAWV?2^ap5jCKwx#C@Q$DW zKO`l|ieTeQU(mZOx2KwMr~6djC~NM3DvQwP{Bn1Dos^#LJ$1jmxoHJ*4{Q^xci)LA zBq;cOvRGNQb~a`CbyHExHz1IYlN*V zce>4dgWX)c4f?5{)Ye4){lv?H*47Nro~p%@&unbgGb+t2EMyM1?rzUlR4b={OjjDc zoUM6rKg#;={G6?FTJ5OkUK(iK`&Xgr0OGGt&tftiJ+u&$0EmYgRtAz>n; z6)g;DcXt;QZCQCaCGpXNggH5JVqs$gZ4LhT@ng0wLKCyjevArOzP^D0gNTT?*%Fg- zJiUkrImkg+uO$V!2zalYK!+OaK6c!!F*G}y4x&;Hf|Hz*GPs-p#D#>6Oo=rm8V3!T zg_&7{f_!T`ekLBY6dZ9_vc(6oiR<#o>U4XPH7tXzopH~W@?RFm`b(SvmU&Spyp#M3H^ z9y*+UdU|^3^77Kg++!&b7+>)u90&v7s!*n-CBe81s`G+)Z=TDOhVi65PS3H&148N`a{8^ z$hO*0QP9z`cA0B~P?Uh3A0Ho6rMCcyiWW-D%Zo24p#N{K9vRf2wbGRqG;v~FZ;krU zyM-Tk-{UCWlW+M7A6Y}47B+HkB*l0@ezFpXdgBYJq+gj zvtsO{;Gez9S|Y+E^V-te>vQc^zw+|(2O$O_EuNb*PGIBajt93!N@u!b${)G_8_>xe{xA2vq`v5c3 z?(S|CZEa;89YXK}_xs!Pgy@m?+bJ%>)J{%Le{N1DY=E~`1-!`L&H*?A=#f25&8XTm zVkPhz*Q3o$qebR?$doZ|XaVCUCsM6^X|AmkW#p*-kf9-!59#Ua;GBwz3c-_%*|gldi*@{; zGc$~AY|2YNZ9=AY2YT+#c>Y^x!e&ju1f>H=_#YxVE)He8=Hf*V_usQKRES2>hX8b< z2(MQc+0E@OaPr~dVWlrFPEK-)il}KYlh8(oi9ToHglrUh6EeW*)|A3*Z0JW_=XvPA ze*dPYNVD6$k__4+#QLnde`y2(WFON6DC>*tqK1t4Bu+I;>p`s69Q zx$&BDlLPJtf1zPvvI@^QQ!iGd9{+X|t+VWX1aP%}?qG|7hX)^A&+G4+BEHPKjUmEh z6=op&42JBr_{IQ-i!A~#BLFl2WPo#tqlJa!`5%g@X=r@x>yslw2>}wmyIY$7ub@8g z)(_|`(F#6|=u=-`-?eK%r0k-i8FYR-3~K7?#hWAPDI=RiJ^2#e@xYH%ftw6|lJMBT z5O$smPGQq#;u$GNJ$yJwPinK%MV=P zH)sk+SJ!ixN!yD|kkzF&&w7tdH2{l1>E((i3knLLkdP31Mif-k!iEMSFgo>}?oKIc zTQ!+lHO~J&ICu~A@N;u>=(aC=su~Fi2|U1SLh=M>ZGAl{H8lc69E^)dv1D9wU^4wN zHC6ArBK^0Wihv+ELFSGEIO5RgX!x|#mlE}Kg2#`KD5ID2EQddE3{6ZZySwvoTXe?( zOU1#(Ev&C6G&eVY&{{wd-)Cph8|UMI4Fc1L5TU5pfNZdfCo$U0;&-P?fwo|P{;OL& zV28oNwMymRybu+m=%cAguCD05qaC74U{gML0 z392kHC+ELOOr|8Y5^J9L4)GqhRk_g&KIGNaRTXvhF!Ne;==0~#1yxlzKzhrnsuaK~ zaY{@;r|bOBUxQQd>Lf7fl$N4{^BGe9!T`oN#{r`$CNz0&Yte|hJ&luqz+L0>@bFBs zRO)lq!D79C`J$I<=aW6Tmz)U0#=v;`;stGTa`H1Xv$&ZV!;8zyLU28t{(_nsJOG8Q z=fC_P^0nlD)Wyj3IN+3!`$c;=ASvKPuJa9w&hOgYRzr8}si~-V!SHC-{f_eG%a=X? zrIRur(<0fEA8SrYPv>2@C3kBqST|ABTpALv_o; z0m4<8G=dUM%F2oXX^wdW(hxKIMKPAFu&s@9d3o8oM2S0{2}tFu*_toFJHJm)M;KHZ z$`(&r9xOEN?C9BV~`VF3=H% zZ2PJ(6S?PDQGofCZ@68%NOGco*GrB7r4ELjsS){V!jfjN7mQWli40jRsz)0Q&_M78 zwB)w$oU^c5mmetzzmlpdCa7RAp}oscPv>S37M}42k6MDfy}VTX{Qda?u1-~3aBuVw u4KPrmI8COwUFJs>wYBG!<>h?$6VP8NQ%2O4+Gg06}Wa&;p>29P1L>ijB&XvF zLHK0<4h$&cBNYVUsai`(si|2xx;eU9IXcnHOG(i?xj0%_+nGa<=X{oirKZMjO0o0h z6G_GJz$8V-R}{GPuOy=a$>Ukr8SauOgfryMQK)y3zI=&AGnf;O85Sv64lQgbYStRvL>2l!FBs4V#**LuyYUBi4YeDJU@OBHafA(o15Xz{rV* z=*i5(r6DU3sABwe{&_qCK{@dh;AxLNC<>xm4X?sQ<^!c0uo(VOGtP7)Bb>gGRz z=HRM(5GaBjXphcg-p8_fgP-&EJj$Y$SmFzm^Lt+F*y&$wUgmyinw#6)*qBx5mDDr- zs^y2a>^AJwy0N?T7rj0|{n@_86vSf?B#U+NvwP%3sqo==!rk{Ki(7HB*A4i$*R)fx zUU`!yZFcf?^?S~-(izdmJcY0b$%My!%#*ifYbzWmOz{jR74Ib3LPu+8*^RiqOVILls#}F7 zIuUVpBN~asoQSWCagkkYtwDFOUJT-r88gg>W0*v0GsfcHPY=0Z=#s;_7sW(B6i%)V zQ;g@A<9-#XNso}DJrZ-dBNV1D(;P1{2=TnT4sDg?P71137yC}|MXISp@WFeTJp6BF zZrmAhlsTE-Ts}V#ix$Y;{#I^9JRc`6HSnzS7Zna~uiZ1w{vOFs&pGZUnht-0RS=Z- zKd5_w3W0~X5~ugA2RWg&fgWhi}_x?n-!K= zqWGDmne?)k%7lkIOk0kF@yES5GAC(44$CDKqKtit#r` zX(pfC1IEOmc{AHu9HAr*`X_@S8(AAY8@wAd8w^K!cv&VA&IK15YizH++9*(Ol5FyA zVwR)cn zq)W+kDyiSJCWn8^{!0CYdE!Ap7)lX55N^pvok@j5Wl8NpRh_0(L_HNnJ)rqakb5_6 zJDoV)5uwdq&+bbR{}nG;A(1uU6fw<0K0>&U%{j#YZ=lyW4EVsmK12%j5@- z*B;Xp@hLTNo9o+_rKF~4m&=u_m&@+92~_PBXBD-*Y|%jl5xp2tVAW@pwTv74FKb(4 zPGhMUub5I**JCeeSFh|X#TWJj0|zKb-(^P)4F}X zeSba+HVXrbqVkUNe#R^1rlQA1B1$4k1EV9Od80ql`7_11XLz(wF5xNF-GL>1C%s*NxTZ&1Gn^Y22%8@@Tduk5rhw4ik zsB1Q7u@|c9?d$!FEluuQHuP2X>?gJ*`ZfE-+=$^2hRqR`)9TXtyMA^d7k(|goH6!s zAMV$8lJc9&QhS_ae3o~;o^1GWuXUD2=9H}Eeaj}-;N$S92*r29oT=iRnKb=NgKZlM zZl}%$tKO5RS($a2-Fqbq)%ybb*85?L*&}?}kC8gOuHSkFrGBb!PQdZAlb_kHRQRh( zsRmho*=FQ2<%-v;oT+Ij^e8(wKDaM_Chn5GF1{`*xXiPxV>lw%*)Z5JtlHy+PH z)!?5Gl?>!!z|SsT#%UuuFWAi24DaW(&>5N5&eE2*Q+z1I$zCPkVAsBKy>}e8 zmbHez?sGqlYtX>SD|f8>B&3+Kl=B{kaEgRdxXSaSzb{DGODLn6kH|cjWAVJYX}c|9 zToVEl;j>cu>~tzea_q|934h{S`MsF>cndi;o8GgQerQ!9R9eauMp9PvAx3PFD+XlVq`ueWx3x@43J_2tu#BX5K8q zg~P-?jZfZO$*wHXz@v6_)`7=ULIFZV%*XyUMki^njo;^YSI+4Oh3DO) zeJWOQrXIP|TGDdaNM;;m$Yg3{p!7`inpH={Cw}ZKdtb{gJR<(cC#vJ6aI86GJ^%aN zRHEh4cyv~BmY+Z8<)YC-UcJw@>DY=5vExBAiQDSr%iE}Jkyep0{i8;=quPZ{GOb3f zjA~&+`yIC(QFP*z>OjlKmW-+K7U#cdkb+}NCv9Gbl(#>okwRiiZO7h@ z=Y8j=E0jzAF040W!!2_jtoxO%s;!165_>P^q?W>_;di|O5&v5B;a z+|;Ag#14Dk!keAWUFzzE{_cLd_90JR?l&i|QF~n;iypKG`76Y#8@}`bY`0dIpH4Nt z6{8ZV6BBQ-Fw>5&O?jU#{KHODxmU^%A7l`;G~Q zeKHV4GA=LuLeq2pdxno%(#+)m{9qp+zqW;ggoHdkD%2_6iiSKbny*q|q9E&=K+LDt zp(;{qR?6jj1rcP{g=toHcF~C}>HR9v_L`F!4=6;qzsT^i=P4aV(!ZIt+k|nXws9SZ zcfharP{CFNTb7Ebkw1@omXAfZeaF4VHoe+qNlEwH&X)^%dwb7rQ0Jy~b4ev7Y|>cD zQ@Gf{;kYvSqzDA}gBZ3*$!And_1C*?NW}fmFU=HAgN#Pk?Xj`r?eSx4?sTP% ztu2$fxtfJN{bo0L!H2Z8%F@#Bm*pBUVebak8Ax!Ac+zo+Wg1o3$h)_XSI<$G9RL1l zW5Y-w)A{*B{Z`MzX5q`rOAhTC`Uo64Pl-TdI0CVmZi$RPJ9Bq#(x3eCgQd$z?Ewvq z`PN9f2~WBi>TGZA)Vr{uLF?-3s-Uh;Ls(cCJljwN8SBRH;_MXo&2QCv1lWZg9fluO zirwD6jab-AL8JZWzSyQFB_$Eq3UYF)_#Z|Y4o;VAF_YuTYiXro-N7iWu1*bm_D zi_E)^K5OVm?&^9WFyTgz#BUGHs1!hD}&)#0W0uG&Fdmt=KQr#~dBGWMpK7M?_5Ah_`Y= zd3kwOj*ga2P9%v#Sb-B(y;gj8a?04_?>D5tbE!gL_^_t~{S z+~<71Z_k~KjI2jPRje=oA3K<;y9KxNqmb)~3=IuUwVu_R>eSIp!KsA>MKiMkqH9_B z6)BB?ozd~u==bUA!#&3UpIM@O>jyy+P$0M=%BQ+mordV6`#Zb4@~W!aNT2-|Q+&F5 zdewS04h@+pDU{JNjOUB4<28;pjiiB}KlAx%;$UNk+6M_H)Hr|}gak5UMn;tK^7F%{ z6_u3CPIsm&3_Fm~(FCG|yVA|I(Y8?N zYl66Y5_WbK?R$PH@4LjoZ`m!>69yix53CihTi6IM)OVmHDlQc_Yg3yXVrAy!saR01VE zKRWl9TC8ntF^yKcLuT#jjYIpRseAfkXoiM{x;9;Mtuxx?!oF?{B@PV_Po2idgem^$K=eDnq)uy0f+B_|V+k91!w#c3e4oUteGEz`(kD%Uq3dkCPi^l=&>B z=ZfFCyoX1FKao(SRI_i(WafY2#9wCMw*X+>TO*v}U@rW1>ue1H> z67f*b)J%e2sj1Q1+uN_5qY7(lU9=6KQby_HKp)oDOfLWS5HnK|?BK+Q53crvF#{zN zU%&(Ckd_n@$*Mhy;^mOk5CV3n7b z7j6_>@zr?OmGeAHMab{!^M$W?ljmVxQgX7vjA~RLEV9oeJ}4-N=IZQwsRpR%3j|{9 zqfk$&M)8ROOiYZne7el=CzwF&U<^`F?NvA7fBjx6sjiM2PUZS1gWd?TQ=g=n-Ob5D z#b$%xE(tJ`puDqo0-)|C<>ftl?uIk)sJ?Dx3}4;QH}jIYBvK7OCrHYtBZb{aSL94g zO?AH5P*6s_H2i#P*yMf6zCD(e-`qro zw<&g0Q`1!g{CbsG^stxAvu&AlAu1-uTpD^vghM0fP*7GDIY8%QHyhzs4taZfTRAvv zb%)>=6c&PX=>rmnW}DwW0YYwJhO&1hA3uH!gB`6!aeeh@Kh9d%5;rg~IO@jd3ZJt} zDO60|*`%PLXxNZs#IAAQn_s}A=Kxm6W896UQ*W0Z9{v#?@Mgr~I2?nD${bA5Mh`LE z3|!jxZx@c4x%uH~b%0;*RX!2)b4=vG>~O8G^!F}+hPwd=+A%9gg1&Pko%eE+E1)#hpvff!4EWK~f&V%0 z=|>e-U~li=W2qoTg}fmcBjZ0w&()e=-1t}NH+ADY@|93l9#uXSM_-tZSnvXstX~|i z=i~g$4WomR)1%pLhIFB~K(aM~aeZ9d7 zu8H(J(*ebM>F0Oz3!{-j$oqs1D0}l;uGB*z7py=rpR>h;7#ZpuagPcrdu=$q;!RTlZzY1`-m95yCT^EXs;rb ztgm2xAG5LLG&Xul?=8ARyFV%!85x6HTSdX_0BgveCdS0ljlY#}&Osi*)$i8**<2?}) zO8@i64$Mm7F?9P$DA7~BH-E?Fs3SDn_%qx*dQSh(d67* zDO~5d>lQ&wObmd$vhs2O0npEo`)`cE1Ti+y($G9H#{OIPDhfylv@QhPz~u6B75sZ6 zf`pr!d(nA-7T9eHXqJM4LgV?ek2->)VPSMU0PXt5?{u1U;UU~#6ueeZA67y6id$P* zec0Kt0X)>W`NvIP|6_@i&Kb>6XD75fQ$1rnHoi{gAb{!T=XZUaeG4pq-RU_1#)hPz zi_eWq4&=ZKjGp}(8IGYmP&*PDnOr2QW&Ef>&1*r>WkjMpMM9c2L4b7!P%03Bc(!T> zGHivMIz~pbZf>OBe&OOMwL^)Xq;vb&_!(7rWTYelaqZvXU(8KK04}bQEj|juGdwyP zAmZ3xkVg^S3OifIA+m48hp|p;u5;bnnrlxIDJmJ$JD=3S2DD z-O2{G$B!A9ng0v!3LLe_&&^%cy+_Z@tv;3w=hCXukFT>F-$8qw{8FE5ep?QJ);Vnj zDdZ~i4+f2lB)Cwhm0M06qK70cOPnB`V6a+0lzWy6VI4Pcb>U=TO^eYCX2611x8}ns zL(Ok@rKN#yD)h(FJ^_rK3Q)xB=5*$zbit=j>idoBMC$y?`OVE41}*NN0B63g(jSTo zxHbi;B^DVOSyEA926W}-?hc}hnu;nXKR+1s7DOV*E(RFvo%4D>xAU5G3YXy+_#PN? zQE{u_r@F$UezF339l7g}_AqY_5yvCoj|Iq@7gAK5RqO`PB z2`NflJT>&Bx>Zs}23w^#F)|XbtgP(B<8AhvUhLo?fX4|53HRvyFN^_&d;a+}@ErIQ z*vo|VbcGVqTnxa`T_B;=5Xslqz8sYJtSTRkcD|SP_Vqb$43aKQBl0H(D|G6f`(Hl? z=KAZG)fiGNYR=ALwL64QK;URnkt_bg2S|V2M^9H57wZn7vzW%l=O!j5Cq0#)Ka(p@ zHImvh!><2W!c74hfxVNP8{fD%ioD24ZQ~feS49oiEK8ykt>DD!IE0cr1IdlCdZmO%*AFCkqAC zy5Ej+K>8lZH#ax`IyflK%X`=6a}MHK+Qo$jP%6EEKnnN*(7p515-kKGAS%C%{T4-# zxUpgO#%GV;SNu^N9Q|BKNT?M!IEP{T$M4@YS(MUpJgUmeqrlIF2`+mE`=QPzmX<~V z`^&<75z1D?(bAtKle4pInF96+9XET9K!N69RBCOe*-1%1E$k(H z_&~1;zxm7tsH_2OCD6dazYY(Bz--(fnpJxwkU7d0$-}XT-|?qbo8xNGCZnk1q)lDi z>Q}_>p{JV+Ffe1D^uMSZZ>2xSm(S9bzz!C)X#i{_m0!Q61anfy&Z>$8n?knwnwpyJ z>&xTF;Y}Df_n~W|+N}e4C!heft!bkcc=-5*xw#DJ{5bI)R5k_#cf-8Ni%S0nUV}jL MFIA+gB#qwv4-}y5iU0rr literal 0 HcmV?d00001 diff --git a/data/images/cero_c.png b/data/images/cero_c.png new file mode 100644 index 0000000000000000000000000000000000000000..b0248697ada8857ef63e18a210b1784de4558a89 GIT binary patch literal 7737 zcmWky1y~bp96v(3lm_V(>F$(98c78N=@OBU?gkkjE!|xLk`mG-Al)%1lG4rh@;uw_ z*mgVa|NinKHPsbyu_&-02*OoXdZ7)r+~6sWfd*b_J4J552Gd2!@B;*46FxkVp!6?f z5QL>+D<`L^Y2)nX{K3ZAg;rTkj@HH1*~-@89RztUWa?P!>THupoUfe7szwC-r|PUt zj6tg{8y!HDz|2O6NuUxzmpf0a)%93j9+h$+CjuodE+B?jiybElYYu&jE-x-PKO$=A zdfhwUex~jG_vl^2tR$l1IJ15ny%Pf`S&2_eAONRSmiqBpaQ~0K^({{6KrBWVhybJB zlJ3JT0}^!MCocY+z7xFzLh_u##(+9sW^{5t4Zp|#E1PD56cB>c>6Rd@iV;8rNq>ry zErO&KkODGOnRTEXRLE@D;_W7+$pM+M`2U`Q0x~bsypbT||LBO3auOg~!gmobAR95L zV*FKKP5m~AJ5P{}6AZ}%SD3$a-vrFbR32m@^q$^J?mwfytmv~Wxqy|Tor(7>?D!A6F5pL5;1F2iZ9408hN*VSZg5JDfSm!&EK&W+-17MH2iaR* zo^S&tc7~ZJ@q}Ci-Vt&?gczSh%JH%^e@0fWEzq5OGN~}>q|LC+UYfzLM8S|axL|2t zhc5CTJMHs<(5=j^o-MvD$}PGhW30@#((el{bT(MEhwN0y;RJAgING~ZUKzdobnWGm zT;0b4@kX+hxsBS@THz&x{2$XrMuSO|RSPTglBOtZNNvt-tN*yQJYG(sR!{kr%0j z@G|QXXI-fRKf~KdG{YXX9u2tyt(;oZ&9**TYzy*wPj)(c-14xGfdW66Ye(mO+}T=F zZ>d_NCCW;3MdbKY`1I?wkN>lhLf=e%fAPgl9TUM?oO0|JwL*08Y~vYa5x-h9&pQ+Q zvgDLxgL0*Et#ZYkcEPH>;>@CU`Bua0Ks=d#6&4c~MeF#nN0|tnd7b5AtYVUv5~8P7 zoMrZfl)0@hJia>>@26&Uya~usb1q)-YDZi>_2s(Ny>+}QK2^jqK&!`LL|eoeBNOix zc<(Gu#nr#~PfPA~kF;E&d6Id`dPqX^gn0h6LaYLQjBTIECgY}KpJQJ>Ga54;v+B#g zFZa{6Up5y#D-u%^Q|lic8Ousgp6KXiaL}{2}-_B05qvXqYoak~4#{Z+W17OU3Q<{poJC5zSjg8R1n;Y-;g{Mpa44Ea9%>=}?-(}GV(VP_|C+pkvmX~<~=S~nmVxGcC5 z^ebm;nhHJ2&dm=>-A_Qp z0Zd5ND3O6OfyT(!7oU9SzQ;+4F1|afo8Oa($!V4$mWdCl41#x6(%B5`ey*fDN2HD= zjM?IaYWn?|`H61++dR6*4~Hc*JXAkSD$XUsfMS9tMZjZXN$$hyi>nvOFIFplrBCMo57!Y-ODtrnp!{NJGr0b2=44AT*z2U8rDS2tC+H9gma;6%inoCzDX z`jHab%TKV~gf;;$#$LWcc6f6LOX=q}HC(mj4ACr-baz@uUJ225o?uwQ=l8N@bT1Pd zt^Zp8wsIe?co$lC*XtDB#6_KiK4@S6x#E!_2UeqO(H~tS)>$_6I_r1(R^LY>heVRg zv!0LcjnoeTP2xw-!(O3Ph<}S} zWOJO>DBsghsq$-Q{`As5@J-iHP*($z{SLMs7Ch8yjs>eFSd)m@}UrWn>G+T~aOAjq`ntpe!d|iJoRTWvbeUW_a__|Wv@%>&u$|TAyIs;zgZ1b;a zs!0i5?f9AJJBoPyG#z)D2Ob=_g1CCIU-~u}TwZu>ZJ%SVo>SwBF1W{dSFEE?(YRAt zQ*qhJrXQs%Way+{8^1Mf(HN1OnEAW%=|*vp2LB7cxS^NIvF@Pl!gkP9qV>^uOlDH1 zuOH{-lG$Qjqc_50Y}F3m`JjcsZGBSyJ{lp`CN^er^v&(4ZV^tX|4l!=TGZ6>uiIbo zyTmDt{?;$8=~c}p_RagB+8eyB&bKMEgvORn+P(gf+|NvBiAXHBAAfQ_?>#?VC0X`! zWw{+2Zk_jF*{^KVXfr*L-jkV^TMnO=GQL}yJ6Q6!>-5Muo>)>mM+*%eze_lc$CrB) zpB6tHh8wn%B`hf-vLWSqyM0qEH*Pu3oJD$~-evxs$NcrdHA6kZA~-1hevE$jAh#6y^=XpL|hg*>x9FlI2X1Ba$D0 zyJ7@Et;={R!;fSLASj4d>3-Of7rX~^X*O{QW`v}f6J>~cd1j$bxNFz8Tlcz)(s5KC zh8EGfi!isi_{i?ALrhFe2#uI~h3Q<4x!gb`A&&BRnjuWOiqMb#=U>L$bw$^G%0OT5oT!&q4dSP1B++H(ANlw&(Hhm+5NE6gX&E z;$ARALqqDFvT3`Ho1@{UWMnzR@Qu+7A=~Ud#WwHE!UFqkZ)rmDKxU_T2^Nlr@I-_|C6c6yq?=&?K3_3fLmf`Y=)B_bOEzF?rK z+4*s2CV_F!UCjUfdR3?L)$zP_HawP6NC`GQJslGp%LIjmhaWrpUsEa{)sIVB$jTz$ z-rS^SWT@89tJTksz8N;XlMV0bD%Y=eJ=z+i#;-7GhN%}P z9wWvPZC=N7GcyXXn_e!zbskPp(eymlqm=JAOv-hwtr^YD&8X5c1Q(O4T*|ZApZ-2W zHZwP;Q?9G5j5Vs9*$k~RtPf)>o!v>x%Hmwk;J1D9PB7yoZ^4frFSg)t8O{`ogOzqN z3W}qjt@(=aZ{b5pHgKH!JL%O0ah)YxR9Y}Qm$kYM;jY5 z3mXOo24S~91Yu!eIhw4D8(eLN$nFO#v2x*fxh*XeswteOhurGLgn}8kP>m~GMg0Ee z7z)6bx*-q{5QvD4?foM1Va-i+VrE9L&+H{Lp^=dhZOSl@_1M#R?>z6vP()l@^2*=C z!Rijm@{=!W z%)!%k?Uf#`%_cv0PN9H+00LYB+*txwoA_C)+mluzuWLCD{)wAKDp>OuHoC^+uc(}Mc zQc~Fv83{>WFgm^p=kbIh4HMMY-+#Q+{DE7$f7Zcn=;(n)g|Np@#A|-%MidP8lOX? z@oXusSg-SCk7p^v53JauVf5Nx5&=+D*#ff$%2GPDeF0A~oqStclb;{_{8a@RL-F_T zQjh%o{qgYeS6?+*kEVxiZCOU-MfCM4m^8b}A3dq9t;N8=_>3&vY=W1jh6dxNi2b?k zc6fT4^h>FFc5|V@9_-7jsl^Z}#>T|t)Yt2z>oX_Pv9V#1lapg$VaWn2m6ey9^QQF; zAPx@V-(&hv<_8Ocg`MEMxJN-kLLyM4{P%+P8Tq~qK9BQ?IJ?O=0&u93ii)g~(g2x< zO@qT3M&-&VT%`kSWrSEQ2HyL^K?%lN1=0R#jD(&t4kTtHk6nq8T&u(2iD!roLX zdUyzdG4cotV*vALFp90I;eH`6FH`wS)uQ@Md(`Vz_w}`|U@~&@=4vj$gaDpCo(V27 zv5eT*SQy>R^mJ`a&1XLAG0PV(P>a>lx(f;zi;9YP1q70wJ$n`t8EFpQ*U{F#*sUKw zlDfZ)Kk>1!V5qOJKQN2~BwFDMJl&a{g1aU#+S}QsCMC%?7>yRHrW_rv_c%B?6?K_? z?)wG?GPkfWbiU#pe|dR{gNeDmJ6~`3<_)J;9XR;j1GDX7BN`^n_5FsI80(Rc!(1nz z-^z0wG?XT%WfdA4nyS~W$zbIfFE^sORvN^?AU!n924PH-8yZr#{5?HAhWh&b2T^Bd z?nMO!hwI@qMLp}ZgNs(CtC7+!F5F_GqDnAIAty^UHJsMg)=OV=PtR1N%H-h`E*52X zcXwW4;frgA8plOJ*jA}damlOl%U)8`!)pZ%4gCDPJkPaGB-mD?<6;L5GDU2dssF8j z^22BJovsb@u zW~8Tcd!IR&w76mJ%vSdoz03eqik`2x-kj2q%5?c)RQvW(+*1*HIF3hs#&SZg2`3`O z)K3`}6Ca=AbC$X0+6-9N?00*`bM6j&Fg2Bo0w?S}!p6bD($bOgQuXQUHM{BrGhixEK*V5ZWyw6D^xh zTv(`peqVWu8?cjvgokg=R2owg<7JG7f%E+6?KNNR@I5Dbul}`a*J*RVl}gCy@E$vY zuw4t%ET8ruuD-sydN`e31I3#+Z?x++;PB9&KQ(c1adUw>S5{Vf=+cGv1U|whF}pt7 z13?Ogb1uII&H)94grNR$6BW)J<6-)50@#^?qa#OmPftQxT4Yod79?$D#k{e(simtM z(%2{{e!ldfiFhQl&S|xSN<>7&b1OlSk$m5P{ONeC9X|yKM-ND)rw@Al`t@c@XT0Q9 zgieuK!jcV$3fS1#g@_`J>@gS&_8tMKzW%FJ$7{X&QMy{u`<}?PwY5mO$n+!77jg1Weiv6X*KY#vU3e^E`cOClg*;fPhHn;7`Z*}qt3US}@zxlSl zD(?+?gso|0#HN>ZVEKcIiRt2BynhV%MfNvsWV~rOi1F-x5Eu^ct`B-vSN)exB`?-c zN-IPbh*wjvkj&K8<9@xw#KnDQZH)*)0%RqPj*d>t%p66h@%d~&TXi~+dw`lhF#rbU zcd;JMIQZqum-p|YBO+1_LSJZE%E_T99|1l*0RGk#yV%qVPFz$B^nlB>Lrsh5yBHGW z^E=I23C6*}@ymvvaH0D)r>rb0Ffg#qWgS`hD9t)6O|z<%nHB?i{EG+!6BYQRqO$UK zCFEdtcWY}f@iJWMCXmtV_Xv4>$Fc`A6fjlvaubA3W!OW)0I82rd-c)j=_w92cB1TI zU?7ruhTvY6WeW>3^v!01-l*~w%u-nyQ;&@p8w;zzeWyKHPtbWqElGt5z9g6t3yi5l*XYgfwqz6t){1nPddV0v0|y5#q^YkT4)*iw>Yj*Z;sw!yn5V+Q zmNAM}K8*#e2V|d-Ofk~(SCz7_UXegK9Uaslp(^QJIA~UD(8nmce=M`VAKMzdIrfnltCtKJKoKjnds7v3p1D1D;Y{_xcr^NL1^aRw@ zaUfOb>gp=V6vW5l`}q25>Fb}5USh>6Fg!BC#l;2UTG+F0W^4QGd~dP8Y1MC$0pD}4 zVfLHDJa0U~6>!hC_nTx*Z@qT`#qK!y}oY#Us94eXeJ;+8FcuF zNM3Fcg5NM7PUcX0`BL7=iBn0|t=R+v7q@paUMenL>W(akHYYb1DTvl=JWFC=WF&+& z3Z!=o9GoB7cPA{rW@mfe)|&kuNdp=GIknf; za~PkEdWixh2jFL9VX>GjPzKf8#>OUK*{R>z@0c=Gjrog&HwkEb5EQEr45nxSBFG%b z1wvWU1OPa>6E-zwUC7{j06FnD^G;0+?CdzL?t4LM%yJ+_u|0qOuaDB17Lb;QhbL9i zS2UUPb=1v`PuuB?v5WB2xei}3VB|pnUBH&s0S4yUyz1Rbe)gbEPEC33&hdbNQPbR< z#(3F@f?rco5&;T5qT28DIr5quzQoo9igBX@`KsTwqtnv21dwk)&jNk;I3j`bP1}I& zRFU#)GNH5mWmSlsg99FhOL+knj8{k~#s7B4^fI63HUeMrf)?cBUf|pDZ+hXwDdYe> zX~q%?t%E|VK7@*KPXpD9gNNbW`^&AMOdx3y)w=H)0Z&!^%frhXWZdLr-V=rk#wP52 z#{SR+udY7%oJ=UXh-T7aM)%TZ+5m6SPAe)a!vbUUJe}76_e)2^e7WT#88vku3ch&2 z;h~GIoNoE_;rY2DAV(aH6em^76BHB_LmeH4k!&d%F!pex%05C3@j#X=Ph{`2-7e50 zYn)dl3yO-mfph>^QwwB*=Fn}!zme&&B4cb!$;-!=02C911$NVpr_LRh%sxIo547i} zD0FS7#kjcIseVjC5(YZ!Isl`Bg9AGlVIZg-+a`ZIJE13pgt^mpAYw-Z1tGT`c4OBp z?tv=6M8aY8BP1k*C&{{enyvTV>6->amgvVJhDpZ3xH!DKv!?HGM7BTY^3KkVg{djc zM^UQNPZFb6d|(GWaM4gSz6f_^Wl_fqG&;<8gL@Bk4Gl@oZU4}!O}~!;m3~;9VvTHO z6Pb9+pX{IaZvsGkiEo&32p}=5a=1B%zH8U z{`=mbp~FPuB-7nnQK~=<2X_s$m6KE+0jUMv0CvDD(6%I%P{39oR%-(Z3=z@MJ)p9o zgm86SAOoGoSJTk=KE1HOMi#38E>+F*&Hg~Bm|W15|E*!OHw+dOB$r41f+A|9e>Q+ zH8X3@J!kK)_Whu(sf2?`feAqnj*7CpF1Yf7mjpU0c&F_Uy#p5vXJsQd2*M)#_d^+11I$-oYAzyce>c+v+{vC6T;bIg?e33{FyW z(j`Wx)s>A7CW>cfr^CQgjik$)C)Vl2S5QEq9QYiG{OMD046zO;b`<6u+9qB8r_h4P zs2{g$eg$uSwqE`oxv!s<+WvZ)T|0)>fsUP`ETAJ4j9ns2jsGjOzo&0)lUpVPlhGN% zL$9@>b3-s7L05qi5*+j$XzdV^_Y@X7)S;2t!TU7g0e4R}{RL9+d!!Ec`2W<NHj5uDukGzbGe`y7;sawj;fGy5D8m6vdEC(?(#_|=MNFY z{dGDFL7(G^!D&ws-lI<{Mn{D|H9Rrn+WU_BKyPWealbWI<}3q2Ywm#)_nbVn6v5)C z!H)O&Oou3TFR?y*Tt?f};L6lPpLZ7wPM!bNMj884l5uvR zKJ9$G)QNRxF8p4Wv8PKGPZrZE_^GQo+t+uptl=Y7RP5$F(=t?o9XfX5iOx^ByI|j* zNIK)*SfJ;0vbKg`pgbEuC$ykjh(xlCGGzFKPMRKeMc1i}LJ-YJI~Yl%L$4Muq|B!q zrAG@>raF;yeIy$3La{ksd;sEqcNgBO#FrFOqa!(uT`$*EEJE>KF&}H(%AGGGmgIBh zxN9ASWQ=g$_IQ~c?n11TTt9Ee4jGz2j{`4vU$<=af1DVJuZF7Wzham5QB>)FMQ-_U z{%Wk+3xyy=p#wu0#Y>jfg8G@Vp}L{woN_VkQ$|7j1q=}kP-!rXc8wa$3WO-_Gb5{z$WD;-H8ciwxx{Am#gRNthzs5tCDZwZ3%9nTBq?pgB4`x zE*IzN;S0qY%a-Rg=vL}P6cY-1WQdN0lBlQ^mggr=QP`2%UD{XfxHsc3CsS*tjvGu4 z?JDi0?jWCeVdI1ohxSL>vXW<#p^@2=dy!S9sl&;qqRIR9ct!a3)3(!b)16?3><#Sx z#PL5clU0+MlPTGG^h!$Mr7NXauv6HOUTn$B=K&RpFoEYAB^c8wWw6q0?fvJJ&uvS@ ziz7;Hi=FhOzXTc~KA;+Pt9NV3ebM<`ZMMe~DGrU{9H8O4u^xH0y9FE$uA9Qz#m3Ybxu>6q0t z_B0MNbTyjbY;bXParOR@;gS52pXoxGl6g+?HjUv% zhYhW7!;D3Z3Jqb#rnQRY+2u?>TgqFC@Qa!>6E(|ne%f|d9XAX%lr)l8ZOx%BRx~&^ z1X$QwlG--*R&*aGwj~BM2Yf_GqTxi$KPjU!rV4bcb0ref7hA~~%{r70=sio><*_v! z!yB6u*k~XeV(YQbex5m{WJ_w>+O*wdAxyZ0olfcwX_u z8{6xNuO${lngyGs`?zh4hGz`34OJY}o{Dm_R|vm#XkWcMIE`4(UdP(-BTeHO zFm?9H8|^v^Dx>6YvT(|h>vrTEv3^) zY_Q$4{cYnp^wm17=DzoBbR!RSGTPvq+PJTejkquyWZ^q{#;mjKXf?Lh1~%VEKKu|( zDa+v)IT)_}u^1ub>(2^XJ5%njnl9O3$?UnRap zHLyF*Xq6opq*esBG5cz~33=K1<6UPx(wluO80J=3!2Z(gfvJ`ukI`zq#Z7oNr4;dp zs0yM*(p2K0Io2ibEy@U|AK%lLlIlvzdYY`pY$k1Xf3I-mm^?`-P5qtvImy%OK5{!Q^9wMZ>`ovgQFwj(t2O?&h&2dgbyc|>n&!l-cB4+`n6sN z{+U@cX}v^94Yn`BkYE}!HZ#_@Dz~+l(iI;{cdt@z9ZkzM9bFFkktdN6XbevpW}BvG zs3s-#bYp*V>?=L#r)j^>KJwzi5ypXi%<5ZbaF+Mk+`YtDy`;twTkwqW`?`iUMdL|j zOU3hAHsd5iG4pxGt%;>cv(~WG#LvAI-#ev68r&>F2_qlXQ@ug^h23{kiMA(WG14Xz-?n-`o6B9w9FfuGvo@b&l82u&IiixwZKu9Ym%W$gt0c>T zt}KYrp_X|smc#N^tyZ%$nS*EZa?24j(kAyyb4N=-uRFXxpH3_(U807Cj@`$f$KuL8 zj!lmp3dafG&-qVERCHb16|s9)BsXR?#+*ZXpMO78K}y0Ccr~*>J35gzk(YXsn)uz( zzYww4u}@yP*w@uZ-9G3o!1wY@|MsBMYsri1s9+UWYtx@Li1oqly88V2c+qVld1B%N z3Ub=%-75jE#ecE$m9nk|1o<*SP;e*&T|a>9E(CdiV7g}xL1JkTMCz1a)~g6X`1vaG z&-A<(rZaq;lg<(SW@D#+Y(z30YBJ;AGyJyUrHf(GmR(?Lfb;9dcWWC@h7ZaMRB9a9AWkg3=HD+33LbvPEI+N zJRSZcHMZ^N-@ZDAK(Gfr+^!ncSgG7a;xiaOp_YhTe%o)wPe+du`s^-Hn*JT!o(vmR zP(x0K2z<=bMpw{*w22fRDofd;@@eVc%hKJ@(L=?hQJv=B_NZi7iRj6&3D8l_0&!50 zQA0z_c_SAOejm0R!OP3JT<-6#%fq`Pa9OSq_kC32o_LsHJ9~SRXoBhLo12^Fwe#P+ zkLiVkgnawsId zTve2mBI@eul(n>CzrEm|Z*nVAPvfO?c+s-VttE}9t7~Xb1%FFPAvwPGcU|wnNEh>X zO;%o7s%vb_Ze?Zlo=9OrI!&FKjfaO6KmKwx$jsH%6(w$>KuOKfvHah?eSMpUGlbMK zGBV`lH@8yFQqIoY$%P%#I1Q_0UcY&>l@~#s&>Kw}9T~ZLl$y+85Via^b@lGIh_0C# z4?TVVC#uA{Izc3>zrQ+9Qor9R$jg7Ck>*ZMPbZ+F;+leM5XSa1P{%4!`)uL|+AqN(edMpH-v9i*wr^9gL%s>-xsc#g%N%%ev7Yo9eRBHyDOR3N~abeQQK! zs;U|V5RoqKRS_8}C@45kXFqiolIwq>f(USNsfKFoCg}0;o1E9)#ZZY0J3QMSPG_K} zH#Id)$jzl`c=ehVZ=9HogCp9g)+W!Mf>PMwb8W4F`bC4oysW)F+mndU;$l|Q!`t&m z9S*`%b92hHcpX;!NT2N~GT=z&ykwD)kx<8$>zccmil!#~%NGhP(43v^P8qNnJ2~-Wia5b*YZD_Q(X)?N?=Ko# zFBaZ7thA=T>i=~7D-<`}C=GyiY#aG=U0u>+EE1?H;MP+!>%V8l#uTsmV(7@QUDvw8 z%95IkiqMLtKEUl`$OV}HWab6o1t%pD1;AQbTDsML)sL?Vi;9v%nInpdil_k17Va1r z7_DcMYF}TrWq__qP~&PzT{D*HmrpL1lt#_&x4}J{C&l`DdhiGdLx;AShdYwrBg#8x`}<1(X3gHZv@AD! zr;q%8^NEm{xbR3(x-Flz*nmJ^Pw&^|Ez-CBiWYa5X8ap#iqCm@Aq@?}0qanCd3jQ5 z>gk`_u^N{RMF_A}DiE=6hCKfBXL$FT%#`5d(eM2lz&I5JJ( z6`hBN2PAPeE;r}UQ1ywE1S?b6kzQP!vT;#^mux!uOck3(Dl48rY41QtV=A4Kho=Y* z5AW%br}qAZ1Z8Qm1l=yKLS%fFDD(644?G*F$d4aC?&?W(oY{W^-FWJvCUXcz>Gw>ei^HN8LYXbrIKxN^?K9`C|#d9ueOoV z;C60Mg~FEu`;| zk^J)VkKn{LZOpZU%v4A zp4l;LW(|Orrb`D&_4fAuqY11`e^+Yf&B0$8RqQIT7zw9g2T$NJmcJAYuGAH+a3&XL zFr~6TkwRW$V=5fZ3=Tz1O#ENAW=&0v_t}I}y0Bx$VQAoanc2kBlK)gYv!v zB@0(im(|k3eGXU8D=ywy?1X}s-`dXCSjRjSO;}&IM8%=#NnlcIm&As?z~MDkg9M|w z(qrJxGd9d|Zox}Av z{c75hGHVu;Eq?e7IksQU%!~&3m(}&j7B;oSRr7&^FlAU+SW zMN(3d^U0=4X<3=i<+7Kk{}r#>@8Jo7l6?zcB4A4=ooF<1adCJlq<2~#K#3=&r+WYe zlr=Q05jW@F64WdHrz1#Ce#?@)= z!|={Tfhbr%*s)xn!`|LLOVkZDv{UBw>%D_{Bz!u0`gcJ5K^K>om#u7UCgEA_uF5SZ! z5=5x@2if1RMn7(xi8mb_kU>XzbaNfjztPl&4N?n`Djgjilt)PP^z>DRoXC@Y64dI< zgcH~}a@G`yf|3&LDe$%RpP4!e zIy;AlHUn{Vt;cXveS4P~e)c z&UPlOtgUtQ^yD=)p8)fum68hVXwcBm`0wcxxJIU;o0|Zr&x4;c4; zRJ|pRSH+Tk7od|JAm(*i314Zpcy6a)*k z{_Vnwp^?tcFj6L-V&IzEmsE)Mn61gWd2U_392!N+dpu9h?7OgU0fp^DVQf*3ZxoP^YTGet1b_bsJwJcK^t7I;s_NCsWxJB6 zr*LWM08A5NsIj&-}n3)spJ5H7q)ex3Uk*3{?8(Z7w1=v@Z#U8ec)9V14O0fgbW{p2BHg}lm2 z9!{KT!H?Rkg66Nix$H9FG#rRqztGO$vF$0+0XsngY*gSBAnOj>2uMmw-eiBdUwYJG zUT+LE0t;B1yrSaz={0ZWh_CSU_jiHcL745hKHb(K3ftVYLX3Ai2=8xQ+=pl|6M}3G zVlvzwBvarT)r$v)oFuY&cp31Cl@(1nIb?uj@C{&1Dz|CZ+eShf8ZA>(D!BxLQ}7f2wTsAzgk z4L@j@hJyoVNl6JKGxN!AQSRi-i~^VggoRVyzefSGr2vBwlarJG6O-%h+*;2A&^{(1 zp=6MPbai#@oSbY=e~*B8yp!MTb7~`xQa1Agi>Fn_$cTJQ`a$CR-4+iLNZc%3TnDbd zfn&@yI?(``zuVOc%5QDW0;(H(w{P~)wSPXju<)Z;r+|##3f-nQ9VGIkfdOTJ?SH!w z5g`RZ5hTo`*3&1)$H$yz?O6bP_<)t$Iex)IjhYq1RsUeUU*5B{>?g9*Yr217q5S_dG%kN-cAJYYFUy|gR^8#0=pDNO_ovknh$^zV9 z5_Al}^UZnfkyI{j z!2}uesc`1UA3sz9i$Bb~W|Ef9-JL3WuB{D_v(Zax)??1=yfaS6&cT5ZCJWTkQjo%> z=>;(Qza7Z9;|mL_fXKi{Q;(*u5rK!Tr<(i%0_1{rc=Ye)9pE)J2_P1E{+a7E^;#zW zJ^s>nmkBsk7tkGYF?UuFoKuGs^z})=4glLEsI}7aTbAEWPE8qobEX4P&9Gem(^Ju| zh59$Zhp;CmCYC^uVq{`E9u+^*e(^$GSC?Q+>XsAKjDef`)9|pm=i$;|R~VK@nDE(l zK0?Jq`lbJ|Lg3#}nty2)0x1EE=9Grt10_LEwvr8ATI`JH-RudAh}1f-$-dww1u_XZ z0^rhBilbkatW%&EpPr7<0kSvnZmWrW1&PZgw|@%ax~0mjp4P#V>)#cEjJC7C&j4nP zy}j2teutt!q(=Yc4{PhKtwr_>`0iG8d%M(f7PW+ToJu0Ig&@WCpjKd4Y~UF~enCO{ ze=hV*O-(oTWT`{Fsb+zL46zdLfO*f9!m^|SGH@t`wPCPA6PC(ZH7BRaz%dpg%n2~B zXlUR7@F8w5|M?-%7dbC45ny%y@IA|Y;3*D*(4V>LP>_!RPdr3RVn2RNj*7x$;^Bz} zph`$fiyYeOvZ)2f16|(&bh5enyC$!sBw#HJ8W{W&J)r1y_4O9jh9E8aUvH%Xkb*1) zW-~x^fGioHq-v?$TVCI9sQ^HM7q7M79wx@bU?YAH%KR5}-^yvypnh?*$`c|(`)3iv zIp)gNlc=ZCfiHq)Cno5Cuq1#y1z-q}Qt(hwS(zGiw?VV+F6MD_ap7sy=3D=70Whg! z`5?|`dw1PcO--}^4ZJ`lnCR)BM96WHM01)p>m`Aq)2QubWm!>CM1DT~$?0jeA*Wpi z35iP-x?({*pfz|H@v_pOvMx+EugVFrvS`lxqA_cZhoaLQuX465mo0O|Mh^zU^(+4L zzqg1Rr^dyR&QP@Z_5g9YaBPdEZ!Ua4qKG*R+k8D70s{kErgrsw{ro=sbHlu@herno r2S9lF1Mj>=!DzA6>T}wB?*!2kFla1>pe2JRJCKTkrhJ90`MduCyxldP literal 0 HcmV?d00001 diff --git a/data/images/cero_z.png b/data/images/cero_z.png new file mode 100644 index 0000000000000000000000000000000000000000..6b5a48cd56a06a6db4d031cbd0c9d684c7a0b786 GIT binary patch literal 6989 zcmWld1ymGm6o!Y8?hZk^8$>~nlJ4$Cxy2=LMTY!m8whN9vo1eWpv#j2p#|54hN-Y zl0XoevWlQWg9ganndtCOXT{d)-VTFz3p(ojDn624x)6qgT&CCWRg z5u#A3iATW*;uu({QE}wLsdJYIRl9K|B@xMoa>5b5e1Ux?RAs}6L|a7OrOx{joF5+f z<8I40-)_F``sdhV!@}GBii@oJ3FIymjAR*J)t4}gQgKS$&EUblfvsH*(LgjhX9x$S z-h$fgfff$B@fQ+erRhTMfZ)7l&{3c+#f&bl=V4FSN8)J)aIjBsUG8zOHEko6m= zVnQoY64K#<2rT9M1fWHBh)Y)6QUs>su~~X|I&zM%zo5~^h9H3w)40*QSK}XL0j(rQ;%$%^<=O&NHB-T zJo-~aYa{fW57$wab=aZ}P|o49_J#Am*huEawk$2}?d~qh^@;17{?PV&wCXYL(tfc2 z&tK^N`f9Udn=X*YFi;xtX0vDXQlaqqL_F#zv(=w5()Ug1PxllvG<~vWEjla&JF0jt zU*4sEzThdOi4c!x?x&xAve@2WyF+-p@e-=BeGBIs$6jJ+j__BW5l6?pYx^34&Rd-wcESPyGy=HeXfs|WhUxUaHGD>r1ryBj&u)ak8cm@eJYQbW`4TbT1l=3 z?#mcG@ygsrwQAL{5`4Z7=>lWHM6&XQm3c`sWY)yi*EZD$?%#3Ok|>o@Cbg$W4y6xL z4iGLqF)%|3g9pQ{m`F27kV&jaJxQul6^ck_qDTidxL$D|r|zd=r#Wfrur#uKB#irk zmL!+NkVMYHsZm;1RJLA*u6dz3q7hSSr0!QGrOB(lQ;Is9T&`J`rE;uJu5MNOrX;M) zs>De{q`+VIAp%LaSD{x~qChpL)_A9FfC}B5wBC!2+77ck^h4mwK8D({rH>vgt*H+b ztx>{drMUtUymGwS^=cQ1mLkYIsV+B}?n}Tv}EM#mnndo`xu{D-7Houpx+tn-5J#B1r z4AB$NE!5G}Gpv`Y%&MfHZ>?-C#w~79N>D1#p110)IcpqlENvpK*;_Ek_3Vz}iszuAKXoi{X~f^i@_yeMZko z$x8Jp|EbMs*y`6&zOT&Ly1Z_ay+ab4s(Vu+=wFk#>^3U=l_it|ts3@eIn6oav?~{C znhHJ3u1$Xvzy15x_3O^t9idn2JnOo~qp!M}hMGo{d!4e4LpCG=XrC;ee4eJDVi-M~ z6+%RySfD=q-Hp#j>dr4Bf-CR;)-9cgea>kSBNU4XstnreuB5ge`W0JAeZ8ML9ye}- z6{6yQFh7ZG`qMP3*B^s1BrHTbROE|uxDMGAcgjo8sZ|NLjd!>2lHaXoSaB;0RI|&y zWO-Z0VJo!!>O0?ekpT`%-O)LnEFD>U`R4*0ELHrD_8lAdCl_JcS=;D4zQn1VLx#@Y zx#K;TA;mZFg67>r(PKr!ImJH}z9?b9LaB5v z!=mUD|0}NTr8iwaZz0=W%O}Rt*fs@Bg|!U9Y@&1zDhD26!FKN8__$aX@iJ<~ghs0) ztDlx0BNgvM>K^+YqnbD=laPn)>SHUO>9V6WiWePd=rJv@AlF&F*S72&i})dsT%OH3 zb~0N3VHlF;v#!)ZJ(>y$#JGe@hqD7Y94oB`sLXQbE z%7d+$t?5-Q26io{KJ5*@me+^m*{{aeF5A7&h@R%>vIT_K+An;ZuKTaAHi*{zT^S$7 zM_QLW8BZ(Ql-rCiMNh<*B-X;_MD!n57k{q?*mim5TuiM>Un7MCPdvt5#b8T3i%E+a z3B?RO&VKz?Kww+M_2KZoSYpCrf+3suG4FAtikOJg|7PxZVSFleDmUdkC85*dW8uS5 z*D-1J%0SNmWyi1=FSpU9*4;_B=c*^g@B9sH<=u}|0ZdQU|J7cpPZr-LkR~KNAtIz+ z+?(^Vul&PKa~U;72=bwaAXqR2{r3cphY<7ufa#G51PP`>5V2FdalaG<;dsfu6Vvco z-qrI~(6Cx~8e26*LL%WWhT*8<;MhjW!|6M$<>6h=V?H`ZN!ejGp3bril*ndGYP;AN zh*xR_%Qr;H+u$M+uO6w@prN5e!j5ZR-;F-_1*Eoc($bh*`E_z`$U5>|tX>H1-=F%8 zyCwTtNJ>hk3j6-m*Q;#g=j6m*Uti~W_3Bk*9!l#PR{0!SJPslpS_pg)l_*0(w{3$s zf#i?{4+K+SNO&Bv;6Vw3GR8uS-l=VCvLsP4M-T70LNJM{F-rv5p*>e70yMBK+Vkt0 zo6{m=kU;rUBsCVp@yK=mUF_Rozj%9}^X(hKL_&EvYhGU7=J9bu_=o-`Bwj48a9mKJIr9y}u>qh_~#EXR$Gwa>-A*QcpM z-sk!x{PrYpuMOo2<42O&%?%AH6dCZHHaZle`g`*7Xs{@SQlZp@1c`*$URqPp73-~a8-&Q8X#VXfJ-4}uhx zTC6YLew2x4V`14YQO!?36!5!sr(t7Luoo=RDo;yFl8hJfxnv3s3POPi`&^p5e@`DR zMeFD1C-CvcS&)gHJvuNj@YiY!FQY=LXuHvb%g%sHchEDuiRnW5(mC6-#6++*>3B9) z*8G?lY&aDh#K)VR7`owls|g-HzC^T;px!WSD+vh%+4GAD5l?s=Qc~ugiHQjtE@9y; zI`500ine@Y#lEyspQ&V}q@;Lwc;fSz;^`9N<1=q)XlP2*N?(6C(m)k8FvxTdc(}cq zzJb9ZpunPt*lA?RFp#9ArQcMhWM(SFf77e{937oB0G7_&q*poJakSjPYB`>X3f*jl zy_lSw-2C<%EDd`!jTc!{Q&Xi>W9&0NBqSuHqN)m4zl1?dOl-4iN(&XVNaf>tp02_{ zvZtl$#m*169~fIY@6XZ6$jNh6nEnhiewEqLDknTI`iy{#^+~T13Ca`+=t$ersnoJx zs(a?sP8mccvr}(5)>EXIQS;$gi-3^Obg{;C?C0`{2PCSdhF7GNg$CU$bUuchpSxZj zOd-U@#X+#1o*qlL^73+*>r+Fh%lCIX<8bn@g$mz$3{=!O|6_N-Z%IMH!PF@5iE{Mf z;^H|PEE#9^Yu^d|{rwMSOYtF-v+aHvd3glL{a{jTd*=8G+|ZtXc5V(1YHMrT+}aAf zz4d{dkxY2f3O2xx9FS^U_v9=rE#V+C zi$N0!1{^5^iUF=&*i!+19esEH>qf9K7+!)d~xL0E}x@${aR;vS@A?`UBgRB2`e%(5`xr=6at%? znr6gVlF&8+o`lWJ&9kzDGBWge1A~#VJ$M|$GCv&8ZynAQLoj8L2Leb%TRW`X_Zl9$ z{d*EMIjK^76^cO$Z)|KF+c#gSpEV^Mpn*lg1@mb)I!9Rh{vp4$^-Zhi@A0-aA$~qS zE-EV6@6M+VcLK+yx)9rj^wZN*3@j{54-bBHG_+>tE%6Aep;+qp&#S8j@daa+=D*k5 zQDJ1!q5I=mw6c_f?%`EcRft_BB}`gcTJdx#?D{_o%BAv6c_D~|n0PQK2wt{%&X!)* zsLd-57Z+DaZt=tePyeQHutlD)k>o$TpiZE#3P$TS&{2dsTs0iO7K&>n}Ur%KS} z+1Xa3!-{qN(#^pXtx>B-G*MK@+}vEIkhd$Z@Jlkx_h2QQ%k@E2R16GAPMr_@1ZdCD z(9vD?eh`M|p+G3;=)tY6t(V5RDxw@Iy^c*_+c{lpML|JR zzzs@JGY2{fuFo>R4d|qww&oijw3gr9*$JkV{vujF*XVtwO)rh&z(vC4@k>WTORM9O zx&akNg%Tbf?(F*7DSgzkUcGr5Pe)RpSff;fiH)tVLbv|U&6#=e!sGWL%lht(jTb9T zPSP408ujcqKb*SYOm+sM|D2!qEH~I?-FF?+H0VWN9WR*A6e-^PU2$6Blb)i4Lkfmd zRaGSs^7=!*BDl1)R8m#t*xLTh%0+tpj-k{hd#xw|_i6AjfC5JRU(5nhmt)hL_gYRt zz#r5ZuJxi{1DS61I0;&^_dv5TwlLt};BfZzlm^;`hmXHvaRXAd*y6_c_xHxrE!@GC z&&RWV;y;&{eOYfj3uZ6=!-3HOE3mb*s|7ueLC!zQ>}?a_>gvknb7^hASOX^!h85Cn zV*S#<+w}EA-pIs6jOXw5_wsa+G!Fb3m&Vl#^~Rn4&);}d5Da&G_P;%3EYn~)U2T~u z#h6JqVh^2}Fm`Rp1Y-QJQdLx9-Jc;N&nzsYRX9G6XCm~w1tD!cFSy8~KV z5CkO0R?FNcAIi(m*EKLuh_5IsGfUwxeC>U1(HO$R%X@fq^y6#5V;bGk^) z&AmcEKoBq=_{`7T>3v}d9@WyyDuIrbm6a49|3VJ?ED7RcUrbI+oZQ$jE;DSDBImcy z(W|sHGNP0{zr8yCwcK#b>a^v7aPu?6iSGU5GVUG`Y2oQ(i_fKNMNYnxXq;~TaHtI{Qy>&JL4n531(sS_xE!u*6H~neBoU_+v=W~NhsH@cAQBtZgHgtj;o`l z)}x*K>({T8qj?ae`3+b~3Ne(ElLLWT=|7q)=MH$h*ZSI)fBT$}Fr-jEMeYN|pmbMq zkf6H8XJpKD)k@3Fg1voKBy!2a{Us;C0Spdf(6w@pAL(s z7~ZXd8#?YfeBv%F4>K zv$Nl@avF+l>z8u0%4==sSO7oFl=eL`U@ST|(Sl_>K0Y>koah}p$rq}%UzWIjYJbAC z9mBu7xlv(2fj3Tm80_!=CjlO<4D%gld z>IK`x&!+VzFN|H6^(8(WOwM)y7~4ELLetjPCW)3Ro{nB~44CiT1@`B6_cvF&+Nef{ z4UeaFjUxp5@Zkdh9LX3;;mz%BctDaQ7)Z^{%`!rcj*eVp(I9*!Wo6=`q7abELczFv zr;@|R50`|fK`;Ptxg8ypQ&UqolDL2u8X6k@DFG;f$fFH<*!@yD*On?_1033rhZ_ajJ19Ag2@J)}sth{_`aWUL;-5Ys$ zco>2K9o_^5BqJjOK?KCa=2u5^f3B|wK@F*BX@vrZ0u6+|wY7zUh2=j#_P%MQ)^dz& zcW+Pj#W)fM39P!~7L6$C8PFE5n?KZLWo7?#9OQKqbV7JUgqXNEd@`GEkj+dHH6tT3 zt5yY!DN<>S%ErcKvB8cQNQbJrIs$+yP^Z?DRL=$7Q9!GU$;qKPt~SF3cf**~i%jls z&aCb2-+@8|vI$Trw5LZLAh`WT2gTqQ3JEo}=}wBJu0VvTV&xaW2TTAc$tWuip6`vA z@@LdKtne2U6j0I8A&QBKf$My#uI2>1==^6>>{CdH0HNPAG1#z0PhSN7RJE~4g>fh4 zV9X2Yg(^cpHDSQl!8A}l7rEZgP3;^gE6wJ%B_i4p_@w6FvC9&`%OkCM_-F%uK2`1p7eE)pC(ydXeiX5g+vBO|?l zQ#Maezqsv>n*ytP9q=f0badnlK;+Y>PdRmUcmUJIU0r$j?H6Ho3su5)bQ(+qCDqj_ z<2Od_KDj`ufJG00mAag+3b5%nVgOytJd{yT=mVhu4G_7#ZD!Ew zfytkN>Cs971|U#~-GI=!%m*;~`uao*)nvE2LB4Ux$k190zJNZY<>MnT{O;bJV(cGr zveINeTcR2Zh`Llmg^A$L-@l>7#f-q8Ys?3+05WXq_Tb~CSxzyxj?BnIdB`BB<^0ouI6`V5!3{$0g0l0Dk7zk&r`R;$!PgwJjc^^zt16V&@ zst*H0?XRVJ#xU#`<6!c<=*1SX5EFwlH#a{#J|6k=#~BwD6%_*=-Q2;Ua<_+_C~9`n ziYKkv{ZP$uy=|%VjP}i&3=rxh`)+H#y1Ke}P=~qQCMICE1j8UEQZQd}N5^`p*~5xc z=NVY{=#L+H{bq3k;LH8dG+>7Wz;k6buYWD=%*Hlb4CDRS-rg1(vvlhP5#e@N=Ia|6 zklVu=B$mL&#*XcqDORTEELSU~!?vl_DX3Z}4xz`IC{YJMz#=^qFIxx>ZO8d|lQO_o? ubq0K;q@)awiP_&9N%6b5xHx{Yf>!oFr0b?@{{{b7K(dlb@2bR2g8m0?UQcBJ literal 0 HcmV?d00001 diff --git a/data/images/classiccontroller.png b/data/images/classiccontroller.png new file mode 100644 index 0000000000000000000000000000000000000000..92f81dfe055029e48691c30efa83d1d6fc3f2e98 GIT binary patch literal 4814 zcmV;<5;5(GP)KLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000O1Nklnz)VQ8P7Ej zzB3(MW8!NYM zJ>Um6f%HDk=@9S^zyKcXaEunOGh zKsWGT;7`D+Ym6Ge0y3^=j{~FX*>&LWKo)o}@Eu?fSO;zZQ@~YVt^&YEfeS#b>zQ5( za69lV;B&y?B7c9s3-A%(m|A^+KLCGIbg2P`fe0|~Qo!dGD3p?JD1gJB_kBwJd>!~L z@FS)0?Zm5K`x(AR@cIJqY>5E})KyGAp{{Zz2z-2-Htz2z)L0C^a9s_9zfc@N?p%+z4TXspSaBP4HGFP>2#V*#%r1U6nLgY z*T)oC+ggPJ3vk5e;mbuu?mWq6vuK*;{5%M--QC>`4Gpohw8YJuH*qC70pMrq{uf2M zpDHo*hi$;4z%PNiJeFG)&CSh>jEoQn1PF)2tgf!^E9h)COCS(nXlRJe&Q3ZzJ4qxG zEG#S_gm8QQ7nJAzOA&|qC>a!L&-ww-THxv|i>9U~y1Ke(YilDI46k9Ua`heVg&|aeHnb0)FS3LZ$@Z z72ypmOw**lzn`wIE*cvfsjGWPYro%5b8|E8?d|mU_ZNUQ41xE@c<|r>hGDolgOrl3tu0ci6sxPN1*Yor`H010 zOixdvX&R|iis|WT78e&0La?^B#?;glrfE7H)ijNGJnoFKzP^rSSq`l%%R&gj#>NJl zo0~ZzZfv;6@bcw$sTJ17#>TFycsWlR8X6En(9_ey@bEAIGcz;Xx^>H$n3S@>W80k7 zbsZ_C(?-{I$LZ+0p4U$ZL0?}Vx~_BQ&K*qCq^YTi!NEb+*Vmbw%Z1UwV35|LSy@5X^@2&eC-1&@ zdt6P^@c9aZJIk_|nVE6g1_A+whllCw>vODXd3o8ngb)RE@^JWq+P1C$?*l#!yaJd$ zSNQcXXLL<0olZNZw7I$I@T=_nvy464{XW||>g($rr8P7(u)MrnR9VFqOkql@^l}S$ z4KVHHU+{WrHzyN`1eY#dayaM(Yn!b-(Q=ewo3@k^Aw&TX!!Vecnc?{H_7)-QC@sIB^19*O{E0WNvP*pq+O-zu(Wu$OxfO zh{eT4u3x|IY-4r^J2f>$BoZN&N@1F2DMj9>B*5_j;q4j~17KMet*xz`J$u&S`RM2< zmSr(NKabz-e&T3w*w5D|v_~VZ1C@n1o z`*bK2%G=7kU~6h>XlrZBdw%%v;R2JjJ^MCbUjrs91)Nm*Wu{WV$z(Dw{FG7_<+&R~ zI-TbJ{rmaZdMvin82trRF{!v}`7-cgMID789*+|ahaH|xOiVC4J4+xCDA_k04zskh zL^hix8jUhOKE4yMmsDYnN;z!Hw}BAwnR2%qUDuhNoh2HLI^K0VFD-;1nM`u|@?`>n z0O@qP?Cr}X|57EWjos9xH&i9zt^$Q4zBo!g07cxRYY zb))B16>-mki#_Nk744n`{=Jtc4~B9E$AKTK8uJ@@h@1k(RVDN*KzuiYl`6zXfNv=9 zPpd+~5um}N00G;5RA`-V^ba z(Pjbop}Ow|nmv=#ffYpu;X2x|RIYkf1qbI3~msSB+0apQ60apQ60apQ60l$?2YZR${|GxqjDt-=90Y9Yxuki32v3&;|2Y#*Yzt6#Z z4y6H~1-_|%e{nbY@J{3<;2iJ-xlfKhsgy8J@q@6PNLCdULTY87P|ts_-g%&aH-Imb zD+4`4t_b&}n^$|dvbM!$fHB~EVLIV0apQ60apRPiRFI-01eCllmNH6xc~qF07*qoM6N<$f@rT4xBvhE literal 0 HcmV?d00001 diff --git a/data/images/dancepad.png b/data/images/dancepad.png new file mode 100644 index 0000000000000000000000000000000000000000..5519144077d9d52a1baf8c1209f05d736a8ca94c GIT binary patch literal 2503 zcmWkw4LFnQAAU0*YlhKskQgoD49k)4&t+lqF;PDA`kH(k4V_t2EFXzJurx}dI&w^j zgwTqX6iJeU;os0W8WGkI`M+J)`@FyFdfw~){odd6-1q%Fx!#^G3J47Z000VZuFgJC zwEZ>Uve4UlVp2EI3%?g92~Wf(Zlc{L_)ZXfI_sH0}A8c25n(BZ)w?1M(@9@ zkYc_?>sowZ06|hovmc6JRAoZJVZHtNU3lb^@dQ^^RuwEn6oPCU4T;rUb5YS86;GB%>$9jN369q)HXTYlv>)(jGsb2WT2#~26DMvyU)vO^)!4?Qj4a!g@raF)wT}nR?NbNMMS`~9nwC> zaeS&Bhr}+1#XTEbpK578KOOiBXMtN>o3CMqFv*F9jcf=293Kwtip!}LJ!x%~0>;M1 zFldB=%j&oGtO9oe9FZ-B*(Zu0-nlVKwh}2p;wfRG`arOw9!%H-POKDt|g&s}CE-n*lSXnV= zVLqRQh5lt5;8Tr0{_KpE>XXs=$-$aqb))nCAtA)O{dk!)@t2(dn4EmIE4Q)nz~4Rw zpOdUKwY8^)Lequcp-RvUAo$j)LggOs5{t!lCshaqJ;L{~je>9VRSXO3L@vs0N3zfA z=}6bq)SNIc-El6n0|VDV5taK-6wQoGP}RhY-EnboW6QIr7&K7U52srACK96B>2Ofy z$-r#;g2aKOr?$fL{fM+w$rY@x-++~umoGD|EI=m|D%ZKd6)O-k5*du{BhTI1-!@E{ z?vu5%<@PcU-bV4~%}uW(m)2~d#?8&m9pTrN@bZDt(b21m6R>Wfsdbs6#S0|V^_7)5 z%M<1hNJ&xA+qn4KWT*Uayg9_TTY2x0IJgvCXPD1_v9@MqtEChfaL7!9XkVU#>$%r{ z&Jl2TcW37TrMVESXcQbAyqI`B=eiM(Y+c+FmYP~>@*qsfrp#0HgKAvNgNR_OmBZoK{&mD}C&XVe z`t>6ukqi+ATBE!UkO?J%HVzU;Y-9IOq~Wy}P(82B^HI&C^^YE99Ifg6me`x5hd^%yQsOzJT8ya9de1)jB@oY&YJMWHQZtiW8p`{vfaa}A*jY~>N z`E4_;Je2{-paWbigtVcI$OhG9fr?<`Wu|_fE-fWx?bH3ELB}5s1>QSw)4k`>C5Xt8 zrrSLRUKtj;f^l)8e(Rk?}FF72qH9g?wx6i&6&{1e`uaY#;FGE zh)A03h;?tc_3h1@?XBa+0OsnOw>3P=ru`*vBI)00NlB*rlR`s6oKVu1npZ}csa!2D zg8$FdGRFhfbT;hv8w#og2d`RuE)~e{#9qE43bA5jw-218L>Z` zn0Rh#D&qB{x3@=*JEVZqBjmlu>;0XvDgkO#tja{(QkV_>W>vJ5)~#1}b!TRzC{y_v zX{L*dW?IdDXFLUA|4qzpVnH6BZWP;Ok(K~bT<~h2`+vB#&v}blfErGB%9VXyv$2h_ z43=as(4cYl3AW7O#9(Y={jHxW8Eg&*;>hwi`;gNP0@yGDEmIOL)pvjJV7Q0-B{_?HygG_vGVZj7RhrFJ9Txl?NXKU@JhA_H@3AXY6VC=>Q`%lF`2Iw{hWuE!sIp6mCac^pWU-_|F7=DZu z+oTS=#f4_k_<5yquA79KmJ3I@@tz3<) z_ON+qqZL|`<^a-e#WzZ##N#F^{%9g}#yQ_5LuU8%^ztiT7Z(>u|C5V-h!QbtWdA?4 zq6=M9u6kGVi(Ih5h#5B0ME?Nuh6rquy3YcB&O16=6%&%I!FutBKZ;4FoIKm z=P4KTK=o8e&K>=}sahd^k^0qcHhuWEjSVWD-F}tiuG*UuR&H0PZdUpwn=sK|$&OaA zgrHMS<0Id;7XJy&c_ZSjCVyc%k}D94o2O$5ysWhoM)UgMH?>Z=db>oR=;gU#v& zMZ9Dn&E25!`nGfzgUu-Zr{C?yD3CND3-zh~_>ojK0MFr3t;-rHftfb!1-(sg(JtsJ zVo=E+?*r}0q{}f_H&$5lXgSUabt$In=|GiDX`{{glUhH$MbBY?+pzw=-uC}}fi7Wy M8`0CbmH=k_AJ;;jS^xk5 literal 0 HcmV?d00001 diff --git a/data/images/dancepadR.png b/data/images/dancepadR.png new file mode 100644 index 0000000000000000000000000000000000000000..1b3ae1ce1106d918e32271859bd0a63f51a130b8 GIT binary patch literal 3027 zcmV;^3oP`BP)(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRZ{SxH1eRCwCln{7;6=M~4>ecgwB?8iy{R88xa1TbK*4S9pKRjR7Vx<)PCk~B@) zO`WPrX&P-wS5?{+buV3$Dl5vG6x0mQW_Imf19r$uc`Fo1fD+zm3VxnzUteF_Tx{QP z{ojXsZ4CGgjI*Ry`hOsb^qe2hdCqgrc@7T&cqkub`T+b0z%~E}0bBsk2fz89eIz5WfuXw%3_Z8b z1rjQ^5PUEe!e)GYRL0(RFZ8yJ*`n&4fuXxI0Xqx~4QzA)y`7?_jm1RpZr;Fu8Vy2g zA^E_dBuYY3(Xf828PZQ6u8n#v9py$Hy7P7 z@OvXc6dTEAz!o0Zz)+MJ3EmtKAa5XWjRYj@ZeyXd(f<#y&X!rJf=Z>8qS#1apASP^ zih+yDS;eb*yrrI1SLj-?JX>JwX)cmLc7{n=eTB)Z=osFWd(+78WNr{*N2|ZjCeLiW8y0{43 zi^~7&^hU79=|OQ*cHnGByOWDxXRC6KFU^PmfS@F!JB=NEJ_-H21OSN0!0|yLIblf; ztTB<9QWL=!?lAbMj2Ak5(Ag-e9EvKfihIR>u5u{9$=}~nuAx&y0X%-uoe`LZWxO>g zU__8I0#`XGesRMKIR;#u7EzsKL(ye-LZxPsu;ZyK9`yMn%q%QndkY)i<@CTsO=PCT zNH7+ZFcy$dblDBPeK}z4yY9u?Hw9FvE~B?AXLe^R3jjDjxqzQsNDu6f%6O^Ehpmln zJbl%Rv7nR|SZ}BJb(aqSaHyMy#z;_UrTFCy4(BHq(D1E@#&1RZu7BB{t&MJ+pIiWd zM108!cr+kkJSd^mv>X6RO#}_!iui7E3C~{hLTg!>T>-#H6X}5k6;@*+sA4F}%mh!j zdodkaN)5~`10U((QEDd8S}5Kb4q!5L7YDn2IC)F)l;>`6&{~w8|9DEwA6Rdr*xkm$ z#YS*(TEqwAArv=}oPoU&1-8VrGJ=*jE6}S`(R9ES7UlR%#DQ-LXlEm+bt>n5(}0Vc z2>vh>z+Z2NuuMOfy-7z;>vvD1h0 zX0kcJIva(-PSHZcm|t8%7Z(8^m2sqpM|m^J2<(r_sO$2f#HhG&x@@R)m3wCbK0O>j z7Z=5k|2~JGH@IP+SFXik<0b%WOa$f41jqV#T=hio%vCR{9W4Gh5`blH5!Eeh!rfB^ zt(SXvJXSvstwo8jnX0TUjc(Mmu@Is%dVLZMNx&~Bo#E5N0ZfOM@LC^_6E_9)auVvg zl6H7KL918=9ugGb5~H$6U8fI6dwFO~%Flb89=v^1!1h)a71re){%|~mpZ?2@msCUT z^I=??7V%o2;teTb)nC{f0|HJB1@PVC60Uh7sIXG}DrtvHj06={isx>4@zLZ0KAjcO zFe~EKJ|0?&8l^vTqh8(Novk?lmzv2;nVI0z84)o6XGVjlb+Xves^|%q2T!;>sByBW zas>a{j!%g~cA12fN!?{Pt@eyy_v`f7ZXZqz3gDwM0H8}vD=V!O z6&8xu`vv$VIcHnG2}sy?-J4scm7Gggx3D-qDBvICA)K2C;cN<>n+W0k+aVlN-748t zE36c+e8uDQxiGr9D7v@^I@73|i{eXf1m`9~c+$1PSd^LxUg+TP=Wl{(?TFj*&Ts&G z+r6ugPj1yxyh=$<<5H^0ovK1nx*ujG%GWqq)MnAnRu-jZvZiTQ#ZYLQDT48g(WJY5maIp~tBpEcET6|Q75S1|%x{EWTK~y=| zeA}s6ceTpF;>>6eQ=z*M)b2<+`vQ^-7aM`bL{MTR*%Oa`zmzc&`lB-b^W7o>YV^D? zEuyl3z?C+N3)9N|8jzH={n5;kyWg+m5k*aT0tclSj(){MV^%UUrRa`f|8?(XHr`hB z)b?NZBBFK#M*|WxW`d(%@d!$>!UBh771l&h-NK@AR>W10l3O1i6gI1myz+XpP#jn9 z>8qXy8fQgRx3JKd6zFi8)@a_qK}p83UZoIETp13f@$OZOq=g4|(g-w0vgYd2nBvf}%>hn!5Z;W~oHIdGZWN0Js4iq z=g#|Dx|P^zvciqFG`iuW5u7d{@M#rzOQUBq+`V9PfDSP#?Rqsk%jJ z)9P%6FaCA5!w z_+UJ=Mt`{-!lfAz;$0=!T$&M;9+~|C0oK`+px5qM9-{qlB8124=at^_D*dd%jasJ% zchp&t7=ROl0!ki~!L+hwf)_e`kYd2}!V)G!OL%W2n6|{Mv{5|i@}Pc7#DC|)2ud;- zcQ|n!-S@!BV@q{iK5S`pXFZd8J4J~}c{R8rE}_pSp+~4Difisns$yb-&z6|@o1E(u3;{mS9L1CW{uNi82pn+F+PO2Ph-S~S4ob293 zm)+2(f&E?q$4kro>gZFZ(ZhQMJYHzv_`GGN;qgrd9?t~)v4NqJg$B;{^(4)CZgJaZ>(|ysw^(8%qJAA~CTUT%xkqLA!D_z$4FG`o Va!=oV1P%ZI002ovPDHLkV1hIcng##> literal 0 HcmV?d00001 diff --git a/data/images/delete.png b/data/images/delete.png new file mode 100644 index 0000000000000000000000000000000000000000..b51bb4bdbc6cd6eb1c542cfd50d195b034ee1666 GIT binary patch literal 1475 zcmV;!1w8tRP)VTr@N8zDze2CW=3O-{~v-|zGJKJR-jDXUhk z{H=6gr2~>XP@k&{Cg~(kTx0@!ks_4xThfOL6`1q&u$FEH9Ul+0D0{G1Q*ku=9SqdZ zH@r!Y@f(?N{F)70SzsX;o;@7DWW)aRb_(&5dLgKo$;|LIX>d|8mZNT)>=15v@^Jn{ zekA+#Om#xc!jDxO;ruZR_N!@_yh1^Kpq03p1)Id}B;aWd&t(txnyw|kI`Y1jp=<~@ zd=JAo&}@4Nr4;E_=-SO1ECtq&Gv#Jz0s#C;Dh;2j1e2%Zl@nn`pSAa;rUUW3@7>DRN9gqG`6C`Ws zvjqHeJ{b-ULgHgSC&#Pj!?;=aBYwfp4&o4;`q8Oa^nDa3Spy%(Vd#^1AwHJl(S0%& zjRm6f(%?NqJpAAl^q!7gR&`O$fZ*qape}U1AA_D#FE5L_-iuKN-ZRAg<6F>uB1Tnl z4GVqk%HB4M-6-Oo$k(Cc*k*LStByL3MiabFdHA_2!38=FN8`ae%Ie(=S z+e!?Qw-dwj!~rttG_Aw!91U7!$d(fZmYlg<^FGz?Cx(_i5<(FC7E7)czwOlE4w>9~ zEfh8xvhG}mhTU2rK9=LbweJ!Gc4=THCSr^B`Tn9o^viP;nzO@U-4P;7Ew5?>IDc}m z_?XYh^IB^0Q=yqMmBYhW89%&IpCY5aeCPVAT77_Y7g7Ig9ymtr>Wetj>E`{#-U}NDqNI z`T6-W5d5yCJMV2fabPpeUEr6tR#|w@m1r>1K2LnkrIgi@;peRc1!oVpU#c6vSdq>z zwi5MRC`mrNX9(eCSToysb>KZ$Lh80z>emk8<+@=@RO!5zmEeD~YLzO+UZfDE{8oHc dI`Dt$z<$ zJD}y#qH|lO1VIsD$VKj8e`qq7@1Ex^G*AldIX#D82FW)$Ip=-9&*%HR@42L`Sh4)K z+=1l|NbW%0PF)~rljMmDOkgiks8W85`cR=m<{Uk&1rea*a(|1m2YWT{4rjkl{Ppt= zpRLE(l{7eh&48`YzYq-19**l7uwUCkAzoB31Qk1IX87u4fQqpkwVP#!aKV!Yejz`S z{c@T*A!gu5t4zSp>9Ai+#>52*@)NDZ)pXb-ZYKdxb9gR$u-8-#`PGv5rBr1@xZo=Z zzBUa{E|@TKHc4o_n$BHGg@fd42p2rf;koQF<2QMp{H~@^gHn_ULB)!A+l-zu0zal= zsyYe7mBu+5qae7P0td-k2p2q!LA{m)5QIUwp-z6-n zk?#|Lnj|=CO!Gpx;OQEV;j!NQ#?Dafi%GCk<0OTkVgdD8It(3;1bP6`}CrtfhRdc_puoCeHANNgC}C~&*?-s zI0%W4`J5cD?$4rU;7|AjKQo9!aO#IgqtN?#v}E;v5skqwV}$rvjz`z0QE12&otFmh z9^%2rFQeyJ)RL-`YWf8~Cj@n&^TSAVAKkPh>ii&58F=>)_uhL6T^~iNDz0InuU*;O zW}zEJ+!HxEw7(O9&iB<(`;l;h*C`J_dnLF)`{8ihe^*)EeM@C{_YiGw=+SXl8L^io zTgA@1Z!6wTT(GrNhr4C|skKD6wD25;0-SBm)1miG9Xd+2Xe*H?p4&?eXv!7cuaNYj zk~^5;Z{+LnqWnpMLv=Obv^2Boo$YbhlJzA(Cs)rEpRA{nHi$^5{eIOLK_xmUI z=p(NQ^0cYB5)9vx8-{Tz*8BPf+<9$1{wh>P?DeR4gYdRFAEU}{Cjp-mhSB0s^z0|- zee3Y&US-9ee;-&cYS^fjVj&ow4MzyPtAL<)uf^~A>WIA`7QBFAs%6bqAcTO=)?&DD z9Ukm?9)IM9;8u>h;u>94Ylv!Ev-}7l;Ip(C+_M(<^9XuZFm5i9xK?L=2nMLOl^7&% zCx+*V{bbUSy#_ZkHE59`TV^m=a^`Z)dsMrR7@BuU2tn|1mYrJswoQZEWOC!xAlPKc zx@`^WcW8z9SdItRzC#SRwrgM}CSr^B`u?Ip^viP?nleIQ-MU(qnqScfaQ@_A@iCv1 z>&GnQ!wT>kVER*`h(k1N4MtOXpd>YJ4syZI{s80D%;OB(c5e7@T1`Vcw#g(#(;5T}NpS==w9D>Gr z^RuJ{p^j?HhIbEPP7Q*^_?%~%R-(=eyn6@>%~{BgYfZx+l+}3;%U{HX^(m`iPJDK* zj0C@Z@y>hNP8`@wbLaUb2PzBiz7q8&+UN1lIAsWs3_oWjC^&n#{E}SorHXWZp_QoP zLJ9KW-9rd3mI#V!w6>FXs(grb_2MtOWm?HA1Ok>_yTj<+tp!+=2g7 a2mS+U83%5&om*G{0000H4-4NfEfU&v>g-`U%aq)^K$dFcXMY~Q&ePk_i(dyaJB&ezh#V` z9YSySuFTom2~0gUG(+7@myv>97xp@oA(e*@ObLR=f=iYdbw1oyQX*p+DUKygN(xP2 z)Pd5(Q!SEz1(zm8yorq;yVwYPm72TMyo=IABw21xwos40M6&HP>=)|hL$@334G zlF&$!Ua!<=>J*_2fP6p_tQ?S6CJDvl@aO@>WPruEmE{)jf*-JW6tXi1gksKf14)3F z8DK_|;#7eBj!o=yz+MWdnbwb20t|%!23z$331E>Q5K=R+RR!u>fZiz(bt6DQ0|@EF zM)3kQR0B$UElQt+e64GaVxK&I4~9y5rc z{zK)-3-tNt-V+HErTcO`0RY9RjKtj@U;0haVyC9Wl5n)<{NH3*ox%}|%CQtksXdo$`{@3Ysojdb$OK=JOf!Lj>4HcBNaZA(krU%xKG z2VgHzV+KK2c75i(2A9sigQfqToqp-w=mJU5S>3Lqlu}B$594w7@kbCypdUG9mK`Oic6sUKUB?(OBe`jh% z`b+&0$k3~I^9%rfcDQ}`1fd`ewU5}C_PsuoyHqLW210Gs($D~4_MA%qG1eqEOaTDT zi^KTp6BwAvU*tX)`Y_#(UbLTd=`SA`f zb?l?l-Dw5-kgc>b?sR`p6onrkone$@3L_MEP~hcQ63ci)&Lj$^+^BQ#2URlq*IewQ zu?#vK>Zwmvg>~Z*>_}C%pE4f*NyL~ax2H;t03zXkqdQfEGr}5mWIoX}E4IB8zaObw zO8wE=OE@q2ZgKuckN5Xw62wXfAFJ)@mXl=_hlP5-F_S+Ta2666>W4KvgHonjjW=-A z&{PlIuh*|3?T967mWf&ya|2gJGP;}k_6wWa*0*6#EDS z3$4r-RlU!dKDun})JQIo0cC$Y67?1Hwg2mruPk4|KVMQ|EalN}&-FGTx?_&;d)uIG z(e0ZyIU)+kH+j0N?@AE2pC%i_YD;jsbviNc?udHlNlZrERZ}mkEzO*}Z_i|Z=1}*| ztNr$B<^!$lj|Q{jyDHzZzmcB!(%gz>j2Mo!gWSt!CTF(0=gVA|qfvfu?)AN4gpj!K zUJfCbF4qld$cN*5#h5xql?l(}$zJ7CFQ5A zYGf7W#hxCEo?WHXyO=7wcWwx|x4}l2aW{?nHTty`-|7@Mm~V9su~S>!Yx0AFoo-b} zdxt$8;Axm#dga5{k#ot`@mi*;vP44h3H*sclkRbbtsMDQ4*I;nON){KsmMMKj$dOq z;gFGOSju)~Qz6>k`B6S76G!lsb$q!e|wS;g3unsn{h?-M|p^ zmh@IDs4DJi%1EAK1*)9NSV}sc`}Vk29OM*sn}rr?xK*tAcM<-u1_@pwE?xdqoT|_m z-fW`bx{0TmVwN6!iguG`6CB1L=_s1^%PW?lGEvzZk*RGn(r@OK6P4)_9EMD`xVBt| zT!!B8+~fiCsB3=LJjm14Y%Aw2m(q~Z7@nM%ES>zE`!ruhctM1aPsm@$UvIH6_A`d! z-r-tp)Ed7Umm3}6I$fiTC5*}pk;bM?%C(qU?#~^y9Tm4L+O*QOstZ5c_17QaMsbxb z_v*J7Z{o2y7hDj^&XUQlWf0qcklvLZ)E<<0DMNlMW{I|%&6q9N^SuXyq`u@@-c-SX zT+rZ2)~=wP;WTJ^@yQnM&N%OY14b`@PQ{MNuFW&zIQDg%dic0NwyZ!t%h2jb*H^gL zDcW=+VD=P~-<03C{|;YwAa>wz5VKM=AzH*+X!OMMWB-Wa7oF`HIqITJA*c14U~NV1 zFuP^~r=XQ!szL2SeM^~d)fwuLN%ohlN70t-mbCbq$eNM)gm`buNXxi(zgwYs)Vg8_ z=e6~9!1WAJ5z0+sM;aHV5ccxFi}Qe2;GQHoNxaRk#-)9QgyJ>@Mup_?+VJfUwP5>^ zA1SrqGeXW(>XZX*)QjM6pFfhLc2KYTgJ~W`#Y7oI%O$zT8s47~&VK4Uv!dv^{`}AL ztmkX_cEZ{cb^P$Be6m#nj?&BG?V{~+Ljtx&6Z3``Lp5i0RtW(sk?v4RNqNd#obB)dZ=WUyhg0nvyA^KfcW0sP2m1{$Co>a%D<1T&yGWI zMr~+S`{*~)aAncz2K;P>J6$!75{=Sme>~L|dZ5jE+IH4@I2 zu=AJbk9qvd&a+F|(QZ7F1gSZ1J8yHLcF}YuhmEV+J%RUK#H5=q} z4}I9|*aRJ6c|Y@%^Y!vBURu6v*Pf7_`TTt?;I9h)Azgu}w2?pj7%}Rwyc<53ZufIK z0h5Ud3KsaiVu3Hk1rn^L)*b2G4%N2qNt(NS z_xdhbxhix-)YC8z%Y7VqL+hr*fpISZX@;|zJ{dvAnLT0t=IKb^}@a%N` z?rN~dqsyuBjwRnm2eqBro#rR<`wB~nt14_87Qdwq+KXI50sZbn5+U!|TV z(<$Ca&P^VVz7@S!_)JzpVpGoJa`$hA;D4%v>8@b#`TX9()J)DyN%qg| z^d6U2WtZQ3_wLo`|B(A5XiOt?}k&oj};f` z_tMj^$w+gK|5`oa#}oY~yOpZ0CIAF*13+j50Q|lt_PYS!Ed&7HEr_l(2LPDd(#!{y z0e}vr_FMtsxBTO!OM=OQQSek7A$aP?#MF;hOHRW_%Pe(l_(cBk+iEELll zyMq-e&z|Xx={1zEOo!CoK;rz4s!Db9L1AFwarfb|EFq{a4)mX#TEylf=T7qT;h+>k zQAltrIi*6~f+9~kNf|@A18h$8tuAj)c^rZ->Xj@VaDg@NxjHqg6VDyBo=Qke3`+A{ zWA#x?<0@I$``~Tr)nUp&b>m%CylV^o`b;M9SMOO6b2Q0#BS`7CsAfbd1O$^$d+WVm zcQ{gcJDi;YG%Reg5R{`EaQ*31#AdHU zFWtxP$%4ofu=9=^QA}o`Hb$ytx=6LOb6fdH&HpqQK1xI_iAsFp%ty=|FX!OyH zS>0Jji=2zPJiSmen0yrAd@DS({sy$Ah=V&%?ENtZ>TQe;2tS%bdVczI3HjL(`>5mKO zN@}v3=1bZN1(i~PPrT_KHz3jsg4R_SlvFF`iZj-L0#8~bvZu*vILWnX>F<*TZ#tm3 zz;gh-qOBJf`zZ1}8r7)}z1uUyd_lf`=Fd7@%`Aa(L?Xdzv#p00Mb!Q7Dy+k8P7Bz? z7x0!rbisDP9-6huxEA-_LSydvo0-s3h)yL!k~sVt%j6+$_$;0y5=DW>rMC_)e;SmC zDTPe$wg;CRLSnI^upCUNw>)sMsM(d2A+nFev|XJ&Q2hr~eZK~EKFxXO zIv!v8YV^3XT8H7Dcz%BNnO}3=oW@ z7q?%uQxI|=AZqj>&gFsxh}~*+OEm59+4xwZm{V9d^y3FqdRh@g=8MfN61UndD=WL; zRts<>&YP?Q-#b(tLH$MuJYZ0rX z?58=h@_saR|_^`8kyn*i**8wBU2Kv~ce?H}SA`bFm|NOpK?y|W4?Ls{ z|Dp;ad+24_!Z0jM3gV6buU}}##^|cV#z^jAbcq(lOcY3*(N_(d$we6jBOxw(vB^$* zy~?foH;-AsZdveCo5j?cT&;>}=IA3svHT#6?w@OcE{+FsDEzO(4s2kgu(C)lP5dB7 zDJ0y+$eoqE+~GlS#sforT~g02{hAb@a^BI<#AJZDTw2y=p|FzB-@pCcr#>*_5f#*6 zdEO{u$ROtfWQ(rF%1)*u*zIXK_*cDG<;)BX&uc*8ni?7wj*e8@9{!nB`54S#n%yhRTzbrsoO~73JCTB?jS`GE-y`=VdSAE(1M1J(Hgdx&J*!YiMe&%8Mlk|G>A}y;n)u1G>!GS6%zPO@)SBQ{rG0i@4S7=!hCVwKP4x%HclTD2x`*o~KaqJO)G4mz zljGCQt3P|K!IzTOM%^1j?~NuzhVJ$YN%u?iXz>nGVY*SK#-6MM&Q(`&83~EFuD~m@yzQR$l7Q~|235k!#-Ce z>zp@Rg76Etu&iv7i9m~heU(GrhQApYqs5s&NqZ?Wef-%p!;|SKH0*}-5v z_m@PmRwMYHm*k;Uf(!;;798gp>;g)E6h#9jVSNpKN}H#>=>4Fs_C}v(nnjz0 z-~F!b^NuBRyUuN?IFr=M-S(@=XGs_oRVrfcecLP9>w?3JoZQ@{7cCxB=#9P`okv3~ zmwy>9SEJ=YPmp^;FD6aGyQBxWXOV07|GLG3@(d~l% zMkw*H`*8aMHagI|*ILN=X)*;6dMb6&Hn-ft_w(LqGHLJNYbN3`c7u=2y8;;PrVEvr zqe&^BH~`Q?bmr#E-K&=lO^pM!)<(gu|I#NU{wJbiwXhLdEqFvU65CeH%2L_mLCCrH z72)i$`a-rD#AJqp?#V8A55KIvt5ql+N37;0x|KBn4lVe>-^T>>?ksmJHjs3Y>|IsW zVw>k9zDz0xB@zOwy1M#1{pxy`mr!%_s8WcfQjm+4t(@l$O)2ENlNoWoNKntxzK`6O zc5F?Rqbe_BUU@SyRzoPk!ScMd^e{i>XksyfQ4q;;V6^&i``S|r-|y{gVJWHCuVm%)DiN}9UYVZU%!QXaz!%b; z`mH6Rw+*vwI4?u+c`GbwBE_fI1DMfwb3tcQ}YZiHDZ#p?^wMu z0+UgP1KS?=V(1<|kbGz-au31BXwvC-8>2s!IMzzwou5qLV3e|10PH_TBrI30TmPBRJH*el3))LYF3%yYh|2Qwn%b=;YCmNc2S#+9n zHyv%@m0Rrx$YC^yjAW`vF4?24(_y=eC?dTItwD@djPMY#JYVZ9oL;k*-*X=)(SxUI zRge!cmVGi{*v1oyS)p08nV6W4#va#w`8M+g!aybN+`X{3F_!t5XhnFkY=qU)QYLMu zlZjU~v#jlsfH66G>PJN^HFLBQNTQkjXfN8m*^U(!7bhQYtS6e+D+6*Jh7V{~C=_ae zLY0JAjc07;OSgfKQ)e4VQ?r5D_+DQV6xy~_f$ERbp3&qTrq01cI zK)fC{DS)KwAY+-RWoc5n^RDZ6rw_h7tUC%J1#+Y0V)-%1dg8?#P*c)+j)hr-{~v;} B%iaJ0 literal 0 HcmV?d00001 diff --git a/data/images/drumsR.png b/data/images/drumsR.png new file mode 100644 index 0000000000000000000000000000000000000000..018369252a84a82cf45aeff2b7ffaa49fcd8e37f GIT binary patch literal 7117 zcmV;;8#3gHP)KLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000p9Nklo3b^gx1_bvTi_jLE{9*xGbWJ~f`c*ABjRm2#anAHISi6I3k zk)o22K!89(08?@f(AG)d&5>y`}DUhJg8|#fDG; z0@$|{BkxI!WF+=1B^dMtwiH}g<}LTl#~+`K>;>zy>h3K)@{QVJuG1_DW^{l0pvtKrr@ebE?Zn9yXn^oeA-9V#ZpkL6FH>3%GB!CETB^53Biu-2bKXwIqzjtnc z!Hg^%s_3^R46kJvtIeiiIFv@x*&J*3up=NKXh;zC646L0=4ZtQ=gcQ&WU*ncswK8~ zsHE|?cP-&)OJgvU6P|#TSltrKK#xn11f0!6si?~xB|_jzyx>^PT%&k zAkmE7bIEJxTJ|mKY$s>89`5nFTZj^fnpQLk21Mv8?xX}F&1% zHl~p=nldcz{nqdW**f zR3fbwLK4{U>YoxhMd)UR3T7xHz8^TEu@)~7r8zxS*5i|P{Q(e)iqdk{Ne%HRkh$}o zBj8tJ`=W`udG~zF{I&pjs~W5s=w?O+==H=mMtjtq%xhbq5C92a=S=+4iJE@zQexeO z*rFUW>Kdpfye2}>iHfFS)DnJUL))*qf^NKTKK|NtOTW3ZnJdnOfo^8ZfU#&^SWq_( zXXR0y0Bh+iJCRmTcvCsCUNx~W3@k1L58C@o;4M zqL$&|dTck|znI|GgEe=iYCr_fGG|Wb3uWyI6ozKTe8gxPi*tMlPtwB-C#2raDf-+q zN4)y3#pHvFEj!L&p*7HoEF34T%MgGo2?UDze6i!=KKG-Z#1|@wwJi$-;v^yq0&3bq zIs}JkT_xtX#|EQ`<>EbaQBDz^6IsqD2AN1(bzeP#K$<2>0DDRacFe@cW=L-v@NRPj z?d4^TTn@5|mwA^Nh-}JhraKz(z8xyMbGl)FR&c2q8Md)WBL#qD;G*`rcL0O~6@#YXp+k$wc54tq zFbt*9Cfc3{1Iv~J2H;45975=cDC^Kqs@fWl2uczh0VopC)`C~!($t3e6s#Dv1lUuG zu(jYKl&SYRe+Mw_OZr!063nm{_qsj1OY!&SYv$?0f&8vv+-NP(;}Bv7>Y70*Ayaj2 z|6pe+xycyN`kcDWFn_{V;>dhUH(ZCfZfpuNIEC1pCe@V!Ds>wk5XnDXJm9{@7r3+Y zICax4op_K_&s#8dmSP;LYMh9Q_LrDo$BPaMp0G{Bp!99G5?S0c7316<1u#oNP>Rq~ z*Zi)Z&&0P)mdw!Pk{-N&Hu~#bi}BAYiG9bmK6hQgqooc8tf?L=;CR)H?OsSeZh&no zwZ&`dmK;GiT+_(9gg#fGkuWNW#g@Fna7H3BHVeQ<3OcRHnt>yLgt4&_+Z&pi!^rT~ z2N#p;Y7wi@1qzPDMAP8FOfobZ*bkQ)=19wOK##Ius)}f4*YSeXT3#@MCHZ zWjoAVL6~c%23^+cqLf&Kl7s*R31G5jo}(?lSqP{H7UGxA)XY_u0o_I_DS+pVW$>C! zAwGSejvq|4u+TK9)Xj!mC?M6^%HF9&=fGm}Y)9f_R}Q$_JwY?c9+;1BP(<<8 zg1V7_hU&te5fIiBVKWF*0Hz2i5n+aa^9^Im{;Ju&e=)wg(z010PJ-ELVP_cl--lYb zZ#u&50}ieq3vl(Ik4p*;F3KysaD4{1Pd4%6sTP)+_QZQ@>wSU5GD@+%JhoV`2y=Av zo+=oCCxF;8W+RKbvAqDjtQOhJ>YA^ctDC{N#fl_!HX|??$YU8v_Z+PzFN|W&fGJ~% zQ^K)^!EJ>@YlbU;@j)LiUhm_YAs?MC^1IV5y#JmhFsJ?ZnZDPF1U6~9jTF?~eV*LD zAuE6B5S3?2U*2)7`Od%*c+;glc*!~+rxtEk z5MDasV>Bc1o?n!))Ut4#)jg^;(A126U*Lisg}y+w0L!ygn>|$5Sd1+Kl|~9UMRDIJ z7!4e+B#??A)gu)GV;Me)+IX+?fxIKW6d4Y4j;P!*-I`-gdzY2KT^TSeux-a&{7!9v zH(j2?^`ri(Mm)9X;<^nPeD=ZGs{W02>WLSu_wl>u1-K}$kP*TM15IY!yBOo&_SbRm zY>cp-9v$xq35d>)^GfX|!EO5qk0bvt&rY_2Ux!t+OccwIK)y{<@A*%fymu$FQCrVL)cDO~leXG19Q z>P;a+M?jl3DGF#Myxt+YqUZ^Dg5V0^Y5guX=Nz2wQ=;FepcI?_kx-=vWnGSPVoxjc zSPg9Ib+CO?*cEzTTySu1Mj_H`z8}iR5d;c**(zS=C*!$~lBk5)8NbXBUnpI?*Ux;widiC=kD|EvA-7 zSqI6bXrF4NpasJgq7gBoF6GF`0zaB+AxRkSDY`ZrAn-*zo|mFquHMk8=pfcgr8qSv zBk7PYsIppsl;RX4M9uJg&Jp#Aioub(>FRerf2@vO^D(3(Sc?<0qha}qno5YM+jSqR z8BDbdT)8%ZI;#1n9*6Gt%nbj&@2(nCtb?TYSb6i9tWS= zSX3|n&XLvyz7*KLHRLh>;R$`HVepls4Se%R1GN?-9|(IvuX{^5Hv0u3VPI3KVP98I z>_EL~GrP(Ow)C7iqJK1#c1CUob@-9>r=y~Z_Pp!e3g z=G(r0us*PNA?8bmT^N2}&p3pKOu(4xlse_6(#Zp~p^{^9&{A+q?wL<8SElJ>l(HU`!Lal+^c1)j4m zgUbpIaxNjUjD2N|JLV!xmo*cCn87`YSSac${S}rav_ts*P$;e%4E#6DHq141P2=QU zkthi+cyejb7e8diw|q$xHbwapCBia;fIGGnoe%CZd{en$!~17qyraB?i-%ln%qj>F z4%ZUwT}m)rHed<(?jso*0r;&ADQVdlDlAWJGYY(_5%4X0tLDEZTB;n|@us%V=yS#H zZg>lQ;y?{`!!XQfXvRWp;SgxHVQHqRQS>CF01B?eNFZ!%({pbj(xzZvB|)DjF&0Xg zcHL`Oe#ODEe*a9xY)-(!=(Gr?En%wDc3Q*bmB^TscfMvzh}UfjSFLFk&A4f26}KO% zV@tog@6rMHdRJignL=Bv0)Te;TrEvb)qaWbrO}+aX3L=S;ekNz=?!J8Co4D?3fmKk zq&JY&qAx4U%Ne)Z&sUxw;Po5BGZye3MY!So03)Ho;l*TgDKf8Y?;%#3kIS{Cm3F{d zOiIGL#(Uk5YRlJ8HgwT4I8+oBd^PV0@N`4J_V7~jd~Kl`5#!Qf4>z0_pj*N>7D!w< zo```&l?Klt)8H1emrmStaWJS`GonCrY-0jPN`=o30DqycSeRkw|_2qHVMM@ zV?GK__c~E13F~qS(jhbwTvkhPzDxYX8hpAGD909w<(dRdH)6(leF_&A+_is;00O~S zn=Qp=K+)=Gt^WUwB{bR~SvTxAH4h~*qu&w8u90aq4C8oR!y1N^1XobxoT2wnPlS6- zn<|M^MD&42cLQ%Wve>hzVKu{(^x$wt?DNEv#KX)$My1D>odpR(LO@*#pq!*v5Z5w( zJ|E*?H9;;EDERU&SJ1S4GI*FdJsbysXqi#MLNjr#Cnqpb(|Dj1V|^ym)i-xnHGk$n zjcmfm$*O4NwJFz*F=Hxla;mi;|8^*A40oi_af!;weQJqi48E zwYR4ErX3YCxnz{@32e%%uk?E22OZV(2{l*=!Z{hSB5RR^sNjgtK2$NUh!Y;#wGiW@ zyQ_G^<}9}4Bu?F;g~Z~=GZFq{U!9IswDKInSdZF0UUc3YN?PhBBhG$Ew`=c8i!ls% zlKy8~zw^GG;G5^GCivm87LF`wJa^Q``FRIf2Z%H<-7@&aY=oa4j}Rw}Y#^{P@7%ks z&-o)?&@R1}Zs~~}iDhII-MXpZ%=(Jnx7e^39VsXHWJx1%2|0(*(m*Y?(1wu@1O|$t zKALqtGaRbF3zayQFyM4~x$Oxzm;h)C3*s+dKH&Xys-a&$QKhQ{(=%%^=M4bgWfTL| z$|%|qdUVg`y!!G|g1Z=8GnTu*1N~$$xMQ?sz!Nm(OS-i;Bk%9^WOKTq&u?jVl@KWU za&o{IUn)oTJ6T1C=OYXEQ50|b&41MTjlsWKpu;1ql)$4_TJhy@f7Mxu#yMVzZ?L z%Y!iL=_czd)|+I{VOf?BA3pHE;=_N})*h~1TwELuhsTc}!{0}1JFE>qKYBpQrnG-B z0GNb-HUMnL{H>r5@D~+BZ~~d(H4s$(NPP2-00a_F2VAL=CAcsQ?EguG%$8&u89w}1 z%V8Uu#xj6qZJP98;KQkbAwM3Es1LWdw|94Uytm=Dbq0ufQe~n^5Qh$tBg`V;!YS)39}_)keL#kO>b+ z$D%&1Hh6uGk^XU%Ef2TEYUn9ul@dygtm>^XX>sm|fZnI=6y z_X>an#={`YDBer~DXGCg9ouUop@bRbn>2AdtC3GpiE?#14v$TVGS|YYt7F~`gTb6B zHhQ&Bx3S@ZwkebdDx{gfyUmcI!VH)!9IKZEj<4DVGcvt!WZuU2Cv`)K`2d2TMJukh zgYfU&-5qK$-(2P0UuyJhVFq-t5TgZ(pFDYDy0eLGWSN!gF2y;TO3I1pin+(*UI8R| z-_GOyc#}%pd2^Bnx}F6P$Uw|g)P%p$GHX+TgANe(lX%_wGZ0r9+PNndH=Cx|ynqG9UMlg~D+YG04JiN>**9`Z{QU%=`&gbIoceoMV?6_qm(;wO=XFv7 zR-&&v)=@v;K??rO7um<`Y4Fr|K41=z*}{^agbdna_pwX}q!~?xM{lXS@!rk8wvHUpb-tUs}{? zr-Wu%SBP<^G~y8@Ivz5Kg_2CgAREkKr~F(K?&Q9_yo9_F4;mpJxQ_I}U(AV-_qVsV z@87>CcwFysJskgL=;qf`I)IDp2mp7^!(h*zJp!<+PN+5R_2Qas~JT)wqz(u0(c>LHQ-ifostx!{D*yj5IT!!LWlqsRwo>+@1*E3!HB$~v5CAtR%onP0%DJNQg z<{i3zAPC*~W4d4Mo+t?Q3V7OiYbz8JX3s#goXB!IK}IIU>s{PR;ZiW#%vS!^B9iDLU9Jip(f+5 zT1Hk)4n;!T1wYWXicoTLIFewIlUt!A)P6Lo35{iXsqFLSGoy8&%gr{H(1-y9&Tiro zV92mMH3OO~9xudclxZJj`J3T9-SEo2;yCv8NGg_i=2Anaj2)nBjGgXR=(0khA24fW10$cpqK^aW!5fZ z0v!!Tp^Q|NVY+SW8d+e40*A$K7B!zdJy`%=g5uq#WBR02EWQ1MW-BN$rzUfo_f_+4 zyomo|zy$zaRuyB=^mVDBth$8;pbUTy?1@l!>hp%BvDKY90E7?DOojHf^dQ<9lLZTF zNw(UHe4^>YNTo)?5FdtE&ReqcLcz6-28>jmC>i)9lJV25-dCoDO)7v{G1vs4>R*~4 zFejfC=_}+X`~JHe|l6bo8Tt+4>ZcYAjk*=3yfRkS`Jl(?H}5rA%0%VYls){-G$CzKG0 zd6y<#iO>ONpxmM|w^*g(rMp|jOsM%u0Phh~^h=WYgT+lX8`of@@$iv5k7C` zQ|64}hJ(AiyJp3?5dbmES_kxydNq-uB)pn7%pD!$9~T0LZ$-Hzc3OELnI=7xcdfW zjCX~bZs0nQ_3qs}G%0*f7D9sS*VorS|NQfJ-+lMP4?q0!%P;Wl%aZ`AwJb5BSg7!1DbvqPd zK*rEL{q+}ofZ>4%z+?J^ z!+BK;<%C=$YB~JHV_Pr;000=&TL8l~qr#gK5jsxfkht>~flWJ)N0!ruG<=mU{zZy` z7i5S{^6X$PZaSe6@Rrl2H}3UBiHgTX^h$Rm9UI6DJVIty>tRZSG-w`UAq$a1Vv8uJ zPh;R=85v4^3O8;d#kA`#x#K7`10Z{NaaviEIOk1xLX;@fY(ee>oGL=&HX z{<$}ANGQOjJ^8d3p1#F@@75-^K5hb_BT8f*4h8`dgsWgl02^E(Bg0>nx}0_&^FV{5 z27C~;85xwJss=y=NHhuB)M(es4J)4wOp?go0f3vem40-k1AyB*j)7dM$PJeBLZSy- z=Z)M?>l8H5=E9CG>X*U_^KJ2(_vV!Ydxe+~(T|knmLud0XxwD2(bu+B^l>B%SHS+@ zX%32K+PPcsm_qu>lVHxH5dfN(NFqcK5bo=F00Rn^=j*S(hFFMaGnymBX&siM4S>&J zpy4kJ1ia|lpHBdUqt){ch7!^|wEd!Pt_6dC;O3I@V^cja+`_JaBfytMl@Xd16O^|e zH*4`!pPi>+P)_g)Sjl#tKOh$%n0@~IIk*u_?a^I$Gii&EM#i~|>_G_;r`kBn`Oz6P zkzmv@-WCGA_^*ms))&-4nu_nJ(-_2qt`6|ez(t54=+%`(BKJz%4z|-zhG0B{>6ON8 zPO`2G1vd0xp5V|AU;@s~d^+<`7NUy*FSTG>79kL&lvQ&F;hp?t1j7I)CLMQ#+55G~Gh`MNVvb zCl`PKW11~Nu?|9o>urwAcvk}HssYfw3pp{rI#_3x^$cjb#XOj#n>`ewQFAkx$z3rI zK}eT@5l=$j4{*2dk;~~25w*z+^V!3BDKfDA9RTKILg-_T3ZZI#?4Y00Y|82Yw{hAE z#mw_qbx_9%1EvP{AO#>GLMx@oKl&gHQHBm0QO6M;;64CB9}kCOb5S*gdX)U*omfZ* z*v)dNN#f$`T5~cjyN~bS?^X>4GnI0zl|8X|Sg*BcwrwXdt^=6uk?uv`q@7oD%)Gd* zGz0qPtyU=R#WarECI(Cugi@sgL-7FfNK((4lu_c67%Z&9o=JLmoABQ0styF^Xh7+s zcP!}MIo+`i2p1O1gD4J^^tiT8%zatRT{Db}hY;*fVo3Rcl0cW5aFoHeJg*fF!f`1o z$^Aj?d=DJrE&!?&H)dohKI27I9rtrfO5!>PfXJ0flfZdNrH$aIadNv>4M3|$#R9xg z&BOT;zZj)zMhADRXev#v=i5NeQ~YH(SnM>6GdvCcQm3UOYV$(~R|E-+@c)p|Klo}>Z*Ad0Au*~O7% zA`|n5AZRnctsW-M0uVHr>JdL;Mw%2>wDS-nS;{U0@Ki01jkQAa_;d`w$P83%oGILb z@%mLlfv@l;dBhWQLzD>(_-&#hMjM{mdFYzwTJ3jeno38!VS*PmX;UM7MUwRL3~-8h z*toDt5ic=#kJIi^;Zmw^7Lovjwlx*c2!7MNcOzlb`0xlXxlw)V3~-_Eim8w>4o_$; z*?xN4aNOI{J&I^Ho|V%cZaNb~UF&J=o?%3yX;;Oe_y&_gPTbBD^P8I++&Pbpw$sr` z72HPI)?;X5v-om;zJmjv;0H7p83 zG4Lx$D>9omzN<1YyP5jw8~{O1vsedz+j$n+B~&}IOm10t!;{Vg^ga5K_)d+AD{&@j zOjYLSHQA=A&J>F>UU;aNyNL-H4b1=B`N{0#I^wpUMnQ^&Ch1G(>>fz zIUgv+y7~KuxiIa=q~hVbS?$j_IVgl^Gn1Au4CW4RAxBk8 z)4Jb|S0x5G7d+DKEwE1W%j@3Q2W!73o$17v7UYkZSKH*DbtEL-Yh51zfEl0*i|N&U zc>p^QL~UKAEa`(eo-QSo6822nYK1sdPMqhbm&9rRlHl#-2dd?r;Wkr=Kd4`eHdDd5 zB9vX^^8(U6JZ`Daz09bnf-UF2;xQ4@1OP$RO$6SaC9PW65dcZ^SCy#k5}18ao>}pw zZ}TK>PlB@mk_0tBcUew9i^WZ9Tzt-_LDa*vU5jGu13MDh!s1t6?#C;0!!5Ha71)4G zoAdH`AtA%m@XqJw198P%XlFo#CykRgJaxy@w++P1dB%Bd+V2kpzA2yC3>0GuryKQ4|I`-^d3C(mu9|k~>SPsJ$&rb8iRmtA264=9z zD>TBR?UW)<+jdz(I1$X&8R&Yne9?Cd)xOcFN8iNR*cX6E?e}Q&0qDZSehexAsP0D6 zq>DXIBK#hnqVZU$TeUV(ZJ~7n0FNg9Z`Zbn8-~^TzGI>3+I&xYCA{0Jn=A(bh*GmK zFUcI>{_=qg=epM$i-iJXy4}d`xX|s*lEAakSIl%|ap=F3Kb}*a_6jQ6$eP97Ex@*l zP+;b@C*C8n7(4*M3FQ~fw1zf$(~IG~-T3@{&t9Z&fKm&*$-7o=| z2jpo5pQFm0T^R?Uc`w#1ya(ymH_Sc-xnpJRks~Oj0Ww8Vba>58wx&`FS)zTCcW-b0GwHZhtBR);-ueGY^~sB_{f{oJMy%8cO=N|0ABF`U-o1|9-8eP$!qod>!_x{S6_(z2n8b) zUN&7&s~Rg(zS7HK&Pl%z0)!}KNS@A57ts0z8bX;br3&o==}g+q z7YUPe{pMHlX-i21p6l7PsQNnG^m> zO|PrpUl*n7Z?QASq{pu-su?2T#OydRa>w863H2`bMHv?VpdE`?z3I-1R;|UW&fE}Q zWmiS=FTO}>tHfwf`Ut{azYI+y)T*jm3pbd21xUiunDVFV2>C-u6CT>+`XX zAb52Asxq#$W{_XEI{ev^{M|$`#c6Xg|BLA8pDPIPx+;C^zonCZr0>LZ`L#$Ey?jGp z`B>^H8;ylP3wPb$4w$ALS1BPzHu~jjfKQTJ&RIV0=i7hDIEe@&VJJr=ET|xPvBj|x z+=fepD{y>Q!nGbl4J6flL~G(#69H5t^4AVK6uY9Qtv9q-kSr2xn5>?ive-HArlahg z;Trh7nTTaj`34XEVg9LerQYnk3cTB+n)NUx!smL}>VSiQ_EPL{#XO~;;3BSGb>fiA zy&Kgl3W#yubyTLmWJ-I2EHv(tfU|)z@Spkp=7q3DNZr5~JiJ(-t=wXndmV8s=VpIW zPfBov)t!fcu5e=;a3FeaZ4@j}iDCa6CQqdzDvMnXwHXHg7K3G)sp_Esq@fq}a52PJmZIe8M!ei)FK+Ecc|}HQG3`Nqd(Bz@{UofPK23%;CvQ|g_Gh4(5D&Lq zfOF8jeou~d4mj^7(TIXXsaq9PX^V1*bF?i*6w0t6J3naNGu1$^Tk*0T5-c&tg;uIJ z)&$P5PoZYQ7|826!uu~@1=A&B2-@`LIV1;|&pqeJfr=-sM_Ag}de2}8RF%d0?E`%iw7C*lkuG(KU9(UhQ+WfhqMYyqOI zk&jwLMNx+Oc8j1Tm`PInD1f!HFXA$=NE-KQ&%amEaWA%K{qmT>sXLiGzd%OO++|AX9_*nA2TA3$+vWkv}^=tG~vP zb=Lekk{ShCQo*l=bHBGXzq1C>U2_Ep@@alp9ZDHMrLnubROCjI{M|kZ=wf!6H8hPp zkN7Jo`t?S7JUgWf0nd-wG6Q^(JHiCegLll zXX-5w59RVNZ1Lh|;(d{0hvN2Ae)@j!@5aiZD zTA1yBbX1XnCUNcqmWq8>`Q81I0r}l`bs|I|O>~p57bw$kr@_z;+J!jYM(x)o!wl=l zWNdC^{ma-x5(rUyAx%<&;x5#gB-cV2u=>R3!|s@{8VUA6p{nqT@f6#RG<74Qx5Smy z!os`_HVyDEXpkShu!cyuho{dx*%6>|O{)UWO7*AN>~Tas=H`j~XXo?>evwG!A8!iIGFFAserFkL zz(OU#xw$8oKM2|JgBWC=ad7=8bK>1W<~@wq180yK(y`5_98i7|tX3~lL}X3fSed!pp~*D+yc@~&-r z#Tk22n!7F1knhTJn3H6cORqm6yYGE|7N+SmShJ>0s1`h1y|2?L_98Fc)l5wRbRQoK z6f4zx04hJv3WmU~H+RXB^z=OG;2j()o=HV@PxhJEii0y)%t+Sk`2-AG?C|9_L3ZNP zA4qx75N<0ujiw-@L7)*rNk8nU;fq!?oXsPFI{}4Bb8kAC$j<_~ZX9R;C|!Sc=XcsI z3apQU(fVK`p*z|B$PZO{i&CejvBoD%+hzBQY%ho1jMdOz&bNPeg*--$uX~*^{b<59 z&@}hjD*X4DT|19u67kR%8gJ_(i=VLCC`MO+@X!SSavTyAb5VZ2az1f&2h)zQr2Ra% zTdIrjB8fr8cP%D^55?x8f4&Pcj>69%&7@CCUX%#Xpz=ho#x3Upb*ni`ak#bjgVqQ2 zQoK8&`-5yl!MZST?V|-_#4_KuQhtKbl*=Q3;ZA@K*Jw+$%qg6v5v^!W?B%^kkn zcv|P{IKLnKY!5C>LvVXtDPM)gtEv{WtrkC()lB@mbg4?Mh^Txd0&P-wtM%`Ly07Pe zcWmP`3BqMpnTdmgdSCJefmug6DE$`P`2BE9#Oh7F;smeQnx3^=<^IbrqSr6y3y9Qc zMv0JLdWOzW4oO|=iPBG8Q3BJot>-|;{p=#9K}UyyLK-U2yAuG*D}SKnxMfQOsMxX(B}81G9v zZaWg^C-hEG**9x?mf@G3J97a@YLxjN}yAu?y4+WErRy;z-uK{*9>QB!B#>$dK+grWW zeYZK4iUI~%rSm9#aw@YcCJdx~nQiaIxaJ#YiNDQgueR~Q_Q4iTK3tn*{vtknE}Hd( zf5hLl^U=B`Bp3`A^A!nq6*EdZyqn$4I%`5(DF@_RteQp0)WZ}9(#=GBL zM%+;Sj)7{tRVpp8{`34=ffOBtu5f+Y)yDmH{2ZqKM;{V@K~mS^2tduom8 zb9WKr)17;dBp84zoh46*gEy+yk_B-3-f_}N2L{OA+&7bE5pSf)dlN8RrfTUWujkh# zskB z++!D|MW--!j5l;o$${ue_@ou{e$-32Y^z_DD>CY?PLG{#o$G42rWv1`*PcG zwBMC>f9hWlvrFLr3HYVqCU5HHz_?E`2GG1wt4N00jh{$BLJ7oIM$yXE!W?1$msse` z0Dx11)YvKLbPgt_ahL#P0>DvkJQ#xhUfjd1^0uAa6+X5vc;3F8odLog!WY6RLCzUO z+Xj8hWg81f+Tggw940_JJaX)Fq#@QgAs`3B-elLksn;>;9#PD0pMzm7 zWCq(qjN#lcUrB)8(JJB^ef*U+#^;UN3=1WE-)jtUd+;P(Wsk>ZVEU=gbH|5S2u5zZ z*6k_63=8GhCl(+9Y+n4zXwF6UdO6`1(n~ zCi8NEB~}6sAun*+WvIct41`2RyA2vavokR4PPbJ`0#6lR4;N^m#^}QHEy0Wo7)H8; z`!RDxF9gvHplEjx_d;tMPCV;{f&?P@FK{|=2Ap{IUm{Frb?M_zA2*hJrH;v^+C8!W> zTEP6*L{lS{I}K6o`CrHbF5)%2D@MMj7c80X{n6 zG~^Gris;Q51XFJlu77hGpc#O=_~s#Hg6Q19Uqe7xS_VozaEXI}w>dcH`pE3;45&EX z?X~wB>B=bQydkS%L(*Jygxa|}F?)6+8P%<1e({`?JZ zRJyJ@FA<30>@ly+Gbi4{y$5Jim3zhtm>nXQ+hJbpuXG4o4s!D;&=FhYmq-rr&L?M(xc30Zw zjBkxy0~XBC@&8_5P0!+}1$91UTv@ zz5*p>dTV!7gq8ieLgeKef5i>@O~EY$mM>^8?hoVZ9l!zxUVWV;TjzzCcVR+A@_^07 zzq^H_Hw89sd|@2FBKr8<()sSlTU;;p`xizYm-`pDo_WK(NV$p?&4Wk=9^p3o_;-tn z!W+Q%20kkIpww%4&I5oKQ#{<3sYk$4A4mb0B@<$Q+qoyhb+!Mh108wBKuUmZ`h(s^ z(f0M#N#usNQ6Jo>yT>1P>Luuh`$i0|ECAq|ipzs`NSi>3Mcq%u8pz9$<}k)W=%)KM zaI+5=O<05kmrJx>svY$hGC?#G{^1V}f1)eQO?kHlwe^JdfO3$gRcI{Rc|{Dh zO>1neB#(&{MwoMseQg;xy+0q1p+txeGRfRhxlOmqC~071Uh7yyw!m1BmCxJdG1@?C zQF6V8pHYz_uHCZxBhKB>vau@9K+bd4KCGd~_V!f_yTOObySRBG)~~_JXe+8wjQ=bT zXR*Mew&K*_)MV*<6skQZXg#z>N4KslQSvMKnq;?B1>)VJsxlAx6_FbCQ|ABG7>!n` z+LCfAHRv z6{cPVVbgsYCIDPb5V*xg31Enc*JhjW|Kb0FFR#$R`F||2)up&QFryhvo^>+%+#co5@!7q*kI)RlzTE9W7KEGwZ|+erWhS zT&osW6(|t1PQ;3dF|7t=A_5kdTmV^}c73@Q3DE}q%a)|Ey`(hMU|0rfEYzL)yga!9 z8bz*@lmKso;W!tk4~dcDVqhxO)MPijH4qBHtvzfWtRti#3-~06UD^Jc@qs8XoJx9&4FlrV5ysxcGYX*lXf38@vH9M zW=%<3AxL=Fh$UDz^+bMeHNBo+fk9`Tx6y)lKvBiM-on=zEhNOO28Mm|EIjw;>dBZr zEcQ(Mby>dla!P&aGNU)d6D3SCEAFnsVaUAkkvuB}&T|lsmQ*TQrmpqKE2S07n#c{A z9NI!0#Za|$u~CJ^cTTeej&*X_mdfqGC#G|3g(hDsw@m3+GtG^*y92hui4})}d#^sE zTmZZbn0N$}VXYESTp_epY>7oJcX$%dhYziM5+HcgD&|Askd?`xt`|0D$;jzIjAqQE z!(B`1uHs^cUwE|RwT6T&Rl#4SZRa#ca;d4R>t(pswNQK|)2lPI=*sjvM4;a71(8Bp1jQ0ZDiMo{whp{6>aAJ%S%c9F z4R8av9=tn;;B~7YQtz;AbwQ;uBu^2x^!;|D<>Y%$da0*s?KJU{LHsYRJ{kNT;iDZ$ zD_e2y`vE}q(ztUtw~Ch4VrIN7dZq4#a)qdPzz4xUFZu^GUo?1?`-b>g>0hr~PG8sA z-&d|sUI3bXg^10p9`?suK71{8C=6?^3|29e@0n1oVlsgsQIE`s_=$fTiTpRo&s2}4=HnEW&@P*0*gbqIA_T7&3>o$H6`i9jN{w3a?=W-tF zxP=0YOA7F=)K80kkNHI&vULdX0#sziBsr%;>{2Uor$rZ<1m6R>=#us39LBVeUp}ct zw|NGRXHyIl1J)jDrDzY?G>BN}Yk0zcX!xfO>eGwgQt00#tBp@22pEPXe?&!eDx9!VsUi3eF!QW<&B-3NS+pNv{k|xE? z`P;r|CrA+i`@D7LK~`=fu*CnP!8(;IV=Wzm8%^n|xN>eYd~SN}0Il5zoS6Yha;lg= zqfDEE!>Hk55TF=94nZ&P<^d}Grnz5C_U{`0z4y<7kDJ0 zGX!H?>;FZzRGbn3*>8)iqhA~RxEjrLC4`WmHYlsJV%CJcml`cYEA=@UywC4Y{dc{K z-x&Ox75?(wd@iBO?Hz{Q65Nc~$mTzFAz&9S2i@`~<@5em5B0Zqv@Xya9s`3>a&E^U z>BMWvM^HTm`A@C9`Jw`$Sq3D*P+G0B(!Ky@_A!ny@)sy5zbz&_i43ASi@Vm9uV!*YFmi{0r?Fcb$-~f3K=1~OsT5C=g`eIYs}Bg@t)g_9HfsM+9T;7UZV53d zQ#MY90#vg)O&I4zKha2ImXy4xa>tVu00g6q%q#&8<(qVn|~VLTlPa5 zT7ciUL9s~2z&du8aL-z^Dnzyo4TEb$)0@Bo%GEe;(*?VLwM<$>z?NHuNS*8O7+*1g zOp$YpllV1BLiycPkz&YHJ6%}a%A|c(;s?}f;af65t1Jm%Y+qHtGC_`51xlS1+pE%O zx3$nfNQtElhW^1m?_grgis%-9qF)o)NEB|d4-o-=ELRtHB&ZZ6Qe{)5TWow#=&{N5 zY-1Aob^u&Nwz~X}@%~I>IJuF=E$YlG{%W&f+drTaJmo*i_7B7h4W>7790?t+blqdx zy{AfRq%|mGk~o!nTo$j*v|$^5rg<7KvhXeA0m6V>KiF&=vRwz~-8Af_VWeYoaivT- zKpXGQhUgk#9FlioqQ+&vu{6nJLd@^UgPUonNhjB#69o#=p@BLRw~%H9=_jE^l8Asy zPB@Z01?ojTjl24Un#!GB>alL=ici6j!g~*WA+BLrtjaAcbz!FmdV~*RZmvk%=ySEx zHMoSE8NSL5t=$Vj+TdYQ~CNyrm|fjNLgq*wq`_HDdiaQ8gV&q z7E)5P1$^a`5-OrT0hC!#-lGP}k@SJ1KBAut zM6PN`S4Li7Qy+|KiZLOcct8%jY`E_{*D@EcO81c|wj-_$376N7s!29XlrXzG9`OAo zrMHAZ{xt5H)jYYRa%aNfm7ef)ln%&D%$^dhG}f#@ioh2mQHAm~1jrke`J}`?yq+>C zoO&o63dht$M8@5rHueV@EHN7S&!Gg$Ux%&oXw&_HkuGxP@{vm}Hqz@lOQ({Rp#4Pr zu+ha8;cFO>O!@IVW3XrXJ<{mUGdO7TuK%(JF~?d$Lx^jWJoR>5cO)vkWlZ84(4m9L zPA6xiky{u#jOltcx}&1f6BlbmnZ+edvd~Gf2L(X;L0Dq5HZucU>+4XkLEa+?Weup> zBFS~r`js4e)!2ffDkWj;buxR)eD_{@OT55CYc?uYO%r)VH8BIpJCmW>jA4w?jPYCW zsGr;FLmCE~eUA=(6~_Zdc`AHe7FgHC@4twbxcMT0*&hH)Gmo^o-|p@h<<;4N>kS!2 zFt&HUTK@p}!Bw@txeWlXVK>o=8y@$tp~Khwd^YAaPVv$a!G6ycA7(%tI`+S_B|Y*h z)z}%NYrs49LLhWRV}zgJCn$T@@-Q zEIl9BwOAvrN`KBp8Uq9@;rO~0(r6Vc0Vgokev4Tp2Qp+d{GlF6T&+@rz38^HuP%ZH z4-{wPP-{U3ij0&$UvxCda*(n0zQnP7F?W!M4aLZeU)skz9{w)KN)0O1H=aZni9As_ z3N2ADA|O4cjnz*%8Q|pcy`iUHd@^JN)KE~bD%%m{X92YV#fKtskZPgj2+#M@NnsYB zaJn_y&tX46Ko{DRuvFL#MkM4E0bD5kBsAK1@HMy)@9|0Kl<;1AqRXcm@HhdrJr@(5@`10dEe=Oy^7F^KBFQNUD*LNLbEWfD8~qxc-MKk+hg* z@=pTKk^voWM|~b#`EJ%bTZu7Fh;iS)6eaMkWhCh$UvbrSqLx8c3ghUm|;0d zcMuZLrmk_41m_D)LnG^kZpX*QOX}D%m-`*7Ahf8#Kz3Tv_vrJ_J0PO0#2L3fN$T<# z?GpFtnQw>&@MlAS<9@2NgZjYB!ysyL_FYUh0Qa^;dSN2eyOPhsd}eMMjtUDIS`#ca zNr0r#Z<@hZw*>LLb>c#xoL_m8jmtq$_$nL8WH-Y^S$+)$5?g0Fg-Qb*4(*h8JH&ef zyO`QHVCC1L^W!JrVlC9);diwM-#>F#4&O|0I|Mu%uH8oTTmrDV(lgUl^2NhtGB9ek z&Wl8JVCs3uM|$7n@82J^#Q;}5Dgt5I=cBEm-cXwZINN>Hh@*q$b!hEx9MvA>}bp(i`}aBy!C!MFB>F3? z-o(2OpH4t=m?<~9mA5>hbmE%qG#~HiTx>|2K}mAXNX1!+Y8-lzVDI0UaJgqOxdCEZ zko0AqVMJ*qCV|zxCf1)KreQm|@YS#*CdF@^9v#6l-gM8g57@0{`>OUDHn5e9A6wEf z-X{P6XROJ+UJi-6{7`@}3Hbu!?P~2V#NO|u`Cl0$5+F7F R*Yf}X002ovPDHLkV1lEyA|U_( literal 0 HcmV?d00001 diff --git a/data/images/error.png b/data/images/error.png new file mode 100644 index 0000000000000000000000000000000000000000..c6148f1733867eb7d021ac760af6bd4c2ba4438f GIT binary patch literal 6107 zcmV<17bNJ3P)Ceay`M``@D@ zpsJc#qq>W_8Pxozpe9Z@ss;px@c-9%cz5%V zKM6I=EL6(8P_=E#zp&|9g_SD+I*(~nfaFO^O&IsJ8XV@q_f>nyxAx#aj!v1Yh4cHW z9or9M^Cn=`N+4w(Ff|!?ay&3`ff=dkCMPKKb|~yzqP()~p5=nm9jlIFL9J zY7`*|jIpC{M#9wOt7_SjH4owT9^6O3+^nkl^2?X8Yi9}8t^vy(Fny}Q*4Y%iRtV$A8pJVf=ufb>4dV6w?^Fi1x7Eew5=mCvCL?S`5;@%JIb$9@9mj$L@&|NKbM6o2M)C$;I>cd_X?g=I^DSu<`r zA2A4O{BWo*HUpRT1HXO_oc|c=!;MhMtOk`u!o&$>>>RhL&|td<6tMU2vg*Bkjno^j zZ)BTWiWSR&IkQ;i7|uhv^5LP(`$(ua+5Me+kIoB#ziFoO_CdY0ghEIyFp6WjFiJX1 zo_Jl&nKe@_T2S-;-R*t85_fgxYRcqj?A~<+PqWdPJIA2vlJf(DfvCa2X12W<4E?Jg z(LSbqVz6I7g-Uyk|9=rnBSldlmMt2>AIj?_;5Ue4e8B4((l|?c*!$D$~IPiaJVBOlIT^ zPq>*5I)n-1Zm1bk=iI+#yH8hA=4M`acHkAds59$Nv_oY2_ z_B>--RAkEU)(LeL^dfca5|Ld3G#-+YmlKL5z zELPgiPLzCbIN;j{@azrs6g8mmCEzl1|1u$5eiMo?3evaZo!4jK-8W|Az~7c3?Z-{H zUL=s-p-#L6HHX)c6q2S%7eFtK?;MuOSE1fp#{B{#z!ZW+ zm_$NE_Cci0{*_886^aF{8@IAEP-)D%QOh02~r^h!kAGdY>*bK zkdQim(UrUZbBd6;dUit+M_R>N&n_*lzn{T*=MGSD{!j-gd>5(wVwYZ^ZO8S(E%^D{ zWq4{v2pToCt`vZP=<3`Y*(W(NyZj2&H|x25*4pTs>7YYMo}9^XT7TZp!)=pQOjIkD zy1ks@P^h>v0|Kel*Q00aEH zAmi9tL+TW4=k?f5k04|Lt*3)PknMETkj=`cPs6)k#(Vq=(zaC5k>l8zUDHBx-~hnA zC(xlStu=RXLBKI?fG#q8FFt3qO;8s$;X=k*eErD`L`S&5x^|690hpUt#q22qaQ-X- z>gjWYo#j(3fkT;Aw?i16bV<2%3*&t~oH3g6bazs*(TB7=ltzc84(;iDs}@k+t)TX? z54f<7#?ZY$4bW^OO3!aVLE3V>``Q=;2XsWuniiD;s9(Y}w&VTD0qfVZb1>{~PioSJc)%hxonQZWZ0 z#SCGw3!DcKNNLepN`M^eX-KFC-PwUT`X zx6|biWS=3u!iZsIYSzs0_ZZZ7{%0Icv}EoVVF=5e4;!7%9f9U_x~V;srybPiHGnK? zK`{rP#oQAVa}1{08k7{QLdK8tv1v^Nx;Zz6gnE@KRc?V$jiu1X%MmBP<>>5!qz@;^ znz5H45OriV)G)(L0WkzUlo6pr7?bn^&lQ^7xi|OlPEKsMYV`eB>$`TQ^N#~|wt#(O zU}<&Wlo@c^8px9<;M~8MxvSYKT+dsEU%s1#4J*RYxx?d30ZUj|SP+Ccs#U9os#UA< zchwOe<$^2O1ZYehNgrIGo(Paarqe2>o-|u}B(2g!W2tTwpe(K2 zb?;(uzEOR^wgHrTL*RQlpJucizUMrLA)2w7DPE3Wb5ilcSCg@1ULYLX*rQIJI;dT{ zHmt0y=y*+7T3VuEgE~l=>5q~^MvpOdZt96aQ`FHVoFcOV2n2~lSrCB`AFCJ@hk2jv z?#!dRe3wcbxf8)bC2;8uI5Yzq)&uI-HN0*xH>|!6Af3^W&rm(jYH)tBW>+#(aPZTy zn3&WXtsLyps8J)-uU}s?8yg!9h!er=e|t2_iX>_zg+xne7eq^pdXmfNc!6bBG)VRw zrjZaIdxZ_!;=6S1&)=@<*9qX}CJnvZfR-%`j$79P>ehw|tiz^<0Me@51fYY+r$C)w z09CXAm(I?`*B>S#X}Bkx99!b?#~+8iy*=#g?9jMzW7yi-qOVs6q#t2heOvn6swr!@ zPhb>GWh%&&$rOUd4DETAU*U!WGv>Euv`@=CJ&K>RBIiXdnR&a1|K#LYF(5zWA zG;P`xi3z=tb9}ZTb&4f*4C!Mq6HUqISnU+8PbA~x zJwxfF2fB9Yg!b**qix%^aCCG;n>KCGv4a!VE)7NTX- z>N~ae;L0DBE)R9+j0Hnl092=iT5+SoN^pjPc!s^ena5~$1Yin80M$e3DQlcP&DcV|c46CdtL!1Y|FKoL)lHRE_q>^%E|3P2V?9p+wS zBCA0N+i@AZnm|zg{SGMC?oM}@=@s85Pi&x_<21B)DnSE=cy+G2I4@>r4)t^sI_$^} ztqrXex4sTEf;vkeX9Wx+Mu41Yj2kB#;+M~Duw|ta;-dS&hfS21mlr%eJ>lWuK_I;` zdSpL*|3wl?3n+p`OoJjuLb-9sS|p}JA&??k;e4o#>;}UFDSq68m_mq*C}HZx&=2!_ zf}lEgXhi`3&>9^}=Cba*g&C9&bN>)q;LJ|64g^4b$l!h;Lx4~y&+0&$Ye24@u*dQJ zjj&~TGfsXy5g6bPKR-YC`uY-v5BxYpNtr!_onkTtQzAf&5KMp8pqPR&08!sgfJ$UF z2;z=ZAn579GO0pCKIXLA`mO;8HP|(dLW^eCP@96LhrU3lUkz$0S2~k>|14T&HyRtG zOm>C>Btw7@PKHxCkgF$J;K+w|Shuh_5{CA{z=0tM4h}|8P!IwG0}&P)h;=LCP;ioC zHEq?!d2v>U!B>HCj?qyL#R#d8)1#FH5Wwb3haiz48?_;Wud!9{eb)d~*Uq(7JIA+B zk3weZJOQXq%>AS62eLf~fIGn~ZiTb>Z`lK6u}RA8Y666N1p>Kz+!2TNHN(oMS`dIQ zh71{k!Gi}QJUkp>VPQNg4a7^E2jIeK9e^JG`l=fNXh0-IbQl6;7AwMdsBnKm=wAVX z8Wz9%?g7-bZlfAExOBVoB7Q2lC7tK!E1Ua)Yz{xOy=mMPX1kjJaWzJV0m!A}9r5*B zEwNyVM1UV+V`C8$6NBjJXhcOtV*HqJe7@HOCFv49v~x2}@?VE=8w@QP1O}~eCe$Lf z$Nl?NfS@A6b13Nb?h1mks5%YYub1b&p8r-9!ozevm#UjX;mIL&>HBl|!5R?m5VO4u zK(Yi#FD*hY|J)r1-gd(3`3^`PAB0hyZf0AYug6O6K~KwLi652p`$;(tGK!)I@F#YZnYUqzMr2{PJ`l%vmi$bRc0U%N~flqkj1EZFju2-2;1G=!f@S z3BgzIc%t}tUzBAU1vN|84;=^v^%fw`gus%k0g-fJ$vw-GOCah9BV`V&k~dSKFG1Xl zgfbP-f3G~I`-c#?`u*v6Mg`~VaP#vjb3UItu)-&4oY@tOqw&z9fc>}t$rm8poa9rD zwFnU)k}iB6C^r(9ehI^#t!{`2X~j`uSC+qld|GZC7R(99-`@(s#gjZs$QCiZO;F2$ z7z7oW0z~gWq~r<^Nf!c1BY@}m>Pta2g12^8 z?lc;Qljk`7J;z>L2U5r(MWGHP(GVd81X3^zC0Vifet!^R!kfdciH)`sltw5iDG9?8 zVvssF2q(S@Kxr1mG*|S4d0Sp#C}=sR6^5&;m0STL{fAz14f>(pCyYS^Bh%_~2&_(l z{ufompeer#fZ<_F$M@07DgcP;Yp5+M@|5uyR%bSG~V zihhp6+dF;G+och#YFTQ-5ZMUz@82KZ-d>1}bj4Tu{7{m~D9ba^4=K0hK-lDHC0BY7 zz5kGsD?lV&j6l9;SDMTek+X_&2%098!P9+e5qJad}cPs6rU zwx_Zgk&THd5WOY~kYq!I5Xg<}u}C`{iyiCxz}>YmYE-X=TD59vlc3hETXQhd0#V`Z z@ZJ6ad{#)Ri|7Zdi|9w52&$A@qo8U)r2miz5g<<YykMGTfmy5Jq1DxE(^E|3Mz= zxK$3o+-wq^FRlQ)et2^?3qVuNukx%`|HwD6STMoq7f85fL8G%Sc zwvS*2F=~4;J$OuC9tnQF=T&e}bOiuZ{)TjXN2TgNoZ*$uk(74Q^9)S}l`^ngc@u~X zD71lv5s0>rmk61Q8@V%Z^3W)}xqTo~XS*XZ)RCLa`mk+Sljo=n@zj(aIC*d=Q$?za zQBVt5T|_@LAX08Ar~<^a|ER1X)6#_za+DAfSxQ}dK*>=(=MTz|4vG`)#q{^qYQVg3 zq4NhS>;7QRp=THmJXbL^4|4mN$-{{p9(Lr@&e4hlMrA+@5mL%Md;W>3`09h>sL-`a*G#|QRs-!V8 zzM<1EGtU>Zl1$-aIRoju8?~SZ#n6@ggdE%w0>@5rmU)0ropdOV0(krZi4_tR)jeG_R<@R~gRJ;EqB%n0~`eZ>nD!8KI$ zX{_-hxvBvayH0F|+ORup%f_f3yG1#q?aYRWb4Ts)#sq?rbnx~pR^A>y^xJTl${yK< z&abL;^(z7Jd+$?C*(r8?++d;`VXV*b%t4xpcR^`vca%hT#q~&MT#s_bZ!s)caa<+c z;`#GXXCAV!qjTjo+<4a5iwCalI8|!E8Kay($WT@WG>>r~ATvrioRKpM8QD2<<0MmS zfgtCV0>PO*fe8dj2Tc=tx=e>lSHrvzHrA~<<9{DkHOgolcRxzAG@Lic{LzN92pPp0 zPoL0)n;toW(;aU?$K{MdR$q5qR$r#qy5n+!#R07L;06Uz8LC1V2PGfz!7E!000$pU zIQpKX8aI4hwP<<_Et{8UR3DYKUP_AHkcVo*aMk(Hag6s`61+`?Bs`LYYgO;N_miP`OHK zH#7lx6eg!o?yTpc-r|%T#h3T@Cj0&%+452Z^`WSY!t`Uan5c_9H@w1;Q#vca+f0E8 z^s|vny#J^pY{HY3P;MR)Nox|z#yVd70Qb~+95|L~lh=o3CIe0kW>cgee8_>Q9D~Wz zB5|w=d`3Wx9#x1*Po{I)vLF8aR%1xSbTv9@1b?5%ky9A8t1YYD-91Dh-}a(f+VYto z7alqW@fR;fKkj{o`f}dOROWN6nlWvFTDsU5GiNxn&NtwF-~aC%p^8~mQmoI1k{tL2sBUV( z{GPliFFq;Oms8m!-cYh;9=+xuW&Zp8&cKnow%C}|^6U8ac@j|(5nNdxKA7R77N+## zcZuB8wyj~`_YD;Y{2LrsHJa~1tP%hK002ovPDHLkV1iHcr*i-R literal 0 HcmV?d00001 diff --git a/data/images/esrb_ao.png b/data/images/esrb_ao.png new file mode 100644 index 0000000000000000000000000000000000000000..5004a5ce53b7995c1dec5da59ef6c5a52a6e3634 GIT binary patch literal 2884 zcmV-K3%m4*P)v+AoH@EKE-o(Ki4!OORiHot|9`orNRh(Vf_0xu!h{KZ_wU~?D_5@kr>l>T zk7Ui7)!)U-%gcY=x^-ef|4-MYOP5NuYSsK*K)q(o8taD$5h6(Z`0@4K)6-KdN1^Yo zuC5X(QY3vwj~-p$)1*lwY15{axN+l3mMmGc-OR%~ZM?g=xoLmqjTSAMBuJ1zqDGA> zF=E8fv1Uxnm@&2TJuu)UOO{BbN|k~FW|0dQE=cUyv1QAaEpqkhRjFUUzVztPLy{*? zE~7?`(svd*a^#5Iy?a*{En1{UHfho%oda+S7cSJX-Me>}6)RRqwrtsib=tRYuk$r) z)=cLqSg@dusb0Oh3>-L6MvNFC+qP|!c=6&%(xgd423)gdO?mtFt>ns;OGb_yDLHcF zkmbvl%a9>Ml-htAK76?LEmNk93>`XDYrA&sq-xcw+MY9KPFcNrwJx}E<3@S>_^~u; z(nQ|@#VKvrutCfaixn%T@0_?pz)*mJ4H`61kQ^sW z&m_r`C6fsgCMZDqGU>2k!<021K71&H1`X2oDpjh;*s){v9pKlmUstfa4<0;N+c$06 zBxA;m(RTn>tXNTc_39;4r%sh~=g!IY?c3$alP6NAP94X9ne@t)D>8HDOzGRVukzEf zWy_QmpxBftQ({U1>+36~{P^)hzJ2@l+v9_)ty;AT9x$Q|J{>o1oZe=D zho;=PaYMYly`^>Q)>6KFd3pZ)xj0)ocI+5DU~VcGZSv&FS~qXrEPj4|b|->*h$}82 zqR=vrDhyk`Ytf>G(}0;fSisq{XICMQWiix)4J#*G_G`t<1~ zN|Y!e+5m?SAO3TIx%KwSoH=tOckbM(l|pN@lqgXm*i&*EFrwzyuU|n1q34~kv``{{ z6|k`p!dek!NFNL(*bQ3*6~A}y-T;y%+yIv?Th=MSXsoGIr%2?;k%N58pFh7tJ`WRM zjGVB7MQa&3ZCOxl2yBxsUAm|uGWIfRJKO*po7G;$b|_r9uwCk**vEIJ6<|< z=oDaH>9u)YGfW9dw4wEIktmxt{Z9cam1DY!_k8aFYgn919fP%p26YNB6X0k%0*t<= z7*E9T_UY57wf*?<6OzEqU6LfSSZwhVNyc;;(&jj02S}p*dg`nHjp?m;woEsBut{!=af$XiwrLV7IX?Q9<;l=yF|F){z6WiIBDr~ zS^WL{mBRRV7cX86A5C}j=1p}xL$VbpuV24bcb>Qg{+w+eybz=YcLLe|_T5`m#~nI! z(BMqC*%Is==hP8kcpL)>2Qnnv0tXYP)i$PvdWQGI1u#_j8_`K@?r;H&di@)K;q`+D z4>}K+D9qoA0b{XYhB^h9kk#J|TytTa0*rcf7DPx=#hY2tt(2y2D?BV{5A3t7s-gp_N;Aj#i_#LpAr9_}!zI+)rz@tZx z4sj8}tFKCT-yAp$;s{=CJQKOV%Z2-mm-(f8lsJpzM&qJ$bSfxnP6 z6mex^_x|UAZSxRDrjiPS2gyfp%v_Q`RYDE8a^=bzx+e`ru$rK?GttO!1x!#naKT0T zFH7gnor4FAUCL1tIX4vp8{?Z?1C^AkdA4cOMm^@1En8|E?>repoB3_t>2JoH-#l5f zZQHhb!TE0H-A)!dN6A;)A^kFWtm}oaBMJQ|c?%kSPXD#|N22i9R zu+VrXWOeM=G0mt#9MZuiW@i_0&z?P%g0*YcwgM(OL%su*2_d4qibFhWwC z0u-eWbCK;N)xdn@jgcl$niw1>NXV5GFHZn7o;)3!T)%$3o($_cOf05Oomv4P88{Z4 zLjW)_nNG5sSW<+purbJL@{K0}Lyi!Cjkz#}=nrq=6;nAmD2ZxjJnY1Vh|LkMCCNiV zp1Z?u`Z@%Rj3xSlF@nTE-jWKVlI66O$9Tnng*^y(8=$uK1s(*Vk|%R9r@f#I1YpBh zX%L9@VV@9Fw`AwBlBif;q`gqNxccxieb_maCrnD*jX#6n-Xs1vZWHx^I%Y1uV{0%c zZaygjF0;vDGZ+0nefp$wp41z2pE+|zHykWrC}!(?k`1N8+a|nEQ0391N80DhmoGXI zl7)U;CX>74xJ`l0;QQ&*r(5k~ejC6aKYrA92m}kk*Cy&@LcPIK*c2`jx0P>P9&$jkw+hRdDpI8IvM|oKpyYdvBMgrmNxj6d2H80F7xCP^PPTY&z?ov_*=lctg;B{pB8rT3rn?#G{3Np i4NbL3m0uRDhyD*q$jbVDMrsWJ0000J3ZYs|EVtPs`2sh@tGDcUc3NbU*DiinKJ#A9c+mbB?`1-{hyEhPr%;2du8Ls zjk0dty1%xcIB`O9#HjT*_2AwwiZiWGXkTeogfqeczs+qbXInKf&clqgX`di3Za)2C0Dkt0V+ z+O%niW5$e;Lx&E@!Gi}C$d@l) zBwMy@a^b=Sp_MILR$uDu*|XBDSu+U?43yEMM=O13xC9&!5FjmDw2&AvV(8e(lPC2d z6)RR$U;zB_de*}5xd&YaOXFeGEfj1o6)T-PE2V7U17=~KCR z^QL6Ul0`)X(BsFCS1#GLR$uDj!-vX|(xpo)xO?~RDX31JIw`H?%a<##QKLploH%hL zC@4rlCQh7KY&M%TZQ4}Moja#sFJ8PTbLY;LqeqXb7}DeTvhBZqJdj<;;tQsomaG0slV;Jg9cxN&1inl!17BW72xUR4p; zv}u#R?Ed}xmBSxCe9$$aDjk4%I5NnaB4^Q~N0;Z%pX)<>)g4sym;|KX%#G3P}d+1Tt9g5Kvu0-=FOYs*s)`B>Cz=>)vA?_vt1iDY>)^MBB;#n-o0DrAQD&u?jg4o zDpZiITenK2NRcFS=FGBh-#!%~XdpU>7F-21W9&$oGG$b;;O@kU6QyLyl5*t85jlSR zxQd8b?-VeAFl`WU>?k0d=7s3|H=V8HzTI2?`Og}zxzBIHgbDS3?AWn&J<7^2b5Shj zM2i+ppUt(Q&3%_L43{1~dL&#M4M$_&zJ06x-Me?%&9xZ|e$Ux|EDQ?$^XE^M*N|vB z{zsp%9w7p@|JSWXv$26FgOv?1h!f__-G<$F2^hhjI(4c{o;+FQ5$z63!*rpnhYufC z$ANP&3WN=}1aPigx#ZciXR6JJ1PbCwW7|<4Y&T{vR;*Y~;{t3krZU`svuDpPzkmPM ziSBR~6Si&JHg)4z2;8^3!3-~EDPU(?j4j3N;exTh!Hv5oo#4rGzyvA8%KiHF(`X7) zV^z3Vr%oN~0b{tm72gtWBJ-94#tacFcmps_${q9Ou?*L$Rm&29cr4sC^oY=K{lpBG z1BQ55IhZb8I%(3Ri9U=t8PDZu^B6Fkh!`=V+d#1%D_5@6z=+5%yv<|4`2F<9wfGIff1$s!17WdMzF{ z=_OA9a9NDe;iCOA(xYbjupPW4tNL1-yp;$xFh^hPJMX(?bDB?WH* z=EPz-VDiOQ0mQi!Em~B1_wFrw_UzGOj^%*KaE28iIbup>WRFM`hUT6v0Zh&qd+H8A z>TDdbsJ-pnxl;>1|CwucZ1wBccM6aIse1M5GHB2sO>?=5#QsyjcrMmZ9-vM^A&>ya z96+sVmH{Te3&1yT-iSAwOTe6P0nKR^mr9u{Z{EC;GiS~}W1JAUCiz{gSTXVQ^V2!p z!?kjc5*YWnCacd{#+k=@=9=g5%e?&g^J}Th&|p3DU6#E#0UaryG)rF-}8nnWSp z&x1)?ckS9$m54}-S{nsK03a6Bi)+@bskE5ewryK2mh)23g9aR94QIq6MT+Pz`3WjW zRFa@usZu3fkGW%Ah=2h|L59h5=FE`+0|saTk-FK!g$uRT#zK^eS_nWWvhb}1W1J)i z*r7#nk|H}1*x0dSbsjIzSk$p|66Uq>~iqlLd;0 zix)3eF~A8?v>`J@jgI;X@dRNkif!U=r+@(jA>NMdq%w(kQ1t-}xe44dMRQ&R;M`-3 zhr?ZyzW@L`z&c8>a1ggkHj@_xBriF9_;CG?$3rZ*W~Xs5%yn67CcL9+X{wjho*{&6 zL(Eye7f^sSpDUP749r^09<*>EC=lZupBzIuCrrf0OHk|~3WO%lLYtx@n~I`9^}nA#T+i@zLZvckbvMY%ofLlFXk!U#s%m4_-V(Cee6mf2JAb zWCtis(4dQ@q1bLx3+$jT+l+A^`zv&*m#BI*Ng@Cr^Q0 z#q9Bg6xwg*U~~CmiZBw-#~3va=rd-_A0mWR7&vgC-oyH!BbZd?m=pFNz;=*lYKxhSjCLP)^3|uI; zT@Qln;C&9*{kF|+H*NOq{42XXl(qT$``heTul)lhygN6XrKV2+00007spdusX0|rPHnrXZQHhOV`|&B?M`jmcAJ0B|9#GH_RY;}UYfMYBs;Tn-`l(R z?(XrqE-o%EBcnu#^3Bc7?SCm#rVN%9Y_6`ZKW$i-xI~X0{pYrA+hqCj<-xk{+qX{u z@8a(6?zMXLYO$dY)^*C1DdOSb;pGBqc0gl@5FsRD#E23hLIepFDwKo?6UN@g`_Q37 zYYiVhyteZ+6Gn;@N&AHi8B)T93#VhL^bZ?0toC7E+W1W$(;g#641Kbu?Z)-Dnaj*S zY0@MqUc9(>z}d28lS`K_N%iX0Wx#*|vSGspI?3hBmu2eIsWM~641G6Z#0VKbe!O(- z*ipwNPo7+^U%xJ=PMwmGBS*^0l`Hi`=+m=jPnk1kjzo4D_5@QF4wGCBiF87 zlNK#n$l0@JW&i&Da`^CJY1pu#)T~)kUcP)OB}7JZ%bq=ZWbN9ua_-zY z*|>3|tXQ!^LGRqTQ)0!6rR@M-xNxEVK5*cG_Bna-r0m$SL;tgJo)<1$kcST+O6JU& zodeF7FQ2@B|6V~YTC_-kcInbZ!OfmMTfsDI)=ZKlNh0swy^}De5B%smSwQDPV zK6&y)c>x;bWEU@9tm6=^91OR^?>BGW=xwJ?o!U9zgb5Q$zkdA`Fm%ZV>esI?l`B`4 zI(6#k>B109(xgcfy$QqJJ$m#|X5zFNQ?X)2DOawXKgz9XeFo`t<3eV~nKm5ik`|!&Sqb(V|6D@nWs!Jt8f3 z?AY25`s6=i%ceE;2?88ABibI|acs(55>kO01M({^q%mUS_RSPg99W5AWfPen{DWyu43UJS2@7}$E0~oV2FkB(* zmH-Eg)#g_K*adhbxKw@}gQ*&zfU&~-vM|OzUIVm_t@|g&M8cFUTUO1}00WGFXDle+ zYSN@h<@@*V-o|2|So`3)lrLXiOrBCSvjWDO!14=p zz?7ReZ`x_INRcAmCg{|mlSGLaRU(9mD9xL;P>YQ6_U&7{Q)+5JH~@YEjB9Qd#WuE< zF{8#vn2G1WBN?ezHNJ%H+P=Wx+w%qtbhpz_*UQp!cjwp3{l@LMT!*O#uFn!mj4kj?zS1k zJ7NfP=gyU;O`Gb@9jz+Jfp91i#H!J-g&#kD{2Ne!01%tlH(5?pl~CCq0b50xPudAh z1Sw3MI8ir{AVC7Bi_V%g>o>rJs{EoUk@bE8Oi;u+kPs;$qxS9FtBcd2LkDl6P*Z6$ z;Z##`Yzde6ks2sfF@VH{J?aE^-;?HN0Etj6iOb?fHi?KoCK zWfa0ye$sT<31%=Blw(=8Y?+-5un{PXb>#HFtyp*dQq6F(mE*Z`$5OOtQR&pFll?zT z;vc)$S%uO5%J?CQX(l03Nkowt13_mZ^jz2N+qbnZ@nWK%{|Xk7`svfBzXJ@dR;pCV zM`>WS%7_Jf9-rx2xOo+V2&2i*nz(NKDLmcf0|5O_WRT2Rjm-zVcqml#Q z2=U|kSPRkhmMvRqOxG_Ukv>R*nKNgqrVO%B6}b_j=%`+7iDb!=sezADDqOg*G-}jH zO;NH$!6LTiSiXGuqInDA7=h|>1ef9~;PmO!OK>Z`s%DZcojZ5dM zk*7oDvnDr73fIVW9|6;eEE2%UX7bqpPGTE2|j{_^$69H<1--#r{DaT0ucN#Q_c51&?F)ba$!TrWu$eV5 z$Xip$(a|q{{P=bUm-sMgW2B2Iq>#MC?3`i0ifnq7g-q z0dkm+G>`_Qu1p_DhJ-kJX_N*@52vB+-6Hh|Mce{R5WJ)^1_Lq7uGHlg5U z1MjljcFLYMt>tCoY%d$l_*i-8SpE9muWioe1Dj2JdfKoa`9GewGoEcCa8v*Q002ov JPDHLkV1gN*cWD3s literal 0 HcmV?d00001 diff --git a/data/images/esrb_eten.png b/data/images/esrb_eten.png new file mode 100644 index 0000000000000000000000000000000000000000..4defe777deaa3e3c71d221c25cbec3a14c247cff GIT binary patch literal 2764 zcmV;-3N!VIP)f(#)%W>rwyyWU-anFzwO$!OEzrS zAZymF`6v6@wQJ?*(W8Pk( zv}@N+MvopXy?XVM%9ShY{h~#SO3RilWze8OGHlo|sZgPU^zGYM`uFcI<;s|}lqyw9`t|E4jKYhPs z$&%g!juk7GoH}(%7A{;UBSwsnO`A4J`0(Ln*|KGF`0!!byLYclm@q+x3>hNVu3eLD z+qTK^dXR+SBd+T+sT)8AmmMpSy<3{DZEnBwesj(&7A;yNg$fn&3^-b}XmaPy9SH~s&|~Y^v7=0!I8nxo z86#b~bdjK-Ah~z%o(vo~P~N|PFP}br(lM!1rojNML0I656o*v=m&71W-*d$xFY+@5;eGUu3(;q&3 zP*#8d%mL5x%e%8@&z1%a8pzazt5&ISpVof?%^Y^Tm!G zTZP}I#ykT?z@P{V^2;^S4sRn=?3%GiIzquaefso~#EBEDfI+p05hJQ_`TP4TpF%nK zzC(u&DtrhqpbYiGh7Bvtnl)445CPWnT1$ip6Gmdhh@nCOdn8MiOsU8JxN+mEdg2`bBv+$-;CpVk|as=6xj&BY?ODdpK z5g)@+z}WIutyEHR(ka4p?>!F z@85maoeuWllIit`kb=Cjb@k$DRi#|IzST|+ZmzkXdEEBs$f zwB>*oFJ9~ug$Zb#%`*mwsKnXw9Xoc+dccn!J+gcK-gKN5+Mz>-G`{m>`MP!M7CMH* zHqdLp@VvK{kH~}*upBTv7aF=4%3r;D)q21;Z{D;!(pGoEs8I1GNP>h0;OyD6Ym{y| z;7OAvSqhZ+k07^2ixwWOUa$e5J9o|!plQ;iQOkGovAmn{VusAwcHc!C-fdJ78me1Mf1RL;)6DKs}C*w$h#Dr5O zs^)m_-o2~9h7KKS2Ta1mReSgDoq{7bLAY0fXOB@CU@@K>L=5XaK{D7@H~0)y-L=H>l`_9h;0q8g_N|FrGQD|k#wdJ zOuC~Gjyu=ng-IlO3z!rYsawkclXy1C6{zRRy@bLA3l@~AQ>Uu0K!%+hu(v_1BU^+R zF!c=6%9JVd$71-tq*n3T5Y8DhW~ktjG&Ff;mVmqaIOxY?u;6 zs8~826x5Z`lWYKr@-8V0@g&l<|RDB7@M$N+66uXjm>U)&Syq!1H z0Mi_cCMH=zC5dDohq_wX^$1SCuT7Nc1T7zYRbLXYAGdg}PH zFJ8P*zIMz+^8at|dfOe-WiA05zN2`8knqbUxR*3(Qe_zmEd1ve=LWBhF?8PH7c0lR zyvH@;c}9f6duA*r${6nPj0&tN#uyAFXWRm2(8!S^Ro7D7!|B1A;bCEtNx4!6<2i*! zQd00SEP+2vavQa0YRHs&sUcJRMnm8`qe;q_FR!%@O0$f?LBeQIO``0@{B*2p>C&a` z*6$C%R6NOvk%yQyYnHyu1}FxuTD3|+Qv{?!zh}=L-3-D--Hnu1&z?Q)^#)V48?I@*$~!_4Xs?cQmKiD z$J`zZi?9SvIQ}aDP)`7$3W|w^&p0Z0muQ0fbXWz?4c1@|=Hl}LR2*Rv#|j|)1m=bB zDXXz@>d+7hUWFwLTj4)Dnsm3NTXsei0q>E#BX0m`1H^R9FBD@^EFPP2bZ%IX_n8mi z94*(5f@IcY13ZVt*f^yz1lMssmw-7U(@<})0ih7y7kp-3<~V75Mu6^p`SPWf7;r5C z;Or#vob1t?H*eH6Wlj@X!3NA@tS3P$brs@6K7}yj{t6hrgkKRdcnsBJKC`)W>5`6l z`}VC)M8yMj zcF?wMTa{WAIueX-MWP)mO1O~dQZx!*li&-ZMbM*W3|0$+z&u8m0?yn+0F7`GeX}ml z&^{O?43CKme*+`l>>Ja|yD zX3gsFl{Rf!|21pYhy(p!oyU(KFFrm#{$8n5r}kU5YLylyOqftcjvOhDRhPnr3rn9q zeY8AAj2P0te}4%RCX7_7R7s{xnIaP>PL!4{TS|or6~r-V?bEbrQ%ROAnM{~4L8eci zF12da(*9k$c9j`3X2{H$GbLljj7|{Y!iAGMb?Qin5Fw;}`}WeeZ(nKBq>26y2$(S) z@BSHZu3WiaB~P9_a`x<589jQm0!o!Cm5v!UY*<;bVuhSLcTWG0 z7%@VQ962JVPoLKRRjXE&f&~kD2AnfzPI>d@jSL??+zE>E!Gj0O@#Du81pn*Stt-QZ z4b$g2bLQwOr%ahrwr}6A&ns81lthUV>B~!&EGfHp@0QAyD~sdsC{X&vj~`#wuU{{l zH*a==Vp26~)DVXf5X2NQh#fn&HQ;>t^2z@F`(@|OopSi_VcD`}i$skYRbSYwSu>pk z?RXwLcB~U{*|KHDaf%f%yYS-03wihMor*x{(4po0`SZGZ)FXEEW80G?Ng^9IY|#Hv zqC}B(>(*&`@7}%T?c2BV>eVZ$SFfHmVB~h*ym`8%%zVLu1>)`Pt)jtdGf3jZiKRh< z1~P8kIPEiQ)-0)Czdk2ePjb0(%zKz1 z&$LA|0GxAU3Akv{q6&nqLM#9?bm&m+%t|j^x>OHP&6+ixfRQz1_2$i+Du=8vs~$3B zNV#$2h91%rCr-$*W5?vcfdhI5TmiF-X4j0!kqZ?nB$+d3_AJAZBS)6FapOvyIB^sp zvc!tAT}E55jgcZnl6djrIS1olA*<%(BfmV;A6W$$0NBCk(W5*2vHfTjo+(GuSgAF) zfEj?7Adh6g@VS|fddDs?Ec@WZQHiifVr_2 zE?lSzotuf%{^Q4wKLX^@qerrK?OMIz*h#C@x^-)7z$pLQw{NSeK_o6;zWmz&-nnx} zcaJL`O~Roz2WrWZCBXyCq51mt>%Ru)=jSKSo;}kGs7H?;dc#GG7|~J#G;Z8Dcz`*z z2>QQGty;BGtr1iv2EX|7<;$N1eE05Mz3;ir0w&0l9qP#S%_Z|&0Y88KTz2f(A-#I_ z`e}=kCr|#17&UL++&16kb`6#cfBW`L8$N#gSPx!@4jm+K-n<^S7_Q)&xW4TI2AFNY z=wUPjoWk`A4J^YaToataF5nCqGRXJu-|Yd$8rZaHlkJzms9<;|LF(;}fgHPz5hTFy z2V~U{5<7XofC0{zY}>ZYZ5v3FJM+in<;$1b0}Pk&_xD%R$1Y&{LfT1K8t#B)&z{}m zSwQw}YY7ruA~=?<;U1_wcZ3}-49&FapF4MMT`=2#u^fT}m=}_;OpGn&nu`=EqD0-Q zKa*s#wg98ntX^m`eAn>QfCmTrja7n31+34KC5yh;)1613ZHnSQOvW zo@@g?bLNa1lAdfVoF?w-FkX$Ef+hx5|?zPxOEWg;&@DJY>ia zk1N4y1$OEKW_)&N5#wWXm!Sy0zP|PWck9+o+qG%a z#vb6nWE8I?iEB3~fYB}_WEB2w)eiSppneH=fQ^eaur0>x85F<}Ad{+BuWs26A01S; zbLYQ0aE=@~oQw=-jiNv}nmWO2f(4kEg(oW-kumAQg$vH|G-=XkD2z}5 z9(d&3ZVI*|#gp11GGyeK1bI1i>XfDX=|2JN8h@WPVK@zto{ev5Xmm|FAOZ zF_}z%p82JXdB&FGfSP)P!CXde0poIFaN=W#2Lo`+VQ29l&pFpA5mPh+W<3E#qD0(a z)R{{LPV3|2qk5TooG54w76IP`p6DCcBo&!emViRp8zKM8k>)68lSPp&@DiiUH9(Y zb%q44Svg|9m^OgH;$>@>EnB8?Or43slL5n6^kX~u{(?62WBcK^h!K-v`zKGHtc!!m zg!r%!xV#V}B1|45p=26z_?Q_E6AViJ!vT0U#v}9(0~8Vu0Wt=s`QC&ZDhHu@vrC~Cx;7gY->CTuf zL_X<9f1D=-&+$oc9$0k~zXmwu>FU+1+KxVCL<5i}rfuoaHVNPy76^35jve*n(uNgz z`SPXH<|En<9prE#kE}NBP){ZiKrBJO70V5mToj2p^zh0!#aMpLIwb(V2K8Ni=E zf7UWY43&v0G-W1)f!0yL4u0UrfE4nb1U4L>(cmLSw)m8WU$lf-VdN7=hODu&_~B4R zT%+dDp)DAPY(9hGB0wJ_$EZQ$B|^o~j&fud6^Mt3Fa%0~b~q>XGcbn?`7#JHXaeFK zFn8Isp)(o76VV`6%<7@u=x^GYe&zz=*^G~Frp%NF%wJ=t+f`Z};4{0HzrxX#$8 RqK5zg002ovPDHLkV1fj%U{(MC literal 0 HcmV?d00001 diff --git a/data/images/esrb_t.png b/data/images/esrb_t.png new file mode 100644 index 0000000000000000000000000000000000000000..b9549ba2bd816817ec774fede6a9df128f4dcff0 GIT binary patch literal 2334 zcmV+(3E}pMP)>R z4jhmzTee6*K)^pqn>KBd!ebpN+CW)ix#y2 z$BY?M9ICe{MT!(kT&GHvO5(RYSt5+}S-o3kI&6-tt;>V9KckbL#o@dXVNuNG_q(_e)(zkD4sZyni1$fGo zDPnKPYSyfo^}k7zCJ_U+)AsG#^?~QlpG(rDNkiSU14h%#1lriOYnR1i2aHyk4K$4c zN|!Dj1~B&+3*NnZ_sZ|zzug18W5*5)Ft!*G;0+r#Nb}~+rAwDCQm0NG%MR^;pFVvm zojZ4y4jnqE1~X>N7zXfz2M<*4lP6C?Y20PNJ9qBX2VT5*5h>u;uV2f}n>Xdwty_9M zVZwwkfU!reZ{NNx4RYpefXwMovJ*{K*EFx#SyjS)vH&QeC*jJz-7vmk=CtS zOTBvaEKfC*I(2Gk(V~S4YuU1;IwRDvV@Dm(M4Vc+YN__INyCGd8#Zhxv0}wizWn*~ zOPe-rq(OrQRusyeJGZoI)k>$^)+nSI$Jgk(D-WS}Xi9j&q+0li>m`T)410(C*#4b#=k^zJLF&p~=&P zlR}a4(Au|eA2DFO_weDv8pbA1o-AwEu9fI&L<`sy^ zS1#T2VlD_U`&US^;yet5Ktd%$hYzE?v45$_9gif~-TStHjC}t$_d3I3>FS zc*u|;-UYmQ^JcdI*REaLyMXWCzb}asCw3Vy8zc^!UIR=kTehrQS`G{h^e$ksIqm=+ zF=B*w0WV*^+%3T6%9ZmjV2)Al#A9q8+xHq^_#HCb(lQ5KuK}j@>(|dMz@)Rh3fP{t zbcI+wy$YBlpGhgXLLB+Yih2z&J3I1m?r3?>o;}_JOzYaUt4B}E(GHlzwmX1XA-xKi zgCq%QR{@ijCEw;Xz%-KJ?r533hgSi!-;E3)D`LTd1*LcI-nyhmmXG*f06Ui+FcD5A zr2k3ZvW%OWpI76sX*X`%&;$%85t4jVgrXwvkARsjGUFsTNZC`Jw5Ra-?@Z43>{)eE zwnkQXGVK5D_gyX-a5BbwIT_fAKC(7cbf_TlOCPBw!%rVP^qInn;pG}4UuS=w|Avoi zp5@w%#c!lV8GnC&S-Enh=6fks&6zVtGnZ`ADM3-5UA%a)P7^f{QvVbTt5>fs?b@}| z><$ivte!o4Y7GvV$bzUFQ-&Z_z&*-hB)}(5oT&B=Ku+kC%8*A{%@h`?w}b(Vms4vd zJdGbeUJKph#*LGcCr`?@ZQB$Wr37ksM~@zr%9Sf?p_}7-&6+i}&|SWKd6h*J;5bBG z4ka+4pP!%p@}h?h9nwQ7U>S?&a^}n_=gyr|(2W~6mh0EATS>`qH4I>iCM4_-gl74r z0M5hIKo%}ss979#X#7X`<;$0K2S!od3;^GvMT-;+@s?ybvo(MIdN>LclPgAqtFWuT-g0ss+}4 zs+7*DQwAi)0wza}9O|^@J{8XrB}yo0WFd!N9MoP4rshnnhL`d9CA?xjc6s3fMw9lk z6&XyXn=_dC_`=vH@s-eX=FA!0+j6~N!2)X#X2LXbYFDmY(J}-J$LZ6jt(gFuI*(`M zp$z0f%%(#Ld>!Z$;4ti9$5e*!2LB>~%@O8899RSY1EA7&sDl}58vpN2bPDNB8 zb~7$BHmT?0B>(^nrb$FWRCr$Pn`dlR*BQqRrHT?YqD?+D1Sua{`XQ~_s#Hj=)Y3|= z5RuZ1HZ2m3P^l0GF#=(Py%BrwVfNk|%-+~+Fc>g4_F?bM_x^vUe$eUV+I~Imiz?+x z$M3rDJ?H;_{?9nieO)W#H66>BFR$I8L4(ih)~)-qM~@!mHfq!;`!y{k{nHA3of9Wc z%s6-MoI7~%peraSa3@cm?4ACVyoMPCzSh2d`(__LeAumCz1r!uTfct2Cm|;%r^9Pl zQhKM{xN&3V?%liHs#U8z0qfSS^UpVL-s}ns3rn_a+47t8t|*PO$=W{`0flSUtZ^GQ zY;f7x*?w%>w#}_wyVkoyUS8foo%g*oE-O7#;rANb051~UjvYIYyt{t=x|2(|?c29| zQZ8J$;P&s|-#0z0O5-d7pNYRiz|NgJ-H{_l+{1?toic#CbLWoRvuBSdfpPKT#iErf zSN0}}8ieF(UB z@1A@7__22df%Y!KxtA_o%BEmSW@Tx(YH8rx4gtuUC~wjSG=Le9fEpk{pgjqwg@CAn z=^trWYBEy@cuT-<+O)|XI&{c`10-M#d`N=D1hNAPAYRB7j_Vq4B(uT!>Au6fYy&R2A+hiTerHRqM`ylzMsrW6S%5?e{6v-H#e8+&RZ4*+`4t^<%lDK*uc3r zZrpHu*J=i3js*!UwdOBLxvO!GoR8m=)3Lfmc_RSuJdcuKK@t)m?@K8C0`;#$pX ze#JF(#nOoXnI6wz{aw3uc^Tu+fXBZ>>z79apK<=pn>Wbf~wzfoVB&#ykOBUcrnIMNXZA5|d{*(}SLvt?*6*~Aw^D>t{%Pc0jo)i@(wMJtIs{8fi*({c+Pw51j!C&bpvmYybl4U1c+roG9@z^1~Pb!+O&pZttDG^ z#1J)EzR;RKNSP3wTwCLlQtMs}0n@RuXng9_DG!nf89c|@B_$4^SHb2Q=0O zI3u)rlmK3HP&ko6P!jJkCuB1qoc)oD<>{)+N1`A{&*k|GpEYHKz)+`)K z+p`rp@Ncf03iv1y5F73wng7|dXFk?IJZr^Bp+ZpzeFipUJnD6ch?s(_XDnN`td)W1 z1S}44Kv)pt;tXEfCMJ|~C~2_b4si$X1IWOKj}@sP42}@UV2!qkf`sSKpT8XDf~pdm4S>aYw_|(Vg9g|pnyW9 zQ9@q4c;OWSCJakIf+CGEVZwx^8BLouePjOo`THS(?riDi!&{r^YlndZNLeFFgsGt{ zt4EcPiVCniii@VwxQY_Bf&*n>Oxywjz?zkno^jk1en$1BwrOZlm))53KLRr1rz|exHlPX@#4j9%$PCxg9i_O#}m-7VZ++v z$B&-}0b~I7;o&+^gFAR-KOWf4#rVz?f%FR!4AZnUtz$)CVZX28%>rc7~z z1`TTeKPjKJK;=asWSC`*h&b1%inYtj1_mA#Myp9) z$I0Ke)I0(n9JJ#V@ZHd%Lyu_uSNd^BpFVv)Td-h3F(i;P*^`qQAb==~)k6YI1(mgW zD%NKn4x}GfPRH#nSf}+KFdpfS8!j@e8#ZiM-hcrEeo|q1tdqW8vSf)5id0kF#2|%0 z0E|aT01U+kqp}JpiwFY`0Yv?R=~EL18;PBcY}Mhbb@w4*|$Oj)3qz3}a1IERS-z@3?T`LN|K!=%QY|di^wCmixw?%W5RPPX6-CFW;UxapFcuV83r90NQG9T*Ed>D5Nr^#1%eqWwdRm;=p4JQZ?Yo z^K5zmPp(&LFX`L2@4u=9-oDhTRjc==PoI7W5{RTm0xm#s0=#XUqK|wQM@U%}UtCFT zF(4!%B!Wl}c&a=U$}X1pCBwP?{rh*U7I^z|hYlS+oHuV?J|qxPsTRqr5P)RE?Q(g~ zO(BpHtpr2x(G3;zL1!H3Hr)q6qr;rAwEVKmxsbvIBs^-BzkZ zL|q0lP*mJr!uBG#T$BX6$3O#wCae`Ys`9e5&Q}Ya>M}BO=FDjp4`?zFX*mD@8C4x2 zA;cG41VW+*B-p_Bkv~BXMeBl0#7fCcukR1mLt}6J7zGsBs zYAD3qfyj>n@Oy$DYof-N^#530Lznw~O_a-I+`}i}Sb1C#ked43;)fMStbw(#CI!A7 ziGt_i>KSaXu5d^I3rlLmk!M?NiX8%TDFG7`CqO&JZ2O@TalpE|RthIYLiD;eZ%BY# zpjYAqi0vaZ6=0oA5GBBfNczz>WT=q!l*WJoi4!1yyU13VNl8DilK|$%2u6VR`Xdr0 zKrFvY#ASy?(}bG4vYnrrQii2UZibKoQGoXQSxFP{OG;r1A>sgS=8F1$RoyLC^gSa0 z6&e9^=FHiYGyxxDb!q@Q$P^(cAeC-zdFNCFwygUI_EQ?vhyv8~$Vrp{S-lNb#|21* zRB$yxKvfB3ZmLmss`M?iU%8w}32dw?01lzYMh0L)yNw;~5!Te}iilwzT3#5VlmNED z-%m^hN;z}sw&4Ga@IFChK-*7WD5Y^JNJZwAxrUvKA_0#J(EU*+_%Ja7lybJvXG3!Q z;+rx!+8Qsbbxt8eTaE7#KcWLdiRkR>%erP9LEOJE0_Xrun>H=EpVzALJIT(A#S#c@ z-ySa5wzT${-HswqnR3Y65WvEbFRzI!5X+##q!V4~Qq}IN+_gENJ8o(J?p7aS=q^f}BTh%>V$Z}`qY`=c}mUr*o z{Tnq}vh+GvZ8zV?Ga`r&5C+-Q`&M(<9cm*Sr9d#>g8<#}$xMoXx+XP~EHW(pk1wwX z2x4GCfKxKFD9O?dA3nTLV5fKP-1#H5sJ|0kq;AbMR`+(wxN+kOPz4r+I26Gnb8>C= z|D<0dA7c2-6p$zZ_B#Sp0KjnA{(!~sxo)|;Ns}fyHBrv$mfJU-I(16vr>-qqwyfWy zM~{AL$>-DIu|6a!KoLeVuL+vA8zi2fAkEo25e4WDaxM9){}H5hhyja40c;XP=IX_} zfddEb>DsmHKPB@j{nEQdix%&6>(;H4?%|&%R#==sT}Fbb%>Mlj(lz%Ni4ed=CC#-) zfISj<31|vFUgqk@&Fs>p%O7fL5zU)7e@kxjZz<`J?q2(rH*;I+3)iEbCHMV*QB!lj zavk;CnlXts9gau&8^5wBR{wpQtldU3e=n)Y>(#4Qr*-SrpDK8+la;Tq24V#<26dp4 zQKLqkk{i@XY7PFnnVFd%$--ZC?AS50O`A4B0pLHqXYTWKBJ6)*Cn yI;S{urd_*sO?CSJ@4wijo5*kH`<8)>jQ;>}rs8Z0qTO-;0000Ez6#xJL7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8 zb~7$BHmT?0B>(^lGf6~2RCr$Pn{9|y)gH!2^AZ!qy|+FX34JL1P?v5*1O;V55e2>8 zx;L00DkA4Y?_a{A2nw;jnO3F^V~Sp{C|*r-oHR4daYVFfavEReWh06xqA2>g=eOI> zu-cw8XP=q9&JeU=&E999eb)Lv&;NC;wP#Y(1RXnf?wmYz>eR=Zo16b}{`~pw>C>lg znjldcKdit{85kJ&JkinD*OweUdNk4Jw;M0X1dJ%~llJf5|3!a)f6~>}mFRP_d-v{? zgaZc-ygUISHFn57d-lxi?d?s$(*Vy|_mgACjt%eKyZ83SO4Pv7r0tso^l*1~cM5#p zzI`K&d$_~!@bC^jcX_-P0{VBg2h`qI z+XZm@J;95ki0OyK5G$w(aREr+8WKETAd{%A(!EC&V4KH}qF@gKHcjn*wb#|YP~%7e z(}?y&ZA> zwY$__Q~Ofw$2?fi=tyyB2!HkAh;Q(K%bP#)GzLgOyP-h?H3@m(q1N*R z@Yy7I*2ul^fOr&uB5)H|oZN#L-QT7Ab2STnT$rw?NQl0eq4sTP&IZf?0Cd9~5z0Oq z0`@f;3xS84w#KVzy%Gr~H=I41T%Jd^@IXlr;wd&*a32wISoapmRc{+1LZEL{8#H+Q zI0Ws0DJxU4>tN~oCMR3;VVG;2O zuHLj`$Bq{ao(Bw`jvT}cI-J6WVDlOVV41)}Lg?Eqv_eP-o8u31KuA_cq$J=fkg{dV zmRU{ubFT@Y?Bt+hr>{`6)j)+pjdop4vtzlBER{-XSCS^DKi8PNI-B`WAy?LpC5~M%K&eJ93$ux_a>ul-@ZLrzkYq6a9^1cFl*MV$uft< zwgM(0_=tVXMM}LylnuU;*^g!k);{tBp3H!vJ32a&RjXFL^t+VU*48$4^XAPgKBR%d z6&(ZE6^as2CU8gpdcivuAis+zs#Rf3r1_;HVbVo4!SdzHZ`rza>j6lh(lZI3uNNU8 z7WhilWHs#@JZFPPsrdbxHEX)melz__$BGpz9#c>pf&_9V?!ZxtgtCE$ns?zkM+oUdI8fvBXx`wnbT=f;|En(Wet7=; z`B!Y*xbdq>B)I0zPn5>%3iT3@2k+Hnz$>*6uUxtE*)f6lj}|Umcy(uI=MPSgwgd|r z5>V;79zrT*83({>R^aslziq9gltdQWf0nfII5|JmwDKBpUwFq!P z_T1lvjymMsK3`h-7b}}0-J3u5M_SvRVpk3 z87SM4NrCU1sNm^bezwkUbxjljkm+>>zgv_M@NskkG^yAWzUX8@%G7X?zA6zQ7kDc= z0SY!<1RSTsi6nrru|j0YV!(UR36Q__<8us35S(ZNoB<#}S?a^61Za?}@Hy%L+<=<9 z-Zj4>=3V3&X9g-$TY%>KZLtZsnE_3JcYn*A4As*Ya0qbKE@Q`O(WCCVh^;$qZ z0Bb$V*i3$~MqEJU`mU%1XrNZKjs-w~_XKMR8tZ!qKp}qXTm&47QUaS*1-}niY_Q2y ztKo~R9Ts_}7IE}}LIMI<^8Q;iD^SX5hX72DRs=+)XS`g6|Dr+q94na+;GG`k0?Gt8 zL?b{c=WC|Ht_15LfXI%&l0yBz0^!+vcFgPR={F>RMG&oB#CyF~7Os?mQ+p8^P zaNpZewi^GhfX&wbG~u|yXNsGmL|{Gci?sj|@JJL3keN+Z4KReDeqkcqH_T665ey&( zj^_PaOqFG78rKL82*`C_H_5n5wf#x%^F7b<`)o1fnOFog1Hu{vTz;7<`@f&m%v~;X zP4R?)Y)ojKj-8pGG-v7Jd5AU>F|Y)?ORjXcpEd{@bLY;zR(lmMNRCd$i(ZkE v=-i_~`anxd%OCe&Y#L4EpX2?>KvUDNF;;M?k`mIn00000NkvXXu0mjf%&Zv! literal 0 HcmV?d00001 diff --git a/data/images/favoriteson.png b/data/images/favoriteson.png new file mode 100644 index 0000000000000000000000000000000000000000..c74317d2fba6fcd57e60546b21a9ec95b5a8bd2e GIT binary patch literal 4945 zcmV-X6RzxuP)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy32;bRa{vGh)&Kwv)&Y=jd7J1;MAa*k@Gd8K`;w1n85|&9sK~#8N?VAadRMnZsZ?gy@DlX_mqlgZUni!)Iqh?W) zh!`}HXowIELC0lqTtLB$$QBJ`kbnz{A}&!wP!wgSo5rRA5omT0T0o$;TDoiRZV;*W zzWIIky=q!S=mx4ib51zt&#SI__3roo-*3D3y~;7)(7*J%rdhL&*WV`XF2C5s7A6wtv^C0v18zIt*&lhKXpKY9XY!jN*G($nE1z79qtk3YtFZ-TI={Ru< zPxHi>g&4*EDej_6|JF2CHQ^|be?;S51#sqbTzZ~J)m)Ltha$nr;x1?_4kD!IwUcyl z-#wgrZWEf9-Ju|JCaAFjp>&bl6RvTIcn zULE4^*la(ixugqPi~H%lBC&ap|3D=44+Ovy_}g7}u{Z@S#hudvK^`U)&bh7$&CJeF z5Whyrr#1Eq$@D8Ofh>fhvqi#xM}Rj(D*x#T5_%2NoHPF@aTcB}&Zm#8(}pQKmNmgu z{lvH4x_$w~7JrL)$Ms`*kcN2ZRS#hheP1Mw7Zl$q>4hgrdUgvhA+G9nM-!NuogpCp zfF(csC~-gfwk0I-IV8TfA^sAW;NxXa2kyYfI0k-aiRBX1`Kh{#i&Xo+BiH9xKQ3{__Yllk@V#U40d$vLhX08f5e zrPl3r=I5U%?wT&*ZoG||)R@+WXBfnW0FI&IKK@)!6i5e$k}Ieb+kQ=_h;R|A!?wQU zgRAKeI?_d+NGLplH$1q=DeBx)rkZ08pG5<&0I?3>CNKnd#vFfI;AKFxW!~K|*>Q$ZYq8e0Px@*Nc?=68s7QNQ}{mBAfe& ztVPg|zbo!snxukr5chUUB(Q#K?LGOMGG5cF_Kj|rMDYKlUv8jf9mB#ubxVjG|8~T$+I(R?C?-D8N z1@UVMm!E@Q@VbkKvRe^=egP5OEqx`u_C`-!@`AIV6CTlu*7^*Rxac7p}sqFv}3==m%wvN!&CUNs>N?ZmhN?nxf9)@`6 zzdQu*A3x^E`#VUW8E8mUX)+~|Cf+2pJTcrd?D(u7 z;nqje8+uB5{jDBWcZK+cA_XVVOf_ef*^WedmN70d8IK zTZj_ZN>&lzb>KI=W|m7Y1)Z7UAMQmduS+fmSNKq2R1hC!T|Ge~B+U5hi18Mnt*)7m zExEk^7PgKOXN!7CZyyN1;!1Jnoh-T&Rg-tJR2TJdQw5#ghHopwfBovnPj5~f^{|S% z0R~B;c8v}I@tP@+rJlzrR}o^kiY0BBnGE;9C}uWv3#1_#>;}o}0LChU%$~j%B&q59 zWlEe-D*e8PvWq>G^L~A(I2nOTR2Uy+h@&V+l+YarfcVvuv5$2`?Lv{Ai@;)RMUYBz zN6DWF(R-~2J1ei1-6ZSk!V9IQ=qB0msu^VhubLa`Vtwv0HjznyGL^#JlJx5_vUDYJ z8)D{yH+V$!7=T!S#1$Y;D~MqWX4ZoD^!)${EkH6;lw)-11>id#%D(G^ZLu;1qFAUX z^@J&7`K+iD2Vu%V=w|Hd4@j<6AVN}&VrznqQoXX4<+T+9)Ue@FJ{l2NX)d@(_7LK= zQ;e*8&dfL6e|cuB*qdgn6@l!YUelEg3$5Q|--KpxB?-A8F&QLI1I$DK0|J-%uOSvt z;I2Vtr9wdr2lV`_yzf;Ij}@K3x!^zetR5=Z8Y@Q_MSXF~^*ab-fiM;bQ_iAF$wwZ5 zIEgiqK|fw2NW>RI1&NV_Q{;=CY`Z09%5!Mu^p?*0NrYz`9v8)RmJ7!<^Pg9s8t91G%D1*zb(inGC4pra4{ zTXBvr%0YywK$t)Vh*3!%iC|NN5RB40#O?#w8YBNGq6ibA+Nc;&M9|RPnJezL{)9JW zdgf8G^Pfgmj5VpeznJz`fD10^+-&u;Ia=?n7r4v6PbY^fhqy?R)-|GT&rF3e!~z#q zgzAZ6g;7xyDhjh)emYa9QKG&m)ihDHGi^R|*WW~WJWsxO$H?aKM&>+W9{W;B9DScTt?U(}n-AhlqjVHq ziU_#As+gpM3#sd4kRk-a7!_ujTL%>cBZE3ykPf!z?^8Vl{>=x11VAVQ&I(Lh}j3-nPP7xAsOq(L@4i%Ky*zW;i zSp2~kgeEJ&gzfaov%8KKy67?{)vyt5Wd2A~l0VXS{rz=CQ-_*f$$uEf=7apUti|cS zH<8hk#8!farV`@TIA$w@FtZkhVCZOO@|e8{9t+9i>f!hX3gZhD;<}Y2+$s`lloA^y z{-Y$oD3vOvpajPdBaUYz5G0Nu36f#0HfS$Go`kMl;>-tM|7+sYhnfox+8)mu zZiavUHlaYda0@VI8S%W8l9r+gNit{^Ze0gHuWSWcfR;Xv;@H{;qEvzq!h8vB`5S~0 zNKu72iZI?2#&g1WL6l@0Bd0_)6zL_RHv;le9aIp?vx*W&ki^}PA5Y?Y4$r;L3*))R z(k~fVGTQ8VZ-}|_pyV?r%pZ|6Q7eP)>A4HqdwX=-=+Tq7T7sC0U}U8d$N|Pb>T4fX zkou@Ejtb-pQ`v^s3IxiaiZF?iOQPfy3&Jo)Iab7JuHuZJK#;h?7bT8ewQQ)=j23sp z&ppqbcZ}f8vV4sBV)9^fV}r@-i8ow(R?DSha%R?5hC*C?3A0j0xr^fsQH^_uM|@PO z2nRw&oM!t7lkprC1ym6>5yC7=?8g`*M)ir)OT_6Z;s{|uNXAtR%5|LXGC>zwOSP)` zE47}_mz@jwHj>hE_q1`Q3^BJiihSneM|-zAe*HL8WGe$VHqr}@qm&?omZtz zf2{&EMuZri5y$o8R0RvXEl#qvpvOqiTO>({Ny@Pm1f&q6mYRWm} zMwmF6Hp~n@Eb^HzKl4EI?@=C8R)iTjY(j9OV>Pa7jUx{8K1*Rnh>?M92sl6U^mqIs*BMrY=5Gxms(&s=2c&}Myhzhhi0 zLN4G=u7t?m)nx6%6(HUmk|fC#i7oKY=I-LP5h$k)j`|Mu=K!e(I0@ z{lr!_Vegn=WbTt@I(B}w(K%d2N+y~qHXpF0bo0R)3{R246Ag^@h6oksS_u+kQUxL0 zRFrDGO$ABO7o;@*P?l5VfL&z%Vs?TGSjO{&iIzKR{pRb^h5rc?wy?guJNV^LouD~5vnkWxXY64iu7HA2)<6?U>Mwxo^sUv=P|@)goqd-FuJ$0nhH++6)&*c+ZLO<0K%eqjSWkeA5REyi_cRt6k#rn= zt+@zW)B`>p&lXp<|M7TRi9Y4UzB}=U0iPeH2#pbJ-*XW!J+Gyt^$|M+*!-e-HrxCS zu3xL}FAOTHz!$yzZXsLWIw1%^34A%L0x-xaZk|5G;X~_F0Y+NLa)(C;+gZ^)j4)D)E+iH%CalKR5Q?B`6Hh9Yb7q5 zB{qZCC*PE>RcH-?PyFqC1c$oX@*!yV?hxtp}(PO-XuxV{OF-y`OhfkDn$?2}gFx^~EIA$zz3ox)W~SW-pICMOxYiJ`=u z0)98Jkj>XwY>%nPI);YFfrMa7&Q<}0{G7W!TV67Kvn4m!Z?pG! znxyAaZdGi&%`N$wJb^&gv#?7A;EvCLYzc6JHBQ}D$!QMI);H-TG(iwuA7tRrEh_oA zx+S-x7LGEz-yLk;ozUOhJb935v9FO&_08$>?%B#rjD{FCDdT392Kia!x z`!^oV8Mf#tQ>C}H_Tb+3&UHrYdPn<+9yY}gY~@(fyV2wt`UPC`<2nI+A!t18eYY(y z+WolQQ-_$TuM99<8+y%yo!7rto3<1B=RC-E-1hQUaC649UZ@XpWhTQvmb`4FXpHH6 zuxlRj=QD=q+{wl$KlCtC%JEZNe9N2bPDNB8 zb~7$BHmT?0B>(^qo=HSORCr$Pn|*9m;G4U?9uLcLkcy6*9)Ov1o8zkIkKF{tMLOz)H3HRPwMDYqc70TQM zS`7i!C7!!~5K3=G`5Mnn>^4{DeodSvoKSk_%Ecq$@(=9c+TN*o|{79RF&t( zw*=Vc6B64@U%)+k2T6I6uvZOJVI(WUs6pbZG1iyzwZn~)h5#ua-Q*(0a5*Bb&guVg9mG#|24|`7CcoZb&Z4`{I_YsE#!H@wGekeF+mO|J_a>iiK zsegg0Fz3kvidvYVQGT(X^(kwI#!~NB`qoci>DanD~QvX%FG z?wPVSnx&fxBWVFfMe(~#;;W$K)ji?4jsNi6R+P7QVEHux-i3sjzY@-SG_jx zg*;O9eKVEf^fW>M;*wN}GxH#U&Tt<|QKYItI`P&P!s2dsyLDaPwdmmpD0VaW19%#| z0~$kxjnZaGJCwRT!OI?f9wA>vaa=hK0kV1&g<@qs3=tp}Ai4;J=Xvf~az)c~knlWL zNJx?tQ+UFu*FE>x6p|u2p^B2amnI2vozsgyaZW7wAbWJi1Qt@iM2_owsLrKtQ{4r> z0#AYWK%}#>CN3q2maxP*y}OU&FMG~e6l)EYSFFF?4k;@#%=JyrZNcKrFM}yq`&l1N zycU{gLIULx5}cF&G{hQml^1G98#1zcNBHwMz6PdWaE?r?=KZW}g*6D7Z|N~1-26H4 zC$I{bg-gz*wN|hBD;8k+dK61E!hV2k<11MEb#09Gp|E+OV(_!Lmu(S}B}C;Sgy`T~by@ z@hEO>fWlFfjiOA57TmpgA_`F@4D>n=XGx$TL{ePI6cR!}hSQ83l1J_Hv6*oF~D15c$N+MGC~Fd+75c|IiRZuq5p82R`~e? zFLsVh_Rj5qgqp{_^r2~9(?)A*zv#cM-{lC{#jXqlnDUgCyQwuLp~a=F6bu#7HBdB4 zoXVp4i13*{*VT|A#S!`}ZW$u-7@va9FA&^v)$ZC^^L`WOm zq{t95tS?&Dc-iBxlgl1AOY_WsEbrJlYh%A@Q$}2y`p7zBNKot(Kh8VAsb!Z45 zMZqXB8HM!-E@~{LtAJu5^t~YKnEL}r(U#Ex*b0m0p@r8i5F>OZCjucC0YapFlEfMZ zx|-J_1B7H4Lhxc4vW*aF-Qg$heUF(?$MD{v)z(Cl3##9_XJ~GZzJ_HhHP>w>o<)FM zJ+xLROccRla@!F3gya(=>y1L-kz7OYUY`j$Qbf)rhzSYO{4v5zG6_lYK?>NCH9$Tg zNk~xWw$WCfA(ttb<{nL%CD;<;Gw%O~OeK zzs71 zZMVs1W?fM`##sN<`F@~@_k~DstJd?osNf8i&GMf}aLPAnh88BGJFVBwFBy|%^ z2~^zIth5@dR|c-%Radm5%(Cn))&=7Udmusm_i?g$D+JgKF2#+2fjjFO2Qie44kniG zYe(z>KJSDaIo%Lr2-3LZmpDl^q1XpWB|s{b4RjSDwg4Fhgl&c%fg~==n>LxVM-1!L zuC(G6ORVp8+a6bzSrgBZD9jxJ-C}bxu=nDx+$W4-04DhxPsUR2FBt#nz%qJvGUV;GU zB+FkdhdEVJql4kRilx?sJ}Dpm@w@X%zfTrT84@Z>=%?A0saMiMNSi#+Q%hg+KE^Qw zgdn*l1(5;SA|XcviBZY1mH5xFKhQK)OI?)rAH1N(dnED~uZZ&DAUn$L8BAqx4GB8I zcO*|k#Aqt@3E_g(M& z^p$|><<@s0z;BY|1qUU#gzaIn>-BvkNHY&f(k3iKM4BX+d5N8}!l>oFl$5BoFQSiNX@F-FnnHJkfvXXn0;-3db!$0gm9Vuv6jTbKSop(;(0g+GjUq!onjo*3ST+YU zmq7%HI3!aWA*VN3cNc^J+-!imr}TnKpb=7C;H4}j!MMjL9R4yy4@>VX_3RH##x{`K z<`mcO2J|ctn=Yo&IuL|Mck`$UAk#U>q#Yh!C<49^E;@|Gx*|Z`-tizj)GF(~;8!8( zk4w$L1p9P4nTfGo_2H(4)?~J-%Q>Svsf`S|u>VjskG<4BTg4*OE{tqi?y3}~lcNmYT1Pz_SL&-GovVedwg(Bc9x#tMva{0>2(s|H# z@l9rV>S5g&d-9V}{M$VdtZa74&D{SYd-*Aj?fneT6Q{WrJS13NakzasY@Yrgq#ED1 z{??OuF8dx%ko)5S<{`-3SwXle3@o6B4me=->Q}QVxy(9-zdft;hRq90 zp2l-plq>S*%qKhdt25*hVaz?~vX$%UAK;qXa|8rLNNEYEBWL#G&a)r4V&ekqH$5G* zyZh$P9DMzT`6VOSj%yIPIKk9DGUVmS?tmJ-8BKOu+N@Jl5 zB(!Rj9=rZ6>&9LW-pwBlAO65Vj_@rA{unDeN~p>eB1Di8c;cglM0!o3WH93*#GSbI zlk4VLV|o4O#j~uN3p!yJgU_E{atrg1+O)u`+4e7U;_H!MBWvHV?y#)?;(crfatwrd*9jFot^EAMpAN;pT3_rckwV-EWib@jl}M`9L~IX^WNZo-YxIGGJhsX zQbGQg;~W4;`CpE6pdiQJFaLT>)y-@4AidrI(&!Qp-J-jc(_l2KGfzy-f@bG5JVV0L zcsX%*QD$7dl!0oYicmNw%51e-9m>z?biVLF7Tmhm#p(K;PW2_u<5F;Wx3h(X;Xb?m%iMJgZo#-7LMYG$cwH1KBJEDu% z?q;1hS_D5Q{J|gs59~-ETHrXE&glzR(P(%rz^0?CmnGipKn6k%chRIMC)yKk71uVF z)-~Y`k-xid1m{S>gWJ4qLDo5*!WSU4zz7ijY_w3cS<;QEl`Sw76@6BAxU8-T(m;hn zZ`Yq_`$I`B_>QVcGEnu2w#!JYZ)pQCXkIu6p)uhW^g&VeQBY@h|8|m;LLTK*QKTO6 zNNNzyj01c0IKL$J`^!JTb5lBCQ*EUFt$g8QhH)Eb%sE(gmi%RERiJ4#TYA@AM4fQSGI-~kN4VsQWXsSCJ-#segf9>4>TP~FD| ztH}uA684Fph1ii);SxF%C;L&|JyWW{7xK806rIi40086$9EX#FqJRY04T%9xNQ9Ze zBREGMz)5wXl|UtaTvQDw0(YV4a0zJP?7Ya5#J%%foWNX-j!*5{34}QTDlkGQ2a*9` z>YC3&V$df+B90I*cy7P|??!$(Y!y-f8}b7r)DCEY6VS>bN!kS~)AtBO0rnhC9-3zt z@`R^IXyCu0C;$Uj8wLhC4Zr{}m_XbGD%`o?!UuR5NMj5nWF}>})o(k;A${D*osvl_ zf~{cFPDKiBpM(bTL};NL6av=6CXtpyVol>|cq;?|lp!ENBB27PkP|3A1Ek#HS9ae7 zP{FI-DNc|TfCPO-yaqhv>9w3~hv9*g;O^P>>s*yl?+W?3y2FFGqzAW@r0lXLcWMVn z;3h-?UO@7y4GL^aI!&hE(tD?le`9k4SA@pyt<18(GxZWxW#dVZ1DPEZ@3U7uK?4L^Ep#@ zn;Dv>6qqP@ZWN#0ONTcln57q_G;uIv#R4awwU-WWib2ZQU;Z3bL?dl9@Iir`to#a| zBbH_1Rd2F^VAKomi|iSUJO!{biPj4Qk}}qpCL*X{qDZzNSTy)cqYUW=EPEiOjiG76 zi5E*#Fkr6G`2}D!M+2}StPVoh0-YofTy2`a0FwryL>l7b=W!Xh*qkGt&Krc}dDkQeKi$!GXLa zrCpNZ){5`qG7nNbNV{NSx*vJIK}t7wa-{r>f|MhF^Kww>nwi{&LLFG+bxN(Bef-83lxTS+k|eDxM~GG*FUDwf5k;}mR%4~DtVA9!N1uRJK#PwbFFtv^1i}ds zT@vACzInQWlTawwKQxvxoYWg+ZgZY#kpAaS-~P|j)uqKyBpL`u{Gd?S2MUJdt%zr! z6aEOlRLVhmj6z|VC=m1pLyY*XNR-uxBWhQU>l9rKfF7?#!=XS=|45ST%S^URgY@k; zPrq4RiiG{(pjQ?pFE%iBdpzPcgbX0B*W>j{vYdc?KCjO&`TQOt+2>YHB!9r`4=CwA zmX33f(i9ljO3NTZikEO*S`0#@{624IPk&|rNT!y|fkbcf^vPo=pHN5!*CemY;}JX_ zx7#f$#D8?TPRQf&Fpw0&k4|Ejvg}pB^MHUQ5XA{Y&bOYf+?9Mj5KH&_=$O0Fg%_h#jDkC9hAykt9!%LIx5ihEu>B46f_gn37aB9g@?WKmt2s1)|BM@=BWZw*eCl~lV>1F3P>tK3drRaK}g3rK=LSHY{0{dTjFNofW-k5 zrz*Wn+B|;$2B^3V15WTJBH`epf$ZC-?1JP;2$CSWI6MTHf>Q#Jm?SC4siC42CQph0 z#Sw>!w52RV@ycYb6pO_i4M4o*pUGswCbkx<-L^&+o5MW5Ct4@S2;ReZb3y5S%Gfh z1h`6YI2H1ET@WmI>e0m@`cKhFIEy%C2P8<67i}L12?BsIn2biV8N3Gw#B7|$xGp#y z0+_i|BV2Ay%x-O@#CMs1x&RR?hZ8;M5Cl|f#}*pE%Pl};ftDaToPrfDC_sYV z15R1APuT-WW}dgjYBec>19j%}hh<*~$Bh*92SS_zLG-YYCrG5erOtzFYQimgFs>+G z8o%oc`29g#g+k$gM-oK013pef=|6q@&Fakj!rpb)E=tG_NZ}A{g4-p!*cUl$f=h&9 z2uj`nk1wePnR`X{VrI%_eZh=QYa{c|89@lYO|ZncCg+Jj;?_O6AvULF(|vEPM=qV zv+VKXE`h|dNq#Sm9=|9{c3Bc-p9?AO04V52hL~UBm!f`mNb)epfG0AaBItAb!)~t( zM*<`PEl)^xd0Z}=1eXsEg%2U6KqwTFBoSex^nrwZRFa|WfD}Z72InP@#bz@YtMHC%Aug&X%fk3BM@u?Y3Ajps$2zx{T8xUA8H{kFEMVDWY;7a?P&{7IW@aHVD zAj!~KE~gCM$8dt!NupnL%TBNC0Lil8^}1x2V|ZB8@TEnoXB}eT6!1r*QFw;%apFKq zhOMd1lLe5Lm%;%*i{dCC*^MT&UxoV;B1Mb@kIy|ZHr{?|;mW1S);1V)mmB&Be3xXm zAD%eu7ot3tInz|@>CrFBhCck*IW!`;U1N2P3szuo_{HwIpLh9a8%UYcwwcJm#w2Xtay23yTz$T%eB*C+Wx+8?vp>hYi-+SLVHsi90Q_W2d zjmhuy3U*O)JM2Hv&o84oxnkOeZ zzVkz?-Wc@QM7PK3@uSA+kBet3N+0~?KTIDu@bIsH-1(iChF*H3_m}VVettl(n9vL$ zbBgKm1wuj5BLu^~XvD7sUUL#m2tczx>d(c!Yg1ONORn`rO&?hkGE?z&tar{o>{ z*Y|pU@mA+6uZ{or@B7|-$8fb>cl)lstM}nwe9v&Q&2jm>z@oH%`^conXfRAp882O# zZ$544yx0AM*Lr{Olm4H+KG$*@7EFN$GR>m1`xm4|bP6M~*B1+nT5UFHyjZM_OOhx! zdk0KoQduz;fO*oYzQN!A>98 zV}AGxQ_~}Q;{xI?=-XR>k=;p_fJ>6sB@UIA!|2#;^57o}J70Nu@HhYIG+6q6{;SdY zLlf0akAD4uN%Y+R{*O$z@0lI4rnB?W4`0>Zy)*Kwe;fYvqxp;N#(|N+4?djuuTO9P z_4l0J9ryq4r$ZDp!8SAJ7@ySLx@Ua&V5a%x$b0|Q^ZKtu2&5Y>J_Cu= z-5N-2z;|hBKYcm86}kALZS*f(?TOxI7}GS5tVHM*(t(%zSU@%2mp*#DDPAN}N&zQ2FD z>*ar%u0Dovxg>}4AhC{HZ(q-6pMP@h!dV2iZFZYhr(e+M1s5#FI!IPmK(JVxQ**Za zU3P=fhCYzX0?*Fsa>*t^vRT4r_PsSpaM?wt$8JH8+yMgzClTRPI}7#&=FLu>)nh}q z*kN-CHjmxmbB1gVyT|WxVbtE|c6&wifu)d54td={bc!ADyy2yZ=L zai+Y1GNw%goTjoLPf+PVXjP*ff0VJK?tQI3OOWRYN z%w251+Sfk}kZg7gbGSjk258yw5ljUkiaD)4wIh%qNeW0&29oZ12PxUM)7AM|;UC)0 zpT%Gj42uRIKG*6M$6;OF?EoZE7Tn&}3zx3lx_9$#N8ivW&d;}Bel#%Hdg0>LuWnkb zPSSWuf~4-uA`%Fj6krp+5GG;~K5e!@N|w2stl91!{Q5!19|}J`cfOTC(&-Ech_SJ8 z4^vP(B^DTZu9EiH$p=N5MQm!>d(ra{u^VS69WFU(>> zh|A@|$Sg+vn7Ug-h5#N zBC5-1HV0bI+)|!L26-b!rps2gx^xS+3C1a;W zWm=Nx{Z>|%!r>r&+Umn~dV{6wVegUpM$C2D%04MER*dI*F(U@v-SP^iJYYhy-(a%rl)ov-pDmD< z0TN~qh?r-GuD=YaN+3z<4ih`~aPo+FR~R>6JierHKl)%h!5 z;k@=vIY&a?Ej)T)z;c_=F7Uq2A$bf zbL8m#hdp|Wz2<1`g2CK3GJ5PpGbZqn-;Yt)MD~eE5+<3k8IxfzIz%<`F0$t$TOz0;KrRf*K?R7&S5EBp=)djlooTq^^5txT^lh@B~IV z4v)=D6<3zeYV}%^t^82Myx!P7FnIXbQCKP7EC{5HmMIZPMpH68O?jS7gG7J83YI8E z16ZPj)i2756y|+#cTOFzR&%O$Mv0<@DKOC!1=H9x~aT z5UKLoiaDL3XJD|V{)pA#L`VYBKU9|oiFpcfjcavv3Ck8RXGoS|kRVAiCSFm%jU&W^ zr-TzC3*3d{dXEH%lj4PYZ{F)DuB^ClZ1x>yj>bSDgwUrU0!XBbh#)1T(9{UUNfHw&coxVEj3Ie| z6XQl6A5y4f)&ks;6QknrSXeKLA{~j<9bOKO16=TR$6=p<^aR1=#pu(g04W#>V&c>q zNQ&bCCL-WAI5ajqGJz9}Vh~O^I$R!y2*1FLkSVD?90AE@QjIXNSc4K7iVa>UmuyN3 zW>C_C7$s~NTS3VBMk>NQR_Z4q3QlXDv!?DcEJ;tW7=LwfWhsQoYyr097$CW^f|V_W zQ5rRts+>O4dgbahtg7hv`T>s9Gjk)O;|THf^$+3%mzd*^^+z<9W%D53RwG7hOUtmT zDW2eMbAkYYuz(5OIG1Q=3zee&MGX4wACR!s0@gK0LUIJ_zhjaV1BuiQxDPv_NBqs@ zzTeRaJaB}0zkcJE*c>F#@?I1>II+#(3 zRezDFytwFlx*FCSjTvs!R9!)aYmI@#){`h8!MjsQ5_ML%lt6CA@%7!g1spN+3zwL+ z0;qr-z(BTS#vS6~au^pUFqpUy9vcax=8XI-4ul?p0@6N{B=~j9QLO)wfe=%70Lcr- zLD4pBbt{%nVgW2uM{FG>Tk}lIo?|O#+2UEYzA|R&)w*sCunpS>#O))XEWlKLY^^K^ z62l0KUDk+}(6TGc0tZOph!^b%>&W(zO=8>Atbydmt{7^N6vLo47<^Up+S+Etmc$lW z#B3PHX&oe$fr+y;On?-C7)Gie79_3xn3ls-b+*d`14#%WCKSOUXM}|!`^5#{5lEXY zJf*~IFj_JeqjeVm2yxA}enJrK7$is%KuWPq!snfnp-kH(22vzI>JE~`A`WZnPFV;J zWks^Wh^KCH8IVM?R2w?fQXu#dfi<7`CLZ7>)H zhX#B5`)226F|!d+vC&m8O{iB^iir#x3>%J*k3a0`?(OT<>a?tr3UNa=m5-oSZfhVh zJUEexiz&Jw)?%`qsW6X{gT$tE8BHk%AYp;@8Ffw>1qm-ilC%*d7GsUsb2NYayk0CW z`|8HEs@lr3nu8@(2g+-UTTV7jOig0lxjI~pIJQQo{qpq5%Gy%oEUhl8I$VDH?k%h) z$K=&@kk(Y3TG6Qy;&v!8NQw*o_%U4Y6oV88##Wcxfs~F`vl%2TzEhM_><5e>3hh@f zm)DeoYU*oh8)_>KRa8`!9ywY!ubEdIyqEHhfbt%|==KN`F z@PHmt=fm!@n)1@B((5;`lM4<)Z}+R)UzJyvSJhOHj*mfl%r?t~OBa!|w!U(1VMdWj zwn{n9P2hlWv!vE_%I;ko)m_x9cz25i8Q@6#bkW!k70ERjVF%-wzdoB*e*5-NQgVs9j^lL}HidbT0SSAmxv+l;b{JwSz7SybV7HX| zrlTd5#pl~Ez$_6+h&z3o4rg<}&vIn<%htYH;*mDdxe-;xnJkGnWn}jK*14)vS0SVq+%GF)(&}cGLkU}X*rYJ5+Di>Tp_>TJy zY^y?r*X)Qrgaq+HS64+%WpQQkv6f>nJgf_aAqK1?pI<1hJXls;j>QfPRV7-1y(l|- zx=Sh#Hnuckwiq-XStdFvzu4}CYw@5BAjS2QVlKF%?f?=tKuU(EDbJImATf3;+p2Z< z^pw|B6jzlTX*{CQYh7%UHDw&gBTdcC7grVIE*dxo2~obTM~?u~v6eMo5S4US?9ux%)fASG;2NlB981pp-UPb+JyN~%lhn(Lxu=PsQqsVX{o<`i_} zjaxS_UAcU}YYvnaUcP?C2{A!1Nb;h;dAQ+lab@APTQ?zLC%!zXY@r9&T#wyT28Q~t-MF%# zoju!jO0UJMz!W%_4M!m7u--kD6MJwVpeD>dXnNm1#UQi{wGdo+Ryx*Sl^|@#+pS zAtp&Nbw?nbYCTn2UGhcQ=Lf5c%Bo8$s>`ZtDywR%st?tmGixv#%d5&t%S#|?28*q_ zuC}PGu%zN(WpzbGb@{>4qJw2cXV0G!+#qIhX+tJ99{SOFq;!IJ|iFG)&YlQ_HnH3Y`**#7L`DPl!%{FE33`zc5; zFp!9CphS^5=*m{_?86F5#|SHGP$qgt=;yK>t8oM{yn9PQJO!$}B&p2a(o!T6k^+A0 zKEftAcqKvd2#6Jsx}zWMMZNZ87$_9$lPWkd5#iAzV4x-*VNy+je>*$bTi*t8U) ztw2&{3rW$aHyZU}kR^NGU1lAJrA6#6BnAC$nku9QNgcl9fF(q3^IcWcM-4+<#4he~ z!>21YIN$3NQPdzs_7_Nyq+~$aC{l^9IA9#(gvjvWiH(vJ!zs?MQ_U9Imy)y$br+NZ zm=K8&I3_q?12d>Q<#Qo%KT>FdAlPg+yEJkG2$PeO=g+q_9&c!D zY-nz2{PNU^mX?-Vx9%Vu*VKf|<{@}=!^8dkeG3b72*)X=D|wLCjZ~mT6nyv zv9GV+fgLmi4`z2^hh3dcS9k1iVaXQ=-xZa7QC?9zHa5)WgC+f2GgJv84oux`lBDMt zq#d=I#b_8`f$(GD7@HOuvq@@or zr;i;!T3TLwprnuj6GaD$PMtahQQK-Lc3W>EF-Z7U114@pSQOl&xZv57q#dz%@0nvD zVe(1L|7MOuJV+k*$k_1VBh^*4Wryl&YY*2HmmUNpn5#7~G|+mkwXE_0sHo(#1I0kD z^l<$l3`Rf!lK+>qAgMb{>u#P}-Ju!5CUKBV*;03V=lhOIAds;Cl`=?y9R#s4X9AG! z-M`n^bnIwj-O*$9poYey*b%g+_o2aL!05w?Q!TCM&fdCnqr0bjdS)5|q&Rr&wB&ykR)B4pP?C-Huqi_sj}Nm|%>sw_5?piBWQxAT~ci@uT52Fz>+ORCc4bVS6Y# zapL1f7*BVLc6b!Ha3Y4soNtOD(X$)pGHi%Ea6H(;BnkqptyAJ(X5?e)N}vd{)tTdf zSTLgC_$nF3luc&y-Z`*~5(;+l%w8T@#77tL`BzyDlEWo9nV+Ei)Ui9_{~DkTOfX>@!l8Oj<+ut^}v z|?dc_iEX@dA*Ks z*qsuPk^y6@Jm~^ytNKWiDB^(4)MPILtPCf?X{Bw|ux}SeUpZlPfk>UmrcM$eCqLhG zB4T>w8c}BaM3-ZYoM;)0L=g6&VuVGqF>*UR9$O#)$3f&E!6xm6*Smf;(;#7^yAVEj zjn5h);^N0A$6$+q6V#mp=04kABNgnO z?>j0%4U!LdD3B1FKnRU1f!74U#37-+goWpX&u6K~g9176DkueW$}rU#YYv&Lgk(CQ z6e3zg#ZE%NNlFVyoA8K(hb}V>QUo8k!ngDY9taAXg+g;t7||pzht;6hOl#*S=V!;Y z+9@KPc3P*4kzPM*Fw7f4##xXFWKxsHWMX7CgBHxD1+#I%0y1fAW{rgV z4;z-{2$6DwOkgJxm&5E9tRR;wMxx8QMleM%NVvoa_X3!4S~F2Lx44O5jYK<$jFXx~ z(FUkcn&0mxkQ8#mYhWNTb;mRwHbt?(aY(N1r#4&aKuYfI+3YO_4~qt&Cks;J1dyPt zR#qa*E0LAe=;~?|b96Z2i@ZcwV~j+MXRj`=tS+xIT3KEr+~tq3Y%KrdrParajBx8Q zQsRki0kRx{3gwEI449&U-3m@nhJKsfo?7lFSz1Ao`BIe)%1%2!ZL=8cHj~3{b~-GK z6kiTU=Ck2DqELNo6FkWeKhTePzl?$bnG=wA)Uo+Ai`(5ZB~=r zZWf$&ln}z_s=@*2+ZaUx5Nn0l7i9zZDyqbW^HoF|m?h#E3i{?3bgAOQj>^e2NP2^L ze0-|6ufKnwA1lj;hKGhnhSz9hWE6z2!;NtopP1k@q5QCu&E(Y7)b!NEo4^nb2 zUk*0joO-3aB;_S3FG;E3Kwgq^OOnPWXE#$Gq?`aLAvQcQJ0NZUPWiiW97qjFdA6pN z19^}V*nqThd>4fm?BbdHBN^sE9;Cb^C2}Y;+zg+W>aa`wR+N{doRFk#5W=n0gS35p z`MbN|Kx#nRMaB6?lIOr)K}x=+e9m2SpkUWe<{!)$2l60o=~HD4gJ)Kh2PqHI*1rEU zo6o+=Fpcf5wx+x!r9hIlXYtaBZS^x(h$ zcOg=M+)m5Mk^Jce>1S{L8z}RCY8*&-2Q_Ayf1h2~I6J2S?F*1dpfSCB*UU=tLE>r3 zX%tK1gWeq!mFh9v83ORr9p2`7Cr7&+yj!AC}cMZDt1&d7cjoE0B%! z8|6gGZ$B>NPvIOX5G)+&Dda!fem$<(OV{rrC(nQ?kPVNd4~(r!P76r9GWrX*`KySV z#3m3KkCwCT{1Hlw%Ya06nF$L~gG7bIy%jH(Dg^-*o(JzhiRu@l%j|%ZzFM~j39S-; zwz_Si?b9Rp77e`>8aO}4C7OSnl%RnV?{G^E?e-v1z1ZuQ9{IeY9w}VfkWR0$8Mf?z zls<$|^7bGlyi5FomfPyZ2o(1_ewUp31#OYNupsYz!wm{nI zZ%&ww77dn>u_5h59Nemqoq`nCp5h)S7VSrn;sk=Xl{j9&HV`UtCWJsD%YlX;*VOh1 zQbG~WgS6haQ1b!;MAjRSaQmS~7g}+%UfPAai<6{0NHIK;QFjS#gBql~x=TUNd5?|* zX{{@_I@H>%vc3h0I3kg|VX0Mj)Hve0L~WOE#yJjfH_%FORM(Ca-an&so^4*E-yIcX z%W*)x+qvM1b4+-snFUUfi6W4=W>cFbdTM(Ye6uI5Zco7e)qnYSs^xBH&y|}Ucn3mW4K1DLLCFsu4U)5t6UswjA)cSYLUAA=QJn{O(L^9gAk>9(k`gsY zRExSO)JT6RubOI)%a(dc+G&X|YJSKTNpR->z=F(I`CQZp=~TZbB%YM5T0}DThvY#@ z>~X#QTV}>^B*OW3U;3wy4_0Rk7kZGOyd>>RlAg)XbYzGv$4qiUdOllLIPm`gc#s8dU68Y# P00000NkvXXu0mjf+@K*i literal 0 HcmV?d00001 diff --git a/data/images/flatnopic.png b/data/images/flatnopic.png new file mode 100644 index 0000000000000000000000000000000000000000..02cc394c1bb6d6a05f34101864c679c9a744c6de GIT binary patch literal 3950 zcmV-!50UVRP)k(Thp^;u1{gBCEb+4BoO8N_OU`MZLEzid(`_qDcB?-0>9$K% zrT0}yvTUpW@#Du2ktJ~iASp}Y2#Cbv%i)c5bgHzI^#tC*imhPCkGB9L?9S zU-S9mr*QDWg9i^EK78`z2|o){=*zS66XA&TQdpD6v00dsU!!kHsSjvPOJ{KSb9d~#eK*|TTQzJ2=+ z95}$w!-o%ZO6sE^i}TrPr#MAfX@O5^jZY~UIeGFVp9shQ`&;mWKBq2UzI^-k?fdud zKYH{C<`8&TMt@}SKh zTOdwL+O};QVMw@<4l2M-=ZK^}xQnv~R}J#lL8+_?)DEFeO-ymaXj-{;Mn zcjn9)G`qDekpSj;A^fMiz!L%x2-UuN^(t+a?h!cL<`#hBX!`W&ixw>+8>Dgi?RD$c zO`SS*{`~pZu3eM;FwAY)vSrGYDQniOff$+>-x1mqQPCgFo;`ccoH^&tog>epkyL`I z*HgfO;NsM&Q*^Mv;g%|r05af-rXay(YzA&f;vjh=^O%%cvSi7O88i0o-3wuKYeaJ8 z$`yiW&YU?kGz9J(zjyE6;NT#1au(X)hRmjiWCWrJN8~h$G%6!0E_Q*vL)D=}hiJ(3 zQ6*!53Qwd6Ouz>mfH>%H*sx(>V1OQP;lhQB7cYh$?9ej$`};W}e=-ifm(GKPGE&Wh)D{W z0Wqsqt)d&;wQCnsgWbD#lU~f_NH2Wxoj#4Rin$!LF@RwT?@$X*3`=EG@W4&m08M{I z=!+Q7Y4Y?ux(uPuEI=j=^Ea{zVupu@8DO}MgqW2pSDrtAo;-tEIPB68a)sLlv`X-RobbizE=&I?S`l80Z0djBMJp zY0{)gWC>???ATF^d?XwUpgv^GiyBCOs9i0QIhq2|cs5zP>)X zEM|9ffU+!PFw%fNS;B}_7^J(SdqgBFWD;s*8xzj5F)1~$?BgjG`pmx2Wr4N&g%krD zJsUG=Ih~WjAVe?6aXz_Xl?S<)g(PMQaymzE2{&A9(OXisY{kJI6dMa>I0h)iY>m;S zq;(g3Fpp<$COf)TdHnb>^XwwG_R>r!xacunNiyTOIV8z@eV&AQHdL|9 zBXf&IKi25DqGD#DG6OW@rYIGSBu{7tFw4>ocN~~j?A*B%&ft$D^oJ~~BP?66@XB=( zS3)du^MxS|kq6~1KJME};b*I`IK)BJFPWsy4C>{FGR9`2z$Qh@X}Rx{P^+g2E@BvUSoD*Tp07wv7nQf#v0*O zeE@aB%~&H7CQM)#Te8zr@b+efy$P=tXz8v}r<~();?X<6s6ANjP z#0|JGBakAaG#4i*TN-I6$9qXo-uihj9aVcE5Em96N@p;}CmXy7&sK`>cjfCW?;r!NJ~ zoEpSg6cILsEz7cpxfx0HZfBg zl(P4(Wg!|#jN}F+Nru=<(}{3PjQ^W52!m;!lK>QrI3`KaD{5w=0$q)|3l&Ya-!ve} zI1F}0Hjtns74extLqB6s!^$ECgOjI7x`jH5B$cLDu2YGKRA4pCp#AbxkfMDpHEv1h z21Bo_<-$@~*b^fyXvM+b6zk$bd)IQIuFS{;=(_PxO5KH}rm!q;R-9!UT~O#D&3vhp z;$OpbX*lj!?oJOKKg-V^rt* z+?asMg1D}1C1VwM%DmFDD}|9va%Ibh9T4OOgb&MwO|u0mnv~b5T8)cfo|1KB_5>NN zCs>V|LlXbKVj%oeg+X7(IBMX_xQJttjN^z^(BQHfQkO4Z9x~vbCW$-l25CeQ{@+N8 zB>rX7MmmtBmxNFR(i0Ex^syRC5iFF$vaQH@xni4#}&t!6t^;kcOHy! z^4?$y3{j~DlH`gZZtMALbMoKp6{U6#h(yv`q82WQcV+#<7D?QR2ppjkcl9Poiy@SGgvbeM zibifYl6I05-K(fMim=R#E=d7G^5H_Lz^$(1Bg7J$nIu(e0u$5fu2)Ek2(i6u9-`M0 zdyi2ph$vpO)3FHL>@KO0R1#u7<(Q-ls1F1(NnKIBm5d0t%qLT?Mg>xDlDNmJD?EHs zI|B7cO09aj*GcHJ6Jlz$sEkKcYNV`CJCbf2NgR@lLhVq3wPuD}f#`G_lnOyc>-z(Lx(6RzlycI*SvvXDtCqfZM;f6Bc=l0O6kSk5E` z0NK_>T}ZlTC&Csdo$_{}b|`H|lJhWp8+1&P?{M4fXOc8>BrrF<=1%llh3i<~T9S0X z$HXy7J%(PO>SmJM1O33Yj3UWCUf1Dedm{)4dtzEGWKew|U`vvZn6k|_1Vlz8eFQQ| zkvV#(Alf7;*vu-95y&Jt2GobSOp*^&9orPT_8w&kjzA_UIOO^cHAvDoo=dnvK)5lJ zt@uPBljIX!N4B*|dYmOV0-2=Xkn20lBAT1!Y!S#L*&-OA zyi1avWbuQ*2uWIP!A}_3Y8e7Tiy@RVoZ%73B!$OZ+oRAfkqZPzpn)VkZJcP6)Hnoc zP@zmx6G?iOB{%{?w;=_OFgtvfNvc63s3xffm1ug1BIOD`&+-!iZIUu>;StCrg~wdm zVcb$5emYsn?&kk5T{s1Ee|_t~71^Y5)KL07*qo IM6N<$f_p7en*aa+ literal 0 HcmV?d00001 diff --git a/data/images/gcncontroller.png b/data/images/gcncontroller.png new file mode 100644 index 0000000000000000000000000000000000000000..244bb56b92567ed9c86cc64701dbebd4d4feaee2 GIT binary patch literal 6373 zcmXw+RY26w*T%nehqQEecPzC_cP-uBAc8bMP#PqpyQCW=mXM`E1O%j0Qb1Zt>fQgv zdoeRt6X(n`pXW@Rj+QbWHYGLy0C=h@3VMhU^uLCQj_4&HmwgZembZ$@TL8cz{$E1^ za`Pzw09)Gy0@2ZN_VV?5>+I!CuL^WmIBB?GnZanr9#x6r?(ucCx z_-_xtg3H_%dT#e8pW7B?4(hH7TBkAKn7ElLLb@X1xYc0VS6d%Ohem$w^2$YEGkXJs zn635H=9@fAP{n8U#Y;F@`Ge(IPPf+KK_IZ}8e65KacTpcr<1dt0# z0#^WXN=V@a*{u3NF)Cm^VQ0Go=9NihwacK;o!ABmpe(0Q{;(jw(P?2LPWU#AyLAaRGka*eDJFH5jlSV`2&bB69!| zrAs5w1y=*%0Vg6;IV~U0Q~X|n|bEuYo!dALJ#+N zE@e4Ib+*JQ_Pb4RY$1?q1Bwqu zJ`D7Dd%g8_n>j+zB0?GUZfoHCUyX9==}%aZwrl&z%8wm5FOM{Hj67>4=6I5B0!U?3{r3^PnCro%8fc3p|LM~`xXE$yS@5< zvSXrzJAe2!?f-Hn`=ngV0)#uNetH7{mI}OJTw3%1Y_HWQ~OwR)V&9@M^84Il%o-b>pDlLdE@gAKs)iJy$Sx= zU>5eX_e5Z!%8y|Z+c2!eBH6|pGbLe?=S1Bx^sAr}B{0*E$CBtWs;7#m2BXa0KxZ<(LKrn=@Biu(m!$AAh0Si%1EVBoFDeS0=da##d$w`zEDah zik2MwsC6b-NtS_(^22{qUI!#2Bk^ zGc6D$6Y~)U$3lk0n2F*bf^4u9WYy-+2D3!7O0%ANOo!andBQ4`OljjQ_HHd066xIZ zTw_tY1-pa0Lc3JE43}ou1-5c;KHuqYv+I3xReQZhxF@`a?vO1g4=u~pTdyiHcqNi- z3a&3{*K5>`sUjBk%axe?K&Gl*USFCqN9j!NeCyKq+qdi0dIqgl)(@lEi9_YzS-(;K z`s3n7lYSVDbz*;=M}a}%^xB`IFh>)6)QLElnx}z+{PWGF-d|xfB1NO?StFZVDk~5BN4yp=a4VZv~xm!(UR;F>S zO090K@^PLJhCVjlkZ6f7GFTPX+Wxo+hk< zqe4nUN@H~L`()|lLXJqDw7{a^LEb^$V%}zlwP}DUcY9TPr-N$Cu4#qIX?u@nl&OSC zxiQq#qE)HBpq^!+yS}^fRV7R-O{=zW!D+DRqJ6x*y5n`z-V*w1L%TB{y=X@=s+$hyP|C@;Mn#6HYG)?X(k5 za16N==;zHTJCQrV-hQ}>O^8!}Kf#+N!<$DnvOd~%q2Yu>;~)oSCZ z=&8$T%v#ZR;UbPg6QQ?12FD;ml>ckoCV1VB`!if z!VLN0E+~YdFG*H%)#0XP`9wak7$#3DpZvc5{a$}PgY(#*lzN8SgY2o)DHr@Gov_~v zKQL_eZ4w5Zo5yJSar9ZkN^8y6U>x~o%5@NzbYdb)qzd_1{|*)G_|*$F1k<{Pu{4lJ1(_#0J8 zR?SPqEtx5&5vwJhelAbQSw)t}a!KsZl7t;NKr`UP$TuT86T1X4=cLuTRN>SN`t&EY zM81gH{cou&9ru>Bd2}GcN29E zQ7zBIo(Ua%v>6!VZmlVGXeK<^?cj>v2Bz$boER-m4n~fBlX2f9GHVODCQrV%ep^iu z%Rei6IUyP#`t_;3JX+m|hsJonx6W0f1@tCx6?=yijVsy^y$;kF-_GeVuU&g$l+_T{ z%NnHV7Gc@{?R|e6lG`y36nif!^muLY#6sJc&t$XB=3jIHl?-WId;`fUc^2t^OYCa_ zdsH!A-}-Xa(!W&K4#DiF9cLX6_cwS7&G0j8vi7s^J@J-TzTj;demS|mQC#KAnq*(? z{?HDAmGyx-dmJjqrzWLj4L%$EHTY*BdOEw_X0v$bIde)C+;b!RXMWYJ=k`fv{Oc+d z3932oIPdVF`p|kS+YncCc$fL$VNtK;@#bU{WftWLg9*QV5%zPQW>(rjFL{CMSQ&qm z?(1{GnLiJnC?51<{>V0yw?g3V;VstYEiInp%Dcqix?dP`bnj@KX!u;gxtF<0dHT5z zX0~Qs+TUen7LGQ89+g+=2=awNCV^^K2IDR(hwtaooGzym3o;5q!+7u4tXE6hgAeSc zHeCt4&bkPFf6XesBpgWfNKKhvcKTkntnLvTbsFV1N?Lgw`5u9u)8@2CyYstq8(`*c zu+yO4wqVEGL#jftsrA3Tffr;i3-g5%((AofL0-4Rx7V9w>tQ}@Pg4`!%l>Sq^*!1> zR)6JAS*kY!LqFz?ccudf%aHqZRo z&V{|nypfQNferM5V9*YdWW>8-^4}OCaD6#E9kr9lz^}*(;mZ4W>T;OIJTy!ExJO4v zV|zZzxPy1X-sn2vjQn_yK8(p{v<-!L!Bil_(3xxQ4d4D}S+qxz z^E5bC@hEDb&g%woZRBK4LW1x-c(9xrbRH+SB2+qWvQPvU!WsXba3JV3^zD?94Cj^* zybo!eOvhr;#nW@-_~xgl2BJiC49 zu{^tLRUt>Fa6zJ*i4y^vpwJ*?l{U+#T#OL9Ng{e@Sk(33ngz>LVLR?B_*Y|WP!Vf$1CipF~`>5T}kOaW|(iV zD1u9){VZP47>3@;6eaKPJBG;6H5(_wU=rIG;>+%2in=-^d&F3h@uex__Src({fEBW z7Xi+mp8J0f=j>Ze78Vwk*4Es=?fF<`>V<__!MhrEE&_T&Lqnyy8iL!~+dBiVSch$2 zF`$Am^R*7xXkF?9DWc^;v~0A=txZjGZf;y*eRM_BS-C|;bn4}Lo(u{;+Hf%D<$cKJ zzyNrCVSx-WJ7(}A&gF_8uD;GmjZcgpa}fZVvTeR2hIdQ?#?l0N;Z`4qZ8^gSe~JG{ zcNMxY9c-E_ zt8ls5)J`!9m#s(dM7taOpaGuyVnM0GOoT{F5}mA;hsQ}n@H3lr6d|?LJKV}SRmN2M ztcj9i$?NOuFKulz3k%VsI})+#p|1iO1f4@?>{T9+p-|G~Q3zwI9HvcP65;!k6OYg7 ze{XMvL_`#Mv!t4^4ATk=X+MoK&p4BCu;{5x`JD`;yr%yG{L_WRGD-Jv+*01$2I3_CF~ab06$nG0onX>ko_US8hMg$19>UDc7% z(c9~ZZYN{YwCnqP2qUq5IzCI0RBAbwq{P}t4=k%%?HD;n;zh}yP{rm*P z#5%ZU-Ex&eLwh|+%MFWND3z0_OL}_?W@dCF37vD5AP^K98k(C>DJdy?!PnSP$gQod zH^{V7?-EN&7{Dcj`uh4ee)`q27D59{Eo@04QgILJP3qk> zHM5(W+PqmiD{XE=J8u$-(==FLQ&A1_<4zSw#Y`WxPHL;Ea+5)zP*XEA6H7}aDAd=Y zvY{arIZDnwkb2Raf3^eIP(6@f|G*cnMA` z9i$*xP|?@7sr3qsiAdN_5LNAmU-Z2VqyZlJYJc1dLt?7cKV;uBJKtd77_XNu3KGyQMXtbO|k|p({3~g zsj00ED$=RKF>WvT=g*(5+XokCXLg}!1x9&#LUt5$c9PDpC&{O$CwF&uLhL9V=sfz` z+L}g*&XUk1CIba6Z3PSl`xE5l#pmYcrlFxh7^m>Z7iwf=RG}=V&y^F)a(sL&nzzFB z-b|xbhdpKbz(3+`_j)%ON2&_Hq@=5nO!@Q4yY30#xXaQ}!n1>_ana0A#Jrb3sDETEK(lw;PdNiKLp~WrKO>1!Og})2UowYgK~0m81g1p(u_!=5b*83t3vg7 zv!OT9+|bz2uo7mbuMhF}7dtsQxnU&3j*>PhB7E;HuECkXNR5xssQwYRziegAE09d$L#{rovJHins_5sipaP`yddn42u`HUQ-F_HC=G z+CAYC$6?fAIJxtT-}>1_z#}*oEKKRqM0T=0oZ$QJ9rF2U_nDxC#Q4r=vWtrg2TI=b zfr+{Km$~gcudk}j#-DZA(}_Mw7VEYNA9;&^`@&pq9~M^F(7+oV6N80{3<~-itHBCE zm;?gO;ssh8|Gk6?=6r7;(!=b(ySvM6IPPOC7Y-Ls!I&l0957{woZ!cG@bS5HJM{hc z7Vzv?MaTKEzCQWq4>y7#DjZno9}tv~EZ9dVyso}}IiYae-kr6I9lNW+F2uRC>t9K2 z$ZswY5s_UV2`QpcTY-(BV;-%1ae2huPJ^xzJ!F1)XCrJTGb`)%bIN_l^Bg#K8jIoC zhhR1X;}RUJz?=1;!J2k&!bOZ&Vf&)9z!Bjl?l@F*bWTA*x&QtJ5yhcKfo-y)UPnii zvj1FMT>Y|Gnu(OKCoC$OiH7HfHaa>Qcz4c#Ucry2?0K`1}gq#%XO9@xl)~<)!sP|EU3oSKnA z>PCyU_0VEK)ohHLHK7Vc(%037=4>wm4^D%a*MoXm{DMaGt4b5jSa>Sc(h8Z;H|E& zYtj?a7frYJ^tiXu>dT-#lASBFEEb~3Sh>EBkPH9%Rc6go48c!sZtfHn=E5bT);cai z%pc3kFr&DdQ`c>m+>!6!ar>=P63F>lzI;&-r{=}EnAcc8Qb=EzCWG-YQ1qdPkTxy# zHzI3k&N;id{E8yCY|>AxaPjr^BiiS6y}qqQ~jGQ!gKFCl+UPe*nxmcs1r&*F&LoIN}c9=?BY zz_YUKNyb&i8YAoR(GLM_#G_qouxORIS?~6T1za$qprC-l9lLY zIb_GxA{|~z5lUOJ^Bt}p9(x7;8w>?nt2B5PiwL0aWEfeNw6$dn4-cymKjCof$@1~= zgo;sqTsiG1y06tfdRFByv9Mqvid*v$r}oNw0C{ESIn%)`9AvEai6Z0x&AHgo9S29Z z_K(XO8x>_`A9UCa{{3G3oNk4{urfm6)P_2tww2f6t5g&5rQF$-FW8T1%X{_+#Uo@S ztXbCAS5#5K8b8c9H#djSs{xcHN5eFCJkP8Q;GnN&$DVOcx8_#~4VA7o_=fIr|DV1- zaY8~uIn5^wM_*+%7)yD+@I+rS20uTVg8Eb+N93KuApcLqGnDeae+tXZ&HW+#F@}Jy zrK>BxlwF(}->p=4D+!u{l&1Gh2vHUqa1I~NRl>rax-{88r{m(|>#>t?PTu2P1*)F{ zMG`<#qN|VjBC%(P0g;J-*w7}bjGM@IJ-X@PhPI}rX1Q$W+|L%4P5ur@!R^`R!ECvD z&)s$cH!trB&JqGGC#xN*m2;W z#J_)%QQ&^obCydh_#)Q`3@HSno6e`m_^QDi2DY-IgFqk%K*bE2_XcHr{D_BBhxDkm zmxTo9PC+`lSseo6T{B|19B=|Ezg@r9mof?uCww0j6(vY(Y5U$kVv~QgCVdm52OP_X zuyQ43<(&NdA%5KMaIvdSq>%A7`qkmA@BW}(f+Rd^-P|Hl(0D%GpNqUbsZFF7LkUCM zkvzB?T>T+2RhWFIgH$ocPn;`~!sH{e1*U*!(nUvb;w!PfvnB1!2n<(M!e#ZZ zPm!BW5!1*Jc&pTf?0`UL;i$!?;zdx5O d_x%|Xuwkcu=ZSE=O z>&lgpQoSJxQ^Lx(@Bi@q;dwrvADr< z#K{;X{HY?f6TL8$K#}do2VHnl5aaV=TSLJc^qdQ6L^A@tv-!4-x$GiI_kS}>Cg z?YX&!3X;&`aRdm8_3%Cazsq7?neqpx;QSvx%xT4S(FQ28Ujik#qTzm@skCvDf3<%o zMLO&Lt)$Qx03DfKo>kZw$gQJFOHNSd9Vs_Hyy|^{8-W=ZNZnU30o&Y{tKTz9y(PXa zb=f>t!}mlIjx_Wb zh+^@#NoUxysbSQHw451PEF0OO*kerLVyM(xu6zfex(EE42N!eY}8O%g)@MyG$ZeSy{P+$zHoe@u(nQVq=g%9RQq&B>rGEj&p+XC zCHYMA#jg5_=$Mvh9M%4{gm6n#CZK+I3~~24<#n0f?nt&FfHj(@b11J9JcYs&2+3S7_jjl3h1esIh3eDdbshGn+>0uN9q*&OhQJ9+iDK>KmQn&sTW)lt{vzyZ_9W~{6{^5YVXvviK%;E@e0!@^NTunWo}QK z$D(@DoU(|Q!u$@GAduH^&}ie`l=Ln}NVSN`FcEOz*q^Q^XCu-#yb_BL!N|{o4TffR zqbNmqPf+$4JVCalZwyDRk2K~pC{gDXa^{MgOD4+u}CN@DX!^x`yrqMT;4DcPgmto1t9 z1URTk{>{ZYgsiezr}W%s0<2aoYYY}+_@^SVrlhZ=xnD{aS$gssb6Xon>w@zwM_TD4 zPM6-RS({0dU-7m*OIQzRnrul}HumKA%4Ed&e*4Tg+!o^rdu?;+(lNy4Zm_WYzQWGH z)xpJ#1k=0bf%D5~kB7RV!I?dLw|=J~>HMtNHU6wdRg8N^S{ zurjj>v@HZNq4n5dUz~F&K6xbPFBL+&>AiH282O=HSXV|^7Ori;H?duLhmK7`)LHH` zrz2UQZv^$73PkO=QM%grkPLr}CmQ+nCof%ex%uxL%MEMdYVL!)@L%gV53DPAbF&d9 zjD{&BResteHvul&$}n-oOj+Xv_KlLV5m3I}IIu+Y;#M^&R2DXF`MHz>e*$(TXY=FSqCe*tID#sG=)seI~`kdJntw{XN&Y3T6ILyRA?%9YLQ%aP<74 zV>acAj*+IBU$l5agLCBP1$y&*&=&jjV4A|9g4>ISi!Biz^-D%6zi9@*qNYz}h&qlj zOaE>8#PW=z1((_yMhsPOo2!WzJ$>^dVfNsZeOo?f;7z1r7P9;tB(r!U$Xw7oDCoQ# zVP7cJyW9GoBiO$%&F`uYjuKLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000X(NklmY9H0)?Lz+UY_TFI6pX+=r1 zq9~C=4u|u)bNeHj0j15l!FnHBM;8!8LFCLm_xrwc&v)*SaL)0^G${Va#u4Bnz(;_O z03QK90(^*u`0~pyhkp=4u)Vzv+qU8RJ~-#7R4N!78$&*y$I{XgbX~`>W5>c<)BM`l*jO|kk3S{8k$?(< z5O-boU0YjQPwwpOlsM-QMG=N!$SW%=U&-h5vu_B%lu}~b_WK%*#y@JB_GZQy2qB>K zcN8TE0$QyWMn*rb`Y?Wib5c^Kd0wyQd0&jjo04y8cL-SWLbvmy5TliDwSpj2M6!Z zWHJwXo_7(zowY3yLgIoTyxlO2FYN5>96Npbv@6TwYBvz(=>~UqVN+ZPN3Cl;q2M7 zN+y#brBdk=*=+Xfob%m3)SIJ+kbMQt`Kc>ct~|fIy!>TVRf`Wi@Bp`Mo18gwCeYqz z%H{GY0H0%w?FOv;2Q?3e0c0>)Ns>nE_4+3@O?!X4-G=Y`*xcMisZ>HV8bzzsx;#8Q z{IqS`Pl}@GUytJ|9+s#w#-3PTUw=&3^`h_lpp=3Tf_lA%Wv``Dc{UuMlp1HyVw|@#DvF_uY5nrI%j9tFOL_ zN~Q8QwryLHNaXDD^77}mx3@>S>y&d2&N)<7y;3TbJ{5^XzC|fz-P-t;0uIzpFu5-A z4qew#C=}$&moNW&y@qNDW!g=(|Mb&>wS*n{FG9K=Wt!OyFmvbBz(;n zLpq&q_4f9Dvsf&CYI}RzV2s@w*YbdKAUlrpRZY`A)ai7>hy*|wV{ly;&1O@sR;z#A z)6)}1uG?k!eHu0(B>*TC3bXNe{GoU}ekstux6G#PTKU-O>go^H*Vo?~5Xylb6p2Iv z)6>&lI-SOI&pju$+ii%Vcujx@!OF7i=kxh9u~_WUPN%bSGf3(G1>EU$KnOvtR(q;a zsl2t@{0gE903#zKd~$M$`6h(ny7=bbiuNC~hX@EKBf7)m?-e%i&$e_WE$H&Jp zIXQ_$A|VB~Nv&4H#fulQzP=vT?!dqRCMG73&*yRO+&L^QE$vf9oO8rtu})7<59a3P zFg7*@K@gy-DmdrJWHKSq34#zZdyoY;RCu)8?T>UioxkW#%SbA8>rXo`%*e^7gtwT|8-zsU_}(g-vDp`SO)=XtMt0mNprIcVEEG#TwVPPRWC<~%JH8q9){(e*{ z6rf*|bkjBnQv)9Lg|qtO^L3`1F2S%Ic$s8*|>l!pCjARD`Dv%9712EZ6Y zUtiz<^!E0CFAyw;>ESn;&1RoWBohBcDMhQ*3c&`oBM1We`}?6N%2gBJ)5JWPO!`5G z6NyA1isH|0+jfJF=unx2vMkT$a=HJEMx#zpt3kwE*F`p)#p%Ww0nRyOSw38VIp>C=DF0h57S9}1IKgBql?rOLTG+!njuV1i zT3RB8VbCBW6h-+>Utix3`}+Ej&1R8Gr4Wfk!Y$`^)^FH6>~%2zT&vaY*L7VI1ObdO zoH})?ozLfEXV0ERqtSpM2#7=?IDY&%D5Y3hTH3c=QA(kz>V{z$ynFE|rBDCcOP1<7TWFhKJro&h4uCIeK9DF z;Aih74?{ykw;iz9E${OA{O4`kzGr1+s8Ws<*u3ajX9`igev$3)9XTI-~y#dZSG)?1%VYqX1 zb5f86!D8fcxwDF*JaMa>iyP)?F~-&g1_s_uDgDyc*4BH1XR0WrSXo&i0D6K2*weYZ zP$)dhIscIF`)wTZL9Zd(wj@bdyzZ#td+K{lIp10o9|8jr`(+uM6_czF0BRaGCl z6TrTvYq|G~#Iwm{@<)oIOo*b`+uz^+7SlBC)z#HsC6h_6s_Ft`Z1Ya~8UZ=_&chMl nBfv+1j{qM5J_3B(#{UffOcNKLZ*U+IBfRsybQWXdwQbLP>6pAqfylh#{fb6;Z(vMMVS~$e@S=j*ftg6;Uhf59&ghTmgWD0l;*T zI709Y^p6lP1rIRMx#05C~cW=H_Aw*bJ-5DT&Z2n+x)QHX^p z00esgV8|mQcmRZ%02D^@S3L16t`O%c004NIvOKvYIYoh62rY33S640`D9%Y2D-rV&neh&#Q1i z007~1e$oCcFS8neI|hJl{-P!B1ZZ9hpmq0)X0i`JwE&>$+E?>%_LC6RbVIkUx0b+_+BaR3cnT7Zv!AJxW zizFb)h!jyGOOZ85F;a?DAXP{m@;!0_IfqH8(HlgRxt7s3}k3K`kFu>>-2Q$QMFfPW!La{h336o>X zu_CMttHv6zR;&ZNiS=X8v3CR#fknUxHUxJ0uoBa_M6WNWeqIg~6QE69c9o#eyhGvpiOA@W-aonk<7r1(?fC{oI5N*U!4 zfg=2N-7=cNnjjOr{yriy6mMFgG#l znCF=fnQv8CDz++o6_Lscl}eQ+l^ZHARH>?_s@|##Rr6KLRFA1%Q+=*RRWnoLsR`7U zt5vFIcfW3@?wFpwUVxrVZ>QdQz32KIeJ}k~{cZZE^+ya? z2D1z#2HOnI7(B%_ac?{wFUQ;QQA1tBKtrWrm0_3Rgps+?Jfqb{jYbcQX~taRB;#$y zZN{S}1|}gUOHJxc?wV3fxuz+mJ4`!F$IZ;mqRrNsHJd##*D~ju=bP7?-?v~|cv>vB zsJ6IeNwVZxrdjT`yl#bBIa#GxRa#xMMy;K#CDyyGyQdMSxlWT#tDe?p!?5wT$+oGt z8L;Kp2HUQ-ZMJ=3XJQv;x5ci*?vuTfeY$;({XGW_huIFR9a(?@3)XSs8O^N5RyOM=TTmp(3=8^+zpz2r)C z^>JO{deZfso3oq3?Wo(Y?l$ge?uXo;%ru`Vo>?<<(8I_>;8Eq#KMS9gFl*neeosSB zfoHYnBQIkwkyowPu(zdms`p{<7e4kra-ZWq<2*OsGTvEV%s0Td$hXT+!*8Bnh2KMe zBmZRodjHV?r+_5^X9J0WL4jKW`}lf%A-|44I@@LTvf1rHjG(ze6+w@Jt%Bvjts!X0 z?2xS?_ve_-kiKB_KiJlZ$9G`c^=E@oNG)mWWaNo-3TIW8)$Hg0Ub-~8?KhvJ>$ z3*&nim@mj(aCxE5!t{lw7O5^0EIO7zOo&c6l<+|iDySBWCGrz@C5{St!X3hAA}`T4 z(TLbXTq+(;@<=L8dXnssyft|w#WSTW<++3>sgS%(4NTpeI-VAqb|7ssJvzNHgOZVu zaYCvgO_R1~>SyL=cFU|~g|hy|Zi}}s9+d~lYqOB71z9Z$wnC=pR9Yz4DhIM>Wmjgu z&56o6maCpC&F##y%G;1PobR9i?GnNg;gYtchD%p19a!eQtZF&3JaKv33gZ<8D~47E ztUS1iwkmDaPpj=$m#%)jCVEY4fnLGNg2A-`YwHVD3gv};>)hAvT~AmqS>Lr``i7kw zJ{5_It`yrBmlc25DBO7E8;5VoznR>Ww5hAaxn$2~(q`%A-YuS64wkBy=9dm`4cXeX z4c}I@?e+FW+b@^RDBHV(wnMq2zdX3SWv9u`%{xC-q*U}&`cyXV(%rRT*Z6MH?i+i& z_B8C(+grT%{XWUQ+f@NoP1R=AW&26{v-dx)iK^-Nmiuj8txj!m?Z*Ss1N{dh4z}01 z)YTo*JycSU)+_5r4#yw9{+;i4Ee$peRgIj+;v;ZGdF1K$3E%e~4LaI(jC-u%2h$&R z9cLXcYC@Xwnns&bn)_Q~Te?roKGD|d-g^8;+aC{{G(1^(O7m37Y1-+6)01cN&y1aw zoqc{T`P^XJqPBbIW6s}d4{z_f5Om?vMgNQEJG?v2T=KYd^0M3I6IZxbny)%vZR&LD zJpPl@Psh8QyPB@KTx+@RdcC!KX7}kEo;S|j^u2lU7XQ}Oo;f|;z4Ll+_r>@1-xl3| zawq-H%e&ckC+@AhPrP6BKT#_XdT7&;F71j}Joy zkC~6lh7E@6o;W@^IpRNZ{ptLtL(gQ-CY~4mqW;US7Zxvm_|@yz&e53Bp_lTPlfP|z zrTyx_>lv@x#=^!PzR7qqF<$gm`|ZJZ+;<)Cqu&ot2z=0000WV@Og>004R=004l4008;_004mL004C`008P>0026e000+nl3&F} z000Y^Nkl%#5Fos&p|NM8iP^+qU0I`B3%ndTtjbF` z1_(gp7^1a{vk9Zq6PRo|)Q!X1g2G7EVntRWatyYr)}vK(|H-P^ zXdU25!eqnw`=*m!tBZQSdUHgT(6D^_ROGfEnoDj;3_t>qErrqqOh+!esZ8BhFK|mY zgd_kc4bLQxR-2sF0ubj(F%i%(z(i#K=&Ds|BA{UzN2_LeUegoSBC9Cfg!W|_a15-> z%M&GEJag3oYe5)~T>k?HYk#*gBY$PfP!^^=0T?h0bOs{2Zi)Bcjo0|U)ai*&UX{R2 zi@b68*xSqcf97I$+rf&#P2E11Ji(D+7{?F-cuQG-XH%DcXJ1xrPaGd|z|~WhI29+Q z1>S9#@B86&eEo+8i(ygG!N1yHUAsIhMcEgJ^NReY%?ICUy+j%Jl^g zOaK%C46Hd)HJ|Fs$Y0;KJ|91PpnCcfKdy9k2C_RN$oi5#Jy?`~lUT}E6W6T-{x@+j zjC0TRf(8~K7)JMaXg{1$bl2@GGNmVvh3a_S)cf;l@{vPf=gI<){6devJ#zS7(=uGk z#mQI5*8&C>1V|z<-1{dQ{Lz}>O_E^VvocU)p~a5p=E^JbD!H~xf221f{~kcoGXDg` z1>8I^07-yjy!A*m`PQ?in_pVnAvZmIW6@L+r#|}p97gLFYdX9qhdR{F0{Dz&G+)aY za=}EH2=E2x&sRkJW0N` zuIvk%6hsDm;q+AmD59S`IBPzAtY&VC3`4d&aN-z&BCILtXSAe0>rnKa#B%GY=%U}B zy4>e4viz=*N^(ynb{jjicsB3L|BytFq?P4tsqqD^I#M@(F;=&~GZQ&a3P1^*>3w^$ zYN9VMclPJi1OHb^j0Hno0_bG{o^SSD3pO--+xN%gFV8exDI*ETYIa>#nfI+P=^G8> z9s(Q@RNe4B!?VfusfO)!oPsg{%Z!W?ZgojNJ(O1;9*gYZ#BqASFW1E5Qq6naGJHXZ z90qG%^ztLBEprJK}JWq^RC zS@qJIqWV~%=&|`|U-l8ttFMb`G`Xz@ttJkW5zwF4bZ{p5_*mVp)|CE{F+fE>(YDBXH}@smSoB4$hga zwb*%%)6yXYAOXY{2oq-OT;J%Nxx45IG;BKIlyvU-mKS(2+nQ1gmDD#oeQ{UOlZTq_ zjlHf_)Y?@dc>CwfSB9tKJ4{PZ+N092jOAI0%|p3pbwTo9K3~b64lR61=fM7?WgR2u z2|HNSU+MJ4pH^ZwmipgzWq1RC8!k27r$YDei&OC(I4@eUV-SIVb$N!j3}nP$PGzJ3 zes^^aJ726~zWp)`7{~AgowHFuDnLtf>eSM#*tRM!ADe8tGqrnuI`Kx`%PY&Aj~#9~ zI1_)cJvAKzk!1{YC~O|g)^6OSlEvAKj%)B-&|P%&wador!X769?<8*jyo>&EKlJ+*|jZW#dMQZ>D!Ka2MdWU(wG z3W;S%A{?k1eDP2n&rCGIE}a_wVy}-o`?I*d?BV_wD|l+O0lzIxECX33;tmDunM|;$ ztf2&G4re0(+)n9IhJ3w%Q^HXd1@wbbR0XvL4X_FMtuZ zp7I>9PA$%q3dg|GjDQw|ft-YGy+5>^-Ngep?X{8P<(7eh7Wj?j0XFw%(dh{o$IyZ> zTutx~FNOHQ=_Uly6x>kuuw!E$LwSvA;_$`8bv!ZJz)WP}op*>O0b_N$ay+!(?am4i z;k^X>3thmEx6hojlHeG~DS~TtN5(O7>f$4=YKbc}3}abNV#lTet}A(P%x7HCW1|f` zel)~X!y=HB{vN;w2D2C{XzZPe@sEc>JUiKhB02->IE^m1m8$NHtQRzW!8+cph+to3 z>)8Hi7+B&9Ove|8tP)4cv`oT4PC-y=8;2_iKKD|Hy^}EnaKFRR z*fNmCqoW}nKhnT#)5329Y2WqdCYvq8LCCZTlw+VXBcivI_4~#``*ffPIZe=lkTApY z+&ZeUDUc;QX+lGM^S@q@K zKt4@K8+kWhXRjRRSrP5ch+SQQ__{9%FNcI3f^4;Co+P}zOQRgfSD1sQWegRS zTTxK)e20_Mgh0~|LhDiwwZJ~;Co)RxTUF3s%4(_sfG^LcaLq6_mKFZ?rZRqeAd9HY zQAC!pwxsa$*LbKUPRy5=yrP+`#&E?jn9}ZPAu$UE$AQG|H6{J;d|rtt`2r4v-4jh5 zm`hSO#6TrstSxE0vnRk;k4IuWbZTCabDCc03)C~q0*SsrVu>e^5d_;({wuwdh|5^b=##{L$qxh3*+zT@|JGfGlQd515XNcc!WDvWuO(|snG^zA_q^L>7lVS zrw+^|?i?i*j#2OhLVM+jMcV-G*y^JCxUZ=7Ar-=C-JUuT+5-SV5+Sb%+c$P#+lCGt zuUU+T7D}A8e+5r8djt6y!rAeSY~9(eDJX2{P;gh6S+$#@6$$y?G0oTJ`M!C5S^srbV%RZV@KVfES6-&o`3?F| zQT}n$>GH^oxs92H1H}BM?43&7v3jlc_>p?fIfkHg`Y#DsUDi+JHQoQyvUVYe*DFRm z#$j$lN#Cgn4;`+U-)kgJSeN#=|9LVZ06h`_BNd{8Cz?Y=y^AF7wTuQ9_UeuXb=|uQWu&xb8Gr< z9KO+=k^fcjXHz%V`U+jyWoAs`uZxPVqcODjj7l9Xn7l9Xn f7lE(X`u_m{>p*xUh8&y~00000NkvXXu0mjfgW%!{ literal 0 HcmV?d00001 diff --git a/data/images/loading.png b/data/images/loading.png new file mode 100644 index 0000000000000000000000000000000000000000..89c965fb11f49de68321ed838515142c0c2e0822 GIT binary patch literal 13658 zcmX||Wl$VVxVCW?Uo<$oI0T2_x@d3>65QQ_yDaVw3AT8UAi*KH1P$))8l2#Kyyu+y z{>=2$banMqKh{^@6Q!ywi-k^#4hIK^^-)er9S#nj<*of2fbe!*{iX2V4arJENdgY8 zHUZ>(C~Xp3J&W-KgmCwQ`4KULNX~^R&4S+jc|`CLy%Iiq z5km+TPrI;chu_93yF-D4{r_gU=IHY8B`?GQG7#*bZirfK)N&+1y1;Tb`6H9F%-@)i zJ$u|K^Y`^Sr)|5`&n=1DPd!}b9*!=ymZGH_c!Xc^AR|mW$v=0lX<1FiF9BhLT3?ez zlM*wDP!`e9Ty00Z(6-bqb`&(w&#<(^7z$d%vz1FDUax$9S>V{t1`l{Jsjs@O0DrXy zf9<8fq5Nk#@+(4wgn@f}Y9B<9fM(6s11%XK-3wtI{}%kJ5OVOa+*&QmaB@kJr|=)M?8_LOxjT( zmyc_RvB$<9Jrflyc`gH%>L=!h=g1}yrqwsq@MRbW{S}8lj|ob~jE$WZWHr@ZQ4S`E zXdn?IA-#n9)H)fYYG`z&=5xT|bzsEfzM#+L4Q|mrC^k2wv{ZB;ftT0@Dj;dKEke(l4rrt%R&>zgpk5tW9ckl|$WA`nR%~1J zggjj^5l2c}WG-F6*z?yWrdVn|BL`D{dOJt9ln2B@X!(ZMkt9lG0OX6he&+rCHzeatXLBOzM_%L{oc+G|4s=b)plyB)>uxU#bG zU_ng;7-}xoMng^uQbL3%S#}@83e5>oEX=-s9l>2X8$MkQ2aqJBh(I19Pek2|@C5!_pp0{xr;2<&K^TlqX{sEA3Q|Mv*HUHRSp$sY z-{Arn08lx_(Am|Oa&u1!!MYhPwsHbM+RuPf>yk701-Q`XR;fF-qw5VErnm`2I&lnl z2x-`sx!oXgJ&IZvuo6KayJ!Ypx(LbCS6pWxTxTeugaVUC9WOu9Fyh%2V1x?5RZ&k5 zqHeG$>`Xp?X&$Ow?hpdJ2+ z=n%%FPyUr}U0?$68a}56u0*!4f0r8{j!U2p0H+FiL5jdRaWseH&)K@#X|>=_mxVTi z4-KF2oB`=Yp0rc8l&VEzuxp$&aVZ#og31iu;m7(h5N8z<0;E~CMz)RdmY7pxD82l< z)u32fY{7@=c|C6+n|yXba0jZO@rT~1NfK5PCDFU+)OxLO(~qV7J2;_ODmroz&9U{2 zMe=qs)u!GP4vAn!Og$yFb^PqiYdEc_R6=+dB>cw@y_vhK$Y>cO#ks{UMmH2Ksd~Su zi}ilDgOQ%1J&@*nUD}9<7ylxkwCF}Q?YUw;m(%?+8oU{nBY& zfAW|aV*q(pNrSU2>TKUJR%}44u%Fa%R0*q=1+BCksDuQ%KR`9=0he#y_5f= zY9y~ch=*hZzV;{&E`bS-kU;2SKeG!e80W|k`E~@yhLw9fmV*H|rt7VY`?}(|mV#8120qSSu%SRsKRaZlO$4d_ z1Df(GHKt}|rT^O|2Bs7AWOp&T)U{VNj^>UBaZo|!H`GXTEG$cQpZRwYO>Ev~(URIU zo4z>x9R+4ssav|s!p+TkHkgD2Q^u<0iix}70Pi|9Slqg4rP+KZ^|nQi#Z$Mm)LTn1 z6VEL459E_d%a;b{{BIWv3>ajf>RrSC4zCxi%05t);hO$G!xJLF3^8kyM|3SM%XbI6 zQ`f1B|LZ+l|D zF{CB$wCBeGS9HAM1Y>y}klDK7v65y;7f;tF30Jt5xwp>!8l@4OI<2ThODkk2!a*Yx zEyyKNSf;gPT1_3Clq1f_^JbAw`TPJZ%lZeDnGfBEi(x}qEklR867(fjO%}G6kn*B4 zyb3%j6{SBAkG9rAINHI*iy;B`b;a?Oiqtz2UN@q96y*S~Dmk^0nFmza*T>G+^>;?? zem9E`BN=w=eA;|`>Y8(W$#@oKA|EZTc5U@|wPDfL%Zhf(3vwO$D*h;oL6seTEf0$$ z9{|{86V;lknSYENHb9gKSaFJ}C%eX;3{0ltI`-eplj<4We1}e0XbN8+uHL=g*nV;N zkgF(-KLnu71xT7+OgK{0=A-to_Gla8jF-~o0@R`gLTdSOH`TeMUHceZ_r;p%8c4(1 zR}|^CCSPEjO!lcPO8pXLiIWu-L_+Qsk$S*@i~EW{eDlds003Hevv?u~l3##WhHN4n z9_B-6w>V>}WY4BCKOR8#NfTm16$p%!3Qb}R6jdDGChjRzHr^X54dIp;K3%fKWaGrc zzI}^Vv9%)HQ#}7Imurg^H_c<#l%$-}>8uqyF8RPVSQQsg7a+F%@6k^*{@rFmz$#JE z#UmQDeItRgs52ZQL8&Z;R2iZ}4&>@x-oLL1b|!|5%TmLvdB|fNhKQg;=0Nh7`tA`rvFJvsDALZ8}B56yqok%(W32p!OUy*ef1#*9F%dbA`z7`1w2y9U1py zNHE;NFkawbJurYs-%8`IKyF7>h>P(C^V7kodEEu_KHm}M2uxMp> zp;P4KEY+e7Hu#bjeOo0pSIqeqyr@?Zc9ib#-&6KT@e|Oq#fTGcfCQ~ zA!0bo*lQupeHJlr<|tkyF#AL=g+SUmL}?f{8up}Kieg`Gr)pZe z)|QTyFW8v}7>5e3MY1XXNZ)H`=h9bP@qMT3yg9X0gHb8X5K}XBH#LkXES1rm&9@vm z^k7{wlvYpvPAo6urui4!w_aP%EwOK7CWFD#r%QMdBiltG=0Ke7aU#YcCd_>cew4iC z;XofCvs1az>l z39thLi3_vq=R)PDHVS)qE_D3(X-!T;97HcTJgUOWQ=Uo{pt{ovQ%f}->Ii~Ffh^Fc zFv29UYFU8`A=O|&Iw#ilhaUT>3^FzyX1 z@%X+3nR@b>*wfb4SWADg2$gCS5|?<{ySBTc=)e3zLaKbFCz9Ocp&69LUp z(_rIN`30&NB-0{UYVu1OUd;ZdZXFPTBq?>b4sG^1YN0-3G=WKADwdSUffr`PN^Ol8 z5>`=%oSvnsjnoZ0P#MWZK%S0RIShhk#4`}CilLZTy{W@^@DG+u8hO_PGo~evk^;mY z$k2+Az{eKp8pXWc&pup6>ke}d=a!TgDE@S%{Ny2-RK{_NW(Gdry?V@MYa08Dq9+Rc zi46X#Dy|n46XwU{#Qz({-A&c4g%18m6p3_knBWWx5+c}um=Ia{smYB-ART&qlLHZ6 z^dkmLol|GiI`G!kuqU4*OInu&BZ(J^QJOxp9HZwC5n%C}V0y<4Y+r~6^>Xm-f=>QY zBvPY5FY9G&v7Dktf9JBSav(+^)gc5#j9AnP;)X?ouOC9NW$g5)BH}s9OUr$bSJek!(X12|3osI;~%XjxcD#vAhue{$=p*d~q;c+?8lP91K#u zTZZH2T6vvrk}-N54DJkk?#Edte^@(a?|6K;GJ2g85UBTh?HD|Qt2~(N>T1*x9=|6> zFkudHzK+p8eor6M?)GuUQoM{5iohXHE@v)tYo6zD36xP|kP`&_}oWkzM|i??}A!DricW#UfFanY)Ns`^|DN;$M(PfwioO;{as^D z=$`?=*ub%K#3nEI=w)i1e{3#uz5o8nFc3*#yyG+Xy3W7rz~{WhP}IEVT|S?V>#-!K z4$<@NJe>BxM3;pi0Y7>pcTCxB&hbBec$=DBJvb-4pw#avdM!1oXqu_hOi64}VzW~z z@Q_h6ND32i){)9F-!^%#zih19wbgaah#9imHUX*r%;`Bc6`2 z^B)qPmxW?Ho&Np0z;9Y4Fs1=V{5pHAj%&Y|i{T3t2;8c_-}Qed%KioQ@zTUt7$UgMC?Ckt-yZ7f^z=a)(hTvV< z2jb{_Lu>J}%2&1V=GmDQ_v1?Qr1-dYrjIH?fV{7-+JZe9-< zMAo0XcLHAm&g1ev|6Sqmzx=%-bbi9#VJa}c+v1)EF6^TDTWixfYnqi?yVm~8YcHgD z-(`J1faAQu3Cn-KA#5C@Oycscn;~U#9R(@`(wweqVphA%kl^B&noQ1B|1b4?mM-<= zBET#~H54*nlPWr_%?)ALAwKKESneCWrdkht(KgC)6y&-d_*PP?@?iM7sJNUI_LW9b zEO2>vp|$hUeScdPlg!yA_g(d?*NJwg??Z2%Qs-m$Z>P1h$BOD3|7YLZwgk%8Kh@ZN zXAIBPuPO6~x85}GB}2^(QF^&XEXR5HZm$BVysqB;G4l04S6F|mJexU6i~zs_GOpo> zLh}KRto3W#Rr5yqKy?z0zirBlowdvn!ER&a2s9L|hfEecN&ep{U@{xg5V;Y22~Ou3HRXn_?6P_kWur0`JcZW6aJY#3-D^xMp1+?*9ZhY(J@V zJh(42B%J0>xT^fQ>b!p$E{re}d(N2r7trSQ9DdWka9+Kh^^ovS^nRq;>#;TO>C}^a z|Bo+8-flNTM;6`uN{E%~()C8|&Ej+m_x`}zL&D2^z;HM0VFDQfD%w0Cf|~cdEPX8p z9^sYOnT1c#Ju^r`hW(Rh%(l$AJRU}CWfR0?$QT51SUy$E?ui%434yJ1CUA`h0?!97 z zAL?IE*A+Yeb&r02wIn+*5bzvzyYYGD3pnxS<@ek*J@X7O&HIMM_RW&?2&Ln>P^I(! zpXB<(%axPA=lNO3>f>o(rh`D#AyKeufjXE)!Fb0~#t;FfB=h68*w(n_HR0^_?{I@c zCh?|g+b6}nVhirxf`LXXSV|lhc7&&8_f65fLv8B>>Tkgbt|Rls#5lBOa2L-Ekt`7zWxBr@T26jDtd)Asqwr^#1h$?KM{vDtQ z(HHR*!e~@~PPYf&3GQISSXPxtHUcjQCY|)LH8r83K@2RWfM?TMWnDE~)8geSgN_?d zKjMU#vFg01LCD+OXy@)R!!>zBVu;J;GOYW*_=Xl6%EbA6p@U6cTfA1&F1Y5Tpj zn`3~tsVmXeg{dA&HuI#omI@yM2T024fH$o^fMgdXcCJBjGkL!3~kWMR<6?f?%X z71BwtOcSa`9w69Fab?cnF$9>K7{MV8;(6OGzAz>C+m0wk#p6_qx~EE{_#{l$NW5gVOfHhlA>67F~{^K~{SAJleQ@p&=5yKFf26m30o z_OX#-#)Y_8iO3WbC==6RP@58yk(jiqgMsN;Rd%;7MO-Pfa;iIVd7`H;y}|!}=>Jj# z^JK9QCw`p!ah?L_+6fsj`O;m%cXo}1ouD*k*y>~E=IY}Uu({H&U@-60#o6;X`TJ95 zK@vAPVYp`uxbOS}I+z(sALH$3>*M8D{(F%9#jRWA{ecW{R)m|BhO0bDmz1sTRynk5L_79je!lzmzLEybzN8&*ChbUvOb^~vuE>kx__ZKbsDz&QhX=)Fx zr8dXQMD#2?0w?@%FY>5I#*nF5b5QT0$)rbgILXqre5*Kz!@F^!dVJirzUH2w#LksSs29f;(S6-Z{J|;%soQ@plH^NKU&j?;cjbCgPB$F;0xF$?F6l z{@o`QiX1BjOUqv!6L;6b@%tItdhv}}tnq7Bh=WT)HR&^sHL3OgrI7<5gDU%t%bN-!ht_IZ`O=6hW~(W5PtE3xI};jZZYuo zHn=4=h@b#@u=vH?FVu`5t8QE!s470T-@a9^y#NL?s@DYrccWvrEi*DU8BUdPWB?P< zj7IOqNWPk;dIR2fUQ`vn#EtE|GqNwA6J#Dq_@yVW`G#T5nQ7FJ%a#^&`j=RBR3~J4 zp_@GmWnnXOT)mSNp=KPS;S5-i1$-!uEHdCRB0M3N-?7g3kEg-k_B)f$gJ>zMvpy$x zDOS&x5p6ejn{+Y$&h}3`i`+V0skbr4ME*Y>z!y**Xi_C08&L3*vaMujP37+TzJ`D) zhhZk{G+had0g@f~%*#6u2PWdWLe;675sV#cQ1+}g9*mT)d6G$b9}W*XKgGo zbMU7r96KG9DdoU8I_O(bRMO~uiuUf`v*n*^wr;%rMJ(!b$!{Bla7)mW^PyKCsOO-b znItmy1DGBskp3L{hV=7Tx$xeC&x|-cn5b!hC~ScuZoM|P-Vl8Zwslc}ka!O+8V71g zw0#rt{9bXY`BX{3H#l7wT&Hq z&B_Vn6c*%e1K~n`>gB51@s@wT{5>u+M6kChe{0SBd2?^z$d)-hoFi5c45B532(Eo~ z&BOvP8I+x%fNvrWc-z0cZjNrD;{yuuUke{`-YJ6E_=(Or-pgO{2sVp*ZN+$`u zog9n5AIZ`SvV}M48ro+}oQvOVx|S~%%dN=`UU_$JI*VQpNHUZXRA=zykM4n)pcoJ= zV{xaUz-~`<=IJysdj4>bn0&Z7A_T?uo9XB{V?a7gP!f&1_RoL!9V`%FbBsi}MylW( z|8utXtTmJ4#ZtOJ+o_Z0=}nAH+m!uL%)obHG?c8O1I~2J9KiXkbOxvRfFd2@-fSZV zwp25|W7Lyvpo~9SqJCdHnd)nkU-7f3niEa7P=SiH(i54QEsvfq6?+WG8K*GPUY3urW6WTbSk0m>>fK$U#VC z#06w2yDR2}J(}i(DLz`z8U(C*JW5?wfKf=-tQQxhJblmSTn;QS7KX&TBOA-uS95=r zR^Ki%(Mdnovu#w52s=0Xt>M{Y&=)?0umvu}{?osxCz!)#=~#xOopQv5GMgwD(?Nux zwRTQign9;8olAfAT zTG7i{p*%U<29Q+Sfe-rQYnV6)O%~n+h{f&4Bj=GZcssWclnae9&pU?WoenpiAHN>I zF~9Pudv$MRk|vLFgdcK}&Z9H8vuD0eIMKoh9;68wn`neOny7S`yh9hylta1j4fco3 zR^rP)HSr}Ao}&~^6sVHkfE3YyGCd2}sz_iXPJHbJFOc-zWUIbUN{JhV`i3(ZL=Bm} zutb&|gaa~By^g>_YkH9*h_2!S2}2dh&E}F}vjpK)bXvy+j9rbxH$-7xs?t?#pixH& zm=za|Vk@1sUgI|%@qD1SBb6%BKP<2?7?j$gyuim#FMX}YpxIyNp8EYOkiL+IJdA;s z#VMunkK~H^qvy=1wWV(4E(|M%M6L0d=d?KU=J!>;}8QH)kcFI>4pGt z0^lMxXCVYah?;B7DH^9gS}t&tk<`_O-?nzKn1jamE1pCd&DE@vTJ^d=ZDcDjq)Uef z4p8fZmwwWJuGUPir`wyJPu#Od!@cEC6l39K?qzK49AHBE{vU!gmyoC&pZ%sM!Y;r! zlSo)V;J&ic$=KPrzaApE+5J8_YRR~-d!Gmj<&&@me8rYBTX-*o0H{^2fdlJaPS~bU z)MTUQ;lxGJp+X-TAQWl(n6Y?+<>G+QjEPd~eIQG$(P9QJHGLH&qSch=c4Su#=Y>#oxqAMsE%0$4! zLK40#sopW!w_~w@bIv8r{>?I$+zHd4ANyq1%q;-0f;VixD-TC6&CtrI-p-)ti5K1s zqKc0O>vOTrHqF47#%QzaRC!zjZ-tL5oE*yRezbYMQl1tB<@3E3s)*WJ+gLj~kmO|t z{rlNQKJREKJKTG!grV@IU8Vn4K5L8vAraD`N*O9Ip=tKtm%MMk{i7UuUpGys z1|x^7Sd`espFHgPm!KM)_JpIK;M6ah3VT%# ze*6Z=5<;E5{6N*#*pSoZCN_D-q%70qT{l27Xy>yo9Qa}V8#dp3<4j|Y%{PN=8X7ZT z7fJyfItSa=QTM6__pzIWZB@+8-oK7pXn%5D+g3N6O-xMe?d`q2Nh<#O3g@=8kVKB` z0$= zR6(U@_df^b!XNgQ;<*`!i1w$I*q@wv73q2!FQCFqqZ4yVur7=wa#}s%7QL2Ej+f3Ldj9v<+ z6!GRKKkH2`Nk%DY|8k1V51sup?)72+vg38!-HO=sclEYs%%nyS6!~&p$PhorL(%-W zAu7DHi1PS*m%11s)mz1Y}HshYm}f}Jra*|=fBs9eT) zi*s#s)XFa^5b%6kb@XtwwD&dX!lZQh(0TD}DJQ&1M{0Frc8a&8JG>&(N%l)#r=8wy?W}_pPb*+D$;OgDn$xZi zzob_Uee-@~|5(pftSsh?8Y6d!8wg6qN4cJ z+5I_qX+TnmH7<@7E8?geXI9&&)hGADh4_=tk!Hm7sj0x8Zs6Ipl}ONeiY!&zulR@r z(Z6SB%cSzrdn9!Qm}xn0%k`a)BEAF@@I|r=?U7B8f7CBJrz>(Z=~%}Aunoycj7Vg; z3%Qu{V@Ci%GlXVT4GaQ-dDH@tM@IW$KR;zu6<3i^{Ig>BXwB+cnNolJZWci*xAk@4 zsI_G28=q6bN0eCwH)l6bvA-w6{#Sc9DW%F?-PGhF)83cEvoWQAvN^KSZE_M55x*l^g+S@z8#nI7)DDUdMf+msnUWU?w z=}ZWWN4d$&!vsahs~`-8vpnKrlzqIDn1qso>gSR}y;X>t)cG?$+>|}1Ss-1JRSlRr zlmd5^B}NH%a_Z~ffv_2fg6)LtNrL9F%aa}MSBE2t! zm)JPXIt8%jAF2z8r=cKzI{0uW-ti~oq!}gWfJ916lwK>5q!Ui%pre$g#hakv6iq8! zRbiA7K2%R|HpJP1H7gdi0GG2m*#+t6iQqLVYz)k`q|JLTIG*tBK= z_J?$4LV}SkpA7NhP2o%3YFbWrthaUG$baicva>tA^qp7^)6eM}WOj<`v(MfF(Cvgp+DPA%$L>#$*1I5zE=izAf zN4y4uprCU0;mO_k)8hE}I4TaMDgVLY^qr3-5^F(Wp`>J}f&vCH_OLcZu_R+xYp9F~ zwX|?}!}D=txB|Hq(4gC>HU6QXz@ zw*;*CnQx(fV{Z~2bKIDhmlvATs)LZ~A41MYZi5>eiGz|4Of?TMvSp)hiVh43lx5Fw zy|NW{V%FA`S((Ii$8_>9%jJxF#GH~nlPoIM;ySq;jQhuzc5Ckh?(xr#wF5t-$w@uq z+GEP6KP%0naf7Z+-mCB)xYZiYMQr91?@a}4Ex?u#Z{iy8HBt^TI%nKBcfN1CV|_ri z!<@!_9x?$-@C9)v|=nIwULsWj8#<>{^1XrDr^Zws4Bid~9d=ya4 z`Iif0tlyPFO94nJX~6ucTaBT3=Qle2w*okicEKGi2!n%-0c3AX54h4bjAd>SNm`aN zn9)s$kB1XKD#otw520;tGb9Kp=LxS(dOVp6?MMw?yq{;g!4dwsz>=BccI&sl`#ytG z_^G+N)5*h;2s_aUL>KsY38mI=dSv$C9p#9+4U}`GcL5` zw6z+sxTC)|-=--v!Fg-^DA|g#=D@>~JTM_)w~5$%?K6{QGWuM%s+%WbYPql4aNTt3 ztl^f0nY4|p!H0w!R@jppwor{ik+9~qlHg2G0bf~7XCC3~=PDCzjqp}J)c=)dWY?Q& zKm!&i1JLe7BIR@k`jc$1>U%{_al8?R3hWS|sVXKwoAGYDtrUngvy5ht>V_&PQA|87 z88C+|yBH#&LcN)S3}LD{O)mig+^v!bb&L-e2-02od<%e6xZJe>VLTLPd~A~H>6oai zNG@Ctu2@i}zm&9JG7FX>GE>-gB_j3+suP-0tXTYwebl=h{7n!hp}l$@QQqL0r*xrp z<|YzAje#Y+IOMFVTpY0qD$9n+dgys->HOWCg%V9FgoT#!BJ@8_)}w|~?i)M5>9Tx| zMt=nmW+04rm-Hk5I|iO$0;Edv&(Vnv@nOKcd0Fdef#mtCfOt|e3rRdQXkmBU4HVv_ z)!`Q&fT^2Xe(+;<-Nw4>rVP3XfqM@q<`1zLEb5k|=lVOKLJVerB;xKX&yPg6Os&k$ zSgJaCuR#)$(sM5d4V5Ys)kLnP(4)qU?e|0Kk#hEDHKYbGSPpnbZ=$(lz82=btQL7? zqfdjvIWX6}b{J8Bid7q^9{X_Yp*$Db_4xoiZ{AN~ht74#b z!<9;yHZ{yO(9Jf?&ePY;f|=@NeaMisjxD#Z!j203qf$LAWrfZIrunIH{mnWA@sk)<&5cC0%M=1&wTB{j z6GuQATw$tU%%BYpR@>9S+mRR}?{^$iLH2>lB%2$AV4gdu3I=NJr^eMmelW{7qIh>l zwDOQL;MRL==qDm|ft7OVRzLmpeBR$J;Cfd^qWCZH($+CjegqIhKkGCwFxfd(s;Htu z4VBcg=$_3xd>8#!{Cp1~Hi^k(+#9+k(g@=yC2A|xS`Y5lqxy;~lO!j5h8+n}DNu&tDO z?>aX7ObRJU1%9A}kS!8MFkY0jWJr*C1jTWA)@fr}{lZ7%p_n0)CRG=~O19Fm(?)JX zKAt{&+}Jq@;p}vC0>`Wj9TuW^84hqJOA{E66r7TB7dzM!qd>oC6iE=~D_&;zwlnKd zxNp*?j$1U%%g!btCMWgb!%G!FRXDBVPvb40c zDk&-b5}g=e>Y9x12H_sxmZ=p-qkU8y82Wzrz2#n@RDps|j?|KQQGMiYF%52X;`;;{ z2WX`s&FE*O$3N^7CiJWr*rzByWAQS6=zoYCfzH1F|2o0L@Px|>G{9dtXP7TguCZXu zw^cEUX*GnBr4Xllw>Np7$4E)y{|!*{9%^A0pLP$DUx8ckB9>0 zlGK5FtF}$W%NThtnX9b%*6^DOhnU<<_?Muxd5aH$hLq1=Yo zV6xO9P{E8tIUHG@$;$pOdi|m!5qNuz3Gj5-o&QjQOa^r^J6sQfhdF{y$jDRJikoO@ z28ErBJsdd`h=I%qFgHB{c^eRTo9uUj>V-BI01b+slwY7nqNJ)(9^K@HWjjFyW!7sf z&=sR1O;O{4#G|kphDxiGL!_~^S$Dan3KGi^Kr{L7pX8D}#LLo^-se>Rr$t=~PP!0Q z2k(8ROwcXnfqR^-{$cSx)i=O6wONmHP8Y1A#sWpxt!lMR%P;5?99j0OJ^J$|bho&Q z)jIm>d(o1y(5#TLdVVL4t4@koWhaEiq-40Izjn9l)Ny@tCg!!Gpz?AYNZCb_sQZxo zJK5|zm?Z~yzlv)}KbG2>DZF0z->@mUFZ2Bx*(<^#ch(6S7f6bvPjNUm#}$45T{`$4 zl)9*{@KO4uy?!wEgpt{b&vcA5I8o5N(xLcTL&MTMgSjf@6MWZiWe@?gL%e3E3~2Pe zrmnCc8`1*i$($S@o4|&itEFlIn4R9_@pu_kr=xUz>5!1T_Ge}P*N;qW!0%Rm2_x{s9tx8NaEv#Fwc!UlLoVHD72d1i?Jmyjfac!DCv#xbII5OyhCOi zimznC+cq+c8lz!^Mg1aYm6TbDp#t>cA0>(!itXEf!AF(3$hm zJ%$0x`#J$6P1Bwh;yUOEX*KR+N17Bpm=W};483z|e1$U>nwyN!`aP7vv#p#cxgVHh6B)in^#<52W&u7hC*3z&mMm z7b`SD856i8>?-B=%*K6SIP?ZDZq>DLe4olOux;rIgD>ne&P>bCt>>a1NJ5D zGJA9y1`MyH8Z8H(n*{4&7@o;d16QUVuoth@WrMK5$ym^?8q=Su1X~7fLz4;?-KUfWt zil|aaqOaz~g|z>@B~s<6*fGR08Xr zgI>EW=%GOQnUq5-?$Cl5pdfZ~4R(g`#69XyVdRG?=(^J@+{rdQ_~{HBAXO6MRMqzs zJ6gIC4Fcm*z5JU5xN1hpZos1bW({F)$O9LQQI8-Y?>7*@SfsTgrG~ zD_DvPjvb5{CE3!7e&4toS$~S~#AztIJr%+F8CX;W|1^_f|+OlW&fAvg^r%g$TX z=K2>0@+&i6O?j2XlSWFw~9>D-?)rW zMZ=%(7?*FfQ4(oev|rSyM~2(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRZ@bV)=(RCwCdntyB?XBo$vCRsavtfNx3cKc_*=u}{^Qc;0mFd>A7VAB2oiH%MC zfdpznLIMemL1Cb3AWcG>kdQ!m@4j~zpJV52pU*xA$LG7;e75fr(uK7ULf2$0ECiBL z@`E;P%nyHXjeMGd6i1xK}@I1dCz{3FY0Hy%^ z7Qo{GP5|g=^q*DTdj#OU0O9}^0g!Lc0XPTX_?`wxr_&!{j7>4dh~qd~15md=1Nioy z1el(l{><3e*s^Jwr0Y6GqfugvHG&`jzXY&<&j6&;>ErYB^H*rin46oULZLt$#}Uu- zjUXQ1699rB+!c*R#}kPJWwTkbZJXxi=7@->R;$tQ@G$W_-zcPR0QgW_0RVIhf-nGp z7-Or}+uKW{qoY)-)rg2_e0-cDkw~MEiU7Eyod92I6yrS46Jv}F!=UBmWg;S)nVBI) zQPxAe0^m$L0s5M3QmU_ts;V?UKTkwNOG`_nY1&$d*8%jk6JTf~fI37p8l}m}Ng^Uz zSXiKBGFgZC7l3Em0s!Dv0GBocs6+Jj_O3!)zI>SkK_H&zJpdnT7r?Us{u2ZM0C5~g zvMkfm(h{w#tkn0zmjUeGbpQZog9=~262rs8bnV);*JN4l;W(~i*N;&E5BRa$G62VM zq$mpIa=9vF?C7pP$N;<_z)NAouQ_6uIF9@DuIEAkZUJCzMZ9m{-SuP+Kqvk;wkrO~ zwxrVlzP|<0{|0aoz$4B4?kVUAJS~006ulKrV!M6~NmX`Sd)mE0f8nJv}{CuM=?`M?F0~ zq^j!g%jNQs?F4uxg!tb8INZ#q=Xu?kOeVFy8o_ZKsjB*d<2c8*1t4T@Zv(h}Bfp;K zb*0nk1Y?YNo?kV_7^PCFi`xR==k_ZtiZ27WEr|bWwR&DvRZrW>FHIQot>re@o_Gn&)@5LUbr_h z0EhgFabWSHC|(3`R}k@@=e;ADOuizDB1w`&y}i9}FiDaq7K^>=y6%av04?SAf*||> zzAPBWerEQT&u32=@dPUoMw#E))vq{gB(pFByjM zRJB??8W;e;Ljaar0C)+&$yQD^!!RC+L?X2&73nvWA7xoy$>;NYAOHX-0sO56@iPEE z9HP|z14)u72!JF>luD&0f&#SiS~w5jzA!0?Wmz9r6lE$vb%GQ{nJ`WBY*2s`0ImlR z|91eN+Db-SDwRHvN~I>7tpd;U6pzOjtJUhMz?&GrJplj~0X(oxU7J5P>XX%*9kEz! z!FAokfdBx!)qjF+Bz_6NgWDm#TCKiMmSqw}kpw~bztcw)MUrKi9LM>r>$)950DiiO z_+*tEa;*S+Yx$Y-%v!-c2naky#&~^Q+>$Z3gJdWHJ|g04ea3*f5N9f*_Et>v}r@N~Kbl zrfCyC02dgbTrS@iiA0tok;wH*rSge(0gQ}{9PaDuTkvzCpSP3?<#M?!V~jGHj4?Vo z+Sv|(VzKzM`t!)LtVde{a2)59EXy|lkYO0l?6!E@w!b0E@*-o5;_>)Z&+}UUYSFgs zGm<0`0LtZZs_VL^3x&dg!NI|9!!Wu{)9egrUCn+g7K@$ve7<{daPWZVdAAP@4Siiz zRZ|p2VvLa_No1Pl6C)!douL{WmSue_8jUV8#z+)JN+c40(KPK+CX>0O>$iWwY6mrfCdCZ#p@q6MWfMcg+k#cTkg=2$i9&1RprENjyPBoIKURC(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRZ^fJsC_RCwCdntM=G_Z7!6NHl%K)EOt5{FAn+8QZ3fwK2bS5`e1#R5_uAhiQhH6ZN< zq#l3y~vthc{&C3b|He@)4Li`hu9`z@{+F_Ok zhnxC=c3Bmczv^XXX6yAHUVGlj!I^hKTmz&;e*%0o8~`A(F^Bk>3t!MM+0LL>_f>M6SR_6IB9IsJ{T-2Bh2W07M{hNG9>hLXqiaFL&MU8`ux) z2cHL%1^`Ig+%Y~>hD-;)+otoCuG_a(7K-nMW#1heO$q=YEpx41j{(B6iPw~hoLDVe z3>l8ulYWo^(oX^Db8pNKdd2FY*%USDu@E3V2uMZaG4ImrlOD_gQXn9G=mYb~ehH@m zY2P?Ze+5W3Kw3BE_!9vDNH4eoFK^862c*XUDaftyeGLFeKL?~QyfmNW@%X+30Hj%f zWcAYgVXwyb6#yVj2c%3d%^&l6d|v<>HKihND0A|k?do5~y@>&7E+DnJYdq2{Fd$t3 zq{l`}?hYuaPJQCvSG!L)s6Bj9`dSTY4`*NP{$P8J^3T`u8@JOV=XJ0x!uIcfHWVF1P{!A2}nNa-)<^j?TH_Uec(qeCGWXv3Jq(S>xT)A|4 zq**YUh*y`0T3VC7!0k;8NKd)}paIgd@f7(6w8bJdg=Y6}SmU70Ys?`IGZDuWi|UCM zeWqIgfb?zG2|Aj29gw2OTcvcJz(0vD6ge_a;D}t|?zdX5z>#KwR}_kz+Ndp0Z~6K# z8x7#d80I?x>DRs}vodqQ$rgP^LY4e#LY17f?=$63Yf7CrLbHfBStLrTQ<4*_<-Lj3 z^0xFA{lPJ3z!mQdmlo-Eh0tdJDb`nY;^CA~B};}32k)#^YCO7;0n%(hx-`OC-!!z; zIS~NKHg$S@g)AE~9K5|ovA)%$2e}0hnnm{m(!Yi=?*OEg6IH1nsvWh;^!UntfIrkI zwQn?NV*~85DuH3y^wJ2G@`#CSH5jVbh5)3x1F+YsYz#Nu)vLgO)B;EgCc0O`CjiMd zb>pI3;m&(EyuTLp#AGyk_ypi+gBGzQU*NE8;uVGB&Dc`sbCcDr;uC;Fc6DKNp~%6R z4t~B^>^#<}E%-(Oyjp$zsTaet@`x%3i)hUHu0f)EzzF1sDoKlS1x~1x zbNmT#q+Xl)Qia^?0{FmffHxbp@Mk~m=v-dVaU-osH~I_UZ*843V@gET6$_<#6bo&u zmQ99C2gg^)1@B+#3iJoSzB=^{qpRH@*{*Kz2q3jlTM%6+b^{Xcwkqk94REMl{q4#^ zQ8Q#Xcy);=oovxP?^--$R}+`y3mlP4yscV3d%Q(oxU*K7wxdP~+GACM_S=-eq&l}W zb)?_+)hU77Ym}fJwaTs*`9DgE=j18ixR5j;t^DoP$i#FsFEv3c&=z`m0bFw zMYgRgbAGv^Q0zA55Qn%rv!aW{>#tjtgX6Byq|~dBSS^3J_Pi*rDiV2FK?g4@5PYZ( ze)iK2{#B94zbO?vw^$_0)++f}vRyU$q{MWjLHkxpy|&_a7v+p~WlnociFi4tSo|WU zSZt3e7B7#YORndxxV{hj-1Eg^+v*arIj&r)O{|vl57^WLJFUw612**mcLDx40QPIS U$>o(bBLDyZ07*qoM6N<$f?tj|NB{r; literal 0 HcmV?d00001 diff --git a/data/images/motionplus.png b/data/images/motionplus.png new file mode 100644 index 0000000000000000000000000000000000000000..c3e3450528061b907e23210dd08d4e0b20abab0f GIT binary patch literal 1700 zcmV;V23z@wP)(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRZ?DoI2^RCwB~*w1epX&DD_gIFOB68Ljq|f zBm{^9e*~)ym)7yj`?cfWPMoIp)ON<6B*eu(z;)J&JE`1wU59u=V)%avNqm&10< z+o_#2fmeDYTONJ%KF`eiyzkiKkp_Uz0C*3;`v4XJtN<_oYyj8jYgTxW|_%kW=1xfWjdXv z5Q0Jo2mQdozVxD2R8^I!REm~maesfGdwY9)@ZiBKvA4I!!^1;1n@t7+0S6rb_=X3- z_W|rX;O*PDnM@`xOxN%CGndOT6bi|+{DTL;Zvl)hTR$fxi~#=Pk#7b73LzK>1X!(B zX__XR&E_;r)1+ydY_(d<<#O&DLjbDBsh^Cs+imuGJ#KAnaeI54ckkY1u~=leTxP9S zqiLEPkH^$B&5im!0Dc4DiIZ+3kzl{yXF8o`r_*67m7>?{ou=sX`RMg}S+Cb=nkIcd zp9~5QfFA>}9B_GgnTLmm)HIF5;gGtn^XAQ)FV)QF^RZMa%>v)|0QfF|`!e|W@nib^ zega@JnPjusWT(?%u~=jv5TMuVWu;PKtJQLYzxM$6Du9d|1VByGNRpOiv0AOtwr#fC zZ7Pbwa=FZh4jG#aecYTVx5W~bAU!F>RqcEGpYU?P#=csype z+vWQDIsvd=uX8jSv0AONSS+&J?aE+DZVulBFmS+rzt4C)&dFp#l5DkF)HH4Sy<9GH zYio-K2M01(1MmsCeLYZBl`AVNJUKae33QKgxy;SYP4;>{`N3A*J@J;JC`=}k91e$! z$K!nZ^eIWQQmHVL$G#deOGS#M^Z90B1h5C-lWy=$Hxvj27z_p(3(T!Q)7Xch9ib74(XxlbBoerNpd&bdd z#7B=FktC0fjyM<$*lxFFus93+EP$2+P9_tk(`gO{19rPzW-=L)WT{l*&d$zjfo}l# z(0ODUjRr~5wr$$BJ^f6QlgY%La(v$T<{wU*%IEVhfiir2d@OJ9A8(&?z`r|p*f5N_ zV87pIFc_4G#bq1ay&gf zod>=-5B%FKFp)@bVPS#IW^*3+)}_F1x64|sHr=!?Q^T2{Wm(+a-JNb)SDN9*#>Oit z@9yqi9n^Jw3fAj&YMREAlapx+bFJm`K~+^5jYc^f4rgxk^?KcXay=h(W|`0Dr*(72 z!NCE;;jnuPxEK^dP*D^vFE6uFsc>g!hlXL$@AuC-{a*}5qfsUj2}U9jhC(4mA`yne zVa8%HCK3sTLZR0O1Azc@xf~6{V4+ZWB@Dyh>guYT_QjyC>ns!s%;)p3gkcz5TU(RC zAI$}Y5DW%`%;)pxf~izWuH)P1g5hv@CM1KJrpYxtAB;w$=YoYofp_lQnZ9}e`03pC zC4^u+9-o`817@>X1_FWqzD~@*uF1#Zjg1W&hA}tt`8=1FmYh0Xp9OvmKwk*KNF>6w zwKd+lb!%>{uCB^6{N*h0UH2-v#JlpsEHLJP^3m(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRZ@GD$>1RCwB)*KJS~_Z_V%fG;^HC*#_3H5Q=N!B=gQgS6d`!hI_Q|g+8Jgki<=~T zFgk<(1QV#Am__}hk%q|x+`$AI#RT^DsmQGp?LB_lVYVORMgtc&N$^f5;R|c{-B1+2 zABy7L8&SM79L33z82%E7qhT_E@SKjSUIls1H1v#vae9$)ikhABRJ)8oEQJ@ZDCm%r zc%etZqyLyfZmo!owIXtAL_GShDV)7yz#Gn|fq!){PERmSq6t2IDTMy8hN@l#Qc}kO zpNj7zb55-4LNs-d)5!a!Jq4&eB$7z9ojif90U*ZabF_eK=n=`=9L zIDIc|>MeoyQ0|p6ozzj$E~CI@lpv=@#JTY}P6gt4dpL?tIfX07ry#_2QGDgTUs$uw zmeckHwm#n_;%A*9P(nw!S4MOJ{L}3iUg-_PztAb~kHqk6e*}J2L*CMS-fIW<3vR;J zi_>_cUqxA~3~e5`8q$zcBjS-WQ`pmE45JT6XRxzP#@;^Fy3&-{!Aiynf`^b>YgA)E z)gUHP*wG>*=e&sHH)8;R{rxJ|*NE169A}(np*y7E7rkKs zz_FV#oE?j!O-iD`wKDiH<8)o{80~ZJfAM8gZhqc)t8==&$~DWt1@tQ8#u9(fr=~$> z0N{4?9*UbJ>#5;bHn59v!p2$=M+PHV!O>_6Tbk3r1KGfy2L$(I1A8A3tjq>>KOk7P z<~FpxGk{yx1TMnJ3T|E#STi2S8+|IqXHwa~{A^%*Ch*C28DBp!iQ0+TY+%Wnz@CtX zQ-L@lbNZUwFe5k^*6{K8ETY={gO~8A1+1`DIS^YTm|G`efB({4{%9m7C*-+ARQpuK@6D%Sy&(-hYLQWxz6Gof7P^hL zeCkpNe;kS7?|0%jJP^TS7bN5^KmD%^{;-j-vrR^YS4LT@jBPD4cC^UY-XddHn~aKf z*|?wFPn89aaTD0ruj24v1aA$fMy{)ie;*x;;F+$w)@rW~9`LC+bX~|2U;0!W@?{1O52$#)Td|%Xwq*z1gzYVIM#u`jbVV@^1*?HYZet9t1im$( z;+0+nn;RE9W_#Aq48> z)s6fyN(Ti1RKK7;#ZX+nL%mduy$swPynHbK*#q=3PHtY}x~dO(yrspZW#6u?2mk== z6q+iihrX7-UL7`?sn$dWod0Pw_FcyFnNvyv5eO+d#&{hlFc}zu8>M$Zgg#D(J^s=# zuhjqk<9(k;zuu*7y}iDb^!&X~>gYo5d%g2dzdJ5+qM%cqRY1~d01u~)FbVKdd{!fWZgAb?WRX76;AINJ@N0)4MLX)o(W1g?X=OXR*++p_4bCqsUu;ZQ zhMfOh%MCi1t#_F|Zx=nsNpDZwbq8kV?XX$}hFJ>9PDgb#dx)BImp~rroZj{N>_AaB zyjWr;CPX=#NU!xey9jdI>F|P(v{f)+KE7F~HjNogGF##JhDuYNrU-vJW6*!YEH zsq0fO*2`@V{JUG68yuI*osbcd2UwF^3?!4{s_M}L1PivG9n3EVpOkAIe$u`q!M(5JCsx2LoKEfdScqr#N6}-W#U%?>OB(~~i zO|F1+_=ScBGN_T;q2&69El{C+;E|+YXH|<>9JB|(Ay593jT_5B#)yoGgdXn7$HQ>b z6&6{tuKvI3rvdzLUX^?u&X5)o9J7G464syT5GR~|9eLGpooY~g$q!l_QHsO|T@kBr^DKs0sjUY28bxV6y9 zoJ*=z6`jZ?ZHy(!r%wC&$`}g#1xvY|H9a)DqV!|Cl387p;r?vc%Dj8WvoMfne~xPv z11-EK?AA807s<5lfBd7k5jz{s_G9#w!u7yy)Dk6ELWln!XVC%o>Y$@>WjfcHDw30A z6rY-^S6?=ZgunNmAUE_=N)YE}wyHMuTU#ce*jI|UnF6v!GX4>I+8AqM_j+^zYUU#L zg2|(6l9iLRwm|(w_?=cYj-@!DHFJO;yxzRlfyVpek^z=&MNFf2w6HzVLl8gecA%+V z6I>?h-ScFE6f7w7)%7kalyY;p)$7ND#(-Ko0Hjf|u3Ob~M&i6$&-BA!B&ZPpcKGjAc3C%HM{!32K$q`pv3mz(ZU~ zLy;;->PqVGaWhuoFly;;Q_>0U0F&L<(Pz0(W|A*j5^Z=I1gAQMZ@|Ik?ch`SUQOSY zdA|r{VIGKCQYRf16aY6+T}7C@dhhcvqOYeNF%1;SQto0AU5;Km_fDziu6j&SOb&>c zD_4ofLboItY!HDfu{Sz7ymBLzbOcXxK~=X&B-zBY6v}~h2K(ex-C|iwmjut4gkl#rjXX$ zv=`3JTnVK-@UAeer!u&=$weTSIi$eOd?d4geybwPT(h|o_v0q7L3AQyMAFnI+I3MD z0~4{3ZU|D|*W@Q3Z0HTeC@#dlsbNij5MH!P7CTebGt8*YzPmNfIRokuWg6OHRsXt& z<}9Pc^9cN=C16=Lm#z66YS-s|dbMMI$Y_$i($RSql8S+5TJj03_T;f1c-w4LJoftO z+l`~$oF8VKnCSc_Do;D{?Ac$wR@I?aBSG5?iKjmnm9uUkQud43}hj2SzK0iiLP9Q+ve)CD2 z19IKnF*+W+_*8}j%%{PhGL+`+{AmW#nsa98?)p!rE2oMN9Ji^olbJ{)f|1- zaQqNf%_Rz1VR}DIJDzoVVXbq1qI1B-IL6^`uQZ7B6Xmag5Br%+HlE3Mq(U){X`jN= zXh(AvnV{UbU~MHzX3Ahm-IYJmV~9PX=h*U;lsq-%>-N*#A>XH-v)iQZ^i2we!4qv1 zpVxC1(NuRF$%I93MJ3n;Wr%hY#T-{QpJl*1-dGh5R(~*I(ERSMR>^YeYT2!AszJjt zFzB{eL=IKsfZ@M8xT+-J@f~GZxB>>ab<9WYXH8c6Q605hQY(R0$uTyzreB0Y4EDa8 zN&f7nLsL?o6ibps!ScfroQXm>MG-{g0OYu37RJ}TA?BzgC7j>tmilt-2$-52abhoQ zy4~nU!x)AUtqadnDMp!%8EMKwGPCOGQ9y2`OvUZtmnb82{agB$jiGILqbG}bli1VL zrG=?>+r!PwIaUnhPRs0#S74}GFdCXUA5bpg|naaQ@`g@;T-mCj%zG}4XJ*A*Pd)CVG_P>rSG|{D>Z-E_u&(^1K zN6y3$T!(lv6bui>2=q2VxCieD^Q?LeQ>>+g%&e3)DBDSt4Yz|gcJY&^Q64!u$==rf z*KN?FP2)@j^-+rtzf1WDrdHXClgnjaeRtCyC6tvN%=1WMXnc|VyV$x4W=X+27XgpK zkWu(jCp+q{Cq~y__PpxwAJxiex)`5bCMT$cStk_Q;FORAaDk}1c{D$6N zlcu%5Z6=dXbt(s-zg!K25ey5mK+sx@o;Y4~Eb8anNAv^6%Z)fkXBc=&f+?wv9nchi zks9=$VM2`QPOH8ll6S7d^3K$3>t=02^+jN4LO8YhLkiefec0duQbp)Fsvkb~+PN0^ z;Prye19kcAoIT+uGflSoI1{o8$j1?mMC1syY9|2!*Q6CQ-$y|)PX4-a-wIT7Em`=L z(5Ejb*H`X`fe^mfO>zm*f$Phfwy^rt8)qK={O>oIujRLm40dF*?Fo#aXI2SYeA!2F z>KDsWjXGJfXL>qiW{tFT-96o8JL4TmD$nYw@d@8%^({ORf#fGJ(Tg)~7tJSP+(vQp zV{S85c~LEIU4OTqY+W+T^6ab0Or0KslI~y0C&t9v)WLHu%JC*4>WpJztg{^5X+u{q-H!mWdrj* zif3+>)2E|c!@4J9R#WYpGUlZxE`-s_)CCd_d9W7Dy(kr8a^z0xkc=(QeqD{3IEB=K z#SquhI0N~Ykc%?`gi8H~1#a3t0v5EOy_wPf<&Ue7Qiy_v<3RlTOKcN*Ke%TjE_mX7 zY&r1hc*WdRp4b#e3+;XC%@epB$vUVhgl!H!J1#eCWRVreMiu<^4UNtzfk(ce?&3z< zmdf(=AtQ@TKzYq;z2rDo_$d3$9&1zSrRty)Z%$0F)9jGgvu5#%{LatJ$7dCn7*5eY zBd0l%POO3CG?S&`%u5j(UZ2@LF6oY)lti*&%46;^#?pMeF#C8#G`!0^Y9upMa(uRR z@>{2*X#)TT6ru?OKnt=vH<0%cr}+hNr##+EV)^DrZH0y=%O9|{PAqW=gidr{0*0{nl} z8VQfX_)TQZry$U%hpE?~&#H@602smTnEOlq6*4YUputYJ2L%jqcD*pLoLm7QYN%TV zj@h^dG#VG(og7iCDVNfw7&1tyBR0C{0?;@%b=5@Z8zbkaldSv5yVBotqmVPV^&NtS z$yB*>CN!&X8t?2(^Grc(!8Fsi)Vr)ac<}LFQZ4G-Bj)~6pVK2!ZE&BSPwhyiO? z-Z2gK3KMsZNl(SL5_SYE*8MmPN_JI7HCU*)aJlAYW^_)*ImVY61d3muAj2()uZ3-bFYC5P&|0X`y?6iMV`FbGcMsl%{HA5-YP#cI!K2&I_acS z%h~zi$bTL81x;{9jt|}hb3wwXQ=o&d-fWWJIknR-WoOn4dp=!EyCbLI6g-?DMFdX< z^UiXy>})I@d_Lu|3y@Q>ilwS-$qFMfaIq3D-4cc8eQaM`%{2v`NXed0n}vu^lp?E6 zB0~{9QRDWw1@dAVz??d_Ur+7Vo`W{yyW>-nlZ+W~D|sX+&O;siK{7_%y>&;88GpkI z1B88Uy1()r+jQ*!X>4Da)O&}r#(x!1ACJto?0)AI=N7js$5)v}P-I-5q(P;0@;R<< z>f-L~KtXOeJtWT3q)!s07_^zDg`|G_6i}5TF6FNJC&@xDJ6eZxs&9g8ZBPs5wO9R^ zmjO^+Q~3q_m_sIs_EhM1LzD&dd{MwJ(=z$y)#T4$+uQa@!t^HRca|G!=_YQ>>XUco z56|g}g8V9I9?Ggm-f)cRDM^`ft2_5yFJ2;_xX)947x;K=f@+hoodol`{Owym7P^PQ z<)Vg6_?dwlO<124q!(o`jGWgg-$q}Y+tJ1HrD4C#c9YT5P9fE))D-(8Tbc`msx2BD z-L~sH$QqEQ+fk`Am{=x<4V~~>MEx)u?-?+(NRW(a*eE}3x|TZN8Dho*v2r5C^V%{h z)GxX3v8#n)S}mJ271DM$YERDCn|fk_$}eV z7NN{ z*MPV!ynh6QdE-}(@&7>u8xTWu%y@7|l*=3$eO?nMx`@@&rybTOy(EHyhixZ?d?Uvi#!DJ4+_Lmsf)oS?j#7si-~C4eDagxh*}{z$Ko~CAd*07J z!8{6$(7ldFrG0;6FW*j~Lv;4P#aXtRfR<$?Ed9{Wk|#9VCpM)Sl{Q{A=hD-(GMnKS zaLp6}X-i3e=bDAoM&B`s-D<#(|2yk==v~?^SoqVj#cnn^b4UMq^>ngW>lt+69r!9N z7)q#iuZKdWzM#Ao-aql@KV=TToX}Q+E-%p8Hk5fCMPTVErO)7Tb_bv2ccJ>(lq!NN-Vo~{o+2vBh@^|47Baz!ij!EM57L^IlpU6s_+;SLxDFMVkBF~4r zeQ-dl=Jit)RD~t1%^~eQB@qu2J#}i8JXw0*@nLs8vG@oVG@FK=G)MK)WESyUB@_GdY zi%k*tPTdJ8QY;{<8hCk<4t|clVSIv1YCJVs7v`P^w6*q#>I2Hfsdkp#wFK(mZHfjm&=t`fM!SmWyR} ze!-Z3mZKPeb@9;Wh?eaCxL?Oqtp1cclbd!5rvdkYShA?*&vz)H>KcXr283b)zalmC zs1liPcqO46Qx|ml0O+{K1*&Y;F*3MFUDpI2uRVL+x(7V*-Yux$D+RcOVd~_f$Jsha z&}5SS{8uTD6u=QBjc3~{?AGv&;LE7>Yy0O=nh527>3a~~rWuH3GnW(K4U34UH8dPH z+@IuaX?~6dVqREhT|Xnil(VkoD|Rm~XGT+_d%K4%M+Gf~A+m%AO&x3$Ogy%Wc7nP! zz?+m^rOy+4AX2C76;67}2`f-r!)^IHduk#dG-6IJ?y$bqd)XCKDa_NqOss3NPgg1{ z;rKMcQE?9ws;}IKZ#Q4-eY+8c5fXxxp(Ce#i)4>;a<(-*o+nXbO zo@YVH9e)UH^Bzq&=F4o+({)hK$heBW zd(g-2FnpJt=PSv+&xS@?#k5mmnMAToahJ&@t@vA+&byDdR0Hvl!R(QZZ&+Ne*A1q; zHP`$u0F5mT|Nm!OAE=8;F9*^XO{T4jwe0_2-23f?5Gde(#T|_o6Y};BdmJU$>%tT1pOu<@ndY1s$iR_~U@8M~?k}}#mK}Ni%NDX|{Pa46!Ik5N z>maqNHeea4Jjvcf)+KM`DQ$q|7W022mw$TeD|1;`Pkl(6|CM@A!Z3j%RbAr(&NPm& zLSI?a6jWsGn;E?e&aNPuLdR~GJ%y}!u>}(gFyws!zur1cURJCk;}74weQur<>E$oA zbZEWn0pIhRluY-Dua?~kVaw$*+a^K$dWY2isRm>vg@B>GW^l$oEbRV{)1h!Y)0o;* zsmuA8Bk`03Eyniz%%HCO+1}F;ou9^0@j*9%_*}XVCS)HVNtX?&SBL51n7ZCAdOaTj zer}i1C&?S0ZMDSF-f(EQW_q;rOqSbY$BHbLa-c+Nq9O02TK~)t7;;?8KPu1GrEgoC zG_TM`LwK5u#>V6oT(E114wXLnr;{t+zweV|)+@mxj{QHWAOdd@G(@wz*OsV@9Ke-g zJ$=Mc6LC%3P!HOr77H8bzy97(?QPG6c5Ns(Rfh3`t`bhdmm^mp%XYRET<1cVa@WSd z?D2}%Ki2^U^IbYzkQ)`g*U(k%If`1dmb2@&)JA@qKUtT9wwnoPfLL8)6lW`bdRz%} zs|d4m3XC)?Yu227npo{F6y>qh6+)xIbII<8Q#ld(1QK*eS`V8+*&o8JGS}$6;LqYf z5JBU}XFv4PZaP{h*nv}eb6))VT?i}irO^(RoSRQM1^k2!=yoB1XFZY`Y9~W)7@1!KLYx)d78Xa=b7GxyQFoE@>OwbM$bar5E~%}Q1*#SR z$6L`}D(=$LUvV0cY&rA)>Xk??Uij18HKHSeJhfhM;-b8&SRBtk)H|3-)(t6(^ms1X z;#+i1g1HLM*jVVMv;Ts}37$VmLkfC4JCL`D#CTE%(r(8k?Cb?N&zMXE#Fj=gZO21j lVRD`zxKrK|{d`4c`{IIWODrx){p#-$KvPv$r2=go{yzmno3H=? literal 0 HcmV?d00001 diff --git a/data/images/norating.png b/data/images/norating.png new file mode 100644 index 0000000000000000000000000000000000000000..2b5248ee83f7533cc6ea36554085efb325b959c1 GIT binary patch literal 5727 zcmWkwcQ{;M6TU(aR*k+^h~A?H(R-K0DnWEh^xg%D9t4Tih5Yp1d#}-ZFVQ1{DAAYi zet(>Mo_n5iro1!n%tXD`R3gBm!2?eqq`MY2fz6McL3D0Pvsw ze_;S=8B_p(r)4K6_xiQ1vxl?0t+NZgikuw1i<`5Jor5(1_$+1WAa!;2DI_k}&Slji zgTJUbYm?*BYsEAHB8PK9qVX1Rwi$Bc zK75ai9=hG||876mdbvA#UpFtgS9+FNGmg`V3rSWMfC~jfie%|XetsC}?cdnukq*IQ zash~OYpfXD(To_tRgkzi=krdSb^ya?8Xp(v)JX4qK^yTv^jkL77$f*2MyE%Dh#GD% z86fQ!Cz}sQD`Es^rm*M$->?9)VM~iG;59d3#`=DD8VJt3O7+J8jJ`0CV|+^h=$~3g z$^*8qfYNcjXa&IF1wdw_)+-7ua04$?^lg-Z$_Aiwj2OQfz=Z%W;E`eM0G2;sHps~6 z1AI&c$P`cY#ZNfPiT5}_q*ANJo0vouLX2>^U2*jFdFa^2R46&ggv}qBr%Cg4`=(O! zhX@k=JR1RkZwcg}w`XXdF~ah(G2ys+LR0SF9oP@gEiAU~cg9Oxqyb>VBWUuTi?@a* z_!V}r<9#mk5ti*+{BNF@F*emi(sjVM{U!Y~m;Ymefdn;Cm)s4QFfXeErpjCV#FCfEtL4Nr0*YcuoQ`55pBR2hfA3ncE!-8j71v5ME@g_4E|g#K}eZT zJ6e|>p$t2faC;;gVXWAk@M;j?54{U-RpR>+QVo}wfz-)06~3hTsF;gCVdcS>7Ekdl zeZsAlM&grj&fY|cEzwfEq};%Z&RkBZr0~Xg=)1d%_P^o zR2KYv5eCX!jB}*%PkD*`BjtKuGLc5f@v}C4exy?MpY9atl;V_=Hsd~5QM#Zq4P(-e zB`f=C9MLaa^qhlX+nL)v+XCCrZH7}Lyi5ye*Z;0`Hrcd?-l;+ID=$?8`+P1J<` z)bPI2FVrv0b8iSiIQfTxNF*C|Iu#BTlG>Z9B1Ju)dOC)BK=;K zkLp{U!rq7)<{2Q~nA9kiWtK6|wUo6KkQ6j&CTW&r%^`a#PwIcv7d22x=5eLzz$Cnq^yUJfmKvkZGXephhdo!%;5mh_&&3NKE+bDqGB;kyMZT zjoh{I8ZNaCtG@4ZifQ1b`-=0!zUFi3V?%DddfEJ6x^LL#IdH0x*7`ObqftYm$t78w zqlY6kL(89EW*lcf9FlgEZY0*{g{$dv!wh!YO5cfAi@W+R<86^Y<_y=vE){Q#uIF%^ z)hapEN0kS)vG{4&hrI0?3hk=Hus^^@;O&G39<0nCnrIpD8m`xw--KsECCQ_r%gL50 zQRMFz*j9XYpb^eP9jPl{YKuyGo2R($JH#7XtqXpPjlPo7{ZIE?_eNLvXlk|2eE!O5@(AkRdLj5{cG;-) z5-s_oeHnp)(3rKEwZ2ukt+|vck1F23O1^b8DbsXxJsiNC!bIaR64uW*&CJ54By_do z=Qt0P2nU|E-)A0sa}x*?AYwE6HyK^zeYf{7pR8Zf5r{2$eey5ez?pvL1w+Dk-^r$( zrYWZDq}>`>7&U8+NKVfEUh}(CT7E{9At-L>t9qvU!)|FmbUF!nI{qp1Yi3{&&-IGg za&EoZetRnL7UV_$_{)G_5tz zlF^b@-ehdwbmZ4o=Wlbl56yZxwtC*?dqVLrH=89YvD$X#=X}|B`EQ+KHOP$>JvQ93 z=*@am)~eNNdMLY3$ACQa@6H42 zisk<9e!BJ_J_3Ai&-HE(yS!JtVaMOsiL|x@=-;zF*j`ut)0rr^O`=XpdceX=IlHqI z;9dsjO?pdZZ4ChMV+MfW4*+oe0Pgz$;Q0aoewzV+SPB48IwzX;DT4E8w2HipuFuj; znxndrHFV&8ASRyJ*vG2kome^AF8OP&H4_IvNuHeE!PI7+CLIC*av6pplAxTTzD^QcBQOlZSlIXAi8F6m4N~g;`~1tndhxkd@oYzV#X>aeD%)wv`+K&89rR(%|JcOsjpXeg0WmQ# zTPG*QgRC4mv_Eh)weW{ci6xVR<92oQ)y!Du#Id`KD{b_wQIoi2xf ztnBQLyoo{K53VYSpRH4+>80t3ztz@~p@!@Drvf-NY{B209EO5A->uk}zkdJD&CBak z53A;4#O;0{teijSJM`kU__5A!E*oyB%k;<^sTrIMWh{OTaPPez z4kn0E{4T1#3VBsrOd6}`>=%OO?o4FbDfMBz5AFI{4Uj2x9eRCd!vk?hPNvXvbGI?v zuyuBRX+PW5C1cDp?->JAfK$=X@b@s1;i2EBy=EkgeZi;K4EKPRLKizNs!||OYPm!v zc{qq!3cD5pvEtO=O9Yz0+~?OOxZ~9_`e|ZyHB;xWk2sx&NkL6bl8cDCAdL|9C?$56 z8L?sV{+~bpwX{GHh!ejyw&?DkKk4b>2Qo6#A8|$J{xIgE0QIJNhE%06sqi0!{!vI9 z7pEi2WlQ^`_#K`*$@aE_5>A%D6jfYYoR0IytL5Z6V6a-<-CY0_f@K}hP}yiW2B~T^ zoV+sP%P{#_SgguL(Q|ycb$RP-M?$U8mdkd9zR&nP=%iecK6e@xF}}Ao`f^=9+1l%9 zcv2z@|jk zqQ)`Srp5bE`jnvl^{`8U{>L&e?32R&DVm#a95zt@`sbHmO$|Os&goZQ(S|%E?YcFc zj{T~$pQqS4C%0Zuc2{Hnn#&fmbQfS5J~}dTSHoalD+PnWI3G1OHu}JA4Nw+CpREj& zL3Hxd9)FP0QHNybQH>^FI0y+^1)8HAtssoEJIjoQSUx^JR2}Q_<9h-n0&ud?TFZb7 zA90_yw;=k|qdZFF3OQwE1S*N@#NoZrB0eLA?~`nj+2f_$$Nza}U1_<@9k5D;vfU5{wk z^~@`qFHSoZW)AQ0M>R8a?(FQ?_*-&`$)!R>g)C;2ucCA5qjTANa$e)Y$tFEljWa;* zfd`QOVO&fZVs#q@xI8gdJNjbz02Ac$IA__lmp#SMk=s1iEDn!@Q_cF`FzH1Ybn)5y zJH7})nC!gg?%tj|2aCx(B`g~GEC^~z7=fuVJ!r*GMn?8ovw-s2Dm%oWY%aszK^Q8W z9*a-OvqIIAmOnW?-D4Rq(Vr@SoDhul5R0Y9by%v6IyrF#?=_bT@bQHd7whWkR+{%< zZ=Q%qq0gTh)jOCUF4fUW_DQ5P&%()f9|Q3fZD?0B#w@by<4urPAkfRff5=T8Y|xGfw-Za35-fUzj7i( zypL#OV`FJwd3{2e22n@!bd5_rjP%Ds_YV%Xz^2f8KBeZc)|$GxY4OI$=z1$&ii(b| zf5(mQ)vK6%J23uLcGE1N{S|E&G`y{UAN^kzXlI5IlA;UW?#|D0CT?PGpEOZ(la8kP+GS5-bx8h@%hnS!FCqOF6&e-#z+ zi;IRl#*Na3hSZjpmKkE6(d+LY&^IwWWOyfg+3)#W3gz5Nu-Yie3rD>t`9 z&<=2_!6BmCp4B&H&eS}c(b1Y*Tzt|ACT~h=>P83-9eslG#O!RJ(zC$YfaDibDfxEt z&q+Z1DPqDfaR^h2=O-ql6%-x|2neWaX)zA-gKE~+-kv#(HpYXVJ=~)+L|j7~)`QYn zvwT7wm+L{uLBB-{zPqVNDkyXd^lkT(VVNG7s&;mEIpyVq8q*>^f9c)b-D7&Y_B|4R zSb^6pK}yZc%$U_Ix@p!Yi+`E)%+%#jc%C3V@A)?1M1g~Y1LX3bwKk|qVqsCy#@+SV zr%#`LdWem-+KI2=))7fw1;bu>RXVRr(h}l;6Go{~gA@FFlg%j2(9qCG6r}!{rBSEtaG>u=Fsgh@TEJ ziqOVEk2aET_8Py|dWdP5n85n_`fSr|8dmHchOV+Pfb9}BD$1pE4{(A9R1`Gj%Vo_% F{|DAW@oE47 literal 0 HcmV?d00001 diff --git a/data/images/nunchuk.png b/data/images/nunchuk.png new file mode 100644 index 0000000000000000000000000000000000000000..1187cd65506ef4bfa5d9c86626775401f17b7ecb GIT binary patch literal 2643 zcmWlbdpy(oAIHC&rD3vm##tnz@sJkNStwh%Y}%X_^K(BbAk+Nn7HBPIa)<|*=xvb8&Ki=Q>_wl`b-k;a|`+R*q*W8aD*4EV51OPyr zPNR5$nFt06t_~h|?Jmv)lg1gE-&p|A`sqhNfRZu{co7>!^I!nLc~byLO$UJ0?_gE{ zKs*5eJ_Z87f!hG^b4>n;ei!il2|C5mGjZ~D$?3?QKDvXQQAHt1v^_@VwO`z+zov2S zyN2^Tq4QS?bx0PJU7vY-P^kA3Olni4p;P3GibOaA9M9nhM!O+qp104N)jk`I1ba3S8g+RD9(B#KG9vByLP|q-lXG<9E^f z4rev5TFHtQCr=j!Ii8}5zg_igZe~R;Mz1Vz(oyv9Ad^>;TA%yEuAp!rgFvaCoYD zg-6Xlwp3=|sZ&so8Z_lD^MgVG5eWlhV`Ga$CPZ*!EFI-?_%QEyV@z)zu1(`(lI&?( zTH4{pC(bQVhjOfC2xSi~A0`rV5u1XimTwqbAK1NmamUdzI|$tP%=XRRK0dt0MjfP+ z0~4Kd<3?X^Z?E3%p30ZzS1UgZ4-apzl|)>TS-hB;nR&?L8NVQEp9`2KPOprvcYW`A zae);P@sX91l9CqUXP5K^S65e;YMzC>?qW-Bdh`g<+1Uw-2X#im9^ke5`uao-N^dGN zr=wwA(Ta>N7Zc}i1O){>cmvjN^-Q=?c@lF1ULOZ`YT%c!=NG$=H(G`4Egn%>lSqiu zr%xkEQ#+G?@HZUkiEvx@6zqRGJ3QG0SI~L}-ne1*^#PhC&3}AcU5Ji~KV&TvPY(#wmB zvA4_0j!pgbSE5B78=TUWTTkD)U@FE*VF|FffE7rtyyd>06FhP%^X%+%$2`MxB~_{p zG&N1xE=zvWLmY7y2o4S|ZTMI3f4i92N60zMhUMeJMP`Usf|snwu9O1|WMUpad?#Wmiw(iq5>OW#>$x3;l< zhL-SuFbNXg+k31zYW-$w)0VM#mA51ElU0$3UEq4p$2<#~D}O%KqN)P@{l;7Eayu|{Mmg43E8#JZ7S++3mvjGiVWL?j%X5-C8bf?Bv(kJfDf#8nqxI!F z-(T;I#h7PJnn=WAF~Qzmi^y0|7-t~g#kDb|@iAQ`4l0$Zn;)+KcJXVa+^$0{iOa5X zHxGs`AYl*?avK|)ier`wC9>wi&#ORsT!$z+Xvg&K3Il0S_G;MK{~!v5c}Lysn(e?nJh^fzwpUShb;Yc$B73hl}dNKo;`nm{gG2u{`JYtr&G~Xg+_8B zQGe55Y{f)mv|i|))G_o54>t zJ?T29K!K{cJAiGqEDGvC!GjR|aHqR3Qz<4}E#9$8)E$xTKG3Z&2xu1sTieYYx?c8> zr^1cd2AByQ6&e#j~e%U!|eW^*s{h1!#sh&YG;OnmzS@< zKa@M`YY=+FaA3KogJ0pBonb z2929sdNkF6qIpR=61m-;wUUbCjciYw68>XCPPNHq(z2Xa3Ig7pnVC5=H__Cg=`^#C zp8x02J`69-pZuLiZmWUCK=$|1cdLZEf;R@IPrS*V=TsTp;*< zUlJjOg-$!vH}T|XYE*OB7-`ftuB|K_Ghn+@nmA{0|Cr_UC}FrCpcRI+gXh(PkJ>ja zG3)9A@7mVSq;6D3S%{w-rJV&n>RoF{H@l_vxa%cxzMoA5Co2tWnwY3Kp~_v!!_lQ0 zoHN1#YBy3Ld>B(Pz725&31x_rzokHeF#|#MV*5^yn(YcRES1Tfu+0Pa0|W9!5nj~g zSMMD&Zw3O9?8ZbtkuSC@+gCE6;P{8L`cLT_!$8P9Z6Vhxhm13@H)&D-t46u457*Y#zK$zix5c$>^z7U6hmqN>rw0Zw zpf!L?qRjS(SQ?y}mZSez{_c9O`$PLTQ@_GPca>}N?G4ijx^wb-9*Y0vvJUMT}NgaDm-l+xf7$oUVfj^R`Q literal 0 HcmV?d00001 diff --git a/data/images/nunchukR.png b/data/images/nunchukR.png new file mode 100644 index 0000000000000000000000000000000000000000..8e079079d3e4649213d9bc285f49c99d17706178 GIT binary patch literal 3060 zcmV(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRZ{dPzh+nrPSJb z#VWOeEzTSBzAAXBEs9QEPfuHGR~_UeP0G~-5KMpo5kdk9YOBKgyu8Vq_d-ZWf$#nZ zQBW>nUY0KB{Qh}4Z=UCq=lOk~@9*Ik0wCmWA|xav6u z>p_e7bjSnv+%ca(C%&zbo4LivO}qVhrdjyiJN4X&1TE7Qp(L1mmcpV+J5+7%rT22; zN37zcEVB@kWfrFQM@)8$`0FtP9kYoKzhz*vlB-y!w!@P+@NYX!{F-^C3?<7a2$vIt z%PFMRI#Jr;K}G}LA-~b}*>Rf~akntf8E%e-5nrjWw;XB~ zp9>i1h*kW_3LPt7sb`_HcjG+mskz$O^CtiyyG(p?TnP=Sk|07!AXO3^v__Tn4j<<^Am+2hxHPtLi zJ3Lrb#bW9?3VWLbE7#pSXPM5?AW;xVRRl6M!ADnIFmhhZD`OC@@D2D*J%>!QfD{AU zywk*g|1N-%q6!G6=idsMnjp4_#x4`TE+C-IM(*g_^&AQ*HgB@m{=C${m2yY=j{m1qmX40z<7G`rh!FhE`{g<0(F}kR>8M2p?TDx zUvX+Kg_Ih$qP)X1=~Qdyxc?UD<14O7A76DL;}VA*jXZWV^4Q+M;kZo{j@!f^2b@DC z#4~Yy9rtDY`3{`E>H=~1BBjQ+^`Z(06gS+s=IX)xG6oXG;4KlUB8V%YapoJB^MFOr zuc=}Gb-*J0VXQEFn}k1aHF5`)H{2K)U*2#-al_r6TI<}itC61?u*$vPEIx9P@hr0N zUUqS%9n;QHkSYm2`^E*fyBCWu+A%GULR9`>pa=!Q!g2;*wz(0nVGyYz$Y|jHHdde% z1AAJgCXgt6;xj1vb9k+RJrxj8wpEA}o)>>T34%iB@sk zh(L#1#9ywiX7ghTX-E{*z?UI-dy#R8Ls;I>F#ec)mcpTC5vN)^AyE*-m2@D}EX)cN zD5HT-c~Qf-WUArEh*S~GEoGeh%)+c;fsWb4M^{y`MN*|tt)}Pu4$Z_;2G_cJaKa`c zTtPuL0*oK%aI=U{zji^EPmrKxaKIwG8VJl<13M|{f}Qg#=|~ZwBv_$yG!6@tUe6to zhJlsYbNTQ&yzC(| zB3w>k$wkN4Ljvu$2-0{B1F3583;WChEP@wtCG;JNHd2JiDZ~`gIA{^7#v%s0P5iix zMsD*Q4darjhyQ+=nqaP$;dV6gNkamyHL$7(<>2Lf`2vHst{$WqSWL?u{TK5KLTnL@ z#g+E+CvWMnUSXb+Wv%43ID(sLdM_Cya!E6m9zEjWrJ;x^g@LrS+DK)I(h4USF zp@hcFVj9!)eWo<7gvJXc9hj|QkXFZ?K4KLg8U%FQ);V!;rM=dl?EWpIw|7H+z3Zk4 z9Z5cCYnbj#v#{`9)3V zCWek!v2HeUTcZnaC10e9ptQpSz1@r0B6>ubmMADJ)j7-uEW%^=6KH)M_t)4W8gok- zd!|_!9_Xk|oRD0_=1JtYa^a;?23>z2mC)E_;+F&y(3H7apCgv_ABGy* zgC^d4^Vx7fQYArRDdX9CiHi#wpiHwcJGRJ|KT;(@yoSML@mrj_?80c)BSJ|qzl>?$ zZxNmg8lWwgxXu2g56z>HtY;y3`|w6JJL=ifU-vX+w}`(A8lbo9xl{g$PdP^+(=34Z z_99-xKsJgAl`08dt*}?;Sj9(z2Ix%#TkN+MQYC@>dKU~1FQNnmrp-KudIvtC1>S-Sb8j3r}w!mgyX$0?G1ymS>sH@mWv;MJNb%n|QQ! z_28vaX4FE?Uymf~*$;yfC{pFSo-#PRm{ClRT4wu!Qfr-ugAz!lCeYivQ9!v75r81b z)C4n%X>4t{|2}T4KvyDF1knXFu66a`qbsfv4e3Cj=Zk4?rdgQxfPgjxta4H%!Hb#> z@ZMhRGYbI&C1@FYj!k_0K>%$ua&OP@l@B8WCF|KniGm>Mf*riK7wPrBo6bNad%4ch z9P)rZ0RyGfu$AF*3M=$17*8)&Rj~-em*=0+W1W6a{)}vPO zsh|YfWaOSr&@$hiyxfT<-h1=nV>ovmTSQ~0iBI)6UIZObrdfFG<#NXG$yFB`Iq$F@ zPNw!5(zguknSq@oK?ejNB(>I=RYE-Y_w_Ce^*B?jI*xJ15@W>l2hf074E}gqY|8+Up03EuxX2Ww@m}N9oQ+ zK4G}#rJw~m)GSJ7mC)UOptL&YC+{^2p&N|c!y|QL1uf7KtN8dFEhGAY-fa?=1=3y? zv_Sv7+&N)EIm7s6JEMW$^PL9T-pD`n`bEbzsnT~}z4yDmLThW;?r!&9;h91QXC!BeyH6fJR~|Lk?JkDFFdxTg3^htJ&OeIl=lm?&DwrN~vMbgym6~ zU&dIot>O~_0rhv2ESOnLUNqm`!|irJk*nCghDCjK{DjNI?n8l2C*+r&#V8n}%s_3WkCA{wE26ru}gq}4ie z2f~i2Z#%~({xr4L`Ngba8lkxq;z~NOu$=KMs<6|GD(uufk4k%cQaQuTFJpRV7So96 zZ#bNuPq46@5mRc|Lpj#L9V%mPL_gdj{%EI(pP5?cJiEBkem$|25fijb*L{r61T7;h zC}-?Tb&l3`wXABhk$ZEak$ZYu1NZRl+wu1K{$~K+O_L#>aFgc%0000hJ!7+#&mXA*)%bh5IEH8hCnq?t7e70r>2!?8 z;aqY`kLHCtcm7C78mFYD+PWR%;p5}GJ;AWKsp*heO3y={3A#&mE#ABLuc1+zhMrzs kPmkoDJ$u5GlXR|DNig)We7;j%q!9Ja}7}_GuAUUTlxHvDoCrRi(`mJaB{)|wjaNzH#15a|M|VV zxv6nZfC$f%H?9XA&eenKe)|gQu&X%Q~loCIBGW BF?s+1 literal 0 HcmV?d00001 diff --git a/data/images/pbarleft.png b/data/images/pbarleft.png new file mode 100644 index 0000000000000000000000000000000000000000..3fc93dbacf4c7826286425736166d52d32625d18 GIT binary patch literal 357 zcmeAS@N?(olHy`uVBq!ia0vp^0wB!61|;P_|4#%`jKx9jP7LeL$-D$|SkfJR9T^xl z_H+M9WCijSl0AZa85pY67#JE_7#My5g&JNkFq9fFFuY1&V6d9Oz#v{QXIG#NP(q@_ zHKHUqKdq!Zu_%=xATcwqM9o*-&CYr@q7ybN5&7G>w<<<(;GyEkw4+&*|PQQD5jm_g*xi^gqUj*f}aiaf>#WV;!Ecls$^s5mZ``@6BI z_QxfrB84UqVbSk97G3O^!op(Aa&&fUYwOOpZ{LA yP$JzSJ3IUOts6IdK7INW)ypp|8@xk=iGiPY?&G2v=gNRyVeoYIb6Mw<&;$UCy?@yN literal 0 HcmV?d00001 diff --git a/data/images/pbarlefts.png b/data/images/pbarlefts.png new file mode 100644 index 0000000000000000000000000000000000000000..859b7ecc3c6c957ffceca851b1eb444e59106089 GIT binary patch literal 442 zcmV;r0Y(0aP)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^c6iGxu zR5(xV(y>azKpe;MKcSRTLJ1No;#3O7K}3;Khf;^qrOw60&Vqv=I5|4Ii;v*u3skI| zuh6kCPzot+FPGDAB*b0|nL8Nxa1j2#fA0Plk^g6N0zr_I*{mq@xhIQ-&+4;!vRt~N zR6(>ZNEH3CIw+N+z(a+iI?mBX3k@9ONQ^m5Sq;L_C0tEHx2!LC!ac5Wg-gP{l+{4% z9STlyhXCI&7~u;;yb~UztOik3rl5(}->@-p16%xV)!GjH>8y;|je)bHM%1apf4DtXiba8D~CQWJ1?G&*5CX0?)_`1xnteBJU*`nqT=HAYHZ>nA~9b-f7U+CQK_%L r{_2knbLZYQv9;aHwrFurNGk)+ilxc@t;frOeqiu)^>bP0l+XkKLR)(M literal 0 HcmV?d00001 diff --git a/data/images/pbarrights.png b/data/images/pbarrights.png new file mode 100644 index 0000000000000000000000000000000000000000..6002b407dd8ba08ac0bd13da2a86f470483bde72 GIT binary patch literal 391 zcmeAS@N?(olHy`uVBq!ia0vp^0wB!61|;P_|4#%`jKx9jP7LeL$-D$|SkfJR9T^xl z_H+M9WCijSl0AZa85pY67#JE_7#My5g&JNkFq9fFFuY1&V6d9Oz#v{QXIG#NP(q@_ zHKHUqKdq!Zu_%=xATcwqM99Jg-qfFOyU>b>HL>fj?{M1jr(-^iR$OH zdwXIP|0%Xi`Pd+_Q+<_dgz}+69^EriK_MQQ>>($$HzX|Tu-W9HxKQ8Z9s7=V1_=)L z+{I*Na9)+u}KhV@E#3k}{Lfv1k`~TR3 iq(rI@acJ%rH2=Ndp#Hgt=|iAr89ZJ6T-G@yGywp&i;yP( literal 0 HcmV?d00001 diff --git a/data/images/pegi_12.png b/data/images/pegi_12.png new file mode 100644 index 0000000000000000000000000000000000000000..5d19949359754950c187dc6c37c8f5e28317b506 GIT binary patch literal 6122 zcmV(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRa8a7jc#RCwC#npv!5SGnJRYpuQZSi7puQ0MgN$!-s{@q{n&0QiED1+;?NZC?p?JBKr*ZQyT`+vjww(#B~gz)?gUfz2Vy#M9p|8kO(M;uxvRKCN& zFEVb{Ikc<@ha*w~Y&~Lqc8P!wvAD1T@taiDge+?#&2gH-qqU}~-$we1>9{0QYi!#T zx3WSe6{0bOLSe@hX`G=@3d5Ua0DhFVY@uXJ6oGl?NQA7J&SuI@J2x-Fg04kB^(x#*x zOF6iN91rP)F*@nuTRr-9f%h6aGbB|`n&d=!ox0hgEc+lltEe9Fl)-B+b!m9>j3~_uCU#FyM%84Tr;w0p*JCBleU{u!E0}#~& zkrfC(#|~$xdWx}AbfOVvk&U4s>m4OIx`y&GgWUp8i=d^!zQk;B8O#o8922$^%-GVD zC031)tuExZQ#FR2am}EV#GT_DyYmjhcuz~NnNn99jO#1d*;Upu#k6>b+Dv)q?>@$) z7_zv!gzEKp`Gp$z(+2@Gvpy^tf;d1GB~3XeYHRdzkD|Z8+;>?z{CDWv?gZypF&e=l z6hq9;J2Vbr?Qr!JWB7KkLlM@!5xWUNu>HPYK2 zBslgE4GVY)K^P-V3z7-7?$KE~PH2Wy{R!3JB2oJU!b0vn7sh?Kq06oJeFf3|B-lle z;1#$Clo$dTf)!N!5Nfevwe{a9U#}1nl*)1CRdnvCi(Rbi9zbFGP=V`4vCL8CeV;Gf_>j8A~ zgtWVYD?BPZO6k_ny$(0sc7k;2E=Z5!Nhz=h0u%xypd=p2WKxsFo^){;Q*SY!_Nn_G zAzCb*cnI3};;Au!rN-cKSR~-R#Gwg9git^OzF9*bKgHs7i=8)rN1RL2yhT-yD4Xr; z0qDF(p(m6!X7Pqc=^Xoenjj*Im%+!-WJn=Mq`~2l2qZILmqe&%jHjNl ziC8`M_qf&1&=3I%$2OXR1c5;iu!8sLeq;qN8X9eAv>@}I=)-prZ+(dIrER*4C!iW2 z>M`(#4+1bz2b;tg*~WK2jBDM72gb$`*OE{O1co>)fE@2V!i>OANVP|2OW64a{j2Ax zRE=-tB>9cxhdzc&0-!(=64*tgGvEc%3zXCl6!?8p!b=(#F_IGB?9hp!wRR8NmwrUk zKZjmUNn19=EhO5LBjQoVA{}M^!Sx66) zx)@(9g6L5%-AO4rlsF>Jp~8SfEE7~$xco2wiA=r9Xnr?`j(i7s>>`@5(@+;v;!Z=9PVsILVKo7ViCjQnQ_Qdr6Muinj)dAJ zcm;s~3y6Azs7C~?2(U9o&I5a|Y)((P@izWH7!3RwD!;0O1gU1P@*a zT4~BOu*`}PQ4BI}6Sp$vqpNKGum6eXUubuaP|wffCZ5E0NununJYdi_*vPWlUIZ)- zMWDa{9tf$h)ed!kiDK4=&XN7S^h0k~#O&S|_ekX8hFL+v+kdP>m@=?@3k z%Ho_v65+f>3QHJ(a4?_F@Y3UDfKVYiT0liPBFVswP_-j5hp?lNNGG)NfN7DiHC`b| zA0$5h84yb#9ZG-(LSa!%V0Hzw{sws#;G89CFQTISdH`wE#aWAMcJOLQqqZ5%*O@f~ zoRkO^BV~j~@0o{p;6MsZAQkbee-cAduzeLnyU@n@yRPHKVX1 zvmsf$f=*5%%^ISSgc^i*cs$YpUgDgjHVzS|=vEgYd)VnVVpgC#4wYy`vgZtw=vKfS=B9HNxOcNduZl;+R-{$~KvP9ZbM z(o@fd)ZVeyJ&IO~c$w@Gw()3P;wVreLI`k`!yCu)$|@#HF(SZ=5EbQkQ(-EH3C45oRlv5gY zfwGto>V(DKGU4i-$ip87A7doUy+MjOA(j*Yb4P#cER*%OIoj1QA0v&UsT;zj91$Mi zM*Du7OhJ+#rl%wN{axx}lPE7~*1Cw?K@cMBAtpj#B#6+_b`_0lqpO?I`FU)8nX;Uc zL^mRWkgD8;azZZ(@bT@K-h%`;eG#AE&X|OHznn>E6EzKZ1I-`FuKbuv&KQI-o%D8s z$wip-35OTxxC64$DDD!aI|vh_L`0h8R6Bht>u{?Rw5V~`qXP&KNI>8azM-5=2pWrT zYJ62vmt*SLCaMvT2t?Ror-snpM0fQRbnc=dqwx+c6p<5%3J7bc-lBZ_pAf@s+G&T{ zI?B2rL!grgS57Hr{(1mevO*H=QdJsMNUPn&mJR*s6kAPz3P%Y-q0x8*f(GF#d_AL{ z4M>*-oj9W$I!rMEqv`e*892*OMjSu(uc7@JC_^d@tpJQO1dT!?@Vgi3zw=))S6^c_ z?INsaG8~}v9NCi4cx*jmGMODfV&4Uq($oqiAkYCpyMvt1m{kSd8-mc|DN)|-MH^~_ zH0Z!!=3{0%LuyeI%8WQqkUqnO2_{KN7w;#z>0z7?sSHRBQb1y6NGz~HdG1FH-}*;Z z(i)Z{AW(=XBuNsa3UH0V7bQ|Eq}U^}AONor9)$CI z#|lCsrNH8tO&d%lNwOT-NijmP-uLLv-5k696eKZTH3Z3?DLP{jszHbgl<)n5YWy;b zZHFyt%;+*Qs>r)BR@BUj84d{IoV>MsKrYl2AU#2(F?GYBKO`<@WUU<8Swe~k=QI)p z)*yrgp#eedYGe?g!v%sQKqW1_wHO(bEPt5R+9?nx_fO`gG_HfRf>Q^ptnJL~8E zkt3Zc?N*n;q`=w%vt7%~NmLA>N(p=eX_u_MdOd*Jtb^%Om5S+fjxiNsn4*$4QP4%n z6zc`vDU_6W0gV)B3w5B#I}50Eg|eAa6ctIg$E?n1-|;!ZrTf9P5poAbLo5am?g~X zd|`>3!cWnT98623K0)3anr>qS!6&Qa2iRVS1el?&nj^%|F!Zd=? zV@tzyIw!0gIsqZT3vdD&AQBRpXxu~s0a9o@mdaF^W=_{Hp^5g;ihQr0P=IQHDQVtA zbdCdE$lhO$2RT8=3c?1l^;@ialRycgEI|ds>q*?yd%LSdg!2+x&OlhKol{mLjH^I` zPlLP)z2wVWZix-D5ZUG2z8l2p#!n{Z^ zehFB>xCrkQNfbg|p{w$G4YaZ)dP@`f>oLROm^@F(+c823WZ)3W?C;IK3l##1*auMK zOu=|}h*lC6&zTMeh<;1yN`dvX}Ot8li$ z&L((oVSYeCQx_6~l)Sx2QEXCF6?r)aTjIqOQ~_9ovIqm-2kf0oShT89l(dw0z zWY+^Io0MX>NCF&6Q|w?H*UXvJkm`R$JTV|gdu3m+L~SIooFm09gbCwTMs0S$TFUw` zOWlv6#7(I30y33&8RA&R6Jd#|1A!0NPf2cO?+~RXP-?ICb{5%agg=6uuCO!SM26eM zaZDK=;6}T>Ll{+2O?HUdDY6Wi7F*aTrlvK!$V58ed zj+V)ajL-~N2q(me1m8x8gIY}G1eJLz;~356blVv^nG<_MU2P(YH;BBTnGcYzpdR;` zZ_J34B+0utwSbFrOl_$mgU&O?#T0GdLAVihu|eqsJ_yOP9#&>lG|Zbh%~X>oA@k`b z^WlKhgovR*7Ke#iM~MT4@=Msw9n{J(7CUX=^8W##F4?`ZiJz3L^^OpP0+c0i7TL@R z<$!jqadL#5@8ZpfP(UkNA5vY(Tl{99C z3Se<5VLa;7QZ2f@4DUuX&5T^fB#9z!2Qcd6WQhnASVx$)4#@XQ_5&MWv=O{7^ zDJCVN4(PN}Ow&Lu=*1nzm)5aONjqLcE;aWXNYJQnf0-8!^E6tx0xQmfmT3t z><}~xuM)iV^k)UFxJ7cbi=76Pqiw9;B|LTlS}lxJ7!hKXK?p@X_cYa%CYWRE84Yu? z)dkvmX|KT@YvQP(F6Mj9jdlmTqp9XN9izjDsN05YiMhW4zf>?+nxJzW8TV<#oI+-d znm=5ifz}@&rVs)l1VNzw z?`o8iAPBC_SApXFUWnZ9qeW4Klya|@-j`WeSlE{ngkebDYF+nir4+5KMHEITrHJGB zU=y;|zYh!VJxVEr5ZCUV+Z+G#!S9cLUnU3wy!TjR5mJ(*DKb!apsK2U0Q-$~tvPk- z6gS^|GvK-L#vA$EsZ(gJKd`{>eCIp-!?*r{s;;osQkLZh)^RP6-Ezw<+<4=Sy#4mu zJpAy(Jp1gkeCbPHqSb2g%rnn$>eMNofBtzMeDFb5R#tfGsi*kj7r)3K{_qEumzNm~ z2E6v#YkdCmpXb!6Q@r}>t330}Gd%FX1AOgkU*pF={xN6Ip5@!${x+>vix*yafhdZu zX*C>m#+1cULsZ%6L!Y4lQ30`~cHNN$&Z}INC?{f6$QQ|meb#;|~zt82% zmwEHeH#v0Z5O?2wH@Dt;E5qTCD2i~-arW$4c6WFA?svb-i!Z*&C?RR)>}OC$RoV_?z@~jcaBFNeU$g! zdygA#xPc@|_}%Y*w^v&?4NpDw6d(K8$N2J>zf2GWXss!Vf|Dmt^7PYBlOzd`Jn{%h zl2F(6euv0mjKO=)bI(1;Ew|i)l#-WUewo2wz@UP#>NI0 zFJ9#A*|ThHZ1DTv|DMa2FZ0G5Z!jDVdFiE>c=gp+dH(t5dGygo`P}C|hcSlleeZkR zbI(0I`Q($VudnliAN+t$r^C}vKh38;^(juDK203Qtgo-rYPI;rH@-nxmhA5Cvb(#> zXf$Ft95R_qaL#e&%o(m;y~+=N_(RIF`dFrXB_|0#A!!LgE3wC#RNz;@QCr)tg+&S*O_g)@* z>@l>~oIih_C!c(hBuVz(HEkN|x+X~y%Cf{chu(MTbzLKb;P%^Z=e_sdV>+E)iv#Z` zQy%a_2rq>2K@fQ0+W42B_vak+JK!I9-~qq1wDf_wQc4f_Znx_nfBbQO`t)fZhM`wV weL(*GdGC+!--ls%ZO&iHc<=xABk}(p0KoUDh#nWxQ~&?~07*qoM6N<$f`u4tzyJUM literal 0 HcmV?d00001 diff --git a/data/images/pegi_16.png b/data/images/pegi_16.png new file mode 100644 index 0000000000000000000000000000000000000000..039e476175b12763fdb276dfec5a5158d4354bc0 GIT binary patch literal 5962 zcmV-Q7q#e#P)(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRa7&`Cr=RCwC#noEpjSGnJR>$RWfQRh@ucXd~H)9pt$HrN=jE+Aj9&E;Y93^9*H zkqyd#fhD92JRmb>z>G110g(l=5@F;JDF`FO#n*|D4K$7IHf_7zFIQJr)p?)&UTbA= zs>}FRCxhHUgp@69Y45Yo+UxtT@B9AWV{PHRM+o8h8$7)CLSMi6`G2{OgRL3M>K0VK zNn|f0D?=+vP%;EJBCoD8D0eV%M7tH?vlLMnf?%E8AHoE4guF)CT)`Gonx@885mC5C z)H+C2duC-$oWzvnS(26@j5M=s!gQ8nts)3IEUg|T%LJBy7higv$xJY|&^>kno$PSw zvg1Ge$JYVa18{h0#Ig2-q&!R9KTffek~ddTrpClMWqysSo)NV)tyYIt`yh?-SYHt+ zM<^3SYQX2{X+TL#8l@yhPGE-~fgx?DbkjCcd2H_x-e%-;k0>MBVTcZ6;&umg$b2?u zW%(#gIp&SO4B6RH%>L;T*RnUc>Gt>RX<-jQ+rV<7m|wYo%OZ?Cib)fi>H>qo6&lfy zblQZSRf;^IoX3Pgj0&dAhub9W4)t(KR$im5rvyPr9JX+^$GV!j7^3SbItT!b5)Ff` z9VQc4S$PL>dxgn#!gOauuh%6~7Huxi(=;;}UuC(ULb=H?RT7;TGdy;T_kHjq z=M(giY(5MOu*I><`$fX$f25o>2QPgfdKCeMYcq*e>?FVAEI7;FETlRl^Wp<06{&Z zKmH49{szO>{wJ?r_!DcrCE`wqv?Y`q_|g)EdOv`veT6(55F3kVCsfG_W#wt?3Yj@d z`{etGPW)?d$FLzF9FhdVfRSA1Kzu8CDaZx}l{SQ{AyQe=C}i_mhK$xZaPr@ftUmoQ7eCH;dHwfXuT5vUj8l*r~2|HuU+Nz>^*f6;^ zW;7cU)gkj@g#+*WJK_`ffm$PLBuxmtTp+y1yP8H7NU0GdPy;T8yg|h8Wc8gN=h`2( z$m@&5QHiJvipuT>khb1O*<8ieCEYt7p>^UBw6s7%2~+~+fCnUs2u;c|8c&wIi;j5? zJN*k$YfdkPX$ES(!jbeog5=*p{z04r7kY9^Ix0lV2J{F^Nrl9tXmm*AAc{4}9_sKd z)Pv)UUilMoDp4WSF5d$nuU{CK(+(z>C67;f2tw*A!n+b>2UOnT@WkYF{fyYosY!5k z%yM~&ZtG2C)G(ga%!V;>x{5s5WqkbaaVL&Yr*nj82y9K_1+@jL3bFMv;m)%})oUmp z5(!YwK{y8-G{;yya6g)uVsHVa8#?Vn`vJ%%Ct!+D6(I3|$0LciUsCxEitTH} zC+^22cYeOw8kW}%;!K2?2e_;uSviR8uHeuM#_<9P2noWqsIPTtyM#16 z&a4TEvn!A;L1RHWv;v4|n+Vcnyjj6pLy@T)u#gsDYld4R#NZ!^+Z9C>F`Fl>^xsSW z<}cv|&@3eIZUMlP(};{%hgj?JN}x^{}C?pabNCi@Wt_@+{xfeS=)6C<;u=5Vm_X&M=#96SsPVZGlBD{weHY z`S1t?3q>w$-ur?q8=;hfu!9T$EfB(jw;()72@)g%VP+Kd7H`hyBtjAO4wGq6OUsy+ zW9Is_ni&V9gm|j()g=h0s3=C7d_RD|1eo3ut`Z0meA8z{kw0ZvwQZn};5z(-K4w-d(+($xqr zNG{H)M=xNqHxU;%vEnMV@ig;7*b9ejz?y*j=-;RN^Gn(QncY|1E0iz0_h6FjEi8 z*Ce->l-c_zUil|X_hp>jpvbQ>n`D%Adw(2gyrP~JAS1#+B2-R0hV6|@WaBZ008O}y z`FflHM1gfVG!Ee1h zc22!Bp)MK%lajXk7@gp2z#BYf;rM>{L{Unpm7!*d0)Z2rPy$VZ3M_>hGo~b1KS6y& z(pXE_Iz(^j2yxKgZ$e&&#Bq5pfh`k#6~RjZ$$(FMnsDxcYt^+ka;WE`kn1&cP?(G^pKGcMJ2!Ln^K!yh1cBdTIpTAZ9DjD5PxD>KP_Yn@R^nOB?w3 zDo}wnc-!Bvfx4L>m1L>gx8CpM1)bR&_9muAHzmn z5E>nX2v-3O0tZ-x1Sb~>r}Z&SorAi9kaL7(5hRVkX@Mms)*1~2D}RUT-$7YSz|WC> zuphuYzec{ZMZEJmshv~mnA&Qbw-8TvxqtU?61+xJBV2@0>$v_2is&F?Yp_ldc2bn~ z;HpL1O%2N9B$NUyU9=WVhc7TX`#TuU78=%I+c6a(3Q6q2hesg36)S59YocJZAHZl@ zFq#+8?h~vW#MKpp!6sE%A*2Bz5r5@_2)oNJ9&e{4Zi}eeM9elRrdyCt5lZYyX|N;R!^6aBnid@Edks`Z?3{KL-X7F6xYc0>dtAB_KkNts0nRxZ3Rp5T{*|P7i_v zm9$CQ9cr>k) zqcSJY=EQEd`{>=S>~5FSp=k>0;YCba5J^u(NnV$fRY|m)a`0CGgqPqdn$a8h%@+tn zK-fg&^=qWO6OSXnAzXt;Q7K6f1}Lqujis)u8^i$=9t}Z^vmS3f?Oq?8AkU|G+^zmhHjqfLtW1RWY$oh~YkK^YnXYC;ftcg+-7PgoX+(FB=q(_6JzM$}YT z6v7AKLcEn^KsC>pj)oLvfwgYG2AuaG1S(Fj*3!&pGzt(3ZGznt;JOB`XLSo5Xroaf zTN z9a`-h)B{2Yq?8La3q_UH%*ui=>C)|V7l|0VJ|F<+7Aq;h3qj=qoJsJ)pyD=#lZ@wc zdX1$ro(4z+xZSo<;5Bi34chCV9AYX_dSP%4dckxSgj(>Q(x9Rkl}eIUx*q^_iK`2I zUQv}fbuDPOml1J_GBNC~-XbLsAOsGNZyM@apxXyA?Il!M;=IRbfow8tF+iDBEE0j< zTUet*=pJX}-i4oK=%qDGxW*zpitEZn04W7hXEZ`VRbs2^2K9h~BAZeVD^w8D>MkQq zL@o8AgaT{>S}lY}$VD$lXta(9+N+2pg=&XlG9q4Tkt%_mZ4tIR2+S^@DBNy9SIbAB zcPF)*(m#AVw2zPhiiSoQ)UL86TQt)FO=A}e=ll)of$5l%5pA!ClOA-Ip|+HHfyyh4 z^>3LF5`;&f5i%eMQ|fs{;0Iz1uAPh)_2TC%Mbe-f~UmzY@ zSUmPL+Rau z)-RaH;_)5=6;oToa5PysbQ&PsjCyd1!G+hc`C!q-a~TGQ5l~^76Jb{FBsy|8L~GE5 zD3{@wQwi`9ARXn^voz&^AWWfg)a4CKsI%0g+lC?=F`Eu(8IXt8P)3p407s5i;A*wo zS&$fO5eS@77(ZY(*uk0=Ox-})pi5xzN1C03==4qy@or-b0w?jJ0U>chV!c2}gBKCP z?k3-=g6tZTH!l!m8w7exGu>fUvLC>#X(*GJ*`bh#H_2@UEfbf}mOy$fyd(mPiXkR*ADw=Ud&vsBN$C!JV&tk4wfjW>N zf)pV^g-|t%mWL1{AY-m4G^@+hrluS@!VvmvOGsfE403jcf8pTy-*Dj65<@IC83Ysz_>O^#UA>*9^SI<6+%_Yl6 zhXk!t*yIp8I6y1{%H5>UP$26!knR%2rT@XjGrz^pE))6&Wi+joqX;!&JiI|J)CyY! zs=&`ne6dB~uCf*{aUh)F^B1wFN0fPhNSAR{j*vCT9c-~lbM+i;@91>;m>`6F4pjx? z37syyt0S52yh?dylk(heQQcG6lm9@*I=&8w^b!Gr+33%R$@9eeJYw)?jtsVm!vG-? zeBOoL0orj3Z8vWa$Ycr4m@1o4Yk^p~1rfzeW(CbWqwRO_P9d5h&el}rnA#5UyoOf(B2b;J(8%4u!cl$p~7a7LYo9@JXtnnTJ2!#IjhS{1c{`a4)At|KJUR5 zpxqduXEgbkeCqJ^8tu+;8r@=UO9}#f=rQ#+t(BUYA2M^regLDog_(gTE%A&NqTw*+Yo z&ZBGxVHC)kI@_kQb97>8Cn>5GA)RM3pJ3yLwC|DS8l~%!HRri7*nX=}`dj~2LU{i# zlU@8(Uh;n_#J^~~sEN|qL*UuZOOv=S3#{W*GyR~x|hI{|J(fg#7 z#PM673>afbl4S2*DTPuBV+<=RD{t|>*8gV{+SLd_5bRAVrQExA&f%OR48wgwUw;lz zmgU>t>Aip3C>nA{O3Q)$0S`&sL_uY3NAN=44$+C>or%&^xFMWw$|N7Uw``z#6kw+fk>8GFO z7r*$$egG>gD?IejLxf?-cfRu-#^W&$KKLNcIW{&ncy!{N*n*91i*DM?Z>`lKbwvj~8Ejk*|LBtBl8EmX?-ix7)0* zud}_q&DpbO0a#mG7|z_ih_IZy_Y}#`Okd%)1T(dnKKNBLmqnQA^!NsKk}(heTsAE&hhH2ukxAC ze1`Mq&vVmFH_>jldG^_77oY7+r~KdtKj5Bw?%}ha{p_A8Dy6vj=9~H94}VCKBz)o% zpFk@y9uH<_sGf8=O3OlEa4&W39y)gZG{^O)IdI?r#u&D?wr=dizyJO38IQ-j@WKmRxpIYz7ca80vBBB1XL*EQe%_P4p~uDkf&_rAxK zD_8jLcfU)TrabY)6Wo9Q{e0ysUm=cTE?&Gy6h(aPYhOca&Cbpao12?VCKK{JXM1~_ zrfE2H<_v?ufX5ztjM;3)Z-4vS{c%8RP17`VyIqQ+pswpZIukNN+k0`~`T!4jrIeRadabpWQhKG- zKidpo?>XRw5PmlZ?v4M@hd$(w967T0+x6!{2;c2?{nx+#b^paLe$j_v__lFMDQ}F~ sH=oveZ@%mEU%&Q?cKzRWB>rCm08?L4@b#@IG5`Po07*qoM6N<$f?W6#E&u=k literal 0 HcmV?d00001 diff --git a/data/images/pegi_18.png b/data/images/pegi_18.png new file mode 100644 index 0000000000000000000000000000000000000000..102102e5314066d1ba75090e48e07c9175ac2613 GIT binary patch literal 6575 zcmV;g8BpelP)(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRaAHAzH4RCwC#nrV!sSDD{`=e+BE?^^fPty_Cn*V6mqcH7tnoH5wg;{^iP0)?36 z1CbB|(nLU{QT)MzC{n^`l98eWkPw7{VG+R!PGB&`Gs75c@ECWuySuuotEy{X?!LeG z-gi0qP}McItMiEu5mJtHrMEtuqxW~7=l_46bKVk4DTEM;Kfs}s68g#!ib4Vm_!Equ#+~$LV=7E!zE71Upw}X*G)UVX}H;7;E}4Mi+LrHfgy{ z>Paw`x5-q&j6|7>I()SFG64Gkr{8@ChnhY?*kLdiBjG42*H-A1*NLb5+1y^F(aGay zEc%C&IAc-Tr8>Q|MUi`gqF6pG7MEFX)QILXOdg-6-f2;Dt7J2MI94B4&&RZ* z__Z3<$_~}eDn>5B@=%gQEGew>&=S4qNrgU;GInM52kffvYr%-ka zp-GNSjgoF|QOx()Dt8%15RF8j^%eljF$g&0#Ac8|M*G|}iV zTY*cf+o4h@F%XNAO**8l49;?q-ts16W|TuyhX{wVvqHuD9>3JX)(y0gNs=SeJXc(W;#&YB z^&XKf40IK(ao^Xi2|2;I7puV+@)#x!bl4bc9zhHA?fk*(8 z1LK6JPO?~9BGK{rTXi1zz%kY9M!Z* zEeP0IT4yjbcu)hyYK84u2e(zlh$opiaT2fM;=2J(|2V_9PY`+NJ#-=w%8>{F1CD}9 zkM!^iLsL41h3gbbc}mw-ICo@-LC-)~87{td0qevuPW;)QF#N=$1j!gxBpw>cP@uIz z3WaW)h(8*K^LH|H*J-x@&3~d#2((BFr%+?SiD6uBGIz+>2aq=(Y@t)G)G-r%WF{u? z`Ulu_BD}b@g?auQ=fC)`QDaF|FF*iYz*Rm<_So^8EbC2jcTA&_I_6FRwNymw#t5T* zbdFAN?%)3z!ykP=Wm~6-P7o@D3JD|x7KDZ(#GINA{jOm^^+820;lf}31sNww%+R6NVSDWs0EydfqbFcL8db%7sr5Cr7LGL#R+xLCNx`REYwu16cec1MtT+c{1>@dN=O)viav zuyI@gZ66E?3Be8_J>iigLZT~hdp?WF08KA3^ua&k@Q;7Q+}tH*Mh{~oEXKO6g8(T# zM!Xp^H8_DWGzz&P=qSuCj0P6ECGe!8>j-R9gD@lz0yK#zG`P#p;;RNbR~HFdEmFBr z94mtM=s!aqnIY^3WK|mBE3gzH9i-nQxU@j3*+85+g-B|+hK?VEobE)iq(mKp@FVY| z`?){I-MB{0j1ZrhhSyi#tbuN`MO3p0{SaSyU>YbViVP)@E*ODEC=5EbNgxGM*D$RJ zVd&$a(^m}%7W1raY@$X6h#s9lj`a~aHVTG@&~3C12qo}DfQ;%~`_13+^*{ME*Z%W= zq5M~Wg&_nz9dJz2ZIDFh$q1Y~iEf!>y(ojD)5w8aRN`__VX%x~jK5hVXNJ`O z;@cE6&*J+ANtqx%egZ!FKEyx*1Gw3{ioLn(+ne>m|#!Nc6o{#Ic7>xEYFfc?r z>|o$v>XMcUaS2G95~JP42_?N~lt?azTdrZIZ9)N_}; zCv>vifXYiR6I_gu8XBa&QKi{wqmAB;c=&$ECD7ggaFap_K_u=F=}XcMI`kwo>NOHR z(CQ$g0mu+^i4;05(IcUS(C!gb8l;AEwqu8HzigiO3XGHpE$(n>1nc>LnvAxd=%gTO6)UiMT*sCcb|}FISN3S&5d=MqWR%TPiIuGlwA`P49@F(2|N`NBGEJu zoi4Z?YJdN0TKOXRibuL3D3>-50+?n3njv-wV>OfX&|!)fXG!&GjLeK7HJt|F?}d0D zAn<9sE(0T@jC*xjZkx-mzJ{(#&dwaCx?ZRE_rJq@;C}p|ix6NSP^N|Pu6Ho`@4i5+ zQDW?|`+yKH?4nDXK!u>$gmZJmX4jZX576D*qR|M6C7go*hGVf=FEcPQKr~d)>(Dtnkqi1P^evgIgSJ|qSaT69w2uyZ`rKvYqsivdb7E3o4+1TD9(wE@a*)s@J zBd8P^*5edjzQp3+JWtp2i3*b_IzsAT=`Mj)uUL8ojnlL~8uQcfQLnfAAxA zuFj){A%mw+U>%+yh+79E5Q!Tkf+V&H+Y8I6d<7XO&P+|?jSiuLUD_zSjtHPhfRJLf zjMr_9z<~VN0V}o{Q;aZvWFiMSuUpw1mVDLwdG`ru7iQBjO7* z4ZNO5VB3hm!*p~!ufz1e{2;@c#nLywL1FniiLOh>mWYspHoEo770SQ4j9T16)LL|; zqS$Sq935LTK>7Rjro`@V_gOJGIgZhvz|JJ8cG@(9F3B*$S$&xJ-DlArz6%^3GX#XB zD7)00E`}MRl?up}B_c9JVIVXG!o$}!JOlK9@d)aH_fU_Rxb-sHkVD*Z4g!?wWy+lf zLnmfPO^p+(khSGyy45;yCk9F(-q1dXJv|6C^biamtWeM{Rj90Pfn(4dOfdN1J0YE- z;Rk5JZVJYPA`wc|KhClIrT@mofBPSB|MxFWw*sa=H0FE?Kl^RQb{UekIh#V>b2(+L5kLI@Qi1ZOmd zJwC|r=m@ISWp(MsL4c_+LQKD7E___w->% zjm_&z2+d-0_z+sVOFdtMSPC&Vf{#GcG(;c>T_1^$>Uz|Fa{=#{uV7qRKrF1_=W8e= z0iZ&K@)aTgk~ZnnN9c4qlvg)tR%-_V+@MFHTBdJsfJ&o^vMdINhR_g*W*fX7YOl<* z*Fx-;a39SNDb{u<&M(m1E)WwsQ<-6=b4L*9=*Zo4^8rn#j*AzzQK3uFtDx&XqZ7l} zzNCksgO8!<7&p5)$7G{b;@Y)qgtZ2yyoC$thJmi@M4}eT)Y-bRgzbUvc^HWVm=?FZ z0X7UG5r<@AkoENybRjr(;tT{PGB<#dIw2Cz2g~0*y!%KD+eFwVkysp+u@Dgpp=l@- z0pUN1O#xxRR(^+QJkH^xcXD}S2bymIs5Kg#NG9=vCbr{n?b@Lt#ia@afMDGIsI=tN~>EGOY10IQsu%%9`<)UPqkPyfnp1@N+PAY-d^=MS`NR>wSJtD@g1$%qk5{af;Bu<~E_{vpU%@Whc zkHSCm=$31k2?xuG zvem4!y<8--2k^!bAP{Z~sR=sDr&cX7Fq|VbHI7}ZP<`=L8vpB8^iQ25<|{NQ@Z@e+ z+m<>ir4hgP44M!qrEpPLVTi5?Ja(g|0j1eRdZh||(HJedl;|C_(Zi>XGko?GMm)mO z#triMJi;{TwtGZ16HOSqtpm^!&}R3*Eo}#1DeA2@TeFL>-N31|Y0NLvu5GjN@~cp- zp_vL#_VCqiA09DGgr?z3K?g-$`Md3jX5gXY?WzE+=Tmy&c}h!b7;Z@U+A6iB<%0ml zP6J|+%*+J7ZLzevOl@t8oSh`6BG43cgWdDMwuDVh(IbFP4@-~G@ z(UxLJ4wL`YZ&>*8_fcAdy3xT^E|yRjdz(>4uqGsVsnZJrT9{OYNej^071XbON&o5` zhl#NB>Jq8hDsR)H2UDo!wkWKwlO4)%Y-WZl*JoL|u>eXZeP{$sNmK)cB8CFhMf2Ja zfFmI}lA%`1bGg+ZJ?M&HmNQZNg7GyV2;k)Ph$S_yO4be+9 z=351hjZBkK4Y;uOmP*`ebA4_eAB{+|kN)8iLeoSz4$;0eZlOTVG;n;MxPVT*Mx|C^ z{Kyo;GgCCY9>sbCVcJCEeZ=B@WU@na3N?zaUqXZdQ-_a`9_lCMMCfaK4EEs8+!zr* z!0nM~@QUs#BUKcD$hRq zEKfY~1TVbs0_V@4XJTT4?|tuk+<*W5T)ldgR4PTORAO#!j)xz9n0LJ69c*oF@y&03 zlY8&Im&YD^jIV$F>ntrT@##;0nq)G`i!Z)NJRT>JNbFuN$Kxoac<7;rIDY&%wr%sm z3or1gPkoAKo_U7Tr%&_okAIx!o_mg;{`9B&_PY?W&ppQ%zxYL3tribF z@BpssQY;qv+~+|-CJTrM** zGJ;Zyd+)uMmtTIFFMQz(EG{lGG&Dp!9w(d4QYw{LTwDZTa&nSWr%o|5GlT282qC!l z-g~)t@gkd>n|%KBpXcJmi+u8vpJZWSfw{T4Hv?R{bcuGm&E0q3&DE<{dH1{D&1D|`P$dMhHcwC`skyWrip2qd(C7EAq19X@r`eMgCj?d0Py9$u~w^b>eMNI@Pi-lzW2S4mtJ~_m6a79dE^nEefC+- zpFdBrSmcL4{2`A#@(929#V?qgoJ0tL@B8F(Il?d`m&=h%CRtx!XLECt=bwL`-~RTu zY;SLK{P=MO2M71{ei&aXA@B5@uDPpl0K@i}&?yc*$<%1$}3#Ca)sI1S=QIrnVp^G!i5VgFE6vPvBB!8Ck&?i^qK@|Vfy^E~y`Q{-|vzWwcQbKiaU@#K?FVi*RMN(EildHnIm zu`G*xKF{{{Hq~ks*LA7a>-fIU+}s@V^YeV^OJ5=kLw^4ApC9N&6rhsHq>@r9UDs7C z7E_w0DbqBSVHir+brp$3ln_E`nx>-BsM0h|S(c?@v6xDy)5vItrCfZGEGzIx~}5!xH3&s znWm{M%Tk)ADZ?<7Wm)R<>C-9}i>bZ3rIbEN2shOz(v002ovPDHLkV1n7{jtBq% literal 0 HcmV?d00001 diff --git a/data/images/pegi_3.png b/data/images/pegi_3.png new file mode 100644 index 0000000000000000000000000000000000000000..34c423f405592764810bf7bf7d97ceece1b7200f GIT binary patch literal 6294 zcmV;H7-{E;P)(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRa997#k$RCwC#n%U1KNBQ4BRn>d<+0VPq!r0@n!3)92HdxppaNLNxfyF|j zOF^d<(MnpBg+&ODC~Q$D4X6|)e998aQji3j_<@TQmZa4|*nl{6P)R^z&hh%mDOs+V zPT!`+a>M&JuFQh-m+5H8iAPhnrC21Os zZW`*^A!^k$CL>EzR!e~-q1V2KFz8Yg6-6otBOfUQWo8Lm8KpVHa%HIM5Z~KiI5>pw z^>AfDRxHV~8ZVGoxkR`twhzZ7vCHx6j14)aGNIk-(sq2ZrOR|wgXuBsUdOO~oXB6J2@KlQcs?ZFlKE`TXy;GN zikg0Ji$mLM2pb@TX0hBQjuVQiCeKs6FrciLRLznP+;}ZgI&5yPle8_*{;$?mv(l@vIX<`9?~gE+8$-?kY*!RX^6B5!`^X@9lniY>mMeR zTUgOT2?vX&u^CF1j264Rao$qwj1f9U5u=4hhzdiAK@ukpzVVsO_E@g=_Vwm^2;owc zDaAM?2)YLW$|_@TZ%kfP_hBXmT%%+a+%s+u_Qscp!7HX~b= zcup73>2m$`5AuPd{{oK~YZD*_tM)r@!5XkiAY}-~&}fGfoBs+&Z1TTf{3r6&1m#+g z1&g#|HlN_REt0rHT{f(ANi<9e;+V;JL|HE=tL-ZQ^4%TZ4+;DjM+TTiQkE8}0z5Ay z%T@?!@dFpnb+B3@2spHPg6odlMdaN8tYPUO2oWd*7AY-KSehEFQGkmOF~+QOWaBoD zZr{Ytr7?p+A0Z8mE#K#)1kWq!4I-Ay z8OmCE-8HnSSk6<@JVi(d{0@czm5hm<<3NnH`_H6Q?GO6$YI(^hdi^CWrJx9e(2Hd_L$5rlcqDuqQMUoNfKNwkqL~| zG);j(Bb8>p7_nT=X>3LqwTR<@z-v*K5#8i{ME)^AVytD~P8qDNuwuoTOE2)&>DL(c zx4G&1j}kaT1PbL?tOX?lz#|TO96fRZYYoE0RCz@dc0d-?b&BI_q*OSrLsK_&!-Q_{ zDp4q_PvNX4c-|U8V3;pG#?#AW)g_X_MSS19 z8v?MR24z8kkvkYl!XT#172~l15#j*4k${K51p=@=e6@v=9@F_-IKd1jSdgt!(xt{~ zpE!<4l9(WHsj8AJPY(ikZiF$03p=OC%Yshp7*QCK=9fwHw^33M1QAueV!Aj>E#E-M z49mL^D;&QDRiWi2mdjnLIw$noC|Y3l#fuey0tDb;bc_;RTCEmAY^cpH)5U3K^D)MF zL}8!6_fU?+^<1P9G`hN)1}u)_qEWa~5yw7}+oROG%+o1SpJO-}(rOF#CKJw{e-@Sf z7kp2EHO$kqM2SbM<1x=(q7tt$o@a!jOBgjEHNpoW4VDUFJdjY7nxY&Lv<0DznJ+G~ z%4Wo|q7!`(MF-@Fs#@VVK4BE&|HaF_M+5naUMHm2zmer4XH}k|69%mJuVZg?nc4CT z%AbSK#KDk!1*ew3B=BN_z~jR1pAi!J{XVU>OW+L|Pj*p32ggk?l>3&!YJ`wTz*4d( zUuKrSK!~JB6KXB6SWpGl3IrhrO}bhU29_`mc<<`#Ju_fvx4P6-3)it|F`_8eQKCoa zc@*j-v&CtQQ4HEQ;I{f`Gomh1qE3sRoRX$Fd7aV{*WkMw4B8vqa{S};qr+59iKDXp z^o$1rj9rn{ud&Q8(pVo^uhH)KWOYtn&hU-Kk3!12B3rGfD~(VEtCe#QAPQR;ouWu^ zR81UfmJ<&n9Rg>-smn&NSE!=V93p7=S(BHzB z*FfW-v_(1*wXP8eq?&Vn{-4=h{&yT7qywRn4Emcm3(4O61(wxil$6Bn2rnq9ikjK1 zKrlE6;JQ9#Il*%mNFkAC9oK=X%2=cq2$Lak98qRIbyXu&gDXR%sgY7+Wrj8t!X!lM zT4cBmHUOj01`q;kHLh}K>VQj&|HjLwA0x{r^!r2NutUDAn9nEpUY}lkGmG>xtLhw1 zF+kTAr5wW0!*#r?cp)!DYeUhDkV;Ub5!1<%*mkXq$NW6%sDH|BlytQqt4jj6B8W7K94lvl!cbwYhZO$4&9H(v3HfL5zn5tDG_(1e*h1pD z8))0$C7PnSh!i!hD&*e)?T-Mke4(PTvuqHs`z7yvS5(!pdwL;hy5)UuX92wrp^+*0S zzOzPN&QZ$6;|3hrrl@zBm8WUyfL3%J!@(Mk>rj?8Wl>_@6Nat;?C$L{8jo0|4azN% z;gqUQ$uo_s)~T8av(+iU;;==X$7JOk&l%E*P7t_TxN42nQt;MW7kT^aY4*l@)TTj6 z7lDhZBdl>~NHJ!O_2i$kz43muPRa8On_tUvZfWe4Ql=QwX3)L~V+>_cV2mXSV|*_> z_y|>cMwTyVB?B}LjV_ojU!&K4AF+Fw<$R5NVOY9>GefC=Zdy zLrAYpS(Ze>F>J78F`wXv8f(=-fH3d~!vG-!z4j5T_886H#P=@|CHtiht$n7mF`h42 zUq3`Ozk!{d(-EX%fGP)FOQzEu=F2g&`XvtcE|9F>384ilgq5i z5n?%_p5I914e%0y6-$n6pP+a6-%?zA1|wF)ej8(4EQYgt|ASNKeu?rSNqmgW0E1v2C_*R^ty!cHtBLn+r5KB$tR(6nVJbMEwmLV;j$`H-j+|(?FM)V z3=5#ZS|8U{*moo@q(D~^*NIpk9;IQA#Vlu9PH|Nm$JbajCe2c$o3mKVaKn-y>K_!b z6awG(>2)`;Rx??gX0b>S*29-ENfM$Qi>?LeA?QO`3)%z-+XuQ>-33}C;rmz{UW21z zrqd}|mcHXa_dAXS-GH?qr9>$YM}@>uhaiY)nuelUB2`J!QZ(8y+8YrB5o>E32%!!F zXl-y^k1VxBkwb0YVmg_T1Y4|kKY*n{n-z`|A@yOJ)sg+>GYObJO`RZZ3?{_ZLz=?J z)IM?CCJX{VP}TYhgpm6Xk(c1R5wlr}BLiB=04XKY=`N$mIr3sk7<5UJKE^6MH=^4f z90aK9lA_3|ILmnP8hM$L#Os9aQH0(k@{Up$2}NGv2apvzK!%k$j{3{UVnGt&x$6{J zL=qfh&^rORD4`JVd<_A}lFBTobxOOFus5FIIsyIO2F5~`FVM!)Z{0vExR%5}!eS~g zO>$5Jo*R+pyG)n6xGG@SejmQ?V`_;uHNHDwwH#45Gup`*>zu=|#2Oc*i&7fQ{?rcp z+Z>Z0WVC>8`~iG-9qfMn^&MM;HU`(x%(F37Gs905!r8A17I}pd0e;v<3J^pXZLz`< zx-E>pN*JwjNp40oYD6nKMB*RE$O)xh0xJS>gkHNvqh4b?eU75u69u9K7Hm+_+#$J3;N)1;zuhg)6#9u0dA`5|G{sYrxn5r5X$)#;Z5Us|%Fb4$E|mWRp1T5e9v< zH3-{~mltWZVuY$N

#r6*n3v*4H;d2c*l2G}}cgi{m(yRmFv!mzc~?V$~eqx8y~| z-t5%A-w{4iD6pU;`#I(!pVf)oYkqq25uhu}hR}uqd=?cj)=Xm;+|H$39{Tn*|28IN!2lyhwYKhhRr5SBOdH~1J<|JDF zk{3_E#2Xj>h#wa?b_1((#=9kJ!yGp{&v>zi)|#N{Q8o+GVh4*sS3b%SR{@X$r387N zlEewER!q~>n5L%JTc;HdSgmsEx~9q{o-5hjZnJyoPyGJR71v#RD~H!UOz75F+eYBw zNDI&Cb zFPSe29M7^?P6>RUAn>W1n(1^-o>jP>%jWtvs@h;xW=tnzwl>yT8(w8SFdmO^iy78< zv|9=7b{8RBlmy4|SS%K_+AYE$WImrUn@(wT&0uhdPP@xwGH10~(d`5{E-0mus%Djs z$%`qTZ`mAdq3aN98_KFdIf72B!*n)AN{1xwu(Pv+=k33e_5A=T9Tw>xVM{`zSY->8 z(>e&Sm=$bxTC}4fQYx^5BCGKH5FreLhAb_ZPG;mqj#4iDP8+E=F~tUmvzl~aFs8+DaFkGmOqVknxuDx=p`3uKtcc?li^US%)Oc>f+HezNV3iisb%WnN zhn7oPZNX}>qBiY=0G;G8Nl+6!X{Rz40DR)vz`=%3#pLT1~zZ zC|Q#D63_Rj>J?U2%;qIUzM|9Z68I5O81KJnT<=iT1&yv~wFZD@nJ#In5~Tvx1}!?R z0lKj$RtW2oL>p*31)I|jBi>s6B@c*y^#4i-YyZB!3nBjAPW)Z>Oa8&P{}1s0di#eL z@n6k=>$*rOkWyR`sO!3a%X~n%Qp&6DE2aMGd;WWhvQkPqoeqw(AIXCtpw(*qO@IK$ zap?7WSK9LZ;GLS%-#kJ>?7u)3LSl?X2!XYhx~_2?2Px${KV}a^4r2^Li2WDi@45Eg zeWestRbGMjeV>ni{No%sas+_GhYxelJ@@?8;7F$enlI$s2FH!H<6QBR=-Ak8$t4_wxATkMrDf&+)}C zev#pD$Wu=}^^ReT_RVA*tFvmk38}SCr+H;H^2D}&p-b>4?Xk{^ZA^+@4g$)^Z4jTKgx?QzQ~up^d(N7 zJjwCn#}PvC&_fR~nM|0^=e+##%WQ3JasBnzbJI;Xv0N?*f&gnR&p-b>dwY9)^PAt~ zkAM6lpZ)A-Id$q3uf6u#Ujw}K(n~BB3vR#tc3ybl1@5`$9{%u$KQJDT`P}C|$H|i? zx$CaGIDPswufP5}_uhLiXU?4A`s=SJNfMrU=9&Gqby4vB?|+}W@4lP+@4ugRyUnRn zrzp#k4}IuEeD}NGWo>PZyYIdm-}lM${EGg-Hk)zB9e41vpZ$yn9(aIfo_U7xc+CCx-_K)@J;p~q z@)1U(5l=kv1fTrmCwcP8CpmQJ5Z!KphbX1!^?D>p!uj*(Ie-2+iippG)+Ss$8@`0(lo^wgYWySRx8S~#C6>(GZ94*K@gynVl*0EJr6wh z+;c3KOP+e_DNdd|$)!t|cefl)t_{KMgqKF^-;0N4w*IhjH&_je_$Ye6XaU4GL zna{Acw#J1E7ueg|!&-~hn&omymSw#9>Z`o@=9_%yJKte8oALD1PhUL`_`Xk7Rae4i z(==B?-n*ldWf@8-k|bfdTq31JYrS6tGluVd?|VG?Yio<&{`R;0_{TrK65YzO#P@ybx<*P#Q55*TkJcKc6hRPh^ypE}o;}Na zKEIL&-c_>&td!FFzHk3hB*ZGE>^p!~2w{~{R!Vv0x)8z&A+DUei_@% literal 0 HcmV?d00001 diff --git a/data/images/pegi_7.png b/data/images/pegi_7.png new file mode 100644 index 0000000000000000000000000000000000000000..b81e7514cb03bc1d458afbcabfe652f62e76f4e6 GIT binary patch literal 6158 zcmV+p81d(cP)(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRa8lu1NERCwC#nqA0cN4e*JRcqDy+jw|KlG3I0A6&*a^0G2V`lB6HG|rDQT7BhX&7IvRY*bGh#ZNGETOLf&qE1 z(Qc3H*0{>Saa>$Cxmn|L!X1-_#VDqAo8`RVDAedvG)h?mH8r$?`RI-Q!9hmk?J8%KCtd zSN=d8&KL}K3H&i#qsUr85QOB#KCNzvoRGTFtkVTumk|UG@gSfoGul>Qh*)PClPyVa z8ceTQEZ0Rs#tET&2d-4~N|UBbwA(WnMp#>;d`&cL_|RP;|L!0DjwG2< zu5U2|x@(98bX`N&uIbu{rk{h`0fL4ePnI}tM%}oqmJL!mY|Zv)nuOKz5GgEiJR;`r zX;&$h60KXjXbg=d6oP6|Q8!bp&`gsFzBiz4a)j68`vJzR&|Qu0p)7OCvgAXjcNxYr zf?&vSIN(D84P@MlcRe}+jUH5!XC5-m=K%J*56qEQtjQ%sr z>`j8GCG>9N`0QS83qJ_F7lHvGfedJYof}Uj@f)B64B#>JolOd)1aeAqo}&A&tm>B$ z;TCb|vsx`Fsv6~c_`bqZAx2A#9+0P!JnL=-(D#@SZlDt;NSuhtu3xA5JFS;7ie{b=fxC7 z&3cvM2R?B$qAY9DY=NUBZs1c_YpOh>taok(;CmtC(FDf{aGij~B1J_J;Upnnl#F}` zLXXaXt{b#AKm^v`3@(85k47E@AQ4E!^*m8Ng(`!yvXCTubS_o+y}t+aM%_qeJHFOB7{I5Kf7P z$B2X7%`giKQd|eHNyo4P5n)V#H5NpN5bbqy4z3FbP1(H0mHBTeDox)f%#u5BU6(p< zk=7v@dT8BIR%?Q)Mg<)*OcCz*Rx#k<$bcw78WlrV~qQLHDl zwE_%QmVg5o1TB^pf!#dXZq~aaEMT!#9bpDRQD+q8Ayxk-Nit&Vwh2|Ksh2fP6EKKJ zj0f*wonB*cEhUH)t`c}oax(yHEUv3is-wzU99!X-hOC)WbxV9NL@6J^2;ZF{mEiLF zEYfZxg-35X3>lztY>c#1uo02JLl7!l*9BqdH3%fqu~fQ7NX_A!kt9>< z%21VtAQ%&RJ;kC%AQ|l@MB(&i0G(a1%q|f{5wjp9TfEMy{3D{@VLSK_gvlkWXy~=U zidcq)J5P2BW6ULglNx6FX2GBFxQGmq{1=#3j09Dl>ss@2aU1nrUFiH>x z9m0Pb*NvzfLtgIVhl0^)#If)LESGbZ*#SY6F`aJVxe2BTF;t8PcQG1G5CVDwE<=Rl zA%MDDkrn&6O5jJ5)hZ>gGK4!sxh`$nkfv))Z%M{e;y9qLD|+3dTYEErAPCWI&*jBF zfj1^ej?vg9WtHMMZ=%#aSmU8hMpLY5^^iK7ARK{kTBM&LWQ1-KBo)hL#_`+l!gnI9 z3WOjf?-Y7%<0_@<#%{NkJde1pHoyFWnLkKB#wuKevIn`DCN>N8Ewwt_4#@Z2S{@iujlQ8xuX z{}#)p4oE36{RGo#aG~m7r?nSJ(<>ydM-aKV+Ol5HDT|so8j&Ou9Oi5SKcY#)*5Eh<(_#=9IG?z7I%V@NQ)gXp(WQlR{rAdCs3W6b9+>vfJ0 zuM>F_LVt%@^7jZ7#&jSZr10>R3#2TwSLyA7y3VmHh3ETNW2mZ%zBf3o#Bl|#l(bDv zR_4U9A&Da#M;-w<`sO-{D2Pxhz*>QB%_d+~%y6)cv1`)&5=Gt-suS#Nox+baZI|Pz zA*1+iz#*@$P}XyNcg9Ga+N4-%Ft)>V4pJx}Wu2cxdKK}&qp1z)x}xta$#6^m&|F&vEmfo?!KL%_ot56>Mj9q-X=1ty@^ zE>!`(8j}on>9xoH{xv*jhd4e--}PVx)*29C>B#h(94y~Jw*|T{5q5wlw^7bE)9LN_ zUW~PpsxBz2C1GqCj3kYovshn1cf~E}wANT_5YojF0%Hu8o~AA-$_~#x&LAFQdWT-D za6OA@w~(#2C97Co6ESSKz8RV7XY+$rMLvrjuQKZ%CRR zvY4mr-F7=yt{UdceUwu4eTOlcAoB482O-4GGoX}1KUx@5k39pTg{xx;913@I&#%fC?M4TIoL#>p{uw@)I3L`nxKU8MA`TWZLw%k-VV zaRS09B92D14Mb6bH4f{vU^GgIqKK+0S*=#|T~CsX*xA`83~#}OJkLW)2trAkFG&|` zoG@c=ZwE*2(l#K3VKNz!7HhJ6pP@e{FLLtgkiPE;Lx(6B;m84DaNBj3YjC7Q2(V~+ zE|Jw&8H9VN0T}l@LiA`|G7JNxtH_HbQS9S79;UZA(kBQ81l|}r2h%w>0|>)_a1e6k z@)g?J#Z?o=(;-nfrmJUIzoc#}lrIT`DMASH_H|av6^^6W-g+;d@6nVi2Js07;fC@$ zQf!>JAY_jrqpVUqHNaD2N@J;-lz14R`w~P;7rr$D{Z0(O zvxMgJYb+MmD2i;8_UP&Qnoe76H>T42q}6$pQh3gUBClDMuMmz3W?NG{=QeC_F>;RY z5Afs|+aGNU&@EWoASvnl8b^jGIVSKU7R!BlTOwqO?keWX1Dd8HNydzZQ=|;23X5)B zMuTHS;pFBSSf@2sDYho}VU5eR{RJkQqm&{VTqRp*>ayo>@g{}}O^Pd_?^?P(BMNi6 zCZt;4iScj8p{ExOj`Xn|xDE)LkQaB-_dR0xTdX_5WFKUE`#e> zVZ4XdlI3zi(_|nujb0OaJ3x%MzIj1_bT-y>zoyj-(&8=B{4!DO()TSzk0{Dizn$%;cvCvl`hGTg)3 z9y*W7XcygFX1+KiFP2Oul4N2SkB$Q)1P<0-#~|4_Q=SKv(RV5HRYO<5ffffCqp=v; zE~hgot`kt!8D*8@hYE#4_cdKxP}jGh61_3_j!O^-sS17U9l`29mb!$jY|}1~8p& z(YBh!V##uSnZ3O|dfQTW2XvJ~UP9Zn42B-^9Yyq=CDdt+ln_P%u5ziWnj&v7oy1cE zhJz_VFr@DcLTs{D(=>RV$8@@d6dq|>(RYf--=*&a)*gwlKu2#f7ORUK&iAPbO&rHe z##1~MBBdgV2Kc^5UaVQI4jCpPgJD2ZS9H1~322A4jZz{V7LiB)(v=Tu? z-*n_zP8@FIy4!eimvrIcdP72gNL5x0h9kyf%Y1&oa#7<*pS=@zpj#-5hWSB(6w_N( zVwa{ZSuPI=ylsvhJAw3_4IS<_E6s7iQq!~@ZMSBlVKf?}yN0T&Zw64; z89G0}pz#BjI10gyDN0S<6ojEMdPgQ#TbZf>y67nzwO-F#>l(aSMaz#SF(Y;&6s($E?!^(>eIg_1sSnLjTo? zN^fec%&_D{u|rj5lx>ddwA6J;-DoU=FdPvCW16PM_agefqpEVk$j9+o$|}DZz;F~Z z+n(~)rMJlQHA+K8)HR+!$UDFWPBA*Dq+4T|br^5XT)_w{tz z^$lfxK+|2s^`Pr&iuUqGL{lEoV8cH9UekBbca|s~;5e49ueiE@kKHHl9Ba>Wb^bDrqX|NnRu@?7Fr96oJBPX|nJ*4e%3(Mfp%gSt!?kOd zXquMsIAMExN>MJTD}5_j#U~8L&`($#6jZrS65oX%Sm2PnT%kJ{P6k*ivSPkD?x_m8 z?gnLWID7toP}fh>YKy~&z>CqQAgx|U+c&AZ3wVQ`C>&sVMblp(9*meW;_&d0G+z;f z3Ly;^gX=0n8R7dOz84_m5Z}KA7ZOfM*O%kt0|5c5rrdqH$VjytNeAey@EA9N{lhxfU?S2rEeisiu8N}FJKt&pc{|Xyg`bZ zI1bQy$ZD0czkiLcGdNPQwY7_|lCmsWEpxWEha}1DW&n9PC-3%=QgH0pF{B7+8ciIJ z(Ve7eTB1-PWKUgXWLZkvTJ~-`hNmKybw*XM7*EHvrUUEHwO!I$m&tgWvORy4bv)(M_nY$y-w%-1qir?TDwN}5dKYVM5d%eag=Ek%o$i1Yw3Wg2 z1cFT^Y?>vGo3qYR(lkZ65j(S!*e=FOpXp@8;o()fdCGVykU~(kC98FTQi|>EU0h|E z&*ylaM-)k%x1TPjUj^omsl)hV%R~cGMrn4b& z91#QxrCgK}RCR@v4Z|b=+mM$M)A@KRWIUb{M?-Ym;R=f*70UDQy_lwHHg%+Vr?QB@ z^>-zNwf{Qb-z_rzUpn!x>M!{lzy3df|JT>wd=Sh3Q((S3I9=C8N{JBS=y1VtB#z@C z<&C!U?k8-f_qwpVX^YKC<-2S|QFPQV2z-3s$8{Z~ywP9cx-Nr3e7(QJzswnb1;BOP zBO^B)y8-6 zJn{&>@ALH2PxFaSe1fN+ewx##PjlaW_wk+Ye1}ILeUw*Td4(Vd@H~&_o_mgufBfS- z@W2CHx^#(efBV}!_~3(l>|-C}2S4}$=gytu3t#vGuIuvLbI%b)5uWEA4b<-LE~ihQ z=FvwVCCf5ieDOs-^O?`^qaXc<2OfBUkAC!{yzs&c{NyJ;xs^H{^65{1nx~$6im!d` zYm{Zlr#|&5+P3A=rAvJN^Pi_IOCEddG48qN9{%{pKl0VDewFWj_q&`td6H+Ic?N(_ ze)5yN{r213fB*ext$FC7hj`(I7x?m*zs!XT7f6zXot+)__V!pT7QFV_YXD5AQ|`X| zZqA%J!{y7Dx%b|CaU6%={qA>^WyzPm^d)}(```1#6HoBkYp-$k?AgBt@TWihi9FAF z@WBT;d-g03J@gRIKmR;wn)1XGPwhdFcR48!4u{$^Rmi4!OI;SYaE9LGHL&_j&J<0ERUl%i=G zf*|1MKmR#*-gzfVDgONDKXdKcHO`+u&r?r5#Rop{0p9=q_a6a}@4Rl)bMfLu?!W(j ze*EJf^VnmL@vC3`ip!TTbLPw$o_XdO?!W(j-hTUSo_XdO9)J9Ce({T692rtd5yvq> z5U{heLl6WU92{`@@@0Pd)1UIvOD_R%^5n^lMDKZYU5D$sM<9bBpss8BzDG)lwHC*5 zP)c$9_;Ch<0mc{(4-ao0#1}7K;Nu(!9z^Upue_rL#r!Z1V#LEE-y zt#MuV$nFh0Hsr8io@a#+RtRA|&$Eu>Sf!M8 z9LK)94`8K~7OgMW g+gkg#Uy1+s03C@>0i`!FB4+^3r zG=MdNaL-z?8~~IR5AqOl{=b(!w)dT`1QYS;YD1S>71#l^_fhU)q_olFzrz^NxcZhdba_j@g+YE5poN z6>E_Fln9w6w%9*aK%?r>L0~CHC!gZ(F3DgpLVk?uKFYfpafmKbtU}MqgEUH4YusH{ zIw9`ql5KmIHqi``R51fQefo50Y)of<)T6`&lT>Qbv6k2^9p%K(jR^P|*a2f7z?N!~ z2uvo*mTjS!ZQvqP{rK_YjI9zbmy(OkL(o*oWHQ>-RT*Y#>agu8?!FF<;7fHq#%zhi zxt}0Xc2-vR&gW*_jVVyAudOAmuCGJw&d|ncFarz_9^BInE>m9O+#lvh<%VSs4^c}FHZ zjNw60|Aup|Wp?@MNF=gql5E1BV4R;zcHf%k?*j~k4hT6VV`mLh6y3k)d*a+&c zGx`T)|7JkH_3xgvuB_r~9-~4HF1#eRFNG-s-#vA$Hw?&6l08Nck{QI;wA>r3JxKwj z4Q3S<@{bow%B1H0)_lu3QW-Z+Gc zxhG2B(+j_~D)afVBeO9HPW`mlfD9YM%U#qcTCpNM1N=p?$S!Su?sNqn>}9N8U+}{Y zfnjdWcCSlDeEaNc7BiLdWMZXrBjj_bOsYzFYi$nZ-4r7)P=o#^IId3K3fhCOpYbe| zhuv%RZPOaw`jnk4mR zEX!G+5Q8_$*)eiA72{+26`i%+)RyP(aoSrOCdLFl35`!9Fr%zsQ$F=IOmY0_wQmtwf z3Hv+x;KO)xlkn*xJ56cD?GY&>E7@4s!Q<^@HB>qG$9nc7#8JRQ{HI#fkNevjsIxhu z{-Fi3oVsAZDV4&L* z|L1WLALeLvy8P(M&13*ct?4*3N%CFcr34XvlkEB;N?d!Ir*G}9X`i2k@wxV7mZcxP zX8%h`=yU3#%?9&VGt!4??M@o}dg~6ru6;UkwE#6Pnfj##EUES4(TN5dB+W>FX_M3v&7S}JnYB{@g=h1#0RO|H43vi^vj_B0oQ)VMEN^ItL5WmfV zJ~KXk*Lpy^s3=7If)h!!Gv13M;MSIYB<>iDvd}|}xjpMI=XSXP;TtA1`O9@EKZIwP zL6~;XCpu8fy2}d}J=}j`?+q1a*X@4q5M(wcw(-)VqURa#j<)-W)0j>BKcPSPGT^Un(CtG916 z&j~Ngoxn&gI;^)EIQZRar&xq*7+}^AKBi;m$EU?)HX!tG9jEH#d7qH2lE7{l**>6}2+g z^`r>Ywhxl*-%Zen7>(DqHBj-KA4 z?~kGQ;a@DD3k9_SRmQ^>BkNs&_C)~M_!O3(lA8q>h{yBFQZEho9k|a0#|c`QT0qqo zxoQkcMp$BI)~*5(1K})6Z&AFlg@DO|nT)2V==5M=2?>0iU8D7E648#Qj%R~tG^wr4 zbH*bX!d?XUxxawCFh5^Gr3xWQS`5R(!+(#G{5=G0;PNmV>DaUrG7ST`Bht>PN>Fmi zv+lL$WoN3auV>%d-rjvX{8V%B$9P|+7?z{9wN+4FUVi2L^l)rx3AvH}6*njO4i{_X zj~vheMRgfscO%@+8hFX#7p#j9u-Iy0QBk_0*|+(Z7DMF*nB*Q;I|E*61Om}J({SJE z%)!CI#MASO_uX00G55B6Eg2U9o9x1I22EM_&Z>oUO48|c54i=jd4RWfe5p>vz|lmt zMRmJxKtM{sLMu9dI`qj&nnx(CnJ3Oju?(a@M##Ocfuoz;7C7O14P%gf;icY!DBDQ>MiMJOmf()`Cx(4lZsfLoR@oZO+AMsW($ezUrhE;kK`@; z6m$*{@g0pB8SJP{*L}G;s1+>jhJL2rp3AlsxOT*cS$pp=YM~!I=&E#-W?b5#BHEa) ztjB-L5eCCvMSb1gf&2A`&TOI&Ve4cK(r}A6FFz?sR9=_;M-Uu{&)h{3IB5ea^)>MmW|H}* zkFGMs#!l(ZYdF@eP!3(f{ES9@OgH=GlY<9#q;|0D&?DAYG1Q9i&ybVhkj_K^)bJg6 zE*09wdE0J0=HyWow{H332&p}T#fy;Pwn|bB3wDI~&dRjYAfmg=Up>2RV zh`{l?kJK1G$qMbvly5uDz14~Rs*3p1;J_&G@@4KX#yO&vns%?%T74_86hYfxPRs)s zwCCOx1jlhKKGwfMY>pxU7xF@Nf(YZbG5dYX!_y6cG8M-EYQu_7JBRdrKFty0wYa*w z9lt}?5%(y`wj%x8={j zSO%_4v^?$qm>J={t2*L~k`b3))zFY-ozPT$I#hp`D)o zjp^1!wn09euGmQhe6bWKTV$E7mC!pP4OHbL-hUgl@d@q#d}*Gm>Ue~6ztXRv)FxE= zl_zwyOdSnn%^z+Gsr2L+bR@EEWZRrWEG-%^BbI|76FyZ{5#dRa2{v#QS1|2Yx#H{fYk>`%zGv%H z7a)tm^0r{}pkOvO7vGtiVyHi{i059OhJp?`hxUrKdLjMa zSfr4ftDyX0s0ACp*Jk&{+l9U!z5|VBlk+_v8f_oFtW@LBDY5q`tT5^>L?VeeyYOTh zs3?UM&&#ZodX=u=mj9>Hk8pW3o8Asn(f(G1Kgu?rVm$k7yCj%f_JGQm`tO5(0v5Er zZwxHeM=XCk9$&{L39F59s@F4ed#?lrOM1iWZ3 zK@(BLPaR(;D=R6SYGh=79qo^cEVr-s-}$jdcT$A8mSSGjwCiYr;(P)LPcJT7js@K$ zppN6>^v*gdpX6~2v>bF3*;>ZCD|stN7fZ>KRNXweqBGVXj+WFd%`}1FqC$C=-3C*a e_>E;CJK#g1k<(dQgZIx{1~4~8nox{f68{5NCYHAV literal 0 HcmV?d00001 diff --git a/data/images/player3_point.png b/data/images/player3_point.png new file mode 100644 index 0000000000000000000000000000000000000000..e88b90f235047f736868b2c64848ce9ee5972718 GIT binary patch literal 2527 zcmb`J_aobj0>!^Zj8Lr`icnfD*Iv~c6{8U=s6A>mDz@6SS|T-yJg!kuMNqq~*511{ zt{J0<5&K$~6g3j+_5Ba;hjTvX`~~MEm>BC`0Ykw609?`6(>D9fC;t-*({EqN3Q_(I zz9586kh!mGPzWjj4QRReI-_su`=H#=W@wa4nEwD;4FFi9^|iGuLP@*!QHGY&H!kOC zp;uo&;bcRc5rxJFt}=Tn78P3{*z2oAD<2QLy9V8Gz*hHOG)NaD4g8XGfIQv#E`xfD z%zQ58>O~@YGK`?UH5qX|5P7XZ9ErxP-#Un#Z#jgWEcUfgFqNyOj^q<$du!lm(?5BK z?S#N~^8Q&~Afa$aHLG3K%$AWIVCeh`$N`4`_i)MoZMfH1JW*jv`W@r`wR58`!LA0z zD6vx>*Km@!bBCDb)jS_H)+SJg)WeT`VAy8tFi1E$3i6)$LRVg1 z?(XA*Kq8ZZAK{lu886?tbsmji`aluog9rqI8q3BLlyn~1;b?8`Mqt%Qx~_tN0Cjhm z8|FSKDJktNm$kOe)8{+*y-)<(hr=yVf9_=b{IW!5 ziL~;oTmo(EDvO@_bX_|0%UxMJp`k;YtExCljdQ!VCQ416oMaD&x^!x=^!h5;B+#WM zh4romgAQ+ty`SJHhV>z5dg|yuJ%xxQ6I)xpzvrr+#^Z!6EiDIl&3^ZT!$aciY(hzi zDA=j!^<3nYrfJ9ckq&=^I3r@&%-K%nm@mTBdVkI!bn{)0v$AI5{znDEe z4OM~DM`LbB&DHzZbVRlVH%WYN&EIEr)KA#n_RLWWGpmSSXbC}T88HG)xo|ifH7G{- zyC=-p@pFg(pgo9>=dc+{y2pJajRcrE1TcN8tgN95kK4lQCVxJCWI0wR*C{3?C1Cxh z7fN({d;71{RQbrDic}#&4L8OcsgX`uKjSkmd-yK?+4xcZ`*Bj8mx%eV8GSQ5JN|m( z;~teiFjeS^m2N|U*|(p7{zwrKk%6TAlG`K2EJU{HE4`&$Gg$^4%j44Z3HcsceRc1X z9YzvOZF2`?Rqc2jw1&q9vkeGwP&4g>62^7Iv1_%KV}@sMo%H>?-%DCGdA3aJNhYdp z@NGBFUQd@qEeKT8iQN3UpW5A^BYgon(ro-m;d(UHT~sH3A0ARG)B=cUnZI-&cdF4T z5)BG88Nu}9OhDjK067-Gl-0a2ei3jqLFl*k2HWEcCx}yXu_vU(p7q5Klt#5sg%eh9 zsYR9ssM0#_ZeFQ@UH&&UpajsHQG^D6qt}F}FtJpy@7tX)`yG>PTaSNuQ8=!~9XxpE z^!3f6S7>peRT+sJ^nO;|`2cJMPEee;lJt-U_%MbOs{ckff3l-; zVs)z}%TA9fW|}>DIT%ymS;SfLL%g>oiZKZsU}|p?^B|fo^#+Tb+YV&zp+|*o#*+L9 zF8Q^aO_(`9YS>#Njt)~9i<3V4<=DXk&$iavOp;CyXO4(5QjV{2K7w$&@WioGLsO6+ znWbQ&-dF0_U>iP~dVKwFK9-DuEm^m`EkmeV)$>ENTAF#Q|C$l*6nAQB<#}BKU&(Xa zv)||>)3O%vM+VrSZ6DmLl{A5-Re>=XD{n>yOT;H*R#@}~_2Z_~kaD=G`h$M+gEB!} zCvX#OoQRV=`q@(#E=aDL>9z_Bfy5eBsy1$+s622wUp2h$?d4 zysIS1qcKZ;s&=_{=-1ce|Eo7lG1oV{)>yOji*}B83h81qMfb)mF((qfjs6Ha~in33sg}J|=MVx;r|*5Vn#IgT~J4@KSwqKNTp@0_oSr6CdGuH`&y- zs$rgZQp3rgnLrs&s}pp5u5G62N6YDshTUJOf64HeMOM=XOhTDRBRe5Gb@bhn0rZpzVITZAOX@ziYGm*Uv)ctYZE!TX7IwymQ{L`A-nZC zouDC$65N~L?aM5b=53{^pf4RL6TE?~FtdQf%$kBbxDXfTP~Jr?S;eW>R)4qAEvu{Y ziN+5$IGDfuArLMIn=T5Gd$oUEdt!D>-Rn883sbBn0tXDjpU)ns1mCDcmg?gAo#2yT`AA)c2`0y^R?6Duf(kmdUl{)MgjzA({g`5Hb5U?tX=u= G3HHBKg}~AP literal 0 HcmV?d00001 diff --git a/data/images/player4_point.png b/data/images/player4_point.png new file mode 100644 index 0000000000000000000000000000000000000000..68bb3aa4a2dce8c43c2252742f2c7b94d2477b96 GIT binary patch literal 2474 zcmb`J=|9v91I2%nr5R+(fz*ybN=#g zxe*$_AQEci6lxdf6B^+W><#F71>WyVC+M!Z$Vqy`nwqJJ94I6Oog;NQCu)ctTO=*^lfa_yAy7acYuIbYOH25UQM(*S> z04f1-!AmbyLT&u2h$Tv<7hZ>zHY%!TzX~Ju%cm>Khual}>{1yzKC_)2(^@o?|JL6T zYfrU1<7jO^W7Gm?*V@LD_`0`yGKXc{0bxL%GalrA@Bba51L?}|UydOd;r8KD8+s=i z!N7qgvxxYhx>hKkxtn%oBB*3bn||vALJjBXOq#iC5j@7V)hx3(8m~i7St)I86>SQn z@#N&>{IR>{tP!&K)NYBJ{%+v(9=DSdcZ(QGzjtcd4JL@X zbOGp)JKIH5!4zsMHrV+3R0Hn-Rn_$dm~-_{l-pjeJm%rUfu`{zqU$z@m7p< zmH@lRl~C*3#mLGMSQ@iFhh+PU=+KShYRL3c-8*ILPZ$*hNX`$s*da(?JAzeVX^$9eu&>S4(ECj?|rGZ??rrWjAb`Q zAd#sZF?;1Xmv2Vj&d$kMh;B2EJ$KL(`>ATg(i%0j0V)h)-|C#0SxT&~RucIXe#^G4 zwRNsLfsGmcy+3`-^)ebSzRQ?iGITJ%xcT`mLN7uZoiS6-cL$Sc3%AK@^d1t_2wmnA zM+LJx)HYh4W?a@PE-PaT-wfxz+pGXp;cU?? z6S*;F1cSmc-GmFtTJ2cmh!Z(@7CJgU&X$;%IHtWu>vH2#5(4Pq7%MAZSXrzRc@bqK zlZgWO-Zd-mI$ixqf>2h#bDQ&hd|>vhGlc|Xz?2j&Zn28X?E9JXH8nLMl!=Cc?QB9!2P})&W``x`QxsvgUrGM5KMOQPD2syy ze~sijo9eP>i8NKI+NsUL{H`?S_Z$4f0kaz+`NI&KNT8K8PwyMrQB`zpP;rp(t$faz z6rrvQ>F&*|ogR0|A#%!jb;gJki>zYo4ywipy;;_%nFzN%oYiky3=WElfx}J<#0(-; z67UYr?S+RDbVs%kT2@$JTubzhQRL1B8y`5Qr{hnZvn6u^&fl`_tBWNj~&)NYaysX|l3>y#1xhkShPoYx)fqK@ZxAHwQFT)aS%>A0kKc6_7^C#=T94|_kcMLkd68WzXM zmJGa$2YsuDX6HB>{6;nV_hZbRB$!xaU>)eW39LypuNXXhIN+-AAfqBL-n?%&CYvz( zg{KoJ7*F>^|2@5;v04xu1Hx2p-RuCL!#dJ=as%3~MVKn0sh=JnxT6+2!Wj0s?blOx zLcup`9_8glbf*~8B*CxWW$rMjVgmtfF($d3`^RY^oz2!DqOB;NmHJe1+141Mntb!% zS$P!3sb@Hb#Voe?I*HU9%(B%8U(>SAC|_3F+k5CCys|TX$j`Kz?CBkPL5rVJ{-DnY z<9bFHDO4yrQOnm+1Mp>c1{I_&2V;-#)6uGMxZI!3hzMO7{5cuB3#vLgXVl)>IZr!P zyQQ@&&1{WEBGxyGqU9O*cJ^-aGA)!Y7(1Wlmi*$H_F26L=^ZzamV;hP1y(oQI)Xty zzU4h5aqxU?Br<<(+aXlOnM@_ffBRvV!k1z2eY6G9d4y+{{@^%-nUaJ<8`3k4Np&$@9;A#mhcH{*JQGR7gm=--Z(bS&||X}c$4_zu0#@9XY)!6 zK5jZPq(f+{pR>zUuV+Ji2tfk4fTeDM%`kMH@ajJiMb3RxSD45TQGC`?7bR8qwhN zra<0pm7vhvmg}5kog*>G`{CNV5aP@8Gsv^%O7owU9X(iwDRY!}*DER|50snGq^=E! z&|&?>=>0lrv@t|r_(s=`!BM|=B%<&s1odWBFk1T(bouqZGmo;rnEOhDzn>p?DAwdp z0z+N$v;Mzz=KF-IpbJq&0Y*&AD9xe}(WtN}Ba!pmmy-`EX1P!1GjiKmdq?2?wUQBd z3la&!;dp!7ZVZ|~6v{+%i+r5!s0Q(5sumK3Mxhp#M!G*CSP~YOEv7E?GWG33+ju-h zpJn}EqOMfIoxjV)+QQdB!IqM+OND=lIRi6y>bXq$2R@BZ81vYZJu=5q-`~@@eH}!c z>E&e8oRW@Fj)`3gpVWUtY)1El9pxJG_4kv%MN1_H;<96;J3=KaDuDoL2 z^hdGWB)YMuB+8CN5idZ_l~UnMe*hIR BnMwcv literal 0 HcmV?d00001 diff --git a/data/images/stopkidoff.png b/data/images/stopkidoff.png new file mode 100644 index 0000000000000000000000000000000000000000..c8c88de415d02cb4abb25d2aba27fe93315d8375 GIT binary patch literal 2447 zcmV;A32^p_P)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^j=}AOE zRCr$Pn^%$)IS__-9(dq^b8rqW&==SXEC=8M{Rj~(K>&dnJOeb|4&F8{7?=^B!F%rq zZ#TaRlE_x6x>VKG4G-H98Rb$^=C90@Qd0N*Rnc$Fnl-g?2-M((ywrz0MtXUH)R;O5X8#ZjH4Gj$?%3r*Av8RMZ2?))(bLajZ5SA}r zKIP=elfOlI1^dE<3vSo0UCsXf{@#MHY}vBT!g>a^*@A3s8t>D9@6V&+_lv zx34KO^#%m#`8sBQ{`~ol=-s<_PNM%W`u_cU0!W#90YidtbJeO<-34J_V4!~b^l3*V z?v$+ZdjIU%vySR*%5Tx4MU#p}vPkZgD_7P>Mn>G(vu6ttL!yk^3EjPWH&Ku}LIAvc z`7-%N865@*c17C6H5V^loXkfm`!yPkr036^Ia7!*Ojb(G0B_&Eb&&t<_3PJ#+h&AXy?S+LAjmjdA08fd zWhn#z%F&}C0LI3~+?Ow3Qr`fjtPIRjOS!_%ojdFJUeSh6ojT=|vMeBE<^b~M%^Uam z^XDJ{w%#K5Si;7Q8~-i@!r$G4VTh?gRmN@#00$0tk+s%0g$ZUAwkD2r{EeW_TnwW$4(kW6n}2 z*a5)p+qW|T`1I*h>Kgzck6(Y$XLQ50gO(sE<`fu?963^o5Re`xz%iRUdh}>8+N0pj zn>T|1Jb(V&ef;<_^$p9&l1t`3t_T5|=$ZyWUiOOxxI>2yF|AC9`xrWW_;5-o{GYtu zcL5X(y@&6~lPB)OhYzVT07DyD6eA=0hwyCYe7VtOSTaW^0X__X z1PJ`Y?cKWZlq7oE#9 z_dyE)0MLO!XoLcmK+h)y2tKB`Rw;TjG~6+%35^bv1u!Nva;mehh$ar z-?C*(*a84x>(;Ff2AKjY5D8+Cf@7~Bt{{-gS^)6>P_)NYLP-*3nIZbF#Cz(pG9X_b z`SQY#ZfybBym_;OU;>O#BfM9F4`cxWGqnIP*$G8^EQORf6a(P*T?sxcgLbS^DjPDW z+*z_~$F>DPMuEgMARh>;v{t59criI2046)3qz6mk7XpCMfg#WT2AH(rcL*}5%>LDO zl7gfF$YO4A7)(`WfzZNPSH^HFIOZRU_VAHlg#ch7#CIk5u#7B4k%!?BE3`an4XT57 zEd03uNcNPfEDsES%tvUJ%R{-nZ!OBhFc@+HEGYy4!PN2-Tj0Y|tR-t%?L72LO@u&2 z8GQgkuHjpPpWtB5S#Ghfx;gS(3MP>pi_+MBYjPuoi%S0)S6G zAlid!DfZd+td+|m9oB@*k@hgDF{OK01&BlSnAc4$(PMy3xH5P0Jwlg z^mdLZ=yl6mJpfsU9%7X#!^diL831J1Ob>%)Dzas=4n34n zEVfKpndP)g8i1mc3BU1PTL2kiSpXy(OuK;0kDFyHq+G87AUU#&p?UYJ8=3BsB}>wW zCYCN;I#D8O3kZ4ZfcAS;iytxO&$^;r=FXGTcB~xp%RVt8A14YzEgt`Bha7UZ%B=EoZZKYX&630tT0p?$^7iCHdxS-l%i|^W z&6B~;4LH{vbv7u(v|z!4nw@H5_U(3O`NsA&X9Mz-Df*pdaP}he+P6K=(caR^YeDgy z77%a+f9pK-Omf5l$D)dc`04qd=N2;CX4Tj#F9)YPS6)Go1IR5P;PWwuC*WbVR*%8! zUuRh7*Q4?%N9@qQ%CM!z;wSqIyyt9COk29^3kah8za96yUjYY@?Q%K37IRvo7d%$^ z6)RRWrcRyOo&OWbWGMwg%o(C?^4J|>>G{UAY16u+yjldOu&u9Q37p?4N_hvJV!rDp zDDudO_Qv$-)4Qv@f*@wr0s@gaM&K%Wtn!k_G-k}0(HrFz1W74VAjF*4tAfWWFB7)L zoH=uPtGt3BKGy<*o-K-*I+x|K8=zwK&ENh9N(qerbdpAwElc`7bLPzM{z)o!EG5w> zt4Nu0vY^qNJ$v?_p}c}5^MonVEB)OjG5dbWQ~oUFV=d)>zCRFw{{U^k4P<jd4 N002ovPDHLkV1lMjf)4-y literal 0 HcmV?d00001 diff --git a/data/images/stopkidoffs.png b/data/images/stopkidoffs.png new file mode 100644 index 0000000000000000000000000000000000000000..a179f30b76213d0b0ad63514bdab5c2de1200118 GIT binary patch literal 1863 zcmV-N2e|l&P)#KGB zPUJt0j*cG4%{y1%=H}+h*x1-l*J^^1H_ZC_dS`!szjtwQ(Yw67?46&V_s-7F1{(Ki z-1nRIr9Vw&-Cz2goSgJFH#eu2mXbkbIwe{Eh{QPeSoghRU|2>1!yzN*zV4^$mz zZ*Q+FI<-Rr;IVvFr5_$1dXnYe+Vk^skr;Ewl_cC8;YZU%!4O96qOIvPfxRcjEZ?I9Wlg`s2rsqJ97V{jI-6!0qjAai2aq{gLca$R;$G zmzPWHkx0n@iAj-DSRMjW8t&`^1teow1l---6*Yi=4>D4o3kedc^^hR*d=_{VMsXhu zv2GEA-2MH1(fmFTlR^Np5FZrrZvibM;QIQy=a$z!GwsvrR_jSOrsBp z%8hrxSji56p=pq6F+@Nt$iDu*-eB1VpCtGo0R=mKmbUqgX-ZHE0oLpQc_9KIGsX}q zZm>_aq2_%#a6I1h@vY?#tT1oCbgLfY899>tt%z zs``Gww={Arlq?TmcCZLwtTKI=`Ut~Vore;DKD=g;{lZDo66-1inGgX>lZ;2D-a zBvV(Ozt#F>`kMr}pmPZDGrpF@mZej#;TdjR1I{85?{PyjM1mB3gCS5i0s0y%6>KOp zGzpRmLd$8qF2;C`5a27N?+5E3fKVdF0Us)(*=mao+u8_l-7Qq!)_m0;@`Dd3T9jes&jTx(jE_4|hY zCMn|5DI~D>(TWGef~X>g=Vf^BeT6L^VTzX7#pyV@qGdJDMS&i6W?MOcG$C>#KbI1W*aKO#r*V zIRu!~V9r2(CD=9rxjM_afx$W;Gnu?upluIeg_ui#U>ytrDG$531JbW;0$3g9=u6RL zo+09#o!rbOp-lqVSB%;Du?Q+XJ7kd%yXVgP_qK8X**{h$N?kg}QK+X@woe*J>AS85r63QN=_d?rMbrRD*5kCz{5L}!?X3)62e3$pIXr=ko)uzaQ@<8*KbO%n!TPBT zzifWexW{@w=2@=g1^l12f!Bd39$Zhr5-F!Pnw0h2erkGpx|#2ZC?Y-@32s3omTwNc zdIBW4jOThn%Au!_tP5UB`Kg(inPx2S$CG5&0TSu}lrn}7es*@Y9q>v9N6~#xNC8kq z)&(yG+mw7h*Dm-F2{9#eRT-CbR0j1=GKXR6(Rr>&bZf>sGkECMfQWhFj0j2b3 zOY7ag8uiJMI$>O_GTBCxb;`%Ee5{B3FZY2N_y^iT2a;nL$wmMG002ovPDHLkV1oW| BY`Fjc literal 0 HcmV?d00001 diff --git a/data/images/stopkidon.png b/data/images/stopkidon.png new file mode 100644 index 0000000000000000000000000000000000000000..3897908daa793585f8d7304cf4c99597a75c29e6 GIT binary patch literal 2818 zcmV+d3;pzoP)Px#1ZP1_K>z@;j|==^1poj5AY({UO#lFTCIA3{ga82g0001h=l}q9FaQARU;qF* zm;eA5aGbhPJOBUy7<5HgbW?9;ba!ELWdKlNX>N2bPDNB8b~7$BHmT?0B>(^lTuDSh zRCr$PTYZRIRTh6+k?L&43Sw=MVsQ~+D7J+{QCvX^A`0C?6;!r6P^lGLI<#tOk+#;= zZmHWZ>qk3crr+&I{g^VgTSvx$vE9Nj(>hqD#MF=_5Q5p~hCs+}*5mo*&dJ>O-c9n} z%ZL8qC5QKMKi)aNbMCqKo_q5g-g6 zd*p*QZSs=TMSakgEsCU$)LXHF$g)PaF*x;e-hdX;5dPtZCj}LOn|*C-`+l)y&1--N z;hV@p_$QuF!mnA=czW?gqDlmdYHPDQekl-oENeGC`lu4V8l%n3TeXU4=1hB2t3fzo zSrJ;ixIV$b{Duw67XTzYgK7aL<>U&>yXPLeyHy~t<|8GuU%9eA8X6);ibfS6VcG>4 z?d|qpvq9*E@Jp8x!4ua@PVv=KPfvaAE?j8uu&h6Y_i9yY_T6wpgr0tysG}noVMy%i zQnYuk5)f^eQg5%yLme3g;p~EZle^|FcFqk2;q1*fE6p!o9*kg`nT%6Z2#Iz~sjrV{ z#|~!>>H~}*-+tr~`mj+T^iQ9zgopNn5+*OMRJ?v&IXY7s7$5?<)7i7Zzs)1m`KeRu zvxG}`-yNZ4%P2G%04T)cN~5OK-%m6)=FI^pA^8|-YYPX$NPByv)c1mZc*znXAp-z; zSb*EiMdb76iLP8R1E9AXDrdi#Fw8HBD`vm(Ag7{CAiNNI+LiB7$=j=i}n<*r>L+O^9FK;g_8BLIbS z=M*pO+(Hv8^W=;f)j^0ZSP&_F0E?S2^w2{@I$@S(0^qH;%m94$8PUjyC$I21TL$=X zw;%MGW$T|m-wZ+#b9)HCXi+!Nv%bz?+ z#Y>mGR`cnnMEFJ}^24LZ1F$TMf3B3VESv7SO9_APy;xun-FKgQ7Q(Ze1T1)PE#;3L zBYO8;F94S>t00FV<&GYu;>C-eoa{#*O)5s`r_w!mgbX@C9+AxiK#X6~?Y9%nnWHMs zo~;Pa)d&r9`I4j3l6~R?(c5o(gh|81vFI@YaOe;fzW&+^8rBF93g7ZWI=>=^05Ef= z*#b%c+TVt$_);Bax%w{D_&~x zV=8mU9g2S_6~I77lLc^Gk7(L7MJOa7pn=@yir{NglHc3ZEa>k9ygpnecAy)IubE@ z`@~mYslbOJW%leL8h-+r@lzz39q;SCN>=c|J7C=(6<@eyd)fV|BSpJK6Crs%$XRA6tfzr+3b#eY)j z)G5z<c{4(fMQHQil(F+8zTK=#n*LL3j7e1bLIA zW<^KC;vnIi*ij}9c2Pc`FVooHcTw(z7x=m0c(0f7dq1|F!(>?aV12=>!o;B?a z)&fhHQ8uI6&+xY(c#;KABofq%ps7z8i~!_)R<87s;a6Uv)W4FHN~KDSfxx6rB9Nb} zUhmT8%_RV?e%S308iIr39A>*3fd8fdaAEy=ibrD<=b$H;f@X9u1e7q>A>Jp*aIB&v zEVmDe#bPDG{pshPBaUbIwt(@5cL8p2XiX=@u0_j?33H+)03rlnK$V`wtVQ6yXZ}os zJfw=y`t|ztI1S927>X z8bJF1AjPo{&oEe*6D(Q4nlhuh&^jO{4VvCb9Y5uJFwz7BfI%4W01%`PnH=E-?x%hj zZgiR6C!Y*t{u8`60e}q~Jr1f-!n(VT{yZ>$eq#XeJBC&q2H8o8!)w*GmxC}@Z~FbO z1Awv4^<}TFd;DhJ_wnpAvu1c~z0Q})Waf2d%m55C-?v6I!#4jp3a zHy~S06}HOqufN`O2-1%~?r)1s6Q0iv`WIeMVoT^i__*vCB?ww=e~zsnwl0?Mi< zDZgVWYatR=kTCT)pkXihwFoaD@jPKS@6ZmgW|~TD_5-|5ndetIzm@w9f$9kS4D1Kc UVQ#2Lpa1{>07*qoM6N<$g8rjRDF6Tf literal 0 HcmV?d00001 diff --git a/data/images/stopkidons.png b/data/images/stopkidons.png new file mode 100644 index 0000000000000000000000000000000000000000..a017c8c9d95e4911a589c5965189d7626f2fb395 GIT binary patch literal 2720 zcmV;R3Sae!P) z*jh~%+AO;^yKe5fo84?yo$);P_LRAEXLs-0u70q|$(_CPa?kV3nKLtIrVpeN`dhZF z!G}_*0W>F-Hih#0Pv!mJYw5q}$!X+s-3L>tNt{NBcc*1Nk^qG0P1FE>*De?Q7hfbVnT!AD&!yP1#UAT72@{r;5pTa84>*(`8*_aDNWyPOH^R6aKVf;# zKW~rsiv;TVjAQl(4#bnCB`JisFNK0jNR)O##_+Jc&}$NA0DkvwDd36YiVB|7*RI8D zcVxsqZCQ^-_i7z#&OZKlM(o`y#s2-_1XJRrORjwLjSCQMmZ1ZTmUwSFyjJ>cQe(yagSPTR-e*4XD=1j)?ycEmJW&+f9!=%X) z7B+8wE|gDL9vX6|x+wDQyHc=Vj@NqHApp+MU;(Wgt^uvzyC=o@^F{)iaF7N9n(zV8g`8Vtq0XFo`svOjnujO)5oIY(P;QDnb3eQ4J7cTe+u(Mfr z(_@$g>Q}DFrh$Me2mmO2D~PE2G7ctS%NDZ*I0S6k*oW0ac;i6b5f!{`qG&a%3XlyYGwy*b@_O#{?DD7dVgx29SgFz<`;65(q%% z6HmBL5Wzi+z5XRz?tne3xEe#K@~xO zVbfE%bxVqmJ~9$eK6OgkH*Wayiijnk6Z9TlGiRgT$b;Ufqv5KDB7iHSAvPnODEgTF zy>|!{Xa;B*_5wNhiVr?85>O(-N{9())={`X(`ly;!t@3QrX& zZ?#(MlBXGzW2y0&_bv{TVK6So_vFm0E#P=;4`SMXf$L4aR%rK z2M%j(LmI7l{0kwl(w1d44`T@=Xx31n9&a|A>yjg-8;1^g-l_Rv(mC=C9^D9BnPvvP zjb)I5A=w2BhP!V+K!+S%D|#Ac2MOmyjuPXvfnHdXWtsx(2M;<*s_&zumrv2&0UICe zFKAa-oS0m1vtF-DNUc_r^OIAKc}F6k8la-FVK^rmgL&!^RtC>3ZF%jZM?LS<{4nV| zt0oJ;)X=SBCr7k$_MD>(ORefExBi=y zg~DNk>t?^AO%?V6yFZk*${$Xfl}g0{UMiJju~?Kd2$}}OU?iXsuyVVPWNCe0E|z4u zTy_+LKuJ|pLb|2ZdcR=vLZtzb6DN9XTRb^94s4D21L;$zW2V zJQu0$3dJfIEWS~olOzbz*Jxoy@r=M0kV||BP=kw^QCT1YSTR@&~WzuQtbcD_x^>`oD(4#dox2ynvUF{Da?&M+ID zxMi1clO&?P6an`S0a_l~Q5$r^Oa~6e-uH)z73AN1(;L9m1G@U}HL|eaJ8!x^bCIr? z(Td7T0!M)ZJX^FO2@~asQ})gr1y&J|380rA8k_2LcW9DGpgn5BQga%-5U%Jo>?MG7)1DZ-7#_y zwA07Q3M$$uagv0rB07w7zHXxEjeE_3dtNU%N+fuen(BFByAxwNRjyIoKS|(dt4I;w zuBXFVP!v~tBZKFPG0W_n ziy*H$=n0>}BbzQyb$b`&vQxJ*%F%b0z;Ej{cqW0&Y|yiBfcM2Uw0?>Lp7t?w!~Fu! zB+x+flMv*-UJ_*#@U&{3+ud*QOahHLF9}dA$g(+38Re=AnZ5n5{{tmC#@FL)qodZv z_I;$+|0ET3E~Q?`Le0<3q`RaM9w03sAdOPr zbG~oBnRE8sxpQ}Bckk|=-zL1#R>i}n#s&ZYPhCw(4|&!jw-F{fQbss|pO6QZr<$n` z0N{}P+bBRz9wh)^>o_YazIo&1;p^e!Fwd@{LTRY0#=~Iz5TRw&RB{fHhO7~0(7 zkⅅ_5=tq8{abcJTRdEw_#FJoQypfUjdYWIUG!&M=Q67??v1b!J$I71xmzwlpbG* zm^*c*70Yu!Zl<0TIyK>|hkY{4)a?N+ATG zCvk{Z0-Pj)s%fJ{Wx#|FAa&Fj5C@jI0X}tOM>U|X73i5F#AyI9aRENv_?TA!S}lwL z%%&2E6e9R>F#!OD5Hh5<7Y_kb_%%~gBFQcI*4&5P=ueDxcH57;)0Lib0I=yBHuK2E z+ejTDi5}thSj2LI=46Fa=y#Lk*gzoH3=|%$7+-k)i;eP^Pw?;GcXxJ{Uk@ml+m0EB zK7#tJdyF66{Rxx0zq$JHb&EMtz%o)5?e<6C#HD7*i|JIX_jZWA6xI7yoTq!*ImQ8X zJGco4>9#JhSF%#hhYNuc#sr1bSA#6GPj9z2xb9G8HiUsX7a5db2zR-qJ?gav8=;AB z&(;k9oOgKi&a-2pMmR-pPJ^FLWgk=vS%3&f^;9nauu@{?F&Jx<9mWIzrNT&#I(eGQ zUP`VW^cTI)5xqF~HX`p8m^2v$;L6o>hGeo|rx4!q;z8R}Q47vsW8vmdW#tir7vqOLQl zLhVSnvY)O8qY+0c_h5;jffeX&>EzW+G)=UZ)ynB#Fbff_V2NU(zSr$zV@xa8Xku+A z`ZGXjC%_+PqQ=FvNSs2#OBfulI3UVQoS-Pc2LJR-z5YLgS>johS$93A1Fni(AvJ2I zw9%Eft_>LCpSkEcM`CuMJN-L?J2X2C=jPZ@J2|iaZuPg=^~PLYQ|%J&3hkmhWC_R{ z7U$@#m47iH5>7EwsQ%KTSF0OWP9o%&BR&~TuC7s1U6ejY?L^^p<6QgGx1DG$olZOR zoAK=Uf$Go9pQx8$T)bGa=;3$}J5??v1|^6JOj(nPQ$@#Pys82t;28(FAT>GQYx(ULu*tF1@*Tpu;w!=4PnqXNBT7S zpbE+II2fqh!$9`GFw=(wbkly#ejUaCbPMaPw>yXEaqOuY1GpGm@hW5eB83N7>nFd5 z_;Yk*Jh${-d7Bp_uyZG!Vi?N;Mb(`m_jkV8SmU$7DxK4WdYU>qEsgNd| z-@(EamXVoZQmIy{Td8`~B~o)-1}*JU?l8TJ#Frm_&1S)-3QC!J4&B%PuD@1>T}G}Y zEpb)D19L5*`O={T?shLb$;$s~6_Ky$QMMk~wg2};DDQ*8gWKP-D^*+*^hR7}^i|v` zN~u9%FAphN-r?0VT}8`&ImHs&blc3$_YnAuRPln!M-_q(&O;X4%-e25ZbQYa=&TH^ z8d`^1Cpmgr@X}YMlA4m5!;=$}MU#u!!nxA?O9K13`?*WG8?82G0cKn+J2+) zrKTq>o$fJa;-)1ghGv$HD%H?xmc@?hjxwS$xOSR$W&R?lzwWGMw56hzs&01~eYK{= zttHeJWJdvN9jxg;N$W}rZ4dqUAdP_+_Z`2I){HjHr^%aC!boC0XDaVRHgxbZ5}|_hb1Fg>ZQ?`IM;YsNLRb2B(oA6n!?7{wifCt>=RHb;N7A zUkh`{z<6AwRz%x{+GU4$98D({OrR#}?=)VB^KjINxWD_laesUfw*}q8*$$@2;vKQ{ z4E!?HcNtSgUcp1mC6OVg8Lut&`L{eFM>+WimU9v?OEPv~A8j9qk#|O9CVpAbf`d-` zT#Z93DD@YlQ#g=$P_Tq+7yh2D;!~$4p5|JvL_T?rKfRlPv_uzwbSmVNmjaAIE3E}| z2-AFpzVX?PrTPip0*OUD>>ZTwXA+>{%;MWOVkff@S}2Sx+P!Pv2TGGRxR9W@<}GtcEc+t;t?jm5X?Tlvm&?_BPpb&R8S#Dyg=_77n)s zoyue5%$l$+)*vm{NUPqlsNQB2*CQN5?A@5qBgE3NrH%=&=|;2d-&iP(3|T^A4e2UH zCRzA0J0f70CeCB5I~(!2siJZK{&w1N*70C(ojczgKLeJzmx=F=_kE=aZ^NkR`084D zl{a&eeYGRHMG;=yE!EcPP&PU>DJg64pTVWUUjvbo*|lcdrCaxz6Pn=8YoT8YtLB|I z4>F@)R}E1NwH6!~9PZTb8gFE45?}|n8Fy}$)!J@e$HS5K zMb0Bt{Na~hAEBpUZafh@!;g7GTTGrxfjb8`SQ|HVcoHlAAA+kkG3H+S(}HMuT@-T8 zb5wHmbMDOT%-eM)WM&o**Msg=S6>q32}zj-zP>ORbzV7$no9$nPk(@>Lqo%O{vd2t zi&}#B?WZP34J$bm7kLKB|9ajEY90}&l^^ENsQZ!b8025-41;Zr5@AfbcQ?f zI&x~@7OwDsP=mwqyqK8h7M%e^jg5_2Sy?@UNfhHc14Zl#smx7HO@;OK5SJ@fHi+7f zCF}6PkrB+;xHyO=D|cwvb1n->ubVZn{Zfr3vqjYS{k>H3OW9;5)npq-$GvW*t? z3L+8}7Vh1@_|noM;;~X+&u`K0ixvKGMX_}zwtx^QYiJ+_BfKzP;A2qJ(9C@M_UR_y zemHsaVp?{%udi=5e)-scdyv9f$>FXiOq)RRmrSr>ZekNn2H zeP%}Y^7@+mmlY|OUF+({OzSWz5gN&Xkn3NjxOjNBAt8A#Dc?+gvgHRnBar$XVO#s~ zcz0?a78d5EgjimV552qQH&27XZnu(n`2++Mnw58GHKZSJx7$v?-nDhz4!;b4x6)jW z_FGmE%hko@_ur%1?Uq&dxloFaDrcKr`O-)U{=x2C%c;zry-_M`r zevB>O-vwMP7}xtBo7Md3_CKaxz}F?rn`%|XPf(N;aGU z*AJD(wSC9_pf!)yRmkfS&+A{`XVLvT{Ez#JQ)FNrCpULQ2}+4$dF+XvVlUc{($dmO z+fx(@a@Cj#lLqNApE0Z3tyi+Y{@dzcx+lX%ij4xy!AKPtAw3Ahi^Ic1-;F^#ek4sc zQ2bu?=>GVI{qs~x2B>xkC$1l*d!xWFWqN;ZK}R5az}%zD!GtarCjwSkS?{y2y>|76 z-JmH#7&6i@5#k;m9zHX@)*UW;5yVU!xpAs$X-V5@#Ve>KM6H!%lFD4F#spC_8<3Wk zW-;_;CYEO=wtXzn!yO2JUb~cJ!x!%)gk3NlXTpW9OG<=`KC`qGm!D5J(vZia15i>@ zeoJU;Z>N^@|J5V95u%@`)9H6)$DNkvUPYgt)Ysp#Y5vw89_=LH$h*1#L- zdFqp@c7LEenMs`OQ&UsEoQ@9jKW~I&KZDW*Lu;Ib#{9(3|G-x~c9}LBGno84Xd~r% z__UBwO_6I9`97k_5E4tI8#pGC^8Fk(DI8EL>( z*3G&pkP6gev&)d5IguGN`t3|6j?K=?~cSM`5)j-v*kI`4o!6R+qZZZA;ir5_!nu?2=#?5kQ=M#$J zhv|YpWV?HM@^PbC4XPH;6jl4aQcFck8Me>TF*GE?k0Zj4X+RSd7at|f9p9ZzP|k4J z^Qa4wUEfi*wtflF6Ji#Ym0{4Ou!YvbV3gFH071A^*!MoZPOMOGm<MDj*|;20KP`UlbgXiQ|EtLt|&ZW^-i@>s-uw^=qP!0PWd9)Y#=(fRUij zn^uD}-Rj)kP!l35Iy0dmHTLW;Rhlyn88jM7@W$NEY|X`+swNoBj5-BW&9>L|zL)Im z>S*c8F*v5#<97cdNsv>3Jc)rksf1IP<_FcEfnBNcH0A`!D>v4HY=xvjyNRJH;YUQT zoeWXqnB)t5^PH!#vDf-JLcVN|k9Qtx&FP%RW`9*bDrLCBg%^z4jpFO-ZUeV8`z`J&cn{hBHp` zqdH?JF(4?&Y-!8I)s?&1ePsuzbVw@7N+xs)vviM9OMQDAo)M%VpA`2Rwv&l{>tJ+#L_gJvpKGyH`V>3ykc3d~(CS50OVpezd;!I3k_~;Tv zj@IkhXCposU(H7e|5`5+_?dGInPk55$o8tjQq|HYlB*@EIx-|0ZDh9?@rPC~WB|6>eg<&|o!X0&}omn}FUo8ygZttNl% z21Guui60&s@?A1BGsCr>YZXv{yz!+xR|U5X&+r~m1?Tc9ZDtzSUQXBrc0cSdbyV$CNBFe^kfk^~n$dwNpz_XKIp zjPJFbG7G?GO($%2Zqr7Z)_kV!>UxxF3JtMLp8=2Crkn6l&L@;NHVSGqae)iFy9-T{j84kSZ*Vq1QG*_c9xVpu_a>i;gTygT2 zjF5DAY0|pg3%0BdJ@Fe25;{}zC$xFZp0rB#P8pAn~ofu z=P@6`{vNPF1H%t1$~;dH;^QrQJEmJ9Mv51iJ{aI#neuTmOKWRuiPRt7@L7KIYTTk3 zc2Z^jW7P}0elA^?qG_$^ME}oY`O?8zM0LfgDb(wkH_9{3u1i}zk*MuQ-4E9^>%phe ziIzke-w=ooNVqttDUb=J?&|7_z1dp>Z{2K!gId~Y-l&jk$$Ad4A_jJ$eR1rYx7C67m`rnR<*ak z&o3jB9DD*-y&2PUb>%dwv2YIB;EMXT+~iDR6}U@QW!C)qW)0c?&qmn_=+j@DGT8xH zIXQMGv(N53Hm@_d%{})fsKzs0iO16x7ma?cb!5WbLxX~-Uxxff+1uOGlpb%27k>K3 z7Y~20+E0jq`m`@4vgrJQ1sB-&A784(FA+VV`vb`A&HP% zzOX;LnW_2q-xG?o%SbxFr=@NDkjwz7YBue>x}Crbx}?ekcvly#dCNO~L{NMi zJS#i97fH}6Dk^*u5@z#(ej2P>nl3Ibb%7U-@kQ~6hb~Aq?{{xiBt+}Kn20~$otAwX zKw|Yj(F) z3wR-W{~HybPAWb?N?SN2?Gwk6j=8z{;e3VuD{_5({fd^B76bA96q!AlBoX^EC>tcu zK%Snk?wx)b62Q@(p@>1X-E)wx?d>@>jEv_+S?LHQu_p#>e-v%dj^yK$Ap9C{)_ zeu)9*4HPy<_Wu}=8go%>Y6H$6?yWf2tC?PAn)njY9A`KU9^H3#fw73|9o{Q2oSd8( zVgBxm!6_}!S2HV;GHoKv^*=0YVen;ObI!R+n#?n}+)2~fYMhoS&avA2?DpvnSz)i} z{<(T`;+})sCN8rJjYKlhd|5$Q4$FFq%wP6hUx^BD=b>bJ_pM0Uf8!H!WcpwEZ+xOB gB0)-annziHF1qAdY1nB4aykUmm9>>>6l|jY2Yo^)`2YX_ literal 0 HcmV?d00001 diff --git a/data/images/wait_02.png b/data/images/wait_02.png new file mode 100644 index 0000000000000000000000000000000000000000..4998d63c7447c2db0e94ef862298162b67f586c8 GIT binary patch literal 6444 zcmYLMbyU>f)BX_B%}O^2NH@|-H_|NKi_#5>bazQF0st=Q zzl8$i4`CP3dIV-S7G8$3ptf)@Ub!qC@mAPS|KRo>&+8Bz z7B_$htKOE;^MM%!xDJ$*;zE!W^u8AZjIb-KANZ}!tb)#rYOPTDBWHuuhg)D zLBQ(|iL#}@Yeke`Xcnt3P>2p#j@el60&lqiOSYhcSs)mCo&6C7FiB^8j#8KcFp%0s z%L5J)01ROes{k1B0U&#|elcK)8{kthv{wecH38j|M7VVT79PN-9Ubu!K>r9>4l^_R z0pZyINb$F!oA;;p9& zmcR&hek^`*hVEdFTj+fiXJ1G7x)CTmUNO9I`xhI9qU4t4<^8?ACDnde6RT0fPmhpZ zi*CaQr<*{@`>Q`&ojWWc0%jpf=+|4lBB}aO<^$B&GW%+^2imS*Cs!>lPyp z(5^O#d!l?!{DnXXQ;clt%Yhd&PqsUoTz6>Fo5H}i_tGdIQ@FpH*`WPZVfX5m zfZuJdJ#*|>Xu%F)+X&yMbD0OF!WTfWy-KP(0GP|O@aT=!%M4)wfP7&H$G11smpv3* z-54}I&(?Zy?=3~bWm)=rWr<{QY=db$EMLMxW!WPqzR_}6^3J`c73$V@h)i=M;OW(G zCXjL?ytTs0?_qBb!A5^Gj74h2xDt(G9c#p#h((?qan0DHj7}2A!Y~pI(q>Xi5mx5c ziPdA!SEl_f<$)>|WvbYkA~6gIgx*KCEAgj?)M-o2;Wf&&d=;e%S1iVzvi0K6Ng^xE zo$_d)l8P58I-II>AY4h3mK);hKBB-B?04eh8SIm-eZ_^HW;0gH1jDNwr21w6Lu-rq zV}q#mMJEYS=*AX7_myR^qI;ukq;90Sr2LhEhDC^Y1zQvwEnK^ojVbM`S_5k<@l8L4 zwE%yVkun$a0!b1nFVV+nxqeX=k{CGwww7d6mD>OGW=LifXIylckGaZog_Nn7(?(Wo z9qTZ~(zzHoha>i&dwqL?d(?Z3zfEwU*00_FyVl)d*BO1UO1V$8FSL(gmnHB<|4WX} z`qv^oV&NoX*{UMAPK|cdS5hJG9I=ToG8MIws^ZVHR1V}0SMO?$yjqFZKhtSuP8rUO z9V;DW9-&?O;^9X=4;zYxuv6wzU{XLReJN_P)JrL6<0yyp_(b_nvJSHevt9L#IN%%s z&r?QmKC6Ca{Y=flt5;r8TCq`qtAC+Crk7N1uKTH4QD0DZw;X#eqf);D`u0SZS{G6- z@inRf^3_#O=D$GjLktGEPrXk|?mz9qT8rKGK?YnK%6dO8Mo0Y0NbeBge%9KFU~t*WhzxU5ApO|vq80n+#F7kmU>-bDFre+gr?8tx4L zWCgJ%hcpdT_noD6q^r?C=ea3=E1x01kqhD1606}> z73Pqx;CU~(BHAj{Dl^Dq4<4U4f*PqfsnLk>a8!%9ICXB`pI$`mKzDF=Kaywh4x738 z7ftqFMwF42^N?_fXS`OA)_j%z^9>QlSF-pQze#;xB;xq@()L1_c&A0CqnG4NIp{Qh zD|2XkNd1x0F6_@TAXvh+-xAJNp4_gEufCouo==wJ!{96+CEmdwmYS06E?dEK+GN;+lBrK4XqJ)+fWBfw^(uvZY6Q#_Wq6m~{|4L;J3Ym{GBe%6!g= z)A9Pz)nw7U^Ma>Sl3tSSRCr0Gnjtr>(Lo37y;z;3yZtr$>vx%hx5Ev z<*8w2bzleU2Mxy%^PbVro<n7@=62#ra{B$pT7#L zyqOd1t8HO$xt1?olFjXQWh0Xl5;A)K>0RpG>WQ4qtT$RMUb{@6QGaazEA(T2)ujFE zL3*TfRUbuPW8Qw=?oQ>d{z|4grsDWIbO>z*?E#aS0KV8VH%~hwrKgj$ zzF;K*-*v0|q=wCgIW^)I&fmShOFpK}Y7MpJ zwdGW|m^!wceduWXXn%D~oi94Me%aywi|lD(K3_~~z2oA8>(#*3pG~s$Ko7Qu$+5O& zU$(QVcCB`c%h#uGmgUx?=4DJC*Ot!Lg5G!g7G6xRDP3VigdrYN{v;8~Jxj_?8jHk_ zJjs70Ehe@jyC&+JpX>fPi6DiAZ$N5i zi_{hTD(~EX(lh^}2Ixk`vc}d`2ER^@#txNNCt|VwpJX5=MUTls%6=XDfvU%lx;g

`om$QD?+fn!? zr-U;1M4q0WO^W@(!oo{kK{E9s`MnNBR&kwff1tG0b(9sQEU%wJ$f2*$_v9n_xA0KbT zw$s}y+x~caV$|_Lc=6t%D-fz0H5{v!$-_tzW4Q`>6=y9*=<44BX-SVT+ri9lxjGi7k!>4Tb^dwS(`=B!}BOYdi#wg-*fZy^z=Q~ zm{T8#zo)BZaq{XK8by_rxQo?hUv!w7SKhh0Mh)%ubX;x3MMh#Yue*Ripso9xix@A% zYSW%Z$Hl3ssbr6?3H!d@Uew7vu{4Vz7o@J=P7IsZVuv}eY|&dyUba}KA3kkoxBdO$ za{aCqXmJDjtX=)a4ZwW4e&`w#Kp$qtox=Yqt_Za zjo@Cd`)(>Q5Gl7O{hf4aqV{Q{HLnrfr%M|8!dZYsl<$WB5T6Vl8}K&|$r0yyz z*gij&LXc?W5iRgLS*RL!TUoRSf-d4}s;l$W9NMhQYYTz!YMTvSfeVp#%xlP{q@-d5 z2+&c*m%>Xq*Ipxp;DN;(oT)@EY@mGGl0PkWX6LWdt`umeHOq?vQM_F7GI-R(`y` zzt)IL`(=YYHz}8+CEO#&zcX@d-#Eh>KSK7WpJa@Ix3x8@bOEnb$|q@hTX1AC`}iFu z28I`tJ>^_HlRdsup47*MI`Ra0CUxSAdu#5h+2e2qEOEz)HU!Mh6bFeIZIG@hkG_6U z1;>@tx{GLiXgxUw>Q7u>iU7A5#4hH&4|K0nR?t=_e&^`u7~3ecT287!tR;QJ zB4}n|VIhmv9!eP1CuVXSkj#S3lR5TNN?%`rk3t@aN#eEsesoqL!KtxSWYBrlz_jgoO6eIr<*Y;l+p*;+Xjcx9`7_6+UI;Q=_#Z0eg2<+bm zb6RI4jl^;6t?d0&zKWZb@T%h~iyrwZm~~I%ycfOrMYH;)Dtu%$gfeuW`pBiS_;qZACqGwE>9?EZHu0czFvvd~Es67+E!9xx%rgyXH|Ir0 zeQZB;XjkRF09hCD#LW8o-c&FcY+SS7cilVlY-M~re!r7cjcX*kJi@U7&rKZKN|cxq zO+E`HQsB3_H_`@`Y9TJN!Ke!`=z=)QQ|Vv&ji9Fo`GVKlpmk3c71d+gMmU_R)6nC@ zp=mWc6mruX^1A!-uGIJE%r^cTPdO(THO#zZv@&6&S93C;0FgQT)pj!hBAh1S9rv7m zJ_o!J^*m*}NWmsPJe6itmCVeevsOM`x^;wl#P$Og)`^;s2rXt;AImxW9#f2^4I++_&*G-%HO=7U(h3$eN#)!r zFMny4z{$(oG}rnr3=NjU9c#@bTX^Gr{ESH@b^8hY1LYYv-K_-+5f-1qxCf!0zJi5C zfeTM;22V%m3$6UR*tYXd6W@d;t!Il+OZ@j);Km&8c18!4RFWM7(2Ekvd30{9(Cy$J zk62<8E54aeHqJlU&C+`;laE7{Q~TppjhrKJadEwOL87i3{qvQE^`!h`vCeDF)4#{} zvALHOlo0{?`lOUY7g759W;3&t7mZG^JFvCQMDgrQNtF*itHp^H#m&YDS=Nim%gdH{fWGk`E5I$50;-=VqTHO@jskgrpRvqiJRvTX;IxFL2$ET-*OWN z2TE{@-<-o}*tVYf!XR5hLPDIqw}7y|;wE<#*gCMwf~^=1hl8f;)8h=UZN+9U z=Gc?K8B!KGxw+n)-*=mzDnh9OqgF=qZu3={Mn60c$C2< zEFx0e&@gw|2}Uofb>CHN|GVO7)Z$Tc*5-LQxs7xe+2ccnnJ|J!MpO=XxVyWkU0gTX zDa*79-~p|ywUY0goccRI-DO=Yl$DnLMBZ%Wnhb^-aCMyQ{A-N$M{Jo&R1+yg@d@%$<=^B2ABL*F(ml zCzpiw+_szL)!8~olvRKvLGjmV)8@|JNLq#@V#dZ@m|s*>)aK$~BGQDA*q3Z}cJ?3H z`}vbkQBl!DyvAi(K2IGCrWA2rLDvTTd*A4&>XMTPvi1ArQ`UO51l$N592~gqk3R3; zb&pRG}dSNeN&HMI6>UU8I+mvR(&BBYT%i4$^jOt9adTQw%JFExV+(mFnZw znZ|OyE)n`Gs3smhzPs=JB$+no*Mf;_NuEf{`*{xK)No5afALP0!Ymb%KEY8gIuIYCo5jj(y!;=};V%_c1B#3Am9>5V57S8^gnE(^6?Ux^4 zi3azLerb#+P#f_|j-{+C$0CU8YuJi;!C=kYmFZ2UTupJ)VF24^roSQ}tDPS7S+2Gf z?sYI!mIo&Hi=Lt&z$qOvyL#Uod^g+wl?#Ki4@y{7z!gKWsp0dkAvVi!^nAL6H&-_I@7 zq>+)4h{QyK(X!RMB6YqCB)c%VzP~`|_TP=L6>uS=H(IbSZmmS5)@q~lZ(c)Y@BeeC i-2ZQC%fNf02O{!jX{KI;+91bKKt(}QzFO8Y^#1_7H)U7= literal 0 HcmV?d00001 diff --git a/data/images/wait_03.png b/data/images/wait_03.png new file mode 100644 index 0000000000000000000000000000000000000000..e2a13ef1e81fd499ae84543b7c3c92ab13068ee6 GIT binary patch literal 6571 zcmZ9PWmHt(*T*j<-Hm`WNOun1DI+zcba!`3D@f-clG4&$GJr@oGK7?rfONw%zqS6a zo)_nyb^ZIzHW1sO4Yo)UIM6|)K5?ZAiMyHtvXB$SmFYBRSj%afN!lp-vj}61Au`8@Pgx_UjwK?fcXzb zMt|Ua4nU%GW&k?ns3q8CM<|uk0BUCvQ;aai;POB>FyN+Tn@}a^AQ84ew#b#?{vMD+ z$sZwz|NDFl018t`5vM(W^q;`1otO|#YQcNQb>uG1Q%3THkHoQZppE!9M zslp{*gu6TyF(0Gan_(CFTqoK#;L9`vh5O3}=kEV$qxj`h`>$U++uKWOFgat3p9UdM zcHiIi89X}QhJqfhFMs!JGDYy4Mku4+{Qf?6p;1abnTq+|a^+95@9kGg%p&+_0`l0sUt<=2f!cs5Ywg1mmbjomYl!qp5~t*j}7 znbCday{tWy3qKs(7}BWWI6F4VJPLFQJ4!!_x@?Uy%GpH9VO?GkzQgR@9Q+(NJqUXX zdoXFrPpk~J43>^!;^m1UJ{mDqacdZW6@6=pgiwMu#dI$IT(bD33ol~C1U1_E zY)qUgGqW-wRVr2BD&@m&;o75eXj!*nr{R4Bp6sw1s|l;JUGfAPbXVt>&T2VUIhm%U z_+>43rBmt4FP#d0y{_fQ*#$jj;RPCQ&Kj+_#$TWv|O5G$b^J$H&Ht#usvg@+A2d`FHbn^A_{gTg{F9jW}DrwzS!(Hf$S} z86LNExkej_8J0ryj7%GqYM?dD3!OEc<%H$!T4`EU1q*fq-%eXbS}Iy8zwIo&fY-LT zw1imLS(4ke4%QAFr*)@=bcB3-ltjmk{e@RWV?-0`)#OPct}nipJCT1Z9Wr>4xzA$< znIxE864+`X9(@gSfa>JUD%+9UwR=UK$0f$AM~-r5Npa`B99sR+y{+bb>0!DNICBZj zYs~w8^c7xrEPU*69J}&)Oz`vT0z(0>sevEzzrj1x(%7Ffc%9a(L*K~1iLh(lW#qBq zNinEd{MK6PS9xu5LN0YB<@tF_Y6~Q?#=mCxZcL=F^+)UIn*q0ichT$eVT{k#&w5v^d=6s^Qm>?1#d3SyI{L$ePHV{u+AwAAdj9&|mLn zPozvZ;6-bP?k!BATl}#|90jgE~rh>=cmkAqN6^JNM7O|Qs%tt;FqWGbxX+3~#* ztK(7=VwbAqb_6YpbO?4x4{_TXj?F`$5LIV&YB6s1T47h`p7n>L^Vm)3CiYekc{a}v zQ}=)`6W=eQ%gHLZi8#eGWi;ZnMAQGt60m--IqVGf-sV${3>IPgikU!nkj$#cUj{rE<7AYD>jQ)#iP+LL^ zyUYBWsw0D}+R$#6KuxCzv;Lov{mn>DhuC^pJJBJBD~m^_Zy-E|>&+H-G0>M%r11&0 zByjR9(y%4A75|-=v2H(mb5_!uDym@Z)|0j~w)=n9xC)H%GApzGWZ}8u{#tIrUDt0q zy1Y_^^JI;)!8@Z`2O{_cOyPb3pcyG)oJ}2%4cZKH>%`x=9C#mqp3-LD z40q;t=GL~GIJF-Kb~gvvUhlsw5SduL=ngm~dtR6?5R+W(J`Z%e9=yI>CtD5mWPO|% z?fm7(dR)`>rt95>%#rLb`PJBYY2&ArrIVE~$3DNp^XV1k>le{clTRs^$@ubU$vMfR zF}N{@1)@@7Vw=*QkNXeh@{`t+ECu9GMNgx(x zSP5{!5xhxfrSeu200Nm21R4bZw+IFe-vuzb)xMkxPGrbICFnh&qcDg241*gJnjhv?f z$4y2aaQ#IJzR|~AGEH7TBF1)X!Mzs!lGyYaV>F|d?zj8%jp?DUvR7ADC;lF-ay?Fq z*KHU4oj6{b=-L(dd^`4c3=6fFLYQA0y&#z9yWZedhx_zzOfQtW87+aeY~pChQsdVFL?KxD0mq97106X%Hq4dpz8D1V2Asiy8mPS8#5HpFW&VTESaf zs&y$0Js$6Ty#4%&dwau96;1T?(CQWwQ&Ur$9F&!m+;7ip9xfN(#VHk6Z)b|#-rlxd zuLW7O!oh}y@n>geO^f-W9?0)PZ<+t>?vg9Re0+TTZ+Ei5+S)RjUVp|Y^Faap3-$IIQbU5^`G59)G?(Tr}M0<=;Hp8U18K32${9P9Wt- zop4$DhQ!Fos7=Cr6rwQ>B~T=MDdIXu^L#!jy>Wi~Z&LdC8<7P?2R?TeHg}e~-|^zR zu)!2Y<+#Nocq_i5qGG$TW#?+rLRjfO_HqZEI)8z)&5=jd-yyhu8Nx(p`Opcb}-xqH+oS%A(cLnCg` zG8+n2ba1FR&gUFOys4Y@o%GyuNA?$9NgYT8foPYGd~bq#N}RgP>S}{GPes=Pc4-D4 zc=G{WUETMloxb}?=u!REXw?Y{B#N6MogEzwJtzH9=<&k?8@$0%uhi7lH%|TI92ipK zSS)1;;uvsa2Xf=!aJU!yw!7#DcTtT8>2``ZI2z)#GIZf8OvrVM*oK+?=OE+=KwLs% zdTk94Ow#;-8h(823XMxlNciTps}+oJ>91QDB9IwlW_zCQ4)e|2EiEJcLF9)+=UrdS zDH5HciP6|c`4JX$baXWFkei%5It40=i7*yh+sFv36^`2quc0JSO^u5wZ*4X3t8Qu{nV+A} z=_E!&LxaV^@TDIZ#V9f8R?Cw@h zswsB_aVaCN!$WAVMXo<6>2uiAfARH3+|1ZGabsg+Od)tZJ*6m0B7aeJ9sW zWWP?XgwLGTBgcsa#+sv4c(saas`16GvgV`ZU-HWvPRL8w!9Z|eW8Y< zZ6t_j0Zp>Dnn- zexo8Ibv<6e5i49=Tyt8Wie^N>av@TM`}rTua|Ra8&y8osuZ_Ga?*`);b^@eSOUB2? zRTpNQ%ae8kK)2gzFmFjo$y@?^v{&&84J|Y6bQs7huB{tE>1dB5VFAU$o;6mRH+6P>6|% zRks%R5%2)F5H=H_359k zcunrFy-Q_MNkvWCnwptG?p(!7+WLL!kFYFQ>NAVAYHCxPbESyO*E$4-V8`^1UTdEbnhd%&H7`7lNO2n9S#wD{AC71?HdsJ>8!;g&?b@dS4Tw z(pRL-udF!Vn8nu=ue!2g6>M+4h?1Q>$y@GMj}}JN#H~-^{&vTqXXK(m;%oWm{xOuR zm?%UfcV6S~9G8Buu8XaM^jn3P7^;taL~5379ANMGTO}g!!5)hXQ<`@{x;~ghee1O3 z7S@!^`<0=`V=HFOdEMfO{AvGT6Be0nL)pOT6#dor--qDM(v=Eg)Clnlmp_uk(JZ6< z_54*C(#?(8TCkD_ylA=1p0Lo+p4XaG9mHYJkFCcL50CoNusId$icIxpmJN4`gre{* zQ9%(AMiMM=4csz$t^!)+%+6iGuq)?yNP-pZEx&?Drm0MXTuzl$!{;FXf>_Q`SY|RA z_b6E^t4to3D(UImTzc(LMtVBLadoaA>FxNR0JB7buc4-n5g3u?H(_K!GO{0I*OCx< zuP9FSIHHJcZ-0M!ToF85s{ai(qNDGzXzI70G`&z!*g;$(i!1Q1#um#3!-xP?b0w9D zS*Wt<9Tg?myWg! zEQa-(dBTPT?SfyJJ1{D8>ev!8Jp{ub;B;n5D4)ToQbz%k@C>K8kZGk;Nr!ty#(*QC zfvzrrv6zv01p8)63gK$~^0LvuEJHeq)E|}N8NGw9{?>Qp2sDT{X{g~=^N0`*Tk;i!LB&&5UiM+4BE#;> z4*glM7VSmv^%a=`0%=;I+%t1g(zK?3sv#kdMTSss&5Y^x9bR=#0*pO{xtW<%CZkk| zsrh+DA)I|qJI4a59lnuuRL^OxI=51<{o(>}hwjwz^!i!PYF(DgC1QeV<5X;**KWqifOYQre`SiJqDcU}I3 zuY&&}C7SYae(C6-LdTh$9o4N;n?HtVM1 z>G~IWe1o93z`(#6GdIW6^tCm!O)TkT&>4pB-=%)Fh!i2};f>NPGX}gybY!FhK$)Q| zvpzR3Z(wha?YQ?jbd^>8^74|6n_IZsl`QH@gTpLK*VVEUq}eg!c;(+eUa9-P0*LAk zVYCFY^YfW%XOJH{e_v&C8M`B>YP8&mKa&-)f2lW2+GFi*ZjMCiZjW(nVj{OA%Ym@! zseaXU`0n!1XID*4?VHmg_mZ=)Z3d<8&(YD-%|xEf)8SXFwH}fZ64;+7?S6jbrGZX~ zO$P)ZkWt8lEg&$EYB-5zV1Kq;bCG4}ELjS4^E=Ak*}0@FUa45rb6aId9o4SeE|x99 z-pPqk%S_AK+FAkL`S)PH3c(Q3MQj=?qv;6=SR^DQ=JS<$Z0ziEdU~V>2M05u)BNJ% z2?MeCc0yO5W{*`7zy#x{>q3ql=vPZl5h~Y$%K7>EDH&5kSS)|9TTBhp2H_wIs=HCu zn0d)neG;u?!g}aESNT1prTFXYKCD182(pr$l4&oP;MV&{hS=Y*9h&KySe4LTUr%V< z;>>3f7Q z6)7p{Qmfm$8U8}*;r<;@3v=`Ejt2j-f1u>nwLlIBgVFga14I+@UhYfvZa<6X#U9vs z>03YV$8p;zgz6&e!2{_*RT92JLPBhuoO3ihoSX`pnjdW@9UL7QYR%r6m^kmJYq!ER zANc!STZymde+*%X2nuFjWqqs`BCc1YIBK8=H?}^P*tZ6vovSb;f!5%rg zFUaN3vPsQ*7F6?4vi{?Q`A964ODVLDbRCQT)wM85J@`xV$B%|r)Wv8Q{EwCk7{&9i zY9IySEt$Mq&tTZVz<`1iNLV-qp`g)KenbRPkx-BSX_3w69^kolLe;ot4GYPv&AtC3 zgkSak-9~2g5*9W#*wnPa0~8%aFF2c?gtHSf#8P_Jh%mi0|bJ@A-KCc1or^JAy{w=kRXAe zcfY^xz4cdZ@APbKP0hUB)AJ1cm4*^779|z{0Ju@=owK|1dplG_?TPD%!eWsv*N;Q%jg%TGR6icGTjuVZw zguX+c9~W8>6+L#h=~wV>q4Rog;<0H_a=-E-t6>Vg2LmTnnNLd~2&YVz_Suin;enye z9Zu3T@}9-U0D9Cjd$_41pYV@lGhQPFg(3C0 zCkU%z1Q7$$zHzd}fV3h~P*ysV4v>oqn2%doZUe740CVOKd$T}L)=h>V5@3={PlA-2 z0MHTHM9BkoVnF4TezXE$$PEzNst$+%OB?_<)WB95sBHmyCJC_X0Sp{~TPrI3C4lM& zn2#_pcmrV>0I}k^f%tE>YJz=MP^pZ1@ivHvLa+%2hby{)0VgfXB$SMeSkMC50wK-W z=aWIf8_bXY}q2 z?mb)A0C3*n+&jmDff8gFx;f?bbSCwnl*)ktb?fC%wJZ9$g)IC)Y7n;bInQ9@b_rhMI^c4 zarWu8;z_vR-&$Z~_p)>bW1`B8U=Uf*e~&`4j5cJ5!ywBDzoG9{MkS1a(2YhBYrRlS z5K!jPj@G5qQ>HnWa6=Y}e684?AT|QL=YSlYZ@__@bEsdoPM94t$!fgrMI}zf5M`}? zB}xbU%4(|43zaZfp$AhC)k~Jnf>uV^P|Z+dNx77c8p8kVJEjmON|;t3^NXZX)kdcF zXMYFCEqQq&4VBp$76{{sxCs2B1au?a$UyXf@Kl z8O)3yDjlR9pj>+4;6{*y4oAUQC^E^>$zc>;*d&b7kcBm@nvQ@0o96nd^+1@m~*KWdgWQKj&-PX zU}a*Zk>#*bXI-hnK%)mZno+-6zouNFR&L#!?am=OY%7WeZ+7~3xD^o|!2$zJbrZ|} zo~#||4>TPy66IxiB655xd)t3v6xOR)N+B&)bfp~L7d7*A$ch50qJ5-fi5pR9eIWu3JWtP)an z3DK)+&hmFfRCyipUfoV5r|H>W%!0DjoJ-byy7q6W1GpY^9~^H>u9R>L(Hd|dXe&6A zb8=m+&kw3AJA&@D-v&g%jxu3b1xzS>7>}|~6T-w}f1FhdN zE;c%C?sN(_7BMO^)H611P^`+TVqEB`>L__u(x#E5QIWj>>#zOYJlb5=LQ%WBgtk)M z?ARP&0kb57wG3AGpC)xB1+)ize2_rLjaDittznR>_t zGn^urTH@PoCK`V^@HR^)b5;pP25WmCdJz=^R}C5GOq1lyq#9Zq>Dp0ozj8I*^qslN z%52E&J1JeMITbv8dm6c#^OZm6WwsID`)~atazC_or=_rSQn=r3R0e9wX$HfZ_8GXW zxDpJi7HeCIyvnaF&d4PHNV?^0OKyt`t@ExMz48~OREivD^( zeKKM4EnfJmz=MTv=oWhxG5vu!%;AyY1`$$mE>VV*(>!ScUel{`?>FRce~C-P#9!}95)>4UxCniianT9SLs zN~>|M%&P92_%oqXzy~tOSH!;C7RFrmsZ$MCZ7owYn-t+m=g2D|+Qk!^nDEI}wwzu) zsTp?$fo=B$d`u*@ zBAadE1{%KcZ{uvwHqFAyt;T|s%gk&w9#a78<9mNNdk|q zCSD;+Bl)nzvg*A{73n{@1-4@)yy53x9<$E8IB*4V^*(+c+G22#_t`nT#@x83#TEVT8S7WMi9Y+>lLkh^ zWiN|3M<{0MAnr^oP1-fTN=`2vt^3|9tvtv7%r9=_qjI4;`u6)_$ZQhqd@438B`YA1 z^Y5zpN`AB7zSZQ0J-+iZR_w)LdT_S^414NDJ8^{e%x8;8taV-ZI$sZ7Uu}@C1-dam zOpbRfdoiC@b!v9Lxs*PUS(aOioR>0rTwOX_{b1kYm3uM0s&tJO9y;}ya21a)_fLFA z{CEUz#BsK;q=?9tl-tAMeTm$Z^%PS!*<=3Wcr_U*SK!V3@#5rk`gC5}d0JApqkqxE zQO_|&&B{>U5bc*yZ$2KgOZ~f(UawUznzMope9awyx(_T*c7N-xbiS3`B~c_LJ)xqc zU))>qajby6NoS?3tquUbj39xA0>EF8L4ytfz=InAj?4i-G#voQoD<&+DgppL9aLUM z*ZccVQ&Y9q3RHnX+UBMlZ0OP7W=Y?!X(OMI7A9DwkPF&pR_e<>z^7a71)e3XFRdT$ z7crT&!K0JexTFiv<_c{Whn9X8GtQw{a+s*T^eg1J?9padZIS-n_c>`zf)Dnj@%Oc; zX1&n+Js4~+!)x6KwwJ{YjGLQ}m|Hh6nVUmw|KI-0{r5BYj96E;t^JceVM|O#R!~`q zW7|MM8WY}h%Q`$WL&#~`9@f?-qNbs-HB+RTp=6o8Z_%*)%GC5@eLe3&g_p2w9>L@N zg(eOzu7$Zdu<5e&?Y_bM$1hHG( zF#R8{77dM!jVTBh=jMK-7?{a8IdKY1X7IsW&UZ!|70LULq@hsEKR=g4*E+lka&vT^$nv;d++xr^IBTStgNgmugUodZ!=)oy$tc<`C{)r z-2WanG&F3LfN-+0_27h^ZlAPl3`tzC7W^f}K>c-ClEZsA{)vE;l$4vFKWuaqny-~xScuxz)<#ZC zD;PJhyu9oU4qRu^k5+!u9rz%6OcPP)0&1b07-rhxNzcZ{cC-S@5DK0Qv8TSkfYW{yI&U97Z$IyU2mbDQd7x$4PG;tfu7 z7>bT>&;E>$kMH2%pr`5Gq9GU0tG3yh8DuaB9>)uLpf-4sC`Lv`tuC7(l+Kox$cxpc za_Z{py0;-A$n0EP+pBHw4>^ARIbDlk&hghKI(2LNaeb##PCa$OouP*KRaRCORvd4A zfg3LS34%#I+-uwLY&JT-G?fDbS>SoiA~qmjmWTsp+1~!XmacB$UnVG_Y~HIOqMNSk z_0Yv*z2kzpO$Wi;9U&FD#(R5X}8S4LUt_!i8U)pVz{s zXzy>fe^web}n(jkk?fjT*qk#YNN-F>4eCn1|YmZVKa34gwx!g{}RZ4;meb(Q)!K zVpaNVDee;!6Gtpedb%~@3iw6PUF9q`0*qIBao)bw+WO)HomcT2rM8~%&Sm`nbnZxv-EBM?%8ya$D{^>2bM?le3tySwv6^D=804) zAt!lHPeG@(_7q__ba+3ulT9I0gQQD1u~2+UDWMTuoQg41d+D|ht)|2kF^`$1X1ofj z@i01aaB`8mXzj8??aE2}Rk96*WDY)e= z2Ajx7>nk_SU0q$>AYYEFJNPZ$zkeTbtO2Q)7c91{)}rjOZ?abt_Jx>1Jwo>Xw*IjK zGfh-N9me#`Fu`-|CxKD%`E$wpUveJmbkX@t&od`Tn?~#%9OkMFc7EFNW<-TCAGU%T zZQc%X{<4%=2`NS_DPzWdDN>>Om@p9M;NP-RC8%3?s+fdGh-pu$k7u1_KT)b5`Ic*F zbs0tYb}SlVYTc2bOx)1{T^WT0Fb}5KEWh#-KNROVAw)|Vh>3|YuIn0FqI&#&xiu1( z48crMBQ+nv>&v@O+-ZsB%ZU5WaC1$vzIs`tjq(Uw{2|51VJiJjS+IQ-W0~M-J&c zJ+q(?Wtjg3M*RTvKymjQ5C`imH1>sAt51wXkbz4TtXuC@g8GY z4Y*!Ia3gZC%0*?q&nfRL*w^Pe%77IsWi_8gQM~{wPb6-3joVON(2@aFvC^s1fp#!) zX8+=u9zo`WVxtN|iyGp0wyt3A&C3@sEgp-4Vang;yA30^9pr8Ozdvs*K_U=~E znB@gj$v0|h}+PR=Ab_*eqpGYFZy;F1P?8AfTlg*?hl3J z#37W%m|>7|!GH=bmq(!09k&K8bo}8hPHXw)H)(dl!2HVO7gK#qU|_t!SBcg=-ZGIo zXKrDkI(-fUg!=w{VaTN?xxJMo(zp$InBrlzKmsVU7RXHt~V zkSddwt*ga1!?#z*0vn2oioXWQ-kAINERz$W^ju!@Ppe}8s_8#DS!vn+n!y+Ge9_u4 ztF)?Wus0MPzP|vowf!~9oMRpsD4Ewu$W)jA90WXv^-iOUs@hrt5EWQhSj@FEf};}? z2|F)mRK2(0%u$ln`}_Og$xNutK-jEdmwfQkp|P>?KvX3=D{HXMYWUm6M$RugOT&kS z$jIk`faSy#+*Gt+*w%A-`d<&j*W{ecTO|y@+G;rxByRz1izI0 z#ztZgrVP6SCC<;!UukItgNV>7WIQx9^lg1TduCnExQ5wrx&EJ;FSo2;ZTXHRB9dK? z=3asr%6v5tYym-gTtf>0f$#T0LHtn47!FR|yUMdKcX%KKDjEMJ|C3)jXxaNE;4XbF zot`tKmoD&T6aBNO$JnQPoB&b-`u70=63xyV)yKY3o0EM%f3inJMEpy7o12@->lG$E zgi3u5f>tZdjz4^8K@?-*;o(7{m$TArm6nqee}3*ZFY=jvoc#H7W;0=RbnvF2r>A#h z6_5zo{JGqao}De&__?o7mY<)$R8lx1GIDxxF_O)on%p?<98YP72;Zq?g&W2Vj_J~| zR%^)qpOB@bq);#r2v ze(>Ys`g)wuy7%^^=~7Bs8c~j-VS_F1*!VauTSFv#hzon}wu>itGX3>f2e5?dNQ5cHjJtMT|aCtFm#Q zmvMIuzuA(&Ny12^z#xrbwCJl*Av`|pQY<3`+^@_SOwkYi(}|YU41MNB$TxlT>jOjG zdcjAKuGwY|iHL|IQVRA=nYmp8>;rvoAdC0?Kq+-l)M6(>gPwU1`#y zkus^6S&*#o+Qz2HeheEGnVf=xr}Ojuz5mapI+RR7M{Rh~{*8zpOHC1LyC*N#C#G^T z=JUSUU=;LU^9FBhV)<>U0I#JpuriJFt7&R-wKO-|8fO`nti!wa_V#u`WaW+S%nA6j zTt8?z+S*<#=85BAG2GLm{PjQfzs-MjKTY4jfV{5)w~>%uA@E)eKovCPt7XkY{s-1Z BwnzW~ literal 0 HcmV?d00001 diff --git a/data/images/wait_05.png b/data/images/wait_05.png new file mode 100644 index 0000000000000000000000000000000000000000..a18788a92ffe132cc02f1d13c7ad0950846fd9b1 GIT binary patch literal 6748 zcmYj#1yEJ*^Zr4QMmi*v?(VKjrx&24`OTBN&?y2u4Yx5yX5>d40hlcX@S(_s;)Mbi~5k%D^(6&2B_hV!FQ6BC2uNx_`BvDk|k z+jL(N!wREgzu#>H6gtm$T>Tz@Y+R7utvt_dn8fJ8#LZ9<01E}&{1rBY7~I(A zmJPvXbO#798*J!29~e-8>mW%<4*DL9E&#=M1_u-9(ah=LrH*>S-G4Vt zRmTh_0c8CX<%8Kc zme@900dSB2Dkt@06#*zOKw_tk5Cayu0A5uCI~Aa|8R(fHz^Ml?aRFX%bOalK764cb zGcfo9;n@I*(wTweDMvNIE<4gw+4YjGjADu*#+Y0l7zPI1uUIEk$vH@bEuUG!WV!qN zvS0Ft2;%=b9|M5=6jG$M=MTOUFRCXdgcF-ym~-uSqd(DGS#3S;Ojfwd0>Fk>(9|O* zPXlGJ1bVQ`;}@o5GzT-B{P$OJcJ=tOjX?h1vcb9gf4)&HNN!zP+S%S-R71!cTYfkA z@Mzy>-ed6a_9jU3{_65q*Ct~KziEgv+V!u#u?vkN>d92BaI4kdNy_)lI8XO9GxP{m zt5zsG$rhN%BT)esf6iY-A0wa2Ho!FfWV5->d50>!E(Fv%Nuva$aFv=`qyAH8A%J@I zY+eDtS-V^BEGs5zutV6!q|eid%!6`16A)~tn(6@nW(thldfyvlhA;s@AwPt@R*veT zmx8kgox1n=YA?>cg>bk$Bce~9KpxvBnEIUsTV<#`Yvgz>4Z8);tSpUS57;3x&HV*; zAEf1llso>dB__O=wIc)zO>P*I*phBJ8pSFW%8-ajo*i*b*Qdof?7*OD8rS$;QX-h;)5lT z<>&l(_l;62UbtZQM}-6aa*{M?h_~kt1%?3PEidmN1%+Jgwy`ITfe|RBKVCl$M%NkZ>7G1Pe7B+{Z$nR;vDuxsC7! zL1D$u7X?+}WSA#PBIY3ohz21<7>Qy){4A}>&s6Ka>P-_(D^0uVFzj)b?BU4o`s``>XL+L>7aOGI@$E%HSE&Y{N<`0AE z(LLoqnSW3(d~oq1NyCPs?O9*uP+(Blzx1J~$Q0tppL!-73SH&8UEs=e{}6rP8%8 zlPHZUw=Z?mlldBC_z;6`*ssyA4f+bsuQT837^KCqe%av5N#~4L5&1qu2*F%8z7*)q z-k$Y9(;g>PUREFm5>OK`XwW(TWG92MmF02$*-Hy+m$fAGJSg@j$qCyg8&$EOMk}AK ziF0{IW(KrEr2<@`e9$ReeN>WL+^N`Zco*_QZb*&AghkmtY2tbAuI`fVS_yUunWmKZ zWi@xXa}iZRyMj-*YsqmIyvr;YuHjbl)30;)mihzFgWiM7ZONrFE)=~1ml1shcY;E4 zK*+;Ql7?q!@h$N0=IrJyOAcK_Nz_4N6tHRZR2kRqZ8&C9PU%S{3kl`~KR~rje$y=9jfQi|8xWO)gCz zEbXnx?VAUx`;XH)(>}C)NO+LKz>8XXQ9)xw6Xf~r9f`QU_)plx=VO@<0~Z;4JoeB@ zg2_dJttR48HiToYZqAIdJ-L0WXV`gkT#S0?D0ikbcMjFy+HmK#n%AX=>4yLGWo}MG zPTx`KO3ktGvEy;nYTlS&9vj?H!1G7{Fz6R}XG#VqFP+zUy)sA}q#a`4xXZv}&68qK zwNTq!8?Z5h^Bf0qeRyk6+q|mC+o!%-shvCEID!QxPtcjEf z#}^TAg8t0^z_9#n8P^|#%MuY4VGt>k=pGHFoZ`zA@|ju%d9EwmDr6}9%(3Uw7OUY> z6JnPx=XR1@7HJb~lNsc;GaQ?P=0a89s#A+`vsVkdzU^ASKRS=v%-zJ<3Lwwo88&tI zE12lJh$tZ|<0j%1&ydxK))M{nSB`+alq{a^)RJF$d7SAponv)HJqg^xkCd_V=YGWv1@8kyI6 zqp^nXE6F0CPx79Qi28^&Qk#k*)eX34puamSoy6)TJ^WU%w@9CJMCzkgO18u{vAfJ^ zR~#8+RtI%5`)fLfnDu@S?QKMHKEQ!s??ik!SY0?W)rRsIt~XlVM&?pUlg7kWldOJ=LcdI9SJiXRvxp3_|bxak|@lWt@ZpFCc z>Op#>YXyP=(VVlJv%OQjYq*lBjw#=}&bV_itJ*JJL94;P*=9wg!O;3k8+g5UPu71sLID?IUK@A!bq4UC!B-Zb_!JWlek zGni72F6_?O%D7E?OnPd5|EK@G^2%%c&w`SMero4>BaX{^p)+arXOr={>A4?*xNlZ1 zR=zX^>{?H(JK?*Xv=Ml1Oe;Rc?Mie=OqiUtc%9X+><}BY7{F@8&0Y4r_9Y+FX0(Ue zKexlGTTPr>kNrCv1MIH$sNfgk+#$0C0okpuu|p@SYa{_ALNFJPQEG-BQg5lmGxfN>xEl&v*II z)KtSnkt*n#qqh1}dIbH&H$|i7PqOXL9c`+J`juSL=G01M_$Upkn60L%RwN!eW)U1B z;FNbe&mCriVY7$J6gg|(!u@3{ZJpU{lYYqKb1E*{;&^q({r-G-oGo_e6Z?Eu^`G6u z{o$D8`GmyDSVtNPEiQVbP`t)G8g4uS_kZ$#rvGjIw{(8FPLu1} zcmEhVx^Q{A&*JZ~WuERmms7>Khz`8OJO1|JEH>EVACN|V;+2s}IzD#A#l@|Zj^SWu zw`g7gL!lHR$AA8?R-1Lketf*a2D{$ z2AzY0qXM)EgHd+e?pF+tj1&xteSDOh_$-z-k7*5k&C15s`}lBI=e91ry}PTsg@=z{ zSXjv5cuDU_v@kpS3u&RU9rF?*@N`r0;@>~3w{PPwUxmrb%iJ9{_+CsYL+p>VrEk#G z)zy6>5w^CrqW%}G9)dAnqTRY5$Uq=aWi!QQbrIa}_e;t9zx}g@_i;R3D$vH^XMejD z==U%EJCK;Mva-GjJiiINK5UrGy0BHjM4tAaTW4oUrdZ$T=!Aa$OpS|=@2tEzHm1>W zId8n!;U@sOpPZa*_-UzvZBSztL5sQA?!&{+&;O-M>TeG!1r1FEYpln)>Yu~#0ju7B zM=PWoTU%T1qSP&Z=gbF$=#a}^8-C=)*7a~Y^jg$o6OC^Tsaf>u>gokkomNSI3WG99 zM)cB>p_iA}ufYVW%1nyVRYyn1kTusK>A`sW_mZ=6^iOsj$$9NBIJEfIaLvB`+dHr#k zkiZA$tuU1dH+i7+>qBn|G&x|%!@bqy&*7nhu`v}VS==fd__4NDMeBil>A#cpq`aV8 zHlbYKNw}1P=d#cGhfMwFB_$;>8+$4uiCcPD{k3g6qN(|zv^^W{`4tuF$JWg&RRlIT zI5^kHcq6@;((u4aX(=d>BlNz#*!zb6_J;7Tq9Q-3=0XP16; zc6H5A<}3T+w4>_Js>!arZz7$SRQ?Vz<5^U{NoQtuKzMU=<1U_C?jc`55OjAWa=6wm z!rsx=M#;dyFp_fJi}70TEmu-Pf~Av_S{k-rr`aZbTrnAxlg!UjiJniB2;&)w-y4+~ zBgy2ia$mv(Qtp|cRrBvv^^tyWU*n!EpP89K9$&BEEuLEo<^1Ib&+4kF(U!AHl}%8$ znjRc1QqL5uD5b?zAeyUP;WUzrVi? z{SWbSCL0C$s!p(cYc~ z=-Ko7QdNbgUjfnLh^6-r2sr(>;?}=)`UcXzvtz5Ft*u-ZZD?r7OM$CU2&5wzY0~T< zD(}A+(CPCen*K24%wXj&<3eXRPw`H4;MgAq=T*}{IV7L%&tq@TCGp|AmV%U1tE;%V zS{Q{>m^tI<4NJID{dC0HyM9aDR2)n6ce1Hxf)MTugoMvAquRzW%C@_xMIF?l(a5rS zW#?&TZjN-piZS*}XxPBO01{t#z%e+Si<8r#S|VkbXeleTRmllR8~Mt+QJUf_G>4VA zwYi++2WQ#85X{Y1uuxrAZ2;M1Pk+4rQ<$_Zgfe*^8#rd?IZIzrR|jr1OKB+7Dq$dk zf8A{8@|0B zp$CQ8B!C&zzOr$odZipG(Sr|NE9`XPQRWbzNu5_5%KWwa13}iHHqAB zArYiu!+eG&mn;D``c<}vaP|Y+3+I#>ugA;^q&kGs5@0k4UR#sLovLU!xg`x1IzBYi z*As1iEf=qAX(`1V9UYyyNGea^)PJWsjX1cJCsCwGP!bdt?n5G0wBmF!s~T6KhtBOt zTN1XoG_rNd+SH=SOzaD1QJaTClD0(MsWIdTq6J=$n`E%7z<{G~jOmDmhK5)|11Pk# z%qvY8Lxmw{OLR$|cJF;1jg@c?$1r|2Q!i-Y8f zU{_I?G-vE4OnM@#+J>QsB_+WtRx6ggf>M>;~si9(9}HQ@PV|*5qCzUc>&-+2_wtM5z;5>G!#qCW zG}E|==QN{-WEtJwXkA=;V^?V$lc~LZ$y-(4Y>oPHeJ9ksNeuWd@qD3UlO+)w)AZ0F zi=o8yKmjN!nygm0M60YgE&%Lx{(D?B=)Q&i{(Cyd_4QU#_ED@HF*22J{+TL_{oC6s zhpfn@#R&&KnYFQ*5Qr7Qk`==m^#2~}T**PUM zGqZM`6CE8(!uzm?%B>?rGe?-MD2zM;{w(v+ z?0gG`dq9lDNc7z{=IQF~;UTB=!-XzdSa0~5S{5QTsB&hn)@4O_pt-M4UQkGgPDUnA z)fSyyO-=3Z*(lG}2umL0ZOaSvFeF*QDkH=)W+74YvST(fGSZ`Anj9bB*d9syb8@2X zE67**@t~g}Niy{I*58S`dp(JmMT_x>UUWx9f|Cr#$k;e0DwBavT%5hz)cfJ~JzAJt z^q1k`PA#yJQ7n>Cy)!N!xiln5PnwqOrTuAF3+}yMsPw1)^(wf}X6Bo<^@ccXB zm#;wIMFakEwzapX`ESY!5TQ0V%jNlQVoCm6wDu_CM+F^H9^9RD59NJ)%+{BNb+S6~ zQn>&9C1)pM7mb6|>-EQbLi+bgSUH%nL77f71;AKm-= z*In&ou8J~-p!|OZ8hl+{{oU5y=DAla&Y^;U3IY<3@nw7fIi3ue+xsbpIMhaXjSJ%XS zYhlRt&Q3u`hl#g5ODz51&`=Dy@l1$WjWPt1e$Sdui`nA7@yyQ7PLQjlww3@753jx^ zX=B6k;_`B1xzQPx!O(d{c=IWIW^Wd;r(tSJ^I3}psgh9Q`iZiwZ4ookO=7Zde+Tq&t4l2Wc9DQI==`@P zl4|3_@W!U6b*QBSp&Mg?9v*~8M@I@nyJfQe3k?7A{b>n$FkS~HH*IA|@4}m!9 zYk@$hQ&b<#%;3e!CRO?zr^OM-Lf1u{T1lc6-jmu@$z1gWA*#rIGjnzUTTTP^q{#_5 zS{>d5=!zRAQ$y8%oT>6RD%)*J$r9s_;64lMP3GM&$VE6UXb_z;B(u(5m{sXv0p^Pq`Y}^z!WC+_gZttIQPF8S zhk;=GchuE?!fNMTdE8h$=3SrNUyUG4-yfj4ugF9oX>r~=Z1gZ#PUlxe6GuljVb@hw zb^EGu@HBmOeZ7wG&P||ne0;ovnU`D_>5yJZr8}f!VFBq_q$Q-0B^OW-kY^E>Y!bI&<*=6TM{HTPWexnuQo)JO>F2>}2g(NI@5!1T44W{i)EiD6ED_n3~r zQ{B`X0EnpmYgj;54jljx>b_P|($jPD@bU0=^6+HQP*P&?^zv|g?dkvk{__Y!sFC3= zjm*W;siG!4?31R4!6SSY1I73->Le~+Rs!;uaMt{}NBX@KDk?Y(-}2zt2?=5EAL;WG z#}UrrZLk(3L=?i~eq65x6}n7!Tx^ZqHO|OxSDYZ~k$64$#A)iH`r={4rHW4|Rw9N6 zhE_KO}=NoJpsU)``y+g5QezS48j7;Ke0Z- z%1Z)Rs2t$RfRhwZfi#X&0U*KvwWH?13t(0N5Y{kpR0nFBfu3=4qB;Pd7!cNnM?D2_ zf&lAp?CkzPWF|nZdTb(n#8*YW&5Kbgvrf8|uKlI9U?q`Ci03){)6K0(rahCMTZ%X`_<=v2|{4b7N!n<$$8O z%@321J7}L(kIAj;zfkF$i?fxkH4d1F1xyX+a;0zdRI7*)nM@FAyRen0cGFCBf5SA% zHlShK3gM+**Qb1wpq%yoM5KrV&;OF-8bifF36u#k8*|5&Tv25cY>w6(V12M%EHJYMlnzDi~u`QzmJ2(C2njDs>(Nrb!g;{%P_FGjy8f2sa*H(=l8FU=NH zr)N+3K5y?*hxg(WKMUWts13wM|Ay!W!v^cIIU&MU{>_(5!!;g*AI>iyZ<23{ZQ?p) zh$w&yvkVr$<{MFnCz>f%<~JEs>&JYh67$V^F&06ip;=T}kUB~4MC)|%x_ZZ_jbbtN ziB9@YlV2mdYCGvW*r$HPB+-u|hT%}2$JumvbkN6sbk!MJ#g8ZB9}gP|KLhP&Y-f^X zdVnFkO}xR6l70}TzD(sxW#APuDlIE6TPh<0pMXb<5=$)&L#kB4qK50G1i#bD!DR@& zeM1IAXsOiKm@?>B4+!FQS)3v7z z#bR2mAct2jWohYYkaG2M{c^SaPKhdX38J`DrQP%zMyfFUlKU068Z>eIA!6Hb&Tz4W zu!KfiM)Ismu*{{1A-`SOuiL%kAS1WSGAviiqhu+dbNh-hMCjJ&*6pg~OpO?VTTje^ ziy|JUlO7a*;~~u?G>kgZSF-4rS1PhewMk!%OlqBwE}T;Rpi1`s_0X$zj&-*ox1mBV zTrO5FP3=AHgDeB>*5aqdQd&}4!(*dk1!L2h;@L8w8IkSm?d+NC483uT3ou z8g(0H#ij>M9qv(PFHDOdU^9z))k;Jq=X85zdkIBJt4@kedG0i{zvigvdsAui>c7*@ev^t?aq1*XMQFb?IkIB1@)LqtAMpzcr8O_Iu=7MJ+46W52h* z54@iMO2Rm?pxCi61(^AR>&w7k*6sv3NtDBR-5grseO{}=BZb89%J9wJN>-e~m9Lc3l$Wxh zAl(<$0x!jRWy=JerRSfuiM7cM2|AjNPC*b54OdOZ7lOQ167H^D%Qxtgm^H*2(RvVV zhR`<)&w%{#zSF1@no>bZe#ta>Ex69}Pk$B2dB4)U=RBtJ<4hn7=ws@GvI$K{Ou%QA zUhzKBIacS@4ov=&)FB?gF(_KZzu6keUHY*@i$rTNTQZj>>n)3$h>T<>C?YxO;~T{? zR_&A~=pJ;-@$E>3LsZ?}pnH6?(34cW?=JNpD;}B(5H=|m?--f!%<$sXK^;sSyT@XG zyhtn0a1{nQ78Q-07ba|=pkRUF>Zx) zOI#DL+mvoO+9bUyw391P+XZIX`y;%!5zA$t2u!#c6|%oDgSOCx2$?Q7+FV5=7-S#C z##K?HXwx6Po8?*X-(-mK_|cuY@TsA+e4y1H>G;cWcWX%?*PJx1EPX4T)SYB*zJX-f zxB-23u7VOuALBu_M>Hw57IsUwbU2iJA0LyFGx}n5YIJ2Jaqw%g(Prk-ed2&2sN-Dh z&lJkM6eU=LE<#uz8dK;bJrc>&`*Fwf&}~_XK0PxQ#oK`_kv*g;t7f5{M+|I6{~oY%x{^X zOhV3zS;twb*@juy=Cd1{~4cPfz8(kXh_J3G}!ayf|B?Sq$~! zz8xQFpY!8BsO-?~usW4TE6gb^#!ShX-!04@F1&N@@yk1zSWvsbjfz0tC7mUbDLqWg zOdN?OiQdnBF8kuenw;0|?oEjj(jLi`OM6#vH&R7QBNTc$wLddHkui~fp>y*bSDfc+o z87DV(q5>!kZ?f2_8)ySSASZ@EBLLtZhC#!20l-%n0QRf_Kr#aWXg!jx230Z4x}~A4 zVB|ml2jSsrIK?pBje@A|{}yj&5N`cO2kHCu-NA6JiU;Ikq+ZrC`VK^2PDup~7mD<| z3M!ASb}d+&<+F077iY+_Hj7PazzSbl9jL$`Z6p*qmkVPZj!>6?0H zJ#+K;=xAIqaq;}7CK}S1h?gO;^))qN@w7s=?(U>1DJd=fN4EcBA=E1B$&u63#+aG< zm4e=DN6$lV&rIGYB-q;91(9&TMl{l7Co=h$JxS>qQNK^%BYsW*!$L8n6YGwQ}l!!H*7F)=6j4Z~xmy zZ7t|fd^mxrfBW;hgs7;fL5kXu&Axb{F8JP_vwM~(bbRIVXq~fB*!K0$*;zP~)LZN8 zb9Bv|>w=G+o!!pdV z;SmR+FP7gif44v0g13~G5@3E~*Te+|9}Uu4S^M~Wa*qEdl@@q&H2h{cgCneQcO)v z(J?U8>kOo(ruv^vnbf{Tn^pbm#)vaTs!yISXrU-ZKiK4k($m*Z@^$ZzCZS_yjwve( zIJ9#{NAi!%w!A4kxMY5JgY_91^X~3njB}*04|9$VcaBcU!2(k5{=HHRDX2Q=d=9E_ zXlU5R*@QyRw)<5JQi4Q9Bf7d|Uv&niI>)X!m$bJtSXR?EFNaFK5~P)WLdMI>>$%z& z<Fqw7BJ6cskBnZE5))I0EZ<&Vh$hDL+gt|A{+^lXUq2F_RAx(RfOBft#)&bK zmZ&VCQ04}lm>H4%He2^k2jy=}{`yPf<2-;Xv;7V1gsT>kt5Cq?f!o{L9W*+Me`NO< zC#<(u0ReY$cCN7-CJjCrdp7uQz`WVrA$qdw=6EDoECu;ul32?4IGn_CN0}T4Kit}> zH=x42IU%Tunl_4OJP)I31CgGU6f;E5{`CPDuFTXO&j36U`~Gb8llE-Nq3 zq=-H2x~|&La+akWIrNc4yqfU!^(`_7@fE5fCvWs}!Q-c`Y)SYto8Pv#osmD(x`G5$ zTqPK8Lc49Ul-XdIV(yPt?F)ns z0%C9KC>t?#eZ(bnb$yKmgmyD`c6MT>@4A4&gMa@DTLz)UBNbVzT>NgYe6_T-9a`aF zFxc}s<7ggWGQiKALJQ_;8d*)+r`;yqu{Ry3OqsA2K9QXtrSMQj%|NIse4GPtYZ<0BP~VFzykb4Mm8|u9(WfrfMV@4uKA5gROiS6z8eWrOvdleDD~~7cKsK4ffuv4S zN{Zwpbxvv?{kC|;RMuUXP7JZUfMqGz@zlv3{=pYE;JzO0;}9=k= zHma~_JE+#^o_1lUV(;%XLC2nNA6+M+l5XnGPq8`fe(We>x^4Oz3~m&Af;7_|4I+r( zTic(h-XA+BbXoq3+@^&Z+hhDfj9%NMK%z(VICdmJk6VM%Zx5v2lw-?K8c6=sP4X26pvHUY$uctW}NtM80{P3{xah?B; z%-8%+rlgxESgYSbe8b=y8ljl~(LD~e>!XNK#9_?$Oj$pYCl2Ehqq&K+f_yY-+&$(3 z-ya=~j=rxN#F)9M^J2qyEaMRx6%Z5a&zrUd!X%FGfA9IvBg1LPZiOg`aWmN*Tk*=u zY@M9cn`u-u(@{Mlw7RB)mCZ|KQbVYc@O_;cF7eThMl&9ajvC3o){Ln+%NeF{1n|RG zBYO?vD9mkyy+Z8Vj(JQzD5DW%SJ{&%Y0fPnhH{TbTNlc&d*VY}Pbabq-&_dna48nsNI zg{;K+2M53Mt7vST`YRs7$4;He1|?V=_1)Aey_4P#bd$E(2!fhfr#<(cq@|J_!E?z^ zpXl?ig4@;7c}Kfn94w~!d8-=7n5ehH&WgC!{H4cFtG%I=0aVXn@?inX!PrQxReEjc za>Z91U~8mMRr3jPx^10=>}wYnbFuQ2>T(guW@_WuhYzq2aLkRaQy%fc!^OpIiDv!0 zIVxaSDB@^(Zm_$v^RrX`vpR?8)#>hI6{uVkSYNQAheH)o==;yemV*eZ(Q@ng_}mV-*y#|d4z z+b^Prx-w_f;|M9}+;on#W)9NX>CWq5rD_4sx3ysZ@K9HcGDin0=~$ksz(ENs;3>X! zvUJVhe5rlfx@$U-U@%t?B@=z{_H;+TfB(3Prw#MGGd}l}_q)NowEaPcoocmweUun4 zukl!xT|AmB(Jid5M*f}exYoJ3yFMJHX%4*&{4-Y{^YSxKrnt-WO6zv+B$E{c()07D z-qOCdTds(-^ytFsc7Dv0zH>CHlm=cvfrBN~@%MpumJB(*C--v^P~!)%Nan!60M0?{ z_LD_EO*c0;NUK-TZb&`8qTOV%w*O|TNsaRq?_w*){?}7r@8-VHugRg`$U- ze*I_x^QM*2Owlx<8ICkA%=Z|E5b|EU8XYB;y; z?bUd1>&&`J)cwFo9~x4XzP~x~-$+u+2zrG?BKx;bGQHTf)VO_gd>lC2+S^H6@3ef58!g+d<-REkQ4(h0n1LA85upj5qR-gK|H(r8Vt|e z2Q-B`Bj@MM%47c8_%_-Rd9e13NqYcCRu zK`!tB_}EQ(C-CM*JvjEyEf)xy%?)ZDWB{QUfPsbPr$e{o5PAsUT#NM+8dHFs=iZtg$4 z=wJ2poW#I(Lqo$S*Q7>|IQ!75zQYUiu3Bw{YHo^6*Q(=m&kxWh)6=x}>g)LRr=j7q>3@yZ9x*y!K=)Q$weA|xrCqPLF zvWZh1SoeIcMU)#g5#xFsvJtJUMR(N}ACUK^Oo4 literal 0 HcmV?d00001 diff --git a/data/images/wait_07.png b/data/images/wait_07.png new file mode 100644 index 0000000000000000000000000000000000000000..83e060327f37779278a2d1aa7c97ba69fe446708 GIT binary patch literal 6446 zcmYM1Wmwc*)b9TX(%ndhN$xFTuSKkP=%|PoXzTfm*f5-xAZ`GF zMfBf70y4750RU6;gRHEUmaUV!lbfxRGo7-mESZ)&StOoUH@Z)j1#)zh1kP zQH=;pQgwPuf=>5VCOVKfo|&B<179VAKK~bqb}xavJPPGVUIcP%Y+wwDHV8Wka|vyS zz92TFFd}N~e$%(mexc)fZ}O>eQDVRHBD;PXtp^=DMTu9NKM=c2hK67xWO!g`bB9wZ z2$RVfz(=pQqIY{_L;`LC#KbrldeFK6B(FIvbf8B)vxl21{2A|1Cfx`rFchiBJzhu^ zJ&+iX@`;rx2BZ{_0<+VYb$~n+z--*oVjIu`17<9r_vV1W?3;97B)~9;2cTmE+}aT^HUPyJFdJcH z^a4WD0b+%7eX%o+YW#h6gi`5sVy#TV@7ufeNGzIDP=MaVgd6P<{46)ectI5 zZ-V&nHZCRrATOQ-@!E?=uPNN>sVRZjCR|hSVK?eCgN4QR)9!SIvlIYqx(CcWfw<~l z1&X2uIy@D;K0&cH!OHWvj<%`8lWGL=4wm&Vod45CKL2a$uV1@6J4-49GKS`3`u8(mvWL2rzM6j5$A`X(;bim0X&FhVU>_u>>Enz5cAsOK04lr35f z*on8b30-34GGZ>?6fs1~B(M#>o_)63S_j=DORVz)-|ZxjeB;5T#+JzcR9Wy1+Y&_+4I1prLsm^gLE>LrKK0YEMT1czz|G zw^6!udP>yi;;t`*!;KW$;zdV*H^C2K9f~|jL3P^VKd~ESTT2CBg(?(a{jhT9$%rG( z%lzTm@Jc*JAbF zM_yS@*LtE52Fdqe2%vb%(3#UnD;cO6Xe=p}(or$-5iDZ}VjzcV_pvY}mZ~-|w-MY9 zkXyXr2{%vzF)k3s5pm)BM#v5bG7(0~zF}$o`a-$(o9-;(tir70TgC%WStg&-E5^jp zWh?tSG~px=9mfc4Cwr%Vhj)i^hyL6UGuuMS<=c(U7VFzFI~9su{9V3XRO_@i(t3p% zZ{el+x&-`j?`5j;o8H!FhnEuZd1MGrhL9?&7F87_&%LrGv%UUM^V_|R0G>>vk@`b_ zcKkr`cj|BCOHXW^Fp`kr2q-H>COH~8l){s|CQYrFVlJ9uSeILn=O}GI9WUKU&w#y& z-H#-G3^Q3JnK_w~olCc@ytsU=982#)Z(KL7%tXh(T0xIjXS)pJXG(=$dA8P(4y6vX zOtdt-99rt6EBP$|@)(H<=~wI5l>MfiS8KZ6F+_)DNm1_wqPNGX2=fTyA7HMX{N?wF zy*=%bx;mRE&Wzy9q-l8q$VcACpgmb(VVK5I$pML^UV@hRID8)Y${S}TvW zk$rheYKlRHQiXPf;!&qS^>Imdai@Gc@0wQTNf|uH;G)+W@s5n+bIVdx~6a zkl)2gjGAkBbharcdLS|HEdS+Gi zL-mu4x9Y9MY{jB#qH4pF6O#p#3+eos;yjCQ_A~c07cE7At-6pNYtpvS%CI`KWiFoDr=_rzPp6FQr+ax zK1Yl5gn--JkFUa!I?=p1Rv?#QE|U=G2ZlWoexRA}nMd~rV6(u&VftZ`vCa_&uV#2s`8{V=W!={0?&MPB)-s_yn!+_; z6@GS!a!xz3Wx+PSHpwAQ8_2}GLAHVNM^!3ePWEa6$B$j>562hbTiIJ!+rDIJTqDNL z-uY8~m#`AjGEPE}NQ#tNgoaSkUuk^yQqq{$=R}^bV==w^sQaJ{Tr&bQ5lga0>@*tZ zO6=-B34h`{_`R71d5b{1t)VPsUpv%r)Zm#SIiwk%=p5dNi*)jYB*cGpktwHFPi%r7 zLicPwjaOR3>YfH2qno*ClF>%(>%UgMgn%)dWQu?5zGq!zN2`Nc>)UisMve)mROE0> z9#7Pdt$Y>CI?a7PChQ~JOlT?!Q`HAk8|-yf+6mW*xp=Q&Zj-#^2z!TGDb^Cz#O^S! zS#hkNS{=~I?4xcUWYRkp+}ns`e}tunxeN0@T3tLg)->RPtT&q9g=JGpkVHmR6R(h^ zl6+obUG>_f40jsqPG3!GD61G~wVJk>wK>>Z1Lqjxrj)1drQ$l`{910nS%24XeDzO$ zg)4QEb)`L|Nw&4HTdbwSx@2@}QdCm+o9?CVovy&iEWFWt@y2oHgwnU;AK#z(6~m6} zM~Ts{6+I+9^?93l>wD$<`fJJR$nt}mlzRu`Dh&sh<6-1kv&m}_7r(?2{v;6}&Z&%G$ z3YvWPEvMG)@SIND@ZC3O<)5SXMLR^NjLuu!&+ArpiS%3aGipRk9S+?O#hw!9G>6-> z+B2$KjqF=bd^#I_ZLSX}a|Ea0mz~~cq|XcUIl|)b&I=!>>%r@*by9eME6d~5c>6C; zmXoRu%?{H`sblG1vheVENyDerrPI~Vc0HbX7c;Ah*Ql_N>8JRsI6T>xap`g6VK`w& zIYJV`!dsHAj|UGWveQ=6%sFIF1yAGEWTadHH}gk}Q!{BZ`KjlriQNu@BjcjxB=kM3;;yZ0D#OX!E{go0B|A7a?-k9%YU++ z)Tjn2hr6XPRwKt?u(yAjiW*FGUL2Eti*H;e=d{brdKdipRpHssAvv`}tQF5Y--^hZ z4!No%{Vw3kt5RluPl2I5PH-7#1iz7kYU|unK9*uFRZh~mulYY$Ptp2j&*s;G(=4rm z?e*==yzAb3=};ReCIAYgOW}bfy+nyjqf;6{k!E22e-WLKNBV071|ou>@8Ab$Ny*9i zb#;XN{QRsO93lOic}Aw26Vub%=ey%+>FK>UH$t4IT^$c{peP0=Wf^~eaXUM^Qr+k6 z0Slgor~6ZK8k(Vv4Z5wfmZEE}K$sg#lfz1wxbMHO&KR6-Zf-&zhs3e8lCcK|2Stoq z%ggT@nwu>j@2+%JLfN*?gfy~*f=;`iC7i~yQX`H(iROHM^8UEqm8}9BiOdvqDrjyd z3keB{=KAlXml#b_YARGsR750-L%({Xru#{T?^RKP;U+N&$!6F6NeJ9gQC%IUyuAF4 ziQD;(vfu4)YFcitDHVYrAK%7qs;PpD3y zJ_L#JuP&IX9uwoPit^0g2&LnKe|somJq z&%&Zl_agq--?EmRAs!t?I*>_u!k$E4S?bq?Ae#hqiqpM=0?K3a;U81<*vnkP2^1bj)l)Qul!ar-B zhMr>h=sO@Yb*4HH@9E0iT;hd49<|7T7!4+DNA&Rizg}Vyat!$L1OeT&a5((;pFaqVBOg!# z*Vat3BUDvXzS}Qy`d!04TW<$enw_9wb6rn&M;#{478b$YVzfuhQ3d&C5rd6=qc6V5 zG5q!E{C#ksoa91>|AV3~J)Pp=W;?F!{!GTDSZ;N8wm|gL`Oatu%g4VmEWvbA_$abi zQI zlN>Q=6EeNetM;F$7t@lK!?DzC!$(I)E}MO@KXQK0kJm?GDZ@iU+!7LwqgXH*dK;GL zebSM-tlw$1auf9fwFV$ugb(LiH)c|mtKty9MtYH%;zVq?3<5h*h>^IM~V zf&vC1DqI__Kn{zPxY20#o#masO4reIqV9E|l8Dh#-ZVd2hn)6PEJk?0i&Lt$E(W9$_b4DPq;_w$ z?+p!c);U@|8di?gdh7jGrRdD={O3fy4*rJawbBbLynOe$XsqJPXrIQEU+#43NU7EO z7bt(Cs7Evj?R*AgEsi99Ghf~^CNzO+Ooi0gwX0SxNuq6(a?~mtTBN5pKkFrCFTr!l zh+Q4w1aB)6T&bvh?2}A1%`*BLuY?k>#H1bZ9&LJr#bhd5L^+{FcHL%;7h)T)6beai z9LrsUOfXrz3qT8zR$cEdEgeZ>#(_t6KR+3IRyH*JoRzd=s&gMNf+T9OqUh<-qrX7B zh5#G2b-|%l@vvb^kCP--FaCnQ(*qMVq>bLOWDY}KJ1vDDK96W}1*{B&k=%w7CM_U+ zgB-xAiAjGzM@OgamA;9IW0}VsDw+YmA@QJGsMN*LES6jXQ~z`Q5;Ep{F?TjXbd)p( zn^rVLoz&E53X;jIrkeC7uxLUC;hyVNqCH3ZaDZW9VR>v5H#@BlT^%jf6Y-2k zIjnX3I-l6Z0RNI#n)cJvBcd3-2-njyUYMh}X#7}t1hKH3ESQ@uYFEg>N;MI#Bz5ud z;IB{Keo5NGKtoMEPhC+{Blw`UK87w|Hv*9nbc4Gxn|{vm=v>I=?~1zu!Y)t~C>z5p(^wF}ws!gP2bSh;)x0-PE1qd#>ivJEln2Oa{tHRK!|9M}r1Tam@Z z#f|#Ej=C1_mub_~gM7RA1O<<}O5=vN$zQ!1Qy)M^MsC9(OHNL1qfqc1YuU(HEKq+{#1Oa{d27{%^l36826JN}T`kuzNWLcRl@C6kXlkE=r(`uuf!JRSMds zGdZHM{44aXHBVvXpD8JU%8Q;`uXp)Rpf5!dv0&GX-{k*ZZnSr~`D+e8Q%&XE48fDg zTOu*X@bK^u^7@;1a`WQ{ep_1`cFknV$pG!=hu%sTN`a3(UH$tR6C?pN{+HT+R$CKQf<`E$@&C@Ma`A-!dJK^C3}mFx88?`m zoHYOV5gSkJZ{SH{(a?}WQc6mOiC{DxpMcX^%%X`ePKAEWLUz0J<_n4YKfE9i$biuT zNXyEys-AuE(7y3+p~}$Z-yg_$i9I1lBH}!ikaM80lfRuECawP^fejR@4j*rb;D26n zY_{wV!)bHd-Q8X4^cDOlKnbx9R@KuZG4VT-7kj$dp5U)We88JmKI*Lm#f3y7EN$QM zkB^VTuwH9wYHr`0Z40^W#T+clRX+Ugm&Fqg-P^Nq%&_JAk7H~)<(#K{KaJGI#Kz+8 z?d)19C@K>9rW$t#P}kSjYw0Bqbjp-fSN{is?`llGAQ<82!a_lQKK(Ws*wWHc$aP0a z!xGQ?IH%#m9COF{7zcuh3uhT!_bw0SejguC+C?Le%V9r=V&5%U#%;zc(u~?BV=#2a zdHh-8dHA>D`8*w?&_DO~zB zCWEW1R0w7b^Ad|iFk)!GxoWDEp)LW@fQ6P4L<)iS!E$Q&Ocwt?(h(5JNmLeq41C<( z-SY|yk#WP35tovDyd;XH5)QWIQ%UbP4+>D-M&N6M^WH@IOVY%|L@af6^(4(0+Am9B zf{cuejf>k2XQ7r41v9LNhlilrk>vo|QA6b$KM7T`Y&I?~MO9T*3wQ#8p0Tm9HxB13 zQud7B<+2cX#v-u69D$@^9}sD#!bR&s0B=Xm>nMgbpQEZIW0A#52(oelJ~pab&SIt- zqO<%vUC*tPtDr+iSO#I)t?D}s>UQgou*{4Mwfk{}g=K8c)actH7~BzhLX?0727@QE zU#h68f^(}?8BAVSF;a#1o4@}n79)^8+JN*0Vi4_OZ_wHKD$)z%`;s;qWA|dY6YZA= zlZ60orY&n+C-9~yY{o9-9k|)7p~bw(ls7RV6^V??gb%#)arPX+nXB{HRpnZ;va)LS zeh0I!$0bx}^YB*)&!Z>*bX-pGPH#kWb&cG6FIQJ)e9oBED6wG!g9i~a(D#7HJGs|9 z??IxptY%$u0pWPGCL27$!mU4MW~6Tip0t@kMW%*^D}DR9pK}=2G$n4WdN-Z5o_<77 s*S^hyMzFX2MF#GT!K5nAvgqghlKzM3xNdt z_xtPKs(Y$trp{EIGt)iqbUz)Vp{9U?`5F@d030PnIW5H4fN1Z~Q4xKZo$oVZz;IJE z@B{!X!v7i)key2g0GR6bva%W)cCKEoo_4Nov`VtFv~C`*Hug@|0N}Tlr){gF4I_DT zyLBz23=R9N?5ahKPOBvo7edBqkrNZc;)ylE*s+)^ zXa{t~i4i5x*zx<_z!Jx$?%SiOrp zTuraT#8AVWpNg3-Q0z>x3cYXRY#LulwE%^%H9ff7f4+efed<_UJv=yAc{?OyWInDJ z{A4@uzEAJb>2HYm!|lyZ?;c|~uSvK9%H7Vu) zEIRbri1sxJ+!N)p2MMIWWR40GOXNSwEO`1} zeS5b6aMk77zW_o<4zr8co$-CXlzdbuWCFr$lv3OQz*LTrQ)j$Maugi^!3g&>ZR_B)hFlU_Ml zK#@l)R)wXZ+%>crnnqgKn9 z)tjGyDV$`SAYc1p<3tfhj6!We~kF#E7x$5e( zwXy{fCy!&My-j0IqhRCGsjMoi+N#3Rh3ih}BvqPf2iM8#@@el^Vl1Rr>sIAyoM}^N z+g6HIL|55Xxavrjh8R4?pc)LS464hPY8E!U-|rrw#j+%C@&nU3;#5a@hYJibH%zSt z`LK0mK2mkXy{W1!5|QP5%cs|*1^;X#iMF5VewXW|hH(rk&wz)-ZV_Fw?y*vo@vC(3 zSQ|T5rDvq;S1VR)Rx6zK2-cmK=auz9x(x2aaivG!vKX@{*d|TC%sbXz)!r<}EGJQY zBYIQES>^bJqNq#G_nS-kMP`1lX;{9BYx$Oc&+$LXV6I1bJ(9aOuTG85Wt<-p6 zSY~k1+U*i)C}QwMU)Rv2Nxn9(mT9T0wyPY!yhANjtvY|ncJS-(*6*#AZRB4MS5VjM zTAf>i&2246ZQF+H1}{>3QiD5#6CU57;Y6?ER#O>Lg?Ki55Q)AM-O8TMy^stZzD|d6 z+3L^W&8+b4w-QdU4%z2v=loExCAIDFjDSPqVw68jaArtw=1`1mj`bY8^}2C4*$tS# z$;)ZV891+4ufGtyu)m1jD466gV9ht+^PC+VlikrgoRh>VNaJ?gt_e|>RS&mqIcDIp z-qn+ zrncIi+8){XOw?FMHa-oz#IU^?keEpM9?q$LAIl%zIZc6KyC}lkkD*dCL8V8X^ad-c9%zfgQ>{0JfYsA}Q zTiKi!)vM3-GU`Hlm;+QD!%h3gKlHaCIi6wZVje~YpKUCko2ct^8Em(h|BK3_kRXnU zts`0|%^(h40d4plQbfCsf6LnV++0~b)L}JaGj9Vs+TzGJ!cDKrILg3v!C75v#@T+? ze17u>vd)z;1zPWlXqD|K`6k}pZC(C-dP+=Er&Q-!=bw(?#r$TA`SP91+yzBo_aFYB zi|a<+w~rFvd)IZ5bX6B^7On4td>4cj@=eCbeqL?&qV(^T>~A47jb!9Se(8 z^KW#tl9t%d6mUmrdY|$xeK~LhadZ=MNA?)pE)HtGRKJkGyyJ$aXe5h=x zxEy4%ud?NHw6pJxEQ~tUCne^VPPYOc6xL~8fEmzEbC z!ufZ@Y`wTO@Yr&C+u@b#Whb83?mXlJRnNuH3Hdx(;K6)4TW3O$cUMz-eqx%yU(t9Htok_VTaivAu`^XxPQ*?O7UuT^nse&7yoqg|mkt#*=;gh&BZwPbHVr zHte#Nx%Y~oMa%T>3x0>f?1hb0vYf8w(oWhXkCx9K)y_p&3JsL`pRWSVeLQ`|n%aEZ zApL(CZ*6>iZhel#X2ju>KPNE(EHmzOZhtTqnaU70Dj`oqzucr5y$yFJlpLGc0yQEg z^S=qOwM*CHD>q?E5Iei9wKWqZE?TY{%fyZK^uvQVr%C6>tSs{Qq@?}%FUrd5L*g^C zcqj`?OT~?iDQTynx%%L!_o0u(5fKq5mzN6S)NR*K>}I8o}Qk< z{#T5NRANyu7%VgiT3uB&yS5hVeYVt~WsylwowR@Vd;jjwx~pgFq)5z)OWXdcZNYG> z^SXW|cjMl_o3oRP3;EE{=e@Z0swzy=dQv7PCi@?W@$oxXhZA@ENs@R8@&?~IJg?wz z_uEb1L6^3Y#zum}!$bRe5%)b5iRTB;$(b3hMCjS+>94&wuHwSNu>N8tj+pY5JZg8NGxl{T^?Y-H-EpPp2XD_(6BO(UbppRSiOnu*#O4PyN7VaCu{QcHrLTuV)m42 z=asKW3=9k!L`>(wDpPrQ5PS+Dmjx=sF1L5#e}65%4{abYC+mF0nSsTbq3nBcTo5{v z%%A{WK3{Kp1%W_1j4Zk~6Cdwy&*<^BwY5)9PWoCLm-ShBD%R|sogZ4$ltnpFWpc38U13D!v=Xa5_p{ z+Zzw@8N@N2C912aWI9Oj_PBycBES%Equ?zPo5z+vyVVVkb*djA8 z4`Od$d65gAK)flN_PKt06#UR%_($SYEKrc8Om%S zjR&R2i5|>`uCK3qvK_by$GZuuJV0FOa-^e2RN| zsER=je=&f~%}r5!QetBBpcubq~x;%Dy@ZZA>k)EBQA(Y>KoJ$GE{<8ht zB+HmAm^$g!cR>Jr^O(8o8|aLIMJ?#5`el`eO`==2?tU z_Z{Ks*$+STyL>oqj5#?m8N?z8aH9oC3!9sXT-qpH+Kl)>DUA3y>aMQ!7y9=0tX0+3 ze7-E0n3z!fn9JUK&f^T7V8)bfm`6uNv7^2HoC6OGl8|5iuZX`o_rwz+z^aMl=^5RE zv_!94!$ib&xO)s4$4wF7HWHcIct3pZ!=>C1HE8bFV_K`5mzf#1 zeYp&7+`fzk#eQOp@e6+czCdk=F(UijP-%Dq{CLLbPjMrd5TXK)TWm&%m2wnTBXBO- zlR0P+s`Kr-TqQhK7a}d45`s9X{uV2Zx8dM^iaR5S45R+ru`k<|Cb(I6}xcJSasm zCnqPh=F6%Y)ePM4;rD0^EFd6&pKcaYf*{7q`HQDC9!mSB%iygJ(aRzY^nNpLB{xDs zLb-+xW6nH%IZZ~1h=qT1s9d6AVn{&9H=6VFbGNR|wU*f8!nQWj`kp_pWs2|?Te{r$ zQJI;UQ;dfm9)g7P)GRc@*ep_#l;YT|)(>VCZ{oDYyoy20G2birGW}@051>mWYBe_< zBjL4sS+@CeJ>M9WJ~3iYjuw6S^3tb^igL7n|F;w#3PM+^V=0XG?yEWz>H4TuY2_Ur zmGoQP{(N(oEbnLwX3#W=c73{bZvtALe=IJh30jnbV$~w7t*sGfi-^a|R5@8$4I94n zF-$ysi*51Bl+oF?De5O2sMma_98fGuSr_@)~qHPpCWLx#TyXm{V_zxw8 z5q80VE~CX#-O;i7tB1fyp=(o(Nc{UK4r)Z%wopq%2BtH5_G=3U6SEt=s^+y!(9faC z+xtgDd8U6Z{MA`2l}0sp6>F38A*E1k9D&!CjGu=z-W8t^z!MmY7v@yg6q#Y-thL3U z^pSlfc#J)bxdtR?e*~vzwRdWb>*2@W;h2}K6TDUiOPHGHJLG?dlsmLp&|i3;tWO3q zW2&ZGTUfti4|TBR$%88WrNWE^2R|cxubs{B#q#t3SKn;d+p|!9u1Fr!;>d7N9oXe2 zf*_5$+qt;NgNTX^+lHwtwZ-&Sb&Rzj(~%2HtVEcwsCE-hQbr|u!zCTPq+|bI;;#(S zV>oCyjMF(7)x!jhQrPw?D_Knv*jZT{7CI{QRUQ8#RWWxdRQMlJar|AySBHhG9Pei@L!umG4H8n7mQ>hf}prr~;EgE!nKibav8s z{O-yrpBLh*J{$>8yY-og3`1+V$trsrMEyRqjcb79yrfa2Y2}$}S_l07{X5-bbA(*? zP8X}QVlu6U1)bNd{Ey~8rk~K4+VmEK3`gc3%pscT*IpyW92BsCloiFMlLfEJy5!S= zFYj=xA;y}T(oTnV;V-M83i9$^qYjRaIFdiwcx9479x1a^#%-U!FBY(v)c;|L54x1Y zQX#N)_~$fW3!_!N=FKKkCwAw5&6GHMzS=Z;Wivf?I?Kx{@U?eCjxuf-`s978Nbd}= z;GyGP=G5(Hfs9Lbe;N^|0a6cs3wGlXyE-cK11vW;H*q%J^8&i^$LWLM1}WM?LQQ35 z?I>d)v}#FF@1MG06+@{ zZf+OFowJT_Sq^=>kdD)%je0<=kn9iYE_;W0y+bQ!U8y>S`r~z?d_G zq)8V}OAsTK!uTVEpF>cE;0xQoh3ir~g}R@cT^VFZVj&OhyWaMaL?%r(IJi`zrD7q! z_aNQ3TY+Go;jbT0PaP-FN-`h2>?-=cmUZ|1$(W-0eiX;uaHgJT)zY z)chMogs8LS`sF;tP3W&P=`w3t&D6EgU`0R}d`2=!fhPEK`^e4DpWq;g0#=~`FE5#6 zx#Pp4mX<}gq5~Mro>I&QyIj3M&?JX!Lh_#*f@w+`8j`b_UnlI1B{Pt7;pg7uBhqnk zZEb?EzesX&GQRU=W3^trg^v$OY%#Yxmo^(4n}&u)m~QpEqKXQ1U0vOZ>T2bC$i&GB z2$x18cX35lt&7EZqaB~C=b8Wk#O!b6mvTkDF%j9F+}YhM3mX0{TAIfH0ACzonSCv9 zMDp6GXuvfn1d-%(FDzFRi`B{r1ONOqcej)`ES>}PKK*kYvJaGCo3y!aIV*8N3S-t>t+T&n%eQFMz9zH%p<03kVoC4?z4E( zIrZv{`!_ZyM@B~Ql16zXBoY-FEnoz8acmZ-mONvY27UjB@&5<^vm=sx_=SwHH{OnaocEZGG6^ZRxGn9hZ&t)=y$tc=-NH5mcV*Ecu22tG`I zGq~$kSXL&#uBe%Ao%<$`BsDcPy;oVjfaQ@?1mQ11rxmlz5u2udnAaWxX~$s(;xqdR zLR*S!Z#-{K7x7S#iZnoHe_JaN7-zQK8>}=@?m>x`F%cOaj&vIPGs|t+#CLZ$nnoUR zpM9JT$I}oFL&!5-4X~i<;(ym(RMg-6&B>~EYR9K5=Diex68D~{R_7NMl?Sb^*4XwQ&MIi!`9LpZflgm!N$g`{XHB<%5iUH=jWGcmoPdq;`ZmKf$~I5 z%11sVA0RW%;zm5iEWYGWso{k+D{OXmhlbh2=TPJ5`H87aj+0_YV_rV$fyq2={Z1nZ^ zs9s*JT_|Wo1b)?U(xt><)>ViOq)6c4X2B&Aq;d>#r=7 zXn6?$Gr4tyB48^Gz{d@vlmMszKmpT0NCFEl00A{4m@4qS5$GHv!LJ2y2mk>{MCfw> z(-$xwU}N(FKBof|%4bHPQ=Tf49d1;l(rZD@?2<}BuW??uU>h0nF>#HlQS(rUS)f~F z$nkZ1r_%}ri4gxf9|3^81WJ^*=l5P?L{(#BVsQ;bW-s}=9?08UGCFtuFE&c~Uz!&ex3{(y)Da4= zEryKzA8fkKI*sl>{0jixU0weAxyc?RWE!M`dHt(<5^wOF5#sVj&i>oaN7gK%!hunf?DFV$h3d$CTL!BOa&C;ccNfyn{JQzU% zVbw?wRTb2Y(q}eMWjuT7iY^)cM!6+HdH@g#z6)zp5&Rld3wb$1P!Db{6{q{GT!24e zqQ z?zNO&o^h>Mp0!!@-&?-we6K%^{!hB>1r~Q zcIt%D)bO6lZt5<^g(m@F7-dL*gbf#MCJi=?4Xr0lb(&@|?Q}G4zrKLD;6d6>I&r#_ z0hGIe+mA9~2rpSZnIoB=n_s`IytsU=9N*yFU|2uC?5&=Em9l}b90uUX2;Dt&bW19c`T#FN-~4MVNb#D1xJA zbkWa)yEW~eu{HW-d0DZl~UxLv8$_%?`0zF(d54X27t{MeK19lb@p)e^iC zDy^4NmsNb__C@sht%{x~6Z5J0i&2-vZf z3C3tZy`nBoAV&WFdQv_}qHWRYxUwv*%5`l3fP^Sz_$2p5#19&z!@4IY7{0L=Ntj0n-okH^_*M*e_U6*QA|->%d`>H zk*t29F3K%a&i5X)B;F#@BHPCYGai|RW<%9JXfR0faaV~se)ze5cXS@UnZ1dR^rcSY zA24!{{zq;(O0^4yBqn@uQ7C88 zN@}p#xA_h87=~Mi);{z)MmO>^C1VfT*L{IMF@Ay9pisQ4Z^AXtja_SFZ3OEWjU19p zsmS3OJsPPSTK*!Qb&~sdMAl8Vk=RfareXAg5&F9w{$8>cg6;iYdy(^+D5X60cPf!1;o{N{!ga$R zN0)zyp8-QE6HIZ~7PdH~M17Q>*nB^Vg1($Mn8!e?<;w zmtVJC-OCLATsA;6(3*wKTHmVO)?LX~MV9Yfr`$T2R%$!A9Q9*NVccW05jD&=&&)DT zz0}u@pW``DA?knn^CA1h^97+8p+Rg`-zJ;0qW9L`74G^K6QR_SM~p9g1AF?Z2cr!m z|9gduvkc`-y^Pz}makiMMr0=E_SbywRFH=85*a<%>3$LXr~>T;cGHNchg zer&jP(UbGIvQ4MW>_YBHei6JHJ}dkBVP)ZD<SZ#AJfl4FJZyA7lyY-U7jnRj3P?i~CebD(Jz`>{ zo!`9^ezA<=P3Cv1x>^9>^9)6xApr0X#h`(E0N^eF0Q=?uAe9CH)J}VnC+m+(EGH%V>|u)M;0$d{xX$ayDs_><+p@-bpq;oEp48B8H6pUJ|jYHec|VH z2fyfPa%!on_cs1SDVk_mbDf}=ryZ`lJbe58^KHW=1?o6UNuMV}kD-gBt4AYi)9N6p z+^w}kxc-T=LO#jE-MJ0{G4VTRXOa!)g^8W&kf4v89>*(@{?qT$re>eP|F|Jq=!t%2Z3!X1}=1bG}S^{R&^ zkcm64$m!@1V_{<(nIV#slbxlqxwyHbe2*3uXsX^c2X{O^(07@CNnWAjl$NHaq@)x` z*W}{oSFy9RTk+M-0Yz4KJkSjf4_B~lE-jg~oel8}jE)w){rLCLI7`Z%yOORCO8+$_ z#qwmWeWA{V7!M!6Y(6$7Ca#{=@3&>4E>Cak$JdUb!&^g%B&-9X=$nS79StKrnWZtd}q95zGk`6>1mGNncApJ>hP0}^<3Re zubl8ft0{)uoE+`af2x0*^Izd4vIik07Cwk=wij@fpHN{2-7r+o;{%Eni3F&(sQ+>C z@y%r=vE$~y;zB;TTk}2XI=C#~gG?PdOPC9#|8i|EIChcB&N#yj@A0}?^>jZ6d!oMz z2$0Fh%oOc!f9o`aZm7tLgMQk)y1M#Y_G%!34S@{kc*>WGkJ>qB2?m5cdQc#@W#*_d zMcMj^kKFfAuIdT_v*MeUiKj^L#NGtp3hR^XxXVlizjG$dK!V;gNoz$2JDr8RP;H4gjDD9E zs;s_Zt<2J$DHjM$87)P}dUXqc^5OgP5vrBTlPV?HdfnXIi1bHAM?(w@lG~&cGBY(| zRPXN2$L%Mp)>0FBKD`u#vzJ4Hmu`DCeABDA@7CN zn}}MHVg_9k=^m)ix9#rlqXSK=jz1b3dmI}pu7+x3e*TncyPSLd=bxYcyrZ2RE-E!3 ze3l*_V!TxNf?RTxf`k3vlqhu_Tx}6Iy)}$d@+1X_Z}YS^+wJUXDg`o32s8J6;wP07lZYm(+=zG7G{s}gm(6FX^doa2wf#9#~xQXm#p`~trF8nq%k7pJ?i0w~!vhKxDWU#9t zhT!@S3uBfb(xkKHopaiZhr`3e&mv_9+AD3|dLQ9=d7Tro<(#$9;UXw`$2zfbN|y@* z%9mf~|4Qc^>Q(l?ju~)Mrs^k5voyG${qxIUajcldgHS}Kh|bL-y_rDc;6!%IVHNz; zBD_KJywQ|zQC=P%hI+`Ts3?MZ$Dv<98SETXt&Bs_!Pg-7K`it5(fA1M$up)KGsM9q znUba}v6Zp1lT$T}FUr;Q!;|PNkTr$px_{$u8i#DWa%p+G8P%*%K}$9QWw;ZZfT=fXYUiBPlmu1RV$^9ILhEX4MUWJYPV0U3_VbD4 zf`d^G%MGJ{Mv8D>OesZ-`WdIp#uWbRspYk~aO-n>LBAJ}xS(3M`}M%ml&v>3x{^UT zx(N=CSs0o`$JZx~kBzm9o1K~24JdZ9`pl}k#h%aUYQ~XNC9Bh7wx_fEZ!Li;jeTt4 zKo2*!H$-Go!^sk4fIum>ghJz|$AF$p$(I%2;cp9_HzwpRTokM~^EGUdKhPNB`@w#W zZE-f=oG-)b9xF>RfzAFxA3Y|w63av?nX-zC*P<2V)n!xCja0BmZxB;#go%ksfue>h zc1vq(Sr|*scFd?=JBY*hubZ8%?SvoXDN(qfh{)HBh}+v+QF1e~5)I%~ z%^-NFwka1y@bGpNS>m9Tg0HW19D`&qvCK7d`JMr6a&J32$Aa1Y_eGBN4}OBc>*p)K ze&rooa!Z~nD0kfd&FpKFy*;dJa^48G(D*pT>jJ9CzaFm1Zq+=Q>5ZzYsL+UIhgKSj z!Ya1pnMne7eT~|ESIwy;J+<8#gn__Wh$QE9JBhx{-|dT~ce&VwjGk(w z@@*8x%UIU%gt6!w7;OC6=*d8W!QkD)!b;NfCjcrrShwM1OcFn@<81MJERG=mnW zN@mjc-o=F!i9~w+>B1Jx<(-|K&CknY-f*v@AqYj~$j0ToS$`NIy~vKTipps(wVAoK zbuSGmM(4-~flD&guiPh%o`(xTbvEO4GNws2VyI2($p?o=oX^?V*qjb>=9*hru;kl3 zpH3LSt8g{a%vJ%8)7_Y8E3AV-Lz(47h;jbyHDWO3TI zS-WuF9}Nxrd|yH0;^D~t_;=>!%o|Gx=TyIzMMcFtEJS`qR|JO>G&eUde7C?jJ3ogQ8%LtnHktj1iH|QV zEMzOH3IE}tv()0w^Va{;00qT{J~3Y<{cl8ke0&m@Hai7KF&+s*WFD@OUKf)pNE2%; zwubo2RnPSel<2D-NQND8y|00OM`bvbI1KTOhF}wAW9Qy<388mR{_-ZbrK7EFC(2Z} zR3^(61@Pu*2$TQQU+*em*chuA-)fi$c>bm#pIeSj@=w z{%i&G%^L&?xVkq4PzptYgGpeD?qHxaVh+bL=EeUH?*BjQ|1bQrF}ltvu%i5&n480j z?hQ5Z9fFm|gKKkOeI7-3;y8LEzqjKF8+=c}z;Zx;A#%=+RMX6NU7 zjy!rSYhG33Vuh5JmkS|Sd2Zh+I=27vXeBiJR#aMw6B`@5Z}OCljcxbjq<^-;h|oWN z@q@Cvdwt7bKD(NP=P?5e1|#rQk(Wo~=H{Mxf^Kcxhd^MS79!mSprphE1bHY~Ja%Vf zWb{JDick5Z))FfpB932ieZE@%wEjKRWN2u}`Oh!;QOn=rPHT!PD%dU?=lV@oYrc~! zD=}?tZKcRY$JK7sVja^FsYP{NJ-xz3Q*)HO+Kgr8SKS2kyB(rjBq#g6$$wycpoqc| z1V6bZ2f2$`tiIic5A0QaX0KkE?^4X~@4t@?L}TXXCq|uvu(ra2g5ai?%G%mQD7&F< zth5_Y-jvTzbiht}DPHsq>=<@v_D|Rv*{7F@b)4c4tyZh`$5sVd-yW5QEDBV#B99gbE%;kVB|jeV0N=Oo{0)d6VN>uPIj)148u$4aBl zO?m|X+qSgtUy_O| z_%(KI?SYOeyoNtf$jWsZ@OROMhblUhl8?UToq!OASaj_Fy={g>rgi?E*MY+j9TmKXI{7_;6NaaXi5CE1 z5&buifZTj?0Kn9CmY3Jjaq{r?@N)9-q*Ilbr}KQ{;o$t*9svB8;QEeG{XJ62tF;R` z^_b9fbq_rfbUHn`_)y{$77lt0e6<+*qD2zjJ_1EW6spm}804g+&;$})F6=nWUub{m zi<2TsV&cBvZ3LCL{_MQknRskkkV1Sphc`^2^`c{EstD@748^XHqb2wqF)}#3@rOqy z43o(dz(;SeqxX7XL;|iuAP`Q5UbJoi$$u6L9q84}>*b@4e!|c4mQ4_;pSY5@422Pl8mK0?-lJ z$0z_!62O-!!#G92m=7R!P#+WnesKeQszwefz}FU_cM>0~9ze$i_;h0;*#VRwz-p9{ z(I0r90}v~n89`1tYw!^qpi(*YkTxbU#V|8;ZWx-85f3ffq$(LFv9R?s>s%S0{(u|` zfiNMw-{<21P?$mj?)Ln_e-gK5a#A>{8P}3~zX$b+!Nz9maeJ!DQw9JwyhElRxp*5W zLnTl{-5!gXk5QZ~unK*y;vMSoWSW4&y(Ob_&;PVhEc(#4xVZi2&o8w>IWz0;M!}Dc z{g%B(53g@RAoo|7zq>b?!USH0DWhEf?jOIW0 z3INVJJo@I?(2+x(A~vS{o=&76lna@GPzTji7ywu(F!4aYH%O151Aszd7{^yxs*65y zu3l8?zUM1_Soc=K@8y^V`{nTEFzrIA-&nDK372Dwn)ph?VZ}QqLnG9y>lBsdiObV( z(26VRiFa#_UeL$Z8HRx(JBm(ZO}`X_WD{r1n1oK26M0SFr-DKl&qVhvhFF(DJ>{he zzg`@a&On9cO!Cb$v1oIp_7sUxKp^}+s#BRiJ*-|=at^ymzO7t@^1V_q)(<;x{@i5J z!n_}E8Yv|cgo_YAs+{nalBMKF_fGuSnHQcIUO~V5Wy0L2nOoM+eRpbe&P%@@{ zTe5SlM-xluqT?Km`~&|p@JH|u)gSsZGfcRR4D8dj{wAB=cNaB^ZTxMaZB+Yg0a=5R zT)oxuA}GPjWK+57qGr8X-RN>6A)j2ai3n0v_0sC%j9E%2GN&u&+FkEe{x&ox^lkwiFHiT=cFuRZ%`+F9%ubCKliN za&%-r&~(I0R#p^=$qT9p8a3#hr#ncaZDqr*^S!k&5Nu^x=OJ-x#3$^V>{OqHG}`#> z&0Q-qvoejVRH}5Vln=UuYmUm`pSu)0Ozy&PWk=Ll%~_QllP90U5&Dbzt7VvFq?(fA zmo+?1>F{*1sWb@YXMz|Tk2rm2k3*_ZP}$VwlQi0HWTVH_9QuE z=q1bpLc=?5Kv5P68ag}n6^D^q_{uIBRQR(sX@Kc=5e zj+;B(BTdCjN{tOnUo|LI!>gHpc2swi5tOxQrD;_a{B#`ndfNQ0xuS*Q>-I0y<(g)< z=3r|_8#2e1p_+l?w63(^_Ta<^Ni>}3McgVHQ<@O3#y7;`hT?0vlljNe!9y3Bd%TXu zQ}|QA1h<-r#@Gj);re;A%8q1?ZC(-QG4ZkL;bS~mQapK7!>glRf7HA$VXrm3fo-#h2~>)h`~&CKR^GlE@~9SBG!+Rnt3-9)75%zd~eB zrc65HM(Tv@{``Svy<;6e5Q5Db869a9C7t9MV@x^CpY_sjdPUxAUEx+CQ(-O7kzZS^ zmRs#5hg2nx3uH;8U8r4pn8(3neBKyttomA=T8xLIM%evz_xkX!>7Se2#L`1m-g$KjtLNfPR{OM+V+$;pv!P^5z`0 zT4yR8nt`c@DV;9^n1%#PxwhNhvsQfQ)WFeL%@Z#m&Gn^o6Oa_|;*Us8`2drvq}NPq zcHDQ|aqu1cVjo%mIOHDR!b_Wh_RY27!bb!3!P6Vk;JsOcJJ(f2*PuL;TZ0LuV#J2LoSW#QB4tqOm+y!R1nUz^PS-9>vi%X3->xPX- zm;V%(d9xpCx2Z!+7 ztXM48tMy*DGdl-pI%YELXC`=dQ7=Y#*=@ZoRd5j zg%fp9ASxv$wkiGQVeh_7e#&l&rGV_Q_;IX;jFdOzdj4QxayomuDC;aMt;g+c>BD~S z0Y&ZdaQ`rE_cwn*ev1pkyQ4n86+fDjl65@oKX2*Yu{}B6)LrWTD7#CeNK1P{LC!wE zw-w}G26>atRz*(}00Nmo0*wHG8<0Um_W;0$4*>S906;t&0LVO2Er*l<054uuK^E%2 zbO?9TFq?ld(nCzH!&#z7-hV7?*I#1*&buaJk zSJ33u{p890q&{gVI(fp&geYdDh}i5tD+UL?>=+7-L2Oha{)j$>aVtIoLGVLDlg6Z4 zk4)KY(Wg%++uPee_Pl=_Tyo7Xh>eYnWoKvi-rqw$fBwwJ&tLaXVH`%S!9wKX;-X_= zG5O|_hm{GB_$=TftMVQH;5M~&yX^`4)PBVUqhi#nX38X z&Q9vm(o&2QvEW;w?wcJdE?(Z+q!?FM*VFx~S_To3tiXwza|CQ>JSRbo+%{Op)HLql z?#gz(JD81)txam3kp{cPQu(OrcuW+8R?-M6aQ#Nf7Z2 z+|202#L(ZrUjrF_Itlq7RJVK$ICrSL=?OSz8KY5BGw%u{3F&zebakv~XlOXzhDPfT zfCAy8&~JF9Qc740=hX$@`7WNGp29?_aaY=X;)rh+npVE3Z0E@k znWch-g~blY74w^;DU9_hgNKJ);^N|-Tf;b+>e!XOrlzJ=Ez5PVEv31iKl>dT=s7vD zvUn{sYx45*2NS78bj-}Cyxz&mA~B?(^H_9dn+zQHh9Ud!SCrX}(BPtVT6mbg7=ckY znpPiPUtDJ|mynqL`4hEa zk*kyy@b>c?Q^?QCiUtj}RrWDNZHjdbv@(DGzg53=`-`yI+1bIZ9AlBBE#l_`#;-W3 zxpjKh@uCO9YHE1clULna#y?CKde%aBYajZ;?}OiWCyw=L8DIO*Su%I$5#M{dPO zPRuQu$ZgiFGiAS7%r_&*1}^svQe1qzb(1N0F-P>DL#F?NR{fqtLPl0nS;^t!_n+;_ zQ?9qOECn7_rj;3P;7TPa9OCgq3>h{v(Hvdc7xK=AVoQj#o43#`#*~ko-JArm1x>W< zY;2*kd(ci6YTT`s^^k$Jt{~f_g}FH^J3FSA1k%^PBkF6m>+1MHr&gTFTGVF!8ZB;n z?$BW3lAWTU(JaRCZaRCc{!^gl zIW{V?Xi_|^4MjGT4t?&Vaq;!wGcAtS4h=cktZ+EIem8X5iHTIMWf`XcvGJx2jGqm5 z(%5!?$4NI<0m8b@xIEEc&#ldVjMPbpa-}<1B7h(*YN|raD9#Wb7XoWk5lf0EaMst? z2g_u$F6i5WkXz?XA4y5cRD36jlk=OI=9wHTfgGzQQ<5Hid=!5OZR_eWd7q}XHqnrS z5T(7%e~$C};392`P;_);1$y_qi>s?~466*_&DF2!kuQicPGR2EREY z3#e&&q-VN9XYMh|2n=Iu1dLj6VD6L#;a8`l!6o`z_~yIo-IC-_!bnr+^$4)H%2qPe z*H7E@Q(Q$;sE3dIYV&tezeluX(Q=yr6c-Ap8iJF^x-H!Myb$e%rU8|kUIz$&e2G14Jb&iP*Rko z!bTm!jkqLcG#s!Ryc@Pb=ytM6(&9}&=Lbt{`THe9Iso;dCk(%IDF~WsPSCCc*q`Zg1N zMuxXE>=a6X_6*4eZ?!K1&7gKC{R=L4$|mx`fhJfoKI~eKTrtgvdxGWlv@MphV7lL6 zf6}6&90l0?qgzUk7bnlJiuG}Be!e<)UKMJ<4mZOq88qj~(oi6cXI5%t@++*WigzI= zG?}~>GElQkwVz6lib7pXxb+lG=Dcn~JH??7Nem7rb2;sfX8R zX99tNfrM)x=Qi29y1E8QLTKOJ!w#2QlDD5Rx`Af42-qgE5$PD)F81|QNShNdjE|2e zr=l8=$CG5rtA`pHMc?1we_EKZ;ZyKE{1qm$=8v2w?3N0rqM+!@vJ8n;VJc3FL9%ji zh-y{C`nw*!+~IrF5Av14i<)o7|HWtn1c^b|0qFYci&<^(C{GPEoM9k+umv>+*Zggg zgoLE1t&QUO^XKCng5~L%nVaA-HJqj`rE0ziUX48W?DuM!aZyYcFfFK@!h&5aq?BFVwq8@kkS zczbz(9w~>95*8Z-*E2MXT3IoFz0`;i5D-xQ<%@!wn_E8xx2>(MlZS_P)d_vcYFe|$ zdeVYL5RN!JX`7bOZL&Zz{`mMfy;)R8bFlZ_YN0md6ooeEu)%E$5 zv|wP8i$olF%uz%9KMW;OU|^s;yFMLx0sD7oVo*@F-`rZ9O+`uh)pdbqs5F|~kIc)< zi=2}3Ka`G&j-Fkrb)Q$DPSh$J01Gw98E0o_I(mBH;o;B7!OVUbCwI+qU8u1J;W{lX z4RmaFZf^J#Lf;3Y(SU?MqK?wZnD9T`$7ZoX{g3|t7x&3Q`d4E4^X1O~h&IzpOPF02 z$ue}IUWmz}t}dD|nb1;*ya9vD)BeE$?C1-6Ydy45DzYc`|Kw4h}h6+mc4qk-vZWz+XL&mR=gHm(1?z zyn4m$CbfHY2ixd>K0ZEPep_&V{}u#xmG~=+@KBIUH{btmth&jkCMG3S)Bhk>guk=1 zQ+|M57QfGMd~%{3930$#u(Z5X>5EC?q1i( zPCF8ZO1QAGk=VquE1U4x73V&`zEWX7|C(M#>JJ6K@QZ{*W0;P zuj(>rDT)SmNjdk;>MU_FPb+a$$e0?NDoj-Or~j+aU+NI2A>)F3RTK)T=^hazRL1!? zmEfv{)aH6!r{7yNnPUKP;EOsv+fA2CDfv`<6P7Y zb=>)E#>UFZY7mq>^EnsHzRFJd3dv%JKBHHIAhBzij#ikf4;=aG8>JXE$l&1O5>}sP za2i4LY>@9;_Hn*ZYHMk2_D5n>{^VkEg-A%mgE5-_BKeJymy4^sId?x!k(G;7T~7j? zM(QoO<+}%;;S(Z1GLqm~sPCahBq+<_S{IdBi+cuU+)V#ePUC)6W#y+ISyPCC(b1Uw zlW(9rCMFcZ?kj92j!grRl!>U~aIK|DPGZao%Kmtm?%X4dbO=Pw*1>^gW@+hr_{Cw_ zj)y(%>pEiw%iv3c1b?t+Jdd%cb&Q=1@$*fliKtups{8u?9sggyOCb24P)(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRZ_8A(JzRCwCln}2Lt*A>TUerVFND*K@=S=M#w)M)CYN==ojTePWNvni`oMcPzp zindP4wBK6)*cx?Px*w4mby}rrno@OtM2o&WV}2M44nGP8VsH~P>^E#e6EJgdFf4`u z0TUn)gWuUdfG~ykgMjVqO6L#zy?5{Vym#+8_nvc*$p+j2d;S?5iU5d5mH>DFoCEMOfP(-Y*vybS0UQTl0}vO0 z6C<|(Oab@9M0A2wQ9Uy4ClmNU9;L-JlJp^ES z9YNbA3g8#(0s0XDzXed1s-!}pAhlXeI-Sm;*XwN!(Q37BrBc}|_z-~IgM!@!KqW;X zgTY|Ac=6(&E?>TUG#ZUQoy}%U6pbnM`KS zdb&i1!*NE$^fmz4E(P{E0C$9@aX;6q*j6f)w(IqJn+WLF#KJxZfE8LR^Yio1ZPYF= z7K=S8m&>mU=$I3=o&o$u=w<|5ASxnUl;L}bpW>V!R`eR6Y#S%K0Z!fua{gd z7rEW;b(c$*E|J-67UQ350AAn&{__Uzj|U|#09!i2egZ(E#ods}WV$cKXfzVTFb!a? z<1P%qkp`^QYNbl0LiclHS+?~nGo65c*to&x^9@XqiHQk%_uY3Xm&*+lIFU%S0$&I4 zP&@Ef08{}G%d%ZN;y8{zk<#IVvC=_Hio2gJJ ztohO&kB0yd!!UI9>eY^Ys9q|Fv3eQ_0pT-RL78kBb7f*=z)WLZMJ|1_2QLVd1x1!h^6TrL+e3_}`?hTLv>z5Dg^O*!5uz6M*Bb2mL@RFvoFZu~R#sN} z{v{HL1O)RXhR}u<^$mjEsTCMH`d`1S~ z+y93rq;B$8Sv^17w@&SLJJo8nrvL0!W@cunR4S2HtL-Q7A7udc*AL2FZ#0|D6bJ;I zp-|{tAP^XvoSdW!7cP*&U?7!BwdP)>Qc1O1jjmn0*0W+Nm5TEDeER{Qacy;UbhI)t zF%k3o{qA5esEtG-Zv}%vt;J#~2=x7P8GtYHWdMyv!zDuCr~H@jS}B`G0PpU>xMJUcu*++5Su zYLyCw0%bB8N~Kbi&1R`sEK;pjqe7uTE|;r)Eqf%UVwQM-Uv51(Yy;rsnQmMzmpdqS z;BvXVQ>)ch+pV|VZYRIrPqA2xQmGV0A`zONo+h)|ObUf!&6rxPwpuQicZwY|m&+X- z8XDrdFr)xH-W~vWO(6IllJd4^XJ_AUgp7KT+1c6mrHtqCctSk=Svv*szECe3>G;s_ z@bGFnoqkcQ0?B0Zs6wIOdVy6a6kIZyJSxF%yf{2Oyvoz(OWgwT=LB|9x1_xFv9Ymi zFTi7CV_7NV*zI<{6lw&(N4o((4d6DPGJ!zgJ+X?gEX(!+%(5&ic8owE@SZ?_zvN4` zYyt2Oq3ITn$4`h+W^r-xRJ$<}Q|+_3xOhrT|M7VIgut?40eoC2d-x@xgqljFT1_UC z$AlCr7K^*ut+kM7wc2X2SllJTMjTVARI37swC{?|5&uj`F^xu36JuBm217++sZ&La zLDXn8HK7_VDHQ-)04PM9YF4As=xKqy?M*4bPN(xGUw_eP^t8a2rF!+Qw1PDNds+i~ ze47$JpXvAe-BN)4e!rW~xASZ+S_@IX-fJb#{(32pprTf*^>!>4JK5exI2=AJ1vnfI zpY2fMaMEhE-WKtE1;8=cy)*#NiYOIoer>zmeyeqwd%fNdqyT%p-Va)*uib9HCE}|# zM5~z%{g%~1017i&O&alD{|~Vn+Sv;lPl=kwvlwJDPL=T|Mve| z$4e)8fI;bt%a?{0*{1pzE-^P7D0RH^M@^jvY2eF=(qWkUcFd2$4PT%1m-xT)k!Ktg zL>>fv9OCe-6eT~l=YveIJxUWZ-7X6g*nVeletGfT_l7K(!h1kAu6~28!lvj~lg^H@ zB3QG|0a~8kJ5R?n2n!90$ieM9mI^X@s*!i0AG`e`Gdfo3HO_yBrud?ZP*x=>K6`NL9C{?Wp@)TgFtHjkd!l z?T@zbvQB!SNz#y}gd1&mSp7)^-HqA2li;KhF!EGkd2iYu6WDUS=IXB# z6sQ(fuVLEF)|RgTlkj104&BM~nhjVl7j73v$B4K#jhP29l-PIa`MV#W{}zn9PUOZQ zBU3PBA8ekY)0K2fm-`#_hQ+D+p-I=i@UVR|Pulyh3F4|&1%+YUbBa_=*LL;uIw`A2mFb`AEqi!l_;nBd~T5g(xg*N!GhWUiuUV?0Q9a!CtdnWxJEENP>m6 zJ^syjyG^ukRsC^`e)!t4oV;;&HOZr3{CkEbuATsW9kHFk(CtYq0;ckCzTk5<>0b$A zTusvF&G=oU;cu%VwIKerN-oD5mpr4@)R|$dT&`P9*oH${&M1m?&T~)0`JO3K0EKT< zg_0l3Ph}y~*V4x~^bdm&GI5){61H=_!{>~unFWcXE|ugSl4Wk^El+o7Tl!eJAi@N8 zg5rdBd_$pcy@)Q~sL(HD>}OWmHjnioJGkB#-0;`s)S4RYA3JHJ`wF*2KAC&%X|R=l zSIcQTpSS!@p3>w3CRL*ZihjkfjX4PzKJ!nbXdM=74B9~pHqL?lYMqAC;jlre0}owVL-AR2I! z`L~sI<)w&8E_cTyg?yRV@qbeErcNs*{>wg^#4zo?ZElf@fJ@rp(w|B#;YC1*%3HXi94UtLw06Qm z@waggtwdQi!RmXzKwoGuZ3aV0tZ~(;`eai5YCsz7#e_Hg@bf<@sMO8$Zwq|cE|`mx zSM>k95W;@;X&K76XXO#}CfgXbgzgBZjCqm-c|RUuUWqcXl-xQoy5|>H1>R7b4JTLB z19f{T&4;bFSH?$fWfnPpfC5{T?{Ult2;}J2NGl?QL-rA}xl=FNGa<9` zrX}fPf|CbFSFdW8rqwrh-J-PU4BjP(EV^p(-1u{%e16K#9N>&UwEeH>7ig;;$X@oq zv&?&*xHFIE5*#fE0o|h_y|G2~HG$OA_o;OFK9Lbj{a)%H&#UqB3nsbsdow-mqHOXK z{y=t9?|=VWC)OrjVdnOZBh5;7_mvsPC=VppV!)hW3TlLSY?2g!dlE@vo23xwSkP-p zVLbH0#_I5_6%@Z~SKFe4lPJe4SVdMqUM}J$g-8#7wx>@ozn|HAWI60oDa%NbUf_NB zvDVvdDxa5$OokUOa*M@Q_>4c(8gf9cO&WB%_JfaM|0oI@N^^Wdx%Da5P zr3hkvdwq8+!E>9qjMZ!v;AtCSj|(fVyvVzNW2n6(i~uV1qt`OI<3|CbD&* z3gL-ZLg8vuDaN5hy(5Ht9 z@bGrVK1uT;&J-aWS!23oC^8ViSAXGh8*#9r!cW21WROG$J z;*7#*fz6^{!qYpCtdA`f8grIaE90jLNoNCSaFe=r;P7o4$9>i_M`HCAYEvw0XYMAj zz%h*cK*NRXuX{F&$f(c0I&^RK^h!khfV7H#RE6&qxQWvPzT&~=xmUFIBBd%qm?zhy z;^h9m<%2J~n8=f+ds2I=GT3b0n)bbCrPMt3LTo;IhP+*_jpMg6%epmNq7cPO=zkQTl&BZm#+PiHrc(*{1d(t~c(dPR;nMWd z1-)SU{U;4Y$1$$50~8GOO6@6>#Naa^!b(_qXWe-0$C;`Pg+^W`T_0P;UycCHv+|d) zku}!`>BWExpqLrHEekGb>O=+j6 zZd?_YQL&q>(T%2;yCq@il@?+FSmjr9vQHFY!`y2TzD6Urybi`y-tsj{W-V7%G!R;T z=yuN%%qBsGdb#8*&#mN0zj?xsrv8QtZQyNhE3fk|5I3nNqgE#P_p^LSFuQDLQk?Dc z+{8qx*@@T_byC-NL@b^s31C%;s6DYyAsc(Ne)*hi}n^N{wn;?d-|5-iN(22G^$tY+wSkbX(busw*q^?r&_UBvZ;&anM^$ zqL7~`63~I4E3?4q*$P-0%%Q)s;Ykdk1Nf{f&vMXGZ-=%P!S+osPQ)#uSuw}yZvh;x z!>3i?+0 zSGCk}bb*dXJhx0_$&aZ%QktQvJUZrpjlX68h&@*VnzC-`k7p0`17Y}4)piWtv%N!B zXMWE*BJ|&%@;^rStt84>pvQ&)66w0l#wLmpCV4XQ*oRKF*@kBlM*8};dk6$i+K0X= zSoJQR5z=L8ieDV;lRiR`;^T@muAEZU8o~?U4ONR%{y;%eifUwoOgN*e%lXBOo#a(} zESy<6fqKbK9-Jh~jROc*1*aM?FoM=UI~x& zA)HZL%kwH+)Q63!r=N`5qB6@_en8Gs+z%?C0@i2cO_}83&fGl9?Jmht`;@#YZW?<3G0@r)BGUKV zqaP+*l9m9ZS9XD5vaX~VsyAqxM^lwY`4vYpk69@baWrQ4+Vc&g9uZk8+?fG5G=ax3 zlQ1jqUi8$}$HtiDJrBI{LD4`G;hrz>0Q!X!G-w7{TCYgSXAH+Ati~-q=McNlSx!;W zw@##rZVvBF7ox&2z*nd4*p_B=GSbc`ChupC;V_ZwTzD#yb^t>R!r7-un?KUgJ;YB<^mZI2Wnj%fjdFp2~PfEE#8*;aUJHPwP%P(%zjW(tEJb z)_rnB>qOc7+1L-tVCv&9nK(*o;Z7eJqokR)CjVR!eeVxk!W8SI6|zA3~10 z9Q`OJ?&3_97my@T$i1As6TT*efcF{mSYq|x#An;6 zuq3s=l6ptY48S<7ym-cWGFHVtlf_EF^MmZ*rg2DpgxjS_0I#1O=hd-~Q zO>W0>D->rGGG~;h;(3z4BGqJ$Kb==JN`CeYlPw^!icFzDOe}th2W{}}jO}Wh5Ex<9 zV*%v9jtAY?V7haOq}BVQ2cuD|WUw3#c!*hd=%e^Q5;wm7S;4!bD6l`LAyd}%WBSCB*2XF?#wGXjtMtK33NB$Ok=4g(n-T;_fy=oXBIm9N3eoj ztH~&7*$Pj&x?DcMt6G#O_Rie%k@qVY>YsmIG&Elr#O6@g8C~z&Hpk5X2Lv~)EesaZ zoVWa6Uoe|5yx?-_T9?8=@l$7E^FYl@LIW@&U?r#&E)x*TUFIEProeQ0zd>N)R;^lh z<(FO~Pou+EY0SBnIpy~g|HnU|DV74+fp~h^V?J*sYZU7L;FP^QYyDDMgDP5UmTR8g znxL-};hGab{uc$B2#OKGs(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRa5rb$FWRCwCln|X9y#eK)WznQuBzU{vEBulbo%e&=8wy^^QlavH<(kvtmp-t&R zXmXO$1e`!p2*lW_SsV%3v?0MM zv>8=nocfX$dm&@d^M%Olm=I$JubY?d!f9;Bub=)HfIPUXIN?{F{-N%i1n0H+24^(@ zEE}kcb7UR1jT1dSKF*%2v)RwCo0ksWmOvifT@>BEzO1XPE|&($$e2_)(wR^pUXePk z6u6QGeqa!b5!^V_S%+e|!&r>h}oH$`ZN*tb;6!$dP?9t`()4gviAfvVWb{41YD#{O*LjAr% zs6WwLRF;YWI}XgqS{o-N`I=P=vyZ(kfGpdbAD6Y+2O?t<7Lmt^a-48rOD^2s6z6iy z;;bBe_O2Zs43536-8ka;=tEi?cWuO&cOwGd#%}zij$osG`Y8`{$U`j%9g+uOYv#^8+5m~5y`W1uiC&}K>@ z&~tOXZmvk33?qZUH%KNK(hkc_boo=QDeIPN=DIHdz^ZM9>78YD@2-4wQKhU=mtp#y zO|k24S(v%!ZDCYz*;Zivp%Jb{nIxx+_Y~zv`+c?83-wg5sA1cLaVZ{5O7RCK#`$e4 z=4blu+~HZdNZ+)nCs+4JMp}w)J zAje4wG-Y^hUe;Q6+v4oE0botL_v!VAgGYPw5{+4*-qC1Xx@uwe-%lCHogKxrugs_N zk(nvAX^xDU2B4uOE?y``x)c}mgv02$Wo_wK-VBfjb`>Z5y3;?@=hZ@Y8Ze@a5jck$ z7h{Fyl=XPlqVFXIJ%9bY^pT?s@{Db{=)T?g=%bagMqQd?cD=RYpUAF`Q4BO%()`r~ zXOB%v@~2iV$gDfX&^_Mask;wXn+@ z|5_+dvG!~tS}(STL}Tf66Q!i6svqR)3%^!d4>iW_avR42;kG&)~iK0p1P!DnyY zR#>{>u>Xy`r|qUX;hjIhx%eyd(ofyfQJk@{FZkWwo~R|8X6pQj@xQ*IE&b!;*Uw(> zhXl&Zlp(-~&>ZI|ga(2Ep$3#Ppn=iE0B#MyF~E_sO1*Hvzi3B)@SnRq`S{hF@@sBy z_uhZ1KyGMD2iMO_|LnWxj=S*eM*EVPjn-4~1Ve8@CD$LSu3fe{zv{tVMF9XeF33E% zxWQSIOfvN4WqM0Ky6^6eV*NF9-B%XZ+t<4;3-X@k9ffGc{X2{G$G>YtAUALKSVft| zAV65al%&Akas-DnMA`ssWbZ-@5H?T=40d;ibGGyb*KOzye)`F$`+j@#w!-x*w&cg3 zaz?x`vu?U8E`E1&?B+U`qfpe?*b{v1Kv^vte5T%EU!PrPt+Q;xzW!*zfr`8Z08$qH zXjayGTnNIxeDsbUUwwMmZy!lzR&FU+hpKvWM^D(sII#Sz4Eh6&P5lw10XB8|;MPfI zl!Gc|0fG_gVyrOPwbqTZ=~0`}wy(CO51k5}o3|D&d#)#3+h35eY?|S{&GFAJpPzmN z03O&`9RK_7VDqbe(S-U8mmiuGKkw=}?sNBa6zBc6%ir8rl=hTyqWhf2*qncyohpnf zA(NAWRh6y>1B4*VNC@-=8jTJ^Ay7l=a#F$Dph^Ld+Mu_jG8+&0mu@&5{C9gH`sL-% z_TO~Z4)44-3gpIxnI9|}Z(r7!71ApjJlhj|^Y(Uc2>^Uyw%gsB75|h-G89T$v=^cq z0pOas?vBd5bCQ=N@YTAnhJr*5CDq-X^UZhSs@_^#Zco^<1so)rOLj> zuEXJ?yWW~2R;M3T^(lZjoPy!+wZB?kb; zS^VFoxMD*j4LVEey!&<*&jWx-asF^aidVy`!EP`5t8ecqB}WC~D>JhywF3aI!@vnB zD-EfEa->g77)~6pVuUC%IO3_gJ^AQ;PagCidbZc!ckPS$wO`oO|DL-#yoS-{nH1;W znwGYHNgUYcMSs#+m7fQIFVA%=Q&QqlH^p?mq};tF_2+AMmng=utvSVi3?dwWeN*f$5sQPCQ_?N$0Q0v?C(SKdNDYx>D zcJJ(w#(!>BDwvZIs~cRAE0#3&7S$E^?<_U}!1x&ZX+wf{MAD$UBLAYS%;cr5u4!`k z;~AGJuWZ=roBX;!s!}%^Q(M6Flz^`QhXeUg zBT@z@G9gg}q!J7ZCpt*Pj(x(Q2EwukbDC`|oakWTLM+$k)+fslSTZe+<%=?S z^xS%^T~dd&OX~2QCG}XgD2?e&76RXls8V)};8=KF_Z(`osU>B#6M(L=I_ut@#by9V z3)#4~&oD&NH)Ut`msD zk?Jl02a2Oaw5Bn}egpzap-vPd{V@RO3sjhmu?~Qc3)G}Ko4Ei`Z?j)H0-;nuF)|m7 z2*g)ti8L|>wSysxfFps1YcW)hv#5U6AQ>lIzR<3-BV1NpX%(%}hdwW5*wDTwK9AM>Ejl9Jby~5TrEd3-r4H zVEO!vas~SX02BkA@FG1I0Fr`syEdy3fKsRzj0hwb=()x6LT?@HTWA#e~bQ}s1MFv4=@c6DOZf`Fl zGQfMA9M~2C$9eU^VzXF_2f)Gf9KpB*ynz1tm;DWHUHHEgcg`ad*@!0+fzC0(5 z<~Sdk%drWsdJ>;|K8LE*C|3=f_-n*C13K~%%8^E$%}yNfX@EGi%`oagcc4w#5!9;{ zCi==G2Ky~SudoPO1HQtvfpw~wMO^@92g=wZN=S@TCKzz94Kaq2G+-du9H>OEMX8K{ z=Z{3VVq*?>ZY-d;tYGuu!B?rOvE^WZJw4H|{Kps|W)TvCu)m^)*{30}j6$2!s4A1S zSdlY2Yzz=-6Z`h=k_7-Zqbj4?3yab;52%dcgbDyi13n^ytoDet?YJdP= z0YOkp`-uRl3?AO>Vf*0_To9}gGGO9BEKabGcg4Ck&&OKguo>a!2dnUXGb~Rs0FpLU zV~j?X5Ka^jP}Lex+VBBK2>_A+X#Lt*&&mZEO(1DBFz9)P0eN6|DHcdflG4Bugo!bZ z9$!Nc&>v_>dF&QCaTl1= ztV4L=NQ9<1M@1T(jzb5d0l#AK{@HPStu2i}18dq#=ic&V zS2oAuPr4SZAMC$sw)^sp+X^2}b85JDUi!(w{sxCV^5MzxgKd`QMc^Z2F&qpOIHNZY!#DVNTLRb4O`{|=R&MpMv^5rwtT{qu{{ zSl*UKG19nxa{*89sg4L^(1yeqYrknh=Jcf5uhYcvnj%dq4H!|^X0RC$NFZY|lp+nr zPVGgZZ_t<(SiUfWCF3mYE=sK0=3&Rd5J{Jfnho0wofv~Q+=fKDH4JLDVnUpwBn>K3 zqarn`Rddp1!{hUurmVoNXJ#-zZQ-{)0q)vf#F2umNrrySmJahU8sGwOICcNO0Pzjx z833FU8e<%t6%CsaB2%lhbBo@v&CuH5%DJf_7nR))Nsj=3ed+HPn#3sjC#i$ z$Tgb_q7>>yG?04FN(prP3Q3zGPzH1g1~mu_7EN;So<;`%aBhQ*AD!O-aRM!o8u-$t z9CjWRz!?Krj8IXgIOag=EaLsX84mzV0F#p(&-4Yb8KJ8>xFIxs-c@H$FdknHhQFy=tU$5?7}pUx5kI3qMT41Iw{bBtkoK6>34gmJ)^ z2DfbW5aWc-QtkOP^Y8FL_kGP9HhHyTJg z3>9Ti3^YP@a+P)hhUY7&)klSOY5|?m2Arrj&S^{}gdLamztaGu4KO9e5o%zN!|ATH zpA-z#?ueuvw!bC83u7)JRgG!J07lg+?FXw81R&A|N{@CletL48K@wU6+SH=kmN+Y1 zGC5(!97rg2Rx1O`COpyQb)V8c3H9AWQi?SB_0u9*$!~{c%1FpqjGlD$;2LK#m zNLYY%)WRwf2(<6LfIw;Z5~xUxKp9Al z+9I`qR0cAth5JW)A+Xw|xOOviD)7)QB@X8u` zVCOgk#>Y9H>kY7De+XgIF;VH@!WbJ+9roIHK<&JiTlA)ktgr}i8|`17?Uu(3NUyKP zOKoObf*|bLR#^%|$C05jh$q;(x)Kno*`VHL}I-Nu;#zMj9;Ftm_L}q3s)WeLL zV1z=b;SU^1j5&|mF-0M5vCc6C5-2l6M#HOB35yVFgD^1vXA)v?RN$s-s;X7(o{5wO zHbX8huwzUEv#K&@47-~_K-OZ2Os$G#pTh1A7I=;c%Tc?H$OqiizP6ZB{J8pt!wI=?l}nNBj4 zd<~-k#%hIK*CHG&D}XR`?P+lF#APo6`ZoXurkL$AGRtqR+KiC1p{r z&SJY`0*4cv^?r6n(#IcZ69C}a?4o(&>=swh8U3NUzzfVGU+Vht4%ZzdS#!NW%3@`k z!E-F?N^rK_X4r2tI(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRa4$Vo&&RCwClTX~RORhj>N=bU@*+wOa>_jEdYIw1)OX%;bf-K0-n(zT_nu|` zc(2=rbf>e~3SU)Mb)9?9IrseT_x--#`ObZ0jKR?u5#ea

274dr^IBcR_wyX+wfj zU^6O5I1R=v_G-$awYku2nG#`pu3nhz#WA#ZuAlxA0C{j*e#%olmA(BL3C^qI4UcL7 zST;}>{Jx{>^aH51M3DGw-F79fy+2hw8pB#8k0Wy)@yEQ*+TV8&&5a^HO z0{y9hys}gX*im3k+Ipoe&TqeIN&1QR1R%@TXB*Ns`T7` zt~fq5`0Xv8l?nCr>-PEAqFtW6=gotTaZgj zMGY%Lm|thVd|XOgef7d>7~Rt8UAm^vzkevNcp^slz?8^WZ(NeP^Oyp%a#K!d10Lrr zxOS0ij-4>5^L_r~16hftv`{BDSr^{4B>mq<49K^;^2v%a z|C|lYT&YcKXv{1Cjnksy)qJQ6Q9;i*j9y;8DEZdW0P?`L{FGnyRQ3*fRq0MO5@n3Q zIaEW0zqX>D)UM zEq^!bY1UdVa;G#q=d4(ieDR0?xpA|1()z(*UGI>D-~_1*VsVD^=fv=J)pBb4sZE>GRrSCXI7#zdt?ysW@Vfkx4k!xq^lpCrnFN*jHBg$2l>4e`^87vVk@Rj>F*EtelRrjcrlB zdTNY+w$ho#E&o@2(ag!DrXcNb`VCiu~Y-rxc*fTdHM zNAEki?vld>WYs3`qTlwEe^4nKbWC$_^U@TSzm`Ksy@elj6+s*z1{e)!1u$OytBdf$ zjHLA}10Jcf>GhS1Q@f8Qq;Bo>98Ngrja>MJ{*pd3lUGrr4Vvpj@zf^g%Il6#{`>H~ zH*Cr+ThmwhPS(?QbDi+coZ_7K)rHCD?&`|Vd1cW5?e=})v~-fGGp9!X;o3#XpS*MZ z>|hV#D>GLH03$+clp_}y2nGZiP|AR6y@>(bs)1vG{Y8~{b$8|5EkpkQbbIpY%hzRZ zzpc~zt0M*E+C@qKnuW=qKl*`&b53cpFPPh8Jr|8J4CGY&`Mu>wmaos=^x(F<0Dx7C zQxA4DI=9E;41-yj+>j0Ly|XJ{f7Jr_t&V#88rNlh*3-Nz7p}N(Yrg)SbBzng4Vyhy zQlp`cYko)h5`TTHU0k2KK=W_-`ub%cg>0o z*_I>T5id!tp6!bBPHTw@*1z~^S{2ksFn}kQ}3{E&abmpTQ*_GP`G$^N!|zm z35$N*p0=JAg0LeSp17}~K6Ajcj~6m4H{`6nWxc*@U$BUA;JTAj81gmN4TX>fSl3el zw+?YfIUG_JAQ+)8!gAAHYjuN7kK2qkeQi;4?~#CW!^Yf2FYgN;8Oq5>I?3?i*68Q1 zJ3jds06efY-}1YDfBnwEa7ulO%fD@lo__gp?#p*|u@;Y0mj3MF1=YBrS$rMTM9k2@dZGFMg?OwR*cm4h^KKtVSXK&h+yY#NEynD!?EKdF8q$c~Tu{dEMBV*e842;Yn_xOyQ114E`s5?s1&VNNYEAH;fC&4` z>iAq}J~1I6MP(Kl17;M^6645+8cG3iK~M(A)JBJt(guAwRsYiN$|XB<>iN!W_`jF0 z%dGrXr+3PD{XgHH@Q+K0TN+)F$rm)X=hdb6ZOu0WKud)EtTD#BLTS)nl7ClJX8N*u zu4#7o({%!F8DJA}cqnpIY2 zVGXEXCT)6CN`q`gf9#e{Z~8$2DNEgCOf@^qP6$*K;BX)tXoSjOJPJ8~Rty)nC&pcH zds5)y_Qc5F*=MUN2&qcNU~frXI^5nA;XjDj zqzWa20bhUY_AMSQo97NT#rS5&A!K|ti-=|dfEaJ^P?-j;3=Dv2F^-Epk?a6UN%8n2m3kOZlfi~-=C9KXZ z#b8NqQJsAE)_m)g^WD8kL9aAM`Tk-lY|i=mqb&{-0Kx``uMvVi>6J8!QlALmg)u$k zp*IV4xj;8530Q(qZ!_#ID=-2wzOIJM7+@@4k{rK?yd*gS#uGbB`1)&EJhi6`pvp`4 zoLWDwr&P-f00;6DC|c7LVLt`|g+Ryhq5cE_4EicaM_3m?$oQ(Q&SowE)Z6SSM<9?2 z$cN^vaYLq}FfG(b8B`C3ECTlX8m`4qeg~r_EW*X@iGzaCQE%hywrI6fxY5J?Tk?3J z-^XnmJzTjqGXl!#&5?tWiz`^qL>$!Mu;<+vK}v%`Uw;q)t~)-ZT)|!dfV{6`UZ@w; z=InNDRw4j}KrbE_kc_VvD1#=gft14_h|upVq$~zs>Jk2EPYOJGS_3X_ucqSJ5DYC*j{dU3eO-AJLW8?c zwGSBYjFu`OPwuIVU0~km9ekA?&!HM-Y5`xg3m-z9H64oEYLjb^G6xf_544JgW@|;nhF_;=^6Zu|u!TNlA zBD5Km83EcDVOa! zi$8{KN|YbKH7!w&4>db)19q&CiQ80;Fq+UqIFV04S!+OP!)u8W03-p>`j2NlD;KBq zW$QB1Xuy~%76)+11Kov)FVQBYfh7o2BOLoG8iIf!Uqi|xm#NE_BvF(GPwXt=%C#9h zv9p9?ZM@}6lH+<93=k2l(3O|rL~}$rygG-!nn*I!9OqqMoR^R_Z|F@stS{z}YL2j< zj+6>)wmKFk-56zWjOig>pqr&O^H4ioPdkKH_lIbXa+Kuwg6vSNzpU^tYxbiMnh`>M zyt{xOo!NxAAe`M688>tsMxHu^6M`?!bM<{&^DA2;(Pv$Yo*!<%Y`*)(s!h4GlbjmA zvM~AVaC@V}9y@z_bWfDi#xViu_f5JY_4KNnGE9#O{L-%=WijmW6*xO`NS@qN83AM1 z3ZcQ1d&)R}W(@O^*0}W)$3jn?&E%oXbJ={?1MrIj>L-g+uOA>5=Osb_tH<5TG&|%} z6e2J{lmo6sC@PJpAPiL$7(YA^M!)gCvKsTAVUXs!Vq6Z1FxGkf;?%L(W*@}ZfeqAF zsFA2^GuRC9C6KZh3ZVvLM;0o>q&k)jE7b9{2rrl%puk$bIiLn-ijp1||cLw*~E0>vN(I z=%rNKdbcM8`YQ@?o55EGbcBRDEZ~+eNus5uMMmq9qBOW-?a-JUV+>$1LP?qYqytiC z5g)3U764!Zm>%bNanOg&2)*Tr3AG^gxIFOGo-(@gAwJulz=vuf(qC41Z79GKJ4@qk z{SAPqAi1xi{7DC-CBhQx2X&elz!{;@VHor^S|bdbv*Cmqq}!9YVr}N2*H`=@dsq)> z6c7L6X8^vbU=J%+LZ=38b~?} zC1sHJH3D_)D(#02h&JFv15r+s?;*KRzs~@q4KO3Y5oll-hhtr7KUD8vjF5ELu4yrz zn{*B-Ys@kRFsfQ<-&2+#0HHQe`cGGBAFVltkNO5bAnj)z2UHW)<=|joBwy$OgJv2N6`2?o^f2jA*1-#6;DBh^p;^ z5iAB+oDdTXF^dpk1cw7QBUnU;azfH#usKls5d@?Gl*UM#G{CN+n(@OOMfajv@%*F# z;&7aN&a`OLe!u$4a#EwGps+M;VbIr*(}0LzNN~Wl7;HwcYv2HYLkuwsutqJcB!NI{ za1bS1C1ZQ2qDfH8Y2v|;~W+NLji-T#dRjo2o2yXjfw@92qq^Y~KJw8GfU$&57#P@T+E(vWi@}ouNJW}tS(((6u+mS#|&M@_>&m zy8;NC-gZthyfDUUp~L=o4X7Swaf^#+2CZ&$7*L5@rpE!qm`&pKwL1yID@b7XH%(;ATUB^QUP%- zij<_`ql-TpKtxnS!B_gQz8E@|h**pTg3+Ey1tb@mxurlKKx%>!a)Cyrb|f+RvK=5o zE@`ozNd?4LW{wPTfEUCpLZA%--~7ou#9)+g)74Pb3Q!>+rGd?mi3)6)RAE+D=7e`T z03#r6F@y$?3b2ph?G6`s-X_aY{Th+i(o}6;!v$1SFh6cl!QtdZI1NMu>uPf7*UQ=` zC&P>Y;stuCHo)lm595Ht37KI0!gB4zYearm|2JT)nysQ1fk5Dl3?mE*g69Y-*qnwe zqFl_PtZT9DuAolAs3*p;qsvoSX|zrWrf(hfJG)5*#Ni~9afU)g!)So9YGK#42z!bO zpsE{V)SiS`_1lqz&0upFi&5U@v|BLRWpNBLpx2iebZu5jSd^)=Sa(FAFUHxx=jOyK z_zN`w0Ito>UD#kxa|N9+6sWU2-z=?2UEktx-9?hM)(a#oR%on4h*;CN3y**?hNzcd7mV02A%jQCTZ0r~m)}07*qoM6N<$f)7W-0{{R3 literal 0 HcmV?d00001 diff --git a/data/images/wifi2.png b/data/images/wifi2.png new file mode 100644 index 0000000000000000000000000000000000000000..07dd889bf8ad81698cb93d7516728e4ebe1a848d GIT binary patch literal 5110 zcmWky1yoaQ7#=7{E5fLOf^;LJLt(%qC(<>M1_cQTX%Gy{rUx$7Dg*#W)yd9T+0Tj9h{d4HX6-h{>UuoaM*%9&h5i$5h zE762<9C0nRtI{)4>BlqD1v7~5;Pt#HTmGrrUlqv6z83M3Eys7BylnI-3)qoYM{UUl zHt>Cb=ep#|o@Kqe$w}_M@L%`ZxthPYkS79lUQLEDID4s$&Wk0`?0LMMh&M?_8th!V zp@TON4$Cn!rfTy6C8)Z_q<*Q_^f$(PLERI-4?cl7nl;Xi9l=pKFfw&PN^~;3XeiNy zsY=~mpwzZvq{Y|(ayC2Xgs;x`bUm-7>ye!s8M`vDuu*3>PjSSX8Zy*jI;%_hYyL~J zH53Vw1sf zbFWwz;ou2}oP7@U@xt+sZ?2}23-O54!o+CXG#muJz0;jB!9k{2mOnLnD0D#zGe?@8 zM7@7uL|p<+^xBV0+{F@^n3m9D@zG|w1z`f$zd%zqTu=KeA~o*1lc-5cxbD5c(k5-7 zvXKsp4+2Lu3u3P~A7iCB^J6YgGHmxf9l}(Ji@IW zZ3}rkj)@Q@j=Nn&qpctPHpCNN{9gC4$- zwzLQ%TjCVE50QFP5LVPwp@5J^bJMKPrLe0r0!0Z0`zKjkPH}yY=xQJr;*fAT1`}^D zT4cQM3$2pvu;~MSs1#)n?4NGDyp1g*bvMQ%jXC4AKbOjN=}AesXns~hMSfC4H4cCF z#`4z0kq+k!jsBp5zJOhNgbuN=VTIpos5xo_74WCIi=bq;&m*QmqB2_1g)Qs{eQK^i zRQZ-EjoyiA*t44ND2FtBZXzbaN|C>yJ@(vb3%vsQ+B~%0$dTqU2YhYQd`nt>FJq`ZPmzW_2gG~j z#f9P9L?;?uI=#veb-@^Vegx8l)a+PC0|`8#2|6OhD>J z#^DHTQ`*y7Y|Q3>hiaARbPr8!Aa_;Pr2sl|;rsW&Ed%<#JzER$zQPQg$&Fp?WCxg> z&xWWWC!VGMJBss!2p@s;vuxI%toxRfsS5Ref^hmBQ#{~z(n__rg0$VAe^PSqvlY$f zALgviXJ4>7{McZVXG%y-_J&YJpucrrl2;{aQJ+qXLVrBlT)yi}-ZNC{g!f=~RoZF$ zO*gdtqSaF?I-8M9=*zCUxCYg92g;YYa)?jvM7>&5N>78m2nADS45_W>=rE{=;IY~D z3AtFWhhI+yl!)9s`Eub^Q-iuZm61G{RxyY!u?YXIUr8ct^S0O_??{M)@$@6owvww^ z!)NT~N^$@{%wp?y+DX<`_N*Ko7OjA@XE%PaN&z49_u^;ix(setXei%&A_MbgZwcFUIZ`RHnOm$uEP@K$GVu0Hu7b1-(RUm4269GLt z0`T|4=^F>f442T{2yBo`!o|?eP^6tN>oQ;2P{e4W$8bk1VR3k2!HRn1_e&Sbvs~-% z33|;M1uvJMl8*QCJ15`{=H&@+l_Y(3Nj;Jkn8@&p-}mBU#6K_+9myDpH@T) z^!+vbYV7cieE6*s8~L$mSmDkDnrfcG$mz?j$NwfKY~1m=XLzdIdDTT} z+qu2`J7^KAO+&xbrC$inLrbQDQS#wx8ocrbW|=`A`o4#&ON*fg0iB}xiU#0YG4W_o z*Wn(omYf^Q{X{0RD)qmz>Gi1(jP)ZaGua1}WAT$6MR)W-gU=lo`SN>H<8CVYG^y}j zYV7*~g=x$Y0ts{6!!5?Kvexv{jx;NO^hEqy!)Of{>XJthYsEpqo7H5W97Vmwa#h6i zWSAbB9mAfVSXMZb^^@gUap9WU`;KqfcFo1^L0pUPGsW3ZEWb9YM2B7O1?i{0o8-E_eA&8L zMbh^N`O4S-ZO|r_>$vJ~H}$7TpJA;qd!B!EoVlL(!4Gp_UXiq^g-&i8kx3rhO1$P} zWwopKE#Mx*7K>!bkrqk?=^{v_C8+r+nf2;hf@cZs5;X?KvE^+oX$dix^H!dZH?wn$ z!s=4^rU=j<;f~;qfr>~)c9Tw6e17lh;^&c$n}M72V}p45-`E>@x}_5W0^B?G=fXwS z&H%UM@iY8vRGJ)Ccj@J2!+c~REjqD!owcb0O!rHS?U_C?Wa;WgwQ2FsONLp5Q0TgER!)86;;hMgJUoB_I$gpu)bjA3UM){>hfg;2mV z%6-jb)LF9^z}U1NQ?gYXQx!e-`5g@Uk)WZH_}IuTZndU1-b*s|{rKbX)BL@l%(d;b zY)AY}!C0>gRFK1owp6^TFD^FdRcl*(t6R#2<2Q5gGGY)rJCbv?QeofzQ z$!{EB%NDjunYr~{_dK#}Vm}}4u^kI&aNqi@A;MF=c{f-+dKgQb1pKj9c5N3C(CExa z9;=)&9jRB~SI39!xSkc|!q6f&;&l*L;m9zF(3gAos(X~;xs&-LxHe&6&>X>ij?SFi z-5=s@_x zm?xJDe`t&>>X5HFl-z?A27-Fg8`r|WexTL zJZ~L8Y8J63S)sq_0YGijjo35yp|2nz)s%9>e9N52qt`4kK=Tk44?)^1>+R~d!huik z_!z9e(~w*#fr6U-0&cBa%H$Y{^`-ca3~>0$v374R3k1^5&Mu$1=&AT=7o#5+W-`jz z(kGFH!S=Qb^!We^p+<~3z$l2$gc<%Zti09AMCK|kP~SoDMdF}mXT3Gvgf7>M z;J%(J+tK~IphagYwt84BeE_L^RS>K`Eho?@AkfqM)l_epOO@!gw$=&$w3^-)51`}8<3EbAglbT4iNSHK$ckK8b&MQlfk8Pw zuAMYI^o)KIYfDy**p3FgLPf*;RkaaKUM`@aYuh)VGaM0IY5_fWDzX7|_sQU1o*K zxNcMA{Yz6KtK#Q@|21AU0&Z;Y=Hg28{CRtA-ek^R zM=gs@k$CunZkCZy!lkVQvSDp0uK{w9)K=m>rdPp5d21^Yg)ZJ*7*R{%U^0zZY> zT=W5L@>r!4aJS|WLF8^(&(;%Gpm`NI{P4#f5A7kAV7!OgCvL{GW#GBln3$%Ad~>hz z=mAj^oxa^Kkh4t+*Cq&SG#~&i(q2%TdYl-!a|a*$+&Y=6F%T6Ds^a?O=)lI!-kZ7< z!*xA$J@H%?ZQf|or}NmycDEcE&CIzq0Z)P|slf-`pRrD{v zh1PJU|0$I0Vpon$A^L?`BUV6NFXajkqhtxEW?=!?FUeb!d|yPG<2!8}?#T|^o?>}q z0P*G#rwM(bu=FZCsEIA;@Gjc`K5dteoIkIkwIgL4&|1xN(!3Csw&+PdIz=K{x``hB zZFquNdxOpZ@hrps1nW*9UpGaKGs&Bb_i{J5BT}rHJ$201H;xkvN52?yymok)~AsE%r}$g?v}V7!_Or!~-hb_BWZxBt<-{=QMX$V-x{diTjgCXu`tB5|dJ5WJJUW2akrIB?){GHzyTqCR+EbQg;CC z0cjvTtEnmOPHxi*$qy>hnC*a4Q5UIU-WXFpoKyJUDaN~RUg^u;l zqM9WmI@PXyC+(R^r{!jZ3<@wJ#@38bW&>p_bZ~o$B=J86(3aT>Hi`Jy#&^s7UEYDg zxHPYVXF87bM};PPAIt@9cdrbY7%bP1xG-|%)qDFa!2S9FqRYjiYC=8?$P?tr8S?)6 z6vz5n{Hy(IYFh}9@>BMX^3th&9e#@7#n^+O5IV_i4O41s(Kf-+M z{Al}taSQ*ZM9CiuUg&gpTc_ZUU+MdMOGN$KtR(3#ZIbccHbG!;c%#2rR@8m$tn`t5 zZRRfx?0FNsa|lF2i9jX8V)R}{)kHOA;3!-G^ju?O)=012GJrG6zLDZY#XS6t_bo5ZzDJjCBSCnt6S;W6&Pl^}+V*{@ zAX;*s>8rSj3jfp7bow;94|7hp*P0sBoWAY%8av^scQQ1Ag9L^~@~XboNB}{`ZO-bH z;%+k1rK%E1L+DHX9Z&LMZB^0TRqm{j6E4b#vMmGIDut$hnOQiq@SdK+Qlc&l)(9E8 zT9dJ*(`KgwRBCcU_UO5bwHpo3d>45ofI&*GYy6iklsoiHAJ&-hU~WWr&0cwfG1E=` zeYM1{=R(M!3^n>turP#+sOM$Wu9+F7tW-UQWVHA75l{^vByqc2{#8u-YV<@Yc^EFC z$%k5@dLe!CVS|o$Yo?*~BBe3n7xcu>@^4enU;73<-2AK+H64Nv1>~l4Rp{?uOoRZs zs~%`;rn(fCM*OqCGTW$^sd}uk1J*-Zz8pZ@P1KNcb9@9ND-P!y8t3$)a|5CT-9&lT z+1y?3_F1rMI!@QcH<|=syFN{q9HoxvgE9F&m+>OfbFD2JkEX&xV3a6^ieC|1mP}>? ziLr5{MOrug^juI7e-*+4yKMKXUyfBUV5-}m!CI_aG65Z}iK(Dp`CM+E%wK(|%9O4D z=uXEEA9^5uw^!(wzIh=&!(#qNqD;gk2?u|f0QkYwVIk|)$&Su$W*wJ+l*1}98gD;; z=u^R~nm?Od;GTM}dFp&GwtlY~4RnI6Z8vjXLowdh$nFr|?!I4kslypn$K?5bO{Eq! z*Jvkv+3HBXZW+J8`6p zjKuHLAK&{t9{2b@?!Mp8`~7~sp07`|E<%Hf97+y>K&T#Qs_BDO4P0`h#Ncz;j+GrO zWS*L)&ma&A`hOPz$9JQ(p%H3FLu5UWG#-XIEg|hCqDpLLfUf5QuCB1aiY8 z*}6|10->*Ypr&m2d~P8t$k4#QVZa`VeBz|zQF8eC#BVxhDF}|QluYo2KjyrxrzE7H zRbf(Yr$@^eyi$AI^{Pr}jiOy^yKK*A`stHw1RLgd3S|{D`!zC6&cwtBr5BUa&k%^w zRsT`0SERxF9DD`NjB7EOzdzPrk!?jR@24y;{b@bf_h*1GoY>Q>1-7aNUg*GOJ~#F6 zo11*8(RTftC)((l<3iQuixeMR-eO2@lu8-YSXfgOV*hzubaufF5%``MlB(Nv>s?fs zzJ_XPAuXFkQGEZT9rRGpRJhSI9&M!HVN4OQ7iFG(R8Mq(D3S2WGcd_D8k>1!2InXi_Fut zlMX+n{uV@F(aU)oyjgp9_g}9N#`!9#uez=-4}}Vn>^7k_tPWi>#29M$nR}(SMO}xE z=AdshMSN3HlU%~lf;YuUZ;#$NA)4{UG+~7PJqg!6TCbyP0*HZ6-$vh@+ z^iXs8s*Gf+ByIW}E};&E6;ax0XBISxIobS{v0g@QnJ&K#{A?SUvpc)RFiB#$CeEEF z|DEn-=5*(cFA^}-r27oTj1!ub>)EE%?=FX~$!w!@waSjIV+CyUVOZVm4$R#GH~NYa z*q>~gLEr44OcdM`!?Pr@nl0rum~3{{=PXZEl-7MAXmsy8UCQU0J1Ka&Jb4`N=scbw z?MXwjbc19{qZF>?@~y>yZ<~Wt>-rG$hdA%zXaU=w-bBMC(g&yj_HE;WecV1nNK0|< zOkbKQ|cvkU@z3UCZPs4T;N`7LBc@Lhash);_jjAupz0$U03<^+}36Hu(?n)RJ zfOcDMQNP56O05Qwqg1?lMHCv!(X1IR$ps@4FpL|Isr9gMp)Nne85_2vs%%TT!)jm_ zJcpW#fb$!d_htcj+LIgZsq1tT-`>s=fOd-6q^x1>@)R6oD6f}ZFXrzU2 z_Zj)%u!zMV-q&JKOQ^&gRA6>W<@ZLw`_fF2jY0FgL029{E#!(cXoWwL>M~0sidtxS|+J%1JgK_uByZCDJiytBc zXR}ksZMOH^GlFrr$$F$(wI!p69Wi$df1CbbGT|NAPHyO~FZo!9z5spv^mr8iyXyu+ zD;3maWQ@XgTFh-$TODo1xr!}g0wc{d+m~@)bl%%|#pMO;$qDfqeG0GrB3z8VD?KG4 zuA}hYgN4|zq$NJ%EqB;%WgCx$b*>Xk3`oYKTi491Mz8&fbz zWBY!jH)}`Fh*fpP%pU||cqT-Da%kW;(2ZTw$4l}AgMOsiB}~KNCKH`KFJD|QHDW)r zB6DrO*ffaQw%yBz4T+tjwT$L)YCc(6n1vUJ)yzM>rQvtHu(pl&Jc`glxk#s=cfK{# z8ODQtTXoT;-201ohUrlW*bMg@{x-uda*aj1Sd{`@&=F5=%$!!KGwDT1!w5+%?ba*_ zXWjW)3w{0b z3x*xc46%8-l-VQIr}@7w`ydZ}M5X3P!Je)v^f?#9hB`Lt=!nS}KV}%>s}}GKOCxSP ziftVHt!&*XrWM_}%}z`}(!3lg{pJQeR9-4>F!2>h{v?jmWA7<0uDr1MnVS(3dR49^ znjl(^cB5v|G@=L)o*HUISrkP4=*tu$aC^#&!>L_A$9lTqir%>Nrip2Ov>OCt9QhYv z+s~DLx*kMSJHsWM^CEtas)fLNu9vYVb6DuF=Xii3V^PuFf!$WG8p}7NEu$}aGG_5w zY^eK^!Z|Z{{u-DlA^iOw0gW;c43{ITdQQmKPUmfTE6x1g2dY)VX0lPz^tX-&U@vM* z%+BOB7T@jU=HEm0rjP6bp;A{NV!`-E)ApG4DeJEfZLH)?cV3AcolQF>SCPlRY*anf zF;O~b$BIAu;+8O{WbY(H*y4YE{w*0Ikmt71ryhdikcak(mV%YBUBhVMj_&Tv6F904 z==EN!PeI(oFtZw?o{7sQa%p=v_dQS?J~^zku}RZh{$2VV(WQr04yE+4vY2|OnPhwHO~Y*$H}_iuOMAPyx?j0;G(9#HW3gD! ze&IlA-ogG2Khj?N<_8~%X~}~o{>9FnK=yqfKYR7FaH0dAbTQ24rGsoyTK1Zypg%pE;R!9)fM z;|kc2U_EvwQqg*^iyGeL_Xj6n3|_5nI$;gj&KwZX7t*#k8)wS9Y+1Bd+UH%6zJx&z z=+@EeR|F&L5Tp0_+OP@Xux~6e$ctEg4cj8LKiJ#^B5l-D7!TznF*LKnp@%J$!AEQP z!AHBraakE$eR4?lffjB`rMe}T<8f*!l>}Y6sct)A4`(1r zR+I0O-mbDdzpp|Rq*GdWw>>u0{QCfV2&~KH&fUy}#R)X}ksAOde-k zZfe1i%m=V(b%w(-yq~}7wWbJB&z9InHoq`_5k|jn(ISqC6HGds*PWaOqG_Ug`eK{KU$>Kd|iS3E1W`;GNx~0Iks*#2GRe> z8Xt6fL}p;gs}vb)T}PH?dapNi=<=qXCe;k9POu`x=CM4-Z}M?wmtHh1ykN+;PN)`r zp`l-KbqLyc(AQ#-RF~|NBPDP~+}?Gu@Y${LBlXWJrG-f*ect~69Tev{^rwlP9uF}1 z)n9+!$D&z(@Vs1A#kt(3u1kYK50Fki>}!ULUG+jYS1mffzMSJlxa#Tf6nmS=Xat)o z0J>V8&r2y*+lm9%yn971@6LA5-Xa$euKXpP^J6ze7&ny%YtQbgvxAzyeGu{?x_zmi z1uY8|HLlr+SHiNKO$f@z-5Aw>-df1QbmjYg`taVjr0z0rRi=uPq>#`Kfr+Mw5I|+H zqC|4|aao*%RfW^pM9$(eltMFCBhWPyRh}7~)(wVlb1(i!v@$1*OSxH+RINalA26Md zo;Ta%3v*6@RrCTzOU$NfTw2@eI37w??Am3Eqp_&GCooOoK0C1+6*an|U1I|G6P~qnao<4PyS4D@w@m zZhgkTraBIhdCjc2k7gONz4oB~U=;LeLZrcN&Vkk=cJF91A~vjnG-D`Y)p%e*TDlAo zP&5$V)F*RhwawQ^RP!nN!rNAIo<&d1Ha@fOz6)f2??0KRw~WjJ`0G!Meni?0ubC<0 zJ}XmF5{MeVHkK?ul9--7O_oQjCV43;`{e6nWdF-6iQQp>%|n(RDaZ_C!C4ri(+Aq% z*3>fWM21y==UN9fM6+V6NB`q^Ak;kT!BP+I6iScjlJc^0D{Xt+)ZMN8ouju5$h9>k z=5eL14>K4=qp3p^vp<`>$y%Z%n?|=5&TD58dx?4MA~9{3Z~OdytYw>JfSOLA5Y za|v!wohR+1`&on4xKLD5GUZ2 z2?m>8Lu%?~Fh_9#@(FF%)uj-@b+@+7SV0q82>4^Fhk{hSS{UB$d% zNO|wLXWz6qKjxQ#U(p*~Nz@MZS_pM>=cPBEI+Q|NjT76f<_XV2Y@b1~I15)Hx z{fl%V@%T??qQ$~7H8mA7$*h5q00X@02vtrZL07fS%IkatL@ShjDRZVj+u;5k_TE#sQS zofT}yocOC32m*}-|78~%HV^15=UZ!@7#LdNf>^IEUR}Q;Z^(~yEDoM%&+al5>;3ID z0D%ymm`c32y-dgYlI&h%!*#U(tO{l6BEU2BI^C7;Lg+?av^GdyTZ;HsVAY$MT zSGux$t7fTb-Q*P3zHNV(-E z#-WUwW`x$XP+dF57@(%8hQtZpwI+>j4@I(-o?(LQ z=3Db5>4c|?eUM8}o>vJ9R4XUO*G_-xuZ#c(|14jrba~{WbQUQTiUdH1Xwb$j^V;ah zC(wwJc(z$~za?g8$s!dqCk3c?AV+u5PImxz2x>IQ?HvHs`lbche?h0D92wy++w#j# zLmJ>3t5*z=Hz-l~D*CgeyHeQG#vK9F!K;5!%ri{|Okj!? z*@OBJxvK$WhQ211`3DbZQPFF@dvY?|e{B#X|Fs_D-7ccN;<(^@8&ANEfg8WWWO1Ad z+vuM={N^+?aC~p-SLqyT=nc*w*6zdT$Ge>vJME&Bshyy_{{T)c9Z#=^-}Uu0=dMM4 zWHII(kbCDnEwiliC2!>$RY(x*RVMGZ+((p)H?9-L0WdyZq_$mZx(2dQ6^*pLdnH%m zR?^*Lg1(4WNpvniW<2~`k`=QtCx{;Yb(h2UAI}l7H{YSvyFaOl-g>(>Ptgp_kfIFt zJ8U#E#r6m3?Vjn!&ylgZ+b+A+^t&GPpih0r#4P0P!nh{>yKnh(PXOcrRq>%r7I2<% zvIbRbU+4~)fS%6j=xj8S%tiFk9PYiDzh>&bD(kWL+9g)P4@mn>M^Rph)kI za`h(EQMC^hMkH%hL5lGR;hAr4>i4jAS{*4hvdXf>pIbVWC+6VkZm=F}CINv@0HG?n zKJH>2?h!ENZV~#?WkvoMFNa}Qt)*-D0t~)Gn*@l_dithJ09yGHZ7o&{@=7FA&ItuL z^$_nHx_bJB=ra6>BG~;6YPn%tecGvkJSL%~Xb_m6I8bG|f>V+fcM6BB9J$8k%w8vW zgbx1cg*Aw&+7#uct3BGGm6L&1AT^R}Bb$)|Ort4Fm@II*WdJwFuz=L{&e7LmV@~~Y t2EMzo)qLldHE(_`g8%^e{{R4h=>PzAFaQARU;qF*m;eA5Z<1fd zMgRa7Gf6~2RCwCldwG;x)p_UdyUTm8mRD81tEHCEj?`!~U?3U1jy<-sIKgp-05-N|1ZWUiT8$*Et<_R5>Z*FR zz2z?RM^(345{(2XJu&y3I;YRAcW=G#cfaNLecx@e*5dUHBEst(5ALowdu#fO2dnBs z+E@~tVuw+~<20U;?76(8XUd7)Imcs%u3MQK#u*$Z%1{3u0C`|{WzJ8A!owp)1 zbnZw)zkOd-omWrn*$r(M1%ZYI;HC(3vf{|xjJUVcVc)vxoZQ$O3XoHc`*&3q?yjic ztH$Pc%CUL>SVc>n08R>6T#(Ps%kaDJSY7zR8v>9Uwv;*w4*T82+O#AJI8l)k4sI>R z2f9;S-My}$CZGNC&VY)sS(jK`K3Gitv{ct_5?kbbrWP0EBTKXL=4)2?W53BxwXktC zdiFp`E#-nhfF*))IVsDg*%G&PValEqTVwR>UBYE&I&39jzj3k@@QU` ze{F7x-+A*n`SCC93}i7ew{9MdZYl=``5eRf-R}A?tSQ{_hKn))@YUUwB`-`QmxkJY zWVou<)@ugRBP?%oHl3Xp*Il==X+|3cf-5#2iM~2f(L9?bTr|h~%fE*s zEob{@PaST2y%ZSM+b+uIcf0Spxj*--*96GzJA!k!jK`aYClmxHC~c9>F#O@-H2!5M zL?trl%klkb&VDd2!=GHgD*xzfr0%J~K;LtuuHJ8~O(}y+Lxa_0gCw$3IgOuTn3oa1 z>Q1po7G(HeU%AZJ0C4@55;wqxtz*&km8wDBXIRnh-hAJ=g$)33^9!Z*Pme^mH5wL6 zyX3YDI-R$FYPmo0ssXw8#ma9#eklB9xoY5N2z^)Iv0H&_F4fEZv6 zU^KvZ^V8<>>Vlknf&mY=IrPH%Rr!Oj$E5BY2wYBh*Nf%k<0EzRwqix6tg+~B6SWJv z+^cUoC-*-lpS^8+`O1w)!oMs9#_4Vo!Q1Az@B7Tk+>`eXRu(@y9{p_ZXwp~6G5xl= zsXxB4Klj5E@3mmQK>~jahOLtC0 z|F|bmk9~S`>F&D*f_J=DKyK{MMc1#){rxvD>Uh`rUCsxVbjc@EX@;?~&OCLv@$d~> zN_RZ4yCMMKmR0!&)^)mfXEF@qC6(J+O76dBu+o0b3jf#Z+MVltpGBp>@WFC&^H+9N z+E4tg83DO%N5JaZt^)x=0t+$%dus_?&X5=ju$iL^F+ey#J+jy{5}&3yytOy=(VNc6Jpuq<+g0iL`AD>7|9CQ|Jxm)8Lud3 zL5CQ*pvyb^zc0_0PpKjEGlDg=X$J#@AS_M`j7J7tE<-ueQ|5A7NSQxn*_!I~Vpimvt3{3Mv*)k49g;YaqA~06w|g zA6Zrqf052Gl&eMzl#^Qk;F=Zw&Sh=#Va5rEE4rr~o2yRCWMX5x%aP3!0Lg%yWH?aM zNDD$GHh8UkjHa1XEi~ADBwo8WNN)N0Nc5vW{ngPY?$}$8i{C_R*#l}Qg3{~~T_wTA)3;^>|{2QHF-iR9(dxGST9(t*o zIVB*Wwo4kyxB%e044iaU2uWgbG|+7?m6G3i;!ybD(_`VjYo9MY z{K?G|Z~5|I(0QtT=B4=87v|(Y69@JM$$uDXsE-4{)hqn^f~@$KpJk?0)&Ab9{)312 zRLSGm-kaq=1QCul^f~3kzW0=X)U@rl7R+j(C(Thw473I^f}kzV=$LL&+E^SZ>-MJ) zh9BEs)=v$Tl7IU2=HmJ<4g}}VwEps?+34)N*wE>VVx?-Zx1z83%C1T`0Q7k5?>f_b zFi{pGb@iWX+RndnnQyyY{#f2;I;dH8pswF?N3CR zAZl2It&fVEj`Wp=Ibls4HtQhN(i|aya$RF^B))LR(fGDsjzo`M`+VuXnfAMGW$qUX z^WtA!hcH}GD<@*}9|7RXW&ZeCS+UV^3F8gDu%YeB7EnLVIrNfJ7NyXiLW3$3RWc&4=#qK1W( zbljRn-4ap~qQtcChj;Y2#|}VS{9-)9BYSGt zH2Uc*A?Oc+x#aYbpICcaH{%lhb?|EztfB3U; z{MGI%LIb?NFNMVgi6pkL8c1gdpIVlI#|Tf2Mfm8`6ZlV$kKxiM#_+jqWdw=AycEZW zmt-JB)4Zm~YhSRTQ#t4kmp$dD2})UvN9MNx;HGo(+868>08oicI!Me40LTd1<2$TQ z0IIQBH6tL!$gI#7UB&=;mq8F=B+|%BhDaG$3-q-KTr#(*8TSlS@ch0IN?Vlc8sFVf z#p6dp06@3LK?Fpx#qu_ZWxhl)HrVh&8H0yoB#A{7TRgVAfx8AONG$NyZWoRuz#Q{C z1i+VU$Eg6RYg@`nmMCS>NbLN{d6(0#g#eTRPpn-80ArysS;|hVAuR|8>be=)rwx};>~K1z z$rL23a7IV0#oWYL@1Z?adHK?8;xKA30*tk&DBIgI8C%n+1AwyNGXhdk=Bzks`il8! zfupej2naP0MHbR&IytX(!YTn4=OrFEzin!dok4YfQB)EHkP*nB>*S_V9YTpuzpqET(!BVtO2ZT zVsVlW`P!bU7b(nB%0ddlT#sWkG!O(#LPy_ZE|1<0 zfjEBUOgIWH-nlG||FR&B-IWB79SV>4s21=9s}5FFaw%31ZW&j9rFScfH^eo;#YLJH=5~7B836 zNe9?85@FMk2+COWWH_$v&*Op)iOZK|ao6+ZIq-cQ#F>jNwZ&Jh?8rI zG_TrnqQ1l6Fd$MuUNTe@1J)`k=hGa$T^tQ%vA>v10X4NTYi7m(V5WtPIJD?02;8(f zj|)2__EZ$^*dAc#p%@vT&6o{43`3ZOanc(EiCGp$OEJxU|u%=}Sk;UAs#FDH)IWaiWFkrl?Row-F4d*t&_~~ebtDh@j z*GSyd40CdpYz@E#;Bp%I{{l#8vC;zIoY3WQ4Al)BMo4V4(hdMp5(bVY*j`SM;)Ktx z%3*$|fRqFw2p2C&;qz;9NOQuE4~MAK^^~T3Vnr6`{lf)-N+XDbh0P`~(zZ#F=Fv4&{ALl0=2iQCm;WMU$OXsCh!#n<5wuym&aCBA1*KglKj0 zT1=L4;7D0xNSzjyfZNJ{Y?F=`Jx=vm2PD#VsW#x&06CYTt}QB&L9Ac7(oP)5Wv(Y* zs%Z))Bp~Fg>t9%7!HLFFoT{@PWy*; zo^=gr7%a3Fu)0}kKh#hl0Ew~C=2WfmGXQ`&hJ-PIu}xOnmty4)%um}{2P9UeV6=sF z2#*hkczig-oD4^xnpy7j_T@=$XJ$TT+Y;7JTR3?QW^$f0fQzQ@k&NJqCQEh%;ermQ zI$K&f1<1Ge)!k}h+KDx4CH6^)@Rpbe(xlm!md^n&l~tNE8L%v5F#5SQb; zclD*Zjz-NRD=UMcs>a%a#CT+&`T$QbWI5nV28R(Gb}XlNi6JckIZd#-0%BvpK`;Ok z+bly?mBo=*Bi0s5ADfT0MWg{`%#>!u%AzkXe`~QXI&q4s`xyh|!Ix@m>qPwL`vTS5 znc^sTgbZis^cWUpI3xiRF@tW|bul(bED&jfPyuyi5NQi#&=k^GC~cvVV|0HqBL-_; zs+$bqQ=S|`UD(39fWG!|j!ff&M} z<3j1AV2rg)haLM4Xg0IBq}SzSg(RdL3|zh3ugw}DW1;R*#x9qFAe`n=Ne!f1h2U6Q zq|&VQ-Ruq_fE;Jzv-Nwd)w9Ti%63j?qE-VL!I0(*kp^b@!tzukas`1Ain9ucFUhMb z%NaX9ih81H3XwLi>c-HSL_{(c3r2@#6_9dbm(*i(l2a3mP>v14R!d^m@o2Uu$~nn~ zW)+Y~+r=uuNm`JWgxFZbk^MK*5Q}NV%`{EbXh0``QWg$FF(t5bR*6|d+chUD03)Cv z84?R94LGmibSHZ@$I)^$ZzJ+nm}>p5SYUdcm~p`6gksz*EYBpgwZ~|A^KT2rn$apH2?PRXWEo*x5CT_F)!{TDiOOk7 zC10|=zMuiYXeiCGZ!pj$WsS)TX6~H!e|ED9h|5XkG7Qzwz#4$DW?|QtghRFFHK55h z!ldw%?S`zw;BZ*UsN!%sC>R}(9ODcajuggyht;!^ifxkZ@dS>fIUD=v;!KEtr$YdM z@32c(b~t^$pfwY*etQtvwV^WYJuWwcq*!meKvuGv!w|TVhSQwwa2O6aj1KOrsC^lS rlAK^s!C}RWpyE}_{W^X_$Nw7uzpD{{cYu}h00000NkvXXu0mjfQo0m+ literal 0 HcmV?d00001 diff --git a/data/images/wifi4.png b/data/images/wifi4.png new file mode 100644 index 0000000000000000000000000000000000000000..725219c60de58a88f82779b1b00ae20b9dacf7bb GIT binary patch literal 5037 zcmWldcQl({9L7`Hswzs5+SF>y+CL-qh^_V>p|qux+LYRx*by~q)Fu@wcBxo3+8|P+ zYSw7YDr)ri_K)|y=j7aT-;;Zv@AG`VH__NooBAfpO%Mn~tpnFE0Y(krQM_>-crPN@ zIDmoj8Ql6g2t)<`_gn#?U)=$IqhZpe-j5NFD_O zLA)~^@me4dSW-tr)huXsz97`h)Utcf#lyqh&A_|zu=_ZGSok$mVY@-PFn_L^j9c|e z{mH#DM16v$rrBQP1d$?oLTH()3%*(N(~n4cTv=}^;oP^E)OnR2slvrg8TseQww!=~ zyL<8TgnML*XM;NTkEWBh8-IDHLXy`l4j_o}kP@Q!jY)Bo$tc1(HSf!mzT<>v zR`=f)a*3%SpO1gvjW64_jq;v9c3@mAlg1ctTj@jHGF+KhBs~2tXRZ&)2wiyPs@vci z4fIER;fJ&eYa5<<=kq36d;P2y^5J`->Hk&uY>NEqS;P=p5ke>1bg{yHezy=Q^JCMg ztFG_#E-x)%RZ1;5;vC(Bp}S2n>SmNPoc1F};;{=+DyMFV#cb z_F5>|2x2BI@Jm0Q8BX+slP+CyzkF|zbJ=X8Fp{nH+)S1Pi6 ztex}h#+dv472%oINq(l!SA;-s zs-cO7I)S)IobxZI7g^qeB~Bf82ZoMf*CkQ5!;=>@P|qoq-y}R_-9j+t!;!Gs0kcN# zvmmUxmglwfAp}k1bg)=`jez#=S-kZz_d?Ixw~6ccnV>eyiG340#zk4|tHErn$N#EXPL`7Da8~2ht6pT41&xQLT5+uo7rqZ(pm_ zzP4JWXELFirwJr%6W6$UgAjcl-I7YuG61sv7?NvX_8;G$gX_8zvepGZmJS*0j2MP zMDw+gcq35+MYFob>$_#&Ee;O;@YgJoG~9Pvk|*XH_1K@m!8CFeav#UkKL7B&w81%i zW_d1n+At~u4c-eqCgG3X+ILC(&{Z6w9&g@w=p#Jm(|RH}nv_lJu5e&WU(39U55uS;4X=+TC_waR#E z*H-&5*Ft=6sOiZ)@>063U-1@@v;NcgDS;gD4q>4Qs`@dU_+rf4KV~Y&HYf%<>h?$)18;BTv!7e8Dtx9?2w{E31|81*b$iQ^Vv1z%k6VZKp5)v z?ifs*J9cg@f`tj0RcH^Uf6|pQP@>-_vY?S>tCg$XXOab~cRo?^ij*9xaJvHoHluFX zt?4Yml#p^W$v!2t?Nv`T@ohr=w+m|;sH;jX>5;ErHT}6M%aCJqBD!d+Q*~8R#eHe74i(x7HpP61dftg?%kRbxs5NWb z5su@?e4DTyYEAj)=Jl4}+(?gRxvYfVa0jXF~KlkWHhHnHI;R zX*Thps&YTFrQWV7=4Veh`4oQpZz(t8_C`yXw{vQ%2ybz3Da$T?<>!GBSqZ&MO3^>- zv`O9_0fXtzN+35@0ruJUaUkZUjRX^`to9@Nv|p9>y__e$aT* z&7!$^{q#jDT{QkUQRem`U{adVggu2>wTdByZ^$;hCu= zV&RXurpZOL^Vr1e^@CrSN?t6g8)|AcKIT0Ia>RO#!&RPl3>L|oAG4L9rdeST(y;PZ zsUz;GMN&O6qhh{l9o7VGy1LIy{>#2j`^(^zj1Iat?ip_Tg>6E}9|5PQq??yDHWN-ypcIv)=mi-% z3O0I&TCkQ>{(bgjyVjI%cchW@G{D-=@BP!_suPpl;_BH&Nm5Xc%>=>*IuqIttu`0T z*(x;ZC<>}TA6Fjk+*+;rICpC@=e)o>sy3=pI4{*WVmJF`OGAgQ?;F#@rPK~Uw zt1m#W5VRYqNX`*q8rN-8eDcBHdC6)&# z5?P-bh*&GLm4`bwdB>J*6+UeA_D|ljAcF0>h{?RzmoB2r*zto8Ce=$Jd`}&ap*}}8 zVnnMOq#dObE%I`tCJ>L1I=fwIg6(DmKx#dJ-jG%TQ`BUPtmY%my5jNnGU71g3l4*) zyo^s^$v8m=oDfpBP6}2N^Py4M8B-Sf&sUoAzm3r__tr;oGgcM#=1(+S0a?h>kJc_P zb%=*>Nv0O<0JK!Beg&wJaMUAuVQ%+3{WC!Yh5-RErj0G50-FJ6fUOM1q-06`4j$aG zz?T-y4t_PL0EMYza3vXHBpFm&M#aBN%{v2T^B?|zhNIGYErc{3mG|};l^xDwRKrpO zr&O9_g&nHbhlj@-ys5A8&haU?^z%;XD~>s-N-rK*XwRI0kV8)Gi)^4$Ab7Tgm0qAs zDEt@b;9l|P8kzYFaqE&dCf|OFAW~m^UjPaK?oB7Yc}udqcC>MQY4@jg<$Q9!JL61; z7}s^C#%W4R8R^Nvcpu{GKj;c_rJU&@swvTQhxdv6{gLyeC{f(Ei=xnEitBNYM0@tO zo&;5{0@<)9I3m+Z0H=PKqokGdT|Q0z;g9A-5<#ENmzK+hoa*V7$HMQhI;xY& z0l=Fm_~6~my!@*PuoqSjjP|}>>oJL*e@J$P@df}Iw*mo&y1}W%Tq2GkeN~gauz%?Z zz_Ii-VYNeM&sLK#pLz&oi^FRBS}5^8-Svv4(D&R+_2Uh;!ma89gO=wTJKNfUj><~i z%Y&4yP0MlmOR>WI5G?5_1biu~A|o?-+($l0*JLlT)djP1qkmRsuZ2ouK3I>qpp1rG z`W-QaUea39+3r8Qm0166|C}=pqJHe^*c(4~N zOSB0aVsWdy@Y<1@6)uy$_gxKu1B^ID(~PJg5Uxry4EI3AqNWU(rqjFpbteJ++ljT)2Z97=ivmzz!KJ@i{t_EAq5u~{(j$N zBtZ$6pyYXSJ67m^exb~Mn>dB<6rT~=Vqjs4#cH(H>`D5RR@8jj*>1BogJ5I`uSoy5 zE!{dWTRzRE;~*Ox=tb_;#B9$nV62|d@8MeT90szw~S& zxahj%;|*Ey_y&j05W_16_Z5B~Z$-y!Ti1D)?iOGEn8k@xWD+&}O_Oq{i#utUrO*9^ z6~E(E<728aKl{&WZ&}dA>c*L-*@!T-qXjTrm%RGMS7STIbetfE2MZ-& zJBxK`33K&(qHe|}m2XrszD3i%uR0o``)SM`{j7`Lwp2H}u#a?;HfP>llFL08+ntq;uO4=*g<+X@JJ%O^y%1&D;Y+&g<5+ z2qA_NDso#|4-qBL$8UgchvWju_`<)0(i_-SI$F8V3l9sjeruX{esXb5Sqb-JP}}nS zWaXjq*Pe~Pd+B-SiyWq0oR0go%D5jr=#|`zNl_Qaf&}xUtGkW|D^?vT=G0dKkR#aM zYht4Z1P1W3uL478rD=Y@fF;A(UK8hT_?EUqd`hcA`<{h11mGkZ1->6miExht?lnc# zrhKPFo%ek#V(aGnDD!cb_6Lz?CM6$QaE3VCB>$z~=*w0A09YnLMJY`@1PJ)|HdMV9 zwGyW+m-0&OKeXdg5!zJv-|xSUzHxiF283xp1wYufmuFz3cgp19T{Ib=-c^Hom+OWC z9yb{#uiFXY4!m0LvjZIp6tp`K^(iO#k+G_8FVGRQClu)lw(kP*;V`4(|~ z>LAm>o{Z0P@BoJQ&Kml=MF)^8bIYw68nn}=yJV%Jd)rWroM#u4Be;UMjA51lsn|cE zpNCSH2dIND7A|GPFP$&jm(x^o(J|w5tTMorL%Y z2ZjRL*+GlFqTrk`_psEN_I}=Mfr3QQvE{QDA+o z@3X=M6q)t3ik-L?tyCn|-X@wLuCSbm^yDX3CNe7qr>X{zh~*su+j<7H14)VgQLthC z%l0irxtx$9SHAqA+#{xT`7ZMm<>hRF^?;#?&cNQkF#!oo*p}({sF=j$rCW-7faMcFV(KOU(P;-j<9}_IV0{{R3 literal 0 HcmV?d00001 diff --git a/data/images/wifi8.png b/data/images/wifi8.png new file mode 100644 index 0000000000000000000000000000000000000000..13502a11a0f231d6a850c5933c7be452eb9ab11d GIT binary patch literal 4952 zcmW-lbyQT}*Tx4BhM_}RaF7OxpEO9<05YVcbT^VpGjtE#4bq(=(nv^ybW1aoAdS5D z`~Gp~tTk)aUFYnxpXd4PiBy9t;Nwu^fIuL8MVPDxu*w3@TWl=gbKUF(9k4)LV0vyK z5H9I|4;m;ln-cgEY7Wy-0fD@kK%l^25a{*^SPwuT4;~Qc&;$e$Ne6)_oD+=)_RYM8Gs_1}GvnV|8&59Rmi4@<58PMbWY`cKn;wO7GJEys zWa`~uaRWK5vyXB_a@-mpnroYvY)dt3hZ#vnIGCRWJ!2$(tKl6!k08b zpDu%HYww07q-i*n4yv`@R&?}}e0lJ_^^_l7>)75)G+0SifPkX1Oh^o<9`URm5wf2j zNya!@!ECCIfnWJI#-kc7<@li6IYp%HKtdmS`u9xpdU@fOUUeB;U*KrvWsHv^!?EJ@ z^h36{9ZyRbf|3lvJ3&OGDc6f0Yt7ocXg}WC@L81eW=}!{T2Mbf0v~JMQ1Hw=ZyFW2 z+&2YZTYQbqOPUXQVrgD9c$CNRqd%_#_q(DOZa*8Xp{FkyR(25l-5TBARvO?g`Gb0g z>)*Nnjo;Dyeuf11+!Tfe8N^H&(r6EZ3Gz7JYIkfaU|6(bJ{2yEm%P|Fn~6SNNz?$p zG~V4d)~&Xt^BY8z5(JzQg9VvtF`ll0LcLK`z8=&{AYx*Hs;d~TPsYJhgl|g&_ND$t zl8qU8y(5FvH$U(Hr6IU=RMvBAE%xY~QzVvAUFO(|dAjOsUJ{O4aqE-t85(~Suf!iF znVpS=QK2KlY%rd7Y~k3;1yN`LLCD_vg+VN{Y?vSy6W-A3(2rHq zykKS2iV7*$;Z`cQ^OaGAb|N&Dv`$x{F&y>bkZ{g2>UiZMyuD5C-T`&k0e`rH^ZI)= zPF=S)k^gwi47(bfSBF-Uyisw$$E>xtOgyL|N;%v!?ldv!Sm z&1wv+8==(RJnKj5X+e>D2y7X;QF;OAu>?Bq?nncD5_*{;~8Jx@yas??lUJE^sTd9E$4|m$dID`1j z;Ffe>pD@g2k4QT^Rt@=X8hk!+o4vvl>LGEO`#&`J=$kf}5aKuJX7+5K=Er0bQ^OXh zakN`Laa*<>b|&5I)EgiAAg4l%JU$vj%%MTzU$GWAl?d-@@9&dJq^y< zl?0z$_AgF#&-z3;+qQpsvllCvR6@cFwmmiwKz;jhNT&7E$8jj0whhsQ54ZdOYax9p z>B39|9tMJu6F<+GKvG%^lY|Lk7E1ItiO=0RGuIZ-8-kSUUmBCA(}--(bKOM>Prb9# zH_MYhm&b%EhQ>=A_%~I7_bR&`meXjYoRu=pY9be-s6F*uw$COg^cS-~TZ_rivwqGI z65UQ*+?z_9!ZF=(6u1*_Fx4&i+n$J(pKl!hai_84R=X!Ag zA7Xc?9}*Kd-^AzB-!l*;`$|0{DZpPZ>3SJZ7jOq>$QC$yW+xGE zCj#*=f(>FQl~5nrRR5Pbpapr_Mp5G=Hu0q`p&S>i&DV#I`X^R!lchQCKl!tK^C}1n zV--d__jtaofA&&lUirn!WtBj2R5{6sY2~mEG2WVH<3v%HVsh`}j@OpsZ>+@ipqIlu z`87z6S)||D?G6aVW4>V4OLRAVuDeiDp%_tF0@YLaUCsQkh(;sY+CTny=+uL1Y~a|< zE4fEFf#eKVGF^6E&nJqrFG$o~(aCMz&j0*&8<~syTGkdfV$*7~0jhHk>9Ywt8RJl+b<-bYi5rhV??}Yq!a}11oC?BDQYv7u zveG~l4I;-1Z-{(h=ZPCVGEb8hh-b@Sufy&Y0CkF&qlO>!MQ~eG4 z9JShvkJ!J1R|zopmEkA%*j!rz9NwCh0cAwx_JAC|yK{0(;H;JNo{!jrxjDM<)`k^e zi84SkC{x?!--koL8Df`3+8uU+sD?`bh3b08S$U?P-_yjxy!(g6_{ou)z}u;?E>m>r zyT@9$vQ6ve#>$Jr7?ns`GR~&1eI7K~S09p5o|m@C*&(w0{O$`qB{2|-yx3JD9pxZd zsoo!+&nRw=>N?4Ke8l|I4FUp!R(3Vm3s#KF3g}n6DP3ba5hSA5BQ|PEwAqY`GDR6c zZ#D5;{U^#Eqo0~=Dr+^^RA@i5Iw<13F1iR1O3GS3SOYjD0#tsdaS)42NM2NRiDVUY zBQO>-+8H#Bj~(Z60a%vQyT8F`Z&r%grEUi1)se*|<+N75zI?30^6P2SCZo&N=4ph= zeW%KmA+JsW#b5{NFTuPf-pX`GS?zB1a9w>>53*>XzeQ0Oh~LbVfG9gKkbZPh1u3+G zG145kBOHE{<9LCohv6DvaHQRY;n!qcxO6)ml{|*)>~L3N*_Z$J*s!E#-nO&9ZN58) zTk9hjlQF3Rrkj5*nUIqdgTrVz!S_Q8!rt67L-=&<$c<_-S+JxM-C?c} zn;gUMh6U5Kp>Y_bLu4`xRir#c6XOePN-ZeWted2Vga!>CY7zh2WdW=+Sy!rCAHy|y z;j03oq<0+fSU`<`M9z0b(aTYr0l8I0v{N|r3m#i&LYrHrs^GA{)i&?c=f-^rWt9Jh z>);5wV1Ph1R|IfM7!a0OOH(Z7mCP<@NXFcxhj5WjAv-VdsP z_e`BT{qq9)M?V=6@}lT;lr|{Y=9TA*GHi9sC*BKxFz8?(KZg);S7!Z^$kfdu*OHcb* zu}!K~PPf{N%0&S|AOViG&8rK;RHnT zj*8J%oFveiDi^bK=^rx#|5jrIrIBtA3NnY&k!P1Eyf5!#F+ALGYHw)>g%~ee^^)RL zoO{fwmATS7ZhLG!!5pvrDcBeQhOwo>VrQ#~LoD(?f3CmSVRH3Z=o_sqaKJP=^yanyNi0JCc^Hk8)*^--jbAfM7Io&OfIO zvS=;R1k$fIn|Y&nnb7-`f5=A8Wp+5eazsVTM^gE3e7a@(*C2>Bl`R>>Szvl!EB>jz zJ`ms~7VU$KFI1%vT|gn(?)RlwLH%LRcH*E!2{6VbhfB7?5RoB?S4bSeC!2P(_i`iH z5s69pH!XzEb?%^*_)|_$dfX;Sk7LYU7+xE&*`lZa? zL3j}X9ZuD26rXtnCC1R1(8p#kBKXyfsUzOz_Xqg2s+tpdXq?a znX4dGDD`eEmiN09Y7%4pih%wj7N3VAbeiG96h;)!?*?%FIX^Q}#&D&uP2aTAB{mn$ z(*%32`PI$7v}BpgJ&)i$>Ve+l4~tT;KDyi22Y9?5wx(`!VNb?1fFFcu>bML?&(>h@>ykT#It8|y!Z zWO^yuhvx;^N$C`=i4*-g3zGzrUCnIID90VTJo@RdUE3m=HIzB_kJ3xl+RGm1BEqP_ zMcbF1O42==fMJ*`!_s2~{bBEWzaphMX!s8#ua*}MDlbRLA~hCV-rQs5PmlF^@`k-A zB4qsS@S3GUEWcw~u#mvknwfc&ksav%%fG0L{T)T{A0xu2=mGpDc%PFS;QIIa8X`iZ-@BRu~{E5=`x@P(?7{u@l(_s)lKRkFH1tpJq<#*0`*9 z!S7``+oT-18{D2m4kV-6+jc%S&*B4D1O#^H5p4+B*cy1+_GPWyFhsXVq1}8{uyR}x zt>Gsk9ujLwf>TAwbqC(8c0)&kfszRA2W-RWVVfP*WU{aj2bGqWgyn^7{5L%5C`%w#Yt8drdRppe|-#EOu(MPe2(71ncqUF(}|CiYEZe-#;-hPciI*YTfUnt58> zG49we-rh0Zzh#Hd7v&hle3CI@`G$%J&Qssq&AZ>1-cX;Cm;|;9$MrYOq8cRAU98TE z*{`+b933c$<-0!^2;?pztB004&%004{+008|`004nN004b?008NW002DY000@xb3BE2000U( zX+uL$P-t&-Z*ypGa3D!TLm+T+Z)Rz1WdHz3$DNjUR8-d%htIutdZEoQ0#b(FyTAa_ zdy`&8VVD_UC<6{NG_fI~0ue<-nj%P0#DLLIBvwSR5EN9f2P6n6F&ITuEN@2Ei>|D^ z_ww@lRz|vC zuzLs)$;-`!o*{AqUjza0dRV*yaMRE;fKCVhpQKsoe1Yhg01=zBIT!&C1$=TK@rP|Ibo3vKKm@PqnO#LJhq6%Ij6Hz*<$V$@wQAMN5qJ)hzm2h zoGcOF60t^#FqJFfH{#e-4l@G)6iI9sa9D{VHW4w29}?su;^hF~NC{tY+*d5%WDCTX za!E_i;d2ub1#}&jF5T4HnnCyEWTkKf0>c0%E1Ah>(_PY1)0w;+02c53Su*0<(nUqK zG_|(0G&D0Z{i;y^b@OjZ+}lNZ8Th$p5Uu}MTtq^NHl*T1?CO*}7&0ztZsv2j*bmJyf3G7=Z`5B*PvzoDiKdLpOAxi2$L0#SX*@cY z_n(^h55xYX#km%V()bZjV~l{*bt*u9?FT3d5g^g~#a;iSZ@&02Abxq_DwB(I|L-^b zXThc7C4-yrInE_0gw7K3GZ**7&k~>k0Z0NWkO#^@9q0fwx1%qj zZ=)yBuQ3=54Wo^*!gyjLF-e%Um=erBOdIALW)L%unZshS@>qSW9o8Sq#0s#5*edK% z>{;v(b^`kbN5rY%%y90wC>#%$kE_5P!JWYk;U;klcqzOl-UjcFXXA75rT9jCH~u<) z0>40zCTJ7v2qAyk54cquI@7b&LHdZ`+zlTss6bJ7%PQ)z$cROu4wBhpu-r)01) zS~6}jY?%U?gEALn#wiFzo#H}aQ8rT=DHkadR18&{>P1bW7E`~Y4p3)hWn`DhhRJ5j z*2tcg9i<^OEt(fCg;q*CP8+7ZTcWhYX$fb^_9d-LhL+6BEtPYWVlfKTBusSTASKKb%HuWJzl+By+?gkLq)?+BTu761 zjmyXF)a;mc^>(B7bo*HQ1NNg1st!zt28YLv>W*y3CdWx9U8f|cqfXDAO`Q48?auQq zHZJR2&bcD49Ip>EY~kKEPV6Wm+eXFV)D)_R=tM0@&p?(!V*Qu1PXHG9o^ zTY0bZ?)4%01p8F`JoeS|<@=<@RE7GY07EYX@lwd>4oW|Yi!o+Su@M`;WuSK z8LKk71XR(_RKHM1xJ5XYX`fk>`6eqY>qNG6HZQwBM=xi4&Sb88?zd}EYguc1@>KIS z<&CX#T35dwS|7K*XM_5Nf(;WJJvJWRMA($P>8E^?{IdL4o5MGE7bq2MEEwP7v8AO@ zqL5!WvekBL-8R%V?zVyL=G&{be=K4bT`e{#t|)$A!YaA?jp;X)-+bB;zhj`(vULAW z%ue3U;av{94wp%n<(7@__S@Z2PA@Mif3+uO&y|X06?J#oSi8M;ejj_^(0<4Lt#wLu#dYrva1Y$6_o(k^&}yhSh&h;f@JVA>W8b%o zZ=0JGnu?n~9O4}sJsfnnx7n(>`H13?(iXTy*fM=I`sj`CT)*pTHEgYKqqP+u1IL8N zo_-(u{qS+0<2@%BCt82d{Gqm;(q7a7b>wu+b|!X?c13m#p7cK1({0<`{-e>4hfb-U zsyQuty7Ua;Ou?B?XLHZaol8GAb3Wnxcu!2v{R_`T4=x`(GvqLI{-*2AOSimk zUAw*F_TX^n@STz9kDQ z$NC=!KfXWC8h`dn#xL(D3Z9UkR7|Q&Hcy#Notk!^zVUSB(}`#4&lYA1f0h2V_PNgU zAAWQEt$#LRcH#y9#i!p(Udq2b^lI6wp1FXzN3T;~FU%Lck$-deE#qz9yYP3D3t8{6 z?<+s(e(3(_^YOu_)K8!O1p}D#{JO;G(*OVf32;bRa{vGf5&!@T5&_cPe*6Fc02y>e zSaefwW^{L9a%BKeVQFr3E>1;MAa*k@H7+zhjm&lc00opuL_t(oN8MQOZ&OtmCjJ5b z3w|do7z}d?4j~%Q=p0coGa8NYM-(!Gj?Q36_Q5c57$XESf-x~snV4lu$I7O&6O=GF zMn<}@u-eiwcI#$myUxvWi+g>Z(|elB?QMGte)1+yw)Win-1ofi^ZqzpwaRhT_`{nw z_D1#rZ8bgNwsqa%w)+cl2;a2;PXqTjIr5*^`@>J{2u^+0G-UMd9X5gugHyqpo=9+Q zcQ}X#o#?}N?Z6IK!Zlr!598r)_Y4^`-PckJr(>yf%V<2kDG*Ipb%oP-&~7hk7ET`$yyE#Xpv0Jh3c?#}o2cUsSLruu=gJ+mXfRF`%)45LWoG<NA}AY9WG7Tn_`CE+;WD1%x0|gg{nr4;IVzfhlRdJSRsji%D+VetAON%$o!Of>lvz9*N5(_|y37rkso< z<+XFuvH@$56MgB8kXw7>mmBg)Xik3meNpr^|94hSfpiyqyEzagX=y@OH%<%du+6W3 zOG+}6&6C;x>7P!^i-Xhjr&q$5d<8;Ukj(ahm>fie6PBd|GmA=_n*tFfA5THivZ06>$>)Moa%>`@ zBD{Avp3fYvdnTl8bed7vbw9-9SrAi$>-`bWI`ru+>wKlK=}(fqfFLki_ySu#7f(Ir zqdimTBWB5gu{jAKs)NR&oS2xGS0HSP-Xbka7}7puQTSjqF42WdKFYTcFl&r=X}X~y%ExPjIQ%K10B+z^zYg(kA#dc zo!>NU$Oww9zE~hWMt)nOuFOJea4WXG^Fppj9D(olAwwv3T4x2t`C3tSgem%ieS&`D4QOLaeStlb%*&J5>^O3DU{KKLxOB@i`P5bBX7^c_K&Pt1c^h=^9o(0{bCeasu~YY%yyC5qCnn4_RgE;3wVS-$Vz* zi=-ZP5k6M!mFviN6S{OK)Ww03vqzKSW>F=SF0GNok`eDMUmTnQc9Dy&+TL_%tH{o2 z%lY~LOju;#yt6Hnj8Uz!CRv-0DVl$%9Il^%aVbix2 z*$N0j#!}D9!|uo2{T>B^LzLB^C?Riz%#MxN+RG?eoWK^%TdGej;V&x=4oAwTo(Qqc zY&9O>{Kqnu$>zv%*NPlMfvABSY{OFV)Z+w;8?&6DccK{d#8R?sS*Pe$EJCb1rmv!t zgCb-^ab8i|<4mo`k(;pgQ(EYeP#r5cuP}<79N3phd>X}8FxQkIEPYPV!d=}tsd`8U zD)q|U5>kgGq?O$Ee@3{iFQy3Zddu2E5_W))vmqtKzTy&;@;)RXkG1q+JI1Nrby*!8S~V`aw* zkA0=GE!&5rT!AfmqIV6-dmy-M-?9fQ^(mmq?L^-Ig0sL9u;PJ?KFk2a!0T>=_hI2M zFaachg)&HD{W|as@Sy8&H&}QC_y{-!be8~stLX%e0?!xyWr+*8;Zfinpb4N~-N3a* e;2GdvJK?_}iCRTlbk-sO0000004&%004{+008|`004nN004b?008NW002DY000@xb3BE2000U( zX+uL$P-t&-Z*ypGa3D!TLm+T+Z)Rz1WdHz3$DNjUR8-d%htIutdZEoQ0#b(FyTAa_ zdy`&8VVD_UC<6{NG_fI~0ue<-nj%P0#DLLIBvwSR5EN9f2P6n6F&ITuEN@2Ei>|D^ z_ww@lRz|vC zuzLs)$;-`!o*{AqUjza0dRV*yaMRE;fKCVhpQKsoe1Yhg01=zBIT!&C1$=TK@rP|Ibo3vKKm@PqnO#LJhq6%Ij6Hz*<$V$@wQAMN5qJ)hzm2h zoGcOF60t^#FqJFfH{#e-4l@G)6iI9sa9D{VHW4w29}?su;^hF~NC{tY+*d5%WDCTX za!E_i;d2ub1#}&jF5T4HnnCyEWTkKf0>c0%E1Ah>(_PY1)0w;+02c53Su*0<(nUqK zG_|(0G&D0Z{i;y^b@OjZ+}lNZ8Th$p5Uu}MTtq^NHl*T1?CO*}7&0ztZsv2j*bmJyf3G7=Z`5B*PvzoDiKdLpOAxi2$L0#SX*@cY z_n(^h55xYX#km%V()bZjV~l{*bt*u9?FT3d5g^g~#a;iSZ@&02Abxq_DwB(I|L-^b zXThc7C4-yrInE_0gw7K3GZ**7&k~>k0Z0NWkO#^@9q0fwx1%qj zZ=)yBuQ3=54Wo^*!gyjLF-e%Um=erBOdIALW)L%unZshS@>qSW9o8Sq#0s#5*edK% z>{;v(b^`kbN5rY%%y90wC>#%$kE_5P!JWYk;U;klcqzOl-UjcFXXA75rT9jCH~u<) z0>40zCTJ7v2qAyk54cquI@7b&LHdZ`+zlTss6bJ7%PQ)z$cROu4wBhpu-r)01) zS~6}jY?%U?gEALn#wiFzo#H}aQ8rT=DHkadR18&{>P1bW7E`~Y4p3)hWn`DhhRJ5j z*2tcg9i<^OEt(fCg;q*CP8+7ZTcWhYX$fb^_9d-LhL+6BEtPYWVlfKTBusSTASKKb%HuWJzl+By+?gkLq)?+BTu761 zjmyXF)a;mc^>(B7bo*HQ1NNg1st!zt28YLv>W*y3CdWx9U8f|cqfXDAO`Q48?auQq zHZJR2&bcD49Ip>EY~kKEPV6Wm+eXFV)D)_R=tM0@&p?(!V*Qu1PXHG9o^ zTY0bZ?)4%01p8F`JoeS|<@=<@RE7GY07EYX@lwd>4oW|Yi!o+Su@M`;WuSK z8LKk71XR(_RKHM1xJ5XYX`fk>`6eqY>qNG6HZQwBM=xi4&Sb88?zd}EYguc1@>KIS z<&CX#T35dwS|7K*XM_5Nf(;WJJvJWRMA($P>8E^?{IdL4o5MGE7bq2MEEwP7v8AO@ zqL5!WvekBL-8R%V?zVyL=G&{be=K4bT`e{#t|)$A!YaA?jp;X)-+bB;zhj`(vULAW z%ue3U;av{94wp%n<(7@__S@Z2PA@Mif3+uO&y|X06?J#oSi8M;ejj_^(0<4Lt#wLu#dYrva1Y$6_o(k^&}yhSh&h;f@JVA>W8b%o zZ=0JGnu?n~9O4}sJsfnnx7n(>`H13?(iXTy*fM=I`sj`CT)*pTHEgYKqqP+u1IL8N zo_-(u{qS+0<2@%BCt82d{Gqm;(q7a7b>wu+b|!X?c13m#p7cK1({0<`{-e>4hfb-U zsyQuty7Ua;Ou?B?XLHZaol8GAb3Wnxcu!2v{R_`T4=x`(GvqLI{-*2AOSimk zUAw*F_TX^n@STz9kDQ z$NC=!KfXWC8h`dn#xL(D3Z9UkR7|Q&Hcy#Notk!^zVUSB(}`#4&lYA1f0h2V_PNgU zAAWQEt$#LRcH#y9#i!p(Udq2b^lI6wp1FXzN3T;~FU%Lck$-deE#qz9yYP3D3t8{6 z?<+s(e(3(_^YOu_)K8!O1p}D#{JO;G(*OVf32;bRa{vGf5&!@T5&_cPe*6Fc02y>e zSaefwW^{L9a%BKeVQFr3E>1;MAa*k@H7+$tiu~XJ00sa_L_t(oN8MQOZ&PIyCjJ5b z3w}2c3S^!Pk)?>p~qFTHns^d=`;d*A!q^PcmZ=bX38mf5b7*3kO3 z?cx2fx{|g~-Kv&Q-9v>|kM9n_HpA|-V=R1L-5Pp!tAFIvs@{0}-oCiMqHDxo(iZlw zYzg`Cpxw^myGGbnN5JLH*B-~i-|g;=kF{J+O@ALvr4J2^r`P!+=@rePG#+%aIKFR% zJzoF{z_%Z33lAI|7&k8dH7miyZD|N59Co4?=-HF()_eBU=91z|G>0ueR z`SqVkNoKMOVAg*+VrhA`E5>+w1&qp90HjAw*O?n>0qNZVnG|}+?d-y~zW8HGg12rj zU}o>+gx>8#T*(60E$b|k8l|Ajmd>agL535ir=4Rniks_vVMQNLNzt?+iJ8fl{3CLF zIH5AUw{Lu*a(Le}AZeq^jKnVcF)A+tm>gW)8eSR?&9|z0C9xS#g1v$yuv+*6OFg^u zP;Z$rVwD^ooD?6j+7+LX6T?%o4a6qtP0*r%)z;FZC>$6Vm&kNxAAQ;q6$2K~Ti$?peFl&0*SWE@ymme&kK|)XKt5BbHWomG+hOdOUHf$gJY+l>-<8cF zu5|}wh8g^-zPR*5Z1qKf_z3lFlA0cR1Eh!K;6`kF$A!E|97XK*qe4h_dS@oZJD>(- zM#(=dxHf@Z8lWb)7F376;tkLaumaoH{ls?f-T-xF*k4pMDY#jULD z(MS_=Zxaa3Se7F(6%beu+(2zR(}ryn2?*@$i5p*Dn^J9bPj6gy!A@OIDIGjKI3buS zRKGrr?@&nw_!^)y4vjuk4ekXF4onz7qi#D;zefO23k#$ClF-DHQ1M#S_P61b{5mm9 zIvLo3Gax-gIR)PB88tqKQnPK+L(DkBa_i3n$ZiPi2YAT|tijk~l={NXfYumNWy%mI z-Qc&Q1L8$e4qZfyReR-q)Vl#*Is@ujX6CHfWW`WaX^NNTNMh26YrWO7buebM5!a=8$R@-Fk7`ik z2&?1(6q`fRT8w+UX0;0uS@8J+n|q@Vac&C ztD#-bhkKwh>~z#X3M|JsDh{u!m>D^1d!D|SUB-yb9w#Z;2&LvpfZj?jr{)|S;TS`1 znJ0(h#|mq=BOvEO3M#KrfPMnSW-Bmb=nkl>gC14^tmoz|9LtGH2nJ6wfV4t4^fu1X zLvESC^1`}UT=OEk=wx4%Ht*xjLwacU*!lF(UgdP6uK>t-*eopP5io;weXuv303X1O z2G}qx0h@NQB<|mUeFJ;c@wXe?cmnnztO?dq#Q0myY1lE?%Xj@{i8rv|N!WX^Dj4JH iWV}}idjWR874Tm`w0D|HO4oM)0000004&%004{+008|`004nN004b?008NW002DY000@xb3BE2000U( zX+uL$P-t&-Z*ypGa3D!TLm+T+Z)Rz1WdHz3$DNjUR8-d%htIutdZEoQ0#b(FyTAa_ zdy`&8VVD_UC<6{NG_fI~0ue<-nj%P0#DLLIBvwSR5EN9f2P6n6F&ITuEN@2Ei>|D^ z_ww@lRz|vC zuzLs)$;-`!o*{AqUjza0dRV*yaMRE;fKCVhpQKsoe1Yhg01=zBIT!&C1$=TK@rP|Ibo3vKKm@PqnO#LJhq6%Ij6Hz*<$V$@wQAMN5qJ)hzm2h zoGcOF60t^#FqJFfH{#e-4l@G)6iI9sa9D{VHW4w29}?su;^hF~NC{tY+*d5%WDCTX za!E_i;d2ub1#}&jF5T4HnnCyEWTkKf0>c0%E1Ah>(_PY1)0w;+02c53Su*0<(nUqK zG_|(0G&D0Z{i;y^b@OjZ+}lNZ8Th$p5Uu}MTtq^NHl*T1?CO*}7&0ztZsv2j*bmJyf3G7=Z`5B*PvzoDiKdLpOAxi2$L0#SX*@cY z_n(^h55xYX#km%V()bZjV~l{*bt*u9?FT3d5g^g~#a;iSZ@&02Abxq_DwB(I|L-^b zXThc7C4-yrInE_0gw7K3GZ**7&k~>k0Z0NWkO#^@9q0fwx1%qj zZ=)yBuQ3=54Wo^*!gyjLF-e%Um=erBOdIALW)L%unZshS@>qSW9o8Sq#0s#5*edK% z>{;v(b^`kbN5rY%%y90wC>#%$kE_5P!JWYk;U;klcqzOl-UjcFXXA75rT9jCH~u<) z0>40zCTJ7v2qAyk54cquI@7b&LHdZ`+zlTss6bJ7%PQ)z$cROu4wBhpu-r)01) zS~6}jY?%U?gEALn#wiFzo#H}aQ8rT=DHkadR18&{>P1bW7E`~Y4p3)hWn`DhhRJ5j z*2tcg9i<^OEt(fCg;q*CP8+7ZTcWhYX$fb^_9d-LhL+6BEtPYWVlfKTBusSTASKKb%HuWJzl+By+?gkLq)?+BTu761 zjmyXF)a;mc^>(B7bo*HQ1NNg1st!zt28YLv>W*y3CdWx9U8f|cqfXDAO`Q48?auQq zHZJR2&bcD49Ip>EY~kKEPV6Wm+eXFV)D)_R=tM0@&p?(!V*Qu1PXHG9o^ zTY0bZ?)4%01p8F`JoeS|<@=<@RE7GY07EYX@lwd>4oW|Yi!o+Su@M`;WuSK z8LKk71XR(_RKHM1xJ5XYX`fk>`6eqY>qNG6HZQwBM=xi4&Sb88?zd}EYguc1@>KIS z<&CX#T35dwS|7K*XM_5Nf(;WJJvJWRMA($P>8E^?{IdL4o5MGE7bq2MEEwP7v8AO@ zqL5!WvekBL-8R%V?zVyL=G&{be=K4bT`e{#t|)$A!YaA?jp;X)-+bB;zhj`(vULAW z%ue3U;av{94wp%n<(7@__S@Z2PA@Mif3+uO&y|X06?J#oSi8M;ejj_^(0<4Lt#wLu#dYrva1Y$6_o(k^&}yhSh&h;f@JVA>W8b%o zZ=0JGnu?n~9O4}sJsfnnx7n(>`H13?(iXTy*fM=I`sj`CT)*pTHEgYKqqP+u1IL8N zo_-(u{qS+0<2@%BCt82d{Gqm;(q7a7b>wu+b|!X?c13m#p7cK1({0<`{-e>4hfb-U zsyQuty7Ua;Ou?B?XLHZaol8GAb3Wnxcu!2v{R_`T4=x`(GvqLI{-*2AOSimk zUAw*F_TX^n@STz9kDQ z$NC=!KfXWC8h`dn#xL(D3Z9UkR7|Q&Hcy#Notk!^zVUSB(}`#4&lYA1f0h2V_PNgU zAAWQEt$#LRcH#y9#i!p(Udq2b^lI6wp1FXzN3T;~FU%Lck$-deE#qz9yYP3D3t8{6 z?<+s(e(3(_^YOu_)K8!O1p}D#{JO;G(*OVf32;bRa{vGf5&!@T5&_cPe*6Fc02y>e zSaefwW^{L9a%BKeVQFr3E>1;MAa*k@H7+$tiu~XJ00r_%L_t(oN8MQeZxeMGCjJ5b z3;u2(7zjE=HzAs-kvW1wW;7VTMkOQY*a!r(M8kw>j1UM0V`74$Gi0-4Wz*TokT5oj zgBBN8TRO^GHe0)O4!i5@>+@Xi)7-AN>(w8<7pUBjBBbim5p$s0hLmc0GfG0~x zLHOGJ-C_TJe?t5Dk9i3uZ_D9eQXc7z2-XBv>cGQhi*Z@s6PCL{xUw@OxW`IL!XVIGLWsAwa1jK#M`0C#zzD3?t$eI6D%Cv^S?gIs zst8+32tlS30y(ukSS*|SC#3Dlv>Y`oCb?<**%=}MZEF;ej#OP1Agi$#OLRw^ZoxPC}h`u}_gF*|rot@a$XTPN+_~-2+XYQZ8 z(7HYFD^*Z-%PPv0Ml~d}xj!lg5#gj^Y5(M$uFV>6SeK8hpeWf;#Ej(Az6m)tmeeD> zdpJ?d9Im@2q-<20QP_3gM`a6$slj!gaAi6)-m2#-g-w5wY#V~WY~c$``CMLyYRmKy zv*f_&w0IHKf%u%97)!}^2%DleNF52A&8f$tu+N{6$ZWP4ENPp75t2;xyw>%*u zOy@TZ$7KY?R$VL*hmhZfsA-`)LRv@-)?(XlUMv)eBkx`hdCsd@2DD|fb zuBE_MMyLd?3aU+CaYtw+ScUDYeqvesZ-go{tS@p53Kp9Yh`>f~L}NjyN0!ic1Z6_) zJpn<}m-Prt0}3nzt|7PWWy3a#00eeih-;sZr}Q@Z)=*q_0^eMp(d*!W(J8@Hq4(?4 z_zsz*L9YQCW7FtE&Cp(8zkfT!e5|)ut|Q+y=+d50jCilRTs99zHgZu_+no+g z71=s%SwH_D2^|Upw_n+oNycb$f+cJQPWOZ)W9?(JVmlx>#;sjC8oMW??lwWl%w-Oo z1pnuEN|Ua(Okwi@X3Iw?0#`9Cr7+eJ9GqAfwqVVeAe=3v>fxsx2PHNr769utp3cfU z=+`)I(5D=qm(LUqoVHOzWP&qlUvTz(Zf2&|^CcCJ2z{2^ZNa%bDU_szyzzDN?bEcWo7Ii|7Ci~D%Ifolt zriIRg%w;wv{$+4FP*BxHACj=9QbLkZhwLF7fmy{Db9udTpBzu?Gb2iw@}aYZZ0>AC z^y4;cnaybrrq?lJ-u?yS$#$$6qu=sd){hlHBnUO0ghk-F53Cxy38tXTJ zFM<1Pf4jlLL%{n$2himJ{#J7uI0`(o>@Q1Pzzq)rZvagI{b~oUH3ClocbW004&%004{+008|`004nN004b?008NW002DY000@xb3BE2000U( zX+uL$P-t&-Z*ypGa3D!TLm+T+Z)Rz1WdHz3$DNjUR8-d%htIutdZEoQ0#b(FyTAa_ zdy`&8VVD_UC<6{NG_fI~0ue<-nj%P0#DLLIBvwSR5EN9f2P6n6F&ITuEN@2Ei>|D^ z_ww@lRz|vC zuzLs)$;-`!o*{AqUjza0dRV*yaMRE;fKCVhpQKsoe1Yhg01=zBIT!&C1$=TK@rP|Ibo3vKKm@PqnO#LJhq6%Ij6Hz*<$V$@wQAMN5qJ)hzm2h zoGcOF60t^#FqJFfH{#e-4l@G)6iI9sa9D{VHW4w29}?su;^hF~NC{tY+*d5%WDCTX za!E_i;d2ub1#}&jF5T4HnnCyEWTkKf0>c0%E1Ah>(_PY1)0w;+02c53Su*0<(nUqK zG_|(0G&D0Z{i;y^b@OjZ+}lNZ8Th$p5Uu}MTtq^NHl*T1?CO*}7&0ztZsv2j*bmJyf3G7=Z`5B*PvzoDiKdLpOAxi2$L0#SX*@cY z_n(^h55xYX#km%V()bZjV~l{*bt*u9?FT3d5g^g~#a;iSZ@&02Abxq_DwB(I|L-^b zXThc7C4-yrInE_0gw7K3GZ**7&k~>k0Z0NWkO#^@9q0fwx1%qj zZ=)yBuQ3=54Wo^*!gyjLF-e%Um=erBOdIALW)L%unZshS@>qSW9o8Sq#0s#5*edK% z>{;v(b^`kbN5rY%%y90wC>#%$kE_5P!JWYk;U;klcqzOl-UjcFXXA75rT9jCH~u<) z0>40zCTJ7v2qAyk54cquI@7b&LHdZ`+zlTss6bJ7%PQ)z$cROu4wBhpu-r)01) zS~6}jY?%U?gEALn#wiFzo#H}aQ8rT=DHkadR18&{>P1bW7E`~Y4p3)hWn`DhhRJ5j z*2tcg9i<^OEt(fCg;q*CP8+7ZTcWhYX$fb^_9d-LhL+6BEtPYWVlfKTBusSTASKKb%HuWJzl+By+?gkLq)?+BTu761 zjmyXF)a;mc^>(B7bo*HQ1NNg1st!zt28YLv>W*y3CdWx9U8f|cqfXDAO`Q48?auQq zHZJR2&bcD49Ip>EY~kKEPV6Wm+eXFV)D)_R=tM0@&p?(!V*Qu1PXHG9o^ zTY0bZ?)4%01p8F`JoeS|<@=<@RE7GY07EYX@lwd>4oW|Yi!o+Su@M`;WuSK z8LKk71XR(_RKHM1xJ5XYX`fk>`6eqY>qNG6HZQwBM=xi4&Sb88?zd}EYguc1@>KIS z<&CX#T35dwS|7K*XM_5Nf(;WJJvJWRMA($P>8E^?{IdL4o5MGE7bq2MEEwP7v8AO@ zqL5!WvekBL-8R%V?zVyL=G&{be=K4bT`e{#t|)$A!YaA?jp;X)-+bB;zhj`(vULAW z%ue3U;av{94wp%n<(7@__S@Z2PA@Mif3+uO&y|X06?J#oSi8M;ejj_^(0<4Lt#wLu#dYrva1Y$6_o(k^&}yhSh&h;f@JVA>W8b%o zZ=0JGnu?n~9O4}sJsfnnx7n(>`H13?(iXTy*fM=I`sj`CT)*pTHEgYKqqP+u1IL8N zo_-(u{qS+0<2@%BCt82d{Gqm;(q7a7b>wu+b|!X?c13m#p7cK1({0<`{-e>4hfb-U zsyQuty7Ua;Ou?B?XLHZaol8GAb3Wnxcu!2v{R_`T4=x`(GvqLI{-*2AOSimk zUAw*F_TX^n@STz9kDQ z$NC=!KfXWC8h`dn#xL(D3Z9UkR7|Q&Hcy#Notk!^zVUSB(}`#4&lYA1f0h2V_PNgU zAAWQEt$#LRcH#y9#i!p(Udq2b^lI6wp1FXzN3T;~FU%Lck$-deE#qz9yYP3D3t8{6 z?<+s(e(3(_^YOu_)K8!O1p}D#{JO;G(*OVf32;bRa{vGf5&!@T5&_cPe*6Fc02y>e zSaefwW^{L9a%BKeVQFr3E>1;MAa*k@H7+$tiu~XJ00rGiL_t(oN8MO$Zxm$|CH?^a zg5M1d1_M^nB1D6)wT+6Y(P+SzsH6m3T7x0sgP~&egAfP=V}emZ3~Alkg~qy-DxtO% z+w5w!>nvN^&f2nN+pVqJS={S6(|NYT>~v?gAD!f;-F;@x+~?kN?>*11TIIMZgRxEb zw`+T0&6RDj=C!S{=DUjRLwvU%_9W~!Cr07(x?t?lt>KZ613h~Co?bm%*EJHZY}3MP zT4P~6=(O|r?ig&VE8yyu;rsCLSG#)j@z$%;Gv6krGyD6KnT?@%rlKX5!Gmt5VkO;I{311L9`hBuEgvic4c(Qm!DL`riw3 zN=wVO?oru*HPDH%^aseTz53Ibd=#0KAO4yZbxr+~lQRI_f!J;e#R*y(5Z*=UVKuh- z#h+G z%FOVd-ejS2xb7Q}v{7Y7Vpo5ckf#Am4z3GoV~hp}UJo!2?=knv=E*R;fV zuQwnw%-{!lb?HO1RTmq?2dHn0)b!9FAUz}pw_w|EU0Q4shY`EIs1TB!-dRcU52!$y zQSwhUTt|Z~4^Rz^=wMBR3veh&hm38ta^(&&k&(8Zfj+o!c@`FUcF zbTY65cR+fGa*Diham@Gxotk5l9zx>?%dKw_Kz5}8xWT)D4e*V7$uDCh4#gJL0lC7}R?27uK0w#4hLzDouR09)KUQ)P4f>D;di004; z<**$jC*iF|TOJ^{$=O1!cp6e<5W@51aC&L#`5aQFf>p$3iG7Bqkk9AMS@jD*DVX>o zypZy_WTo7qv2jK*2h$j)ow|n6dC(M0S!@Bip90|3l4!?P86(Dveb9a>K%0jIT>cb5 zHNZqrZcuhi&OyaOf~adKoi&>-0daQWmOTJ*6Sqp0dgc1OP|y4hkR*X|(Zc|;P3>db za_MslXG$A7wpfm7GYc|h3HSxP;5eEqXO5?6r}~1b%56jJe!a1zx}5svGCb$e0z@~} z7f)f!o}~CzlDHdlMS181Ok@^Jd5re&4M-1}5YmOG08Ts(t-LKU-y||-%fUpC=`H14Es|!5cYhk& zEOg!pq3V3!Mha@gdn=)ofc^=w<*?E-NCSpmzw*fGyV(8OLCE5dSJgfuA z1=t)c?-MYK`+8xoxB=dQg+s6*SPC}dVQH*igMA6R$Mv@xEIa^vA9e=TTEh5S%~{wH z*t5(2vcv`4@F46>SOCVjx*6B%VNbzsw*&qM4T5v%-`CYd00000NkvXXu0mjf>ue?V literal 0 HcmV?d00001 diff --git a/data/images/wiimote8.png b/data/images/wiimote8.png new file mode 100644 index 0000000000000000000000000000000000000000..2c83d339a652c4afe9930bec2917f1b887b3dada GIT binary patch literal 4168 zcmV-O5V!A%P)004&%004{+008|`004nN004b?008NW002DY000@xb3BE2000U( zX+uL$P-t&-Z*ypGa3D!TLm+T+Z)Rz1WdHz3$DNjUR8-d%htIutdZEoQ0#b(FyTAa_ zdy`&8VVD_UC<6{NG_fI~0ue<-nj%P0#DLLIBvwSR5EN9f2P6n6F&ITuEN@2Ei>|D^ z_ww@lRz|vC zuzLs)$;-`!o*{AqUjza0dRV*yaMRE;fKCVhpQKsoe1Yhg01=zBIT!&C1$=TK@rP|Ibo3vKKm@PqnO#LJhq6%Ij6Hz*<$V$@wQAMN5qJ)hzm2h zoGcOF60t^#FqJFfH{#e-4l@G)6iI9sa9D{VHW4w29}?su;^hF~NC{tY+*d5%WDCTX za!E_i;d2ub1#}&jF5T4HnnCyEWTkKf0>c0%E1Ah>(_PY1)0w;+02c53Su*0<(nUqK zG_|(0G&D0Z{i;y^b@OjZ+}lNZ8Th$p5Uu}MTtq^NHl*T1?CO*}7&0ztZsv2j*bmJyf3G7=Z`5B*PvzoDiKdLpOAxi2$L0#SX*@cY z_n(^h55xYX#km%V()bZjV~l{*bt*u9?FT3d5g^g~#a;iSZ@&02Abxq_DwB(I|L-^b zXThc7C4-yrInE_0gw7K3GZ**7&k~>k0Z0NWkO#^@9q0fwx1%qj zZ=)yBuQ3=54Wo^*!gyjLF-e%Um=erBOdIALW)L%unZshS@>qSW9o8Sq#0s#5*edK% z>{;v(b^`kbN5rY%%y90wC>#%$kE_5P!JWYk;U;klcqzOl-UjcFXXA75rT9jCH~u<) z0>40zCTJ7v2qAyk54cquI@7b&LHdZ`+zlTss6bJ7%PQ)z$cROu4wBhpu-r)01) zS~6}jY?%U?gEALn#wiFzo#H}aQ8rT=DHkadR18&{>P1bW7E`~Y4p3)hWn`DhhRJ5j z*2tcg9i<^OEt(fCg;q*CP8+7ZTcWhYX$fb^_9d-LhL+6BEtPYWVlfKTBusSTASKKb%HuWJzl+By+?gkLq)?+BTu761 zjmyXF)a;mc^>(B7bo*HQ1NNg1st!zt28YLv>W*y3CdWx9U8f|cqfXDAO`Q48?auQq zHZJR2&bcD49Ip>EY~kKEPV6Wm+eXFV)D)_R=tM0@&p?(!V*Qu1PXHG9o^ zTY0bZ?)4%01p8F`JoeS|<@=<@RE7GY07EYX@lwd>4oW|Yi!o+Su@M`;WuSK z8LKk71XR(_RKHM1xJ5XYX`fk>`6eqY>qNG6HZQwBM=xi4&Sb88?zd}EYguc1@>KIS z<&CX#T35dwS|7K*XM_5Nf(;WJJvJWRMA($P>8E^?{IdL4o5MGE7bq2MEEwP7v8AO@ zqL5!WvekBL-8R%V?zVyL=G&{be=K4bT`e{#t|)$A!YaA?jp;X)-+bB;zhj`(vULAW z%ue3U;av{94wp%n<(7@__S@Z2PA@Mif3+uO&y|X06?J#oSi8M;ejj_^(0<4Lt#wLu#dYrva1Y$6_o(k^&}yhSh&h;f@JVA>W8b%o zZ=0JGnu?n~9O4}sJsfnnx7n(>`H13?(iXTy*fM=I`sj`CT)*pTHEgYKqqP+u1IL8N zo_-(u{qS+0<2@%BCt82d{Gqm;(q7a7b>wu+b|!X?c13m#p7cK1({0<`{-e>4hfb-U zsyQuty7Ua;Ou?B?XLHZaol8GAb3Wnxcu!2v{R_`T4=x`(GvqLI{-*2AOSimk zUAw*F_TX^n@STz9kDQ z$NC=!KfXWC8h`dn#xL(D3Z9UkR7|Q&Hcy#Notk!^zVUSB(}`#4&lYA1f0h2V_PNgU zAAWQEt$#LRcH#y9#i!p(Udq2b^lI6wp1FXzN3T;~FU%Lck$-deE#qz9yYP3D3t8{6 z?<+s(e(3(_^YOu_)K8!O1p}D#{JO;G(*OVf32;bRa{vGf5dZ)S5dnW>Uy%R+02y>e zSaefwW^{L9a%BKeVQFr3E>1;MAa*k@H7+$tiu~XJ00mS@L_t(oN99=kZ&PIyCjJ5b z3;u2(7zj9>4p}s)!8xK}W{etx-(&ACB9(yEeV?1}qoI){B_&0*il zrjQR0TG57kM}aN2gv;Fn_v7L3c67%_nuaE)PDLlvd;E#?I&UPs!W~NEK|928-veyS zAqC;9_ce$8yZs66x9hVKOwGx`U`iftiwNcfR_egRW@K>P2h`>e!U`9*9C-0eEOQ7% zM}JRA?fJNrw}j8XUhY(~sA&^nqgT=C`V^|t4kI7-fVv?J-Uz`w&xkwNoSQU}_-h^C)KjSku<#>2P zUOE$#a?C+a^rbUGZtdlB*W{zXnEX0AEozManUND9-3H&T_eMxsm=M+lX<-$%`Ssw0 zOw4DpWafX`V`+J|Ge&OFKrUb#1QmhIRQk3W|~qMa)P(?HiUO{V6@d zJ9`q@%;CIaLdr&^8HHW-b5x!JF*Ufx6E01M##{A#rLgHwl0AbUFkAQnQ$82hq1rNi z#4Op{Hzr<0wKF~~$NIH%JQ-y3DD^qVTRiA(5&1Y?K!eBnRYA2mSDX=A307eH>O8T`{WC(98P*pS3<@S)2t=UL8_`%0s*xr19YL8; zdyhlV^kp>yQ-cBvfosTZd)e?9MF0ZZy5icG1LOKJ`c`*bwgcY}P3m=UZ(mZ-Rp{sS zN!&vwY0ztc#@HP6As4h4*zHehXOXw<$lv`SXaK@UzX{aDh` zuiym4i=-NL5kA(BSI#5fHR#fwP~|csXO1Q_hDDXob!oIDhK#t@SuUF!BOAG>s_jgN zriyIswyf9xLqg?(;uX6DKa%vnLb&?JkQ}%&Cgbx9`mw^l?_W&XNvYtL^$wP>JM~EH zLXTtdab7~b$5xAPE-dPn?L!B~dmjg{>(`giB0C|>HtlM$IzBi4G^7)3MUmiOduJic z{}rH`c0O=+bmle-+0}CV5S=Q4(0yym8`_3s(A3+ItSdRAH=~X%H2d&*oFi#%DZ*+n z(mZ1v6QZlqgHnEKP*hM}LviIjwk8~jIZY@j(`lIBhsLKuHUK1053cnLW-V2LGMa(> zgv!FrI7-z}7QW{n&EBhQjX1N=?86IVw>mGgAHNv5;oOI2Li&kamo@dw{xjTB_-nMp z(nV|krG#(8^vh-+maz3YyD$105S#{PfklU8^H|pdY_%i23lj%{ejo)*6~P4NuL9oy z_uBq;gNX-$eZUEzsQ~y}%}L-eusQE9OPs)hhk!SLI)Hw)1LtaiCxJW7gnt8ZU~a+5 Scv4XS0000=jyKR#CnJ7D3;+O`riLmMW99xg3Gp$j%1U#Xry$7TLe9EX#X1ba_sC`g(>yg;zY zS(+4C7MC!5^E0%}W3KyZd+fe#USX&1te|y*07Xcer6FPX6h>MNVWV1)9PA(Xxhbp! zC+6`5C<$8~IbYpzV*%F@a&k|&Py}B9tl$|ELI9RAOwhNnmTI$P3-_`oRXvkAS4Au4dbE(0NhZ(_6Ik2 zFc6gs(5ju9%AGuEpxgmrkjib5L-I&Jhg%W~`4O0!3bXN#Ycf2cm9)dQ%Tp5Wdy~r~ z4hK`LpN#@QaVi}q+q1jiaq@=oamgeExsA|XFa86Uz5T}h)uAo(r(x^{NAO{ z24#BZ`8PuD_UdB&%P$_d_)EAt?)7@#=($cg%S0Mcl>PE{vifa1$-^z{3|GIVJ<<$B zyJ1M}m!z8a{!F}_D;|<2@cr@hgX6C?!5bWfwWmOny8>2ds!-KS2b@c7K1#Cy)UPW5 zIPLQJ`X4_b4$L+3=S0xMk>Z_t@nZnyteNHq0M@EJ!p6g`ii3mzpjr$EH7PTne`ORz z;j?_jTmDLNYbzNA;py*#P(p|uVJ!Z(0(I{o{4rxqtRP#F|CCt4C_~qnbYF7eK9de| zd0&cuc7%mr`McpnxXM2WY3w+c;;`%!%(#;X8FHhqIlpS)QYZ3o48_qJa%rbN)ewUw z7;~6tu%62MV@tWzo)41z&A+qGeM$shmmHkI?~#KM@=v4aJu3z z944BBaH-+XQACosK@bi*Hf0Sn9W%WJjVcZn9x&AskrWY5lwltqS9+E9XWmY#zx|B% z;$pF88iL$&)X6j=l%a7d{Zc&C@hakc$P{eN=1<1c)YEFy-casc!Rmal#v|_Zp(RI; z76R!EL5?RsqBjdRzimovGH-I8S`ru7EBSr8Hu}X69d_4Z+M?V7Z{a)Th%1|v?#)_XJ%jv*J^CNgl^5*fCl(TB#(iq}P>~xo8ls z@hE35=~4~q^{zb3Dg0s$E7b9+Tz%8C^N%H5tE%CI;k0cD=7~?nsl5|?)y_e zA30W$LG+2C%FAy`D&=;WcG*9pQjt?~WwUA@)F|G&4OngPY+b0u z=0SCl6#^BqI|^5^r{+HEa@Ed&u&hz=*smQ9Na^Fu_p zceI7HdAXU1#miQ;`hxn$b6xdal~k2Ty>z|W!a0|3O(%#UM0Gn;)7An$x&h&Z2)A>w zXK-o%-tg@(y(c}qGyKDyJONqkB6%&V1#85s&;GPBFJxBp#y=h^hJQcL+7)pzo1mOn zkk~-bj0p6*6&U5usJk$@AYVnE#U;jTzZ((GRuIl-9$5L&v#Awu;rH@q$n-@)ertZ; zK^403Q1a02Fm}0U6kH@wXfE+;^4kxUb;GSGMUtXSQIEB{2z?cOxJ%m(w}^vCs%iav zQ+s((&6V8|gTkePf6<1*hMd%@_^P?hs1&OGNBfBWH=jbA=rxtM+z*ZqArDhPCG0Vl z3r;*-8E%Pva~%@K*_)&&gLb-XSv*jFUyM|yQ%-(Y|8DDRJ*VrBKPmN`S35c5spD?s z(FPH}=Ozj4w(SzXMUe7E$3~mRC?@&FnLU~k%YGU(wXE`LP4%B@mg;K0iKSJGDtQwz#uDe1)NJ=MP@$n~9jOwb}iPDPUHhi%)2vMKfg6 zy$BYCif;=T>4D5_Tuxw#pQFf zNcI>%x+@Z)f-LKm>*#i>92y^!RW$x&d~W>DSn_asrOj^s+I#AdIkfu{{AU(z*?o1V zF!Tj&f@PvR>pbgpqj}SMrPvT(vwNL&&$q_ZE5%2OuEbI#QTEGg7668zst7h zQbg#E!}yvzh0jqZWx&tr=MRZHvfZ-dR;L{Sr!D9$8q*Hbyha%tuf2dhx%>1P{lTt} zU3m>iD-YyhNKad+^VKeMq15=wdC!{@`iHsMLTUMxp0g02tM6AAYxFA-{(N`iBVCI@ ze24Yj`rS6?N(ah|Dl4(GikA1w3rEXu-BCfsXH(1SSNPG96ZfeX$rLJh$+^iRF=R3O zh0heErGF{<-|gO3s!TXe@D?)Mm)?&wFwl!cT+i;$k5A=Hm1Li0r}uh=mEY~5_L&;d z1APN*UxtDu#H`O>+#GxjS`K18DqEw_-wfk;%m3i|xB0?ovhpUKDLwrG7boZJ)QSy@S&9NgKxzX`A5{RL6wDxN_KRSjjMT6!$vSam3KYX1cyTBR*SlY$O3i z+Qg0+X`}(aD)^C8U|^;Je-!#)0IVxhK;C2RBeJuOg}V-HEBJv>J1~*XhRMDGSR{&S zU9^c%2TR$u?rk#8XBcq`zBPe0-aYzlxHK{LAlwIF$Ev%-rbiJU6RqQ~<0!TCPIsA* z2QvlZU$dsHd=274jiKh@6yBi^?4e{VhmF6-P=ml4+k0ueFvQz%hG#^#w9mrfp_On; zSR>X5S{Y6NQ@ ztW}}oum^Q-9O@e;+$c)4jT-z2C?c@NR>14ODY}61!Ha;m!Il|cM%Qexyn|SFM(#{{ zEo558%0Q^r@cHn2)|qKND>vUoM0nl&{>t?Jg*P2U$EqLORHgB1{5Nq;6FCacRnOD{1bzUxc z_;^d^2YGpUeZP4z;KxGy{Ogu~Neu|971G02{~|G@C&`X6XB!#)rSG`tuC&JPhO~HtexkZGGvLLgr9QCkvbU6jg9C1)@~@L;1Qcwa zR=kZsnUjG9n3ziWO^I)LZE-rTN>LC(Pjr%qpy0AI2SYvQ#GD~4-?7X_az>?~NW z!>XagDexs<(L|ZsBg_l&Xh6nPR|{{J_rJUu-pz1tgUujNsS@Yq%QgPXSV*k$i4 zQ@ZEK>J{%n!I4t*0eStNKQbo$&qc_2i2SFF4lCg>1@=^pC=H%>H8r0tgtW@3zuQv{ z`VmG$M#sm+6%>*h_UjrOTieS?o%>9uR3JUEyGcyiaV$A6uj^a5Ln$K8xGqo^;Rq7X2ST`P3wuPej;EELJijBc! zQ+OHb8jxWjFXNYOJdju_!aC0L{9{k4a(+zLf*U{5U)8I*gk{7uQ`k7f+ z^zC0@suAIJ6x-(1oB9mNdhN7M#i_cAIEdU0kSQE;Y!XaV;((zKR_QvN%s%{z$9Fyb9@N%;-QM z)M{rjhkjn&h$wVs^xKPJBKB_2&&_2@VwD|OUS`R1^1J+Fe){)T)XB@+8_G{x^`e$V zCLqpCP_5edk@GwG>43HReILBl`=(yrsAnbo!z3%-^XU^iGg7nOtpG7()}OB19N~^4 zys}#%aW+p9PSr&yhX%6Vvs58R5%OTqh?1}!w8-D<>emOZjX?cw23 z)36^bSD2`FX)CG$e#APrR#TIv!y7vRRsv;~8t_lAt)@2p_@r?>GoFcZ`i$md*GH-f`0Y7EDYEE8WshJ?O{spF2=;-K( zY9w}f@m?|q7lV#JW}H%Sthj>d!McfL?w7vL!mJ(H!J@kXd5{v+=qM>%$(FH)fq|jf zE8n6XVfp(q6Pv9{AnLj+$ZpQ-G~&d!c0EDUX(4XvL)t9Gqm zdd7^Wq`9?q1+;qd;C0a6lH@Te6Q8XCe4LhXx|2}ay_)Kr!!*!g2H65V(V~e7*Su{p zQk=$lZ49~=^%%emO)@d>k2o5;&Ef;5o!>?%W@>FgCWY4h*7H#muvwBoZBuQ@;|j`O zj=j!DStDDUdwVsF){PEm$q#Bc-$Zi?3kMEfJ22ws=jZdJ5B)^=vUg6cb$1b5i#0`9 zU!1UEMR<(ee=g-u#%a?k7jH)*nV3}1Eb0eNPfy=8uqF>q1@@5Nl6IuOBJf%aa!*>T z4KX4-kLXsef1ql8$|V)afCb(P4H z4T40;iu&Ep-@o6S^UOVG&Uxm{b7!7AH~Eo?E;R)^1poll`g+<>0;>Km$VdpY^5t?M z0m%LJY@P!ECBy%M2tX9D0sw`nCj|27k%wQ9-*XQ?e;$1ZgvUS7&)w784FEz{3e8~_ z<~z)4`1KR8VN%RHLq8}J84nbk8pD_&B+5%pXOP5Oy3AzOdq+oym}8_Q36z!=^P0&_ zj4FjkI zjtCu;p=d}J!w6`Gr-3U0&4)xWg}FlJKnXG6H16tx1s;h5PWN8^m;+)8&+;OO0K0d* zOhhFa01ty(k~ZL>0=%DooT39*O971Th675#k~koxZ{@BBG_?WfDLTq#fQ$-|GE0gV z0f-|2rxAYsP#`W3V0?IFrTXW7107D3z*JtdYP*1v4&07RJb={7N`hN>N}uIEqrCGi zXN0CiUsxWS3|yA>+wlYdlw>dwsy)66ouX-&nvzdL(L52~?IF40b8*35Z%^0xYXZP# zQ1r~Tm}Cokj0#DN&vlvL0kMZ8WyuSCs(Ul7W-Cy#vto7Z|37YYO5e0EFK=&cEg1}e z?VQJ~qOM_mPtaCZ-v6RiFY%|}K7SX0%Q(PwiO;_EO`I4ZIj7%}$GNQjNY}k=qrAD~ zn&TVLcWJj4WyG4%2c&5uULVUK`I5nJMFs_DZ=QbN5W4`WZ^!{n&(w(`GQ_JLTtR;g z@6lNYp}*q+;HcBD_p2}&D8?gpb2{YaP~%FsL=cE^*MA!T0FK%M5*A}E8pC7&pj`qN zZPMa6>17o|lW_LlUhSp4bdrw)3k>vu>A)0EV>knyMBcvw3nxrAafv!fe%0iXMVomf zWct%c^jUtQQS+xgcP1<974CwQ6Kjo-F*x(CBoVo!So5cmvE;>{@%HKw)29mXj3zOf z@fl{w=}ALVEO;#SxQ^5UZz(0(KkUd*83ANoT_$wtO230Qo2h-JYK62{E3n5sETjDL zG)Nke&RmlJCGaD=+H3hz+?P5J+Ld&5$gmXpCoAcL0dFaZp?>fOMKSVB*YOX0@2TpB z*qa`|2X!W&x=w!xA*P4xpvmQlL%=-F+**3pM%E@vdeuCf0v zKMHl+`8UAoA|st>ttZC6K%dSaNf(g>8Bh?QPlm|cYkzY~|3ihvEdA`mSzjpsj#y2; ztR6dm=IF{(uVzxEcVayEN8+~%xB9mpY;kPy9@$Y8x@ZPeoSAq}A4Mzh3f2H6(~rO8-keM4k@S=Jo82a5;Zv+-w8$DOq- zZj+oZR#9COjpM^$6w9QpAiA}#zzbT}`tmMNJY}XJEr7K%Ys2HyobzQ;>xZHry zhsov0VA0OpE3VE|wc46eCCCGV2Uac6<9F^Fq}bemvw|QKa-48g&T(|gI^&_pcM*bk-1oF*ndq#t@I7`ZF<9)O##1sx|#qmqJ zN@iHqFE+IyLu&EPhb-!U)dP#M>R45Ub(wXWClddGWa1 zsf;O4n)pZ2KNr4`I{$D^?T@Cq7oQk!m7tO4pJdHGBb_4`GP4SKzM*}tovpo|50f@k zY7{q+6IHL3c&56d&>`EQF(lz`Gcj*nXsz#U$f+bD+92=i{dwbZ|2Xk`;de@G1WT^u zh=YGv=~UlId=+zz1ihGYwx&^%iQ>E8T6Ch-%&!HH7(xWoD8l-<`e1yLGx9S@OAvce zZj&QDQRDEpzcRYy!UP5%AjP)Z_{gX!cT2~<&3F?4uH`k( zM8S4pKiq@I-@C;(Ul01Gwn=hlk&b$`ym^1yMw|i#uKa0XE4(O5+6;5Ea_^Z;9#hJ$ zE4n|qKhZLVd81HpSbVcj-$%ds7KKbOv=ZmC{?YyZnNqWAKp2Js%XIsG!ef&6s-IF& zqCWGcb^BI14bj~~;l^HY$KJ75y{$xEdz6+G+woC*tBd;%rq+@+8?Dag356W$Ovxz? zj2M<2rk6{?tD)N*iGE`}d8_X}*3=EOKb>};b>I21E?#6ulU6?`g~f@*xrO|}>{_ey;+gNv0Y^mFU)f*t z7`ra~mHOysj3tq!@x1%I+lBr`3tpokxpwC)`@+Ye-oz(he;70ix+3MLK`pj_o#&cW zvw)^A+~3os8NU1Zy6`YWoLZjR^1p(i@BIGSVOu+R@(nyUwem{v>xlQ8q;q$JxnNw9 z&%lTy#KU}Z#D$%UU5Dv}`pm-adibR-<}Pi4tg20z!Lh}t=gQ8jxlGv6^y|W`!l-D8 zf2&TIGE@Z4b!y`ot>0k>UC`#N&P^&#rAuYX{^(QCQ8Q+n!RnJ0qEY#Y&u-AJ>UHLv z>2PO3C!(R<-mCo}yt_5R9lyg-q%gI1(jE4P`DS6hNJ(w2`#9VWKZrlwU|x$3ymvJ< z-nkrd@1VZRwCl-<=DyZ4WG!)C!|r-@>2USsGjvGF@yx0&o+LhY`a0t@ofdLCJuiJc zfjVKYNKsu$>AObY)y`!VWcul}P!Y>@+4Xn>3$tYO+5Fz()J*P7Y0gnjW{*!K@@f~o z$JU4$>Ko$zJR15y+VSM^#eQ$dY6#b1`39}&RwU0$;Tw;CA5P7`R9$4UWoF(GgL02A zT_1>J2!4~tRS#+m0O5iF5EBak|85Al0{}0i0ASaN;7W4=fW`0alfj1oK$fqstz{9q z@(W?-&1uCp{1P|ue(}Si7q0owd2<7{Rl%e{NPwBzCjiMz_nlj!>^GoSVou0_0IM{scWpYX*_6%`l_ZDIZDpcTDl z*|Gky%=4+XIlekj{YeAqP-Ck?MC1MB?bi zaK|>3l$1HxKWA6au|GF#O>Qn=qOZZGPk-qF)%<(O-*fKX-VXNx;vi`s(Sqvy6eb0;01um z;^=PFocg7LLxO^wSV;gbE-pZu?+ySir6X(}2QCdU`Y7fFsj~I@xFC#N59q0_O(6^q z9i2f+a8mSeKmoY)cQaPe)Egh)x&Rf~&V({oyc0%Jp{1!@?Gm4twYA}wvBT-b6eO|2 z$c3yXPs9@HKdd4dZ<81$231pA>vCT|=SO_MbIKr}xw$!~QXnw~^}#2<1vbsh%)+AK z#X5A@MwB{@yU>ziy)1CE!R6%Sus}+`6lzLj=&1@IIag)+(y)pk5a`#|NwYxj{?v@E zxr2joM1;!ZZOf-mWSa8%r-mY?pjb2>p33p>gU>}o+j{sO|JvFbBSriat|%f6 zfnX005C6Hh7vUZlcw{ms%aDHyR3?DCsn|XaOGrq_Ehwm{s!Ci~c+AYqJhC0AoIe>o zDE0aZeK)4@mgIYEnS;T2T>&0?3)8ij?0UFW-X6;KgxOqx>KvFmWaXJO>md?G)C zJ;f;$zet?s*y()-{oS1)#B@}%tuNYo zS(=;Av6B%a+CW}53;BkIhOU~79`=3((>VS-qrjb6!H$lOPeD8M*=}q6$V)bVjo-lU zJKq+ON=!^l9`%P~Pi4L?F3v42jckwSBoAYQf`Y!RtaQjruiuQ_Zxl!w{9e8n6^Z>? zV_uGKK{u}64Py_5dRw3M&;o6^W;}H-Xm% z`*yH=KC+>KMnn*<8KcSLzc?{rM095O?;>Tc%G8hSk&TVMo0}UC9ofm^{5;oP4i17H z_7=8tBHR-mVDLKNy3I{`AaU1TjF~*KUshiJ=zOmctC*Gz6>{*j>PYEF`Pkaoh0HH5 zrur*Re2%(U--HDRXaD;bMp!0f0QR5!wH&%a|3E4|i^S7^C(v6OWK84gkw_#yuQJci z(=*K5*?E&d0eluA)_I8*@Q?nl?)En}9$?jxdnYT4$!Km14F?elE^Td~2mcBz{{@PK z8axroyz?iN6UkU(k%B}DLTecFj1oFJl>0WNuvqN-hKA;lLq~Awn}XtEjl9vP(c;Jn zU-B+yd$K=e3+JBwQjT_xj*iUW$iPgI&X~YuMf7-skp@*#>!?_k!RGP5ByB#woVq}f z?6hr^Ftd^qI~GzPjzI#8RI!=V+LMgLQ|ido(B9{lFrV~{uF*HnxPjrG&FSKjgb!_7K`I4o;DX|qysa? z6#L!ToP7G6{S2z~(GxK-J)Jp?Q;IzEC$|MQh-g3|?;P%}bxDcEp%3v7)YK+_|CSJO1`crD6 z9%3rLqsuGI$sB3qvu-_86B9n90CTD{<}dHJuo54xyU)@6Uiih>*jUyCEgv6of`B+l zh33w_L2l`A&QN`Z3YT!Xu)YnsEP_!TzJiQT%b>=aH zj{N*744W$8t9?Xbf3`d6aP-?^o1Odo}DXmEe6;3ibowf zU@$6a5M5nTFxihEKL~28q8ukhg;hTm+CP;1v@B1o9iyX=aoPE|67xzOJ9fF>{rBul zQCwVHyWH&P-(@At%ZngD<~BBL?KWt^&L55n{ZQY+Yu?|JZMhq}AcN)3jt<1w*qD!w zQvPJwyN+#l(1!PYU?bS;nq^fzs>c(-zSP~(@yxx&rhD)%`{T6~8H!7b(3|j||Nl=v f0)2DycbW)b!l8}~ccX_0mIlz*G0|=SJH7fpnF4U% literal 0 HcmV?d00001 diff --git a/data/sounds/camera.wav b/data/sounds/camera.wav new file mode 100644 index 0000000000000000000000000000000000000000..309598ab1ee54ebdbe84a2f7608595ff1e78d842 GIT binary patch literal 6970 zcmeI1-)kJ#702)V+S%1wyRubeL|iA0NuNS#3WYos0!^ST^dTiF^dZDhLX2s!Kmsi+ zVps%PkU+*@5)7qzD1}1vQfOaF-%8&?A%ubnX{d4HNQu1GN~_t~nc3<2+_Tqf=%3Ke z;?bRZ&yVl(4A1V?6mi`?@hd{DU#RSu(%8x_-5` zYD{9brcvN|S>CK=`L;jG`e8pDoJGNKeDPdaUVStir<054?kwJF9H*Zi9gWKJ{iUau zq98BUv%ue&9G;e?G41-LRumkZ9G(V#D_&_v!Dc?n*2c$aVp?$&wCl#?ML(>j@0?Xr zPoBImCJxJTYuXQ2n#R0+ax{v=R@|=d$LZu~)bo}XnzgOzaJ-qPlPvFt?Rw8Ef* z?|F$}-}bkr-Ljf)O#?p;1HUZOiMDs6K*o?>%6L*G)t0={K~E_@J5^ z(-TyQK^k<4^e57Xhw?(Sn!q{nr8WC-Yo;aA9~(! z90iRiFNWh$){0y4?S-yrPbX{AzgIio`1I)S_da{rEk9U!@zP4O6?@*BgM*V!kyJge zU4Kua@Y65uJ$irXx#f48)%4)xjfaP)=Np$=#vGjV!{2`+oxJg|Q|yb^yXC=2I@y@) z$CuktkmbhgMtFXd4bBcu$`W)@0D3TX#XFs1W6~F|m*sF=P22SyiEFn6UsCM|?Y7^n zZTpJ7n#SR7gxqxEd2!f?h-o?@LV=|Ve6=3Q__h+y@iQh0b^@Z;5l>1s%AbEM*O}laYR0{qadklj6@c)iKND`XJbutlS(y%i}7lf8KTc3 z(B5RGk?eqn+#m};<>-`VOUBg-#+26e*enrVn|U%uzA6Hwf(`Ao$Sr&f`a%6l^~g6vT|L2DtT@bu?DSr&(Z1H1HU3f57?kne`}jB z#h@#X+HVzV^sPNmC>Q+b;L+IF=Ioo1WZq$;tGVntW!y?~GM=PXn*Z*hUlGiGrFtwD zv5UvrVJ&nXcXnB%LNS*Cw?)w#5wd-=XgfLJ5d~JR zLn*i{mGhCKflg#t+`R4AOrBaNy|d`TgFf~v$8}6wrt5Rsx93|7_+>Vi*pBa33SeCMXKJU_c4da)%oHuxSbaSkI{hLYK9ZZ zR^99+lp;lSp~uN)SjN(c!q^A(eA#@^dMh!Y*0iB)?In{Cs+?G=)_kyHqMCqg~ zd)~I3b~h%Re#5iO`H-wKfsP5*SVr`rkoMAaT zdvcD=3r@0}tTg6bIYsFiLT?Y&ud~P}q6wUw`MA5F)tv{qSKukNHL1AG81W9@Sj%|= zTxu)Xfrs#deM{Sub0axcO|e^~%So7ggc2`u<3SR-`AfzqQd-uZHb+z@*?=rYIF(x6 zGOqa4)5z|MckqK|J`q!#Xq@G&wI18S=vj~JeE@6JuWsf*1&!h*ONc0Z>S1ncib_4F zl&VSX!A8D`sTE}Bgv&&%(u`mf|3a-^#!rgS<&s*NSd^AdXcZ4q$XxuK;#sL;!| z=0&&6@_7~*qj~Ci-0ILw&T;!=USanrBSS!j&T6_FVVhdp^KLJ+>zny&hj+g^PW#~> zSO5If>f)P&e|&KxUC)sB(U*C_O*jfxnpytg=cDZDrB3nJPe1(pC*OYg%9RV>xwyJ` z_p6T&o?iOPH$Csi_dk2MHr@$tFDx%yJN?t$)y2O(yB~LoR(!tkgMayAX}%7td_ zy>shw58jWPHEz}qhW|VqoVDVM=K}v$1MJHSyU}p`_KAdB?CW{y#F&2A6W=lu5{VKK zBckL3HnrkgjZEqsqii_lKAab<5a}c_JF?Osg*dE91!XhOi$=7(u(}xdn>n}tZpmuI zO&cHGthWRgH}y;?@pUQV>Eyw1Cph0gTNHF;9yDuYA9a|d;`W|S zu0A>%-ITs!bBdXV9M1c{FR7Q@c@Fj--y$u2<9Rqej%Mv64~G zU>&Tc>Et-Arc^D6A2P@d@rJB2nh`y(5qT0bT`xh{DVPJAYgCrdtE(beOm#u#p4{5Zlr7DEWfjOxxF<#Jf+IitTE%R zojw>+XWExpi4|Gi5uD7fI9y)n+xiT$sC=-(HX^)>C5iwJozYv<;}qM8j;?MXvg@eL z59T9&ENzvCd5O<^)?QW=sY%ERBbLcJ*pUq4hgE22&KlWyxa~93dNN0-!!ci&yZDS1 z5>N26c_&&y%nC<+gE{cN-Aa}G1<(cU|+H^mO3SM6}YHDWjU2Zu}St&{2hn1R6mi! zS9pb7P%o=*byp;knt}GbCKNm36K5@PbH2fEoG*|_^zk0^L?g!hU_Hf~#EQBOa~7ZD zZGAI_OfrZ^q*3Fd4hpqa7sv#=b_-hMvZ{1s4~WCPn${tigVY1@ z93B^gtWCriU!dFWnG#2^fEU?h7rTUJ9$tVt5nj!IJV`G|cr(s78O|44Kn551@s^@x zjGbNA1ICbwTzo?Af{nZ-3v?%yFS}FWXHIU!6>ldZpA6tcCz52x)EJNnM1iPx3a$9E zLxKpa$SLepuWM~?J;VFdT#>>G(yj;ojWnI?MjI36HaR{VH*1ZkTW(4ejLGEWNUIgI z8tzJ#da`GXGAgd@m(+cYxzvioHL0bilffBzeRw*`_G;)@UbuKJ3XVp35rfuAFoX6ocsir@_a((1UE&Tp5YjPaktPjqTiuHIu{^aWiLv}f&vzHFeZq{GC zbh&-+(f#AY)903d-MahL!O3vE8-1{HzA-qSJv_kTbcIc6vQ6M zzDTv2wSrl}ir%bI*X|3J;g||NGJp2cYp=?GiwnAx{{j8i B$PoYl literal 0 HcmV?d00001 diff --git a/data/sounds/click.wav b/data/sounds/click.wav new file mode 100644 index 0000000000000000000000000000000000000000..b26f44cd98fcdc19a199befb97bfa717479c36b1 GIT binary patch literal 10328 zcmeI1cbt{wmB-I}XYMo@K?d0|ppIZev3Ie6L1RfVCTlNCR7_%vg^$_9H4+jv(G*N9 zU`cENv#w<|t3hKT8oRNv8c=WqR7RRJFvFC4-;?j}JlsWG-MIddkAL{i=fZQJdd}~h z^E>Bx@8Jg@c;I1MnH@Ryhyx~^abC+nGt2lJeuUY$+sz6#&`utI-uO|>`Ske|flm?m z6oF3>_}>T==qg&t%dS>|R-aeXs)0+pT=O&9W;yLLvx@36r=?lyFEB%ozL(sYSK?D- zj^-8Fvm9&tqOFVi)&CzS`?p+v!7W%jm1O z1>PFyclc(uxh-c!H*)j~3~H^z+XJgMZ}S~(Bi1(CddyhNym$OfU!QNnxEpDN<{&cV zLSMq@Lf_D~18K7!_9%q(Wgo=a+!st8R%-ND)g!Qvof#eVyYESw*j7qxZ&?B>5ZHTqfx6+^WE)db^ z?sl-vqi-1!Ee#CZ=h`USn7(K81AK7dYUW*Kd45iuJKMkFlk5ld9gl?n4VDJ7GkqG; z8t0#AuX+c4{p{P|F_YHI{xCLbVYI~md)Z)GEw%xuyvXQZyxI4+R{FNfzT>|yUrB3; zm9wq#(XsaS?8m+htqES8Jz%HNn&fBs!*&w$&b3p07vF={Ms_1;-plAK>{^En4ci_J z8am^Ru!^Fo9{J23rSDHZ!>_bM`1WNx+RyWyX|?-Bc8Wd4=(}L|2B;e-R%5~8jBaW> zgQNU;4EFnOXkKH(>i-_y; zM|>FGW46dg*w?Xx(74pUWMk>u-tP35!-8Y&9v|l?(s!l3Xn)B6i+OK)V>aKPq_vsN zva9@RS}*$%XfT^r6Ba%y;%J3mW+RDoL-HoO13k@-z;_Pu9_B5q@n9wFjnkIbgH3d%9|Z`D7^b}N}p%wJr7de`IuX8i};wE0`@ z_bf3xtb1thP943_$i%{fBdSWrbeOI1*BZB3zO>8i?4I&~ORAf4vzgU*7RIccPHTbB ztgFp`ST?)fM^+!}9qe50+rWm^UC3#cZN2)gay^hASbb~Z^4>YDSnS7UPnLfvS+cI; z%zP9pzFayX-@4{FsPOn~Snp2xIZ)Sz*>CJ;{(YoB&Cjw6?Oa+X`^$LaHME}hmTa)y zNb7jJ!EVn#PiwSK^8VS8?6PfPk^iYr^Y-w?)q}EL&X`&rkxk1ErLV!BE8Lxb30Y3} z!P%9$?9pO1RUk_10DNq5`E$tkIh&XL+ApNLOv%yi`H>G9yqj&i2eyGXAHnTnLf$+MLPlWRxWOTNVCIW?3 zEBg+!XK1}d_8S>-*+PU(hd&ho7ZXo27`@r|vL8llzU>ddXIn5jlAZsIWM;4PX@ZT7 z7&({hbSK}R^4FM$J0tDqZ3h#pEJxeEkhBIKT;*bmK}fjF-(s}QcZF>f=P&tOctQKE z^ee#X3i_s@(P_jpjA`4T-{bT>>YLlX^a#_vV6VT>w;1_e@g3;mo50=BzTI z(GCOGva9k;lg$lTX2bDc05Ky|t@3L_s#pD3FnEa-uX-o^NVuWjEAX_?Rdtf8hfaUp zTZk(|#ty$N>WyyZH?fme%p=Ro=8c@X6wZ?7gTY$-mVCE? zGv5p*?D0L(N(}x6SZotnd@K8~wAL;v)l>X=KP*;I4Xd zHW95#VYuz@xBB_CCfQf5IkMzD|2YV&LLH5_U*uD0-3XGqqPu+UKe2&W?^ZvET=z}- zzCaeZjf`dZ#j)_Qvi(fZJ|^m%B3N{xm9lfKJ?`%^y3n_?ogy2&M)o_N8S>M+z;`(F zwj>{1M@;Ng_t?3anaZKBkik#F%Bl%}OT=x%ye7LBJ6%KH@BJ3McO-rN zu|_%kWiTA}JGf9)!3C_;X&v6ppX%Rt$-i5zsodIpd(cs&%<*Z#0z-+!|A;7i4l7TJ z`k={v<k2)fM+#jp@SLQWj z2bLz5&*!u=Y);`8yOb3#<_G29%H}aTj+mKY-)6-WKQ!MUt{nH@iyHem8mPXOM$uVSyU_?vA0b!seS&N?FfVpn#)+TXMX?NVB^{5p86o_TNhRrW8;R37}1 z9~_a~FXBuY;tulh-4Tt;{6v`KAXaRP$IPRSRHU?mjPh35Z-q7PX2tWq%r}l$-5R!= z9qd?k=^#ICCjSkK(cO^aZ1RQK`gRi;RKqT(n!!%y)s^bIElx~Nsnc7fL~kNW-{{|fneK5N_j z2~LsB5ebE ziN}<6OMX9hAW5}1y3YvRYC*h@x$?hyGIb9v-8$b58|CnBzsT&({QpqgX6K>J=s;XE zOToJfeIfS`-2>Lge#?VnH)P#{@Qu}2ydHm(=ELyfm2pNrGDxFUV6rKv%Ojq~<}J+I zkkjVIXfM^lz_?L$U_Dtw_x(EhlqGw?r%YX?J46#b;<`?JK>1Lz$t$F}lmE+sM=d*d z!O-$V2XSGfcO?tMH&)_Px|6C(>&ELK5Z3l^g1n@T6IKLg7w|ie9H4#5$RkfIqJ_@v z;rpO9)@lWDxFPBa-2~;6o7vlI^1d>vB&bKjdRSJ$MuwOA`)?0}Z$SBi! zc!rQ{L`I?39Z@N%WV`e(10d-YRzjd7>`}+*s{>OdjZeMQ;IFJ6!wX|0wqx$-x zyX+vV>W!^dSD~FGm8aFL(Ok2WJ#^~2dSt|3U+kBoMgN#5JxcNRX+6HHF4q|i@Q%(% zsHEsg8cUX1JSFWs2#Mukx{akbxXH?rKyN;sc#xbzCB=t0Mt#-nuZ*In$T!_iYUoo& z(YcNE2$yv=(AayQinggQ*{y^vl2zsT6&qEDAE`%NBMJ1*HlZP0B#~@ZV4lwHB?8kf zdZ*hR9HCiyN3MAlBxSYo8p~)j>6`zLH%T|G(_7x8i{73mYw6v((9uV1rElWbnvg~E zBs)tQNs)Z5JLZ+c=Gt*BLOJM(DWywqM6^bgclGFmQdmE}#y`?UZ+4Z5tMN-oP-YiN ztrdEAp7xhVYv&?8s~Jz6*cqc@X+>I!)g--eNU{lC>6~Icy4U=pozr{u)KNmGwd>TU zJeCj_pZ3Kr(k}5(@=)oZz6z!#q)S$){K6p|D=4MeT2ULjt5wlWK3M_>XDM`ZPkU&6 zF>IMExfWfu6e+T@9>tydv|HkF^?ni`IX`MUEy_?sg4<3G|(pS8C7sCy+XQz^BzdRUG)3VD%a~SbMrDr=p7;J<#d*pw8c8U>f6o8?J=y60 zcj|k06eFhJ?LWHgYq?H4$+AK$NiRu~*ZzH(Qrya0E7@Lt^Y_>3)PLL~?oqWYe3U&D pQR1Og0Z99F6M3)P(jqZOS1@@(s8Ul`sxPfgRaJ^po$<+f{sv_luOa{d literal 0 HcmV?d00001 diff --git a/data/sounds/hover.wav b/data/sounds/hover.wav new file mode 100644 index 0000000000000000000000000000000000000000..1cc9a298a9731dae40b61dd23569e628f25ba726 GIT binary patch literal 6400 zcmeI0iNB5I+Q+Z^S>s-NG!I**3>As&s0c+unUdo85WP5skWhxElS)T9LOO&{X1kMg z*p;YPgp=WwX@@OCVPj*DYkKbMeAnt7{)YGSX+NK}*1eu}U(@dz?%%T??cTL(xTeSx z_dovN$Y&?k&k_;C)$nnVE*nG~$&%s2CJsByoee!5@*T( z*iYz7SaQUNOk#h+y2Y+1xywas!kViUe0s#sK9QLEBp_boBJ7VL6-6Rdf@rX;1N<7- zFfvv%xLc0(#7>v*Rzp&e{1!ly2OVC1Pm>f0vkLP|8v6|QTr|beRe_#_H^rJF)sRSd z5>Y>T1MCcIB|HcweJN(2YOxlvGhrppr}C=Ax(q3YRl@UxM-jcC<(eu{_9tF3tyic8!RMZPRIuF;~E;yus5A`Su)Bh(n=aiiC!e4 zC|a-Z8AL-!uIV1#jqWNSP)W||B{Wx-I?_BT8$@dZsmHz&J)l>KsT#P)LGp^8NXC>& z6qV!_IiqLwGEu1BB4xx=EBT%wjrgsZ><62g_+CsLL1N0p+Rva`9j_|%3ti9eIdZ>L zmqOhRinXMO?^)6TbdTy@v^K@V%5n^whqWrcS4GRuM1B=}LuH%pATy5KCQZO(hbFY% zil?Wv6SZ*!6cSf+@ZPMo<%ZrRZSe05aoi>?nddOlGX)-@Zd zB+^tFhQ{rB1dWf$o8Wti)evogj8DGOb9hq^i7Jx7q$e5wLGLCH9{E*kNWL!8Jk2H( z)n&CV)%)2~gwHGWW+Lt?i-|Fm#4!#ckKpY^eVA&hDYqlPAIYjjy;DEapQxQ|5Plkj zpOxOyOLprvEW~w+bVNgz+$@JcsWm8{<@2&WO`gZg1U-h%vDnSi;ku8kFP1;Ce;e98 zawmwarUHEOHNN*m;sgCkUqDxLGCDblOu+>3Sk#kopdQvSc)1oYYN02EI&TGfYpLhjWPN}%l_!XFG{|I1srHk5@h?|DB%03T zHx+c7$_YB|Uuf8)E2xV%^jRuDB!9;8GF?X}r%8V>34rQv*u77V(yzy<6^E#cG@nUT zQ}*c{=sH2&RFeWdq}|BJQsO>?oJaQPG&!qPz+fZqjp)6-+<$-!yiP@2#-Fg3>X+J9 z7Lm7}_?9WdbO==$kpDo^;+;#+?4erE>Rp_mbR_*T5M7J(cJlV9j9|i4 z(jRpy6}k(L0?eKlWjS^B7xv7O!P-$?k{__y2n;V!8_UUTnBK{gCfv;jr#3QP+sPD} zMvX7g*Y!7jMF!ycUY(+k(syaHP}@>@cgQ^HLxz9QPw3T0u%4$w^-N(pugnKjSoqI)6?UP`5wQod>9f>G~?DEoAQ}bW%5R7o}3K z(D6H2d*yD~h{d0EC6#nupTY7ua({vhZk5I|gqm1P9b5e?dA`Idhxl`tWi{k&x?&}m zbfnh1%agjA3~pnpEMaDC0N*;Yl?*3vkIM^8x-;~BZ%}(uMl)-M=(qZJI%1pr1UfN% z=qK~(h`C_agDhNO&NKxlt24+=YifI_^uz0mx{PY6OHaK`wtLGj)P7G8??5dzW3nBj z3vcHAHY)rv=H4MH@FIC>$?4!BLknasxw;+wDa@kzU~(@VJ93$9({eDbxo}2GYwCXm*&jDePk}3Sx^lvmDqiO>Z(Ca?FY%M}6+$(OWTi_mX zbKUOl?)bmr8SX51tevHWGT9mE?d10ayQQ=V<%NC;T?j1?{h0D-u)F`Lr=8ho?~PxJ ztg4t)mRs^k@$ljwi_ez~Dr;KtXrxlSrVeoC`koE04&9SBI=yYi(2Vuzp|k}l>;1Dm zW2J-ZiC!zer}U=clh@z5Uj0V<;?pJB<)z`L;@NV%xamhr8}u5 zfi>RtW|P|>`hEF{l5cO!z25Kox$Dh}>y$1lKM;A(eaAfG+Y%g#?zS@nIEO+ zq*e#zEQb&b4jf1aJXgsye{@w|K60VsRPn8GAhz5(o$1L z1iSg-CfB|in-{K9-lp`fl6ob_O4^q_Q1Mmd@9{jn@d zVvkD5_K2+t4=pb$ZCiT2WOZr0Y-`0G(Y*Nk`jS)KHziOvrBCQe=(A8-XnJtAzlnF6 z3F_#0*x}5)l=EOA+RGjGG$CkVQ^2No&Q#Eq4`u_ za!18-Bb~!DDw*JJKjt&26lGO>a*V-+cd)K%-!r;CF!o{&Bt?p5x}EUUX~4 zUy8Pmj1Sij_X+bb_kQnSPcNsDxul!yVmCKl6q^uh7wZ;V7`ruo zC7$mV*fI^6pmWh#>Z#=&b&N%}-%ROIu)_TT!Qamp^hfQtsq^wa#N82LzJ$Inn)gA19;9hkH*nB&j zv*cxQ%y_fUWI64fK2A5Mp>xrEWV)DhO#T}1li^xd3+)d3x!q`Y*R+v8Ky3Asxf6J*7(p`2Q^I(*nWZ%c@R2|Iht|xEE1?gz!nEfVd zGMzN1)cjy(ntRPDd4YMlPP=J|U5CtLwuc>LU$@`cN;(z>)mgrfo6HMlmvK!KC&y{w zWIFlix!W9;F-*)w+767?+gI(g_BlJ#=HYEmI7wyn9+BqeMWW0%7fpfr#=L1dn2Yij zjOQEXm!n_XzuGbODLdBw&F-`rIug!sySyjYvDGFMJYw&`I;nMr1x8HA61vs?Zm_b~5Qp}o1PJ!=oyqxKTk z?$gP-g_-^!C+qUI4N&f0}M zef-Bd27a zY?3*!k+z%%Ct-7QbOLOk2bI=CpCAKo!>;!8R8R*dG(u*`hq4}tO|nMbhg}ZDT8MM~ zD^7_?`X^3?4#d@kvtg{x*3UUhEY;dwMv?yyWSM-#`%R?_xIpgAEy0cf~Vu_LHyi~&6)C)+{Jl$9LZO(cc0!ujn~!&dMD@7DE%9V zp5i&}W?1)Nc+*swE|X!2{bA~jk-Nf~x{+FbOQ+)DNUmpy_f>l36Zq<0JqaiF!ln`| zJcl#3BT;wa9B&1yszIbt82w@Dc`ZK90k47zQ^(o~E{Mf-UUO_jNRxZ^g-8L#y+iqkYKihj6|^IQAX*HBu&$mkBbQ zbz5we67w2;6ZHG*L)wX}2i-LhuQwBM6pnv)lJAaZx{QWv_2zpv?D{NKyo!uXOJ-s? z@{_@I2~r0@Bf&?Tz&6{#mfFIq8o*%OB>LNlVHx<(=UPbTZ2+M?RN5sNqJgJXA%E4A zPreDBbB%l)BkSMuMDiv1*}@ahw{XJ$f|({*S1Ft)@!yoh|4$SyREk6)znn(nAsF95 z-VgB%dYtEmGx(L@YzfA7gXgazIMc6WA)nuWLgPVRKVj_@cZ=}GO)|e!xLH>6>CJ(A z-5`b&?AxVViF6a!7ChUDYysRk@qdwOFv6xp+=5qA7;qL_6a4vZ +#include +#include + +/* EXT2 cache options */ +#define CACHE_DEFAULT_PAGE_COUNT 8 /* The default number of pages in the cache */ +#define CACHE_DEFAULT_PAGE_SIZE 128 /* The default number of sectors per cache page */ + +/* EXT2 mount flags */ +#define EXT2_FLAG_RW 0x00001 /* Open the filesystem for reading and writing. Without this flag, the filesystem is opened for reading only. */ +#define EXT2_FLAG_FORCE 0x00400 /* Open the filesystem regardless of the feature sets listed in the superblock */ +#define EXT2_FLAG_JOURNAL_DEV_OK 0x01000 /* Only open external journal devices if this flag is set (e.g. ext3/ext4) */ +#define EXT2_FLAG_64BITS 0x20000 /* Use the new style 64-Bit bitmaps. For more information see gen_bitmap64.c */ +#define EXT2_FLAG_PRINT_PROGRESS 0x40000 /* If this flag is set the progress of file operations will be printed to stdout */ +#define EXT2_FLAG_DEFAULT (EXT2_FLAG_RW | EXT2_FLAG_64BITS | EXT2_FLAG_JOURNAL_DEV_OK) + +/** + * Find all EXT2/3/4 partitions on a block device. + * + * @param INTERFACE The block device to search + * @param PARTITIONS (out) A pointer to receive the array of partition start sectors + * + * @return The number of entries in PARTITIONS or -1 if an error occurred (see errno) + * @note The caller is responsible for freeing PARTITIONS when finished with it + */ +int ext2FindPartitions(const DISC_INTERFACE *interface, sec_t **partitions); + +/** + * Mount a EXT2/3/4 partition from a specific sector on a block device. + * + * @param NAME The name to mount the device under (can then be accessed as "NAME:/") + * @param INTERFACE The block device to mount + * @param STARTSECTOR The sector the partition begins at + * @param CACHEPAGECOUNT The total number of pages in the device cache + * @param CACHEPAGESIZE The number of sectors per cache page + * @param FLAGS Additional mounting flags (see above) + * + * @return True if mount was successful, false if no partition was found or an error occurred (see errno) + */ +bool ext2Mount(const char *name, const DISC_INTERFACE *interface, sec_t startSector, u32 cachePageCount, u32 cachePageSize, u32 flags); + +/** + * Unmount a EXT2/3/4 partition. + * + * @param NAME The name of mount used in ext2Mount() + */ +void ext2Unmount(const char *name); + +/** + * Get the volume name of a mounted EXT2/3/4 partition. + * + * @param NAME The name of mount + * + * @return The volumes name if successful or NULL if an error occurred (see errno) + */ +const char *ext2GetVolumeName (const char *name); + +/** + * Set the volume name of a mounted EXT2/3/4 partition. + * + * @param NAME The name of mount + * @param VOLUMENAME The new volume name + * + * @return True if mount was successful, false if an error occurred (see errno) + * @note The mount must be write-enabled else this will fail + */ +bool ext2SetVolumeName (const char *name, const char *volumeName); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/include/ext2_frag.h b/portlibs/include/ext2_frag.h new file mode 100644 index 00000000..50732777 --- /dev/null +++ b/portlibs/include/ext2_frag.h @@ -0,0 +1,16 @@ +#ifndef EXT2_FRAG_H_ +#define EXT2_FRAG_H_ + +#ifdef __cplusplus +extern "C" { +#endif + +typedef int (*_ext2_frag_append_t)(void *ff, u32 offset, u32 sector, u32 count); + +int _EXT2_get_fragments(const char *in_path, _ext2_frag_append_t append_fragment, void *callback_data); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/include/fat.h b/portlibs/include/fat.h new file mode 100644 index 00000000..82c973d3 --- /dev/null +++ b/portlibs/include/fat.h @@ -0,0 +1,104 @@ +/* + fat.h + Simple functionality for startup, mounting and unmounting of FAT-based devices. + + Copyright (c) 2006 - 2009 + Michael "Chishm" Chisholm + Dave "WinterMute" Murphy + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + + +#ifndef _LIBFAT_H +#define _LIBFAT_H + +#ifdef __cplusplus +extern "C" { +#endif + +// When compiling for NDS, make sure NDS is defined +#ifndef NDS + #if defined ARM9 || defined ARM7 + #define NDS + #endif +#endif + +#include + +#if defined(__gamecube__) || defined (__wii__) +# include +#else +# ifdef NDS +# include "nds/disc_io.h" +# else +# include "disc_io.h" +# endif +#endif + +/* +Initialise any inserted block-devices. +Add the fat device driver to the devoptab, making it available for standard file functions. +cacheSize: The number of pages to allocate for each inserted block-device +setAsDefaultDevice: if true, make this the default device driver for file operations +*/ +extern bool fatInit (uint32_t cacheSize, bool setAsDefaultDevice); + +/* +Calls fatInit with setAsDefaultDevice = true and cacheSize optimised for the host system. +*/ +extern bool fatInitDefault (void); + +/* +Mount the device pointed to by interface, and set up a devoptab entry for it as "name:". +You can then access the filesystem using "name:/". +This will mount the active partition or the first valid partition on the disc, +and will use a cache size optimized for the host system. +*/ +extern bool fatMountSimple (const char* name, const DISC_INTERFACE* interface); + +/* +Mount the device pointed to by interface, and set up a devoptab entry for it as "name:". +You can then access the filesystem using "name:/". +If startSector = 0, it will mount the active partition of the first valid partition on +the disc. Otherwise it will try to mount the partition starting at startSector. +cacheSize specifies the number of pages to allocate for the cache. +This will not startup the disc, so you need to call interface->startup(); first. +*/ +extern bool fatMount (const char* name, const DISC_INTERFACE* interface, sec_t startSector, uint32_t cacheSize, uint32_t SectorsPerPage); + +/* +Unmount the partition specified by name. +If there are open files, it will attempt to synchronise them to disc. +*/ +extern void fatUnmount (const char* name); + +/* +Get Volume Label +*/ +extern void fatGetVolumeLabel (const char* name, char *label); + +#ifdef __cplusplus +} +#endif + +#endif // _LIBFAT_H diff --git a/portlibs/include/fatfile_frag.h b/portlibs/include/fatfile_frag.h new file mode 100644 index 00000000..3af9b32e --- /dev/null +++ b/portlibs/include/fatfile_frag.h @@ -0,0 +1,16 @@ +#ifndef FAT_FRAG_H_ +#define FAT_FRAG_H_ + +#ifdef __cplusplus +extern "C" { +#endif + +typedef int (*_fat_frag_append_t)(void *ff, u32 offset, u32 sector, u32 count); + +int _FAT_get_fragments (const char *path, _fat_frag_append_t append_fragment, void *callback_data); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/include/freetype/config/ftconfig.h b/portlibs/include/freetype/config/ftconfig.h new file mode 100644 index 00000000..169da3cf --- /dev/null +++ b/portlibs/include/freetype/config/ftconfig.h @@ -0,0 +1,500 @@ +/***************************************************************************/ +/* */ +/* ftconfig.h */ +/* */ +/* ANSI-specific configuration file (specification only). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This header file contains a number of macro definitions that are used */ + /* by the rest of the engine. Most of the macros here are automatically */ + /* determined at compile time, and you should not need to change it to */ + /* port FreeType, except to compile the library with a non-ANSI */ + /* compiler. */ + /* */ + /* Note however that if some specific modifications are needed, we */ + /* advise you to place a modified copy in your build directory. */ + /* */ + /* The build directory is usually `freetype/builds/', and */ + /* contains system-specific files that are always included first when */ + /* building the library. */ + /* */ + /* This ANSI version should stay in `include/freetype/config'. */ + /* */ + /*************************************************************************/ + + +#ifndef __FTCONFIG_H__ +#define __FTCONFIG_H__ + +#include +#include FT_CONFIG_OPTIONS_H +#include FT_CONFIG_STANDARD_LIBRARY_H + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* PLATFORM-SPECIFIC CONFIGURATION MACROS */ + /* */ + /* These macros can be toggled to suit a specific system. The current */ + /* ones are defaults used to compile FreeType in an ANSI C environment */ + /* (16bit compilers are also supported). Copy this file to your own */ + /* `freetype/builds/' directory, and edit it to port the engine. */ + /* */ + /*************************************************************************/ + + + /* There are systems (like the Texas Instruments 'C54x) where a `char' */ + /* has 16 bits. ANSI C says that sizeof(char) is always 1. Since an */ + /* `int' has 16 bits also for this system, sizeof(int) gives 1 which */ + /* is probably unexpected. */ + /* */ + /* `CHAR_BIT' (defined in limits.h) gives the number of bits in a */ + /* `char' type. */ + +#ifndef FT_CHAR_BIT +#define FT_CHAR_BIT CHAR_BIT +#endif + + + /* The size of an `int' type. */ +#if FT_UINT_MAX == 0xFFFFUL +#define FT_SIZEOF_INT (16 / FT_CHAR_BIT) +#elif FT_UINT_MAX == 0xFFFFFFFFUL +#define FT_SIZEOF_INT (32 / FT_CHAR_BIT) +#elif FT_UINT_MAX > 0xFFFFFFFFUL && FT_UINT_MAX == 0xFFFFFFFFFFFFFFFFUL +#define FT_SIZEOF_INT (64 / FT_CHAR_BIT) +#else +#error "Unsupported size of `int' type!" +#endif + + /* The size of a `long' type. A five-byte `long' (as used e.g. on the */ + /* DM642) is recognized but avoided. */ +#if FT_ULONG_MAX == 0xFFFFFFFFUL +#define FT_SIZEOF_LONG (32 / FT_CHAR_BIT) +#elif FT_ULONG_MAX > 0xFFFFFFFFUL && FT_ULONG_MAX == 0xFFFFFFFFFFUL +#define FT_SIZEOF_LONG (32 / FT_CHAR_BIT) +#elif FT_ULONG_MAX > 0xFFFFFFFFUL && FT_ULONG_MAX == 0xFFFFFFFFFFFFFFFFUL +#define FT_SIZEOF_LONG (64 / FT_CHAR_BIT) +#else +#error "Unsupported size of `long' type!" +#endif + + + /* Preferred alignment of data */ +#define FT_ALIGNMENT 8 + + + /* FT_UNUSED is a macro used to indicate that a given parameter is not */ + /* used -- this is only used to get rid of unpleasant compiler warnings */ +#ifndef FT_UNUSED +#define FT_UNUSED( arg ) ( (arg) = (arg) ) +#endif + + + /*************************************************************************/ + /* */ + /* AUTOMATIC CONFIGURATION MACROS */ + /* */ + /* These macros are computed from the ones defined above. Don't touch */ + /* their definition, unless you know precisely what you are doing. No */ + /* porter should need to mess with them. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* Mac support */ + /* */ + /* This is the only necessary change, so it is defined here instead */ + /* providing a new configuration file. */ + /* */ +#if ( defined( __APPLE__ ) && !defined( DARWIN_NO_CARBON ) ) || \ + ( defined( __MWERKS__ ) && defined( macintosh ) ) + /* no Carbon frameworks for 64bit 10.4.x */ +#include "AvailabilityMacros.h" +#if defined( __LP64__ ) && \ + ( MAC_OS_X_VERSION_MIN_REQUIRED <= MAC_OS_X_VERSION_10_4 ) +#define DARWIN_NO_CARBON 1 +#else +#define FT_MACINTOSH 1 +#endif + +#elif defined( __SC__ ) || defined( __MRC__ ) + /* Classic MacOS compilers */ +#include "ConditionalMacros.h" +#if TARGET_OS_MAC +#define FT_MACINTOSH 1 +#endif + +#endif + + + /*************************************************************************/ + /* */ + /*

*/ + /* basic_types */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* */ + /* FT_Int16 */ + /* */ + /* */ + /* A typedef for a 16bit signed integer type. */ + /* */ + typedef signed short FT_Int16; + + + /*************************************************************************/ + /* */ + /* */ + /* FT_UInt16 */ + /* */ + /* */ + /* A typedef for a 16bit unsigned integer type. */ + /* */ + typedef unsigned short FT_UInt16; + + /* */ + + + /* this #if 0 ... #endif clause is for documentation purposes */ +#if 0 + + /*************************************************************************/ + /* */ + /* */ + /* FT_Int32 */ + /* */ + /* */ + /* A typedef for a 32bit signed integer type. The size depends on */ + /* the configuration. */ + /* */ + typedef signed XXX FT_Int32; + + + /*************************************************************************/ + /* */ + /* */ + /* FT_UInt32 */ + /* */ + /* A typedef for a 32bit unsigned integer type. The size depends on */ + /* the configuration. */ + /* */ + typedef unsigned XXX FT_UInt32; + + /* */ + +#endif + +#if FT_SIZEOF_INT == (32 / FT_CHAR_BIT) + + typedef signed int FT_Int32; + typedef unsigned int FT_UInt32; + +#elif FT_SIZEOF_LONG == (32 / FT_CHAR_BIT) + + typedef signed long FT_Int32; + typedef unsigned long FT_UInt32; + +#else +#error "no 32bit type found -- please check your configuration files" +#endif + + + /* look up an integer type that is at least 32 bits */ +#if FT_SIZEOF_INT >= (32 / FT_CHAR_BIT) + + typedef int FT_Fast; + typedef unsigned int FT_UFast; + +#elif FT_SIZEOF_LONG >= (32 / FT_CHAR_BIT) + + typedef long FT_Fast; + typedef unsigned long FT_UFast; + +#endif + + + /* determine whether we have a 64-bit int type for platforms without */ + /* Autoconf */ +#if FT_SIZEOF_LONG == (64 / FT_CHAR_BIT) + + /* FT_LONG64 must be defined if a 64-bit type is available */ +#define FT_LONG64 +#define FT_INT64 long + +#elif defined( _MSC_VER ) && _MSC_VER >= 900 /* Visual C++ (and Intel C++) */ + + /* this compiler provides the __int64 type */ +#define FT_LONG64 +#define FT_INT64 __int64 + +#elif defined( __BORLANDC__ ) /* Borland C++ */ + + /* XXXX: We should probably check the value of __BORLANDC__ in order */ + /* to test the compiler version. */ + + /* this compiler provides the __int64 type */ +#define FT_LONG64 +#define FT_INT64 __int64 + +#elif defined( __WATCOMC__ ) /* Watcom C++ */ + + /* Watcom doesn't provide 64-bit data types */ + +#elif defined( __MWERKS__ ) /* Metrowerks CodeWarrior */ + +#define FT_LONG64 +#define FT_INT64 long long int + +#elif defined( __GNUC__ ) + + /* GCC provides the `long long' type */ +#define FT_LONG64 +#define FT_INT64 long long int + +#endif /* FT_SIZEOF_LONG == (64 / FT_CHAR_BIT) */ + + + /*************************************************************************/ + /* */ + /* A 64-bit data type will create compilation problems if you compile */ + /* in strict ANSI mode. To avoid them, we disable its use if __STDC__ */ + /* is defined. You can however ignore this rule by defining the */ + /* FT_CONFIG_OPTION_FORCE_INT64 configuration macro. */ + /* */ +#if defined( FT_LONG64 ) && !defined( FT_CONFIG_OPTION_FORCE_INT64 ) + +#ifdef __STDC__ + + /* undefine the 64-bit macros in strict ANSI compilation mode */ +#undef FT_LONG64 +#undef FT_INT64 + +#endif /* __STDC__ */ + +#endif /* FT_LONG64 && !FT_CONFIG_OPTION_FORCE_INT64 */ + + +#define FT_BEGIN_STMNT do { +#define FT_END_STMNT } while ( 0 ) +#define FT_DUMMY_STMNT FT_BEGIN_STMNT FT_END_STMNT + + +#ifndef FT_CONFIG_OPTION_NO_ASSEMBLER + /* Provide assembler fragments for performance-critical functions. */ + /* These must be defined `static __inline__' with GCC. */ + +#ifdef __GNUC__ + +#if defined( __arm__ ) && !defined( __thumb__ ) +#define FT_MULFIX_ASSEMBLER FT_MulFix_arm + + /* documentation is in freetype.h */ + + static __inline__ FT_Int32 + FT_MulFix_arm( FT_Int32 a, + FT_Int32 b ) + { + register FT_Int32 t, t2; + + + asm __volatile__ ( + "smull %1, %2, %4, %3\n\t" /* (lo=%1,hi=%2) = a*b */ + "mov %0, %2, asr #31\n\t" /* %0 = (hi >> 31) */ + "add %0, %0, #0x8000\n\t" /* %0 += 0x8000 */ + "adds %1, %1, %0\n\t" /* %1 += %0 */ + "adc %2, %2, #0\n\t" /* %2 += carry */ + "mov %0, %1, lsr #16\n\t" /* %0 = %1 >> 16 */ + "orr %0, %2, lsl #16\n\t" /* %0 |= %2 << 16 */ + : "=r"(a), "=&r"(t2), "=&r"(t) + : "r"(a), "r"(b) ); + return a; + } + +#endif /* __arm__ && !__thumb__ */ + +#if defined( i386 ) +#define FT_MULFIX_ASSEMBLER FT_MulFix_i386 + + /* documentation is in freetype.h */ + + static __inline__ FT_Int32 + FT_MulFix_i386( FT_Int32 a, + FT_Int32 b ) + { + register FT_Int32 result; + + + __asm__ __volatile__ ( + "imul %%edx\n" + "movl %%edx, %%ecx\n" + "sarl $31, %%ecx\n" + "addl $0x8000, %%ecx\n" + "addl %%ecx, %%eax\n" + "adcl $0, %%edx\n" + "shrl $16, %%eax\n" + "shll $16, %%edx\n" + "addl %%edx, %%eax\n" + : "=a"(result), "+d"(b) + : "a"(a) + : "%ecx" ); + return result; + } + +#endif /* i386 */ + +#endif /* __GNUC__ */ + +#endif /* !FT_CONFIG_OPTION_NO_ASSEMBLER */ + + +#ifdef FT_CONFIG_OPTION_INLINE_MULFIX +#ifdef FT_MULFIX_ASSEMBLER +#define FT_MULFIX_INLINED FT_MULFIX_ASSEMBLER +#endif +#endif + + +#ifdef FT_MAKE_OPTION_SINGLE_OBJECT + +#define FT_LOCAL( x ) static x +#define FT_LOCAL_DEF( x ) static x + +#else + +#ifdef __cplusplus +#define FT_LOCAL( x ) extern "C" x +#define FT_LOCAL_DEF( x ) extern "C" x +#else +#define FT_LOCAL( x ) extern x +#define FT_LOCAL_DEF( x ) x +#endif + +#endif /* FT_MAKE_OPTION_SINGLE_OBJECT */ + + +#ifndef FT_BASE + +#ifdef __cplusplus +#define FT_BASE( x ) extern "C" x +#else +#define FT_BASE( x ) extern x +#endif + +#endif /* !FT_BASE */ + + +#ifndef FT_BASE_DEF + +#ifdef __cplusplus +#define FT_BASE_DEF( x ) x +#else +#define FT_BASE_DEF( x ) x +#endif + +#endif /* !FT_BASE_DEF */ + + +#ifndef FT_EXPORT + +#ifdef __cplusplus +#define FT_EXPORT( x ) extern "C" x +#else +#define FT_EXPORT( x ) extern x +#endif + +#endif /* !FT_EXPORT */ + + +#ifndef FT_EXPORT_DEF + +#ifdef __cplusplus +#define FT_EXPORT_DEF( x ) extern "C" x +#else +#define FT_EXPORT_DEF( x ) extern x +#endif + +#endif /* !FT_EXPORT_DEF */ + + +#ifndef FT_EXPORT_VAR + +#ifdef __cplusplus +#define FT_EXPORT_VAR( x ) extern "C" x +#else +#define FT_EXPORT_VAR( x ) extern x +#endif + +#endif /* !FT_EXPORT_VAR */ + + /* The following macros are needed to compile the library with a */ + /* C++ compiler and with 16bit compilers. */ + /* */ + + /* This is special. Within C++, you must specify `extern "C"' for */ + /* functions which are used via function pointers, and you also */ + /* must do that for structures which contain function pointers to */ + /* assure C linkage -- it's not possible to have (local) anonymous */ + /* functions which are accessed by (global) function pointers. */ + /* */ + /* */ + /* FT_CALLBACK_DEF is used to _define_ a callback function. */ + /* */ + /* FT_CALLBACK_TABLE is used to _declare_ a constant variable that */ + /* contains pointers to callback functions. */ + /* */ + /* FT_CALLBACK_TABLE_DEF is used to _define_ a constant variable */ + /* that contains pointers to callback functions. */ + /* */ + /* */ + /* Some 16bit compilers have to redefine these macros to insert */ + /* the infamous `_cdecl' or `__fastcall' declarations. */ + /* */ +#ifndef FT_CALLBACK_DEF +#ifdef __cplusplus +#define FT_CALLBACK_DEF( x ) extern "C" x +#else +#define FT_CALLBACK_DEF( x ) static x +#endif +#endif /* FT_CALLBACK_DEF */ + +#ifndef FT_CALLBACK_TABLE +#ifdef __cplusplus +#define FT_CALLBACK_TABLE extern "C" +#define FT_CALLBACK_TABLE_DEF extern "C" +#else +#define FT_CALLBACK_TABLE extern +#define FT_CALLBACK_TABLE_DEF /* nothing */ +#endif +#endif /* FT_CALLBACK_TABLE */ + + +FT_END_HEADER + + +#endif /* __FTCONFIG_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/config/ftheader.h b/portlibs/include/freetype/config/ftheader.h new file mode 100644 index 00000000..b63945dc --- /dev/null +++ b/portlibs/include/freetype/config/ftheader.h @@ -0,0 +1,780 @@ +/***************************************************************************/ +/* */ +/* ftheader.h */ +/* */ +/* Build macros of the FreeType 2 library. */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + +#ifndef __FT_HEADER_H__ +#define __FT_HEADER_H__ + + + /*@***********************************************************************/ + /* */ + /* */ + /* FT_BEGIN_HEADER */ + /* */ + /* */ + /* This macro is used in association with @FT_END_HEADER in header */ + /* files to ensure that the declarations within are properly */ + /* encapsulated in an `extern "C" { .. }' block when included from a */ + /* C++ compiler. */ + /* */ +#ifdef __cplusplus +#define FT_BEGIN_HEADER extern "C" { +#else +#define FT_BEGIN_HEADER /* nothing */ +#endif + + + /*@***********************************************************************/ + /* */ + /* */ + /* FT_END_HEADER */ + /* */ + /* */ + /* This macro is used in association with @FT_BEGIN_HEADER in header */ + /* files to ensure that the declarations within are properly */ + /* encapsulated in an `extern "C" { .. }' block when included from a */ + /* C++ compiler. */ + /* */ +#ifdef __cplusplus +#define FT_END_HEADER } +#else +#define FT_END_HEADER /* nothing */ +#endif + + + /*************************************************************************/ + /* */ + /* Aliases for the FreeType 2 public and configuration files. */ + /* */ + /*************************************************************************/ + + /*************************************************************************/ + /* */ + /*
*/ + /* header_file_macros */ + /* */ + /* */ + /* Header File Macros */ + /* */ + /* <Abstract> */ + /* Macro definitions used to #include specific header files. */ + /* */ + /* <Description> */ + /* The following macros are defined to the name of specific */ + /* FreeType~2 header files. They can be used directly in #include */ + /* statements as in: */ + /* */ + /* { */ + /* #include FT_FREETYPE_H */ + /* #include FT_MULTIPLE_MASTERS_H */ + /* #include FT_GLYPH_H */ + /* } */ + /* */ + /* There are several reasons why we are now using macros to name */ + /* public header files. The first one is that such macros are not */ + /* limited to the infamous 8.3~naming rule required by DOS (and */ + /* `FT_MULTIPLE_MASTERS_H' is a lot more meaningful than `ftmm.h'). */ + /* */ + /* The second reason is that it allows for more flexibility in the */ + /* way FreeType~2 is installed on a given system. */ + /* */ + /*************************************************************************/ + + + /* configuration files */ + + /************************************************************************* + * + * @macro: + * FT_CONFIG_CONFIG_H + * + * @description: + * A macro used in #include statements to name the file containing + * FreeType~2 configuration data. + * + */ +#ifndef FT_CONFIG_CONFIG_H +#define FT_CONFIG_CONFIG_H <freetype/config/ftconfig.h> +#endif + + + /************************************************************************* + * + * @macro: + * FT_CONFIG_STANDARD_LIBRARY_H + * + * @description: + * A macro used in #include statements to name the file containing + * FreeType~2 interface to the standard C library functions. + * + */ +#ifndef FT_CONFIG_STANDARD_LIBRARY_H +#define FT_CONFIG_STANDARD_LIBRARY_H <freetype/config/ftstdlib.h> +#endif + + + /************************************************************************* + * + * @macro: + * FT_CONFIG_OPTIONS_H + * + * @description: + * A macro used in #include statements to name the file containing + * FreeType~2 project-specific configuration options. + * + */ +#ifndef FT_CONFIG_OPTIONS_H +#define FT_CONFIG_OPTIONS_H <freetype/config/ftoption.h> +#endif + + + /************************************************************************* + * + * @macro: + * FT_CONFIG_MODULES_H + * + * @description: + * A macro used in #include statements to name the file containing the + * list of FreeType~2 modules that are statically linked to new library + * instances in @FT_Init_FreeType. + * + */ +#ifndef FT_CONFIG_MODULES_H +#define FT_CONFIG_MODULES_H <freetype/config/ftmodule.h> +#endif + + /* */ + + /* public headers */ + + /************************************************************************* + * + * @macro: + * FT_FREETYPE_H + * + * @description: + * A macro used in #include statements to name the file containing the + * base FreeType~2 API. + * + */ +#define FT_FREETYPE_H <freetype/freetype.h> + + + /************************************************************************* + * + * @macro: + * FT_ERRORS_H + * + * @description: + * A macro used in #include statements to name the file containing the + * list of FreeType~2 error codes (and messages). + * + * It is included by @FT_FREETYPE_H. + * + */ +#define FT_ERRORS_H <freetype/fterrors.h> + + + /************************************************************************* + * + * @macro: + * FT_MODULE_ERRORS_H + * + * @description: + * A macro used in #include statements to name the file containing the + * list of FreeType~2 module error offsets (and messages). + * + */ +#define FT_MODULE_ERRORS_H <freetype/ftmoderr.h> + + + /************************************************************************* + * + * @macro: + * FT_SYSTEM_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 interface to low-level operations (i.e., memory management + * and stream i/o). + * + * It is included by @FT_FREETYPE_H. + * + */ +#define FT_SYSTEM_H <freetype/ftsystem.h> + + + /************************************************************************* + * + * @macro: + * FT_IMAGE_H + * + * @description: + * A macro used in #include statements to name the file containing type + * definitions related to glyph images (i.e., bitmaps, outlines, + * scan-converter parameters). + * + * It is included by @FT_FREETYPE_H. + * + */ +#define FT_IMAGE_H <freetype/ftimage.h> + + + /************************************************************************* + * + * @macro: + * FT_TYPES_H + * + * @description: + * A macro used in #include statements to name the file containing the + * basic data types defined by FreeType~2. + * + * It is included by @FT_FREETYPE_H. + * + */ +#define FT_TYPES_H <freetype/fttypes.h> + + + /************************************************************************* + * + * @macro: + * FT_LIST_H + * + * @description: + * A macro used in #include statements to name the file containing the + * list management API of FreeType~2. + * + * (Most applications will never need to include this file.) + * + */ +#define FT_LIST_H <freetype/ftlist.h> + + + /************************************************************************* + * + * @macro: + * FT_OUTLINE_H + * + * @description: + * A macro used in #include statements to name the file containing the + * scalable outline management API of FreeType~2. + * + */ +#define FT_OUTLINE_H <freetype/ftoutln.h> + + + /************************************************************************* + * + * @macro: + * FT_SIZES_H + * + * @description: + * A macro used in #include statements to name the file containing the + * API which manages multiple @FT_Size objects per face. + * + */ +#define FT_SIZES_H <freetype/ftsizes.h> + + + /************************************************************************* + * + * @macro: + * FT_MODULE_H + * + * @description: + * A macro used in #include statements to name the file containing the + * module management API of FreeType~2. + * + */ +#define FT_MODULE_H <freetype/ftmodapi.h> + + + /************************************************************************* + * + * @macro: + * FT_RENDER_H + * + * @description: + * A macro used in #include statements to name the file containing the + * renderer module management API of FreeType~2. + * + */ +#define FT_RENDER_H <freetype/ftrender.h> + + + /************************************************************************* + * + * @macro: + * FT_TYPE1_TABLES_H + * + * @description: + * A macro used in #include statements to name the file containing the + * types and API specific to the Type~1 format. + * + */ +#define FT_TYPE1_TABLES_H <freetype/t1tables.h> + + + /************************************************************************* + * + * @macro: + * FT_TRUETYPE_IDS_H + * + * @description: + * A macro used in #include statements to name the file containing the + * enumeration values which identify name strings, languages, encodings, + * etc. This file really contains a _large_ set of constant macro + * definitions, taken from the TrueType and OpenType specifications. + * + */ +#define FT_TRUETYPE_IDS_H <freetype/ttnameid.h> + + + /************************************************************************* + * + * @macro: + * FT_TRUETYPE_TABLES_H + * + * @description: + * A macro used in #include statements to name the file containing the + * types and API specific to the TrueType (as well as OpenType) format. + * + */ +#define FT_TRUETYPE_TABLES_H <freetype/tttables.h> + + + /************************************************************************* + * + * @macro: + * FT_TRUETYPE_TAGS_H + * + * @description: + * A macro used in #include statements to name the file containing the + * definitions of TrueType four-byte `tags' which identify blocks in + * SFNT-based font formats (i.e., TrueType and OpenType). + * + */ +#define FT_TRUETYPE_TAGS_H <freetype/tttags.h> + + + /************************************************************************* + * + * @macro: + * FT_BDF_H + * + * @description: + * A macro used in #include statements to name the file containing the + * definitions of an API which accesses BDF-specific strings from a + * face. + * + */ +#define FT_BDF_H <freetype/ftbdf.h> + + + /************************************************************************* + * + * @macro: + * FT_CID_H + * + * @description: + * A macro used in #include statements to name the file containing the + * definitions of an API which access CID font information from a + * face. + * + */ +#define FT_CID_H <freetype/ftcid.h> + + + /************************************************************************* + * + * @macro: + * FT_GZIP_H + * + * @description: + * A macro used in #include statements to name the file containing the + * definitions of an API which supports gzip-compressed files. + * + */ +#define FT_GZIP_H <freetype/ftgzip.h> + + + /************************************************************************* + * + * @macro: + * FT_LZW_H + * + * @description: + * A macro used in #include statements to name the file containing the + * definitions of an API which supports LZW-compressed files. + * + */ +#define FT_LZW_H <freetype/ftlzw.h> + + + /************************************************************************* + * + * @macro: + * FT_WINFONTS_H + * + * @description: + * A macro used in #include statements to name the file containing the + * definitions of an API which supports Windows FNT files. + * + */ +#define FT_WINFONTS_H <freetype/ftwinfnt.h> + + + /************************************************************************* + * + * @macro: + * FT_GLYPH_H + * + * @description: + * A macro used in #include statements to name the file containing the + * API of the optional glyph management component. + * + */ +#define FT_GLYPH_H <freetype/ftglyph.h> + + + /************************************************************************* + * + * @macro: + * FT_BITMAP_H + * + * @description: + * A macro used in #include statements to name the file containing the + * API of the optional bitmap conversion component. + * + */ +#define FT_BITMAP_H <freetype/ftbitmap.h> + + + /************************************************************************* + * + * @macro: + * FT_BBOX_H + * + * @description: + * A macro used in #include statements to name the file containing the + * API of the optional exact bounding box computation routines. + * + */ +#define FT_BBOX_H <freetype/ftbbox.h> + + + /************************************************************************* + * + * @macro: + * FT_CACHE_H + * + * @description: + * A macro used in #include statements to name the file containing the + * API of the optional FreeType~2 cache sub-system. + * + */ +#define FT_CACHE_H <freetype/ftcache.h> + + + /************************************************************************* + * + * @macro: + * FT_CACHE_IMAGE_H + * + * @description: + * A macro used in #include statements to name the file containing the + * `glyph image' API of the FreeType~2 cache sub-system. + * + * It is used to define a cache for @FT_Glyph elements. You can also + * use the API defined in @FT_CACHE_SMALL_BITMAPS_H if you only need to + * store small glyph bitmaps, as it will use less memory. + * + * This macro is deprecated. Simply include @FT_CACHE_H to have all + * glyph image-related cache declarations. + * + */ +#define FT_CACHE_IMAGE_H FT_CACHE_H + + + /************************************************************************* + * + * @macro: + * FT_CACHE_SMALL_BITMAPS_H + * + * @description: + * A macro used in #include statements to name the file containing the + * `small bitmaps' API of the FreeType~2 cache sub-system. + * + * It is used to define a cache for small glyph bitmaps in a relatively + * memory-efficient way. You can also use the API defined in + * @FT_CACHE_IMAGE_H if you want to cache arbitrary glyph images, + * including scalable outlines. + * + * This macro is deprecated. Simply include @FT_CACHE_H to have all + * small bitmaps-related cache declarations. + * + */ +#define FT_CACHE_SMALL_BITMAPS_H FT_CACHE_H + + + /************************************************************************* + * + * @macro: + * FT_CACHE_CHARMAP_H + * + * @description: + * A macro used in #include statements to name the file containing the + * `charmap' API of the FreeType~2 cache sub-system. + * + * This macro is deprecated. Simply include @FT_CACHE_H to have all + * charmap-based cache declarations. + * + */ +#define FT_CACHE_CHARMAP_H FT_CACHE_H + + + /************************************************************************* + * + * @macro: + * FT_MAC_H + * + * @description: + * A macro used in #include statements to name the file containing the + * Macintosh-specific FreeType~2 API. The latter is used to access + * fonts embedded in resource forks. + * + * This header file must be explicitly included by client applications + * compiled on the Mac (note that the base API still works though). + * + */ +#define FT_MAC_H <freetype/ftmac.h> + + + /************************************************************************* + * + * @macro: + * FT_MULTIPLE_MASTERS_H + * + * @description: + * A macro used in #include statements to name the file containing the + * optional multiple-masters management API of FreeType~2. + * + */ +#define FT_MULTIPLE_MASTERS_H <freetype/ftmm.h> + + + /************************************************************************* + * + * @macro: + * FT_SFNT_NAMES_H + * + * @description: + * A macro used in #include statements to name the file containing the + * optional FreeType~2 API which accesses embedded `name' strings in + * SFNT-based font formats (i.e., TrueType and OpenType). + * + */ +#define FT_SFNT_NAMES_H <freetype/ftsnames.h> + + + /************************************************************************* + * + * @macro: + * FT_OPENTYPE_VALIDATE_H + * + * @description: + * A macro used in #include statements to name the file containing the + * optional FreeType~2 API which validates OpenType tables (BASE, GDEF, + * GPOS, GSUB, JSTF). + * + */ +#define FT_OPENTYPE_VALIDATE_H <freetype/ftotval.h> + + + /************************************************************************* + * + * @macro: + * FT_GX_VALIDATE_H + * + * @description: + * A macro used in #include statements to name the file containing the + * optional FreeType~2 API which validates TrueTypeGX/AAT tables (feat, + * mort, morx, bsln, just, kern, opbd, trak, prop). + * + */ +#define FT_GX_VALIDATE_H <freetype/ftgxval.h> + + + /************************************************************************* + * + * @macro: + * FT_PFR_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 API which accesses PFR-specific data. + * + */ +#define FT_PFR_H <freetype/ftpfr.h> + + + /************************************************************************* + * + * @macro: + * FT_STROKER_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 API which provides functions to stroke outline paths. + */ +#define FT_STROKER_H <freetype/ftstroke.h> + + + /************************************************************************* + * + * @macro: + * FT_SYNTHESIS_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 API which performs artificial obliquing and emboldening. + */ +#define FT_SYNTHESIS_H <freetype/ftsynth.h> + + + /************************************************************************* + * + * @macro: + * FT_XFREE86_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 API which provides functions specific to the XFree86 and + * X.Org X11 servers. + */ +#define FT_XFREE86_H <freetype/ftxf86.h> + + + /************************************************************************* + * + * @macro: + * FT_TRIGONOMETRY_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 API which performs trigonometric computations (e.g., + * cosines and arc tangents). + */ +#define FT_TRIGONOMETRY_H <freetype/fttrigon.h> + + + /************************************************************************* + * + * @macro: + * FT_LCD_FILTER_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 API which performs color filtering for subpixel rendering. + */ +#define FT_LCD_FILTER_H <freetype/ftlcdfil.h> + + + /************************************************************************* + * + * @macro: + * FT_UNPATENTED_HINTING_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 API which performs color filtering for subpixel rendering. + */ +#define FT_UNPATENTED_HINTING_H <freetype/ttunpat.h> + + + /************************************************************************* + * + * @macro: + * FT_INCREMENTAL_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 API which performs color filtering for subpixel rendering. + */ +#define FT_INCREMENTAL_H <freetype/ftincrem.h> + + + /************************************************************************* + * + * @macro: + * FT_GASP_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 API which returns entries from the TrueType GASP table. + */ +#define FT_GASP_H <freetype/ftgasp.h> + + + /************************************************************************* + * + * @macro: + * FT_ADVANCES_H + * + * @description: + * A macro used in #include statements to name the file containing the + * FreeType~2 API which returns individual and ranged glyph advances. + */ +#define FT_ADVANCES_H <freetype/ftadvanc.h> + + + /* */ + +#define FT_ERROR_DEFINITIONS_H <freetype/fterrdef.h> + + + /* The internals of the cache sub-system are no longer exposed. We */ + /* default to FT_CACHE_H at the moment just in case, but we know of */ + /* no rogue client that uses them. */ + /* */ +#define FT_CACHE_MANAGER_H <freetype/ftcache.h> +#define FT_CACHE_INTERNAL_MRU_H <freetype/ftcache.h> +#define FT_CACHE_INTERNAL_MANAGER_H <freetype/ftcache.h> +#define FT_CACHE_INTERNAL_CACHE_H <freetype/ftcache.h> +#define FT_CACHE_INTERNAL_GLYPH_H <freetype/ftcache.h> +#define FT_CACHE_INTERNAL_IMAGE_H <freetype/ftcache.h> +#define FT_CACHE_INTERNAL_SBITS_H <freetype/ftcache.h> + + +#define FT_INCREMENTAL_H <freetype/ftincrem.h> + +#define FT_TRUETYPE_UNPATENTED_H <freetype/ttunpat.h> + + + /* + * Include internal headers definitions from <freetype/internal/...> + * only when building the library. + */ +#ifdef FT2_BUILD_LIBRARY +#define FT_INTERNAL_INTERNAL_H <freetype/internal/internal.h> +#include FT_INTERNAL_INTERNAL_H +#endif /* FT2_BUILD_LIBRARY */ + + +#endif /* __FT2_BUILD_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/config/ftmodule.h b/portlibs/include/freetype/config/ftmodule.h new file mode 100644 index 00000000..76d271a7 --- /dev/null +++ b/portlibs/include/freetype/config/ftmodule.h @@ -0,0 +1,32 @@ +/* + * This file registers the FreeType modules compiled into the library. + * + * If you use GNU make, this file IS NOT USED! Instead, it is created in + * the objects directory (normally `<topdir>/objs/') based on information + * from `<topdir>/modules.cfg'. + * + * Please read `docs/INSTALL.ANY' and `docs/CUSTOMIZE' how to compile + * FreeType without GNU make. + * + */ + +FT_USE_MODULE( FT_Module_Class, autofit_module_class ) +FT_USE_MODULE( FT_Driver_ClassRec, tt_driver_class ) +FT_USE_MODULE( FT_Driver_ClassRec, t1_driver_class ) +FT_USE_MODULE( FT_Driver_ClassRec, cff_driver_class ) +FT_USE_MODULE( FT_Driver_ClassRec, t1cid_driver_class ) +FT_USE_MODULE( FT_Driver_ClassRec, pfr_driver_class ) +FT_USE_MODULE( FT_Driver_ClassRec, t42_driver_class ) +FT_USE_MODULE( FT_Driver_ClassRec, winfnt_driver_class ) +FT_USE_MODULE( FT_Driver_ClassRec, pcf_driver_class ) +FT_USE_MODULE( FT_Module_Class, psaux_module_class ) +FT_USE_MODULE( FT_Module_Class, psnames_module_class ) +FT_USE_MODULE( FT_Module_Class, pshinter_module_class ) +FT_USE_MODULE( FT_Renderer_Class, ft_raster1_renderer_class ) +FT_USE_MODULE( FT_Module_Class, sfnt_module_class ) +FT_USE_MODULE( FT_Renderer_Class, ft_smooth_renderer_class ) +FT_USE_MODULE( FT_Renderer_Class, ft_smooth_lcd_renderer_class ) +FT_USE_MODULE( FT_Renderer_Class, ft_smooth_lcdv_renderer_class ) +FT_USE_MODULE( FT_Driver_ClassRec, bdf_driver_class ) + +/* EOF */ diff --git a/portlibs/include/freetype/config/ftoption.h b/portlibs/include/freetype/config/ftoption.h new file mode 100644 index 00000000..597a2bb0 --- /dev/null +++ b/portlibs/include/freetype/config/ftoption.h @@ -0,0 +1,693 @@ +/***************************************************************************/ +/* */ +/* ftoption.h */ +/* */ +/* User-selectable configuration macros (specification only). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTOPTION_H__ +#define __FTOPTION_H__ + + +#include <ft2build.h> + + +FT_BEGIN_HEADER + + /*************************************************************************/ + /* */ + /* USER-SELECTABLE CONFIGURATION MACROS */ + /* */ + /* This file contains the default configuration macro definitions for */ + /* a standard build of the FreeType library. There are three ways to */ + /* use this file to build project-specific versions of the library: */ + /* */ + /* - You can modify this file by hand, but this is not recommended in */ + /* cases where you would like to build several versions of the */ + /* library from a single source directory. */ + /* */ + /* - You can put a copy of this file in your build directory, more */ + /* precisely in `$BUILD/freetype/config/ftoption.h', where `$BUILD' */ + /* is the name of a directory that is included _before_ the FreeType */ + /* include path during compilation. */ + /* */ + /* The default FreeType Makefiles and Jamfiles use the build */ + /* directory `builds/<system>' by default, but you can easily change */ + /* that for your own projects. */ + /* */ + /* - Copy the file <ft2build.h> to `$BUILD/ft2build.h' and modify it */ + /* slightly to pre-define the macro FT_CONFIG_OPTIONS_H used to */ + /* locate this file during the build. For example, */ + /* */ + /* #define FT_CONFIG_OPTIONS_H <myftoptions.h> */ + /* #include <freetype/config/ftheader.h> */ + /* */ + /* will use `$BUILD/myftoptions.h' instead of this file for macro */ + /* definitions. */ + /* */ + /* Note also that you can similarly pre-define the macro */ + /* FT_CONFIG_MODULES_H used to locate the file listing of the modules */ + /* that are statically linked to the library at compile time. By */ + /* default, this file is <freetype/config/ftmodule.h>. */ + /* */ + /* We highly recommend using the third method whenever possible. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** G E N E R A L F R E E T Y P E 2 C O N F I G U R A T I O N ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* Uncomment the line below if you want to activate sub-pixel rendering */ + /* (a.k.a. LCD rendering, or ClearType) in this build of the library. */ + /* */ + /* Note that this feature is covered by several Microsoft patents */ + /* and should not be activated in any default build of the library. */ + /* */ + /* This macro has no impact on the FreeType API, only on its */ + /* _implementation_. For example, using FT_RENDER_MODE_LCD when calling */ + /* FT_Render_Glyph still generates a bitmap that is 3 times larger than */ + /* the original size; the difference will be that each triplet of */ + /* subpixels has R=G=B. */ + /* */ + /* This is done to allow FreeType clients to run unmodified, forcing */ + /* them to display normal gray-level anti-aliased glyphs. */ + /* */ +/* #define FT_CONFIG_OPTION_SUBPIXEL_RENDERING */ + + + /*************************************************************************/ + /* */ + /* Many compilers provide a non-ANSI 64-bit data type that can be used */ + /* by FreeType to speed up some computations. However, this will create */ + /* some problems when compiling the library in strict ANSI mode. */ + /* */ + /* For this reason, the use of 64-bit integers is normally disabled when */ + /* the __STDC__ macro is defined. You can however disable this by */ + /* defining the macro FT_CONFIG_OPTION_FORCE_INT64 here. */ + /* */ + /* For most compilers, this will only create compilation warnings when */ + /* building the library. */ + /* */ + /* ObNote: The compiler-specific 64-bit integers are detected in the */ + /* file `ftconfig.h' either statically or through the */ + /* `configure' script on supported platforms. */ + /* */ +#undef FT_CONFIG_OPTION_FORCE_INT64 + + + /*************************************************************************/ + /* */ + /* If this macro is defined, do not try to use an assembler version of */ + /* performance-critical functions (e.g. FT_MulFix). You should only do */ + /* that to verify that the assembler function works properly, or to */ + /* execute benchmark tests of the various implementations. */ +/* #define FT_CONFIG_OPTION_NO_ASSEMBLER */ + + + /*************************************************************************/ + /* */ + /* If this macro is defined, try to use an inlined assembler version of */ + /* the `FT_MulFix' function, which is a `hotspot' when loading and */ + /* hinting glyphs, and which should be executed as fast as possible. */ + /* */ + /* Note that if your compiler or CPU is not supported, this will default */ + /* to the standard and portable implementation found in `ftcalc.c'. */ + /* */ +#define FT_CONFIG_OPTION_INLINE_MULFIX + + + /*************************************************************************/ + /* */ + /* LZW-compressed file support. */ + /* */ + /* FreeType now handles font files that have been compressed with the */ + /* `compress' program. This is mostly used to parse many of the PCF */ + /* files that come with various X11 distributions. The implementation */ + /* uses NetBSD's `zopen' to partially uncompress the file on the fly */ + /* (see src/lzw/ftgzip.c). */ + /* */ + /* Define this macro if you want to enable this `feature'. */ + /* */ +#define FT_CONFIG_OPTION_USE_LZW + + + /*************************************************************************/ + /* */ + /* Gzip-compressed file support. */ + /* */ + /* FreeType now handles font files that have been compressed with the */ + /* `gzip' program. This is mostly used to parse many of the PCF files */ + /* that come with XFree86. The implementation uses `zlib' to */ + /* partially uncompress the file on the fly (see src/gzip/ftgzip.c). */ + /* */ + /* Define this macro if you want to enable this `feature'. See also */ + /* the macro FT_CONFIG_OPTION_SYSTEM_ZLIB below. */ + /* */ +#define FT_CONFIG_OPTION_USE_ZLIB + + + /*************************************************************************/ + /* */ + /* ZLib library selection */ + /* */ + /* This macro is only used when FT_CONFIG_OPTION_USE_ZLIB is defined. */ + /* It allows FreeType's `ftgzip' component to link to the system's */ + /* installation of the ZLib library. This is useful on systems like */ + /* Unix or VMS where it generally is already available. */ + /* */ + /* If you let it undefined, the component will use its own copy */ + /* of the zlib sources instead. These have been modified to be */ + /* included directly within the component and *not* export external */ + /* function names. This allows you to link any program with FreeType */ + /* _and_ ZLib without linking conflicts. */ + /* */ + /* Do not #undef this macro here since the build system might define */ + /* it for certain configurations only. */ + /* */ +/* #define FT_CONFIG_OPTION_SYSTEM_ZLIB */ + + + /*************************************************************************/ + /* */ + /* DLL export compilation */ + /* */ + /* When compiling FreeType as a DLL, some systems/compilers need a */ + /* special keyword in front OR after the return type of function */ + /* declarations. */ + /* */ + /* Two macros are used within the FreeType source code to define */ + /* exported library functions: FT_EXPORT and FT_EXPORT_DEF. */ + /* */ + /* FT_EXPORT( return_type ) */ + /* */ + /* is used in a function declaration, as in */ + /* */ + /* FT_EXPORT( FT_Error ) */ + /* FT_Init_FreeType( FT_Library* alibrary ); */ + /* */ + /* */ + /* FT_EXPORT_DEF( return_type ) */ + /* */ + /* is used in a function definition, as in */ + /* */ + /* FT_EXPORT_DEF( FT_Error ) */ + /* FT_Init_FreeType( FT_Library* alibrary ) */ + /* { */ + /* ... some code ... */ + /* return FT_Err_Ok; */ + /* } */ + /* */ + /* You can provide your own implementation of FT_EXPORT and */ + /* FT_EXPORT_DEF here if you want. If you leave them undefined, they */ + /* will be later automatically defined as `extern return_type' to */ + /* allow normal compilation. */ + /* */ + /* Do not #undef these macros here since the build system might define */ + /* them for certain configurations only. */ + /* */ +/* #define FT_EXPORT(x) extern x */ +/* #define FT_EXPORT_DEF(x) x */ + + + /*************************************************************************/ + /* */ + /* Glyph Postscript Names handling */ + /* */ + /* By default, FreeType 2 is compiled with the `psnames' module. This */ + /* module is in charge of converting a glyph name string into a */ + /* Unicode value, or return a Macintosh standard glyph name for the */ + /* use with the TrueType `post' table. */ + /* */ + /* Undefine this macro if you do not want `psnames' compiled in your */ + /* build of FreeType. This has the following effects: */ + /* */ + /* - The TrueType driver will provide its own set of glyph names, */ + /* if you build it to support postscript names in the TrueType */ + /* `post' table. */ + /* */ + /* - The Type 1 driver will not be able to synthesize a Unicode */ + /* charmap out of the glyphs found in the fonts. */ + /* */ + /* You would normally undefine this configuration macro when building */ + /* a version of FreeType that doesn't contain a Type 1 or CFF driver. */ + /* */ +#define FT_CONFIG_OPTION_POSTSCRIPT_NAMES + + + /*************************************************************************/ + /* */ + /* Postscript Names to Unicode Values support */ + /* */ + /* By default, FreeType 2 is built with the `PSNames' module compiled */ + /* in. Among other things, the module is used to convert a glyph name */ + /* into a Unicode value. This is especially useful in order to */ + /* synthesize on the fly a Unicode charmap from the CFF/Type 1 driver */ + /* through a big table named the `Adobe Glyph List' (AGL). */ + /* */ + /* Undefine this macro if you do not want the Adobe Glyph List */ + /* compiled in your `PSNames' module. The Type 1 driver will not be */ + /* able to synthesize a Unicode charmap out of the glyphs found in the */ + /* fonts. */ + /* */ +#define FT_CONFIG_OPTION_ADOBE_GLYPH_LIST + + + /*************************************************************************/ + /* */ + /* Support for Mac fonts */ + /* */ + /* Define this macro if you want support for outline fonts in Mac */ + /* format (mac dfont, mac resource, macbinary containing a mac */ + /* resource) on non-Mac platforms. */ + /* */ + /* Note that the `FOND' resource isn't checked. */ + /* */ +#define FT_CONFIG_OPTION_MAC_FONTS + + + /*************************************************************************/ + /* */ + /* Guessing methods to access embedded resource forks */ + /* */ + /* Enable extra Mac fonts support on non-Mac platforms (e.g. */ + /* GNU/Linux). */ + /* */ + /* Resource forks which include fonts data are stored sometimes in */ + /* locations which users or developers don't expected. In some cases, */ + /* resource forks start with some offset from the head of a file. In */ + /* other cases, the actual resource fork is stored in file different */ + /* from what the user specifies. If this option is activated, */ + /* FreeType tries to guess whether such offsets or different file */ + /* names must be used. */ + /* */ + /* Note that normal, direct access of resource forks is controlled via */ + /* the FT_CONFIG_OPTION_MAC_FONTS option. */ + /* */ +#ifdef FT_CONFIG_OPTION_MAC_FONTS +#define FT_CONFIG_OPTION_GUESSING_EMBEDDED_RFORK +#endif + + + /*************************************************************************/ + /* */ + /* Allow the use of FT_Incremental_Interface to load typefaces that */ + /* contain no glyph data, but supply it via a callback function. */ + /* This allows FreeType to be used with the PostScript language, using */ + /* the GhostScript interpreter. */ + /* */ +/* #define FT_CONFIG_OPTION_INCREMENTAL */ + + + /*************************************************************************/ + /* */ + /* The size in bytes of the render pool used by the scan-line converter */ + /* to do all of its work. */ + /* */ + /* This must be greater than 4KByte if you use FreeType to rasterize */ + /* glyphs; otherwise, you may set it to zero to avoid unnecessary */ + /* allocation of the render pool. */ + /* */ +#define FT_RENDER_POOL_SIZE 16384L + + + /*************************************************************************/ + /* */ + /* FT_MAX_MODULES */ + /* */ + /* The maximum number of modules that can be registered in a single */ + /* FreeType library object. 32 is the default. */ + /* */ +#define FT_MAX_MODULES 32 + + + /*************************************************************************/ + /* */ + /* Debug level */ + /* */ + /* FreeType can be compiled in debug or trace mode. In debug mode, */ + /* errors are reported through the `ftdebug' component. In trace */ + /* mode, additional messages are sent to the standard output during */ + /* execution. */ + /* */ + /* Define FT_DEBUG_LEVEL_ERROR to build the library in debug mode. */ + /* Define FT_DEBUG_LEVEL_TRACE to build it in trace mode. */ + /* */ + /* Don't define any of these macros to compile in `release' mode! */ + /* */ + /* Do not #undef these macros here since the build system might define */ + /* them for certain configurations only. */ + /* */ +/* #define FT_DEBUG_LEVEL_ERROR */ +/* #define FT_DEBUG_LEVEL_TRACE */ + + + /*************************************************************************/ + /* */ + /* Memory Debugging */ + /* */ + /* FreeType now comes with an integrated memory debugger that is */ + /* capable of detecting simple errors like memory leaks or double */ + /* deletes. To compile it within your build of the library, you */ + /* should define FT_DEBUG_MEMORY here. */ + /* */ + /* Note that the memory debugger is only activated at runtime when */ + /* when the _environment_ variable `FT2_DEBUG_MEMORY' is defined also! */ + /* */ + /* Do not #undef this macro here since the build system might define */ + /* it for certain configurations only. */ + /* */ +/* #define FT_DEBUG_MEMORY */ + + + /*************************************************************************/ + /* */ + /* Module errors */ + /* */ + /* If this macro is set (which is _not_ the default), the higher byte */ + /* of an error code gives the module in which the error has occurred, */ + /* while the lower byte is the real error code. */ + /* */ + /* Setting this macro makes sense for debugging purposes only, since */ + /* it would break source compatibility of certain programs that use */ + /* FreeType 2. */ + /* */ + /* More details can be found in the files ftmoderr.h and fterrors.h. */ + /* */ +#undef FT_CONFIG_OPTION_USE_MODULE_ERRORS + + + + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** S F N T D R I V E R C O N F I G U R A T I O N ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* Define TT_CONFIG_OPTION_EMBEDDED_BITMAPS if you want to support */ + /* embedded bitmaps in all formats using the SFNT module (namely */ + /* TrueType & OpenType). */ + /* */ +#define TT_CONFIG_OPTION_EMBEDDED_BITMAPS + + + /*************************************************************************/ + /* */ + /* Define TT_CONFIG_OPTION_POSTSCRIPT_NAMES if you want to be able to */ + /* load and enumerate the glyph Postscript names in a TrueType or */ + /* OpenType file. */ + /* */ + /* Note that when you do not compile the `PSNames' module by undefining */ + /* the above FT_CONFIG_OPTION_POSTSCRIPT_NAMES, the `sfnt' module will */ + /* contain additional code used to read the PS Names table from a font. */ + /* */ + /* (By default, the module uses `PSNames' to extract glyph names.) */ + /* */ +#define TT_CONFIG_OPTION_POSTSCRIPT_NAMES + + + /*************************************************************************/ + /* */ + /* Define TT_CONFIG_OPTION_SFNT_NAMES if your applications need to */ + /* access the internal name table in a SFNT-based format like TrueType */ + /* or OpenType. The name table contains various strings used to */ + /* describe the font, like family name, copyright, version, etc. It */ + /* does not contain any glyph name though. */ + /* */ + /* Accessing SFNT names is done through the functions declared in */ + /* `freetype/ftnames.h'. */ + /* */ +#define TT_CONFIG_OPTION_SFNT_NAMES + + + /*************************************************************************/ + /* */ + /* TrueType CMap support */ + /* */ + /* Here you can fine-tune which TrueType CMap table format shall be */ + /* supported. */ +#define TT_CONFIG_CMAP_FORMAT_0 +#define TT_CONFIG_CMAP_FORMAT_2 +#define TT_CONFIG_CMAP_FORMAT_4 +#define TT_CONFIG_CMAP_FORMAT_6 +#define TT_CONFIG_CMAP_FORMAT_8 +#define TT_CONFIG_CMAP_FORMAT_10 +#define TT_CONFIG_CMAP_FORMAT_12 +#define TT_CONFIG_CMAP_FORMAT_14 + + + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** T R U E T Y P E D R I V E R C O N F I G U R A T I O N ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + + /*************************************************************************/ + /* */ + /* Define TT_CONFIG_OPTION_BYTECODE_INTERPRETER if you want to compile */ + /* a bytecode interpreter in the TrueType driver. Note that there are */ + /* important patent issues related to the use of the interpreter. */ + /* */ + /* By undefining this, you will only compile the code necessary to load */ + /* TrueType glyphs without hinting. */ + /* */ + /* Do not #undef this macro here, since the build system might */ + /* define it for certain configurations only. */ + /* */ +/* #define TT_CONFIG_OPTION_BYTECODE_INTERPRETER */ + + + /*************************************************************************/ + /* */ + /* If you define TT_CONFIG_OPTION_UNPATENTED_HINTING, a special version */ + /* of the TrueType bytecode interpreter is used that doesn't implement */ + /* any of the patented opcodes and algorithms. Note that the */ + /* TT_CONFIG_OPTION_UNPATENTED_HINTING macro is *ignored* if you define */ + /* TT_CONFIG_OPTION_BYTECODE_INTERPRETER; in other words, either define */ + /* TT_CONFIG_OPTION_BYTECODE_INTERPRETER or */ + /* TT_CONFIG_OPTION_UNPATENTED_HINTING but not both at the same time. */ + /* */ + /* This macro is only useful for a small number of font files (mostly */ + /* for Asian scripts) that require bytecode interpretation to properly */ + /* load glyphs. For all other fonts, this produces unpleasant results, */ + /* thus the unpatented interpreter is never used to load glyphs from */ + /* TrueType fonts unless one of the following two options is used. */ + /* */ + /* - The unpatented interpreter is explicitly activated by the user */ + /* through the FT_PARAM_TAG_UNPATENTED_HINTING parameter tag */ + /* when opening the FT_Face. */ + /* */ + /* - FreeType detects that the FT_Face corresponds to one of the */ + /* `trick' fonts (e.g., `Mingliu') it knows about. The font engine */ + /* contains a hard-coded list of font names and other matching */ + /* parameters (see function `tt_face_init' in file */ + /* `src/truetype/ttobjs.c'). */ + /* */ + /* Here a sample code snippet for using FT_PARAM_TAG_UNPATENTED_HINTING. */ + /* */ + /* { */ + /* FT_Parameter parameter; */ + /* FT_Open_Args open_args; */ + /* */ + /* */ + /* parameter.tag = FT_PARAM_TAG_UNPATENTED_HINTING; */ + /* */ + /* open_args.flags = FT_OPEN_PATHNAME | FT_OPEN_PARAMS; */ + /* open_args.pathname = my_font_pathname; */ + /* open_args.num_params = 1; */ + /* open_args.params = ¶meter; */ + /* */ + /* error = FT_Open_Face( library, &open_args, index, &face ); */ + /* ... */ + /* } */ + /* */ +#define TT_CONFIG_OPTION_UNPATENTED_HINTING + + + /*************************************************************************/ + /* */ + /* Define TT_CONFIG_OPTION_INTERPRETER_SWITCH to compile the TrueType */ + /* bytecode interpreter with a huge switch statement, rather than a call */ + /* table. This results in smaller and faster code for a number of */ + /* architectures. */ + /* */ + /* Note however that on some compiler/processor combinations, undefining */ + /* this macro will generate faster, though larger, code. */ + /* */ +#define TT_CONFIG_OPTION_INTERPRETER_SWITCH + + + /*************************************************************************/ + /* */ + /* Define TT_CONFIG_OPTION_COMPONENT_OFFSET_SCALED to compile the */ + /* TrueType glyph loader to use Apple's definition of how to handle */ + /* component offsets in composite glyphs. */ + /* */ + /* Apple and MS disagree on the default behavior of component offsets */ + /* in composites. Apple says that they should be scaled by the scaling */ + /* factors in the transformation matrix (roughly, it's more complex) */ + /* while MS says they should not. OpenType defines two bits in the */ + /* composite flags array which can be used to disambiguate, but old */ + /* fonts will not have them. */ + /* */ + /* http://partners.adobe.com/asn/developer/opentype/glyf.html */ + /* http://fonts.apple.com/TTRefMan/RM06/Chap6glyf.html */ + /* */ +#undef TT_CONFIG_OPTION_COMPONENT_OFFSET_SCALED + + + /*************************************************************************/ + /* */ + /* Define TT_CONFIG_OPTION_GX_VAR_SUPPORT if you want to include */ + /* support for Apple's distortable font technology (fvar, gvar, cvar, */ + /* and avar tables). This has many similarities to Type 1 Multiple */ + /* Masters support. */ + /* */ +#define TT_CONFIG_OPTION_GX_VAR_SUPPORT + + + /*************************************************************************/ + /* */ + /* Define TT_CONFIG_OPTION_BDF if you want to include support for */ + /* an embedded `BDF ' table within SFNT-based bitmap formats. */ + /* */ +#define TT_CONFIG_OPTION_BDF + + + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** T Y P E 1 D R I V E R C O N F I G U R A T I O N ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* T1_MAX_DICT_DEPTH is the maximal depth of nest dictionaries and */ + /* arrays in the Type 1 stream (see t1load.c). A minimum of 4 is */ + /* required. */ + /* */ +#define T1_MAX_DICT_DEPTH 5 + + + /*************************************************************************/ + /* */ + /* T1_MAX_SUBRS_CALLS details the maximum number of nested sub-routine */ + /* calls during glyph loading. */ + /* */ +#define T1_MAX_SUBRS_CALLS 16 + + + /*************************************************************************/ + /* */ + /* T1_MAX_CHARSTRING_OPERANDS is the charstring stack's capacity. A */ + /* minimum of 16 is required. */ + /* */ + /* The Chinese font MingTiEG-Medium (CNS 11643 character set) needs 256. */ + /* */ +#define T1_MAX_CHARSTRINGS_OPERANDS 256 + + + /*************************************************************************/ + /* */ + /* Define this configuration macro if you want to prevent the */ + /* compilation of `t1afm', which is in charge of reading Type 1 AFM */ + /* files into an existing face. Note that if set, the T1 driver will be */ + /* unable to produce kerning distances. */ + /* */ +#undef T1_CONFIG_OPTION_NO_AFM + + + /*************************************************************************/ + /* */ + /* Define this configuration macro if you want to prevent the */ + /* compilation of the Multiple Masters font support in the Type 1 */ + /* driver. */ + /* */ +#undef T1_CONFIG_OPTION_NO_MM_SUPPORT + + + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** A U T O F I T M O D U L E C O N F I G U R A T I O N ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* Compile autofit module with CJK (Chinese, Japanese, Korean) script */ + /* support. */ + /* */ +#define AF_CONFIG_OPTION_CJK + + /*************************************************************************/ + /* */ + /* Compile autofit module with Indic script support. */ + /* */ +#define AF_CONFIG_OPTION_INDIC + + /* */ + + + /* + * Define this variable if you want to keep the layout of internal + * structures that was used prior to FreeType 2.2. This also compiles in + * a few obsolete functions to avoid linking problems on typical Unix + * distributions. + * + * For embedded systems or building a new distribution from scratch, it + * is recommended to disable the macro since it reduces the library's code + * size and activates a few memory-saving optimizations as well. + */ +#define FT_CONFIG_OPTION_OLD_INTERNALS + + + /* + * This macro is defined if either unpatented or native TrueType + * hinting is requested by the definitions above. + */ +#ifdef TT_CONFIG_OPTION_BYTECODE_INTERPRETER +#define TT_USE_BYTECODE_INTERPRETER +#undef TT_CONFIG_OPTION_UNPATENTED_HINTING +#elif defined TT_CONFIG_OPTION_UNPATENTED_HINTING +#define TT_USE_BYTECODE_INTERPRETER +#endif + +FT_END_HEADER + + +#endif /* __FTOPTION_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/config/ftstdlib.h b/portlibs/include/freetype/config/ftstdlib.h new file mode 100644 index 00000000..ce5557ae --- /dev/null +++ b/portlibs/include/freetype/config/ftstdlib.h @@ -0,0 +1,172 @@ +/***************************************************************************/ +/* */ +/* ftstdlib.h */ +/* */ +/* ANSI-specific library and header configuration file (specification */ +/* only). */ +/* */ +/* Copyright 2002, 2003, 2004, 2005, 2006, 2007, 2009 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This file is used to group all #includes to the ANSI C library that */ + /* FreeType normally requires. It also defines macros to rename the */ + /* standard functions within the FreeType source code. */ + /* */ + /* Load a file which defines __FTSTDLIB_H__ before this one to override */ + /* it. */ + /* */ + /*************************************************************************/ + + +#ifndef __FTSTDLIB_H__ +#define __FTSTDLIB_H__ + + +#include <stddef.h> + +#define ft_ptrdiff_t ptrdiff_t + + + /**********************************************************************/ + /* */ + /* integer limits */ + /* */ + /* UINT_MAX and ULONG_MAX are used to automatically compute the size */ + /* of `int' and `long' in bytes at compile-time. So far, this works */ + /* for all platforms the library has been tested on. */ + /* */ + /* Note that on the extremely rare platforms that do not provide */ + /* integer types that are _exactly_ 16 and 32 bits wide (e.g. some */ + /* old Crays where `int' is 36 bits), we do not make any guarantee */ + /* about the correct behaviour of FT2 with all fonts. */ + /* */ + /* In these case, `ftconfig.h' will refuse to compile anyway with a */ + /* message like `couldn't find 32-bit type' or something similar. */ + /* */ + /**********************************************************************/ + + +#include <limits.h> + +#define FT_CHAR_BIT CHAR_BIT +#define FT_INT_MAX INT_MAX +#define FT_UINT_MAX UINT_MAX +#define FT_ULONG_MAX ULONG_MAX + + + /**********************************************************************/ + /* */ + /* character and string processing */ + /* */ + /**********************************************************************/ + + +#include <string.h> + +#define ft_memchr memchr +#define ft_memcmp memcmp +#define ft_memcpy memcpy +#define ft_memmove memmove +#define ft_memset memset +#define ft_strcat strcat +#define ft_strcmp strcmp +#define ft_strcpy strcpy +#define ft_strlen strlen +#define ft_strncmp strncmp +#define ft_strncpy strncpy +#define ft_strrchr strrchr +#define ft_strstr strstr + + + /**********************************************************************/ + /* */ + /* file handling */ + /* */ + /**********************************************************************/ + + +#include <stdio.h> + +#define FT_FILE FILE +#define ft_fclose fclose +#define ft_fopen fopen +#define ft_fread fread +#define ft_fseek fseek +#define ft_ftell ftell +#define ft_sprintf sprintf + + + /**********************************************************************/ + /* */ + /* sorting */ + /* */ + /**********************************************************************/ + + +#include <stdlib.h> + +#define ft_qsort qsort + + + /**********************************************************************/ + /* */ + /* memory allocation */ + /* */ + /**********************************************************************/ + + +#define ft_scalloc calloc +#define ft_sfree free +#define ft_smalloc malloc +#define ft_srealloc realloc + + + /**********************************************************************/ + /* */ + /* miscellaneous */ + /* */ + /**********************************************************************/ + + +#define ft_atol atol +#define ft_labs labs + + + /**********************************************************************/ + /* */ + /* execution control */ + /* */ + /**********************************************************************/ + + +#include <setjmp.h> + +#define ft_jmp_buf jmp_buf /* note: this cannot be a typedef since */ + /* jmp_buf is defined as a macro */ + /* on certain platforms */ + +#define ft_longjmp longjmp +#define ft_setjmp( b ) setjmp( *(jmp_buf*) &(b) ) /* same thing here */ + + + /* the following is only used for debugging purposes, i.e., if */ + /* FT_DEBUG_LEVEL_ERROR or FT_DEBUG_LEVEL_TRACE are defined */ + +#include <stdarg.h> + + +#endif /* __FTSTDLIB_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/freetype.h b/portlibs/include/freetype/freetype.h new file mode 100644 index 00000000..5bc4c873 --- /dev/null +++ b/portlibs/include/freetype/freetype.h @@ -0,0 +1,3863 @@ +/***************************************************************************/ +/* */ +/* freetype.h */ +/* */ +/* FreeType high-level API and common types (specification only). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef FT_FREETYPE_H +#error "`ft2build.h' hasn't been included yet!" +#error "Please always use macros to include FreeType header files." +#error "Example:" +#error " #include <ft2build.h>" +#error " #include FT_FREETYPE_H" +#endif + + + /*************************************************************************/ + /* */ + /* The `raster' component duplicates some of the declarations in */ + /* freetype.h for stand-alone use if _FREETYPE_ isn't defined. */ + /* */ + /*************************************************************************/ + + +#ifndef __FREETYPE_H__ +#define __FREETYPE_H__ + + +#include <ft2build.h> +#include FT_CONFIG_CONFIG_H +#include FT_ERRORS_H +#include FT_TYPES_H + + +FT_BEGIN_HEADER + + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* user_allocation */ + /* */ + /* <Title> */ + /* User allocation */ + /* */ + /* <Abstract> */ + /* How client applications should allocate FreeType data structures. */ + /* */ + /* <Description> */ + /* FreeType assumes that structures allocated by the user and passed */ + /* as arguments are zeroed out except for the actual data. In other */ + /* words, it is recommended to use `calloc' (or variants of it) */ + /* instead of `malloc' for allocation. */ + /* */ + /*************************************************************************/ + + + + /*************************************************************************/ + /*************************************************************************/ + /* */ + /* B A S I C T Y P E S */ + /* */ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* base_interface */ + /* */ + /* <Title> */ + /* Base Interface */ + /* */ + /* <Abstract> */ + /* The FreeType~2 base font interface. */ + /* */ + /* <Description> */ + /* This section describes the public high-level API of FreeType~2. */ + /* */ + /* <Order> */ + /* FT_Library */ + /* FT_Face */ + /* FT_Size */ + /* FT_GlyphSlot */ + /* FT_CharMap */ + /* FT_Encoding */ + /* */ + /* FT_FaceRec */ + /* */ + /* FT_FACE_FLAG_SCALABLE */ + /* FT_FACE_FLAG_FIXED_SIZES */ + /* FT_FACE_FLAG_FIXED_WIDTH */ + /* FT_FACE_FLAG_HORIZONTAL */ + /* FT_FACE_FLAG_VERTICAL */ + /* FT_FACE_FLAG_SFNT */ + /* FT_FACE_FLAG_KERNING */ + /* FT_FACE_FLAG_MULTIPLE_MASTERS */ + /* FT_FACE_FLAG_GLYPH_NAMES */ + /* FT_FACE_FLAG_EXTERNAL_STREAM */ + /* FT_FACE_FLAG_FAST_GLYPHS */ + /* FT_FACE_FLAG_HINTER */ + /* */ + /* FT_STYLE_FLAG_BOLD */ + /* FT_STYLE_FLAG_ITALIC */ + /* */ + /* FT_SizeRec */ + /* FT_Size_Metrics */ + /* */ + /* FT_GlyphSlotRec */ + /* FT_Glyph_Metrics */ + /* FT_SubGlyph */ + /* */ + /* FT_Bitmap_Size */ + /* */ + /* FT_Init_FreeType */ + /* FT_Done_FreeType */ + /* */ + /* FT_New_Face */ + /* FT_Done_Face */ + /* FT_New_Memory_Face */ + /* FT_Open_Face */ + /* FT_Open_Args */ + /* FT_Parameter */ + /* FT_Attach_File */ + /* FT_Attach_Stream */ + /* */ + /* FT_Set_Char_Size */ + /* FT_Set_Pixel_Sizes */ + /* FT_Request_Size */ + /* FT_Select_Size */ + /* FT_Size_Request_Type */ + /* FT_Size_Request */ + /* FT_Set_Transform */ + /* FT_Load_Glyph */ + /* FT_Get_Char_Index */ + /* FT_Get_Name_Index */ + /* FT_Load_Char */ + /* */ + /* FT_OPEN_MEMORY */ + /* FT_OPEN_STREAM */ + /* FT_OPEN_PATHNAME */ + /* FT_OPEN_DRIVER */ + /* FT_OPEN_PARAMS */ + /* */ + /* FT_LOAD_DEFAULT */ + /* FT_LOAD_RENDER */ + /* FT_LOAD_MONOCHROME */ + /* FT_LOAD_LINEAR_DESIGN */ + /* FT_LOAD_NO_SCALE */ + /* FT_LOAD_NO_HINTING */ + /* FT_LOAD_NO_BITMAP */ + /* FT_LOAD_CROP_BITMAP */ + /* */ + /* FT_LOAD_VERTICAL_LAYOUT */ + /* FT_LOAD_IGNORE_TRANSFORM */ + /* FT_LOAD_IGNORE_GLOBAL_ADVANCE_WIDTH */ + /* FT_LOAD_FORCE_AUTOHINT */ + /* FT_LOAD_NO_RECURSE */ + /* FT_LOAD_PEDANTIC */ + /* */ + /* FT_LOAD_TARGET_NORMAL */ + /* FT_LOAD_TARGET_LIGHT */ + /* FT_LOAD_TARGET_MONO */ + /* FT_LOAD_TARGET_LCD */ + /* FT_LOAD_TARGET_LCD_V */ + /* */ + /* FT_Render_Glyph */ + /* FT_Render_Mode */ + /* FT_Get_Kerning */ + /* FT_Kerning_Mode */ + /* FT_Get_Track_Kerning */ + /* FT_Get_Glyph_Name */ + /* FT_Get_Postscript_Name */ + /* */ + /* FT_CharMapRec */ + /* FT_Select_Charmap */ + /* FT_Set_Charmap */ + /* FT_Get_Charmap_Index */ + /* */ + /* FT_FSTYPE_INSTALLABLE_EMBEDDING */ + /* FT_FSTYPE_RESTRICTED_LICENSE_EMBEDDING */ + /* FT_FSTYPE_PREVIEW_AND_PRINT_EMBEDDING */ + /* FT_FSTYPE_EDITABLE_EMBEDDING */ + /* FT_FSTYPE_NO_SUBSETTING */ + /* FT_FSTYPE_BITMAP_EMBEDDING_ONLY */ + /* */ + /* FT_Get_FSType_Flags */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Glyph_Metrics */ + /* */ + /* <Description> */ + /* A structure used to model the metrics of a single glyph. The */ + /* values are expressed in 26.6 fractional pixel format; if the flag */ + /* @FT_LOAD_NO_SCALE has been used while loading the glyph, values */ + /* are expressed in font units instead. */ + /* */ + /* <Fields> */ + /* width :: */ + /* The glyph's width. */ + /* */ + /* height :: */ + /* The glyph's height. */ + /* */ + /* horiBearingX :: */ + /* Left side bearing for horizontal layout. */ + /* */ + /* horiBearingY :: */ + /* Top side bearing for horizontal layout. */ + /* */ + /* horiAdvance :: */ + /* Advance width for horizontal layout. */ + /* */ + /* vertBearingX :: */ + /* Left side bearing for vertical layout. */ + /* */ + /* vertBearingY :: */ + /* Top side bearing for vertical layout. */ + /* */ + /* vertAdvance :: */ + /* Advance height for vertical layout. */ + /* */ + typedef struct FT_Glyph_Metrics_ + { + FT_Pos width; + FT_Pos height; + + FT_Pos horiBearingX; + FT_Pos horiBearingY; + FT_Pos horiAdvance; + + FT_Pos vertBearingX; + FT_Pos vertBearingY; + FT_Pos vertAdvance; + + } FT_Glyph_Metrics; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Bitmap_Size */ + /* */ + /* <Description> */ + /* This structure models the metrics of a bitmap strike (i.e., a set */ + /* of glyphs for a given point size and resolution) in a bitmap font. */ + /* It is used for the `available_sizes' field of @FT_Face. */ + /* */ + /* <Fields> */ + /* height :: The vertical distance, in pixels, between two */ + /* consecutive baselines. It is always positive. */ + /* */ + /* width :: The average width, in pixels, of all glyphs in the */ + /* strike. */ + /* */ + /* size :: The nominal size of the strike in 26.6 fractional */ + /* points. This field is not very useful. */ + /* */ + /* x_ppem :: The horizontal ppem (nominal width) in 26.6 fractional */ + /* pixels. */ + /* */ + /* y_ppem :: The vertical ppem (nominal height) in 26.6 fractional */ + /* pixels. */ + /* */ + /* <Note> */ + /* Windows FNT: */ + /* The nominal size given in a FNT font is not reliable. Thus when */ + /* the driver finds it incorrect, it sets `size' to some calculated */ + /* values and sets `x_ppem' and `y_ppem' to the pixel width and */ + /* height given in the font, respectively. */ + /* */ + /* TrueType embedded bitmaps: */ + /* `size', `width', and `height' values are not contained in the */ + /* bitmap strike itself. They are computed from the global font */ + /* parameters. */ + /* */ + typedef struct FT_Bitmap_Size_ + { + FT_Short height; + FT_Short width; + + FT_Pos size; + + FT_Pos x_ppem; + FT_Pos y_ppem; + + } FT_Bitmap_Size; + + + /*************************************************************************/ + /*************************************************************************/ + /* */ + /* O B J E C T C L A S S E S */ + /* */ + /*************************************************************************/ + /*************************************************************************/ + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Library */ + /* */ + /* <Description> */ + /* A handle to a FreeType library instance. Each `library' is */ + /* completely independent from the others; it is the `root' of a set */ + /* of objects like fonts, faces, sizes, etc. */ + /* */ + /* It also embeds a memory manager (see @FT_Memory), as well as a */ + /* scan-line converter object (see @FT_Raster). */ + /* */ + /* For multi-threading applications each thread should have its own */ + /* FT_Library object. */ + /* */ + /* <Note> */ + /* Library objects are normally created by @FT_Init_FreeType, and */ + /* destroyed with @FT_Done_FreeType. */ + /* */ + typedef struct FT_LibraryRec_ *FT_Library; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Module */ + /* */ + /* <Description> */ + /* A handle to a given FreeType module object. Each module can be a */ + /* font driver, a renderer, or anything else that provides services */ + /* to the formers. */ + /* */ + typedef struct FT_ModuleRec_* FT_Module; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Driver */ + /* */ + /* <Description> */ + /* A handle to a given FreeType font driver object. Each font driver */ + /* is a special module capable of creating faces from font files. */ + /* */ + typedef struct FT_DriverRec_* FT_Driver; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Renderer */ + /* */ + /* <Description> */ + /* A handle to a given FreeType renderer. A renderer is a special */ + /* module in charge of converting a glyph image to a bitmap, when */ + /* necessary. Each renderer supports a given glyph image format, and */ + /* one or more target surface depths. */ + /* */ + typedef struct FT_RendererRec_* FT_Renderer; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Face */ + /* */ + /* <Description> */ + /* A handle to a given typographic face object. A face object models */ + /* a given typeface, in a given style. */ + /* */ + /* <Note> */ + /* Each face object also owns a single @FT_GlyphSlot object, as well */ + /* as one or more @FT_Size objects. */ + /* */ + /* Use @FT_New_Face or @FT_Open_Face to create a new face object from */ + /* a given filepathname or a custom input stream. */ + /* */ + /* Use @FT_Done_Face to destroy it (along with its slot and sizes). */ + /* */ + /* <Also> */ + /* The @FT_FaceRec details the publicly accessible fields of a given */ + /* face object. */ + /* */ + typedef struct FT_FaceRec_* FT_Face; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Size */ + /* */ + /* <Description> */ + /* A handle to an object used to model a face scaled to a given */ + /* character size. */ + /* */ + /* <Note> */ + /* Each @FT_Face has an _active_ @FT_Size object that is used by */ + /* functions like @FT_Load_Glyph to determine the scaling */ + /* transformation which is used to load and hint glyphs and metrics. */ + /* */ + /* You can use @FT_Set_Char_Size, @FT_Set_Pixel_Sizes, */ + /* @FT_Request_Size or even @FT_Select_Size to change the content */ + /* (i.e., the scaling values) of the active @FT_Size. */ + /* */ + /* You can use @FT_New_Size to create additional size objects for a */ + /* given @FT_Face, but they won't be used by other functions until */ + /* you activate it through @FT_Activate_Size. Only one size can be */ + /* activated at any given time per face. */ + /* */ + /* <Also> */ + /* The @FT_SizeRec structure details the publicly accessible fields */ + /* of a given size object. */ + /* */ + typedef struct FT_SizeRec_* FT_Size; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_GlyphSlot */ + /* */ + /* <Description> */ + /* A handle to a given `glyph slot'. A slot is a container where it */ + /* is possible to load any one of the glyphs contained in its parent */ + /* face. */ + /* */ + /* In other words, each time you call @FT_Load_Glyph or */ + /* @FT_Load_Char, the slot's content is erased by the new glyph data, */ + /* i.e., the glyph's metrics, its image (bitmap or outline), and */ + /* other control information. */ + /* */ + /* <Also> */ + /* @FT_GlyphSlotRec details the publicly accessible glyph fields. */ + /* */ + typedef struct FT_GlyphSlotRec_* FT_GlyphSlot; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_CharMap */ + /* */ + /* <Description> */ + /* A handle to a given character map. A charmap is used to translate */ + /* character codes in a given encoding into glyph indexes for its */ + /* parent's face. Some font formats may provide several charmaps per */ + /* font. */ + /* */ + /* Each face object owns zero or more charmaps, but only one of them */ + /* can be `active' and used by @FT_Get_Char_Index or @FT_Load_Char. */ + /* */ + /* The list of available charmaps in a face is available through the */ + /* `face->num_charmaps' and `face->charmaps' fields of @FT_FaceRec. */ + /* */ + /* The currently active charmap is available as `face->charmap'. */ + /* You should call @FT_Set_Charmap to change it. */ + /* */ + /* <Note> */ + /* When a new face is created (either through @FT_New_Face or */ + /* @FT_Open_Face), the library looks for a Unicode charmap within */ + /* the list and automatically activates it. */ + /* */ + /* <Also> */ + /* The @FT_CharMapRec details the publicly accessible fields of a */ + /* given character map. */ + /* */ + typedef struct FT_CharMapRec_* FT_CharMap; + + + /*************************************************************************/ + /* */ + /* <Macro> */ + /* FT_ENC_TAG */ + /* */ + /* <Description> */ + /* This macro converts four-letter tags into an unsigned long. It is */ + /* used to define `encoding' identifiers (see @FT_Encoding). */ + /* */ + /* <Note> */ + /* Since many 16-bit compilers don't like 32-bit enumerations, you */ + /* should redefine this macro in case of problems to something like */ + /* this: */ + /* */ + /* { */ + /* #define FT_ENC_TAG( value, a, b, c, d ) value */ + /* } */ + /* */ + /* to get a simple enumeration without assigning special numbers. */ + /* */ + +#ifndef FT_ENC_TAG +#define FT_ENC_TAG( value, a, b, c, d ) \ + value = ( ( (FT_UInt32)(a) << 24 ) | \ + ( (FT_UInt32)(b) << 16 ) | \ + ( (FT_UInt32)(c) << 8 ) | \ + (FT_UInt32)(d) ) + +#endif /* FT_ENC_TAG */ + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_Encoding */ + /* */ + /* <Description> */ + /* An enumeration used to specify character sets supported by */ + /* charmaps. Used in the @FT_Select_Charmap API function. */ + /* */ + /* <Note> */ + /* Despite the name, this enumeration lists specific character */ + /* repertories (i.e., charsets), and not text encoding methods (e.g., */ + /* UTF-8, UTF-16, GB2312_EUC, etc.). */ + /* */ + /* Because of 32-bit charcodes defined in Unicode (i.e., surrogates), */ + /* all character codes must be expressed as FT_Longs. */ + /* */ + /* Other encodings might be defined in the future. */ + /* */ + /* <Values> */ + /* FT_ENCODING_NONE :: */ + /* The encoding value~0 is reserved. */ + /* */ + /* FT_ENCODING_UNICODE :: */ + /* Corresponds to the Unicode character set. This value covers */ + /* all versions of the Unicode repertoire, including ASCII and */ + /* Latin-1. Most fonts include a Unicode charmap, but not all */ + /* of them. */ + /* */ + /* FT_ENCODING_MS_SYMBOL :: */ + /* Corresponds to the Microsoft Symbol encoding, used to encode */ + /* mathematical symbols in the 32..255 character code range. For */ + /* more information, see `http://www.ceviz.net/symbol.htm'. */ + /* */ + /* FT_ENCODING_SJIS :: */ + /* Corresponds to Japanese SJIS encoding. More info at */ + /* at `http://langsupport.japanreference.com/encoding.shtml'. */ + /* See note on multi-byte encodings below. */ + /* */ + /* FT_ENCODING_GB2312 :: */ + /* Corresponds to an encoding system for Simplified Chinese as used */ + /* used in mainland China. */ + /* */ + /* FT_ENCODING_BIG5 :: */ + /* Corresponds to an encoding system for Traditional Chinese as used */ + /* in Taiwan and Hong Kong. */ + /* */ + /* FT_ENCODING_WANSUNG :: */ + /* Corresponds to the Korean encoding system known as Wansung. */ + /* For more information see */ + /* `http://www.microsoft.com/typography/unicode/949.txt'. */ + /* */ + /* FT_ENCODING_JOHAB :: */ + /* The Korean standard character set (KS~C 5601-1992), which */ + /* corresponds to MS Windows code page 1361. This character set */ + /* includes all possible Hangeul character combinations. */ + /* */ + /* FT_ENCODING_ADOBE_LATIN_1 :: */ + /* Corresponds to a Latin-1 encoding as defined in a Type~1 */ + /* PostScript font. It is limited to 256 character codes. */ + /* */ + /* FT_ENCODING_ADOBE_STANDARD :: */ + /* Corresponds to the Adobe Standard encoding, as found in Type~1, */ + /* CFF, and OpenType/CFF fonts. It is limited to 256 character */ + /* codes. */ + /* */ + /* FT_ENCODING_ADOBE_EXPERT :: */ + /* Corresponds to the Adobe Expert encoding, as found in Type~1, */ + /* CFF, and OpenType/CFF fonts. It is limited to 256 character */ + /* codes. */ + /* */ + /* FT_ENCODING_ADOBE_CUSTOM :: */ + /* Corresponds to a custom encoding, as found in Type~1, CFF, and */ + /* OpenType/CFF fonts. It is limited to 256 character codes. */ + /* */ + /* FT_ENCODING_APPLE_ROMAN :: */ + /* Corresponds to the 8-bit Apple roman encoding. Many TrueType and */ + /* OpenType fonts contain a charmap for this encoding, since older */ + /* versions of Mac OS are able to use it. */ + /* */ + /* FT_ENCODING_OLD_LATIN_2 :: */ + /* This value is deprecated and was never used nor reported by */ + /* FreeType. Don't use or test for it. */ + /* */ + /* FT_ENCODING_MS_SJIS :: */ + /* Same as FT_ENCODING_SJIS. Deprecated. */ + /* */ + /* FT_ENCODING_MS_GB2312 :: */ + /* Same as FT_ENCODING_GB2312. Deprecated. */ + /* */ + /* FT_ENCODING_MS_BIG5 :: */ + /* Same as FT_ENCODING_BIG5. Deprecated. */ + /* */ + /* FT_ENCODING_MS_WANSUNG :: */ + /* Same as FT_ENCODING_WANSUNG. Deprecated. */ + /* */ + /* FT_ENCODING_MS_JOHAB :: */ + /* Same as FT_ENCODING_JOHAB. Deprecated. */ + /* */ + /* <Note> */ + /* By default, FreeType automatically synthesizes a Unicode charmap */ + /* for PostScript fonts, using their glyph names dictionaries. */ + /* However, it also reports the encodings defined explicitly in the */ + /* font file, for the cases when they are needed, with the Adobe */ + /* values as well. */ + /* */ + /* FT_ENCODING_NONE is set by the BDF and PCF drivers if the charmap */ + /* is neither Unicode nor ISO-8859-1 (otherwise it is set to */ + /* FT_ENCODING_UNICODE). Use @FT_Get_BDF_Charset_ID to find out which */ + /* encoding is really present. If, for example, the `cs_registry' */ + /* field is `KOI8' and the `cs_encoding' field is `R', the font is */ + /* encoded in KOI8-R. */ + /* */ + /* FT_ENCODING_NONE is always set (with a single exception) by the */ + /* winfonts driver. Use @FT_Get_WinFNT_Header and examine the */ + /* `charset' field of the @FT_WinFNT_HeaderRec structure to find out */ + /* which encoding is really present. For example, */ + /* @FT_WinFNT_ID_CP1251 (204) means Windows code page 1251 (for */ + /* Russian). */ + /* */ + /* FT_ENCODING_NONE is set if `platform_id' is @TT_PLATFORM_MACINTOSH */ + /* and `encoding_id' is not @TT_MAC_ID_ROMAN (otherwise it is set to */ + /* FT_ENCODING_APPLE_ROMAN). */ + /* */ + /* If `platform_id' is @TT_PLATFORM_MACINTOSH, use the function */ + /* @FT_Get_CMap_Language_ID to query the Mac language ID which may be */ + /* needed to be able to distinguish Apple encoding variants. See */ + /* */ + /* http://www.unicode.org/Public/MAPPINGS/VENDORS/APPLE/README.TXT */ + /* */ + /* to get an idea how to do that. Basically, if the language ID is~0, */ + /* don't use it, otherwise subtract 1 from the language ID. Then */ + /* examine `encoding_id'. If, for example, `encoding_id' is */ + /* @TT_MAC_ID_ROMAN and the language ID (minus~1) is */ + /* `TT_MAC_LANGID_GREEK', it is the Greek encoding, not Roman. */ + /* @TT_MAC_ID_ARABIC with `TT_MAC_LANGID_FARSI' means the Farsi */ + /* variant the Arabic encoding. */ + /* */ + typedef enum FT_Encoding_ + { + FT_ENC_TAG( FT_ENCODING_NONE, 0, 0, 0, 0 ), + + FT_ENC_TAG( FT_ENCODING_MS_SYMBOL, 's', 'y', 'm', 'b' ), + FT_ENC_TAG( FT_ENCODING_UNICODE, 'u', 'n', 'i', 'c' ), + + FT_ENC_TAG( FT_ENCODING_SJIS, 's', 'j', 'i', 's' ), + FT_ENC_TAG( FT_ENCODING_GB2312, 'g', 'b', ' ', ' ' ), + FT_ENC_TAG( FT_ENCODING_BIG5, 'b', 'i', 'g', '5' ), + FT_ENC_TAG( FT_ENCODING_WANSUNG, 'w', 'a', 'n', 's' ), + FT_ENC_TAG( FT_ENCODING_JOHAB, 'j', 'o', 'h', 'a' ), + + /* for backwards compatibility */ + FT_ENCODING_MS_SJIS = FT_ENCODING_SJIS, + FT_ENCODING_MS_GB2312 = FT_ENCODING_GB2312, + FT_ENCODING_MS_BIG5 = FT_ENCODING_BIG5, + FT_ENCODING_MS_WANSUNG = FT_ENCODING_WANSUNG, + FT_ENCODING_MS_JOHAB = FT_ENCODING_JOHAB, + + FT_ENC_TAG( FT_ENCODING_ADOBE_STANDARD, 'A', 'D', 'O', 'B' ), + FT_ENC_TAG( FT_ENCODING_ADOBE_EXPERT, 'A', 'D', 'B', 'E' ), + FT_ENC_TAG( FT_ENCODING_ADOBE_CUSTOM, 'A', 'D', 'B', 'C' ), + FT_ENC_TAG( FT_ENCODING_ADOBE_LATIN_1, 'l', 'a', 't', '1' ), + + FT_ENC_TAG( FT_ENCODING_OLD_LATIN_2, 'l', 'a', 't', '2' ), + + FT_ENC_TAG( FT_ENCODING_APPLE_ROMAN, 'a', 'r', 'm', 'n' ) + + } FT_Encoding; + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* ft_encoding_xxx */ + /* */ + /* <Description> */ + /* These constants are deprecated; use the corresponding @FT_Encoding */ + /* values instead. */ + /* */ +#define ft_encoding_none FT_ENCODING_NONE +#define ft_encoding_unicode FT_ENCODING_UNICODE +#define ft_encoding_symbol FT_ENCODING_MS_SYMBOL +#define ft_encoding_latin_1 FT_ENCODING_ADOBE_LATIN_1 +#define ft_encoding_latin_2 FT_ENCODING_OLD_LATIN_2 +#define ft_encoding_sjis FT_ENCODING_SJIS +#define ft_encoding_gb2312 FT_ENCODING_GB2312 +#define ft_encoding_big5 FT_ENCODING_BIG5 +#define ft_encoding_wansung FT_ENCODING_WANSUNG +#define ft_encoding_johab FT_ENCODING_JOHAB + +#define ft_encoding_adobe_standard FT_ENCODING_ADOBE_STANDARD +#define ft_encoding_adobe_expert FT_ENCODING_ADOBE_EXPERT +#define ft_encoding_adobe_custom FT_ENCODING_ADOBE_CUSTOM +#define ft_encoding_apple_roman FT_ENCODING_APPLE_ROMAN + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_CharMapRec */ + /* */ + /* <Description> */ + /* The base charmap structure. */ + /* */ + /* <Fields> */ + /* face :: A handle to the parent face object. */ + /* */ + /* encoding :: An @FT_Encoding tag identifying the charmap. Use */ + /* this with @FT_Select_Charmap. */ + /* */ + /* platform_id :: An ID number describing the platform for the */ + /* following encoding ID. This comes directly from */ + /* the TrueType specification and should be emulated */ + /* for other formats. */ + /* */ + /* encoding_id :: A platform specific encoding number. This also */ + /* comes from the TrueType specification and should be */ + /* emulated similarly. */ + /* */ + typedef struct FT_CharMapRec_ + { + FT_Face face; + FT_Encoding encoding; + FT_UShort platform_id; + FT_UShort encoding_id; + + } FT_CharMapRec; + + + /*************************************************************************/ + /*************************************************************************/ + /* */ + /* B A S E O B J E C T C L A S S E S */ + /* */ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Face_Internal */ + /* */ + /* <Description> */ + /* An opaque handle to an `FT_Face_InternalRec' structure, used to */ + /* model private data of a given @FT_Face object. */ + /* */ + /* This structure might change between releases of FreeType~2 and is */ + /* not generally available to client applications. */ + /* */ + typedef struct FT_Face_InternalRec_* FT_Face_Internal; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_FaceRec */ + /* */ + /* <Description> */ + /* FreeType root face class structure. A face object models a */ + /* typeface in a font file. */ + /* */ + /* <Fields> */ + /* num_faces :: The number of faces in the font file. Some */ + /* font formats can have multiple faces in */ + /* a font file. */ + /* */ + /* face_index :: The index of the face in the font file. It */ + /* is set to~0 if there is only one face in */ + /* the font file. */ + /* */ + /* face_flags :: A set of bit flags that give important */ + /* information about the face; see */ + /* @FT_FACE_FLAG_XXX for the details. */ + /* */ + /* style_flags :: A set of bit flags indicating the style of */ + /* the face; see @FT_STYLE_FLAG_XXX for the */ + /* details. */ + /* */ + /* num_glyphs :: The number of glyphs in the face. If the */ + /* face is scalable and has sbits (see */ + /* `num_fixed_sizes'), it is set to the number */ + /* of outline glyphs. */ + /* */ + /* For CID-keyed fonts, this value gives the */ + /* highest CID used in the font. */ + /* */ + /* family_name :: The face's family name. This is an ASCII */ + /* string, usually in English, which describes */ + /* the typeface's family (like `Times New */ + /* Roman', `Bodoni', `Garamond', etc). This */ + /* is a least common denominator used to list */ + /* fonts. Some formats (TrueType & OpenType) */ + /* provide localized and Unicode versions of */ + /* this string. Applications should use the */ + /* format specific interface to access them. */ + /* Can be NULL (e.g., in fonts embedded in a */ + /* PDF file). */ + /* */ + /* style_name :: The face's style name. This is an ASCII */ + /* string, usually in English, which describes */ + /* the typeface's style (like `Italic', */ + /* `Bold', `Condensed', etc). Not all font */ + /* formats provide a style name, so this field */ + /* is optional, and can be set to NULL. As */ + /* for `family_name', some formats provide */ + /* localized and Unicode versions of this */ + /* string. Applications should use the format */ + /* specific interface to access them. */ + /* */ + /* num_fixed_sizes :: The number of bitmap strikes in the face. */ + /* Even if the face is scalable, there might */ + /* still be bitmap strikes, which are called */ + /* `sbits' in that case. */ + /* */ + /* available_sizes :: An array of @FT_Bitmap_Size for all bitmap */ + /* strikes in the face. It is set to NULL if */ + /* there is no bitmap strike. */ + /* */ + /* num_charmaps :: The number of charmaps in the face. */ + /* */ + /* charmaps :: An array of the charmaps of the face. */ + /* */ + /* generic :: A field reserved for client uses. See the */ + /* @FT_Generic type description. */ + /* */ + /* bbox :: The font bounding box. Coordinates are */ + /* expressed in font units (see */ + /* `units_per_EM'). The box is large enough */ + /* to contain any glyph from the font. Thus, */ + /* `bbox.yMax' can be seen as the `maximal */ + /* ascender', and `bbox.yMin' as the `minimal */ + /* descender'. Only relevant for scalable */ + /* formats. */ + /* */ + /* Note that the bounding box might be off by */ + /* (at least) one pixel for hinted fonts. See */ + /* @FT_Size_Metrics for further discussion. */ + /* */ + /* units_per_EM :: The number of font units per EM square for */ + /* this face. This is typically 2048 for */ + /* TrueType fonts, and 1000 for Type~1 fonts. */ + /* Only relevant for scalable formats. */ + /* */ + /* ascender :: The typographic ascender of the face, */ + /* expressed in font units. For font formats */ + /* not having this information, it is set to */ + /* `bbox.yMax'. Only relevant for scalable */ + /* formats. */ + /* */ + /* descender :: The typographic descender of the face, */ + /* expressed in font units. For font formats */ + /* not having this information, it is set to */ + /* `bbox.yMin'. Note that this field is */ + /* usually negative. Only relevant for */ + /* scalable formats. */ + /* */ + /* height :: The height is the vertical distance */ + /* between two consecutive baselines, */ + /* expressed in font units. It is always */ + /* positive. Only relevant for scalable */ + /* formats. */ + /* */ + /* max_advance_width :: The maximal advance width, in font units, */ + /* for all glyphs in this face. This can be */ + /* used to make word wrapping computations */ + /* faster. Only relevant for scalable */ + /* formats. */ + /* */ + /* max_advance_height :: The maximal advance height, in font units, */ + /* for all glyphs in this face. This is only */ + /* relevant for vertical layouts, and is set */ + /* to `height' for fonts that do not provide */ + /* vertical metrics. Only relevant for */ + /* scalable formats. */ + /* */ + /* underline_position :: The position, in font units, of the */ + /* underline line for this face. It is the */ + /* center of the underlining stem. Only */ + /* relevant for scalable formats. */ + /* */ + /* underline_thickness :: The thickness, in font units, of the */ + /* underline for this face. Only relevant for */ + /* scalable formats. */ + /* */ + /* glyph :: The face's associated glyph slot(s). */ + /* */ + /* size :: The current active size for this face. */ + /* */ + /* charmap :: The current active charmap for this face. */ + /* */ + /* <Note> */ + /* Fields may be changed after a call to @FT_Attach_File or */ + /* @FT_Attach_Stream. */ + /* */ + typedef struct FT_FaceRec_ + { + FT_Long num_faces; + FT_Long face_index; + + FT_Long face_flags; + FT_Long style_flags; + + FT_Long num_glyphs; + + FT_String* family_name; + FT_String* style_name; + + FT_Int num_fixed_sizes; + FT_Bitmap_Size* available_sizes; + + FT_Int num_charmaps; + FT_CharMap* charmaps; + + FT_Generic generic; + + /*# The following member variables (down to `underline_thickness') */ + /*# are only relevant to scalable outlines; cf. @FT_Bitmap_Size */ + /*# for bitmap fonts. */ + FT_BBox bbox; + + FT_UShort units_per_EM; + FT_Short ascender; + FT_Short descender; + FT_Short height; + + FT_Short max_advance_width; + FT_Short max_advance_height; + + FT_Short underline_position; + FT_Short underline_thickness; + + FT_GlyphSlot glyph; + FT_Size size; + FT_CharMap charmap; + + /*@private begin */ + + FT_Driver driver; + FT_Memory memory; + FT_Stream stream; + + FT_ListRec sizes_list; + + FT_Generic autohint; + void* extensions; + + FT_Face_Internal internal; + + /*@private end */ + + } FT_FaceRec; + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_FACE_FLAG_XXX */ + /* */ + /* <Description> */ + /* A list of bit flags used in the `face_flags' field of the */ + /* @FT_FaceRec structure. They inform client applications of */ + /* properties of the corresponding face. */ + /* */ + /* <Values> */ + /* FT_FACE_FLAG_SCALABLE :: */ + /* Indicates that the face contains outline glyphs. This doesn't */ + /* prevent bitmap strikes, i.e., a face can have both this and */ + /* and @FT_FACE_FLAG_FIXED_SIZES set. */ + /* */ + /* FT_FACE_FLAG_FIXED_SIZES :: */ + /* Indicates that the face contains bitmap strikes. See also the */ + /* `num_fixed_sizes' and `available_sizes' fields of @FT_FaceRec. */ + /* */ + /* FT_FACE_FLAG_FIXED_WIDTH :: */ + /* Indicates that the face contains fixed-width characters (like */ + /* Courier, Lucido, MonoType, etc.). */ + /* */ + /* FT_FACE_FLAG_SFNT :: */ + /* Indicates that the face uses the `sfnt' storage scheme. For */ + /* now, this means TrueType and OpenType. */ + /* */ + /* FT_FACE_FLAG_HORIZONTAL :: */ + /* Indicates that the face contains horizontal glyph metrics. This */ + /* should be set for all common formats. */ + /* */ + /* FT_FACE_FLAG_VERTICAL :: */ + /* Indicates that the face contains vertical glyph metrics. This */ + /* is only available in some formats, not all of them. */ + /* */ + /* FT_FACE_FLAG_KERNING :: */ + /* Indicates that the face contains kerning information. If set, */ + /* the kerning distance can be retrieved through the function */ + /* @FT_Get_Kerning. Otherwise the function always return the */ + /* vector (0,0). Note that FreeType doesn't handle kerning data */ + /* from the `GPOS' table (as present in some OpenType fonts). */ + /* */ + /* FT_FACE_FLAG_FAST_GLYPHS :: */ + /* THIS FLAG IS DEPRECATED. DO NOT USE OR TEST IT. */ + /* */ + /* FT_FACE_FLAG_MULTIPLE_MASTERS :: */ + /* Indicates that the font contains multiple masters and is capable */ + /* of interpolating between them. See the multiple-masters */ + /* specific API for details. */ + /* */ + /* FT_FACE_FLAG_GLYPH_NAMES :: */ + /* Indicates that the font contains glyph names that can be */ + /* retrieved through @FT_Get_Glyph_Name. Note that some TrueType */ + /* fonts contain broken glyph name tables. Use the function */ + /* @FT_Has_PS_Glyph_Names when needed. */ + /* */ + /* FT_FACE_FLAG_EXTERNAL_STREAM :: */ + /* Used internally by FreeType to indicate that a face's stream was */ + /* provided by the client application and should not be destroyed */ + /* when @FT_Done_Face is called. Don't read or test this flag. */ + /* */ + /* FT_FACE_FLAG_HINTER :: */ + /* Set if the font driver has a hinting machine of its own. For */ + /* example, with TrueType fonts, it makes sense to use data from */ + /* the SFNT `gasp' table only if the native TrueType hinting engine */ + /* (with the bytecode interpreter) is available and active. */ + /* */ + /* FT_FACE_FLAG_CID_KEYED :: */ + /* Set if the font is CID-keyed. In that case, the font is not */ + /* accessed by glyph indices but by CID values. For subsetted */ + /* CID-keyed fonts this has the consequence that not all index */ + /* values are a valid argument to FT_Load_Glyph. Only the CID */ + /* values for which corresponding glyphs in the subsetted font */ + /* exist make FT_Load_Glyph return successfully; in all other cases */ + /* you get an `FT_Err_Invalid_Argument' error. */ + /* */ + /* Note that CID-keyed fonts which are in an SFNT wrapper don't */ + /* have this flag set since the glyphs are accessed in the normal */ + /* way (using contiguous indices); the `CID-ness' isn't visible to */ + /* the application. */ + /* */ + /* FT_FACE_FLAG_TRICKY :: */ + /* Set if the font is `tricky', this is, it always needs the */ + /* font format's native hinting engine to get a reasonable result. */ + /* A typical example is the Chinese font `mingli.ttf' which uses */ + /* TrueType bytecode instructions to move and scale all of its */ + /* subglyphs. */ + /* */ + /* It is not possible to autohint such fonts using */ + /* @FT_LOAD_FORCE_AUTOHINT; it will also ignore */ + /* @FT_LOAD_NO_HINTING. You have to set both FT_LOAD_NO_HINTING */ + /* and @FT_LOAD_NO_AUTOHINT to really disable hinting; however, you */ + /* probably never want this except for demonstration purposes. */ + /* */ + /* Currently, there are six TrueType fonts in the list of tricky */ + /* fonts; they are hard-coded in file `ttobjs.c'. */ + /* */ +#define FT_FACE_FLAG_SCALABLE ( 1L << 0 ) +#define FT_FACE_FLAG_FIXED_SIZES ( 1L << 1 ) +#define FT_FACE_FLAG_FIXED_WIDTH ( 1L << 2 ) +#define FT_FACE_FLAG_SFNT ( 1L << 3 ) +#define FT_FACE_FLAG_HORIZONTAL ( 1L << 4 ) +#define FT_FACE_FLAG_VERTICAL ( 1L << 5 ) +#define FT_FACE_FLAG_KERNING ( 1L << 6 ) +#define FT_FACE_FLAG_FAST_GLYPHS ( 1L << 7 ) +#define FT_FACE_FLAG_MULTIPLE_MASTERS ( 1L << 8 ) +#define FT_FACE_FLAG_GLYPH_NAMES ( 1L << 9 ) +#define FT_FACE_FLAG_EXTERNAL_STREAM ( 1L << 10 ) +#define FT_FACE_FLAG_HINTER ( 1L << 11 ) +#define FT_FACE_FLAG_CID_KEYED ( 1L << 12 ) +#define FT_FACE_FLAG_TRICKY ( 1L << 13 ) + + + /************************************************************************* + * + * @macro: + * FT_HAS_HORIZONTAL( face ) + * + * @description: + * A macro that returns true whenever a face object contains + * horizontal metrics (this is true for all font formats though). + * + * @also: + * @FT_HAS_VERTICAL can be used to check for vertical metrics. + * + */ +#define FT_HAS_HORIZONTAL( face ) \ + ( face->face_flags & FT_FACE_FLAG_HORIZONTAL ) + + + /************************************************************************* + * + * @macro: + * FT_HAS_VERTICAL( face ) + * + * @description: + * A macro that returns true whenever a face object contains vertical + * metrics. + * + */ +#define FT_HAS_VERTICAL( face ) \ + ( face->face_flags & FT_FACE_FLAG_VERTICAL ) + + + /************************************************************************* + * + * @macro: + * FT_HAS_KERNING( face ) + * + * @description: + * A macro that returns true whenever a face object contains kerning + * data that can be accessed with @FT_Get_Kerning. + * + */ +#define FT_HAS_KERNING( face ) \ + ( face->face_flags & FT_FACE_FLAG_KERNING ) + + + /************************************************************************* + * + * @macro: + * FT_IS_SCALABLE( face ) + * + * @description: + * A macro that returns true whenever a face object contains a scalable + * font face (true for TrueType, Type~1, Type~42, CID, OpenType/CFF, + * and PFR font formats. + * + */ +#define FT_IS_SCALABLE( face ) \ + ( face->face_flags & FT_FACE_FLAG_SCALABLE ) + + + /************************************************************************* + * + * @macro: + * FT_IS_SFNT( face ) + * + * @description: + * A macro that returns true whenever a face object contains a font + * whose format is based on the SFNT storage scheme. This usually + * means: TrueType fonts, OpenType fonts, as well as SFNT-based embedded + * bitmap fonts. + * + * If this macro is true, all functions defined in @FT_SFNT_NAMES_H and + * @FT_TRUETYPE_TABLES_H are available. + * + */ +#define FT_IS_SFNT( face ) \ + ( face->face_flags & FT_FACE_FLAG_SFNT ) + + + /************************************************************************* + * + * @macro: + * FT_IS_FIXED_WIDTH( face ) + * + * @description: + * A macro that returns true whenever a face object contains a font face + * that contains fixed-width (or `monospace', `fixed-pitch', etc.) + * glyphs. + * + */ +#define FT_IS_FIXED_WIDTH( face ) \ + ( face->face_flags & FT_FACE_FLAG_FIXED_WIDTH ) + + + /************************************************************************* + * + * @macro: + * FT_HAS_FIXED_SIZES( face ) + * + * @description: + * A macro that returns true whenever a face object contains some + * embedded bitmaps. See the `available_sizes' field of the + * @FT_FaceRec structure. + * + */ +#define FT_HAS_FIXED_SIZES( face ) \ + ( face->face_flags & FT_FACE_FLAG_FIXED_SIZES ) + + + /************************************************************************* + * + * @macro: + * FT_HAS_FAST_GLYPHS( face ) + * + * @description: + * Deprecated. + * + */ +#define FT_HAS_FAST_GLYPHS( face ) 0 + + + /************************************************************************* + * + * @macro: + * FT_HAS_GLYPH_NAMES( face ) + * + * @description: + * A macro that returns true whenever a face object contains some glyph + * names that can be accessed through @FT_Get_Glyph_Name. + * + */ +#define FT_HAS_GLYPH_NAMES( face ) \ + ( face->face_flags & FT_FACE_FLAG_GLYPH_NAMES ) + + + /************************************************************************* + * + * @macro: + * FT_HAS_MULTIPLE_MASTERS( face ) + * + * @description: + * A macro that returns true whenever a face object contains some + * multiple masters. The functions provided by @FT_MULTIPLE_MASTERS_H + * are then available to choose the exact design you want. + * + */ +#define FT_HAS_MULTIPLE_MASTERS( face ) \ + ( face->face_flags & FT_FACE_FLAG_MULTIPLE_MASTERS ) + + + /************************************************************************* + * + * @macro: + * FT_IS_CID_KEYED( face ) + * + * @description: + * A macro that returns true whenever a face object contains a CID-keyed + * font. See the discussion of @FT_FACE_FLAG_CID_KEYED for more + * details. + * + * If this macro is true, all functions defined in @FT_CID_H are + * available. + * + */ +#define FT_IS_CID_KEYED( face ) \ + ( face->face_flags & FT_FACE_FLAG_CID_KEYED ) + + + /************************************************************************* + * + * @macro: + * FT_IS_TRICKY( face ) + * + * @description: + * A macro that returns true whenever a face represents a `tricky' font. + * See the discussion of @FT_FACE_FLAG_TRICKY for more details. + * + */ +#define FT_IS_TRICKY( face ) \ + ( face->face_flags & FT_FACE_FLAG_TRICKY ) + + + /*************************************************************************/ + /* */ + /* <Const> */ + /* FT_STYLE_FLAG_XXX */ + /* */ + /* <Description> */ + /* A list of bit-flags used to indicate the style of a given face. */ + /* These are used in the `style_flags' field of @FT_FaceRec. */ + /* */ + /* <Values> */ + /* FT_STYLE_FLAG_ITALIC :: */ + /* Indicates that a given face style is italic or oblique. */ + /* */ + /* FT_STYLE_FLAG_BOLD :: */ + /* Indicates that a given face is bold. */ + /* */ + /* <Note> */ + /* The style information as provided by FreeType is very basic. More */ + /* details are beyond the scope and should be done on a higher level */ + /* (for example, by analyzing various fields of the `OS/2' table in */ + /* SFNT based fonts). */ + /* */ +#define FT_STYLE_FLAG_ITALIC ( 1 << 0 ) +#define FT_STYLE_FLAG_BOLD ( 1 << 1 ) + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Size_Internal */ + /* */ + /* <Description> */ + /* An opaque handle to an `FT_Size_InternalRec' structure, used to */ + /* model private data of a given @FT_Size object. */ + /* */ + typedef struct FT_Size_InternalRec_* FT_Size_Internal; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Size_Metrics */ + /* */ + /* <Description> */ + /* The size metrics structure gives the metrics of a size object. */ + /* */ + /* <Fields> */ + /* x_ppem :: The width of the scaled EM square in pixels, hence */ + /* the term `ppem' (pixels per EM). It is also */ + /* referred to as `nominal width'. */ + /* */ + /* y_ppem :: The height of the scaled EM square in pixels, */ + /* hence the term `ppem' (pixels per EM). It is also */ + /* referred to as `nominal height'. */ + /* */ + /* x_scale :: A 16.16 fractional scaling value used to convert */ + /* horizontal metrics from font units to 26.6 */ + /* fractional pixels. Only relevant for scalable */ + /* font formats. */ + /* */ + /* y_scale :: A 16.16 fractional scaling value used to convert */ + /* vertical metrics from font units to 26.6 */ + /* fractional pixels. Only relevant for scalable */ + /* font formats. */ + /* */ + /* ascender :: The ascender in 26.6 fractional pixels. See */ + /* @FT_FaceRec for the details. */ + /* */ + /* descender :: The descender in 26.6 fractional pixels. See */ + /* @FT_FaceRec for the details. */ + /* */ + /* height :: The height in 26.6 fractional pixels. See */ + /* @FT_FaceRec for the details. */ + /* */ + /* max_advance :: The maximal advance width in 26.6 fractional */ + /* pixels. See @FT_FaceRec for the details. */ + /* */ + /* <Note> */ + /* The scaling values, if relevant, are determined first during a */ + /* size changing operation. The remaining fields are then set by the */ + /* driver. For scalable formats, they are usually set to scaled */ + /* values of the corresponding fields in @FT_FaceRec. */ + /* */ + /* Note that due to glyph hinting, these values might not be exact */ + /* for certain fonts. Thus they must be treated as unreliable */ + /* with an error margin of at least one pixel! */ + /* */ + /* Indeed, the only way to get the exact metrics is to render _all_ */ + /* glyphs. As this would be a definite performance hit, it is up to */ + /* client applications to perform such computations. */ + /* */ + /* The FT_Size_Metrics structure is valid for bitmap fonts also. */ + /* */ + typedef struct FT_Size_Metrics_ + { + FT_UShort x_ppem; /* horizontal pixels per EM */ + FT_UShort y_ppem; /* vertical pixels per EM */ + + FT_Fixed x_scale; /* scaling values used to convert font */ + FT_Fixed y_scale; /* units to 26.6 fractional pixels */ + + FT_Pos ascender; /* ascender in 26.6 frac. pixels */ + FT_Pos descender; /* descender in 26.6 frac. pixels */ + FT_Pos height; /* text height in 26.6 frac. pixels */ + FT_Pos max_advance; /* max horizontal advance, in 26.6 pixels */ + + } FT_Size_Metrics; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_SizeRec */ + /* */ + /* <Description> */ + /* FreeType root size class structure. A size object models a face */ + /* object at a given size. */ + /* */ + /* <Fields> */ + /* face :: Handle to the parent face object. */ + /* */ + /* generic :: A typeless pointer, which is unused by the FreeType */ + /* library or any of its drivers. It can be used by */ + /* client applications to link their own data to each size */ + /* object. */ + /* */ + /* metrics :: Metrics for this size object. This field is read-only. */ + /* */ + typedef struct FT_SizeRec_ + { + FT_Face face; /* parent face object */ + FT_Generic generic; /* generic pointer for client uses */ + FT_Size_Metrics metrics; /* size metrics */ + FT_Size_Internal internal; + + } FT_SizeRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_SubGlyph */ + /* */ + /* <Description> */ + /* The subglyph structure is an internal object used to describe */ + /* subglyphs (for example, in the case of composites). */ + /* */ + /* <Note> */ + /* The subglyph implementation is not part of the high-level API, */ + /* hence the forward structure declaration. */ + /* */ + /* You can however retrieve subglyph information with */ + /* @FT_Get_SubGlyph_Info. */ + /* */ + typedef struct FT_SubGlyphRec_* FT_SubGlyph; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Slot_Internal */ + /* */ + /* <Description> */ + /* An opaque handle to an `FT_Slot_InternalRec' structure, used to */ + /* model private data of a given @FT_GlyphSlot object. */ + /* */ + typedef struct FT_Slot_InternalRec_* FT_Slot_Internal; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_GlyphSlotRec */ + /* */ + /* <Description> */ + /* FreeType root glyph slot class structure. A glyph slot is a */ + /* container where individual glyphs can be loaded, be they in */ + /* outline or bitmap format. */ + /* */ + /* <Fields> */ + /* library :: A handle to the FreeType library instance */ + /* this slot belongs to. */ + /* */ + /* face :: A handle to the parent face object. */ + /* */ + /* next :: In some cases (like some font tools), several */ + /* glyph slots per face object can be a good */ + /* thing. As this is rare, the glyph slots are */ + /* listed through a direct, single-linked list */ + /* using its `next' field. */ + /* */ + /* generic :: A typeless pointer which is unused by the */ + /* FreeType library or any of its drivers. It */ + /* can be used by client applications to link */ + /* their own data to each glyph slot object. */ + /* */ + /* metrics :: The metrics of the last loaded glyph in the */ + /* slot. The returned values depend on the last */ + /* load flags (see the @FT_Load_Glyph API */ + /* function) and can be expressed either in 26.6 */ + /* fractional pixels or font units. */ + /* */ + /* Note that even when the glyph image is */ + /* transformed, the metrics are not. */ + /* */ + /* linearHoriAdvance :: The advance width of the unhinted glyph. */ + /* Its value is expressed in 16.16 fractional */ + /* pixels, unless @FT_LOAD_LINEAR_DESIGN is set */ + /* when loading the glyph. This field can be */ + /* important to perform correct WYSIWYG layout. */ + /* Only relevant for outline glyphs. */ + /* */ + /* linearVertAdvance :: The advance height of the unhinted glyph. */ + /* Its value is expressed in 16.16 fractional */ + /* pixels, unless @FT_LOAD_LINEAR_DESIGN is set */ + /* when loading the glyph. This field can be */ + /* important to perform correct WYSIWYG layout. */ + /* Only relevant for outline glyphs. */ + /* */ + /* advance :: This is the transformed advance width for the */ + /* glyph. */ + /* */ + /* format :: This field indicates the format of the image */ + /* contained in the glyph slot. Typically */ + /* @FT_GLYPH_FORMAT_BITMAP, */ + /* @FT_GLYPH_FORMAT_OUTLINE, or */ + /* @FT_GLYPH_FORMAT_COMPOSITE, but others are */ + /* possible. */ + /* */ + /* bitmap :: This field is used as a bitmap descriptor */ + /* when the slot format is */ + /* @FT_GLYPH_FORMAT_BITMAP. Note that the */ + /* address and content of the bitmap buffer can */ + /* change between calls of @FT_Load_Glyph and a */ + /* few other functions. */ + /* */ + /* bitmap_left :: This is the bitmap's left bearing expressed */ + /* in integer pixels. Of course, this is only */ + /* valid if the format is */ + /* @FT_GLYPH_FORMAT_BITMAP. */ + /* */ + /* bitmap_top :: This is the bitmap's top bearing expressed in */ + /* integer pixels. Remember that this is the */ + /* distance from the baseline to the top-most */ + /* glyph scanline, upwards y~coordinates being */ + /* *positive*. */ + /* */ + /* outline :: The outline descriptor for the current glyph */ + /* image if its format is */ + /* @FT_GLYPH_FORMAT_OUTLINE. Once a glyph is */ + /* loaded, `outline' can be transformed, */ + /* distorted, embolded, etc. However, it must */ + /* not be freed. */ + /* */ + /* num_subglyphs :: The number of subglyphs in a composite glyph. */ + /* This field is only valid for the composite */ + /* glyph format that should normally only be */ + /* loaded with the @FT_LOAD_NO_RECURSE flag. */ + /* For now this is internal to FreeType. */ + /* */ + /* subglyphs :: An array of subglyph descriptors for */ + /* composite glyphs. There are `num_subglyphs' */ + /* elements in there. Currently internal to */ + /* FreeType. */ + /* */ + /* control_data :: Certain font drivers can also return the */ + /* control data for a given glyph image (e.g. */ + /* TrueType bytecode, Type~1 charstrings, etc.). */ + /* This field is a pointer to such data. */ + /* */ + /* control_len :: This is the length in bytes of the control */ + /* data. */ + /* */ + /* other :: Really wicked formats can use this pointer to */ + /* present their own glyph image to client */ + /* applications. Note that the application */ + /* needs to know about the image format. */ + /* */ + /* lsb_delta :: The difference between hinted and unhinted */ + /* left side bearing while autohinting is */ + /* active. Zero otherwise. */ + /* */ + /* rsb_delta :: The difference between hinted and unhinted */ + /* right side bearing while autohinting is */ + /* active. Zero otherwise. */ + /* */ + /* <Note> */ + /* If @FT_Load_Glyph is called with default flags (see */ + /* @FT_LOAD_DEFAULT) the glyph image is loaded in the glyph slot in */ + /* its native format (e.g., an outline glyph for TrueType and Type~1 */ + /* formats). */ + /* */ + /* This image can later be converted into a bitmap by calling */ + /* @FT_Render_Glyph. This function finds the current renderer for */ + /* the native image's format, then invokes it. */ + /* */ + /* The renderer is in charge of transforming the native image through */ + /* the slot's face transformation fields, then converting it into a */ + /* bitmap that is returned in `slot->bitmap'. */ + /* */ + /* Note that `slot->bitmap_left' and `slot->bitmap_top' are also used */ + /* to specify the position of the bitmap relative to the current pen */ + /* position (e.g., coordinates (0,0) on the baseline). Of course, */ + /* `slot->format' is also changed to @FT_GLYPH_FORMAT_BITMAP. */ + /* */ + /* <Note> */ + /* Here a small pseudo code fragment which shows how to use */ + /* `lsb_delta' and `rsb_delta': */ + /* */ + /* { */ + /* FT_Pos origin_x = 0; */ + /* FT_Pos prev_rsb_delta = 0; */ + /* */ + /* */ + /* for all glyphs do */ + /* <compute kern between current and previous glyph and add it to */ + /* `origin_x'> */ + /* */ + /* <load glyph with `FT_Load_Glyph'> */ + /* */ + /* if ( prev_rsb_delta - face->glyph->lsb_delta >= 32 ) */ + /* origin_x -= 64; */ + /* else if ( prev_rsb_delta - face->glyph->lsb_delta < -32 ) */ + /* origin_x += 64; */ + /* */ + /* prev_rsb_delta = face->glyph->rsb_delta; */ + /* */ + /* <save glyph image, or render glyph, or ...> */ + /* */ + /* origin_x += face->glyph->advance.x; */ + /* endfor */ + /* } */ + /* */ + typedef struct FT_GlyphSlotRec_ + { + FT_Library library; + FT_Face face; + FT_GlyphSlot next; + FT_UInt reserved; /* retained for binary compatibility */ + FT_Generic generic; + + FT_Glyph_Metrics metrics; + FT_Fixed linearHoriAdvance; + FT_Fixed linearVertAdvance; + FT_Vector advance; + + FT_Glyph_Format format; + + FT_Bitmap bitmap; + FT_Int bitmap_left; + FT_Int bitmap_top; + + FT_Outline outline; + + FT_UInt num_subglyphs; + FT_SubGlyph subglyphs; + + void* control_data; + long control_len; + + FT_Pos lsb_delta; + FT_Pos rsb_delta; + + void* other; + + FT_Slot_Internal internal; + + } FT_GlyphSlotRec; + + + /*************************************************************************/ + /*************************************************************************/ + /* */ + /* F U N C T I O N S */ + /* */ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Init_FreeType */ + /* */ + /* <Description> */ + /* Initialize a new FreeType library object. The set of modules */ + /* that are registered by this function is determined at build time. */ + /* */ + /* <Output> */ + /* alibrary :: A handle to a new library object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Init_FreeType( FT_Library *alibrary ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Done_FreeType */ + /* */ + /* <Description> */ + /* Destroy a given FreeType library object and all of its children, */ + /* including resources, drivers, faces, sizes, etc. */ + /* */ + /* <Input> */ + /* library :: A handle to the target library object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Done_FreeType( FT_Library library ); + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_OPEN_XXX */ + /* */ + /* <Description> */ + /* A list of bit-field constants used within the `flags' field of the */ + /* @FT_Open_Args structure. */ + /* */ + /* <Values> */ + /* FT_OPEN_MEMORY :: This is a memory-based stream. */ + /* */ + /* FT_OPEN_STREAM :: Copy the stream from the `stream' field. */ + /* */ + /* FT_OPEN_PATHNAME :: Create a new input stream from a C~path */ + /* name. */ + /* */ + /* FT_OPEN_DRIVER :: Use the `driver' field. */ + /* */ + /* FT_OPEN_PARAMS :: Use the `num_params' and `params' fields. */ + /* */ + /* ft_open_memory :: Deprecated; use @FT_OPEN_MEMORY instead. */ + /* */ + /* ft_open_stream :: Deprecated; use @FT_OPEN_STREAM instead. */ + /* */ + /* ft_open_pathname :: Deprecated; use @FT_OPEN_PATHNAME instead. */ + /* */ + /* ft_open_driver :: Deprecated; use @FT_OPEN_DRIVER instead. */ + /* */ + /* ft_open_params :: Deprecated; use @FT_OPEN_PARAMS instead. */ + /* */ + /* <Note> */ + /* The `FT_OPEN_MEMORY', `FT_OPEN_STREAM', and `FT_OPEN_PATHNAME' */ + /* flags are mutually exclusive. */ + /* */ +#define FT_OPEN_MEMORY 0x1 +#define FT_OPEN_STREAM 0x2 +#define FT_OPEN_PATHNAME 0x4 +#define FT_OPEN_DRIVER 0x8 +#define FT_OPEN_PARAMS 0x10 + +#define ft_open_memory FT_OPEN_MEMORY /* deprecated */ +#define ft_open_stream FT_OPEN_STREAM /* deprecated */ +#define ft_open_pathname FT_OPEN_PATHNAME /* deprecated */ +#define ft_open_driver FT_OPEN_DRIVER /* deprecated */ +#define ft_open_params FT_OPEN_PARAMS /* deprecated */ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Parameter */ + /* */ + /* <Description> */ + /* A simple structure used to pass more or less generic parameters */ + /* to @FT_Open_Face. */ + /* */ + /* <Fields> */ + /* tag :: A four-byte identification tag. */ + /* */ + /* data :: A pointer to the parameter data. */ + /* */ + /* <Note> */ + /* The ID and function of parameters are driver-specific. */ + /* */ + typedef struct FT_Parameter_ + { + FT_ULong tag; + FT_Pointer data; + + } FT_Parameter; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Open_Args */ + /* */ + /* <Description> */ + /* A structure used to indicate how to open a new font file or */ + /* stream. A pointer to such a structure can be used as a parameter */ + /* for the functions @FT_Open_Face and @FT_Attach_Stream. */ + /* */ + /* <Fields> */ + /* flags :: A set of bit flags indicating how to use the */ + /* structure. */ + /* */ + /* memory_base :: The first byte of the file in memory. */ + /* */ + /* memory_size :: The size in bytes of the file in memory. */ + /* */ + /* pathname :: A pointer to an 8-bit file pathname. */ + /* */ + /* stream :: A handle to a source stream object. */ + /* */ + /* driver :: This field is exclusively used by @FT_Open_Face; */ + /* it simply specifies the font driver to use to open */ + /* the face. If set to~0, FreeType tries to load the */ + /* face with each one of the drivers in its list. */ + /* */ + /* num_params :: The number of extra parameters. */ + /* */ + /* params :: Extra parameters passed to the font driver when */ + /* opening a new face. */ + /* */ + /* <Note> */ + /* The stream type is determined by the contents of `flags' which */ + /* are tested in the following order by @FT_Open_Face: */ + /* */ + /* If the `FT_OPEN_MEMORY' bit is set, assume that this is a */ + /* memory file of `memory_size' bytes, located at `memory_address'. */ + /* The data are are not copied, and the client is responsible for */ + /* releasing and destroying them _after_ the corresponding call to */ + /* @FT_Done_Face. */ + /* */ + /* Otherwise, if the `FT_OPEN_STREAM' bit is set, assume that a */ + /* custom input stream `stream' is used. */ + /* */ + /* Otherwise, if the `FT_OPEN_PATHNAME' bit is set, assume that this */ + /* is a normal file and use `pathname' to open it. */ + /* */ + /* If the `FT_OPEN_DRIVER' bit is set, @FT_Open_Face only tries to */ + /* open the file with the driver whose handler is in `driver'. */ + /* */ + /* If the `FT_OPEN_PARAMS' bit is set, the parameters given by */ + /* `num_params' and `params' is used. They are ignored otherwise. */ + /* */ + /* Ideally, both the `pathname' and `params' fields should be tagged */ + /* as `const'; this is missing for API backwards compatibility. In */ + /* other words, applications should treat them as read-only. */ + /* */ + typedef struct FT_Open_Args_ + { + FT_UInt flags; + const FT_Byte* memory_base; + FT_Long memory_size; + FT_String* pathname; + FT_Stream stream; + FT_Module driver; + FT_Int num_params; + FT_Parameter* params; + + } FT_Open_Args; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_New_Face */ + /* */ + /* <Description> */ + /* This function calls @FT_Open_Face to open a font by its pathname. */ + /* */ + /* <InOut> */ + /* library :: A handle to the library resource. */ + /* */ + /* <Input> */ + /* pathname :: A path to the font file. */ + /* */ + /* face_index :: The index of the face within the font. The first */ + /* face has index~0. */ + /* */ + /* <Output> */ + /* aface :: A handle to a new face object. If `face_index' is */ + /* greater than or equal to zero, it must be non-NULL. */ + /* See @FT_Open_Face for more details. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_New_Face( FT_Library library, + const char* filepathname, + FT_Long face_index, + FT_Face *aface ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_New_Memory_Face */ + /* */ + /* <Description> */ + /* This function calls @FT_Open_Face to open a font which has been */ + /* loaded into memory. */ + /* */ + /* <InOut> */ + /* library :: A handle to the library resource. */ + /* */ + /* <Input> */ + /* file_base :: A pointer to the beginning of the font data. */ + /* */ + /* file_size :: The size of the memory chunk used by the font data. */ + /* */ + /* face_index :: The index of the face within the font. The first */ + /* face has index~0. */ + /* */ + /* <Output> */ + /* aface :: A handle to a new face object. If `face_index' is */ + /* greater than or equal to zero, it must be non-NULL. */ + /* See @FT_Open_Face for more details. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* You must not deallocate the memory before calling @FT_Done_Face. */ + /* */ + FT_EXPORT( FT_Error ) + FT_New_Memory_Face( FT_Library library, + const FT_Byte* file_base, + FT_Long file_size, + FT_Long face_index, + FT_Face *aface ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Open_Face */ + /* */ + /* <Description> */ + /* Create a face object from a given resource described by */ + /* @FT_Open_Args. */ + /* */ + /* <InOut> */ + /* library :: A handle to the library resource. */ + /* */ + /* <Input> */ + /* args :: A pointer to an `FT_Open_Args' structure which must */ + /* be filled by the caller. */ + /* */ + /* face_index :: The index of the face within the font. The first */ + /* face has index~0. */ + /* */ + /* <Output> */ + /* aface :: A handle to a new face object. If `face_index' is */ + /* greater than or equal to zero, it must be non-NULL. */ + /* See note below. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* Unlike FreeType 1.x, this function automatically creates a glyph */ + /* slot for the face object which can be accessed directly through */ + /* `face->glyph'. */ + /* */ + /* FT_Open_Face can be used to quickly check whether the font */ + /* format of a given font resource is supported by FreeType. If the */ + /* `face_index' field is negative, the function's return value is~0 */ + /* if the font format is recognized, or non-zero otherwise; */ + /* the function returns a more or less empty face handle in `*aface' */ + /* (if `aface' isn't NULL). The only useful field in this special */ + /* case is `face->num_faces' which gives the number of faces within */ + /* the font file. After examination, the returned @FT_Face structure */ + /* should be deallocated with a call to @FT_Done_Face. */ + /* */ + /* Each new face object created with this function also owns a */ + /* default @FT_Size object, accessible as `face->size'. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Open_Face( FT_Library library, + const FT_Open_Args* args, + FT_Long face_index, + FT_Face *aface ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Attach_File */ + /* */ + /* <Description> */ + /* This function calls @FT_Attach_Stream to attach a file. */ + /* */ + /* <InOut> */ + /* face :: The target face object. */ + /* */ + /* <Input> */ + /* filepathname :: The pathname. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Attach_File( FT_Face face, + const char* filepathname ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Attach_Stream */ + /* */ + /* <Description> */ + /* `Attach' data to a face object. Normally, this is used to read */ + /* additional information for the face object. For example, you can */ + /* attach an AFM file that comes with a Type~1 font to get the */ + /* kerning values and other metrics. */ + /* */ + /* <InOut> */ + /* face :: The target face object. */ + /* */ + /* <Input> */ + /* parameters :: A pointer to @FT_Open_Args which must be filled by */ + /* the caller. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The meaning of the `attach' (i.e., what really happens when the */ + /* new file is read) is not fixed by FreeType itself. It really */ + /* depends on the font format (and thus the font driver). */ + /* */ + /* Client applications are expected to know what they are doing */ + /* when invoking this function. Most drivers simply do not implement */ + /* file attachments. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Attach_Stream( FT_Face face, + FT_Open_Args* parameters ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Done_Face */ + /* */ + /* <Description> */ + /* Discard a given face object, as well as all of its child slots and */ + /* sizes. */ + /* */ + /* <Input> */ + /* face :: A handle to a target face object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Done_Face( FT_Face face ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Select_Size */ + /* */ + /* <Description> */ + /* Select a bitmap strike. */ + /* */ + /* <InOut> */ + /* face :: A handle to a target face object. */ + /* */ + /* <Input> */ + /* strike_index :: The index of the bitmap strike in the */ + /* `available_sizes' field of @FT_FaceRec structure. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Select_Size( FT_Face face, + FT_Int strike_index ); + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_Size_Request_Type */ + /* */ + /* <Description> */ + /* An enumeration type that lists the supported size request types. */ + /* */ + /* <Values> */ + /* FT_SIZE_REQUEST_TYPE_NOMINAL :: */ + /* The nominal size. The `units_per_EM' field of @FT_FaceRec is */ + /* used to determine both scaling values. */ + /* */ + /* FT_SIZE_REQUEST_TYPE_REAL_DIM :: */ + /* The real dimension. The sum of the the `Ascender' and (minus */ + /* of) the `Descender' fields of @FT_FaceRec are used to determine */ + /* both scaling values. */ + /* */ + /* FT_SIZE_REQUEST_TYPE_BBOX :: */ + /* The font bounding box. The width and height of the `bbox' field */ + /* of @FT_FaceRec are used to determine the horizontal and vertical */ + /* scaling value, respectively. */ + /* */ + /* FT_SIZE_REQUEST_TYPE_CELL :: */ + /* The `max_advance_width' field of @FT_FaceRec is used to */ + /* determine the horizontal scaling value; the vertical scaling */ + /* value is determined the same way as */ + /* @FT_SIZE_REQUEST_TYPE_REAL_DIM does. Finally, both scaling */ + /* values are set to the smaller one. This type is useful if you */ + /* want to specify the font size for, say, a window of a given */ + /* dimension and 80x24 cells. */ + /* */ + /* FT_SIZE_REQUEST_TYPE_SCALES :: */ + /* Specify the scaling values directly. */ + /* */ + /* <Note> */ + /* The above descriptions only apply to scalable formats. For bitmap */ + /* formats, the behaviour is up to the driver. */ + /* */ + /* See the note section of @FT_Size_Metrics if you wonder how size */ + /* requesting relates to scaling values. */ + /* */ + typedef enum FT_Size_Request_Type_ + { + FT_SIZE_REQUEST_TYPE_NOMINAL, + FT_SIZE_REQUEST_TYPE_REAL_DIM, + FT_SIZE_REQUEST_TYPE_BBOX, + FT_SIZE_REQUEST_TYPE_CELL, + FT_SIZE_REQUEST_TYPE_SCALES, + + FT_SIZE_REQUEST_TYPE_MAX + + } FT_Size_Request_Type; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Size_RequestRec */ + /* */ + /* <Description> */ + /* A structure used to model a size request. */ + /* */ + /* <Fields> */ + /* type :: See @FT_Size_Request_Type. */ + /* */ + /* width :: The desired width. */ + /* */ + /* height :: The desired height. */ + /* */ + /* horiResolution :: The horizontal resolution. If set to zero, */ + /* `width' is treated as a 26.6 fractional pixel */ + /* value. */ + /* */ + /* vertResolution :: The vertical resolution. If set to zero, */ + /* `height' is treated as a 26.6 fractional pixel */ + /* value. */ + /* */ + /* <Note> */ + /* If `width' is zero, then the horizontal scaling value is set */ + /* equal to the vertical scaling value, and vice versa. */ + /* */ + typedef struct FT_Size_RequestRec_ + { + FT_Size_Request_Type type; + FT_Long width; + FT_Long height; + FT_UInt horiResolution; + FT_UInt vertResolution; + + } FT_Size_RequestRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Size_Request */ + /* */ + /* <Description> */ + /* A handle to a size request structure. */ + /* */ + typedef struct FT_Size_RequestRec_ *FT_Size_Request; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Request_Size */ + /* */ + /* <Description> */ + /* Resize the scale of the active @FT_Size object in a face. */ + /* */ + /* <InOut> */ + /* face :: A handle to a target face object. */ + /* */ + /* <Input> */ + /* req :: A pointer to a @FT_Size_RequestRec. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* Although drivers may select the bitmap strike matching the */ + /* request, you should not rely on this if you intend to select a */ + /* particular bitmap strike. Use @FT_Select_Size instead in that */ + /* case. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Request_Size( FT_Face face, + FT_Size_Request req ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Set_Char_Size */ + /* */ + /* <Description> */ + /* This function calls @FT_Request_Size to request the nominal size */ + /* (in points). */ + /* */ + /* <InOut> */ + /* face :: A handle to a target face object. */ + /* */ + /* <Input> */ + /* char_width :: The nominal width, in 26.6 fractional points. */ + /* */ + /* char_height :: The nominal height, in 26.6 fractional points. */ + /* */ + /* horz_resolution :: The horizontal resolution in dpi. */ + /* */ + /* vert_resolution :: The vertical resolution in dpi. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* If either the character width or height is zero, it is set equal */ + /* to the other value. */ + /* */ + /* If either the horizontal or vertical resolution is zero, it is set */ + /* equal to the other value. */ + /* */ + /* A character width or height smaller than 1pt is set to 1pt; if */ + /* both resolution values are zero, they are set to 72dpi. */ + /* */ + /* Don't use this function if you are using the FreeType cache API. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Set_Char_Size( FT_Face face, + FT_F26Dot6 char_width, + FT_F26Dot6 char_height, + FT_UInt horz_resolution, + FT_UInt vert_resolution ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Set_Pixel_Sizes */ + /* */ + /* <Description> */ + /* This function calls @FT_Request_Size to request the nominal size */ + /* (in pixels). */ + /* */ + /* <InOut> */ + /* face :: A handle to the target face object. */ + /* */ + /* <Input> */ + /* pixel_width :: The nominal width, in pixels. */ + /* */ + /* pixel_height :: The nominal height, in pixels. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Set_Pixel_Sizes( FT_Face face, + FT_UInt pixel_width, + FT_UInt pixel_height ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Load_Glyph */ + /* */ + /* <Description> */ + /* A function used to load a single glyph into the glyph slot of a */ + /* face object. */ + /* */ + /* <InOut> */ + /* face :: A handle to the target face object where the glyph */ + /* is loaded. */ + /* */ + /* <Input> */ + /* glyph_index :: The index of the glyph in the font file. For */ + /* CID-keyed fonts (either in PS or in CFF format) */ + /* this argument specifies the CID value. */ + /* */ + /* load_flags :: A flag indicating what to load for this glyph. The */ + /* @FT_LOAD_XXX constants can be used to control the */ + /* glyph loading process (e.g., whether the outline */ + /* should be scaled, whether to load bitmaps or not, */ + /* whether to hint the outline, etc). */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The loaded glyph may be transformed. See @FT_Set_Transform for */ + /* the details. */ + /* */ + /* For subsetted CID-keyed fonts, `FT_Err_Invalid_Argument' is */ + /* returned for invalid CID values (this is, for CID values which */ + /* don't have a corresponding glyph in the font). See the discussion */ + /* of the @FT_FACE_FLAG_CID_KEYED flag for more details. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Load_Glyph( FT_Face face, + FT_UInt glyph_index, + FT_Int32 load_flags ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Load_Char */ + /* */ + /* <Description> */ + /* A function used to load a single glyph into the glyph slot of a */ + /* face object, according to its character code. */ + /* */ + /* <InOut> */ + /* face :: A handle to a target face object where the glyph */ + /* is loaded. */ + /* */ + /* <Input> */ + /* char_code :: The glyph's character code, according to the */ + /* current charmap used in the face. */ + /* */ + /* load_flags :: A flag indicating what to load for this glyph. The */ + /* @FT_LOAD_XXX constants can be used to control the */ + /* glyph loading process (e.g., whether the outline */ + /* should be scaled, whether to load bitmaps or not, */ + /* whether to hint the outline, etc). */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* This function simply calls @FT_Get_Char_Index and @FT_Load_Glyph. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Load_Char( FT_Face face, + FT_ULong char_code, + FT_Int32 load_flags ); + + + /************************************************************************* + * + * @enum: + * FT_LOAD_XXX + * + * @description: + * A list of bit-field constants used with @FT_Load_Glyph to indicate + * what kind of operations to perform during glyph loading. + * + * @values: + * FT_LOAD_DEFAULT :: + * Corresponding to~0, this value is used as the default glyph load + * operation. In this case, the following happens: + * + * 1. FreeType looks for a bitmap for the glyph corresponding to the + * face's current size. If one is found, the function returns. + * The bitmap data can be accessed from the glyph slot (see note + * below). + * + * 2. If no embedded bitmap is searched or found, FreeType looks for a + * scalable outline. If one is found, it is loaded from the font + * file, scaled to device pixels, then `hinted' to the pixel grid + * in order to optimize it. The outline data can be accessed from + * the glyph slot (see note below). + * + * Note that by default, the glyph loader doesn't render outlines into + * bitmaps. The following flags are used to modify this default + * behaviour to more specific and useful cases. + * + * FT_LOAD_NO_SCALE :: + * Don't scale the outline glyph loaded, but keep it in font units. + * + * This flag implies @FT_LOAD_NO_HINTING and @FT_LOAD_NO_BITMAP, and + * unsets @FT_LOAD_RENDER. + * + * FT_LOAD_NO_HINTING :: + * Disable hinting. This generally generates `blurrier' bitmap glyph + * when the glyph is rendered in any of the anti-aliased modes. See + * also the note below. + * + * This flag is implied by @FT_LOAD_NO_SCALE. + * + * FT_LOAD_RENDER :: + * Call @FT_Render_Glyph after the glyph is loaded. By default, the + * glyph is rendered in @FT_RENDER_MODE_NORMAL mode. This can be + * overridden by @FT_LOAD_TARGET_XXX or @FT_LOAD_MONOCHROME. + * + * This flag is unset by @FT_LOAD_NO_SCALE. + * + * FT_LOAD_NO_BITMAP :: + * Ignore bitmap strikes when loading. Bitmap-only fonts ignore this + * flag. + * + * @FT_LOAD_NO_SCALE always sets this flag. + * + * FT_LOAD_VERTICAL_LAYOUT :: + * Load the glyph for vertical text layout. _Don't_ use it as it is + * problematic currently. + * + * FT_LOAD_FORCE_AUTOHINT :: + * Indicates that the auto-hinter is preferred over the font's native + * hinter. See also the note below. + * + * FT_LOAD_CROP_BITMAP :: + * Indicates that the font driver should crop the loaded bitmap glyph + * (i.e., remove all space around its black bits). Not all drivers + * implement this. + * + * FT_LOAD_PEDANTIC :: + * Indicates that the font driver should perform pedantic verifications + * during glyph loading. This is mostly used to detect broken glyphs + * in fonts. By default, FreeType tries to handle broken fonts also. + * + * FT_LOAD_IGNORE_GLOBAL_ADVANCE_WIDTH :: + * Indicates that the font driver should ignore the global advance + * width defined in the font. By default, that value is used as the + * advance width for all glyphs when the face has + * @FT_FACE_FLAG_FIXED_WIDTH set. + * + * This flag exists for historical reasons (to support buggy CJK + * fonts). + * + * FT_LOAD_NO_RECURSE :: + * This flag is only used internally. It merely indicates that the + * font driver should not load composite glyphs recursively. Instead, + * it should set the `num_subglyph' and `subglyphs' values of the + * glyph slot accordingly, and set `glyph->format' to + * @FT_GLYPH_FORMAT_COMPOSITE. + * + * The description of sub-glyphs is not available to client + * applications for now. + * + * This flag implies @FT_LOAD_NO_SCALE and @FT_LOAD_IGNORE_TRANSFORM. + * + * FT_LOAD_IGNORE_TRANSFORM :: + * Indicates that the transform matrix set by @FT_Set_Transform should + * be ignored. + * + * FT_LOAD_MONOCHROME :: + * This flag is used with @FT_LOAD_RENDER to indicate that you want to + * render an outline glyph to a 1-bit monochrome bitmap glyph, with + * 8~pixels packed into each byte of the bitmap data. + * + * Note that this has no effect on the hinting algorithm used. You + * should rather use @FT_LOAD_TARGET_MONO so that the + * monochrome-optimized hinting algorithm is used. + * + * FT_LOAD_LINEAR_DESIGN :: + * Indicates that the `linearHoriAdvance' and `linearVertAdvance' + * fields of @FT_GlyphSlotRec should be kept in font units. See + * @FT_GlyphSlotRec for details. + * + * FT_LOAD_NO_AUTOHINT :: + * Disable auto-hinter. See also the note below. + * + * @note: + * By default, hinting is enabled and the font's native hinter (see + * @FT_FACE_FLAG_HINTER) is preferred over the auto-hinter. You can + * disable hinting by setting @FT_LOAD_NO_HINTING or change the + * precedence by setting @FT_LOAD_FORCE_AUTOHINT. You can also set + * @FT_LOAD_NO_AUTOHINT in case you don't want the auto-hinter to be + * used at all. + * + * See the description of @FT_FACE_FLAG_TRICKY for a special exception + * (affecting only a handful of Asian fonts). + * + * Besides deciding which hinter to use, you can also decide which + * hinting algorithm to use. See @FT_LOAD_TARGET_XXX for details. + */ +#define FT_LOAD_DEFAULT 0x0 +#define FT_LOAD_NO_SCALE 0x1 +#define FT_LOAD_NO_HINTING 0x2 +#define FT_LOAD_RENDER 0x4 +#define FT_LOAD_NO_BITMAP 0x8 +#define FT_LOAD_VERTICAL_LAYOUT 0x10 +#define FT_LOAD_FORCE_AUTOHINT 0x20 +#define FT_LOAD_CROP_BITMAP 0x40 +#define FT_LOAD_PEDANTIC 0x80 +#define FT_LOAD_IGNORE_GLOBAL_ADVANCE_WIDTH 0x200 +#define FT_LOAD_NO_RECURSE 0x400 +#define FT_LOAD_IGNORE_TRANSFORM 0x800 +#define FT_LOAD_MONOCHROME 0x1000 +#define FT_LOAD_LINEAR_DESIGN 0x2000 +#define FT_LOAD_NO_AUTOHINT 0x8000U + + /* */ + + /* used internally only by certain font drivers! */ +#define FT_LOAD_ADVANCE_ONLY 0x100 +#define FT_LOAD_SBITS_ONLY 0x4000 + + + /************************************************************************** + * + * @enum: + * FT_LOAD_TARGET_XXX + * + * @description: + * A list of values that are used to select a specific hinting algorithm + * to use by the hinter. You should OR one of these values to your + * `load_flags' when calling @FT_Load_Glyph. + * + * Note that font's native hinters may ignore the hinting algorithm you + * have specified (e.g., the TrueType bytecode interpreter). You can set + * @FT_LOAD_FORCE_AUTOHINT to ensure that the auto-hinter is used. + * + * Also note that @FT_LOAD_TARGET_LIGHT is an exception, in that it + * always implies @FT_LOAD_FORCE_AUTOHINT. + * + * @values: + * FT_LOAD_TARGET_NORMAL :: + * This corresponds to the default hinting algorithm, optimized for + * standard gray-level rendering. For monochrome output, use + * @FT_LOAD_TARGET_MONO instead. + * + * FT_LOAD_TARGET_LIGHT :: + * A lighter hinting algorithm for non-monochrome modes. Many + * generated glyphs are more fuzzy but better resemble its original + * shape. A bit like rendering on Mac OS~X. + * + * As a special exception, this target implies @FT_LOAD_FORCE_AUTOHINT. + * + * FT_LOAD_TARGET_MONO :: + * Strong hinting algorithm that should only be used for monochrome + * output. The result is probably unpleasant if the glyph is rendered + * in non-monochrome modes. + * + * FT_LOAD_TARGET_LCD :: + * A variant of @FT_LOAD_TARGET_NORMAL optimized for horizontally + * decimated LCD displays. + * + * FT_LOAD_TARGET_LCD_V :: + * A variant of @FT_LOAD_TARGET_NORMAL optimized for vertically + * decimated LCD displays. + * + * @note: + * You should use only _one_ of the FT_LOAD_TARGET_XXX values in your + * `load_flags'. They can't be ORed. + * + * If @FT_LOAD_RENDER is also set, the glyph is rendered in the + * corresponding mode (i.e., the mode which matches the used algorithm + * best) unless @FT_LOAD_MONOCHROME is set. + * + * You can use a hinting algorithm that doesn't correspond to the same + * rendering mode. As an example, it is possible to use the `light' + * hinting algorithm and have the results rendered in horizontal LCD + * pixel mode, with code like + * + * { + * FT_Load_Glyph( face, glyph_index, + * load_flags | FT_LOAD_TARGET_LIGHT ); + * + * FT_Render_Glyph( face->glyph, FT_RENDER_MODE_LCD ); + * } + */ + +#define FT_LOAD_TARGET_( x ) ( (FT_Int32)( (x) & 15 ) << 16 ) + +#define FT_LOAD_TARGET_NORMAL FT_LOAD_TARGET_( FT_RENDER_MODE_NORMAL ) +#define FT_LOAD_TARGET_LIGHT FT_LOAD_TARGET_( FT_RENDER_MODE_LIGHT ) +#define FT_LOAD_TARGET_MONO FT_LOAD_TARGET_( FT_RENDER_MODE_MONO ) +#define FT_LOAD_TARGET_LCD FT_LOAD_TARGET_( FT_RENDER_MODE_LCD ) +#define FT_LOAD_TARGET_LCD_V FT_LOAD_TARGET_( FT_RENDER_MODE_LCD_V ) + + + /************************************************************************** + * + * @macro: + * FT_LOAD_TARGET_MODE + * + * @description: + * Return the @FT_Render_Mode corresponding to a given + * @FT_LOAD_TARGET_XXX value. + * + */ + +#define FT_LOAD_TARGET_MODE( x ) ( (FT_Render_Mode)( ( (x) >> 16 ) & 15 ) ) + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Set_Transform */ + /* */ + /* <Description> */ + /* A function used to set the transformation that is applied to glyph */ + /* images when they are loaded into a glyph slot through */ + /* @FT_Load_Glyph. */ + /* */ + /* <InOut> */ + /* face :: A handle to the source face object. */ + /* */ + /* <Input> */ + /* matrix :: A pointer to the transformation's 2x2 matrix. Use~0 for */ + /* the identity matrix. */ + /* delta :: A pointer to the translation vector. Use~0 for the null */ + /* vector. */ + /* */ + /* <Note> */ + /* The transformation is only applied to scalable image formats after */ + /* the glyph has been loaded. It means that hinting is unaltered by */ + /* the transformation and is performed on the character size given in */ + /* the last call to @FT_Set_Char_Size or @FT_Set_Pixel_Sizes. */ + /* */ + /* Note that this also transforms the `face.glyph.advance' field, but */ + /* *not* the values in `face.glyph.metrics'. */ + /* */ + FT_EXPORT( void ) + FT_Set_Transform( FT_Face face, + FT_Matrix* matrix, + FT_Vector* delta ); + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_Render_Mode */ + /* */ + /* <Description> */ + /* An enumeration type that lists the render modes supported by */ + /* FreeType~2. Each mode corresponds to a specific type of scanline */ + /* conversion performed on the outline. */ + /* */ + /* For bitmap fonts the `bitmap->pixel_mode' field in the */ + /* @FT_GlyphSlotRec structure gives the format of the returned */ + /* bitmap. */ + /* */ + /* All modes except @FT_RENDER_MODE_MONO use 256 levels of opacity. */ + /* */ + /* <Values> */ + /* FT_RENDER_MODE_NORMAL :: */ + /* This is the default render mode; it corresponds to 8-bit */ + /* anti-aliased bitmaps. */ + /* */ + /* FT_RENDER_MODE_LIGHT :: */ + /* This is equivalent to @FT_RENDER_MODE_NORMAL. It is only */ + /* defined as a separate value because render modes are also used */ + /* indirectly to define hinting algorithm selectors. See */ + /* @FT_LOAD_TARGET_XXX for details. */ + /* */ + /* FT_RENDER_MODE_MONO :: */ + /* This mode corresponds to 1-bit bitmaps (with 2~levels of */ + /* opacity). */ + /* */ + /* FT_RENDER_MODE_LCD :: */ + /* This mode corresponds to horizontal RGB and BGR sub-pixel */ + /* displays, like LCD-screens. It produces 8-bit bitmaps that are */ + /* 3~times the width of the original glyph outline in pixels, and */ + /* which use the @FT_PIXEL_MODE_LCD mode. */ + /* */ + /* FT_RENDER_MODE_LCD_V :: */ + /* This mode corresponds to vertical RGB and BGR sub-pixel displays */ + /* (like PDA screens, rotated LCD displays, etc.). It produces */ + /* 8-bit bitmaps that are 3~times the height of the original */ + /* glyph outline in pixels and use the @FT_PIXEL_MODE_LCD_V mode. */ + /* */ + /* <Note> */ + /* The LCD-optimized glyph bitmaps produced by FT_Render_Glyph can be */ + /* filtered to reduce color-fringes by using @FT_Library_SetLcdFilter */ + /* (not active in the default builds). It is up to the caller to */ + /* either call @FT_Library_SetLcdFilter (if available) or do the */ + /* filtering itself. */ + /* */ + typedef enum FT_Render_Mode_ + { + FT_RENDER_MODE_NORMAL = 0, + FT_RENDER_MODE_LIGHT, + FT_RENDER_MODE_MONO, + FT_RENDER_MODE_LCD, + FT_RENDER_MODE_LCD_V, + + FT_RENDER_MODE_MAX + + } FT_Render_Mode; + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* ft_render_mode_xxx */ + /* */ + /* <Description> */ + /* These constants are deprecated. Use the corresponding */ + /* @FT_Render_Mode values instead. */ + /* */ + /* <Values> */ + /* ft_render_mode_normal :: see @FT_RENDER_MODE_NORMAL */ + /* ft_render_mode_mono :: see @FT_RENDER_MODE_MONO */ + /* */ +#define ft_render_mode_normal FT_RENDER_MODE_NORMAL +#define ft_render_mode_mono FT_RENDER_MODE_MONO + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Render_Glyph */ + /* */ + /* <Description> */ + /* Convert a given glyph image to a bitmap. It does so by inspecting */ + /* the glyph image format, finding the relevant renderer, and */ + /* invoking it. */ + /* */ + /* <InOut> */ + /* slot :: A handle to the glyph slot containing the image to */ + /* convert. */ + /* */ + /* <Input> */ + /* render_mode :: This is the render mode used to render the glyph */ + /* image into a bitmap. See @FT_Render_Mode for a */ + /* list of possible values. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Render_Glyph( FT_GlyphSlot slot, + FT_Render_Mode render_mode ); + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_Kerning_Mode */ + /* */ + /* <Description> */ + /* An enumeration used to specify which kerning values to return in */ + /* @FT_Get_Kerning. */ + /* */ + /* <Values> */ + /* FT_KERNING_DEFAULT :: Return scaled and grid-fitted kerning */ + /* distances (value is~0). */ + /* */ + /* FT_KERNING_UNFITTED :: Return scaled but un-grid-fitted kerning */ + /* distances. */ + /* */ + /* FT_KERNING_UNSCALED :: Return the kerning vector in original font */ + /* units. */ + /* */ + typedef enum FT_Kerning_Mode_ + { + FT_KERNING_DEFAULT = 0, + FT_KERNING_UNFITTED, + FT_KERNING_UNSCALED + + } FT_Kerning_Mode; + + + /*************************************************************************/ + /* */ + /* <Const> */ + /* ft_kerning_default */ + /* */ + /* <Description> */ + /* This constant is deprecated. Please use @FT_KERNING_DEFAULT */ + /* instead. */ + /* */ +#define ft_kerning_default FT_KERNING_DEFAULT + + + /*************************************************************************/ + /* */ + /* <Const> */ + /* ft_kerning_unfitted */ + /* */ + /* <Description> */ + /* This constant is deprecated. Please use @FT_KERNING_UNFITTED */ + /* instead. */ + /* */ +#define ft_kerning_unfitted FT_KERNING_UNFITTED + + + /*************************************************************************/ + /* */ + /* <Const> */ + /* ft_kerning_unscaled */ + /* */ + /* <Description> */ + /* This constant is deprecated. Please use @FT_KERNING_UNSCALED */ + /* instead. */ + /* */ +#define ft_kerning_unscaled FT_KERNING_UNSCALED + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Kerning */ + /* */ + /* <Description> */ + /* Return the kerning vector between two glyphs of a same face. */ + /* */ + /* <Input> */ + /* face :: A handle to a source face object. */ + /* */ + /* left_glyph :: The index of the left glyph in the kern pair. */ + /* */ + /* right_glyph :: The index of the right glyph in the kern pair. */ + /* */ + /* kern_mode :: See @FT_Kerning_Mode for more information. */ + /* Determines the scale and dimension of the returned */ + /* kerning vector. */ + /* */ + /* <Output> */ + /* akerning :: The kerning vector. This is either in font units */ + /* or in pixels (26.6 format) for scalable formats, */ + /* and in pixels for fixed-sizes formats. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* Only horizontal layouts (left-to-right & right-to-left) are */ + /* supported by this method. Other layouts, or more sophisticated */ + /* kernings, are out of the scope of this API function -- they can be */ + /* implemented through format-specific interfaces. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Get_Kerning( FT_Face face, + FT_UInt left_glyph, + FT_UInt right_glyph, + FT_UInt kern_mode, + FT_Vector *akerning ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Track_Kerning */ + /* */ + /* <Description> */ + /* Return the track kerning for a given face object at a given size. */ + /* */ + /* <Input> */ + /* face :: A handle to a source face object. */ + /* */ + /* point_size :: The point size in 16.16 fractional points. */ + /* */ + /* degree :: The degree of tightness. */ + /* */ + /* <Output> */ + /* akerning :: The kerning in 16.16 fractional points. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Get_Track_Kerning( FT_Face face, + FT_Fixed point_size, + FT_Int degree, + FT_Fixed* akerning ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Glyph_Name */ + /* */ + /* <Description> */ + /* Retrieve the ASCII name of a given glyph in a face. This only */ + /* works for those faces where @FT_HAS_GLYPH_NAMES(face) returns~1. */ + /* */ + /* <Input> */ + /* face :: A handle to a source face object. */ + /* */ + /* glyph_index :: The glyph index. */ + /* */ + /* buffer_max :: The maximal number of bytes available in the */ + /* buffer. */ + /* */ + /* <Output> */ + /* buffer :: A pointer to a target buffer where the name is */ + /* copied to. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* An error is returned if the face doesn't provide glyph names or if */ + /* the glyph index is invalid. In all cases of failure, the first */ + /* byte of `buffer' is set to~0 to indicate an empty name. */ + /* */ + /* The glyph name is truncated to fit within the buffer if it is too */ + /* long. The returned string is always zero-terminated. */ + /* */ + /* This function is not compiled within the library if the config */ + /* macro `FT_CONFIG_OPTION_NO_GLYPH_NAMES' is defined in */ + /* `include/freetype/config/ftoptions.h'. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Get_Glyph_Name( FT_Face face, + FT_UInt glyph_index, + FT_Pointer buffer, + FT_UInt buffer_max ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Postscript_Name */ + /* */ + /* <Description> */ + /* Retrieve the ASCII PostScript name of a given face, if available. */ + /* This only works with PostScript and TrueType fonts. */ + /* */ + /* <Input> */ + /* face :: A handle to the source face object. */ + /* */ + /* <Return> */ + /* A pointer to the face's PostScript name. NULL if unavailable. */ + /* */ + /* <Note> */ + /* The returned pointer is owned by the face and is destroyed with */ + /* it. */ + /* */ + FT_EXPORT( const char* ) + FT_Get_Postscript_Name( FT_Face face ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Select_Charmap */ + /* */ + /* <Description> */ + /* Select a given charmap by its encoding tag (as listed in */ + /* `freetype.h'). */ + /* */ + /* <InOut> */ + /* face :: A handle to the source face object. */ + /* */ + /* <Input> */ + /* encoding :: A handle to the selected encoding. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* This function returns an error if no charmap in the face */ + /* corresponds to the encoding queried here. */ + /* */ + /* Because many fonts contain more than a single cmap for Unicode */ + /* encoding, this function has some special code to select the one */ + /* which covers Unicode best (`best' in the sense that a UCS-4 cmap */ + /* is preferred to a UCS-2 cmap). It is thus preferable to */ + /* @FT_Set_Charmap in this case. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Select_Charmap( FT_Face face, + FT_Encoding encoding ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Set_Charmap */ + /* */ + /* <Description> */ + /* Select a given charmap for character code to glyph index mapping. */ + /* */ + /* <InOut> */ + /* face :: A handle to the source face object. */ + /* */ + /* <Input> */ + /* charmap :: A handle to the selected charmap. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* This function returns an error if the charmap is not part of */ + /* the face (i.e., if it is not listed in the `face->charmaps' */ + /* table). */ + /* */ + /* It also fails if a type~14 charmap is selected. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Set_Charmap( FT_Face face, + FT_CharMap charmap ); + + + /************************************************************************* + * + * @function: + * FT_Get_Charmap_Index + * + * @description: + * Retrieve index of a given charmap. + * + * @input: + * charmap :: + * A handle to a charmap. + * + * @return: + * The index into the array of character maps within the face to which + * `charmap' belongs. + * + */ + FT_EXPORT( FT_Int ) + FT_Get_Charmap_Index( FT_CharMap charmap ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Char_Index */ + /* */ + /* <Description> */ + /* Return the glyph index of a given character code. This function */ + /* uses a charmap object to do the mapping. */ + /* */ + /* <Input> */ + /* face :: A handle to the source face object. */ + /* */ + /* charcode :: The character code. */ + /* */ + /* <Return> */ + /* The glyph index. 0~means `undefined character code'. */ + /* */ + /* <Note> */ + /* If you use FreeType to manipulate the contents of font files */ + /* directly, be aware that the glyph index returned by this function */ + /* doesn't always correspond to the internal indices used within */ + /* the file. This is done to ensure that value~0 always corresponds */ + /* to the `missing glyph'. */ + /* */ + FT_EXPORT( FT_UInt ) + FT_Get_Char_Index( FT_Face face, + FT_ULong charcode ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_First_Char */ + /* */ + /* <Description> */ + /* This function is used to return the first character code in the */ + /* current charmap of a given face. It also returns the */ + /* corresponding glyph index. */ + /* */ + /* <Input> */ + /* face :: A handle to the source face object. */ + /* */ + /* <Output> */ + /* agindex :: Glyph index of first character code. 0~if charmap is */ + /* empty. */ + /* */ + /* <Return> */ + /* The charmap's first character code. */ + /* */ + /* <Note> */ + /* You should use this function with @FT_Get_Next_Char to be able to */ + /* parse all character codes available in a given charmap. The code */ + /* should look like this: */ + /* */ + /* { */ + /* FT_ULong charcode; */ + /* FT_UInt gindex; */ + /* */ + /* */ + /* charcode = FT_Get_First_Char( face, &gindex ); */ + /* while ( gindex != 0 ) */ + /* { */ + /* ... do something with (charcode,gindex) pair ... */ + /* */ + /* charcode = FT_Get_Next_Char( face, charcode, &gindex ); */ + /* } */ + /* } */ + /* */ + /* Note that `*agindex' is set to~0 if the charmap is empty. The */ + /* result itself can be~0 in two cases: if the charmap is empty or */ + /* when the value~0 is the first valid character code. */ + /* */ + FT_EXPORT( FT_ULong ) + FT_Get_First_Char( FT_Face face, + FT_UInt *agindex ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Next_Char */ + /* */ + /* <Description> */ + /* This function is used to return the next character code in the */ + /* current charmap of a given face following the value `char_code', */ + /* as well as the corresponding glyph index. */ + /* */ + /* <Input> */ + /* face :: A handle to the source face object. */ + /* char_code :: The starting character code. */ + /* */ + /* <Output> */ + /* agindex :: Glyph index of first character code. 0~if charmap */ + /* is empty. */ + /* */ + /* <Return> */ + /* The charmap's next character code. */ + /* */ + /* <Note> */ + /* You should use this function with @FT_Get_First_Char to walk */ + /* over all character codes available in a given charmap. See the */ + /* note for this function for a simple code example. */ + /* */ + /* Note that `*agindex' is set to~0 when there are no more codes in */ + /* the charmap. */ + /* */ + FT_EXPORT( FT_ULong ) + FT_Get_Next_Char( FT_Face face, + FT_ULong char_code, + FT_UInt *agindex ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Name_Index */ + /* */ + /* <Description> */ + /* Return the glyph index of a given glyph name. This function uses */ + /* driver specific objects to do the translation. */ + /* */ + /* <Input> */ + /* face :: A handle to the source face object. */ + /* */ + /* glyph_name :: The glyph name. */ + /* */ + /* <Return> */ + /* The glyph index. 0~means `undefined character code'. */ + /* */ + FT_EXPORT( FT_UInt ) + FT_Get_Name_Index( FT_Face face, + FT_String* glyph_name ); + + + /************************************************************************* + * + * @macro: + * FT_SUBGLYPH_FLAG_XXX + * + * @description: + * A list of constants used to describe subglyphs. Please refer to the + * TrueType specification for the meaning of the various flags. + * + * @values: + * FT_SUBGLYPH_FLAG_ARGS_ARE_WORDS :: + * FT_SUBGLYPH_FLAG_ARGS_ARE_XY_VALUES :: + * FT_SUBGLYPH_FLAG_ROUND_XY_TO_GRID :: + * FT_SUBGLYPH_FLAG_SCALE :: + * FT_SUBGLYPH_FLAG_XY_SCALE :: + * FT_SUBGLYPH_FLAG_2X2 :: + * FT_SUBGLYPH_FLAG_USE_MY_METRICS :: + * + */ +#define FT_SUBGLYPH_FLAG_ARGS_ARE_WORDS 1 +#define FT_SUBGLYPH_FLAG_ARGS_ARE_XY_VALUES 2 +#define FT_SUBGLYPH_FLAG_ROUND_XY_TO_GRID 4 +#define FT_SUBGLYPH_FLAG_SCALE 8 +#define FT_SUBGLYPH_FLAG_XY_SCALE 0x40 +#define FT_SUBGLYPH_FLAG_2X2 0x80 +#define FT_SUBGLYPH_FLAG_USE_MY_METRICS 0x200 + + + /************************************************************************* + * + * @func: + * FT_Get_SubGlyph_Info + * + * @description: + * Retrieve a description of a given subglyph. Only use it if + * `glyph->format' is @FT_GLYPH_FORMAT_COMPOSITE, or an error is + * returned. + * + * @input: + * glyph :: + * The source glyph slot. + * + * sub_index :: + * The index of subglyph. Must be less than `glyph->num_subglyphs'. + * + * @output: + * p_index :: + * The glyph index of the subglyph. + * + * p_flags :: + * The subglyph flags, see @FT_SUBGLYPH_FLAG_XXX. + * + * p_arg1 :: + * The subglyph's first argument (if any). + * + * p_arg2 :: + * The subglyph's second argument (if any). + * + * p_transform :: + * The subglyph transformation (if any). + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * The values of `*p_arg1', `*p_arg2', and `*p_transform' must be + * interpreted depending on the flags returned in `*p_flags'. See the + * TrueType specification for details. + * + */ + FT_EXPORT( FT_Error ) + FT_Get_SubGlyph_Info( FT_GlyphSlot glyph, + FT_UInt sub_index, + FT_Int *p_index, + FT_UInt *p_flags, + FT_Int *p_arg1, + FT_Int *p_arg2, + FT_Matrix *p_transform ); + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_FSTYPE_XXX */ + /* */ + /* <Description> */ + /* A list of bit flags used in the `fsType' field of the OS/2 table */ + /* in a TrueType or OpenType font and the `FSType' entry in a */ + /* PostScript font. These bit flags are returned by */ + /* @FT_Get_FSType_Flags; they inform client applications of embedding */ + /* and subsetting restrictions associated with a font. */ + /* */ + /* See http://www.adobe.com/devnet/acrobat/pdfs/FontPolicies.pdf for */ + /* more details. */ + /* */ + /* <Values> */ + /* FT_FSTYPE_INSTALLABLE_EMBEDDING :: */ + /* Fonts with no fsType bit set may be embedded and permanently */ + /* installed on the remote system by an application. */ + /* */ + /* FT_FSTYPE_RESTRICTED_LICENSE_EMBEDDING :: */ + /* Fonts that have only this bit set must not be modified, embedded */ + /* or exchanged in any manner without first obtaining permission of */ + /* the font software copyright owner. */ + /* */ + /* FT_FSTYPE_PREVIEW_AND_PRINT_EMBEDDING :: */ + /* If this bit is set, the font may be embedded and temporarily */ + /* loaded on the remote system. Documents containing Preview & */ + /* Print fonts must be opened `read-only'; no edits can be applied */ + /* to the document. */ + /* */ + /* FT_FSTYPE_EDITABLE_EMBEDDING :: */ + /* If this bit is set, the font may be embedded but must only be */ + /* installed temporarily on other systems. In contrast to Preview */ + /* & Print fonts, documents containing editable fonts may be opened */ + /* for reading, editing is permitted, and changes may be saved. */ + /* */ + /* FT_FSTYPE_NO_SUBSETTING :: */ + /* If this bit is set, the font may not be subsetted prior to */ + /* embedding. */ + /* */ + /* FT_FSTYPE_BITMAP_EMBEDDING_ONLY :: */ + /* If this bit is set, only bitmaps contained in the font may be */ + /* embedded; no outline data may be embedded. If there are no */ + /* bitmaps available in the font, then the font is unembeddable. */ + /* */ + /* <Note> */ + /* While the fsType flags can indicate that a font may be embedded, a */ + /* license with the font vendor may be separately required to use the */ + /* font in this way. */ + /* */ +#define FT_FSTYPE_INSTALLABLE_EMBEDDING 0x0000 +#define FT_FSTYPE_RESTRICTED_LICENSE_EMBEDDING 0x0002 +#define FT_FSTYPE_PREVIEW_AND_PRINT_EMBEDDING 0x0004 +#define FT_FSTYPE_EDITABLE_EMBEDDING 0x0008 +#define FT_FSTYPE_NO_SUBSETTING 0x0100 +#define FT_FSTYPE_BITMAP_EMBEDDING_ONLY 0x0200 + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_FSType_Flags */ + /* */ + /* <Description> */ + /* Return the fsType flags for a font. */ + /* */ + /* <Input> */ + /* face :: A handle to the source face object. */ + /* */ + /* <Return> */ + /* The fsType flags, @FT_FSTYPE_XXX. */ + /* */ + /* <Note> */ + /* Use this function rather than directly reading the `fs_type' field */ + /* in the @PS_FontInfoRec structure which is only guaranteed to */ + /* return the correct results for Type~1 fonts. */ + /* */ + FT_EXPORT( FT_UShort ) + FT_Get_FSType_Flags( FT_Face face ); + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* glyph_variants */ + /* */ + /* <Title> */ + /* Glyph Variants */ + /* */ + /* <Abstract> */ + /* The FreeType~2 interface to Unicode Ideographic Variation */ + /* Sequences (IVS), using the SFNT cmap format~14. */ + /* */ + /* <Description> */ + /* Many CJK characters have variant forms. They are a sort of grey */ + /* area somewhere between being totally irrelevant and semantically */ + /* distinct; for this reason, the Unicode consortium decided to */ + /* introduce Ideographic Variation Sequences (IVS), consisting of a */ + /* Unicode base character and one of 240 variant selectors */ + /* (U+E0100-U+E01EF), instead of further extending the already huge */ + /* code range for CJK characters. */ + /* */ + /* An IVS is registered and unique; for further details please refer */ + /* to Unicode Technical Report #37, the Ideographic Variation */ + /* Database. To date (October 2007), the character with the most */ + /* variants is U+908A, having 8~such IVS. */ + /* */ + /* Adobe and MS decided to support IVS with a new cmap subtable */ + /* (format~14). It is an odd subtable because it is not a mapping of */ + /* input code points to glyphs, but contains lists of all variants */ + /* supported by the font. */ + /* */ + /* A variant may be either `default' or `non-default'. A default */ + /* variant is the one you will get for that code point if you look it */ + /* up in the standard Unicode cmap. A non-default variant is a */ + /* different glyph. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Face_GetCharVariantIndex */ + /* */ + /* <Description> */ + /* Return the glyph index of a given character code as modified by */ + /* the variation selector. */ + /* */ + /* <Input> */ + /* face :: */ + /* A handle to the source face object. */ + /* */ + /* charcode :: */ + /* The character code point in Unicode. */ + /* */ + /* variantSelector :: */ + /* The Unicode code point of the variation selector. */ + /* */ + /* <Return> */ + /* The glyph index. 0~means either `undefined character code', or */ + /* `undefined selector code', or `no variation selector cmap */ + /* subtable', or `current CharMap is not Unicode'. */ + /* */ + /* <Note> */ + /* If you use FreeType to manipulate the contents of font files */ + /* directly, be aware that the glyph index returned by this function */ + /* doesn't always correspond to the internal indices used within */ + /* the file. This is done to ensure that value~0 always corresponds */ + /* to the `missing glyph'. */ + /* */ + /* This function is only meaningful if */ + /* a) the font has a variation selector cmap sub table, */ + /* and */ + /* b) the current charmap has a Unicode encoding. */ + /* */ + /* <Since> */ + /* 2.3.6 */ + /* */ + FT_EXPORT( FT_UInt ) + FT_Face_GetCharVariantIndex( FT_Face face, + FT_ULong charcode, + FT_ULong variantSelector ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Face_GetCharVariantIsDefault */ + /* */ + /* <Description> */ + /* Check whether this variant of this Unicode character is the one to */ + /* be found in the `cmap'. */ + /* */ + /* <Input> */ + /* face :: */ + /* A handle to the source face object. */ + /* */ + /* charcode :: */ + /* The character codepoint in Unicode. */ + /* */ + /* variantSelector :: */ + /* The Unicode codepoint of the variation selector. */ + /* */ + /* <Return> */ + /* 1~if found in the standard (Unicode) cmap, 0~if found in the */ + /* variation selector cmap, or -1 if it is not a variant. */ + /* */ + /* <Note> */ + /* This function is only meaningful if the font has a variation */ + /* selector cmap subtable. */ + /* */ + /* <Since> */ + /* 2.3.6 */ + /* */ + FT_EXPORT( FT_Int ) + FT_Face_GetCharVariantIsDefault( FT_Face face, + FT_ULong charcode, + FT_ULong variantSelector ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Face_GetVariantSelectors */ + /* */ + /* <Description> */ + /* Return a zero-terminated list of Unicode variant selectors found */ + /* in the font. */ + /* */ + /* <Input> */ + /* face :: */ + /* A handle to the source face object. */ + /* */ + /* <Return> */ + /* A pointer to an array of selector code points, or NULL if there is */ + /* no valid variant selector cmap subtable. */ + /* */ + /* <Note> */ + /* The last item in the array is~0; the array is owned by the */ + /* @FT_Face object but can be overwritten or released on the next */ + /* call to a FreeType function. */ + /* */ + /* <Since> */ + /* 2.3.6 */ + /* */ + FT_EXPORT( FT_UInt32* ) + FT_Face_GetVariantSelectors( FT_Face face ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Face_GetVariantsOfChar */ + /* */ + /* <Description> */ + /* Return a zero-terminated list of Unicode variant selectors found */ + /* for the specified character code. */ + /* */ + /* <Input> */ + /* face :: */ + /* A handle to the source face object. */ + /* */ + /* charcode :: */ + /* The character codepoint in Unicode. */ + /* */ + /* <Return> */ + /* A pointer to an array of variant selector code points which are */ + /* active for the given character, or NULL if the corresponding list */ + /* is empty. */ + /* */ + /* <Note> */ + /* The last item in the array is~0; the array is owned by the */ + /* @FT_Face object but can be overwritten or released on the next */ + /* call to a FreeType function. */ + /* */ + /* <Since> */ + /* 2.3.6 */ + /* */ + FT_EXPORT( FT_UInt32* ) + FT_Face_GetVariantsOfChar( FT_Face face, + FT_ULong charcode ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Face_GetCharsOfVariant */ + /* */ + /* <Description> */ + /* Return a zero-terminated list of Unicode character codes found for */ + /* the specified variant selector. */ + /* */ + /* <Input> */ + /* face :: */ + /* A handle to the source face object. */ + /* */ + /* variantSelector :: */ + /* The variant selector code point in Unicode. */ + /* */ + /* <Return> */ + /* A list of all the code points which are specified by this selector */ + /* (both default and non-default codes are returned) or NULL if there */ + /* is no valid cmap or the variant selector is invalid. */ + /* */ + /* <Note> */ + /* The last item in the array is~0; the array is owned by the */ + /* @FT_Face object but can be overwritten or released on the next */ + /* call to a FreeType function. */ + /* */ + /* <Since> */ + /* 2.3.6 */ + /* */ + FT_EXPORT( FT_UInt32* ) + FT_Face_GetCharsOfVariant( FT_Face face, + FT_ULong variantSelector ); + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* computations */ + /* */ + /* <Title> */ + /* Computations */ + /* */ + /* <Abstract> */ + /* Crunching fixed numbers and vectors. */ + /* */ + /* <Description> */ + /* This section contains various functions used to perform */ + /* computations on 16.16 fixed-float numbers or 2d vectors. */ + /* */ + /* <Order> */ + /* FT_MulDiv */ + /* FT_MulFix */ + /* FT_DivFix */ + /* FT_RoundFix */ + /* FT_CeilFix */ + /* FT_FloorFix */ + /* FT_Vector_Transform */ + /* FT_Matrix_Multiply */ + /* FT_Matrix_Invert */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_MulDiv */ + /* */ + /* <Description> */ + /* A very simple function used to perform the computation `(a*b)/c' */ + /* with maximal accuracy (it uses a 64-bit intermediate integer */ + /* whenever necessary). */ + /* */ + /* This function isn't necessarily as fast as some processor specific */ + /* operations, but is at least completely portable. */ + /* */ + /* <Input> */ + /* a :: The first multiplier. */ + /* b :: The second multiplier. */ + /* c :: The divisor. */ + /* */ + /* <Return> */ + /* The result of `(a*b)/c'. This function never traps when trying to */ + /* divide by zero; it simply returns `MaxInt' or `MinInt' depending */ + /* on the signs of `a' and `b'. */ + /* */ + FT_EXPORT( FT_Long ) + FT_MulDiv( FT_Long a, + FT_Long b, + FT_Long c ); + + + /* */ + + /* The following #if 0 ... #endif is for the documentation formatter, */ + /* hiding the internal `FT_MULFIX_INLINED' macro. */ + +#if 0 + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_MulFix */ + /* */ + /* <Description> */ + /* A very simple function used to perform the computation */ + /* `(a*b)/0x10000' with maximal accuracy. Most of the time this is */ + /* used to multiply a given value by a 16.16 fixed float factor. */ + /* */ + /* <Input> */ + /* a :: The first multiplier. */ + /* b :: The second multiplier. Use a 16.16 factor here whenever */ + /* possible (see note below). */ + /* */ + /* <Return> */ + /* The result of `(a*b)/0x10000'. */ + /* */ + /* <Note> */ + /* This function has been optimized for the case where the absolute */ + /* value of `a' is less than 2048, and `b' is a 16.16 scaling factor. */ + /* As this happens mainly when scaling from notional units to */ + /* fractional pixels in FreeType, it resulted in noticeable speed */ + /* improvements between versions 2.x and 1.x. */ + /* */ + /* As a conclusion, always try to place a 16.16 factor as the */ + /* _second_ argument of this function; this can make a great */ + /* difference. */ + /* */ + FT_EXPORT( FT_Long ) + FT_MulFix( FT_Long a, + FT_Long b ); + + /* */ +#endif + +#ifdef FT_MULFIX_INLINED +#define FT_MulFix( a, b ) FT_MULFIX_INLINED( a, b ) +#else + FT_EXPORT( FT_Long ) + FT_MulFix( FT_Long a, + FT_Long b ); +#endif + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_DivFix */ + /* */ + /* <Description> */ + /* A very simple function used to perform the computation */ + /* `(a*0x10000)/b' with maximal accuracy. Most of the time, this is */ + /* used to divide a given value by a 16.16 fixed float factor. */ + /* */ + /* <Input> */ + /* a :: The first multiplier. */ + /* b :: The second multiplier. Use a 16.16 factor here whenever */ + /* possible (see note below). */ + /* */ + /* <Return> */ + /* The result of `(a*0x10000)/b'. */ + /* */ + /* <Note> */ + /* The optimization for FT_DivFix() is simple: If (a~<<~16) fits in */ + /* 32~bits, then the division is computed directly. Otherwise, we */ + /* use a specialized version of @FT_MulDiv. */ + /* */ + FT_EXPORT( FT_Long ) + FT_DivFix( FT_Long a, + FT_Long b ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_RoundFix */ + /* */ + /* <Description> */ + /* A very simple function used to round a 16.16 fixed number. */ + /* */ + /* <Input> */ + /* a :: The number to be rounded. */ + /* */ + /* <Return> */ + /* The result of `(a + 0x8000) & -0x10000'. */ + /* */ + FT_EXPORT( FT_Fixed ) + FT_RoundFix( FT_Fixed a ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_CeilFix */ + /* */ + /* <Description> */ + /* A very simple function used to compute the ceiling function of a */ + /* 16.16 fixed number. */ + /* */ + /* <Input> */ + /* a :: The number for which the ceiling function is to be computed. */ + /* */ + /* <Return> */ + /* The result of `(a + 0x10000 - 1) & -0x10000'. */ + /* */ + FT_EXPORT( FT_Fixed ) + FT_CeilFix( FT_Fixed a ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_FloorFix */ + /* */ + /* <Description> */ + /* A very simple function used to compute the floor function of a */ + /* 16.16 fixed number. */ + /* */ + /* <Input> */ + /* a :: The number for which the floor function is to be computed. */ + /* */ + /* <Return> */ + /* The result of `a & -0x10000'. */ + /* */ + FT_EXPORT( FT_Fixed ) + FT_FloorFix( FT_Fixed a ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Vector_Transform */ + /* */ + /* <Description> */ + /* Transform a single vector through a 2x2 matrix. */ + /* */ + /* <InOut> */ + /* vector :: The target vector to transform. */ + /* */ + /* <Input> */ + /* matrix :: A pointer to the source 2x2 matrix. */ + /* */ + /* <Note> */ + /* The result is undefined if either `vector' or `matrix' is invalid. */ + /* */ + FT_EXPORT( void ) + FT_Vector_Transform( FT_Vector* vec, + const FT_Matrix* matrix ); + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* version */ + /* */ + /* <Title> */ + /* FreeType Version */ + /* */ + /* <Abstract> */ + /* Functions and macros related to FreeType versions. */ + /* */ + /* <Description> */ + /* Note that those functions and macros are of limited use because */ + /* even a new release of FreeType with only documentation changes */ + /* increases the version number. */ + /* */ + /*************************************************************************/ + + + /************************************************************************* + * + * @enum: + * FREETYPE_XXX + * + * @description: + * These three macros identify the FreeType source code version. + * Use @FT_Library_Version to access them at runtime. + * + * @values: + * FREETYPE_MAJOR :: The major version number. + * FREETYPE_MINOR :: The minor version number. + * FREETYPE_PATCH :: The patch level. + * + * @note: + * The version number of FreeType if built as a dynamic link library + * with the `libtool' package is _not_ controlled by these three + * macros. + */ +#define FREETYPE_MAJOR 2 +#define FREETYPE_MINOR 3 +#define FREETYPE_PATCH 8 + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Library_Version */ + /* */ + /* <Description> */ + /* Return the version of the FreeType library being used. This is */ + /* useful when dynamically linking to the library, since one cannot */ + /* use the macros @FREETYPE_MAJOR, @FREETYPE_MINOR, and */ + /* @FREETYPE_PATCH. */ + /* */ + /* <Input> */ + /* library :: A source library handle. */ + /* */ + /* <Output> */ + /* amajor :: The major version number. */ + /* */ + /* aminor :: The minor version number. */ + /* */ + /* apatch :: The patch version number. */ + /* */ + /* <Note> */ + /* The reason why this function takes a `library' argument is because */ + /* certain programs implement library initialization in a custom way */ + /* that doesn't use @FT_Init_FreeType. */ + /* */ + /* In such cases, the library version might not be available before */ + /* the library object has been created. */ + /* */ + FT_EXPORT( void ) + FT_Library_Version( FT_Library library, + FT_Int *amajor, + FT_Int *aminor, + FT_Int *apatch ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Face_CheckTrueTypePatents */ + /* */ + /* <Description> */ + /* Parse all bytecode instructions of a TrueType font file to check */ + /* whether any of the patented opcodes are used. This is only useful */ + /* if you want to be able to use the unpatented hinter with */ + /* fonts that do *not* use these opcodes. */ + /* */ + /* Note that this function parses *all* glyph instructions in the */ + /* font file, which may be slow. */ + /* */ + /* <Input> */ + /* face :: A face handle. */ + /* */ + /* <Return> */ + /* 1~if this is a TrueType font that uses one of the patented */ + /* opcodes, 0~otherwise. */ + /* */ + /* <Since> */ + /* 2.3.5 */ + /* */ + FT_EXPORT( FT_Bool ) + FT_Face_CheckTrueTypePatents( FT_Face face ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Face_SetUnpatentedHinting */ + /* */ + /* <Description> */ + /* Enable or disable the unpatented hinter for a given face. */ + /* Only enable it if you have determined that the face doesn't */ + /* use any patented opcodes (see @FT_Face_CheckTrueTypePatents). */ + /* */ + /* <Input> */ + /* face :: A face handle. */ + /* */ + /* value :: New boolean setting. */ + /* */ + /* <Return> */ + /* The old setting value. This will always be false if this is not */ + /* an SFNT font, or if the unpatented hinter is not compiled in this */ + /* instance of the library. */ + /* */ + /* <Since> */ + /* 2.3.5 */ + /* */ + FT_EXPORT( FT_Bool ) + FT_Face_SetUnpatentedHinting( FT_Face face, + FT_Bool value ); + + /* */ + + +FT_END_HEADER + +#endif /* __FREETYPE_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftadvanc.h b/portlibs/include/freetype/ftadvanc.h new file mode 100644 index 00000000..b2451bec --- /dev/null +++ b/portlibs/include/freetype/ftadvanc.h @@ -0,0 +1,179 @@ +/***************************************************************************/ +/* */ +/* ftadvanc.h */ +/* */ +/* Quick computation of advance widths (specification only). */ +/* */ +/* Copyright 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTADVANC_H__ +#define __FTADVANC_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /************************************************************************** + * + * @section: + * quick_advance + * + * @title: + * Quick retrieval of advance values + * + * @abstract: + * Retrieve horizontal and vertical advance values without processing + * glyph outlines, if possible. + * + * @description: + * This section contains functions to quickly extract advance values + * without handling glyph outlines, if possible. + */ + + + /*************************************************************************/ + /* */ + /* <Const> */ + /* FT_ADVANCE_FLAG_FAST_ONLY */ + /* */ + /* <Description> */ + /* A bit-flag to be OR-ed with the `flags' parameter of the */ + /* @FT_Get_Advance and @FT_Get_Advances functions. */ + /* */ + /* If set, it indicates that you want these functions to fail if the */ + /* corresponding hinting mode or font driver doesn't allow for very */ + /* quick advance computation. */ + /* */ + /* Typically, glyphs which are either unscaled, unhinted, bitmapped, */ + /* or light-hinted can have their advance width computed very */ + /* quickly. */ + /* */ + /* Normal and bytecode hinted modes, which require loading, scaling, */ + /* and hinting of the glyph outline, are extremely slow by */ + /* comparison. */ + /* */ +#define FT_ADVANCE_FLAG_FAST_ONLY 0x20000000UL + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Advance */ + /* */ + /* <Description> */ + /* Retrieve the advance value of a given glyph outline in an */ + /* @FT_Face. By default, the unhinted advance is returned in font */ + /* units. */ + /* */ + /* <Input> */ + /* face :: The source @FT_Face handle. */ + /* */ + /* gindex :: The glyph index. */ + /* */ + /* load_flags :: A set of bit flags similar to those used when */ + /* calling @FT_Load_Glyph, used to determine what kind */ + /* of advances you need. */ + /* <Output> */ + /* padvance :: The advance value, in either font units or 16.16 */ + /* format. */ + /* */ + /* If @FT_LOAD_VERTICAL_LAYOUT is set, this is the */ + /* vertical advance corresponding to a vertical layout. */ + /* Otherwise, it is the horizontal advance in a */ + /* horizontal layout. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* This function may fail if you use @FT_ADVANCE_FLAG_FAST_ONLY and */ + /* if the corresponding font backend doesn't have a quick way to */ + /* retrieve the advances. */ + /* */ + /* A scaled advance is returned in 16.16 format but isn't transformed */ + /* by the affine transformation specified by @FT_Set_Transform. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Get_Advance( FT_Face face, + FT_UInt gindex, + FT_Int32 load_flags, + FT_Fixed *padvance ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Advances */ + /* */ + /* <Description> */ + /* Retrieve the advance values of several glyph outlines in an */ + /* @FT_Face. By default, the unhinted advances are returned in font */ + /* units. */ + /* */ + /* <Input> */ + /* face :: The source @FT_Face handle. */ + /* */ + /* start :: The first glyph index. */ + /* */ + /* count :: The number of advance values you want to retrieve. */ + /* */ + /* load_flags :: A set of bit flags similar to those used when */ + /* calling @FT_Load_Glyph. */ + /* */ + /* <Output> */ + /* padvance :: The advances, in either font units or 16.16 format. */ + /* This array must contain at least `count' elements. */ + /* */ + /* If @FT_LOAD_VERTICAL_LAYOUT is set, these are the */ + /* vertical advances corresponding to a vertical layout. */ + /* Otherwise, they are the horizontal advances in a */ + /* horizontal layout. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* This function may fail if you use @FT_ADVANCE_FLAG_FAST_ONLY and */ + /* if the corresponding font backend doesn't have a quick way to */ + /* retrieve the advances. */ + /* */ + /* Scaled advances are returned in 16.16 format but aren't */ + /* transformed by the affine transformation specified by */ + /* @FT_Set_Transform. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Get_Advances( FT_Face face, + FT_UInt start, + FT_UInt count, + FT_Int32 load_flags, + FT_Fixed *padvances ); + +/* */ + + +FT_END_HEADER + +#endif /* __FTADVANC_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftbbox.h b/portlibs/include/freetype/ftbbox.h new file mode 100644 index 00000000..01fe3fb0 --- /dev/null +++ b/portlibs/include/freetype/ftbbox.h @@ -0,0 +1,94 @@ +/***************************************************************************/ +/* */ +/* ftbbox.h */ +/* */ +/* FreeType exact bbox computation (specification). */ +/* */ +/* Copyright 1996-2001, 2003, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This component has a _single_ role: to compute exact outline bounding */ + /* boxes. */ + /* */ + /* It is separated from the rest of the engine for various technical */ + /* reasons. It may well be integrated in `ftoutln' later. */ + /* */ + /*************************************************************************/ + + +#ifndef __FTBBOX_H__ +#define __FTBBOX_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* outline_processing */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Get_BBox */ + /* */ + /* <Description> */ + /* Compute the exact bounding box of an outline. This is slower */ + /* than computing the control box. However, it uses an advanced */ + /* algorithm which returns _very_ quickly when the two boxes */ + /* coincide. Otherwise, the outline Bézier arcs are traversed to */ + /* extract their extrema. */ + /* */ + /* <Input> */ + /* outline :: A pointer to the source outline. */ + /* */ + /* <Output> */ + /* abbox :: The outline's exact bounding box. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Outline_Get_BBox( FT_Outline* outline, + FT_BBox *abbox ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FTBBOX_H__ */ + + +/* END */ + + +/* Local Variables: */ +/* coding: utf-8 */ +/* End: */ diff --git a/portlibs/include/freetype/ftbdf.h b/portlibs/include/freetype/ftbdf.h new file mode 100644 index 00000000..4f8baf84 --- /dev/null +++ b/portlibs/include/freetype/ftbdf.h @@ -0,0 +1,209 @@ +/***************************************************************************/ +/* */ +/* ftbdf.h */ +/* */ +/* FreeType API for accessing BDF-specific strings (specification). */ +/* */ +/* Copyright 2002, 2003, 2004, 2006, 2009 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTBDF_H__ +#define __FTBDF_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* bdf_fonts */ + /* */ + /* <Title> */ + /* BDF and PCF Files */ + /* */ + /* <Abstract> */ + /* BDF and PCF specific API. */ + /* */ + /* <Description> */ + /* This section contains the declaration of functions specific to BDF */ + /* and PCF fonts. */ + /* */ + /*************************************************************************/ + + + /********************************************************************** + * + * @enum: + * FT_PropertyType + * + * @description: + * A list of BDF property types. + * + * @values: + * BDF_PROPERTY_TYPE_NONE :: + * Value~0 is used to indicate a missing property. + * + * BDF_PROPERTY_TYPE_ATOM :: + * Property is a string atom. + * + * BDF_PROPERTY_TYPE_INTEGER :: + * Property is a 32-bit signed integer. + * + * BDF_PROPERTY_TYPE_CARDINAL :: + * Property is a 32-bit unsigned integer. + */ + typedef enum BDF_PropertyType_ + { + BDF_PROPERTY_TYPE_NONE = 0, + BDF_PROPERTY_TYPE_ATOM = 1, + BDF_PROPERTY_TYPE_INTEGER = 2, + BDF_PROPERTY_TYPE_CARDINAL = 3 + + } BDF_PropertyType; + + + /********************************************************************** + * + * @type: + * BDF_Property + * + * @description: + * A handle to a @BDF_PropertyRec structure to model a given + * BDF/PCF property. + */ + typedef struct BDF_PropertyRec_* BDF_Property; + + + /********************************************************************** + * + * @struct: + * BDF_PropertyRec + * + * @description: + * This structure models a given BDF/PCF property. + * + * @fields: + * type :: + * The property type. + * + * u.atom :: + * The atom string, if type is @BDF_PROPERTY_TYPE_ATOM. + * + * u.integer :: + * A signed integer, if type is @BDF_PROPERTY_TYPE_INTEGER. + * + * u.cardinal :: + * An unsigned integer, if type is @BDF_PROPERTY_TYPE_CARDINAL. + */ + typedef struct BDF_PropertyRec_ + { + BDF_PropertyType type; + union { + const char* atom; + FT_Int32 integer; + FT_UInt32 cardinal; + + } u; + + } BDF_PropertyRec; + + + /********************************************************************** + * + * @function: + * FT_Get_BDF_Charset_ID + * + * @description: + * Retrieve a BDF font character set identity, according to + * the BDF specification. + * + * @input: + * face :: + * A handle to the input face. + * + * @output: + * acharset_encoding :: + * Charset encoding, as a C~string, owned by the face. + * + * acharset_registry :: + * Charset registry, as a C~string, owned by the face. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * This function only works with BDF faces, returning an error otherwise. + */ + FT_EXPORT( FT_Error ) + FT_Get_BDF_Charset_ID( FT_Face face, + const char* *acharset_encoding, + const char* *acharset_registry ); + + + /********************************************************************** + * + * @function: + * FT_Get_BDF_Property + * + * @description: + * Retrieve a BDF property from a BDF or PCF font file. + * + * @input: + * face :: A handle to the input face. + * + * name :: The property name. + * + * @output: + * aproperty :: The property. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * This function works with BDF _and_ PCF fonts. It returns an error + * otherwise. It also returns an error if the property is not in the + * font. + * + * A `property' is a either key-value pair within the STARTPROPERTIES + * ... ENDPROPERTIES block of a BDF font or a key-value pair from the + * `info->props' array within a `FontRec' structure of a PCF font. + * + * Integer properties are always stored as `signed' within PCF fonts; + * consequently, @BDF_PROPERTY_TYPE_CARDINAL is a possible return value + * for BDF fonts only. + * + * In case of error, `aproperty->type' is always set to + * @BDF_PROPERTY_TYPE_NONE. + */ + FT_EXPORT( FT_Error ) + FT_Get_BDF_Property( FT_Face face, + const char* prop_name, + BDF_PropertyRec *aproperty ); + + /* */ + +FT_END_HEADER + +#endif /* __FTBDF_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftbitmap.h b/portlibs/include/freetype/ftbitmap.h new file mode 100644 index 00000000..92742369 --- /dev/null +++ b/portlibs/include/freetype/ftbitmap.h @@ -0,0 +1,227 @@ +/***************************************************************************/ +/* */ +/* ftbitmap.h */ +/* */ +/* FreeType utility functions for bitmaps (specification). */ +/* */ +/* Copyright 2004, 2005, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTBITMAP_H__ +#define __FTBITMAP_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* bitmap_handling */ + /* */ + /* <Title> */ + /* Bitmap Handling */ + /* */ + /* <Abstract> */ + /* Handling FT_Bitmap objects. */ + /* */ + /* <Description> */ + /* This section contains functions for converting FT_Bitmap objects. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Bitmap_New */ + /* */ + /* <Description> */ + /* Initialize a pointer to an @FT_Bitmap structure. */ + /* */ + /* <InOut> */ + /* abitmap :: A pointer to the bitmap structure. */ + /* */ + FT_EXPORT( void ) + FT_Bitmap_New( FT_Bitmap *abitmap ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Bitmap_Copy */ + /* */ + /* <Description> */ + /* Copy a bitmap into another one. */ + /* */ + /* <Input> */ + /* library :: A handle to a library object. */ + /* */ + /* source :: A handle to the source bitmap. */ + /* */ + /* <Output> */ + /* target :: A handle to the target bitmap. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Bitmap_Copy( FT_Library library, + const FT_Bitmap *source, + FT_Bitmap *target); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Bitmap_Embolden */ + /* */ + /* <Description> */ + /* Embolden a bitmap. The new bitmap will be about `xStrength' */ + /* pixels wider and `yStrength' pixels higher. The left and bottom */ + /* borders are kept unchanged. */ + /* */ + /* <Input> */ + /* library :: A handle to a library object. */ + /* */ + /* xStrength :: How strong the glyph is emboldened horizontally. */ + /* Expressed in 26.6 pixel format. */ + /* */ + /* yStrength :: How strong the glyph is emboldened vertically. */ + /* Expressed in 26.6 pixel format. */ + /* */ + /* <InOut> */ + /* bitmap :: A handle to the target bitmap. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The current implementation restricts `xStrength' to be less than */ + /* or equal to~8 if bitmap is of pixel_mode @FT_PIXEL_MODE_MONO. */ + /* */ + /* If you want to embolden the bitmap owned by a @FT_GlyphSlotRec, */ + /* you should call @FT_GlyphSlot_Own_Bitmap on the slot first. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Bitmap_Embolden( FT_Library library, + FT_Bitmap* bitmap, + FT_Pos xStrength, + FT_Pos yStrength ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Bitmap_Convert */ + /* */ + /* <Description> */ + /* Convert a bitmap object with depth 1bpp, 2bpp, 4bpp, or 8bpp to a */ + /* bitmap object with depth 8bpp, making the number of used bytes per */ + /* line (a.k.a. the `pitch') a multiple of `alignment'. */ + /* */ + /* <Input> */ + /* library :: A handle to a library object. */ + /* */ + /* source :: The source bitmap. */ + /* */ + /* alignment :: The pitch of the bitmap is a multiple of this */ + /* parameter. Common values are 1, 2, or 4. */ + /* */ + /* <Output> */ + /* target :: The target bitmap. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* It is possible to call @FT_Bitmap_Convert multiple times without */ + /* calling @FT_Bitmap_Done (the memory is simply reallocated). */ + /* */ + /* Use @FT_Bitmap_Done to finally remove the bitmap object. */ + /* */ + /* The `library' argument is taken to have access to FreeType's */ + /* memory handling functions. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Bitmap_Convert( FT_Library library, + const FT_Bitmap *source, + FT_Bitmap *target, + FT_Int alignment ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_GlyphSlot_Own_Bitmap */ + /* */ + /* <Description> */ + /* Make sure that a glyph slot owns `slot->bitmap'. */ + /* */ + /* <Input> */ + /* slot :: The glyph slot. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* This function is to be used in combination with */ + /* @FT_Bitmap_Embolden. */ + /* */ + FT_EXPORT( FT_Error ) + FT_GlyphSlot_Own_Bitmap( FT_GlyphSlot slot ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Bitmap_Done */ + /* */ + /* <Description> */ + /* Destroy a bitmap object created with @FT_Bitmap_New. */ + /* */ + /* <Input> */ + /* library :: A handle to a library object. */ + /* */ + /* bitmap :: The bitmap object to be freed. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The `library' argument is taken to have access to FreeType's */ + /* memory handling functions. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Bitmap_Done( FT_Library library, + FT_Bitmap *bitmap ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FTBITMAP_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftcache.h b/portlibs/include/freetype/ftcache.h new file mode 100644 index 00000000..0916d70a --- /dev/null +++ b/portlibs/include/freetype/ftcache.h @@ -0,0 +1,1125 @@ +/***************************************************************************/ +/* */ +/* ftcache.h */ +/* */ +/* FreeType Cache subsystem (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTCACHE_H__ +#define __FTCACHE_H__ + + +#include <ft2build.h> +#include FT_GLYPH_H + + +FT_BEGIN_HEADER + + + /************************************************************************* + * + * <Section> + * cache_subsystem + * + * <Title> + * Cache Sub-System + * + * <Abstract> + * How to cache face, size, and glyph data with FreeType~2. + * + * <Description> + * This section describes the FreeType~2 cache sub-system, which is used + * to limit the number of concurrently opened @FT_Face and @FT_Size + * objects, as well as caching information like character maps and glyph + * images while limiting their maximum memory usage. + * + * Note that all types and functions begin with the `FTC_' prefix. + * + * The cache is highly portable and thus doesn't know anything about the + * fonts installed on your system, or how to access them. This implies + * the following scheme: + * + * First, available or installed font faces are uniquely identified by + * @FTC_FaceID values, provided to the cache by the client. Note that + * the cache only stores and compares these values, and doesn't try to + * interpret them in any way. + * + * Second, the cache calls, only when needed, a client-provided function + * to convert a @FTC_FaceID into a new @FT_Face object. The latter is + * then completely managed by the cache, including its termination + * through @FT_Done_Face. + * + * Clients are free to map face IDs to anything else. The most simple + * usage is to associate them to a (pathname,face_index) pair that is + * used to call @FT_New_Face. However, more complex schemes are also + * possible. + * + * Note that for the cache to work correctly, the face ID values must be + * *persistent*, which means that the contents they point to should not + * change at runtime, or that their value should not become invalid. + * + * If this is unavoidable (e.g., when a font is uninstalled at runtime), + * you should call @FTC_Manager_RemoveFaceID as soon as possible, to let + * the cache get rid of any references to the old @FTC_FaceID it may + * keep internally. Failure to do so will lead to incorrect behaviour + * or even crashes. + * + * To use the cache, start with calling @FTC_Manager_New to create a new + * @FTC_Manager object, which models a single cache instance. You can + * then look up @FT_Face and @FT_Size objects with + * @FTC_Manager_LookupFace and @FTC_Manager_LookupSize, respectively. + * + * If you want to use the charmap caching, call @FTC_CMapCache_New, then + * later use @FTC_CMapCache_Lookup to perform the equivalent of + * @FT_Get_Char_Index, only much faster. + * + * If you want to use the @FT_Glyph caching, call @FTC_ImageCache, then + * later use @FTC_ImageCache_Lookup to retrieve the corresponding + * @FT_Glyph objects from the cache. + * + * If you need lots of small bitmaps, it is much more memory efficient + * to call @FTC_SBitCache_New followed by @FTC_SBitCache_Lookup. This + * returns @FTC_SBitRec structures, which are used to store small + * bitmaps directly. (A small bitmap is one whose metrics and + * dimensions all fit into 8-bit integers). + * + * We hope to also provide a kerning cache in the near future. + * + * + * <Order> + * FTC_Manager + * FTC_FaceID + * FTC_Face_Requester + * + * FTC_Manager_New + * FTC_Manager_Reset + * FTC_Manager_Done + * FTC_Manager_LookupFace + * FTC_Manager_LookupSize + * FTC_Manager_RemoveFaceID + * + * FTC_Node + * FTC_Node_Unref + * + * FTC_ImageCache + * FTC_ImageCache_New + * FTC_ImageCache_Lookup + * + * FTC_SBit + * FTC_SBitCache + * FTC_SBitCache_New + * FTC_SBitCache_Lookup + * + * FTC_CMapCache + * FTC_CMapCache_New + * FTC_CMapCache_Lookup + * + *************************************************************************/ + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** BASIC TYPE DEFINITIONS *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /************************************************************************* + * + * @type: FTC_FaceID + * + * @description: + * An opaque pointer type that is used to identity face objects. The + * contents of such objects is application-dependent. + * + * These pointers are typically used to point to a user-defined + * structure containing a font file path, and face index. + * + * @note: + * Never use NULL as a valid @FTC_FaceID. + * + * Face IDs are passed by the client to the cache manager, which calls, + * when needed, the @FTC_Face_Requester to translate them into new + * @FT_Face objects. + * + * If the content of a given face ID changes at runtime, or if the value + * becomes invalid (e.g., when uninstalling a font), you should + * immediately call @FTC_Manager_RemoveFaceID before any other cache + * function. + * + * Failure to do so will result in incorrect behaviour or even + * memory leaks and crashes. + */ + typedef FT_Pointer FTC_FaceID; + + + /************************************************************************ + * + * @functype: + * FTC_Face_Requester + * + * @description: + * A callback function provided by client applications. It is used by + * the cache manager to translate a given @FTC_FaceID into a new valid + * @FT_Face object, on demand. + * + * <Input> + * face_id :: + * The face ID to resolve. + * + * library :: + * A handle to a FreeType library object. + * + * req_data :: + * Application-provided request data (see note below). + * + * <Output> + * aface :: + * A new @FT_Face handle. + * + * <Return> + * FreeType error code. 0~means success. + * + * <Note> + * The third parameter `req_data' is the same as the one passed by the + * client when @FTC_Manager_New is called. + * + * The face requester should not perform funny things on the returned + * face object, like creating a new @FT_Size for it, or setting a + * transformation through @FT_Set_Transform! + */ + typedef FT_Error + (*FTC_Face_Requester)( FTC_FaceID face_id, + FT_Library library, + FT_Pointer request_data, + FT_Face* aface ); + + /* */ + +#define FT_POINTER_TO_ULONG( p ) ( (FT_ULong)(FT_Pointer)(p) ) + +#define FTC_FACE_ID_HASH( i ) \ + ((FT_UInt32)(( FT_POINTER_TO_ULONG( i ) >> 3 ) ^ \ + ( FT_POINTER_TO_ULONG( i ) << 7 ) ) ) + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** CACHE MANAGER OBJECT *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FTC_Manager */ + /* */ + /* <Description> */ + /* This object corresponds to one instance of the cache-subsystem. */ + /* It is used to cache one or more @FT_Face objects, along with */ + /* corresponding @FT_Size objects. */ + /* */ + /* The manager intentionally limits the total number of opened */ + /* @FT_Face and @FT_Size objects to control memory usage. See the */ + /* `max_faces' and `max_sizes' parameters of @FTC_Manager_New. */ + /* */ + /* The manager is also used to cache `nodes' of various types while */ + /* limiting their total memory usage. */ + /* */ + /* All limitations are enforced by keeping lists of managed objects */ + /* in most-recently-used order, and flushing old nodes to make room */ + /* for new ones. */ + /* */ + typedef struct FTC_ManagerRec_* FTC_Manager; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FTC_Node */ + /* */ + /* <Description> */ + /* An opaque handle to a cache node object. Each cache node is */ + /* reference-counted. A node with a count of~0 might be flushed */ + /* out of a full cache whenever a lookup request is performed. */ + /* */ + /* If you lookup nodes, you have the ability to `acquire' them, i.e., */ + /* to increment their reference count. This will prevent the node */ + /* from being flushed out of the cache until you explicitly `release' */ + /* it (see @FTC_Node_Unref). */ + /* */ + /* See also @FTC_SBitCache_Lookup and @FTC_ImageCache_Lookup. */ + /* */ + typedef struct FTC_NodeRec_* FTC_Node; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_Manager_New */ + /* */ + /* <Description> */ + /* Create a new cache manager. */ + /* */ + /* <Input> */ + /* library :: The parent FreeType library handle to use. */ + /* */ + /* max_faces :: Maximum number of opened @FT_Face objects managed by */ + /* this cache instance. Use~0 for defaults. */ + /* */ + /* max_sizes :: Maximum number of opened @FT_Size objects managed by */ + /* this cache instance. Use~0 for defaults. */ + /* */ + /* max_bytes :: Maximum number of bytes to use for cached data nodes. */ + /* Use~0 for defaults. Note that this value does not */ + /* account for managed @FT_Face and @FT_Size objects. */ + /* */ + /* requester :: An application-provided callback used to translate */ + /* face IDs into real @FT_Face objects. */ + /* */ + /* req_data :: A generic pointer that is passed to the requester */ + /* each time it is called (see @FTC_Face_Requester). */ + /* */ + /* <Output> */ + /* amanager :: A handle to a new manager object. 0~in case of */ + /* failure. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FTC_Manager_New( FT_Library library, + FT_UInt max_faces, + FT_UInt max_sizes, + FT_ULong max_bytes, + FTC_Face_Requester requester, + FT_Pointer req_data, + FTC_Manager *amanager ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_Manager_Reset */ + /* */ + /* <Description> */ + /* Empty a given cache manager. This simply gets rid of all the */ + /* currently cached @FT_Face and @FT_Size objects within the manager. */ + /* */ + /* <InOut> */ + /* manager :: A handle to the manager. */ + /* */ + FT_EXPORT( void ) + FTC_Manager_Reset( FTC_Manager manager ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_Manager_Done */ + /* */ + /* <Description> */ + /* Destroy a given manager after emptying it. */ + /* */ + /* <Input> */ + /* manager :: A handle to the target cache manager object. */ + /* */ + FT_EXPORT( void ) + FTC_Manager_Done( FTC_Manager manager ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_Manager_LookupFace */ + /* */ + /* <Description> */ + /* Retrieve the @FT_Face object that corresponds to a given face ID */ + /* through a cache manager. */ + /* */ + /* <Input> */ + /* manager :: A handle to the cache manager. */ + /* */ + /* face_id :: The ID of the face object. */ + /* */ + /* <Output> */ + /* aface :: A handle to the face object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The returned @FT_Face object is always owned by the manager. You */ + /* should never try to discard it yourself. */ + /* */ + /* The @FT_Face object doesn't necessarily have a current size object */ + /* (i.e., face->size can be 0). If you need a specific `font size', */ + /* use @FTC_Manager_LookupSize instead. */ + /* */ + /* Never change the face's transformation matrix (i.e., never call */ + /* the @FT_Set_Transform function) on a returned face! If you need */ + /* to transform glyphs, do it yourself after glyph loading. */ + /* */ + /* When you perform a lookup, out-of-memory errors are detected */ + /* _within_ the lookup and force incremental flushes of the cache */ + /* until enough memory is released for the lookup to succeed. */ + /* */ + /* If a lookup fails with `FT_Err_Out_Of_Memory' the cache has */ + /* already been completely flushed, and still no memory was available */ + /* for the operation. */ + /* */ + FT_EXPORT( FT_Error ) + FTC_Manager_LookupFace( FTC_Manager manager, + FTC_FaceID face_id, + FT_Face *aface ); + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FTC_ScalerRec */ + /* */ + /* <Description> */ + /* A structure used to describe a given character size in either */ + /* pixels or points to the cache manager. See */ + /* @FTC_Manager_LookupSize. */ + /* */ + /* <Fields> */ + /* face_id :: The source face ID. */ + /* */ + /* width :: The character width. */ + /* */ + /* height :: The character height. */ + /* */ + /* pixel :: A Boolean. If 1, the `width' and `height' fields are */ + /* interpreted as integer pixel character sizes. */ + /* Otherwise, they are expressed as 1/64th of points. */ + /* */ + /* x_res :: Only used when `pixel' is value~0 to indicate the */ + /* horizontal resolution in dpi. */ + /* */ + /* y_res :: Only used when `pixel' is value~0 to indicate the */ + /* vertical resolution in dpi. */ + /* */ + /* <Note> */ + /* This type is mainly used to retrieve @FT_Size objects through the */ + /* cache manager. */ + /* */ + typedef struct FTC_ScalerRec_ + { + FTC_FaceID face_id; + FT_UInt width; + FT_UInt height; + FT_Int pixel; + FT_UInt x_res; + FT_UInt y_res; + + } FTC_ScalerRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FTC_Scaler */ + /* */ + /* <Description> */ + /* A handle to an @FTC_ScalerRec structure. */ + /* */ + typedef struct FTC_ScalerRec_* FTC_Scaler; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_Manager_LookupSize */ + /* */ + /* <Description> */ + /* Retrieve the @FT_Size object that corresponds to a given */ + /* @FTC_ScalerRec pointer through a cache manager. */ + /* */ + /* <Input> */ + /* manager :: A handle to the cache manager. */ + /* */ + /* scaler :: A scaler handle. */ + /* */ + /* <Output> */ + /* asize :: A handle to the size object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The returned @FT_Size object is always owned by the manager. You */ + /* should never try to discard it by yourself. */ + /* */ + /* You can access the parent @FT_Face object simply as `size->face' */ + /* if you need it. Note that this object is also owned by the */ + /* manager. */ + /* */ + /* <Note> */ + /* When you perform a lookup, out-of-memory errors are detected */ + /* _within_ the lookup and force incremental flushes of the cache */ + /* until enough memory is released for the lookup to succeed. */ + /* */ + /* If a lookup fails with `FT_Err_Out_Of_Memory' the cache has */ + /* already been completely flushed, and still no memory is available */ + /* for the operation. */ + /* */ + FT_EXPORT( FT_Error ) + FTC_Manager_LookupSize( FTC_Manager manager, + FTC_Scaler scaler, + FT_Size *asize ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_Node_Unref */ + /* */ + /* <Description> */ + /* Decrement a cache node's internal reference count. When the count */ + /* reaches 0, it is not destroyed but becomes eligible for subsequent */ + /* cache flushes. */ + /* */ + /* <Input> */ + /* node :: The cache node handle. */ + /* */ + /* manager :: The cache manager handle. */ + /* */ + FT_EXPORT( void ) + FTC_Node_Unref( FTC_Node node, + FTC_Manager manager ); + + + /************************************************************************* + * + * @function: + * FTC_Manager_RemoveFaceID + * + * @description: + * A special function used to indicate to the cache manager that + * a given @FTC_FaceID is no longer valid, either because its + * content changed, or because it was deallocated or uninstalled. + * + * @input: + * manager :: + * The cache manager handle. + * + * face_id :: + * The @FTC_FaceID to be removed. + * + * @note: + * This function flushes all nodes from the cache corresponding to this + * `face_id', with the exception of nodes with a non-null reference + * count. + * + * Such nodes are however modified internally so as to never appear + * in later lookups with the same `face_id' value, and to be immediately + * destroyed when released by all their users. + * + */ + FT_EXPORT( void ) + FTC_Manager_RemoveFaceID( FTC_Manager manager, + FTC_FaceID face_id ); + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* cache_subsystem */ + /* */ + /*************************************************************************/ + + /************************************************************************* + * + * @type: + * FTC_CMapCache + * + * @description: + * An opaque handle used to model a charmap cache. This cache is to + * hold character codes -> glyph indices mappings. + * + */ + typedef struct FTC_CMapCacheRec_* FTC_CMapCache; + + + /************************************************************************* + * + * @function: + * FTC_CMapCache_New + * + * @description: + * Create a new charmap cache. + * + * @input: + * manager :: + * A handle to the cache manager. + * + * @output: + * acache :: + * A new cache handle. NULL in case of error. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * Like all other caches, this one will be destroyed with the cache + * manager. + * + */ + FT_EXPORT( FT_Error ) + FTC_CMapCache_New( FTC_Manager manager, + FTC_CMapCache *acache ); + + + /************************************************************************ + * + * @function: + * FTC_CMapCache_Lookup + * + * @description: + * Translate a character code into a glyph index, using the charmap + * cache. + * + * @input: + * cache :: + * A charmap cache handle. + * + * face_id :: + * The source face ID. + * + * cmap_index :: + * The index of the charmap in the source face. Any negative value + * means to use the cache @FT_Face's default charmap. + * + * char_code :: + * The character code (in the corresponding charmap). + * + * @return: + * Glyph index. 0~means `no glyph'. + * + */ + FT_EXPORT( FT_UInt ) + FTC_CMapCache_Lookup( FTC_CMapCache cache, + FTC_FaceID face_id, + FT_Int cmap_index, + FT_UInt32 char_code ); + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* cache_subsystem */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** IMAGE CACHE OBJECT *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /************************************************************************* + * + * @struct: + * FTC_ImageTypeRec + * + * @description: + * A structure used to model the type of images in a glyph cache. + * + * @fields: + * face_id :: + * The face ID. + * + * width :: + * The width in pixels. + * + * height :: + * The height in pixels. + * + * flags :: + * The load flags, as in @FT_Load_Glyph. + * + */ + typedef struct FTC_ImageTypeRec_ + { + FTC_FaceID face_id; + FT_Int width; + FT_Int height; + FT_Int32 flags; + + } FTC_ImageTypeRec; + + + /************************************************************************* + * + * @type: + * FTC_ImageType + * + * @description: + * A handle to an @FTC_ImageTypeRec structure. + * + */ + typedef struct FTC_ImageTypeRec_* FTC_ImageType; + + + /* */ + + +#define FTC_IMAGE_TYPE_COMPARE( d1, d2 ) \ + ( (d1)->face_id == (d2)->face_id && \ + (d1)->width == (d2)->width && \ + (d1)->flags == (d2)->flags ) + +#define FTC_IMAGE_TYPE_HASH( d ) \ + (FT_UFast)( FTC_FACE_ID_HASH( (d)->face_id ) ^ \ + ( (d)->width << 8 ) ^ (d)->height ^ \ + ( (d)->flags << 4 ) ) + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FTC_ImageCache */ + /* */ + /* <Description> */ + /* A handle to an glyph image cache object. They are designed to */ + /* hold many distinct glyph images while not exceeding a certain */ + /* memory threshold. */ + /* */ + typedef struct FTC_ImageCacheRec_* FTC_ImageCache; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_ImageCache_New */ + /* */ + /* <Description> */ + /* Create a new glyph image cache. */ + /* */ + /* <Input> */ + /* manager :: The parent manager for the image cache. */ + /* */ + /* <Output> */ + /* acache :: A handle to the new glyph image cache object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FTC_ImageCache_New( FTC_Manager manager, + FTC_ImageCache *acache ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_ImageCache_Lookup */ + /* */ + /* <Description> */ + /* Retrieve a given glyph image from a glyph image cache. */ + /* */ + /* <Input> */ + /* cache :: A handle to the source glyph image cache. */ + /* */ + /* type :: A pointer to a glyph image type descriptor. */ + /* */ + /* gindex :: The glyph index to retrieve. */ + /* */ + /* <Output> */ + /* aglyph :: The corresponding @FT_Glyph object. 0~in case of */ + /* failure. */ + /* */ + /* anode :: Used to return the address of of the corresponding cache */ + /* node after incrementing its reference count (see note */ + /* below). */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The returned glyph is owned and managed by the glyph image cache. */ + /* Never try to transform or discard it manually! You can however */ + /* create a copy with @FT_Glyph_Copy and modify the new one. */ + /* */ + /* If `anode' is _not_ NULL, it receives the address of the cache */ + /* node containing the glyph image, after increasing its reference */ + /* count. This ensures that the node (as well as the @FT_Glyph) will */ + /* always be kept in the cache until you call @FTC_Node_Unref to */ + /* `release' it. */ + /* */ + /* If `anode' is NULL, the cache node is left unchanged, which means */ + /* that the @FT_Glyph could be flushed out of the cache on the next */ + /* call to one of the caching sub-system APIs. Don't assume that it */ + /* is persistent! */ + /* */ + FT_EXPORT( FT_Error ) + FTC_ImageCache_Lookup( FTC_ImageCache cache, + FTC_ImageType type, + FT_UInt gindex, + FT_Glyph *aglyph, + FTC_Node *anode ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_ImageCache_LookupScaler */ + /* */ + /* <Description> */ + /* A variant of @FTC_ImageCache_Lookup that uses an @FTC_ScalerRec */ + /* to specify the face ID and its size. */ + /* */ + /* <Input> */ + /* cache :: A handle to the source glyph image cache. */ + /* */ + /* scaler :: A pointer to a scaler descriptor. */ + /* */ + /* load_flags :: The corresponding load flags. */ + /* */ + /* gindex :: The glyph index to retrieve. */ + /* */ + /* <Output> */ + /* aglyph :: The corresponding @FT_Glyph object. 0~in case of */ + /* failure. */ + /* */ + /* anode :: Used to return the address of of the corresponding */ + /* cache node after incrementing its reference count */ + /* (see note below). */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The returned glyph is owned and managed by the glyph image cache. */ + /* Never try to transform or discard it manually! You can however */ + /* create a copy with @FT_Glyph_Copy and modify the new one. */ + /* */ + /* If `anode' is _not_ NULL, it receives the address of the cache */ + /* node containing the glyph image, after increasing its reference */ + /* count. This ensures that the node (as well as the @FT_Glyph) will */ + /* always be kept in the cache until you call @FTC_Node_Unref to */ + /* `release' it. */ + /* */ + /* If `anode' is NULL, the cache node is left unchanged, which means */ + /* that the @FT_Glyph could be flushed out of the cache on the next */ + /* call to one of the caching sub-system APIs. Don't assume that it */ + /* is persistent! */ + /* */ + /* Calls to @FT_Set_Char_Size and friends have no effect on cached */ + /* glyphs; you should always use the FreeType cache API instead. */ + /* */ + FT_EXPORT( FT_Error ) + FTC_ImageCache_LookupScaler( FTC_ImageCache cache, + FTC_Scaler scaler, + FT_ULong load_flags, + FT_UInt gindex, + FT_Glyph *aglyph, + FTC_Node *anode ); + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FTC_SBit */ + /* */ + /* <Description> */ + /* A handle to a small bitmap descriptor. See the @FTC_SBitRec */ + /* structure for details. */ + /* */ + typedef struct FTC_SBitRec_* FTC_SBit; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FTC_SBitRec */ + /* */ + /* <Description> */ + /* A very compact structure used to describe a small glyph bitmap. */ + /* */ + /* <Fields> */ + /* width :: The bitmap width in pixels. */ + /* */ + /* height :: The bitmap height in pixels. */ + /* */ + /* left :: The horizontal distance from the pen position to the */ + /* left bitmap border (a.k.a. `left side bearing', or */ + /* `lsb'). */ + /* */ + /* top :: The vertical distance from the pen position (on the */ + /* baseline) to the upper bitmap border (a.k.a. `top */ + /* side bearing'). The distance is positive for upwards */ + /* y~coordinates. */ + /* */ + /* format :: The format of the glyph bitmap (monochrome or gray). */ + /* */ + /* max_grays :: Maximum gray level value (in the range 1 to~255). */ + /* */ + /* pitch :: The number of bytes per bitmap line. May be positive */ + /* or negative. */ + /* */ + /* xadvance :: The horizontal advance width in pixels. */ + /* */ + /* yadvance :: The vertical advance height in pixels. */ + /* */ + /* buffer :: A pointer to the bitmap pixels. */ + /* */ + typedef struct FTC_SBitRec_ + { + FT_Byte width; + FT_Byte height; + FT_Char left; + FT_Char top; + + FT_Byte format; + FT_Byte max_grays; + FT_Short pitch; + FT_Char xadvance; + FT_Char yadvance; + + FT_Byte* buffer; + + } FTC_SBitRec; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FTC_SBitCache */ + /* */ + /* <Description> */ + /* A handle to a small bitmap cache. These are special cache objects */ + /* used to store small glyph bitmaps (and anti-aliased pixmaps) in a */ + /* much more efficient way than the traditional glyph image cache */ + /* implemented by @FTC_ImageCache. */ + /* */ + typedef struct FTC_SBitCacheRec_* FTC_SBitCache; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_SBitCache_New */ + /* */ + /* <Description> */ + /* Create a new cache to store small glyph bitmaps. */ + /* */ + /* <Input> */ + /* manager :: A handle to the source cache manager. */ + /* */ + /* <Output> */ + /* acache :: A handle to the new sbit cache. NULL in case of error. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FTC_SBitCache_New( FTC_Manager manager, + FTC_SBitCache *acache ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_SBitCache_Lookup */ + /* */ + /* <Description> */ + /* Look up a given small glyph bitmap in a given sbit cache and */ + /* `lock' it to prevent its flushing from the cache until needed. */ + /* */ + /* <Input> */ + /* cache :: A handle to the source sbit cache. */ + /* */ + /* type :: A pointer to the glyph image type descriptor. */ + /* */ + /* gindex :: The glyph index. */ + /* */ + /* <Output> */ + /* sbit :: A handle to a small bitmap descriptor. */ + /* */ + /* anode :: Used to return the address of of the corresponding cache */ + /* node after incrementing its reference count (see note */ + /* below). */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The small bitmap descriptor and its bit buffer are owned by the */ + /* cache and should never be freed by the application. They might */ + /* as well disappear from memory on the next cache lookup, so don't */ + /* treat them as persistent data. */ + /* */ + /* The descriptor's `buffer' field is set to~0 to indicate a missing */ + /* glyph bitmap. */ + /* */ + /* If `anode' is _not_ NULL, it receives the address of the cache */ + /* node containing the bitmap, after increasing its reference count. */ + /* This ensures that the node (as well as the image) will always be */ + /* kept in the cache until you call @FTC_Node_Unref to `release' it. */ + /* */ + /* If `anode' is NULL, the cache node is left unchanged, which means */ + /* that the bitmap could be flushed out of the cache on the next */ + /* call to one of the caching sub-system APIs. Don't assume that it */ + /* is persistent! */ + /* */ + FT_EXPORT( FT_Error ) + FTC_SBitCache_Lookup( FTC_SBitCache cache, + FTC_ImageType type, + FT_UInt gindex, + FTC_SBit *sbit, + FTC_Node *anode ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FTC_SBitCache_LookupScaler */ + /* */ + /* <Description> */ + /* A variant of @FTC_SBitCache_Lookup that uses an @FTC_ScalerRec */ + /* to specify the face ID and its size. */ + /* */ + /* <Input> */ + /* cache :: A handle to the source sbit cache. */ + /* */ + /* scaler :: A pointer to the scaler descriptor. */ + /* */ + /* load_flags :: The corresponding load flags. */ + /* */ + /* gindex :: The glyph index. */ + /* */ + /* <Output> */ + /* sbit :: A handle to a small bitmap descriptor. */ + /* */ + /* anode :: Used to return the address of of the corresponding */ + /* cache node after incrementing its reference count */ + /* (see note below). */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The small bitmap descriptor and its bit buffer are owned by the */ + /* cache and should never be freed by the application. They might */ + /* as well disappear from memory on the next cache lookup, so don't */ + /* treat them as persistent data. */ + /* */ + /* The descriptor's `buffer' field is set to~0 to indicate a missing */ + /* glyph bitmap. */ + /* */ + /* If `anode' is _not_ NULL, it receives the address of the cache */ + /* node containing the bitmap, after increasing its reference count. */ + /* This ensures that the node (as well as the image) will always be */ + /* kept in the cache until you call @FTC_Node_Unref to `release' it. */ + /* */ + /* If `anode' is NULL, the cache node is left unchanged, which means */ + /* that the bitmap could be flushed out of the cache on the next */ + /* call to one of the caching sub-system APIs. Don't assume that it */ + /* is persistent! */ + /* */ + FT_EXPORT( FT_Error ) + FTC_SBitCache_LookupScaler( FTC_SBitCache cache, + FTC_Scaler scaler, + FT_ULong load_flags, + FT_UInt gindex, + FTC_SBit *sbit, + FTC_Node *anode ); + + + /* */ + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + + /*@***********************************************************************/ + /* */ + /* <Struct> */ + /* FTC_FontRec */ + /* */ + /* <Description> */ + /* A simple structure used to describe a given `font' to the cache */ + /* manager. Note that a `font' is the combination of a given face */ + /* with a given character size. */ + /* */ + /* <Fields> */ + /* face_id :: The ID of the face to use. */ + /* */ + /* pix_width :: The character width in integer pixels. */ + /* */ + /* pix_height :: The character height in integer pixels. */ + /* */ + typedef struct FTC_FontRec_ + { + FTC_FaceID face_id; + FT_UShort pix_width; + FT_UShort pix_height; + + } FTC_FontRec; + + + /* */ + + +#define FTC_FONT_COMPARE( f1, f2 ) \ + ( (f1)->face_id == (f2)->face_id && \ + (f1)->pix_width == (f2)->pix_width && \ + (f1)->pix_height == (f2)->pix_height ) + +#define FTC_FONT_HASH( f ) \ + (FT_UInt32)( FTC_FACE_ID_HASH((f)->face_id) ^ \ + ((f)->pix_width << 8) ^ \ + ((f)->pix_height) ) + + typedef FTC_FontRec* FTC_Font; + + + FT_EXPORT( FT_Error ) + FTC_Manager_Lookup_Face( FTC_Manager manager, + FTC_FaceID face_id, + FT_Face *aface ); + + FT_EXPORT( FT_Error ) + FTC_Manager_Lookup_Size( FTC_Manager manager, + FTC_Font font, + FT_Face *aface, + FT_Size *asize ); + +#endif /* FT_CONFIG_OPTION_OLD_INTERNALS */ + + + /* */ + +FT_END_HEADER + +#endif /* __FTCACHE_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftchapters.h b/portlibs/include/freetype/ftchapters.h new file mode 100644 index 00000000..7775a6bb --- /dev/null +++ b/portlibs/include/freetype/ftchapters.h @@ -0,0 +1,103 @@ +/***************************************************************************/ +/* */ +/* This file defines the structure of the FreeType reference. */ +/* It is used by the python script which generates the HTML files. */ +/* */ +/***************************************************************************/ + + +/***************************************************************************/ +/* */ +/* <Chapter> */ +/* general_remarks */ +/* */ +/* <Title> */ +/* General Remarks */ +/* */ +/* <Sections> */ +/* user_allocation */ +/* */ +/***************************************************************************/ + + +/***************************************************************************/ +/* */ +/* <Chapter> */ +/* core_api */ +/* */ +/* <Title> */ +/* Core API */ +/* */ +/* <Sections> */ +/* version */ +/* basic_types */ +/* base_interface */ +/* glyph_variants */ +/* glyph_management */ +/* mac_specific */ +/* sizes_management */ +/* header_file_macros */ +/* */ +/***************************************************************************/ + + +/***************************************************************************/ +/* */ +/* <Chapter> */ +/* format_specific */ +/* */ +/* <Title> */ +/* Format-Specific API */ +/* */ +/* <Sections> */ +/* multiple_masters */ +/* truetype_tables */ +/* type1_tables */ +/* sfnt_names */ +/* bdf_fonts */ +/* cid_fonts */ +/* pfr_fonts */ +/* winfnt_fonts */ +/* font_formats */ +/* gasp_table */ +/* */ +/***************************************************************************/ + + +/***************************************************************************/ +/* */ +/* <Chapter> */ +/* cache_subsystem */ +/* */ +/* <Title> */ +/* Cache Sub-System */ +/* */ +/* <Sections> */ +/* cache_subsystem */ +/* */ +/***************************************************************************/ + + +/***************************************************************************/ +/* */ +/* <Chapter> */ +/* support_api */ +/* */ +/* <Title> */ +/* Support API */ +/* */ +/* <Sections> */ +/* computations */ +/* list_processing */ +/* outline_processing */ +/* quick_advance */ +/* bitmap_handling */ +/* raster */ +/* glyph_stroker */ +/* system_interface */ +/* module_management */ +/* gzip */ +/* lzw */ +/* lcd_filtering */ +/* */ +/***************************************************************************/ diff --git a/portlibs/include/freetype/ftcid.h b/portlibs/include/freetype/ftcid.h new file mode 100644 index 00000000..02df2a03 --- /dev/null +++ b/portlibs/include/freetype/ftcid.h @@ -0,0 +1,98 @@ +/***************************************************************************/ +/* */ +/* ftcid.h */ +/* */ +/* FreeType API for accessing CID font information (specification). */ +/* */ +/* Copyright 2007 by Dereg Clegg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTCID_H__ +#define __FTCID_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* cid_fonts */ + /* */ + /* <Title> */ + /* CID Fonts */ + /* */ + /* <Abstract> */ + /* CID-keyed font specific API. */ + /* */ + /* <Description> */ + /* This section contains the declaration of CID-keyed font specific */ + /* functions. */ + /* */ + /*************************************************************************/ + + + /********************************************************************** + * + * @function: + * FT_Get_CID_Registry_Ordering_Supplement + * + * @description: + * Retrieve the Registry/Ordering/Supplement triple (also known as the + * "R/O/S") from a CID-keyed font. + * + * @input: + * face :: + * A handle to the input face. + * + * @output: + * registry :: + * The registry, as a C~string, owned by the face. + * + * ordering :: + * The ordering, as a C~string, owned by the face. + * + * supplement :: + * The supplement. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * This function only works with CID faces, returning an error + * otherwise. + * + * @since: + * 2.3.6 + */ + FT_EXPORT( FT_Error ) + FT_Get_CID_Registry_Ordering_Supplement( FT_Face face, + const char* *registry, + const char* *ordering, + FT_Int *supplement); + + /* */ + +FT_END_HEADER + +#endif /* __FTCID_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/fterrdef.h b/portlibs/include/freetype/fterrdef.h new file mode 100644 index 00000000..d7ad256b --- /dev/null +++ b/portlibs/include/freetype/fterrdef.h @@ -0,0 +1,239 @@ +/***************************************************************************/ +/* */ +/* fterrdef.h */ +/* */ +/* FreeType error codes (specification). */ +/* */ +/* Copyright 2002, 2004, 2006, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*******************************************************************/ + /*******************************************************************/ + /***** *****/ + /***** LIST OF ERROR CODES/MESSAGES *****/ + /***** *****/ + /*******************************************************************/ + /*******************************************************************/ + + + /* You need to define both FT_ERRORDEF_ and FT_NOERRORDEF_ before */ + /* including this file. */ + + + /* generic errors */ + + FT_NOERRORDEF_( Ok, 0x00, \ + "no error" ) + + FT_ERRORDEF_( Cannot_Open_Resource, 0x01, \ + "cannot open resource" ) + FT_ERRORDEF_( Unknown_File_Format, 0x02, \ + "unknown file format" ) + FT_ERRORDEF_( Invalid_File_Format, 0x03, \ + "broken file" ) + FT_ERRORDEF_( Invalid_Version, 0x04, \ + "invalid FreeType version" ) + FT_ERRORDEF_( Lower_Module_Version, 0x05, \ + "module version is too low" ) + FT_ERRORDEF_( Invalid_Argument, 0x06, \ + "invalid argument" ) + FT_ERRORDEF_( Unimplemented_Feature, 0x07, \ + "unimplemented feature" ) + FT_ERRORDEF_( Invalid_Table, 0x08, \ + "broken table" ) + FT_ERRORDEF_( Invalid_Offset, 0x09, \ + "broken offset within table" ) + FT_ERRORDEF_( Array_Too_Large, 0x0A, \ + "array allocation size too large" ) + + /* glyph/character errors */ + + FT_ERRORDEF_( Invalid_Glyph_Index, 0x10, \ + "invalid glyph index" ) + FT_ERRORDEF_( Invalid_Character_Code, 0x11, \ + "invalid character code" ) + FT_ERRORDEF_( Invalid_Glyph_Format, 0x12, \ + "unsupported glyph image format" ) + FT_ERRORDEF_( Cannot_Render_Glyph, 0x13, \ + "cannot render this glyph format" ) + FT_ERRORDEF_( Invalid_Outline, 0x14, \ + "invalid outline" ) + FT_ERRORDEF_( Invalid_Composite, 0x15, \ + "invalid composite glyph" ) + FT_ERRORDEF_( Too_Many_Hints, 0x16, \ + "too many hints" ) + FT_ERRORDEF_( Invalid_Pixel_Size, 0x17, \ + "invalid pixel size" ) + + /* handle errors */ + + FT_ERRORDEF_( Invalid_Handle, 0x20, \ + "invalid object handle" ) + FT_ERRORDEF_( Invalid_Library_Handle, 0x21, \ + "invalid library handle" ) + FT_ERRORDEF_( Invalid_Driver_Handle, 0x22, \ + "invalid module handle" ) + FT_ERRORDEF_( Invalid_Face_Handle, 0x23, \ + "invalid face handle" ) + FT_ERRORDEF_( Invalid_Size_Handle, 0x24, \ + "invalid size handle" ) + FT_ERRORDEF_( Invalid_Slot_Handle, 0x25, \ + "invalid glyph slot handle" ) + FT_ERRORDEF_( Invalid_CharMap_Handle, 0x26, \ + "invalid charmap handle" ) + FT_ERRORDEF_( Invalid_Cache_Handle, 0x27, \ + "invalid cache manager handle" ) + FT_ERRORDEF_( Invalid_Stream_Handle, 0x28, \ + "invalid stream handle" ) + + /* driver errors */ + + FT_ERRORDEF_( Too_Many_Drivers, 0x30, \ + "too many modules" ) + FT_ERRORDEF_( Too_Many_Extensions, 0x31, \ + "too many extensions" ) + + /* memory errors */ + + FT_ERRORDEF_( Out_Of_Memory, 0x40, \ + "out of memory" ) + FT_ERRORDEF_( Unlisted_Object, 0x41, \ + "unlisted object" ) + + /* stream errors */ + + FT_ERRORDEF_( Cannot_Open_Stream, 0x51, \ + "cannot open stream" ) + FT_ERRORDEF_( Invalid_Stream_Seek, 0x52, \ + "invalid stream seek" ) + FT_ERRORDEF_( Invalid_Stream_Skip, 0x53, \ + "invalid stream skip" ) + FT_ERRORDEF_( Invalid_Stream_Read, 0x54, \ + "invalid stream read" ) + FT_ERRORDEF_( Invalid_Stream_Operation, 0x55, \ + "invalid stream operation" ) + FT_ERRORDEF_( Invalid_Frame_Operation, 0x56, \ + "invalid frame operation" ) + FT_ERRORDEF_( Nested_Frame_Access, 0x57, \ + "nested frame access" ) + FT_ERRORDEF_( Invalid_Frame_Read, 0x58, \ + "invalid frame read" ) + + /* raster errors */ + + FT_ERRORDEF_( Raster_Uninitialized, 0x60, \ + "raster uninitialized" ) + FT_ERRORDEF_( Raster_Corrupted, 0x61, \ + "raster corrupted" ) + FT_ERRORDEF_( Raster_Overflow, 0x62, \ + "raster overflow" ) + FT_ERRORDEF_( Raster_Negative_Height, 0x63, \ + "negative height while rastering" ) + + /* cache errors */ + + FT_ERRORDEF_( Too_Many_Caches, 0x70, \ + "too many registered caches" ) + + /* TrueType and SFNT errors */ + + FT_ERRORDEF_( Invalid_Opcode, 0x80, \ + "invalid opcode" ) + FT_ERRORDEF_( Too_Few_Arguments, 0x81, \ + "too few arguments" ) + FT_ERRORDEF_( Stack_Overflow, 0x82, \ + "stack overflow" ) + FT_ERRORDEF_( Code_Overflow, 0x83, \ + "code overflow" ) + FT_ERRORDEF_( Bad_Argument, 0x84, \ + "bad argument" ) + FT_ERRORDEF_( Divide_By_Zero, 0x85, \ + "division by zero" ) + FT_ERRORDEF_( Invalid_Reference, 0x86, \ + "invalid reference" ) + FT_ERRORDEF_( Debug_OpCode, 0x87, \ + "found debug opcode" ) + FT_ERRORDEF_( ENDF_In_Exec_Stream, 0x88, \ + "found ENDF opcode in execution stream" ) + FT_ERRORDEF_( Nested_DEFS, 0x89, \ + "nested DEFS" ) + FT_ERRORDEF_( Invalid_CodeRange, 0x8A, \ + "invalid code range" ) + FT_ERRORDEF_( Execution_Too_Long, 0x8B, \ + "execution context too long" ) + FT_ERRORDEF_( Too_Many_Function_Defs, 0x8C, \ + "too many function definitions" ) + FT_ERRORDEF_( Too_Many_Instruction_Defs, 0x8D, \ + "too many instruction definitions" ) + FT_ERRORDEF_( Table_Missing, 0x8E, \ + "SFNT font table missing" ) + FT_ERRORDEF_( Horiz_Header_Missing, 0x8F, \ + "horizontal header (hhea) table missing" ) + FT_ERRORDEF_( Locations_Missing, 0x90, \ + "locations (loca) table missing" ) + FT_ERRORDEF_( Name_Table_Missing, 0x91, \ + "name table missing" ) + FT_ERRORDEF_( CMap_Table_Missing, 0x92, \ + "character map (cmap) table missing" ) + FT_ERRORDEF_( Hmtx_Table_Missing, 0x93, \ + "horizontal metrics (hmtx) table missing" ) + FT_ERRORDEF_( Post_Table_Missing, 0x94, \ + "PostScript (post) table missing" ) + FT_ERRORDEF_( Invalid_Horiz_Metrics, 0x95, \ + "invalid horizontal metrics" ) + FT_ERRORDEF_( Invalid_CharMap_Format, 0x96, \ + "invalid character map (cmap) format" ) + FT_ERRORDEF_( Invalid_PPem, 0x97, \ + "invalid ppem value" ) + FT_ERRORDEF_( Invalid_Vert_Metrics, 0x98, \ + "invalid vertical metrics" ) + FT_ERRORDEF_( Could_Not_Find_Context, 0x99, \ + "could not find context" ) + FT_ERRORDEF_( Invalid_Post_Table_Format, 0x9A, \ + "invalid PostScript (post) table format" ) + FT_ERRORDEF_( Invalid_Post_Table, 0x9B, \ + "invalid PostScript (post) table" ) + + /* CFF, CID, and Type 1 errors */ + + FT_ERRORDEF_( Syntax_Error, 0xA0, \ + "opcode syntax error" ) + FT_ERRORDEF_( Stack_Underflow, 0xA1, \ + "argument stack underflow" ) + FT_ERRORDEF_( Ignore, 0xA2, \ + "ignore" ) + + /* BDF errors */ + + FT_ERRORDEF_( Missing_Startfont_Field, 0xB0, \ + "`STARTFONT' field missing" ) + FT_ERRORDEF_( Missing_Font_Field, 0xB1, \ + "`FONT' field missing" ) + FT_ERRORDEF_( Missing_Size_Field, 0xB2, \ + "`SIZE' field missing" ) + FT_ERRORDEF_( Missing_Chars_Field, 0xB3, \ + "`CHARS' field missing" ) + FT_ERRORDEF_( Missing_Startchar_Field, 0xB4, \ + "`STARTCHAR' field missing" ) + FT_ERRORDEF_( Missing_Encoding_Field, 0xB5, \ + "`ENCODING' field missing" ) + FT_ERRORDEF_( Missing_Bbx_Field, 0xB6, \ + "`BBX' field missing" ) + FT_ERRORDEF_( Bbx_Too_Big, 0xB7, \ + "`BBX' too big" ) + FT_ERRORDEF_( Corrupted_Font_Header, 0xB8, \ + "Font header corrupted or missing fields" ) + FT_ERRORDEF_( Corrupted_Font_Glyphs, 0xB9, \ + "Font glyphs corrupted or missing fields" ) + + +/* END */ diff --git a/portlibs/include/freetype/fterrors.h b/portlibs/include/freetype/fterrors.h new file mode 100644 index 00000000..6600dadd --- /dev/null +++ b/portlibs/include/freetype/fterrors.h @@ -0,0 +1,206 @@ +/***************************************************************************/ +/* */ +/* fterrors.h */ +/* */ +/* FreeType error code handling (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2004, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This special header file is used to define the handling of FT2 */ + /* enumeration constants. It can also be used to generate error message */ + /* strings with a small macro trick explained below. */ + /* */ + /* I - Error Formats */ + /* ----------------- */ + /* */ + /* The configuration macro FT_CONFIG_OPTION_USE_MODULE_ERRORS can be */ + /* defined in ftoption.h in order to make the higher byte indicate */ + /* the module where the error has happened (this is not compatible */ + /* with standard builds of FreeType 2). You can then use the macro */ + /* FT_ERROR_BASE macro to extract the generic error code from an */ + /* FT_Error value. */ + /* */ + /* */ + /* II - Error Message strings */ + /* -------------------------- */ + /* */ + /* The error definitions below are made through special macros that */ + /* allow client applications to build a table of error message strings */ + /* if they need it. The strings are not included in a normal build of */ + /* FreeType 2 to save space (most client applications do not use */ + /* them). */ + /* */ + /* To do so, you have to define the following macros before including */ + /* this file: */ + /* */ + /* FT_ERROR_START_LIST :: */ + /* This macro is called before anything else to define the start of */ + /* the error list. It is followed by several FT_ERROR_DEF calls */ + /* (see below). */ + /* */ + /* FT_ERROR_DEF( e, v, s ) :: */ + /* This macro is called to define one single error. */ + /* `e' is the error code identifier (e.g. FT_Err_Invalid_Argument). */ + /* `v' is the error numerical value. */ + /* `s' is the corresponding error string. */ + /* */ + /* FT_ERROR_END_LIST :: */ + /* This macro ends the list. */ + /* */ + /* Additionally, you have to undefine __FTERRORS_H__ before #including */ + /* this file. */ + /* */ + /* Here is a simple example: */ + /* */ + /* { */ + /* #undef __FTERRORS_H__ */ + /* #define FT_ERRORDEF( e, v, s ) { e, s }, */ + /* #define FT_ERROR_START_LIST { */ + /* #define FT_ERROR_END_LIST { 0, 0 } }; */ + /* */ + /* const struct */ + /* { */ + /* int err_code; */ + /* const char* err_msg; */ + /* } ft_errors[] = */ + /* */ + /* #include FT_ERRORS_H */ + /* } */ + /* */ + /*************************************************************************/ + + +#ifndef __FTERRORS_H__ +#define __FTERRORS_H__ + + + /* include module base error codes */ +#include FT_MODULE_ERRORS_H + + + /*******************************************************************/ + /*******************************************************************/ + /***** *****/ + /***** SETUP MACROS *****/ + /***** *****/ + /*******************************************************************/ + /*******************************************************************/ + + +#undef FT_NEED_EXTERN_C + +#undef FT_ERR_XCAT +#undef FT_ERR_CAT + +#define FT_ERR_XCAT( x, y ) x ## y +#define FT_ERR_CAT( x, y ) FT_ERR_XCAT( x, y ) + + + /* FT_ERR_PREFIX is used as a prefix for error identifiers. */ + /* By default, we use `FT_Err_'. */ + /* */ +#ifndef FT_ERR_PREFIX +#define FT_ERR_PREFIX FT_Err_ +#endif + + + /* FT_ERR_BASE is used as the base for module-specific errors. */ + /* */ +#ifdef FT_CONFIG_OPTION_USE_MODULE_ERRORS + +#ifndef FT_ERR_BASE +#define FT_ERR_BASE FT_Mod_Err_Base +#endif + +#else + +#undef FT_ERR_BASE +#define FT_ERR_BASE 0 + +#endif /* FT_CONFIG_OPTION_USE_MODULE_ERRORS */ + + + /* If FT_ERRORDEF is not defined, we need to define a simple */ + /* enumeration type. */ + /* */ +#ifndef FT_ERRORDEF + +#define FT_ERRORDEF( e, v, s ) e = v, +#define FT_ERROR_START_LIST enum { +#define FT_ERROR_END_LIST FT_ERR_CAT( FT_ERR_PREFIX, Max ) }; + +#ifdef __cplusplus +#define FT_NEED_EXTERN_C + extern "C" { +#endif + +#endif /* !FT_ERRORDEF */ + + + /* this macro is used to define an error */ +#define FT_ERRORDEF_( e, v, s ) \ + FT_ERRORDEF( FT_ERR_CAT( FT_ERR_PREFIX, e ), v + FT_ERR_BASE, s ) + + /* this is only used for <module>_Err_Ok, which must be 0! */ +#define FT_NOERRORDEF_( e, v, s ) \ + FT_ERRORDEF( FT_ERR_CAT( FT_ERR_PREFIX, e ), v, s ) + + +#ifdef FT_ERROR_START_LIST + FT_ERROR_START_LIST +#endif + + + /* now include the error codes */ +#include FT_ERROR_DEFINITIONS_H + + +#ifdef FT_ERROR_END_LIST + FT_ERROR_END_LIST +#endif + + + /*******************************************************************/ + /*******************************************************************/ + /***** *****/ + /***** SIMPLE CLEANUP *****/ + /***** *****/ + /*******************************************************************/ + /*******************************************************************/ + +#ifdef FT_NEED_EXTERN_C + } +#endif + +#undef FT_ERROR_START_LIST +#undef FT_ERROR_END_LIST + +#undef FT_ERRORDEF +#undef FT_ERRORDEF_ +#undef FT_NOERRORDEF_ + +#undef FT_NEED_EXTERN_C +#undef FT_ERR_CONCAT +#undef FT_ERR_BASE + + /* FT_KEEP_ERR_PREFIX is needed for ftvalid.h */ +#ifndef FT_KEEP_ERR_PREFIX +#undef FT_ERR_PREFIX +#endif + +#endif /* __FTERRORS_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftgasp.h b/portlibs/include/freetype/ftgasp.h new file mode 100644 index 00000000..91a769e5 --- /dev/null +++ b/portlibs/include/freetype/ftgasp.h @@ -0,0 +1,120 @@ +/***************************************************************************/ +/* */ +/* ftgasp.h */ +/* */ +/* Access of TrueType's `gasp' table (specification). */ +/* */ +/* Copyright 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef _FT_GASP_H_ +#define _FT_GASP_H_ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + + /*************************************************************************** + * + * @section: + * gasp_table + * + * @title: + * Gasp Table + * + * @abstract: + * Retrieving TrueType `gasp' table entries. + * + * @description: + * The function @FT_Get_Gasp can be used to query a TrueType or OpenType + * font for specific entries in its `gasp' table, if any. This is + * mainly useful when implementing native TrueType hinting with the + * bytecode interpreter to duplicate the Windows text rendering results. + */ + + /************************************************************************* + * + * @enum: + * FT_GASP_XXX + * + * @description: + * A list of values and/or bit-flags returned by the @FT_Get_Gasp + * function. + * + * @values: + * FT_GASP_NO_TABLE :: + * This special value means that there is no GASP table in this face. + * It is up to the client to decide what to do. + * + * FT_GASP_DO_GRIDFIT :: + * Grid-fitting and hinting should be performed at the specified ppem. + * This *really* means TrueType bytecode interpretation. + * + * FT_GASP_DO_GRAY :: + * Anti-aliased rendering should be performed at the specified ppem. + * + * FT_GASP_SYMMETRIC_SMOOTHING :: + * Smoothing along multiple axes must be used with ClearType. + * + * FT_GASP_SYMMETRIC_GRIDFIT :: + * Grid-fitting must be used with ClearType's symmetric smoothing. + * + * @note: + * `ClearType' is Microsoft's implementation of LCD rendering, partly + * protected by patents. + * + * @since: + * 2.3.0 + */ +#define FT_GASP_NO_TABLE -1 +#define FT_GASP_DO_GRIDFIT 0x01 +#define FT_GASP_DO_GRAY 0x02 +#define FT_GASP_SYMMETRIC_SMOOTHING 0x08 +#define FT_GASP_SYMMETRIC_GRIDFIT 0x10 + + + /************************************************************************* + * + * @func: + * FT_Get_Gasp + * + * @description: + * Read the `gasp' table from a TrueType or OpenType font file and + * return the entry corresponding to a given character pixel size. + * + * @input: + * face :: The source face handle. + * ppem :: The vertical character pixel size. + * + * @return: + * Bit flags (see @FT_GASP_XXX), or @FT_GASP_NO_TABLE if there is no + * `gasp' table in the face. + * + * @since: + * 2.3.0 + */ + FT_EXPORT( FT_Int ) + FT_Get_Gasp( FT_Face face, + FT_UInt ppem ); + +/* */ + +#endif /* _FT_GASP_H_ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftglyph.h b/portlibs/include/freetype/ftglyph.h new file mode 100644 index 00000000..fdf410e9 --- /dev/null +++ b/portlibs/include/freetype/ftglyph.h @@ -0,0 +1,613 @@ +/***************************************************************************/ +/* */ +/* ftglyph.h */ +/* */ +/* FreeType convenience functions to handle glyphs (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This file contains the definition of several convenience functions */ + /* that can be used by client applications to easily retrieve glyph */ + /* bitmaps and outlines from a given face. */ + /* */ + /* These functions should be optional if you are writing a font server */ + /* or text layout engine on top of FreeType. However, they are pretty */ + /* handy for many other simple uses of the library. */ + /* */ + /*************************************************************************/ + + +#ifndef __FTGLYPH_H__ +#define __FTGLYPH_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* glyph_management */ + /* */ + /* <Title> */ + /* Glyph Management */ + /* */ + /* <Abstract> */ + /* Generic interface to manage individual glyph data. */ + /* */ + /* <Description> */ + /* This section contains definitions used to manage glyph data */ + /* through generic FT_Glyph objects. Each of them can contain a */ + /* bitmap, a vector outline, or even images in other formats. */ + /* */ + /*************************************************************************/ + + + /* forward declaration to a private type */ + typedef struct FT_Glyph_Class_ FT_Glyph_Class; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Glyph */ + /* */ + /* <Description> */ + /* Handle to an object used to model generic glyph images. It is a */ + /* pointer to the @FT_GlyphRec structure and can contain a glyph */ + /* bitmap or pointer. */ + /* */ + /* <Note> */ + /* Glyph objects are not owned by the library. You must thus release */ + /* them manually (through @FT_Done_Glyph) _before_ calling */ + /* @FT_Done_FreeType. */ + /* */ + typedef struct FT_GlyphRec_* FT_Glyph; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_GlyphRec */ + /* */ + /* <Description> */ + /* The root glyph structure contains a given glyph image plus its */ + /* advance width in 16.16 fixed float format. */ + /* */ + /* <Fields> */ + /* library :: A handle to the FreeType library object. */ + /* */ + /* clazz :: A pointer to the glyph's class. Private. */ + /* */ + /* format :: The format of the glyph's image. */ + /* */ + /* advance :: A 16.16 vector that gives the glyph's advance width. */ + /* */ + typedef struct FT_GlyphRec_ + { + FT_Library library; + const FT_Glyph_Class* clazz; + FT_Glyph_Format format; + FT_Vector advance; + + } FT_GlyphRec; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_BitmapGlyph */ + /* */ + /* <Description> */ + /* A handle to an object used to model a bitmap glyph image. This is */ + /* a sub-class of @FT_Glyph, and a pointer to @FT_BitmapGlyphRec. */ + /* */ + typedef struct FT_BitmapGlyphRec_* FT_BitmapGlyph; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_BitmapGlyphRec */ + /* */ + /* <Description> */ + /* A structure used for bitmap glyph images. This really is a */ + /* `sub-class' of @FT_GlyphRec. */ + /* */ + /* <Fields> */ + /* root :: The root @FT_Glyph fields. */ + /* */ + /* left :: The left-side bearing, i.e., the horizontal distance */ + /* from the current pen position to the left border of the */ + /* glyph bitmap. */ + /* */ + /* top :: The top-side bearing, i.e., the vertical distance from */ + /* the current pen position to the top border of the glyph */ + /* bitmap. This distance is positive for upwards~y! */ + /* */ + /* bitmap :: A descriptor for the bitmap. */ + /* */ + /* <Note> */ + /* You can typecast an @FT_Glyph to @FT_BitmapGlyph if you have */ + /* `glyph->format == FT_GLYPH_FORMAT_BITMAP'. This lets you access */ + /* the bitmap's contents easily. */ + /* */ + /* The corresponding pixel buffer is always owned by @FT_BitmapGlyph */ + /* and is thus created and destroyed with it. */ + /* */ + typedef struct FT_BitmapGlyphRec_ + { + FT_GlyphRec root; + FT_Int left; + FT_Int top; + FT_Bitmap bitmap; + + } FT_BitmapGlyphRec; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_OutlineGlyph */ + /* */ + /* <Description> */ + /* A handle to an object used to model an outline glyph image. This */ + /* is a sub-class of @FT_Glyph, and a pointer to @FT_OutlineGlyphRec. */ + /* */ + typedef struct FT_OutlineGlyphRec_* FT_OutlineGlyph; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_OutlineGlyphRec */ + /* */ + /* <Description> */ + /* A structure used for outline (vectorial) glyph images. This */ + /* really is a `sub-class' of @FT_GlyphRec. */ + /* */ + /* <Fields> */ + /* root :: The root @FT_Glyph fields. */ + /* */ + /* outline :: A descriptor for the outline. */ + /* */ + /* <Note> */ + /* You can typecast a @FT_Glyph to @FT_OutlineGlyph if you have */ + /* `glyph->format == FT_GLYPH_FORMAT_OUTLINE'. This lets you access */ + /* the outline's content easily. */ + /* */ + /* As the outline is extracted from a glyph slot, its coordinates are */ + /* expressed normally in 26.6 pixels, unless the flag */ + /* @FT_LOAD_NO_SCALE was used in @FT_Load_Glyph() or @FT_Load_Char(). */ + /* */ + /* The outline's tables are always owned by the object and are */ + /* destroyed with it. */ + /* */ + typedef struct FT_OutlineGlyphRec_ + { + FT_GlyphRec root; + FT_Outline outline; + + } FT_OutlineGlyphRec; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Glyph */ + /* */ + /* <Description> */ + /* A function used to extract a glyph image from a slot. Note that */ + /* the created @FT_Glyph object must be released with @FT_Done_Glyph. */ + /* */ + /* <Input> */ + /* slot :: A handle to the source glyph slot. */ + /* */ + /* <Output> */ + /* aglyph :: A handle to the glyph object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Get_Glyph( FT_GlyphSlot slot, + FT_Glyph *aglyph ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Glyph_Copy */ + /* */ + /* <Description> */ + /* A function used to copy a glyph image. Note that the created */ + /* @FT_Glyph object must be released with @FT_Done_Glyph. */ + /* */ + /* <Input> */ + /* source :: A handle to the source glyph object. */ + /* */ + /* <Output> */ + /* target :: A handle to the target glyph object. 0~in case of */ + /* error. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Glyph_Copy( FT_Glyph source, + FT_Glyph *target ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Glyph_Transform */ + /* */ + /* <Description> */ + /* Transform a glyph image if its format is scalable. */ + /* */ + /* <InOut> */ + /* glyph :: A handle to the target glyph object. */ + /* */ + /* <Input> */ + /* matrix :: A pointer to a 2x2 matrix to apply. */ + /* */ + /* delta :: A pointer to a 2d vector to apply. Coordinates are */ + /* expressed in 1/64th of a pixel. */ + /* */ + /* <Return> */ + /* FreeType error code (if not 0, the glyph format is not scalable). */ + /* */ + /* <Note> */ + /* The 2x2 transformation matrix is also applied to the glyph's */ + /* advance vector. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Glyph_Transform( FT_Glyph glyph, + FT_Matrix* matrix, + FT_Vector* delta ); + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_Glyph_BBox_Mode */ + /* */ + /* <Description> */ + /* The mode how the values of @FT_Glyph_Get_CBox are returned. */ + /* */ + /* <Values> */ + /* FT_GLYPH_BBOX_UNSCALED :: */ + /* Return unscaled font units. */ + /* */ + /* FT_GLYPH_BBOX_SUBPIXELS :: */ + /* Return unfitted 26.6 coordinates. */ + /* */ + /* FT_GLYPH_BBOX_GRIDFIT :: */ + /* Return grid-fitted 26.6 coordinates. */ + /* */ + /* FT_GLYPH_BBOX_TRUNCATE :: */ + /* Return coordinates in integer pixels. */ + /* */ + /* FT_GLYPH_BBOX_PIXELS :: */ + /* Return grid-fitted pixel coordinates. */ + /* */ + typedef enum FT_Glyph_BBox_Mode_ + { + FT_GLYPH_BBOX_UNSCALED = 0, + FT_GLYPH_BBOX_SUBPIXELS = 0, + FT_GLYPH_BBOX_GRIDFIT = 1, + FT_GLYPH_BBOX_TRUNCATE = 2, + FT_GLYPH_BBOX_PIXELS = 3 + + } FT_Glyph_BBox_Mode; + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* ft_glyph_bbox_xxx */ + /* */ + /* <Description> */ + /* These constants are deprecated. Use the corresponding */ + /* @FT_Glyph_BBox_Mode values instead. */ + /* */ + /* <Values> */ + /* ft_glyph_bbox_unscaled :: See @FT_GLYPH_BBOX_UNSCALED. */ + /* ft_glyph_bbox_subpixels :: See @FT_GLYPH_BBOX_SUBPIXELS. */ + /* ft_glyph_bbox_gridfit :: See @FT_GLYPH_BBOX_GRIDFIT. */ + /* ft_glyph_bbox_truncate :: See @FT_GLYPH_BBOX_TRUNCATE. */ + /* ft_glyph_bbox_pixels :: See @FT_GLYPH_BBOX_PIXELS. */ + /* */ +#define ft_glyph_bbox_unscaled FT_GLYPH_BBOX_UNSCALED +#define ft_glyph_bbox_subpixels FT_GLYPH_BBOX_SUBPIXELS +#define ft_glyph_bbox_gridfit FT_GLYPH_BBOX_GRIDFIT +#define ft_glyph_bbox_truncate FT_GLYPH_BBOX_TRUNCATE +#define ft_glyph_bbox_pixels FT_GLYPH_BBOX_PIXELS + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Glyph_Get_CBox */ + /* */ + /* <Description> */ + /* Return a glyph's `control box'. The control box encloses all the */ + /* outline's points, including Bézier control points. Though it */ + /* coincides with the exact bounding box for most glyphs, it can be */ + /* slightly larger in some situations (like when rotating an outline */ + /* which contains Bézier outside arcs). */ + /* */ + /* Computing the control box is very fast, while getting the bounding */ + /* box can take much more time as it needs to walk over all segments */ + /* and arcs in the outline. To get the latter, you can use the */ + /* `ftbbox' component which is dedicated to this single task. */ + /* */ + /* <Input> */ + /* glyph :: A handle to the source glyph object. */ + /* */ + /* mode :: The mode which indicates how to interpret the returned */ + /* bounding box values. */ + /* */ + /* <Output> */ + /* acbox :: The glyph coordinate bounding box. Coordinates are */ + /* expressed in 1/64th of pixels if it is grid-fitted. */ + /* */ + /* <Note> */ + /* Coordinates are relative to the glyph origin, using the y~upwards */ + /* convention. */ + /* */ + /* If the glyph has been loaded with @FT_LOAD_NO_SCALE, `bbox_mode' */ + /* must be set to @FT_GLYPH_BBOX_UNSCALED to get unscaled font */ + /* units in 26.6 pixel format. The value @FT_GLYPH_BBOX_SUBPIXELS */ + /* is another name for this constant. */ + /* */ + /* Note that the maximum coordinates are exclusive, which means that */ + /* one can compute the width and height of the glyph image (be it in */ + /* integer or 26.6 pixels) as: */ + /* */ + /* { */ + /* width = bbox.xMax - bbox.xMin; */ + /* height = bbox.yMax - bbox.yMin; */ + /* } */ + /* */ + /* Note also that for 26.6 coordinates, if `bbox_mode' is set to */ + /* @FT_GLYPH_BBOX_GRIDFIT, the coordinates will also be grid-fitted, */ + /* which corresponds to: */ + /* */ + /* { */ + /* bbox.xMin = FLOOR(bbox.xMin); */ + /* bbox.yMin = FLOOR(bbox.yMin); */ + /* bbox.xMax = CEILING(bbox.xMax); */ + /* bbox.yMax = CEILING(bbox.yMax); */ + /* } */ + /* */ + /* To get the bbox in pixel coordinates, set `bbox_mode' to */ + /* @FT_GLYPH_BBOX_TRUNCATE. */ + /* */ + /* To get the bbox in grid-fitted pixel coordinates, set `bbox_mode' */ + /* to @FT_GLYPH_BBOX_PIXELS. */ + /* */ + FT_EXPORT( void ) + FT_Glyph_Get_CBox( FT_Glyph glyph, + FT_UInt bbox_mode, + FT_BBox *acbox ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Glyph_To_Bitmap */ + /* */ + /* <Description> */ + /* Convert a given glyph object to a bitmap glyph object. */ + /* */ + /* <InOut> */ + /* the_glyph :: A pointer to a handle to the target glyph. */ + /* */ + /* <Input> */ + /* render_mode :: An enumeration that describes how the data is */ + /* rendered. */ + /* */ + /* origin :: A pointer to a vector used to translate the glyph */ + /* image before rendering. Can be~0 (if no */ + /* translation). The origin is expressed in */ + /* 26.6 pixels. */ + /* */ + /* destroy :: A boolean that indicates that the original glyph */ + /* image should be destroyed by this function. It is */ + /* never destroyed in case of error. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* This function does nothing if the glyph format isn't scalable. */ + /* */ + /* The glyph image is translated with the `origin' vector before */ + /* rendering. */ + /* */ + /* The first parameter is a pointer to an @FT_Glyph handle, that will */ + /* be _replaced_ by this function (with newly allocated data). */ + /* Typically, you would use (omitting error handling): */ + /* */ + /* */ + /* { */ + /* FT_Glyph glyph; */ + /* FT_BitmapGlyph glyph_bitmap; */ + /* */ + /* */ + /* // load glyph */ + /* error = FT_Load_Char( face, glyph_index, FT_LOAD_DEFAUT ); */ + /* */ + /* // extract glyph image */ + /* error = FT_Get_Glyph( face->glyph, &glyph ); */ + /* */ + /* // convert to a bitmap (default render mode + destroying old) */ + /* if ( glyph->format != FT_GLYPH_FORMAT_BITMAP ) */ + /* { */ + /* error = FT_Glyph_To_Bitmap( &glyph, FT_RENDER_MODE_DEFAULT, */ + /* 0, 1 ); */ + /* if ( error ) // `glyph' unchanged */ + /* ... */ + /* } */ + /* */ + /* // access bitmap content by typecasting */ + /* glyph_bitmap = (FT_BitmapGlyph)glyph; */ + /* */ + /* // do funny stuff with it, like blitting/drawing */ + /* ... */ + /* */ + /* // discard glyph image (bitmap or not) */ + /* FT_Done_Glyph( glyph ); */ + /* } */ + /* */ + /* */ + /* Here another example, again without error handling: */ + /* */ + /* */ + /* { */ + /* FT_Glyph glyphs[MAX_GLYPHS] */ + /* */ + /* */ + /* ... */ + /* */ + /* for ( idx = 0; i < MAX_GLYPHS; i++ ) */ + /* error = FT_Load_Glyph( face, idx, FT_LOAD_DEFAULT ) || */ + /* FT_Get_Glyph ( face->glyph, &glyph[idx] ); */ + /* */ + /* ... */ + /* */ + /* for ( idx = 0; i < MAX_GLYPHS; i++ ) */ + /* { */ + /* FT_Glyph bitmap = glyphs[idx]; */ + /* */ + /* */ + /* ... */ + /* */ + /* // after this call, `bitmap' no longer points into */ + /* // the `glyphs' array (and the old value isn't destroyed) */ + /* FT_Glyph_To_Bitmap( &bitmap, FT_RENDER_MODE_MONO, 0, 0 ); */ + /* */ + /* ... */ + /* */ + /* FT_Done_Glyph( bitmap ); */ + /* } */ + /* */ + /* ... */ + /* */ + /* for ( idx = 0; i < MAX_GLYPHS; i++ ) */ + /* FT_Done_Glyph( glyphs[idx] ); */ + /* } */ + /* */ + FT_EXPORT( FT_Error ) + FT_Glyph_To_Bitmap( FT_Glyph* the_glyph, + FT_Render_Mode render_mode, + FT_Vector* origin, + FT_Bool destroy ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Done_Glyph */ + /* */ + /* <Description> */ + /* Destroy a given glyph. */ + /* */ + /* <Input> */ + /* glyph :: A handle to the target glyph object. */ + /* */ + FT_EXPORT( void ) + FT_Done_Glyph( FT_Glyph glyph ); + + /* */ + + + /* other helpful functions */ + + /*************************************************************************/ + /* */ + /* <Section> */ + /* computations */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Matrix_Multiply */ + /* */ + /* <Description> */ + /* Perform the matrix operation `b = a*b'. */ + /* */ + /* <Input> */ + /* a :: A pointer to matrix `a'. */ + /* */ + /* <InOut> */ + /* b :: A pointer to matrix `b'. */ + /* */ + /* <Note> */ + /* The result is undefined if either `a' or `b' is zero. */ + /* */ + FT_EXPORT( void ) + FT_Matrix_Multiply( const FT_Matrix* a, + FT_Matrix* b ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Matrix_Invert */ + /* */ + /* <Description> */ + /* Invert a 2x2 matrix. Return an error if it can't be inverted. */ + /* */ + /* <InOut> */ + /* matrix :: A pointer to the target matrix. Remains untouched in */ + /* case of error. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Matrix_Invert( FT_Matrix* matrix ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FTGLYPH_H__ */ + + +/* END */ + + +/* Local Variables: */ +/* coding: utf-8 */ +/* End: */ diff --git a/portlibs/include/freetype/ftgxval.h b/portlibs/include/freetype/ftgxval.h new file mode 100644 index 00000000..497015c1 --- /dev/null +++ b/portlibs/include/freetype/ftgxval.h @@ -0,0 +1,358 @@ +/***************************************************************************/ +/* */ +/* ftgxval.h */ +/* */ +/* FreeType API for validating TrueTypeGX/AAT tables (specification). */ +/* */ +/* Copyright 2004, 2005, 2006 by */ +/* Masatake YAMATO, Redhat K.K, */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + +/***************************************************************************/ +/* */ +/* gxvalid is derived from both gxlayout module and otvalid module. */ +/* Development of gxlayout is supported by the Information-technology */ +/* Promotion Agency(IPA), Japan. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTGXVAL_H__ +#define __FTGXVAL_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* gx_validation */ + /* */ + /* <Title> */ + /* TrueTypeGX/AAT Validation */ + /* */ + /* <Abstract> */ + /* An API to validate TrueTypeGX/AAT tables. */ + /* */ + /* <Description> */ + /* This section contains the declaration of functions to validate */ + /* some TrueTypeGX tables (feat, mort, morx, bsln, just, kern, opbd, */ + /* trak, prop, lcar). */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* */ + /* Warning: Use FT_VALIDATE_XXX to validate a table. */ + /* Following definitions are for gxvalid developers. */ + /* */ + /* */ + /*************************************************************************/ + +#define FT_VALIDATE_feat_INDEX 0 +#define FT_VALIDATE_mort_INDEX 1 +#define FT_VALIDATE_morx_INDEX 2 +#define FT_VALIDATE_bsln_INDEX 3 +#define FT_VALIDATE_just_INDEX 4 +#define FT_VALIDATE_kern_INDEX 5 +#define FT_VALIDATE_opbd_INDEX 6 +#define FT_VALIDATE_trak_INDEX 7 +#define FT_VALIDATE_prop_INDEX 8 +#define FT_VALIDATE_lcar_INDEX 9 +#define FT_VALIDATE_GX_LAST_INDEX FT_VALIDATE_lcar_INDEX + + + /************************************************************************* + * + * @macro: + * FT_VALIDATE_GX_LENGTH + * + * @description: + * The number of tables checked in this module. Use it as a parameter + * for the `table-length' argument of function @FT_TrueTypeGX_Validate. + */ +#define FT_VALIDATE_GX_LENGTH (FT_VALIDATE_GX_LAST_INDEX + 1) + + /* */ + + /* Up to 0x1000 is used by otvalid. + Ox2xxx is reserved for feature OT extension. */ +#define FT_VALIDATE_GX_START 0x4000 +#define FT_VALIDATE_GX_BITFIELD( tag ) \ + ( FT_VALIDATE_GX_START << FT_VALIDATE_##tag##_INDEX ) + + + /********************************************************************** + * + * @enum: + * FT_VALIDATE_GXXXX + * + * @description: + * A list of bit-field constants used with @FT_TrueTypeGX_Validate to + * indicate which TrueTypeGX/AAT Type tables should be validated. + * + * @values: + * FT_VALIDATE_feat :: + * Validate `feat' table. + * + * FT_VALIDATE_mort :: + * Validate `mort' table. + * + * FT_VALIDATE_morx :: + * Validate `morx' table. + * + * FT_VALIDATE_bsln :: + * Validate `bsln' table. + * + * FT_VALIDATE_just :: + * Validate `just' table. + * + * FT_VALIDATE_kern :: + * Validate `kern' table. + * + * FT_VALIDATE_opbd :: + * Validate `opbd' table. + * + * FT_VALIDATE_trak :: + * Validate `trak' table. + * + * FT_VALIDATE_prop :: + * Validate `prop' table. + * + * FT_VALIDATE_lcar :: + * Validate `lcar' table. + * + * FT_VALIDATE_GX :: + * Validate all TrueTypeGX tables (feat, mort, morx, bsln, just, kern, + * opbd, trak, prop and lcar). + * + */ + +#define FT_VALIDATE_feat FT_VALIDATE_GX_BITFIELD( feat ) +#define FT_VALIDATE_mort FT_VALIDATE_GX_BITFIELD( mort ) +#define FT_VALIDATE_morx FT_VALIDATE_GX_BITFIELD( morx ) +#define FT_VALIDATE_bsln FT_VALIDATE_GX_BITFIELD( bsln ) +#define FT_VALIDATE_just FT_VALIDATE_GX_BITFIELD( just ) +#define FT_VALIDATE_kern FT_VALIDATE_GX_BITFIELD( kern ) +#define FT_VALIDATE_opbd FT_VALIDATE_GX_BITFIELD( opbd ) +#define FT_VALIDATE_trak FT_VALIDATE_GX_BITFIELD( trak ) +#define FT_VALIDATE_prop FT_VALIDATE_GX_BITFIELD( prop ) +#define FT_VALIDATE_lcar FT_VALIDATE_GX_BITFIELD( lcar ) + +#define FT_VALIDATE_GX ( FT_VALIDATE_feat | \ + FT_VALIDATE_mort | \ + FT_VALIDATE_morx | \ + FT_VALIDATE_bsln | \ + FT_VALIDATE_just | \ + FT_VALIDATE_kern | \ + FT_VALIDATE_opbd | \ + FT_VALIDATE_trak | \ + FT_VALIDATE_prop | \ + FT_VALIDATE_lcar ) + + + /* */ + + /********************************************************************** + * + * @function: + * FT_TrueTypeGX_Validate + * + * @description: + * Validate various TrueTypeGX tables to assure that all offsets and + * indices are valid. The idea is that a higher-level library which + * actually does the text layout can access those tables without + * error checking (which can be quite time consuming). + * + * @input: + * face :: + * A handle to the input face. + * + * validation_flags :: + * A bit field which specifies the tables to be validated. See + * @FT_VALIDATE_GXXXX for possible values. + * + * table_length :: + * The size of the `tables' array. Normally, @FT_VALIDATE_GX_LENGTH + * should be passed. + * + * @output: + * tables :: + * The array where all validated sfnt tables are stored. + * The array itself must be allocated by a client. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * This function only works with TrueTypeGX fonts, returning an error + * otherwise. + * + * After use, the application should deallocate the buffers pointed to by + * each `tables' element, by calling @FT_TrueTypeGX_Free. A NULL value + * indicates that the table either doesn't exist in the font, the + * application hasn't asked for validation, or the validator doesn't have + * the ability to validate the sfnt table. + */ + FT_EXPORT( FT_Error ) + FT_TrueTypeGX_Validate( FT_Face face, + FT_UInt validation_flags, + FT_Bytes tables[FT_VALIDATE_GX_LENGTH], + FT_UInt table_length ); + + + /* */ + + /********************************************************************** + * + * @function: + * FT_TrueTypeGX_Free + * + * @description: + * Free the buffer allocated by TrueTypeGX validator. + * + * @input: + * face :: + * A handle to the input face. + * + * table :: + * The pointer to the buffer allocated by + * @FT_TrueTypeGX_Validate. + * + * @note: + * This function must be used to free the buffer allocated by + * @FT_TrueTypeGX_Validate only. + */ + FT_EXPORT( void ) + FT_TrueTypeGX_Free( FT_Face face, + FT_Bytes table ); + + + /* */ + + /********************************************************************** + * + * @enum: + * FT_VALIDATE_CKERNXXX + * + * @description: + * A list of bit-field constants used with @FT_ClassicKern_Validate + * to indicate the classic kern dialect or dialects. If the selected + * type doesn't fit, @FT_ClassicKern_Validate regards the table as + * invalid. + * + * @values: + * FT_VALIDATE_MS :: + * Handle the `kern' table as a classic Microsoft kern table. + * + * FT_VALIDATE_APPLE :: + * Handle the `kern' table as a classic Apple kern table. + * + * FT_VALIDATE_CKERN :: + * Handle the `kern' as either classic Apple or Microsoft kern table. + */ +#define FT_VALIDATE_MS ( FT_VALIDATE_GX_START << 0 ) +#define FT_VALIDATE_APPLE ( FT_VALIDATE_GX_START << 1 ) + +#define FT_VALIDATE_CKERN ( FT_VALIDATE_MS | FT_VALIDATE_APPLE ) + + + /* */ + + /********************************************************************** + * + * @function: + * FT_ClassicKern_Validate + * + * @description: + * Validate classic (16-bit format) kern table to assure that the offsets + * and indices are valid. The idea is that a higher-level library which + * actually does the text layout can access those tables without error + * checking (which can be quite time consuming). + * + * The `kern' table validator in @FT_TrueTypeGX_Validate deals with both + * the new 32-bit format and the classic 16-bit format, while + * FT_ClassicKern_Validate only supports the classic 16-bit format. + * + * @input: + * face :: + * A handle to the input face. + * + * validation_flags :: + * A bit field which specifies the dialect to be validated. See + * @FT_VALIDATE_CKERNXXX for possible values. + * + * @output: + * ckern_table :: + * A pointer to the kern table. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * After use, the application should deallocate the buffers pointed to by + * `ckern_table', by calling @FT_ClassicKern_Free. A NULL value + * indicates that the table doesn't exist in the font. + */ + FT_EXPORT( FT_Error ) + FT_ClassicKern_Validate( FT_Face face, + FT_UInt validation_flags, + FT_Bytes *ckern_table ); + + + /* */ + + /********************************************************************** + * + * @function: + * FT_ClassicKern_Free + * + * @description: + * Free the buffer allocated by classic Kern validator. + * + * @input: + * face :: + * A handle to the input face. + * + * table :: + * The pointer to the buffer that is allocated by + * @FT_ClassicKern_Validate. + * + * @note: + * This function must be used to free the buffer allocated by + * @FT_ClassicKern_Validate only. + */ + FT_EXPORT( void ) + FT_ClassicKern_Free( FT_Face face, + FT_Bytes table ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FTGXVAL_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftgzip.h b/portlibs/include/freetype/ftgzip.h new file mode 100644 index 00000000..acbc4f03 --- /dev/null +++ b/portlibs/include/freetype/ftgzip.h @@ -0,0 +1,102 @@ +/***************************************************************************/ +/* */ +/* ftgzip.h */ +/* */ +/* Gzip-compressed stream support. */ +/* */ +/* Copyright 2002, 2003, 2004, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTGZIP_H__ +#define __FTGZIP_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + /*************************************************************************/ + /* */ + /* <Section> */ + /* gzip */ + /* */ + /* <Title> */ + /* GZIP Streams */ + /* */ + /* <Abstract> */ + /* Using gzip-compressed font files. */ + /* */ + /* <Description> */ + /* This section contains the declaration of Gzip-specific functions. */ + /* */ + /*************************************************************************/ + + + /************************************************************************ + * + * @function: + * FT_Stream_OpenGzip + * + * @description: + * Open a new stream to parse gzip-compressed font files. This is + * mainly used to support the compressed `*.pcf.gz' fonts that come + * with XFree86. + * + * @input: + * stream :: + * The target embedding stream. + * + * source :: + * The source stream. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * The source stream must be opened _before_ calling this function. + * + * Calling the internal function `FT_Stream_Close' on the new stream will + * *not* call `FT_Stream_Close' on the source stream. None of the stream + * objects will be released to the heap. + * + * The stream implementation is very basic and resets the decompression + * process each time seeking backwards is needed within the stream. + * + * In certain builds of the library, gzip compression recognition is + * automatically handled when calling @FT_New_Face or @FT_Open_Face. + * This means that if no font driver is capable of handling the raw + * compressed file, the library will try to open a gzipped stream from + * it and re-open the face with it. + * + * This function may return `FT_Err_Unimplemented_Feature' if your build + * of FreeType was not compiled with zlib support. + */ + FT_EXPORT( FT_Error ) + FT_Stream_OpenGzip( FT_Stream stream, + FT_Stream source ); + + /* */ + + +FT_END_HEADER + +#endif /* __FTGZIP_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftimage.h b/portlibs/include/freetype/ftimage.h new file mode 100644 index 00000000..ccc2f713 --- /dev/null +++ b/portlibs/include/freetype/ftimage.h @@ -0,0 +1,1254 @@ +/***************************************************************************/ +/* */ +/* ftimage.h */ +/* */ +/* FreeType glyph image formats and default raster interface */ +/* (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + /*************************************************************************/ + /* */ + /* Note: A `raster' is simply a scan-line converter, used to render */ + /* FT_Outlines into FT_Bitmaps. */ + /* */ + /*************************************************************************/ + + +#ifndef __FTIMAGE_H__ +#define __FTIMAGE_H__ + + + /* _STANDALONE_ is from ftgrays.c */ +#ifndef _STANDALONE_ +#include <ft2build.h> +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* basic_types */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Pos */ + /* */ + /* <Description> */ + /* The type FT_Pos is a 32-bit integer used to store vectorial */ + /* coordinates. Depending on the context, these can represent */ + /* distances in integer font units, or 16.16, or 26.6 fixed float */ + /* pixel coordinates. */ + /* */ + typedef signed long FT_Pos; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Vector */ + /* */ + /* <Description> */ + /* A simple structure used to store a 2D vector; coordinates are of */ + /* the FT_Pos type. */ + /* */ + /* <Fields> */ + /* x :: The horizontal coordinate. */ + /* y :: The vertical coordinate. */ + /* */ + typedef struct FT_Vector_ + { + FT_Pos x; + FT_Pos y; + + } FT_Vector; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_BBox */ + /* */ + /* <Description> */ + /* A structure used to hold an outline's bounding box, i.e., the */ + /* coordinates of its extrema in the horizontal and vertical */ + /* directions. */ + /* */ + /* <Fields> */ + /* xMin :: The horizontal minimum (left-most). */ + /* */ + /* yMin :: The vertical minimum (bottom-most). */ + /* */ + /* xMax :: The horizontal maximum (right-most). */ + /* */ + /* yMax :: The vertical maximum (top-most). */ + /* */ + typedef struct FT_BBox_ + { + FT_Pos xMin, yMin; + FT_Pos xMax, yMax; + + } FT_BBox; + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_Pixel_Mode */ + /* */ + /* <Description> */ + /* An enumeration type used to describe the format of pixels in a */ + /* given bitmap. Note that additional formats may be added in the */ + /* future. */ + /* */ + /* <Values> */ + /* FT_PIXEL_MODE_NONE :: */ + /* Value~0 is reserved. */ + /* */ + /* FT_PIXEL_MODE_MONO :: */ + /* A monochrome bitmap, using 1~bit per pixel. Note that pixels */ + /* are stored in most-significant order (MSB), which means that */ + /* the left-most pixel in a byte has value 128. */ + /* */ + /* FT_PIXEL_MODE_GRAY :: */ + /* An 8-bit bitmap, generally used to represent anti-aliased glyph */ + /* images. Each pixel is stored in one byte. Note that the number */ + /* of `gray' levels is stored in the `num_grays' field of the */ + /* @FT_Bitmap structure (it generally is 256). */ + /* */ + /* FT_PIXEL_MODE_GRAY2 :: */ + /* A 2-bit per pixel bitmap, used to represent embedded */ + /* anti-aliased bitmaps in font files according to the OpenType */ + /* specification. We haven't found a single font using this */ + /* format, however. */ + /* */ + /* FT_PIXEL_MODE_GRAY4 :: */ + /* A 4-bit per pixel bitmap, representing embedded anti-aliased */ + /* bitmaps in font files according to the OpenType specification. */ + /* We haven't found a single font using this format, however. */ + /* */ + /* FT_PIXEL_MODE_LCD :: */ + /* An 8-bit bitmap, representing RGB or BGR decimated glyph images */ + /* used for display on LCD displays; the bitmap is three times */ + /* wider than the original glyph image. See also */ + /* @FT_RENDER_MODE_LCD. */ + /* */ + /* FT_PIXEL_MODE_LCD_V :: */ + /* An 8-bit bitmap, representing RGB or BGR decimated glyph images */ + /* used for display on rotated LCD displays; the bitmap is three */ + /* times taller than the original glyph image. See also */ + /* @FT_RENDER_MODE_LCD_V. */ + /* */ + typedef enum FT_Pixel_Mode_ + { + FT_PIXEL_MODE_NONE = 0, + FT_PIXEL_MODE_MONO, + FT_PIXEL_MODE_GRAY, + FT_PIXEL_MODE_GRAY2, + FT_PIXEL_MODE_GRAY4, + FT_PIXEL_MODE_LCD, + FT_PIXEL_MODE_LCD_V, + + FT_PIXEL_MODE_MAX /* do not remove */ + + } FT_Pixel_Mode; + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* ft_pixel_mode_xxx */ + /* */ + /* <Description> */ + /* A list of deprecated constants. Use the corresponding */ + /* @FT_Pixel_Mode values instead. */ + /* */ + /* <Values> */ + /* ft_pixel_mode_none :: See @FT_PIXEL_MODE_NONE. */ + /* ft_pixel_mode_mono :: See @FT_PIXEL_MODE_MONO. */ + /* ft_pixel_mode_grays :: See @FT_PIXEL_MODE_GRAY. */ + /* ft_pixel_mode_pal2 :: See @FT_PIXEL_MODE_GRAY2. */ + /* ft_pixel_mode_pal4 :: See @FT_PIXEL_MODE_GRAY4. */ + /* */ +#define ft_pixel_mode_none FT_PIXEL_MODE_NONE +#define ft_pixel_mode_mono FT_PIXEL_MODE_MONO +#define ft_pixel_mode_grays FT_PIXEL_MODE_GRAY +#define ft_pixel_mode_pal2 FT_PIXEL_MODE_GRAY2 +#define ft_pixel_mode_pal4 FT_PIXEL_MODE_GRAY4 + + /* */ + +#if 0 + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_Palette_Mode */ + /* */ + /* <Description> */ + /* THIS TYPE IS DEPRECATED. DO NOT USE IT! */ + /* */ + /* An enumeration type to describe the format of a bitmap palette, */ + /* used with ft_pixel_mode_pal4 and ft_pixel_mode_pal8. */ + /* */ + /* <Values> */ + /* ft_palette_mode_rgb :: The palette is an array of 3-byte RGB */ + /* records. */ + /* */ + /* ft_palette_mode_rgba :: The palette is an array of 4-byte RGBA */ + /* records. */ + /* */ + /* <Note> */ + /* As ft_pixel_mode_pal2, pal4 and pal8 are currently unused by */ + /* FreeType, these types are not handled by the library itself. */ + /* */ + typedef enum FT_Palette_Mode_ + { + ft_palette_mode_rgb = 0, + ft_palette_mode_rgba, + + ft_palette_mode_max /* do not remove */ + + } FT_Palette_Mode; + + /* */ + +#endif + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Bitmap */ + /* */ + /* <Description> */ + /* A structure used to describe a bitmap or pixmap to the raster. */ + /* Note that we now manage pixmaps of various depths through the */ + /* `pixel_mode' field. */ + /* */ + /* <Fields> */ + /* rows :: The number of bitmap rows. */ + /* */ + /* width :: The number of pixels in bitmap row. */ + /* */ + /* pitch :: The pitch's absolute value is the number of bytes */ + /* taken by one bitmap row, including padding. */ + /* However, the pitch is positive when the bitmap has */ + /* a `down' flow, and negative when it has an `up' */ + /* flow. In all cases, the pitch is an offset to add */ + /* to a bitmap pointer in order to go down one row. */ + /* */ + /* buffer :: A typeless pointer to the bitmap buffer. This */ + /* value should be aligned on 32-bit boundaries in */ + /* most cases. */ + /* */ + /* num_grays :: This field is only used with */ + /* @FT_PIXEL_MODE_GRAY; it gives the number of gray */ + /* levels used in the bitmap. */ + /* */ + /* pixel_mode :: The pixel mode, i.e., how pixel bits are stored. */ + /* See @FT_Pixel_Mode for possible values. */ + /* */ + /* palette_mode :: This field is intended for paletted pixel modes; */ + /* it indicates how the palette is stored. Not */ + /* used currently. */ + /* */ + /* palette :: A typeless pointer to the bitmap palette; this */ + /* field is intended for paletted pixel modes. Not */ + /* used currently. */ + /* */ + /* <Note> */ + /* For now, the only pixel modes supported by FreeType are mono and */ + /* grays. However, drivers might be added in the future to support */ + /* more `colorful' options. */ + /* */ + typedef struct FT_Bitmap_ + { + int rows; + int width; + int pitch; + unsigned char* buffer; + short num_grays; + char pixel_mode; + char palette_mode; + void* palette; + + } FT_Bitmap; + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* outline_processing */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Outline */ + /* */ + /* <Description> */ + /* This structure is used to describe an outline to the scan-line */ + /* converter. */ + /* */ + /* <Fields> */ + /* n_contours :: The number of contours in the outline. */ + /* */ + /* n_points :: The number of points in the outline. */ + /* */ + /* points :: A pointer to an array of `n_points' @FT_Vector */ + /* elements, giving the outline's point coordinates. */ + /* */ + /* tags :: A pointer to an array of `n_points' chars, giving */ + /* each outline point's type. If bit~0 is unset, the */ + /* point is `off' the curve, i.e., a Bézier control */ + /* point, while it is `on' when set. */ + /* */ + /* Bit~1 is meaningful for `off' points only. If set, */ + /* it indicates a third-order Bézier arc control point; */ + /* and a second-order control point if unset. */ + /* */ + /* contours :: An array of `n_contours' shorts, giving the end */ + /* point of each contour within the outline. For */ + /* example, the first contour is defined by the points */ + /* `0' to `contours[0]', the second one is defined by */ + /* the points `contours[0]+1' to `contours[1]', etc. */ + /* */ + /* flags :: A set of bit flags used to characterize the outline */ + /* and give hints to the scan-converter and hinter on */ + /* how to convert/grid-fit it. See @FT_OUTLINE_FLAGS. */ + /* */ + typedef struct FT_Outline_ + { + short n_contours; /* number of contours in glyph */ + short n_points; /* number of points in the glyph */ + + FT_Vector* points; /* the outline's points */ + char* tags; /* the points flags */ + short* contours; /* the contour end points */ + + int flags; /* outline masks */ + + } FT_Outline; + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_OUTLINE_FLAGS */ + /* */ + /* <Description> */ + /* A list of bit-field constants use for the flags in an outline's */ + /* `flags' field. */ + /* */ + /* <Values> */ + /* FT_OUTLINE_NONE :: */ + /* Value~0 is reserved. */ + /* */ + /* FT_OUTLINE_OWNER :: */ + /* If set, this flag indicates that the outline's field arrays */ + /* (i.e., `points', `flags', and `contours') are `owned' by the */ + /* outline object, and should thus be freed when it is destroyed. */ + /* */ + /* FT_OUTLINE_EVEN_ODD_FILL :: */ + /* By default, outlines are filled using the non-zero winding rule. */ + /* If set to 1, the outline will be filled using the even-odd fill */ + /* rule (only works with the smooth raster). */ + /* */ + /* FT_OUTLINE_REVERSE_FILL :: */ + /* By default, outside contours of an outline are oriented in */ + /* clock-wise direction, as defined in the TrueType specification. */ + /* This flag is set if the outline uses the opposite direction */ + /* (typically for Type~1 fonts). This flag is ignored by the scan */ + /* converter. */ + /* */ + /* FT_OUTLINE_IGNORE_DROPOUTS :: */ + /* By default, the scan converter will try to detect drop-outs in */ + /* an outline and correct the glyph bitmap to ensure consistent */ + /* shape continuity. If set, this flag hints the scan-line */ + /* converter to ignore such cases. */ + /* */ + /* FT_OUTLINE_SMART_DROPOUTS :: */ + /* Select smart dropout control. If unset, use simple dropout */ + /* control. Ignored if @FT_OUTLINE_IGNORE_DROPOUTS is set. */ + /* */ + /* FT_OUTLINE_INCLUDE_STUBS :: */ + /* If set, turn pixels on for `stubs', otherwise exclude them. */ + /* Ignored if @FT_OUTLINE_IGNORE_DROPOUTS is set. */ + /* */ + /* FT_OUTLINE_HIGH_PRECISION :: */ + /* This flag indicates that the scan-line converter should try to */ + /* convert this outline to bitmaps with the highest possible */ + /* quality. It is typically set for small character sizes. Note */ + /* that this is only a hint that might be completely ignored by a */ + /* given scan-converter. */ + /* */ + /* FT_OUTLINE_SINGLE_PASS :: */ + /* This flag is set to force a given scan-converter to only use a */ + /* single pass over the outline to render a bitmap glyph image. */ + /* Normally, it is set for very large character sizes. It is only */ + /* a hint that might be completely ignored by a given */ + /* scan-converter. */ + /* */ + /* <Note> */ + /* Please refer to the description of the `SCANTYPE' instruction in */ + /* the OpenType specification (in file `ttinst1.doc') how simple */ + /* drop-outs, smart drop-outs, and stubs are defined. */ + /* */ +#define FT_OUTLINE_NONE 0x0 +#define FT_OUTLINE_OWNER 0x1 +#define FT_OUTLINE_EVEN_ODD_FILL 0x2 +#define FT_OUTLINE_REVERSE_FILL 0x4 +#define FT_OUTLINE_IGNORE_DROPOUTS 0x8 +#define FT_OUTLINE_SMART_DROPOUTS 0x10 +#define FT_OUTLINE_INCLUDE_STUBS 0x20 + +#define FT_OUTLINE_HIGH_PRECISION 0x100 +#define FT_OUTLINE_SINGLE_PASS 0x200 + + + /************************************************************************* + * + * @enum: + * ft_outline_flags + * + * @description: + * These constants are deprecated. Please use the corresponding + * @FT_OUTLINE_FLAGS values. + * + * @values: + * ft_outline_none :: See @FT_OUTLINE_NONE. + * ft_outline_owner :: See @FT_OUTLINE_OWNER. + * ft_outline_even_odd_fill :: See @FT_OUTLINE_EVEN_ODD_FILL. + * ft_outline_reverse_fill :: See @FT_OUTLINE_REVERSE_FILL. + * ft_outline_ignore_dropouts :: See @FT_OUTLINE_IGNORE_DROPOUTS. + * ft_outline_high_precision :: See @FT_OUTLINE_HIGH_PRECISION. + * ft_outline_single_pass :: See @FT_OUTLINE_SINGLE_PASS. + */ +#define ft_outline_none FT_OUTLINE_NONE +#define ft_outline_owner FT_OUTLINE_OWNER +#define ft_outline_even_odd_fill FT_OUTLINE_EVEN_ODD_FILL +#define ft_outline_reverse_fill FT_OUTLINE_REVERSE_FILL +#define ft_outline_ignore_dropouts FT_OUTLINE_IGNORE_DROPOUTS +#define ft_outline_high_precision FT_OUTLINE_HIGH_PRECISION +#define ft_outline_single_pass FT_OUTLINE_SINGLE_PASS + + /* */ + +#define FT_CURVE_TAG( flag ) ( flag & 3 ) + +#define FT_CURVE_TAG_ON 1 +#define FT_CURVE_TAG_CONIC 0 +#define FT_CURVE_TAG_CUBIC 2 + +#define FT_CURVE_TAG_TOUCH_X 8 /* reserved for the TrueType hinter */ +#define FT_CURVE_TAG_TOUCH_Y 16 /* reserved for the TrueType hinter */ + +#define FT_CURVE_TAG_TOUCH_BOTH ( FT_CURVE_TAG_TOUCH_X | \ + FT_CURVE_TAG_TOUCH_Y ) + +#define FT_Curve_Tag_On FT_CURVE_TAG_ON +#define FT_Curve_Tag_Conic FT_CURVE_TAG_CONIC +#define FT_Curve_Tag_Cubic FT_CURVE_TAG_CUBIC +#define FT_Curve_Tag_Touch_X FT_CURVE_TAG_TOUCH_X +#define FT_Curve_Tag_Touch_Y FT_CURVE_TAG_TOUCH_Y + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Outline_MoveToFunc */ + /* */ + /* <Description> */ + /* A function pointer type used to describe the signature of a `move */ + /* to' function during outline walking/decomposition. */ + /* */ + /* A `move to' is emitted to start a new contour in an outline. */ + /* */ + /* <Input> */ + /* to :: A pointer to the target point of the `move to'. */ + /* */ + /* user :: A typeless pointer which is passed from the caller of the */ + /* decomposition function. */ + /* */ + /* <Return> */ + /* Error code. 0~means success. */ + /* */ + typedef int + (*FT_Outline_MoveToFunc)( const FT_Vector* to, + void* user ); + +#define FT_Outline_MoveTo_Func FT_Outline_MoveToFunc + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Outline_LineToFunc */ + /* */ + /* <Description> */ + /* A function pointer type used to describe the signature of a `line */ + /* to' function during outline walking/decomposition. */ + /* */ + /* A `line to' is emitted to indicate a segment in the outline. */ + /* */ + /* <Input> */ + /* to :: A pointer to the target point of the `line to'. */ + /* */ + /* user :: A typeless pointer which is passed from the caller of the */ + /* decomposition function. */ + /* */ + /* <Return> */ + /* Error code. 0~means success. */ + /* */ + typedef int + (*FT_Outline_LineToFunc)( const FT_Vector* to, + void* user ); + +#define FT_Outline_LineTo_Func FT_Outline_LineToFunc + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Outline_ConicToFunc */ + /* */ + /* <Description> */ + /* A function pointer type use to describe the signature of a `conic */ + /* to' function during outline walking/decomposition. */ + /* */ + /* A `conic to' is emitted to indicate a second-order Bézier arc in */ + /* the outline. */ + /* */ + /* <Input> */ + /* control :: An intermediate control point between the last position */ + /* and the new target in `to'. */ + /* */ + /* to :: A pointer to the target end point of the conic arc. */ + /* */ + /* user :: A typeless pointer which is passed from the caller of */ + /* the decomposition function. */ + /* */ + /* <Return> */ + /* Error code. 0~means success. */ + /* */ + typedef int + (*FT_Outline_ConicToFunc)( const FT_Vector* control, + const FT_Vector* to, + void* user ); + +#define FT_Outline_ConicTo_Func FT_Outline_ConicToFunc + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Outline_CubicToFunc */ + /* */ + /* <Description> */ + /* A function pointer type used to describe the signature of a `cubic */ + /* to' function during outline walking/decomposition. */ + /* */ + /* A `cubic to' is emitted to indicate a third-order Bézier arc. */ + /* */ + /* <Input> */ + /* control1 :: A pointer to the first Bézier control point. */ + /* */ + /* control2 :: A pointer to the second Bézier control point. */ + /* */ + /* to :: A pointer to the target end point. */ + /* */ + /* user :: A typeless pointer which is passed from the caller of */ + /* the decomposition function. */ + /* */ + /* <Return> */ + /* Error code. 0~means success. */ + /* */ + typedef int + (*FT_Outline_CubicToFunc)( const FT_Vector* control1, + const FT_Vector* control2, + const FT_Vector* to, + void* user ); + +#define FT_Outline_CubicTo_Func FT_Outline_CubicToFunc + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Outline_Funcs */ + /* */ + /* <Description> */ + /* A structure to hold various function pointers used during outline */ + /* decomposition in order to emit segments, conic, and cubic Béziers, */ + /* as well as `move to' and `close to' operations. */ + /* */ + /* <Fields> */ + /* move_to :: The `move to' emitter. */ + /* */ + /* line_to :: The segment emitter. */ + /* */ + /* conic_to :: The second-order Bézier arc emitter. */ + /* */ + /* cubic_to :: The third-order Bézier arc emitter. */ + /* */ + /* shift :: The shift that is applied to coordinates before they */ + /* are sent to the emitter. */ + /* */ + /* delta :: The delta that is applied to coordinates before they */ + /* are sent to the emitter, but after the shift. */ + /* */ + /* <Note> */ + /* The point coordinates sent to the emitters are the transformed */ + /* version of the original coordinates (this is important for high */ + /* accuracy during scan-conversion). The transformation is simple: */ + /* */ + /* { */ + /* x' = (x << shift) - delta */ + /* y' = (x << shift) - delta */ + /* } */ + /* */ + /* Set the value of `shift' and `delta' to~0 to get the original */ + /* point coordinates. */ + /* */ + typedef struct FT_Outline_Funcs_ + { + FT_Outline_MoveToFunc move_to; + FT_Outline_LineToFunc line_to; + FT_Outline_ConicToFunc conic_to; + FT_Outline_CubicToFunc cubic_to; + + int shift; + FT_Pos delta; + + } FT_Outline_Funcs; + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* basic_types */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Macro> */ + /* FT_IMAGE_TAG */ + /* */ + /* <Description> */ + /* This macro converts four-letter tags to an unsigned long type. */ + /* */ + /* <Note> */ + /* Since many 16-bit compilers don't like 32-bit enumerations, you */ + /* should redefine this macro in case of problems to something like */ + /* this: */ + /* */ + /* { */ + /* #define FT_IMAGE_TAG( value, _x1, _x2, _x3, _x4 ) value */ + /* } */ + /* */ + /* to get a simple enumeration without assigning special numbers. */ + /* */ +#ifndef FT_IMAGE_TAG +#define FT_IMAGE_TAG( value, _x1, _x2, _x3, _x4 ) \ + value = ( ( (unsigned long)_x1 << 24 ) | \ + ( (unsigned long)_x2 << 16 ) | \ + ( (unsigned long)_x3 << 8 ) | \ + (unsigned long)_x4 ) +#endif /* FT_IMAGE_TAG */ + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_Glyph_Format */ + /* */ + /* <Description> */ + /* An enumeration type used to describe the format of a given glyph */ + /* image. Note that this version of FreeType only supports two image */ + /* formats, even though future font drivers will be able to register */ + /* their own format. */ + /* */ + /* <Values> */ + /* FT_GLYPH_FORMAT_NONE :: */ + /* The value~0 is reserved. */ + /* */ + /* FT_GLYPH_FORMAT_COMPOSITE :: */ + /* The glyph image is a composite of several other images. This */ + /* format is _only_ used with @FT_LOAD_NO_RECURSE, and is used to */ + /* report compound glyphs (like accented characters). */ + /* */ + /* FT_GLYPH_FORMAT_BITMAP :: */ + /* The glyph image is a bitmap, and can be described as an */ + /* @FT_Bitmap. You generally need to access the `bitmap' field of */ + /* the @FT_GlyphSlotRec structure to read it. */ + /* */ + /* FT_GLYPH_FORMAT_OUTLINE :: */ + /* The glyph image is a vectorial outline made of line segments */ + /* and Bézier arcs; it can be described as an @FT_Outline; you */ + /* generally want to access the `outline' field of the */ + /* @FT_GlyphSlotRec structure to read it. */ + /* */ + /* FT_GLYPH_FORMAT_PLOTTER :: */ + /* The glyph image is a vectorial path with no inside and outside */ + /* contours. Some Type~1 fonts, like those in the Hershey family, */ + /* contain glyphs in this format. These are described as */ + /* @FT_Outline, but FreeType isn't currently capable of rendering */ + /* them correctly. */ + /* */ + typedef enum FT_Glyph_Format_ + { + FT_IMAGE_TAG( FT_GLYPH_FORMAT_NONE, 0, 0, 0, 0 ), + + FT_IMAGE_TAG( FT_GLYPH_FORMAT_COMPOSITE, 'c', 'o', 'm', 'p' ), + FT_IMAGE_TAG( FT_GLYPH_FORMAT_BITMAP, 'b', 'i', 't', 's' ), + FT_IMAGE_TAG( FT_GLYPH_FORMAT_OUTLINE, 'o', 'u', 't', 'l' ), + FT_IMAGE_TAG( FT_GLYPH_FORMAT_PLOTTER, 'p', 'l', 'o', 't' ) + + } FT_Glyph_Format; + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* ft_glyph_format_xxx */ + /* */ + /* <Description> */ + /* A list of deprecated constants. Use the corresponding */ + /* @FT_Glyph_Format values instead. */ + /* */ + /* <Values> */ + /* ft_glyph_format_none :: See @FT_GLYPH_FORMAT_NONE. */ + /* ft_glyph_format_composite :: See @FT_GLYPH_FORMAT_COMPOSITE. */ + /* ft_glyph_format_bitmap :: See @FT_GLYPH_FORMAT_BITMAP. */ + /* ft_glyph_format_outline :: See @FT_GLYPH_FORMAT_OUTLINE. */ + /* ft_glyph_format_plotter :: See @FT_GLYPH_FORMAT_PLOTTER. */ + /* */ +#define ft_glyph_format_none FT_GLYPH_FORMAT_NONE +#define ft_glyph_format_composite FT_GLYPH_FORMAT_COMPOSITE +#define ft_glyph_format_bitmap FT_GLYPH_FORMAT_BITMAP +#define ft_glyph_format_outline FT_GLYPH_FORMAT_OUTLINE +#define ft_glyph_format_plotter FT_GLYPH_FORMAT_PLOTTER + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** R A S T E R D E F I N I T I O N S *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* A raster is a scan converter, in charge of rendering an outline into */ + /* a a bitmap. This section contains the public API for rasters. */ + /* */ + /* Note that in FreeType 2, all rasters are now encapsulated within */ + /* specific modules called `renderers'. See `freetype/ftrender.h' for */ + /* more details on renderers. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* raster */ + /* */ + /* <Title> */ + /* Scanline Converter */ + /* */ + /* <Abstract> */ + /* How vectorial outlines are converted into bitmaps and pixmaps. */ + /* */ + /* <Description> */ + /* This section contains technical definitions. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Raster */ + /* */ + /* <Description> */ + /* A handle (pointer) to a raster object. Each object can be used */ + /* independently to convert an outline into a bitmap or pixmap. */ + /* */ + typedef struct FT_RasterRec_* FT_Raster; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Span */ + /* */ + /* <Description> */ + /* A structure used to model a single span of gray (or black) pixels */ + /* when rendering a monochrome or anti-aliased bitmap. */ + /* */ + /* <Fields> */ + /* x :: The span's horizontal start position. */ + /* */ + /* len :: The span's length in pixels. */ + /* */ + /* coverage :: The span color/coverage, ranging from 0 (background) */ + /* to 255 (foreground). Only used for anti-aliased */ + /* rendering. */ + /* */ + /* <Note> */ + /* This structure is used by the span drawing callback type named */ + /* @FT_SpanFunc which takes the y~coordinate of the span as a */ + /* a parameter. */ + /* */ + /* The coverage value is always between 0 and 255. If you want less */ + /* gray values, the callback function has to reduce them. */ + /* */ + typedef struct FT_Span_ + { + short x; + unsigned short len; + unsigned char coverage; + + } FT_Span; + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_SpanFunc */ + /* */ + /* <Description> */ + /* A function used as a call-back by the anti-aliased renderer in */ + /* order to let client applications draw themselves the gray pixel */ + /* spans on each scan line. */ + /* */ + /* <Input> */ + /* y :: The scanline's y~coordinate. */ + /* */ + /* count :: The number of spans to draw on this scanline. */ + /* */ + /* spans :: A table of `count' spans to draw on the scanline. */ + /* */ + /* user :: User-supplied data that is passed to the callback. */ + /* */ + /* <Note> */ + /* This callback allows client applications to directly render the */ + /* gray spans of the anti-aliased bitmap to any kind of surfaces. */ + /* */ + /* This can be used to write anti-aliased outlines directly to a */ + /* given background bitmap, and even perform translucency. */ + /* */ + /* Note that the `count' field cannot be greater than a fixed value */ + /* defined by the `FT_MAX_GRAY_SPANS' configuration macro in */ + /* `ftoption.h'. By default, this value is set to~32, which means */ + /* that if there are more than 32~spans on a given scanline, the */ + /* callback is called several times with the same `y' parameter in */ + /* order to draw all callbacks. */ + /* */ + /* Otherwise, the callback is only called once per scan-line, and */ + /* only for those scanlines that do have `gray' pixels on them. */ + /* */ + typedef void + (*FT_SpanFunc)( int y, + int count, + const FT_Span* spans, + void* user ); + +#define FT_Raster_Span_Func FT_SpanFunc + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Raster_BitTest_Func */ + /* */ + /* <Description> */ + /* THIS TYPE IS DEPRECATED. DO NOT USE IT. */ + /* */ + /* A function used as a call-back by the monochrome scan-converter */ + /* to test whether a given target pixel is already set to the drawing */ + /* `color'. These tests are crucial to implement drop-out control */ + /* per-se the TrueType spec. */ + /* */ + /* <Input> */ + /* y :: The pixel's y~coordinate. */ + /* */ + /* x :: The pixel's x~coordinate. */ + /* */ + /* user :: User-supplied data that is passed to the callback. */ + /* */ + /* <Return> */ + /* 1~if the pixel is `set', 0~otherwise. */ + /* */ + typedef int + (*FT_Raster_BitTest_Func)( int y, + int x, + void* user ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Raster_BitSet_Func */ + /* */ + /* <Description> */ + /* THIS TYPE IS DEPRECATED. DO NOT USE IT. */ + /* */ + /* A function used as a call-back by the monochrome scan-converter */ + /* to set an individual target pixel. This is crucial to implement */ + /* drop-out control according to the TrueType specification. */ + /* */ + /* <Input> */ + /* y :: The pixel's y~coordinate. */ + /* */ + /* x :: The pixel's x~coordinate. */ + /* */ + /* user :: User-supplied data that is passed to the callback. */ + /* */ + /* <Return> */ + /* 1~if the pixel is `set', 0~otherwise. */ + /* */ + typedef void + (*FT_Raster_BitSet_Func)( int y, + int x, + void* user ); + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_RASTER_FLAG_XXX */ + /* */ + /* <Description> */ + /* A list of bit flag constants as used in the `flags' field of a */ + /* @FT_Raster_Params structure. */ + /* */ + /* <Values> */ + /* FT_RASTER_FLAG_DEFAULT :: This value is 0. */ + /* */ + /* FT_RASTER_FLAG_AA :: This flag is set to indicate that an */ + /* anti-aliased glyph image should be */ + /* generated. Otherwise, it will be */ + /* monochrome (1-bit). */ + /* */ + /* FT_RASTER_FLAG_DIRECT :: This flag is set to indicate direct */ + /* rendering. In this mode, client */ + /* applications must provide their own span */ + /* callback. This lets them directly */ + /* draw or compose over an existing bitmap. */ + /* If this bit is not set, the target */ + /* pixmap's buffer _must_ be zeroed before */ + /* rendering. */ + /* */ + /* Note that for now, direct rendering is */ + /* only possible with anti-aliased glyphs. */ + /* */ + /* FT_RASTER_FLAG_CLIP :: This flag is only used in direct */ + /* rendering mode. If set, the output will */ + /* be clipped to a box specified in the */ + /* `clip_box' field of the */ + /* @FT_Raster_Params structure. */ + /* */ + /* Note that by default, the glyph bitmap */ + /* is clipped to the target pixmap, except */ + /* in direct rendering mode where all spans */ + /* are generated if no clipping box is set. */ + /* */ +#define FT_RASTER_FLAG_DEFAULT 0x0 +#define FT_RASTER_FLAG_AA 0x1 +#define FT_RASTER_FLAG_DIRECT 0x2 +#define FT_RASTER_FLAG_CLIP 0x4 + + /* deprecated */ +#define ft_raster_flag_default FT_RASTER_FLAG_DEFAULT +#define ft_raster_flag_aa FT_RASTER_FLAG_AA +#define ft_raster_flag_direct FT_RASTER_FLAG_DIRECT +#define ft_raster_flag_clip FT_RASTER_FLAG_CLIP + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Raster_Params */ + /* */ + /* <Description> */ + /* A structure to hold the arguments used by a raster's render */ + /* function. */ + /* */ + /* <Fields> */ + /* target :: The target bitmap. */ + /* */ + /* source :: A pointer to the source glyph image (e.g., an */ + /* @FT_Outline). */ + /* */ + /* flags :: The rendering flags. */ + /* */ + /* gray_spans :: The gray span drawing callback. */ + /* */ + /* black_spans :: The black span drawing callback. */ + /* */ + /* bit_test :: The bit test callback. UNIMPLEMENTED! */ + /* */ + /* bit_set :: The bit set callback. UNIMPLEMENTED! */ + /* */ + /* user :: User-supplied data that is passed to each drawing */ + /* callback. */ + /* */ + /* clip_box :: An optional clipping box. It is only used in */ + /* direct rendering mode. Note that coordinates here */ + /* should be expressed in _integer_ pixels (and not in */ + /* 26.6 fixed-point units). */ + /* */ + /* <Note> */ + /* An anti-aliased glyph bitmap is drawn if the @FT_RASTER_FLAG_AA */ + /* bit flag is set in the `flags' field, otherwise a monochrome */ + /* bitmap is generated. */ + /* */ + /* If the @FT_RASTER_FLAG_DIRECT bit flag is set in `flags', the */ + /* raster will call the `gray_spans' callback to draw gray pixel */ + /* spans, in the case of an aa glyph bitmap, it will call */ + /* `black_spans', and `bit_test' and `bit_set' in the case of a */ + /* monochrome bitmap. This allows direct composition over a */ + /* pre-existing bitmap through user-provided callbacks to perform the */ + /* span drawing/composition. */ + /* */ + /* Note that the `bit_test' and `bit_set' callbacks are required when */ + /* rendering a monochrome bitmap, as they are crucial to implement */ + /* correct drop-out control as defined in the TrueType specification. */ + /* */ + typedef struct FT_Raster_Params_ + { + const FT_Bitmap* target; + const void* source; + int flags; + FT_SpanFunc gray_spans; + FT_SpanFunc black_spans; + FT_Raster_BitTest_Func bit_test; /* doesn't work! */ + FT_Raster_BitSet_Func bit_set; /* doesn't work! */ + void* user; + FT_BBox clip_box; + + } FT_Raster_Params; + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Raster_NewFunc */ + /* */ + /* <Description> */ + /* A function used to create a new raster object. */ + /* */ + /* <Input> */ + /* memory :: A handle to the memory allocator. */ + /* */ + /* <Output> */ + /* raster :: A handle to the new raster object. */ + /* */ + /* <Return> */ + /* Error code. 0~means success. */ + /* */ + /* <Note> */ + /* The `memory' parameter is a typeless pointer in order to avoid */ + /* un-wanted dependencies on the rest of the FreeType code. In */ + /* practice, it is an @FT_Memory object, i.e., a handle to the */ + /* standard FreeType memory allocator. However, this field can be */ + /* completely ignored by a given raster implementation. */ + /* */ + typedef int + (*FT_Raster_NewFunc)( void* memory, + FT_Raster* raster ); + +#define FT_Raster_New_Func FT_Raster_NewFunc + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Raster_DoneFunc */ + /* */ + /* <Description> */ + /* A function used to destroy a given raster object. */ + /* */ + /* <Input> */ + /* raster :: A handle to the raster object. */ + /* */ + typedef void + (*FT_Raster_DoneFunc)( FT_Raster raster ); + +#define FT_Raster_Done_Func FT_Raster_DoneFunc + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Raster_ResetFunc */ + /* */ + /* <Description> */ + /* FreeType provides an area of memory called the `render pool', */ + /* available to all registered rasters. This pool can be freely used */ + /* during a given scan-conversion but is shared by all rasters. Its */ + /* content is thus transient. */ + /* */ + /* This function is called each time the render pool changes, or just */ + /* after a new raster object is created. */ + /* */ + /* <Input> */ + /* raster :: A handle to the new raster object. */ + /* */ + /* pool_base :: The address in memory of the render pool. */ + /* */ + /* pool_size :: The size in bytes of the render pool. */ + /* */ + /* <Note> */ + /* Rasters can ignore the render pool and rely on dynamic memory */ + /* allocation if they want to (a handle to the memory allocator is */ + /* passed to the raster constructor). However, this is not */ + /* recommended for efficiency purposes. */ + /* */ + typedef void + (*FT_Raster_ResetFunc)( FT_Raster raster, + unsigned char* pool_base, + unsigned long pool_size ); + +#define FT_Raster_Reset_Func FT_Raster_ResetFunc + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Raster_SetModeFunc */ + /* */ + /* <Description> */ + /* This function is a generic facility to change modes or attributes */ + /* in a given raster. This can be used for debugging purposes, or */ + /* simply to allow implementation-specific `features' in a given */ + /* raster module. */ + /* */ + /* <Input> */ + /* raster :: A handle to the new raster object. */ + /* */ + /* mode :: A 4-byte tag used to name the mode or property. */ + /* */ + /* args :: A pointer to the new mode/property to use. */ + /* */ + typedef int + (*FT_Raster_SetModeFunc)( FT_Raster raster, + unsigned long mode, + void* args ); + +#define FT_Raster_Set_Mode_Func FT_Raster_SetModeFunc + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Raster_RenderFunc */ + /* */ + /* <Description> */ + /* Invoke a given raster to scan-convert a given glyph image into a */ + /* target bitmap. */ + /* */ + /* <Input> */ + /* raster :: A handle to the raster object. */ + /* */ + /* params :: A pointer to an @FT_Raster_Params structure used to */ + /* store the rendering parameters. */ + /* */ + /* <Return> */ + /* Error code. 0~means success. */ + /* */ + /* <Note> */ + /* The exact format of the source image depends on the raster's glyph */ + /* format defined in its @FT_Raster_Funcs structure. It can be an */ + /* @FT_Outline or anything else in order to support a large array of */ + /* glyph formats. */ + /* */ + /* Note also that the render function can fail and return a */ + /* `FT_Err_Unimplemented_Feature' error code if the raster used does */ + /* not support direct composition. */ + /* */ + /* XXX: For now, the standard raster doesn't support direct */ + /* composition but this should change for the final release (see */ + /* the files `demos/src/ftgrays.c' and `demos/src/ftgrays2.c' */ + /* for examples of distinct implementations which support direct */ + /* composition). */ + /* */ + typedef int + (*FT_Raster_RenderFunc)( FT_Raster raster, + const FT_Raster_Params* params ); + +#define FT_Raster_Render_Func FT_Raster_RenderFunc + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Raster_Funcs */ + /* */ + /* <Description> */ + /* A structure used to describe a given raster class to the library. */ + /* */ + /* <Fields> */ + /* glyph_format :: The supported glyph format for this raster. */ + /* */ + /* raster_new :: The raster constructor. */ + /* */ + /* raster_reset :: Used to reset the render pool within the raster. */ + /* */ + /* raster_render :: A function to render a glyph into a given bitmap. */ + /* */ + /* raster_done :: The raster destructor. */ + /* */ + typedef struct FT_Raster_Funcs_ + { + FT_Glyph_Format glyph_format; + FT_Raster_NewFunc raster_new; + FT_Raster_ResetFunc raster_reset; + FT_Raster_SetModeFunc raster_set_mode; + FT_Raster_RenderFunc raster_render; + FT_Raster_DoneFunc raster_done; + + } FT_Raster_Funcs; + + + /* */ + + +FT_END_HEADER + +#endif /* __FTIMAGE_H__ */ + + +/* END */ + + +/* Local Variables: */ +/* coding: utf-8 */ +/* End: */ diff --git a/portlibs/include/freetype/ftincrem.h b/portlibs/include/freetype/ftincrem.h new file mode 100644 index 00000000..96abedea --- /dev/null +++ b/portlibs/include/freetype/ftincrem.h @@ -0,0 +1,349 @@ +/***************************************************************************/ +/* */ +/* ftincrem.h */ +/* */ +/* FreeType incremental loading (specification). */ +/* */ +/* Copyright 2002, 2003, 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTINCREM_H__ +#define __FTINCREM_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + /*************************************************************************** + * + * @section: + * incremental + * + * @title: + * Incremental Loading + * + * @abstract: + * Custom Glyph Loading. + * + * @description: + * This section contains various functions used to perform so-called + * `incremental' glyph loading. This is a mode where all glyphs loaded + * from a given @FT_Face are provided by the client application, + * + * Apart from that, all other tables are loaded normally from the font + * file. This mode is useful when FreeType is used within another + * engine, e.g., a PostScript Imaging Processor. + * + * To enable this mode, you must use @FT_Open_Face, passing an + * @FT_Parameter with the @FT_PARAM_TAG_INCREMENTAL tag and an + * @FT_Incremental_Interface value. See the comments for + * @FT_Incremental_InterfaceRec for an example. + * + */ + + + /*************************************************************************** + * + * @type: + * FT_Incremental + * + * @description: + * An opaque type describing a user-provided object used to implement + * `incremental' glyph loading within FreeType. This is used to support + * embedded fonts in certain environments (e.g., PostScript interpreters), + * where the glyph data isn't in the font file, or must be overridden by + * different values. + * + * @note: + * It is up to client applications to create and implement @FT_Incremental + * objects, as long as they provide implementations for the methods + * @FT_Incremental_GetGlyphDataFunc, @FT_Incremental_FreeGlyphDataFunc + * and @FT_Incremental_GetGlyphMetricsFunc. + * + * See the description of @FT_Incremental_InterfaceRec to understand how + * to use incremental objects with FreeType. + * + */ + typedef struct FT_IncrementalRec_* FT_Incremental; + + + /*************************************************************************** + * + * @struct: + * FT_Incremental_MetricsRec + * + * @description: + * A small structure used to contain the basic glyph metrics returned + * by the @FT_Incremental_GetGlyphMetricsFunc method. + * + * @fields: + * bearing_x :: + * Left bearing, in font units. + * + * bearing_y :: + * Top bearing, in font units. + * + * advance :: + * Glyph advance, in font units. + * + * @note: + * These correspond to horizontal or vertical metrics depending on the + * value of the `vertical' argument to the function + * @FT_Incremental_GetGlyphMetricsFunc. + * + */ + typedef struct FT_Incremental_MetricsRec_ + { + FT_Long bearing_x; + FT_Long bearing_y; + FT_Long advance; + + } FT_Incremental_MetricsRec; + + + /*************************************************************************** + * + * @struct: + * FT_Incremental_Metrics + * + * @description: + * A handle to an @FT_Incremental_MetricsRec structure. + * + */ + typedef struct FT_Incremental_MetricsRec_* FT_Incremental_Metrics; + + + /*************************************************************************** + * + * @type: + * FT_Incremental_GetGlyphDataFunc + * + * @description: + * A function called by FreeType to access a given glyph's data bytes + * during @FT_Load_Glyph or @FT_Load_Char if incremental loading is + * enabled. + * + * Note that the format of the glyph's data bytes depends on the font + * file format. For TrueType, it must correspond to the raw bytes within + * the `glyf' table. For PostScript formats, it must correspond to the + * *unencrypted* charstring bytes, without any `lenIV' header. It is + * undefined for any other format. + * + * @input: + * incremental :: + * Handle to an opaque @FT_Incremental handle provided by the client + * application. + * + * glyph_index :: + * Index of relevant glyph. + * + * @output: + * adata :: + * A structure describing the returned glyph data bytes (which will be + * accessed as a read-only byte block). + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * If this function returns successfully the method + * @FT_Incremental_FreeGlyphDataFunc will be called later to release + * the data bytes. + * + * Nested calls to @FT_Incremental_GetGlyphDataFunc can happen for + * compound glyphs. + * + */ + typedef FT_Error + (*FT_Incremental_GetGlyphDataFunc)( FT_Incremental incremental, + FT_UInt glyph_index, + FT_Data* adata ); + + + /*************************************************************************** + * + * @type: + * FT_Incremental_FreeGlyphDataFunc + * + * @description: + * A function used to release the glyph data bytes returned by a + * successful call to @FT_Incremental_GetGlyphDataFunc. + * + * @input: + * incremental :: + * A handle to an opaque @FT_Incremental handle provided by the client + * application. + * + * data :: + * A structure describing the glyph data bytes (which will be accessed + * as a read-only byte block). + * + */ + typedef void + (*FT_Incremental_FreeGlyphDataFunc)( FT_Incremental incremental, + FT_Data* data ); + + + /*************************************************************************** + * + * @type: + * FT_Incremental_GetGlyphMetricsFunc + * + * @description: + * A function used to retrieve the basic metrics of a given glyph index + * before accessing its data. This is necessary because, in certain + * formats like TrueType, the metrics are stored in a different place from + * the glyph images proper. + * + * @input: + * incremental :: + * A handle to an opaque @FT_Incremental handle provided by the client + * application. + * + * glyph_index :: + * Index of relevant glyph. + * + * vertical :: + * If true, return vertical metrics. + * + * ametrics :: + * This parameter is used for both input and output. + * The original glyph metrics, if any, in font units. If metrics are + * not available all the values must be set to zero. + * + * @output: + * ametrics :: + * The replacement glyph metrics in font units. + * + */ + typedef FT_Error + (*FT_Incremental_GetGlyphMetricsFunc) + ( FT_Incremental incremental, + FT_UInt glyph_index, + FT_Bool vertical, + FT_Incremental_MetricsRec *ametrics ); + + + /************************************************************************** + * + * @struct: + * FT_Incremental_FuncsRec + * + * @description: + * A table of functions for accessing fonts that load data + * incrementally. Used in @FT_Incremental_InterfaceRec. + * + * @fields: + * get_glyph_data :: + * The function to get glyph data. Must not be null. + * + * free_glyph_data :: + * The function to release glyph data. Must not be null. + * + * get_glyph_metrics :: + * The function to get glyph metrics. May be null if the font does + * not provide overriding glyph metrics. + * + */ + typedef struct FT_Incremental_FuncsRec_ + { + FT_Incremental_GetGlyphDataFunc get_glyph_data; + FT_Incremental_FreeGlyphDataFunc free_glyph_data; + FT_Incremental_GetGlyphMetricsFunc get_glyph_metrics; + + } FT_Incremental_FuncsRec; + + + /*************************************************************************** + * + * @struct: + * FT_Incremental_InterfaceRec + * + * @description: + * A structure to be used with @FT_Open_Face to indicate that the user + * wants to support incremental glyph loading. You should use it with + * @FT_PARAM_TAG_INCREMENTAL as in the following example: + * + * { + * FT_Incremental_InterfaceRec inc_int; + * FT_Parameter parameter; + * FT_Open_Args open_args; + * + * + * // set up incremental descriptor + * inc_int.funcs = my_funcs; + * inc_int.object = my_object; + * + * // set up optional parameter + * parameter.tag = FT_PARAM_TAG_INCREMENTAL; + * parameter.data = &inc_int; + * + * // set up FT_Open_Args structure + * open_args.flags = FT_OPEN_PATHNAME | FT_OPEN_PARAMS; + * open_args.pathname = my_font_pathname; + * open_args.num_params = 1; + * open_args.params = ¶meter; // we use one optional argument + * + * // open the font + * error = FT_Open_Face( library, &open_args, index, &face ); + * ... + * } + * + */ + typedef struct FT_Incremental_InterfaceRec_ + { + const FT_Incremental_FuncsRec* funcs; + FT_Incremental object; + + } FT_Incremental_InterfaceRec; + + + /*************************************************************************** + * + * @type: + * FT_Incremental_Interface + * + * @description: + * A pointer to an @FT_Incremental_InterfaceRec structure. + * + */ + typedef FT_Incremental_InterfaceRec* FT_Incremental_Interface; + + + /*************************************************************************** + * + * @constant: + * FT_PARAM_TAG_INCREMENTAL + * + * @description: + * A constant used as the tag of @FT_Parameter structures to indicate + * an incremental loading object to be used by FreeType. + * + */ +#define FT_PARAM_TAG_INCREMENTAL FT_MAKE_TAG( 'i', 'n', 'c', 'r' ) + + /* */ + +FT_END_HEADER + +#endif /* __FTINCREM_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftlcdfil.h b/portlibs/include/freetype/ftlcdfil.h new file mode 100644 index 00000000..c6201b38 --- /dev/null +++ b/portlibs/include/freetype/ftlcdfil.h @@ -0,0 +1,172 @@ +/***************************************************************************/ +/* */ +/* ftlcdfil.h */ +/* */ +/* FreeType API for color filtering of subpixel bitmap glyphs */ +/* (specification). */ +/* */ +/* Copyright 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FT_LCD_FILTER_H__ +#define __FT_LCD_FILTER_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + /*************************************************************************** + * + * @section: + * lcd_filtering + * + * @title: + * LCD Filtering + * + * @abstract: + * Reduce color fringes of LCD-optimized bitmaps. + * + * @description: + * The @FT_Library_SetLcdFilter API can be used to specify a low-pass + * filter which is then applied to LCD-optimized bitmaps generated + * through @FT_Render_Glyph. This is useful to reduce color fringes + * which would occur with unfiltered rendering. + * + * Note that no filter is active by default, and that this function is + * *not* implemented in default builds of the library. You need to + * #define FT_CONFIG_OPTION_SUBPIXEL_RENDERING in your `ftoption.h' file + * in order to activate it. + */ + + + /**************************************************************************** + * + * @func: + * FT_LcdFilter + * + * @description: + * A list of values to identify various types of LCD filters. + * + * @values: + * FT_LCD_FILTER_NONE :: + * Do not perform filtering. When used with subpixel rendering, this + * results in sometimes severe color fringes. + * + * FT_LCD_FILTER_DEFAULT :: + * The default filter reduces color fringes considerably, at the cost + * of a slight blurriness in the output. + * + * FT_LCD_FILTER_LIGHT :: + * The light filter is a variant that produces less blurriness at the + * cost of slightly more color fringes than the default one. It might + * be better, depending on taste, your monitor, or your personal vision. + * + * FT_LCD_FILTER_LEGACY :: + * This filter corresponds to the original libXft color filter. It + * provides high contrast output but can exhibit really bad color + * fringes if glyphs are not extremely well hinted to the pixel grid. + * In other words, it only works well if the TrueType bytecode + * interpreter is enabled *and* high-quality hinted fonts are used. + * + * This filter is only provided for comparison purposes, and might be + * disabled or stay unsupported in the future. + * + * @since: + * 2.3.0 + */ + typedef enum FT_LcdFilter_ + { + FT_LCD_FILTER_NONE = 0, + FT_LCD_FILTER_DEFAULT = 1, + FT_LCD_FILTER_LIGHT = 2, + FT_LCD_FILTER_LEGACY = 16, + + FT_LCD_FILTER_MAX /* do not remove */ + + } FT_LcdFilter; + + + /************************************************************************** + * + * @func: + * FT_Library_SetLcdFilter + * + * @description: + * This function is used to apply color filtering to LCD decimated + * bitmaps, like the ones used when calling @FT_Render_Glyph with + * @FT_RENDER_MODE_LCD or @FT_RENDER_MODE_LCD_V. + * + * @input: + * library :: + * A handle to the target library instance. + * + * filter :: + * The filter type. + * + * You can use @FT_LCD_FILTER_NONE here to disable this feature, or + * @FT_LCD_FILTER_DEFAULT to use a default filter that should work + * well on most LCD screens. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * This feature is always disabled by default. Clients must make an + * explicit call to this function with a `filter' value other than + * @FT_LCD_FILTER_NONE in order to enable it. + * + * Due to *PATENTS* covering subpixel rendering, this function doesn't + * do anything except returning `FT_Err_Unimplemented_Feature' if the + * configuration macro FT_CONFIG_OPTION_SUBPIXEL_RENDERING is not + * defined in your build of the library, which should correspond to all + * default builds of FreeType. + * + * The filter affects glyph bitmaps rendered through @FT_Render_Glyph, + * @FT_Outline_Get_Bitmap, @FT_Load_Glyph, and @FT_Load_Char. + * + * It does _not_ affect the output of @FT_Outline_Render and + * @FT_Outline_Get_Bitmap. + * + * If this feature is activated, the dimensions of LCD glyph bitmaps are + * either larger or taller than the dimensions of the corresponding + * outline with regards to the pixel grid. For example, for + * @FT_RENDER_MODE_LCD, the filter adds up to 3~pixels to the left, and + * up to 3~pixels to the right. + * + * The bitmap offset values are adjusted correctly, so clients shouldn't + * need to modify their layout and glyph positioning code when enabling + * the filter. + * + * @since: + * 2.3.0 + */ + FT_EXPORT( FT_Error ) + FT_Library_SetLcdFilter( FT_Library library, + FT_LcdFilter filter ); + + /* */ + + +FT_END_HEADER + +#endif /* __FT_LCD_FILTER_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftlist.h b/portlibs/include/freetype/ftlist.h new file mode 100644 index 00000000..93b05fc0 --- /dev/null +++ b/portlibs/include/freetype/ftlist.h @@ -0,0 +1,273 @@ +/***************************************************************************/ +/* */ +/* ftlist.h */ +/* */ +/* Generic list support for FreeType (specification). */ +/* */ +/* Copyright 1996-2001, 2003, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This file implements functions relative to list processing. Its */ + /* data structures are defined in `freetype.h'. */ + /* */ + /*************************************************************************/ + + +#ifndef __FTLIST_H__ +#define __FTLIST_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* list_processing */ + /* */ + /* <Title> */ + /* List Processing */ + /* */ + /* <Abstract> */ + /* Simple management of lists. */ + /* */ + /* <Description> */ + /* This section contains various definitions related to list */ + /* processing using doubly-linked nodes. */ + /* */ + /* <Order> */ + /* FT_List */ + /* FT_ListNode */ + /* FT_ListRec */ + /* FT_ListNodeRec */ + /* */ + /* FT_List_Add */ + /* FT_List_Insert */ + /* FT_List_Find */ + /* FT_List_Remove */ + /* FT_List_Up */ + /* FT_List_Iterate */ + /* FT_List_Iterator */ + /* FT_List_Finalize */ + /* FT_List_Destructor */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_List_Find */ + /* */ + /* <Description> */ + /* Find the list node for a given listed object. */ + /* */ + /* <Input> */ + /* list :: A pointer to the parent list. */ + /* data :: The address of the listed object. */ + /* */ + /* <Return> */ + /* List node. NULL if it wasn't found. */ + /* */ + FT_EXPORT( FT_ListNode ) + FT_List_Find( FT_List list, + void* data ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_List_Add */ + /* */ + /* <Description> */ + /* Append an element to the end of a list. */ + /* */ + /* <InOut> */ + /* list :: A pointer to the parent list. */ + /* node :: The node to append. */ + /* */ + FT_EXPORT( void ) + FT_List_Add( FT_List list, + FT_ListNode node ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_List_Insert */ + /* */ + /* <Description> */ + /* Insert an element at the head of a list. */ + /* */ + /* <InOut> */ + /* list :: A pointer to parent list. */ + /* node :: The node to insert. */ + /* */ + FT_EXPORT( void ) + FT_List_Insert( FT_List list, + FT_ListNode node ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_List_Remove */ + /* */ + /* <Description> */ + /* Remove a node from a list. This function doesn't check whether */ + /* the node is in the list! */ + /* */ + /* <Input> */ + /* node :: The node to remove. */ + /* */ + /* <InOut> */ + /* list :: A pointer to the parent list. */ + /* */ + FT_EXPORT( void ) + FT_List_Remove( FT_List list, + FT_ListNode node ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_List_Up */ + /* */ + /* <Description> */ + /* Move a node to the head/top of a list. Used to maintain LRU */ + /* lists. */ + /* */ + /* <InOut> */ + /* list :: A pointer to the parent list. */ + /* node :: The node to move. */ + /* */ + FT_EXPORT( void ) + FT_List_Up( FT_List list, + FT_ListNode node ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_List_Iterator */ + /* */ + /* <Description> */ + /* An FT_List iterator function which is called during a list parse */ + /* by @FT_List_Iterate. */ + /* */ + /* <Input> */ + /* node :: The current iteration list node. */ + /* */ + /* user :: A typeless pointer passed to @FT_List_Iterate. */ + /* Can be used to point to the iteration's state. */ + /* */ + typedef FT_Error + (*FT_List_Iterator)( FT_ListNode node, + void* user ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_List_Iterate */ + /* */ + /* <Description> */ + /* Parse a list and calls a given iterator function on each element. */ + /* Note that parsing is stopped as soon as one of the iterator calls */ + /* returns a non-zero value. */ + /* */ + /* <Input> */ + /* list :: A handle to the list. */ + /* iterator :: An iterator function, called on each node of the list. */ + /* user :: A user-supplied field which is passed as the second */ + /* argument to the iterator. */ + /* */ + /* <Return> */ + /* The result (a FreeType error code) of the last iterator call. */ + /* */ + FT_EXPORT( FT_Error ) + FT_List_Iterate( FT_List list, + FT_List_Iterator iterator, + void* user ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_List_Destructor */ + /* */ + /* <Description> */ + /* An @FT_List iterator function which is called during a list */ + /* finalization by @FT_List_Finalize to destroy all elements in a */ + /* given list. */ + /* */ + /* <Input> */ + /* system :: The current system object. */ + /* */ + /* data :: The current object to destroy. */ + /* */ + /* user :: A typeless pointer passed to @FT_List_Iterate. It can */ + /* be used to point to the iteration's state. */ + /* */ + typedef void + (*FT_List_Destructor)( FT_Memory memory, + void* data, + void* user ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_List_Finalize */ + /* */ + /* <Description> */ + /* Destroy all elements in the list as well as the list itself. */ + /* */ + /* <Input> */ + /* list :: A handle to the list. */ + /* */ + /* destroy :: A list destructor that will be applied to each element */ + /* of the list. */ + /* */ + /* memory :: The current memory object which handles deallocation. */ + /* */ + /* user :: A user-supplied field which is passed as the last */ + /* argument to the destructor. */ + /* */ + FT_EXPORT( void ) + FT_List_Finalize( FT_List list, + FT_List_Destructor destroy, + FT_Memory memory, + void* user ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FTLIST_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftlzw.h b/portlibs/include/freetype/ftlzw.h new file mode 100644 index 00000000..00d40169 --- /dev/null +++ b/portlibs/include/freetype/ftlzw.h @@ -0,0 +1,99 @@ +/***************************************************************************/ +/* */ +/* ftlzw.h */ +/* */ +/* LZW-compressed stream support. */ +/* */ +/* Copyright 2004, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTLZW_H__ +#define __FTLZW_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + /*************************************************************************/ + /* */ + /* <Section> */ + /* lzw */ + /* */ + /* <Title> */ + /* LZW Streams */ + /* */ + /* <Abstract> */ + /* Using LZW-compressed font files. */ + /* */ + /* <Description> */ + /* This section contains the declaration of LZW-specific functions. */ + /* */ + /*************************************************************************/ + + /************************************************************************ + * + * @function: + * FT_Stream_OpenLZW + * + * @description: + * Open a new stream to parse LZW-compressed font files. This is + * mainly used to support the compressed `*.pcf.Z' fonts that come + * with XFree86. + * + * @input: + * stream :: The target embedding stream. + * + * source :: The source stream. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * The source stream must be opened _before_ calling this function. + * + * Calling the internal function `FT_Stream_Close' on the new stream will + * *not* call `FT_Stream_Close' on the source stream. None of the stream + * objects will be released to the heap. + * + * The stream implementation is very basic and resets the decompression + * process each time seeking backwards is needed within the stream + * + * In certain builds of the library, LZW compression recognition is + * automatically handled when calling @FT_New_Face or @FT_Open_Face. + * This means that if no font driver is capable of handling the raw + * compressed file, the library will try to open a LZW stream from it + * and re-open the face with it. + * + * This function may return `FT_Err_Unimplemented_Feature' if your build + * of FreeType was not compiled with LZW support. + */ + FT_EXPORT( FT_Error ) + FT_Stream_OpenLZW( FT_Stream stream, + FT_Stream source ); + + /* */ + + +FT_END_HEADER + +#endif /* __FTLZW_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftmac.h b/portlibs/include/freetype/ftmac.h new file mode 100644 index 00000000..ab5bab51 --- /dev/null +++ b/portlibs/include/freetype/ftmac.h @@ -0,0 +1,274 @@ +/***************************************************************************/ +/* */ +/* ftmac.h */ +/* */ +/* Additional Mac-specific API. */ +/* */ +/* Copyright 1996-2001, 2004, 2006, 2007 by */ +/* Just van Rossum, David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +/***************************************************************************/ +/* */ +/* NOTE: Include this file after <freetype/freetype.h> and after any */ +/* Mac-specific headers (because this header uses Mac types such as */ +/* Handle, FSSpec, FSRef, etc.) */ +/* */ +/***************************************************************************/ + + +#ifndef __FTMAC_H__ +#define __FTMAC_H__ + + +#include <ft2build.h> + + +FT_BEGIN_HEADER + + +/* gcc-3.4.1 and later can warn about functions tagged as deprecated */ +#ifndef FT_DEPRECATED_ATTRIBUTE +#if defined(__GNUC__) && \ + ((__GNUC__ >= 4) || ((__GNUC__ == 3) && (__GNUC_MINOR__ >= 1))) +#define FT_DEPRECATED_ATTRIBUTE __attribute__((deprecated)) +#else +#define FT_DEPRECATED_ATTRIBUTE +#endif +#endif + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* mac_specific */ + /* */ + /* <Title> */ + /* Mac Specific Interface */ + /* */ + /* <Abstract> */ + /* Only available on the Macintosh. */ + /* */ + /* <Description> */ + /* The following definitions are only available if FreeType is */ + /* compiled on a Macintosh. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_New_Face_From_FOND */ + /* */ + /* <Description> */ + /* Create a new face object from a FOND resource. */ + /* */ + /* <InOut> */ + /* library :: A handle to the library resource. */ + /* */ + /* <Input> */ + /* fond :: A FOND resource. */ + /* */ + /* face_index :: Only supported for the -1 `sanity check' special */ + /* case. */ + /* */ + /* <Output> */ + /* aface :: A handle to a new face object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Notes> */ + /* This function can be used to create @FT_Face objects from fonts */ + /* that are installed in the system as follows. */ + /* */ + /* { */ + /* fond = GetResource( 'FOND', fontName ); */ + /* error = FT_New_Face_From_FOND( library, fond, 0, &face ); */ + /* } */ + /* */ + FT_EXPORT( FT_Error ) + FT_New_Face_From_FOND( FT_Library library, + Handle fond, + FT_Long face_index, + FT_Face *aface ) + FT_DEPRECATED_ATTRIBUTE; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_GetFile_From_Mac_Name */ + /* */ + /* <Description> */ + /* Return an FSSpec for the disk file containing the named font. */ + /* */ + /* <Input> */ + /* fontName :: Mac OS name of the font (e.g., Times New Roman */ + /* Bold). */ + /* */ + /* <Output> */ + /* pathSpec :: FSSpec to the file. For passing to */ + /* @FT_New_Face_From_FSSpec. */ + /* */ + /* face_index :: Index of the face. For passing to */ + /* @FT_New_Face_From_FSSpec. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_GetFile_From_Mac_Name( const char* fontName, + FSSpec* pathSpec, + FT_Long* face_index ) + FT_DEPRECATED_ATTRIBUTE; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_GetFile_From_Mac_ATS_Name */ + /* */ + /* <Description> */ + /* Return an FSSpec for the disk file containing the named font. */ + /* */ + /* <Input> */ + /* fontName :: Mac OS name of the font in ATS framework. */ + /* */ + /* <Output> */ + /* pathSpec :: FSSpec to the file. For passing to */ + /* @FT_New_Face_From_FSSpec. */ + /* */ + /* face_index :: Index of the face. For passing to */ + /* @FT_New_Face_From_FSSpec. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_GetFile_From_Mac_ATS_Name( const char* fontName, + FSSpec* pathSpec, + FT_Long* face_index ) + FT_DEPRECATED_ATTRIBUTE; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_GetFilePath_From_Mac_ATS_Name */ + /* */ + /* <Description> */ + /* Return a pathname of the disk file and face index for given font */ + /* name which is handled by ATS framework. */ + /* */ + /* <Input> */ + /* fontName :: Mac OS name of the font in ATS framework. */ + /* */ + /* <Output> */ + /* path :: Buffer to store pathname of the file. For passing */ + /* to @FT_New_Face. The client must allocate this */ + /* buffer before calling this function. */ + /* */ + /* maxPathSize :: Lengths of the buffer `path' that client allocated. */ + /* */ + /* face_index :: Index of the face. For passing to @FT_New_Face. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_GetFilePath_From_Mac_ATS_Name( const char* fontName, + UInt8* path, + UInt32 maxPathSize, + FT_Long* face_index ) + FT_DEPRECATED_ATTRIBUTE; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_New_Face_From_FSSpec */ + /* */ + /* <Description> */ + /* Create a new face object from a given resource and typeface index */ + /* using an FSSpec to the font file. */ + /* */ + /* <InOut> */ + /* library :: A handle to the library resource. */ + /* */ + /* <Input> */ + /* spec :: FSSpec to the font file. */ + /* */ + /* face_index :: The index of the face within the resource. The */ + /* first face has index~0. */ + /* <Output> */ + /* aface :: A handle to a new face object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* @FT_New_Face_From_FSSpec is identical to @FT_New_Face except */ + /* it accepts an FSSpec instead of a path. */ + /* */ + FT_EXPORT( FT_Error ) + FT_New_Face_From_FSSpec( FT_Library library, + const FSSpec *spec, + FT_Long face_index, + FT_Face *aface ) + FT_DEPRECATED_ATTRIBUTE; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_New_Face_From_FSRef */ + /* */ + /* <Description> */ + /* Create a new face object from a given resource and typeface index */ + /* using an FSRef to the font file. */ + /* */ + /* <InOut> */ + /* library :: A handle to the library resource. */ + /* */ + /* <Input> */ + /* spec :: FSRef to the font file. */ + /* */ + /* face_index :: The index of the face within the resource. The */ + /* first face has index~0. */ + /* <Output> */ + /* aface :: A handle to a new face object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* @FT_New_Face_From_FSRef is identical to @FT_New_Face except */ + /* it accepts an FSRef instead of a path. */ + /* */ + FT_EXPORT( FT_Error ) + FT_New_Face_From_FSRef( FT_Library library, + const FSRef *ref, + FT_Long face_index, + FT_Face *aface ) + FT_DEPRECATED_ATTRIBUTE; + + /* */ + + +FT_END_HEADER + + +#endif /* __FTMAC_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftmm.h b/portlibs/include/freetype/ftmm.h new file mode 100644 index 00000000..6261fa87 --- /dev/null +++ b/portlibs/include/freetype/ftmm.h @@ -0,0 +1,378 @@ +/***************************************************************************/ +/* */ +/* ftmm.h */ +/* */ +/* FreeType Multiple Master font interface (specification). */ +/* */ +/* Copyright 1996-2001, 2003, 2004, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTMM_H__ +#define __FTMM_H__ + + +#include <ft2build.h> +#include FT_TYPE1_TABLES_H + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* multiple_masters */ + /* */ + /* <Title> */ + /* Multiple Masters */ + /* */ + /* <Abstract> */ + /* How to manage Multiple Masters fonts. */ + /* */ + /* <Description> */ + /* The following types and functions are used to manage Multiple */ + /* Master fonts, i.e., the selection of specific design instances by */ + /* setting design axis coordinates. */ + /* */ + /* George Williams has extended this interface to make it work with */ + /* both Type~1 Multiple Masters fonts and GX distortable (var) */ + /* fonts. Some of these routines only work with MM fonts, others */ + /* will work with both types. They are similar enough that a */ + /* consistent interface makes sense. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_MM_Axis */ + /* */ + /* <Description> */ + /* A simple structure used to model a given axis in design space for */ + /* Multiple Masters fonts. */ + /* */ + /* This structure can't be used for GX var fonts. */ + /* */ + /* <Fields> */ + /* name :: The axis's name. */ + /* */ + /* minimum :: The axis's minimum design coordinate. */ + /* */ + /* maximum :: The axis's maximum design coordinate. */ + /* */ + typedef struct FT_MM_Axis_ + { + FT_String* name; + FT_Long minimum; + FT_Long maximum; + + } FT_MM_Axis; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Multi_Master */ + /* */ + /* <Description> */ + /* A structure used to model the axes and space of a Multiple Masters */ + /* font. */ + /* */ + /* This structure can't be used for GX var fonts. */ + /* */ + /* <Fields> */ + /* num_axis :: Number of axes. Cannot exceed~4. */ + /* */ + /* num_designs :: Number of designs; should be normally 2^num_axis */ + /* even though the Type~1 specification strangely */ + /* allows for intermediate designs to be present. This */ + /* number cannot exceed~16. */ + /* */ + /* axis :: A table of axis descriptors. */ + /* */ + typedef struct FT_Multi_Master_ + { + FT_UInt num_axis; + FT_UInt num_designs; + FT_MM_Axis axis[T1_MAX_MM_AXIS]; + + } FT_Multi_Master; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Var_Axis */ + /* */ + /* <Description> */ + /* A simple structure used to model a given axis in design space for */ + /* Multiple Masters and GX var fonts. */ + /* */ + /* <Fields> */ + /* name :: The axis's name. */ + /* Not always meaningful for GX. */ + /* */ + /* minimum :: The axis's minimum design coordinate. */ + /* */ + /* def :: The axis's default design coordinate. */ + /* FreeType computes meaningful default values for MM; it */ + /* is then an integer value, not in 16.16 format. */ + /* */ + /* maximum :: The axis's maximum design coordinate. */ + /* */ + /* tag :: The axis's tag (the GX equivalent to `name'). */ + /* FreeType provides default values for MM if possible. */ + /* */ + /* strid :: The entry in `name' table (another GX version of */ + /* `name'). */ + /* Not meaningful for MM. */ + /* */ + typedef struct FT_Var_Axis_ + { + FT_String* name; + + FT_Fixed minimum; + FT_Fixed def; + FT_Fixed maximum; + + FT_ULong tag; + FT_UInt strid; + + } FT_Var_Axis; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Var_Named_Style */ + /* */ + /* <Description> */ + /* A simple structure used to model a named style in a GX var font. */ + /* */ + /* This structure can't be used for MM fonts. */ + /* */ + /* <Fields> */ + /* coords :: The design coordinates for this style. */ + /* This is an array with one entry for each axis. */ + /* */ + /* strid :: The entry in `name' table identifying this style. */ + /* */ + typedef struct FT_Var_Named_Style_ + { + FT_Fixed* coords; + FT_UInt strid; + + } FT_Var_Named_Style; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_MM_Var */ + /* */ + /* <Description> */ + /* A structure used to model the axes and space of a Multiple Masters */ + /* or GX var distortable font. */ + /* */ + /* Some fields are specific to one format and not to the other. */ + /* */ + /* <Fields> */ + /* num_axis :: The number of axes. The maximum value is~4 for */ + /* MM; no limit in GX. */ + /* */ + /* num_designs :: The number of designs; should be normally */ + /* 2^num_axis for MM fonts. Not meaningful for GX */ + /* (where every glyph could have a different */ + /* number of designs). */ + /* */ + /* num_namedstyles :: The number of named styles; only meaningful for */ + /* GX which allows certain design coordinates to */ + /* have a string ID (in the `name' table) */ + /* associated with them. The font can tell the */ + /* user that, for example, Weight=1.5 is `Bold'. */ + /* */ + /* axis :: A table of axis descriptors. */ + /* GX fonts contain slightly more data than MM. */ + /* */ + /* namedstyles :: A table of named styles. */ + /* Only meaningful with GX. */ + /* */ + typedef struct FT_MM_Var_ + { + FT_UInt num_axis; + FT_UInt num_designs; + FT_UInt num_namedstyles; + FT_Var_Axis* axis; + FT_Var_Named_Style* namedstyle; + + } FT_MM_Var; + + + /* */ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Multi_Master */ + /* */ + /* <Description> */ + /* Retrieve the Multiple Master descriptor of a given font. */ + /* */ + /* This function can't be used with GX fonts. */ + /* */ + /* <Input> */ + /* face :: A handle to the source face. */ + /* */ + /* <Output> */ + /* amaster :: The Multiple Masters descriptor. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Get_Multi_Master( FT_Face face, + FT_Multi_Master *amaster ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_MM_Var */ + /* */ + /* <Description> */ + /* Retrieve the Multiple Master/GX var descriptor of a given font. */ + /* */ + /* <Input> */ + /* face :: A handle to the source face. */ + /* */ + /* <Output> */ + /* amaster :: The Multiple Masters descriptor. */ + /* Allocates a data structure, which the user must free */ + /* (a single call to FT_FREE will do it). */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Get_MM_Var( FT_Face face, + FT_MM_Var* *amaster ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Set_MM_Design_Coordinates */ + /* */ + /* <Description> */ + /* For Multiple Masters fonts, choose an interpolated font design */ + /* through design coordinates. */ + /* */ + /* This function can't be used with GX fonts. */ + /* */ + /* <InOut> */ + /* face :: A handle to the source face. */ + /* */ + /* <Input> */ + /* num_coords :: The number of design coordinates (must be equal to */ + /* the number of axes in the font). */ + /* */ + /* coords :: An array of design coordinates. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Set_MM_Design_Coordinates( FT_Face face, + FT_UInt num_coords, + FT_Long* coords ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Set_Var_Design_Coordinates */ + /* */ + /* <Description> */ + /* For Multiple Master or GX Var fonts, choose an interpolated font */ + /* design through design coordinates. */ + /* */ + /* <InOut> */ + /* face :: A handle to the source face. */ + /* */ + /* <Input> */ + /* num_coords :: The number of design coordinates (must be equal to */ + /* the number of axes in the font). */ + /* */ + /* coords :: An array of design coordinates. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Set_Var_Design_Coordinates( FT_Face face, + FT_UInt num_coords, + FT_Fixed* coords ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Set_MM_Blend_Coordinates */ + /* */ + /* <Description> */ + /* For Multiple Masters and GX var fonts, choose an interpolated font */ + /* design through normalized blend coordinates. */ + /* */ + /* <InOut> */ + /* face :: A handle to the source face. */ + /* */ + /* <Input> */ + /* num_coords :: The number of design coordinates (must be equal to */ + /* the number of axes in the font). */ + /* */ + /* coords :: The design coordinates array (each element must be */ + /* between 0 and 1.0). */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Set_MM_Blend_Coordinates( FT_Face face, + FT_UInt num_coords, + FT_Fixed* coords ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Set_Var_Blend_Coordinates */ + /* */ + /* <Description> */ + /* This is another name of @FT_Set_MM_Blend_Coordinates. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Set_Var_Blend_Coordinates( FT_Face face, + FT_UInt num_coords, + FT_Fixed* coords ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FTMM_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftmodapi.h b/portlibs/include/freetype/ftmodapi.h new file mode 100644 index 00000000..b051d34a --- /dev/null +++ b/portlibs/include/freetype/ftmodapi.h @@ -0,0 +1,441 @@ +/***************************************************************************/ +/* */ +/* ftmodapi.h */ +/* */ +/* FreeType modules public interface (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTMODAPI_H__ +#define __FTMODAPI_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* module_management */ + /* */ + /* <Title> */ + /* Module Management */ + /* */ + /* <Abstract> */ + /* How to add, upgrade, and remove modules from FreeType. */ + /* */ + /* <Description> */ + /* The definitions below are used to manage modules within FreeType. */ + /* Modules can be added, upgraded, and removed at runtime. */ + /* */ + /*************************************************************************/ + + + /* module bit flags */ +#define FT_MODULE_FONT_DRIVER 1 /* this module is a font driver */ +#define FT_MODULE_RENDERER 2 /* this module is a renderer */ +#define FT_MODULE_HINTER 4 /* this module is a glyph hinter */ +#define FT_MODULE_STYLER 8 /* this module is a styler */ + +#define FT_MODULE_DRIVER_SCALABLE 0x100 /* the driver supports */ + /* scalable fonts */ +#define FT_MODULE_DRIVER_NO_OUTLINES 0x200 /* the driver does not */ + /* support vector outlines */ +#define FT_MODULE_DRIVER_HAS_HINTER 0x400 /* the driver provides its */ + /* own hinter */ + + + /* deprecated values */ +#define ft_module_font_driver FT_MODULE_FONT_DRIVER +#define ft_module_renderer FT_MODULE_RENDERER +#define ft_module_hinter FT_MODULE_HINTER +#define ft_module_styler FT_MODULE_STYLER + +#define ft_module_driver_scalable FT_MODULE_DRIVER_SCALABLE +#define ft_module_driver_no_outlines FT_MODULE_DRIVER_NO_OUTLINES +#define ft_module_driver_has_hinter FT_MODULE_DRIVER_HAS_HINTER + + + typedef FT_Pointer FT_Module_Interface; + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Module_Constructor */ + /* */ + /* <Description> */ + /* A function used to initialize (not create) a new module object. */ + /* */ + /* <Input> */ + /* module :: The module to initialize. */ + /* */ + typedef FT_Error + (*FT_Module_Constructor)( FT_Module module ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Module_Destructor */ + /* */ + /* <Description> */ + /* A function used to finalize (not destroy) a given module object. */ + /* */ + /* <Input> */ + /* module :: The module to finalize. */ + /* */ + typedef void + (*FT_Module_Destructor)( FT_Module module ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Module_Requester */ + /* */ + /* <Description> */ + /* A function used to query a given module for a specific interface. */ + /* */ + /* <Input> */ + /* module :: The module to finalize. */ + /* */ + /* name :: The name of the interface in the module. */ + /* */ + typedef FT_Module_Interface + (*FT_Module_Requester)( FT_Module module, + const char* name ); + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Module_Class */ + /* */ + /* <Description> */ + /* The module class descriptor. */ + /* */ + /* <Fields> */ + /* module_flags :: Bit flags describing the module. */ + /* */ + /* module_size :: The size of one module object/instance in */ + /* bytes. */ + /* */ + /* module_name :: The name of the module. */ + /* */ + /* module_version :: The version, as a 16.16 fixed number */ + /* (major.minor). */ + /* */ + /* module_requires :: The version of FreeType this module requires, */ + /* as a 16.16 fixed number (major.minor). Starts */ + /* at version 2.0, i.e., 0x20000. */ + /* */ + /* module_init :: The initializing function. */ + /* */ + /* module_done :: The finalizing function. */ + /* */ + /* get_interface :: The interface requesting function. */ + /* */ + typedef struct FT_Module_Class_ + { + FT_ULong module_flags; + FT_Long module_size; + const FT_String* module_name; + FT_Fixed module_version; + FT_Fixed module_requires; + + const void* module_interface; + + FT_Module_Constructor module_init; + FT_Module_Destructor module_done; + FT_Module_Requester get_interface; + + } FT_Module_Class; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Add_Module */ + /* */ + /* <Description> */ + /* Add a new module to a given library instance. */ + /* */ + /* <InOut> */ + /* library :: A handle to the library object. */ + /* */ + /* <Input> */ + /* clazz :: A pointer to class descriptor for the module. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* An error will be returned if a module already exists by that name, */ + /* or if the module requires a version of FreeType that is too great. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Add_Module( FT_Library library, + const FT_Module_Class* clazz ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Module */ + /* */ + /* <Description> */ + /* Find a module by its name. */ + /* */ + /* <Input> */ + /* library :: A handle to the library object. */ + /* */ + /* module_name :: The module's name (as an ASCII string). */ + /* */ + /* <Return> */ + /* A module handle. 0~if none was found. */ + /* */ + /* <Note> */ + /* FreeType's internal modules aren't documented very well, and you */ + /* should look up the source code for details. */ + /* */ + FT_EXPORT( FT_Module ) + FT_Get_Module( FT_Library library, + const char* module_name ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Remove_Module */ + /* */ + /* <Description> */ + /* Remove a given module from a library instance. */ + /* */ + /* <InOut> */ + /* library :: A handle to a library object. */ + /* */ + /* <Input> */ + /* module :: A handle to a module object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The module object is destroyed by the function in case of success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Remove_Module( FT_Library library, + FT_Module module ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_New_Library */ + /* */ + /* <Description> */ + /* This function is used to create a new FreeType library instance */ + /* from a given memory object. It is thus possible to use libraries */ + /* with distinct memory allocators within the same program. */ + /* */ + /* <Input> */ + /* memory :: A handle to the original memory object. */ + /* */ + /* <Output> */ + /* alibrary :: A pointer to handle of a new library object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_New_Library( FT_Memory memory, + FT_Library *alibrary ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Done_Library */ + /* */ + /* <Description> */ + /* Discard a given library object. This closes all drivers and */ + /* discards all resource objects. */ + /* */ + /* <Input> */ + /* library :: A handle to the target library. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Done_Library( FT_Library library ); + +/* */ + + typedef void + (*FT_DebugHook_Func)( void* arg ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Set_Debug_Hook */ + /* */ + /* <Description> */ + /* Set a debug hook function for debugging the interpreter of a font */ + /* format. */ + /* */ + /* <InOut> */ + /* library :: A handle to the library object. */ + /* */ + /* <Input> */ + /* hook_index :: The index of the debug hook. You should use the */ + /* values defined in `ftobjs.h', e.g., */ + /* `FT_DEBUG_HOOK_TRUETYPE'. */ + /* */ + /* debug_hook :: The function used to debug the interpreter. */ + /* */ + /* <Note> */ + /* Currently, four debug hook slots are available, but only two (for */ + /* the TrueType and the Type~1 interpreter) are defined. */ + /* */ + /* Since the internal headers of FreeType are no longer installed, */ + /* the symbol `FT_DEBUG_HOOK_TRUETYPE' isn't available publicly. */ + /* This is a bug and will be fixed in a forthcoming release. */ + /* */ + FT_EXPORT( void ) + FT_Set_Debug_Hook( FT_Library library, + FT_UInt hook_index, + FT_DebugHook_Func debug_hook ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Add_Default_Modules */ + /* */ + /* <Description> */ + /* Add the set of default drivers to a given library object. */ + /* This is only useful when you create a library object with */ + /* @FT_New_Library (usually to plug a custom memory manager). */ + /* */ + /* <InOut> */ + /* library :: A handle to a new library object. */ + /* */ + FT_EXPORT( void ) + FT_Add_Default_Modules( FT_Library library ); + + + + /************************************************************************** + * + * @section: + * truetype_engine + * + * @title: + * The TrueType Engine + * + * @abstract: + * TrueType bytecode support. + * + * @description: + * This section contains a function used to query the level of TrueType + * bytecode support compiled in this version of the library. + * + */ + + + /************************************************************************** + * + * @enum: + * FT_TrueTypeEngineType + * + * @description: + * A list of values describing which kind of TrueType bytecode + * engine is implemented in a given FT_Library instance. It is used + * by the @FT_Get_TrueType_Engine_Type function. + * + * @values: + * FT_TRUETYPE_ENGINE_TYPE_NONE :: + * The library doesn't implement any kind of bytecode interpreter. + * + * FT_TRUETYPE_ENGINE_TYPE_UNPATENTED :: + * The library implements a bytecode interpreter that doesn't + * support the patented operations of the TrueType virtual machine. + * + * Its main use is to load certain Asian fonts which position and + * scale glyph components with bytecode instructions. It produces + * bad output for most other fonts. + * + * FT_TRUETYPE_ENGINE_TYPE_PATENTED :: + * The library implements a bytecode interpreter that covers + * the full instruction set of the TrueType virtual machine. + * See the file `docs/PATENTS' for legal aspects. + * + * @since: + * 2.2 + * + */ + typedef enum FT_TrueTypeEngineType_ + { + FT_TRUETYPE_ENGINE_TYPE_NONE = 0, + FT_TRUETYPE_ENGINE_TYPE_UNPATENTED, + FT_TRUETYPE_ENGINE_TYPE_PATENTED + + } FT_TrueTypeEngineType; + + + /************************************************************************** + * + * @func: + * FT_Get_TrueType_Engine_Type + * + * @description: + * Return an @FT_TrueTypeEngineType value to indicate which level of + * the TrueType virtual machine a given library instance supports. + * + * @input: + * library :: + * A library instance. + * + * @return: + * A value indicating which level is supported. + * + * @since: + * 2.2 + * + */ + FT_EXPORT( FT_TrueTypeEngineType ) + FT_Get_TrueType_Engine_Type( FT_Library library ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FTMODAPI_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftmoderr.h b/portlibs/include/freetype/ftmoderr.h new file mode 100644 index 00000000..b0115dd0 --- /dev/null +++ b/portlibs/include/freetype/ftmoderr.h @@ -0,0 +1,155 @@ +/***************************************************************************/ +/* */ +/* ftmoderr.h */ +/* */ +/* FreeType module error offsets (specification). */ +/* */ +/* Copyright 2001, 2002, 2003, 2004, 2005 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This file is used to define the FreeType module error offsets. */ + /* */ + /* The lower byte gives the error code, the higher byte gives the */ + /* module. The base module has error offset 0. For example, the error */ + /* `FT_Err_Invalid_File_Format' has value 0x003, the error */ + /* `TT_Err_Invalid_File_Format' has value 0x1103, the error */ + /* `T1_Err_Invalid_File_Format' has value 0x1203, etc. */ + /* */ + /* Undefine the macro FT_CONFIG_OPTION_USE_MODULE_ERRORS in ftoption.h */ + /* to make the higher byte always zero (disabling the module error */ + /* mechanism). */ + /* */ + /* It can also be used to create a module error message table easily */ + /* with something like */ + /* */ + /* { */ + /* #undef __FTMODERR_H__ */ + /* #define FT_MODERRDEF( e, v, s ) { FT_Mod_Err_ ## e, s }, */ + /* #define FT_MODERR_START_LIST { */ + /* #define FT_MODERR_END_LIST { 0, 0 } }; */ + /* */ + /* const struct */ + /* { */ + /* int mod_err_offset; */ + /* const char* mod_err_msg */ + /* } ft_mod_errors[] = */ + /* */ + /* #include FT_MODULE_ERRORS_H */ + /* } */ + /* */ + /* To use such a table, all errors must be ANDed with 0xFF00 to remove */ + /* the error code. */ + /* */ + /*************************************************************************/ + + +#ifndef __FTMODERR_H__ +#define __FTMODERR_H__ + + + /*******************************************************************/ + /*******************************************************************/ + /***** *****/ + /***** SETUP MACROS *****/ + /***** *****/ + /*******************************************************************/ + /*******************************************************************/ + + +#undef FT_NEED_EXTERN_C + +#ifndef FT_MODERRDEF + +#ifdef FT_CONFIG_OPTION_USE_MODULE_ERRORS +#define FT_MODERRDEF( e, v, s ) FT_Mod_Err_ ## e = v, +#else +#define FT_MODERRDEF( e, v, s ) FT_Mod_Err_ ## e = 0, +#endif + +#define FT_MODERR_START_LIST enum { +#define FT_MODERR_END_LIST FT_Mod_Err_Max }; + +#ifdef __cplusplus +#define FT_NEED_EXTERN_C + extern "C" { +#endif + +#endif /* !FT_MODERRDEF */ + + + /*******************************************************************/ + /*******************************************************************/ + /***** *****/ + /***** LIST MODULE ERROR BASES *****/ + /***** *****/ + /*******************************************************************/ + /*******************************************************************/ + + +#ifdef FT_MODERR_START_LIST + FT_MODERR_START_LIST +#endif + + + FT_MODERRDEF( Base, 0x000, "base module" ) + FT_MODERRDEF( Autofit, 0x100, "autofitter module" ) + FT_MODERRDEF( BDF, 0x200, "BDF module" ) + FT_MODERRDEF( Cache, 0x300, "cache module" ) + FT_MODERRDEF( CFF, 0x400, "CFF module" ) + FT_MODERRDEF( CID, 0x500, "CID module" ) + FT_MODERRDEF( Gzip, 0x600, "Gzip module" ) + FT_MODERRDEF( LZW, 0x700, "LZW module" ) + FT_MODERRDEF( OTvalid, 0x800, "OpenType validation module" ) + FT_MODERRDEF( PCF, 0x900, "PCF module" ) + FT_MODERRDEF( PFR, 0xA00, "PFR module" ) + FT_MODERRDEF( PSaux, 0xB00, "PS auxiliary module" ) + FT_MODERRDEF( PShinter, 0xC00, "PS hinter module" ) + FT_MODERRDEF( PSnames, 0xD00, "PS names module" ) + FT_MODERRDEF( Raster, 0xE00, "raster module" ) + FT_MODERRDEF( SFNT, 0xF00, "SFNT module" ) + FT_MODERRDEF( Smooth, 0x1000, "smooth raster module" ) + FT_MODERRDEF( TrueType, 0x1100, "TrueType module" ) + FT_MODERRDEF( Type1, 0x1200, "Type 1 module" ) + FT_MODERRDEF( Type42, 0x1300, "Type 42 module" ) + FT_MODERRDEF( Winfonts, 0x1400, "Windows FON/FNT module" ) + + +#ifdef FT_MODERR_END_LIST + FT_MODERR_END_LIST +#endif + + + /*******************************************************************/ + /*******************************************************************/ + /***** *****/ + /***** CLEANUP *****/ + /***** *****/ + /*******************************************************************/ + /*******************************************************************/ + + +#ifdef FT_NEED_EXTERN_C + } +#endif + +#undef FT_MODERR_START_LIST +#undef FT_MODERR_END_LIST +#undef FT_MODERRDEF +#undef FT_NEED_EXTERN_C + + +#endif /* __FTMODERR_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftotval.h b/portlibs/include/freetype/ftotval.h new file mode 100644 index 00000000..027f2e88 --- /dev/null +++ b/portlibs/include/freetype/ftotval.h @@ -0,0 +1,203 @@ +/***************************************************************************/ +/* */ +/* ftotval.h */ +/* */ +/* FreeType API for validating OpenType tables (specification). */ +/* */ +/* Copyright 2004, 2005, 2006, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +/***************************************************************************/ +/* */ +/* */ +/* Warning: This module might be moved to a different library in the */ +/* future to avoid a tight dependency between FreeType and the */ +/* OpenType specification. */ +/* */ +/* */ +/***************************************************************************/ + + +#ifndef __FTOTVAL_H__ +#define __FTOTVAL_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* ot_validation */ + /* */ + /* <Title> */ + /* OpenType Validation */ + /* */ + /* <Abstract> */ + /* An API to validate OpenType tables. */ + /* */ + /* <Description> */ + /* This section contains the declaration of functions to validate */ + /* some OpenType tables (BASE, GDEF, GPOS, GSUB, JSTF, MATH). */ + /* */ + /*************************************************************************/ + + + /********************************************************************** + * + * @enum: + * FT_VALIDATE_OTXXX + * + * @description: + * A list of bit-field constants used with @FT_OpenType_Validate to + * indicate which OpenType tables should be validated. + * + * @values: + * FT_VALIDATE_BASE :: + * Validate BASE table. + * + * FT_VALIDATE_GDEF :: + * Validate GDEF table. + * + * FT_VALIDATE_GPOS :: + * Validate GPOS table. + * + * FT_VALIDATE_GSUB :: + * Validate GSUB table. + * + * FT_VALIDATE_JSTF :: + * Validate JSTF table. + * + * FT_VALIDATE_MATH :: + * Validate MATH table. + * + * FT_VALIDATE_OT :: + * Validate all OpenType tables (BASE, GDEF, GPOS, GSUB, JSTF, MATH). + * + */ +#define FT_VALIDATE_BASE 0x0100 +#define FT_VALIDATE_GDEF 0x0200 +#define FT_VALIDATE_GPOS 0x0400 +#define FT_VALIDATE_GSUB 0x0800 +#define FT_VALIDATE_JSTF 0x1000 +#define FT_VALIDATE_MATH 0x2000 + +#define FT_VALIDATE_OT FT_VALIDATE_BASE | \ + FT_VALIDATE_GDEF | \ + FT_VALIDATE_GPOS | \ + FT_VALIDATE_GSUB | \ + FT_VALIDATE_JSTF | \ + FT_VALIDATE_MATH + + /* */ + + /********************************************************************** + * + * @function: + * FT_OpenType_Validate + * + * @description: + * Validate various OpenType tables to assure that all offsets and + * indices are valid. The idea is that a higher-level library which + * actually does the text layout can access those tables without + * error checking (which can be quite time consuming). + * + * @input: + * face :: + * A handle to the input face. + * + * validation_flags :: + * A bit field which specifies the tables to be validated. See + * @FT_VALIDATE_OTXXX for possible values. + * + * @output: + * BASE_table :: + * A pointer to the BASE table. + * + * GDEF_table :: + * A pointer to the GDEF table. + * + * GPOS_table :: + * A pointer to the GPOS table. + * + * GSUB_table :: + * A pointer to the GSUB table. + * + * JSTF_table :: + * A pointer to the JSTF table. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * This function only works with OpenType fonts, returning an error + * otherwise. + * + * After use, the application should deallocate the five tables with + * @FT_OpenType_Free. A NULL value indicates that the table either + * doesn't exist in the font, or the application hasn't asked for + * validation. + */ + FT_EXPORT( FT_Error ) + FT_OpenType_Validate( FT_Face face, + FT_UInt validation_flags, + FT_Bytes *BASE_table, + FT_Bytes *GDEF_table, + FT_Bytes *GPOS_table, + FT_Bytes *GSUB_table, + FT_Bytes *JSTF_table ); + + /* */ + + /********************************************************************** + * + * @function: + * FT_OpenType_Free + * + * @description: + * Free the buffer allocated by OpenType validator. + * + * @input: + * face :: + * A handle to the input face. + * + * table :: + * The pointer to the buffer that is allocated by + * @FT_OpenType_Validate. + * + * @note: + * This function must be used to free the buffer allocated by + * @FT_OpenType_Validate only. + */ + FT_EXPORT( void ) + FT_OpenType_Free( FT_Face face, + FT_Bytes table ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FTOTVAL_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftoutln.h b/portlibs/include/freetype/ftoutln.h new file mode 100644 index 00000000..ed654ee7 --- /dev/null +++ b/portlibs/include/freetype/ftoutln.h @@ -0,0 +1,539 @@ +/***************************************************************************/ +/* */ +/* ftoutln.h */ +/* */ +/* Support for the FT_Outline type used to store glyph shapes of */ +/* most scalable font formats (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2005, 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTOUTLN_H__ +#define __FTOUTLN_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* outline_processing */ + /* */ + /* <Title> */ + /* Outline Processing */ + /* */ + /* <Abstract> */ + /* Functions to create, transform, and render vectorial glyph images. */ + /* */ + /* <Description> */ + /* This section contains routines used to create and destroy scalable */ + /* glyph images known as `outlines'. These can also be measured, */ + /* transformed, and converted into bitmaps and pixmaps. */ + /* */ + /* <Order> */ + /* FT_Outline */ + /* FT_OUTLINE_FLAGS */ + /* FT_Outline_New */ + /* FT_Outline_Done */ + /* FT_Outline_Copy */ + /* FT_Outline_Translate */ + /* FT_Outline_Transform */ + /* FT_Outline_Embolden */ + /* FT_Outline_Reverse */ + /* FT_Outline_Check */ + /* */ + /* FT_Outline_Get_CBox */ + /* FT_Outline_Get_BBox */ + /* */ + /* FT_Outline_Get_Bitmap */ + /* FT_Outline_Render */ + /* */ + /* FT_Outline_Decompose */ + /* FT_Outline_Funcs */ + /* FT_Outline_MoveTo_Func */ + /* FT_Outline_LineTo_Func */ + /* FT_Outline_ConicTo_Func */ + /* FT_Outline_CubicTo_Func */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Decompose */ + /* */ + /* <Description> */ + /* Walk over an outline's structure to decompose it into individual */ + /* segments and Bézier arcs. This function is also able to emit */ + /* `move to' and `close to' operations to indicate the start and end */ + /* of new contours in the outline. */ + /* */ + /* <Input> */ + /* outline :: A pointer to the source target. */ + /* */ + /* func_interface :: A table of `emitters', i.e., function pointers */ + /* called during decomposition to indicate path */ + /* operations. */ + /* */ + /* <InOut> */ + /* user :: A typeless pointer which is passed to each */ + /* emitter during the decomposition. It can be */ + /* used to store the state during the */ + /* decomposition. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Outline_Decompose( FT_Outline* outline, + const FT_Outline_Funcs* func_interface, + void* user ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_New */ + /* */ + /* <Description> */ + /* Create a new outline of a given size. */ + /* */ + /* <Input> */ + /* library :: A handle to the library object from where the */ + /* outline is allocated. Note however that the new */ + /* outline will *not* necessarily be *freed*, when */ + /* destroying the library, by @FT_Done_FreeType. */ + /* */ + /* numPoints :: The maximal number of points within the outline. */ + /* */ + /* numContours :: The maximal number of contours within the outline. */ + /* */ + /* <Output> */ + /* anoutline :: A handle to the new outline. NULL in case of */ + /* error. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The reason why this function takes a `library' parameter is simply */ + /* to use the library's memory allocator. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Outline_New( FT_Library library, + FT_UInt numPoints, + FT_Int numContours, + FT_Outline *anoutline ); + + + FT_EXPORT( FT_Error ) + FT_Outline_New_Internal( FT_Memory memory, + FT_UInt numPoints, + FT_Int numContours, + FT_Outline *anoutline ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Done */ + /* */ + /* <Description> */ + /* Destroy an outline created with @FT_Outline_New. */ + /* */ + /* <Input> */ + /* library :: A handle of the library object used to allocate the */ + /* outline. */ + /* */ + /* outline :: A pointer to the outline object to be discarded. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* If the outline's `owner' field is not set, only the outline */ + /* descriptor will be released. */ + /* */ + /* The reason why this function takes an `library' parameter is */ + /* simply to use ft_mem_free(). */ + /* */ + FT_EXPORT( FT_Error ) + FT_Outline_Done( FT_Library library, + FT_Outline* outline ); + + + FT_EXPORT( FT_Error ) + FT_Outline_Done_Internal( FT_Memory memory, + FT_Outline* outline ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Check */ + /* */ + /* <Description> */ + /* Check the contents of an outline descriptor. */ + /* */ + /* <Input> */ + /* outline :: A handle to a source outline. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Outline_Check( FT_Outline* outline ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Get_CBox */ + /* */ + /* <Description> */ + /* Return an outline's `control box'. The control box encloses all */ + /* the outline's points, including Bézier control points. Though it */ + /* coincides with the exact bounding box for most glyphs, it can be */ + /* slightly larger in some situations (like when rotating an outline */ + /* which contains Bézier outside arcs). */ + /* */ + /* Computing the control box is very fast, while getting the bounding */ + /* box can take much more time as it needs to walk over all segments */ + /* and arcs in the outline. To get the latter, you can use the */ + /* `ftbbox' component which is dedicated to this single task. */ + /* */ + /* <Input> */ + /* outline :: A pointer to the source outline descriptor. */ + /* */ + /* <Output> */ + /* acbox :: The outline's control box. */ + /* */ + FT_EXPORT( void ) + FT_Outline_Get_CBox( const FT_Outline* outline, + FT_BBox *acbox ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Translate */ + /* */ + /* <Description> */ + /* Apply a simple translation to the points of an outline. */ + /* */ + /* <InOut> */ + /* outline :: A pointer to the target outline descriptor. */ + /* */ + /* <Input> */ + /* xOffset :: The horizontal offset. */ + /* */ + /* yOffset :: The vertical offset. */ + /* */ + FT_EXPORT( void ) + FT_Outline_Translate( const FT_Outline* outline, + FT_Pos xOffset, + FT_Pos yOffset ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Copy */ + /* */ + /* <Description> */ + /* Copy an outline into another one. Both objects must have the */ + /* same sizes (number of points & number of contours) when this */ + /* function is called. */ + /* */ + /* <Input> */ + /* source :: A handle to the source outline. */ + /* */ + /* <Output> */ + /* target :: A handle to the target outline. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Outline_Copy( const FT_Outline* source, + FT_Outline *target ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Transform */ + /* */ + /* <Description> */ + /* Apply a simple 2x2 matrix to all of an outline's points. Useful */ + /* for applying rotations, slanting, flipping, etc. */ + /* */ + /* <InOut> */ + /* outline :: A pointer to the target outline descriptor. */ + /* */ + /* <Input> */ + /* matrix :: A pointer to the transformation matrix. */ + /* */ + /* <Note> */ + /* You can use @FT_Outline_Translate if you need to translate the */ + /* outline's points. */ + /* */ + FT_EXPORT( void ) + FT_Outline_Transform( const FT_Outline* outline, + const FT_Matrix* matrix ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Embolden */ + /* */ + /* <Description> */ + /* Embolden an outline. The new outline will be at most 4~times */ + /* `strength' pixels wider and higher. You may think of the left and */ + /* bottom borders as unchanged. */ + /* */ + /* Negative `strength' values to reduce the outline thickness are */ + /* possible also. */ + /* */ + /* <InOut> */ + /* outline :: A handle to the target outline. */ + /* */ + /* <Input> */ + /* strength :: How strong the glyph is emboldened. Expressed in */ + /* 26.6 pixel format. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The used algorithm to increase or decrease the thickness of the */ + /* glyph doesn't change the number of points; this means that certain */ + /* situations like acute angles or intersections are sometimes */ + /* handled incorrectly. */ + /* */ + /* If you need `better' metrics values you should call */ + /* @FT_Outline_Get_CBox ot @FT_Outline_Get_BBox. */ + /* */ + /* Example call: */ + /* */ + /* { */ + /* FT_Load_Glyph( face, index, FT_LOAD_DEFAULT ); */ + /* if ( face->slot->format == FT_GLYPH_FORMAT_OUTLINE ) */ + /* FT_Outline_Embolden( &face->slot->outline, strength ); */ + /* } */ + /* */ + FT_EXPORT( FT_Error ) + FT_Outline_Embolden( FT_Outline* outline, + FT_Pos strength ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Reverse */ + /* */ + /* <Description> */ + /* Reverse the drawing direction of an outline. This is used to */ + /* ensure consistent fill conventions for mirrored glyphs. */ + /* */ + /* <InOut> */ + /* outline :: A pointer to the target outline descriptor. */ + /* */ + /* <Note> */ + /* This functions toggles the bit flag @FT_OUTLINE_REVERSE_FILL in */ + /* the outline's `flags' field. */ + /* */ + /* It shouldn't be used by a normal client application, unless it */ + /* knows what it is doing. */ + /* */ + FT_EXPORT( void ) + FT_Outline_Reverse( FT_Outline* outline ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Get_Bitmap */ + /* */ + /* <Description> */ + /* Render an outline within a bitmap. The outline's image is simply */ + /* OR-ed to the target bitmap. */ + /* */ + /* <Input> */ + /* library :: A handle to a FreeType library object. */ + /* */ + /* outline :: A pointer to the source outline descriptor. */ + /* */ + /* <InOut> */ + /* abitmap :: A pointer to the target bitmap descriptor. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* This function does NOT CREATE the bitmap, it only renders an */ + /* outline image within the one you pass to it! Consequently, the */ + /* various fields in `abitmap' should be set accordingly. */ + /* */ + /* It will use the raster corresponding to the default glyph format. */ + /* */ + /* The value of the `num_grays' field in `abitmap' is ignored. If */ + /* you select the gray-level rasterizer, and you want less than 256 */ + /* gray levels, you have to use @FT_Outline_Render directly. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Outline_Get_Bitmap( FT_Library library, + FT_Outline* outline, + const FT_Bitmap *abitmap ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Outline_Render */ + /* */ + /* <Description> */ + /* Render an outline within a bitmap using the current scan-convert. */ + /* This functions uses an @FT_Raster_Params structure as an argument, */ + /* allowing advanced features like direct composition, translucency, */ + /* etc. */ + /* */ + /* <Input> */ + /* library :: A handle to a FreeType library object. */ + /* */ + /* outline :: A pointer to the source outline descriptor. */ + /* */ + /* <InOut> */ + /* params :: A pointer to an @FT_Raster_Params structure used to */ + /* describe the rendering operation. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* You should know what you are doing and how @FT_Raster_Params works */ + /* to use this function. */ + /* */ + /* The field `params.source' will be set to `outline' before the scan */ + /* converter is called, which means that the value you give to it is */ + /* actually ignored. */ + /* */ + /* The gray-level rasterizer always uses 256 gray levels. If you */ + /* want less gray levels, you have to provide your own span callback. */ + /* See the @FT_RASTER_FLAG_DIRECT value of the `flags' field in the */ + /* @FT_Raster_Params structure for more details. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Outline_Render( FT_Library library, + FT_Outline* outline, + FT_Raster_Params* params ); + + + /************************************************************************** + * + * @enum: + * FT_Orientation + * + * @description: + * A list of values used to describe an outline's contour orientation. + * + * The TrueType and PostScript specifications use different conventions + * to determine whether outline contours should be filled or unfilled. + * + * @values: + * FT_ORIENTATION_TRUETYPE :: + * According to the TrueType specification, clockwise contours must + * be filled, and counter-clockwise ones must be unfilled. + * + * FT_ORIENTATION_POSTSCRIPT :: + * According to the PostScript specification, counter-clockwise contours + * must be filled, and clockwise ones must be unfilled. + * + * FT_ORIENTATION_FILL_RIGHT :: + * This is identical to @FT_ORIENTATION_TRUETYPE, but is used to + * remember that in TrueType, everything that is to the right of + * the drawing direction of a contour must be filled. + * + * FT_ORIENTATION_FILL_LEFT :: + * This is identical to @FT_ORIENTATION_POSTSCRIPT, but is used to + * remember that in PostScript, everything that is to the left of + * the drawing direction of a contour must be filled. + * + * FT_ORIENTATION_NONE :: + * The orientation cannot be determined. That is, different parts of + * the glyph have different orientation. + * + */ + typedef enum FT_Orientation_ + { + FT_ORIENTATION_TRUETYPE = 0, + FT_ORIENTATION_POSTSCRIPT = 1, + FT_ORIENTATION_FILL_RIGHT = FT_ORIENTATION_TRUETYPE, + FT_ORIENTATION_FILL_LEFT = FT_ORIENTATION_POSTSCRIPT, + FT_ORIENTATION_NONE + + } FT_Orientation; + + + /************************************************************************** + * + * @function: + * FT_Outline_Get_Orientation + * + * @description: + * This function analyzes a glyph outline and tries to compute its + * fill orientation (see @FT_Orientation). This is done by computing + * the direction of each global horizontal and/or vertical extrema + * within the outline. + * + * Note that this will return @FT_ORIENTATION_TRUETYPE for empty + * outlines. + * + * @input: + * outline :: + * A handle to the source outline. + * + * @return: + * The orientation. + * + */ + FT_EXPORT( FT_Orientation ) + FT_Outline_Get_Orientation( FT_Outline* outline ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FTOUTLN_H__ */ + + +/* END */ + + +/* Local Variables: */ +/* coding: utf-8 */ +/* End: */ diff --git a/portlibs/include/freetype/ftpfr.h b/portlibs/include/freetype/ftpfr.h new file mode 100644 index 00000000..02b1bdf0 --- /dev/null +++ b/portlibs/include/freetype/ftpfr.h @@ -0,0 +1,172 @@ +/***************************************************************************/ +/* */ +/* ftpfr.h */ +/* */ +/* FreeType API for accessing PFR-specific data (specification only). */ +/* */ +/* Copyright 2002, 2003, 2004, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTPFR_H__ +#define __FTPFR_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* pfr_fonts */ + /* */ + /* <Title> */ + /* PFR Fonts */ + /* */ + /* <Abstract> */ + /* PFR/TrueDoc specific API. */ + /* */ + /* <Description> */ + /* This section contains the declaration of PFR-specific functions. */ + /* */ + /*************************************************************************/ + + + /********************************************************************** + * + * @function: + * FT_Get_PFR_Metrics + * + * @description: + * Return the outline and metrics resolutions of a given PFR face. + * + * @input: + * face :: Handle to the input face. It can be a non-PFR face. + * + * @output: + * aoutline_resolution :: + * Outline resolution. This is equivalent to `face->units_per_EM'. + * Optional (parameter can be NULL). + * + * ametrics_resolution :: + * Metrics resolution. This is equivalent to `outline_resolution' + * for non-PFR fonts. Optional (parameter can be NULL). + * + * ametrics_x_scale :: + * A 16.16 fixed-point number used to scale distance expressed + * in metrics units to device sub-pixels. This is equivalent to + * `face->size->x_scale', but for metrics only. Optional (parameter + * can be NULL). + * + * ametrics_y_scale :: + * Same as `ametrics_x_scale' but for the vertical direction. + * optional (parameter can be NULL). + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * If the input face is not a PFR, this function will return an error. + * However, in all cases, it will return valid values. + */ + FT_EXPORT( FT_Error ) + FT_Get_PFR_Metrics( FT_Face face, + FT_UInt *aoutline_resolution, + FT_UInt *ametrics_resolution, + FT_Fixed *ametrics_x_scale, + FT_Fixed *ametrics_y_scale ); + + + /********************************************************************** + * + * @function: + * FT_Get_PFR_Kerning + * + * @description: + * Return the kerning pair corresponding to two glyphs in a PFR face. + * The distance is expressed in metrics units, unlike the result of + * @FT_Get_Kerning. + * + * @input: + * face :: A handle to the input face. + * + * left :: Index of the left glyph. + * + * right :: Index of the right glyph. + * + * @output: + * avector :: A kerning vector. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * This function always return distances in original PFR metrics + * units. This is unlike @FT_Get_Kerning with the @FT_KERNING_UNSCALED + * mode, which always returns distances converted to outline units. + * + * You can use the value of the `x_scale' and `y_scale' parameters + * returned by @FT_Get_PFR_Metrics to scale these to device sub-pixels. + */ + FT_EXPORT( FT_Error ) + FT_Get_PFR_Kerning( FT_Face face, + FT_UInt left, + FT_UInt right, + FT_Vector *avector ); + + + /********************************************************************** + * + * @function: + * FT_Get_PFR_Advance + * + * @description: + * Return a given glyph advance, expressed in original metrics units, + * from a PFR font. + * + * @input: + * face :: A handle to the input face. + * + * gindex :: The glyph index. + * + * @output: + * aadvance :: The glyph advance in metrics units. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * You can use the `x_scale' or `y_scale' results of @FT_Get_PFR_Metrics + * to convert the advance to device sub-pixels (i.e., 1/64th of pixels). + */ + FT_EXPORT( FT_Error ) + FT_Get_PFR_Advance( FT_Face face, + FT_UInt gindex, + FT_Pos *aadvance ); + + /* */ + + +FT_END_HEADER + +#endif /* __FTPFR_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftrender.h b/portlibs/include/freetype/ftrender.h new file mode 100644 index 00000000..41c31eac --- /dev/null +++ b/portlibs/include/freetype/ftrender.h @@ -0,0 +1,234 @@ +/***************************************************************************/ +/* */ +/* ftrender.h */ +/* */ +/* FreeType renderer modules public interface (specification). */ +/* */ +/* Copyright 1996-2001, 2005, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTRENDER_H__ +#define __FTRENDER_H__ + + +#include <ft2build.h> +#include FT_MODULE_H +#include FT_GLYPH_H + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* module_management */ + /* */ + /*************************************************************************/ + + + /* create a new glyph object */ + typedef FT_Error + (*FT_Glyph_InitFunc)( FT_Glyph glyph, + FT_GlyphSlot slot ); + + /* destroys a given glyph object */ + typedef void + (*FT_Glyph_DoneFunc)( FT_Glyph glyph ); + + typedef void + (*FT_Glyph_TransformFunc)( FT_Glyph glyph, + const FT_Matrix* matrix, + const FT_Vector* delta ); + + typedef void + (*FT_Glyph_GetBBoxFunc)( FT_Glyph glyph, + FT_BBox* abbox ); + + typedef FT_Error + (*FT_Glyph_CopyFunc)( FT_Glyph source, + FT_Glyph target ); + + typedef FT_Error + (*FT_Glyph_PrepareFunc)( FT_Glyph glyph, + FT_GlyphSlot slot ); + +/* deprecated */ +#define FT_Glyph_Init_Func FT_Glyph_InitFunc +#define FT_Glyph_Done_Func FT_Glyph_DoneFunc +#define FT_Glyph_Transform_Func FT_Glyph_TransformFunc +#define FT_Glyph_BBox_Func FT_Glyph_GetBBoxFunc +#define FT_Glyph_Copy_Func FT_Glyph_CopyFunc +#define FT_Glyph_Prepare_Func FT_Glyph_PrepareFunc + + + struct FT_Glyph_Class_ + { + FT_Long glyph_size; + FT_Glyph_Format glyph_format; + FT_Glyph_InitFunc glyph_init; + FT_Glyph_DoneFunc glyph_done; + FT_Glyph_CopyFunc glyph_copy; + FT_Glyph_TransformFunc glyph_transform; + FT_Glyph_GetBBoxFunc glyph_bbox; + FT_Glyph_PrepareFunc glyph_prepare; + }; + + + typedef FT_Error + (*FT_Renderer_RenderFunc)( FT_Renderer renderer, + FT_GlyphSlot slot, + FT_UInt mode, + const FT_Vector* origin ); + + typedef FT_Error + (*FT_Renderer_TransformFunc)( FT_Renderer renderer, + FT_GlyphSlot slot, + const FT_Matrix* matrix, + const FT_Vector* delta ); + + + typedef void + (*FT_Renderer_GetCBoxFunc)( FT_Renderer renderer, + FT_GlyphSlot slot, + FT_BBox* cbox ); + + + typedef FT_Error + (*FT_Renderer_SetModeFunc)( FT_Renderer renderer, + FT_ULong mode_tag, + FT_Pointer mode_ptr ); + +/* deprecated identifiers */ +#define FTRenderer_render FT_Renderer_RenderFunc +#define FTRenderer_transform FT_Renderer_TransformFunc +#define FTRenderer_getCBox FT_Renderer_GetCBoxFunc +#define FTRenderer_setMode FT_Renderer_SetModeFunc + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Renderer_Class */ + /* */ + /* <Description> */ + /* The renderer module class descriptor. */ + /* */ + /* <Fields> */ + /* root :: The root @FT_Module_Class fields. */ + /* */ + /* glyph_format :: The glyph image format this renderer handles. */ + /* */ + /* render_glyph :: A method used to render the image that is in a */ + /* given glyph slot into a bitmap. */ + /* */ + /* transform_glyph :: A method used to transform the image that is in */ + /* a given glyph slot. */ + /* */ + /* get_glyph_cbox :: A method used to access the glyph's cbox. */ + /* */ + /* set_mode :: A method used to pass additional parameters. */ + /* */ + /* raster_class :: For @FT_GLYPH_FORMAT_OUTLINE renderers only. */ + /* This is a pointer to its raster's class. */ + /* */ + /* raster :: For @FT_GLYPH_FORMAT_OUTLINE renderers only. */ + /* This is a pointer to the corresponding raster */ + /* object, if any. */ + /* */ + typedef struct FT_Renderer_Class_ + { + FT_Module_Class root; + + FT_Glyph_Format glyph_format; + + FT_Renderer_RenderFunc render_glyph; + FT_Renderer_TransformFunc transform_glyph; + FT_Renderer_GetCBoxFunc get_glyph_cbox; + FT_Renderer_SetModeFunc set_mode; + + FT_Raster_Funcs* raster_class; + + } FT_Renderer_Class; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Renderer */ + /* */ + /* <Description> */ + /* Retrieve the current renderer for a given glyph format. */ + /* */ + /* <Input> */ + /* library :: A handle to the library object. */ + /* */ + /* format :: The glyph format. */ + /* */ + /* <Return> */ + /* A renderer handle. 0~if none found. */ + /* */ + /* <Note> */ + /* An error will be returned if a module already exists by that name, */ + /* or if the module requires a version of FreeType that is too great. */ + /* */ + /* To add a new renderer, simply use @FT_Add_Module. To retrieve a */ + /* renderer by its name, use @FT_Get_Module. */ + /* */ + FT_EXPORT( FT_Renderer ) + FT_Get_Renderer( FT_Library library, + FT_Glyph_Format format ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Set_Renderer */ + /* */ + /* <Description> */ + /* Set the current renderer to use, and set additional mode. */ + /* */ + /* <InOut> */ + /* library :: A handle to the library object. */ + /* */ + /* <Input> */ + /* renderer :: A handle to the renderer object. */ + /* */ + /* num_params :: The number of additional parameters. */ + /* */ + /* parameters :: Additional parameters. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* In case of success, the renderer will be used to convert glyph */ + /* images in the renderer's known format into bitmaps. */ + /* */ + /* This doesn't change the current renderer for other formats. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Set_Renderer( FT_Library library, + FT_Renderer renderer, + FT_UInt num_params, + FT_Parameter* parameters ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FTRENDER_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftsizes.h b/portlibs/include/freetype/ftsizes.h new file mode 100644 index 00000000..05636c7a --- /dev/null +++ b/portlibs/include/freetype/ftsizes.h @@ -0,0 +1,159 @@ +/***************************************************************************/ +/* */ +/* ftsizes.h */ +/* */ +/* FreeType size objects management (specification). */ +/* */ +/* Copyright 1996-2001, 2003, 2004, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* Typical application would normally not need to use these functions. */ + /* However, they have been placed in a public API for the rare cases */ + /* where they are needed. */ + /* */ + /*************************************************************************/ + + +#ifndef __FTSIZES_H__ +#define __FTSIZES_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* sizes_management */ + /* */ + /* <Title> */ + /* Size Management */ + /* */ + /* <Abstract> */ + /* Managing multiple sizes per face. */ + /* */ + /* <Description> */ + /* When creating a new face object (e.g., with @FT_New_Face), an */ + /* @FT_Size object is automatically created and used to store all */ + /* pixel-size dependent information, available in the `face->size' */ + /* field. */ + /* */ + /* It is however possible to create more sizes for a given face, */ + /* mostly in order to manage several character pixel sizes of the */ + /* same font family and style. See @FT_New_Size and @FT_Done_Size. */ + /* */ + /* Note that @FT_Set_Pixel_Sizes and @FT_Set_Char_Size only */ + /* modify the contents of the current `active' size; you thus need */ + /* to use @FT_Activate_Size to change it. */ + /* */ + /* 99% of applications won't need the functions provided here, */ + /* especially if they use the caching sub-system, so be cautious */ + /* when using these. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_New_Size */ + /* */ + /* <Description> */ + /* Create a new size object from a given face object. */ + /* */ + /* <Input> */ + /* face :: A handle to a parent face object. */ + /* */ + /* <Output> */ + /* asize :: A handle to a new size object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* You need to call @FT_Activate_Size in order to select the new size */ + /* for upcoming calls to @FT_Set_Pixel_Sizes, @FT_Set_Char_Size, */ + /* @FT_Load_Glyph, @FT_Load_Char, etc. */ + /* */ + FT_EXPORT( FT_Error ) + FT_New_Size( FT_Face face, + FT_Size* size ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Done_Size */ + /* */ + /* <Description> */ + /* Discard a given size object. Note that @FT_Done_Face */ + /* automatically discards all size objects allocated with */ + /* @FT_New_Size. */ + /* */ + /* <Input> */ + /* size :: A handle to a target size object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Done_Size( FT_Size size ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Activate_Size */ + /* */ + /* <Description> */ + /* Even though it is possible to create several size objects for a */ + /* given face (see @FT_New_Size for details), functions like */ + /* @FT_Load_Glyph or @FT_Load_Char only use the last-created one to */ + /* determine the `current character pixel size'. */ + /* */ + /* This function can be used to `activate' a previously created size */ + /* object. */ + /* */ + /* <Input> */ + /* size :: A handle to a target size object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* If `face' is the size's parent face object, this function changes */ + /* the value of `face->size' to the input size handle. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Activate_Size( FT_Size size ); + + /* */ + + +FT_END_HEADER + +#endif /* __FTSIZES_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftsnames.h b/portlibs/include/freetype/ftsnames.h new file mode 100644 index 00000000..477e1e3c --- /dev/null +++ b/portlibs/include/freetype/ftsnames.h @@ -0,0 +1,170 @@ +/***************************************************************************/ +/* */ +/* ftsnames.h */ +/* */ +/* Simple interface to access SFNT name tables (which are used */ +/* to hold font names, copyright info, notices, etc.) (specification). */ +/* */ +/* This is _not_ used to retrieve glyph names! */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FT_SFNT_NAMES_H__ +#define __FT_SFNT_NAMES_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* sfnt_names */ + /* */ + /* <Title> */ + /* SFNT Names */ + /* */ + /* <Abstract> */ + /* Access the names embedded in TrueType and OpenType files. */ + /* */ + /* <Description> */ + /* The TrueType and OpenType specifications allow the inclusion of */ + /* a special `names table' in font files. This table contains */ + /* textual (and internationalized) information regarding the font, */ + /* like family name, copyright, version, etc. */ + /* */ + /* The definitions below are used to access them if available. */ + /* */ + /* Note that this has nothing to do with glyph names! */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_SfntName */ + /* */ + /* <Description> */ + /* A structure used to model an SFNT `name' table entry. */ + /* */ + /* <Fields> */ + /* platform_id :: The platform ID for `string'. */ + /* */ + /* encoding_id :: The encoding ID for `string'. */ + /* */ + /* language_id :: The language ID for `string'. */ + /* */ + /* name_id :: An identifier for `string'. */ + /* */ + /* string :: The `name' string. Note that its format differs */ + /* depending on the (platform,encoding) pair. It can */ + /* be a Pascal String, a UTF-16 one, etc. */ + /* */ + /* Generally speaking, the string is not */ + /* zero-terminated. Please refer to the TrueType */ + /* specification for details. */ + /* */ + /* string_len :: The length of `string' in bytes. */ + /* */ + /* <Note> */ + /* Possible values for `platform_id', `encoding_id', `language_id', */ + /* and `name_id' are given in the file `ttnameid.h'. For details */ + /* please refer to the TrueType or OpenType specification. */ + /* */ + /* See also @TT_PLATFORM_XXX, @TT_APPLE_ID_XXX, @TT_MAC_ID_XXX, */ + /* @TT_ISO_ID_XXX, and @TT_MS_ID_XXX. */ + /* */ + typedef struct FT_SfntName_ + { + FT_UShort platform_id; + FT_UShort encoding_id; + FT_UShort language_id; + FT_UShort name_id; + + FT_Byte* string; /* this string is *not* null-terminated! */ + FT_UInt string_len; /* in bytes */ + + } FT_SfntName; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Sfnt_Name_Count */ + /* */ + /* <Description> */ + /* Retrieve the number of name strings in the SFNT `name' table. */ + /* */ + /* <Input> */ + /* face :: A handle to the source face. */ + /* */ + /* <Return> */ + /* The number of strings in the `name' table. */ + /* */ + FT_EXPORT( FT_UInt ) + FT_Get_Sfnt_Name_Count( FT_Face face ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Sfnt_Name */ + /* */ + /* <Description> */ + /* Retrieve a string of the SFNT `name' table for a given index. */ + /* */ + /* <Input> */ + /* face :: A handle to the source face. */ + /* */ + /* idx :: The index of the `name' string. */ + /* */ + /* <Output> */ + /* aname :: The indexed @FT_SfntName structure. */ + /* */ + /* <Return> */ + /* FreeType error code. 0~means success. */ + /* */ + /* <Note> */ + /* The `string' array returned in the `aname' structure is not */ + /* null-terminated. */ + /* */ + /* Use @FT_Get_Sfnt_Name_Count to get the total number of available */ + /* `name' table entries, then do a loop until you get the right */ + /* platform, encoding, and name ID. */ + /* */ + FT_EXPORT( FT_Error ) + FT_Get_Sfnt_Name( FT_Face face, + FT_UInt idx, + FT_SfntName *aname ); + + + /* */ + + +FT_END_HEADER + +#endif /* __FT_SFNT_NAMES_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftstroke.h b/portlibs/include/freetype/ftstroke.h new file mode 100644 index 00000000..1596f6a2 --- /dev/null +++ b/portlibs/include/freetype/ftstroke.h @@ -0,0 +1,716 @@ +/***************************************************************************/ +/* */ +/* ftstroke.h */ +/* */ +/* FreeType path stroker (specification). */ +/* */ +/* Copyright 2002, 2003, 2004, 2005, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FT_STROKE_H__ +#define __FT_STROKE_H__ + +#include <ft2build.h> +#include FT_OUTLINE_H +#include FT_GLYPH_H + + +FT_BEGIN_HEADER + + + /************************************************************************ + * + * @section: + * glyph_stroker + * + * @title: + * Glyph Stroker + * + * @abstract: + * Generating bordered and stroked glyphs. + * + * @description: + * This component generates stroked outlines of a given vectorial + * glyph. It also allows you to retrieve the `outside' and/or the + * `inside' borders of the stroke. + * + * This can be useful to generate `bordered' glyph, i.e., glyphs + * displayed with a coloured (and anti-aliased) border around their + * shape. + */ + + + /************************************************************** + * + * @type: + * FT_Stroker + * + * @description: + * Opaque handler to a path stroker object. + */ + typedef struct FT_StrokerRec_* FT_Stroker; + + + /************************************************************** + * + * @enum: + * FT_Stroker_LineJoin + * + * @description: + * These values determine how two joining lines are rendered + * in a stroker. + * + * @values: + * FT_STROKER_LINEJOIN_ROUND :: + * Used to render rounded line joins. Circular arcs are used + * to join two lines smoothly. + * + * FT_STROKER_LINEJOIN_BEVEL :: + * Used to render beveled line joins; i.e., the two joining lines + * are extended until they intersect. + * + * FT_STROKER_LINEJOIN_MITER :: + * Same as beveled rendering, except that an additional line + * break is added if the angle between the two joining lines + * is too closed (this is useful to avoid unpleasant spikes + * in beveled rendering). + */ + typedef enum FT_Stroker_LineJoin_ + { + FT_STROKER_LINEJOIN_ROUND = 0, + FT_STROKER_LINEJOIN_BEVEL, + FT_STROKER_LINEJOIN_MITER + + } FT_Stroker_LineJoin; + + + /************************************************************** + * + * @enum: + * FT_Stroker_LineCap + * + * @description: + * These values determine how the end of opened sub-paths are + * rendered in a stroke. + * + * @values: + * FT_STROKER_LINECAP_BUTT :: + * The end of lines is rendered as a full stop on the last + * point itself. + * + * FT_STROKER_LINECAP_ROUND :: + * The end of lines is rendered as a half-circle around the + * last point. + * + * FT_STROKER_LINECAP_SQUARE :: + * The end of lines is rendered as a square around the + * last point. + */ + typedef enum FT_Stroker_LineCap_ + { + FT_STROKER_LINECAP_BUTT = 0, + FT_STROKER_LINECAP_ROUND, + FT_STROKER_LINECAP_SQUARE + + } FT_Stroker_LineCap; + + + /************************************************************** + * + * @enum: + * FT_StrokerBorder + * + * @description: + * These values are used to select a given stroke border + * in @FT_Stroker_GetBorderCounts and @FT_Stroker_ExportBorder. + * + * @values: + * FT_STROKER_BORDER_LEFT :: + * Select the left border, relative to the drawing direction. + * + * FT_STROKER_BORDER_RIGHT :: + * Select the right border, relative to the drawing direction. + * + * @note: + * Applications are generally interested in the `inside' and `outside' + * borders. However, there is no direct mapping between these and the + * `left' and `right' ones, since this really depends on the glyph's + * drawing orientation, which varies between font formats. + * + * You can however use @FT_Outline_GetInsideBorder and + * @FT_Outline_GetOutsideBorder to get these. + */ + typedef enum FT_StrokerBorder_ + { + FT_STROKER_BORDER_LEFT = 0, + FT_STROKER_BORDER_RIGHT + + } FT_StrokerBorder; + + + /************************************************************** + * + * @function: + * FT_Outline_GetInsideBorder + * + * @description: + * Retrieve the @FT_StrokerBorder value corresponding to the + * `inside' borders of a given outline. + * + * @input: + * outline :: + * The source outline handle. + * + * @return: + * The border index. @FT_STROKER_BORDER_LEFT for empty or invalid + * outlines. + */ + FT_EXPORT( FT_StrokerBorder ) + FT_Outline_GetInsideBorder( FT_Outline* outline ); + + + /************************************************************** + * + * @function: + * FT_Outline_GetOutsideBorder + * + * @description: + * Retrieve the @FT_StrokerBorder value corresponding to the + * `outside' borders of a given outline. + * + * @input: + * outline :: + * The source outline handle. + * + * @return: + * The border index. @FT_STROKER_BORDER_LEFT for empty or invalid + * outlines. + */ + FT_EXPORT( FT_StrokerBorder ) + FT_Outline_GetOutsideBorder( FT_Outline* outline ); + + + /************************************************************** + * + * @function: + * FT_Stroker_New + * + * @description: + * Create a new stroker object. + * + * @input: + * library :: + * FreeType library handle. + * + * @output: + * astroker :: + * A new stroker object handle. NULL in case of error. + * + * @return: + * FreeType error code. 0~means success. + */ + FT_EXPORT( FT_Error ) + FT_Stroker_New( FT_Library library, + FT_Stroker *astroker ); + + + /************************************************************** + * + * @function: + * FT_Stroker_Set + * + * @description: + * Reset a stroker object's attributes. + * + * @input: + * stroker :: + * The target stroker handle. + * + * radius :: + * The border radius. + * + * line_cap :: + * The line cap style. + * + * line_join :: + * The line join style. + * + * miter_limit :: + * The miter limit for the FT_STROKER_LINEJOIN_MITER style, + * expressed as 16.16 fixed point value. + * + * @note: + * The radius is expressed in the same units as the outline + * coordinates. + */ + FT_EXPORT( void ) + FT_Stroker_Set( FT_Stroker stroker, + FT_Fixed radius, + FT_Stroker_LineCap line_cap, + FT_Stroker_LineJoin line_join, + FT_Fixed miter_limit ); + + + /************************************************************** + * + * @function: + * FT_Stroker_Rewind + * + * @description: + * Reset a stroker object without changing its attributes. + * You should call this function before beginning a new + * series of calls to @FT_Stroker_BeginSubPath or + * @FT_Stroker_EndSubPath. + * + * @input: + * stroker :: + * The target stroker handle. + */ + FT_EXPORT( void ) + FT_Stroker_Rewind( FT_Stroker stroker ); + + + /************************************************************** + * + * @function: + * FT_Stroker_ParseOutline + * + * @description: + * A convenience function used to parse a whole outline with + * the stroker. The resulting outline(s) can be retrieved + * later by functions like @FT_Stroker_GetCounts and @FT_Stroker_Export. + * + * @input: + * stroker :: + * The target stroker handle. + * + * outline :: + * The source outline. + * + * opened :: + * A boolean. If~1, the outline is treated as an open path instead + * of a closed one. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * If `opened' is~0 (the default), the outline is treated as a closed + * path, and the stroker generates two distinct `border' outlines. + * + * If `opened' is~1, the outline is processed as an open path, and the + * stroker generates a single `stroke' outline. + * + * This function calls @FT_Stroker_Rewind automatically. + */ + FT_EXPORT( FT_Error ) + FT_Stroker_ParseOutline( FT_Stroker stroker, + FT_Outline* outline, + FT_Bool opened ); + + + /************************************************************** + * + * @function: + * FT_Stroker_BeginSubPath + * + * @description: + * Start a new sub-path in the stroker. + * + * @input: + * stroker :: + * The target stroker handle. + * + * to :: + * A pointer to the start vector. + * + * open :: + * A boolean. If~1, the sub-path is treated as an open one. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * This function is useful when you need to stroke a path that is + * not stored as an @FT_Outline object. + */ + FT_EXPORT( FT_Error ) + FT_Stroker_BeginSubPath( FT_Stroker stroker, + FT_Vector* to, + FT_Bool open ); + + + /************************************************************** + * + * @function: + * FT_Stroker_EndSubPath + * + * @description: + * Close the current sub-path in the stroker. + * + * @input: + * stroker :: + * The target stroker handle. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * You should call this function after @FT_Stroker_BeginSubPath. + * If the subpath was not `opened', this function `draws' a + * single line segment to the start position when needed. + */ + FT_EXPORT( FT_Error ) + FT_Stroker_EndSubPath( FT_Stroker stroker ); + + + /************************************************************** + * + * @function: + * FT_Stroker_LineTo + * + * @description: + * `Draw' a single line segment in the stroker's current sub-path, + * from the last position. + * + * @input: + * stroker :: + * The target stroker handle. + * + * to :: + * A pointer to the destination point. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * You should call this function between @FT_Stroker_BeginSubPath and + * @FT_Stroker_EndSubPath. + */ + FT_EXPORT( FT_Error ) + FT_Stroker_LineTo( FT_Stroker stroker, + FT_Vector* to ); + + + /************************************************************** + * + * @function: + * FT_Stroker_ConicTo + * + * @description: + * `Draw' a single quadratic Bézier in the stroker's current sub-path, + * from the last position. + * + * @input: + * stroker :: + * The target stroker handle. + * + * control :: + * A pointer to a Bézier control point. + * + * to :: + * A pointer to the destination point. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * You should call this function between @FT_Stroker_BeginSubPath and + * @FT_Stroker_EndSubPath. + */ + FT_EXPORT( FT_Error ) + FT_Stroker_ConicTo( FT_Stroker stroker, + FT_Vector* control, + FT_Vector* to ); + + + /************************************************************** + * + * @function: + * FT_Stroker_CubicTo + * + * @description: + * `Draw' a single cubic Bézier in the stroker's current sub-path, + * from the last position. + * + * @input: + * stroker :: + * The target stroker handle. + * + * control1 :: + * A pointer to the first Bézier control point. + * + * control2 :: + * A pointer to second Bézier control point. + * + * to :: + * A pointer to the destination point. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * You should call this function between @FT_Stroker_BeginSubPath and + * @FT_Stroker_EndSubPath. + */ + FT_EXPORT( FT_Error ) + FT_Stroker_CubicTo( FT_Stroker stroker, + FT_Vector* control1, + FT_Vector* control2, + FT_Vector* to ); + + + /************************************************************** + * + * @function: + * FT_Stroker_GetBorderCounts + * + * @description: + * Call this function once you have finished parsing your paths + * with the stroker. It returns the number of points and + * contours necessary to export one of the `border' or `stroke' + * outlines generated by the stroker. + * + * @input: + * stroker :: + * The target stroker handle. + * + * border :: + * The border index. + * + * @output: + * anum_points :: + * The number of points. + * + * anum_contours :: + * The number of contours. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * When an outline, or a sub-path, is `closed', the stroker generates + * two independent `border' outlines, named `left' and `right'. + * + * When the outline, or a sub-path, is `opened', the stroker merges + * the `border' outlines with caps. The `left' border receives all + * points, while the `right' border becomes empty. + * + * Use the function @FT_Stroker_GetCounts instead if you want to + * retrieve the counts associated to both borders. + */ + FT_EXPORT( FT_Error ) + FT_Stroker_GetBorderCounts( FT_Stroker stroker, + FT_StrokerBorder border, + FT_UInt *anum_points, + FT_UInt *anum_contours ); + + + /************************************************************** + * + * @function: + * FT_Stroker_ExportBorder + * + * @description: + * Call this function after @FT_Stroker_GetBorderCounts to + * export the corresponding border to your own @FT_Outline + * structure. + * + * Note that this function appends the border points and + * contours to your outline, but does not try to resize its + * arrays. + * + * @input: + * stroker :: + * The target stroker handle. + * + * border :: + * The border index. + * + * outline :: + * The target outline handle. + * + * @note: + * Always call this function after @FT_Stroker_GetBorderCounts to + * get sure that there is enough room in your @FT_Outline object to + * receive all new data. + * + * When an outline, or a sub-path, is `closed', the stroker generates + * two independent `border' outlines, named `left' and `right' + * + * When the outline, or a sub-path, is `opened', the stroker merges + * the `border' outlines with caps. The `left' border receives all + * points, while the `right' border becomes empty. + * + * Use the function @FT_Stroker_Export instead if you want to + * retrieve all borders at once. + */ + FT_EXPORT( void ) + FT_Stroker_ExportBorder( FT_Stroker stroker, + FT_StrokerBorder border, + FT_Outline* outline ); + + + /************************************************************** + * + * @function: + * FT_Stroker_GetCounts + * + * @description: + * Call this function once you have finished parsing your paths + * with the stroker. It returns the number of points and + * contours necessary to export all points/borders from the stroked + * outline/path. + * + * @input: + * stroker :: + * The target stroker handle. + * + * @output: + * anum_points :: + * The number of points. + * + * anum_contours :: + * The number of contours. + * + * @return: + * FreeType error code. 0~means success. + */ + FT_EXPORT( FT_Error ) + FT_Stroker_GetCounts( FT_Stroker stroker, + FT_UInt *anum_points, + FT_UInt *anum_contours ); + + + /************************************************************** + * + * @function: + * FT_Stroker_Export + * + * @description: + * Call this function after @FT_Stroker_GetBorderCounts to + * export the all borders to your own @FT_Outline structure. + * + * Note that this function appends the border points and + * contours to your outline, but does not try to resize its + * arrays. + * + * @input: + * stroker :: + * The target stroker handle. + * + * outline :: + * The target outline handle. + */ + FT_EXPORT( void ) + FT_Stroker_Export( FT_Stroker stroker, + FT_Outline* outline ); + + + /************************************************************** + * + * @function: + * FT_Stroker_Done + * + * @description: + * Destroy a stroker object. + * + * @input: + * stroker :: + * A stroker handle. Can be NULL. + */ + FT_EXPORT( void ) + FT_Stroker_Done( FT_Stroker stroker ); + + + /************************************************************** + * + * @function: + * FT_Glyph_Stroke + * + * @description: + * Stroke a given outline glyph object with a given stroker. + * + * @inout: + * pglyph :: + * Source glyph handle on input, new glyph handle on output. + * + * @input: + * stroker :: + * A stroker handle. + * + * destroy :: + * A Boolean. If~1, the source glyph object is destroyed + * on success. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * The source glyph is untouched in case of error. + */ + FT_EXPORT( FT_Error ) + FT_Glyph_Stroke( FT_Glyph *pglyph, + FT_Stroker stroker, + FT_Bool destroy ); + + + /************************************************************** + * + * @function: + * FT_Glyph_StrokeBorder + * + * @description: + * Stroke a given outline glyph object with a given stroker, but + * only return either its inside or outside border. + * + * @inout: + * pglyph :: + * Source glyph handle on input, new glyph handle on output. + * + * @input: + * stroker :: + * A stroker handle. + * + * inside :: + * A Boolean. If~1, return the inside border, otherwise + * the outside border. + * + * destroy :: + * A Boolean. If~1, the source glyph object is destroyed + * on success. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * The source glyph is untouched in case of error. + */ + FT_EXPORT( FT_Error ) + FT_Glyph_StrokeBorder( FT_Glyph *pglyph, + FT_Stroker stroker, + FT_Bool inside, + FT_Bool destroy ); + + /* */ + +FT_END_HEADER + +#endif /* __FT_STROKE_H__ */ + + +/* END */ + + +/* Local Variables: */ +/* coding: utf-8 */ +/* End: */ diff --git a/portlibs/include/freetype/ftsynth.h b/portlibs/include/freetype/ftsynth.h new file mode 100644 index 00000000..a068b792 --- /dev/null +++ b/portlibs/include/freetype/ftsynth.h @@ -0,0 +1,80 @@ +/***************************************************************************/ +/* */ +/* ftsynth.h */ +/* */ +/* FreeType synthesizing code for emboldening and slanting */ +/* (specification). */ +/* */ +/* Copyright 2000-2001, 2003, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /********* *********/ + /********* WARNING, THIS IS ALPHA CODE! THIS API *********/ + /********* IS DUE TO CHANGE UNTIL STRICTLY NOTIFIED BY THE *********/ + /********* FREETYPE DEVELOPMENT TEAM *********/ + /********* *********/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /* Main reason for not lifting the functions in this module to a */ + /* `standard' API is that the used parameters for emboldening and */ + /* slanting are not configurable. Consider the functions as a */ + /* code resource which should be copied into the application and */ + /* adapted to the particular needs. */ + + +#ifndef __FTSYNTH_H__ +#define __FTSYNTH_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + /* Embolden a glyph by a `reasonable' value (which is highly a matter of */ + /* taste). This function is actually a convenience function, providing */ + /* a wrapper for @FT_Outline_Embolden and @FT_Bitmap_Embolden. */ + /* */ + /* For emboldened outlines the metrics are estimates only; if you need */ + /* precise values you should call @FT_Outline_Get_CBox. */ + FT_EXPORT( void ) + FT_GlyphSlot_Embolden( FT_GlyphSlot slot ); + + /* Slant an outline glyph to the right by about 12 degrees. */ + FT_EXPORT( void ) + FT_GlyphSlot_Oblique( FT_GlyphSlot slot ); + + /* */ + +FT_END_HEADER + +#endif /* __FTSYNTH_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftsystem.h b/portlibs/include/freetype/ftsystem.h new file mode 100644 index 00000000..a95b2c76 --- /dev/null +++ b/portlibs/include/freetype/ftsystem.h @@ -0,0 +1,346 @@ +/***************************************************************************/ +/* */ +/* ftsystem.h */ +/* */ +/* FreeType low-level system interface definition (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2005 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTSYSTEM_H__ +#define __FTSYSTEM_H__ + + +#include <ft2build.h> + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* system_interface */ + /* */ + /* <Title> */ + /* System Interface */ + /* */ + /* <Abstract> */ + /* How FreeType manages memory and i/o. */ + /* */ + /* <Description> */ + /* This section contains various definitions related to memory */ + /* management and i/o access. You need to understand this */ + /* information if you want to use a custom memory manager or you own */ + /* i/o streams. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* M E M O R Y M A N A G E M E N T */ + /* */ + /*************************************************************************/ + + + /************************************************************************* + * + * @type: + * FT_Memory + * + * @description: + * A handle to a given memory manager object, defined with an + * @FT_MemoryRec structure. + * + */ + typedef struct FT_MemoryRec_* FT_Memory; + + + /************************************************************************* + * + * @functype: + * FT_Alloc_Func + * + * @description: + * A function used to allocate `size' bytes from `memory'. + * + * @input: + * memory :: + * A handle to the source memory manager. + * + * size :: + * The size in bytes to allocate. + * + * @return: + * Address of new memory block. 0~in case of failure. + * + */ + typedef void* + (*FT_Alloc_Func)( FT_Memory memory, + long size ); + + + /************************************************************************* + * + * @functype: + * FT_Free_Func + * + * @description: + * A function used to release a given block of memory. + * + * @input: + * memory :: + * A handle to the source memory manager. + * + * block :: + * The address of the target memory block. + * + */ + typedef void + (*FT_Free_Func)( FT_Memory memory, + void* block ); + + + /************************************************************************* + * + * @functype: + * FT_Realloc_Func + * + * @description: + * A function used to re-allocate a given block of memory. + * + * @input: + * memory :: + * A handle to the source memory manager. + * + * cur_size :: + * The block's current size in bytes. + * + * new_size :: + * The block's requested new size. + * + * block :: + * The block's current address. + * + * @return: + * New block address. 0~in case of memory shortage. + * + * @note: + * In case of error, the old block must still be available. + * + */ + typedef void* + (*FT_Realloc_Func)( FT_Memory memory, + long cur_size, + long new_size, + void* block ); + + + /************************************************************************* + * + * @struct: + * FT_MemoryRec + * + * @description: + * A structure used to describe a given memory manager to FreeType~2. + * + * @fields: + * user :: + * A generic typeless pointer for user data. + * + * alloc :: + * A pointer type to an allocation function. + * + * free :: + * A pointer type to an memory freeing function. + * + * realloc :: + * A pointer type to a reallocation function. + * + */ + struct FT_MemoryRec_ + { + void* user; + FT_Alloc_Func alloc; + FT_Free_Func free; + FT_Realloc_Func realloc; + }; + + + /*************************************************************************/ + /* */ + /* I / O M A N A G E M E N T */ + /* */ + /*************************************************************************/ + + + /************************************************************************* + * + * @type: + * FT_Stream + * + * @description: + * A handle to an input stream. + * + */ + typedef struct FT_StreamRec_* FT_Stream; + + + /************************************************************************* + * + * @struct: + * FT_StreamDesc + * + * @description: + * A union type used to store either a long or a pointer. This is used + * to store a file descriptor or a `FILE*' in an input stream. + * + */ + typedef union FT_StreamDesc_ + { + long value; + void* pointer; + + } FT_StreamDesc; + + + /************************************************************************* + * + * @functype: + * FT_Stream_IoFunc + * + * @description: + * A function used to seek and read data from a given input stream. + * + * @input: + * stream :: + * A handle to the source stream. + * + * offset :: + * The offset of read in stream (always from start). + * + * buffer :: + * The address of the read buffer. + * + * count :: + * The number of bytes to read from the stream. + * + * @return: + * The number of bytes effectively read by the stream. + * + * @note: + * This function might be called to perform a seek or skip operation + * with a `count' of~0. + * + */ + typedef unsigned long + (*FT_Stream_IoFunc)( FT_Stream stream, + unsigned long offset, + unsigned char* buffer, + unsigned long count ); + + + /************************************************************************* + * + * @functype: + * FT_Stream_CloseFunc + * + * @description: + * A function used to close a given input stream. + * + * @input: + * stream :: + * A handle to the target stream. + * + */ + typedef void + (*FT_Stream_CloseFunc)( FT_Stream stream ); + + + /************************************************************************* + * + * @struct: + * FT_StreamRec + * + * @description: + * A structure used to describe an input stream. + * + * @input: + * base :: + * For memory-based streams, this is the address of the first stream + * byte in memory. This field should always be set to NULL for + * disk-based streams. + * + * size :: + * The stream size in bytes. + * + * pos :: + * The current position within the stream. + * + * descriptor :: + * This field is a union that can hold an integer or a pointer. It is + * used by stream implementations to store file descriptors or `FILE*' + * pointers. + * + * pathname :: + * This field is completely ignored by FreeType. However, it is often + * useful during debugging to use it to store the stream's filename + * (where available). + * + * read :: + * The stream's input function. + * + * close :: + * The stream;s close function. + * + * memory :: + * The memory manager to use to preload frames. This is set + * internally by FreeType and shouldn't be touched by stream + * implementations. + * + * cursor :: + * This field is set and used internally by FreeType when parsing + * frames. + * + * limit :: + * This field is set and used internally by FreeType when parsing + * frames. + * + */ + typedef struct FT_StreamRec_ + { + unsigned char* base; + unsigned long size; + unsigned long pos; + + FT_StreamDesc descriptor; + FT_StreamDesc pathname; + FT_Stream_IoFunc read; + FT_Stream_CloseFunc close; + + FT_Memory memory; + unsigned char* cursor; + unsigned char* limit; + + } FT_StreamRec; + + + /* */ + + +FT_END_HEADER + +#endif /* __FTSYSTEM_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/fttrigon.h b/portlibs/include/freetype/fttrigon.h new file mode 100644 index 00000000..6b77d2ee --- /dev/null +++ b/portlibs/include/freetype/fttrigon.h @@ -0,0 +1,350 @@ +/***************************************************************************/ +/* */ +/* fttrigon.h */ +/* */ +/* FreeType trigonometric functions (specification). */ +/* */ +/* Copyright 2001, 2003, 2005, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTTRIGON_H__ +#define __FTTRIGON_H__ + +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* computations */ + /* */ + /*************************************************************************/ + + + /************************************************************************* + * + * @type: + * FT_Angle + * + * @description: + * This type is used to model angle values in FreeType. Note that the + * angle is a 16.16 fixed float value expressed in degrees. + * + */ + typedef FT_Fixed FT_Angle; + + + /************************************************************************* + * + * @macro: + * FT_ANGLE_PI + * + * @description: + * The angle pi expressed in @FT_Angle units. + * + */ +#define FT_ANGLE_PI ( 180L << 16 ) + + + /************************************************************************* + * + * @macro: + * FT_ANGLE_2PI + * + * @description: + * The angle 2*pi expressed in @FT_Angle units. + * + */ +#define FT_ANGLE_2PI ( FT_ANGLE_PI * 2 ) + + + /************************************************************************* + * + * @macro: + * FT_ANGLE_PI2 + * + * @description: + * The angle pi/2 expressed in @FT_Angle units. + * + */ +#define FT_ANGLE_PI2 ( FT_ANGLE_PI / 2 ) + + + /************************************************************************* + * + * @macro: + * FT_ANGLE_PI4 + * + * @description: + * The angle pi/4 expressed in @FT_Angle units. + * + */ +#define FT_ANGLE_PI4 ( FT_ANGLE_PI / 4 ) + + + /************************************************************************* + * + * @function: + * FT_Sin + * + * @description: + * Return the sinus of a given angle in fixed point format. + * + * @input: + * angle :: + * The input angle. + * + * @return: + * The sinus value. + * + * @note: + * If you need both the sinus and cosinus for a given angle, use the + * function @FT_Vector_Unit. + * + */ + FT_EXPORT( FT_Fixed ) + FT_Sin( FT_Angle angle ); + + + /************************************************************************* + * + * @function: + * FT_Cos + * + * @description: + * Return the cosinus of a given angle in fixed point format. + * + * @input: + * angle :: + * The input angle. + * + * @return: + * The cosinus value. + * + * @note: + * If you need both the sinus and cosinus for a given angle, use the + * function @FT_Vector_Unit. + * + */ + FT_EXPORT( FT_Fixed ) + FT_Cos( FT_Angle angle ); + + + /************************************************************************* + * + * @function: + * FT_Tan + * + * @description: + * Return the tangent of a given angle in fixed point format. + * + * @input: + * angle :: + * The input angle. + * + * @return: + * The tangent value. + * + */ + FT_EXPORT( FT_Fixed ) + FT_Tan( FT_Angle angle ); + + + /************************************************************************* + * + * @function: + * FT_Atan2 + * + * @description: + * Return the arc-tangent corresponding to a given vector (x,y) in + * the 2d plane. + * + * @input: + * x :: + * The horizontal vector coordinate. + * + * y :: + * The vertical vector coordinate. + * + * @return: + * The arc-tangent value (i.e. angle). + * + */ + FT_EXPORT( FT_Angle ) + FT_Atan2( FT_Fixed x, + FT_Fixed y ); + + + /************************************************************************* + * + * @function: + * FT_Angle_Diff + * + * @description: + * Return the difference between two angles. The result is always + * constrained to the ]-PI..PI] interval. + * + * @input: + * angle1 :: + * First angle. + * + * angle2 :: + * Second angle. + * + * @return: + * Constrained value of `value2-value1'. + * + */ + FT_EXPORT( FT_Angle ) + FT_Angle_Diff( FT_Angle angle1, + FT_Angle angle2 ); + + + /************************************************************************* + * + * @function: + * FT_Vector_Unit + * + * @description: + * Return the unit vector corresponding to a given angle. After the + * call, the value of `vec.x' will be `sin(angle)', and the value of + * `vec.y' will be `cos(angle)'. + * + * This function is useful to retrieve both the sinus and cosinus of a + * given angle quickly. + * + * @output: + * vec :: + * The address of target vector. + * + * @input: + * angle :: + * The address of angle. + * + */ + FT_EXPORT( void ) + FT_Vector_Unit( FT_Vector* vec, + FT_Angle angle ); + + + /************************************************************************* + * + * @function: + * FT_Vector_Rotate + * + * @description: + * Rotate a vector by a given angle. + * + * @inout: + * vec :: + * The address of target vector. + * + * @input: + * angle :: + * The address of angle. + * + */ + FT_EXPORT( void ) + FT_Vector_Rotate( FT_Vector* vec, + FT_Angle angle ); + + + /************************************************************************* + * + * @function: + * FT_Vector_Length + * + * @description: + * Return the length of a given vector. + * + * @input: + * vec :: + * The address of target vector. + * + * @return: + * The vector length, expressed in the same units that the original + * vector coordinates. + * + */ + FT_EXPORT( FT_Fixed ) + FT_Vector_Length( FT_Vector* vec ); + + + /************************************************************************* + * + * @function: + * FT_Vector_Polarize + * + * @description: + * Compute both the length and angle of a given vector. + * + * @input: + * vec :: + * The address of source vector. + * + * @output: + * length :: + * The vector length. + * + * angle :: + * The vector angle. + * + */ + FT_EXPORT( void ) + FT_Vector_Polarize( FT_Vector* vec, + FT_Fixed *length, + FT_Angle *angle ); + + + /************************************************************************* + * + * @function: + * FT_Vector_From_Polar + * + * @description: + * Compute vector coordinates from a length and angle. + * + * @output: + * vec :: + * The address of source vector. + * + * @input: + * length :: + * The vector length. + * + * angle :: + * The vector angle. + * + */ + FT_EXPORT( void ) + FT_Vector_From_Polar( FT_Vector* vec, + FT_Fixed length, + FT_Angle angle ); + + /* */ + + +FT_END_HEADER + +#endif /* __FTTRIGON_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/fttypes.h b/portlibs/include/freetype/fttypes.h new file mode 100644 index 00000000..54f08e3e --- /dev/null +++ b/portlibs/include/freetype/fttypes.h @@ -0,0 +1,587 @@ +/***************************************************************************/ +/* */ +/* fttypes.h */ +/* */ +/* FreeType simple types definitions (specification only). */ +/* */ +/* Copyright 1996-2001, 2002, 2004, 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTTYPES_H__ +#define __FTTYPES_H__ + + +#include <ft2build.h> +#include FT_CONFIG_CONFIG_H +#include FT_SYSTEM_H +#include FT_IMAGE_H + +#include <stddef.h> + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* basic_types */ + /* */ + /* <Title> */ + /* Basic Data Types */ + /* */ + /* <Abstract> */ + /* The basic data types defined by the library. */ + /* */ + /* <Description> */ + /* This section contains the basic data types defined by FreeType~2, */ + /* ranging from simple scalar types to bitmap descriptors. More */ + /* font-specific structures are defined in a different section. */ + /* */ + /* <Order> */ + /* FT_Byte */ + /* FT_Bytes */ + /* FT_Char */ + /* FT_Int */ + /* FT_UInt */ + /* FT_Int16 */ + /* FT_UInt16 */ + /* FT_Int32 */ + /* FT_UInt32 */ + /* FT_Short */ + /* FT_UShort */ + /* FT_Long */ + /* FT_ULong */ + /* FT_Bool */ + /* FT_Offset */ + /* FT_PtrDist */ + /* FT_String */ + /* FT_Tag */ + /* FT_Error */ + /* FT_Fixed */ + /* FT_Pointer */ + /* FT_Pos */ + /* FT_Vector */ + /* FT_BBox */ + /* FT_Matrix */ + /* FT_FWord */ + /* FT_UFWord */ + /* FT_F2Dot14 */ + /* FT_UnitVector */ + /* FT_F26Dot6 */ + /* */ + /* */ + /* FT_Generic */ + /* FT_Generic_Finalizer */ + /* */ + /* FT_Bitmap */ + /* FT_Pixel_Mode */ + /* FT_Palette_Mode */ + /* FT_Glyph_Format */ + /* FT_IMAGE_TAG */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Bool */ + /* */ + /* <Description> */ + /* A typedef of unsigned char, used for simple booleans. As usual, */ + /* values 1 and~0 represent true and false, respectively. */ + /* */ + typedef unsigned char FT_Bool; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_FWord */ + /* */ + /* <Description> */ + /* A signed 16-bit integer used to store a distance in original font */ + /* units. */ + /* */ + typedef signed short FT_FWord; /* distance in FUnits */ + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_UFWord */ + /* */ + /* <Description> */ + /* An unsigned 16-bit integer used to store a distance in original */ + /* font units. */ + /* */ + typedef unsigned short FT_UFWord; /* unsigned distance */ + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Char */ + /* */ + /* <Description> */ + /* A simple typedef for the _signed_ char type. */ + /* */ + typedef signed char FT_Char; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Byte */ + /* */ + /* <Description> */ + /* A simple typedef for the _unsigned_ char type. */ + /* */ + typedef unsigned char FT_Byte; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Bytes */ + /* */ + /* <Description> */ + /* A typedef for constant memory areas. */ + /* */ + typedef const FT_Byte* FT_Bytes; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Tag */ + /* */ + /* <Description> */ + /* A typedef for 32-bit tags (as used in the SFNT format). */ + /* */ + typedef FT_UInt32 FT_Tag; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_String */ + /* */ + /* <Description> */ + /* A simple typedef for the char type, usually used for strings. */ + /* */ + typedef char FT_String; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Short */ + /* */ + /* <Description> */ + /* A typedef for signed short. */ + /* */ + typedef signed short FT_Short; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_UShort */ + /* */ + /* <Description> */ + /* A typedef for unsigned short. */ + /* */ + typedef unsigned short FT_UShort; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Int */ + /* */ + /* <Description> */ + /* A typedef for the int type. */ + /* */ + typedef signed int FT_Int; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_UInt */ + /* */ + /* <Description> */ + /* A typedef for the unsigned int type. */ + /* */ + typedef unsigned int FT_UInt; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Long */ + /* */ + /* <Description> */ + /* A typedef for signed long. */ + /* */ + typedef signed long FT_Long; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_ULong */ + /* */ + /* <Description> */ + /* A typedef for unsigned long. */ + /* */ + typedef unsigned long FT_ULong; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_F2Dot14 */ + /* */ + /* <Description> */ + /* A signed 2.14 fixed float type used for unit vectors. */ + /* */ + typedef signed short FT_F2Dot14; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_F26Dot6 */ + /* */ + /* <Description> */ + /* A signed 26.6 fixed float type used for vectorial pixel */ + /* coordinates. */ + /* */ + typedef signed long FT_F26Dot6; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Fixed */ + /* */ + /* <Description> */ + /* This type is used to store 16.16 fixed float values, like scaling */ + /* values or matrix coefficients. */ + /* */ + typedef signed long FT_Fixed; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Error */ + /* */ + /* <Description> */ + /* The FreeType error code type. A value of~0 is always interpreted */ + /* as a successful operation. */ + /* */ + typedef int FT_Error; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Pointer */ + /* */ + /* <Description> */ + /* A simple typedef for a typeless pointer. */ + /* */ + typedef void* FT_Pointer; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_Offset */ + /* */ + /* <Description> */ + /* This is equivalent to the ANSI~C `size_t' type, i.e., the largest */ + /* _unsigned_ integer type used to express a file size or position, */ + /* or a memory block size. */ + /* */ + typedef size_t FT_Offset; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_PtrDist */ + /* */ + /* <Description> */ + /* This is equivalent to the ANSI~C `ptrdiff_t' type, i.e., the */ + /* largest _signed_ integer type used to express the distance */ + /* between two pointers. */ + /* */ + typedef ft_ptrdiff_t FT_PtrDist; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_UnitVector */ + /* */ + /* <Description> */ + /* A simple structure used to store a 2D vector unit vector. Uses */ + /* FT_F2Dot14 types. */ + /* */ + /* <Fields> */ + /* x :: Horizontal coordinate. */ + /* */ + /* y :: Vertical coordinate. */ + /* */ + typedef struct FT_UnitVector_ + { + FT_F2Dot14 x; + FT_F2Dot14 y; + + } FT_UnitVector; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Matrix */ + /* */ + /* <Description> */ + /* A simple structure used to store a 2x2 matrix. Coefficients are */ + /* in 16.16 fixed float format. The computation performed is: */ + /* */ + /* { */ + /* x' = x*xx + y*xy */ + /* y' = x*yx + y*yy */ + /* } */ + /* */ + /* <Fields> */ + /* xx :: Matrix coefficient. */ + /* */ + /* xy :: Matrix coefficient. */ + /* */ + /* yx :: Matrix coefficient. */ + /* */ + /* yy :: Matrix coefficient. */ + /* */ + typedef struct FT_Matrix_ + { + FT_Fixed xx, xy; + FT_Fixed yx, yy; + + } FT_Matrix; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Data */ + /* */ + /* <Description> */ + /* Read-only binary data represented as a pointer and a length. */ + /* */ + /* <Fields> */ + /* pointer :: The data. */ + /* */ + /* length :: The length of the data in bytes. */ + /* */ + typedef struct FT_Data_ + { + const FT_Byte* pointer; + FT_Int length; + + } FT_Data; + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_Generic_Finalizer */ + /* */ + /* <Description> */ + /* Describe a function used to destroy the `client' data of any */ + /* FreeType object. See the description of the @FT_Generic type for */ + /* details of usage. */ + /* */ + /* <Input> */ + /* The address of the FreeType object which is under finalization. */ + /* Its client data is accessed through its `generic' field. */ + /* */ + typedef void (*FT_Generic_Finalizer)(void* object); + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Generic */ + /* */ + /* <Description> */ + /* Client applications often need to associate their own data to a */ + /* variety of FreeType core objects. For example, a text layout API */ + /* might want to associate a glyph cache to a given size object. */ + /* */ + /* Most FreeType object contains a `generic' field, of type */ + /* FT_Generic, which usage is left to client applications and font */ + /* servers. */ + /* */ + /* It can be used to store a pointer to client-specific data, as well */ + /* as the address of a `finalizer' function, which will be called by */ + /* FreeType when the object is destroyed (for example, the previous */ + /* client example would put the address of the glyph cache destructor */ + /* in the `finalizer' field). */ + /* */ + /* <Fields> */ + /* data :: A typeless pointer to any client-specified data. This */ + /* field is completely ignored by the FreeType library. */ + /* */ + /* finalizer :: A pointer to a `generic finalizer' function, which */ + /* will be called when the object is destroyed. If this */ + /* field is set to NULL, no code will be called. */ + /* */ + typedef struct FT_Generic_ + { + void* data; + FT_Generic_Finalizer finalizer; + + } FT_Generic; + + + /*************************************************************************/ + /* */ + /* <Macro> */ + /* FT_MAKE_TAG */ + /* */ + /* <Description> */ + /* This macro converts four-letter tags which are used to label */ + /* TrueType tables into an unsigned long to be used within FreeType. */ + /* */ + /* <Note> */ + /* The produced values *must* be 32-bit integers. Don't redefine */ + /* this macro. */ + /* */ +#define FT_MAKE_TAG( _x1, _x2, _x3, _x4 ) \ + ( ( (FT_ULong)_x1 << 24 ) | \ + ( (FT_ULong)_x2 << 16 ) | \ + ( (FT_ULong)_x3 << 8 ) | \ + (FT_ULong)_x4 ) + + + /*************************************************************************/ + /*************************************************************************/ + /* */ + /* L I S T M A N A G E M E N T */ + /* */ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* list_processing */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_ListNode */ + /* */ + /* <Description> */ + /* Many elements and objects in FreeType are listed through an */ + /* @FT_List record (see @FT_ListRec). As its name suggests, an */ + /* FT_ListNode is a handle to a single list element. */ + /* */ + typedef struct FT_ListNodeRec_* FT_ListNode; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* FT_List */ + /* */ + /* <Description> */ + /* A handle to a list record (see @FT_ListRec). */ + /* */ + typedef struct FT_ListRec_* FT_List; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_ListNodeRec */ + /* */ + /* <Description> */ + /* A structure used to hold a single list element. */ + /* */ + /* <Fields> */ + /* prev :: The previous element in the list. NULL if first. */ + /* */ + /* next :: The next element in the list. NULL if last. */ + /* */ + /* data :: A typeless pointer to the listed object. */ + /* */ + typedef struct FT_ListNodeRec_ + { + FT_ListNode prev; + FT_ListNode next; + void* data; + + } FT_ListNodeRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_ListRec */ + /* */ + /* <Description> */ + /* A structure used to hold a simple doubly-linked list. These are */ + /* used in many parts of FreeType. */ + /* */ + /* <Fields> */ + /* head :: The head (first element) of doubly-linked list. */ + /* */ + /* tail :: The tail (last element) of doubly-linked list. */ + /* */ + typedef struct FT_ListRec_ + { + FT_ListNode head; + FT_ListNode tail; + + } FT_ListRec; + + + /* */ + +#define FT_IS_EMPTY( list ) ( (list).head == 0 ) + + /* return base error code (without module-specific prefix) */ +#define FT_ERROR_BASE( x ) ( (x) & 0xFF ) + + /* return module error code */ +#define FT_ERROR_MODULE( x ) ( (x) & 0xFF00U ) + +#define FT_BOOL( x ) ( (FT_Bool)( x ) ) + +FT_END_HEADER + +#endif /* __FTTYPES_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ftwinfnt.h b/portlibs/include/freetype/ftwinfnt.h new file mode 100644 index 00000000..ea333535 --- /dev/null +++ b/portlibs/include/freetype/ftwinfnt.h @@ -0,0 +1,274 @@ +/***************************************************************************/ +/* */ +/* ftwinfnt.h */ +/* */ +/* FreeType API for accessing Windows fnt-specific data. */ +/* */ +/* Copyright 2003, 2004, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTWINFNT_H__ +#define __FTWINFNT_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* winfnt_fonts */ + /* */ + /* <Title> */ + /* Window FNT Files */ + /* */ + /* <Abstract> */ + /* Windows FNT specific API. */ + /* */ + /* <Description> */ + /* This section contains the declaration of Windows FNT specific */ + /* functions. */ + /* */ + /*************************************************************************/ + + + /************************************************************************* + * + * @enum: + * FT_WinFNT_ID_XXX + * + * @description: + * A list of valid values for the `charset' byte in + * @FT_WinFNT_HeaderRec. Exact mapping tables for the various cpXXXX + * encodings (except for cp1361) can be found at ftp://ftp.unicode.org + * in the MAPPINGS/VENDORS/MICSFT/WINDOWS subdirectory. cp1361 is + * roughly a superset of MAPPINGS/OBSOLETE/EASTASIA/KSC/JOHAB.TXT. + * + * @values: + * FT_WinFNT_ID_DEFAULT :: + * This is used for font enumeration and font creation as a + * `don't care' value. Valid font files don't contain this value. + * When querying for information about the character set of the font + * that is currently selected into a specified device context, this + * return value (of the related Windows API) simply denotes failure. + * + * FT_WinFNT_ID_SYMBOL :: + * There is no known mapping table available. + * + * FT_WinFNT_ID_MAC :: + * Mac Roman encoding. + * + * FT_WinFNT_ID_OEM :: + * From Michael Pöttgen <michael@poettgen.de>: + * + * The `Windows Font Mapping' article says that FT_WinFNT_ID_OEM + * is used for the charset of vector fonts, like `modern.fon', + * `roman.fon', and `script.fon' on Windows. + * + * The `CreateFont' documentation says: The FT_WinFNT_ID_OEM value + * specifies a character set that is operating-system dependent. + * + * The `IFIMETRICS' documentation from the `Windows Driver + * Development Kit' says: This font supports an OEM-specific + * character set. The OEM character set is system dependent. + * + * In general OEM, as opposed to ANSI (i.e., cp1252), denotes the + * second default codepage that most international versions of + * Windows have. It is one of the OEM codepages from + * + * http://www.microsoft.com/globaldev/reference/cphome.mspx, + * + * and is used for the `DOS boxes', to support legacy applications. + * A German Windows version for example usually uses ANSI codepage + * 1252 and OEM codepage 850. + * + * FT_WinFNT_ID_CP874 :: + * A superset of Thai TIS 620 and ISO 8859-11. + * + * FT_WinFNT_ID_CP932 :: + * A superset of Japanese Shift-JIS (with minor deviations). + * + * FT_WinFNT_ID_CP936 :: + * A superset of simplified Chinese GB 2312-1980 (with different + * ordering and minor deviations). + * + * FT_WinFNT_ID_CP949 :: + * A superset of Korean Hangul KS~C 5601-1987 (with different + * ordering and minor deviations). + * + * FT_WinFNT_ID_CP950 :: + * A superset of traditional Chinese Big~5 ETen (with different + * ordering and minor deviations). + * + * FT_WinFNT_ID_CP1250 :: + * A superset of East European ISO 8859-2 (with slightly different + * ordering). + * + * FT_WinFNT_ID_CP1251 :: + * A superset of Russian ISO 8859-5 (with different ordering). + * + * FT_WinFNT_ID_CP1252 :: + * ANSI encoding. A superset of ISO 8859-1. + * + * FT_WinFNT_ID_CP1253 :: + * A superset of Greek ISO 8859-7 (with minor modifications). + * + * FT_WinFNT_ID_CP1254 :: + * A superset of Turkish ISO 8859-9. + * + * FT_WinFNT_ID_CP1255 :: + * A superset of Hebrew ISO 8859-8 (with some modifications). + * + * FT_WinFNT_ID_CP1256 :: + * A superset of Arabic ISO 8859-6 (with different ordering). + * + * FT_WinFNT_ID_CP1257 :: + * A superset of Baltic ISO 8859-13 (with some deviations). + * + * FT_WinFNT_ID_CP1258 :: + * For Vietnamese. This encoding doesn't cover all necessary + * characters. + * + * FT_WinFNT_ID_CP1361 :: + * Korean (Johab). + */ + +#define FT_WinFNT_ID_CP1252 0 +#define FT_WinFNT_ID_DEFAULT 1 +#define FT_WinFNT_ID_SYMBOL 2 +#define FT_WinFNT_ID_MAC 77 +#define FT_WinFNT_ID_CP932 128 +#define FT_WinFNT_ID_CP949 129 +#define FT_WinFNT_ID_CP1361 130 +#define FT_WinFNT_ID_CP936 134 +#define FT_WinFNT_ID_CP950 136 +#define FT_WinFNT_ID_CP1253 161 +#define FT_WinFNT_ID_CP1254 162 +#define FT_WinFNT_ID_CP1258 163 +#define FT_WinFNT_ID_CP1255 177 +#define FT_WinFNT_ID_CP1256 178 +#define FT_WinFNT_ID_CP1257 186 +#define FT_WinFNT_ID_CP1251 204 +#define FT_WinFNT_ID_CP874 222 +#define FT_WinFNT_ID_CP1250 238 +#define FT_WinFNT_ID_OEM 255 + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_WinFNT_HeaderRec */ + /* */ + /* <Description> */ + /* Windows FNT Header info. */ + /* */ + typedef struct FT_WinFNT_HeaderRec_ + { + FT_UShort version; + FT_ULong file_size; + FT_Byte copyright[60]; + FT_UShort file_type; + FT_UShort nominal_point_size; + FT_UShort vertical_resolution; + FT_UShort horizontal_resolution; + FT_UShort ascent; + FT_UShort internal_leading; + FT_UShort external_leading; + FT_Byte italic; + FT_Byte underline; + FT_Byte strike_out; + FT_UShort weight; + FT_Byte charset; + FT_UShort pixel_width; + FT_UShort pixel_height; + FT_Byte pitch_and_family; + FT_UShort avg_width; + FT_UShort max_width; + FT_Byte first_char; + FT_Byte last_char; + FT_Byte default_char; + FT_Byte break_char; + FT_UShort bytes_per_row; + FT_ULong device_offset; + FT_ULong face_name_offset; + FT_ULong bits_pointer; + FT_ULong bits_offset; + FT_Byte reserved; + FT_ULong flags; + FT_UShort A_space; + FT_UShort B_space; + FT_UShort C_space; + FT_UShort color_table_offset; + FT_ULong reserved1[4]; + + } FT_WinFNT_HeaderRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_WinFNT_Header */ + /* */ + /* <Description> */ + /* A handle to an @FT_WinFNT_HeaderRec structure. */ + /* */ + typedef struct FT_WinFNT_HeaderRec_* FT_WinFNT_Header; + + + /********************************************************************** + * + * @function: + * FT_Get_WinFNT_Header + * + * @description: + * Retrieve a Windows FNT font info header. + * + * @input: + * face :: A handle to the input face. + * + * @output: + * aheader :: The WinFNT header. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * This function only works with Windows FNT faces, returning an error + * otherwise. + */ + FT_EXPORT( FT_Error ) + FT_Get_WinFNT_Header( FT_Face face, + FT_WinFNT_HeaderRec *aheader ); + + + /* */ + +FT_END_HEADER + +#endif /* __FTWINFNT_H__ */ + + +/* END */ + + +/* Local Variables: */ +/* coding: utf-8 */ +/* End: */ diff --git a/portlibs/include/freetype/ftxf86.h b/portlibs/include/freetype/ftxf86.h new file mode 100644 index 00000000..ae9ff076 --- /dev/null +++ b/portlibs/include/freetype/ftxf86.h @@ -0,0 +1,80 @@ +/***************************************************************************/ +/* */ +/* ftxf86.h */ +/* */ +/* Support functions for X11. */ +/* */ +/* Copyright 2002, 2003, 2004, 2006, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTXF86_H__ +#define __FTXF86_H__ + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* font_formats */ + /* */ + /* <Title> */ + /* Font Formats */ + /* */ + /* <Abstract> */ + /* Getting the font format. */ + /* */ + /* <Description> */ + /* The single function in this section can be used to get the font */ + /* format. Note that this information is not needed normally; */ + /* however, there are special cases (like in PDF devices) where it is */ + /* important to differentiate, in spite of FreeType's uniform API. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_X11_Font_Format */ + /* */ + /* <Description> */ + /* Return a string describing the format of a given face, using values */ + /* which can be used as an X11 FONT_PROPERTY. Possible values are */ + /* `TrueType', `Type~1', `BDF', `PCF', `Type~42', `CID~Type~1', `CFF', */ + /* `PFR', and `Windows~FNT'. */ + /* */ + /* <Input> */ + /* face :: */ + /* Input face handle. */ + /* */ + /* <Return> */ + /* Font format string. NULL in case of error. */ + /* */ + FT_EXPORT( const char* ) + FT_Get_X11_Font_Format( FT_Face face ); + + /* */ + +FT_END_HEADER + +#endif /* __FTXF86_H__ */ diff --git a/portlibs/include/freetype/internal/autohint.h b/portlibs/include/freetype/internal/autohint.h new file mode 100644 index 00000000..ee004022 --- /dev/null +++ b/portlibs/include/freetype/internal/autohint.h @@ -0,0 +1,205 @@ +/***************************************************************************/ +/* */ +/* autohint.h */ +/* */ +/* High-level `autohint' module-specific interface (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* The auto-hinter is used to load and automatically hint glyphs if a */ + /* format-specific hinter isn't available. */ + /* */ + /*************************************************************************/ + + +#ifndef __AUTOHINT_H__ +#define __AUTOHINT_H__ + + + /*************************************************************************/ + /* */ + /* A small technical note regarding automatic hinting in order to */ + /* clarify this module interface. */ + /* */ + /* An automatic hinter might compute two kinds of data for a given face: */ + /* */ + /* - global hints: Usually some metrics that describe global properties */ + /* of the face. It is computed by scanning more or less */ + /* aggressively the glyphs in the face, and thus can be */ + /* very slow to compute (even if the size of global */ + /* hints is really small). */ + /* */ + /* - glyph hints: These describe some important features of the glyph */ + /* outline, as well as how to align them. They are */ + /* generally much faster to compute than global hints. */ + /* */ + /* The current FreeType auto-hinter does a pretty good job while */ + /* performing fast computations for both global and glyph hints. */ + /* However, we might be interested in introducing more complex and */ + /* powerful algorithms in the future, like the one described in the John */ + /* D. Hobby paper, which unfortunately requires a lot more horsepower. */ + /* */ + /* Because a sufficiently sophisticated font management system would */ + /* typically implement an LRU cache of opened face objects to reduce */ + /* memory usage, it is a good idea to be able to avoid recomputing */ + /* global hints every time the same face is re-opened. */ + /* */ + /* We thus provide the ability to cache global hints outside of the face */ + /* object, in order to speed up font re-opening time. Of course, this */ + /* feature is purely optional, so most client programs won't even notice */ + /* it. */ + /* */ + /* I initially thought that it would be a good idea to cache the glyph */ + /* hints too. However, my general idea now is that if you really need */ + /* to cache these too, you are simply in need of a new font format, */ + /* where all this information could be stored within the font file and */ + /* decoded on the fly. */ + /* */ + /*************************************************************************/ + + +#include <ft2build.h> +#include FT_FREETYPE_H + + +FT_BEGIN_HEADER + + + typedef struct FT_AutoHinterRec_ *FT_AutoHinter; + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_AutoHinter_GlobalGetFunc */ + /* */ + /* <Description> */ + /* Retrieves the global hints computed for a given face object the */ + /* resulting data is dissociated from the face and will survive a */ + /* call to FT_Done_Face(). It must be discarded through the API */ + /* FT_AutoHinter_GlobalDoneFunc(). */ + /* */ + /* <Input> */ + /* hinter :: A handle to the source auto-hinter. */ + /* */ + /* face :: A handle to the source face object. */ + /* */ + /* <Output> */ + /* global_hints :: A typeless pointer to the global hints. */ + /* */ + /* global_len :: The size in bytes of the global hints. */ + /* */ + typedef void + (*FT_AutoHinter_GlobalGetFunc)( FT_AutoHinter hinter, + FT_Face face, + void** global_hints, + long* global_len ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_AutoHinter_GlobalDoneFunc */ + /* */ + /* <Description> */ + /* Discards the global hints retrieved through */ + /* FT_AutoHinter_GlobalGetFunc(). This is the only way these hints */ + /* are freed from memory. */ + /* */ + /* <Input> */ + /* hinter :: A handle to the auto-hinter module. */ + /* */ + /* global :: A pointer to retrieved global hints to discard. */ + /* */ + typedef void + (*FT_AutoHinter_GlobalDoneFunc)( FT_AutoHinter hinter, + void* global ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_AutoHinter_GlobalResetFunc */ + /* */ + /* <Description> */ + /* This function is used to recompute the global metrics in a given */ + /* font. This is useful when global font data changes (e.g. Multiple */ + /* Masters fonts where blend coordinates change). */ + /* */ + /* <Input> */ + /* hinter :: A handle to the source auto-hinter. */ + /* */ + /* face :: A handle to the face. */ + /* */ + typedef void + (*FT_AutoHinter_GlobalResetFunc)( FT_AutoHinter hinter, + FT_Face face ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* FT_AutoHinter_GlyphLoadFunc */ + /* */ + /* <Description> */ + /* This function is used to load, scale, and automatically hint a */ + /* glyph from a given face. */ + /* */ + /* <Input> */ + /* face :: A handle to the face. */ + /* */ + /* glyph_index :: The glyph index. */ + /* */ + /* load_flags :: The load flags. */ + /* */ + /* <Note> */ + /* This function is capable of loading composite glyphs by hinting */ + /* each sub-glyph independently (which improves quality). */ + /* */ + /* It will call the font driver with FT_Load_Glyph(), with */ + /* FT_LOAD_NO_SCALE set. */ + /* */ + typedef FT_Error + (*FT_AutoHinter_GlyphLoadFunc)( FT_AutoHinter hinter, + FT_GlyphSlot slot, + FT_Size size, + FT_UInt glyph_index, + FT_Int32 load_flags ); + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_AutoHinter_ServiceRec */ + /* */ + /* <Description> */ + /* The auto-hinter module's interface. */ + /* */ + typedef struct FT_AutoHinter_ServiceRec_ + { + FT_AutoHinter_GlobalResetFunc reset_face; + FT_AutoHinter_GlobalGetFunc get_global_hints; + FT_AutoHinter_GlobalDoneFunc done_global_hints; + FT_AutoHinter_GlyphLoadFunc load_glyph; + + } FT_AutoHinter_ServiceRec, *FT_AutoHinter_Service; + + +FT_END_HEADER + +#endif /* __AUTOHINT_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/ftcalc.h b/portlibs/include/freetype/internal/ftcalc.h new file mode 100644 index 00000000..58def34c --- /dev/null +++ b/portlibs/include/freetype/internal/ftcalc.h @@ -0,0 +1,178 @@ +/***************************************************************************/ +/* */ +/* ftcalc.h */ +/* */ +/* Arithmetic computations (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2005, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTCALC_H__ +#define __FTCALC_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_FixedSqrt */ + /* */ + /* <Description> */ + /* Computes the square root of a 16.16 fixed point value. */ + /* */ + /* <Input> */ + /* x :: The value to compute the root for. */ + /* */ + /* <Return> */ + /* The result of `sqrt(x)'. */ + /* */ + /* <Note> */ + /* This function is not very fast. */ + /* */ + FT_BASE( FT_Int32 ) + FT_SqrtFixed( FT_Int32 x ); + + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Sqrt32 */ + /* */ + /* <Description> */ + /* Computes the square root of an Int32 integer (which will be */ + /* handled as an unsigned long value). */ + /* */ + /* <Input> */ + /* x :: The value to compute the root for. */ + /* */ + /* <Return> */ + /* The result of `sqrt(x)'. */ + /* */ + FT_EXPORT( FT_Int32 ) + FT_Sqrt32( FT_Int32 x ); + +#endif /* FT_CONFIG_OPTION_OLD_INTERNALS */ + + + /*************************************************************************/ + /* */ + /* FT_MulDiv() and FT_MulFix() are declared in freetype.h. */ + /* */ + /*************************************************************************/ + + +#ifdef TT_USE_BYTECODE_INTERPRETER + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_MulDiv_No_Round */ + /* */ + /* <Description> */ + /* A very simple function used to perform the computation `(a*b)/c' */ + /* (without rounding) with maximal accuracy (it uses a 64-bit */ + /* intermediate integer whenever necessary). */ + /* */ + /* This function isn't necessarily as fast as some processor specific */ + /* operations, but is at least completely portable. */ + /* */ + /* <Input> */ + /* a :: The first multiplier. */ + /* b :: The second multiplier. */ + /* c :: The divisor. */ + /* */ + /* <Return> */ + /* The result of `(a*b)/c'. This function never traps when trying to */ + /* divide by zero; it simply returns `MaxInt' or `MinInt' depending */ + /* on the signs of `a' and `b'. */ + /* */ + FT_BASE( FT_Long ) + FT_MulDiv_No_Round( FT_Long a, + FT_Long b, + FT_Long c ); + +#endif /* TT_USE_BYTECODE_INTERPRETER */ + + + /* + * A variant of FT_Matrix_Multiply which scales its result afterwards. + * The idea is that both `a' and `b' are scaled by factors of 10 so that + * the values are as precise as possible to get a correct result during + * the 64bit multiplication. Let `sa' and `sb' be the scaling factors of + * `a' and `b', respectively, then the scaling factor of the result is + * `sa*sb'. + */ + FT_BASE( void ) + FT_Matrix_Multiply_Scaled( const FT_Matrix* a, + FT_Matrix *b, + FT_Long scaling ); + + + /* + * A variant of FT_Vector_Transform. See comments for + * FT_Matrix_Multiply_Scaled. + */ + + FT_BASE( void ) + FT_Vector_Transform_Scaled( FT_Vector* vector, + const FT_Matrix* matrix, + FT_Long scaling ); + + + /* + * Return -1, 0, or +1, depending on the orientation of a given corner. + * We use the Cartesian coordinate system, with positive vertical values + * going upwards. The function returns +1 if the corner turns to the + * left, -1 to the right, and 0 for undecidable cases. + */ + FT_BASE( FT_Int ) + ft_corner_orientation( FT_Pos in_x, + FT_Pos in_y, + FT_Pos out_x, + FT_Pos out_y ); + + /* + * Return TRUE if a corner is flat or nearly flat. This is equivalent to + * saying that the angle difference between the `in' and `out' vectors is + * very small. + */ + FT_BASE( FT_Int ) + ft_corner_is_flat( FT_Pos in_x, + FT_Pos in_y, + FT_Pos out_x, + FT_Pos out_y ); + + +#define INT_TO_F26DOT6( x ) ( (FT_Long)(x) << 6 ) +#define INT_TO_F2DOT14( x ) ( (FT_Long)(x) << 14 ) +#define INT_TO_FIXED( x ) ( (FT_Long)(x) << 16 ) +#define F2DOT14_TO_FIXED( x ) ( (FT_Long)(x) << 2 ) +#define FLOAT_TO_FIXED( x ) ( (FT_Long)( x * 65536.0 ) ) + +#define ROUND_F26DOT6( x ) ( x >= 0 ? ( ( (x) + 32 ) & -64 ) \ + : ( -( ( 32 - (x) ) & -64 ) ) ) + + +FT_END_HEADER + +#endif /* __FTCALC_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/ftdebug.h b/portlibs/include/freetype/internal/ftdebug.h new file mode 100644 index 00000000..7baae353 --- /dev/null +++ b/portlibs/include/freetype/internal/ftdebug.h @@ -0,0 +1,250 @@ +/***************************************************************************/ +/* */ +/* ftdebug.h */ +/* */ +/* Debugging and logging component (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2004, 2006, 2007, 2008, 2009 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/* */ +/* IMPORTANT: A description of FreeType's debugging support can be */ +/* found in `docs/DEBUG.TXT'. Read it if you need to use or */ +/* understand this code. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTDEBUG_H__ +#define __FTDEBUG_H__ + + +#include <ft2build.h> +#include FT_CONFIG_CONFIG_H +#include FT_FREETYPE_H + + +FT_BEGIN_HEADER + + + /* force the definition of FT_DEBUG_LEVEL_ERROR if FT_DEBUG_LEVEL_TRACE */ + /* is already defined; this simplifies the following #ifdefs */ + /* */ +#ifdef FT_DEBUG_LEVEL_TRACE +#undef FT_DEBUG_LEVEL_ERROR +#define FT_DEBUG_LEVEL_ERROR +#endif + + + /*************************************************************************/ + /* */ + /* Define the trace enums as well as the trace levels array when they */ + /* are needed. */ + /* */ + /*************************************************************************/ + +#ifdef FT_DEBUG_LEVEL_TRACE + +#define FT_TRACE_DEF( x ) trace_ ## x , + + /* defining the enumeration */ + typedef enum FT_Trace_ + { +#include FT_INTERNAL_TRACE_H + trace_count + + } FT_Trace; + + + /* defining the array of trace levels, provided by `src/base/ftdebug.c' */ + extern int ft_trace_levels[trace_count]; + +#undef FT_TRACE_DEF + +#endif /* FT_DEBUG_LEVEL_TRACE */ + + + /*************************************************************************/ + /* */ + /* Define the FT_TRACE macro */ + /* */ + /* IMPORTANT! */ + /* */ + /* Each component must define the macro FT_COMPONENT to a valid FT_Trace */ + /* value before using any TRACE macro. */ + /* */ + /*************************************************************************/ + +#ifdef FT_DEBUG_LEVEL_TRACE + +#define FT_TRACE( level, varformat ) \ + do \ + { \ + if ( ft_trace_levels[FT_COMPONENT] >= level ) \ + FT_Message varformat; \ + } while ( 0 ) + +#else /* !FT_DEBUG_LEVEL_TRACE */ + +#define FT_TRACE( level, varformat ) do { } while ( 0 ) /* nothing */ + +#endif /* !FT_DEBUG_LEVEL_TRACE */ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Trace_Get_Count */ + /* */ + /* <Description> */ + /* Return the number of available trace components. */ + /* */ + /* <Return> */ + /* The number of trace components. 0 if FreeType 2 is not built with */ + /* FT_DEBUG_LEVEL_TRACE definition. */ + /* */ + /* <Note> */ + /* This function may be useful if you want to access elements of */ + /* the internal `ft_trace_levels' array by an index. */ + /* */ + FT_BASE( FT_Int ) + FT_Trace_Get_Count( void ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Trace_Get_Name */ + /* */ + /* <Description> */ + /* Return the name of a trace component. */ + /* */ + /* <Input> */ + /* The index of the trace component. */ + /* */ + /* <Return> */ + /* The name of the trace component. This is a statically allocated */ + /* C string, so do not free it after use. NULL if FreeType 2 is not */ + /* built with FT_DEBUG_LEVEL_TRACE definition. */ + /* */ + /* <Note> */ + /* Use @FT_Trace_Get_Count to get the number of available trace */ + /* components. */ + /* */ + /* This function may be useful if you want to control FreeType 2's */ + /* debug level in your application. */ + /* */ + FT_BASE( const char * ) + FT_Trace_Get_Name( FT_Int idx ); + + + /*************************************************************************/ + /* */ + /* You need two opening and closing parentheses! */ + /* */ + /* Example: FT_TRACE0(( "Value is %i", foo )) */ + /* */ + /* Output of the FT_TRACEX macros is sent to stderr. */ + /* */ + /*************************************************************************/ + +#define FT_TRACE0( varformat ) FT_TRACE( 0, varformat ) +#define FT_TRACE1( varformat ) FT_TRACE( 1, varformat ) +#define FT_TRACE2( varformat ) FT_TRACE( 2, varformat ) +#define FT_TRACE3( varformat ) FT_TRACE( 3, varformat ) +#define FT_TRACE4( varformat ) FT_TRACE( 4, varformat ) +#define FT_TRACE5( varformat ) FT_TRACE( 5, varformat ) +#define FT_TRACE6( varformat ) FT_TRACE( 6, varformat ) +#define FT_TRACE7( varformat ) FT_TRACE( 7, varformat ) + + + /*************************************************************************/ + /* */ + /* Define the FT_ERROR macro. */ + /* */ + /* Output of this macro is sent to stderr. */ + /* */ + /*************************************************************************/ + +#ifdef FT_DEBUG_LEVEL_ERROR + +#define FT_ERROR( varformat ) FT_Message varformat + +#else /* !FT_DEBUG_LEVEL_ERROR */ + +#define FT_ERROR( varformat ) do { } while ( 0 ) /* nothing */ + +#endif /* !FT_DEBUG_LEVEL_ERROR */ + + + /*************************************************************************/ + /* */ + /* Define the FT_ASSERT macro. */ + /* */ + /*************************************************************************/ + +#ifdef FT_DEBUG_LEVEL_ERROR + +#define FT_ASSERT( condition ) \ + do \ + { \ + if ( !( condition ) ) \ + FT_Panic( "assertion failed on line %d of file %s\n", \ + __LINE__, __FILE__ ); \ + } while ( 0 ) + +#else /* !FT_DEBUG_LEVEL_ERROR */ + +#define FT_ASSERT( condition ) do { } while ( 0 ) + +#endif /* !FT_DEBUG_LEVEL_ERROR */ + + + /*************************************************************************/ + /* */ + /* Define `FT_Message' and `FT_Panic' when needed. */ + /* */ + /*************************************************************************/ + +#ifdef FT_DEBUG_LEVEL_ERROR + +#include "stdio.h" /* for vfprintf() */ + + /* print a message */ + FT_BASE( void ) + FT_Message( const char* fmt, + ... ); + + /* print a message and exit */ + FT_BASE( void ) + FT_Panic( const char* fmt, + ... ); + +#endif /* FT_DEBUG_LEVEL_ERROR */ + + + FT_BASE( void ) + ft_debug_init( void ); + + +#if defined( _MSC_VER ) /* Visual C++ (and Intel C++) */ + + /* We disable the warning `conditional expression is constant' here */ + /* in order to compile cleanly with the maximum level of warnings. */ +#pragma warning( disable : 4127 ) + +#endif /* _MSC_VER */ + + +FT_END_HEADER + +#endif /* __FTDEBUG_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/ftdriver.h b/portlibs/include/freetype/internal/ftdriver.h new file mode 100644 index 00000000..854abad0 --- /dev/null +++ b/portlibs/include/freetype/internal/ftdriver.h @@ -0,0 +1,249 @@ +/***************************************************************************/ +/* */ +/* ftdriver.h */ +/* */ +/* FreeType font driver interface (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTDRIVER_H__ +#define __FTDRIVER_H__ + + +#include <ft2build.h> +#include FT_MODULE_H + + +FT_BEGIN_HEADER + + + typedef FT_Error + (*FT_Face_InitFunc)( FT_Stream stream, + FT_Face face, + FT_Int typeface_index, + FT_Int num_params, + FT_Parameter* parameters ); + + typedef void + (*FT_Face_DoneFunc)( FT_Face face ); + + + typedef FT_Error + (*FT_Size_InitFunc)( FT_Size size ); + + typedef void + (*FT_Size_DoneFunc)( FT_Size size ); + + + typedef FT_Error + (*FT_Slot_InitFunc)( FT_GlyphSlot slot ); + + typedef void + (*FT_Slot_DoneFunc)( FT_GlyphSlot slot ); + + + typedef FT_Error + (*FT_Size_RequestFunc)( FT_Size size, + FT_Size_Request req ); + + typedef FT_Error + (*FT_Size_SelectFunc)( FT_Size size, + FT_ULong size_index ); + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + + typedef FT_Error + (*FT_Size_ResetPointsFunc)( FT_Size size, + FT_F26Dot6 char_width, + FT_F26Dot6 char_height, + FT_UInt horz_resolution, + FT_UInt vert_resolution ); + + typedef FT_Error + (*FT_Size_ResetPixelsFunc)( FT_Size size, + FT_UInt pixel_width, + FT_UInt pixel_height ); + +#endif /* FT_CONFIG_OPTION_OLD_INTERNALS */ + + typedef FT_Error + (*FT_Slot_LoadFunc)( FT_GlyphSlot slot, + FT_Size size, + FT_UInt glyph_index, + FT_Int32 load_flags ); + + + typedef FT_UInt + (*FT_CharMap_CharIndexFunc)( FT_CharMap charmap, + FT_Long charcode ); + + typedef FT_Long + (*FT_CharMap_CharNextFunc)( FT_CharMap charmap, + FT_Long charcode ); + + + typedef FT_Error + (*FT_Face_GetKerningFunc)( FT_Face face, + FT_UInt left_glyph, + FT_UInt right_glyph, + FT_Vector* kerning ); + + + typedef FT_Error + (*FT_Face_AttachFunc)( FT_Face face, + FT_Stream stream ); + + + typedef FT_Error + (*FT_Face_GetAdvancesFunc)( FT_Face face, + FT_UInt first, + FT_UInt count, + FT_Int32 flags, + FT_Fixed* advances ); + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Driver_ClassRec */ + /* */ + /* <Description> */ + /* The font driver class. This structure mostly contains pointers to */ + /* driver methods. */ + /* */ + /* <Fields> */ + /* root :: The parent module. */ + /* */ + /* face_object_size :: The size of a face object in bytes. */ + /* */ + /* size_object_size :: The size of a size object in bytes. */ + /* */ + /* slot_object_size :: The size of a glyph object in bytes. */ + /* */ + /* init_face :: The format-specific face constructor. */ + /* */ + /* done_face :: The format-specific face destructor. */ + /* */ + /* init_size :: The format-specific size constructor. */ + /* */ + /* done_size :: The format-specific size destructor. */ + /* */ + /* init_slot :: The format-specific slot constructor. */ + /* */ + /* done_slot :: The format-specific slot destructor. */ + /* */ + /* */ + /* load_glyph :: A function handle to load a glyph to a slot. */ + /* This field is mandatory! */ + /* */ + /* get_kerning :: A function handle to return the unscaled */ + /* kerning for a given pair of glyphs. Can be */ + /* set to 0 if the format doesn't support */ + /* kerning. */ + /* */ + /* attach_file :: This function handle is used to read */ + /* additional data for a face from another */ + /* file/stream. For example, this can be used to */ + /* add data from AFM or PFM files on a Type 1 */ + /* face, or a CIDMap on a CID-keyed face. */ + /* */ + /* get_advances :: A function handle used to return advance */ + /* widths of `count' glyphs (in font units), */ + /* starting at `first'. The `vertical' flag must */ + /* be set to get vertical advance heights. The */ + /* `advances' buffer is caller-allocated. */ + /* Currently not implemented. The idea of this */ + /* function is to be able to perform */ + /* device-independent text layout without loading */ + /* a single glyph image. */ + /* */ + /* request_size :: A handle to a function used to request the new */ + /* character size. Can be set to 0 if the */ + /* scaling done in the base layer suffices. */ + /* */ + /* select_size :: A handle to a function used to select a new */ + /* fixed size. It is used only if */ + /* @FT_FACE_FLAG_FIXED_SIZES is set. Can be set */ + /* to 0 if the scaling done in the base layer */ + /* suffices. */ + /* <Note> */ + /* Most function pointers, with the exception of `load_glyph', can be */ + /* set to 0 to indicate a default behaviour. */ + /* */ + typedef struct FT_Driver_ClassRec_ + { + FT_Module_Class root; + + FT_Long face_object_size; + FT_Long size_object_size; + FT_Long slot_object_size; + + FT_Face_InitFunc init_face; + FT_Face_DoneFunc done_face; + + FT_Size_InitFunc init_size; + FT_Size_DoneFunc done_size; + + FT_Slot_InitFunc init_slot; + FT_Slot_DoneFunc done_slot; + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + + FT_Size_ResetPointsFunc set_char_sizes; + FT_Size_ResetPixelsFunc set_pixel_sizes; + +#endif /* FT_CONFIG_OPTION_OLD_INTERNALS */ + + FT_Slot_LoadFunc load_glyph; + + FT_Face_GetKerningFunc get_kerning; + FT_Face_AttachFunc attach_file; + FT_Face_GetAdvancesFunc get_advances; + + /* since version 2.2 */ + FT_Size_RequestFunc request_size; + FT_Size_SelectFunc select_size; + + } FT_Driver_ClassRec, *FT_Driver_Class; + + + /* + * The following functions are used as stubs for `set_char_sizes' and + * `set_pixel_sizes'; the code uses `request_size' and `select_size' + * functions instead. + * + * Implementation is in `src/base/ftobjs.c'. + */ +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + + FT_BASE( FT_Error ) + ft_stub_set_char_sizes( FT_Size size, + FT_F26Dot6 width, + FT_F26Dot6 height, + FT_UInt horz_res, + FT_UInt vert_res ); + + FT_BASE( FT_Error ) + ft_stub_set_pixel_sizes( FT_Size size, + FT_UInt width, + FT_UInt height ); + +#endif /* FT_CONFIG_OPTION_OLD_INTERNALS */ + + +FT_END_HEADER + +#endif /* __FTDRIVER_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/ftgloadr.h b/portlibs/include/freetype/internal/ftgloadr.h new file mode 100644 index 00000000..548481ac --- /dev/null +++ b/portlibs/include/freetype/internal/ftgloadr.h @@ -0,0 +1,168 @@ +/***************************************************************************/ +/* */ +/* ftgloadr.h */ +/* */ +/* The FreeType glyph loader (specification). */ +/* */ +/* Copyright 2002, 2003, 2005, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTGLOADR_H__ +#define __FTGLOADR_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_GlyphLoader */ + /* */ + /* <Description> */ + /* The glyph loader is an internal object used to load several glyphs */ + /* together (for example, in the case of composites). */ + /* */ + /* <Note> */ + /* The glyph loader implementation is not part of the high-level API, */ + /* hence the forward structure declaration. */ + /* */ + typedef struct FT_GlyphLoaderRec_* FT_GlyphLoader ; + + +#if 0 /* moved to freetype.h in version 2.2 */ +#define FT_SUBGLYPH_FLAG_ARGS_ARE_WORDS 1 +#define FT_SUBGLYPH_FLAG_ARGS_ARE_XY_VALUES 2 +#define FT_SUBGLYPH_FLAG_ROUND_XY_TO_GRID 4 +#define FT_SUBGLYPH_FLAG_SCALE 8 +#define FT_SUBGLYPH_FLAG_XY_SCALE 0x40 +#define FT_SUBGLYPH_FLAG_2X2 0x80 +#define FT_SUBGLYPH_FLAG_USE_MY_METRICS 0x200 +#endif + + + typedef struct FT_SubGlyphRec_ + { + FT_Int index; + FT_UShort flags; + FT_Int arg1; + FT_Int arg2; + FT_Matrix transform; + + } FT_SubGlyphRec; + + + typedef struct FT_GlyphLoadRec_ + { + FT_Outline outline; /* outline */ + FT_Vector* extra_points; /* extra points table */ + FT_Vector* extra_points2; /* second extra points table */ + FT_UInt num_subglyphs; /* number of subglyphs */ + FT_SubGlyph subglyphs; /* subglyphs */ + + } FT_GlyphLoadRec, *FT_GlyphLoad; + + + typedef struct FT_GlyphLoaderRec_ + { + FT_Memory memory; + FT_UInt max_points; + FT_UInt max_contours; + FT_UInt max_subglyphs; + FT_Bool use_extra; + + FT_GlyphLoadRec base; + FT_GlyphLoadRec current; + + void* other; /* for possible future extension? */ + + } FT_GlyphLoaderRec; + + + /* create new empty glyph loader */ + FT_BASE( FT_Error ) + FT_GlyphLoader_New( FT_Memory memory, + FT_GlyphLoader *aloader ); + + /* add an extra points table to a glyph loader */ + FT_BASE( FT_Error ) + FT_GlyphLoader_CreateExtra( FT_GlyphLoader loader ); + + /* destroy a glyph loader */ + FT_BASE( void ) + FT_GlyphLoader_Done( FT_GlyphLoader loader ); + + /* reset a glyph loader (frees everything int it) */ + FT_BASE( void ) + FT_GlyphLoader_Reset( FT_GlyphLoader loader ); + + /* rewind a glyph loader */ + FT_BASE( void ) + FT_GlyphLoader_Rewind( FT_GlyphLoader loader ); + + /* check that there is enough space to add `n_points' and `n_contours' */ + /* to the glyph loader */ + FT_BASE( FT_Error ) + FT_GlyphLoader_CheckPoints( FT_GlyphLoader loader, + FT_UInt n_points, + FT_UInt n_contours ); + + +#define FT_GLYPHLOADER_CHECK_P( _loader, _count ) \ + ( (_count) == 0 || (int)((_loader)->base.outline.n_points + \ + (_loader)->current.outline.n_points + \ + (_count)) <= (int)(_loader)->max_points ) + +#define FT_GLYPHLOADER_CHECK_C( _loader, _count ) \ + ( (_count) == 0 || (int)((_loader)->base.outline.n_contours + \ + (_loader)->current.outline.n_contours + \ + (_count)) <= (int)(_loader)->max_contours ) + +#define FT_GLYPHLOADER_CHECK_POINTS( _loader, _points,_contours ) \ + ( ( FT_GLYPHLOADER_CHECK_P( _loader, _points ) && \ + FT_GLYPHLOADER_CHECK_C( _loader, _contours ) ) \ + ? 0 \ + : FT_GlyphLoader_CheckPoints( (_loader), (_points), (_contours) ) ) + + + /* check that there is enough space to add `n_subs' sub-glyphs to */ + /* a glyph loader */ + FT_BASE( FT_Error ) + FT_GlyphLoader_CheckSubGlyphs( FT_GlyphLoader loader, + FT_UInt n_subs ); + + /* prepare a glyph loader, i.e. empty the current glyph */ + FT_BASE( void ) + FT_GlyphLoader_Prepare( FT_GlyphLoader loader ); + + /* add the current glyph to the base glyph */ + FT_BASE( void ) + FT_GlyphLoader_Add( FT_GlyphLoader loader ); + + /* copy points from one glyph loader to another */ + FT_BASE( FT_Error ) + FT_GlyphLoader_CopyPoints( FT_GlyphLoader target, + FT_GlyphLoader source ); + + /* */ + + +FT_END_HEADER + +#endif /* __FTGLOADR_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/ftmemory.h b/portlibs/include/freetype/internal/ftmemory.h new file mode 100644 index 00000000..2010ca90 --- /dev/null +++ b/portlibs/include/freetype/internal/ftmemory.h @@ -0,0 +1,368 @@ +/***************************************************************************/ +/* */ +/* ftmemory.h */ +/* */ +/* The FreeType memory management macros (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2004, 2005, 2006, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTMEMORY_H__ +#define __FTMEMORY_H__ + + +#include <ft2build.h> +#include FT_CONFIG_CONFIG_H +#include FT_TYPES_H + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Macro> */ + /* FT_SET_ERROR */ + /* */ + /* <Description> */ + /* This macro is used to set an implicit `error' variable to a given */ + /* expression's value (usually a function call), and convert it to a */ + /* boolean which is set whenever the value is != 0. */ + /* */ +#undef FT_SET_ERROR +#define FT_SET_ERROR( expression ) \ + ( ( error = (expression) ) != 0 ) + + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** ****/ + /**** M E M O R Y ****/ + /**** ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /* + * C++ refuses to handle statements like p = (void*)anything; where `p' + * is a typed pointer. Since we don't have a `typeof' operator in + * standard C++, we have to use ugly casts. + */ + +#ifdef __cplusplus +#define FT_ASSIGNP( p, val ) *((void**)&(p)) = (val) +#else +#define FT_ASSIGNP( p, val ) (p) = (val) +#endif + + + +#ifdef FT_DEBUG_MEMORY + + FT_BASE( const char* ) _ft_debug_file; + FT_BASE( long ) _ft_debug_lineno; + +#define FT_DEBUG_INNER( exp ) ( _ft_debug_file = __FILE__, \ + _ft_debug_lineno = __LINE__, \ + (exp) ) + +#define FT_ASSIGNP_INNER( p, exp ) ( _ft_debug_file = __FILE__, \ + _ft_debug_lineno = __LINE__, \ + FT_ASSIGNP( p, exp ) ) + +#else /* !FT_DEBUG_MEMORY */ + +#define FT_DEBUG_INNER( exp ) (exp) +#define FT_ASSIGNP_INNER( p, exp ) FT_ASSIGNP( p, exp ) + +#endif /* !FT_DEBUG_MEMORY */ + + + /* + * The allocation functions return a pointer, and the error code + * is written to through the `p_error' parameter. See below for + * for documentation. + */ + + FT_BASE( FT_Pointer ) + ft_mem_alloc( FT_Memory memory, + FT_Long size, + FT_Error *p_error ); + + FT_BASE( FT_Pointer ) + ft_mem_qalloc( FT_Memory memory, + FT_Long size, + FT_Error *p_error ); + + FT_BASE( FT_Pointer ) + ft_mem_realloc( FT_Memory memory, + FT_Long item_size, + FT_Long cur_count, + FT_Long new_count, + void* block, + FT_Error *p_error ); + + FT_BASE( FT_Pointer ) + ft_mem_qrealloc( FT_Memory memory, + FT_Long item_size, + FT_Long cur_count, + FT_Long new_count, + void* block, + FT_Error *p_error ); + + FT_BASE( void ) + ft_mem_free( FT_Memory memory, + const void* P ); + + +#define FT_MEM_ALLOC( ptr, size ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_alloc( memory, (size), &error ) ) + +#define FT_MEM_FREE( ptr ) \ + FT_BEGIN_STMNT \ + ft_mem_free( memory, (ptr) ); \ + (ptr) = NULL; \ + FT_END_STMNT + +#define FT_MEM_NEW( ptr ) \ + FT_MEM_ALLOC( ptr, sizeof ( *(ptr) ) ) + +#define FT_MEM_REALLOC( ptr, cursz, newsz ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_realloc( memory, 1, \ + (cursz), (newsz), \ + (ptr), &error ) ) + +#define FT_MEM_QALLOC( ptr, size ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_qalloc( memory, (size), &error ) ) + +#define FT_MEM_QNEW( ptr ) \ + FT_MEM_QALLOC( ptr, sizeof ( *(ptr) ) ) + +#define FT_MEM_QREALLOC( ptr, cursz, newsz ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_qrealloc( memory, 1, \ + (cursz), (newsz), \ + (ptr), &error ) ) + +#define FT_MEM_QRENEW_ARRAY( ptr, cursz, newsz ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_qrealloc( memory, sizeof ( *(ptr) ), \ + (cursz), (newsz), \ + (ptr), &error ) ) + +#define FT_MEM_ALLOC_MULT( ptr, count, item_size ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_realloc( memory, (item_size), \ + 0, (count), \ + NULL, &error ) ) + +#define FT_MEM_REALLOC_MULT( ptr, oldcnt, newcnt, itmsz ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_realloc( memory, (itmsz), \ + (oldcnt), (newcnt), \ + (ptr), &error ) ) + +#define FT_MEM_QALLOC_MULT( ptr, count, item_size ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_qrealloc( memory, (item_size), \ + 0, (count), \ + NULL, &error ) ) + +#define FT_MEM_QREALLOC_MULT( ptr, oldcnt, newcnt, itmsz) \ + FT_ASSIGNP_INNER( ptr, ft_mem_qrealloc( memory, (itmsz), \ + (oldcnt), (newcnt), \ + (ptr), &error ) ) + + +#define FT_MEM_SET_ERROR( cond ) ( (cond), error != 0 ) + + +#define FT_MEM_SET( dest, byte, count ) ft_memset( dest, byte, count ) + +#define FT_MEM_COPY( dest, source, count ) ft_memcpy( dest, source, count ) + +#define FT_MEM_MOVE( dest, source, count ) ft_memmove( dest, source, count ) + + +#define FT_MEM_ZERO( dest, count ) FT_MEM_SET( dest, 0, count ) + +#define FT_ZERO( p ) FT_MEM_ZERO( p, sizeof ( *(p) ) ) + + +#define FT_ARRAY_ZERO( dest, count ) \ + FT_MEM_ZERO( dest, (count) * sizeof ( *(dest) ) ) + +#define FT_ARRAY_COPY( dest, source, count ) \ + FT_MEM_COPY( dest, source, (count) * sizeof ( *(dest) ) ) + +#define FT_ARRAY_MOVE( dest, source, count ) \ + FT_MEM_MOVE( dest, source, (count) * sizeof ( *(dest) ) ) + + + /* + * Return the maximum number of addressable elements in an array. + * We limit ourselves to INT_MAX, rather than UINT_MAX, to avoid + * any problems. + */ +#define FT_ARRAY_MAX( ptr ) ( FT_INT_MAX / sizeof ( *(ptr) ) ) + +#define FT_ARRAY_CHECK( ptr, count ) ( (count) <= FT_ARRAY_MAX( ptr ) ) + + + /*************************************************************************/ + /* */ + /* The following functions macros expect that their pointer argument is */ + /* _typed_ in order to automatically compute array element sizes. */ + /* */ + +#define FT_MEM_NEW_ARRAY( ptr, count ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_realloc( memory, sizeof ( *(ptr) ), \ + 0, (count), \ + NULL, &error ) ) + +#define FT_MEM_RENEW_ARRAY( ptr, cursz, newsz ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_realloc( memory, sizeof ( *(ptr) ), \ + (cursz), (newsz), \ + (ptr), &error ) ) + +#define FT_MEM_QNEW_ARRAY( ptr, count ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_qrealloc( memory, sizeof ( *(ptr) ), \ + 0, (count), \ + NULL, &error ) ) + +#define FT_MEM_QRENEW_ARRAY( ptr, cursz, newsz ) \ + FT_ASSIGNP_INNER( ptr, ft_mem_qrealloc( memory, sizeof ( *(ptr) ), \ + (cursz), (newsz), \ + (ptr), &error ) ) + + +#define FT_ALLOC( ptr, size ) \ + FT_MEM_SET_ERROR( FT_MEM_ALLOC( ptr, size ) ) + +#define FT_REALLOC( ptr, cursz, newsz ) \ + FT_MEM_SET_ERROR( FT_MEM_REALLOC( ptr, cursz, newsz ) ) + +#define FT_ALLOC_MULT( ptr, count, item_size ) \ + FT_MEM_SET_ERROR( FT_MEM_ALLOC_MULT( ptr, count, item_size ) ) + +#define FT_REALLOC_MULT( ptr, oldcnt, newcnt, itmsz ) \ + FT_MEM_SET_ERROR( FT_MEM_REALLOC_MULT( ptr, oldcnt, \ + newcnt, itmsz ) ) + +#define FT_QALLOC( ptr, size ) \ + FT_MEM_SET_ERROR( FT_MEM_QALLOC( ptr, size ) ) + +#define FT_QREALLOC( ptr, cursz, newsz ) \ + FT_MEM_SET_ERROR( FT_MEM_QREALLOC( ptr, cursz, newsz ) ) + +#define FT_QALLOC_MULT( ptr, count, item_size ) \ + FT_MEM_SET_ERROR( FT_MEM_QALLOC_MULT( ptr, count, item_size ) ) + +#define FT_QREALLOC_MULT( ptr, oldcnt, newcnt, itmsz ) \ + FT_MEM_SET_ERROR( FT_MEM_QREALLOC_MULT( ptr, oldcnt, \ + newcnt, itmsz ) ) + +#define FT_FREE( ptr ) FT_MEM_FREE( ptr ) + +#define FT_NEW( ptr ) FT_MEM_SET_ERROR( FT_MEM_NEW( ptr ) ) + +#define FT_NEW_ARRAY( ptr, count ) \ + FT_MEM_SET_ERROR( FT_MEM_NEW_ARRAY( ptr, count ) ) + +#define FT_RENEW_ARRAY( ptr, curcnt, newcnt ) \ + FT_MEM_SET_ERROR( FT_MEM_RENEW_ARRAY( ptr, curcnt, newcnt ) ) + +#define FT_QNEW( ptr ) \ + FT_MEM_SET_ERROR( FT_MEM_QNEW( ptr ) ) + +#define FT_QNEW_ARRAY( ptr, count ) \ + FT_MEM_SET_ERROR( FT_MEM_NEW_ARRAY( ptr, count ) ) + +#define FT_QRENEW_ARRAY( ptr, curcnt, newcnt ) \ + FT_MEM_SET_ERROR( FT_MEM_RENEW_ARRAY( ptr, curcnt, newcnt ) ) + + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + + FT_BASE( FT_Error ) + FT_Alloc( FT_Memory memory, + FT_Long size, + void* *P ); + + FT_BASE( FT_Error ) + FT_QAlloc( FT_Memory memory, + FT_Long size, + void* *p ); + + FT_BASE( FT_Error ) + FT_Realloc( FT_Memory memory, + FT_Long current, + FT_Long size, + void* *P ); + + FT_BASE( FT_Error ) + FT_QRealloc( FT_Memory memory, + FT_Long current, + FT_Long size, + void* *p ); + + FT_BASE( void ) + FT_Free( FT_Memory memory, + void* *P ); + +#endif /* FT_CONFIG_OPTION_OLD_INTERNALS */ + + + FT_BASE( FT_Pointer ) + ft_mem_strdup( FT_Memory memory, + const char* str, + FT_Error *p_error ); + + FT_BASE( FT_Pointer ) + ft_mem_dup( FT_Memory memory, + const void* address, + FT_ULong size, + FT_Error *p_error ); + +#define FT_MEM_STRDUP( dst, str ) \ + (dst) = (char*)ft_mem_strdup( memory, (const char*)(str), &error ) + +#define FT_STRDUP( dst, str ) \ + FT_MEM_SET_ERROR( FT_MEM_STRDUP( dst, str ) ) + +#define FT_MEM_DUP( dst, address, size ) \ + (dst) = ft_mem_dup( memory, (address), (FT_ULong)(size), &error ) + +#define FT_DUP( dst, address, size ) \ + FT_MEM_SET_ERROR( FT_MEM_DUP( dst, address, size ) ) + + + /* Return >= 1 if a truncation occurs. */ + /* Return 0 if the source string fits the buffer. */ + /* This is *not* the same as strlcpy(). */ + FT_BASE( FT_Int ) + ft_mem_strcpyn( char* dst, + const char* src, + FT_ULong size ); + +#define FT_STRCPYN( dst, src, size ) \ + ft_mem_strcpyn( (char*)dst, (const char*)(src), (FT_ULong)(size) ) + + /* */ + + +FT_END_HEADER + +#endif /* __FTMEMORY_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/ftobjs.h b/portlibs/include/freetype/internal/ftobjs.h new file mode 100644 index 00000000..1f22343a --- /dev/null +++ b/portlibs/include/freetype/internal/ftobjs.h @@ -0,0 +1,875 @@ +/***************************************************************************/ +/* */ +/* ftobjs.h */ +/* */ +/* The FreeType private base classes (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2005, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This file contains the definition of all internal FreeType classes. */ + /* */ + /*************************************************************************/ + + +#ifndef __FTOBJS_H__ +#define __FTOBJS_H__ + +#include <ft2build.h> +#include FT_RENDER_H +#include FT_SIZES_H +#include FT_LCD_FILTER_H +#include FT_INTERNAL_MEMORY_H +#include FT_INTERNAL_GLYPH_LOADER_H +#include FT_INTERNAL_DRIVER_H +#include FT_INTERNAL_AUTOHINT_H +#include FT_INTERNAL_SERVICE_H + +#ifdef FT_CONFIG_OPTION_INCREMENTAL +#include FT_INCREMENTAL_H +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* Some generic definitions. */ + /* */ +#ifndef TRUE +#define TRUE 1 +#endif + +#ifndef FALSE +#define FALSE 0 +#endif + +#ifndef NULL +#define NULL (void*)0 +#endif + + + /*************************************************************************/ + /* */ + /* The min and max functions missing in C. As usual, be careful not to */ + /* write things like FT_MIN( a++, b++ ) to avoid side effects. */ + /* */ +#define FT_MIN( a, b ) ( (a) < (b) ? (a) : (b) ) +#define FT_MAX( a, b ) ( (a) > (b) ? (a) : (b) ) + +#define FT_ABS( a ) ( (a) < 0 ? -(a) : (a) ) + + +#define FT_PAD_FLOOR( x, n ) ( (x) & ~((n)-1) ) +#define FT_PAD_ROUND( x, n ) FT_PAD_FLOOR( (x) + ((n)/2), n ) +#define FT_PAD_CEIL( x, n ) FT_PAD_FLOOR( (x) + ((n)-1), n ) + +#define FT_PIX_FLOOR( x ) ( (x) & ~63 ) +#define FT_PIX_ROUND( x ) FT_PIX_FLOOR( (x) + 32 ) +#define FT_PIX_CEIL( x ) FT_PIX_FLOOR( (x) + 63 ) + + + /* + * Return the highest power of 2 that is <= value; this correspond to + * the highest bit in a given 32-bit value. + */ + FT_BASE( FT_UInt32 ) + ft_highpow2( FT_UInt32 value ); + + + /* + * character classification functions -- since these are used to parse + * font files, we must not use those in <ctypes.h> which are + * locale-dependent + */ +#define ft_isdigit( x ) ( ( (unsigned)(x) - '0' ) < 10U ) + +#define ft_isxdigit( x ) ( ( (unsigned)(x) - '0' ) < 10U || \ + ( (unsigned)(x) - 'a' ) < 6U || \ + ( (unsigned)(x) - 'A' ) < 6U ) + + /* the next two macros assume ASCII representation */ +#define ft_isupper( x ) ( ( (unsigned)(x) - 'A' ) < 26U ) +#define ft_islower( x ) ( ( (unsigned)(x) - 'a' ) < 26U ) + +#define ft_isalpha( x ) ( ft_isupper( x ) || ft_islower( x ) ) +#define ft_isalnum( x ) ( ft_isdigit( x ) || ft_isalpha( x ) ) + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** ****/ + /**** C H A R M A P S ****/ + /**** ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + /* handle to internal charmap object */ + typedef struct FT_CMapRec_* FT_CMap; + + /* handle to charmap class structure */ + typedef const struct FT_CMap_ClassRec_* FT_CMap_Class; + + /* internal charmap object structure */ + typedef struct FT_CMapRec_ + { + FT_CharMapRec charmap; + FT_CMap_Class clazz; + + } FT_CMapRec; + + /* typecase any pointer to a charmap handle */ +#define FT_CMAP( x ) ((FT_CMap)( x )) + + /* obvious macros */ +#define FT_CMAP_PLATFORM_ID( x ) FT_CMAP( x )->charmap.platform_id +#define FT_CMAP_ENCODING_ID( x ) FT_CMAP( x )->charmap.encoding_id +#define FT_CMAP_ENCODING( x ) FT_CMAP( x )->charmap.encoding +#define FT_CMAP_FACE( x ) FT_CMAP( x )->charmap.face + + + /* class method definitions */ + typedef FT_Error + (*FT_CMap_InitFunc)( FT_CMap cmap, + FT_Pointer init_data ); + + typedef void + (*FT_CMap_DoneFunc)( FT_CMap cmap ); + + typedef FT_UInt + (*FT_CMap_CharIndexFunc)( FT_CMap cmap, + FT_UInt32 char_code ); + + typedef FT_UInt + (*FT_CMap_CharNextFunc)( FT_CMap cmap, + FT_UInt32 *achar_code ); + + typedef FT_UInt + (*FT_CMap_CharVarIndexFunc)( FT_CMap cmap, + FT_CMap unicode_cmap, + FT_UInt32 char_code, + FT_UInt32 variant_selector ); + + typedef FT_Bool + (*FT_CMap_CharVarIsDefaultFunc)( FT_CMap cmap, + FT_UInt32 char_code, + FT_UInt32 variant_selector ); + + typedef FT_UInt32 * + (*FT_CMap_VariantListFunc)( FT_CMap cmap, + FT_Memory mem ); + + typedef FT_UInt32 * + (*FT_CMap_CharVariantListFunc)( FT_CMap cmap, + FT_Memory mem, + FT_UInt32 char_code ); + + typedef FT_UInt32 * + (*FT_CMap_VariantCharListFunc)( FT_CMap cmap, + FT_Memory mem, + FT_UInt32 variant_selector ); + + + typedef struct FT_CMap_ClassRec_ + { + FT_ULong size; + FT_CMap_InitFunc init; + FT_CMap_DoneFunc done; + FT_CMap_CharIndexFunc char_index; + FT_CMap_CharNextFunc char_next; + + /* Subsequent entries are special ones for format 14 -- the variant */ + /* selector subtable which behaves like no other */ + + FT_CMap_CharVarIndexFunc char_var_index; + FT_CMap_CharVarIsDefaultFunc char_var_default; + FT_CMap_VariantListFunc variant_list; + FT_CMap_CharVariantListFunc charvariant_list; + FT_CMap_VariantCharListFunc variantchar_list; + + } FT_CMap_ClassRec; + + + /* create a new charmap and add it to charmap->face */ + FT_BASE( FT_Error ) + FT_CMap_New( FT_CMap_Class clazz, + FT_Pointer init_data, + FT_CharMap charmap, + FT_CMap *acmap ); + + /* destroy a charmap and remove it from face's list */ + FT_BASE( void ) + FT_CMap_Done( FT_CMap cmap ); + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Face_InternalRec */ + /* */ + /* <Description> */ + /* This structure contains the internal fields of each FT_Face */ + /* object. These fields may change between different releases of */ + /* FreeType. */ + /* */ + /* <Fields> */ + /* max_points :: */ + /* The maximal number of points used to store the vectorial outline */ + /* of any glyph in this face. If this value cannot be known in */ + /* advance, or if the face isn't scalable, this should be set to 0. */ + /* Only relevant for scalable formats. */ + /* */ + /* max_contours :: */ + /* The maximal number of contours used to store the vectorial */ + /* outline of any glyph in this face. If this value cannot be */ + /* known in advance, or if the face isn't scalable, this should be */ + /* set to 0. Only relevant for scalable formats. */ + /* */ + /* transform_matrix :: */ + /* A 2x2 matrix of 16.16 coefficients used to transform glyph */ + /* outlines after they are loaded from the font. Only used by the */ + /* convenience functions. */ + /* */ + /* transform_delta :: */ + /* A translation vector used to transform glyph outlines after they */ + /* are loaded from the font. Only used by the convenience */ + /* functions. */ + /* */ + /* transform_flags :: */ + /* Some flags used to classify the transform. Only used by the */ + /* convenience functions. */ + /* */ + /* services :: */ + /* A cache for frequently used services. It should be only */ + /* accessed with the macro `FT_FACE_LOOKUP_SERVICE'. */ + /* */ + /* incremental_interface :: */ + /* If non-null, the interface through which glyph data and metrics */ + /* are loaded incrementally for faces that do not provide all of */ + /* this data when first opened. This field exists only if */ + /* @FT_CONFIG_OPTION_INCREMENTAL is defined. */ + /* */ + /* ignore_unpatented_hinter :: */ + /* This boolean flag instructs the glyph loader to ignore the */ + /* native font hinter, if one is found. This is exclusively used */ + /* in the case when the unpatented hinter is compiled within the */ + /* library. */ + /* */ + typedef struct FT_Face_InternalRec_ + { +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + FT_UShort reserved1; + FT_Short reserved2; +#endif + FT_Matrix transform_matrix; + FT_Vector transform_delta; + FT_Int transform_flags; + + FT_ServiceCacheRec services; + +#ifdef FT_CONFIG_OPTION_INCREMENTAL + FT_Incremental_InterfaceRec* incremental_interface; +#endif + + FT_Bool ignore_unpatented_hinter; + + } FT_Face_InternalRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Slot_InternalRec */ + /* */ + /* <Description> */ + /* This structure contains the internal fields of each FT_GlyphSlot */ + /* object. These fields may change between different releases of */ + /* FreeType. */ + /* */ + /* <Fields> */ + /* loader :: The glyph loader object used to load outlines */ + /* into the glyph slot. */ + /* */ + /* flags :: Possible values are zero or */ + /* FT_GLYPH_OWN_BITMAP. The latter indicates */ + /* that the FT_GlyphSlot structure owns the */ + /* bitmap buffer. */ + /* */ + /* glyph_transformed :: Boolean. Set to TRUE when the loaded glyph */ + /* must be transformed through a specific */ + /* font transformation. This is _not_ the same */ + /* as the face transform set through */ + /* FT_Set_Transform(). */ + /* */ + /* glyph_matrix :: The 2x2 matrix corresponding to the glyph */ + /* transformation, if necessary. */ + /* */ + /* glyph_delta :: The 2d translation vector corresponding to */ + /* the glyph transformation, if necessary. */ + /* */ + /* glyph_hints :: Format-specific glyph hints management. */ + /* */ + +#define FT_GLYPH_OWN_BITMAP 0x1 + + typedef struct FT_Slot_InternalRec_ + { + FT_GlyphLoader loader; + FT_UInt flags; + FT_Bool glyph_transformed; + FT_Matrix glyph_matrix; + FT_Vector glyph_delta; + void* glyph_hints; + + } FT_GlyphSlot_InternalRec; + + +#if 0 + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_Size_InternalRec */ + /* */ + /* <Description> */ + /* This structure contains the internal fields of each FT_Size */ + /* object. Currently, it's empty. */ + /* */ + /*************************************************************************/ + + typedef struct FT_Size_InternalRec_ + { + /* empty */ + + } FT_Size_InternalRec; + +#endif + + + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** ****/ + /**** M O D U L E S ****/ + /**** ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_ModuleRec */ + /* */ + /* <Description> */ + /* A module object instance. */ + /* */ + /* <Fields> */ + /* clazz :: A pointer to the module's class. */ + /* */ + /* library :: A handle to the parent library object. */ + /* */ + /* memory :: A handle to the memory manager. */ + /* */ + /* generic :: A generic structure for user-level extensibility (?). */ + /* */ + typedef struct FT_ModuleRec_ + { + FT_Module_Class* clazz; + FT_Library library; + FT_Memory memory; + FT_Generic generic; + + } FT_ModuleRec; + + + /* typecast an object to a FT_Module */ +#define FT_MODULE( x ) ((FT_Module)( x )) +#define FT_MODULE_CLASS( x ) FT_MODULE( x )->clazz +#define FT_MODULE_LIBRARY( x ) FT_MODULE( x )->library +#define FT_MODULE_MEMORY( x ) FT_MODULE( x )->memory + + +#define FT_MODULE_IS_DRIVER( x ) ( FT_MODULE_CLASS( x )->module_flags & \ + FT_MODULE_FONT_DRIVER ) + +#define FT_MODULE_IS_RENDERER( x ) ( FT_MODULE_CLASS( x )->module_flags & \ + FT_MODULE_RENDERER ) + +#define FT_MODULE_IS_HINTER( x ) ( FT_MODULE_CLASS( x )->module_flags & \ + FT_MODULE_HINTER ) + +#define FT_MODULE_IS_STYLER( x ) ( FT_MODULE_CLASS( x )->module_flags & \ + FT_MODULE_STYLER ) + +#define FT_DRIVER_IS_SCALABLE( x ) ( FT_MODULE_CLASS( x )->module_flags & \ + FT_MODULE_DRIVER_SCALABLE ) + +#define FT_DRIVER_USES_OUTLINES( x ) !( FT_MODULE_CLASS( x )->module_flags & \ + FT_MODULE_DRIVER_NO_OUTLINES ) + +#define FT_DRIVER_HAS_HINTER( x ) ( FT_MODULE_CLASS( x )->module_flags & \ + FT_MODULE_DRIVER_HAS_HINTER ) + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Module_Interface */ + /* */ + /* <Description> */ + /* Finds a module and returns its specific interface as a typeless */ + /* pointer. */ + /* */ + /* <Input> */ + /* library :: A handle to the library object. */ + /* */ + /* module_name :: The module's name (as an ASCII string). */ + /* */ + /* <Return> */ + /* A module-specific interface if available, 0 otherwise. */ + /* */ + /* <Note> */ + /* You should better be familiar with FreeType internals to know */ + /* which module to look for, and what its interface is :-) */ + /* */ + FT_BASE( const void* ) + FT_Get_Module_Interface( FT_Library library, + const char* mod_name ); + + FT_BASE( FT_Pointer ) + ft_module_get_service( FT_Module module, + const char* service_id ); + + /* */ + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** ****/ + /**** FACE, SIZE & GLYPH SLOT OBJECTS ****/ + /**** ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + /* a few macros used to perform easy typecasts with minimal brain damage */ + +#define FT_FACE( x ) ((FT_Face)(x)) +#define FT_SIZE( x ) ((FT_Size)(x)) +#define FT_SLOT( x ) ((FT_GlyphSlot)(x)) + +#define FT_FACE_DRIVER( x ) FT_FACE( x )->driver +#define FT_FACE_LIBRARY( x ) FT_FACE_DRIVER( x )->root.library +#define FT_FACE_MEMORY( x ) FT_FACE( x )->memory +#define FT_FACE_STREAM( x ) FT_FACE( x )->stream + +#define FT_SIZE_FACE( x ) FT_SIZE( x )->face +#define FT_SLOT_FACE( x ) FT_SLOT( x )->face + +#define FT_FACE_SLOT( x ) FT_FACE( x )->glyph +#define FT_FACE_SIZE( x ) FT_FACE( x )->size + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_New_GlyphSlot */ + /* */ + /* <Description> */ + /* It is sometimes useful to have more than one glyph slot for a */ + /* given face object. This function is used to create additional */ + /* slots. All of them are automatically discarded when the face is */ + /* destroyed. */ + /* */ + /* <Input> */ + /* face :: A handle to a parent face object. */ + /* */ + /* <Output> */ + /* aslot :: A handle to a new glyph slot object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + FT_BASE( FT_Error ) + FT_New_GlyphSlot( FT_Face face, + FT_GlyphSlot *aslot ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Done_GlyphSlot */ + /* */ + /* <Description> */ + /* Destroys a given glyph slot. Remember however that all slots are */ + /* automatically destroyed with its parent. Using this function is */ + /* not always mandatory. */ + /* */ + /* <Input> */ + /* slot :: A handle to a target glyph slot. */ + /* */ + FT_BASE( void ) + FT_Done_GlyphSlot( FT_GlyphSlot slot ); + + /* */ + +#define FT_REQUEST_WIDTH( req ) \ + ( (req)->horiResolution \ + ? (FT_Pos)( (req)->width * (req)->horiResolution + 36 ) / 72 \ + : (req)->width ) + +#define FT_REQUEST_HEIGHT( req ) \ + ( (req)->vertResolution \ + ? (FT_Pos)( (req)->height * (req)->vertResolution + 36 ) / 72 \ + : (req)->height ) + + + /* Set the metrics according to a bitmap strike. */ + FT_BASE( void ) + FT_Select_Metrics( FT_Face face, + FT_ULong strike_index ); + + + /* Set the metrics according to a size request. */ + FT_BASE( void ) + FT_Request_Metrics( FT_Face face, + FT_Size_Request req ); + + + /* Match a size request against `available_sizes'. */ + FT_BASE( FT_Error ) + FT_Match_Size( FT_Face face, + FT_Size_Request req, + FT_Bool ignore_width, + FT_ULong* size_index ); + + + /* Use the horizontal metrics to synthesize the vertical metrics. */ + /* If `advance' is zero, it is also synthesized. */ + FT_BASE( void ) + ft_synthesize_vertical_metrics( FT_Glyph_Metrics* metrics, + FT_Pos advance ); + + + /* Free the bitmap of a given glyphslot when needed (i.e., only when it */ + /* was allocated with ft_glyphslot_alloc_bitmap). */ + FT_BASE( void ) + ft_glyphslot_free_bitmap( FT_GlyphSlot slot ); + + + /* Allocate a new bitmap buffer in a glyph slot. */ + FT_BASE( FT_Error ) + ft_glyphslot_alloc_bitmap( FT_GlyphSlot slot, + FT_ULong size ); + + + /* Set the bitmap buffer in a glyph slot to a given pointer. The buffer */ + /* will not be freed by a later call to ft_glyphslot_free_bitmap. */ + FT_BASE( void ) + ft_glyphslot_set_bitmap( FT_GlyphSlot slot, + FT_Byte* buffer ); + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** ****/ + /**** R E N D E R E R S ****/ + /**** ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + +#define FT_RENDERER( x ) ((FT_Renderer)( x )) +#define FT_GLYPH( x ) ((FT_Glyph)( x )) +#define FT_BITMAP_GLYPH( x ) ((FT_BitmapGlyph)( x )) +#define FT_OUTLINE_GLYPH( x ) ((FT_OutlineGlyph)( x )) + + + typedef struct FT_RendererRec_ + { + FT_ModuleRec root; + FT_Renderer_Class* clazz; + FT_Glyph_Format glyph_format; + FT_Glyph_Class glyph_class; + + FT_Raster raster; + FT_Raster_Render_Func raster_render; + FT_Renderer_RenderFunc render; + + } FT_RendererRec; + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** ****/ + /**** F O N T D R I V E R S ****/ + /**** ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /* typecast a module into a driver easily */ +#define FT_DRIVER( x ) ((FT_Driver)(x)) + + /* typecast a module as a driver, and get its driver class */ +#define FT_DRIVER_CLASS( x ) FT_DRIVER( x )->clazz + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_DriverRec */ + /* */ + /* <Description> */ + /* The root font driver class. A font driver is responsible for */ + /* managing and loading font files of a given format. */ + /* */ + /* <Fields> */ + /* root :: Contains the fields of the root module class. */ + /* */ + /* clazz :: A pointer to the font driver's class. Note that */ + /* this is NOT root.clazz. `class' wasn't used */ + /* as it is a reserved word in C++. */ + /* */ + /* faces_list :: The list of faces currently opened by this */ + /* driver. */ + /* */ + /* extensions :: A typeless pointer to the driver's extensions */ + /* registry, if they are supported through the */ + /* configuration macro FT_CONFIG_OPTION_EXTENSIONS. */ + /* */ + /* glyph_loader :: The glyph loader for all faces managed by this */ + /* driver. This object isn't defined for unscalable */ + /* formats. */ + /* */ + typedef struct FT_DriverRec_ + { + FT_ModuleRec root; + FT_Driver_Class clazz; + + FT_ListRec faces_list; + void* extensions; + + FT_GlyphLoader glyph_loader; + + } FT_DriverRec; + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** ****/ + /**** L I B R A R I E S ****/ + /**** ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /* This hook is used by the TrueType debugger. It must be set to an */ + /* alternate truetype bytecode interpreter function. */ +#define FT_DEBUG_HOOK_TRUETYPE 0 + + + /* Set this debug hook to a non-null pointer to force unpatented hinting */ + /* for all faces when both TT_USE_BYTECODE_INTERPRETER and */ + /* TT_CONFIG_OPTION_UNPATENTED_HINTING are defined. This is only used */ + /* during debugging. */ +#define FT_DEBUG_HOOK_UNPATENTED_HINTING 1 + + + typedef void (*FT_Bitmap_LcdFilterFunc)( FT_Bitmap* bitmap, + FT_Render_Mode render_mode, + FT_Library library ); + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* FT_LibraryRec */ + /* */ + /* <Description> */ + /* The FreeType library class. This is the root of all FreeType */ + /* data. Use FT_New_Library() to create a library object, and */ + /* FT_Done_Library() to discard it and all child objects. */ + /* */ + /* <Fields> */ + /* memory :: The library's memory object. Manages memory */ + /* allocation. */ + /* */ + /* generic :: Client data variable. Used to extend the */ + /* Library class by higher levels and clients. */ + /* */ + /* version_major :: The major version number of the library. */ + /* */ + /* version_minor :: The minor version number of the library. */ + /* */ + /* version_patch :: The current patch level of the library. */ + /* */ + /* num_modules :: The number of modules currently registered */ + /* within this library. This is set to 0 for new */ + /* libraries. New modules are added through the */ + /* FT_Add_Module() API function. */ + /* */ + /* modules :: A table used to store handles to the currently */ + /* registered modules. Note that each font driver */ + /* contains a list of its opened faces. */ + /* */ + /* renderers :: The list of renderers currently registered */ + /* within the library. */ + /* */ + /* cur_renderer :: The current outline renderer. This is a */ + /* shortcut used to avoid parsing the list on */ + /* each call to FT_Outline_Render(). It is a */ + /* handle to the current renderer for the */ + /* FT_GLYPH_FORMAT_OUTLINE format. */ + /* */ + /* auto_hinter :: XXX */ + /* */ + /* raster_pool :: The raster object's render pool. This can */ + /* ideally be changed dynamically at run-time. */ + /* */ + /* raster_pool_size :: The size of the render pool in bytes. */ + /* */ + /* debug_hooks :: XXX */ + /* */ + typedef struct FT_LibraryRec_ + { + FT_Memory memory; /* library's memory manager */ + + FT_Generic generic; + + FT_Int version_major; + FT_Int version_minor; + FT_Int version_patch; + + FT_UInt num_modules; + FT_Module modules[FT_MAX_MODULES]; /* module objects */ + + FT_ListRec renderers; /* list of renderers */ + FT_Renderer cur_renderer; /* current outline renderer */ + FT_Module auto_hinter; + + FT_Byte* raster_pool; /* scan-line conversion */ + /* render pool */ + FT_ULong raster_pool_size; /* size of render pool in bytes */ + + FT_DebugHook_Func debug_hooks[4]; + +#ifdef FT_CONFIG_OPTION_SUBPIXEL_RENDERING + FT_LcdFilter lcd_filter; + FT_Int lcd_extra; /* number of extra pixels */ + FT_Byte lcd_weights[7]; /* filter weights, if any */ + FT_Bitmap_LcdFilterFunc lcd_filter_func; /* filtering callback */ +#endif + + } FT_LibraryRec; + + + FT_BASE( FT_Renderer ) + FT_Lookup_Renderer( FT_Library library, + FT_Glyph_Format format, + FT_ListNode* node ); + + FT_BASE( FT_Error ) + FT_Render_Glyph_Internal( FT_Library library, + FT_GlyphSlot slot, + FT_Render_Mode render_mode ); + + typedef const char* + (*FT_Face_GetPostscriptNameFunc)( FT_Face face ); + + typedef FT_Error + (*FT_Face_GetGlyphNameFunc)( FT_Face face, + FT_UInt glyph_index, + FT_Pointer buffer, + FT_UInt buffer_max ); + + typedef FT_UInt + (*FT_Face_GetGlyphNameIndexFunc)( FT_Face face, + FT_String* glyph_name ); + + +#ifndef FT_CONFIG_OPTION_NO_DEFAULT_SYSTEM + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_New_Memory */ + /* */ + /* <Description> */ + /* Creates a new memory object. */ + /* */ + /* <Return> */ + /* A pointer to the new memory object. 0 in case of error. */ + /* */ + FT_BASE( FT_Memory ) + FT_New_Memory( void ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Done_Memory */ + /* */ + /* <Description> */ + /* Discards memory manager. */ + /* */ + /* <Input> */ + /* memory :: A handle to the memory manager. */ + /* */ + FT_BASE( void ) + FT_Done_Memory( FT_Memory memory ); + +#endif /* !FT_CONFIG_OPTION_NO_DEFAULT_SYSTEM */ + + + /* Define default raster's interface. The default raster is located in */ + /* `src/base/ftraster.c'. */ + /* */ + /* Client applications can register new rasters through the */ + /* FT_Set_Raster() API. */ + +#ifndef FT_NO_DEFAULT_RASTER + FT_EXPORT_VAR( FT_Raster_Funcs ) ft_default_raster; +#endif + + +FT_END_HEADER + +#endif /* __FTOBJS_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/ftrfork.h b/portlibs/include/freetype/internal/ftrfork.h new file mode 100644 index 00000000..aa573c87 --- /dev/null +++ b/portlibs/include/freetype/internal/ftrfork.h @@ -0,0 +1,196 @@ +/***************************************************************************/ +/* */ +/* ftrfork.h */ +/* */ +/* Embedded resource forks accessor (specification). */ +/* */ +/* Copyright 2004, 2006, 2007 by */ +/* Masatake YAMATO and Redhat K.K. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + +/***************************************************************************/ +/* Development of the code in this file is support of */ +/* Information-technology Promotion Agency, Japan. */ +/***************************************************************************/ + + +#ifndef __FTRFORK_H__ +#define __FTRFORK_H__ + + +#include <ft2build.h> +#include FT_INTERNAL_OBJECTS_H + + +FT_BEGIN_HEADER + + + /* Number of guessing rules supported in `FT_Raccess_Guess'. */ + /* Don't forget to increment the number if you add a new guessing rule. */ +#define FT_RACCESS_N_RULES 9 + + + /* A structure to describe a reference in a resource by its resource ID */ + /* and internal offset. The `POST' resource expects to be concatenated */ + /* by the order of resource IDs instead of its appearance in the file. */ + + typedef struct FT_RFork_Ref_ + { + FT_UShort res_id; + FT_ULong offset; + + } FT_RFork_Ref; + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Raccess_Guess */ + /* */ + /* <Description> */ + /* Guess a file name and offset where the actual resource fork is */ + /* stored. The macro FT_RACCESS_N_RULES holds the number of */ + /* guessing rules; the guessed result for the Nth rule is */ + /* represented as a triplet: a new file name (new_names[N]), a file */ + /* offset (offsets[N]), and an error code (errors[N]). */ + /* */ + /* <Input> */ + /* library :: */ + /* A FreeType library instance. */ + /* */ + /* stream :: */ + /* A file stream containing the resource fork. */ + /* */ + /* base_name :: */ + /* The (base) file name of the resource fork used for some */ + /* guessing rules. */ + /* */ + /* <Output> */ + /* new_names :: */ + /* An array of guessed file names in which the resource forks may */ + /* exist. If `new_names[N]' is NULL, the guessed file name is */ + /* equal to `base_name'. */ + /* */ + /* offsets :: */ + /* An array of guessed file offsets. `offsets[N]' holds the file */ + /* offset of the possible start of the resource fork in file */ + /* `new_names[N]'. */ + /* */ + /* errors :: */ + /* An array of FreeType error codes. `errors[N]' is the error */ + /* code of Nth guessing rule function. If `errors[N]' is not */ + /* FT_Err_Ok, `new_names[N]' and `offsets[N]' are meaningless. */ + /* */ + FT_BASE( void ) + FT_Raccess_Guess( FT_Library library, + FT_Stream stream, + char* base_name, + char** new_names, + FT_Long* offsets, + FT_Error* errors ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Raccess_Get_HeaderInfo */ + /* */ + /* <Description> */ + /* Get the information from the header of resource fork. The */ + /* information includes the file offset where the resource map */ + /* starts, and the file offset where the resource data starts. */ + /* `FT_Raccess_Get_DataOffsets' requires these two data. */ + /* */ + /* <Input> */ + /* library :: */ + /* A FreeType library instance. */ + /* */ + /* stream :: */ + /* A file stream containing the resource fork. */ + /* */ + /* rfork_offset :: */ + /* The file offset where the resource fork starts. */ + /* */ + /* <Output> */ + /* map_offset :: */ + /* The file offset where the resource map starts. */ + /* */ + /* rdata_pos :: */ + /* The file offset where the resource data starts. */ + /* */ + /* <Return> */ + /* FreeType error code. FT_Err_Ok means success. */ + /* */ + FT_BASE( FT_Error ) + FT_Raccess_Get_HeaderInfo( FT_Library library, + FT_Stream stream, + FT_Long rfork_offset, + FT_Long *map_offset, + FT_Long *rdata_pos ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Raccess_Get_DataOffsets */ + /* */ + /* <Description> */ + /* Get the data offsets for a tag in a resource fork. Offsets are */ + /* stored in an array because, in some cases, resources in a resource */ + /* fork have the same tag. */ + /* */ + /* <Input> */ + /* library :: */ + /* A FreeType library instance. */ + /* */ + /* stream :: */ + /* A file stream containing the resource fork. */ + /* */ + /* map_offset :: */ + /* The file offset where the resource map starts. */ + /* */ + /* rdata_pos :: */ + /* The file offset where the resource data starts. */ + /* */ + /* tag :: */ + /* The resource tag. */ + /* */ + /* <Output> */ + /* offsets :: */ + /* The stream offsets for the resource data specified by `tag'. */ + /* This array is allocated by the function, so you have to call */ + /* @ft_mem_free after use. */ + /* */ + /* count :: */ + /* The length of offsets array. */ + /* */ + /* <Return> */ + /* FreeType error code. FT_Err_Ok means success. */ + /* */ + /* <Note> */ + /* Normally you should use `FT_Raccess_Get_HeaderInfo' to get the */ + /* value for `map_offset' and `rdata_pos'. */ + /* */ + FT_BASE( FT_Error ) + FT_Raccess_Get_DataOffsets( FT_Library library, + FT_Stream stream, + FT_Long map_offset, + FT_Long rdata_pos, + FT_Long tag, + FT_Long **offsets, + FT_Long *count ); + + +FT_END_HEADER + +#endif /* __FTRFORK_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/ftserv.h b/portlibs/include/freetype/internal/ftserv.h new file mode 100644 index 00000000..2db3e879 --- /dev/null +++ b/portlibs/include/freetype/internal/ftserv.h @@ -0,0 +1,328 @@ +/***************************************************************************/ +/* */ +/* ftserv.h */ +/* */ +/* The FreeType services (specification only). */ +/* */ +/* Copyright 2003, 2004, 2005, 2006, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + /*************************************************************************/ + /* */ + /* Each module can export one or more `services'. Each service is */ + /* identified by a constant string and modeled by a pointer; the latter */ + /* generally corresponds to a structure containing function pointers. */ + /* */ + /* Note that a service's data cannot be a mere function pointer because */ + /* in C it is possible that function pointers might be implemented */ + /* differently than data pointers (e.g. 48 bits instead of 32). */ + /* */ + /*************************************************************************/ + + +#ifndef __FTSERV_H__ +#define __FTSERV_H__ + + +FT_BEGIN_HEADER + +#if defined( _MSC_VER ) /* Visual C++ (and Intel C++) */ + + /* we disable the warning `conditional expression is constant' here */ + /* in order to compile cleanly with the maximum level of warnings */ +#pragma warning( disable : 4127 ) + +#endif /* _MSC_VER */ + + /* + * @macro: + * FT_FACE_FIND_SERVICE + * + * @description: + * This macro is used to look up a service from a face's driver module. + * + * @input: + * face :: + * The source face handle. + * + * id :: + * A string describing the service as defined in the service's + * header files (e.g. FT_SERVICE_ID_MULTI_MASTERS which expands to + * `multi-masters'). It is automatically prefixed with + * `FT_SERVICE_ID_'. + * + * @output: + * ptr :: + * A variable that receives the service pointer. Will be NULL + * if not found. + */ +#ifdef __cplusplus + +#define FT_FACE_FIND_SERVICE( face, ptr, id ) \ + FT_BEGIN_STMNT \ + FT_Module module = FT_MODULE( FT_FACE( face )->driver ); \ + FT_Pointer _tmp_ = NULL; \ + FT_Pointer* _pptr_ = (FT_Pointer*)&(ptr); \ + \ + \ + if ( module->clazz->get_interface ) \ + _tmp_ = module->clazz->get_interface( module, FT_SERVICE_ID_ ## id ); \ + *_pptr_ = _tmp_; \ + FT_END_STMNT + +#else /* !C++ */ + +#define FT_FACE_FIND_SERVICE( face, ptr, id ) \ + FT_BEGIN_STMNT \ + FT_Module module = FT_MODULE( FT_FACE( face )->driver ); \ + FT_Pointer _tmp_ = NULL; \ + \ + if ( module->clazz->get_interface ) \ + _tmp_ = module->clazz->get_interface( module, FT_SERVICE_ID_ ## id ); \ + ptr = _tmp_; \ + FT_END_STMNT + +#endif /* !C++ */ + + /* + * @macro: + * FT_FACE_FIND_GLOBAL_SERVICE + * + * @description: + * This macro is used to look up a service from all modules. + * + * @input: + * face :: + * The source face handle. + * + * id :: + * A string describing the service as defined in the service's + * header files (e.g. FT_SERVICE_ID_MULTI_MASTERS which expands to + * `multi-masters'). It is automatically prefixed with + * `FT_SERVICE_ID_'. + * + * @output: + * ptr :: + * A variable that receives the service pointer. Will be NULL + * if not found. + */ +#ifdef __cplusplus + +#define FT_FACE_FIND_GLOBAL_SERVICE( face, ptr, id ) \ + FT_BEGIN_STMNT \ + FT_Module module = FT_MODULE( FT_FACE( face )->driver ); \ + FT_Pointer _tmp_; \ + FT_Pointer* _pptr_ = (FT_Pointer*)&(ptr); \ + \ + \ + _tmp_ = ft_module_get_service( module, FT_SERVICE_ID_ ## id ); \ + *_pptr_ = _tmp_; \ + FT_END_STMNT + +#else /* !C++ */ + +#define FT_FACE_FIND_GLOBAL_SERVICE( face, ptr, id ) \ + FT_BEGIN_STMNT \ + FT_Module module = FT_MODULE( FT_FACE( face )->driver ); \ + FT_Pointer _tmp_; \ + \ + \ + _tmp_ = ft_module_get_service( module, FT_SERVICE_ID_ ## id ); \ + ptr = _tmp_; \ + FT_END_STMNT + +#endif /* !C++ */ + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** S E R V I C E D E S C R I P T O R S *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + /* + * The following structure is used to _describe_ a given service + * to the library. This is useful to build simple static service lists. + */ + typedef struct FT_ServiceDescRec_ + { + const char* serv_id; /* service name */ + const void* serv_data; /* service pointer/data */ + + } FT_ServiceDescRec; + + typedef const FT_ServiceDescRec* FT_ServiceDesc; + + + /* + * Parse a list of FT_ServiceDescRec descriptors and look for + * a specific service by ID. Note that the last element in the + * array must be { NULL, NULL }, and that the function should + * return NULL if the service isn't available. + * + * This function can be used by modules to implement their + * `get_service' method. + */ + FT_BASE( FT_Pointer ) + ft_service_list_lookup( FT_ServiceDesc service_descriptors, + const char* service_id ); + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** S E R V I C E S C A C H E *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + /* + * This structure is used to store a cache for several frequently used + * services. It is the type of `face->internal->services'. You + * should only use FT_FACE_LOOKUP_SERVICE to access it. + * + * All fields should have the type FT_Pointer to relax compilation + * dependencies. We assume the developer isn't completely stupid. + * + * Each field must be named `service_XXXX' where `XXX' corresponds to + * the correct FT_SERVICE_ID_XXXX macro. See the definition of + * FT_FACE_LOOKUP_SERVICE below how this is implemented. + * + */ + typedef struct FT_ServiceCacheRec_ + { + FT_Pointer service_POSTSCRIPT_FONT_NAME; + FT_Pointer service_MULTI_MASTERS; + FT_Pointer service_GLYPH_DICT; + FT_Pointer service_PFR_METRICS; + FT_Pointer service_WINFNT; + + } FT_ServiceCacheRec, *FT_ServiceCache; + + + /* + * A magic number used within the services cache. + */ +#define FT_SERVICE_UNAVAILABLE ((FT_Pointer)-2) /* magic number */ + + + /* + * @macro: + * FT_FACE_LOOKUP_SERVICE + * + * @description: + * This macro is used to lookup a service from a face's driver module + * using its cache. + * + * @input: + * face:: + * The source face handle containing the cache. + * + * field :: + * The field name in the cache. + * + * id :: + * The service ID. + * + * @output: + * ptr :: + * A variable receiving the service data. NULL if not available. + */ +#ifdef __cplusplus + +#define FT_FACE_LOOKUP_SERVICE( face, ptr, id ) \ + FT_BEGIN_STMNT \ + FT_Pointer svc; \ + FT_Pointer* Pptr = (FT_Pointer*)&(ptr); \ + \ + \ + svc = FT_FACE( face )->internal->services. service_ ## id; \ + if ( svc == FT_SERVICE_UNAVAILABLE ) \ + svc = NULL; \ + else if ( svc == NULL ) \ + { \ + FT_FACE_FIND_SERVICE( face, svc, id ); \ + \ + FT_FACE( face )->internal->services. service_ ## id = \ + (FT_Pointer)( svc != NULL ? svc \ + : FT_SERVICE_UNAVAILABLE ); \ + } \ + *Pptr = svc; \ + FT_END_STMNT + +#else /* !C++ */ + +#define FT_FACE_LOOKUP_SERVICE( face, ptr, id ) \ + FT_BEGIN_STMNT \ + FT_Pointer svc; \ + \ + \ + svc = FT_FACE( face )->internal->services. service_ ## id; \ + if ( svc == FT_SERVICE_UNAVAILABLE ) \ + svc = NULL; \ + else if ( svc == NULL ) \ + { \ + FT_FACE_FIND_SERVICE( face, svc, id ); \ + \ + FT_FACE( face )->internal->services. service_ ## id = \ + (FT_Pointer)( svc != NULL ? svc \ + : FT_SERVICE_UNAVAILABLE ); \ + } \ + ptr = svc; \ + FT_END_STMNT + +#endif /* !C++ */ + + /* + * A macro used to define new service structure types. + */ + +#define FT_DEFINE_SERVICE( name ) \ + typedef struct FT_Service_ ## name ## Rec_ \ + FT_Service_ ## name ## Rec ; \ + typedef struct FT_Service_ ## name ## Rec_ \ + const * FT_Service_ ## name ; \ + struct FT_Service_ ## name ## Rec_ + + /* */ + + /* + * The header files containing the services. + */ + +#define FT_SERVICE_BDF_H <freetype/internal/services/svbdf.h> +#define FT_SERVICE_CID_H <freetype/internal/services/svcid.h> +#define FT_SERVICE_GLYPH_DICT_H <freetype/internal/services/svgldict.h> +#define FT_SERVICE_GX_VALIDATE_H <freetype/internal/services/svgxval.h> +#define FT_SERVICE_KERNING_H <freetype/internal/services/svkern.h> +#define FT_SERVICE_MULTIPLE_MASTERS_H <freetype/internal/services/svmm.h> +#define FT_SERVICE_OPENTYPE_VALIDATE_H <freetype/internal/services/svotval.h> +#define FT_SERVICE_PFR_H <freetype/internal/services/svpfr.h> +#define FT_SERVICE_POSTSCRIPT_CMAPS_H <freetype/internal/services/svpscmap.h> +#define FT_SERVICE_POSTSCRIPT_INFO_H <freetype/internal/services/svpsinfo.h> +#define FT_SERVICE_POSTSCRIPT_NAME_H <freetype/internal/services/svpostnm.h> +#define FT_SERVICE_SFNT_H <freetype/internal/services/svsfnt.h> +#define FT_SERVICE_TRUETYPE_ENGINE_H <freetype/internal/services/svtteng.h> +#define FT_SERVICE_TT_CMAP_H <freetype/internal/services/svttcmap.h> +#define FT_SERVICE_WINFNT_H <freetype/internal/services/svwinfnt.h> +#define FT_SERVICE_XFREE86_NAME_H <freetype/internal/services/svxf86nm.h> +#define FT_SERVICE_TRUETYPE_GLYF_H <freetype/internal/services/svttglyf.h> + + /* */ + +FT_END_HEADER + +#endif /* __FTSERV_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/ftstream.h b/portlibs/include/freetype/internal/ftstream.h new file mode 100644 index 00000000..a91eb72d --- /dev/null +++ b/portlibs/include/freetype/internal/ftstream.h @@ -0,0 +1,539 @@ +/***************************************************************************/ +/* */ +/* ftstream.h */ +/* */ +/* Stream handling (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2004, 2005, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTSTREAM_H__ +#define __FTSTREAM_H__ + + +#include <ft2build.h> +#include FT_SYSTEM_H +#include FT_INTERNAL_OBJECTS_H + + +FT_BEGIN_HEADER + + + /* format of an 8-bit frame_op value: */ + /* */ + /* bit 76543210 */ + /* xxxxxxes */ + /* */ + /* s is set to 1 if the value is signed. */ + /* e is set to 1 if the value is little-endian. */ + /* xxx is a command. */ + +#define FT_FRAME_OP_SHIFT 2 +#define FT_FRAME_OP_SIGNED 1 +#define FT_FRAME_OP_LITTLE 2 +#define FT_FRAME_OP_COMMAND( x ) ( x >> FT_FRAME_OP_SHIFT ) + +#define FT_MAKE_FRAME_OP( command, little, sign ) \ + ( ( command << FT_FRAME_OP_SHIFT ) | ( little << 1 ) | sign ) + +#define FT_FRAME_OP_END 0 +#define FT_FRAME_OP_START 1 /* start a new frame */ +#define FT_FRAME_OP_BYTE 2 /* read 1-byte value */ +#define FT_FRAME_OP_SHORT 3 /* read 2-byte value */ +#define FT_FRAME_OP_LONG 4 /* read 4-byte value */ +#define FT_FRAME_OP_OFF3 5 /* read 3-byte value */ +#define FT_FRAME_OP_BYTES 6 /* read a bytes sequence */ + + + typedef enum FT_Frame_Op_ + { + ft_frame_end = 0, + ft_frame_start = FT_MAKE_FRAME_OP( FT_FRAME_OP_START, 0, 0 ), + + ft_frame_byte = FT_MAKE_FRAME_OP( FT_FRAME_OP_BYTE, 0, 0 ), + ft_frame_schar = FT_MAKE_FRAME_OP( FT_FRAME_OP_BYTE, 0, 1 ), + + ft_frame_ushort_be = FT_MAKE_FRAME_OP( FT_FRAME_OP_SHORT, 0, 0 ), + ft_frame_short_be = FT_MAKE_FRAME_OP( FT_FRAME_OP_SHORT, 0, 1 ), + ft_frame_ushort_le = FT_MAKE_FRAME_OP( FT_FRAME_OP_SHORT, 1, 0 ), + ft_frame_short_le = FT_MAKE_FRAME_OP( FT_FRAME_OP_SHORT, 1, 1 ), + + ft_frame_ulong_be = FT_MAKE_FRAME_OP( FT_FRAME_OP_LONG, 0, 0 ), + ft_frame_long_be = FT_MAKE_FRAME_OP( FT_FRAME_OP_LONG, 0, 1 ), + ft_frame_ulong_le = FT_MAKE_FRAME_OP( FT_FRAME_OP_LONG, 1, 0 ), + ft_frame_long_le = FT_MAKE_FRAME_OP( FT_FRAME_OP_LONG, 1, 1 ), + + ft_frame_uoff3_be = FT_MAKE_FRAME_OP( FT_FRAME_OP_OFF3, 0, 0 ), + ft_frame_off3_be = FT_MAKE_FRAME_OP( FT_FRAME_OP_OFF3, 0, 1 ), + ft_frame_uoff3_le = FT_MAKE_FRAME_OP( FT_FRAME_OP_OFF3, 1, 0 ), + ft_frame_off3_le = FT_MAKE_FRAME_OP( FT_FRAME_OP_OFF3, 1, 1 ), + + ft_frame_bytes = FT_MAKE_FRAME_OP( FT_FRAME_OP_BYTES, 0, 0 ), + ft_frame_skip = FT_MAKE_FRAME_OP( FT_FRAME_OP_BYTES, 0, 1 ) + + } FT_Frame_Op; + + + typedef struct FT_Frame_Field_ + { + FT_Byte value; + FT_Byte size; + FT_UShort offset; + + } FT_Frame_Field; + + + /* Construct an FT_Frame_Field out of a structure type and a field name. */ + /* The structure type must be set in the FT_STRUCTURE macro before */ + /* calling the FT_FRAME_START() macro. */ + /* */ +#define FT_FIELD_SIZE( f ) \ + (FT_Byte)sizeof ( ((FT_STRUCTURE*)0)->f ) + +#define FT_FIELD_SIZE_DELTA( f ) \ + (FT_Byte)sizeof ( ((FT_STRUCTURE*)0)->f[0] ) + +#define FT_FIELD_OFFSET( f ) \ + (FT_UShort)( offsetof( FT_STRUCTURE, f ) ) + +#define FT_FRAME_FIELD( frame_op, field ) \ + { \ + frame_op, \ + FT_FIELD_SIZE( field ), \ + FT_FIELD_OFFSET( field ) \ + } + +#define FT_MAKE_EMPTY_FIELD( frame_op ) { frame_op, 0, 0 } + +#define FT_FRAME_START( size ) { ft_frame_start, 0, size } +#define FT_FRAME_END { ft_frame_end, 0, 0 } + +#define FT_FRAME_LONG( f ) FT_FRAME_FIELD( ft_frame_long_be, f ) +#define FT_FRAME_ULONG( f ) FT_FRAME_FIELD( ft_frame_ulong_be, f ) +#define FT_FRAME_SHORT( f ) FT_FRAME_FIELD( ft_frame_short_be, f ) +#define FT_FRAME_USHORT( f ) FT_FRAME_FIELD( ft_frame_ushort_be, f ) +#define FT_FRAME_OFF3( f ) FT_FRAME_FIELD( ft_frame_off3_be, f ) +#define FT_FRAME_UOFF3( f ) FT_FRAME_FIELD( ft_frame_uoff3_be, f ) +#define FT_FRAME_BYTE( f ) FT_FRAME_FIELD( ft_frame_byte, f ) +#define FT_FRAME_CHAR( f ) FT_FRAME_FIELD( ft_frame_schar, f ) + +#define FT_FRAME_LONG_LE( f ) FT_FRAME_FIELD( ft_frame_long_le, f ) +#define FT_FRAME_ULONG_LE( f ) FT_FRAME_FIELD( ft_frame_ulong_le, f ) +#define FT_FRAME_SHORT_LE( f ) FT_FRAME_FIELD( ft_frame_short_le, f ) +#define FT_FRAME_USHORT_LE( f ) FT_FRAME_FIELD( ft_frame_ushort_le, f ) +#define FT_FRAME_OFF3_LE( f ) FT_FRAME_FIELD( ft_frame_off3_le, f ) +#define FT_FRAME_UOFF3_LE( f ) FT_FRAME_FIELD( ft_frame_uoff3_le, f ) + +#define FT_FRAME_SKIP_LONG { ft_frame_long_be, 0, 0 } +#define FT_FRAME_SKIP_SHORT { ft_frame_short_be, 0, 0 } +#define FT_FRAME_SKIP_BYTE { ft_frame_byte, 0, 0 } + +#define FT_FRAME_BYTES( field, count ) \ + { \ + ft_frame_bytes, \ + count, \ + FT_FIELD_OFFSET( field ) \ + } + +#define FT_FRAME_SKIP_BYTES( count ) { ft_frame_skip, count, 0 } + + + /*************************************************************************/ + /* */ + /* Integer extraction macros -- the `buffer' parameter must ALWAYS be of */ + /* type `char*' or equivalent (1-byte elements). */ + /* */ + +#define FT_BYTE_( p, i ) ( ((const FT_Byte*)(p))[(i)] ) +#define FT_INT8_( p, i ) ( ((const FT_Char*)(p))[(i)] ) + +#define FT_INT16( x ) ( (FT_Int16)(x) ) +#define FT_UINT16( x ) ( (FT_UInt16)(x) ) +#define FT_INT32( x ) ( (FT_Int32)(x) ) +#define FT_UINT32( x ) ( (FT_UInt32)(x) ) + +#define FT_BYTE_I16( p, i, s ) ( FT_INT16( FT_BYTE_( p, i ) ) << (s) ) +#define FT_BYTE_U16( p, i, s ) ( FT_UINT16( FT_BYTE_( p, i ) ) << (s) ) +#define FT_BYTE_I32( p, i, s ) ( FT_INT32( FT_BYTE_( p, i ) ) << (s) ) +#define FT_BYTE_U32( p, i, s ) ( FT_UINT32( FT_BYTE_( p, i ) ) << (s) ) + +#define FT_INT8_I16( p, i, s ) ( FT_INT16( FT_INT8_( p, i ) ) << (s) ) +#define FT_INT8_U16( p, i, s ) ( FT_UINT16( FT_INT8_( p, i ) ) << (s) ) +#define FT_INT8_I32( p, i, s ) ( FT_INT32( FT_INT8_( p, i ) ) << (s) ) +#define FT_INT8_U32( p, i, s ) ( FT_UINT32( FT_INT8_( p, i ) ) << (s) ) + + +#define FT_PEEK_SHORT( p ) FT_INT16( FT_INT8_I16( p, 0, 8) | \ + FT_BYTE_I16( p, 1, 0) ) + +#define FT_PEEK_USHORT( p ) FT_UINT16( FT_BYTE_U16( p, 0, 8 ) | \ + FT_BYTE_U16( p, 1, 0 ) ) + +#define FT_PEEK_LONG( p ) FT_INT32( FT_INT8_I32( p, 0, 24 ) | \ + FT_BYTE_I32( p, 1, 16 ) | \ + FT_BYTE_I32( p, 2, 8 ) | \ + FT_BYTE_I32( p, 3, 0 ) ) + +#define FT_PEEK_ULONG( p ) FT_UINT32( FT_BYTE_U32( p, 0, 24 ) | \ + FT_BYTE_U32( p, 1, 16 ) | \ + FT_BYTE_U32( p, 2, 8 ) | \ + FT_BYTE_U32( p, 3, 0 ) ) + +#define FT_PEEK_OFF3( p ) FT_INT32( FT_INT8_I32( p, 0, 16 ) | \ + FT_BYTE_I32( p, 1, 8 ) | \ + FT_BYTE_I32( p, 2, 0 ) ) + +#define FT_PEEK_UOFF3( p ) FT_UINT32( FT_BYTE_U32( p, 0, 16 ) | \ + FT_BYTE_U32( p, 1, 8 ) | \ + FT_BYTE_U32( p, 2, 0 ) ) + +#define FT_PEEK_SHORT_LE( p ) FT_INT16( FT_INT8_I16( p, 1, 8 ) | \ + FT_BYTE_I16( p, 0, 0 ) ) + +#define FT_PEEK_USHORT_LE( p ) FT_UINT16( FT_BYTE_U16( p, 1, 8 ) | \ + FT_BYTE_U16( p, 0, 0 ) ) + +#define FT_PEEK_LONG_LE( p ) FT_INT32( FT_INT8_I32( p, 3, 24 ) | \ + FT_BYTE_I32( p, 2, 16 ) | \ + FT_BYTE_I32( p, 1, 8 ) | \ + FT_BYTE_I32( p, 0, 0 ) ) + +#define FT_PEEK_ULONG_LE( p ) FT_UINT32( FT_BYTE_U32( p, 3, 24 ) | \ + FT_BYTE_U32( p, 2, 16 ) | \ + FT_BYTE_U32( p, 1, 8 ) | \ + FT_BYTE_U32( p, 0, 0 ) ) + +#define FT_PEEK_OFF3_LE( p ) FT_INT32( FT_INT8_I32( p, 2, 16 ) | \ + FT_BYTE_I32( p, 1, 8 ) | \ + FT_BYTE_I32( p, 0, 0 ) ) + +#define FT_PEEK_UOFF3_LE( p ) FT_UINT32( FT_BYTE_U32( p, 2, 16 ) | \ + FT_BYTE_U32( p, 1, 8 ) | \ + FT_BYTE_U32( p, 0, 0 ) ) + + +#define FT_NEXT_CHAR( buffer ) \ + ( (signed char)*buffer++ ) + +#define FT_NEXT_BYTE( buffer ) \ + ( (unsigned char)*buffer++ ) + +#define FT_NEXT_SHORT( buffer ) \ + ( (short)( buffer += 2, FT_PEEK_SHORT( buffer - 2 ) ) ) + +#define FT_NEXT_USHORT( buffer ) \ + ( (unsigned short)( buffer += 2, FT_PEEK_USHORT( buffer - 2 ) ) ) + +#define FT_NEXT_OFF3( buffer ) \ + ( (long)( buffer += 3, FT_PEEK_OFF3( buffer - 3 ) ) ) + +#define FT_NEXT_UOFF3( buffer ) \ + ( (unsigned long)( buffer += 3, FT_PEEK_UOFF3( buffer - 3 ) ) ) + +#define FT_NEXT_LONG( buffer ) \ + ( (long)( buffer += 4, FT_PEEK_LONG( buffer - 4 ) ) ) + +#define FT_NEXT_ULONG( buffer ) \ + ( (unsigned long)( buffer += 4, FT_PEEK_ULONG( buffer - 4 ) ) ) + + +#define FT_NEXT_SHORT_LE( buffer ) \ + ( (short)( buffer += 2, FT_PEEK_SHORT_LE( buffer - 2 ) ) ) + +#define FT_NEXT_USHORT_LE( buffer ) \ + ( (unsigned short)( buffer += 2, FT_PEEK_USHORT_LE( buffer - 2 ) ) ) + +#define FT_NEXT_OFF3_LE( buffer ) \ + ( (long)( buffer += 3, FT_PEEK_OFF3_LE( buffer - 3 ) ) ) + +#define FT_NEXT_UOFF3_LE( buffer ) \ + ( (unsigned long)( buffer += 3, FT_PEEK_UOFF3_LE( buffer - 3 ) ) ) + +#define FT_NEXT_LONG_LE( buffer ) \ + ( (long)( buffer += 4, FT_PEEK_LONG_LE( buffer - 4 ) ) ) + +#define FT_NEXT_ULONG_LE( buffer ) \ + ( (unsigned long)( buffer += 4, FT_PEEK_ULONG_LE( buffer - 4 ) ) ) + + + /*************************************************************************/ + /* */ + /* Each GET_xxxx() macro uses an implicit `stream' variable. */ + /* */ +#if 0 +#define FT_GET_MACRO( type ) FT_NEXT_ ## type ( stream->cursor ) + +#define FT_GET_CHAR() FT_GET_MACRO( CHAR ) +#define FT_GET_BYTE() FT_GET_MACRO( BYTE ) +#define FT_GET_SHORT() FT_GET_MACRO( SHORT ) +#define FT_GET_USHORT() FT_GET_MACRO( USHORT ) +#define FT_GET_OFF3() FT_GET_MACRO( OFF3 ) +#define FT_GET_UOFF3() FT_GET_MACRO( UOFF3 ) +#define FT_GET_LONG() FT_GET_MACRO( LONG ) +#define FT_GET_ULONG() FT_GET_MACRO( ULONG ) +#define FT_GET_TAG4() FT_GET_MACRO( ULONG ) + +#define FT_GET_SHORT_LE() FT_GET_MACRO( SHORT_LE ) +#define FT_GET_USHORT_LE() FT_GET_MACRO( USHORT_LE ) +#define FT_GET_LONG_LE() FT_GET_MACRO( LONG_LE ) +#define FT_GET_ULONG_LE() FT_GET_MACRO( ULONG_LE ) + +#else +#define FT_GET_MACRO( func, type ) ( (type)func( stream ) ) + +#define FT_GET_CHAR() FT_GET_MACRO( FT_Stream_GetChar, FT_Char ) +#define FT_GET_BYTE() FT_GET_MACRO( FT_Stream_GetChar, FT_Byte ) +#define FT_GET_SHORT() FT_GET_MACRO( FT_Stream_GetShort, FT_Short ) +#define FT_GET_USHORT() FT_GET_MACRO( FT_Stream_GetShort, FT_UShort ) +#define FT_GET_OFF3() FT_GET_MACRO( FT_Stream_GetOffset, FT_Long ) +#define FT_GET_UOFF3() FT_GET_MACRO( FT_Stream_GetOffset, FT_ULong ) +#define FT_GET_LONG() FT_GET_MACRO( FT_Stream_GetLong, FT_Long ) +#define FT_GET_ULONG() FT_GET_MACRO( FT_Stream_GetLong, FT_ULong ) +#define FT_GET_TAG4() FT_GET_MACRO( FT_Stream_GetLong, FT_ULong ) + +#define FT_GET_SHORT_LE() FT_GET_MACRO( FT_Stream_GetShortLE, FT_Short ) +#define FT_GET_USHORT_LE() FT_GET_MACRO( FT_Stream_GetShortLE, FT_UShort ) +#define FT_GET_LONG_LE() FT_GET_MACRO( FT_Stream_GetLongLE, FT_Long ) +#define FT_GET_ULONG_LE() FT_GET_MACRO( FT_Stream_GetLongLE, FT_ULong ) +#endif + +#define FT_READ_MACRO( func, type, var ) \ + ( var = (type)func( stream, &error ), \ + error != FT_Err_Ok ) + +#define FT_READ_BYTE( var ) FT_READ_MACRO( FT_Stream_ReadChar, FT_Byte, var ) +#define FT_READ_CHAR( var ) FT_READ_MACRO( FT_Stream_ReadChar, FT_Char, var ) +#define FT_READ_SHORT( var ) FT_READ_MACRO( FT_Stream_ReadShort, FT_Short, var ) +#define FT_READ_USHORT( var ) FT_READ_MACRO( FT_Stream_ReadShort, FT_UShort, var ) +#define FT_READ_OFF3( var ) FT_READ_MACRO( FT_Stream_ReadOffset, FT_Long, var ) +#define FT_READ_UOFF3( var ) FT_READ_MACRO( FT_Stream_ReadOffset, FT_ULong, var ) +#define FT_READ_LONG( var ) FT_READ_MACRO( FT_Stream_ReadLong, FT_Long, var ) +#define FT_READ_ULONG( var ) FT_READ_MACRO( FT_Stream_ReadLong, FT_ULong, var ) + +#define FT_READ_SHORT_LE( var ) FT_READ_MACRO( FT_Stream_ReadShortLE, FT_Short, var ) +#define FT_READ_USHORT_LE( var ) FT_READ_MACRO( FT_Stream_ReadShortLE, FT_UShort, var ) +#define FT_READ_LONG_LE( var ) FT_READ_MACRO( FT_Stream_ReadLongLE, FT_Long, var ) +#define FT_READ_ULONG_LE( var ) FT_READ_MACRO( FT_Stream_ReadLongLE, FT_ULong, var ) + + +#ifndef FT_CONFIG_OPTION_NO_DEFAULT_SYSTEM + + /* initialize a stream for reading a regular system stream */ + FT_BASE( FT_Error ) + FT_Stream_Open( FT_Stream stream, + const char* filepathname ); + +#endif /* FT_CONFIG_OPTION_NO_DEFAULT_SYSTEM */ + + + /* create a new (input) stream from an FT_Open_Args structure */ + FT_BASE( FT_Error ) + FT_Stream_New( FT_Library library, + const FT_Open_Args* args, + FT_Stream *astream ); + + /* free a stream */ + FT_BASE( void ) + FT_Stream_Free( FT_Stream stream, + FT_Int external ); + + /* initialize a stream for reading in-memory data */ + FT_BASE( void ) + FT_Stream_OpenMemory( FT_Stream stream, + const FT_Byte* base, + FT_ULong size ); + + /* close a stream (does not destroy the stream structure) */ + FT_BASE( void ) + FT_Stream_Close( FT_Stream stream ); + + + /* seek within a stream. position is relative to start of stream */ + FT_BASE( FT_Error ) + FT_Stream_Seek( FT_Stream stream, + FT_ULong pos ); + + /* skip bytes in a stream */ + FT_BASE( FT_Error ) + FT_Stream_Skip( FT_Stream stream, + FT_Long distance ); + + /* return current stream position */ + FT_BASE( FT_Long ) + FT_Stream_Pos( FT_Stream stream ); + + /* read bytes from a stream into a user-allocated buffer, returns an */ + /* error if not all bytes could be read. */ + FT_BASE( FT_Error ) + FT_Stream_Read( FT_Stream stream, + FT_Byte* buffer, + FT_ULong count ); + + /* read bytes from a stream at a given position */ + FT_BASE( FT_Error ) + FT_Stream_ReadAt( FT_Stream stream, + FT_ULong pos, + FT_Byte* buffer, + FT_ULong count ); + + /* try to read bytes at the end of a stream; return number of bytes */ + /* really available */ + FT_BASE( FT_ULong ) + FT_Stream_TryRead( FT_Stream stream, + FT_Byte* buffer, + FT_ULong count ); + + /* Enter a frame of `count' consecutive bytes in a stream. Returns an */ + /* error if the frame could not be read/accessed. The caller can use */ + /* the FT_Stream_Get_XXX functions to retrieve frame data without */ + /* error checks. */ + /* */ + /* You must _always_ call FT_Stream_ExitFrame() once you have entered */ + /* a stream frame! */ + /* */ + FT_BASE( FT_Error ) + FT_Stream_EnterFrame( FT_Stream stream, + FT_ULong count ); + + /* exit a stream frame */ + FT_BASE( void ) + FT_Stream_ExitFrame( FT_Stream stream ); + + /* Extract a stream frame. If the stream is disk-based, a heap block */ + /* is allocated and the frame bytes are read into it. If the stream */ + /* is memory-based, this function simply set a pointer to the data. */ + /* */ + /* Useful to optimize access to memory-based streams transparently. */ + /* */ + /* All extracted frames must be `freed' with a call to the function */ + /* FT_Stream_ReleaseFrame(). */ + /* */ + FT_BASE( FT_Error ) + FT_Stream_ExtractFrame( FT_Stream stream, + FT_ULong count, + FT_Byte** pbytes ); + + /* release an extract frame (see FT_Stream_ExtractFrame) */ + FT_BASE( void ) + FT_Stream_ReleaseFrame( FT_Stream stream, + FT_Byte** pbytes ); + + /* read a byte from an entered frame */ + FT_BASE( FT_Char ) + FT_Stream_GetChar( FT_Stream stream ); + + /* read a 16-bit big-endian integer from an entered frame */ + FT_BASE( FT_Short ) + FT_Stream_GetShort( FT_Stream stream ); + + /* read a 24-bit big-endian integer from an entered frame */ + FT_BASE( FT_Long ) + FT_Stream_GetOffset( FT_Stream stream ); + + /* read a 32-bit big-endian integer from an entered frame */ + FT_BASE( FT_Long ) + FT_Stream_GetLong( FT_Stream stream ); + + /* read a 16-bit little-endian integer from an entered frame */ + FT_BASE( FT_Short ) + FT_Stream_GetShortLE( FT_Stream stream ); + + /* read a 32-bit little-endian integer from an entered frame */ + FT_BASE( FT_Long ) + FT_Stream_GetLongLE( FT_Stream stream ); + + + /* read a byte from a stream */ + FT_BASE( FT_Char ) + FT_Stream_ReadChar( FT_Stream stream, + FT_Error* error ); + + /* read a 16-bit big-endian integer from a stream */ + FT_BASE( FT_Short ) + FT_Stream_ReadShort( FT_Stream stream, + FT_Error* error ); + + /* read a 24-bit big-endian integer from a stream */ + FT_BASE( FT_Long ) + FT_Stream_ReadOffset( FT_Stream stream, + FT_Error* error ); + + /* read a 32-bit big-endian integer from a stream */ + FT_BASE( FT_Long ) + FT_Stream_ReadLong( FT_Stream stream, + FT_Error* error ); + + /* read a 16-bit little-endian integer from a stream */ + FT_BASE( FT_Short ) + FT_Stream_ReadShortLE( FT_Stream stream, + FT_Error* error ); + + /* read a 32-bit little-endian integer from a stream */ + FT_BASE( FT_Long ) + FT_Stream_ReadLongLE( FT_Stream stream, + FT_Error* error ); + + /* Read a structure from a stream. The structure must be described */ + /* by an array of FT_Frame_Field records. */ + FT_BASE( FT_Error ) + FT_Stream_ReadFields( FT_Stream stream, + const FT_Frame_Field* fields, + void* structure ); + + +#define FT_STREAM_POS() \ + FT_Stream_Pos( stream ) + +#define FT_STREAM_SEEK( position ) \ + FT_SET_ERROR( FT_Stream_Seek( stream, position ) ) + +#define FT_STREAM_SKIP( distance ) \ + FT_SET_ERROR( FT_Stream_Skip( stream, distance ) ) + +#define FT_STREAM_READ( buffer, count ) \ + FT_SET_ERROR( FT_Stream_Read( stream, \ + (FT_Byte*)buffer, \ + count ) ) + +#define FT_STREAM_READ_AT( position, buffer, count ) \ + FT_SET_ERROR( FT_Stream_ReadAt( stream, \ + position, \ + (FT_Byte*)buffer, \ + count ) ) + +#define FT_STREAM_READ_FIELDS( fields, object ) \ + FT_SET_ERROR( FT_Stream_ReadFields( stream, fields, object ) ) + + +#define FT_FRAME_ENTER( size ) \ + FT_SET_ERROR( \ + FT_DEBUG_INNER( FT_Stream_EnterFrame( stream, size ) ) ) + +#define FT_FRAME_EXIT() \ + FT_DEBUG_INNER( FT_Stream_ExitFrame( stream ) ) + +#define FT_FRAME_EXTRACT( size, bytes ) \ + FT_SET_ERROR( \ + FT_DEBUG_INNER( FT_Stream_ExtractFrame( stream, size, \ + (FT_Byte**)&(bytes) ) ) ) + +#define FT_FRAME_RELEASE( bytes ) \ + FT_DEBUG_INNER( FT_Stream_ReleaseFrame( stream, \ + (FT_Byte**)&(bytes) ) ) + + +FT_END_HEADER + +#endif /* __FTSTREAM_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/fttrace.h b/portlibs/include/freetype/internal/fttrace.h new file mode 100644 index 00000000..4d38a462 --- /dev/null +++ b/portlibs/include/freetype/internal/fttrace.h @@ -0,0 +1,134 @@ +/***************************************************************************/ +/* */ +/* fttrace.h */ +/* */ +/* Tracing handling (specification only). */ +/* */ +/* Copyright 2002, 2004, 2005, 2006, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /* definitions of trace levels for FreeType 2 */ + + /* the first level must always be `trace_any' */ +FT_TRACE_DEF( any ) + + /* base components */ +FT_TRACE_DEF( calc ) /* calculations (ftcalc.c) */ +FT_TRACE_DEF( memory ) /* memory manager (ftobjs.c) */ +FT_TRACE_DEF( stream ) /* stream manager (ftstream.c) */ +FT_TRACE_DEF( io ) /* i/o interface (ftsystem.c) */ +FT_TRACE_DEF( list ) /* list management (ftlist.c) */ +FT_TRACE_DEF( init ) /* initialization (ftinit.c) */ +FT_TRACE_DEF( objs ) /* base objects (ftobjs.c) */ +FT_TRACE_DEF( outline ) /* outline management (ftoutln.c) */ +FT_TRACE_DEF( glyph ) /* glyph management (ftglyph.c) */ + +FT_TRACE_DEF( raster ) /* monochrome rasterizer (ftraster.c) */ +FT_TRACE_DEF( smooth ) /* anti-aliasing raster (ftgrays.c) */ +FT_TRACE_DEF( mm ) /* MM interface (ftmm.c) */ +FT_TRACE_DEF( raccess ) /* resource fork accessor (ftrfork.c) */ + + /* Cache sub-system */ +FT_TRACE_DEF( cache ) /* cache sub-system (ftcache.c, etc.) */ + + /* SFNT driver components */ +FT_TRACE_DEF( sfobjs ) /* SFNT object handler (sfobjs.c) */ +FT_TRACE_DEF( ttcmap ) /* charmap handler (ttcmap.c) */ +FT_TRACE_DEF( ttkern ) /* kerning handler (ttkern.c) */ +FT_TRACE_DEF( ttload ) /* basic TrueType tables (ttload.c) */ +FT_TRACE_DEF( ttmtx ) /* metrics-related tables (ttmtx.c) */ +FT_TRACE_DEF( ttpost ) /* PS table processing (ttpost.c) */ +FT_TRACE_DEF( ttsbit ) /* TrueType sbit handling (ttsbit.c) */ + + /* TrueType driver components */ +FT_TRACE_DEF( ttdriver ) /* TT font driver (ttdriver.c) */ +FT_TRACE_DEF( ttgload ) /* TT glyph loader (ttgload.c) */ +FT_TRACE_DEF( ttinterp ) /* bytecode interpreter (ttinterp.c) */ +FT_TRACE_DEF( ttobjs ) /* TT objects manager (ttobjs.c) */ +FT_TRACE_DEF( ttpload ) /* TT data/program loader (ttpload.c) */ +FT_TRACE_DEF( ttgxvar ) /* TrueType GX var handler (ttgxvar.c) */ + + /* Type 1 driver components */ +FT_TRACE_DEF( t1driver ) +FT_TRACE_DEF( t1gload ) +FT_TRACE_DEF( t1hint ) +FT_TRACE_DEF( t1load ) +FT_TRACE_DEF( t1objs ) +FT_TRACE_DEF( t1parse ) + + /* PostScript helper module `psaux' */ +FT_TRACE_DEF( t1decode ) +FT_TRACE_DEF( psobjs ) + + /* PostScript hinting module `pshinter' */ +FT_TRACE_DEF( pshrec ) +FT_TRACE_DEF( pshalgo1 ) +FT_TRACE_DEF( pshalgo2 ) + + /* Type 2 driver components */ +FT_TRACE_DEF( cffdriver ) +FT_TRACE_DEF( cffgload ) +FT_TRACE_DEF( cffload ) +FT_TRACE_DEF( cffobjs ) +FT_TRACE_DEF( cffparse ) + + /* Type 42 driver component */ +FT_TRACE_DEF( t42 ) + + /* CID driver components */ +FT_TRACE_DEF( cidafm ) +FT_TRACE_DEF( ciddriver ) +FT_TRACE_DEF( cidgload ) +FT_TRACE_DEF( cidload ) +FT_TRACE_DEF( cidobjs ) +FT_TRACE_DEF( cidparse ) + + /* Windows font component */ +FT_TRACE_DEF( winfnt ) + + /* PCF font components */ +FT_TRACE_DEF( pcfdriver ) +FT_TRACE_DEF( pcfread ) + + /* BDF font components */ +FT_TRACE_DEF( bdfdriver ) +FT_TRACE_DEF( bdflib ) + + /* PFR font component */ +FT_TRACE_DEF( pfr ) + + /* OpenType validation components */ +FT_TRACE_DEF( otvmodule ) +FT_TRACE_DEF( otvcommon ) +FT_TRACE_DEF( otvbase ) +FT_TRACE_DEF( otvgdef ) +FT_TRACE_DEF( otvgpos ) +FT_TRACE_DEF( otvgsub ) +FT_TRACE_DEF( otvjstf ) +FT_TRACE_DEF( otvmath ) + + /* TrueTypeGX/AAT validation components */ +FT_TRACE_DEF( gxvmodule ) +FT_TRACE_DEF( gxvcommon ) +FT_TRACE_DEF( gxvfeat ) +FT_TRACE_DEF( gxvmort ) +FT_TRACE_DEF( gxvmorx ) +FT_TRACE_DEF( gxvbsln ) +FT_TRACE_DEF( gxvjust ) +FT_TRACE_DEF( gxvkern ) +FT_TRACE_DEF( gxvopbd ) +FT_TRACE_DEF( gxvtrak ) +FT_TRACE_DEF( gxvprop ) +FT_TRACE_DEF( gxvlcar ) + + +/* END */ diff --git a/portlibs/include/freetype/internal/ftvalid.h b/portlibs/include/freetype/internal/ftvalid.h new file mode 100644 index 00000000..00cd85e7 --- /dev/null +++ b/portlibs/include/freetype/internal/ftvalid.h @@ -0,0 +1,150 @@ +/***************************************************************************/ +/* */ +/* ftvalid.h */ +/* */ +/* FreeType validation support (specification). */ +/* */ +/* Copyright 2004 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __FTVALID_H__ +#define __FTVALID_H__ + +#include <ft2build.h> +#include FT_CONFIG_STANDARD_LIBRARY_H /* for ft_setjmp and ft_longjmp */ + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /**** ****/ + /**** ****/ + /**** V A L I D A T I O N ****/ + /**** ****/ + /**** ****/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + /* handle to a validation object */ + typedef struct FT_ValidatorRec_ volatile* FT_Validator; + + + /*************************************************************************/ + /* */ + /* There are three distinct validation levels defined here: */ + /* */ + /* FT_VALIDATE_DEFAULT :: */ + /* A table that passes this validation level can be used reliably by */ + /* FreeType. It generally means that all offsets have been checked to */ + /* prevent out-of-bound reads, that array counts are correct, etc. */ + /* */ + /* FT_VALIDATE_TIGHT :: */ + /* A table that passes this validation level can be used reliably and */ + /* doesn't contain invalid data. For example, a charmap table that */ + /* returns invalid glyph indices will not pass, even though it can */ + /* be used with FreeType in default mode (the library will simply */ + /* return an error later when trying to load the glyph). */ + /* */ + /* It also checks that fields which must be a multiple of 2, 4, or 8, */ + /* don't have incorrect values, etc. */ + /* */ + /* FT_VALIDATE_PARANOID :: */ + /* Only for font debugging. Checks that a table follows the */ + /* specification by 100%. Very few fonts will be able to pass this */ + /* level anyway but it can be useful for certain tools like font */ + /* editors/converters. */ + /* */ + typedef enum FT_ValidationLevel_ + { + FT_VALIDATE_DEFAULT = 0, + FT_VALIDATE_TIGHT, + FT_VALIDATE_PARANOID + + } FT_ValidationLevel; + + + /* validator structure */ + typedef struct FT_ValidatorRec_ + { + const FT_Byte* base; /* address of table in memory */ + const FT_Byte* limit; /* `base' + sizeof(table) in memory */ + FT_ValidationLevel level; /* validation level */ + FT_Error error; /* error returned. 0 means success */ + + ft_jmp_buf jump_buffer; /* used for exception handling */ + + } FT_ValidatorRec; + + +#define FT_VALIDATOR( x ) ((FT_Validator)( x )) + + + FT_BASE( void ) + ft_validator_init( FT_Validator valid, + const FT_Byte* base, + const FT_Byte* limit, + FT_ValidationLevel level ); + + /* Do not use this. It's broken and will cause your validator to crash */ + /* if you run it on an invalid font. */ + FT_BASE( FT_Int ) + ft_validator_run( FT_Validator valid ); + + /* Sets the error field in a validator, then calls `longjmp' to return */ + /* to high-level caller. Using `setjmp/longjmp' avoids many stupid */ + /* error checks within the validation routines. */ + /* */ + FT_BASE( void ) + ft_validator_error( FT_Validator valid, + FT_Error error ); + + + /* Calls ft_validate_error. Assumes that the `valid' local variable */ + /* holds a pointer to the current validator object. */ + /* */ + /* Use preprocessor prescan to pass FT_ERR_PREFIX. */ + /* */ +#define FT_INVALID( _prefix, _error ) FT_INVALID_( _prefix, _error ) +#define FT_INVALID_( _prefix, _error ) \ + ft_validator_error( valid, _prefix ## _error ) + + /* called when a broken table is detected */ +#define FT_INVALID_TOO_SHORT \ + FT_INVALID( FT_ERR_PREFIX, Invalid_Table ) + + /* called when an invalid offset is detected */ +#define FT_INVALID_OFFSET \ + FT_INVALID( FT_ERR_PREFIX, Invalid_Offset ) + + /* called when an invalid format/value is detected */ +#define FT_INVALID_FORMAT \ + FT_INVALID( FT_ERR_PREFIX, Invalid_Table ) + + /* called when an invalid glyph index is detected */ +#define FT_INVALID_GLYPH_ID \ + FT_INVALID( FT_ERR_PREFIX, Invalid_Glyph_Index ) + + /* called when an invalid field value is detected */ +#define FT_INVALID_DATA \ + FT_INVALID( FT_ERR_PREFIX, Invalid_Table ) + + +FT_END_HEADER + +#endif /* __FTVALID_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/internal.h b/portlibs/include/freetype/internal/internal.h new file mode 100644 index 00000000..27d5dc58 --- /dev/null +++ b/portlibs/include/freetype/internal/internal.h @@ -0,0 +1,50 @@ +/***************************************************************************/ +/* */ +/* internal.h */ +/* */ +/* Internal header files (specification only). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This file is automatically included by `ft2build.h'. */ + /* Do not include it manually! */ + /* */ + /*************************************************************************/ + + +#define FT_INTERNAL_OBJECTS_H <freetype/internal/ftobjs.h> +#define FT_INTERNAL_STREAM_H <freetype/internal/ftstream.h> +#define FT_INTERNAL_MEMORY_H <freetype/internal/ftmemory.h> +#define FT_INTERNAL_DEBUG_H <freetype/internal/ftdebug.h> +#define FT_INTERNAL_CALC_H <freetype/internal/ftcalc.h> +#define FT_INTERNAL_DRIVER_H <freetype/internal/ftdriver.h> +#define FT_INTERNAL_TRACE_H <freetype/internal/fttrace.h> +#define FT_INTERNAL_GLYPH_LOADER_H <freetype/internal/ftgloadr.h> +#define FT_INTERNAL_SFNT_H <freetype/internal/sfnt.h> +#define FT_INTERNAL_SERVICE_H <freetype/internal/ftserv.h> +#define FT_INTERNAL_RFORK_H <freetype/internal/ftrfork.h> +#define FT_INTERNAL_VALIDATE_H <freetype/internal/ftvalid.h> + +#define FT_INTERNAL_TRUETYPE_TYPES_H <freetype/internal/tttypes.h> +#define FT_INTERNAL_TYPE1_TYPES_H <freetype/internal/t1types.h> + +#define FT_INTERNAL_POSTSCRIPT_AUX_H <freetype/internal/psaux.h> +#define FT_INTERNAL_POSTSCRIPT_HINTS_H <freetype/internal/pshints.h> +#define FT_INTERNAL_POSTSCRIPT_GLOBALS_H <freetype/internal/psglobal.h> + +#define FT_INTERNAL_AUTOHINT_H <freetype/internal/autohint.h> + + +/* END */ diff --git a/portlibs/include/freetype/internal/pcftypes.h b/portlibs/include/freetype/internal/pcftypes.h new file mode 100644 index 00000000..382796ff --- /dev/null +++ b/portlibs/include/freetype/internal/pcftypes.h @@ -0,0 +1,56 @@ +/* pcftypes.h + + FreeType font driver for pcf fonts + + Copyright (C) 2000, 2001, 2002 by + Francesco Zappa Nardelli + +Permission is hereby granted, free of charge, to any person obtaining a copy +of this software and associated documentation files (the "Software"), to deal +in the Software without restriction, including without limitation the rights +to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +copies of the Software, and to permit persons to whom the Software is +furnished to do so, subject to the following conditions: + +The above copyright notice and this permission notice shall be included in +all copies or substantial portions of the Software. + +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +THE SOFTWARE. +*/ + + +#ifndef __PCFTYPES_H__ +#define __PCFTYPES_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + + +FT_BEGIN_HEADER + + + typedef struct PCF_Public_FaceRec_ + { + FT_FaceRec root; + FT_StreamRec gzip_stream; + FT_Stream gzip_source; + + char* charset_encoding; + char* charset_registry; + + } PCF_Public_FaceRec, *PCF_Public_Face; + + +FT_END_HEADER + +#endif /* __PCFTYPES_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/psaux.h b/portlibs/include/freetype/internal/psaux.h new file mode 100644 index 00000000..832d63df --- /dev/null +++ b/portlibs/include/freetype/internal/psaux.h @@ -0,0 +1,875 @@ +/***************************************************************************/ +/* */ +/* psaux.h */ +/* */ +/* Auxiliary functions and data structures related to PostScript fonts */ +/* (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2006, 2008, 2009 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __PSAUX_H__ +#define __PSAUX_H__ + + +#include <ft2build.h> +#include FT_INTERNAL_OBJECTS_H +#include FT_INTERNAL_TYPE1_TYPES_H +#include FT_SERVICE_POSTSCRIPT_CMAPS_H + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** T1_TABLE *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + + typedef struct PS_TableRec_* PS_Table; + typedef const struct PS_Table_FuncsRec_* PS_Table_Funcs; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* PS_Table_FuncsRec */ + /* */ + /* <Description> */ + /* A set of function pointers to manage PS_Table objects. */ + /* */ + /* <Fields> */ + /* table_init :: Used to initialize a table. */ + /* */ + /* table_done :: Finalizes resp. destroy a given table. */ + /* */ + /* table_add :: Adds a new object to a table. */ + /* */ + /* table_release :: Releases table data, then finalizes it. */ + /* */ + typedef struct PS_Table_FuncsRec_ + { + FT_Error + (*init)( PS_Table table, + FT_Int count, + FT_Memory memory ); + + void + (*done)( PS_Table table ); + + FT_Error + (*add)( PS_Table table, + FT_Int idx, + void* object, + FT_PtrDist length ); + + void + (*release)( PS_Table table ); + + } PS_Table_FuncsRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* PS_TableRec */ + /* */ + /* <Description> */ + /* A PS_Table is a simple object used to store an array of objects in */ + /* a single memory block. */ + /* */ + /* <Fields> */ + /* block :: The address in memory of the growheap's block. This */ + /* can change between two object adds, due to */ + /* reallocation. */ + /* */ + /* cursor :: The current top of the grow heap within its block. */ + /* */ + /* capacity :: The current size of the heap block. Increments by */ + /* 1kByte chunks. */ + /* */ + /* max_elems :: The maximum number of elements in table. */ + /* */ + /* num_elems :: The current number of elements in table. */ + /* */ + /* elements :: A table of element addresses within the block. */ + /* */ + /* lengths :: A table of element sizes within the block. */ + /* */ + /* memory :: The object used for memory operations */ + /* (alloc/realloc). */ + /* */ + /* funcs :: A table of method pointers for this object. */ + /* */ + typedef struct PS_TableRec_ + { + FT_Byte* block; /* current memory block */ + FT_Offset cursor; /* current cursor in memory block */ + FT_Offset capacity; /* current size of memory block */ + FT_Long init; + + FT_Int max_elems; + FT_Int num_elems; + FT_Byte** elements; /* addresses of table elements */ + FT_PtrDist* lengths; /* lengths of table elements */ + + FT_Memory memory; + PS_Table_FuncsRec funcs; + + } PS_TableRec; + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** T1 FIELDS & TOKENS *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + typedef struct PS_ParserRec_* PS_Parser; + + typedef struct T1_TokenRec_* T1_Token; + + typedef struct T1_FieldRec_* T1_Field; + + + /* simple enumeration type used to identify token types */ + typedef enum T1_TokenType_ + { + T1_TOKEN_TYPE_NONE = 0, + T1_TOKEN_TYPE_ANY, + T1_TOKEN_TYPE_STRING, + T1_TOKEN_TYPE_ARRAY, + T1_TOKEN_TYPE_KEY, /* aka `name' */ + + /* do not remove */ + T1_TOKEN_TYPE_MAX + + } T1_TokenType; + + + /* a simple structure used to identify tokens */ + typedef struct T1_TokenRec_ + { + FT_Byte* start; /* first character of token in input stream */ + FT_Byte* limit; /* first character after the token */ + T1_TokenType type; /* type of token */ + + } T1_TokenRec; + + + /* enumeration type used to identify object fields */ + typedef enum T1_FieldType_ + { + T1_FIELD_TYPE_NONE = 0, + T1_FIELD_TYPE_BOOL, + T1_FIELD_TYPE_INTEGER, + T1_FIELD_TYPE_FIXED, + T1_FIELD_TYPE_FIXED_1000, + T1_FIELD_TYPE_STRING, + T1_FIELD_TYPE_KEY, + T1_FIELD_TYPE_BBOX, + T1_FIELD_TYPE_INTEGER_ARRAY, + T1_FIELD_TYPE_FIXED_ARRAY, + T1_FIELD_TYPE_CALLBACK, + + /* do not remove */ + T1_FIELD_TYPE_MAX + + } T1_FieldType; + + + typedef enum T1_FieldLocation_ + { + T1_FIELD_LOCATION_CID_INFO, + T1_FIELD_LOCATION_FONT_DICT, + T1_FIELD_LOCATION_FONT_INFO, + T1_FIELD_LOCATION_PRIVATE, + T1_FIELD_LOCATION_BBOX, + T1_FIELD_LOCATION_LOADER, + T1_FIELD_LOCATION_FACE, + T1_FIELD_LOCATION_BLEND, + + /* do not remove */ + T1_FIELD_LOCATION_MAX + + } T1_FieldLocation; + + + typedef void + (*T1_Field_ParseFunc)( FT_Face face, + FT_Pointer parser ); + + + /* structure type used to model object fields */ + typedef struct T1_FieldRec_ + { + const char* ident; /* field identifier */ + T1_FieldLocation location; + T1_FieldType type; /* type of field */ + T1_Field_ParseFunc reader; + FT_UInt offset; /* offset of field in object */ + FT_Byte size; /* size of field in bytes */ + FT_UInt array_max; /* maximal number of elements for */ + /* array */ + FT_UInt count_offset; /* offset of element count for */ + /* arrays; must not be zero if in */ + /* use -- in other words, a */ + /* `num_FOO' element must not */ + /* start the used structure if we */ + /* parse a `FOO' array */ + FT_UInt dict; /* where we expect it */ + } T1_FieldRec; + +#define T1_FIELD_DICT_FONTDICT ( 1 << 0 ) /* also FontInfo and FDArray */ +#define T1_FIELD_DICT_PRIVATE ( 1 << 1 ) + + + +#define T1_NEW_SIMPLE_FIELD( _ident, _type, _fname, _dict ) \ + { \ + _ident, T1CODE, _type, \ + 0, \ + FT_FIELD_OFFSET( _fname ), \ + FT_FIELD_SIZE( _fname ), \ + 0, 0, \ + _dict \ + }, + +#define T1_NEW_CALLBACK_FIELD( _ident, _reader, _dict ) \ + { \ + _ident, T1CODE, T1_FIELD_TYPE_CALLBACK, \ + (T1_Field_ParseFunc)_reader, \ + 0, 0, \ + 0, 0, \ + _dict \ + }, + +#define T1_NEW_TABLE_FIELD( _ident, _type, _fname, _max, _dict ) \ + { \ + _ident, T1CODE, _type, \ + 0, \ + FT_FIELD_OFFSET( _fname ), \ + FT_FIELD_SIZE_DELTA( _fname ), \ + _max, \ + FT_FIELD_OFFSET( num_ ## _fname ), \ + _dict \ + }, + +#define T1_NEW_TABLE_FIELD2( _ident, _type, _fname, _max, _dict ) \ + { \ + _ident, T1CODE, _type, \ + 0, \ + FT_FIELD_OFFSET( _fname ), \ + FT_FIELD_SIZE_DELTA( _fname ), \ + _max, 0, \ + _dict \ + }, + + +#define T1_FIELD_BOOL( _ident, _fname, _dict ) \ + T1_NEW_SIMPLE_FIELD( _ident, T1_FIELD_TYPE_BOOL, _fname, _dict ) + +#define T1_FIELD_NUM( _ident, _fname, _dict ) \ + T1_NEW_SIMPLE_FIELD( _ident, T1_FIELD_TYPE_INTEGER, _fname, _dict ) + +#define T1_FIELD_FIXED( _ident, _fname, _dict ) \ + T1_NEW_SIMPLE_FIELD( _ident, T1_FIELD_TYPE_FIXED, _fname, _dict ) + +#define T1_FIELD_FIXED_1000( _ident, _fname, _dict ) \ + T1_NEW_SIMPLE_FIELD( _ident, T1_FIELD_TYPE_FIXED_1000, _fname, \ + _dict ) + +#define T1_FIELD_STRING( _ident, _fname, _dict ) \ + T1_NEW_SIMPLE_FIELD( _ident, T1_FIELD_TYPE_STRING, _fname, _dict ) + +#define T1_FIELD_KEY( _ident, _fname, _dict ) \ + T1_NEW_SIMPLE_FIELD( _ident, T1_FIELD_TYPE_KEY, _fname, _dict ) + +#define T1_FIELD_BBOX( _ident, _fname, _dict ) \ + T1_NEW_SIMPLE_FIELD( _ident, T1_FIELD_TYPE_BBOX, _fname, _dict ) + + +#define T1_FIELD_NUM_TABLE( _ident, _fname, _fmax, _dict ) \ + T1_NEW_TABLE_FIELD( _ident, T1_FIELD_TYPE_INTEGER_ARRAY, \ + _fname, _fmax, _dict ) + +#define T1_FIELD_FIXED_TABLE( _ident, _fname, _fmax, _dict ) \ + T1_NEW_TABLE_FIELD( _ident, T1_FIELD_TYPE_FIXED_ARRAY, \ + _fname, _fmax, _dict ) + +#define T1_FIELD_NUM_TABLE2( _ident, _fname, _fmax, _dict ) \ + T1_NEW_TABLE_FIELD2( _ident, T1_FIELD_TYPE_INTEGER_ARRAY, \ + _fname, _fmax, _dict ) + +#define T1_FIELD_FIXED_TABLE2( _ident, _fname, _fmax, _dict ) \ + T1_NEW_TABLE_FIELD2( _ident, T1_FIELD_TYPE_FIXED_ARRAY, \ + _fname, _fmax, _dict ) + +#define T1_FIELD_CALLBACK( _ident, _name, _dict ) \ + T1_NEW_CALLBACK_FIELD( _ident, _name, _dict ) + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** T1 PARSER *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + typedef const struct PS_Parser_FuncsRec_* PS_Parser_Funcs; + + typedef struct PS_Parser_FuncsRec_ + { + void + (*init)( PS_Parser parser, + FT_Byte* base, + FT_Byte* limit, + FT_Memory memory ); + + void + (*done)( PS_Parser parser ); + + void + (*skip_spaces)( PS_Parser parser ); + void + (*skip_PS_token)( PS_Parser parser ); + + FT_Long + (*to_int)( PS_Parser parser ); + FT_Fixed + (*to_fixed)( PS_Parser parser, + FT_Int power_ten ); + + FT_Error + (*to_bytes)( PS_Parser parser, + FT_Byte* bytes, + FT_Long max_bytes, + FT_Long* pnum_bytes, + FT_Bool delimiters ); + + FT_Int + (*to_coord_array)( PS_Parser parser, + FT_Int max_coords, + FT_Short* coords ); + FT_Int + (*to_fixed_array)( PS_Parser parser, + FT_Int max_values, + FT_Fixed* values, + FT_Int power_ten ); + + void + (*to_token)( PS_Parser parser, + T1_Token token ); + void + (*to_token_array)( PS_Parser parser, + T1_Token tokens, + FT_UInt max_tokens, + FT_Int* pnum_tokens ); + + FT_Error + (*load_field)( PS_Parser parser, + const T1_Field field, + void** objects, + FT_UInt max_objects, + FT_ULong* pflags ); + + FT_Error + (*load_field_table)( PS_Parser parser, + const T1_Field field, + void** objects, + FT_UInt max_objects, + FT_ULong* pflags ); + + } PS_Parser_FuncsRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* PS_ParserRec */ + /* */ + /* <Description> */ + /* A PS_Parser is an object used to parse a Type 1 font very quickly. */ + /* */ + /* <Fields> */ + /* cursor :: The current position in the text. */ + /* */ + /* base :: Start of the processed text. */ + /* */ + /* limit :: End of the processed text. */ + /* */ + /* error :: The last error returned. */ + /* */ + /* memory :: The object used for memory operations (alloc/realloc). */ + /* */ + /* funcs :: A table of functions for the parser. */ + /* */ + typedef struct PS_ParserRec_ + { + FT_Byte* cursor; + FT_Byte* base; + FT_Byte* limit; + FT_Error error; + FT_Memory memory; + + PS_Parser_FuncsRec funcs; + + } PS_ParserRec; + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** T1 BUILDER *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + + typedef struct T1_BuilderRec_* T1_Builder; + + + typedef FT_Error + (*T1_Builder_Check_Points_Func)( T1_Builder builder, + FT_Int count ); + + typedef void + (*T1_Builder_Add_Point_Func)( T1_Builder builder, + FT_Pos x, + FT_Pos y, + FT_Byte flag ); + + typedef FT_Error + (*T1_Builder_Add_Point1_Func)( T1_Builder builder, + FT_Pos x, + FT_Pos y ); + + typedef FT_Error + (*T1_Builder_Add_Contour_Func)( T1_Builder builder ); + + typedef FT_Error + (*T1_Builder_Start_Point_Func)( T1_Builder builder, + FT_Pos x, + FT_Pos y ); + + typedef void + (*T1_Builder_Close_Contour_Func)( T1_Builder builder ); + + + typedef const struct T1_Builder_FuncsRec_* T1_Builder_Funcs; + + typedef struct T1_Builder_FuncsRec_ + { + void + (*init)( T1_Builder builder, + FT_Face face, + FT_Size size, + FT_GlyphSlot slot, + FT_Bool hinting ); + + void + (*done)( T1_Builder builder ); + + T1_Builder_Check_Points_Func check_points; + T1_Builder_Add_Point_Func add_point; + T1_Builder_Add_Point1_Func add_point1; + T1_Builder_Add_Contour_Func add_contour; + T1_Builder_Start_Point_Func start_point; + T1_Builder_Close_Contour_Func close_contour; + + } T1_Builder_FuncsRec; + + + /* an enumeration type to handle charstring parsing states */ + typedef enum T1_ParseState_ + { + T1_Parse_Start, + T1_Parse_Have_Width, + T1_Parse_Have_Moveto, + T1_Parse_Have_Path + + } T1_ParseState; + + + /*************************************************************************/ + /* */ + /* <Structure> */ + /* T1_BuilderRec */ + /* */ + /* <Description> */ + /* A structure used during glyph loading to store its outline. */ + /* */ + /* <Fields> */ + /* memory :: The current memory object. */ + /* */ + /* face :: The current face object. */ + /* */ + /* glyph :: The current glyph slot. */ + /* */ + /* loader :: XXX */ + /* */ + /* base :: The base glyph outline. */ + /* */ + /* current :: The current glyph outline. */ + /* */ + /* max_points :: maximum points in builder outline */ + /* */ + /* max_contours :: Maximal number of contours in builder outline. */ + /* */ + /* last :: The last point position. */ + /* */ + /* pos_x :: The horizontal translation (if composite glyph). */ + /* */ + /* pos_y :: The vertical translation (if composite glyph). */ + /* */ + /* left_bearing :: The left side bearing point. */ + /* */ + /* advance :: The horizontal advance vector. */ + /* */ + /* bbox :: Unused. */ + /* */ + /* parse_state :: An enumeration which controls the charstring */ + /* parsing state. */ + /* */ + /* load_points :: If this flag is not set, no points are loaded. */ + /* */ + /* no_recurse :: Set but not used. */ + /* */ + /* metrics_only :: A boolean indicating that we only want to compute */ + /* the metrics of a given glyph, not load all of its */ + /* points. */ + /* */ + /* funcs :: An array of function pointers for the builder. */ + /* */ + typedef struct T1_BuilderRec_ + { + FT_Memory memory; + FT_Face face; + FT_GlyphSlot glyph; + FT_GlyphLoader loader; + FT_Outline* base; + FT_Outline* current; + + FT_Vector last; + + FT_Pos pos_x; + FT_Pos pos_y; + + FT_Vector left_bearing; + FT_Vector advance; + + FT_BBox bbox; /* bounding box */ + T1_ParseState parse_state; + FT_Bool load_points; + FT_Bool no_recurse; + FT_Bool shift; + + FT_Bool metrics_only; + + void* hints_funcs; /* hinter-specific */ + void* hints_globals; /* hinter-specific */ + + T1_Builder_FuncsRec funcs; + + } T1_BuilderRec; + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** T1 DECODER *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + +#if 0 + + /*************************************************************************/ + /* */ + /* T1_MAX_SUBRS_CALLS details the maximum number of nested sub-routine */ + /* calls during glyph loading. */ + /* */ +#define T1_MAX_SUBRS_CALLS 8 + + + /*************************************************************************/ + /* */ + /* T1_MAX_CHARSTRING_OPERANDS is the charstring stack's capacity. A */ + /* minimum of 16 is required. */ + /* */ +#define T1_MAX_CHARSTRINGS_OPERANDS 32 + +#endif /* 0 */ + + + typedef struct T1_Decoder_ZoneRec_ + { + FT_Byte* cursor; + FT_Byte* base; + FT_Byte* limit; + + } T1_Decoder_ZoneRec, *T1_Decoder_Zone; + + + typedef struct T1_DecoderRec_* T1_Decoder; + typedef const struct T1_Decoder_FuncsRec_* T1_Decoder_Funcs; + + + typedef FT_Error + (*T1_Decoder_Callback)( T1_Decoder decoder, + FT_UInt glyph_index ); + + + typedef struct T1_Decoder_FuncsRec_ + { + FT_Error + (*init)( T1_Decoder decoder, + FT_Face face, + FT_Size size, + FT_GlyphSlot slot, + FT_Byte** glyph_names, + PS_Blend blend, + FT_Bool hinting, + FT_Render_Mode hint_mode, + T1_Decoder_Callback callback ); + + void + (*done)( T1_Decoder decoder ); + + FT_Error + (*parse_charstrings)( T1_Decoder decoder, + FT_Byte* base, + FT_UInt len ); + + } T1_Decoder_FuncsRec; + + + typedef struct T1_DecoderRec_ + { + T1_BuilderRec builder; + + FT_Long stack[T1_MAX_CHARSTRINGS_OPERANDS]; + FT_Long* top; + + T1_Decoder_ZoneRec zones[T1_MAX_SUBRS_CALLS + 1]; + T1_Decoder_Zone zone; + + FT_Service_PsCMaps psnames; /* for seac */ + FT_UInt num_glyphs; + FT_Byte** glyph_names; + + FT_Int lenIV; /* internal for sub routine calls */ + FT_UInt num_subrs; + FT_Byte** subrs; + FT_PtrDist* subrs_len; /* array of subrs length (optional) */ + + FT_Matrix font_matrix; + FT_Vector font_offset; + + FT_Int flex_state; + FT_Int num_flex_vectors; + FT_Vector flex_vectors[7]; + + PS_Blend blend; /* for multiple master support */ + + FT_Render_Mode hint_mode; + + T1_Decoder_Callback parse_callback; + T1_Decoder_FuncsRec funcs; + + FT_Int* buildchar; + FT_UInt len_buildchar; + + } T1_DecoderRec; + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** AFM PARSER *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + typedef struct AFM_ParserRec_* AFM_Parser; + + typedef struct AFM_Parser_FuncsRec_ + { + FT_Error + (*init)( AFM_Parser parser, + FT_Memory memory, + FT_Byte* base, + FT_Byte* limit ); + + void + (*done)( AFM_Parser parser ); + + FT_Error + (*parse)( AFM_Parser parser ); + + } AFM_Parser_FuncsRec; + + + typedef struct AFM_StreamRec_* AFM_Stream; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* AFM_ParserRec */ + /* */ + /* <Description> */ + /* An AFM_Parser is a parser for the AFM files. */ + /* */ + /* <Fields> */ + /* memory :: The object used for memory operations (alloc and */ + /* realloc). */ + /* */ + /* stream :: This is an opaque object. */ + /* */ + /* FontInfo :: The result will be stored here. */ + /* */ + /* get_index :: A user provided function to get a glyph index by its */ + /* name. */ + /* */ + typedef struct AFM_ParserRec_ + { + FT_Memory memory; + AFM_Stream stream; + + AFM_FontInfo FontInfo; + + FT_Int + (*get_index)( const char* name, + FT_UInt len, + void* user_data ); + + void* user_data; + + } AFM_ParserRec; + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** TYPE1 CHARMAPS *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + typedef const struct T1_CMap_ClassesRec_* T1_CMap_Classes; + + typedef struct T1_CMap_ClassesRec_ + { + FT_CMap_Class standard; + FT_CMap_Class expert; + FT_CMap_Class custom; + FT_CMap_Class unicode; + + } T1_CMap_ClassesRec; + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** PSAux Module Interface *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + typedef struct PSAux_ServiceRec_ + { + /* don't use `PS_Table_Funcs' and friends to avoid compiler warnings */ + const PS_Table_FuncsRec* ps_table_funcs; + const PS_Parser_FuncsRec* ps_parser_funcs; + const T1_Builder_FuncsRec* t1_builder_funcs; + const T1_Decoder_FuncsRec* t1_decoder_funcs; + + void + (*t1_decrypt)( FT_Byte* buffer, + FT_Offset length, + FT_UShort seed ); + + T1_CMap_Classes t1_cmap_classes; + + /* fields after this comment line were added after version 2.1.10 */ + const AFM_Parser_FuncsRec* afm_parser_funcs; + + } PSAux_ServiceRec, *PSAux_Service; + + /* backwards-compatible type definition */ + typedef PSAux_ServiceRec PSAux_Interface; + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** Some convenience functions *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + +#define IS_PS_NEWLINE( ch ) \ + ( (ch) == '\r' || \ + (ch) == '\n' ) + +#define IS_PS_SPACE( ch ) \ + ( (ch) == ' ' || \ + IS_PS_NEWLINE( ch ) || \ + (ch) == '\t' || \ + (ch) == '\f' || \ + (ch) == '\0' ) + +#define IS_PS_SPECIAL( ch ) \ + ( (ch) == '/' || \ + (ch) == '(' || (ch) == ')' || \ + (ch) == '<' || (ch) == '>' || \ + (ch) == '[' || (ch) == ']' || \ + (ch) == '{' || (ch) == '}' || \ + (ch) == '%' ) + +#define IS_PS_DELIM( ch ) \ + ( IS_PS_SPACE( ch ) || \ + IS_PS_SPECIAL( ch ) ) + +#define IS_PS_DIGIT( ch ) \ + ( (ch) >= '0' && (ch) <= '9' ) + +#define IS_PS_XDIGIT( ch ) \ + ( IS_PS_DIGIT( ch ) || \ + ( (ch) >= 'A' && (ch) <= 'F' ) || \ + ( (ch) >= 'a' && (ch) <= 'f' ) ) + +#define IS_PS_BASE85( ch ) \ + ( (ch) >= '!' && (ch) <= 'u' ) + +#define IS_PS_TOKEN( cur, limit, token ) \ + ( (char)(cur)[0] == (token)[0] && \ + ( (cur) + sizeof ( (token) ) == (limit) || \ + ( (cur) + sizeof( (token) ) < (limit) && \ + IS_PS_DELIM( (cur)[sizeof ( (token) ) - 1] ) ) ) && \ + ft_strncmp( (char*)(cur), (token), sizeof ( (token) ) - 1 ) == 0 ) + + +FT_END_HEADER + +#endif /* __PSAUX_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/pshints.h b/portlibs/include/freetype/internal/pshints.h new file mode 100644 index 00000000..48452c0c --- /dev/null +++ b/portlibs/include/freetype/internal/pshints.h @@ -0,0 +1,687 @@ +/***************************************************************************/ +/* */ +/* pshints.h */ +/* */ +/* Interface to Postscript-specific (Type 1 and Type 2) hints */ +/* recorders (specification only). These are used to support native */ +/* T1/T2 hints in the `type1', `cid', and `cff' font drivers. */ +/* */ +/* Copyright 2001, 2002, 2003, 2005, 2006, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __PSHINTS_H__ +#define __PSHINTS_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H +#include FT_TYPE1_TABLES_H + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** INTERNAL REPRESENTATION OF GLOBALS *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + typedef struct PSH_GlobalsRec_* PSH_Globals; + + typedef FT_Error + (*PSH_Globals_NewFunc)( FT_Memory memory, + T1_Private* private_dict, + PSH_Globals* aglobals ); + + typedef FT_Error + (*PSH_Globals_SetScaleFunc)( PSH_Globals globals, + FT_Fixed x_scale, + FT_Fixed y_scale, + FT_Fixed x_delta, + FT_Fixed y_delta ); + + typedef void + (*PSH_Globals_DestroyFunc)( PSH_Globals globals ); + + + typedef struct PSH_Globals_FuncsRec_ + { + PSH_Globals_NewFunc create; + PSH_Globals_SetScaleFunc set_scale; + PSH_Globals_DestroyFunc destroy; + + } PSH_Globals_FuncsRec, *PSH_Globals_Funcs; + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** PUBLIC TYPE 1 HINTS RECORDER *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + /************************************************************************* + * + * @type: + * T1_Hints + * + * @description: + * This is a handle to an opaque structure used to record glyph hints + * from a Type 1 character glyph character string. + * + * The methods used to operate on this object are defined by the + * @T1_Hints_FuncsRec structure. Recording glyph hints is normally + * achieved through the following scheme: + * + * - Open a new hint recording session by calling the `open' method. + * This rewinds the recorder and prepare it for new input. + * + * - For each hint found in the glyph charstring, call the corresponding + * method (`stem', `stem3', or `reset'). Note that these functions do + * not return an error code. + * + * - Close the recording session by calling the `close' method. It + * returns an error code if the hints were invalid or something + * strange happened (e.g., memory shortage). + * + * The hints accumulated in the object can later be used by the + * PostScript hinter. + * + */ + typedef struct T1_HintsRec_* T1_Hints; + + + /************************************************************************* + * + * @type: + * T1_Hints_Funcs + * + * @description: + * A pointer to the @T1_Hints_FuncsRec structure that defines the API of + * a given @T1_Hints object. + * + */ + typedef const struct T1_Hints_FuncsRec_* T1_Hints_Funcs; + + + /************************************************************************* + * + * @functype: + * T1_Hints_OpenFunc + * + * @description: + * A method of the @T1_Hints class used to prepare it for a new Type 1 + * hints recording session. + * + * @input: + * hints :: + * A handle to the Type 1 hints recorder. + * + * @note: + * You should always call the @T1_Hints_CloseFunc method in order to + * close an opened recording session. + * + */ + typedef void + (*T1_Hints_OpenFunc)( T1_Hints hints ); + + + /************************************************************************* + * + * @functype: + * T1_Hints_SetStemFunc + * + * @description: + * A method of the @T1_Hints class used to record a new horizontal or + * vertical stem. This corresponds to the Type 1 `hstem' and `vstem' + * operators. + * + * @input: + * hints :: + * A handle to the Type 1 hints recorder. + * + * dimension :: + * 0 for horizontal stems (hstem), 1 for vertical ones (vstem). + * + * coords :: + * Array of 2 integers, used as (position,length) stem descriptor. + * + * @note: + * Use vertical coordinates (y) for horizontal stems (dim=0). Use + * horizontal coordinates (x) for vertical stems (dim=1). + * + * `coords[0]' is the absolute stem position (lowest coordinate); + * `coords[1]' is the length. + * + * The length can be negative, in which case it must be either -20 or + * -21. It is interpreted as a `ghost' stem, according to the Type 1 + * specification. + * + * If the length is -21 (corresponding to a bottom ghost stem), then + * the real stem position is `coords[0]+coords[1]'. + * + */ + typedef void + (*T1_Hints_SetStemFunc)( T1_Hints hints, + FT_UInt dimension, + FT_Long* coords ); + + + /************************************************************************* + * + * @functype: + * T1_Hints_SetStem3Func + * + * @description: + * A method of the @T1_Hints class used to record three + * counter-controlled horizontal or vertical stems at once. + * + * @input: + * hints :: + * A handle to the Type 1 hints recorder. + * + * dimension :: + * 0 for horizontal stems, 1 for vertical ones. + * + * coords :: + * An array of 6 integers, holding 3 (position,length) pairs for the + * counter-controlled stems. + * + * @note: + * Use vertical coordinates (y) for horizontal stems (dim=0). Use + * horizontal coordinates (x) for vertical stems (dim=1). + * + * The lengths cannot be negative (ghost stems are never + * counter-controlled). + * + */ + typedef void + (*T1_Hints_SetStem3Func)( T1_Hints hints, + FT_UInt dimension, + FT_Long* coords ); + + + /************************************************************************* + * + * @functype: + * T1_Hints_ResetFunc + * + * @description: + * A method of the @T1_Hints class used to reset the stems hints in a + * recording session. + * + * @input: + * hints :: + * A handle to the Type 1 hints recorder. + * + * end_point :: + * The index of the last point in the input glyph in which the + * previously defined hints apply. + * + */ + typedef void + (*T1_Hints_ResetFunc)( T1_Hints hints, + FT_UInt end_point ); + + + /************************************************************************* + * + * @functype: + * T1_Hints_CloseFunc + * + * @description: + * A method of the @T1_Hints class used to close a hint recording + * session. + * + * @input: + * hints :: + * A handle to the Type 1 hints recorder. + * + * end_point :: + * The index of the last point in the input glyph. + * + * @return: + * FreeType error code. 0 means success. + * + * @note: + * The error code is set to indicate that an error occurred during the + * recording session. + * + */ + typedef FT_Error + (*T1_Hints_CloseFunc)( T1_Hints hints, + FT_UInt end_point ); + + + /************************************************************************* + * + * @functype: + * T1_Hints_ApplyFunc + * + * @description: + * A method of the @T1_Hints class used to apply hints to the + * corresponding glyph outline. Must be called once all hints have been + * recorded. + * + * @input: + * hints :: + * A handle to the Type 1 hints recorder. + * + * outline :: + * A pointer to the target outline descriptor. + * + * globals :: + * The hinter globals for this font. + * + * hint_mode :: + * Hinting information. + * + * @return: + * FreeType error code. 0 means success. + * + * @note: + * On input, all points within the outline are in font coordinates. On + * output, they are in 1/64th of pixels. + * + * The scaling transformation is taken from the `globals' object which + * must correspond to the same font as the glyph. + * + */ + typedef FT_Error + (*T1_Hints_ApplyFunc)( T1_Hints hints, + FT_Outline* outline, + PSH_Globals globals, + FT_Render_Mode hint_mode ); + + + /************************************************************************* + * + * @struct: + * T1_Hints_FuncsRec + * + * @description: + * The structure used to provide the API to @T1_Hints objects. + * + * @fields: + * hints :: + * A handle to the T1 Hints recorder. + * + * open :: + * The function to open a recording session. + * + * close :: + * The function to close a recording session. + * + * stem :: + * The function to set a simple stem. + * + * stem3 :: + * The function to set counter-controlled stems. + * + * reset :: + * The function to reset stem hints. + * + * apply :: + * The function to apply the hints to the corresponding glyph outline. + * + */ + typedef struct T1_Hints_FuncsRec_ + { + T1_Hints hints; + T1_Hints_OpenFunc open; + T1_Hints_CloseFunc close; + T1_Hints_SetStemFunc stem; + T1_Hints_SetStem3Func stem3; + T1_Hints_ResetFunc reset; + T1_Hints_ApplyFunc apply; + + } T1_Hints_FuncsRec; + + + /*************************************************************************/ + /*************************************************************************/ + /***** *****/ + /***** PUBLIC TYPE 2 HINTS RECORDER *****/ + /***** *****/ + /*************************************************************************/ + /*************************************************************************/ + + /************************************************************************* + * + * @type: + * T2_Hints + * + * @description: + * This is a handle to an opaque structure used to record glyph hints + * from a Type 2 character glyph character string. + * + * The methods used to operate on this object are defined by the + * @T2_Hints_FuncsRec structure. Recording glyph hints is normally + * achieved through the following scheme: + * + * - Open a new hint recording session by calling the `open' method. + * This rewinds the recorder and prepare it for new input. + * + * - For each hint found in the glyph charstring, call the corresponding + * method (`stems', `hintmask', `counters'). Note that these + * functions do not return an error code. + * + * - Close the recording session by calling the `close' method. It + * returns an error code if the hints were invalid or something + * strange happened (e.g., memory shortage). + * + * The hints accumulated in the object can later be used by the + * Postscript hinter. + * + */ + typedef struct T2_HintsRec_* T2_Hints; + + + /************************************************************************* + * + * @type: + * T2_Hints_Funcs + * + * @description: + * A pointer to the @T2_Hints_FuncsRec structure that defines the API of + * a given @T2_Hints object. + * + */ + typedef const struct T2_Hints_FuncsRec_* T2_Hints_Funcs; + + + /************************************************************************* + * + * @functype: + * T2_Hints_OpenFunc + * + * @description: + * A method of the @T2_Hints class used to prepare it for a new Type 2 + * hints recording session. + * + * @input: + * hints :: + * A handle to the Type 2 hints recorder. + * + * @note: + * You should always call the @T2_Hints_CloseFunc method in order to + * close an opened recording session. + * + */ + typedef void + (*T2_Hints_OpenFunc)( T2_Hints hints ); + + + /************************************************************************* + * + * @functype: + * T2_Hints_StemsFunc + * + * @description: + * A method of the @T2_Hints class used to set the table of stems in + * either the vertical or horizontal dimension. Equivalent to the + * `hstem', `vstem', `hstemhm', and `vstemhm' Type 2 operators. + * + * @input: + * hints :: + * A handle to the Type 2 hints recorder. + * + * dimension :: + * 0 for horizontal stems (hstem), 1 for vertical ones (vstem). + * + * count :: + * The number of stems. + * + * coords :: + * An array of `count' (position,length) pairs. + * + * @note: + * Use vertical coordinates (y) for horizontal stems (dim=0). Use + * horizontal coordinates (x) for vertical stems (dim=1). + * + * There are `2*count' elements in the `coords' array. Each even + * element is an absolute position in font units, each odd element is a + * length in font units. + * + * A length can be negative, in which case it must be either -20 or + * -21. It is interpreted as a `ghost' stem, according to the Type 1 + * specification. + * + */ + typedef void + (*T2_Hints_StemsFunc)( T2_Hints hints, + FT_UInt dimension, + FT_UInt count, + FT_Fixed* coordinates ); + + + /************************************************************************* + * + * @functype: + * T2_Hints_MaskFunc + * + * @description: + * A method of the @T2_Hints class used to set a given hintmask (this + * corresponds to the `hintmask' Type 2 operator). + * + * @input: + * hints :: + * A handle to the Type 2 hints recorder. + * + * end_point :: + * The glyph index of the last point to which the previously defined + * or activated hints apply. + * + * bit_count :: + * The number of bits in the hint mask. + * + * bytes :: + * An array of bytes modelling the hint mask. + * + * @note: + * If the hintmask starts the charstring (before any glyph point + * definition), the value of `end_point' should be 0. + * + * `bit_count' is the number of meaningful bits in the `bytes' array; it + * must be equal to the total number of hints defined so far (i.e., + * horizontal+verticals). + * + * The `bytes' array can come directly from the Type 2 charstring and + * respects the same format. + * + */ + typedef void + (*T2_Hints_MaskFunc)( T2_Hints hints, + FT_UInt end_point, + FT_UInt bit_count, + const FT_Byte* bytes ); + + + /************************************************************************* + * + * @functype: + * T2_Hints_CounterFunc + * + * @description: + * A method of the @T2_Hints class used to set a given counter mask + * (this corresponds to the `hintmask' Type 2 operator). + * + * @input: + * hints :: + * A handle to the Type 2 hints recorder. + * + * end_point :: + * A glyph index of the last point to which the previously defined or + * active hints apply. + * + * bit_count :: + * The number of bits in the hint mask. + * + * bytes :: + * An array of bytes modelling the hint mask. + * + * @note: + * If the hintmask starts the charstring (before any glyph point + * definition), the value of `end_point' should be 0. + * + * `bit_count' is the number of meaningful bits in the `bytes' array; it + * must be equal to the total number of hints defined so far (i.e., + * horizontal+verticals). + * + * The `bytes' array can come directly from the Type 2 charstring and + * respects the same format. + * + */ + typedef void + (*T2_Hints_CounterFunc)( T2_Hints hints, + FT_UInt bit_count, + const FT_Byte* bytes ); + + + /************************************************************************* + * + * @functype: + * T2_Hints_CloseFunc + * + * @description: + * A method of the @T2_Hints class used to close a hint recording + * session. + * + * @input: + * hints :: + * A handle to the Type 2 hints recorder. + * + * end_point :: + * The index of the last point in the input glyph. + * + * @return: + * FreeType error code. 0 means success. + * + * @note: + * The error code is set to indicate that an error occurred during the + * recording session. + * + */ + typedef FT_Error + (*T2_Hints_CloseFunc)( T2_Hints hints, + FT_UInt end_point ); + + + /************************************************************************* + * + * @functype: + * T2_Hints_ApplyFunc + * + * @description: + * A method of the @T2_Hints class used to apply hints to the + * corresponding glyph outline. Must be called after the `close' + * method. + * + * @input: + * hints :: + * A handle to the Type 2 hints recorder. + * + * outline :: + * A pointer to the target outline descriptor. + * + * globals :: + * The hinter globals for this font. + * + * hint_mode :: + * Hinting information. + * + * @return: + * FreeType error code. 0 means success. + * + * @note: + * On input, all points within the outline are in font coordinates. On + * output, they are in 1/64th of pixels. + * + * The scaling transformation is taken from the `globals' object which + * must correspond to the same font than the glyph. + * + */ + typedef FT_Error + (*T2_Hints_ApplyFunc)( T2_Hints hints, + FT_Outline* outline, + PSH_Globals globals, + FT_Render_Mode hint_mode ); + + + /************************************************************************* + * + * @struct: + * T2_Hints_FuncsRec + * + * @description: + * The structure used to provide the API to @T2_Hints objects. + * + * @fields: + * hints :: + * A handle to the T2 hints recorder object. + * + * open :: + * The function to open a recording session. + * + * close :: + * The function to close a recording session. + * + * stems :: + * The function to set the dimension's stems table. + * + * hintmask :: + * The function to set hint masks. + * + * counter :: + * The function to set counter masks. + * + * apply :: + * The function to apply the hints on the corresponding glyph outline. + * + */ + typedef struct T2_Hints_FuncsRec_ + { + T2_Hints hints; + T2_Hints_OpenFunc open; + T2_Hints_CloseFunc close; + T2_Hints_StemsFunc stems; + T2_Hints_MaskFunc hintmask; + T2_Hints_CounterFunc counter; + T2_Hints_ApplyFunc apply; + + } T2_Hints_FuncsRec; + + + /* */ + + + typedef struct PSHinter_Interface_ + { + PSH_Globals_Funcs (*get_globals_funcs)( FT_Module module ); + T1_Hints_Funcs (*get_t1_funcs) ( FT_Module module ); + T2_Hints_Funcs (*get_t2_funcs) ( FT_Module module ); + + } PSHinter_Interface; + + typedef PSHinter_Interface* PSHinter_Service; + + +FT_END_HEADER + +#endif /* __PSHINTS_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svbdf.h b/portlibs/include/freetype/internal/services/svbdf.h new file mode 100644 index 00000000..0f7fc611 --- /dev/null +++ b/portlibs/include/freetype/internal/services/svbdf.h @@ -0,0 +1,57 @@ +/***************************************************************************/ +/* */ +/* svbdf.h */ +/* */ +/* The FreeType BDF services (specification). */ +/* */ +/* Copyright 2003 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVBDF_H__ +#define __SVBDF_H__ + +#include FT_BDF_H +#include FT_INTERNAL_SERVICE_H + + +FT_BEGIN_HEADER + + +#define FT_SERVICE_ID_BDF "bdf" + + typedef FT_Error + (*FT_BDF_GetCharsetIdFunc)( FT_Face face, + const char* *acharset_encoding, + const char* *acharset_registry ); + + typedef FT_Error + (*FT_BDF_GetPropertyFunc)( FT_Face face, + const char* prop_name, + BDF_PropertyRec *aproperty ); + + + FT_DEFINE_SERVICE( BDF ) + { + FT_BDF_GetCharsetIdFunc get_charset_id; + FT_BDF_GetPropertyFunc get_property; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVBDF_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svcid.h b/portlibs/include/freetype/internal/services/svcid.h new file mode 100644 index 00000000..47fef62e --- /dev/null +++ b/portlibs/include/freetype/internal/services/svcid.h @@ -0,0 +1,49 @@ +/***************************************************************************/ +/* */ +/* svcid.h */ +/* */ +/* The FreeType CID font services (specification). */ +/* */ +/* Copyright 2007 by Derek Clegg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVCID_H__ +#define __SVCID_H__ + +#include FT_INTERNAL_SERVICE_H + + +FT_BEGIN_HEADER + + +#define FT_SERVICE_ID_CID "CID" + + typedef FT_Error + (*FT_CID_GetRegistryOrderingSupplementFunc)( FT_Face face, + const char* *registry, + const char* *ordering, + FT_Int *supplement ); + + FT_DEFINE_SERVICE( CID ) + { + FT_CID_GetRegistryOrderingSupplementFunc get_ros; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVCID_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svgldict.h b/portlibs/include/freetype/internal/services/svgldict.h new file mode 100644 index 00000000..e5e56b25 --- /dev/null +++ b/portlibs/include/freetype/internal/services/svgldict.h @@ -0,0 +1,60 @@ +/***************************************************************************/ +/* */ +/* svgldict.h */ +/* */ +/* The FreeType glyph dictionary services (specification). */ +/* */ +/* Copyright 2003 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVGLDICT_H__ +#define __SVGLDICT_H__ + +#include FT_INTERNAL_SERVICE_H + + +FT_BEGIN_HEADER + + + /* + * A service used to retrieve glyph names, as well as to find the + * index of a given glyph name in a font. + * + */ + +#define FT_SERVICE_ID_GLYPH_DICT "glyph-dict" + + + typedef FT_Error + (*FT_GlyphDict_GetNameFunc)( FT_Face face, + FT_UInt glyph_index, + FT_Pointer buffer, + FT_UInt buffer_max ); + + typedef FT_UInt + (*FT_GlyphDict_NameIndexFunc)( FT_Face face, + FT_String* glyph_name ); + + + FT_DEFINE_SERVICE( GlyphDict ) + { + FT_GlyphDict_GetNameFunc get_name; + FT_GlyphDict_NameIndexFunc name_index; /* optional */ + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVGLDICT_H__ */ diff --git a/portlibs/include/freetype/internal/services/svgxval.h b/portlibs/include/freetype/internal/services/svgxval.h new file mode 100644 index 00000000..2cdab506 --- /dev/null +++ b/portlibs/include/freetype/internal/services/svgxval.h @@ -0,0 +1,72 @@ +/***************************************************************************/ +/* */ +/* svgxval.h */ +/* */ +/* FreeType API for validating TrueTypeGX/AAT tables (specification). */ +/* */ +/* Copyright 2004, 2005 by */ +/* Masatake YAMATO, Red Hat K.K., */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + +/***************************************************************************/ +/* */ +/* gxvalid is derived from both gxlayout module and otvalid module. */ +/* Development of gxlayout is supported by the Information-technology */ +/* Promotion Agency(IPA), Japan. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVGXVAL_H__ +#define __SVGXVAL_H__ + +#include FT_GX_VALIDATE_H +#include FT_INTERNAL_VALIDATE_H + +FT_BEGIN_HEADER + + +#define FT_SERVICE_ID_GX_VALIDATE "truetypegx-validate" +#define FT_SERVICE_ID_CLASSICKERN_VALIDATE "classickern-validate" + + typedef FT_Error + (*gxv_validate_func)( FT_Face face, + FT_UInt gx_flags, + FT_Bytes tables[FT_VALIDATE_GX_LENGTH], + FT_UInt table_length ); + + + typedef FT_Error + (*ckern_validate_func)( FT_Face face, + FT_UInt ckern_flags, + FT_Bytes *ckern_table ); + + + FT_DEFINE_SERVICE( GXvalidate ) + { + gxv_validate_func validate; + }; + + FT_DEFINE_SERVICE( CKERNvalidate ) + { + ckern_validate_func validate; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVGXVAL_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svkern.h b/portlibs/include/freetype/internal/services/svkern.h new file mode 100644 index 00000000..1488adf4 --- /dev/null +++ b/portlibs/include/freetype/internal/services/svkern.h @@ -0,0 +1,51 @@ +/***************************************************************************/ +/* */ +/* svkern.h */ +/* */ +/* The FreeType Kerning service (specification). */ +/* */ +/* Copyright 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVKERN_H__ +#define __SVKERN_H__ + +#include FT_INTERNAL_SERVICE_H +#include FT_TRUETYPE_TABLES_H + + +FT_BEGIN_HEADER + +#define FT_SERVICE_ID_KERNING "kerning" + + + typedef FT_Error + (*FT_Kerning_TrackGetFunc)( FT_Face face, + FT_Fixed point_size, + FT_Int degree, + FT_Fixed* akerning ); + + FT_DEFINE_SERVICE( Kerning ) + { + FT_Kerning_TrackGetFunc get_track; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVKERN_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svmm.h b/portlibs/include/freetype/internal/services/svmm.h new file mode 100644 index 00000000..8a99ec4b --- /dev/null +++ b/portlibs/include/freetype/internal/services/svmm.h @@ -0,0 +1,79 @@ +/***************************************************************************/ +/* */ +/* svmm.h */ +/* */ +/* The FreeType Multiple Masters and GX var services (specification). */ +/* */ +/* Copyright 2003, 2004 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVMM_H__ +#define __SVMM_H__ + +#include FT_INTERNAL_SERVICE_H + + +FT_BEGIN_HEADER + + + /* + * A service used to manage multiple-masters data in a given face. + * + * See the related APIs in `ftmm.h' (FT_MULTIPLE_MASTERS_H). + * + */ + +#define FT_SERVICE_ID_MULTI_MASTERS "multi-masters" + + + typedef FT_Error + (*FT_Get_MM_Func)( FT_Face face, + FT_Multi_Master* master ); + + typedef FT_Error + (*FT_Get_MM_Var_Func)( FT_Face face, + FT_MM_Var* *master ); + + typedef FT_Error + (*FT_Set_MM_Design_Func)( FT_Face face, + FT_UInt num_coords, + FT_Long* coords ); + + typedef FT_Error + (*FT_Set_Var_Design_Func)( FT_Face face, + FT_UInt num_coords, + FT_Fixed* coords ); + + typedef FT_Error + (*FT_Set_MM_Blend_Func)( FT_Face face, + FT_UInt num_coords, + FT_Long* coords ); + + + FT_DEFINE_SERVICE( MultiMasters ) + { + FT_Get_MM_Func get_mm; + FT_Set_MM_Design_Func set_mm_design; + FT_Set_MM_Blend_Func set_mm_blend; + FT_Get_MM_Var_Func get_mm_var; + FT_Set_Var_Design_Func set_var_design; + }; + + /* */ + + +FT_END_HEADER + +#endif /* __SVMM_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svotval.h b/portlibs/include/freetype/internal/services/svotval.h new file mode 100644 index 00000000..970bbd57 --- /dev/null +++ b/portlibs/include/freetype/internal/services/svotval.h @@ -0,0 +1,55 @@ +/***************************************************************************/ +/* */ +/* svotval.h */ +/* */ +/* The FreeType OpenType validation service (specification). */ +/* */ +/* Copyright 2004, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVOTVAL_H__ +#define __SVOTVAL_H__ + +#include FT_OPENTYPE_VALIDATE_H +#include FT_INTERNAL_VALIDATE_H + +FT_BEGIN_HEADER + + +#define FT_SERVICE_ID_OPENTYPE_VALIDATE "opentype-validate" + + + typedef FT_Error + (*otv_validate_func)( FT_Face volatile face, + FT_UInt ot_flags, + FT_Bytes *base, + FT_Bytes *gdef, + FT_Bytes *gpos, + FT_Bytes *gsub, + FT_Bytes *jstf ); + + + FT_DEFINE_SERVICE( OTvalidate ) + { + otv_validate_func validate; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVOTVAL_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svpfr.h b/portlibs/include/freetype/internal/services/svpfr.h new file mode 100644 index 00000000..462786f9 --- /dev/null +++ b/portlibs/include/freetype/internal/services/svpfr.h @@ -0,0 +1,66 @@ +/***************************************************************************/ +/* */ +/* svpfr.h */ +/* */ +/* Internal PFR service functions (specification). */ +/* */ +/* Copyright 2003, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVPFR_H__ +#define __SVPFR_H__ + +#include FT_PFR_H +#include FT_INTERNAL_SERVICE_H + + +FT_BEGIN_HEADER + + +#define FT_SERVICE_ID_PFR_METRICS "pfr-metrics" + + + typedef FT_Error + (*FT_PFR_GetMetricsFunc)( FT_Face face, + FT_UInt *aoutline, + FT_UInt *ametrics, + FT_Fixed *ax_scale, + FT_Fixed *ay_scale ); + + typedef FT_Error + (*FT_PFR_GetKerningFunc)( FT_Face face, + FT_UInt left, + FT_UInt right, + FT_Vector *avector ); + + typedef FT_Error + (*FT_PFR_GetAdvanceFunc)( FT_Face face, + FT_UInt gindex, + FT_Pos *aadvance ); + + + FT_DEFINE_SERVICE( PfrMetrics ) + { + FT_PFR_GetMetricsFunc get_metrics; + FT_PFR_GetKerningFunc get_kerning; + FT_PFR_GetAdvanceFunc get_advance; + + }; + + /* */ + +FT_END_HEADER + +#endif /* __SVPFR_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svpostnm.h b/portlibs/include/freetype/internal/services/svpostnm.h new file mode 100644 index 00000000..282da68d --- /dev/null +++ b/portlibs/include/freetype/internal/services/svpostnm.h @@ -0,0 +1,58 @@ +/***************************************************************************/ +/* */ +/* svpostnm.h */ +/* */ +/* The FreeType PostScript name services (specification). */ +/* */ +/* Copyright 2003, 2007 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVPOSTNM_H__ +#define __SVPOSTNM_H__ + +#include FT_INTERNAL_SERVICE_H + + +FT_BEGIN_HEADER + + /* + * A trivial service used to retrieve the PostScript name of a given + * font when available. The `get_name' field should never be NULL. + * + * The corresponding function can return NULL to indicate that the + * PostScript name is not available. + * + * The name is owned by the face and will be destroyed with it. + */ + +#define FT_SERVICE_ID_POSTSCRIPT_FONT_NAME "postscript-font-name" + + + typedef const char* + (*FT_PsName_GetFunc)( FT_Face face ); + + + FT_DEFINE_SERVICE( PsFontName ) + { + FT_PsName_GetFunc get_ps_font_name; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVPOSTNM_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svpscmap.h b/portlibs/include/freetype/internal/services/svpscmap.h new file mode 100644 index 00000000..c4e25ed6 --- /dev/null +++ b/portlibs/include/freetype/internal/services/svpscmap.h @@ -0,0 +1,129 @@ +/***************************************************************************/ +/* */ +/* svpscmap.h */ +/* */ +/* The FreeType PostScript charmap service (specification). */ +/* */ +/* Copyright 2003, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVPSCMAP_H__ +#define __SVPSCMAP_H__ + +#include FT_INTERNAL_OBJECTS_H + + +FT_BEGIN_HEADER + + +#define FT_SERVICE_ID_POSTSCRIPT_CMAPS "postscript-cmaps" + + + /* + * Adobe glyph name to unicode value. + */ + typedef FT_UInt32 + (*PS_Unicode_ValueFunc)( const char* glyph_name ); + + /* + * Macintosh name id to glyph name. NULL if invalid index. + */ + typedef const char* + (*PS_Macintosh_NameFunc)( FT_UInt name_index ); + + /* + * Adobe standard string ID to glyph name. NULL if invalid index. + */ + typedef const char* + (*PS_Adobe_Std_StringsFunc)( FT_UInt string_index ); + + + /* + * Simple unicode -> glyph index charmap built from font glyph names + * table. + */ + typedef struct PS_UniMap_ + { + FT_UInt32 unicode; /* bit 31 set: is glyph variant */ + FT_UInt glyph_index; + + } PS_UniMap; + + + typedef struct PS_UnicodesRec_* PS_Unicodes; + + typedef struct PS_UnicodesRec_ + { + FT_CMapRec cmap; + FT_UInt num_maps; + PS_UniMap* maps; + + } PS_UnicodesRec; + + + /* + * A function which returns a glyph name for a given index. Returns + * NULL if invalid index. + */ + typedef const char* + (*PS_GetGlyphNameFunc)( FT_Pointer data, + FT_UInt string_index ); + + /* + * A function used to release the glyph name returned by + * PS_GetGlyphNameFunc, when needed + */ + typedef void + (*PS_FreeGlyphNameFunc)( FT_Pointer data, + const char* name ); + + typedef FT_Error + (*PS_Unicodes_InitFunc)( FT_Memory memory, + PS_Unicodes unicodes, + FT_UInt num_glyphs, + PS_GetGlyphNameFunc get_glyph_name, + PS_FreeGlyphNameFunc free_glyph_name, + FT_Pointer glyph_data ); + + typedef FT_UInt + (*PS_Unicodes_CharIndexFunc)( PS_Unicodes unicodes, + FT_UInt32 unicode ); + + typedef FT_ULong + (*PS_Unicodes_CharNextFunc)( PS_Unicodes unicodes, + FT_UInt32 *unicode ); + + + FT_DEFINE_SERVICE( PsCMaps ) + { + PS_Unicode_ValueFunc unicode_value; + + PS_Unicodes_InitFunc unicodes_init; + PS_Unicodes_CharIndexFunc unicodes_char_index; + PS_Unicodes_CharNextFunc unicodes_char_next; + + PS_Macintosh_NameFunc macintosh_name; + PS_Adobe_Std_StringsFunc adobe_std_strings; + const unsigned short* adobe_std_encoding; + const unsigned short* adobe_expert_encoding; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVPSCMAP_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svpsinfo.h b/portlibs/include/freetype/internal/services/svpsinfo.h new file mode 100644 index 00000000..63f5db9c --- /dev/null +++ b/portlibs/include/freetype/internal/services/svpsinfo.h @@ -0,0 +1,60 @@ +/***************************************************************************/ +/* */ +/* svpsinfo.h */ +/* */ +/* The FreeType PostScript info service (specification). */ +/* */ +/* Copyright 2003, 2004 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVPSINFO_H__ +#define __SVPSINFO_H__ + +#include FT_INTERNAL_SERVICE_H +#include FT_INTERNAL_TYPE1_TYPES_H + + +FT_BEGIN_HEADER + + +#define FT_SERVICE_ID_POSTSCRIPT_INFO "postscript-info" + + + typedef FT_Error + (*PS_GetFontInfoFunc)( FT_Face face, + PS_FontInfoRec* afont_info ); + + typedef FT_Int + (*PS_HasGlyphNamesFunc)( FT_Face face ); + + typedef FT_Error + (*PS_GetFontPrivateFunc)( FT_Face face, + PS_PrivateRec* afont_private ); + + + FT_DEFINE_SERVICE( PsInfo ) + { + PS_GetFontInfoFunc ps_get_font_info; + PS_HasGlyphNamesFunc ps_has_glyph_names; + PS_GetFontPrivateFunc ps_get_font_private; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVPSINFO_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svsfnt.h b/portlibs/include/freetype/internal/services/svsfnt.h new file mode 100644 index 00000000..b4a85d97 --- /dev/null +++ b/portlibs/include/freetype/internal/services/svsfnt.h @@ -0,0 +1,80 @@ +/***************************************************************************/ +/* */ +/* svsfnt.h */ +/* */ +/* The FreeType SFNT table loading service (specification). */ +/* */ +/* Copyright 2003, 2004 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVSFNT_H__ +#define __SVSFNT_H__ + +#include FT_INTERNAL_SERVICE_H +#include FT_TRUETYPE_TABLES_H + + +FT_BEGIN_HEADER + + + /* + * SFNT table loading service. + */ + +#define FT_SERVICE_ID_SFNT_TABLE "sfnt-table" + + + /* + * Used to implement FT_Load_Sfnt_Table(). + */ + typedef FT_Error + (*FT_SFNT_TableLoadFunc)( FT_Face face, + FT_ULong tag, + FT_Long offset, + FT_Byte* buffer, + FT_ULong* length ); + + /* + * Used to implement FT_Get_Sfnt_Table(). + */ + typedef void* + (*FT_SFNT_TableGetFunc)( FT_Face face, + FT_Sfnt_Tag tag ); + + + /* + * Used to implement FT_Sfnt_Table_Info(). + */ + typedef FT_Error + (*FT_SFNT_TableInfoFunc)( FT_Face face, + FT_UInt idx, + FT_ULong *tag, + FT_ULong *length ); + + + FT_DEFINE_SERVICE( SFNT_Table ) + { + FT_SFNT_TableLoadFunc load_table; + FT_SFNT_TableGetFunc get_table; + FT_SFNT_TableInfoFunc table_info; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVSFNT_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svttcmap.h b/portlibs/include/freetype/internal/services/svttcmap.h new file mode 100644 index 00000000..553ecb07 --- /dev/null +++ b/portlibs/include/freetype/internal/services/svttcmap.h @@ -0,0 +1,85 @@ +/***************************************************************************/ +/* */ +/* svsttcmap.h */ +/* */ +/* The FreeType TrueType/sfnt cmap extra information service. */ +/* */ +/* Copyright 2003 by */ +/* Masatake YAMATO, Redhat K.K. */ +/* */ +/* Copyright 2003, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + +/* Development of this service is support of + Information-technology Promotion Agency, Japan. */ + +#ifndef __SVTTCMAP_H__ +#define __SVTTCMAP_H__ + +#include FT_INTERNAL_SERVICE_H +#include FT_TRUETYPE_TABLES_H + + +FT_BEGIN_HEADER + + +#define FT_SERVICE_ID_TT_CMAP "tt-cmaps" + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_CMapInfo */ + /* */ + /* <Description> */ + /* A structure used to store TrueType/sfnt specific cmap information */ + /* which is not covered by the generic @FT_CharMap structure. This */ + /* structure can be accessed with the @FT_Get_TT_CMap_Info function. */ + /* */ + /* <Fields> */ + /* language :: */ + /* The language ID used in Mac fonts. Definitions of values are in */ + /* freetype/ttnameid.h. */ + /* */ + /* format :: */ + /* The cmap format. OpenType 1.5 defines the formats 0 (byte */ + /* encoding table), 2~(high-byte mapping through table), 4~(segment */ + /* mapping to delta values), 6~(trimmed table mapping), 8~(mixed */ + /* 16-bit and 32-bit coverage), 10~(trimmed array), 12~(segmented */ + /* coverage), and 14 (Unicode Variation Sequences). */ + /* */ + typedef struct TT_CMapInfo_ + { + FT_ULong language; + FT_Long format; + + } TT_CMapInfo; + + + typedef FT_Error + (*TT_CMap_Info_GetFunc)( FT_CharMap charmap, + TT_CMapInfo *cmap_info ); + + + FT_DEFINE_SERVICE( TTCMaps ) + { + TT_CMap_Info_GetFunc get_cmap_info; + }; + + /* */ + + +FT_END_HEADER + +#endif /* __SVTTCMAP_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svtteng.h b/portlibs/include/freetype/internal/services/svtteng.h new file mode 100644 index 00000000..58e02a6f --- /dev/null +++ b/portlibs/include/freetype/internal/services/svtteng.h @@ -0,0 +1,53 @@ +/***************************************************************************/ +/* */ +/* svtteng.h */ +/* */ +/* The FreeType TrueType engine query service (specification). */ +/* */ +/* Copyright 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVTTENG_H__ +#define __SVTTENG_H__ + +#include FT_INTERNAL_SERVICE_H +#include FT_MODULE_H + + +FT_BEGIN_HEADER + + + /* + * SFNT table loading service. + */ + +#define FT_SERVICE_ID_TRUETYPE_ENGINE "truetype-engine" + + /* + * Used to implement FT_Get_TrueType_Engine_Type + */ + + FT_DEFINE_SERVICE( TrueTypeEngine ) + { + FT_TrueTypeEngineType engine_type; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVTTENG_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svttglyf.h b/portlibs/include/freetype/internal/services/svttglyf.h new file mode 100644 index 00000000..e57d484b --- /dev/null +++ b/portlibs/include/freetype/internal/services/svttglyf.h @@ -0,0 +1,48 @@ +/***************************************************************************/ +/* */ +/* svttglyf.h */ +/* */ +/* The FreeType TrueType glyph service. */ +/* */ +/* Copyright 2007 by David Turner. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + +#ifndef __SVTTGLYF_H__ +#define __SVTTGLYF_H__ + +#include FT_INTERNAL_SERVICE_H +#include FT_TRUETYPE_TABLES_H + + +FT_BEGIN_HEADER + + +#define FT_SERVICE_ID_TT_GLYF "tt-glyf" + + + typedef FT_ULong + (*TT_Glyf_GetLocationFunc)( FT_Face face, + FT_UInt gindex, + FT_ULong *psize ); + + FT_DEFINE_SERVICE( TTGlyf ) + { + TT_Glyf_GetLocationFunc get_location; + }; + + /* */ + + +FT_END_HEADER + +#endif /* __SVTTGLYF_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svwinfnt.h b/portlibs/include/freetype/internal/services/svwinfnt.h new file mode 100644 index 00000000..57f7765d --- /dev/null +++ b/portlibs/include/freetype/internal/services/svwinfnt.h @@ -0,0 +1,50 @@ +/***************************************************************************/ +/* */ +/* svwinfnt.h */ +/* */ +/* The FreeType Windows FNT/FONT service (specification). */ +/* */ +/* Copyright 2003 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVWINFNT_H__ +#define __SVWINFNT_H__ + +#include FT_INTERNAL_SERVICE_H +#include FT_WINFONTS_H + + +FT_BEGIN_HEADER + + +#define FT_SERVICE_ID_WINFNT "winfonts" + + typedef FT_Error + (*FT_WinFnt_GetHeaderFunc)( FT_Face face, + FT_WinFNT_HeaderRec *aheader ); + + + FT_DEFINE_SERVICE( WinFnt ) + { + FT_WinFnt_GetHeaderFunc get_header; + }; + + /* */ + + +FT_END_HEADER + + +#endif /* __SVWINFNT_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/services/svxf86nm.h b/portlibs/include/freetype/internal/services/svxf86nm.h new file mode 100644 index 00000000..ca5d884a --- /dev/null +++ b/portlibs/include/freetype/internal/services/svxf86nm.h @@ -0,0 +1,55 @@ +/***************************************************************************/ +/* */ +/* svxf86nm.h */ +/* */ +/* The FreeType XFree86 services (specification only). */ +/* */ +/* Copyright 2003 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SVXF86NM_H__ +#define __SVXF86NM_H__ + +#include FT_INTERNAL_SERVICE_H + + +FT_BEGIN_HEADER + + + /* + * A trivial service used to return the name of a face's font driver, + * according to the XFree86 nomenclature. Note that the service data + * is a simple constant string pointer. + */ + +#define FT_SERVICE_ID_XF86_NAME "xf86-driver-name" + +#define FT_XF86_FORMAT_TRUETYPE "TrueType" +#define FT_XF86_FORMAT_TYPE_1 "Type 1" +#define FT_XF86_FORMAT_BDF "BDF" +#define FT_XF86_FORMAT_PCF "PCF" +#define FT_XF86_FORMAT_TYPE_42 "Type 42" +#define FT_XF86_FORMAT_CID "CID Type 1" +#define FT_XF86_FORMAT_CFF "CFF" +#define FT_XF86_FORMAT_PFR "PFR" +#define FT_XF86_FORMAT_WINFNT "Windows FNT" + + /* */ + + +FT_END_HEADER + + +#endif /* __SVXF86NM_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/sfnt.h b/portlibs/include/freetype/internal/sfnt.h new file mode 100644 index 00000000..7e8f6847 --- /dev/null +++ b/portlibs/include/freetype/internal/sfnt.h @@ -0,0 +1,762 @@ +/***************************************************************************/ +/* */ +/* sfnt.h */ +/* */ +/* High-level `sfnt' driver interface (specification). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2005, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __SFNT_H__ +#define __SFNT_H__ + + +#include <ft2build.h> +#include FT_INTERNAL_DRIVER_H +#include FT_INTERNAL_TRUETYPE_TYPES_H + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Init_Face_Func */ + /* */ + /* <Description> */ + /* First part of the SFNT face object initialization. This finds */ + /* the face in a SFNT file or collection, and load its format tag in */ + /* face->format_tag. */ + /* */ + /* <Input> */ + /* stream :: The input stream. */ + /* */ + /* face :: A handle to the target face object. */ + /* */ + /* face_index :: The index of the TrueType font, if we are opening a */ + /* collection. */ + /* */ + /* num_params :: The number of additional parameters. */ + /* */ + /* params :: Optional additional parameters. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* The stream cursor must be at the font file's origin. */ + /* */ + /* This function recognizes fonts embedded in a `TrueType */ + /* collection'. */ + /* */ + /* Once the format tag has been validated by the font driver, it */ + /* should then call the TT_Load_Face_Func() callback to read the rest */ + /* of the SFNT tables in the object. */ + /* */ + typedef FT_Error + (*TT_Init_Face_Func)( FT_Stream stream, + TT_Face face, + FT_Int face_index, + FT_Int num_params, + FT_Parameter* params ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Load_Face_Func */ + /* */ + /* <Description> */ + /* Second part of the SFNT face object initialization. This loads */ + /* the common SFNT tables (head, OS/2, maxp, metrics, etc.) in the */ + /* face object. */ + /* */ + /* <Input> */ + /* stream :: The input stream. */ + /* */ + /* face :: A handle to the target face object. */ + /* */ + /* face_index :: The index of the TrueType font, if we are opening a */ + /* collection. */ + /* */ + /* num_params :: The number of additional parameters. */ + /* */ + /* params :: Optional additional parameters. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* This function must be called after TT_Init_Face_Func(). */ + /* */ + typedef FT_Error + (*TT_Load_Face_Func)( FT_Stream stream, + TT_Face face, + FT_Int face_index, + FT_Int num_params, + FT_Parameter* params ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Done_Face_Func */ + /* */ + /* <Description> */ + /* A callback used to delete the common SFNT data from a face. */ + /* */ + /* <Input> */ + /* face :: A handle to the target face object. */ + /* */ + /* <Note> */ + /* This function does NOT destroy the face object. */ + /* */ + typedef void + (*TT_Done_Face_Func)( TT_Face face ); + + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Load_SFNT_HeaderRec_Func */ + /* */ + /* <Description> */ + /* Loads the header of a SFNT font file. Supports collections. */ + /* */ + /* <Input> */ + /* face :: A handle to the target face object. */ + /* */ + /* stream :: The input stream. */ + /* */ + /* face_index :: The index of the TrueType font, if we are opening a */ + /* collection. */ + /* */ + /* <Output> */ + /* sfnt :: The SFNT header. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* The stream cursor must be at the font file's origin. */ + /* */ + /* This function recognizes fonts embedded in a `TrueType */ + /* collection'. */ + /* */ + /* This function checks that the header is valid by looking at the */ + /* values of `search_range', `entry_selector', and `range_shift'. */ + /* */ + typedef FT_Error + (*TT_Load_SFNT_HeaderRec_Func)( TT_Face face, + FT_Stream stream, + FT_Long face_index, + SFNT_Header sfnt ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Load_Directory_Func */ + /* */ + /* <Description> */ + /* Loads the table directory into a face object. */ + /* */ + /* <Input> */ + /* face :: A handle to the target face object. */ + /* */ + /* stream :: The input stream. */ + /* */ + /* sfnt :: The SFNT header. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* The stream cursor must be on the first byte after the 4-byte font */ + /* format tag. This is the case just after a call to */ + /* TT_Load_Format_Tag(). */ + /* */ + typedef FT_Error + (*TT_Load_Directory_Func)( TT_Face face, + FT_Stream stream, + SFNT_Header sfnt ); + +#endif /* FT_CONFIG_OPTION_OLD_INTERNALS */ + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Load_Any_Func */ + /* */ + /* <Description> */ + /* Load any font table into client memory. */ + /* */ + /* <Input> */ + /* face :: The face object to look for. */ + /* */ + /* tag :: The tag of table to load. Use the value 0 if you want */ + /* to access the whole font file, else set this parameter */ + /* to a valid TrueType table tag that you can forge with */ + /* the MAKE_TT_TAG macro. */ + /* */ + /* offset :: The starting offset in the table (or the file if */ + /* tag == 0). */ + /* */ + /* length :: The address of the decision variable: */ + /* */ + /* If length == NULL: */ + /* Loads the whole table. Returns an error if */ + /* `offset' == 0! */ + /* */ + /* If *length == 0: */ + /* Exits immediately; returning the length of the given */ + /* table or of the font file, depending on the value of */ + /* `tag'. */ + /* */ + /* If *length != 0: */ + /* Loads the next `length' bytes of table or font, */ + /* starting at offset `offset' (in table or font too). */ + /* */ + /* <Output> */ + /* buffer :: The address of target buffer. */ + /* */ + /* <Return> */ + /* TrueType error code. 0 means success. */ + /* */ + typedef FT_Error + (*TT_Load_Any_Func)( TT_Face face, + FT_ULong tag, + FT_Long offset, + FT_Byte *buffer, + FT_ULong* length ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Find_SBit_Image_Func */ + /* */ + /* <Description> */ + /* Check whether an embedded bitmap (an `sbit') exists for a given */ + /* glyph, at a given strike. */ + /* */ + /* <Input> */ + /* face :: The target face object. */ + /* */ + /* glyph_index :: The glyph index. */ + /* */ + /* strike_index :: The current strike index. */ + /* */ + /* <Output> */ + /* arange :: The SBit range containing the glyph index. */ + /* */ + /* astrike :: The SBit strike containing the glyph index. */ + /* */ + /* aglyph_offset :: The offset of the glyph data in `EBDT' table. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. Returns */ + /* SFNT_Err_Invalid_Argument if no sbit exists for the requested */ + /* glyph. */ + /* */ + typedef FT_Error + (*TT_Find_SBit_Image_Func)( TT_Face face, + FT_UInt glyph_index, + FT_ULong strike_index, + TT_SBit_Range *arange, + TT_SBit_Strike *astrike, + FT_ULong *aglyph_offset ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Load_SBit_Metrics_Func */ + /* */ + /* <Description> */ + /* Get the big metrics for a given embedded bitmap. */ + /* */ + /* <Input> */ + /* stream :: The input stream. */ + /* */ + /* range :: The SBit range containing the glyph. */ + /* */ + /* <Output> */ + /* big_metrics :: A big SBit metrics structure for the glyph. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* The stream cursor must be positioned at the glyph's offset within */ + /* the `EBDT' table before the call. */ + /* */ + /* If the image format uses variable metrics, the stream cursor is */ + /* positioned just after the metrics header in the `EBDT' table on */ + /* function exit. */ + /* */ + typedef FT_Error + (*TT_Load_SBit_Metrics_Func)( FT_Stream stream, + TT_SBit_Range range, + TT_SBit_Metrics metrics ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Load_SBit_Image_Func */ + /* */ + /* <Description> */ + /* Load a given glyph sbit image from the font resource. This also */ + /* returns its metrics. */ + /* */ + /* <Input> */ + /* face :: */ + /* The target face object. */ + /* */ + /* strike_index :: */ + /* The strike index. */ + /* */ + /* glyph_index :: */ + /* The current glyph index. */ + /* */ + /* load_flags :: */ + /* The current load flags. */ + /* */ + /* stream :: */ + /* The input stream. */ + /* */ + /* <Output> */ + /* amap :: */ + /* The target pixmap. */ + /* */ + /* ametrics :: */ + /* A big sbit metrics structure for the glyph image. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. Returns an error if no */ + /* glyph sbit exists for the index. */ + /* */ + /* <Note> */ + /* The `map.buffer' field is always freed before the glyph is loaded. */ + /* */ + typedef FT_Error + (*TT_Load_SBit_Image_Func)( TT_Face face, + FT_ULong strike_index, + FT_UInt glyph_index, + FT_UInt load_flags, + FT_Stream stream, + FT_Bitmap *amap, + TT_SBit_MetricsRec *ametrics ); + + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Set_SBit_Strike_OldFunc */ + /* */ + /* <Description> */ + /* Select an sbit strike for a given size request. */ + /* */ + /* <Input> */ + /* face :: The target face object. */ + /* */ + /* req :: The size request. */ + /* */ + /* <Output> */ + /* astrike_index :: The index of the sbit strike. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. Returns an error if no */ + /* sbit strike exists for the selected ppem values. */ + /* */ + typedef FT_Error + (*TT_Set_SBit_Strike_OldFunc)( TT_Face face, + FT_UInt x_ppem, + FT_UInt y_ppem, + FT_ULong* astrike_index ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_CharMap_Load_Func */ + /* */ + /* <Description> */ + /* Loads a given TrueType character map into memory. */ + /* */ + /* <Input> */ + /* face :: A handle to the parent face object. */ + /* */ + /* stream :: A handle to the current stream object. */ + /* */ + /* <InOut> */ + /* cmap :: A pointer to a cmap object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* The function assumes that the stream is already in use (i.e., */ + /* opened). In case of error, all partially allocated tables are */ + /* released. */ + /* */ + typedef FT_Error + (*TT_CharMap_Load_Func)( TT_Face face, + void* cmap, + FT_Stream input ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_CharMap_Free_Func */ + /* */ + /* <Description> */ + /* Destroys a character mapping table. */ + /* */ + /* <Input> */ + /* face :: A handle to the parent face object. */ + /* */ + /* cmap :: A handle to a cmap object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + typedef FT_Error + (*TT_CharMap_Free_Func)( TT_Face face, + void* cmap ); + +#endif /* FT_CONFIG_OPTION_OLD_INTERNALS */ + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Set_SBit_Strike_Func */ + /* */ + /* <Description> */ + /* Select an sbit strike for a given size request. */ + /* */ + /* <Input> */ + /* face :: The target face object. */ + /* */ + /* req :: The size request. */ + /* */ + /* <Output> */ + /* astrike_index :: The index of the sbit strike. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. Returns an error if no */ + /* sbit strike exists for the selected ppem values. */ + /* */ + typedef FT_Error + (*TT_Set_SBit_Strike_Func)( TT_Face face, + FT_Size_Request req, + FT_ULong* astrike_index ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Load_Strike_Metrics_Func */ + /* */ + /* <Description> */ + /* Load the metrics of a given strike. */ + /* */ + /* <Input> */ + /* face :: The target face object. */ + /* */ + /* strike_index :: The strike index. */ + /* */ + /* <Output> */ + /* metrics :: the metrics of the strike. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. Returns an error if no */ + /* such sbit strike exists. */ + /* */ + typedef FT_Error + (*TT_Load_Strike_Metrics_Func)( TT_Face face, + FT_ULong strike_index, + FT_Size_Metrics* metrics ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Get_PS_Name_Func */ + /* */ + /* <Description> */ + /* Get the PostScript glyph name of a glyph. */ + /* */ + /* <Input> */ + /* idx :: The glyph index. */ + /* */ + /* PSname :: The address of a string pointer. Will be NULL in case */ + /* of error, otherwise it is a pointer to the glyph name. */ + /* */ + /* You must not modify the returned string! */ + /* */ + /* <Output> */ + /* FreeType error code. 0 means success. */ + /* */ + typedef FT_Error + (*TT_Get_PS_Name_Func)( TT_Face face, + FT_UInt idx, + FT_String** PSname ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Load_Metrics_Func */ + /* */ + /* <Description> */ + /* Load a metrics table, which is a table with a horizontal and a */ + /* vertical version. */ + /* */ + /* <Input> */ + /* face :: A handle to the target face object. */ + /* */ + /* stream :: The input stream. */ + /* */ + /* vertical :: A boolean flag. If set, load the vertical one. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + typedef FT_Error + (*TT_Load_Metrics_Func)( TT_Face face, + FT_Stream stream, + FT_Bool vertical ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Get_Metrics_Func */ + /* */ + /* <Description> */ + /* Load the horizontal or vertical header in a face object. */ + /* */ + /* <Input> */ + /* face :: A handle to the target face object. */ + /* */ + /* stream :: The input stream. */ + /* */ + /* vertical :: A boolean flag. If set, load vertical metrics. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + typedef FT_Error + (*TT_Get_Metrics_Func)( TT_Face face, + FT_Bool vertical, + FT_UInt gindex, + FT_Short* abearing, + FT_UShort* aadvance ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Load_Table_Func */ + /* */ + /* <Description> */ + /* Load a given TrueType table. */ + /* */ + /* <Input> */ + /* face :: A handle to the target face object. */ + /* */ + /* stream :: The input stream. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* The function uses `face->goto_table' to seek the stream to the */ + /* start of the table, except while loading the font directory. */ + /* */ + typedef FT_Error + (*TT_Load_Table_Func)( TT_Face face, + FT_Stream stream ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Free_Table_Func */ + /* */ + /* <Description> */ + /* Free a given TrueType table. */ + /* */ + /* <Input> */ + /* face :: A handle to the target face object. */ + /* */ + typedef void + (*TT_Free_Table_Func)( TT_Face face ); + + + /* + * @functype: + * TT_Face_GetKerningFunc + * + * @description: + * Return the horizontal kerning value between two glyphs. + * + * @input: + * face :: A handle to the source face object. + * left_glyph :: The left glyph index. + * right_glyph :: The right glyph index. + * + * @return: + * The kerning value in font units. + */ + typedef FT_Int + (*TT_Face_GetKerningFunc)( TT_Face face, + FT_UInt left_glyph, + FT_UInt right_glyph ); + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* SFNT_Interface */ + /* */ + /* <Description> */ + /* This structure holds pointers to the functions used to load and */ + /* free the basic tables that are required in a `sfnt' font file. */ + /* */ + /* <Fields> */ + /* Check the various xxx_Func() descriptions for details. */ + /* */ + typedef struct SFNT_Interface_ + { + TT_Loader_GotoTableFunc goto_table; + + TT_Init_Face_Func init_face; + TT_Load_Face_Func load_face; + TT_Done_Face_Func done_face; + FT_Module_Requester get_interface; + + TT_Load_Any_Func load_any; + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + TT_Load_SFNT_HeaderRec_Func load_sfnt_header; + TT_Load_Directory_Func load_directory; +#endif + + /* these functions are called by `load_face' but they can also */ + /* be called from external modules, if there is a need to do so */ + TT_Load_Table_Func load_head; + TT_Load_Metrics_Func load_hhea; + TT_Load_Table_Func load_cmap; + TT_Load_Table_Func load_maxp; + TT_Load_Table_Func load_os2; + TT_Load_Table_Func load_post; + + TT_Load_Table_Func load_name; + TT_Free_Table_Func free_name; + + /* optional tables */ +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + TT_Load_Table_Func load_hdmx_stub; + TT_Free_Table_Func free_hdmx_stub; +#endif + + /* this field was called `load_kerning' up to version 2.1.10 */ + TT_Load_Table_Func load_kern; + + TT_Load_Table_Func load_gasp; + TT_Load_Table_Func load_pclt; + + /* see `ttload.h'; this field was called `load_bitmap_header' up to */ + /* version 2.1.10 */ + TT_Load_Table_Func load_bhed; + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + + /* see `ttsbit.h' */ + TT_Set_SBit_Strike_OldFunc set_sbit_strike_stub; + TT_Load_Table_Func load_sbits_stub; + + /* + * The following two fields appeared in version 2.1.8, and were placed + * between `load_sbits' and `load_sbit_image'. We support them as a + * special exception since they are used by Xfont library within the + * X.Org xserver, and because the probability that other rogue clients + * use the other version 2.1.7 fields below is _extremely_ low. + * + * Note that this forces us to disable an interesting memory-saving + * optimization though... + */ + + TT_Find_SBit_Image_Func find_sbit_image; + TT_Load_SBit_Metrics_Func load_sbit_metrics; + +#endif + + TT_Load_SBit_Image_Func load_sbit_image; + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + TT_Free_Table_Func free_sbits_stub; +#endif + + /* see `ttpost.h' */ + TT_Get_PS_Name_Func get_psname; + TT_Free_Table_Func free_psnames; + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + TT_CharMap_Load_Func load_charmap_stub; + TT_CharMap_Free_Func free_charmap_stub; +#endif + + /* starting here, the structure differs from version 2.1.7 */ + + /* this field was introduced in version 2.1.8, named `get_psname' */ + TT_Face_GetKerningFunc get_kerning; + + /* new elements introduced after version 2.1.10 */ + + /* load the font directory, i.e., the offset table and */ + /* the table directory */ + TT_Load_Table_Func load_font_dir; + TT_Load_Metrics_Func load_hmtx; + + TT_Load_Table_Func load_eblc; + TT_Free_Table_Func free_eblc; + + TT_Set_SBit_Strike_Func set_sbit_strike; + TT_Load_Strike_Metrics_Func load_strike_metrics; + + TT_Get_Metrics_Func get_metrics; + + } SFNT_Interface; + + + /* transitional */ + typedef SFNT_Interface* SFNT_Service; + + +FT_END_HEADER + +#endif /* __SFNT_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/t1types.h b/portlibs/include/freetype/internal/t1types.h new file mode 100644 index 00000000..4b05fa32 --- /dev/null +++ b/portlibs/include/freetype/internal/t1types.h @@ -0,0 +1,254 @@ +/***************************************************************************/ +/* */ +/* t1types.h */ +/* */ +/* Basic Type1/Type2 type definitions and interface (specification */ +/* only). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __T1TYPES_H__ +#define __T1TYPES_H__ + + +#include <ft2build.h> +#include FT_TYPE1_TABLES_H +#include FT_INTERNAL_POSTSCRIPT_HINTS_H +#include FT_INTERNAL_SERVICE_H +#include FT_SERVICE_POSTSCRIPT_CMAPS_H + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*** ***/ + /*** ***/ + /*** REQUIRED TYPE1/TYPE2 TABLES DEFINITIONS ***/ + /*** ***/ + /*** ***/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* T1_EncodingRec */ + /* */ + /* <Description> */ + /* A structure modeling a custom encoding. */ + /* */ + /* <Fields> */ + /* num_chars :: The number of character codes in the encoding. */ + /* Usually 256. */ + /* */ + /* code_first :: The lowest valid character code in the encoding. */ + /* */ + /* code_last :: The highest valid character code in the encoding. */ + /* */ + /* char_index :: An array of corresponding glyph indices. */ + /* */ + /* char_name :: An array of corresponding glyph names. */ + /* */ + typedef struct T1_EncodingRecRec_ + { + FT_Int num_chars; + FT_Int code_first; + FT_Int code_last; + + FT_UShort* char_index; + FT_String** char_name; + + } T1_EncodingRec, *T1_Encoding; + + + typedef enum T1_EncodingType_ + { + T1_ENCODING_TYPE_NONE = 0, + T1_ENCODING_TYPE_ARRAY, + T1_ENCODING_TYPE_STANDARD, + T1_ENCODING_TYPE_ISOLATIN1, + T1_ENCODING_TYPE_EXPERT + + } T1_EncodingType; + + + typedef struct T1_FontRec_ + { + PS_FontInfoRec font_info; /* font info dictionary */ + PS_PrivateRec private_dict; /* private dictionary */ + FT_String* font_name; /* top-level dictionary */ + + T1_EncodingType encoding_type; + T1_EncodingRec encoding; + + FT_Byte* subrs_block; + FT_Byte* charstrings_block; + FT_Byte* glyph_names_block; + + FT_Int num_subrs; + FT_Byte** subrs; + FT_PtrDist* subrs_len; + + FT_Int num_glyphs; + FT_String** glyph_names; /* array of glyph names */ + FT_Byte** charstrings; /* array of glyph charstrings */ + FT_PtrDist* charstrings_len; + + FT_Byte paint_type; + FT_Byte font_type; + FT_Matrix font_matrix; + FT_Vector font_offset; + FT_BBox font_bbox; + FT_Long font_id; + + FT_Fixed stroke_width; + + } T1_FontRec, *T1_Font; + + + typedef struct CID_SubrsRec_ + { + FT_UInt num_subrs; + FT_Byte** code; + + } CID_SubrsRec, *CID_Subrs; + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*** ***/ + /*** ***/ + /*** AFM FONT INFORMATION STRUCTURES ***/ + /*** ***/ + /*** ***/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + typedef struct AFM_TrackKernRec_ + { + FT_Int degree; + FT_Fixed min_ptsize; + FT_Fixed min_kern; + FT_Fixed max_ptsize; + FT_Fixed max_kern; + + } AFM_TrackKernRec, *AFM_TrackKern; + + typedef struct AFM_KernPairRec_ + { + FT_Int index1; + FT_Int index2; + FT_Int x; + FT_Int y; + + } AFM_KernPairRec, *AFM_KernPair; + + typedef struct AFM_FontInfoRec_ + { + FT_Bool IsCIDFont; + FT_BBox FontBBox; + FT_Fixed Ascender; + FT_Fixed Descender; + AFM_TrackKern TrackKerns; /* free if non-NULL */ + FT_Int NumTrackKern; + AFM_KernPair KernPairs; /* free if non-NULL */ + FT_Int NumKernPair; + + } AFM_FontInfoRec, *AFM_FontInfo; + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*** ***/ + /*** ***/ + /*** ORIGINAL T1_FACE CLASS DEFINITION ***/ + /*** ***/ + /*** ***/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + typedef struct T1_FaceRec_* T1_Face; + typedef struct CID_FaceRec_* CID_Face; + + + typedef struct T1_FaceRec_ + { + FT_FaceRec root; + T1_FontRec type1; + const void* psnames; + const void* psaux; + const void* afm_data; + FT_CharMapRec charmaprecs[2]; + FT_CharMap charmaps[2]; + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + PS_Unicodes unicode_map; +#endif + + /* support for Multiple Masters fonts */ + PS_Blend blend; + + /* undocumented, optional: indices of subroutines that express */ + /* the NormalizeDesignVector and the ConvertDesignVector procedure, */ + /* respectively, as Type 2 charstrings; -1 if keywords not present */ + FT_Int ndv_idx; + FT_Int cdv_idx; + + /* undocumented, optional: has the same meaning as len_buildchar */ + /* for Type 2 fonts; manipulated by othersubrs 19, 24, and 25 */ + FT_UInt len_buildchar; + FT_Int* buildchar; + + /* since version 2.1 - interface to PostScript hinter */ + const void* pshinter; + + } T1_FaceRec; + + + typedef struct CID_FaceRec_ + { + FT_FaceRec root; + void* psnames; + void* psaux; + CID_FaceInfoRec cid; +#if 0 + void* afm_data; +#endif + CID_Subrs subrs; + + /* since version 2.1 - interface to PostScript hinter */ + void* pshinter; + + /* since version 2.1.8, but was originally positioned after `afm_data' */ + FT_Byte* binary_data; /* used if hex data has been converted */ + FT_Stream cid_stream; + + } CID_FaceRec; + + +FT_END_HEADER + +#endif /* __T1TYPES_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/internal/tttypes.h b/portlibs/include/freetype/internal/tttypes.h new file mode 100644 index 00000000..85fc27f7 --- /dev/null +++ b/portlibs/include/freetype/internal/tttypes.h @@ -0,0 +1,1543 @@ +/***************************************************************************/ +/* */ +/* tttypes.h */ +/* */ +/* Basic SFNT/TrueType type definitions and interface (specification */ +/* only). */ +/* */ +/* Copyright 1996-2001, 2002, 2004, 2005, 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __TTTYPES_H__ +#define __TTTYPES_H__ + + +#include <ft2build.h> +#include FT_TRUETYPE_TABLES_H +#include FT_INTERNAL_OBJECTS_H + +#ifdef TT_CONFIG_OPTION_GX_VAR_SUPPORT +#include FT_MULTIPLE_MASTERS_H +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*** ***/ + /*** ***/ + /*** REQUIRED TRUETYPE/OPENTYPE TABLES DEFINITIONS ***/ + /*** ***/ + /*** ***/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TTC_HeaderRec */ + /* */ + /* <Description> */ + /* TrueType collection header. This table contains the offsets of */ + /* the font headers of each distinct TrueType face in the file. */ + /* */ + /* <Fields> */ + /* tag :: Must be `ttc ' to indicate a TrueType collection. */ + /* */ + /* version :: The version number. */ + /* */ + /* count :: The number of faces in the collection. The */ + /* specification says this should be an unsigned long, but */ + /* we use a signed long since we need the value -1 for */ + /* specific purposes. */ + /* */ + /* offsets :: The offsets of the font headers, one per face. */ + /* */ + typedef struct TTC_HeaderRec_ + { + FT_ULong tag; + FT_Fixed version; + FT_Long count; + FT_ULong* offsets; + + } TTC_HeaderRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* SFNT_HeaderRec */ + /* */ + /* <Description> */ + /* SFNT file format header. */ + /* */ + /* <Fields> */ + /* format_tag :: The font format tag. */ + /* */ + /* num_tables :: The number of tables in file. */ + /* */ + /* search_range :: Must be `16 * (max power of 2 <= num_tables)'. */ + /* */ + /* entry_selector :: Must be log2 of `search_range / 16'. */ + /* */ + /* range_shift :: Must be `num_tables * 16 - search_range'. */ + /* */ + typedef struct SFNT_HeaderRec_ + { + FT_ULong format_tag; + FT_UShort num_tables; + FT_UShort search_range; + FT_UShort entry_selector; + FT_UShort range_shift; + + FT_ULong offset; /* not in file */ + + } SFNT_HeaderRec, *SFNT_Header; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_TableRec */ + /* */ + /* <Description> */ + /* This structure describes a given table of a TrueType font. */ + /* */ + /* <Fields> */ + /* Tag :: A four-bytes tag describing the table. */ + /* */ + /* CheckSum :: The table checksum. This value can be ignored. */ + /* */ + /* Offset :: The offset of the table from the start of the TrueType */ + /* font in its resource. */ + /* */ + /* Length :: The table length (in bytes). */ + /* */ + typedef struct TT_TableRec_ + { + FT_ULong Tag; /* table type */ + FT_ULong CheckSum; /* table checksum */ + FT_ULong Offset; /* table file offset */ + FT_ULong Length; /* table length */ + + } TT_TableRec, *TT_Table; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_LongMetricsRec */ + /* */ + /* <Description> */ + /* A structure modeling the long metrics of the `hmtx' and `vmtx' */ + /* TrueType tables. The values are expressed in font units. */ + /* */ + /* <Fields> */ + /* advance :: The advance width or height for the glyph. */ + /* */ + /* bearing :: The left-side or top-side bearing for the glyph. */ + /* */ + typedef struct TT_LongMetricsRec_ + { + FT_UShort advance; + FT_Short bearing; + + } TT_LongMetricsRec, *TT_LongMetrics; + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* TT_ShortMetrics */ + /* */ + /* <Description> */ + /* A simple type to model the short metrics of the `hmtx' and `vmtx' */ + /* tables. */ + /* */ + typedef FT_Short TT_ShortMetrics; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_NameEntryRec */ + /* */ + /* <Description> */ + /* A structure modeling TrueType name records. Name records are used */ + /* to store important strings like family name, style name, */ + /* copyright, etc. in _localized_ versions (i.e., language, encoding, */ + /* etc). */ + /* */ + /* <Fields> */ + /* platformID :: The ID of the name's encoding platform. */ + /* */ + /* encodingID :: The platform-specific ID for the name's encoding. */ + /* */ + /* languageID :: The platform-specific ID for the name's language. */ + /* */ + /* nameID :: The ID specifying what kind of name this is. */ + /* */ + /* stringLength :: The length of the string in bytes. */ + /* */ + /* stringOffset :: The offset to the string in the `name' table. */ + /* */ + /* string :: A pointer to the string's bytes. Note that these */ + /* are usually UTF-16 encoded characters. */ + /* */ + typedef struct TT_NameEntryRec_ + { + FT_UShort platformID; + FT_UShort encodingID; + FT_UShort languageID; + FT_UShort nameID; + FT_UShort stringLength; + FT_ULong stringOffset; + + /* this last field is not defined in the spec */ + /* but used by the FreeType engine */ + + FT_Byte* string; + + } TT_NameEntryRec, *TT_NameEntry; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_NameTableRec */ + /* */ + /* <Description> */ + /* A structure modeling the TrueType name table. */ + /* */ + /* <Fields> */ + /* format :: The format of the name table. */ + /* */ + /* numNameRecords :: The number of names in table. */ + /* */ + /* storageOffset :: The offset of the name table in the `name' */ + /* TrueType table. */ + /* */ + /* names :: An array of name records. */ + /* */ + /* stream :: the file's input stream. */ + /* */ + typedef struct TT_NameTableRec_ + { + FT_UShort format; + FT_UInt numNameRecords; + FT_UInt storageOffset; + TT_NameEntryRec* names; + FT_Stream stream; + + } TT_NameTableRec, *TT_NameTable; + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*** ***/ + /*** ***/ + /*** OPTIONAL TRUETYPE/OPENTYPE TABLES DEFINITIONS ***/ + /*** ***/ + /*** ***/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_GaspRangeRec */ + /* */ + /* <Description> */ + /* A tiny structure used to model a gasp range according to the */ + /* TrueType specification. */ + /* */ + /* <Fields> */ + /* maxPPEM :: The maximum ppem value to which `gaspFlag' applies. */ + /* */ + /* gaspFlag :: A flag describing the grid-fitting and anti-aliasing */ + /* modes to be used. */ + /* */ + typedef struct TT_GaspRangeRec_ + { + FT_UShort maxPPEM; + FT_UShort gaspFlag; + + } TT_GaspRangeRec, *TT_GaspRange; + + +#define TT_GASP_GRIDFIT 0x01 +#define TT_GASP_DOGRAY 0x02 + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_GaspRec */ + /* */ + /* <Description> */ + /* A structure modeling the TrueType `gasp' table used to specify */ + /* grid-fitting and anti-aliasing behaviour. */ + /* */ + /* <Fields> */ + /* version :: The version number. */ + /* */ + /* numRanges :: The number of gasp ranges in table. */ + /* */ + /* gaspRanges :: An array of gasp ranges. */ + /* */ + typedef struct TT_Gasp_ + { + FT_UShort version; + FT_UShort numRanges; + TT_GaspRange gaspRanges; + + } TT_GaspRec; + + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_HdmxEntryRec */ + /* */ + /* <Description> */ + /* A small structure used to model the pre-computed widths of a given */ + /* size. They are found in the `hdmx' table. */ + /* */ + /* <Fields> */ + /* ppem :: The pixels per EM value at which these metrics apply. */ + /* */ + /* max_width :: The maximum advance width for this metric. */ + /* */ + /* widths :: An array of widths. Note: These are 8-bit bytes. */ + /* */ + typedef struct TT_HdmxEntryRec_ + { + FT_Byte ppem; + FT_Byte max_width; + FT_Byte* widths; + + } TT_HdmxEntryRec, *TT_HdmxEntry; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_HdmxRec */ + /* */ + /* <Description> */ + /* A structure used to model the `hdmx' table, which contains */ + /* pre-computed widths for a set of given sizes/dimensions. */ + /* */ + /* <Fields> */ + /* version :: The version number. */ + /* */ + /* num_records :: The number of hdmx records. */ + /* */ + /* records :: An array of hdmx records. */ + /* */ + typedef struct TT_HdmxRec_ + { + FT_UShort version; + FT_Short num_records; + TT_HdmxEntry records; + + } TT_HdmxRec, *TT_Hdmx; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_Kern0_PairRec */ + /* */ + /* <Description> */ + /* A structure used to model a kerning pair for the kerning table */ + /* format 0. The engine now loads this table if it finds one in the */ + /* font file. */ + /* */ + /* <Fields> */ + /* left :: The index of the left glyph in pair. */ + /* */ + /* right :: The index of the right glyph in pair. */ + /* */ + /* value :: The kerning distance. A positive value spaces the */ + /* glyphs, a negative one makes them closer. */ + /* */ + typedef struct TT_Kern0_PairRec_ + { + FT_UShort left; /* index of left glyph in pair */ + FT_UShort right; /* index of right glyph in pair */ + FT_FWord value; /* kerning value */ + + } TT_Kern0_PairRec, *TT_Kern0_Pair; + +#endif /* FT_CONFIG_OPTION_OLD_INTERNALS */ + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*** ***/ + /*** ***/ + /*** EMBEDDED BITMAPS SUPPORT ***/ + /*** ***/ + /*** ***/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_SBit_MetricsRec */ + /* */ + /* <Description> */ + /* A structure used to hold the big metrics of a given glyph bitmap */ + /* in a TrueType or OpenType font. These are usually found in the */ + /* `EBDT' (Microsoft) or `bloc' (Apple) table. */ + /* */ + /* <Fields> */ + /* height :: The glyph height in pixels. */ + /* */ + /* width :: The glyph width in pixels. */ + /* */ + /* horiBearingX :: The horizontal left bearing. */ + /* */ + /* horiBearingY :: The horizontal top bearing. */ + /* */ + /* horiAdvance :: The horizontal advance. */ + /* */ + /* vertBearingX :: The vertical left bearing. */ + /* */ + /* vertBearingY :: The vertical top bearing. */ + /* */ + /* vertAdvance :: The vertical advance. */ + /* */ + typedef struct TT_SBit_MetricsRec_ + { + FT_Byte height; + FT_Byte width; + + FT_Char horiBearingX; + FT_Char horiBearingY; + FT_Byte horiAdvance; + + FT_Char vertBearingX; + FT_Char vertBearingY; + FT_Byte vertAdvance; + + } TT_SBit_MetricsRec, *TT_SBit_Metrics; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_SBit_SmallMetricsRec */ + /* */ + /* <Description> */ + /* A structure used to hold the small metrics of a given glyph bitmap */ + /* in a TrueType or OpenType font. These are usually found in the */ + /* `EBDT' (Microsoft) or the `bdat' (Apple) table. */ + /* */ + /* <Fields> */ + /* height :: The glyph height in pixels. */ + /* */ + /* width :: The glyph width in pixels. */ + /* */ + /* bearingX :: The left-side bearing. */ + /* */ + /* bearingY :: The top-side bearing. */ + /* */ + /* advance :: The advance width or height. */ + /* */ + typedef struct TT_SBit_Small_Metrics_ + { + FT_Byte height; + FT_Byte width; + + FT_Char bearingX; + FT_Char bearingY; + FT_Byte advance; + + } TT_SBit_SmallMetricsRec, *TT_SBit_SmallMetrics; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_SBit_LineMetricsRec */ + /* */ + /* <Description> */ + /* A structure used to describe the text line metrics of a given */ + /* bitmap strike, for either a horizontal or vertical layout. */ + /* */ + /* <Fields> */ + /* ascender :: The ascender in pixels. */ + /* */ + /* descender :: The descender in pixels. */ + /* */ + /* max_width :: The maximum glyph width in pixels. */ + /* */ + /* caret_slope_enumerator :: Rise of the caret slope, typically set */ + /* to 1 for non-italic fonts. */ + /* */ + /* caret_slope_denominator :: Rise of the caret slope, typically set */ + /* to 0 for non-italic fonts. */ + /* */ + /* caret_offset :: Offset in pixels to move the caret for */ + /* proper positioning. */ + /* */ + /* min_origin_SB :: Minimum of horiBearingX (resp. */ + /* vertBearingY). */ + /* min_advance_SB :: Minimum of */ + /* */ + /* horizontal advance - */ + /* ( horiBearingX + width ) */ + /* */ + /* resp. */ + /* */ + /* vertical advance - */ + /* ( vertBearingY + height ) */ + /* */ + /* max_before_BL :: Maximum of horiBearingY (resp. */ + /* vertBearingY). */ + /* */ + /* min_after_BL :: Minimum of */ + /* */ + /* horiBearingY - height */ + /* */ + /* resp. */ + /* */ + /* vertBearingX - width */ + /* */ + /* pads :: Unused (to make the size of the record */ + /* a multiple of 32 bits. */ + /* */ + typedef struct TT_SBit_LineMetricsRec_ + { + FT_Char ascender; + FT_Char descender; + FT_Byte max_width; + FT_Char caret_slope_numerator; + FT_Char caret_slope_denominator; + FT_Char caret_offset; + FT_Char min_origin_SB; + FT_Char min_advance_SB; + FT_Char max_before_BL; + FT_Char min_after_BL; + FT_Char pads[2]; + + } TT_SBit_LineMetricsRec, *TT_SBit_LineMetrics; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_SBit_RangeRec */ + /* */ + /* <Description> */ + /* A TrueType/OpenType subIndexTable as defined in the `EBLC' */ + /* (Microsoft) or `bloc' (Apple) tables. */ + /* */ + /* <Fields> */ + /* first_glyph :: The first glyph index in the range. */ + /* */ + /* last_glyph :: The last glyph index in the range. */ + /* */ + /* index_format :: The format of index table. Valid values are 1 */ + /* to 5. */ + /* */ + /* image_format :: The format of `EBDT' image data. */ + /* */ + /* image_offset :: The offset to image data in `EBDT'. */ + /* */ + /* image_size :: For index formats 2 and 5. This is the size in */ + /* bytes of each glyph bitmap. */ + /* */ + /* big_metrics :: For index formats 2 and 5. This is the big */ + /* metrics for each glyph bitmap. */ + /* */ + /* num_glyphs :: For index formats 4 and 5. This is the number of */ + /* glyphs in the code array. */ + /* */ + /* glyph_offsets :: For index formats 1 and 3. */ + /* */ + /* glyph_codes :: For index formats 4 and 5. */ + /* */ + /* table_offset :: The offset of the index table in the `EBLC' */ + /* table. Only used during strike loading. */ + /* */ + typedef struct TT_SBit_RangeRec_ + { + FT_UShort first_glyph; + FT_UShort last_glyph; + + FT_UShort index_format; + FT_UShort image_format; + FT_ULong image_offset; + + FT_ULong image_size; + TT_SBit_MetricsRec metrics; + FT_ULong num_glyphs; + + FT_ULong* glyph_offsets; + FT_UShort* glyph_codes; + + FT_ULong table_offset; + + } TT_SBit_RangeRec, *TT_SBit_Range; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_SBit_StrikeRec */ + /* */ + /* <Description> */ + /* A structure used describe a given bitmap strike in the `EBLC' */ + /* (Microsoft) or `bloc' (Apple) tables. */ + /* */ + /* <Fields> */ + /* num_index_ranges :: The number of index ranges. */ + /* */ + /* index_ranges :: An array of glyph index ranges. */ + /* */ + /* color_ref :: Unused. `color_ref' is put in for future */ + /* enhancements, but these fields are already */ + /* in use by other platforms (e.g. Newton). */ + /* For details, please see */ + /* */ + /* http://fonts.apple.com/ */ + /* TTRefMan/RM06/Chap6bloc.html */ + /* */ + /* hori :: The line metrics for horizontal layouts. */ + /* */ + /* vert :: The line metrics for vertical layouts. */ + /* */ + /* start_glyph :: The lowest glyph index for this strike. */ + /* */ + /* end_glyph :: The highest glyph index for this strike. */ + /* */ + /* x_ppem :: The number of horizontal pixels per EM. */ + /* */ + /* y_ppem :: The number of vertical pixels per EM. */ + /* */ + /* bit_depth :: The bit depth. Valid values are 1, 2, 4, */ + /* and 8. */ + /* */ + /* flags :: Is this a vertical or horizontal strike? For */ + /* details, please see */ + /* */ + /* http://fonts.apple.com/ */ + /* TTRefMan/RM06/Chap6bloc.html */ + /* */ + typedef struct TT_SBit_StrikeRec_ + { + FT_Int num_ranges; + TT_SBit_Range sbit_ranges; + FT_ULong ranges_offset; + + FT_ULong color_ref; + + TT_SBit_LineMetricsRec hori; + TT_SBit_LineMetricsRec vert; + + FT_UShort start_glyph; + FT_UShort end_glyph; + + FT_Byte x_ppem; + FT_Byte y_ppem; + + FT_Byte bit_depth; + FT_Char flags; + + } TT_SBit_StrikeRec, *TT_SBit_Strike; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_SBit_ComponentRec */ + /* */ + /* <Description> */ + /* A simple structure to describe a compound sbit element. */ + /* */ + /* <Fields> */ + /* glyph_code :: The element's glyph index. */ + /* */ + /* x_offset :: The element's left bearing. */ + /* */ + /* y_offset :: The element's top bearing. */ + /* */ + typedef struct TT_SBit_ComponentRec_ + { + FT_UShort glyph_code; + FT_Char x_offset; + FT_Char y_offset; + + } TT_SBit_ComponentRec, *TT_SBit_Component; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_SBit_ScaleRec */ + /* */ + /* <Description> */ + /* A structure used describe a given bitmap scaling table, as defined */ + /* in the `EBSC' table. */ + /* */ + /* <Fields> */ + /* hori :: The horizontal line metrics. */ + /* */ + /* vert :: The vertical line metrics. */ + /* */ + /* x_ppem :: The number of horizontal pixels per EM. */ + /* */ + /* y_ppem :: The number of vertical pixels per EM. */ + /* */ + /* x_ppem_substitute :: Substitution x_ppem value. */ + /* */ + /* y_ppem_substitute :: Substitution y_ppem value. */ + /* */ + typedef struct TT_SBit_ScaleRec_ + { + TT_SBit_LineMetricsRec hori; + TT_SBit_LineMetricsRec vert; + + FT_Byte x_ppem; + FT_Byte y_ppem; + + FT_Byte x_ppem_substitute; + FT_Byte y_ppem_substitute; + + } TT_SBit_ScaleRec, *TT_SBit_Scale; + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*** ***/ + /*** ***/ + /*** POSTSCRIPT GLYPH NAMES SUPPORT ***/ + /*** ***/ + /*** ***/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_Post_20Rec */ + /* */ + /* <Description> */ + /* Postscript names sub-table, format 2.0. Stores the PS name of */ + /* each glyph in the font face. */ + /* */ + /* <Fields> */ + /* num_glyphs :: The number of named glyphs in the table. */ + /* */ + /* num_names :: The number of PS names stored in the table. */ + /* */ + /* glyph_indices :: The indices of the glyphs in the names arrays. */ + /* */ + /* glyph_names :: The PS names not in Mac Encoding. */ + /* */ + typedef struct TT_Post_20Rec_ + { + FT_UShort num_glyphs; + FT_UShort num_names; + FT_UShort* glyph_indices; + FT_Char** glyph_names; + + } TT_Post_20Rec, *TT_Post_20; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_Post_25Rec */ + /* */ + /* <Description> */ + /* Postscript names sub-table, format 2.5. Stores the PS name of */ + /* each glyph in the font face. */ + /* */ + /* <Fields> */ + /* num_glyphs :: The number of glyphs in the table. */ + /* */ + /* offsets :: An array of signed offsets in a normal Mac */ + /* Postscript name encoding. */ + /* */ + typedef struct TT_Post_25_ + { + FT_UShort num_glyphs; + FT_Char* offsets; + + } TT_Post_25Rec, *TT_Post_25; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_Post_NamesRec */ + /* */ + /* <Description> */ + /* Postscript names table, either format 2.0 or 2.5. */ + /* */ + /* <Fields> */ + /* loaded :: A flag to indicate whether the PS names are loaded. */ + /* */ + /* format_20 :: The sub-table used for format 2.0. */ + /* */ + /* format_25 :: The sub-table used for format 2.5. */ + /* */ + typedef struct TT_Post_NamesRec_ + { + FT_Bool loaded; + + union + { + TT_Post_20Rec format_20; + TT_Post_25Rec format_25; + + } names; + + } TT_Post_NamesRec, *TT_Post_Names; + + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*** ***/ + /*** ***/ + /*** GX VARIATION TABLE SUPPORT ***/ + /*** ***/ + /*** ***/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + +#ifdef TT_CONFIG_OPTION_GX_VAR_SUPPORT + typedef struct GX_BlendRec_ *GX_Blend; +#endif + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*** ***/ + /*** ***/ + /*** EMBEDDED BDF PROPERTIES TABLE SUPPORT ***/ + /*** ***/ + /*** ***/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + /* + * These types are used to support a `BDF ' table that isn't part of the + * official TrueType specification. It is mainly used in SFNT-based + * bitmap fonts that were generated from a set of BDF fonts. + * + * The format of the table is as follows. + * + * USHORT version `BDF ' table version number, should be 0x0001. + * USHORT strikeCount Number of strikes (bitmap sizes) in this table. + * ULONG stringTable Offset (from start of BDF table) to string + * table. + * + * This is followed by an array of `strikeCount' descriptors, having the + * following format. + * + * USHORT ppem Vertical pixels per EM for this strike. + * USHORT numItems Number of items for this strike (properties and + * atoms). Maximum is 255. + * + * This array in turn is followed by `strikeCount' value sets. Each + * `value set' is an array of `numItems' items with the following format. + * + * ULONG item_name Offset in string table to item name. + * USHORT item_type The item type. Possible values are + * 0 => string (e.g., COMMENT) + * 1 => atom (e.g., FONT or even SIZE) + * 2 => int32 + * 3 => uint32 + * 0x10 => A flag to indicate a properties. This + * is ORed with the above values. + * ULONG item_value For strings => Offset into string table without + * the corresponding double quotes. + * For atoms => Offset into string table. + * For integers => Direct value. + * + * All strings in the string table consist of bytes and are + * zero-terminated. + * + */ + +#ifdef TT_CONFIG_OPTION_BDF + + typedef struct TT_BDFRec_ + { + FT_Byte* table; + FT_Byte* table_end; + FT_Byte* strings; + FT_UInt32 strings_size; + FT_UInt num_strikes; + FT_Bool loaded; + + } TT_BDFRec, *TT_BDF; + +#endif /* TT_CONFIG_OPTION_BDF */ + + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + /*** ***/ + /*** ***/ + /*** ORIGINAL TT_FACE CLASS DEFINITION ***/ + /*** ***/ + /*** ***/ + /*************************************************************************/ + /*************************************************************************/ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This structure/class is defined here because it is common to the */ + /* following formats: TTF, OpenType-TT, and OpenType-CFF. */ + /* */ + /* Note, however, that the classes TT_Size and TT_GlyphSlot are not */ + /* shared between font drivers, and are thus defined in `ttobjs.h'. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Type> */ + /* TT_Face */ + /* */ + /* <Description> */ + /* A handle to a TrueType face/font object. A TT_Face encapsulates */ + /* the resolution and scaling independent parts of a TrueType font */ + /* resource. */ + /* */ + /* <Note> */ + /* The TT_Face structure is also used as a `parent class' for the */ + /* OpenType-CFF class (T2_Face). */ + /* */ + typedef struct TT_FaceRec_* TT_Face; + + + /* a function type used for the truetype bytecode interpreter hooks */ + typedef FT_Error + (*TT_Interpreter)( void* exec_context ); + + /* forward declaration */ + typedef struct TT_LoaderRec_* TT_Loader; + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Loader_GotoTableFunc */ + /* */ + /* <Description> */ + /* Seeks a stream to the start of a given TrueType table. */ + /* */ + /* <Input> */ + /* face :: A handle to the target face object. */ + /* */ + /* tag :: A 4-byte tag used to name the table. */ + /* */ + /* stream :: The input stream. */ + /* */ + /* <Output> */ + /* length :: The length of the table in bytes. Set to 0 if not */ + /* needed. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* The stream cursor must be at the font file's origin. */ + /* */ + typedef FT_Error + (*TT_Loader_GotoTableFunc)( TT_Face face, + FT_ULong tag, + FT_Stream stream, + FT_ULong* length ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Loader_StartGlyphFunc */ + /* */ + /* <Description> */ + /* Seeks a stream to the start of a given glyph element, and opens a */ + /* frame for it. */ + /* */ + /* <Input> */ + /* loader :: The current TrueType glyph loader object. */ + /* */ + /* glyph index :: The index of the glyph to access. */ + /* */ + /* offset :: The offset of the glyph according to the */ + /* `locations' table. */ + /* */ + /* byte_count :: The size of the frame in bytes. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + /* <Note> */ + /* This function is normally equivalent to FT_STREAM_SEEK(offset) */ + /* followed by FT_FRAME_ENTER(byte_count) with the loader's stream, */ + /* but alternative formats (e.g. compressed ones) might use something */ + /* different. */ + /* */ + typedef FT_Error + (*TT_Loader_StartGlyphFunc)( TT_Loader loader, + FT_UInt glyph_index, + FT_ULong offset, + FT_UInt byte_count ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Loader_ReadGlyphFunc */ + /* */ + /* <Description> */ + /* Reads one glyph element (its header, a simple glyph, or a */ + /* composite) from the loader's current stream frame. */ + /* */ + /* <Input> */ + /* loader :: The current TrueType glyph loader object. */ + /* */ + /* <Return> */ + /* FreeType error code. 0 means success. */ + /* */ + typedef FT_Error + (*TT_Loader_ReadGlyphFunc)( TT_Loader loader ); + + + /*************************************************************************/ + /* */ + /* <FuncType> */ + /* TT_Loader_EndGlyphFunc */ + /* */ + /* <Description> */ + /* Closes the current loader stream frame for the glyph. */ + /* */ + /* <Input> */ + /* loader :: The current TrueType glyph loader object. */ + /* */ + typedef void + (*TT_Loader_EndGlyphFunc)( TT_Loader loader ); + + + /*************************************************************************/ + /* */ + /* TrueType Face Type */ + /* */ + /* <Struct> */ + /* TT_Face */ + /* */ + /* <Description> */ + /* The TrueType face class. These objects model the resolution and */ + /* point-size independent data found in a TrueType font file. */ + /* */ + /* <Fields> */ + /* root :: The base FT_Face structure, managed by the */ + /* base layer. */ + /* */ + /* ttc_header :: The TrueType collection header, used when */ + /* the file is a `ttc' rather than a `ttf'. */ + /* For ordinary font files, the field */ + /* `ttc_header.count' is set to 0. */ + /* */ + /* format_tag :: The font format tag. */ + /* */ + /* num_tables :: The number of TrueType tables in this font */ + /* file. */ + /* */ + /* dir_tables :: The directory of TrueType tables for this */ + /* font file. */ + /* */ + /* header :: The font's font header (`head' table). */ + /* Read on font opening. */ + /* */ + /* horizontal :: The font's horizontal header (`hhea' */ + /* table). This field also contains the */ + /* associated horizontal metrics table */ + /* (`hmtx'). */ + /* */ + /* max_profile :: The font's maximum profile table. Read on */ + /* font opening. Note that some maximum */ + /* values cannot be taken directly from this */ + /* table. We thus define additional fields */ + /* below to hold the computed maxima. */ + /* */ + /* vertical_info :: A boolean which is set when the font file */ + /* contains vertical metrics. If not, the */ + /* value of the `vertical' field is */ + /* undefined. */ + /* */ + /* vertical :: The font's vertical header (`vhea' table). */ + /* This field also contains the associated */ + /* vertical metrics table (`vmtx'), if found. */ + /* IMPORTANT: The contents of this field is */ + /* undefined if the `verticalInfo' field is */ + /* unset. */ + /* */ + /* num_names :: The number of name records within this */ + /* TrueType font. */ + /* */ + /* name_table :: The table of name records (`name'). */ + /* */ + /* os2 :: The font's OS/2 table (`OS/2'). */ + /* */ + /* postscript :: The font's PostScript table (`post' */ + /* table). The PostScript glyph names are */ + /* not loaded by the driver on face opening. */ + /* See the `ttpost' module for more details. */ + /* */ + /* cmap_table :: Address of the face's `cmap' SFNT table */ + /* in memory (it's an extracted frame). */ + /* */ + /* cmap_size :: The size in bytes of the `cmap_table' */ + /* described above. */ + /* */ + /* goto_table :: A function called by each TrueType table */ + /* loader to position a stream's cursor to */ + /* the start of a given table according to */ + /* its tag. It defaults to TT_Goto_Face but */ + /* can be different for strange formats (e.g. */ + /* Type 42). */ + /* */ + /* access_glyph_frame :: A function used to access the frame of a */ + /* given glyph within the face's font file. */ + /* */ + /* forget_glyph_frame :: A function used to forget the frame of a */ + /* given glyph when all data has been loaded. */ + /* */ + /* read_glyph_header :: A function used to read a glyph header. */ + /* It must be called between an `access' and */ + /* `forget'. */ + /* */ + /* read_simple_glyph :: A function used to read a simple glyph. */ + /* It must be called after the header was */ + /* read, and before the `forget'. */ + /* */ + /* read_composite_glyph :: A function used to read a composite glyph. */ + /* It must be called after the header was */ + /* read, and before the `forget'. */ + /* */ + /* sfnt :: A pointer to the SFNT service. */ + /* */ + /* psnames :: A pointer to the PostScript names service. */ + /* */ + /* hdmx :: The face's horizontal device metrics */ + /* (`hdmx' table). This table is optional in */ + /* TrueType/OpenType fonts. */ + /* */ + /* gasp :: The grid-fitting and scaling properties */ + /* table (`gasp'). This table is optional in */ + /* TrueType/OpenType fonts. */ + /* */ + /* pclt :: The `pclt' SFNT table. */ + /* */ + /* num_sbit_strikes :: The number of sbit strikes, i.e., bitmap */ + /* sizes, embedded in this font. */ + /* */ + /* sbit_strikes :: An array of sbit strikes embedded in this */ + /* font. This table is optional in a */ + /* TrueType/OpenType font. */ + /* */ + /* num_sbit_scales :: The number of sbit scales for this font. */ + /* */ + /* sbit_scales :: Array of sbit scales embedded in this */ + /* font. This table is optional in a */ + /* TrueType/OpenType font. */ + /* */ + /* postscript_names :: A table used to store the Postscript names */ + /* of the glyphs for this font. See the */ + /* file `ttconfig.h' for comments on the */ + /* TT_CONFIG_OPTION_POSTSCRIPT_NAMES option. */ + /* */ + /* num_locations :: The number of glyph locations in this */ + /* TrueType file. This should be */ + /* identical to the number of glyphs. */ + /* Ignored for Type 2 fonts. */ + /* */ + /* glyph_locations :: An array of longs. These are offsets to */ + /* glyph data within the `glyf' table. */ + /* Ignored for Type 2 font faces. */ + /* */ + /* glyf_len :: The length of the `glyf' table. Needed */ + /* for malformed `loca' tables. */ + /* */ + /* font_program_size :: Size in bytecodes of the face's font */ + /* program. 0 if none defined. Ignored for */ + /* Type 2 fonts. */ + /* */ + /* font_program :: The face's font program (bytecode stream) */ + /* executed at load time, also used during */ + /* glyph rendering. Comes from the `fpgm' */ + /* table. Ignored for Type 2 font fonts. */ + /* */ + /* cvt_program_size :: The size in bytecodes of the face's cvt */ + /* program. Ignored for Type 2 fonts. */ + /* */ + /* cvt_program :: The face's cvt program (bytecode stream) */ + /* executed each time an instance/size is */ + /* changed/reset. Comes from the `prep' */ + /* table. Ignored for Type 2 fonts. */ + /* */ + /* cvt_size :: Size of the control value table (in */ + /* entries). Ignored for Type 2 fonts. */ + /* */ + /* cvt :: The face's original control value table. */ + /* Coordinates are expressed in unscaled font */ + /* units. Comes from the `cvt ' table. */ + /* Ignored for Type 2 fonts. */ + /* */ + /* num_kern_pairs :: The number of kerning pairs present in the */ + /* font file. The engine only loads the */ + /* first horizontal format 0 kern table it */ + /* finds in the font file. Ignored for */ + /* Type 2 fonts. */ + /* */ + /* kern_table_index :: The index of the kerning table in the font */ + /* kerning directory. Ignored for Type 2 */ + /* fonts. */ + /* */ + /* interpreter :: A pointer to the TrueType bytecode */ + /* interpreters field is also used to hook */ + /* the debugger in `ttdebug'. */ + /* */ + /* unpatented_hinting :: If true, use only unpatented methods in */ + /* the bytecode interpreter. */ + /* */ + /* doblend :: A boolean which is set if the font should */ + /* be blended (this is for GX var). */ + /* */ + /* blend :: Contains the data needed to control GX */ + /* variation tables (rather like Multiple */ + /* Master data). */ + /* */ + /* extra :: Reserved for third-party font drivers. */ + /* */ + /* postscript_name :: The PS name of the font. Used by the */ + /* postscript name service. */ + /* */ + typedef struct TT_FaceRec_ + { + FT_FaceRec root; + + TTC_HeaderRec ttc_header; + + FT_ULong format_tag; + FT_UShort num_tables; + TT_Table dir_tables; + + TT_Header header; /* TrueType header table */ + TT_HoriHeader horizontal; /* TrueType horizontal header */ + + TT_MaxProfile max_profile; +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + FT_ULong max_components; /* stubbed to 0 */ +#endif + + FT_Bool vertical_info; + TT_VertHeader vertical; /* TT Vertical header, if present */ + + FT_UShort num_names; /* number of name records */ + TT_NameTableRec name_table; /* name table */ + + TT_OS2 os2; /* TrueType OS/2 table */ + TT_Postscript postscript; /* TrueType Postscript table */ + + FT_Byte* cmap_table; /* extracted `cmap' table */ + FT_ULong cmap_size; + + TT_Loader_GotoTableFunc goto_table; + + TT_Loader_StartGlyphFunc access_glyph_frame; + TT_Loader_EndGlyphFunc forget_glyph_frame; + TT_Loader_ReadGlyphFunc read_glyph_header; + TT_Loader_ReadGlyphFunc read_simple_glyph; + TT_Loader_ReadGlyphFunc read_composite_glyph; + + /* a typeless pointer to the SFNT_Interface table used to load */ + /* the basic TrueType tables in the face object */ + void* sfnt; + + /* a typeless pointer to the FT_Service_PsCMapsRec table used to */ + /* handle glyph names <-> unicode & Mac values */ + void* psnames; + + + /***********************************************************************/ + /* */ + /* Optional TrueType/OpenType tables */ + /* */ + /***********************************************************************/ + + /* horizontal device metrics */ +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + TT_HdmxRec hdmx; +#endif + + /* grid-fitting and scaling table */ + TT_GaspRec gasp; /* the `gasp' table */ + + /* PCL 5 table */ + TT_PCLT pclt; + + /* embedded bitmaps support */ +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + FT_ULong num_sbit_strikes; + TT_SBit_Strike sbit_strikes; +#endif + + FT_ULong num_sbit_scales; + TT_SBit_Scale sbit_scales; + + /* postscript names table */ + TT_Post_NamesRec postscript_names; + + + /***********************************************************************/ + /* */ + /* TrueType-specific fields (ignored by the OTF-Type2 driver) */ + /* */ + /***********************************************************************/ + + /* the glyph locations */ +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + FT_UShort num_locations_stub; + FT_Long* glyph_locations_stub; +#endif + + /* the font program, if any */ + FT_ULong font_program_size; + FT_Byte* font_program; + + /* the cvt program, if any */ + FT_ULong cvt_program_size; + FT_Byte* cvt_program; + + /* the original, unscaled, control value table */ + FT_ULong cvt_size; + FT_Short* cvt; + +#ifdef FT_CONFIG_OPTION_OLD_INTERNALS + /* the format 0 kerning table, if any */ + FT_Int num_kern_pairs; + FT_Int kern_table_index; + TT_Kern0_Pair kern_pairs; +#endif + + /* A pointer to the bytecode interpreter to use. This is also */ + /* used to hook the debugger for the `ttdebug' utility. */ + TT_Interpreter interpreter; + +#ifdef TT_CONFIG_OPTION_UNPATENTED_HINTING + /* Use unpatented hinting only. */ + FT_Bool unpatented_hinting; +#endif + + /***********************************************************************/ + /* */ + /* Other tables or fields. This is used by derivative formats like */ + /* OpenType. */ + /* */ + /***********************************************************************/ + + FT_Generic extra; + + const char* postscript_name; + + /* since version 2.1.8, but was originally placed after */ + /* `glyph_locations_stub' */ + FT_ULong glyf_len; + + /* since version 2.1.8, but was originally placed before `extra' */ +#ifdef TT_CONFIG_OPTION_GX_VAR_SUPPORT + FT_Bool doblend; + GX_Blend blend; +#endif + + /* since version 2.2 */ + + FT_Byte* horz_metrics; + FT_ULong horz_metrics_size; + + FT_Byte* vert_metrics; + FT_ULong vert_metrics_size; + + FT_UInt num_locations; + FT_Byte* glyph_locations; + + FT_Byte* hdmx_table; + FT_ULong hdmx_table_size; + FT_UInt hdmx_record_count; + FT_ULong hdmx_record_size; + FT_Byte* hdmx_record_sizes; + + FT_Byte* sbit_table; + FT_ULong sbit_table_size; + FT_UInt sbit_num_strikes; + + FT_Byte* kern_table; + FT_ULong kern_table_size; + FT_UInt num_kern_tables; + FT_UInt32 kern_avail_bits; + FT_UInt32 kern_order_bits; + +#ifdef TT_CONFIG_OPTION_BDF + TT_BDFRec bdf; +#endif /* TT_CONFIG_OPTION_BDF */ + + /* since 2.3.0 */ + FT_ULong horz_metrics_offset; + FT_ULong vert_metrics_offset; + + } TT_FaceRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_GlyphZoneRec */ + /* */ + /* <Description> */ + /* A glyph zone is used to load, scale and hint glyph outline */ + /* coordinates. */ + /* */ + /* <Fields> */ + /* memory :: A handle to the memory manager. */ + /* */ + /* max_points :: The maximal size in points of the zone. */ + /* */ + /* max_contours :: Max size in links contours of the zone. */ + /* */ + /* n_points :: The current number of points in the zone. */ + /* */ + /* n_contours :: The current number of contours in the zone. */ + /* */ + /* org :: The original glyph coordinates (font */ + /* units/scaled). */ + /* */ + /* cur :: The current glyph coordinates (scaled/hinted). */ + /* */ + /* tags :: The point control tags. */ + /* */ + /* contours :: The contours end points. */ + /* */ + /* first_point :: Offset of the current subglyph's first point. */ + /* */ + typedef struct TT_GlyphZoneRec_ + { + FT_Memory memory; + FT_UShort max_points; + FT_UShort max_contours; + FT_UShort n_points; /* number of points in zone */ + FT_Short n_contours; /* number of contours */ + + FT_Vector* org; /* original point coordinates */ + FT_Vector* cur; /* current point coordinates */ + FT_Vector* orus; /* original (unscaled) point coordinates */ + + FT_Byte* tags; /* current touch flags */ + FT_UShort* contours; /* contour end points */ + + FT_UShort first_point; /* offset of first (#0) point */ + + } TT_GlyphZoneRec, *TT_GlyphZone; + + + /* handle to execution context */ + typedef struct TT_ExecContextRec_* TT_ExecContext; + + /* glyph loader structure */ + typedef struct TT_LoaderRec_ + { + FT_Face face; + FT_Size size; + FT_GlyphSlot glyph; + FT_GlyphLoader gloader; + + FT_ULong load_flags; + FT_UInt glyph_index; + + FT_Stream stream; + FT_Int byte_len; + + FT_Short n_contours; + FT_BBox bbox; + FT_Int left_bearing; + FT_Int advance; + FT_Int linear; + FT_Bool linear_def; + FT_Bool preserve_pps; + FT_Vector pp1; + FT_Vector pp2; + + FT_ULong glyf_offset; + + /* the zone where we load our glyphs */ + TT_GlyphZoneRec base; + TT_GlyphZoneRec zone; + + TT_ExecContext exec; + FT_Byte* instructions; + FT_ULong ins_pos; + + /* for possible extensibility in other formats */ + void* other; + + /* since version 2.1.8 */ + FT_Int top_bearing; + FT_Int vadvance; + FT_Vector pp3; + FT_Vector pp4; + + /* since version 2.2.1 */ + FT_Byte* cursor; + FT_Byte* limit; + + } TT_LoaderRec; + + +FT_END_HEADER + +#endif /* __TTTYPES_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/t1tables.h b/portlibs/include/freetype/t1tables.h new file mode 100644 index 00000000..e29dd9f5 --- /dev/null +++ b/portlibs/include/freetype/t1tables.h @@ -0,0 +1,508 @@ +/***************************************************************************/ +/* */ +/* t1tables.h */ +/* */ +/* Basic Type 1/Type 2 tables definitions and interface (specification */ +/* only). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2006, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __T1TABLES_H__ +#define __T1TABLES_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* type1_tables */ + /* */ + /* <Title> */ + /* Type 1 Tables */ + /* */ + /* <Abstract> */ + /* Type~1 (PostScript) specific font tables. */ + /* */ + /* <Description> */ + /* This section contains the definition of Type 1-specific tables, */ + /* including structures related to other PostScript font formats. */ + /* */ + /*************************************************************************/ + + + /* Note that we separate font data in PS_FontInfoRec and PS_PrivateRec */ + /* structures in order to support Multiple Master fonts. */ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* PS_FontInfoRec */ + /* */ + /* <Description> */ + /* A structure used to model a Type~1 or Type~2 FontInfo dictionary. */ + /* Note that for Multiple Master fonts, each instance has its own */ + /* FontInfo dictionary. */ + /* */ + typedef struct PS_FontInfoRec_ + { + FT_String* version; + FT_String* notice; + FT_String* full_name; + FT_String* family_name; + FT_String* weight; + FT_Long italic_angle; + FT_Bool is_fixed_pitch; + FT_Short underline_position; + FT_UShort underline_thickness; + + /* since 2.3.8 */ + + FT_UShort fs_type; + + } PS_FontInfoRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* PS_FontInfo */ + /* */ + /* <Description> */ + /* A handle to a @PS_FontInfoRec structure. */ + /* */ + typedef struct PS_FontInfoRec_* PS_FontInfo; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* T1_FontInfo */ + /* */ + /* <Description> */ + /* This type is equivalent to @PS_FontInfoRec. It is deprecated but */ + /* kept to maintain source compatibility between various versions of */ + /* FreeType. */ + /* */ + typedef PS_FontInfoRec T1_FontInfo; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* PS_PrivateRec */ + /* */ + /* <Description> */ + /* A structure used to model a Type~1 or Type~2 private dictionary. */ + /* Note that for Multiple Master fonts, each instance has its own */ + /* Private dictionary. */ + /* */ + typedef struct PS_PrivateRec_ + { + FT_Int unique_id; + FT_Int lenIV; + + FT_Byte num_blue_values; + FT_Byte num_other_blues; + FT_Byte num_family_blues; + FT_Byte num_family_other_blues; + + FT_Short blue_values[14]; + FT_Short other_blues[10]; + + FT_Short family_blues [14]; + FT_Short family_other_blues[10]; + + FT_Fixed blue_scale; + FT_Int blue_shift; + FT_Int blue_fuzz; + + FT_UShort standard_width[1]; + FT_UShort standard_height[1]; + + FT_Byte num_snap_widths; + FT_Byte num_snap_heights; + FT_Bool force_bold; + FT_Bool round_stem_up; + + FT_Short snap_widths [13]; /* including std width */ + FT_Short snap_heights[13]; /* including std height */ + + FT_Fixed expansion_factor; + + FT_Long language_group; + FT_Long password; + + FT_Short min_feature[2]; + + } PS_PrivateRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* PS_Private */ + /* */ + /* <Description> */ + /* A handle to a @PS_PrivateRec structure. */ + /* */ + typedef struct PS_PrivateRec_* PS_Private; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* T1_Private */ + /* */ + /* <Description> */ + /* This type is equivalent to @PS_PrivateRec. It is deprecated but */ + /* kept to maintain source compatibility between various versions of */ + /* FreeType. */ + /* */ + typedef PS_PrivateRec T1_Private; + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* T1_Blend_Flags */ + /* */ + /* <Description> */ + /* A set of flags used to indicate which fields are present in a */ + /* given blend dictionary (font info or private). Used to support */ + /* Multiple Masters fonts. */ + /* */ + typedef enum T1_Blend_Flags_ + { + /*# required fields in a FontInfo blend dictionary */ + T1_BLEND_UNDERLINE_POSITION = 0, + T1_BLEND_UNDERLINE_THICKNESS, + T1_BLEND_ITALIC_ANGLE, + + /*# required fields in a Private blend dictionary */ + T1_BLEND_BLUE_VALUES, + T1_BLEND_OTHER_BLUES, + T1_BLEND_STANDARD_WIDTH, + T1_BLEND_STANDARD_HEIGHT, + T1_BLEND_STEM_SNAP_WIDTHS, + T1_BLEND_STEM_SNAP_HEIGHTS, + T1_BLEND_BLUE_SCALE, + T1_BLEND_BLUE_SHIFT, + T1_BLEND_FAMILY_BLUES, + T1_BLEND_FAMILY_OTHER_BLUES, + T1_BLEND_FORCE_BOLD, + + /*# never remove */ + T1_BLEND_MAX + + } T1_Blend_Flags; + + /* */ + + + /*# backwards compatible definitions */ +#define t1_blend_underline_position T1_BLEND_UNDERLINE_POSITION +#define t1_blend_underline_thickness T1_BLEND_UNDERLINE_THICKNESS +#define t1_blend_italic_angle T1_BLEND_ITALIC_ANGLE +#define t1_blend_blue_values T1_BLEND_BLUE_VALUES +#define t1_blend_other_blues T1_BLEND_OTHER_BLUES +#define t1_blend_standard_widths T1_BLEND_STANDARD_WIDTH +#define t1_blend_standard_height T1_BLEND_STANDARD_HEIGHT +#define t1_blend_stem_snap_widths T1_BLEND_STEM_SNAP_WIDTHS +#define t1_blend_stem_snap_heights T1_BLEND_STEM_SNAP_HEIGHTS +#define t1_blend_blue_scale T1_BLEND_BLUE_SCALE +#define t1_blend_blue_shift T1_BLEND_BLUE_SHIFT +#define t1_blend_family_blues T1_BLEND_FAMILY_BLUES +#define t1_blend_family_other_blues T1_BLEND_FAMILY_OTHER_BLUES +#define t1_blend_force_bold T1_BLEND_FORCE_BOLD +#define t1_blend_max T1_BLEND_MAX + + + /* maximum number of Multiple Masters designs, as defined in the spec */ +#define T1_MAX_MM_DESIGNS 16 + + /* maximum number of Multiple Masters axes, as defined in the spec */ +#define T1_MAX_MM_AXIS 4 + + /* maximum number of elements in a design map */ +#define T1_MAX_MM_MAP_POINTS 20 + + + /* this structure is used to store the BlendDesignMap entry for an axis */ + typedef struct PS_DesignMap_ + { + FT_Byte num_points; + FT_Long* design_points; + FT_Fixed* blend_points; + + } PS_DesignMapRec, *PS_DesignMap; + + /* backwards-compatible definition */ + typedef PS_DesignMapRec T1_DesignMap; + + + typedef struct PS_BlendRec_ + { + FT_UInt num_designs; + FT_UInt num_axis; + + FT_String* axis_names[T1_MAX_MM_AXIS]; + FT_Fixed* design_pos[T1_MAX_MM_DESIGNS]; + PS_DesignMapRec design_map[T1_MAX_MM_AXIS]; + + FT_Fixed* weight_vector; + FT_Fixed* default_weight_vector; + + PS_FontInfo font_infos[T1_MAX_MM_DESIGNS + 1]; + PS_Private privates [T1_MAX_MM_DESIGNS + 1]; + + FT_ULong blend_bitflags; + + FT_BBox* bboxes [T1_MAX_MM_DESIGNS + 1]; + + /* since 2.3.0 */ + + /* undocumented, optional: the default design instance; */ + /* corresponds to default_weight_vector -- */ + /* num_default_design_vector == 0 means it is not present */ + /* in the font and associated metrics files */ + FT_UInt default_design_vector[T1_MAX_MM_DESIGNS]; + FT_UInt num_default_design_vector; + + } PS_BlendRec, *PS_Blend; + + + /* backwards-compatible definition */ + typedef PS_BlendRec T1_Blend; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* CID_FaceDictRec */ + /* */ + /* <Description> */ + /* A structure used to represent data in a CID top-level dictionary. */ + /* */ + typedef struct CID_FaceDictRec_ + { + PS_PrivateRec private_dict; + + FT_UInt len_buildchar; + FT_Fixed forcebold_threshold; + FT_Pos stroke_width; + FT_Fixed expansion_factor; + + FT_Byte paint_type; + FT_Byte font_type; + FT_Matrix font_matrix; + FT_Vector font_offset; + + FT_UInt num_subrs; + FT_ULong subrmap_offset; + FT_Int sd_bytes; + + } CID_FaceDictRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* CID_FaceDict */ + /* */ + /* <Description> */ + /* A handle to a @CID_FaceDictRec structure. */ + /* */ + typedef struct CID_FaceDictRec_* CID_FaceDict; + + /* */ + + + /* backwards-compatible definition */ + typedef CID_FaceDictRec CID_FontDict; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* CID_FaceInfoRec */ + /* */ + /* <Description> */ + /* A structure used to represent CID Face information. */ + /* */ + typedef struct CID_FaceInfoRec_ + { + FT_String* cid_font_name; + FT_Fixed cid_version; + FT_Int cid_font_type; + + FT_String* registry; + FT_String* ordering; + FT_Int supplement; + + PS_FontInfoRec font_info; + FT_BBox font_bbox; + FT_ULong uid_base; + + FT_Int num_xuid; + FT_ULong xuid[16]; + + FT_ULong cidmap_offset; + FT_Int fd_bytes; + FT_Int gd_bytes; + FT_ULong cid_count; + + FT_Int num_dicts; + CID_FaceDict font_dicts; + + FT_ULong data_offset; + + } CID_FaceInfoRec; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* CID_FaceInfo */ + /* */ + /* <Description> */ + /* A handle to a @CID_FaceInfoRec structure. */ + /* */ + typedef struct CID_FaceInfoRec_* CID_FaceInfo; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* CID_Info */ + /* */ + /* <Description> */ + /* This type is equivalent to @CID_FaceInfoRec. It is deprecated but */ + /* kept to maintain source compatibility between various versions of */ + /* FreeType. */ + /* */ + typedef CID_FaceInfoRec CID_Info; + + + /************************************************************************ + * + * @function: + * FT_Has_PS_Glyph_Names + * + * @description: + * Return true if a given face provides reliable PostScript glyph + * names. This is similar to using the @FT_HAS_GLYPH_NAMES macro, + * except that certain fonts (mostly TrueType) contain incorrect + * glyph name tables. + * + * When this function returns true, the caller is sure that the glyph + * names returned by @FT_Get_Glyph_Name are reliable. + * + * @input: + * face :: + * face handle + * + * @return: + * Boolean. True if glyph names are reliable. + * + */ + FT_EXPORT( FT_Int ) + FT_Has_PS_Glyph_Names( FT_Face face ); + + + /************************************************************************ + * + * @function: + * FT_Get_PS_Font_Info + * + * @description: + * Retrieve the @PS_FontInfoRec structure corresponding to a given + * PostScript font. + * + * @input: + * face :: + * PostScript face handle. + * + * @output: + * afont_info :: + * Output font info structure pointer. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * The string pointers within the font info structure are owned by + * the face and don't need to be freed by the caller. + * + * If the font's format is not PostScript-based, this function will + * return the `FT_Err_Invalid_Argument' error code. + * + */ + FT_EXPORT( FT_Error ) + FT_Get_PS_Font_Info( FT_Face face, + PS_FontInfo afont_info ); + + + /************************************************************************ + * + * @function: + * FT_Get_PS_Font_Private + * + * @description: + * Retrieve the @PS_PrivateRec structure corresponding to a given + * PostScript font. + * + * @input: + * face :: + * PostScript face handle. + * + * @output: + * afont_private :: + * Output private dictionary structure pointer. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * The string pointers within the font info structure are owned by + * the face and don't need to be freed by the caller. + * + * If the font's format is not PostScript-based, this function will + * return the `FT_Err_Invalid_Argument' error code. + * + */ + FT_EXPORT( FT_Error ) + FT_Get_PS_Font_Private( FT_Face face, + PS_Private afont_private ); + + /* */ + + +FT_END_HEADER + +#endif /* __T1TABLES_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ttnameid.h b/portlibs/include/freetype/ttnameid.h new file mode 100644 index 00000000..cbeac78d --- /dev/null +++ b/portlibs/include/freetype/ttnameid.h @@ -0,0 +1,1247 @@ +/***************************************************************************/ +/* */ +/* ttnameid.h */ +/* */ +/* TrueType name ID definitions (specification only). */ +/* */ +/* Copyright 1996-2002, 2003, 2004, 2006, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __TTNAMEID_H__ +#define __TTNAMEID_H__ + + +#include <ft2build.h> + + +FT_BEGIN_HEADER + + + /*************************************************************************/ + /* */ + /* <Section> */ + /* truetype_tables */ + /* */ + + + /*************************************************************************/ + /* */ + /* Possible values for the `platform' identifier code in the name */ + /* records of the TTF `name' table. */ + /* */ + /*************************************************************************/ + + + /*********************************************************************** + * + * @enum: + * TT_PLATFORM_XXX + * + * @description: + * A list of valid values for the `platform_id' identifier code in + * @FT_CharMapRec and @FT_SfntName structures. + * + * @values: + * TT_PLATFORM_APPLE_UNICODE :: + * Used by Apple to indicate a Unicode character map and/or name entry. + * See @TT_APPLE_ID_XXX for corresponding `encoding_id' values. Note + * that name entries in this format are coded as big-endian UCS-2 + * character codes _only_. + * + * TT_PLATFORM_MACINTOSH :: + * Used by Apple to indicate a MacOS-specific charmap and/or name entry. + * See @TT_MAC_ID_XXX for corresponding `encoding_id' values. Note that + * most TrueType fonts contain an Apple roman charmap to be usable on + * MacOS systems (even if they contain a Microsoft charmap as well). + * + * TT_PLATFORM_ISO :: + * This value was used to specify Unicode charmaps. It is however + * now deprecated. See @TT_ISO_ID_XXX for a list of corresponding + * `encoding_id' values. + * + * TT_PLATFORM_MICROSOFT :: + * Used by Microsoft to indicate Windows-specific charmaps. See + * @TT_MS_ID_XXX for a list of corresponding `encoding_id' values. + * Note that most fonts contain a Unicode charmap using + * (TT_PLATFORM_MICROSOFT, @TT_MS_ID_UNICODE_CS). + * + * TT_PLATFORM_CUSTOM :: + * Used to indicate application-specific charmaps. + * + * TT_PLATFORM_ADOBE :: + * This value isn't part of any font format specification, but is used + * by FreeType to report Adobe-specific charmaps in an @FT_CharMapRec + * structure. See @TT_ADOBE_ID_XXX. + */ + +#define TT_PLATFORM_APPLE_UNICODE 0 +#define TT_PLATFORM_MACINTOSH 1 +#define TT_PLATFORM_ISO 2 /* deprecated */ +#define TT_PLATFORM_MICROSOFT 3 +#define TT_PLATFORM_CUSTOM 4 +#define TT_PLATFORM_ADOBE 7 /* artificial */ + + + /*********************************************************************** + * + * @enum: + * TT_APPLE_ID_XXX + * + * @description: + * A list of valid values for the `encoding_id' for + * @TT_PLATFORM_APPLE_UNICODE charmaps and name entries. + * + * @values: + * TT_APPLE_ID_DEFAULT :: + * Unicode version 1.0. + * + * TT_APPLE_ID_UNICODE_1_1 :: + * Unicode 1.1; specifies Hangul characters starting at U+34xx. + * + * TT_APPLE_ID_ISO_10646 :: + * Deprecated (identical to preceding). + * + * TT_APPLE_ID_UNICODE_2_0 :: + * Unicode 2.0 and beyond (UTF-16 BMP only). + * + * TT_APPLE_ID_UNICODE_32 :: + * Unicode 3.1 and beyond, using UTF-32. + * + * TT_APPLE_ID_VARIANT_SELECTOR :: + * From Adobe, not Apple. Not a normal cmap. Specifies variations + * on a real cmap. + */ + +#define TT_APPLE_ID_DEFAULT 0 /* Unicode 1.0 */ +#define TT_APPLE_ID_UNICODE_1_1 1 /* specify Hangul at U+34xx */ +#define TT_APPLE_ID_ISO_10646 2 /* deprecated */ +#define TT_APPLE_ID_UNICODE_2_0 3 /* or later */ +#define TT_APPLE_ID_UNICODE_32 4 /* 2.0 or later, full repertoire */ +#define TT_APPLE_ID_VARIANT_SELECTOR 5 /* variation selector data */ + + + /*********************************************************************** + * + * @enum: + * TT_MAC_ID_XXX + * + * @description: + * A list of valid values for the `encoding_id' for + * @TT_PLATFORM_MACINTOSH charmaps and name entries. + * + * @values: + * TT_MAC_ID_ROMAN :: + * TT_MAC_ID_JAPANESE :: + * TT_MAC_ID_TRADITIONAL_CHINESE :: + * TT_MAC_ID_KOREAN :: + * TT_MAC_ID_ARABIC :: + * TT_MAC_ID_HEBREW :: + * TT_MAC_ID_GREEK :: + * TT_MAC_ID_RUSSIAN :: + * TT_MAC_ID_RSYMBOL :: + * TT_MAC_ID_DEVANAGARI :: + * TT_MAC_ID_GURMUKHI :: + * TT_MAC_ID_GUJARATI :: + * TT_MAC_ID_ORIYA :: + * TT_MAC_ID_BENGALI :: + * TT_MAC_ID_TAMIL :: + * TT_MAC_ID_TELUGU :: + * TT_MAC_ID_KANNADA :: + * TT_MAC_ID_MALAYALAM :: + * TT_MAC_ID_SINHALESE :: + * TT_MAC_ID_BURMESE :: + * TT_MAC_ID_KHMER :: + * TT_MAC_ID_THAI :: + * TT_MAC_ID_LAOTIAN :: + * TT_MAC_ID_GEORGIAN :: + * TT_MAC_ID_ARMENIAN :: + * TT_MAC_ID_MALDIVIAN :: + * TT_MAC_ID_SIMPLIFIED_CHINESE :: + * TT_MAC_ID_TIBETAN :: + * TT_MAC_ID_MONGOLIAN :: + * TT_MAC_ID_GEEZ :: + * TT_MAC_ID_SLAVIC :: + * TT_MAC_ID_VIETNAMESE :: + * TT_MAC_ID_SINDHI :: + * TT_MAC_ID_UNINTERP :: + */ + +#define TT_MAC_ID_ROMAN 0 +#define TT_MAC_ID_JAPANESE 1 +#define TT_MAC_ID_TRADITIONAL_CHINESE 2 +#define TT_MAC_ID_KOREAN 3 +#define TT_MAC_ID_ARABIC 4 +#define TT_MAC_ID_HEBREW 5 +#define TT_MAC_ID_GREEK 6 +#define TT_MAC_ID_RUSSIAN 7 +#define TT_MAC_ID_RSYMBOL 8 +#define TT_MAC_ID_DEVANAGARI 9 +#define TT_MAC_ID_GURMUKHI 10 +#define TT_MAC_ID_GUJARATI 11 +#define TT_MAC_ID_ORIYA 12 +#define TT_MAC_ID_BENGALI 13 +#define TT_MAC_ID_TAMIL 14 +#define TT_MAC_ID_TELUGU 15 +#define TT_MAC_ID_KANNADA 16 +#define TT_MAC_ID_MALAYALAM 17 +#define TT_MAC_ID_SINHALESE 18 +#define TT_MAC_ID_BURMESE 19 +#define TT_MAC_ID_KHMER 20 +#define TT_MAC_ID_THAI 21 +#define TT_MAC_ID_LAOTIAN 22 +#define TT_MAC_ID_GEORGIAN 23 +#define TT_MAC_ID_ARMENIAN 24 +#define TT_MAC_ID_MALDIVIAN 25 +#define TT_MAC_ID_SIMPLIFIED_CHINESE 25 +#define TT_MAC_ID_TIBETAN 26 +#define TT_MAC_ID_MONGOLIAN 27 +#define TT_MAC_ID_GEEZ 28 +#define TT_MAC_ID_SLAVIC 29 +#define TT_MAC_ID_VIETNAMESE 30 +#define TT_MAC_ID_SINDHI 31 +#define TT_MAC_ID_UNINTERP 32 + + + /*********************************************************************** + * + * @enum: + * TT_ISO_ID_XXX + * + * @description: + * A list of valid values for the `encoding_id' for + * @TT_PLATFORM_ISO charmaps and name entries. + * + * Their use is now deprecated. + * + * @values: + * TT_ISO_ID_7BIT_ASCII :: + * ASCII. + * TT_ISO_ID_10646 :: + * ISO/10646. + * TT_ISO_ID_8859_1 :: + * Also known as Latin-1. + */ + +#define TT_ISO_ID_7BIT_ASCII 0 +#define TT_ISO_ID_10646 1 +#define TT_ISO_ID_8859_1 2 + + + /*********************************************************************** + * + * @enum: + * TT_MS_ID_XXX + * + * @description: + * A list of valid values for the `encoding_id' for + * @TT_PLATFORM_MICROSOFT charmaps and name entries. + * + * @values: + * TT_MS_ID_SYMBOL_CS :: + * Corresponds to Microsoft symbol encoding. See + * @FT_ENCODING_MS_SYMBOL. + * + * TT_MS_ID_UNICODE_CS :: + * Corresponds to a Microsoft WGL4 charmap, matching Unicode. See + * @FT_ENCODING_UNICODE. + * + * TT_MS_ID_SJIS :: + * Corresponds to SJIS Japanese encoding. See @FT_ENCODING_SJIS. + * + * TT_MS_ID_GB2312 :: + * Corresponds to Simplified Chinese as used in Mainland China. See + * @FT_ENCODING_GB2312. + * + * TT_MS_ID_BIG_5 :: + * Corresponds to Traditional Chinese as used in Taiwan and Hong Kong. + * See @FT_ENCODING_BIG5. + * + * TT_MS_ID_WANSUNG :: + * Corresponds to Korean Wansung encoding. See @FT_ENCODING_WANSUNG. + * + * TT_MS_ID_JOHAB :: + * Corresponds to Johab encoding. See @FT_ENCODING_JOHAB. + * + * TT_MS_ID_UCS_4 :: + * Corresponds to UCS-4 or UTF-32 charmaps. This has been added to + * the OpenType specification version 1.4 (mid-2001.) + */ + +#define TT_MS_ID_SYMBOL_CS 0 +#define TT_MS_ID_UNICODE_CS 1 +#define TT_MS_ID_SJIS 2 +#define TT_MS_ID_GB2312 3 +#define TT_MS_ID_BIG_5 4 +#define TT_MS_ID_WANSUNG 5 +#define TT_MS_ID_JOHAB 6 +#define TT_MS_ID_UCS_4 10 + + + /*********************************************************************** + * + * @enum: + * TT_ADOBE_ID_XXX + * + * @description: + * A list of valid values for the `encoding_id' for + * @TT_PLATFORM_ADOBE charmaps. This is a FreeType-specific extension! + * + * @values: + * TT_ADOBE_ID_STANDARD :: + * Adobe standard encoding. + * TT_ADOBE_ID_EXPERT :: + * Adobe expert encoding. + * TT_ADOBE_ID_CUSTOM :: + * Adobe custom encoding. + * TT_ADOBE_ID_LATIN_1 :: + * Adobe Latin~1 encoding. + */ + +#define TT_ADOBE_ID_STANDARD 0 +#define TT_ADOBE_ID_EXPERT 1 +#define TT_ADOBE_ID_CUSTOM 2 +#define TT_ADOBE_ID_LATIN_1 3 + + + /*************************************************************************/ + /* */ + /* Possible values of the language identifier field in the name records */ + /* of the TTF `name' table if the `platform' identifier code is */ + /* TT_PLATFORM_MACINTOSH. */ + /* */ + /* The canonical source for the Apple assigned Language ID's is at */ + /* */ + /* http://fonts.apple.com/TTRefMan/RM06/Chap6name.html */ + /* */ +#define TT_MAC_LANGID_ENGLISH 0 +#define TT_MAC_LANGID_FRENCH 1 +#define TT_MAC_LANGID_GERMAN 2 +#define TT_MAC_LANGID_ITALIAN 3 +#define TT_MAC_LANGID_DUTCH 4 +#define TT_MAC_LANGID_SWEDISH 5 +#define TT_MAC_LANGID_SPANISH 6 +#define TT_MAC_LANGID_DANISH 7 +#define TT_MAC_LANGID_PORTUGUESE 8 +#define TT_MAC_LANGID_NORWEGIAN 9 +#define TT_MAC_LANGID_HEBREW 10 +#define TT_MAC_LANGID_JAPANESE 11 +#define TT_MAC_LANGID_ARABIC 12 +#define TT_MAC_LANGID_FINNISH 13 +#define TT_MAC_LANGID_GREEK 14 +#define TT_MAC_LANGID_ICELANDIC 15 +#define TT_MAC_LANGID_MALTESE 16 +#define TT_MAC_LANGID_TURKISH 17 +#define TT_MAC_LANGID_CROATIAN 18 +#define TT_MAC_LANGID_CHINESE_TRADITIONAL 19 +#define TT_MAC_LANGID_URDU 20 +#define TT_MAC_LANGID_HINDI 21 +#define TT_MAC_LANGID_THAI 22 +#define TT_MAC_LANGID_KOREAN 23 +#define TT_MAC_LANGID_LITHUANIAN 24 +#define TT_MAC_LANGID_POLISH 25 +#define TT_MAC_LANGID_HUNGARIAN 26 +#define TT_MAC_LANGID_ESTONIAN 27 +#define TT_MAC_LANGID_LETTISH 28 +#define TT_MAC_LANGID_SAAMISK 29 +#define TT_MAC_LANGID_FAEROESE 30 +#define TT_MAC_LANGID_FARSI 31 +#define TT_MAC_LANGID_RUSSIAN 32 +#define TT_MAC_LANGID_CHINESE_SIMPLIFIED 33 +#define TT_MAC_LANGID_FLEMISH 34 +#define TT_MAC_LANGID_IRISH 35 +#define TT_MAC_LANGID_ALBANIAN 36 +#define TT_MAC_LANGID_ROMANIAN 37 +#define TT_MAC_LANGID_CZECH 38 +#define TT_MAC_LANGID_SLOVAK 39 +#define TT_MAC_LANGID_SLOVENIAN 40 +#define TT_MAC_LANGID_YIDDISH 41 +#define TT_MAC_LANGID_SERBIAN 42 +#define TT_MAC_LANGID_MACEDONIAN 43 +#define TT_MAC_LANGID_BULGARIAN 44 +#define TT_MAC_LANGID_UKRAINIAN 45 +#define TT_MAC_LANGID_BYELORUSSIAN 46 +#define TT_MAC_LANGID_UZBEK 47 +#define TT_MAC_LANGID_KAZAKH 48 +#define TT_MAC_LANGID_AZERBAIJANI 49 +#define TT_MAC_LANGID_AZERBAIJANI_CYRILLIC_SCRIPT 49 +#define TT_MAC_LANGID_AZERBAIJANI_ARABIC_SCRIPT 50 +#define TT_MAC_LANGID_ARMENIAN 51 +#define TT_MAC_LANGID_GEORGIAN 52 +#define TT_MAC_LANGID_MOLDAVIAN 53 +#define TT_MAC_LANGID_KIRGHIZ 54 +#define TT_MAC_LANGID_TAJIKI 55 +#define TT_MAC_LANGID_TURKMEN 56 +#define TT_MAC_LANGID_MONGOLIAN 57 +#define TT_MAC_LANGID_MONGOLIAN_MONGOLIAN_SCRIPT 57 +#define TT_MAC_LANGID_MONGOLIAN_CYRILLIC_SCRIPT 58 +#define TT_MAC_LANGID_PASHTO 59 +#define TT_MAC_LANGID_KURDISH 60 +#define TT_MAC_LANGID_KASHMIRI 61 +#define TT_MAC_LANGID_SINDHI 62 +#define TT_MAC_LANGID_TIBETAN 63 +#define TT_MAC_LANGID_NEPALI 64 +#define TT_MAC_LANGID_SANSKRIT 65 +#define TT_MAC_LANGID_MARATHI 66 +#define TT_MAC_LANGID_BENGALI 67 +#define TT_MAC_LANGID_ASSAMESE 68 +#define TT_MAC_LANGID_GUJARATI 69 +#define TT_MAC_LANGID_PUNJABI 70 +#define TT_MAC_LANGID_ORIYA 71 +#define TT_MAC_LANGID_MALAYALAM 72 +#define TT_MAC_LANGID_KANNADA 73 +#define TT_MAC_LANGID_TAMIL 74 +#define TT_MAC_LANGID_TELUGU 75 +#define TT_MAC_LANGID_SINHALESE 76 +#define TT_MAC_LANGID_BURMESE 77 +#define TT_MAC_LANGID_KHMER 78 +#define TT_MAC_LANGID_LAO 79 +#define TT_MAC_LANGID_VIETNAMESE 80 +#define TT_MAC_LANGID_INDONESIAN 81 +#define TT_MAC_LANGID_TAGALOG 82 +#define TT_MAC_LANGID_MALAY_ROMAN_SCRIPT 83 +#define TT_MAC_LANGID_MALAY_ARABIC_SCRIPT 84 +#define TT_MAC_LANGID_AMHARIC 85 +#define TT_MAC_LANGID_TIGRINYA 86 +#define TT_MAC_LANGID_GALLA 87 +#define TT_MAC_LANGID_SOMALI 88 +#define TT_MAC_LANGID_SWAHILI 89 +#define TT_MAC_LANGID_RUANDA 90 +#define TT_MAC_LANGID_RUNDI 91 +#define TT_MAC_LANGID_CHEWA 92 +#define TT_MAC_LANGID_MALAGASY 93 +#define TT_MAC_LANGID_ESPERANTO 94 +#define TT_MAC_LANGID_WELSH 128 +#define TT_MAC_LANGID_BASQUE 129 +#define TT_MAC_LANGID_CATALAN 130 +#define TT_MAC_LANGID_LATIN 131 +#define TT_MAC_LANGID_QUECHUA 132 +#define TT_MAC_LANGID_GUARANI 133 +#define TT_MAC_LANGID_AYMARA 134 +#define TT_MAC_LANGID_TATAR 135 +#define TT_MAC_LANGID_UIGHUR 136 +#define TT_MAC_LANGID_DZONGKHA 137 +#define TT_MAC_LANGID_JAVANESE 138 +#define TT_MAC_LANGID_SUNDANESE 139 + + +#if 0 /* these seem to be errors that have been dropped */ + +#define TT_MAC_LANGID_SCOTTISH_GAELIC 140 +#define TT_MAC_LANGID_IRISH_GAELIC 141 + +#endif + + + /* The following codes are new as of 2000-03-10 */ +#define TT_MAC_LANGID_GALICIAN 140 +#define TT_MAC_LANGID_AFRIKAANS 141 +#define TT_MAC_LANGID_BRETON 142 +#define TT_MAC_LANGID_INUKTITUT 143 +#define TT_MAC_LANGID_SCOTTISH_GAELIC 144 +#define TT_MAC_LANGID_MANX_GAELIC 145 +#define TT_MAC_LANGID_IRISH_GAELIC 146 +#define TT_MAC_LANGID_TONGAN 147 +#define TT_MAC_LANGID_GREEK_POLYTONIC 148 +#define TT_MAC_LANGID_GREELANDIC 149 +#define TT_MAC_LANGID_AZERBAIJANI_ROMAN_SCRIPT 150 + + + /*************************************************************************/ + /* */ + /* Possible values of the language identifier field in the name records */ + /* of the TTF `name' table if the `platform' identifier code is */ + /* TT_PLATFORM_MICROSOFT. */ + /* */ + /* The canonical source for the MS assigned LCID's (seems to) be at */ + /* */ + /* http://www.microsoft.com/globaldev/reference/lcid-all.mspx */ + /* */ + /* It used to be at various places, among them */ + /* */ + /* http://www.microsoft.com/typography/OTSPEC/lcid-cp.txt */ + /* http://www.microsoft.com/globaldev/reference/loclanghome.asp */ + /* http://support.microsoft.com/support/kb/articles/Q224/8/04.ASP */ + /* http://msdn.microsoft.com/library/en-us/passport25/ */ + /* NET_Passport_VBScript_Documentation/Single_Sign_In/ */ + /* Advanced_Single_Sign_In/Localization_and_LCIDs.asp */ + /* */ + /* Hopefully, it seems now that the Globaldev site prevails... */ + /* (updated by Antoine, 2004-02-17) */ + +#define TT_MS_LANGID_ARABIC_GENERAL 0x0001 +#define TT_MS_LANGID_ARABIC_SAUDI_ARABIA 0x0401 +#define TT_MS_LANGID_ARABIC_IRAQ 0x0801 +#define TT_MS_LANGID_ARABIC_EGYPT 0x0c01 +#define TT_MS_LANGID_ARABIC_LIBYA 0x1001 +#define TT_MS_LANGID_ARABIC_ALGERIA 0x1401 +#define TT_MS_LANGID_ARABIC_MOROCCO 0x1801 +#define TT_MS_LANGID_ARABIC_TUNISIA 0x1c01 +#define TT_MS_LANGID_ARABIC_OMAN 0x2001 +#define TT_MS_LANGID_ARABIC_YEMEN 0x2401 +#define TT_MS_LANGID_ARABIC_SYRIA 0x2801 +#define TT_MS_LANGID_ARABIC_JORDAN 0x2c01 +#define TT_MS_LANGID_ARABIC_LEBANON 0x3001 +#define TT_MS_LANGID_ARABIC_KUWAIT 0x3401 +#define TT_MS_LANGID_ARABIC_UAE 0x3801 +#define TT_MS_LANGID_ARABIC_BAHRAIN 0x3c01 +#define TT_MS_LANGID_ARABIC_QATAR 0x4001 +#define TT_MS_LANGID_BULGARIAN_BULGARIA 0x0402 +#define TT_MS_LANGID_CATALAN_SPAIN 0x0403 +#define TT_MS_LANGID_CHINESE_GENERAL 0x0004 +#define TT_MS_LANGID_CHINESE_TAIWAN 0x0404 +#define TT_MS_LANGID_CHINESE_PRC 0x0804 +#define TT_MS_LANGID_CHINESE_HONG_KONG 0x0c04 +#define TT_MS_LANGID_CHINESE_SINGAPORE 0x1004 + +#if 1 /* this looks like the correct value */ +#define TT_MS_LANGID_CHINESE_MACAU 0x1404 +#else /* but beware, Microsoft may change its mind... + the most recent Word reference has the following: */ +#define TT_MS_LANGID_CHINESE_MACAU TT_MS_LANGID_CHINESE_HONG_KONG +#endif + +#if 0 /* used only with .NET `cultures'; commented out */ +#define TT_MS_LANGID_CHINESE_TRADITIONAL 0x7C04 +#endif + +#define TT_MS_LANGID_CZECH_CZECH_REPUBLIC 0x0405 +#define TT_MS_LANGID_DANISH_DENMARK 0x0406 +#define TT_MS_LANGID_GERMAN_GERMANY 0x0407 +#define TT_MS_LANGID_GERMAN_SWITZERLAND 0x0807 +#define TT_MS_LANGID_GERMAN_AUSTRIA 0x0c07 +#define TT_MS_LANGID_GERMAN_LUXEMBOURG 0x1007 +#define TT_MS_LANGID_GERMAN_LIECHTENSTEI 0x1407 +#define TT_MS_LANGID_GREEK_GREECE 0x0408 + + /* don't ask what this one means... It is commented out currently. */ +#if 0 +#define TT_MS_LANGID_GREEK_GREECE2 0x2008 +#endif + +#define TT_MS_LANGID_ENGLISH_GENERAL 0x0009 +#define TT_MS_LANGID_ENGLISH_UNITED_STATES 0x0409 +#define TT_MS_LANGID_ENGLISH_UNITED_KINGDOM 0x0809 +#define TT_MS_LANGID_ENGLISH_AUSTRALIA 0x0c09 +#define TT_MS_LANGID_ENGLISH_CANADA 0x1009 +#define TT_MS_LANGID_ENGLISH_NEW_ZEALAND 0x1409 +#define TT_MS_LANGID_ENGLISH_IRELAND 0x1809 +#define TT_MS_LANGID_ENGLISH_SOUTH_AFRICA 0x1c09 +#define TT_MS_LANGID_ENGLISH_JAMAICA 0x2009 +#define TT_MS_LANGID_ENGLISH_CARIBBEAN 0x2409 +#define TT_MS_LANGID_ENGLISH_BELIZE 0x2809 +#define TT_MS_LANGID_ENGLISH_TRINIDAD 0x2c09 +#define TT_MS_LANGID_ENGLISH_ZIMBABWE 0x3009 +#define TT_MS_LANGID_ENGLISH_PHILIPPINES 0x3409 +#define TT_MS_LANGID_ENGLISH_INDONESIA 0x3809 +#define TT_MS_LANGID_ENGLISH_HONG_KONG 0x3c09 +#define TT_MS_LANGID_ENGLISH_INDIA 0x4009 +#define TT_MS_LANGID_ENGLISH_MALAYSIA 0x4409 +#define TT_MS_LANGID_ENGLISH_SINGAPORE 0x4809 +#define TT_MS_LANGID_SPANISH_SPAIN_TRADITIONAL_SORT 0x040a +#define TT_MS_LANGID_SPANISH_MEXICO 0x080a +#define TT_MS_LANGID_SPANISH_SPAIN_INTERNATIONAL_SORT 0x0c0a +#define TT_MS_LANGID_SPANISH_GUATEMALA 0x100a +#define TT_MS_LANGID_SPANISH_COSTA_RICA 0x140a +#define TT_MS_LANGID_SPANISH_PANAMA 0x180a +#define TT_MS_LANGID_SPANISH_DOMINICAN_REPUBLIC 0x1c0a +#define TT_MS_LANGID_SPANISH_VENEZUELA 0x200a +#define TT_MS_LANGID_SPANISH_COLOMBIA 0x240a +#define TT_MS_LANGID_SPANISH_PERU 0x280a +#define TT_MS_LANGID_SPANISH_ARGENTINA 0x2c0a +#define TT_MS_LANGID_SPANISH_ECUADOR 0x300a +#define TT_MS_LANGID_SPANISH_CHILE 0x340a +#define TT_MS_LANGID_SPANISH_URUGUAY 0x380a +#define TT_MS_LANGID_SPANISH_PARAGUAY 0x3c0a +#define TT_MS_LANGID_SPANISH_BOLIVIA 0x400a +#define TT_MS_LANGID_SPANISH_EL_SALVADOR 0x440a +#define TT_MS_LANGID_SPANISH_HONDURAS 0x480a +#define TT_MS_LANGID_SPANISH_NICARAGUA 0x4c0a +#define TT_MS_LANGID_SPANISH_PUERTO_RICO 0x500a +#define TT_MS_LANGID_SPANISH_UNITED_STATES 0x540a + /* The following ID blatantly violate MS specs by using a */ + /* sublanguage > 0x1F. */ +#define TT_MS_LANGID_SPANISH_LATIN_AMERICA 0xE40aU +#define TT_MS_LANGID_FINNISH_FINLAND 0x040b +#define TT_MS_LANGID_FRENCH_FRANCE 0x040c +#define TT_MS_LANGID_FRENCH_BELGIUM 0x080c +#define TT_MS_LANGID_FRENCH_CANADA 0x0c0c +#define TT_MS_LANGID_FRENCH_SWITZERLAND 0x100c +#define TT_MS_LANGID_FRENCH_LUXEMBOURG 0x140c +#define TT_MS_LANGID_FRENCH_MONACO 0x180c +#define TT_MS_LANGID_FRENCH_WEST_INDIES 0x1c0c +#define TT_MS_LANGID_FRENCH_REUNION 0x200c +#define TT_MS_LANGID_FRENCH_CONGO 0x240c + /* which was formerly: */ +#define TT_MS_LANGID_FRENCH_ZAIRE TT_MS_LANGID_FRENCH_CONGO +#define TT_MS_LANGID_FRENCH_SENEGAL 0x280c +#define TT_MS_LANGID_FRENCH_CAMEROON 0x2c0c +#define TT_MS_LANGID_FRENCH_COTE_D_IVOIRE 0x300c +#define TT_MS_LANGID_FRENCH_MALI 0x340c +#define TT_MS_LANGID_FRENCH_MOROCCO 0x380c +#define TT_MS_LANGID_FRENCH_HAITI 0x3c0c + /* and another violation of the spec (see 0xE40aU) */ +#define TT_MS_LANGID_FRENCH_NORTH_AFRICA 0xE40cU +#define TT_MS_LANGID_HEBREW_ISRAEL 0x040d +#define TT_MS_LANGID_HUNGARIAN_HUNGARY 0x040e +#define TT_MS_LANGID_ICELANDIC_ICELAND 0x040f +#define TT_MS_LANGID_ITALIAN_ITALY 0x0410 +#define TT_MS_LANGID_ITALIAN_SWITZERLAND 0x0810 +#define TT_MS_LANGID_JAPANESE_JAPAN 0x0411 +#define TT_MS_LANGID_KOREAN_EXTENDED_WANSUNG_KOREA 0x0412 +#define TT_MS_LANGID_KOREAN_JOHAB_KOREA 0x0812 +#define TT_MS_LANGID_DUTCH_NETHERLANDS 0x0413 +#define TT_MS_LANGID_DUTCH_BELGIUM 0x0813 +#define TT_MS_LANGID_NORWEGIAN_NORWAY_BOKMAL 0x0414 +#define TT_MS_LANGID_NORWEGIAN_NORWAY_NYNORSK 0x0814 +#define TT_MS_LANGID_POLISH_POLAND 0x0415 +#define TT_MS_LANGID_PORTUGUESE_BRAZIL 0x0416 +#define TT_MS_LANGID_PORTUGUESE_PORTUGAL 0x0816 +#define TT_MS_LANGID_RHAETO_ROMANIC_SWITZERLAND 0x0417 +#define TT_MS_LANGID_ROMANIAN_ROMANIA 0x0418 +#define TT_MS_LANGID_MOLDAVIAN_MOLDAVIA 0x0818 +#define TT_MS_LANGID_RUSSIAN_RUSSIA 0x0419 +#define TT_MS_LANGID_RUSSIAN_MOLDAVIA 0x0819 +#define TT_MS_LANGID_CROATIAN_CROATIA 0x041a +#define TT_MS_LANGID_SERBIAN_SERBIA_LATIN 0x081a +#define TT_MS_LANGID_SERBIAN_SERBIA_CYRILLIC 0x0c1a + +#if 0 /* this used to be this value, but it looks like we were wrong */ +#define TT_MS_LANGID_BOSNIAN_BOSNIA_HERZEGOVINA 0x101a +#else /* current sources say */ +#define TT_MS_LANGID_CROATIAN_BOSNIA_HERZEGOVINA 0x101a +#define TT_MS_LANGID_BOSNIAN_BOSNIA_HERZEGOVINA 0x141a + /* and XPsp2 Platform SDK added (2004-07-26) */ + /* Names are shortened to be significant within 40 chars. */ +#define TT_MS_LANGID_SERBIAN_BOSNIA_HERZ_LATIN 0x181a +#define TT_MS_LANGID_SERBIAN_BOSNIA_HERZ_CYRILLIC 0x181a +#endif + +#define TT_MS_LANGID_SLOVAK_SLOVAKIA 0x041b +#define TT_MS_LANGID_ALBANIAN_ALBANIA 0x041c +#define TT_MS_LANGID_SWEDISH_SWEDEN 0x041d +#define TT_MS_LANGID_SWEDISH_FINLAND 0x081d +#define TT_MS_LANGID_THAI_THAILAND 0x041e +#define TT_MS_LANGID_TURKISH_TURKEY 0x041f +#define TT_MS_LANGID_URDU_PAKISTAN 0x0420 +#define TT_MS_LANGID_URDU_INDIA 0x0820 +#define TT_MS_LANGID_INDONESIAN_INDONESIA 0x0421 +#define TT_MS_LANGID_UKRAINIAN_UKRAINE 0x0422 +#define TT_MS_LANGID_BELARUSIAN_BELARUS 0x0423 +#define TT_MS_LANGID_SLOVENE_SLOVENIA 0x0424 +#define TT_MS_LANGID_ESTONIAN_ESTONIA 0x0425 +#define TT_MS_LANGID_LATVIAN_LATVIA 0x0426 +#define TT_MS_LANGID_LITHUANIAN_LITHUANIA 0x0427 +#define TT_MS_LANGID_CLASSIC_LITHUANIAN_LITHUANIA 0x0827 +#define TT_MS_LANGID_TAJIK_TAJIKISTAN 0x0428 +#define TT_MS_LANGID_FARSI_IRAN 0x0429 +#define TT_MS_LANGID_VIETNAMESE_VIET_NAM 0x042a +#define TT_MS_LANGID_ARMENIAN_ARMENIA 0x042b +#define TT_MS_LANGID_AZERI_AZERBAIJAN_LATIN 0x042c +#define TT_MS_LANGID_AZERI_AZERBAIJAN_CYRILLIC 0x082c +#define TT_MS_LANGID_BASQUE_SPAIN 0x042d +#define TT_MS_LANGID_SORBIAN_GERMANY 0x042e +#define TT_MS_LANGID_MACEDONIAN_MACEDONIA 0x042f +#define TT_MS_LANGID_SUTU_SOUTH_AFRICA 0x0430 +#define TT_MS_LANGID_TSONGA_SOUTH_AFRICA 0x0431 +#define TT_MS_LANGID_TSWANA_SOUTH_AFRICA 0x0432 +#define TT_MS_LANGID_VENDA_SOUTH_AFRICA 0x0433 +#define TT_MS_LANGID_XHOSA_SOUTH_AFRICA 0x0434 +#define TT_MS_LANGID_ZULU_SOUTH_AFRICA 0x0435 +#define TT_MS_LANGID_AFRIKAANS_SOUTH_AFRICA 0x0436 +#define TT_MS_LANGID_GEORGIAN_GEORGIA 0x0437 +#define TT_MS_LANGID_FAEROESE_FAEROE_ISLANDS 0x0438 +#define TT_MS_LANGID_HINDI_INDIA 0x0439 +#define TT_MS_LANGID_MALTESE_MALTA 0x043a + /* Added by XPsp2 Platform SDK (2004-07-26) */ +#define TT_MS_LANGID_SAMI_NORTHERN_NORWAY 0x043b +#define TT_MS_LANGID_SAMI_NORTHERN_SWEDEN 0x083b +#define TT_MS_LANGID_SAMI_NORTHERN_FINLAND 0x0C3b +#define TT_MS_LANGID_SAMI_LULE_NORWAY 0x103b +#define TT_MS_LANGID_SAMI_LULE_SWEDEN 0x143b +#define TT_MS_LANGID_SAMI_SOUTHERN_NORWAY 0x183b +#define TT_MS_LANGID_SAMI_SOUTHERN_SWEDEN 0x1C3b +#define TT_MS_LANGID_SAMI_SKOLT_FINLAND 0x203b +#define TT_MS_LANGID_SAMI_INARI_FINLAND 0x243b + /* ... and we also keep our old identifier... */ +#define TT_MS_LANGID_SAAMI_LAPONIA 0x043b + +#if 0 /* this seems to be a previous inversion */ +#define TT_MS_LANGID_IRISH_GAELIC_IRELAND 0x043c +#define TT_MS_LANGID_SCOTTISH_GAELIC_UNITED_KINGDOM 0x083c +#else +#define TT_MS_LANGID_SCOTTISH_GAELIC_UNITED_KINGDOM 0x083c +#define TT_MS_LANGID_IRISH_GAELIC_IRELAND 0x043c +#endif + +#define TT_MS_LANGID_YIDDISH_GERMANY 0x043d +#define TT_MS_LANGID_MALAY_MALAYSIA 0x043e +#define TT_MS_LANGID_MALAY_BRUNEI_DARUSSALAM 0x083e +#define TT_MS_LANGID_KAZAK_KAZAKSTAN 0x043f +#define TT_MS_LANGID_KIRGHIZ_KIRGHIZSTAN /* Cyrillic*/ 0x0440 + /* alias declared in Windows 2000 */ +#define TT_MS_LANGID_KIRGHIZ_KIRGHIZ_REPUBLIC \ + TT_MS_LANGID_KIRGHIZ_KIRGHIZSTAN + +#define TT_MS_LANGID_SWAHILI_KENYA 0x0441 +#define TT_MS_LANGID_TURKMEN_TURKMENISTAN 0x0442 +#define TT_MS_LANGID_UZBEK_UZBEKISTAN_LATIN 0x0443 +#define TT_MS_LANGID_UZBEK_UZBEKISTAN_CYRILLIC 0x0843 +#define TT_MS_LANGID_TATAR_TATARSTAN 0x0444 +#define TT_MS_LANGID_BENGALI_INDIA 0x0445 +#define TT_MS_LANGID_BENGALI_BANGLADESH 0x0845 +#define TT_MS_LANGID_PUNJABI_INDIA 0x0446 +#define TT_MS_LANGID_PUNJABI_ARABIC_PAKISTAN 0x0846 +#define TT_MS_LANGID_GUJARATI_INDIA 0x0447 +#define TT_MS_LANGID_ORIYA_INDIA 0x0448 +#define TT_MS_LANGID_TAMIL_INDIA 0x0449 +#define TT_MS_LANGID_TELUGU_INDIA 0x044a +#define TT_MS_LANGID_KANNADA_INDIA 0x044b +#define TT_MS_LANGID_MALAYALAM_INDIA 0x044c +#define TT_MS_LANGID_ASSAMESE_INDIA 0x044d +#define TT_MS_LANGID_MARATHI_INDIA 0x044e +#define TT_MS_LANGID_SANSKRIT_INDIA 0x044f +#define TT_MS_LANGID_MONGOLIAN_MONGOLIA /* Cyrillic */ 0x0450 +#define TT_MS_LANGID_MONGOLIAN_MONGOLIA_MONGOLIAN 0x0850 +#define TT_MS_LANGID_TIBETAN_CHINA 0x0451 + /* Don't use the next constant! It has */ + /* (1) the wrong spelling (Dzonghka) */ + /* (2) Microsoft doesn't officially define it -- */ + /* at least it is not in the List of Local */ + /* ID Values. */ + /* (3) Dzongkha is not the same language as */ + /* Tibetan, so merging it is wrong anyway. */ + /* */ + /* TT_MS_LANGID_TIBETAN_BHUTAN is correct, BTW. */ +#define TT_MS_LANGID_DZONGHKA_BHUTAN 0x0851 + +#if 0 + /* the following used to be defined */ +#define TT_MS_LANGID_TIBETAN_BHUTAN 0x0451 + /* ... but it was changed; */ +#else + /* So we will continue to #define it, but with the correct value */ +#define TT_MS_LANGID_TIBETAN_BHUTAN TT_MS_LANGID_DZONGHKA_BHUTAN +#endif + +#define TT_MS_LANGID_WELSH_WALES 0x0452 +#define TT_MS_LANGID_KHMER_CAMBODIA 0x0453 +#define TT_MS_LANGID_LAO_LAOS 0x0454 +#define TT_MS_LANGID_BURMESE_MYANMAR 0x0455 +#define TT_MS_LANGID_GALICIAN_SPAIN 0x0456 +#define TT_MS_LANGID_KONKANI_INDIA 0x0457 +#define TT_MS_LANGID_MANIPURI_INDIA /* Bengali */ 0x0458 +#define TT_MS_LANGID_SINDHI_INDIA /* Arabic */ 0x0459 +#define TT_MS_LANGID_SINDHI_PAKISTAN 0x0859 + /* Missing a LCID for Sindhi in Devanagari script */ +#define TT_MS_LANGID_SYRIAC_SYRIA 0x045a +#define TT_MS_LANGID_SINHALESE_SRI_LANKA 0x045b +#define TT_MS_LANGID_CHEROKEE_UNITED_STATES 0x045c +#define TT_MS_LANGID_INUKTITUT_CANADA 0x045d +#define TT_MS_LANGID_AMHARIC_ETHIOPIA 0x045e +#define TT_MS_LANGID_TAMAZIGHT_MOROCCO /* Arabic */ 0x045f +#define TT_MS_LANGID_TAMAZIGHT_MOROCCO_LATIN 0x085f + /* Missing a LCID for Tifinagh script */ +#define TT_MS_LANGID_KASHMIRI_PAKISTAN /* Arabic */ 0x0460 + /* Spelled this way by XPsp2 Platform SDK (2004-07-26) */ + /* script is yet unclear... might be Arabic, Nagari or Sharada */ +#define TT_MS_LANGID_KASHMIRI_SASIA 0x0860 + /* ... and aliased (by MS) for compatibility reasons. */ +#define TT_MS_LANGID_KASHMIRI_INDIA TT_MS_LANGID_KASHMIRI_SASIA +#define TT_MS_LANGID_NEPALI_NEPAL 0x0461 +#define TT_MS_LANGID_NEPALI_INDIA 0x0861 +#define TT_MS_LANGID_FRISIAN_NETHERLANDS 0x0462 +#define TT_MS_LANGID_PASHTO_AFGHANISTAN 0x0463 +#define TT_MS_LANGID_FILIPINO_PHILIPPINES 0x0464 +#define TT_MS_LANGID_DHIVEHI_MALDIVES 0x0465 + /* alias declared in Windows 2000 */ +#define TT_MS_LANGID_DIVEHI_MALDIVES TT_MS_LANGID_DHIVEHI_MALDIVES +#define TT_MS_LANGID_EDO_NIGERIA 0x0466 +#define TT_MS_LANGID_FULFULDE_NIGERIA 0x0467 +#define TT_MS_LANGID_HAUSA_NIGERIA 0x0468 +#define TT_MS_LANGID_IBIBIO_NIGERIA 0x0469 +#define TT_MS_LANGID_YORUBA_NIGERIA 0x046a +#define TT_MS_LANGID_QUECHUA_BOLIVIA 0x046b +#define TT_MS_LANGID_QUECHUA_ECUADOR 0x086b +#define TT_MS_LANGID_QUECHUA_PERU 0x0c6b +#define TT_MS_LANGID_SEPEDI_SOUTH_AFRICA 0x046c + /* Also spelled by XPsp2 Platform SDK (2004-07-26) */ +#define TT_MS_LANGID_SOTHO_SOUTHERN_SOUTH_AFRICA \ + TT_MS_LANGID_SEPEDI_SOUTH_AFRICA + /* language codes 0x046d, 0x046e and 0x046f are (still) unknown. */ +#define TT_MS_LANGID_IGBO_NIGERIA 0x0470 +#define TT_MS_LANGID_KANURI_NIGERIA 0x0471 +#define TT_MS_LANGID_OROMO_ETHIOPIA 0x0472 +#define TT_MS_LANGID_TIGRIGNA_ETHIOPIA 0x0473 +#define TT_MS_LANGID_TIGRIGNA_ERYTHREA 0x0873 + /* also spelled in the `Passport SDK' list as: */ +#define TT_MS_LANGID_TIGRIGNA_ERYTREA TT_MS_LANGID_TIGRIGNA_ERYTHREA +#define TT_MS_LANGID_GUARANI_PARAGUAY 0x0474 +#define TT_MS_LANGID_HAWAIIAN_UNITED_STATES 0x0475 +#define TT_MS_LANGID_LATIN 0x0476 +#define TT_MS_LANGID_SOMALI_SOMALIA 0x0477 + /* Note: Yi does not have a (proper) ISO 639-2 code, since it is mostly */ + /* not written (but OTOH the peculiar writing system is worth */ + /* studying). */ +#define TT_MS_LANGID_YI_CHINA 0x0478 +#define TT_MS_LANGID_PAPIAMENTU_NETHERLANDS_ANTILLES 0x0479 + /* language codes from 0x047a to 0x047f are (still) unknown. */ +#define TT_MS_LANGID_UIGHUR_CHINA 0x0480 +#define TT_MS_LANGID_MAORI_NEW_ZEALAND 0x0481 + +#if 0 /* not deemed useful for fonts */ +#define TT_MS_LANGID_HUMAN_INTERFACE_DEVICE 0x04ff +#endif + + + /*************************************************************************/ + /* */ + /* Possible values of the `name' identifier field in the name records of */ + /* the TTF `name' table. These values are platform independent. */ + /* */ +#define TT_NAME_ID_COPYRIGHT 0 +#define TT_NAME_ID_FONT_FAMILY 1 +#define TT_NAME_ID_FONT_SUBFAMILY 2 +#define TT_NAME_ID_UNIQUE_ID 3 +#define TT_NAME_ID_FULL_NAME 4 +#define TT_NAME_ID_VERSION_STRING 5 +#define TT_NAME_ID_PS_NAME 6 +#define TT_NAME_ID_TRADEMARK 7 + + /* the following values are from the OpenType spec */ +#define TT_NAME_ID_MANUFACTURER 8 +#define TT_NAME_ID_DESIGNER 9 +#define TT_NAME_ID_DESCRIPTION 10 +#define TT_NAME_ID_VENDOR_URL 11 +#define TT_NAME_ID_DESIGNER_URL 12 +#define TT_NAME_ID_LICENSE 13 +#define TT_NAME_ID_LICENSE_URL 14 + /* number 15 is reserved */ +#define TT_NAME_ID_PREFERRED_FAMILY 16 +#define TT_NAME_ID_PREFERRED_SUBFAMILY 17 +#define TT_NAME_ID_MAC_FULL_NAME 18 + + /* The following code is new as of 2000-01-21 */ +#define TT_NAME_ID_SAMPLE_TEXT 19 + + /* This is new in OpenType 1.3 */ +#define TT_NAME_ID_CID_FINDFONT_NAME 20 + + /* This is new in OpenType 1.5 */ +#define TT_NAME_ID_WWS_FAMILY 21 +#define TT_NAME_ID_WWS_SUBFAMILY 22 + + + /*************************************************************************/ + /* */ + /* Bit mask values for the Unicode Ranges from the TTF `OS2 ' table. */ + /* */ + /* Updated 08-Nov-2008. */ + /* */ + + /* Bit 0 Basic Latin */ +#define TT_UCR_BASIC_LATIN (1L << 0) /* U+0020-U+007E */ + /* Bit 1 C1 Controls and Latin-1 Supplement */ +#define TT_UCR_LATIN1_SUPPLEMENT (1L << 1) /* U+0080-U+00FF */ + /* Bit 2 Latin Extended-A */ +#define TT_UCR_LATIN_EXTENDED_A (1L << 2) /* U+0100-U+017F */ + /* Bit 3 Latin Extended-B */ +#define TT_UCR_LATIN_EXTENDED_B (1L << 3) /* U+0180-U+024F */ + /* Bit 4 IPA Extensions */ + /* Phonetic Extensions */ + /* Phonetic Extensions Supplement */ +#define TT_UCR_IPA_EXTENSIONS (1L << 4) /* U+0250-U+02AF */ + /* U+1D00-U+1D7F */ + /* U+1D80-U+1DBF */ + /* Bit 5 Spacing Modifier Letters */ + /* Modifier Tone Letters */ +#define TT_UCR_SPACING_MODIFIER (1L << 5) /* U+02B0-U+02FF */ + /* U+A700-U+A71F */ + /* Bit 6 Combining Diacritical Marks */ + /* Combining Diacritical Marks Supplement */ +#define TT_UCR_COMBINING_DIACRITICS (1L << 6) /* U+0300-U+036F */ + /* U+1DC0-U+1DFF */ + /* Bit 7 Greek and Coptic */ +#define TT_UCR_GREEK (1L << 7) /* U+0370-U+03FF */ + /* Bit 8 Coptic */ +#define TT_UCR_COPTIC (1L << 8) /* U+2C80-U+2CFF */ + /* Bit 9 Cyrillic */ + /* Cyrillic Supplement */ + /* Cyrillic Extended-A */ + /* Cyrillic Extended-B */ +#define TT_UCR_CYRILLIC (1L << 9) /* U+0400-U+04FF */ + /* U+0500-U+052F */ + /* U+2DE0-U+2DFF */ + /* U+A640-U+A69F */ + /* Bit 10 Armenian */ +#define TT_UCR_ARMENIAN (1L << 10) /* U+0530-U+058F */ + /* Bit 11 Hebrew */ +#define TT_UCR_HEBREW (1L << 11) /* U+0590-U+05FF */ + /* Bit 12 Vai */ +#define TT_UCR_VAI (1L << 12) /* U+A500-U+A63F */ + /* Bit 13 Arabic */ + /* Arabic Supplement */ +#define TT_UCR_ARABIC (1L << 13) /* U+0600-U+06FF */ + /* U+0750-U+077F */ + /* Bit 14 NKo */ +#define TT_UCR_NKO (1L << 14) /* U+07C0-U+07FF */ + /* Bit 15 Devanagari */ +#define TT_UCR_DEVANAGARI (1L << 15) /* U+0900-U+097F */ + /* Bit 16 Bengali */ +#define TT_UCR_BENGALI (1L << 16) /* U+0980-U+09FF */ + /* Bit 17 Gurmukhi */ +#define TT_UCR_GURMUKHI (1L << 17) /* U+0A00-U+0A7F */ + /* Bit 18 Gujarati */ +#define TT_UCR_GUJARATI (1L << 18) /* U+0A80-U+0AFF */ + /* Bit 19 Oriya */ +#define TT_UCR_ORIYA (1L << 19) /* U+0B00-U+0B7F */ + /* Bit 20 Tamil */ +#define TT_UCR_TAMIL (1L << 20) /* U+0B80-U+0BFF */ + /* Bit 21 Telugu */ +#define TT_UCR_TELUGU (1L << 21) /* U+0C00-U+0C7F */ + /* Bit 22 Kannada */ +#define TT_UCR_KANNADA (1L << 22) /* U+0C80-U+0CFF */ + /* Bit 23 Malayalam */ +#define TT_UCR_MALAYALAM (1L << 23) /* U+0D00-U+0D7F */ + /* Bit 24 Thai */ +#define TT_UCR_THAI (1L << 24) /* U+0E00-U+0E7F */ + /* Bit 25 Lao */ +#define TT_UCR_LAO (1L << 25) /* U+0E80-U+0EFF */ + /* Bit 26 Georgian */ + /* Georgian Supplement */ +#define TT_UCR_GEORGIAN (1L << 26) /* U+10A0-U+10FF */ + /* U+2D00-U+2D2F */ + /* Bit 27 Balinese */ +#define TT_UCR_BALINESE (1L << 27) /* U+1B00-U+1B7F */ + /* Bit 28 Hangul Jamo */ +#define TT_UCR_HANGUL_JAMO (1L << 28) /* U+1100-U+11FF */ + /* Bit 29 Latin Extended Additional */ + /* Latin Extended-C */ + /* Latin Extended-D */ +#define TT_UCR_LATIN_EXTENDED_ADDITIONAL (1L << 29) /* U+1E00-U+1EFF */ + /* U+2C60-U+2C7F */ + /* U+A720-U+A7FF */ + /* Bit 30 Greek Extended */ +#define TT_UCR_GREEK_EXTENDED (1L << 30) /* U+1F00-U+1FFF */ + /* Bit 31 General Punctuation */ + /* Supplemental Punctuation */ +#define TT_UCR_GENERAL_PUNCTUATION (1L << 31) /* U+2000-U+206F */ + /* U+2E00-U+2E7F */ + /* Bit 32 Superscripts And Subscripts */ +#define TT_UCR_SUPERSCRIPTS_SUBSCRIPTS (1L << 0) /* U+2070-U+209F */ + /* Bit 33 Currency Symbols */ +#define TT_UCR_CURRENCY_SYMBOLS (1L << 1) /* U+20A0-U+20CF */ + /* Bit 34 Combining Diacritical Marks For Symbols */ +#define TT_UCR_COMBINING_DIACRITICS_SYMB (1L << 2) /* U+20D0-U+20FF */ + /* Bit 35 Letterlike Symbols */ +#define TT_UCR_LETTERLIKE_SYMBOLS (1L << 3) /* U+2100-U+214F */ + /* Bit 36 Number Forms */ +#define TT_UCR_NUMBER_FORMS (1L << 4) /* U+2150-U+218F */ + /* Bit 37 Arrows */ + /* Supplemental Arrows-A */ + /* Supplemental Arrows-B */ + /* Miscellaneous Symbols and Arrows */ +#define TT_UCR_ARROWS (1L << 5) /* U+2190-U+21FF */ + /* U+27F0-U+27FF */ + /* U+2900-U+297F */ + /* U+2B00-U+2BFF */ + /* Bit 38 Mathematical Operators */ + /* Supplemental Mathematical Operators */ + /* Miscellaneous Mathematical Symbols-A */ + /* Miscellaneous Mathematical Symbols-B */ +#define TT_UCR_MATHEMATICAL_OPERATORS (1L << 6) /* U+2200-U+22FF */ + /* U+2A00-U+2AFF */ + /* U+27C0-U+27EF */ + /* U+2980-U+29FF */ + /* Bit 39 Miscellaneous Technical */ +#define TT_UCR_MISCELLANEOUS_TECHNICAL (1L << 7) /* U+2300-U+23FF */ + /* Bit 40 Control Pictures */ +#define TT_UCR_CONTROL_PICTURES (1L << 8) /* U+2400-U+243F */ + /* Bit 41 Optical Character Recognition */ +#define TT_UCR_OCR (1L << 9) /* U+2440-U+245F */ + /* Bit 42 Enclosed Alphanumerics */ +#define TT_UCR_ENCLOSED_ALPHANUMERICS (1L << 10) /* U+2460-U+24FF */ + /* Bit 43 Box Drawing */ +#define TT_UCR_BOX_DRAWING (1L << 11) /* U+2500-U+257F */ + /* Bit 44 Block Elements */ +#define TT_UCR_BLOCK_ELEMENTS (1L << 12) /* U+2580-U+259F */ + /* Bit 45 Geometric Shapes */ +#define TT_UCR_GEOMETRIC_SHAPES (1L << 13) /* U+25A0-U+25FF */ + /* Bit 46 Miscellaneous Symbols */ +#define TT_UCR_MISCELLANEOUS_SYMBOLS (1L << 14) /* U+2600-U+26FF */ + /* Bit 47 Dingbats */ +#define TT_UCR_DINGBATS (1L << 15) /* U+2700-U+27BF */ + /* Bit 48 CJK Symbols and Punctuation */ +#define TT_UCR_CJK_SYMBOLS (1L << 16) /* U+3000-U+303F */ + /* Bit 49 Hiragana */ +#define TT_UCR_HIRAGANA (1L << 17) /* U+3040-U+309F */ + /* Bit 50 Katakana */ + /* Katakana Phonetic Extensions */ +#define TT_UCR_KATAKANA (1L << 18) /* U+30A0-U+30FF */ + /* U+31F0-U+31FF */ + /* Bit 51 Bopomofo */ + /* Bopomofo Extended */ +#define TT_UCR_BOPOMOFO (1L << 19) /* U+3100-U+312F */ + /* U+31A0-U+31BF */ + /* Bit 52 Hangul Compatibility Jamo */ +#define TT_UCR_HANGUL_COMPATIBILITY_JAMO (1L << 20) /* U+3130-U+318F */ + /* Bit 53 Phags-Pa */ +#define TT_UCR_CJK_MISC (1L << 21) /* U+A840-U+A87F */ +#define TT_UCR_KANBUN TT_UCR_CJK_MISC /* deprecated */ +#define TT_UCR_PHAGSPA + /* Bit 54 Enclosed CJK Letters and Months */ +#define TT_UCR_ENCLOSED_CJK_LETTERS_MONTHS (1L << 22) /* U+3200-U+32FF */ + /* Bit 55 CJK Compatibility */ +#define TT_UCR_CJK_COMPATIBILITY (1L << 23) /* U+3300-U+33FF */ + /* Bit 56 Hangul Syllables */ +#define TT_UCR_HANGUL (1L << 24) /* U+AC00-U+D7A3 */ + /* Bit 57 High Surrogates */ + /* High Private Use Surrogates */ + /* Low Surrogates */ + /* */ + /* According to OpenType specs v.1.3+, */ + /* setting bit 57 implies that there is */ + /* at least one codepoint beyond the */ + /* Basic Multilingual Plane that is */ + /* supported by this font. So it really */ + /* means >= U+10000 */ +#define TT_UCR_SURROGATES (1L << 25) /* U+D800-U+DB7F */ + /* U+DB80-U+DBFF */ + /* U+DC00-U+DFFF */ +#define TT_UCR_NON_PLANE_0 TT_UCR_SURROGATES + /* Bit 58 Phoenician */ +#define TT_UCR_PHOENICIAN (1L << 26) /*U+10900-U+1091F*/ + /* Bit 59 CJK Unified Ideographs */ + /* CJK Radicals Supplement */ + /* Kangxi Radicals */ + /* Ideographic Description Characters */ + /* CJK Unified Ideographs Extension A */ + /* CJK Unified Ideographs Extension B */ + /* Kanbun */ +#define TT_UCR_CJK_UNIFIED_IDEOGRAPHS (1L << 27) /* U+4E00-U+9FFF */ + /* U+2E80-U+2EFF */ + /* U+2F00-U+2FDF */ + /* U+2FF0-U+2FFF */ + /* U+3400-U+4DB5 */ + /*U+20000-U+2A6DF*/ + /* U+3190-U+319F */ + /* Bit 60 Private Use */ +#define TT_UCR_PRIVATE_USE (1L << 28) /* U+E000-U+F8FF */ + /* Bit 61 CJK Strokes */ + /* CJK Compatibility Ideographs */ + /* CJK Compatibility Ideographs Supplement */ +#define TT_UCR_CJK_COMPATIBILITY_IDEOGRAPHS (1L << 29) /* U+31C0-U+31EF */ + /* U+F900-U+FAFF */ + /*U+2F800-U+2FA1F*/ + /* Bit 62 Alphabetic Presentation Forms */ +#define TT_UCR_ALPHABETIC_PRESENTATION_FORMS (1L << 30) /* U+FB00-U+FB4F */ + /* Bit 63 Arabic Presentation Forms-A */ +#define TT_UCR_ARABIC_PRESENTATIONS_A (1L << 31) /* U+FB50-U+FDFF */ + /* Bit 64 Combining Half Marks */ +#define TT_UCR_COMBINING_HALF_MARKS (1L << 0) /* U+FE20-U+FE2F */ + /* Bit 65 Vertical forms */ + /* CJK Compatibility Forms */ +#define TT_UCR_CJK_COMPATIBILITY_FORMS (1L << 1) /* U+FE10-U+FE1F */ + /* U+FE30-U+FE4F */ + /* Bit 66 Small Form Variants */ +#define TT_UCR_SMALL_FORM_VARIANTS (1L << 2) /* U+FE50-U+FE6F */ + /* Bit 67 Arabic Presentation Forms-B */ +#define TT_UCR_ARABIC_PRESENTATIONS_B (1L << 3) /* U+FE70-U+FEFE */ + /* Bit 68 Halfwidth and Fullwidth Forms */ +#define TT_UCR_HALFWIDTH_FULLWIDTH_FORMS (1L << 4) /* U+FF00-U+FFEF */ + /* Bit 69 Specials */ +#define TT_UCR_SPECIALS (1L << 5) /* U+FFF0-U+FFFD */ + /* Bit 70 Tibetan */ +#define TT_UCR_TIBETAN (1L << 6) /* U+0F00-U+0FFF */ + /* Bit 71 Syriac */ +#define TT_UCR_SYRIAC (1L << 7) /* U+0700-U+074F */ + /* Bit 72 Thaana */ +#define TT_UCR_THAANA (1L << 8) /* U+0780-U+07BF */ + /* Bit 73 Sinhala */ +#define TT_UCR_SINHALA (1L << 9) /* U+0D80-U+0DFF */ + /* Bit 74 Myanmar */ +#define TT_UCR_MYANMAR (1L << 10) /* U+1000-U+109F */ + /* Bit 75 Ethiopic */ + /* Ethiopic Supplement */ + /* Ethiopic Extended */ +#define TT_UCR_ETHIOPIC (1L << 11) /* U+1200-U+137F */ + /* U+1380-U+139F */ + /* U+2D80-U+2DDF */ + /* Bit 76 Cherokee */ +#define TT_UCR_CHEROKEE (1L << 12) /* U+13A0-U+13FF */ + /* Bit 77 Unified Canadian Aboriginal Syllabics */ +#define TT_UCR_CANADIAN_ABORIGINAL_SYLLABICS (1L << 13) /* U+1400-U+167F */ + /* Bit 78 Ogham */ +#define TT_UCR_OGHAM (1L << 14) /* U+1680-U+169F */ + /* Bit 79 Runic */ +#define TT_UCR_RUNIC (1L << 15) /* U+16A0-U+16FF */ + /* Bit 80 Khmer */ + /* Khmer Symbols */ +#define TT_UCR_KHMER (1L << 16) /* U+1780-U+17FF */ + /* U+19E0-U+19FF */ + /* Bit 81 Mongolian */ +#define TT_UCR_MONGOLIAN (1L << 17) /* U+1800-U+18AF */ + /* Bit 82 Braille Patterns */ +#define TT_UCR_BRAILLE (1L << 18) /* U+2800-U+28FF */ + /* Bit 83 Yi Syllables */ + /* Yi Radicals */ +#define TT_UCR_YI (1L << 19) /* U+A000-U+A48F */ + /* U+A490-U+A4CF */ + /* Bit 84 Tagalog */ + /* Hanunoo */ + /* Buhid */ + /* Tagbanwa */ +#define TT_UCR_PHILIPPINE (1L << 20) /* U+1700-U+171F */ + /* U+1720-U+173F */ + /* U+1740-U+175F */ + /* U+1760-U+177F */ + /* Bit 85 Old Italic */ +#define TT_UCR_OLD_ITALIC (1L << 21) /*U+10300-U+1032F*/ + /* Bit 86 Gothic */ +#define TT_UCR_GOTHIC (1L << 22) /*U+10330-U+1034F*/ + /* Bit 87 Deseret */ +#define TT_UCR_DESERET (1L << 23) /*U+10400-U+1044F*/ + /* Bit 88 Byzantine Musical Symbols */ + /* Musical Symbols */ + /* Ancient Greek Musical Notation */ +#define TT_UCR_MUSICAL_SYMBOLS (1L << 24) /*U+1D000-U+1D0FF*/ + /*U+1D100-U+1D1FF*/ + /*U+1D200-U+1D24F*/ + /* Bit 89 Mathematical Alphanumeric Symbols */ +#define TT_UCR_MATH_ALPHANUMERIC_SYMBOLS (1L << 25) /*U+1D400-U+1D7FF*/ + /* Bit 90 Private Use (plane 15) */ + /* Private Use (plane 16) */ +#define TT_UCR_PRIVATE_USE_SUPPLEMENTARY (1L << 26) /*U+F0000-U+FFFFD*/ + /*U+100000-U+10FFFD*/ + /* Bit 91 Variation Selectors */ + /* Variation Selectors Supplement */ +#define TT_UCR_VARIATION_SELECTORS (1L << 27) /* U+FE00-U+FE0F */ + /*U+E0100-U+E01EF*/ + /* Bit 92 Tags */ +#define TT_UCR_TAGS (1L << 28) /*U+E0000-U+E007F*/ + /* Bit 93 Limbu */ +#define TT_UCR_LIMBU (1L << 29) /* U+1900-U+194F */ + /* Bit 94 Tai Le */ +#define TT_UCR_TAI_LE (1L << 30) /* U+1950-U+197F */ + /* Bit 95 New Tai Lue */ +#define TT_UCR_NEW_TAI_LUE (1L << 31) /* U+1980-U+19DF */ + /* Bit 96 Buginese */ +#define TT_UCR_BUGINESE (1L << 0) /* U+1A00-U+1A1F */ + /* Bit 97 Glagolitic */ +#define TT_UCR_GLAGOLITIC (1L << 1) /* U+2C00-U+2C5F */ + /* Bit 98 Tifinagh */ +#define TT_UCR_TIFINAGH (1L << 2) /* U+2D30-U+2D7F */ + /* Bit 99 Yijing Hexagram Symbols */ +#define TT_UCR_YIJING (1L << 3) /* U+4DC0-U+4DFF */ + /* Bit 100 Syloti Nagri */ +#define TT_UCR_SYLOTI_NAGRI (1L << 4) /* U+A800-U+A82F */ + /* Bit 101 Linear B Syllabary */ + /* Linear B Ideograms */ + /* Aegean Numbers */ +#define TT_UCR_LINEAR_B (1L << 5) /*U+10000-U+1007F*/ + /*U+10080-U+100FF*/ + /*U+10100-U+1013F*/ + /* Bit 102 Ancient Greek Numbers */ +#define TT_UCR_ANCIENT_GREEK_NUMBERS (1L << 6) /*U+10140-U+1018F*/ + /* Bit 103 Ugaritic */ +#define TT_UCR_UGARITIC (1L << 7) /*U+10380-U+1039F*/ + /* Bit 104 Old Persian */ +#define TT_UCR_OLD_PERSIAN (1L << 8) /*U+103A0-U+103DF*/ + /* Bit 105 Shavian */ +#define TT_UCR_SHAVIAN (1L << 9) /*U+10450-U+1047F*/ + /* Bit 106 Osmanya */ +#define TT_UCR_OSMANYA (1L << 10) /*U+10480-U+104AF*/ + /* Bit 107 Cypriot Syllabary */ +#define TT_UCR_CYPRIOT_SYLLABARY (1L << 11) /*U+10800-U+1083F*/ + /* Bit 108 Kharoshthi */ +#define TT_UCR_KHAROSHTHI (1L << 12) /*U+10A00-U+10A5F*/ + /* Bit 109 Tai Xuan Jing Symbols */ +#define TT_UCR_TAI_XUAN_JING (1L << 13) /*U+1D300-U+1D35F*/ + /* Bit 110 Cuneiform */ + /* Cuneiform Numbers and Punctuation */ +#define TT_UCR_CUNEIFORM (1L << 14) /*U+12000-U+123FF*/ + /*U+12400-U+1247F*/ + /* Bit 111 Counting Rod Numerals */ +#define TT_UCR_COUNTING_ROD_NUMERALS (1L << 15) /*U+1D360-U+1D37F*/ + /* Bit 112 Sundanese */ +#define TT_UCR_SUNDANESE (1L << 16) /* U+1B80-U+1BBF */ + /* Bit 113 Lepcha */ +#define TT_UCR_LEPCHA (1L << 17) /* U+1C00-U+1C4F */ + /* Bit 114 Ol Chiki */ +#define TT_UCR_OL_CHIKI (1L << 18) /* U+1C50-U+1C7F */ + /* Bit 115 Saurashtra */ +#define TT_UCR_SAURASHTRA (1L << 19) /* U+A880-U+A8DF */ + /* Bit 116 Kayah Li */ +#define TT_UCR_KAYAH_LI (1L << 20) /* U+A900-U+A92F */ + /* Bit 117 Rejang */ +#define TT_UCR_REJANG (1L << 21) /* U+A930-U+A95F */ + /* Bit 118 Cham */ +#define TT_UCR_CHAM (1L << 22) /* U+AA00-U+AA5F */ + /* Bit 119 Ancient Symbols */ +#define TT_UCR_ANCIENT_SYMBOLS (1L << 23) /*U+10190-U+101CF*/ + /* Bit 120 Phaistos Disc */ +#define TT_UCR_PHAISTOS_DISC (1L << 24) /*U+101D0-U+101FF*/ + /* Bit 121 Carian */ + /* Lycian */ + /* Lydian */ +#define TT_UCR_OLD_ANATOLIAN (1L << 25) /*U+102A0-U+102DF*/ + /*U+10280-U+1029F*/ + /*U+10920-U+1093F*/ + /* Bit 122 Domino Tiles */ + /* Mahjong Tiles */ +#define TT_UCR_GAME_TILES (1L << 26) /*U+1F030-U+1F09F*/ + /*U+1F000-U+1F02F*/ + /* Bit 123-127 Reserved for process-internal usage */ + + + /*************************************************************************/ + /* */ + /* Some compilers have a very limited length of identifiers. */ + /* */ +#if defined( __TURBOC__ ) && __TURBOC__ < 0x0410 || defined( __PACIFIC__ ) +#define HAVE_LIMIT_ON_IDENTS +#endif + + +#ifndef HAVE_LIMIT_ON_IDENTS + + + /*************************************************************************/ + /* */ + /* Here some alias #defines in order to be clearer. */ + /* */ + /* These are not always #defined to stay within the 31~character limit */ + /* which some compilers have. */ + /* */ + /* Credits go to Dave Hoo <dhoo@flash.net> for pointing out that modern */ + /* Borland compilers (read: from BC++ 3.1 on) can increase this limit. */ + /* If you get a warning with such a compiler, use the -i40 switch. */ + /* */ +#define TT_UCR_ARABIC_PRESENTATION_FORMS_A \ + TT_UCR_ARABIC_PRESENTATIONS_A +#define TT_UCR_ARABIC_PRESENTATION_FORMS_B \ + TT_UCR_ARABIC_PRESENTATIONS_B + +#define TT_UCR_COMBINING_DIACRITICAL_MARKS \ + TT_UCR_COMBINING_DIACRITICS +#define TT_UCR_COMBINING_DIACRITICAL_MARKS_SYMB \ + TT_UCR_COMBINING_DIACRITICS_SYMB + + +#endif /* !HAVE_LIMIT_ON_IDENTS */ + + +FT_END_HEADER + +#endif /* __TTNAMEID_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/tttables.h b/portlibs/include/freetype/tttables.h new file mode 100644 index 00000000..72d8e4f2 --- /dev/null +++ b/portlibs/include/freetype/tttables.h @@ -0,0 +1,756 @@ +/***************************************************************************/ +/* */ +/* tttables.h */ +/* */ +/* Basic SFNT/TrueType tables definitions and interface */ +/* (specification only). */ +/* */ +/* Copyright 1996-2001, 2002, 2003, 2004, 2005, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __TTTABLES_H__ +#define __TTTABLES_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + /*************************************************************************/ + /* */ + /* <Section> */ + /* truetype_tables */ + /* */ + /* <Title> */ + /* TrueType Tables */ + /* */ + /* <Abstract> */ + /* TrueType specific table types and functions. */ + /* */ + /* <Description> */ + /* This section contains the definition of TrueType-specific tables */ + /* as well as some routines used to access and process them. */ + /* */ + /*************************************************************************/ + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_Header */ + /* */ + /* <Description> */ + /* A structure used to model a TrueType font header table. All */ + /* fields follow the TrueType specification. */ + /* */ + typedef struct TT_Header_ + { + FT_Fixed Table_Version; + FT_Fixed Font_Revision; + + FT_Long CheckSum_Adjust; + FT_Long Magic_Number; + + FT_UShort Flags; + FT_UShort Units_Per_EM; + + FT_Long Created [2]; + FT_Long Modified[2]; + + FT_Short xMin; + FT_Short yMin; + FT_Short xMax; + FT_Short yMax; + + FT_UShort Mac_Style; + FT_UShort Lowest_Rec_PPEM; + + FT_Short Font_Direction; + FT_Short Index_To_Loc_Format; + FT_Short Glyph_Data_Format; + + } TT_Header; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_HoriHeader */ + /* */ + /* <Description> */ + /* A structure used to model a TrueType horizontal header, the `hhea' */ + /* table, as well as the corresponding horizontal metrics table, */ + /* i.e., the `hmtx' table. */ + /* */ + /* <Fields> */ + /* Version :: The table version. */ + /* */ + /* Ascender :: The font's ascender, i.e., the distance */ + /* from the baseline to the top-most of all */ + /* glyph points found in the font. */ + /* */ + /* This value is invalid in many fonts, as */ + /* it is usually set by the font designer, */ + /* and often reflects only a portion of the */ + /* glyphs found in the font (maybe ASCII). */ + /* */ + /* You should use the `sTypoAscender' field */ + /* of the OS/2 table instead if you want */ + /* the correct one. */ + /* */ + /* Descender :: The font's descender, i.e., the distance */ + /* from the baseline to the bottom-most of */ + /* all glyph points found in the font. It */ + /* is negative. */ + /* */ + /* This value is invalid in many fonts, as */ + /* it is usually set by the font designer, */ + /* and often reflects only a portion of the */ + /* glyphs found in the font (maybe ASCII). */ + /* */ + /* You should use the `sTypoDescender' */ + /* field of the OS/2 table instead if you */ + /* want the correct one. */ + /* */ + /* Line_Gap :: The font's line gap, i.e., the distance */ + /* to add to the ascender and descender to */ + /* get the BTB, i.e., the */ + /* baseline-to-baseline distance for the */ + /* font. */ + /* */ + /* advance_Width_Max :: This field is the maximum of all advance */ + /* widths found in the font. It can be */ + /* used to compute the maximum width of an */ + /* arbitrary string of text. */ + /* */ + /* min_Left_Side_Bearing :: The minimum left side bearing of all */ + /* glyphs within the font. */ + /* */ + /* min_Right_Side_Bearing :: The minimum right side bearing of all */ + /* glyphs within the font. */ + /* */ + /* xMax_Extent :: The maximum horizontal extent (i.e., the */ + /* `width' of a glyph's bounding box) for */ + /* all glyphs in the font. */ + /* */ + /* caret_Slope_Rise :: The rise coefficient of the cursor's */ + /* slope of the cursor (slope=rise/run). */ + /* */ + /* caret_Slope_Run :: The run coefficient of the cursor's */ + /* slope. */ + /* */ + /* Reserved :: 8~reserved bytes. */ + /* */ + /* metric_Data_Format :: Always~0. */ + /* */ + /* number_Of_HMetrics :: Number of HMetrics entries in the `hmtx' */ + /* table -- this value can be smaller than */ + /* the total number of glyphs in the font. */ + /* */ + /* long_metrics :: A pointer into the `hmtx' table. */ + /* */ + /* short_metrics :: A pointer into the `hmtx' table. */ + /* */ + /* <Note> */ + /* IMPORTANT: The TT_HoriHeader and TT_VertHeader structures should */ + /* be identical except for the names of their fields which */ + /* are different. */ + /* */ + /* This ensures that a single function in the `ttload' */ + /* module is able to read both the horizontal and vertical */ + /* headers. */ + /* */ + typedef struct TT_HoriHeader_ + { + FT_Fixed Version; + FT_Short Ascender; + FT_Short Descender; + FT_Short Line_Gap; + + FT_UShort advance_Width_Max; /* advance width maximum */ + + FT_Short min_Left_Side_Bearing; /* minimum left-sb */ + FT_Short min_Right_Side_Bearing; /* minimum right-sb */ + FT_Short xMax_Extent; /* xmax extents */ + FT_Short caret_Slope_Rise; + FT_Short caret_Slope_Run; + FT_Short caret_Offset; + + FT_Short Reserved[4]; + + FT_Short metric_Data_Format; + FT_UShort number_Of_HMetrics; + + /* The following fields are not defined by the TrueType specification */ + /* but they are used to connect the metrics header to the relevant */ + /* `HMTX' table. */ + + void* long_metrics; + void* short_metrics; + + } TT_HoriHeader; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_VertHeader */ + /* */ + /* <Description> */ + /* A structure used to model a TrueType vertical header, the `vhea' */ + /* table, as well as the corresponding vertical metrics table, i.e., */ + /* the `vmtx' table. */ + /* */ + /* <Fields> */ + /* Version :: The table version. */ + /* */ + /* Ascender :: The font's ascender, i.e., the distance */ + /* from the baseline to the top-most of */ + /* all glyph points found in the font. */ + /* */ + /* This value is invalid in many fonts, as */ + /* it is usually set by the font designer, */ + /* and often reflects only a portion of */ + /* the glyphs found in the font (maybe */ + /* ASCII). */ + /* */ + /* You should use the `sTypoAscender' */ + /* field of the OS/2 table instead if you */ + /* want the correct one. */ + /* */ + /* Descender :: The font's descender, i.e., the */ + /* distance from the baseline to the */ + /* bottom-most of all glyph points found */ + /* in the font. It is negative. */ + /* */ + /* This value is invalid in many fonts, as */ + /* it is usually set by the font designer, */ + /* and often reflects only a portion of */ + /* the glyphs found in the font (maybe */ + /* ASCII). */ + /* */ + /* You should use the `sTypoDescender' */ + /* field of the OS/2 table instead if you */ + /* want the correct one. */ + /* */ + /* Line_Gap :: The font's line gap, i.e., the distance */ + /* to add to the ascender and descender to */ + /* get the BTB, i.e., the */ + /* baseline-to-baseline distance for the */ + /* font. */ + /* */ + /* advance_Height_Max :: This field is the maximum of all */ + /* advance heights found in the font. It */ + /* can be used to compute the maximum */ + /* height of an arbitrary string of text. */ + /* */ + /* min_Top_Side_Bearing :: The minimum top side bearing of all */ + /* glyphs within the font. */ + /* */ + /* min_Bottom_Side_Bearing :: The minimum bottom side bearing of all */ + /* glyphs within the font. */ + /* */ + /* yMax_Extent :: The maximum vertical extent (i.e., the */ + /* `height' of a glyph's bounding box) for */ + /* all glyphs in the font. */ + /* */ + /* caret_Slope_Rise :: The rise coefficient of the cursor's */ + /* slope of the cursor (slope=rise/run). */ + /* */ + /* caret_Slope_Run :: The run coefficient of the cursor's */ + /* slope. */ + /* */ + /* caret_Offset :: The cursor's offset for slanted fonts. */ + /* This value is `reserved' in vmtx */ + /* version 1.0. */ + /* */ + /* Reserved :: 8~reserved bytes. */ + /* */ + /* metric_Data_Format :: Always~0. */ + /* */ + /* number_Of_HMetrics :: Number of VMetrics entries in the */ + /* `vmtx' table -- this value can be */ + /* smaller than the total number of glyphs */ + /* in the font. */ + /* */ + /* long_metrics :: A pointer into the `vmtx' table. */ + /* */ + /* short_metrics :: A pointer into the `vmtx' table. */ + /* */ + /* <Note> */ + /* IMPORTANT: The TT_HoriHeader and TT_VertHeader structures should */ + /* be identical except for the names of their fields which */ + /* are different. */ + /* */ + /* This ensures that a single function in the `ttload' */ + /* module is able to read both the horizontal and vertical */ + /* headers. */ + /* */ + typedef struct TT_VertHeader_ + { + FT_Fixed Version; + FT_Short Ascender; + FT_Short Descender; + FT_Short Line_Gap; + + FT_UShort advance_Height_Max; /* advance height maximum */ + + FT_Short min_Top_Side_Bearing; /* minimum left-sb or top-sb */ + FT_Short min_Bottom_Side_Bearing; /* minimum right-sb or bottom-sb */ + FT_Short yMax_Extent; /* xmax or ymax extents */ + FT_Short caret_Slope_Rise; + FT_Short caret_Slope_Run; + FT_Short caret_Offset; + + FT_Short Reserved[4]; + + FT_Short metric_Data_Format; + FT_UShort number_Of_VMetrics; + + /* The following fields are not defined by the TrueType specification */ + /* but they're used to connect the metrics header to the relevant */ + /* `HMTX' or `VMTX' table. */ + + void* long_metrics; + void* short_metrics; + + } TT_VertHeader; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_OS2 */ + /* */ + /* <Description> */ + /* A structure used to model a TrueType OS/2 table. This is the long */ + /* table version. All fields comply to the TrueType specification. */ + /* */ + /* Note that we now support old Mac fonts which do not include an */ + /* OS/2 table. In this case, the `version' field is always set to */ + /* 0xFFFF. */ + /* */ + typedef struct TT_OS2_ + { + FT_UShort version; /* 0x0001 - more or 0xFFFF */ + FT_Short xAvgCharWidth; + FT_UShort usWeightClass; + FT_UShort usWidthClass; + FT_Short fsType; + FT_Short ySubscriptXSize; + FT_Short ySubscriptYSize; + FT_Short ySubscriptXOffset; + FT_Short ySubscriptYOffset; + FT_Short ySuperscriptXSize; + FT_Short ySuperscriptYSize; + FT_Short ySuperscriptXOffset; + FT_Short ySuperscriptYOffset; + FT_Short yStrikeoutSize; + FT_Short yStrikeoutPosition; + FT_Short sFamilyClass; + + FT_Byte panose[10]; + + FT_ULong ulUnicodeRange1; /* Bits 0-31 */ + FT_ULong ulUnicodeRange2; /* Bits 32-63 */ + FT_ULong ulUnicodeRange3; /* Bits 64-95 */ + FT_ULong ulUnicodeRange4; /* Bits 96-127 */ + + FT_Char achVendID[4]; + + FT_UShort fsSelection; + FT_UShort usFirstCharIndex; + FT_UShort usLastCharIndex; + FT_Short sTypoAscender; + FT_Short sTypoDescender; + FT_Short sTypoLineGap; + FT_UShort usWinAscent; + FT_UShort usWinDescent; + + /* only version 1 tables: */ + + FT_ULong ulCodePageRange1; /* Bits 0-31 */ + FT_ULong ulCodePageRange2; /* Bits 32-63 */ + + /* only version 2 tables: */ + + FT_Short sxHeight; + FT_Short sCapHeight; + FT_UShort usDefaultChar; + FT_UShort usBreakChar; + FT_UShort usMaxContext; + + } TT_OS2; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_Postscript */ + /* */ + /* <Description> */ + /* A structure used to model a TrueType PostScript table. All fields */ + /* comply to the TrueType specification. This structure does not */ + /* reference the PostScript glyph names, which can be nevertheless */ + /* accessed with the `ttpost' module. */ + /* */ + typedef struct TT_Postscript_ + { + FT_Fixed FormatType; + FT_Fixed italicAngle; + FT_Short underlinePosition; + FT_Short underlineThickness; + FT_ULong isFixedPitch; + FT_ULong minMemType42; + FT_ULong maxMemType42; + FT_ULong minMemType1; + FT_ULong maxMemType1; + + /* Glyph names follow in the file, but we don't */ + /* load them by default. See the ttpost.c file. */ + + } TT_Postscript; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_PCLT */ + /* */ + /* <Description> */ + /* A structure used to model a TrueType PCLT table. All fields */ + /* comply to the TrueType specification. */ + /* */ + typedef struct TT_PCLT_ + { + FT_Fixed Version; + FT_ULong FontNumber; + FT_UShort Pitch; + FT_UShort xHeight; + FT_UShort Style; + FT_UShort TypeFamily; + FT_UShort CapHeight; + FT_UShort SymbolSet; + FT_Char TypeFace[16]; + FT_Char CharacterComplement[8]; + FT_Char FileName[6]; + FT_Char StrokeWeight; + FT_Char WidthType; + FT_Byte SerifStyle; + FT_Byte Reserved; + + } TT_PCLT; + + + /*************************************************************************/ + /* */ + /* <Struct> */ + /* TT_MaxProfile */ + /* */ + /* <Description> */ + /* The maximum profile is a table containing many max values which */ + /* can be used to pre-allocate arrays. This ensures that no memory */ + /* allocation occurs during a glyph load. */ + /* */ + /* <Fields> */ + /* version :: The version number. */ + /* */ + /* numGlyphs :: The number of glyphs in this TrueType */ + /* font. */ + /* */ + /* maxPoints :: The maximum number of points in a */ + /* non-composite TrueType glyph. See also */ + /* the structure element */ + /* `maxCompositePoints'. */ + /* */ + /* maxContours :: The maximum number of contours in a */ + /* non-composite TrueType glyph. See also */ + /* the structure element */ + /* `maxCompositeContours'. */ + /* */ + /* maxCompositePoints :: The maximum number of points in a */ + /* composite TrueType glyph. See also the */ + /* structure element `maxPoints'. */ + /* */ + /* maxCompositeContours :: The maximum number of contours in a */ + /* composite TrueType glyph. See also the */ + /* structure element `maxContours'. */ + /* */ + /* maxZones :: The maximum number of zones used for */ + /* glyph hinting. */ + /* */ + /* maxTwilightPoints :: The maximum number of points in the */ + /* twilight zone used for glyph hinting. */ + /* */ + /* maxStorage :: The maximum number of elements in the */ + /* storage area used for glyph hinting. */ + /* */ + /* maxFunctionDefs :: The maximum number of function */ + /* definitions in the TrueType bytecode for */ + /* this font. */ + /* */ + /* maxInstructionDefs :: The maximum number of instruction */ + /* definitions in the TrueType bytecode for */ + /* this font. */ + /* */ + /* maxStackElements :: The maximum number of stack elements used */ + /* during bytecode interpretation. */ + /* */ + /* maxSizeOfInstructions :: The maximum number of TrueType opcodes */ + /* used for glyph hinting. */ + /* */ + /* maxComponentElements :: The maximum number of simple (i.e., non- */ + /* composite) glyphs in a composite glyph. */ + /* */ + /* maxComponentDepth :: The maximum nesting depth of composite */ + /* glyphs. */ + /* */ + /* <Note> */ + /* This structure is only used during font loading. */ + /* */ + typedef struct TT_MaxProfile_ + { + FT_Fixed version; + FT_UShort numGlyphs; + FT_UShort maxPoints; + FT_UShort maxContours; + FT_UShort maxCompositePoints; + FT_UShort maxCompositeContours; + FT_UShort maxZones; + FT_UShort maxTwilightPoints; + FT_UShort maxStorage; + FT_UShort maxFunctionDefs; + FT_UShort maxInstructionDefs; + FT_UShort maxStackElements; + FT_UShort maxSizeOfInstructions; + FT_UShort maxComponentElements; + FT_UShort maxComponentDepth; + + } TT_MaxProfile; + + + /*************************************************************************/ + /* */ + /* <Enum> */ + /* FT_Sfnt_Tag */ + /* */ + /* <Description> */ + /* An enumeration used to specify the index of an SFNT table. */ + /* Used in the @FT_Get_Sfnt_Table API function. */ + /* */ + typedef enum FT_Sfnt_Tag_ + { + ft_sfnt_head = 0, + ft_sfnt_maxp = 1, + ft_sfnt_os2 = 2, + ft_sfnt_hhea = 3, + ft_sfnt_vhea = 4, + ft_sfnt_post = 5, + ft_sfnt_pclt = 6, + + sfnt_max /* internal end mark */ + + } FT_Sfnt_Tag; + + /* */ + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_Sfnt_Table */ + /* */ + /* <Description> */ + /* Return a pointer to a given SFNT table within a face. */ + /* */ + /* <Input> */ + /* face :: A handle to the source. */ + /* */ + /* tag :: The index of the SFNT table. */ + /* */ + /* <Return> */ + /* A type-less pointer to the table. This will be~0 in case of */ + /* error, or if the corresponding table was not found *OR* loaded */ + /* from the file. */ + /* */ + /* <Note> */ + /* The table is owned by the face object and disappears with it. */ + /* */ + /* This function is only useful to access SFNT tables that are loaded */ + /* by the sfnt, truetype, and opentype drivers. See @FT_Sfnt_Tag for */ + /* a list. */ + /* */ + FT_EXPORT( void* ) + FT_Get_Sfnt_Table( FT_Face face, + FT_Sfnt_Tag tag ); + + + /************************************************************************** + * + * @function: + * FT_Load_Sfnt_Table + * + * @description: + * Load any font table into client memory. + * + * @input: + * face :: + * A handle to the source face. + * + * tag :: + * The four-byte tag of the table to load. Use the value~0 if you want + * to access the whole font file. Otherwise, you can use one of the + * definitions found in the @FT_TRUETYPE_TAGS_H file, or forge a new + * one with @FT_MAKE_TAG. + * + * offset :: + * The starting offset in the table (or file if tag == 0). + * + * @output: + * buffer :: + * The target buffer address. The client must ensure that the memory + * array is big enough to hold the data. + * + * @inout: + * length :: + * If the `length' parameter is NULL, then try to load the whole table. + * Return an error code if it fails. + * + * Else, if `*length' is~0, exit immediately while returning the + * table's (or file) full size in it. + * + * Else the number of bytes to read from the table or file, from the + * starting offset. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * If you need to determine the table's length you should first call this + * function with `*length' set to~0, as in the following example: + * + * { + * FT_ULong length = 0; + * + * + * error = FT_Load_Sfnt_Table( face, tag, 0, NULL, &length ); + * if ( error ) { ... table does not exist ... } + * + * buffer = malloc( length ); + * if ( buffer == NULL ) { ... not enough memory ... } + * + * error = FT_Load_Sfnt_Table( face, tag, 0, buffer, &length ); + * if ( error ) { ... could not load table ... } + * } + */ + FT_EXPORT( FT_Error ) + FT_Load_Sfnt_Table( FT_Face face, + FT_ULong tag, + FT_Long offset, + FT_Byte* buffer, + FT_ULong* length ); + + + /************************************************************************** + * + * @function: + * FT_Sfnt_Table_Info + * + * @description: + * Return information on an SFNT table. + * + * @input: + * face :: + * A handle to the source face. + * + * table_index :: + * The index of an SFNT table. The function returns + * FT_Err_Table_Missing for an invalid value. + * + * @output: + * tag :: + * The name tag of the SFNT table. + * + * length :: + * The length of the SFNT table. + * + * @return: + * FreeType error code. 0~means success. + * + * @note: + * SFNT tables with length zero are treated as missing by Windows. + * + */ + FT_EXPORT( FT_Error ) + FT_Sfnt_Table_Info( FT_Face face, + FT_UInt table_index, + FT_ULong *tag, + FT_ULong *length ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_CMap_Language_ID */ + /* */ + /* <Description> */ + /* Return TrueType/sfnt specific cmap language ID. Definitions of */ + /* language ID values are in `freetype/ttnameid.h'. */ + /* */ + /* <Input> */ + /* charmap :: */ + /* The target charmap. */ + /* */ + /* <Return> */ + /* The language ID of `charmap'. If `charmap' doesn't belong to a */ + /* TrueType/sfnt face, just return~0 as the default value. */ + /* */ + FT_EXPORT( FT_ULong ) + FT_Get_CMap_Language_ID( FT_CharMap charmap ); + + + /*************************************************************************/ + /* */ + /* <Function> */ + /* FT_Get_CMap_Format */ + /* */ + /* <Description> */ + /* Return TrueType/sfnt specific cmap format. */ + /* */ + /* <Input> */ + /* charmap :: */ + /* The target charmap. */ + /* */ + /* <Return> */ + /* The format of `charmap'. If `charmap' doesn't belong to a */ + /* TrueType/sfnt face, return -1. */ + /* */ + FT_EXPORT( FT_Long ) + FT_Get_CMap_Format( FT_CharMap charmap ); + + /* */ + + +FT_END_HEADER + +#endif /* __TTTABLES_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/tttags.h b/portlibs/include/freetype/tttags.h new file mode 100644 index 00000000..307ce4b6 --- /dev/null +++ b/portlibs/include/freetype/tttags.h @@ -0,0 +1,107 @@ +/***************************************************************************/ +/* */ +/* tttags.h */ +/* */ +/* Tags for TrueType and OpenType tables (specification only). */ +/* */ +/* Copyright 1996-2001, 2004, 2005, 2007, 2008 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __TTAGS_H__ +#define __TTAGS_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + +#define TTAG_avar FT_MAKE_TAG( 'a', 'v', 'a', 'r' ) +#define TTAG_BASE FT_MAKE_TAG( 'B', 'A', 'S', 'E' ) +#define TTAG_bdat FT_MAKE_TAG( 'b', 'd', 'a', 't' ) +#define TTAG_BDF FT_MAKE_TAG( 'B', 'D', 'F', ' ' ) +#define TTAG_bhed FT_MAKE_TAG( 'b', 'h', 'e', 'd' ) +#define TTAG_bloc FT_MAKE_TAG( 'b', 'l', 'o', 'c' ) +#define TTAG_bsln FT_MAKE_TAG( 'b', 's', 'l', 'n' ) +#define TTAG_CFF FT_MAKE_TAG( 'C', 'F', 'F', ' ' ) +#define TTAG_CID FT_MAKE_TAG( 'C', 'I', 'D', ' ' ) +#define TTAG_cmap FT_MAKE_TAG( 'c', 'm', 'a', 'p' ) +#define TTAG_cvar FT_MAKE_TAG( 'c', 'v', 'a', 'r' ) +#define TTAG_cvt FT_MAKE_TAG( 'c', 'v', 't', ' ' ) +#define TTAG_DSIG FT_MAKE_TAG( 'D', 'S', 'I', 'G' ) +#define TTAG_EBDT FT_MAKE_TAG( 'E', 'B', 'D', 'T' ) +#define TTAG_EBLC FT_MAKE_TAG( 'E', 'B', 'L', 'C' ) +#define TTAG_EBSC FT_MAKE_TAG( 'E', 'B', 'S', 'C' ) +#define TTAG_feat FT_MAKE_TAG( 'f', 'e', 'a', 't' ) +#define TTAG_FOND FT_MAKE_TAG( 'F', 'O', 'N', 'D' ) +#define TTAG_fpgm FT_MAKE_TAG( 'f', 'p', 'g', 'm' ) +#define TTAG_fvar FT_MAKE_TAG( 'f', 'v', 'a', 'r' ) +#define TTAG_gasp FT_MAKE_TAG( 'g', 'a', 's', 'p' ) +#define TTAG_GDEF FT_MAKE_TAG( 'G', 'D', 'E', 'F' ) +#define TTAG_glyf FT_MAKE_TAG( 'g', 'l', 'y', 'f' ) +#define TTAG_GPOS FT_MAKE_TAG( 'G', 'P', 'O', 'S' ) +#define TTAG_GSUB FT_MAKE_TAG( 'G', 'S', 'U', 'B' ) +#define TTAG_gvar FT_MAKE_TAG( 'g', 'v', 'a', 'r' ) +#define TTAG_hdmx FT_MAKE_TAG( 'h', 'd', 'm', 'x' ) +#define TTAG_head FT_MAKE_TAG( 'h', 'e', 'a', 'd' ) +#define TTAG_hhea FT_MAKE_TAG( 'h', 'h', 'e', 'a' ) +#define TTAG_hmtx FT_MAKE_TAG( 'h', 'm', 't', 'x' ) +#define TTAG_JSTF FT_MAKE_TAG( 'J', 'S', 'T', 'F' ) +#define TTAG_just FT_MAKE_TAG( 'j', 'u', 's', 't' ) +#define TTAG_kern FT_MAKE_TAG( 'k', 'e', 'r', 'n' ) +#define TTAG_lcar FT_MAKE_TAG( 'l', 'c', 'a', 'r' ) +#define TTAG_loca FT_MAKE_TAG( 'l', 'o', 'c', 'a' ) +#define TTAG_LTSH FT_MAKE_TAG( 'L', 'T', 'S', 'H' ) +#define TTAG_LWFN FT_MAKE_TAG( 'L', 'W', 'F', 'N' ) +#define TTAG_MATH FT_MAKE_TAG( 'M', 'A', 'T', 'H' ) +#define TTAG_maxp FT_MAKE_TAG( 'm', 'a', 'x', 'p' ) +#define TTAG_META FT_MAKE_TAG( 'M', 'E', 'T', 'A' ) +#define TTAG_MMFX FT_MAKE_TAG( 'M', 'M', 'F', 'X' ) +#define TTAG_MMSD FT_MAKE_TAG( 'M', 'M', 'S', 'D' ) +#define TTAG_mort FT_MAKE_TAG( 'm', 'o', 'r', 't' ) +#define TTAG_morx FT_MAKE_TAG( 'm', 'o', 'r', 'x' ) +#define TTAG_name FT_MAKE_TAG( 'n', 'a', 'm', 'e' ) +#define TTAG_opbd FT_MAKE_TAG( 'o', 'p', 'b', 'd' ) +#define TTAG_OS2 FT_MAKE_TAG( 'O', 'S', '/', '2' ) +#define TTAG_OTTO FT_MAKE_TAG( 'O', 'T', 'T', 'O' ) +#define TTAG_PCLT FT_MAKE_TAG( 'P', 'C', 'L', 'T' ) +#define TTAG_POST FT_MAKE_TAG( 'P', 'O', 'S', 'T' ) +#define TTAG_post FT_MAKE_TAG( 'p', 'o', 's', 't' ) +#define TTAG_prep FT_MAKE_TAG( 'p', 'r', 'e', 'p' ) +#define TTAG_prop FT_MAKE_TAG( 'p', 'r', 'o', 'p' ) +#define TTAG_sfnt FT_MAKE_TAG( 's', 'f', 'n', 't' ) +#define TTAG_SING FT_MAKE_TAG( 'S', 'I', 'N', 'G' ) +#define TTAG_trak FT_MAKE_TAG( 't', 'r', 'a', 'k' ) +#define TTAG_true FT_MAKE_TAG( 't', 'r', 'u', 'e' ) +#define TTAG_ttc FT_MAKE_TAG( 't', 't', 'c', ' ' ) +#define TTAG_ttcf FT_MAKE_TAG( 't', 't', 'c', 'f' ) +#define TTAG_TYP1 FT_MAKE_TAG( 'T', 'Y', 'P', '1' ) +#define TTAG_typ1 FT_MAKE_TAG( 't', 'y', 'p', '1' ) +#define TTAG_VDMX FT_MAKE_TAG( 'V', 'D', 'M', 'X' ) +#define TTAG_vhea FT_MAKE_TAG( 'v', 'h', 'e', 'a' ) +#define TTAG_vmtx FT_MAKE_TAG( 'v', 'm', 't', 'x' ) + + +FT_END_HEADER + +#endif /* __TTAGS_H__ */ + + +/* END */ diff --git a/portlibs/include/freetype/ttunpat.h b/portlibs/include/freetype/ttunpat.h new file mode 100644 index 00000000..a0162759 --- /dev/null +++ b/portlibs/include/freetype/ttunpat.h @@ -0,0 +1,59 @@ +/***************************************************************************/ +/* */ +/* ttunpat.h */ +/* */ +/* Definitions for the unpatented TrueType hinting system */ +/* */ +/* Copyright 2003, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* Written by Graham Asher <graham.asher@btinternet.com> */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + +#ifndef __TTUNPAT_H__ +#define __TTUNPAT_H__ + + +#include <ft2build.h> +#include FT_FREETYPE_H + +#ifdef FREETYPE_H +#error "freetype.h of FreeType 1 has been loaded!" +#error "Please fix the directory search order for header files" +#error "so that freetype.h of FreeType 2 is found first." +#endif + + +FT_BEGIN_HEADER + + + /*************************************************************************** + * + * @constant: + * FT_PARAM_TAG_UNPATENTED_HINTING + * + * @description: + * A constant used as the tag of an @FT_Parameter structure to indicate + * that unpatented methods only should be used by the TrueType bytecode + * interpreter for a typeface opened by @FT_Open_Face. + * + */ +#define FT_PARAM_TAG_UNPATENTED_HINTING FT_MAKE_TAG( 'u', 'n', 'p', 'a' ) + + /* */ + +FT_END_HEADER + + +#endif /* __TTUNPAT_H__ */ + + +/* END */ diff --git a/portlibs/include/ft2build.h b/portlibs/include/ft2build.h new file mode 100644 index 00000000..923d887d --- /dev/null +++ b/portlibs/include/ft2build.h @@ -0,0 +1,39 @@ +/***************************************************************************/ +/* */ +/* ft2build.h */ +/* */ +/* FreeType 2 build and setup macros. */ +/* (Generic version) */ +/* */ +/* Copyright 1996-2001, 2006 by */ +/* David Turner, Robert Wilhelm, and Werner Lemberg. */ +/* */ +/* This file is part of the FreeType project, and may only be used, */ +/* modified, and distributed under the terms of the FreeType project */ +/* license, LICENSE.TXT. By continuing to use, modify, or distribute */ +/* this file you indicate that you have read the license and */ +/* understand and accept it fully. */ +/* */ +/***************************************************************************/ + + + /*************************************************************************/ + /* */ + /* This file corresponds to the default `ft2build.h' file for */ + /* FreeType 2. It uses the `freetype' include root. */ + /* */ + /* Note that specific platforms might use a different configuration. */ + /* See builds/unix/ft2unix.h for an example. */ + /* */ + /*************************************************************************/ + + +#ifndef __FT2_BUILD_GENERIC_H__ +#define __FT2_BUILD_GENERIC_H__ + +#include <freetype/config/ftheader.h> + +#endif /* __FT2_BUILD_GENERIC_H__ */ + + +/* END */ diff --git a/portlibs/include/jconfig.h b/portlibs/include/jconfig.h new file mode 100644 index 00000000..9594ec56 --- /dev/null +++ b/portlibs/include/jconfig.h @@ -0,0 +1,45 @@ +/* jconfig.h. Generated automatically by configure. */ +/* jconfig.cfg --- source file edited by configure script */ +/* see jconfig.doc for explanations */ + +#define HAVE_PROTOTYPES +#define HAVE_UNSIGNED_CHAR +#define HAVE_UNSIGNED_SHORT +#undef void +#undef const +#undef CHAR_IS_UNSIGNED +#define HAVE_STDDEF_H +#define HAVE_STDLIB_H +#undef NEED_BSD_STRINGS +#undef NEED_SYS_TYPES_H +#undef NEED_FAR_POINTERS +#undef NEED_SHORT_EXTERNAL_NAMES +/* Define this if you get warnings about undefined structures. */ +#undef INCOMPLETE_TYPES_BROKEN + +#ifdef JPEG_INTERNALS + +#undef RIGHT_SHIFT_IS_UNSIGNED +#define INLINE __inline__ +/* These are for configuring the JPEG memory manager. */ +#undef DEFAULT_MAX_MEM +#undef NO_MKTEMP + +#endif /* JPEG_INTERNALS */ + +#ifdef JPEG_CJPEG_DJPEG + +#define BMP_SUPPORTED /* BMP image file format */ +#define GIF_SUPPORTED /* GIF image file format */ +#define PPM_SUPPORTED /* PBMPLUS PPM/PGM image file format */ +#undef RLE_SUPPORTED /* Utah RLE image file format */ +#define TARGA_SUPPORTED /* Targa image file format */ + +#undef TWO_FILE_COMMANDLINE +#undef NEED_SIGNAL_CATCHER +#undef DONT_USE_B_MODE + +/* Define this if you want percent-done progress reports from cjpeg/djpeg. */ +#undef PROGRESS_REPORT + +#endif /* JPEG_CJPEG_DJPEG */ diff --git a/portlibs/include/jerror.h b/portlibs/include/jerror.h new file mode 100644 index 00000000..478b74d7 --- /dev/null +++ b/portlibs/include/jerror.h @@ -0,0 +1,304 @@ +/* + * jerror.h + * + * Copyright (C) 1994-1997, Thomas G. Lane. + * Modified 1997-2009 by Guido Vollbeding. + * This file is part of the Independent JPEG Group's software. + * For conditions of distribution and use, see the accompanying README file. + * + * This file defines the error and message codes for the JPEG library. + * Edit this file to add new codes, or to translate the message strings to + * some other language. + * A set of error-reporting macros are defined too. Some applications using + * the JPEG library may wish to include this file to get the error codes + * and/or the macros. + */ + +/* + * To define the enum list of message codes, include this file without + * defining macro JMESSAGE. To create a message string table, include it + * again with a suitable JMESSAGE definition (see jerror.c for an example). + */ +#ifndef JMESSAGE +#ifndef JERROR_H +/* First time through, define the enum list */ +#define JMAKE_ENUM_LIST +#else +/* Repeated inclusions of this file are no-ops unless JMESSAGE is defined */ +#define JMESSAGE(code,string) +#endif /* JERROR_H */ +#endif /* JMESSAGE */ + +#ifdef JMAKE_ENUM_LIST + +typedef enum { + +#define JMESSAGE(code,string) code , + +#endif /* JMAKE_ENUM_LIST */ + +JMESSAGE(JMSG_NOMESSAGE, "Bogus message code %d") /* Must be first entry! */ + +/* For maintenance convenience, list is alphabetical by message code name */ +JMESSAGE(JERR_BAD_ALIGN_TYPE, "ALIGN_TYPE is wrong, please fix") +JMESSAGE(JERR_BAD_ALLOC_CHUNK, "MAX_ALLOC_CHUNK is wrong, please fix") +JMESSAGE(JERR_BAD_BUFFER_MODE, "Bogus buffer control mode") +JMESSAGE(JERR_BAD_COMPONENT_ID, "Invalid component ID %d in SOS") +JMESSAGE(JERR_BAD_CROP_SPEC, "Invalid crop request") +JMESSAGE(JERR_BAD_DCT_COEF, "DCT coefficient out of range") +JMESSAGE(JERR_BAD_DCTSIZE, "DCT scaled block size %dx%d not supported") +JMESSAGE(JERR_BAD_DROP_SAMPLING, + "Component index %d: mismatching sampling ratio %d:%d, %d:%d, %c") +JMESSAGE(JERR_BAD_HUFF_TABLE, "Bogus Huffman table definition") +JMESSAGE(JERR_BAD_IN_COLORSPACE, "Bogus input colorspace") +JMESSAGE(JERR_BAD_J_COLORSPACE, "Bogus JPEG colorspace") +JMESSAGE(JERR_BAD_LENGTH, "Bogus marker length") +JMESSAGE(JERR_BAD_LIB_VERSION, + "Wrong JPEG library version: library is %d, caller expects %d") +JMESSAGE(JERR_BAD_MCU_SIZE, "Sampling factors too large for interleaved scan") +JMESSAGE(JERR_BAD_POOL_ID, "Invalid memory pool code %d") +JMESSAGE(JERR_BAD_PRECISION, "Unsupported JPEG data precision %d") +JMESSAGE(JERR_BAD_PROGRESSION, + "Invalid progressive parameters Ss=%d Se=%d Ah=%d Al=%d") +JMESSAGE(JERR_BAD_PROG_SCRIPT, + "Invalid progressive parameters at scan script entry %d") +JMESSAGE(JERR_BAD_SAMPLING, "Bogus sampling factors") +JMESSAGE(JERR_BAD_SCAN_SCRIPT, "Invalid scan script at entry %d") +JMESSAGE(JERR_BAD_STATE, "Improper call to JPEG library in state %d") +JMESSAGE(JERR_BAD_STRUCT_SIZE, + "JPEG parameter struct mismatch: library thinks size is %u, caller expects %u") +JMESSAGE(JERR_BAD_VIRTUAL_ACCESS, "Bogus virtual array access") +JMESSAGE(JERR_BUFFER_SIZE, "Buffer passed to JPEG library is too small") +JMESSAGE(JERR_CANT_SUSPEND, "Suspension not allowed here") +JMESSAGE(JERR_CCIR601_NOTIMPL, "CCIR601 sampling not implemented yet") +JMESSAGE(JERR_COMPONENT_COUNT, "Too many color components: %d, max %d") +JMESSAGE(JERR_CONVERSION_NOTIMPL, "Unsupported color conversion request") +JMESSAGE(JERR_DAC_INDEX, "Bogus DAC index %d") +JMESSAGE(JERR_DAC_VALUE, "Bogus DAC value 0x%x") +JMESSAGE(JERR_DHT_INDEX, "Bogus DHT index %d") +JMESSAGE(JERR_DQT_INDEX, "Bogus DQT index %d") +JMESSAGE(JERR_EMPTY_IMAGE, "Empty JPEG image (DNL not supported)") +JMESSAGE(JERR_EMS_READ, "Read from EMS failed") +JMESSAGE(JERR_EMS_WRITE, "Write to EMS failed") +JMESSAGE(JERR_EOI_EXPECTED, "Didn't expect more than one scan") +JMESSAGE(JERR_FILE_READ, "Input file read error") +JMESSAGE(JERR_FILE_WRITE, "Output file write error --- out of disk space?") +JMESSAGE(JERR_FRACT_SAMPLE_NOTIMPL, "Fractional sampling not implemented yet") +JMESSAGE(JERR_HUFF_CLEN_OVERFLOW, "Huffman code size table overflow") +JMESSAGE(JERR_HUFF_MISSING_CODE, "Missing Huffman code table entry") +JMESSAGE(JERR_IMAGE_TOO_BIG, "Maximum supported image dimension is %u pixels") +JMESSAGE(JERR_INPUT_EMPTY, "Empty input file") +JMESSAGE(JERR_INPUT_EOF, "Premature end of input file") +JMESSAGE(JERR_MISMATCHED_QUANT_TABLE, + "Cannot transcode due to multiple use of quantization table %d") +JMESSAGE(JERR_MISSING_DATA, "Scan script does not transmit all data") +JMESSAGE(JERR_MODE_CHANGE, "Invalid color quantization mode change") +JMESSAGE(JERR_NOTIMPL, "Not implemented yet") +JMESSAGE(JERR_NOT_COMPILED, "Requested feature was omitted at compile time") +JMESSAGE(JERR_NO_ARITH_TABLE, "Arithmetic table 0x%02x was not defined") +JMESSAGE(JERR_NO_BACKING_STORE, "Backing store not supported") +JMESSAGE(JERR_NO_HUFF_TABLE, "Huffman table 0x%02x was not defined") +JMESSAGE(JERR_NO_IMAGE, "JPEG datastream contains no image") +JMESSAGE(JERR_NO_QUANT_TABLE, "Quantization table 0x%02x was not defined") +JMESSAGE(JERR_NO_SOI, "Not a JPEG file: starts with 0x%02x 0x%02x") +JMESSAGE(JERR_OUT_OF_MEMORY, "Insufficient memory (case %d)") +JMESSAGE(JERR_QUANT_COMPONENTS, + "Cannot quantize more than %d color components") +JMESSAGE(JERR_QUANT_FEW_COLORS, "Cannot quantize to fewer than %d colors") +JMESSAGE(JERR_QUANT_MANY_COLORS, "Cannot quantize to more than %d colors") +JMESSAGE(JERR_SOF_DUPLICATE, "Invalid JPEG file structure: two SOF markers") +JMESSAGE(JERR_SOF_NO_SOS, "Invalid JPEG file structure: missing SOS marker") +JMESSAGE(JERR_SOF_UNSUPPORTED, "Unsupported JPEG process: SOF type 0x%02x") +JMESSAGE(JERR_SOI_DUPLICATE, "Invalid JPEG file structure: two SOI markers") +JMESSAGE(JERR_SOS_NO_SOF, "Invalid JPEG file structure: SOS before SOF") +JMESSAGE(JERR_TFILE_CREATE, "Failed to create temporary file %s") +JMESSAGE(JERR_TFILE_READ, "Read failed on temporary file") +JMESSAGE(JERR_TFILE_SEEK, "Seek failed on temporary file") +JMESSAGE(JERR_TFILE_WRITE, + "Write failed on temporary file --- out of disk space?") +JMESSAGE(JERR_TOO_LITTLE_DATA, "Application transferred too few scanlines") +JMESSAGE(JERR_UNKNOWN_MARKER, "Unsupported marker type 0x%02x") +JMESSAGE(JERR_VIRTUAL_BUG, "Virtual array controller messed up") +JMESSAGE(JERR_WIDTH_OVERFLOW, "Image too wide for this implementation") +JMESSAGE(JERR_XMS_READ, "Read from XMS failed") +JMESSAGE(JERR_XMS_WRITE, "Write to XMS failed") +JMESSAGE(JMSG_COPYRIGHT, JCOPYRIGHT) +JMESSAGE(JMSG_VERSION, JVERSION) +JMESSAGE(JTRC_16BIT_TABLES, + "Caution: quantization tables are too coarse for baseline JPEG") +JMESSAGE(JTRC_ADOBE, + "Adobe APP14 marker: version %d, flags 0x%04x 0x%04x, transform %d") +JMESSAGE(JTRC_APP0, "Unknown APP0 marker (not JFIF), length %u") +JMESSAGE(JTRC_APP14, "Unknown APP14 marker (not Adobe), length %u") +JMESSAGE(JTRC_DAC, "Define Arithmetic Table 0x%02x: 0x%02x") +JMESSAGE(JTRC_DHT, "Define Huffman Table 0x%02x") +JMESSAGE(JTRC_DQT, "Define Quantization Table %d precision %d") +JMESSAGE(JTRC_DRI, "Define Restart Interval %u") +JMESSAGE(JTRC_EMS_CLOSE, "Freed EMS handle %u") +JMESSAGE(JTRC_EMS_OPEN, "Obtained EMS handle %u") +JMESSAGE(JTRC_EOI, "End Of Image") +JMESSAGE(JTRC_HUFFBITS, " %3d %3d %3d %3d %3d %3d %3d %3d") +JMESSAGE(JTRC_JFIF, "JFIF APP0 marker: version %d.%02d, density %dx%d %d") +JMESSAGE(JTRC_JFIF_BADTHUMBNAILSIZE, + "Warning: thumbnail image size does not match data length %u") +JMESSAGE(JTRC_JFIF_EXTENSION, + "JFIF extension marker: type 0x%02x, length %u") +JMESSAGE(JTRC_JFIF_THUMBNAIL, " with %d x %d thumbnail image") +JMESSAGE(JTRC_MISC_MARKER, "Miscellaneous marker 0x%02x, length %u") +JMESSAGE(JTRC_PARMLESS_MARKER, "Unexpected marker 0x%02x") +JMESSAGE(JTRC_QUANTVALS, " %4u %4u %4u %4u %4u %4u %4u %4u") +JMESSAGE(JTRC_QUANT_3_NCOLORS, "Quantizing to %d = %d*%d*%d colors") +JMESSAGE(JTRC_QUANT_NCOLORS, "Quantizing to %d colors") +JMESSAGE(JTRC_QUANT_SELECTED, "Selected %d colors for quantization") +JMESSAGE(JTRC_RECOVERY_ACTION, "At marker 0x%02x, recovery action %d") +JMESSAGE(JTRC_RST, "RST%d") +JMESSAGE(JTRC_SMOOTH_NOTIMPL, + "Smoothing not supported with nonstandard sampling ratios") +JMESSAGE(JTRC_SOF, "Start Of Frame 0x%02x: width=%u, height=%u, components=%d") +JMESSAGE(JTRC_SOF_COMPONENT, " Component %d: %dhx%dv q=%d") +JMESSAGE(JTRC_SOI, "Start of Image") +JMESSAGE(JTRC_SOS, "Start Of Scan: %d components") +JMESSAGE(JTRC_SOS_COMPONENT, " Component %d: dc=%d ac=%d") +JMESSAGE(JTRC_SOS_PARAMS, " Ss=%d, Se=%d, Ah=%d, Al=%d") +JMESSAGE(JTRC_TFILE_CLOSE, "Closed temporary file %s") +JMESSAGE(JTRC_TFILE_OPEN, "Opened temporary file %s") +JMESSAGE(JTRC_THUMB_JPEG, + "JFIF extension marker: JPEG-compressed thumbnail image, length %u") +JMESSAGE(JTRC_THUMB_PALETTE, + "JFIF extension marker: palette thumbnail image, length %u") +JMESSAGE(JTRC_THUMB_RGB, + "JFIF extension marker: RGB thumbnail image, length %u") +JMESSAGE(JTRC_UNKNOWN_IDS, + "Unrecognized component IDs %d %d %d, assuming YCbCr") +JMESSAGE(JTRC_XMS_CLOSE, "Freed XMS handle %u") +JMESSAGE(JTRC_XMS_OPEN, "Obtained XMS handle %u") +JMESSAGE(JWRN_ADOBE_XFORM, "Unknown Adobe color transform code %d") +JMESSAGE(JWRN_ARITH_BAD_CODE, "Corrupt JPEG data: bad arithmetic code") +JMESSAGE(JWRN_BOGUS_PROGRESSION, + "Inconsistent progression sequence for component %d coefficient %d") +JMESSAGE(JWRN_EXTRANEOUS_DATA, + "Corrupt JPEG data: %u extraneous bytes before marker 0x%02x") +JMESSAGE(JWRN_HIT_MARKER, "Corrupt JPEG data: premature end of data segment") +JMESSAGE(JWRN_HUFF_BAD_CODE, "Corrupt JPEG data: bad Huffman code") +JMESSAGE(JWRN_JFIF_MAJOR, "Warning: unknown JFIF revision number %d.%02d") +JMESSAGE(JWRN_JPEG_EOF, "Premature end of JPEG file") +JMESSAGE(JWRN_MUST_RESYNC, + "Corrupt JPEG data: found marker 0x%02x instead of RST%d") +JMESSAGE(JWRN_NOT_SEQUENTIAL, "Invalid SOS parameters for sequential JPEG") +JMESSAGE(JWRN_TOO_MUCH_DATA, "Application transferred too many scanlines") + +#ifdef JMAKE_ENUM_LIST + + JMSG_LASTMSGCODE +} J_MESSAGE_CODE; + +#undef JMAKE_ENUM_LIST +#endif /* JMAKE_ENUM_LIST */ + +/* Zap JMESSAGE macro so that future re-inclusions do nothing by default */ +#undef JMESSAGE + + +#ifndef JERROR_H +#define JERROR_H + +/* Macros to simplify using the error and trace message stuff */ +/* The first parameter is either type of cinfo pointer */ + +/* Fatal errors (print message and exit) */ +#define ERREXIT(cinfo,code) \ + ((cinfo)->err->msg_code = (code), \ + (*(cinfo)->err->error_exit) ((j_common_ptr) (cinfo))) +#define ERREXIT1(cinfo,code,p1) \ + ((cinfo)->err->msg_code = (code), \ + (cinfo)->err->msg_parm.i[0] = (p1), \ + (*(cinfo)->err->error_exit) ((j_common_ptr) (cinfo))) +#define ERREXIT2(cinfo,code,p1,p2) \ + ((cinfo)->err->msg_code = (code), \ + (cinfo)->err->msg_parm.i[0] = (p1), \ + (cinfo)->err->msg_parm.i[1] = (p2), \ + (*(cinfo)->err->error_exit) ((j_common_ptr) (cinfo))) +#define ERREXIT3(cinfo,code,p1,p2,p3) \ + ((cinfo)->err->msg_code = (code), \ + (cinfo)->err->msg_parm.i[0] = (p1), \ + (cinfo)->err->msg_parm.i[1] = (p2), \ + (cinfo)->err->msg_parm.i[2] = (p3), \ + (*(cinfo)->err->error_exit) ((j_common_ptr) (cinfo))) +#define ERREXIT4(cinfo,code,p1,p2,p3,p4) \ + ((cinfo)->err->msg_code = (code), \ + (cinfo)->err->msg_parm.i[0] = (p1), \ + (cinfo)->err->msg_parm.i[1] = (p2), \ + (cinfo)->err->msg_parm.i[2] = (p3), \ + (cinfo)->err->msg_parm.i[3] = (p4), \ + (*(cinfo)->err->error_exit) ((j_common_ptr) (cinfo))) +#define ERREXIT6(cinfo,code,p1,p2,p3,p4,p5,p6) \ + ((cinfo)->err->msg_code = (code), \ + (cinfo)->err->msg_parm.i[0] = (p1), \ + (cinfo)->err->msg_parm.i[1] = (p2), \ + (cinfo)->err->msg_parm.i[2] = (p3), \ + (cinfo)->err->msg_parm.i[3] = (p4), \ + (cinfo)->err->msg_parm.i[4] = (p5), \ + (cinfo)->err->msg_parm.i[5] = (p6), \ + (*(cinfo)->err->error_exit) ((j_common_ptr) (cinfo))) +#define ERREXITS(cinfo,code,str) \ + ((cinfo)->err->msg_code = (code), \ + strncpy((cinfo)->err->msg_parm.s, (str), JMSG_STR_PARM_MAX), \ + (*(cinfo)->err->error_exit) ((j_common_ptr) (cinfo))) + +#define MAKESTMT(stuff) do { stuff } while (0) + +/* Nonfatal errors (we can keep going, but the data is probably corrupt) */ +#define WARNMS(cinfo,code) \ + ((cinfo)->err->msg_code = (code), \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), -1)) +#define WARNMS1(cinfo,code,p1) \ + ((cinfo)->err->msg_code = (code), \ + (cinfo)->err->msg_parm.i[0] = (p1), \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), -1)) +#define WARNMS2(cinfo,code,p1,p2) \ + ((cinfo)->err->msg_code = (code), \ + (cinfo)->err->msg_parm.i[0] = (p1), \ + (cinfo)->err->msg_parm.i[1] = (p2), \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), -1)) + +/* Informational/debugging messages */ +#define TRACEMS(cinfo,lvl,code) \ + ((cinfo)->err->msg_code = (code), \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), (lvl))) +#define TRACEMS1(cinfo,lvl,code,p1) \ + ((cinfo)->err->msg_code = (code), \ + (cinfo)->err->msg_parm.i[0] = (p1), \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), (lvl))) +#define TRACEMS2(cinfo,lvl,code,p1,p2) \ + ((cinfo)->err->msg_code = (code), \ + (cinfo)->err->msg_parm.i[0] = (p1), \ + (cinfo)->err->msg_parm.i[1] = (p2), \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), (lvl))) +#define TRACEMS3(cinfo,lvl,code,p1,p2,p3) \ + MAKESTMT(int * _mp = (cinfo)->err->msg_parm.i; \ + _mp[0] = (p1); _mp[1] = (p2); _mp[2] = (p3); \ + (cinfo)->err->msg_code = (code); \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), (lvl)); ) +#define TRACEMS4(cinfo,lvl,code,p1,p2,p3,p4) \ + MAKESTMT(int * _mp = (cinfo)->err->msg_parm.i; \ + _mp[0] = (p1); _mp[1] = (p2); _mp[2] = (p3); _mp[3] = (p4); \ + (cinfo)->err->msg_code = (code); \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), (lvl)); ) +#define TRACEMS5(cinfo,lvl,code,p1,p2,p3,p4,p5) \ + MAKESTMT(int * _mp = (cinfo)->err->msg_parm.i; \ + _mp[0] = (p1); _mp[1] = (p2); _mp[2] = (p3); _mp[3] = (p4); \ + _mp[4] = (p5); \ + (cinfo)->err->msg_code = (code); \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), (lvl)); ) +#define TRACEMS8(cinfo,lvl,code,p1,p2,p3,p4,p5,p6,p7,p8) \ + MAKESTMT(int * _mp = (cinfo)->err->msg_parm.i; \ + _mp[0] = (p1); _mp[1] = (p2); _mp[2] = (p3); _mp[3] = (p4); \ + _mp[4] = (p5); _mp[5] = (p6); _mp[6] = (p7); _mp[7] = (p8); \ + (cinfo)->err->msg_code = (code); \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), (lvl)); ) +#define TRACEMSS(cinfo,lvl,code,str) \ + ((cinfo)->err->msg_code = (code), \ + strncpy((cinfo)->err->msg_parm.s, (str), JMSG_STR_PARM_MAX), \ + (*(cinfo)->err->emit_message) ((j_common_ptr) (cinfo), (lvl))) + +#endif /* JERROR_H */ diff --git a/portlibs/include/jmorecfg.h b/portlibs/include/jmorecfg.h new file mode 100644 index 00000000..fa0de04b --- /dev/null +++ b/portlibs/include/jmorecfg.h @@ -0,0 +1,370 @@ +/* + * jmorecfg.h + * + * Copyright (C) 1991-1997, Thomas G. Lane. + * Modified 1997-2009 by Guido Vollbeding. + * This file is part of the Independent JPEG Group's software. + * For conditions of distribution and use, see the accompanying README file. + * + * This file contains additional configuration options that customize the + * JPEG software for special applications or support machine-dependent + * optimizations. Most users will not need to touch this file. + */ + + +/* + * Define BITS_IN_JSAMPLE as either + * 8 for 8-bit sample values (the usual setting) + * 12 for 12-bit sample values + * Only 8 and 12 are legal data precisions for lossy JPEG according to the + * JPEG standard, and the IJG code does not support anything else! + * We do not support run-time selection of data precision, sorry. + */ + +#define BITS_IN_JSAMPLE 8 /* use 8 or 12 */ + + +/* + * Maximum number of components (color channels) allowed in JPEG image. + * To meet the letter of the JPEG spec, set this to 255. However, darn + * few applications need more than 4 channels (maybe 5 for CMYK + alpha + * mask). We recommend 10 as a reasonable compromise; use 4 if you are + * really short on memory. (Each allowed component costs a hundred or so + * bytes of storage, whether actually used in an image or not.) + */ + +#define MAX_COMPONENTS 10 /* maximum number of image components */ + + +/* + * Basic data types. + * You may need to change these if you have a machine with unusual data + * type sizes; for example, "char" not 8 bits, "short" not 16 bits, + * or "long" not 32 bits. We don't care whether "int" is 16 or 32 bits, + * but it had better be at least 16. + */ + +/* Representation of a single sample (pixel element value). + * We frequently allocate large arrays of these, so it's important to keep + * them small. But if you have memory to burn and access to char or short + * arrays is very slow on your hardware, you might want to change these. + */ + +#if BITS_IN_JSAMPLE == 8 +/* JSAMPLE should be the smallest type that will hold the values 0..255. + * You can use a signed char by having GETJSAMPLE mask it with 0xFF. + */ + +#ifdef HAVE_UNSIGNED_CHAR + +typedef unsigned char JSAMPLE; +#define GETJSAMPLE(value) ((int) (value)) + +#else /* not HAVE_UNSIGNED_CHAR */ + +typedef char JSAMPLE; +#ifdef CHAR_IS_UNSIGNED +#define GETJSAMPLE(value) ((int) (value)) +#else +#define GETJSAMPLE(value) ((int) (value) & 0xFF) +#endif /* CHAR_IS_UNSIGNED */ + +#endif /* HAVE_UNSIGNED_CHAR */ + +#define MAXJSAMPLE 255 +#define CENTERJSAMPLE 128 + +#endif /* BITS_IN_JSAMPLE == 8 */ + + +#if BITS_IN_JSAMPLE == 12 +/* JSAMPLE should be the smallest type that will hold the values 0..4095. + * On nearly all machines "short" will do nicely. + */ + +typedef short JSAMPLE; +#define GETJSAMPLE(value) ((int) (value)) + +#define MAXJSAMPLE 4095 +#define CENTERJSAMPLE 2048 + +#endif /* BITS_IN_JSAMPLE == 12 */ + + +/* Representation of a DCT frequency coefficient. + * This should be a signed value of at least 16 bits; "short" is usually OK. + * Again, we allocate large arrays of these, but you can change to int + * if you have memory to burn and "short" is really slow. + */ + +typedef short JCOEF; + + +/* Compressed datastreams are represented as arrays of JOCTET. + * These must be EXACTLY 8 bits wide, at least once they are written to + * external storage. Note that when using the stdio data source/destination + * managers, this is also the data type passed to fread/fwrite. + */ + +#ifdef HAVE_UNSIGNED_CHAR + +typedef unsigned char JOCTET; +#define GETJOCTET(value) (value) + +#else /* not HAVE_UNSIGNED_CHAR */ + +typedef char JOCTET; +#ifdef CHAR_IS_UNSIGNED +#define GETJOCTET(value) (value) +#else +#define GETJOCTET(value) ((value) & 0xFF) +#endif /* CHAR_IS_UNSIGNED */ + +#endif /* HAVE_UNSIGNED_CHAR */ + + +/* These typedefs are used for various table entries and so forth. + * They must be at least as wide as specified; but making them too big + * won't cost a huge amount of memory, so we don't provide special + * extraction code like we did for JSAMPLE. (In other words, these + * typedefs live at a different point on the speed/space tradeoff curve.) + */ + +/* UINT8 must hold at least the values 0..255. */ + +#ifdef HAVE_UNSIGNED_CHAR +typedef unsigned char UINT8; +#else /* not HAVE_UNSIGNED_CHAR */ +#ifdef CHAR_IS_UNSIGNED +typedef char UINT8; +#else /* not CHAR_IS_UNSIGNED */ +typedef short UINT8; +#endif /* CHAR_IS_UNSIGNED */ +#endif /* HAVE_UNSIGNED_CHAR */ + +/* UINT16 must hold at least the values 0..65535. */ + +#ifdef HAVE_UNSIGNED_SHORT +typedef unsigned short UINT16; +#else /* not HAVE_UNSIGNED_SHORT */ +typedef unsigned int UINT16; +#endif /* HAVE_UNSIGNED_SHORT */ + +/* INT16 must hold at least the values -32768..32767. */ + +#ifndef XMD_H /* X11/xmd.h correctly defines INT16 */ +typedef short INT16; +#endif + +/* INT32 must hold at least signed 32-bit values. */ + +#ifndef XMD_H /* X11/xmd.h correctly defines INT32 */ +#ifndef _BASETSD_H_ /* Microsoft defines it in basetsd.h */ +#ifndef QGLOBAL_H /* Qt defines it in qglobal.h */ +typedef long INT32; +#endif +#endif +#endif + +/* Datatype used for image dimensions. The JPEG standard only supports + * images up to 64K*64K due to 16-bit fields in SOF markers. Therefore + * "unsigned int" is sufficient on all machines. However, if you need to + * handle larger images and you don't mind deviating from the spec, you + * can change this datatype. + */ + +typedef unsigned int JDIMENSION; + +#define JPEG_MAX_DIMENSION 65500L /* a tad under 64K to prevent overflows */ + + +/* These macros are used in all function definitions and extern declarations. + * You could modify them if you need to change function linkage conventions; + * in particular, you'll need to do that to make the library a Windows DLL. + * Another application is to make all functions global for use with debuggers + * or code profilers that require it. + */ + +/* a function called through method pointers: */ +#define METHODDEF(type) static type +/* a function used only in its module: */ +#define LOCAL(type) static type +/* a function referenced thru EXTERNs: */ +#define GLOBAL(type) type +/* a reference to a GLOBAL function: */ +#define EXTERN(type) extern type + + +/* This macro is used to declare a "method", that is, a function pointer. + * We want to supply prototype parameters if the compiler can cope. + * Note that the arglist parameter must be parenthesized! + * Again, you can customize this if you need special linkage keywords. + */ + +#ifdef HAVE_PROTOTYPES +#define JMETHOD(type,methodname,arglist) type (*methodname) arglist +#else +#define JMETHOD(type,methodname,arglist) type (*methodname) () +#endif + + +/* Here is the pseudo-keyword for declaring pointers that must be "far" + * on 80x86 machines. Most of the specialized coding for 80x86 is handled + * by just saying "FAR *" where such a pointer is needed. In a few places + * explicit coding is needed; see uses of the NEED_FAR_POINTERS symbol. + */ + +#ifndef FAR +#ifdef NEED_FAR_POINTERS +#define FAR far +#else +#define FAR +#endif +#endif + + +/* + * On a few systems, type boolean and/or its values FALSE, TRUE may appear + * in standard header files. Or you may have conflicts with application- + * specific header files that you want to include together with these files. + * Defining HAVE_BOOLEAN before including jpeglib.h should make it work. + */ + +#ifndef HAVE_BOOLEAN +// typedef int boolean; +typedef unsigned char boolean; +#endif +#ifndef FALSE /* in case these macros already exist */ +#define FALSE 0 /* values of boolean */ +#endif +#ifndef TRUE +#define TRUE 1 +#endif + + +/* + * The remaining options affect code selection within the JPEG library, + * but they don't need to be visible to most applications using the library. + * To minimize application namespace pollution, the symbols won't be + * defined unless JPEG_INTERNALS or JPEG_INTERNAL_OPTIONS has been defined. + */ + +#ifdef JPEG_INTERNALS +#define JPEG_INTERNAL_OPTIONS +#endif + +#ifdef JPEG_INTERNAL_OPTIONS + + +/* + * These defines indicate whether to include various optional functions. + * Undefining some of these symbols will produce a smaller but less capable + * library. Note that you can leave certain source files out of the + * compilation/linking process if you've #undef'd the corresponding symbols. + * (You may HAVE to do that if your compiler doesn't like null source files.) + */ + +/* Capability options common to encoder and decoder: */ + +#define DCT_ISLOW_SUPPORTED /* slow but accurate integer algorithm */ +#define DCT_IFAST_SUPPORTED /* faster, less accurate integer method */ +#define DCT_FLOAT_SUPPORTED /* floating-point: accurate, fast on fast HW */ + +/* Encoder capability options: */ + +#define C_ARITH_CODING_SUPPORTED /* Arithmetic coding back end? */ +#define C_MULTISCAN_FILES_SUPPORTED /* Multiple-scan JPEG files? */ +#define C_PROGRESSIVE_SUPPORTED /* Progressive JPEG? (Requires MULTISCAN)*/ +#define DCT_SCALING_SUPPORTED /* Input rescaling via DCT? (Requires DCT_ISLOW)*/ +#define ENTROPY_OPT_SUPPORTED /* Optimization of entropy coding parms? */ +/* Note: if you selected 12-bit data precision, it is dangerous to turn off + * ENTROPY_OPT_SUPPORTED. The standard Huffman tables are only good for 8-bit + * precision, so jchuff.c normally uses entropy optimization to compute + * usable tables for higher precision. If you don't want to do optimization, + * you'll have to supply different default Huffman tables. + * The exact same statements apply for progressive JPEG: the default tables + * don't work for progressive mode. (This may get fixed, however.) + */ +#define INPUT_SMOOTHING_SUPPORTED /* Input image smoothing option? */ + +/* Decoder capability options: */ + +#define D_ARITH_CODING_SUPPORTED /* Arithmetic coding back end? */ +#define D_MULTISCAN_FILES_SUPPORTED /* Multiple-scan JPEG files? */ +#define D_PROGRESSIVE_SUPPORTED /* Progressive JPEG? (Requires MULTISCAN)*/ +#define IDCT_SCALING_SUPPORTED /* Output rescaling via IDCT? */ +#define SAVE_MARKERS_SUPPORTED /* jpeg_save_markers() needed? */ +#define BLOCK_SMOOTHING_SUPPORTED /* Block smoothing? (Progressive only) */ +#undef UPSAMPLE_SCALING_SUPPORTED /* Output rescaling at upsample stage? */ +#define UPSAMPLE_MERGING_SUPPORTED /* Fast path for sloppy upsampling? */ +#define QUANT_1PASS_SUPPORTED /* 1-pass color quantization? */ +#define QUANT_2PASS_SUPPORTED /* 2-pass color quantization? */ + +/* more capability options later, no doubt */ + + +/* + * Ordering of RGB data in scanlines passed to or from the application. + * If your application wants to deal with data in the order B,G,R, just + * change these macros. You can also deal with formats such as R,G,B,X + * (one extra byte per pixel) by changing RGB_PIXELSIZE. Note that changing + * the offsets will also change the order in which colormap data is organized. + * RESTRICTIONS: + * 1. The sample applications cjpeg,djpeg do NOT support modified RGB formats. + * 2. These macros only affect RGB<=>YCbCr color conversion, so they are not + * useful if you are using JPEG color spaces other than YCbCr or grayscale. + * 3. The color quantizer modules will not behave desirably if RGB_PIXELSIZE + * is not 3 (they don't understand about dummy color components!). So you + * can't use color quantization if you change that value. + */ + +#define RGB_RED 0 /* Offset of Red in an RGB scanline element */ +#define RGB_GREEN 1 /* Offset of Green */ +#define RGB_BLUE 2 /* Offset of Blue */ +#define RGB_PIXELSIZE 3 /* JSAMPLEs per RGB scanline element */ + + +/* Definitions for speed-related optimizations. */ + + +/* If your compiler supports inline functions, define INLINE + * as the inline keyword; otherwise define it as empty. + */ + +#ifndef INLINE +#ifdef __GNUC__ /* for instance, GNU C knows about inline */ +#define INLINE __inline__ +#endif +#ifndef INLINE +#define INLINE /* default is to define it as empty */ +#endif +#endif + + +/* On some machines (notably 68000 series) "int" is 32 bits, but multiplying + * two 16-bit shorts is faster than multiplying two ints. Define MULTIPLIER + * as short on such a machine. MULTIPLIER must be at least 16 bits wide. + */ + +#ifndef MULTIPLIER +#define MULTIPLIER int /* type for fastest integer multiply */ +#endif + + +/* FAST_FLOAT should be either float or double, whichever is done faster + * by your compiler. (Note that this type is only used in the floating point + * DCT routines, so it only matters if you've defined DCT_FLOAT_SUPPORTED.) + * Typically, float is faster in ANSI C compilers, while double is faster in + * pre-ANSI compilers (because they insist on converting to double anyway). + * The code below therefore chooses float if we have ANSI-style prototypes. + */ + +#ifndef FAST_FLOAT +#ifdef HAVE_PROTOTYPES +#define FAST_FLOAT float +#else +#define FAST_FLOAT double +#endif +#endif + +#endif /* JPEG_INTERNAL_OPTIONS */ diff --git a/portlibs/include/jpeglib.h b/portlibs/include/jpeglib.h new file mode 100644 index 00000000..97d07f25 --- /dev/null +++ b/portlibs/include/jpeglib.h @@ -0,0 +1,1138 @@ +/* + * jpeglib.h + * + * Copyright (C) 1991-1998, Thomas G. Lane. + * Modified 2002-2009 by Guido Vollbeding. + * This file is part of the Independent JPEG Group's software. + * For conditions of distribution and use, see the accompanying README file. + * + * This file defines the application interface for the JPEG library. + * Most applications using the library need only include this file, + * and perhaps jerror.h if they want to know the exact error codes. + */ + +#ifndef JPEGLIB_H +#define JPEGLIB_H + +/* + * First we include the configuration files that record how this + * installation of the JPEG library is set up. jconfig.h can be + * generated automatically for many systems. jmorecfg.h contains + * manual configuration options that most people need not worry about. + */ + +#ifndef JCONFIG_INCLUDED /* in case jinclude.h already did */ +#include "jconfig.h" /* widely used configuration options */ +#endif +#include "jmorecfg.h" /* seldom changed options */ + + +#ifdef __cplusplus +#ifndef DONT_USE_EXTERN_C +extern "C" { +#endif +#endif + +/* Version ID for the JPEG library. + * Might be useful for tests like "#if JPEG_LIB_VERSION >= 70". + */ + +#define JPEG_LIB_VERSION 70 /* Version 7.0 */ + + +/* Various constants determining the sizes of things. + * All of these are specified by the JPEG standard, so don't change them + * if you want to be compatible. + */ + +#define DCTSIZE 8 /* The basic DCT block is 8x8 samples */ +#define DCTSIZE2 64 /* DCTSIZE squared; # of elements in a block */ +#define NUM_QUANT_TBLS 4 /* Quantization tables are numbered 0..3 */ +#define NUM_HUFF_TBLS 4 /* Huffman tables are numbered 0..3 */ +#define NUM_ARITH_TBLS 16 /* Arith-coding tables are numbered 0..15 */ +#define MAX_COMPS_IN_SCAN 4 /* JPEG limit on # of components in one scan */ +#define MAX_SAMP_FACTOR 4 /* JPEG limit on sampling factors */ +/* Unfortunately, some bozo at Adobe saw no reason to be bound by the standard; + * the PostScript DCT filter can emit files with many more than 10 blocks/MCU. + * If you happen to run across such a file, you can up D_MAX_BLOCKS_IN_MCU + * to handle it. We even let you do this from the jconfig.h file. However, + * we strongly discourage changing C_MAX_BLOCKS_IN_MCU; just because Adobe + * sometimes emits noncompliant files doesn't mean you should too. + */ +#define C_MAX_BLOCKS_IN_MCU 10 /* compressor's limit on blocks per MCU */ +#ifndef D_MAX_BLOCKS_IN_MCU +#define D_MAX_BLOCKS_IN_MCU 10 /* decompressor's limit on blocks per MCU */ +#endif + + +/* Data structures for images (arrays of samples and of DCT coefficients). + * On 80x86 machines, the image arrays are too big for near pointers, + * but the pointer arrays can fit in near memory. + */ + +typedef JSAMPLE FAR *JSAMPROW; /* ptr to one image row of pixel samples. */ +typedef JSAMPROW *JSAMPARRAY; /* ptr to some rows (a 2-D sample array) */ +typedef JSAMPARRAY *JSAMPIMAGE; /* a 3-D sample array: top index is color */ + +typedef JCOEF JBLOCK[DCTSIZE2]; /* one block of coefficients */ +typedef JBLOCK FAR *JBLOCKROW; /* pointer to one row of coefficient blocks */ +typedef JBLOCKROW *JBLOCKARRAY; /* a 2-D array of coefficient blocks */ +typedef JBLOCKARRAY *JBLOCKIMAGE; /* a 3-D array of coefficient blocks */ + +typedef JCOEF FAR *JCOEFPTR; /* useful in a couple of places */ + + +/* Types for JPEG compression parameters and working tables. */ + + +/* DCT coefficient quantization tables. */ + +typedef struct { + /* This array gives the coefficient quantizers in natural array order + * (not the zigzag order in which they are stored in a JPEG DQT marker). + * CAUTION: IJG versions prior to v6a kept this array in zigzag order. + */ + UINT16 quantval[DCTSIZE2]; /* quantization step for each coefficient */ + /* This field is used only during compression. It's initialized FALSE when + * the table is created, and set TRUE when it's been output to the file. + * You could suppress output of a table by setting this to TRUE. + * (See jpeg_suppress_tables for an example.) + */ + boolean sent_table; /* TRUE when table has been output */ +} JQUANT_TBL; + + +/* Huffman coding tables. */ + +typedef struct { + /* These two fields directly represent the contents of a JPEG DHT marker */ + UINT8 bits[17]; /* bits[k] = # of symbols with codes of */ + /* length k bits; bits[0] is unused */ + UINT8 huffval[256]; /* The symbols, in order of incr code length */ + /* This field is used only during compression. It's initialized FALSE when + * the table is created, and set TRUE when it's been output to the file. + * You could suppress output of a table by setting this to TRUE. + * (See jpeg_suppress_tables for an example.) + */ + boolean sent_table; /* TRUE when table has been output */ +} JHUFF_TBL; + + +/* Basic info about one component (color channel). */ + +typedef struct { + /* These values are fixed over the whole image. */ + /* For compression, they must be supplied by parameter setup; */ + /* for decompression, they are read from the SOF marker. */ + int component_id; /* identifier for this component (0..255) */ + int component_index; /* its index in SOF or cinfo->comp_info[] */ + int h_samp_factor; /* horizontal sampling factor (1..4) */ + int v_samp_factor; /* vertical sampling factor (1..4) */ + int quant_tbl_no; /* quantization table selector (0..3) */ + /* These values may vary between scans. */ + /* For compression, they must be supplied by parameter setup; */ + /* for decompression, they are read from the SOS marker. */ + /* The decompressor output side may not use these variables. */ + int dc_tbl_no; /* DC entropy table selector (0..3) */ + int ac_tbl_no; /* AC entropy table selector (0..3) */ + + /* Remaining fields should be treated as private by applications. */ + + /* These values are computed during compression or decompression startup: */ + /* Component's size in DCT blocks. + * Any dummy blocks added to complete an MCU are not counted; therefore + * these values do not depend on whether a scan is interleaved or not. + */ + JDIMENSION width_in_blocks; + JDIMENSION height_in_blocks; + /* Size of a DCT block in samples, + * reflecting any scaling we choose to apply during the DCT step. + * Values from 1 to 16 are supported. + * Note that different components may receive different DCT scalings. + */ + int DCT_h_scaled_size; + int DCT_v_scaled_size; + /* The downsampled dimensions are the component's actual, unpadded number + * of samples at the main buffer (preprocessing/compression interface); + * DCT scaling is included, so + * downsampled_width = ceil(image_width * Hi/Hmax * DCT_h_scaled_size/DCTSIZE) + * and similarly for height. + */ + JDIMENSION downsampled_width; /* actual width in samples */ + JDIMENSION downsampled_height; /* actual height in samples */ + /* This flag is used only for decompression. In cases where some of the + * components will be ignored (eg grayscale output from YCbCr image), + * we can skip most computations for the unused components. + */ + boolean component_needed; /* do we need the value of this component? */ + + /* These values are computed before starting a scan of the component. */ + /* The decompressor output side may not use these variables. */ + int MCU_width; /* number of blocks per MCU, horizontally */ + int MCU_height; /* number of blocks per MCU, vertically */ + int MCU_blocks; /* MCU_width * MCU_height */ + int MCU_sample_width; /* MCU width in samples, MCU_width*DCT_scaled_size */ + int last_col_width; /* # of non-dummy blocks across in last MCU */ + int last_row_height; /* # of non-dummy blocks down in last MCU */ + + /* Saved quantization table for component; NULL if none yet saved. + * See jdinput.c comments about the need for this information. + * This field is currently used only for decompression. + */ + JQUANT_TBL * quant_table; + + /* Private per-component storage for DCT or IDCT subsystem. */ + void * dct_table; +} jpeg_component_info; + + +/* The script for encoding a multiple-scan file is an array of these: */ + +typedef struct { + int comps_in_scan; /* number of components encoded in this scan */ + int component_index[MAX_COMPS_IN_SCAN]; /* their SOF/comp_info[] indexes */ + int Ss, Se; /* progressive JPEG spectral selection parms */ + int Ah, Al; /* progressive JPEG successive approx. parms */ +} jpeg_scan_info; + +/* The decompressor can save APPn and COM markers in a list of these: */ + +typedef struct jpeg_marker_struct FAR * jpeg_saved_marker_ptr; + +struct jpeg_marker_struct { + jpeg_saved_marker_ptr next; /* next in list, or NULL */ + UINT8 marker; /* marker code: JPEG_COM, or JPEG_APP0+n */ + unsigned int original_length; /* # bytes of data in the file */ + unsigned int data_length; /* # bytes of data saved at data[] */ + JOCTET FAR * data; /* the data contained in the marker */ + /* the marker length word is not counted in data_length or original_length */ +}; + +/* Known color spaces. */ + +typedef enum { + JCS_UNKNOWN, /* error/unspecified */ + JCS_GRAYSCALE, /* monochrome */ + JCS_RGB, /* red/green/blue */ + JCS_YCbCr, /* Y/Cb/Cr (also known as YUV) */ + JCS_CMYK, /* C/M/Y/K */ + JCS_YCCK /* Y/Cb/Cr/K */ +} J_COLOR_SPACE; + +/* DCT/IDCT algorithm options. */ + +typedef enum { + JDCT_ISLOW, /* slow but accurate integer algorithm */ + JDCT_IFAST, /* faster, less accurate integer method */ + JDCT_FLOAT /* floating-point: accurate, fast on fast HW */ +} J_DCT_METHOD; + +#ifndef JDCT_DEFAULT /* may be overridden in jconfig.h */ +#define JDCT_DEFAULT JDCT_ISLOW +#endif +#ifndef JDCT_FASTEST /* may be overridden in jconfig.h */ +#define JDCT_FASTEST JDCT_IFAST +#endif + +/* Dithering options for decompression. */ + +typedef enum { + JDITHER_NONE, /* no dithering */ + JDITHER_ORDERED, /* simple ordered dither */ + JDITHER_FS /* Floyd-Steinberg error diffusion dither */ +} J_DITHER_MODE; + + +/* Common fields between JPEG compression and decompression master structs. */ + +#define jpeg_common_fields \ + struct jpeg_error_mgr * err; /* Error handler module */\ + struct jpeg_memory_mgr * mem; /* Memory manager module */\ + struct jpeg_progress_mgr * progress; /* Progress monitor, or NULL if none */\ + void * client_data; /* Available for use by application */\ + boolean is_decompressor; /* So common code can tell which is which */\ + int global_state /* For checking call sequence validity */ + +/* Routines that are to be used by both halves of the library are declared + * to receive a pointer to this structure. There are no actual instances of + * jpeg_common_struct, only of jpeg_compress_struct and jpeg_decompress_struct. + */ +struct jpeg_common_struct { + jpeg_common_fields; /* Fields common to both master struct types */ + /* Additional fields follow in an actual jpeg_compress_struct or + * jpeg_decompress_struct. All three structs must agree on these + * initial fields! (This would be a lot cleaner in C++.) + */ +}; + +typedef struct jpeg_common_struct * j_common_ptr; +typedef struct jpeg_compress_struct * j_compress_ptr; +typedef struct jpeg_decompress_struct * j_decompress_ptr; + + +/* Master record for a compression instance */ + +struct jpeg_compress_struct { + jpeg_common_fields; /* Fields shared with jpeg_decompress_struct */ + + /* Destination for compressed data */ + struct jpeg_destination_mgr * dest; + + /* Description of source image --- these fields must be filled in by + * outer application before starting compression. in_color_space must + * be correct before you can even call jpeg_set_defaults(). + */ + + JDIMENSION image_width; /* input image width */ + JDIMENSION image_height; /* input image height */ + int input_components; /* # of color components in input image */ + J_COLOR_SPACE in_color_space; /* colorspace of input image */ + + double input_gamma; /* image gamma of input image */ + + /* Compression parameters --- these fields must be set before calling + * jpeg_start_compress(). We recommend calling jpeg_set_defaults() to + * initialize everything to reasonable defaults, then changing anything + * the application specifically wants to change. That way you won't get + * burnt when new parameters are added. Also note that there are several + * helper routines to simplify changing parameters. + */ + + unsigned int scale_num, scale_denom; /* fraction by which to scale image */ + + JDIMENSION jpeg_width; /* scaled JPEG image width */ + JDIMENSION jpeg_height; /* scaled JPEG image height */ + /* Dimensions of actual JPEG image that will be written to file, + * derived from input dimensions by scaling factors above. + * These fields are computed by jpeg_start_compress(). + * You can also use jpeg_calc_jpeg_dimensions() to determine these values + * in advance of calling jpeg_start_compress(). + */ + + int data_precision; /* bits of precision in image data */ + + int num_components; /* # of color components in JPEG image */ + J_COLOR_SPACE jpeg_color_space; /* colorspace of JPEG image */ + + jpeg_component_info * comp_info; + /* comp_info[i] describes component that appears i'th in SOF */ + + JQUANT_TBL * quant_tbl_ptrs[NUM_QUANT_TBLS]; + int q_scale_factor[NUM_QUANT_TBLS]; + /* ptrs to coefficient quantization tables, or NULL if not defined, + * and corresponding scale factors (percentage, initialized 100). + */ + + JHUFF_TBL * dc_huff_tbl_ptrs[NUM_HUFF_TBLS]; + JHUFF_TBL * ac_huff_tbl_ptrs[NUM_HUFF_TBLS]; + /* ptrs to Huffman coding tables, or NULL if not defined */ + + UINT8 arith_dc_L[NUM_ARITH_TBLS]; /* L values for DC arith-coding tables */ + UINT8 arith_dc_U[NUM_ARITH_TBLS]; /* U values for DC arith-coding tables */ + UINT8 arith_ac_K[NUM_ARITH_TBLS]; /* Kx values for AC arith-coding tables */ + + int num_scans; /* # of entries in scan_info array */ + const jpeg_scan_info * scan_info; /* script for multi-scan file, or NULL */ + /* The default value of scan_info is NULL, which causes a single-scan + * sequential JPEG file to be emitted. To create a multi-scan file, + * set num_scans and scan_info to point to an array of scan definitions. + */ + + boolean raw_data_in; /* TRUE=caller supplies downsampled data */ + boolean arith_code; /* TRUE=arithmetic coding, FALSE=Huffman */ + boolean optimize_coding; /* TRUE=optimize entropy encoding parms */ + boolean CCIR601_sampling; /* TRUE=first samples are cosited */ + boolean do_fancy_downsampling; /* TRUE=apply fancy downsampling */ + int smoothing_factor; /* 1..100, or 0 for no input smoothing */ + J_DCT_METHOD dct_method; /* DCT algorithm selector */ + + /* The restart interval can be specified in absolute MCUs by setting + * restart_interval, or in MCU rows by setting restart_in_rows + * (in which case the correct restart_interval will be figured + * for each scan). + */ + unsigned int restart_interval; /* MCUs per restart, or 0 for no restart */ + int restart_in_rows; /* if > 0, MCU rows per restart interval */ + + /* Parameters controlling emission of special markers. */ + + boolean write_JFIF_header; /* should a JFIF marker be written? */ + UINT8 JFIF_major_version; /* What to write for the JFIF version number */ + UINT8 JFIF_minor_version; + /* These three values are not used by the JPEG code, merely copied */ + /* into the JFIF APP0 marker. density_unit can be 0 for unknown, */ + /* 1 for dots/inch, or 2 for dots/cm. Note that the pixel aspect */ + /* ratio is defined by X_density/Y_density even when density_unit=0. */ + UINT8 density_unit; /* JFIF code for pixel size units */ + UINT16 X_density; /* Horizontal pixel density */ + UINT16 Y_density; /* Vertical pixel density */ + boolean write_Adobe_marker; /* should an Adobe marker be written? */ + + /* State variable: index of next scanline to be written to + * jpeg_write_scanlines(). Application may use this to control its + * processing loop, e.g., "while (next_scanline < image_height)". + */ + + JDIMENSION next_scanline; /* 0 .. image_height-1 */ + + /* Remaining fields are known throughout compressor, but generally + * should not be touched by a surrounding application. + */ + + /* + * These fields are computed during compression startup + */ + boolean progressive_mode; /* TRUE if scan script uses progressive mode */ + int max_h_samp_factor; /* largest h_samp_factor */ + int max_v_samp_factor; /* largest v_samp_factor */ + + int min_DCT_h_scaled_size; /* smallest DCT_h_scaled_size of any component */ + int min_DCT_v_scaled_size; /* smallest DCT_v_scaled_size of any component */ + + JDIMENSION total_iMCU_rows; /* # of iMCU rows to be input to coef ctlr */ + /* The coefficient controller receives data in units of MCU rows as defined + * for fully interleaved scans (whether the JPEG file is interleaved or not). + * There are v_samp_factor * DCTSIZE sample rows of each component in an + * "iMCU" (interleaved MCU) row. + */ + + /* + * These fields are valid during any one scan. + * They describe the components and MCUs actually appearing in the scan. + */ + int comps_in_scan; /* # of JPEG components in this scan */ + jpeg_component_info * cur_comp_info[MAX_COMPS_IN_SCAN]; + /* *cur_comp_info[i] describes component that appears i'th in SOS */ + + JDIMENSION MCUs_per_row; /* # of MCUs across the image */ + JDIMENSION MCU_rows_in_scan; /* # of MCU rows in the image */ + + int blocks_in_MCU; /* # of DCT blocks per MCU */ + int MCU_membership[C_MAX_BLOCKS_IN_MCU]; + /* MCU_membership[i] is index in cur_comp_info of component owning */ + /* i'th block in an MCU */ + + int Ss, Se, Ah, Al; /* progressive JPEG parameters for scan */ + + /* + * Links to compression subobjects (methods and private variables of modules) + */ + struct jpeg_comp_master * master; + struct jpeg_c_main_controller * main; + struct jpeg_c_prep_controller * prep; + struct jpeg_c_coef_controller * coef; + struct jpeg_marker_writer * marker; + struct jpeg_color_converter * cconvert; + struct jpeg_downsampler * downsample; + struct jpeg_forward_dct * fdct; + struct jpeg_entropy_encoder * entropy; + jpeg_scan_info * script_space; /* workspace for jpeg_simple_progression */ + int script_space_size; +}; + + +/* Master record for a decompression instance */ + +struct jpeg_decompress_struct { + jpeg_common_fields; /* Fields shared with jpeg_compress_struct */ + + /* Source of compressed data */ + struct jpeg_source_mgr * src; + + /* Basic description of image --- filled in by jpeg_read_header(). */ + /* Application may inspect these values to decide how to process image. */ + + JDIMENSION image_width; /* nominal image width (from SOF marker) */ + JDIMENSION image_height; /* nominal image height */ + int num_components; /* # of color components in JPEG image */ + J_COLOR_SPACE jpeg_color_space; /* colorspace of JPEG image */ + + /* Decompression processing parameters --- these fields must be set before + * calling jpeg_start_decompress(). Note that jpeg_read_header() initializes + * them to default values. + */ + + J_COLOR_SPACE out_color_space; /* colorspace for output */ + + unsigned int scale_num, scale_denom; /* fraction by which to scale image */ + + double output_gamma; /* image gamma wanted in output */ + + boolean buffered_image; /* TRUE=multiple output passes */ + boolean raw_data_out; /* TRUE=downsampled data wanted */ + + J_DCT_METHOD dct_method; /* IDCT algorithm selector */ + boolean do_fancy_upsampling; /* TRUE=apply fancy upsampling */ + boolean do_block_smoothing; /* TRUE=apply interblock smoothing */ + + boolean quantize_colors; /* TRUE=colormapped output wanted */ + /* the following are ignored if not quantize_colors: */ + J_DITHER_MODE dither_mode; /* type of color dithering to use */ + boolean two_pass_quantize; /* TRUE=use two-pass color quantization */ + int desired_number_of_colors; /* max # colors to use in created colormap */ + /* these are significant only in buffered-image mode: */ + boolean enable_1pass_quant; /* enable future use of 1-pass quantizer */ + boolean enable_external_quant;/* enable future use of external colormap */ + boolean enable_2pass_quant; /* enable future use of 2-pass quantizer */ + + /* Description of actual output image that will be returned to application. + * These fields are computed by jpeg_start_decompress(). + * You can also use jpeg_calc_output_dimensions() to determine these values + * in advance of calling jpeg_start_decompress(). + */ + + JDIMENSION output_width; /* scaled image width */ + JDIMENSION output_height; /* scaled image height */ + int out_color_components; /* # of color components in out_color_space */ + int output_components; /* # of color components returned */ + /* output_components is 1 (a colormap index) when quantizing colors; + * otherwise it equals out_color_components. + */ + int rec_outbuf_height; /* min recommended height of scanline buffer */ + /* If the buffer passed to jpeg_read_scanlines() is less than this many rows + * high, space and time will be wasted due to unnecessary data copying. + * Usually rec_outbuf_height will be 1 or 2, at most 4. + */ + + /* When quantizing colors, the output colormap is described by these fields. + * The application can supply a colormap by setting colormap non-NULL before + * calling jpeg_start_decompress; otherwise a colormap is created during + * jpeg_start_decompress or jpeg_start_output. + * The map has out_color_components rows and actual_number_of_colors columns. + */ + int actual_number_of_colors; /* number of entries in use */ + JSAMPARRAY colormap; /* The color map as a 2-D pixel array */ + + /* State variables: these variables indicate the progress of decompression. + * The application may examine these but must not modify them. + */ + + /* Row index of next scanline to be read from jpeg_read_scanlines(). + * Application may use this to control its processing loop, e.g., + * "while (output_scanline < output_height)". + */ + JDIMENSION output_scanline; /* 0 .. output_height-1 */ + + /* Current input scan number and number of iMCU rows completed in scan. + * These indicate the progress of the decompressor input side. + */ + int input_scan_number; /* Number of SOS markers seen so far */ + JDIMENSION input_iMCU_row; /* Number of iMCU rows completed */ + + /* The "output scan number" is the notional scan being displayed by the + * output side. The decompressor will not allow output scan/row number + * to get ahead of input scan/row, but it can fall arbitrarily far behind. + */ + int output_scan_number; /* Nominal scan number being displayed */ + JDIMENSION output_iMCU_row; /* Number of iMCU rows read */ + + /* Current progression status. coef_bits[c][i] indicates the precision + * with which component c's DCT coefficient i (in zigzag order) is known. + * It is -1 when no data has yet been received, otherwise it is the point + * transform (shift) value for the most recent scan of the coefficient + * (thus, 0 at completion of the progression). + * This pointer is NULL when reading a non-progressive file. + */ + int (*coef_bits)[DCTSIZE2]; /* -1 or current Al value for each coef */ + + /* Internal JPEG parameters --- the application usually need not look at + * these fields. Note that the decompressor output side may not use + * any parameters that can change between scans. + */ + + /* Quantization and Huffman tables are carried forward across input + * datastreams when processing abbreviated JPEG datastreams. + */ + + JQUANT_TBL * quant_tbl_ptrs[NUM_QUANT_TBLS]; + /* ptrs to coefficient quantization tables, or NULL if not defined */ + + JHUFF_TBL * dc_huff_tbl_ptrs[NUM_HUFF_TBLS]; + JHUFF_TBL * ac_huff_tbl_ptrs[NUM_HUFF_TBLS]; + /* ptrs to Huffman coding tables, or NULL if not defined */ + + /* These parameters are never carried across datastreams, since they + * are given in SOF/SOS markers or defined to be reset by SOI. + */ + + int data_precision; /* bits of precision in image data */ + + jpeg_component_info * comp_info; + /* comp_info[i] describes component that appears i'th in SOF */ + + boolean progressive_mode; /* TRUE if SOFn specifies progressive mode */ + boolean arith_code; /* TRUE=arithmetic coding, FALSE=Huffman */ + + UINT8 arith_dc_L[NUM_ARITH_TBLS]; /* L values for DC arith-coding tables */ + UINT8 arith_dc_U[NUM_ARITH_TBLS]; /* U values for DC arith-coding tables */ + UINT8 arith_ac_K[NUM_ARITH_TBLS]; /* Kx values for AC arith-coding tables */ + + unsigned int restart_interval; /* MCUs per restart interval, or 0 for no restart */ + + /* These fields record data obtained from optional markers recognized by + * the JPEG library. + */ + boolean saw_JFIF_marker; /* TRUE iff a JFIF APP0 marker was found */ + /* Data copied from JFIF marker; only valid if saw_JFIF_marker is TRUE: */ + UINT8 JFIF_major_version; /* JFIF version number */ + UINT8 JFIF_minor_version; + UINT8 density_unit; /* JFIF code for pixel size units */ + UINT16 X_density; /* Horizontal pixel density */ + UINT16 Y_density; /* Vertical pixel density */ + boolean saw_Adobe_marker; /* TRUE iff an Adobe APP14 marker was found */ + UINT8 Adobe_transform; /* Color transform code from Adobe marker */ + + boolean CCIR601_sampling; /* TRUE=first samples are cosited */ + + /* Aside from the specific data retained from APPn markers known to the + * library, the uninterpreted contents of any or all APPn and COM markers + * can be saved in a list for examination by the application. + */ + jpeg_saved_marker_ptr marker_list; /* Head of list of saved markers */ + + /* Remaining fields are known throughout decompressor, but generally + * should not be touched by a surrounding application. + */ + + /* + * These fields are computed during decompression startup + */ + int max_h_samp_factor; /* largest h_samp_factor */ + int max_v_samp_factor; /* largest v_samp_factor */ + + int min_DCT_h_scaled_size; /* smallest DCT_h_scaled_size of any component */ + int min_DCT_v_scaled_size; /* smallest DCT_v_scaled_size of any component */ + + JDIMENSION total_iMCU_rows; /* # of iMCU rows in image */ + /* The coefficient controller's input and output progress is measured in + * units of "iMCU" (interleaved MCU) rows. These are the same as MCU rows + * in fully interleaved JPEG scans, but are used whether the scan is + * interleaved or not. We define an iMCU row as v_samp_factor DCT block + * rows of each component. Therefore, the IDCT output contains + * v_samp_factor*DCT_v_scaled_size sample rows of a component per iMCU row. + */ + + JSAMPLE * sample_range_limit; /* table for fast range-limiting */ + + /* + * These fields are valid during any one scan. + * They describe the components and MCUs actually appearing in the scan. + * Note that the decompressor output side must not use these fields. + */ + int comps_in_scan; /* # of JPEG components in this scan */ + jpeg_component_info * cur_comp_info[MAX_COMPS_IN_SCAN]; + /* *cur_comp_info[i] describes component that appears i'th in SOS */ + + JDIMENSION MCUs_per_row; /* # of MCUs across the image */ + JDIMENSION MCU_rows_in_scan; /* # of MCU rows in the image */ + + int blocks_in_MCU; /* # of DCT blocks per MCU */ + int MCU_membership[D_MAX_BLOCKS_IN_MCU]; + /* MCU_membership[i] is index in cur_comp_info of component owning */ + /* i'th block in an MCU */ + + int Ss, Se, Ah, Al; /* progressive JPEG parameters for scan */ + + /* This field is shared between entropy decoder and marker parser. + * It is either zero or the code of a JPEG marker that has been + * read from the data source, but has not yet been processed. + */ + int unread_marker; + + /* + * Links to decompression subobjects (methods, private variables of modules) + */ + struct jpeg_decomp_master * master; + struct jpeg_d_main_controller * main; + struct jpeg_d_coef_controller * coef; + struct jpeg_d_post_controller * post; + struct jpeg_input_controller * inputctl; + struct jpeg_marker_reader * marker; + struct jpeg_entropy_decoder * entropy; + struct jpeg_inverse_dct * idct; + struct jpeg_upsampler * upsample; + struct jpeg_color_deconverter * cconvert; + struct jpeg_color_quantizer * cquantize; +}; + + +/* "Object" declarations for JPEG modules that may be supplied or called + * directly by the surrounding application. + * As with all objects in the JPEG library, these structs only define the + * publicly visible methods and state variables of a module. Additional + * private fields may exist after the public ones. + */ + + +/* Error handler object */ + +struct jpeg_error_mgr { + /* Error exit handler: does not return to caller */ + JMETHOD(void, error_exit, (j_common_ptr cinfo)); + /* Conditionally emit a trace or warning message */ + JMETHOD(void, emit_message, (j_common_ptr cinfo, int msg_level)); + /* Routine that actually outputs a trace or error message */ + JMETHOD(void, output_message, (j_common_ptr cinfo)); + /* Format a message string for the most recent JPEG error or message */ + JMETHOD(void, format_message, (j_common_ptr cinfo, char * buffer)); +#define JMSG_LENGTH_MAX 200 /* recommended size of format_message buffer */ + /* Reset error state variables at start of a new image */ + JMETHOD(void, reset_error_mgr, (j_common_ptr cinfo)); + + /* The message ID code and any parameters are saved here. + * A message can have one string parameter or up to 8 int parameters. + */ + int msg_code; +#define JMSG_STR_PARM_MAX 80 + union { + int i[8]; + char s[JMSG_STR_PARM_MAX]; + } msg_parm; + + /* Standard state variables for error facility */ + + int trace_level; /* max msg_level that will be displayed */ + + /* For recoverable corrupt-data errors, we emit a warning message, + * but keep going unless emit_message chooses to abort. emit_message + * should count warnings in num_warnings. The surrounding application + * can check for bad data by seeing if num_warnings is nonzero at the + * end of processing. + */ + long num_warnings; /* number of corrupt-data warnings */ + + /* These fields point to the table(s) of error message strings. + * An application can change the table pointer to switch to a different + * message list (typically, to change the language in which errors are + * reported). Some applications may wish to add additional error codes + * that will be handled by the JPEG library error mechanism; the second + * table pointer is used for this purpose. + * + * First table includes all errors generated by JPEG library itself. + * Error code 0 is reserved for a "no such error string" message. + */ + const char * const * jpeg_message_table; /* Library errors */ + int last_jpeg_message; /* Table contains strings 0..last_jpeg_message */ + /* Second table can be added by application (see cjpeg/djpeg for example). + * It contains strings numbered first_addon_message..last_addon_message. + */ + const char * const * addon_message_table; /* Non-library errors */ + int first_addon_message; /* code for first string in addon table */ + int last_addon_message; /* code for last string in addon table */ +}; + + +/* Progress monitor object */ + +struct jpeg_progress_mgr { + JMETHOD(void, progress_monitor, (j_common_ptr cinfo)); + + long pass_counter; /* work units completed in this pass */ + long pass_limit; /* total number of work units in this pass */ + int completed_passes; /* passes completed so far */ + int total_passes; /* total number of passes expected */ +}; + + +/* Data destination object for compression */ + +struct jpeg_destination_mgr { + JOCTET * next_output_byte; /* => next byte to write in buffer */ + size_t free_in_buffer; /* # of byte spaces remaining in buffer */ + + JMETHOD(void, init_destination, (j_compress_ptr cinfo)); + JMETHOD(boolean, empty_output_buffer, (j_compress_ptr cinfo)); + JMETHOD(void, term_destination, (j_compress_ptr cinfo)); +}; + + +/* Data source object for decompression */ + +struct jpeg_source_mgr { + const JOCTET * next_input_byte; /* => next byte to read from buffer */ + size_t bytes_in_buffer; /* # of bytes remaining in buffer */ + + JMETHOD(void, init_source, (j_decompress_ptr cinfo)); + JMETHOD(boolean, fill_input_buffer, (j_decompress_ptr cinfo)); + JMETHOD(void, skip_input_data, (j_decompress_ptr cinfo, long num_bytes)); + JMETHOD(boolean, resync_to_restart, (j_decompress_ptr cinfo, int desired)); + JMETHOD(void, term_source, (j_decompress_ptr cinfo)); +}; + + +/* Memory manager object. + * Allocates "small" objects (a few K total), "large" objects (tens of K), + * and "really big" objects (virtual arrays with backing store if needed). + * The memory manager does not allow individual objects to be freed; rather, + * each created object is assigned to a pool, and whole pools can be freed + * at once. This is faster and more convenient than remembering exactly what + * to free, especially where malloc()/free() are not too speedy. + * NB: alloc routines never return NULL. They exit to error_exit if not + * successful. + */ + +#define JPOOL_PERMANENT 0 /* lasts until master record is destroyed */ +#define JPOOL_IMAGE 1 /* lasts until done with image/datastream */ +#define JPOOL_NUMPOOLS 2 + +typedef struct jvirt_sarray_control * jvirt_sarray_ptr; +typedef struct jvirt_barray_control * jvirt_barray_ptr; + + +struct jpeg_memory_mgr { + /* Method pointers */ + JMETHOD(void *, alloc_small, (j_common_ptr cinfo, int pool_id, + size_t sizeofobject)); + JMETHOD(void FAR *, alloc_large, (j_common_ptr cinfo, int pool_id, + size_t sizeofobject)); + JMETHOD(JSAMPARRAY, alloc_sarray, (j_common_ptr cinfo, int pool_id, + JDIMENSION samplesperrow, + JDIMENSION numrows)); + JMETHOD(JBLOCKARRAY, alloc_barray, (j_common_ptr cinfo, int pool_id, + JDIMENSION blocksperrow, + JDIMENSION numrows)); + JMETHOD(jvirt_sarray_ptr, request_virt_sarray, (j_common_ptr cinfo, + int pool_id, + boolean pre_zero, + JDIMENSION samplesperrow, + JDIMENSION numrows, + JDIMENSION maxaccess)); + JMETHOD(jvirt_barray_ptr, request_virt_barray, (j_common_ptr cinfo, + int pool_id, + boolean pre_zero, + JDIMENSION blocksperrow, + JDIMENSION numrows, + JDIMENSION maxaccess)); + JMETHOD(void, realize_virt_arrays, (j_common_ptr cinfo)); + JMETHOD(JSAMPARRAY, access_virt_sarray, (j_common_ptr cinfo, + jvirt_sarray_ptr ptr, + JDIMENSION start_row, + JDIMENSION num_rows, + boolean writable)); + JMETHOD(JBLOCKARRAY, access_virt_barray, (j_common_ptr cinfo, + jvirt_barray_ptr ptr, + JDIMENSION start_row, + JDIMENSION num_rows, + boolean writable)); + JMETHOD(void, free_pool, (j_common_ptr cinfo, int pool_id)); + JMETHOD(void, self_destruct, (j_common_ptr cinfo)); + + /* Limit on memory allocation for this JPEG object. (Note that this is + * merely advisory, not a guaranteed maximum; it only affects the space + * used for virtual-array buffers.) May be changed by outer application + * after creating the JPEG object. + */ + long max_memory_to_use; + + /* Maximum allocation request accepted by alloc_large. */ + long max_alloc_chunk; +}; + + +/* Routine signature for application-supplied marker processing methods. + * Need not pass marker code since it is stored in cinfo->unread_marker. + */ +typedef JMETHOD(boolean, jpeg_marker_parser_method, (j_decompress_ptr cinfo)); + + +/* Declarations for routines called by application. + * The JPP macro hides prototype parameters from compilers that can't cope. + * Note JPP requires double parentheses. + */ + +#ifdef HAVE_PROTOTYPES +#define JPP(arglist) arglist +#else +#define JPP(arglist) () +#endif + + +/* Short forms of external names for systems with brain-damaged linkers. + * We shorten external names to be unique in the first six letters, which + * is good enough for all known systems. + * (If your compiler itself needs names to be unique in less than 15 + * characters, you are out of luck. Get a better compiler.) + */ + +#ifdef NEED_SHORT_EXTERNAL_NAMES +#define jpeg_std_error jStdError +#define jpeg_CreateCompress jCreaCompress +#define jpeg_CreateDecompress jCreaDecompress +#define jpeg_destroy_compress jDestCompress +#define jpeg_destroy_decompress jDestDecompress +#define jpeg_stdio_dest jStdDest +#define jpeg_stdio_src jStdSrc +#define jpeg_set_defaults jSetDefaults +#define jpeg_set_colorspace jSetColorspace +#define jpeg_default_colorspace jDefColorspace +#define jpeg_set_quality jSetQuality +#define jpeg_set_linear_quality jSetLQuality +#define jpeg_default_qtables jDefQTables +#define jpeg_add_quant_table jAddQuantTable +#define jpeg_quality_scaling jQualityScaling +#define jpeg_simple_progression jSimProgress +#define jpeg_suppress_tables jSuppressTables +#define jpeg_alloc_quant_table jAlcQTable +#define jpeg_alloc_huff_table jAlcHTable +#define jpeg_start_compress jStrtCompress +#define jpeg_write_scanlines jWrtScanlines +#define jpeg_finish_compress jFinCompress +#define jpeg_calc_jpeg_dimensions jCjpegDimensions +#define jpeg_write_raw_data jWrtRawData +#define jpeg_write_marker jWrtMarker +#define jpeg_write_m_header jWrtMHeader +#define jpeg_write_m_byte jWrtMByte +#define jpeg_write_tables jWrtTables +#define jpeg_read_header jReadHeader +#define jpeg_start_decompress jStrtDecompress +#define jpeg_read_scanlines jReadScanlines +#define jpeg_finish_decompress jFinDecompress +#define jpeg_read_raw_data jReadRawData +#define jpeg_has_multiple_scans jHasMultScn +#define jpeg_start_output jStrtOutput +#define jpeg_finish_output jFinOutput +#define jpeg_input_complete jInComplete +#define jpeg_new_colormap jNewCMap +#define jpeg_consume_input jConsumeInput +#define jpeg_calc_output_dimensions jCalcDimensions +#define jpeg_save_markers jSaveMarkers +#define jpeg_set_marker_processor jSetMarker +#define jpeg_read_coefficients jReadCoefs +#define jpeg_write_coefficients jWrtCoefs +#define jpeg_copy_critical_parameters jCopyCrit +#define jpeg_abort_compress jAbrtCompress +#define jpeg_abort_decompress jAbrtDecompress +#define jpeg_abort jAbort +#define jpeg_destroy jDestroy +#define jpeg_resync_to_restart jResyncRestart +#endif /* NEED_SHORT_EXTERNAL_NAMES */ + + +/* Default error-management setup */ +EXTERN(struct jpeg_error_mgr *) jpeg_std_error + JPP((struct jpeg_error_mgr * err)); + +/* Initialization of JPEG compression objects. + * jpeg_create_compress() and jpeg_create_decompress() are the exported + * names that applications should call. These expand to calls on + * jpeg_CreateCompress and jpeg_CreateDecompress with additional information + * passed for version mismatch checking. + * NB: you must set up the error-manager BEFORE calling jpeg_create_xxx. + */ +#define jpeg_create_compress(cinfo) \ + jpeg_CreateCompress((cinfo), JPEG_LIB_VERSION, \ + (size_t) sizeof(struct jpeg_compress_struct)) +#define jpeg_create_decompress(cinfo) \ + jpeg_CreateDecompress((cinfo), JPEG_LIB_VERSION, \ + (size_t) sizeof(struct jpeg_decompress_struct)) +EXTERN(void) jpeg_CreateCompress JPP((j_compress_ptr cinfo, + int version, size_t structsize)); +EXTERN(void) jpeg_CreateDecompress JPP((j_decompress_ptr cinfo, + int version, size_t structsize)); +/* Destruction of JPEG compression objects */ +EXTERN(void) jpeg_destroy_compress JPP((j_compress_ptr cinfo)); +EXTERN(void) jpeg_destroy_decompress JPP((j_decompress_ptr cinfo)); + +/* Standard data source and destination managers: stdio streams. */ +/* Caller is responsible for opening the file before and closing after. */ +EXTERN(void) jpeg_stdio_dest JPP((j_compress_ptr cinfo, FILE * outfile)); +EXTERN(void) jpeg_stdio_src JPP((j_decompress_ptr cinfo, FILE * infile)); + +/* Memory data source and destination managers: memory streams. */ +EXTERN(void) jpeg_memory_src JPP((j_decompress_ptr cinfo, const JOCTET * buffer, size_t bufsize)); + +/* Default parameter setup for compression */ +EXTERN(void) jpeg_set_defaults JPP((j_compress_ptr cinfo)); +/* Compression parameter setup aids */ +EXTERN(void) jpeg_set_colorspace JPP((j_compress_ptr cinfo, + J_COLOR_SPACE colorspace)); +EXTERN(void) jpeg_default_colorspace JPP((j_compress_ptr cinfo)); +EXTERN(void) jpeg_set_quality JPP((j_compress_ptr cinfo, int quality, + boolean force_baseline)); +EXTERN(void) jpeg_set_linear_quality JPP((j_compress_ptr cinfo, + int scale_factor, + boolean force_baseline)); +EXTERN(void) jpeg_default_qtables JPP((j_compress_ptr cinfo, + boolean force_baseline)); +EXTERN(void) jpeg_add_quant_table JPP((j_compress_ptr cinfo, int which_tbl, + const unsigned int *basic_table, + int scale_factor, + boolean force_baseline)); +EXTERN(int) jpeg_quality_scaling JPP((int quality)); +EXTERN(void) jpeg_simple_progression JPP((j_compress_ptr cinfo)); +EXTERN(void) jpeg_suppress_tables JPP((j_compress_ptr cinfo, + boolean suppress)); +EXTERN(JQUANT_TBL *) jpeg_alloc_quant_table JPP((j_common_ptr cinfo)); +EXTERN(JHUFF_TBL *) jpeg_alloc_huff_table JPP((j_common_ptr cinfo)); + +/* Main entry points for compression */ +EXTERN(void) jpeg_start_compress JPP((j_compress_ptr cinfo, + boolean write_all_tables)); +EXTERN(JDIMENSION) jpeg_write_scanlines JPP((j_compress_ptr cinfo, + JSAMPARRAY scanlines, + JDIMENSION num_lines)); +EXTERN(void) jpeg_finish_compress JPP((j_compress_ptr cinfo)); + +/* Precalculate JPEG dimensions for current compression parameters. */ +EXTERN(void) jpeg_calc_jpeg_dimensions JPP((j_compress_ptr cinfo)); + +/* Replaces jpeg_write_scanlines when writing raw downsampled data. */ +EXTERN(JDIMENSION) jpeg_write_raw_data JPP((j_compress_ptr cinfo, + JSAMPIMAGE data, + JDIMENSION num_lines)); + +/* Write a special marker. See libjpeg.txt concerning safe usage. */ +EXTERN(void) jpeg_write_marker + JPP((j_compress_ptr cinfo, int marker, + const JOCTET * dataptr, unsigned int datalen)); +/* Same, but piecemeal. */ +EXTERN(void) jpeg_write_m_header + JPP((j_compress_ptr cinfo, int marker, unsigned int datalen)); +EXTERN(void) jpeg_write_m_byte + JPP((j_compress_ptr cinfo, int val)); + +/* Alternate compression function: just write an abbreviated table file */ +EXTERN(void) jpeg_write_tables JPP((j_compress_ptr cinfo)); + +/* Decompression startup: read start of JPEG datastream to see what's there */ +EXTERN(int) jpeg_read_header JPP((j_decompress_ptr cinfo, + boolean require_image)); +/* Return value is one of: */ +#define JPEG_SUSPENDED 0 /* Suspended due to lack of input data */ +#define JPEG_HEADER_OK 1 /* Found valid image datastream */ +#define JPEG_HEADER_TABLES_ONLY 2 /* Found valid table-specs-only datastream */ +/* If you pass require_image = TRUE (normal case), you need not check for + * a TABLES_ONLY return code; an abbreviated file will cause an error exit. + * JPEG_SUSPENDED is only possible if you use a data source module that can + * give a suspension return (the stdio source module doesn't). + */ + +/* Main entry points for decompression */ +EXTERN(boolean) jpeg_start_decompress JPP((j_decompress_ptr cinfo)); +EXTERN(JDIMENSION) jpeg_read_scanlines JPP((j_decompress_ptr cinfo, + JSAMPARRAY scanlines, + JDIMENSION max_lines)); +EXTERN(boolean) jpeg_finish_decompress JPP((j_decompress_ptr cinfo)); + +/* Replaces jpeg_read_scanlines when reading raw downsampled data. */ +EXTERN(JDIMENSION) jpeg_read_raw_data JPP((j_decompress_ptr cinfo, + JSAMPIMAGE data, + JDIMENSION max_lines)); + +/* Additional entry points for buffered-image mode. */ +EXTERN(boolean) jpeg_has_multiple_scans JPP((j_decompress_ptr cinfo)); +EXTERN(boolean) jpeg_start_output JPP((j_decompress_ptr cinfo, + int scan_number)); +EXTERN(boolean) jpeg_finish_output JPP((j_decompress_ptr cinfo)); +EXTERN(boolean) jpeg_input_complete JPP((j_decompress_ptr cinfo)); +EXTERN(void) jpeg_new_colormap JPP((j_decompress_ptr cinfo)); +EXTERN(int) jpeg_consume_input JPP((j_decompress_ptr cinfo)); +/* Return value is one of: */ +/* #define JPEG_SUSPENDED 0 Suspended due to lack of input data */ +#define JPEG_REACHED_SOS 1 /* Reached start of new scan */ +#define JPEG_REACHED_EOI 2 /* Reached end of image */ +#define JPEG_ROW_COMPLETED 3 /* Completed one iMCU row */ +#define JPEG_SCAN_COMPLETED 4 /* Completed last iMCU row of a scan */ + +/* Precalculate output dimensions for current decompression parameters. */ +EXTERN(void) jpeg_calc_output_dimensions JPP((j_decompress_ptr cinfo)); + +/* Control saving of COM and APPn markers into marker_list. */ +EXTERN(void) jpeg_save_markers + JPP((j_decompress_ptr cinfo, int marker_code, + unsigned int length_limit)); + +/* Install a special processing method for COM or APPn markers. */ +EXTERN(void) jpeg_set_marker_processor + JPP((j_decompress_ptr cinfo, int marker_code, + jpeg_marker_parser_method routine)); + +/* Read or write raw DCT coefficients --- useful for lossless transcoding. */ +EXTERN(jvirt_barray_ptr *) jpeg_read_coefficients JPP((j_decompress_ptr cinfo)); +EXTERN(void) jpeg_write_coefficients JPP((j_compress_ptr cinfo, + jvirt_barray_ptr * coef_arrays)); +EXTERN(void) jpeg_copy_critical_parameters JPP((j_decompress_ptr srcinfo, + j_compress_ptr dstinfo)); + +/* If you choose to abort compression or decompression before completing + * jpeg_finish_(de)compress, then you need to clean up to release memory, + * temporary files, etc. You can just call jpeg_destroy_(de)compress + * if you're done with the JPEG object, but if you want to clean it up and + * reuse it, call this: + */ +EXTERN(void) jpeg_abort_compress JPP((j_compress_ptr cinfo)); +EXTERN(void) jpeg_abort_decompress JPP((j_decompress_ptr cinfo)); + +/* Generic versions of jpeg_abort and jpeg_destroy that work on either + * flavor of JPEG object. These may be more convenient in some places. + */ +EXTERN(void) jpeg_abort JPP((j_common_ptr cinfo)); +EXTERN(void) jpeg_destroy JPP((j_common_ptr cinfo)); + +/* Default restart-marker-resync procedure for use by data source modules */ +EXTERN(boolean) jpeg_resync_to_restart JPP((j_decompress_ptr cinfo, + int desired)); + + +/* These marker codes are exported since applications and data source modules + * are likely to want to use them. + */ + +#define JPEG_RST0 0xD0 /* RST0 marker code */ +#define JPEG_EOI 0xD9 /* EOI marker code */ +#define JPEG_APP0 0xE0 /* APP0 marker code */ +#define JPEG_COM 0xFE /* COM marker code */ + + +/* If we have a brain-damaged compiler that emits warnings (or worse, errors) + * for structure definitions that are never filled in, keep it quiet by + * supplying dummy definitions for the various substructures. + */ + +#ifdef INCOMPLETE_TYPES_BROKEN +#ifndef JPEG_INTERNALS /* will be defined in jpegint.h */ +struct jvirt_sarray_control { long dummy; }; +struct jvirt_barray_control { long dummy; }; +struct jpeg_comp_master { long dummy; }; +struct jpeg_c_main_controller { long dummy; }; +struct jpeg_c_prep_controller { long dummy; }; +struct jpeg_c_coef_controller { long dummy; }; +struct jpeg_marker_writer { long dummy; }; +struct jpeg_color_converter { long dummy; }; +struct jpeg_downsampler { long dummy; }; +struct jpeg_forward_dct { long dummy; }; +struct jpeg_entropy_encoder { long dummy; }; +struct jpeg_decomp_master { long dummy; }; +struct jpeg_d_main_controller { long dummy; }; +struct jpeg_d_coef_controller { long dummy; }; +struct jpeg_d_post_controller { long dummy; }; +struct jpeg_input_controller { long dummy; }; +struct jpeg_marker_reader { long dummy; }; +struct jpeg_entropy_decoder { long dummy; }; +struct jpeg_inverse_dct { long dummy; }; +struct jpeg_upsampler { long dummy; }; +struct jpeg_color_deconverter { long dummy; }; +struct jpeg_color_quantizer { long dummy; }; +#endif /* JPEG_INTERNALS */ +#endif /* INCOMPLETE_TYPES_BROKEN */ + + +/* + * The JPEG library modules define JPEG_INTERNALS before including this file. + * The internal structure declarations are read only when that is true. + * Applications using the library should not include jpegint.h, but may wish + * to include jerror.h. + */ + +#ifdef JPEG_INTERNALS +#include "jpegint.h" /* fetch private declarations */ +#include "jerror.h" /* fetch error codes too */ +#endif + +#ifdef __cplusplus +#ifndef DONT_USE_EXTERN_C +} +#endif +#endif + +#endif /* JPEGLIB_H */ diff --git a/portlibs/include/modplay/defines.h b/portlibs/include/modplay/defines.h new file mode 100644 index 00000000..0bb5ace8 --- /dev/null +++ b/portlibs/include/modplay/defines.h @@ -0,0 +1,11 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __DEFINES_H__ +#define __DEFINES_H__ + +#include <gccore.h> + +#endif diff --git a/portlibs/include/modplay/envelope.h b/portlibs/include/modplay/envelope.h new file mode 100644 index 00000000..086d9405 --- /dev/null +++ b/portlibs/include/modplay/envelope.h @@ -0,0 +1,57 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __ENVELOPE_H__ +#define __ENVELOPE_H__ + +#ifdef __cplusplus +extern "C" { +#endif + + +#include "defines.h" + +#define ENV_WIDTH 65536 +#define ENV_HEIGHT 65536 + +typedef struct EnvPoint { + + u16 x,y; +} EnvPoint; + +typedef struct EnvelopeConfig { + + BOOL enabled; + u8 numPoints; /* # of envelope points */ + u8 loop_start; + u8 loop_end; + u8 sustain; + + EnvPoint *envPoints; +} EnvelopeConfig; + +typedef struct Envelope { + + EnvelopeConfig *envConfig; + + BOOL triggered; + BOOL hold; + u8 curPoint; + u16 value; + u16 position; +} Envelope; + + +void EnvReset(Envelope *env); +void EnvTrigger(Envelope *env); +BOOL EnvProcess(Envelope *env); +void EnvRelease(Envelope *env); + + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/include/modplay/mixer.h b/portlibs/include/modplay/mixer.h new file mode 100644 index 00000000..d646abd1 --- /dev/null +++ b/portlibs/include/modplay/mixer.h @@ -0,0 +1,77 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __MIXER_H__ +#define __MIXER_H__ + +#include "defines.h" + +/* +#define MIXER_TYPE u64 +#define MIXER_SHIFT 32 +*/ + +#define MIXER_TYPE u32 +#define MIXER_SHIFT 10 + + +typedef struct MOD_SAMPLEINFO16 { + + u32 length; + u32 loop_start; + u32 loop_end; + BOOL looped; + BOOL pingpong; + void *sampledata; + BOOL bit_16; + BOOL stereo; +} MOD_SAMPLEINFO16; + +typedef struct MOD_VOICEINFO16 { + + BOOL enabled; + BOOL playing; + BOOL forward; + u8 panning; + u8 envPanning; + /* u32 playpos; + u32 incval;*/ + MIXER_TYPE playpos; + MIXER_TYPE incval; + u8 volume; + u8 envVolume; + MOD_SAMPLEINFO16 *sampleInfo; +} MOD_VOICEINFO16; + +#define MIXER_USE_S32 1 +#define MIXER_3232BIT 2 +#define MIXER_SRC_SIGNED 4 +#define MIXER_DEST_STEREO 8 +#define MIXER_USE_DOUBLE 16 +#define MIXER_USE_FLOAT 32 +#define MIXER_DEST_16BIT 64 +#define MIXER_DEST_SIGNED 128 +#define MIXER_SRC_16BIT 256 + +int mix_s8m_to_s32m_1616bit (s32 *, int, MOD_VOICEINFO16 *, u8); +int mix_s8m_to_s32s_1616bit (s32 *, int, MOD_VOICEINFO16*, u8); + +int mix_s16m_to_s32s_1616bit(s32 *, int, MOD_VOICEINFO16 *, u8); +int mix_s16m_to_s32m_1616bit(s32 *, int, MOD_VOICEINFO16 *, u8); + +void clearbuf_s32(s32 *, int, int); + +void copybuf_s32_to_s16(s16 *, s32 *, int, int); +void copybuf_s32_to_u16(u16 *, s32 *, int, int); +void copybuf_s32_to_s8 (s8 *, s32 *, int, int); +void copybuf_s32_to_u8 (u8 *, s32 *, int, int); + +int mix_final_1616bit(int flags, void *dest, int nSamples, MOD_VOICEINFO16 *vinfo, u8 mainvol); +int copybuf_final(int flags, void *dest, void *src, int nSamples); +int clearbuf_final(int flags, void *dest, int nSamples); + +int mix_destbufsize(int flags); + +#endif diff --git a/portlibs/include/modplay/modplay.h b/portlibs/include/modplay/modplay.h new file mode 100644 index 00000000..9bde35b2 --- /dev/null +++ b/portlibs/include/modplay/modplay.h @@ -0,0 +1,55 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + + #ifndef __MODPLAY_H__ +#define __MODPLAY_H__ + +#include "modplay_core.h" + + +#ifdef __cplusplus +extern "C" { +#endif + +#define MODULE_MOD 1 +#define MODULE_S3M 2 +#define MODULE_XM 3 + + +typedef struct MODFORMAT { + + int (*set)(u8 *, int, MODFILE *); + BOOL (*is) (u8 *, int); + int (*getFormatID)(void); + char *(*getDescription)(void); + char *(*getAuthor)(void); + char *(*getVersion)(void); + char *(*getCopyright)(void); +} MODFORMAT; + +extern const MODFORMAT mod_formats[]; + + + +int MODFILE_Load(const char *fname, MODFILE *mod); + +void MODFILE_Start(MODFILE *s3m); +void MODFILE_Stop(MODFILE *s3m); +void MODFILE_Player(MODFILE *s3m); +void MODFILE_Free(MODFILE *mod); +void MODFILE_Init(MODFILE *mod); +void MODFILE_SetFormat(MODFILE *mod, int freq, int channels, int bits, BOOL mixsigned); +int MODFILE_Set(u8 *modfile, int modlength, MODFILE *mod); +BOOL MODFILE_Is(u8 *, int); + +MOD_Instrument *MODFILE_MakeInstrument(void *rawData, int nBytes, int nBits); +int MODFILE_AllocSFXChannels(MODFILE *mod, int nChannels); +void MODFILE_TriggerSFX(MODFILE *mod, MOD_Instrument *instr, int channel, u8 note); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/include/modplay/modplay_core.h b/portlibs/include/modplay/modplay_core.h new file mode 100644 index 00000000..449454c9 --- /dev/null +++ b/portlibs/include/modplay/modplay_core.h @@ -0,0 +1,212 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __MODPLAY_CORE_H__ +#define __MODPLAY_CORE_H__ + +#include "defines.h" +#include "mixer.h" +#include "envelope.h" + +#define MODPLAY_MAX_CHANNELS 33 +#define MODPLAY_NUM_COMMANDS 2 + +typedef struct MOD_Note { + + u32 instrument; + u8 volume; + u8 note; + u16 effect[MODPLAY_NUM_COMMANDS]; + u8 operand[MODPLAY_NUM_COMMANDS]; +} MOD_Note; + +typedef struct MOD_ChannelEffect { + + u16 cur_effect; + u8 cur_operand; + u16 last_effect; + + /* Panning slide */ + u8 panslide_bak; + /* Volume Slide */ + u8 volslide_bak; + /* Portamento */ + u8 porta_bak; + /* Tone portamento */ + u8 toneporta_bak; + u32 toneporta_dest; + /* Vibrato */ + u8 vibrato_depth; + u8 vibrato_freq; + u8 vibrato_bak; + int vibrato_wave; + u32 vibrato_base; + int vibrato_sintabpos; + /* Tremolo */ + u8 tremolo_depth; + u8 tremolo_freq; + u8 tremolo_bak; + int tremolo_wave; + u8 tremolo_base; + int tremolo_sintabpos; + /* Retrig */ + u8 retrig_count; + u8 retrig_bak; + /* Note delay */ +/* u8 notedelay_note; + u8 notedelay_instrument; + u8 notedelay_volume; + u8 notedelay_tick;*/ + MOD_Note *notedelay_note; + /* Note cut */ + u8 notecut_tick; + /* Arpeggio */ + u8 arpeggio_count; + u8 arpeggio_bak; + u32 arpeggio_base; + /* Offset */ + u8 offset_bak; + /* Fine volslide */ + u8 finevolslidedown_bak; + u8 finevolslideup_bak; + u8 gvolslide_bak; +} MOD_ChannelEffect; + +typedef struct MOD_Sample { + + MOD_SAMPLEINFO16 sampleInfo; + + char name[28]; + u8 default_volume; + u32 middle_c; + u32 default_middle_c; + s8 finetune; + s8 relative_note; + u8 panning; + u8 volume; +} MOD_Sample; + +typedef struct MOD_Instrument { + + char name[28]; + MOD_Sample *samples[256]; /* Instrument note -> Sample number mapping */ + u8 note[256]; /* Instrument note -> Sample note mapping */ + + EnvelopeConfig envPanning; + EnvelopeConfig envVolume; + u16 volumeFade; +} MOD_Instrument; + +typedef struct MOD_Channel { + + u16 volumeFade; + u16 volumeFadeDec; + /* u32 instrument;*/ + MOD_Instrument *instrument; + /* u32 sample;*/ + MOD_Sample *sample; + MOD_VOICEINFO16 voiceInfo; + Envelope envPanning; + Envelope envVolume; + + u8 default_panning; + u8 cur_note; + u32 st3_period; + s32 st3_periodofs; + u8 last_instrument; + u8 last_note; + + MOD_ChannelEffect effects[MODPLAY_NUM_COMMANDS]; +} MOD_Channel; + +typedef struct MODFILE { + + char songname[28]; + int nChannels; + int nSFXChannels; + int songlength; + int nInstruments; + int nSamples; + int nPatterns; + int restart_position; + int period_type; /* 0 - Amiga, 1 - Linear (XM) */ + BOOL st2_vibrato; + BOOL st2_tempo; + BOOL amiga_sliding; + BOOL optimize_vols; + BOOL amiga_boundaries; + BOOL enable_sfx; /* Fast volume slides */ + BOOL unsigned_samples; + u8 master_volume; + u8 cur_master_volume; + u8 musicvolume; + u8 sfxvolume; + u8 start_speed; + u8 start_tempo; + u16 tracker_version; + + u8 playlist[256]; + + MOD_Channel channels[MODPLAY_MAX_CHANNELS]; + MOD_Instrument *instruments; + MOD_Sample *samples; + MOD_Note **patterns; + int *patternLengths; + + int playfreq; /* Output frequency (11025, 22050 or 44100) */ + int bits; /* Output resolution (8 or 16 bits) */ + u16 *mixingbuf; /* Output buffer */ + int mixingbuflen; /* Output buffer length in bytes */ + int mixchannels; /* 1 = mono, 2 = stereo */ + BOOL mixsigned; /* mixingbuf is signed */ + + /* Play time variables */ + int patterndelay; + int pattern_line; + int play_position; + int speedcounter; + int speed; + int bpm; + int samplespertick; + int samplescounter; + + /* Pattern loop */ + int patternloop_to; + int patternloop_count; + + void *tempmixbuf; + + int filetype; + + BOOL playing; + BOOL set; + + u32 notebeats; + void (*callback)(void*); + +} MODFILE; + +#include "modplay.h" + +int MODFILE_Mix(MODFILE *mod, int flags, void *buf, int nSamples); +u32 MODFILE_EffectHandler(MODFILE *mod); +u32 MODFILE_Process(MODFILE *mod); +BOOL MODFILE_TriggerNote(MODFILE *mod, int channel, u8 note, u8 instrument, u8 volume, u16 *commands); +void MODFILE_SetBPM(MODFILE *mod, int bpm); +int MODFILE_BPM2SamplesPerTick(MODFILE *mod, int bpm); +char * MODFILE_GetNoteString(u8 note); +u16 MODFILE_GetEffect(MODFILE*,int,int,int); +u8 MODFILE_GetEffectOp(MODFILE*,int,int,int); +u8 MODFILE_GetNote(MODFILE *mod, int patternline, int channel); +u32 MODFILE_GetInstr(MODFILE *mod, int patternline, int channel); +void MODFILE_ClearPattern(MODFILE *mod, int pattern); + +void MODFILE_SetNote(MODFILE *mod, int channel, u8 note, int middle_c, s8 finetune); +void MODFILE_SetPeriodOfs(MODFILE *mod, int channel, s32 periodofs); +void MODFILE_SetPeriod(MODFILE *mod, int channel, u32 period); +void MODFILE_SubVolume(MODFILE *mod, int channel, u8 sub); +void MODFILE_AddVolume(MODFILE *mod, int channel, u8 add); + +#endif diff --git a/portlibs/include/ntfs.h b/portlibs/include/ntfs.h new file mode 100644 index 00000000..22474232 --- /dev/null +++ b/portlibs/include/ntfs.h @@ -0,0 +1,147 @@ +/** + * ntfs.h - Simple functionality for startup, mounting and unmounting of NTFS-based devices. + * + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef _LIBNTFS_H +#define _LIBNTFS_H + +#ifdef __cplusplus +extern "C" { +#endif + +#include <gctypes.h> +#include <gccore.h> +#include <ogc/disc_io.h> + +/* NTFS errno values */ +#define ENOPART 3000 /* No partition was found */ +#define EINVALPART 3001 /* Specified partition is invalid or not supported */ +#define EDIRTY 3002 /* Volume is dirty and NTFS_RECOVER was not specified during mount */ +#define EHIBERNATED 3003 /* Volume is hibernated and NTFS_IGNORE_HIBERFILE was not specified during mount */ + +/* NTFS cache options */ +#define CACHE_DEFAULT_PAGE_COUNT 8 /* The default number of pages in the cache */ +#define CACHE_DEFAULT_PAGE_SIZE 128 /* The default number of sectors per cache page */ + +/* NTFS mount flags */ +#define NTFS_DEFAULT 0x00000000 /* Standard mount, expects a clean, non-hibernated volume */ +#define NTFS_SHOW_HIDDEN_FILES 0x00000001 /* Display hidden files when enumerating directories */ +#define NTFS_SHOW_SYSTEM_FILES 0x00000002 /* Display system files when enumerating directories */ +#define NTFS_UPDATE_ACCESS_TIMES 0x00000004 /* Update file and directory access times */ +#define NTFS_RECOVER 0x00000008 /* Reset $LogFile if dirty (i.e. from unclean disconnect) */ +#define NTFS_IGNORE_HIBERFILE 0x00000010 /* Mount even if volume is hibernated */ +#define NTFS_READ_ONLY 0x00000020 /* Mount in read only mode */ +#define NTFS_IGNORE_CASE 0x00000040 /* Ignore case sensitivity. Everything must be and will be provided in lowercase. */ +#define NTFS_SU NTFS_SHOW_HIDDEN_FILES | NTFS_SHOW_SYSTEM_FILES +#define NTFS_FORCE NTFS_RECOVER | NTFS_IGNORE_HIBERFILE + +/** + * ntfs_md - NTFS mount descriptor + */ +typedef struct _ntfs_md { + char name[32]; /* Mount name (can be accessed as "name:/") */ + const DISC_INTERFACE *interface; /* Block device containing the mounted partition */ + sec_t startSector; /* Local block address to first sector of partition */ +} ntfs_md; + +/** + * Find all NTFS partitions on a block device. + * + * @param INTERFACE The block device to search + * @param PARTITIONS (out) A pointer to receive the array of partition start sectors + * + * @return The number of entries in PARTITIONS or -1 if an error occurred (see errno) + * @note The caller is responsible for freeing PARTITIONS when finished with it + */ +extern int ntfsFindPartitions (const DISC_INTERFACE *interface, sec_t **partitions); + +/** + * Mount all NTFS partitions on all inserted block devices. + * + * @param MOUNTS (out) A pointer to receive the array of mount descriptors + * @param FLAGS Additional mounting flags. (see above) + * + * @return The number of entries in MOUNTS or -1 if an error occurred (see errno) + * @note The caller is responsible for freeing MOUNTS when finished with it + * @note All device caches are setup using default values (see above) + */ +extern int ntfsMountAll (ntfs_md **mounts, u32 flags); + +/** + * Mount all NTFS partitions on a block devices. + * + * @param INTERFACE The block device to mount. + * @param MOUNTS (out) A pointer to receive the array of mount descriptors + * @param FLAGS Additional mounting flags. (see above) + * + * @return The number of entries in MOUNTS or -1 if an error occurred (see errno) + * @note The caller is responsible for freeing MOUNTS when finished with it + * @note The device cache is setup using default values (see above) + */ +extern int ntfsMountDevice (const DISC_INTERFACE* interface, ntfs_md **mounts, u32 flags); + +/** + * Mount a NTFS partition from a specific sector on a block device. + * + * @param NAME The name to mount the device under (can then be accessed as "NAME:/") + * @param INTERFACE The block device to mount + * @param STARTSECTOR The sector the partition begins at (see @ntfsFindPartitions) + * @param CACHEPAGECOUNT The total number of pages in the device cache + * @param CACHEPAGESIZE The number of sectors per cache page + * @param FLAGS Additional mounting flags (see above) + * + * @return True if mount was successful, false if no partition was found or an error occurred (see errno) + * @note ntfsFindPartitions should be used first to locate the partitions start sector + */ +extern bool ntfsMount (const char *name, const DISC_INTERFACE *interface, sec_t startSector, u32 cachePageCount, u32 cachePageSize, u32 flags); + +/** + * Unmount a NTFS partition. + * + * @param NAME The name of mount used in ntfsMountSimple() and ntfsMount() + * @param FORCE If true unmount even if the device is busy (may lead to data lose) + */ +extern void ntfsUnmount (const char *name, bool force); + +/** + * Get the volume name of a mounted NTFS partition. + * + * @param NAME The name of mount (see @ntfsMountAll, @ntfsMountDevice, and @ntfsMount) + * + * @return The volumes name if successful or NULL if an error occurred (see errno) + */ +extern const char *ntfsGetVolumeName (const char *name); + +/** + * Set the volume name of a mounted NTFS partition. + * + * @param NAME The name of mount (see @ntfsMountAll, @ntfsMountDevice, and @ntfsMount) + * @param VOLUMENAME The new volume name + * + * @return True if mount was successful, false if an error occurred (see errno) + * @note The mount must be write-enabled else this will fail + */ +extern bool ntfsSetVolumeName (const char *name, const char *volumeName); + +#ifdef __cplusplus +} +#endif + +#endif /* _LIBNTFS_H */ diff --git a/portlibs/include/ntfsfile_frag.h b/portlibs/include/ntfsfile_frag.h new file mode 100644 index 00000000..889abb1a --- /dev/null +++ b/portlibs/include/ntfsfile_frag.h @@ -0,0 +1,15 @@ +#ifndef NTFS_FRAG_H_ +#define NTFS_FRAG_H_ + +#ifdef __cplusplus +extern "C" { +#endif + +typedef int (*_ntfs_frag_append_t)(void *ff, u32 offset, u32 sector, u32 count); +int _NTFS_get_fragments (const char *path, _ntfs_frag_append_t append_fragment, void *callback_data); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/include/pngconf.h b/portlibs/include/pngconf.h new file mode 100644 index 00000000..464458d0 --- /dev/null +++ b/portlibs/include/pngconf.h @@ -0,0 +1,1487 @@ + +/* pngconf.h - machine configurable file for libpng + * + * libpng version 1.2.34 - December 18, 2008 + * For conditions of distribution and use, see copyright notice in png.h + * Copyright (c) 1998-2008 Glenn Randers-Pehrson + * (Version 0.96 Copyright (c) 1996, 1997 Andreas Dilger) + * (Version 0.88 Copyright (c) 1995, 1996 Guy Eric Schalnat, Group 42, Inc.) + */ + +/* Any machine specific code is near the front of this file, so if you + * are configuring libpng for a machine, you may want to read the section + * starting here down to where it starts to typedef png_color, png_text, + * and png_info. + */ + +#ifndef PNGCONF_H +#define PNGCONF_H + +#define PNG_1_2_X + +/* + * PNG_USER_CONFIG has to be defined on the compiler command line. This + * includes the resource compiler for Windows DLL configurations. + */ +#ifdef PNG_USER_CONFIG +# ifndef PNG_USER_PRIVATEBUILD +# define PNG_USER_PRIVATEBUILD +# endif +#include "pngusr.h" +#endif + +/* PNG_CONFIGURE_LIBPNG is set by the "configure" script. */ +#ifdef PNG_CONFIGURE_LIBPNG +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif +#endif + +/* + * Added at libpng-1.2.8 + * + * If you create a private DLL you need to define in "pngusr.h" the followings: + * #define PNG_USER_PRIVATEBUILD <Describes by whom and why this version of + * the DLL was built> + * e.g. #define PNG_USER_PRIVATEBUILD "Build by MyCompany for xyz reasons." + * #define PNG_USER_DLLFNAME_POSTFIX <two-letter postfix that serve to + * distinguish your DLL from those of the official release. These + * correspond to the trailing letters that come after the version + * number and must match your private DLL name> + * e.g. // private DLL "libpng13gx.dll" + * #define PNG_USER_DLLFNAME_POSTFIX "gx" + * + * The following macros are also at your disposal if you want to complete the + * DLL VERSIONINFO structure. + * - PNG_USER_VERSIONINFO_COMMENTS + * - PNG_USER_VERSIONINFO_COMPANYNAME + * - PNG_USER_VERSIONINFO_LEGALTRADEMARKS + */ + +#ifdef __STDC__ +#ifdef SPECIALBUILD +# pragma message("PNG_LIBPNG_SPECIALBUILD (and deprecated SPECIALBUILD)\ + are now LIBPNG reserved macros. Use PNG_USER_PRIVATEBUILD instead.") +#endif + +#ifdef PRIVATEBUILD +# pragma message("PRIVATEBUILD is deprecated.\ + Use PNG_USER_PRIVATEBUILD instead.") +# define PNG_USER_PRIVATEBUILD PRIVATEBUILD +#endif +#endif /* __STDC__ */ + +#ifndef PNG_VERSION_INFO_ONLY + +/* End of material added to libpng-1.2.8 */ + +/* Added at libpng-1.2.19, removed at libpng-1.2.20 because it caused trouble + Restored at libpng-1.2.21 */ +#if !defined(PNG_NO_WARN_UNINITIALIZED_ROW) && \ + !defined(PNG_WARN_UNINITIALIZED_ROW) +# define PNG_WARN_UNINITIALIZED_ROW 1 +#endif +/* End of material added at libpng-1.2.19/1.2.21 */ + +/* This is the size of the compression buffer, and thus the size of + * an IDAT chunk. Make this whatever size you feel is best for your + * machine. One of these will be allocated per png_struct. When this + * is full, it writes the data to the disk, and does some other + * calculations. Making this an extremely small size will slow + * the library down, but you may want to experiment to determine + * where it becomes significant, if you are concerned with memory + * usage. Note that zlib allocates at least 32Kb also. For readers, + * this describes the size of the buffer available to read the data in. + * Unless this gets smaller than the size of a row (compressed), + * it should not make much difference how big this is. + */ + +#ifndef PNG_ZBUF_SIZE +# define PNG_ZBUF_SIZE 8192 +#endif + +/* Enable if you want a write-only libpng */ + +#ifndef PNG_NO_READ_SUPPORTED +# define PNG_READ_SUPPORTED +#endif + +/* Enable if you want a read-only libpng */ + +#ifndef PNG_NO_WRITE_SUPPORTED +# define PNG_WRITE_SUPPORTED +#endif + +/* Enabled by default in 1.2.0. You can disable this if you don't need to + support PNGs that are embedded in MNG datastreams */ +#if !defined(PNG_1_0_X) && !defined(PNG_NO_MNG_FEATURES) +# ifndef PNG_MNG_FEATURES_SUPPORTED +# define PNG_MNG_FEATURES_SUPPORTED +# endif +#endif + +#ifndef PNG_NO_FLOATING_POINT_SUPPORTED +# ifndef PNG_FLOATING_POINT_SUPPORTED +# define PNG_FLOATING_POINT_SUPPORTED +# endif +#endif + +/* If you are running on a machine where you cannot allocate more + * than 64K of memory at once, uncomment this. While libpng will not + * normally need that much memory in a chunk (unless you load up a very + * large file), zlib needs to know how big of a chunk it can use, and + * libpng thus makes sure to check any memory allocation to verify it + * will fit into memory. +#define PNG_MAX_MALLOC_64K + */ +#if defined(MAXSEG_64K) && !defined(PNG_MAX_MALLOC_64K) +# define PNG_MAX_MALLOC_64K +#endif + +/* Special munging to support doing things the 'cygwin' way: + * 'Normal' png-on-win32 defines/defaults: + * PNG_BUILD_DLL -- building dll + * PNG_USE_DLL -- building an application, linking to dll + * (no define) -- building static library, or building an + * application and linking to the static lib + * 'Cygwin' defines/defaults: + * PNG_BUILD_DLL -- (ignored) building the dll + * (no define) -- (ignored) building an application, linking to the dll + * PNG_STATIC -- (ignored) building the static lib, or building an + * application that links to the static lib. + * ALL_STATIC -- (ignored) building various static libs, or building an + * application that links to the static libs. + * Thus, + * a cygwin user should define either PNG_BUILD_DLL or PNG_STATIC, and + * this bit of #ifdefs will define the 'correct' config variables based on + * that. If a cygwin user *wants* to define 'PNG_USE_DLL' that's okay, but + * unnecessary. + * + * Also, the precedence order is: + * ALL_STATIC (since we can't #undef something outside our namespace) + * PNG_BUILD_DLL + * PNG_STATIC + * (nothing) == PNG_USE_DLL + * + * CYGWIN (2002-01-20): The preceding is now obsolete. With the advent + * of auto-import in binutils, we no longer need to worry about + * __declspec(dllexport) / __declspec(dllimport) and friends. Therefore, + * we don't need to worry about PNG_STATIC or ALL_STATIC when it comes + * to __declspec() stuff. However, we DO need to worry about + * PNG_BUILD_DLL and PNG_STATIC because those change some defaults + * such as CONSOLE_IO and whether GLOBAL_ARRAYS are allowed. + */ +#if defined(__CYGWIN__) +# if defined(ALL_STATIC) +# if defined(PNG_BUILD_DLL) +# undef PNG_BUILD_DLL +# endif +# if defined(PNG_USE_DLL) +# undef PNG_USE_DLL +# endif +# if defined(PNG_DLL) +# undef PNG_DLL +# endif +# if !defined(PNG_STATIC) +# define PNG_STATIC +# endif +# else +# if defined (PNG_BUILD_DLL) +# if defined(PNG_STATIC) +# undef PNG_STATIC +# endif +# if defined(PNG_USE_DLL) +# undef PNG_USE_DLL +# endif +# if !defined(PNG_DLL) +# define PNG_DLL +# endif +# else +# if defined(PNG_STATIC) +# if defined(PNG_USE_DLL) +# undef PNG_USE_DLL +# endif +# if defined(PNG_DLL) +# undef PNG_DLL +# endif +# else +# if !defined(PNG_USE_DLL) +# define PNG_USE_DLL +# endif +# if !defined(PNG_DLL) +# define PNG_DLL +# endif +# endif +# endif +# endif +#endif + +/* This protects us against compilers that run on a windowing system + * and thus don't have or would rather us not use the stdio types: + * stdin, stdout, and stderr. The only one currently used is stderr + * in png_error() and png_warning(). #defining PNG_NO_CONSOLE_IO will + * prevent these from being compiled and used. #defining PNG_NO_STDIO + * will also prevent these, plus will prevent the entire set of stdio + * macros and functions (FILE *, printf, etc.) from being compiled and used, + * unless (PNG_DEBUG > 0) has been #defined. + * + * #define PNG_NO_CONSOLE_IO + * #define PNG_NO_STDIO + */ + +#if defined(_WIN32_WCE) +# include <windows.h> + /* Console I/O functions are not supported on WindowsCE */ +# define PNG_NO_CONSOLE_IO +# ifdef PNG_DEBUG +# undef PNG_DEBUG +# endif +#endif + +#ifdef PNG_BUILD_DLL +# ifndef PNG_CONSOLE_IO_SUPPORTED +# ifndef PNG_NO_CONSOLE_IO +# define PNG_NO_CONSOLE_IO +# endif +# endif +#endif + +# ifdef PNG_NO_STDIO +# ifndef PNG_NO_CONSOLE_IO +# define PNG_NO_CONSOLE_IO +# endif +# ifdef PNG_DEBUG +# if (PNG_DEBUG > 0) +# include <stdio.h> +# endif +# endif +# else +# if !defined(_WIN32_WCE) +/* "stdio.h" functions are not supported on WindowsCE */ +# include <stdio.h> +# endif +# endif + +/* This macro protects us against machines that don't have function + * prototypes (ie K&R style headers). If your compiler does not handle + * function prototypes, define this macro and use the included ansi2knr. + * I've always been able to use _NO_PROTO as the indicator, but you may + * need to drag the empty declaration out in front of here, or change the + * ifdef to suit your own needs. + */ +#ifndef PNGARG + +#ifdef OF /* zlib prototype munger */ +# define PNGARG(arglist) OF(arglist) +#else + +#ifdef _NO_PROTO +# define PNGARG(arglist) () +# ifndef PNG_TYPECAST_NULL +# define PNG_TYPECAST_NULL +# endif +#else +# define PNGARG(arglist) arglist +#endif /* _NO_PROTO */ + + +#endif /* OF */ + +#endif /* PNGARG */ + +/* Try to determine if we are compiling on a Mac. Note that testing for + * just __MWERKS__ is not good enough, because the Codewarrior is now used + * on non-Mac platforms. + */ +#ifndef MACOS +# if (defined(__MWERKS__) && defined(macintosh)) || defined(applec) || \ + defined(THINK_C) || defined(__SC__) || defined(TARGET_OS_MAC) +# define MACOS +# endif +#endif + +/* enough people need this for various reasons to include it here */ +#if !defined(MACOS) && !defined(RISCOS) && !defined(_WIN32_WCE) +# include <sys/types.h> +#endif + +#if !defined(PNG_SETJMP_NOT_SUPPORTED) && !defined(PNG_NO_SETJMP_SUPPORTED) +# define PNG_SETJMP_SUPPORTED +#endif + +#ifdef PNG_SETJMP_SUPPORTED +/* This is an attempt to force a single setjmp behaviour on Linux. If + * the X config stuff didn't define _BSD_SOURCE we wouldn't need this. + */ + +# ifdef __linux__ +# ifdef _BSD_SOURCE +# define PNG_SAVE_BSD_SOURCE +# undef _BSD_SOURCE +# endif +# ifdef _SETJMP_H + /* If you encounter a compiler error here, see the explanation + * near the end of INSTALL. + */ + __pngconf.h__ already includes setjmp.h; + __dont__ include it again.; +# endif +# endif /* __linux__ */ + + /* include setjmp.h for error handling */ +# include <setjmp.h> + +# ifdef __linux__ +# ifdef PNG_SAVE_BSD_SOURCE +# ifndef _BSD_SOURCE +# define _BSD_SOURCE +# endif +# undef PNG_SAVE_BSD_SOURCE +# endif +# endif /* __linux__ */ +#endif /* PNG_SETJMP_SUPPORTED */ + +#ifdef BSD +# include <strings.h> +#else +# include <string.h> +#endif + +/* Other defines for things like memory and the like can go here. */ +#ifdef PNG_INTERNAL + +#include <stdlib.h> + +/* The functions exported by PNG_EXTERN are PNG_INTERNAL functions, which + * aren't usually used outside the library (as far as I know), so it is + * debatable if they should be exported at all. In the future, when it is + * possible to have run-time registry of chunk-handling functions, some of + * these will be made available again. +#define PNG_EXTERN extern + */ +#define PNG_EXTERN + +/* Other defines specific to compilers can go here. Try to keep + * them inside an appropriate ifdef/endif pair for portability. + */ + +#if defined(PNG_FLOATING_POINT_SUPPORTED) +# if defined(MACOS) + /* We need to check that <math.h> hasn't already been included earlier + * as it seems it doesn't agree with <fp.h>, yet we should really use + * <fp.h> if possible. + */ +# if !defined(__MATH_H__) && !defined(__MATH_H) && !defined(__cmath__) +# include <fp.h> +# endif +# else +# include <math.h> +# endif +# if defined(_AMIGA) && defined(__SASC) && defined(_M68881) + /* Amiga SAS/C: We must include builtin FPU functions when compiling using + * MATH=68881 + */ +# include <m68881.h> +# endif +#endif + +/* Codewarrior on NT has linking problems without this. */ +#if (defined(__MWERKS__) && defined(WIN32)) || defined(__STDC__) +# define PNG_ALWAYS_EXTERN +#endif + +/* This provides the non-ANSI (far) memory allocation routines. */ +#if defined(__TURBOC__) && defined(__MSDOS__) +# include <mem.h> +# include <alloc.h> +#endif + +/* I have no idea why is this necessary... */ +#if defined(_MSC_VER) && (defined(WIN32) || defined(_Windows) || \ + defined(_WINDOWS) || defined(_WIN32) || defined(__WIN32__)) +# include <malloc.h> +#endif + +/* This controls how fine the dithering gets. As this allocates + * a largish chunk of memory (32K), those who are not as concerned + * with dithering quality can decrease some or all of these. + */ +#ifndef PNG_DITHER_RED_BITS +# define PNG_DITHER_RED_BITS 5 +#endif +#ifndef PNG_DITHER_GREEN_BITS +# define PNG_DITHER_GREEN_BITS 5 +#endif +#ifndef PNG_DITHER_BLUE_BITS +# define PNG_DITHER_BLUE_BITS 5 +#endif + +/* This controls how fine the gamma correction becomes when you + * are only interested in 8 bits anyway. Increasing this value + * results in more memory being used, and more pow() functions + * being called to fill in the gamma tables. Don't set this value + * less then 8, and even that may not work (I haven't tested it). + */ + +#ifndef PNG_MAX_GAMMA_8 +# define PNG_MAX_GAMMA_8 11 +#endif + +/* This controls how much a difference in gamma we can tolerate before + * we actually start doing gamma conversion. + */ +#ifndef PNG_GAMMA_THRESHOLD +# define PNG_GAMMA_THRESHOLD 0.05 +#endif + +#endif /* PNG_INTERNAL */ + +/* The following uses const char * instead of char * for error + * and warning message functions, so some compilers won't complain. + * If you do not want to use const, define PNG_NO_CONST here. + */ + +#ifndef PNG_NO_CONST +# define PNG_CONST const +#else +# define PNG_CONST +#endif + +/* The following defines give you the ability to remove code from the + * library that you will not be using. I wish I could figure out how to + * automate this, but I can't do that without making it seriously hard + * on the users. So if you are not using an ability, change the #define + * to and #undef, and that part of the library will not be compiled. If + * your linker can't find a function, you may want to make sure the + * ability is defined here. Some of these depend upon some others being + * defined. I haven't figured out all the interactions here, so you may + * have to experiment awhile to get everything to compile. If you are + * creating or using a shared library, you probably shouldn't touch this, + * as it will affect the size of the structures, and this will cause bad + * things to happen if the library and/or application ever change. + */ + +/* Any features you will not be using can be undef'ed here */ + +/* GR-P, 0.96a: Set "*TRANSFORMS_SUPPORTED as default but allow user + * to turn it off with "*TRANSFORMS_NOT_SUPPORTED" or *PNG_NO_*_TRANSFORMS + * on the compile line, then pick and choose which ones to define without + * having to edit this file. It is safe to use the *TRANSFORMS_NOT_SUPPORTED + * if you only want to have a png-compliant reader/writer but don't need + * any of the extra transformations. This saves about 80 kbytes in a + * typical installation of the library. (PNG_NO_* form added in version + * 1.0.1c, for consistency) + */ + +/* The size of the png_text structure changed in libpng-1.0.6 when + * iTXt support was added. iTXt support was turned off by default through + * libpng-1.2.x, to support old apps that malloc the png_text structure + * instead of calling png_set_text() and letting libpng malloc it. It + * was turned on by default in libpng-1.3.0. + */ + +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +# ifndef PNG_NO_iTXt_SUPPORTED +# define PNG_NO_iTXt_SUPPORTED +# endif +# ifndef PNG_NO_READ_iTXt +# define PNG_NO_READ_iTXt +# endif +# ifndef PNG_NO_WRITE_iTXt +# define PNG_NO_WRITE_iTXt +# endif +#endif + +#if !defined(PNG_NO_iTXt_SUPPORTED) +# if !defined(PNG_READ_iTXt_SUPPORTED) && !defined(PNG_NO_READ_iTXt) +# define PNG_READ_iTXt +# endif +# if !defined(PNG_WRITE_iTXt_SUPPORTED) && !defined(PNG_NO_WRITE_iTXt) +# define PNG_WRITE_iTXt +# endif +#endif + +/* The following support, added after version 1.0.0, can be turned off here en + * masse by defining PNG_LEGACY_SUPPORTED in case you need binary compatibility + * with old applications that require the length of png_struct and png_info + * to remain unchanged. + */ + +#ifdef PNG_LEGACY_SUPPORTED +# define PNG_NO_FREE_ME +# define PNG_NO_READ_UNKNOWN_CHUNKS +# define PNG_NO_WRITE_UNKNOWN_CHUNKS +# define PNG_NO_READ_USER_CHUNKS +# define PNG_NO_READ_iCCP +# define PNG_NO_WRITE_iCCP +# define PNG_NO_READ_iTXt +# define PNG_NO_WRITE_iTXt +# define PNG_NO_READ_sCAL +# define PNG_NO_WRITE_sCAL +# define PNG_NO_READ_sPLT +# define PNG_NO_WRITE_sPLT +# define PNG_NO_INFO_IMAGE +# define PNG_NO_READ_RGB_TO_GRAY +# define PNG_NO_READ_USER_TRANSFORM +# define PNG_NO_WRITE_USER_TRANSFORM +# define PNG_NO_USER_MEM +# define PNG_NO_READ_EMPTY_PLTE +# define PNG_NO_MNG_FEATURES +# define PNG_NO_FIXED_POINT_SUPPORTED +#endif + +/* Ignore attempt to turn off both floating and fixed point support */ +#if !defined(PNG_FLOATING_POINT_SUPPORTED) || \ + !defined(PNG_NO_FIXED_POINT_SUPPORTED) +# define PNG_FIXED_POINT_SUPPORTED +#endif + +#ifndef PNG_NO_FREE_ME +# define PNG_FREE_ME_SUPPORTED +#endif + +#if defined(PNG_READ_SUPPORTED) + +#if !defined(PNG_READ_TRANSFORMS_NOT_SUPPORTED) && \ + !defined(PNG_NO_READ_TRANSFORMS) +# define PNG_READ_TRANSFORMS_SUPPORTED +#endif + +#ifdef PNG_READ_TRANSFORMS_SUPPORTED +# ifndef PNG_NO_READ_EXPAND +# define PNG_READ_EXPAND_SUPPORTED +# endif +# ifndef PNG_NO_READ_SHIFT +# define PNG_READ_SHIFT_SUPPORTED +# endif +# ifndef PNG_NO_READ_PACK +# define PNG_READ_PACK_SUPPORTED +# endif +# ifndef PNG_NO_READ_BGR +# define PNG_READ_BGR_SUPPORTED +# endif +# ifndef PNG_NO_READ_SWAP +# define PNG_READ_SWAP_SUPPORTED +# endif +# ifndef PNG_NO_READ_PACKSWAP +# define PNG_READ_PACKSWAP_SUPPORTED +# endif +# ifndef PNG_NO_READ_INVERT +# define PNG_READ_INVERT_SUPPORTED +# endif +# ifndef PNG_NO_READ_DITHER +# define PNG_READ_DITHER_SUPPORTED +# endif +# ifndef PNG_NO_READ_BACKGROUND +# define PNG_READ_BACKGROUND_SUPPORTED +# endif +# ifndef PNG_NO_READ_16_TO_8 +# define PNG_READ_16_TO_8_SUPPORTED +# endif +# ifndef PNG_NO_READ_FILLER +# define PNG_READ_FILLER_SUPPORTED +# endif +# ifndef PNG_NO_READ_GAMMA +# define PNG_READ_GAMMA_SUPPORTED +# endif +# ifndef PNG_NO_READ_GRAY_TO_RGB +# define PNG_READ_GRAY_TO_RGB_SUPPORTED +# endif +# ifndef PNG_NO_READ_SWAP_ALPHA +# define PNG_READ_SWAP_ALPHA_SUPPORTED +# endif +# ifndef PNG_NO_READ_INVERT_ALPHA +# define PNG_READ_INVERT_ALPHA_SUPPORTED +# endif +# ifndef PNG_NO_READ_STRIP_ALPHA +# define PNG_READ_STRIP_ALPHA_SUPPORTED +# endif +# ifndef PNG_NO_READ_USER_TRANSFORM +# define PNG_READ_USER_TRANSFORM_SUPPORTED +# endif +# ifndef PNG_NO_READ_RGB_TO_GRAY +# define PNG_READ_RGB_TO_GRAY_SUPPORTED +# endif +#endif /* PNG_READ_TRANSFORMS_SUPPORTED */ + +#if !defined(PNG_NO_PROGRESSIVE_READ) && \ + !defined(PNG_PROGRESSIVE_READ_SUPPORTED) /* if you don't do progressive */ +# define PNG_PROGRESSIVE_READ_SUPPORTED /* reading. This is not talking */ +#endif /* about interlacing capability! You'll */ + /* still have interlacing unless you change the following line: */ + +#define PNG_READ_INTERLACING_SUPPORTED /* required in PNG-compliant decoders */ + +#ifndef PNG_NO_READ_COMPOSITE_NODIV +# ifndef PNG_NO_READ_COMPOSITED_NODIV /* libpng-1.0.x misspelling */ +# define PNG_READ_COMPOSITE_NODIV_SUPPORTED /* well tested on Intel, SGI */ +# endif +#endif + +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +/* Deprecated, will be removed from version 2.0.0. + Use PNG_MNG_FEATURES_SUPPORTED instead. */ +#ifndef PNG_NO_READ_EMPTY_PLTE +# define PNG_READ_EMPTY_PLTE_SUPPORTED +#endif +#endif + +#endif /* PNG_READ_SUPPORTED */ + +#if defined(PNG_WRITE_SUPPORTED) + +# if !defined(PNG_WRITE_TRANSFORMS_NOT_SUPPORTED) && \ + !defined(PNG_NO_WRITE_TRANSFORMS) +# define PNG_WRITE_TRANSFORMS_SUPPORTED +#endif + +#ifdef PNG_WRITE_TRANSFORMS_SUPPORTED +# ifndef PNG_NO_WRITE_SHIFT +# define PNG_WRITE_SHIFT_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_PACK +# define PNG_WRITE_PACK_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_BGR +# define PNG_WRITE_BGR_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_SWAP +# define PNG_WRITE_SWAP_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_PACKSWAP +# define PNG_WRITE_PACKSWAP_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_INVERT +# define PNG_WRITE_INVERT_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_FILLER +# define PNG_WRITE_FILLER_SUPPORTED /* same as WRITE_STRIP_ALPHA */ +# endif +# ifndef PNG_NO_WRITE_SWAP_ALPHA +# define PNG_WRITE_SWAP_ALPHA_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_INVERT_ALPHA +# define PNG_WRITE_INVERT_ALPHA_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_USER_TRANSFORM +# define PNG_WRITE_USER_TRANSFORM_SUPPORTED +# endif +#endif /* PNG_WRITE_TRANSFORMS_SUPPORTED */ + +#if !defined(PNG_NO_WRITE_INTERLACING_SUPPORTED) && \ + !defined(PNG_WRITE_INTERLACING_SUPPORTED) +#define PNG_WRITE_INTERLACING_SUPPORTED /* not required for PNG-compliant + encoders, but can cause trouble + if left undefined */ +#endif + +#if !defined(PNG_NO_WRITE_WEIGHTED_FILTER) && \ + !defined(PNG_WRITE_WEIGHTED_FILTER) && \ + defined(PNG_FLOATING_POINT_SUPPORTED) +# define PNG_WRITE_WEIGHTED_FILTER_SUPPORTED +#endif + +#ifndef PNG_NO_WRITE_FLUSH +# define PNG_WRITE_FLUSH_SUPPORTED +#endif + +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +/* Deprecated, see PNG_MNG_FEATURES_SUPPORTED, above */ +#ifndef PNG_NO_WRITE_EMPTY_PLTE +# define PNG_WRITE_EMPTY_PLTE_SUPPORTED +#endif +#endif + +#endif /* PNG_WRITE_SUPPORTED */ + +#ifndef PNG_1_0_X +# ifndef PNG_NO_ERROR_NUMBERS +# define PNG_ERROR_NUMBERS_SUPPORTED +# endif +#endif /* PNG_1_0_X */ + +#if defined(PNG_READ_USER_TRANSFORM_SUPPORTED) || \ + defined(PNG_WRITE_USER_TRANSFORM_SUPPORTED) +# ifndef PNG_NO_USER_TRANSFORM_PTR +# define PNG_USER_TRANSFORM_PTR_SUPPORTED +# endif +#endif + +#ifndef PNG_NO_STDIO +# define PNG_TIME_RFC1123_SUPPORTED +#endif + +/* This adds extra functions in pngget.c for accessing data from the + * info pointer (added in version 0.99) + * png_get_image_width() + * png_get_image_height() + * png_get_bit_depth() + * png_get_color_type() + * png_get_compression_type() + * png_get_filter_type() + * png_get_interlace_type() + * png_get_pixel_aspect_ratio() + * png_get_pixels_per_meter() + * png_get_x_offset_pixels() + * png_get_y_offset_pixels() + * png_get_x_offset_microns() + * png_get_y_offset_microns() + */ +#if !defined(PNG_NO_EASY_ACCESS) && !defined(PNG_EASY_ACCESS_SUPPORTED) +# define PNG_EASY_ACCESS_SUPPORTED +#endif + +/* PNG_ASSEMBLER_CODE was enabled by default in version 1.2.0 + * and removed from version 1.2.20. The following will be removed + * from libpng-1.4.0 +*/ + +#if defined(PNG_READ_SUPPORTED) && !defined(PNG_NO_OPTIMIZED_CODE) +# ifndef PNG_OPTIMIZED_CODE_SUPPORTED +# define PNG_OPTIMIZED_CODE_SUPPORTED +# endif +#endif + +#if defined(PNG_READ_SUPPORTED) && !defined(PNG_NO_ASSEMBLER_CODE) +# ifndef PNG_ASSEMBLER_CODE_SUPPORTED +# define PNG_ASSEMBLER_CODE_SUPPORTED +# endif + +# if defined(__GNUC__) && defined(__x86_64__) && (__GNUC__ < 4) + /* work around 64-bit gcc compiler bugs in gcc-3.x */ +# if !defined(PNG_MMX_CODE_SUPPORTED) && !defined(PNG_NO_MMX_CODE) +# define PNG_NO_MMX_CODE +# endif +# endif + +# if defined(__APPLE__) +# if !defined(PNG_MMX_CODE_SUPPORTED) && !defined(PNG_NO_MMX_CODE) +# define PNG_NO_MMX_CODE +# endif +# endif + +# if (defined(__MWERKS__) && ((__MWERKS__ < 0x0900) || macintosh)) +# if !defined(PNG_MMX_CODE_SUPPORTED) && !defined(PNG_NO_MMX_CODE) +# define PNG_NO_MMX_CODE +# endif +# endif + +# if !defined(PNG_MMX_CODE_SUPPORTED) && !defined(PNG_NO_MMX_CODE) +# define PNG_MMX_CODE_SUPPORTED +# endif + +#endif +/* end of obsolete code to be removed from libpng-1.4.0 */ + +#if !defined(PNG_1_0_X) +#if !defined(PNG_NO_USER_MEM) && !defined(PNG_USER_MEM_SUPPORTED) +# define PNG_USER_MEM_SUPPORTED +#endif +#endif /* PNG_1_0_X */ + +/* Added at libpng-1.2.6 */ +#if !defined(PNG_1_0_X) +#ifndef PNG_SET_USER_LIMITS_SUPPORTED +#if !defined(PNG_NO_SET_USER_LIMITS) && !defined(PNG_SET_USER_LIMITS_SUPPORTED) +# define PNG_SET_USER_LIMITS_SUPPORTED +#endif +#endif +#endif /* PNG_1_0_X */ + +/* Added at libpng-1.0.16 and 1.2.6. To accept all valid PNGS no matter + * how large, set these limits to 0x7fffffffL + */ +#ifndef PNG_USER_WIDTH_MAX +# define PNG_USER_WIDTH_MAX 1000000L +#endif +#ifndef PNG_USER_HEIGHT_MAX +# define PNG_USER_HEIGHT_MAX 1000000L +#endif + + +/* Added at libpng-1.2.34 and 1.4.0 */ +#ifndef PNG_STRING_NEWLINE +#define PNG_STRING_NEWLINE "\n" +#endif + +/* These are currently experimental features, define them if you want */ + +/* very little testing */ +/* +#ifdef PNG_READ_SUPPORTED +# ifndef PNG_READ_16_TO_8_ACCURATE_SCALE_SUPPORTED +# define PNG_READ_16_TO_8_ACCURATE_SCALE_SUPPORTED +# endif +#endif +*/ + +/* This is only for PowerPC big-endian and 680x0 systems */ +/* some testing */ +/* +#ifndef PNG_READ_BIG_ENDIAN_SUPPORTED +# define PNG_READ_BIG_ENDIAN_SUPPORTED +#endif +*/ + +/* Buggy compilers (e.g., gcc 2.7.2.2) need this */ +/* +#define PNG_NO_POINTER_INDEXING +*/ + +/* These functions are turned off by default, as they will be phased out. */ +/* +#define PNG_USELESS_TESTS_SUPPORTED +#define PNG_CORRECT_PALETTE_SUPPORTED +*/ + +/* Any chunks you are not interested in, you can undef here. The + * ones that allocate memory may be expecially important (hIST, + * tEXt, zTXt, tRNS, pCAL). Others will just save time and make png_info + * a bit smaller. + */ + +#if defined(PNG_READ_SUPPORTED) && \ + !defined(PNG_READ_ANCILLARY_CHUNKS_NOT_SUPPORTED) && \ + !defined(PNG_NO_READ_ANCILLARY_CHUNKS) +# define PNG_READ_ANCILLARY_CHUNKS_SUPPORTED +#endif + +#if defined(PNG_WRITE_SUPPORTED) && \ + !defined(PNG_WRITE_ANCILLARY_CHUNKS_NOT_SUPPORTED) && \ + !defined(PNG_NO_WRITE_ANCILLARY_CHUNKS) +# define PNG_WRITE_ANCILLARY_CHUNKS_SUPPORTED +#endif + +#ifdef PNG_READ_ANCILLARY_CHUNKS_SUPPORTED + +#ifdef PNG_NO_READ_TEXT +# define PNG_NO_READ_iTXt +# define PNG_NO_READ_tEXt +# define PNG_NO_READ_zTXt +#endif +#ifndef PNG_NO_READ_bKGD +# define PNG_READ_bKGD_SUPPORTED +# define PNG_bKGD_SUPPORTED +#endif +#ifndef PNG_NO_READ_cHRM +# define PNG_READ_cHRM_SUPPORTED +# define PNG_cHRM_SUPPORTED +#endif +#ifndef PNG_NO_READ_gAMA +# define PNG_READ_gAMA_SUPPORTED +# define PNG_gAMA_SUPPORTED +#endif +#ifndef PNG_NO_READ_hIST +# define PNG_READ_hIST_SUPPORTED +# define PNG_hIST_SUPPORTED +#endif +#ifndef PNG_NO_READ_iCCP +# define PNG_READ_iCCP_SUPPORTED +# define PNG_iCCP_SUPPORTED +#endif +#ifndef PNG_NO_READ_iTXt +# ifndef PNG_READ_iTXt_SUPPORTED +# define PNG_READ_iTXt_SUPPORTED +# endif +# ifndef PNG_iTXt_SUPPORTED +# define PNG_iTXt_SUPPORTED +# endif +#endif +#ifndef PNG_NO_READ_oFFs +# define PNG_READ_oFFs_SUPPORTED +# define PNG_oFFs_SUPPORTED +#endif +#ifndef PNG_NO_READ_pCAL +# define PNG_READ_pCAL_SUPPORTED +# define PNG_pCAL_SUPPORTED +#endif +#ifndef PNG_NO_READ_sCAL +# define PNG_READ_sCAL_SUPPORTED +# define PNG_sCAL_SUPPORTED +#endif +#ifndef PNG_NO_READ_pHYs +# define PNG_READ_pHYs_SUPPORTED +# define PNG_pHYs_SUPPORTED +#endif +#ifndef PNG_NO_READ_sBIT +# define PNG_READ_sBIT_SUPPORTED +# define PNG_sBIT_SUPPORTED +#endif +#ifndef PNG_NO_READ_sPLT +# define PNG_READ_sPLT_SUPPORTED +# define PNG_sPLT_SUPPORTED +#endif +#ifndef PNG_NO_READ_sRGB +# define PNG_READ_sRGB_SUPPORTED +# define PNG_sRGB_SUPPORTED +#endif +#ifndef PNG_NO_READ_tEXt +# define PNG_READ_tEXt_SUPPORTED +# define PNG_tEXt_SUPPORTED +#endif +#ifndef PNG_NO_READ_tIME +# define PNG_READ_tIME_SUPPORTED +# define PNG_tIME_SUPPORTED +#endif +#ifndef PNG_NO_READ_tRNS +# define PNG_READ_tRNS_SUPPORTED +# define PNG_tRNS_SUPPORTED +#endif +#ifndef PNG_NO_READ_zTXt +# define PNG_READ_zTXt_SUPPORTED +# define PNG_zTXt_SUPPORTED +#endif +#ifndef PNG_NO_READ_UNKNOWN_CHUNKS +# define PNG_READ_UNKNOWN_CHUNKS_SUPPORTED +# ifndef PNG_UNKNOWN_CHUNKS_SUPPORTED +# define PNG_UNKNOWN_CHUNKS_SUPPORTED +# endif +# ifndef PNG_NO_HANDLE_AS_UNKNOWN +# define PNG_HANDLE_AS_UNKNOWN_SUPPORTED +# endif +#endif +#if !defined(PNG_NO_READ_USER_CHUNKS) && \ + defined(PNG_READ_UNKNOWN_CHUNKS_SUPPORTED) +# define PNG_READ_USER_CHUNKS_SUPPORTED +# define PNG_USER_CHUNKS_SUPPORTED +# ifdef PNG_NO_READ_UNKNOWN_CHUNKS +# undef PNG_NO_READ_UNKNOWN_CHUNKS +# endif +# ifdef PNG_NO_HANDLE_AS_UNKNOWN +# undef PNG_NO_HANDLE_AS_UNKNOWN +# endif +#endif +#ifndef PNG_NO_READ_OPT_PLTE +# define PNG_READ_OPT_PLTE_SUPPORTED /* only affects support of the */ +#endif /* optional PLTE chunk in RGB and RGBA images */ +#if defined(PNG_READ_iTXt_SUPPORTED) || defined(PNG_READ_tEXt_SUPPORTED) || \ + defined(PNG_READ_zTXt_SUPPORTED) +# define PNG_READ_TEXT_SUPPORTED +# define PNG_TEXT_SUPPORTED +#endif + +#endif /* PNG_READ_ANCILLARY_CHUNKS_SUPPORTED */ + +#ifdef PNG_WRITE_ANCILLARY_CHUNKS_SUPPORTED + +#ifdef PNG_NO_WRITE_TEXT +# define PNG_NO_WRITE_iTXt +# define PNG_NO_WRITE_tEXt +# define PNG_NO_WRITE_zTXt +#endif +#ifndef PNG_NO_WRITE_bKGD +# define PNG_WRITE_bKGD_SUPPORTED +# ifndef PNG_bKGD_SUPPORTED +# define PNG_bKGD_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_cHRM +# define PNG_WRITE_cHRM_SUPPORTED +# ifndef PNG_cHRM_SUPPORTED +# define PNG_cHRM_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_gAMA +# define PNG_WRITE_gAMA_SUPPORTED +# ifndef PNG_gAMA_SUPPORTED +# define PNG_gAMA_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_hIST +# define PNG_WRITE_hIST_SUPPORTED +# ifndef PNG_hIST_SUPPORTED +# define PNG_hIST_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_iCCP +# define PNG_WRITE_iCCP_SUPPORTED +# ifndef PNG_iCCP_SUPPORTED +# define PNG_iCCP_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_iTXt +# ifndef PNG_WRITE_iTXt_SUPPORTED +# define PNG_WRITE_iTXt_SUPPORTED +# endif +# ifndef PNG_iTXt_SUPPORTED +# define PNG_iTXt_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_oFFs +# define PNG_WRITE_oFFs_SUPPORTED +# ifndef PNG_oFFs_SUPPORTED +# define PNG_oFFs_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_pCAL +# define PNG_WRITE_pCAL_SUPPORTED +# ifndef PNG_pCAL_SUPPORTED +# define PNG_pCAL_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_sCAL +# define PNG_WRITE_sCAL_SUPPORTED +# ifndef PNG_sCAL_SUPPORTED +# define PNG_sCAL_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_pHYs +# define PNG_WRITE_pHYs_SUPPORTED +# ifndef PNG_pHYs_SUPPORTED +# define PNG_pHYs_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_sBIT +# define PNG_WRITE_sBIT_SUPPORTED +# ifndef PNG_sBIT_SUPPORTED +# define PNG_sBIT_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_sPLT +# define PNG_WRITE_sPLT_SUPPORTED +# ifndef PNG_sPLT_SUPPORTED +# define PNG_sPLT_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_sRGB +# define PNG_WRITE_sRGB_SUPPORTED +# ifndef PNG_sRGB_SUPPORTED +# define PNG_sRGB_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_tEXt +# define PNG_WRITE_tEXt_SUPPORTED +# ifndef PNG_tEXt_SUPPORTED +# define PNG_tEXt_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_tIME +# define PNG_WRITE_tIME_SUPPORTED +# ifndef PNG_tIME_SUPPORTED +# define PNG_tIME_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_tRNS +# define PNG_WRITE_tRNS_SUPPORTED +# ifndef PNG_tRNS_SUPPORTED +# define PNG_tRNS_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_zTXt +# define PNG_WRITE_zTXt_SUPPORTED +# ifndef PNG_zTXt_SUPPORTED +# define PNG_zTXt_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_UNKNOWN_CHUNKS +# define PNG_WRITE_UNKNOWN_CHUNKS_SUPPORTED +# ifndef PNG_UNKNOWN_CHUNKS_SUPPORTED +# define PNG_UNKNOWN_CHUNKS_SUPPORTED +# endif +# ifndef PNG_NO_HANDLE_AS_UNKNOWN +# ifndef PNG_HANDLE_AS_UNKNOWN_SUPPORTED +# define PNG_HANDLE_AS_UNKNOWN_SUPPORTED +# endif +# endif +#endif +#if defined(PNG_WRITE_iTXt_SUPPORTED) || defined(PNG_WRITE_tEXt_SUPPORTED) || \ + defined(PNG_WRITE_zTXt_SUPPORTED) +# define PNG_WRITE_TEXT_SUPPORTED +# ifndef PNG_TEXT_SUPPORTED +# define PNG_TEXT_SUPPORTED +# endif +#endif + +#endif /* PNG_WRITE_ANCILLARY_CHUNKS_SUPPORTED */ + +/* Turn this off to disable png_read_png() and + * png_write_png() and leave the row_pointers member + * out of the info structure. + */ +#ifndef PNG_NO_INFO_IMAGE +# define PNG_INFO_IMAGE_SUPPORTED +#endif + +/* need the time information for reading tIME chunks */ +#if defined(PNG_tIME_SUPPORTED) +# if !defined(_WIN32_WCE) + /* "time.h" functions are not supported on WindowsCE */ +# include <time.h> +# endif +#endif + +/* Some typedefs to get us started. These should be safe on most of the + * common platforms. The typedefs should be at least as large as the + * numbers suggest (a png_uint_32 must be at least 32 bits long), but they + * don't have to be exactly that size. Some compilers dislike passing + * unsigned shorts as function parameters, so you may be better off using + * unsigned int for png_uint_16. Likewise, for 64-bit systems, you may + * want to have unsigned int for png_uint_32 instead of unsigned long. + */ + +typedef unsigned long png_uint_32; +typedef long png_int_32; +typedef unsigned short png_uint_16; +typedef short png_int_16; +typedef unsigned char png_byte; + +/* This is usually size_t. It is typedef'ed just in case you need it to + change (I'm not sure if you will or not, so I thought I'd be safe) */ +#ifdef PNG_SIZE_T + typedef PNG_SIZE_T png_size_t; +# define png_sizeof(x) png_convert_size(sizeof(x)) +#else + typedef size_t png_size_t; +# define png_sizeof(x) sizeof(x) +#endif + +/* The following is needed for medium model support. It cannot be in the + * PNG_INTERNAL section. Needs modification for other compilers besides + * MSC. Model independent support declares all arrays and pointers to be + * large using the far keyword. The zlib version used must also support + * model independent data. As of version zlib 1.0.4, the necessary changes + * have been made in zlib. The USE_FAR_KEYWORD define triggers other + * changes that are needed. (Tim Wegner) + */ + +/* Separate compiler dependencies (problem here is that zlib.h always + defines FAR. (SJT) */ +#ifdef __BORLANDC__ +# if defined(__LARGE__) || defined(__HUGE__) || defined(__COMPACT__) +# define LDATA 1 +# else +# define LDATA 0 +# endif + /* GRR: why is Cygwin in here? Cygwin is not Borland C... */ +# if !defined(__WIN32__) && !defined(__FLAT__) && !defined(__CYGWIN__) +# define PNG_MAX_MALLOC_64K +# if (LDATA != 1) +# ifndef FAR +# define FAR __far +# endif +# define USE_FAR_KEYWORD +# endif /* LDATA != 1 */ + /* Possibly useful for moving data out of default segment. + * Uncomment it if you want. Could also define FARDATA as + * const if your compiler supports it. (SJT) +# define FARDATA FAR + */ +# endif /* __WIN32__, __FLAT__, __CYGWIN__ */ +#endif /* __BORLANDC__ */ + + +/* Suggest testing for specific compiler first before testing for + * FAR. The Watcom compiler defines both __MEDIUM__ and M_I86MM, + * making reliance oncertain keywords suspect. (SJT) + */ + +/* MSC Medium model */ +#if defined(FAR) +# if defined(M_I86MM) +# define USE_FAR_KEYWORD +# define FARDATA FAR +# include <dos.h> +# endif +#endif + +/* SJT: default case */ +#ifndef FAR +# define FAR +#endif + +/* At this point FAR is always defined */ +#ifndef FARDATA +# define FARDATA +#endif + +/* Typedef for floating-point numbers that are converted + to fixed-point with a multiple of 100,000, e.g., int_gamma */ +typedef png_int_32 png_fixed_point; + +/* Add typedefs for pointers */ +typedef void FAR * png_voidp; +typedef png_byte FAR * png_bytep; +typedef png_uint_32 FAR * png_uint_32p; +typedef png_int_32 FAR * png_int_32p; +typedef png_uint_16 FAR * png_uint_16p; +typedef png_int_16 FAR * png_int_16p; +typedef PNG_CONST char FAR * png_const_charp; +typedef char FAR * png_charp; +typedef png_fixed_point FAR * png_fixed_point_p; + +#ifndef PNG_NO_STDIO +#if defined(_WIN32_WCE) +typedef HANDLE png_FILE_p; +#else +typedef FILE * png_FILE_p; +#endif +#endif + +#ifdef PNG_FLOATING_POINT_SUPPORTED +typedef double FAR * png_doublep; +#endif + +/* Pointers to pointers; i.e. arrays */ +typedef png_byte FAR * FAR * png_bytepp; +typedef png_uint_32 FAR * FAR * png_uint_32pp; +typedef png_int_32 FAR * FAR * png_int_32pp; +typedef png_uint_16 FAR * FAR * png_uint_16pp; +typedef png_int_16 FAR * FAR * png_int_16pp; +typedef PNG_CONST char FAR * FAR * png_const_charpp; +typedef char FAR * FAR * png_charpp; +typedef png_fixed_point FAR * FAR * png_fixed_point_pp; +#ifdef PNG_FLOATING_POINT_SUPPORTED +typedef double FAR * FAR * png_doublepp; +#endif + +/* Pointers to pointers to pointers; i.e., pointer to array */ +typedef char FAR * FAR * FAR * png_charppp; + +#if defined(PNG_1_0_X) || defined(PNG_1_2_X) +/* SPC - Is this stuff deprecated? */ +/* It'll be removed as of libpng-1.3.0 - GR-P */ +/* libpng typedefs for types in zlib. If zlib changes + * or another compression library is used, then change these. + * Eliminates need to change all the source files. + */ +typedef charf * png_zcharp; +typedef charf * FAR * png_zcharpp; +typedef z_stream FAR * png_zstreamp; +#endif /* (PNG_1_0_X) || defined(PNG_1_2_X) */ + +/* + * Define PNG_BUILD_DLL if the module being built is a Windows + * LIBPNG DLL. + * + * Define PNG_USE_DLL if you want to *link* to the Windows LIBPNG DLL. + * It is equivalent to Microsoft predefined macro _DLL that is + * automatically defined when you compile using the share + * version of the CRT (C Run-Time library) + * + * The cygwin mods make this behavior a little different: + * Define PNG_BUILD_DLL if you are building a dll for use with cygwin + * Define PNG_STATIC if you are building a static library for use with cygwin, + * -or- if you are building an application that you want to link to the + * static library. + * PNG_USE_DLL is defined by default (no user action needed) unless one of + * the other flags is defined. + */ + +#if !defined(PNG_DLL) && (defined(PNG_BUILD_DLL) || defined(PNG_USE_DLL)) +# define PNG_DLL +#endif +/* If CYGWIN, then disallow GLOBAL ARRAYS unless building a static lib. + * When building a static lib, default to no GLOBAL ARRAYS, but allow + * command-line override + */ +#if defined(__CYGWIN__) +# if !defined(PNG_STATIC) +# if defined(PNG_USE_GLOBAL_ARRAYS) +# undef PNG_USE_GLOBAL_ARRAYS +# endif +# if !defined(PNG_USE_LOCAL_ARRAYS) +# define PNG_USE_LOCAL_ARRAYS +# endif +# else +# if defined(PNG_USE_LOCAL_ARRAYS) || defined(PNG_NO_GLOBAL_ARRAYS) +# if defined(PNG_USE_GLOBAL_ARRAYS) +# undef PNG_USE_GLOBAL_ARRAYS +# endif +# endif +# endif +# if !defined(PNG_USE_LOCAL_ARRAYS) && !defined(PNG_USE_GLOBAL_ARRAYS) +# define PNG_USE_LOCAL_ARRAYS +# endif +#endif + +/* Do not use global arrays (helps with building DLL's) + * They are no longer used in libpng itself, since version 1.0.5c, + * but might be required for some pre-1.0.5c applications. + */ +#if !defined(PNG_USE_LOCAL_ARRAYS) && !defined(PNG_USE_GLOBAL_ARRAYS) +# if defined(PNG_NO_GLOBAL_ARRAYS) || \ + (defined(__GNUC__) && defined(PNG_DLL)) || defined(_MSC_VER) +# define PNG_USE_LOCAL_ARRAYS +# else +# define PNG_USE_GLOBAL_ARRAYS +# endif +#endif + +#if defined(__CYGWIN__) +# undef PNGAPI +# define PNGAPI __cdecl +# undef PNG_IMPEXP +# define PNG_IMPEXP +#endif + +/* If you define PNGAPI, e.g., with compiler option "-DPNGAPI=__stdcall", + * you may get warnings regarding the linkage of png_zalloc and png_zfree. + * Don't ignore those warnings; you must also reset the default calling + * convention in your compiler to match your PNGAPI, and you must build + * zlib and your applications the same way you build libpng. + */ + +#if defined(__MINGW32__) && !defined(PNG_MODULEDEF) +# ifndef PNG_NO_MODULEDEF +# define PNG_NO_MODULEDEF +# endif +#endif + +#if !defined(PNG_IMPEXP) && defined(PNG_BUILD_DLL) && !defined(PNG_NO_MODULEDEF) +# define PNG_IMPEXP +#endif + +#if defined(PNG_DLL) || defined(_DLL) || defined(__DLL__ ) || \ + (( defined(_Windows) || defined(_WINDOWS) || \ + defined(WIN32) || defined(_WIN32) || defined(__WIN32__) )) + +# ifndef PNGAPI +# if defined(__GNUC__) || (defined (_MSC_VER) && (_MSC_VER >= 800)) +# define PNGAPI __cdecl +# else +# define PNGAPI _cdecl +# endif +# endif + +# if !defined(PNG_IMPEXP) && (!defined(PNG_DLL) || \ + 0 /* WINCOMPILER_WITH_NO_SUPPORT_FOR_DECLIMPEXP */) +# define PNG_IMPEXP +# endif + +# if !defined(PNG_IMPEXP) + +# define PNG_EXPORT_TYPE1(type,symbol) PNG_IMPEXP type PNGAPI symbol +# define PNG_EXPORT_TYPE2(type,symbol) type PNG_IMPEXP PNGAPI symbol + + /* Borland/Microsoft */ +# if defined(_MSC_VER) || defined(__BORLANDC__) +# if (_MSC_VER >= 800) || (__BORLANDC__ >= 0x500) +# define PNG_EXPORT PNG_EXPORT_TYPE1 +# else +# define PNG_EXPORT PNG_EXPORT_TYPE2 +# if defined(PNG_BUILD_DLL) +# define PNG_IMPEXP __export +# else +# define PNG_IMPEXP /*__import */ /* doesn't exist AFAIK in + VC++ */ +# endif /* Exists in Borland C++ for + C++ classes (== huge) */ +# endif +# endif + +# if !defined(PNG_IMPEXP) +# if defined(PNG_BUILD_DLL) +# define PNG_IMPEXP __declspec(dllexport) +# else +# define PNG_IMPEXP __declspec(dllimport) +# endif +# endif +# endif /* PNG_IMPEXP */ +#else /* !(DLL || non-cygwin WINDOWS) */ +# if (defined(__IBMC__) || defined(__IBMCPP__)) && defined(__OS2__) +# ifndef PNGAPI +# define PNGAPI _System +# endif +# else +# if 0 /* ... other platforms, with other meanings */ +# endif +# endif +#endif + +#ifndef PNGAPI +# define PNGAPI +#endif +#ifndef PNG_IMPEXP +# define PNG_IMPEXP +#endif + +#ifdef PNG_BUILDSYMS +# ifndef PNG_EXPORT +# define PNG_EXPORT(type,symbol) PNG_FUNCTION_EXPORT symbol END +# endif +# ifdef PNG_USE_GLOBAL_ARRAYS +# ifndef PNG_EXPORT_VAR +# define PNG_EXPORT_VAR(type) PNG_DATA_EXPORT +# endif +# endif +#endif + +#ifndef PNG_EXPORT +# define PNG_EXPORT(type,symbol) PNG_IMPEXP type PNGAPI symbol +#endif + +#ifdef PNG_USE_GLOBAL_ARRAYS +# ifndef PNG_EXPORT_VAR +# define PNG_EXPORT_VAR(type) extern PNG_IMPEXP type +# endif +#endif + +/* User may want to use these so they are not in PNG_INTERNAL. Any library + * functions that are passed far data must be model independent. + */ + +#ifndef PNG_ABORT +# define PNG_ABORT() abort() +#endif + +#ifdef PNG_SETJMP_SUPPORTED +# define png_jmpbuf(png_ptr) ((png_ptr)->jmpbuf) +#else +# define png_jmpbuf(png_ptr) \ + (LIBPNG_WAS_COMPILED_WITH__PNG_SETJMP_NOT_SUPPORTED) +#endif + +#if defined(USE_FAR_KEYWORD) /* memory model independent fns */ +/* use this to make far-to-near assignments */ +# define CHECK 1 +# define NOCHECK 0 +# define CVT_PTR(ptr) (png_far_to_near(png_ptr,ptr,CHECK)) +# define CVT_PTR_NOCHECK(ptr) (png_far_to_near(png_ptr,ptr,NOCHECK)) +# define png_snprintf _fsnprintf /* Added to v 1.2.19 */ +# define png_strlen _fstrlen +# define png_memcmp _fmemcmp /* SJT: added */ +# define png_memcpy _fmemcpy +# define png_memset _fmemset +#else /* use the usual functions */ +# define CVT_PTR(ptr) (ptr) +# define CVT_PTR_NOCHECK(ptr) (ptr) +# ifndef PNG_NO_SNPRINTF +# ifdef _MSC_VER +# define png_snprintf _snprintf /* Added to v 1.2.19 */ +# define png_snprintf2 _snprintf +# define png_snprintf6 _snprintf +# else +# define png_snprintf snprintf /* Added to v 1.2.19 */ +# define png_snprintf2 snprintf +# define png_snprintf6 snprintf +# endif +# else + /* You don't have or don't want to use snprintf(). Caution: Using + * sprintf instead of snprintf exposes your application to accidental + * or malevolent buffer overflows. If you don't have snprintf() + * as a general rule you should provide one (you can get one from + * Portable OpenSSH). */ +# define png_snprintf(s1,n,fmt,x1) sprintf(s1,fmt,x1) +# define png_snprintf2(s1,n,fmt,x1,x2) sprintf(s1,fmt,x1,x2) +# define png_snprintf6(s1,n,fmt,x1,x2,x3,x4,x5,x6) \ + sprintf(s1,fmt,x1,x2,x3,x4,x5,x6) +# endif +# define png_strlen strlen +# define png_memcmp memcmp /* SJT: added */ +# define png_memcpy memcpy +# define png_memset memset +#endif +/* End of memory model independent support */ + +/* Just a little check that someone hasn't tried to define something + * contradictory. + */ +#if (PNG_ZBUF_SIZE > 65536L) && defined(PNG_MAX_MALLOC_64K) +# undef PNG_ZBUF_SIZE +# define PNG_ZBUF_SIZE 65536L +#endif + +/* Added at libpng-1.2.8 */ +#endif /* PNG_VERSION_INFO_ONLY */ + +#endif /* PNGCONF_H */ diff --git a/portlibs/include/pngu/pngu.h b/portlibs/include/pngu/pngu.h new file mode 100644 index 00000000..a695f82e --- /dev/null +++ b/portlibs/include/pngu/pngu.h @@ -0,0 +1,173 @@ +/******************************************************************************************** + +PNGU Version : 0.2a + +Coder : frontier + +More info : http://frontier-dev.net + +********************************************************************************************/ +#ifndef __PNGU__ +#define __PNGU__ + +// Return codes +#define PNGU_OK 0 +#define PNGU_ODD_WIDTH 1 +#define PNGU_ODD_STRIDE 2 +#define PNGU_INVALID_WIDTH_OR_HEIGHT 3 +#define PNGU_FILE_IS_NOT_PNG 4 +#define PNGU_UNSUPPORTED_COLOR_TYPE 5 +#define PNGU_NO_FILE_SELECTED 6 +#define PNGU_CANT_OPEN_FILE 7 +#define PNGU_CANT_READ_FILE 8 +#define PNGU_LIB_ERROR 9 + +// Color types +#define PNGU_COLOR_TYPE_GRAY 1 +#define PNGU_COLOR_TYPE_GRAY_ALPHA 2 +#define PNGU_COLOR_TYPE_PALETTE 3 +#define PNGU_COLOR_TYPE_RGB 4 +#define PNGU_COLOR_TYPE_RGB_ALPHA 5 +#define PNGU_COLOR_TYPE_UNKNOWN 6 + + +#ifdef __cplusplus + extern "C" { +#endif + +// Types +typedef unsigned char PNGU_u8; +typedef unsigned short PNGU_u16; +typedef unsigned int PNGU_u32; +typedef unsigned long long PNGU_u64; + +typedef struct +{ + PNGU_u8 r; + PNGU_u8 g; + PNGU_u8 b; +} PNGUCOLOR; + +typedef struct +{ + PNGU_u32 imgWidth; // In pixels + PNGU_u32 imgHeight; // In pixels + PNGU_u32 imgBitDepth; // In bitx + PNGU_u32 imgColorType; // PNGU_COLOR_TYPE_* + PNGU_u32 validBckgrnd; // Non zero if there is a background color + PNGUCOLOR bckgrnd; // Backgroun color + PNGU_u32 numTrans; // Number of transparent colors + PNGUCOLOR *trans; // Transparent colors +} PNGUPROP; + +// Image context, always initialize with SelectImageFrom* and free with ReleaseImageContext +struct _IMGCTX; +typedef struct _IMGCTX *IMGCTX; + + +/**************************************************************************** +* Pixel conversion * +****************************************************************************/ + +// Macro to convert RGB8 values to RGB565 +#define PNGU_RGB8_TO_RGB565(r,g,b) ( ((((PNGU_u16) r) & 0xF8U) << 8) | ((((PNGU_u16) g) & 0xFCU) << 3) | (((PNGU_u16) b) >> 3) ) + +// Macro to convert RGBA8 values to RGB5A3 +#define PNGU_RGB8_TO_RGB5A3(r,g,b,a) (PNGU_u16) (((a & 0xE0U) == 0xE0U) ? \ + (0x8000U | ((((PNGU_u16) r) & 0xF8U) << 7) | ((((PNGU_u16) g) & 0xF8U) << 2) | (((PNGU_u16) b) >> 3)) : \ + (((((PNGU_u16) a) & 0xE0U) << 7) | ((((PNGU_u16) r) & 0xF0U) << 4) | (((PNGU_u16) g) & 0xF0U) | ((((PNGU_u16) b) & 0xF0U) >> 4))) + +// Function to convert two RGB8 values to YCbYCr +PNGU_u32 PNGU_RGB8_TO_YCbYCr (PNGU_u8 r1, PNGU_u8 g1, PNGU_u8 b1, PNGU_u8 r2, PNGU_u8 g2, PNGU_u8 b2); + +// Function to convert an YCbYCr to two RGB8 values. +void PNGU_YCbYCr_TO_RGB8 (PNGU_u32 ycbycr, PNGU_u8 *r1, PNGU_u8 *g1, PNGU_u8 *b1, PNGU_u8 *r2, PNGU_u8 *g2, PNGU_u8 *b2); + + +/**************************************************************************** +* Image context handling * +****************************************************************************/ + +// Selects a PNG file, previosly loaded into a buffer, and creates an image context for subsequent procesing. +IMGCTX PNGU_SelectImageFromBuffer (const void *buffer); + +// Selects a PNG file, from any devoptab device, and creates an image context for subsequent procesing. +IMGCTX PNGU_SelectImageFromDevice (const char *filename); + +// Frees resources associated with an image context. Always call this function when you no longer need the IMGCTX. +void PNGU_ReleaseImageContext (IMGCTX ctx); + + +/**************************************************************************** +* Miscelaneous * +****************************************************************************/ + +// Retrieves info from selected PNG file, including image dimensions, color format, background and transparency colors. +int PNGU_GetImageProperties (IMGCTX ctx, PNGUPROP *fileproperties); + + +/**************************************************************************** +* Image conversion * +****************************************************************************/ + +// Expands selected image into an YCbYCr buffer. You need to specify context, image dimensions, +// destination address and stride in pixels (stride = buffer width - image width). +int PNGU_DecodeToYCbYCr (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride); + +// Macro for decoding an image inside a buffer at given coordinates. +#define PNGU_DECODE_TO_COORDS_YCbYCr(ctx,coordX,coordY,imgWidth,imgHeight,bufferWidth,bufferHeight,buffer) \ + \ + PNGU_DecodeToYCbYCr (ctx, imgWidth, imgHeight, ((void *) buffer) + (coordY) * (bufferWidth) * 2 + \ + (coordX) * 2, (bufferWidth) - (imgWidth)) + +// Expands selected image into a linear RGB565 buffer. You need to specify context, image dimensions, +// destination address and stride in pixels (stride = buffer width - image width). +int PNGU_DecodeToRGB565 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride); + +// Macro for decoding an image inside a buffer at given coordinates. +#define PNGU_DECODE_TO_COORDS_RGB565(ctx,coordX,coordY,imgWidth,imgHeight,bufferWidth,bufferHeight,buffer) \ + \ + PNGU_DecodeToRGB565 (ctx, imgWidth, imgHeight, ((void *) buffer) + (coordY) * (bufferWidth) * 2 + \ + (coordX) * 2, (bufferWidth) - (imgWidth)) + +// Expands selected image into a linear RGBA8 buffer. You need to specify context, image dimensions, +// destination address, stride in pixels and default alpha value, which is used if the source image +// doesn't have an alpha channel. +int PNGU_DecodeToRGBA8 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride, PNGU_u8 default_alpha); + +// Macro for decoding an image inside a buffer at given coordinates. +#define PNGU_DECODE_TO_COORDS_RGBA8(ctx,coordX,coordY,imgWidth,imgHeight,default_alpha,bufferWidth,bufferHeight,buffer) \ + \ + PNGU_DecodeToRGBA8 (ctx, imgWidth, imgHeight, ((void *) buffer) + (coordY) * (bufferWidth) * 2 + \ + (coordX) * 2, (bufferWidth) - (imgWidth), default_alpha) + +// Expands selected image into a 4x4 tiled RGB565 buffer. You need to specify context, image dimensions +// and destination address. +int PNGU_DecodeTo4x4RGB565 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer); + +// Expands selected image into a 4x4 tiled RGB5A3 buffer. You need to specify context, image dimensions, +// destination address and default alpha value, which is used if the source image doesn't have an alpha channel. +int PNGU_DecodeTo4x4RGB5A3 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u8 default_alpha); + +// Expands selected image into a 4x4 tiled RGBA8 buffer. You need to specify context, image dimensions, +// destination address and default alpha value, which is used if the source image doesn't have an alpha channel. +int PNGU_DecodeTo4x4RGBA8 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u8 default_alpha); + +// Encodes an YCbYCr image in PNG format and stores it in the selected device or memory buffer. You need to +// specify context, image dimensions, destination address and stride in pixels (stride = buffer width - image width). +int PNGU_EncodeFromYCbYCr (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride); + +int PNGU_EncodeFromGXTexture (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride); + +// Macro for encoding an image stored into an YCbYCr buffer at given coordinates. +#define PNGU_ENCODE_TO_COORDS_YCbYCr(ctx,coordX,coordY,imgWidth,imgHeight,bufferWidth,bufferHeight,buffer) \ + \ + PNGU_EncodeFromYCbYCr (ctx, imgWidth, imgHeight, ((void *) buffer) + (coordY) * (bufferWidth) * 2 + \ + (coordX) * 2, (bufferWidth) - (imgWidth)) + +#ifdef __cplusplus + } +#endif + +#endif + diff --git a/portlibs/include/tremor/config_types.h b/portlibs/include/tremor/config_types.h new file mode 100644 index 00000000..4f07a037 --- /dev/null +++ b/portlibs/include/tremor/config_types.h @@ -0,0 +1,26 @@ +/******************************************************************** + * * + * THIS FILE IS PART OF THE OggVorbis 'TREMOR' CODEC SOURCE CODE. * + * * + * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS * + * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE * + * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. * + * * + * THE OggVorbis 'TREMOR' SOURCE CODE IS (C) COPYRIGHT 1994-2002 * + * BY THE Xiph.Org FOUNDATION http://www.xiph.org/ * + * * + ******************************************************************** + + function: #ifdef jail to whip a few platforms into the UNIX ideal. + + ********************************************************************/ +#ifndef _OS_CVTYPES_H +#define _OS_CVTYPES_H + +typedef long long ogg_int64_t; +typedef int ogg_int32_t; +typedef unsigned int ogg_uint32_t; +typedef short ogg_int16_t; +typedef unsigned short ogg_uint16_t; + +#endif diff --git a/portlibs/include/tremor/ivorbiscodec.h b/portlibs/include/tremor/ivorbiscodec.h new file mode 100644 index 00000000..0eea9eb8 --- /dev/null +++ b/portlibs/include/tremor/ivorbiscodec.h @@ -0,0 +1,104 @@ +/******************************************************************** + * * + * THIS FILE IS PART OF THE OggVorbis 'TREMOR' CODEC SOURCE CODE. * + * * + * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS * + * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE * + * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. * + * * + * THE OggVorbis 'TREMOR' SOURCE CODE IS (C) COPYRIGHT 1994-2002 * + * BY THE Xiph.Org FOUNDATION http://www.xiph.org/ * + * * + ******************************************************************** + + function: libvorbis codec headers + + ********************************************************************/ + +#ifndef _vorbis_codec_h_ +#define _vorbis_codec_h_ + +#ifdef __cplusplus +extern "C" +{ +#endif /* __cplusplus */ + +#include "ogg.h" + +struct vorbis_dsp_state; +typedef struct vorbis_dsp_state vorbis_dsp_state; + +typedef struct vorbis_info{ + int version; + int channels; + long rate; + + /* The below bitrate declarations are *hints*. + Combinations of the three values carry the following implications: + + all three set to the same value: + implies a fixed rate bitstream + only nominal set: + implies a VBR stream that averages the nominal bitrate. No hard + upper/lower limit + upper and or lower set: + implies a VBR bitstream that obeys the bitrate limits. nominal + may also be set to give a nominal rate. + none set: + the coder does not care to speculate. + */ + + long bitrate_upper; + long bitrate_nominal; + long bitrate_lower; + long bitrate_window; + + void *codec_setup; +} vorbis_info; + +typedef struct vorbis_comment{ + char **user_comments; + int *comment_lengths; + int comments; + char *vendor; + +} vorbis_comment; + + +/* Vorbis PRIMITIVES: general ***************************************/ + +extern void vorbis_info_init(vorbis_info *vi); +extern void vorbis_info_clear(vorbis_info *vi); +extern int vorbis_info_blocksize(vorbis_info *vi,int zo); +extern void vorbis_comment_init(vorbis_comment *vc); +extern void vorbis_comment_add(vorbis_comment *vc, char *comment); +extern void vorbis_comment_add_tag(vorbis_comment *vc, + char *tag, char *contents); +extern char *vorbis_comment_query(vorbis_comment *vc, char *tag, int count); +extern int vorbis_comment_query_count(vorbis_comment *vc, char *tag); +extern void vorbis_comment_clear(vorbis_comment *vc); + +/* Vorbis ERRORS and return codes ***********************************/ + +#define OV_FALSE -1 +#define OV_EOF -2 +#define OV_HOLE -3 + +#define OV_EREAD -128 +#define OV_EFAULT -129 +#define OV_EIMPL -130 +#define OV_EINVAL -131 +#define OV_ENOTVORBIS -132 +#define OV_EBADHEADER -133 +#define OV_EVERSION -134 +#define OV_ENOTAUDIO -135 +#define OV_EBADPACKET -136 +#define OV_EBADLINK -137 +#define OV_ENOSEEK -138 + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif + diff --git a/portlibs/include/tremor/ivorbisfile.h b/portlibs/include/tremor/ivorbisfile.h new file mode 100644 index 00000000..7ebc0427 --- /dev/null +++ b/portlibs/include/tremor/ivorbisfile.h @@ -0,0 +1,122 @@ +/******************************************************************** + * * + * THIS FILE IS PART OF THE OggVorbis 'TREMOR' CODEC SOURCE CODE. * + * * + * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS * + * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE * + * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. * + * * + * THE OggVorbis 'TREMOR' SOURCE CODE IS (C) COPYRIGHT 1994-2003 * + * BY THE Xiph.Org FOUNDATION http://www.xiph.org/ * + * * + ******************************************************************** + + function: stdio-based convenience library for opening/seeking/decoding + + ********************************************************************/ + +#ifndef _OV_FILE_H_ +#define _OV_FILE_H_ + +#ifdef __cplusplus +extern "C" +{ +#endif /* __cplusplus */ + +#include <stdio.h> +#include "ivorbiscodec.h" + +/* The function prototypes for the callbacks are basically the same as for + * the stdio functions fread, fseek, fclose, ftell. + * The one difference is that the FILE * arguments have been replaced with + * a void * - this is to be used as a pointer to whatever internal data these + * functions might need. In the stdio case, it's just a FILE * cast to a void * + * + * If you use other functions, check the docs for these functions and return + * the right values. For seek_func(), you *MUST* return -1 if the stream is + * unseekable + */ +typedef struct { + size_t (*read_func) (void *ptr, size_t size, size_t nmemb, void *datasource); + int (*seek_func) (void *datasource, ogg_int64_t offset, int whence); + int (*close_func) (void *datasource); + long (*tell_func) (void *datasource); +} ov_callbacks; + +typedef struct OggVorbis_File { + void *datasource; /* Pointer to a FILE *, etc. */ + int seekable; + ogg_int64_t offset; + ogg_int64_t end; + ogg_sync_state *oy; + + /* If the FILE handle isn't seekable (eg, a pipe), only the current + stream appears */ + int links; + ogg_int64_t *offsets; + ogg_int64_t *dataoffsets; + ogg_uint32_t *serialnos; + ogg_int64_t *pcmlengths; + vorbis_info vi; + vorbis_comment vc; + + /* Decoding working state local storage */ + ogg_int64_t pcm_offset; + int ready_state; + ogg_uint32_t current_serialno; + int current_link; + + ogg_int64_t bittrack; + ogg_int64_t samptrack; + + ogg_stream_state *os; /* take physical pages, weld into a logical + stream of packets */ + vorbis_dsp_state *vd; /* central working state for the packet->PCM decoder */ + + ov_callbacks callbacks; + +} OggVorbis_File; + +extern int ov_clear(OggVorbis_File *vf); +extern int ov_open(FILE *f,OggVorbis_File *vf,char *initial,long ibytes); +extern int ov_open_callbacks(void *datasource, OggVorbis_File *vf, + char *initial, long ibytes, ov_callbacks callbacks); + +extern int ov_test(FILE *f,OggVorbis_File *vf,char *initial,long ibytes); +extern int ov_test_callbacks(void *datasource, OggVorbis_File *vf, + char *initial, long ibytes, ov_callbacks callbacks); +extern int ov_test_open(OggVorbis_File *vf); + +extern long ov_bitrate(OggVorbis_File *vf,int i); +extern long ov_bitrate_instant(OggVorbis_File *vf); +extern long ov_streams(OggVorbis_File *vf); +extern long ov_seekable(OggVorbis_File *vf); +extern long ov_serialnumber(OggVorbis_File *vf,int i); + +extern ogg_int64_t ov_raw_total(OggVorbis_File *vf,int i); +extern ogg_int64_t ov_pcm_total(OggVorbis_File *vf,int i); +extern ogg_int64_t ov_time_total(OggVorbis_File *vf,int i); + +extern int ov_raw_seek(OggVorbis_File *vf,ogg_int64_t pos); +extern int ov_pcm_seek(OggVorbis_File *vf,ogg_int64_t pos); +extern int ov_pcm_seek_page(OggVorbis_File *vf,ogg_int64_t pos); +extern int ov_time_seek(OggVorbis_File *vf,ogg_int64_t pos); +extern int ov_time_seek_page(OggVorbis_File *vf,ogg_int64_t pos); + +extern ogg_int64_t ov_raw_tell(OggVorbis_File *vf); +extern ogg_int64_t ov_pcm_tell(OggVorbis_File *vf); +extern ogg_int64_t ov_time_tell(OggVorbis_File *vf); + +extern vorbis_info *ov_info(OggVorbis_File *vf,int link); +extern vorbis_comment *ov_comment(OggVorbis_File *vf,int link); + +extern long ov_read(OggVorbis_File *vf,void *buffer,int length, + int *bitstream); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif + + diff --git a/portlibs/include/tremor/ogg.h b/portlibs/include/tremor/ogg.h new file mode 100644 index 00000000..85cb41b6 --- /dev/null +++ b/portlibs/include/tremor/ogg.h @@ -0,0 +1,206 @@ +/******************************************************************** + * * + * THIS FILE IS PART OF THE OggVorbis 'TREMOR' CODEC SOURCE CODE. * + * * + * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS * + * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE * + * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. * + * * + * THE OggVorbis 'TREMOR' SOURCE CODE IS (C) COPYRIGHT 1994-2003 * + * BY THE Xiph.Org FOUNDATION http://www.xiph.org/ * + * * + ******************************************************************** + + function: subsumed libogg includes + + ********************************************************************/ +#ifndef _OGG_H +#define _OGG_H + +#ifdef __cplusplus +extern "C" { +#endif + +#include "os_types.h" + +typedef struct ogg_buffer_state{ + struct ogg_buffer *unused_buffers; + struct ogg_reference *unused_references; + int outstanding; + int shutdown; +} ogg_buffer_state; + +typedef struct ogg_buffer { + unsigned char *data; + long size; + int refcount; + + union { + ogg_buffer_state *owner; + struct ogg_buffer *next; + } ptr; +} ogg_buffer; + +typedef struct ogg_reference { + ogg_buffer *buffer; + long begin; + long length; + + struct ogg_reference *next; +} ogg_reference; + +typedef struct oggpack_buffer { + int headbit; + unsigned char *headptr; + long headend; + + /* memory management */ + ogg_reference *head; + ogg_reference *tail; + + /* render the byte/bit counter API constant time */ + long count; /* doesn't count the tail */ +} oggpack_buffer; + +typedef struct oggbyte_buffer { + ogg_reference *baseref; + + ogg_reference *ref; + unsigned char *ptr; + long pos; + long end; +} oggbyte_buffer; + +typedef struct ogg_sync_state { + /* decode memory management pool */ + ogg_buffer_state *bufferpool; + + /* stream buffers */ + ogg_reference *fifo_head; + ogg_reference *fifo_tail; + long fifo_fill; + + /* stream sync management */ + int unsynced; + int headerbytes; + int bodybytes; + +} ogg_sync_state; + +typedef struct ogg_stream_state { + ogg_reference *header_head; + ogg_reference *header_tail; + ogg_reference *body_head; + ogg_reference *body_tail; + + int e_o_s; /* set when we have buffered the last + packet in the logical bitstream */ + int b_o_s; /* set after we've written the initial page + of a logical bitstream */ + long serialno; + long pageno; + ogg_int64_t packetno; /* sequence number for decode; the framing + knows where there's a hole in the data, + but we need coupling so that the codec + (which is in a seperate abstraction + layer) also knows about the gap */ + ogg_int64_t granulepos; + + int lacing_fill; + ogg_uint32_t body_fill; + + /* decode-side state data */ + int holeflag; + int spanflag; + int clearflag; + int laceptr; + ogg_uint32_t body_fill_next; + +} ogg_stream_state; + +typedef struct { + ogg_reference *packet; + long bytes; + long b_o_s; + long e_o_s; + ogg_int64_t granulepos; + ogg_int64_t packetno; /* sequence number for decode; the framing + knows where there's a hole in the data, + but we need coupling so that the codec + (which is in a seperate abstraction + layer) also knows about the gap */ +} ogg_packet; + +typedef struct { + ogg_reference *header; + int header_len; + ogg_reference *body; + long body_len; +} ogg_page; + +/* Ogg BITSTREAM PRIMITIVES: bitstream ************************/ + +extern void oggpack_readinit(oggpack_buffer *b,ogg_reference *r); +extern long oggpack_look(oggpack_buffer *b,int bits); +extern void oggpack_adv(oggpack_buffer *b,int bits); +extern long oggpack_read(oggpack_buffer *b,int bits); +extern long oggpack_bytes(oggpack_buffer *b); +extern long oggpack_bits(oggpack_buffer *b); +extern int oggpack_eop(oggpack_buffer *b); + +/* Ogg BITSTREAM PRIMITIVES: decoding **************************/ + +extern ogg_sync_state *ogg_sync_create(void); +extern int ogg_sync_destroy(ogg_sync_state *oy); +extern int ogg_sync_reset(ogg_sync_state *oy); + +extern unsigned char *ogg_sync_bufferin(ogg_sync_state *oy, long size); +extern int ogg_sync_wrote(ogg_sync_state *oy, long bytes); +extern long ogg_sync_pageseek(ogg_sync_state *oy,ogg_page *og); +extern int ogg_sync_pageout(ogg_sync_state *oy, ogg_page *og); +extern int ogg_stream_pagein(ogg_stream_state *os, ogg_page *og); +extern int ogg_stream_packetout(ogg_stream_state *os,ogg_packet *op); +extern int ogg_stream_packetpeek(ogg_stream_state *os,ogg_packet *op); + +/* Ogg BITSTREAM PRIMITIVES: general ***************************/ + +extern ogg_stream_state *ogg_stream_create(int serialno); +extern int ogg_stream_destroy(ogg_stream_state *os); +extern int ogg_stream_reset(ogg_stream_state *os); +extern int ogg_stream_reset_serialno(ogg_stream_state *os,int serialno); +extern int ogg_stream_eos(ogg_stream_state *os); + +extern int ogg_page_checksum_set(ogg_page *og); + +extern int ogg_page_version(ogg_page *og); +extern int ogg_page_continued(ogg_page *og); +extern int ogg_page_bos(ogg_page *og); +extern int ogg_page_eos(ogg_page *og); +extern ogg_int64_t ogg_page_granulepos(ogg_page *og); +extern ogg_uint32_t ogg_page_serialno(ogg_page *og); +extern ogg_uint32_t ogg_page_pageno(ogg_page *og); +extern int ogg_page_packets(ogg_page *og); +extern int ogg_page_getbuffer(ogg_page *og, unsigned char **buffer); + +extern int ogg_packet_release(ogg_packet *op); +extern int ogg_page_release(ogg_page *og); + +extern void ogg_page_dup(ogg_page *d, ogg_page *s); + +/* Ogg BITSTREAM PRIMITIVES: return codes ***************************/ + +#define OGG_SUCCESS 0 + +#define OGG_HOLE -10 +#define OGG_SPAN -11 +#define OGG_EVERSION -12 +#define OGG_ESERIAL -13 +#define OGG_EINVAL -14 +#define OGG_EEOS -15 + + +#ifdef __cplusplus +} +#endif + +#endif /* _OGG_H */ diff --git a/portlibs/include/tremor/os_types.h b/portlibs/include/tremor/os_types.h new file mode 100644 index 00000000..2761aa42 --- /dev/null +++ b/portlibs/include/tremor/os_types.h @@ -0,0 +1,94 @@ +/******************************************************************** + * * + * THIS FILE IS PART OF THE OggVorbis 'TREMOR' CODEC SOURCE CODE. * + * * + * USE, DISTRIBUTION AND REPRODUCTION OF THIS LIBRARY SOURCE IS * + * GOVERNED BY A BSD-STYLE SOURCE LICENSE INCLUDED WITH THIS SOURCE * + * IN 'COPYING'. PLEASE READ THESE TERMS BEFORE DISTRIBUTING. * + * * + * THE OggVorbis 'TREMOR' SOURCE CODE IS (C) COPYRIGHT 1994-2002 * + * BY THE Xiph.Org FOUNDATION http://www.xiph.org/ * + * * + ******************************************************************** + + function: #ifdef jail to whip a few platforms into the UNIX ideal. + + ********************************************************************/ +#ifndef _OS_TYPES_H +#define _OS_TYPES_H + +#ifdef _LOW_ACCURACY_ +# define X(n) (((((n)>>22)+1)>>1) - ((((n)>>22)+1)>>9)) +# define LOOKUP_T const unsigned char +#else +# define X(n) (n) +# define LOOKUP_T const ogg_int32_t +#endif + +/* make it easy on the folks that want to compile the libs with a + different malloc than stdlib */ +#define _ogg_malloc malloc +#define _ogg_calloc calloc +#define _ogg_realloc realloc +#define _ogg_free free + +#ifdef _WIN32 + +# ifndef __GNUC__ + /* MSVC/Borland */ + typedef __int64 ogg_int64_t; + typedef __int32 ogg_int32_t; + typedef unsigned __int32 ogg_uint32_t; + typedef __int16 ogg_int16_t; + typedef unsigned __int16 ogg_uint16_t; +# else + /* Cygwin */ + #include <_G_config.h> + typedef _G_int64_t ogg_int64_t; + typedef _G_int32_t ogg_int32_t; + typedef _G_uint32_t ogg_uint32_t; + typedef _G_int16_t ogg_int16_t; + typedef _G_uint16_t ogg_uint16_t; +# endif + +#elif defined(__MACOS__) + +# include <sys/types.h> + typedef SInt16 ogg_int16_t; + typedef UInt16 ogg_uint16_t; + typedef SInt32 ogg_int32_t; + typedef UInt32 ogg_uint32_t; + typedef SInt64 ogg_int64_t; + +#elif defined(__MACOSX__) /* MacOS X Framework build */ + +# include <sys/types.h> + typedef int16_t ogg_int16_t; + typedef u_int16_t ogg_uint16_t; + typedef int32_t ogg_int32_t; + typedef u_int32_t ogg_uint32_t; + typedef int64_t ogg_int64_t; + +#elif defined(__BEOS__) + + /* Be */ +# include <inttypes.h> + +#elif defined (__EMX__) + + /* OS/2 GCC */ + typedef short ogg_int16_t; + typedef unsigned short ogg_uint16_t; + typedef int ogg_int32_t; + typedef unsigned int ogg_uint32_t; + typedef long long ogg_int64_t; + +#else + +# include <sys/types.h> +# include <sys/param.h> +# include "config_types.h" + +#endif + +#endif /* _OS_TYPES_H */ diff --git a/portlibs/include/wiilight.h b/portlibs/include/wiilight.h new file mode 100644 index 00000000..d24d0bd2 --- /dev/null +++ b/portlibs/include/wiilight.h @@ -0,0 +1,21 @@ +#ifndef _WIILIGHT_H_ +#define _WIILIGHT_H_ + + +#ifdef __cplusplus +extern "C" { +#endif + +void WIILIGHT_Init(); +void WIILIGHT_TurnOn(); +int WIILIGHT_GetLevel(); +int WIILIGHT_SetLevel(int level); + +void WIILIGHT_Toggle(); +void WIILIGHT_TurnOff(); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/include/zconf.h b/portlibs/include/zconf.h new file mode 100644 index 00000000..deb92ea3 --- /dev/null +++ b/portlibs/include/zconf.h @@ -0,0 +1,332 @@ +/* zconf.h -- configuration of the zlib compression library + * Copyright (C) 1995-2005 Jean-loup Gailly. + * For conditions of distribution and use, see copyright notice in zlib.h + */ + +/* @(#) $Id: zconf.h,v 1.3 2008-01-31 23:05:13 wntrmute Exp $ */ + +#ifndef ZCONF_H +#define ZCONF_H + +/* + * If you *really* need a unique prefix for all types and library functions, + * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it. + */ +#ifdef Z_PREFIX +# define deflateInit_ z_deflateInit_ +# define deflate z_deflate +# define deflateEnd z_deflateEnd +# define inflateInit_ z_inflateInit_ +# define inflate z_inflate +# define inflateEnd z_inflateEnd +# define deflateInit2_ z_deflateInit2_ +# define deflateSetDictionary z_deflateSetDictionary +# define deflateCopy z_deflateCopy +# define deflateReset z_deflateReset +# define deflateParams z_deflateParams +# define deflateBound z_deflateBound +# define deflatePrime z_deflatePrime +# define inflateInit2_ z_inflateInit2_ +# define inflateSetDictionary z_inflateSetDictionary +# define inflateSync z_inflateSync +# define inflateSyncPoint z_inflateSyncPoint +# define inflateCopy z_inflateCopy +# define inflateReset z_inflateReset +# define inflateBack z_inflateBack +# define inflateBackEnd z_inflateBackEnd +# define compress z_compress +# define compress2 z_compress2 +# define compressBound z_compressBound +# define uncompress z_uncompress +# define adler32 z_adler32 +# define crc32 z_crc32 +# define get_crc_table z_get_crc_table +# define zError z_zError + +# define alloc_func z_alloc_func +# define free_func z_free_func +# define in_func z_in_func +# define out_func z_out_func +# define Byte z_Byte +# define uInt z_uInt +# define uLong z_uLong +# define Bytef z_Bytef +# define charf z_charf +# define intf z_intf +# define uIntf z_uIntf +# define uLongf z_uLongf +# define voidpf z_voidpf +# define voidp z_voidp +#endif + +#if defined(__MSDOS__) && !defined(MSDOS) +# define MSDOS +#endif +#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2) +# define OS2 +#endif +#if defined(_WINDOWS) && !defined(WINDOWS) +# define WINDOWS +#endif +#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__) +# ifndef WIN32 +# define WIN32 +# endif +#endif +#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32) +# if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__) +# ifndef SYS16BIT +# define SYS16BIT +# endif +# endif +#endif + +/* + * Compile with -DMAXSEG_64K if the alloc function cannot allocate more + * than 64k bytes at a time (needed on systems with 16-bit int). + */ +#ifdef SYS16BIT +# define MAXSEG_64K +#endif +#ifdef MSDOS +# define UNALIGNED_OK +#endif + +#ifdef __STDC_VERSION__ +# ifndef STDC +# define STDC +# endif +# if __STDC_VERSION__ >= 199901L +# ifndef STDC99 +# define STDC99 +# endif +# endif +#endif +#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus)) +# define STDC +#endif +#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__)) +# define STDC +#endif +#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32)) +# define STDC +#endif +#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__)) +# define STDC +#endif + +#if defined(__OS400__) && !defined(STDC) /* iSeries (formerly AS/400). */ +# define STDC +#endif + +#ifndef STDC +# ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */ +# define const /* note: need a more gentle solution here */ +# endif +#endif + +/* Some Mac compilers merge all .h files incorrectly: */ +#if defined(__MWERKS__)||defined(applec)||defined(THINK_C)||defined(__SC__) +# define NO_DUMMY_DECL +#endif + +/* Maximum value for memLevel in deflateInit2 */ +#ifndef MAX_MEM_LEVEL +# ifdef MAXSEG_64K +# define MAX_MEM_LEVEL 8 +# else +# define MAX_MEM_LEVEL 9 +# endif +#endif + +/* Maximum value for windowBits in deflateInit2 and inflateInit2. + * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files + * created by gzip. (Files created by minigzip can still be extracted by + * gzip.) + */ +#ifndef MAX_WBITS +# define MAX_WBITS 15 /* 32K LZ77 window */ +#endif + +/* The memory requirements for deflate are (in bytes): + (1 << (windowBits+2)) + (1 << (memLevel+9)) + that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values) + plus a few kilobytes for small objects. For example, if you want to reduce + the default memory requirements from 256K to 128K, compile with + make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7" + Of course this will generally degrade compression (there's no free lunch). + + The memory requirements for inflate are (in bytes) 1 << windowBits + that is, 32K for windowBits=15 (default value) plus a few kilobytes + for small objects. +*/ + + /* Type declarations */ + +#ifndef OF /* function prototypes */ +# ifdef STDC +# define OF(args) args +# else +# define OF(args) () +# endif +#endif + +/* The following definitions for FAR are needed only for MSDOS mixed + * model programming (small or medium model with some far allocations). + * This was tested only with MSC; for other MSDOS compilers you may have + * to define NO_MEMCPY in zutil.h. If you don't need the mixed model, + * just define FAR to be empty. + */ +#ifdef SYS16BIT +# if defined(M_I86SM) || defined(M_I86MM) + /* MSC small or medium model */ +# define SMALL_MEDIUM +# ifdef _MSC_VER +# define FAR _far +# else +# define FAR far +# endif +# endif +# if (defined(__SMALL__) || defined(__MEDIUM__)) + /* Turbo C small or medium model */ +# define SMALL_MEDIUM +# ifdef __BORLANDC__ +# define FAR _far +# else +# define FAR far +# endif +# endif +#endif + +#if defined(WINDOWS) || defined(WIN32) + /* If building or using zlib as a DLL, define ZLIB_DLL. + * This is not mandatory, but it offers a little performance increase. + */ +# ifdef ZLIB_DLL +# if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500)) +# ifdef ZLIB_INTERNAL +# define ZEXTERN extern __declspec(dllexport) +# else +# define ZEXTERN extern __declspec(dllimport) +# endif +# endif +# endif /* ZLIB_DLL */ + /* If building or using zlib with the WINAPI/WINAPIV calling convention, + * define ZLIB_WINAPI. + * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI. + */ +# ifdef ZLIB_WINAPI +# ifdef FAR +# undef FAR +# endif +# include <windows.h> + /* No need for _export, use ZLIB.DEF instead. */ + /* For complete Windows compatibility, use WINAPI, not __stdcall. */ +# define ZEXPORT WINAPI +# ifdef WIN32 +# define ZEXPORTVA WINAPIV +# else +# define ZEXPORTVA FAR CDECL +# endif +# endif +#endif + +#if defined (__BEOS__) +# ifdef ZLIB_DLL +# ifdef ZLIB_INTERNAL +# define ZEXPORT __declspec(dllexport) +# define ZEXPORTVA __declspec(dllexport) +# else +# define ZEXPORT __declspec(dllimport) +# define ZEXPORTVA __declspec(dllimport) +# endif +# endif +#endif + +#ifndef ZEXTERN +# define ZEXTERN extern +#endif +#ifndef ZEXPORT +# define ZEXPORT +#endif +#ifndef ZEXPORTVA +# define ZEXPORTVA +#endif + +#ifndef FAR +# define FAR +#endif + +#if !defined(__MACTYPES__) +typedef unsigned char Byte; /* 8 bits */ +#endif +typedef unsigned int uInt; /* 16 bits or more */ +typedef unsigned long uLong; /* 32 bits or more */ + +#ifdef SMALL_MEDIUM + /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */ +# define Bytef Byte FAR +#else + typedef Byte FAR Bytef; +#endif +typedef char FAR charf; +typedef int FAR intf; +typedef uInt FAR uIntf; +typedef uLong FAR uLongf; + +#ifdef STDC + typedef void const *voidpc; + typedef void FAR *voidpf; + typedef void *voidp; +#else + typedef Byte const *voidpc; + typedef Byte FAR *voidpf; + typedef Byte *voidp; +#endif + +#if 1 /* HAVE_UNISTD_H -- this line is updated by ./configure */ +# include <sys/types.h> /* for off_t */ +# include <unistd.h> /* for SEEK_* and off_t */ +# ifdef VMS +# include <unixio.h> /* for off_t */ +# endif +# define z_off_t off_t +#endif +#ifndef SEEK_SET +# define SEEK_SET 0 /* Seek from beginning of file. */ +# define SEEK_CUR 1 /* Seek from current position. */ +# define SEEK_END 2 /* Set file pointer to EOF plus "offset" */ +#endif +#ifndef z_off_t +# define z_off_t long +#endif + +#if defined(__OS400__) +# define NO_vsnprintf +#endif + +#if defined(__MVS__) +# define NO_vsnprintf +# ifdef FAR +# undef FAR +# endif +#endif + +/* MVS linker does not support external names larger than 8 bytes */ +#if defined(__MVS__) +# pragma map(deflateInit_,"DEIN") +# pragma map(deflateInit2_,"DEIN2") +# pragma map(deflateEnd,"DEEND") +# pragma map(deflateBound,"DEBND") +# pragma map(inflateInit_,"ININ") +# pragma map(inflateInit2_,"ININ2") +# pragma map(inflateEnd,"INEND") +# pragma map(inflateSync,"INSY") +# pragma map(inflateSetDictionary,"INSEDI") +# pragma map(compressBound,"CMBND") +# pragma map(inflate_table,"INTABL") +# pragma map(inflate_fast,"INFA") +# pragma map(inflate_copyright,"INCOPY") +#endif + +#endif /* ZCONF_H */ diff --git a/portlibs/include/zlib.h b/portlibs/include/zlib.h new file mode 100644 index 00000000..02281792 --- /dev/null +++ b/portlibs/include/zlib.h @@ -0,0 +1,1357 @@ +/* zlib.h -- interface of the 'zlib' general purpose compression library + version 1.2.3, July 18th, 2005 + + Copyright (C) 1995-2005 Jean-loup Gailly and Mark Adler + + This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. + + Jean-loup Gailly Mark Adler + jloup@gzip.org madler@alumni.caltech.edu + + + The data format used by the zlib library is described by RFCs (Request for + Comments) 1950 to 1952 in the files http://www.ietf.org/rfc/rfc1950.txt + (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format). +*/ + +#ifndef ZLIB_H +#define ZLIB_H + +#include "zconf.h" + +#ifdef __cplusplus +extern "C" { +#endif + +#define ZLIB_VERSION "1.2.3" +#define ZLIB_VERNUM 0x1230 + +/* + The 'zlib' compression library provides in-memory compression and + decompression functions, including integrity checks of the uncompressed + data. This version of the library supports only one compression method + (deflation) but other algorithms will be added later and will have the same + stream interface. + + Compression can be done in a single step if the buffers are large + enough (for example if an input file is mmap'ed), or can be done by + repeated calls of the compression function. In the latter case, the + application must provide more input and/or consume the output + (providing more output space) before each call. + + The compressed data format used by default by the in-memory functions is + the zlib format, which is a zlib wrapper documented in RFC 1950, wrapped + around a deflate stream, which is itself documented in RFC 1951. + + The library also supports reading and writing files in gzip (.gz) format + with an interface similar to that of stdio using the functions that start + with "gz". The gzip format is different from the zlib format. gzip is a + gzip wrapper, documented in RFC 1952, wrapped around a deflate stream. + + This library can optionally read and write gzip streams in memory as well. + + The zlib format was designed to be compact and fast for use in memory + and on communications channels. The gzip format was designed for single- + file compression on file systems, has a larger header than zlib to maintain + directory information, and uses a different, slower check method than zlib. + + The library does not install any signal handler. The decoder checks + the consistency of the compressed data, so the library should never + crash even in case of corrupted input. +*/ + +typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size)); +typedef void (*free_func) OF((voidpf opaque, voidpf address)); + +struct internal_state; + +typedef struct z_stream_s { + Bytef *next_in; /* next input byte */ + uInt avail_in; /* number of bytes available at next_in */ + uLong total_in; /* total nb of input bytes read so far */ + + Bytef *next_out; /* next output byte should be put there */ + uInt avail_out; /* remaining free space at next_out */ + uLong total_out; /* total nb of bytes output so far */ + + char *msg; /* last error message, NULL if no error */ + struct internal_state FAR *state; /* not visible by applications */ + + alloc_func zalloc; /* used to allocate the internal state */ + free_func zfree; /* used to free the internal state */ + voidpf opaque; /* private data object passed to zalloc and zfree */ + + int data_type; /* best guess about the data type: binary or text */ + uLong adler; /* adler32 value of the uncompressed data */ + uLong reserved; /* reserved for future use */ +} z_stream; + +typedef z_stream FAR *z_streamp; + +/* + gzip header information passed to and from zlib routines. See RFC 1952 + for more details on the meanings of these fields. +*/ +typedef struct gz_header_s { + int text; /* true if compressed data believed to be text */ + uLong time; /* modification time */ + int xflags; /* extra flags (not used when writing a gzip file) */ + int os; /* operating system */ + Bytef *extra; /* pointer to extra field or Z_NULL if none */ + uInt extra_len; /* extra field length (valid if extra != Z_NULL) */ + uInt extra_max; /* space at extra (only when reading header) */ + Bytef *name; /* pointer to zero-terminated file name or Z_NULL */ + uInt name_max; /* space at name (only when reading header) */ + Bytef *comment; /* pointer to zero-terminated comment or Z_NULL */ + uInt comm_max; /* space at comment (only when reading header) */ + int hcrc; /* true if there was or will be a header crc */ + int done; /* true when done reading gzip header (not used + when writing a gzip file) */ +} gz_header; + +typedef gz_header FAR *gz_headerp; + +/* + The application must update next_in and avail_in when avail_in has + dropped to zero. It must update next_out and avail_out when avail_out + has dropped to zero. The application must initialize zalloc, zfree and + opaque before calling the init function. All other fields are set by the + compression library and must not be updated by the application. + + The opaque value provided by the application will be passed as the first + parameter for calls of zalloc and zfree. This can be useful for custom + memory management. The compression library attaches no meaning to the + opaque value. + + zalloc must return Z_NULL if there is not enough memory for the object. + If zlib is used in a multi-threaded application, zalloc and zfree must be + thread safe. + + On 16-bit systems, the functions zalloc and zfree must be able to allocate + exactly 65536 bytes, but will not be required to allocate more than this + if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS, + pointers returned by zalloc for objects of exactly 65536 bytes *must* + have their offset normalized to zero. The default allocation function + provided by this library ensures this (see zutil.c). To reduce memory + requirements and avoid any allocation of 64K objects, at the expense of + compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h). + + The fields total_in and total_out can be used for statistics or + progress reports. After compression, total_in holds the total size of + the uncompressed data and may be saved for use in the decompressor + (particularly if the decompressor wants to decompress everything in + a single step). +*/ + + /* constants */ + +#define Z_NO_FLUSH 0 +#define Z_PARTIAL_FLUSH 1 /* will be removed, use Z_SYNC_FLUSH instead */ +#define Z_SYNC_FLUSH 2 +#define Z_FULL_FLUSH 3 +#define Z_FINISH 4 +#define Z_BLOCK 5 +/* Allowed flush values; see deflate() and inflate() below for details */ + +#define Z_OK 0 +#define Z_STREAM_END 1 +#define Z_NEED_DICT 2 +#define Z_ERRNO (-1) +#define Z_STREAM_ERROR (-2) +#define Z_DATA_ERROR (-3) +#define Z_MEM_ERROR (-4) +#define Z_BUF_ERROR (-5) +#define Z_VERSION_ERROR (-6) +/* Return codes for the compression/decompression functions. Negative + * values are errors, positive values are used for special but normal events. + */ + +#define Z_NO_COMPRESSION 0 +#define Z_BEST_SPEED 1 +#define Z_BEST_COMPRESSION 9 +#define Z_DEFAULT_COMPRESSION (-1) +/* compression levels */ + +#define Z_FILTERED 1 +#define Z_HUFFMAN_ONLY 2 +#define Z_RLE 3 +#define Z_FIXED 4 +#define Z_DEFAULT_STRATEGY 0 +/* compression strategy; see deflateInit2() below for details */ + +#define Z_BINARY 0 +#define Z_TEXT 1 +#define Z_ASCII Z_TEXT /* for compatibility with 1.2.2 and earlier */ +#define Z_UNKNOWN 2 +/* Possible values of the data_type field (though see inflate()) */ + +#define Z_DEFLATED 8 +/* The deflate compression method (the only one supported in this version) */ + +#define Z_NULL 0 /* for initializing zalloc, zfree, opaque */ + +#define zlib_version zlibVersion() +/* for compatibility with versions < 1.0.2 */ + + /* basic functions */ + +ZEXTERN const char * ZEXPORT zlibVersion OF((void)); +/* The application can compare zlibVersion and ZLIB_VERSION for consistency. + If the first character differs, the library code actually used is + not compatible with the zlib.h header file used by the application. + This check is automatically made by deflateInit and inflateInit. + */ + +/* +ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level)); + + Initializes the internal stream state for compression. The fields + zalloc, zfree and opaque must be initialized before by the caller. + If zalloc and zfree are set to Z_NULL, deflateInit updates them to + use default allocation functions. + + The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9: + 1 gives best speed, 9 gives best compression, 0 gives no compression at + all (the input data is simply copied a block at a time). + Z_DEFAULT_COMPRESSION requests a default compromise between speed and + compression (currently equivalent to level 6). + + deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_STREAM_ERROR if level is not a valid compression level, + Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible + with the version assumed by the caller (ZLIB_VERSION). + msg is set to null if there is no error message. deflateInit does not + perform any compression: this will be done by deflate(). +*/ + + +ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush)); +/* + deflate compresses as much data as possible, and stops when the input + buffer becomes empty or the output buffer becomes full. It may introduce some + output latency (reading input without producing any output) except when + forced to flush. + + The detailed semantics are as follows. deflate performs one or both of the + following actions: + + - Compress more input starting at next_in and update next_in and avail_in + accordingly. If not all input can be processed (because there is not + enough room in the output buffer), next_in and avail_in are updated and + processing will resume at this point for the next call of deflate(). + + - Provide more output starting at next_out and update next_out and avail_out + accordingly. This action is forced if the parameter flush is non zero. + Forcing flush frequently degrades the compression ratio, so this parameter + should be set only when necessary (in interactive applications). + Some output may be provided even if flush is not set. + + Before the call of deflate(), the application should ensure that at least + one of the actions is possible, by providing more input and/or consuming + more output, and updating avail_in or avail_out accordingly; avail_out + should never be zero before the call. The application can consume the + compressed output when it wants, for example when the output buffer is full + (avail_out == 0), or after each call of deflate(). If deflate returns Z_OK + and with zero avail_out, it must be called again after making room in the + output buffer because there might be more output pending. + + Normally the parameter flush is set to Z_NO_FLUSH, which allows deflate to + decide how much data to accumualte before producing output, in order to + maximize compression. + + If the parameter flush is set to Z_SYNC_FLUSH, all pending output is + flushed to the output buffer and the output is aligned on a byte boundary, so + that the decompressor can get all input data available so far. (In particular + avail_in is zero after the call if enough output space has been provided + before the call.) Flushing may degrade compression for some compression + algorithms and so it should be used only when necessary. + + If flush is set to Z_FULL_FLUSH, all output is flushed as with + Z_SYNC_FLUSH, and the compression state is reset so that decompression can + restart from this point if previous compressed data has been damaged or if + random access is desired. Using Z_FULL_FLUSH too often can seriously degrade + compression. + + If deflate returns with avail_out == 0, this function must be called again + with the same value of the flush parameter and more output space (updated + avail_out), until the flush is complete (deflate returns with non-zero + avail_out). In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that + avail_out is greater than six to avoid repeated flush markers due to + avail_out == 0 on return. + + If the parameter flush is set to Z_FINISH, pending input is processed, + pending output is flushed and deflate returns with Z_STREAM_END if there + was enough output space; if deflate returns with Z_OK, this function must be + called again with Z_FINISH and more output space (updated avail_out) but no + more input data, until it returns with Z_STREAM_END or an error. After + deflate has returned Z_STREAM_END, the only possible operations on the + stream are deflateReset or deflateEnd. + + Z_FINISH can be used immediately after deflateInit if all the compression + is to be done in a single step. In this case, avail_out must be at least + the value returned by deflateBound (see below). If deflate does not return + Z_STREAM_END, then it must be called again as described above. + + deflate() sets strm->adler to the adler32 checksum of all input read + so far (that is, total_in bytes). + + deflate() may update strm->data_type if it can make a good guess about + the input data type (Z_BINARY or Z_TEXT). In doubt, the data is considered + binary. This field is only for information purposes and does not affect + the compression algorithm in any manner. + + deflate() returns Z_OK if some progress has been made (more input + processed or more output produced), Z_STREAM_END if all input has been + consumed and all output has been produced (only when flush is set to + Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example + if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible + (for example avail_in or avail_out was zero). Note that Z_BUF_ERROR is not + fatal, and deflate() can be called again with more input and more output + space to continue compressing. +*/ + + +ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm)); +/* + All dynamically allocated data structures for this stream are freed. + This function discards any unprocessed input and does not flush any + pending output. + + deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the + stream state was inconsistent, Z_DATA_ERROR if the stream was freed + prematurely (some input or output was discarded). In the error case, + msg may be set but then points to a static string (which must not be + deallocated). +*/ + + +/* +ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm)); + + Initializes the internal stream state for decompression. The fields + next_in, avail_in, zalloc, zfree and opaque must be initialized before by + the caller. If next_in is not Z_NULL and avail_in is large enough (the exact + value depends on the compression method), inflateInit determines the + compression method from the zlib header and allocates all data structures + accordingly; otherwise the allocation will be deferred to the first call of + inflate. If zalloc and zfree are set to Z_NULL, inflateInit updates them to + use default allocation functions. + + inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_VERSION_ERROR if the zlib library version is incompatible with the + version assumed by the caller. msg is set to null if there is no error + message. inflateInit does not perform any decompression apart from reading + the zlib header if present: this will be done by inflate(). (So next_in and + avail_in may be modified, but next_out and avail_out are unchanged.) +*/ + + +ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush)); +/* + inflate decompresses as much data as possible, and stops when the input + buffer becomes empty or the output buffer becomes full. It may introduce + some output latency (reading input without producing any output) except when + forced to flush. + + The detailed semantics are as follows. inflate performs one or both of the + following actions: + + - Decompress more input starting at next_in and update next_in and avail_in + accordingly. If not all input can be processed (because there is not + enough room in the output buffer), next_in is updated and processing + will resume at this point for the next call of inflate(). + + - Provide more output starting at next_out and update next_out and avail_out + accordingly. inflate() provides as much output as possible, until there + is no more input data or no more space in the output buffer (see below + about the flush parameter). + + Before the call of inflate(), the application should ensure that at least + one of the actions is possible, by providing more input and/or consuming + more output, and updating the next_* and avail_* values accordingly. + The application can consume the uncompressed output when it wants, for + example when the output buffer is full (avail_out == 0), or after each + call of inflate(). If inflate returns Z_OK and with zero avail_out, it + must be called again after making room in the output buffer because there + might be more output pending. + + The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH, + Z_FINISH, or Z_BLOCK. Z_SYNC_FLUSH requests that inflate() flush as much + output as possible to the output buffer. Z_BLOCK requests that inflate() stop + if and when it gets to the next deflate block boundary. When decoding the + zlib or gzip format, this will cause inflate() to return immediately after + the header and before the first block. When doing a raw inflate, inflate() + will go ahead and process the first block, and will return when it gets to + the end of that block, or when it runs out of data. + + The Z_BLOCK option assists in appending to or combining deflate streams. + Also to assist in this, on return inflate() will set strm->data_type to the + number of unused bits in the last byte taken from strm->next_in, plus 64 + if inflate() is currently decoding the last block in the deflate stream, + plus 128 if inflate() returned immediately after decoding an end-of-block + code or decoding the complete header up to just before the first byte of the + deflate stream. The end-of-block will not be indicated until all of the + uncompressed data from that block has been written to strm->next_out. The + number of unused bits may in general be greater than seven, except when + bit 7 of data_type is set, in which case the number of unused bits will be + less than eight. + + inflate() should normally be called until it returns Z_STREAM_END or an + error. However if all decompression is to be performed in a single step + (a single call of inflate), the parameter flush should be set to + Z_FINISH. In this case all pending input is processed and all pending + output is flushed; avail_out must be large enough to hold all the + uncompressed data. (The size of the uncompressed data may have been saved + by the compressor for this purpose.) The next operation on this stream must + be inflateEnd to deallocate the decompression state. The use of Z_FINISH + is never required, but can be used to inform inflate that a faster approach + may be used for the single inflate() call. + + In this implementation, inflate() always flushes as much output as + possible to the output buffer, and always uses the faster approach on the + first call. So the only effect of the flush parameter in this implementation + is on the return value of inflate(), as noted below, or when it returns early + because Z_BLOCK is used. + + If a preset dictionary is needed after this call (see inflateSetDictionary + below), inflate sets strm->adler to the adler32 checksum of the dictionary + chosen by the compressor and returns Z_NEED_DICT; otherwise it sets + strm->adler to the adler32 checksum of all output produced so far (that is, + total_out bytes) and returns Z_OK, Z_STREAM_END or an error code as described + below. At the end of the stream, inflate() checks that its computed adler32 + checksum is equal to that saved by the compressor and returns Z_STREAM_END + only if the checksum is correct. + + inflate() will decompress and check either zlib-wrapped or gzip-wrapped + deflate data. The header type is detected automatically. Any information + contained in the gzip header is not retained, so applications that need that + information should instead use raw inflate, see inflateInit2() below, or + inflateBack() and perform their own processing of the gzip header and + trailer. + + inflate() returns Z_OK if some progress has been made (more input processed + or more output produced), Z_STREAM_END if the end of the compressed data has + been reached and all uncompressed output has been produced, Z_NEED_DICT if a + preset dictionary is needed at this point, Z_DATA_ERROR if the input data was + corrupted (input stream not conforming to the zlib format or incorrect check + value), Z_STREAM_ERROR if the stream structure was inconsistent (for example + if next_in or next_out was NULL), Z_MEM_ERROR if there was not enough memory, + Z_BUF_ERROR if no progress is possible or if there was not enough room in the + output buffer when Z_FINISH is used. Note that Z_BUF_ERROR is not fatal, and + inflate() can be called again with more input and more output space to + continue decompressing. If Z_DATA_ERROR is returned, the application may then + call inflateSync() to look for a good compression block if a partial recovery + of the data is desired. +*/ + + +ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm)); +/* + All dynamically allocated data structures for this stream are freed. + This function discards any unprocessed input and does not flush any + pending output. + + inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state + was inconsistent. In the error case, msg may be set but then points to a + static string (which must not be deallocated). +*/ + + /* Advanced functions */ + +/* + The following functions are needed only in some special applications. +*/ + +/* +ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm, + int level, + int method, + int windowBits, + int memLevel, + int strategy)); + + This is another version of deflateInit with more compression options. The + fields next_in, zalloc, zfree and opaque must be initialized before by + the caller. + + The method parameter is the compression method. It must be Z_DEFLATED in + this version of the library. + + The windowBits parameter is the base two logarithm of the window size + (the size of the history buffer). It should be in the range 8..15 for this + version of the library. Larger values of this parameter result in better + compression at the expense of memory usage. The default value is 15 if + deflateInit is used instead. + + windowBits can also be -8..-15 for raw deflate. In this case, -windowBits + determines the window size. deflate() will then generate raw deflate data + with no zlib header or trailer, and will not compute an adler32 check value. + + windowBits can also be greater than 15 for optional gzip encoding. Add + 16 to windowBits to write a simple gzip header and trailer around the + compressed data instead of a zlib wrapper. The gzip header will have no + file name, no extra data, no comment, no modification time (set to zero), + no header crc, and the operating system will be set to 255 (unknown). If a + gzip stream is being written, strm->adler is a crc32 instead of an adler32. + + The memLevel parameter specifies how much memory should be allocated + for the internal compression state. memLevel=1 uses minimum memory but + is slow and reduces compression ratio; memLevel=9 uses maximum memory + for optimal speed. The default value is 8. See zconf.h for total memory + usage as a function of windowBits and memLevel. + + The strategy parameter is used to tune the compression algorithm. Use the + value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a + filter (or predictor), Z_HUFFMAN_ONLY to force Huffman encoding only (no + string match), or Z_RLE to limit match distances to one (run-length + encoding). Filtered data consists mostly of small values with a somewhat + random distribution. In this case, the compression algorithm is tuned to + compress them better. The effect of Z_FILTERED is to force more Huffman + coding and less string matching; it is somewhat intermediate between + Z_DEFAULT and Z_HUFFMAN_ONLY. Z_RLE is designed to be almost as fast as + Z_HUFFMAN_ONLY, but give better compression for PNG image data. The strategy + parameter only affects the compression ratio but not the correctness of the + compressed output even if it is not set appropriately. Z_FIXED prevents the + use of dynamic Huffman codes, allowing for a simpler decoder for special + applications. + + deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid + method). msg is set to null if there is no error message. deflateInit2 does + not perform any compression: this will be done by deflate(). +*/ + +ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm, + const Bytef *dictionary, + uInt dictLength)); +/* + Initializes the compression dictionary from the given byte sequence + without producing any compressed output. This function must be called + immediately after deflateInit, deflateInit2 or deflateReset, before any + call of deflate. The compressor and decompressor must use exactly the same + dictionary (see inflateSetDictionary). + + The dictionary should consist of strings (byte sequences) that are likely + to be encountered later in the data to be compressed, with the most commonly + used strings preferably put towards the end of the dictionary. Using a + dictionary is most useful when the data to be compressed is short and can be + predicted with good accuracy; the data can then be compressed better than + with the default empty dictionary. + + Depending on the size of the compression data structures selected by + deflateInit or deflateInit2, a part of the dictionary may in effect be + discarded, for example if the dictionary is larger than the window size in + deflate or deflate2. Thus the strings most likely to be useful should be + put at the end of the dictionary, not at the front. In addition, the + current implementation of deflate will use at most the window size minus + 262 bytes of the provided dictionary. + + Upon return of this function, strm->adler is set to the adler32 value + of the dictionary; the decompressor may later use this value to determine + which dictionary has been used by the compressor. (The adler32 value + applies to the whole dictionary even if only a subset of the dictionary is + actually used by the compressor.) If a raw deflate was requested, then the + adler32 value is not computed and strm->adler is not set. + + deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a + parameter is invalid (such as NULL dictionary) or the stream state is + inconsistent (for example if deflate has already been called for this stream + or if the compression method is bsort). deflateSetDictionary does not + perform any compression: this will be done by deflate(). +*/ + +ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest, + z_streamp source)); +/* + Sets the destination stream as a complete copy of the source stream. + + This function can be useful when several compression strategies will be + tried, for example when there are several ways of pre-processing the input + data with a filter. The streams that will be discarded should then be freed + by calling deflateEnd. Note that deflateCopy duplicates the internal + compression state which can be quite large, so this strategy is slow and + can consume lots of memory. + + deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_STREAM_ERROR if the source stream state was inconsistent + (such as zalloc being NULL). msg is left unchanged in both source and + destination. +*/ + +ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm)); +/* + This function is equivalent to deflateEnd followed by deflateInit, + but does not free and reallocate all the internal compression state. + The stream will keep the same compression level and any other attributes + that may have been set by deflateInit2. + + deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent (such as zalloc or state being NULL). +*/ + +ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm, + int level, + int strategy)); +/* + Dynamically update the compression level and compression strategy. The + interpretation of level and strategy is as in deflateInit2. This can be + used to switch between compression and straight copy of the input data, or + to switch to a different kind of input data requiring a different + strategy. If the compression level is changed, the input available so far + is compressed with the old level (and may be flushed); the new level will + take effect only at the next call of deflate(). + + Before the call of deflateParams, the stream state must be set as for + a call of deflate(), since the currently available input may have to + be compressed and flushed. In particular, strm->avail_out must be non-zero. + + deflateParams returns Z_OK if success, Z_STREAM_ERROR if the source + stream state was inconsistent or if a parameter was invalid, Z_BUF_ERROR + if strm->avail_out was zero. +*/ + +ZEXTERN int ZEXPORT deflateTune OF((z_streamp strm, + int good_length, + int max_lazy, + int nice_length, + int max_chain)); +/* + Fine tune deflate's internal compression parameters. This should only be + used by someone who understands the algorithm used by zlib's deflate for + searching for the best matching string, and even then only by the most + fanatic optimizer trying to squeeze out the last compressed bit for their + specific input data. Read the deflate.c source code for the meaning of the + max_lazy, good_length, nice_length, and max_chain parameters. + + deflateTune() can be called after deflateInit() or deflateInit2(), and + returns Z_OK on success, or Z_STREAM_ERROR for an invalid deflate stream. + */ + +ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm, + uLong sourceLen)); +/* + deflateBound() returns an upper bound on the compressed size after + deflation of sourceLen bytes. It must be called after deflateInit() + or deflateInit2(). This would be used to allocate an output buffer + for deflation in a single pass, and so would be called before deflate(). +*/ + +ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm, + int bits, + int value)); +/* + deflatePrime() inserts bits in the deflate output stream. The intent + is that this function is used to start off the deflate output with the + bits leftover from a previous deflate stream when appending to it. As such, + this function can only be used for raw deflate, and must be used before the + first deflate() call after a deflateInit2() or deflateReset(). bits must be + less than or equal to 16, and that many of the least significant bits of + value will be inserted in the output. + + deflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent. +*/ + +ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm, + gz_headerp head)); +/* + deflateSetHeader() provides gzip header information for when a gzip + stream is requested by deflateInit2(). deflateSetHeader() may be called + after deflateInit2() or deflateReset() and before the first call of + deflate(). The text, time, os, extra field, name, and comment information + in the provided gz_header structure are written to the gzip header (xflag is + ignored -- the extra flags are set according to the compression level). The + caller must assure that, if not Z_NULL, name and comment are terminated with + a zero byte, and that if extra is not Z_NULL, that extra_len bytes are + available there. If hcrc is true, a gzip header crc is included. Note that + the current versions of the command-line version of gzip (up through version + 1.3.x) do not support header crc's, and will report that it is a "multi-part + gzip file" and give up. + + If deflateSetHeader is not used, the default gzip header has text false, + the time set to zero, and os set to 255, with no extra, name, or comment + fields. The gzip header is returned to the default state by deflateReset(). + + deflateSetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent. +*/ + +/* +ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm, + int windowBits)); + + This is another version of inflateInit with an extra parameter. The + fields next_in, avail_in, zalloc, zfree and opaque must be initialized + before by the caller. + + The windowBits parameter is the base two logarithm of the maximum window + size (the size of the history buffer). It should be in the range 8..15 for + this version of the library. The default value is 15 if inflateInit is used + instead. windowBits must be greater than or equal to the windowBits value + provided to deflateInit2() while compressing, or it must be equal to 15 if + deflateInit2() was not used. If a compressed stream with a larger window + size is given as input, inflate() will return with the error code + Z_DATA_ERROR instead of trying to allocate a larger window. + + windowBits can also be -8..-15 for raw inflate. In this case, -windowBits + determines the window size. inflate() will then process raw deflate data, + not looking for a zlib or gzip header, not generating a check value, and not + looking for any check values for comparison at the end of the stream. This + is for use with other formats that use the deflate compressed data format + such as zip. Those formats provide their own check values. If a custom + format is developed using the raw deflate format for compressed data, it is + recommended that a check value such as an adler32 or a crc32 be applied to + the uncompressed data as is done in the zlib, gzip, and zip formats. For + most applications, the zlib format should be used as is. Note that comments + above on the use in deflateInit2() applies to the magnitude of windowBits. + + windowBits can also be greater than 15 for optional gzip decoding. Add + 32 to windowBits to enable zlib and gzip decoding with automatic header + detection, or add 16 to decode only the gzip format (the zlib format will + return a Z_DATA_ERROR). If a gzip stream is being decoded, strm->adler is + a crc32 instead of an adler32. + + inflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_STREAM_ERROR if a parameter is invalid (such as a null strm). msg + is set to null if there is no error message. inflateInit2 does not perform + any decompression apart from reading the zlib header if present: this will + be done by inflate(). (So next_in and avail_in may be modified, but next_out + and avail_out are unchanged.) +*/ + +ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm, + const Bytef *dictionary, + uInt dictLength)); +/* + Initializes the decompression dictionary from the given uncompressed byte + sequence. This function must be called immediately after a call of inflate, + if that call returned Z_NEED_DICT. The dictionary chosen by the compressor + can be determined from the adler32 value returned by that call of inflate. + The compressor and decompressor must use exactly the same dictionary (see + deflateSetDictionary). For raw inflate, this function can be called + immediately after inflateInit2() or inflateReset() and before any call of + inflate() to set the dictionary. The application must insure that the + dictionary that was used for compression is provided. + + inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a + parameter is invalid (such as NULL dictionary) or the stream state is + inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the + expected one (incorrect adler32 value). inflateSetDictionary does not + perform any decompression: this will be done by subsequent calls of + inflate(). +*/ + +ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm)); +/* + Skips invalid compressed data until a full flush point (see above the + description of deflate with Z_FULL_FLUSH) can be found, or until all + available input is skipped. No output is provided. + + inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR + if no more input was provided, Z_DATA_ERROR if no flush point has been found, + or Z_STREAM_ERROR if the stream structure was inconsistent. In the success + case, the application may save the current current value of total_in which + indicates where valid compressed data was found. In the error case, the + application may repeatedly call inflateSync, providing more input each time, + until success or end of the input data. +*/ + +ZEXTERN int ZEXPORT inflateCopy OF((z_streamp dest, + z_streamp source)); +/* + Sets the destination stream as a complete copy of the source stream. + + This function can be useful when randomly accessing a large stream. The + first pass through the stream can periodically record the inflate state, + allowing restarting inflate at those points when randomly accessing the + stream. + + inflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_STREAM_ERROR if the source stream state was inconsistent + (such as zalloc being NULL). msg is left unchanged in both source and + destination. +*/ + +ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm)); +/* + This function is equivalent to inflateEnd followed by inflateInit, + but does not free and reallocate all the internal decompression state. + The stream will keep attributes that may have been set by inflateInit2. + + inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent (such as zalloc or state being NULL). +*/ + +ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm, + int bits, + int value)); +/* + This function inserts bits in the inflate input stream. The intent is + that this function is used to start inflating at a bit position in the + middle of a byte. The provided bits will be used before any bytes are used + from next_in. This function should only be used with raw inflate, and + should be used before the first inflate() call after inflateInit2() or + inflateReset(). bits must be less than or equal to 16, and that many of the + least significant bits of value will be inserted in the input. + + inflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent. +*/ + +ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm, + gz_headerp head)); +/* + inflateGetHeader() requests that gzip header information be stored in the + provided gz_header structure. inflateGetHeader() may be called after + inflateInit2() or inflateReset(), and before the first call of inflate(). + As inflate() processes the gzip stream, head->done is zero until the header + is completed, at which time head->done is set to one. If a zlib stream is + being decoded, then head->done is set to -1 to indicate that there will be + no gzip header information forthcoming. Note that Z_BLOCK can be used to + force inflate() to return immediately after header processing is complete + and before any actual data is decompressed. + + The text, time, xflags, and os fields are filled in with the gzip header + contents. hcrc is set to true if there is a header CRC. (The header CRC + was valid if done is set to one.) If extra is not Z_NULL, then extra_max + contains the maximum number of bytes to write to extra. Once done is true, + extra_len contains the actual extra field length, and extra contains the + extra field, or that field truncated if extra_max is less than extra_len. + If name is not Z_NULL, then up to name_max characters are written there, + terminated with a zero unless the length is greater than name_max. If + comment is not Z_NULL, then up to comm_max characters are written there, + terminated with a zero unless the length is greater than comm_max. When + any of extra, name, or comment are not Z_NULL and the respective field is + not present in the header, then that field is set to Z_NULL to signal its + absence. This allows the use of deflateSetHeader() with the returned + structure to duplicate the header. However if those fields are set to + allocated memory, then the application will need to save those pointers + elsewhere so that they can be eventually freed. + + If inflateGetHeader is not used, then the header information is simply + discarded. The header is always checked for validity, including the header + CRC if present. inflateReset() will reset the process to discard the header + information. The application would need to call inflateGetHeader() again to + retrieve the header from the next gzip stream. + + inflateGetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source + stream state was inconsistent. +*/ + +/* +ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits, + unsigned char FAR *window)); + + Initialize the internal stream state for decompression using inflateBack() + calls. The fields zalloc, zfree and opaque in strm must be initialized + before the call. If zalloc and zfree are Z_NULL, then the default library- + derived memory allocation routines are used. windowBits is the base two + logarithm of the window size, in the range 8..15. window is a caller + supplied buffer of that size. Except for special applications where it is + assured that deflate was used with small window sizes, windowBits must be 15 + and a 32K byte window must be supplied to be able to decompress general + deflate streams. + + See inflateBack() for the usage of these routines. + + inflateBackInit will return Z_OK on success, Z_STREAM_ERROR if any of + the paramaters are invalid, Z_MEM_ERROR if the internal state could not + be allocated, or Z_VERSION_ERROR if the version of the library does not + match the version of the header file. +*/ + +typedef unsigned (*in_func) OF((void FAR *, unsigned char FAR * FAR *)); +typedef int (*out_func) OF((void FAR *, unsigned char FAR *, unsigned)); + +ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm, + in_func in, void FAR *in_desc, + out_func out, void FAR *out_desc)); +/* + inflateBack() does a raw inflate with a single call using a call-back + interface for input and output. This is more efficient than inflate() for + file i/o applications in that it avoids copying between the output and the + sliding window by simply making the window itself the output buffer. This + function trusts the application to not change the output buffer passed by + the output function, at least until inflateBack() returns. + + inflateBackInit() must be called first to allocate the internal state + and to initialize the state with the user-provided window buffer. + inflateBack() may then be used multiple times to inflate a complete, raw + deflate stream with each call. inflateBackEnd() is then called to free + the allocated state. + + A raw deflate stream is one with no zlib or gzip header or trailer. + This routine would normally be used in a utility that reads zip or gzip + files and writes out uncompressed files. The utility would decode the + header and process the trailer on its own, hence this routine expects + only the raw deflate stream to decompress. This is different from the + normal behavior of inflate(), which expects either a zlib or gzip header and + trailer around the deflate stream. + + inflateBack() uses two subroutines supplied by the caller that are then + called by inflateBack() for input and output. inflateBack() calls those + routines until it reads a complete deflate stream and writes out all of the + uncompressed data, or until it encounters an error. The function's + parameters and return types are defined above in the in_func and out_func + typedefs. inflateBack() will call in(in_desc, &buf) which should return the + number of bytes of provided input, and a pointer to that input in buf. If + there is no input available, in() must return zero--buf is ignored in that + case--and inflateBack() will return a buffer error. inflateBack() will call + out(out_desc, buf, len) to write the uncompressed data buf[0..len-1]. out() + should return zero on success, or non-zero on failure. If out() returns + non-zero, inflateBack() will return with an error. Neither in() nor out() + are permitted to change the contents of the window provided to + inflateBackInit(), which is also the buffer that out() uses to write from. + The length written by out() will be at most the window size. Any non-zero + amount of input may be provided by in(). + + For convenience, inflateBack() can be provided input on the first call by + setting strm->next_in and strm->avail_in. If that input is exhausted, then + in() will be called. Therefore strm->next_in must be initialized before + calling inflateBack(). If strm->next_in is Z_NULL, then in() will be called + immediately for input. If strm->next_in is not Z_NULL, then strm->avail_in + must also be initialized, and then if strm->avail_in is not zero, input will + initially be taken from strm->next_in[0 .. strm->avail_in - 1]. + + The in_desc and out_desc parameters of inflateBack() is passed as the + first parameter of in() and out() respectively when they are called. These + descriptors can be optionally used to pass any information that the caller- + supplied in() and out() functions need to do their job. + + On return, inflateBack() will set strm->next_in and strm->avail_in to + pass back any unused input that was provided by the last in() call. The + return values of inflateBack() can be Z_STREAM_END on success, Z_BUF_ERROR + if in() or out() returned an error, Z_DATA_ERROR if there was a format + error in the deflate stream (in which case strm->msg is set to indicate the + nature of the error), or Z_STREAM_ERROR if the stream was not properly + initialized. In the case of Z_BUF_ERROR, an input or output error can be + distinguished using strm->next_in which will be Z_NULL only if in() returned + an error. If strm->next is not Z_NULL, then the Z_BUF_ERROR was due to + out() returning non-zero. (in() will always be called before out(), so + strm->next_in is assured to be defined if out() returns non-zero.) Note + that inflateBack() cannot return Z_OK. +*/ + +ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm)); +/* + All memory allocated by inflateBackInit() is freed. + + inflateBackEnd() returns Z_OK on success, or Z_STREAM_ERROR if the stream + state was inconsistent. +*/ + +ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void)); +/* Return flags indicating compile-time options. + + Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other: + 1.0: size of uInt + 3.2: size of uLong + 5.4: size of voidpf (pointer) + 7.6: size of z_off_t + + Compiler, assembler, and debug options: + 8: DEBUG + 9: ASMV or ASMINF -- use ASM code + 10: ZLIB_WINAPI -- exported functions use the WINAPI calling convention + 11: 0 (reserved) + + One-time table building (smaller code, but not thread-safe if true): + 12: BUILDFIXED -- build static block decoding tables when needed + 13: DYNAMIC_CRC_TABLE -- build CRC calculation tables when needed + 14,15: 0 (reserved) + + Library content (indicates missing functionality): + 16: NO_GZCOMPRESS -- gz* functions cannot compress (to avoid linking + deflate code when not needed) + 17: NO_GZIP -- deflate can't write gzip streams, and inflate can't detect + and decode gzip streams (to avoid linking crc code) + 18-19: 0 (reserved) + + Operation variations (changes in library functionality): + 20: PKZIP_BUG_WORKAROUND -- slightly more permissive inflate + 21: FASTEST -- deflate algorithm with only one, lowest compression level + 22,23: 0 (reserved) + + The sprintf variant used by gzprintf (zero is best): + 24: 0 = vs*, 1 = s* -- 1 means limited to 20 arguments after the format + 25: 0 = *nprintf, 1 = *printf -- 1 means gzprintf() not secure! + 26: 0 = returns value, 1 = void -- 1 means inferred string length returned + + Remainder: + 27-31: 0 (reserved) + */ + + + /* utility functions */ + +/* + The following utility functions are implemented on top of the + basic stream-oriented functions. To simplify the interface, some + default options are assumed (compression level and memory usage, + standard memory allocation functions). The source code of these + utility functions can easily be modified if you need special options. +*/ + +ZEXTERN int ZEXPORT compress OF((Bytef *dest, uLongf *destLen, + const Bytef *source, uLong sourceLen)); +/* + Compresses the source buffer into the destination buffer. sourceLen is + the byte length of the source buffer. Upon entry, destLen is the total + size of the destination buffer, which must be at least the value returned + by compressBound(sourceLen). Upon exit, destLen is the actual size of the + compressed buffer. + This function can be used to compress a whole file at once if the + input file is mmap'ed. + compress returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_BUF_ERROR if there was not enough room in the output + buffer. +*/ + +ZEXTERN int ZEXPORT compress2 OF((Bytef *dest, uLongf *destLen, + const Bytef *source, uLong sourceLen, + int level)); +/* + Compresses the source buffer into the destination buffer. The level + parameter has the same meaning as in deflateInit. sourceLen is the byte + length of the source buffer. Upon entry, destLen is the total size of the + destination buffer, which must be at least the value returned by + compressBound(sourceLen). Upon exit, destLen is the actual size of the + compressed buffer. + + compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough + memory, Z_BUF_ERROR if there was not enough room in the output buffer, + Z_STREAM_ERROR if the level parameter is invalid. +*/ + +ZEXTERN uLong ZEXPORT compressBound OF((uLong sourceLen)); +/* + compressBound() returns an upper bound on the compressed size after + compress() or compress2() on sourceLen bytes. It would be used before + a compress() or compress2() call to allocate the destination buffer. +*/ + +ZEXTERN int ZEXPORT uncompress OF((Bytef *dest, uLongf *destLen, + const Bytef *source, uLong sourceLen)); +/* + Decompresses the source buffer into the destination buffer. sourceLen is + the byte length of the source buffer. Upon entry, destLen is the total + size of the destination buffer, which must be large enough to hold the + entire uncompressed data. (The size of the uncompressed data must have + been saved previously by the compressor and transmitted to the decompressor + by some mechanism outside the scope of this compression library.) + Upon exit, destLen is the actual size of the compressed buffer. + This function can be used to decompress a whole file at once if the + input file is mmap'ed. + + uncompress returns Z_OK if success, Z_MEM_ERROR if there was not + enough memory, Z_BUF_ERROR if there was not enough room in the output + buffer, or Z_DATA_ERROR if the input data was corrupted or incomplete. +*/ + + +typedef voidp gzFile; + +ZEXTERN gzFile ZEXPORT gzopen OF((const char *path, const char *mode)); +/* + Opens a gzip (.gz) file for reading or writing. The mode parameter + is as in fopen ("rb" or "wb") but can also include a compression level + ("wb9") or a strategy: 'f' for filtered data as in "wb6f", 'h' for + Huffman only compression as in "wb1h", or 'R' for run-length encoding + as in "wb1R". (See the description of deflateInit2 for more information + about the strategy parameter.) + + gzopen can be used to read a file which is not in gzip format; in this + case gzread will directly read from the file without decompression. + + gzopen returns NULL if the file could not be opened or if there was + insufficient memory to allocate the (de)compression state; errno + can be checked to distinguish the two cases (if errno is zero, the + zlib error is Z_MEM_ERROR). */ + +ZEXTERN gzFile ZEXPORT gzdopen OF((int fd, const char *mode)); +/* + gzdopen() associates a gzFile with the file descriptor fd. File + descriptors are obtained from calls like open, dup, creat, pipe or + fileno (in the file has been previously opened with fopen). + The mode parameter is as in gzopen. + The next call of gzclose on the returned gzFile will also close the + file descriptor fd, just like fclose(fdopen(fd), mode) closes the file + descriptor fd. If you want to keep fd open, use gzdopen(dup(fd), mode). + gzdopen returns NULL if there was insufficient memory to allocate + the (de)compression state. +*/ + +ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy)); +/* + Dynamically update the compression level or strategy. See the description + of deflateInit2 for the meaning of these parameters. + gzsetparams returns Z_OK if success, or Z_STREAM_ERROR if the file was not + opened for writing. +*/ + +ZEXTERN int ZEXPORT gzread OF((gzFile file, voidp buf, unsigned len)); +/* + Reads the given number of uncompressed bytes from the compressed file. + If the input file was not in gzip format, gzread copies the given number + of bytes into the buffer. + gzread returns the number of uncompressed bytes actually read (0 for + end of file, -1 for error). */ + +ZEXTERN int ZEXPORT gzwrite OF((gzFile file, + voidpc buf, unsigned len)); +/* + Writes the given number of uncompressed bytes into the compressed file. + gzwrite returns the number of uncompressed bytes actually written + (0 in case of error). +*/ + +ZEXTERN int ZEXPORTVA gzprintf OF((gzFile file, const char *format, ...)); +/* + Converts, formats, and writes the args to the compressed file under + control of the format string, as in fprintf. gzprintf returns the number of + uncompressed bytes actually written (0 in case of error). The number of + uncompressed bytes written is limited to 4095. The caller should assure that + this limit is not exceeded. If it is exceeded, then gzprintf() will return + return an error (0) with nothing written. In this case, there may also be a + buffer overflow with unpredictable consequences, which is possible only if + zlib was compiled with the insecure functions sprintf() or vsprintf() + because the secure snprintf() or vsnprintf() functions were not available. +*/ + +ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s)); +/* + Writes the given null-terminated string to the compressed file, excluding + the terminating null character. + gzputs returns the number of characters written, or -1 in case of error. +*/ + +ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len)); +/* + Reads bytes from the compressed file until len-1 characters are read, or + a newline character is read and transferred to buf, or an end-of-file + condition is encountered. The string is then terminated with a null + character. + gzgets returns buf, or Z_NULL in case of error. +*/ + +ZEXTERN int ZEXPORT gzputc OF((gzFile file, int c)); +/* + Writes c, converted to an unsigned char, into the compressed file. + gzputc returns the value that was written, or -1 in case of error. +*/ + +ZEXTERN int ZEXPORT gzgetc OF((gzFile file)); +/* + Reads one byte from the compressed file. gzgetc returns this byte + or -1 in case of end of file or error. +*/ + +ZEXTERN int ZEXPORT gzungetc OF((int c, gzFile file)); +/* + Push one character back onto the stream to be read again later. + Only one character of push-back is allowed. gzungetc() returns the + character pushed, or -1 on failure. gzungetc() will fail if a + character has been pushed but not read yet, or if c is -1. The pushed + character will be discarded if the stream is repositioned with gzseek() + or gzrewind(). +*/ + +ZEXTERN int ZEXPORT gzflush OF((gzFile file, int flush)); +/* + Flushes all pending output into the compressed file. The parameter + flush is as in the deflate() function. The return value is the zlib + error number (see function gzerror below). gzflush returns Z_OK if + the flush parameter is Z_FINISH and all output could be flushed. + gzflush should be called only when strictly necessary because it can + degrade compression. +*/ + +ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile file, + z_off_t offset, int whence)); +/* + Sets the starting position for the next gzread or gzwrite on the + given compressed file. The offset represents a number of bytes in the + uncompressed data stream. The whence parameter is defined as in lseek(2); + the value SEEK_END is not supported. + If the file is opened for reading, this function is emulated but can be + extremely slow. If the file is opened for writing, only forward seeks are + supported; gzseek then compresses a sequence of zeroes up to the new + starting position. + + gzseek returns the resulting offset location as measured in bytes from + the beginning of the uncompressed stream, or -1 in case of error, in + particular if the file is opened for writing and the new starting position + would be before the current position. +*/ + +ZEXTERN int ZEXPORT gzrewind OF((gzFile file)); +/* + Rewinds the given file. This function is supported only for reading. + + gzrewind(file) is equivalent to (int)gzseek(file, 0L, SEEK_SET) +*/ + +ZEXTERN z_off_t ZEXPORT gztell OF((gzFile file)); +/* + Returns the starting position for the next gzread or gzwrite on the + given compressed file. This position represents a number of bytes in the + uncompressed data stream. + + gztell(file) is equivalent to gzseek(file, 0L, SEEK_CUR) +*/ + +ZEXTERN int ZEXPORT gzeof OF((gzFile file)); +/* + Returns 1 when EOF has previously been detected reading the given + input stream, otherwise zero. +*/ + +ZEXTERN int ZEXPORT gzdirect OF((gzFile file)); +/* + Returns 1 if file is being read directly without decompression, otherwise + zero. +*/ + +ZEXTERN int ZEXPORT gzclose OF((gzFile file)); +/* + Flushes all pending output if necessary, closes the compressed file + and deallocates all the (de)compression state. The return value is the zlib + error number (see function gzerror below). +*/ + +ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum)); +/* + Returns the error message for the last error which occurred on the + given compressed file. errnum is set to zlib error number. If an + error occurred in the file system and not in the compression library, + errnum is set to Z_ERRNO and the application may consult errno + to get the exact error code. +*/ + +ZEXTERN void ZEXPORT gzclearerr OF((gzFile file)); +/* + Clears the error and end-of-file flags for file. This is analogous to the + clearerr() function in stdio. This is useful for continuing to read a gzip + file that is being written concurrently. +*/ + + /* checksum functions */ + +/* + These functions are not related to compression but are exported + anyway because they might be useful in applications using the + compression library. +*/ + +ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len)); +/* + Update a running Adler-32 checksum with the bytes buf[0..len-1] and + return the updated checksum. If buf is NULL, this function returns + the required initial value for the checksum. + An Adler-32 checksum is almost as reliable as a CRC32 but can be computed + much faster. Usage example: + + uLong adler = adler32(0L, Z_NULL, 0); + + while (read_buffer(buffer, length) != EOF) { + adler = adler32(adler, buffer, length); + } + if (adler != original_adler) error(); +*/ + +ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2, + z_off_t len2)); +/* + Combine two Adler-32 checksums into one. For two sequences of bytes, seq1 + and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for + each, adler1 and adler2. adler32_combine() returns the Adler-32 checksum of + seq1 and seq2 concatenated, requiring only adler1, adler2, and len2. +*/ + +ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len)); +/* + Update a running CRC-32 with the bytes buf[0..len-1] and return the + updated CRC-32. If buf is NULL, this function returns the required initial + value for the for the crc. Pre- and post-conditioning (one's complement) is + performed within this function so it shouldn't be done by the application. + Usage example: + + uLong crc = crc32(0L, Z_NULL, 0); + + while (read_buffer(buffer, length) != EOF) { + crc = crc32(crc, buffer, length); + } + if (crc != original_crc) error(); +*/ + +ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2)); + +/* + Combine two CRC-32 check values into one. For two sequences of bytes, + seq1 and seq2 with lengths len1 and len2, CRC-32 check values were + calculated for each, crc1 and crc2. crc32_combine() returns the CRC-32 + check value of seq1 and seq2 concatenated, requiring only crc1, crc2, and + len2. +*/ + + + /* various hacks, don't look :) */ + +/* deflateInit and inflateInit are macros to allow checking the zlib version + * and the compiler's view of z_stream: + */ +ZEXTERN int ZEXPORT deflateInit_ OF((z_streamp strm, int level, + const char *version, int stream_size)); +ZEXTERN int ZEXPORT inflateInit_ OF((z_streamp strm, + const char *version, int stream_size)); +ZEXTERN int ZEXPORT deflateInit2_ OF((z_streamp strm, int level, int method, + int windowBits, int memLevel, + int strategy, const char *version, + int stream_size)); +ZEXTERN int ZEXPORT inflateInit2_ OF((z_streamp strm, int windowBits, + const char *version, int stream_size)); +ZEXTERN int ZEXPORT inflateBackInit_ OF((z_streamp strm, int windowBits, + unsigned char FAR *window, + const char *version, + int stream_size)); +#define deflateInit(strm, level) \ + deflateInit_((strm), (level), ZLIB_VERSION, sizeof(z_stream)) +#define inflateInit(strm) \ + inflateInit_((strm), ZLIB_VERSION, sizeof(z_stream)) +#define deflateInit2(strm, level, method, windowBits, memLevel, strategy) \ + deflateInit2_((strm),(level),(method),(windowBits),(memLevel),\ + (strategy), ZLIB_VERSION, sizeof(z_stream)) +#define inflateInit2(strm, windowBits) \ + inflateInit2_((strm), (windowBits), ZLIB_VERSION, sizeof(z_stream)) +#define inflateBackInit(strm, windowBits, window) \ + inflateBackInit_((strm), (windowBits), (window), \ + ZLIB_VERSION, sizeof(z_stream)) + + +#if !defined(ZUTIL_H) && !defined(NO_DUMMY_DECL) + struct internal_state {int dummy;}; /* hack for buggy compilers */ +#endif + +ZEXTERN const char * ZEXPORT zError OF((int)); +ZEXTERN int ZEXPORT inflateSyncPoint OF((z_streamp z)); +ZEXTERN const uLongf * ZEXPORT get_crc_table OF((void)); + +#ifdef __cplusplus +} +#endif + +#endif /* ZLIB_H */ diff --git a/portlibs/sources/libext2fs/AUTHORS b/portlibs/sources/libext2fs/AUTHORS new file mode 100644 index 00000000..2291767c --- /dev/null +++ b/portlibs/sources/libext2fs/AUTHORS @@ -0,0 +1,11 @@ + +Present author and main programmer of ext2fs in alphabetical order: + +Theodore Ts'o + +Many more are contributing to this project. Read it all up at http://e2fsprogs.sourceforge.net/ext2.html + + +Nintendo GameCube/Wii port author: + +Dimok diff --git a/portlibs/sources/libext2fs/CREDITS b/portlibs/sources/libext2fs/CREDITS new file mode 100644 index 00000000..32fb026f --- /dev/null +++ b/portlibs/sources/libext2fs/CREDITS @@ -0,0 +1,9 @@ +First of all thanks goes to everyone who contributed to ext2fs directly or indirectly. +Visit the site to inform yourself who was involved in it http://e2fsprogs.sourceforge.net/ext2.html + +The following people have contributed directly or indirectly +to the Nintendo GameCube/Wii port of ext2fs. + +Michael "Chishm" Chisholm +rodries +Rhys "Shareese" Koedijk \ No newline at end of file diff --git a/portlibs/sources/libext2fs/LICENSE b/portlibs/sources/libext2fs/LICENSE new file mode 100644 index 00000000..623b6258 --- /dev/null +++ b/portlibs/sources/libext2fs/LICENSE @@ -0,0 +1,340 @@ + GNU GENERAL PUBLIC LICENSE + Version 2, June 1991 + + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +License is intended to guarantee your freedom to share and change free +software--to make sure the software is free for all its users. This +General Public License applies to most of the Free Software +Foundation's software and to any other program whose authors commit to +using it. (Some other Free Software Foundation software is covered by +the GNU Library General Public License instead.) You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if you +distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must give the recipients all the rights that +you have. You must make sure that they, too, receive or can get the +source code. And you must show them these terms so they know their +rights. + + We protect your rights with two steps: (1) copyright the software, and +(2) offer you this license which gives you legal permission to copy, +distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain +that everyone understands that there is no warranty for this free +software. If the software is modified by someone else and passed on, we +want its recipients to know that what they have is not the original, so +that any problems introduced by others will not reflect on the original +authors' reputations. + + Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that redistributors of a free +program will individually obtain patent licenses, in effect making the +program proprietary. To prevent this, we have made it clear that any +patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and +modification follow. + + GNU GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License applies to any program or other work which contains +a notice placed by the copyright holder saying it may be distributed +under the terms of this General Public License. The "Program", below, +refers to any such program or work, and a "work based on the Program" +means either the Program or any derivative work under copyright law: +that is to say, a work containing the Program or a portion of it, +either verbatim or with modifications and/or translated into another +language. (Hereinafter, translation is included without limitation in +the term "modification".) Each licensee is addressed as "you". + +Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running the Program is not restricted, and the output from the Program +is covered only if its contents constitute a work based on the +Program (independent of having been made by running the Program). +Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's +source code as you receive it, in any medium, provided that you +conspicuously and appropriately publish on each copy an appropriate +copyright notice and disclaimer of warranty; keep intact all the +notices that refer to this License and to the absence of any warranty; +and give any other recipients of the Program a copy of this License +along with the Program. + +You may charge a fee for the physical act of transferring a copy, and +you may at your option offer warranty protection in exchange for a fee. + + 2. You may modify your copy or copies of the Program or any portion +of it, thus forming a work based on the Program, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b) You must cause any work that you distribute or publish, that in + whole or in part contains or is derived from the Program or any + part thereof, to be licensed as a whole at no charge to all third + parties under the terms of this License. + + c) If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display an + announcement including an appropriate copyright notice and a + notice that there is no warranty (or else, saying that you provide + a warranty) and that users may redistribute the program under + these conditions, and telling the user how to view a copy of this + License. (Exception: if the Program itself is interactive but + does not normally print such an announcement, your work based on + the Program is not required to print an announcement.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Program, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Program, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Program. + +In addition, mere aggregation of another work not based on the Program +with the Program (or with a work based on the Program) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, +under Section 2) in object code or executable form under the terms of +Sections 1 and 2 above provided that you also do one of the following: + + a) Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of Sections + 1 and 2 above on a medium customarily used for software interchange; or, + + b) Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a medium + customarily used for software interchange; or, + + c) Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with such + an offer, in accord with Subsection b above.) + +The source code for a work means the preferred form of the work for +making modifications to it. For an executable work, complete source +code means all the source code for all modules it contains, plus any +associated interface definition files, plus the scripts used to +control compilation and installation of the executable. However, as a +special exception, the source code distributed need not include +anything that is normally distributed (in either source or binary +form) with the major components (compiler, kernel, and so on) of the +operating system on which the executable runs, unless that component +itself accompanies the executable. + +If distribution of executable or object code is made by offering +access to copy from a designated place, then offering equivalent +access to copy the source code from the same place counts as +distribution of the source code, even though third parties are not +compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program +except as expressly provided under this License. Any attempt +otherwise to copy, modify, sublicense or distribute the Program is +void, and will automatically terminate your rights under this License. +However, parties who have received copies, or rights, from you under +this License will not have their licenses terminated so long as such +parties remain in full compliance. + + 5. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Program or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Program (or any work based on the +Program), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the +Program), the recipient automatically receives a license from the +original licensor to copy, distribute or modify the Program subject to +these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties to +this License. + + 7. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Program at all. For example, if a patent +license would not permit royalty-free redistribution of the Program by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Program. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system, which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Program under this License +may add an explicit geographical distribution limitation excluding +those countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + + 9. The Free Software Foundation may publish revised and/or new versions +of the General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies a version number of this License which applies to it and "any +later version", you have the option of following the terms and conditions +either of that version or of any later version published by the Free +Software Foundation. If the Program does not specify a version number of +this License, you may choose any version ever published by the Free Software +Foundation. + + 10. If you wish to incorporate parts of the Program into other free +programs whose distribution conditions are different, write to the author +to ask for permission. For software which is copyrighted by the Free +Software Foundation, write to the Free Software Foundation; we sometimes +make exceptions for this. Our decision will be guided by the two goals +of preserving the free status of all derivatives of our free software and +of promoting the sharing and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY +FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN +OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES +PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED +OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS +TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE +PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, +REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR +REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING +OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED +TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY +YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER +PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE +POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + <one line to give the program's name and a brief idea of what it does.> + Copyright (C) <year> <name of author> + + This program 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 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; if not, write to the Free Software + Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + + +Also add information on how to contact you by electronic and paper mail. + +If the program is interactive, make it output a short notice like this +when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) year name of author + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, the commands you use may +be called something other than `show w' and `show c'; they could even be +mouse-clicks or menu items--whatever suits your program. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the program, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + <signature of Ty Coon>, 1 April 1989 + Ty Coon, President of Vice + +This General Public License does not permit incorporating your program into +proprietary programs. If your program is a subroutine library, you may +consider it more useful to permit linking proprietary applications with the +library. If this is what you want to do, use the GNU Library General +Public License instead of this License. diff --git a/portlibs/sources/libext2fs/Makefile b/portlibs/sources/libext2fs/Makefile new file mode 100644 index 00000000..d424b9af --- /dev/null +++ b/portlibs/sources/libext2fs/Makefile @@ -0,0 +1,25 @@ + +default: wii-release + +all: debug release + +debug: wii-debug + +release: wii-release + +wii-debug: + $(MAKE) -C source PLATFORM=wii BUILD=wii_debug + +wii-release: + $(MAKE) -C source PLATFORM=wii BUILD=wii_release + +clean: + $(MAKE) -C source clean + +install: wii-release + $(MAKE) -C source install + +run: install + $(MAKE) -C example + $(MAKE) -C example run + diff --git a/portlibs/sources/libext2fs/include/ext2.h b/portlibs/sources/libext2fs/include/ext2.h new file mode 100644 index 00000000..059e18be --- /dev/null +++ b/portlibs/sources/libext2fs/include/ext2.h @@ -0,0 +1,99 @@ + /** + * ext2.h - devoptab file routines for EXT2/3/4-based devices. + * + * Copyright (c) 2010 Dimok + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ +#ifndef __EXT2_H_ +#define __EXT2_H_ + +#ifdef __cplusplus +extern "C" { +#endif + +#include <gctypes.h> +#include <gccore.h> +#include <ogc/disc_io.h> + +/* EXT2 cache options */ +#define CACHE_DEFAULT_PAGE_COUNT 8 /* The default number of pages in the cache */ +#define CACHE_DEFAULT_PAGE_SIZE 128 /* The default number of sectors per cache page */ + +/* EXT2 mount flags */ +#define EXT2_FLAG_RW 0x00001 /* Open the filesystem for reading and writing. Without this flag, the filesystem is opened for reading only. */ +#define EXT2_FLAG_FORCE 0x00400 /* Open the filesystem regardless of the feature sets listed in the superblock */ +#define EXT2_FLAG_JOURNAL_DEV_OK 0x01000 /* Only open external journal devices if this flag is set (e.g. ext3/ext4) */ +#define EXT2_FLAG_64BITS 0x20000 /* Use the new style 64-Bit bitmaps. For more information see gen_bitmap64.c */ +#define EXT2_FLAG_PRINT_PROGRESS 0x40000 /* If this flag is set the progress of file operations will be printed to stdout */ +#define EXT2_FLAG_DEFAULT (EXT2_FLAG_RW | EXT2_FLAG_64BITS | EXT2_FLAG_JOURNAL_DEV_OK) + +/** + * Find all EXT2/3/4 partitions on a block device. + * + * @param INTERFACE The block device to search + * @param PARTITIONS (out) A pointer to receive the array of partition start sectors + * + * @return The number of entries in PARTITIONS or -1 if an error occurred (see errno) + * @note The caller is responsible for freeing PARTITIONS when finished with it + */ +int ext2FindPartitions(const DISC_INTERFACE *interface, sec_t **partitions); + +/** + * Mount a EXT2/3/4 partition from a specific sector on a block device. + * + * @param NAME The name to mount the device under (can then be accessed as "NAME:/") + * @param INTERFACE The block device to mount + * @param STARTSECTOR The sector the partition begins at + * @param CACHEPAGECOUNT The total number of pages in the device cache + * @param CACHEPAGESIZE The number of sectors per cache page + * @param FLAGS Additional mounting flags (see above) + * + * @return True if mount was successful, false if no partition was found or an error occurred (see errno) + */ +bool ext2Mount(const char *name, const DISC_INTERFACE *interface, sec_t startSector, u32 cachePageCount, u32 cachePageSize, u32 flags); + +/** + * Unmount a EXT2/3/4 partition. + * + * @param NAME The name of mount used in ext2Mount() + */ +void ext2Unmount(const char *name); + +/** + * Get the volume name of a mounted EXT2/3/4 partition. + * + * @param NAME The name of mount + * + * @return The volumes name if successful or NULL if an error occurred (see errno) + */ +const char *ext2GetVolumeName (const char *name); + +/** + * Set the volume name of a mounted EXT2/3/4 partition. + * + * @param NAME The name of mount + * @param VOLUMENAME The new volume name + * + * @return True if mount was successful, false if an error occurred (see errno) + * @note The mount must be write-enabled else this will fail + */ +bool ext2SetVolumeName (const char *name, const char *volumeName); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/sources/libext2fs/source/Makefile b/portlibs/sources/libext2fs/source/Makefile new file mode 100644 index 00000000..3f44c911 --- /dev/null +++ b/portlibs/sources/libext2fs/source/Makefile @@ -0,0 +1,133 @@ +#--------------------------------------------------------------------------------- +# Clear the implicit built in rules +#--------------------------------------------------------------------------------- +.SUFFIXES: +#--------------------------------------------------------------------------------- +ifeq ($(strip $(DEVKITPPC)),) +$(error "Please set DEVKITPPC in your environment. export DEVKITPPC=<path to>devkitPPC") +endif + +ifeq ($(PLATFORM),wii) +include $(DEVKITPPC)/wii_rules +endif + +ifeq ($(PLATFORM),cube) +include $(DEVKITPPC)/gamecube_rules +endif + +#--------------------------------------------------------------------------------- +# BUILD is the directory where object files & intermediate files will be placed +# SOURCES is a list of directories containing source code +# INCLUDES is a list of directories containing extra header files +#--------------------------------------------------------------------------------- +BUILD ?= wii_release +SOURCES := . +INCLUDES := ../include +LIBDIR := ../lib + +#--------------------------------------------------------------------------------- +# options for code generation +#--------------------------------------------------------------------------------- +CFLAGS = -O3 -Wall $(MACHDEP) $(INCLUDE) -DGEKKO \ + -DHAVE_UNISTD_H -DHAVE_SYS_STAT_H -DHAVE_SYS_TYPES_H -DHAVE_UTIME_H -DWORDS_BIGENDIAN \ + -DHAVE_ERRNO_H -DHAVE_STRDUP -DHAVE_SYS_RESOURCE_H +CXXFLAGS = $(CFLAGS) +ASFLAGS := -g +export EXT2BIN := $(LIBDIR)/$(PLATFORM)/libext2fs.a + +ifeq ($(BUILD),cube_debug) +CFLAGS += -DDEBUG_GEKKO +CXXFLAGS += -DDEBUG_GEKKO +endif +ifeq ($(BUILD),wii_debug) +CFLAGS += -DDEBUG_GEKKO +CXXFLAGS += -DDEBUG_GEKKO +endif + +#--------------------------------------------------------------------------------- +# any extra libraries we wish to link with the project +#--------------------------------------------------------------------------------- +LIBS := + +#--------------------------------------------------------------------------------- +# list of directories containing libraries, this must be the top level containing +# include and lib +#--------------------------------------------------------------------------------- +LIBDIRS := + +#--------------------------------------------------------------------------------- +# no real need to edit anything past this point unless you need to add additional +# rules for different file extensions +#--------------------------------------------------------------------------------- +ifneq ($(BUILD),$(notdir $(CURDIR))) +#--------------------------------------------------------------------------------- + +export DEPSDIR := $(CURDIR)/$(BUILD) + +export VPATH := $(foreach dir,$(SOURCES),$(CURDIR)/$(dir)) \ + $(foreach dir,$(DATA),$(CURDIR)/$(dir)) + +CFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.c))) +CPPFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.cpp))) +SFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.s))) +BINFILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.*))) + + +export OFILES := $(addsuffix .o,$(BINFILES)) \ + $(CPPFILES:.cpp=.o) $(CFILES:.c=.o) $(SFILES:.s=.o) + +export INCLUDE := $(foreach dir,$(INCLUDES),-I$(CURDIR)/$(dir)) \ + $(foreach dir,$(LIBDIRS),-I$(dir)/include) \ + $(foreach dir,$(LIBDIRS),-I$(dir)/include) \ + -I$(CURDIR)/$(BUILD) \ + -I$(LIBOGC_INC) + +export LIBPATHS := $(foreach dir,$(LIBDIRS),-L$(dir)/lib) \ + -L$(LIBOGC_LIB) + +.PHONY: $(BUILD) clean + +#--------------------------------------------------------------------------------- +$(BUILD): + @[ -d $@ ] || mkdir -p $@ + @$(MAKE) --no-print-directory -C $(BUILD) -f $(CURDIR)/Makefile + +#--------------------------------------------------------------------------------- +clean: + @echo clean ... + @rm -fr wii_debug wii_release cube_debug cube_release $(LIBDIR) + +all: $(EXT2BIN) + +install: + cp ../include/ext2.h ../../../include + cp ext2_frag.h ../../../include + cp ../lib/wii/libext2fs.a ../../../lib + +wii-install: + cp ../include/ext2.h ../../../include + cp ext2_frag.h ../../../include + cp ../lib/wii/libext2fs.a ../../../lib + +#--------------------------------------------------------------------------------- +else + +DEPENDS := $(OFILES:.o=.d) + +#--------------------------------------------------------------------------------- +# main targets +#--------------------------------------------------------------------------------- +$(EXT2BIN): $(OFILES) $(LIBDIR)/$(PLATFORM) + @rm -f "../$(EXT2BIN)" + @$(AR) rcs "../$(EXT2BIN)" $(OFILES) + @echo built ... $(notdir $@) + +$(LIBDIR)/$(PLATFORM): + mkdir -p ../$(LIBDIR)/$(PLATFORM) + +-include $(DEPENDS) + +#--------------------------------------------------------------------------------------- +endif +#--------------------------------------------------------------------------------------- + diff --git a/portlibs/sources/libext2fs/source/alloc.c b/portlibs/sources/libext2fs/source/alloc.c new file mode 100644 index 00000000..3a8f3328 --- /dev/null +++ b/portlibs/sources/libext2fs/source/alloc.c @@ -0,0 +1,308 @@ +/* + * alloc.c --- allocate new inodes, blocks for ext2fs + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <time.h> +#include <string.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +/* + * Check for uninit block bitmaps and deal with them appropriately + */ +static void check_block_uninit(ext2_filsys fs, ext2fs_block_bitmap map, + dgrp_t group) +{ + blk_t i; + blk64_t blk, super_blk, old_desc_blk, new_desc_blk; + int old_desc_blocks; + + if (!(EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) || + !(ext2fs_bg_flags_test(fs, group, EXT2_BG_BLOCK_UNINIT))) + return; + + blk = (group * fs->super->s_blocks_per_group) + + fs->super->s_first_data_block; + + ext2fs_super_and_bgd_loc2(fs, group, &super_blk, + &old_desc_blk, &new_desc_blk, 0); + + if (fs->super->s_feature_incompat & + EXT2_FEATURE_INCOMPAT_META_BG) + old_desc_blocks = fs->super->s_first_meta_bg; + else + old_desc_blocks = fs->desc_blocks + fs->super->s_reserved_gdt_blocks; + + for (i=0; i < fs->super->s_blocks_per_group; i++, blk++) { + if ((blk == super_blk) || + (old_desc_blk && old_desc_blocks && + (blk >= old_desc_blk) && + (blk < old_desc_blk + old_desc_blocks)) || + (new_desc_blk && (blk == new_desc_blk)) || + (blk == ext2fs_block_bitmap_loc(fs, group)) || + (blk == ext2fs_inode_bitmap_loc(fs, group)) || + (blk >= ext2fs_inode_table_loc(fs, group) && + (blk < ext2fs_inode_table_loc(fs, group) + + fs->inode_blocks_per_group))) + ext2fs_fast_mark_block_bitmap2(map, blk); + else + ext2fs_fast_unmark_block_bitmap2(map, blk); + } + ext2fs_bg_flags_clear(fs, group, EXT2_BG_BLOCK_UNINIT); + ext2fs_group_desc_csum_set(fs, group); +} + +/* + * Check for uninit inode bitmaps and deal with them appropriately + */ +static void check_inode_uninit(ext2_filsys fs, ext2fs_inode_bitmap map, + dgrp_t group) +{ + ext2_ino_t i, ino; + + if (!(EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) || + !(ext2fs_bg_flags_test(fs, group, EXT2_BG_INODE_UNINIT))) + return; + + ino = (group * fs->super->s_inodes_per_group) + 1; + for (i=0; i < fs->super->s_inodes_per_group; i++, ino++) + ext2fs_fast_unmark_inode_bitmap2(map, ino); + + ext2fs_bg_flags_clear(fs, group, EXT2_BG_INODE_UNINIT); + check_block_uninit(fs, fs->block_map, group); +} + +/* + * Right now, just search forward from the parent directory's block + * group to find the next free inode. + * + * Should have a special policy for directories. + */ +errcode_t ext2fs_new_inode(ext2_filsys fs, ext2_ino_t dir, + int mode EXT2FS_ATTR((unused)), + ext2fs_inode_bitmap map, ext2_ino_t *ret) +{ + ext2_ino_t dir_group = 0; + ext2_ino_t i; + ext2_ino_t start_inode; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!map) + map = fs->inode_map; + if (!map) + return EXT2_ET_NO_INODE_BITMAP; + + if (dir > 0) + dir_group = (dir - 1) / EXT2_INODES_PER_GROUP(fs->super); + + start_inode = (dir_group * EXT2_INODES_PER_GROUP(fs->super)) + 1; + if (start_inode < EXT2_FIRST_INODE(fs->super)) + start_inode = EXT2_FIRST_INODE(fs->super); + if (start_inode > fs->super->s_inodes_count) + return EXT2_ET_INODE_ALLOC_FAIL; + i = start_inode; + + do { + if (((i - 1) % EXT2_INODES_PER_GROUP(fs->super)) == 0) + check_inode_uninit(fs, map, (i - 1) / + EXT2_INODES_PER_GROUP(fs->super)); + + if (!ext2fs_fast_test_inode_bitmap2(map, i)) + break; + i++; + if (i > fs->super->s_inodes_count) + i = EXT2_FIRST_INODE(fs->super); + } while (i != start_inode); + + if (ext2fs_test_inode_bitmap2(map, i)) + return EXT2_ET_INODE_ALLOC_FAIL; + *ret = i; + return 0; +} + +/* + * Stupid algorithm --- we now just search forward starting from the + * goal. Should put in a smarter one someday.... + */ +errcode_t ext2fs_new_block2(ext2_filsys fs, blk64_t goal, + ext2fs_block_bitmap map, blk64_t *ret) +{ + blk64_t i; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!map) + map = fs->block_map; + if (!map) + return EXT2_ET_NO_BLOCK_BITMAP; + if (!goal || (goal >= ext2fs_blocks_count(fs->super))) + goal = fs->super->s_first_data_block; + i = goal; + check_block_uninit(fs, map, + (i - fs->super->s_first_data_block) / + EXT2_BLOCKS_PER_GROUP(fs->super)); + do { + if (((i - fs->super->s_first_data_block) % + EXT2_BLOCKS_PER_GROUP(fs->super)) == 0) + check_block_uninit(fs, map, + (i - fs->super->s_first_data_block) / + EXT2_BLOCKS_PER_GROUP(fs->super)); + + if (!ext2fs_fast_test_block_bitmap2(map, i)) { + *ret = i; + return 0; + } + i++; + if (i >= ext2fs_blocks_count(fs->super)) + i = fs->super->s_first_data_block; + } while (i != goal); + return EXT2_ET_BLOCK_ALLOC_FAIL; +} + +errcode_t ext2fs_new_block(ext2_filsys fs, blk_t goal, + ext2fs_block_bitmap map, blk_t *ret) +{ + errcode_t retval; + blk64_t val; + retval = ext2fs_new_block2(fs, goal, map, &val); + if (!retval) + *ret = (blk_t) val; + return retval; +} + +/* + * This function zeros out the allocated block, and updates all of the + * appropriate filesystem records. + */ +errcode_t ext2fs_alloc_block2(ext2_filsys fs, blk64_t goal, + char *block_buf, blk64_t *ret) +{ + errcode_t retval; + blk64_t block; + char *buf = 0; + + if (!block_buf) { + retval = ext2fs_get_mem(fs->blocksize, &buf); + if (retval) + return retval; + block_buf = buf; + } + memset(block_buf, 0, fs->blocksize); + + if (fs->get_alloc_block) { + retval = (fs->get_alloc_block)(fs, goal, &block); + if (retval) + goto fail; + } else { + if (!fs->block_map) { + retval = ext2fs_read_block_bitmap(fs); + if (retval) + goto fail; + } + + retval = ext2fs_new_block2(fs, goal, 0, &block); + if (retval) + goto fail; + } + + retval = io_channel_write_blk64(fs->io, block, 1, block_buf); + if (retval) + goto fail; + + ext2fs_block_alloc_stats2(fs, block, +1); + *ret = block; + +fail: + if (buf) + ext2fs_free_mem(&buf); + return retval; +} + +errcode_t ext2fs_alloc_block(ext2_filsys fs, blk_t goal, + char *block_buf, blk_t *ret) +{ + errcode_t retval; + blk64_t val; + retval = ext2fs_alloc_block2(fs, goal, block_buf, &val); + if (!retval) + *ret = (blk_t) val; + return retval; +} + +errcode_t ext2fs_get_free_blocks2(ext2_filsys fs, blk64_t start, blk64_t finish, + int num, ext2fs_block_bitmap map, blk64_t *ret) +{ + blk64_t b = start; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!map) + map = fs->block_map; + if (!map) + return EXT2_ET_NO_BLOCK_BITMAP; + if (!b) + b = fs->super->s_first_data_block; + if (!finish) + finish = start; + if (!num) + num = 1; + do { + if (b+num-1 > ext2fs_blocks_count(fs->super)) + b = fs->super->s_first_data_block; + if (ext2fs_fast_test_block_bitmap_range2(map, b, num)) { + *ret = b; + return 0; + } + b++; + } while (b != finish); + return EXT2_ET_BLOCK_ALLOC_FAIL; +} + +errcode_t ext2fs_get_free_blocks(ext2_filsys fs, blk_t start, blk_t finish, + int num, ext2fs_block_bitmap map, blk_t *ret) +{ + errcode_t retval; + blk64_t val; + retval = ext2fs_get_free_blocks2(fs, start, finish, num, map, &val); + if(!retval) + *ret = (blk_t) val; + return retval; +} + +void ext2fs_set_alloc_block_callback(ext2_filsys fs, + errcode_t (*func)(ext2_filsys fs, + blk64_t goal, + blk64_t *ret), + errcode_t (**old)(ext2_filsys fs, + blk64_t goal, + blk64_t *ret)) +{ + if (!fs || fs->magic != EXT2_ET_MAGIC_EXT2FS_FILSYS) + return; + + if (old) + *old = fs->get_alloc_block; + + fs->get_alloc_block = func; +} diff --git a/portlibs/sources/libext2fs/source/alloc_sb.c b/portlibs/sources/libext2fs/source/alloc_sb.c new file mode 100644 index 00000000..d5fca3b2 --- /dev/null +++ b/portlibs/sources/libext2fs/source/alloc_sb.c @@ -0,0 +1,86 @@ +/* + * alloc_sb.c --- Allocate the superblock and block group descriptors for a + * newly initialized filesystem. Used by mke2fs when initializing a filesystem + * + * Copyright (C) 1994, 1995, 1996, 2003 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +/* + * This function reserves the superblock and block group descriptors + * for a given block group. It currently returns the number of free + * blocks assuming that inode table and allocation bitmaps will be in + * the group. This is not necessarily the case when the flex_bg + * feature is enabled, so callers should take care! It was only + * really intended for use by mke2fs, and even there it's not that + * useful. In the future, when we redo this function for 64-bit block + * numbers, we should probably return the number of blocks used by the + * super block and group descriptors instead. + * + * See also the comment for ext2fs_super_and_bgd_loc() + */ +int ext2fs_reserve_super_and_bgd(ext2_filsys fs, + dgrp_t group, + ext2fs_block_bitmap bmap) +{ + blk64_t super_blk, old_desc_blk, new_desc_blk; + blk_t used_blks; + int j, old_desc_blocks, num_blocks; + + ext2fs_super_and_bgd_loc2(fs, group, &super_blk, + &old_desc_blk, &new_desc_blk, &used_blks); + + if (fs->super->s_feature_incompat & EXT2_FEATURE_INCOMPAT_META_BG) + old_desc_blocks = fs->super->s_first_meta_bg; + else + old_desc_blocks = + fs->desc_blocks + fs->super->s_reserved_gdt_blocks; + + if (super_blk || (group == 0)) + ext2fs_mark_block_bitmap2(bmap, super_blk); + + if (old_desc_blk) { + if (fs->super->s_reserved_gdt_blocks && fs->block_map == bmap) + ext2fs_bg_flags_clear(fs, group, EXT2_BG_BLOCK_UNINIT); + for (j=0; j < old_desc_blocks; j++) + if (old_desc_blk + j < ext2fs_blocks_count(fs->super)) + ext2fs_mark_block_bitmap2(bmap, + old_desc_blk + j); + } + if (new_desc_blk) + ext2fs_mark_block_bitmap2(bmap, new_desc_blk); + + if (group == fs->group_desc_count-1) { + num_blocks = (ext2fs_blocks_count(fs->super) - + fs->super->s_first_data_block) % + fs->super->s_blocks_per_group; + if (!num_blocks) + num_blocks = fs->super->s_blocks_per_group; + } else + num_blocks = fs->super->s_blocks_per_group; + + num_blocks -= 2 + fs->inode_blocks_per_group + used_blks; + + return num_blocks ; +} diff --git a/portlibs/sources/libext2fs/source/alloc_stats.c b/portlibs/sources/libext2fs/source/alloc_stats.c new file mode 100644 index 00000000..0f276659 --- /dev/null +++ b/portlibs/sources/libext2fs/source/alloc_stats.c @@ -0,0 +1,106 @@ +/* + * alloc_stats.c --- Update allocation statistics for ext2fs + * + * Copyright (C) 2001 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +void ext2fs_inode_alloc_stats2(ext2_filsys fs, ext2_ino_t ino, + int inuse, int isdir) +{ + int group = ext2fs_group_of_ino(fs, ino); + +#ifndef OMIT_COM_ERR + if (ino > fs->super->s_inodes_count) { + com_err("ext2fs_inode_alloc_stats2", 0, + "Illegal inode number: %lu", (unsigned long) ino); + return; + } +#endif + if (inuse > 0) + ext2fs_mark_inode_bitmap2(fs->inode_map, ino); + else + ext2fs_unmark_inode_bitmap2(fs->inode_map, ino); + ext2fs_bg_free_inodes_count_set(fs, group, ext2fs_bg_free_inodes_count(fs, group) - inuse); + if (isdir) + ext2fs_bg_used_dirs_count_set(fs, group, ext2fs_bg_used_dirs_count(fs, group) + inuse); + + /* We don't strictly need to be clearing the uninit flag if inuse < 0 + * (i.e. freeing inodes) but it also means something is bad. */ + ext2fs_bg_flags_clear(fs, group, EXT2_BG_INODE_UNINIT); + if (EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) { + ext2_ino_t first_unused_inode = fs->super->s_inodes_per_group - + ext2fs_bg_itable_unused(fs, group) + + group * fs->super->s_inodes_per_group + 1; + + if (ino >= first_unused_inode) + ext2fs_bg_itable_unused_set(fs, group, group * fs->super->s_inodes_per_group + fs->super->s_inodes_per_group - ino); + ext2fs_group_desc_csum_set(fs, group); + } + + fs->super->s_free_inodes_count -= inuse; + ext2fs_mark_super_dirty(fs); + ext2fs_mark_ib_dirty(fs); +} + +void ext2fs_inode_alloc_stats(ext2_filsys fs, ext2_ino_t ino, int inuse) +{ + ext2fs_inode_alloc_stats2(fs, ino, inuse, 0); +} + +void ext2fs_block_alloc_stats2(ext2_filsys fs, blk64_t blk, int inuse) +{ + int group = ext2fs_group_of_blk2(fs, blk); + +#ifndef OMIT_COM_ERR + if (blk >= ext2fs_blocks_count(fs->super)) { + com_err("ext2fs_block_alloc_stats", 0, + "Illegal block number: %lu", (unsigned long) blk); + return; + } +#endif + if (inuse > 0) + ext2fs_mark_block_bitmap2(fs->block_map, blk); + else + ext2fs_unmark_block_bitmap2(fs->block_map, blk); + ext2fs_bg_free_blocks_count_set(fs, group, ext2fs_bg_free_blocks_count(fs, group) - inuse); + ext2fs_bg_flags_clear(fs, group, EXT2_BG_BLOCK_UNINIT); + ext2fs_group_desc_csum_set(fs, group); + + ext2fs_free_blocks_count_add(fs->super, -inuse); + ext2fs_mark_super_dirty(fs); + ext2fs_mark_bb_dirty(fs); + if (fs->block_alloc_stats) + (fs->block_alloc_stats)(fs, (blk64_t) blk, inuse); +} + +void ext2fs_block_alloc_stats(ext2_filsys fs, blk_t blk, int inuse) +{ + ext2fs_block_alloc_stats2(fs, blk, inuse); +} + +void ext2fs_set_block_alloc_stats_callback(ext2_filsys fs, + void (*func)(ext2_filsys fs, + blk64_t blk, + int inuse), + void (**old)(ext2_filsys fs, + blk64_t blk, + int inuse)) +{ + if (!fs || fs->magic != EXT2_ET_MAGIC_EXT2FS_FILSYS) + return; + if (old) + *old = fs->block_alloc_stats; + + fs->block_alloc_stats = func; +} diff --git a/portlibs/sources/libext2fs/source/alloc_tables.c b/portlibs/sources/libext2fs/source/alloc_tables.c new file mode 100644 index 00000000..1c4532b6 --- /dev/null +++ b/portlibs/sources/libext2fs/source/alloc_tables.c @@ -0,0 +1,239 @@ +/* + * alloc_tables.c --- Allocate tables for a newly initialized + * filesystem. Used by mke2fs when initializing a filesystem + * + * Copyright (C) 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" +#include "ext2fsP.h" + +/* + * This routine searches for free blocks that can allocate a full + * group of bitmaps or inode tables for a flexbg group. Returns the + * block number with a correct offset were the bitmaps and inode + * tables can be allocated continously and in order. + */ +static blk64_t flexbg_offset(ext2_filsys fs, dgrp_t group, blk64_t start_blk, + ext2fs_block_bitmap bmap, int offset, int size, + int elem_size) +{ + int flexbg, flexbg_size; + blk64_t last_blk, first_free = 0; + dgrp_t last_grp; + + flexbg_size = 1 << fs->super->s_log_groups_per_flex; + flexbg = group / flexbg_size; + + if (size > (int) (fs->super->s_blocks_per_group / 8)) + size = (int) fs->super->s_blocks_per_group / 8; + + if (offset) + offset -= 1; + + /* + * Don't do a long search if the previous block + * search is still valid. + */ + if (start_blk && group % flexbg_size) { + if (ext2fs_test_block_bitmap_range2(bmap, start_blk + elem_size, + size)) + return start_blk + elem_size; + } + + start_blk = ext2fs_group_first_block2(fs, flexbg_size * flexbg); + last_grp = group | (flexbg_size - 1); + if (last_grp > fs->group_desc_count) + last_grp = fs->group_desc_count; + last_blk = ext2fs_group_last_block2(fs, last_grp); + + /* Find the first available block */ + if (ext2fs_get_free_blocks2(fs, start_blk, last_blk, 1, bmap, + &first_free)) + return first_free; + + if (ext2fs_get_free_blocks2(fs, first_free + offset, last_blk, size, + bmap, &first_free)) + return first_free; + + return first_free; +} + +errcode_t ext2fs_allocate_group_table(ext2_filsys fs, dgrp_t group, + ext2fs_block_bitmap bmap) +{ + errcode_t retval; + blk64_t group_blk, start_blk, last_blk, new_blk, blk; + dgrp_t last_grp = 0; + int j, rem_grps = 0, flexbg_size = 0; + + group_blk = ext2fs_group_first_block2(fs, group); + last_blk = ext2fs_group_last_block2(fs, group); + + if (!bmap) + bmap = fs->block_map; + + if (EXT2_HAS_INCOMPAT_FEATURE(fs->super, + EXT4_FEATURE_INCOMPAT_FLEX_BG) && + fs->super->s_log_groups_per_flex) { + flexbg_size = 1 << fs->super->s_log_groups_per_flex; + last_grp = group | (flexbg_size - 1); + rem_grps = last_grp - group; + if (last_grp > fs->group_desc_count) + last_grp = fs->group_desc_count; + } + + /* + * Allocate the block and inode bitmaps, if necessary + */ + if (fs->stride) { + retval = ext2fs_get_free_blocks2(fs, group_blk, last_blk, + 1, bmap, &start_blk); + if (retval) + return retval; + start_blk += fs->inode_blocks_per_group; + start_blk += ((fs->stride * group) % + (last_blk - start_blk + 1)); + if (start_blk >= last_blk) + start_blk = group_blk; + } else + start_blk = group_blk; + + if (flexbg_size) { + blk64_t prev_block = 0; + + if (group && ext2fs_block_bitmap_loc(fs, group - 1)) + prev_block = ext2fs_block_bitmap_loc(fs, group - 1); + start_blk = flexbg_offset(fs, group, prev_block, bmap, + 0, rem_grps, 1); + last_blk = ext2fs_group_last_block2(fs, last_grp); + } + + if (!ext2fs_block_bitmap_loc(fs, group)) { + retval = ext2fs_get_free_blocks2(fs, start_blk, last_blk, + 1, bmap, &new_blk); + if (retval == EXT2_ET_BLOCK_ALLOC_FAIL) + retval = ext2fs_get_free_blocks2(fs, group_blk, + last_blk, 1, bmap, &new_blk); + if (retval) + return retval; + ext2fs_mark_block_bitmap2(bmap, new_blk); + ext2fs_block_bitmap_loc_set(fs, group, new_blk); + if (flexbg_size) { + dgrp_t gr = ext2fs_group_of_blk2(fs, new_blk); + ext2fs_bg_free_blocks_count_set(fs, gr, ext2fs_bg_free_blocks_count(fs, gr) - 1); + ext2fs_free_blocks_count_add(fs->super, -1); + ext2fs_bg_flags_clear(fs, gr, EXT2_BG_BLOCK_UNINIT); + ext2fs_group_desc_csum_set(fs, gr); + } + } + + if (flexbg_size) { + blk64_t prev_block = 0; + if (group && ext2fs_inode_bitmap_loc(fs, group - 1)) + prev_block = ext2fs_inode_bitmap_loc(fs, group - 1); + start_blk = flexbg_offset(fs, group, prev_block, bmap, + flexbg_size, rem_grps, 1); + last_blk = ext2fs_group_last_block2(fs, last_grp); + } + + if (!ext2fs_inode_bitmap_loc(fs, group)) { + retval = ext2fs_get_free_blocks2(fs, start_blk, last_blk, + 1, bmap, &new_blk); + if (retval == EXT2_ET_BLOCK_ALLOC_FAIL) + retval = ext2fs_get_free_blocks2(fs, group_blk, + last_blk, 1, bmap, &new_blk); + if (retval) + return retval; + ext2fs_mark_block_bitmap2(bmap, new_blk); + ext2fs_inode_bitmap_loc_set(fs, group, new_blk); + if (flexbg_size) { + dgrp_t gr = ext2fs_group_of_blk2(fs, new_blk); + ext2fs_bg_free_blocks_count_set(fs, gr, ext2fs_bg_free_blocks_count(fs, gr) - 1); + ext2fs_free_blocks_count_add(fs->super, -1); + ext2fs_bg_flags_clear(fs, gr, EXT2_BG_BLOCK_UNINIT); + ext2fs_group_desc_csum_set(fs, gr); + } + } + + /* + * Allocate the inode table + */ + if (flexbg_size) { + blk64_t prev_block = 0; + if (group && ext2fs_inode_table_loc(fs, group - 1)) + prev_block = ext2fs_inode_table_loc(fs, group - 1); + if (last_grp == fs->group_desc_count) + rem_grps = last_grp - group; + group_blk = flexbg_offset(fs, group, prev_block, bmap, + flexbg_size * 2, + fs->inode_blocks_per_group * + rem_grps, + fs->inode_blocks_per_group); + last_blk = ext2fs_group_last_block2(fs, last_grp); + } + + if (!ext2fs_inode_table_loc(fs, group)) { + retval = ext2fs_get_free_blocks2(fs, group_blk, last_blk, + fs->inode_blocks_per_group, + bmap, &new_blk); + if (retval) + return retval; + for (j=0, blk = new_blk; + j < fs->inode_blocks_per_group; + j++, blk++) { + ext2fs_mark_block_bitmap2(bmap, blk); + if (flexbg_size) { + dgrp_t gr = ext2fs_group_of_blk2(fs, blk); + ext2fs_bg_free_blocks_count_set(fs, gr, ext2fs_bg_free_blocks_count(fs, gr) - 1); + ext2fs_free_blocks_count_add(fs->super, -1); + ext2fs_bg_flags_clear(fs, gr, + EXT2_BG_BLOCK_UNINIT); + ext2fs_group_desc_csum_set(fs, gr); + } + } + ext2fs_inode_table_loc_set(fs, group, new_blk); + } + ext2fs_group_desc_csum_set(fs, group); + return 0; +} + +errcode_t ext2fs_allocate_tables(ext2_filsys fs) +{ + errcode_t retval; + dgrp_t i; + struct ext2fs_numeric_progress_struct progress; + + ext2fs_numeric_progress_init(fs, &progress, NULL, + fs->group_desc_count); + + for (i = 0; i < fs->group_desc_count; i++) { + ext2fs_numeric_progress_update(fs, &progress, i); + retval = ext2fs_allocate_group_table(fs, i, fs->block_map); + if (retval) + return retval; + } + ext2fs_numeric_progress_close(fs, &progress, NULL); + return 0; +} + diff --git a/portlibs/sources/libext2fs/source/badblocks.c b/portlibs/sources/libext2fs/source/badblocks.c new file mode 100644 index 00000000..5eb28b78 --- /dev/null +++ b/portlibs/sources/libext2fs/source/badblocks.c @@ -0,0 +1,327 @@ +/* + * badblocks.c --- routines to manipulate the bad block structure + * + * Copyright (C) 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fsP.h" + +/* + * Helper function for making a badblocks list + */ +static errcode_t make_u32_list(int size, int num, __u32 *list, + ext2_u32_list *ret) +{ + ext2_u32_list bb; + errcode_t retval; + + retval = ext2fs_get_mem(sizeof(struct ext2_struct_u32_list), &bb); + if (retval) + return retval; + memset(bb, 0, sizeof(struct ext2_struct_u32_list)); + bb->magic = EXT2_ET_MAGIC_BADBLOCKS_LIST; + bb->size = size ? size : 10; + bb->num = num; + retval = ext2fs_get_array(bb->size, sizeof(blk_t), &bb->list); + if (retval) { + ext2fs_free_mem(&bb); + return retval; + } + if (list) + memcpy(bb->list, list, bb->size * sizeof(blk_t)); + else + memset(bb->list, 0, bb->size * sizeof(blk_t)); + *ret = bb; + return 0; +} + + +/* + * This procedure creates an empty u32 list. + */ +errcode_t ext2fs_u32_list_create(ext2_u32_list *ret, int size) +{ + return make_u32_list(size, 0, 0, ret); +} + +/* + * This procedure creates an empty badblocks list. + */ +errcode_t ext2fs_badblocks_list_create(ext2_badblocks_list *ret, int size) +{ + return make_u32_list(size, 0, 0, (ext2_badblocks_list *) ret); +} + + +/* + * This procedure copies a badblocks list + */ +errcode_t ext2fs_u32_copy(ext2_u32_list src, ext2_u32_list *dest) +{ + errcode_t retval; + + retval = make_u32_list(src->size, src->num, src->list, dest); + if (retval) + return retval; + (*dest)->badblocks_flags = src->badblocks_flags; + return 0; +} + +errcode_t ext2fs_badblocks_copy(ext2_badblocks_list src, + ext2_badblocks_list *dest) +{ + return ext2fs_u32_copy((ext2_u32_list) src, + (ext2_u32_list *) dest); +} + +/* + * This procedure frees a badblocks list. + * + * (note: moved to closefs.c) + */ + + +/* + * This procedure adds a block to a badblocks list. + */ +errcode_t ext2fs_u32_list_add(ext2_u32_list bb, __u32 blk) +{ + errcode_t retval; + int i, j; + unsigned long old_size; + + EXT2_CHECK_MAGIC(bb, EXT2_ET_MAGIC_BADBLOCKS_LIST); + + if (bb->num >= bb->size) { + old_size = bb->size * sizeof(__u32); + bb->size += 100; + retval = ext2fs_resize_mem(old_size, bb->size * sizeof(__u32), + &bb->list); + if (retval) { + bb->size -= 100; + return retval; + } + } + + /* + * Add special case code for appending to the end of the list + */ + i = bb->num-1; + if ((bb->num != 0) && (bb->list[i] == blk)) + return 0; + if ((bb->num == 0) || (bb->list[i] < blk)) { + bb->list[bb->num++] = blk; + return 0; + } + + j = bb->num; + for (i=0; i < bb->num; i++) { + if (bb->list[i] == blk) + return 0; + if (bb->list[i] > blk) { + j = i; + break; + } + } + for (i=bb->num; i > j; i--) + bb->list[i] = bb->list[i-1]; + bb->list[j] = blk; + bb->num++; + return 0; +} + +errcode_t ext2fs_badblocks_list_add(ext2_badblocks_list bb, blk_t blk) +{ + return ext2fs_u32_list_add((ext2_u32_list) bb, (__u32) blk); +} + +/* + * This procedure finds a particular block is on a badblocks + * list. + */ +int ext2fs_u32_list_find(ext2_u32_list bb, __u32 blk) +{ + int low, high, mid; + + if (bb->magic != EXT2_ET_MAGIC_BADBLOCKS_LIST) + return -1; + + if (bb->num == 0) + return -1; + + low = 0; + high = bb->num-1; + if (blk == bb->list[low]) + return low; + if (blk == bb->list[high]) + return high; + + while (low < high) { + mid = (low+high)/2; + if (mid == low || mid == high) + break; + if (blk == bb->list[mid]) + return mid; + if (blk < bb->list[mid]) + high = mid; + else + low = mid; + } + return -1; +} + +/* + * This procedure tests to see if a particular block is on a badblocks + * list. + */ +int ext2fs_u32_list_test(ext2_u32_list bb, __u32 blk) +{ + if (ext2fs_u32_list_find(bb, blk) < 0) + return 0; + else + return 1; +} + +int ext2fs_badblocks_list_test(ext2_badblocks_list bb, blk_t blk) +{ + return ext2fs_u32_list_test((ext2_u32_list) bb, (__u32) blk); +} + + +/* + * Remove a block from the badblock list + */ +int ext2fs_u32_list_del(ext2_u32_list bb, __u32 blk) +{ + int remloc, i; + + if (bb->num == 0) + return -1; + + remloc = ext2fs_u32_list_find(bb, blk); + if (remloc < 0) + return -1; + + for (i = remloc ; i < bb->num-1; i++) + bb->list[i] = bb->list[i+1]; + bb->num--; + return 0; +} + +void ext2fs_badblocks_list_del(ext2_u32_list bb, __u32 blk) +{ + ext2fs_u32_list_del(bb, blk); +} + +errcode_t ext2fs_u32_list_iterate_begin(ext2_u32_list bb, + ext2_u32_iterate *ret) +{ + ext2_u32_iterate iter; + errcode_t retval; + + EXT2_CHECK_MAGIC(bb, EXT2_ET_MAGIC_BADBLOCKS_LIST); + + retval = ext2fs_get_mem(sizeof(struct ext2_struct_u32_iterate), &iter); + if (retval) + return retval; + + iter->magic = EXT2_ET_MAGIC_BADBLOCKS_ITERATE; + iter->bb = bb; + iter->ptr = 0; + *ret = iter; + return 0; +} + +errcode_t ext2fs_badblocks_list_iterate_begin(ext2_badblocks_list bb, + ext2_badblocks_iterate *ret) +{ + return ext2fs_u32_list_iterate_begin((ext2_u32_list) bb, + (ext2_u32_iterate *) ret); +} + + +int ext2fs_u32_list_iterate(ext2_u32_iterate iter, __u32 *blk) +{ + ext2_u32_list bb; + + if (iter->magic != EXT2_ET_MAGIC_BADBLOCKS_ITERATE) + return 0; + + bb = iter->bb; + + if (bb->magic != EXT2_ET_MAGIC_BADBLOCKS_LIST) + return 0; + + if (iter->ptr < bb->num) { + *blk = bb->list[iter->ptr++]; + return 1; + } + *blk = 0; + return 0; +} + +int ext2fs_badblocks_list_iterate(ext2_badblocks_iterate iter, blk_t *blk) +{ + return ext2fs_u32_list_iterate((ext2_u32_iterate) iter, + (__u32 *) blk); +} + + +void ext2fs_u32_list_iterate_end(ext2_u32_iterate iter) +{ + if (!iter || (iter->magic != EXT2_ET_MAGIC_BADBLOCKS_ITERATE)) + return; + + iter->bb = 0; + ext2fs_free_mem(&iter); +} + +void ext2fs_badblocks_list_iterate_end(ext2_badblocks_iterate iter) +{ + ext2fs_u32_list_iterate_end((ext2_u32_iterate) iter); +} + + +int ext2fs_u32_list_equal(ext2_u32_list bb1, ext2_u32_list bb2) +{ + EXT2_CHECK_MAGIC(bb1, EXT2_ET_MAGIC_BADBLOCKS_LIST); + EXT2_CHECK_MAGIC(bb2, EXT2_ET_MAGIC_BADBLOCKS_LIST); + + if (bb1->num != bb2->num) + return 0; + + if (memcmp(bb1->list, bb2->list, bb1->num * sizeof(blk_t)) != 0) + return 0; + return 1; +} + +int ext2fs_badblocks_equal(ext2_badblocks_list bb1, ext2_badblocks_list bb2) +{ + return ext2fs_u32_list_equal((ext2_u32_list) bb1, + (ext2_u32_list) bb2); +} + +int ext2fs_u32_list_count(ext2_u32_list bb) +{ + return bb->num; +} diff --git a/portlibs/sources/libext2fs/source/bb_compat.c b/portlibs/sources/libext2fs/source/bb_compat.c new file mode 100644 index 00000000..a94e3e48 --- /dev/null +++ b/portlibs/sources/libext2fs/source/bb_compat.c @@ -0,0 +1,63 @@ +/* + * bb_compat.c --- compatibility badblocks routines + * + * Copyright (C) 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fsP.h" + +errcode_t badblocks_list_create(badblocks_list *ret, int size) +{ + return ext2fs_badblocks_list_create(ret, size); +} + +void badblocks_list_free(badblocks_list bb) +{ + ext2fs_badblocks_list_free(bb); +} + +errcode_t badblocks_list_add(badblocks_list bb, blk_t blk) +{ + return ext2fs_badblocks_list_add(bb, blk); +} + +int badblocks_list_test(badblocks_list bb, blk_t blk) +{ + return ext2fs_badblocks_list_test(bb, blk); +} + +errcode_t badblocks_list_iterate_begin(badblocks_list bb, + badblocks_iterate *ret) +{ + return ext2fs_badblocks_list_iterate_begin(bb, ret); +} + +int badblocks_list_iterate(badblocks_iterate iter, blk_t *blk) +{ + return ext2fs_badblocks_list_iterate(iter, blk); +} + +void badblocks_list_iterate_end(badblocks_iterate iter) +{ + ext2fs_badblocks_list_iterate_end(iter); +} diff --git a/portlibs/sources/libext2fs/source/bb_inode.c b/portlibs/sources/libext2fs/source/bb_inode.c new file mode 100644 index 00000000..0b6c3dd2 --- /dev/null +++ b/portlibs/sources/libext2fs/source/bb_inode.c @@ -0,0 +1,266 @@ +/* + * bb_inode.c --- routines to update the bad block inode. + * + * WARNING: This routine modifies a lot of state in the filesystem; if + * this routine returns an error, the bad block inode may be in an + * inconsistent state. + * + * Copyright (C) 1994, 1995 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +struct set_badblock_record { + ext2_badblocks_iterate bb_iter; + int bad_block_count; + blk_t *ind_blocks; + int max_ind_blocks; + int ind_blocks_size; + int ind_blocks_ptr; + char *block_buf; + errcode_t err; +}; + +static int set_bad_block_proc(ext2_filsys fs, blk_t *block_nr, + e2_blkcnt_t blockcnt, + blk_t ref_block, int ref_offset, + void *priv_data); +static int clear_bad_block_proc(ext2_filsys fs, blk_t *block_nr, + e2_blkcnt_t blockcnt, + blk_t ref_block, int ref_offset, + void *priv_data); + +/* + * Given a bad blocks bitmap, update the bad blocks inode to reflect + * the map. + */ +errcode_t ext2fs_update_bb_inode(ext2_filsys fs, ext2_badblocks_list bb_list) +{ + errcode_t retval; + struct set_badblock_record rec; + struct ext2_inode inode; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!fs->block_map) + return EXT2_ET_NO_BLOCK_BITMAP; + + memset(&rec, 0, sizeof(rec)); + rec.max_ind_blocks = 10; + retval = ext2fs_get_array(rec.max_ind_blocks, sizeof(blk_t), + &rec.ind_blocks); + if (retval) + return retval; + memset(rec.ind_blocks, 0, rec.max_ind_blocks * sizeof(blk_t)); + retval = ext2fs_get_mem(fs->blocksize, &rec.block_buf); + if (retval) + goto cleanup; + memset(rec.block_buf, 0, fs->blocksize); + rec.err = 0; + + /* + * First clear the old bad blocks (while saving the indirect blocks) + */ + retval = ext2fs_block_iterate2(fs, EXT2_BAD_INO, + BLOCK_FLAG_DEPTH_TRAVERSE, 0, + clear_bad_block_proc, &rec); + if (retval) + goto cleanup; + if (rec.err) { + retval = rec.err; + goto cleanup; + } + + /* + * Now set the bad blocks! + * + * First, mark the bad blocks as used. This prevents a bad + * block from being used as an indirecto block for the bad + * block inode (!). + */ + if (bb_list) { + retval = ext2fs_badblocks_list_iterate_begin(bb_list, + &rec.bb_iter); + if (retval) + goto cleanup; + retval = ext2fs_block_iterate2(fs, EXT2_BAD_INO, + BLOCK_FLAG_APPEND, 0, + set_bad_block_proc, &rec); + ext2fs_badblocks_list_iterate_end(rec.bb_iter); + if (retval) + goto cleanup; + if (rec.err) { + retval = rec.err; + goto cleanup; + } + } + + /* + * Update the bad block inode's mod time and block count + * field. + */ + retval = ext2fs_read_inode(fs, EXT2_BAD_INO, &inode); + if (retval) + goto cleanup; + + inode.i_atime = inode.i_mtime = fs->now ? fs->now : time(0); + if (!inode.i_ctime) + inode.i_ctime = fs->now ? fs->now : time(0); + ext2fs_iblk_set(fs, &inode, rec.bad_block_count); + inode.i_size = rec.bad_block_count * fs->blocksize; + + retval = ext2fs_write_inode(fs, EXT2_BAD_INO, &inode); + if (retval) + goto cleanup; + +cleanup: + ext2fs_free_mem(&rec.ind_blocks); + ext2fs_free_mem(&rec.block_buf); + return retval; +} + +/* + * Helper function for update_bb_inode() + * + * Clear the bad blocks in the bad block inode, while saving the + * indirect blocks. + */ +#ifdef __TURBOC__ + #pragma argsused +#endif +static int clear_bad_block_proc(ext2_filsys fs, blk_t *block_nr, + e2_blkcnt_t blockcnt, + blk_t ref_block EXT2FS_ATTR((unused)), + int ref_offset EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct set_badblock_record *rec = (struct set_badblock_record *) + priv_data; + errcode_t retval; + unsigned long old_size; + + if (!*block_nr) + return 0; + + /* + * If the block number is outrageous, clear it and ignore it. + */ + if (*block_nr >= ext2fs_blocks_count(fs->super) || + *block_nr < fs->super->s_first_data_block) { + *block_nr = 0; + return BLOCK_CHANGED; + } + + if (blockcnt < 0) { + if (rec->ind_blocks_size >= rec->max_ind_blocks) { + old_size = rec->max_ind_blocks * sizeof(blk_t); + rec->max_ind_blocks += 10; + retval = ext2fs_resize_mem(old_size, + rec->max_ind_blocks * sizeof(blk_t), + &rec->ind_blocks); + if (retval) { + rec->max_ind_blocks -= 10; + rec->err = retval; + return BLOCK_ABORT; + } + } + rec->ind_blocks[rec->ind_blocks_size++] = *block_nr; + } + + /* + * Mark the block as unused, and update accounting information + */ + ext2fs_block_alloc_stats2(fs, *block_nr, -1); + + *block_nr = 0; + return BLOCK_CHANGED; +} + + +/* + * Helper function for update_bb_inode() + * + * Set the block list in the bad block inode, using the supplied bitmap. + */ +#ifdef __TURBOC__ + #pragma argsused +#endif +static int set_bad_block_proc(ext2_filsys fs, blk_t *block_nr, + e2_blkcnt_t blockcnt, + blk_t ref_block EXT2FS_ATTR((unused)), + int ref_offset EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct set_badblock_record *rec = (struct set_badblock_record *) + priv_data; + errcode_t retval; + blk_t blk; + + if (blockcnt >= 0) { + /* + * Get the next bad block. + */ + if (!ext2fs_badblocks_list_iterate(rec->bb_iter, &blk)) + return BLOCK_ABORT; + rec->bad_block_count++; + } else { + /* + * An indirect block; fetch a block from the + * previously used indirect block list. The block + * most be not marked as used; if so, get another one. + * If we run out of reserved indirect blocks, allocate + * a new one. + */ + retry: + if (rec->ind_blocks_ptr < rec->ind_blocks_size) { + blk = rec->ind_blocks[rec->ind_blocks_ptr++]; + if (ext2fs_test_block_bitmap2(fs->block_map, blk)) + goto retry; + } else { + retval = ext2fs_new_block(fs, 0, 0, &blk); + if (retval) { + rec->err = retval; + return BLOCK_ABORT; + } + } + retval = io_channel_write_blk64(fs->io, blk, 1, rec->block_buf); + if (retval) { + rec->err = retval; + return BLOCK_ABORT; + } + } + + /* + * Update block counts + */ + ext2fs_block_alloc_stats2(fs, blk, +1); + + *block_nr = blk; + return BLOCK_CHANGED; +} + + + + + + diff --git a/portlibs/sources/libext2fs/source/bit_ops.h b/portlibs/sources/libext2fs/source/bit_ops.h new file mode 100644 index 00000000..762be0b3 --- /dev/null +++ b/portlibs/sources/libext2fs/source/bit_ops.h @@ -0,0 +1,57 @@ +/* + bit_ops.h + Functions for dealing with conversion of data between types + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _BIT_OPS_H +#define _BIT_OPS_H + +#include <stdint.h> + +/*----------------------------------------------------------------- +Functions to deal with little endian values stored in uint8_t arrays +-----------------------------------------------------------------*/ +static inline uint16_t u8array_to_u16 (const uint8_t* item, int offset) { + return ( item[offset] | (item[offset + 1] << 8)); +} + +static inline uint32_t u8array_to_u32 (const uint8_t* item, int offset) { + return ( item[offset] | (item[offset + 1] << 8) | (item[offset + 2] << 16) | (item[offset + 3] << 24)); +} + +static inline void u16_to_u8array (uint8_t* item, int offset, uint16_t value) { + item[offset] = (uint8_t) value; + item[offset + 1] = (uint8_t)(value >> 8); +} + +static inline void u32_to_u8array (uint8_t* item, int offset, uint32_t value) { + item[offset] = (uint8_t) value; + item[offset + 1] = (uint8_t)(value >> 8); + item[offset + 2] = (uint8_t)(value >> 16); + item[offset + 3] = (uint8_t)(value >> 24); +} + +#endif // _BIT_OPS_H diff --git a/portlibs/sources/libext2fs/source/bitmaps.c b/portlibs/sources/libext2fs/source/bitmaps.c new file mode 100644 index 00000000..c53d61ec --- /dev/null +++ b/portlibs/sources/libext2fs/source/bitmaps.c @@ -0,0 +1,256 @@ +/* + * bitmaps.c --- routines to read, write, and manipulate the inode and + * block bitmaps. + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" +#include "ext2fsP.h" + +void ext2fs_free_inode_bitmap(ext2fs_inode_bitmap bitmap) +{ + ext2fs_free_generic_bmap(bitmap); +} + +void ext2fs_free_block_bitmap(ext2fs_block_bitmap bitmap) +{ + ext2fs_free_generic_bmap(bitmap); +} + +errcode_t ext2fs_copy_bitmap(ext2fs_generic_bitmap src, + ext2fs_generic_bitmap *dest) +{ + return (ext2fs_copy_generic_bmap(src, dest)); +} +void ext2fs_set_bitmap_padding(ext2fs_generic_bitmap map) +{ + ext2fs_set_generic_bmap_padding(map); +} + +errcode_t ext2fs_allocate_inode_bitmap(ext2_filsys fs, + const char *descr, + ext2fs_inode_bitmap *ret) +{ + __u64 start, end, real_end; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + fs->write_bitmaps = ext2fs_write_bitmaps; + + start = 1; + end = fs->super->s_inodes_count; + real_end = (EXT2_INODES_PER_GROUP(fs->super) * fs->group_desc_count); + + /* Are we permitted to use new-style bitmaps? */ + if (fs->flags & EXT2_FLAG_64BITS) + return (ext2fs_alloc_generic_bmap(fs, + EXT2_ET_MAGIC_INODE_BITMAP64, + EXT2FS_BMAP64_BITARRAY, + start, end, real_end, descr, ret)); + + /* Otherwise, check to see if the file system is small enough + * to use old-style 32-bit bitmaps */ + if ((end > ~0U) || (real_end > ~0U)) + return EXT2_ET_CANT_USE_LEGACY_BITMAPS; + + return (ext2fs_make_generic_bitmap(EXT2_ET_MAGIC_INODE_BITMAP, fs, + start, end, real_end, + descr, 0, + (ext2fs_generic_bitmap *) ret)); +} + +errcode_t ext2fs_allocate_block_bitmap(ext2_filsys fs, + const char *descr, + ext2fs_block_bitmap *ret) +{ + __u64 start, end, real_end; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + fs->write_bitmaps = ext2fs_write_bitmaps; + + start = fs->super->s_first_data_block; + end = ext2fs_blocks_count(fs->super)-1; + real_end = ((__u64) EXT2_BLOCKS_PER_GROUP(fs->super) + * (__u64) fs->group_desc_count)-1 + start; + + if (fs->flags & EXT2_FLAG_64BITS) + return (ext2fs_alloc_generic_bmap(fs, + EXT2_ET_MAGIC_BLOCK_BITMAP64, + EXT2FS_BMAP64_BITARRAY, + start, end, real_end, descr, ret)); + + if ((end > ~0U) || (real_end > ~0U)) + return EXT2_ET_CANT_USE_LEGACY_BITMAPS; + + return (ext2fs_make_generic_bitmap(EXT2_ET_MAGIC_BLOCK_BITMAP, fs, + start, end, real_end, + descr, 0, + (ext2fs_generic_bitmap *) ret)); +} + +errcode_t ext2fs_fudge_inode_bitmap_end(ext2fs_inode_bitmap bitmap, + ext2_ino_t end, ext2_ino_t *oend) +{ + __u64 tmp_oend; + int retval; + + retval = ext2fs_fudge_generic_bmap_end((ext2fs_generic_bitmap) bitmap, + EXT2_ET_FUDGE_INODE_BITMAP_END, + end, &tmp_oend); + if (oend) + *oend = tmp_oend; + return retval; +} + +errcode_t ext2fs_fudge_block_bitmap_end(ext2fs_block_bitmap bitmap, + blk_t end, blk_t *oend) +{ + return (ext2fs_fudge_generic_bitmap_end(bitmap, + EXT2_ET_MAGIC_BLOCK_BITMAP, + EXT2_ET_FUDGE_BLOCK_BITMAP_END, + end, oend)); +} + +errcode_t ext2fs_fudge_block_bitmap_end2(ext2fs_block_bitmap bitmap, + blk64_t end, blk64_t *oend) +{ + return (ext2fs_fudge_generic_bmap_end(bitmap, + EXT2_ET_FUDGE_BLOCK_BITMAP_END, + end, oend)); +} + +void ext2fs_clear_inode_bitmap(ext2fs_inode_bitmap bitmap) +{ + ext2fs_clear_generic_bmap(bitmap); +} + +void ext2fs_clear_block_bitmap(ext2fs_block_bitmap bitmap) +{ + ext2fs_clear_generic_bmap(bitmap); +} + +errcode_t ext2fs_resize_inode_bitmap(__u32 new_end, __u32 new_real_end, + ext2fs_inode_bitmap bmap) +{ + return (ext2fs_resize_generic_bitmap(EXT2_ET_MAGIC_INODE_BITMAP, + new_end, new_real_end, bmap)); +} + +errcode_t ext2fs_resize_inode_bitmap2(__u64 new_end, __u64 new_real_end, + ext2fs_inode_bitmap bmap) +{ + return (ext2fs_resize_generic_bmap(bmap, new_end, new_real_end)); +} + +errcode_t ext2fs_resize_block_bitmap(__u32 new_end, __u32 new_real_end, + ext2fs_block_bitmap bmap) +{ + return (ext2fs_resize_generic_bitmap(EXT2_ET_MAGIC_BLOCK_BITMAP, + new_end, new_real_end, bmap)); +} + +errcode_t ext2fs_resize_block_bitmap2(__u64 new_end, __u64 new_real_end, + ext2fs_block_bitmap bmap) +{ + return (ext2fs_resize_generic_bmap(bmap, new_end, new_real_end)); +} + +errcode_t ext2fs_compare_block_bitmap(ext2fs_block_bitmap bm1, + ext2fs_block_bitmap bm2) +{ + return (ext2fs_compare_generic_bmap(EXT2_ET_NEQ_BLOCK_BITMAP, + bm1, bm2)); +} + +errcode_t ext2fs_compare_inode_bitmap(ext2fs_inode_bitmap bm1, + ext2fs_inode_bitmap bm2) +{ + return (ext2fs_compare_generic_bmap(EXT2_ET_NEQ_INODE_BITMAP, + bm1, bm2)); +} + +errcode_t ext2fs_set_inode_bitmap_range(ext2fs_inode_bitmap bmap, + ext2_ino_t start, unsigned int num, + void *in) +{ + return (ext2fs_set_generic_bitmap_range(bmap, + EXT2_ET_MAGIC_INODE_BITMAP, + start, num, in)); +} + +errcode_t ext2fs_set_inode_bitmap_range2(ext2fs_inode_bitmap bmap, + __u64 start, size_t num, + void *in) +{ + return (ext2fs_set_generic_bmap_range(bmap, start, num, in)); +} + +errcode_t ext2fs_get_inode_bitmap_range(ext2fs_inode_bitmap bmap, + ext2_ino_t start, unsigned int num, + void *out) +{ + return (ext2fs_get_generic_bitmap_range(bmap, + EXT2_ET_MAGIC_INODE_BITMAP, + start, num, out)); +} + +errcode_t ext2fs_get_inode_bitmap_range2(ext2fs_inode_bitmap bmap, + __u64 start, size_t num, + void *out) +{ + return (ext2fs_get_generic_bmap_range(bmap, start, num, out)); +} + +errcode_t ext2fs_set_block_bitmap_range(ext2fs_block_bitmap bmap, + blk_t start, unsigned int num, + void *in) +{ + return (ext2fs_set_generic_bitmap_range(bmap, + EXT2_ET_MAGIC_BLOCK_BITMAP, + start, num, in)); +} + +errcode_t ext2fs_set_block_bitmap_range2(ext2fs_block_bitmap bmap, + blk64_t start, size_t num, + void *in) +{ + return (ext2fs_set_generic_bmap_range(bmap, start, num, in)); +} + +errcode_t ext2fs_get_block_bitmap_range(ext2fs_block_bitmap bmap, + blk_t start, unsigned int num, + void *out) +{ + return (ext2fs_get_generic_bitmap_range(bmap, + EXT2_ET_MAGIC_BLOCK_BITMAP, + start, num, out)); +} + +errcode_t ext2fs_get_block_bitmap_range2(ext2fs_block_bitmap bmap, + blk64_t start, size_t num, + void *out) +{ + return (ext2fs_get_generic_bmap_range(bmap, start, num, out)); +} diff --git a/portlibs/sources/libext2fs/source/bitops.c b/portlibs/sources/libext2fs/source/bitops.c new file mode 100644 index 00000000..a3f72c31 --- /dev/null +++ b/portlibs/sources/libext2fs/source/bitops.c @@ -0,0 +1,117 @@ +/* + * bitops.c --- Bitmap frobbing code. See bitops.h for the inlined + * routines. + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +#ifndef _EXT2_HAVE_ASM_BITOPS_ + +/* + * For the benefit of those who are trying to port Linux to another + * architecture, here are some C-language equivalents. You should + * recode these in the native assmebly language, if at all possible. + * + * C language equivalents written by Theodore Ts'o, 9/26/92. + * Modified by Pete A. Zaitcev 7/14/95 to be portable to big endian + * systems, as well as non-32 bit systems. + */ + +int ext2fs_set_bit(unsigned int nr,void * addr) +{ + int mask, retval; + unsigned char *ADDR = (unsigned char *) addr; + + ADDR += nr >> 3; + mask = 1 << (nr & 0x07); + retval = mask & *ADDR; + *ADDR |= mask; + return retval; +} + +int ext2fs_clear_bit(unsigned int nr, void * addr) +{ + int mask, retval; + unsigned char *ADDR = (unsigned char *) addr; + + ADDR += nr >> 3; + mask = 1 << (nr & 0x07); + retval = mask & *ADDR; + *ADDR &= ~mask; + return retval; +} + +int ext2fs_test_bit(unsigned int nr, const void * addr) +{ + int mask; + const unsigned char *ADDR = (const unsigned char *) addr; + + ADDR += nr >> 3; + mask = 1 << (nr & 0x07); + return (mask & *ADDR); +} + +#endif /* !_EXT2_HAVE_ASM_BITOPS_ */ + +void ext2fs_warn_bitmap(errcode_t errcode, unsigned long arg, + const char *description) +{ +#ifndef OMIT_COM_ERR + if (description) + com_err(0, errcode, "#%lu for %s", arg, description); + else + com_err(0, errcode, "#%lu", arg); +#endif +} + +/* + * C-only 64 bit ops. + */ + +int ext2fs_set_bit64(__u64 nr, void * addr) +{ + int mask, retval; + unsigned char *ADDR = (unsigned char *) addr; + + ADDR += nr >> 3; + mask = 1 << (nr & 0x07); + retval = mask & *ADDR; + *ADDR |= mask; + return retval; +} + +int ext2fs_clear_bit64(__u64 nr, void * addr) +{ + int mask, retval; + unsigned char *ADDR = (unsigned char *) addr; + + ADDR += nr >> 3; + mask = 1 << (nr & 0x07); + retval = mask & *ADDR; + *ADDR &= ~mask; + return retval; +} + +int ext2fs_test_bit64(__u64 nr, const void * addr) +{ + int mask; + const unsigned char *ADDR = (const unsigned char *) addr; + + ADDR += nr >> 3; + mask = 1 << (nr & 0x07); + return (mask & *ADDR); +} + diff --git a/portlibs/sources/libext2fs/source/bitops.h b/portlibs/sources/libext2fs/source/bitops.h new file mode 100644 index 00000000..bf6ee82a --- /dev/null +++ b/portlibs/sources/libext2fs/source/bitops.h @@ -0,0 +1,638 @@ +/* + * bitops.h --- Bitmap frobbing code. The byte swapping routines are + * also included here. + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ +#ifndef _BITOPS_H_ +#define _BITOPS_H_ + +extern int ext2fs_set_bit(unsigned int nr,void * addr); +extern int ext2fs_clear_bit(unsigned int nr, void * addr); +extern int ext2fs_test_bit(unsigned int nr, const void * addr); +extern void ext2fs_fast_set_bit(unsigned int nr,void * addr); +extern void ext2fs_fast_clear_bit(unsigned int nr, void * addr); +extern int ext2fs_set_bit64(__u64 nr,void * addr); +extern int ext2fs_clear_bit64(__u64 nr, void * addr); +extern int ext2fs_test_bit64(__u64 nr, const void * addr); +extern void ext2fs_fast_set_bit64(__u64 nr,void * addr); +extern void ext2fs_fast_clear_bit64(__u64 nr, void * addr); +extern __u16 ext2fs_swab16(__u16 val); +extern __u32 ext2fs_swab32(__u32 val); +extern __u64 ext2fs_swab64(__u64 val); + +#ifdef WORDS_BIGENDIAN +#define ext2fs_cpu_to_le64(x) ext2fs_swab64((x)) +#define ext2fs_le64_to_cpu(x) ext2fs_swab64((x)) +#define ext2fs_cpu_to_le32(x) ext2fs_swab32((x)) +#define ext2fs_le32_to_cpu(x) ext2fs_swab32((x)) +#define ext2fs_cpu_to_le16(x) ext2fs_swab16((x)) +#define ext2fs_le16_to_cpu(x) ext2fs_swab16((x)) +#define ext2fs_cpu_to_be32(x) ((__u32)(x)) +#define ext2fs_be32_to_cpu(x) ((__u32)(x)) +#define ext2fs_cpu_to_be16(x) ((__u16)(x)) +#define ext2fs_be16_to_cpu(x) ((__u16)(x)) +#else +#define ext2fs_cpu_to_le64(x) ((__u64)(x)) +#define ext2fs_le64_to_cpu(x) ((__u64)(x)) +#define ext2fs_cpu_to_le32(x) ((__u32)(x)) +#define ext2fs_le32_to_cpu(x) ((__u32)(x)) +#define ext2fs_cpu_to_le16(x) ((__u16)(x)) +#define ext2fs_le16_to_cpu(x) ((__u16)(x)) +#define ext2fs_cpu_to_be32(x) ext2fs_swab32((x)) +#define ext2fs_be32_to_cpu(x) ext2fs_swab32((x)) +#define ext2fs_cpu_to_be16(x) ext2fs_swab16((x)) +#define ext2fs_be16_to_cpu(x) ext2fs_swab16((x)) +#endif + +/* + * EXT2FS bitmap manipulation routines. + */ + +/* Support for sending warning messages from the inline subroutines */ +extern const char *ext2fs_block_string; +extern const char *ext2fs_inode_string; +extern const char *ext2fs_mark_string; +extern const char *ext2fs_unmark_string; +extern const char *ext2fs_test_string; +extern void ext2fs_warn_bitmap(errcode_t errcode, unsigned long arg, + const char *description); +extern void ext2fs_warn_bitmap2(ext2fs_generic_bitmap bitmap, + int code, unsigned long arg); + +extern int ext2fs_mark_block_bitmap(ext2fs_block_bitmap bitmap, blk_t block); +extern int ext2fs_unmark_block_bitmap(ext2fs_block_bitmap bitmap, + blk_t block); +extern int ext2fs_test_block_bitmap(ext2fs_block_bitmap bitmap, blk_t block); + +extern int ext2fs_mark_inode_bitmap(ext2fs_inode_bitmap bitmap, ext2_ino_t inode); +extern int ext2fs_unmark_inode_bitmap(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode); +extern int ext2fs_test_inode_bitmap(ext2fs_inode_bitmap bitmap, ext2_ino_t inode); + +extern void ext2fs_fast_mark_block_bitmap(ext2fs_block_bitmap bitmap, + blk_t block); +extern void ext2fs_fast_unmark_block_bitmap(ext2fs_block_bitmap bitmap, + blk_t block); +extern int ext2fs_fast_test_block_bitmap(ext2fs_block_bitmap bitmap, + blk_t block); + +extern void ext2fs_fast_mark_inode_bitmap(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode); +extern void ext2fs_fast_unmark_inode_bitmap(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode); +extern int ext2fs_fast_test_inode_bitmap(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode); +extern blk_t ext2fs_get_block_bitmap_start(ext2fs_block_bitmap bitmap); +extern ext2_ino_t ext2fs_get_inode_bitmap_start(ext2fs_inode_bitmap bitmap); +extern blk_t ext2fs_get_block_bitmap_end(ext2fs_block_bitmap bitmap); +extern ext2_ino_t ext2fs_get_inode_bitmap_end(ext2fs_inode_bitmap bitmap); + +extern void ext2fs_mark_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num); +extern void ext2fs_unmark_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num); +extern int ext2fs_test_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num); +extern int ext2fs_test_inode_bitmap_range(ext2fs_inode_bitmap bitmap, + ino_t inode, int num); +extern void ext2fs_fast_mark_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num); +extern void ext2fs_fast_unmark_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num); +extern int ext2fs_fast_test_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num); +extern void ext2fs_set_bitmap_padding(ext2fs_generic_bitmap map); + +/* These routines moved to gen_bitmap.c (actually, some of the above, too) */ +extern int ext2fs_mark_generic_bitmap(ext2fs_generic_bitmap bitmap, + __u32 bitno); +extern int ext2fs_unmark_generic_bitmap(ext2fs_generic_bitmap bitmap, + blk_t bitno); +extern int ext2fs_test_generic_bitmap(ext2fs_generic_bitmap bitmap, + blk_t bitno); +extern int ext2fs_test_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num); +extern __u32 ext2fs_get_generic_bitmap_start(ext2fs_generic_bitmap bitmap); +extern __u32 ext2fs_get_generic_bitmap_end(ext2fs_generic_bitmap bitmap); + +/* 64-bit versions */ + +extern int ext2fs_mark_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block); +extern int ext2fs_unmark_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block); +extern int ext2fs_test_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block); + +extern int ext2fs_mark_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode); +extern int ext2fs_unmark_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode); +extern int ext2fs_test_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode); + +extern void ext2fs_fast_mark_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block); +extern void ext2fs_fast_unmark_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block); +extern int ext2fs_fast_test_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block); + +extern void ext2fs_fast_mark_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode); +extern void ext2fs_fast_unmark_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode); +extern int ext2fs_fast_test_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode); +extern blk64_t ext2fs_get_block_bitmap_start2(ext2fs_block_bitmap bitmap); +extern ext2_ino_t ext2fs_get_inode_bitmap_start2(ext2fs_inode_bitmap bitmap); +extern blk64_t ext2fs_get_block_bitmap_end2(ext2fs_block_bitmap bitmap); +extern ext2_ino_t ext2fs_get_inode_bitmap_end2(ext2fs_inode_bitmap bitmap); + +extern int ext2fs_fast_test_block_bitmap_range2(ext2fs_block_bitmap bitmap, + blk64_t block, + unsigned int num); +extern void ext2fs_fast_mark_block_bitmap_range2(ext2fs_block_bitmap bitmap, + blk64_t block, + unsigned int num); +extern void ext2fs_fast_unmark_block_bitmap_range2(ext2fs_block_bitmap bitmap, + blk64_t block, + unsigned int num); +/* These routines moved to gen_bitmap64.c */ +extern void ext2fs_clear_generic_bmap(ext2fs_generic_bitmap bitmap); +extern errcode_t ext2fs_compare_generic_bmap(errcode_t neq, + ext2fs_generic_bitmap bm1, + ext2fs_generic_bitmap bm2); +extern void ext2fs_set_generic_bmap_padding(ext2fs_generic_bitmap bmap); +extern int ext2fs_mark_generic_bmap(ext2fs_generic_bitmap bitmap, + blk64_t bitno); +extern int ext2fs_unmark_generic_bmap(ext2fs_generic_bitmap bitmap, + blk64_t bitno); +extern int ext2fs_test_generic_bmap(ext2fs_generic_bitmap bitmap, + blk64_t bitno); +extern int ext2fs_test_block_bitmap_range2(ext2fs_block_bitmap bitmap, + blk64_t block, unsigned int num); +extern __u64 ext2fs_get_generic_bmap_start(ext2fs_generic_bitmap bitmap); +extern __u64 ext2fs_get_generic_bmap_end(ext2fs_generic_bitmap bitmap); +extern int ext2fs_test_block_bitmap_range2(ext2fs_block_bitmap bitmap, + blk64_t block, unsigned int num); +extern void ext2fs_mark_block_bitmap_range2(ext2fs_block_bitmap bitmap, + blk64_t block, unsigned int num); +extern void ext2fs_unmark_block_bitmap_range2(ext2fs_block_bitmap bitmap, + blk64_t block, unsigned int num); + +/* + * The inline routines themselves... + * + * If NO_INLINE_FUNCS is defined, then we won't try to do inline + * functions at all; they will be included as normal functions in + * inline.c + */ +#ifdef NO_INLINE_FUNCS +#if (defined(__GNUC__) && (defined(__i386__) || defined(__i486__) || \ + defined(__i586__) || defined(__mc68000__))) + /* This prevents bitops.c from trying to include the C */ + /* function version of these functions */ +#define _EXT2_HAVE_ASM_BITOPS_ +#endif +#endif /* NO_INLINE_FUNCS */ + +#if (defined(INCLUDE_INLINE_FUNCS) || !defined(NO_INLINE_FUNCS)) +#ifdef INCLUDE_INLINE_FUNCS +#define _INLINE_ extern +#else +#ifdef __GNUC__ +#define _INLINE_ extern __inline__ +#else /* For Watcom C */ +#define _INLINE_ extern inline +#endif +#endif + +/* + * Fast bit set/clear functions that doesn't need to return the + * previous bit value. + */ + +_INLINE_ void ext2fs_fast_set_bit(unsigned int nr,void * addr) +{ + unsigned char *ADDR = (unsigned char *) addr; + + ADDR += nr >> 3; + *ADDR |= (1 << (nr & 0x07)); +} + +_INLINE_ void ext2fs_fast_clear_bit(unsigned int nr, void * addr) +{ + unsigned char *ADDR = (unsigned char *) addr; + + ADDR += nr >> 3; + *ADDR &= ~(1 << (nr & 0x07)); +} + + +_INLINE_ void ext2fs_fast_set_bit64(__u64 nr, void * addr) +{ + unsigned char *ADDR = (unsigned char *) addr; + + ADDR += nr >> 3; + *ADDR |= (1 << (nr & 0x07)); +} + +_INLINE_ void ext2fs_fast_clear_bit64(__u64 nr, void * addr) +{ + unsigned char *ADDR = (unsigned char *) addr; + + ADDR += nr >> 3; + *ADDR &= ~(1 << (nr & 0x07)); +} + + +#if ((defined __GNUC__) && !defined(_EXT2_USE_C_VERSIONS_) && \ + (defined(__i386__) || defined(__i486__) || defined(__i586__))) + +#define _EXT2_HAVE_ASM_BITOPS_ +#define _EXT2_HAVE_ASM_SWAB_ + +/* + * These are done by inline assembly for speed reasons..... + * + * All bitoperations return 0 if the bit was cleared before the + * operation and != 0 if it was not. Bit 0 is the LSB of addr; bit 32 + * is the LSB of (addr+1). + */ + +/* + * Some hacks to defeat gcc over-optimizations.. + */ +struct __dummy_h { unsigned long a[100]; }; +#define EXT2FS_ADDR (*(struct __dummy_h *) addr) +#define EXT2FS_CONST_ADDR (*(const struct __dummy_h *) addr) + +_INLINE_ int ext2fs_set_bit(unsigned int nr, void * addr) +{ + int oldbit; + + addr = (void *) (((unsigned char *) addr) + (nr >> 3)); + __asm__ __volatile__("btsl %2,%1\n\tsbbl %0,%0" + :"=r" (oldbit),"+m" (EXT2FS_ADDR) + :"r" (nr & 7)); + return oldbit; +} + +_INLINE_ int ext2fs_clear_bit(unsigned int nr, void * addr) +{ + int oldbit; + + addr = (void *) (((unsigned char *) addr) + (nr >> 3)); + __asm__ __volatile__("btrl %2,%1\n\tsbbl %0,%0" + :"=r" (oldbit),"+m" (EXT2FS_ADDR) + :"r" (nr & 7)); + return oldbit; +} + +_INLINE_ int ext2fs_test_bit(unsigned int nr, const void * addr) +{ + int oldbit; + + addr = (const void *) (((const unsigned char *) addr) + (nr >> 3)); + __asm__ __volatile__("btl %2,%1\n\tsbbl %0,%0" + :"=r" (oldbit) + :"m" (EXT2FS_CONST_ADDR),"r" (nr & 7)); + return oldbit; +} + +_INLINE_ __u32 ext2fs_swab32(__u32 val) +{ +#ifdef EXT2FS_REQUIRE_486 + __asm__("bswap %0" : "=r" (val) : "0" (val)); +#else + __asm__("xchgb %b0,%h0\n\t" /* swap lower bytes */ + "rorl $16,%0\n\t" /* swap words */ + "xchgb %b0,%h0" /* swap higher bytes */ + :"=q" (val) + : "0" (val)); +#endif + return val; +} + +_INLINE_ __u16 ext2fs_swab16(__u16 val) +{ + __asm__("xchgb %b0,%h0" /* swap bytes */ \ + : "=q" (val) \ + : "0" (val)); \ + return val; +} + +#undef EXT2FS_ADDR + +#endif /* i386 */ + +#if ((defined __GNUC__) && !defined(_EXT2_USE_C_VERSIONS_) && \ + (defined(__mc68000__))) + +#define _EXT2_HAVE_ASM_BITOPS_ + +_INLINE_ int ext2fs_set_bit(unsigned int nr,void * addr) +{ + char retval; + + __asm__ __volatile__ ("bfset %2@{%1:#1}; sne %0" + : "=d" (retval) : "d" (nr^7), "a" (addr)); + + return retval; +} + +_INLINE_ int ext2fs_clear_bit(unsigned int nr, void * addr) +{ + char retval; + + __asm__ __volatile__ ("bfclr %2@{%1:#1}; sne %0" + : "=d" (retval) : "d" (nr^7), "a" (addr)); + + return retval; +} + +_INLINE_ int ext2fs_test_bit(unsigned int nr, const void * addr) +{ + char retval; + + __asm__ __volatile__ ("bftst %2@{%1:#1}; sne %0" + : "=d" (retval) : "d" (nr^7), "a" (addr)); + + return retval; +} + +#endif /* __mc68000__ */ + + +#if !defined(_EXT2_HAVE_ASM_SWAB_) + +_INLINE_ __u16 ext2fs_swab16(__u16 val) +{ + return (val >> 8) | (val << 8); +} + +_INLINE_ __u32 ext2fs_swab32(__u32 val) +{ + return ((val>>24) | ((val>>8)&0xFF00) | + ((val<<8)&0xFF0000) | (val<<24)); +} + +#endif /* !_EXT2_HAVE_ASM_SWAB */ + +_INLINE_ __u64 ext2fs_swab64(__u64 val) +{ + return (ext2fs_swab32(val >> 32) | + (((__u64)ext2fs_swab32(val & 0xFFFFFFFFUL)) << 32)); +} + +_INLINE_ int ext2fs_mark_block_bitmap(ext2fs_block_bitmap bitmap, + blk_t block) +{ + return ext2fs_mark_generic_bitmap((ext2fs_generic_bitmap) bitmap, + block); +} + +_INLINE_ int ext2fs_unmark_block_bitmap(ext2fs_block_bitmap bitmap, + blk_t block) +{ + return ext2fs_unmark_generic_bitmap((ext2fs_generic_bitmap) bitmap, + block); +} + +_INLINE_ int ext2fs_test_block_bitmap(ext2fs_block_bitmap bitmap, + blk_t block) +{ + return ext2fs_test_generic_bitmap((ext2fs_generic_bitmap) bitmap, + block); +} + +_INLINE_ int ext2fs_mark_inode_bitmap(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + return ext2fs_mark_generic_bitmap((ext2fs_generic_bitmap) bitmap, + inode); +} + +_INLINE_ int ext2fs_unmark_inode_bitmap(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + return ext2fs_unmark_generic_bitmap((ext2fs_generic_bitmap) bitmap, + inode); +} + +_INLINE_ int ext2fs_test_inode_bitmap(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + return ext2fs_test_generic_bitmap((ext2fs_generic_bitmap) bitmap, + inode); +} + +_INLINE_ void ext2fs_fast_mark_block_bitmap(ext2fs_block_bitmap bitmap, + blk_t block) +{ + ext2fs_mark_generic_bitmap((ext2fs_generic_bitmap) bitmap, block); +} + +_INLINE_ void ext2fs_fast_unmark_block_bitmap(ext2fs_block_bitmap bitmap, + blk_t block) +{ + ext2fs_unmark_generic_bitmap((ext2fs_generic_bitmap) bitmap, block); +} + +_INLINE_ int ext2fs_fast_test_block_bitmap(ext2fs_block_bitmap bitmap, + blk_t block) +{ + return ext2fs_test_generic_bitmap((ext2fs_generic_bitmap) bitmap, + block); +} + +_INLINE_ void ext2fs_fast_mark_inode_bitmap(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + ext2fs_mark_generic_bitmap((ext2fs_generic_bitmap) bitmap, inode); +} + +_INLINE_ void ext2fs_fast_unmark_inode_bitmap(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + ext2fs_unmark_generic_bitmap((ext2fs_generic_bitmap) bitmap, inode); +} + +_INLINE_ int ext2fs_fast_test_inode_bitmap(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + return ext2fs_test_generic_bitmap((ext2fs_generic_bitmap) bitmap, + inode); +} + +_INLINE_ blk_t ext2fs_get_block_bitmap_start(ext2fs_block_bitmap bitmap) +{ + return ext2fs_get_generic_bitmap_start((ext2fs_generic_bitmap) bitmap); +} + +_INLINE_ ext2_ino_t ext2fs_get_inode_bitmap_start(ext2fs_inode_bitmap bitmap) +{ + return ext2fs_get_generic_bitmap_start((ext2fs_generic_bitmap) bitmap); +} + +_INLINE_ blk_t ext2fs_get_block_bitmap_end(ext2fs_block_bitmap bitmap) +{ + return ext2fs_get_generic_bitmap_end((ext2fs_generic_bitmap) bitmap); +} + +_INLINE_ ext2_ino_t ext2fs_get_inode_bitmap_end(ext2fs_inode_bitmap bitmap) +{ + return ext2fs_get_generic_bitmap_end((ext2fs_generic_bitmap) bitmap); +} + +_INLINE_ int ext2fs_fast_test_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num) +{ + return ext2fs_test_block_bitmap_range(bitmap, block, num); +} + +_INLINE_ void ext2fs_fast_mark_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num) +{ + ext2fs_mark_block_bitmap_range(bitmap, block, num); +} + +_INLINE_ void ext2fs_fast_unmark_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num) +{ + ext2fs_unmark_block_bitmap_range(bitmap, block, num); +} + +/* 64-bit versions */ + +_INLINE_ int ext2fs_mark_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block) +{ + return ext2fs_mark_generic_bmap((ext2fs_generic_bitmap) bitmap, + block); +} + +_INLINE_ int ext2fs_unmark_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block) +{ + return ext2fs_unmark_generic_bmap((ext2fs_generic_bitmap) bitmap, block); +} + +_INLINE_ int ext2fs_test_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block) +{ + return ext2fs_test_generic_bmap((ext2fs_generic_bitmap) bitmap, + block); +} + +_INLINE_ int ext2fs_mark_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + return ext2fs_mark_generic_bmap((ext2fs_generic_bitmap) bitmap, + inode); +} + +_INLINE_ int ext2fs_unmark_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + return ext2fs_unmark_generic_bmap((ext2fs_generic_bitmap) bitmap, + inode); +} + +_INLINE_ int ext2fs_test_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + return ext2fs_test_generic_bmap((ext2fs_generic_bitmap) bitmap, + inode); +} + +_INLINE_ void ext2fs_fast_mark_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block) +{ + ext2fs_mark_generic_bmap((ext2fs_generic_bitmap) bitmap, block); +} + +_INLINE_ void ext2fs_fast_unmark_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block) +{ + ext2fs_unmark_generic_bmap((ext2fs_generic_bitmap) bitmap, block); +} + +_INLINE_ int ext2fs_fast_test_block_bitmap2(ext2fs_block_bitmap bitmap, + blk64_t block) +{ + return ext2fs_test_generic_bmap((ext2fs_generic_bitmap) bitmap, + block); +} + +_INLINE_ void ext2fs_fast_mark_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + ext2fs_mark_generic_bmap((ext2fs_generic_bitmap) bitmap, inode); +} + +_INLINE_ void ext2fs_fast_unmark_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + ext2fs_unmark_generic_bmap((ext2fs_generic_bitmap) bitmap, inode); +} + +_INLINE_ int ext2fs_fast_test_inode_bitmap2(ext2fs_inode_bitmap bitmap, + ext2_ino_t inode) +{ + return ext2fs_test_generic_bmap((ext2fs_generic_bitmap) bitmap, + inode); +} + +_INLINE_ blk64_t ext2fs_get_block_bitmap_start2(ext2fs_block_bitmap bitmap) +{ + return ext2fs_get_generic_bmap_start((ext2fs_generic_bitmap) bitmap); +} + +_INLINE_ ext2_ino_t ext2fs_get_inode_bitmap_start2(ext2fs_inode_bitmap bitmap) +{ + return ext2fs_get_generic_bmap_start((ext2fs_generic_bitmap) bitmap); +} + +_INLINE_ blk64_t ext2fs_get_block_bitmap_end2(ext2fs_block_bitmap bitmap) +{ + return ext2fs_get_generic_bmap_end((ext2fs_generic_bitmap) bitmap); +} + +_INLINE_ ext2_ino_t ext2fs_get_inode_bitmap_end2(ext2fs_inode_bitmap bitmap) +{ + return ext2fs_get_generic_bmap_end((ext2fs_generic_bitmap) bitmap); +} + +_INLINE_ int ext2fs_fast_test_block_bitmap_range2(ext2fs_block_bitmap bitmap, + blk64_t block, + unsigned int num) +{ + return ext2fs_test_block_bitmap_range2(bitmap, block, num); +} + +_INLINE_ void ext2fs_fast_mark_block_bitmap_range2(ext2fs_block_bitmap bitmap, + blk64_t block, + unsigned int num) +{ + ext2fs_mark_block_bitmap_range2(bitmap, block, num); +} + +_INLINE_ void ext2fs_fast_unmark_block_bitmap_range2(ext2fs_block_bitmap bitmap, + blk64_t block, + unsigned int num) +{ + ext2fs_unmark_block_bitmap_range2(bitmap, block, num); +} + +#undef _INLINE_ +#endif + +#endif diff --git a/portlibs/sources/libext2fs/source/blkmap64_ba.c b/portlibs/sources/libext2fs/source/blkmap64_ba.c new file mode 100644 index 00000000..395aba97 --- /dev/null +++ b/portlibs/sources/libext2fs/source/blkmap64_ba.c @@ -0,0 +1,327 @@ +/* + * blkmap64_ba.c --- Simple bitarray implementation for bitmaps + * + * Copyright (C) 2008 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Public + * License. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fsP.h" +#include "bmap64.h" + +/* + * Private data for bit array implementation of bitmap ops. + * Currently, this is just a pointer to our big flat hunk of memory, + * exactly equivalent to the old-skool char * bitmap member. + */ + +struct ext2fs_ba_private_struct { + char *bitarray; +}; + +typedef struct ext2fs_ba_private_struct *ext2fs_ba_private; + +static errcode_t ba_alloc_private_data (ext2fs_generic_bitmap bitmap) +{ + ext2fs_ba_private bp; + errcode_t retval; + size_t size; + + /* + * Since we only have the one pointer, we could just shove our + * private data in the void *private field itself, but then + * we'd have to do a fair bit of rewriting if we ever added a + * field. I'm agnostic. + */ + retval = ext2fs_get_mem(sizeof (ext2fs_ba_private), &bp); + if (retval) + return retval; + + size = (size_t) (((bitmap->real_end - bitmap->start) / 8) + 1); + + retval = ext2fs_get_mem(size, &bp->bitarray); + if (retval) { + ext2fs_free_mem(&bp); + bp = 0; + return retval; + } + bitmap->private = (void *) bp; + return 0; +} + +static errcode_t ba_new_bmap(ext2_filsys fs EXT2FS_ATTR((unused)), + ext2fs_generic_bitmap bitmap) +{ + ext2fs_ba_private bp; + errcode_t retval; + size_t size; + + retval = ba_alloc_private_data (bitmap); + if (retval) + return retval; + + bp = (ext2fs_ba_private) bitmap->private; + size = (size_t) (((bitmap->real_end - bitmap->start) / 8) + 1); + memset(bp->bitarray, 0, size); + + return 0; +} + +static void ba_free_bmap(ext2fs_generic_bitmap bitmap) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bitmap->private; + + if (!bp) + return; + + if (bp->bitarray) { + ext2fs_free_mem (&bp->bitarray); + bp->bitarray = 0; + } + ext2fs_free_mem (&bp); + bp = 0; +} + +static errcode_t ba_copy_bmap(ext2fs_generic_bitmap src, + ext2fs_generic_bitmap dest) +{ + ext2fs_ba_private src_bp = (ext2fs_ba_private) src->private; + ext2fs_ba_private dest_bp; + errcode_t retval; + size_t size; + + retval = ba_alloc_private_data (dest); + if (retval) + return retval; + + dest_bp = (ext2fs_ba_private) dest->private; + + size = (size_t) (((src->real_end - src->start) / 8) + 1); + memcpy (dest_bp->bitarray, src_bp->bitarray, size); + + return 0; +} + +static errcode_t ba_resize_bmap(ext2fs_generic_bitmap bmap, + __u64 new_end, __u64 new_real_end) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bmap->private; + errcode_t retval; + size_t size, new_size; + __u64 bitno; + + /* + * If we're expanding the bitmap, make sure all of the new + * parts of the bitmap are zero. + */ + if (new_end > bmap->end) { + bitno = bmap->real_end; + if (bitno > new_end) + bitno = new_end; + for (; bitno > bmap->end; bitno--) + ext2fs_clear_bit64(bitno - bmap->start, bp->bitarray); + } + if (new_real_end == bmap->real_end) { + bmap->end = new_end; + return 0; + } + + size = ((bmap->real_end - bmap->start) / 8) + 1; + new_size = ((new_real_end - bmap->start) / 8) + 1; + + if (size != new_size) { + retval = ext2fs_resize_mem(size, new_size, &bp->bitarray); + if (retval) + return retval; + } + if (new_size > size) + memset(bp->bitarray + size, 0, new_size - size); + + bmap->end = new_end; + bmap->real_end = new_real_end; + return 0; + +} + +static int ba_mark_bmap(ext2fs_generic_bitmap bitmap, __u64 arg) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bitmap->private; + blk64_t bitno = (blk64_t) arg; + + return ext2fs_set_bit64(bitno - bitmap->start, bp->bitarray); +} + +static int ba_unmark_bmap(ext2fs_generic_bitmap bitmap, __u64 arg) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bitmap->private; + blk64_t bitno = (blk64_t) arg; + + return ext2fs_clear_bit64(bitno - bitmap->start, bp->bitarray); +} + +static int ba_test_bmap(ext2fs_generic_bitmap bitmap, __u64 arg) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bitmap->private; + blk64_t bitno = (blk64_t) arg; + + return ext2fs_test_bit64(bitno - bitmap->start, bp->bitarray); +} + +static void ba_mark_bmap_extent(ext2fs_generic_bitmap bitmap, __u64 arg, + unsigned int num) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bitmap->private; + blk64_t bitno = (blk64_t) arg; + unsigned int i; + + for (i = 0; i < num; i++) + ext2fs_fast_set_bit64(bitno + i - bitmap->start, bp->bitarray); +} + +static void ba_unmark_bmap_extent(ext2fs_generic_bitmap bitmap, __u64 arg, + unsigned int num) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bitmap->private; + blk64_t bitno = (blk64_t) arg; + unsigned int i; + + for (i = 0; i < num; i++) + ext2fs_fast_clear_bit64(bitno + i - bitmap->start, bp->bitarray); +} + +static int ba_test_clear_bmap_extent(ext2fs_generic_bitmap bitmap, + __u64 start, unsigned int len) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bitmap->private; + __u64 start_byte, len_byte = len >> 3; + unsigned int start_bit, len_bit = len % 8; + unsigned int first_bit = 0; + unsigned int last_bit = 0; + int mark_count = 0; + int mark_bit = 0; + int i; + const char *ADDR; + + ADDR = bp->bitarray; + start -= bitmap->start; + start_byte = start >> 3; + start_bit = start % 8; + + if (start_bit != 0) { + /* + * The compared start block number or start inode number + * is not the first bit in a byte. + */ + mark_count = 8 - start_bit; + if (len < 8 - start_bit) { + mark_count = (int)len; + mark_bit = len + start_bit - 1; + } else + mark_bit = 7; + + for (i = mark_count; i > 0; i--, mark_bit--) + first_bit |= 1 << mark_bit; + + /* + * Compare blocks or inodes in the first byte. + * If there is any marked bit, this function returns 0. + */ + if (first_bit & ADDR[start_byte]) + return 0; + else if (len <= 8 - start_bit) + return 1; + + start_byte++; + len_bit = (len - mark_count) % 8; + len_byte = (len - mark_count) >> 3; + } + + /* + * The compared start block number or start inode number is + * the first bit in a byte. + */ + if (len_bit != 0) { + /* + * The compared end block number or end inode number is + * not the last bit in a byte. + */ + for (mark_bit = len_bit - 1; mark_bit >= 0; mark_bit--) + last_bit |= 1 << mark_bit; + + /* + * Compare blocks or inodes in the last byte. + * If there is any marked bit, this function returns 0. + */ + if (last_bit & ADDR[start_byte + len_byte]) + return 0; + else if (len_byte == 0) + return 1; + } + + /* Check whether all bytes are 0 */ + return ext2fs_mem_is_zero(ADDR + start_byte, len_byte); +} + + +static errcode_t ba_set_bmap_range(ext2fs_generic_bitmap bitmap, + __u64 start, size_t num, void *in) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bitmap->private; + + memcpy (bp->bitarray + (start >> 3), in, (num + 7) >> 3); + + return 0; +} + +static errcode_t ba_get_bmap_range(ext2fs_generic_bitmap bitmap, + __u64 start, size_t num, void *out) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bitmap->private; + + memcpy (out, bp->bitarray + (start >> 3), (num + 7) >> 3); + + return 0; +} + +static void ba_clear_bmap(ext2fs_generic_bitmap bitmap) +{ + ext2fs_ba_private bp = (ext2fs_ba_private) bitmap->private; + + memset(bp->bitarray, 0, + (size_t) (((bitmap->real_end - bitmap->start) / 8) + 1)); +} + +struct ext2_bitmap_ops ext2fs_blkmap64_bitarray = { + .type = EXT2FS_BMAP64_BITARRAY, + .new_bmap = ba_new_bmap, + .free_bmap = ba_free_bmap, + .copy_bmap = ba_copy_bmap, + .resize_bmap = ba_resize_bmap, + .mark_bmap = ba_mark_bmap, + .unmark_bmap = ba_unmark_bmap, + .test_bmap = ba_test_bmap, + .test_clear_bmap_extent = ba_test_clear_bmap_extent, + .mark_bmap_extent = ba_mark_bmap_extent, + .unmark_bmap_extent = ba_unmark_bmap_extent, + .set_bmap_range = ba_set_bmap_range, + .get_bmap_range = ba_get_bmap_range, + .clear_bmap = ba_clear_bmap, +}; diff --git a/portlibs/sources/libext2fs/source/blknum.c b/portlibs/sources/libext2fs/source/blknum.c new file mode 100644 index 00000000..b3e6dcad --- /dev/null +++ b/portlibs/sources/libext2fs/source/blknum.c @@ -0,0 +1,477 @@ +/* + * blknum.c --- Functions to handle blk64_t and high/low 64-bit block + * number. + * + * Copyright IBM Corporation, 2007 + * Author Jose R. Santos <jrs@us.ibm.com> + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Public + * License. + * %End-Header% + */ + +#include "ext2fs.h" + +/* + * Return the group # of a block + */ +dgrp_t ext2fs_group_of_blk2(ext2_filsys fs, blk64_t blk) +{ + return (blk - fs->super->s_first_data_block) / + fs->super->s_blocks_per_group; +} + +/* + * Return the first block (inclusive) in a group + */ +blk64_t ext2fs_group_first_block2(ext2_filsys fs, dgrp_t group) +{ + return fs->super->s_first_data_block + + ((blk64_t)group * fs->super->s_blocks_per_group); +} + +/* + * Return the last block (inclusive) in a group + */ +blk64_t ext2fs_group_last_block2(ext2_filsys fs, dgrp_t group) +{ + return (group == fs->group_desc_count - 1 ? + ext2fs_blocks_count(fs->super) - 1 : + ext2fs_group_first_block2(fs, group) + + (fs->super->s_blocks_per_group - 1)); +} + +/* + * Return the inode data block count + */ +blk64_t ext2fs_inode_data_blocks2(ext2_filsys fs, + struct ext2_inode *inode) +{ + return (inode->i_blocks | + ((fs->super->s_feature_ro_compat & + EXT4_FEATURE_RO_COMPAT_HUGE_FILE) ? + (__u64) inode->osd2.linux2.l_i_blocks_hi << 32 : 0)) - + (inode->i_file_acl ? fs->blocksize >> 9 : 0); +} + +/* + * Return the inode i_blocks count + */ +blk64_t ext2fs_inode_i_blocks(ext2_filsys fs, + struct ext2_inode *inode) +{ + return (inode->i_blocks | + ((fs->super->s_feature_ro_compat & + EXT4_FEATURE_RO_COMPAT_HUGE_FILE) ? + (__u64)inode->osd2.linux2.l_i_blocks_hi << 32 : 0)); +} + +/* + * Return the fs block count + */ +blk64_t ext2fs_blocks_count(struct ext2_super_block *super) +{ + return super->s_blocks_count | + (super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT ? + (__u64) super->s_blocks_count_hi << 32 : 0); +} + +/* + * Set the fs block count + */ +void ext2fs_blocks_count_set(struct ext2_super_block *super, blk64_t blk) +{ + super->s_blocks_count = blk; + if (super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + super->s_blocks_count_hi = (__u64) blk >> 32; +} + +/* + * Add to the current fs block count + */ +void ext2fs_blocks_count_add(struct ext2_super_block *super, blk64_t blk) +{ + blk64_t tmp; + tmp = ext2fs_blocks_count(super) + blk; + ext2fs_blocks_count_set(super, tmp); +} + +/* + * Return the fs reserved block count + */ +blk64_t ext2fs_r_blocks_count(struct ext2_super_block *super) +{ + return super->s_r_blocks_count | + (super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT ? + (__u64) super->s_r_blocks_count_hi << 32 : 0); +} + +/* + * Set the fs reserved block count + */ +void ext2fs_r_blocks_count_set(struct ext2_super_block *super, blk64_t blk) +{ + super->s_r_blocks_count = blk; + if (super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + super->s_r_blocks_count_hi = (__u64) blk >> 32; +} + +/* + * Add to the current reserved fs block count + */ +void ext2fs_r_blocks_count_add(struct ext2_super_block *super, blk64_t blk) +{ + blk64_t tmp; + tmp = ext2fs_r_blocks_count(super) + blk; + ext2fs_r_blocks_count_set(super, tmp); +} + +/* + * Return the fs free block count + */ +blk64_t ext2fs_free_blocks_count(struct ext2_super_block *super) +{ + return super->s_free_blocks_count | + (super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT ? + (__u64) super->s_free_blocks_hi << 32 : 0); +} + +/* + * Set the fs free block count + */ +void ext2fs_free_blocks_count_set(struct ext2_super_block *super, blk64_t blk) +{ + super->s_free_blocks_count = blk; + if (super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + super->s_free_blocks_hi = (__u64) blk >> 32; +} + +/* + * Add to the current free fs block count + */ +void ext2fs_free_blocks_count_add(struct ext2_super_block *super, blk64_t blk) +{ + blk64_t tmp; + tmp = ext2fs_free_blocks_count(super) + blk; + ext2fs_free_blocks_count_set(super, tmp); +} + +/* + * Get a pointer to a block group descriptor. We need the explicit + * pointer to the group desc for code that swaps block group + * descriptors before writing them out, as it wants to make a copy and + * do the swap there. + */ +struct ext2_group_desc *ext2fs_group_desc(ext2_filsys fs, + struct opaque_ext2_group_desc *gdp, + dgrp_t group) +{ + if (fs->super->s_desc_size >= EXT2_MIN_DESC_SIZE_64BIT) + return (struct ext2_group_desc *) + ((struct ext4_group_desc *) gdp + group); + else + return (struct ext2_group_desc *) gdp + group; +} + +/* Do the same but as an ext4 group desc for internal use here */ +static struct ext4_group_desc *ext4fs_group_desc(ext2_filsys fs, + struct opaque_ext2_group_desc *gdp, + dgrp_t group) +{ + return (struct ext4_group_desc *)ext2fs_group_desc(fs, gdp, group); +} + +/* + * Return the block bitmap block of a group + */ +blk64_t ext2fs_block_bitmap_loc(ext2_filsys fs, dgrp_t group) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + return gdp->bg_block_bitmap | + (fs->super->s_feature_incompat + & EXT4_FEATURE_INCOMPAT_64BIT ? + (__u64)gdp->bg_block_bitmap_hi << 32 : 0); +} + +/* + * Set the block bitmap block of a group + */ +void ext2fs_block_bitmap_loc_set(ext2_filsys fs, dgrp_t group, blk64_t blk) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_block_bitmap = blk; + if (fs->super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + gdp->bg_block_bitmap_hi = (__u64) blk >> 32; +} + +/* + * Return the inode bitmap block of a group + */ +blk64_t ext2fs_inode_bitmap_loc(ext2_filsys fs, dgrp_t group) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + return gdp->bg_inode_bitmap | + (fs->super->s_feature_incompat + & EXT4_FEATURE_INCOMPAT_64BIT ? + (__u64) gdp->bg_inode_bitmap_hi << 32 : 0); +} + +/* + * Set the inode bitmap block of a group + */ +void ext2fs_inode_bitmap_loc_set(ext2_filsys fs, dgrp_t group, blk64_t blk) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_inode_bitmap = blk; + if (fs->super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + gdp->bg_inode_bitmap_hi = (__u64) blk >> 32; +} + +/* + * Return the inode table block of a group + */ +blk64_t ext2fs_inode_table_loc(ext2_filsys fs, dgrp_t group) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + return gdp->bg_inode_table | + (fs->super->s_feature_incompat + & EXT4_FEATURE_INCOMPAT_64BIT ? + (__u64) gdp->bg_inode_table_hi << 32 : 0); +} + +/* + * Set the inode table block of a group + */ +void ext2fs_inode_table_loc_set(ext2_filsys fs, dgrp_t group, blk64_t blk) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_inode_table = blk; + if (fs->super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + gdp->bg_inode_table_hi = (__u64) blk >> 32; +} + +/* + * Return the free blocks count of a group + */ +__u32 ext2fs_bg_free_blocks_count(ext2_filsys fs, dgrp_t group) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + return gdp->bg_free_blocks_count | + (fs->super->s_feature_incompat + & EXT4_FEATURE_INCOMPAT_64BIT ? + (__u32) gdp->bg_free_blocks_count_hi << 16 : 0); +} + +/* + * Set the free blocks count of a group + */ +void ext2fs_bg_free_blocks_count_set(ext2_filsys fs, dgrp_t group, __u32 n) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_free_blocks_count = n; + + if (fs->super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + gdp->bg_free_blocks_count_hi = (__u32) n >> 16; +} + +/* + * Return the free inodes count of a group + */ +__u32 ext2fs_bg_free_inodes_count(ext2_filsys fs, dgrp_t group) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + return gdp->bg_free_inodes_count | + (fs->super->s_feature_incompat + & EXT4_FEATURE_INCOMPAT_64BIT ? + (__u32) gdp->bg_free_inodes_count_hi << 16 : 0); +} + +/* + * Set the free inodes count of a group + */ +void ext2fs_bg_free_inodes_count_set(ext2_filsys fs, dgrp_t group, __u32 n) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_free_inodes_count = n; + if (fs->super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + gdp->bg_free_inodes_count_hi = (__u32) n >> 16; +} + +/* + * Return the used dirs count of a group + */ +__u32 ext2fs_bg_used_dirs_count(ext2_filsys fs, dgrp_t group) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + return gdp->bg_used_dirs_count | + (fs->super->s_feature_incompat + & EXT4_FEATURE_INCOMPAT_64BIT ? + (__u32) gdp->bg_used_dirs_count_hi << 16 : 0); +} + +/* + * Set the used dirs count of a group + */ +void ext2fs_bg_used_dirs_count_set(ext2_filsys fs, dgrp_t group, __u32 n) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_used_dirs_count = n; + if (fs->super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + gdp->bg_used_dirs_count_hi = (__u32) n >> 16; +} + +/* + * Return the unused inodes count of a group + */ +__u32 ext2fs_bg_itable_unused(ext2_filsys fs, dgrp_t group) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + return gdp->bg_itable_unused | + (fs->super->s_feature_incompat + & EXT4_FEATURE_INCOMPAT_64BIT ? + (__u32) gdp->bg_itable_unused_hi << 16 : 0); +} + +/* + * Set the unused inodes count of a group + */ +void ext2fs_bg_itable_unused_set(ext2_filsys fs, dgrp_t group, __u32 n) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_itable_unused = n; + if (fs->super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + gdp->bg_itable_unused_hi = (__u32) n >> 16; +} + +/* + * Get the flags for this block group + */ +__u16 ext2fs_bg_flags(ext2_filsys fs, dgrp_t group) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + return gdp->bg_flags; +} + +/* + * Zero out the flags for this block group + */ +void ext2fs_bg_flags_zap(ext2_filsys fs, dgrp_t group) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_flags = 0; + return; +} + +/* + * Get the value of a particular flag for this block group + */ +int ext2fs_bg_flags_test(ext2_filsys fs, dgrp_t group, __u16 bg_flag) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + return gdp->bg_flags & bg_flag; +} + +/* + * Set a flag or set of flags for this block group + */ +void ext2fs_bg_flags_set(ext2_filsys fs, dgrp_t group, __u16 bg_flags) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_flags |= bg_flags; + return; +} + +/* + * Clear a flag or set of flags for this block group + */ +void ext2fs_bg_flags_clear(ext2_filsys fs, dgrp_t group, __u16 bg_flags) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_flags &= ~bg_flags; + return; +} + +/* + * Get the checksum for this block group + */ +__u16 ext2fs_bg_checksum(ext2_filsys fs, dgrp_t group) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + return gdp->bg_checksum; +} + +/* + * Set the checksum for this block group to a previously calculated value + */ +void ext2fs_bg_checksum_set(ext2_filsys fs, dgrp_t group, __u16 checksum) +{ + struct ext4_group_desc *gdp; + + gdp = ext4fs_group_desc(fs, fs->group_desc, group); + gdp->bg_checksum = checksum; + return; +} + +/* + * Get the acl block of a file + * + * XXX Ignoring 64-bit file system flag - most places where this is + * called don't have access to the fs struct, and the high bits should + * be 0 in the non-64-bit case anyway. + */ +blk64_t ext2fs_file_acl_block(const struct ext2_inode *inode) +{ + return (inode->i_file_acl | + (__u64) inode->osd2.linux2.l_i_file_acl_high << 32); +} + +/* + * Set the acl block of a file + */ +void ext2fs_file_acl_block_set(struct ext2_inode *inode, blk64_t blk) +{ + inode->i_file_acl = blk; + inode->osd2.linux2.l_i_file_acl_high = (__u64) blk >> 32; +} + diff --git a/portlibs/sources/libext2fs/source/block.c b/portlibs/sources/libext2fs/source/block.c new file mode 100644 index 00000000..0e4ec775 --- /dev/null +++ b/portlibs/sources/libext2fs/source/block.c @@ -0,0 +1,623 @@ +/* + * block.c --- iterate over all blocks in an inode + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +struct block_context { + ext2_filsys fs; + int (*func)(ext2_filsys fs, + blk64_t *blocknr, + e2_blkcnt_t bcount, + blk64_t ref_blk, + int ref_offset, + void *priv_data); + e2_blkcnt_t bcount; + int bsize; + int flags; + errcode_t errcode; + char *ind_buf; + char *dind_buf; + char *tind_buf; + void *priv_data; +}; + +#define check_for_ro_violation_return(ctx, ret) \ + do { \ + if (((ctx)->flags & BLOCK_FLAG_READ_ONLY) && \ + ((ret) & BLOCK_CHANGED)) { \ + (ctx)->errcode = EXT2_ET_RO_BLOCK_ITERATE; \ + ret |= BLOCK_ABORT | BLOCK_ERROR; \ + return ret; \ + } \ + } while (0) + +#define check_for_ro_violation_goto(ctx, ret, label) \ + do { \ + if (((ctx)->flags & BLOCK_FLAG_READ_ONLY) && \ + ((ret) & BLOCK_CHANGED)) { \ + (ctx)->errcode = EXT2_ET_RO_BLOCK_ITERATE; \ + ret |= BLOCK_ABORT | BLOCK_ERROR; \ + goto label; \ + } \ + } while (0) + +static int block_iterate_ind(blk_t *ind_block, blk_t ref_block, + int ref_offset, struct block_context *ctx) +{ + int ret = 0, changed = 0; + int i, flags, limit, offset; + blk_t *block_nr; + blk64_t blk64; + + limit = ctx->fs->blocksize >> 2; + if (!(ctx->flags & BLOCK_FLAG_DEPTH_TRAVERSE) && + !(ctx->flags & BLOCK_FLAG_DATA_ONLY)) { + blk64 = *ind_block; + ret = (*ctx->func)(ctx->fs, &blk64, + BLOCK_COUNT_IND, ref_block, + ref_offset, ctx->priv_data); + *ind_block = blk64; + } + check_for_ro_violation_return(ctx, ret); + if (!*ind_block || (ret & BLOCK_ABORT)) { + ctx->bcount += limit; + return ret; + } + if (*ind_block >= ext2fs_blocks_count(ctx->fs->super) || + *ind_block < ctx->fs->super->s_first_data_block) { + ctx->errcode = EXT2_ET_BAD_IND_BLOCK; + ret |= BLOCK_ERROR; + return ret; + } + ctx->errcode = ext2fs_read_ind_block(ctx->fs, *ind_block, + ctx->ind_buf); + if (ctx->errcode) { + ret |= BLOCK_ERROR; + return ret; + } + + block_nr = (blk_t *) ctx->ind_buf; + offset = 0; + if (ctx->flags & BLOCK_FLAG_APPEND) { + for (i = 0; i < limit; i++, ctx->bcount++, block_nr++) { + blk64 = *block_nr; + flags = (*ctx->func)(ctx->fs, &blk64, ctx->bcount, + *ind_block, offset, + ctx->priv_data); + *block_nr = blk64; + changed |= flags; + if (flags & BLOCK_ABORT) { + ret |= BLOCK_ABORT; + break; + } + offset += sizeof(blk_t); + } + } else { + for (i = 0; i < limit; i++, ctx->bcount++, block_nr++) { + if (*block_nr == 0) + goto skip_sparse; + blk64 = *block_nr; + flags = (*ctx->func)(ctx->fs, &blk64, ctx->bcount, + *ind_block, offset, + ctx->priv_data); + *block_nr = blk64; + changed |= flags; + if (flags & BLOCK_ABORT) { + ret |= BLOCK_ABORT; + break; + } + skip_sparse: + offset += sizeof(blk_t); + } + } + check_for_ro_violation_return(ctx, changed); + if (changed & BLOCK_CHANGED) { + ctx->errcode = ext2fs_write_ind_block(ctx->fs, *ind_block, + ctx->ind_buf); + if (ctx->errcode) + ret |= BLOCK_ERROR | BLOCK_ABORT; + } + if ((ctx->flags & BLOCK_FLAG_DEPTH_TRAVERSE) && + !(ctx->flags & BLOCK_FLAG_DATA_ONLY) && + !(ret & BLOCK_ABORT)) { + blk64 = *ind_block; + ret |= (*ctx->func)(ctx->fs, &blk64, + BLOCK_COUNT_IND, ref_block, + ref_offset, ctx->priv_data); + *ind_block = blk64; + } + check_for_ro_violation_return(ctx, ret); + return ret; +} + +static int block_iterate_dind(blk_t *dind_block, blk_t ref_block, + int ref_offset, struct block_context *ctx) +{ + int ret = 0, changed = 0; + int i, flags, limit, offset; + blk_t *block_nr; + blk64_t blk64; + + limit = ctx->fs->blocksize >> 2; + if (!(ctx->flags & (BLOCK_FLAG_DEPTH_TRAVERSE | + BLOCK_FLAG_DATA_ONLY))) { + blk64 = *dind_block; + ret = (*ctx->func)(ctx->fs, &blk64, + BLOCK_COUNT_DIND, ref_block, + ref_offset, ctx->priv_data); + *dind_block = blk64; + } + check_for_ro_violation_return(ctx, ret); + if (!*dind_block || (ret & BLOCK_ABORT)) { + ctx->bcount += limit*limit; + return ret; + } + if (*dind_block >= ext2fs_blocks_count(ctx->fs->super) || + *dind_block < ctx->fs->super->s_first_data_block) { + ctx->errcode = EXT2_ET_BAD_DIND_BLOCK; + ret |= BLOCK_ERROR; + return ret; + } + ctx->errcode = ext2fs_read_ind_block(ctx->fs, *dind_block, + ctx->dind_buf); + if (ctx->errcode) { + ret |= BLOCK_ERROR; + return ret; + } + + block_nr = (blk_t *) ctx->dind_buf; + offset = 0; + if (ctx->flags & BLOCK_FLAG_APPEND) { + for (i = 0; i < limit; i++, block_nr++) { + flags = block_iterate_ind(block_nr, + *dind_block, offset, + ctx); + changed |= flags; + if (flags & (BLOCK_ABORT | BLOCK_ERROR)) { + ret |= flags & (BLOCK_ABORT | BLOCK_ERROR); + break; + } + offset += sizeof(blk_t); + } + } else { + for (i = 0; i < limit; i++, block_nr++) { + if (*block_nr == 0) { + ctx->bcount += limit; + continue; + } + flags = block_iterate_ind(block_nr, + *dind_block, offset, + ctx); + changed |= flags; + if (flags & (BLOCK_ABORT | BLOCK_ERROR)) { + ret |= flags & (BLOCK_ABORT | BLOCK_ERROR); + break; + } + offset += sizeof(blk_t); + } + } + check_for_ro_violation_return(ctx, changed); + if (changed & BLOCK_CHANGED) { + ctx->errcode = ext2fs_write_ind_block(ctx->fs, *dind_block, + ctx->dind_buf); + if (ctx->errcode) + ret |= BLOCK_ERROR | BLOCK_ABORT; + } + if ((ctx->flags & BLOCK_FLAG_DEPTH_TRAVERSE) && + !(ctx->flags & BLOCK_FLAG_DATA_ONLY) && + !(ret & BLOCK_ABORT)) { + blk64 = *dind_block; + ret |= (*ctx->func)(ctx->fs, &blk64, + BLOCK_COUNT_DIND, ref_block, + ref_offset, ctx->priv_data); + *dind_block = blk64; + } + check_for_ro_violation_return(ctx, ret); + return ret; +} + +static int block_iterate_tind(blk_t *tind_block, blk_t ref_block, + int ref_offset, struct block_context *ctx) +{ + int ret = 0, changed = 0; + int i, flags, limit, offset; + blk_t *block_nr; + blk64_t blk64; + + limit = ctx->fs->blocksize >> 2; + if (!(ctx->flags & (BLOCK_FLAG_DEPTH_TRAVERSE | + BLOCK_FLAG_DATA_ONLY))) { + blk64 = *tind_block; + ret = (*ctx->func)(ctx->fs, &blk64, + BLOCK_COUNT_TIND, ref_block, + ref_offset, ctx->priv_data); + *tind_block = blk64; + } + check_for_ro_violation_return(ctx, ret); + if (!*tind_block || (ret & BLOCK_ABORT)) { + ctx->bcount += limit*limit*limit; + return ret; + } + if (*tind_block >= ext2fs_blocks_count(ctx->fs->super) || + *tind_block < ctx->fs->super->s_first_data_block) { + ctx->errcode = EXT2_ET_BAD_TIND_BLOCK; + ret |= BLOCK_ERROR; + return ret; + } + ctx->errcode = ext2fs_read_ind_block(ctx->fs, *tind_block, + ctx->tind_buf); + if (ctx->errcode) { + ret |= BLOCK_ERROR; + return ret; + } + + block_nr = (blk_t *) ctx->tind_buf; + offset = 0; + if (ctx->flags & BLOCK_FLAG_APPEND) { + for (i = 0; i < limit; i++, block_nr++) { + flags = block_iterate_dind(block_nr, + *tind_block, + offset, ctx); + changed |= flags; + if (flags & (BLOCK_ABORT | BLOCK_ERROR)) { + ret |= flags & (BLOCK_ABORT | BLOCK_ERROR); + break; + } + offset += sizeof(blk_t); + } + } else { + for (i = 0; i < limit; i++, block_nr++) { + if (*block_nr == 0) { + ctx->bcount += limit*limit; + continue; + } + flags = block_iterate_dind(block_nr, + *tind_block, + offset, ctx); + changed |= flags; + if (flags & (BLOCK_ABORT | BLOCK_ERROR)) { + ret |= flags & (BLOCK_ABORT | BLOCK_ERROR); + break; + } + offset += sizeof(blk_t); + } + } + check_for_ro_violation_return(ctx, changed); + if (changed & BLOCK_CHANGED) { + ctx->errcode = ext2fs_write_ind_block(ctx->fs, *tind_block, + ctx->tind_buf); + if (ctx->errcode) + ret |= BLOCK_ERROR | BLOCK_ABORT; + } + if ((ctx->flags & BLOCK_FLAG_DEPTH_TRAVERSE) && + !(ctx->flags & BLOCK_FLAG_DATA_ONLY) && + !(ret & BLOCK_ABORT)) { + blk64 = *tind_block; + ret |= (*ctx->func)(ctx->fs, &blk64, + BLOCK_COUNT_TIND, ref_block, + ref_offset, ctx->priv_data); + *tind_block = blk64; + } + check_for_ro_violation_return(ctx, ret); + return ret; +} + +errcode_t ext2fs_block_iterate3(ext2_filsys fs, + ext2_ino_t ino, + int flags, + char *block_buf, + int (*func)(ext2_filsys fs, + blk64_t *blocknr, + e2_blkcnt_t blockcnt, + blk64_t ref_blk, + int ref_offset, + void *priv_data), + void *priv_data) +{ + int i; + int r, ret = 0; + struct ext2_inode inode; + errcode_t retval; + struct block_context ctx; + int limit; + blk64_t blk64; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + ctx.errcode = ext2fs_read_inode(fs, ino, &inode); + if (ctx.errcode) + return ctx.errcode; + + /* + * Check to see if we need to limit large files + */ + if (flags & BLOCK_FLAG_NO_LARGE) { + if (!LINUX_S_ISDIR(inode.i_mode) && + (inode.i_size_high != 0)) + return EXT2_ET_FILE_TOO_BIG; + } + + limit = fs->blocksize >> 2; + + ctx.fs = fs; + ctx.func = func; + ctx.priv_data = priv_data; + ctx.flags = flags; + ctx.bcount = 0; + if (block_buf) { + ctx.ind_buf = block_buf; + } else { + retval = ext2fs_get_array(3, fs->blocksize, &ctx.ind_buf); + if (retval) + return retval; + } + ctx.dind_buf = ctx.ind_buf + fs->blocksize; + ctx.tind_buf = ctx.dind_buf + fs->blocksize; + + /* + * Iterate over the HURD translator block (if present) + */ + if ((fs->super->s_creator_os == EXT2_OS_HURD) && + !(flags & BLOCK_FLAG_DATA_ONLY)) { + if (inode.osd1.hurd1.h_i_translator) { + blk64 = inode.osd1.hurd1.h_i_translator; + ret |= (*ctx.func)(fs, &blk64, + BLOCK_COUNT_TRANSLATOR, + 0, 0, priv_data); + inode.osd1.hurd1.h_i_translator = (blk_t) blk64; + if (ret & BLOCK_ABORT) + goto abort_exit; + check_for_ro_violation_goto(&ctx, ret, abort_exit); + } + } + + if (inode.i_flags & EXT4_EXTENTS_FL) { + ext2_extent_handle_t handle; + struct ext2fs_extent extent; + e2_blkcnt_t blockcnt = 0; + blk64_t blk, new_blk; + int op = EXT2_EXTENT_ROOT; + int uninit; + unsigned int j; + + ctx.errcode = ext2fs_extent_open2(fs, ino, &inode, &handle); + if (ctx.errcode) + goto abort_exit; + + while (1) { + ctx.errcode = ext2fs_extent_get(handle, op, &extent); + if (ctx.errcode) { + if (ctx.errcode != EXT2_ET_EXTENT_NO_NEXT) + break; + ctx.errcode = 0; + if (!(flags & BLOCK_FLAG_APPEND)) + break; + next_block_set: + blk = 0; + r = (*ctx.func)(fs, &blk, blockcnt, + 0, 0, priv_data); + ret |= r; + check_for_ro_violation_goto(&ctx, ret, + extent_errout); + if (r & BLOCK_CHANGED) { + ctx.errcode = + ext2fs_extent_set_bmap(handle, + (blk64_t) blockcnt++, + (blk64_t) blk, 0); + if (ctx.errcode || (ret & BLOCK_ABORT)) + break; + if (blk) + goto next_block_set; + } + break; + } + + op = EXT2_EXTENT_NEXT; + blk = extent.e_pblk; + if (!(extent.e_flags & EXT2_EXTENT_FLAGS_LEAF)) { + if (ctx.flags & BLOCK_FLAG_DATA_ONLY) + continue; + if ((!(extent.e_flags & + EXT2_EXTENT_FLAGS_SECOND_VISIT) && + !(ctx.flags & BLOCK_FLAG_DEPTH_TRAVERSE)) || + ((extent.e_flags & + EXT2_EXTENT_FLAGS_SECOND_VISIT) && + (ctx.flags & BLOCK_FLAG_DEPTH_TRAVERSE))) { + ret |= (*ctx.func)(fs, &blk, + -1, 0, 0, priv_data); + if (ret & BLOCK_CHANGED) { + extent.e_pblk = blk; + ctx.errcode = + ext2fs_extent_replace(handle, 0, &extent); + if (ctx.errcode) + break; + } + } + continue; + } + uninit = 0; + if (extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT) + uninit = EXT2_EXTENT_SET_BMAP_UNINIT; + for (blockcnt = extent.e_lblk, j = 0; + j < extent.e_len; + blk++, blockcnt++, j++) { + new_blk = blk; + r = (*ctx.func)(fs, &new_blk, blockcnt, + 0, 0, priv_data); + ret |= r; + check_for_ro_violation_goto(&ctx, ret, + extent_errout); + if (r & BLOCK_CHANGED) { + ctx.errcode = + ext2fs_extent_set_bmap(handle, + (blk64_t) blockcnt, + new_blk, uninit); + if (ctx.errcode) + goto extent_errout; + } + if (ret & BLOCK_ABORT) + break; + } + } + + extent_errout: + ext2fs_extent_free(handle); + ret |= BLOCK_ERROR | BLOCK_ABORT; + goto errout; + } + + /* + * Iterate over normal data blocks + */ + for (i = 0; i < EXT2_NDIR_BLOCKS ; i++, ctx.bcount++) { + if (inode.i_block[i] || (flags & BLOCK_FLAG_APPEND)) { + blk64 = inode.i_block[i]; + ret |= (*ctx.func)(fs, &blk64, ctx.bcount, 0, i, + priv_data); + inode.i_block[i] = (blk_t) blk64; + if (ret & BLOCK_ABORT) + goto abort_exit; + } + } + check_for_ro_violation_goto(&ctx, ret, abort_exit); + if (inode.i_block[EXT2_IND_BLOCK] || (flags & BLOCK_FLAG_APPEND)) { + ret |= block_iterate_ind(&inode.i_block[EXT2_IND_BLOCK], + 0, EXT2_IND_BLOCK, &ctx); + if (ret & BLOCK_ABORT) + goto abort_exit; + } else + ctx.bcount += limit; + if (inode.i_block[EXT2_DIND_BLOCK] || (flags & BLOCK_FLAG_APPEND)) { + ret |= block_iterate_dind(&inode.i_block[EXT2_DIND_BLOCK], + 0, EXT2_DIND_BLOCK, &ctx); + if (ret & BLOCK_ABORT) + goto abort_exit; + } else + ctx.bcount += limit * limit; + if (inode.i_block[EXT2_TIND_BLOCK] || (flags & BLOCK_FLAG_APPEND)) { + ret |= block_iterate_tind(&inode.i_block[EXT2_TIND_BLOCK], + 0, EXT2_TIND_BLOCK, &ctx); + if (ret & BLOCK_ABORT) + goto abort_exit; + } + +abort_exit: + if (ret & BLOCK_CHANGED) { + retval = ext2fs_write_inode(fs, ino, &inode); + if (retval) { + ret |= BLOCK_ERROR; + ctx.errcode = retval; + } + } +errout: + if (!block_buf) + ext2fs_free_mem(&ctx.ind_buf); + + return (ret & BLOCK_ERROR) ? ctx.errcode : 0; +} + +/* + * Emulate the old ext2fs_block_iterate function! + */ + +struct xlate64 { + int (*func)(ext2_filsys fs, + blk_t *blocknr, + e2_blkcnt_t blockcnt, + blk_t ref_blk, + int ref_offset, + void *priv_data); + void *real_private; +}; + +static int xlate64_func(ext2_filsys fs, blk64_t *blocknr, + e2_blkcnt_t blockcnt, blk64_t ref_blk, + int ref_offset, void *priv_data) +{ + struct xlate64 *xl = (struct xlate64 *) priv_data; + int ret; + blk_t block32 = *blocknr; + + ret = (*xl->func)(fs, &block32, blockcnt, (blk_t) ref_blk, ref_offset, + xl->real_private); + *blocknr = block32; + return ret; +} + +errcode_t ext2fs_block_iterate2(ext2_filsys fs, + ext2_ino_t ino, + int flags, + char *block_buf, + int (*func)(ext2_filsys fs, + blk_t *blocknr, + e2_blkcnt_t blockcnt, + blk_t ref_blk, + int ref_offset, + void *priv_data), + void *priv_data) +{ + struct xlate64 xl; + + xl.real_private = priv_data; + xl.func = func; + + return ext2fs_block_iterate3(fs, ino, flags, block_buf, + xlate64_func, &xl); +} + + +struct xlate { + int (*func)(ext2_filsys fs, + blk_t *blocknr, + int bcount, + void *priv_data); + void *real_private; +}; + +#ifdef __TURBOC__ + #pragma argsused +#endif +static int xlate_func(ext2_filsys fs, blk_t *blocknr, e2_blkcnt_t blockcnt, + blk_t ref_block EXT2FS_ATTR((unused)), + int ref_offset EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct xlate *xl = (struct xlate *) priv_data; + + return (*xl->func)(fs, blocknr, (int) blockcnt, xl->real_private); +} + +errcode_t ext2fs_block_iterate(ext2_filsys fs, + ext2_ino_t ino, + int flags, + char *block_buf, + int (*func)(ext2_filsys fs, + blk_t *blocknr, + int blockcnt, + void *priv_data), + void *priv_data) +{ + struct xlate xl; + + xl.real_private = priv_data; + xl.func = func; + + return ext2fs_block_iterate2(fs, ino, BLOCK_FLAG_NO_LARGE | flags, + block_buf, xlate_func, &xl); +} + diff --git a/portlibs/sources/libext2fs/source/bmap.c b/portlibs/sources/libext2fs/source/bmap.c new file mode 100644 index 00000000..fbcb3753 --- /dev/null +++ b/portlibs/sources/libext2fs/source/bmap.c @@ -0,0 +1,335 @@ +/* + * bmap.c --- logical to physical block mapping + * + * Copyright (C) 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <errno.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +#if defined(__GNUC__) && !defined(NO_INLINE_FUNCS) +#define _BMAP_INLINE_ __inline__ +#else +#define _BMAP_INLINE_ +#endif + +extern errcode_t ext2fs_bmap(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + char *block_buf, int bmap_flags, + blk_t block, blk_t *phys_blk); + +#define inode_bmap(inode, nr) ((inode)->i_block[(nr)]) + +static _BMAP_INLINE_ errcode_t block_ind_bmap(ext2_filsys fs, int flags, + blk_t ind, char *block_buf, + int *blocks_alloc, + blk_t nr, blk_t *ret_blk) +{ + errcode_t retval; + blk_t b; + + if (!ind) { + if (flags & BMAP_SET) + return EXT2_ET_SET_BMAP_NO_IND; + *ret_blk = 0; + return 0; + } + retval = io_channel_read_blk(fs->io, ind, 1, block_buf); + if (retval) + return retval; + + if (flags & BMAP_SET) { + b = *ret_blk; +#ifdef WORDS_BIGENDIAN + b = ext2fs_swab32(b); +#endif + ((blk_t *) block_buf)[nr] = b; + return io_channel_write_blk(fs->io, ind, 1, block_buf); + } + + b = ((blk_t *) block_buf)[nr]; + +#ifdef WORDS_BIGENDIAN + b = ext2fs_swab32(b); +#endif + + if (!b && (flags & BMAP_ALLOC)) { + b = nr ? ((blk_t *) block_buf)[nr-1] : 0; + retval = ext2fs_alloc_block(fs, b, + block_buf + fs->blocksize, &b); + if (retval) + return retval; + +#ifdef WORDS_BIGENDIAN + ((blk_t *) block_buf)[nr] = ext2fs_swab32(b); +#else + ((blk_t *) block_buf)[nr] = b; +#endif + + retval = io_channel_write_blk(fs->io, ind, 1, block_buf); + if (retval) + return retval; + + (*blocks_alloc)++; + } + + *ret_blk = b; + return 0; +} + +static _BMAP_INLINE_ errcode_t block_dind_bmap(ext2_filsys fs, int flags, + blk_t dind, char *block_buf, + int *blocks_alloc, + blk_t nr, blk_t *ret_blk) +{ + blk_t b; + errcode_t retval; + blk_t addr_per_block; + + addr_per_block = (blk_t) fs->blocksize >> 2; + + retval = block_ind_bmap(fs, flags & ~BMAP_SET, dind, block_buf, + blocks_alloc, nr / addr_per_block, &b); + if (retval) + return retval; + retval = block_ind_bmap(fs, flags, b, block_buf, blocks_alloc, + nr % addr_per_block, ret_blk); + return retval; +} + +static _BMAP_INLINE_ errcode_t block_tind_bmap(ext2_filsys fs, int flags, + blk_t tind, char *block_buf, + int *blocks_alloc, + blk_t nr, blk_t *ret_blk) +{ + blk_t b; + errcode_t retval; + blk_t addr_per_block; + + addr_per_block = (blk_t) fs->blocksize >> 2; + + retval = block_dind_bmap(fs, flags & ~BMAP_SET, tind, block_buf, + blocks_alloc, nr / addr_per_block, &b); + if (retval) + return retval; + retval = block_ind_bmap(fs, flags, b, block_buf, blocks_alloc, + nr % addr_per_block, ret_blk); + return retval; +} + +errcode_t ext2fs_bmap2(ext2_filsys fs, ext2_ino_t ino, struct ext2_inode *inode, + char *block_buf, int bmap_flags, blk64_t block, + int *ret_flags, blk64_t *phys_blk) +{ + struct ext2_inode inode_buf; + ext2_extent_handle_t handle = 0; + blk_t addr_per_block; + blk_t b, blk32; + char *buf = 0; + errcode_t retval = 0; + int blocks_alloc = 0, inode_dirty = 0; + + if (!(bmap_flags & BMAP_SET)) + *phys_blk = 0; + + if (ret_flags) + *ret_flags = 0; + + /* Read inode structure if necessary */ + if (!inode) { + retval = ext2fs_read_inode(fs, ino, &inode_buf); + if (retval) + return retval; + inode = &inode_buf; + } + addr_per_block = (blk_t) fs->blocksize >> 2; + + if (inode->i_flags & EXT4_EXTENTS_FL) { + struct ext2fs_extent extent; + unsigned int offset; + + retval = ext2fs_extent_open2(fs, ino, inode, &handle); + if (retval) + goto done; + if (bmap_flags & BMAP_SET) { + retval = ext2fs_extent_set_bmap(handle, block, + *phys_blk, 0); + goto done; + } + retval = ext2fs_extent_goto(handle, block); + if (retval) { + /* If the extent is not found, return phys_blk = 0 */ + if (retval == EXT2_ET_EXTENT_NOT_FOUND) + goto got_block; + goto done; + } + retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent); + if (retval) + goto done; + offset = block - extent.e_lblk; + if (block >= extent.e_lblk && (offset <= extent.e_len)) { + *phys_blk = extent.e_pblk + offset; + if (ret_flags && extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT) + *ret_flags |= BMAP_RET_UNINIT; + } + got_block: + if ((*phys_blk == 0) && (bmap_flags & BMAP_ALLOC)) { + retval = ext2fs_alloc_block(fs, b, block_buf, &b); + if (retval) + goto done; + retval = ext2fs_extent_set_bmap(handle, block, + (blk64_t) b, 0); + if (retval) + goto done; + /* Update inode after setting extent */ + retval = ext2fs_read_inode(fs, ino, inode); + if (retval) + return retval; + blocks_alloc++; + *phys_blk = b; + } + retval = 0; + goto done; + } + + if (!block_buf) { + retval = ext2fs_get_array(2, fs->blocksize, &buf); + if (retval) + return retval; + block_buf = buf; + } + + if (block < EXT2_NDIR_BLOCKS) { + if (bmap_flags & BMAP_SET) { + b = *phys_blk; + inode_bmap(inode, block) = b; + inode_dirty++; + goto done; + } + + *phys_blk = inode_bmap(inode, block); + b = block ? inode_bmap(inode, block-1) : 0; + + if ((*phys_blk == 0) && (bmap_flags & BMAP_ALLOC)) { + retval = ext2fs_alloc_block(fs, b, block_buf, &b); + if (retval) + goto done; + inode_bmap(inode, block) = b; + blocks_alloc++; + *phys_blk = b; + } + goto done; + } + + /* Indirect block */ + block -= EXT2_NDIR_BLOCKS; + blk32 = *phys_blk; + if (block < addr_per_block) { + b = inode_bmap(inode, EXT2_IND_BLOCK); + if (!b) { + if (!(bmap_flags & BMAP_ALLOC)) { + if (bmap_flags & BMAP_SET) + retval = EXT2_ET_SET_BMAP_NO_IND; + goto done; + } + + b = inode_bmap(inode, EXT2_IND_BLOCK-1); + retval = ext2fs_alloc_block(fs, b, block_buf, &b); + if (retval) + goto done; + inode_bmap(inode, EXT2_IND_BLOCK) = b; + blocks_alloc++; + } + retval = block_ind_bmap(fs, bmap_flags, b, block_buf, + &blocks_alloc, block, &blk32); + if (retval == 0) + *phys_blk = blk32; + goto done; + } + + /* Doubly indirect block */ + block -= addr_per_block; + if (block < addr_per_block * addr_per_block) { + b = inode_bmap(inode, EXT2_DIND_BLOCK); + if (!b) { + if (!(bmap_flags & BMAP_ALLOC)) { + if (bmap_flags & BMAP_SET) + retval = EXT2_ET_SET_BMAP_NO_IND; + goto done; + } + + b = inode_bmap(inode, EXT2_IND_BLOCK); + retval = ext2fs_alloc_block(fs, b, block_buf, &b); + if (retval) + goto done; + inode_bmap(inode, EXT2_DIND_BLOCK) = b; + blocks_alloc++; + } + retval = block_dind_bmap(fs, bmap_flags, b, block_buf, + &blocks_alloc, block, &blk32); + if (retval == 0) + *phys_blk = blk32; + goto done; + } + + /* Triply indirect block */ + block -= addr_per_block * addr_per_block; + b = inode_bmap(inode, EXT2_TIND_BLOCK); + if (!b) { + if (!(bmap_flags & BMAP_ALLOC)) { + if (bmap_flags & BMAP_SET) + retval = EXT2_ET_SET_BMAP_NO_IND; + goto done; + } + + b = inode_bmap(inode, EXT2_DIND_BLOCK); + retval = ext2fs_alloc_block(fs, b, block_buf, &b); + if (retval) + goto done; + inode_bmap(inode, EXT2_TIND_BLOCK) = b; + blocks_alloc++; + } + retval = block_tind_bmap(fs, bmap_flags, b, block_buf, + &blocks_alloc, block, &blk32); + if (retval == 0) + *phys_blk = blk32; +done: + if (buf) + ext2fs_free_mem(&buf); + if (handle) + ext2fs_extent_free(handle); + if ((retval == 0) && (blocks_alloc || inode_dirty)) { + ext2fs_iblk_add_blocks(fs, inode, blocks_alloc); + retval = ext2fs_write_inode(fs, ino, inode); + } + return retval; +} + +errcode_t ext2fs_bmap(ext2_filsys fs, ext2_ino_t ino, struct ext2_inode *inode, + char *block_buf, int bmap_flags, blk_t block, + blk_t *phys_blk) +{ + errcode_t ret; + blk64_t ret_blk = *phys_blk; + + ret = ext2fs_bmap2(fs, ino, inode, block_buf, bmap_flags, block, + 0, &ret_blk); + if (ret) + return ret; + if (ret_blk >= ((long long) 1 << 32)) + return EOVERFLOW; + *phys_blk = ret_blk; + return 0; +} diff --git a/portlibs/sources/libext2fs/source/bmap64.h b/portlibs/sources/libext2fs/source/bmap64.h new file mode 100644 index 00000000..b0aa84c1 --- /dev/null +++ b/portlibs/sources/libext2fs/source/bmap64.h @@ -0,0 +1,61 @@ +/* + * bmap64.h --- 64-bit bitmap structure + * + * Copyright (C) 2007, 2008 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Public + * License. + * %End-Header% + */ + +struct ext2fs_struct_generic_bitmap { + errcode_t magic; + ext2_filsys fs; + struct ext2_bitmap_ops *bitmap_ops; + int flags; + __u64 start, end; + __u64 real_end; + char *description; + void *private; + errcode_t base_error_code; +}; + +#define EXT2FS_IS_32_BITMAP(bmap) \ + (((bmap)->magic == EXT2_ET_MAGIC_GENERIC_BITMAP) || \ + ((bmap)->magic == EXT2_ET_MAGIC_BLOCK_BITMAP) || \ + ((bmap)->magic == EXT2_ET_MAGIC_INODE_BITMAP)) + +#define EXT2FS_IS_64_BITMAP(bmap) \ + (((bmap)->magic == EXT2_ET_MAGIC_GENERIC_BITMAP64) || \ + ((bmap)->magic == EXT2_ET_MAGIC_BLOCK_BITMAP64) || \ + ((bmap)->magic == EXT2_ET_MAGIC_INODE_BITMAP64)) + +struct ext2_bitmap_ops { + int type; + /* Generic bmap operators */ + errcode_t (*new_bmap)(ext2_filsys fs, ext2fs_generic_bitmap bmap); + void (*free_bmap)(ext2fs_generic_bitmap bitmap); + errcode_t (*copy_bmap)(ext2fs_generic_bitmap src, + ext2fs_generic_bitmap dest); + errcode_t (*resize_bmap)(ext2fs_generic_bitmap bitmap, + __u64 new_end, + __u64 new_real_end); + /* bit set/test operators */ + int (*mark_bmap)(ext2fs_generic_bitmap bitmap, __u64 arg); + int (*unmark_bmap)(ext2fs_generic_bitmap bitmap, __u64 arg); + int (*test_bmap)(ext2fs_generic_bitmap bitmap, __u64 arg); + void (*mark_bmap_extent)(ext2fs_generic_bitmap bitmap, __u64 arg, + unsigned int num); + void (*unmark_bmap_extent)(ext2fs_generic_bitmap bitmap, __u64 arg, + unsigned int num); + int (*test_clear_bmap_extent)(ext2fs_generic_bitmap bitmap, + __u64 arg, unsigned int num); + errcode_t (*set_bmap_range)(ext2fs_generic_bitmap bitmap, + __u64 start, size_t num, void *in); + errcode_t (*get_bmap_range)(ext2fs_generic_bitmap bitmap, + __u64 start, size_t num, void *out); + void (*clear_bmap)(ext2fs_generic_bitmap bitmap); +}; + +extern struct ext2_bitmap_ops ext2fs_blkmap64_bitarray; diff --git a/portlibs/sources/libext2fs/source/bmove.c b/portlibs/sources/libext2fs/source/bmove.c new file mode 100644 index 00000000..deabf38c --- /dev/null +++ b/portlibs/sources/libext2fs/source/bmove.c @@ -0,0 +1,166 @@ +/* + * bmove.c --- Move blocks around to make way for a particular + * filesystem structure. + * + * Copyright (C) 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif +#if HAVE_SYS_TIME_H +#include <sys/time.h> +#endif + +#include "ext2_fs.h" +#include "ext2fsP.h" + +struct process_block_struct { + ext2_ino_t ino; + struct ext2_inode * inode; + ext2fs_block_bitmap reserve; + ext2fs_block_bitmap alloc_map; + errcode_t error; + char *buf; + int add_dir; + int flags; +}; + +static int process_block(ext2_filsys fs, blk64_t *block_nr, + e2_blkcnt_t blockcnt, blk64_t ref_block, + int ref_offset, void *priv_data) +{ + struct process_block_struct *pb; + errcode_t retval; + int ret; + blk64_t block, orig; + + pb = (struct process_block_struct *) priv_data; + block = orig = *block_nr; + ret = 0; + + /* + * Let's see if this is one which we need to relocate + */ + if (ext2fs_test_block_bitmap2(pb->reserve, block)) { + do { + if (++block >= ext2fs_blocks_count(fs->super)) + block = fs->super->s_first_data_block; + if (block == orig) { + pb->error = EXT2_ET_BLOCK_ALLOC_FAIL; + return BLOCK_ABORT; + } + } while (ext2fs_test_block_bitmap2(pb->reserve, block) || + ext2fs_test_block_bitmap2(pb->alloc_map, block)); + + retval = io_channel_read_blk64(fs->io, orig, 1, pb->buf); + if (retval) { + pb->error = retval; + return BLOCK_ABORT; + } + retval = io_channel_write_blk64(fs->io, block, 1, pb->buf); + if (retval) { + pb->error = retval; + return BLOCK_ABORT; + } + *block_nr = block; + ext2fs_mark_block_bitmap2(pb->alloc_map, block); + ret = BLOCK_CHANGED; + if (pb->flags & EXT2_BMOVE_DEBUG) + printf("ino=%u, blockcnt=%lld, %llu->%llu\n", + (unsigned) pb->ino, blockcnt, + (unsigned long long) orig, + (unsigned long long) block); + } + if (pb->add_dir) { + retval = ext2fs_add_dir_block2(fs->dblist, pb->ino, + block, blockcnt); + if (retval) { + pb->error = retval; + ret |= BLOCK_ABORT; + } + } + return ret; +} + +errcode_t ext2fs_move_blocks(ext2_filsys fs, + ext2fs_block_bitmap reserve, + ext2fs_block_bitmap alloc_map, + int flags) +{ + ext2_ino_t ino; + struct ext2_inode inode; + errcode_t retval; + struct process_block_struct pb; + ext2_inode_scan scan; + char *block_buf; + + retval = ext2fs_open_inode_scan(fs, 0, &scan); + if (retval) + return retval; + + pb.reserve = reserve; + pb.error = 0; + pb.alloc_map = alloc_map ? alloc_map : fs->block_map; + pb.flags = flags; + + retval = ext2fs_get_array(4, fs->blocksize, &block_buf); + if (retval) + return retval; + pb.buf = block_buf + fs->blocksize * 3; + + /* + * If GET_DBLIST is set in the flags field, then we should + * gather directory block information while we're doing the + * block move. + */ + if (flags & EXT2_BMOVE_GET_DBLIST) { + if (fs->dblist) { + ext2fs_free_dblist(fs->dblist); + fs->dblist = NULL; + } + retval = ext2fs_init_dblist(fs, 0); + if (retval) + return retval; + } + + retval = ext2fs_get_next_inode(scan, &ino, &inode); + if (retval) + return retval; + + while (ino) { + if ((inode.i_links_count == 0) || + !ext2fs_inode_has_valid_blocks(&inode)) + goto next; + + pb.ino = ino; + pb.inode = &inode; + + pb.add_dir = (LINUX_S_ISDIR(inode.i_mode) && + flags & EXT2_BMOVE_GET_DBLIST); + + retval = ext2fs_block_iterate3(fs, ino, 0, block_buf, + process_block, &pb); + if (retval) + return retval; + if (pb.error) + return pb.error; + + next: + retval = ext2fs_get_next_inode(scan, &ino, &inode); + if (retval == EXT2_ET_BAD_BLOCK_IN_INODE_TABLE) + goto next; + } + return 0; +} + diff --git a/portlibs/sources/libext2fs/source/brel.h b/portlibs/sources/libext2fs/source/brel.h new file mode 100644 index 00000000..a0dd5b9c --- /dev/null +++ b/portlibs/sources/libext2fs/source/brel.h @@ -0,0 +1,86 @@ +/* + * brel.h + * + * Copyright (C) 1996, 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +struct ext2_block_relocate_entry { + blk_t new; + __s16 offset; + __u16 flags; + union { + blk_t block_ref; + ext2_ino_t inode_ref; + } owner; +}; + +#define RELOCATE_TYPE_REF 0x0007 +#define RELOCATE_BLOCK_REF 0x0001 +#define RELOCATE_INODE_REF 0x0002 + +typedef struct ext2_block_relocation_table *ext2_brel; + +struct ext2_block_relocation_table { + __u32 magic; + char *name; + blk_t current; + void *priv_data; + + /* + * Add a block relocation entry. + */ + errcode_t (*put)(ext2_brel brel, blk_t old, + struct ext2_block_relocate_entry *ent); + + /* + * Get a block relocation entry. + */ + errcode_t (*get)(ext2_brel brel, blk_t old, + struct ext2_block_relocate_entry *ent); + + /* + * Initialize for iterating over the block relocation entries. + */ + errcode_t (*start_iter)(ext2_brel brel); + + /* + * The iterator function for the inode relocation entries. + * Returns an inode number of 0 when out of entries. + */ + errcode_t (*next)(ext2_brel brel, blk_t *old, + struct ext2_block_relocate_entry *ent); + + /* + * Move the inode relocation table from one block number to + * another. + */ + errcode_t (*move)(ext2_brel brel, blk_t old, blk_t new); + + /* + * Remove a block relocation entry. + */ + errcode_t (*delete)(ext2_brel brel, blk_t old); + + + /* + * Free the block relocation table. + */ + errcode_t (*free)(ext2_brel brel); +}; + +errcode_t ext2fs_brel_memarray_create(char *name, blk_t max_block, + ext2_brel *brel); + +#define ext2fs_brel_put(brel, old, ent) ((brel)->put((brel), old, ent)) +#define ext2fs_brel_get(brel, old, ent) ((brel)->get((brel), old, ent)) +#define ext2fs_brel_start_iter(brel) ((brel)->start_iter((brel))) +#define ext2fs_brel_next(brel, old, ent) ((brel)->next((brel), old, ent)) +#define ext2fs_brel_move(brel, old, new) ((brel)->move((brel), old, new)) +#define ext2fs_brel_delete(brel, old) ((brel)->delete((brel), old)) +#define ext2fs_brel_free(brel) ((brel)->free((brel))) + diff --git a/portlibs/sources/libext2fs/source/brel_ma.c b/portlibs/sources/libext2fs/source/brel_ma.c new file mode 100644 index 00000000..1a55702b --- /dev/null +++ b/portlibs/sources/libext2fs/source/brel_ma.c @@ -0,0 +1,198 @@ +/* + * brel_ma.c + * + * Copyright (C) 1996, 1997 Theodore Ts'o. + * + * TODO: rewrite to not use a direct array!!! (Fortunately this + * module isn't really used yet.) + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <fcntl.h> +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" +#include "brel.h" + +static errcode_t bma_put(ext2_brel brel, blk_t old, + struct ext2_block_relocate_entry *ent); +static errcode_t bma_get(ext2_brel brel, blk_t old, + struct ext2_block_relocate_entry *ent); +static errcode_t bma_start_iter(ext2_brel brel); +static errcode_t bma_next(ext2_brel brel, blk_t *old, + struct ext2_block_relocate_entry *ent); +static errcode_t bma_move(ext2_brel brel, blk_t old, blk_t new); +static errcode_t bma_delete(ext2_brel brel, blk_t old); +static errcode_t bma_free(ext2_brel brel); + +struct brel_ma { + __u32 magic; + blk_t max_block; + struct ext2_block_relocate_entry *entries; +}; + +errcode_t ext2fs_brel_memarray_create(char *name, blk_t max_block, + ext2_brel *new_brel) +{ + ext2_brel brel = 0; + errcode_t retval; + struct brel_ma *ma = 0; + size_t size; + + *new_brel = 0; + + /* + * Allocate memory structures + */ + retval = ext2fs_get_mem(sizeof(struct ext2_block_relocation_table), + &brel); + if (retval) + goto errout; + memset(brel, 0, sizeof(struct ext2_block_relocation_table)); + + retval = ext2fs_get_mem(strlen(name)+1, &brel->name); + if (retval) + goto errout; + strcpy(brel->name, name); + + retval = ext2fs_get_mem(sizeof(struct brel_ma), &ma); + if (retval) + goto errout; + memset(ma, 0, sizeof(struct brel_ma)); + brel->priv_data = ma; + + size = (size_t) (sizeof(struct ext2_block_relocate_entry) * + (max_block+1)); + retval = ext2fs_get_array(max_block+1, + sizeof(struct ext2_block_relocate_entry), &ma->entries); + if (retval) + goto errout; + memset(ma->entries, 0, size); + ma->max_block = max_block; + + /* + * Fill in the brel data structure + */ + brel->put = bma_put; + brel->get = bma_get; + brel->start_iter = bma_start_iter; + brel->next = bma_next; + brel->move = bma_move; + brel->delete = bma_delete; + brel->free = bma_free; + + *new_brel = brel; + return 0; + +errout: + bma_free(brel); + return retval; +} + +static errcode_t bma_put(ext2_brel brel, blk_t old, + struct ext2_block_relocate_entry *ent) +{ + struct brel_ma *ma; + + ma = brel->priv_data; + if (old > ma->max_block) + return EXT2_ET_INVALID_ARGUMENT; + ma->entries[(unsigned)old] = *ent; + return 0; +} + +static errcode_t bma_get(ext2_brel brel, blk_t old, + struct ext2_block_relocate_entry *ent) +{ + struct brel_ma *ma; + + ma = brel->priv_data; + if (old > ma->max_block) + return EXT2_ET_INVALID_ARGUMENT; + if (ma->entries[(unsigned)old].new == 0) + return ENOENT; + *ent = ma->entries[old]; + return 0; +} + +static errcode_t bma_start_iter(ext2_brel brel) +{ + brel->current = 0; + return 0; +} + +static errcode_t bma_next(ext2_brel brel, blk_t *old, + struct ext2_block_relocate_entry *ent) +{ + struct brel_ma *ma; + + ma = brel->priv_data; + while (++brel->current < ma->max_block) { + if (ma->entries[(unsigned)brel->current].new == 0) + continue; + *old = brel->current; + *ent = ma->entries[(unsigned)brel->current]; + return 0; + } + *old = 0; + return 0; +} + +static errcode_t bma_move(ext2_brel brel, blk_t old, blk_t new) +{ + struct brel_ma *ma; + + ma = brel->priv_data; + if ((old > ma->max_block) || (new > ma->max_block)) + return EXT2_ET_INVALID_ARGUMENT; + if (ma->entries[(unsigned)old].new == 0) + return ENOENT; + ma->entries[(unsigned)new] = ma->entries[old]; + ma->entries[(unsigned)old].new = 0; + return 0; +} + +static errcode_t bma_delete(ext2_brel brel, blk_t old) +{ + struct brel_ma *ma; + + ma = brel->priv_data; + if (old > ma->max_block) + return EXT2_ET_INVALID_ARGUMENT; + if (ma->entries[(unsigned)old].new == 0) + return ENOENT; + ma->entries[(unsigned)old].new = 0; + return 0; +} + +static errcode_t bma_free(ext2_brel brel) +{ + struct brel_ma *ma; + + if (!brel) + return 0; + + ma = brel->priv_data; + + if (ma) { + if (ma->entries) + ext2fs_free_mem(&ma->entries); + ext2fs_free_mem(&ma); + } + if (brel->name) + ext2fs_free_mem(&brel->name); + ext2fs_free_mem(&brel); + return 0; +} diff --git a/portlibs/sources/libext2fs/source/check_desc.c b/portlibs/sources/libext2fs/source/check_desc.c new file mode 100644 index 00000000..7929cd95 --- /dev/null +++ b/portlibs/sources/libext2fs/source/check_desc.c @@ -0,0 +1,103 @@ +/* + * check_desc.c --- Check the group descriptors of an ext2 filesystem + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +/* + * This routine sanity checks the group descriptors + */ +errcode_t ext2fs_check_desc(ext2_filsys fs) +{ + ext2fs_block_bitmap bmap; + errcode_t retval; + dgrp_t i; + blk64_t first_block = fs->super->s_first_data_block; + blk64_t last_block = ext2fs_blocks_count(fs->super)-1; + blk64_t blk, b; + int j; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + retval = ext2fs_allocate_block_bitmap(fs, "check_desc map", &bmap); + if (retval) + return retval; + + for (i = 0; i < fs->group_desc_count; i++) + ext2fs_reserve_super_and_bgd(fs, i, bmap); + + for (i = 0; i < fs->group_desc_count; i++) { + if (!EXT2_HAS_INCOMPAT_FEATURE(fs->super, + EXT4_FEATURE_INCOMPAT_FLEX_BG)) { + first_block = ext2fs_group_first_block2(fs, i); + last_block = ext2fs_group_last_block2(fs, i); + if (i == (fs->group_desc_count - 1)) + last_block = ext2fs_blocks_count(fs->super)-1; + } + + /* + * Check to make sure the block bitmap for group is sane + */ + blk = ext2fs_block_bitmap_loc(fs, i); + if (blk < first_block || blk > last_block || + ext2fs_test_block_bitmap2(bmap, blk)) { + retval = EXT2_ET_GDESC_BAD_BLOCK_MAP; + goto errout; + } + ext2fs_mark_block_bitmap2(bmap, blk); + + /* + * Check to make sure the inode bitmap for group is sane + */ + blk = ext2fs_inode_bitmap_loc(fs, i); + if (blk < first_block || blk > last_block || + ext2fs_test_block_bitmap2(bmap, blk)) { + retval = EXT2_ET_GDESC_BAD_INODE_MAP; + goto errout; + } + ext2fs_mark_block_bitmap2(bmap, blk); + + /* + * Check to make sure the inode table for group is sane + */ + blk = ext2fs_inode_table_loc(fs, i); + if (blk < first_block || + ((blk + fs->inode_blocks_per_group - 1) > last_block)) { + retval = EXT2_ET_GDESC_BAD_INODE_TABLE; + goto errout; + } + for (j = 0, b = blk; j < fs->inode_blocks_per_group; + j++, b++) { + if (ext2fs_test_block_bitmap2(bmap, b)) { + retval = EXT2_ET_GDESC_BAD_INODE_TABLE; + goto errout; + } + ext2fs_mark_block_bitmap2(bmap, b); + } + } +errout: + ext2fs_free_block_bitmap(bmap); + return retval; +} diff --git a/portlibs/sources/libext2fs/source/closefs.c b/portlibs/sources/libext2fs/source/closefs.c new file mode 100644 index 00000000..8242622b --- /dev/null +++ b/portlibs/sources/libext2fs/source/closefs.c @@ -0,0 +1,461 @@ +/* + * closefs.c --- close an ext2 filesystem + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <time.h> +#include <string.h> + +#include "ext2_fs.h" +#include "ext2fsP.h" + +static int test_root(int a, int b) +{ + if (a == 0) + return 1; + while (1) { + if (a == 1) + return 1; + if (a % b) + return 0; + a = a / b; + } +} + +int ext2fs_bg_has_super(ext2_filsys fs, int group_block) +{ + if (!(fs->super->s_feature_ro_compat & + EXT2_FEATURE_RO_COMPAT_SPARSE_SUPER)) + return 1; + + if (test_root(group_block, 3) || (test_root(group_block, 5)) || + test_root(group_block, 7)) + return 1; + + return 0; +} + +/* + * ext2fs_super_and_bgd_loc2() + * @fs: ext2 fs pointer + * @group given block group + * @ret_super_blk: if !NULL, returns super block location + * @ret_old_desc_blk: if !NULL, returns location of the old block + * group descriptor + * @ret_new_desc_blk: if !NULL, returns location of meta_bg block + * group descriptor + * @ret_used_blks: if !NULL, returns number of blocks used by + * super block and group_descriptors. + * + * Returns errcode_t of 0 + */ +errcode_t ext2fs_super_and_bgd_loc2(ext2_filsys fs, + dgrp_t group, + blk64_t *ret_super_blk, + blk64_t *ret_old_desc_blk, + blk64_t *ret_new_desc_blk, + blk_t *ret_used_blks) +{ + blk64_t group_block, super_blk = 0, old_desc_blk = 0, new_desc_blk = 0; + unsigned int meta_bg, meta_bg_size; + blk_t numblocks = 0; + blk64_t old_desc_blocks; + int has_super; + + group_block = ext2fs_group_first_block2(fs, group); + + if (fs->super->s_feature_incompat & EXT2_FEATURE_INCOMPAT_META_BG) + old_desc_blocks = fs->super->s_first_meta_bg; + else + old_desc_blocks = + fs->desc_blocks + fs->super->s_reserved_gdt_blocks; + + has_super = ext2fs_bg_has_super(fs, group); + + if (has_super) { + super_blk = group_block; + numblocks++; + } + meta_bg_size = EXT2_DESC_PER_BLOCK(fs->super); + meta_bg = group / meta_bg_size; + + if (!(fs->super->s_feature_incompat & EXT2_FEATURE_INCOMPAT_META_BG) || + (meta_bg < fs->super->s_first_meta_bg)) { + if (has_super) { + old_desc_blk = group_block + 1; + numblocks += old_desc_blocks; + } + } else { + if (((group % meta_bg_size) == 0) || + ((group % meta_bg_size) == 1) || + ((group % meta_bg_size) == (meta_bg_size-1))) { + if (has_super) + has_super = 1; + new_desc_blk = group_block + has_super; + numblocks++; + } + } + + if (ret_super_blk) + *ret_super_blk = super_blk; + if (ret_old_desc_blk) + *ret_old_desc_blk = old_desc_blk; + if (ret_new_desc_blk) + *ret_new_desc_blk = new_desc_blk; + if (ret_used_blks) + *ret_used_blks = numblocks; + + return 0; +} + +/* + * This function returns the location of the superblock, block group + * descriptors for a given block group. It currently returns the + * number of free blocks assuming that inode table and allocation + * bitmaps will be in the group. This is not necessarily the case + * when the flex_bg feature is enabled, so callers should take care! + * It was only really intended for use by mke2fs, and even there it's + * not that useful. + * + * The ext2fs_super_and_bgd_loc2() function is 64-bit block number + * capable and returns the number of blocks used by super block and + * group descriptors. + */ +int ext2fs_super_and_bgd_loc(ext2_filsys fs, + dgrp_t group, + blk_t *ret_super_blk, + blk_t *ret_old_desc_blk, + blk_t *ret_new_desc_blk, + int *ret_meta_bg) +{ + blk64_t ret_super_blk2; + blk64_t ret_old_desc_blk2; + blk64_t ret_new_desc_blk2; + blk_t ret_used_blks; + blk_t numblocks; + unsigned int meta_bg_size; + + ext2fs_super_and_bgd_loc2(fs, group, &ret_super_blk2, + &ret_old_desc_blk2, + &ret_new_desc_blk2, + &ret_used_blks); + + if (group == fs->group_desc_count-1) { + numblocks = (ext2fs_blocks_count(fs->super) - + (blk64_t) fs->super->s_first_data_block) % + (blk64_t) fs->super->s_blocks_per_group; + if (!numblocks) + numblocks = fs->super->s_blocks_per_group; + } else + numblocks = fs->super->s_blocks_per_group; + + if (ret_super_blk) + *ret_super_blk = (blk_t)ret_super_blk2; + if (ret_old_desc_blk) + *ret_old_desc_blk = (blk_t)ret_old_desc_blk2; + if (ret_new_desc_blk) + *ret_new_desc_blk = (blk_t)ret_new_desc_blk2; + if (ret_meta_bg) { + meta_bg_size = EXT2_DESC_PER_BLOCK(fs->super); + *ret_meta_bg = group / meta_bg_size; + } + + numblocks -= 2 + fs->inode_blocks_per_group + ret_used_blks; + + return numblocks; +} + +/* + * This function forces out the primary superblock. We need to only + * write out those fields which we have changed, since if the + * filesystem is mounted, it may have changed some of the other + * fields. + * + * It takes as input a superblock which has already been byte swapped + * (if necessary). + * + */ +static errcode_t write_primary_superblock(ext2_filsys fs, + struct ext2_super_block *super) +{ + __u16 *old_super, *new_super; + int check_idx, write_idx, size; + errcode_t retval; + + if (!fs->io->manager->write_byte || !fs->orig_super) { + fallback: + io_channel_set_blksize(fs->io, SUPERBLOCK_OFFSET); + retval = io_channel_write_blk64(fs->io, 1, -SUPERBLOCK_SIZE, + super); + io_channel_set_blksize(fs->io, fs->blocksize); + return retval; + } + + old_super = (__u16 *) fs->orig_super; + new_super = (__u16 *) super; + + for (check_idx = 0; check_idx < SUPERBLOCK_SIZE/2; check_idx++) { + if (old_super[check_idx] == new_super[check_idx]) + continue; + write_idx = check_idx; + for (check_idx++; check_idx < SUPERBLOCK_SIZE/2; check_idx++) + if (old_super[check_idx] == new_super[check_idx]) + break; + size = 2 * (check_idx - write_idx); +#if 0 + printf("Writing %d bytes starting at %d\n", + size, write_idx*2); +#endif + retval = io_channel_write_byte(fs->io, + SUPERBLOCK_OFFSET + (2 * write_idx), size, + new_super + write_idx); + if (retval == EXT2_ET_UNIMPLEMENTED) + goto fallback; + if (retval) + return retval; + } + memcpy(fs->orig_super, super, SUPERBLOCK_SIZE); + return 0; +} + + +/* + * Updates the revision to EXT2_DYNAMIC_REV + */ +void ext2fs_update_dynamic_rev(ext2_filsys fs) +{ + struct ext2_super_block *sb = fs->super; + + if (sb->s_rev_level > EXT2_GOOD_OLD_REV) + return; + + sb->s_rev_level = EXT2_DYNAMIC_REV; + sb->s_first_ino = EXT2_GOOD_OLD_FIRST_INO; + sb->s_inode_size = EXT2_GOOD_OLD_INODE_SIZE; + /* s_uuid is handled by e2fsck already */ + /* other fields should be left alone */ +} + +static errcode_t write_backup_super(ext2_filsys fs, dgrp_t group, + blk_t group_block, + struct ext2_super_block *super_shadow) +{ + dgrp_t sgrp = group; + + if (sgrp > ((1 << 16) - 1)) + sgrp = (1 << 16) - 1; +#ifdef WORDS_BIGENDIAN + super_shadow->s_block_group_nr = ext2fs_swab16(sgrp); +#else + fs->super->s_block_group_nr = sgrp; +#endif + + return io_channel_write_blk64(fs->io, group_block, -SUPERBLOCK_SIZE, + super_shadow); +} + +errcode_t ext2fs_flush(ext2_filsys fs) +{ + dgrp_t i; + errcode_t retval; + unsigned long fs_state; + __u32 feature_incompat; + struct ext2_super_block *super_shadow = 0; + struct ext2_group_desc *group_shadow = 0; +#ifdef WORDS_BIGENDIAN + struct ext2_group_desc *gdp; + dgrp_t j; +#endif + char *group_ptr; + int old_desc_blocks; + struct ext2fs_numeric_progress_struct progress; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + fs_state = fs->super->s_state; + feature_incompat = fs->super->s_feature_incompat; + + fs->super->s_wtime = fs->now ? fs->now : time(NULL); + fs->super->s_block_group_nr = 0; +#ifdef WORDS_BIGENDIAN + retval = EXT2_ET_NO_MEMORY; + retval = ext2fs_get_mem(SUPERBLOCK_SIZE, &super_shadow); + if (retval) + goto errout; + retval = ext2fs_get_array(fs->desc_blocks, fs->blocksize, + &group_shadow); + if (retval) + goto errout; + memcpy(group_shadow, fs->group_desc, (size_t) fs->blocksize * + fs->desc_blocks); + + /* swap the group descriptors */ + for (j=0; j < fs->group_desc_count; j++) { + gdp = ext2fs_group_desc(fs, (struct opaque_ext2_group_desc *) group_shadow, j); + ext2fs_swap_group_desc2(fs, gdp); + } +#else + super_shadow = fs->super; + group_shadow = ext2fs_group_desc(fs, fs->group_desc, 0); +#endif + + /* + * Set the state of the FS to be non-valid. (The state has + * already been backed up earlier, and will be restored after + * we write out the backup superblocks.) + */ + fs->super->s_state &= ~EXT2_VALID_FS; + fs->super->s_feature_incompat &= ~EXT3_FEATURE_INCOMPAT_RECOVER; +#ifdef WORDS_BIGENDIAN + *super_shadow = *fs->super; + ext2fs_swap_super(super_shadow); +#endif + + /* + * If this is an external journal device, don't write out the + * block group descriptors or any of the backup superblocks + */ + if (fs->super->s_feature_incompat & + EXT3_FEATURE_INCOMPAT_JOURNAL_DEV) + goto write_primary_superblock_only; + + /* + * Write out the master group descriptors, and the backup + * superblocks and group descriptors. + */ + group_ptr = (char *) group_shadow; + if (fs->super->s_feature_incompat & EXT2_FEATURE_INCOMPAT_META_BG) + old_desc_blocks = fs->super->s_first_meta_bg; + else + old_desc_blocks = fs->desc_blocks; + + ext2fs_numeric_progress_init(fs, &progress, NULL, + fs->group_desc_count); + + + for (i = 0; i < fs->group_desc_count; i++) { + blk64_t super_blk, old_desc_blk, new_desc_blk; + + ext2fs_numeric_progress_update(fs, &progress, i); + ext2fs_super_and_bgd_loc2(fs, i, &super_blk, &old_desc_blk, + &new_desc_blk, 0); + + if (!(fs->flags & EXT2_FLAG_MASTER_SB_ONLY) &&i && super_blk) { + retval = write_backup_super(fs, i, super_blk, + super_shadow); + if (retval) + goto errout; + } + if (fs->flags & EXT2_FLAG_SUPER_ONLY) + continue; + if ((old_desc_blk) && + (!(fs->flags & EXT2_FLAG_MASTER_SB_ONLY) || (i == 0))) { + retval = io_channel_write_blk64(fs->io, + old_desc_blk, old_desc_blocks, group_ptr); + if (retval) + goto errout; + } + if (new_desc_blk) { + int meta_bg = i / EXT2_DESC_PER_BLOCK(fs->super); + + retval = io_channel_write_blk64(fs->io, new_desc_blk, + 1, group_ptr + (meta_bg*fs->blocksize)); + if (retval) + goto errout; + } + } + + ext2fs_numeric_progress_close(fs, &progress, NULL); + + /* + * If the write_bitmaps() function is present, call it to + * flush the bitmaps. This is done this way so that a simple + * program that doesn't mess with the bitmaps doesn't need to + * drag in the bitmaps.c code. + */ + if (fs->write_bitmaps) { + retval = fs->write_bitmaps(fs); + if (retval) + goto errout; + } + +write_primary_superblock_only: + /* + * Write out master superblock. This has to be done + * separately, since it is located at a fixed location + * (SUPERBLOCK_OFFSET). We flush all other pending changes + * out to disk first, just to avoid a race condition with an + * insy-tinsy window.... + */ + + fs->super->s_block_group_nr = 0; + fs->super->s_state = fs_state; + fs->super->s_feature_incompat = feature_incompat; +#ifdef WORDS_BIGENDIAN + *super_shadow = *fs->super; + ext2fs_swap_super(super_shadow); +#endif + + retval = io_channel_flush(fs->io); + retval = write_primary_superblock(fs, super_shadow); + if (retval) + goto errout; + + fs->flags &= ~EXT2_FLAG_DIRTY; + + retval = io_channel_flush(fs->io); +errout: + fs->super->s_state = fs_state; +#ifdef WORDS_BIGENDIAN + if (super_shadow) + ext2fs_free_mem(&super_shadow); + if (group_shadow) + ext2fs_free_mem(&group_shadow); +#endif + return retval; +} + +errcode_t ext2fs_close(ext2_filsys fs) +{ + errcode_t retval; + int meta_blks; + io_stats stats = 0; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (fs->write_bitmaps) { + retval = fs->write_bitmaps(fs); + if (retval) + return retval; + } + if (fs->super->s_kbytes_written && + fs->io->manager->get_stats) + fs->io->manager->get_stats(fs->io, &stats); + if (stats && stats->bytes_written && (fs->flags & EXT2_FLAG_RW)) { + fs->super->s_kbytes_written += stats->bytes_written >> 10; + meta_blks = fs->desc_blocks + 1; + if (!(fs->flags & EXT2_FLAG_SUPER_ONLY)) + fs->super->s_kbytes_written += meta_blks / + (fs->blocksize / 1024); + if ((fs->flags & EXT2_FLAG_DIRTY) == 0) + fs->flags |= EXT2_FLAG_SUPER_ONLY | EXT2_FLAG_DIRTY; + } + if (fs->flags & EXT2_FLAG_DIRTY) { + retval = ext2fs_flush(fs); + if (retval) + return retval; + } + ext2fs_free(fs); + return 0; +} + diff --git a/portlibs/sources/libext2fs/source/com_err.c b/portlibs/sources/libext2fs/source/com_err.c new file mode 100644 index 00000000..c27853e7 --- /dev/null +++ b/portlibs/sources/libext2fs/source/com_err.c @@ -0,0 +1,35 @@ +/* + * Copyright 1987, 1988 by MIT Student Information Processing Board. + * + * Permission to use, copy, modify, and distribute this software and + * its documentation for any purpose is hereby granted, provided that + * the names of M.I.T. and the M.I.T. S.I.P.B. not be used in + * advertising or publicity pertaining to distribution of the software + * without specific, written prior permission. M.I.T. and the + * M.I.T. S.I.P.B. make no representations about the suitability of + * this software for any purpose. It is provided "as is" without + * express or implied warranty. + */ + +#include <stdio.h> +#ifdef HAVE_UNISTD_H +#include <unistd.h> +#endif +#include "ext2_fs.h" +#include "ext2fs.h" +#include "ext2_internal.h" + +void com_err (const char *whoami, + errcode_t code, + const char *fmt, ...) +{ + if(whoami) + ext2_log_trace("%s: ", whoami); + + ext2_log_trace("error code: %i ", (int) code); + + if(fmt) + ext2_log_trace(fmt); + + ext2_log_trace("\n"); +} diff --git a/portlibs/sources/libext2fs/source/com_err.h b/portlibs/sources/libext2fs/source/com_err.h new file mode 100644 index 00000000..0c31a4ec --- /dev/null +++ b/portlibs/sources/libext2fs/source/com_err.h @@ -0,0 +1,70 @@ +/* + * Header file for common error description library. + * + * Copyright 1988, Student Information Processing Board of the + * Massachusetts Institute of Technology. + * + * For copyright and distribution info, see the documentation supplied + * with this package. + */ + +#if !defined(__COM_ERR_H) && !defined(__COM_ERR_H__) + +#ifdef __GNUC__ +#define COM_ERR_ATTR(x) __attribute__(x) +#else +#define COM_ERR_ATTR(x) +#endif + +#ifndef DEBUG_GEKKO +#define OMIT_COM_ERR +#endif + +#include <stddef.h> +#include <stdarg.h> + +typedef long errcode_t; + +struct error_table { + char const * const * msgs; + long base; + int n_msgs; +}; +struct et_list; + +extern void com_err (const char *, long, const char *, ...) + COM_ERR_ATTR((format(printf, 3, 4))); + +extern void com_err_va (const char *whoami, errcode_t code, const char *fmt, + va_list args) + COM_ERR_ATTR((format(printf, 3, 0))); + +extern char const *error_message (long); +extern void (*com_err_hook) (const char *, long, const char *, va_list); +extern void (*set_com_err_hook (void (*) (const char *, long, + const char *, va_list))) + (const char *, long, const char *, va_list); +extern void (*reset_com_err_hook (void)) (const char *, long, + const char *, va_list); +extern int init_error_table(const char * const *msgs, long base, int count); + +extern errcode_t add_error_table(const struct error_table * et); +extern errcode_t remove_error_table(const struct error_table * et); +extern void add_to_error_table(struct et_list *new_table); + +/* Provided for Heimdall compatibility */ +extern const char *com_right(struct et_list *list, long code); +extern const char *com_right_r(struct et_list *list, long code, char *str, size_t len); +extern void initialize_error_table_r(struct et_list **list, + const char **messages, + int num_errors, + long base); +extern void free_error_table(struct et_list *et); + +/* Provided for compatibility with other com_err libraries */ +extern int et_list_lock(void); +extern int et_list_unlock(void); + +#define __COM_ERR_H +#define __COM_ERR_H__ +#endif /* !defined(__COM_ERR_H) && !defined(__COM_ERR_H__)*/ diff --git a/portlibs/sources/libext2fs/source/config.h b/portlibs/sources/libext2fs/source/config.h new file mode 100644 index 00000000..be09663b --- /dev/null +++ b/portlibs/sources/libext2fs/source/config.h @@ -0,0 +1,10 @@ + +#define HAVE_UNISTD_H 1 +#define HAVE_SYS_STAT_H 1 +#define HAVE_SYS_TYPES_H 1 +#define HAVE_UTIME_H 1 +#define WORDS_BIGENDIAN 1 +#define HAVE_ERRNO_H 1 +#define EXT2_FLAT_INCLUDES 1 +#define HAVE_STRDUP 1 +#define HAVE_SYS_RESOURCE_H 1 diff --git a/portlibs/sources/libext2fs/source/crc16.c b/portlibs/sources/libext2fs/source/crc16.c new file mode 100644 index 00000000..02d81e44 --- /dev/null +++ b/portlibs/sources/libext2fs/source/crc16.c @@ -0,0 +1,73 @@ +/* + * crc16.c + * + * This source code is licensed under the GNU General Public License, + * Version 2. See the file COPYING for more details. + */ + +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif +#include "ext2_types.h" + +#include "crc16.h" + +/** CRC table for the CRC-16. The poly is 0x8005 (x16 + x15 + x2 + 1) */ +static __u16 const crc16_table[256] = { + 0x0000, 0xC0C1, 0xC181, 0x0140, 0xC301, 0x03C0, 0x0280, 0xC241, + 0xC601, 0x06C0, 0x0780, 0xC741, 0x0500, 0xC5C1, 0xC481, 0x0440, + 0xCC01, 0x0CC0, 0x0D80, 0xCD41, 0x0F00, 0xCFC1, 0xCE81, 0x0E40, + 0x0A00, 0xCAC1, 0xCB81, 0x0B40, 0xC901, 0x09C0, 0x0880, 0xC841, + 0xD801, 0x18C0, 0x1980, 0xD941, 0x1B00, 0xDBC1, 0xDA81, 0x1A40, + 0x1E00, 0xDEC1, 0xDF81, 0x1F40, 0xDD01, 0x1DC0, 0x1C80, 0xDC41, + 0x1400, 0xD4C1, 0xD581, 0x1540, 0xD701, 0x17C0, 0x1680, 0xD641, + 0xD201, 0x12C0, 0x1380, 0xD341, 0x1100, 0xD1C1, 0xD081, 0x1040, + 0xF001, 0x30C0, 0x3180, 0xF141, 0x3300, 0xF3C1, 0xF281, 0x3240, + 0x3600, 0xF6C1, 0xF781, 0x3740, 0xF501, 0x35C0, 0x3480, 0xF441, + 0x3C00, 0xFCC1, 0xFD81, 0x3D40, 0xFF01, 0x3FC0, 0x3E80, 0xFE41, + 0xFA01, 0x3AC0, 0x3B80, 0xFB41, 0x3900, 0xF9C1, 0xF881, 0x3840, + 0x2800, 0xE8C1, 0xE981, 0x2940, 0xEB01, 0x2BC0, 0x2A80, 0xEA41, + 0xEE01, 0x2EC0, 0x2F80, 0xEF41, 0x2D00, 0xEDC1, 0xEC81, 0x2C40, + 0xE401, 0x24C0, 0x2580, 0xE541, 0x2700, 0xE7C1, 0xE681, 0x2640, + 0x2200, 0xE2C1, 0xE381, 0x2340, 0xE101, 0x21C0, 0x2080, 0xE041, + 0xA001, 0x60C0, 0x6180, 0xA141, 0x6300, 0xA3C1, 0xA281, 0x6240, + 0x6600, 0xA6C1, 0xA781, 0x6740, 0xA501, 0x65C0, 0x6480, 0xA441, + 0x6C00, 0xACC1, 0xAD81, 0x6D40, 0xAF01, 0x6FC0, 0x6E80, 0xAE41, + 0xAA01, 0x6AC0, 0x6B80, 0xAB41, 0x6900, 0xA9C1, 0xA881, 0x6840, + 0x7800, 0xB8C1, 0xB981, 0x7940, 0xBB01, 0x7BC0, 0x7A80, 0xBA41, + 0xBE01, 0x7EC0, 0x7F80, 0xBF41, 0x7D00, 0xBDC1, 0xBC81, 0x7C40, + 0xB401, 0x74C0, 0x7580, 0xB541, 0x7700, 0xB7C1, 0xB681, 0x7640, + 0x7200, 0xB2C1, 0xB381, 0x7340, 0xB101, 0x71C0, 0x7080, 0xB041, + 0x5000, 0x90C1, 0x9181, 0x5140, 0x9301, 0x53C0, 0x5280, 0x9241, + 0x9601, 0x56C0, 0x5780, 0x9741, 0x5500, 0x95C1, 0x9481, 0x5440, + 0x9C01, 0x5CC0, 0x5D80, 0x9D41, 0x5F00, 0x9FC1, 0x9E81, 0x5E40, + 0x5A00, 0x9AC1, 0x9B81, 0x5B40, 0x9901, 0x59C0, 0x5880, 0x9841, + 0x8801, 0x48C0, 0x4980, 0x8941, 0x4B00, 0x8BC1, 0x8A81, 0x4A40, + 0x4E00, 0x8EC1, 0x8F81, 0x4F40, 0x8D01, 0x4DC0, 0x4C80, 0x8C41, + 0x4400, 0x84C1, 0x8581, 0x4540, 0x8701, 0x47C0, 0x4680, 0x8641, + 0x8201, 0x42C0, 0x4380, 0x8341, 0x4100, 0x81C1, 0x8081, 0x4040 +}; + +/** + * Compute the CRC-16 for the data buffer + * + * @param crc previous CRC value + * @param buffer data pointer + * @param len number of bytes in the buffer + * @return the updated CRC value + */ +crc16_t ext2fs_crc16(crc16_t crc, const void *buffer, unsigned int len) +{ + const unsigned char *cp = buffer; + + while (len--) + /* + * for an unknown reason, PPC treats __u16 as signed + * and keeps doing sign extension on the value. + * Instead, use only the low 16 bits of an unsigned + * int for holding the CRC value to avoid this. + */ + crc = (((crc >> 8) & 0xffU) ^ + crc16_table[(crc ^ *cp++) & 0xffU]) & 0x0000ffffU; + return crc; +} diff --git a/portlibs/sources/libext2fs/source/crc16.h b/portlibs/sources/libext2fs/source/crc16.h new file mode 100644 index 00000000..322e68dd --- /dev/null +++ b/portlibs/sources/libext2fs/source/crc16.h @@ -0,0 +1,26 @@ +/* + * crc16.h - CRC-16 routine + * + * Implements the standard CRC-16: + * Width 16 + * Poly 0x8005 (x16 + x15 + x2 + 1) + * Init 0 + * + * Copyright (c) 2005 Ben Gardner <bgardner@wabtec.com> + * + * This source code is licensed under the GNU General Public License, + * Version 2. See the file COPYING for more details. + */ + +#ifndef __CRC16_H +#define __CRC16_H + +/* for an unknown reason, PPC treats __u16 as signed and keeps doing sign + * extension on the value. Instead, use only the low 16 bits of an + * unsigned int for holding the CRC value to avoid this. + */ +typedef unsigned int crc16_t; + +extern crc16_t ext2fs_crc16(crc16_t crc, const void *buffer, unsigned int len); + +#endif /* __CRC16_H */ diff --git a/portlibs/sources/libext2fs/source/csum.c b/portlibs/sources/libext2fs/source/csum.c new file mode 100644 index 00000000..58e29710 --- /dev/null +++ b/portlibs/sources/libext2fs/source/csum.c @@ -0,0 +1,288 @@ +/* + * csum.c --- checksumming of ext3 structures + * + * Copyright (C) 2006 Cluster File Systems, Inc. + * Copyright (C) 2006, 2007 by Andreas Dilger <adilger@clusterfs.com> + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" +#include "crc16.h" +#include <assert.h> + +#ifndef offsetof +#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER) +#endif + +#ifdef DEBUG +#define STATIC +#else +#define STATIC static +#endif + +STATIC __u16 ext2fs_group_desc_csum(ext2_filsys fs, dgrp_t group) +{ + __u16 crc = 0; + struct ext2_group_desc *desc; + size_t size; + + size = fs->super->s_desc_size; + if (size < EXT2_MIN_DESC_SIZE) + size = EXT2_MIN_DESC_SIZE; + if (size > sizeof(struct ext4_group_desc)) { + printf("%s: illegal s_desc_size(%zd)\n", __func__, size); + size = sizeof(struct ext4_group_desc); + } + + desc = ext2fs_group_desc(fs, fs->group_desc, group); + + if (fs->super->s_feature_ro_compat & EXT4_FEATURE_RO_COMPAT_GDT_CSUM) { + int offset = offsetof(struct ext2_group_desc, bg_checksum); + +#ifdef WORDS_BIGENDIAN + struct ext4_group_desc swabdesc; + + /* Have to swab back to little-endian to do the checksum */ + memcpy(&swabdesc, desc, size); + ext2fs_swap_group_desc2(fs, + (struct ext2_group_desc *) &swabdesc); + desc = (struct ext2_group_desc *) &swabdesc; + + group = ext2fs_swab32(group); +#endif + crc = ext2fs_crc16(~0, fs->super->s_uuid, + sizeof(fs->super->s_uuid)); + crc = ext2fs_crc16(crc, &group, sizeof(group)); + crc = ext2fs_crc16(crc, desc, offset); + offset += sizeof(desc->bg_checksum); /* skip checksum */ + /* for checksum of struct ext4_group_desc do the rest...*/ + if (offset < size) { + crc = ext2fs_crc16(crc, (char *)desc + offset, + size - offset); + } + } + + return crc; +} + +int ext2fs_group_desc_csum_verify(ext2_filsys fs, dgrp_t group) +{ + if (EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM) && + (ext2fs_bg_checksum(fs, group) != + ext2fs_group_desc_csum(fs, group))) + return 0; + + return 1; +} + +void ext2fs_group_desc_csum_set(ext2_filsys fs, dgrp_t group) +{ + if (!EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) + return; + + /* ext2fs_bg_checksum_set() sets the actual checksum field but + * does not calculate the checksum itself. */ + ext2fs_bg_checksum_set(fs, group, ext2fs_group_desc_csum(fs, group)); +} + +static __u32 find_last_inode_ingrp(ext2fs_inode_bitmap bitmap, + __u32 inodes_per_grp, dgrp_t grp_no) +{ + ext2_ino_t i, start_ino, end_ino; + + start_ino = grp_no * inodes_per_grp + 1; + end_ino = start_ino + inodes_per_grp - 1; + + for (i = end_ino; i >= start_ino; i--) { + if (ext2fs_fast_test_inode_bitmap2(bitmap, i)) + return i - start_ino + 1; + } + return inodes_per_grp; +} + +/* update the bitmap flags, set the itable high watermark, and calculate + * checksums for the group descriptors */ +errcode_t ext2fs_set_gdt_csum(ext2_filsys fs) +{ + struct ext2_super_block *sb = fs->super; + int dirty = 0; + dgrp_t i; + + if (!fs->inode_map) + return EXT2_ET_NO_INODE_BITMAP; + + if (!EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) + return 0; + + for (i = 0; i < fs->group_desc_count; i++) { + unsigned int old_csum = ext2fs_bg_checksum(fs, i); + int old_unused = ext2fs_bg_itable_unused(fs, i); + unsigned int old_flags = ext2fs_bg_flags(fs, i); + int old_free_inodes_count = ext2fs_bg_free_inodes_count(fs, i); + + if (old_free_inodes_count == sb->s_inodes_per_group) { + ext2fs_bg_flags_set(fs, i, EXT2_BG_INODE_UNINIT); + ext2fs_bg_itable_unused_set(fs, i, sb->s_inodes_per_group); + } else { + int unused = + sb->s_inodes_per_group - + find_last_inode_ingrp(fs->inode_map, + sb->s_inodes_per_group, i); + + ext2fs_bg_flags_clear(fs, i, EXT2_BG_INODE_UNINIT); + ext2fs_bg_itable_unused_set(fs, i, unused); + } + + ext2fs_group_desc_csum_set(fs, i); + if (old_flags != ext2fs_bg_flags(fs, i)) + dirty = 1; + if (old_unused != ext2fs_bg_itable_unused(fs, i)) + dirty = 1; + if (old_csum != ext2fs_bg_checksum(fs, i)) + dirty = 1; + } + if (dirty) + ext2fs_mark_super_dirty(fs); + return 0; +} + +#ifdef DEBUG +#include "e2p/e2p.h" + +void print_csum(const char *msg, ext2_filsys fs, dgrp_t group) +{ + __u16 crc1, crc2, crc3; + dgrp_t swabgroup; + struct ext2_group_desc *desc = ext2fs_group_desc(fs, fs->group_desc, group); + size_t size; + struct ext2_super_block *sb = fs->super; + int offset = offsetof(struct ext2_group_desc, bg_checksum); +#ifdef WORDS_BIGENDIAN + struct ext4_group_desc swabdesc; +#endif + + size = fs->super->s_desc_size; + if (size < EXT2_MIN_DESC_SIZE) + size = EXT2_MIN_DESC_SIZE; + if (size > sizeof(struct ext4_group_desc)) + size = sizeof(struct ext4_group_desc); +#ifdef WORDS_BIGENDIAN + /* Have to swab back to little-endian to do the checksum */ + memcpy(&swabdesc, desc, size); + ext2fs_swap_group_desc2(fs, (struct ext2_group_desc *) &swabdesc); + desc = (struct ext2_group_desc *) &swabdesc; + + swabgroup = ext2fs_swab32(group); +#else + swabgroup = group; +#endif + + crc1 = ext2fs_crc16(~0, sb->s_uuid, sizeof(fs->super->s_uuid)); + crc2 = ext2fs_crc16(crc1, &swabgroup, sizeof(swabgroup)); + crc3 = ext2fs_crc16(crc2, desc, offset); + offset += sizeof(desc->bg_checksum); /* skip checksum */ + /* for checksum of struct ext4_group_desc do the rest...*/ + if (offset < size) + crc3 = ext2fs_crc16(crc3, (char *)desc + offset, size - offset); + + printf("%s: UUID %s(%04x), grp %u(%04x): %04x=%04x\n", + msg, e2p_uuid2str(sb->s_uuid), crc1, group, crc2, crc3, + ext2fs_group_desc_csum(fs, group)); +} + +unsigned char sb_uuid[16] = { 0x4f, 0x25, 0xe8, 0xcf, 0xe7, 0x97, 0x48, 0x23, + 0xbe, 0xfa, 0xa7, 0x88, 0x4b, 0xae, 0xec, 0xdb }; + +int main(int argc, char **argv) +{ + struct ext2_super_block param; + errcode_t retval; + ext2_filsys fs; + int i; + __u16 csum1, csum2, csum_known = 0xd3a4; + + memset(¶m, 0, sizeof(param)); + ext2fs_blocks_count_set(¶m, 32768); + + retval = ext2fs_initialize("test fs", EXT2_FLAG_64BITS, ¶m, + test_io_manager, &fs); + if (retval) { + com_err("setup", retval, + "While initializing filesystem"); + exit(1); + } + memcpy(fs->super->s_uuid, sb_uuid, 16); + fs->super->s_feature_ro_compat = EXT4_FEATURE_RO_COMPAT_GDT_CSUM; + + for (i=0; i < fs->group_desc_count; i++) { + ext2fs_block_bitmap_loc_set(fs, i, 124); + ext2fs_inode_bitmap_loc_set(fs, i, 125); + ext2fs_inode_table_loc_set(fs, i, 126); + ext2fs_bg_free_blocks_count_set(fs, i, 31119); + ext2fs_bg_free_inodes_count_set(fs, i, 15701); + ext2fs_bg_used_dirs_count_set(fs, i, 2); + ext2fs_bg_flags_zap(fs, i); + }; + + csum1 = ext2fs_group_desc_csum(fs, 0); + print_csum("csum0000", fs, 0); + + if (csum1 != csum_known) { + printf("checksum for group 0 should be %04x\n", csum_known); + exit(1); + } + csum2 = ext2fs_group_desc_csum(fs, 1); + print_csum("csum0001", fs, 1); + if (csum1 == csum2) { + printf("checksums for different groups shouldn't match\n"); + exit(1); + } + csum2 = ext2fs_group_desc_csum(fs, 2); + print_csum("csumffff", fs, 2); + if (csum1 == csum2) { + printf("checksums for different groups shouldn't match\n"); + exit(1); + } + ext2fs_bg_checksum_set(fs, 0, csum1); + csum2 = ext2fs_group_desc_csum(fs, 0); + print_csum("csum_set", fs, 0); + if (csum1 != csum2) { + printf("checksums should not depend on checksum field\n"); + exit(1); + } + if (!ext2fs_group_desc_csum_verify(fs, 0)) { + printf("checksums should verify against gd_checksum\n"); + exit(1); + } + memset(fs->super->s_uuid, 0x30, sizeof(fs->super->s_uuid)); + print_csum("new_uuid", fs, 0); + if (ext2fs_group_desc_csum_verify(fs, 0) != 0) { + printf("checksums for different filesystems shouldn't match\n"); + exit(1); + } + csum1 = ext2fs_group_desc_csum(fs, 0); + ext2fs_bg_checksum_set(fs, 0, csum1); + print_csum("csum_new", fs, 0); + ext2fs_bg_free_blocks_count_set(fs, 0, 1); + csum2 = ext2fs_group_desc_csum(fs, 0); + print_csum("csum_blk", fs, 0); + if (csum1 == csum2) { + printf("checksums for different data shouldn't match\n"); + exit(1); + } + + return 0; +} +#endif diff --git a/portlibs/sources/libext2fs/source/dblist.c b/portlibs/sources/libext2fs/source/dblist.c new file mode 100644 index 00000000..8ee61b4c --- /dev/null +++ b/portlibs/sources/libext2fs/source/dblist.c @@ -0,0 +1,414 @@ +/* + * dblist.c -- directory block list functions + * + * Copyright 1997 by Theodore Ts'o + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <string.h> +#include <time.h> + +#include "ext2_fs.h" +#include "ext2fsP.h" + +static EXT2_QSORT_TYPE dir_block_cmp(const void *a, const void *b); +static EXT2_QSORT_TYPE dir_block_cmp2(const void *a, const void *b); +static EXT2_QSORT_TYPE (*sortfunc32)(const void *a, const void *b); + +/* + * Returns the number of directories in the filesystem as reported by + * the group descriptors. Of course, the group descriptors could be + * wrong! + */ +errcode_t ext2fs_get_num_dirs(ext2_filsys fs, ext2_ino_t *ret_num_dirs) +{ + dgrp_t i; + ext2_ino_t num_dirs, max_dirs; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + num_dirs = 0; + max_dirs = fs->super->s_inodes_per_group; + for (i = 0; i < fs->group_desc_count; i++) { + if (ext2fs_bg_used_dirs_count(fs, i) > max_dirs) + num_dirs += max_dirs / 8; + else + num_dirs += ext2fs_bg_used_dirs_count(fs, i); + } + if (num_dirs > fs->super->s_inodes_count) + num_dirs = fs->super->s_inodes_count; + + *ret_num_dirs = num_dirs; + + return 0; +} + +/* + * helper function for making a new directory block list (for + * initialize and copy). + */ +static errcode_t make_dblist(ext2_filsys fs, ext2_ino_t size, + ext2_ino_t count, + struct ext2_db_entry2 *list, + ext2_dblist *ret_dblist) +{ + ext2_dblist dblist; + errcode_t retval; + ext2_ino_t num_dirs; + size_t len; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if ((ret_dblist == 0) && fs->dblist && + (fs->dblist->magic == EXT2_ET_MAGIC_DBLIST)) + return 0; + + retval = ext2fs_get_mem(sizeof(struct ext2_struct_dblist), &dblist); + if (retval) + return retval; + memset(dblist, 0, sizeof(struct ext2_struct_dblist)); + + dblist->magic = EXT2_ET_MAGIC_DBLIST; + dblist->fs = fs; + if (size) + dblist->size = size; + else { + retval = ext2fs_get_num_dirs(fs, &num_dirs); + if (retval) + goto cleanup; + dblist->size = (num_dirs * 2) + 12; + } + len = (size_t) sizeof(struct ext2_db_entry2) * dblist->size; + dblist->count = count; + retval = ext2fs_get_array(dblist->size, sizeof(struct ext2_db_entry2), + &dblist->list); + if (retval) + goto cleanup; + + if (list) + memcpy(dblist->list, list, len); + else + memset(dblist->list, 0, len); + if (ret_dblist) + *ret_dblist = dblist; + else + fs->dblist = dblist; + return 0; +cleanup: + if (dblist) + ext2fs_free_mem(&dblist); + return retval; +} + +/* + * Initialize a directory block list + */ +errcode_t ext2fs_init_dblist(ext2_filsys fs, ext2_dblist *ret_dblist) +{ + ext2_dblist dblist; + errcode_t retval; + + retval = make_dblist(fs, 0, 0, 0, &dblist); + if (retval) + return retval; + + dblist->sorted = 1; + if (ret_dblist) + *ret_dblist = dblist; + else + fs->dblist = dblist; + + return 0; +} + +/* + * Copy a directory block list + */ +errcode_t ext2fs_copy_dblist(ext2_dblist src, ext2_dblist *dest) +{ + ext2_dblist dblist; + errcode_t retval; + + retval = make_dblist(src->fs, src->size, src->count, src->list, + &dblist); + if (retval) + return retval; + dblist->sorted = src->sorted; + *dest = dblist; + return 0; +} + +/* + * Close a directory block list + * + * (moved to closefs.c) + */ + + +/* + * Add a directory block to the directory block list + */ +errcode_t ext2fs_add_dir_block2(ext2_dblist dblist, ext2_ino_t ino, + blk64_t blk, e2_blkcnt_t blockcnt) +{ + struct ext2_db_entry2 *new_entry; + errcode_t retval; + unsigned long old_size; + + EXT2_CHECK_MAGIC(dblist, EXT2_ET_MAGIC_DBLIST); + + if (dblist->count >= dblist->size) { + old_size = dblist->size * sizeof(struct ext2_db_entry2); + dblist->size += dblist->size > 200 ? dblist->size / 2 : 100; + retval = ext2fs_resize_mem(old_size, (size_t) dblist->size * + sizeof(struct ext2_db_entry2), + &dblist->list); + if (retval) { + dblist->size -= 100; + return retval; + } + } + new_entry = dblist->list + ( dblist->count++); + new_entry->blk = blk; + new_entry->ino = ino; + new_entry->blockcnt = blockcnt; + + dblist->sorted = 0; + + return 0; +} + +/* + * Change the directory block to the directory block list + */ +errcode_t ext2fs_set_dir_block2(ext2_dblist dblist, ext2_ino_t ino, + blk64_t blk, e2_blkcnt_t blockcnt) +{ + dgrp_t i; + + EXT2_CHECK_MAGIC(dblist, EXT2_ET_MAGIC_DBLIST); + + for (i=0; i < dblist->count; i++) { + if ((dblist->list[i].ino != ino) || + (dblist->list[i].blockcnt != blockcnt)) + continue; + dblist->list[i].blk = blk; + dblist->sorted = 0; + return 0; + } + return EXT2_ET_DB_NOT_FOUND; +} + +void ext2fs_dblist_sort2(ext2_dblist dblist, + EXT2_QSORT_TYPE (*sortfunc)(const void *, + const void *)) +{ + if (!sortfunc) + sortfunc = dir_block_cmp2; + qsort(dblist->list, (size_t) dblist->count, + sizeof(struct ext2_db_entry2), sortfunc); + dblist->sorted = 1; +} + +/* + * This function iterates over the directory block list + */ +errcode_t ext2fs_dblist_iterate2(ext2_dblist dblist, + int (*func)(ext2_filsys fs, + struct ext2_db_entry2 *db_info, + void *priv_data), + void *priv_data) +{ + unsigned long long i; + int ret; + + EXT2_CHECK_MAGIC(dblist, EXT2_ET_MAGIC_DBLIST); + + if (!dblist->sorted) + ext2fs_dblist_sort2(dblist, 0); + for (i=0; i < dblist->count; i++) { + ret = (*func)(dblist->fs, &dblist->list[i], priv_data); + if (ret & DBLIST_ABORT) + return 0; + } + return 0; +} + +static EXT2_QSORT_TYPE dir_block_cmp2(const void *a, const void *b) +{ + const struct ext2_db_entry2 *db_a = + (const struct ext2_db_entry2 *) a; + const struct ext2_db_entry2 *db_b = + (const struct ext2_db_entry2 *) b; + + if (db_a->blk != db_b->blk) + return (int) (db_a->blk - db_b->blk); + + if (db_a->ino != db_b->ino) + return (int) (db_a->ino - db_b->ino); + + return (db_a->blockcnt - db_b->blockcnt); +} + +blk64_t ext2fs_dblist_count2(ext2_dblist dblist) +{ + return dblist->count; +} + +errcode_t ext2fs_dblist_get_last2(ext2_dblist dblist, + struct ext2_db_entry2 **entry) +{ + EXT2_CHECK_MAGIC(dblist, EXT2_ET_MAGIC_DBLIST); + + if (dblist->count == 0) + return EXT2_ET_DBLIST_EMPTY; + + if (entry) + *entry = dblist->list + ( dblist->count-1); + return 0; +} + +errcode_t ext2fs_dblist_drop_last(ext2_dblist dblist) +{ + EXT2_CHECK_MAGIC(dblist, EXT2_ET_MAGIC_DBLIST); + + if (dblist->count == 0) + return EXT2_ET_DBLIST_EMPTY; + + dblist->count--; + return 0; +} + +/* + * Legacy 32-bit versions + */ + +/* + * Add a directory block to the directory block list + */ +errcode_t ext2fs_add_dir_block(ext2_dblist dblist, ext2_ino_t ino, blk_t blk, + int blockcnt) +{ + return ext2fs_add_dir_block2(dblist, ino, blk, blockcnt); +} + +/* + * Change the directory block to the directory block list + */ +errcode_t ext2fs_set_dir_block(ext2_dblist dblist, ext2_ino_t ino, blk_t blk, + int blockcnt) +{ + return ext2fs_set_dir_block2(dblist, ino, blk, blockcnt); +} + +void ext2fs_dblist_sort(ext2_dblist dblist, + EXT2_QSORT_TYPE (*sortfunc)(const void *, + const void *)) +{ + if (sortfunc) { + sortfunc32 = sortfunc; + sortfunc = dir_block_cmp; + } else + sortfunc = dir_block_cmp2; + qsort(dblist->list, (size_t) dblist->count, + sizeof(struct ext2_db_entry2), sortfunc); + dblist->sorted = 1; +} + +/* + * This function iterates over the directory block list + */ +struct iterate_passthrough { + int (*func)(ext2_filsys fs, + struct ext2_db_entry *db_info, + void *priv_data); + void *priv_data; +}; + +static int passthrough_func(ext2_filsys fs, + struct ext2_db_entry2 *db_info, + void *priv_data) +{ + struct iterate_passthrough *p = priv_data; + struct ext2_db_entry db; + int ret; + + db.ino = db_info->ino; + db.blk = (blk_t) db_info->blk; + db.blockcnt = (int) db_info->blockcnt; + ret = (p->func)(fs, &db, p->priv_data); + db_info->ino = db.ino; + db_info->blk = db.blk; + db_info->blockcnt = db.blockcnt; + return ret; +} + +errcode_t ext2fs_dblist_iterate(ext2_dblist dblist, + int (*func)(ext2_filsys fs, + struct ext2_db_entry *db_info, + void *priv_data), + void *priv_data) +{ + struct iterate_passthrough pass; + + EXT2_CHECK_MAGIC(dblist, EXT2_ET_MAGIC_DBLIST); + pass.func = func; + pass.priv_data = priv_data; + + return ext2fs_dblist_iterate2(dblist, passthrough_func, &pass); +} + +static EXT2_QSORT_TYPE dir_block_cmp(const void *a, const void *b) +{ + const struct ext2_db_entry2 *db_a = + (const struct ext2_db_entry2 *) a; + const struct ext2_db_entry2 *db_b = + (const struct ext2_db_entry2 *) b; + + struct ext2_db_entry a32, b32; + + a32.ino = db_a->ino; a32.blk = db_a->blk; + a32.blockcnt = db_a->blockcnt; + + b32.ino = db_b->ino; b32.blk = db_b->blk; + b32.blockcnt = db_b->blockcnt; + + return sortfunc32(&a32, &b32); +} + +int ext2fs_dblist_count(ext2_dblist dblist) +{ + return dblist->count; +} + +errcode_t ext2fs_dblist_get_last(ext2_dblist dblist, + struct ext2_db_entry **entry) +{ + EXT2_CHECK_MAGIC(dblist, EXT2_ET_MAGIC_DBLIST); + static struct ext2_db_entry ret_entry; + struct ext2_db_entry2 *last; + + if (dblist->count == 0) + return EXT2_ET_DBLIST_EMPTY; + + if (!entry) + return 0; + + last = dblist->list + dblist->count -1; + + ret_entry.ino = last->ino; + ret_entry.blk = last->blk; + ret_entry.blockcnt = last->blockcnt; + *entry = &ret_entry; + + return 0; +} + diff --git a/portlibs/sources/libext2fs/source/dblist_dir.c b/portlibs/sources/libext2fs/source/dblist_dir.c new file mode 100644 index 00000000..07ed8afa --- /dev/null +++ b/portlibs/sources/libext2fs/source/dblist_dir.c @@ -0,0 +1,79 @@ +/* + * dblist_dir.c --- iterate by directory entry + * + * Copyright 1997 by Theodore Ts'o + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <string.h> +#include <time.h> + +#include "ext2_fs.h" +#include "ext2fsP.h" + +static int db_dir_proc(ext2_filsys fs, struct ext2_db_entry2 *db_info, + void *priv_data); + +errcode_t ext2fs_dblist_dir_iterate(ext2_dblist dblist, + int flags, + char *block_buf, + int (*func)(ext2_ino_t dir, + int entry, + struct ext2_dir_entry *dirent, + int offset, + int blocksize, + char *buf, + void *priv_data), + void *priv_data) +{ + errcode_t retval; + struct dir_context ctx; + + EXT2_CHECK_MAGIC(dblist, EXT2_ET_MAGIC_DBLIST); + + ctx.dir = 0; + ctx.flags = flags; + if (block_buf) + ctx.buf = block_buf; + else { + retval = ext2fs_get_mem(dblist->fs->blocksize, &ctx.buf); + if (retval) + return retval; + } + ctx.func = func; + ctx.priv_data = priv_data; + ctx.errcode = 0; + + retval = ext2fs_dblist_iterate2(dblist, db_dir_proc, &ctx); + + if (!block_buf) + ext2fs_free_mem(&ctx.buf); + if (retval) + return retval; + return ctx.errcode; +} + +static int db_dir_proc(ext2_filsys fs, struct ext2_db_entry2 *db_info, + void *priv_data) +{ + struct dir_context *ctx; + int ret; + + ctx = (struct dir_context *) priv_data; + ctx->dir = db_info->ino; + ctx->errcode = 0; + + ret = ext2fs_process_dir_block(fs, &db_info->blk, + db_info->blockcnt, 0, 0, priv_data); + if ((ret & BLOCK_ABORT) && !ctx->errcode) + return DBLIST_ABORT; + return 0; +} diff --git a/portlibs/sources/libext2fs/source/dir_iterate.c b/portlibs/sources/libext2fs/source/dir_iterate.c new file mode 100644 index 00000000..88f6b476 --- /dev/null +++ b/portlibs/sources/libext2fs/source/dir_iterate.c @@ -0,0 +1,270 @@ +/* + * dir_iterate.c --- ext2fs directory iteration operations + * + * Copyright (C) 1993, 1994, 1994, 1995, 1996, 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "ext2_fs.h" +#include "ext2fsP.h" + +#define EXT4_MAX_REC_LEN ((1<<16)-1) + +errcode_t ext2fs_get_rec_len(ext2_filsys fs, + struct ext2_dir_entry *dirent, + unsigned int *rec_len) +{ + unsigned int len = dirent->rec_len; + + if (fs->blocksize < 65536) + *rec_len = len; + else if (len == EXT4_MAX_REC_LEN || len == 0) + *rec_len = fs->blocksize; + else + *rec_len = (len & 65532) | ((len & 3) << 16); + return 0; +} + +errcode_t ext2fs_set_rec_len(ext2_filsys fs, + unsigned int len, + struct ext2_dir_entry *dirent) +{ + if ((len > fs->blocksize) || (fs->blocksize > (1 << 18)) || (len & 3)) + return EINVAL; + if (len < 65536) { + dirent->rec_len = len; + return 0; + } + if (len == fs->blocksize) { + if (fs->blocksize == 65536) + dirent->rec_len = EXT4_MAX_REC_LEN; + else + dirent->rec_len = 0; + } else + dirent->rec_len = (len & 65532) | ((len >> 16) & 3); + return 0; +} + +/* + * This function checks to see whether or not a potential deleted + * directory entry looks valid. What we do is check the deleted entry + * and each successive entry to make sure that they all look valid and + * that the last deleted entry ends at the beginning of the next + * undeleted entry. Returns 1 if the deleted entry looks valid, zero + * if not valid. + */ +static int ext2fs_validate_entry(ext2_filsys fs, char *buf, + unsigned int offset, + unsigned int final_offset) +{ + struct ext2_dir_entry *dirent; + unsigned int rec_len; +#define DIRENT_MIN_LENGTH 12 + + while ((offset < final_offset) && + (offset <= fs->blocksize - DIRENT_MIN_LENGTH)) { + dirent = (struct ext2_dir_entry *)(buf + offset); + if (ext2fs_get_rec_len(fs, dirent, &rec_len)) + return 0; + offset += rec_len; + if ((rec_len < 8) || + ((rec_len % 4) != 0) || + ((((unsigned) dirent->name_len & 0xFF)+8) > rec_len)) + return 0; + } + return (offset == final_offset); +} + +errcode_t ext2fs_dir_iterate2(ext2_filsys fs, + ext2_ino_t dir, + int flags, + char *block_buf, + int (*func)(ext2_ino_t dir, + int entry, + struct ext2_dir_entry *dirent, + int offset, + int blocksize, + char *buf, + void *priv_data), + void *priv_data) +{ + struct dir_context ctx; + errcode_t retval; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + retval = ext2fs_check_directory(fs, dir); + if (retval) + return retval; + + ctx.dir = dir; + ctx.flags = flags; + if (block_buf) + ctx.buf = block_buf; + else { + retval = ext2fs_get_mem(fs->blocksize, &ctx.buf); + if (retval) + return retval; + } + ctx.func = func; + ctx.priv_data = priv_data; + ctx.errcode = 0; + retval = ext2fs_block_iterate3(fs, dir, BLOCK_FLAG_READ_ONLY, 0, + ext2fs_process_dir_block, &ctx); + if (!block_buf) + ext2fs_free_mem(&ctx.buf); + if (retval) + return retval; + return ctx.errcode; +} + +struct xlate { + int (*func)(struct ext2_dir_entry *dirent, + int offset, + int blocksize, + char *buf, + void *priv_data); + void *real_private; +}; + +static int xlate_func(ext2_ino_t dir EXT2FS_ATTR((unused)), + int entry EXT2FS_ATTR((unused)), + struct ext2_dir_entry *dirent, int offset, + int blocksize, char *buf, void *priv_data) +{ + struct xlate *xl = (struct xlate *) priv_data; + + return (*xl->func)(dirent, offset, blocksize, buf, xl->real_private); +} + +extern errcode_t ext2fs_dir_iterate(ext2_filsys fs, + ext2_ino_t dir, + int flags, + char *block_buf, + int (*func)(struct ext2_dir_entry *dirent, + int offset, + int blocksize, + char *buf, + void *priv_data), + void *priv_data) +{ + struct xlate xl; + + xl.real_private = priv_data; + xl.func = func; + + return ext2fs_dir_iterate2(fs, dir, flags, block_buf, + xlate_func, &xl); +} + + +/* + * Helper function which is private to this module. Used by + * ext2fs_dir_iterate() and ext2fs_dblist_dir_iterate() + */ +int ext2fs_process_dir_block(ext2_filsys fs, + blk64_t *blocknr, + e2_blkcnt_t blockcnt, + blk64_t ref_block EXT2FS_ATTR((unused)), + int ref_offset EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct dir_context *ctx = (struct dir_context *) priv_data; + unsigned int offset = 0; + unsigned int next_real_entry = 0; + int ret = 0; + int changed = 0; + int do_abort = 0; + unsigned int rec_len, size; + int entry; + struct ext2_dir_entry *dirent; + + if (blockcnt < 0) + return 0; + + entry = blockcnt ? DIRENT_OTHER_FILE : DIRENT_DOT_FILE; + + ctx->errcode = ext2fs_read_dir_block3(fs, *blocknr, ctx->buf, 0); + if (ctx->errcode) + return BLOCK_ABORT; + + while (offset < fs->blocksize) { + dirent = (struct ext2_dir_entry *) (ctx->buf + offset); + if (ext2fs_get_rec_len(fs, dirent, &rec_len)) + return BLOCK_ABORT; + if (((offset + rec_len) > fs->blocksize) || + (rec_len < 8) || + ((rec_len % 4) != 0) || + ((((unsigned) dirent->name_len & 0xFF)+8) > rec_len)) { + ctx->errcode = EXT2_ET_DIR_CORRUPTED; + return BLOCK_ABORT; + } + if (!dirent->inode && + !(ctx->flags & DIRENT_FLAG_INCLUDE_EMPTY)) + goto next; + + ret = (ctx->func)(ctx->dir, + (next_real_entry > offset) ? + DIRENT_DELETED_FILE : entry, + dirent, offset, + fs->blocksize, ctx->buf, + ctx->priv_data); + if (entry < DIRENT_OTHER_FILE) + entry++; + + if (ret & DIRENT_CHANGED) { + if (ext2fs_get_rec_len(fs, dirent, &rec_len)) + return BLOCK_ABORT; + changed++; + } + if (ret & DIRENT_ABORT) { + do_abort++; + break; + } +next: + if (next_real_entry == offset) + next_real_entry += rec_len; + + if (ctx->flags & DIRENT_FLAG_INCLUDE_REMOVED) { + size = ((dirent->name_len & 0xFF) + 11) & ~3; + + if (rec_len != size) { + unsigned int final_offset; + + final_offset = offset + rec_len; + offset += size; + while (offset < final_offset && + !ext2fs_validate_entry(fs, ctx->buf, + offset, + final_offset)) + offset += 4; + continue; + } + } + offset += rec_len; + } + + if (changed) { + ctx->errcode = ext2fs_write_dir_block3(fs, *blocknr, ctx->buf, + 0); + if (ctx->errcode) + return BLOCK_ABORT; + } + if (do_abort) + return BLOCK_ABORT; + return 0; +} + diff --git a/portlibs/sources/libext2fs/source/dirblock.c b/portlibs/sources/libext2fs/source/dirblock.c new file mode 100644 index 00000000..73e1f0ab --- /dev/null +++ b/portlibs/sources/libext2fs/source/dirblock.c @@ -0,0 +1,126 @@ +/* + * dirblock.c --- directory block routines. + * + * Copyright (C) 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <string.h> +#include <time.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +errcode_t ext2fs_read_dir_block3(ext2_filsys fs, blk64_t block, + void *buf, int flags EXT2FS_ATTR((unused))) +{ + errcode_t retval; + char *p, *end; + struct ext2_dir_entry *dirent; + unsigned int name_len, rec_len; + + + retval = io_channel_read_blk64(fs->io, block, 1, buf); + if (retval) + return retval; + + p = (char *) buf; + end = (char *) buf + fs->blocksize; + while (p < end-8) { + dirent = (struct ext2_dir_entry *) p; +#ifdef WORDS_BIGENDIAN + dirent->inode = ext2fs_swab32(dirent->inode); + dirent->rec_len = ext2fs_swab16(dirent->rec_len); + dirent->name_len = ext2fs_swab16(dirent->name_len); +#endif + name_len = dirent->name_len; +#ifdef WORDS_BIGENDIAN + if (flags & EXT2_DIRBLOCK_V2_STRUCT) + dirent->name_len = ext2fs_swab16(dirent->name_len); +#endif + if ((retval = ext2fs_get_rec_len(fs, dirent, &rec_len)) != 0) + return retval; + if ((rec_len < 8) || (rec_len % 4)) { + rec_len = 8; + retval = EXT2_ET_DIR_CORRUPTED; + } else if (((name_len & 0xFF) + 8) > rec_len) + retval = EXT2_ET_DIR_CORRUPTED; + p += rec_len; + } + return retval; +} + +errcode_t ext2fs_read_dir_block2(ext2_filsys fs, blk_t block, + void *buf, int flags EXT2FS_ATTR((unused))) +{ + return ext2fs_read_dir_block3(fs, block, buf, flags); +} + +errcode_t ext2fs_read_dir_block(ext2_filsys fs, blk_t block, + void *buf) +{ + return ext2fs_read_dir_block3(fs, block, buf, 0); +} + + +errcode_t ext2fs_write_dir_block3(ext2_filsys fs, blk64_t block, + void *inbuf, int flags EXT2FS_ATTR((unused))) +{ +#ifdef WORDS_BIGENDIAN + errcode_t retval; + char *p, *end; + char *buf = 0; + unsigned int rec_len; + struct ext2_dir_entry *dirent; + + retval = ext2fs_get_mem(fs->blocksize, &buf); + if (retval) + return retval; + memcpy(buf, inbuf, fs->blocksize); + p = buf; + end = buf + fs->blocksize; + while (p < end) { + dirent = (struct ext2_dir_entry *) p; + if ((retval = ext2fs_get_rec_len(fs, dirent, &rec_len)) != 0) + return retval; + if ((rec_len < 8) || + (rec_len % 4)) { + ext2fs_free_mem(&buf); + return (EXT2_ET_DIR_CORRUPTED); + } + p += rec_len; + dirent->inode = ext2fs_swab32(dirent->inode); + dirent->rec_len = ext2fs_swab16(dirent->rec_len); + dirent->name_len = ext2fs_swab16(dirent->name_len); + + if (flags & EXT2_DIRBLOCK_V2_STRUCT) + dirent->name_len = ext2fs_swab16(dirent->name_len); + } + retval = io_channel_write_blk64(fs->io, block, 1, buf); + ext2fs_free_mem(&buf); + return retval; +#else + return io_channel_write_blk64(fs->io, block, 1, (char *) inbuf); +#endif +} + +errcode_t ext2fs_write_dir_block2(ext2_filsys fs, blk_t block, + void *inbuf, int flags EXT2FS_ATTR((unused))) +{ + return ext2fs_write_dir_block3(fs, block, inbuf, flags); +} + +errcode_t ext2fs_write_dir_block(ext2_filsys fs, blk_t block, + void *inbuf) +{ + return ext2fs_write_dir_block3(fs, block, inbuf, 0); +} + diff --git a/portlibs/sources/libext2fs/source/dirhash.c b/portlibs/sources/libext2fs/source/dirhash.c new file mode 100644 index 00000000..a0697069 --- /dev/null +++ b/portlibs/sources/libext2fs/source/dirhash.c @@ -0,0 +1,257 @@ +/* + * dirhash.c -- Calculate the hash of a directory entry + * + * Copyright (c) 2001 Daniel Phillips + * + * Copyright (c) 2002 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +/* + * Keyed 32-bit hash function using TEA in a Davis-Meyer function + * H0 = Key + * Hi = E Mi(Hi-1) + Hi-1 + * + * (see Applied Cryptography, 2nd edition, p448). + * + * Jeremy Fitzhardinge <jeremy@zip.com.au> 1998 + * + * This code is made available under the terms of the GPL + */ +#define DELTA 0x9E3779B9 + +static void TEA_transform(__u32 buf[4], __u32 const in[]) +{ + __u32 sum = 0; + __u32 b0 = buf[0], b1 = buf[1]; + __u32 a = in[0], b = in[1], c = in[2], d = in[3]; + int n = 16; + + do { + sum += DELTA; + b0 += ((b1 << 4)+a) ^ (b1+sum) ^ ((b1 >> 5)+b); + b1 += ((b0 << 4)+c) ^ (b0+sum) ^ ((b0 >> 5)+d); + } while(--n); + + buf[0] += b0; + buf[1] += b1; +} + +/* F, G and H are basic MD4 functions: selection, majority, parity */ +#define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z)))) +#define G(x, y, z) (((x) & (y)) + (((x) ^ (y)) & (z))) +#define H(x, y, z) ((x) ^ (y) ^ (z)) + +/* + * The generic round function. The application is so specific that + * we don't bother protecting all the arguments with parens, as is generally + * good macro practice, in favor of extra legibility. + * Rotation is separate from addition to prevent recomputation + */ +#define ROUND(f, a, b, c, d, x, s) \ + (a += f(b, c, d) + x, a = (a << s) | (a >> (32-s))) +#define K1 0 +#define K2 013240474631UL +#define K3 015666365641UL + +/* + * Basic cut-down MD4 transform. Returns only 32 bits of result. + */ +static void halfMD4Transform (__u32 buf[4], __u32 const in[]) +{ + __u32 a = buf[0], b = buf[1], c = buf[2], d = buf[3]; + + /* Round 1 */ + ROUND(F, a, b, c, d, in[0] + K1, 3); + ROUND(F, d, a, b, c, in[1] + K1, 7); + ROUND(F, c, d, a, b, in[2] + K1, 11); + ROUND(F, b, c, d, a, in[3] + K1, 19); + ROUND(F, a, b, c, d, in[4] + K1, 3); + ROUND(F, d, a, b, c, in[5] + K1, 7); + ROUND(F, c, d, a, b, in[6] + K1, 11); + ROUND(F, b, c, d, a, in[7] + K1, 19); + + /* Round 2 */ + ROUND(G, a, b, c, d, in[1] + K2, 3); + ROUND(G, d, a, b, c, in[3] + K2, 5); + ROUND(G, c, d, a, b, in[5] + K2, 9); + ROUND(G, b, c, d, a, in[7] + K2, 13); + ROUND(G, a, b, c, d, in[0] + K2, 3); + ROUND(G, d, a, b, c, in[2] + K2, 5); + ROUND(G, c, d, a, b, in[4] + K2, 9); + ROUND(G, b, c, d, a, in[6] + K2, 13); + + /* Round 3 */ + ROUND(H, a, b, c, d, in[3] + K3, 3); + ROUND(H, d, a, b, c, in[7] + K3, 9); + ROUND(H, c, d, a, b, in[2] + K3, 11); + ROUND(H, b, c, d, a, in[6] + K3, 15); + ROUND(H, a, b, c, d, in[1] + K3, 3); + ROUND(H, d, a, b, c, in[5] + K3, 9); + ROUND(H, c, d, a, b, in[0] + K3, 11); + ROUND(H, b, c, d, a, in[4] + K3, 15); + + buf[0] += a; + buf[1] += b; + buf[2] += c; + buf[3] += d; +} + +#undef ROUND +#undef F +#undef G +#undef H +#undef K1 +#undef K2 +#undef K3 + +/* The old legacy hash */ +static ext2_dirhash_t dx_hack_hash (const char *name, int len, + int unsigned_flag) +{ + __u32 hash, hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9; + const unsigned char *ucp = (const unsigned char *) name; + const signed char *scp = (const signed char *) name; + int c; + + while (len--) { + if (unsigned_flag) + c = (int) *ucp++; + else + c = (int) *scp++; + hash = hash1 + (hash0 ^ (c * 7152373)); + + if (hash & 0x80000000) hash -= 0x7fffffff; + hash1 = hash0; + hash0 = hash; + } + return (hash0 << 1); +} + +static void str2hashbuf(const char *msg, int len, __u32 *buf, int num, + int unsigned_flag) +{ + __u32 pad, val; + int i, c; + const unsigned char *ucp = (const unsigned char *) msg; + const signed char *scp = (const signed char *) msg; + + pad = (__u32)len | ((__u32)len << 8); + pad |= pad << 16; + + val = pad; + if (len > num*4) + len = num * 4; + for (i=0; i < len; i++) { + if ((i % 4) == 0) + val = pad; + if (unsigned_flag) + c = (int) ucp[i]; + else + c = (int) scp[i]; + + val = c + (val << 8); + if ((i % 4) == 3) { + *buf++ = val; + val = pad; + num--; + } + } + if (--num >= 0) + *buf++ = val; + while (--num >= 0) + *buf++ = pad; +} + +/* + * Returns the hash of a filename. If len is 0 and name is NULL, then + * this function can be used to test whether or not a hash version is + * supported. + * + * The seed is an 4 longword (32 bits) "secret" which can be used to + * uniquify a hash. If the seed is all zero's, then some default seed + * may be used. + * + * A particular hash version specifies whether or not the seed is + * represented, and whether or not the returned hash is 32 bits or 64 + * bits. 32 bit hashes will return 0 for the minor hash. + */ +errcode_t ext2fs_dirhash(int version, const char *name, int len, + const __u32 *seed, + ext2_dirhash_t *ret_hash, + ext2_dirhash_t *ret_minor_hash) +{ + __u32 hash; + __u32 minor_hash = 0; + const char *p; + int i; + __u32 in[8], buf[4]; + int unsigned_flag = 0; + + /* Initialize the default seed for the hash checksum functions */ + buf[0] = 0x67452301; + buf[1] = 0xefcdab89; + buf[2] = 0x98badcfe; + buf[3] = 0x10325476; + + /* Check to see if the seed is all zero's */ + if (seed) { + for (i=0; i < 4; i++) { + if (seed[i]) + break; + } + if (i < 4) + memcpy(buf, seed, sizeof(buf)); + } + + switch (version) { + case EXT2_HASH_LEGACY_UNSIGNED: + unsigned_flag++; + case EXT2_HASH_LEGACY: + hash = dx_hack_hash(name, len, unsigned_flag); + break; + case EXT2_HASH_HALF_MD4_UNSIGNED: + unsigned_flag++; + case EXT2_HASH_HALF_MD4: + p = name; + while (len > 0) { + str2hashbuf(p, len, in, 8, unsigned_flag); + halfMD4Transform(buf, in); + len -= 32; + p += 32; + } + minor_hash = buf[2]; + hash = buf[1]; + break; + case EXT2_HASH_TEA_UNSIGNED: + unsigned_flag++; + case EXT2_HASH_TEA: + p = name; + while (len > 0) { + str2hashbuf(p, len, in, 4, unsigned_flag); + TEA_transform(buf, in); + len -= 16; + p += 16; + } + hash = buf[0]; + minor_hash = buf[1]; + break; + default: + *ret_hash = 0; + return EXT2_ET_DIRHASH_UNSUPP; + } + *ret_hash = hash & ~1; + if (ret_minor_hash) + *ret_minor_hash = minor_hash; + return 0; +} diff --git a/portlibs/sources/libext2fs/source/disc_cache.c b/portlibs/sources/libext2fs/source/disc_cache.c new file mode 100644 index 00000000..2a9ad05c --- /dev/null +++ b/portlibs/sources/libext2fs/source/disc_cache.c @@ -0,0 +1,374 @@ +/* + cache.c + The cache is not visible to the user. It should be flushed + when any file is closed or changes are made to the filesystem. + + This cache implements a least-used-page replacement policy. This will + distribute sectors evenly over the pages, so if less than the maximum + pages are used at once, they should all eventually remain in the cache. + This also has the benefit of throwing out old sectors, so as not to keep + too many stale pages around. + + Copyright (c) 2006 Michael "Chishm" Chisholm + Copyright (c) 2009 shareese, rodries + Copyright (c) 2010 Dimok + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#include <ogc/lwp_watchdog.h> +#include <string.h> +#include <limits.h> + +#include "disc_cache.h" +#include "bit_ops.h" +#include "mem_allocate.h" + +#define CACHE_FREE UINT_MAX + +CACHE* cache_constructor (unsigned int numberOfPages, unsigned int sectorsPerPage, const DISC_INTERFACE* discInterface, sec_t endOfPartition, sec_t sectorSize) { + CACHE* cache; + unsigned int i; + CACHE_ENTRY* cacheEntries; + + if(numberOfPages==0 || sectorsPerPage==0) return NULL; + + if (numberOfPages < 4) { + numberOfPages = 4; + } + + if (sectorsPerPage < 32) { + sectorsPerPage = 32; + } + + cache = (CACHE*) mem_alloc (sizeof(CACHE)); + if (cache == NULL) { + return NULL; + } + + cache->disc = discInterface; + cache->endOfPartition = endOfPartition; + cache->numberOfPages = numberOfPages; + cache->sectorsPerPage = sectorsPerPage; + cache->sectorSize = sectorSize; + + + cacheEntries = (CACHE_ENTRY*) mem_alloc ( sizeof(CACHE_ENTRY) * numberOfPages); + if (cacheEntries == NULL) { + mem_free (cache); + return NULL; + } + + for (i = 0; i < numberOfPages; i++) { + cacheEntries[i].sector = CACHE_FREE; + cacheEntries[i].count = 0; + cacheEntries[i].last_access = 0; + cacheEntries[i].dirty = false; + cacheEntries[i].cache = (uint8_t*) mem_align (32, sectorsPerPage * cache->sectorSize); + } + + cache->cacheEntries = cacheEntries; + + return cache; +} + +void cache_destructor (CACHE* cache) { + unsigned int i; + + if(cache==NULL) return; + + // Clear out cache before destroying it + cache_flush(cache); + + // Free memory in reverse allocation order + for (i = 0; i < cache->numberOfPages; i++) { + mem_free (cache->cacheEntries[i].cache); + } + mem_free (cache->cacheEntries); + mem_free (cache); +} + +static u32 accessCounter = 0; + +static u32 accessTime(){ + accessCounter++; + return accessCounter; +} + +static CACHE_ENTRY* cache_getPage(CACHE *cache,sec_t sector) +{ + unsigned int i; + CACHE_ENTRY* cacheEntries = cache->cacheEntries; + unsigned int numberOfPages = cache->numberOfPages; + unsigned int sectorsPerPage = cache->sectorsPerPage; + + bool foundFree = false; + unsigned int oldUsed = 0; + unsigned int oldAccess = UINT_MAX; + + for(i=0;i<numberOfPages;i++) { + if(sector>=cacheEntries[i].sector && sector<(cacheEntries[i].sector + cacheEntries[i].count)) { + cacheEntries[i].last_access = accessTime(); + return &(cacheEntries[i]); + } + + if(foundFree==false && (cacheEntries[i].sector==CACHE_FREE || cacheEntries[i].last_access<oldAccess)) { + if(cacheEntries[i].sector==CACHE_FREE) foundFree = true; + oldUsed = i; + oldAccess = cacheEntries[i].last_access; + } + } + + if(foundFree==false && cacheEntries[oldUsed].dirty==true) { + if(!cache->disc->writeSectors(cacheEntries[oldUsed].sector,cacheEntries[oldUsed].count,cacheEntries[oldUsed].cache)) return NULL; + cacheEntries[oldUsed].dirty = false; + } + sector = (sector/sectorsPerPage)*sectorsPerPage; // align base sector to page size + sec_t next_page = sector + sectorsPerPage; + if(next_page > cache->endOfPartition) next_page = cache->endOfPartition; + + if(!cache->disc->readSectors(sector,next_page-sector,cacheEntries[oldUsed].cache)) return NULL; + + cacheEntries[oldUsed].sector = sector; + cacheEntries[oldUsed].count = next_page-sector; + cacheEntries[oldUsed].last_access = accessTime(); + + return &(cacheEntries[oldUsed]); +} + +static CACHE_ENTRY* cache_findPage(CACHE *cache, sec_t sector, sec_t count) { + + unsigned int i; + CACHE_ENTRY* cacheEntries = cache->cacheEntries; + unsigned int numberOfPages = cache->numberOfPages; + CACHE_ENTRY *entry = NULL; + sec_t lowest = UINT_MAX; + + for(i=0;i<numberOfPages;i++) { + if (cacheEntries[i].sector != CACHE_FREE) { + bool intersect; + if (sector > cacheEntries[i].sector) { + intersect = sector - cacheEntries[i].sector < cacheEntries[i].count; + } else { + intersect = cacheEntries[i].sector - sector < count; + } + + if ( intersect && (cacheEntries[i].sector < lowest)) { + lowest = cacheEntries[i].sector; + entry = &cacheEntries[i]; + } + } + } + + return entry; +} + +bool cache_readSectors(CACHE *cache,sec_t sector,sec_t numSectors,void *buffer) +{ + sec_t sec; + sec_t secs_to_read; + CACHE_ENTRY *entry; + uint8_t *dest = buffer; + + while(numSectors>0) { + entry = cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + secs_to_read = entry->count - sec; + if(secs_to_read>numSectors) secs_to_read = numSectors; + + memcpy(dest,entry->cache + (sec*cache->sectorSize),(secs_to_read*cache->sectorSize)); + + dest += (secs_to_read*cache->sectorSize); + sector += secs_to_read; + numSectors -= secs_to_read; + } + + return true; +} + +/* +Reads some data from a cache page, determined by the sector number +*/ + +bool cache_readPartialSector (CACHE* cache, void* buffer, sec_t sector, unsigned int offset, size_t size) +{ + sec_t sec; + CACHE_ENTRY *entry; + + if (offset + size > cache->sectorSize) return false; + + entry = cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + memcpy(buffer,entry->cache + ((sec*cache->sectorSize) + offset),size); + + return true; +} + +bool cache_readLittleEndianValue (CACHE* cache, uint32_t *value, sec_t sector, unsigned int offset, int num_bytes) { + uint8_t buf[4]; + if (!cache_readPartialSector(cache, buf, sector, offset, num_bytes)) return false; + + switch(num_bytes) { + case 1: *value = buf[0]; break; + case 2: *value = u8array_to_u16(buf,0); break; + case 4: *value = u8array_to_u32(buf,0); break; + default: return false; + } + return true; +} + +/* +Writes some data to a cache page, making sure it is loaded into memory first. +*/ + +bool cache_writePartialSector (CACHE* cache, const void* buffer, sec_t sector, unsigned int offset, size_t size) +{ + sec_t sec; + CACHE_ENTRY *entry; + + if (offset + size > cache->sectorSize) return false; + + entry = cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + memcpy(entry->cache + ((sec*cache->sectorSize) + offset),buffer,size); + + entry->dirty = true; + return true; +} + +bool cache_writeLittleEndianValue (CACHE* cache, const uint32_t value, sec_t sector, unsigned int offset, int size) { + uint8_t buf[4] = {0, 0, 0, 0}; + + switch(size) { + case 1: buf[0] = value; break; + case 2: u16_to_u8array(buf, 0, value); break; + case 4: u32_to_u8array(buf, 0, value); break; + default: return false; + } + + return cache_writePartialSector(cache, buf, sector, offset, size); +} + +/* +Writes some data to a cache page, zeroing out the page first +*/ + +bool cache_eraseWritePartialSector (CACHE* cache, const void* buffer, sec_t sector, unsigned int offset, size_t size) +{ + sec_t sec; + CACHE_ENTRY *entry; + + if (offset + size > cache->sectorSize) return false; + + entry = cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + memset(entry->cache + (sec*cache->sectorSize),0,cache->sectorSize); + memcpy(entry->cache + ((sec*cache->sectorSize) + offset),buffer,size); + + entry->dirty = true; + return true; +} + +bool cache_writeSectors (CACHE* cache, sec_t sector, sec_t numSectors, const void* buffer) +{ + sec_t sec; + sec_t secs_to_write; + CACHE_ENTRY* entry; + const uint8_t *src = buffer; + + while(numSectors>0) + { + entry = cache_findPage(cache,sector,numSectors); + + if(entry!=NULL) { + + if ( entry->sector > sector) { + + secs_to_write = entry->sector - sector; + + cache->disc->writeSectors(sector,secs_to_write,src); + src += (secs_to_write*cache->sectorSize); + sector += secs_to_write; + numSectors -= secs_to_write; + } + + sec = sector - entry->sector; + secs_to_write = entry->count - sec; + + if(secs_to_write>numSectors) secs_to_write = numSectors; + + memcpy(entry->cache + (sec*cache->sectorSize),src,(secs_to_write*cache->sectorSize)); + + src += (secs_to_write*cache->sectorSize); + sector += secs_to_write; + numSectors -= secs_to_write; + + entry->dirty = true; + + } else { + cache->disc->writeSectors(sector,numSectors,src); + numSectors=0; + } + } + return true; +} + +/* +Flushes all dirty pages to disc, clearing the dirty flag. +*/ +bool cache_flush (CACHE* cache) { + unsigned int i; + if(cache==NULL) return true; + + for (i = 0; i < cache->numberOfPages; i++) { + if (cache->cacheEntries[i].dirty) { + if (!cache->disc->writeSectors (cache->cacheEntries[i].sector, cache->cacheEntries[i].count, cache->cacheEntries[i].cache)) { + return false; + } + } + cache->cacheEntries[i].dirty = false; + } + + return true; +} + +void cache_invalidate (CACHE* cache) { + unsigned int i; + if(cache==NULL) + return; + + cache_flush(cache); + for (i = 0; i < cache->numberOfPages; i++) { + cache->cacheEntries[i].sector = CACHE_FREE; + cache->cacheEntries[i].last_access = 0; + cache->cacheEntries[i].count = 0; + cache->cacheEntries[i].dirty = false; + } +} diff --git a/portlibs/sources/libext2fs/source/disc_cache.h b/portlibs/sources/libext2fs/source/disc_cache.h new file mode 100644 index 00000000..1d34c8c0 --- /dev/null +++ b/portlibs/sources/libext2fs/source/disc_cache.h @@ -0,0 +1,118 @@ +/* + CACHE.h + The CACHE is not visible to the user. It should be flushed + when any file is closed or changes are made to the filesystem. + + This CACHE implements a least-used-page replacement policy. This will + distribute sectors evenly over the pages, so if less than the maximum + pages are used at once, they should all eventually remain in the CACHE. + This also has the benefit of throwing out old sectors, so as not to keep + too many stale pages around. + + Copyright (c) 2006 Michael "Chishm" Chisholm + Copyright (c) 2009 shareese, rodries + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _DISC_CACHE_H +#define _DISC_CACHE_H + +#include <stddef.h> +#include <stdint.h> +#include <gctypes.h> +#include <ogc/disc_io.h> +#include <gccore.h> + +typedef struct +{ + sec_t sector; + unsigned int count; + u64 last_access; + bool dirty; + u8* cache; +} CACHE_ENTRY; + +typedef struct +{ + const DISC_INTERFACE* disc; + sec_t endOfPartition; + unsigned int numberOfPages; + unsigned int sectorsPerPage; + sec_t sectorSize; + CACHE_ENTRY* cacheEntries; +} CACHE; + +/* +Read data from a sector in the CACHE +If the sector is not in the CACHE, it will be swapped in +offset is the position to start reading from +size is the amount of data to read +Precondition: offset + size <= BYTES_PER_READ +*/ +/* +Write data to a sector in the CACHE +If the sector is not in the CACHE, it will be swapped in. +When the sector is swapped out, the data will be written to the disc +offset is the position to start writing to +size is the amount of data to write +Precondition: offset + size <= BYTES_PER_READ +*/ + +/* +Write data to a sector in the CACHE, zeroing the sector first +If the sector is not in the CACHE, it will be swapped in. +When the sector is swapped out, the data will be written to the disc +offset is the position to start writing to +size is the amount of data to write +Precondition: offset + size <= BYTES_PER_READ +*/ + +/* +Read several sectors from the CACHE +*/ +bool cache_readSectors (CACHE* DISC_CACHE, sec_t sector, sec_t numSectors, void* buffer); + +/* +Read a full sector from the CACHE +*/ +/* +Write a full sector to the CACHE +*/ +bool cache_writeSectors (CACHE* DISC_CACHE, sec_t sector, sec_t numSectors, const void* buffer); + +/* +Write any dirty sectors back to disc and clear out the contents of the CACHE +*/ +bool cache_flush (CACHE* DISC_CACHE); + +/* +Clear out the contents of the CACHE without writing any dirty sectors first +*/ +void cache_invalidate (CACHE* DISC_CACHE); + +CACHE* cache_constructor (unsigned int numberOfPages, unsigned int sectorsPerPage, const DISC_INTERFACE* discInterface, sec_t endOfPartition, sec_t sectorSize); + +void cache_destructor (CACHE* DISC_CACHE); + +#endif // _CACHE_H + diff --git a/portlibs/sources/libext2fs/source/dupfs.c b/portlibs/sources/libext2fs/source/dupfs.c new file mode 100644 index 00000000..a9e2a976 --- /dev/null +++ b/portlibs/sources/libext2fs/source/dupfs.c @@ -0,0 +1,96 @@ +/* + * dupfs.c --- duplicate a ext2 filesystem handle + * + * Copyright (C) 1997, 1998, 2001, 2003, 2005 by Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <time.h> +#include <string.h> + +#include "ext2_fs.h" +#include "ext2fsP.h" + +errcode_t ext2fs_dup_handle(ext2_filsys src, ext2_filsys *dest) +{ + ext2_filsys fs; + errcode_t retval; + + EXT2_CHECK_MAGIC(src, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + retval = ext2fs_get_mem(sizeof(struct struct_ext2_filsys), &fs); + if (retval) + return retval; + + *fs = *src; + fs->device_name = 0; + fs->super = 0; + fs->orig_super = 0; + fs->group_desc = 0; + fs->inode_map = 0; + fs->block_map = 0; + fs->badblocks = 0; + fs->dblist = 0; + + io_channel_bumpcount(fs->io); + if (fs->icache) + fs->icache->refcount++; + + retval = ext2fs_get_mem(strlen(src->device_name)+1, &fs->device_name); + if (retval) + goto errout; + strcpy(fs->device_name, src->device_name); + + retval = ext2fs_get_mem(SUPERBLOCK_SIZE, &fs->super); + if (retval) + goto errout; + memcpy(fs->super, src->super, SUPERBLOCK_SIZE); + + retval = ext2fs_get_mem(SUPERBLOCK_SIZE, &fs->orig_super); + if (retval) + goto errout; + memcpy(fs->orig_super, src->orig_super, SUPERBLOCK_SIZE); + + retval = ext2fs_get_array(fs->desc_blocks, fs->blocksize, + &fs->group_desc); + if (retval) + goto errout; + memcpy(fs->group_desc, src->group_desc, + (size_t) fs->desc_blocks * fs->blocksize); + + if (src->inode_map) { + retval = ext2fs_copy_bitmap(src->inode_map, &fs->inode_map); + if (retval) + goto errout; + } + if (src->block_map) { + retval = ext2fs_copy_bitmap(src->block_map, &fs->block_map); + if (retval) + goto errout; + } + if (src->badblocks) { + retval = ext2fs_badblocks_copy(src->badblocks, &fs->badblocks); + if (retval) + goto errout; + } + if (src->dblist) { + retval = ext2fs_copy_dblist(src->dblist, &fs->dblist); + if (retval) + goto errout; + } + *dest = fs; + return 0; +errout: + ext2fs_free(fs); + return retval; + +} + diff --git a/portlibs/sources/libext2fs/source/e2image.h b/portlibs/sources/libext2fs/source/e2image.h new file mode 100644 index 00000000..4de2c8d9 --- /dev/null +++ b/portlibs/sources/libext2fs/source/e2image.h @@ -0,0 +1,51 @@ +/* + * e2image.h --- header file describing the ext2 image format + * + * Copyright (C) 2000 Theodore Ts'o. + * + * Note: this uses the POSIX IO interfaces, unlike most of the other + * functions in this library. So sue me. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + + +struct ext2_image_hdr { + __u32 magic_number; /* This must be EXT2_ET_MAGIC_E2IMAGE */ + char magic_descriptor[16]; /* "Ext2 Image 1.0", w/ null padding */ + char fs_hostname[64];/* Hostname of machine of image */ + char fs_netaddr[32]; /* Network address */ + __u32 fs_netaddr_type;/* 0 = IPV4, 1 = IPV6, etc. */ + __u32 fs_device; /* Device number of image */ + char fs_device_name[64]; /* Device name */ + char fs_uuid[16]; /* UUID of filesystem */ + __u32 fs_blocksize; /* Block size of the filesystem */ + __u32 fs_reserved[8]; + + __u32 image_device; /* Device number of image file */ + __u32 image_inode; /* Inode number of image file */ + __u32 image_time; /* Time of image creation */ + __u32 image_reserved[8]; + + __u32 offset_super; /* Byte offset of the sb and descriptors */ + __u32 offset_inode; /* Byte offset of the inode table */ + __u32 offset_inodemap; /* Byte offset of the inode bitmaps */ + __u32 offset_blockmap; /* Byte offset of the inode bitmaps */ + __u32 offset_reserved[8]; +}; + + + + + + + + + + + + + diff --git a/portlibs/sources/libext2fs/source/expanddir.c b/portlibs/sources/libext2fs/source/expanddir.c new file mode 100644 index 00000000..7673a3bd --- /dev/null +++ b/portlibs/sources/libext2fs/source/expanddir.c @@ -0,0 +1,126 @@ +/* + * expand.c --- expand an ext2fs directory + * + * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +struct expand_dir_struct { + int done; + int newblocks; + errcode_t err; +}; + +static int expand_dir_proc(ext2_filsys fs, + blk64_t *blocknr, + e2_blkcnt_t blockcnt, + blk64_t ref_block EXT2FS_ATTR((unused)), + int ref_offset EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct expand_dir_struct *es = (struct expand_dir_struct *) priv_data; + blk64_t new_blk; + static blk64_t last_blk = 0; + char *block; + errcode_t retval; + + if (*blocknr) { + last_blk = *blocknr; + return 0; + } + retval = ext2fs_new_block2(fs, last_blk, 0, &new_blk); + if (retval) { + es->err = retval; + return BLOCK_ABORT; + } + if (blockcnt > 0) { + retval = ext2fs_new_dir_block(fs, 0, 0, &block); + if (retval) { + es->err = retval; + return BLOCK_ABORT; + } + es->done = 1; + retval = ext2fs_write_dir_block(fs, new_blk, block); + } else { + retval = ext2fs_get_mem(fs->blocksize, &block); + if (retval) { + es->err = retval; + return BLOCK_ABORT; + } + memset(block, 0, fs->blocksize); + retval = io_channel_write_blk64(fs->io, new_blk, 1, block); + } + if (retval) { + es->err = retval; + return BLOCK_ABORT; + } + ext2fs_free_mem(&block); + *blocknr = new_blk; + ext2fs_block_alloc_stats2(fs, new_blk, +1); + es->newblocks++; + + if (es->done) + return (BLOCK_CHANGED | BLOCK_ABORT); + else + return BLOCK_CHANGED; +} + +errcode_t ext2fs_expand_dir(ext2_filsys fs, ext2_ino_t dir) +{ + errcode_t retval; + struct expand_dir_struct es; + struct ext2_inode inode; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!(fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + if (!fs->block_map) + return EXT2_ET_NO_BLOCK_BITMAP; + + retval = ext2fs_check_directory(fs, dir); + if (retval) + return retval; + + es.done = 0; + es.err = 0; + es.newblocks = 0; + + retval = ext2fs_block_iterate3(fs, dir, BLOCK_FLAG_APPEND, + 0, expand_dir_proc, &es); + + if (es.err) + return es.err; + if (!es.done) + return EXT2_ET_EXPAND_DIR_ERR; + + /* + * Update the size and block count fields in the inode. + */ + retval = ext2fs_read_inode(fs, dir, &inode); + if (retval) + return retval; + + inode.i_size += fs->blocksize; + ext2fs_iblk_add_blocks(fs, &inode, es.newblocks); + + retval = ext2fs_write_inode(fs, dir, &inode); + if (retval) + return retval; + + return 0; +} diff --git a/portlibs/sources/libext2fs/source/ext2.c b/portlibs/sources/libext2fs/source/ext2.c new file mode 100644 index 00000000..7cff7f3c --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2.c @@ -0,0 +1,420 @@ +/** + * ext2file.c - devoptab file routines for EXT2-based devices. + * + * Copyright (c) 2006 Michael "Chishm" Chisholm + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2010 Dimok + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ +#include <errno.h> +#include <string.h> +#include "ext2_fs.h" +#include "ext2fs.h" +#include "ext2_internal.h" +#include "gekko_io.h" +#include "mem_allocate.h" +#include "partitions.h" + +bool ext2Mount(const char *name, const DISC_INTERFACE *interface, sec_t startSector, u32 cachePageCount, u32 cachePageSize, u32 flags) +{ + errcode_t retval = -1; + ext2_filsys fs = NULL; + io_channel io_chan = NULL; + gekko_fd *fd = NULL; + ext2_vd * vd = NULL; + + // Sanity check + if (!name || !interface) + { + errno = EINVAL; + return false; + } + + // Allocate the device driver descriptor + fd = (gekko_fd*) mem_alloc(sizeof(gekko_fd)); + if (!fd) + goto cleanup; + + memset(fd, 0, sizeof(gekko_fd)); + + // Setup the device driver descriptor + fd->interface = interface; + fd->startSector = startSector; + fd->sectorSize = 0; + fd->sectorCount = 0; + fd->cachePageCount = cachePageCount; + fd->cachePageSize = cachePageSize; + + fs = mem_alloc(sizeof(struct struct_ext2_filsys)); + if (!fs) + { + ext2_log_trace("no memory for fs\n"); + errno = ENOMEM; + goto cleanup; + } + + memset(fs, 0, sizeof(struct struct_ext2_filsys)); + + io_chan = mem_alloc(sizeof(struct struct_io_channel)); + if (!io_chan) + { + ext2_log_trace("no memory for io_chan\n"); + errno = ENOMEM; + goto cleanup; + } + + memset(io_chan, 0, sizeof(struct struct_io_channel)); + + io_chan->magic = EXT2_ET_MAGIC_IO_CHANNEL; + io_chan->manager = gekko_io_manager; + io_chan->name = strdup(name); + if(!io_chan->name) goto cleanup; + io_chan->block_size = 1024; + io_chan->read_error = 0; + io_chan->write_error = 0; + io_chan->refcount = 1; + io_chan->private_data = fd; + io_chan->flags = flags; + + retval = ext2fs_open2(io_chan->name, 0, io_chan->flags, 0, 0, &io_chan, &fs); + if(retval) + { + ext2_log_trace("error mounting %i\n", (int) retval); + goto cleanup; + } + + vd = mem_alloc(sizeof(ext2_vd)); + if(!vd) + { + ext2_log_trace("no memory for vd\n"); + goto cleanup; + } + + // Initialise the volume descriptor + ext2InitVolume(vd); + vd->fs = fs; + vd->io = io_chan; + vd->root = EXT2_ROOT_INO; + + // Add the device to the devoptab table + if (ext2AddDevice(name, vd)) { + ext2DeinitVolume(vd); + goto cleanup; + } + + return true; + +cleanup: + if(fd) + mem_free(fd); + if(io_chan) + mem_free(io_chan); + if(vd) + mem_free(vd); + if(fs) + { + ext2fs_close(fs); + ext2fs_free(fs); + } + + return false; +} + +void ext2Unmount(const char *name) +{ + ext2_vd *vd = NULL; + + // Get the devices volume descriptor + vd = ext2GetVolume(name); + if (!vd) + return; + + // Remove the device from the devoptab table + ext2RemoveDevice(name); + + // Deinitialise the volume descriptor + ext2DeinitVolume(vd); + + // Unmount the volume + ext2fs_close(vd->fs); + ext2fs_free(vd->fs); + + //Free the io manager + mem_free(vd->io->private_data); + mem_free(vd->io); + + // Free the volume descriptor + mem_free(vd); + + return; +} + + +const char *ext2GetVolumeName (const char *name) +{ + if (!name) { + errno = EINVAL; + return NULL; + } + + // Get the devices volume descriptor + ext2_vd *vd = ext2GetVolume(name); + if (!vd) { + errno = ENODEV; + return NULL; + } + + return vd->fs->super->s_volume_name; +} + +bool ext2SetVolumeName (const char *name, const char *volumeName) +{ + // Sanity check + if (!name || !volumeName) { + errno = EINVAL; + return false; + } + + // Get the devices volume descriptor + ext2_vd *vd = ext2GetVolume(name); + if (!vd) { + errno = ENODEV; + return false; + } + + // Lock + ext2Lock(vd); + int i; + for(i = 0; i < 15 && *volumeName != 0; ++i, volumeName++) + vd->fs->super->s_volume_name[i] = *volumeName; + + vd->fs->super->s_volume_name[i] = '\0'; + + ext2fs_mark_super_dirty(vd->fs); + + ext2Sync(vd, NULL); + + // Unlock + ext2Unlock(vd); + + return true; +} + +int ext2FindPartitions (const DISC_INTERFACE *interface, sec_t **out_partitions) +{ + MASTER_BOOT_RECORD mbr; + PARTITION_RECORD *partition = NULL; + int partition_count = 0, ret = -1; + sec_t part_lba = 0; + sec_t * partitions = NULL; + int i; + + union { + u8 buffer[512]; + MASTER_BOOT_RECORD mbr; + EXTENDED_BOOT_RECORD ebr; + } sector; + + // Sanity check + if (!interface) { + errno = EINVAL; + return -1; + } + + if(!out_partitions) { + errno = EINVAL; + return -1; + } + + // Start the device and check that it is inserted + if (!interface->startup()) { + errno = EIO; + return -1; + } + if (!interface->isInserted()) { + errno = EIO; + return 0; + } + + struct ext2_super_block * super = (struct ext2_super_block *) malloc(SUPERBLOCK_SIZE); //1024 bytes + if(!super) + { + ext2_log_trace("no memory for superblock"); + errno = ENOMEM; + return -1; + } + + partitions = (sec_t *) malloc(sizeof(sec_t)); + if(!partitions) + { + ext2_log_trace("no memory for partitions"); + errno = ENOMEM; + mem_free(super); + return -1; + } + // Read the first sector on the device + if (!interface->readSectors(0, 1, §or.buffer)) { + errno = EIO; + mem_free(partitions); + mem_free(super); + return -1; + } + + // If this is the devices master boot record + if (sector.mbr.signature == MBR_SIGNATURE) + { + memcpy(&mbr, §or, sizeof(MASTER_BOOT_RECORD)); + + // Search the partition table for all EXT2/3/4 partitions (max. 4 primary partitions) + for (i = 0; i < 4; i++) + { + partition = &mbr.partitions[i]; + part_lba = ext2fs_le32_to_cpu(mbr.partitions[i].lba_start); + + // Figure out what type of partition this is + switch (partition->type) + { + // Ignore empty partitions + case PARTITION_TYPE_EMPTY: + continue; + + // EXT2/3/4 partition + case PARTITION_TYPE_LINUX: + + // Read and validate the EXT partition + if (interface->readSectors(part_lba+SUPERBLOCK_OFFSET/BYTES_PER_SECTOR, SUPERBLOCK_SIZE/BYTES_PER_SECTOR, super)) + { + if (ext2fs_le16_to_cpu(super->s_magic) == EXT2_SUPER_MAGIC) + { + partition_count++; + sec_t * tmp = (sec_t *) realloc(partitions, partition_count*sizeof(sec_t)); + if(!tmp) goto cleanup; + partitions = tmp; + partitions[partition_count-1] = part_lba; + } + } + + break; + + // DOS 3.3+ or Windows 95 extended partition + case PARTITION_TYPE_DOS33_EXTENDED: + case PARTITION_TYPE_WIN95_EXTENDED: + { + ext2_log_trace("Partition %i: Claims to be Extended\n", i + 1); + + // Walk the extended partition chain, finding all EXT partitions within it + sec_t ebr_lba = part_lba; + sec_t next_erb_lba = 0; + do { + // Read and validate the extended boot record + if (interface->readSectors(ebr_lba + next_erb_lba, 1, §or)) + { + if (sector.ebr.signature == EBR_SIGNATURE) + { + ext2_log_trace("Logical Partition @ %d: %s type 0x%x\n", ebr_lba + next_erb_lba, + sector.ebr.partition.status == PARTITION_STATUS_BOOTABLE ? "bootable (active)" : "non-bootable", + sector.ebr.partition.type); + + // Get the start sector of the current partition + // and the next extended boot record in the chain + part_lba = ebr_lba + next_erb_lba + ext2fs_le32_to_cpu(sector.ebr.partition.lba_start); + next_erb_lba = ext2fs_le32_to_cpu(sector.ebr.next_ebr.lba_start); + + // Check if this partition has a valid EXT boot record + if (interface->readSectors(part_lba+SUPERBLOCK_OFFSET/BYTES_PER_SECTOR, SUPERBLOCK_SIZE/BYTES_PER_SECTOR, super)) + { + if (ext2fs_le16_to_cpu(super->s_magic) == EXT2_SUPER_MAGIC) + { + partition_count++; + sec_t * tmp = (sec_t *) realloc(partitions, partition_count*sizeof(sec_t)); + if(!tmp) goto cleanup; + partitions = tmp; + partitions[partition_count-1] = part_lba; + } + } + } + else + next_erb_lba = 0; + } + + } while (next_erb_lba); + + break; + + } + + // Unknown or unsupported partition type + default: + { + // Check if this partition has a valid EXT boot record anyway, + // it might be misrepresented due to a lazy partition editor + if (interface->readSectors(part_lba+SUPERBLOCK_OFFSET/BYTES_PER_SECTOR, SUPERBLOCK_SIZE/BYTES_PER_SECTOR, super)) + { + if (ext2fs_le16_to_cpu(super->s_magic) == EXT2_SUPER_MAGIC) + { + partition_count++; + sec_t * tmp = (sec_t *) realloc(partitions, partition_count*sizeof(sec_t)); + if(!tmp) goto cleanup; + partitions = tmp; + partitions[partition_count-1] = part_lba; + } + } + break; + } + } + } + + // Else it is assumed this device has no master boot record + } + else + { + ext2_log_trace("No Master Boot Record was found!\n"); + + // As a last-ditched effort, search the first 64 sectors of the device for stray EXT partitions + for (i = 1; i < 64; i++) + { + if (interface->readSectors(i+SUPERBLOCK_OFFSET/BYTES_PER_SECTOR, SUPERBLOCK_SIZE/BYTES_PER_SECTOR, super)) + { + if (ext2fs_le16_to_cpu(super->s_magic) == EXT2_SUPER_MAGIC) + { + partition_count++; + sec_t * tmp = (sec_t *) realloc(partitions, partition_count*sizeof(sec_t)); + if(!tmp) goto cleanup; + partitions = tmp; + partitions[partition_count-1] = i; + } + } + } + + } + + // Return the found partitions (if any) + if (partition_count > 0) + { + *out_partitions = partitions; + ret = partition_count; + } + +cleanup: + + if(partitions && partition_count == 0) + mem_free(partitions); + if(super) + mem_free(super); + + return ret; +} + diff --git a/portlibs/sources/libext2fs/source/ext2_err.h b/portlibs/sources/libext2fs/source/ext2_err.h new file mode 100644 index 00000000..4f127443 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2_err.h @@ -0,0 +1,152 @@ +// +// Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. +// +// This file may be redistributed under the terms of the GNU Public +// License. +#ifndef EXT2_ERR_H_ +#define EXT2_ERR_H_ + +#define EXT2_ET_OK 0 +#define EXT2_ET_BASE -1 +#define EXT2_ET_MAGIC_EXT2FS_FILSYS -2 +#define EXT2_ET_MAGIC_BADBLOCKS_LIST -3 +#define EXT2_ET_MAGIC_BADBLOCKS_ITERATE -4 +#define EXT2_ET_MAGIC_INODE_SCAN -5 +#define EXT2_ET_MAGIC_IO_CHANNEL -6 +#define EXT2_ET_MAGIC_UNIX_IO_CHANNEL -7 +#define EXT2_ET_MAGIC_IO_MANAGER -8 +#define EXT2_ET_MAGIC_BLOCK_BITMAP -9 +#define EXT2_ET_MAGIC_INODE_BITMAP -10 +#define EXT2_ET_MAGIC_GENERIC_BITMAP -11 +#define EXT2_ET_MAGIC_TEST_IO_CHANNEL -12 +#define EXT2_ET_MAGIC_DBLIST -13 +#define EXT2_ET_MAGIC_ICOUNT -14 +#define EXT2_ET_MAGIC_PQ_IO_CHANNEL -15 +#define EXT2_ET_MAGIC_EXT2_FILE -16 +#define EXT2_ET_MAGIC_E2IMAGE -17 +#define EXT2_ET_MAGIC_INODE_IO_CHANNEL -18 +#define EXT2_ET_MAGIC_EXTENT_HANDLE -19 +#define EXT2_ET_BAD_MAGIC -20 +#define EXT2_ET_REV_TOO_HIGH -21 +#define EXT2_ET_RO_FILSYS -22 +#define EXT2_ET_GDESC_READ -23 +#define EXT2_ET_GDESC_WRITE -24 +#define EXT2_ET_GDESC_BAD_BLOCK_MAP -25 +#define EXT2_ET_GDESC_BAD_INODE_MAP -26 +#define EXT2_ET_GDESC_BAD_INODE_TABLE -27 +#define EXT2_ET_INODE_BITMAP_WRITE -28 +#define EXT2_ET_INODE_BITMAP_READ -29 +#define EXT2_ET_BLOCK_BITMAP_WRITE -30 +#define EXT2_ET_BLOCK_BITMAP_READ -31 +#define EXT2_ET_INODE_TABLE_WRITE -32 +#define EXT2_ET_INODE_TABLE_READ -33 +#define EXT2_ET_NEXT_INODE_READ -34 +#define EXT2_ET_UNEXPECTED_BLOCK_SIZE -35 +#define EXT2_ET_DIR_CORRUPTED -36 +#define EXT2_ET_SHORT_READ -37 +#define EXT2_ET_SHORT_WRITE -38 +#define EXT2_ET_DIR_NO_SPACE -39 +#define EXT2_ET_NO_INODE_BITMAP -40 +#define EXT2_ET_NO_BLOCK_BITMAP -41 +#define EXT2_ET_BAD_INODE_NUM -42 +#define EXT2_ET_BAD_BLOCK_NUM -45 +#define EXT2_ET_EXPAND_DIR_ERR -46 +#define EXT2_ET_TOOSMALL -47 +#define EXT2_ET_BAD_BLOCK_MARK -48 +#define EXT2_ET_BAD_BLOCK_UNMARK -49 +#define EXT2_ET_BAD_BLOCK_TEST -50 +#define EXT2_ET_BAD_INODE_MARK -51 +#define EXT2_ET_BAD_INODE_UNMARK -52 +#define EXT2_ET_BAD_INODE_TEST -53 +#define EXT2_ET_FUDGE_BLOCK_BITMAP_END -54 +#define EXT2_ET_FUDGE_INODE_BITMAP_END -55 +#define EXT2_ET_BAD_IND_BLOCK -56 +#define EXT2_ET_BAD_DIND_BLOCK -57 +#define EXT2_ET_BAD_TIND_BLOCK -58 +#define EXT2_ET_NEQ_BLOCK_BITMAP -59 +#define EXT2_ET_NEQ_INODE_BITMAP -60 +#define EXT2_ET_BAD_DEVICE_NAME -61 +#define EXT2_ET_MISSING_INODE_TABLE -62 +#define EXT2_ET_CORRUPT_SUPERBLOCK -63 +#define EXT2_ET_BAD_GENERIC_MARK -64 +#define EXT2_ET_BAD_GENERIC_UNMARK -65 +#define EXT2_ET_BAD_GENERIC_TEST -66 +#define EXT2_ET_SYMLINK_LOOP -67 +#define EXT2_ET_CALLBACK_NOTHANDLED -68 +#define EXT2_ET_BAD_BLOCK_IN_INODE_TABLE -69 +#define EXT2_ET_UNSUPP_FEATURE -70 +#define EXT2_ET_RO_UNSUPP_FEATURE -71 +#define EXT2_ET_LLSEEK_FAILED -72 +#define EXT2_ET_NO_MEMORY -73 +#define EXT2_ET_INVALID_ARGUMENT -74 +#define EXT2_ET_BLOCK_ALLOC_FAIL -75 +#define EXT2_ET_INODE_ALLOC_FAIL -76 +#define EXT2_ET_NO_DIRECTORY -77 +#define EXT2_ET_TOO_MANY_REFS -78 +#define EXT2_ET_FILE_NOT_FOUND -79 +#define EXT2_ET_FILE_RO -80 +#define EXT2_ET_DB_NOT_FOUND -81 +#define EXT2_ET_DIR_EXISTS -82 +#define EXT2_ET_UNIMPLEMENTED -83 +#define EXT2_ET_CANCEL_REQUESTED -84 +#define EXT2_ET_FILE_TOO_BIG -85 +#define EXT2_ET_JOURNAL_NOT_BLOCK -86 +#define EXT2_ET_NO_JOURNAL_SB -87 +#define EXT2_ET_JOURNAL_TOO_SMALL -88 +#define EXT2_ET_JOURNAL_UNSUPP_VERSION -89 +#define EXT2_ET_LOAD_EXT_JOURNAL -90 +#define EXT2_ET_NO_JOURNAL -91 +#define EXT2_ET_DIRHASH_UNSUPP -92 +#define EXT2_ET_BAD_EA_BLOCK_NUM -93 +#define EXT2_ET_TOO_MANY_INODES -94 +#define EXT2_ET_NOT_IMAGE_FILE -95 +#define EXT2_ET_RES_GDT_BLOCKS -96 +#define EXT2_ET_RESIZE_INODE_CORRUPT -97 +#define EXT2_ET_SET_BMAP_NO_IND -98 +#define EXT2_ET_TDB_SUCCESS -99 +#define EXT2_ET_TDB_ERR_CORRUPT -100 +#define EXT2_ET_TDB_ERR_IO -101 +#define EXT2_ET_TDB_ERR_LOCK -102 +#define EXT2_ET_TDB_ERR_OOM -103 +#define EXT2_ET_TDB_ERR_EXISTS -104 +#define EXT2_ET_TDB_ERR_NOLOCK -105 +#define EXT2_ET_TDB_ERR_EINVAL -106 +#define EXT2_ET_TDB_ERR_NOEXIST -107 +#define EXT2_ET_TDB_ERR_RDONLY -108 +#define EXT2_ET_DBLIST_EMPTY -109 +#define EXT2_ET_RO_BLOCK_ITERATE -110 +#define EXT2_ET_MAGIC_EXTENT_PATH -111 +#define EXT2_ET_MAGIC_RESERVED_10 -112 +#define EXT2_ET_MAGIC_RESERVED_11 -113 +#define EXT2_ET_MAGIC_RESERVED_12 -114 +#define EXT2_ET_MAGIC_RESERVED_13 -115 +#define EXT2_ET_MAGIC_RESERVED_14 -116 +#define EXT2_ET_MAGIC_RESERVED_15 -117 +#define EXT2_ET_MAGIC_RESERVED_16 -118 +#define EXT2_ET_MAGIC_RESERVED_17 -119 +#define EXT2_ET_MAGIC_RESERVED_18 -120 +#define EXT2_ET_MAGIC_RESERVED_19 -121 +#define EXT2_ET_EXTENT_HEADER_BAD -122 +#define EXT2_ET_EXTENT_INDEX_BAD -123 +#define EXT2_ET_EXTENT_LEAF_BAD -124 +#define EXT2_ET_EXTENT_NO_SPACE -125 +#define EXT2_ET_INODE_NOT_EXTENT -126 +#define EXT2_ET_EXTENT_NO_NEXT -127 +#define EXT2_ET_EXTENT_NO_PREV -128 +#define EXT2_ET_EXTENT_NO_UP -129 +#define EXT2_ET_EXTENT_NO_DOWN -130 +#define EXT2_ET_NO_CURRENT_NODE -131 +#define EXT2_ET_OP_NOT_SUPPORTED -132 +#define EXT2_ET_CANT_INSERT_EXTENT -133 +#define EXT2_ET_CANT_SPLIT_EXTENT -134 +#define EXT2_ET_EXTENT_NOT_FOUND -135 +#define EXT2_ET_EXTENT_NOT_SUPPORTED -136 +#define EXT2_ET_EXTENT_INVALID_LENGTH -137 +#define EXT2_ET_IO_CHANNEL_NO_SUPPORT_64 -138 +#define EXT2_NO_MTAB_FILE -139 +#define EXT2_ET_MAGIC_GENERIC_BITMAP64 -140 +#define EXT2_ET_MAGIC_BLOCK_BITMAP64 -141 +#define EXT2_ET_MAGIC_INODE_BITMAP64 -142 +#define EXT2_ET_CANT_USE_LEGACY_BITMAPS -143 + +#endif diff --git a/portlibs/sources/libext2fs/source/ext2_ext_attr.h b/portlibs/sources/libext2fs/source/ext2_ext_attr.h new file mode 100644 index 00000000..ed548d12 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2_ext_attr.h @@ -0,0 +1,71 @@ +/* + File: linux/ext2_ext_attr.h + + On-disk format of extended attributes for the ext2 filesystem. + + (C) 2000 Andreas Gruenbacher, <a.gruenbacher@computer.org> +*/ + +#ifndef _EXT2_EXT_ATTR_H +#define _EXT2_EXT_ATTR_H +/* Magic value in attribute blocks */ +#define EXT2_EXT_ATTR_MAGIC_v1 0xEA010000 +#define EXT2_EXT_ATTR_MAGIC 0xEA020000 + +/* Maximum number of references to one attribute block */ +#define EXT2_EXT_ATTR_REFCOUNT_MAX 1024 + +struct ext2_ext_attr_header { + __u32 h_magic; /* magic number for identification */ + __u32 h_refcount; /* reference count */ + __u32 h_blocks; /* number of disk blocks used */ + __u32 h_hash; /* hash value of all attributes */ + __u32 h_reserved[4]; /* zero right now */ +}; + +struct ext2_ext_attr_entry { + __u8 e_name_len; /* length of name */ + __u8 e_name_index; /* attribute name index */ + __u16 e_value_offs; /* offset in disk block of value */ + __u32 e_value_block; /* disk block attribute is stored on (n/i) */ + __u32 e_value_size; /* size of attribute value */ + __u32 e_hash; /* hash value of name and value */ +#if 0 + char e_name[0]; /* attribute name */ +#endif +}; + +#define EXT2_EXT_ATTR_PAD_BITS 2 +#define EXT2_EXT_ATTR_PAD ((unsigned) 1<<EXT2_EXT_ATTR_PAD_BITS) +#define EXT2_EXT_ATTR_ROUND (EXT2_EXT_ATTR_PAD-1) +#define EXT2_EXT_ATTR_LEN(name_len) \ + (((name_len) + EXT2_EXT_ATTR_ROUND + \ + sizeof(struct ext2_ext_attr_entry)) & ~EXT2_EXT_ATTR_ROUND) +#define EXT2_EXT_ATTR_NEXT(entry) \ + ( (struct ext2_ext_attr_entry *)( \ + (char *)(entry) + EXT2_EXT_ATTR_LEN((entry)->e_name_len)) ) +#define EXT2_EXT_ATTR_SIZE(size) \ + (((size) + EXT2_EXT_ATTR_ROUND) & ~EXT2_EXT_ATTR_ROUND) +#define EXT2_EXT_IS_LAST_ENTRY(entry) (*((__u32 *)(entry)) == 0UL) +#define EXT2_EXT_ATTR_NAME(entry) \ + (((char *) (entry)) + sizeof(struct ext2_ext_attr_entry)) +#define EXT2_XATTR_LEN(name_len) \ + (((name_len) + EXT2_EXT_ATTR_ROUND + \ + sizeof(struct ext2_xattr_entry)) & ~EXT2_EXT_ATTR_ROUND) +#define EXT2_XATTR_SIZE(size) \ + (((size) + EXT2_EXT_ATTR_ROUND) & ~EXT2_EXT_ATTR_ROUND) + +#ifdef __KERNEL__ +# ifdef CONFIG_EXT2_FS_EXT_ATTR +extern int ext2_get_ext_attr(struct inode *, const char *, char *, size_t, int); +extern int ext2_set_ext_attr(struct inode *, const char *, char *, size_t, int); +extern void ext2_ext_attr_free_inode(struct inode *inode); +extern void ext2_ext_attr_put_super(struct super_block *sb); +extern int ext2_ext_attr_init(void); +extern void ext2_ext_attr_done(void); +# else +# define ext2_get_ext_attr NULL +# define ext2_set_ext_attr NULL +# endif +#endif /* __KERNEL__ */ +#endif /* _EXT2_EXT_ATTR_H */ diff --git a/portlibs/sources/libext2fs/source/ext2_frag.c b/portlibs/sources/libext2fs/source/ext2_frag.c new file mode 100644 index 00000000..e05a4bc7 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2_frag.c @@ -0,0 +1,60 @@ +#include "ext2_internal.h" +#include "ext2_frag.h" + +typedef struct _PrivData +{ + _ext2_frag_append_t append_fragment; + void * callback_data; +} PrivDataST; + +static int block_iter_callback(ext2_filsys fs, blk64_t *blocknr, e2_blkcnt_t blockcnt, blk64_t ref_block, int ref_offset, void *privateData) +{ + PrivDataST *priv = (PrivDataST *) privateData; + blk64_t block; + block = *blocknr; + + return priv->append_fragment(priv->callback_data, blockcnt*fs->io->block_size/512, block*fs->io->block_size/512, fs->io->block_size/512); +} + +int _EXT2_get_fragments(const char *in_path, _ext2_frag_append_t append_fragment, void *callback_data) +{ + ext2_inode_t *ni = NULL; + ext2_vd *vd; + + vd = ext2GetVolume(in_path); + + if(!vd) + { + errno = EXDEV; + return -1; + } + + // Get the actual path of the entry + const char * path = ext2RealPath(in_path); + if (!path) { + errno = EINVAL; + return -1; + } + + // Find the entry + ni = ext2OpenEntry(vd, path); + if (!ni) { + errno = ENOENT; + return -1; + } + + PrivDataST priv; + priv.callback_data = callback_data; + priv.append_fragment = append_fragment; + + int ret = ext2fs_block_iterate3(vd->fs, ni->ino, BLOCK_FLAG_DATA_ONLY, NULL, block_iter_callback, &priv); + + if(ret == 0) + ret = priv.append_fragment(callback_data, EXT2_I_SIZE(&ni->ni) >> 9, 0, 0); + + ext2UpdateTimes(vd, ni, EXT2_UPDATE_ATIME); + + ext2CloseEntry(vd, ni); + + return ret; +} diff --git a/portlibs/sources/libext2fs/source/ext2_frag.h b/portlibs/sources/libext2fs/source/ext2_frag.h new file mode 100644 index 00000000..50732777 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2_frag.h @@ -0,0 +1,16 @@ +#ifndef EXT2_FRAG_H_ +#define EXT2_FRAG_H_ + +#ifdef __cplusplus +extern "C" { +#endif + +typedef int (*_ext2_frag_append_t)(void *ff, u32 offset, u32 sector, u32 count); + +int _EXT2_get_fragments(const char *in_path, _ext2_frag_append_t append_fragment, void *callback_data); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/sources/libext2fs/source/ext2_fs.h b/portlibs/sources/libext2fs/source/ext2_fs.h new file mode 100644 index 00000000..8a58dd10 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2_fs.h @@ -0,0 +1,799 @@ +/* + * linux/include/linux/ext2_fs.h + * + * Copyright (C) 1992, 1993, 1994, 1995 + * Remy Card (card@masi.ibp.fr) + * Laboratoire MASI - Institut Blaise Pascal + * Universite Pierre et Marie Curie (Paris VI) + * + * from + * + * linux/include/linux/minix_fs.h + * + * Copyright (C) 1991, 1992 Linus Torvalds + */ + +#ifndef _LINUX_EXT2_FS_H +#define _LINUX_EXT2_FS_H + +#include "ext2_types.h" /* Changed from linux/types.h */ + +/* + * The second extended filesystem constants/structures + */ + +/* + * Define EXT2FS_DEBUG to produce debug messages + */ +#undef EXT2FS_DEBUG + +/* + * Define EXT2_PREALLOCATE to preallocate data blocks for expanding files + */ +#define EXT2_PREALLOCATE +#define EXT2_DEFAULT_PREALLOC_BLOCKS 8 + +/* + * The second extended file system version + */ +#define EXT2FS_DATE "95/08/09" +#define EXT2FS_VERSION "0.5b" + +/* + * Special inode numbers + */ +#define EXT2_BAD_INO 1 /* Bad blocks inode */ +#define EXT2_ROOT_INO 2 /* Root inode */ +#define EXT4_USR_QUOTA_INO 3 /* User quota inode */ +#define EXT4_GRP_QUOTA_INO 4 /* Group quota inode */ +#define EXT2_BOOT_LOADER_INO 5 /* Boot loader inode */ +#define EXT2_UNDEL_DIR_INO 6 /* Undelete directory inode */ +#define EXT2_RESIZE_INO 7 /* Reserved group descriptors inode */ +#define EXT2_JOURNAL_INO 8 /* Journal inode */ +#define EXT2_EXCLUDE_INO 9 /* The "exclude" inode, for snapshots */ + +/* First non-reserved inode for old ext2 filesystems */ +#define EXT2_GOOD_OLD_FIRST_INO 11 + +/* + * The second extended file system magic number + */ +#define EXT2_SUPER_MAGIC 0xEF53 + +#ifdef __KERNEL__ +#define EXT2_SB(sb) (&((sb)->u.ext2_sb)) +#else +/* Assume that user mode programs are passing in an ext2fs superblock, not + * a kernel struct super_block. This will allow us to call the feature-test + * macros from user land. */ +#define EXT2_SB(sb) (sb) +#endif + +/* + * Maximal count of links to a file + */ +#define EXT2_LINK_MAX 65000 + +/* + * Macro-instructions used to manage several block sizes + */ +#define EXT2_MIN_BLOCK_LOG_SIZE 10 /* 1024 */ +#define EXT2_MAX_BLOCK_LOG_SIZE 16 /* 65536 */ +#define EXT2_MIN_BLOCK_SIZE (1 << EXT2_MIN_BLOCK_LOG_SIZE) +#define EXT2_MAX_BLOCK_SIZE (1 << EXT2_MAX_BLOCK_LOG_SIZE) +#ifdef __KERNEL__ +#define EXT2_BLOCK_SIZE(s) ((s)->s_blocksize) +#define EXT2_BLOCK_SIZE_BITS(s) ((s)->s_blocksize_bits) +#define EXT2_ADDR_PER_BLOCK_BITS(s) (EXT2_SB(s)->addr_per_block_bits) +#define EXT2_INODE_SIZE(s) (EXT2_SB(s)->s_inode_size) +#define EXT2_FIRST_INO(s) (EXT2_SB(s)->s_first_ino) +#else +#define EXT2_BLOCK_SIZE(s) (EXT2_MIN_BLOCK_SIZE << (s)->s_log_block_size) +#define EXT2_BLOCK_SIZE_BITS(s) ((s)->s_log_block_size + 10) +#define EXT2_INODE_SIZE(s) (((s)->s_rev_level == EXT2_GOOD_OLD_REV) ? \ + EXT2_GOOD_OLD_INODE_SIZE : (s)->s_inode_size) +#define EXT2_FIRST_INO(s) (((s)->s_rev_level == EXT2_GOOD_OLD_REV) ? \ + EXT2_GOOD_OLD_FIRST_INO : (s)->s_first_ino) +#endif +#define EXT2_ADDR_PER_BLOCK(s) (EXT2_BLOCK_SIZE(s) / sizeof(__u32)) + +/* + * Macro-instructions used to manage allocation clusters + */ +#define EXT2_MIN_CLUSTER_LOG_SIZE EXT2_MIN_BLOCK_LOG_SIZE +#define EXT2_MAX_CLUSTER_LOG_SIZE 29 /* 512MB */ +#define EXT2_MIN_CLUSTER_SIZE EXT2_MIN_BLOCK_SIZE +#define EXT2_MAX_CLUSTER_SIZE (1 << EXT2_MAX_CLUSTER_LOG_SIZE) +#define EXT2_CLUSTER_SIZE(s) (EXT2_MIN_BLOCK_SIZE << \ + (s)->s_log_cluster_size) +#define EXT2_CLUSTER_SIZE_BITS(s) ((s)->s_log_cluster_size + 10) + +/* + * ACL structures + */ +struct ext2_acl_header /* Header of Access Control Lists */ +{ + __u32 aclh_size; + __u32 aclh_file_count; + __u32 aclh_acle_count; + __u32 aclh_first_acle; +}; + +struct ext2_acl_entry /* Access Control List Entry */ +{ + __u32 acle_size; + __u16 acle_perms; /* Access permissions */ + __u16 acle_type; /* Type of entry */ + __u16 acle_tag; /* User or group identity */ + __u16 acle_pad1; + __u32 acle_next; /* Pointer on next entry for the */ + /* same inode or on next free entry */ +}; + +/* + * Structure of a blocks group descriptor + */ +struct ext2_group_desc +{ + __u32 bg_block_bitmap; /* Blocks bitmap block */ + __u32 bg_inode_bitmap; /* Inodes bitmap block */ + __u32 bg_inode_table; /* Inodes table block */ + __u16 bg_free_blocks_count; /* Free blocks count */ + __u16 bg_free_inodes_count; /* Free inodes count */ + __u16 bg_used_dirs_count; /* Directories count */ + __u16 bg_flags; + __u32 bg_reserved[2]; + __u16 bg_itable_unused; /* Unused inodes count */ + __u16 bg_checksum; /* crc16(s_uuid+grouo_num+group_desc)*/ +}; + +/* + * Structure of a blocks group descriptor + */ +struct ext4_group_desc +{ + __u32 bg_block_bitmap; /* Blocks bitmap block */ + __u32 bg_inode_bitmap; /* Inodes bitmap block */ + __u32 bg_inode_table; /* Inodes table block */ + __u16 bg_free_blocks_count; /* Free blocks count */ + __u16 bg_free_inodes_count; /* Free inodes count */ + __u16 bg_used_dirs_count; /* Directories count */ + __u16 bg_flags; /* EXT4_BG_flags (INODE_UNINIT, etc) */ + __u32 bg_reserved[2]; /* Likely block/inode bitmap checksum */ + __u16 bg_itable_unused; /* Unused inodes count */ + __u16 bg_checksum; /* crc16(sb_uuid+group+desc) */ + __u32 bg_block_bitmap_hi; /* Blocks bitmap block MSB */ + __u32 bg_inode_bitmap_hi; /* Inodes bitmap block MSB */ + __u32 bg_inode_table_hi; /* Inodes table block MSB */ + __u16 bg_free_blocks_count_hi;/* Free blocks count MSB */ + __u16 bg_free_inodes_count_hi;/* Free inodes count MSB */ + __u16 bg_used_dirs_count_hi; /* Directories count MSB */ + __u16 bg_itable_unused_hi; /* Unused inodes count MSB */ + __u32 bg_reserved2[3]; +}; + +#define EXT2_BG_INODE_UNINIT 0x0001 /* Inode table/bitmap not initialized */ +#define EXT2_BG_BLOCK_UNINIT 0x0002 /* Block bitmap not initialized */ +#define EXT2_BG_INODE_ZEROED 0x0004 /* On-disk itable initialized to zero */ + +/* + * Data structures used by the directory indexing feature + * + * Note: all of the multibyte integer fields are little endian. + */ + +/* + * Note: dx_root_info is laid out so that if it should somehow get + * overlaid by a dirent the two low bits of the hash version will be + * zero. Therefore, the hash version mod 4 should never be 0. + * Sincerely, the paranoia department. + */ +struct ext2_dx_root_info { + __u32 reserved_zero; + __u8 hash_version; /* 0 now, 1 at release */ + __u8 info_length; /* 8 */ + __u8 indirect_levels; + __u8 unused_flags; +}; + +#define EXT2_HASH_LEGACY 0 +#define EXT2_HASH_HALF_MD4 1 +#define EXT2_HASH_TEA 2 +#define EXT2_HASH_LEGACY_UNSIGNED 3 /* reserved for userspace lib */ +#define EXT2_HASH_HALF_MD4_UNSIGNED 4 /* reserved for userspace lib */ +#define EXT2_HASH_TEA_UNSIGNED 5 /* reserved for userspace lib */ + +#define EXT2_HASH_FLAG_INCOMPAT 0x1 + +struct ext2_dx_entry { + __u32 hash; + __u32 block; +}; + +struct ext2_dx_countlimit { + __u16 limit; + __u16 count; +}; + + +/* + * Macro-instructions used to manage group descriptors + */ +#define EXT2_MIN_DESC_SIZE 32 +#define EXT2_MIN_DESC_SIZE_64BIT 64 +#define EXT2_MAX_DESC_SIZE EXT2_MIN_BLOCK_SIZE +#define EXT2_DESC_SIZE(s) \ + ((EXT2_SB(s)->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) ? \ + (s)->s_desc_size : EXT2_MIN_DESC_SIZE) + +#define EXT2_BLOCKS_PER_GROUP(s) (EXT2_SB(s)->s_blocks_per_group) +#define EXT2_INODES_PER_GROUP(s) (EXT2_SB(s)->s_inodes_per_group) +#define EXT2_INODES_PER_BLOCK(s) (EXT2_BLOCK_SIZE(s)/EXT2_INODE_SIZE(s)) +/* limits imposed by 16-bit value gd_free_{blocks,inode}_count */ +#define EXT2_MAX_BLOCKS_PER_GROUP(s) ((1 << 16) - 8) +#define EXT2_MAX_INODES_PER_GROUP(s) ((1 << 16) - EXT2_INODES_PER_BLOCK(s)) +#ifdef __KERNEL__ +#define EXT2_DESC_PER_BLOCK(s) (EXT2_SB(s)->s_desc_per_block) +#define EXT2_DESC_PER_BLOCK_BITS(s) (EXT2_SB(s)->s_desc_per_block_bits) +#else +#define EXT2_DESC_PER_BLOCK(s) (EXT2_BLOCK_SIZE(s) / EXT2_DESC_SIZE(s)) +#endif + +/* + * Constants relative to the data blocks + */ +#define EXT2_NDIR_BLOCKS 12 +#define EXT2_IND_BLOCK EXT2_NDIR_BLOCKS +#define EXT2_DIND_BLOCK (EXT2_IND_BLOCK + 1) +#define EXT2_TIND_BLOCK (EXT2_DIND_BLOCK + 1) +#define EXT2_N_BLOCKS (EXT2_TIND_BLOCK + 1) + +/* + * Inode flags + */ +#define EXT2_SECRM_FL 0x00000001 /* Secure deletion */ +#define EXT2_UNRM_FL 0x00000002 /* Undelete */ +#define EXT2_COMPR_FL 0x00000004 /* Compress file */ +#define EXT2_SYNC_FL 0x00000008 /* Synchronous updates */ +#define EXT2_IMMUTABLE_FL 0x00000010 /* Immutable file */ +#define EXT2_APPEND_FL 0x00000020 /* writes to file may only append */ +#define EXT2_NODUMP_FL 0x00000040 /* do not dump file */ +#define EXT2_NOATIME_FL 0x00000080 /* do not update atime */ +/* Reserved for compression usage... */ +#define EXT2_DIRTY_FL 0x00000100 +#define EXT2_COMPRBLK_FL 0x00000200 /* One or more compressed clusters */ +#define EXT2_NOCOMPR_FL 0x00000400 /* Access raw compressed data */ +#define EXT2_ECOMPR_FL 0x00000800 /* Compression error */ +/* End compression flags --- maybe not all used */ +#define EXT2_BTREE_FL 0x00001000 /* btree format dir */ +#define EXT2_INDEX_FL 0x00001000 /* hash-indexed directory */ +#define EXT2_IMAGIC_FL 0x00002000 +#define EXT3_JOURNAL_DATA_FL 0x00004000 /* file data should be journaled */ +#define EXT2_NOTAIL_FL 0x00008000 /* file tail should not be merged */ +#define EXT2_DIRSYNC_FL 0x00010000 /* Synchronous directory modifications */ +#define EXT2_TOPDIR_FL 0x00020000 /* Top of directory hierarchies*/ +#define EXT4_HUGE_FILE_FL 0x00040000 /* Set to each huge file */ +#define EXT4_EXTENTS_FL 0x00080000 /* Inode uses extents */ +#define EXT4_EA_INODE_FL 0x00200000 /* Inode used for large EA */ +#define EXT4_EOFBLOCKS_FL 0x00400000 /* Blocks allocated beyond EOF */ +#define EXT4_SNAPFILE_FL 0x01000000 /* Inode is a snapshot */ +#define EXT4_SNAPFILE_DELETED_FL 0x04000000 /* Snapshot is being deleted */ +#define EXT4_SNAPFILE_SHRUNK_FL 0x08000000 /* Snapshot shrink has completed */ +#define EXT2_RESERVED_FL 0x80000000 /* reserved for ext2 lib */ + +#define EXT2_FL_USER_VISIBLE 0x004BDFFF /* User visible flags */ +#define EXT2_FL_USER_MODIFIABLE 0x004B80FF /* User modifiable flags */ + +/* + * ioctl commands + */ + +/* Used for online resize */ +struct ext2_new_group_input { + __u32 group; /* Group number for this data */ + __u32 block_bitmap; /* Absolute block number of block bitmap */ + __u32 inode_bitmap; /* Absolute block number of inode bitmap */ + __u32 inode_table; /* Absolute block number of inode table start */ + __u32 blocks_count; /* Total number of blocks in this group */ + __u16 reserved_blocks; /* Number of reserved blocks in this group */ + __u16 unused; /* Number of reserved GDT blocks in group */ +}; + +struct ext4_new_group_input { + __u32 group; /* Group number for this data */ + __u64 block_bitmap; /* Absolute block number of block bitmap */ + __u64 inode_bitmap; /* Absolute block number of inode bitmap */ + __u64 inode_table; /* Absolute block number of inode table start */ + __u32 blocks_count; /* Total number of blocks in this group */ + __u16 reserved_blocks; /* Number of reserved blocks in this group */ + __u16 unused; +}; + +#ifdef __GNU__ /* Needed for the Hurd */ +#define _IOT_ext2_new_group_input _IOT (_IOTS(__u32), 5, _IOTS(__u16), 2, 0, 0) +#endif + +#define EXT2_IOC_GETFLAGS _IOR('f', 1, long) +#define EXT2_IOC_SETFLAGS _IOW('f', 2, long) +#define EXT2_IOC_GETVERSION _IOR('v', 1, long) +#define EXT2_IOC_SETVERSION _IOW('v', 2, long) +#define EXT2_IOC_GETVERSION_NEW _IOR('f', 3, long) +#define EXT2_IOC_SETVERSION_NEW _IOW('f', 4, long) +#define EXT2_IOC_GROUP_EXTEND _IOW('f', 7, unsigned long) +#define EXT2_IOC_GROUP_ADD _IOW('f', 8,struct ext2_new_group_input) +#define EXT4_IOC_GROUP_ADD _IOW('f', 8,struct ext4_new_group_input) + +/* + * Structure of an inode on the disk + */ +struct ext2_inode { + __u16 i_mode; /* File mode */ + __u16 i_uid; /* Low 16 bits of Owner Uid */ + __u32 i_size; /* Size in bytes */ + __u32 i_atime; /* Access time */ + __u32 i_ctime; /* Inode change time */ + __u32 i_mtime; /* Modification time */ + __u32 i_dtime; /* Deletion Time */ + __u16 i_gid; /* Low 16 bits of Group Id */ + __u16 i_links_count; /* Links count */ + __u32 i_blocks; /* Blocks count */ + __u32 i_flags; /* File flags */ + union { + struct { + __u32 l_i_version; /* was l_i_reserved1 */ + } linux1; + struct { + __u32 h_i_translator; + } hurd1; + } osd1; /* OS dependent 1 */ + __u32 i_block[EXT2_N_BLOCKS];/* Pointers to blocks */ + __u32 i_generation; /* File version (for NFS) */ + __u32 i_file_acl; /* File ACL */ + __u32 i_size_high; /* Formerly i_dir_acl, directory ACL */ + __u32 i_faddr; /* Fragment address */ + union { + struct { + __u16 l_i_blocks_hi; + __u16 l_i_file_acl_high; + __u16 l_i_uid_high; /* these 2 fields */ + __u16 l_i_gid_high; /* were reserved2[0] */ + __u32 l_i_reserved2; + } linux2; + struct { + __u8 h_i_frag; /* Fragment number */ + __u8 h_i_fsize; /* Fragment size */ + __u16 h_i_mode_high; + __u16 h_i_uid_high; + __u16 h_i_gid_high; + __u32 h_i_author; + } hurd2; + } osd2; /* OS dependent 2 */ +}; + +/* + * Permanent part of an large inode on the disk + */ +struct ext2_inode_large { + __u16 i_mode; /* File mode */ + __u16 i_uid; /* Low 16 bits of Owner Uid */ + __u32 i_size; /* Size in bytes */ + __u32 i_atime; /* Access time */ + __u32 i_ctime; /* Inode Change time */ + __u32 i_mtime; /* Modification time */ + __u32 i_dtime; /* Deletion Time */ + __u16 i_gid; /* Low 16 bits of Group Id */ + __u16 i_links_count; /* Links count */ + __u32 i_blocks; /* Blocks count */ + __u32 i_flags; /* File flags */ + union { + struct { + __u32 l_i_version; /* was l_i_reserved1 */ + } linux1; + struct { + __u32 h_i_translator; + } hurd1; + } osd1; /* OS dependent 1 */ + __u32 i_block[EXT2_N_BLOCKS];/* Pointers to blocks */ + __u32 i_generation; /* File version (for NFS) */ + __u32 i_file_acl; /* File ACL */ + __u32 i_size_high; /* Formerly i_dir_acl, directory ACL */ + __u32 i_faddr; /* Fragment address */ + union { + struct { + __u16 l_i_blocks_hi; + __u16 l_i_file_acl_high; + __u16 l_i_uid_high; /* these 2 fields */ + __u16 l_i_gid_high; /* were reserved2[0] */ + __u32 l_i_reserved2; + } linux2; + struct { + __u8 h_i_frag; /* Fragment number */ + __u8 h_i_fsize; /* Fragment size */ + __u16 h_i_mode_high; + __u16 h_i_uid_high; + __u16 h_i_gid_high; + __u32 h_i_author; + } hurd2; + } osd2; /* OS dependent 2 */ + __u16 i_extra_isize; + __u16 i_pad1; + __u32 i_ctime_extra; /* extra Change time (nsec << 2 | epoch) */ + __u32 i_mtime_extra; /* extra Modification time (nsec << 2 | epoch) */ + __u32 i_atime_extra; /* extra Access time (nsec << 2 | epoch) */ + __u32 i_crtime; /* File creation time */ + __u32 i_crtime_extra; /* extra File creation time (nsec << 2 | epoch)*/ + __u32 i_version_hi; /* high 32 bits for 64-bit version */ +}; + +#define i_dir_acl i_size_high + +#if defined(__KERNEL__) || defined(__linux__) +#define i_reserved1 osd1.linux1.l_i_reserved1 +#define i_frag osd2.linux2.l_i_frag +#define i_fsize osd2.linux2.l_i_fsize +#define i_uid_low i_uid +#define i_gid_low i_gid +#define i_uid_high osd2.linux2.l_i_uid_high +#define i_gid_high osd2.linux2.l_i_gid_high +#define i_reserved2 osd2.linux2.l_i_reserved2 +#else +#if defined(__GNU__) + +#define i_translator osd1.hurd1.h_i_translator +#define i_frag osd2.hurd2.h_i_frag; +#define i_fsize osd2.hurd2.h_i_fsize; +#define i_uid_high osd2.hurd2.h_i_uid_high +#define i_gid_high osd2.hurd2.h_i_gid_high +#define i_author osd2.hurd2.h_i_author + +#endif /* __GNU__ */ +#endif /* defined(__KERNEL__) || defined(__linux__) */ + +#define inode_uid(inode) ((inode).i_uid | (inode).osd2.linux2.l_i_uid_high << 16) +#define inode_gid(inode) ((inode).i_gid | (inode).osd2.linux2.l_i_gid_high << 16) +#define ext2fs_set_i_uid_high(inode,x) ((inode).osd2.linux2.l_i_uid_high = (x)) +#define ext2fs_set_i_gid_high(inode,x) ((inode).osd2.linux2.l_i_gid_high = (x)) + +/* + * File system states + */ +#define EXT2_VALID_FS 0x0001 /* Unmounted cleanly */ +#define EXT2_ERROR_FS 0x0002 /* Errors detected */ +#define EXT3_ORPHAN_FS 0x0004 /* Orphans being recovered */ + +/* + * Misc. filesystem flags + */ +#define EXT2_FLAGS_SIGNED_HASH 0x0001 /* Signed dirhash in use */ +#define EXT2_FLAGS_UNSIGNED_HASH 0x0002 /* Unsigned dirhash in use */ +#define EXT2_FLAGS_TEST_FILESYS 0x0004 /* OK for use on development code */ +#define EXT2_FLAGS_IS_SNAPSHOT 0x0010 /* This is a snapshot image */ +#define EXT2_FLAGS_FIX_SNAPSHOT 0x0020 /* Snapshot inodes corrupted */ +#define EXT2_FLAGS_FIX_EXCLUDE 0x0040 /* Exclude bitmaps corrupted */ + +/* + * Mount flags + */ +#define EXT2_MOUNT_CHECK 0x0001 /* Do mount-time checks */ +#define EXT2_MOUNT_GRPID 0x0004 /* Create files with directory's group */ +#define EXT2_MOUNT_DEBUG 0x0008 /* Some debugging messages */ +#define EXT2_MOUNT_ERRORS_CONT 0x0010 /* Continue on errors */ +#define EXT2_MOUNT_ERRORS_RO 0x0020 /* Remount fs ro on errors */ +#define EXT2_MOUNT_ERRORS_PANIC 0x0040 /* Panic on errors */ +#define EXT2_MOUNT_MINIX_DF 0x0080 /* Mimics the Minix statfs */ +#define EXT2_MOUNT_NO_UID32 0x0200 /* Disable 32-bit UIDs */ + +#define clear_opt(o, opt) o &= ~EXT2_MOUNT_##opt +#define set_opt(o, opt) o |= EXT2_MOUNT_##opt +#define test_opt(sb, opt) (EXT2_SB(sb)->s_mount_opt & \ + EXT2_MOUNT_##opt) +/* + * Maximal mount counts between two filesystem checks + */ +#define EXT2_DFL_MAX_MNT_COUNT 20 /* Allow 20 mounts */ +#define EXT2_DFL_CHECKINTERVAL 0 /* Don't use interval check */ + +/* + * Behaviour when detecting errors + */ +#define EXT2_ERRORS_CONTINUE 1 /* Continue execution */ +#define EXT2_ERRORS_RO 2 /* Remount fs read-only */ +#define EXT2_ERRORS_PANIC 3 /* Panic */ +#define EXT2_ERRORS_DEFAULT EXT2_ERRORS_CONTINUE + +#if (__GNUC__ >= 4) +#define ext4_offsetof(TYPE,MEMBER) __builtin_offsetof(TYPE,MEMBER) +#else +#define ext4_offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER) +#endif + +/* + * Structure of the super block + */ +struct ext2_super_block { + __u32 s_inodes_count; /* Inodes count */ + __u32 s_blocks_count; /* Blocks count */ + __u32 s_r_blocks_count; /* Reserved blocks count */ + __u32 s_free_blocks_count; /* Free blocks count */ + __u32 s_free_inodes_count; /* Free inodes count */ + __u32 s_first_data_block; /* First Data Block */ + __u32 s_log_block_size; /* Block size */ + __u32 s_log_cluster_size; /* Allocation cluster size */ + __u32 s_blocks_per_group; /* # Blocks per group */ + __u32 s_clusters_per_group; /* # Fragments per group */ + __u32 s_inodes_per_group; /* # Inodes per group */ + __u32 s_mtime; /* Mount time */ + __u32 s_wtime; /* Write time */ + __u16 s_mnt_count; /* Mount count */ + __s16 s_max_mnt_count; /* Maximal mount count */ + __u16 s_magic; /* Magic signature */ + __u16 s_state; /* File system state */ + __u16 s_errors; /* Behaviour when detecting errors */ + __u16 s_minor_rev_level; /* minor revision level */ + __u32 s_lastcheck; /* time of last check */ + __u32 s_checkinterval; /* max. time between checks */ + __u32 s_creator_os; /* OS */ + __u32 s_rev_level; /* Revision level */ + __u16 s_def_resuid; /* Default uid for reserved blocks */ + __u16 s_def_resgid; /* Default gid for reserved blocks */ + /* + * These fields are for EXT2_DYNAMIC_REV superblocks only. + * + * Note: the difference between the compatible feature set and + * the incompatible feature set is that if there is a bit set + * in the incompatible feature set that the kernel doesn't + * know about, it should refuse to mount the filesystem. + * + * e2fsck's requirements are more strict; if it doesn't know + * about a feature in either the compatible or incompatible + * feature set, it must abort and not try to meddle with + * things it doesn't understand... + */ + __u32 s_first_ino; /* First non-reserved inode */ + __u16 s_inode_size; /* size of inode structure */ + __u16 s_block_group_nr; /* block group # of this superblock */ + __u32 s_feature_compat; /* compatible feature set */ + __u32 s_feature_incompat; /* incompatible feature set */ + __u32 s_feature_ro_compat; /* readonly-compatible feature set */ + __u8 s_uuid[16]; /* 128-bit uuid for volume */ + char s_volume_name[16]; /* volume name */ + char s_last_mounted[64]; /* directory where last mounted */ + __u32 s_algorithm_usage_bitmap; /* For compression */ + /* + * Performance hints. Directory preallocation should only + * happen if the EXT2_FEATURE_COMPAT_DIR_PREALLOC flag is on. + */ + __u8 s_prealloc_blocks; /* Nr of blocks to try to preallocate*/ + __u8 s_prealloc_dir_blocks; /* Nr to preallocate for dirs */ + __u16 s_reserved_gdt_blocks; /* Per group table for online growth */ + /* + * Journaling support valid if EXT2_FEATURE_COMPAT_HAS_JOURNAL set. + */ + __u8 s_journal_uuid[16]; /* uuid of journal superblock */ + __u32 s_journal_inum; /* inode number of journal file */ + __u32 s_journal_dev; /* device number of journal file */ + __u32 s_last_orphan; /* start of list of inodes to delete */ + __u32 s_hash_seed[4]; /* HTREE hash seed */ + __u8 s_def_hash_version; /* Default hash version to use */ + __u8 s_jnl_backup_type; /* Default type of journal backup */ + __u16 s_desc_size; /* Group desc. size: INCOMPAT_64BIT */ + __u32 s_default_mount_opts; + __u32 s_first_meta_bg; /* First metablock group */ + __u32 s_mkfs_time; /* When the filesystem was created */ + __u32 s_jnl_blocks[17]; /* Backup of the journal inode */ + __u32 s_blocks_count_hi; /* Blocks count high 32bits */ + __u32 s_r_blocks_count_hi; /* Reserved blocks count high 32 bits*/ + __u32 s_free_blocks_hi; /* Free blocks count */ + __u16 s_min_extra_isize; /* All inodes have at least # bytes */ + __u16 s_want_extra_isize; /* New inodes should reserve # bytes */ + __u32 s_flags; /* Miscellaneous flags */ + __u16 s_raid_stride; /* RAID stride */ + __u16 s_mmp_interval; /* # seconds to wait in MMP checking */ + __u64 s_mmp_block; /* Block for multi-mount protection */ + __u32 s_raid_stripe_width; /* blocks on all data disks (N*stride)*/ + __u8 s_log_groups_per_flex; /* FLEX_BG group size */ + __u8 s_reserved_char_pad; + __u16 s_reserved_pad; /* Padding to next 32bits */ + __u64 s_kbytes_written; /* nr of lifetime kilobytes written */ + __u32 s_snapshot_inum; /* Inode number of active snapshot */ + __u32 s_snapshot_id; /* sequential ID of active snapshot */ + __u64 s_snapshot_r_blocks_count; /* reserved blocks for active + snapshot's future use */ + __u32 s_snapshot_list; /* inode number of the head of the on-disk snapshot list */ +#define EXT4_S_ERR_START ext4_offsetof(struct ext2_super_block, s_error_count) + __u32 s_error_count; /* number of fs errors */ + __u32 s_first_error_time; /* first time an error happened */ + __u32 s_first_error_ino; /* inode involved in first error */ + __u64 s_first_error_block; /* block involved of first error */ + __u8 s_first_error_func[32]; /* function where the error happened */ + __u32 s_first_error_line; /* line number where error happened */ + __u32 s_last_error_time; /* most recent time of an error */ + __u32 s_last_error_ino; /* inode involved in last error */ + __u32 s_last_error_line; /* line number where error happened */ + __u64 s_last_error_block; /* block involved of last error */ + __u8 s_last_error_func[32]; /* function where the error happened */ +#define EXT4_S_ERR_END ext4_offsetof(struct ext2_super_block, s_mount_opts) + __u8 s_mount_opts[64]; + __u32 s_usr_quota_inum; /* inode number of user quota file */ + __u32 s_grp_quota_inum; /* inode number of group quota file */ + __u32 s_overhead_blocks; /* overhead blocks/clusters in fs */ + __u32 s_reserved[109]; /* Padding to the end of the block */ +}; + +#define EXT4_S_ERR_LEN (EXT4_S_ERR_END - EXT4_S_ERR_START) + +/* + * Codes for operating systems + */ +#define EXT2_OS_LINUX 0 +#define EXT2_OS_HURD 1 +#define EXT2_OBSO_OS_MASIX 2 +#define EXT2_OS_FREEBSD 3 +#define EXT2_OS_LITES 4 + +/* + * Revision levels + */ +#define EXT2_GOOD_OLD_REV 0 /* The good old (original) format */ +#define EXT2_DYNAMIC_REV 1 /* V2 format w/ dynamic inode sizes */ + +#define EXT2_CURRENT_REV EXT2_GOOD_OLD_REV +#define EXT2_MAX_SUPP_REV EXT2_DYNAMIC_REV + +#define EXT2_GOOD_OLD_INODE_SIZE 128 + +/* + * Journal inode backup types + */ +#define EXT3_JNL_BACKUP_BLOCKS 1 + +/* + * Feature set definitions + */ + +#define EXT2_HAS_COMPAT_FEATURE(sb,mask) \ + ( EXT2_SB(sb)->s_feature_compat & (mask) ) +#define EXT2_HAS_RO_COMPAT_FEATURE(sb,mask) \ + ( EXT2_SB(sb)->s_feature_ro_compat & (mask) ) +#define EXT2_HAS_INCOMPAT_FEATURE(sb,mask) \ + ( EXT2_SB(sb)->s_feature_incompat & (mask) ) + +#define EXT2_FEATURE_COMPAT_DIR_PREALLOC 0x0001 +#define EXT2_FEATURE_COMPAT_IMAGIC_INODES 0x0002 +#define EXT3_FEATURE_COMPAT_HAS_JOURNAL 0x0004 +#define EXT2_FEATURE_COMPAT_EXT_ATTR 0x0008 +#define EXT2_FEATURE_COMPAT_RESIZE_INODE 0x0010 +#define EXT2_FEATURE_COMPAT_DIR_INDEX 0x0020 +#define EXT2_FEATURE_COMPAT_LAZY_BG 0x0040 +#define EXT2_FEATURE_COMPAT_EXCLUDE_INODE 0x0080 + +#define EXT2_FEATURE_RO_COMPAT_SPARSE_SUPER 0x0001 +#define EXT2_FEATURE_RO_COMPAT_LARGE_FILE 0x0002 +/* #define EXT2_FEATURE_RO_COMPAT_BTREE_DIR 0x0004 not used */ +#define EXT4_FEATURE_RO_COMPAT_HUGE_FILE 0x0008 +#define EXT4_FEATURE_RO_COMPAT_GDT_CSUM 0x0010 +#define EXT4_FEATURE_RO_COMPAT_DIR_NLINK 0x0020 +#define EXT4_FEATURE_RO_COMPAT_EXTRA_ISIZE 0x0040 +#define EXT4_FEATURE_RO_COMPAT_HAS_SNAPSHOT 0x0080 +#define EXT4_FEATURE_RO_COMPAT_QUOTA 0x0100 +#define EXT4_FEATURE_RO_COMPAT_BIGALLOC 0x0200 + +#define EXT2_FEATURE_INCOMPAT_COMPRESSION 0x0001 +#define EXT2_FEATURE_INCOMPAT_FILETYPE 0x0002 +#define EXT3_FEATURE_INCOMPAT_RECOVER 0x0004 /* Needs recovery */ +#define EXT3_FEATURE_INCOMPAT_JOURNAL_DEV 0x0008 /* Journal device */ +#define EXT2_FEATURE_INCOMPAT_META_BG 0x0010 +#define EXT3_FEATURE_INCOMPAT_EXTENTS 0x0040 +#define EXT4_FEATURE_INCOMPAT_64BIT 0x0080 +#define EXT4_FEATURE_INCOMPAT_MMP 0x0100 +#define EXT4_FEATURE_INCOMPAT_FLEX_BG 0x0200 +#define EXT4_FEATURE_INCOMPAT_EA_INODE 0x0400 +#define EXT4_FEATURE_INCOMPAT_DIRDATA 0x1000 + +#define EXT2_FEATURE_COMPAT_SUPP 0 +#define EXT2_FEATURE_INCOMPAT_SUPP (EXT2_FEATURE_INCOMPAT_FILETYPE) +#define EXT2_FEATURE_RO_COMPAT_SUPP (EXT2_FEATURE_RO_COMPAT_SPARSE_SUPER| \ + EXT2_FEATURE_RO_COMPAT_LARGE_FILE| \ + EXT4_FEATURE_RO_COMPAT_DIR_NLINK| \ + EXT2_FEATURE_RO_COMPAT_BTREE_DIR) + +/* + * Default values for user and/or group using reserved blocks + */ +#define EXT2_DEF_RESUID 0 +#define EXT2_DEF_RESGID 0 + +/* + * Default mount options + */ +#define EXT2_DEFM_DEBUG 0x0001 +#define EXT2_DEFM_BSDGROUPS 0x0002 +#define EXT2_DEFM_XATTR_USER 0x0004 +#define EXT2_DEFM_ACL 0x0008 +#define EXT2_DEFM_UID16 0x0010 +#define EXT3_DEFM_JMODE 0x0060 +#define EXT3_DEFM_JMODE_DATA 0x0020 +#define EXT3_DEFM_JMODE_ORDERED 0x0040 +#define EXT3_DEFM_JMODE_WBACK 0x0060 +#define EXT4_DEFM_NOBARRIER 0x0100 +#define EXT4_DEFM_BLOCK_VALIDITY 0x0200 +#define EXT4_DEFM_DISCARD 0x0400 +#define EXT4_DEFM_NODELALLOC 0x0800 + +/* + * Structure of a directory entry + */ +#define EXT2_NAME_LEN 255 + +struct ext2_dir_entry { + __u32 inode; /* Inode number */ + __u16 rec_len; /* Directory entry length */ + __u16 name_len; /* Name length */ + char name[EXT2_NAME_LEN]; /* File name */ +}; + +/* + * The new version of the directory entry. Since EXT2 structures are + * stored in intel byte order, and the name_len field could never be + * bigger than 255 chars, it's safe to reclaim the extra byte for the + * file_type field. + */ +struct ext2_dir_entry_2 { + __u32 inode; /* Inode number */ + __u16 rec_len; /* Directory entry length */ + __u8 name_len; /* Name length */ + __u8 file_type; + char name[EXT2_NAME_LEN]; /* File name */ +}; + +/* + * Ext2 directory file types. Only the low 3 bits are used. The + * other bits are reserved for now. + */ +#define EXT2_FT_UNKNOWN 0 +#define EXT2_FT_REG_FILE 1 +#define EXT2_FT_DIR 2 +#define EXT2_FT_CHRDEV 3 +#define EXT2_FT_BLKDEV 4 +#define EXT2_FT_FIFO 5 +#define EXT2_FT_SOCK 6 +#define EXT2_FT_SYMLINK 7 + +#define EXT2_FT_MAX 8 + +/* + * EXT2_DIR_PAD defines the directory entries boundaries + * + * NOTE: It must be a multiple of 4 + */ +#define EXT2_DIR_PAD 4 +#define EXT2_DIR_ROUND (EXT2_DIR_PAD - 1) +#define EXT2_DIR_REC_LEN(name_len) (((name_len) + 8 + EXT2_DIR_ROUND) & \ + ~EXT2_DIR_ROUND) + +/* + * This structure will be used for multiple mount protection. It will be + * written into the block number saved in the s_mmp_block field in the + * superblock. + */ +#define EXT2_MMP_MAGIC 0x004D4D50 /* ASCII for MMP */ +#define EXT2_MMP_CLEAN 0xFF4D4D50 /* Value of mmp_seq for clean unmount */ +#define EXT2_MMP_FSCK_ON 0xE24D4D50 /* Value of mmp_seq when being fscked */ + +struct mmp_struct { + __u32 mmp_magic; + __u32 mmp_seq; + __u64 mmp_time; + char mmp_nodename[64]; + char mmp_bdevname[32]; + __u16 mmp_interval; + __u16 mmp_pad1; + __u32 mmp_pad2; +}; + +/* + * Interval in number of seconds to update the MMP sequence number. + */ +#define EXT2_MMP_DEF_INTERVAL 5 + +#endif /* _LINUX_EXT2_FS_H */ diff --git a/portlibs/sources/libext2fs/source/ext2_internal.c b/portlibs/sources/libext2fs/source/ext2_internal.c new file mode 100644 index 00000000..d75133a7 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2_internal.c @@ -0,0 +1,1076 @@ +/** + * ext2_internal.c - Internal support routines for EXT2-based devices. + * + * Copyright (c) 2006 Michael "Chishm" Chisholm + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2010 Dimok + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include <stdlib.h> +#include <errno.h> +#include <string.h> +#include "ext2_internal.h" +#include "ext2dir.h" +#include "ext2file.h" +#include "gekko_io.h" + +// EXT2 device driver devoptab +static const devoptab_t devops_ext2 = +{ + NULL, /* Device name */ + sizeof(ext2_file_state), + ext2_open_r, + ext2_close_r, + ext2_write_r, + ext2_read_r, + ext2_seek_r, + ext2_fstat_r, + ext2_stat_r, + ext2_link_r, + ext2_unlink_r, + ext2_chdir_r, + ext2_rename_r, + ext2_mkdir_r, + sizeof(ext2_dir_state), + ext2_diropen_r, + ext2_dirreset_r, + ext2_dirnext_r, + ext2_dirclose_r, + ext2_statvfs_r, + ext2_ftruncate_r, + ext2_fsync_r, + NULL /* Device data */ +}; + + +const devoptab_t *ext2GetDevOpTab() +{ + return &devops_ext2; +} + +int ext2AddDevice (const char *name, void *deviceData) +{ + const devoptab_t *devoptab_ext2 = ext2GetDevOpTab(); + devoptab_t *dev = NULL; + char *devname = NULL; + int i; + + // Sanity check + if (!name || !deviceData || !devoptab_ext2) { + errno = EINVAL; + return -1; + } + + // Allocate a devoptab for this device + dev = (devoptab_t *) mem_alloc(sizeof(devoptab_t) + strlen(name) + 1); + if (!dev) { + errno = ENOMEM; + return -1; + } + + // Use the space allocated at the end of the devoptab for storing the device name + devname = (char*)(dev + 1); + strcpy(devname, name); + + // Setup the devoptab + memcpy(dev, devoptab_ext2, sizeof(devoptab_t)); + dev->name = devname; + dev->deviceData = deviceData; + + // Add the device to the devoptab table (if there is a free slot) + for (i = 0; i < STD_MAX; i++) { + if (devoptab_list[i] == devoptab_list[0] && i != 0) { + devoptab_list[i] = dev; + return 0; + } + } + + // If we reach here then there are no free slots in the devoptab table for this device + errno = EADDRNOTAVAIL; + return -1; +} + +void ext2RemoveDevice (const char *path) +{ + const devoptab_t *devoptab = NULL; + char name[128] = {0}; + int i; + + // Get the device name from the path + strncpy(name, path, 127); + strtok(name, ":/"); + + // Find and remove the specified device from the devoptab table + // NOTE: We do this manually due to a 'bug' in RemoveDevice + // which ignores names with suffixes + for (i = 0; i < STD_MAX; i++) { + devoptab = devoptab_list[i]; + if (devoptab && devoptab->name) { + if (strcmp(name, devoptab->name) == 0) { + devoptab_list[i] = devoptab_list[0]; + mem_free((devoptab_t*)devoptab); + break; + } + } + } + + return; +} + +const devoptab_t *ext2GetDevice (const char *path) +{ + const devoptab_t *devoptab = NULL; + char name[128] = {0}; + int i; + + // Get the device name from the path + strncpy(name, path, 127); + strtok(name, ":/"); + + // Search the devoptab table for the specified device name + // NOTE: We do this manually due to a 'bug' in GetDeviceOpTab + // which ignores names with suffixes + for (i = 0; i < STD_MAX; i++) { + devoptab = devoptab_list[i]; + if (devoptab && devoptab->name) { + if (strcmp(name, devoptab->name) == 0) { + return devoptab; + } + } + } + + return NULL; +} + +ext2_vd *ext2GetVolume (const char *path) +{ + // Get the volume descriptor from the paths associated devoptab (if found) + const devoptab_t *devoptab_ext2 = ext2GetDevOpTab(); + const devoptab_t *devoptab = ext2GetDevice(path); + if (devoptab && devoptab_ext2 && (devoptab->open_r == devoptab_ext2->open_r)) + return (ext2_vd*)devoptab->deviceData; + + return NULL; +} + +int ext2InitVolume (ext2_vd *vd) +{ + // Sanity check + if (!vd) { + errno = ENODEV; + return -1; + } + + // Reset the volumes data + memset(vd, 0, sizeof(ext2_vd)); + + // Initialise the volume lock + LWP_MutexInit(&vd->lock, false); + + return 0; +} + +void ext2DeinitVolume (ext2_vd *vd) +{ + // Sanity check + if (!vd) { + errno = ENODEV; + return; + } + + // Lock + ext2Lock(vd); + + // Close any directories which are still open (lazy programmers!) + ext2_dir_state *nextDir = vd->firstOpenDir; + while (nextDir) { + ext2CloseDir(nextDir); + nextDir = nextDir->nextOpenDir; + } + + // Close any files which are still open (lazy programmers!) + ext2_file_state *nextFile = vd->firstOpenFile; + while (nextFile) { + ext2CloseFile(nextFile); + nextFile = nextFile->nextOpenFile; + } + + // Reset open directory and file stats + vd->openDirCount = 0; + vd->openFileCount = 0; + vd->firstOpenDir = NULL; + vd->firstOpenFile = NULL; + + // Force the underlying device to sync + ext2Sync(vd, NULL); + + // Unlock + ext2Unlock(vd); + + // Deinitialise the volume lock + LWP_MutexDestroy(vd->lock); +} + +static ext2_ino_t ext2PathToInode(ext2_vd *vd, const char * path) +{ + //Sanity check + if(!vd || !path) + return 0; + + char filename[EXT2_NAME_LEN]; + errcode_t errorcode = 0; + ext2_ino_t ino = 0, parent = vd->cwd_ni && *path != '/' && *path != '\0' ? vd->cwd_ni->ino : vd->root; + const char * ptr = path; + int i; + + while(*ptr == '/') ++ptr; + + if(*ptr == '\0') + return parent; + + while(*ptr != '\0') + { + for(i = 0; *ptr != '\0' && *ptr != '/' && (i < EXT2_NAME_LEN-1); ++ptr, ++i) + filename[i] = *ptr; + + filename[i] = '\0'; + + errorcode = ext2fs_namei(vd->fs, vd->root, parent, filename, &ino); + if(errorcode != EXT2_ET_OK) + return 0; + + parent = ino; + + while(*ptr == '/') ++ptr; + + } + + + return ino; +} + +ext2_inode_t *ext2OpenEntry (ext2_vd *vd, const char *path) +{ + errcode_t errorcode = 0; + ext2_inode_t * ni = 0; + + // Sanity check + if (!vd) { + errno = ENODEV; + return NULL; + } + + // Get the actual path of the entry + path = ext2RealPath(path); + if (!path) + { + errno = EINVAL; + return NULL; + } + + ni = mem_alloc(sizeof(ext2_inode_t)); + if(!ni) + { + errno = ENOMEM; + return NULL; + } + + memset(ni, 0, sizeof(ext2_inode_t)); + + // Find the entry, taking into account our current directory (if any) + ni->ino = ext2PathToInode(vd, path); + if(ni->ino == 0) + { + mem_free(ni); + return NULL; + } + + errorcode = ext2fs_read_inode(vd->fs, ni->ino, &ni->ni); + if(errorcode) + { + mem_free(ni); + return NULL; + } + + return ni; +} + +void ext2CloseEntry(ext2_vd *vd, ext2_inode_t * ni) +{ + // Sanity check + if (!vd || !ni) { + errno = ENODEV; + return; + } + + // Lock + ext2Lock(vd); + + // Sync the entry (if it is dirty) + if(ni && ni->dirty) + ext2fs_write_inode(vd->fs, ni->ino, &ni->ni); + + // Close the entry + if(ni) + mem_free(ni); + + // Unlock + ext2Unlock(vd); + + return; +} + +static ext2_ino_t ext2CreateSymlink(ext2_vd *vd, const char *path, const char * targetdir, const char * name, mode_t type) +{ + ext2_inode_t *target_ni = NULL; + ext2_ino_t newentry = 0; + ext2_ino_t ino = 0; + + // Check if it does exist + target_ni = ext2OpenEntry(vd, targetdir); + if (!target_ni) + goto cleanup; + + int err = ext2fs_new_inode(vd->fs, target_ni->ino, type, 0, &ino); + if (err) + goto cleanup; + + do + { + err = ext2fs_link(vd->fs, target_ni->ino, name, ino, EXT2_FT_SYMLINK); + if (err == EXT2_ET_DIR_NO_SPACE) + { + err = ext2fs_expand_dir(vd->fs, target_ni->ino); + if (err) + goto cleanup; + } + } + while(err == EXT2_ET_DIR_NO_SPACE); + + ext2fs_inode_alloc_stats2(vd->fs, ino, +1, 0); + + struct ext2_inode inode; + memset(&inode, 0, sizeof(inode)); + inode.i_mode = type; + inode.i_atime = inode.i_ctime = inode.i_mtime = time(NULL); + inode.i_links_count = 1; + inode.i_size = strlen(path); //initial size of file + inode.i_uid = target_ni->ni.i_uid; + inode.i_gid = target_ni->ni.i_gid; + + if (strlen(path) <= sizeof(inode.i_block)) + { + /* fast symlink */ + strncpy((char *)&(inode.i_block[0]),path,sizeof(inode.i_blocks)); + } + else + { + /* slow symlink */ + char * buffer = mem_alloc(vd->fs->blocksize); + if (buffer) + { + blk_t blk; + strncpy(buffer, path, vd->fs->blocksize); + err = ext2fs_new_block(vd->fs, 0, 0, &blk); + if (!err) + { + inode.i_block[0] = blk; + inode.i_blocks = vd->fs->blocksize / BYTES_PER_SECTOR; + vd->fs->io->manager->write_blk(vd->fs->io, blk, 1, buffer); + ext2fs_block_alloc_stats(vd->fs, blk, +1); + } + mem_free(buffer); + } + } + + if(ext2fs_write_new_inode(vd->fs, ino, &inode) != 0) + newentry = ino; + +cleanup: + + if(target_ni) + ext2CloseEntry(vd, target_ni); + + return newentry; +} + +static ext2_ino_t ext2CreateMkDir(ext2_vd *vd, ext2_inode_t * parent, int type, const char * name) +{ + ext2_ino_t newentry = 0; + ext2_ino_t existing; + + if(ext2fs_namei(vd->fs, vd->root, parent->ino, name, &existing) == 0) + return 0; + + errcode_t err = ext2fs_new_inode(vd->fs, parent->ino, type, 0, &newentry); + if(err != EXT2_ET_OK) + return 0; + + do + { + err = ext2fs_mkdir(vd->fs, parent->ino, newentry, name); + if(err == EXT2_ET_DIR_NO_SPACE) + { + if(ext2fs_expand_dir(vd->fs, parent->ino) != 0) + return 0; + } + } + while(err == EXT2_ET_DIR_NO_SPACE); + + if(err != EXT2_ET_OK) + return 0; + + struct ext2_inode inode; + if(ext2fs_read_inode(vd->fs, newentry, &inode) == EXT2_ET_OK) + { + inode.i_mode = type; + inode.i_uid = parent->ni.i_uid; + inode.i_gid = parent->ni.i_gid; + ext2fs_write_new_inode(vd->fs, newentry, &inode); + } + + return newentry; +} + + +static ext2_ino_t ext2CreateFile(ext2_vd *vd, ext2_inode_t * parent, int type, const char * name) +{ + errcode_t retval = -1; + ext2_ino_t newfile = 0; + ext2_ino_t existing; + + if(ext2fs_namei(vd->fs, vd->root, parent->ino, name, &existing) == 0) + return 0; + + retval = ext2fs_new_inode(vd->fs, parent->ino, type, 0, &newfile); + if (retval) + return 0; + + do + { + retval = ext2fs_link(vd->fs, parent->ino, name, newfile, EXT2_FT_REG_FILE); + if (retval == EXT2_ET_DIR_NO_SPACE) + { + if (ext2fs_expand_dir(vd->fs, parent->ino) != 0) + return 0; + } + } + while(retval == EXT2_ET_DIR_NO_SPACE); + + if (retval) + return 0; + + ext2fs_inode_alloc_stats2(vd->fs, newfile, +1, 0); + + struct ext2_inode inode; + memset(&inode, 0, sizeof(inode)); + inode.i_mode = type; + inode.i_atime = inode.i_ctime = inode.i_mtime = time(0); + inode.i_links_count = 1; + inode.i_size = 0; + inode.i_uid = parent->ni.i_uid; + inode.i_gid = parent->ni.i_gid; + + if (ext2fs_write_new_inode(vd->fs, newfile, &inode) != 0) + return 0; + + return newfile; +} + +ext2_inode_t *ext2Create(ext2_vd *vd, const char *path, mode_t type, const char *target) +{ + ext2_inode_t *dir_ni = NULL, *ni = NULL; + char *dir = NULL; + char *targetdir = NULL; + char *name = NULL; + ext2_ino_t newentry = 0; + + // Sanity check + if (!vd || !vd->fs) { + errno = ENODEV; + return NULL; + } + + if(!(vd->fs->flags & EXT2_FLAG_RW)) + return NULL; + + // You cannot link between devices + if(target) { + if(vd != ext2GetVolume(target)) { + errno = EXDEV; + return NULL; + } + // Check if existing + dir_ni = ext2OpenEntry(vd, target); + if (dir_ni) { + goto cleanup; + } + ext2CloseEntry(vd, dir_ni); + dir_ni = NULL; + targetdir = strdup(target); + if (!targetdir) { + errno = EINVAL; + goto cleanup; + } + } + + // Get the actual paths of the entry + path = ext2RealPath(path); + target = ext2RealPath(target); + if (!path) { + errno = EINVAL; + return NULL; + } + + // Lock + ext2Lock(vd); + + // Clean me + // NOTE: this looks horrible right now and need a cleanup + dir = strdup(path); + if (!dir) { + errno = EINVAL; + goto cleanup; + } + + char * tmp_path = (targetdir && (type == S_IFLNK)) ? targetdir : dir; + if (strrchr(tmp_path, '/') != NULL) + { + char * ptr = strrchr(tmp_path, '/'); + name = strdup(ptr+1); + *ptr = '\0'; + } + else + name = strdup(tmp_path); + + // Open the entries parent directory + dir_ni = ext2OpenEntry(vd, dir); + if (!dir_ni) { + goto cleanup; + } + + // If not yet read, read the inode and block bitmap + if(!vd->fs->inode_map || !vd->fs->block_map) + ext2fs_read_bitmaps(vd->fs); + + // Symbolic link + if(type == S_IFLNK) + { + if (!target) { + errno = EINVAL; + goto cleanup; + } + + newentry = ext2CreateSymlink(vd, path, targetdir, name, type); + } + // Directory + else if(type == S_IFDIR) + { + newentry = ext2CreateMkDir(vd, dir_ni, LINUX_S_IFDIR | (0755 & ~vd->fs->umask), name); + } + // File + else if(type == S_IFREG) + { + newentry = ext2CreateFile(vd, dir_ni, LINUX_S_IFREG | (0755 & ~vd->fs->umask), name); + } + + // If the entry was created + if (newentry != 0) + { + // Sync the entry to disc + ext2Sync(vd, NULL); + + ni = ext2OpenEntry(vd, target ? target : path); + } + +cleanup: + + if(dir_ni) + ext2CloseEntry(vd, dir_ni); + + if(name) + mem_free(name); + + if(dir) + mem_free(dir); + + if(targetdir) + mem_free(targetdir); + + // Unlock + ext2Unlock(vd); + + return ni; +} + +/* + * Given a mode, return the ext2 file type + */ +static int ext2_file_type(unsigned int mode) +{ + if (LINUX_S_ISREG(mode)) + return EXT2_FT_REG_FILE; + + if (LINUX_S_ISDIR(mode)) + return EXT2_FT_DIR; + + if (LINUX_S_ISCHR(mode)) + return EXT2_FT_CHRDEV; + + if (LINUX_S_ISBLK(mode)) + return EXT2_FT_BLKDEV; + + if (LINUX_S_ISLNK(mode)) + return EXT2_FT_SYMLINK; + + if (LINUX_S_ISFIFO(mode)) + return EXT2_FT_FIFO; + + if (LINUX_S_ISSOCK(mode)) + return EXT2_FT_SOCK; + + return 0; +} + +int ext2Link(ext2_vd *vd, const char *old_path, const char *new_path) +{ + ext2_inode_t *dir_ni = NULL, *ni = NULL; + char *dir = NULL; + char *name = NULL; + errcode_t err = 0; + + // Sanity check + if (!vd || !vd->fs) { + errno = ENODEV; + return -1; + } + + if(!(vd->fs->flags & EXT2_FLAG_RW)) + return -1; + + // You cannot link between devices + if(vd != ext2GetVolume(new_path)) { + errno = EXDEV; + return -1; + } + + // Get the actual paths of the entry + old_path = ext2RealPath(old_path); + new_path = ext2RealPath(new_path); + if (!old_path || !new_path) { + errno = EINVAL; + return -1; + } + + // Lock + ext2Lock(vd); + + //check for existing in new path + ni = ext2OpenEntry(vd, new_path); + if (ni) { + ext2CloseEntry(vd, ni); + ni = NULL; + errno = EINVAL; + return -1; + } + + dir = strdup(new_path); + if (!dir) { + errno = EINVAL; + err = -1; + goto cleanup; + } + char * ptr = strrchr(dir, '/'); + if (ptr) + { + name = strdup(ptr+1); + *ptr = 0; + } + else + name = strdup(dir); + + // Find the entry + ni = ext2OpenEntry(vd, old_path); + if (!ni) { + errno = ENOENT; + err = -1; + goto cleanup; + } + + // Open the entries new parent directory + dir_ni = ext2OpenEntry(vd, dir); + if (!dir_ni) { + errno = ENOENT; + err = -1; + goto cleanup; + } + + do + { + // Link the entry to its new parent + err = ext2fs_link(vd->fs, dir_ni->ino, name, ni->ino, ext2_file_type(ni->ni.i_mode)); + if (err == EXT2_ET_DIR_NO_SPACE) + { + if (ext2fs_expand_dir(vd->fs, dir_ni->ino) != 0) + goto cleanup; + } + else if(err != 0) + { + errno = ENOMEM; + goto cleanup; + } + } + while(err == EXT2_ET_DIR_NO_SPACE); + + ni->ni.i_links_count++; + + // Update entry times + ext2UpdateTimes(vd, ni, EXT2_UPDATE_MCTIME); + + // Sync the entry to disc + ext2Sync(vd, ni); + +cleanup: + + if(dir_ni) + ext2CloseEntry(vd, dir_ni); + + if(ni) + ext2CloseEntry(vd, ni); + + if(dir) + mem_free(dir); + + if(name) + mem_free(name); + + // Unlock + ext2Unlock(vd); + + return err; +} + +typedef struct _rd_struct +{ + ext2_ino_t parent; + int empty; +} rd_struct; + +static int release_blocks_proc(ext2_filsys fs, blk_t *blocknr, int blockcnt EXT2FS_ATTR((unused)), void *private EXT2FS_ATTR((unused))) +{ + blk_t block; + + block = *blocknr; + ext2fs_block_alloc_stats(fs, block, -1); + *blocknr = 0; + return 0; +} + +static int unlink_proc(ext2_ino_t dir EXT2FS_ATTR((unused)), int entry EXT2FS_ATTR((unused)), + struct ext2_dir_entry *dirent, int offset EXT2FS_ATTR((unused)), + int blocksize EXT2FS_ATTR((unused)), char *buf EXT2FS_ATTR((unused)), + void *private_data) +{ + rd_struct *rds = (rd_struct *) private_data; + + if (dirent->inode == 0) + return 0; + if (((dirent->name_len & 0xFF) == 1) && (dirent->name[0] == '.')) + return 0; + if (((dirent->name_len & 0xFF) == 2) && (dirent->name[0] == '.') && + (dirent->name[1] == '.')) { + rds->parent = dirent->inode; + return 0; + } + + rds->empty = 0; + return 0; +} + +int ext2Unlink (ext2_vd *vd, const char *path) +{ + ext2_inode_t *dir_ni = NULL, *ni = NULL; + char *dir = NULL; + char *name = NULL; + errcode_t err = -1; + + // Sanity check + if (!vd || !vd->fs) { + errno = ENODEV; + return -1; + } + + if(!(vd->fs->flags & EXT2_FLAG_RW)) + return -1; + + // Get the actual path of the entry + path = ext2RealPath(path); + if (!path) { + errno = EINVAL; + return -1; + } + + // Lock + ext2Lock(vd); + + dir = strdup(path); + if (!dir) { + errno = EINVAL; + goto cleanup; + } + char * ptr = strrchr(dir, '/'); + if (ptr) + { + name = strdup(ptr+1); + *ptr = 0; + } + else + name = dir; + + // Find the entry + ni = ext2OpenEntry(vd, path); + if (!ni) { + errno = ENOENT; + goto cleanup; + } + + // Open the entries parent directory + dir_ni = ext2OpenEntry(vd, dir); + if (!dir_ni) { + errno = ENOENT; + goto cleanup; + } + + // Directory + if(LINUX_S_ISDIR(ni->ni.i_mode)) + { + rd_struct rds; + rds.parent = 0; + rds.empty = 1; + + if (ext2fs_dir_iterate2(vd->fs, ni->ino, 0, 0, unlink_proc, &rds) != 0) + goto cleanup; + + if(!rds.empty) + goto cleanup; + + if (rds.parent) + { + struct ext2_inode inode; + if (ext2fs_read_inode(vd->fs, rds.parent, &inode) == 0) + { + if(inode.i_links_count > 1) + inode.i_links_count--; + ext2fs_write_inode(vd->fs, rds.parent, &inode); + } + } + + // set link count 0 + ni->ni.i_links_count = 0; + } + // File + else + { + ni->ni.i_links_count--; + } + + if(ni->ni.i_links_count <= 0) + { + ni->ni.i_size = 0; + ni->ni.i_size_high = 0; + ni->ni.i_links_count = 0; + ni->ni.i_dtime = (u32) time(0); + } + + ext2fs_write_inode(vd->fs, ni->ino, &ni->ni); + + // Unlink the entry from its parent + if(ext2fs_unlink(vd->fs, dir_ni->ino, name, 0, 0) != 0) + goto cleanup; + + if (ext2fs_inode_has_valid_blocks(&ni->ni)) + { + ext2fs_block_iterate(vd->fs, ni->ino, 0, NULL, release_blocks_proc, NULL); + ext2fs_inode_alloc_stats2(vd->fs, ni->ino, -1, LINUX_S_ISDIR(ni->ni.i_mode)); + } + + if(ni->ni.i_links_count == 0) + { + // It's odd that i have to do this on my own and the lib is not doing that for me + blk64_t truncate_block = ((vd->fs->blocksize - 1) >> EXT2_BLOCK_SIZE_BITS(vd->fs->super)) + 1; + ext2fs_punch(vd->fs, ni->ino, &ni->ni, 0, truncate_block, ~0ULL); + } + + // Sync the entry to disc + ext2Sync(vd, NULL); + + err = 0; + +cleanup: + + if(dir_ni) + ext2CloseEntry(vd, dir_ni); + + if(ni) + ext2CloseEntry(vd, ni); + + if(name) + mem_free(name); + + if(dir) + mem_free(dir); + + // Unlock + ext2Unlock(vd); + + return err; +} + + +int ext2Sync(ext2_vd *vd, ext2_inode_t *ni) +{ + errcode_t res = 0; + + // Sanity check + if (!vd || !vd->fs) { + errno = ENODEV; + return -1; + } + + if(!(vd->fs->flags & EXT2_FLAG_RW)) + return -1; + + // Lock + ext2Lock(vd); + + if(ni && ni->dirty) + { + ext2fs_write_inode(vd->fs, ni->ino, &ni->ni); + ni->dirty = false; + } + + // Sync the entry + res = ext2fs_flush(vd->fs); + + // Force the underlying device to sync + vd->io->manager->flush(vd->io); + + // Unlock + ext2Unlock(vd); + + return res; + +} + +int ext2Stat (ext2_vd *vd, ext2_inode_t *ni_main, struct stat *st) +{ + int res = 0; + + // Sanity check + if (!vd) { + errno = ENODEV; + return -1; + } + + struct ext2_inode * ni = ni_main ? &ni_main->ni : 0; + + // Sanity check + if (!ni) { + errno = ENOENT; + return -1; + } + + // Short circuit cases were we don't actually have to do anything + if (!st) + return 0; + + // Lock + ext2Lock(vd); + + // Zero out the stat buffer + memset(st, 0, sizeof(struct stat)); + + if(LINUX_S_ISDIR(ni->i_mode)) + { + st->st_nlink = 1; + st->st_size = ni->i_size; + } + else + { + st->st_nlink = ni->i_links_count; + st->st_size = EXT2_I_SIZE(ni); + } + + st->st_mode = ni->i_mode; + st->st_blocks = ni->i_blocks; + st->st_blksize = vd->fs->blocksize; + + // Fill in the generic entry stats + st->st_dev = (dev_t) ((long) vd->fs); + st->st_uid = ni->i_uid | (((u32) ni->osd2.linux2.l_i_uid_high) << 16); + st->st_gid = ni->i_gid | (((u32) ni->osd2.linux2.l_i_gid_high) << 16); + st->st_ino = ni_main->ino; + st->st_atime = ni->i_atime; + st->st_ctime = ni->i_ctime; + st->st_mtime = ni->i_mtime; + + // Update entry times + ext2UpdateTimes(vd, ni_main, EXT2_UPDATE_ATIME); + + // Unlock + ext2Unlock(vd); + + return res; +} + +void ext2UpdateTimes(ext2_vd *vd, ext2_inode_t *ni, ext2_time_update_flags mask) +{ + // Sanity check + if(!ni || !mask) + return; + + if(!(vd->fs->flags & EXT2_FLAG_RW)) + return; + + u32 now = (u32) time(0); + + if(mask & EXT2_UPDATE_ATIME) + ni->ni.i_atime = now; + if(mask & EXT2_UPDATE_MTIME) + ni->ni.i_mtime = now; + if(mask & EXT2_UPDATE_CTIME) + ni->ni.i_ctime = now; + + ni->dirty = true; +} + +const char *ext2RealPath (const char *path) +{ + // Sanity check + if (!path) + return NULL; + + // Move the path pointer to the start of the actual path + if (strchr(path, ':') != NULL) { + path = strchr(path, ':')+1; + } + if (strchr(path, ':') != NULL) { + return NULL; + } + + return path; +} diff --git a/portlibs/sources/libext2fs/source/ext2_internal.h b/portlibs/sources/libext2fs/source/ext2_internal.h new file mode 100644 index 00000000..24dd4a52 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2_internal.h @@ -0,0 +1,102 @@ +/** + * ext2_internal.h + * + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2010 Dimok + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ +#ifndef EXT2_INTERNAL_H_ +#define EXT2_INTERNAL_H_ + +#include <gccore.h> +#include <ogc/disc_io.h> +#include <sys/iosupport.h> +#include "ext2fs.h" +#include "ext2_fs.h" +#include "mem_allocate.h" + +#ifdef DEBUG_GEKKO +#define ext2_log_trace printf +#else +#define ext2_log_trace(...) +#endif + +typedef struct _ext2_inode_t +{ + struct ext2_inode ni; + ext2_ino_t ino; + bool dirty; +} ext2_inode_t; + +/** + * ext2_vd - EXT2 volume descriptor + */ +typedef struct _ext2_vd +{ + io_channel io; /* EXT device handle */ + ext2_filsys fs; /* EXT volume handle */ + mutex_t lock; /* Volume lock mutex */ + ext2_inode_t *cwd_ni; /* Current directory */ + struct _ext2_dir_state *firstOpenDir; /* The start of a FILO linked list of currently opened directories */ + struct _ext2_file_state *firstOpenFile; /* The start of a FILO linked list of currently opened files */ + u16 openDirCount; /* The total number of directories currently open in this volume */ + u16 openFileCount; /* The total number of files currently open in this volume */ + ext2_ino_t root; /* Root node */ +} ext2_vd; + +typedef enum { + EXT2_UPDATE_ATIME = 0x01, + EXT2_UPDATE_MTIME = 0x02, + EXT2_UPDATE_CTIME = 0x04, + EXT2_UPDATE_AMTIME = EXT2_UPDATE_ATIME | EXT2_UPDATE_MTIME, + EXT2_UPDATE_ACTIME = EXT2_UPDATE_ATIME | EXT2_UPDATE_CTIME, + EXT2_UPDATE_MCTIME = EXT2_UPDATE_MTIME | EXT2_UPDATE_CTIME, + EXT2_UPDATE_AMCTIME = EXT2_UPDATE_ATIME | EXT2_UPDATE_MTIME | EXT2_UPDATE_CTIME, +} ext2_time_update_flags; + +/* Lock volume */ +static inline void ext2Lock (ext2_vd *vd) +{ + LWP_MutexLock(vd->lock); +} + +/* Unlock volume */ +static inline void ext2Unlock (ext2_vd *vd) +{ + LWP_MutexUnlock(vd->lock); +} + +const char *ext2RealPath (const char *path); +int ext2InitVolume (ext2_vd *vd); +void ext2DeinitVolume (ext2_vd *vd); +ext2_vd *ext2GetVolume (const char *path); + +int ext2AddDevice (const char *name, void *deviceData); +void ext2RemoveDevice (const char *path); +const devoptab_t *ext2GetDevice (const char *path); + +ext2_inode_t *ext2OpenEntry (ext2_vd *vd, const char *path); +void ext2CloseEntry (ext2_vd *vd, ext2_inode_t * ni); +int ext2Stat (ext2_vd *vd, ext2_inode_t * ni, struct stat *st); +int ext2Sync (ext2_vd *vd, ext2_inode_t * ni); + +ext2_inode_t *ext2Create (ext2_vd *vd, const char *path, mode_t type, const char *target); +int ext2Link (ext2_vd *vd, const char *old_path, const char *new_path); +int ext2Unlink (ext2_vd *vd, const char *path); + +void ext2UpdateTimes(ext2_vd *vd, ext2_inode_t *ni, ext2_time_update_flags mask); + +#endif diff --git a/portlibs/sources/libext2fs/source/ext2_io.h b/portlibs/sources/libext2fs/source/ext2_io.h new file mode 100644 index 00000000..9f84d996 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2_io.h @@ -0,0 +1,144 @@ +/* + * io.h --- the I/O manager abstraction + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#ifndef _EXT2FS_EXT2_IO_H +#define _EXT2FS_EXT2_IO_H + +#include "ext2fs.h" + +/* + * ext2_loff_t is defined here since unix_io.c needs it. + */ +typedef long long ext2_loff_t; + +/* llseek.c */ +ext2_loff_t ext2fs_llseek (int, ext2_loff_t, int); + +typedef struct struct_io_manager *io_manager; +typedef struct struct_io_channel *io_channel; +typedef struct struct_io_stats *io_stats; + +#define CHANNEL_FLAGS_WRITETHROUGH 0x01 +#define CHANNEL_FLAGS_DISCARD_ZEROES 0x02 + +#define io_channel_discard_zeroes_data(i) (i->flags & CHANNEL_FLAGS_DISCARD_ZEROES) + +struct struct_io_channel { + errcode_t magic; + io_manager manager; + char *name; + int block_size; + errcode_t (*read_error)(io_channel channel, + unsigned long block, + int count, + void *data, + size_t size, + int actual_bytes_read, + errcode_t error); + errcode_t (*write_error)(io_channel channel, + unsigned long block, + int count, + const void *data, + size_t size, + int actual_bytes_written, + errcode_t error); + int refcount; + int flags; + long reserved[14]; + void *private_data; + void *app_data; +}; + +struct struct_io_stats { + int num_fields; + int reserved; + unsigned long long bytes_read; + unsigned long long bytes_written; +}; + +struct struct_io_manager { + errcode_t magic; + const char *name; + errcode_t (*open)(const char *name, int flags, io_channel *channel); + errcode_t (*close)(io_channel channel); + errcode_t (*set_blksize)(io_channel channel, int blksize); + errcode_t (*read_blk)(io_channel channel, unsigned long block, + int count, void *data); + errcode_t (*write_blk)(io_channel channel, unsigned long block, + int count, const void *data); + errcode_t (*flush)(io_channel channel); + errcode_t (*write_byte)(io_channel channel, unsigned long offset, + int count, const void *data); + errcode_t (*set_option)(io_channel channel, const char *option, + const char *arg); + errcode_t (*get_stats)(io_channel channel, io_stats *io_stats); + errcode_t (*read_blk64)(io_channel channel, unsigned long long block, + int count, void *data); + errcode_t (*write_blk64)(io_channel channel, unsigned long long block, + int count, const void *data); + errcode_t (*discard)(io_channel channel, unsigned long long block, + unsigned long long count); + long reserved[16]; +}; + +#define IO_FLAG_RW 0x0001 +#define IO_FLAG_EXCLUSIVE 0x0002 +#define IO_FLAG_DIRECT_IO 0x0004 + +/* + * Convenience functions.... + */ +#define io_channel_close(c) ((c)->manager->close((c))) +#define io_channel_set_blksize(c,s) ((c)->manager->set_blksize((c),s)) +#define io_channel_read_blk(c,b,n,d) ((c)->manager->read_blk((c),b,n,d)) +#define io_channel_write_blk(c,b,n,d) ((c)->manager->write_blk((c),b,n,d)) +#define io_channel_flush(c) ((c)->manager->flush((c))) +#define io_channel_bumpcount(c) ((c)->refcount++) + +/* io_manager.c */ +extern errcode_t io_channel_set_options(io_channel channel, + const char *options); +extern errcode_t io_channel_write_byte(io_channel channel, + unsigned long offset, + int count, const void *data); +extern errcode_t io_channel_read_blk64(io_channel channel, + unsigned long long block, + int count, void *data); +extern errcode_t io_channel_write_blk64(io_channel channel, + unsigned long long block, + int count, const void *data); +extern errcode_t io_channel_discard(io_channel channel, + unsigned long long block, + unsigned long long count); + +/* unix_io.c */ +extern io_manager unix_io_manager; + +/* undo_io.c */ +extern io_manager undo_io_manager; +extern errcode_t set_undo_io_backing_manager(io_manager manager); +extern errcode_t set_undo_io_backup_file(char *file_name); + +/* test_io.c */ +extern io_manager test_io_manager, test_io_backing_manager; +extern void (*test_io_cb_read_blk) + (unsigned long block, int count, errcode_t err); +extern void (*test_io_cb_write_blk) + (unsigned long block, int count, errcode_t err); +extern void (*test_io_cb_read_blk64) + (unsigned long long block, int count, errcode_t err); +extern void (*test_io_cb_write_blk64) + (unsigned long long block, int count, errcode_t err); +extern void (*test_io_cb_set_blksize) + (int blksize, errcode_t err); + +#endif /* _EXT2FS_EXT2_IO_H */ + diff --git a/portlibs/sources/libext2fs/source/ext2_types.h b/portlibs/sources/libext2fs/source/ext2_types.h new file mode 100644 index 00000000..5f5f7a57 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2_types.h @@ -0,0 +1,18 @@ +/* + * If linux/types.h is already been included, assume it has defined + * everything we need. (cross fingers) Other header files may have + * also defined the types that we need. + */ +#ifndef _EXT2_TYPES_H +#define _EXT2_TYPES_H + +typedef unsigned char __u8; +typedef signed char __s8; +typedef unsigned short __u16; +typedef short __s16; +typedef unsigned int __u32; +typedef int __s32; +typedef unsigned long long __u64; +typedef signed long long __s64; + +#endif /* _EXT2_TYPES_H */ diff --git a/portlibs/sources/libext2fs/source/ext2dir.c b/portlibs/sources/libext2fs/source/ext2dir.c new file mode 100644 index 00000000..ee7ce3c3 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2dir.c @@ -0,0 +1,657 @@ +/** + * ext2_dir.c - devoptab directory routines for EXT2-based devices. + * + * Copyright (c) 2006 Michael "Chishm" Chisholm + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2010 Dimok + * + * 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; 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_SYS_STATVFS_H +#include <sys/statvfs.h> +#endif +#ifdef HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif + +#include "ext2_internal.h" +#include "ext2dir.h" +#include <sys/dir.h> + +#define STATE(x) ((ext2_dir_state*)(x)->dirStruct) + +void ext2CloseDir (ext2_dir_state *dir) +{ + // Sanity check + if (!dir || !dir->vd) + return; + + // Free the directory entries (if any) + while (dir->first) { + ext2_dir_entry *next = dir->first->next; + mem_free(dir->first->name); + mem_free(dir->first); + dir->first = next; + } + + // Close the directory (if open) + if (dir->ni) + ext2CloseEntry(dir->vd, dir->ni); + + // Reset the directory state + dir->ni = NULL; + dir->first = NULL; + dir->current = NULL; + + return; +} + +int ext2_stat_r (struct _reent *r, const char *path, struct stat *st) +{ + // Short circuit cases were we don't actually have to do anything + if (!st || !path) + return 0; + + ext2_log_trace("path %s, st %p\n", path, st); + + ext2_vd *vd = NULL; + ext2_inode_t *ni = NULL; + + // Get the volume descriptor for this path + vd = ext2GetVolume(path); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + if(strcmp(path, ".") == 0 || strcmp(path, "..") == 0) + { + memset(st, 0, sizeof(struct stat)); + st->st_mode = S_IFDIR; + return 0; + } + + // Lock + ext2Lock(vd); + + // Find the entry + ni = ext2OpenEntry(vd, path); + if (!ni) { + r->_errno = errno; + ext2Unlock(vd); + return -1; + } + + // Get the entry stats + int ret = ext2Stat(vd, ni, st); + if (ret) + r->_errno = errno; + + // Close the entry + ext2CloseEntry(vd, ni); + + ext2Unlock(vd); + + return 0; +} + +int ext2_link_r (struct _reent *r, const char *existing, const char *newLink) +{ + ext2_log_trace("existing %s, newLink %s\n", existing, newLink); + + ext2_vd *vd = NULL; + ext2_inode_t *ni = NULL; + + // Get the volume descriptor for this path + vd = ext2GetVolume(existing); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Lock + ext2Lock(vd); + + // Create a symbolic link between the two paths + ni = ext2Create(vd, existing, S_IFLNK, newLink); + if (!ni) { + ext2Unlock(vd); + r->_errno = errno; + return -1; + } + + // Close the symbolic link + ext2CloseEntry(vd, ni); + + // Unlock + ext2Unlock(vd); + + return 0; +} + +int ext2_unlink_r (struct _reent *r, const char *name) +{ + ext2_log_trace("name %s\n", name); + + ext2_vd *vd = NULL; + + // Get the volume descriptor for this path + vd = ext2GetVolume(name); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Unlink the entry + int ret = ext2Unlink(vd, name); + if (ret) + r->_errno = errno; + + return ret; +} + +int ext2_chdir_r (struct _reent *r, const char *name) +{ + ext2_log_trace("name %s\n", name); + + ext2_vd *vd = NULL; + ext2_inode_t *ni = NULL; + + // Get the volume descriptor for this path + vd = ext2GetVolume(name); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Lock + ext2Lock(vd); + + // Find the directory + ni = ext2OpenEntry(vd, name); + if (!ni) { + ext2Unlock(vd); + r->_errno = ENOENT; + return -1; + } + + // Ensure that this directory is indeed a directory + if (!LINUX_S_ISDIR(ni->ni.i_mode)) { + ext2CloseEntry(vd, ni); + ext2Unlock(vd); + r->_errno = ENOTDIR; + return -1; + } + + // Close the old current directory (if any) + if (vd->cwd_ni) + ext2CloseEntry(vd, vd->cwd_ni); + + // Set the new current directory + vd->cwd_ni = ni; + + // Unlock + ext2Unlock(vd); + + return 0; +} + +int ext2_rename_r (struct _reent *r, const char *oldName, const char *newName) +{ + ext2_log_trace("oldName %s, newName %s\n", oldName, newName); + + ext2_vd *vd = NULL; + ext2_inode_t *ni = NULL; + + // Get the volume descriptor for this path + vd = ext2GetVolume(oldName); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Lock + ext2Lock(vd); + + // You cannot rename between devices + if(vd != ext2GetVolume(newName)) { + ext2Unlock(vd); + r->_errno = EXDEV; + return -1; + } + + // Check that there is no existing entry with the new name + ni = ext2OpenEntry(vd, newName); + if (ni) { + ext2CloseEntry(vd, ni); + ext2Unlock(vd); + r->_errno = EEXIST; + return -1; + } + + // Link the old entry with the new one + if (ext2Link(vd, oldName, newName)) { + ext2Unlock(vd); + return -1; + } + + // Unlink the old entry + if (ext2Unlink(vd, oldName)) { + if (ext2Unlink(vd, newName)) { + ext2Unlock(vd); + return -1; + } + ext2Unlock(vd); + return -1; + } + + // Unlock + ext2Unlock(vd); + + return 0; +} + +int ext2_mkdir_r (struct _reent *r, const char *path, int mode) +{ + ext2_log_trace("path %s, mode %i\n", path, mode); + + ext2_vd *vd = NULL; + ext2_inode_t *ni = NULL; + + // Get the volume descriptor for this path + vd = ext2GetVolume(path); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Lock + ext2Lock(vd); + + // Create the directory + ni = ext2Create(vd, path, S_IFDIR, NULL); + if (!ni) { + ext2Unlock(vd); + r->_errno = errno; + return -1; + } + + // Close the directory + ext2CloseEntry(vd, ni); + + // Unlock + ext2Unlock(vd); + + return 0; +} + +int ext2_statvfs_r (struct _reent *r, const char *path, struct statvfs *buf) +{ + ext2_log_trace("path %s, buf %p\n", path, buf); + + ext2_vd *vd = NULL; + + // Get the volume descriptor for this path + vd = ext2GetVolume(path); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Short circuit cases were we don't actually have to do anything + if (!buf) + return 0; + + // Lock + ext2Lock(vd); + + // Zero out the stat buffer + memset(buf, 0, sizeof(struct statvfs)); + + // File system block size + switch(vd->fs->super->s_log_block_size) + { + case 1: + buf->f_bsize = 2048; + break; + case 2: + buf->f_bsize = 4096; + break; + case 3: + buf->f_bsize = 8192; + break; + default: + case 0: + buf->f_bsize = 1024; + break; + } + + // Fundamental file system block size + buf->f_frsize = buf->f_bsize; + + // Total number of blocks on file system in units of f_frsize + buf->f_blocks = vd->fs->super->s_blocks_count | (((u64) vd->fs->super->s_blocks_count_hi) << 32); + + // Free blocks available for all and for non-privileged processes + buf->f_bfree = vd->fs->super->s_free_blocks_count | (((u64) vd->fs->super->s_free_blocks_hi) << 32); + + // Number of inodes at this point in time + buf->f_files = vd->fs->super->s_inodes_count; + + // Free inodes available for all and for non-privileged processes + buf->f_ffree = vd->fs->super->s_free_inodes_count; + + // File system id + buf->f_fsid = vd->fs->super->s_magic; + + // Bit mask of f_flag values. + buf->f_flag = vd->fs->super->s_flags; + + // Maximum length of filenames + buf->f_namemax = EXT2_NAME_LEN; + + // Unlock + ext2Unlock(vd); + + return 0; +} + +/** + * PRIVATE: Callback for directory walking + */ +static int DirIterateCallback(struct ext2_dir_entry *dirent, int offset, int blocksize, char *buf, void *dirState) +{ + // Sanity check + if(!dirent) + { + errno = EINVAL; + return -1; + } + + ext2_dir_state* dir = STATE(((DIR_ITER *) dirState)); + + // Sanity check + if (!dir || !dir->vd) { + errno = EINVAL; + return -1; + } + + //skip ".." on root directory + if(dir->ni->ino == dir->vd->root && strcmp(dirent->name, "..") == 0) + { + return EXT2_ET_OK; + } + + // Allocate a new directory entry + ext2_dir_entry *entry = (ext2_dir_entry *) mem_alloc(sizeof(ext2_dir_entry)); + if (!entry) + { + errno = ENOMEM; + return -1; + } + + memset(entry, 0, sizeof(ext2_dir_entry)); + + int stringlen = dirent->name_len & 0xFF; + + entry->name = mem_alloc(stringlen+1); + if(!entry->name) + { + mem_free(entry); + errno = ENOMEM; + return -1; + } + + // The null termination is not necessarily there in the fs, we gotta do it + int i; + for(i = 0; i < stringlen; ++i) + entry->name[i] = dirent->name[i]; + entry->name[i] = '\0'; + + // Link the entry to the directory + if (!dir->first) { + dir->first = entry; + dir->length = dirent->rec_len; + } else { + ext2_dir_entry *last = dir->first; + while (last->next) last = last->next; + last->next = entry; + } + + return EXT2_ET_OK; +} + +DIR_ITER *ext2_diropen_r (struct _reent *r, DIR_ITER *dirState, const char *path) +{ + ext2_log_trace("dirState %p, path %s\n", dirState, path); + + if(!dirState) + { + r->_errno = EINVAL; + return NULL; + } + + ext2_dir_state* dir = STATE(dirState); + + if(!dir) + { + r->_errno = EINVAL; + return NULL; + } + + // Get the volume descriptor for this path + dir->vd = ext2GetVolume(path); + if (!dir->vd) { + r->_errno = ENODEV; + return NULL; + } + + // Lock + ext2Lock(dir->vd); + + // Find the directory + dir->ni = ext2OpenEntry(dir->vd, path); + if (!dir->ni) { + ext2Unlock(dir->vd); + r->_errno = ENOENT; + return NULL; + } + + // Ensure that this directory is indeed a directory + if (!LINUX_S_ISDIR(dir->ni->ni.i_mode)) { + ext2CloseEntry(dir->vd, dir->ni); + ext2Unlock(dir->vd); + r->_errno = ENOTDIR; + return NULL; + } + + // Read the directory + dir->first = dir->current = NULL; + if (ext2fs_dir_iterate(dir->vd->fs, dir->ni->ino, 0, 0, DirIterateCallback, dirState) != EXT2_ET_OK) { + ext2CloseDir(dir); + ext2Unlock(dir->vd); + r->_errno = errno; + return NULL; + } + + // Move to the first entry in the directory + dir->current = dir->first; + + // Update directory times + ext2UpdateTimes(dir->vd, dir->ni, EXT2_UPDATE_ATIME); + + // Insert the directory into the double-linked FILO list of open directories + if (dir->vd->firstOpenDir) { + dir->nextOpenDir = dir->vd->firstOpenDir; + dir->vd->firstOpenDir->prevOpenDir = dir; + } else { + dir->nextOpenDir = NULL; + } + dir->prevOpenDir = NULL; + dir->vd->cwd_ni = dir->ni; + dir->vd->firstOpenDir = dir; + dir->vd->openDirCount++; + + // Unlock + ext2Unlock(dir->vd); + + return dirState; +} + +int ext2_dirreset_r (struct _reent *r, DIR_ITER *dirState) +{ + ext2_log_trace("dirState %p\n", dirState); + + if(!dirState) + { + r->_errno = EINVAL; + return -1; + } + + ext2_dir_state* dir = STATE(dirState); + + // Sanity check + if (!dir || !dir->vd || !dir->ni) { + r->_errno = EBADF; + return -1; + } + + // Lock + ext2Lock(dir->vd); + + // Move to the first entry in the directory + dir->current = dir->first; + + // Update directory times + ext2UpdateTimes(dir->vd, dir->ni, EXT2_UPDATE_ATIME); + + // Unlock + ext2Unlock(dir->vd); + + return 0; +} + +int ext2_dirnext_r (struct _reent *r, DIR_ITER *dirState, char *filename, struct stat *filestat) +{ + ext2_log_trace("dirState %p, filename %p, filestat %p\n", dirState, filename, filestat); + + if(!dirState) + { + r->_errno = EINVAL; + return -1; + } + + ext2_dir_state* dir = STATE(dirState); + ext2_inode_t *ni = NULL; + + // Sanity check + if (!dir || !dir->vd || !dir->ni) { + r->_errno = EBADF; + return -1; + } + + // Lock + ext2Lock(dir->vd); + + // Check that there is a entry waiting to be fetched + if (!dir->current) { + ext2Unlock(dir->vd); + r->_errno = ENOENT; + return -1; + } + + // Fetch the current entry + strcpy(filename, dir->current->name); + if(filestat != NULL) + { + if(strcmp(dir->current->name, ".") == 0 || strcmp(dir->current->name, "..") == 0) + { + memset(filestat, 0, sizeof(struct stat)); + filestat->st_mode = S_IFDIR; + } + else + { + ni = ext2OpenEntry(dir->vd, dir->current->name); + if (ni) { + ext2Stat(dir->vd, ni, filestat); + ext2CloseEntry(dir->vd, ni); + } + } + } + + // Move to the next entry in the directory + dir->current = dir->current->next; + + // Update directory times + ext2UpdateTimes(dir->vd, dir->ni, EXT2_UPDATE_ATIME); + + // Unlock + ext2Unlock(dir->vd); + + return 0; +} + +int ext2_dirclose_r (struct _reent *r, DIR_ITER *dirState) +{ + ext2_log_trace("dirState %p\n", dirState); + + if(!dirState) + { + r->_errno = EINVAL; + return -1; + } + + ext2_dir_state* dir = STATE(dirState); + + // Sanity check + if (!dir || !dir->vd) { + r->_errno = EBADF; + return -1; + } + + // Lock + ext2Lock(dir->vd); + + // Close the directory + ext2CloseDir(dir); + + // Remove the directory from the double-linked FILO list of open directories + dir->vd->openDirCount--; + if (dir->nextOpenDir) + dir->nextOpenDir->prevOpenDir = dir->prevOpenDir; + if (dir->prevOpenDir) + dir->prevOpenDir->nextOpenDir = dir->nextOpenDir; + else + dir->vd->firstOpenDir = dir->nextOpenDir; + + // Unlock + ext2Unlock(dir->vd); + + return 0; +} diff --git a/portlibs/sources/libext2fs/source/ext2dir.h b/portlibs/sources/libext2fs/source/ext2dir.h new file mode 100644 index 00000000..26081bbf --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2dir.h @@ -0,0 +1,69 @@ +/** + * ext2_dir.h - devoptab directory routines for EXT2-based devices. + * + * Copyright (c) 2006 Michael "Chishm" Chisholm + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2010 Dimok + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef _EXT2DIR_H +#define _EXT2DIR_H + +#include <sys/reent.h> +#include "ext2_internal.h" + +/** + * ext2_dir_entry - Directory entry + */ +typedef struct _ext2_dir_entry { + char *name; + struct _ext2_dir_entry *next; +} ext2_dir_entry; + +/** + * ext2_dir_state - Directory state + */ +typedef struct _ext2_dir_state { + ext2_vd *vd; /* Volume this directory belongs to */ + ext2_inode_t *ni; /* Directory descriptor */ + unsigned short length; /* Directory length */ + ext2_dir_entry *first; /* The first entry in the directory */ + ext2_dir_entry *current; /* The current entry in the directory */ + struct _ext2_dir_state *prevOpenDir; /* The previous entry in a double-linked FILO list of open directories */ + struct _ext2_dir_state *nextOpenDir; /* The next entry in a double-linked FILO list of open directories */ +} ext2_dir_state; + +/* Directory state routines */ +void ext2CloseDir (ext2_dir_state *file); + +/* Gekko devoptab directory routines for EXT2-based devices */ +extern int ext2_stat_r (struct _reent *r, const char *path, struct stat *st); +extern int ext2_link_r (struct _reent *r, const char *existing, const char *newLink); +extern int ext2_unlink_r (struct _reent *r, const char *name); +extern int ext2_chdir_r (struct _reent *r, const char *name); +extern int ext2_rename_r (struct _reent *r, const char *oldName, const char *newName); +extern int ext2_mkdir_r (struct _reent *r, const char *path, int mode); +extern int ext2_statvfs_r (struct _reent *r, const char *path, struct statvfs *buf); + +/* Gekko devoptab directory walking routines for EXT2-based devices */ +extern DIR_ITER *ext2_diropen_r (struct _reent *r, DIR_ITER *dirState, const char *path); +extern int ext2_dirreset_r (struct _reent *r, DIR_ITER *dirState); +extern int ext2_dirnext_r (struct _reent *r, DIR_ITER *dirState, char *filename, struct stat *filestat); +extern int ext2_dirclose_r (struct _reent *r, DIR_ITER *dirState); + +#endif /* _EXT2DIR_H */ + diff --git a/portlibs/sources/libext2fs/source/ext2file.c b/portlibs/sources/libext2fs/source/ext2file.c new file mode 100644 index 00000000..6647466f --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2file.c @@ -0,0 +1,413 @@ +/** + * ext2file.c - devoptab file routines for EXT2-based devices. + * + * Copyright (c) 2006 Michael "Chishm" Chisholm + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2010 Dimok + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include <stdlib.h> +#include <sys/stat.h> +#include <fcntl.h> +#include <errno.h> +#include <string.h> + +#include "ext2_internal.h" +#include "ext2file.h" + +#define STATE(x) ((ext2_file_state*)x) + +void ext2CloseFile (ext2_file_state *file) +{ + // Sanity check + if (!file || !file->vd) + return; + + ext2fs_file_close(file->fd); + + // Sync the file (and its attributes) to disc + if(file->write) + { + // Read in node changes before writing them + ext2fs_read_inode(file->vd->fs, file->ni->ino, &file->ni->ni); + ext2UpdateTimes(file->vd, file->ni, EXT2_UPDATE_ACTIME); + } + + if (file->read) + ext2UpdateTimes(file->vd, file->ni, EXT2_UPDATE_ATIME); + + ext2Sync(file->vd, file->ni); + + // Close the file (if open) + if (file->ni) + ext2CloseEntry(file->vd, file->ni); + + // Reset the file state + file->ni = NULL; + file->fd = NULL; + file->flags = 0; + file->read = false; + file->write = false; + file->append = false; + + return; +} + +int ext2_open_r (struct _reent *r, void *fileStruct, const char *path, int flags, int mode) +{ + ext2_log_trace("fileStruct %p, path %s, flags %i, mode %i\n", fileStruct, path, flags, mode); + + ext2_file_state* file = STATE(fileStruct); + + // Get the volume descriptor for this path + file->vd = ext2GetVolume(path); + if (!file->vd) { + r->_errno = ENODEV; + return -1; + } + + // Lock + ext2Lock(file->vd); + + // Determine which mode the file is opened for + file->flags = flags; + if ((flags & 0x03) == O_RDONLY) { + file->read = true; + file->write = false; + file->append = false; + } else if ((flags & 0x03) == O_WRONLY) { + file->read = false; + file->write = true; + file->append = (flags & O_APPEND); + } else if ((flags & 0x03) == O_RDWR) { + file->read = true; + file->write = true; + file->append = (flags & O_APPEND); + } else { + r->_errno = EACCES; + ext2Unlock(file->vd); + return -1; + } + + // Try and find the file and (if found) ensure that it is not a directory + file->ni = ext2OpenEntry(file->vd, path); + if (file->ni && LINUX_S_ISDIR(file->ni->ni.i_mode)) + { + ext2CloseEntry(file->vd, file->ni); + ext2Unlock(file->vd); + r->_errno = EISDIR; + return -1; + } + + // Are we creating this file? + if ((flags & O_CREAT) && !file->ni) + // Create the file + file->ni = ext2Create(file->vd, path, S_IFREG, NULL); + + // Sanity check, the file should be open by now + if (!file->ni) { + ext2Unlock(file->vd); + r->_errno = ENOENT; + return -1; + } + + // Make sure we aren't trying to write to a read-only file + if (!(file->vd->fs->flags & EXT2_FLAG_RW) && file->write) + { + ext2CloseEntry(file->vd, file->ni); + ext2Unlock(file->vd); + r->_errno = EROFS; + return -1; + } + + errcode_t err = ext2fs_file_open2(file->vd->fs, file->ni->ino, &file->ni->ni, + file->write ? EXT2_FLAG_RW : 0, &file->fd); + if(err != 0) + { + ext2CloseEntry(file->vd, file->ni); + ext2Unlock(file->vd); + r->_errno = ENOENT; + return -1; + } + + + // Truncate the file if requested + if ((flags & O_TRUNC) && file->write) { + if (ext2fs_file_set_size2(file->fd, 0) != 0) { + ext2CloseEntry(file->vd, file->ni); + ext2Unlock(file->vd); + r->_errno = errno; + return -1; + } + file->ni->ni.i_size = file->ni->ni.i_size_high = 0; + } + + // Set the files current position + ext2fs_file_llseek(file->fd, file->append ? EXT2_I_SIZE(&file->ni->ni) : 0, SEEK_SET, 0); + + ext2_log_trace("file->len %lld\n", EXT2_I_SIZE(&file->ni->ni)); + + // Update file times + ext2UpdateTimes(file->vd, file->ni, EXT2_UPDATE_ATIME); + + // Insert the file into the double-linked FILO list of open files + if (file->vd->firstOpenFile) { + file->nextOpenFile = file->vd->firstOpenFile; + file->vd->firstOpenFile->prevOpenFile = file; + } else { + file->nextOpenFile = NULL; + } + file->prevOpenFile = NULL; + file->vd->firstOpenFile = file; + file->vd->openFileCount++; + + // Sync access time + ext2Sync(file->vd, file->ni); + + // Unlock + ext2Unlock(file->vd); + + return (int)fileStruct; +} + +int ext2_close_r (struct _reent *r, int fd) +{ + ext2_log_trace("fd %p\n", (void *) fd); + + ext2_file_state* file = STATE(fd); + + // Sanity check + if (!file || !file->vd) { + r->_errno = EBADF; + return -1; + } + + // Lock + ext2Lock(file->vd); + + // Close the file + ext2CloseFile(file); + + // Remove the file from the double-linked FILO list of open files + file->vd->openFileCount--; + if (file->nextOpenFile) + file->nextOpenFile->prevOpenFile = file->prevOpenFile; + if (file->prevOpenFile) + file->prevOpenFile->nextOpenFile = file->nextOpenFile; + else + file->vd->firstOpenFile = file->nextOpenFile; + + // Unlock + ext2Unlock(file->vd); + + return 0; +} + +ssize_t ext2_write_r (struct _reent *r, int fd, const char *ptr, size_t len) +{ + ext2_log_trace("fd %p, ptr %p, len %i\n", (void *) fd, ptr, len); + + ext2_file_state* file = STATE(fd); + + // Sanity check + if (!file || !file->vd || !file->fd) { + r->_errno = EINVAL; + return -1; + } + + // Short circuit cases where we don't actually have to do anything + if (!ptr || len <= 0) { + return 0; + } + + // Check that we are allowed to write to this file + if (!file->write) { + r->_errno = EACCES; + return -1; + } + + // Lock + ext2Lock(file->vd); + + u32 writen = 0; + + // Write to the files data atrribute + errcode_t err = ext2fs_file_write(file->fd, ptr, len, &writen); + if (writen <= 0 || err) { + ext2Unlock(file->vd); + r->_errno = errno; + return (err ? err : -1); + } + + // Unlock + ext2Unlock(file->vd); + + return (writen == 0 ? -1 : writen); +} + +ssize_t ext2_read_r (struct _reent *r, int fd, char *ptr, size_t len) +{ + ext2_log_trace("fd %p, ptr %p, len %i\n", (void *) fd, ptr, len); + + ext2_file_state* file = STATE(fd); + + // Sanity check + if (!file || !file->vd || !file->fd) { + r->_errno = EINVAL; + return -1; + } + + // Short circuit cases where we don't actually have to do anything + if (!ptr || len <= 0) { + return 0; + } + + // Lock + ext2Lock(file->vd); + + // Check that we are allowed to read from this file + if (!file->read) { + ext2Unlock(file->vd); + r->_errno = EACCES; + return -1; + } + + u32 read = 0; + errcode_t err = 0; + + // Read from the files data attribute + err = ext2fs_file_read(file->fd, ptr, len, &read); + if (err || read <= 0 || read > len) { + ext2Unlock(file->vd); + r->_errno = errno; + return err ? err : -1; + } + + // Unlock + ext2Unlock(file->vd); + + return (read == 0) ? -1 : read; +} + +off_t ext2_seek_r (struct _reent *r, int fd, off_t pos, int dir) +{ + ext2_log_trace("fd %p, pos %lli, dir %i\n", (void *) fd, pos, dir); + + ext2_file_state* file = STATE(fd); + + // Sanity check + if (!file || !file->fd) { + r->_errno = EINVAL; + return -1; + } + + u64 pos_loaded = 0; + + ext2fs_file_llseek(file->fd, pos, dir, &pos_loaded); + + return (off_t) pos_loaded; +} + +int ext2_fstat_r (struct _reent *r, int fd, struct stat *st) +{ + ext2_log_trace("fd %p\n", (void *) fd); + + ext2_file_state* file = STATE(fd); + int ret = 0; + + // Sanity check + if (!file || !file->vd || !file->ni || !file->fd) { + r->_errno = EINVAL; + return -1; + } + + // Short circuit cases were we don't actually have to do anything + if (!st) + return 0; + + // Get the file stats + ret = ext2Stat(file->vd, file->ni, st); + if (ret) + r->_errno = errno; + + return ret; +} + +int ext2_ftruncate_r (struct _reent *r, int fd, off_t len) +{ + ext2_log_trace("fd %p, len %Li\n", (void *) fd, len); + + ext2_file_state* file = STATE(fd); + errcode_t err = 0; + + // Sanity check + if (!file || !file->vd || !file->ni || !file->fd) { + r->_errno = EINVAL; + return -1; + } + + // Lock + ext2Lock(file->vd); + + // Check that we are allowed to write to this file + if (!file->write) { + ext2Unlock(file->vd); + r->_errno = EACCES; + return -1; + } + + err = ext2fs_file_set_size2(file->fd, len); + + // Sync the file (and its attributes) to disc + if(!err) + ext2Sync(file->vd, file->ni); + + // update times + ext2UpdateTimes(file->vd, file->ni, EXT2_UPDATE_AMTIME); + + // Unlock + ext2Unlock(file->vd); + + return err; +} + +int ext2_fsync_r (struct _reent *r, int fd) +{ + ext2_log_trace("fd %p\n", (void *) fd); + + ext2_file_state* file = STATE(fd); + int ret = 0; + + // Sanity check + if (!file || !file->fd) { + r->_errno = EINVAL; + return -1; + } + + // Lock + ext2Lock(file->vd); + + // Sync the file (and its attributes) to disc + ret = ext2fs_file_flush(file->fd); + if (ret) + r->_errno = ret; + + // Unlock + ext2Unlock(file->vd); + + return ret; +} diff --git a/portlibs/sources/libext2fs/source/ext2file.h b/portlibs/sources/libext2fs/source/ext2file.h new file mode 100644 index 00000000..249ba52a --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2file.h @@ -0,0 +1,60 @@ +/** + * ext2file.c - devoptab file routines for EXT2-based devices. + * + * Copyright (c) 2006 Michael "Chishm" Chisholm + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2010 Dimok + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef _EXT2FILE_H +#define _EXT2FILE_H + +#include <sys/reent.h> +#include "ext2_internal.h" + +/** + * ext2_file_state - File state + */ +typedef struct _ext2_file_state { + ext2_vd *vd; /* Volume this file belongs to */ + ext2_inode_t *ni; /* File inode */ + ext2_file_t fd; /* File descriptor */ + int flags; /* Opening flags */ + bool read; /* True if allowed to read from file */ + bool write; /* True if allowed to write to file */ + bool append; /* True if allowed to append to file */ +// bool compressed; /* True if file data is compressed */ +// bool encrypted; /* True if file data is encryted */ + struct _ext2_file_state *prevOpenFile; /* The previous entry in a double-linked FILO list of open files */ + struct _ext2_file_state *nextOpenFile; /* The next entry in a double-linked FILO list of open files */ +} ext2_file_state; + +/* File state routines */ +void ext2CloseFile (ext2_file_state *file); + +/* Gekko devoptab file routines for EXT2-based devices */ +extern int ext2_open_r (struct _reent *r, void *fileStruct, const char *path, int flags, int mode); +extern int ext2_close_r (struct _reent *r, int fd); +extern ssize_t ext2_write_r (struct _reent *r, int fd, const char *ptr, size_t len); +extern ssize_t ext2_read_r (struct _reent *r, int fd, char *ptr, size_t len); +extern off_t ext2_seek_r (struct _reent *r, int fd, off_t pos, int dir); +extern int ext2_fstat_r (struct _reent *r, int fd, struct stat *st); +extern int ext2_ftruncate_r (struct _reent *r, int fd, off_t len); +extern int ext2_fsync_r (struct _reent *r, int fd); + +#endif /* _EXT2FILE_H */ + diff --git a/portlibs/sources/libext2fs/source/ext2fs.h b/portlibs/sources/libext2fs/source/ext2fs.h new file mode 100644 index 00000000..7016486c --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2fs.h @@ -0,0 +1,1572 @@ +/* + * ext2fs.h --- ext2fs + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#ifndef _EXT2FS_EXT2FS_H +#define _EXT2FS_EXT2FS_H + +#ifdef __GNUC__ +#define EXT2FS_ATTR(x) __attribute__(x) +#else +#define EXT2FS_ATTR(x) +#endif + +#ifdef __cplusplus +extern "C" { +#endif + +/* + * Non-GNU C compilers won't necessarily understand inline + */ +#if (!defined(__GNUC__) && !defined(__WATCOMC__)) +#define NO_INLINE_FUNCS +#endif + +/* + * Where the master copy of the superblock is located, and how big + * superblocks are supposed to be. We define SUPERBLOCK_SIZE because + * the size of the superblock structure is not necessarily trustworthy + * (some versions have the padding set up so that the superblock is + * 1032 bytes long). + */ +#define SUPERBLOCK_OFFSET 1024 +#define SUPERBLOCK_SIZE 1024 + +/* + * The last ext2fs revision level that this version of the library is + * able to support. + */ +#define EXT2_LIB_CURRENT_REV EXT2_DYNAMIC_REV + +#ifdef HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <errno.h> + +#include "ext2_types.h" +#include "com_err.h" +#include "ext2_fs.h" +#include "ext3_extents.h" + +typedef __u32 ext2_ino_t; +typedef __u32 blk_t; +typedef __u64 blk64_t; +typedef __u32 dgrp_t; +typedef __u32 ext2_off_t; +typedef __u64 ext2_off64_t; +typedef __s64 e2_blkcnt_t; +typedef __u32 ext2_dirhash_t; + +#include "ext2_io.h" +#include "ext2_err.h" +#include "ext2_ext_attr.h" + +/* + * Portability help for Microsoft Visual C++ + */ +#ifdef _MSC_VER +#define EXT2_QSORT_TYPE int __cdecl +#else +#define EXT2_QSORT_TYPE int +#endif + +typedef struct struct_ext2_filsys *ext2_filsys; + +#define EXT2FS_MARK_ERROR 0 +#define EXT2FS_UNMARK_ERROR 1 +#define EXT2FS_TEST_ERROR 2 + +typedef struct ext2fs_struct_generic_bitmap *ext2fs_generic_bitmap; +typedef struct ext2fs_struct_generic_bitmap *ext2fs_inode_bitmap; +typedef struct ext2fs_struct_generic_bitmap *ext2fs_block_bitmap; + +#define EXT2_FIRST_INODE(s) EXT2_FIRST_INO(s) + + +/* + * Badblocks list definitions + */ + +typedef struct ext2_struct_u32_list *ext2_badblocks_list; +typedef struct ext2_struct_u32_iterate *ext2_badblocks_iterate; + +typedef struct ext2_struct_u32_list *ext2_u32_list; +typedef struct ext2_struct_u32_iterate *ext2_u32_iterate; + +/* old */ +typedef struct ext2_struct_u32_list *badblocks_list; +typedef struct ext2_struct_u32_iterate *badblocks_iterate; + +#define BADBLOCKS_FLAG_DIRTY 1 + +/* + * ext2_dblist structure and abstractions (see dblist.c) + */ +struct ext2_db_entry2 { + ext2_ino_t ino; + blk64_t blk; + e2_blkcnt_t blockcnt; +}; + +/* Ye Olde 32-bit version */ +struct ext2_db_entry { + ext2_ino_t ino; + blk_t blk; + int blockcnt; +}; + +typedef struct ext2_struct_dblist *ext2_dblist; + +#define DBLIST_ABORT 1 + +/* + * ext2_fileio definitions + */ + +#define EXT2_FILE_WRITE 0x0001 +#define EXT2_FILE_CREATE 0x0002 + +#define EXT2_FILE_MASK 0x00FF + +#define EXT2_FILE_BUF_DIRTY 0x4000 +#define EXT2_FILE_BUF_VALID 0x2000 + +typedef struct ext2_file *ext2_file_t; + +#define EXT2_SEEK_SET 0 +#define EXT2_SEEK_CUR 1 +#define EXT2_SEEK_END 2 + +/* + * Flags for the ext2_filsys structure and for ext2fs_open() + */ +#define EXT2_FLAG_RW 0x01 +#define EXT2_FLAG_CHANGED 0x02 +#define EXT2_FLAG_DIRTY 0x04 +#define EXT2_FLAG_VALID 0x08 +#define EXT2_FLAG_IB_DIRTY 0x10 +#define EXT2_FLAG_BB_DIRTY 0x20 +#define EXT2_FLAG_SWAP_BYTES 0x40 +#define EXT2_FLAG_SWAP_BYTES_READ 0x80 +#define EXT2_FLAG_SWAP_BYTES_WRITE 0x100 +#define EXT2_FLAG_MASTER_SB_ONLY 0x200 +#define EXT2_FLAG_FORCE 0x400 +#define EXT2_FLAG_SUPER_ONLY 0x800 +#define EXT2_FLAG_JOURNAL_DEV_OK 0x1000 +#define EXT2_FLAG_IMAGE_FILE 0x2000 +#define EXT2_FLAG_EXCLUSIVE 0x4000 +#define EXT2_FLAG_SOFTSUPP_FEATURES 0x8000 +#define EXT2_FLAG_NOFREE_ON_ERROR 0x10000 +#define EXT2_FLAG_64BITS 0x20000 +#define EXT2_FLAG_PRINT_PROGRESS 0x40000 +#define EXT2_FLAG_DIRECT_IO 0x80000 + +/* + * Special flag in the ext2 inode i_flag field that means that this is + * a new inode. (So that ext2_write_inode() can clear extra fields.) + */ +#define EXT2_NEW_INODE_FL 0x80000000 + +/* + * Flags for mkjournal + * + * EXT2_MKJOURNAL_V1_SUPER Make a (deprecated) V1 journal superblock + */ +#define EXT2_MKJOURNAL_V1_SUPER 0x0000001 + +struct opaque_ext2_group_desc; + +struct struct_ext2_filsys { + errcode_t magic; + io_channel io; + int flags; + char * device_name; + struct ext2_super_block * super; + unsigned int blocksize; + int clustersize; + dgrp_t group_desc_count; + unsigned long desc_blocks; + struct opaque_ext2_group_desc * group_desc; + int inode_blocks_per_group; + ext2fs_inode_bitmap inode_map; + ext2fs_block_bitmap block_map; + /* XXX FIXME-64: not 64-bit safe, but not used? */ + errcode_t (*get_blocks)(ext2_filsys fs, ext2_ino_t ino, blk_t *blocks); + errcode_t (*check_directory)(ext2_filsys fs, ext2_ino_t ino); + errcode_t (*write_bitmaps)(ext2_filsys fs); + errcode_t (*read_inode)(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode); + errcode_t (*write_inode)(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode); + ext2_badblocks_list badblocks; + ext2_dblist dblist; + __u32 stride; /* for mke2fs */ + struct ext2_super_block * orig_super; + struct ext2_image_hdr * image_header; + __u32 umask; + time_t now; + /* + * Reserved for future expansion + */ + __u32 reserved[7]; + + /* + * Reserved for the use of the calling application. + */ + void * priv_data; + + /* + * Inode cache + */ + struct ext2_inode_cache *icache; + io_channel image_io; + + /* + * More callback functions + */ + errcode_t (*get_alloc_block)(ext2_filsys fs, blk64_t goal, + blk64_t *ret); + void (*block_alloc_stats)(ext2_filsys fs, blk64_t blk, int inuse); +}; + +#include "bitops.h" + +/* + * Return flags for the block iterator functions + */ +#define BLOCK_CHANGED 1 +#define BLOCK_ABORT 2 +#define BLOCK_ERROR 4 + +/* + * Block interate flags + * + * BLOCK_FLAG_APPEND, or BLOCK_FLAG_HOLE, indicates that the interator + * function should be called on blocks where the block number is zero. + * This is used by ext2fs_expand_dir() to be able to add a new block + * to an inode. It can also be used for programs that want to be able + * to deal with files that contain "holes". + * + * BLOCK_FLAG_DEPTH_TRAVERSE indicates that the iterator function for + * the indirect, doubly indirect, etc. blocks should be called after + * all of the blocks containined in the indirect blocks are processed. + * This is useful if you are going to be deallocating blocks from an + * inode. + * + * BLOCK_FLAG_DATA_ONLY indicates that the iterator function should be + * called for data blocks only. + * + * BLOCK_FLAG_READ_ONLY is a promise by the caller that it will not + * modify returned block number. + * + * BLOCK_FLAG_NO_LARGE is for internal use only. It informs + * ext2fs_block_iterate2 that large files won't be accepted. + */ +#define BLOCK_FLAG_APPEND 1 +#define BLOCK_FLAG_HOLE 1 +#define BLOCK_FLAG_DEPTH_TRAVERSE 2 +#define BLOCK_FLAG_DATA_ONLY 4 +#define BLOCK_FLAG_READ_ONLY 8 + +#define BLOCK_FLAG_NO_LARGE 0x1000 + +/* + * Magic "block count" return values for the block iterator function. + */ +#define BLOCK_COUNT_IND (-1) +#define BLOCK_COUNT_DIND (-2) +#define BLOCK_COUNT_TIND (-3) +#define BLOCK_COUNT_TRANSLATOR (-4) + +/* + * Flags for ext2fs_move_blocks + */ +#define EXT2_BMOVE_GET_DBLIST 0x0001 +#define EXT2_BMOVE_DEBUG 0x0002 + +/* + * Generic (non-filesystem layout specific) extents structure + */ + +#define EXT2_EXTENT_FLAGS_LEAF 0x0001 +#define EXT2_EXTENT_FLAGS_UNINIT 0x0002 +#define EXT2_EXTENT_FLAGS_SECOND_VISIT 0x0004 + +struct ext2fs_extent { + blk64_t e_pblk; /* first physical block */ + blk64_t e_lblk; /* first logical block extent covers */ + __u32 e_len; /* number of blocks covered by extent */ + __u32 e_flags; /* extent flags */ +}; + +typedef struct ext2_extent_handle *ext2_extent_handle_t; +typedef struct ext2_extent_path *ext2_extent_path_t; + +/* + * Flags used by ext2fs_extent_get() + */ +#define EXT2_EXTENT_CURRENT 0x0000 +#define EXT2_EXTENT_MOVE_MASK 0x000F +#define EXT2_EXTENT_ROOT 0x0001 +#define EXT2_EXTENT_LAST_LEAF 0x0002 +#define EXT2_EXTENT_FIRST_SIB 0x0003 +#define EXT2_EXTENT_LAST_SIB 0x0004 +#define EXT2_EXTENT_NEXT_SIB 0x0005 +#define EXT2_EXTENT_PREV_SIB 0x0006 +#define EXT2_EXTENT_NEXT_LEAF 0x0007 +#define EXT2_EXTENT_PREV_LEAF 0x0008 +#define EXT2_EXTENT_NEXT 0x0009 +#define EXT2_EXTENT_PREV 0x000A +#define EXT2_EXTENT_UP 0x000B +#define EXT2_EXTENT_DOWN 0x000C +#define EXT2_EXTENT_DOWN_AND_LAST 0x000D + +/* + * Flags used by ext2fs_extent_insert() + */ +#define EXT2_EXTENT_INSERT_AFTER 0x0001 /* insert after handle loc'n */ +#define EXT2_EXTENT_INSERT_NOSPLIT 0x0002 /* insert may not cause split */ + +/* + * Flags used by ext2fs_extent_delete() + */ +#define EXT2_EXTENT_DELETE_KEEP_EMPTY 0x001 /* keep node if last extnt gone */ + +/* + * Flags used by ext2fs_extent_set_bmap() + */ +#define EXT2_EXTENT_SET_BMAP_UNINIT 0x0001 + +/* + * Data structure returned by ext2fs_extent_get_info() + */ +struct ext2_extent_info { + int curr_entry; + int curr_level; + int num_entries; + int max_entries; + int max_depth; + int bytes_avail; + blk64_t max_lblk; + blk64_t max_pblk; + __u32 max_len; + __u32 max_uninit_len; +}; + +/* + * Flags for directory block reading and writing functions + */ +#define EXT2_DIRBLOCK_V2_STRUCT 0x0001 + +/* + * Return flags for the directory iterator functions + */ +#define DIRENT_CHANGED 1 +#define DIRENT_ABORT 2 +#define DIRENT_ERROR 3 + +/* + * Directory iterator flags + */ + +#define DIRENT_FLAG_INCLUDE_EMPTY 1 +#define DIRENT_FLAG_INCLUDE_REMOVED 2 + +#define DIRENT_DOT_FILE 1 +#define DIRENT_DOT_DOT_FILE 2 +#define DIRENT_OTHER_FILE 3 +#define DIRENT_DELETED_FILE 4 + +/* + * Inode scan definitions + */ +typedef struct ext2_struct_inode_scan *ext2_inode_scan; + +/* + * ext2fs_scan flags + */ +#define EXT2_SF_CHK_BADBLOCKS 0x0001 +#define EXT2_SF_BAD_INODE_BLK 0x0002 +#define EXT2_SF_BAD_EXTRA_BYTES 0x0004 +#define EXT2_SF_SKIP_MISSING_ITABLE 0x0008 +#define EXT2_SF_DO_LAZY 0x0010 + +/* + * ext2fs_check_if_mounted flags + */ +#define EXT2_MF_MOUNTED 1 +#define EXT2_MF_ISROOT 2 +#define EXT2_MF_READONLY 4 +#define EXT2_MF_SWAP 8 +#define EXT2_MF_BUSY 16 + +/* + * Ext2/linux mode flags. We define them here so that we don't need + * to depend on the OS's sys/stat.h, since we may be compiling on a + * non-Linux system. + */ +#define LINUX_S_IFMT 00170000 +#define LINUX_S_IFSOCK 0140000 +#define LINUX_S_IFLNK 0120000 +#define LINUX_S_IFREG 0100000 +#define LINUX_S_IFBLK 0060000 +#define LINUX_S_IFDIR 0040000 +#define LINUX_S_IFCHR 0020000 +#define LINUX_S_IFIFO 0010000 +#define LINUX_S_ISUID 0004000 +#define LINUX_S_ISGID 0002000 +#define LINUX_S_ISVTX 0001000 + +#define LINUX_S_IRWXU 00700 +#define LINUX_S_IRUSR 00400 +#define LINUX_S_IWUSR 00200 +#define LINUX_S_IXUSR 00100 + +#define LINUX_S_IRWXG 00070 +#define LINUX_S_IRGRP 00040 +#define LINUX_S_IWGRP 00020 +#define LINUX_S_IXGRP 00010 + +#define LINUX_S_IRWXO 00007 +#define LINUX_S_IROTH 00004 +#define LINUX_S_IWOTH 00002 +#define LINUX_S_IXOTH 00001 + +#define LINUX_S_ISLNK(m) (((m) & LINUX_S_IFMT) == LINUX_S_IFLNK) +#define LINUX_S_ISREG(m) (((m) & LINUX_S_IFMT) == LINUX_S_IFREG) +#define LINUX_S_ISDIR(m) (((m) & LINUX_S_IFMT) == LINUX_S_IFDIR) +#define LINUX_S_ISCHR(m) (((m) & LINUX_S_IFMT) == LINUX_S_IFCHR) +#define LINUX_S_ISBLK(m) (((m) & LINUX_S_IFMT) == LINUX_S_IFBLK) +#define LINUX_S_ISFIFO(m) (((m) & LINUX_S_IFMT) == LINUX_S_IFIFO) +#define LINUX_S_ISSOCK(m) (((m) & LINUX_S_IFMT) == LINUX_S_IFSOCK) + +/* + * ext2 size of an inode + */ +#define EXT2_I_SIZE(i) ((i)->i_size | ((__u64) (i)->i_size_high << 32)) + +/* + * ext2_icount_t abstraction + */ +#define EXT2_ICOUNT_OPT_INCREMENT 0x01 + +typedef struct ext2_icount *ext2_icount_t; + +/* + * Flags for ext2fs_bmap + */ +#define BMAP_ALLOC 0x0001 +#define BMAP_SET 0x0002 + +/* + * Returned flags from ext2fs_bmap + */ +#define BMAP_RET_UNINIT 0x0001 + +/* + * Flags for imager.c functions + */ +#define IMAGER_FLAG_INODEMAP 1 +#define IMAGER_FLAG_SPARSEWRITE 2 + +/* + * For checking structure magic numbers... + */ + +#define EXT2_CHECK_MAGIC(struct, code) \ + if ((struct)->magic != (code)) return (code) + + +/* + * For ext2 compression support + */ +#define EXT2FS_COMPRESSED_BLKADDR ((blk_t) -1) +#define HOLE_BLKADDR(_b) ((_b) == 0 || (_b) == EXT2FS_COMPRESSED_BLKADDR) + +/* + * Features supported by this version of the library + */ +#define EXT2_LIB_FEATURE_COMPAT_SUPP (EXT2_FEATURE_COMPAT_DIR_PREALLOC|\ + EXT2_FEATURE_COMPAT_IMAGIC_INODES|\ + EXT3_FEATURE_COMPAT_HAS_JOURNAL|\ + EXT2_FEATURE_COMPAT_RESIZE_INODE|\ + EXT2_FEATURE_COMPAT_DIR_INDEX|\ + EXT2_FEATURE_COMPAT_EXT_ATTR) + +/* This #ifdef is temporary until compression is fully supported */ +#ifdef ENABLE_COMPRESSION +#ifndef I_KNOW_THAT_COMPRESSION_IS_EXPERIMENTAL +/* If the below warning bugs you, then have + `CPPFLAGS=-DI_KNOW_THAT_COMPRESSION_IS_EXPERIMENTAL' in your + environment at configure time. */ + #warning "Compression support is experimental" +#endif +#define EXT2_LIB_FEATURE_INCOMPAT_SUPP (EXT2_FEATURE_INCOMPAT_FILETYPE|\ + EXT2_FEATURE_INCOMPAT_COMPRESSION|\ + EXT3_FEATURE_INCOMPAT_JOURNAL_DEV|\ + EXT2_FEATURE_INCOMPAT_META_BG|\ + EXT3_FEATURE_INCOMPAT_RECOVER|\ + EXT3_FEATURE_INCOMPAT_EXTENTS|\ + EXT4_FEATURE_INCOMPAT_FLEX_BG|\ + EXT4_FEATURE_INCOMPAT_64BIT) +#else +#define EXT2_LIB_FEATURE_INCOMPAT_SUPP (EXT2_FEATURE_INCOMPAT_FILETYPE|\ + EXT3_FEATURE_INCOMPAT_JOURNAL_DEV|\ + EXT2_FEATURE_INCOMPAT_META_BG|\ + EXT3_FEATURE_INCOMPAT_RECOVER|\ + EXT3_FEATURE_INCOMPAT_EXTENTS|\ + EXT4_FEATURE_INCOMPAT_FLEX_BG|\ + EXT4_FEATURE_INCOMPAT_64BIT) +#endif +#define EXT2_LIB_FEATURE_RO_COMPAT_SUPP (EXT2_FEATURE_RO_COMPAT_SPARSE_SUPER|\ + EXT4_FEATURE_RO_COMPAT_HUGE_FILE|\ + EXT2_FEATURE_RO_COMPAT_LARGE_FILE|\ + EXT4_FEATURE_RO_COMPAT_DIR_NLINK|\ + EXT4_FEATURE_RO_COMPAT_EXTRA_ISIZE|\ + EXT4_FEATURE_RO_COMPAT_GDT_CSUM) + +/* + * These features are only allowed if EXT2_FLAG_SOFTSUPP_FEATURES is passed + * to ext2fs_openfs() + */ +#define EXT2_LIB_SOFTSUPP_INCOMPAT (0) +#define EXT2_LIB_SOFTSUPP_RO_COMPAT (EXT4_FEATURE_RO_COMPAT_BIGALLOC) + +/* + * function prototypes + */ + +/* alloc.c */ +extern errcode_t ext2fs_new_inode(ext2_filsys fs, ext2_ino_t dir, int mode, + ext2fs_inode_bitmap map, ext2_ino_t *ret); +extern errcode_t ext2fs_new_block(ext2_filsys fs, blk_t goal, + ext2fs_block_bitmap map, blk_t *ret); +extern errcode_t ext2fs_new_block2(ext2_filsys fs, blk64_t goal, + ext2fs_block_bitmap map, blk64_t *ret); +extern errcode_t ext2fs_get_free_blocks(ext2_filsys fs, blk_t start, + blk_t finish, int num, + ext2fs_block_bitmap map, + blk_t *ret); +extern errcode_t ext2fs_get_free_blocks2(ext2_filsys fs, blk64_t start, + blk64_t finish, int num, + ext2fs_block_bitmap map, + blk64_t *ret); +extern errcode_t ext2fs_alloc_block(ext2_filsys fs, blk_t goal, + char *block_buf, blk_t *ret); +extern errcode_t ext2fs_alloc_block2(ext2_filsys fs, blk64_t goal, + char *block_buf, blk64_t *ret); +extern void ext2fs_set_alloc_block_callback(ext2_filsys fs, + errcode_t (*func)(ext2_filsys fs, + blk64_t goal, + blk64_t *ret), + errcode_t (**old)(ext2_filsys fs, + blk64_t goal, + blk64_t *ret)); + +/* alloc_sb.c */ +extern int ext2fs_reserve_super_and_bgd(ext2_filsys fs, + dgrp_t group, + ext2fs_block_bitmap bmap); +extern void ext2fs_set_block_alloc_stats_callback(ext2_filsys fs, + void (*func)(ext2_filsys fs, + blk64_t blk, + int inuse), + void (**old)(ext2_filsys fs, + blk64_t blk, + int inuse)); + +/* alloc_stats.c */ +void ext2fs_inode_alloc_stats(ext2_filsys fs, ext2_ino_t ino, int inuse); +void ext2fs_inode_alloc_stats2(ext2_filsys fs, ext2_ino_t ino, + int inuse, int isdir); +void ext2fs_block_alloc_stats(ext2_filsys fs, blk_t blk, int inuse); +void ext2fs_block_alloc_stats2(ext2_filsys fs, blk64_t blk, int inuse); + +/* alloc_tables.c */ +extern errcode_t ext2fs_allocate_tables(ext2_filsys fs); +extern errcode_t ext2fs_allocate_group_table(ext2_filsys fs, dgrp_t group, + ext2fs_block_bitmap bmap); + +/* badblocks.c */ +extern errcode_t ext2fs_u32_list_create(ext2_u32_list *ret, int size); +extern errcode_t ext2fs_u32_list_add(ext2_u32_list bb, __u32 blk); +extern int ext2fs_u32_list_find(ext2_u32_list bb, __u32 blk); +extern int ext2fs_u32_list_test(ext2_u32_list bb, blk_t blk); +extern errcode_t ext2fs_u32_list_iterate_begin(ext2_u32_list bb, + ext2_u32_iterate *ret); +extern int ext2fs_u32_list_iterate(ext2_u32_iterate iter, blk_t *blk); +extern void ext2fs_u32_list_iterate_end(ext2_u32_iterate iter); +extern errcode_t ext2fs_u32_copy(ext2_u32_list src, ext2_u32_list *dest); +extern int ext2fs_u32_list_equal(ext2_u32_list bb1, ext2_u32_list bb2); + +extern errcode_t ext2fs_badblocks_list_create(ext2_badblocks_list *ret, + int size); +extern errcode_t ext2fs_badblocks_list_add(ext2_badblocks_list bb, + blk_t blk); +extern int ext2fs_badblocks_list_test(ext2_badblocks_list bb, + blk_t blk); +extern int ext2fs_u32_list_del(ext2_u32_list bb, __u32 blk); +extern void ext2fs_badblocks_list_del(ext2_u32_list bb, __u32 blk); +extern errcode_t + ext2fs_badblocks_list_iterate_begin(ext2_badblocks_list bb, + ext2_badblocks_iterate *ret); +extern int ext2fs_badblocks_list_iterate(ext2_badblocks_iterate iter, + blk_t *blk); +extern void ext2fs_badblocks_list_iterate_end(ext2_badblocks_iterate iter); +extern errcode_t ext2fs_badblocks_copy(ext2_badblocks_list src, + ext2_badblocks_list *dest); +extern int ext2fs_badblocks_equal(ext2_badblocks_list bb1, + ext2_badblocks_list bb2); +extern int ext2fs_u32_list_count(ext2_u32_list bb); + +/* bb_compat */ +extern errcode_t badblocks_list_create(badblocks_list *ret, int size); +extern errcode_t badblocks_list_add(badblocks_list bb, blk_t blk); +extern int badblocks_list_test(badblocks_list bb, blk_t blk); +extern errcode_t badblocks_list_iterate_begin(badblocks_list bb, + badblocks_iterate *ret); +extern int badblocks_list_iterate(badblocks_iterate iter, blk_t *blk); +extern void badblocks_list_iterate_end(badblocks_iterate iter); +extern void badblocks_list_free(badblocks_list bb); + +/* bb_inode.c */ +extern errcode_t ext2fs_update_bb_inode(ext2_filsys fs, + ext2_badblocks_list bb_list); + +/* bitmaps.c */ +extern void ext2fs_free_block_bitmap(ext2fs_block_bitmap bitmap); +extern void ext2fs_free_inode_bitmap(ext2fs_inode_bitmap bitmap); +extern errcode_t ext2fs_copy_bitmap(ext2fs_generic_bitmap src, + ext2fs_generic_bitmap *dest); +extern errcode_t ext2fs_write_inode_bitmap(ext2_filsys fs); +extern errcode_t ext2fs_write_block_bitmap (ext2_filsys fs); +extern errcode_t ext2fs_read_inode_bitmap (ext2_filsys fs); +extern errcode_t ext2fs_read_block_bitmap(ext2_filsys fs); +extern errcode_t ext2fs_allocate_block_bitmap(ext2_filsys fs, + const char *descr, + ext2fs_block_bitmap *ret); +extern errcode_t ext2fs_allocate_inode_bitmap(ext2_filsys fs, + const char *descr, + ext2fs_inode_bitmap *ret); +extern errcode_t ext2fs_fudge_inode_bitmap_end(ext2fs_inode_bitmap bitmap, + ext2_ino_t end, ext2_ino_t *oend); +extern errcode_t ext2fs_fudge_block_bitmap_end(ext2fs_block_bitmap bitmap, + blk_t end, blk_t *oend); +extern errcode_t ext2fs_fudge_block_bitmap_end2(ext2fs_block_bitmap bitmap, + blk64_t end, blk64_t *oend); +extern void ext2fs_clear_inode_bitmap(ext2fs_inode_bitmap bitmap); +extern void ext2fs_clear_block_bitmap(ext2fs_block_bitmap bitmap); +extern errcode_t ext2fs_read_bitmaps(ext2_filsys fs); +extern errcode_t ext2fs_write_bitmaps(ext2_filsys fs); +extern errcode_t ext2fs_resize_inode_bitmap(__u32 new_end, __u32 new_real_end, + ext2fs_inode_bitmap bmap); +extern errcode_t ext2fs_resize_inode_bitmap2(__u64 new_end, + __u64 new_real_end, + ext2fs_inode_bitmap bmap); +extern errcode_t ext2fs_resize_block_bitmap(__u32 new_end, __u32 new_real_end, + ext2fs_block_bitmap bmap); +extern errcode_t ext2fs_resize_block_bitmap2(__u64 new_end, + __u64 new_real_end, + ext2fs_block_bitmap bmap); +extern errcode_t ext2fs_compare_block_bitmap(ext2fs_block_bitmap bm1, + ext2fs_block_bitmap bm2); +extern errcode_t ext2fs_compare_inode_bitmap(ext2fs_inode_bitmap bm1, + ext2fs_inode_bitmap bm2); +extern errcode_t ext2fs_set_inode_bitmap_range(ext2fs_inode_bitmap bmap, + ext2_ino_t start, unsigned int num, + void *in); +extern errcode_t ext2fs_set_inode_bitmap_range2(ext2fs_inode_bitmap bmap, + __u64 start, size_t num, + void *in); +extern errcode_t ext2fs_get_inode_bitmap_range(ext2fs_inode_bitmap bmap, + ext2_ino_t start, unsigned int num, + void *out); +extern errcode_t ext2fs_get_inode_bitmap_range2(ext2fs_inode_bitmap bmap, + __u64 start, size_t num, + void *out); +extern errcode_t ext2fs_set_block_bitmap_range(ext2fs_block_bitmap bmap, + blk_t start, unsigned int num, + void *in); +extern errcode_t ext2fs_set_block_bitmap_range2(ext2fs_block_bitmap bmap, + blk64_t start, size_t num, + void *in); +extern errcode_t ext2fs_get_block_bitmap_range(ext2fs_block_bitmap bmap, + blk_t start, unsigned int num, + void *out); +extern errcode_t ext2fs_get_block_bitmap_range2(ext2fs_block_bitmap bmap, + blk64_t start, size_t num, + void *out); + +/* blknum.c */ +extern dgrp_t ext2fs_group_of_blk2(ext2_filsys fs, blk64_t); +extern blk64_t ext2fs_group_first_block2(ext2_filsys fs, dgrp_t group); +extern blk64_t ext2fs_group_last_block2(ext2_filsys fs, dgrp_t group); +extern blk64_t ext2fs_inode_data_blocks2(ext2_filsys fs, + struct ext2_inode *inode); +extern blk64_t ext2fs_inode_i_blocks(ext2_filsys fs, + struct ext2_inode *inode); +extern blk64_t ext2fs_blocks_count(struct ext2_super_block *super); +extern void ext2fs_blocks_count_set(struct ext2_super_block *super, + blk64_t blk); +extern void ext2fs_blocks_count_add(struct ext2_super_block *super, + blk64_t blk); +extern blk64_t ext2fs_r_blocks_count(struct ext2_super_block *super); +extern void ext2fs_r_blocks_count_set(struct ext2_super_block *super, + blk64_t blk); +extern void ext2fs_r_blocks_count_add(struct ext2_super_block *super, + blk64_t blk); +extern blk64_t ext2fs_free_blocks_count(struct ext2_super_block *super); +extern void ext2fs_free_blocks_count_set(struct ext2_super_block *super, + blk64_t blk); +extern void ext2fs_free_blocks_count_add(struct ext2_super_block *super, + blk64_t blk); +/* Block group descriptor accessor functions */ +extern struct ext2_group_desc *ext2fs_group_desc(ext2_filsys fs, + struct opaque_ext2_group_desc *gdp, + dgrp_t group); +extern blk64_t ext2fs_block_bitmap_loc(ext2_filsys fs, dgrp_t group); +extern void ext2fs_block_bitmap_loc_set(ext2_filsys fs, dgrp_t group, + blk64_t blk); +extern blk64_t ext2fs_inode_bitmap_loc(ext2_filsys fs, dgrp_t group); +extern void ext2fs_inode_bitmap_loc_set(ext2_filsys fs, dgrp_t group, + blk64_t blk); +extern blk64_t ext2fs_inode_table_loc(ext2_filsys fs, dgrp_t group); +extern void ext2fs_inode_table_loc_set(ext2_filsys fs, dgrp_t group, + blk64_t blk); +extern __u32 ext2fs_bg_free_blocks_count(ext2_filsys fs, dgrp_t group); +extern void ext2fs_bg_free_blocks_count_set(ext2_filsys fs, dgrp_t group, + __u32 n); +extern __u32 ext2fs_bg_free_inodes_count(ext2_filsys fs, dgrp_t group); +extern void ext2fs_bg_free_inodes_count_set(ext2_filsys fs, dgrp_t group, + __u32 n); +extern __u32 ext2fs_bg_used_dirs_count(ext2_filsys fs, dgrp_t group); +extern void ext2fs_bg_used_dirs_count_set(ext2_filsys fs, dgrp_t group, + __u32 n); +extern __u32 ext2fs_bg_itable_unused(ext2_filsys fs, dgrp_t group); +extern void ext2fs_bg_itable_unused_set(ext2_filsys fs, dgrp_t group, + __u32 n); +extern __u16 ext2fs_bg_flags(ext2_filsys fs, dgrp_t group); +extern void ext2fs_bg_flags_zap(ext2_filsys fs, dgrp_t group); +extern int ext2fs_bg_flags_test(ext2_filsys fs, dgrp_t group, __u16 bg_flag); +extern void ext2fs_bg_flags_set(ext2_filsys fs, dgrp_t group, __u16 bg_flags); +extern void ext2fs_bg_flags_clear(ext2_filsys fs, dgrp_t group, __u16 bg_flags); +extern __u16 ext2fs_bg_checksum(ext2_filsys fs, dgrp_t group); +extern void ext2fs_bg_checksum_set(ext2_filsys fs, dgrp_t group, __u16 checksum); +extern blk64_t ext2fs_file_acl_block(const struct ext2_inode *inode); +extern void ext2fs_file_acl_block_set(struct ext2_inode *inode, blk64_t blk); + +/* block.c */ +extern errcode_t ext2fs_block_iterate(ext2_filsys fs, + ext2_ino_t ino, + int flags, + char *block_buf, + int (*func)(ext2_filsys fs, + blk_t *blocknr, + int blockcnt, + void *priv_data), + void *priv_data); +errcode_t ext2fs_block_iterate2(ext2_filsys fs, + ext2_ino_t ino, + int flags, + char *block_buf, + int (*func)(ext2_filsys fs, + blk_t *blocknr, + e2_blkcnt_t blockcnt, + blk_t ref_blk, + int ref_offset, + void *priv_data), + void *priv_data); +errcode_t ext2fs_block_iterate3(ext2_filsys fs, + ext2_ino_t ino, + int flags, + char *block_buf, + int (*func)(ext2_filsys fs, + blk64_t *blocknr, + e2_blkcnt_t blockcnt, + blk64_t ref_blk, + int ref_offset, + void *priv_data), + void *priv_data); + +/* bmap.c */ +extern errcode_t ext2fs_bmap(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + char *block_buf, int bmap_flags, + blk_t block, blk_t *phys_blk); +extern errcode_t ext2fs_bmap2(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + char *block_buf, int bmap_flags, blk64_t block, + int *ret_flags, blk64_t *phys_blk); + +#if 0 +/* bmove.c */ +extern errcode_t ext2fs_move_blocks(ext2_filsys fs, + ext2fs_block_bitmap reserve, + ext2fs_block_bitmap alloc_map, + int flags); +#endif + +/* check_desc.c */ +extern errcode_t ext2fs_check_desc(ext2_filsys fs); + +/* closefs.c */ +extern errcode_t ext2fs_close(ext2_filsys fs); +extern errcode_t ext2fs_flush(ext2_filsys fs); +extern int ext2fs_bg_has_super(ext2_filsys fs, int group_block); +extern errcode_t ext2fs_super_and_bgd_loc2(ext2_filsys fs, + dgrp_t group, + blk64_t *ret_super_blk, + blk64_t *ret_old_desc_blk, + blk64_t *ret_new_desc_blk, + blk_t *ret_used_blks); +extern int ext2fs_super_and_bgd_loc(ext2_filsys fs, + dgrp_t group, + blk_t *ret_super_blk, + blk_t *ret_old_desc_blk, + blk_t *ret_new_desc_blk, + int *ret_meta_bg); +extern void ext2fs_update_dynamic_rev(ext2_filsys fs); + +/* csum.c */ +extern void ext2fs_group_desc_csum_set(ext2_filsys fs, dgrp_t group); +extern int ext2fs_group_desc_csum_verify(ext2_filsys fs, dgrp_t group); +extern errcode_t ext2fs_set_gdt_csum(ext2_filsys fs); + +/* dblist.c */ + +extern errcode_t ext2fs_get_num_dirs(ext2_filsys fs, ext2_ino_t *ret_num_dirs); +extern errcode_t ext2fs_init_dblist(ext2_filsys fs, ext2_dblist *ret_dblist); +extern errcode_t ext2fs_add_dir_block(ext2_dblist dblist, ext2_ino_t ino, + blk_t blk, int blockcnt); +extern errcode_t ext2fs_add_dir_block2(ext2_dblist dblist, ext2_ino_t ino, + blk64_t blk, e2_blkcnt_t blockcnt); +extern void ext2fs_dblist_sort(ext2_dblist dblist, + EXT2_QSORT_TYPE (*sortfunc)(const void *, + const void *)); +extern void ext2fs_dblist_sort2(ext2_dblist dblist, + EXT2_QSORT_TYPE (*sortfunc)(const void *, + const void *)); +extern errcode_t ext2fs_dblist_iterate(ext2_dblist dblist, + int (*func)(ext2_filsys fs, struct ext2_db_entry *db_info, + void *priv_data), + void *priv_data); +extern errcode_t ext2fs_dblist_iterate2(ext2_dblist dblist, + int (*func)(ext2_filsys fs, struct ext2_db_entry2 *db_info, + void *priv_data), + void *priv_data); +extern errcode_t ext2fs_set_dir_block(ext2_dblist dblist, ext2_ino_t ino, + blk_t blk, int blockcnt); +extern errcode_t ext2fs_set_dir_block2(ext2_dblist dblist, ext2_ino_t ino, + blk64_t blk, e2_blkcnt_t blockcnt); +extern errcode_t ext2fs_copy_dblist(ext2_dblist src, + ext2_dblist *dest); +extern int ext2fs_dblist_count(ext2_dblist dblist); +extern blk64_t ext2fs_dblist_count2(ext2_dblist dblist); +extern errcode_t ext2fs_dblist_get_last(ext2_dblist dblist, + struct ext2_db_entry **entry); +extern errcode_t ext2fs_dblist_get_last2(ext2_dblist dblist, + struct ext2_db_entry2 **entry); +extern errcode_t ext2fs_dblist_drop_last(ext2_dblist dblist); + +/* dblist_dir.c */ +extern errcode_t + ext2fs_dblist_dir_iterate(ext2_dblist dblist, + int flags, + char *block_buf, + int (*func)(ext2_ino_t dir, + int entry, + struct ext2_dir_entry *dirent, + int offset, + int blocksize, + char *buf, + void *priv_data), + void *priv_data); + +/* dirblock.c */ +extern errcode_t ext2fs_read_dir_block(ext2_filsys fs, blk_t block, + void *buf); +extern errcode_t ext2fs_read_dir_block2(ext2_filsys fs, blk_t block, + void *buf, int flags); +extern errcode_t ext2fs_read_dir_block3(ext2_filsys fs, blk64_t block, + void *buf, int flags); +extern errcode_t ext2fs_write_dir_block(ext2_filsys fs, blk_t block, + void *buf); +extern errcode_t ext2fs_write_dir_block2(ext2_filsys fs, blk_t block, + void *buf, int flags); +extern errcode_t ext2fs_write_dir_block3(ext2_filsys fs, blk64_t block, + void *buf, int flags); + +/* dirhash.c */ +extern errcode_t ext2fs_dirhash(int version, const char *name, int len, + const __u32 *seed, + ext2_dirhash_t *ret_hash, + ext2_dirhash_t *ret_minor_hash); + + +/* dir_iterate.c */ +extern errcode_t ext2fs_get_rec_len(ext2_filsys fs, + struct ext2_dir_entry *dirent, + unsigned int *rec_len); +extern errcode_t ext2fs_set_rec_len(ext2_filsys fs, + unsigned int len, + struct ext2_dir_entry *dirent); +extern errcode_t ext2fs_dir_iterate(ext2_filsys fs, + ext2_ino_t dir, + int flags, + char *block_buf, + int (*func)(struct ext2_dir_entry *dirent, + int offset, + int blocksize, + char *buf, + void *priv_data), + void *priv_data); +extern errcode_t ext2fs_dir_iterate2(ext2_filsys fs, + ext2_ino_t dir, + int flags, + char *block_buf, + int (*func)(ext2_ino_t dir, + int entry, + struct ext2_dir_entry *dirent, + int offset, + int blocksize, + char *buf, + void *priv_data), + void *priv_data); + +/* dupfs.c */ +extern errcode_t ext2fs_dup_handle(ext2_filsys src, ext2_filsys *dest); + +/* expanddir.c */ +extern errcode_t ext2fs_expand_dir(ext2_filsys fs, ext2_ino_t dir); + +/* ext_attr.c */ +extern __u32 ext2fs_ext_attr_hash_entry(struct ext2_ext_attr_entry *entry, + void *data); +extern errcode_t ext2fs_read_ext_attr(ext2_filsys fs, blk_t block, void *buf); +extern errcode_t ext2fs_read_ext_attr2(ext2_filsys fs, blk64_t block, + void *buf); +extern errcode_t ext2fs_write_ext_attr(ext2_filsys fs, blk_t block, + void *buf); +extern errcode_t ext2fs_write_ext_attr2(ext2_filsys fs, blk64_t block, + void *buf); +extern errcode_t ext2fs_adjust_ea_refcount(ext2_filsys fs, blk_t blk, + char *block_buf, + int adjust, __u32 *newcount); +extern errcode_t ext2fs_adjust_ea_refcount2(ext2_filsys fs, blk64_t blk, + char *block_buf, + int adjust, __u32 *newcount); + +/* extent.c */ +extern errcode_t ext2fs_extent_header_verify(void *ptr, int size); +extern errcode_t ext2fs_extent_open(ext2_filsys fs, ext2_ino_t ino, + ext2_extent_handle_t *handle); +extern errcode_t ext2fs_extent_open2(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + ext2_extent_handle_t *ret_handle); +extern void ext2fs_extent_free(ext2_extent_handle_t handle); +extern errcode_t ext2fs_extent_get(ext2_extent_handle_t handle, + int flags, struct ext2fs_extent *extent); +extern errcode_t ext2fs_extent_replace(ext2_extent_handle_t handle, int flags, + struct ext2fs_extent *extent); +extern errcode_t ext2fs_extent_insert(ext2_extent_handle_t handle, int flags, + struct ext2fs_extent *extent); +extern errcode_t ext2fs_extent_set_bmap(ext2_extent_handle_t handle, + blk64_t logical, blk64_t physical, + int flags); +extern errcode_t ext2fs_extent_delete(ext2_extent_handle_t handle, int flags); +extern errcode_t ext2fs_extent_get_info(ext2_extent_handle_t handle, + struct ext2_extent_info *info); +extern errcode_t ext2fs_extent_goto(ext2_extent_handle_t handle, + blk64_t blk); + +/* fileio.c */ +extern errcode_t ext2fs_file_open2(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + int flags, ext2_file_t *ret); +extern errcode_t ext2fs_file_open(ext2_filsys fs, ext2_ino_t ino, + int flags, ext2_file_t *ret); +extern ext2_filsys ext2fs_file_get_fs(ext2_file_t file); +struct ext2_inode *ext2fs_file_get_inode(ext2_file_t file); +extern errcode_t ext2fs_file_close(ext2_file_t file); +extern errcode_t ext2fs_file_flush(ext2_file_t file); +extern errcode_t ext2fs_file_read(ext2_file_t file, void *buf, + unsigned int wanted, unsigned int *got); +extern errcode_t ext2fs_file_write(ext2_file_t file, const void *buf, + unsigned int nbytes, unsigned int *written); +extern errcode_t ext2fs_file_llseek(ext2_file_t file, __u64 offset, + int whence, __u64 *ret_pos); +extern errcode_t ext2fs_file_lseek(ext2_file_t file, ext2_off_t offset, + int whence, ext2_off_t *ret_pos); +errcode_t ext2fs_file_get_lsize(ext2_file_t file, __u64 *ret_size); +extern ext2_off_t ext2fs_file_get_size(ext2_file_t file); +extern errcode_t ext2fs_file_set_size(ext2_file_t file, ext2_off_t size); +extern errcode_t ext2fs_file_set_size2(ext2_file_t file, ext2_off64_t size); + +/* finddev.c */ +extern char *ext2fs_find_block_device(dev_t device); + +/* flushb.c */ +extern errcode_t ext2fs_sync_device(int fd, int flushb); + +/* freefs.c */ +extern void ext2fs_free(ext2_filsys fs); +extern void ext2fs_free_dblist(ext2_dblist dblist); +extern void ext2fs_badblocks_list_free(ext2_badblocks_list bb); +extern void ext2fs_u32_list_free(ext2_u32_list bb); + +/* gen_bitmap.c */ +extern void ext2fs_free_generic_bitmap(ext2fs_inode_bitmap bitmap); +extern errcode_t ext2fs_make_generic_bitmap(errcode_t magic, ext2_filsys fs, + __u32 start, __u32 end, + __u32 real_end, + const char *descr, char *init_map, + ext2fs_generic_bitmap *ret); +extern errcode_t ext2fs_allocate_generic_bitmap(__u32 start, + __u32 end, + __u32 real_end, + const char *descr, + ext2fs_generic_bitmap *ret); +extern errcode_t ext2fs_copy_generic_bitmap(ext2fs_generic_bitmap src, + ext2fs_generic_bitmap *dest); +extern void ext2fs_clear_generic_bitmap(ext2fs_generic_bitmap bitmap); +extern errcode_t ext2fs_fudge_generic_bitmap_end(ext2fs_inode_bitmap bitmap, + errcode_t magic, + errcode_t neq, + ext2_ino_t end, + ext2_ino_t *oend); +extern void ext2fs_set_generic_bitmap_padding(ext2fs_generic_bitmap map); +extern errcode_t ext2fs_resize_generic_bitmap(errcode_t magic, + __u32 new_end, + __u32 new_real_end, + ext2fs_generic_bitmap bmap); +extern errcode_t ext2fs_compare_generic_bitmap(errcode_t magic, errcode_t neq, + ext2fs_generic_bitmap bm1, + ext2fs_generic_bitmap bm2); +extern errcode_t ext2fs_get_generic_bitmap_range(ext2fs_generic_bitmap bmap, + errcode_t magic, + __u32 start, __u32 num, + void *out); +extern errcode_t ext2fs_set_generic_bitmap_range(ext2fs_generic_bitmap bmap, + errcode_t magic, + __u32 start, __u32 num, + void *in); + +/* gen_bitmap64.c */ +void ext2fs_free_generic_bmap(ext2fs_generic_bitmap bmap); +errcode_t ext2fs_alloc_generic_bmap(ext2_filsys fs, errcode_t magic, + int type, __u64 start, __u64 end, + __u64 real_end, + const char *descr, + ext2fs_generic_bitmap *ret); +errcode_t ext2fs_copy_generic_bmap(ext2fs_generic_bitmap src, + ext2fs_generic_bitmap *dest); +void ext2fs_clear_generic_bmap(ext2fs_generic_bitmap bitmap); +errcode_t ext2fs_fudge_generic_bmap_end(ext2fs_generic_bitmap bitmap, + errcode_t neq, + __u64 end, __u64 *oend); +void ext2fs_set_generic_bmap_padding(ext2fs_generic_bitmap bmap); +errcode_t ext2fs_resize_generic_bmap(ext2fs_generic_bitmap bmap, + __u64 new_end, + __u64 new_real_end); +errcode_t ext2fs_compare_generic_bmap(errcode_t neq, + ext2fs_generic_bitmap bm1, + ext2fs_generic_bitmap bm2); +errcode_t ext2fs_get_generic_bmap_range(ext2fs_generic_bitmap bmap, + __u64 start, unsigned int num, + void *out); +errcode_t ext2fs_set_generic_bmap_range(ext2fs_generic_bitmap bmap, + __u64 start, unsigned int num, + void *in); + +/* getsize.c */ +extern errcode_t ext2fs_get_device_size(const char *file, int blocksize, + blk_t *retblocks); +extern errcode_t ext2fs_get_device_size2(const char *file, int blocksize, + blk64_t *retblocks); + +/* getsectsize.c */ +errcode_t ext2fs_get_device_sectsize(const char *file, int *sectsize); +errcode_t ext2fs_get_device_phys_sectsize(const char *file, int *sectsize); + +/* i_block.c */ +errcode_t ext2fs_iblk_add_blocks(ext2_filsys fs, struct ext2_inode *inode, + blk64_t num_blocks); +errcode_t ext2fs_iblk_sub_blocks(ext2_filsys fs, struct ext2_inode *inode, + blk64_t num_blocks); +errcode_t ext2fs_iblk_set(ext2_filsys fs, struct ext2_inode *inode, blk64_t b); + +/* imager.c */ +extern errcode_t ext2fs_image_inode_write(ext2_filsys fs, int fd, int flags); +extern errcode_t ext2fs_image_inode_read(ext2_filsys fs, int fd, int flags); +extern errcode_t ext2fs_image_super_write(ext2_filsys fs, int fd, int flags); +extern errcode_t ext2fs_image_super_read(ext2_filsys fs, int fd, int flags); +extern errcode_t ext2fs_image_bitmap_write(ext2_filsys fs, int fd, int flags); +extern errcode_t ext2fs_image_bitmap_read(ext2_filsys fs, int fd, int flags); + +/* ind_block.c */ +errcode_t ext2fs_read_ind_block(ext2_filsys fs, blk_t blk, void *buf); +errcode_t ext2fs_write_ind_block(ext2_filsys fs, blk_t blk, void *buf); + +/* initialize.c */ +extern errcode_t ext2fs_initialize(const char *name, int flags, + struct ext2_super_block *param, + io_manager manager, ext2_filsys *ret_fs); + +/* icount.c */ +extern void ext2fs_free_icount(ext2_icount_t icount); +extern errcode_t ext2fs_create_icount_tdb(ext2_filsys fs, char *tdb_dir, + int flags, ext2_icount_t *ret); +extern errcode_t ext2fs_create_icount2(ext2_filsys fs, int flags, + unsigned int size, + ext2_icount_t hint, ext2_icount_t *ret); +extern errcode_t ext2fs_create_icount(ext2_filsys fs, int flags, + unsigned int size, + ext2_icount_t *ret); +extern errcode_t ext2fs_icount_fetch(ext2_icount_t icount, ext2_ino_t ino, + __u16 *ret); +extern errcode_t ext2fs_icount_increment(ext2_icount_t icount, ext2_ino_t ino, + __u16 *ret); +extern errcode_t ext2fs_icount_decrement(ext2_icount_t icount, ext2_ino_t ino, + __u16 *ret); +extern errcode_t ext2fs_icount_store(ext2_icount_t icount, ext2_ino_t ino, + __u16 count); +extern ext2_ino_t ext2fs_get_icount_size(ext2_icount_t icount); +errcode_t ext2fs_icount_validate(ext2_icount_t icount, FILE *); + +/* inode.c */ +extern errcode_t ext2fs_flush_icache(ext2_filsys fs); +extern errcode_t ext2fs_get_next_inode_full(ext2_inode_scan scan, + ext2_ino_t *ino, + struct ext2_inode *inode, + int bufsize); +extern errcode_t ext2fs_open_inode_scan(ext2_filsys fs, int buffer_blocks, + ext2_inode_scan *ret_scan); +extern void ext2fs_close_inode_scan(ext2_inode_scan scan); +extern errcode_t ext2fs_get_next_inode(ext2_inode_scan scan, ext2_ino_t *ino, + struct ext2_inode *inode); +extern errcode_t ext2fs_inode_scan_goto_blockgroup(ext2_inode_scan scan, + int group); +extern void ext2fs_set_inode_callback + (ext2_inode_scan scan, + errcode_t (*done_group)(ext2_filsys fs, + ext2_inode_scan scan, + dgrp_t group, + void * priv_data), + void *done_group_data); +extern int ext2fs_inode_scan_flags(ext2_inode_scan scan, int set_flags, + int clear_flags); +extern errcode_t ext2fs_read_inode_full(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode * inode, + int bufsize); +extern errcode_t ext2fs_read_inode (ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode * inode); +extern errcode_t ext2fs_write_inode_full(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode * inode, + int bufsize); +extern errcode_t ext2fs_write_inode(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode * inode); +extern errcode_t ext2fs_write_new_inode(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode * inode); +extern errcode_t ext2fs_get_blocks(ext2_filsys fs, ext2_ino_t ino, blk_t *blocks); +extern errcode_t ext2fs_check_directory(ext2_filsys fs, ext2_ino_t ino); + +/* inode_io.c */ +extern io_manager inode_io_manager; +extern errcode_t ext2fs_inode_io_intern(ext2_filsys fs, ext2_ino_t ino, + char **name); +extern errcode_t ext2fs_inode_io_intern2(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + char **name); + +/* ismounted.c */ +extern errcode_t ext2fs_check_if_mounted(const char *file, int *mount_flags); +extern errcode_t ext2fs_check_mount_point(const char *device, int *mount_flags, + char *mtpt, int mtlen); + +/* punch.c */ +extern errcode_t ext2fs_punch(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + char *block_buf, blk64_t start, + blk64_t end); + +/* namei.c */ +extern errcode_t ext2fs_lookup(ext2_filsys fs, ext2_ino_t dir, const char *name, + int namelen, char *buf, ext2_ino_t *inode); +extern errcode_t ext2fs_namei(ext2_filsys fs, ext2_ino_t root, ext2_ino_t cwd, + const char *name, ext2_ino_t *inode); +errcode_t ext2fs_namei_follow(ext2_filsys fs, ext2_ino_t root, ext2_ino_t cwd, + const char *name, ext2_ino_t *inode); +extern errcode_t ext2fs_follow_link(ext2_filsys fs, ext2_ino_t root, ext2_ino_t cwd, + ext2_ino_t inode, ext2_ino_t *res_inode); + +/* native.c */ +int ext2fs_native_flag(void); + +/* newdir.c */ +extern errcode_t ext2fs_new_dir_block(ext2_filsys fs, ext2_ino_t dir_ino, + ext2_ino_t parent_ino, char **block); + +/* mkdir.c */ +extern errcode_t ext2fs_mkdir(ext2_filsys fs, ext2_ino_t parent, ext2_ino_t inum, + const char *name); + +/* mkjournal.c */ +extern errcode_t ext2fs_zero_blocks(ext2_filsys fs, blk_t blk, int num, + blk_t *ret_blk, int *ret_count); +extern errcode_t ext2fs_zero_blocks2(ext2_filsys fs, blk64_t blk, int num, + blk64_t *ret_blk, int *ret_count); +extern errcode_t ext2fs_create_journal_superblock(ext2_filsys fs, + __u32 size, int flags, + char **ret_jsb); +extern errcode_t ext2fs_add_journal_device(ext2_filsys fs, + ext2_filsys journal_dev); +extern errcode_t ext2fs_add_journal_inode(ext2_filsys fs, blk_t size, + int flags); +extern int ext2fs_default_journal_size(__u64 blocks); + +/* openfs.c */ +extern errcode_t ext2fs_open(const char *name, int flags, int superblock, + unsigned int block_size, io_channel * chan, + ext2_filsys *ret_fs); +extern errcode_t ext2fs_open2(const char *name, const char *io_options, + int flags, int superblock, + unsigned int block_size, io_channel * chan, + ext2_filsys *ret_fs); +extern blk64_t ext2fs_descriptor_block_loc2(ext2_filsys fs, + blk64_t group_block, dgrp_t i); +extern blk_t ext2fs_descriptor_block_loc(ext2_filsys fs, blk_t group_block, + dgrp_t i); +errcode_t ext2fs_get_data_io(ext2_filsys fs, io_channel *old_io); +errcode_t ext2fs_set_data_io(ext2_filsys fs, io_channel new_io); +errcode_t ext2fs_rewrite_to_io(ext2_filsys fs, io_channel new_io); + +/* get_pathname.c */ +extern errcode_t ext2fs_get_pathname(ext2_filsys fs, ext2_ino_t dir, ext2_ino_t ino, + char **name); + +/* link.c */ +errcode_t ext2fs_link(ext2_filsys fs, ext2_ino_t dir, const char *name, + ext2_ino_t ino, int flags); +errcode_t ext2fs_unlink(ext2_filsys fs, ext2_ino_t dir, const char *name, + ext2_ino_t ino, int flags); + +/* read_bb.c */ +extern errcode_t ext2fs_read_bb_inode(ext2_filsys fs, + ext2_badblocks_list *bb_list); + +/* read_bb_file.c */ +extern errcode_t ext2fs_read_bb_FILE2(ext2_filsys fs, FILE *f, + ext2_badblocks_list *bb_list, + void *priv_data, + void (*invalid)(ext2_filsys fs, + blk_t blk, + char *badstr, + void *priv_data)); +extern errcode_t ext2fs_read_bb_FILE(ext2_filsys fs, FILE *f, + ext2_badblocks_list *bb_list, + void (*invalid)(ext2_filsys fs, + blk_t blk)); + +/* res_gdt.c */ +extern errcode_t ext2fs_create_resize_inode(ext2_filsys fs); + +/* swapfs.c */ +extern void ext2fs_swap_ext_attr(char *to, char *from, int bufsize, + int has_header); +extern void ext2fs_swap_ext_attr_header(struct ext2_ext_attr_header *to_header, + struct ext2_ext_attr_header *from_hdr); +extern void ext2fs_swap_ext_attr_entry(struct ext2_ext_attr_entry *to_entry, + struct ext2_ext_attr_entry *from_entry); +extern void ext2fs_swap_super(struct ext2_super_block * super); +extern void ext2fs_swap_group_desc(struct ext2_group_desc *gdp); +extern void ext2fs_swap_group_desc2(ext2_filsys, struct ext2_group_desc *gdp); +extern void ext2fs_swap_inode_full(ext2_filsys fs, struct ext2_inode_large *t, + struct ext2_inode_large *f, int hostorder, + int bufsize); +extern void ext2fs_swap_inode(ext2_filsys fs,struct ext2_inode *t, + struct ext2_inode *f, int hostorder); + +/* valid_blk.c */ +extern int ext2fs_inode_has_valid_blocks(struct ext2_inode *inode); + +/* version.c */ +extern int ext2fs_parse_version_string(const char *ver_string); +extern int ext2fs_get_library_version(const char **ver_string, + const char **date_string); + +/* write_bb_file.c */ +extern errcode_t ext2fs_write_bb_FILE(ext2_badblocks_list bb_list, + unsigned int flags, + FILE *f); + + +/* inline functions */ +extern errcode_t ext2fs_get_mem(unsigned long size, void *ptr); +extern errcode_t ext2fs_get_memalign(unsigned long size, + unsigned long align, void *ptr); +extern errcode_t ext2fs_free_mem(void *ptr); +extern errcode_t ext2fs_resize_mem(unsigned long old_size, + unsigned long size, void *ptr); +extern void ext2fs_mark_super_dirty(ext2_filsys fs); +extern void ext2fs_mark_changed(ext2_filsys fs); +extern int ext2fs_test_changed(ext2_filsys fs); +extern void ext2fs_mark_valid(ext2_filsys fs); +extern void ext2fs_unmark_valid(ext2_filsys fs); +extern int ext2fs_test_valid(ext2_filsys fs); +extern void ext2fs_mark_ib_dirty(ext2_filsys fs); +extern void ext2fs_mark_bb_dirty(ext2_filsys fs); +extern int ext2fs_test_ib_dirty(ext2_filsys fs); +extern int ext2fs_test_bb_dirty(ext2_filsys fs); +extern int ext2fs_group_of_blk(ext2_filsys fs, blk_t blk); +extern int ext2fs_group_of_ino(ext2_filsys fs, ext2_ino_t ino); +extern blk_t ext2fs_group_first_block(ext2_filsys fs, dgrp_t group); +extern blk_t ext2fs_group_last_block(ext2_filsys fs, dgrp_t group); +extern blk_t ext2fs_inode_data_blocks(ext2_filsys fs, + struct ext2_inode *inode); +extern unsigned int ext2fs_div_ceil(unsigned int a, unsigned int b); +extern __u64 ext2fs_div64_ceil(__u64 a, __u64 b); + +/* + * The actual inlined functions definitions themselves... + * + * If NO_INLINE_FUNCS is defined, then we won't try to do inline + * functions at all! + */ +#if (defined(INCLUDE_INLINE_FUNCS) || !defined(NO_INLINE_FUNCS)) +#ifdef INCLUDE_INLINE_FUNCS +#define _INLINE_ extern +#else +#ifdef __GNUC__ +#define _INLINE_ extern __inline__ +#else /* For Watcom C */ +#define _INLINE_ extern inline +#endif +#endif + +#ifndef EXT2_CUSTOM_MEMORY_ROUTINES +#include <string.h> +#include "mem_allocate.h" +/* + * Allocate memory + */ +_INLINE_ errcode_t ext2fs_get_mem(unsigned long size, void *ptr) +{ + void *pp; + + pp = mem_alloc(size); + if (!pp) + return EXT2_ET_NO_MEMORY; + memcpy(ptr, &pp, sizeof (pp)); + return 0; +} + +_INLINE_ errcode_t ext2fs_get_memalign(unsigned long size, + unsigned long align, void *ptr) +{ + void *pp; + + #ifdef HWRVL + pp = mem_align(32, size); + #else + pp = mem_alloc(size); + #endif + if (!pp) + return EXT2_ET_NO_MEMORY; + + memcpy(ptr, &pp, sizeof (pp)); + return 0; +} + +_INLINE_ errcode_t ext2fs_get_array(unsigned long count, unsigned long size, void *ptr) +{ + if (count && (-1UL)/count<size) + return EXT2_ET_NO_MEMORY; //maybe define EXT2_ET_OVERFLOW ? + return ext2fs_get_mem(count*size, ptr); +} + +/* + * Free memory + */ +_INLINE_ errcode_t ext2fs_free_mem(void *ptr) +{ + void *p; + + memcpy(&p, ptr, sizeof(p)); + mem_free(p); + p = 0; + memcpy(ptr, &p, sizeof(p)); + return 0; +} + +/* + * Resize memory + */ +_INLINE_ errcode_t ext2fs_resize_mem(unsigned long EXT2FS_ATTR((unused)) old_size, + unsigned long size, void *ptr) +{ + void *p; + + /* Use "memcpy" for pointer assignments here to avoid problems + * with C99 strict type aliasing rules. */ + memcpy(&p, ptr, sizeof(p)); + p = mem_realloc(p, size); + if (!p) + return EXT2_ET_NO_MEMORY; + memcpy(ptr, &p, sizeof(p)); + return 0; +} +#endif /* Custom memory routines */ + +/* + * Mark a filesystem superblock as dirty + */ +_INLINE_ void ext2fs_mark_super_dirty(ext2_filsys fs) +{ + fs->flags |= EXT2_FLAG_DIRTY | EXT2_FLAG_CHANGED; +} + +/* + * Mark a filesystem as changed + */ +_INLINE_ void ext2fs_mark_changed(ext2_filsys fs) +{ + fs->flags |= EXT2_FLAG_CHANGED; +} + +/* + * Check to see if a filesystem has changed + */ +_INLINE_ int ext2fs_test_changed(ext2_filsys fs) +{ + return (fs->flags & EXT2_FLAG_CHANGED); +} + +/* + * Mark a filesystem as valid + */ +_INLINE_ void ext2fs_mark_valid(ext2_filsys fs) +{ + fs->flags |= EXT2_FLAG_VALID; +} + +/* + * Mark a filesystem as NOT valid + */ +_INLINE_ void ext2fs_unmark_valid(ext2_filsys fs) +{ + fs->flags &= ~EXT2_FLAG_VALID; +} + +/* + * Check to see if a filesystem is valid + */ +_INLINE_ int ext2fs_test_valid(ext2_filsys fs) +{ + return (fs->flags & EXT2_FLAG_VALID); +} + +/* + * Mark the inode bitmap as dirty + */ +_INLINE_ void ext2fs_mark_ib_dirty(ext2_filsys fs) +{ + fs->flags |= EXT2_FLAG_IB_DIRTY | EXT2_FLAG_CHANGED; +} + +/* + * Mark the block bitmap as dirty + */ +_INLINE_ void ext2fs_mark_bb_dirty(ext2_filsys fs) +{ + fs->flags |= EXT2_FLAG_BB_DIRTY | EXT2_FLAG_CHANGED; +} + +/* + * Check to see if a filesystem's inode bitmap is dirty + */ +_INLINE_ int ext2fs_test_ib_dirty(ext2_filsys fs) +{ + return (fs->flags & EXT2_FLAG_IB_DIRTY); +} + +/* + * Check to see if a filesystem's block bitmap is dirty + */ +_INLINE_ int ext2fs_test_bb_dirty(ext2_filsys fs) +{ + return (fs->flags & EXT2_FLAG_BB_DIRTY); +} + +/* + * Return the group # of a block + */ +_INLINE_ int ext2fs_group_of_blk(ext2_filsys fs, blk_t blk) +{ + return ext2fs_group_of_blk2(fs, blk); +} +/* + * Return the group # of an inode number + */ +_INLINE_ int ext2fs_group_of_ino(ext2_filsys fs, ext2_ino_t ino) +{ + return (ino - 1) / fs->super->s_inodes_per_group; +} + +/* + * Return the first block (inclusive) in a group + */ +_INLINE_ blk_t ext2fs_group_first_block(ext2_filsys fs, dgrp_t group) +{ + return ext2fs_group_first_block2(fs, group); +} + +/* + * Return the last block (inclusive) in a group + */ +_INLINE_ blk_t ext2fs_group_last_block(ext2_filsys fs, dgrp_t group) +{ + return ext2fs_group_last_block2(fs, group); +} + +_INLINE_ blk_t ext2fs_inode_data_blocks(ext2_filsys fs, + struct ext2_inode *inode) +{ + return ext2fs_inode_data_blocks2(fs, inode); +} + +/* + * This is an efficient, overflow safe way of calculating ceil((1.0 * a) / b) + */ +_INLINE_ unsigned int ext2fs_div_ceil(unsigned int a, unsigned int b) +{ + if (!a) + return 0; + return ((a - 1) / b) + 1; +} + +_INLINE_ __u64 ext2fs_div64_ceil(__u64 a, __u64 b) +{ + if (!a) + return 0; + return ((a - 1) / b) + 1; +} + +#undef _INLINE_ +#endif + +#ifdef __cplusplus +} +#endif + +#endif /* _EXT2FS_EXT2FS_H */ diff --git a/portlibs/sources/libext2fs/source/ext2fsP.h b/portlibs/sources/libext2fs/source/ext2fsP.h new file mode 100644 index 00000000..ab9ee766 --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext2fsP.h @@ -0,0 +1,143 @@ +/* + * ext2fsP.h --- private header file for ext2 library + * + * Copyright (C) 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include "ext2fs.h" + +/* + * Badblocks list + */ +struct ext2_struct_u32_list { + int magic; + int num; + int size; + __u32 *list; + int badblocks_flags; +}; + +struct ext2_struct_u32_iterate { + int magic; + ext2_u32_list bb; + int ptr; +}; + + +/* + * Directory block iterator definition + */ +struct ext2_struct_dblist { + int magic; + ext2_filsys fs; + unsigned long long size; + unsigned long long count; + int sorted; + struct ext2_db_entry2 * list; +}; + +/* + * For directory iterators + */ +struct dir_context { + ext2_ino_t dir; + int flags; + char *buf; + int (*func)(ext2_ino_t dir, + int entry, + struct ext2_dir_entry *dirent, + int offset, + int blocksize, + char *buf, + void *priv_data); + void *priv_data; + errcode_t errcode; +}; + +/* + * Inode cache structure + */ +struct ext2_inode_cache { + void * buffer; + blk_t buffer_blk; + int cache_last; + int cache_size; + int refcount; + struct ext2_inode_cache_ent *cache; +}; + +struct ext2_inode_cache_ent { + ext2_ino_t ino; + struct ext2_inode inode; +}; + +/* Function prototypes */ + +extern int ext2fs_process_dir_block(ext2_filsys fs, + blk64_t *blocknr, + e2_blkcnt_t blockcnt, + blk64_t ref_block, + int ref_offset, + void *priv_data); + +/* Generic numeric progress meter */ + +struct ext2fs_numeric_progress_struct { + __u64 max; + int log_max; + int skip_progress; +}; + +extern void ext2fs_numeric_progress_init(ext2_filsys fs, + struct ext2fs_numeric_progress_struct * progress, + const char *label, __u64 max); +extern void ext2fs_numeric_progress_update(ext2_filsys fs, + struct ext2fs_numeric_progress_struct * progress, + __u64 val); +extern void ext2fs_numeric_progress_close(ext2_filsys fs, + struct ext2fs_numeric_progress_struct * progress, + const char *message); + +/* + * 64-bit bitmap support + */ + +#define EXT2FS_BMAP64_BITARRAY 1 + +extern errcode_t ext2fs_alloc_generic_bmap(ext2_filsys fs, errcode_t magic, + int type, __u64 start, __u64 end, + __u64 real_end, + const char * description, + ext2fs_generic_bitmap *bmap); + +extern void ext2fs_free_generic_bmap(ext2fs_generic_bitmap bmap); + +extern errcode_t ext2fs_copy_generic_bmap(ext2fs_generic_bitmap src, + ext2fs_generic_bitmap *dest); + +extern errcode_t ext2fs_resize_generic_bmap(ext2fs_generic_bitmap bmap, + __u64 new_end, + __u64 new_real_end); +extern errcode_t ext2fs_fudge_generic_bmap_end(ext2fs_generic_bitmap bitmap, + errcode_t neq, + __u64 end, __u64 *oend); +extern int ext2fs_mark_generic_bmap(ext2fs_generic_bitmap bitmap, + __u64 arg); +extern int ext2fs_unmark_generic_bmap(ext2fs_generic_bitmap bitmap, + __u64 arg); +extern int ext2fs_test_generic_bmap(ext2fs_generic_bitmap bitmap, + __u64 arg); +extern errcode_t ext2fs_set_generic_bmap_range(ext2fs_generic_bitmap bitmap, + __u64 start, unsigned int num, + void *in); +extern errcode_t ext2fs_get_generic_bmap_range(ext2fs_generic_bitmap bitmap, + __u64 start, unsigned int num, + void *out); +extern int ext2fs_warn_bitmap32(ext2fs_generic_bitmap bitmap, const char *func); + +extern int ext2fs_mem_is_zero(const char *mem, size_t len); diff --git a/portlibs/sources/libext2fs/source/ext3_extents.h b/portlibs/sources/libext2fs/source/ext3_extents.h new file mode 100644 index 00000000..88fabc9d --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext3_extents.h @@ -0,0 +1,109 @@ +/* + * Copyright (c) 2003,2004 Cluster File Systems, Inc, info@clusterfs.com + * Written by Alex Tomas <alex@clusterfs.com> + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#ifndef _LINUX_EXT3_EXTENTS +#define _LINUX_EXT3_EXTENTS + +/* + * ext3_inode has i_block array (total 60 bytes) + * first 4 bytes are used to store: + * - tree depth (0 mean there is no tree yet. all extents in the inode) + * - number of alive extents in the inode + */ + +/* + * this is extent on-disk structure + * it's used at the bottom of the tree + */ +struct ext3_extent { + __u32 ee_block; /* first logical block extent covers */ + __u16 ee_len; /* number of blocks covered by extent */ + __u16 ee_start_hi; /* high 16 bits of physical block */ + __u32 ee_start; /* low 32 bigs of physical block */ +}; + +/* + * this is index on-disk structure + * it's used at all the levels, but the bottom + */ +struct ext3_extent_idx { + __u32 ei_block; /* index covers logical blocks from 'block' */ + __u32 ei_leaf; /* pointer to the physical block of the next * + * level. leaf or next index could bet here */ + __u16 ei_leaf_hi; /* high 16 bits of physical block */ + __u16 ei_unused; +}; + +/* + * each block (leaves and indexes), even inode-stored has header + */ +struct ext3_extent_header { + __u16 eh_magic; /* probably will support different formats */ + __u16 eh_entries; /* number of valid entries */ + __u16 eh_max; /* capacity of store in entries */ + __u16 eh_depth; /* has tree real underlaying blocks? */ + __u32 eh_generation; /* generation of the tree */ +}; + +#define EXT3_EXT_MAGIC 0xf30a + +/* + * array of ext3_ext_path contains path to some extent + * creation/lookup routines use it for traversal/splitting/etc + * truncate uses it to simulate recursive walking + */ +struct ext3_ext_path { + __u32 p_block; + __u16 p_depth; + struct ext3_extent *p_ext; + struct ext3_extent_idx *p_idx; + struct ext3_extent_header *p_hdr; + struct buffer_head *p_bh; +}; + +/* + * EXT_INIT_MAX_LEN is the maximum number of blocks we can have in an + * initialized extent. This is 2^15 and not (2^16 - 1), since we use the + * MSB of ee_len field in the extent datastructure to signify if this + * particular extent is an initialized extent or an uninitialized (i.e. + * preallocated). + * EXT_UNINIT_MAX_LEN is the maximum number of blocks we can have in an + * uninitialized extent. + * If ee_len is <= 0x8000, it is an initialized extent. Otherwise, it is an + * uninitialized one. In other words, if MSB of ee_len is set, it is an + * uninitialized extent with only one special scenario when ee_len = 0x8000. + * In this case we can not have an uninitialized extent of zero length and + * thus we make it as a special case of initialized extent with 0x8000 length. + * This way we get better extent-to-group alignment for initialized extents. + * Hence, the maximum number of blocks we can have in an *initialized* + * extent is 2^15 (32768) and in an *uninitialized* extent is 2^15-1 (32767). + */ +#define EXT_INIT_MAX_LEN (1UL << 15) +#define EXT_UNINIT_MAX_LEN (EXT_INIT_MAX_LEN - 1) + +#define EXT_FIRST_EXTENT(__hdr__) \ + ((struct ext3_extent *) (((char *) (__hdr__)) + \ + sizeof(struct ext3_extent_header))) +#define EXT_FIRST_INDEX(__hdr__) \ + ((struct ext3_extent_idx *) (((char *) (__hdr__)) + \ + sizeof(struct ext3_extent_header))) +#define EXT_HAS_FREE_INDEX(__path__) \ + ((__path__)->p_hdr->eh_entries < (__path__)->p_hdr->eh_max) +#define EXT_LAST_EXTENT(__hdr__) \ + (EXT_FIRST_EXTENT((__hdr__)) + (__hdr__)->eh_entries - 1) +#define EXT_LAST_INDEX(__hdr__) \ + (EXT_FIRST_INDEX((__hdr__)) + (__hdr__)->eh_entries - 1) +#define EXT_MAX_EXTENT(__hdr__) \ + (EXT_FIRST_EXTENT((__hdr__)) + (__hdr__)->eh_max - 1) +#define EXT_MAX_INDEX(__hdr__) \ + (EXT_FIRST_INDEX((__hdr__)) + (__hdr__)->eh_max - 1) + +#endif /* _LINUX_EXT3_EXTENTS */ + diff --git a/portlibs/sources/libext2fs/source/ext_attr.c b/portlibs/sources/libext2fs/source/ext_attr.c new file mode 100644 index 00000000..52664ebe --- /dev/null +++ b/portlibs/sources/libext2fs/source/ext_attr.c @@ -0,0 +1,155 @@ +/* + * ext_attr.c --- extended attribute blocks + * + * Copyright (C) 2001 Andreas Gruenbacher, <a.gruenbacher@computer.org> + * + * Copyright (C) 2002 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <string.h> +#include <time.h> + +#include "ext2_fs.h" +#include "ext2_ext_attr.h" + +#include "ext2fs.h" + +#define NAME_HASH_SHIFT 5 +#define VALUE_HASH_SHIFT 16 + +/* + * ext2_xattr_hash_entry() + * + * Compute the hash of an extended attribute. + */ +__u32 ext2fs_ext_attr_hash_entry(struct ext2_ext_attr_entry *entry, void *data) +{ + __u32 hash = 0; + char *name = ((char *) entry) + sizeof(struct ext2_ext_attr_entry); + int n; + + for (n = 0; n < entry->e_name_len; n++) { + hash = (hash << NAME_HASH_SHIFT) ^ + (hash >> (8*sizeof(hash) - NAME_HASH_SHIFT)) ^ + *name++; + } + + /* The hash needs to be calculated on the data in little-endian. */ + if (entry->e_value_block == 0 && entry->e_value_size != 0) { + __u32 *value = (__u32 *)data; + for (n = (entry->e_value_size + EXT2_EXT_ATTR_ROUND) >> + EXT2_EXT_ATTR_PAD_BITS; n; n--) { + hash = (hash << VALUE_HASH_SHIFT) ^ + (hash >> (8*sizeof(hash) - VALUE_HASH_SHIFT)) ^ + ext2fs_le32_to_cpu(*value++); + } + } + + return hash; +} + +#undef NAME_HASH_SHIFT +#undef VALUE_HASH_SHIFT + +errcode_t ext2fs_read_ext_attr2(ext2_filsys fs, blk64_t block, void *buf) +{ + errcode_t retval; + + retval = io_channel_read_blk64(fs->io, block, 1, buf); + if (retval) + return retval; +#ifdef WORDS_BIGENDIAN + ext2fs_swap_ext_attr(buf, buf, fs->blocksize, 1); +#endif + return 0; +} + +errcode_t ext2fs_read_ext_attr(ext2_filsys fs, blk_t block, void *buf) +{ + return ext2fs_read_ext_attr2(fs, block, buf); +} + +errcode_t ext2fs_write_ext_attr2(ext2_filsys fs, blk64_t block, void *inbuf) +{ + errcode_t retval; + char *write_buf; + char *buf = NULL; + +#ifdef WORDS_BIGENDIAN + retval = ext2fs_get_mem(fs->blocksize, &buf); + if (retval) + return retval; + write_buf = buf; + ext2fs_swap_ext_attr(buf, inbuf, fs->blocksize, 1); +#else + write_buf = (char *) inbuf; +#endif + retval = io_channel_write_blk64(fs->io, block, 1, write_buf); + if (buf) + ext2fs_free_mem(&buf); + if (!retval) + ext2fs_mark_changed(fs); + return retval; +} + +errcode_t ext2fs_write_ext_attr(ext2_filsys fs, blk_t block, void *inbuf) +{ + return ext2fs_write_ext_attr2(fs, block, inbuf); +} + +/* + * This function adjusts the reference count of the EA block. + */ +errcode_t ext2fs_adjust_ea_refcount2(ext2_filsys fs, blk64_t blk, + char *block_buf, int adjust, + __u32 *newcount) +{ + errcode_t retval; + struct ext2_ext_attr_header *header; + char *buf = 0; + + if ((blk >= ext2fs_blocks_count(fs->super)) || + (blk < fs->super->s_first_data_block)) + return EXT2_ET_BAD_EA_BLOCK_NUM; + + if (!block_buf) { + retval = ext2fs_get_mem(fs->blocksize, &buf); + if (retval) + return retval; + block_buf = buf; + } + + retval = ext2fs_read_ext_attr2(fs, blk, block_buf); + if (retval) + goto errout; + + header = (struct ext2_ext_attr_header *) block_buf; + header->h_refcount += adjust; + if (newcount) + *newcount = header->h_refcount; + + retval = ext2fs_write_ext_attr2(fs, blk, block_buf); + if (retval) + goto errout; + +errout: + if (buf) + ext2fs_free_mem(&buf); + return retval; +} + +errcode_t ext2fs_adjust_ea_refcount(ext2_filsys fs, blk_t blk, + char *block_buf, int adjust, + __u32 *newcount) +{ + return ext2fs_adjust_ea_refcount(fs, blk, block_buf, adjust, newcount); +} diff --git a/portlibs/sources/libext2fs/source/extent.c b/portlibs/sources/libext2fs/source/extent.c new file mode 100644 index 00000000..5e070925 --- /dev/null +++ b/portlibs/sources/libext2fs/source/extent.c @@ -0,0 +1,2007 @@ +/* + * extent.c --- routines to implement extents support + * + * Copyright (C) 2007 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fsP.h" +#include "e2image.h" + +/* + * Definitions to be dropped in lib/ext2fs/ext2fs.h + */ + +/* + * Private definitions + */ + +struct extent_path { + char *buf; + int entries; + int max_entries; + int left; + int visit_num; + int flags; + blk64_t end_blk; + void *curr; +}; + + +struct ext2_extent_handle { + errcode_t magic; + ext2_filsys fs; + ext2_ino_t ino; + struct ext2_inode *inode; + struct ext2_inode inodebuf; + int type; + int level; + int max_depth; + struct extent_path *path; +}; + +struct ext2_extent_path { + errcode_t magic; + int leaf_height; + blk64_t lblk; +}; + +/* + * Useful Debugging stuff + */ + +#ifdef DEBUG +static void dbg_show_header(struct ext3_extent_header *eh) +{ + printf("header: magic=%x entries=%u max=%u depth=%u generation=%u\n", + ext2fs_le16_to_cpu(eh->eh_magic), + ext2fs_le16_to_cpu(eh->eh_entries), + ext2fs_le16_to_cpu(eh->eh_max), + ext2fs_le16_to_cpu(eh->eh_depth), + ext2fs_le32_to_cpu(eh->eh_generation)); +} + +static void dbg_show_index(struct ext3_extent_idx *ix) +{ + printf("index: block=%u leaf=%u leaf_hi=%u unused=%u\n", + ext2fs_le32_to_cpu(ix->ei_block), + ext2fs_le32_to_cpu(ix->ei_leaf), + ext2fs_le16_to_cpu(ix->ei_leaf_hi), + ext2fs_le16_to_cpu(ix->ei_unused)); +} + +static void dbg_show_extent(struct ext3_extent *ex) +{ + printf("extent: block=%u-%u len=%u start=%u start_hi=%u\n", + ext2fs_le32_to_cpu(ex->ee_block), + ext2fs_le32_to_cpu(ex->ee_block) + + ext2fs_le16_to_cpu(ex->ee_len) - 1, + ext2fs_le16_to_cpu(ex->ee_len), + ext2fs_le32_to_cpu(ex->ee_start), + ext2fs_le16_to_cpu(ex->ee_start_hi)); +} + +static void dbg_print_extent(char *desc, struct ext2fs_extent *extent) +{ + if (desc) + printf("%s: ", desc); + printf("extent: lblk %llu--%llu, len %u, pblk %llu, flags: ", + extent->e_lblk, extent->e_lblk + extent->e_len - 1, + extent->e_len, extent->e_pblk); + if (extent->e_flags & EXT2_EXTENT_FLAGS_LEAF) + fputs("LEAF ", stdout); + if (extent->e_flags & EXT2_EXTENT_FLAGS_UNINIT) + fputs("UNINIT ", stdout); + if (extent->e_flags & EXT2_EXTENT_FLAGS_SECOND_VISIT) + fputs("2ND_VISIT ", stdout); + if (!extent->e_flags) + fputs("(none)", stdout); + fputc('\n', stdout); + +} + +#else +#define dbg_show_header(eh) do { } while (0) +#define dbg_show_index(ix) do { } while (0) +#define dbg_show_extent(ex) do { } while (0) +#define dbg_print_extent(desc, ex) do { } while (0) +#endif + +/* + * Verify the extent header as being sane + */ +errcode_t ext2fs_extent_header_verify(void *ptr, int size) +{ + int eh_max, entry_size; + struct ext3_extent_header *eh = ptr; + + dbg_show_header(eh); + if (ext2fs_le16_to_cpu(eh->eh_magic) != EXT3_EXT_MAGIC) + return EXT2_ET_EXTENT_HEADER_BAD; + if (ext2fs_le16_to_cpu(eh->eh_entries) > ext2fs_le16_to_cpu(eh->eh_max)) + return EXT2_ET_EXTENT_HEADER_BAD; + if (eh->eh_depth == 0) + entry_size = sizeof(struct ext3_extent); + else + entry_size = sizeof(struct ext3_extent_idx); + + eh_max = (size - sizeof(*eh)) / entry_size; + /* Allow two extent-sized items at the end of the block, for + * ext4_extent_tail with checksum in the future. */ + if ((ext2fs_le16_to_cpu(eh->eh_max) > eh_max) || + (ext2fs_le16_to_cpu(eh->eh_max) < (eh_max - 2))) + return EXT2_ET_EXTENT_HEADER_BAD; + + return 0; +} + + +/* + * Begin functions to handle an inode's extent information + */ +extern void ext2fs_extent_free(ext2_extent_handle_t handle) +{ + int i; + + if (!handle) + return; + + if (handle->path) { + for (i=1; i <= handle->max_depth; i++) { + if (handle->path[i].buf) + ext2fs_free_mem(&handle->path[i].buf); + } + ext2fs_free_mem(&handle->path); + } + ext2fs_free_mem(&handle); +} + +extern errcode_t ext2fs_extent_open(ext2_filsys fs, ext2_ino_t ino, + ext2_extent_handle_t *ret_handle) +{ + return ext2fs_extent_open2(fs, ino, NULL, ret_handle); +} + +extern errcode_t ext2fs_extent_open2(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + ext2_extent_handle_t *ret_handle) +{ + struct ext2_extent_handle *handle; + errcode_t retval; + int i; + struct ext3_extent_header *eh; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!inode) + if ((ino == 0) || (ino > fs->super->s_inodes_count)) + return EXT2_ET_BAD_INODE_NUM; + + retval = ext2fs_get_mem(sizeof(struct ext2_extent_handle), &handle); + if (retval) + return retval; + memset(handle, 0, sizeof(struct ext2_extent_handle)); + + handle->ino = ino; + handle->fs = fs; + + if (inode) { + handle->inode = inode; + } else { + handle->inode = &handle->inodebuf; + retval = ext2fs_read_inode(fs, ino, handle->inode); + if (retval) + goto errout; + } + + eh = (struct ext3_extent_header *) &handle->inode->i_block[0]; + + for (i=0; i < EXT2_N_BLOCKS; i++) + if (handle->inode->i_block[i]) + break; + if (i >= EXT2_N_BLOCKS) { + eh->eh_magic = ext2fs_cpu_to_le16(EXT3_EXT_MAGIC); + eh->eh_depth = 0; + eh->eh_entries = 0; + i = (sizeof(handle->inode->i_block) - sizeof(*eh)) / + sizeof(struct ext3_extent); + eh->eh_max = ext2fs_cpu_to_le16(i); + handle->inode->i_flags |= EXT4_EXTENTS_FL; + } + + if (!(handle->inode->i_flags & EXT4_EXTENTS_FL)) { + retval = EXT2_ET_INODE_NOT_EXTENT; + goto errout; + } + + retval = ext2fs_extent_header_verify(eh, sizeof(handle->inode->i_block)); + if (retval) + goto errout; + + handle->max_depth = ext2fs_le16_to_cpu(eh->eh_depth); + handle->type = ext2fs_le16_to_cpu(eh->eh_magic); + + retval = ext2fs_get_mem(((handle->max_depth+1) * + sizeof(struct extent_path)), + &handle->path); + memset(handle->path, 0, + (handle->max_depth+1) * sizeof(struct extent_path)); + handle->path[0].buf = (char *) handle->inode->i_block; + + handle->path[0].left = handle->path[0].entries = + ext2fs_le16_to_cpu(eh->eh_entries); + handle->path[0].max_entries = ext2fs_le16_to_cpu(eh->eh_max); + handle->path[0].curr = 0; + handle->path[0].end_blk = + ((((__u64) handle->inode->i_size_high << 32) + + handle->inode->i_size + (fs->blocksize - 1)) + >> EXT2_BLOCK_SIZE_BITS(fs->super)); + handle->path[0].visit_num = 1; + handle->level = 0; + handle->magic = EXT2_ET_MAGIC_EXTENT_HANDLE; + + *ret_handle = handle; + return 0; + +errout: + ext2fs_extent_free(handle); + return retval; +} + +/* + * This function is responsible for (optionally) moving through the + * extent tree and then returning the current extent + */ +errcode_t ext2fs_extent_get(ext2_extent_handle_t handle, + int flags, struct ext2fs_extent *extent) +{ + struct extent_path *path, *newpath; + struct ext3_extent_header *eh; + struct ext3_extent_idx *ix = 0; + struct ext3_extent *ex; + errcode_t retval; + blk64_t blk; + blk64_t end_blk; + int orig_op, op; + + EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE); + + if (!handle->path) + return EXT2_ET_NO_CURRENT_NODE; + + orig_op = op = flags & EXT2_EXTENT_MOVE_MASK; + +retry: + path = handle->path + handle->level; + if ((orig_op == EXT2_EXTENT_NEXT) || + (orig_op == EXT2_EXTENT_NEXT_LEAF)) { + if (handle->level < handle->max_depth) { + /* interior node */ + if (path->visit_num == 0) { + path->visit_num++; + op = EXT2_EXTENT_DOWN; + } else if (path->left > 0) + op = EXT2_EXTENT_NEXT_SIB; + else if (handle->level > 0) + op = EXT2_EXTENT_UP; + else + return EXT2_ET_EXTENT_NO_NEXT; + } else { + /* leaf node */ + if (path->left > 0) + op = EXT2_EXTENT_NEXT_SIB; + else if (handle->level > 0) + op = EXT2_EXTENT_UP; + else + return EXT2_ET_EXTENT_NO_NEXT; + } + if (op != EXT2_EXTENT_NEXT_SIB) { +#ifdef DEBUG_GET_EXTENT + printf("<<<< OP = %s\n", + (op == EXT2_EXTENT_DOWN) ? "down" : + ((op == EXT2_EXTENT_UP) ? "up" : "unknown")); +#endif + } + } + + if ((orig_op == EXT2_EXTENT_PREV) || + (orig_op == EXT2_EXTENT_PREV_LEAF)) { + if (handle->level < handle->max_depth) { + /* interior node */ + if (path->visit_num > 0 ) { + /* path->visit_num = 0; */ + op = EXT2_EXTENT_DOWN_AND_LAST; + } else if (path->left < path->entries-1) + op = EXT2_EXTENT_PREV_SIB; + else if (handle->level > 0) + op = EXT2_EXTENT_UP; + else + return EXT2_ET_EXTENT_NO_PREV; + } else { + /* leaf node */ + if (path->left < path->entries-1) + op = EXT2_EXTENT_PREV_SIB; + else if (handle->level > 0) + op = EXT2_EXTENT_UP; + else + return EXT2_ET_EXTENT_NO_PREV; + } + if (op != EXT2_EXTENT_PREV_SIB) { +#ifdef DEBUG_GET_EXTENT + printf("<<<< OP = %s\n", + (op == EXT2_EXTENT_DOWN_AND_LAST) ? "down/last" : + ((op == EXT2_EXTENT_UP) ? "up" : "unknown")); +#endif + } + } + + if (orig_op == EXT2_EXTENT_LAST_LEAF) { + if ((handle->level < handle->max_depth) && + (path->left == 0)) + op = EXT2_EXTENT_DOWN; + else + op = EXT2_EXTENT_LAST_SIB; +#ifdef DEBUG_GET_EXTENT + printf("<<<< OP = %s\n", + (op == EXT2_EXTENT_DOWN) ? "down" : "last_sib"); +#endif + } + + switch (op) { + case EXT2_EXTENT_CURRENT: + ix = path->curr; + break; + case EXT2_EXTENT_ROOT: + handle->level = 0; + path = handle->path + handle->level; + case EXT2_EXTENT_FIRST_SIB: + path->left = path->entries; + path->curr = 0; + case EXT2_EXTENT_NEXT_SIB: + if (path->left <= 0) + return EXT2_ET_EXTENT_NO_NEXT; + if (path->curr) { + ix = path->curr; + ix++; + } else { + eh = (struct ext3_extent_header *) path->buf; + ix = EXT_FIRST_INDEX(eh); + } + path->left--; + path->curr = ix; + path->visit_num = 0; + break; + case EXT2_EXTENT_PREV_SIB: + if (!path->curr || + path->left+1 >= path->entries) + return EXT2_ET_EXTENT_NO_PREV; + ix = path->curr; + ix--; + path->curr = ix; + path->left++; + if (handle->level < handle->max_depth) + path->visit_num = 1; + break; + case EXT2_EXTENT_LAST_SIB: + eh = (struct ext3_extent_header *) path->buf; + path->curr = EXT_LAST_EXTENT(eh); + ix = path->curr; + path->left = 0; + path->visit_num = 0; + break; + case EXT2_EXTENT_UP: + if (handle->level <= 0) + return EXT2_ET_EXTENT_NO_UP; + handle->level--; + path--; + ix = path->curr; + if ((orig_op == EXT2_EXTENT_PREV) || + (orig_op == EXT2_EXTENT_PREV_LEAF)) + path->visit_num = 0; + break; + case EXT2_EXTENT_DOWN: + case EXT2_EXTENT_DOWN_AND_LAST: + if (!path->curr ||(handle->level >= handle->max_depth)) + return EXT2_ET_EXTENT_NO_DOWN; + + ix = path->curr; + newpath = path + 1; + if (!newpath->buf) { + retval = ext2fs_get_mem(handle->fs->blocksize, + &newpath->buf); + if (retval) + return retval; + } + blk = ext2fs_le32_to_cpu(ix->ei_leaf) + + ((__u64) ext2fs_le16_to_cpu(ix->ei_leaf_hi) << 32); + if ((handle->fs->flags & EXT2_FLAG_IMAGE_FILE) && + (handle->fs->io != handle->fs->image_io)) + memset(newpath->buf, 0, handle->fs->blocksize); + else { + retval = io_channel_read_blk64(handle->fs->io, + blk, 1, newpath->buf); + if (retval) + return retval; + } + handle->level++; + + eh = (struct ext3_extent_header *) newpath->buf; + + retval = ext2fs_extent_header_verify(eh, handle->fs->blocksize); + if (retval) { + handle->level--; + return retval; + } + + newpath->left = newpath->entries = + ext2fs_le16_to_cpu(eh->eh_entries); + newpath->max_entries = ext2fs_le16_to_cpu(eh->eh_max); + + if (path->left > 0) { + ix++; + newpath->end_blk = ext2fs_le32_to_cpu(ix->ei_block); + } else + newpath->end_blk = path->end_blk; + + path = newpath; + if (op == EXT2_EXTENT_DOWN) { + ix = EXT_FIRST_INDEX((struct ext3_extent_header *) eh); + path->curr = ix; + path->left = path->entries - 1; + path->visit_num = 0; + } else { + ix = EXT_LAST_INDEX((struct ext3_extent_header *) eh); + path->curr = ix; + path->left = 0; + if (handle->level < handle->max_depth) + path->visit_num = 1; + } +#ifdef DEBUG_GET_EXTENT + printf("Down to level %d/%d, end_blk=%llu\n", + handle->level, handle->max_depth, + path->end_blk); +#endif + break; + default: + return EXT2_ET_OP_NOT_SUPPORTED; + } + + if (!ix) + return EXT2_ET_NO_CURRENT_NODE; + + extent->e_flags = 0; +#ifdef DEBUG_GET_EXTENT + printf("(Left %d)\n", path->left); +#endif + + if (handle->level == handle->max_depth) { + ex = (struct ext3_extent *) ix; + + extent->e_pblk = ext2fs_le32_to_cpu(ex->ee_start) + + ((__u64) ext2fs_le16_to_cpu(ex->ee_start_hi) << 32); + extent->e_lblk = ext2fs_le32_to_cpu(ex->ee_block); + extent->e_len = ext2fs_le16_to_cpu(ex->ee_len); + extent->e_flags |= EXT2_EXTENT_FLAGS_LEAF; + if (extent->e_len > EXT_INIT_MAX_LEN) { + extent->e_len -= EXT_INIT_MAX_LEN; + extent->e_flags |= EXT2_EXTENT_FLAGS_UNINIT; + } + } else { + extent->e_pblk = ext2fs_le32_to_cpu(ix->ei_leaf) + + ((__u64) ext2fs_le16_to_cpu(ix->ei_leaf_hi) << 32); + extent->e_lblk = ext2fs_le32_to_cpu(ix->ei_block); + if (path->left > 0) { + ix++; + end_blk = ext2fs_le32_to_cpu(ix->ei_block); + } else + end_blk = path->end_blk; + + extent->e_len = end_blk - extent->e_lblk; + } + if (path->visit_num) + extent->e_flags |= EXT2_EXTENT_FLAGS_SECOND_VISIT; + + if (((orig_op == EXT2_EXTENT_NEXT_LEAF) || + (orig_op == EXT2_EXTENT_PREV_LEAF)) && + (handle->level != handle->max_depth)) + goto retry; + + if ((orig_op == EXT2_EXTENT_LAST_LEAF) && + ((handle->level != handle->max_depth) || + (path->left != 0))) + goto retry; + + return 0; +} + +static errcode_t update_path(ext2_extent_handle_t handle) +{ + blk64_t blk; + errcode_t retval; + struct ext3_extent_idx *ix; + + if (handle->level == 0) { + retval = ext2fs_write_inode(handle->fs, handle->ino, + handle->inode); + } else { + ix = handle->path[handle->level - 1].curr; + blk = ext2fs_le32_to_cpu(ix->ei_leaf) + + ((__u64) ext2fs_le16_to_cpu(ix->ei_leaf_hi) << 32); + + retval = io_channel_write_blk64(handle->fs->io, + blk, 1, handle->path[handle->level].buf); + } + return retval; +} + +#if 0 +errcode_t ext2fs_extent_save_path(ext2_extent_handle_t handle, + ext2_extent_path_t *ret_path) +{ + ext2_extent_path_t save_path; + struct ext2fs_extent extent; + struct ext2_extent_info info; + errcode_t retval; + + retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent); + if (retval) + return retval; + + retval = ext2fs_extent_get_info(handle, &info); + if (retval) + return retval; + + retval = ext2fs_get_mem(sizeof(struct ext2_extent_path), &save_path); + if (retval) + return retval; + memset(save_path, 0, sizeof(struct ext2_extent_path)); + + save_path->magic = EXT2_ET_MAGIC_EXTENT_PATH; + save_path->leaf_height = info.max_depth - info.curr_level - 1; + save_path->lblk = extent.e_lblk; + + *ret_path = save_path; + return 0; +} + +errcode_t ext2fs_extent_free_path(ext2_extent_path_t path) +{ + EXT2_CHECK_MAGIC(path, EXT2_ET_MAGIC_EXTENT_PATH); + + ext2fs_free_mem(&path); + return 0; +} +#endif + +/* + * Go to the node at leaf_level which contains logical block blk. + * + * leaf_level is height from the leaf node level, i.e. + * leaf_level 0 is at leaf node, leaf_level 1 is 1 above etc. + * + * If "blk" has no mapping (hole) then handle is left at last + * extent before blk. + */ +static errcode_t extent_goto(ext2_extent_handle_t handle, + int leaf_level, blk64_t blk) +{ + struct ext2fs_extent extent; + errcode_t retval; + + retval = ext2fs_extent_get(handle, EXT2_EXTENT_ROOT, &extent); + if (retval) { + if (retval == EXT2_ET_EXTENT_NO_NEXT) + retval = EXT2_ET_EXTENT_NOT_FOUND; + return retval; + } + + if (leaf_level > handle->max_depth) { +#ifdef DEBUG + printf("leaf level %d greater than tree depth %d\n", + leaf_level, handle->max_depth); +#endif + return EXT2_ET_OP_NOT_SUPPORTED; + } + +#ifdef DEBUG + printf("goto extent ino %u, level %d, %llu\n", handle->ino, + leaf_level, blk); +#endif + +#ifdef DEBUG_GOTO_EXTENTS + dbg_print_extent("root", &extent); +#endif + while (1) { + if (handle->max_depth - handle->level == leaf_level) { + /* block is in this &extent */ + if ((blk >= extent.e_lblk) && + (blk < extent.e_lblk + extent.e_len)) + return 0; + if (blk < extent.e_lblk) { + retval = ext2fs_extent_get(handle, + EXT2_EXTENT_PREV_SIB, + &extent); + return EXT2_ET_EXTENT_NOT_FOUND; + } + retval = ext2fs_extent_get(handle, + EXT2_EXTENT_NEXT_SIB, + &extent); + if (retval == EXT2_ET_EXTENT_NO_NEXT) + return EXT2_ET_EXTENT_NOT_FOUND; + if (retval) + return retval; + continue; + } + + retval = ext2fs_extent_get(handle, EXT2_EXTENT_NEXT_SIB, + &extent); + if (retval == EXT2_ET_EXTENT_NO_NEXT) + goto go_down; + if (retval) + return retval; + +#ifdef DEBUG_GOTO_EXTENTS + dbg_print_extent("next", &extent); +#endif + if (blk == extent.e_lblk) + goto go_down; + if (blk > extent.e_lblk) + continue; + + retval = ext2fs_extent_get(handle, EXT2_EXTENT_PREV_SIB, + &extent); + if (retval) + return retval; + +#ifdef DEBUG_GOTO_EXTENTS + dbg_print_extent("prev", &extent); +#endif + + go_down: + retval = ext2fs_extent_get(handle, EXT2_EXTENT_DOWN, + &extent); + if (retval) + return retval; + +#ifdef DEBUG_GOTO_EXTENTS + dbg_print_extent("down", &extent); +#endif + } +} + +errcode_t ext2fs_extent_goto(ext2_extent_handle_t handle, + blk64_t blk) +{ + return extent_goto(handle, 0, blk); +} + +/* + * Traverse back up to root fixing parents of current node as needed. + * + * If we changed start of first entry in a node, fix parent index start + * and so on. + * + * Safe to call for any position in node; if not at the first entry, + * will simply return. + */ +static errcode_t ext2fs_extent_fix_parents(ext2_extent_handle_t handle) +{ + int retval = 0; + blk64_t start; + struct extent_path *path; + struct ext2fs_extent extent; + + EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE); + + if (!(handle->fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + if (!handle->path) + return EXT2_ET_NO_CURRENT_NODE; + + path = handle->path + handle->level; + if (!path->curr) + return EXT2_ET_NO_CURRENT_NODE; + + retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent); + if (retval) + goto done; + + /* modified node's start block */ + start = extent.e_lblk; + + /* traverse up until index not first, or startblk matches, or top */ + while (handle->level > 0 && + (path->left == path->entries - 1)) { + retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP, &extent); + if (retval) + goto done; + if (extent.e_lblk == start) + break; + path = handle->path + handle->level; + extent.e_len += (extent.e_lblk - start); + extent.e_lblk = start; + retval = ext2fs_extent_replace(handle, 0, &extent); + if (retval) + goto done; + update_path(handle); + } + + /* put handle back to where we started */ + retval = ext2fs_extent_goto(handle, start); +done: + return retval; +} + +errcode_t ext2fs_extent_replace(ext2_extent_handle_t handle, + int flags EXT2FS_ATTR((unused)), + struct ext2fs_extent *extent) +{ + struct extent_path *path; + struct ext3_extent_idx *ix; + struct ext3_extent *ex; + + EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE); + + if (!(handle->fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + if (!handle->path) + return EXT2_ET_NO_CURRENT_NODE; + + path = handle->path + handle->level; + if (!path->curr) + return EXT2_ET_NO_CURRENT_NODE; + +#ifdef DEBUG + printf("extent replace: %u ", handle->ino); + dbg_print_extent(0, extent); +#endif + + if (handle->level == handle->max_depth) { + ex = path->curr; + + ex->ee_block = ext2fs_cpu_to_le32(extent->e_lblk); + ex->ee_start = ext2fs_cpu_to_le32(extent->e_pblk & 0xFFFFFFFF); + ex->ee_start_hi = ext2fs_cpu_to_le16(extent->e_pblk >> 32); + if (extent->e_flags & EXT2_EXTENT_FLAGS_UNINIT) { + if (extent->e_len > EXT_UNINIT_MAX_LEN) + return EXT2_ET_EXTENT_INVALID_LENGTH; + ex->ee_len = ext2fs_cpu_to_le16(extent->e_len + + EXT_INIT_MAX_LEN); + } else { + if (extent->e_len > EXT_INIT_MAX_LEN) + return EXT2_ET_EXTENT_INVALID_LENGTH; + ex->ee_len = ext2fs_cpu_to_le16(extent->e_len); + } + } else { + ix = path->curr; + + ix->ei_leaf = ext2fs_cpu_to_le32(extent->e_pblk & 0xFFFFFFFF); + ix->ei_leaf_hi = ext2fs_cpu_to_le16(extent->e_pblk >> 32); + ix->ei_block = ext2fs_cpu_to_le32(extent->e_lblk); + ix->ei_unused = 0; + } + update_path(handle); + return 0; +} + +/* + * allocate a new block, move half the current node to it, and update parent + * + * handle will be left pointing at original record. + */ +static errcode_t extent_node_split(ext2_extent_handle_t handle) +{ + errcode_t retval = 0; + blk64_t new_node_pblk; + blk64_t new_node_start; + blk64_t orig_lblk; + blk64_t goal_blk = 0; + int orig_height; + char *block_buf = NULL; + struct ext2fs_extent extent; + struct extent_path *path, *newpath = 0; + struct ext3_extent_header *eh, *neweh; + int tocopy; + int new_root = 0; + struct ext2_extent_info info; + + /* basic sanity */ + EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE); + + if (!(handle->fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + if (!handle->path) + return EXT2_ET_NO_CURRENT_NODE; + +#ifdef DEBUG + printf("splitting node at level %d\n", handle->level); +#endif + retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent); + if (retval) + goto done; + + retval = ext2fs_extent_get_info(handle, &info); + if (retval) + goto done; + + /* save the position we were originally splitting... */ + orig_height = info.max_depth - info.curr_level; + orig_lblk = extent.e_lblk; + + /* Is there room in the parent for a new entry? */ + if (handle->level && + (handle->path[handle->level - 1].entries >= + handle->path[handle->level - 1].max_entries)) { + +#ifdef DEBUG + printf("parent level %d full; splitting it too\n", + handle->level - 1); +#endif + /* split the parent */ + retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP, &extent); + if (retval) + goto done; + goal_blk = extent.e_pblk; + + retval = extent_node_split(handle); + if (retval) + goto done; + + /* get handle back to our original split position */ + retval = extent_goto(handle, orig_height, orig_lblk); + if (retval) + goto done; + } + + /* At this point, parent should have room for this split */ + path = handle->path + handle->level; + if (!path->curr) + return EXT2_ET_NO_CURRENT_NODE; + + /* extent header of the current node we'll split */ + eh = (struct ext3_extent_header *)path->buf; + + /* splitting root level means moving them all out */ + if (handle->level == 0) { + new_root = 1; + tocopy = ext2fs_le16_to_cpu(eh->eh_entries); + retval = ext2fs_get_mem(((handle->max_depth+2) * + sizeof(struct extent_path)), + &newpath); + if (retval) + goto done; + memset(newpath, 0, + ((handle->max_depth+2) * sizeof(struct extent_path))); + } else { + tocopy = ext2fs_le16_to_cpu(eh->eh_entries) / 2; + } + +#ifdef DEBUG + printf("will copy out %d of %d entries at level %d\n", + tocopy, ext2fs_le16_to_cpu(eh->eh_entries), + handle->level); +#endif + + if (!tocopy) { +#ifdef DEBUG + printf("Nothing to copy to new block!\n"); +#endif + retval = EXT2_ET_CANT_SPLIT_EXTENT; + goto done; + } + + /* first we need a new block, or can do nothing. */ + block_buf = malloc(handle->fs->blocksize); + if (!block_buf) { + retval = ENOMEM; + goto done; + } + + if (!goal_blk) { + dgrp_t group = ext2fs_group_of_ino(handle->fs, handle->ino); + __u8 log_flex = handle->fs->super->s_log_groups_per_flex; + + if (log_flex) + group = group & ~((1 << (log_flex)) - 1); + goal_blk = (group * handle->fs->super->s_blocks_per_group) + + handle->fs->super->s_first_data_block; + } + retval = ext2fs_alloc_block2(handle->fs, goal_blk, block_buf, + &new_node_pblk); + if (retval) + goto done; + +#ifdef DEBUG + printf("will copy to new node at block %lu\n", + (unsigned long) new_node_pblk); +#endif + + /* Copy data into new block buffer */ + /* First the header for the new block... */ + neweh = (struct ext3_extent_header *) block_buf; + memcpy(neweh, eh, sizeof(struct ext3_extent_header)); + neweh->eh_entries = ext2fs_cpu_to_le16(tocopy); + neweh->eh_max = ext2fs_cpu_to_le16((handle->fs->blocksize - + sizeof(struct ext3_extent_header)) / + sizeof(struct ext3_extent)); + + /* then the entries for the new block... */ + memcpy(EXT_FIRST_INDEX(neweh), + EXT_FIRST_INDEX(eh) + + (ext2fs_le16_to_cpu(eh->eh_entries) - tocopy), + sizeof(struct ext3_extent_idx) * tocopy); + + new_node_start = ext2fs_le32_to_cpu(EXT_FIRST_INDEX(neweh)->ei_block); + + /* ...and write the new node block out to disk. */ + retval = io_channel_write_blk64(handle->fs->io, new_node_pblk, 1, + block_buf); + + if (retval) + goto done; + + /* OK! we've created the new node; now adjust the tree */ + + /* current path now has fewer active entries, we copied some out */ + if (handle->level == 0) { + memcpy(newpath, path, + sizeof(struct extent_path) * (handle->max_depth+1)); + handle->path = newpath; + newpath = path; + path = handle->path; + path->entries = 1; + path->left = path->max_entries - 1; + handle->max_depth++; + eh->eh_depth = ext2fs_cpu_to_le16(handle->max_depth); + } else { + path->entries -= tocopy; + path->left -= tocopy; + } + + eh->eh_entries = ext2fs_cpu_to_le16(path->entries); + /* this writes out the node, incl. the modified header */ + retval = update_path(handle); + if (retval) + goto done; + + /* now go up and insert/replace index for new node we created */ + if (new_root) { + retval = ext2fs_extent_get(handle, EXT2_EXTENT_FIRST_SIB, &extent); + if (retval) + goto done; + + extent.e_lblk = new_node_start; + extent.e_pblk = new_node_pblk; + extent.e_len = handle->path[0].end_blk - extent.e_lblk; + retval = ext2fs_extent_replace(handle, 0, &extent); + if (retval) + goto done; + } else { + __u32 new_node_length; + + retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP, &extent); + /* will insert after this one; it's length is shorter now */ + new_node_length = new_node_start - extent.e_lblk; + extent.e_len -= new_node_length; + retval = ext2fs_extent_replace(handle, 0, &extent); + if (retval) + goto done; + + /* now set up the new extent and insert it */ + extent.e_lblk = new_node_start; + extent.e_pblk = new_node_pblk; + extent.e_len = new_node_length; + retval = ext2fs_extent_insert(handle, EXT2_EXTENT_INSERT_AFTER, &extent); + if (retval) + goto done; + } + + /* get handle back to our original position */ + retval = extent_goto(handle, orig_height, orig_lblk); + if (retval) + goto done; + + /* new node hooked in, so update inode block count (do this here?) */ + handle->inode->i_blocks += handle->fs->blocksize / 512; + retval = ext2fs_write_inode(handle->fs, handle->ino, + handle->inode); + if (retval) + goto done; + +done: + if (newpath) + ext2fs_free_mem(&newpath); + free(block_buf); + + return retval; +} + +errcode_t ext2fs_extent_insert(ext2_extent_handle_t handle, int flags, + struct ext2fs_extent *extent) +{ + struct extent_path *path; + struct ext3_extent_idx *ix; + struct ext3_extent_header *eh; + errcode_t retval; + + EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE); + + if (!(handle->fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + if (!handle->path) + return EXT2_ET_NO_CURRENT_NODE; + +#ifdef DEBUG + printf("extent insert: %u ", handle->ino); + dbg_print_extent(0, extent); +#endif + + path = handle->path + handle->level; + + if (path->entries >= path->max_entries) { + if (flags & EXT2_EXTENT_INSERT_NOSPLIT) { + return EXT2_ET_CANT_INSERT_EXTENT; + } else { +#ifdef DEBUG + printf("node full (level %d) - splitting\n", + handle->level); +#endif + retval = extent_node_split(handle); + if (retval) + return retval; + path = handle->path + handle->level; + } + } + + eh = (struct ext3_extent_header *) path->buf; + if (path->curr) { + ix = path->curr; + if (flags & EXT2_EXTENT_INSERT_AFTER) { + ix++; + path->left--; + } + } else + ix = EXT_FIRST_INDEX(eh); + + path->curr = ix; + + if (path->left >= 0) + memmove(ix + 1, ix, + (path->left+1) * sizeof(struct ext3_extent_idx)); + path->left++; + path->entries++; + + eh = (struct ext3_extent_header *) path->buf; + eh->eh_entries = ext2fs_cpu_to_le16(path->entries); + + retval = ext2fs_extent_replace(handle, 0, extent); + if (retval) + goto errout; + + retval = update_path(handle); + if (retval) + goto errout; + + return 0; + +errout: + ext2fs_extent_delete(handle, 0); + return retval; +} + +/* + * Sets the physical block for a logical file block in the extent tree. + * + * May: map unmapped, unmap mapped, or remap mapped blocks. + * + * Mapping an unmapped block adds a single-block extent. + * + * Unmapping first or last block modifies extent in-place + * - But may need to fix parent's starts too in first-block case + * + * Mapping any unmapped block requires adding a (single-block) extent + * and inserting into proper point in tree. + * + * Modifying (unmapping or remapping) a block in the middle + * of an extent requires splitting the extent. + * - Remapping case requires new single-block extent. + * + * Remapping first or last block adds an extent. + * + * We really need extent adding to be smart about merging. + */ + +errcode_t ext2fs_extent_set_bmap(ext2_extent_handle_t handle, + blk64_t logical, blk64_t physical, int flags) +{ + errcode_t ec, retval = 0; + int mapped = 1; /* logical is mapped? */ + int orig_height; + int extent_uninit = 0; + int prev_uninit = 0; + int next_uninit = 0; + int new_uninit = 0; + int max_len = EXT_INIT_MAX_LEN; + int has_prev, has_next; + blk64_t orig_lblk; + struct extent_path *path; + struct ext2fs_extent extent, next_extent, prev_extent; + struct ext2fs_extent newextent; + struct ext2_extent_info info; + + EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE); + +#ifdef DEBUG + printf("set_bmap ino %u log %lld phys %lld flags %d\n", + handle->ino, logical, physical, flags); +#endif + + if (!(handle->fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + if (!handle->path) + return EXT2_ET_NO_CURRENT_NODE; + + path = handle->path + handle->level; + + if (flags & EXT2_EXTENT_SET_BMAP_UNINIT) { + new_uninit = 1; + max_len = EXT_UNINIT_MAX_LEN; + } + + /* if (re)mapping, set up new extent to insert */ + if (physical) { + newextent.e_len = 1; + newextent.e_pblk = physical; + newextent.e_lblk = logical; + newextent.e_flags = EXT2_EXTENT_FLAGS_LEAF; + if (new_uninit) + newextent.e_flags |= EXT2_EXTENT_FLAGS_UNINIT; + } + + /* special case if the extent tree is completely empty */ + if ((handle->max_depth == 0) && (path->entries == 0)) { + retval = ext2fs_extent_insert(handle, 0, &newextent); + return retval; + } + + /* save our original location in the extent tree */ + if ((retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, + &extent))) { + if (retval != EXT2_ET_NO_CURRENT_NODE) + return retval; + memset(&extent, 0, sizeof(extent)); + } + if ((retval = ext2fs_extent_get_info(handle, &info))) + return retval; + orig_height = info.max_depth - info.curr_level; + orig_lblk = extent.e_lblk; + + /* go to the logical spot we want to (re/un)map */ + retval = ext2fs_extent_goto(handle, logical); + if (retval) { + if (retval == EXT2_ET_EXTENT_NOT_FOUND) { + retval = 0; + mapped = 0; + if (!physical) { +#ifdef DEBUG + printf("block %llu already unmapped\n", + logical); +#endif + goto done; + } + } else + goto done; + } + + /* + * This may be the extent *before* the requested logical, + * if it's currently unmapped. + * + * Get the previous and next leaf extents, if they are present. + */ + retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent); + if (retval) + goto done; + if (extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT) + extent_uninit = 1; + retval = ext2fs_extent_get(handle, EXT2_EXTENT_NEXT_LEAF, &next_extent); + if (retval) { + has_next = 0; + if (retval != EXT2_ET_EXTENT_NO_NEXT) + goto done; + } else { + dbg_print_extent("set_bmap: next_extent", + &next_extent); + has_next = 1; + if (next_extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT) + next_uninit = 1; + } + retval = ext2fs_extent_goto(handle, logical); + if (retval && retval != EXT2_ET_EXTENT_NOT_FOUND) + goto done; + retval = ext2fs_extent_get(handle, EXT2_EXTENT_PREV_LEAF, &prev_extent); + if (retval) { + has_prev = 0; + if (retval != EXT2_ET_EXTENT_NO_PREV) + goto done; + } else { + has_prev = 1; + dbg_print_extent("set_bmap: prev_extent", + &prev_extent); + if (prev_extent.e_flags & EXT2_EXTENT_FLAGS_UNINIT) + prev_uninit = 1; + } + retval = ext2fs_extent_goto(handle, logical); + if (retval && retval != EXT2_ET_EXTENT_NOT_FOUND) + goto done; + + /* check if already pointing to the requested physical */ + if (mapped && (new_uninit == extent_uninit) && + (extent.e_pblk + (logical - extent.e_lblk) == physical)) { +#ifdef DEBUG + printf("physical block (at %llu) unchanged\n", logical); +#endif + goto done; + } + + if (!mapped) { +#ifdef DEBUG + printf("mapping unmapped logical block %llu\n", logical); +#endif + if ((logical == extent.e_lblk + extent.e_len) && + (physical == extent.e_pblk + extent.e_len) && + (new_uninit == extent_uninit) && + ((int) extent.e_len < max_len-1)) { + extent.e_len++; + retval = ext2fs_extent_replace(handle, 0, &extent); + } else if ((logical == extent.e_lblk - 1) && + (physical == extent.e_pblk - 1) && + (new_uninit == extent_uninit) && + ((int) extent.e_len < max_len - 1)) { + extent.e_len++; + extent.e_lblk--; + extent.e_pblk--; + retval = ext2fs_extent_replace(handle, 0, &extent); + } else if (has_next && + (logical == next_extent.e_lblk - 1) && + (physical == next_extent.e_pblk - 1) && + (new_uninit == next_uninit) && + ((int) next_extent.e_len < max_len - 1)) { + retval = ext2fs_extent_get(handle, + EXT2_EXTENT_NEXT_LEAF, + &next_extent); + if (retval) + goto done; + next_extent.e_len++; + next_extent.e_lblk--; + next_extent.e_pblk--; + retval = ext2fs_extent_replace(handle, 0, &next_extent); + } else if (logical < extent.e_lblk) + retval = ext2fs_extent_insert(handle, 0, &newextent); + else + retval = ext2fs_extent_insert(handle, + EXT2_EXTENT_INSERT_AFTER, &newextent); + if (retval) + goto done; + retval = ext2fs_extent_fix_parents(handle); + if (retval) + goto done; + } else if ((logical == extent.e_lblk) && (extent.e_len == 1)) { +#ifdef DEBUG + printf("(re/un)mapping only block in extent\n"); +#endif + if (physical) { + retval = ext2fs_extent_replace(handle, 0, &newextent); + } else { + retval = ext2fs_extent_delete(handle, 0); + if (retval) + goto done; + ec = ext2fs_extent_fix_parents(handle); + if (ec != EXT2_ET_NO_CURRENT_NODE) + retval = ec; + } + + if (retval) + goto done; + } else if (logical == extent.e_lblk + extent.e_len - 1) { +#ifdef DEBUG + printf("(re/un)mapping last block in extent\n"); +#endif + if (physical) { + if (has_next && + (logical == (next_extent.e_lblk - 1)) && + (physical == (next_extent.e_pblk - 1)) && + (new_uninit == next_uninit) && + ((int) next_extent.e_len < max_len - 1)) { + retval = ext2fs_extent_get(handle, + EXT2_EXTENT_NEXT_LEAF, &next_extent); + if (retval) + goto done; + next_extent.e_len++; + next_extent.e_lblk--; + next_extent.e_pblk--; + retval = ext2fs_extent_replace(handle, 0, + &next_extent); + if (retval) + goto done; + } else + retval = ext2fs_extent_insert(handle, + EXT2_EXTENT_INSERT_AFTER, &newextent); + if (retval) + goto done; + /* Now pointing at inserted extent; move back to prev */ + retval = ext2fs_extent_get(handle, + EXT2_EXTENT_PREV_LEAF, + &extent); + if (retval) + goto done; + } + extent.e_len--; + retval = ext2fs_extent_replace(handle, 0, &extent); + if (retval) + goto done; + } else if (logical == extent.e_lblk) { +#ifdef DEBUG + printf("(re/un)mapping first block in extent\n"); +#endif + if (physical) { + if (has_prev && + (logical == (prev_extent.e_lblk + + prev_extent.e_len)) && + (physical == (prev_extent.e_pblk + + prev_extent.e_len)) && + (new_uninit == prev_uninit) && + ((int) prev_extent.e_len < max_len-1)) { + retval = ext2fs_extent_get(handle, + EXT2_EXTENT_PREV_LEAF, &prev_extent); + if (retval) + goto done; + prev_extent.e_len++; + retval = ext2fs_extent_replace(handle, 0, + &prev_extent); + } else + retval = ext2fs_extent_insert(handle, + 0, &newextent); + if (retval) + goto done; + retval = ext2fs_extent_get(handle, + EXT2_EXTENT_NEXT_LEAF, + &extent); + if (retval) + goto done; + } + extent.e_pblk++; + extent.e_lblk++; + extent.e_len--; + retval = ext2fs_extent_replace(handle, 0, &extent); + if (retval) + goto done; + } else { + __u32 orig_length; + +#ifdef DEBUG + printf("(re/un)mapping in middle of extent\n"); +#endif + /* need to split this extent; later */ + + orig_length = extent.e_len; + + /* shorten pre-split extent */ + extent.e_len = (logical - extent.e_lblk); + retval = ext2fs_extent_replace(handle, 0, &extent); + if (retval) + goto done; + /* insert our new extent, if any */ + if (physical) { + /* insert new extent after current */ + retval = ext2fs_extent_insert(handle, + EXT2_EXTENT_INSERT_AFTER, &newextent); + if (retval) + goto done; + } + /* add post-split extent */ + extent.e_pblk += extent.e_len + 1; + extent.e_lblk += extent.e_len + 1; + extent.e_len = orig_length - extent.e_len - 1; + retval = ext2fs_extent_insert(handle, + EXT2_EXTENT_INSERT_AFTER, &extent); + if (retval) + goto done; + } + +done: + /* get handle back to its position */ + if (orig_height > handle->max_depth) + orig_height = handle->max_depth; /* In case we shortened the tree */ + extent_goto(handle, orig_height, orig_lblk); + return retval; +} + +errcode_t ext2fs_extent_delete(ext2_extent_handle_t handle, int flags) +{ + struct extent_path *path; + char *cp; + struct ext3_extent_header *eh; + errcode_t retval = 0; + + EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE); + + if (!(handle->fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + if (!handle->path) + return EXT2_ET_NO_CURRENT_NODE; + +#ifdef DEBUG + { + struct ext2fs_extent extent; + + retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, + &extent); + if (retval == 0) { + printf("extent delete %u ", handle->ino); + dbg_print_extent(0, &extent); + } + } +#endif + + path = handle->path + handle->level; + if (!path->curr) + return EXT2_ET_NO_CURRENT_NODE; + + cp = path->curr; + + if (path->left) { + memmove(cp, cp + sizeof(struct ext3_extent_idx), + path->left * sizeof(struct ext3_extent_idx)); + path->left--; + } else { + struct ext3_extent_idx *ix = path->curr; + ix--; + path->curr = ix; + } + if (--path->entries == 0) + path->curr = 0; + + /* if non-root node has no entries left, remove it & parent ptr to it */ + if (path->entries == 0 && handle->level) { + if (!(flags & EXT2_EXTENT_DELETE_KEEP_EMPTY)) { + struct ext2fs_extent extent; + + retval = ext2fs_extent_get(handle, EXT2_EXTENT_UP, + &extent); + if (retval) + return retval; + + retval = ext2fs_extent_delete(handle, flags); + handle->inode->i_blocks -= handle->fs->blocksize / 512; + retval = ext2fs_write_inode(handle->fs, handle->ino, + handle->inode); + ext2fs_block_alloc_stats2(handle->fs, + extent.e_pblk, -1); + } + } else { + eh = (struct ext3_extent_header *) path->buf; + eh->eh_entries = ext2fs_cpu_to_le16(path->entries); + if ((path->entries == 0) && (handle->level == 0)) + eh->eh_depth = handle->max_depth = 0; + retval = update_path(handle); + } + return retval; +} + +errcode_t ext2fs_extent_get_info(ext2_extent_handle_t handle, + struct ext2_extent_info *info) +{ + struct extent_path *path; + + EXT2_CHECK_MAGIC(handle, EXT2_ET_MAGIC_EXTENT_HANDLE); + + memset(info, 0, sizeof(struct ext2_extent_info)); + + path = handle->path + handle->level; + if (path) { + if (path->curr) + info->curr_entry = ((char *) path->curr - path->buf) / + sizeof(struct ext3_extent_idx); + else + info->curr_entry = 0; + info->num_entries = path->entries; + info->max_entries = path->max_entries; + info->bytes_avail = (path->max_entries - path->entries) * + sizeof(struct ext3_extent); + } + + info->curr_level = handle->level; + info->max_depth = handle->max_depth; + info->max_lblk = ((__u64) 1 << 32) - 1; + info->max_pblk = ((__u64) 1 << 48) - 1; + info->max_len = (1UL << 15); + info->max_uninit_len = (1UL << 15) - 1; + + return 0; +} + +#ifdef DEBUG + +#include "ss/ss.h" + +#include "debugfs.h" + +/* + * Hook in new commands into debugfs + */ +const char *debug_prog_name = "tst_extents"; +extern ss_request_table extent_cmds; +ss_request_table *extra_cmds = &extent_cmds; + +ext2_ino_t current_ino = 0; +ext2_extent_handle_t current_handle; + +int common_extent_args_process(int argc, char *argv[], int min_argc, + int max_argc, const char *cmd, + const char *usage, int flags) +{ + if (common_args_process(argc, argv, min_argc, max_argc, cmd, + usage, flags)) + return 1; + + if (!current_handle) { + com_err(cmd, 0, "Extent handle not open"); + return 1; + } + return 0; +} + +void do_inode(int argc, char *argv[]) +{ + ext2_ino_t inode; + int i; + struct ext3_extent_header *eh; + errcode_t retval; + + if (check_fs_open(argv[0])) + return; + + if (argc == 1) { + if (current_ino) + printf("Current inode is %d\n", current_ino); + else + printf("No current inode\n"); + return; + } + + if (common_inode_args_process(argc, argv, &inode, 0)) { + return; + } + + current_ino = 0; + + retval = ext2fs_extent_open(current_fs, inode, ¤t_handle); + if (retval) { + com_err(argv[1], retval, "while opening extent handle"); + return; + } + + current_ino = inode; + + printf("Loaded inode %d\n", current_ino); + + return; +} + +void generic_goto_node(char *cmd_name, int op) +{ + struct ext2fs_extent extent; + errcode_t retval; + + if (check_fs_open(cmd_name)) + return; + + if (!current_handle) { + com_err(cmd_name, 0, "Extent handle not open"); + return; + } + + retval = ext2fs_extent_get(current_handle, op, &extent); + if (retval) { + com_err(cmd_name, retval, 0); + return; + } + dbg_print_extent(0, &extent); +} + +void do_current_node(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_CURRENT); +} + +void do_root_node(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_ROOT); +} + +void do_last_leaf(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_LAST_LEAF); +} + +void do_first_sib(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_FIRST_SIB); +} + +void do_last_sib(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_LAST_SIB); +} + +void do_next_sib(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_NEXT_SIB); +} + +void do_prev_sib(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_PREV_SIB); +} + +void do_next_leaf(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_NEXT_LEAF); +} + +void do_prev_leaf(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_PREV_LEAF); +} + +void do_next(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_NEXT); +} + +void do_prev(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_PREV); +} + +void do_up(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_UP); +} + +void do_down(int argc, char *argv[]) +{ + generic_goto_node(argv[0], EXT2_EXTENT_DOWN); +} + +void do_delete_node(int argc, char *argv[]) +{ + errcode_t retval; + int err; + + if (common_extent_args_process(argc, argv, 1, 1, "delete_node", + "", CHECK_FS_RW | CHECK_FS_BITMAPS)) + return; + + retval = ext2fs_extent_delete(current_handle, 0); + if (retval) { + com_err(argv[0], retval, 0); + return; + } + if (current_handle->path && current_handle->path[0].curr) + do_current_node(argc, argv); +} + +void do_replace_node(int argc, char *argv[]) +{ + const char *usage = "[--uninit] <lblk> <len> <pblk>"; + errcode_t retval; + struct ext2fs_extent extent; + int err; + + if (common_extent_args_process(argc, argv, 3, 5, "replace_node", + usage, CHECK_FS_RW | CHECK_FS_BITMAPS)) + return; + + extent.e_flags = 0; + + if (!strcmp(argv[1], "--uninit")) { + argc--; + argv++; + extent.e_flags |= EXT2_EXTENT_FLAGS_UNINIT; + } + + if (argc != 4) { + fprintf(stderr, "Usage: %s %s\n", argv[0], usage); + return; + } + + extent.e_lblk = parse_ulong(argv[1], argv[0], "logical block", &err); + if (err) + return; + + extent.e_len = parse_ulong(argv[2], argv[0], "logical block", &err); + if (err) + return; + + extent.e_pblk = parse_ulong(argv[3], argv[0], "logical block", &err); + if (err) + return; + + retval = ext2fs_extent_replace(current_handle, 0, &extent); + if (retval) { + com_err(argv[0], retval, 0); + return; + } + do_current_node(argc, argv); +} + +void do_split_node(int argc, char *argv[]) +{ + errcode_t retval; + struct ext2fs_extent extent; + int err; + + if (common_extent_args_process(argc, argv, 1, 1, "split_node", + "", CHECK_FS_RW | CHECK_FS_BITMAPS)) + return; + + retval = extent_node_split(current_handle); + if (retval) { + com_err(argv[0], retval, 0); + return; + } + do_current_node(argc, argv); +} + +void do_insert_node(int argc, char *argv[]) +{ + const char *usage = "[--after] [--uninit] <lblk> <len> <pblk>"; + errcode_t retval; + struct ext2fs_extent extent; + char *cmd; + int err; + int flags = 0; + + if (common_extent_args_process(argc, argv, 3, 6, "insert_node", + usage, CHECK_FS_RW | CHECK_FS_BITMAPS)) + return; + + cmd = argv[0]; + + extent.e_flags = 0; + + while (argc > 2) { + if (!strcmp(argv[1], "--after")) { + argc--; + argv++; + flags |= EXT2_EXTENT_INSERT_AFTER; + continue; + } + if (!strcmp(argv[1], "--uninit")) { + argc--; + argv++; + extent.e_flags |= EXT2_EXTENT_FLAGS_UNINIT; + continue; + } + break; + } + + if (argc != 4) { + fprintf(stderr, "usage: %s %s\n", cmd, usage); + return; + } + + extent.e_lblk = parse_ulong(argv[1], cmd, + "logical block", &err); + if (err) + return; + + extent.e_len = parse_ulong(argv[2], cmd, + "length", &err); + if (err) + return; + + extent.e_pblk = parse_ulong(argv[3], cmd, + "pysical block", &err); + if (err) + return; + + retval = ext2fs_extent_insert(current_handle, flags, &extent); + if (retval) { + com_err(cmd, retval, 0); + return; + } + do_current_node(argc, argv); +} + +void do_set_bmap(int argc, char **argv) +{ + const char *usage = "[--uninit] <lblk> <pblk>"; + errcode_t retval; + blk_t logical; + blk_t physical; + char *cmd = argv[0]; + int flags = 0; + int err; + + if (common_extent_args_process(argc, argv, 3, 5, "set_bmap", + usage, CHECK_FS_RW | CHECK_FS_BITMAPS)) + return; + + if (argc > 2 && !strcmp(argv[1], "--uninit")) { + argc--; + argv++; + flags |= EXT2_EXTENT_SET_BMAP_UNINIT; + } + + if (argc != 3) { + fprintf(stderr, "Usage: %s %s\n", cmd, usage); + return; + } + + logical = parse_ulong(argv[1], cmd, + "logical block", &err); + if (err) + return; + + physical = parse_ulong(argv[2], cmd, + "physical block", &err); + if (err) + return; + + retval = ext2fs_extent_set_bmap(current_handle, logical, + (blk64_t) physical, flags); + if (retval) { + com_err(cmd, retval, 0); + return; + } + if (current_handle->path && current_handle->path[0].curr) + do_current_node(argc, argv); +} + +void do_print_all(int argc, char **argv) +{ + const char *usage = "[--leaf-only|--reverse|--reverse-leaf]"; + struct ext2fs_extent extent; + errcode_t retval; + errcode_t end_err = EXT2_ET_EXTENT_NO_NEXT; + int op = EXT2_EXTENT_NEXT; + int first_op = EXT2_EXTENT_ROOT; + + + if (common_extent_args_process(argc, argv, 1, 2, "print_all", + usage, 0)) + return; + + if (argc == 2) { + if (!strcmp(argv[1], "--leaf-only")) + op = EXT2_EXTENT_NEXT_LEAF; + else if (!strcmp(argv[1], "--reverse")) { + op = EXT2_EXTENT_PREV; + first_op = EXT2_EXTENT_LAST_LEAF; + end_err = EXT2_ET_EXTENT_NO_PREV; + } else if (!strcmp(argv[1], "--reverse-leaf")) { + op = EXT2_EXTENT_PREV_LEAF; + first_op = EXT2_EXTENT_LAST_LEAF; + end_err = EXT2_ET_EXTENT_NO_PREV; + } else { + fprintf(stderr, "Usage: %s %s\n", argv[0], usage); + return; + } + } + + retval = ext2fs_extent_get(current_handle, first_op, &extent); + if (retval) { + com_err(argv[0], retval, 0); + return; + } + dbg_print_extent(0, &extent); + + while (1) { + retval = ext2fs_extent_get(current_handle, op, &extent); + if (retval == end_err) + break; + + if (retval) { + com_err(argv[0], retval, 0); + return; + } + dbg_print_extent(0, &extent); + } +} + +void do_info(int argc, char **argv) +{ + struct ext2fs_extent extent; + struct ext2_extent_info info; + errcode_t retval; + + if (common_extent_args_process(argc, argv, 1, 1, "info", "", 0)) + return; + + retval = ext2fs_extent_get_info(current_handle, &info); + if (retval) { + com_err(argv[0], retval, 0); + return; + } + + retval = ext2fs_extent_get(current_handle, + EXT2_EXTENT_CURRENT, &extent); + if (retval) { + com_err(argv[0], retval, 0); + return; + } + + dbg_print_extent(0, &extent); + + printf("Current handle location: %d/%d (max: %d, bytes %d), level %d/%d\n", + info.curr_entry, info.num_entries, info.max_entries, + info.bytes_avail, info.curr_level, info.max_depth); + printf("\tmax lblk: %llu, max pblk: %llu\n", info.max_lblk, + info.max_pblk); + printf("\tmax_len: %u, max_uninit_len: %u\n", info.max_len, + info.max_uninit_len); +} + +void do_goto_block(int argc, char **argv) +{ + struct ext2fs_extent extent; + errcode_t retval; + int op = EXT2_EXTENT_NEXT_LEAF; + blk64_t blk; + int level = 0, err; + + if (common_extent_args_process(argc, argv, 2, 3, "goto_block", + "block [level]", 0)) + return; + + if (strtoblk(argv[0], argv[1], &blk)) + return; + + if (argc == 3) { + level = parse_ulong(argv[2], argv[0], "level", &err); + if (err) + return; + } + + retval = extent_goto(current_handle, level, (blk64_t) blk); + + if (retval) { + com_err(argv[0], retval, + "while trying to go to block %llu, level %d", + (unsigned long long) blk, level); + return; + } + + generic_goto_node(argv[0], EXT2_EXTENT_CURRENT); +} +#endif + diff --git a/portlibs/sources/libext2fs/source/fiemap.h b/portlibs/sources/libext2fs/source/fiemap.h new file mode 100644 index 00000000..30bf5555 --- /dev/null +++ b/portlibs/sources/libext2fs/source/fiemap.h @@ -0,0 +1,68 @@ +/* + * FS_IOC_FIEMAP ioctl infrastructure. + * + * Some portions copyright (C) 2007 Cluster File Systems, Inc + * + * Authors: Mark Fasheh <mfasheh@suse.com> + * Kalpak Shah <kalpak.shah@sun.com> + * Andreas Dilger <adilger@sun.com> + */ + +#ifndef _LINUX_FIEMAP_H +#define _LINUX_FIEMAP_H + +struct fiemap_extent { + __u64 fe_logical; /* logical offset in bytes for the start of + * the extent from the beginning of the file */ + __u64 fe_physical; /* physical offset in bytes for the start + * of the extent from the beginning of the disk */ + __u64 fe_length; /* length in bytes for this extent */ + __u64 fe_reserved64[2]; + __u32 fe_flags; /* FIEMAP_EXTENT_* flags for this extent */ + __u32 fe_reserved[3]; +}; + +struct fiemap { + __u64 fm_start; /* logical offset (inclusive) at + * which to start mapping (in) */ + __u64 fm_length; /* logical length of mapping which + * userspace wants (in) */ + __u32 fm_flags; /* FIEMAP_FLAG_* flags for request (in/out) */ + __u32 fm_mapped_extents;/* number of extents that were mapped (out) */ + __u32 fm_extent_count; /* size of fm_extents array (in) */ + __u32 fm_reserved; + struct fiemap_extent fm_extents[0]; /* array of mapped extents (out) */ +}; + +#ifndef FS_IOC_FIEMAP +#define FS_IOC_FIEMAP _IOWR('f', 11, struct fiemap) +#endif + +#define FIEMAP_MAX_OFFSET (~0ULL) + +#define FIEMAP_FLAG_SYNC 0x00000001 /* sync file data before map */ +#define FIEMAP_FLAG_XATTR 0x00000002 /* map extended attribute tree */ + +#define FIEMAP_FLAGS_COMPAT (FIEMAP_FLAG_SYNC | FIEMAP_FLAG_XATTR) + +#define FIEMAP_EXTENT_LAST 0x00000001 /* Last extent in file. */ +#define FIEMAP_EXTENT_UNKNOWN 0x00000002 /* Data location unknown. */ +#define FIEMAP_EXTENT_DELALLOC 0x00000004 /* Location still pending. + * Sets EXTENT_UNKNOWN. */ +#define FIEMAP_EXTENT_ENCODED 0x00000008 /* Data can not be read + * while fs is unmounted */ +#define FIEMAP_EXTENT_DATA_ENCRYPTED 0x00000080 /* Data is encrypted by fs. + * Sets EXTENT_NO_BYPASS. */ +#define FIEMAP_EXTENT_NOT_ALIGNED 0x00000100 /* Extent offsets may not be + * block aligned. */ +#define FIEMAP_EXTENT_DATA_INLINE 0x00000200 /* Data mixed with metadata. + * Sets EXTENT_NOT_ALIGNED.*/ +#define FIEMAP_EXTENT_DATA_TAIL 0x00000400 /* Multiple files in block. + * Sets EXTENT_NOT_ALIGNED.*/ +#define FIEMAP_EXTENT_UNWRITTEN 0x00000800 /* Space allocated, but + * no data (i.e. zero). */ +#define FIEMAP_EXTENT_MERGED 0x00001000 /* File does not natively + * support extents. Result + * merged for efficiency. */ + +#endif /* _LINUX_FIEMAP_H */ diff --git a/portlibs/sources/libext2fs/source/fileio.c b/portlibs/sources/libext2fs/source/fileio.c new file mode 100644 index 00000000..44c859b9 --- /dev/null +++ b/portlibs/sources/libext2fs/source/fileio.c @@ -0,0 +1,412 @@ +/* + * fileio.c --- Simple file I/O routines + * + * Copyright (C) 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +struct ext2_file { + errcode_t magic; + ext2_filsys fs; + ext2_ino_t ino; + struct ext2_inode inode; + int flags; + __u64 pos; + blk64_t blockno; + blk64_t physblock; + char *buf; +}; + +#define BMAP_BUFFER (file->buf + fs->blocksize) + +errcode_t ext2fs_file_open2(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + int flags, ext2_file_t *ret) +{ + ext2_file_t file; + errcode_t retval; + + /* + * Don't let caller create or open a file for writing if the + * filesystem is read-only. + */ + if ((flags & (EXT2_FILE_WRITE | EXT2_FILE_CREATE)) && + !(fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + retval = ext2fs_get_mem(sizeof(struct ext2_file), &file); + if (retval) + return retval; + + memset(file, 0, sizeof(struct ext2_file)); + file->magic = EXT2_ET_MAGIC_EXT2_FILE; + file->fs = fs; + file->ino = ino; + file->flags = flags & EXT2_FILE_MASK; + + if (inode) { + memcpy(&file->inode, inode, sizeof(struct ext2_inode)); + } else { + retval = ext2fs_read_inode(fs, ino, &file->inode); + if (retval) + goto fail; + } + + retval = ext2fs_get_array(3, fs->blocksize, &file->buf); + if (retval) + goto fail; + + *ret = file; + return 0; + +fail: + if (file->buf) + ext2fs_free_mem(&file->buf); + ext2fs_free_mem(&file); + return retval; +} + +errcode_t ext2fs_file_open(ext2_filsys fs, ext2_ino_t ino, + int flags, ext2_file_t *ret) +{ + return ext2fs_file_open2(fs, ino, NULL, flags, ret); +} + +/* + * This function returns the filesystem handle of a file from the structure + */ +ext2_filsys ext2fs_file_get_fs(ext2_file_t file) +{ + if (file->magic != EXT2_ET_MAGIC_EXT2_FILE) + return 0; + return file->fs; +} + +/* + * This function returns the pointer to the inode of a file from the structure + */ +struct ext2_inode *ext2fs_file_get_inode(ext2_file_t file) +{ + if (file->magic != EXT2_ET_MAGIC_EXT2_FILE) + return NULL; + return &file->inode; +} + +/* + * This function flushes the dirty block buffer out to disk if + * necessary. + */ +errcode_t ext2fs_file_flush(ext2_file_t file) +{ + errcode_t retval; + ext2_filsys fs; + + EXT2_CHECK_MAGIC(file, EXT2_ET_MAGIC_EXT2_FILE); + fs = file->fs; + + if (!(file->flags & EXT2_FILE_BUF_VALID) || + !(file->flags & EXT2_FILE_BUF_DIRTY)) + return 0; + + // Flushing out the new size - Dimok + ext2fs_write_inode(file->fs, file->ino, &file->inode); + + /* + * OK, the physical block hasn't been allocated yet. + * Allocate it. + */ + if (!file->physblock) { + retval = ext2fs_bmap2(fs, file->ino, &file->inode, + BMAP_BUFFER, file->ino ? BMAP_ALLOC : 0, + file->blockno, 0, &file->physblock); + if (retval) + return retval; + } + + retval = io_channel_write_blk(fs->io, file->physblock, + 1, file->buf); + if (retval) + return retval; + + file->flags &= ~EXT2_FILE_BUF_DIRTY; + + return retval; +} + +/* + * This function synchronizes the file's block buffer and the current + * file position, possibly invalidating block buffer if necessary + */ +static errcode_t sync_buffer_position(ext2_file_t file) +{ + blk_t b; + errcode_t retval; + + b = file->pos / file->fs->blocksize; + if (b != file->blockno) { + retval = ext2fs_file_flush(file); + if (retval) + return retval; + file->flags &= ~EXT2_FILE_BUF_VALID; + } + file->blockno = b; + return 0; +} + +/* + * This function loads the file's block buffer with valid data from + * the disk as necessary. + * + * If dontfill is true, then skip initializing the buffer since we're + * going to be replacing its entire contents anyway. If set, then the + * function basically only sets file->physblock and EXT2_FILE_BUF_VALID + */ +#define DONTFILL 1 +static errcode_t load_buffer(ext2_file_t file, int dontfill) +{ + ext2_filsys fs = file->fs; + errcode_t retval; + + if (!(file->flags & EXT2_FILE_BUF_VALID)) { + retval = ext2fs_bmap2(fs, file->ino, &file->inode, + BMAP_BUFFER, 0, file->blockno, 0, + &file->physblock); + if (retval) + return retval; + if (!dontfill) { + if (file->physblock) { + retval = io_channel_read_blk(fs->io, + file->physblock, + 1, file->buf); + if (retval) + return retval; + } else + memset(file->buf, 0, fs->blocksize); + } + file->flags |= EXT2_FILE_BUF_VALID; + } + return 0; +} + + +errcode_t ext2fs_file_close(ext2_file_t file) +{ + errcode_t retval; + + EXT2_CHECK_MAGIC(file, EXT2_ET_MAGIC_EXT2_FILE); + + retval = ext2fs_file_flush(file); + + if (file->buf) + ext2fs_free_mem(&file->buf); + ext2fs_free_mem(&file); + + return retval; +} + + +errcode_t ext2fs_file_read(ext2_file_t file, void *buf, + unsigned int wanted, unsigned int *got) +{ + ext2_filsys fs; + errcode_t retval = 0; + unsigned int start, c, count = 0; + __u64 left; + char *ptr = (char *) buf; + + EXT2_CHECK_MAGIC(file, EXT2_ET_MAGIC_EXT2_FILE); + fs = file->fs; + + while ((file->pos < EXT2_I_SIZE(&file->inode)) && (wanted > 0)) { + retval = sync_buffer_position(file); + if (retval) + goto fail; + retval = load_buffer(file, 0); + if (retval) + goto fail; + + start = file->pos % fs->blocksize; + c = fs->blocksize - start; + if (c > wanted) + c = wanted; + left = EXT2_I_SIZE(&file->inode) - file->pos ; + if (c > left) + c = left; + + memcpy(ptr, file->buf+start, c); + file->pos += c; + ptr += c; + count += c; + wanted -= c; + } + +fail: + if (got) + *got = count; + return retval; +} + + +errcode_t ext2fs_file_write(ext2_file_t file, const void *buf, + unsigned int nbytes, unsigned int *written) +{ + ext2_filsys fs; + errcode_t retval = 0; + unsigned int start, c, count = 0; + const char *ptr = (const char *) buf; + + EXT2_CHECK_MAGIC(file, EXT2_ET_MAGIC_EXT2_FILE); + fs = file->fs; + + if (!(file->flags & EXT2_FILE_WRITE)) + return EXT2_ET_FILE_RO; + + while (nbytes > 0) { + retval = sync_buffer_position(file); + if (retval) + goto fail; + + start = file->pos % fs->blocksize; + c = fs->blocksize - start; + if (c > nbytes) + c = nbytes; + + /* + * We only need to do a read-modify-update cycle if + * we're doing a partial write. + */ + retval = load_buffer(file, (c == fs->blocksize)); + if (retval) + goto fail; + + file->flags |= EXT2_FILE_BUF_DIRTY; + memcpy(file->buf+start, ptr, c); + file->pos += c; + ptr += c; + count += c; + nbytes -= c; + } + + // I don't see why changing size is my duty - Dimok + if(EXT2_I_SIZE(&file->inode) < file->pos) + { + file->inode.i_size = file->pos & 0xFFFFFFFF; + file->inode.i_size_high = (file->pos >> 32) & 0xFFFFFFFF; + } + +fail: + if (written) + *written = count; + return retval; +} + +errcode_t ext2fs_file_llseek(ext2_file_t file, __u64 offset, + int whence, __u64 *ret_pos) +{ + EXT2_CHECK_MAGIC(file, EXT2_ET_MAGIC_EXT2_FILE); + + if (whence == EXT2_SEEK_SET) + file->pos = offset; + else if (whence == EXT2_SEEK_CUR) + file->pos += offset; + else if (whence == EXT2_SEEK_END) + file->pos = EXT2_I_SIZE(&file->inode) + offset; + else + return EXT2_ET_INVALID_ARGUMENT; + + if (ret_pos) + *ret_pos = file->pos; + + return 0; +} + +errcode_t ext2fs_file_lseek(ext2_file_t file, ext2_off_t offset, + int whence, ext2_off_t *ret_pos) +{ + __u64 loffset, ret_loffset = 0; + errcode_t retval; + + loffset = offset; + retval = ext2fs_file_llseek(file, loffset, whence, &ret_loffset); + if (ret_pos) + *ret_pos = (ext2_off_t) ret_loffset; + return retval; +} + + +/* + * This function returns the size of the file, according to the inode + */ +errcode_t ext2fs_file_get_lsize(ext2_file_t file, __u64 *ret_size) +{ + if (file->magic != EXT2_ET_MAGIC_EXT2_FILE) + return EXT2_ET_MAGIC_EXT2_FILE; + *ret_size = EXT2_I_SIZE(&file->inode); + return 0; +} + +/* + * This function returns the size of the file, according to the inode + */ +ext2_off_t ext2fs_file_get_size(ext2_file_t file) +{ + __u64 size; + + if (ext2fs_file_get_lsize(file, &size)) + return 0; + if ((size >> 32) != 0) + return 0; + return size; +} + +/* + * This function sets the size of the file, truncating it if necessary + * + */ +errcode_t ext2fs_file_set_size2(ext2_file_t file, ext2_off64_t size) +{ + ext2_off64_t old_size; + errcode_t retval; + blk64_t old_truncate, truncate_block; + + EXT2_CHECK_MAGIC(file, EXT2_ET_MAGIC_EXT2_FILE); + + truncate_block = ((size + file->fs->blocksize - 1) >> + EXT2_BLOCK_SIZE_BITS(file->fs->super)) + 1; + old_size = file->inode.i_size + + (((blk64_t) file->inode.i_size_high) << 32); + old_truncate = ((old_size + file->fs->blocksize - 1) >> + EXT2_BLOCK_SIZE_BITS(file->fs->super)) + 1; + + file->inode.i_size = size & 0xffffffff; + file->inode.i_size_high = (size >> 32); + if (file->ino) { + retval = ext2fs_write_inode(file->fs, file->ino, &file->inode); + if (retval) + return retval; + } + + if (truncate_block <= old_truncate) + return 0; + + return ext2fs_punch(file->fs, file->ino, &file->inode, 0, + truncate_block, ~0ULL); +} + +errcode_t ext2fs_file_set_size(ext2_file_t file, ext2_off_t size) +{ + return ext2fs_file_set_size2(file, size); +} diff --git a/portlibs/sources/libext2fs/source/finddev.c b/portlibs/sources/libext2fs/source/finddev.c new file mode 100644 index 00000000..cc2029f2 --- /dev/null +++ b/portlibs/sources/libext2fs/source/finddev.c @@ -0,0 +1,208 @@ +/* + * finddev.c -- this routine attempts to find a particular device in + * /dev + * + * Copyright (C) 2000 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <stdlib.h> +#include <string.h> +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#include <dirent.h> +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#if HAVE_SYS_MKDEV_H +#include <sys/mkdev.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +struct dir_list { + char *name; + struct dir_list *next; +}; + +/* + * This function adds an entry to the directory list + */ +static void add_to_dirlist(const char *name, struct dir_list **list) +{ + struct dir_list *dp; + + dp = malloc(sizeof(struct dir_list)); + if (!dp) + return; + dp->name = malloc(strlen(name)+1); + if (!dp->name) { + free(dp); + return; + } + strcpy(dp->name, name); + dp->next = *list; + *list = dp; +} + +/* + * This function frees a directory list + */ +static void free_dirlist(struct dir_list **list) +{ + struct dir_list *dp, *next; + + for (dp = *list; dp; dp = next) { + next = dp->next; + free(dp->name); + free(dp); + } + *list = 0; +} + +static int scan_dir(char *dirname, dev_t device, struct dir_list **list, + char **ret_path) +{ + DIR *dir; + struct dirent *dp; + char path[1024], *cp; + int dirlen; + struct stat st; + + dirlen = strlen(dirname); + if ((dir = opendir(dirname)) == NULL) + return errno; + dp = readdir(dir); + while (dp) { + if (dirlen + strlen(dp->d_name) + 2 >= sizeof(path)) + goto skip_to_next; + if (dp->d_name[0] == '.' && + ((dp->d_name[1] == 0) || + ((dp->d_name[1] == '.') && (dp->d_name[2] == 0)))) + goto skip_to_next; + sprintf(path, "%s/%s", dirname, dp->d_name); + if (stat(path, &st) < 0) + goto skip_to_next; + if (S_ISDIR(st.st_mode)) + add_to_dirlist(path, list); + if (S_ISBLK(st.st_mode) && st.st_rdev == device) { + cp = malloc(strlen(path)+1); + if (!cp) { + closedir(dir); + return ENOMEM; + } + strcpy(cp, path); + *ret_path = cp; + goto success; + } + skip_to_next: + dp = readdir(dir); + } +success: + closedir(dir); + return 0; +} + +/* + * This function finds the pathname to a block device with a given + * device number. It returns a pointer to allocated memory to the + * pathname on success, and NULL on failure. + */ +char *ext2fs_find_block_device(dev_t device) +{ + struct dir_list *list = 0, *new_list = 0; + struct dir_list *current; + char *ret_path = 0; + + /* + * Add the starting directories to search... + */ + add_to_dirlist("/devices", &list); + add_to_dirlist("/devfs", &list); + add_to_dirlist("/dev", &list); + + while (list) { + current = list; + list = list->next; +#ifdef DEBUG + printf("Scanning directory %s\n", current->name); +#endif + scan_dir(current->name, device, &new_list, &ret_path); + free(current->name); + free(current); + if (ret_path) + break; + /* + * If we're done checking at this level, descend to + * the next level of subdirectories. (breadth-first) + */ + if (list == 0) { + list = new_list; + new_list = 0; + } + } + free_dirlist(&list); + free_dirlist(&new_list); + return ret_path; +} + + +#ifdef DEBUG +int main(int argc, char** argv) +{ + char *devname, *tmp; + int major, minor; + dev_t device; + const char *errmsg = "Couldn't parse %s: %s\n"; + + if ((argc != 2) && (argc != 3)) { + fprintf(stderr, "Usage: %s device_number\n", argv[0]); + fprintf(stderr, "\t: %s major minor\n", argv[0]); + exit(1); + } + if (argc == 2) { + device = strtoul(argv[1], &tmp, 0); + if (*tmp) { + fprintf(stderr, errmsg, "device number", argv[1]); + exit(1); + } + } else { + major = strtoul(argv[1], &tmp, 0); + if (*tmp) { + fprintf(stderr, errmsg, "major number", argv[1]); + exit(1); + } + minor = strtoul(argv[2], &tmp, 0); + if (*tmp) { + fprintf(stderr, errmsg, "minor number", argv[2]); + exit(1); + } + device = makedev(major, minor); + printf("Looking for device 0x%04x (%d:%d)\n", device, + major, minor); + } + devname = ext2fs_find_block_device(device); + if (devname) { + printf("Found device! %s\n", devname); + free(devname); + } else { + printf("Couldn't find device.\n"); + } + return 0; +} + +#endif diff --git a/portlibs/sources/libext2fs/source/flushb.c b/portlibs/sources/libext2fs/source/flushb.c new file mode 100644 index 00000000..b6f161b6 --- /dev/null +++ b/portlibs/sources/libext2fs/source/flushb.c @@ -0,0 +1,74 @@ +/* + * flushb.c --- Hides system-dependent information for both syncing a + * device to disk and to flush any buffers from disk cache. + * + * Copyright (C) 2000 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_SYS_IOCTL_H +#include <sys/ioctl.h> +#endif +#if HAVE_SYS_MOUNT_H +#include <sys/param.h> +#include <sys/mount.h> /* This may define BLKFLSBUF */ +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +/* + * For Linux, define BLKFLSBUF and FDFLUSH if necessary, since + * not all portable header file does so for us. This really should be + * fixed in the glibc header files. (Recent glibcs appear to define + * BLKFLSBUF in sys/mount.h, but FDFLUSH still doesn't seem to be + * defined anywhere portable.) Until then.... + */ +#ifdef __linux__ +#ifndef BLKFLSBUF +#define BLKFLSBUF _IO(0x12,97) /* flush buffer cache */ +#endif +#ifndef FDFLUSH +#define FDFLUSH _IO(2,0x4b) /* flush floppy disk */ +#endif +#endif + +/* + * This function will sync a device/file, and optionally attempt to + * flush the buffer cache. The latter is basically only useful for + * system benchmarks and for torturing systems in burn-in tests. :) + */ +errcode_t ext2fs_sync_device(int fd, int flushb) +{ + /* + * We always sync the device in case we're running on old + * kernels for which we can lose data if we don't. (There + * still is a race condition for those kernels, but this + * reduces it greatly.) + */ + if (fsync (fd) == -1) + return errno; + + if (flushb) { + +#ifdef BLKFLSBUF + if (ioctl (fd, BLKFLSBUF, 0) == 0) + return 0; +#endif +#ifdef FDFLUSH + ioctl (fd, FDFLUSH, 0); /* In case this is a floppy */ +#endif + } + return 0; +} diff --git a/portlibs/sources/libext2fs/source/freefs.c b/portlibs/sources/libext2fs/source/freefs.c new file mode 100644 index 00000000..5c35bb68 --- /dev/null +++ b/portlibs/sources/libext2fs/source/freefs.c @@ -0,0 +1,112 @@ +/* + * freefs.c --- free an ext2 filesystem + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +#include "ext2_fs.h" +#include "ext2fsP.h" + +static void ext2fs_free_inode_cache(struct ext2_inode_cache *icache); + +void ext2fs_free(ext2_filsys fs) +{ + if (!fs || (fs->magic != EXT2_ET_MAGIC_EXT2FS_FILSYS)) + return; + if (fs->image_io != fs->io) { + if (fs->image_io) + io_channel_close(fs->image_io); + } + if (fs->io) { + io_channel_close(fs->io); + } + if (fs->device_name) + ext2fs_free_mem(&fs->device_name); + if (fs->super) + ext2fs_free_mem(&fs->super); + if (fs->orig_super) + ext2fs_free_mem(&fs->orig_super); + if (fs->group_desc) + ext2fs_free_mem(&fs->group_desc); + if (fs->block_map) + ext2fs_free_block_bitmap(fs->block_map); + if (fs->inode_map) + ext2fs_free_inode_bitmap(fs->inode_map); + + if (fs->badblocks) + ext2fs_badblocks_list_free(fs->badblocks); + fs->badblocks = 0; + + if (fs->dblist) + ext2fs_free_dblist(fs->dblist); + + if (fs->icache) + ext2fs_free_inode_cache(fs->icache); + + fs->magic = 0; + + ext2fs_free_mem(&fs); +} + +/* + * Free the inode cache structure + */ +static void ext2fs_free_inode_cache(struct ext2_inode_cache *icache) +{ + if (--icache->refcount) + return; + if (icache->buffer) + ext2fs_free_mem(&icache->buffer); + if (icache->cache) + ext2fs_free_mem(&icache->cache); + icache->buffer_blk = 0; + ext2fs_free_mem(&icache); +} + +/* + * This procedure frees a badblocks list. + */ +void ext2fs_u32_list_free(ext2_u32_list bb) +{ + if (bb->magic != EXT2_ET_MAGIC_BADBLOCKS_LIST) + return; + + if (bb->list) + ext2fs_free_mem(&bb->list); + bb->list = 0; + ext2fs_free_mem(&bb); +} + +void ext2fs_badblocks_list_free(ext2_badblocks_list bb) +{ + ext2fs_u32_list_free((ext2_u32_list) bb); +} + + +/* + * Free a directory block list + */ +void ext2fs_free_dblist(ext2_dblist dblist) +{ + if (!dblist || (dblist->magic != EXT2_ET_MAGIC_DBLIST)) + return; + + if (dblist->list) + ext2fs_free_mem(&dblist->list); + dblist->list = 0; + if (dblist->fs && dblist->fs->dblist == dblist) + dblist->fs->dblist = 0; + dblist->magic = 0; + ext2fs_free_mem(&dblist); +} + diff --git a/portlibs/sources/libext2fs/source/gekko_io.c b/portlibs/sources/libext2fs/source/gekko_io.c new file mode 100644 index 00000000..97da1d9f --- /dev/null +++ b/portlibs/sources/libext2fs/source/gekko_io.c @@ -0,0 +1,561 @@ +/** + * gekko_io.c - Gekko style disk io functions. + * + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2010 Dimok + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#include <gccore.h> +#include <stdlib.h> +#include <stdio.h> +#include <math.h> +#include <string.h> +#include <fcntl.h> +#include <unistd.h> +#include <errno.h> +#include <sys/stat.h> +#include <limits.h> +#include <locale.h> + +#include "gekko_io.h" +#include "bitops.h" +#include "ext2_fs.h" +#include "ext2fs.h" +#include "ext2_internal.h" +#include "disc_cache.h" +#include "mem_allocate.h" + +#define DEV_FD(dev) ((gekko_fd *) dev->private_data) + +/* Prototypes */ +static s64 device_gekko_io_readbytes(io_channel dev, s64 offset, s64 count, void *buf); +static bool device_gekko_io_readsectors(io_channel dev, sec_t sector, sec_t numSectors, void* buffer); +static s64 device_gekko_io_writebytes(io_channel dev, s64 offset, s64 count, const void *buf); +static bool device_gekko_io_writesectors(io_channel dev, sec_t sector, sec_t numSectors, const void* buffer); + +/** + * + */ +static errcode_t device_gekko_io_open(const char *name, int flags, io_channel *dev) +{ + // Get the device driver descriptor + gekko_fd *fd = DEV_FD((*dev)); + if (!fd) { + errno = EBADF; + return -1; + } + + // Get the device interface + const DISC_INTERFACE* interface = fd->interface; + if (!interface) { + errno = ENODEV; + return -1; + } + + // Start the device interface and ensure that it is inserted + if (!interface->startup()) { + ext2_log_trace("device failed to start\n"); + errno = EIO; + return -1; + } + if (!interface->isInserted()) { + ext2_log_trace("device media is not inserted\n"); + errno = EIO; + return -1; + } + + struct ext2_super_block * super = (struct ext2_super_block *) mem_alloc(SUPERBLOCK_SIZE); //1024 bytes + if(!super) + { + ext2_log_trace("no memory for superblock"); + errno = ENOMEM; + return -1; + } + + // Check that there is a valid EXT boot sector at the start of the device + if (!interface->readSectors(fd->startSector+SUPERBLOCK_OFFSET/BYTES_PER_SECTOR, SUPERBLOCK_SIZE/BYTES_PER_SECTOR, super)) + { + ext2_log_trace("read failure @ sector %d\n", fd->startSector); + errno = EROFS; + mem_free(super); + return -1; + } + + if(ext2fs_le16_to_cpu(super->s_magic) != EXT2_SUPER_MAGIC) + { + mem_free(super); + errno = EROFS; + return -1; + } + + // Parse the boot sector + fd->sectorSize = BYTES_PER_SECTOR; + fd->offset = 0; + fd->sectorCount = 0; + + switch(ext2fs_le32_to_cpu(super->s_log_block_size)) + { + case 1: + fd->sectorCount = (sec_t) ((u64) ext2fs_le32_to_cpu(super->s_blocks_count) * (u64) 2048 / (u64) BYTES_PER_SECTOR); + break; + case 2: + fd->sectorCount = (sec_t) ((u64) ext2fs_le32_to_cpu(super->s_blocks_count) * (u64) 4096 / (u64) BYTES_PER_SECTOR); + break; + case 3: + fd->sectorCount = (sec_t) ((u64) ext2fs_le32_to_cpu(super->s_blocks_count) * (u64) 8192 / (u64) BYTES_PER_SECTOR); + break; + default: + case 0: + fd->sectorCount = (sec_t) ((u64) ext2fs_le32_to_cpu(super->s_blocks_count) * (u64) 1024 / (u64) BYTES_PER_SECTOR); + break; + } + + mem_free(super); + + // Create the cache + fd->cache = cache_constructor(fd->cachePageCount, fd->cachePageSize, interface, fd->startSector + fd->sectorCount, fd->sectorSize); + + return 0; +} + +/** + * Flush data out and close volume + */ +static errcode_t device_gekko_io_close(io_channel dev) +{ + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + if(!(dev->flags & EXT2_FLAG_RW)) + return 0; + + // Flush and destroy the cache (if required) + if (fd->cache) { + cache_flush(fd->cache); + cache_destructor(fd->cache); + } + + return 0; +} + +/** + * + */ +static s64 device_gekko_io_readbytes(io_channel dev, s64 offset, s64 count, void *buf) +{ + ext2_log_trace("dev %p, offset %lli, count %lli\n", dev, offset, count); + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + // Get the device interface + const DISC_INTERFACE* interface = fd->interface; + if (!interface) { + errno = ENODEV; + return -1; + } + + if(offset < 0) + { + errno = EROFS; + return -1; + } + + if(!count) + return 0; + + sec_t sec_start = (sec_t) fd->startSector; + sec_t sec_count = 1; + u32 buffer_offset = (u32) (offset % fd->sectorSize); + u8 *buffer = NULL; + + // Determine the range of sectors required for this read + if (offset > 0) { + sec_start += (sec_t) floor((f64) offset / (f64) fd->sectorSize); + } + if (buffer_offset+count > fd->sectorSize) { + sec_count = (sec_t) ceil((f64) (buffer_offset+count) / (f64) fd->sectorSize); + } + + // Don't read over the partitions limit + if(sec_start+sec_count > fd->startSector+fd->sectorCount) + { + ext2_log_trace("Error: read requested up to sector %lli while partition goes up to %lli\n", (s64) (sec_start+sec_count), (s64) (fd->startSector+fd->sectorCount)); + errno = EROFS; + return -1; + } + + // If this read happens to be on the sector boundaries then do the read straight into the destination buffer + + if((buffer_offset == 0) && (count % fd->sectorSize == 0)) + { + // Read from the device + ext2_log_trace("direct read from sector %d (%d sector(s) long)\n", sec_start, sec_count); + if (!device_gekko_io_readsectors(dev, sec_start, sec_count, buf)) + { + ext2_log_trace("direct read failure @ sector %d (%d sector(s) long)\n", sec_start, sec_count); + errno = EIO; + return -1; + } + // Else read into a buffer and copy over only what was requested + } + else + { + + // Allocate a buffer to hold the read data + buffer = (u8*)mem_alloc(sec_count * fd->sectorSize); + if (!buffer) { + errno = ENOMEM; + return -1; + } + + // Read from the device + ext2_log_trace("buffered read from sector %d (%d sector(s) long)\n", sec_start, sec_count); + ext2_log_trace("count: %d sec_count:%d fd->sectorSize: %d )\n", (u32)count, (u32)sec_count,(u32)fd->sectorSize); + if (!device_gekko_io_readsectors(dev, sec_start, sec_count, buffer)) { + ext2_log_trace("buffered read failure @ sector %d (%d sector(s) long)\n", sec_start, sec_count); + mem_free(buffer); + errno = EIO; + return -1; + } + + // Copy what was requested to the destination buffer + memcpy(buf, buffer + buffer_offset, count); + mem_free(buffer); + + } + + return count; +} + +/** + * + */ +static s64 device_gekko_io_writebytes(io_channel dev, s64 offset, s64 count, const void *buf) +{ + ext2_log_trace("dev %p, offset %lli, count %lli\n", dev, offset, count); + + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + if(!(dev->flags & EXT2_FLAG_RW)) + return -1; + + // Get the device interface + const DISC_INTERFACE* interface = fd->interface; + if (!interface) { + errno = ENODEV; + return -1; + } + + if(count < 0 || offset < 0) { + errno = EROFS; + return -1; + } + + if(count == 0) + return 0; + + sec_t sec_start = (sec_t) fd->startSector; + sec_t sec_count = 1; + u32 buffer_offset = (u32) (offset % fd->sectorSize); + u8 *buffer = NULL; + + // Determine the range of sectors required for this write + if (offset > 0) { + sec_start += (sec_t) floor((f64) offset / (f64) fd->sectorSize); + } + if ((buffer_offset+count) > fd->sectorSize) { + sec_count = (sec_t) ceil((f64) (buffer_offset+count) / (f64) fd->sectorSize); + } + + // Don't write over the partitions limit + if(sec_start+sec_count > fd->startSector+fd->sectorCount) + { + ext2_log_trace("Error: write requested up to sector %lli while partition goes up to %lli\n", (s64) (sec_start+sec_count), (s64) (fd->startSector+fd->sectorCount)); + errno = EROFS; + return -1; + } + + // If this write happens to be on the sector boundaries then do the write straight to disc + if((buffer_offset == 0) && (count % fd->sectorSize == 0)) + { + // Write to the device + ext2_log_trace("direct write to sector %d (%d sector(s) long)\n", sec_start, sec_count); + if (!device_gekko_io_writesectors(dev, sec_start, sec_count, buf)) { + ext2_log_trace("direct write failure @ sector %d (%d sector(s) long)\n", sec_start, sec_count); + errno = EIO; + return -1; + } + // Else write from a buffer aligned to the sector boundaries + } + else + { + // Allocate a buffer to hold the write data + buffer = (u8 *) mem_alloc(sec_count * fd->sectorSize); + if (!buffer) { + errno = ENOMEM; + return -1; + } + // Read the first and last sectors of the buffer from disc (if required) + // NOTE: This is done because the data does not line up with the sector boundaries, + // we just read in the buffer edges where the data overlaps with the rest of the disc + if(buffer_offset != 0) + { + if (!device_gekko_io_readsectors(dev, sec_start, 1, buffer)) { + ext2_log_trace("read failure @ sector %d\n", sec_start); + mem_free(buffer); + errno = EIO; + return -1; + } + } + if((buffer_offset+count) % fd->sectorSize != 0) + { + if (!device_gekko_io_readsectors(dev, sec_start + sec_count - 1, 1, buffer + ((sec_count-1) * fd->sectorSize))) { + ext2_log_trace("read failure @ sector %d\n", sec_start + sec_count - 1); + mem_free(buffer); + errno = EIO; + return -1; + } + } + + // Copy the data into the write buffer + memcpy(buffer + buffer_offset, buf, count); + + // Write to the device + ext2_log_trace("buffered write to sector %d (%d sector(s) long)\n", sec_start, sec_count); + if (!device_gekko_io_writesectors(dev, sec_start, sec_count, buffer)) { + ext2_log_trace("buffered write failure @ sector %d\n", sec_start); + mem_free(buffer); + errno = EIO; + return -1; + } + + // Free the buffer + mem_free(buffer); + } + + return count; +} + + +/** + * Read function wrap for I/O manager + */ +static errcode_t device_gekko_io_read64(io_channel dev, unsigned long long block, int count, void *buf) +{ + gekko_fd *fd = DEV_FD(dev); + s64 size = (count < 0) ? -count : count * dev->block_size; + fd->io_stats.bytes_read += size; + ext2_loff_t location = ((ext2_loff_t) block * dev->block_size) + fd->offset; + + s64 read = device_gekko_io_readbytes(dev, location, size, buf); + if(read != size) + return EXT2_ET_SHORT_READ; + else if(read < 0) + return EXT2_ET_BLOCK_BITMAP_READ; + + return EXT2_ET_OK; +} + +static errcode_t device_gekko_io_read(io_channel dev, unsigned long block, int count, void *buf) +{ + return device_gekko_io_read64(dev, block, count, buf); +} + +/** + * Write function wrap for I/O manager + */ +static errcode_t device_gekko_io_write64(io_channel dev, unsigned long long block, int count, const void *buf) +{ + gekko_fd *fd = DEV_FD(dev); + s64 size = (count < 0) ? -count : count * dev->block_size; + fd->io_stats.bytes_written += size; + + ext2_loff_t location = ((ext2_loff_t) block * dev->block_size) + fd->offset; + + s64 writen = device_gekko_io_writebytes(dev, location, size, buf); + if(writen != size) + return EXT2_ET_SHORT_WRITE; + else if(writen < 0) + return EXT2_ET_BLOCK_BITMAP_WRITE; + + return EXT2_ET_OK; +} + +static errcode_t device_gekko_io_write(io_channel dev, unsigned long block, int count, const void *buf) +{ + return device_gekko_io_write64(dev, block, count, buf); +} + + +static bool device_gekko_io_readsectors(io_channel dev, sec_t sector, sec_t numSectors, void* buffer) +{ + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return false; + } + // Read the sectors from disc (or cache, if enabled) + if (fd->cache) + return cache_readSectors(fd->cache, sector, numSectors, buffer); + else + return fd->interface->readSectors(sector, numSectors, buffer); + + return false; +} + +static bool device_gekko_io_writesectors(io_channel dev, sec_t sector, sec_t numSectors, const void* buffer) +{ + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return false; + } + + // Write the sectors to disc (or cache, if enabled) + if (fd->cache) + return cache_writeSectors(fd->cache, sector, numSectors, buffer); + else + return fd->interface->writeSectors(sector, numSectors, buffer); + + return false; +} + +/** + * + */ +static errcode_t device_gekko_io_sync(io_channel dev) +{ + gekko_fd *fd = DEV_FD(dev); + ext2_log_trace("dev %p\n", dev); + + // Check that the device can be written to + if(!(dev->flags & EXT2_FLAG_RW)) + return -1; + + // Flush any sectors in the disc cache (if required) + if (fd->cache) { + if (!cache_flush(fd->cache)) { + errno = EIO; + return EXT2_ET_BLOCK_BITMAP_WRITE; + } + } + + return EXT2_ET_OK; +} + +/** + * + */ +static errcode_t device_gekko_io_stat(io_channel dev, io_stats *stats) +{ + EXT2_CHECK_MAGIC(dev, EXT2_ET_MAGIC_IO_CHANNEL); + gekko_fd *fd = DEV_FD(dev); + + if (stats) + *stats = &fd->io_stats; + + return EXT2_ET_OK; +} + +static errcode_t device_gekko_set_blksize(io_channel dev, int blksize) +{ + EXT2_CHECK_MAGIC(dev, EXT2_ET_MAGIC_IO_CHANNEL); + + if (dev->block_size != blksize) + { + dev->block_size = blksize; + + return device_gekko_io_sync(dev); + } + + return EXT2_ET_OK; +} + +/** + * Set options. + */ +static errcode_t device_gekko_set_option(io_channel dev, const char *option, const char *arg) +{ + unsigned long long tmp; + char *end; + + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + EXT2_CHECK_MAGIC(dev, EXT2_ET_MAGIC_IO_CHANNEL); + + if (!strcmp(option, "offset")) { + if (!arg) + return EXT2_ET_INVALID_ARGUMENT; + + tmp = strtoull(arg, &end, 0); + if (*end) + return EXT2_ET_INVALID_ARGUMENT; + fd->offset = tmp; + if (fd->offset < 0) + return EXT2_ET_INVALID_ARGUMENT; + return 0; + } + return EXT2_ET_INVALID_ARGUMENT; +} + +static errcode_t device_gekko_discard(io_channel channel, unsigned long long block, unsigned long long count) +{ + //!TODO as soon as it is implemented in the official lib + return 0; +} + +/** + * Device operations for working with gekko style devices and files. + */ +const struct struct_io_manager struct_gekko_io_manager = +{ + EXT2_ET_MAGIC_IO_MANAGER, + "Wii/GC I/O Manager", + device_gekko_io_open, + device_gekko_io_close, + device_gekko_set_blksize, + device_gekko_io_read, + device_gekko_io_write, + device_gekko_io_sync, + 0, + device_gekko_set_option, + device_gekko_io_stat, + device_gekko_io_read64, + device_gekko_io_write64, + device_gekko_discard, +}; + +io_manager gekko_io_manager = (io_manager) &struct_gekko_io_manager; diff --git a/portlibs/sources/libext2fs/source/gekko_io.h b/portlibs/sources/libext2fs/source/gekko_io.h new file mode 100644 index 00000000..16786c7c --- /dev/null +++ b/portlibs/sources/libext2fs/source/gekko_io.h @@ -0,0 +1,53 @@ +/* +* gekko_io.h - Platform specifics for device io. +* + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2010 Dimok +* +* 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; if not, write to the Free Software Foundation, +* Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA +*/ + +#ifndef _GEKKO_IO_H +#define _GEKKO_IO_H + +#include <gccore.h> +#include <ogc/disc_io.h> +#include "disc_cache.h" +#include "ext2fs.h" + +#define BYTES_PER_SECTOR 512 + +/** + * gekko_fd - Gekko device driver descriptor + */ +typedef struct _gekko_fd { + const DISC_INTERFACE* interface; /* Device disc interface */ + sec_t startSector; /* LBA of partition start */ + sec_t sectorCount; /* Total number of sectors in partition */ + u16 sectorSize; /* Device sector size (in bytes) */ + int flags; + int access_time; + ext2_loff_t offset; + struct struct_io_stats io_stats; + CACHE *cache; /* Cache */ + u32 cachePageCount; /* The number of pages in the cache */ + u32 cachePageSize; /* The number of sectors per cache page */ +} gekko_fd; + + +/* Gekko device driver i/o operations */ +extern io_manager gekko_io_manager; + +#endif /* _GEKKO_IO_H */ diff --git a/portlibs/sources/libext2fs/source/gen_bitmap.c b/portlibs/sources/libext2fs/source/gen_bitmap.c new file mode 100644 index 00000000..2ef1d826 --- /dev/null +++ b/portlibs/sources/libext2fs/source/gen_bitmap.c @@ -0,0 +1,560 @@ +/* + * gen_bitmap.c --- Generic (32-bit) bitmap routines + * + * Copyright (C) 2001 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" +#include "ext2fsP.h" + +struct ext2fs_struct_generic_bitmap { + errcode_t magic; + ext2_filsys fs; + __u32 start, end; + __u32 real_end; + char * description; + char * bitmap; + errcode_t base_error_code; + __u32 reserved[7]; +}; + +#define EXT2FS_IS_32_BITMAP(bmap) \ + (((bmap)->magic == EXT2_ET_MAGIC_GENERIC_BITMAP) || \ + ((bmap)->magic == EXT2_ET_MAGIC_BLOCK_BITMAP) || \ + ((bmap)->magic == EXT2_ET_MAGIC_INODE_BITMAP)) + +#define EXT2FS_IS_64_BITMAP(bmap) \ + (((bmap)->magic == EXT2_ET_MAGIC_GENERIC_BITMAP64) || \ + ((bmap)->magic == EXT2_ET_MAGIC_BLOCK_BITMAP64) || \ + ((bmap)->magic == EXT2_ET_MAGIC_INODE_BITMAP64)) + +/* + * Used by previously inlined function, so we have to export this and + * not change the function signature + */ +void ext2fs_warn_bitmap2(ext2fs_generic_bitmap bitmap, + int code, unsigned long arg) +{ +#ifndef OMIT_COM_ERR + if (bitmap->description) + com_err(0, bitmap->base_error_code+code, + "#%lu for %s", arg, bitmap->description); + else + com_err(0, bitmap->base_error_code + code, "#%lu", arg); +#endif +} + +static errcode_t check_magic(ext2fs_generic_bitmap bitmap) +{ + if (!bitmap || !((bitmap->magic == EXT2_ET_MAGIC_GENERIC_BITMAP) || + (bitmap->magic == EXT2_ET_MAGIC_INODE_BITMAP) || + (bitmap->magic == EXT2_ET_MAGIC_BLOCK_BITMAP))) + return EXT2_ET_MAGIC_GENERIC_BITMAP; + return 0; +} + +errcode_t ext2fs_make_generic_bitmap(errcode_t magic, ext2_filsys fs, + __u32 start, __u32 end, __u32 real_end, + const char *descr, char *init_map, + ext2fs_generic_bitmap *ret) +{ + ext2fs_generic_bitmap bitmap; + errcode_t retval; + size_t size; + + retval = ext2fs_get_mem(sizeof(struct ext2fs_struct_generic_bitmap), + &bitmap); + if (retval) + return retval; + + bitmap->magic = magic; + bitmap->fs = fs; + bitmap->start = start; + bitmap->end = end; + bitmap->real_end = real_end; + switch (magic) { + case EXT2_ET_MAGIC_INODE_BITMAP: + bitmap->base_error_code = EXT2_ET_BAD_INODE_MARK; + break; + case EXT2_ET_MAGIC_BLOCK_BITMAP: + bitmap->base_error_code = EXT2_ET_BAD_BLOCK_MARK; + break; + default: + bitmap->base_error_code = EXT2_ET_BAD_GENERIC_MARK; + } + if (descr) { + retval = ext2fs_get_mem(strlen(descr)+1, &bitmap->description); + if (retval) { + ext2fs_free_mem(&bitmap); + return retval; + } + strcpy(bitmap->description, descr); + } else + bitmap->description = 0; + + size = (size_t) (((bitmap->real_end - bitmap->start) / 8) + 1); + /* Round up to allow for the BT x86 instruction */ + size = (size + 7) & ~3; + retval = ext2fs_get_mem(size, &bitmap->bitmap); + if (retval) { + ext2fs_free_mem(&bitmap->description); + ext2fs_free_mem(&bitmap); + return retval; + } + + if (init_map) + memcpy(bitmap->bitmap, init_map, size); + else + memset(bitmap->bitmap, 0, size); + *ret = bitmap; + return 0; +} + +errcode_t ext2fs_allocate_generic_bitmap(__u32 start, + __u32 end, + __u32 real_end, + const char *descr, + ext2fs_generic_bitmap *ret) +{ + return ext2fs_make_generic_bitmap(EXT2_ET_MAGIC_GENERIC_BITMAP, 0, + start, end, real_end, descr, 0, ret); +} + +errcode_t ext2fs_copy_generic_bitmap(ext2fs_generic_bitmap src, + ext2fs_generic_bitmap *dest) +{ + return (ext2fs_make_generic_bitmap(src->magic, src->fs, + src->start, src->end, + src->real_end, + src->description, src->bitmap, + dest)); +} + +void ext2fs_free_generic_bitmap(ext2fs_inode_bitmap bitmap) +{ + if (check_magic(bitmap)) + return; + + bitmap->magic = 0; + if (bitmap->description) { + ext2fs_free_mem(&bitmap->description); + bitmap->description = 0; + } + if (bitmap->bitmap) { + ext2fs_free_mem(&bitmap->bitmap); + bitmap->bitmap = 0; + } + ext2fs_free_mem(&bitmap); +} + +int ext2fs_test_generic_bitmap(ext2fs_generic_bitmap bitmap, + blk_t bitno) +{ + if (!EXT2FS_IS_32_BITMAP(bitmap)) { + if (EXT2FS_IS_64_BITMAP(bitmap)) { + ext2fs_warn_bitmap32(bitmap, __func__); + return ext2fs_test_generic_bmap(bitmap, bitno); + } +#ifndef OMIT_COM_ERR + com_err(0, EXT2_ET_MAGIC_GENERIC_BITMAP, + "test_bitmap(%lu)", (unsigned long) bitno); + return 0; +#endif + } + + if ((bitno < bitmap->start) || (bitno > bitmap->end)) { + ext2fs_warn_bitmap2(bitmap, EXT2FS_TEST_ERROR, bitno); + return 0; + } + return ext2fs_test_bit(bitno - bitmap->start, bitmap->bitmap); +} + +int ext2fs_mark_generic_bitmap(ext2fs_generic_bitmap bitmap, + __u32 bitno) +{ + if (!EXT2FS_IS_32_BITMAP(bitmap)) { + if (EXT2FS_IS_64_BITMAP(bitmap)) { + ext2fs_warn_bitmap32(bitmap, __func__); + return ext2fs_mark_generic_bmap(bitmap, bitno); + } +#ifndef OMIT_COM_ERR + com_err(0, EXT2_ET_MAGIC_GENERIC_BITMAP, + "mark_bitmap(%lu)", (unsigned long) bitno); + return 0; +#endif + } + + if ((bitno < bitmap->start) || (bitno > bitmap->end)) { + ext2fs_warn_bitmap2(bitmap, EXT2FS_MARK_ERROR, bitno); + return 0; + } + return ext2fs_set_bit(bitno - bitmap->start, bitmap->bitmap); +} + +int ext2fs_unmark_generic_bitmap(ext2fs_generic_bitmap bitmap, + blk_t bitno) +{ + if (!EXT2FS_IS_32_BITMAP(bitmap)) { + if (EXT2FS_IS_64_BITMAP(bitmap)) { + ext2fs_warn_bitmap32(bitmap, __func__); + return ext2fs_unmark_generic_bmap(bitmap, bitno); + } +#ifndef OMIT_COM_ERR + com_err(0, EXT2_ET_MAGIC_GENERIC_BITMAP, + "mark_bitmap(%lu)", (unsigned long) bitno); + return 0; +#endif + } + + if ((bitno < bitmap->start) || (bitno > bitmap->end)) { + ext2fs_warn_bitmap2(bitmap, EXT2FS_UNMARK_ERROR, bitno); + return 0; + } + return ext2fs_clear_bit(bitno - bitmap->start, bitmap->bitmap); +} + +__u32 ext2fs_get_generic_bitmap_start(ext2fs_generic_bitmap bitmap) +{ + if (!EXT2FS_IS_32_BITMAP(bitmap)) { + if (EXT2FS_IS_64_BITMAP(bitmap)) { + ext2fs_warn_bitmap32(bitmap, __func__); + return ext2fs_get_generic_bmap_start(bitmap); + } +#ifndef OMIT_COM_ERR + com_err(0, EXT2_ET_MAGIC_GENERIC_BITMAP, + "get_bitmap_start"); + return 0; +#endif + } + + return bitmap->start; +} + +__u32 ext2fs_get_generic_bitmap_end(ext2fs_generic_bitmap bitmap) +{ + if (!EXT2FS_IS_32_BITMAP(bitmap)) { + if (EXT2FS_IS_64_BITMAP(bitmap)) { + ext2fs_warn_bitmap32(bitmap, __func__); + return ext2fs_get_generic_bmap_end(bitmap); + } +#ifndef OMIT_COM_ERR + com_err(0, EXT2_ET_MAGIC_GENERIC_BITMAP, + "get_bitmap_end"); + return 0; +#endif + } + return bitmap->end; +} + +void ext2fs_clear_generic_bitmap(ext2fs_generic_bitmap bitmap) +{ + if (!EXT2FS_IS_32_BITMAP(bitmap)) { + if (EXT2FS_IS_64_BITMAP(bitmap)) { + ext2fs_warn_bitmap32(bitmap, __func__); + ext2fs_clear_generic_bmap(bitmap); + return; + } +#ifndef OMIT_COM_ERR + com_err(0, EXT2_ET_MAGIC_GENERIC_BITMAP, + "clear_generic_bitmap"); + return; +#endif + } + + memset(bitmap->bitmap, 0, + (size_t) (((bitmap->real_end - bitmap->start) / 8) + 1)); +} + +errcode_t ext2fs_fudge_generic_bitmap_end(ext2fs_inode_bitmap bitmap, + errcode_t magic, errcode_t neq, + ext2_ino_t end, ext2_ino_t *oend) +{ + EXT2_CHECK_MAGIC(bitmap, magic); + + if (end > bitmap->real_end) + return neq; + if (oend) + *oend = bitmap->end; + bitmap->end = end; + return 0; +} + +errcode_t ext2fs_resize_generic_bitmap(errcode_t magic, + __u32 new_end, __u32 new_real_end, + ext2fs_generic_bitmap bmap) +{ + errcode_t retval; + size_t size, new_size; + __u32 bitno; + + if (!bmap || (bmap->magic != magic)) + return magic; + + /* + * If we're expanding the bitmap, make sure all of the new + * parts of the bitmap are zero. + */ + if (new_end > bmap->end) { + bitno = bmap->real_end; + if (bitno > new_end) + bitno = new_end; + for (; bitno > bmap->end; bitno--) + ext2fs_clear_bit(bitno - bmap->start, bmap->bitmap); + } + if (new_real_end == bmap->real_end) { + bmap->end = new_end; + return 0; + } + + size = ((bmap->real_end - bmap->start) / 8) + 1; + new_size = ((new_real_end - bmap->start) / 8) + 1; + + if (size != new_size) { + retval = ext2fs_resize_mem(size, new_size, &bmap->bitmap); + if (retval) + return retval; + } + if (new_size > size) + memset(bmap->bitmap + size, 0, new_size - size); + + bmap->end = new_end; + bmap->real_end = new_real_end; + return 0; +} + +errcode_t ext2fs_compare_generic_bitmap(errcode_t magic, errcode_t neq, + ext2fs_generic_bitmap bm1, + ext2fs_generic_bitmap bm2) +{ + blk_t i; + + if (!bm1 || bm1->magic != magic) + return magic; + if (!bm2 || bm2->magic != magic) + return magic; + + if ((bm1->start != bm2->start) || + (bm1->end != bm2->end) || + (memcmp(bm1->bitmap, bm2->bitmap, + (size_t) (bm1->end - bm1->start)/8))) + return neq; + + for (i = bm1->end - ((bm1->end - bm1->start) % 8); i <= bm1->end; i++) + if (ext2fs_fast_test_block_bitmap(bm1, i) != + ext2fs_fast_test_block_bitmap(bm2, i)) + return neq; + + return 0; +} + +void ext2fs_set_generic_bitmap_padding(ext2fs_generic_bitmap map) +{ + __u32 i, j; + + /* Protect loop from wrap-around if map->real_end is maxed */ + for (i=map->end+1, j = i - map->start; + i <= map->real_end && i > map->end; + i++, j++) + ext2fs_set_bit(j, map->bitmap); +} + +errcode_t ext2fs_get_generic_bitmap_range(ext2fs_generic_bitmap bmap, + errcode_t magic, + __u32 start, __u32 num, + void *out) +{ + if (!bmap || (bmap->magic != magic)) + return magic; + + if ((start < bmap->start) || (start+num-1 > bmap->real_end)) + return EXT2_ET_INVALID_ARGUMENT; + + memcpy(out, bmap->bitmap + (start >> 3), (num+7) >> 3); + return 0; +} + +errcode_t ext2fs_set_generic_bitmap_range(ext2fs_generic_bitmap bmap, + errcode_t magic, + __u32 start, __u32 num, + void *in) +{ + if (!bmap || (bmap->magic != magic)) + return magic; + + if ((start < bmap->start) || (start+num-1 > bmap->real_end)) + return EXT2_ET_INVALID_ARGUMENT; + + memcpy(bmap->bitmap + (start >> 3), in, (num+7) >> 3); + return 0; +} + +/* + * Compare @mem to zero buffer by 256 bytes. + * Return 1 if @mem is zeroed memory, otherwise return 0. + */ +int ext2fs_mem_is_zero(const char *mem, size_t len) +{ + static const char zero_buf[256]; + + while (len >= sizeof(zero_buf)) { + if (memcmp(mem, zero_buf, sizeof(zero_buf))) + return 0; + len -= sizeof(zero_buf); + mem += sizeof(zero_buf); + } + /* Deal with leftover bytes. */ + if (len) + return !memcmp(mem, zero_buf, len); + return 1; +} + +/* + * Return true if all of the bits in a specified range are clear + */ +static int ext2fs_test_clear_generic_bitmap_range(ext2fs_generic_bitmap bitmap, + unsigned int start, + unsigned int len) +{ + size_t start_byte, len_byte = len >> 3; + unsigned int start_bit, len_bit = len % 8; + int first_bit = 0; + int last_bit = 0; + int mark_count = 0; + int mark_bit = 0; + int i; + const char *ADDR = bitmap->bitmap; + + start -= bitmap->start; + start_byte = start >> 3; + start_bit = start % 8; + + if (start_bit != 0) { + /* + * The compared start block number or start inode number + * is not the first bit in a byte. + */ + mark_count = 8 - start_bit; + if (len < 8 - start_bit) { + mark_count = (int)len; + mark_bit = len + start_bit - 1; + } else + mark_bit = 7; + + for (i = mark_count; i > 0; i--, mark_bit--) + first_bit |= 1 << mark_bit; + + /* + * Compare blocks or inodes in the first byte. + * If there is any marked bit, this function returns 0. + */ + if (first_bit & ADDR[start_byte]) + return 0; + else if (len <= 8 - start_bit) + return 1; + + start_byte++; + len_bit = (len - mark_count) % 8; + len_byte = (len - mark_count) >> 3; + } + + /* + * The compared start block number or start inode number is + * the first bit in a byte. + */ + if (len_bit != 0) { + /* + * The compared end block number or end inode number is + * not the last bit in a byte. + */ + for (mark_bit = len_bit - 1; mark_bit >= 0; mark_bit--) + last_bit |= 1 << mark_bit; + + /* + * Compare blocks or inodes in the last byte. + * If there is any marked bit, this function returns 0. + */ + if (last_bit & ADDR[start_byte + len_byte]) + return 0; + else if (len_byte == 0) + return 1; + } + + /* Check whether all bytes are 0 */ + return ext2fs_mem_is_zero(ADDR + start_byte, len_byte); +} + +int ext2fs_test_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num) +{ + EXT2_CHECK_MAGIC(bitmap, EXT2_ET_MAGIC_BLOCK_BITMAP); + if ((block < bitmap->start) || (block+num-1 > bitmap->real_end)) { + ext2fs_warn_bitmap(EXT2_ET_BAD_BLOCK_TEST, + block, bitmap->description); + return 0; + } + return ext2fs_test_clear_generic_bitmap_range((ext2fs_generic_bitmap) + bitmap, block, num); +} + +int ext2fs_test_inode_bitmap_range(ext2fs_inode_bitmap bitmap, + ino_t inode, int num) +{ + EXT2_CHECK_MAGIC(bitmap, EXT2_ET_MAGIC_INODE_BITMAP); + if ((inode < bitmap->start) || (inode+num-1 > bitmap->real_end)) { + ext2fs_warn_bitmap(EXT2_ET_BAD_INODE_TEST, + inode, bitmap->description); + return 0; + } + return ext2fs_test_clear_generic_bitmap_range((ext2fs_generic_bitmap) + bitmap, inode, num); +} + +void ext2fs_mark_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num) +{ + int i; + + if ((block < bitmap->start) || (block+num-1 > bitmap->end)) { + ext2fs_warn_bitmap(EXT2_ET_BAD_BLOCK_MARK, block, + bitmap->description); + return; + } + for (i=0; i < num; i++) + ext2fs_fast_set_bit(block + i - bitmap->start, bitmap->bitmap); +} + +void ext2fs_unmark_block_bitmap_range(ext2fs_block_bitmap bitmap, + blk_t block, int num) +{ + int i; + + if ((block < bitmap->start) || (block+num-1 > bitmap->end)) { + ext2fs_warn_bitmap(EXT2_ET_BAD_BLOCK_UNMARK, block, + bitmap->description); + return; + } + for (i=0; i < num; i++) + ext2fs_fast_clear_bit(block + i - bitmap->start, + bitmap->bitmap); +} diff --git a/portlibs/sources/libext2fs/source/gen_bitmap64.c b/portlibs/sources/libext2fs/source/gen_bitmap64.c new file mode 100644 index 00000000..9e7b2983 --- /dev/null +++ b/portlibs/sources/libext2fs/source/gen_bitmap64.c @@ -0,0 +1,563 @@ +/* + * gen_bitmap64.c --- routines to read, write, and manipulate the new qinode and + * block bitmaps. + * + * Copyright (C) 2007, 2008 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Public + * License. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#include <errno.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fsP.h" +#include "bmap64.h" + +/* + * Design of 64-bit bitmaps + * + * In order maintain ABI compatibility with programs that don't + * understand about 64-bit blocks/inodes, + * ext2fs_allocate_inode_bitmap() and ext2fs_allocate_block_bitmap() + * will create old-style bitmaps unless the application passes the + * flag EXT2_FLAG_64BITS to ext2fs_open(). If this flag is + * passed, then we know the application has been recompiled, so we can + * use the new-style bitmaps. If it is not passed, we have to return + * an error if trying to open a filesystem which needs 64-bit bitmaps. + * + * The new bitmaps use a new set of structure magic numbers, so that + * both the old-style and new-style interfaces can identify which + * version of the data structure was used. Both the old-style and + * new-style interfaces will support either type of bitmap, although + * of course 64-bit operation will only be possible when both the + * new-style interface and the new-style bitmap are used. + * + * For example, the new bitmap interfaces will check the structure + * magic numbers and so will be able to detect old-stype bitmap. If + * they see an old-style bitmap, they will pass it to the gen_bitmap.c + * functions for handling. The same will be true for the old + * interfaces as well. + * + * The new-style interfaces will have several different back-end + * implementations, so we can support different encodings that are + * appropriate for different applications. In general the default + * should be whatever makes sense, and what the application/library + * will use. However, e2fsck may need specialized implementations for + * its own uses. For example, when doing parent directory pointer + * loop detections in pass 3, the bitmap will *always* be sparse, so + * e2fsck can request an encoding which is optimized for that. + */ + +static void warn_bitmap(ext2fs_generic_bitmap bitmap, + int code, __u64 arg) +{ +#ifndef OMIT_COM_ERR + if (bitmap->description) + com_err(0, bitmap->base_error_code+code, + "#%llu for %s", arg, bitmap->description); + else + com_err(0, bitmap->base_error_code + code, "#%llu", arg); +#endif +} + + +errcode_t ext2fs_alloc_generic_bmap(ext2_filsys fs, errcode_t magic, + int type, __u64 start, __u64 end, + __u64 real_end, + const char *descr, + ext2fs_generic_bitmap *ret) +{ + ext2fs_generic_bitmap bitmap; + struct ext2_bitmap_ops *ops; + errcode_t retval; + + switch (type) { + case EXT2FS_BMAP64_BITARRAY: + ops = &ext2fs_blkmap64_bitarray; + break; + default: + return EINVAL; + } + + retval = ext2fs_get_mem(sizeof(struct ext2fs_struct_generic_bitmap), + &bitmap); + if (retval) + return retval; + + /* XXX factor out, repeated in copy_bmap */ + bitmap->magic = magic; + bitmap->fs = fs; + bitmap->start = start; + bitmap->end = end; + bitmap->real_end = real_end; + bitmap->bitmap_ops = ops; + switch (magic) { + case EXT2_ET_MAGIC_INODE_BITMAP64: + bitmap->base_error_code = EXT2_ET_BAD_INODE_MARK; + break; + case EXT2_ET_MAGIC_BLOCK_BITMAP64: + bitmap->base_error_code = EXT2_ET_BAD_BLOCK_MARK; + break; + default: + bitmap->base_error_code = EXT2_ET_BAD_GENERIC_MARK; + } + if (descr) { + retval = ext2fs_get_mem(strlen(descr)+1, &bitmap->description); + if (retval) { + ext2fs_free_mem(&bitmap); + return retval; + } + strcpy(bitmap->description, descr); + } else + bitmap->description = 0; + + retval = bitmap->bitmap_ops->new_bmap(fs, bitmap); + if (retval) { + ext2fs_free_mem(&bitmap->description); + ext2fs_free_mem(&bitmap); + return retval; + } + + *ret = bitmap; + return 0; +} + +void ext2fs_free_generic_bmap(ext2fs_generic_bitmap bmap) +{ + if (!bmap) + return; + + if (EXT2FS_IS_32_BITMAP(bmap)) { + ext2fs_free_generic_bitmap(bmap); + return; + } + + if (!EXT2FS_IS_64_BITMAP(bmap)) + return; + + bmap->bitmap_ops->free_bmap(bmap); + + if (bmap->description) { + ext2fs_free_mem(&bmap->description); + bmap->description = 0; + } + bmap->magic = 0; + ext2fs_free_mem(&bmap); +} + +errcode_t ext2fs_copy_generic_bmap(ext2fs_generic_bitmap src, + ext2fs_generic_bitmap *dest) +{ + char *descr, *new_descr; + ext2fs_generic_bitmap new_bmap; + errcode_t retval; + + if (!src) + return EINVAL; + + if (EXT2FS_IS_32_BITMAP(src)) + return ext2fs_copy_generic_bitmap(src, dest); + + if (!EXT2FS_IS_64_BITMAP(src)) + return EINVAL; + + /* Allocate a new bitmap struct */ + retval = ext2fs_get_mem(sizeof(struct ext2fs_struct_generic_bitmap), + &new_bmap); + if (retval) + return retval; + + /* Copy all the high-level parts over */ + new_bmap->magic = src->magic; + new_bmap->fs = src->fs; + new_bmap->start = src->start; + new_bmap->end = src->end; + new_bmap->real_end = src->real_end; + new_bmap->bitmap_ops = src->bitmap_ops; + new_bmap->base_error_code = src->base_error_code; + + descr = src->description; + if (descr) { + retval = ext2fs_get_mem(strlen(descr)+1, &new_descr); + if (retval) { + ext2fs_free_mem(&new_bmap); + return retval; + } + strcpy(new_descr, descr); + new_bmap->description = new_descr; + } + + retval = src->bitmap_ops->copy_bmap(src, new_bmap); + if (retval) { + ext2fs_free_mem(&new_bmap->description); + ext2fs_free_mem(&new_bmap); + return retval; + } + + *dest = new_bmap; + + return 0; +} + +errcode_t ext2fs_resize_generic_bmap(ext2fs_generic_bitmap bmap, + __u64 new_end, + __u64 new_real_end) +{ + if (!bmap) + return EINVAL; + + if (EXT2FS_IS_32_BITMAP(bmap)) + return ext2fs_resize_generic_bitmap(bmap->magic, new_end, + new_real_end, bmap); + + if (!EXT2FS_IS_64_BITMAP(bmap)) + return EINVAL; + + return bmap->bitmap_ops->resize_bmap(bmap, new_end, new_real_end); +} + +errcode_t ext2fs_fudge_generic_bmap_end(ext2fs_generic_bitmap bitmap, + errcode_t neq, + __u64 end, __u64 *oend) +{ + if (!bitmap) + return EINVAL; + + if (EXT2FS_IS_32_BITMAP(bitmap)) { + ext2_ino_t tmp_oend; + int retval; + + retval = ext2fs_fudge_generic_bitmap_end(bitmap, bitmap->magic, + neq, end, &tmp_oend); + if (oend) + *oend = tmp_oend; + return retval; + } + + if (!EXT2FS_IS_64_BITMAP(bitmap)) + return EINVAL; + + if (end > bitmap->real_end) + return neq; + if (oend) + *oend = bitmap->end; + bitmap->end = end; + return 0; +} + +__u64 ext2fs_get_generic_bmap_start(ext2fs_generic_bitmap bitmap) +{ + if (!bitmap) + return EINVAL; + + if (EXT2FS_IS_32_BITMAP(bitmap)) + return ext2fs_get_generic_bitmap_start(bitmap); + + if (!EXT2FS_IS_64_BITMAP(bitmap)) + return EINVAL; + + return bitmap->start; +} + +__u64 ext2fs_get_generic_bmap_end(ext2fs_generic_bitmap bitmap) +{ + if (!bitmap) + return EINVAL; + + if (EXT2FS_IS_32_BITMAP(bitmap)) + return ext2fs_get_generic_bitmap_end(bitmap); + + if (!EXT2FS_IS_64_BITMAP(bitmap)) + return EINVAL; + + return bitmap->end; +} + +void ext2fs_clear_generic_bmap(ext2fs_generic_bitmap bitmap) +{ + if (EXT2FS_IS_32_BITMAP(bitmap)) + ext2fs_clear_generic_bitmap(bitmap); + + bitmap->bitmap_ops->clear_bmap (bitmap); +} + +int ext2fs_mark_generic_bmap(ext2fs_generic_bitmap bitmap, + __u64 arg) +{ + if (!bitmap) + return 0; + + if (EXT2FS_IS_32_BITMAP(bitmap)) { + if (arg & ~0xffffffffULL) { + ext2fs_warn_bitmap2(bitmap, + EXT2FS_MARK_ERROR, 0xffffffff); + return 0; + } + return ext2fs_mark_generic_bitmap(bitmap, arg); + } + + if (!EXT2FS_IS_64_BITMAP(bitmap)) + return 0; + + if ((arg < bitmap->start) || (arg > bitmap->end)) { + warn_bitmap(bitmap, EXT2FS_MARK_ERROR, arg); + return 0; + } + + return bitmap->bitmap_ops->mark_bmap(bitmap, arg); +} + +int ext2fs_unmark_generic_bmap(ext2fs_generic_bitmap bitmap, + __u64 arg) +{ + if (!bitmap) + return 0; + + if (EXT2FS_IS_32_BITMAP(bitmap)) { + if (arg & ~0xffffffffULL) { + ext2fs_warn_bitmap2(bitmap, EXT2FS_UNMARK_ERROR, + 0xffffffff); + return 0; + } + return ext2fs_unmark_generic_bitmap(bitmap, arg); + } + + if (!EXT2FS_IS_64_BITMAP(bitmap)) + return 0; + + if ((arg < bitmap->start) || (arg > bitmap->end)) { + warn_bitmap(bitmap, EXT2FS_UNMARK_ERROR, arg); + return 0; + } + + return bitmap->bitmap_ops->unmark_bmap(bitmap, arg); +} + +int ext2fs_test_generic_bmap(ext2fs_generic_bitmap bitmap, + __u64 arg) +{ + if (!bitmap) + return 0; + + if (EXT2FS_IS_32_BITMAP(bitmap)) { + if (arg & ~0xffffffffULL) { + ext2fs_warn_bitmap2(bitmap, EXT2FS_TEST_ERROR, + 0xffffffff); + return 0; + } + return ext2fs_test_generic_bitmap(bitmap, arg); + } + + if (!EXT2FS_IS_64_BITMAP(bitmap)) + return 0; + + if ((arg < bitmap->start) || (arg > bitmap->end)) { + warn_bitmap(bitmap, EXT2FS_TEST_ERROR, arg); + return 0; + } + + return bitmap->bitmap_ops->test_bmap(bitmap, arg); +} + +errcode_t ext2fs_set_generic_bmap_range(ext2fs_generic_bitmap bmap, + __u64 start, unsigned int num, + void *in) +{ + if (!bmap) + return EINVAL; + + if (EXT2FS_IS_32_BITMAP(bmap)) { + if ((start+num) & ~0xffffffffULL) { + ext2fs_warn_bitmap2(bmap, EXT2FS_UNMARK_ERROR, + 0xffffffff); + return EINVAL; + } + return ext2fs_set_generic_bitmap_range(bmap, bmap->magic, + start, num, in); + } + + if (!EXT2FS_IS_64_BITMAP(bmap)) + return EINVAL; + + return bmap->bitmap_ops->set_bmap_range(bmap, start, num, in); +} + +errcode_t ext2fs_get_generic_bmap_range(ext2fs_generic_bitmap bmap, + __u64 start, unsigned int num, + void *out) +{ + if (!bmap) + return EINVAL; + + if (EXT2FS_IS_32_BITMAP(bmap)) { + if ((start+num) & ~0xffffffffULL) { + ext2fs_warn_bitmap2(bmap, + EXT2FS_UNMARK_ERROR, 0xffffffff); + return EINVAL; + } + return ext2fs_get_generic_bitmap_range(bmap, bmap->magic, + start, num, out); + } + + if (!EXT2FS_IS_64_BITMAP(bmap)) + return EINVAL; + + return bmap->bitmap_ops->get_bmap_range(bmap, start, num, out); +} + +errcode_t ext2fs_compare_generic_bmap(errcode_t neq, + ext2fs_generic_bitmap bm1, + ext2fs_generic_bitmap bm2) +{ + blk64_t i; + + if (!bm1 || !bm2) + return EINVAL; + if (bm1->magic != bm2->magic) + return EINVAL; + + /* Now we know both bitmaps have the same magic */ + if (EXT2FS_IS_32_BITMAP(bm1)) + return ext2fs_compare_generic_bitmap(bm1->magic, neq, bm1, bm2); + + if (!EXT2FS_IS_64_BITMAP(bm1)) + return EINVAL; + + if ((bm1->start != bm2->start) || + (bm1->end != bm2->end)) + return neq; + + for (i = bm1->end - ((bm1->end - bm1->start) % 8); i <= bm1->end; i++) + if (ext2fs_test_generic_bmap(bm1, i) != + ext2fs_test_generic_bmap(bm2, i)) + return neq; + + return 0; +} + +void ext2fs_set_generic_bmap_padding(ext2fs_generic_bitmap bmap) +{ + __u64 start, num; + + if (EXT2FS_IS_32_BITMAP(bmap)) { + ext2fs_set_generic_bitmap_padding(bmap); + return; + } + + start = bmap->end + 1; + num = bmap->real_end - bmap->end; + bmap->bitmap_ops->mark_bmap_extent(bmap, start, num); + /* XXX ought to warn on error */ +} + +int ext2fs_test_block_bitmap_range2(ext2fs_block_bitmap bmap, + blk64_t block, unsigned int num) +{ + if (!bmap) + return EINVAL; + + if (num == 1) + return !ext2fs_test_generic_bmap((ext2fs_generic_bitmap) + bmap, block); + + if (EXT2FS_IS_32_BITMAP(bmap)) { + if ((block+num) & ~0xffffffffULL) { + ext2fs_warn_bitmap2((ext2fs_generic_bitmap) bmap, + EXT2FS_UNMARK_ERROR, 0xffffffff); + return EINVAL; + } + return ext2fs_test_block_bitmap_range( + (ext2fs_generic_bitmap) bmap, block, num); + } + + if (!EXT2FS_IS_64_BITMAP(bmap)) + return EINVAL; + + return bmap->bitmap_ops->test_clear_bmap_extent(bmap, block, num); +} + +void ext2fs_mark_block_bitmap_range2(ext2fs_block_bitmap bmap, + blk64_t block, unsigned int num) +{ + if (!bmap) + return; + + if (EXT2FS_IS_32_BITMAP(bmap)) { + if ((block+num) & ~0xffffffffULL) { + ext2fs_warn_bitmap2((ext2fs_generic_bitmap) bmap, + EXT2FS_UNMARK_ERROR, 0xffffffff); + return; + } + ext2fs_mark_block_bitmap_range((ext2fs_generic_bitmap) bmap, + block, num); + } + + if (!EXT2FS_IS_64_BITMAP(bmap)) + return; + + if ((block < bmap->start) || (block+num-1 > bmap->end)) { + ext2fs_warn_bitmap(EXT2_ET_BAD_BLOCK_MARK, block, + bmap->description); + return; + } + + bmap->bitmap_ops->mark_bmap_extent(bmap, block, num); +} + +void ext2fs_unmark_block_bitmap_range2(ext2fs_block_bitmap bmap, + blk64_t block, unsigned int num) +{ + if (!bmap) + return; + + if (EXT2FS_IS_32_BITMAP(bmap)) { + if ((block+num) & ~0xffffffffULL) { + ext2fs_warn_bitmap2((ext2fs_generic_bitmap) bmap, + EXT2FS_UNMARK_ERROR, 0xffffffff); + return; + } + ext2fs_unmark_block_bitmap_range((ext2fs_generic_bitmap) bmap, + block, num); + } + + if (!EXT2FS_IS_64_BITMAP(bmap)) + return; + + if ((block < bmap->start) || (block+num-1 > bmap->end)) { + ext2fs_warn_bitmap(EXT2_ET_BAD_BLOCK_UNMARK, block, + bmap->description); + return; + } + + bmap->bitmap_ops->unmark_bmap_extent(bmap, block, num); +} + +int ext2fs_warn_bitmap32(ext2fs_generic_bitmap bitmap, const char *func) +{ +#ifndef OMIT_COM_ERR + if (bitmap && bitmap->description) + com_err(0, EXT2_ET_MAGIC_GENERIC_BITMAP, + "called %s with 64-bit bitmap for %s", func, + bitmap->description); + else + com_err(0, EXT2_ET_MAGIC_GENERIC_BITMAP, + "called %s with 64-bit bitmap", func); +#endif + return 0; +} diff --git a/portlibs/sources/libext2fs/source/get_pathname.c b/portlibs/sources/libext2fs/source/get_pathname.c new file mode 100644 index 00000000..7ac14db2 --- /dev/null +++ b/portlibs/sources/libext2fs/source/get_pathname.c @@ -0,0 +1,160 @@ +/* + * get_pathname.c --- do directry/inode -> name translation + * + * Copyright (C) 1993, 1994, 1995 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +/* + * + * ext2fs_get_pathname(fs, dir, ino, name) + * + * This function translates takes two inode numbers into a + * string, placing the result in <name>. <dir> is the containing + * directory inode, and <ino> is the inode number itself. If + * <ino> is zero, then ext2fs_get_pathname will return pathname + * of the the directory <dir>. + * + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +struct get_pathname_struct { + ext2_ino_t search_ino; + ext2_ino_t parent; + char *name; + errcode_t errcode; +}; + +#ifdef __TURBOC__ + #pragma argsused +#endif +static int get_pathname_proc(struct ext2_dir_entry *dirent, + int offset EXT2FS_ATTR((unused)), + int blocksize EXT2FS_ATTR((unused)), + char *buf EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct get_pathname_struct *gp; + errcode_t retval; + + gp = (struct get_pathname_struct *) priv_data; + + if (((dirent->name_len & 0xFF) == 2) && + !strncmp(dirent->name, "..", 2)) + gp->parent = dirent->inode; + if (dirent->inode == gp->search_ino) { + retval = ext2fs_get_mem((dirent->name_len & 0xFF) + 1, + &gp->name); + if (retval) { + gp->errcode = retval; + return DIRENT_ABORT; + } + strncpy(gp->name, dirent->name, (dirent->name_len & 0xFF)); + gp->name[dirent->name_len & 0xFF] = '\0'; + return DIRENT_ABORT; + } + return 0; +} + +static errcode_t ext2fs_get_pathname_int(ext2_filsys fs, ext2_ino_t dir, + ext2_ino_t ino, int maxdepth, + char *buf, char **name) +{ + struct get_pathname_struct gp; + char *parent_name, *ret; + errcode_t retval; + + if (dir == ino) { + retval = ext2fs_get_mem(2, name); + if (retval) + return retval; + strcpy(*name, (dir == EXT2_ROOT_INO) ? "/" : "."); + return 0; + } + + if (!dir || (maxdepth < 0)) { + retval = ext2fs_get_mem(4, name); + if (retval) + return retval; + strcpy(*name, "..."); + return 0; + } + + gp.search_ino = ino; + gp.parent = 0; + gp.name = 0; + gp.errcode = 0; + + retval = ext2fs_dir_iterate(fs, dir, 0, buf, get_pathname_proc, &gp); + if (retval) + goto cleanup; + if (gp.errcode) { + retval = gp.errcode; + goto cleanup; + } + + retval = ext2fs_get_pathname_int(fs, gp.parent, dir, maxdepth-1, + buf, &parent_name); + if (retval) + goto cleanup; + if (!ino) { + *name = parent_name; + return 0; + } + + if (gp.name) + retval = ext2fs_get_mem(strlen(parent_name)+strlen(gp.name)+2, + &ret); + else + retval = ext2fs_get_mem(strlen(parent_name)+5, &ret); + if (retval) + goto cleanup; + + ret[0] = 0; + if (parent_name[1]) + strcat(ret, parent_name); + strcat(ret, "/"); + if (gp.name) + strcat(ret, gp.name); + else + strcat(ret, "???"); + *name = ret; + ext2fs_free_mem(&parent_name); + retval = 0; + +cleanup: + if (gp.name) + ext2fs_free_mem(&gp.name); + return retval; +} + +errcode_t ext2fs_get_pathname(ext2_filsys fs, ext2_ino_t dir, ext2_ino_t ino, + char **name) +{ + char *buf; + errcode_t retval; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + retval = ext2fs_get_mem(fs->blocksize, &buf); + if (retval) + return retval; + if (dir == ino) + ino = 0; + retval = ext2fs_get_pathname_int(fs, dir, ino, 32, buf, name); + ext2fs_free_mem(&buf); + return retval; + +} diff --git a/portlibs/sources/libext2fs/source/getsectsize.c b/portlibs/sources/libext2fs/source/getsectsize.c new file mode 100644 index 00000000..64f42a62 --- /dev/null +++ b/portlibs/sources/libext2fs/source/getsectsize.c @@ -0,0 +1,91 @@ +/* + * getsectsize.c --- get the sector size of a device. + * + * Copyright (C) 1995, 1995 Theodore Ts'o. + * Copyright (C) 2003 VMware, Inc. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#define _LARGEFILE_SOURCE +#define _LARGEFILE64_SOURCE + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#include <fcntl.h> +#ifdef HAVE_LINUX_FD_H +#include <sys/ioctl.h> +#include <linux/fd.h> +#endif + +#if defined(__linux__) && defined(_IO) +#if !defined(BLKSSZGET) +#define BLKSSZGET _IO(0x12,104)/* get block device sector size */ +#endif +#if !defined(BLKPBSZGET) +#define BLKPBSZGET _IO(0x12,123)/* get block physical sector size */ +#endif +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +/* + * Returns the logical sector size of a device + */ +errcode_t ext2fs_get_device_sectsize(const char *file, int *sectsize) +{ + int fd; + +#ifdef HAVE_OPEN64 + fd = open64(file, O_RDONLY); +#else + fd = open(file, O_RDONLY); +#endif + if (fd < 0) + return errno; + +#ifdef BLKSSZGET + if (ioctl(fd, BLKSSZGET, sectsize) >= 0) { + close(fd); + return 0; + } +#endif + *sectsize = 0; + close(fd); + return 0; +} + +/* + * Returns the physical sector size of a device + */ +errcode_t ext2fs_get_device_phys_sectsize(const char *file, int *sectsize) +{ + int fd; + +#ifdef HAVE_OPEN64 + fd = open64(file, O_RDONLY); +#else + fd = open(file, O_RDONLY); +#endif + if (fd < 0) + return errno; + +#ifdef BLKPBSZGET + if (ioctl(fd, BLKPBSZGET, sectsize) >= 0) { + close(fd); + return 0; + } +#endif + *sectsize = 0; + close(fd); + return 0; +} diff --git a/portlibs/sources/libext2fs/source/getsize.c b/portlibs/sources/libext2fs/source/getsize.c new file mode 100644 index 00000000..56ec4b69 --- /dev/null +++ b/portlibs/sources/libext2fs/source/getsize.c @@ -0,0 +1,311 @@ +/* + * getsize.c --- get the size of a partition. + * + * Copyright (C) 1995, 1995 Theodore Ts'o. + * Copyright (C) 2003 VMware, Inc. + * + * Windows version of ext2fs_get_device_size by Chris Li, VMware. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#define _LARGEFILE_SOURCE +#define _LARGEFILE64_SOURCE + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#include <fcntl.h> +#ifdef HAVE_SYS_IOCTL_H +#include <sys/ioctl.h> +#endif +#ifdef HAVE_LINUX_FD_H +#include <linux/fd.h> +#endif +#ifdef HAVE_SYS_DISKLABEL_H +#include <sys/disklabel.h> +#endif +#ifdef HAVE_SYS_DISK_H +#ifdef HAVE_SYS_QUEUE_H +#include <sys/queue.h> /* for LIST_HEAD */ +#endif +#include <sys/disk.h> +#endif +#ifdef __linux__ +#include <sys/utsname.h> +#endif +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#include <ctype.h> + +#if defined(__linux__) && defined(_IO) && !defined(BLKGETSIZE) +#define BLKGETSIZE _IO(0x12,96) /* return device size */ +#endif + +#if defined(__linux__) && defined(_IOR) && !defined(BLKGETSIZE64) +#define BLKGETSIZE64 _IOR(0x12,114,size_t) /* return device size in bytes (u64 *arg) */ +#endif + +#ifdef APPLE_DARWIN +#define BLKGETSIZE DKIOCGETBLOCKCOUNT32 +#endif /* APPLE_DARWIN */ + +#include "ext2_fs.h" +#include "ext2fs.h" + +#if defined(__CYGWIN__) || defined (WIN32) +#include "windows.h" +#include "winioctl.h" + +#if (_WIN32_WINNT >= 0x0500) +#define HAVE_GET_FILE_SIZE_EX 1 +#endif + +errcode_t ext2fs_get_device_size(const char *file, int blocksize, + blk_t *retblocks) +{ + HANDLE dev; + PARTITION_INFORMATION pi; + DISK_GEOMETRY gi; + DWORD retbytes; +#ifdef HAVE_GET_FILE_SIZE_EX + LARGE_INTEGER filesize; +#else + DWORD filesize; +#endif /* HAVE_GET_FILE_SIZE_EX */ + + dev = CreateFile(file, GENERIC_READ, + FILE_SHARE_READ | FILE_SHARE_WRITE , + NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL); + + if (dev == INVALID_HANDLE_VALUE) + return EBADF; + if (DeviceIoControl(dev, IOCTL_DISK_GET_PARTITION_INFO, + &pi, sizeof(PARTITION_INFORMATION), + &pi, sizeof(PARTITION_INFORMATION), + &retbytes, NULL)) { + + *retblocks = pi.PartitionLength.QuadPart / blocksize; + + } else if (DeviceIoControl(dev, IOCTL_DISK_GET_DRIVE_GEOMETRY, + &gi, sizeof(DISK_GEOMETRY), + &gi, sizeof(DISK_GEOMETRY), + &retbytes, NULL)) { + + *retblocks = gi.BytesPerSector * + gi.SectorsPerTrack * + gi.TracksPerCylinder * + gi.Cylinders.QuadPart / blocksize; + +#ifdef HAVE_GET_FILE_SIZE_EX + } else if (GetFileSizeEx(dev, &filesize)) { + *retblocks = filesize.QuadPart / blocksize; + } +#else + } else { + filesize = GetFileSize(dev, NULL); + if (INVALID_FILE_SIZE != filesize) { + *retblocks = filesize / blocksize; + } + } +#endif /* HAVE_GET_FILE_SIZE_EX */ + + CloseHandle(dev); + return 0; +} + +#else + +static int valid_offset (int fd, ext2_loff_t offset) +{ + char ch; + + if (ext2fs_llseek (fd, offset, 0) < 0) + return 0; + if (read (fd, &ch, 1) < 1) + return 0; + return 1; +} + +/* + * Returns the number of blocks in a partition + */ +errcode_t ext2fs_get_device_size2(const char *file, int blocksize, + blk64_t *retblocks) +{ + int fd, rc = 0; +#ifdef __linux__ + struct utsname ut; +#endif + unsigned long long size64; + ext2_loff_t high, low; +#ifdef FDGETPRM + struct floppy_struct this_floppy; +#endif +#ifdef HAVE_SYS_DISKLABEL_H + int part; + struct disklabel lab; + struct partition *pp; + char ch; +#endif /* HAVE_SYS_DISKLABEL_H */ + +#ifdef HAVE_OPEN64 + fd = open64(file, O_RDONLY); +#else + fd = open(file, O_RDONLY); +#endif + if (fd < 0) + return errno; + +#ifdef DKIOCGETBLOCKCOUNT /* For Apple Darwin */ + if (ioctl(fd, DKIOCGETBLOCKCOUNT, &size64) >= 0) { + *retblocks = size64 / (blocksize / 512); + goto out; + } +#endif + +#ifdef BLKGETSIZE64 +#ifdef __linux__ + if ((uname(&ut) == 0) && + ((ut.release[0] == '2') && (ut.release[1] == '.') && + (ut.release[2] < '6') && (ut.release[3] == '.'))) + valid_blkgetsize64 = 0; +#endif + if (valid_blkgetsize64 && + ioctl(fd, BLKGETSIZE64, &size64) >= 0) { + *retblocks = size64 / blocksize; + goto out; + } +#endif + +#ifdef BLKGETSIZE + if (ioctl(fd, BLKGETSIZE, &size) >= 0) { + *retblocks = size / (blocksize / 512); + goto out; + } +#endif + +#ifdef FDGETPRM + if (ioctl(fd, FDGETPRM, &this_floppy) >= 0) { + *retblocks = this_floppy.size / (blocksize / 512); + goto out; + } +#endif + +#ifdef HAVE_SYS_DISKLABEL_H +#if defined(DIOCGMEDIASIZE) + { + off_t ms; + u_int bs; + if (ioctl(fd, DIOCGMEDIASIZE, &ms) >= 0) { + *retblocks = ms / blocksize; + goto out; + } + } +#elif defined(DIOCGDINFO) + /* old disklabel interface */ + part = strlen(file) - 1; + if (part >= 0) { + ch = file[part]; + if (isdigit(ch)) + part = 0; + else if (ch >= 'a' && ch <= 'h') + part = ch - 'a'; + else + part = -1; + } + if (part >= 0 && (ioctl(fd, DIOCGDINFO, (char *)&lab) >= 0)) { + pp = &lab.d_partitions[part]; + if (pp->p_size) { + *retblocks = pp->p_size / (blocksize / 512); + goto out; + } + } +#endif /* defined(DIOCG*) */ +#endif /* HAVE_SYS_DISKLABEL_H */ + + { +#ifdef HAVE_FSTAT64 + struct stat64 st; + if (fstat64(fd, &st) == 0) +#else + struct stat st; + if (fstat(fd, &st) == 0) +#endif + if (S_ISREG(st.st_mode)) { + *retblocks = st.st_size / blocksize; + goto out; + } + } + + /* + * OK, we couldn't figure it out by using a specialized ioctl, + * which is generally the best way. So do binary search to + * find the size of the partition. + */ + low = 0; + for (high = 1024; valid_offset (fd, high); high *= 2) + low = high; + while (low < high - 1) + { + const ext2_loff_t mid = (low + high) / 2; + + if (valid_offset (fd, mid)) + low = mid; + else + high = mid; + } + valid_offset (fd, 0); + size64 = low + 1; + *retblocks = size64 / blocksize; +out: + close(fd); + return rc; +} + +errcode_t ext2fs_get_device_size(const char *file, int blocksize, + blk_t *retblocks) +{ + errcode_t retval; + blk64_t blocks; + + retval = ext2fs_get_device_size2(file, blocksize, &blocks); + if (retval) + return retval; + if (blocks >= (1ULL << 32)) + return EFBIG; + *retblocks = (blk_t) blocks; + return 0; +} + +#endif /* WIN32 */ + +#ifdef DEBUG +int main(int argc, char **argv) +{ + blk_t blocks; + int retval; + + if (argc < 2) { + fprintf(stderr, "Usage: %s device\n", argv[0]); + exit(1); + } + + retval = ext2fs_get_device_size(argv[1], 1024, &blocks); + if (retval) { + com_err(argv[0], retval, + "while calling ext2fs_get_device_size"); + exit(1); + } + printf("Device %s has %u 1k blocks.\n", argv[1], blocks); + exit(0); +} +#endif diff --git a/portlibs/sources/libext2fs/source/i_block.c b/portlibs/sources/libext2fs/source/i_block.c new file mode 100644 index 00000000..39d93eec --- /dev/null +++ b/portlibs/sources/libext2fs/source/i_block.c @@ -0,0 +1,89 @@ +/* + * i_block.c --- Manage the i_block field for i_blocks + * + * Copyright (C) 2008 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <time.h> +#include <string.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif +#include <errno.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +errcode_t ext2fs_iblk_add_blocks(ext2_filsys fs, struct ext2_inode *inode, + blk64_t num_blocks) +{ + unsigned long long b = inode->i_blocks; + + if (fs->super->s_feature_ro_compat & EXT4_FEATURE_RO_COMPAT_HUGE_FILE) + b += ((long long) inode->osd2.linux2.l_i_blocks_hi) << 32; + + if (!(fs->super->s_feature_ro_compat & + EXT4_FEATURE_RO_COMPAT_HUGE_FILE) || + !(inode->i_flags & EXT4_HUGE_FILE_FL)) + num_blocks *= fs->blocksize / 512; + + b += num_blocks; + + if (fs->super->s_feature_ro_compat & EXT4_FEATURE_RO_COMPAT_HUGE_FILE) + inode->osd2.linux2.l_i_blocks_hi = b >> 32; + else if (b > 0xFFFFFFFF) + return EOVERFLOW; + inode->i_blocks = b & 0xFFFFFFFF; + return 0; +} + +errcode_t ext2fs_iblk_sub_blocks(ext2_filsys fs, struct ext2_inode *inode, + blk64_t num_blocks) +{ + unsigned long long b = inode->i_blocks; + + if (fs->super->s_feature_ro_compat & EXT4_FEATURE_RO_COMPAT_HUGE_FILE) + b += ((long long) inode->osd2.linux2.l_i_blocks_hi) << 32; + + if (!(fs->super->s_feature_ro_compat & + EXT4_FEATURE_RO_COMPAT_HUGE_FILE) || + !(inode->i_flags & EXT4_HUGE_FILE_FL)) + num_blocks *= fs->blocksize / 512; + + if (num_blocks > b) + return EOVERFLOW; + + b -= num_blocks; + + if (fs->super->s_feature_ro_compat & EXT4_FEATURE_RO_COMPAT_HUGE_FILE) + inode->osd2.linux2.l_i_blocks_hi = b >> 32; + inode->i_blocks = b & 0xFFFFFFFF; + return 0; +} + +errcode_t ext2fs_iblk_set(ext2_filsys fs, struct ext2_inode *inode, blk64_t b) +{ + if (!(fs->super->s_feature_ro_compat & + EXT4_FEATURE_RO_COMPAT_HUGE_FILE) || + !(inode->i_flags & EXT4_HUGE_FILE_FL)) + b *= fs->blocksize / 512; + + inode->i_blocks = b & 0xFFFFFFFF; + if (fs->super->s_feature_ro_compat & EXT4_FEATURE_RO_COMPAT_HUGE_FILE) + inode->osd2.linux2.l_i_blocks_hi = b >> 32; + else if (b >> 32) + return EOVERFLOW; + return 0; +} diff --git a/portlibs/sources/libext2fs/source/icount.c b/portlibs/sources/libext2fs/source/icount.c new file mode 100644 index 00000000..43cc53e1 --- /dev/null +++ b/portlibs/sources/libext2fs/source/icount.c @@ -0,0 +1,862 @@ +/* + * icount.c --- an efficient inode count abstraction + * + * Copyright (C) 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <string.h> +#include <stdio.h> +#include <sys/stat.h> +#include <fcntl.h> +#include <errno.h> + +#include "ext2_fs.h" +#include "ext2fs.h" +#include "tdb.h" + +/* + * The data storage strategy used by icount relies on the observation + * that most inode counts are either zero (for non-allocated inodes), + * one (for most files), and only a few that are two or more + * (directories and files that are linked to more than one directory). + * + * Also, e2fsck tends to load the icount data sequentially. + * + * So, we use an inode bitmap to indicate which inodes have a count of + * one, and then use a sorted list to store the counts for inodes + * which are greater than one. + * + * We also use an optional bitmap to indicate which inodes are already + * in the sorted list, to speed up the use of this abstraction by + * e2fsck's pass 2. Pass 2 increments inode counts as it finds them, + * so this extra bitmap avoids searching the sorted list to see if a + * particular inode is on the sorted list already. + */ + +struct ext2_icount_el { + ext2_ino_t ino; + __u32 count; +}; + +struct ext2_icount { + errcode_t magic; + ext2fs_inode_bitmap single; + ext2fs_inode_bitmap multiple; + ext2_ino_t count; + ext2_ino_t size; + ext2_ino_t num_inodes; + ext2_ino_t cursor; + struct ext2_icount_el *list; + struct ext2_icount_el *last_lookup; + char *tdb_fn; + TDB_CONTEXT *tdb; +}; + +/* + * We now use a 32-bit counter field because it doesn't cost us + * anything extra for the in-memory data structure, due to alignment + * padding. But there's no point changing the interface if most of + * the time we only care if the number is bigger than 65,000 or not. + * So use the following translation function to return a 16-bit count. + */ +#define icount_16_xlate(x) (((x) > 65500) ? 65500 : (x)) + +void ext2fs_free_icount(ext2_icount_t icount) +{ + if (!icount) + return; + + icount->magic = 0; + if (icount->list) + ext2fs_free_mem(&icount->list); + if (icount->single) + ext2fs_free_inode_bitmap(icount->single); + if (icount->multiple) + ext2fs_free_inode_bitmap(icount->multiple); + if (icount->tdb) + tdb_close(icount->tdb); + if (icount->tdb_fn) { + unlink(icount->tdb_fn); + free(icount->tdb_fn); + } + + ext2fs_free_mem(&icount); +} + +static errcode_t alloc_icount(ext2_filsys fs, int flags, ext2_icount_t *ret) +{ + ext2_icount_t icount; + errcode_t retval; + + *ret = 0; + + retval = ext2fs_get_mem(sizeof(struct ext2_icount), &icount); + if (retval) + return retval; + memset(icount, 0, sizeof(struct ext2_icount)); + + retval = ext2fs_allocate_inode_bitmap(fs, 0, &icount->single); + if (retval) + goto errout; + + if (flags & EXT2_ICOUNT_OPT_INCREMENT) { + retval = ext2fs_allocate_inode_bitmap(fs, 0, + &icount->multiple); + if (retval) + goto errout; + } else + icount->multiple = 0; + + icount->magic = EXT2_ET_MAGIC_ICOUNT; + icount->num_inodes = fs->super->s_inodes_count; + + *ret = icount; + return 0; + +errout: + ext2fs_free_icount(icount); + return(retval); +} + +struct uuid { + __u32 time_low; + __u16 time_mid; + __u16 time_hi_and_version; + __u16 clock_seq; + __u8 node[6]; +}; + +static void unpack_uuid(void *in, struct uuid *uu) +{ + __u8 *ptr = in; + __u32 tmp; + + tmp = *ptr++; + tmp = (tmp << 8) | *ptr++; + tmp = (tmp << 8) | *ptr++; + tmp = (tmp << 8) | *ptr++; + uu->time_low = tmp; + + tmp = *ptr++; + tmp = (tmp << 8) | *ptr++; + uu->time_mid = tmp; + + tmp = *ptr++; + tmp = (tmp << 8) | *ptr++; + uu->time_hi_and_version = tmp; + + tmp = *ptr++; + tmp = (tmp << 8) | *ptr++; + uu->clock_seq = tmp; + + memcpy(uu->node, ptr, 6); +} + +static void uuid_unparse(void *uu, char *out) +{ + struct uuid uuid; + + unpack_uuid(uu, &uuid); + sprintf(out, + "%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x", + uuid.time_low, uuid.time_mid, uuid.time_hi_and_version, + uuid.clock_seq >> 8, uuid.clock_seq & 0xFF, + uuid.node[0], uuid.node[1], uuid.node[2], + uuid.node[3], uuid.node[4], uuid.node[5]); +} + +errcode_t ext2fs_create_icount_tdb(ext2_filsys fs, char *tdb_dir, + int flags, ext2_icount_t *ret) +{ + ext2_icount_t icount; + errcode_t retval; + char *fn, uuid[40]; + int fd; + + retval = alloc_icount(fs, flags, &icount); + if (retval) + return retval; + + retval = ext2fs_get_mem(strlen(tdb_dir) + 64, &fn); + if (retval) + goto errout; + uuid_unparse(fs->super->s_uuid, uuid); + sprintf(fn, "%s/%s-icount-XXXXXX", tdb_dir, uuid); + fd = mkstemp(fn); + + icount->tdb_fn = fn; + icount->tdb = tdb_open(fn, 0, TDB_CLEAR_IF_FIRST, + O_RDWR | O_CREAT | O_TRUNC, 0600); + if (icount->tdb) { + close(fd); + *ret = icount; + return 0; + } + + retval = errno; + close(fd); + +errout: + ext2fs_free_icount(icount); + return(retval); +} + +errcode_t ext2fs_create_icount2(ext2_filsys fs, int flags, unsigned int size, + ext2_icount_t hint, ext2_icount_t *ret) +{ + ext2_icount_t icount; + errcode_t retval; + size_t bytes; + ext2_ino_t i; + + if (hint) { + EXT2_CHECK_MAGIC(hint, EXT2_ET_MAGIC_ICOUNT); + if (hint->size > size) + size = (size_t) hint->size; + } + + retval = alloc_icount(fs, flags, &icount); + if (retval) + return retval; + + if (size) { + icount->size = size; + } else { + /* + * Figure out how many special case inode counts we will + * have. We know we will need one for each directory; + * we also need to reserve some extra room for file links + */ + retval = ext2fs_get_num_dirs(fs, &icount->size); + if (retval) + goto errout; + icount->size += fs->super->s_inodes_count / 50; + } + + bytes = (size_t) (icount->size * sizeof(struct ext2_icount_el)); +#if 0 + printf("Icount allocated %u entries, %d bytes.\n", + icount->size, bytes); +#endif + retval = ext2fs_get_array(icount->size, sizeof(struct ext2_icount_el), + &icount->list); + if (retval) + goto errout; + memset(icount->list, 0, bytes); + + icount->count = 0; + icount->cursor = 0; + + /* + * Populate the sorted list with those entries which were + * found in the hint icount (since those are ones which will + * likely need to be in the sorted list this time around). + */ + if (hint) { + for (i=0; i < hint->count; i++) + icount->list[i].ino = hint->list[i].ino; + icount->count = hint->count; + } + + *ret = icount; + return 0; + +errout: + ext2fs_free_icount(icount); + return(retval); +} + +errcode_t ext2fs_create_icount(ext2_filsys fs, int flags, + unsigned int size, + ext2_icount_t *ret) +{ + return ext2fs_create_icount2(fs, flags, size, 0, ret); +} + +/* + * insert_icount_el() --- Insert a new entry into the sorted list at a + * specified position. + */ +static struct ext2_icount_el *insert_icount_el(ext2_icount_t icount, + ext2_ino_t ino, int pos) +{ + struct ext2_icount_el *el; + errcode_t retval; + ext2_ino_t new_size = 0; + int num; + + if (icount->last_lookup && icount->last_lookup->ino == ino) + return icount->last_lookup; + + if (icount->count >= icount->size) { + if (icount->count) { + new_size = icount->list[(unsigned)icount->count-1].ino; + new_size = (ext2_ino_t) (icount->count * + ((float) icount->num_inodes / new_size)); + } + if (new_size < (icount->size + 100)) + new_size = icount->size + 100; +#if 0 + printf("Reallocating icount %u entries...\n", new_size); +#endif + retval = ext2fs_resize_mem((size_t) icount->size * + sizeof(struct ext2_icount_el), + (size_t) new_size * + sizeof(struct ext2_icount_el), + &icount->list); + if (retval) + return 0; + icount->size = new_size; + } + num = (int) icount->count - pos; + if (num < 0) + return 0; /* should never happen */ + if (num) { + memmove(&icount->list[pos+1], &icount->list[pos], + sizeof(struct ext2_icount_el) * num); + } + icount->count++; + el = &icount->list[pos]; + el->count = 0; + el->ino = ino; + icount->last_lookup = el; + return el; +} + +/* + * get_icount_el() --- given an inode number, try to find icount + * information in the sorted list. If the create flag is set, + * and we can't find an entry, create one in the sorted list. + */ +static struct ext2_icount_el *get_icount_el(ext2_icount_t icount, + ext2_ino_t ino, int create) +{ + float range; + int low, high, mid; + ext2_ino_t lowval, highval; + + if (!icount || !icount->list) + return 0; + + if (create && ((icount->count == 0) || + (ino > icount->list[(unsigned)icount->count-1].ino))) { + return insert_icount_el(icount, ino, (unsigned) icount->count); + } + if (icount->count == 0) + return 0; + + if (icount->cursor >= icount->count) + icount->cursor = 0; + if (ino == icount->list[icount->cursor].ino) + return &icount->list[icount->cursor++]; +#if 0 + printf("Non-cursor get_icount_el: %u\n", ino); +#endif + low = 0; + high = (int) icount->count-1; + while (low <= high) { +#if 0 + mid = (low+high)/2; +#else + if (low == high) + mid = low; + else { + /* Interpolate for efficiency */ + lowval = icount->list[low].ino; + highval = icount->list[high].ino; + + if (ino < lowval) + range = 0; + else if (ino > highval) + range = 1; + else { + range = ((float) (ino - lowval)) / + (highval - lowval); + if (range > 0.9) + range = 0.9; + if (range < 0.1) + range = 0.1; + } + mid = low + ((int) (range * (high-low))); + } +#endif + if (ino == icount->list[mid].ino) { + icount->cursor = mid+1; + return &icount->list[mid]; + } + if (ino < icount->list[mid].ino) + high = mid-1; + else + low = mid+1; + } + /* + * If we need to create a new entry, it should be right at + * low (where high will be left at low-1). + */ + if (create) + return insert_icount_el(icount, ino, low); + return 0; +} + +static errcode_t set_inode_count(ext2_icount_t icount, ext2_ino_t ino, + __u32 count) +{ + struct ext2_icount_el *el; + TDB_DATA key, data; + + if (icount->tdb) { + key.dptr = (unsigned char *) &ino; + key.dsize = sizeof(ext2_ino_t); + data.dptr = (unsigned char *) &count; + data.dsize = sizeof(__u32); + if (count) { + if (tdb_store(icount->tdb, key, data, TDB_REPLACE)) + return tdb_error(icount->tdb) + + EXT2_ET_TDB_SUCCESS; + } else { + if (tdb_delete(icount->tdb, key)) + return tdb_error(icount->tdb) + + EXT2_ET_TDB_SUCCESS; + } + return 0; + } + + el = get_icount_el(icount, ino, 1); + if (!el) + return EXT2_ET_NO_MEMORY; + + el->count = count; + return 0; +} + +static errcode_t get_inode_count(ext2_icount_t icount, ext2_ino_t ino, + __u32 *count) +{ + struct ext2_icount_el *el; + TDB_DATA key, data; + + if (icount->tdb) { + key.dptr = (unsigned char *) &ino; + key.dsize = sizeof(ext2_ino_t); + + data = tdb_fetch(icount->tdb, key); + if (data.dptr == NULL) { + *count = 0; + return tdb_error(icount->tdb) + EXT2_ET_TDB_SUCCESS; + } + + *count = *((__u32 *) data.dptr); + free(data.dptr); + return 0; + } + el = get_icount_el(icount, ino, 0); + if (!el) { + *count = 0; + return ENOENT; + } + + *count = el->count; + return 0; +} + +errcode_t ext2fs_icount_validate(ext2_icount_t icount, FILE *out) +{ + errcode_t ret = 0; + unsigned int i; + const char *bad = "bad icount"; + + EXT2_CHECK_MAGIC(icount, EXT2_ET_MAGIC_ICOUNT); + + if (icount->count > icount->size) { + fprintf(out, "%s: count > size\n", bad); + return EXT2_ET_INVALID_ARGUMENT; + } + for (i=1; i < icount->count; i++) { + if (icount->list[i-1].ino >= icount->list[i].ino) { + fprintf(out, "%s: list[%d].ino=%u, list[%d].ino=%u\n", + bad, i-1, icount->list[i-1].ino, + i, icount->list[i].ino); + ret = EXT2_ET_INVALID_ARGUMENT; + } + } + return ret; +} + +errcode_t ext2fs_icount_fetch(ext2_icount_t icount, ext2_ino_t ino, __u16 *ret) +{ + __u32 val; + EXT2_CHECK_MAGIC(icount, EXT2_ET_MAGIC_ICOUNT); + + if (!ino || (ino > icount->num_inodes)) + return EXT2_ET_INVALID_ARGUMENT; + + if (ext2fs_test_inode_bitmap2(icount->single, ino)) { + *ret = 1; + return 0; + } + if (icount->multiple && + !ext2fs_test_inode_bitmap2(icount->multiple, ino)) { + *ret = 0; + return 0; + } + get_inode_count(icount, ino, &val); + *ret = icount_16_xlate(val); + return 0; +} + +errcode_t ext2fs_icount_increment(ext2_icount_t icount, ext2_ino_t ino, + __u16 *ret) +{ + __u32 curr_value; + + EXT2_CHECK_MAGIC(icount, EXT2_ET_MAGIC_ICOUNT); + + if (!ino || (ino > icount->num_inodes)) + return EXT2_ET_INVALID_ARGUMENT; + + if (ext2fs_test_inode_bitmap2(icount->single, ino)) { + /* + * If the existing count is 1, then we know there is + * no entry in the list. + */ + if (set_inode_count(icount, ino, 2)) + return EXT2_ET_NO_MEMORY; + curr_value = 2; + ext2fs_unmark_inode_bitmap2(icount->single, ino); + } else if (icount->multiple) { + /* + * The count is either zero or greater than 1; if the + * inode is set in icount->multiple, then there should + * be an entry in the list, so we need to fix it. + */ + if (ext2fs_test_inode_bitmap2(icount->multiple, ino)) { + get_inode_count(icount, ino, &curr_value); + curr_value++; + if (set_inode_count(icount, ino, curr_value)) + return EXT2_ET_NO_MEMORY; + } else { + /* + * The count was zero; mark the single bitmap + * and return. + */ + ext2fs_mark_inode_bitmap2(icount->single, ino); + if (ret) + *ret = 1; + return 0; + } + } else { + /* + * The count is either zero or greater than 1; try to + * find an entry in the list to determine which. + */ + get_inode_count(icount, ino, &curr_value); + curr_value++; + if (set_inode_count(icount, ino, curr_value)) + return EXT2_ET_NO_MEMORY; + } + if (icount->multiple) + ext2fs_mark_inode_bitmap2(icount->multiple, ino); + if (ret) + *ret = icount_16_xlate(curr_value); + return 0; +} + +errcode_t ext2fs_icount_decrement(ext2_icount_t icount, ext2_ino_t ino, + __u16 *ret) +{ + __u32 curr_value; + + if (!ino || (ino > icount->num_inodes)) + return EXT2_ET_INVALID_ARGUMENT; + + EXT2_CHECK_MAGIC(icount, EXT2_ET_MAGIC_ICOUNT); + + if (ext2fs_test_inode_bitmap2(icount->single, ino)) { + ext2fs_unmark_inode_bitmap2(icount->single, ino); + if (icount->multiple) + ext2fs_unmark_inode_bitmap2(icount->multiple, ino); + else { + set_inode_count(icount, ino, 0); + } + if (ret) + *ret = 0; + return 0; + } + + if (icount->multiple && + !ext2fs_test_inode_bitmap2(icount->multiple, ino)) + return EXT2_ET_INVALID_ARGUMENT; + + get_inode_count(icount, ino, &curr_value); + if (!curr_value) + return EXT2_ET_INVALID_ARGUMENT; + curr_value--; + if (set_inode_count(icount, ino, curr_value)) + return EXT2_ET_NO_MEMORY; + + if (curr_value == 1) + ext2fs_mark_inode_bitmap2(icount->single, ino); + if ((curr_value == 0) && icount->multiple) + ext2fs_unmark_inode_bitmap2(icount->multiple, ino); + + if (ret) + *ret = icount_16_xlate(curr_value); + return 0; +} + +errcode_t ext2fs_icount_store(ext2_icount_t icount, ext2_ino_t ino, + __u16 count) +{ + if (!ino || (ino > icount->num_inodes)) + return EXT2_ET_INVALID_ARGUMENT; + + EXT2_CHECK_MAGIC(icount, EXT2_ET_MAGIC_ICOUNT); + + if (count == 1) { + ext2fs_mark_inode_bitmap2(icount->single, ino); + if (icount->multiple) + ext2fs_unmark_inode_bitmap2(icount->multiple, ino); + return 0; + } + if (count == 0) { + ext2fs_unmark_inode_bitmap2(icount->single, ino); + if (icount->multiple) { + /* + * If the icount->multiple bitmap is enabled, + * we can just clear both bitmaps and we're done + */ + ext2fs_unmark_inode_bitmap2(icount->multiple, ino); + } else + set_inode_count(icount, ino, 0); + return 0; + } + + if (set_inode_count(icount, ino, count)) + return EXT2_ET_NO_MEMORY; + ext2fs_unmark_inode_bitmap2(icount->single, ino); + if (icount->multiple) + ext2fs_mark_inode_bitmap2(icount->multiple, ino); + return 0; +} + +ext2_ino_t ext2fs_get_icount_size(ext2_icount_t icount) +{ + if (!icount || icount->magic != EXT2_ET_MAGIC_ICOUNT) + return 0; + + return icount->size; +} + +#ifdef DEBUG + +ext2_filsys test_fs; +ext2_icount_t icount; + +#define EXIT 0x00 +#define FETCH 0x01 +#define STORE 0x02 +#define INCREMENT 0x03 +#define DECREMENT 0x04 + +struct test_program { + int cmd; + ext2_ino_t ino; + __u16 arg; + __u16 expected; +}; + +struct test_program prog[] = { + { STORE, 42, 42, 42 }, + { STORE, 1, 1, 1 }, + { STORE, 2, 2, 2 }, + { STORE, 3, 3, 3 }, + { STORE, 10, 1, 1 }, + { STORE, 42, 0, 0 }, + { INCREMENT, 5, 0, 1 }, + { INCREMENT, 5, 0, 2 }, + { INCREMENT, 5, 0, 3 }, + { INCREMENT, 5, 0, 4 }, + { DECREMENT, 5, 0, 3 }, + { DECREMENT, 5, 0, 2 }, + { DECREMENT, 5, 0, 1 }, + { DECREMENT, 5, 0, 0 }, + { FETCH, 10, 0, 1 }, + { FETCH, 1, 0, 1 }, + { FETCH, 2, 0, 2 }, + { FETCH, 3, 0, 3 }, + { INCREMENT, 1, 0, 2 }, + { DECREMENT, 2, 0, 1 }, + { DECREMENT, 2, 0, 0 }, + { FETCH, 12, 0, 0 }, + { EXIT, 0, 0, 0 } +}; + +struct test_program extended[] = { + { STORE, 1, 1, 1 }, + { STORE, 2, 2, 2 }, + { STORE, 3, 3, 3 }, + { STORE, 4, 4, 4 }, + { STORE, 5, 5, 5 }, + { STORE, 6, 1, 1 }, + { STORE, 7, 2, 2 }, + { STORE, 8, 3, 3 }, + { STORE, 9, 4, 4 }, + { STORE, 10, 5, 5 }, + { STORE, 11, 1, 1 }, + { STORE, 12, 2, 2 }, + { STORE, 13, 3, 3 }, + { STORE, 14, 4, 4 }, + { STORE, 15, 5, 5 }, + { STORE, 16, 1, 1 }, + { STORE, 17, 2, 2 }, + { STORE, 18, 3, 3 }, + { STORE, 19, 4, 4 }, + { STORE, 20, 5, 5 }, + { STORE, 21, 1, 1 }, + { STORE, 22, 2, 2 }, + { STORE, 23, 3, 3 }, + { STORE, 24, 4, 4 }, + { STORE, 25, 5, 5 }, + { STORE, 26, 1, 1 }, + { STORE, 27, 2, 2 }, + { STORE, 28, 3, 3 }, + { STORE, 29, 4, 4 }, + { STORE, 30, 5, 5 }, + { EXIT, 0, 0, 0 } +}; + +/* + * Setup the variables for doing the inode scan test. + */ +static void setup(void) +{ + errcode_t retval; + struct ext2_super_block param; + + initialize_ext2_error_table(); + + memset(¶m, 0, sizeof(param)); + ext2fs_blocks_count_set(¶m, 12000); + + retval = ext2fs_initialize("test fs", EXT2_FLAG_64BITS, ¶m, + test_io_manager, &test_fs); + if (retval) { + com_err("setup", retval, + "while initializing filesystem"); + exit(1); + } + retval = ext2fs_allocate_tables(test_fs); + if (retval) { + com_err("setup", retval, + "while allocating tables for test filesystem"); + exit(1); + } +} + +int run_test(int flags, int size, char *dir, struct test_program *prog) +{ + errcode_t retval; + ext2_icount_t icount; + struct test_program *pc; + __u16 result; + int problem = 0; + + if (dir) { + retval = ext2fs_create_icount_tdb(test_fs, dir, + flags, &icount); + if (retval) { + com_err("run_test", retval, + "while creating icount using tdb"); + exit(1); + } + } else { + retval = ext2fs_create_icount2(test_fs, flags, size, 0, + &icount); + if (retval) { + com_err("run_test", retval, "while creating icount"); + exit(1); + } + } + for (pc = prog; pc->cmd != EXIT; pc++) { + switch (pc->cmd) { + case FETCH: + printf("icount_fetch(%u) = ", pc->ino); + break; + case STORE: + retval = ext2fs_icount_store(icount, pc->ino, pc->arg); + if (retval) { + com_err("run_test", retval, + "while calling icount_store"); + exit(1); + } + printf("icount_store(%u, %u) = ", pc->ino, pc->arg); + break; + case INCREMENT: + retval = ext2fs_icount_increment(icount, pc->ino, 0); + if (retval) { + com_err("run_test", retval, + "while calling icount_increment"); + exit(1); + } + printf("icount_increment(%u) = ", pc->ino); + break; + case DECREMENT: + retval = ext2fs_icount_decrement(icount, pc->ino, 0); + if (retval) { + com_err("run_test", retval, + "while calling icount_decrement"); + exit(1); + } + printf("icount_decrement(%u) = ", pc->ino); + break; + } + retval = ext2fs_icount_fetch(icount, pc->ino, &result); + if (retval) { + com_err("run_test", retval, + "while calling icount_fetch"); + exit(1); + } + printf("%u (%s)\n", result, (result == pc->expected) ? + "OK" : "NOT OK"); + if (result != pc->expected) + problem++; + } + printf("icount size is %u\n", ext2fs_get_icount_size(icount)); + retval = ext2fs_icount_validate(icount, stdout); + if (retval) { + com_err("run_test", retval, "while calling icount_validate"); + exit(1); + } + ext2fs_free_icount(icount); + return problem; +} + + +int main(int argc, char **argv) +{ + int failed = 0; + + setup(); + printf("Standard icount run:\n"); + failed += run_test(0, 0, 0, prog); + printf("\nMultiple bitmap test:\n"); + failed += run_test(EXT2_ICOUNT_OPT_INCREMENT, 0, 0, prog); + printf("\nResizing icount:\n"); + failed += run_test(0, 3, 0, extended); + printf("\nStandard icount run with tdb:\n"); + failed += run_test(0, 0, ".", prog); + printf("\nMultiple bitmap test with tdb:\n"); + failed += run_test(EXT2_ICOUNT_OPT_INCREMENT, 0, ".", prog); + if (failed) + printf("FAILED!\n"); + return failed; +} +#endif diff --git a/portlibs/sources/libext2fs/source/imager.c b/portlibs/sources/libext2fs/source/imager.c new file mode 100644 index 00000000..5a6d0b95 --- /dev/null +++ b/portlibs/sources/libext2fs/source/imager.c @@ -0,0 +1,408 @@ +/* + * image.c --- writes out the critical parts of the filesystem as a + * flat file. + * + * Copyright (C) 2000 Theodore Ts'o. + * + * Note: this uses the POSIX IO interfaces, unlike most of the other + * functions in this library. So sue me. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +#ifndef HAVE_TYPE_SSIZE_T +typedef int ssize_t; +#endif + +/* + * This function returns 1 if the specified block is all zeros + */ +static int check_zero_block(char *buf, int blocksize) +{ + char *cp = buf; + int left = blocksize; + + while (left > 0) { + if (*cp++) + return 0; + left--; + } + return 1; +} + +/* + * Write the inode table out as a single block. + */ +#define BUF_BLOCKS 32 + +errcode_t ext2fs_image_inode_write(ext2_filsys fs, int fd, int flags) +{ + unsigned int group, left, c, d; + char *buf, *cp; + blk64_t blk; + ssize_t actual; + errcode_t retval; + + buf = malloc(fs->blocksize * BUF_BLOCKS); + if (!buf) + return ENOMEM; + + for (group = 0; group < fs->group_desc_count; group++) { + blk = ext2fs_inode_table_loc(fs, (unsigned)group); + if (!blk) { + retval = EXT2_ET_MISSING_INODE_TABLE; + goto errout; + } + left = fs->inode_blocks_per_group; + while (left) { + c = BUF_BLOCKS; + if (c > left) + c = left; + retval = io_channel_read_blk64(fs->io, blk, c, buf); + if (retval) + goto errout; + cp = buf; + while (c) { + if (!(flags & IMAGER_FLAG_SPARSEWRITE)) { + d = c; + goto skip_sparse; + } + /* Skip zero blocks */ + if (check_zero_block(cp, fs->blocksize)) { + c--; + blk++; + left--; + cp += fs->blocksize; + lseek(fd, fs->blocksize, SEEK_CUR); + continue; + } + /* Find non-zero blocks */ + for (d=1; d < c; d++) { + if (check_zero_block(cp + d*fs->blocksize, fs->blocksize)) + break; + } + skip_sparse: + actual = write(fd, cp, fs->blocksize * d); + if (actual == -1) { + retval = errno; + goto errout; + } + if (actual != (ssize_t) (fs->blocksize * d)) { + retval = EXT2_ET_SHORT_WRITE; + goto errout; + } + blk += d; + left -= d; + cp += fs->blocksize * d; + c -= d; + } + } + } + retval = 0; + +errout: + free(buf); + return retval; +} + +/* + * Read in the inode table and stuff it into place + */ +errcode_t ext2fs_image_inode_read(ext2_filsys fs, int fd, + int flags EXT2FS_ATTR((unused))) +{ + unsigned int group, c, left; + char *buf; + blk64_t blk; + ssize_t actual; + errcode_t retval; + + buf = malloc(fs->blocksize * BUF_BLOCKS); + if (!buf) + return ENOMEM; + + for (group = 0; group < fs->group_desc_count; group++) { + blk = ext2fs_inode_table_loc(fs, (unsigned)group); + if (!blk) { + retval = EXT2_ET_MISSING_INODE_TABLE; + goto errout; + } + left = fs->inode_blocks_per_group; + while (left) { + c = BUF_BLOCKS; + if (c > left) + c = left; + actual = read(fd, buf, fs->blocksize * c); + if (actual == -1) { + retval = errno; + goto errout; + } + if (actual != (ssize_t) (fs->blocksize * c)) { + retval = EXT2_ET_SHORT_READ; + goto errout; + } + retval = io_channel_write_blk64(fs->io, blk, c, buf); + if (retval) + goto errout; + + blk += c; + left -= c; + } + } + retval = ext2fs_flush_icache(fs); + +errout: + free(buf); + return retval; +} + +/* + * Write out superblock and group descriptors + */ +errcode_t ext2fs_image_super_write(ext2_filsys fs, int fd, + int flags EXT2FS_ATTR((unused))) +{ + char *buf, *cp; + ssize_t actual; + errcode_t retval; + + buf = malloc(fs->blocksize); + if (!buf) + return ENOMEM; + + /* + * Write out the superblock + */ + memset(buf, 0, fs->blocksize); + memcpy(buf, fs->super, SUPERBLOCK_SIZE); + actual = write(fd, buf, fs->blocksize); + if (actual == -1) { + retval = errno; + goto errout; + } + if (actual != (ssize_t) fs->blocksize) { + retval = EXT2_ET_SHORT_WRITE; + goto errout; + } + + /* + * Now write out the block group descriptors + */ + cp = (char *) fs->group_desc; + actual = write(fd, cp, fs->blocksize * fs->desc_blocks); + if (actual == -1) { + retval = errno; + goto errout; + } + if (actual != (ssize_t) (fs->blocksize * fs->desc_blocks)) { + retval = EXT2_ET_SHORT_WRITE; + goto errout; + } + + retval = 0; + +errout: + free(buf); + return retval; +} + +/* + * Read the superblock and group descriptors and overwrite them. + */ +errcode_t ext2fs_image_super_read(ext2_filsys fs, int fd, + int flags EXT2FS_ATTR((unused))) +{ + char *buf; + ssize_t actual, size; + errcode_t retval; + + size = fs->blocksize * (fs->group_desc_count + 1); + buf = malloc(size); + if (!buf) + return ENOMEM; + + /* + * Read it all in. + */ + actual = read(fd, buf, size); + if (actual == -1) { + retval = errno; + goto errout; + } + if (actual != size) { + retval = EXT2_ET_SHORT_READ; + goto errout; + } + + /* + * Now copy in the superblock and group descriptors + */ + memcpy(fs->super, buf, SUPERBLOCK_SIZE); + + memcpy(fs->group_desc, buf + fs->blocksize, + fs->blocksize * fs->group_desc_count); + + retval = 0; + +errout: + free(buf); + return retval; +} + +/* + * Write the block/inode bitmaps. + */ +errcode_t ext2fs_image_bitmap_write(ext2_filsys fs, int fd, int flags) +{ + ext2fs_generic_bitmap bmap; + errcode_t err, retval; + ssize_t actual; + __u32 itr, cnt, size; + int c, total_size; + char buf[1024]; + + if (flags & IMAGER_FLAG_INODEMAP) { + if (!fs->inode_map) { + retval = ext2fs_read_inode_bitmap(fs); + if (retval) + return retval; + } + bmap = fs->inode_map; + err = EXT2_ET_MAGIC_INODE_BITMAP; + itr = 1; + cnt = EXT2_INODES_PER_GROUP(fs->super) * fs->group_desc_count; + size = (EXT2_INODES_PER_GROUP(fs->super) / 8); + } else { + if (!fs->block_map) { + retval = ext2fs_read_block_bitmap(fs); + if (retval) + return retval; + } + bmap = fs->block_map; + err = EXT2_ET_MAGIC_BLOCK_BITMAP; + itr = fs->super->s_first_data_block; + cnt = EXT2_BLOCKS_PER_GROUP(fs->super) * fs->group_desc_count; + size = EXT2_BLOCKS_PER_GROUP(fs->super) / 8; + } + total_size = size * fs->group_desc_count; + + while (cnt > 0) { + size = sizeof(buf); + if (size > (cnt >> 3)) + size = (cnt >> 3); + + retval = ext2fs_get_generic_bmap_range(bmap, itr, + size << 3, buf); + if (retval) + return retval; + + actual = write(fd, buf, size); + if (actual == -1) + return errno; + if (actual != (int) size) + return EXT2_ET_SHORT_READ; + + itr += size << 3; + cnt -= size << 3; + } + + size = total_size % fs->blocksize; + memset(buf, 0, sizeof(buf)); + if (size) { + size = fs->blocksize - size; + while (size) { + c = size; + if (c > (int) sizeof(buf)) + c = sizeof(buf); + actual = write(fd, buf, c); + if (actual == -1) + return errno; + if (actual != c) + return EXT2_ET_SHORT_WRITE; + size -= c; + } + } + return 0; +} + + +/* + * Read the block/inode bitmaps. + */ +errcode_t ext2fs_image_bitmap_read(ext2_filsys fs, int fd, int flags) +{ + ext2fs_generic_bitmap bmap; + errcode_t err, retval; + __u32 itr, cnt; + char buf[1024]; + unsigned int size; + ssize_t actual; + + if (flags & IMAGER_FLAG_INODEMAP) { + if (!fs->inode_map) { + retval = ext2fs_read_inode_bitmap(fs); + if (retval) + return retval; + } + bmap = fs->inode_map; + err = EXT2_ET_MAGIC_INODE_BITMAP; + itr = 1; + cnt = EXT2_INODES_PER_GROUP(fs->super) * fs->group_desc_count; + size = (EXT2_INODES_PER_GROUP(fs->super) / 8); + } else { + if (!fs->block_map) { + retval = ext2fs_read_block_bitmap(fs); + if (retval) + return retval; + } + bmap = fs->block_map; + err = EXT2_ET_MAGIC_BLOCK_BITMAP; + itr = fs->super->s_first_data_block; + cnt = EXT2_BLOCKS_PER_GROUP(fs->super) * fs->group_desc_count; + size = EXT2_BLOCKS_PER_GROUP(fs->super) / 8; + } + + while (cnt > 0) { + size = sizeof(buf); + if (size > (cnt >> 3)) + size = (cnt >> 3); + + actual = read(fd, buf, size); + if (actual == -1) + return errno; + if (actual != (int) size) + return EXT2_ET_SHORT_READ; + + retval = ext2fs_set_generic_bmap_range(bmap, itr, + size << 3, buf); + if (retval) + return retval; + + itr += size << 3; + cnt -= size << 3; + } + return 0; +} diff --git a/portlibs/sources/libext2fs/source/ind_block.c b/portlibs/sources/libext2fs/source/ind_block.c new file mode 100644 index 00000000..722d3bdc --- /dev/null +++ b/portlibs/sources/libext2fs/source/ind_block.c @@ -0,0 +1,66 @@ +/* + * ind_block.c --- indirect block I/O routines + * + * Copyright (C) 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, + * 2001, 2002, 2003, 2004, 2005 by Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +errcode_t ext2fs_read_ind_block(ext2_filsys fs, blk_t blk, void *buf) +{ + errcode_t retval; +#ifdef WORDS_BIGENDIAN + blk_t *block_nr; + int i; + int limit = fs->blocksize >> 2; +#endif + + if ((fs->flags & EXT2_FLAG_IMAGE_FILE) && + (fs->io != fs->image_io)) + memset(buf, 0, fs->blocksize); + else { + retval = io_channel_read_blk(fs->io, blk, 1, buf); + if (retval) + return retval; + } +#ifdef WORDS_BIGENDIAN + block_nr = (blk_t *) buf; + for (i = 0; i < limit; i++, block_nr++) + *block_nr = ext2fs_swab32(*block_nr); +#endif + return 0; +} + +errcode_t ext2fs_write_ind_block(ext2_filsys fs, blk_t blk, void *buf) +{ +#ifdef WORDS_BIGENDIAN + blk_t *block_nr; + int i; + int limit = fs->blocksize >> 2; +#endif + + if (fs->flags & EXT2_FLAG_IMAGE_FILE) + return 0; + +#ifdef WORDS_BIGENDIAN + block_nr = (blk_t *) buf; + for (i = 0; i < limit; i++, block_nr++) + *block_nr = ext2fs_swab32(*block_nr); +#endif + return io_channel_write_blk(fs->io, blk, 1, buf); +} + + diff --git a/portlibs/sources/libext2fs/source/initialize.c b/portlibs/sources/libext2fs/source/initialize.c new file mode 100644 index 00000000..4706773a --- /dev/null +++ b/portlibs/sources/libext2fs/source/initialize.c @@ -0,0 +1,447 @@ +/* + * initialize.c --- initialize a filesystem handle given superblock + * parameters. Used by mke2fs when initializing a filesystem. + * + * Copyright (C) 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +#if defined(__linux__) && defined(EXT2_OS_LINUX) +#define CREATOR_OS EXT2_OS_LINUX +#else +#if defined(__GNU__) && defined(EXT2_OS_HURD) +#define CREATOR_OS EXT2_OS_HURD +#else +#if defined(__FreeBSD__) && defined(EXT2_OS_FREEBSD) +#define CREATOR_OS EXT2_OS_FREEBSD +#else +#if defined(LITES) && defined(EXT2_OS_LITES) +#define CREATOR_OS EXT2_OS_LITES +#else +#define CREATOR_OS EXT2_OS_LINUX /* by default */ +#endif /* defined(LITES) && defined(EXT2_OS_LITES) */ +#endif /* defined(__FreeBSD__) && defined(EXT2_OS_FREEBSD) */ +#endif /* defined(__GNU__) && defined(EXT2_OS_HURD) */ +#endif /* defined(__linux__) && defined(EXT2_OS_LINUX) */ + +/* + * Calculate the number of GDT blocks to reserve for online filesystem growth. + * The absolute maximum number of GDT blocks we can reserve is determined by + * the number of block pointers that can fit into a single block. + */ +static unsigned int calc_reserved_gdt_blocks(ext2_filsys fs) +{ + struct ext2_super_block *sb = fs->super; + unsigned long bpg = sb->s_blocks_per_group; + unsigned int gdpb = EXT2_DESC_PER_BLOCK(sb); + unsigned long max_blocks = 0xffffffff; + unsigned long rsv_groups; + unsigned int rsv_gdb; + + /* We set it at 1024x the current filesystem size, or + * the upper block count limit (2^32), whichever is lower. + */ + if (ext2fs_blocks_count(sb) < max_blocks / 1024) + max_blocks = ext2fs_blocks_count(sb) * 1024; + /* + * ext2fs_div64_ceil() is unnecessary because max_blocks is + * max _GDT_ blocks, which is limited to 32 bits. + */ + rsv_groups = ext2fs_div_ceil(max_blocks - sb->s_first_data_block, bpg); + rsv_gdb = ext2fs_div_ceil(rsv_groups, gdpb) - fs->desc_blocks; + if (rsv_gdb > EXT2_ADDR_PER_BLOCK(sb)) + rsv_gdb = EXT2_ADDR_PER_BLOCK(sb); +#ifdef RES_GDT_DEBUG + printf("max_blocks %lu, rsv_groups = %lu, rsv_gdb = %u\n", + max_blocks, rsv_groups, rsv_gdb); +#endif + + return rsv_gdb; +} + +errcode_t ext2fs_initialize(const char *name, int flags, + struct ext2_super_block *param, + io_manager manager, ext2_filsys *ret_fs) +{ + ext2_filsys fs; + errcode_t retval; + struct ext2_super_block *super; + unsigned int rem; + unsigned int overhead = 0; + unsigned int ipg; + dgrp_t i; + blk_t numblocks; + int rsv_gdt; + int csum_flag; + int io_flags; + char *buf = 0; + char c; + + if (!param || !ext2fs_blocks_count(param)) + return EXT2_ET_INVALID_ARGUMENT; + + retval = ext2fs_get_mem(sizeof(struct struct_ext2_filsys), &fs); + if (retval) + return retval; + + memset(fs, 0, sizeof(struct struct_ext2_filsys)); + fs->magic = EXT2_ET_MAGIC_EXT2FS_FILSYS; + fs->flags = flags | EXT2_FLAG_RW; + fs->umask = 022; +#ifdef WORDS_BIGENDIAN + fs->flags |= EXT2_FLAG_SWAP_BYTES; +#endif + io_flags = IO_FLAG_RW; + if (flags & EXT2_FLAG_EXCLUSIVE) + io_flags |= IO_FLAG_EXCLUSIVE; + retval = manager->open(name, io_flags, &fs->io); + if (retval) + goto cleanup; + fs->image_io = fs->io; + fs->io->app_data = fs; + retval = ext2fs_get_mem(strlen(name)+1, &fs->device_name); + if (retval) + goto cleanup; + + strcpy(fs->device_name, name); + retval = ext2fs_get_mem(SUPERBLOCK_SIZE, &super); + if (retval) + goto cleanup; + fs->super = super; + + memset(super, 0, SUPERBLOCK_SIZE); + +#define set_field(field, default) (super->field = param->field ? \ + param->field : (default)) + + super->s_magic = EXT2_SUPER_MAGIC; + super->s_state = EXT2_VALID_FS; + + set_field(s_log_block_size, 0); /* default blocksize: 1024 bytes */ + set_field(s_log_cluster_size, 0); + set_field(s_first_data_block, super->s_log_block_size ? 0 : 1); + set_field(s_max_mnt_count, 0); + set_field(s_errors, EXT2_ERRORS_DEFAULT); + set_field(s_feature_compat, 0); + set_field(s_feature_incompat, 0); + set_field(s_feature_ro_compat, 0); + set_field(s_default_mount_opts, 0); + set_field(s_first_meta_bg, 0); + set_field(s_raid_stride, 0); /* default stride size: 0 */ + set_field(s_raid_stripe_width, 0); /* default stripe width: 0 */ + set_field(s_log_groups_per_flex, 0); + set_field(s_flags, 0); + if (super->s_feature_incompat & ~EXT2_LIB_FEATURE_INCOMPAT_SUPP) { + retval = EXT2_ET_UNSUPP_FEATURE; + goto cleanup; + } + if (super->s_feature_ro_compat & ~EXT2_LIB_FEATURE_RO_COMPAT_SUPP) { + retval = EXT2_ET_RO_UNSUPP_FEATURE; + goto cleanup; + } + + set_field(s_rev_level, EXT2_GOOD_OLD_REV); + if (super->s_rev_level >= EXT2_DYNAMIC_REV) { + set_field(s_first_ino, EXT2_GOOD_OLD_FIRST_INO); + set_field(s_inode_size, EXT2_GOOD_OLD_INODE_SIZE); + if (super->s_inode_size >= sizeof(struct ext2_inode_large)) { + int extra_isize = sizeof(struct ext2_inode_large) - + EXT2_GOOD_OLD_INODE_SIZE; + set_field(s_min_extra_isize, extra_isize); + set_field(s_want_extra_isize, extra_isize); + } + } else { + super->s_first_ino = EXT2_GOOD_OLD_FIRST_INO; + super->s_inode_size = EXT2_GOOD_OLD_INODE_SIZE; + } + + set_field(s_checkinterval, 0); + super->s_mkfs_time = super->s_lastcheck = fs->now ? fs->now : time(NULL); + + super->s_creator_os = CREATOR_OS; + + fs->blocksize = EXT2_BLOCK_SIZE(super); + fs->clustersize = EXT2_CLUSTER_SIZE(super); + + /* default: (fs->blocksize*8) blocks/group, up to 2^16 (GDT limit) */ + set_field(s_blocks_per_group, fs->blocksize * 8); + if (super->s_blocks_per_group > EXT2_MAX_BLOCKS_PER_GROUP(super)) + super->s_blocks_per_group = EXT2_MAX_BLOCKS_PER_GROUP(super); + super->s_clusters_per_group = super->s_blocks_per_group; + + ext2fs_blocks_count_set(super, ext2fs_blocks_count(param)); + ext2fs_r_blocks_count_set(super, ext2fs_r_blocks_count(param)); + if (ext2fs_r_blocks_count(super) >= ext2fs_blocks_count(param)) { + retval = EXT2_ET_INVALID_ARGUMENT; + goto cleanup; + } + + /* + * If we're creating an external journal device, we don't need + * to bother with the rest. + */ + if (super->s_feature_incompat & EXT3_FEATURE_INCOMPAT_JOURNAL_DEV) { + fs->group_desc_count = 0; + ext2fs_mark_super_dirty(fs); + *ret_fs = fs; + return 0; + } + +retry: + fs->group_desc_count = (blk_t) ext2fs_div64_ceil( + ext2fs_blocks_count(super) - super->s_first_data_block, + EXT2_BLOCKS_PER_GROUP(super)); + if (fs->group_desc_count == 0) { + retval = EXT2_ET_TOOSMALL; + goto cleanup; + } + + if (super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT) + super->s_desc_size = EXT2_MIN_DESC_SIZE_64BIT; + + fs->desc_blocks = ext2fs_div_ceil(fs->group_desc_count, + EXT2_DESC_PER_BLOCK(super)); + + i = fs->blocksize >= 4096 ? 1 : 4096 / fs->blocksize; + + if (super->s_feature_incompat & EXT4_FEATURE_INCOMPAT_64BIT && + (ext2fs_blocks_count(super) / i) > (1ULL << 32)) + set_field(s_inodes_count, ~0U); + else + set_field(s_inodes_count, ext2fs_blocks_count(super) / i); + + /* + * Make sure we have at least EXT2_FIRST_INO + 1 inodes, so + * that we have enough inodes for the filesystem(!) + */ + if (super->s_inodes_count < EXT2_FIRST_INODE(super)+1) + super->s_inodes_count = EXT2_FIRST_INODE(super)+1; + + /* + * There should be at least as many inodes as the user + * requested. Figure out how many inodes per group that + * should be. But make sure that we don't allocate more than + * one bitmap's worth of inodes each group. + */ + ipg = ext2fs_div_ceil(super->s_inodes_count, fs->group_desc_count); + if (ipg > fs->blocksize * 8) { + if (super->s_blocks_per_group >= 256) { + /* Try again with slightly different parameters */ + super->s_blocks_per_group -= 8; + ext2fs_blocks_count_set(super, + ext2fs_blocks_count(param)); + super->s_clusters_per_group = super->s_blocks_per_group; + goto retry; + } else { + retval = EXT2_ET_TOO_MANY_INODES; + goto cleanup; + } + } + + if (ipg > (unsigned) EXT2_MAX_INODES_PER_GROUP(super)) + ipg = EXT2_MAX_INODES_PER_GROUP(super); + +ipg_retry: + super->s_inodes_per_group = ipg; + + /* + * Make sure the number of inodes per group completely fills + * the inode table blocks in the descriptor. If not, add some + * additional inodes/group. Waste not, want not... + */ + fs->inode_blocks_per_group = (((super->s_inodes_per_group * + EXT2_INODE_SIZE(super)) + + EXT2_BLOCK_SIZE(super) - 1) / + EXT2_BLOCK_SIZE(super)); + super->s_inodes_per_group = ((fs->inode_blocks_per_group * + EXT2_BLOCK_SIZE(super)) / + EXT2_INODE_SIZE(super)); + /* + * Finally, make sure the number of inodes per group is a + * multiple of 8. This is needed to simplify the bitmap + * splicing code. + */ + if (super->s_inodes_per_group < 8) + super->s_inodes_per_group = 8; + super->s_inodes_per_group &= ~7; + fs->inode_blocks_per_group = (((super->s_inodes_per_group * + EXT2_INODE_SIZE(super)) + + EXT2_BLOCK_SIZE(super) - 1) / + EXT2_BLOCK_SIZE(super)); + + /* + * adjust inode count to reflect the adjusted inodes_per_group + */ + if ((__u64)super->s_inodes_per_group * fs->group_desc_count > ~0U) { + ipg--; + goto ipg_retry; + } + super->s_inodes_count = super->s_inodes_per_group * + fs->group_desc_count; + super->s_free_inodes_count = super->s_inodes_count; + + /* + * check the number of reserved group descriptor table blocks + */ + if (super->s_feature_compat & EXT2_FEATURE_COMPAT_RESIZE_INODE) + rsv_gdt = calc_reserved_gdt_blocks(fs); + else + rsv_gdt = 0; + set_field(s_reserved_gdt_blocks, rsv_gdt); + if (super->s_reserved_gdt_blocks > EXT2_ADDR_PER_BLOCK(super)) { + retval = EXT2_ET_RES_GDT_BLOCKS; + goto cleanup; + } + + /* + * Calculate the maximum number of bookkeeping blocks per + * group. It includes the superblock, the block group + * descriptors, the block bitmap, the inode bitmap, the inode + * table, and the reserved gdt blocks. + */ + overhead = (int) (3 + fs->inode_blocks_per_group + + fs->desc_blocks + super->s_reserved_gdt_blocks); + + /* This can only happen if the user requested too many inodes */ + if (overhead > super->s_blocks_per_group) { + retval = EXT2_ET_TOO_MANY_INODES; + goto cleanup; + } + + /* + * See if the last group is big enough to support the + * necessary data structures. If not, we need to get rid of + * it. We need to recalculate the overhead for the last block + * group, since it might or might not have a superblock + * backup. + */ + overhead = (int) (2 + fs->inode_blocks_per_group); + if (ext2fs_bg_has_super(fs, fs->group_desc_count - 1)) + overhead += 1 + fs->desc_blocks + super->s_reserved_gdt_blocks; + rem = ((ext2fs_blocks_count(super) - super->s_first_data_block) % + super->s_blocks_per_group); + if ((fs->group_desc_count == 1) && rem && (rem < overhead)) { + retval = EXT2_ET_TOOSMALL; + goto cleanup; + } + if (rem && (rem < overhead+50)) { + ext2fs_blocks_count_set(super, ext2fs_blocks_count(super) - + rem); + + goto retry; + } + + /* + * At this point we know how big the filesystem will be. So + * we can do any and all allocations that depend on the block + * count. + */ + + retval = ext2fs_get_mem(strlen(fs->device_name) + 80, &buf); + if (retval) + goto cleanup; + + strcpy(buf, "block bitmap for "); + strcat(buf, fs->device_name); + retval = ext2fs_allocate_block_bitmap(fs, buf, &fs->block_map); + if (retval) + goto cleanup; + + strcpy(buf, "inode bitmap for "); + strcat(buf, fs->device_name); + retval = ext2fs_allocate_inode_bitmap(fs, buf, &fs->inode_map); + if (retval) + goto cleanup; + + ext2fs_free_mem(&buf); + + retval = ext2fs_get_array(fs->desc_blocks, fs->blocksize, + &fs->group_desc); + if (retval) + goto cleanup; + + memset(fs->group_desc, 0, (size_t) fs->desc_blocks * fs->blocksize); + + /* + * Reserve the superblock and group descriptors for each + * group, and fill in the correct group statistics for group. + * Note that although the block bitmap, inode bitmap, and + * inode table have not been allocated (and in fact won't be + * by this routine), they are accounted for nevertheless. + * + * If FLEX_BG meta-data grouping is used, only account for the + * superblock and group descriptors (the inode tables and + * bitmaps will be accounted for when allocated). + */ + ext2fs_free_blocks_count_set(super, 0); + csum_flag = EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM); + for (i = 0; i < fs->group_desc_count; i++) { + /* + * Don't set the BLOCK_UNINIT group for the last group + * because the block bitmap needs to be padded. + */ + if (csum_flag) { + if (i != fs->group_desc_count - 1) + ext2fs_bg_flags_set(fs, i, + EXT2_BG_BLOCK_UNINIT); + ext2fs_bg_flags_set(fs, i, EXT2_BG_INODE_UNINIT); + numblocks = super->s_inodes_per_group; + if (i == 0) + numblocks -= super->s_first_ino; + ext2fs_bg_itable_unused_set(fs, i, numblocks); + } + numblocks = ext2fs_reserve_super_and_bgd(fs, i, fs->block_map); + if (fs->super->s_log_groups_per_flex) + numblocks += 2 + fs->inode_blocks_per_group; + + ext2fs_free_blocks_count_set(super, + ext2fs_free_blocks_count(super) + + numblocks); + ext2fs_bg_free_blocks_count_set(fs, i, numblocks); + ext2fs_bg_free_inodes_count_set(fs, i, fs->super->s_inodes_per_group); + ext2fs_bg_used_dirs_count_set(fs, i, 0); + ext2fs_group_desc_csum_set(fs, i); + } + + c = (char) 255; + if (((int) c) == -1) { + super->s_flags |= EXT2_FLAGS_SIGNED_HASH; + } else { + super->s_flags |= EXT2_FLAGS_UNSIGNED_HASH; + } + + ext2fs_mark_super_dirty(fs); + ext2fs_mark_bb_dirty(fs); + ext2fs_mark_ib_dirty(fs); + + io_channel_set_blksize(fs->io, fs->blocksize); + + *ret_fs = fs; + return 0; +cleanup: + free(buf); + ext2fs_free(fs); + return retval; +} diff --git a/portlibs/sources/libext2fs/source/inline.c b/portlibs/sources/libext2fs/source/inline.c new file mode 100644 index 00000000..f9be368b --- /dev/null +++ b/portlibs/sources/libext2fs/source/inline.c @@ -0,0 +1,32 @@ +/* + * inline.c --- Includes the inlined functions defined in the header + * files as standalone functions, in case the application program + * is compiled with inlining turned off. + * + * Copyright (C) 1993, 1994 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#define INCLUDE_INLINE_FUNCS +#include "ext2fs.h" + diff --git a/portlibs/sources/libext2fs/source/inode.c b/portlibs/sources/libext2fs/source/inode.c new file mode 100644 index 00000000..a762dbce --- /dev/null +++ b/portlibs/sources/libext2fs/source/inode.c @@ -0,0 +1,834 @@ +/* + * inode.c --- utility routines to read and write inodes + * + * Copyright (C) 1993, 1994, 1995, 1996, 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fsP.h" +#include "e2image.h" + +struct ext2_struct_inode_scan { + errcode_t magic; + ext2_filsys fs; + ext2_ino_t current_inode; + blk64_t current_block; + dgrp_t current_group; + ext2_ino_t inodes_left; + blk_t blocks_left; + dgrp_t groups_left; + blk_t inode_buffer_blocks; + char * inode_buffer; + int inode_size; + char * ptr; + int bytes_left; + char *temp_buffer; + errcode_t (*done_group)(ext2_filsys fs, + ext2_inode_scan scan, + dgrp_t group, + void * priv_data); + void * done_group_data; + int bad_block_ptr; + int scan_flags; + int reserved[6]; +}; + +/* + * This routine flushes the icache, if it exists. + */ +errcode_t ext2fs_flush_icache(ext2_filsys fs) +{ + int i; + + if (!fs->icache) + return 0; + + for (i=0; i < fs->icache->cache_size; i++) + fs->icache->cache[i].ino = 0; + + fs->icache->buffer_blk = 0; + return 0; +} + +static errcode_t create_icache(ext2_filsys fs) +{ + errcode_t retval; + + if (fs->icache) + return 0; + retval = ext2fs_get_mem(sizeof(struct ext2_inode_cache), &fs->icache); + if (retval) + return retval; + + memset(fs->icache, 0, sizeof(struct ext2_inode_cache)); + retval = ext2fs_get_mem(fs->blocksize, &fs->icache->buffer); + if (retval) { + ext2fs_free_mem(&fs->icache); + return retval; + } + fs->icache->buffer_blk = 0; + fs->icache->cache_last = -1; + fs->icache->cache_size = 4; + fs->icache->refcount = 1; + retval = ext2fs_get_array(fs->icache->cache_size, + sizeof(struct ext2_inode_cache_ent), + &fs->icache->cache); + if (retval) { + ext2fs_free_mem(&fs->icache->buffer); + ext2fs_free_mem(&fs->icache); + return retval; + } + ext2fs_flush_icache(fs); + return 0; +} + +errcode_t ext2fs_open_inode_scan(ext2_filsys fs, int buffer_blocks, + ext2_inode_scan *ret_scan) +{ + ext2_inode_scan scan; + errcode_t retval; + errcode_t (*save_get_blocks)(ext2_filsys f, ext2_ino_t ino, blk_t *blocks); + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + /* + * If fs->badblocks isn't set, then set it --- since the inode + * scanning functions require it. + */ + if (fs->badblocks == 0) { + /* + * Temporarly save fs->get_blocks and set it to zero, + * for compatibility with old e2fsck's. + */ + save_get_blocks = fs->get_blocks; + fs->get_blocks = 0; + retval = ext2fs_read_bb_inode(fs, &fs->badblocks); + if (retval && fs->badblocks) { + ext2fs_badblocks_list_free(fs->badblocks); + fs->badblocks = 0; + } + fs->get_blocks = save_get_blocks; + } + + retval = ext2fs_get_mem(sizeof(struct ext2_struct_inode_scan), &scan); + if (retval) + return retval; + memset(scan, 0, sizeof(struct ext2_struct_inode_scan)); + + scan->magic = EXT2_ET_MAGIC_INODE_SCAN; + scan->fs = fs; + scan->inode_size = EXT2_INODE_SIZE(fs->super); + scan->bytes_left = 0; + scan->current_group = 0; + scan->groups_left = fs->group_desc_count - 1; + scan->inode_buffer_blocks = buffer_blocks ? buffer_blocks : 8; + scan->current_block = ext2fs_inode_table_loc(scan->fs, + scan->current_group); + scan->inodes_left = EXT2_INODES_PER_GROUP(scan->fs->super); + scan->blocks_left = scan->fs->inode_blocks_per_group; + if (EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) { + scan->inodes_left -= + ext2fs_bg_itable_unused(fs, scan->current_group); + scan->blocks_left = + (scan->inodes_left + + (fs->blocksize / scan->inode_size - 1)) * + scan->inode_size / fs->blocksize; + } + retval = ext2fs_get_memalign(scan->inode_buffer_blocks * fs->blocksize, + fs->blocksize, &scan->inode_buffer); + scan->done_group = 0; + scan->done_group_data = 0; + scan->bad_block_ptr = 0; + if (retval) { + ext2fs_free_mem(&scan); + return retval; + } + retval = ext2fs_get_mem(scan->inode_size, &scan->temp_buffer); + if (retval) { + ext2fs_free_mem(&scan->inode_buffer); + ext2fs_free_mem(&scan); + return retval; + } + if (scan->fs->badblocks && scan->fs->badblocks->num) + scan->scan_flags |= EXT2_SF_CHK_BADBLOCKS; + if (EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) + scan->scan_flags |= EXT2_SF_DO_LAZY; + *ret_scan = scan; + return 0; +} + +void ext2fs_close_inode_scan(ext2_inode_scan scan) +{ + if (!scan || (scan->magic != EXT2_ET_MAGIC_INODE_SCAN)) + return; + + ext2fs_free_mem(&scan->inode_buffer); + scan->inode_buffer = NULL; + ext2fs_free_mem(&scan->temp_buffer); + scan->temp_buffer = NULL; + ext2fs_free_mem(&scan); + return; +} + +void ext2fs_set_inode_callback(ext2_inode_scan scan, + errcode_t (*done_group)(ext2_filsys fs, + ext2_inode_scan scan, + dgrp_t group, + void * priv_data), + void *done_group_data) +{ + if (!scan || (scan->magic != EXT2_ET_MAGIC_INODE_SCAN)) + return; + + scan->done_group = done_group; + scan->done_group_data = done_group_data; +} + +int ext2fs_inode_scan_flags(ext2_inode_scan scan, int set_flags, + int clear_flags) +{ + int old_flags; + + if (!scan || (scan->magic != EXT2_ET_MAGIC_INODE_SCAN)) + return 0; + + old_flags = scan->scan_flags; + scan->scan_flags &= ~clear_flags; + scan->scan_flags |= set_flags; + return old_flags; +} + +/* + * This function is called by ext2fs_get_next_inode when it needs to + * get ready to read in a new blockgroup. + */ +static errcode_t get_next_blockgroup(ext2_inode_scan scan) +{ + ext2_filsys fs = scan->fs; + + scan->current_group++; + scan->groups_left--; + + scan->current_block = ext2fs_inode_table_loc(scan->fs, + scan->current_group); + scan->current_inode = scan->current_group * + EXT2_INODES_PER_GROUP(fs->super); + + scan->bytes_left = 0; + scan->inodes_left = EXT2_INODES_PER_GROUP(fs->super); + scan->blocks_left = fs->inode_blocks_per_group; + if (EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) { + scan->inodes_left -= + ext2fs_bg_itable_unused(fs, scan->current_group); + scan->blocks_left = + (scan->inodes_left + + (fs->blocksize / scan->inode_size - 1)) * + scan->inode_size / fs->blocksize; + } + + return 0; +} + +errcode_t ext2fs_inode_scan_goto_blockgroup(ext2_inode_scan scan, + int group) +{ + scan->current_group = group - 1; + scan->groups_left = scan->fs->group_desc_count - group; + return get_next_blockgroup(scan); +} + +/* + * This function is called by get_next_blocks() to check for bad + * blocks in the inode table. + * + * This function assumes that badblocks_list->list is sorted in + * increasing order. + */ +static errcode_t check_for_inode_bad_blocks(ext2_inode_scan scan, + blk_t *num_blocks) +{ + blk_t blk = scan->current_block; + badblocks_list bb = scan->fs->badblocks; + + /* + * If the inode table is missing, then obviously there are no + * bad blocks. :-) + */ + if (blk == 0) + return 0; + + /* + * If the current block is greater than the bad block listed + * in the bad block list, then advance the pointer until this + * is no longer the case. If we run out of bad blocks, then + * we don't need to do any more checking! + */ + while (blk > bb->list[scan->bad_block_ptr]) { + if (++scan->bad_block_ptr >= bb->num) { + scan->scan_flags &= ~EXT2_SF_CHK_BADBLOCKS; + return 0; + } + } + + /* + * If the current block is equal to the bad block listed in + * the bad block list, then handle that one block specially. + * (We could try to handle runs of bad blocks, but that + * only increases CPU efficiency by a small amount, at the + * expense of a huge expense of code complexity, and for an + * uncommon case at that.) + */ + if (blk == bb->list[scan->bad_block_ptr]) { + scan->scan_flags |= EXT2_SF_BAD_INODE_BLK; + *num_blocks = 1; + if (++scan->bad_block_ptr >= bb->num) + scan->scan_flags &= ~EXT2_SF_CHK_BADBLOCKS; + return 0; + } + + /* + * If there is a bad block in the range that we're about to + * read in, adjust the number of blocks to read so that we we + * don't read in the bad block. (Then the next block to read + * will be the bad block, which is handled in the above case.) + */ + if ((blk + *num_blocks) > bb->list[scan->bad_block_ptr]) + *num_blocks = (int) (bb->list[scan->bad_block_ptr] - blk); + + return 0; +} + +/* + * This function is called by ext2fs_get_next_inode when it needs to + * read in more blocks from the current blockgroup's inode table. + */ +static errcode_t get_next_blocks(ext2_inode_scan scan) +{ + blk_t num_blocks; + errcode_t retval; + + /* + * Figure out how many blocks to read; we read at most + * inode_buffer_blocks, and perhaps less if there aren't that + * many blocks left to read. + */ + num_blocks = scan->inode_buffer_blocks; + if (num_blocks > scan->blocks_left) + num_blocks = scan->blocks_left; + + /* + * If the past block "read" was a bad block, then mark the + * left-over extra bytes as also being bad. + */ + if (scan->scan_flags & EXT2_SF_BAD_INODE_BLK) { + if (scan->bytes_left) + scan->scan_flags |= EXT2_SF_BAD_EXTRA_BYTES; + scan->scan_flags &= ~EXT2_SF_BAD_INODE_BLK; + } + + /* + * Do inode bad block processing, if necessary. + */ + if (scan->scan_flags & EXT2_SF_CHK_BADBLOCKS) { + retval = check_for_inode_bad_blocks(scan, &num_blocks); + if (retval) + return retval; + } + + if ((scan->scan_flags & EXT2_SF_BAD_INODE_BLK) || + (scan->current_block == 0)) { + memset(scan->inode_buffer, 0, + (size_t) num_blocks * scan->fs->blocksize); + } else { + retval = io_channel_read_blk64(scan->fs->io, + scan->current_block, + (int) num_blocks, + scan->inode_buffer); + if (retval) + return EXT2_ET_NEXT_INODE_READ; + } + scan->ptr = scan->inode_buffer; + scan->bytes_left = num_blocks * scan->fs->blocksize; + + scan->blocks_left -= num_blocks; + if (scan->current_block) + scan->current_block += num_blocks; + return 0; +} + +#if 0 +/* + * Returns 1 if the entire inode_buffer has a non-zero size and + * contains all zeros. (Not just deleted inodes, since that means + * that part of the inode table was used at one point; we want all + * zeros, which means that the inode table is pristine.) + */ +static inline int is_empty_scan(ext2_inode_scan scan) +{ + int i; + + if (scan->bytes_left == 0) + return 0; + + for (i=0; i < scan->bytes_left; i++) + if (scan->ptr[i]) + return 0; + return 1; +} +#endif + +errcode_t ext2fs_get_next_inode_full(ext2_inode_scan scan, ext2_ino_t *ino, + struct ext2_inode *inode, int bufsize) +{ + errcode_t retval; + int extra_bytes = 0; + + EXT2_CHECK_MAGIC(scan, EXT2_ET_MAGIC_INODE_SCAN); + + /* + * Do we need to start reading a new block group? + */ + if (scan->inodes_left <= 0) { + force_new_group: + if (scan->done_group) { + retval = (scan->done_group) + (scan->fs, scan, scan->current_group, + scan->done_group_data); + if (retval) + return retval; + } + if (scan->groups_left <= 0) { + *ino = 0; + return 0; + } + retval = get_next_blockgroup(scan); + if (retval) + return retval; + } + /* + * These checks are done outside the above if statement so + * they can be done for block group #0. + */ + if ((scan->scan_flags & EXT2_SF_DO_LAZY) && + (ext2fs_bg_flags_test(scan->fs, scan->current_group, EXT2_BG_INODE_UNINIT) + )) + goto force_new_group; + if (scan->inodes_left == 0) + goto force_new_group; + if (scan->current_block == 0) { + if (scan->scan_flags & EXT2_SF_SKIP_MISSING_ITABLE) { + goto force_new_group; + } else + return EXT2_ET_MISSING_INODE_TABLE; + } + + + /* + * Have we run out of space in the inode buffer? If so, we + * need to read in more blocks. + */ + if (scan->bytes_left < scan->inode_size) { + memcpy(scan->temp_buffer, scan->ptr, scan->bytes_left); + extra_bytes = scan->bytes_left; + + retval = get_next_blocks(scan); + if (retval) + return retval; +#if 0 + /* + * XXX test Need check for used inode somehow. + * (Note: this is hard.) + */ + if (is_empty_scan(scan)) + goto force_new_group; +#endif + } + + retval = 0; + if (extra_bytes) { + memcpy(scan->temp_buffer+extra_bytes, scan->ptr, + scan->inode_size - extra_bytes); + scan->ptr += scan->inode_size - extra_bytes; + scan->bytes_left -= scan->inode_size - extra_bytes; + +#ifdef WORDS_BIGENDIAN + memset(inode, 0, bufsize); + ext2fs_swap_inode_full(scan->fs, + (struct ext2_inode_large *) inode, + (struct ext2_inode_large *) scan->temp_buffer, + 0, bufsize); +#else + *inode = *((struct ext2_inode *) scan->temp_buffer); +#endif + if (scan->scan_flags & EXT2_SF_BAD_EXTRA_BYTES) + retval = EXT2_ET_BAD_BLOCK_IN_INODE_TABLE; + scan->scan_flags &= ~EXT2_SF_BAD_EXTRA_BYTES; + } else { +#ifdef WORDS_BIGENDIAN + memset(inode, 0, bufsize); + ext2fs_swap_inode_full(scan->fs, + (struct ext2_inode_large *) inode, + (struct ext2_inode_large *) scan->ptr, + 0, bufsize); +#else + memcpy(inode, scan->ptr, bufsize); +#endif + scan->ptr += scan->inode_size; + scan->bytes_left -= scan->inode_size; + if (scan->scan_flags & EXT2_SF_BAD_INODE_BLK) + retval = EXT2_ET_BAD_BLOCK_IN_INODE_TABLE; + } + + scan->inodes_left--; + scan->current_inode++; + *ino = scan->current_inode; + return retval; +} + +errcode_t ext2fs_get_next_inode(ext2_inode_scan scan, ext2_ino_t *ino, + struct ext2_inode *inode) +{ + return ext2fs_get_next_inode_full(scan, ino, inode, + sizeof(struct ext2_inode)); +} + +/* + * Functions to read and write a single inode. + */ +errcode_t ext2fs_read_inode_full(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode * inode, int bufsize) +{ + unsigned long group, block, block_nr, offset; + char *ptr; + errcode_t retval; + int clen, i, inodes_per_block, length; + io_channel io; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + /* Check to see if user has an override function */ + if (fs->read_inode) { + retval = (fs->read_inode)(fs, ino, inode); + if (retval != EXT2_ET_CALLBACK_NOTHANDLED) + return retval; + } + if ((ino == 0) || (ino > fs->super->s_inodes_count)) + return EXT2_ET_BAD_INODE_NUM; + /* Create inode cache if not present */ + if (!fs->icache) { + retval = create_icache(fs); + if (retval) + return retval; + } + /* Check to see if it's in the inode cache */ + if (bufsize == sizeof(struct ext2_inode)) { + /* only old good inode can be retrieved from the cache */ + for (i=0; i < fs->icache->cache_size; i++) { + if (fs->icache->cache[i].ino == ino) { + *inode = fs->icache->cache[i].inode; + return 0; + } + } + } + if (fs->flags & EXT2_FLAG_IMAGE_FILE) { + inodes_per_block = fs->blocksize / EXT2_INODE_SIZE(fs->super); + block_nr = fs->image_header->offset_inode / fs->blocksize; + block_nr += (ino - 1) / inodes_per_block; + offset = ((ino - 1) % inodes_per_block) * + EXT2_INODE_SIZE(fs->super); + io = fs->image_io; + } else { + group = (ino - 1) / EXT2_INODES_PER_GROUP(fs->super); + if (group > fs->group_desc_count) + return EXT2_ET_BAD_INODE_NUM; + offset = ((ino - 1) % EXT2_INODES_PER_GROUP(fs->super)) * + EXT2_INODE_SIZE(fs->super); + block = offset >> EXT2_BLOCK_SIZE_BITS(fs->super); + if (!ext2fs_inode_table_loc(fs, (unsigned) group)) + return EXT2_ET_MISSING_INODE_TABLE; + block_nr = ext2fs_inode_table_loc(fs, group) + + block; + io = fs->io; + } + offset &= (EXT2_BLOCK_SIZE(fs->super) - 1); + + length = EXT2_INODE_SIZE(fs->super); + if (bufsize < length) + length = bufsize; + + ptr = (char *) inode; + while (length) { + clen = length; + if ((offset + length) > fs->blocksize) + clen = fs->blocksize - offset; + + if (block_nr != fs->icache->buffer_blk) { + retval = io_channel_read_blk64(io, block_nr, 1, + fs->icache->buffer); + if (retval) + return retval; + fs->icache->buffer_blk = block_nr; + } + + memcpy(ptr, ((char *) fs->icache->buffer) + (unsigned) offset, + clen); + + offset = 0; + length -= clen; + ptr += clen; + block_nr++; + } + +#ifdef WORDS_BIGENDIAN + ext2fs_swap_inode_full(fs, (struct ext2_inode_large *) inode, + (struct ext2_inode_large *) inode, + 0, bufsize); +#endif + + /* Update the inode cache */ + fs->icache->cache_last = (fs->icache->cache_last + 1) % + fs->icache->cache_size; + fs->icache->cache[fs->icache->cache_last].ino = ino; + fs->icache->cache[fs->icache->cache_last].inode = *inode; + + return 0; +} + +errcode_t ext2fs_read_inode(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode * inode) +{ + return ext2fs_read_inode_full(fs, ino, inode, + sizeof(struct ext2_inode)); +} + +errcode_t ext2fs_write_inode_full(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode * inode, int bufsize) +{ + unsigned long group, block, block_nr, offset; + errcode_t retval = 0; + struct ext2_inode_large temp_inode, *w_inode; + char *ptr; + int clen, i, length; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + /* Check to see if user provided an override function */ + if (fs->write_inode) { + retval = (fs->write_inode)(fs, ino, inode); + if (retval != EXT2_ET_CALLBACK_NOTHANDLED) + return retval; + } + + /* Check to see if the inode cache needs to be updated */ + if (fs->icache) { + for (i=0; i < fs->icache->cache_size; i++) { + if (fs->icache->cache[i].ino == ino) { + fs->icache->cache[i].inode = *inode; + break; + } + } + } else { + retval = create_icache(fs); + if (retval) + return retval; + } + + if (!(fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + if ((ino == 0) || (ino > fs->super->s_inodes_count)) + return EXT2_ET_BAD_INODE_NUM; + + length = bufsize; + if (length < EXT2_INODE_SIZE(fs->super)) + length = EXT2_INODE_SIZE(fs->super); + + if (length > (int) sizeof(struct ext2_inode_large)) { + w_inode = malloc(length); + if (!w_inode) + return ENOMEM; + } else + w_inode = &temp_inode; + memset(w_inode, 0, length); + +#ifdef WORDS_BIGENDIAN + ext2fs_swap_inode_full(fs, w_inode, + (struct ext2_inode_large *) inode, + 1, bufsize); +#else + memcpy(w_inode, inode, bufsize); +#endif + + group = (ino - 1) / EXT2_INODES_PER_GROUP(fs->super); + offset = ((ino - 1) % EXT2_INODES_PER_GROUP(fs->super)) * + EXT2_INODE_SIZE(fs->super); + block = offset >> EXT2_BLOCK_SIZE_BITS(fs->super); + if (!ext2fs_inode_table_loc(fs, (unsigned) group)) { + retval = EXT2_ET_MISSING_INODE_TABLE; + goto errout; + } + block_nr = ext2fs_inode_table_loc(fs, (unsigned) group) + block; + + offset &= (EXT2_BLOCK_SIZE(fs->super) - 1); + + length = EXT2_INODE_SIZE(fs->super); + if (length > bufsize) + length = bufsize; + + ptr = (char *) w_inode; + + while (length) { + clen = length; + if ((offset + length) > fs->blocksize) + clen = fs->blocksize - offset; + + if (fs->icache->buffer_blk != block_nr) { + retval = io_channel_read_blk64(fs->io, block_nr, 1, + fs->icache->buffer); + if (retval) + goto errout; + fs->icache->buffer_blk = block_nr; + } + + + memcpy((char *) fs->icache->buffer + (unsigned) offset, + ptr, clen); + + retval = io_channel_write_blk64(fs->io, block_nr, 1, + fs->icache->buffer); + if (retval) + goto errout; + + offset = 0; + ptr += clen; + length -= clen; + block_nr++; + } + + fs->flags |= EXT2_FLAG_CHANGED; +errout: + if (w_inode && w_inode != &temp_inode) + free(w_inode); + return retval; +} + +errcode_t ext2fs_write_inode(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode) +{ + return ext2fs_write_inode_full(fs, ino, inode, + sizeof(struct ext2_inode)); +} + +/* + * This function should be called when writing a new inode. It makes + * sure that extra part of large inodes is initialized properly. + */ +errcode_t ext2fs_write_new_inode(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode) +{ + struct ext2_inode *buf; + int size = EXT2_INODE_SIZE(fs->super); + struct ext2_inode_large *large_inode; + errcode_t retval; + __u32 t = fs->now ? fs->now : time(NULL); + + if (!inode->i_ctime) + inode->i_ctime = t; + if (!inode->i_mtime) + inode->i_mtime = t; + if (!inode->i_atime) + inode->i_atime = t; + + if (size == sizeof(struct ext2_inode)) + return ext2fs_write_inode_full(fs, ino, inode, + sizeof(struct ext2_inode)); + + buf = malloc(size); + if (!buf) + return ENOMEM; + + memset(buf, 0, size); + *buf = *inode; + + large_inode = (struct ext2_inode_large *) buf; + large_inode->i_extra_isize = sizeof(struct ext2_inode_large) - + EXT2_GOOD_OLD_INODE_SIZE; + if (!large_inode->i_crtime) + large_inode->i_crtime = t; + + retval = ext2fs_write_inode_full(fs, ino, buf, size); + free(buf); + return retval; +} + + +errcode_t ext2fs_get_blocks(ext2_filsys fs, ext2_ino_t ino, blk_t *blocks) +{ + struct ext2_inode inode; + int i; + errcode_t retval; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (ino > fs->super->s_inodes_count) + return EXT2_ET_BAD_INODE_NUM; + + if (fs->get_blocks) { + if (!(*fs->get_blocks)(fs, ino, blocks)) + return 0; + } + retval = ext2fs_read_inode(fs, ino, &inode); + if (retval) + return retval; + for (i=0; i < EXT2_N_BLOCKS; i++) + blocks[i] = inode.i_block[i]; + return 0; +} + +errcode_t ext2fs_check_directory(ext2_filsys fs, ext2_ino_t ino) +{ + struct ext2_inode inode; + errcode_t retval; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (ino > fs->super->s_inodes_count) + return EXT2_ET_BAD_INODE_NUM; + + if (fs->check_directory) { + retval = (fs->check_directory)(fs, ino); + if (retval != EXT2_ET_CALLBACK_NOTHANDLED) + return retval; + } + retval = ext2fs_read_inode(fs, ino, &inode); + if (retval) + return retval; + if (!LINUX_S_ISDIR(inode.i_mode)) + return EXT2_ET_NO_DIRECTORY; + return 0; +} + diff --git a/portlibs/sources/libext2fs/source/inode_io.c b/portlibs/sources/libext2fs/source/inode_io.c new file mode 100644 index 00000000..b3e7ce51 --- /dev/null +++ b/portlibs/sources/libext2fs/source/inode_io.c @@ -0,0 +1,291 @@ +/* + * inode_io.c --- This is allows an inode in an ext2 filesystem image + * to be accessed via the I/O manager interface. + * + * Copyright (C) 2002 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#include <time.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +/* + * For checking structure magic numbers... + */ + +#define EXT2_CHECK_MAGIC(struct, code) \ + if ((struct)->magic != (code)) return (code) + +struct inode_private_data { + int magic; + char name[32]; + ext2_file_t file; + ext2_filsys fs; + ext2_ino_t ino; + struct ext2_inode inode; + int flags; + struct inode_private_data *next; +}; + +#define CHANNEL_HAS_INODE 0x8000 + +static struct inode_private_data *top_intern; +static int ino_unique = 0; + +static errcode_t inode_open(const char *name, int flags, io_channel *channel); +static errcode_t inode_close(io_channel channel); +static errcode_t inode_set_blksize(io_channel channel, int blksize); +static errcode_t inode_read_blk(io_channel channel, unsigned long block, + int count, void *data); +static errcode_t inode_write_blk(io_channel channel, unsigned long block, + int count, const void *data); +static errcode_t inode_flush(io_channel channel); +static errcode_t inode_write_byte(io_channel channel, unsigned long offset, + int size, const void *data); +static errcode_t inode_read_blk64(io_channel channel, + unsigned long long block, int count, void *data); +static errcode_t inode_write_blk64(io_channel channel, + unsigned long long block, int count, const void *data); + +static struct struct_io_manager struct_inode_manager = { + EXT2_ET_MAGIC_IO_MANAGER, + "Inode I/O Manager", + inode_open, + inode_close, + inode_set_blksize, + inode_read_blk, + inode_write_blk, + inode_flush, + inode_write_byte, + NULL, + NULL, + inode_read_blk64, + inode_write_blk64 +}; + +io_manager inode_io_manager = &struct_inode_manager; + +errcode_t ext2fs_inode_io_intern2(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + char **name) +{ + struct inode_private_data *data; + errcode_t retval; + + if ((retval = ext2fs_get_mem(sizeof(struct inode_private_data), + &data))) + return retval; + data->magic = EXT2_ET_MAGIC_INODE_IO_CHANNEL; + sprintf(data->name, "%u:%d", ino, ino_unique++); + data->file = 0; + data->fs = fs; + data->ino = ino; + data->flags = 0; + if (inode) { + memcpy(&data->inode, inode, sizeof(struct ext2_inode)); + data->flags |= CHANNEL_HAS_INODE; + } + data->next = top_intern; + top_intern = data; + *name = data->name; + return 0; +} + +errcode_t ext2fs_inode_io_intern(ext2_filsys fs, ext2_ino_t ino, + char **name) +{ + return ext2fs_inode_io_intern2(fs, ino, NULL, name); +} + + +static errcode_t inode_open(const char *name, int flags, io_channel *channel) +{ + io_channel io = NULL; + struct inode_private_data *prev, *data = NULL; + errcode_t retval; + int open_flags; + + if (name == 0) + return EXT2_ET_BAD_DEVICE_NAME; + + for (data = top_intern, prev = NULL; data; + prev = data, data = data->next) + if (strcmp(name, data->name) == 0) + break; + if (!data) + return ENOENT; + if (prev) + prev->next = data->next; + else + top_intern = data->next; + + retval = ext2fs_get_mem(sizeof(struct struct_io_channel), &io); + if (retval) + goto cleanup; + memset(io, 0, sizeof(struct struct_io_channel)); + + io->magic = EXT2_ET_MAGIC_IO_CHANNEL; + io->manager = inode_io_manager; + retval = ext2fs_get_mem(strlen(name)+1, &io->name); + if (retval) + goto cleanup; + + strcpy(io->name, name); + io->private_data = data; + io->block_size = 1024; + io->read_error = 0; + io->write_error = 0; + io->refcount = 1; + + open_flags = (flags & IO_FLAG_RW) ? EXT2_FILE_WRITE : 0; + retval = ext2fs_file_open2(data->fs, data->ino, + (data->flags & CHANNEL_HAS_INODE) ? + &data->inode : 0, open_flags, + &data->file); + if (retval) + goto cleanup; + + *channel = io; + return 0; + +cleanup: + if (io->name) + ext2fs_free_mem(&io->name); + if (data) + ext2fs_free_mem(&data); + if (io) + ext2fs_free_mem(&io); + return retval; +} + +static errcode_t inode_close(io_channel channel) +{ + struct inode_private_data *data; + errcode_t retval = 0; + + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + data = (struct inode_private_data *) channel->private_data; + EXT2_CHECK_MAGIC(data, EXT2_ET_MAGIC_INODE_IO_CHANNEL); + + if (--channel->refcount > 0) + return 0; + + retval = ext2fs_file_close(data->file); + + ext2fs_free_mem(&channel->private_data); + if (channel->name) + ext2fs_free_mem(&channel->name); + ext2fs_free_mem(&channel); + return retval; +} + +static errcode_t inode_set_blksize(io_channel channel, int blksize) +{ + struct inode_private_data *data; + + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + data = (struct inode_private_data *) channel->private_data; + EXT2_CHECK_MAGIC(data, EXT2_ET_MAGIC_INODE_IO_CHANNEL); + + channel->block_size = blksize; + return 0; +} + + +static errcode_t inode_read_blk64(io_channel channel, + unsigned long long block, int count, void *buf) +{ + struct inode_private_data *data; + errcode_t retval; + + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + data = (struct inode_private_data *) channel->private_data; + EXT2_CHECK_MAGIC(data, EXT2_ET_MAGIC_INODE_IO_CHANNEL); + + if ((retval = ext2fs_file_lseek(data->file, + block * channel->block_size, + EXT2_SEEK_SET, 0))) + return retval; + + count = (count < 0) ? -count : (count * channel->block_size); + + return ext2fs_file_read(data->file, buf, count, 0); +} + +static errcode_t inode_read_blk(io_channel channel, unsigned long block, + int count, void *buf) +{ + return inode_read_blk64(channel, block, count, buf); +} + +static errcode_t inode_write_blk64(io_channel channel, + unsigned long long block, int count, const void *buf) +{ + struct inode_private_data *data; + errcode_t retval; + + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + data = (struct inode_private_data *) channel->private_data; + EXT2_CHECK_MAGIC(data, EXT2_ET_MAGIC_INODE_IO_CHANNEL); + + if ((retval = ext2fs_file_lseek(data->file, + block * channel->block_size, + EXT2_SEEK_SET, 0))) + return retval; + + count = (count < 0) ? -count : (count * channel->block_size); + + return ext2fs_file_write(data->file, buf, count, 0); +} + +static errcode_t inode_write_blk(io_channel channel, unsigned long block, + int count, const void *buf) +{ + return inode_write_blk64(channel, block, count, buf); +} + +static errcode_t inode_write_byte(io_channel channel, unsigned long offset, + int size, const void *buf) +{ + struct inode_private_data *data; + errcode_t retval = 0; + + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + data = (struct inode_private_data *) channel->private_data; + EXT2_CHECK_MAGIC(data, EXT2_ET_MAGIC_INODE_IO_CHANNEL); + + if ((retval = ext2fs_file_lseek(data->file, offset, + EXT2_SEEK_SET, 0))) + return retval; + + return ext2fs_file_write(data->file, buf, size, 0); +} + +/* + * Flush data buffers to disk. + */ +static errcode_t inode_flush(io_channel channel) +{ + struct inode_private_data *data; + + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + data = (struct inode_private_data *) channel->private_data; + EXT2_CHECK_MAGIC(data, EXT2_ET_MAGIC_INODE_IO_CHANNEL); + + return ext2fs_file_flush(data->file); +} + diff --git a/portlibs/sources/libext2fs/source/io_manager.c b/portlibs/sources/libext2fs/source/io_manager.c new file mode 100644 index 00000000..80f9dfcb --- /dev/null +++ b/portlibs/sources/libext2fs/source/io_manager.c @@ -0,0 +1,112 @@ +/* + * io_manager.c --- the I/O manager abstraction + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +errcode_t io_channel_set_options(io_channel channel, const char *opts) +{ + errcode_t retval = 0; + char *next, *ptr, *options, *arg; + + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + + if (!opts) + return 0; + + if (!channel->manager->set_option) + return EXT2_ET_INVALID_ARGUMENT; + + options = malloc(strlen(opts)+1); + if (!options) + return EXT2_ET_NO_MEMORY; + strcpy(options, opts); + ptr = options; + + while (ptr && *ptr) { + next = strchr(ptr, '&'); + if (next) + *next++ = 0; + + arg = strchr(ptr, '='); + if (arg) + *arg++ = 0; + + retval = (channel->manager->set_option)(channel, ptr, arg); + if (retval) + break; + ptr = next; + } + free(options); + return retval; +} + +errcode_t io_channel_write_byte(io_channel channel, unsigned long offset, + int count, const void *data) +{ + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + + if (channel->manager->write_byte) + return channel->manager->write_byte(channel, offset, + count, data); + + return EXT2_ET_UNIMPLEMENTED; +} + +errcode_t io_channel_read_blk64(io_channel channel, unsigned long long block, + int count, void *data) +{ + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + + if (channel->manager->read_blk64) + return (channel->manager->read_blk64)(channel, block, + count, data); + + if ((block >> 32) != 0) + return EXT2_ET_IO_CHANNEL_NO_SUPPORT_64; + + return (channel->manager->read_blk)(channel, (unsigned long) block, + count, data); +} + +errcode_t io_channel_write_blk64(io_channel channel, unsigned long long block, + int count, const void *data) +{ + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + + if (channel->manager->write_blk64) + return (channel->manager->write_blk64)(channel, block, + count, data); + + if ((block >> 32) != 0) + return EXT2_ET_IO_CHANNEL_NO_SUPPORT_64; + + return (channel->manager->write_blk)(channel, (unsigned long) block, + count, data); +} + +errcode_t io_channel_discard(io_channel channel, unsigned long long block, + unsigned long long count) +{ + EXT2_CHECK_MAGIC(channel, EXT2_ET_MAGIC_IO_CHANNEL); + + if (channel->manager->discard) + return (channel->manager->discard)(channel, block, count); + + return EXT2_ET_UNIMPLEMENTED; +} diff --git a/portlibs/sources/libext2fs/source/irel.h b/portlibs/sources/libext2fs/source/irel.h new file mode 100644 index 00000000..9a4958be --- /dev/null +++ b/portlibs/sources/libext2fs/source/irel.h @@ -0,0 +1,114 @@ +/* + * irel.h + * + * Copyright (C) 1996, 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +struct ext2_inode_reference { + blk_t block; + __u16 offset; +}; + +struct ext2_inode_relocate_entry { + ext2_ino_t new; + ext2_ino_t orig; + __u16 flags; + __u16 max_refs; +}; + +typedef struct ext2_inode_relocation_table *ext2_irel; + +struct ext2_inode_relocation_table { + __u32 magic; + char *name; + ext2_ino_t current; + void *priv_data; + + /* + * Add an inode relocation entry. + */ + errcode_t (*put)(ext2_irel irel, ext2_ino_t old, + struct ext2_inode_relocate_entry *ent); + /* + * Get an inode relocation entry. + */ + errcode_t (*get)(ext2_irel irel, ext2_ino_t old, + struct ext2_inode_relocate_entry *ent); + + /* + * Get an inode relocation entry by its original inode number + */ + errcode_t (*get_by_orig)(ext2_irel irel, ext2_ino_t orig, ext2_ino_t *old, + struct ext2_inode_relocate_entry *ent); + + /* + * Initialize for iterating over the inode relocation entries. + */ + errcode_t (*start_iter)(ext2_irel irel); + + /* + * The iterator function for the inode relocation entries. + * Returns an inode number of 0 when out of entries. + */ + errcode_t (*next)(ext2_irel irel, ext2_ino_t *old, + struct ext2_inode_relocate_entry *ent); + + /* + * Add an inode reference (i.e., note the fact that a + * particular block/offset contains a reference to an inode) + */ + errcode_t (*add_ref)(ext2_irel irel, ext2_ino_t ino, + struct ext2_inode_reference *ref); + + /* + * Initialize for iterating over the inode references for a + * particular inode. + */ + errcode_t (*start_iter_ref)(ext2_irel irel, ext2_ino_t ino); + + /* + * The iterator function for the inode references for an + * inode. The references for only one inode can be interator + * over at a time, as the iterator state is stored in ext2_irel. + */ + errcode_t (*next_ref)(ext2_irel irel, + struct ext2_inode_reference *ref); + + /* + * Move the inode relocation table from one inode number to + * another. Note that the inode references also must move. + */ + errcode_t (*move)(ext2_irel irel, ext2_ino_t old, ext2_ino_t new); + + /* + * Remove an inode relocation entry, along with all of the + * inode references. + */ + errcode_t (*delete)(ext2_irel irel, ext2_ino_t old); + + /* + * Free the inode relocation table. + */ + errcode_t (*free)(ext2_irel irel); +}; + +errcode_t ext2fs_irel_memarray_create(char *name, ext2_ino_t max_inode, + ext2_irel *irel); + +#define ext2fs_irel_put(irel, old, ent) ((irel)->put((irel), old, ent)) +#define ext2fs_irel_get(irel, old, ent) ((irel)->get((irel), old, ent)) +#define ext2fs_irel_get_by_orig(irel, orig, old, ent) \ + ((irel)->get_by_orig((irel), orig, old, ent)) +#define ext2fs_irel_start_iter(irel) ((irel)->start_iter((irel))) +#define ext2fs_irel_next(irel, old, ent) ((irel)->next((irel), old, ent)) +#define ext2fs_irel_add_ref(irel, ino, ref) ((irel)->add_ref((irel), ino, ref)) +#define ext2fs_irel_start_iter_ref(irel, ino) ((irel)->start_iter_ref((irel), ino)) +#define ext2fs_irel_next_ref(irel, ref) ((irel)->next_ref((irel), ref)) +#define ext2fs_irel_move(irel, old, new) ((irel)->move((irel), old, new)) +#define ext2fs_irel_delete(irel, old) ((irel)->delete((irel), old)) +#define ext2fs_irel_free(irel) ((irel)->free((irel))) diff --git a/portlibs/sources/libext2fs/source/irel_ma.c b/portlibs/sources/libext2fs/source/irel_ma.c new file mode 100644 index 00000000..b7eaf6b5 --- /dev/null +++ b/portlibs/sources/libext2fs/source/irel_ma.c @@ -0,0 +1,372 @@ +/* + * irel_ma.c + * + * Copyright (C) 1996, 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <fcntl.h> +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" +#include "irel.h" + +static errcode_t ima_put(ext2_irel irel, ext2_ino_t old, + struct ext2_inode_relocate_entry *ent); +static errcode_t ima_get(ext2_irel irel, ext2_ino_t old, + struct ext2_inode_relocate_entry *ent); +static errcode_t ima_get_by_orig(ext2_irel irel, ext2_ino_t orig, ext2_ino_t *old, + struct ext2_inode_relocate_entry *ent); +static errcode_t ima_start_iter(ext2_irel irel); +static errcode_t ima_next(ext2_irel irel, ext2_ino_t *old, + struct ext2_inode_relocate_entry *ent); +static errcode_t ima_add_ref(ext2_irel irel, ext2_ino_t ino, + struct ext2_inode_reference *ref); +static errcode_t ima_start_iter_ref(ext2_irel irel, ext2_ino_t ino); +static errcode_t ima_next_ref(ext2_irel irel, struct ext2_inode_reference *ref); +static errcode_t ima_move(ext2_irel irel, ext2_ino_t old, ext2_ino_t new); +static errcode_t ima_delete(ext2_irel irel, ext2_ino_t old); +static errcode_t ima_free(ext2_irel irel); + +/* + * This data structure stores the array of inode references; there is + * a structure for each inode. + */ +struct inode_reference_entry { + __u16 num; + struct ext2_inode_reference *refs; +}; + +struct irel_ma { + __u32 magic; + ext2_ino_t max_inode; + ext2_ino_t ref_current; + int ref_iter; + ext2_ino_t *orig_map; + struct ext2_inode_relocate_entry *entries; + struct inode_reference_entry *ref_entries; +}; + +errcode_t ext2fs_irel_memarray_create(char *name, ext2_ino_t max_inode, + ext2_irel *new_irel) +{ + ext2_irel irel = 0; + errcode_t retval; + struct irel_ma *ma = 0; + size_t size; + + *new_irel = 0; + + /* + * Allocate memory structures + */ + retval = ext2fs_get_mem(sizeof(struct ext2_inode_relocation_table), + &irel); + if (retval) + goto errout; + memset(irel, 0, sizeof(struct ext2_inode_relocation_table)); + + retval = ext2fs_get_mem(strlen(name)+1, &irel->name); + if (retval) + goto errout; + strcpy(irel->name, name); + + retval = ext2fs_get_mem(sizeof(struct irel_ma), &ma); + if (retval) + goto errout; + memset(ma, 0, sizeof(struct irel_ma)); + irel->priv_data = ma; + + size = (size_t) (sizeof(ext2_ino_t) * (max_inode+1)); + retval = ext2fs_get_array(max_inode+1, sizeof(ext2_ino_t), + &ma->orig_map); + if (retval) + goto errout; + memset(ma->orig_map, 0, size); + + size = (size_t) (sizeof(struct ext2_inode_relocate_entry) * (max_inode+1)); + retval = ext2fs_get_array((max_inode+1), sizeof(struct ext2_inode_relocate_entry), &ma->entries); + if (retval) + goto errout; + memset(ma->entries, 0, size); + + size = (size_t) (sizeof(struct inode_reference_entry) * (max_inode+1)); + retval = ext2fs_get_mem(size, &ma->ref_entries); + if (retval) + goto errout; + memset(ma->ref_entries, 0, size); + ma->max_inode = max_inode; + + /* + * Fill in the irel data structure + */ + irel->put = ima_put; + irel->get = ima_get; + irel->get_by_orig = ima_get_by_orig; + irel->start_iter = ima_start_iter; + irel->next = ima_next; + irel->add_ref = ima_add_ref; + irel->start_iter_ref = ima_start_iter_ref; + irel->next_ref = ima_next_ref; + irel->move = ima_move; + irel->delete = ima_delete; + irel->free = ima_free; + + *new_irel = irel; + return 0; + +errout: + ima_free(irel); + return retval; +} + +static errcode_t ima_put(ext2_irel irel, ext2_ino_t old, + struct ext2_inode_relocate_entry *ent) +{ + struct inode_reference_entry *ref_ent; + struct irel_ma *ma; + errcode_t retval; + size_t size, old_size; + + ma = irel->priv_data; + if (old > ma->max_inode) + return EXT2_ET_INVALID_ARGUMENT; + + /* + * Force the orig field to the correct value; the application + * program shouldn't be messing with this field. + */ + if (ma->entries[(unsigned) old].new == 0) + ent->orig = old; + else + ent->orig = ma->entries[(unsigned) old].orig; + + /* + * If max_refs has changed, reallocate the refs array + */ + ref_ent = ma->ref_entries + (unsigned) old; + if (ref_ent->refs && ent->max_refs != + ma->entries[(unsigned) old].max_refs) { + size = (sizeof(struct ext2_inode_reference) * ent->max_refs); + old_size = (sizeof(struct ext2_inode_reference) * + ma->entries[(unsigned) old].max_refs); + retval = ext2fs_resize_mem(old_size, size, &ref_ent->refs); + if (retval) + return retval; + } + + ma->entries[(unsigned) old] = *ent; + ma->orig_map[(unsigned) ent->orig] = old; + return 0; +} + +static errcode_t ima_get(ext2_irel irel, ext2_ino_t old, + struct ext2_inode_relocate_entry *ent) +{ + struct irel_ma *ma; + + ma = irel->priv_data; + if (old > ma->max_inode) + return EXT2_ET_INVALID_ARGUMENT; + if (ma->entries[(unsigned) old].new == 0) + return ENOENT; + *ent = ma->entries[(unsigned) old]; + return 0; +} + +static errcode_t ima_get_by_orig(ext2_irel irel, ext2_ino_t orig, ext2_ino_t *old, + struct ext2_inode_relocate_entry *ent) +{ + struct irel_ma *ma; + ext2_ino_t ino; + + ma = irel->priv_data; + if (orig > ma->max_inode) + return EXT2_ET_INVALID_ARGUMENT; + ino = ma->orig_map[(unsigned) orig]; + if (ino == 0) + return ENOENT; + *old = ino; + *ent = ma->entries[(unsigned) ino]; + return 0; +} + +static errcode_t ima_start_iter(ext2_irel irel) +{ + irel->current = 0; + return 0; +} + +static errcode_t ima_next(ext2_irel irel, ext2_ino_t *old, + struct ext2_inode_relocate_entry *ent) +{ + struct irel_ma *ma; + + ma = irel->priv_data; + while (++irel->current < ma->max_inode) { + if (ma->entries[(unsigned) irel->current].new == 0) + continue; + *old = irel->current; + *ent = ma->entries[(unsigned) irel->current]; + return 0; + } + *old = 0; + return 0; +} + +static errcode_t ima_add_ref(ext2_irel irel, ext2_ino_t ino, + struct ext2_inode_reference *ref) +{ + struct irel_ma *ma; + size_t size; + struct inode_reference_entry *ref_ent; + struct ext2_inode_relocate_entry *ent; + errcode_t retval; + + ma = irel->priv_data; + if (ino > ma->max_inode) + return EXT2_ET_INVALID_ARGUMENT; + + ref_ent = ma->ref_entries + (unsigned) ino; + ent = ma->entries + (unsigned) ino; + + /* + * If the inode reference array doesn't exist, create it. + */ + if (ref_ent->refs == 0) { + size = (size_t) ((sizeof(struct ext2_inode_reference) * + ent->max_refs)); + retval = ext2fs_get_array(ent->max_refs, + sizeof(struct ext2_inode_reference), &ref_ent->refs); + if (retval) + return retval; + memset(ref_ent->refs, 0, size); + ref_ent->num = 0; + } + + if (ref_ent->num >= ent->max_refs) + return EXT2_ET_TOO_MANY_REFS; + + ref_ent->refs[(unsigned) ref_ent->num++] = *ref; + return 0; +} + +static errcode_t ima_start_iter_ref(ext2_irel irel, ext2_ino_t ino) +{ + struct irel_ma *ma; + + ma = irel->priv_data; + if (ino > ma->max_inode) + return EXT2_ET_INVALID_ARGUMENT; + if (ma->entries[(unsigned) ino].new == 0) + return ENOENT; + ma->ref_current = ino; + ma->ref_iter = 0; + return 0; +} + +static errcode_t ima_next_ref(ext2_irel irel, + struct ext2_inode_reference *ref) +{ + struct irel_ma *ma; + struct inode_reference_entry *ref_ent; + + ma = irel->priv_data; + + ref_ent = ma->ref_entries + ma->ref_current; + + if ((ref_ent->refs == NULL) || + (ma->ref_iter >= ref_ent->num)) { + ref->block = 0; + ref->offset = 0; + return 0; + } + *ref = ref_ent->refs[ma->ref_iter++]; + return 0; +} + + +static errcode_t ima_move(ext2_irel irel, ext2_ino_t old, ext2_ino_t new) +{ + struct irel_ma *ma; + + ma = irel->priv_data; + if ((old > ma->max_inode) || (new > ma->max_inode)) + return EXT2_ET_INVALID_ARGUMENT; + if (ma->entries[(unsigned) old].new == 0) + return ENOENT; + + ma->entries[(unsigned) new] = ma->entries[(unsigned) old]; + if (ma->ref_entries[(unsigned) new].refs) + ext2fs_free_mem(&ma->ref_entries[(unsigned) new].refs); + ma->ref_entries[(unsigned) new] = ma->ref_entries[(unsigned) old]; + + ma->entries[(unsigned) old].new = 0; + ma->ref_entries[(unsigned) old].num = 0; + ma->ref_entries[(unsigned) old].refs = 0; + + ma->orig_map[ma->entries[new].orig] = new; + return 0; +} + +static errcode_t ima_delete(ext2_irel irel, ext2_ino_t old) +{ + struct irel_ma *ma; + + ma = irel->priv_data; + if (old > ma->max_inode) + return EXT2_ET_INVALID_ARGUMENT; + if (ma->entries[(unsigned) old].new == 0) + return ENOENT; + + ma->entries[old].new = 0; + if (ma->ref_entries[(unsigned) old].refs) + ext2fs_free_mem(&ma->ref_entries[(unsigned) old].refs); + ma->orig_map[ma->entries[(unsigned) old].orig] = 0; + + ma->ref_entries[(unsigned) old].num = 0; + ma->ref_entries[(unsigned) old].refs = 0; + return 0; +} + +static errcode_t ima_free(ext2_irel irel) +{ + struct irel_ma *ma; + ext2_ino_t ino; + + if (!irel) + return 0; + + ma = irel->priv_data; + + if (ma) { + if (ma->orig_map) + ext2fs_free_mem(&ma->orig_map); + if (ma->entries) + ext2fs_free_mem(&ma->entries); + if (ma->ref_entries) { + for (ino = 0; ino <= ma->max_inode; ino++) { + if (ma->ref_entries[(unsigned) ino].refs) + ext2fs_free_mem(&ma->ref_entries[(unsigned) ino].refs); + } + ext2fs_free_mem(&ma->ref_entries); + } + ext2fs_free_mem(&ma); + } + if (irel->name) + ext2fs_free_mem(&irel->name); + ext2fs_free_mem(&irel); + return 0; +} diff --git a/portlibs/sources/libext2fs/source/ismounted.c b/portlibs/sources/libext2fs/source/ismounted.c new file mode 100644 index 00000000..bc1134fc --- /dev/null +++ b/portlibs/sources/libext2fs/source/ismounted.c @@ -0,0 +1,383 @@ +/* + * ismounted.c --- Check to see if the filesystem was mounted + * + * Copyright (C) 1995,1996,1997,1998,1999,2000 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#include <fcntl.h> +#ifdef HAVE_LINUX_FD_H +#include <linux/fd.h> +#endif +#ifdef HAVE_MNTENT_H +#include <mntent.h> +#endif +#ifdef HAVE_GETMNTINFO +#include <paths.h> +#include <sys/param.h> +#include <sys/mount.h> +#endif /* HAVE_GETMNTINFO */ +#include <string.h> +#include <sys/stat.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +#ifdef HAVE_MNTENT_H +/* + * Helper function which checks a file in /etc/mtab format to see if a + * filesystem is mounted. Returns an error if the file doesn't exist + * or can't be opened. + */ +static errcode_t check_mntent_file(const char *mtab_file, const char *file, + int *mount_flags, char *mtpt, int mtlen) +{ + struct mntent *mnt; + struct stat st_buf; + errcode_t retval = 0; + dev_t file_dev=0, file_rdev=0; + ino_t file_ino=0; + FILE *f; + int fd; + + *mount_flags = 0; + if ((f = setmntent (mtab_file, "r")) == NULL) + return (errno == ENOENT ? EXT2_NO_MTAB_FILE : errno); + if (stat(file, &st_buf) == 0) { + if (S_ISBLK(st_buf.st_mode)) { +#ifndef __GNU__ /* The GNU hurd is broken with respect to stat devices */ + file_rdev = st_buf.st_rdev; +#endif /* __GNU__ */ + } else { + file_dev = st_buf.st_dev; + file_ino = st_buf.st_ino; + } + } + while ((mnt = getmntent (f)) != NULL) { + if (mnt->mnt_fsname[0] != '/') + continue; + if (strcmp(file, mnt->mnt_fsname) == 0) + break; + if (stat(mnt->mnt_fsname, &st_buf) == 0) { + if (S_ISBLK(st_buf.st_mode)) { +#ifndef __GNU__ + if (file_rdev && (file_rdev == st_buf.st_rdev)) + break; +#endif /* __GNU__ */ + } else { + if (file_dev && ((file_dev == st_buf.st_dev) && + (file_ino == st_buf.st_ino))) + break; + } + } + } + + if (mnt == 0) { +#ifndef __GNU__ /* The GNU hurd is broken with respect to stat devices */ + /* + * Do an extra check to see if this is the root device. We + * can't trust /etc/mtab, and /proc/mounts will only list + * /dev/root for the root filesystem. Argh. Instead we + * check if the given device has the same major/minor number + * as the device that the root directory is on. + */ + if (file_rdev && stat("/", &st_buf) == 0) { + if (st_buf.st_dev == file_rdev) { + *mount_flags = EXT2_MF_MOUNTED; + if (mtpt) + strncpy(mtpt, "/", mtlen); + goto is_root; + } + } +#endif /* __GNU__ */ + goto errout; + } +#ifndef __GNU__ /* The GNU hurd is deficient; what else is new? */ + /* Validate the entry in case /etc/mtab is out of date */ + /* + * We need to be paranoid, because some broken distributions + * (read: Slackware) don't initialize /etc/mtab before checking + * all of the non-root filesystems on the disk. + */ + if (stat(mnt->mnt_dir, &st_buf) < 0) { + retval = errno; + if (retval == ENOENT) { +#ifdef DEBUG + printf("Bogus entry in %s! (%s does not exist)\n", + mtab_file, mnt->mnt_dir); +#endif /* DEBUG */ + retval = 0; + } + goto errout; + } + if (file_rdev && (st_buf.st_dev != file_rdev)) { +#ifdef DEBUG + printf("Bogus entry in %s! (%s not mounted on %s)\n", + mtab_file, file, mnt->mnt_dir); +#endif /* DEBUG */ + goto errout; + } +#endif /* __GNU__ */ + *mount_flags = EXT2_MF_MOUNTED; + +#ifdef MNTOPT_RO + /* Check to see if the ro option is set */ + if (hasmntopt(mnt, MNTOPT_RO)) + *mount_flags |= EXT2_MF_READONLY; +#endif + + if (mtpt) + strncpy(mtpt, mnt->mnt_dir, mtlen); + /* + * Check to see if we're referring to the root filesystem. + * If so, do a manual check to see if we can open /etc/mtab + * read/write, since if the root is mounted read/only, the + * contents of /etc/mtab may not be accurate. + */ + if (!strcmp(mnt->mnt_dir, "/")) { +is_root: +#define TEST_FILE "/.ismount-test-file" + *mount_flags |= EXT2_MF_ISROOT; + fd = open(TEST_FILE, O_RDWR|O_CREAT, 0600); + if (fd < 0) { + if (errno == EROFS) + *mount_flags |= EXT2_MF_READONLY; + } else + close(fd); + (void) unlink(TEST_FILE); + } + retval = 0; +errout: + endmntent (f); + return retval; +} + +static errcode_t check_mntent(const char *file, int *mount_flags, + char *mtpt, int mtlen) +{ + errcode_t retval; + +#ifdef DEBUG + retval = check_mntent_file("/tmp/mtab", file, mount_flags, + mtpt, mtlen); + if (retval == 0) + return 0; +#endif /* DEBUG */ +#ifdef __linux__ + retval = check_mntent_file("/proc/mounts", file, mount_flags, + mtpt, mtlen); + if (retval == 0 && (*mount_flags != 0)) + return 0; +#endif /* __linux__ */ +#if defined(MOUNTED) || defined(_PATH_MOUNTED) +#ifndef MOUNTED +#define MOUNTED _PATH_MOUNTED +#endif /* MOUNTED */ + retval = check_mntent_file(MOUNTED, file, mount_flags, mtpt, mtlen); + return retval; +#else + *mount_flags = 0; + return 0; +#endif /* defined(MOUNTED) || defined(_PATH_MOUNTED) */ +} + +#else +#if defined(HAVE_GETMNTINFO) + +static errcode_t check_getmntinfo(const char *file, int *mount_flags, + char *mtpt, int mtlen) +{ + struct statfs *mp; + int len, n; + const char *s1; + char *s2; + + n = getmntinfo(&mp, MNT_NOWAIT); + if (n == 0) + return errno; + + len = sizeof(_PATH_DEV) - 1; + s1 = file; + if (strncmp(_PATH_DEV, s1, len) == 0) + s1 += len; + + *mount_flags = 0; + while (--n >= 0) { + s2 = mp->f_mntfromname; + if (strncmp(_PATH_DEV, s2, len) == 0) { + s2 += len - 1; + *s2 = 'r'; + } + if (strcmp(s1, s2) == 0 || strcmp(s1, &s2[1]) == 0) { + *mount_flags = EXT2_MF_MOUNTED; + break; + } + ++mp; + } + if (mtpt) + strncpy(mtpt, mp->f_mntonname, mtlen); + return 0; +} +#endif /* HAVE_GETMNTINFO */ +#endif /* HAVE_MNTENT_H */ + +/* + * Check to see if we're dealing with the swap device. + */ +static int is_swap_device(const char *file) +{ + FILE *f; + char buf[1024], *cp; + dev_t file_dev; + struct stat st_buf; + int ret = 0; + + file_dev = 0; +#ifndef __GNU__ /* The GNU hurd is broken with respect to stat devices */ + if ((stat(file, &st_buf) == 0) && + S_ISBLK(st_buf.st_mode)) + file_dev = st_buf.st_rdev; +#endif /* __GNU__ */ + + if (!(f = fopen("/proc/swaps", "r"))) + return 0; + /* Skip the first line */ + if (!fgets(buf, sizeof(buf), f)) + goto leave; + if (*buf && strncmp(buf, "Filename\t", 9)) + /* Linux <=2.6.19 contained a bug in the /proc/swaps + * code where the header would not be displayed + */ + goto valid_first_line; + + while (fgets(buf, sizeof(buf), f)) { +valid_first_line: + if ((cp = strchr(buf, ' ')) != NULL) + *cp = 0; + if ((cp = strchr(buf, '\t')) != NULL) + *cp = 0; + if (strcmp(buf, file) == 0) { + ret++; + break; + } +#ifndef __GNU__ + if (file_dev && (stat(buf, &st_buf) == 0) && + S_ISBLK(st_buf.st_mode) && + file_dev == st_buf.st_rdev) { + ret++; + break; + } +#endif /* __GNU__ */ + } + +leave: + fclose(f); + return ret; +} + + +/* + * ext2fs_check_mount_point() fills determines if the device is + * mounted or otherwise busy, and fills in mount_flags with one or + * more of the following flags: EXT2_MF_MOUNTED, EXT2_MF_ISROOT, + * EXT2_MF_READONLY, EXT2_MF_SWAP, and EXT2_MF_BUSY. If mtpt is + * non-NULL, the directory where the device is mounted is copied to + * where mtpt is pointing, up to mtlen characters. + */ +#ifdef __TURBOC__ + #pragma argsused +#endif +errcode_t ext2fs_check_mount_point(const char *device, int *mount_flags, + char *mtpt, int mtlen) +{ + errcode_t retval = 0; + + if (is_swap_device(device)) { + *mount_flags = EXT2_MF_MOUNTED | EXT2_MF_SWAP; + strncpy(mtpt, "<swap>", mtlen); + } else { +#ifdef HAVE_MNTENT_H + retval = check_mntent(device, mount_flags, mtpt, mtlen); +#else +#ifdef HAVE_GETMNTINFO + retval = check_getmntinfo(device, mount_flags, mtpt, mtlen); +#else + *mount_flags = 0; +#endif /* HAVE_GETMNTINFO */ +#endif /* HAVE_MNTENT_H */ + } + if (retval) + return retval; + +#ifdef __linux__ /* This only works on Linux 2.6+ systems */ + if ((stat(device, &st_buf) != 0) || + !S_ISBLK(st_buf.st_mode)) + return 0; + fd = open(device, O_RDONLY | O_EXCL); + if (fd < 0) { + if (errno == EBUSY) + *mount_flags |= EXT2_MF_BUSY; + } else + close(fd); +#endif + + return 0; +} + +/* + * ext2fs_check_if_mounted() sets the mount_flags EXT2_MF_MOUNTED, + * EXT2_MF_READONLY, and EXT2_MF_ROOT + * + */ +errcode_t ext2fs_check_if_mounted(const char *file, int *mount_flags) +{ + return ext2fs_check_mount_point(file, mount_flags, NULL, 0); +} + +#ifdef DEBUG +int main(int argc, char **argv) +{ + int retval, mount_flags; + char mntpt[80]; + + if (argc < 2) { + fprintf(stderr, "Usage: %s device\n", argv[0]); + exit(1); + } + + add_error_table(&et_ext2_error_table); + mntpt[0] = 0; + retval = ext2fs_check_mount_point(argv[1], &mount_flags, + mntpt, sizeof(mntpt)); + if (retval) { + com_err(argv[0], retval, + "while calling ext2fs_check_if_mounted"); + exit(1); + } + printf("Device %s reports flags %02x\n", argv[1], mount_flags); + if (mount_flags & EXT2_MF_BUSY) + printf("\t%s is apparently in use.\n", argv[1]); + if (mount_flags & EXT2_MF_MOUNTED) + printf("\t%s is mounted.\n", argv[1]); + if (mount_flags & EXT2_MF_SWAP) + printf("\t%s is a swap device.\n", argv[1]); + if (mount_flags & EXT2_MF_READONLY) + printf("\t%s is read-only.\n", argv[1]); + if (mount_flags & EXT2_MF_ISROOT) + printf("\t%s is the root filesystem.\n", argv[1]); + if (mntpt[0]) + printf("\t%s is mounted on %s.\n", argv[1], mntpt); + exit(0); +} +#endif /* DEBUG */ diff --git a/portlibs/sources/libext2fs/source/jfs_compat.h b/portlibs/sources/libext2fs/source/jfs_compat.h new file mode 100644 index 00000000..7b8aafd7 --- /dev/null +++ b/portlibs/sources/libext2fs/source/jfs_compat.h @@ -0,0 +1,68 @@ + +#ifndef _JFS_COMPAT_H +#define _JFS_COMPAT_H + +#include "kernel-list.h" +#include <errno.h> +#ifdef HAVE_NETINET_IN_H +#include <netinet/in.h> +#endif + +#define printk printf +#define KERN_ERR "" +#define KERN_DEBUG "" + +#define READ 0 +#define WRITE 1 + +#define cpu_to_be32(n) htonl(n) +#define be32_to_cpu(n) ntohl(n) + +typedef unsigned int tid_t; +typedef struct journal_s journal_t; + +struct buffer_head; +struct inode; + +struct journal_s +{ + unsigned long j_flags; + int j_errno; + struct buffer_head * j_sb_buffer; + struct journal_superblock_s *j_superblock; + int j_format_version; + unsigned long j_head; + unsigned long j_tail; + unsigned long j_free; + unsigned long j_first, j_last; + kdev_t j_dev; + kdev_t j_fs_dev; + int j_blocksize; + unsigned int j_blk_offset; + unsigned int j_maxlen; + struct inode * j_inode; + tid_t j_tail_sequence; + tid_t j_transaction_sequence; + __u8 j_uuid[16]; + struct jbd_revoke_table_s *j_revoke; + tid_t j_failed_commit; +}; + +#define J_ASSERT(assert) \ + do { if (!(assert)) { \ + printf ("Assertion failure in %s() at %s line %d: " \ + "\"%s\"\n", \ + __FUNCTION__, __FILE__, __LINE__, # assert); \ + fatal_error(e2fsck_global_ctx, 0); \ + } } while (0) + +#define is_journal_abort(x) 0 + +#define BUFFER_TRACE(bh, info) do {} while (0) + +/* Need this so we can compile with configure --enable-gcc-wall */ +#ifdef NO_INLINE_FUNCS +#define inline +#endif + +#endif /* _JFS_COMPAT_H */ diff --git a/portlibs/sources/libext2fs/source/jfs_dat.h b/portlibs/sources/libext2fs/source/jfs_dat.h new file mode 100644 index 00000000..62778c62 --- /dev/null +++ b/portlibs/sources/libext2fs/source/jfs_dat.h @@ -0,0 +1,64 @@ +/* + * jfs_dat.h --- stripped down header file which only contains the JFS + * on-disk data structures + */ + +#define JFS_MAGIC_NUMBER 0xc03b3998U /* The first 4 bytes of /dev/random! */ + +/* + * On-disk structures + */ + +/* + * Descriptor block types: + */ + +#define JFS_DESCRIPTOR_BLOCK 1 +#define JFS_COMMIT_BLOCK 2 +#define JFS_SUPERBLOCK 3 + +/* + * Standard header for all descriptor blocks: + */ +typedef struct journal_header_s +{ + __u32 h_magic; + __u32 h_blocktype; + __u32 h_sequence; +} journal_header_t; + + +/* + * The block tag: used to describe a single buffer in the journal + */ +typedef struct journal_block_tag_s +{ + __u32 t_blocknr; /* The on-disk block number */ + __u32 t_flags; /* See below */ +} journal_block_tag_t; + +/* Definitions for the journal tag flags word: */ +#define JFS_FLAG_ESCAPE 1 /* on-disk block is escaped */ +#define JFS_FLAG_SAME_UUID 2 /* block has same uuid as previous */ +#define JFS_FLAG_DELETED 4 /* block deleted by this transaction */ +#define JFS_FLAG_LAST_TAG 8 /* last tag in this descriptor block */ + + +/* + * The journal superblock + */ +typedef struct journal_superblock_s +{ + journal_header_t s_header; + + /* Static information describing the journal */ + __u32 s_blocksize; /* journal device blocksize */ + __u32 s_maxlen; /* total blocks in journal file */ + __u32 s_first; /* first block of log information */ + + /* Dynamic information describing the current state of the log */ + __u32 s_sequence; /* first commit ID expected in log */ + __u32 s_start; /* blocknr of start of log */ + +} journal_superblock_t; + diff --git a/portlibs/sources/libext2fs/source/jfs_user.h b/portlibs/sources/libext2fs/source/jfs_user.h new file mode 100644 index 00000000..3a521230 --- /dev/null +++ b/portlibs/sources/libext2fs/source/jfs_user.h @@ -0,0 +1,8 @@ +#ifndef _JFS_USER_H +#define _JFS_USER_H + +typedef unsigned short kdev_t; + +#include "kernel-jbd.h" + +#endif /* _JFS_USER_H */ diff --git a/portlibs/sources/libext2fs/source/kernel-jbd.h b/portlibs/sources/libext2fs/source/kernel-jbd.h new file mode 100644 index 00000000..066c031e --- /dev/null +++ b/portlibs/sources/libext2fs/source/kernel-jbd.h @@ -0,0 +1,952 @@ +/* + * linux/include/linux/jbd.h + * + * Written by Stephen C. Tweedie <sct@redhat.com> + * + * Copyright 1998-2000 Red Hat, Inc --- All Rights Reserved + * + * This file is part of the Linux kernel and is made available under + * the terms of the GNU General Public License, version 2, or at your + * option, any later version, incorporated herein by reference. + * + * Definitions for transaction data structures for the buffer cache + * filesystem journaling support. + */ + +#ifndef _LINUX_JBD_H +#define _LINUX_JBD_H + +#if defined(CONFIG_JBD) || defined(CONFIG_JBD_MODULE) || !defined(__KERNEL__) + +/* Allow this file to be included directly into e2fsprogs */ +#ifndef __KERNEL__ +#include "jfs_compat.h" +#define JFS_DEBUG +#define jfs_debug jbd_debug +#else + +#include <linux/journal-head.h> +#include <linux/stddef.h> +#include <asm/semaphore.h> +#endif + +#ifndef __GNUC__ +#define __FUNCTION__ "" +#endif + +#define journal_oom_retry 1 + +#ifdef __STDC__ +#ifdef CONFIG_JBD_DEBUG +/* + * Define JBD_EXPENSIVE_CHECKING to enable more expensive internal + * consistency checks. By default we don't do this unless + * CONFIG_JBD_DEBUG is on. + */ +#define JBD_EXPENSIVE_CHECKING +extern int journal_enable_debug; + +#define jbd_debug(n, f, a...) \ + do { \ + if ((n) <= journal_enable_debug) { \ + printk (KERN_DEBUG "(%s, %d): %s: ", \ + __FILE__, __LINE__, __FUNCTION__); \ + printk (f, ## a); \ + } \ + } while (0) +#else +#ifdef __GNUC__ +#define jbd_debug(f, a...) /**/ +#else +#define jbd_debug(f, ...) /**/ +#endif +#endif +#else +#define jbd_debug(x) /* AIX doesn't do STDC */ +#endif + +extern void * __jbd_kmalloc (char *where, size_t size, int flags, int retry); +#define jbd_kmalloc(size, flags) \ + __jbd_kmalloc(__FUNCTION__, (size), (flags), journal_oom_retry) +#define jbd_rep_kmalloc(size, flags) \ + __jbd_kmalloc(__FUNCTION__, (size), (flags), 1) + +#define JFS_MIN_JOURNAL_BLOCKS 1024 + +#ifdef __KERNEL__ +typedef struct handle_s handle_t; /* Atomic operation type */ +typedef struct journal_s journal_t; /* Journal control structure */ +#endif + +/* + * Internal structures used by the logging mechanism: + */ + +#define JFS_MAGIC_NUMBER 0xc03b3998U /* The first 4 bytes of /dev/random! */ + +/* + * On-disk structures + */ + +/* + * Descriptor block types: + */ + +#define JFS_DESCRIPTOR_BLOCK 1 +#define JFS_COMMIT_BLOCK 2 +#define JFS_SUPERBLOCK_V1 3 +#define JFS_SUPERBLOCK_V2 4 +#define JFS_REVOKE_BLOCK 5 + +/* + * Standard header for all descriptor blocks: + */ +typedef struct journal_header_s +{ + __u32 h_magic; + __u32 h_blocktype; + __u32 h_sequence; +} journal_header_t; + +/* + * Checksum types. + */ +#define JBD2_CRC32_CHKSUM 1 +#define JBD2_MD5_CHKSUM 2 +#define JBD2_SHA1_CHKSUM 3 + +#define JBD2_CRC32_CHKSUM_SIZE 4 + +#define JBD2_CHECKSUM_BYTES (32 / sizeof(__u32)) +/* + * Commit block header for storing transactional checksums: + */ +struct commit_header { + __u32 h_magic; + __u32 h_blocktype; + __u32 h_sequence; + unsigned char h_chksum_type; + unsigned char h_chksum_size; + unsigned char h_padding[2]; + __u32 h_chksum[JBD2_CHECKSUM_BYTES]; + __u64 h_commit_sec; + __u32 h_commit_nsec; +}; + +/* + * The block tag: used to describe a single buffer in the journal + */ +typedef struct journal_block_tag_s +{ + __u32 t_blocknr; /* The on-disk block number */ + __u32 t_flags; /* See below */ + __u32 t_blocknr_high; /* most-significant high 32bits. */ +} journal_block_tag_t; + +#define JBD_TAG_SIZE64 (sizeof(journal_block_tag_t)) +#define JBD_TAG_SIZE32 (8) + +/* + * The revoke descriptor: used on disk to describe a series of blocks to + * be revoked from the log + */ +typedef struct journal_revoke_header_s +{ + journal_header_t r_header; + int r_count; /* Count of bytes used in the block */ +} journal_revoke_header_t; + + +/* Definitions for the journal tag flags word: */ +#define JFS_FLAG_ESCAPE 1 /* on-disk block is escaped */ +#define JFS_FLAG_SAME_UUID 2 /* block has same uuid as previous */ +#define JFS_FLAG_DELETED 4 /* block deleted by this transaction */ +#define JFS_FLAG_LAST_TAG 8 /* last tag in this descriptor block */ + + +/* + * The journal superblock. All fields are in big-endian byte order. + */ +typedef struct journal_superblock_s +{ +/* 0x0000 */ + journal_header_t s_header; + +/* 0x000C */ + /* Static information describing the journal */ + __u32 s_blocksize; /* journal device blocksize */ + __u32 s_maxlen; /* total blocks in journal file */ + __u32 s_first; /* first block of log information */ + +/* 0x0018 */ + /* Dynamic information describing the current state of the log */ + __u32 s_sequence; /* first commit ID expected in log */ + __u32 s_start; /* blocknr of start of log */ + +/* 0x0020 */ + /* Error value, as set by journal_abort(). */ + __s32 s_errno; + +/* 0x0024 */ + /* Remaining fields are only valid in a version-2 superblock */ + __u32 s_feature_compat; /* compatible feature set */ + __u32 s_feature_incompat; /* incompatible feature set */ + __u32 s_feature_ro_compat; /* readonly-compatible feature set */ +/* 0x0030 */ + __u8 s_uuid[16]; /* 128-bit uuid for journal */ + +/* 0x0040 */ + __u32 s_nr_users; /* Nr of filesystems sharing log */ + + __u32 s_dynsuper; /* Blocknr of dynamic superblock copy*/ + +/* 0x0048 */ + __u32 s_max_transaction; /* Limit of journal blocks per trans.*/ + __u32 s_max_trans_data; /* Limit of data blocks per trans. */ + +/* 0x0050 */ + __u32 s_padding[44]; + +/* 0x0100 */ + __u8 s_users[16*48]; /* ids of all fs'es sharing the log */ +/* 0x0400 */ +} journal_superblock_t; + +#define JFS_HAS_COMPAT_FEATURE(j,mask) \ + ((j)->j_format_version >= 2 && \ + ((j)->j_superblock->s_feature_compat & cpu_to_be32((mask)))) +#define JFS_HAS_RO_COMPAT_FEATURE(j,mask) \ + ((j)->j_format_version >= 2 && \ + ((j)->j_superblock->s_feature_ro_compat & cpu_to_be32((mask)))) +#define JFS_HAS_INCOMPAT_FEATURE(j,mask) \ + ((j)->j_format_version >= 2 && \ + ((j)->j_superblock->s_feature_incompat & cpu_to_be32((mask)))) + +#define JFS_FEATURE_COMPAT_CHECKSUM 0x00000001 + +#define JFS_FEATURE_INCOMPAT_REVOKE 0x00000001 + +#define JFS_FEATURE_INCOMPAT_REVOKE 0x00000001 +#define JFS_FEATURE_INCOMPAT_64BIT 0x00000002 +#define JFS_FEATURE_INCOMPAT_ASYNC_COMMIT 0x00000004 + +/* Features known to this kernel version: */ +#define JFS_KNOWN_COMPAT_FEATURES 0 +#define JFS_KNOWN_ROCOMPAT_FEATURES 0 +#define JFS_KNOWN_INCOMPAT_FEATURES (JFS_FEATURE_INCOMPAT_REVOKE|\ + JFS_FEATURE_INCOMPAT_ASYNC_COMMIT|\ + JFS_FEATURE_INCOMPAT_64BIT) + +#ifdef __KERNEL__ + +#include <linux/fs.h> +#include <linux/sched.h> + +#define JBD_ASSERTIONS +#ifdef JBD_ASSERTIONS +#define J_ASSERT(assert) \ +do { \ + if (!(assert)) { \ + printk (KERN_EMERG \ + "Assertion failure in %s() at %s:%d: \"%s\"\n", \ + __FUNCTION__, __FILE__, __LINE__, # assert); \ + BUG(); \ + } \ +} while (0) + +#if defined(CONFIG_BUFFER_DEBUG) +void buffer_assertion_failure(struct buffer_head *bh); +#define J_ASSERT_BH(bh, expr) \ + do { \ + if (!(expr)) \ + buffer_assertion_failure(bh); \ + J_ASSERT(expr); \ + } while (0) +#define J_ASSERT_JH(jh, expr) J_ASSERT_BH(jh2bh(jh), expr) +#else +#define J_ASSERT_BH(bh, expr) J_ASSERT(expr) +#define J_ASSERT_JH(jh, expr) J_ASSERT(expr) +#endif + +#else +#define J_ASSERT(assert) +#endif /* JBD_ASSERTIONS */ + +enum jbd_state_bits { + BH_JWrite + = BH_PrivateStart, /* 1 if being written to log (@@@ DEBUGGING) */ + BH_Freed, /* 1 if buffer has been freed (truncated) */ + BH_Revoked, /* 1 if buffer has been revoked from the log */ + BH_RevokeValid, /* 1 if buffer revoked flag is valid */ + BH_JBDDirty, /* 1 if buffer is dirty but journaled */ +}; + +/* Return true if the buffer is one which JBD is managing */ +static inline int buffer_jbd(struct buffer_head *bh) +{ + return __buffer_state(bh, JBD); +} + +static inline struct buffer_head *jh2bh(struct journal_head *jh) +{ + return jh->b_bh; +} + +static inline struct journal_head *bh2jh(struct buffer_head *bh) +{ + return bh->b_private; +} + +struct jbd_revoke_table_s; + +/* The handle_t type represents a single atomic update being performed + * by some process. All filesystem modifications made by the process go + * through this handle. Recursive operations (such as quota operations) + * are gathered into a single update. + * + * The buffer credits field is used to account for journaled buffers + * being modified by the running process. To ensure that there is + * enough log space for all outstanding operations, we need to limit the + * number of outstanding buffers possible at any time. When the + * operation completes, any buffer credits not used are credited back to + * the transaction, so that at all times we know how many buffers the + * outstanding updates on a transaction might possibly touch. */ + +struct handle_s +{ + /* Which compound transaction is this update a part of? */ + transaction_t * h_transaction; + + /* Number of remaining buffers we are allowed to dirty: */ + int h_buffer_credits; + + /* Reference count on this handle */ + int h_ref; + + /* Field for caller's use to track errors through large fs + operations */ + int h_err; + + /* Flags */ + unsigned int h_sync: 1; /* sync-on-close */ + unsigned int h_jdata: 1; /* force data journaling */ + unsigned int h_aborted: 1; /* fatal error on handle */ +}; + + +/* The transaction_t type is the guts of the journaling mechanism. It + * tracks a compound transaction through its various states: + * + * RUNNING: accepting new updates + * LOCKED: Updates still running but we don't accept new ones + * RUNDOWN: Updates are tidying up but have finished requesting + * new buffers to modify (state not used for now) + * FLUSH: All updates complete, but we are still writing to disk + * COMMIT: All data on disk, writing commit record + * FINISHED: We still have to keep the transaction for checkpointing. + * + * The transaction keeps track of all of the buffers modified by a + * running transaction, and all of the buffers committed but not yet + * flushed to home for finished transactions. + */ + +struct transaction_s +{ + /* Pointer to the journal for this transaction. */ + journal_t * t_journal; + + /* Sequence number for this transaction */ + tid_t t_tid; + + /* Transaction's current state */ + enum { + T_RUNNING, + T_LOCKED, + T_RUNDOWN, + T_FLUSH, + T_COMMIT, + T_FINISHED + } t_state; + + /* Where in the log does this transaction's commit start? */ + unsigned long t_log_start; + + /* Doubly-linked circular list of all inodes owned by this + transaction */ /* AKPM: unused */ + struct inode * t_ilist; + + /* Number of buffers on the t_buffers list */ + int t_nr_buffers; + + /* Doubly-linked circular list of all buffers reserved but not + yet modified by this transaction */ + struct journal_head * t_reserved_list; + + /* Doubly-linked circular list of all metadata buffers owned by this + transaction */ + struct journal_head * t_buffers; + + /* + * Doubly-linked circular list of all data buffers still to be + * flushed before this transaction can be committed. + * Protected by journal_datalist_lock. + */ + struct journal_head * t_sync_datalist; + + /* + * Doubly-linked circular list of all writepage data buffers + * still to be written before this transaction can be committed. + * Protected by journal_datalist_lock. + */ + struct journal_head * t_async_datalist; + + /* Doubly-linked circular list of all forget buffers (superceded + buffers which we can un-checkpoint once this transaction + commits) */ + struct journal_head * t_forget; + + /* + * Doubly-linked circular list of all buffers still to be + * flushed before this transaction can be checkpointed. + */ + /* Protected by journal_datalist_lock */ + struct journal_head * t_checkpoint_list; + + /* Doubly-linked circular list of temporary buffers currently + undergoing IO in the log */ + struct journal_head * t_iobuf_list; + + /* Doubly-linked circular list of metadata buffers being + shadowed by log IO. The IO buffers on the iobuf list and the + shadow buffers on this list match each other one for one at + all times. */ + struct journal_head * t_shadow_list; + + /* Doubly-linked circular list of control buffers being written + to the log. */ + struct journal_head * t_log_list; + + /* Number of outstanding updates running on this transaction */ + int t_updates; + + /* Number of buffers reserved for use by all handles in this + * transaction handle but not yet modified. */ + int t_outstanding_credits; + + /* + * Forward and backward links for the circular list of all + * transactions awaiting checkpoint. + */ + /* Protected by journal_datalist_lock */ + transaction_t *t_cpnext, *t_cpprev; + + /* When will the transaction expire (become due for commit), in + * jiffies ? */ + unsigned long t_expires; + + /* How many handles used this transaction? */ + int t_handle_count; +}; + + +/* The journal_t maintains all of the journaling state information for a + * single filesystem. It is linked to from the fs superblock structure. + * + * We use the journal_t to keep track of all outstanding transaction + * activity on the filesystem, and to manage the state of the log + * writing process. */ + +struct journal_s +{ + /* General journaling state flags */ + unsigned long j_flags; + + /* Is there an outstanding uncleared error on the journal (from + * a prior abort)? */ + int j_errno; + + /* The superblock buffer */ + struct buffer_head * j_sb_buffer; + journal_superblock_t * j_superblock; + + /* Version of the superblock format */ + int j_format_version; + + /* Number of processes waiting to create a barrier lock */ + int j_barrier_count; + + /* The barrier lock itself */ + struct semaphore j_barrier; + + /* Transactions: The current running transaction... */ + transaction_t * j_running_transaction; + + /* ... the transaction we are pushing to disk ... */ + transaction_t * j_committing_transaction; + + /* ... and a linked circular list of all transactions waiting + * for checkpointing. */ + /* Protected by journal_datalist_lock */ + transaction_t * j_checkpoint_transactions; + + /* Wait queue for waiting for a locked transaction to start + committing, or for a barrier lock to be released */ + wait_queue_head_t j_wait_transaction_locked; + + /* Wait queue for waiting for checkpointing to complete */ + wait_queue_head_t j_wait_logspace; + + /* Wait queue for waiting for commit to complete */ + wait_queue_head_t j_wait_done_commit; + + /* Wait queue to trigger checkpointing */ + wait_queue_head_t j_wait_checkpoint; + + /* Wait queue to trigger commit */ + wait_queue_head_t j_wait_commit; + + /* Wait queue to wait for updates to complete */ + wait_queue_head_t j_wait_updates; + + /* Semaphore for locking against concurrent checkpoints */ + struct semaphore j_checkpoint_sem; + + /* The main journal lock, used by lock_journal() */ + struct semaphore j_sem; + + /* Journal head: identifies the first unused block in the journal. */ + unsigned long j_head; + + /* Journal tail: identifies the oldest still-used block in the + * journal. */ + unsigned long j_tail; + + /* Journal free: how many free blocks are there in the journal? */ + unsigned long j_free; + + /* Journal start and end: the block numbers of the first usable + * block and one beyond the last usable block in the journal. */ + unsigned long j_first, j_last; + + /* Device, blocksize and starting block offset for the location + * where we store the journal. */ + kdev_t j_dev; + int j_blocksize; + unsigned int j_blk_offset; + + /* Device which holds the client fs. For internal journal this + * will be equal to j_dev. */ + kdev_t j_fs_dev; + + /* Total maximum capacity of the journal region on disk. */ + unsigned int j_maxlen; + + /* Optional inode where we store the journal. If present, all + * journal block numbers are mapped into this inode via + * bmap(). */ + struct inode * j_inode; + + /* Sequence number of the oldest transaction in the log */ + tid_t j_tail_sequence; + /* Sequence number of the next transaction to grant */ + tid_t j_transaction_sequence; + /* Sequence number of the most recently committed transaction */ + tid_t j_commit_sequence; + /* Sequence number of the most recent transaction wanting commit */ + tid_t j_commit_request; + + /* Journal uuid: identifies the object (filesystem, LVM volume + * etc) backed by this journal. This will eventually be + * replaced by an array of uuids, allowing us to index multiple + * devices within a single journal and to perform atomic updates + * across them. */ + + __u8 j_uuid[16]; + + /* Pointer to the current commit thread for this journal */ + struct task_struct * j_task; + + /* Maximum number of metadata buffers to allow in a single + * compound commit transaction */ + int j_max_transaction_buffers; + + /* What is the maximum transaction lifetime before we begin a + * commit? */ + unsigned long j_commit_interval; + + /* The timer used to wakeup the commit thread: */ + struct timer_list * j_commit_timer; + int j_commit_timer_active; + + /* Link all journals together - system-wide */ + struct list_head j_all_journals; + + /* The revoke table: maintains the list of revoked blocks in the + current transaction. */ + struct jbd_revoke_table_s *j_revoke; + + /* Failed journal commit ID */ + unsigned int j_failed_commit; +}; + +/* + * Journal flag definitions + */ +#define JFS_UNMOUNT 0x001 /* Journal thread is being destroyed */ +#define JFS_ABORT 0x002 /* Journaling has been aborted for errors. */ +#define JFS_ACK_ERR 0x004 /* The errno in the sb has been acked */ +#define JFS_FLUSHED 0x008 /* The journal superblock has been flushed */ +#define JFS_LOADED 0x010 /* The journal superblock has been loaded */ + +/* + * Function declarations for the journaling transaction and buffer + * management + */ + +/* Filing buffers */ +extern void __journal_unfile_buffer(struct journal_head *); +extern void journal_unfile_buffer(struct journal_head *); +extern void __journal_refile_buffer(struct journal_head *); +extern void journal_refile_buffer(struct journal_head *); +extern void __journal_file_buffer(struct journal_head *, transaction_t *, int); +extern void __journal_free_buffer(struct journal_head *bh); +extern void journal_file_buffer(struct journal_head *, transaction_t *, int); +extern void __journal_clean_data_list(transaction_t *transaction); + +/* Log buffer allocation */ +extern struct journal_head * journal_get_descriptor_buffer(journal_t *); +extern unsigned long journal_next_log_block(journal_t *); + +/* Commit management */ +extern void journal_commit_transaction(journal_t *); + +/* Checkpoint list management */ +int __journal_clean_checkpoint_list(journal_t *journal); +extern void journal_remove_checkpoint(struct journal_head *); +extern void __journal_remove_checkpoint(struct journal_head *); +extern void journal_insert_checkpoint(struct journal_head *, transaction_t *); +extern void __journal_insert_checkpoint(struct journal_head *,transaction_t *); + +/* Buffer IO */ +extern int +journal_write_metadata_buffer(transaction_t *transaction, + struct journal_head *jh_in, + struct journal_head **jh_out, + int blocknr); + +/* Transaction locking */ +extern void __wait_on_journal (journal_t *); + +/* + * Journal locking. + * + * We need to lock the journal during transaction state changes so that + * nobody ever tries to take a handle on the running transaction while + * we are in the middle of moving it to the commit phase. + * + * Note that the locking is completely interrupt unsafe. We never touch + * journal structures from interrupts. + * + * In 2.2, the BKL was required for lock_journal. This is no longer + * the case. + */ + +static inline void lock_journal(journal_t *journal) +{ + down(&journal->j_sem); +} + +/* This returns zero if we acquired the semaphore */ +static inline int try_lock_journal(journal_t * journal) +{ + return down_trylock(&journal->j_sem); +} + +static inline void unlock_journal(journal_t * journal) +{ + up(&journal->j_sem); +} + + +static inline handle_t *journal_current_handle(void) +{ + return current->journal_info; +} + +/* The journaling code user interface: + * + * Create and destroy handles + * Register buffer modifications against the current transaction. + */ + +extern handle_t *journal_start(journal_t *, int nblocks); +extern handle_t *journal_try_start(journal_t *, int nblocks); +extern int journal_restart (handle_t *, int nblocks); +extern int journal_extend (handle_t *, int nblocks); +extern int journal_get_write_access (handle_t *, struct buffer_head *); +extern int journal_get_create_access (handle_t *, struct buffer_head *); +extern int journal_get_undo_access (handle_t *, struct buffer_head *); +extern int journal_dirty_data (handle_t *, + struct buffer_head *, int async); +extern int journal_dirty_metadata (handle_t *, struct buffer_head *); +extern void journal_release_buffer (handle_t *, struct buffer_head *); +extern void journal_forget (handle_t *, struct buffer_head *); +extern void journal_sync_buffer (struct buffer_head *); +extern int journal_flushpage(journal_t *, struct page *, unsigned long); +extern int journal_try_to_free_buffers(journal_t *, struct page *, int); +extern int journal_stop(handle_t *); +extern int journal_flush (journal_t *); + +extern void journal_lock_updates (journal_t *); +extern void journal_unlock_updates (journal_t *); + +extern journal_t * journal_init_dev(kdev_t dev, kdev_t fs_dev, + int start, int len, int bsize); +extern journal_t * journal_init_inode (struct inode *); +extern int journal_update_format (journal_t *); +extern int journal_check_used_features + (journal_t *, unsigned long, unsigned long, unsigned long); +extern int journal_check_available_features + (journal_t *, unsigned long, unsigned long, unsigned long); +extern int journal_set_features + (journal_t *, unsigned long, unsigned long, unsigned long); +extern int journal_create (journal_t *); +extern int journal_load (journal_t *journal); +extern void journal_destroy (journal_t *); +extern int journal_recover (journal_t *journal); +extern int journal_wipe (journal_t *, int); +extern int journal_skip_recovery (journal_t *); +extern void journal_update_superblock (journal_t *, int); +extern void __journal_abort (journal_t *); +extern void journal_abort (journal_t *, int); +extern int journal_errno (journal_t *); +extern void journal_ack_err (journal_t *); +extern int journal_clear_err (journal_t *); +extern unsigned long journal_bmap(journal_t *journal, unsigned long blocknr); +extern int journal_force_commit(journal_t *journal); + +/* + * journal_head management + */ +extern struct journal_head + *journal_add_journal_head(struct buffer_head *bh); +extern void journal_remove_journal_head(struct buffer_head *bh); +extern void __journal_remove_journal_head(struct buffer_head *bh); +extern void journal_unlock_journal_head(struct journal_head *jh); + +/* Primary revoke support */ +#define JOURNAL_REVOKE_DEFAULT_HASH 256 +extern int journal_init_revoke(journal_t *, int); +extern void journal_destroy_revoke_caches(void); +extern int journal_init_revoke_caches(void); + +extern void journal_destroy_revoke(journal_t *); +extern int journal_revoke (handle_t *, + unsigned long, struct buffer_head *); +extern int journal_cancel_revoke(handle_t *, struct journal_head *); +extern void journal_write_revoke_records(journal_t *, transaction_t *); + +/* Recovery revoke support */ +extern int journal_set_revoke(journal_t *, unsigned long, tid_t); +extern int journal_test_revoke(journal_t *, unsigned long, tid_t); +extern void journal_clear_revoke(journal_t *); +extern void journal_brelse_array(struct buffer_head *b[], int n); + +/* The log thread user interface: + * + * Request space in the current transaction, and force transaction commit + * transitions on demand. + */ + +extern int log_space_left (journal_t *); /* Called with journal locked */ +extern tid_t log_start_commit (journal_t *, transaction_t *); +extern void log_wait_commit (journal_t *, tid_t); +extern int log_do_checkpoint (journal_t *, int); + +extern void log_wait_for_space(journal_t *, int nblocks); +extern void __journal_drop_transaction(journal_t *, transaction_t *); +extern int cleanup_journal_tail(journal_t *); + +/* Reduce journal memory usage by flushing */ +extern void shrink_journal_memory(void); + +/* Debugging code only: */ + +#define jbd_ENOSYS() \ +do { \ + printk (KERN_ERR "JBD unimplemented function " __FUNCTION__); \ + current->state = TASK_UNINTERRUPTIBLE; \ + schedule(); \ +} while (1) + +/* + * is_journal_abort + * + * Simple test wrapper function to test the JFS_ABORT state flag. This + * bit, when set, indicates that we have had a fatal error somewhere, + * either inside the journaling layer or indicated to us by the client + * (eg. ext3), and that we and should not commit any further + * transactions. + */ + +static inline int is_journal_aborted(journal_t *journal) +{ + return journal->j_flags & JFS_ABORT; +} + +static inline int is_handle_aborted(handle_t *handle) +{ + if (handle->h_aborted) + return 1; + return is_journal_aborted(handle->h_transaction->t_journal); +} + +static inline void journal_abort_handle(handle_t *handle) +{ + handle->h_aborted = 1; +} + +/* Not all architectures define BUG() */ +#ifndef BUG +#define BUG() do { \ + printk("kernel BUG at %s:%d!\n", __FILE__, __LINE__); \ + * ((char *) 0) = 0; \ + } while (0) +#endif /* BUG */ + +#else + +extern int journal_recover (journal_t *journal); +extern int journal_skip_recovery (journal_t *); + +/* Primary revoke support */ +extern int journal_init_revoke(journal_t *, int); +extern void journal_destroy_revoke_caches(void); +extern int journal_init_revoke_caches(void); + +/* Recovery revoke support */ +extern int journal_set_revoke(journal_t *, unsigned long, tid_t); +extern int journal_test_revoke(journal_t *, unsigned long, tid_t); +extern void journal_clear_revoke(journal_t *); +extern void journal_brelse_array(struct buffer_head *b[], int n); + +extern void journal_destroy_revoke(journal_t *); +#endif /* __KERNEL__ */ + +static inline int tid_gt(tid_t x, tid_t y) EXT2FS_ATTR((unused)); +static inline int tid_geq(tid_t x, tid_t y) EXT2FS_ATTR((unused)); + +/* Comparison functions for transaction IDs: perform comparisons using + * modulo arithmetic so that they work over sequence number wraps. */ + +static inline int tid_gt(tid_t x, tid_t y) +{ + int difference = (x - y); + return (difference > 0); +} + +static inline int tid_geq(tid_t x, tid_t y) +{ + int difference = (x - y); + return (difference >= 0); +} + +extern int journal_blocks_per_page(struct inode *inode); + +/* + * Definitions which augment the buffer_head layer + */ + +/* journaling buffer types */ +#define BJ_None 0 /* Not journaled */ +#define BJ_SyncData 1 /* Normal data: flush before commit */ +#define BJ_AsyncData 2 /* writepage data: wait on it before commit */ +#define BJ_Metadata 3 /* Normal journaled metadata */ +#define BJ_Forget 4 /* Buffer superceded by this transaction */ +#define BJ_IO 5 /* Buffer is for temporary IO use */ +#define BJ_Shadow 6 /* Buffer contents being shadowed to the log */ +#define BJ_LogCtl 7 /* Buffer contains log descriptors */ +#define BJ_Reserved 8 /* Buffer is reserved for access by journal */ +#define BJ_Types 9 + +extern int jbd_blocks_per_page(struct inode *inode); + +#ifdef __KERNEL__ + +extern spinlock_t jh_splice_lock; +/* + * Once `expr1' has been found true, take jh_splice_lock + * and then reevaluate everything. + */ +#define SPLICE_LOCK(expr1, expr2) \ + ({ \ + int ret = (expr1); \ + if (ret) { \ + spin_lock(&jh_splice_lock); \ + ret = (expr1) && (expr2); \ + spin_unlock(&jh_splice_lock); \ + } \ + ret; \ + }) + +/* + * A number of buffer state predicates. They test for + * buffer_jbd() because they are used in core kernel code. + * + * These will be racy on SMP unless we're *sure* that the + * buffer won't be detached from the journalling system + * in parallel. + */ + +/* Return true if the buffer is on journal list `list' */ +static inline int buffer_jlist_eq(struct buffer_head *bh, int list) +{ + return SPLICE_LOCK(buffer_jbd(bh), bh2jh(bh)->b_jlist == list); +} + +/* Return true if this bufer is dirty wrt the journal */ +static inline int buffer_jdirty(struct buffer_head *bh) +{ + return buffer_jbd(bh) && __buffer_state(bh, JBDDirty); +} + +/* Return true if it's a data buffer which journalling is managing */ +static inline int buffer_jbd_data(struct buffer_head *bh) +{ + return SPLICE_LOCK(buffer_jbd(bh), + bh2jh(bh)->b_jlist == BJ_SyncData || + bh2jh(bh)->b_jlist == BJ_AsyncData); +} + +#ifdef CONFIG_SMP +#define assert_spin_locked(lock) J_ASSERT(spin_is_locked(lock)) +#else +#define assert_spin_locked(lock) do {} while(0) +#endif + +#define buffer_trace_init(bh) do {} while (0) +#define print_buffer_fields(bh) do {} while (0) +#define print_buffer_trace(bh) do {} while (0) +#define BUFFER_TRACE(bh, info) do {} while (0) +#define BUFFER_TRACE2(bh, bh2, info) do {} while (0) +#define JBUFFER_TRACE(jh, info) do {} while (0) + +#endif /* __KERNEL__ */ + +#endif /* CONFIG_JBD || CONFIG_JBD_MODULE || !__KERNEL__ */ + +/* + * Compatibility no-ops which allow the kernel to compile without CONFIG_JBD + * go here. + */ + +#if defined(__KERNEL__) && !(defined(CONFIG_JBD) || defined(CONFIG_JBD_MODULE)) + +#define J_ASSERT(expr) do {} while (0) +#define J_ASSERT_BH(bh, expr) do {} while (0) +#define buffer_jbd(bh) 0 +#define buffer_jlist_eq(bh, val) 0 +#define journal_buffer_journal_lru(bh) 0 + +#endif /* defined(__KERNEL__) && !defined(CONFIG_JBD) */ +#endif /* _LINUX_JBD_H */ diff --git a/portlibs/sources/libext2fs/source/kernel-list.h b/portlibs/sources/libext2fs/source/kernel-list.h new file mode 100644 index 00000000..e07d06b6 --- /dev/null +++ b/portlibs/sources/libext2fs/source/kernel-list.h @@ -0,0 +1,112 @@ +#ifndef _LINUX_LIST_H +#define _LINUX_LIST_H + +/* + * Simple doubly linked list implementation. + * + * Some of the internal functions ("__xxx") are useful when + * manipulating whole lists rather than single entries, as + * sometimes we already know the next/prev entries and we can + * generate better code by using them directly rather than + * using the generic single-entry routines. + */ + +struct list_head { + struct list_head *next, *prev; +}; + +#define LIST_HEAD_INIT(name) { &(name), &(name) } + +#define LIST_HEAD(name) \ + struct list_head name = { &name, &name } + +#define INIT_LIST_HEAD(ptr) do { \ + (ptr)->next = (ptr); (ptr)->prev = (ptr); \ +} while (0) + +#if (!defined(__GNUC__) && !defined(__WATCOMC__)) +#define __inline__ +#endif + +/* + * Insert a new entry between two known consecutive entries. + * + * This is only for internal list manipulation where we know + * the prev/next entries already! + */ +static __inline__ void __list_add(struct list_head * new, + struct list_head * prev, + struct list_head * next) +{ + next->prev = new; + new->next = next; + new->prev = prev; + prev->next = new; +} + +/* + * Insert a new entry after the specified head.. + */ +static __inline__ void list_add(struct list_head *new, struct list_head *head) +{ + __list_add(new, head, head->next); +} + +/* + * Insert a new entry at the tail + */ +static __inline__ void list_add_tail(struct list_head *new, struct list_head *head) +{ + __list_add(new, head->prev, head); +} + +/* + * Delete a list entry by making the prev/next entries + * point to each other. + * + * This is only for internal list manipulation where we know + * the prev/next entries already! + */ +static __inline__ void __list_del(struct list_head * prev, + struct list_head * next) +{ + next->prev = prev; + prev->next = next; +} + +static __inline__ void list_del(struct list_head *entry) +{ + __list_del(entry->prev, entry->next); +} + +static __inline__ int list_empty(struct list_head *head) +{ + return head->next == head; +} + +/* + * Splice in "list" into "head" + */ +static __inline__ void list_splice(struct list_head *list, struct list_head *head) +{ + struct list_head *first = list->next; + + if (first != list) { + struct list_head *last = list->prev; + struct list_head *at = head->next; + + first->prev = head; + head->next = first; + + last->next = at; + at->prev = last; + } +} + +#define list_entry(ptr, type, member) \ + ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member))) + +#define list_for_each(pos, head) \ + for (pos = (head)->next; pos != (head); pos = pos->next) + +#endif diff --git a/portlibs/sources/libext2fs/source/link.c b/portlibs/sources/libext2fs/source/link.c new file mode 100644 index 00000000..4cc8426a --- /dev/null +++ b/portlibs/sources/libext2fs/source/link.c @@ -0,0 +1,153 @@ +/* + * link.c --- create links in a ext2fs directory + * + * Copyright (C) 1993, 1994 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +struct link_struct { + ext2_filsys fs; + const char *name; + int namelen; + ext2_ino_t inode; + int flags; + int done; + unsigned int blocksize; + errcode_t err; + struct ext2_super_block *sb; +}; + +static int link_proc(struct ext2_dir_entry *dirent, + int offset, + int blocksize, + char *buf, + void *priv_data) +{ + struct link_struct *ls = (struct link_struct *) priv_data; + struct ext2_dir_entry *next; + unsigned int rec_len, min_rec_len, curr_rec_len; + int ret = 0; + + rec_len = EXT2_DIR_REC_LEN(ls->namelen); + + ls->err = ext2fs_get_rec_len(ls->fs, dirent, &curr_rec_len); + if (ls->err) + return DIRENT_ABORT; + + /* + * See if the following directory entry (if any) is unused; + * if so, absorb it into this one. + */ + next = (struct ext2_dir_entry *) (buf + offset + curr_rec_len); + if ((offset + curr_rec_len < blocksize - 8) && + (next->inode == 0) && + (offset + curr_rec_len + next->rec_len <= blocksize)) { + curr_rec_len += next->rec_len; + ls->err = ext2fs_set_rec_len(ls->fs, curr_rec_len, dirent); + if (ls->err) + return DIRENT_ABORT; + ret = DIRENT_CHANGED; + } + + /* + * If the directory entry is used, see if we can split the + * directory entry to make room for the new name. If so, + * truncate it and return. + */ + if (dirent->inode) { + min_rec_len = EXT2_DIR_REC_LEN(dirent->name_len & 0xFF); + if (curr_rec_len < (min_rec_len + rec_len)) + return ret; + rec_len = curr_rec_len - min_rec_len; + ls->err = ext2fs_set_rec_len(ls->fs, min_rec_len, dirent); + if (ls->err) + return DIRENT_ABORT; + next = (struct ext2_dir_entry *) (buf + offset + + dirent->rec_len); + next->inode = 0; + next->name_len = 0; + ls->err = ext2fs_set_rec_len(ls->fs, rec_len, next); + if (ls->err) + return DIRENT_ABORT; + return DIRENT_CHANGED; + } + + /* + * If we get this far, then the directory entry is not used. + * See if we can fit the request entry in. If so, do it. + */ + if (curr_rec_len < rec_len) + return ret; + dirent->inode = ls->inode; + dirent->name_len = ls->namelen; + strncpy(dirent->name, ls->name, ls->namelen); + if (ls->sb->s_feature_incompat & EXT2_FEATURE_INCOMPAT_FILETYPE) + dirent->name_len |= (ls->flags & 0x7) << 8; + + ls->done++; + return DIRENT_ABORT|DIRENT_CHANGED; +} + +/* + * Note: the low 3 bits of the flags field are used as the directory + * entry filetype. + */ +#ifdef __TURBOC__ + #pragma argsused +#endif +errcode_t ext2fs_link(ext2_filsys fs, ext2_ino_t dir, const char *name, + ext2_ino_t ino, int flags) +{ + errcode_t retval; + struct link_struct ls; + struct ext2_inode inode; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!(fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + ls.fs = fs; + ls.name = name; + ls.namelen = name ? strlen(name) : 0; + ls.inode = ino; + ls.flags = flags; + ls.done = 0; + ls.sb = fs->super; + ls.blocksize = fs->blocksize; + ls.err = 0; + + retval = ext2fs_dir_iterate(fs, dir, DIRENT_FLAG_INCLUDE_EMPTY, + 0, link_proc, &ls); + if (retval) + return retval; + if (ls.err) + return ls.err; + + if (!ls.done) + return EXT2_ET_DIR_NO_SPACE; + + if ((retval = ext2fs_read_inode(fs, dir, &inode)) != 0) + return retval; + + if (inode.i_flags & EXT2_INDEX_FL) { + inode.i_flags &= ~EXT2_INDEX_FL; + if ((retval = ext2fs_write_inode(fs, dir, &inode)) != 0) + return retval; + } + + return 0; +} diff --git a/portlibs/sources/libext2fs/source/llseek.c b/portlibs/sources/libext2fs/source/llseek.c new file mode 100644 index 00000000..3b919bef --- /dev/null +++ b/portlibs/sources/libext2fs/source/llseek.c @@ -0,0 +1,139 @@ +/* + * llseek.c -- stub calling the llseek system call + * + * Copyright (C) 1994, 1995, 1996, 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#define _LARGEFILE_SOURCE +#define _LARGEFILE64_SOURCE + +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#ifdef __MSDOS__ +#include <io.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +#ifdef __linux__ + +#if defined(HAVE_LSEEK64) && defined(HAVE_LSEEK64_PROTOTYPE) + +#define my_llseek lseek64 + +#else +#if defined(HAVE_LLSEEK) +#include <syscall.h> + +#ifndef HAVE_LLSEEK_PROTOTYPE +extern long long llseek (int fd, long long offset, int origin); +#endif + +#define my_llseek llseek + +#else /* ! HAVE_LLSEEK */ + +#if SIZEOF_LONG == SIZEOF_LONG_LONG + +#define llseek lseek + +#else /* SIZEOF_LONG != SIZEOF_LONG_LONG */ + +#include <linux/unistd.h> + +#ifndef __NR__llseek +#define __NR__llseek 140 +#endif + +#ifndef __i386__ +static int _llseek (unsigned int, unsigned long, + unsigned long, ext2_loff_t *, unsigned int); + +static _syscall5(int,_llseek,unsigned int,fd,unsigned long,offset_high, + unsigned long, offset_low,ext2_loff_t *,result, + unsigned int, origin) +#endif + +static ext2_loff_t my_llseek (int fd, ext2_loff_t offset, int origin) +{ + ext2_loff_t result; + int retval; + +#ifndef __i386__ + retval = _llseek(fd, ((unsigned long long) offset) >> 32, +#else + retval = syscall(__NR__llseek, fd, (unsigned long long) (offset >> 32), +#endif + ((unsigned long long) offset) & 0xffffffff, + &result, origin); + return (retval == -1 ? (ext2_loff_t) retval : result); +} + +#endif /* __alpha__ || __ia64__ */ + +#endif /* HAVE_LLSEEK */ +#endif /* defined(HAVE_LSEEK64) && defined(HAVE_LSEEK64_PROTOTYPE) */ + +ext2_loff_t ext2fs_llseek (int fd, ext2_loff_t offset, int origin) +{ + ext2_loff_t result; + static int do_compat = 0; + + if ((sizeof(off_t) >= sizeof(ext2_loff_t)) || + (offset < ((ext2_loff_t) 1 << ((sizeof(off_t)*8) -1)))) + return lseek(fd, (off_t) offset, origin); + + if (do_compat) { + errno = EINVAL; + return -1; + } + + result = my_llseek (fd, offset, origin); + if (result == -1 && errno == ENOSYS) { + /* + * Just in case this code runs on top of an old kernel + * which does not support the llseek system call + */ + do_compat++; + errno = EINVAL; + } + return result; +} + +#else /* !linux */ + +#ifndef EINVAL +#define EINVAL EXT2_ET_INVALID_ARGUMENT +#endif + +ext2_loff_t ext2fs_llseek (int fd, ext2_loff_t offset, int origin) +{ +#if defined(HAVE_LSEEK64) && defined(HAVE_LSEEK64_PROTOTYPE) + return lseek64 (fd, offset, origin); +#else + if ((sizeof(off_t) < sizeof(ext2_loff_t)) && + (offset >= ((ext2_loff_t) 1 << ((sizeof(off_t)*8) -1)))) { + errno = EINVAL; + return -1; + } + return lseek (fd, (off_t) offset, origin); +#endif +} + +#endif /* linux */ + + diff --git a/portlibs/sources/libext2fs/source/lookup.c b/portlibs/sources/libext2fs/source/lookup.c new file mode 100644 index 00000000..97aa0887 --- /dev/null +++ b/portlibs/sources/libext2fs/source/lookup.c @@ -0,0 +1,69 @@ +/* + * lookup.c --- ext2fs directory lookup operations + * + * Copyright (C) 1993, 1994, 1994, 1995 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +struct lookup_struct { + const char *name; + int len; + ext2_ino_t *inode; + int found; +}; + +#ifdef __TURBOC__ + #pragma argsused +#endif +static int lookup_proc(struct ext2_dir_entry *dirent, + int offset EXT2FS_ATTR((unused)), + int blocksize EXT2FS_ATTR((unused)), + char *buf EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct lookup_struct *ls = (struct lookup_struct *) priv_data; + + if (ls->len != (dirent->name_len & 0xFF)) + return 0; + if (strncmp(ls->name, dirent->name, (dirent->name_len & 0xFF))) + return 0; + *ls->inode = dirent->inode; + ls->found++; + return DIRENT_ABORT; +} + + +errcode_t ext2fs_lookup(ext2_filsys fs, ext2_ino_t dir, const char *name, + int namelen, char *buf, ext2_ino_t *inode) +{ + errcode_t retval; + struct lookup_struct ls; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + ls.name = name; + ls.len = namelen; + ls.inode = inode; + ls.found = 0; + + retval = ext2fs_dir_iterate(fs, dir, 0, buf, lookup_proc, &ls); + if (retval) + return retval; + + return (ls.found) ? 0 : EXT2_ET_FILE_NOT_FOUND; +} + + diff --git a/portlibs/sources/libext2fs/source/mem2.h b/portlibs/sources/libext2fs/source/mem2.h new file mode 100644 index 00000000..b8fa93cf --- /dev/null +++ b/portlibs/sources/libext2fs/source/mem2.h @@ -0,0 +1,27 @@ +// 2 MEM2 allocators, one for general purpose, one for covers +// Aligned and padded to 32 bytes, as required by many functions + +#ifndef __MEM2_H_ +#define __MEM2_H_ + +#ifdef __cplusplus +extern "C" +{ +#endif + +#include <gctypes.h> + +void MEM2_init(unsigned int mem2Size); +void MEM2_cleanup(void); +void MEM2_takeBigOnes(bool b); +void *MEM2_alloc(unsigned int s); +void *MEM2_realloc(void *p, unsigned int s); +void MEM2_free(void *p); +unsigned int MEM2_usableSize(void *p); +unsigned int MEM2_freesize(); + +#ifdef __cplusplus +} +#endif + +#endif // !defined(__MEM2_H_) diff --git a/portlibs/sources/libext2fs/source/mem_allocate.h b/portlibs/sources/libext2fs/source/mem_allocate.h new file mode 100644 index 00000000..4554b8b4 --- /dev/null +++ b/portlibs/sources/libext2fs/source/mem_allocate.h @@ -0,0 +1,24 @@ +#ifndef _MEM_ALLOCATE_H +#define _MEM_ALLOCATE_H + +#include <malloc.h> +#include "mem2.h" + +extern __inline__ void* mem_alloc (size_t size) { + return MEM2_alloc(size); +} + +extern __inline__ void* mem_realloc (void *p, size_t size) { + return MEM2_realloc(p, size); +} + +extern __inline__ void* mem_align (size_t a, size_t size) { + return MEM2_alloc(size); +} + +extern __inline__ void mem_free (void* mem) { + //using normal free, it will decide which free to use (just to be on the safe side) + free(mem); +} + +#endif /* _MEM_ALLOCATE_H */ diff --git a/portlibs/sources/libext2fs/source/mkdir.c b/portlibs/sources/libext2fs/source/mkdir.c new file mode 100644 index 00000000..86c65da9 --- /dev/null +++ b/portlibs/sources/libext2fs/source/mkdir.c @@ -0,0 +1,142 @@ +/* + * mkdir.c --- make a directory in the filesystem + * + * Copyright (C) 1994, 1995 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +#ifndef EXT2_FT_DIR +#define EXT2_FT_DIR 2 +#endif + +errcode_t ext2fs_mkdir(ext2_filsys fs, ext2_ino_t parent, ext2_ino_t inum, + const char *name) +{ + errcode_t retval; + struct ext2_inode parent_inode, inode; + ext2_ino_t ino = inum; + ext2_ino_t scratch_ino; + blk64_t blk; + char *block = 0; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + /* + * Allocate an inode, if necessary + */ + if (!ino) { + retval = ext2fs_new_inode(fs, parent, LINUX_S_IFDIR | 0755, + 0, &ino); + if (retval) + goto cleanup; + } + + /* + * Allocate a data block for the directory + */ + retval = ext2fs_new_block2(fs, 0, 0, &blk); + if (retval) + goto cleanup; + + /* + * Create a scratch template for the directory + */ + retval = ext2fs_new_dir_block(fs, ino, parent, &block); + if (retval) + goto cleanup; + + /* + * Get the parent's inode, if necessary + */ + if (parent != ino) { + retval = ext2fs_read_inode(fs, parent, &parent_inode); + if (retval) + goto cleanup; + } else + memset(&parent_inode, 0, sizeof(parent_inode)); + + /* + * Create the inode structure.... + */ + memset(&inode, 0, sizeof(struct ext2_inode)); + inode.i_mode = LINUX_S_IFDIR | (0777 & ~fs->umask); + inode.i_uid = inode.i_gid = 0; + ext2fs_iblk_set(fs, &inode, 1); + /* FIXME-64 */ + inode.i_block[0] = blk; + inode.i_links_count = 2; + inode.i_size = fs->blocksize; + + /* + * Write out the inode and inode data block + */ + retval = ext2fs_write_dir_block(fs, blk, block); + if (retval) + goto cleanup; + retval = ext2fs_write_new_inode(fs, ino, &inode); + if (retval) + goto cleanup; + + /* + * Link the directory into the filesystem hierarchy + */ + if (name) { + retval = ext2fs_lookup(fs, parent, name, strlen(name), 0, + &scratch_ino); + if (!retval) { + retval = EXT2_ET_DIR_EXISTS; + name = 0; + goto cleanup; + } + if (retval != EXT2_ET_FILE_NOT_FOUND) + goto cleanup; + retval = ext2fs_link(fs, parent, name, ino, EXT2_FT_DIR); + if (retval) + goto cleanup; + } + + /* + * Update parent inode's counts + */ + if (parent != ino) { + parent_inode.i_links_count++; + retval = ext2fs_write_inode(fs, parent, &parent_inode); + if (retval) + goto cleanup; + } + + /* + * Update accounting.... + */ + ext2fs_block_alloc_stats2(fs, blk, +1); + ext2fs_inode_alloc_stats2(fs, ino, +1, 1); + +cleanup: + if (block) + ext2fs_free_mem(&block); + return retval; + +} + + diff --git a/portlibs/sources/libext2fs/source/mkjournal.c b/portlibs/sources/libext2fs/source/mkjournal.c new file mode 100644 index 00000000..47fb92c2 --- /dev/null +++ b/portlibs/sources/libext2fs/source/mkjournal.c @@ -0,0 +1,601 @@ +/* + * mkjournal.c --- make a journal for a filesystem + * + * Copyright (C) 2000 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#if HAVE_ERRNO_H +#include <errno.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif +#if HAVE_SYS_IOCTL_H +#include <sys/ioctl.h> +#endif +#if HAVE_NETINET_IN_H +#include <netinet/in.h> +#endif +#ifdef GEKKO +#include <network.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" +#include "jfs_user.h" + +/* + * This function automatically sets up the journal superblock and + * returns it as an allocated block. + */ +errcode_t ext2fs_create_journal_superblock(ext2_filsys fs, + __u32 size, int flags, + char **ret_jsb) +{ + errcode_t retval; + journal_superblock_t *jsb; + + if (size < 1024) + return EXT2_ET_JOURNAL_TOO_SMALL; + + if ((retval = ext2fs_get_mem(fs->blocksize, &jsb))) + return retval; + + memset (jsb, 0, fs->blocksize); + + jsb->s_header.h_magic = htonl(JFS_MAGIC_NUMBER); + if (flags & EXT2_MKJOURNAL_V1_SUPER) + jsb->s_header.h_blocktype = htonl(JFS_SUPERBLOCK_V1); + else + jsb->s_header.h_blocktype = htonl(JFS_SUPERBLOCK_V2); + jsb->s_blocksize = htonl(fs->blocksize); + jsb->s_maxlen = htonl(size); + jsb->s_nr_users = htonl(1); + jsb->s_first = htonl(1); + jsb->s_sequence = htonl(1); + memcpy(jsb->s_uuid, fs->super->s_uuid, sizeof(fs->super->s_uuid)); + /* + * If we're creating an external journal device, we need to + * adjust these fields. + */ + if (fs->super->s_feature_incompat & + EXT3_FEATURE_INCOMPAT_JOURNAL_DEV) { + jsb->s_nr_users = 0; + if (fs->blocksize == 1024) + jsb->s_first = htonl(3); + else + jsb->s_first = htonl(2); + } + + *ret_jsb = (char *) jsb; + return 0; +} + +/* + * This function writes a journal using POSIX routines. It is used + * for creating external journals and creating journals on live + * filesystems. + */ +static errcode_t write_journal_file(ext2_filsys fs, char *filename, + blk_t size, int flags) +{ + errcode_t retval; + char *buf = 0; + int fd, ret_size; + blk_t i; + + if ((retval = ext2fs_create_journal_superblock(fs, size, flags, &buf))) + return retval; + + /* Open the device or journal file */ + if ((fd = open(filename, O_WRONLY)) < 0) { + retval = errno; + goto errout; + } + + /* Write the superblock out */ + retval = EXT2_ET_SHORT_WRITE; + ret_size = write(fd, buf, fs->blocksize); + if (ret_size < 0) { + retval = errno; + goto errout; + } + if (ret_size != (int) fs->blocksize) + goto errout; + memset(buf, 0, fs->blocksize); + + for (i = 1; i < size; i++) { + ret_size = write(fd, buf, fs->blocksize); + if (ret_size < 0) { + retval = errno; + goto errout; + } + if (ret_size != (int) fs->blocksize) + goto errout; + } + close(fd); + + retval = 0; +errout: + ext2fs_free_mem(&buf); + return retval; +} + +/* + * Convenience function which zeros out _num_ blocks starting at + * _blk_. In case of an error, the details of the error is returned + * via _ret_blk_ and _ret_count_ if they are non-NULL pointers. + * Returns 0 on success, and an error code on an error. + * + * As a special case, if the first argument is NULL, then it will + * attempt to free the static zeroizing buffer. (This is to keep + * programs that check for memory leaks happy.) + */ +#define STRIDE_LENGTH 8 +errcode_t ext2fs_zero_blocks2(ext2_filsys fs, blk64_t blk, int num, + blk64_t *ret_blk, int *ret_count) +{ + int j, count; + static char *buf; + errcode_t retval; + + /* If fs is null, clean up the static buffer and return */ + if (!fs) { + if (buf) { + free(buf); + buf = 0; + } + return 0; + } + /* Allocate the zeroizing buffer if necessary */ + if (!buf) { + buf = malloc(fs->blocksize * STRIDE_LENGTH); + if (!buf) + return ENOMEM; + memset(buf, 0, fs->blocksize * STRIDE_LENGTH); + } + /* OK, do the write loop */ + j=0; + while (j < num) { + if (blk % STRIDE_LENGTH) { + count = STRIDE_LENGTH - (blk % STRIDE_LENGTH); + if (count > (num - j)) + count = num - j; + } else { + count = num - j; + if (count > STRIDE_LENGTH) + count = STRIDE_LENGTH; + } + retval = io_channel_write_blk64(fs->io, blk, count, buf); + if (retval) { + if (ret_count) + *ret_count = count; + if (ret_blk) + *ret_blk = blk; + return retval; + } + j += count; blk += count; + } + return 0; +} + +errcode_t ext2fs_zero_blocks(ext2_filsys fs, blk_t blk, int num, + blk_t *ret_blk, int *ret_count) +{ + blk64_t ret_blk2; + errcode_t retval; + + retval = ext2fs_zero_blocks2(fs, blk, num, &ret_blk2, ret_count); + if (retval) + *ret_blk = (blk_t) ret_blk2; + return retval; +} + +/* + * Helper function for creating the journal using direct I/O routines + */ +struct mkjournal_struct { + int num_blocks; + int newblocks; + blk64_t goal; + blk64_t blk_to_zero; + int zero_count; + char *buf; + errcode_t err; +}; + +static int mkjournal_proc(ext2_filsys fs, + blk64_t *blocknr, + e2_blkcnt_t blockcnt, + blk64_t ref_block EXT2FS_ATTR((unused)), + int ref_offset EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct mkjournal_struct *es = (struct mkjournal_struct *) priv_data; + blk64_t new_blk; + errcode_t retval; + + if (*blocknr) { + es->goal = *blocknr; + return 0; + } + retval = ext2fs_new_block2(fs, es->goal, 0, &new_blk); + if (retval) { + es->err = retval; + return BLOCK_ABORT; + } + if (blockcnt >= 0) + es->num_blocks--; + + es->newblocks++; + retval = 0; + if (blockcnt <= 0) + retval = io_channel_write_blk64(fs->io, new_blk, 1, es->buf); + else { + if (es->zero_count) { + if ((es->blk_to_zero + es->zero_count == new_blk) && + (es->zero_count < 1024)) + es->zero_count++; + else { + retval = ext2fs_zero_blocks2(fs, + es->blk_to_zero, + es->zero_count, + 0, 0); + es->zero_count = 0; + } + } + if (es->zero_count == 0) { + es->blk_to_zero = new_blk; + es->zero_count = 1; + } + } + + if (blockcnt == 0) + memset(es->buf, 0, fs->blocksize); + + if (retval) { + es->err = retval; + return BLOCK_ABORT; + } + *blocknr = es->goal = new_blk; + ext2fs_block_alloc_stats2(fs, new_blk, +1); + + if (es->num_blocks == 0) + return (BLOCK_CHANGED | BLOCK_ABORT); + else + return BLOCK_CHANGED; + +} + +/* + * This function creates a journal using direct I/O routines. + */ +static errcode_t write_journal_inode(ext2_filsys fs, ext2_ino_t journal_ino, + blk64_t size, int flags) +{ + char *buf; + dgrp_t group, start, end, i, log_flex; + errcode_t retval; + struct ext2_inode inode; + struct mkjournal_struct es; + + if ((retval = ext2fs_create_journal_superblock(fs, size, flags, &buf))) + return retval; + + if ((retval = ext2fs_read_bitmaps(fs))) + return retval; + + if ((retval = ext2fs_read_inode(fs, journal_ino, &inode))) + return retval; + + if (inode.i_blocks > 0) + return EEXIST; + + es.num_blocks = size; + es.newblocks = 0; + es.buf = buf; + es.err = 0; + es.zero_count = 0; + + if (fs->super->s_feature_incompat & EXT3_FEATURE_INCOMPAT_EXTENTS) { + inode.i_flags |= EXT4_EXTENTS_FL; + if ((retval = ext2fs_write_inode(fs, journal_ino, &inode))) + return retval; + } + + /* + * Set the initial goal block to be roughly at the middle of + * the filesystem. Pick a group that has the largest number + * of free blocks. + */ + group = ext2fs_group_of_blk2(fs, (ext2fs_blocks_count(fs->super) - + fs->super->s_first_data_block) / 2); + log_flex = 1 << fs->super->s_log_groups_per_flex; + if (fs->super->s_log_groups_per_flex && (group > log_flex)) { + group = group & ~(log_flex - 1); + while ((group < fs->group_desc_count) && + ext2fs_bg_free_blocks_count(fs, group) == 0) + group++; + if (group == fs->group_desc_count) + group = 0; + start = group; + } else + start = (group > 0) ? group-1 : group; + end = ((group+1) < fs->group_desc_count) ? group+1 : group; + group = start; + for (i=start+1; i <= end; i++) + if (ext2fs_bg_free_blocks_count(fs, i) > + ext2fs_bg_free_blocks_count(fs, group)) + group = i; + + es.goal = (fs->super->s_blocks_per_group * group) + + fs->super->s_first_data_block; + + retval = ext2fs_block_iterate3(fs, journal_ino, BLOCK_FLAG_APPEND, + 0, mkjournal_proc, &es); + if (es.err) { + retval = es.err; + goto errout; + } + if (es.zero_count) { + retval = ext2fs_zero_blocks2(fs, es.blk_to_zero, + es.zero_count, 0, 0); + if (retval) + goto errout; + } + + if ((retval = ext2fs_read_inode(fs, journal_ino, &inode))) + goto errout; + + inode.i_size += fs->blocksize * size; + ext2fs_iblk_add_blocks(fs, &inode, es.newblocks); + inode.i_mtime = inode.i_ctime = fs->now ? fs->now : time(0); + inode.i_links_count = 1; + inode.i_mode = LINUX_S_IFREG | 0600; + + if ((retval = ext2fs_write_new_inode(fs, journal_ino, &inode))) + goto errout; + retval = 0; + + memcpy(fs->super->s_jnl_blocks, inode.i_block, EXT2_N_BLOCKS*4); + fs->super->s_jnl_blocks[16] = inode.i_size; + fs->super->s_jnl_backup_type = EXT3_JNL_BACKUP_BLOCKS; + ext2fs_mark_super_dirty(fs); + +errout: + ext2fs_zero_blocks2(0, 0, 0, 0, 0); + ext2fs_free_mem(&buf); + return retval; +} + +/* + * Find a reasonable journal file size (in blocks) given the number of blocks + * in the filesystem. For very small filesystems, it is not reasonable to + * have a journal that fills more than half of the filesystem. + */ +int ext2fs_default_journal_size(__u64 blocks) +{ + if (blocks < 2048) + return -1; + if (blocks < 32768) + return (1024); + if (blocks < 256*1024) + return (4096); + if (blocks < 512*1024) + return (8192); + if (blocks < 1024*1024) + return (16384); + return 32768; +} + +/* + * This function adds a journal device to a filesystem + */ +errcode_t ext2fs_add_journal_device(ext2_filsys fs, ext2_filsys journal_dev) +{ + struct stat st; + errcode_t retval; + char buf[1024]; + journal_superblock_t *jsb; + int start; + __u32 i, nr_users; + + /* Make sure the device exists and is a block device */ + if (stat(journal_dev->device_name, &st) < 0) + return errno; + + if (!S_ISBLK(st.st_mode)) + return EXT2_ET_JOURNAL_NOT_BLOCK; /* Must be a block device */ + + /* Get the journal superblock */ + start = 1; + if (journal_dev->blocksize == 1024) + start++; + if ((retval = io_channel_read_blk64(journal_dev->io, start, -1024, + buf))) + return retval; + + jsb = (journal_superblock_t *) buf; + if ((jsb->s_header.h_magic != (unsigned) ntohl(JFS_MAGIC_NUMBER)) || + (jsb->s_header.h_blocktype != (unsigned) ntohl(JFS_SUPERBLOCK_V2))) + return EXT2_ET_NO_JOURNAL_SB; + + if (ntohl(jsb->s_blocksize) != (unsigned long) fs->blocksize) + return EXT2_ET_UNEXPECTED_BLOCK_SIZE; + + /* Check and see if this filesystem has already been added */ + nr_users = ntohl(jsb->s_nr_users); + for (i=0; i < nr_users; i++) { + if (memcmp(fs->super->s_uuid, + &jsb->s_users[i*16], 16) == 0) + break; + } + if (i >= nr_users) { + memcpy(&jsb->s_users[nr_users*16], + fs->super->s_uuid, 16); + jsb->s_nr_users = htonl(nr_users+1); + } + + /* Writeback the journal superblock */ + if ((retval = io_channel_write_blk64(journal_dev->io, start, -1024, buf))) + return retval; + + fs->super->s_journal_inum = 0; + fs->super->s_journal_dev = st.st_rdev; + memcpy(fs->super->s_journal_uuid, jsb->s_uuid, + sizeof(fs->super->s_journal_uuid)); + fs->super->s_feature_compat |= EXT3_FEATURE_COMPAT_HAS_JOURNAL; + ext2fs_mark_super_dirty(fs); + return 0; +} + +/* + * This function adds a journal inode to a filesystem, using either + * POSIX routines if the filesystem is mounted, or using direct I/O + * functions if it is not. + */ +errcode_t ext2fs_add_journal_inode(ext2_filsys fs, blk_t size, int flags) +{ + errcode_t retval; + ext2_ino_t journal_ino; + struct stat st; + char jfile[1024]; + int mount_flags; + int fd = -1; + + if ((retval = ext2fs_check_mount_point(fs->device_name, &mount_flags, + jfile, sizeof(jfile)-10))) + return retval; + + if (mount_flags & EXT2_MF_MOUNTED) { + strcat(jfile, "/.journal"); + + /* + * If .../.journal already exists, make sure any + * immutable or append-only flags are cleared. + */ +#if defined(HAVE_CHFLAGS) && defined(UF_NODUMP) + (void) chflags (jfile, 0); +#else +#if HAVE_EXT2_IOCTLS + fd = open(jfile, O_RDONLY); + if (fd >= 0) { + f = 0; + ioctl(fd, EXT2_IOC_SETFLAGS, &f); + close(fd); + } +#endif +#endif + + /* Create the journal file */ + if ((fd = open(jfile, O_CREAT|O_WRONLY, 0600)) < 0) + return errno; + + if ((retval = write_journal_file(fs, jfile, size, flags))) + goto errout; + + /* Get inode number of the journal file */ + if (fstat(fd, &st) < 0) { + retval = errno; + goto errout; + } + +#if defined(HAVE_CHFLAGS) && defined(UF_NODUMP) + retval = fchflags (fd, UF_NODUMP|UF_IMMUTABLE); +#else +#if HAVE_EXT2_IOCTLS + if (ioctl(fd, EXT2_IOC_GETFLAGS, &f) < 0) { + retval = errno; + goto errout; + } + f |= EXT2_NODUMP_FL | EXT2_IMMUTABLE_FL; + retval = ioctl(fd, EXT2_IOC_SETFLAGS, &f); +#endif +#endif + if (retval) { + retval = errno; + goto errout; + } + + if (close(fd) < 0) { + retval = errno; + fd = -1; + goto errout; + } + journal_ino = st.st_ino; + } else { + if ((mount_flags & EXT2_MF_BUSY) && + !(fs->flags & EXT2_FLAG_EXCLUSIVE)) { + retval = EBUSY; + goto errout; + } + journal_ino = EXT2_JOURNAL_INO; + if ((retval = write_journal_inode(fs, journal_ino, + size, flags))) + return retval; + } + + fs->super->s_journal_inum = journal_ino; + fs->super->s_journal_dev = 0; + memset(fs->super->s_journal_uuid, 0, + sizeof(fs->super->s_journal_uuid)); + fs->super->s_feature_compat |= EXT3_FEATURE_COMPAT_HAS_JOURNAL; + + ext2fs_mark_super_dirty(fs); + return 0; +errout: + if (fd > 0) + close(fd); + return retval; +} + +#ifdef DEBUG +main(int argc, char **argv) +{ + errcode_t retval; + char *device_name; + ext2_filsys fs; + + if (argc < 2) { + fprintf(stderr, "Usage: %s filesystem\n", argv[0]); + exit(1); + } + device_name = argv[1]; + + retval = ext2fs_open (device_name, EXT2_FLAG_RW, 0, 0, + unix_io_manager, &fs); + if (retval) { + com_err(argv[0], retval, "while opening %s", device_name); + exit(1); + } + + retval = ext2fs_add_journal_inode(fs, 1024); + if (retval) { + com_err(argv[0], retval, "while adding journal to %s", + device_name); + exit(1); + } + retval = ext2fs_flush(fs); + if (retval) { + printf("Warning, had trouble writing out superblocks.\n"); + } + ext2fs_close(fs); + exit(0); + +} +#endif diff --git a/portlibs/sources/libext2fs/source/namei.c b/portlibs/sources/libext2fs/source/namei.c new file mode 100644 index 00000000..bc0ae61d --- /dev/null +++ b/portlibs/sources/libext2fs/source/namei.c @@ -0,0 +1,206 @@ +/* + * namei.c --- ext2fs directory lookup operations + * + * Copyright (C) 1993, 1994, 1994, 1995 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +/* #define NAMEI_DEBUG */ + +#include "ext2_fs.h" +#include "ext2fs.h" + +static errcode_t open_namei(ext2_filsys fs, ext2_ino_t root, ext2_ino_t base, + const char *pathname, size_t pathlen, int follow, + int link_count, char *buf, ext2_ino_t *res_inode); + +static errcode_t follow_link(ext2_filsys fs, ext2_ino_t root, ext2_ino_t dir, + ext2_ino_t inode, int link_count, + char *buf, ext2_ino_t *res_inode) +{ + char *pathname; + char *buffer = 0; + errcode_t retval; + struct ext2_inode ei; + +#ifdef NAMEI_DEBUG + printf("follow_link: root=%lu, dir=%lu, inode=%lu, lc=%d\n", + root, dir, inode, link_count); + +#endif + retval = ext2fs_read_inode (fs, inode, &ei); + if (retval) return retval; + if (!LINUX_S_ISLNK (ei.i_mode)) { + *res_inode = inode; + return 0; + } + if (link_count++ > 5) { + return EXT2_ET_SYMLINK_LOOP; + } + /* FIXME-64: Actually, this is FIXME EXTENTS */ + if (ext2fs_inode_data_blocks(fs,&ei)) { + retval = ext2fs_get_mem(fs->blocksize, &buffer); + if (retval) + return retval; + retval = io_channel_read_blk(fs->io, ei.i_block[0], 1, buffer); + if (retval) { + ext2fs_free_mem(&buffer); + return retval; + } + pathname = buffer; + } else + pathname = (char *)&(ei.i_block[0]); + retval = open_namei(fs, root, dir, pathname, ei.i_size, 1, + link_count, buf, res_inode); + if (buffer) + ext2fs_free_mem(&buffer); + return retval; +} + +/* + * This routine interprets a pathname in the context of the current + * directory and the root directory, and returns the inode of the + * containing directory, and a pointer to the filename of the file + * (pointing into the pathname) and the length of the filename. + */ +static errcode_t dir_namei(ext2_filsys fs, ext2_ino_t root, ext2_ino_t dir, + const char *pathname, int pathlen, + int link_count, char *buf, + const char **name, int *namelen, + ext2_ino_t *res_inode) +{ + char c; + const char *thisname; + int len; + ext2_ino_t inode; + errcode_t retval; + + if ((c = *pathname) == '/') { + dir = root; + pathname++; + pathlen--; + } + while (1) { + thisname = pathname; + for (len=0; --pathlen >= 0;len++) { + c = *(pathname++); + if (c == '/') + break; + } + if (pathlen < 0) + break; + retval = ext2fs_lookup (fs, dir, thisname, len, buf, &inode); + if (retval) return retval; + retval = follow_link (fs, root, dir, inode, + link_count, buf, &dir); + if (retval) return retval; + } + *name = thisname; + *namelen = len; + *res_inode = dir; + return 0; +} + +static errcode_t open_namei(ext2_filsys fs, ext2_ino_t root, ext2_ino_t base, + const char *pathname, size_t pathlen, int follow, + int link_count, char *buf, ext2_ino_t *res_inode) +{ + const char *base_name; + int namelen; + ext2_ino_t dir, inode; + errcode_t retval; + +#ifdef NAMEI_DEBUG + printf("open_namei: root=%lu, dir=%lu, path=%*s, lc=%d\n", + root, base, pathlen, pathname, link_count); +#endif + retval = dir_namei(fs, root, base, pathname, pathlen, + link_count, buf, &base_name, &namelen, &dir); + if (retval) return retval; + if (!namelen) { /* special case: '/usr/' etc */ + *res_inode=dir; + return 0; + } + retval = ext2fs_lookup (fs, dir, base_name, namelen, buf, &inode); + if (retval) + return retval; + if (follow) { + retval = follow_link(fs, root, dir, inode, link_count, + buf, &inode); + if (retval) + return retval; + } +#ifdef NAMEI_DEBUG + printf("open_namei: (link_count=%d) returns %lu\n", + link_count, inode); +#endif + *res_inode = inode; + return 0; +} + +errcode_t ext2fs_namei(ext2_filsys fs, ext2_ino_t root, ext2_ino_t cwd, + const char *name, ext2_ino_t *inode) +{ + char *buf; + errcode_t retval; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + retval = ext2fs_get_mem(fs->blocksize, &buf); + if (retval) + return retval; + + retval = open_namei(fs, root, cwd, name, strlen(name), 0, 0, + buf, inode); + + ext2fs_free_mem(&buf); + return retval; +} + +errcode_t ext2fs_namei_follow(ext2_filsys fs, ext2_ino_t root, ext2_ino_t cwd, + const char *name, ext2_ino_t *inode) +{ + char *buf; + errcode_t retval; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + retval = ext2fs_get_mem(fs->blocksize, &buf); + if (retval) + return retval; + + retval = open_namei(fs, root, cwd, name, strlen(name), 1, 0, + buf, inode); + + ext2fs_free_mem(&buf); + return retval; +} + +errcode_t ext2fs_follow_link(ext2_filsys fs, ext2_ino_t root, ext2_ino_t cwd, + ext2_ino_t inode, ext2_ino_t *res_inode) +{ + char *buf; + errcode_t retval; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + retval = ext2fs_get_mem(fs->blocksize, &buf); + if (retval) + return retval; + + retval = follow_link(fs, root, cwd, inode, 0, buf, res_inode); + + ext2fs_free_mem(&buf); + return retval; +} + diff --git a/portlibs/sources/libext2fs/source/native.c b/portlibs/sources/libext2fs/source/native.c new file mode 100644 index 00000000..c71a95ee --- /dev/null +++ b/portlibs/sources/libext2fs/source/native.c @@ -0,0 +1,27 @@ +/* + * native.c --- returns the ext2_flag for a native byte order + * + * Copyright (C) 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +int ext2fs_native_flag(void) +{ +#ifdef WORDS_BIGENDIAN + return EXT2_FLAG_SWAP_BYTES; +#else + return 0; +#endif +} + + + diff --git a/portlibs/sources/libext2fs/source/newdir.c b/portlibs/sources/libext2fs/source/newdir.c new file mode 100644 index 00000000..6bc57194 --- /dev/null +++ b/portlibs/sources/libext2fs/source/newdir.c @@ -0,0 +1,77 @@ +/* + * newdir.c --- create a new directory block + * + * Copyright (C) 1994, 1995 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +#ifndef EXT2_FT_DIR +#define EXT2_FT_DIR 2 +#endif + +/* + * Create new directory block + */ +errcode_t ext2fs_new_dir_block(ext2_filsys fs, ext2_ino_t dir_ino, + ext2_ino_t parent_ino, char **block) +{ + struct ext2_dir_entry *dir = NULL; + errcode_t retval; + char *buf; + int rec_len; + int filetype = 0; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + retval = ext2fs_get_mem(fs->blocksize, &buf); + if (retval) + return retval; + memset(buf, 0, fs->blocksize); + dir = (struct ext2_dir_entry *) buf; + + retval = ext2fs_set_rec_len(fs, fs->blocksize, dir); + if (retval) + return retval; + + if (dir_ino) { + if (fs->super->s_feature_incompat & + EXT2_FEATURE_INCOMPAT_FILETYPE) + filetype = EXT2_FT_DIR << 8; + /* + * Set up entry for '.' + */ + dir->inode = dir_ino; + dir->name_len = 1 | filetype; + dir->name[0] = '.'; + rec_len = fs->blocksize - EXT2_DIR_REC_LEN(1); + dir->rec_len = EXT2_DIR_REC_LEN(1); + + /* + * Set up entry for '..' + */ + dir = (struct ext2_dir_entry *) (buf + dir->rec_len); + retval = ext2fs_set_rec_len(fs, rec_len, dir); + if (retval) + return retval; + dir->inode = parent_ino; + dir->name_len = 2 | filetype; + dir->name[0] = '.'; + dir->name[1] = '.'; + + } + *block = buf; + return 0; +} diff --git a/portlibs/sources/libext2fs/source/openfs.c b/portlibs/sources/libext2fs/source/openfs.c new file mode 100644 index 00000000..eb04d025 --- /dev/null +++ b/portlibs/sources/libext2fs/source/openfs.c @@ -0,0 +1,411 @@ +/* + * openfs.c --- open an ext2 filesystem + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" + + +#include "ext2fs.h" +#include "e2image.h" + +blk64_t ext2fs_descriptor_block_loc2(ext2_filsys fs, blk64_t group_block, + dgrp_t i) +{ + int bg; + int has_super = 0; + blk64_t ret_blk; + + if (!(fs->super->s_feature_incompat & EXT2_FEATURE_INCOMPAT_META_BG) || + (i < fs->super->s_first_meta_bg)) + return (group_block + i + 1); + + bg = EXT2_DESC_PER_BLOCK(fs->super) * i; + if (ext2fs_bg_has_super(fs, bg)) + has_super = 1; + ret_blk = ext2fs_group_first_block2(fs, bg) + has_super; + /* + * If group_block is not the normal value, we're trying to use + * the backup group descriptors and superblock --- so use the + * alternate location of the second block group in the + * metablock group. Ideally we should be testing each bg + * descriptor block individually for correctness, but we don't + * have the infrastructure in place to do that. + */ + if (group_block != fs->super->s_first_data_block && + ((ret_blk + fs->super->s_blocks_per_group) < + ext2fs_blocks_count(fs->super))) + ret_blk += fs->super->s_blocks_per_group; + return ret_blk; +} + +blk_t ext2fs_descriptor_block_loc(ext2_filsys fs, blk_t group_block, dgrp_t i) +{ + return ext2fs_descriptor_block_loc2(fs, group_block, i); +} + +errcode_t ext2fs_open(const char *name, int flags, int superblock, + unsigned int block_size, io_channel * io, + ext2_filsys *ret_fs) +{ + return ext2fs_open2(name, 0, flags, superblock, block_size, + io, ret_fs); +} + +/* + * Note: if superblock is non-zero, block-size must also be non-zero. + * Superblock and block_size can be zero to use the default size. + * + * Valid flags for ext2fs_open() + * + * EXT2_FLAG_RW - Open the filesystem for read/write. + * EXT2_FLAG_FORCE - Open the filesystem even if some of the + * features aren't supported. + * EXT2_FLAG_JOURNAL_DEV_OK - Open an ext3 journal device + */ +errcode_t ext2fs_open2(const char *name, const char *io_options, + int flags, int superblock, + unsigned int block_size, io_channel * io, + ext2_filsys *ret_fs) +{ + ext2_filsys fs; + io_manager manager = (*io)->manager; + errcode_t retval; + unsigned long i, first_meta_bg; + __u32 features; + int groups_per_block, blocks_per_group, io_flags; + blk64_t group_block, blk; + char *dest, *cp; +#ifdef WORDS_BIGENDIAN + struct ext2_group_desc *gdp; + int j; +#endif + + EXT2_CHECK_MAGIC(manager, EXT2_ET_MAGIC_IO_MANAGER); + + retval = ext2fs_get_mem(sizeof(struct struct_ext2_filsys), &fs); + if (retval) + return retval; + + memset(fs, 0, sizeof(struct struct_ext2_filsys)); + fs->magic = EXT2_ET_MAGIC_EXT2FS_FILSYS; + fs->io = *io; + fs->flags = flags; + /* don't overwrite sb backups unless flag is explicitly cleared */ + fs->flags |= EXT2_FLAG_MASTER_SB_ONLY; + fs->umask = 022; + retval = ext2fs_get_mem(strlen(name)+1, &fs->device_name); + if (retval) + goto cleanup; + strcpy(fs->device_name, name); + cp = strchr(fs->device_name, '?'); + if (!io_options && cp) { + *cp++ = 0; + io_options = cp; + } + + io_flags = 0; + if (flags & EXT2_FLAG_RW) + io_flags |= IO_FLAG_RW; + if (flags & EXT2_FLAG_EXCLUSIVE) + io_flags |= IO_FLAG_EXCLUSIVE; + if (flags & EXT2_FLAG_DIRECT_IO) + io_flags |= IO_FLAG_DIRECT_IO; + retval = manager->open(fs->device_name, io_flags, &fs->io); + if (retval) + goto cleanup; + if (io_options && + (retval = io_channel_set_options(fs->io, io_options))) + goto cleanup; + fs->image_io = fs->io; + fs->io->app_data = fs; + retval = ext2fs_get_memalign(SUPERBLOCK_SIZE, 512, &fs->super); + if (retval) + goto cleanup; + if (flags & EXT2_FLAG_IMAGE_FILE) { + retval = ext2fs_get_mem(sizeof(struct ext2_image_hdr), + &fs->image_header); + if (retval) + goto cleanup; + retval = io_channel_read_blk(fs->io, 0, + -(int)sizeof(struct ext2_image_hdr), + fs->image_header); + if (retval) + goto cleanup; + if (fs->image_header->magic_number != EXT2_ET_MAGIC_E2IMAGE) + return EXT2_ET_MAGIC_E2IMAGE; + superblock = 1; + block_size = fs->image_header->fs_blocksize; + } + + /* + * If the user specifies a specific block # for the + * superblock, then he/she must also specify the block size! + * Otherwise, read the master superblock located at offset + * SUPERBLOCK_OFFSET from the start of the partition. + * + * Note: we only save a backup copy of the superblock if we + * are reading the superblock from the primary superblock location. + */ + if (superblock) { + if (!block_size) { + retval = EXT2_ET_INVALID_ARGUMENT; + goto cleanup; + } + io_channel_set_blksize(fs->io, block_size); + group_block = superblock; + fs->orig_super = 0; + } else { + io_channel_set_blksize(fs->io, SUPERBLOCK_OFFSET); + superblock = 1; + group_block = 0; + retval = ext2fs_get_mem(SUPERBLOCK_SIZE, &fs->orig_super); + if (retval) + goto cleanup; + } + retval = io_channel_read_blk(fs->io, superblock, -SUPERBLOCK_SIZE, + fs->super); + if (retval) + goto cleanup; + if (fs->orig_super) + memcpy(fs->orig_super, fs->super, SUPERBLOCK_SIZE); + +#ifdef WORDS_BIGENDIAN + fs->flags |= EXT2_FLAG_SWAP_BYTES; + ext2fs_swap_super(fs->super); +#else + if (fs->flags & EXT2_FLAG_SWAP_BYTES) { + retval = EXT2_ET_UNIMPLEMENTED; + goto cleanup; + } +#endif + + if (fs->super->s_magic != EXT2_SUPER_MAGIC) { + retval = EXT2_ET_BAD_MAGIC; + goto cleanup; + } + if (fs->super->s_rev_level > EXT2_LIB_CURRENT_REV) { + retval = EXT2_ET_REV_TOO_HIGH; + goto cleanup; + } + + /* + * Check for feature set incompatibility + */ + if (!(flags & EXT2_FLAG_FORCE)) { + features = fs->super->s_feature_incompat; +#ifdef EXT2_LIB_SOFTSUPP_INCOMPAT + if (flags & EXT2_FLAG_SOFTSUPP_FEATURES) + features &= !EXT2_LIB_SOFTSUPP_INCOMPAT; +#endif + if (features & ~EXT2_LIB_FEATURE_INCOMPAT_SUPP) { + retval = EXT2_ET_UNSUPP_FEATURE; + goto cleanup; + } + + features = fs->super->s_feature_ro_compat; +#ifdef EXT2_LIB_SOFTSUPP_RO_COMPAT + if (flags & EXT2_FLAG_SOFTSUPP_FEATURES) + features &= !EXT2_LIB_SOFTSUPP_RO_COMPAT; +#endif + if ((flags & EXT2_FLAG_RW) && + (features & ~EXT2_LIB_FEATURE_RO_COMPAT_SUPP)) { + retval = EXT2_ET_RO_UNSUPP_FEATURE; + goto cleanup; + } + + if (!(flags & EXT2_FLAG_JOURNAL_DEV_OK) && + (fs->super->s_feature_incompat & + EXT3_FEATURE_INCOMPAT_JOURNAL_DEV)) { + retval = EXT2_ET_UNSUPP_FEATURE; + goto cleanup; + } + } + + if ((fs->super->s_log_block_size + EXT2_MIN_BLOCK_LOG_SIZE) > + EXT2_MAX_BLOCK_LOG_SIZE) { + retval = EXT2_ET_CORRUPT_SUPERBLOCK; + goto cleanup; + } + fs->blocksize = EXT2_BLOCK_SIZE(fs->super); + if (EXT2_INODE_SIZE(fs->super) < EXT2_GOOD_OLD_INODE_SIZE) { + retval = EXT2_ET_CORRUPT_SUPERBLOCK; + goto cleanup; + } + fs->clustersize = EXT2_CLUSTER_SIZE(fs->super); + fs->inode_blocks_per_group = ((EXT2_INODES_PER_GROUP(fs->super) * + EXT2_INODE_SIZE(fs->super) + + EXT2_BLOCK_SIZE(fs->super) - 1) / + EXT2_BLOCK_SIZE(fs->super)); + if (block_size) { + if (block_size != fs->blocksize) { + retval = EXT2_ET_UNEXPECTED_BLOCK_SIZE; + goto cleanup; + } + } + /* + * Set the blocksize to the filesystem's blocksize. + */ + io_channel_set_blksize(fs->io, fs->blocksize); + + /* + * If this is an external journal device, don't try to read + * the group descriptors, because they're not there. + */ + if (fs->super->s_feature_incompat & + EXT3_FEATURE_INCOMPAT_JOURNAL_DEV) { + fs->group_desc_count = 0; + *ret_fs = fs; + return 0; + } + + if (EXT2_INODES_PER_GROUP(fs->super) == 0) { + retval = EXT2_ET_CORRUPT_SUPERBLOCK; + goto cleanup; + } + + /* + * Read group descriptors + */ + blocks_per_group = EXT2_BLOCKS_PER_GROUP(fs->super); + if (blocks_per_group == 0 || + blocks_per_group > EXT2_MAX_BLOCKS_PER_GROUP(fs->super) || + fs->inode_blocks_per_group > EXT2_MAX_INODES_PER_GROUP(fs->super) || + EXT2_DESC_PER_BLOCK(fs->super) == 0 || + fs->super->s_first_data_block >= ext2fs_blocks_count(fs->super)) { + retval = EXT2_ET_CORRUPT_SUPERBLOCK; + goto cleanup; + } + fs->group_desc_count = ext2fs_div64_ceil(ext2fs_blocks_count(fs->super) - + fs->super->s_first_data_block, + blocks_per_group); + if (fs->group_desc_count * EXT2_INODES_PER_GROUP(fs->super) != + fs->super->s_inodes_count) { + retval = EXT2_ET_CORRUPT_SUPERBLOCK; + goto cleanup; + } + fs->desc_blocks = ext2fs_div_ceil(fs->group_desc_count, + EXT2_DESC_PER_BLOCK(fs->super)); + retval = ext2fs_get_array(fs->desc_blocks, fs->blocksize, + &fs->group_desc); + if (retval) + goto cleanup; + if (!group_block) + group_block = fs->super->s_first_data_block; + dest = (char *) fs->group_desc; + groups_per_block = EXT2_DESC_PER_BLOCK(fs->super); + if (fs->super->s_feature_incompat & EXT2_FEATURE_INCOMPAT_META_BG) + first_meta_bg = fs->super->s_first_meta_bg; + else + first_meta_bg = fs->desc_blocks; + if (first_meta_bg) { + retval = io_channel_read_blk(fs->io, group_block+1, + first_meta_bg, dest); + if (retval) + goto cleanup; +#ifdef WORDS_BIGENDIAN + gdp = (struct ext2_group_desc *) dest; + for (j=0; j < groups_per_block*first_meta_bg; j++) { + gdp = ext2fs_group_desc(fs, fs->group_desc, j); + ext2fs_swap_group_desc2(fs, gdp); + } +#endif + dest += fs->blocksize*first_meta_bg; + } + for (i=first_meta_bg ; i < fs->desc_blocks; i++) { + blk = ext2fs_descriptor_block_loc2(fs, group_block, i); + retval = io_channel_read_blk64(fs->io, blk, 1, dest); + if (retval) + goto cleanup; +#ifdef WORDS_BIGENDIAN + for (j=0; j < groups_per_block; j++) { + /* The below happens to work... be careful. */ + gdp = ext2fs_group_desc(fs, fs->group_desc, j); + ext2fs_swap_group_desc2(fs, gdp); + } +#endif + dest += fs->blocksize; + } + + fs->stride = fs->super->s_raid_stride; + + /* + * If recovery is from backup superblock, Clear _UNININT flags & + * reset bg_itable_unused to zero + */ + if (superblock > 1 && EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) { + dgrp_t group; + + for (group = 0; group < fs->group_desc_count; group++) { + ext2fs_bg_flags_clear(fs, group, EXT2_BG_BLOCK_UNINIT); + ext2fs_bg_flags_clear(fs, group, EXT2_BG_INODE_UNINIT); + ext2fs_bg_itable_unused_set(fs, group, 0); + } + ext2fs_mark_super_dirty(fs); + } + + fs->flags &= ~EXT2_FLAG_NOFREE_ON_ERROR; + *ret_fs = fs; + return 0; +cleanup: + if (flags & EXT2_FLAG_NOFREE_ON_ERROR) + *ret_fs = fs; + else + ext2fs_free(fs); + return retval; +} + +/* + * Set/get the filesystem data I/O channel. + * + * These functions are only valid if EXT2_FLAG_IMAGE_FILE is true. + */ +errcode_t ext2fs_get_data_io(ext2_filsys fs, io_channel *old_io) +{ + if ((fs->flags & EXT2_FLAG_IMAGE_FILE) == 0) + return EXT2_ET_NOT_IMAGE_FILE; + if (old_io) { + *old_io = (fs->image_io == fs->io) ? 0 : fs->io; + } + return 0; +} + +errcode_t ext2fs_set_data_io(ext2_filsys fs, io_channel new_io) +{ + if ((fs->flags & EXT2_FLAG_IMAGE_FILE) == 0) + return EXT2_ET_NOT_IMAGE_FILE; + fs->io = new_io ? new_io : fs->image_io; + return 0; +} + +errcode_t ext2fs_rewrite_to_io(ext2_filsys fs, io_channel new_io) +{ + if ((fs->flags & EXT2_FLAG_IMAGE_FILE) == 0) + return EXT2_ET_NOT_IMAGE_FILE; + fs->io = fs->image_io = new_io; + fs->flags |= EXT2_FLAG_DIRTY | EXT2_FLAG_RW | + EXT2_FLAG_BB_DIRTY | EXT2_FLAG_IB_DIRTY; + fs->flags &= ~EXT2_FLAG_IMAGE_FILE; + return 0; +} diff --git a/portlibs/sources/libext2fs/source/partitions.h b/portlibs/sources/libext2fs/source/partitions.h new file mode 100644 index 00000000..9bb1049b --- /dev/null +++ b/portlibs/sources/libext2fs/source/partitions.h @@ -0,0 +1,49 @@ +#ifndef PARTITIONS_H_ +#define PARTITIONS_H_ + +#include <gccore.h> +#include "bitops.h" + +#define MBR_SIGNATURE ext2fs_cpu_to_le16(0xAA55) +#define EBR_SIGNATURE ext2fs_cpu_to_le16(0xAA55) + +#define PARTITION_STATUS_BOOTABLE 0x80 /* Bootable (active) */ + +#define PARTITION_TYPE_EMPTY 0x00 /* Empty */ +#define PARTITION_TYPE_DOS33_EXTENDED 0x05 /* DOS 3.3+ extended partition */ +#define PARTITION_TYPE_WIN95_EXTENDED 0x0F /* Windows 95 extended partition */ +#define PARTITION_TYPE_LINUX 0x83 /* EXT2/3/4 */ + +/** + * PRIMARY_PARTITION - Block device partition record + */ +typedef struct _PARTITION_RECORD { + u8 status; /* Partition status; see above */ + u8 chs_start[3]; /* Cylinder-head-sector address to first block of partition */ + u8 type; /* Partition type; see above */ + u8 chs_end[3]; /* Cylinder-head-sector address to last block of partition */ + u32 lba_start; /* Local block address to first sector of partition */ + u32 block_count; /* Number of blocks in partition */ +} __attribute__((__packed__)) PARTITION_RECORD; + +/** + * MASTER_BOOT_RECORD - Block device master boot record + */ +typedef struct _MASTER_BOOT_RECORD { + u8 code_area[446]; /* Code area; normally empty */ + PARTITION_RECORD partitions[4]; /* 4 primary partitions */ + u16 signature; /* MBR signature; 0xAA55 */ +} __attribute__((__packed__)) MASTER_BOOT_RECORD; + +/** + * EXTENDED_PARTITION - Block device extended boot record + */ +typedef struct _EXTENDED_BOOT_RECORD { + u8 code_area[446]; /* Code area; normally empty */ + PARTITION_RECORD partition; /* Primary partition */ + PARTITION_RECORD next_ebr; /* Next extended boot record in the chain */ + u8 reserved[32]; /* Normally empty */ + u16 signature; /* EBR signature; 0xAA55 */ +} __attribute__((__packed__)) EXTENDED_BOOT_RECORD; + +#endif diff --git a/portlibs/sources/libext2fs/source/progress.c b/portlibs/sources/libext2fs/source/progress.c new file mode 100644 index 00000000..335b98b5 --- /dev/null +++ b/portlibs/sources/libext2fs/source/progress.c @@ -0,0 +1,86 @@ +/* + * progress.c - Numeric progress meter + * + * Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, + * 2003, 2004, 2005 by Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Public + * License. + * %End-Header% + */ + +#include "ext2fs.h" +#include "ext2fsP.h" + +static char spaces[80], backspaces[80]; + +static int int_log10(unsigned int arg) +{ + int l; + + for (l=0; arg ; l++) + arg = arg / 10; + return l; +} + +void ext2fs_numeric_progress_init(ext2_filsys fs, + struct ext2fs_numeric_progress_struct * progress, + const char *label, __u64 max) +{ + /* + * The PRINT_PROGRESS flag turns on or off ALL + * progress-related messages, whereas the SKIP_PROGRESS + * environment variable prints the start and end messages but + * not the numeric countdown in the middle. + */ + if (!(fs->flags & EXT2_FLAG_PRINT_PROGRESS)) + return; + + memset(spaces, ' ', sizeof(spaces)-1); + spaces[sizeof(spaces)-1] = 0; + memset(backspaces, '\b', sizeof(backspaces)-1); + backspaces[sizeof(backspaces)-1] = 0; + progress->skip_progress = 0; + if (getenv("E2FSPROGS_SKIP_PROGRESS")) + progress->skip_progress++; + + memset(progress, 0, sizeof(*progress)); + + /* + * Figure out how many digits we need + */ + progress->max = max; + progress->log_max = int_log10(max); + + if (label) { + fputs(label, stdout); + fflush(stdout); + } +} + +void ext2fs_numeric_progress_update(ext2_filsys fs, + struct ext2fs_numeric_progress_struct * progress, + __u64 val) +{ + if (!(fs->flags & EXT2_FLAG_PRINT_PROGRESS)) + return; + if (progress->skip_progress) + return; + + fprintf(stdout, "%*llu/%*llu", progress->log_max, val, + progress->log_max, progress->max); + fprintf(stdout, "%.*s", (2*progress->log_max)+1, backspaces); +} + +void ext2fs_numeric_progress_close(ext2_filsys fs, + struct ext2fs_numeric_progress_struct * progress, + const char *message) +{ + if (!(fs->flags & EXT2_FLAG_PRINT_PROGRESS)) + return; + fprintf(stdout, "%.*s", (2*progress->log_max)+1, spaces); + fprintf(stdout, "%.*s", (2*progress->log_max)+1, backspaces); + if (message) + fputs(message, stdout); +} diff --git a/portlibs/sources/libext2fs/source/punch.c b/portlibs/sources/libext2fs/source/punch.c new file mode 100644 index 00000000..8c6ec549 --- /dev/null +++ b/portlibs/sources/libext2fs/source/punch.c @@ -0,0 +1,324 @@ +/* + * punch.c --- deallocate blocks allocated to an inode + * + * Copyright (C) 2010 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <errno.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +#undef PUNCH_DEBUG + +/* + * This function returns 1 if the specified block is all zeros + */ +static int check_zero_block(char *buf, int blocksize) +{ + char *cp = buf; + int left = blocksize; + + while (left > 0) { + if (*cp++) + return 0; + left--; + } + return 1; +} + +/* + * This clever recursive function handles i_blocks[] as well as + * indirect, double indirect, and triple indirect blocks. It iterates + * over the entries in the i_blocks array or indirect blocks, and for + * each one, will recursively handle any indirect blocks and then + * frees and deallocates the blocks. + */ +static errcode_t ind_punch(ext2_filsys fs, struct ext2_inode *inode, + char *block_buf, blk_t *p, int level, + blk_t start, blk_t count, int max) +{ + errcode_t retval; + blk_t b, offset; + int i, incr; + int freed = 0; + +#ifdef PUNCH_DEBUG + printf("Entering ind_punch, level %d, start %u, count %u, " + "max %d\n", level, start, count, max); +#endif + incr = 1 << ((EXT2_BLOCK_SIZE_BITS(fs->super)-2)*level); + for (i=0, offset=0; i < max; i++, p++, offset += incr) { + if (offset > count) + break; + if (*p == 0 || (offset+incr) <= start) + continue; + b = *p; + if (level > 0) { + blk_t start2; +#ifdef PUNCH_DEBUG + printf("Reading indirect block %u\n", b); +#endif + retval = ext2fs_read_ind_block(fs, b, block_buf); + if (retval) + return retval; + start2 = (start > offset) ? start - offset : 0; + retval = ind_punch(fs, inode, block_buf + fs->blocksize, + (blk_t *) block_buf, level - 1, + start2, count - offset, + fs->blocksize >> 2); + if (retval) + return retval; + retval = ext2fs_write_ind_block(fs, b, block_buf); + if (retval) + return retval; + if (!check_zero_block(block_buf, fs->blocksize)) + continue; + } +#ifdef PUNCH_DEBUG + printf("Freeing block %u (offset %d)\n", b, offset); +#endif + ext2fs_block_alloc_stats(fs, b, -1); + *p = 0; + freed++; + } +#ifdef PUNCH_DEBUG + printf("Freed %d blocks\n", freed); +#endif + return ext2fs_iblk_sub_blocks(fs, inode, freed); +} + +static errcode_t ext2fs_punch_ind(ext2_filsys fs, struct ext2_inode *inode, + char *block_buf, blk_t start, blk_t count) +{ + errcode_t retval; + char *buf = 0; + int level; + int num = EXT2_NDIR_BLOCKS; + blk_t *bp = inode->i_block; + blk_t addr_per_block; + blk_t max = EXT2_NDIR_BLOCKS; + + if (!block_buf) { + retval = ext2fs_get_array(3, fs->blocksize, &buf); + if (retval) + return retval; + block_buf = buf; + } + + addr_per_block = (blk_t) fs->blocksize >> 2; + + for (level=0; level < 4; level++, max *= addr_per_block) { +#ifdef PUNCH_DEBUG + printf("Main loop level %d, start %u count %u " + "max %d num %d\n", level, start, count, max, num); +#endif + if (start < max) { + retval = ind_punch(fs, inode, block_buf, bp, level, + start, count, num); + if (retval) + goto errout; + if (count > max) + count -= max - start; + else + break; + start = 0; + } else + start -= max; + bp += num; + if (level == 0) { + num = 1; + max = 1; + } + } + retval = 0; +errout: + if (buf) + ext2fs_free_mem(&buf); + return retval; +} + +#ifdef PUNCH_DEBUG + +#define dbg_printf(f, a...) printf(f, ## a) + +static void dbg_print_extent(char *desc, struct ext2fs_extent *extent) +{ + if (desc) + printf("%s: ", desc); + printf("extent: lblk %llu--%llu, len %u, pblk %llu, flags: ", + extent->e_lblk, extent->e_lblk + extent->e_len - 1, + extent->e_len, extent->e_pblk); + if (extent->e_flags & EXT2_EXTENT_FLAGS_LEAF) + fputs("LEAF ", stdout); + if (extent->e_flags & EXT2_EXTENT_FLAGS_UNINIT) + fputs("UNINIT ", stdout); + if (extent->e_flags & EXT2_EXTENT_FLAGS_SECOND_VISIT) + fputs("2ND_VISIT ", stdout); + if (!extent->e_flags) + fputs("(none)", stdout); + fputc('\n', stdout); + +} +#else +#define dbg_print_extent(desc, ex) do { } while (0) +#define dbg_printf(f, a...) do { } while (0) +#endif + +static errcode_t ext2fs_punch_extent(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + blk64_t start, blk64_t end) +{ + ext2_extent_handle_t handle = 0; + struct ext2fs_extent extent; + errcode_t retval; + blk64_t free_start, next; + __u32 free_count, newlen; + int freed = 0; + + retval = ext2fs_extent_open2(fs, ino, inode, &handle); + if (retval) + return retval; + ext2fs_extent_goto(handle, start); + retval = ext2fs_extent_get(handle, EXT2_EXTENT_CURRENT, &extent); + if (retval) + goto errout; + while (1) { + dbg_print_extent("main loop", &extent); + next = extent.e_lblk + extent.e_len; + dbg_printf("start %llu, end %llu, next %llu\n", + (unsigned long long) start, + (unsigned long long) end, + (unsigned long long) next); + if (start <= extent.e_lblk) { + if (end < extent.e_lblk) + goto next_extent; + dbg_printf("Case #1\n"); + /* Start of deleted region before extent; + adjust beginning of extent */ + free_start = extent.e_pblk; + if (next > end) + free_count = end - extent.e_lblk + 1; + else + free_count = extent.e_len; + extent.e_len -= free_count; + extent.e_lblk += free_count; + extent.e_pblk += free_count; + } else if (end >= next-1) { + if (start >= next) + break; + /* End of deleted region after extent; + adjust end of extent */ + dbg_printf("Case #2\n"); + newlen = start - extent.e_lblk; + free_start = extent.e_pblk + newlen; + free_count = extent.e_len - newlen; + extent.e_len = newlen; + } else { + struct ext2fs_extent newex; + + dbg_printf("Case #3\n"); + /* The hard case; we need to split the extent */ + newex.e_pblk = extent.e_pblk + + (end + 1 - extent.e_lblk); + newex.e_lblk = end + 1; + newex.e_len = next - end - 1; + newex.e_flags = extent.e_flags; + + extent.e_len = start - extent.e_lblk; + free_start = extent.e_pblk + extent.e_len; + free_count = end - start + 1; + + dbg_print_extent("inserting", &newex); + retval = ext2fs_extent_insert(handle, + EXT2_EXTENT_INSERT_AFTER, &newex); + if (retval) + goto errout; + /* Now pointing at inserted extent; so go back */ + retval = ext2fs_extent_get(handle, + EXT2_EXTENT_PREV_LEAF, + &newex); + if (retval) + goto errout; + } + if (extent.e_len) { + dbg_print_extent("replacing", &extent); + retval = ext2fs_extent_replace(handle, 0, &extent); + } else { + dbg_printf("deleting current extent\n"); + retval = ext2fs_extent_delete(handle, 0); + } + if (retval) + goto errout; + dbg_printf("Free start %llu, free count = %u\n", + free_start, free_count); + while (free_count-- > 0) { + ext2fs_block_alloc_stats(fs, free_start++, -1); + freed++; + } + next_extent: + retval = ext2fs_extent_get(handle, EXT2_EXTENT_NEXT_LEAF, + &extent); + if (retval == EXT2_ET_EXTENT_NO_NEXT) + break; + if (retval) + goto errout; + } + dbg_printf("Freed %d blocks\n", freed); + retval = ext2fs_iblk_sub_blocks(fs, inode, freed); +errout: + ext2fs_extent_free(handle); + return retval; +} + +/* + * Deallocate all logical blocks starting at start to end, inclusive. + * If end is ~0, then this is effectively truncate. + */ +extern errcode_t ext2fs_punch(ext2_filsys fs, ext2_ino_t ino, + struct ext2_inode *inode, + char *block_buf, blk64_t start, + blk64_t end) +{ + errcode_t retval; + struct ext2_inode inode_buf; + + if (start > end) + return EINVAL; + + if (start == end) + return 0; + + /* Read inode structure if necessary */ + if (!inode) { + retval = ext2fs_read_inode(fs, ino, &inode_buf); + if (retval) + return retval; + inode = &inode_buf; + } + if (inode->i_flags & EXT4_EXTENTS_FL) + retval = ext2fs_punch_extent(fs, ino, inode, start, end); + else { + blk_t count; + + if (start > ~0U) + return 0; + count = ((end - start) < ~0U) ? (end - start) : ~0U; + retval = ext2fs_punch_ind(fs, inode, block_buf, + (blk_t) start, count); + } + if (retval) + return retval; + + return ext2fs_write_inode(fs, ino, inode); +} diff --git a/portlibs/sources/libext2fs/source/read_bb.c b/portlibs/sources/libext2fs/source/read_bb.c new file mode 100644 index 00000000..e5d63227 --- /dev/null +++ b/portlibs/sources/libext2fs/source/read_bb.c @@ -0,0 +1,102 @@ +/* + * read_bb --- read the bad blocks inode + * + * Copyright (C) 1994 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +struct read_bb_record { + ext2_badblocks_list bb_list; + errcode_t err; +}; + +/* + * Helper function for ext2fs_read_bb_inode() + */ +#ifdef __TURBOC__ + #pragma argsused +#endif +static int mark_bad_block(ext2_filsys fs, blk_t *block_nr, + e2_blkcnt_t blockcnt EXT2FS_ATTR((unused)), + blk_t ref_block EXT2FS_ATTR((unused)), + int ref_offset EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct read_bb_record *rb = (struct read_bb_record *) priv_data; + + if (blockcnt < 0) + return 0; + + if ((*block_nr < fs->super->s_first_data_block) || + (*block_nr >= ext2fs_blocks_count(fs->super))) + return 0; /* Ignore illegal blocks */ + + rb->err = ext2fs_badblocks_list_add(rb->bb_list, *block_nr); + if (rb->err) + return BLOCK_ABORT; + return 0; +} + +/* + * Reads the current bad blocks from the bad blocks inode. + */ +errcode_t ext2fs_read_bb_inode(ext2_filsys fs, ext2_badblocks_list *bb_list) +{ + errcode_t retval; + struct read_bb_record rb; + struct ext2_inode inode; + blk_t numblocks; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!*bb_list) { + retval = ext2fs_read_inode(fs, EXT2_BAD_INO, &inode); + if (retval) + return retval; + numblocks = inode.i_blocks; + if (!((fs->super->s_feature_ro_compat & + EXT4_FEATURE_RO_COMPAT_HUGE_FILE) && + (inode.i_flags & EXT4_HUGE_FILE_FL))) + numblocks = numblocks / (fs->blocksize / 512); + numblocks += 20; + if (numblocks < 50) + numblocks = 50; + if (numblocks > 50000) + numblocks = 500; + retval = ext2fs_badblocks_list_create(bb_list, numblocks); + if (retval) + return retval; + } + + rb.bb_list = *bb_list; + rb.err = 0; + retval = ext2fs_block_iterate2(fs, EXT2_BAD_INO, BLOCK_FLAG_READ_ONLY, + 0, mark_bad_block, &rb); + if (retval) + return retval; + + return rb.err; +} + + diff --git a/portlibs/sources/libext2fs/source/read_bb_file.c b/portlibs/sources/libext2fs/source/read_bb_file.c new file mode 100644 index 00000000..25454a87 --- /dev/null +++ b/portlibs/sources/libext2fs/source/read_bb_file.c @@ -0,0 +1,105 @@ +/* + * read_bb_file.c --- read a list of bad blocks from a FILE * + * + * Copyright (C) 1994, 1995, 2000 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#if HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#if HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +/* + * Reads a list of bad blocks from a FILE * + */ +errcode_t ext2fs_read_bb_FILE2(ext2_filsys fs, FILE *f, + ext2_badblocks_list *bb_list, + void *priv_data, + void (*invalid)(ext2_filsys fs, + blk_t blk, + char *badstr, + void *priv_data)) +{ + errcode_t retval; + blk_t blockno; + int count; + char buf[128]; + + if (fs) + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!*bb_list) { + retval = ext2fs_badblocks_list_create(bb_list, 10); + if (retval) + return retval; + } + + while (!feof (f)) { + if (fgets(buf, sizeof(buf), f) == NULL) + break; + count = sscanf(buf, "%u", &blockno); + if (count <= 0) + continue; + if (fs && + ((blockno < fs->super->s_first_data_block) || + (blockno >= ext2fs_blocks_count(fs->super)))) { + if (invalid) + (invalid)(fs, blockno, buf, priv_data); + continue; + } + retval = ext2fs_badblocks_list_add(*bb_list, blockno); + if (retval) + return retval; + } + return 0; +} + +struct compat_struct { + void (*invalid)(ext2_filsys, blk_t); +}; + +static void call_compat_invalid(ext2_filsys fs, blk_t blk, + char *badstr EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct compat_struct *st; + + st = (struct compat_struct *) priv_data; + if (st->invalid) + (st->invalid)(fs, blk); +} + + +/* + * Reads a list of bad blocks from a FILE * + */ +errcode_t ext2fs_read_bb_FILE(ext2_filsys fs, FILE *f, + ext2_badblocks_list *bb_list, + void (*invalid)(ext2_filsys fs, blk_t blk)) +{ + struct compat_struct st; + + st.invalid = invalid; + + return ext2fs_read_bb_FILE2(fs, f, bb_list, &st, + call_compat_invalid); +} + + diff --git a/portlibs/sources/libext2fs/source/res_gdt.c b/portlibs/sources/libext2fs/source/res_gdt.c new file mode 100644 index 00000000..0d988428 --- /dev/null +++ b/portlibs/sources/libext2fs/source/res_gdt.c @@ -0,0 +1,220 @@ +/* + * res_gdt.c --- reserve blocks for growing the group descriptor table + * during online resizing. + * + * Copyright (C) 2002 Andreas Dilger + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#include <time.h> +#include "ext2_fs.h" +#include "ext2fs.h" + +/* + * Iterate through the groups which hold BACKUP superblock/GDT copies in an + * ext3 filesystem. The counters should be initialized to 1, 5, and 7 before + * calling this for the first time. In a sparse filesystem it will be the + * sequence of powers of 3, 5, and 7: 1, 3, 5, 7, 9, 25, 27, 49, 81, ... + * For a non-sparse filesystem it will be every group: 1, 2, 3, 4, ... + */ +static unsigned int list_backups(ext2_filsys fs, unsigned int *three, + unsigned int *five, unsigned int *seven) +{ + unsigned int *min = three; + int mult = 3; + unsigned int ret; + + if (!(fs->super->s_feature_ro_compat & + EXT2_FEATURE_RO_COMPAT_SPARSE_SUPER)) { + ret = *min; + *min += 1; + return ret; + } + + if (*five < *min) { + min = five; + mult = 5; + } + if (*seven < *min) { + min = seven; + mult = 7; + } + + ret = *min; + *min *= mult; + + return ret; +} + +/* + * This code assumes that the reserved blocks have already been marked in-use + * during ext2fs_initialize(), so that they are not allocated for other + * uses before we can add them to the resize inode (which has to come + * after the creation of the inode table). + */ +errcode_t ext2fs_create_resize_inode(ext2_filsys fs) +{ + errcode_t retval, retval2; + struct ext2_super_block *sb; + struct ext2_inode inode; + __u32 *dindir_buf = 0, *gdt_buf = 0; + unsigned long long apb, inode_size; + /* FIXME-64 - can't deal with extents */ + blk_t dindir_blk, rsv_off, gdt_off, gdt_blk; + int dindir_dirty = 0, inode_dirty = 0; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + sb = fs->super; + + retval = ext2fs_get_array(2, fs->blocksize, &dindir_buf); + if (retval) + goto out_free; + gdt_buf = (__u32 *)((char *)dindir_buf + fs->blocksize); + + retval = ext2fs_read_inode(fs, EXT2_RESIZE_INO, &inode); + if (retval) + goto out_free; + + /* Maximum possible file size (we donly use the dindirect blocks) */ + apb = EXT2_ADDR_PER_BLOCK(sb); + if ((dindir_blk = inode.i_block[EXT2_DIND_BLOCK])) { +#ifdef RES_GDT_DEBUG + printf("reading GDT dindir %u\n", dindir_blk); +#endif + retval = ext2fs_read_ind_block(fs, dindir_blk, dindir_buf); + if (retval) + goto out_inode; + } else { + blk_t goal = sb->s_first_data_block + fs->desc_blocks + + sb->s_reserved_gdt_blocks + 2 + + fs->inode_blocks_per_group; + + retval = ext2fs_alloc_block(fs, goal, 0, &dindir_blk); + if (retval) + goto out_free; + inode.i_mode = LINUX_S_IFREG | 0600; + inode.i_links_count = 1; + inode.i_block[EXT2_DIND_BLOCK] = dindir_blk; + ext2fs_iblk_set(fs, &inode, 1); + memset(dindir_buf, 0, fs->blocksize); +#ifdef RES_GDT_DEBUG + printf("allocated GDT dindir %u\n", dindir_blk); +#endif + dindir_dirty = inode_dirty = 1; + inode_size = apb*apb + apb + EXT2_NDIR_BLOCKS; + inode_size *= fs->blocksize; + inode.i_size = inode_size & 0xFFFFFFFF; + inode.i_size_high = (inode_size >> 32) & 0xFFFFFFFF; + if(inode.i_size_high) { + sb->s_feature_ro_compat |= + EXT2_FEATURE_RO_COMPAT_LARGE_FILE; + } + inode.i_ctime = fs->now ? fs->now : time(0); + } + + for (rsv_off = 0, gdt_off = fs->desc_blocks, + gdt_blk = sb->s_first_data_block + 1 + fs->desc_blocks; + rsv_off < sb->s_reserved_gdt_blocks; + rsv_off++, gdt_off++, gdt_blk++) { + unsigned int three = 1, five = 5, seven = 7; + unsigned int grp, last = 0; + int gdt_dirty = 0; + + gdt_off %= apb; + if (!dindir_buf[gdt_off]) { + /* FIXME XXX XXX + blk_t new_blk; + + retval = ext2fs_new_block(fs, gdt_blk, 0, &new_blk); + if (retval) + goto out_free; + if (new_blk != gdt_blk) { + // XXX free block + retval = -1; // XXX + } + */ + gdt_dirty = dindir_dirty = inode_dirty = 1; + memset(gdt_buf, 0, fs->blocksize); + dindir_buf[gdt_off] = gdt_blk; + ext2fs_iblk_add_blocks(fs, &inode, 1); +#ifdef RES_GDT_DEBUG + printf("added primary GDT block %u at %u[%u]\n", + gdt_blk, dindir_blk, gdt_off); +#endif + } else if (dindir_buf[gdt_off] == gdt_blk) { +#ifdef RES_GDT_DEBUG + printf("reading primary GDT block %u\n", gdt_blk); +#endif + retval = ext2fs_read_ind_block(fs, gdt_blk, gdt_buf); + if (retval) + goto out_dindir; + } else { +#ifdef RES_GDT_DEBUG + printf("bad primary GDT %u != %u at %u[%u]\n", + dindir_buf[gdt_off], gdt_blk,dindir_blk,gdt_off); +#endif + retval = EXT2_ET_RESIZE_INODE_CORRUPT; + goto out_dindir; + } + + while ((grp = list_backups(fs, &three, &five, &seven)) < + fs->group_desc_count) { + blk_t expect = gdt_blk + grp * sb->s_blocks_per_group; + + if (!gdt_buf[last]) { +#ifdef RES_GDT_DEBUG + printf("added backup GDT %u grp %u@%u[%u]\n", + expect, grp, gdt_blk, last); +#endif + gdt_buf[last] = expect; + ext2fs_iblk_add_blocks(fs, &inode, 1); + gdt_dirty = inode_dirty = 1; + } else if (gdt_buf[last] != expect) { +#ifdef RES_GDT_DEBUG + printf("bad backup GDT %u != %u at %u[%u]\n", + gdt_buf[last], expect, gdt_blk, last); +#endif + retval = EXT2_ET_RESIZE_INODE_CORRUPT; + goto out_dindir; + } + last++; + } + if (gdt_dirty) { +#ifdef RES_GDT_DEBUG + printf("writing primary GDT block %u\n", gdt_blk); +#endif + retval = ext2fs_write_ind_block(fs, gdt_blk, gdt_buf); + if (retval) + goto out_dindir; + } + } + +out_dindir: + if (dindir_dirty) { + retval2 = ext2fs_write_ind_block(fs, dindir_blk, dindir_buf); + if (!retval) + retval = retval2; + } +out_inode: +#ifdef RES_GDT_DEBUG + printf("inode.i_blocks = %u, i_size = %u\n", inode.i_blocks, + inode.i_size); +#endif + if (inode_dirty) { + inode.i_atime = inode.i_mtime = fs->now ? fs->now : time(0); + retval2 = ext2fs_write_new_inode(fs, EXT2_RESIZE_INO, &inode); + if (!retval) + retval = retval2; + } +out_free: + ext2fs_free_mem(&dindir_buf); + return retval; +} + diff --git a/portlibs/sources/libext2fs/source/rw_bitmaps.c b/portlibs/sources/libext2fs/source/rw_bitmaps.c new file mode 100644 index 00000000..7b74b421 --- /dev/null +++ b/portlibs/sources/libext2fs/source/rw_bitmaps.c @@ -0,0 +1,351 @@ +/* + * rw_bitmaps.c --- routines to read and write the inode and block bitmaps. + * + * Copyright (C) 1993, 1994, 1994, 1996 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <fcntl.h> +#include <time.h> +#ifdef HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#ifdef HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" +#include "e2image.h" + +static errcode_t write_bitmaps(ext2_filsys fs, int do_inode, int do_block) +{ + dgrp_t i; + unsigned int j; + int block_nbytes, inode_nbytes; + unsigned int nbits; + errcode_t retval; + char *block_buf = 0, *inode_buf = 0; + int csum_flag = 0; + blk64_t blk; + blk64_t blk_itr = fs->super->s_first_data_block; + ext2_ino_t ino_itr = 1; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!(fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + if (EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) + csum_flag = 1; + + inode_nbytes = block_nbytes = 0; + if (do_block) { + block_nbytes = EXT2_BLOCKS_PER_GROUP(fs->super) / 8; + retval = ext2fs_get_memalign(fs->blocksize, fs->blocksize, + &block_buf); + if (retval) + return retval; + memset(block_buf, 0xff, fs->blocksize); + } + if (do_inode) { + inode_nbytes = (size_t) + ((EXT2_INODES_PER_GROUP(fs->super)+7) / 8); + retval = ext2fs_get_memalign(fs->blocksize, fs->blocksize, + &inode_buf); + if (retval) + return retval; + memset(inode_buf, 0xff, fs->blocksize); + } + + for (i = 0; i < fs->group_desc_count; i++) { + if (!do_block) + goto skip_block_bitmap; + + if (csum_flag && ext2fs_bg_flags_test(fs, i, EXT2_BG_BLOCK_UNINIT) + ) + goto skip_this_block_bitmap; + + retval = ext2fs_get_block_bitmap_range2(fs->block_map, + blk_itr, block_nbytes << 3, block_buf); + if (retval) + return retval; + + if (i == fs->group_desc_count - 1) { + /* Force bitmap padding for the last group */ + nbits = ((ext2fs_blocks_count(fs->super) + - (__u64) fs->super->s_first_data_block) + % (__u64) EXT2_BLOCKS_PER_GROUP(fs->super)); + if (nbits) + for (j = nbits; j < fs->blocksize * 8; j++) + ext2fs_set_bit(j, block_buf); + } + blk = ext2fs_block_bitmap_loc(fs, i); + if (blk) { + retval = io_channel_write_blk64(fs->io, blk, 1, + block_buf); + if (retval) + return EXT2_ET_BLOCK_BITMAP_WRITE; + } + skip_this_block_bitmap: + blk_itr += block_nbytes << 3; + skip_block_bitmap: + + if (!do_inode) + continue; + + if (csum_flag && ext2fs_bg_flags_test(fs, i, EXT2_BG_INODE_UNINIT) + ) + goto skip_this_inode_bitmap; + + retval = ext2fs_get_inode_bitmap_range2(fs->inode_map, + ino_itr, inode_nbytes << 3, inode_buf); + if (retval) + return retval; + + blk = ext2fs_inode_bitmap_loc(fs, i); + if (blk) { + retval = io_channel_write_blk64(fs->io, blk, 1, + inode_buf); + if (retval) + return EXT2_ET_INODE_BITMAP_WRITE; + } + skip_this_inode_bitmap: + ino_itr += inode_nbytes << 3; + + } + if (do_block) { + fs->flags &= ~EXT2_FLAG_BB_DIRTY; + ext2fs_free_mem(&block_buf); + } + if (do_inode) { + fs->flags &= ~EXT2_FLAG_IB_DIRTY; + ext2fs_free_mem(&inode_buf); + } + return 0; +} + +static errcode_t read_bitmaps(ext2_filsys fs, int do_inode, int do_block) +{ + dgrp_t i; + char *block_bitmap = 0, *inode_bitmap = 0; + char *buf; + errcode_t retval; + int block_nbytes = EXT2_BLOCKS_PER_GROUP(fs->super) / 8; + int inode_nbytes = EXT2_INODES_PER_GROUP(fs->super) / 8; + int csum_flag = 0; + int do_image = fs->flags & EXT2_FLAG_IMAGE_FILE; + unsigned int cnt; + blk64_t blk; + blk64_t blk_itr = fs->super->s_first_data_block; + blk64_t blk_cnt; + ext2_ino_t ino_itr = 1; + ext2_ino_t ino_cnt; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + fs->write_bitmaps = ext2fs_write_bitmaps; + + if (EXT2_HAS_RO_COMPAT_FEATURE(fs->super, + EXT4_FEATURE_RO_COMPAT_GDT_CSUM)) + csum_flag = 1; + + retval = ext2fs_get_mem(strlen(fs->device_name) + 80, &buf); + if (retval) + return retval; + if (do_block) { + if (fs->block_map) + ext2fs_free_block_bitmap(fs->block_map); + strcpy(buf, "block bitmap for "); + strcat(buf, fs->device_name); + retval = ext2fs_allocate_block_bitmap(fs, buf, &fs->block_map); + if (retval) + goto cleanup; + if (do_image) + retval = ext2fs_get_mem(fs->blocksize, &block_bitmap); + else + retval = ext2fs_get_memalign((unsigned) block_nbytes, + fs->blocksize, + &block_bitmap); + + if (retval) + goto cleanup; + } else + block_nbytes = 0; + if (do_inode) { + if (fs->inode_map) + ext2fs_free_inode_bitmap(fs->inode_map); + strcpy(buf, "inode bitmap for "); + strcat(buf, fs->device_name); + retval = ext2fs_allocate_inode_bitmap(fs, buf, &fs->inode_map); + if (retval) + goto cleanup; + retval = ext2fs_get_mem(do_image ? fs->blocksize : + (unsigned) inode_nbytes, &inode_bitmap); + if (retval) + goto cleanup; + } else + inode_nbytes = 0; + ext2fs_free_mem(&buf); + + if (fs->flags & EXT2_FLAG_IMAGE_FILE) { + blk = (fs->image_header->offset_inodemap / fs->blocksize); + ino_cnt = fs->super->s_inodes_count; + while (inode_nbytes > 0) { + retval = io_channel_read_blk64(fs->image_io, blk++, + 1, inode_bitmap); + if (retval) + goto cleanup; + cnt = fs->blocksize << 3; + if (cnt > ino_cnt) + cnt = ino_cnt; + retval = ext2fs_set_inode_bitmap_range2(fs->inode_map, + ino_itr, cnt, inode_bitmap); + if (retval) + goto cleanup; + ino_itr += fs->blocksize << 3; + ino_cnt -= fs->blocksize << 3; + inode_nbytes -= fs->blocksize; + } + blk = (fs->image_header->offset_blockmap / + fs->blocksize); + blk_cnt = (blk64_t)EXT2_BLOCKS_PER_GROUP(fs->super) * + fs->group_desc_count; + while (block_nbytes > 0) { + retval = io_channel_read_blk64(fs->image_io, blk++, + 1, block_bitmap); + if (retval) + goto cleanup; + cnt = fs->blocksize << 3; + if (cnt > blk_cnt) + cnt = blk_cnt; + retval = ext2fs_set_block_bitmap_range2(fs->block_map, + blk_itr, cnt, block_bitmap); + if (retval) + goto cleanup; + blk_itr += fs->blocksize << 3; + blk_cnt -= fs->blocksize << 3; + block_nbytes -= fs->blocksize; + } + goto success_cleanup; + } + + for (i = 0; i < fs->group_desc_count; i++) { + if (block_bitmap) { + blk = ext2fs_block_bitmap_loc(fs, i); + if (csum_flag && + ext2fs_bg_flags_test(fs, i, EXT2_BG_BLOCK_UNINIT) && + ext2fs_group_desc_csum_verify(fs, i)) + blk = 0; + if (blk) { + retval = io_channel_read_blk64(fs->io, blk, + -block_nbytes, block_bitmap); + if (retval) { + retval = EXT2_ET_BLOCK_BITMAP_READ; + goto cleanup; + } + } else + memset(block_bitmap, 0, block_nbytes); + cnt = block_nbytes << 3; + retval = ext2fs_set_block_bitmap_range2(fs->block_map, + blk_itr, cnt, block_bitmap); + if (retval) + goto cleanup; + blk_itr += block_nbytes << 3; + } + if (inode_bitmap) { + blk = ext2fs_inode_bitmap_loc(fs, i); + if (csum_flag && + ext2fs_bg_flags_test(fs, i, EXT2_BG_INODE_UNINIT) && + ext2fs_group_desc_csum_verify(fs, i)) + blk = 0; + if (blk) { + retval = io_channel_read_blk64(fs->io, blk, + -inode_nbytes, inode_bitmap); + if (retval) { + retval = EXT2_ET_INODE_BITMAP_READ; + goto cleanup; + } + } else + memset(inode_bitmap, 0, inode_nbytes); + cnt = inode_nbytes << 3; + retval = ext2fs_set_inode_bitmap_range2(fs->inode_map, + ino_itr, cnt, inode_bitmap); + if (retval) + goto cleanup; + ino_itr += inode_nbytes << 3; + } + } +success_cleanup: + if (inode_bitmap) + ext2fs_free_mem(&inode_bitmap); + if (block_bitmap) + ext2fs_free_mem(&block_bitmap); + return 0; + +cleanup: + if (do_block) { + ext2fs_free_mem(&fs->block_map); + fs->block_map = 0; + } + if (do_inode) { + ext2fs_free_mem(&fs->inode_map); + fs->inode_map = 0; + } + if (inode_bitmap) + ext2fs_free_mem(&inode_bitmap); + if (block_bitmap) + ext2fs_free_mem(&block_bitmap); + if (buf) + ext2fs_free_mem(&buf); + return retval; +} + +errcode_t ext2fs_read_inode_bitmap(ext2_filsys fs) +{ + return read_bitmaps(fs, 1, 0); +} + +errcode_t ext2fs_read_block_bitmap(ext2_filsys fs) +{ + return read_bitmaps(fs, 0, 1); +} + +errcode_t ext2fs_write_inode_bitmap(ext2_filsys fs) +{ + return write_bitmaps(fs, 1, 0); +} + +errcode_t ext2fs_write_block_bitmap (ext2_filsys fs) +{ + return write_bitmaps(fs, 0, 1); +} + +errcode_t ext2fs_read_bitmaps(ext2_filsys fs) +{ + if (fs->inode_map && fs->block_map) + return 0; + + return read_bitmaps(fs, !fs->inode_map, !fs->block_map); +} + +errcode_t ext2fs_write_bitmaps(ext2_filsys fs) +{ + int do_inode = fs->inode_map && ext2fs_test_ib_dirty(fs); + int do_block = fs->block_map && ext2fs_test_bb_dirty(fs); + + if (!do_inode && !do_block) + return 0; + + return write_bitmaps(fs, do_inode, do_block); +} diff --git a/portlibs/sources/libext2fs/source/sparse.c b/portlibs/sources/libext2fs/source/sparse.c new file mode 100644 index 00000000..15ded0ae --- /dev/null +++ b/portlibs/sources/libext2fs/source/sparse.c @@ -0,0 +1,52 @@ +/* + * sparse.c --- find the groups in an ext2 filesystem with metadata backups + * + * Copyright (C) 1993, 1994, 1995, 1996 Theodore Ts'o. + * Copyright (C) 2002 Andreas Dilger. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> + +#include "ext2_fs.h" +#include "ext2fsP.h" + +/* + * Iterate through the groups which hold BACKUP superblock/GDT copies in an + * ext3 filesystem. The counters should be initialized to 1, 5, and 7 before + * calling this for the first time. In a sparse filesystem it will be the + * sequence of powers of 3, 5, and 7: 1, 3, 5, 7, 9, 25, 27, 49, 81, ... + * For a non-sparse filesystem it will be every group: 1, 2, 3, 4, ... + */ +unsigned int ext2fs_list_backups(ext2_filsys fs, unsigned int *three, + unsigned int *five, unsigned int *seven) +{ + unsigned int *min = three; + int mult = 3; + unsigned int ret; + + if (!(fs->super->s_feature_ro_compat & + EXT2_FEATURE_RO_COMPAT_SPARSE_SUPER)) { + ret = *min; + *min += 1; + return ret; + } + + if (*five < *min) { + min = five; + mult = 5; + } + if (*seven < *min) { + min = seven; + mult = 7; + } + + ret = *min; + *min *= mult; + + return ret; +} diff --git a/portlibs/sources/libext2fs/source/swapfs.c b/portlibs/sources/libext2fs/source/swapfs.c new file mode 100644 index 00000000..b856a097 --- /dev/null +++ b/portlibs/sources/libext2fs/source/swapfs.c @@ -0,0 +1,315 @@ +/* + * swapfs.c --- swap ext2 filesystem data structures + * + * Copyright (C) 1995, 1996, 2002 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <string.h> +#include <time.h> + +#include "ext2_fs.h" +#include "ext2fs.h" +#include "ext2_ext_attr.h" + +#ifdef WORDS_BIGENDIAN +void ext2fs_swap_super(struct ext2_super_block * sb) +{ + int i; + sb->s_inodes_count = ext2fs_swab32(sb->s_inodes_count); + sb->s_blocks_count = ext2fs_swab32(sb->s_blocks_count); + sb->s_r_blocks_count = ext2fs_swab32(sb->s_r_blocks_count); + sb->s_free_blocks_count = ext2fs_swab32(sb->s_free_blocks_count); + sb->s_free_inodes_count = ext2fs_swab32(sb->s_free_inodes_count); + sb->s_first_data_block = ext2fs_swab32(sb->s_first_data_block); + sb->s_log_block_size = ext2fs_swab32(sb->s_log_block_size); + sb->s_log_cluster_size = ext2fs_swab32(sb->s_log_cluster_size); + sb->s_blocks_per_group = ext2fs_swab32(sb->s_blocks_per_group); + sb->s_clusters_per_group = ext2fs_swab32(sb->s_clusters_per_group); + sb->s_inodes_per_group = ext2fs_swab32(sb->s_inodes_per_group); + sb->s_mtime = ext2fs_swab32(sb->s_mtime); + sb->s_wtime = ext2fs_swab32(sb->s_wtime); + sb->s_mnt_count = ext2fs_swab16(sb->s_mnt_count); + sb->s_max_mnt_count = ext2fs_swab16(sb->s_max_mnt_count); + sb->s_magic = ext2fs_swab16(sb->s_magic); + sb->s_state = ext2fs_swab16(sb->s_state); + sb->s_errors = ext2fs_swab16(sb->s_errors); + sb->s_minor_rev_level = ext2fs_swab16(sb->s_minor_rev_level); + sb->s_lastcheck = ext2fs_swab32(sb->s_lastcheck); + sb->s_checkinterval = ext2fs_swab32(sb->s_checkinterval); + sb->s_creator_os = ext2fs_swab32(sb->s_creator_os); + sb->s_rev_level = ext2fs_swab32(sb->s_rev_level); + sb->s_def_resuid = ext2fs_swab16(sb->s_def_resuid); + sb->s_def_resgid = ext2fs_swab16(sb->s_def_resgid); + sb->s_first_ino = ext2fs_swab32(sb->s_first_ino); + sb->s_inode_size = ext2fs_swab16(sb->s_inode_size); + sb->s_block_group_nr = ext2fs_swab16(sb->s_block_group_nr); + sb->s_feature_compat = ext2fs_swab32(sb->s_feature_compat); + sb->s_feature_incompat = ext2fs_swab32(sb->s_feature_incompat); + sb->s_feature_ro_compat = ext2fs_swab32(sb->s_feature_ro_compat); + sb->s_algorithm_usage_bitmap = ext2fs_swab32(sb->s_algorithm_usage_bitmap); + sb->s_reserved_gdt_blocks = ext2fs_swab16(sb->s_reserved_gdt_blocks); + sb->s_journal_inum = ext2fs_swab32(sb->s_journal_inum); + sb->s_journal_dev = ext2fs_swab32(sb->s_journal_dev); + sb->s_last_orphan = ext2fs_swab32(sb->s_last_orphan); + sb->s_desc_size = ext2fs_swab16(sb->s_desc_size); + sb->s_default_mount_opts = ext2fs_swab32(sb->s_default_mount_opts); + sb->s_first_meta_bg = ext2fs_swab32(sb->s_first_meta_bg); + sb->s_mkfs_time = ext2fs_swab32(sb->s_mkfs_time); + sb->s_blocks_count_hi = ext2fs_swab32(sb->s_blocks_count_hi); + sb->s_r_blocks_count_hi = ext2fs_swab32(sb->s_r_blocks_count_hi); + sb->s_free_blocks_hi = ext2fs_swab32(sb->s_free_blocks_hi); + sb->s_min_extra_isize = ext2fs_swab16(sb->s_min_extra_isize); + sb->s_want_extra_isize = ext2fs_swab16(sb->s_want_extra_isize); + sb->s_flags = ext2fs_swab32(sb->s_flags); + sb->s_kbytes_written = ext2fs_swab64(sb->s_kbytes_written); + sb->s_snapshot_inum = ext2fs_swab32(sb->s_snapshot_inum); + sb->s_snapshot_id = ext2fs_swab32(sb->s_snapshot_id); + sb->s_snapshot_r_blocks_count = + ext2fs_swab64(sb->s_snapshot_r_blocks_count); + sb->s_snapshot_list = ext2fs_swab32(sb->s_snapshot_list); + sb->s_usr_quota_inum = ext2fs_swab32(sb->s_usr_quota_inum); + sb->s_grp_quota_inum = ext2fs_swab32(sb->s_grp_quota_inum); + + for (i=0; i < 4; i++) + sb->s_hash_seed[i] = ext2fs_swab32(sb->s_hash_seed[i]); + + /* if journal backup is for a valid extent-based journal... */ + if (!ext2fs_extent_header_verify(sb->s_jnl_blocks, + sizeof(sb->s_jnl_blocks))) { + /* ... swap only the journal i_size */ + sb->s_jnl_blocks[16] = ext2fs_swab32(sb->s_jnl_blocks[16]); + /* and the extent data is not swapped on read */ + return; + } + + /* direct/indirect journal: swap it all */ + for (i=0; i < 17; i++) + sb->s_jnl_blocks[i] = ext2fs_swab32(sb->s_jnl_blocks[i]); +} + +void ext2fs_swap_group_desc2(ext2_filsys fs, struct ext2_group_desc *gdp) +{ + /* Do the 32-bit parts first */ + gdp->bg_block_bitmap = ext2fs_swab32(gdp->bg_block_bitmap); + gdp->bg_inode_bitmap = ext2fs_swab32(gdp->bg_inode_bitmap); + gdp->bg_inode_table = ext2fs_swab32(gdp->bg_inode_table); + gdp->bg_free_blocks_count = ext2fs_swab16(gdp->bg_free_blocks_count); + gdp->bg_free_inodes_count = ext2fs_swab16(gdp->bg_free_inodes_count); + gdp->bg_used_dirs_count = ext2fs_swab16(gdp->bg_used_dirs_count); + gdp->bg_flags = ext2fs_swab16(gdp->bg_flags); + gdp->bg_itable_unused = ext2fs_swab16(gdp->bg_itable_unused); + gdp->bg_checksum = ext2fs_swab16(gdp->bg_checksum); + /* If we're 32-bit, we're done */ + if (fs && (!fs->super->s_desc_size || + (fs->super->s_desc_size < EXT2_MIN_DESC_SIZE_64BIT))) + return; + + /* Swap the 64-bit parts */ + struct ext4_group_desc *gdp4 = (struct ext4_group_desc *) gdp; + gdp4->bg_block_bitmap_hi = ext2fs_swab32(gdp4->bg_block_bitmap_hi); + gdp4->bg_inode_bitmap_hi = ext2fs_swab32(gdp4->bg_inode_bitmap_hi); + gdp4->bg_inode_table_hi = ext2fs_swab32(gdp4->bg_inode_table_hi); + gdp4->bg_free_blocks_count_hi = + ext2fs_swab16(gdp4->bg_free_blocks_count_hi); + gdp4->bg_free_inodes_count_hi = + ext2fs_swab16(gdp4->bg_free_inodes_count_hi); + gdp4->bg_used_dirs_count_hi = + ext2fs_swab16(gdp4->bg_used_dirs_count_hi); + gdp4->bg_itable_unused_hi = ext2fs_swab16(gdp4->bg_itable_unused_hi); +} + +void ext2fs_swap_group_desc(struct ext2_group_desc *gdp) +{ + return ext2fs_swap_group_desc2(0, gdp); +} + + +void ext2fs_swap_ext_attr_header(struct ext2_ext_attr_header *to_header, + struct ext2_ext_attr_header *from_header) +{ + int n; + + to_header->h_magic = ext2fs_swab32(from_header->h_magic); + to_header->h_blocks = ext2fs_swab32(from_header->h_blocks); + to_header->h_refcount = ext2fs_swab32(from_header->h_refcount); + to_header->h_hash = ext2fs_swab32(from_header->h_hash); + for (n = 0; n < 4; n++) + to_header->h_reserved[n] = + ext2fs_swab32(from_header->h_reserved[n]); +} + +void ext2fs_swap_ext_attr_entry(struct ext2_ext_attr_entry *to_entry, + struct ext2_ext_attr_entry *from_entry) +{ + to_entry->e_value_offs = ext2fs_swab16(from_entry->e_value_offs); + to_entry->e_value_block = ext2fs_swab32(from_entry->e_value_block); + to_entry->e_value_size = ext2fs_swab32(from_entry->e_value_size); + to_entry->e_hash = ext2fs_swab32(from_entry->e_hash); +} + +void ext2fs_swap_ext_attr(char *to, char *from, int bufsize, int has_header) +{ + struct ext2_ext_attr_header *from_header = + (struct ext2_ext_attr_header *)from; + struct ext2_ext_attr_header *to_header = + (struct ext2_ext_attr_header *)to; + struct ext2_ext_attr_entry *from_entry, *to_entry; + char *from_end = (char *)from_header + bufsize; + + if (to_header != from_header) + memcpy(to_header, from_header, bufsize); + + if (has_header) { + ext2fs_swap_ext_attr_header(to_header, from_header); + + from_entry = (struct ext2_ext_attr_entry *)(from_header+1); + to_entry = (struct ext2_ext_attr_entry *)(to_header+1); + } else { + from_entry = (struct ext2_ext_attr_entry *)from_header; + to_entry = (struct ext2_ext_attr_entry *)to_header; + } + + while ((char *)from_entry < from_end && *(__u32 *)from_entry) { + ext2fs_swap_ext_attr_entry(to_entry, from_entry); + from_entry = EXT2_EXT_ATTR_NEXT(from_entry); + to_entry = EXT2_EXT_ATTR_NEXT(to_entry); + } +} + +void ext2fs_swap_inode_full(ext2_filsys fs, struct ext2_inode_large *t, + struct ext2_inode_large *f, int hostorder, + int bufsize) +{ + unsigned i, has_data_blocks = 0, extra_isize = 0, attr_magic = 0; + int has_extents = 0; + int islnk = 0; + __u32 *eaf, *eat; + + if (hostorder && LINUX_S_ISLNK(f->i_mode)) + islnk = 1; + t->i_mode = ext2fs_swab16(f->i_mode); + if (!hostorder && LINUX_S_ISLNK(t->i_mode)) + islnk = 1; + t->i_uid = ext2fs_swab16(f->i_uid); + t->i_size = ext2fs_swab32(f->i_size); + t->i_atime = ext2fs_swab32(f->i_atime); + t->i_ctime = ext2fs_swab32(f->i_ctime); + t->i_mtime = ext2fs_swab32(f->i_mtime); + t->i_dtime = ext2fs_swab32(f->i_dtime); + t->i_gid = ext2fs_swab16(f->i_gid); + t->i_links_count = ext2fs_swab16(f->i_links_count); + t->i_file_acl = ext2fs_swab32(f->i_file_acl); + if (hostorder) + has_data_blocks = ext2fs_inode_data_blocks(fs, + (struct ext2_inode *) f); + t->i_blocks = ext2fs_swab32(f->i_blocks); + if (!hostorder) + has_data_blocks = ext2fs_inode_data_blocks(fs, + (struct ext2_inode *) t); + if (hostorder && (f->i_flags & EXT4_EXTENTS_FL)) + has_extents = 1; + t->i_flags = ext2fs_swab32(f->i_flags); + if (!hostorder && (t->i_flags & EXT4_EXTENTS_FL)) + has_extents = 1; + t->i_dir_acl = ext2fs_swab32(f->i_dir_acl); + /* extent data are swapped on access, not here */ + if (!has_extents && (!islnk || has_data_blocks)) { + for (i = 0; i < EXT2_N_BLOCKS; i++) + t->i_block[i] = ext2fs_swab32(f->i_block[i]); + } else if (t != f) { + for (i = 0; i < EXT2_N_BLOCKS; i++) + t->i_block[i] = f->i_block[i]; + } + t->i_generation = ext2fs_swab32(f->i_generation); + t->i_faddr = ext2fs_swab32(f->i_faddr); + + switch (fs->super->s_creator_os) { + case EXT2_OS_LINUX: + t->osd1.linux1.l_i_version = + ext2fs_swab32(f->osd1.linux1.l_i_version); + t->osd2.linux2.l_i_blocks_hi = + ext2fs_swab16(f->osd2.linux2.l_i_blocks_hi); + t->osd2.linux2.l_i_file_acl_high = + ext2fs_swab16(f->osd2.linux2.l_i_file_acl_high); + t->osd2.linux2.l_i_uid_high = + ext2fs_swab16 (f->osd2.linux2.l_i_uid_high); + t->osd2.linux2.l_i_gid_high = + ext2fs_swab16 (f->osd2.linux2.l_i_gid_high); + t->osd2.linux2.l_i_reserved2 = + ext2fs_swab32(f->osd2.linux2.l_i_reserved2); + break; + case EXT2_OS_HURD: + t->osd1.hurd1.h_i_translator = + ext2fs_swab32 (f->osd1.hurd1.h_i_translator); + t->osd2.hurd2.h_i_frag = f->osd2.hurd2.h_i_frag; + t->osd2.hurd2.h_i_fsize = f->osd2.hurd2.h_i_fsize; + t->osd2.hurd2.h_i_mode_high = + ext2fs_swab16 (f->osd2.hurd2.h_i_mode_high); + t->osd2.hurd2.h_i_uid_high = + ext2fs_swab16 (f->osd2.hurd2.h_i_uid_high); + t->osd2.hurd2.h_i_gid_high = + ext2fs_swab16 (f->osd2.hurd2.h_i_gid_high); + t->osd2.hurd2.h_i_author = + ext2fs_swab32 (f->osd2.hurd2.h_i_author); + break; + default: + break; + } + + if (bufsize < (int) (sizeof(struct ext2_inode) + sizeof(__u16))) + return; /* no i_extra_isize field */ + + if (hostorder) + extra_isize = f->i_extra_isize; + t->i_extra_isize = ext2fs_swab16(f->i_extra_isize); + if (!hostorder) + extra_isize = t->i_extra_isize; + if (extra_isize > EXT2_INODE_SIZE(fs->super) - + sizeof(struct ext2_inode)) { + /* this is error case: i_extra_size is too large */ + return; + } + + i = sizeof(struct ext2_inode) + extra_isize + sizeof(__u32); + if (bufsize < (int) i) + return; /* no space for EA magic */ + + eaf = (__u32 *) (((char *) f) + sizeof(struct ext2_inode) + + extra_isize); + + attr_magic = *eaf; + if (!hostorder) + attr_magic = ext2fs_swab32(attr_magic); + + if (attr_magic != EXT2_EXT_ATTR_MAGIC) + return; /* it seems no magic here */ + + eat = (__u32 *) (((char *) t) + sizeof(struct ext2_inode) + + extra_isize); + *eat = ext2fs_swab32(*eaf); + + /* convert EA(s) */ + ext2fs_swap_ext_attr((char *) (eat + 1), (char *) (eaf + 1), + bufsize - sizeof(struct ext2_inode) - + extra_isize - sizeof(__u32), 0); + +} + +void ext2fs_swap_inode(ext2_filsys fs, struct ext2_inode *t, + struct ext2_inode *f, int hostorder) +{ + ext2fs_swap_inode_full(fs, (struct ext2_inode_large *) t, + (struct ext2_inode_large *) f, hostorder, + sizeof(struct ext2_inode)); +} + +#endif diff --git a/portlibs/sources/libext2fs/source/tdb.c b/portlibs/sources/libext2fs/source/tdb.c new file mode 100644 index 00000000..0550f468 --- /dev/null +++ b/portlibs/sources/libext2fs/source/tdb.c @@ -0,0 +1,4145 @@ +/* +URL: svn://svnanon.samba.org/samba/branches/SAMBA_4_0/source/lib/tdb/common +Rev: 23590 +Last Changed Date: 2007-06-22 13:36:10 -0400 (Fri, 22 Jun 2007) +*/ + /* + trivial database library - standalone version + + Copyright (C) Andrew Tridgell 1999-2005 + Copyright (C) Jeremy Allison 2000-2006 + Copyright (C) Paul `Rusty' Russell 2000 + + ** NOTE! The following LGPL license applies to the tdb + ** library. This does NOT imply that all of Samba is released + ** under the LGPL + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library 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 + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA +*/ + +#ifdef CONFIG_STAND_ALONE +#define HAVE_MMAP +#define HAVE_STRDUP +#define HAVE_SYS_MMAN_H +#define HAVE_UTIME_H +#define HAVE_UTIME +#endif +#define _XOPEN_SOURCE 600 + +#include <unistd.h> +#include <stdio.h> +#include <stdlib.h> +#include <stdarg.h> +#include <stddef.h> +#include <errno.h> +#include <string.h> +#ifdef HAVE_SYS_SELECT_H +#include <sys/select.h> +#endif +#include <sys/time.h> +#include <sys/types.h> +#include <time.h> +#ifdef HAVE_UTIME_H +#include <utime.h> +#endif +#include <sys/stat.h> +#include <sys/file.h> +#include <fcntl.h> + +#ifdef HAVE_SYS_MMAN_H +#include <sys/mman.h> +#endif + +#ifndef MAP_FILE +#define MAP_FILE 0 +#endif + +#ifndef MAP_FAILED +#define MAP_FAILED ((void *)-1) +#endif + +#ifndef HAVE_STRDUP +#define strdup rep_strdup +static char *rep_strdup(const char *s) +{ + char *ret; + int length; + if (!s) + return NULL; + + if (!length) + length = strlen(s); + + ret = malloc(length + 1); + if (ret) { + strncpy(ret, s, length); + ret[length] = '\0'; + } + return ret; +} +#endif + +#ifndef PRINTF_ATTRIBUTE +#if (__GNUC__ >= 3) && (__GNUC_MINOR__ >= 1 ) +/** Use gcc attribute to check printf fns. a1 is the 1-based index of + * the parameter containing the format, and a2 the index of the first + * argument. Note that some gcc 2.x versions don't handle this + * properly **/ +#define PRINTF_ATTRIBUTE(a1, a2) __attribute__ ((format (__printf__, a1, a2))) +#else +#define PRINTF_ATTRIBUTE(a1, a2) +#endif +#endif + +typedef int bool; + +#include "tdb.h" + +#ifndef u32 +#define u32 unsigned +#endif + +#ifndef HAVE_GETPAGESIZE +#define getpagesize() 0x2000 +#endif + +typedef u32 tdb_len_t; +typedef u32 tdb_off_t; + +#ifndef offsetof +#define offsetof(t,f) ((unsigned int)&((t *)0)->f) +#endif + +#define TDB_MAGIC_FOOD "TDB file\n" +#define TDB_VERSION (0x26011967 + 6) +#define TDB_MAGIC (0x26011999U) +#define TDB_FREE_MAGIC (~TDB_MAGIC) +#define TDB_DEAD_MAGIC (0xFEE1DEAD) +#define TDB_RECOVERY_MAGIC (0xf53bc0e7U) +#define TDB_ALIGNMENT 4 +#define MIN_REC_SIZE (2*sizeof(struct list_struct) + TDB_ALIGNMENT) +#define DEFAULT_HASH_SIZE 131 +#define FREELIST_TOP (sizeof(struct tdb_header)) +#define TDB_ALIGN(x,a) (((x) + (a)-1) & ~((a)-1)) +#define TDB_BYTEREV(x) (((((x)&0xff)<<24)|((x)&0xFF00)<<8)|(((x)>>8)&0xFF00)|((x)>>24)) +#define TDB_DEAD(r) ((r)->magic == TDB_DEAD_MAGIC) +#define TDB_BAD_MAGIC(r) ((r)->magic != TDB_MAGIC && !TDB_DEAD(r)) +#define TDB_HASH_TOP(hash) (FREELIST_TOP + (BUCKET(hash)+1)*sizeof(tdb_off_t)) +#define TDB_HASHTABLE_SIZE(tdb) ((tdb->header.hash_size+1)*sizeof(tdb_off_t)) +#define TDB_DATA_START(hash_size) TDB_HASH_TOP(hash_size-1) +#define TDB_RECOVERY_HEAD offsetof(struct tdb_header, recovery_start) +#define TDB_SEQNUM_OFS offsetof(struct tdb_header, sequence_number) +#define TDB_PAD_BYTE 0x42 +#define TDB_PAD_U32 0x42424242 + +/* NB assumes there is a local variable called "tdb" that is the + * current context, also takes doubly-parenthesized print-style + * argument. */ +#define TDB_LOG(x) tdb->log.log_fn x + +/* lock offsets */ +#define GLOBAL_LOCK 0 +#define ACTIVE_LOCK 4 +#define TRANSACTION_LOCK 8 + +/* free memory if the pointer is valid and zero the pointer */ +#ifndef SAFE_FREE +#define SAFE_FREE(x) do { if ((x) != NULL) {free(x); (x)=NULL;} } while(0) +#endif + +#define BUCKET(hash) ((hash) % tdb->header.hash_size) + +#define DOCONV() (tdb->flags & TDB_CONVERT) +#define CONVERT(x) (DOCONV() ? tdb_convert(&x, sizeof(x)) : &x) + + +/* the body of the database is made of one list_struct for the free space + plus a separate data list for each hash value */ +struct list_struct { + tdb_off_t next; /* offset of the next record in the list */ + tdb_len_t rec_len; /* total byte length of record */ + tdb_len_t key_len; /* byte length of key */ + tdb_len_t data_len; /* byte length of data */ + u32 full_hash; /* the full 32 bit hash of the key */ + u32 magic; /* try to catch errors */ + /* the following union is implied: + union { + char record[rec_len]; + struct { + char key[key_len]; + char data[data_len]; + } + u32 totalsize; (tailer) + } + */ +}; + + +/* this is stored at the front of every database */ +struct tdb_header { + char magic_food[32]; /* for /etc/magic */ + u32 version; /* version of the code */ + u32 hash_size; /* number of hash entries */ + tdb_off_t rwlocks; /* obsolete - kept to detect old formats */ + tdb_off_t recovery_start; /* offset of transaction recovery region */ + tdb_off_t sequence_number; /* used when TDB_SEQNUM is set */ + tdb_off_t reserved[29]; +}; + +struct tdb_lock_type { + int list; + u32 count; + u32 ltype; +}; + +struct tdb_traverse_lock { + struct tdb_traverse_lock *next; + u32 off; + u32 hash; + int lock_rw; +}; + + +struct tdb_methods { + int (*tdb_read)(struct tdb_context *, tdb_off_t , void *, tdb_len_t , int ); + int (*tdb_write)(struct tdb_context *, tdb_off_t, const void *, tdb_len_t); + void (*next_hash_chain)(struct tdb_context *, u32 *); + int (*tdb_oob)(struct tdb_context *, tdb_off_t , int ); + int (*tdb_expand_file)(struct tdb_context *, tdb_off_t , tdb_off_t ); + int (*tdb_brlock)(struct tdb_context *, tdb_off_t , int, int, int, size_t); +}; + +struct tdb_context { + char *name; /* the name of the database */ + void *map_ptr; /* where it is currently mapped */ + int fd; /* open file descriptor for the database */ + tdb_len_t map_size; /* how much space has been mapped */ + int read_only; /* opened read-only */ + int traverse_read; /* read-only traversal */ + struct tdb_lock_type global_lock; + int num_lockrecs; + struct tdb_lock_type *lockrecs; /* only real locks, all with count>0 */ + enum TDB_ERROR ecode; /* error code for last tdb error */ + struct tdb_header header; /* a cached copy of the header */ + u32 flags; /* the flags passed to tdb_open */ + struct tdb_traverse_lock travlocks; /* current traversal locks */ + struct tdb_context *next; /* all tdbs to avoid multiple opens */ + dev_t device; /* uniquely identifies this tdb */ + ino_t inode; /* uniquely identifies this tdb */ + struct tdb_logging_context log; + unsigned int (*hash_fn)(TDB_DATA *key); + int open_flags; /* flags used in the open - needed by reopen */ + unsigned int num_locks; /* number of chain locks held */ + const struct tdb_methods *methods; + struct tdb_transaction *transaction; + int page_size; + int max_dead_records; + bool have_transaction_lock; +}; + + +/* + internal prototypes +*/ +static int tdb_munmap(struct tdb_context *tdb); +static void tdb_mmap(struct tdb_context *tdb); +static int tdb_lock(struct tdb_context *tdb, int list, int ltype); +static int tdb_unlock(struct tdb_context *tdb, int list, int ltype); +static int tdb_brlock(struct tdb_context *tdb, tdb_off_t offset, int rw_type, int lck_type, int probe, size_t len); +static int tdb_transaction_lock(struct tdb_context *tdb, int ltype); +static int tdb_transaction_unlock(struct tdb_context *tdb); +static int tdb_brlock_upgrade(struct tdb_context *tdb, tdb_off_t offset, size_t len); +static int tdb_write_lock_record(struct tdb_context *tdb, tdb_off_t off); +static int tdb_write_unlock_record(struct tdb_context *tdb, tdb_off_t off); +static int tdb_ofs_read(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d); +static int tdb_ofs_write(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d); +static void *tdb_convert(void *buf, u32 size); +static int tdb_free(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec); +static tdb_off_t tdb_allocate(struct tdb_context *tdb, tdb_len_t length, struct list_struct *rec); +static int tdb_ofs_read(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d); +static int tdb_ofs_write(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d); +static int tdb_lock_record(struct tdb_context *tdb, tdb_off_t off); +static int tdb_unlock_record(struct tdb_context *tdb, tdb_off_t off); +static int tdb_rec_read(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec); +static int tdb_rec_write(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec); +static int tdb_do_delete(struct tdb_context *tdb, tdb_off_t rec_ptr, struct list_struct *rec); +static unsigned char *tdb_alloc_read(struct tdb_context *tdb, tdb_off_t offset, tdb_len_t len); +static int tdb_parse_data(struct tdb_context *tdb, TDB_DATA key, + tdb_off_t offset, tdb_len_t len, + int (*parser)(TDB_DATA key, TDB_DATA data, + void *private_data), + void *private_data); +static tdb_off_t tdb_find_lock_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash, int locktype, + struct list_struct *rec); +static void tdb_io_init(struct tdb_context *tdb); +static int tdb_expand(struct tdb_context *tdb, tdb_off_t size); +static int tdb_rec_free_read(struct tdb_context *tdb, tdb_off_t off, + struct list_struct *rec); + + +/* file: error.c */ + +enum TDB_ERROR tdb_error(struct tdb_context *tdb) +{ + return tdb->ecode; +} + +static struct tdb_errname { + enum TDB_ERROR ecode; const char *estring; +} emap[] = { {TDB_SUCCESS, "Success"}, + {TDB_ERR_CORRUPT, "Corrupt database"}, + {TDB_ERR_IO, "IO Error"}, + {TDB_ERR_LOCK, "Locking error"}, + {TDB_ERR_OOM, "Out of memory"}, + {TDB_ERR_EXISTS, "Record exists"}, + {TDB_ERR_NOLOCK, "Lock exists on other keys"}, + {TDB_ERR_EINVAL, "Invalid parameter"}, + {TDB_ERR_NOEXIST, "Record does not exist"}, + {TDB_ERR_RDONLY, "write not permitted"} }; + +/* Error string for the last tdb error */ +const char *tdb_errorstr(struct tdb_context *tdb) +{ + u32 i; + for (i = 0; i < sizeof(emap) / sizeof(struct tdb_errname); i++) + if (tdb->ecode == emap[i].ecode) + return emap[i].estring; + return "Invalid error code"; +} + +/* file: lock.c */ + +#define TDB_MARK_LOCK 0x80000000 + +/* a byte range locking function - return 0 on success + this functions locks/unlocks 1 byte at the specified offset. + + On error, errno is also set so that errors are passed back properly + through tdb_open(). + + note that a len of zero means lock to end of file +*/ +int tdb_brlock(struct tdb_context *tdb, tdb_off_t offset, + int rw_type, int lck_type, int probe, size_t len) +{ + struct flock fl; + int ret; + + if (tdb->flags & TDB_NOLOCK) { + return 0; + } + + if ((rw_type == F_WRLCK) && (tdb->read_only || tdb->traverse_read)) { + tdb->ecode = TDB_ERR_RDONLY; + return -1; + } + + fl.l_type = rw_type; + fl.l_whence = SEEK_SET; + fl.l_start = offset; + fl.l_len = len; + fl.l_pid = 0; + + do { + ret = fcntl(tdb->fd,lck_type,&fl); + } while (ret == -1 && errno == EINTR); + + if (ret == -1) { + /* Generic lock error. errno set by fcntl. + * EAGAIN is an expected return from non-blocking + * locks. */ + if (!probe && lck_type != F_SETLK) { + /* Ensure error code is set for log fun to examine. */ + tdb->ecode = TDB_ERR_LOCK; + TDB_LOG((tdb, TDB_DEBUG_TRACE,"tdb_brlock failed (fd=%d) at offset %d rw_type=%d lck_type=%d len=%d\n", + tdb->fd, offset, rw_type, lck_type, (int)len)); + } + return TDB_ERRCODE(TDB_ERR_LOCK, -1); + } + return 0; +} + + +/* + upgrade a read lock to a write lock. This needs to be handled in a + special way as some OSes (such as solaris) have too conservative + deadlock detection and claim a deadlock when progress can be + made. For those OSes we may loop for a while. +*/ +int tdb_brlock_upgrade(struct tdb_context *tdb, tdb_off_t offset, size_t len) +{ + int count = 1000; + while (count--) { + struct timeval tv; + if (tdb_brlock(tdb, offset, F_WRLCK, F_SETLKW, 1, len) == 0) { + return 0; + } + if (errno != EDEADLK) { + break; + } + /* sleep for as short a time as we can - more portable than usleep() */ + tv.tv_sec = 0; + tv.tv_usec = 1; +#ifdef HAVE_SYS_SELECT_H + select(0, NULL, NULL, NULL, &tv); +#endif + } + TDB_LOG((tdb, TDB_DEBUG_TRACE,"tdb_brlock_upgrade failed at offset %d\n", offset)); + return -1; +} + + +/* lock a list in the database. list -1 is the alloc list */ +static int _tdb_lock(struct tdb_context *tdb, int list, int ltype, int op) +{ + struct tdb_lock_type *new_lck; + int i; + bool mark_lock = ((ltype & TDB_MARK_LOCK) == TDB_MARK_LOCK); + + ltype &= ~TDB_MARK_LOCK; + + /* a global lock allows us to avoid per chain locks */ + if (tdb->global_lock.count && + (ltype == tdb->global_lock.ltype || ltype == F_RDLCK)) { + return 0; + } + + if (tdb->global_lock.count) { + return TDB_ERRCODE(TDB_ERR_LOCK, -1); + } + + if (list < -1 || list >= (int)tdb->header.hash_size) { + TDB_LOG((tdb, TDB_DEBUG_ERROR,"tdb_lock: invalid list %d for ltype=%d\n", + list, ltype)); + return -1; + } + if (tdb->flags & TDB_NOLOCK) + return 0; + + for (i=0; i<tdb->num_lockrecs; i++) { + if (tdb->lockrecs[i].list == list) { + if (tdb->lockrecs[i].count == 0) { + /* + * Can't happen, see tdb_unlock(). It should + * be an assert. + */ + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_lock: " + "lck->count == 0 for list %d", list)); + } + /* + * Just increment the in-memory struct, posix locks + * don't stack. + */ + tdb->lockrecs[i].count++; + return 0; + } + } + + new_lck = (struct tdb_lock_type *)realloc( + tdb->lockrecs, + sizeof(*tdb->lockrecs) * (tdb->num_lockrecs+1)); + if (new_lck == NULL) { + errno = ENOMEM; + return -1; + } + tdb->lockrecs = new_lck; + + /* Since fcntl locks don't nest, we do a lock for the first one, + and simply bump the count for future ones */ + if (!mark_lock && + tdb->methods->tdb_brlock(tdb,FREELIST_TOP+4*list, ltype, op, + 0, 1)) { + return -1; + } + + tdb->num_locks++; + + tdb->lockrecs[tdb->num_lockrecs].list = list; + tdb->lockrecs[tdb->num_lockrecs].count = 1; + tdb->lockrecs[tdb->num_lockrecs].ltype = ltype; + tdb->num_lockrecs += 1; + + return 0; +} + +/* lock a list in the database. list -1 is the alloc list */ +int tdb_lock(struct tdb_context *tdb, int list, int ltype) +{ + int ret; + ret = _tdb_lock(tdb, list, ltype, F_SETLKW); + if (ret) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_lock failed on list %d " + "ltype=%d (%s)\n", list, ltype, strerror(errno))); + } + return ret; +} + +/* lock a list in the database. list -1 is the alloc list. non-blocking lock */ +int tdb_lock_nonblock(struct tdb_context *tdb, int list, int ltype) +{ + return _tdb_lock(tdb, list, ltype, F_SETLK); +} + + +/* unlock the database: returns void because it's too late for errors. */ + /* changed to return int it may be interesting to know there + has been an error --simo */ +int tdb_unlock(struct tdb_context *tdb, int list, int ltype) +{ + int ret = -1; + int i; + struct tdb_lock_type *lck = NULL; + bool mark_lock = ((ltype & TDB_MARK_LOCK) == TDB_MARK_LOCK); + + ltype &= ~TDB_MARK_LOCK; + + /* a global lock allows us to avoid per chain locks */ + if (tdb->global_lock.count && + (ltype == tdb->global_lock.ltype || ltype == F_RDLCK)) { + return 0; + } + + if (tdb->global_lock.count) { + return TDB_ERRCODE(TDB_ERR_LOCK, -1); + } + + if (tdb->flags & TDB_NOLOCK) + return 0; + + /* Sanity checks */ + if (list < -1 || list >= (int)tdb->header.hash_size) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlock: list %d invalid (%d)\n", list, tdb->header.hash_size)); + return ret; + } + + for (i=0; i<tdb->num_lockrecs; i++) { + if (tdb->lockrecs[i].list == list) { + lck = &tdb->lockrecs[i]; + break; + } + } + + if ((lck == NULL) || (lck->count == 0)) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlock: count is 0\n")); + return -1; + } + + if (lck->count > 1) { + lck->count--; + return 0; + } + + /* + * This lock has count==1 left, so we need to unlock it in the + * kernel. We don't bother with decrementing the in-memory array + * element, we're about to overwrite it with the last array element + * anyway. + */ + + if (mark_lock) { + ret = 0; + } else { + ret = tdb->methods->tdb_brlock(tdb, FREELIST_TOP+4*list, F_UNLCK, + F_SETLKW, 0, 1); + } + tdb->num_locks--; + + /* + * Shrink the array by overwriting the element just unlocked with the + * last array element. + */ + + if (tdb->num_lockrecs > 1) { + *lck = tdb->lockrecs[tdb->num_lockrecs-1]; + } + tdb->num_lockrecs -= 1; + + /* + * We don't bother with realloc when the array shrinks, but if we have + * a completely idle tdb we should get rid of the locked array. + */ + + if (tdb->num_lockrecs == 0) { + SAFE_FREE(tdb->lockrecs); + } + + if (ret) + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlock: An error occurred unlocking!\n")); + return ret; +} + +/* + get the transaction lock + */ +int tdb_transaction_lock(struct tdb_context *tdb, int ltype) +{ + if (tdb->have_transaction_lock || tdb->global_lock.count) { + return 0; + } + if (tdb->methods->tdb_brlock(tdb, TRANSACTION_LOCK, ltype, + F_SETLKW, 0, 1) == -1) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_lock: failed to get transaction lock\n")); + tdb->ecode = TDB_ERR_LOCK; + return -1; + } + tdb->have_transaction_lock = 1; + return 0; +} + +/* + release the transaction lock + */ +int tdb_transaction_unlock(struct tdb_context *tdb) +{ + int ret; + if (!tdb->have_transaction_lock) { + return 0; + } + ret = tdb->methods->tdb_brlock(tdb, TRANSACTION_LOCK, F_UNLCK, F_SETLKW, 0, 1); + if (ret == 0) { + tdb->have_transaction_lock = 0; + } + return ret; +} + + + + +/* lock/unlock entire database */ +static int _tdb_lockall(struct tdb_context *tdb, int ltype, int op) +{ + bool mark_lock = ((ltype & TDB_MARK_LOCK) == TDB_MARK_LOCK); + + ltype &= ~TDB_MARK_LOCK; + + /* There are no locks on read-only dbs */ + if (tdb->read_only || tdb->traverse_read) + return TDB_ERRCODE(TDB_ERR_LOCK, -1); + + if (tdb->global_lock.count && tdb->global_lock.ltype == ltype) { + tdb->global_lock.count++; + return 0; + } + + if (tdb->global_lock.count) { + /* a global lock of a different type exists */ + return TDB_ERRCODE(TDB_ERR_LOCK, -1); + } + + if (tdb->num_locks != 0) { + /* can't combine global and chain locks */ + return TDB_ERRCODE(TDB_ERR_LOCK, -1); + } + + if (!mark_lock && + tdb->methods->tdb_brlock(tdb, FREELIST_TOP, ltype, op, + 0, 4*tdb->header.hash_size)) { + if (op == F_SETLKW) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_lockall failed (%s)\n", strerror(errno))); + } + return -1; + } + + tdb->global_lock.count = 1; + tdb->global_lock.ltype = ltype; + + return 0; +} + + + +/* unlock entire db */ +static int _tdb_unlockall(struct tdb_context *tdb, int ltype) +{ + bool mark_lock = ((ltype & TDB_MARK_LOCK) == TDB_MARK_LOCK); + + ltype &= ~TDB_MARK_LOCK; + + /* There are no locks on read-only dbs */ + if (tdb->read_only || tdb->traverse_read) { + return TDB_ERRCODE(TDB_ERR_LOCK, -1); + } + + if (tdb->global_lock.ltype != ltype || tdb->global_lock.count == 0) { + return TDB_ERRCODE(TDB_ERR_LOCK, -1); + } + + if (tdb->global_lock.count > 1) { + tdb->global_lock.count--; + return 0; + } + + if (!mark_lock && + tdb->methods->tdb_brlock(tdb, FREELIST_TOP, F_UNLCK, F_SETLKW, + 0, 4*tdb->header.hash_size)) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_unlockall failed (%s)\n", strerror(errno))); + return -1; + } + + tdb->global_lock.count = 0; + tdb->global_lock.ltype = 0; + + return 0; +} + +/* lock entire database with write lock */ +int tdb_lockall(struct tdb_context *tdb) +{ + return _tdb_lockall(tdb, F_WRLCK, F_SETLKW); +} + +/* lock entire database with write lock - mark only */ +int tdb_lockall_mark(struct tdb_context *tdb) +{ + return _tdb_lockall(tdb, F_WRLCK | TDB_MARK_LOCK, F_SETLKW); +} + +/* unlock entire database with write lock - unmark only */ +int tdb_lockall_unmark(struct tdb_context *tdb) +{ + return _tdb_unlockall(tdb, F_WRLCK | TDB_MARK_LOCK); +} + +/* lock entire database with write lock - nonblocking varient */ +int tdb_lockall_nonblock(struct tdb_context *tdb) +{ + return _tdb_lockall(tdb, F_WRLCK, F_SETLK); +} + +/* unlock entire database with write lock */ +int tdb_unlockall(struct tdb_context *tdb) +{ + return _tdb_unlockall(tdb, F_WRLCK); +} + +/* lock entire database with read lock */ +int tdb_lockall_read(struct tdb_context *tdb) +{ + return _tdb_lockall(tdb, F_RDLCK, F_SETLKW); +} + +/* lock entire database with read lock - nonblock varient */ +int tdb_lockall_read_nonblock(struct tdb_context *tdb) +{ + return _tdb_lockall(tdb, F_RDLCK, F_SETLK); +} + +/* unlock entire database with read lock */ +int tdb_unlockall_read(struct tdb_context *tdb) +{ + return _tdb_unlockall(tdb, F_RDLCK); +} + +/* lock/unlock one hash chain. This is meant to be used to reduce + contention - it cannot guarantee how many records will be locked */ +int tdb_chainlock(struct tdb_context *tdb, TDB_DATA key) +{ + return tdb_lock(tdb, BUCKET(tdb->hash_fn(&key)), F_WRLCK); +} + +/* lock/unlock one hash chain, non-blocking. This is meant to be used + to reduce contention - it cannot guarantee how many records will be + locked */ +int tdb_chainlock_nonblock(struct tdb_context *tdb, TDB_DATA key) +{ + return tdb_lock_nonblock(tdb, BUCKET(tdb->hash_fn(&key)), F_WRLCK); +} + +/* mark a chain as locked without actually locking it. Warning! use with great caution! */ +int tdb_chainlock_mark(struct tdb_context *tdb, TDB_DATA key) +{ + return tdb_lock(tdb, BUCKET(tdb->hash_fn(&key)), F_WRLCK | TDB_MARK_LOCK); +} + +/* unmark a chain as locked without actually locking it. Warning! use with great caution! */ +int tdb_chainlock_unmark(struct tdb_context *tdb, TDB_DATA key) +{ + return tdb_unlock(tdb, BUCKET(tdb->hash_fn(&key)), F_WRLCK | TDB_MARK_LOCK); +} + +int tdb_chainunlock(struct tdb_context *tdb, TDB_DATA key) +{ + return tdb_unlock(tdb, BUCKET(tdb->hash_fn(&key)), F_WRLCK); +} + +int tdb_chainlock_read(struct tdb_context *tdb, TDB_DATA key) +{ + return tdb_lock(tdb, BUCKET(tdb->hash_fn(&key)), F_RDLCK); +} + +int tdb_chainunlock_read(struct tdb_context *tdb, TDB_DATA key) +{ + return tdb_unlock(tdb, BUCKET(tdb->hash_fn(&key)), F_RDLCK); +} + + + +/* record lock stops delete underneath */ +int tdb_lock_record(struct tdb_context *tdb, tdb_off_t off) +{ + return off ? tdb->methods->tdb_brlock(tdb, off, F_RDLCK, F_SETLKW, 0, 1) : 0; +} + +/* + Write locks override our own fcntl readlocks, so check it here. + Note this is meant to be F_SETLK, *not* F_SETLKW, as it's not + an error to fail to get the lock here. +*/ +int tdb_write_lock_record(struct tdb_context *tdb, tdb_off_t off) +{ + struct tdb_traverse_lock *i; + for (i = &tdb->travlocks; i; i = i->next) + if (i->off == off) + return -1; + return tdb->methods->tdb_brlock(tdb, off, F_WRLCK, F_SETLK, 1, 1); +} + +/* + Note this is meant to be F_SETLK, *not* F_SETLKW, as it's not + an error to fail to get the lock here. +*/ +int tdb_write_unlock_record(struct tdb_context *tdb, tdb_off_t off) +{ + return tdb->methods->tdb_brlock(tdb, off, F_UNLCK, F_SETLK, 0, 1); +} + +/* fcntl locks don't stack: avoid unlocking someone else's */ +int tdb_unlock_record(struct tdb_context *tdb, tdb_off_t off) +{ + struct tdb_traverse_lock *i; + u32 count = 0; + + if (off == 0) + return 0; + for (i = &tdb->travlocks; i; i = i->next) + if (i->off == off) + count++; + return (count == 1 ? tdb->methods->tdb_brlock(tdb, off, F_UNLCK, F_SETLKW, 0, 1) : 0); +} + +/* file: io.c */ + +/* check for an out of bounds access - if it is out of bounds then + see if the database has been expanded by someone else and expand + if necessary + note that "len" is the minimum length needed for the db +*/ +static int tdb_oob(struct tdb_context *tdb, tdb_off_t len, int probe) +{ + struct stat st; + if (len <= tdb->map_size) + return 0; + if (tdb->flags & TDB_INTERNAL) { + if (!probe) { + /* Ensure ecode is set for log fn. */ + tdb->ecode = TDB_ERR_IO; + TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_oob len %d beyond internal malloc size %d\n", + (int)len, (int)tdb->map_size)); + } + return TDB_ERRCODE(TDB_ERR_IO, -1); + } + + if (fstat(tdb->fd, &st) == -1) { + return TDB_ERRCODE(TDB_ERR_IO, -1); + } + + if (st.st_size < (size_t)len) { + if (!probe) { + /* Ensure ecode is set for log fn. */ + tdb->ecode = TDB_ERR_IO; + TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_oob len %d beyond eof at %d\n", + (int)len, (int)st.st_size)); + } + return TDB_ERRCODE(TDB_ERR_IO, -1); + } + + /* Unmap, update size, remap */ + if (tdb_munmap(tdb) == -1) + return TDB_ERRCODE(TDB_ERR_IO, -1); + tdb->map_size = st.st_size; + tdb_mmap(tdb); + return 0; +} + +/* write a lump of data at a specified offset */ +static int tdb_write(struct tdb_context *tdb, tdb_off_t off, + const void *buf, tdb_len_t len) +{ + if (len == 0) { + return 0; + } + + if (tdb->read_only || tdb->traverse_read) { + tdb->ecode = TDB_ERR_RDONLY; + return -1; + } + + if (tdb->methods->tdb_oob(tdb, off + len, 0) != 0) + return -1; + + if (tdb->map_ptr) { + memcpy(off + (char *)tdb->map_ptr, buf, len); + } else if (pwrite(tdb->fd, buf, len, off) != (ssize_t)len) { + /* Ensure ecode is set for log fn. */ + tdb->ecode = TDB_ERR_IO; + TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_write failed at %d len=%d (%s)\n", + off, len, strerror(errno))); + return TDB_ERRCODE(TDB_ERR_IO, -1); + } + return 0; +} + +/* Endian conversion: we only ever deal with 4 byte quantities */ +void *tdb_convert(void *buf, u32 size) +{ + u32 i, *p = (u32 *)buf; + for (i = 0; i < size / 4; i++) + p[i] = TDB_BYTEREV(p[i]); + return buf; +} + + +/* read a lump of data at a specified offset, maybe convert */ +static int tdb_read(struct tdb_context *tdb, tdb_off_t off, void *buf, + tdb_len_t len, int cv) +{ + if (tdb->methods->tdb_oob(tdb, off + len, 0) != 0) { + return -1; + } + + if (tdb->map_ptr) { + memcpy(buf, off + (char *)tdb->map_ptr, len); + } else { + ssize_t ret = pread(tdb->fd, buf, len, off); + if (ret != (ssize_t)len) { + /* Ensure ecode is set for log fn. */ + tdb->ecode = TDB_ERR_IO; + TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_read failed at %d " + "len=%d ret=%d (%s) map_size=%d\n", + (int)off, (int)len, (int)ret, strerror(errno), + (int)tdb->map_size)); + return TDB_ERRCODE(TDB_ERR_IO, -1); + } + } + if (cv) { + tdb_convert(buf, len); + } + return 0; +} + + + +/* + do an unlocked scan of the hash table heads to find the next non-zero head. The value + will then be confirmed with the lock held +*/ +static void tdb_next_hash_chain(struct tdb_context *tdb, u32 *chain) +{ + u32 h = *chain; + if (tdb->map_ptr) { + for (;h < tdb->header.hash_size;h++) { + if (0 != *(u32 *)(TDB_HASH_TOP(h) + (unsigned char *)tdb->map_ptr)) { + break; + } + } + } else { + u32 off=0; + for (;h < tdb->header.hash_size;h++) { + if (tdb_ofs_read(tdb, TDB_HASH_TOP(h), &off) != 0 || off != 0) { + break; + } + } + } + (*chain) = h; +} + + +int tdb_munmap(struct tdb_context *tdb) +{ + if (tdb->flags & TDB_INTERNAL) + return 0; + +#ifdef HAVE_MMAP + if (tdb->map_ptr) { + int ret = munmap(tdb->map_ptr, tdb->map_size); + if (ret != 0) + return ret; + } +#endif + tdb->map_ptr = NULL; + return 0; +} + +void tdb_mmap(struct tdb_context *tdb) +{ + if (tdb->flags & TDB_INTERNAL) + return; + +#ifdef HAVE_MMAP + if (!(tdb->flags & TDB_NOMMAP)) { + tdb->map_ptr = mmap(NULL, tdb->map_size, + PROT_READ|(tdb->read_only? 0:PROT_WRITE), + MAP_SHARED|MAP_FILE, tdb->fd, 0); + + /* + * NB. When mmap fails it returns MAP_FAILED *NOT* NULL !!!! + */ + + if (tdb->map_ptr == MAP_FAILED) { + tdb->map_ptr = NULL; + TDB_LOG((tdb, TDB_DEBUG_WARNING, "tdb_mmap failed for size %d (%s)\n", + tdb->map_size, strerror(errno))); + } + } else { + tdb->map_ptr = NULL; + } +#else + tdb->map_ptr = NULL; +#endif +} + +/* expand a file. we prefer to use ftruncate, as that is what posix + says to use for mmap expansion */ +static int tdb_expand_file(struct tdb_context *tdb, tdb_off_t size, tdb_off_t addition) +{ + char buf[1024]; + + if (tdb->read_only || tdb->traverse_read) { + tdb->ecode = TDB_ERR_RDONLY; + return -1; + } + + if (ftruncate(tdb->fd, size+addition) == -1) { + char b = 0; + if (pwrite(tdb->fd, &b, 1, (size+addition) - 1) != 1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "expand_file to %d failed (%s)\n", + size+addition, strerror(errno))); + return -1; + } + } + + /* now fill the file with something. This ensures that the + file isn't sparse, which would be very bad if we ran out of + disk. This must be done with write, not via mmap */ + memset(buf, TDB_PAD_BYTE, sizeof(buf)); + while (addition) { + int n = addition>sizeof(buf)?sizeof(buf):addition; + int ret = pwrite(tdb->fd, buf, n, size); + if (ret != n) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "expand_file write of %d failed (%s)\n", + n, strerror(errno))); + return -1; + } + addition -= n; + size += n; + } + return 0; +} + + +/* expand the database at least size bytes by expanding the underlying + file and doing the mmap again if necessary */ +int tdb_expand(struct tdb_context *tdb, tdb_off_t size) +{ + struct list_struct rec; + tdb_off_t offset; + + if (tdb_lock(tdb, -1, F_WRLCK) == -1) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "lock failed in tdb_expand\n")); + return -1; + } + + /* must know about any previous expansions by another process */ + tdb->methods->tdb_oob(tdb, tdb->map_size + 1, 1); + + /* always make room for at least 10 more records, and round + the database up to a multiple of the page size */ + size = TDB_ALIGN(tdb->map_size + size*10, tdb->page_size) - tdb->map_size; + + if (!(tdb->flags & TDB_INTERNAL)) + tdb_munmap(tdb); + + /* + * We must ensure the file is unmapped before doing this + * to ensure consistency with systems like OpenBSD where + * writes and mmaps are not consistent. + */ + + /* expand the file itself */ + if (!(tdb->flags & TDB_INTERNAL)) { + if (tdb->methods->tdb_expand_file(tdb, tdb->map_size, size) != 0) + goto fail; + } + + tdb->map_size += size; + + if (tdb->flags & TDB_INTERNAL) { + char *new_map_ptr = (char *)realloc(tdb->map_ptr, + tdb->map_size); + if (!new_map_ptr) { + tdb->map_size -= size; + goto fail; + } + tdb->map_ptr = new_map_ptr; + } else { + /* + * We must ensure the file is remapped before adding the space + * to ensure consistency with systems like OpenBSD where + * writes and mmaps are not consistent. + */ + + /* We're ok if the mmap fails as we'll fallback to read/write */ + tdb_mmap(tdb); + } + + /* form a new freelist record */ + memset(&rec,'\0',sizeof(rec)); + rec.rec_len = size - sizeof(rec); + + /* link it into the free list */ + offset = tdb->map_size - size; + if (tdb_free(tdb, offset, &rec) == -1) + goto fail; + + tdb_unlock(tdb, -1, F_WRLCK); + return 0; + fail: + tdb_unlock(tdb, -1, F_WRLCK); + return -1; +} + +/* read/write a tdb_off_t */ +int tdb_ofs_read(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d) +{ + return tdb->methods->tdb_read(tdb, offset, (char*)d, sizeof(*d), DOCONV()); +} + +int tdb_ofs_write(struct tdb_context *tdb, tdb_off_t offset, tdb_off_t *d) +{ + tdb_off_t off = *d; + return tdb->methods->tdb_write(tdb, offset, CONVERT(off), sizeof(*d)); +} + + +/* read a lump of data, allocating the space for it */ +unsigned char *tdb_alloc_read(struct tdb_context *tdb, tdb_off_t offset, tdb_len_t len) +{ + unsigned char *buf; + + /* some systems don't like zero length malloc */ + if (len == 0) { + len = 1; + } + + if (!(buf = (unsigned char *)malloc(len))) { + /* Ensure ecode is set for log fn. */ + tdb->ecode = TDB_ERR_OOM; + TDB_LOG((tdb, TDB_DEBUG_ERROR,"tdb_alloc_read malloc failed len=%d (%s)\n", + len, strerror(errno))); + return TDB_ERRCODE(TDB_ERR_OOM, buf); + } + if (tdb->methods->tdb_read(tdb, offset, buf, len, 0) == -1) { + SAFE_FREE(buf); + return NULL; + } + return buf; +} + +/* Give a piece of tdb data to a parser */ + +int tdb_parse_data(struct tdb_context *tdb, TDB_DATA key, + tdb_off_t offset, tdb_len_t len, + int (*parser)(TDB_DATA key, TDB_DATA data, + void *private_data), + void *private_data) +{ + TDB_DATA data; + int result; + + data.dsize = len; + + if ((tdb->transaction == NULL) && (tdb->map_ptr != NULL)) { + /* + * Optimize by avoiding the malloc/memcpy/free, point the + * parser directly at the mmap area. + */ + if (tdb->methods->tdb_oob(tdb, offset+len, 0) != 0) { + return -1; + } + data.dptr = offset + (unsigned char *)tdb->map_ptr; + return parser(key, data, private_data); + } + + if (!(data.dptr = tdb_alloc_read(tdb, offset, len))) { + return -1; + } + + result = parser(key, data, private_data); + free(data.dptr); + return result; +} + +/* read/write a record */ +int tdb_rec_read(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec) +{ + if (tdb->methods->tdb_read(tdb, offset, rec, sizeof(*rec),DOCONV()) == -1) + return -1; + if (TDB_BAD_MAGIC(rec)) { + /* Ensure ecode is set for log fn. */ + tdb->ecode = TDB_ERR_CORRUPT; + TDB_LOG((tdb, TDB_DEBUG_FATAL,"tdb_rec_read bad magic 0x%x at offset=%d\n", rec->magic, offset)); + return TDB_ERRCODE(TDB_ERR_CORRUPT, -1); + } + return tdb->methods->tdb_oob(tdb, rec->next+sizeof(*rec), 0); +} + +int tdb_rec_write(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec) +{ + struct list_struct r = *rec; + return tdb->methods->tdb_write(tdb, offset, CONVERT(r), sizeof(r)); +} + +static const struct tdb_methods io_methods = { + tdb_read, + tdb_write, + tdb_next_hash_chain, + tdb_oob, + tdb_expand_file, + tdb_brlock +}; + +/* + initialise the default methods table +*/ +void tdb_io_init(struct tdb_context *tdb) +{ + tdb->methods = &io_methods; +} + +/* file: transaction.c */ + +/* + transaction design: + + - only allow a single transaction at a time per database. This makes + using the transaction API simpler, as otherwise the caller would + have to cope with temporary failures in transactions that conflict + with other current transactions + + - keep the transaction recovery information in the same file as the + database, using a special 'transaction recovery' record pointed at + by the header. This removes the need for extra journal files as + used by some other databases + + - dynamically allocated the transaction recover record, re-using it + for subsequent transactions. If a larger record is needed then + tdb_free() the old record to place it on the normal tdb freelist + before allocating the new record + + - during transactions, keep a linked list of writes all that have + been performed by intercepting all tdb_write() calls. The hooked + transaction versions of tdb_read() and tdb_write() check this + linked list and try to use the elements of the list in preference + to the real database. + + - don't allow any locks to be held when a transaction starts, + otherwise we can end up with deadlock (plus lack of lock nesting + in posix locks would mean the lock is lost) + + - if the caller gains a lock during the transaction but doesn't + release it then fail the commit + + - allow for nested calls to tdb_transaction_start(), re-using the + existing transaction record. If the inner transaction is cancelled + then a subsequent commit will fail + + - keep a mirrored copy of the tdb hash chain heads to allow for the + fast hash heads scan on traverse, updating the mirrored copy in + the transaction version of tdb_write + + - allow callers to mix transaction and non-transaction use of tdb, + although once a transaction is started then an exclusive lock is + gained until the transaction is committed or cancelled + + - the commit stategy involves first saving away all modified data + into a linearised buffer in the transaction recovery area, then + marking the transaction recovery area with a magic value to + indicate a valid recovery record. In total 4 fsync/msync calls are + needed per commit to prevent race conditions. It might be possible + to reduce this to 3 or even 2 with some more work. + + - check for a valid recovery record on open of the tdb, while the + global lock is held. Automatically recover from the transaction + recovery area if needed, then continue with the open as + usual. This allows for smooth crash recovery with no administrator + intervention. + + - if TDB_NOSYNC is passed to flags in tdb_open then transactions are + still available, but no transaction recovery area is used and no + fsync/msync calls are made. + +*/ + +struct tdb_transaction_el { + struct tdb_transaction_el *next, *prev; + tdb_off_t offset; + tdb_len_t length; + unsigned char *data; +}; + +/* + hold the context of any current transaction +*/ +struct tdb_transaction { + /* we keep a mirrored copy of the tdb hash heads here so + tdb_next_hash_chain() can operate efficiently */ + u32 *hash_heads; + + /* the original io methods - used to do IOs to the real db */ + const struct tdb_methods *io_methods; + + /* the list of transaction elements. We use a doubly linked + list with a last pointer to allow us to keep the list + ordered, with first element at the front of the list. It + needs to be doubly linked as the read/write traversals need + to be backwards, while the commit needs to be forwards */ + struct tdb_transaction_el *elements, *elements_last; + + /* non-zero when an internal transaction error has + occurred. All write operations will then fail until the + transaction is ended */ + int transaction_error; + + /* when inside a transaction we need to keep track of any + nested tdb_transaction_start() calls, as these are allowed, + but don't create a new transaction */ + int nesting; + + /* old file size before transaction */ + tdb_len_t old_map_size; +}; + + +/* + read while in a transaction. We need to check first if the data is in our list + of transaction elements, then if not do a real read +*/ +static int transaction_read(struct tdb_context *tdb, tdb_off_t off, void *buf, + tdb_len_t len, int cv) +{ + struct tdb_transaction_el *el; + + /* we need to walk the list backwards to get the most recent data */ + for (el=tdb->transaction->elements_last;el;el=el->prev) { + tdb_len_t partial; + + if (off+len <= el->offset) { + continue; + } + if (off >= el->offset + el->length) { + continue; + } + + /* an overlapping read - needs to be split into up to + 2 reads and a memcpy */ + if (off < el->offset) { + partial = el->offset - off; + if (transaction_read(tdb, off, buf, partial, cv) != 0) { + goto fail; + } + len -= partial; + off += partial; + buf = (void *)(partial + (char *)buf); + } + if (off + len <= el->offset + el->length) { + partial = len; + } else { + partial = el->offset + el->length - off; + } + memcpy(buf, el->data + (off - el->offset), partial); + if (cv) { + tdb_convert(buf, len); + } + len -= partial; + off += partial; + buf = (void *)(partial + (char *)buf); + + if (len != 0 && transaction_read(tdb, off, buf, len, cv) != 0) { + goto fail; + } + + return 0; + } + + /* its not in the transaction elements - do a real read */ + return tdb->transaction->io_methods->tdb_read(tdb, off, buf, len, cv); + +fail: + TDB_LOG((tdb, TDB_DEBUG_FATAL, "transaction_read: failed at off=%d len=%d\n", off, len)); + tdb->ecode = TDB_ERR_IO; + tdb->transaction->transaction_error = 1; + return -1; +} + + +/* + write while in a transaction +*/ +static int transaction_write(struct tdb_context *tdb, tdb_off_t off, + const void *buf, tdb_len_t len) +{ + struct tdb_transaction_el *el, *best_el=NULL; + + if (len == 0) { + return 0; + } + + /* if the write is to a hash head, then update the transaction + hash heads */ + if (len == sizeof(tdb_off_t) && off >= FREELIST_TOP && + off < FREELIST_TOP+TDB_HASHTABLE_SIZE(tdb)) { + u32 chain = (off-FREELIST_TOP) / sizeof(tdb_off_t); + memcpy(&tdb->transaction->hash_heads[chain], buf, len); + } + + /* first see if we can replace an existing entry */ + for (el=tdb->transaction->elements_last;el;el=el->prev) { + tdb_len_t partial; + + if (best_el == NULL && off == el->offset+el->length) { + best_el = el; + } + + if (off+len <= el->offset) { + continue; + } + if (off >= el->offset + el->length) { + continue; + } + + /* an overlapping write - needs to be split into up to + 2 writes and a memcpy */ + if (off < el->offset) { + partial = el->offset - off; + if (transaction_write(tdb, off, buf, partial) != 0) { + goto fail; + } + len -= partial; + off += partial; + buf = (const void *)(partial + (const char *)buf); + } + if (off + len <= el->offset + el->length) { + partial = len; + } else { + partial = el->offset + el->length - off; + } + memcpy(el->data + (off - el->offset), buf, partial); + len -= partial; + off += partial; + buf = (const void *)(partial + (const char *)buf); + + if (len != 0 && transaction_write(tdb, off, buf, len) != 0) { + goto fail; + } + + return 0; + } + + /* see if we can append the new entry to an existing entry */ + if (best_el && best_el->offset + best_el->length == off && + (off+len < tdb->transaction->old_map_size || + off > tdb->transaction->old_map_size)) { + unsigned char *data = best_el->data; + el = best_el; + el->data = (unsigned char *)realloc(el->data, + el->length + len); + if (el->data == NULL) { + tdb->ecode = TDB_ERR_OOM; + tdb->transaction->transaction_error = 1; + el->data = data; + return -1; + } + if (buf) { + memcpy(el->data + el->length, buf, len); + } else { + memset(el->data + el->length, TDB_PAD_BYTE, len); + } + el->length += len; + return 0; + } + + /* add a new entry at the end of the list */ + el = (struct tdb_transaction_el *)malloc(sizeof(*el)); + if (el == NULL) { + tdb->ecode = TDB_ERR_OOM; + tdb->transaction->transaction_error = 1; + return -1; + } + el->next = NULL; + el->prev = tdb->transaction->elements_last; + el->offset = off; + el->length = len; + el->data = (unsigned char *)malloc(len); + if (el->data == NULL) { + free(el); + tdb->ecode = TDB_ERR_OOM; + tdb->transaction->transaction_error = 1; + return -1; + } + if (buf) { + memcpy(el->data, buf, len); + } else { + memset(el->data, TDB_PAD_BYTE, len); + } + if (el->prev) { + el->prev->next = el; + } else { + tdb->transaction->elements = el; + } + tdb->transaction->elements_last = el; + return 0; + +fail: + TDB_LOG((tdb, TDB_DEBUG_FATAL, "transaction_write: failed at off=%d len=%d\n", off, len)); + tdb->ecode = TDB_ERR_IO; + tdb->transaction->transaction_error = 1; + return -1; +} + +/* + accelerated hash chain head search, using the cached hash heads +*/ +static void transaction_next_hash_chain(struct tdb_context *tdb, u32 *chain) +{ + u32 h = *chain; + for (;h < tdb->header.hash_size;h++) { + /* the +1 takes account of the freelist */ + if (0 != tdb->transaction->hash_heads[h+1]) { + break; + } + } + (*chain) = h; +} + +/* + out of bounds check during a transaction +*/ +static int transaction_oob(struct tdb_context *tdb, tdb_off_t len, int probe) +{ + if (len <= tdb->map_size) { + return 0; + } + return TDB_ERRCODE(TDB_ERR_IO, -1); +} + +/* + transaction version of tdb_expand(). +*/ +static int transaction_expand_file(struct tdb_context *tdb, tdb_off_t size, + tdb_off_t addition) +{ + /* add a write to the transaction elements, so subsequent + reads see the zero data */ + if (transaction_write(tdb, size, NULL, addition) != 0) { + return -1; + } + + return 0; +} + +/* + brlock during a transaction - ignore them +*/ +static int transaction_brlock(struct tdb_context *tdb, tdb_off_t offset, + int rw_type, int lck_type, int probe, size_t len) +{ + return 0; +} + +static const struct tdb_methods transaction_methods = { + transaction_read, + transaction_write, + transaction_next_hash_chain, + transaction_oob, + transaction_expand_file, + transaction_brlock +}; + + +/* + start a tdb transaction. No token is returned, as only a single + transaction is allowed to be pending per tdb_context +*/ +int tdb_transaction_start(struct tdb_context *tdb) +{ + /* some sanity checks */ + if (tdb->read_only || (tdb->flags & TDB_INTERNAL) || tdb->traverse_read) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_start: cannot start a transaction on a read-only or internal db\n")); + tdb->ecode = TDB_ERR_EINVAL; + return -1; + } + + /* cope with nested tdb_transaction_start() calls */ + if (tdb->transaction != NULL) { + tdb->transaction->nesting++; + TDB_LOG((tdb, TDB_DEBUG_TRACE, "tdb_transaction_start: nesting %d\n", + tdb->transaction->nesting)); + return 0; + } + + if (tdb->num_locks != 0 || tdb->global_lock.count) { + /* the caller must not have any locks when starting a + transaction as otherwise we'll be screwed by lack + of nested locks in posix */ + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_start: cannot start a transaction with locks held\n")); + tdb->ecode = TDB_ERR_LOCK; + return -1; + } + + if (tdb->travlocks.next != NULL) { + /* you cannot use transactions inside a traverse (although you can use + traverse inside a transaction) as otherwise you can end up with + deadlock */ + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_start: cannot start a transaction within a traverse\n")); + tdb->ecode = TDB_ERR_LOCK; + return -1; + } + + tdb->transaction = (struct tdb_transaction *) + calloc(sizeof(struct tdb_transaction), 1); + if (tdb->transaction == NULL) { + tdb->ecode = TDB_ERR_OOM; + return -1; + } + + /* get the transaction write lock. This is a blocking lock. As + discussed with Volker, there are a number of ways we could + make this async, which we will probably do in the future */ + if (tdb_transaction_lock(tdb, F_WRLCK) == -1) { + SAFE_FREE(tdb->transaction); + return -1; + } + + /* get a read lock from the freelist to the end of file. This + is upgraded to a write lock during the commit */ + if (tdb_brlock(tdb, FREELIST_TOP, F_RDLCK, F_SETLKW, 0, 0) == -1) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_start: failed to get hash locks\n")); + tdb->ecode = TDB_ERR_LOCK; + goto fail; + } + + /* setup a copy of the hash table heads so the hash scan in + traverse can be fast */ + tdb->transaction->hash_heads = (u32 *) + calloc(tdb->header.hash_size+1, sizeof(u32)); + if (tdb->transaction->hash_heads == NULL) { + tdb->ecode = TDB_ERR_OOM; + goto fail; + } + if (tdb->methods->tdb_read(tdb, FREELIST_TOP, tdb->transaction->hash_heads, + TDB_HASHTABLE_SIZE(tdb), 0) != 0) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_start: failed to read hash heads\n")); + tdb->ecode = TDB_ERR_IO; + goto fail; + } + + /* make sure we know about any file expansions already done by + anyone else */ + tdb->methods->tdb_oob(tdb, tdb->map_size + 1, 1); + tdb->transaction->old_map_size = tdb->map_size; + + /* finally hook the io methods, replacing them with + transaction specific methods */ + tdb->transaction->io_methods = tdb->methods; + tdb->methods = &transaction_methods; + + /* by calling this transaction write here, we ensure that we don't grow the + transaction linked list due to hash table updates */ + if (transaction_write(tdb, FREELIST_TOP, tdb->transaction->hash_heads, + TDB_HASHTABLE_SIZE(tdb)) != 0) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_start: failed to prime hash table\n")); + tdb->ecode = TDB_ERR_IO; + tdb->methods = tdb->transaction->io_methods; + goto fail; + } + + return 0; + +fail: + tdb_brlock(tdb, FREELIST_TOP, F_UNLCK, F_SETLKW, 0, 0); + tdb_transaction_unlock(tdb); + SAFE_FREE(tdb->transaction->hash_heads); + SAFE_FREE(tdb->transaction); + return -1; +} + + +/* + cancel the current transaction +*/ +int tdb_transaction_cancel(struct tdb_context *tdb) +{ + if (tdb->transaction == NULL) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_cancel: no transaction\n")); + return -1; + } + + if (tdb->transaction->nesting != 0) { + tdb->transaction->transaction_error = 1; + tdb->transaction->nesting--; + return 0; + } + + tdb->map_size = tdb->transaction->old_map_size; + + /* free all the transaction elements */ + while (tdb->transaction->elements) { + struct tdb_transaction_el *el = tdb->transaction->elements; + tdb->transaction->elements = el->next; + free(el->data); + free(el); + } + + /* remove any global lock created during the transaction */ + if (tdb->global_lock.count != 0) { + tdb_brlock(tdb, FREELIST_TOP, F_UNLCK, F_SETLKW, 0, 4*tdb->header.hash_size); + tdb->global_lock.count = 0; + } + + /* remove any locks created during the transaction */ + if (tdb->num_locks != 0) { + int i; + for (i=0;i<tdb->num_lockrecs;i++) { + tdb_brlock(tdb,FREELIST_TOP+4*tdb->lockrecs[i].list, + F_UNLCK,F_SETLKW, 0, 1); + } + tdb->num_locks = 0; + tdb->num_lockrecs = 0; + SAFE_FREE(tdb->lockrecs); + } + + /* restore the normal io methods */ + tdb->methods = tdb->transaction->io_methods; + + tdb_brlock(tdb, FREELIST_TOP, F_UNLCK, F_SETLKW, 0, 0); + tdb_transaction_unlock(tdb); + SAFE_FREE(tdb->transaction->hash_heads); + SAFE_FREE(tdb->transaction); + + return 0; +} + +/* + sync to disk +*/ +static int transaction_sync(struct tdb_context *tdb, tdb_off_t offset, tdb_len_t length) +{ + if (fsync(tdb->fd) != 0) { + tdb->ecode = TDB_ERR_IO; + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction: fsync failed\n")); + return -1; + } +#ifdef MS_SYNC + if (tdb->map_ptr) { + tdb_off_t moffset = offset & ~(tdb->page_size-1); + if (msync(moffset + (char *)tdb->map_ptr, + length + (offset - moffset), MS_SYNC) != 0) { + tdb->ecode = TDB_ERR_IO; + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction: msync failed - %s\n", + strerror(errno))); + return -1; + } + } +#endif + return 0; +} + + +/* + work out how much space the linearised recovery data will consume +*/ +static tdb_len_t tdb_recovery_size(struct tdb_context *tdb) +{ + struct tdb_transaction_el *el; + tdb_len_t recovery_size = 0; + + recovery_size = sizeof(u32); + for (el=tdb->transaction->elements;el;el=el->next) { + if (el->offset >= tdb->transaction->old_map_size) { + continue; + } + recovery_size += 2*sizeof(tdb_off_t) + el->length; + } + + return recovery_size; +} + +/* + allocate the recovery area, or use an existing recovery area if it is + large enough +*/ +static int tdb_recovery_allocate(struct tdb_context *tdb, + tdb_len_t *recovery_size, + tdb_off_t *recovery_offset, + tdb_len_t *recovery_max_size) +{ + struct list_struct rec; + const struct tdb_methods *methods = tdb->transaction->io_methods; + tdb_off_t recovery_head; + + if (tdb_ofs_read(tdb, TDB_RECOVERY_HEAD, &recovery_head) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_recovery_allocate: failed to read recovery head\n")); + return -1; + } + + rec.rec_len = 0; + + if (recovery_head != 0 && + methods->tdb_read(tdb, recovery_head, &rec, sizeof(rec), DOCONV()) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_recovery_allocate: failed to read recovery record\n")); + return -1; + } + + *recovery_size = tdb_recovery_size(tdb); + + if (recovery_head != 0 && *recovery_size <= rec.rec_len) { + /* it fits in the existing area */ + *recovery_max_size = rec.rec_len; + *recovery_offset = recovery_head; + return 0; + } + + /* we need to free up the old recovery area, then allocate a + new one at the end of the file. Note that we cannot use + tdb_allocate() to allocate the new one as that might return + us an area that is being currently used (as of the start of + the transaction) */ + if (recovery_head != 0) { + if (tdb_free(tdb, recovery_head, &rec) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_recovery_allocate: failed to free previous recovery area\n")); + return -1; + } + } + + /* the tdb_free() call might have increased the recovery size */ + *recovery_size = tdb_recovery_size(tdb); + + /* round up to a multiple of page size */ + *recovery_max_size = TDB_ALIGN(sizeof(rec) + *recovery_size, tdb->page_size) - sizeof(rec); + *recovery_offset = tdb->map_size; + recovery_head = *recovery_offset; + + if (methods->tdb_expand_file(tdb, tdb->transaction->old_map_size, + (tdb->map_size - tdb->transaction->old_map_size) + + sizeof(rec) + *recovery_max_size) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_recovery_allocate: failed to create recovery area\n")); + return -1; + } + + /* remap the file (if using mmap) */ + methods->tdb_oob(tdb, tdb->map_size + 1, 1); + + /* we have to reset the old map size so that we don't try to expand the file + again in the transaction commit, which would destroy the recovery area */ + tdb->transaction->old_map_size = tdb->map_size; + + /* write the recovery header offset and sync - we can sync without a race here + as the magic ptr in the recovery record has not been set */ + CONVERT(recovery_head); + if (methods->tdb_write(tdb, TDB_RECOVERY_HEAD, + &recovery_head, sizeof(tdb_off_t)) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_recovery_allocate: failed to write recovery head\n")); + return -1; + } + + return 0; +} + + +/* + setup the recovery data that will be used on a crash during commit +*/ +static int transaction_setup_recovery(struct tdb_context *tdb, + tdb_off_t *magic_offset) +{ + struct tdb_transaction_el *el; + tdb_len_t recovery_size; + unsigned char *data, *p; + const struct tdb_methods *methods = tdb->transaction->io_methods; + struct list_struct *rec; + tdb_off_t recovery_offset, recovery_max_size; + tdb_off_t old_map_size = tdb->transaction->old_map_size; + u32 magic, tailer; + + /* + check that the recovery area has enough space + */ + if (tdb_recovery_allocate(tdb, &recovery_size, + &recovery_offset, &recovery_max_size) == -1) { + return -1; + } + + data = (unsigned char *)malloc(recovery_size + sizeof(*rec)); + if (data == NULL) { + tdb->ecode = TDB_ERR_OOM; + return -1; + } + + rec = (struct list_struct *)data; + memset(rec, 0, sizeof(*rec)); + + rec->magic = 0; + rec->data_len = recovery_size; + rec->rec_len = recovery_max_size; + rec->key_len = old_map_size; + CONVERT(rec); + + /* build the recovery data into a single blob to allow us to do a single + large write, which should be more efficient */ + p = data + sizeof(*rec); + for (el=tdb->transaction->elements;el;el=el->next) { + if (el->offset >= old_map_size) { + continue; + } + if (el->offset + el->length > tdb->transaction->old_map_size) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_setup_recovery: transaction data over new region boundary\n")); + free(data); + tdb->ecode = TDB_ERR_CORRUPT; + return -1; + } + memcpy(p, &el->offset, 4); + memcpy(p+4, &el->length, 4); + if (DOCONV()) { + tdb_convert(p, 8); + } + /* the recovery area contains the old data, not the + new data, so we have to call the original tdb_read + method to get it */ + if (methods->tdb_read(tdb, el->offset, p + 8, el->length, 0) != 0) { + free(data); + tdb->ecode = TDB_ERR_IO; + return -1; + } + p += 8 + el->length; + } + + /* and the tailer */ + tailer = sizeof(*rec) + recovery_max_size; + memcpy(p, &tailer, 4); + CONVERT(p); + + /* write the recovery data to the recovery area */ + if (methods->tdb_write(tdb, recovery_offset, data, sizeof(*rec) + recovery_size) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_setup_recovery: failed to write recovery data\n")); + free(data); + tdb->ecode = TDB_ERR_IO; + return -1; + } + + /* as we don't have ordered writes, we have to sync the recovery + data before we update the magic to indicate that the recovery + data is present */ + if (transaction_sync(tdb, recovery_offset, sizeof(*rec) + recovery_size) == -1) { + free(data); + return -1; + } + + free(data); + + magic = TDB_RECOVERY_MAGIC; + CONVERT(magic); + + *magic_offset = recovery_offset + offsetof(struct list_struct, magic); + + if (methods->tdb_write(tdb, *magic_offset, &magic, sizeof(magic)) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_setup_recovery: failed to write recovery magic\n")); + tdb->ecode = TDB_ERR_IO; + return -1; + } + + /* ensure the recovery magic marker is on disk */ + if (transaction_sync(tdb, *magic_offset, sizeof(magic)) == -1) { + return -1; + } + + return 0; +} + +/* + commit the current transaction +*/ +int tdb_transaction_commit(struct tdb_context *tdb) +{ + const struct tdb_methods *methods; + tdb_off_t magic_offset = 0; + u32 zero = 0; + + if (tdb->transaction == NULL) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_commit: no transaction\n")); + return -1; + } + + if (tdb->transaction->transaction_error) { + tdb->ecode = TDB_ERR_IO; + tdb_transaction_cancel(tdb); + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_commit: transaction error pending\n")); + return -1; + } + + if (tdb->transaction->nesting != 0) { + tdb->transaction->nesting--; + return 0; + } + + /* check for a null transaction */ + if (tdb->transaction->elements == NULL) { + tdb_transaction_cancel(tdb); + return 0; + } + + methods = tdb->transaction->io_methods; + + /* if there are any locks pending then the caller has not + nested their locks properly, so fail the transaction */ + if (tdb->num_locks || tdb->global_lock.count) { + tdb->ecode = TDB_ERR_LOCK; + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_commit: locks pending on commit\n")); + tdb_transaction_cancel(tdb); + return -1; + } + + /* upgrade the main transaction lock region to a write lock */ + if (tdb_brlock_upgrade(tdb, FREELIST_TOP, 0) == -1) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_start: failed to upgrade hash locks\n")); + tdb->ecode = TDB_ERR_LOCK; + tdb_transaction_cancel(tdb); + return -1; + } + + /* get the global lock - this prevents new users attaching to the database + during the commit */ + if (tdb_brlock(tdb, GLOBAL_LOCK, F_WRLCK, F_SETLKW, 0, 1) == -1) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_transaction_commit: failed to get global lock\n")); + tdb->ecode = TDB_ERR_LOCK; + tdb_transaction_cancel(tdb); + return -1; + } + + if (!(tdb->flags & TDB_NOSYNC)) { + /* write the recovery data to the end of the file */ + if (transaction_setup_recovery(tdb, &magic_offset) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_commit: failed to setup recovery data\n")); + tdb_brlock(tdb, GLOBAL_LOCK, F_UNLCK, F_SETLKW, 0, 1); + tdb_transaction_cancel(tdb); + return -1; + } + } + + /* expand the file to the new size if needed */ + if (tdb->map_size != tdb->transaction->old_map_size) { + if (methods->tdb_expand_file(tdb, tdb->transaction->old_map_size, + tdb->map_size - + tdb->transaction->old_map_size) == -1) { + tdb->ecode = TDB_ERR_IO; + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_commit: expansion failed\n")); + tdb_brlock(tdb, GLOBAL_LOCK, F_UNLCK, F_SETLKW, 0, 1); + tdb_transaction_cancel(tdb); + return -1; + } + tdb->map_size = tdb->transaction->old_map_size; + methods->tdb_oob(tdb, tdb->map_size + 1, 1); + } + + /* perform all the writes */ + while (tdb->transaction->elements) { + struct tdb_transaction_el *el = tdb->transaction->elements; + + if (methods->tdb_write(tdb, el->offset, el->data, el->length) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_commit: write failed during commit\n")); + + /* we've overwritten part of the data and + possibly expanded the file, so we need to + run the crash recovery code */ + tdb->methods = methods; + tdb_transaction_recover(tdb); + + tdb_transaction_cancel(tdb); + tdb_brlock(tdb, GLOBAL_LOCK, F_UNLCK, F_SETLKW, 0, 1); + + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_commit: write failed\n")); + return -1; + } + tdb->transaction->elements = el->next; + free(el->data); + free(el); + } + + if (!(tdb->flags & TDB_NOSYNC)) { + /* ensure the new data is on disk */ + if (transaction_sync(tdb, 0, tdb->map_size) == -1) { + return -1; + } + + /* remove the recovery marker */ + if (methods->tdb_write(tdb, magic_offset, &zero, 4) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_commit: failed to remove recovery magic\n")); + return -1; + } + + /* ensure the recovery marker has been removed on disk */ + if (transaction_sync(tdb, magic_offset, 4) == -1) { + return -1; + } + } + + tdb_brlock(tdb, GLOBAL_LOCK, F_UNLCK, F_SETLKW, 0, 1); + + /* + TODO: maybe write to some dummy hdr field, or write to magic + offset without mmap, before the last sync, instead of the + utime() call + */ + + /* on some systems (like Linux 2.6.x) changes via mmap/msync + don't change the mtime of the file, this means the file may + not be backed up (as tdb rounding to block sizes means that + file size changes are quite rare too). The following forces + mtime changes when a transaction completes */ +#ifdef HAVE_UTIME + utime(tdb->name, NULL); +#endif + + /* use a transaction cancel to free memory and remove the + transaction locks */ + tdb_transaction_cancel(tdb); + return 0; +} + + +/* + recover from an aborted transaction. Must be called with exclusive + database write access already established (including the global + lock to prevent new processes attaching) +*/ +int tdb_transaction_recover(struct tdb_context *tdb) +{ + tdb_off_t recovery_head, recovery_eof; + unsigned char *data, *p; + u32 zero = 0; + struct list_struct rec; + + /* find the recovery area */ + if (tdb_ofs_read(tdb, TDB_RECOVERY_HEAD, &recovery_head) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: failed to read recovery head\n")); + tdb->ecode = TDB_ERR_IO; + return -1; + } + + if (recovery_head == 0) { + /* we have never allocated a recovery record */ + return 0; + } + + /* read the recovery record */ + if (tdb->methods->tdb_read(tdb, recovery_head, &rec, + sizeof(rec), DOCONV()) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: failed to read recovery record\n")); + tdb->ecode = TDB_ERR_IO; + return -1; + } + + if (rec.magic != TDB_RECOVERY_MAGIC) { + /* there is no valid recovery data */ + return 0; + } + + if (tdb->read_only) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: attempt to recover read only database\n")); + tdb->ecode = TDB_ERR_CORRUPT; + return -1; + } + + recovery_eof = rec.key_len; + + data = (unsigned char *)malloc(rec.data_len); + if (data == NULL) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: failed to allocate recovery data\n")); + tdb->ecode = TDB_ERR_OOM; + return -1; + } + + /* read the full recovery data */ + if (tdb->methods->tdb_read(tdb, recovery_head + sizeof(rec), data, + rec.data_len, 0) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: failed to read recovery data\n")); + tdb->ecode = TDB_ERR_IO; + return -1; + } + + /* recover the file data */ + p = data; + while (p+8 < data + rec.data_len) { + u32 ofs, len; + if (DOCONV()) { + tdb_convert(p, 8); + } + memcpy(&ofs, p, 4); + memcpy(&len, p+4, 4); + + if (tdb->methods->tdb_write(tdb, ofs, p+8, len) == -1) { + free(data); + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: failed to recover %d bytes at offset %d\n", len, ofs)); + tdb->ecode = TDB_ERR_IO; + return -1; + } + p += 8 + len; + } + + free(data); + + if (transaction_sync(tdb, 0, tdb->map_size) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: failed to sync recovery\n")); + tdb->ecode = TDB_ERR_IO; + return -1; + } + + /* if the recovery area is after the recovered eof then remove it */ + if (recovery_eof <= recovery_head) { + if (tdb_ofs_write(tdb, TDB_RECOVERY_HEAD, &zero) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: failed to remove recovery head\n")); + tdb->ecode = TDB_ERR_IO; + return -1; + } + } + + /* remove the recovery magic */ + if (tdb_ofs_write(tdb, recovery_head + offsetof(struct list_struct, magic), + &zero) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: failed to remove recovery magic\n")); + tdb->ecode = TDB_ERR_IO; + return -1; + } + + /* reduce the file size to the old size */ + tdb_munmap(tdb); + if (ftruncate(tdb->fd, recovery_eof) != 0) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: failed to reduce to recovery size\n")); + tdb->ecode = TDB_ERR_IO; + return -1; + } + tdb->map_size = recovery_eof; + tdb_mmap(tdb); + + if (transaction_sync(tdb, 0, recovery_eof) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_transaction_recover: failed to sync2 recovery\n")); + tdb->ecode = TDB_ERR_IO; + return -1; + } + + TDB_LOG((tdb, TDB_DEBUG_TRACE, "tdb_transaction_recover: recovered %d byte database\n", + recovery_eof)); + + /* all done */ + return 0; +} + +/* file: freelist.c */ + +/* read a freelist record and check for simple errors */ +static int tdb_rec_free_read(struct tdb_context *tdb, tdb_off_t off, struct list_struct *rec) +{ + if (tdb->methods->tdb_read(tdb, off, rec, sizeof(*rec),DOCONV()) == -1) + return -1; + + if (rec->magic == TDB_MAGIC) { + /* this happens when a app is showdown while deleting a record - we should + not completely fail when this happens */ + TDB_LOG((tdb, TDB_DEBUG_WARNING, "tdb_rec_free_read non-free magic 0x%x at offset=%d - fixing\n", + rec->magic, off)); + rec->magic = TDB_FREE_MAGIC; + if (tdb->methods->tdb_write(tdb, off, rec, sizeof(*rec)) == -1) + return -1; + } + + if (rec->magic != TDB_FREE_MAGIC) { + /* Ensure ecode is set for log fn. */ + tdb->ecode = TDB_ERR_CORRUPT; + TDB_LOG((tdb, TDB_DEBUG_WARNING, "tdb_rec_free_read bad magic 0x%x at offset=%d\n", + rec->magic, off)); + return TDB_ERRCODE(TDB_ERR_CORRUPT, -1); + } + if (tdb->methods->tdb_oob(tdb, rec->next+sizeof(*rec), 0) != 0) + return -1; + return 0; +} + + + +/* Remove an element from the freelist. Must have alloc lock. */ +static int remove_from_freelist(struct tdb_context *tdb, tdb_off_t off, tdb_off_t next) +{ + tdb_off_t last_ptr, i; + + /* read in the freelist top */ + last_ptr = FREELIST_TOP; + while (tdb_ofs_read(tdb, last_ptr, &i) != -1 && i != 0) { + if (i == off) { + /* We've found it! */ + return tdb_ofs_write(tdb, last_ptr, &next); + } + /* Follow chain (next offset is at start of record) */ + last_ptr = i; + } + TDB_LOG((tdb, TDB_DEBUG_FATAL,"remove_from_freelist: not on list at off=%d\n", off)); + return TDB_ERRCODE(TDB_ERR_CORRUPT, -1); +} + + +/* update a record tailer (must hold allocation lock) */ +static int update_tailer(struct tdb_context *tdb, tdb_off_t offset, + const struct list_struct *rec) +{ + tdb_off_t totalsize; + + /* Offset of tailer from record header */ + totalsize = sizeof(*rec) + rec->rec_len; + return tdb_ofs_write(tdb, offset + totalsize - sizeof(tdb_off_t), + &totalsize); +} + +/* Add an element into the freelist. Merge adjacent records if + neccessary. */ +int tdb_free(struct tdb_context *tdb, tdb_off_t offset, struct list_struct *rec) +{ + tdb_off_t right, left; + + /* Allocation and tailer lock */ + if (tdb_lock(tdb, -1, F_WRLCK) != 0) + return -1; + + /* set an initial tailer, so if we fail we don't leave a bogus record */ + if (update_tailer(tdb, offset, rec) != 0) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: update_tailer failed!\n")); + goto fail; + } + + /* Look right first (I'm an Australian, dammit) */ + right = offset + sizeof(*rec) + rec->rec_len; + if (right + sizeof(*rec) <= tdb->map_size) { + struct list_struct r; + + if (tdb->methods->tdb_read(tdb, right, &r, sizeof(r), DOCONV()) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: right read failed at %u\n", right)); + goto left; + } + + /* If it's free, expand to include it. */ + if (r.magic == TDB_FREE_MAGIC) { + if (remove_from_freelist(tdb, right, r.next) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: right free failed at %u\n", right)); + goto left; + } + rec->rec_len += sizeof(r) + r.rec_len; + } + } + +left: + /* Look left */ + left = offset - sizeof(tdb_off_t); + if (left > TDB_DATA_START(tdb->header.hash_size)) { + struct list_struct l; + tdb_off_t leftsize; + + /* Read in tailer and jump back to header */ + if (tdb_ofs_read(tdb, left, &leftsize) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: left offset read failed at %u\n", left)); + goto update; + } + + /* it could be uninitialised data */ + if (leftsize == 0 || leftsize == TDB_PAD_U32) { + goto update; + } + + left = offset - leftsize; + + /* Now read in record */ + if (tdb->methods->tdb_read(tdb, left, &l, sizeof(l), DOCONV()) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: left read failed at %u (%u)\n", left, leftsize)); + goto update; + } + + /* If it's free, expand to include it. */ + if (l.magic == TDB_FREE_MAGIC) { + if (remove_from_freelist(tdb, left, l.next) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: left free failed at %u\n", left)); + goto update; + } else { + offset = left; + rec->rec_len += leftsize; + } + } + } + +update: + if (update_tailer(tdb, offset, rec) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free: update_tailer failed at %u\n", offset)); + goto fail; + } + + /* Now, prepend to free list */ + rec->magic = TDB_FREE_MAGIC; + + if (tdb_ofs_read(tdb, FREELIST_TOP, &rec->next) == -1 || + tdb_rec_write(tdb, offset, rec) == -1 || + tdb_ofs_write(tdb, FREELIST_TOP, &offset) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_free record write failed at offset=%d\n", offset)); + goto fail; + } + + /* And we're done. */ + tdb_unlock(tdb, -1, F_WRLCK); + return 0; + + fail: + tdb_unlock(tdb, -1, F_WRLCK); + return -1; +} + + +/* + the core of tdb_allocate - called when we have decided which + free list entry to use + */ +static tdb_off_t tdb_allocate_ofs(struct tdb_context *tdb, tdb_len_t length, tdb_off_t rec_ptr, + struct list_struct *rec, tdb_off_t last_ptr) +{ + struct list_struct newrec; + tdb_off_t newrec_ptr; + + memset(&newrec, '\0', sizeof(newrec)); + + /* found it - now possibly split it up */ + if (rec->rec_len > length + MIN_REC_SIZE) { + /* Length of left piece */ + length = TDB_ALIGN(length, TDB_ALIGNMENT); + + /* Right piece to go on free list */ + newrec.rec_len = rec->rec_len - (sizeof(*rec) + length); + newrec_ptr = rec_ptr + sizeof(*rec) + length; + + /* And left record is shortened */ + rec->rec_len = length; + } else { + newrec_ptr = 0; + } + + /* Remove allocated record from the free list */ + if (tdb_ofs_write(tdb, last_ptr, &rec->next) == -1) { + return 0; + } + + /* Update header: do this before we drop alloc + lock, otherwise tdb_free() might try to + merge with us, thinking we're free. + (Thanks Jeremy Allison). */ + rec->magic = TDB_MAGIC; + if (tdb_rec_write(tdb, rec_ptr, rec) == -1) { + return 0; + } + + /* Did we create new block? */ + if (newrec_ptr) { + /* Update allocated record tailer (we + shortened it). */ + if (update_tailer(tdb, rec_ptr, rec) == -1) { + return 0; + } + + /* Free new record */ + if (tdb_free(tdb, newrec_ptr, &newrec) == -1) { + return 0; + } + } + + /* all done - return the new record offset */ + return rec_ptr; +} + +/* allocate some space from the free list. The offset returned points + to a unconnected list_struct within the database with room for at + least length bytes of total data + + 0 is returned if the space could not be allocated + */ +tdb_off_t tdb_allocate(struct tdb_context *tdb, tdb_len_t length, struct list_struct *rec) +{ + tdb_off_t rec_ptr, last_ptr, newrec_ptr; + struct { + tdb_off_t rec_ptr, last_ptr; + tdb_len_t rec_len; + } bestfit; + + if (tdb_lock(tdb, -1, F_WRLCK) == -1) + return 0; + + /* Extra bytes required for tailer */ + length += sizeof(tdb_off_t); + + again: + last_ptr = FREELIST_TOP; + + /* read in the freelist top */ + if (tdb_ofs_read(tdb, FREELIST_TOP, &rec_ptr) == -1) + goto fail; + + bestfit.rec_ptr = 0; + bestfit.last_ptr = 0; + bestfit.rec_len = 0; + + /* + this is a best fit allocation strategy. Originally we used + a first fit strategy, but it suffered from massive fragmentation + issues when faced with a slowly increasing record size. + */ + while (rec_ptr) { + if (tdb_rec_free_read(tdb, rec_ptr, rec) == -1) { + goto fail; + } + + if (rec->rec_len >= length) { + if (bestfit.rec_ptr == 0 || + rec->rec_len < bestfit.rec_len) { + bestfit.rec_len = rec->rec_len; + bestfit.rec_ptr = rec_ptr; + bestfit.last_ptr = last_ptr; + /* consider a fit to be good enough if + we aren't wasting more than half + the space */ + if (bestfit.rec_len < 2*length) { + break; + } + } + } + + /* move to the next record */ + last_ptr = rec_ptr; + rec_ptr = rec->next; + } + + if (bestfit.rec_ptr != 0) { + if (tdb_rec_free_read(tdb, bestfit.rec_ptr, rec) == -1) { + goto fail; + } + + newrec_ptr = tdb_allocate_ofs(tdb, length, bestfit.rec_ptr, rec, bestfit.last_ptr); + tdb_unlock(tdb, -1, F_WRLCK); + return newrec_ptr; + } + + /* we didn't find enough space. See if we can expand the + database and if we can then try again */ + if (tdb_expand(tdb, length + sizeof(*rec)) == 0) + goto again; + fail: + tdb_unlock(tdb, -1, F_WRLCK); + return 0; +} + +/* file: freelistcheck.c */ + +/* Check the freelist is good and contains no loops. + Very memory intensive - only do this as a consistency + checker. Heh heh - uses an in memory tdb as the storage + for the "seen" record list. For some reason this strikes + me as extremely clever as I don't have to write another tree + data structure implementation :-). + */ + +static int seen_insert(struct tdb_context *mem_tdb, tdb_off_t rec_ptr) +{ + TDB_DATA key, data; + + memset(&data, '\0', sizeof(data)); + key.dptr = (unsigned char *)&rec_ptr; + key.dsize = sizeof(rec_ptr); + return tdb_store(mem_tdb, key, data, TDB_INSERT); +} + +int tdb_validate_freelist(struct tdb_context *tdb, int *pnum_entries) +{ + struct tdb_context *mem_tdb = NULL; + struct list_struct rec; + tdb_off_t rec_ptr, last_ptr; + int ret = -1; + + *pnum_entries = 0; + + mem_tdb = tdb_open("flval", tdb->header.hash_size, + TDB_INTERNAL, O_RDWR, 0600); + if (!mem_tdb) { + return -1; + } + + if (tdb_lock(tdb, -1, F_WRLCK) == -1) { + tdb_close(mem_tdb); + return 0; + } + + last_ptr = FREELIST_TOP; + + /* Store the FREELIST_TOP record. */ + if (seen_insert(mem_tdb, last_ptr) == -1) { + ret = TDB_ERRCODE(TDB_ERR_CORRUPT, -1); + goto fail; + } + + /* read in the freelist top */ + if (tdb_ofs_read(tdb, FREELIST_TOP, &rec_ptr) == -1) { + goto fail; + } + + while (rec_ptr) { + + /* If we can't store this record (we've seen it + before) then the free list has a loop and must + be corrupt. */ + + if (seen_insert(mem_tdb, rec_ptr)) { + ret = TDB_ERRCODE(TDB_ERR_CORRUPT, -1); + goto fail; + } + + if (tdb_rec_free_read(tdb, rec_ptr, &rec) == -1) { + goto fail; + } + + /* move to the next record */ + last_ptr = rec_ptr; + rec_ptr = rec.next; + *pnum_entries += 1; + } + + ret = 0; + + fail: + + tdb_close(mem_tdb); + tdb_unlock(tdb, -1, F_WRLCK); + return ret; +} + +/* file: traverse.c */ + +/* Uses traverse lock: 0 = finish, -1 = error, other = record offset */ +static int tdb_next_lock(struct tdb_context *tdb, struct tdb_traverse_lock *tlock, + struct list_struct *rec) +{ + int want_next = (tlock->off != 0); + + /* Lock each chain from the start one. */ + for (; tlock->hash < tdb->header.hash_size; tlock->hash++) { + if (!tlock->off && tlock->hash != 0) { + /* this is an optimisation for the common case where + the hash chain is empty, which is particularly + common for the use of tdb with ldb, where large + hashes are used. In that case we spend most of our + time in tdb_brlock(), locking empty hash chains. + + To avoid this, we do an unlocked pre-check to see + if the hash chain is empty before starting to look + inside it. If it is empty then we can avoid that + hash chain. If it isn't empty then we can't believe + the value we get back, as we read it without a + lock, so instead we get the lock and re-fetch the + value below. + + Notice that not doing this optimisation on the + first hash chain is critical. We must guarantee + that we have done at least one fcntl lock at the + start of a search to guarantee that memory is + coherent on SMP systems. If records are added by + others during the search then thats OK, and we + could possibly miss those with this trick, but we + could miss them anyway without this trick, so the + semantics don't change. + + With a non-indexed ldb search this trick gains us a + factor of around 80 in speed on a linux 2.6.x + system (testing using ldbtest). + */ + tdb->methods->next_hash_chain(tdb, &tlock->hash); + if (tlock->hash == tdb->header.hash_size) { + continue; + } + } + + if (tdb_lock(tdb, tlock->hash, tlock->lock_rw) == -1) + return -1; + + /* No previous record? Start at top of chain. */ + if (!tlock->off) { + if (tdb_ofs_read(tdb, TDB_HASH_TOP(tlock->hash), + &tlock->off) == -1) + goto fail; + } else { + /* Otherwise unlock the previous record. */ + if (tdb_unlock_record(tdb, tlock->off) != 0) + goto fail; + } + + if (want_next) { + /* We have offset of old record: grab next */ + if (tdb_rec_read(tdb, tlock->off, rec) == -1) + goto fail; + tlock->off = rec->next; + } + + /* Iterate through chain */ + while( tlock->off) { + tdb_off_t current; + if (tdb_rec_read(tdb, tlock->off, rec) == -1) + goto fail; + + /* Detect infinite loops. From "Shlomi Yaakobovich" <Shlomi@exanet.com>. */ + if (tlock->off == rec->next) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_next_lock: loop detected.\n")); + goto fail; + } + + if (!TDB_DEAD(rec)) { + /* Woohoo: we found one! */ + if (tdb_lock_record(tdb, tlock->off) != 0) + goto fail; + return tlock->off; + } + + /* Try to clean dead ones from old traverses */ + current = tlock->off; + tlock->off = rec->next; + if (!(tdb->read_only || tdb->traverse_read) && + tdb_do_delete(tdb, current, rec) != 0) + goto fail; + } + tdb_unlock(tdb, tlock->hash, tlock->lock_rw); + want_next = 0; + } + /* We finished iteration without finding anything */ + return TDB_ERRCODE(TDB_SUCCESS, 0); + + fail: + tlock->off = 0; + if (tdb_unlock(tdb, tlock->hash, tlock->lock_rw) != 0) + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_next_lock: On error unlock failed!\n")); + return -1; +} + +/* traverse the entire database - calling fn(tdb, key, data) on each element. + return -1 on error or the record count traversed + if fn is NULL then it is not called + a non-zero return value from fn() indicates that the traversal should stop + */ +static int tdb_traverse_internal(struct tdb_context *tdb, + tdb_traverse_func fn, void *private_data, + struct tdb_traverse_lock *tl) +{ + TDB_DATA key, dbuf; + struct list_struct rec; + int ret, count = 0; + + /* This was in the initializaton, above, but the IRIX compiler + * did not like it. crh + */ + tl->next = tdb->travlocks.next; + + /* fcntl locks don't stack: beware traverse inside traverse */ + tdb->travlocks.next = tl; + + /* tdb_next_lock places locks on the record returned, and its chain */ + while ((ret = tdb_next_lock(tdb, tl, &rec)) > 0) { + count++; + /* now read the full record */ + key.dptr = tdb_alloc_read(tdb, tl->off + sizeof(rec), + rec.key_len + rec.data_len); + if (!key.dptr) { + ret = -1; + if (tdb_unlock(tdb, tl->hash, tl->lock_rw) != 0) + goto out; + if (tdb_unlock_record(tdb, tl->off) != 0) + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_traverse: key.dptr == NULL and unlock_record failed!\n")); + goto out; + } + key.dsize = rec.key_len; + dbuf.dptr = key.dptr + rec.key_len; + dbuf.dsize = rec.data_len; + + /* Drop chain lock, call out */ + if (tdb_unlock(tdb, tl->hash, tl->lock_rw) != 0) { + ret = -1; + SAFE_FREE(key.dptr); + goto out; + } + if (fn && fn(tdb, key, dbuf, private_data)) { + /* They want us to terminate traversal */ + ret = count; + if (tdb_unlock_record(tdb, tl->off) != 0) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_traverse: unlock_record failed!\n"));; + ret = -1; + } + SAFE_FREE(key.dptr); + goto out; + } + SAFE_FREE(key.dptr); + } +out: + tdb->travlocks.next = tl->next; + if (ret < 0) + return -1; + else + return count; +} + + +/* + a write style traverse - temporarily marks the db read only +*/ +int tdb_traverse_read(struct tdb_context *tdb, + tdb_traverse_func fn, void *private_data) +{ + struct tdb_traverse_lock tl = { NULL, 0, 0, F_RDLCK }; + int ret; + + /* we need to get a read lock on the transaction lock here to + cope with the lock ordering semantics of solaris10 */ + if (tdb_transaction_lock(tdb, F_RDLCK)) { + return -1; + } + + tdb->traverse_read++; + ret = tdb_traverse_internal(tdb, fn, private_data, &tl); + tdb->traverse_read--; + + tdb_transaction_unlock(tdb); + + return ret; +} + +/* + a write style traverse - needs to get the transaction lock to + prevent deadlocks +*/ +int tdb_traverse(struct tdb_context *tdb, + tdb_traverse_func fn, void *private_data) +{ + struct tdb_traverse_lock tl = { NULL, 0, 0, F_WRLCK }; + int ret; + + if (tdb->read_only || tdb->traverse_read) { + return tdb_traverse_read(tdb, fn, private_data); + } + + if (tdb_transaction_lock(tdb, F_WRLCK)) { + return -1; + } + + ret = tdb_traverse_internal(tdb, fn, private_data, &tl); + + tdb_transaction_unlock(tdb); + + return ret; +} + + +/* find the first entry in the database and return its key */ +TDB_DATA tdb_firstkey(struct tdb_context *tdb) +{ + TDB_DATA key; + struct list_struct rec; + + /* release any old lock */ + if (tdb_unlock_record(tdb, tdb->travlocks.off) != 0) + return tdb_null; + tdb->travlocks.off = tdb->travlocks.hash = 0; + tdb->travlocks.lock_rw = F_RDLCK; + + /* Grab first record: locks chain and returned record. */ + if (tdb_next_lock(tdb, &tdb->travlocks, &rec) <= 0) + return tdb_null; + /* now read the key */ + key.dsize = rec.key_len; + key.dptr =tdb_alloc_read(tdb,tdb->travlocks.off+sizeof(rec),key.dsize); + + /* Unlock the hash chain of the record we just read. */ + if (tdb_unlock(tdb, tdb->travlocks.hash, tdb->travlocks.lock_rw) != 0) + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_firstkey: error occurred while tdb_unlocking!\n")); + return key; +} + +/* find the next entry in the database, returning its key */ +TDB_DATA tdb_nextkey(struct tdb_context *tdb, TDB_DATA oldkey) +{ + u32 oldhash; + TDB_DATA key = tdb_null; + struct list_struct rec; + unsigned char *k = NULL; + + /* Is locked key the old key? If so, traverse will be reliable. */ + if (tdb->travlocks.off) { + if (tdb_lock(tdb,tdb->travlocks.hash,tdb->travlocks.lock_rw)) + return tdb_null; + if (tdb_rec_read(tdb, tdb->travlocks.off, &rec) == -1 + || !(k = tdb_alloc_read(tdb,tdb->travlocks.off+sizeof(rec), + rec.key_len)) + || memcmp(k, oldkey.dptr, oldkey.dsize) != 0) { + /* No, it wasn't: unlock it and start from scratch */ + if (tdb_unlock_record(tdb, tdb->travlocks.off) != 0) { + SAFE_FREE(k); + return tdb_null; + } + if (tdb_unlock(tdb, tdb->travlocks.hash, tdb->travlocks.lock_rw) != 0) { + SAFE_FREE(k); + return tdb_null; + } + tdb->travlocks.off = 0; + } + + SAFE_FREE(k); + } + + if (!tdb->travlocks.off) { + /* No previous element: do normal find, and lock record */ + tdb->travlocks.off = tdb_find_lock_hash(tdb, oldkey, tdb->hash_fn(&oldkey), tdb->travlocks.lock_rw, &rec); + if (!tdb->travlocks.off) + return tdb_null; + tdb->travlocks.hash = BUCKET(rec.full_hash); + if (tdb_lock_record(tdb, tdb->travlocks.off) != 0) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_nextkey: lock_record failed (%s)!\n", strerror(errno))); + return tdb_null; + } + } + oldhash = tdb->travlocks.hash; + + /* Grab next record: locks chain and returned record, + unlocks old record */ + if (tdb_next_lock(tdb, &tdb->travlocks, &rec) > 0) { + key.dsize = rec.key_len; + key.dptr = tdb_alloc_read(tdb, tdb->travlocks.off+sizeof(rec), + key.dsize); + /* Unlock the chain of this new record */ + if (tdb_unlock(tdb, tdb->travlocks.hash, tdb->travlocks.lock_rw) != 0) + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_nextkey: WARNING tdb_unlock failed!\n")); + } + /* Unlock the chain of old record */ + if (tdb_unlock(tdb, BUCKET(oldhash), tdb->travlocks.lock_rw) != 0) + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_nextkey: WARNING tdb_unlock failed!\n")); + return key; +} + +/* file: dump.c */ + +static tdb_off_t tdb_dump_record(struct tdb_context *tdb, int hash, + tdb_off_t offset) +{ + struct list_struct rec; + tdb_off_t tailer_ofs, tailer; + + if (tdb->methods->tdb_read(tdb, offset, (char *)&rec, + sizeof(rec), DOCONV()) == -1) { + printf("ERROR: failed to read record at %u\n", offset); + return 0; + } + + printf(" rec: hash=%d offset=0x%08x next=0x%08x rec_len=%d " + "key_len=%d data_len=%d full_hash=0x%x magic=0x%x\n", + hash, offset, rec.next, rec.rec_len, rec.key_len, rec.data_len, + rec.full_hash, rec.magic); + + tailer_ofs = offset + sizeof(rec) + rec.rec_len - sizeof(tdb_off_t); + + if (tdb_ofs_read(tdb, tailer_ofs, &tailer) == -1) { + printf("ERROR: failed to read tailer at %u\n", tailer_ofs); + return rec.next; + } + + if (tailer != rec.rec_len + sizeof(rec)) { + printf("ERROR: tailer does not match record! tailer=%u totalsize=%u\n", + (unsigned int)tailer, (unsigned int)(rec.rec_len + sizeof(rec))); + } + return rec.next; +} + +static int tdb_dump_chain(struct tdb_context *tdb, int i) +{ + tdb_off_t rec_ptr, top; + + top = TDB_HASH_TOP(i); + + if (tdb_lock(tdb, i, F_WRLCK) != 0) + return -1; + + if (tdb_ofs_read(tdb, top, &rec_ptr) == -1) + return tdb_unlock(tdb, i, F_WRLCK); + + if (rec_ptr) + printf("hash=%d\n", i); + + while (rec_ptr) { + rec_ptr = tdb_dump_record(tdb, i, rec_ptr); + } + + return tdb_unlock(tdb, i, F_WRLCK); +} + +void tdb_dump_all(struct tdb_context *tdb) +{ + int i; + for (i=0;i<tdb->header.hash_size;i++) { + tdb_dump_chain(tdb, i); + } + printf("freelist:\n"); + tdb_dump_chain(tdb, -1); +} + +int tdb_printfreelist(struct tdb_context *tdb) +{ + int ret; + long total_free = 0; + tdb_off_t offset, rec_ptr; + struct list_struct rec; + + if ((ret = tdb_lock(tdb, -1, F_WRLCK)) != 0) + return ret; + + offset = FREELIST_TOP; + + /* read in the freelist top */ + if (tdb_ofs_read(tdb, offset, &rec_ptr) == -1) { + tdb_unlock(tdb, -1, F_WRLCK); + return 0; + } + + printf("freelist top=[0x%08x]\n", rec_ptr ); + while (rec_ptr) { + if (tdb->methods->tdb_read(tdb, rec_ptr, (char *)&rec, + sizeof(rec), DOCONV()) == -1) { + tdb_unlock(tdb, -1, F_WRLCK); + return -1; + } + + if (rec.magic != TDB_FREE_MAGIC) { + printf("bad magic 0x%08x in free list\n", rec.magic); + tdb_unlock(tdb, -1, F_WRLCK); + return -1; + } + + printf("entry offset=[0x%08x], rec.rec_len = [0x%08x (%d)] (end = 0x%08x)\n", + rec_ptr, rec.rec_len, rec.rec_len, rec_ptr + rec.rec_len); + total_free += rec.rec_len; + + /* move to the next record */ + rec_ptr = rec.next; + } + printf("total rec_len = [0x%08x (%d)]\n", (int)total_free, + (int)total_free); + + return tdb_unlock(tdb, -1, F_WRLCK); +} + +/* file: tdb.c */ + +TDB_DATA tdb_null; + +/* + non-blocking increment of the tdb sequence number if the tdb has been opened using + the TDB_SEQNUM flag +*/ +void tdb_increment_seqnum_nonblock(struct tdb_context *tdb) +{ + tdb_off_t seqnum=0; + + if (!(tdb->flags & TDB_SEQNUM)) { + return; + } + + /* we ignore errors from this, as we have no sane way of + dealing with them. + */ + tdb_ofs_read(tdb, TDB_SEQNUM_OFS, &seqnum); + seqnum++; + tdb_ofs_write(tdb, TDB_SEQNUM_OFS, &seqnum); +} + +/* + increment the tdb sequence number if the tdb has been opened using + the TDB_SEQNUM flag +*/ +static void tdb_increment_seqnum(struct tdb_context *tdb) +{ + if (!(tdb->flags & TDB_SEQNUM)) { + return; + } + + if (tdb_brlock(tdb, TDB_SEQNUM_OFS, F_WRLCK, F_SETLKW, 1, 1) != 0) { + return; + } + + tdb_increment_seqnum_nonblock(tdb); + + tdb_brlock(tdb, TDB_SEQNUM_OFS, F_UNLCK, F_SETLKW, 1, 1); +} + +static int tdb_key_compare(TDB_DATA key, TDB_DATA data, void *private_data) +{ + return memcmp(data.dptr, key.dptr, data.dsize); +} + +/* Returns 0 on fail. On success, return offset of record, and fills + in rec */ +static tdb_off_t tdb_find(struct tdb_context *tdb, TDB_DATA key, u32 hash, + struct list_struct *r) +{ + tdb_off_t rec_ptr; + + /* read in the hash top */ + if (tdb_ofs_read(tdb, TDB_HASH_TOP(hash), &rec_ptr) == -1) + return 0; + + /* keep looking until we find the right record */ + while (rec_ptr) { + if (tdb_rec_read(tdb, rec_ptr, r) == -1) + return 0; + + if (!TDB_DEAD(r) && hash==r->full_hash + && key.dsize==r->key_len + && tdb_parse_data(tdb, key, rec_ptr + sizeof(*r), + r->key_len, tdb_key_compare, + NULL) == 0) { + return rec_ptr; + } + rec_ptr = r->next; + } + return TDB_ERRCODE(TDB_ERR_NOEXIST, 0); +} + +/* As tdb_find, but if you succeed, keep the lock */ +tdb_off_t tdb_find_lock_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash, int locktype, + struct list_struct *rec) +{ + u32 rec_ptr; + + if (tdb_lock(tdb, BUCKET(hash), locktype) == -1) + return 0; + if (!(rec_ptr = tdb_find(tdb, key, hash, rec))) + tdb_unlock(tdb, BUCKET(hash), locktype); + return rec_ptr; +} + + +/* update an entry in place - this only works if the new data size + is <= the old data size and the key exists. + on failure return -1. +*/ +static int tdb_update_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash, TDB_DATA dbuf) +{ + struct list_struct rec; + tdb_off_t rec_ptr; + + /* find entry */ + if (!(rec_ptr = tdb_find(tdb, key, hash, &rec))) + return -1; + + /* must be long enough key, data and tailer */ + if (rec.rec_len < key.dsize + dbuf.dsize + sizeof(tdb_off_t)) { + tdb->ecode = TDB_SUCCESS; /* Not really an error */ + return -1; + } + + if (tdb->methods->tdb_write(tdb, rec_ptr + sizeof(rec) + rec.key_len, + dbuf.dptr, dbuf.dsize) == -1) + return -1; + + if (dbuf.dsize != rec.data_len) { + /* update size */ + rec.data_len = dbuf.dsize; + return tdb_rec_write(tdb, rec_ptr, &rec); + } + + return 0; +} + +/* find an entry in the database given a key */ +/* If an entry doesn't exist tdb_err will be set to + * TDB_ERR_NOEXIST. If a key has no data attached + * then the TDB_DATA will have zero length but + * a non-zero pointer + */ +TDB_DATA tdb_fetch(struct tdb_context *tdb, TDB_DATA key) +{ + tdb_off_t rec_ptr; + struct list_struct rec; + TDB_DATA ret; + u32 hash; + + /* find which hash bucket it is in */ + hash = tdb->hash_fn(&key); + if (!(rec_ptr = tdb_find_lock_hash(tdb,key,hash,F_RDLCK,&rec))) + return tdb_null; + + ret.dptr = tdb_alloc_read(tdb, rec_ptr + sizeof(rec) + rec.key_len, + rec.data_len); + ret.dsize = rec.data_len; + tdb_unlock(tdb, BUCKET(rec.full_hash), F_RDLCK); + return ret; +} + +/* + * Find an entry in the database and hand the record's data to a parsing + * function. The parsing function is executed under the chain read lock, so it + * should be fast and should not block on other syscalls. + * + * DONT CALL OTHER TDB CALLS FROM THE PARSER, THIS MIGHT LEAD TO SEGFAULTS. + * + * For mmapped tdb's that do not have a transaction open it points the parsing + * function directly at the mmap area, it avoids the malloc/memcpy in this + * case. If a transaction is open or no mmap is available, it has to do + * malloc/read/parse/free. + * + * This is interesting for all readers of potentially large data structures in + * the tdb records, ldb indexes being one example. + */ + +int tdb_parse_record(struct tdb_context *tdb, TDB_DATA key, + int (*parser)(TDB_DATA key, TDB_DATA data, + void *private_data), + void *private_data) +{ + tdb_off_t rec_ptr; + struct list_struct rec; + int ret; + u32 hash; + + /* find which hash bucket it is in */ + hash = tdb->hash_fn(&key); + + if (!(rec_ptr = tdb_find_lock_hash(tdb,key,hash,F_RDLCK,&rec))) { + return TDB_ERRCODE(TDB_ERR_NOEXIST, 0); + } + + ret = tdb_parse_data(tdb, key, rec_ptr + sizeof(rec) + rec.key_len, + rec.data_len, parser, private_data); + + tdb_unlock(tdb, BUCKET(rec.full_hash), F_RDLCK); + + return ret; +} + +/* check if an entry in the database exists + + note that 1 is returned if the key is found and 0 is returned if not found + this doesn't match the conventions in the rest of this module, but is + compatible with gdbm +*/ +static int tdb_exists_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash) +{ + struct list_struct rec; + + if (tdb_find_lock_hash(tdb, key, hash, F_RDLCK, &rec) == 0) + return 0; + tdb_unlock(tdb, BUCKET(rec.full_hash), F_RDLCK); + return 1; +} + +int tdb_exists(struct tdb_context *tdb, TDB_DATA key) +{ + u32 hash = tdb->hash_fn(&key); + return tdb_exists_hash(tdb, key, hash); +} + +/* actually delete an entry in the database given the offset */ +int tdb_do_delete(struct tdb_context *tdb, tdb_off_t rec_ptr, struct list_struct*rec) +{ + tdb_off_t last_ptr, i; + struct list_struct lastrec; + + if (tdb->read_only || tdb->traverse_read) return -1; + + if (tdb_write_lock_record(tdb, rec_ptr) == -1) { + /* Someone traversing here: mark it as dead */ + rec->magic = TDB_DEAD_MAGIC; + return tdb_rec_write(tdb, rec_ptr, rec); + } + if (tdb_write_unlock_record(tdb, rec_ptr) != 0) + return -1; + + /* find previous record in hash chain */ + if (tdb_ofs_read(tdb, TDB_HASH_TOP(rec->full_hash), &i) == -1) + return -1; + for (last_ptr = 0; i != rec_ptr; last_ptr = i, i = lastrec.next) + if (tdb_rec_read(tdb, i, &lastrec) == -1) + return -1; + + /* unlink it: next ptr is at start of record. */ + if (last_ptr == 0) + last_ptr = TDB_HASH_TOP(rec->full_hash); + if (tdb_ofs_write(tdb, last_ptr, &rec->next) == -1) + return -1; + + /* recover the space */ + if (tdb_free(tdb, rec_ptr, rec) == -1) + return -1; + return 0; +} + +static int tdb_count_dead(struct tdb_context *tdb, u32 hash) +{ + int res = 0; + tdb_off_t rec_ptr; + struct list_struct rec; + + /* read in the hash top */ + if (tdb_ofs_read(tdb, TDB_HASH_TOP(hash), &rec_ptr) == -1) + return 0; + + while (rec_ptr) { + if (tdb_rec_read(tdb, rec_ptr, &rec) == -1) + return 0; + + if (rec.magic == TDB_DEAD_MAGIC) { + res += 1; + } + rec_ptr = rec.next; + } + return res; +} + +/* + * Purge all DEAD records from a hash chain + */ +static int tdb_purge_dead(struct tdb_context *tdb, u32 hash) +{ + int res = -1; + struct list_struct rec; + tdb_off_t rec_ptr; + + if (tdb_lock(tdb, -1, F_WRLCK) == -1) { + return -1; + } + + /* read in the hash top */ + if (tdb_ofs_read(tdb, TDB_HASH_TOP(hash), &rec_ptr) == -1) + goto fail; + + while (rec_ptr) { + tdb_off_t next; + + if (tdb_rec_read(tdb, rec_ptr, &rec) == -1) { + goto fail; + } + + next = rec.next; + + if (rec.magic == TDB_DEAD_MAGIC + && tdb_do_delete(tdb, rec_ptr, &rec) == -1) { + goto fail; + } + rec_ptr = next; + } + res = 0; + fail: + tdb_unlock(tdb, -1, F_WRLCK); + return res; +} + +/* delete an entry in the database given a key */ +static int tdb_delete_hash(struct tdb_context *tdb, TDB_DATA key, u32 hash) +{ + tdb_off_t rec_ptr; + struct list_struct rec; + int ret; + + if (tdb->max_dead_records != 0) { + + /* + * Allow for some dead records per hash chain, mainly for + * tdb's with a very high create/delete rate like locking.tdb. + */ + + if (tdb_lock(tdb, BUCKET(hash), F_WRLCK) == -1) + return -1; + + if (tdb_count_dead(tdb, hash) >= tdb->max_dead_records) { + /* + * Don't let the per-chain freelist grow too large, + * delete all existing dead records + */ + tdb_purge_dead(tdb, hash); + } + + if (!(rec_ptr = tdb_find(tdb, key, hash, &rec))) { + tdb_unlock(tdb, BUCKET(hash), F_WRLCK); + return -1; + } + + /* + * Just mark the record as dead. + */ + rec.magic = TDB_DEAD_MAGIC; + ret = tdb_rec_write(tdb, rec_ptr, &rec); + } + else { + if (!(rec_ptr = tdb_find_lock_hash(tdb, key, hash, F_WRLCK, + &rec))) + return -1; + + ret = tdb_do_delete(tdb, rec_ptr, &rec); + } + + if (ret == 0) { + tdb_increment_seqnum(tdb); + } + + if (tdb_unlock(tdb, BUCKET(rec.full_hash), F_WRLCK) != 0) + TDB_LOG((tdb, TDB_DEBUG_WARNING, "tdb_delete: WARNING tdb_unlock failed!\n")); + return ret; +} + +int tdb_delete(struct tdb_context *tdb, TDB_DATA key) +{ + u32 hash = tdb->hash_fn(&key); + return tdb_delete_hash(tdb, key, hash); +} + +/* + * See if we have a dead record around with enough space + */ +static tdb_off_t tdb_find_dead(struct tdb_context *tdb, u32 hash, + struct list_struct *r, tdb_len_t length) +{ + tdb_off_t rec_ptr; + + /* read in the hash top */ + if (tdb_ofs_read(tdb, TDB_HASH_TOP(hash), &rec_ptr) == -1) + return 0; + + /* keep looking until we find the right record */ + while (rec_ptr) { + if (tdb_rec_read(tdb, rec_ptr, r) == -1) + return 0; + + if (TDB_DEAD(r) && r->rec_len >= length) { + /* + * First fit for simple coding, TODO: change to best + * fit + */ + return rec_ptr; + } + rec_ptr = r->next; + } + return 0; +} + +/* store an element in the database, replacing any existing element + with the same key + + return 0 on success, -1 on failure +*/ +int tdb_store(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, int flag) +{ + struct list_struct rec; + u32 hash; + tdb_off_t rec_ptr; + char *p = NULL; + int ret = -1; + + if (tdb->read_only || tdb->traverse_read) { + tdb->ecode = TDB_ERR_RDONLY; + return -1; + } + + /* find which hash bucket it is in */ + hash = tdb->hash_fn(&key); + if (tdb_lock(tdb, BUCKET(hash), F_WRLCK) == -1) + return -1; + + /* check for it existing, on insert. */ + if (flag == TDB_INSERT) { + if (tdb_exists_hash(tdb, key, hash)) { + tdb->ecode = TDB_ERR_EXISTS; + goto fail; + } + } else { + /* first try in-place update, on modify or replace. */ + if (tdb_update_hash(tdb, key, hash, dbuf) == 0) { + goto done; + } + if (tdb->ecode == TDB_ERR_NOEXIST && + flag == TDB_MODIFY) { + /* if the record doesn't exist and we are in TDB_MODIFY mode then + we should fail the store */ + goto fail; + } + } + /* reset the error code potentially set by the tdb_update() */ + tdb->ecode = TDB_SUCCESS; + + /* delete any existing record - if it doesn't exist we don't + care. Doing this first reduces fragmentation, and avoids + coalescing with `allocated' block before it's updated. */ + if (flag != TDB_INSERT) + tdb_delete_hash(tdb, key, hash); + + /* Copy key+value *before* allocating free space in case malloc + fails and we are left with a dead spot in the tdb. */ + + if (!(p = (char *)malloc(key.dsize + dbuf.dsize))) { + tdb->ecode = TDB_ERR_OOM; + goto fail; + } + + memcpy(p, key.dptr, key.dsize); + if (dbuf.dsize) + memcpy(p+key.dsize, dbuf.dptr, dbuf.dsize); + + if (tdb->max_dead_records != 0) { + /* + * Allow for some dead records per hash chain, look if we can + * find one that can hold the new record. We need enough space + * for key, data and tailer. If we find one, we don't have to + * consult the central freelist. + */ + rec_ptr = tdb_find_dead( + tdb, hash, &rec, + key.dsize + dbuf.dsize + sizeof(tdb_off_t)); + + if (rec_ptr != 0) { + rec.key_len = key.dsize; + rec.data_len = dbuf.dsize; + rec.full_hash = hash; + rec.magic = TDB_MAGIC; + if (tdb_rec_write(tdb, rec_ptr, &rec) == -1 + || tdb->methods->tdb_write( + tdb, rec_ptr + sizeof(rec), + p, key.dsize + dbuf.dsize) == -1) { + goto fail; + } + goto done; + } + } + + /* + * We have to allocate some space from the freelist, so this means we + * have to lock it. Use the chance to purge all the DEAD records from + * the hash chain under the freelist lock. + */ + + if (tdb_lock(tdb, -1, F_WRLCK) == -1) { + goto fail; + } + + if ((tdb->max_dead_records != 0) + && (tdb_purge_dead(tdb, hash) == -1)) { + tdb_unlock(tdb, -1, F_WRLCK); + goto fail; + } + + /* we have to allocate some space */ + rec_ptr = tdb_allocate(tdb, key.dsize + dbuf.dsize, &rec); + + tdb_unlock(tdb, -1, F_WRLCK); + + if (rec_ptr == 0) { + goto fail; + } + + /* Read hash top into next ptr */ + if (tdb_ofs_read(tdb, TDB_HASH_TOP(hash), &rec.next) == -1) + goto fail; + + rec.key_len = key.dsize; + rec.data_len = dbuf.dsize; + rec.full_hash = hash; + rec.magic = TDB_MAGIC; + + /* write out and point the top of the hash chain at it */ + if (tdb_rec_write(tdb, rec_ptr, &rec) == -1 + || tdb->methods->tdb_write(tdb, rec_ptr+sizeof(rec), p, key.dsize+dbuf.dsize)==-1 + || tdb_ofs_write(tdb, TDB_HASH_TOP(hash), &rec_ptr) == -1) { + /* Need to tdb_unallocate() here */ + goto fail; + } + + done: + ret = 0; + fail: + if (ret == 0) { + tdb_increment_seqnum(tdb); + } + + SAFE_FREE(p); + tdb_unlock(tdb, BUCKET(hash), F_WRLCK); + return ret; +} + + +/* Append to an entry. Create if not exist. */ +int tdb_append(struct tdb_context *tdb, TDB_DATA key, TDB_DATA new_dbuf) +{ + u32 hash; + TDB_DATA dbuf; + int ret = -1; + + /* find which hash bucket it is in */ + hash = tdb->hash_fn(&key); + if (tdb_lock(tdb, BUCKET(hash), F_WRLCK) == -1) + return -1; + + dbuf = tdb_fetch(tdb, key); + + if (dbuf.dptr == NULL) { + dbuf.dptr = (unsigned char *)malloc(new_dbuf.dsize); + } else { + unsigned char *new_dptr = (unsigned char *)realloc(dbuf.dptr, + dbuf.dsize + new_dbuf.dsize); + if (new_dptr == NULL) { + free(dbuf.dptr); + } + dbuf.dptr = new_dptr; + } + + if (dbuf.dptr == NULL) { + tdb->ecode = TDB_ERR_OOM; + goto failed; + } + + memcpy(dbuf.dptr + dbuf.dsize, new_dbuf.dptr, new_dbuf.dsize); + dbuf.dsize += new_dbuf.dsize; + + ret = tdb_store(tdb, key, dbuf, 0); + +failed: + tdb_unlock(tdb, BUCKET(hash), F_WRLCK); + SAFE_FREE(dbuf.dptr); + return ret; +} + + +/* + return the name of the current tdb file + useful for external logging functions +*/ +const char *tdb_name(struct tdb_context *tdb) +{ + return tdb->name; +} + +/* + return the underlying file descriptor being used by tdb, or -1 + useful for external routines that want to check the device/inode + of the fd +*/ +int tdb_fd(struct tdb_context *tdb) +{ + return tdb->fd; +} + +/* + return the current logging function + useful for external tdb routines that wish to log tdb errors +*/ +tdb_log_func tdb_log_fn(struct tdb_context *tdb) +{ + return tdb->log.log_fn; +} + + +/* + get the tdb sequence number. Only makes sense if the writers opened + with TDB_SEQNUM set. Note that this sequence number will wrap quite + quickly, so it should only be used for a 'has something changed' + test, not for code that relies on the count of the number of changes + made. If you want a counter then use a tdb record. + + The aim of this sequence number is to allow for a very lightweight + test of a possible tdb change. +*/ +int tdb_get_seqnum(struct tdb_context *tdb) +{ + tdb_off_t seqnum=0; + + tdb_ofs_read(tdb, TDB_SEQNUM_OFS, &seqnum); + return seqnum; +} + +int tdb_hash_size(struct tdb_context *tdb) +{ + return tdb->header.hash_size; +} + +size_t tdb_map_size(struct tdb_context *tdb) +{ + return tdb->map_size; +} + +int tdb_get_flags(struct tdb_context *tdb) +{ + return tdb->flags; +} + + +/* + enable sequence number handling on an open tdb +*/ +void tdb_enable_seqnum(struct tdb_context *tdb) +{ + tdb->flags |= TDB_SEQNUM; +} + +/* file: open.c */ + +/* all contexts, to ensure no double-opens (fcntl locks don't nest!) */ +static struct tdb_context *tdbs = NULL; + + +/* This is based on the hash algorithm from gdbm */ +static unsigned int default_tdb_hash(TDB_DATA *key) +{ + u32 value; /* Used to compute the hash value. */ + u32 i; /* Used to cycle through random values. */ + + /* Set the initial value from the key size. */ + for (value = 0x238F13AF * key->dsize, i=0; i < key->dsize; i++) + value = (value + (key->dptr[i] << (i*5 % 24))); + + return (1103515243 * value + 12345); +} + + +/* initialise a new database with a specified hash size */ +static int tdb_new_database(struct tdb_context *tdb, int hash_size) +{ + struct tdb_header *newdb; + int size, ret = -1; + + /* We make it up in memory, then write it out if not internal */ + size = sizeof(struct tdb_header) + (hash_size+1)*sizeof(tdb_off_t); + if (!(newdb = (struct tdb_header *)calloc(size, 1))) + return TDB_ERRCODE(TDB_ERR_OOM, -1); + + /* Fill in the header */ + newdb->version = TDB_VERSION; + newdb->hash_size = hash_size; + if (tdb->flags & TDB_INTERNAL) { + tdb->map_size = size; + tdb->map_ptr = (char *)newdb; + memcpy(&tdb->header, newdb, sizeof(tdb->header)); + /* Convert the `ondisk' version if asked. */ + CONVERT(*newdb); + return 0; + } + if (lseek(tdb->fd, 0, SEEK_SET) == -1) + goto fail; + + if (ftruncate(tdb->fd, 0) == -1) + goto fail; + + /* This creates an endian-converted header, as if read from disk */ + CONVERT(*newdb); + memcpy(&tdb->header, newdb, sizeof(tdb->header)); + /* Don't endian-convert the magic food! */ + memcpy(newdb->magic_food, TDB_MAGIC_FOOD, strlen(TDB_MAGIC_FOOD)+1); + if (write(tdb->fd, newdb, size) != size) { + ret = -1; + } else { + ret = 0; + } + + fail: + SAFE_FREE(newdb); + return ret; +} + + + +static int tdb_already_open(dev_t device, + ino_t ino) +{ + struct tdb_context *i; + + for (i = tdbs; i; i = i->next) { + if (i->device == device && i->inode == ino) { + return 1; + } + } + + return 0; +} + +/* open the database, creating it if necessary + + The open_flags and mode are passed straight to the open call on the + database file. A flags value of O_WRONLY is invalid. The hash size + is advisory, use zero for a default value. + + Return is NULL on error, in which case errno is also set. Don't + try to call tdb_error or tdb_errname, just do strerror(errno). + + @param name may be NULL for internal databases. */ +struct tdb_context *tdb_open(const char *name, int hash_size, int tdb_flags, + int open_flags, mode_t mode) +{ + return tdb_open_ex(name, hash_size, tdb_flags, open_flags, mode, NULL, NULL); +} + +/* a default logging function */ +static void null_log_fn(struct tdb_context *tdb, enum tdb_debug_level level, const char *fmt, ...) PRINTF_ATTRIBUTE(3, 4); +static void null_log_fn(struct tdb_context *tdb, enum tdb_debug_level level, const char *fmt, ...) +{ +} + + +struct tdb_context *tdb_open_ex(const char *name, int hash_size, int tdb_flags, + int open_flags, mode_t mode, + const struct tdb_logging_context *log_ctx, + tdb_hash_func hash_fn) +{ + struct tdb_context *tdb; + struct stat st; + int rev = 0, locked = 0; + unsigned char *vp; + u32 vertest; + + if (!(tdb = (struct tdb_context *)calloc(1, sizeof *tdb))) { + /* Can't log this */ + errno = ENOMEM; + goto fail; + } + tdb_io_init(tdb); + tdb->fd = -1; + tdb->name = NULL; + tdb->map_ptr = NULL; + tdb->flags = tdb_flags; + tdb->open_flags = open_flags; + if (log_ctx) { + tdb->log = *log_ctx; + } else { + tdb->log.log_fn = null_log_fn; + tdb->log.log_private = NULL; + } + tdb->hash_fn = hash_fn ? hash_fn : default_tdb_hash; + + /* cache the page size */ + tdb->page_size = getpagesize(); + if (tdb->page_size <= 0) { + tdb->page_size = 0x2000; + } + + if ((open_flags & O_ACCMODE) == O_WRONLY) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: can't open tdb %s write-only\n", + name)); + errno = EINVAL; + goto fail; + } + + if (hash_size == 0) + hash_size = DEFAULT_HASH_SIZE; + if ((open_flags & O_ACCMODE) == O_RDONLY) { + tdb->read_only = 1; + /* read only databases don't do locking or clear if first */ + tdb->flags |= TDB_NOLOCK; + tdb->flags &= ~TDB_CLEAR_IF_FIRST; + } + + /* internal databases don't mmap or lock, and start off cleared */ + if (tdb->flags & TDB_INTERNAL) { + tdb->flags |= (TDB_NOLOCK | TDB_NOMMAP); + tdb->flags &= ~TDB_CLEAR_IF_FIRST; + if (tdb_new_database(tdb, hash_size) != 0) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: tdb_new_database failed!")); + goto fail; + } + goto internal; + } + + if ((tdb->fd = open(name, open_flags, mode)) == -1) { + TDB_LOG((tdb, TDB_DEBUG_WARNING, "tdb_open_ex: could not open file %s: %s\n", + name, strerror(errno))); + goto fail; /* errno set by open(2) */ + } + + /* ensure there is only one process initialising at once */ + if (tdb->methods->tdb_brlock(tdb, GLOBAL_LOCK, F_WRLCK, F_SETLKW, 0, 1) == -1) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: failed to get global lock on %s: %s\n", + name, strerror(errno))); + goto fail; /* errno set by tdb_brlock */ + } + + /* we need to zero database if we are the only one with it open */ + if ((tdb_flags & TDB_CLEAR_IF_FIRST) && + (locked = (tdb->methods->tdb_brlock(tdb, ACTIVE_LOCK, F_WRLCK, F_SETLK, 0, 1) == 0))) { + open_flags |= O_CREAT; + if (ftruncate(tdb->fd, 0) == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_open_ex: " + "failed to truncate %s: %s\n", + name, strerror(errno))); + goto fail; /* errno set by ftruncate */ + } + } + + if (read(tdb->fd, &tdb->header, sizeof(tdb->header)) != sizeof(tdb->header) + || strcmp(tdb->header.magic_food, TDB_MAGIC_FOOD) != 0 + || (tdb->header.version != TDB_VERSION + && !(rev = (tdb->header.version==TDB_BYTEREV(TDB_VERSION))))) { + /* its not a valid database - possibly initialise it */ + if (!(open_flags & O_CREAT) || tdb_new_database(tdb, hash_size) == -1) { + errno = EIO; /* ie bad format or something */ + goto fail; + } + rev = (tdb->flags & TDB_CONVERT); + } + vp = (unsigned char *)&tdb->header.version; + vertest = (((u32)vp[0]) << 24) | (((u32)vp[1]) << 16) | + (((u32)vp[2]) << 8) | (u32)vp[3]; + tdb->flags |= (vertest==TDB_VERSION) ? TDB_BIGENDIAN : 0; + if (!rev) + tdb->flags &= ~TDB_CONVERT; + else { + tdb->flags |= TDB_CONVERT; + tdb_convert(&tdb->header, sizeof(tdb->header)); + } + if (fstat(tdb->fd, &st) == -1) + goto fail; + + if (tdb->header.rwlocks != 0) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: spinlocks no longer supported\n")); + goto fail; + } + + /* Is it already in the open list? If so, fail. */ + if (tdb_already_open(st.st_dev, st.st_ino)) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: " + "%s (%d,%d) is already open in this process\n", + name, (int)st.st_dev, (int)st.st_ino)); + errno = EBUSY; + goto fail; + } + + if (!(tdb->name = (char *)strdup(name))) { + errno = ENOMEM; + goto fail; + } + + tdb->map_size = st.st_size; + tdb->device = st.st_dev; + tdb->inode = st.st_ino; + tdb->max_dead_records = 0; + tdb_mmap(tdb); + if (locked) { + if (tdb->methods->tdb_brlock(tdb, ACTIVE_LOCK, F_UNLCK, F_SETLK, 0, 1) == -1) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: " + "failed to take ACTIVE_LOCK on %s: %s\n", + name, strerror(errno))); + goto fail; + } + + } + + /* We always need to do this if the CLEAR_IF_FIRST flag is set, even if + we didn't get the initial exclusive lock as we need to let all other + users know we're using it. */ + + if (tdb_flags & TDB_CLEAR_IF_FIRST) { + /* leave this lock in place to indicate it's in use */ + if (tdb->methods->tdb_brlock(tdb, ACTIVE_LOCK, F_RDLCK, F_SETLKW, 0, 1) == -1) + goto fail; + } + + /* if needed, run recovery */ + if (tdb_transaction_recover(tdb) == -1) { + goto fail; + } + + internal: + /* Internal (memory-only) databases skip all the code above to + * do with disk files, and resume here by releasing their + * global lock and hooking into the active list. */ + if (tdb->methods->tdb_brlock(tdb, GLOBAL_LOCK, F_UNLCK, F_SETLKW, 0, 1) == -1) + goto fail; + tdb->next = tdbs; + tdbs = tdb; + return tdb; + + fail: + { int save_errno = errno; + + if (!tdb) + return NULL; + + if (tdb->map_ptr) { + if (tdb->flags & TDB_INTERNAL) + SAFE_FREE(tdb->map_ptr); + else + tdb_munmap(tdb); + } + SAFE_FREE(tdb->name); + if (tdb->fd != -1) + if (close(tdb->fd) != 0) + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_open_ex: failed to close tdb->fd on error!\n")); + SAFE_FREE(tdb); + errno = save_errno; + return NULL; + } +} + +/* + * Set the maximum number of dead records per hash chain + */ + +void tdb_set_max_dead(struct tdb_context *tdb, int max_dead) +{ + tdb->max_dead_records = max_dead; +} + +/** + * Close a database. + * + * @returns -1 for error; 0 for success. + **/ +int tdb_close(struct tdb_context *tdb) +{ + struct tdb_context **i; + int ret = 0; + + if (tdb->transaction) { + tdb_transaction_cancel(tdb); + } + + if (tdb->map_ptr) { + if (tdb->flags & TDB_INTERNAL) + SAFE_FREE(tdb->map_ptr); + else + tdb_munmap(tdb); + } + SAFE_FREE(tdb->name); + if (tdb->fd != -1) + ret = close(tdb->fd); + SAFE_FREE(tdb->lockrecs); + + /* Remove from contexts list */ + for (i = &tdbs; *i; i = &(*i)->next) { + if (*i == tdb) { + *i = tdb->next; + break; + } + } + + memset(tdb, 0, sizeof(*tdb)); + SAFE_FREE(tdb); + + return ret; +} + +/* register a loging function */ +void tdb_set_logging_function(struct tdb_context *tdb, + const struct tdb_logging_context *log_ctx) +{ + tdb->log = *log_ctx; +} + +void *tdb_get_logging_private(struct tdb_context *tdb) +{ + return tdb->log.log_private; +} + +/* reopen a tdb - this can be used after a fork to ensure that we have an independent + seek pointer from our parent and to re-establish locks */ +int tdb_reopen(struct tdb_context *tdb) +{ + struct stat st; + + if (tdb->flags & TDB_INTERNAL) { + return 0; /* Nothing to do. */ + } + + if (tdb->num_locks != 0 || tdb->global_lock.count) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_reopen: reopen not allowed with locks held\n")); + goto fail; + } + + if (tdb->transaction != 0) { + TDB_LOG((tdb, TDB_DEBUG_ERROR, "tdb_reopen: reopen not allowed inside a transaction\n")); + goto fail; + } + + if (tdb_munmap(tdb) != 0) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: munmap failed (%s)\n", strerror(errno))); + goto fail; + } + if (close(tdb->fd) != 0) + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: WARNING closing tdb->fd failed!\n")); + tdb->fd = open(tdb->name, tdb->open_flags & ~(O_CREAT|O_TRUNC), 0); + if (tdb->fd == -1) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: open failed (%s)\n", strerror(errno))); + goto fail; + } + if ((tdb->flags & TDB_CLEAR_IF_FIRST) && + (tdb->methods->tdb_brlock(tdb, ACTIVE_LOCK, F_RDLCK, F_SETLKW, 0, 1) == -1)) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: failed to obtain active lock\n")); + goto fail; + } + if (fstat(tdb->fd, &st) != 0) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: fstat failed (%s)\n", strerror(errno))); + goto fail; + } + if (st.st_ino != tdb->inode || st.st_dev != tdb->device) { + TDB_LOG((tdb, TDB_DEBUG_FATAL, "tdb_reopen: file dev/inode has changed!\n")); + goto fail; + } + tdb_mmap(tdb); + + return 0; + +fail: + tdb_close(tdb); + return -1; +} + +/* reopen all tdb's */ +int tdb_reopen_all(int parent_longlived) +{ + struct tdb_context *tdb; + + for (tdb=tdbs; tdb; tdb = tdb->next) { + /* + * If the parent is longlived (ie. a + * parent daemon architecture), we know + * it will keep it's active lock on a + * tdb opened with CLEAR_IF_FIRST. Thus + * for child processes we don't have to + * add an active lock. This is essential + * to improve performance on systems that + * keep POSIX locks as a non-scalable data + * structure in the kernel. + */ + if (parent_longlived) { + /* Ensure no clear-if-first. */ + tdb->flags &= ~TDB_CLEAR_IF_FIRST; + } + + if (tdb_reopen(tdb) != 0) + return -1; + } + + return 0; +} diff --git a/portlibs/sources/libext2fs/source/tdb.h b/portlibs/sources/libext2fs/source/tdb.h new file mode 100644 index 00000000..bfcd9436 --- /dev/null +++ b/portlibs/sources/libext2fs/source/tdb.h @@ -0,0 +1,215 @@ +#ifndef __TDB_H__ +#define __TDB_H__ + +/* + Unix SMB/CIFS implementation. + + trivial database library + + Copyright (C) Andrew Tridgell 1999-2004 + + ** NOTE! The following LGPL license applies to the tdb + ** library. This does NOT imply that all of Samba is released + ** under the LGPL + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2 of the License, or (at your option) any later version. + + This library 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 + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA +*/ + +#ifdef __cplusplus +extern "C" { +#endif + + +/* flags to tdb_store() */ +#define TDB_REPLACE 1 +#define TDB_INSERT 2 +#define TDB_MODIFY 3 + +/* flags for tdb_open() */ +#define TDB_DEFAULT 0 /* just a readability place holder */ +#define TDB_CLEAR_IF_FIRST 1 +#define TDB_INTERNAL 2 /* don't store on disk */ +#define TDB_NOLOCK 4 /* don't do any locking */ +#define TDB_NOMMAP 8 /* don't use mmap */ +#define TDB_CONVERT 16 /* convert endian (internal use) */ +#define TDB_BIGENDIAN 32 /* header is big-endian (internal use) */ +#define TDB_NOSYNC 64 /* don't use synchronous transactions */ +#define TDB_SEQNUM 128 /* maintain a sequence number */ + +#define TDB_ERRCODE(code, ret) ((tdb->ecode = (code)), ret) + +/* error codes */ +enum TDB_ERROR {TDB_SUCCESS=0, TDB_ERR_CORRUPT, TDB_ERR_IO, TDB_ERR_LOCK, + TDB_ERR_OOM, TDB_ERR_EXISTS, TDB_ERR_NOLOCK, TDB_ERR_LOCK_TIMEOUT, + TDB_ERR_NOEXIST, TDB_ERR_EINVAL, TDB_ERR_RDONLY}; + +/* debugging uses one of the following levels */ +enum tdb_debug_level {TDB_DEBUG_FATAL = 0, TDB_DEBUG_ERROR, + TDB_DEBUG_WARNING, TDB_DEBUG_TRACE}; + +typedef struct TDB_DATA { + unsigned char *dptr; + size_t dsize; +} TDB_DATA; + +#ifndef PRINTF_ATTRIBUTE +#if (__GNUC__ >= 3) +/** Use gcc attribute to check printf fns. a1 is the 1-based index of + * the parameter containing the format, and a2 the index of the first + * argument. Note that some gcc 2.x versions don't handle this + * properly **/ +#define PRINTF_ATTRIBUTE(a1, a2) __attribute__ ((format (__printf__, a1, a2))) +#else +#define PRINTF_ATTRIBUTE(a1, a2) +#endif +#endif + +/* ext2fs tdb renames */ +#define tdb_open ext2fs_tdb_open +#define tdb_open_ex ext2fs_tdb_open_ex +#define tdb_set_max_dead ext2fs_tdb_set_max_dead +#define tdb_reopen ext2fs_tdb_reopen +#define tdb_reopen_all ext2fs_tdb_reopen_all +#define tdb_set_logging_function ext2fs_tdb_set_logging_function +#define tdb_error ext2fs_tdb_error +#define tdb_errorstr ext2fs_tdb_errorstr +#define tdb_fetch ext2fs_tdb_fetch +#define tdb_parse_record ext2fs_tdb_parse_record +#define tdb_delete ext2fs_tdb_delete +#define tdb_store ext2fs_tdb_store +#define tdb_append ext2fs_tdb_append +#define tdb_close ext2fs_tdb_close +#define tdb_firstkey ext2fs_tdb_firstkey +#define tdb_nextkey ext2fs_tdb_nextkey +#define tdb_traverse ext2fs_tdb_traverse +#define tdb_traverse_read ext2fs_tdb_traverse_read +#define tdb_exists ext2fs_tdb_exists +#define tdb_lockall ext2fs_tdb_lockall +#define tdb_unlockall ext2fs_tdb_unlockall +#define tdb_lockall_read ext2fs_tdb_lockall_read +#define tdb_unlockall_read ext2fs_tdb_unlockall_read +#define tdb_name ext2fs_tdb_name +#define tdb_fd ext2fs_tdb_fd +#define tdb_log_fn ext2fs_tdb_log_fn +#define tdb_get_logging_private ext2fs_tdb_get_logging_private +#define tdb_transaction_start ext2fs_tdb_transaction_start +#define tdb_transaction_commit ext2fs_tdb_transaction_commit +#define tdb_transaction_cancel ext2fs_tdb_transaction_cancel +#define tdb_transaction_recover ext2fs_tdb_transaction_recover +#define tdb_get_seqnum ext2fs_tdb_get_seqnum +#define tdb_hash_size ext2fs_tdb_hash_size +#define tdb_map_size ext2fs_tdb_map_size +#define tdb_get_flags ext2fs_tdb_get_flags +#define tdb_chainlock ext2fs_tdb_chainlock +#define tdb_chainunlock ext2fs_tdb_chainunlock +#define tdb_chainlock_read ext2fs_tdb_chainlock_read +#define tdb_chainunlock_read ext2fs_tdb_chainunlock_read +#define tdb_dump_all ext2fs_tdb_dump_all +#define tdb_printfreelist ext2fs_tdb_printfreelist +#define tdb_validate_freelist ext2fs_tdb_validate_freelist +#define tdb_chainlock_mark ext2fs_tdb_chainlock_mark +#define tdb_chainlock_nonblock ext2fs_tdb_chainlock_nonblock +#define tdb_chainlock_unmark ext2fs_tdb_chainlock_unmark +#define tdb_enable_seqnum ext2fs_tdb_enable_seqnum +#define tdb_increment_seqnum_nonblock ext2fs_tdb_increment_seqnum_nonblock +#define tdb_lock_nonblock ext2fs_tdb_lock_nonblock +#define tdb_lockall_mark ext2fs_tdb_lockall_mark +#define tdb_lockall_nonblock ext2fs_tdb_lockall_nonblock +#define tdb_lockall_read_nonblock ext2fs_tdb_lockall_read_nonblock +#define tdb_lockall_unmark ext2fs_tdb_lockall_unmark + +/* this is the context structure that is returned from a db open */ +typedef struct tdb_context TDB_CONTEXT; + +typedef int (*tdb_traverse_func)(struct tdb_context *, TDB_DATA, TDB_DATA, void *); +typedef void (*tdb_log_func)(struct tdb_context *, enum tdb_debug_level, const char *, ...) PRINTF_ATTRIBUTE(3, 4); +typedef unsigned int (*tdb_hash_func)(TDB_DATA *key); + +struct tdb_logging_context { + tdb_log_func log_fn; + void *log_private; +}; + +struct tdb_context *tdb_open(const char *name, int hash_size, int tdb_flags, + int open_flags, mode_t mode); +struct tdb_context *tdb_open_ex(const char *name, int hash_size, int tdb_flags, + int open_flags, mode_t mode, + const struct tdb_logging_context *log_ctx, + tdb_hash_func hash_fn); +void tdb_set_max_dead(struct tdb_context *tdb, int max_dead); + +int tdb_reopen(struct tdb_context *tdb); +int tdb_reopen_all(int parent_longlived); +void tdb_set_logging_function(struct tdb_context *tdb, const struct tdb_logging_context *log_ctx); +enum TDB_ERROR tdb_error(struct tdb_context *tdb); +const char *tdb_errorstr(struct tdb_context *tdb); +TDB_DATA tdb_fetch(struct tdb_context *tdb, TDB_DATA key); +int tdb_parse_record(struct tdb_context *tdb, TDB_DATA key, + int (*parser)(TDB_DATA key, TDB_DATA data, + void *private_data), + void *private_data); +int tdb_delete(struct tdb_context *tdb, TDB_DATA key); +int tdb_store(struct tdb_context *tdb, TDB_DATA key, TDB_DATA dbuf, int flag); +int tdb_append(struct tdb_context *tdb, TDB_DATA key, TDB_DATA new_dbuf); +int tdb_close(struct tdb_context *tdb); +TDB_DATA tdb_firstkey(struct tdb_context *tdb); +TDB_DATA tdb_nextkey(struct tdb_context *tdb, TDB_DATA key); +int tdb_traverse(struct tdb_context *tdb, tdb_traverse_func fn, void *); +int tdb_traverse_read(struct tdb_context *tdb, tdb_traverse_func fn, void *); +int tdb_exists(struct tdb_context *tdb, TDB_DATA key); +int tdb_lockall(struct tdb_context *tdb); +int tdb_lockall_nonblock(struct tdb_context *tdb); +int tdb_unlockall(struct tdb_context *tdb); +int tdb_lockall_read(struct tdb_context *tdb); +int tdb_lockall_read_nonblock(struct tdb_context *tdb); +int tdb_unlockall_read(struct tdb_context *tdb); +int tdb_lockall_mark(struct tdb_context *tdb); +int tdb_lockall_unmark(struct tdb_context *tdb); +const char *tdb_name(struct tdb_context *tdb); +int tdb_fd(struct tdb_context *tdb); +tdb_log_func tdb_log_fn(struct tdb_context *tdb); +void *tdb_get_logging_private(struct tdb_context *tdb); +int tdb_transaction_start(struct tdb_context *tdb); +int tdb_transaction_commit(struct tdb_context *tdb); +int tdb_transaction_cancel(struct tdb_context *tdb); +int tdb_transaction_recover(struct tdb_context *tdb); +int tdb_get_seqnum(struct tdb_context *tdb); +int tdb_hash_size(struct tdb_context *tdb); +size_t tdb_map_size(struct tdb_context *tdb); +int tdb_get_flags(struct tdb_context *tdb); +void tdb_enable_seqnum(struct tdb_context *tdb); +void tdb_increment_seqnum_nonblock(struct tdb_context *tdb); + +/* Low level locking functions: use with care */ +int tdb_chainlock(struct tdb_context *tdb, TDB_DATA key); +int tdb_chainlock_nonblock(struct tdb_context *tdb, TDB_DATA key); +int tdb_chainunlock(struct tdb_context *tdb, TDB_DATA key); +int tdb_chainlock_read(struct tdb_context *tdb, TDB_DATA key); +int tdb_chainunlock_read(struct tdb_context *tdb, TDB_DATA key); +int tdb_chainlock_mark(struct tdb_context *tdb, TDB_DATA key); +int tdb_chainlock_unmark(struct tdb_context *tdb, TDB_DATA key); + +/* Debug functions. Not used in production. */ +void tdb_dump_all(struct tdb_context *tdb); +int tdb_printfreelist(struct tdb_context *tdb); +int tdb_validate_freelist(struct tdb_context *tdb, int *pnum_entries); + +extern TDB_DATA tdb_null; + +#ifdef __cplusplus +} +#endif + +#endif /* tdb.h */ diff --git a/portlibs/sources/libext2fs/source/unlink.c b/portlibs/sources/libext2fs/source/unlink.c new file mode 100644 index 00000000..7ffeb9e8 --- /dev/null +++ b/portlibs/sources/libext2fs/source/unlink.c @@ -0,0 +1,99 @@ +/* + * unlink.c --- delete links in a ext2fs directory + * + * Copyright (C) 1993, 1994, 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#include <string.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif + +#include "ext2_fs.h" +#include "ext2fs.h" + +struct link_struct { + const char *name; + int namelen; + ext2_ino_t inode; + int flags; + struct ext2_dir_entry *prev; + int done; +}; + +#ifdef __TURBOC__ + #pragma argsused +#endif +static int unlink_proc(struct ext2_dir_entry *dirent, + int offset, + int blocksize EXT2FS_ATTR((unused)), + char *buf EXT2FS_ATTR((unused)), + void *priv_data) +{ + struct link_struct *ls = (struct link_struct *) priv_data; + struct ext2_dir_entry *prev; + + prev = ls->prev; + ls->prev = dirent; + + if (ls->name) { + if ((dirent->name_len & 0xFF) != ls->namelen) + return 0; + if (strncmp(ls->name, dirent->name, dirent->name_len & 0xFF)) + return 0; + } + if (ls->inode) { + if (dirent->inode != ls->inode) + return 0; + } else { + if (!dirent->inode) + return 0; + } + + if (offset) + prev->rec_len += dirent->rec_len; + else + dirent->inode = 0; + ls->done++; + return DIRENT_ABORT|DIRENT_CHANGED; +} + +#ifdef __TURBOC__ + #pragma argsused +#endif +errcode_t ext2fs_unlink(ext2_filsys fs, ext2_ino_t dir, + const char *name, ext2_ino_t ino, + int flags EXT2FS_ATTR((unused))) +{ + errcode_t retval; + struct link_struct ls; + + EXT2_CHECK_MAGIC(fs, EXT2_ET_MAGIC_EXT2FS_FILSYS); + + if (!name && !ino) + return EXT2_ET_INVALID_ARGUMENT; + + if (!(fs->flags & EXT2_FLAG_RW)) + return EXT2_ET_RO_FILSYS; + + ls.name = name; + ls.namelen = name ? strlen(name) : 0; + ls.inode = ino; + ls.flags = 0; + ls.done = 0; + ls.prev = 0; + + retval = ext2fs_dir_iterate(fs, dir, DIRENT_FLAG_INCLUDE_EMPTY, + 0, unlink_proc, &ls); + if (retval) + return retval; + + return (ls.done) ? 0 : EXT2_ET_DIR_NO_SPACE; +} + diff --git a/portlibs/sources/libext2fs/source/valid_blk.c b/portlibs/sources/libext2fs/source/valid_blk.c new file mode 100644 index 00000000..ec3edd88 --- /dev/null +++ b/portlibs/sources/libext2fs/source/valid_blk.c @@ -0,0 +1,55 @@ +/* + * valid_blk.c --- does the inode have valid blocks? + * + * Copyright 1997 by Theodore Ts'o + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <string.h> +#include <time.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +/* + * This function returns 1 if the inode's block entries actually + * contain block entries. + */ +int ext2fs_inode_has_valid_blocks(struct ext2_inode *inode) +{ + /* + * Only directories, regular files, and some symbolic links + * have valid block entries. + */ + if (!LINUX_S_ISDIR(inode->i_mode) && !LINUX_S_ISREG(inode->i_mode) && + !LINUX_S_ISLNK(inode->i_mode)) + return 0; + + /* + * If the symbolic link is a "fast symlink", then the symlink + * target is stored in the block entries. + */ + if (LINUX_S_ISLNK (inode->i_mode)) { + if (ext2fs_file_acl_block(inode) == 0) { + /* With no EA block, we can rely on i_blocks */ + if (inode->i_blocks == 0) + return 0; + } else { + /* With an EA block, life gets more tricky */ + if (inode->i_size >= EXT2_N_BLOCKS*4) + return 1; /* definitely using i_block[] */ + if (inode->i_size > 4 && inode->i_block[1] == 0) + return 1; /* definitely using i_block[] */ + return 0; /* Probably a fast symlink */ + } + } + return 1; +} diff --git a/portlibs/sources/libext2fs/source/version.c b/portlibs/sources/libext2fs/source/version.c new file mode 100644 index 00000000..e7f223bf --- /dev/null +++ b/portlibs/sources/libext2fs/source/version.c @@ -0,0 +1,54 @@ +/* + * version.c --- Return the version of the ext2 library + * + * Copyright (C) 1997 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#if HAVE_UNISTD_H +#include <unistd.h> +#endif +#include <string.h> +#include <stdio.h> +#include <ctype.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +static const char *lib_version = ""; +static const char *lib_date = ""; + +int ext2fs_parse_version_string(const char *ver_string) +{ + const char *cp; + int version = 0, dot_count = 0; + + for (cp = ver_string; *cp; cp++) { + if (*cp == '.') { + if (dot_count++) + break; + else + continue; + } + if (!isdigit((int)*cp)) + break; + version = (version * 10) + (*cp - '0'); + } + return version; +} + + +int ext2fs_get_library_version(const char **ver_string, + const char **date_string) +{ + if (ver_string) + *ver_string = lib_version; + if (date_string) + *date_string = lib_date; + + return ext2fs_parse_version_string(lib_version); +} diff --git a/portlibs/sources/libext2fs/source/write_bb_file.c b/portlibs/sources/libext2fs/source/write_bb_file.c new file mode 100644 index 00000000..70bcf08e --- /dev/null +++ b/portlibs/sources/libext2fs/source/write_bb_file.c @@ -0,0 +1,34 @@ +/* + * write_bb_file.c --- write a list of bad blocks to a FILE * + * + * Copyright (C) 1994, 1995 Theodore Ts'o. + * + * %Begin-Header% + * This file may be redistributed under the terms of the GNU Library + * General Public License, version 2. + * %End-Header% + */ + +#include <stdio.h> + +#include "ext2_fs.h" +#include "ext2fs.h" + +errcode_t ext2fs_write_bb_FILE(ext2_badblocks_list bb_list, + unsigned int flags EXT2FS_ATTR((unused)), + FILE *f) +{ + badblocks_iterate bb_iter; + blk_t blk; + errcode_t retval; + + retval = ext2fs_badblocks_list_iterate_begin(bb_list, &bb_iter); + if (retval) + return retval; + + while (ext2fs_badblocks_list_iterate(bb_iter, &blk)) { + fprintf(f, "%u\n", blk); + } + ext2fs_badblocks_list_iterate_end(bb_iter); + return 0; +} diff --git a/portlibs/sources/libfat/Makefile b/portlibs/sources/libfat/Makefile new file mode 100644 index 00000000..261f6d93 --- /dev/null +++ b/portlibs/sources/libfat/Makefile @@ -0,0 +1,32 @@ +# Quick'n'dirty makefile [BC] v2 + +ifeq ($(strip $(DEVKITPPC)),) +$(error "Please set DEVKITPPC in your environment. export DEVKITPPC=<path to>devkitPPC") +endif + +include $(DEVKITPPC)/wii_rules + +LIBOGC_INC := $(DEVKITPRO)/libogc/include +LIBOGC_LIB := $(DEVKITPRO)/libogc/lib/wii + +CFLAGS := -O3 $(MACHDEP) -I$(LIBOGC_INC) + +LIB := fat +CFILES := $(wildcard *.c) +OFILES := $(CFILES:.c=.o) +ARC := lib$(LIB).a +HDR := fat.h + +all : $(OFILES) + $(AR) -r $(ARC) $(OFILES) + +clean : + rm -f $(OFILES) $(ARC) + +install : + cp -f $(ARC) ../../lib + cp -f $(HDR) ../../include + cp -f fatfile_frag.h ../../include + +%.o : %.c + $(CC) $(CFLAGS) -c $< -o $@ diff --git a/portlibs/sources/libfat/bit_ops.h b/portlibs/sources/libfat/bit_ops.h new file mode 100644 index 00000000..762be0b3 --- /dev/null +++ b/portlibs/sources/libfat/bit_ops.h @@ -0,0 +1,57 @@ +/* + bit_ops.h + Functions for dealing with conversion of data between types + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _BIT_OPS_H +#define _BIT_OPS_H + +#include <stdint.h> + +/*----------------------------------------------------------------- +Functions to deal with little endian values stored in uint8_t arrays +-----------------------------------------------------------------*/ +static inline uint16_t u8array_to_u16 (const uint8_t* item, int offset) { + return ( item[offset] | (item[offset + 1] << 8)); +} + +static inline uint32_t u8array_to_u32 (const uint8_t* item, int offset) { + return ( item[offset] | (item[offset + 1] << 8) | (item[offset + 2] << 16) | (item[offset + 3] << 24)); +} + +static inline void u16_to_u8array (uint8_t* item, int offset, uint16_t value) { + item[offset] = (uint8_t) value; + item[offset + 1] = (uint8_t)(value >> 8); +} + +static inline void u32_to_u8array (uint8_t* item, int offset, uint32_t value) { + item[offset] = (uint8_t) value; + item[offset + 1] = (uint8_t)(value >> 8); + item[offset + 2] = (uint8_t)(value >> 16); + item[offset + 3] = (uint8_t)(value >> 24); +} + +#endif // _BIT_OPS_H diff --git a/portlibs/sources/libfat/cache.c b/portlibs/sources/libfat/cache.c new file mode 100644 index 00000000..07576b9c --- /dev/null +++ b/portlibs/sources/libfat/cache.c @@ -0,0 +1,323 @@ +/* + cache.c + The cache is not visible to the user. It should be flushed + when any file is closed or changes are made to the filesystem. + + This cache implements a least-used-page replacement policy. This will + distribute sectors evenly over the pages, so if less than the maximum + pages are used at once, they should all eventually remain in the cache. + This also has the benefit of throwing out old sectors, so as not to keep + too many stale pages around. + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#include <string.h> +#include <limits.h> + +#include "common.h" +#include "cache.h" +#include "disc.h" + +#include "mem_allocate.h" +#include "bit_ops.h" +#include "file_allocation_table.h" + +#define CACHE_FREE UINT_MAX + +CACHE* _FAT_cache_constructor (unsigned int numberOfPages, unsigned int sectorsPerPage, const DISC_INTERFACE* discInterface, sec_t endOfPartition, unsigned int bytesPerSector) { + CACHE* cache; + unsigned int i; + CACHE_ENTRY* cacheEntries; + + if (numberOfPages < 2) { + numberOfPages = 2; + } + + if (sectorsPerPage < 8) { + sectorsPerPage = 8; + } + + cache = (CACHE*) _FAT_mem_allocate (sizeof(CACHE)); + if (cache == NULL) { + return NULL; + } + + cache->disc = discInterface; + cache->endOfPartition = endOfPartition; + cache->numberOfPages = numberOfPages; + cache->sectorsPerPage = sectorsPerPage; + cache->bytesPerSector = bytesPerSector; + + + cacheEntries = (CACHE_ENTRY*) _FAT_mem_allocate ( sizeof(CACHE_ENTRY) * numberOfPages); + if (cacheEntries == NULL) { + _FAT_mem_free (cache); + return NULL; + } + + for (i = 0; i < numberOfPages; i++) { + cacheEntries[i].sector = CACHE_FREE; + cacheEntries[i].count = 0; + cacheEntries[i].last_access = 0; + cacheEntries[i].dirty = false; + cacheEntries[i].cache = (uint8_t*) _FAT_mem_align ( sectorsPerPage * bytesPerSector ); + } + + cache->cacheEntries = cacheEntries; + + return cache; +} + +void _FAT_cache_destructor (CACHE* cache) { + unsigned int i; + // Clear out cache before destroying it + _FAT_cache_flush(cache); + + // Free memory in reverse allocation order + for (i = 0; i < cache->numberOfPages; i++) { + _FAT_mem_free (cache->cacheEntries[i].cache); + } + _FAT_mem_free (cache->cacheEntries); + _FAT_mem_free (cache); +} + + +static u32 accessCounter = 0; + +static u32 accessTime(){ + accessCounter++; + return accessCounter; +} + + +static CACHE_ENTRY* _FAT_cache_getPage(CACHE *cache,sec_t sector) +{ + unsigned int i; + CACHE_ENTRY* cacheEntries = cache->cacheEntries; + unsigned int numberOfPages = cache->numberOfPages; + unsigned int sectorsPerPage = cache->sectorsPerPage; + + bool foundFree = false; + unsigned int oldUsed = 0; + unsigned int oldAccess = UINT_MAX; + + for(i=0;i<numberOfPages;i++) { + if(sector>=cacheEntries[i].sector && sector<(cacheEntries[i].sector + cacheEntries[i].count)) { + cacheEntries[i].last_access = accessTime(); + return &(cacheEntries[i]); + } + + if(foundFree==false && (cacheEntries[i].sector==CACHE_FREE || cacheEntries[i].last_access<oldAccess)) { + if(cacheEntries[i].sector==CACHE_FREE) foundFree = true; + oldUsed = i; + oldAccess = cacheEntries[i].last_access; + } + } + + if(foundFree==false && cacheEntries[oldUsed].dirty==true) { + if(!_FAT_disc_writeSectors(cache->disc,cacheEntries[oldUsed].sector,cacheEntries[oldUsed].count,cacheEntries[oldUsed].cache)) return NULL; + cacheEntries[oldUsed].dirty = false; + } + + sector = (sector/sectorsPerPage)*sectorsPerPage; // align base sector to page size + sec_t next_page = sector + sectorsPerPage; + if(next_page > cache->endOfPartition) next_page = cache->endOfPartition; + + if(!_FAT_disc_readSectors(cache->disc,sector,next_page-sector,cacheEntries[oldUsed].cache)) return NULL; + + cacheEntries[oldUsed].sector = sector; + cacheEntries[oldUsed].count = next_page-sector; + cacheEntries[oldUsed].last_access = accessTime(); + + return &(cacheEntries[oldUsed]); +} + +bool _FAT_cache_readSectors(CACHE *cache,sec_t sector,sec_t numSectors,void *buffer) +{ + sec_t sec; + sec_t secs_to_read; + CACHE_ENTRY *entry; + uint8_t *dest = (uint8_t *)buffer; + + while(numSectors>0) { + entry = _FAT_cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + secs_to_read = entry->count - sec; + if(secs_to_read>numSectors) secs_to_read = numSectors; + + memcpy(dest,entry->cache + (sec*cache->bytesPerSector),(secs_to_read*cache->bytesPerSector)); + + dest += (secs_to_read*cache->bytesPerSector); + sector += secs_to_read; + numSectors -= secs_to_read; + } + + return true; +} + +/* +Reads some data from a cache page, determined by the sector number +*/ +bool _FAT_cache_readPartialSector (CACHE* cache, void* buffer, sec_t sector, unsigned int offset, size_t size) +{ + sec_t sec; + CACHE_ENTRY *entry; + + if (offset + size > cache->bytesPerSector) return false; + + entry = _FAT_cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + memcpy(buffer,entry->cache + ((sec*cache->bytesPerSector) + offset),size); + + return true; +} + +bool _FAT_cache_readLittleEndianValue (CACHE* cache, uint32_t *value, sec_t sector, unsigned int offset, int num_bytes) { + uint8_t buf[4]; + if (!_FAT_cache_readPartialSector(cache, buf, sector, offset, num_bytes)) return false; + + switch(num_bytes) { + case 1: *value = buf[0]; break; + case 2: *value = u8array_to_u16(buf,0); break; + case 4: *value = u8array_to_u32(buf,0); break; + default: return false; + } + return true; +} + +/* +Writes some data to a cache page, making sure it is loaded into memory first. +*/ +bool _FAT_cache_writePartialSector (CACHE* cache, const void* buffer, sec_t sector, unsigned int offset, size_t size) +{ + sec_t sec; + CACHE_ENTRY *entry; + + if (offset + size > cache->bytesPerSector) return false; + + entry = _FAT_cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + memcpy(entry->cache + ((sec*cache->bytesPerSector) + offset),buffer,size); + + entry->dirty = true; + return true; +} + +bool _FAT_cache_writeLittleEndianValue (CACHE* cache, const uint32_t value, sec_t sector, unsigned int offset, int size) { + uint8_t buf[4] = {0, 0, 0, 0}; + + switch(size) { + case 1: buf[0] = value; break; + case 2: u16_to_u8array(buf, 0, value); break; + case 4: u32_to_u8array(buf, 0, value); break; + default: return false; + } + + return _FAT_cache_writePartialSector(cache, buf, sector, offset, size); +} + +/* +Writes some data to a cache page, zeroing out the page first +*/ +bool _FAT_cache_eraseWritePartialSector (CACHE* cache, const void* buffer, sec_t sector, unsigned int offset, size_t size) +{ + sec_t sec; + CACHE_ENTRY *entry; + + if (offset + size > cache->bytesPerSector) return false; + + entry = _FAT_cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + memset(entry->cache + (sec*cache->bytesPerSector),0,cache->bytesPerSector); + memcpy(entry->cache + ((sec*cache->bytesPerSector) + offset),buffer,size); + + entry->dirty = true; + return true; +} + + +bool _FAT_cache_writeSectors (CACHE* cache, sec_t sector, sec_t numSectors, const void* buffer) +{ + sec_t sec; + sec_t secs_to_write; + CACHE_ENTRY* entry; + const uint8_t *src = (const uint8_t *)buffer; + + while(numSectors>0) + { + entry = _FAT_cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + secs_to_write = entry->count - sec; + if(secs_to_write>numSectors) secs_to_write = numSectors; + + memcpy(entry->cache + (sec*cache->bytesPerSector),src,(secs_to_write*cache->bytesPerSector)); + + src += (secs_to_write*cache->bytesPerSector); + sector += secs_to_write; + numSectors -= secs_to_write; + + entry->dirty = true; + } + return true; +} + +/* +Flushes all dirty pages to disc, clearing the dirty flag. +*/ +bool _FAT_cache_flush (CACHE* cache) { + unsigned int i; + + for (i = 0; i < cache->numberOfPages; i++) { + if (cache->cacheEntries[i].dirty) { + if (!_FAT_disc_writeSectors (cache->disc, cache->cacheEntries[i].sector, cache->cacheEntries[i].count, cache->cacheEntries[i].cache)) { + return false; + } + } + cache->cacheEntries[i].dirty = false; + } + + return true; +} + +void _FAT_cache_invalidate (CACHE* cache) { + unsigned int i; + _FAT_cache_flush(cache); + for (i = 0; i < cache->numberOfPages; i++) { + cache->cacheEntries[i].sector = CACHE_FREE; + cache->cacheEntries[i].last_access = 0; + cache->cacheEntries[i].count = 0; + cache->cacheEntries[i].dirty = false; + } +} diff --git a/portlibs/sources/libfat/cache.h b/portlibs/sources/libfat/cache.h new file mode 100644 index 00000000..07bb14c2 --- /dev/null +++ b/portlibs/sources/libfat/cache.h @@ -0,0 +1,128 @@ +/* + cache.h + The cache is not visible to the user. It should be flushed + when any file is closed or changes are made to the filesystem. + + This cache implements a least-used-page replacement policy. This will + distribute sectors evenly over the pages, so if less than the maximum + pages are used at once, they should all eventually remain in the cache. + This also has the benefit of throwing out old sectors, so as not to keep + too many stale pages around. + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _CACHE_H +#define _CACHE_H + +#include "common.h" +#include "disc.h" + +typedef struct { + sec_t sector; + unsigned int count; + unsigned int last_access; + bool dirty; + uint8_t* cache; +} CACHE_ENTRY; + +typedef struct { + const DISC_INTERFACE* disc; + sec_t endOfPartition; + unsigned int numberOfPages; + unsigned int sectorsPerPage; + unsigned int bytesPerSector; + CACHE_ENTRY* cacheEntries; +} CACHE; + +/* +Read data from a sector in the cache +If the sector is not in the cache, it will be swapped in +offset is the position to start reading from +size is the amount of data to read +Precondition: offset + size <= BYTES_PER_READ +*/ +bool _FAT_cache_readPartialSector (CACHE* cache, void* buffer, sec_t sector, unsigned int offset, size_t size); + +bool _FAT_cache_readLittleEndianValue (CACHE* cache, uint32_t *value, sec_t sector, unsigned int offset, int num_bytes); + +/* +Write data to a sector in the cache +If the sector is not in the cache, it will be swapped in. +When the sector is swapped out, the data will be written to the disc +offset is the position to start writing to +size is the amount of data to write +Precondition: offset + size <= BYTES_PER_READ +*/ +bool _FAT_cache_writePartialSector (CACHE* cache, const void* buffer, sec_t sector, unsigned int offset, size_t size); + +bool _FAT_cache_writeLittleEndianValue (CACHE* cache, const uint32_t value, sec_t sector, unsigned int offset, int num_bytes); + +/* +Write data to a sector in the cache, zeroing the sector first +If the sector is not in the cache, it will be swapped in. +When the sector is swapped out, the data will be written to the disc +offset is the position to start writing to +size is the amount of data to write +Precondition: offset + size <= BYTES_PER_READ +*/ +bool _FAT_cache_eraseWritePartialSector (CACHE* cache, const void* buffer, sec_t sector, unsigned int offset, size_t size); + +/* +Read several sectors from the cache +*/ +bool _FAT_cache_readSectors (CACHE* cache, sec_t sector, sec_t numSectors, void* buffer); + +/* +Read a full sector from the cache +*/ +static inline bool _FAT_cache_readSector (CACHE* cache, void* buffer, sec_t sector) { + return _FAT_cache_readPartialSector (cache, buffer, sector, 0, cache->bytesPerSector); +} + +/* +Write a full sector to the cache +*/ +static inline bool _FAT_cache_writeSector (CACHE* cache, const void* buffer, sec_t sector) { + return _FAT_cache_writePartialSector (cache, buffer, sector, 0, cache->bytesPerSector); +} + +bool _FAT_cache_writeSectors (CACHE* cache, sec_t sector, sec_t numSectors, const void* buffer); + +/* +Write any dirty sectors back to disc and clear out the contents of the cache +*/ +bool _FAT_cache_flush (CACHE* cache); + +/* +Clear out the contents of the cache without writing any dirty sectors first +*/ +void _FAT_cache_invalidate (CACHE* cache); + +CACHE* _FAT_cache_constructor (unsigned int numberOfPages, unsigned int sectorsPerPage, const DISC_INTERFACE* discInterface, sec_t endOfPartition, unsigned int bytesPerSector); + +void _FAT_cache_destructor (CACHE* cache); + +#endif // _CACHE_H + diff --git a/portlibs/sources/libfat/common.h b/portlibs/sources/libfat/common.h new file mode 100644 index 00000000..c5c56325 --- /dev/null +++ b/portlibs/sources/libfat/common.h @@ -0,0 +1,78 @@ +/* + common.h + Common definitions and included files for the FATlib + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _COMMON_H +#define _COMMON_H + +#include <fat.h> +#include <stddef.h> +#include <stdint.h> + +// When compiling for NDS, make sure NDS is defined +#ifndef NDS + #if defined ARM9 || defined ARM7 + #define NDS + #endif +#endif + +// Platform specific includes +#if defined(__gamecube__) || defined (__wii__) + #include <gctypes.h> + #include <ogc/disc_io.h> + #include <gccore.h> +#elif defined(NDS) + #include <nds/ndstypes.h> + #include <nds/system.h> + #include <nds/disc_io.h> +#elif defined(GBA) + #include <gba_types.h> + #include <disc_io.h> +#endif + +// Platform specific options +#if defined (__wii__) + #define DEFAULT_CACHE_PAGES 4 + #define DEFAULT_SECTORS_PAGE 64 + #define USE_LWP_LOCK + #define USE_RTC_TIME +#elif defined (__gamecube__) + #define DEFAULT_CACHE_PAGES 4 + #define DEFAULT_SECTORS_PAGE 64 + #define USE_LWP_LOCK + #define USE_RTC_TIME +#elif defined (NDS) + #define DEFAULT_CACHE_PAGES 16 + #define DEFAULT_SECTORS_PAGE 8 + #define USE_RTC_TIME +#elif defined (GBA) + #define DEFAULT_CACHE_PAGES 2 + #define DEFAULT_SECTORS_PAGE 8 + #define LIMIT_SECTORS 128 +#endif + +#endif // _COMMON_H diff --git a/portlibs/sources/libfat/directory.c b/portlibs/sources/libfat/directory.c new file mode 100644 index 00000000..55de3bb9 --- /dev/null +++ b/portlibs/sources/libfat/directory.c @@ -0,0 +1,1120 @@ +/* + directory.c + Reading, writing and manipulation of the directory structure on + a FAT partition + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#include <string.h> +#include <ctype.h> +#include <wchar.h> +#include <wctype.h> +#include <stdlib.h> +#include <stdio.h> + +#include "directory.h" +#include "common.h" +#include "partition.h" +#include "file_allocation_table.h" +#include "bit_ops.h" +#include "filetime.h" + +// Directory entry codes +#define DIR_ENTRY_LAST 0x00 +#define DIR_ENTRY_FREE 0xE5 + +#define LAST_LFN_POS (19*13) +#define LAST_LFN_POS_CORRECTION (MAX_LFN_LENGTH-15) + +typedef unsigned short ucs2_t; + +// Long file name directory entry +enum LFN_offset { + LFN_offset_ordinal = 0x00, // Position within LFN + LFN_offset_char0 = 0x01, + LFN_offset_char1 = 0x03, + LFN_offset_char2 = 0x05, + LFN_offset_char3 = 0x07, + LFN_offset_char4 = 0x09, + LFN_offset_flag = 0x0B, // Should be equal to ATTRIB_LFN + LFN_offset_reserved1 = 0x0C, // Always 0x00 + LFN_offset_checkSum = 0x0D, // Checksum of short file name (alias) + LFN_offset_char5 = 0x0E, + LFN_offset_char6 = 0x10, + LFN_offset_char7 = 0x12, + LFN_offset_char8 = 0x14, + LFN_offset_char9 = 0x16, + LFN_offset_char10 = 0x18, + LFN_offset_reserved2 = 0x1A, // Always 0x0000 + LFN_offset_char11 = 0x1C, + LFN_offset_char12 = 0x1E +}; +static const int LFN_offset_table[13]={0x01,0x03,0x05,0x07,0x09,0x0E,0x10,0x12,0x14,0x16,0x18,0x1C,0x1E}; + +#define LFN_END 0x40 +#define LFN_DEL 0x80 + +static const char ILLEGAL_ALIAS_CHARACTERS[] = "\\/:;*?\"<>|&+,=[] "; +static const char ILLEGAL_LFN_CHARACTERS[] = "\\/:*?\"<>|"; + +/* +Returns number of UCS-2 characters needed to encode an LFN +Returns -1 if it is an invalid LFN +*/ +#define ABOVE_UCS_RANGE 0xF0 +static int _FAT_directory_lfnLength (const char* name) { + unsigned int i; + size_t nameLength; + int ucsLength; + const char* tempName = name; + + nameLength = strnlen(name, MAX_FILENAME_LENGTH); + // Make sure the name is short enough to be valid + if ( nameLength >= MAX_FILENAME_LENGTH) { + return -1; + } + // Make sure it doesn't contain any invalid characters + if (strpbrk (name, ILLEGAL_LFN_CHARACTERS) != NULL) { + return -1; + } + // Make sure the name doesn't contain any control codes or codes not representable in UCS-2 + for (i = 0; i < nameLength; i++) { + if (name[i] < 0x20 || name[i] >= ABOVE_UCS_RANGE) { + return -1; + } + } + // Convert to UCS-2 and get the resulting length + ucsLength = mbsrtowcs(NULL, &tempName, MAX_LFN_LENGTH, NULL); + if (ucsLength < 0 || ucsLength >= MAX_LFN_LENGTH) { + return -1; + } + + // Otherwise it is valid + return ucsLength; +} + +/* +Convert a multibyte encoded string into a NUL-terminated UCS-2 string, storing at most len characters +return number of characters stored +*/ +static size_t _FAT_directory_mbstoucs2 (ucs2_t* dst, const char* src, size_t len) { + mbstate_t ps = {0}; + wchar_t tempChar; + int bytes; + size_t count = 0; + + while (count < len-1 && src != '\0') { + bytes = mbrtowc (&tempChar, src, MB_CUR_MAX, &ps); + if (bytes > 0) { + *dst = (ucs2_t)tempChar; + src += bytes; + dst++; + count++; + } else if (bytes == 0) { + break; + } else { + return -1; + } + } + *dst = '\0'; + + return count; +} + +/* +Convert a UCS-2 string into a NUL-terminated multibyte string, storing at most len chars +return number of chars stored, or (size_t)-1 on error +*/ +static size_t _FAT_directory_ucs2tombs (char* dst, const ucs2_t* src, size_t len) { + mbstate_t ps = {0}; + size_t count = 0; + int bytes; + char buff[MB_CUR_MAX]; + int i; + + while (count < len - 1 && *src != '\0') { + bytes = wcrtomb (buff, *src, &ps); + if (bytes < 0) { + return -1; + } + if (count + bytes < len && bytes > 0) { + for (i = 0; i < bytes; i++) { + *dst++ = buff[i]; + } + src++; + count += bytes; + } else { + break; + } + } + *dst = L'\0'; + + return count; +} + +/* +Case-independent comparison of two multibyte encoded strings +*/ +static int _FAT_directory_mbsncasecmp (const char* s1, const char* s2, size_t len1) { + wchar_t wc1, wc2; + mbstate_t ps1 = {0}; + mbstate_t ps2 = {0}; + size_t b1 = 0; + size_t b2 = 0; + + if (len1 == 0) { + return 0; + } + + do { + s1 += b1; + s2 += b2; + b1 = mbrtowc(&wc1, s1, MB_CUR_MAX, &ps1); + b2 = mbrtowc(&wc2, s2, MB_CUR_MAX, &ps2); + if ((int)b1 < 0 || (int)b2 < 0) { + break; + } + len1 -= b1; + } while (len1 > 0 && towlower(wc1) == towlower(wc2) && wc1 != 0); + + return towlower(wc1) - towlower(wc2); +} + + +static bool _FAT_directory_entryGetAlias (const u8* entryData, char* destName) { + int i=0; + int j=0; + + destName[0] = '\0'; + if (entryData[0] != DIR_ENTRY_FREE) { + if (entryData[0] == '.') { + destName[0] = '.'; + if (entryData[1] == '.') { + destName[1] = '.'; + destName[2] = '\0'; + } else { + destName[1] = '\0'; + } + } else { + // Copy the filename from the dirEntry to the string + for (i = 0; (i < 8) && (entryData[DIR_ENTRY_name + i] != ' '); i++) { + destName[i] = entryData[DIR_ENTRY_name + i]; + } + // Copy the extension from the dirEntry to the string + if (entryData[DIR_ENTRY_extension] != ' ') { + destName[i++] = '.'; + for ( j = 0; (j < 3) && (entryData[DIR_ENTRY_extension + j] != ' '); j++) { + destName[i++] = entryData[DIR_ENTRY_extension + j]; + } + } + destName[i] = '\0'; + } + } + + return (destName[0] != '\0'); +} + +uint32_t _FAT_directory_entryGetCluster (PARTITION* partition, const uint8_t* entryData) { + if (partition->filesysType == FS_FAT32) { + // Only use high 16 bits of start cluster when we are certain they are correctly defined + return u8array_to_u16(entryData,DIR_ENTRY_cluster) | (u8array_to_u16(entryData, DIR_ENTRY_clusterHigh) << 16); + } else { + return u8array_to_u16(entryData,DIR_ENTRY_cluster); + } +} + +static bool _FAT_directory_incrementDirEntryPosition (PARTITION* partition, DIR_ENTRY_POSITION* entryPosition, bool extendDirectory) { + DIR_ENTRY_POSITION position = *entryPosition; + uint32_t tempCluster; + + // Increment offset, wrapping at the end of a sector + ++ position.offset; + if (position.offset == partition->bytesPerSector / DIR_ENTRY_DATA_SIZE) { + position.offset = 0; + // Increment sector when wrapping + ++ position.sector; + // But wrap at the end of a cluster + if ((position.sector == partition->sectorsPerCluster) && (position.cluster != FAT16_ROOT_DIR_CLUSTER)) { + position.sector = 0; + // Move onto the next cluster, making sure there is another cluster to go to + tempCluster = _FAT_fat_nextCluster(partition, position.cluster); + if (tempCluster == CLUSTER_EOF) { + if (extendDirectory) { + tempCluster = _FAT_fat_linkFreeClusterCleared (partition, position.cluster); + if (!_FAT_fat_isValidCluster(partition, tempCluster)) { + return false; // This will only happen if the disc is full + } + } else { + return false; // Got to the end of the directory, not extending it + } + } + position.cluster = tempCluster; + } else if ((position.cluster == FAT16_ROOT_DIR_CLUSTER) && (position.sector == (partition->dataStart - partition->rootDirStart))) { + return false; // Got to end of root directory, can't extend it + } + } + *entryPosition = position; + return true; +} + +bool _FAT_directory_getNextEntry (PARTITION* partition, DIR_ENTRY* entry) { + DIR_ENTRY_POSITION entryStart; + DIR_ENTRY_POSITION entryEnd; + uint8_t entryData[0x20]; + ucs2_t lfn[MAX_LFN_LENGTH]; + bool notFound, found; + int lfnPos; + uint8_t lfnChkSum, chkSum; + bool lfnExists; + int i; + + lfnChkSum = 0; + + entryStart = entry->dataEnd; + + // Make sure we are using the correct root directory, in case of FAT32 + if (entryStart.cluster == FAT16_ROOT_DIR_CLUSTER) { + entryStart.cluster = partition->rootDirCluster; + } + + entryEnd = entryStart; + + lfnExists = false; + + found = false; + notFound = false; + + while (!found && !notFound) { + if (_FAT_directory_incrementDirEntryPosition (partition, &entryEnd, false) == false) { + notFound = true; + } + + _FAT_cache_readPartialSector (partition->cache, entryData, + _FAT_fat_clusterToSector(partition, entryEnd.cluster) + entryEnd.sector, + entryEnd.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + + if (entryData[DIR_ENTRY_attributes] == ATTRIB_LFN) { + // It's an LFN + if (entryData[LFN_offset_ordinal] & LFN_DEL) { + lfnExists = false; + } else if (entryData[LFN_offset_ordinal] & LFN_END) { + // Last part of LFN, make sure it isn't deleted using previous if(Thanks MoonLight) + entryStart = entryEnd; // This is the start of a directory entry + lfnExists = true; + lfnPos = (entryData[LFN_offset_ordinal] & ~LFN_END) * 13; + if (lfnPos > MAX_LFN_LENGTH - 1) { + lfnPos = MAX_LFN_LENGTH - 1; + } + lfn[lfnPos] = '\0'; // Set end of lfn to null character + lfnChkSum = entryData[LFN_offset_checkSum]; + } + if (lfnChkSum != entryData[LFN_offset_checkSum]) { + lfnExists = false; + } + if (lfnExists) { + lfnPos = ((entryData[LFN_offset_ordinal] & ~LFN_END) - 1) * 13; + if (lfnPos > LAST_LFN_POS) { + // Force it within the buffer. Will corrupt the filename but prevent buffer overflows + lfnPos = LAST_LFN_POS; + } + for (i = 0; i < 13; i++) { + lfn[lfnPos + i] = entryData[LFN_offset_table[i]] | (entryData[LFN_offset_table[i]+1] << 8); + } + } + } else if (entryData[DIR_ENTRY_attributes] & ATTRIB_VOL) { + // This is a volume name, don't bother with it + } else if (entryData[0] == DIR_ENTRY_LAST) { + notFound = true; + } else if ((entryData[0] != DIR_ENTRY_FREE) && (entryData[0] > 0x20) && !(entryData[DIR_ENTRY_attributes] & ATTRIB_VOL)) { + if (lfnExists) { + // Calculate file checksum + chkSum = 0; + for (i=0; i < 11; i++) { + // NOTE: The operation is an unsigned char rotate right + chkSum = ((chkSum & 1) ? 0x80 : 0) + (chkSum >> 1) + entryData[i]; + } + if (chkSum != lfnChkSum) { + lfnExists = false; + entry->filename[0] = '\0'; + } + } + + if (lfnExists) { + if (_FAT_directory_ucs2tombs (entry->filename, lfn, MAX_FILENAME_LENGTH) == (size_t)-1) { + // Failed to convert the file name to UTF-8. Maybe the wrong locale is set? + return false; + } + } else { + entryStart = entryEnd; + _FAT_directory_entryGetAlias (entryData, entry->filename); + } + found = true; + } + } + + // If no file is found, return false + if (notFound) { + return false; + } else { + // Fill in the directory entry struct + entry->dataStart = entryStart; + entry->dataEnd = entryEnd; + memcpy (entry->entryData, entryData, DIR_ENTRY_DATA_SIZE); + return true; + } +} + +bool _FAT_directory_getFirstEntry (PARTITION* partition, DIR_ENTRY* entry, uint32_t dirCluster) { + entry->dataStart.cluster = dirCluster; + entry->dataStart.sector = 0; + entry->dataStart.offset = -1; // Start before the beginning of the directory + + entry->dataEnd = entry->dataStart; + + return _FAT_directory_getNextEntry (partition, entry); +} + +bool _FAT_directory_getRootEntry (PARTITION* partition, DIR_ENTRY* entry) { + entry->dataStart.cluster = 0; + entry->dataStart.sector = 0; + entry->dataStart.offset = 0; + + entry->dataEnd = entry->dataStart; + + memset (entry->filename, '\0', MAX_FILENAME_LENGTH); + entry->filename[0] = '.'; + + memset (entry->entryData, 0, DIR_ENTRY_DATA_SIZE); + memset (entry->entryData, ' ', 11); + entry->entryData[0] = '.'; + + entry->entryData[DIR_ENTRY_attributes] = ATTRIB_DIR; + + u16_to_u8array (entry->entryData, DIR_ENTRY_cluster, partition->rootDirCluster); + u16_to_u8array (entry->entryData, DIR_ENTRY_clusterHigh, partition->rootDirCluster >> 16); + + return true; +} + +bool _FAT_directory_getVolumeLabel (PARTITION* partition, char *label) { + DIR_ENTRY entry; + DIR_ENTRY_POSITION entryEnd; + uint8_t entryData[DIR_ENTRY_DATA_SIZE]; + int i; + bool end; + + _FAT_directory_getRootEntry(partition, &entry); + + entryEnd = entry.dataEnd; + + // Make sure we are using the correct root directory, in case of FAT32 + if (entryEnd.cluster == FAT16_ROOT_DIR_CLUSTER) { + entryEnd.cluster = partition->rootDirCluster; + } + + label[0]='\0'; + label[11]='\0'; + end = false; + //this entry should be among the first 3 entries in the root directory table, if not, then system can have trouble displaying the right volume label + while(!end) { + if(!_FAT_cache_readPartialSector (partition->cache, entryData, + _FAT_fat_clusterToSector(partition, entryEnd.cluster) + entryEnd.sector, + entryEnd.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE)) + { //error reading + return false; + } + + if (entryData[DIR_ENTRY_attributes] == ATTRIB_VOL && entryData[0] != DIR_ENTRY_FREE) { + for (i = 0; i < 11; i++) { + label[i] = entryData[DIR_ENTRY_name + i]; + } + return true; + } else if (entryData[0] == DIR_ENTRY_LAST) { + end = true; + } + + if (_FAT_directory_incrementDirEntryPosition (partition, &entryEnd, false) == false) { + end = true; + } + } + return false; +} + +bool _FAT_directory_entryFromPosition (PARTITION* partition, DIR_ENTRY* entry) { + DIR_ENTRY_POSITION entryStart = entry->dataStart; + DIR_ENTRY_POSITION entryEnd = entry->dataEnd; + bool entryStillValid; + bool finished; + ucs2_t lfn[MAX_LFN_LENGTH]; + int i; + int lfnPos; + uint8_t entryData[DIR_ENTRY_DATA_SIZE]; + + memset (entry->filename, '\0', MAX_FILENAME_LENGTH); + + // Create an empty directory entry to overwrite the old ones with + for ( entryStillValid = true, finished = false; + entryStillValid && !finished; + entryStillValid = _FAT_directory_incrementDirEntryPosition (partition, &entryStart, false)) + { + _FAT_cache_readPartialSector (partition->cache, entryData, + _FAT_fat_clusterToSector(partition, entryStart.cluster) + entryStart.sector, + entryStart.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + + if ((entryStart.cluster == entryEnd.cluster) + && (entryStart.sector == entryEnd.sector) + && (entryStart.offset == entryEnd.offset)) { + // Copy the entry data and stop, since this is the last section of the directory entry + memcpy (entry->entryData, entryData, DIR_ENTRY_DATA_SIZE); + finished = true; + } else { + // Copy the long file name data + lfnPos = ((entryData[LFN_offset_ordinal] & ~LFN_END) - 1) * 13; + if (lfnPos > LAST_LFN_POS) { + lfnPos = LAST_LFN_POS_CORRECTION; + } + for (i = 0; i < 13; i++) { + lfn[lfnPos + i] = entryData[LFN_offset_table[i]] | (entryData[LFN_offset_table[i]+1] << 8); + } + } + } + + if (!entryStillValid) { + return false; + } + + if ((entryStart.cluster == entryEnd.cluster) + && (entryStart.sector == entryEnd.sector) + && (entryStart.offset == entryEnd.offset)) { + // Since the entry doesn't have a long file name, extract the short filename + if (!_FAT_directory_entryGetAlias (entry->entryData, entry->filename)) { + return false; + } + } else { + // Encode the long file name into a multibyte string + if (_FAT_directory_ucs2tombs (entry->filename, lfn, MAX_FILENAME_LENGTH) == (size_t)-1) { + return false; + } + } + + return true; +} + + + +bool _FAT_directory_entryFromPath (PARTITION* partition, DIR_ENTRY* entry, const char* path, const char* pathEnd) { + size_t dirnameLength; + const char* pathPosition; + const char* nextPathPosition; + uint32_t dirCluster; + bool foundFile; + char alias[MAX_ALIAS_LENGTH]; + bool found, notFound; + + pathPosition = path; + + found = false; + notFound = false; + + if (pathEnd == NULL) { + // Set pathEnd to the end of the path string + pathEnd = strchr (path, '\0'); + } + + if (pathPosition[0] == DIR_SEPARATOR) { + // Start at root directory + dirCluster = partition->rootDirCluster; + // Consume separator(s) + while (pathPosition[0] == DIR_SEPARATOR) { + pathPosition++; + } + // If the path is only specifying a directory in the form of "/" return it + if (pathPosition >= pathEnd) { + _FAT_directory_getRootEntry (partition, entry); + found = true; + } + } else { + // Start in current working directory + dirCluster = partition->cwdCluster; + } + + // If the path is only specifying a directory in the form "." + // and this is the root directory, return it + if ((dirCluster == partition->rootDirCluster) && (strcmp(".", pathPosition) == 0)) { + _FAT_directory_getRootEntry (partition, entry); + found = true; + } + + while (!found && !notFound) { + // Get the name of the next required subdirectory within the path + nextPathPosition = strchr (pathPosition, DIR_SEPARATOR); + if (nextPathPosition != NULL) { + dirnameLength = nextPathPosition - pathPosition; + } else { + dirnameLength = strlen(pathPosition); + } + + if (dirnameLength > MAX_FILENAME_LENGTH) { + // The path is too long to bother with + return false; + } + + // Look for the directory within the path + foundFile = _FAT_directory_getFirstEntry (partition, entry, dirCluster); + + while (foundFile && !found && !notFound) { // It hasn't already found the file + // Check if the filename matches + if ((dirnameLength == strnlen(entry->filename, MAX_FILENAME_LENGTH)) + && (_FAT_directory_mbsncasecmp(pathPosition, entry->filename, dirnameLength) == 0)) { + found = true; + } + + // Check if the alias matches + _FAT_directory_entryGetAlias (entry->entryData, alias); + if ((dirnameLength == strnlen(alias, MAX_ALIAS_LENGTH)) + && (strncasecmp(pathPosition, alias, dirnameLength) == 0)) { + found = true; + } + + if (found && !(entry->entryData[DIR_ENTRY_attributes] & ATTRIB_DIR) && (nextPathPosition != NULL)) { + // Make sure that we aren't trying to follow a file instead of a directory in the path + found = false; + } + + if (!found) { + foundFile = _FAT_directory_getNextEntry (partition, entry); + } + } + + if (!foundFile) { + // Check that the search didn't get to the end of the directory + notFound = true; + found = false; + } else if ((nextPathPosition == NULL) || (nextPathPosition >= pathEnd)) { + // Check that we reached the end of the path + found = true; + } else if (entry->entryData[DIR_ENTRY_attributes] & ATTRIB_DIR) { + dirCluster = _FAT_directory_entryGetCluster (partition, entry->entryData); + pathPosition = nextPathPosition; + // Consume separator(s) + while (pathPosition[0] == DIR_SEPARATOR) { + pathPosition++; + } + // The requested directory was found + if (pathPosition >= pathEnd) { + found = true; + } else { + found = false; + } + } + } + + if (found && !notFound) { + if (partition->filesysType == FS_FAT32 && (entry->entryData[DIR_ENTRY_attributes] & ATTRIB_DIR) && + _FAT_directory_entryGetCluster (partition, entry->entryData) == CLUSTER_ROOT) + { + // On FAT32 it should specify an actual cluster for the root entry, + // not cluster 0 as on FAT16 + _FAT_directory_getRootEntry (partition, entry); + } + return true; + } else { + return false; + } +} + +bool _FAT_directory_removeEntry (PARTITION* partition, DIR_ENTRY* entry) { + DIR_ENTRY_POSITION entryStart = entry->dataStart; + DIR_ENTRY_POSITION entryEnd = entry->dataEnd; + bool entryStillValid; + bool finished; + uint8_t entryData[DIR_ENTRY_DATA_SIZE]; + + // Create an empty directory entry to overwrite the old ones with + for ( entryStillValid = true, finished = false; + entryStillValid && !finished; + entryStillValid = _FAT_directory_incrementDirEntryPosition (partition, &entryStart, false)) + { + _FAT_cache_readPartialSector (partition->cache, entryData, _FAT_fat_clusterToSector(partition, entryStart.cluster) + entryStart.sector, entryStart.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + entryData[0] = DIR_ENTRY_FREE; + _FAT_cache_writePartialSector (partition->cache, entryData, _FAT_fat_clusterToSector(partition, entryStart.cluster) + entryStart.sector, entryStart.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + if ((entryStart.cluster == entryEnd.cluster) && (entryStart.sector == entryEnd.sector) && (entryStart.offset == entryEnd.offset)) { + finished = true; + } + } + + if (!entryStillValid) { + return false; + } + + return true; +} + +static bool _FAT_directory_findEntryGap (PARTITION* partition, DIR_ENTRY* entry, uint32_t dirCluster, size_t size) { + DIR_ENTRY_POSITION gapStart; + DIR_ENTRY_POSITION gapEnd; + uint8_t entryData[DIR_ENTRY_DATA_SIZE]; + size_t dirEntryRemain; + bool endOfDirectory, entryStillValid; + + // Scan Dir for free entry + gapEnd.offset = 0; + gapEnd.sector = 0; + gapEnd.cluster = dirCluster; + + gapStart = gapEnd; + + entryStillValid = true; + dirEntryRemain = size; + endOfDirectory = false; + + while (entryStillValid && !endOfDirectory && (dirEntryRemain > 0)) { + _FAT_cache_readPartialSector (partition->cache, entryData, + _FAT_fat_clusterToSector(partition, gapEnd.cluster) + gapEnd.sector, + gapEnd.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + if (entryData[0] == DIR_ENTRY_LAST) { + gapStart = gapEnd; + -- dirEntryRemain; + endOfDirectory = true; + } else if (entryData[0] == DIR_ENTRY_FREE) { + if (dirEntryRemain == size) { + gapStart = gapEnd; + } + -- dirEntryRemain; + } else { + dirEntryRemain = size; + } + + if (!endOfDirectory && (dirEntryRemain > 0)) { + entryStillValid = _FAT_directory_incrementDirEntryPosition (partition, &gapEnd, true); + } + } + + // Make sure the scanning didn't fail + if (!entryStillValid) { + return false; + } + + // Save the start entry, since we know it is valid + entry->dataStart = gapStart; + + if (endOfDirectory) { + memset (entryData, DIR_ENTRY_LAST, DIR_ENTRY_DATA_SIZE); + dirEntryRemain += 1; // Increase by one to take account of End Of Directory Marker + while ((dirEntryRemain > 0) && entryStillValid) { + // Get the gapEnd before incrementing it, so the second to last one is saved + entry->dataEnd = gapEnd; + // Increment gapEnd, moving onto the next entry + entryStillValid = _FAT_directory_incrementDirEntryPosition (partition, &gapEnd, true); + -- dirEntryRemain; + // Fill the entry with blanks + _FAT_cache_writePartialSector (partition->cache, entryData, + _FAT_fat_clusterToSector(partition, gapEnd.cluster) + gapEnd.sector, + gapEnd.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + } + if (!entryStillValid) { + return false; + } + } else { + entry->dataEnd = gapEnd; + } + + return true; +} + +static bool _FAT_directory_entryExists (PARTITION* partition, const char* name, uint32_t dirCluster) { + DIR_ENTRY tempEntry; + bool foundFile; + char alias[MAX_ALIAS_LENGTH]; + size_t dirnameLength; + + dirnameLength = strnlen(name, MAX_FILENAME_LENGTH); + + if (dirnameLength >= MAX_FILENAME_LENGTH) { + return false; + } + + // Make sure the entry doesn't already exist + foundFile = _FAT_directory_getFirstEntry (partition, &tempEntry, dirCluster); + + while (foundFile) { // It hasn't already found the file + // Check if the filename matches + if ((dirnameLength == strnlen(tempEntry.filename, MAX_FILENAME_LENGTH)) + && (_FAT_directory_mbsncasecmp(name, tempEntry.filename, dirnameLength) == 0)) { + return true; + } + + // Check if the alias matches + _FAT_directory_entryGetAlias (tempEntry.entryData, alias); + if ((strncasecmp(name, alias, MAX_ALIAS_LENGTH) == 0)) { + return true; + } + foundFile = _FAT_directory_getNextEntry (partition, &tempEntry); + } + return false; +} + +/* +Creates an alias for a long file name. If the alias is not an exact match for the +filename, it returns the number of characters in the alias. If the two names match, +it returns 0. If there was an error, it returns -1. +*/ +static int _FAT_directory_createAlias (char* alias, const char* lfn) { + bool lossyConversion = false; // Set when the alias had to be modified to be valid + int lfnPos = 0; + int aliasPos = 0; + wchar_t lfnChar; + int oemChar; + mbstate_t ps = {0}; + int bytesUsed = 0; + const char* lfnExt; + int aliasExtLen; + + // Strip leading periods + while (lfn[lfnPos] == '.') { + lfnPos ++; + lossyConversion = true; + } + + // Primary portion of alias + while (aliasPos < 8 && lfn[lfnPos] != '.' && lfn[lfnPos] != '\0') { + bytesUsed = mbrtowc(&lfnChar, lfn + lfnPos, MAX_FILENAME_LENGTH - lfnPos, &ps); + if (bytesUsed < 0) { + return -1; + } + oemChar = wctob(towupper((wint_t)lfnChar)); + if (wctob((wint_t)lfnChar) != oemChar) { + // Case of letter was changed + lossyConversion = true; + } + if (oemChar == ' ') { + // Skip spaces in filename + lossyConversion = true; + lfnPos += bytesUsed; + continue; + } + if (oemChar == EOF) { + oemChar = '_'; // Replace unconvertable characters with underscores + lossyConversion = true; + } + if (strchr (ILLEGAL_ALIAS_CHARACTERS, oemChar) != NULL) { + // Invalid Alias character + oemChar = '_'; // Replace illegal characters with underscores + lossyConversion = true; + } + + alias[aliasPos] = (char)oemChar; + aliasPos++; + lfnPos += bytesUsed; + } + + if (lfn[lfnPos] != '.' && lfn[lfnPos] != '\0') { + // Name was more than 8 characters long + lossyConversion = true; + } + + // Alias extension + lfnExt = strrchr (lfn, '.'); + if (lfnExt != NULL && lfnExt != strchr (lfn, '.')) { + // More than one period in name + lossyConversion = true; + } + if (lfnExt != NULL && lfnExt[1] != '\0') { + lfnExt++; + alias[aliasPos] = '.'; + aliasPos++; + memset (&ps, 0, sizeof(ps)); + for (aliasExtLen = 0; aliasExtLen < MAX_ALIAS_EXT_LENGTH && *lfnExt != '\0'; aliasExtLen++) { + bytesUsed = mbrtowc(&lfnChar, lfnExt, MAX_FILENAME_LENGTH - lfnPos, &ps); + if (bytesUsed < 0) { + return -1; + } + oemChar = wctob(towupper((wint_t)lfnChar)); + if (wctob((wint_t)lfnChar) != oemChar) { + // Case of letter was changed + lossyConversion = true; + } + if (oemChar == ' ') { + // Skip spaces in alias + lossyConversion = true; + lfnExt += bytesUsed; + continue; + } + if (oemChar == EOF) { + oemChar = '_'; // Replace unconvertable characters with underscores + lossyConversion = true; + } + if (strchr (ILLEGAL_ALIAS_CHARACTERS, oemChar) != NULL) { + // Invalid Alias character + oemChar = '_'; // Replace illegal characters with underscores + lossyConversion = true; + } + + alias[aliasPos] = (char)oemChar; + aliasPos++; + lfnExt += bytesUsed; + } + if (*lfnExt != '\0') { + // Extension was more than 3 characters long + lossyConversion = true; + } + } + + alias[aliasPos] = '\0'; + if (lossyConversion) { + return aliasPos; + } else { + return 0; + } +} + +bool _FAT_directory_addEntry (PARTITION* partition, DIR_ENTRY* entry, uint32_t dirCluster) { + size_t entrySize; + uint8_t lfnEntry[DIR_ENTRY_DATA_SIZE]; + int i,j; // Must be signed for use when decrementing in for loop + char *tmpCharPtr; + DIR_ENTRY_POSITION curEntryPos; + bool entryStillValid; + uint8_t aliasCheckSum = 0; + char alias [MAX_ALIAS_LENGTH]; + int aliasLen; + int lfnLen; + + // Make sure the filename is not 0 length + if (strnlen (entry->filename, MAX_FILENAME_LENGTH) < 1) { + return false; + } + + // Make sure the filename is at least a valid LFN + lfnLen = _FAT_directory_lfnLength (entry->filename); + if (lfnLen < 0) { + return false; + } + + // Remove trailing spaces + for (i = strlen (entry->filename) - 1; (i > 0) && (entry->filename[i] == ' '); --i) { + entry->filename[i] = '\0'; + } + // Remove leading spaces + for (i = 0; (i < (int)strlen (entry->filename)) && (entry->filename[i] == ' '); ++i) ; + if (i > 0) { + memmove (entry->filename, entry->filename + i, strlen (entry->filename + i)); + } + + // Remove junk in filename + i = strlen (entry->filename); + memset (entry->filename + i, '\0', MAX_FILENAME_LENGTH - i); + + // Make sure the entry doesn't already exist + if (_FAT_directory_entryExists (partition, entry->filename, dirCluster)) { + return false; + } + + // Clear out alias, so we can generate a new one + memset (entry->entryData, ' ', 11); + + if ( strncmp(entry->filename, ".", MAX_FILENAME_LENGTH) == 0) { + // "." entry + entry->entryData[0] = '.'; + entrySize = 1; + } else if ( strncmp(entry->filename, "..", MAX_FILENAME_LENGTH) == 0) { + // ".." entry + entry->entryData[0] = '.'; + entry->entryData[1] = '.'; + entrySize = 1; + } else { + // Normal file name + aliasLen = _FAT_directory_createAlias (alias, entry->filename); + if (aliasLen < 0) { + return false; + } else if (aliasLen == 0) { + // It's a normal short filename + entrySize = 1; + } else { + // It's a long filename with an alias + entrySize = ((lfnLen + LFN_ENTRY_LENGTH - 1) / LFN_ENTRY_LENGTH) + 1; + + // Generate full alias for all cases except when the alias is simply an upper case version of the LFN + // and there isn't already a file with that name + if (strncasecmp (alias, entry->filename, MAX_ALIAS_LENGTH) != 0 || + _FAT_directory_entryExists (partition, alias, dirCluster)) + { + // expand primary part to 8 characters long by padding the end with underscores + i = MAX_ALIAS_PRI_LENGTH - 1; + // Move extension to last 3 characters + while (alias[i] != '.' && i > 0) i--; + if (i > 0) { + j = MAX_ALIAS_LENGTH - MAX_ALIAS_EXT_LENGTH - 2; // 1 char for '.', one for NUL, 3 for extension + memmove (alias + j, alias + i, strlen(alias) - i); + // Pad primary component + memset (alias + i, '_', j - i); + alias[MAX_ALIAS_LENGTH-1]=0; + } + + // Generate numeric tail + for (i = 1; i <= MAX_NUMERIC_TAIL; i++) { + j = i; + tmpCharPtr = alias + MAX_ALIAS_PRI_LENGTH - 1; + while (j > 0) { + *tmpCharPtr = '0' + (j % 10); // ASCII numeric value + tmpCharPtr--; + j /= 10; + } + *tmpCharPtr = '~'; + if (!_FAT_directory_entryExists (partition, alias, dirCluster)) { + break; + } + } + if (i > MAX_NUMERIC_TAIL) { + // Couldn't get a valid alias + return false; + } + } + } + + // Copy alias or short file name into directory entry data + for (i = 0, j = 0; (j < 8) && (alias[i] != '.') && (alias[i] != '\0'); i++, j++) { + entry->entryData[j] = alias[i]; + } + while (j < 8) { + entry->entryData[j] = ' '; + ++ j; + } + if (alias[i] == '.') { + // Copy extension + ++ i; + while ((alias[i] != '\0') && (j < 11)) { + entry->entryData[j] = alias[i]; + ++ i; + ++ j; + } + } + while (j < 11) { + entry->entryData[j] = ' '; + ++ j; + } + + // Generate alias checksum + for (i=0; i < ALIAS_ENTRY_LENGTH; i++) { + // NOTE: The operation is an unsigned char rotate right + aliasCheckSum = ((aliasCheckSum & 1) ? 0x80 : 0) + (aliasCheckSum >> 1) + entry->entryData[i]; + } + } + + // Find or create space for the entry + if (_FAT_directory_findEntryGap (partition, entry, dirCluster, entrySize) == false) { + return false; + } + + // Write out directory entry + curEntryPos = entry->dataStart; + + { + // lfn is only pushed onto the stack here, reducing overall stack usage + ucs2_t lfn[MAX_LFN_LENGTH] = {0}; + _FAT_directory_mbstoucs2 (lfn, entry->filename, MAX_LFN_LENGTH); + + for (entryStillValid = true, i = entrySize; entryStillValid && i > 0; + entryStillValid = _FAT_directory_incrementDirEntryPosition (partition, &curEntryPos, false), -- i ) + { + if (i > 1) { + // Long filename entry + lfnEntry[LFN_offset_ordinal] = (i - 1) | ((size_t)i == entrySize ? LFN_END : 0); + for (j = 0; j < 13; j++) { + if (lfn [(i - 2) * 13 + j] == '\0') { + if ((j > 1) && (lfn [(i - 2) * 13 + (j-1)] == '\0')) { + u16_to_u8array (lfnEntry, LFN_offset_table[j], 0xffff); // Padding + } else { + u16_to_u8array (lfnEntry, LFN_offset_table[j], 0x0000); // Terminating null character + } + } else { + u16_to_u8array (lfnEntry, LFN_offset_table[j], lfn [(i - 2) * 13 + j]); + } + } + + lfnEntry[LFN_offset_checkSum] = aliasCheckSum; + lfnEntry[LFN_offset_flag] = ATTRIB_LFN; + lfnEntry[LFN_offset_reserved1] = 0; + u16_to_u8array (lfnEntry, LFN_offset_reserved2, 0); + _FAT_cache_writePartialSector (partition->cache, lfnEntry, _FAT_fat_clusterToSector(partition, curEntryPos.cluster) + curEntryPos.sector, curEntryPos.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + } else { + // Alias & file data + _FAT_cache_writePartialSector (partition->cache, entry->entryData, _FAT_fat_clusterToSector(partition, curEntryPos.cluster) + curEntryPos.sector, curEntryPos.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + } + } + } + + return true; +} + +bool _FAT_directory_chdir (PARTITION* partition, const char* path) { + DIR_ENTRY entry; + + if (!_FAT_directory_entryFromPath (partition, &entry, path, NULL)) { + return false; + } + + if (!(entry.entryData[DIR_ENTRY_attributes] & ATTRIB_DIR)) { + return false; + } + + partition->cwdCluster = _FAT_directory_entryGetCluster (partition, entry.entryData); + + return true; +} + +void _FAT_directory_entryStat (PARTITION* partition, DIR_ENTRY* entry, struct stat *st) { + // Fill in the stat struct + // Some of the values are faked for the sake of compatibility + st->st_dev = _FAT_disc_hostType(partition->disc); // The device is the 32bit ioType value + st->st_ino = (ino_t)(_FAT_directory_entryGetCluster(partition, entry->entryData)); // The file serial number is the start cluster + st->st_mode = (_FAT_directory_isDirectory(entry) ? S_IFDIR : S_IFREG) | + (S_IRUSR | S_IRGRP | S_IROTH) | + (_FAT_directory_isWritable (entry) ? (S_IWUSR | S_IWGRP | S_IWOTH) : 0); // Mode bits based on dirEntry ATTRIB byte + st->st_nlink = 1; // Always one hard link on a FAT file + st->st_uid = 1; // Faked for FAT + st->st_gid = 2; // Faked for FAT + st->st_rdev = st->st_dev; + st->st_size = u8array_to_u32 (entry->entryData, DIR_ENTRY_fileSize); // File size + st->st_atime = _FAT_filetime_to_time_t ( + 0, + u8array_to_u16 (entry->entryData, DIR_ENTRY_aDate) + ); + st->st_spare1 = 0; + st->st_mtime = _FAT_filetime_to_time_t ( + u8array_to_u16 (entry->entryData, DIR_ENTRY_mTime), + u8array_to_u16 (entry->entryData, DIR_ENTRY_mDate) + ); + st->st_spare2 = 0; + st->st_ctime = _FAT_filetime_to_time_t ( + u8array_to_u16 (entry->entryData, DIR_ENTRY_cTime), + u8array_to_u16 (entry->entryData, DIR_ENTRY_cDate) + ); + st->st_spare3 = 0; + st->st_blksize = partition->bytesPerSector; // Prefered file I/O block size + st->st_blocks = (st->st_size + partition->bytesPerSector - 1) / partition->bytesPerSector; // File size in blocks + st->st_spare4[0] = 0; + st->st_spare4[1] = 0; +} diff --git a/portlibs/sources/libfat/directory.h b/portlibs/sources/libfat/directory.h new file mode 100644 index 00000000..93429217 --- /dev/null +++ b/portlibs/sources/libfat/directory.h @@ -0,0 +1,178 @@ +/* + directory.h + Reading, writing and manipulation of the directory structure on + a FAT partition + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _DIRECTORY_H +#define _DIRECTORY_H + +#include <sys/stat.h> + +#include "common.h" +#include "partition.h" + +#define DIR_ENTRY_DATA_SIZE 0x20 +#define MAX_LFN_LENGTH 256 +#define MAX_FILENAME_LENGTH 768 // 256 UCS-2 characters encoded into UTF-8 can use up to 768 UTF-8 chars +#define MAX_ALIAS_LENGTH 13 +#define LFN_ENTRY_LENGTH 13 +#define ALIAS_ENTRY_LENGTH 11 +#define MAX_ALIAS_EXT_LENGTH 3 +#define MAX_ALIAS_PRI_LENGTH 8 +#define MAX_NUMERIC_TAIL 999999 +#define FAT16_ROOT_DIR_CLUSTER 0 + +#define DIR_SEPARATOR '/' + +// File attributes +#define ATTRIB_ARCH 0x20 // Archive +#define ATTRIB_DIR 0x10 // Directory +#define ATTRIB_LFN 0x0F // Long file name +#define ATTRIB_VOL 0x08 // Volume +#define ATTRIB_SYS 0x04 // System +#define ATTRIB_HID 0x02 // Hidden +#define ATTRIB_RO 0x01 // Read only + +typedef enum {FT_DIRECTORY, FT_FILE} FILE_TYPE; + +typedef struct { + uint32_t cluster; + sec_t sector; + int32_t offset; +} DIR_ENTRY_POSITION; + +typedef struct { + uint8_t entryData[DIR_ENTRY_DATA_SIZE]; + DIR_ENTRY_POSITION dataStart; // Points to the start of the LFN entries of a file, or the alias for no LFN + DIR_ENTRY_POSITION dataEnd; // Always points to the file/directory's alias entry + char filename[MAX_FILENAME_LENGTH]; +} DIR_ENTRY; + +// Directory entry offsets +enum DIR_ENTRY_offset { + DIR_ENTRY_name = 0x00, + DIR_ENTRY_extension = 0x08, + DIR_ENTRY_attributes = 0x0B, + DIR_ENTRY_reserved = 0x0C, + DIR_ENTRY_cTime_ms = 0x0D, + DIR_ENTRY_cTime = 0x0E, + DIR_ENTRY_cDate = 0x10, + DIR_ENTRY_aDate = 0x12, + DIR_ENTRY_clusterHigh = 0x14, + DIR_ENTRY_mTime = 0x16, + DIR_ENTRY_mDate = 0x18, + DIR_ENTRY_cluster = 0x1A, + DIR_ENTRY_fileSize = 0x1C +}; + +/* +Returns true if the file specified by entry is a directory +*/ +static inline bool _FAT_directory_isDirectory (DIR_ENTRY* entry) { + return ((entry->entryData[DIR_ENTRY_attributes] & ATTRIB_DIR) != 0); +} + +static inline bool _FAT_directory_isWritable (DIR_ENTRY* entry) { + return ((entry->entryData[DIR_ENTRY_attributes] & ATTRIB_RO) == 0); +} + +static inline bool _FAT_directory_isDot (DIR_ENTRY* entry) { + return ((entry->filename[0] == '.') && ((entry->filename[1] == '\0') || + ((entry->filename[1] == '.') && entry->filename[2] == '\0'))); +} + +/* +Reads the first directory entry from the directory starting at dirCluster +Places result in entry +entry will be destroyed even if no directory entry is found +Returns true on success, false on failure +*/ +bool _FAT_directory_getFirstEntry (PARTITION* partition, DIR_ENTRY* entry, uint32_t dirCluster); + +/* +Reads the next directory entry after the one already pointed to by entry +Places result in entry +entry will be destroyed even if no directory entry is found +Returns true on success, false on failure +*/ +bool _FAT_directory_getNextEntry (PARTITION* partition, DIR_ENTRY* entry); + +/* +Gets the directory entry corrsponding to the supplied path +entry will be destroyed even if no directory entry is found +pathEnd specifies the end of the path string, for cutting strings short if needed + specify NULL to use the full length of path + pathEnd is only a suggestion, and the path string will be searched up until the next PATH_SEPARATOR + after pathEND. +Returns true on success, false on failure +*/ +bool _FAT_directory_entryFromPath (PARTITION* partition, DIR_ENTRY* entry, const char* path, const char* pathEnd); + +/* +Changes the current directory to the one specified by path +Returns true on success, false on failure +*/ +bool _FAT_directory_chdir (PARTITION* partition, const char* path); + +/* +Removes the directory entry specified by entry +Assumes that entry is valid +Returns true on success, false on failure +*/ +bool _FAT_directory_removeEntry (PARTITION* partition, DIR_ENTRY* entry); + +/* +Add a directory entry to the directory specified by dirCluster +The fileData, dataStart and dataEnd elements of the DIR_ENTRY struct are +updated with the new directory entry position and alias. +Returns true on success, false on failure +*/ +bool _FAT_directory_addEntry (PARTITION* partition, DIR_ENTRY* entry, uint32_t dirCluster); + +/* +Get the start cluster of a file from it's entry data +*/ +uint32_t _FAT_directory_entryGetCluster (PARTITION* partition, const uint8_t* entryData); + +/* +Fill in the file name and entry data of DIR_ENTRY* entry. +Assumes that the entry's dataStart and dataEnd are correct +Returns true on success, false on failure +*/ +bool _FAT_directory_entryFromPosition (PARTITION* partition, DIR_ENTRY* entry); + +/* +Fill in a stat struct based on a file entry +*/ +void _FAT_directory_entryStat (PARTITION* partition, DIR_ENTRY* entry, struct stat *st); + +/* +Get volume label +*/ +bool _FAT_directory_getVolumeLabel (PARTITION* partition, char *label); + +#endif // _DIRECTORY_H diff --git a/portlibs/sources/libfat/disc.c b/portlibs/sources/libfat/disc.c new file mode 100644 index 00000000..5f626b6b --- /dev/null +++ b/portlibs/sources/libfat/disc.c @@ -0,0 +1,111 @@ +/* + disc.c + Interface to the low level disc functions. Used by the higher level + file system code. + + Copyright (c) 2008 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#include "disc.h" + +/* +The list of interfaces consists of a series of name/interface pairs. +The interface is returned via a simple function. This allows for +platforms where the interface has to be "assembled" before it can +be used, like DLDI on the NDS. For cases where a simple struct +is available, wrapper functions are used. +The list is terminated by a NULL/NULL entry. +*/ + +/* ====================== Wii ====================== */ +#if defined (__wii__) +#include <sdcard/wiisd_io.h> +#include <ogc/usbstorage.h> +#include <sdcard/gcsd.h> + +static const DISC_INTERFACE* get_io_wiisd (void) { + return &__io_wiisd; +} +static const DISC_INTERFACE* get_io_usbstorage (void) { + return &__io_usbstorage; +} + +static const DISC_INTERFACE* get_io_gcsda (void) { + return &__io_gcsda; +} + +static const DISC_INTERFACE* get_io_gcsdb (void) { + return &__io_gcsdb; +} + +const INTERFACE_ID _FAT_disc_interfaces[] = { + {"sd", get_io_wiisd}, + {"usb", get_io_usbstorage}, + {"carda", get_io_gcsda}, + {"cardb", get_io_gcsdb}, + {NULL, NULL} +}; + +/* ==================== Gamecube ==================== */ +#elif defined (__gamecube__) +#include <sdcard/gcsd.h> + +static const DISC_INTERFACE* get_io_gcsda (void) { + return &__io_gcsda; +} +static const DISC_INTERFACE* get_io_gcsdb (void) { + return &__io_gcsdb; +} + +const INTERFACE_ID _FAT_disc_interfaces[] = { + {"carda", get_io_gcsda}, + {"cardb", get_io_gcsdb}, + {NULL, NULL} +}; + +/* ====================== NDS ====================== */ +#elif defined (NDS) +#include <nds/arm9/dldi.h> + +static const DISC_INTERFACE* get_io_dsisd (void) { + return &__io_dsisd; +} + +const INTERFACE_ID _FAT_disc_interfaces[] = { + {"sd", get_io_dsisd}, + {"fat", dldiGetInternal}, + {NULL, NULL} +}; + +/* ====================== GBA ====================== */ +#elif defined (GBA) +#include <disc.h> + +const INTERFACE_ID _FAT_disc_interfaces[] = { + {"fat", discGetInterface}, + {NULL, NULL} +}; + +#endif + diff --git a/portlibs/sources/libfat/disc.h b/portlibs/sources/libfat/disc.h new file mode 100644 index 00000000..5c955f90 --- /dev/null +++ b/portlibs/sources/libfat/disc.h @@ -0,0 +1,110 @@ +/* + disc.h + Interface to the low level disc functions. Used by the higher level + file system code. + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ +#ifndef _DISC_H +#define _DISC_H + +#include "common.h" + +/* +A list of all default devices to try at startup, +terminated by a {NULL,NULL} entry. +*/ +typedef struct { + const char* name; + const DISC_INTERFACE* (*getInterface)(void); +} INTERFACE_ID; +extern const INTERFACE_ID _FAT_disc_interfaces[]; + +/* +Check if a disc is inserted +Return true if a disc is inserted and ready, false otherwise +*/ +static inline bool _FAT_disc_isInserted (const DISC_INTERFACE* disc) { + return disc->isInserted(); +} + +/* +Read numSectors sectors from a disc, starting at sector. +numSectors is between 1 and LIMIT_SECTORS if LIMIT_SECTORS is defined, +else it is at least 1 +sector is 0 or greater +buffer is a pointer to the memory to fill +*/ +static inline bool _FAT_disc_readSectors (const DISC_INTERFACE* disc, sec_t sector, sec_t numSectors, void* buffer) { + return disc->readSectors (sector, numSectors, buffer); +} + +/* +Write numSectors sectors to a disc, starting at sector. +numSectors is between 1 and LIMIT_SECTORS if LIMIT_SECTORS is defined, +else it is at least 1 +sector is 0 or greater +buffer is a pointer to the memory to read from +*/ +static inline bool _FAT_disc_writeSectors (const DISC_INTERFACE* disc, sec_t sector, sec_t numSectors, const void* buffer) { + return disc->writeSectors (sector, numSectors, buffer); +} + +/* +Reset the card back to a ready state +*/ +static inline bool _FAT_disc_clearStatus (const DISC_INTERFACE* disc) { + return disc->clearStatus(); +} + +/* +Initialise the disc to a state ready for data reading or writing +*/ +static inline bool _FAT_disc_startup (const DISC_INTERFACE* disc) { + return disc->startup(); +} + +/* +Put the disc in a state ready for power down. +Complete any pending writes and disable the disc if necessary +*/ +static inline bool _FAT_disc_shutdown (const DISC_INTERFACE* disc) { + return disc->shutdown(); +} + +/* +Return a 32 bit value unique to each type of interface +*/ +static inline uint32_t _FAT_disc_hostType (const DISC_INTERFACE* disc) { + return disc->ioType; +} + +/* +Return a 32 bit value that specifies the capabilities of the disc +*/ +static inline uint32_t _FAT_disc_features (const DISC_INTERFACE* disc) { + return disc->features; +} + +#endif // _DISC_H diff --git a/portlibs/sources/libfat/fat.h b/portlibs/sources/libfat/fat.h new file mode 100644 index 00000000..82c973d3 --- /dev/null +++ b/portlibs/sources/libfat/fat.h @@ -0,0 +1,104 @@ +/* + fat.h + Simple functionality for startup, mounting and unmounting of FAT-based devices. + + Copyright (c) 2006 - 2009 + Michael "Chishm" Chisholm + Dave "WinterMute" Murphy + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + + +#ifndef _LIBFAT_H +#define _LIBFAT_H + +#ifdef __cplusplus +extern "C" { +#endif + +// When compiling for NDS, make sure NDS is defined +#ifndef NDS + #if defined ARM9 || defined ARM7 + #define NDS + #endif +#endif + +#include <stdint.h> + +#if defined(__gamecube__) || defined (__wii__) +# include <ogc/disc_io.h> +#else +# ifdef NDS +# include "nds/disc_io.h" +# else +# include "disc_io.h" +# endif +#endif + +/* +Initialise any inserted block-devices. +Add the fat device driver to the devoptab, making it available for standard file functions. +cacheSize: The number of pages to allocate for each inserted block-device +setAsDefaultDevice: if true, make this the default device driver for file operations +*/ +extern bool fatInit (uint32_t cacheSize, bool setAsDefaultDevice); + +/* +Calls fatInit with setAsDefaultDevice = true and cacheSize optimised for the host system. +*/ +extern bool fatInitDefault (void); + +/* +Mount the device pointed to by interface, and set up a devoptab entry for it as "name:". +You can then access the filesystem using "name:/". +This will mount the active partition or the first valid partition on the disc, +and will use a cache size optimized for the host system. +*/ +extern bool fatMountSimple (const char* name, const DISC_INTERFACE* interface); + +/* +Mount the device pointed to by interface, and set up a devoptab entry for it as "name:". +You can then access the filesystem using "name:/". +If startSector = 0, it will mount the active partition of the first valid partition on +the disc. Otherwise it will try to mount the partition starting at startSector. +cacheSize specifies the number of pages to allocate for the cache. +This will not startup the disc, so you need to call interface->startup(); first. +*/ +extern bool fatMount (const char* name, const DISC_INTERFACE* interface, sec_t startSector, uint32_t cacheSize, uint32_t SectorsPerPage); + +/* +Unmount the partition specified by name. +If there are open files, it will attempt to synchronise them to disc. +*/ +extern void fatUnmount (const char* name); + +/* +Get Volume Label +*/ +extern void fatGetVolumeLabel (const char* name, char *label); + +#ifdef __cplusplus +} +#endif + +#endif // _LIBFAT_H diff --git a/portlibs/sources/libfat/fatdir.c b/portlibs/sources/libfat/fatdir.c new file mode 100644 index 00000000..52a6fb51 --- /dev/null +++ b/portlibs/sources/libfat/fatdir.c @@ -0,0 +1,619 @@ +/* + fatdir.c + + Functions used by the newlib disc stubs to interface with + this library + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#include <string.h> +#include <errno.h> +#include <ctype.h> +#include <unistd.h> +#include <sys/iosupport.h> + +#include "fatdir.h" + +#include "cache.h" +#include "file_allocation_table.h" +#include "partition.h" +#include "directory.h" +#include "bit_ops.h" +#include "filetime.h" +#include "lock.h" + + +int _FAT_stat_r (struct _reent *r, const char *path, struct stat *st) { + PARTITION* partition = NULL; + DIR_ENTRY dirEntry; + + // Get the partition this file is on + partition = _FAT_partition_getPartitionFromPath (path); + if (partition == NULL) { + r->_errno = ENODEV; + return -1; + } + + // Move the path pointer to the start of the actual path + if (strchr (path, ':') != NULL) { + path = strchr (path, ':') + 1; + } + if (strchr (path, ':') != NULL) { + r->_errno = EINVAL; + return -1; + } + + _FAT_lock(&partition->lock); + + // Search for the file on the disc + if (!_FAT_directory_entryFromPath (partition, &dirEntry, path, NULL)) { + _FAT_unlock(&partition->lock); + r->_errno = ENOENT; + return -1; + } + + // Fill in the stat struct + _FAT_directory_entryStat (partition, &dirEntry, st); + + _FAT_unlock(&partition->lock); + return 0; +} + +int _FAT_link_r (struct _reent *r, const char *existing, const char *newLink) { + r->_errno = ENOTSUP; + return -1; +} + +int _FAT_unlink_r (struct _reent *r, const char *path) { + PARTITION* partition = NULL; + DIR_ENTRY dirEntry; + DIR_ENTRY dirContents; + uint32_t cluster; + bool nextEntry; + bool errorOccured = false; + + // Get the partition this directory is on + partition = _FAT_partition_getPartitionFromPath (path); + if (partition == NULL) { + r->_errno = ENODEV; + return -1; + } + + // Make sure we aren't trying to write to a read-only disc + if (partition->readOnly) { + r->_errno = EROFS; + return -1; + } + + // Move the path pointer to the start of the actual path + if (strchr (path, ':') != NULL) { + path = strchr (path, ':') + 1; + } + if (strchr (path, ':') != NULL) { + r->_errno = EINVAL; + return -1; + } + + _FAT_lock(&partition->lock); + + // Search for the file on the disc + if (!_FAT_directory_entryFromPath (partition, &dirEntry, path, NULL)) { + _FAT_unlock(&partition->lock); + r->_errno = ENOENT; + return -1; + } + + cluster = _FAT_directory_entryGetCluster (partition, dirEntry.entryData); + + + // If this is a directory, make sure it is empty + if (_FAT_directory_isDirectory (&dirEntry)) { + nextEntry = _FAT_directory_getFirstEntry (partition, &dirContents, cluster); + + while (nextEntry) { + if (!_FAT_directory_isDot (&dirContents)) { + // The directory had something in it that isn't a reference to itself or it's parent + _FAT_unlock(&partition->lock); + r->_errno = EPERM; + return -1; + } + nextEntry = _FAT_directory_getNextEntry (partition, &dirContents); + } + } + + if (_FAT_fat_isValidCluster(partition, cluster)) { + // Remove the cluster chain for this file + if (!_FAT_fat_clearLinks (partition, cluster)) { + r->_errno = EIO; + errorOccured = true; + } + } + + // Remove the directory entry for this file + if (!_FAT_directory_removeEntry (partition, &dirEntry)) { + r->_errno = EIO; + errorOccured = true; + } + + // Flush any sectors in the disc cache + if (!_FAT_cache_flush(partition->cache)) { + r->_errno = EIO; + errorOccured = true; + } + + _FAT_unlock(&partition->lock); + if (errorOccured) { + return -1; + } else { + return 0; + } +} + +int _FAT_chdir_r (struct _reent *r, const char *path) { + PARTITION* partition = NULL; + + // Get the partition this directory is on + partition = _FAT_partition_getPartitionFromPath (path); + if (partition == NULL) { + r->_errno = ENODEV; + return -1; + } + + // Move the path pointer to the start of the actual path + if (strchr (path, ':') != NULL) { + path = strchr (path, ':') + 1; + } + if (strchr (path, ':') != NULL) { + r->_errno = EINVAL; + return -1; + } + + _FAT_lock(&partition->lock); + + // Try changing directory + if (_FAT_directory_chdir (partition, path)) { + // Successful + _FAT_unlock(&partition->lock); + return 0; + } else { + // Failed + _FAT_unlock(&partition->lock); + r->_errno = ENOTDIR; + return -1; + } +} + +int _FAT_rename_r (struct _reent *r, const char *oldName, const char *newName) { + PARTITION* partition = NULL; + DIR_ENTRY oldDirEntry; + DIR_ENTRY newDirEntry; + const char *pathEnd; + uint32_t dirCluster; + + // Get the partition this directory is on + partition = _FAT_partition_getPartitionFromPath (oldName); + if (partition == NULL) { + r->_errno = ENODEV; + return -1; + } + + _FAT_lock(&partition->lock); + + // Make sure the same partition is used for the old and new names + if (partition != _FAT_partition_getPartitionFromPath (newName)) { + _FAT_unlock(&partition->lock); + r->_errno = EXDEV; + return -1; + } + + // Make sure we aren't trying to write to a read-only disc + if (partition->readOnly) { + _FAT_unlock(&partition->lock); + r->_errno = EROFS; + return -1; + } + + // Move the path pointer to the start of the actual path + if (strchr (oldName, ':') != NULL) { + oldName = strchr (oldName, ':') + 1; + } + if (strchr (oldName, ':') != NULL) { + _FAT_unlock(&partition->lock); + r->_errno = EINVAL; + return -1; + } + if (strchr (newName, ':') != NULL) { + newName = strchr (newName, ':') + 1; + } + if (strchr (newName, ':') != NULL) { + _FAT_unlock(&partition->lock); + r->_errno = EINVAL; + return -1; + } + + // Search for the file on the disc + if (!_FAT_directory_entryFromPath (partition, &oldDirEntry, oldName, NULL)) { + _FAT_unlock(&partition->lock); + r->_errno = ENOENT; + return -1; + } + + // Make sure there is no existing file / directory with the new name + if (_FAT_directory_entryFromPath (partition, &newDirEntry, newName, NULL)) { + _FAT_unlock(&partition->lock); + r->_errno = EEXIST; + return -1; + } + + // Create the new file entry + // Get the directory it has to go in + pathEnd = strrchr (newName, DIR_SEPARATOR); + if (pathEnd == NULL) { + // No path was specified + dirCluster = partition->cwdCluster; + pathEnd = newName; + } else { + // Path was specified -- get the right dirCluster + // Recycling newDirEntry, since it needs to be recreated anyway + if (!_FAT_directory_entryFromPath (partition, &newDirEntry, newName, pathEnd) || + !_FAT_directory_isDirectory(&newDirEntry)) { + _FAT_unlock(&partition->lock); + r->_errno = ENOTDIR; + return -1; + } + dirCluster = _FAT_directory_entryGetCluster (partition, newDirEntry.entryData); + // Move the pathEnd past the last DIR_SEPARATOR + pathEnd += 1; + } + + // Copy the entry data + memcpy (&newDirEntry, &oldDirEntry, sizeof(DIR_ENTRY)); + + // Set the new name + strncpy (newDirEntry.filename, pathEnd, MAX_FILENAME_LENGTH - 1); + + // Write the new entry + if (!_FAT_directory_addEntry (partition, &newDirEntry, dirCluster)) { + _FAT_unlock(&partition->lock); + r->_errno = ENOSPC; + return -1; + } + + // Remove the old entry + if (!_FAT_directory_removeEntry (partition, &oldDirEntry)) { + _FAT_unlock(&partition->lock); + r->_errno = EIO; + return -1; + } + + // Flush any sectors in the disc cache + if (!_FAT_cache_flush (partition->cache)) { + _FAT_unlock(&partition->lock); + r->_errno = EIO; + return -1; + } + + _FAT_unlock(&partition->lock); + return 0; +} + +int _FAT_mkdir_r (struct _reent *r, const char *path, int mode) { + PARTITION* partition = NULL; + bool fileExists; + DIR_ENTRY dirEntry; + const char* pathEnd; + uint32_t parentCluster, dirCluster; + uint8_t newEntryData[DIR_ENTRY_DATA_SIZE]; + + partition = _FAT_partition_getPartitionFromPath (path); + if (partition == NULL) { + r->_errno = ENODEV; + return -1; + } + + // Move the path pointer to the start of the actual path + if (strchr (path, ':') != NULL) { + path = strchr (path, ':') + 1; + } + if (strchr (path, ':') != NULL) { + r->_errno = EINVAL; + return -1; + } + + _FAT_lock(&partition->lock); + + // Search for the file/directory on the disc + fileExists = _FAT_directory_entryFromPath (partition, &dirEntry, path, NULL); + + // Make sure it doesn't exist + if (fileExists) { + _FAT_unlock(&partition->lock); + r->_errno = EEXIST; + return -1; + } + + if (partition->readOnly) { + // We can't write to a read-only partition + _FAT_unlock(&partition->lock); + r->_errno = EROFS; + return -1; + } + + // Get the directory it has to go in + pathEnd = strrchr (path, DIR_SEPARATOR); + if (pathEnd == NULL) { + // No path was specified + parentCluster = partition->cwdCluster; + pathEnd = path; + } else { + // Path was specified -- get the right parentCluster + // Recycling dirEntry, since it needs to be recreated anyway + if (!_FAT_directory_entryFromPath (partition, &dirEntry, path, pathEnd) || + !_FAT_directory_isDirectory(&dirEntry)) { + _FAT_unlock(&partition->lock); + r->_errno = ENOTDIR; + return -1; + } + parentCluster = _FAT_directory_entryGetCluster (partition, dirEntry.entryData); + // Move the pathEnd past the last DIR_SEPARATOR + pathEnd += 1; + } + // Create the entry data + strncpy (dirEntry.filename, pathEnd, MAX_FILENAME_LENGTH - 1); + memset (dirEntry.entryData, 0, DIR_ENTRY_DATA_SIZE); + + // Set the creation time and date + dirEntry.entryData[DIR_ENTRY_cTime_ms] = 0; + u16_to_u8array (dirEntry.entryData, DIR_ENTRY_cTime, _FAT_filetime_getTimeFromRTC()); + u16_to_u8array (dirEntry.entryData, DIR_ENTRY_cDate, _FAT_filetime_getDateFromRTC()); + u16_to_u8array (dirEntry.entryData, DIR_ENTRY_mTime, _FAT_filetime_getTimeFromRTC()); + u16_to_u8array (dirEntry.entryData, DIR_ENTRY_mDate, _FAT_filetime_getDateFromRTC()); + u16_to_u8array (dirEntry.entryData, DIR_ENTRY_aDate, _FAT_filetime_getDateFromRTC()); + + // Set the directory attribute + dirEntry.entryData[DIR_ENTRY_attributes] = ATTRIB_DIR; + + // Get a cluster for the new directory + dirCluster = _FAT_fat_linkFreeClusterCleared (partition, CLUSTER_FREE); + if (!_FAT_fat_isValidCluster(partition, dirCluster)) { + // No space left on disc for the cluster + _FAT_unlock(&partition->lock); + r->_errno = ENOSPC; + return -1; + } + u16_to_u8array (dirEntry.entryData, DIR_ENTRY_cluster, dirCluster); + u16_to_u8array (dirEntry.entryData, DIR_ENTRY_clusterHigh, dirCluster >> 16); + + // Write the new directory's entry to it's parent + if (!_FAT_directory_addEntry (partition, &dirEntry, parentCluster)) { + _FAT_unlock(&partition->lock); + r->_errno = ENOSPC; + return -1; + } + + // Create the dot entry within the directory + memset (newEntryData, 0, DIR_ENTRY_DATA_SIZE); + memset (newEntryData, ' ', 11); + newEntryData[DIR_ENTRY_name] = '.'; + newEntryData[DIR_ENTRY_attributes] = ATTRIB_DIR; + u16_to_u8array (newEntryData, DIR_ENTRY_cluster, dirCluster); + u16_to_u8array (newEntryData, DIR_ENTRY_clusterHigh, dirCluster >> 16); + + // Write it to the directory, erasing that sector in the process + _FAT_cache_eraseWritePartialSector ( partition->cache, newEntryData, + _FAT_fat_clusterToSector (partition, dirCluster), 0, DIR_ENTRY_DATA_SIZE); + + + // Create the double dot entry within the directory + + // if ParentDir == Rootdir then ".."" always link to Cluster 0 + if(parentCluster == partition->rootDirCluster) + parentCluster = FAT16_ROOT_DIR_CLUSTER; + + newEntryData[DIR_ENTRY_name + 1] = '.'; + u16_to_u8array (newEntryData, DIR_ENTRY_cluster, parentCluster); + u16_to_u8array (newEntryData, DIR_ENTRY_clusterHigh, parentCluster >> 16); + + // Write it to the directory + _FAT_cache_writePartialSector ( partition->cache, newEntryData, + _FAT_fat_clusterToSector (partition, dirCluster), DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + + // Flush any sectors in the disc cache + if (!_FAT_cache_flush(partition->cache)) { + _FAT_unlock(&partition->lock); + r->_errno = EIO; + return -1; + } + + _FAT_unlock(&partition->lock); + return 0; +} + +int _FAT_statvfs_r (struct _reent *r, const char *path, struct statvfs *buf) +{ + PARTITION* partition = NULL; + unsigned int freeClusterCount; + + // Get the partition of the requested path + partition = _FAT_partition_getPartitionFromPath (path); + if (partition == NULL) { + r->_errno = ENODEV; + return -1; + } + + _FAT_lock(&partition->lock); + + if(memcmp(&buf->f_flag, "SCAN", 4) == 0) + { + //Special command was given to sync the numberFreeCluster + _FAT_partition_createFSinfo(partition); + } + + if(partition->filesysType == FS_FAT32) + freeClusterCount = partition->fat.numberFreeCluster; + else + freeClusterCount = _FAT_fat_freeClusterCount (partition); + + // FAT clusters = POSIX blocks + buf->f_bsize = partition->bytesPerCluster; // File system block size. + buf->f_frsize = partition->bytesPerCluster; // Fundamental file system block size. + + buf->f_blocks = partition->fat.lastCluster - CLUSTER_FIRST + 1; // Total number of blocks on file system in units of f_frsize. + buf->f_bfree = freeClusterCount; // Total number of free blocks. + buf->f_bavail = freeClusterCount; // Number of free blocks available to non-privileged process. + + // Treat requests for info on inodes as clusters + buf->f_files = partition->fat.lastCluster - CLUSTER_FIRST + 1; // Total number of file serial numbers. + buf->f_ffree = freeClusterCount; // Total number of free file serial numbers. + buf->f_favail = freeClusterCount; // Number of file serial numbers available to non-privileged process. + + // File system ID. 32bit ioType value + buf->f_fsid = _FAT_disc_hostType(partition->disc); + + // Bit mask of f_flag values. + buf->f_flag = ST_NOSUID /* No support for ST_ISUID and ST_ISGID file mode bits */ + | (partition->readOnly ? ST_RDONLY /* Read only file system */ : 0 ) ; + // Maximum filename length. + buf->f_namemax = MAX_FILENAME_LENGTH; + + _FAT_unlock(&partition->lock); + return 0; +} + +DIR_ITER* _FAT_diropen_r(struct _reent *r, DIR_ITER *dirState, const char *path) { + DIR_ENTRY dirEntry; + DIR_STATE_STRUCT* state = (DIR_STATE_STRUCT*) (dirState->dirStruct); + bool fileExists; + + state->partition = _FAT_partition_getPartitionFromPath (path); + if (state->partition == NULL) { + r->_errno = ENODEV; + return NULL; + } + + // Move the path pointer to the start of the actual path + if (strchr (path, ':') != NULL) { + path = strchr (path, ':') + 1; + } + if (strchr (path, ':') != NULL) { + r->_errno = EINVAL; + return NULL; + } + + _FAT_lock(&state->partition->lock); + + // Get the start cluster of the directory + fileExists = _FAT_directory_entryFromPath (state->partition, &dirEntry, path, NULL); + + if (!fileExists) { + _FAT_unlock(&state->partition->lock); + r->_errno = ENOENT; + return NULL; + } + + // Make sure it is a directory + if (! _FAT_directory_isDirectory (&dirEntry)) { + _FAT_unlock(&state->partition->lock); + r->_errno = ENOTDIR; + return NULL; + } + + // Save the start cluster for use when resetting the directory data + state->startCluster = _FAT_directory_entryGetCluster (state->partition, dirEntry.entryData); + + // Get the first entry for use with a call to dirnext + state->validEntry = + _FAT_directory_getFirstEntry (state->partition, &(state->currentEntry), state->startCluster); + + // We are now using this entry + state->inUse = true; + _FAT_unlock(&state->partition->lock); + return (DIR_ITER*) state; +} + +int _FAT_dirreset_r (struct _reent *r, DIR_ITER *dirState) { + DIR_STATE_STRUCT* state = (DIR_STATE_STRUCT*) (dirState->dirStruct); + + _FAT_lock(&state->partition->lock); + + // Make sure we are still using this entry + if (!state->inUse) { + _FAT_unlock(&state->partition->lock); + r->_errno = EBADF; + return -1; + } + + // Get the first entry for use with a call to dirnext + state->validEntry = + _FAT_directory_getFirstEntry (state->partition, &(state->currentEntry), state->startCluster); + + _FAT_unlock(&state->partition->lock); + return 0; +} + +int _FAT_dirnext_r (struct _reent *r, DIR_ITER *dirState, char *filename, struct stat *filestat) { + DIR_STATE_STRUCT* state = (DIR_STATE_STRUCT*) (dirState->dirStruct); + + _FAT_lock(&state->partition->lock); + + // Make sure we are still using this entry + if (!state->inUse) { + _FAT_unlock(&state->partition->lock); + r->_errno = EBADF; + return -1; + } + + // Make sure there is another file to report on + if (! state->validEntry) { + _FAT_unlock(&state->partition->lock); + r->_errno = ENOENT; + return -1; + } + + // Get the filename + strncpy (filename, state->currentEntry.filename, MAX_FILENAME_LENGTH); + // Get the stats, if requested + if (filestat != NULL) { + _FAT_directory_entryStat (state->partition, &(state->currentEntry), filestat); + } + + // Look for the next entry for use next time + state->validEntry = + _FAT_directory_getNextEntry (state->partition, &(state->currentEntry)); + + _FAT_unlock(&state->partition->lock); + return 0; +} + +int _FAT_dirclose_r (struct _reent *r, DIR_ITER *dirState) { + DIR_STATE_STRUCT* state = (DIR_STATE_STRUCT*) (dirState->dirStruct); + + // We are no longer using this entry + _FAT_lock(&state->partition->lock); + state->inUse = false; + _FAT_unlock(&state->partition->lock); + + return 0; +} diff --git a/portlibs/sources/libfat/fatdir.h b/portlibs/sources/libfat/fatdir.h new file mode 100644 index 00000000..426dd30b --- /dev/null +++ b/portlibs/sources/libfat/fatdir.h @@ -0,0 +1,73 @@ +/* + fatdir.h + + Functions used by the newlib disc stubs to interface with + this library + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + + +#ifndef _FATDIR_H +#define _FATDIR_H + +#include <sys/reent.h> +#include <sys/stat.h> +#include <sys/statvfs.h> +#include <sys/iosupport.h> +#include "common.h" +#include "directory.h" + +typedef struct { + PARTITION* partition; + DIR_ENTRY currentEntry; + uint32_t startCluster; + bool inUse; + bool validEntry; +} DIR_STATE_STRUCT; + +extern int _FAT_stat_r (struct _reent *r, const char *path, struct stat *st); + +extern int _FAT_link_r (struct _reent *r, const char *existing, const char *newLink); + +extern int _FAT_unlink_r (struct _reent *r, const char *name); + +extern int _FAT_chdir_r (struct _reent *r, const char *name); + +extern int _FAT_rename_r (struct _reent *r, const char *oldName, const char *newName); + +extern int _FAT_mkdir_r (struct _reent *r, const char *path, int mode); + +extern int _FAT_statvfs_r (struct _reent *r, const char *path, struct statvfs *buf); + +/* +Directory iterator functions +*/ +extern DIR_ITER* _FAT_diropen_r(struct _reent *r, DIR_ITER *dirState, const char *path); +extern int _FAT_dirreset_r (struct _reent *r, DIR_ITER *dirState); +extern int _FAT_dirnext_r (struct _reent *r, DIR_ITER *dirState, char *filename, struct stat *filestat); +extern int _FAT_dirclose_r (struct _reent *r, DIR_ITER *dirState); + + +#endif // _FATDIR_H diff --git a/portlibs/sources/libfat/fatfile.c b/portlibs/sources/libfat/fatfile.c new file mode 100644 index 00000000..e2a99f6a --- /dev/null +++ b/portlibs/sources/libfat/fatfile.c @@ -0,0 +1,1133 @@ +/* + fatfile.c + + Functions used by the newlib disc stubs to interface with + this library + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. + + 2009-10-23 oggzee: fixes for cluster aligned file size (write, truncate, seek) +*/ + + +#include "fatfile.h" + +#include <fcntl.h> +#include <string.h> +#include <errno.h> +#include <ctype.h> +#include <unistd.h> + +#include "cache.h" +#include "file_allocation_table.h" +#include "bit_ops.h" +#include "filetime.h" +#include "lock.h" + +int _FAT_open_r (struct _reent *r, void *fileStruct, const char *path, int flags, int mode) { + PARTITION* partition = NULL; + bool fileExists; + DIR_ENTRY dirEntry; + const char* pathEnd; + uint32_t dirCluster; + FILE_STRUCT* file = (FILE_STRUCT*) fileStruct; + partition = _FAT_partition_getPartitionFromPath (path); + + if (partition == NULL) { + r->_errno = ENODEV; + return -1; + } + + // Move the path pointer to the start of the actual path + if (strchr (path, ':') != NULL) { + path = strchr (path, ':') + 1; + } + if (strchr (path, ':') != NULL) { + r->_errno = EINVAL; + return -1; + } + + // Determine which mode the file is openned for + if ((flags & 0x03) == O_RDONLY) { + // Open the file for read-only access + file->read = true; + file->write = false; + file->append = false; + } else if ((flags & 0x03) == O_WRONLY) { + // Open file for write only access + file->read = false; + file->write = true; + file->append = false; + } else if ((flags & 0x03) == O_RDWR) { + // Open file for read/write access + file->read = true; + file->write = true; + file->append = false; + } else { + r->_errno = EACCES; + return -1; + } + + // Make sure we aren't trying to write to a read-only disc + if (file->write && partition->readOnly) { + r->_errno = EROFS; + return -1; + } + + // Search for the file on the disc + _FAT_lock(&partition->lock); + fileExists = _FAT_directory_entryFromPath (partition, &dirEntry, path, NULL); + + // The file shouldn't exist if we are trying to create it + if ((flags & O_CREAT) && (flags & O_EXCL) && fileExists) { + _FAT_unlock(&partition->lock); + r->_errno = EEXIST; + return -1; + } + + // It should not be a directory if we're openning a file, + if (fileExists && _FAT_directory_isDirectory(&dirEntry)) { + _FAT_unlock(&partition->lock); + r->_errno = EISDIR; + return -1; + } + + // We haven't modified the file yet + file->modified = false; + + // If the file doesn't exist, create it if we're allowed to + if (!fileExists) { + if (flags & O_CREAT) { + if (partition->readOnly) { + // We can't write to a read-only partition + _FAT_unlock(&partition->lock); + r->_errno = EROFS; + return -1; + } + // Create the file + // Get the directory it has to go in + pathEnd = strrchr (path, DIR_SEPARATOR); + if (pathEnd == NULL) { + // No path was specified + dirCluster = partition->cwdCluster; + pathEnd = path; + } else { + // Path was specified -- get the right dirCluster + // Recycling dirEntry, since it needs to be recreated anyway + if (!_FAT_directory_entryFromPath (partition, &dirEntry, path, pathEnd) || + !_FAT_directory_isDirectory(&dirEntry)) { + _FAT_unlock(&partition->lock); + r->_errno = ENOTDIR; + return -1; + } + dirCluster = _FAT_directory_entryGetCluster (partition, dirEntry.entryData); + // Move the pathEnd past the last DIR_SEPARATOR + pathEnd += 1; + } + // Create the entry data + strncpy (dirEntry.filename, pathEnd, MAX_FILENAME_LENGTH - 1); + memset (dirEntry.entryData, 0, DIR_ENTRY_DATA_SIZE); + + // Set the creation time and date + dirEntry.entryData[DIR_ENTRY_cTime_ms] = 0; + u16_to_u8array (dirEntry.entryData, DIR_ENTRY_cTime, _FAT_filetime_getTimeFromRTC()); + u16_to_u8array (dirEntry.entryData, DIR_ENTRY_cDate, _FAT_filetime_getDateFromRTC()); + + if (!_FAT_directory_addEntry (partition, &dirEntry, dirCluster)) { + _FAT_unlock(&partition->lock); + r->_errno = ENOSPC; + return -1; + } + + // File entry is modified + file->modified = true; + } else { + // file doesn't exist, and we aren't creating it + _FAT_unlock(&partition->lock); + r->_errno = ENOENT; + return -1; + } + } + + file->filesize = u8array_to_u32 (dirEntry.entryData, DIR_ENTRY_fileSize); + + /* Allow LARGEFILEs with undefined results + // Make sure that the file size can fit in the available space + if (!(flags & O_LARGEFILE) && (file->filesize >= (1<<31))) { + r->_errno = EFBIG; + return -1; + } + */ + + // Make sure we aren't trying to write to a read-only file + if (file->write && !_FAT_directory_isWritable(&dirEntry)) { + _FAT_unlock(&partition->lock); + r->_errno = EROFS; + return -1; + } + + // Associate this file with a particular partition + file->partition = partition; + + file->startCluster = _FAT_directory_entryGetCluster (partition, dirEntry.entryData); + + // Truncate the file if requested + if ((flags & O_TRUNC) && file->write && (file->startCluster != 0)) { + _FAT_fat_clearLinks (partition, file->startCluster); + file->startCluster = CLUSTER_FREE; + file->filesize = 0; + // File is modified since we just cut it all off + file->modified = true; + } + + // Remember the position of this file's directory entry + file->dirEntryStart = dirEntry.dataStart; // Points to the start of the LFN entries of a file, or the alias for no LFN + file->dirEntryEnd = dirEntry.dataEnd; + + // Reset read/write pointer + file->currentPosition = 0; + file->rwPosition.cluster = file->startCluster; + file->rwPosition.sector = 0; + file->rwPosition.byte = 0; + + if (flags & O_APPEND) { + file->append = true; + + // Set append pointer to the end of the file + file->appendPosition.cluster = _FAT_fat_lastCluster (partition, file->startCluster); + file->appendPosition.sector = (file->filesize % partition->bytesPerCluster) / partition->bytesPerSector; + file->appendPosition.byte = file->filesize % partition->bytesPerSector; + + // Check if the end of the file is on the end of a cluster + if ( (file->filesize > 0) && ((file->filesize % partition->bytesPerCluster)==0) ){ + // Set flag to allocate a new cluster + file->appendPosition.sector = partition->sectorsPerCluster; + file->appendPosition.byte = 0; + } + } else { + file->append = false; + // Use something sane for the append pointer, so the whole file struct contains known values + file->appendPosition = file->rwPosition; + } + + file->inUse = true; + + // Insert this file into the double-linked list of open files + partition->openFileCount += 1; + if (partition->firstOpenFile) { + file->nextOpenFile = partition->firstOpenFile; + partition->firstOpenFile->prevOpenFile = file; + } else { + file->nextOpenFile = NULL; + } + file->prevOpenFile = NULL; + partition->firstOpenFile = file; + + _FAT_unlock(&partition->lock); + + return (int) file; +} + +/* +Synchronizes the file data to disc. +Does no locking of its own -- lock the partition before calling. +Returns 0 on success, an error code on failure. +*/ +int _FAT_syncToDisc (FILE_STRUCT* file) { + uint8_t dirEntryData[DIR_ENTRY_DATA_SIZE]; + + if (!file || !file->inUse) { + return EBADF; + } + + if (file->write && file->modified) { + // Load the old entry + _FAT_cache_readPartialSector (file->partition->cache, dirEntryData, + _FAT_fat_clusterToSector(file->partition, file->dirEntryEnd.cluster) + file->dirEntryEnd.sector, + file->dirEntryEnd.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + + // Write new data to the directory entry + // File size + u32_to_u8array (dirEntryData, DIR_ENTRY_fileSize, file->filesize); + + // Start cluster + u16_to_u8array (dirEntryData, DIR_ENTRY_cluster, file->startCluster); + u16_to_u8array (dirEntryData, DIR_ENTRY_clusterHigh, file->startCluster >> 16); + + // Modification time and date + u16_to_u8array (dirEntryData, DIR_ENTRY_mTime, _FAT_filetime_getTimeFromRTC()); + u16_to_u8array (dirEntryData, DIR_ENTRY_mDate, _FAT_filetime_getDateFromRTC()); + + // Access date + u16_to_u8array (dirEntryData, DIR_ENTRY_aDate, _FAT_filetime_getDateFromRTC()); + + // Set archive attribute + dirEntryData[DIR_ENTRY_attributes] |= ATTRIB_ARCH; + + // Write the new entry + _FAT_cache_writePartialSector (file->partition->cache, dirEntryData, + _FAT_fat_clusterToSector(file->partition, file->dirEntryEnd.cluster) + file->dirEntryEnd.sector, + file->dirEntryEnd.offset * DIR_ENTRY_DATA_SIZE, DIR_ENTRY_DATA_SIZE); + + // Flush any sectors in the disc cache + if (!_FAT_cache_flush(file->partition->cache)) { + return EIO; + } + } + + file->modified = false; + + return 0; +} + + +int _FAT_close_r (struct _reent *r, int fd) { + FILE_STRUCT* file = (FILE_STRUCT*) fd; + int ret = 0; + + if (!file->inUse) { + r->_errno = EBADF; + return -1; + } + + _FAT_lock(&file->partition->lock); + + if (file->write) { + ret = _FAT_syncToDisc (file); + if (ret != 0) { + r->_errno = ret; + ret = -1; + } + } + + file->inUse = false; + + // Remove this file from the double-linked list of open files + file->partition->openFileCount -= 1; + if (file->nextOpenFile) { + file->nextOpenFile->prevOpenFile = file->prevOpenFile; + } + if (file->prevOpenFile) { + file->prevOpenFile->nextOpenFile = file->nextOpenFile; + } else { + file->partition->firstOpenFile = file->nextOpenFile; + } + + _FAT_unlock(&file->partition->lock); + + return ret; +} + +ssize_t _FAT_read_r (struct _reent *r, int fd, char *ptr, size_t len) { + FILE_STRUCT* file = (FILE_STRUCT*) fd; + PARTITION* partition; + CACHE* cache; + FILE_POSITION position; + uint32_t tempNextCluster; + unsigned int tempVar; + size_t remain; + bool flagNoError = true; + + // Short circuit cases where len is 0 (or less) + if (len <= 0) { + return 0; + } + + // Make sure we can actually read from the file + if ((file == NULL) || !file->inUse || !file->read) { + r->_errno = EBADF; + return -1; + } + + partition = file->partition; + _FAT_lock(&partition->lock); + + // Don't try to read if the read pointer is past the end of file + if (file->currentPosition >= file->filesize || file->startCluster == CLUSTER_FREE) { + r->_errno = EOVERFLOW; + _FAT_unlock(&partition->lock); + return 0; + } + + // Don't read past end of file + if (len + file->currentPosition > file->filesize) { + r->_errno = EOVERFLOW; + len = file->filesize - file->currentPosition; + } + + remain = len; + position = file->rwPosition; + cache = file->partition->cache; + + // Align to sector + tempVar = partition->bytesPerSector - position.byte; + if (tempVar > remain) { + tempVar = remain; + } + + if ((tempVar < partition->bytesPerSector) && flagNoError) + { + _FAT_cache_readPartialSector ( cache, ptr, _FAT_fat_clusterToSector (partition, position.cluster) + position.sector, + position.byte, tempVar); + + remain -= tempVar; + ptr += tempVar; + + position.byte += tempVar; + if (position.byte >= partition->bytesPerSector) { + position.byte = 0; + position.sector++; + } + } + + // align to cluster + // tempVar is number of sectors to read + if (remain > (partition->sectorsPerCluster - position.sector) * partition->bytesPerSector) { + tempVar = partition->sectorsPerCluster - position.sector; + } else { + tempVar = remain / partition->bytesPerSector; + } + + if ((tempVar > 0) && flagNoError) { + if (! _FAT_cache_readSectors (cache, _FAT_fat_clusterToSector (partition, position.cluster) + position.sector, + tempVar, ptr)) + { + flagNoError = false; + r->_errno = EIO; + } else { + ptr += tempVar * partition->bytesPerSector; + remain -= tempVar * partition->bytesPerSector; + position.sector += tempVar; + } + } + + // Move onto next cluster + // It should get to here without reading anything if a cluster is due to be allocated + if ((position.sector >= partition->sectorsPerCluster) && flagNoError) { + tempNextCluster = _FAT_fat_nextCluster(partition, position.cluster); + if ((remain == 0) && (tempNextCluster == CLUSTER_EOF)) { + position.sector = partition->sectorsPerCluster; + } else if (!_FAT_fat_isValidCluster(partition, tempNextCluster)) { + r->_errno = EIO; + flagNoError = false; + } else { + position.sector = 0; + position.cluster = tempNextCluster; + } + } + + // Read in whole clusters, contiguous blocks at a time + while ((remain >= partition->bytesPerCluster) && flagNoError) { + uint32_t chunkEnd; + uint32_t nextChunkStart = position.cluster; + size_t chunkSize = 0; + + do { + chunkEnd = nextChunkStart; + nextChunkStart = _FAT_fat_nextCluster (partition, chunkEnd); + chunkSize += partition->bytesPerCluster; + } while ((nextChunkStart == chunkEnd + 1) && +#ifdef LIMIT_SECTORS + (chunkSize + partition->bytesPerCluster <= LIMIT_SECTORS * partition->bytesPerSector) && +#endif + (chunkSize + partition->bytesPerCluster <= remain)); + + if (!_FAT_cache_readSectors (cache, _FAT_fat_clusterToSector (partition, position.cluster), + chunkSize / partition->bytesPerSector, ptr)) + { + flagNoError = false; + r->_errno = EIO; + break; + } + ptr += chunkSize; + remain -= chunkSize; + + // Advance to next cluster + if ((remain == 0) && (nextChunkStart == CLUSTER_EOF)) { + position.sector = partition->sectorsPerCluster; + position.cluster = chunkEnd; + } else if (!_FAT_fat_isValidCluster(partition, nextChunkStart)) { + r->_errno = EIO; + flagNoError = false; + } else { + position.sector = 0; + position.cluster = nextChunkStart; + } + } + + // Read remaining sectors + tempVar = remain / partition->bytesPerSector; // Number of sectors left + if ((tempVar > 0) && flagNoError) { + if (!_FAT_cache_readSectors (cache, _FAT_fat_clusterToSector (partition, position.cluster), + tempVar, ptr)) + { + flagNoError = false; + r->_errno = EIO; + } else { + ptr += tempVar * partition->bytesPerSector; + remain -= tempVar * partition->bytesPerSector; + position.sector += tempVar; + } + } + + // Last remaining sector + // Check if anything is left + if ((remain > 0) && flagNoError) { + _FAT_cache_readPartialSector ( cache, ptr, + _FAT_fat_clusterToSector (partition, position.cluster) + position.sector, 0, remain); + position.byte += remain; + remain = 0; + } + + // Length read is the wanted length minus the stuff not read + len = len - remain; + + // Update file information + file->rwPosition = position; + file->currentPosition += len; + + _FAT_unlock(&partition->lock); + return len; +} + +// if current position is on the cluster border and more data has to be written +// then get next cluster or allocate next cluster +// this solves the over-allocation problems when file size is aligned to cluster size +// return true on succes, false on error +static bool _FAT_check_position_for_next_cluster(struct _reent *r, + FILE_POSITION *position, PARTITION* partition, size_t remain, bool *flagNoError) +{ + uint32_t tempNextCluster; + // do nothing if no more data to write + if (remain == 0) return true; + if (flagNoError && *flagNoError == false) return false; + if ((remain < 0) || (position->sector > partition->sectorsPerCluster)) { + // invalid arguments - internal error + r->_errno = EINVAL; + goto err; + } + if (position->sector == partition->sectorsPerCluster) { + // need to advance to next cluster + tempNextCluster = _FAT_fat_nextCluster(partition, position->cluster); + if ((tempNextCluster == CLUSTER_EOF) || (tempNextCluster == CLUSTER_FREE)) { + // Ran out of clusters so get a new one + tempNextCluster = _FAT_fat_linkFreeCluster(partition, position->cluster); + } + if (!_FAT_fat_isValidCluster(partition, tempNextCluster)) { + // Couldn't get a cluster, so abort + r->_errno = ENOSPC; + goto err; + } + position->sector = 0; + position->cluster = tempNextCluster; + } + return true; +err: + if (flagNoError) *flagNoError = false; + return false; +} + +/* +Extend a file so that the size is the same as the rwPosition +*/ +static bool _FAT_file_extend_r (struct _reent *r, FILE_STRUCT* file) { + PARTITION* partition = file->partition; + CACHE* cache = file->partition->cache; + FILE_POSITION position; + uint8_t zeroBuffer [partition->bytesPerSector]; + memset(zeroBuffer, 0, partition->bytesPerSector); + uint32_t remain; + uint32_t tempNextCluster; + unsigned int sector; + + position.byte = file->filesize % partition->bytesPerSector; + position.sector = (file->filesize % partition->bytesPerCluster) / partition->bytesPerSector; + // It is assumed that there is always a startCluster + // This will be true when _FAT_file_extend_r is called from _FAT_write_r + position.cluster = _FAT_fat_lastCluster (partition, file->startCluster); + + remain = file->currentPosition - file->filesize; + + if ((remain > 0) && (file->filesize > 0) && (position.sector == 0) && (position.byte == 0)) { + // Get a new cluster on the edge of a cluster boundary + tempNextCluster = _FAT_fat_linkFreeCluster(partition, position.cluster); + if (!_FAT_fat_isValidCluster(partition, tempNextCluster)) { + // Couldn't get a cluster, so abort + r->_errno = ENOSPC; + return false; + } + position.cluster = tempNextCluster; + position.sector = 0; + } + + if (remain + position.byte < partition->bytesPerSector) { + // Only need to clear to the end of the sector + _FAT_cache_writePartialSector (cache, zeroBuffer, + _FAT_fat_clusterToSector (partition, position.cluster) + position.sector, position.byte, remain); + position.byte += remain; + } else { + if (position.byte > 0) { + _FAT_cache_writePartialSector (cache, zeroBuffer, + _FAT_fat_clusterToSector (partition, position.cluster) + position.sector, position.byte, + partition->bytesPerSector - position.byte); + remain -= (partition->bytesPerSector - position.byte); + position.byte = 0; + position.sector ++; + } + + while (remain >= partition->bytesPerSector) { + if (position.sector >= partition->sectorsPerCluster) { + position.sector = 0; + // Ran out of clusters so get a new one + tempNextCluster = _FAT_fat_linkFreeCluster(partition, position.cluster); + if (!_FAT_fat_isValidCluster(partition, tempNextCluster)) { + // Couldn't get a cluster, so abort + r->_errno = ENOSPC; + return false; + } + position.cluster = tempNextCluster; + } + + sector = _FAT_fat_clusterToSector (partition, position.cluster) + position.sector; + _FAT_cache_writeSectors (cache, sector, 1, zeroBuffer); + + remain -= partition->bytesPerSector; + position.sector ++; + } + + if (!_FAT_check_position_for_next_cluster(r, &position, partition, remain, NULL)) { + // error already marked + return false; + } + + if (remain > 0) { + _FAT_cache_writePartialSector (cache, zeroBuffer, + _FAT_fat_clusterToSector (partition, position.cluster) + position.sector, 0, remain); + position.byte = remain; + } + } + + file->rwPosition = position; + file->filesize = file->currentPosition; + return true; +} + +ssize_t _FAT_write_r (struct _reent *r, int fd, const char *ptr, size_t len) { + FILE_STRUCT* file = (FILE_STRUCT*) fd; + PARTITION* partition; + CACHE* cache; + FILE_POSITION position; + uint32_t tempNextCluster; + unsigned int tempVar; + size_t remain; + bool flagNoError = true; + bool flagAppending = false; + + // Make sure we can actually write to the file + if ((file == NULL) || !file->inUse || !file->write) { + r->_errno = EBADF; + return -1; + } + + partition = file->partition; + cache = file->partition->cache; + _FAT_lock(&partition->lock); + + // Only write up to the maximum file size, taking into account wrap-around of ints + if (len + file->filesize > FILE_MAX_SIZE || len + file->filesize < file->filesize) { + len = FILE_MAX_SIZE - file->filesize; + } + + // Short circuit cases where len is 0 (or less) + if (len <= 0) { + _FAT_unlock(&partition->lock); + return 0; + } + + remain = len; + + // Get a new cluster for the start of the file if required + if (file->startCluster == CLUSTER_FREE) { + tempNextCluster = _FAT_fat_linkFreeCluster (partition, CLUSTER_FREE); + if (!_FAT_fat_isValidCluster(partition, tempNextCluster)) { + // Couldn't get a cluster, so abort immediately + _FAT_unlock(&partition->lock); + r->_errno = ENOSPC; + return -1; + } + file->startCluster = tempNextCluster; + + // Appending starts at the begining for a 0 byte file + file->appendPosition.cluster = file->startCluster; + file->appendPosition.sector = 0; + file->appendPosition.byte = 0; + + file->rwPosition.cluster = file->startCluster; + file->rwPosition.sector = 0; + file->rwPosition.byte = 0; + } + + if (file->append) { + position = file->appendPosition; + flagAppending = true; + } else { + // If the write pointer is past the end of the file, extend the file to that size + if (file->currentPosition > file->filesize) { + if (!_FAT_file_extend_r (r, file)) { + _FAT_unlock(&partition->lock); + return -1; + } + } + + // Write at current read pointer + position = file->rwPosition; + + // If it is writing past the current end of file, set appending flag + if (len + file->currentPosition > file->filesize) { + flagAppending = true; + } + } + + // Move onto next cluster if needed + _FAT_check_position_for_next_cluster(r, &position, partition, remain, &flagNoError); + + // Align to sector + tempVar = partition->bytesPerSector - position.byte; + if (tempVar > remain) { + tempVar = remain; + } + + if ((tempVar < partition->bytesPerSector) && flagNoError) { + // Write partial sector to disk + _FAT_cache_writePartialSector (cache, ptr, + _FAT_fat_clusterToSector (partition, position.cluster) + position.sector, position.byte, tempVar); + + remain -= tempVar; + ptr += tempVar; + position.byte += tempVar; + + + // Move onto next sector + if (position.byte >= partition->bytesPerSector) { + position.byte = 0; + position.sector ++; + } + } + + // Align to cluster + // tempVar is number of sectors to write + if (remain > (partition->sectorsPerCluster - position.sector) * partition->bytesPerSector) { + tempVar = partition->sectorsPerCluster - position.sector; + } else { + tempVar = remain / partition->bytesPerSector; + } + + if ((tempVar > 0 && tempVar < partition->sectorsPerCluster) && flagNoError) { + if (!_FAT_cache_writeSectors (cache, + _FAT_fat_clusterToSector (partition, position.cluster) + position.sector, tempVar, ptr)) + { + flagNoError = false; + r->_errno = EIO; + } else { + ptr += tempVar * partition->bytesPerSector; + remain -= tempVar * partition->bytesPerSector; + position.sector += tempVar; + } + } + + // Write whole clusters + while ((remain >= partition->bytesPerCluster) && flagNoError) { + // allocate next cluster + _FAT_check_position_for_next_cluster(r, &position, partition, remain, &flagNoError); + if (!flagNoError) break; + // set indexes to the current position + uint32_t chunkEnd = position.cluster; + uint32_t nextChunkStart = position.cluster; + size_t chunkSize = partition->bytesPerCluster; + FILE_POSITION next_position = position; + + // group consecutive clusters + while (flagNoError && +#ifdef LIMIT_SECTORS + (chunkSize + partition->bytesPerCluster <= LIMIT_SECTORS * partition->bytesPerSector) && +#endif + (chunkSize + partition->bytesPerCluster < remain)) + { + // pretend to use up all sectors in next_position + next_position.sector = partition->sectorsPerCluster; + // get or allocate next cluster + _FAT_check_position_for_next_cluster(r, &next_position, partition, + remain - chunkSize, &flagNoError); + if (!flagNoError) break; // exit loop on error + nextChunkStart = next_position.cluster; + if (nextChunkStart != chunkEnd + 1) break; // exit loop if not consecutive + chunkEnd = nextChunkStart; + chunkSize += partition->bytesPerCluster; + } + + if ( !_FAT_cache_writeSectors (cache, + _FAT_fat_clusterToSector(partition, position.cluster), chunkSize / partition->bytesPerSector, ptr)) + { + flagNoError = false; + r->_errno = EIO; + break; + } + ptr += chunkSize; + remain -= chunkSize; + + if ((chunkEnd != nextChunkStart) && _FAT_fat_isValidCluster(partition, nextChunkStart)) { + // new cluster is already allocated (because it was not consecutive) + position.cluster = nextChunkStart; + position.sector = 0; + } else { + // Allocate a new cluster when next writing the file + position.cluster = chunkEnd; + position.sector = partition->sectorsPerCluster; + } + } + + // allocate next cluster if needed + _FAT_check_position_for_next_cluster(r, &position, partition, remain, &flagNoError); + + // Write remaining sectors + tempVar = remain / partition->bytesPerSector; // Number of sectors left + if ((tempVar > 0) && flagNoError) { + if (!_FAT_cache_writeSectors (cache, _FAT_fat_clusterToSector (partition, position.cluster), tempVar, ptr)) + { + flagNoError = false; + r->_errno = EIO; + } else { + ptr += tempVar * partition->bytesPerSector; + remain -= tempVar * partition->bytesPerSector; + position.sector += tempVar; + } + } + + // Last remaining sector + if ((remain > 0) && flagNoError) { + if (flagAppending) { + _FAT_cache_eraseWritePartialSector ( cache, ptr, + _FAT_fat_clusterToSector (partition, position.cluster) + position.sector, 0, remain); + } else { + _FAT_cache_writePartialSector ( cache, ptr, + _FAT_fat_clusterToSector (partition, position.cluster) + position.sector, 0, remain); + } + position.byte += remain; + remain = 0; + } + + + // Amount written is the originally requested amount minus stuff remaining + len = len - remain; + + // Update file information + file->modified = true; + if (file->append) { + // Appending doesn't affect the read pointer + file->appendPosition = position; + file->filesize += len; + } else { + // Writing also shifts the read pointer + file->rwPosition = position; + file->currentPosition += len; + if (file->filesize < file->currentPosition) { + file->filesize = file->currentPosition; + } + } + _FAT_unlock(&partition->lock); + + return len; +} + + +off_t _FAT_seek_r (struct _reent *r, int fd, off_t pos, int dir) { + FILE_STRUCT* file = (FILE_STRUCT*) fd; + PARTITION* partition; + uint32_t cluster, nextCluster; + int clusCount; + off_t newPosition; + uint32_t position; + + if ((file == NULL) || (file->inUse == false)) { + // invalid file + r->_errno = EBADF; + return -1; + } + + partition = file->partition; + _FAT_lock(&partition->lock); + + switch (dir) { + case SEEK_SET: + newPosition = pos; + break; + case SEEK_CUR: + newPosition = (off_t)file->currentPosition + pos; + break; + case SEEK_END: + newPosition = (off_t)file->filesize + pos; + break; + default: + _FAT_unlock(&partition->lock); + r->_errno = EINVAL; + return -1; + } + + if ((pos > 0) && (newPosition < 0)) { + _FAT_unlock(&partition->lock); + r->_errno = EOVERFLOW; + return -1; + } + + // newPosition can only be larger than the FILE_MAX_SIZE on platforms where + // off_t is larger than 32 bits. + if (newPosition < 0 || ((sizeof(newPosition) > 4) && newPosition > (off_t)FILE_MAX_SIZE)) { + _FAT_unlock(&partition->lock); + r->_errno = EINVAL; + return -1; + } + + position = (uint32_t)newPosition; + + // Only change the read/write position if it is within the bounds of the current filesize, + // or at the very edge of the file + if (position <= file->filesize && file->startCluster != CLUSTER_FREE) { + // Calculate where the correct cluster is + // how many clusters from start of file + clusCount = position / partition->bytesPerCluster; + cluster = file->startCluster; + if (position >= file->currentPosition) { + // start from current cluster + int currentCount = file->currentPosition / partition->bytesPerCluster; + if (file->rwPosition.sector == partition->sectorsPerCluster) { + currentCount--; + } + clusCount -= currentCount; + cluster = file->rwPosition.cluster; + } + // Calculate the sector and byte of the current position, + // and store them + file->rwPosition.sector = (position % partition->bytesPerCluster) / partition->bytesPerSector; + file->rwPosition.byte = position % partition->bytesPerSector; + + nextCluster = _FAT_fat_nextCluster (partition, cluster); + while ((clusCount > 0) && (nextCluster != CLUSTER_FREE) && (nextCluster != CLUSTER_EOF)) { + clusCount--; + cluster = nextCluster; + nextCluster = _FAT_fat_nextCluster (partition, cluster); + } + + // Check if ran out of clusters and it needs to allocate a new one + if (clusCount > 0) { + if ((clusCount == 1) && (file->filesize == position) && (file->rwPosition.sector == 0)) { + // Set flag to allocate a new cluster + file->rwPosition.sector = partition->sectorsPerCluster; + file->rwPosition.byte = 0; + } else { + _FAT_unlock(&partition->lock); + r->_errno = EINVAL; + return -1; + } + } + + file->rwPosition.cluster = cluster; + } + + // Save position + file->currentPosition = position; + + _FAT_unlock(&partition->lock); + return position; +} + + + +int _FAT_fstat_r (struct _reent *r, int fd, struct stat *st) { + FILE_STRUCT* file = (FILE_STRUCT*) fd; + PARTITION* partition; + DIR_ENTRY fileEntry; + + if ((file == NULL) || (file->inUse == false)) { + // invalid file + r->_errno = EBADF; + return -1; + } + + partition = file->partition; + _FAT_lock(&partition->lock); + + // Get the file's entry data + fileEntry.dataStart = file->dirEntryStart; + fileEntry.dataEnd = file->dirEntryEnd; + + if (!_FAT_directory_entryFromPosition (partition, &fileEntry)) { + _FAT_unlock(&partition->lock); + r->_errno = EIO; + return -1; + } + + // Fill in the stat struct + _FAT_directory_entryStat (partition, &fileEntry, st); + + // Fix stats that have changed since the file was openned + st->st_ino = (ino_t)(file->startCluster); // The file serial number is the start cluster + st->st_size = file->filesize; // File size + + _FAT_unlock(&partition->lock); + return 0; +} + +int _FAT_ftruncate_r (struct _reent *r, int fd, off_t len) { + FILE_STRUCT* file = (FILE_STRUCT*) fd; + PARTITION* partition; + int ret=0; + uint32_t newSize = (uint32_t)len; + + if (len < 0) { + // Trying to truncate to a negative size + r->_errno = EINVAL; + return -1; + } + + if ((sizeof(len) > 4) && len > (off_t)FILE_MAX_SIZE) { + // Trying to extend the file beyond what FAT supports + r->_errno = EFBIG; + return -1; + } + + if (!file || !file->inUse) { + // invalid file + r->_errno = EBADF; + return -1; + } + + if (!file->write) { + // Read-only file + r->_errno = EINVAL; + return -1; + } + + partition = file->partition; + _FAT_lock(&partition->lock); + + if (newSize > file->filesize) { + // Expanding the file + FILE_POSITION savedPosition; + uint32_t savedOffset; + // Get a new cluster for the start of the file if required + if (file->startCluster == CLUSTER_FREE) { + uint32_t tempNextCluster = _FAT_fat_linkFreeCluster (partition, CLUSTER_FREE); + if (!_FAT_fat_isValidCluster(partition, tempNextCluster)) { + // Couldn't get a cluster, so abort immediately + _FAT_unlock(&partition->lock); + r->_errno = ENOSPC; + return -1; + } + file->startCluster = tempNextCluster; + + file->rwPosition.cluster = file->startCluster; + file->rwPosition.sector = 0; + file->rwPosition.byte = 0; + } + // Save the read/write pointer + savedPosition = file->rwPosition; + savedOffset = file->currentPosition; + // Set the position to the new size + file->currentPosition = newSize; + // Extend the file to the new position + if (!_FAT_file_extend_r (r, file)) { + ret = -1; + } + // Set the append position to the new rwPointer + if (file->append) { + file->appendPosition = file->rwPosition; + } + // Restore the old rwPointer; + file->rwPosition = savedPosition; + file->currentPosition = savedOffset; + } else if (newSize < file->filesize){ + // Shrinking the file + if (len == 0) { + // Cutting the file down to nothing, clear all clusters used + _FAT_fat_clearLinks (partition, file->startCluster); + file->startCluster = CLUSTER_FREE; + + file->appendPosition.cluster = CLUSTER_FREE; + file->appendPosition.sector = 0; + file->appendPosition.byte = 0; + } else { + // Trimming the file down to the required size + unsigned int chainLength; + uint32_t lastCluster; + + // Drop the unneeded end of the cluster chain. + // If the end falls on a cluster boundary, drop that cluster too, + // then set a flag to allocate a cluster as needed + chainLength = ((newSize-1) / partition->bytesPerCluster) + 1; + lastCluster = _FAT_fat_trimChain (partition, file->startCluster, chainLength); + + if (file->append) { + file->appendPosition.byte = newSize % partition->bytesPerSector; + // Does the end of the file fall on the edge of a cluster? + if (newSize % partition->bytesPerCluster == 0) { + // Set a flag to allocate a new cluster + file->appendPosition.sector = partition->sectorsPerCluster; + } else { + file->appendPosition.sector = (newSize % partition->bytesPerCluster) / partition->bytesPerSector; + } + file->appendPosition.cluster = lastCluster; + } + } + } else { + // Truncating to same length, so don't do anything + } + + file->filesize = newSize; + file->modified = true; + + _FAT_unlock(&partition->lock); + return ret; +} + +int _FAT_fsync_r (struct _reent *r, int fd) { + FILE_STRUCT* file = (FILE_STRUCT*) fd; + int ret = 0; + + if (!file->inUse) { + r->_errno = EBADF; + return -1; + } + + _FAT_lock(&file->partition->lock); + + ret = _FAT_syncToDisc (file); + if (ret != 0) { + r->_errno = ret; + ret = -1; + } + + _FAT_unlock(&file->partition->lock); + + return ret; +} diff --git a/portlibs/sources/libfat/fatfile.h b/portlibs/sources/libfat/fatfile.h new file mode 100644 index 00000000..5e4648df --- /dev/null +++ b/portlibs/sources/libfat/fatfile.h @@ -0,0 +1,105 @@ +/* + fatfile.h + + Functions used by the newlib disc stubs to interface with + this library + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + + +#ifndef _FATFILE_H +#define _FATFILE_H + +#include <sys/reent.h> +#include <sys/stat.h> + +#include "common.h" +#include "partition.h" +#include "directory.h" + +#define FILE_MAX_SIZE ((uint32_t)0xFFFFFFFF) // 4GiB - 1B + +typedef struct { + u32 cluster; + sec_t sector; + s32 byte; +} FILE_POSITION; + +struct _FILE_STRUCT; + +struct _FILE_STRUCT { + uint32_t filesize; + uint32_t startCluster; + uint32_t currentPosition; + FILE_POSITION rwPosition; + FILE_POSITION appendPosition; + DIR_ENTRY_POSITION dirEntryStart; // Points to the start of the LFN entries of a file, or the alias for no LFN + DIR_ENTRY_POSITION dirEntryEnd; // Always points to the file's alias entry + PARTITION* partition; + struct _FILE_STRUCT* prevOpenFile; // The previous entry in a double-linked list of open files + struct _FILE_STRUCT* nextOpenFile; // The next entry in a double-linked list of open files + bool read; + bool write; + bool append; + bool inUse; + bool modified; +}; + +typedef struct _FILE_STRUCT FILE_STRUCT; + +int _FAT_open_r (struct _reent *r, void *fileStruct, const char *path, int flags, int mode); + +int _FAT_close_r (struct _reent *r, int fd); + +ssize_t _FAT_write_r (struct _reent *r,int fd, const char *ptr, size_t len); + +ssize_t _FAT_read_r (struct _reent *r, int fd, char *ptr, size_t len); + +off_t _FAT_seek_r (struct _reent *r, int fd, off_t pos, int dir); + +int _FAT_fstat_r (struct _reent *r, int fd, struct stat *st); + +int _FAT_stat_r (struct _reent *r, const char *path, struct stat *st); + +int _FAT_link_r (struct _reent *r, const char *existing, const char *newLink); + +int _FAT_unlink_r (struct _reent *r, const char *name); + +int _FAT_chdir_r (struct _reent *r, const char *name); + +int _FAT_rename_r (struct _reent *r, const char *oldName, const char *newName); + +int _FAT_ftruncate_r (struct _reent *r, int fd, off_t len); + +int _FAT_fsync_r (struct _reent *r, int fd); + +/* +Synchronizes the file data to disc. +Does no locking of its own -- lock the partition before calling. +Returns 0 on success, an error code on failure. +*/ +extern int _FAT_syncToDisc (FILE_STRUCT* file); + +#endif // _FATFILE_H diff --git a/portlibs/sources/libfat/fatfile_frag.c b/portlibs/sources/libfat/fatfile_frag.c new file mode 100644 index 00000000..340b7155 --- /dev/null +++ b/portlibs/sources/libfat/fatfile_frag.c @@ -0,0 +1,63 @@ +#include "fatfile.h" + +#include <fcntl.h> +#include <string.h> +#include <errno.h> +#include <ctype.h> +#include <unistd.h> + +#include "cache.h" +#include "file_allocation_table.h" +#include "bit_ops.h" +#include "filetime.h" +#include "lock.h" +#include "fatfile_frag.h" + +int _FAT_get_fragments (const char *path, _fat_frag_append_t append_fragment, void *callback_data) +{ + struct _reent r; + FILE_STRUCT file; + PARTITION* partition; + u32 cluster; + u32 sector; + u32 offset; // in sectors + u32 size; // in sectors + int ret = -1; + int fd; + + fd = _FAT_open_r (&r, &file, path, O_RDONLY, 0); + if (fd == -1) return -1; + if (fd != (int)&file) return -1; + + partition = file.partition; + _FAT_lock(&partition->lock); + + size = file.filesize / partition->bytesPerSector; + cluster = file.startCluster; + offset = 0; + + do { + if (!_FAT_fat_isValidCluster(partition, cluster)) { + // invalid cluster + goto out; + } + // add cluster to fileinfo + sector = _FAT_fat_clusterToSector(partition, cluster); + if (append_fragment(callback_data, offset, sector, partition->sectorsPerCluster)) { + // too many fragments + goto out; + } + offset += partition->sectorsPerCluster; + cluster = _FAT_fat_nextCluster (partition, cluster); + } while (offset < size); + + // set size + append_fragment(callback_data, size, 0, 0); + // success + ret = 0; + + out: + _FAT_unlock(&partition->lock); + _FAT_close_r(&r, fd); + return ret; +} diff --git a/portlibs/sources/libfat/fatfile_frag.h b/portlibs/sources/libfat/fatfile_frag.h new file mode 100644 index 00000000..3af9b32e --- /dev/null +++ b/portlibs/sources/libfat/fatfile_frag.h @@ -0,0 +1,16 @@ +#ifndef FAT_FRAG_H_ +#define FAT_FRAG_H_ + +#ifdef __cplusplus +extern "C" { +#endif + +typedef int (*_fat_frag_append_t)(void *ff, u32 offset, u32 sector, u32 count); + +int _FAT_get_fragments (const char *path, _fat_frag_append_t append_fragment, void *callback_data); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/sources/libfat/file_allocation_table.c b/portlibs/sources/libfat/file_allocation_table.c new file mode 100644 index 00000000..9a3cc884 --- /dev/null +++ b/portlibs/sources/libfat/file_allocation_table.c @@ -0,0 +1,393 @@ +/* + file_allocation_table.c + Reading, writing and manipulation of the FAT structure on + a FAT partition + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + + +#include "file_allocation_table.h" +#include "partition.h" +#include "mem_allocate.h" +#include <string.h> + +/* +Gets the cluster linked from input cluster +*/ +uint32_t _FAT_fat_nextCluster(PARTITION* partition, uint32_t cluster) +{ + uint32_t nextCluster = CLUSTER_FREE; + sec_t sector; + int offset; + + if (cluster == CLUSTER_FREE) { + return CLUSTER_FREE; + } + + switch (partition->filesysType) + { + case FS_UNKNOWN: + return CLUSTER_ERROR; + break; + + case FS_FAT12: + { + u32 nextCluster_h; + sector = partition->fat.fatStart + (((cluster * 3) / 2) / partition->bytesPerSector); + offset = ((cluster * 3) / 2) % partition->bytesPerSector; + + + _FAT_cache_readLittleEndianValue (partition->cache, &nextCluster, sector, offset, sizeof(u8)); + + offset++; + + if (offset >= partition->bytesPerSector) { + offset = 0; + sector++; + } + nextCluster_h = 0; + + _FAT_cache_readLittleEndianValue (partition->cache, &nextCluster_h, sector, offset, sizeof(u8)); + nextCluster |= (nextCluster_h << 8); + + if (cluster & 0x01) { + nextCluster = nextCluster >> 4; + } else { + nextCluster &= 0x0FFF; + } + + if (nextCluster >= 0x0FF7) + { + nextCluster = CLUSTER_EOF; + } + + break; + } + case FS_FAT16: + sector = partition->fat.fatStart + ((cluster << 1) / partition->bytesPerSector); + offset = (cluster % (partition->bytesPerSector >> 1)) << 1; + + _FAT_cache_readLittleEndianValue (partition->cache, &nextCluster, sector, offset, sizeof(u16)); + + if (nextCluster >= 0xFFF7) { + nextCluster = CLUSTER_EOF; + } + break; + + case FS_FAT32: + sector = partition->fat.fatStart + ((cluster << 2) / partition->bytesPerSector); + offset = (cluster % (partition->bytesPerSector >> 2)) << 2; + + _FAT_cache_readLittleEndianValue (partition->cache, &nextCluster, sector, offset, sizeof(u32)); + + if (nextCluster >= 0x0FFFFFF7) { + nextCluster = CLUSTER_EOF; + } + break; + + default: + return CLUSTER_ERROR; + break; + } + + return nextCluster; +} + +/* +writes value into the correct offset within a partition's FAT, based +on the cluster number. +*/ +static bool _FAT_fat_writeFatEntry (PARTITION* partition, uint32_t cluster, uint32_t value) { + sec_t sector; + int offset; + uint32_t oldValue; + + if ((cluster < CLUSTER_FIRST) || (cluster > partition->fat.lastCluster /* This will catch CLUSTER_ERROR */)) + { + return false; + } + + switch (partition->filesysType) + { + case FS_UNKNOWN: + return false; + break; + + case FS_FAT12: + sector = partition->fat.fatStart + (((cluster * 3) / 2) / partition->bytesPerSector); + offset = ((cluster * 3) / 2) % partition->bytesPerSector; + + if (cluster & 0x01) { + + _FAT_cache_readLittleEndianValue (partition->cache, &oldValue, sector, offset, sizeof(u8)); + + value = (value << 4) | (oldValue & 0x0F); + + _FAT_cache_writeLittleEndianValue (partition->cache, value & 0xFF, sector, offset, sizeof(u8)); + + offset++; + if (offset >= partition->bytesPerSector) { + offset = 0; + sector++; + } + + _FAT_cache_writeLittleEndianValue (partition->cache, (value >> 8) & 0xFF, sector, offset, sizeof(u8)); + + } else { + + _FAT_cache_writeLittleEndianValue (partition->cache, value, sector, offset, sizeof(u8)); + + offset++; + if (offset >= partition->bytesPerSector) { + offset = 0; + sector++; + } + + _FAT_cache_readLittleEndianValue (partition->cache, &oldValue, sector, offset, sizeof(u8)); + + value = ((value >> 8) & 0x0F) | (oldValue & 0xF0); + + _FAT_cache_writeLittleEndianValue (partition->cache, value, sector, offset, sizeof(u8)); + } + + break; + + case FS_FAT16: + sector = partition->fat.fatStart + ((cluster << 1) / partition->bytesPerSector); + offset = (cluster % (partition->bytesPerSector >> 1)) << 1; + + _FAT_cache_writeLittleEndianValue (partition->cache, value, sector, offset, sizeof(u16)); + + break; + + case FS_FAT32: + sector = partition->fat.fatStart + ((cluster << 2) / partition->bytesPerSector); + offset = (cluster % (partition->bytesPerSector >> 2)) << 2; + + _FAT_cache_writeLittleEndianValue (partition->cache, value, sector, offset, sizeof(u32)); + + break; + + default: + return false; + break; + } + + return true; +} + +/*----------------------------------------------------------------- +gets the first available free cluster, sets it +to end of file, links the input cluster to it then returns the +cluster number +If an error occurs, return CLUSTER_ERROR +-----------------------------------------------------------------*/ +uint32_t _FAT_fat_linkFreeCluster(PARTITION* partition, uint32_t cluster) { + uint32_t firstFree; + uint32_t curLink; + uint32_t lastCluster; + bool loopedAroundFAT = false; + + lastCluster = partition->fat.lastCluster; + + if (cluster > lastCluster) { + return CLUSTER_ERROR; + } + + // Check if the cluster already has a link, and return it if so + curLink = _FAT_fat_nextCluster(partition, cluster); + if ((curLink >= CLUSTER_FIRST) && (curLink <= lastCluster)) { + return curLink; // Return the current link - don't allocate a new one + } + + // Get a free cluster + firstFree = partition->fat.firstFree; + // Start at first valid cluster + if (firstFree < CLUSTER_FIRST) { + firstFree = CLUSTER_FIRST; + } + + // Search until a free cluster is found + while (_FAT_fat_nextCluster(partition, firstFree) != CLUSTER_FREE) { + firstFree++; + if (firstFree > lastCluster) { + if (loopedAroundFAT) { + // If couldn't get a free cluster then return an error + partition->fat.firstFree = firstFree; + return CLUSTER_ERROR; + } else { + // Try looping back to the beginning of the FAT + // This was suggested by loopy + firstFree = CLUSTER_FIRST; + loopedAroundFAT = true; + } + } + } + partition->fat.firstFree = firstFree; + if(partition->fat.numberFreeCluster) + partition->fat.numberFreeCluster--; + partition->fat.numberLastAllocCluster = firstFree; + + if ((cluster >= CLUSTER_FIRST) && (cluster <= lastCluster)) + { + // Update the linked from FAT entry + _FAT_fat_writeFatEntry (partition, cluster, firstFree); + } + // Create the linked to FAT entry + _FAT_fat_writeFatEntry (partition, firstFree, CLUSTER_EOF); + + return firstFree; +} + +/*----------------------------------------------------------------- +gets the first available free cluster, sets it +to end of file, links the input cluster to it, clears the new +cluster to 0 valued bytes, then returns the cluster number +If an error occurs, return CLUSTER_ERROR +-----------------------------------------------------------------*/ +uint32_t _FAT_fat_linkFreeClusterCleared (PARTITION* partition, uint32_t cluster) { + uint32_t newCluster; + uint32_t i; + uint8_t *emptySector; + + // Link the cluster + newCluster = _FAT_fat_linkFreeCluster(partition, cluster); + + if (newCluster == CLUSTER_FREE || newCluster == CLUSTER_ERROR) { + return CLUSTER_ERROR; + } + + emptySector = (uint8_t*) _FAT_mem_allocate(partition->bytesPerSector); + + // Clear all the sectors within the cluster + memset (emptySector, 0, partition->bytesPerSector); + for (i = 0; i < partition->sectorsPerCluster; i++) { + _FAT_cache_writeSectors (partition->cache, + _FAT_fat_clusterToSector (partition, newCluster) + i, + 1, emptySector); + } + + _FAT_mem_free(emptySector); + + return newCluster; +} + + +/*----------------------------------------------------------------- +_FAT_fat_clearLinks +frees any cluster used by a file +-----------------------------------------------------------------*/ +bool _FAT_fat_clearLinks (PARTITION* partition, uint32_t cluster) { + uint32_t nextCluster; + + if ((cluster < CLUSTER_FIRST) || (cluster > partition->fat.lastCluster /* This will catch CLUSTER_ERROR */)) + return false; + + // If this clears up more space in the FAT before the current free pointer, move it backwards + if (cluster < partition->fat.firstFree) { + partition->fat.firstFree = cluster; + } + + while ((cluster != CLUSTER_EOF) && (cluster != CLUSTER_FREE) && (cluster != CLUSTER_ERROR)) { + // Store next cluster before erasing the link + nextCluster = _FAT_fat_nextCluster (partition, cluster); + + // Erase the link + _FAT_fat_writeFatEntry (partition, cluster, CLUSTER_FREE); + + if(partition->fat.numberFreeCluster < (partition->numberOfSectors/partition->sectorsPerCluster)) + partition->fat.numberFreeCluster++; + // Move onto next cluster + cluster = nextCluster; + } + + return true; +} + +/*----------------------------------------------------------------- +_FAT_fat_trimChain +Drop all clusters past the chainLength. +If chainLength is 0, all clusters are dropped. +If chainLength is 1, the first cluster is kept and the rest are +dropped, and so on. +Return the last cluster left in the chain. +-----------------------------------------------------------------*/ +uint32_t _FAT_fat_trimChain (PARTITION* partition, uint32_t startCluster, unsigned int chainLength) { + uint32_t nextCluster; + + if (chainLength == 0) { + // Drop the entire chain + _FAT_fat_clearLinks (partition, startCluster); + return CLUSTER_FREE; + } else { + // Find the last cluster in the chain, and the one after it + chainLength--; + nextCluster = _FAT_fat_nextCluster (partition, startCluster); + while ((chainLength > 0) && (nextCluster != CLUSTER_FREE) && (nextCluster != CLUSTER_EOF)) { + chainLength--; + startCluster = nextCluster; + nextCluster = _FAT_fat_nextCluster (partition, startCluster); + } + + // Drop all clusters after the last in the chain + if (nextCluster != CLUSTER_FREE && nextCluster != CLUSTER_EOF) { + _FAT_fat_clearLinks (partition, nextCluster); + } + + // Mark the last cluster in the chain as the end of the file + _FAT_fat_writeFatEntry (partition, startCluster, CLUSTER_EOF); + + return startCluster; + } +} + +/*----------------------------------------------------------------- +_FAT_fat_lastCluster +Trace the cluster links until the last one is found +-----------------------------------------------------------------*/ +uint32_t _FAT_fat_lastCluster (PARTITION* partition, uint32_t cluster) { + while ((_FAT_fat_nextCluster(partition, cluster) != CLUSTER_FREE) && (_FAT_fat_nextCluster(partition, cluster) != CLUSTER_EOF)) { + cluster = _FAT_fat_nextCluster(partition, cluster); + } + return cluster; +} + +/*----------------------------------------------------------------- +_FAT_fat_freeClusterCount +Return the number of free clusters available +-----------------------------------------------------------------*/ +unsigned int _FAT_fat_freeClusterCount (PARTITION* partition) { + unsigned int count = 0; + uint32_t curCluster; + + for (curCluster = CLUSTER_FIRST; curCluster <= partition->fat.lastCluster; curCluster++) { + if (_FAT_fat_nextCluster(partition, curCluster) == CLUSTER_FREE) { + count++; + } + } + + return count; +} + diff --git a/portlibs/sources/libfat/file_allocation_table.h b/portlibs/sources/libfat/file_allocation_table.h new file mode 100644 index 00000000..560c616d --- /dev/null +++ b/portlibs/sources/libfat/file_allocation_table.h @@ -0,0 +1,70 @@ +/* + file_allocation_table.h + Reading, writing and manipulation of the FAT structure on + a FAT partition + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _FAT_H +#define _FAT_H + +#include "common.h" +#include "partition.h" + +#define CLUSTER_EOF_16 0xFFFF +#define CLUSTER_EOF 0x0FFFFFFF +#define CLUSTER_FREE 0x00000000 +#define CLUSTER_ROOT 0x00000000 +#define CLUSTER_FIRST 0x00000002 +#define CLUSTER_ERROR 0xFFFFFFFF + +#define CLUSTERS_PER_FAT12 4085 +#define CLUSTERS_PER_FAT16 65525 + + +uint32_t _FAT_fat_nextCluster(PARTITION* partition, uint32_t cluster); + +uint32_t _FAT_fat_linkFreeCluster(PARTITION* partition, uint32_t cluster); +uint32_t _FAT_fat_linkFreeClusterCleared (PARTITION* partition, uint32_t cluster); + +bool _FAT_fat_clearLinks (PARTITION* partition, uint32_t cluster); + +uint32_t _FAT_fat_trimChain (PARTITION* partition, uint32_t startCluster, unsigned int chainLength); + +uint32_t _FAT_fat_lastCluster (PARTITION* partition, uint32_t cluster); + +unsigned int _FAT_fat_freeClusterCount (PARTITION* partition); + +static inline sec_t _FAT_fat_clusterToSector (PARTITION* partition, uint32_t cluster) { + return (cluster >= CLUSTER_FIRST) ? + ((cluster - CLUSTER_FIRST) * (sec_t)partition->sectorsPerCluster) + partition->dataStart : + partition->rootDirStart; +} + +static inline bool _FAT_fat_isValidCluster (PARTITION* partition, uint32_t cluster) { + return (cluster >= CLUSTER_FIRST) && (cluster <= partition->fat.lastCluster /* This will catch CLUSTER_ERROR */); +} + +#endif // _FAT_H diff --git a/portlibs/sources/libfat/filetime.c b/portlibs/sources/libfat/filetime.c new file mode 100644 index 00000000..d297bf64 --- /dev/null +++ b/portlibs/sources/libfat/filetime.c @@ -0,0 +1,107 @@ +/* + filetime.c + Conversion of file time and date values to various other types + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + + +#include <time.h> +#include "filetime.h" +#include "common.h" + +#define MAX_HOUR 23 +#define MAX_MINUTE 59 +#define MAX_SECOND 59 + +#define MAX_MONTH 11 +#define MIN_MONTH 0 +#define MAX_DAY 31 +#define MIN_DAY 1 + +uint16_t _FAT_filetime_getTimeFromRTC (void) { +#ifdef USE_RTC_TIME + struct tm timeParts; + time_t epochTime; + + if (time(&epochTime) == (time_t)-1) { + return 0; + } + localtime_r(&epochTime, &timeParts); + + // Check that the values are all in range. + // If they are not, return 0 (no timestamp) + if ((timeParts.tm_hour < 0) || (timeParts.tm_hour > MAX_HOUR)) return 0; + if ((timeParts.tm_min < 0) || (timeParts.tm_min > MAX_MINUTE)) return 0; + if ((timeParts.tm_sec < 0) || (timeParts.tm_sec > MAX_SECOND)) return 0; + + return ( + ((timeParts.tm_hour & 0x1F) << 11) | + ((timeParts.tm_min & 0x3F) << 5) | + ((timeParts.tm_sec >> 1) & 0x1F) + ); +#else + return 0; +#endif +} + + +uint16_t _FAT_filetime_getDateFromRTC (void) { +#ifdef USE_RTC_TIME + struct tm timeParts; + time_t epochTime; + + if (time(&epochTime) == (time_t)-1) { + return 0; + } + localtime_r(&epochTime, &timeParts); + + if ((timeParts.tm_mon < MIN_MONTH) || (timeParts.tm_mon > MAX_MONTH)) return 0; + if ((timeParts.tm_mday < MIN_DAY) || (timeParts.tm_mday > MAX_DAY)) return 0; + + return ( + (((timeParts.tm_year - 80) & 0x7F) <<9) | // Adjust for MS-FAT base year (1980 vs 1900 for tm_year) + (((timeParts.tm_mon + 1) & 0xF) << 5) | + (timeParts.tm_mday & 0x1F) + ); +#else + return 0; +#endif +} + +time_t _FAT_filetime_to_time_t (uint16_t t, uint16_t d) { + struct tm timeParts; + + timeParts.tm_hour = t >> 11; + timeParts.tm_min = (t >> 5) & 0x3F; + timeParts.tm_sec = (t & 0x1F) << 1; + + timeParts.tm_mday = d & 0x1F; + timeParts.tm_mon = ((d >> 5) & 0x0F) - 1; + timeParts.tm_year = (d >> 9) + 80; + + timeParts.tm_isdst = 0; + + return mktime(&timeParts); +} diff --git a/portlibs/sources/libfat/filetime.h b/portlibs/sources/libfat/filetime.h new file mode 100644 index 00000000..3bfd8ed8 --- /dev/null +++ b/portlibs/sources/libfat/filetime.h @@ -0,0 +1,41 @@ +/* + filetime.h + Conversion of file time and date values to various other types + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _FILETIME_H +#define _FILETIME_H + +#include "common.h" +#include <sys/types.h> + +uint16_t _FAT_filetime_getTimeFromRTC (void); +uint16_t _FAT_filetime_getDateFromRTC (void); + +time_t _FAT_filetime_to_time_t (uint16_t t, uint16_t d); + + +#endif // _FILETIME_H diff --git a/portlibs/sources/libfat/libfat.c b/portlibs/sources/libfat/libfat.c new file mode 100644 index 00000000..9f8dd014 --- /dev/null +++ b/portlibs/sources/libfat/libfat.c @@ -0,0 +1,249 @@ +/* + libfat.c + Simple functionality for startup, mounting and unmounting of FAT-based devices. + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#include <sys/iosupport.h> +#include <unistd.h> +#include <string.h> +#include <stdio.h> + +#include "common.h" +#include "partition.h" +#include "fatfile.h" +#include "fatdir.h" +#include "lock.h" +#include "mem_allocate.h" +#include "disc.h" + +static const devoptab_t dotab_fat = { + "fat", + sizeof (FILE_STRUCT), + _FAT_open_r, + _FAT_close_r, + _FAT_write_r, + _FAT_read_r, + _FAT_seek_r, + _FAT_fstat_r, + _FAT_stat_r, + _FAT_link_r, + _FAT_unlink_r, + _FAT_chdir_r, + _FAT_rename_r, + _FAT_mkdir_r, + sizeof (DIR_STATE_STRUCT), + _FAT_diropen_r, + _FAT_dirreset_r, + _FAT_dirnext_r, + _FAT_dirclose_r, + _FAT_statvfs_r, + _FAT_ftruncate_r, + _FAT_fsync_r, + NULL, /* Device data */ + NULL, + NULL +}; + +bool fatMount (const char* name, const DISC_INTERFACE* interface, sec_t startSector, uint32_t cacheSize, uint32_t SectorsPerPage) { + PARTITION* partition; + devoptab_t* devops; + char* nameCopy; + + if(!name || strlen(name) > 8 || !interface) + return false; + + if(!interface->startup()) + return false; + + if(!interface->isInserted()) + return false; + + char devname[10]; + sprintf(devname, "%s:", name); + if(FindDevice(devname) >= 0) + return true; + + devops = _FAT_mem_allocate (sizeof(devoptab_t) + strlen(name) + 1); + if (!devops) { + return false; + } + // Use the space allocated at the end of the devoptab struct for storing the name + nameCopy = (char*)(devops+1); + + // Initialize the file system + partition = _FAT_partition_constructor (interface, cacheSize, SectorsPerPage, startSector); + if (!partition) { + _FAT_mem_free (devops); + return false; + } + + // Add an entry for this device to the devoptab table + memcpy (devops, &dotab_fat, sizeof(dotab_fat)); + strcpy (nameCopy, name); + devops->name = nameCopy; + devops->deviceData = partition; + + AddDevice (devops); + + return true; +} + +bool fatMountSimple (const char* name, const DISC_INTERFACE* interface) { + return fatMount (name, interface, 0, DEFAULT_CACHE_PAGES, DEFAULT_SECTORS_PAGE); +} + +void fatUnmount (const char* name) { + devoptab_t *devops; + PARTITION* partition; + + if(!name) + return; + + devops = (devoptab_t*)GetDeviceOpTab (name); + if (!devops) { + return; + } + + // Perform a quick check to make sure we're dealing with a libfat controlled device + if (devops->open_r != dotab_fat.open_r) { + return; + } + + if (RemoveDevice (name) == -1) { + return; + } + + partition = (PARTITION*)devops->deviceData; + _FAT_partition_destructor (partition); + _FAT_mem_free (devops); +} + +bool fatInit (uint32_t cacheSize, bool setAsDefaultDevice) { + int i; + int defaultDevice = -1; + const DISC_INTERFACE *disc; + + for (i = 0; + _FAT_disc_interfaces[i].name != NULL && _FAT_disc_interfaces[i].getInterface != NULL; + i++) + { + disc = _FAT_disc_interfaces[i].getInterface(); + if (fatMount (_FAT_disc_interfaces[i].name, disc, 0, cacheSize, DEFAULT_SECTORS_PAGE)) { + // The first device to successfully mount is set as the default + if (defaultDevice < 0) { + defaultDevice = i; + } + } + } + + if (defaultDevice < 0) { + // None of our devices mounted + return false; + } + + if (setAsDefaultDevice) { + char filePath[MAXPATHLEN * 2]; + strcpy (filePath, _FAT_disc_interfaces[defaultDevice].name); + strcat (filePath, ":/"); +#ifdef ARGV_MAGIC + if ( __system_argv->argvMagic == ARGV_MAGIC && __system_argv->argc >= 1 && strrchr( __system_argv->argv[0], '/' )!=NULL ) { + // Check the app's path against each of our mounted devices, to see + // if we can support it. If so, change to that path. + for (i = 0; + _FAT_disc_interfaces[i].name != NULL && _FAT_disc_interfaces[i].getInterface != NULL; + i++) + { + if ( !strncasecmp( __system_argv->argv[0], _FAT_disc_interfaces[i].name, + strlen(_FAT_disc_interfaces[i].name))) + { + char *lastSlash; + strcpy(filePath, __system_argv->argv[0]); + lastSlash = strrchr( filePath, '/' ); + + if ( NULL != lastSlash) { + if ( *(lastSlash - 1) == ':') lastSlash++; + *lastSlash = 0; + } + } + } + } +#endif + chdir (filePath); + } + + return true; +} + +bool fatInitDefault (void) { + return fatInit (DEFAULT_CACHE_PAGES, true); +} + +void fatGetVolumeLabel (const char* name, char *label) { + devoptab_t *devops; + PARTITION* partition; + char *buf; + int namelen,i; + + if(!name || !label) + return; + + namelen = strlen(name); + buf=(char*)_FAT_mem_allocate(sizeof(char)*namelen+2); + strcpy(buf,name); + + if (name[namelen-1] == '/') { + buf[namelen-1]='\0'; + namelen--; + } + + if (name[namelen-1] != ':') { + buf[namelen]=':'; + buf[namelen+1]='\0'; + } + + devops = (devoptab_t*)GetDeviceOpTab(buf); + + for(i=0;buf[i]!='\0' && buf[i]!=':';i++); + if (!devops || strncasecmp(buf,devops->name,i)) { + _FAT_mem_free(buf); + return; + } + + _FAT_mem_free(buf); + + // Perform a quick check to make sure we're dealing with a libfat controlled device + if (devops->open_r != dotab_fat.open_r) { + return; + } + + partition = (PARTITION*)devops->deviceData; + + if(!_FAT_directory_getVolumeLabel(partition, label)) { + strncpy(label,partition->label,11); + label[11]='\0'; + } + if(!strncmp(label, "NO NAME", 7)) label[0]='\0'; +} diff --git a/portlibs/sources/libfat/libfatversion.h b/portlibs/sources/libfat/libfatversion.h new file mode 100644 index 00000000..40c50463 --- /dev/null +++ b/portlibs/sources/libfat/libfatversion.h @@ -0,0 +1,10 @@ +#ifndef __LIBFATVERSION_H__ +#define __LIBFATVERSION_H__ + +#define _LIBFAT_MAJOR_ 1 +#define _LIBFAT_MINOR_ 0 +#define _LIBFAT_PATCH_ 7 + +#define _LIBFAT_STRING "libFAT Release 1.0.7" + +#endif // __LIBFATVERSION_H__ diff --git a/portlibs/sources/libfat/lock.c b/portlibs/sources/libfat/lock.c new file mode 100644 index 00000000..59c3444c --- /dev/null +++ b/portlibs/sources/libfat/lock.c @@ -0,0 +1,29 @@ +#include "common.h" + +#ifndef USE_LWP_LOCK + +#ifndef mutex_t +typedef int mutex_t; +#endif + +void __attribute__ ((weak)) _FAT_lock_init(mutex_t *mutex) +{ + return; +} + +void __attribute__ ((weak)) _FAT_lock_deinit(mutex_t *mutex) +{ + return; +} + +void __attribute__ ((weak)) _FAT_lock(mutex_t *mutex) +{ + return; +} + +void __attribute__ ((weak)) _FAT_unlock(mutex_t *mutex) +{ + return; +} + +#endif // USE_LWP_LOCK diff --git a/portlibs/sources/libfat/lock.h b/portlibs/sources/libfat/lock.h new file mode 100644 index 00000000..de5723a9 --- /dev/null +++ b/portlibs/sources/libfat/lock.h @@ -0,0 +1,72 @@ +/* + lock.h + + Copyright (c) 2008 Sven Peter <svpe@gmx.net> + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. + +*/ + +#ifndef _LOCK_H +#define _LOCK_H + +#include "common.h" + +#ifdef USE_LWP_LOCK + +static inline void _FAT_lock_init(mutex_t *mutex) +{ + LWP_MutexInit(mutex, false); +} + +static inline void _FAT_lock_deinit(mutex_t *mutex) +{ + LWP_MutexDestroy(*mutex); +} + +static inline void _FAT_lock(mutex_t *mutex) +{ + LWP_MutexLock(*mutex); +} + +static inline void _FAT_unlock(mutex_t *mutex) +{ + LWP_MutexUnlock(*mutex); +} + +#else + +// We still need a blank lock type +#ifndef mutex_t +typedef int mutex_t; +#endif + +void _FAT_lock_init(mutex_t *mutex); +void _FAT_lock_deinit(mutex_t *mutex); +void _FAT_lock(mutex_t *mutex); +void _FAT_unlock(mutex_t *mutex); + +#endif // USE_LWP_LOCK + + +#endif // _LOCK_H + diff --git a/portlibs/sources/libfat/mem2.h b/portlibs/sources/libfat/mem2.h new file mode 100644 index 00000000..b8fa93cf --- /dev/null +++ b/portlibs/sources/libfat/mem2.h @@ -0,0 +1,27 @@ +// 2 MEM2 allocators, one for general purpose, one for covers +// Aligned and padded to 32 bytes, as required by many functions + +#ifndef __MEM2_H_ +#define __MEM2_H_ + +#ifdef __cplusplus +extern "C" +{ +#endif + +#include <gctypes.h> + +void MEM2_init(unsigned int mem2Size); +void MEM2_cleanup(void); +void MEM2_takeBigOnes(bool b); +void *MEM2_alloc(unsigned int s); +void *MEM2_realloc(void *p, unsigned int s); +void MEM2_free(void *p); +unsigned int MEM2_usableSize(void *p); +unsigned int MEM2_freesize(); + +#ifdef __cplusplus +} +#endif + +#endif // !defined(__MEM2_H_) diff --git a/portlibs/sources/libfat/mem_allocate.h b/portlibs/sources/libfat/mem_allocate.h new file mode 100644 index 00000000..622a25ab --- /dev/null +++ b/portlibs/sources/libfat/mem_allocate.h @@ -0,0 +1,50 @@ +/* + mem_allocate.h + Memory allocation and destruction calls + Replace these calls with custom allocators if + malloc is unavailable + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _MEM_ALLOCATE_H +#define _MEM_ALLOCATE_H + +#include <malloc.h> +#include "mem2.h" + +static inline void* _FAT_mem_allocate (size_t size) { + return MEM2_alloc(size); +} + +static inline void* _FAT_mem_align (size_t size) { + return MEM2_alloc(size); +} + +static inline void _FAT_mem_free (void* mem) { + //using normal free, it will decide which free to use (just to be on the safe side) + free(mem); +} + +#endif // _MEM_ALLOCATE_H diff --git a/portlibs/sources/libfat/partition.c b/portlibs/sources/libfat/partition.c new file mode 100644 index 00000000..41b9d761 --- /dev/null +++ b/portlibs/sources/libfat/partition.c @@ -0,0 +1,455 @@ +/* + partition.c + Functions for mounting and dismounting partitions + on various block devices. + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#include "partition.h" +#include "bit_ops.h" +#include "file_allocation_table.h" +#include "directory.h" +#include "mem_allocate.h" +#include "fatfile.h" + +#include <string.h> +#include <ctype.h> +#include <sys/iosupport.h> + +sec_t _FAT_startSector; + +/* +Data offsets +*/ + +// BIOS Parameter Block offsets +enum BPB { + BPB_jmpBoot = 0x00, + BPB_OEMName = 0x03, + // BIOS Parameter Block + BPB_bytesPerSector = 0x0B, + BPB_sectorsPerCluster = 0x0D, + BPB_reservedSectors = 0x0E, + BPB_numFATs = 0x10, + BPB_rootEntries = 0x11, + BPB_numSectorsSmall = 0x13, + BPB_mediaDesc = 0x15, + BPB_sectorsPerFAT = 0x16, + BPB_sectorsPerTrk = 0x18, + BPB_numHeads = 0x1A, + BPB_numHiddenSectors = 0x1C, + BPB_numSectors = 0x20, + // Ext BIOS Parameter Block for FAT16 + BPB_FAT16_driveNumber = 0x24, + BPB_FAT16_reserved1 = 0x25, + BPB_FAT16_extBootSig = 0x26, + BPB_FAT16_volumeID = 0x27, + BPB_FAT16_volumeLabel = 0x2B, + BPB_FAT16_fileSysType = 0x36, + // Bootcode + BPB_FAT16_bootCode = 0x3E, + // FAT32 extended block + BPB_FAT32_sectorsPerFAT32 = 0x24, + BPB_FAT32_extFlags = 0x28, + BPB_FAT32_fsVer = 0x2A, + BPB_FAT32_rootClus = 0x2C, + BPB_FAT32_fsInfo = 0x30, + BPB_FAT32_bkBootSec = 0x32, + // Ext BIOS Parameter Block for FAT32 + BPB_FAT32_driveNumber = 0x40, + BPB_FAT32_reserved1 = 0x41, + BPB_FAT32_extBootSig = 0x42, + BPB_FAT32_volumeID = 0x43, + BPB_FAT32_volumeLabel = 0x47, + BPB_FAT32_fileSysType = 0x52, + // Bootcode + BPB_FAT32_bootCode = 0x5A, + BPB_bootSig_55 = 0x1FE, + BPB_bootSig_AA = 0x1FF +}; + +// File system information block offsets +enum FSIB +{ + FSIB_SIG1 = 0x00, + FSIB_SIG2 = 0x1e4, + FSIB_numberOfFreeCluster = 0x1e8, + FSIB_numberLastAllocCluster = 0x1ec, + FSIB_bootSig_55 = 0x1FE, + FSIB_bootSig_AA = 0x1FF +}; + +static const char FAT_SIG[3] = {'F', 'A', 'T'}; +static const char FS_INFO_SIG1[4] = {'R', 'R', 'a', 'A'}; +static const char FS_INFO_SIG2[4] = {'r', 'r', 'A', 'a'}; + +sec_t FindFirstValidPartition(const DISC_INTERFACE* disc) +{ + uint8_t part_table[16*4]; + uint8_t *ptr; + int i; + + uint8_t *sectorBuffer = (uint8_t*) _FAT_mem_allocate(MAX_SECTOR_SIZE); + if(!sectorBuffer) { + return 0; + } + + // Read first sector of disc + if (!_FAT_disc_readSectors (disc, 0, 1, sectorBuffer)) { + _FAT_mem_free(sectorBuffer); + return 0; + } + + memcpy(part_table,sectorBuffer+0x1BE,16*4); + ptr = part_table; + + for(i=0;i<4;i++,ptr+=16) { + sec_t part_lba = u8array_to_u32(ptr, 0x8); + + if (!memcmp(sectorBuffer + BPB_FAT16_fileSysType, FAT_SIG, sizeof(FAT_SIG)) || + !memcmp(sectorBuffer + BPB_FAT32_fileSysType, FAT_SIG, sizeof(FAT_SIG))) { + _FAT_mem_free(sectorBuffer); + return part_lba; + } + + if(ptr[4]==0) continue; + + if(ptr[4]==0x0F) { + sec_t part_lba2=part_lba; + sec_t next_lba2=0; + int n; + + for(n=0;n<8;n++) // max 8 logic partitions + { + if(!_FAT_disc_readSectors (disc, part_lba+next_lba2, 1, sectorBuffer)) { + _FAT_mem_free(sectorBuffer); + return 0; + } + + part_lba2 = part_lba + next_lba2 + u8array_to_u32(sectorBuffer, 0x1C6) ; + next_lba2 = u8array_to_u32(sectorBuffer, 0x1D6); + + if(!_FAT_disc_readSectors (disc, part_lba2, 1, sectorBuffer)) { + _FAT_mem_free(sectorBuffer); + return 0; + } + + if (!memcmp(sectorBuffer + BPB_FAT16_fileSysType, FAT_SIG, sizeof(FAT_SIG)) || + !memcmp(sectorBuffer + BPB_FAT32_fileSysType, FAT_SIG, sizeof(FAT_SIG))) { + _FAT_mem_free(sectorBuffer); + return part_lba2; + } + + if(next_lba2==0) break; + } + } else { + if(!_FAT_disc_readSectors (disc, part_lba, 1, sectorBuffer)) { + _FAT_mem_free(sectorBuffer); + return 0; + } + if (!memcmp(sectorBuffer + BPB_FAT16_fileSysType, FAT_SIG, sizeof(FAT_SIG)) || + !memcmp(sectorBuffer + BPB_FAT32_fileSysType, FAT_SIG, sizeof(FAT_SIG))) { + _FAT_mem_free(sectorBuffer); + return part_lba; + } + } + } + _FAT_mem_free(sectorBuffer); + return 0; +} + + +PARTITION* _FAT_partition_constructor (const DISC_INTERFACE* disc, uint32_t cacheSize, uint32_t sectorsPerPage, sec_t startSector) { + PARTITION* partition; + + uint8_t *sectorBuffer = (uint8_t*) _FAT_mem_allocate(MAX_SECTOR_SIZE); + if(!sectorBuffer) { + return NULL; + } + + // Read first sector of disc + if (!_FAT_disc_readSectors (disc, startSector, 1, sectorBuffer)) { + _FAT_mem_free(sectorBuffer); + return NULL; + } + + // Make sure it is a valid MBR or boot sector + if ( (sectorBuffer[BPB_bootSig_55] != 0x55) || (sectorBuffer[BPB_bootSig_AA] != 0xAA)) { + _FAT_mem_free(sectorBuffer); + return NULL; + } + + if (startSector != 0) { + // We're told where to start the partition, so just accept it + } else if (!memcmp(sectorBuffer + BPB_FAT16_fileSysType, FAT_SIG, sizeof(FAT_SIG))) { + // Check if there is a FAT string, which indicates this is a boot sector + startSector = 0; + } else if (!memcmp(sectorBuffer + BPB_FAT32_fileSysType, FAT_SIG, sizeof(FAT_SIG))) { + // Check for FAT32 + startSector = 0; + } else { + startSector = FindFirstValidPartition(disc); + if (!_FAT_disc_readSectors (disc, startSector, 1, sectorBuffer)) { + _FAT_mem_free(sectorBuffer); + return NULL; + } + } + + _FAT_startSector = startSector; + + // Now verify that this is indeed a FAT partition + if (memcmp(sectorBuffer + BPB_FAT16_fileSysType, FAT_SIG, sizeof(FAT_SIG)) && + memcmp(sectorBuffer + BPB_FAT32_fileSysType, FAT_SIG, sizeof(FAT_SIG))) { + _FAT_mem_free(sectorBuffer); + return NULL; + } + + partition = (PARTITION*) _FAT_mem_allocate (sizeof(PARTITION)); + if (partition == NULL) { + _FAT_mem_free(sectorBuffer); + return NULL; + } + + // Init the partition lock + _FAT_lock_init(&partition->lock); + + if (!memcmp(sectorBuffer + BPB_FAT16_fileSysType, FAT_SIG, sizeof(FAT_SIG))) + strncpy(partition->label, (char*)(sectorBuffer + BPB_FAT16_volumeLabel), 11); + else + strncpy(partition->label, (char*)(sectorBuffer + BPB_FAT32_volumeLabel), 11); + partition->label[11] = '\0'; + + // Set partition's disc interface + partition->disc = disc; + + // Store required information about the file system + partition->fat.sectorsPerFat = u8array_to_u16(sectorBuffer, BPB_sectorsPerFAT); + if (partition->fat.sectorsPerFat == 0) { + partition->fat.sectorsPerFat = u8array_to_u32( sectorBuffer, BPB_FAT32_sectorsPerFAT32); + } + + partition->numberOfSectors = u8array_to_u16( sectorBuffer, BPB_numSectorsSmall); + if (partition->numberOfSectors == 0) { + partition->numberOfSectors = u8array_to_u32( sectorBuffer, BPB_numSectors); + } + + if(disc->features & FEATURE_WII_USB) + partition->bytesPerSector = u8array_to_u16(sectorBuffer, BPB_bytesPerSector); + else + partition->bytesPerSector = MIN_SECTOR_SIZE; + + if(partition->bytesPerSector < MIN_SECTOR_SIZE || partition->bytesPerSector > MAX_SECTOR_SIZE) { + // Unsupported sector size + _FAT_mem_free(sectorBuffer); + _FAT_mem_free(partition); + return NULL; + } + + partition->sectorsPerCluster = sectorBuffer[BPB_sectorsPerCluster] * u8array_to_u16(sectorBuffer, BPB_bytesPerSector) / partition->bytesPerSector; + partition->bytesPerCluster = partition->bytesPerSector * partition->sectorsPerCluster; + partition->fat.fatStart = startSector + u8array_to_u16(sectorBuffer, BPB_reservedSectors); + + partition->rootDirStart = partition->fat.fatStart + (sectorBuffer[BPB_numFATs] * partition->fat.sectorsPerFat); + partition->dataStart = partition->rootDirStart + + (( u8array_to_u16(sectorBuffer, BPB_rootEntries) * DIR_ENTRY_DATA_SIZE) / partition->bytesPerSector); + + partition->totalSize = ((uint64_t)partition->numberOfSectors - (partition->dataStart - startSector)) * (uint64_t)partition->bytesPerSector; + + //FS info sector + partition->fsInfoSector = startSector + (u8array_to_u16(sectorBuffer, BPB_FAT32_fsInfo) ? u8array_to_u16(sectorBuffer, BPB_FAT32_fsInfo) : 1); + + // Store info about FAT + uint32_t clusterCount = (partition->numberOfSectors - (uint32_t)(partition->dataStart - startSector)) / partition->sectorsPerCluster; + partition->fat.lastCluster = clusterCount + CLUSTER_FIRST - 1; + partition->fat.firstFree = CLUSTER_FIRST; + partition->fat.numberFreeCluster = 0; + partition->fat.numberLastAllocCluster = 0; + + if (clusterCount < CLUSTERS_PER_FAT12) { + partition->filesysType = FS_FAT12; // FAT12 volume + } else if (clusterCount < CLUSTERS_PER_FAT16) { + partition->filesysType = FS_FAT16; // FAT16 volume + } else { + partition->filesysType = FS_FAT32; // FAT32 volume + } + + if (partition->filesysType != FS_FAT32) { + partition->rootDirCluster = FAT16_ROOT_DIR_CLUSTER; + } else { + // Set up for the FAT32 way + partition->rootDirCluster = u8array_to_u32(sectorBuffer, BPB_FAT32_rootClus); + // Check if FAT mirroring is enabled + if (!(sectorBuffer[BPB_FAT32_extFlags] & 0x80)) { + // Use the active FAT + partition->fat.fatStart = partition->fat.fatStart + ( partition->fat.sectorsPerFat * (sectorBuffer[BPB_FAT32_extFlags] & 0x0F)); + } + } + + // Create a cache to use + partition->cache = _FAT_cache_constructor (cacheSize, sectorsPerPage, partition->disc, startSector+partition->numberOfSectors, partition->bytesPerSector); + + // Set current directory to the root + partition->cwdCluster = partition->rootDirCluster; + + // Check if this disc is writable, and set the readOnly property appropriately + partition->readOnly = !(_FAT_disc_features(disc) & FEATURE_MEDIUM_CANWRITE); + + // There are currently no open files on this partition + partition->openFileCount = 0; + partition->firstOpenFile = NULL; + + _FAT_partition_readFSinfo(partition); + + _FAT_mem_free(sectorBuffer); + + return partition; +} + +void _FAT_partition_destructor (PARTITION* partition) { + FILE_STRUCT* nextFile; + + _FAT_lock(&partition->lock); + + // Synchronize open files + nextFile = partition->firstOpenFile; + while (nextFile) { + _FAT_syncToDisc (nextFile); + nextFile = nextFile->nextOpenFile; + } + + // Write out the fs info sector + _FAT_partition_writeFSinfo(partition); + + // Free memory used by the cache, writing it to disc at the same time + _FAT_cache_destructor (partition->cache); + + // Unlock the partition and destroy the lock + _FAT_unlock(&partition->lock); + _FAT_lock_deinit(&partition->lock); + + // Free memory used by the partition + _FAT_mem_free (partition); +} + +PARTITION* _FAT_partition_getPartitionFromPath (const char* path) { + const devoptab_t *devops; + + devops = GetDeviceOpTab (path); + + if (!devops) { + return NULL; + } + + return (PARTITION*)devops->deviceData; +} + +void _FAT_partition_createFSinfo(PARTITION * partition) +{ + if(partition->readOnly || partition->filesysType != FS_FAT32) + return; + + uint8_t *sectorBuffer = (uint8_t*) _FAT_mem_allocate(partition->bytesPerSector); + if(!sectorBuffer) { + return; + } + memset(sectorBuffer, 0, partition->bytesPerSector); + + int i; + for(i = 0; i < 4; ++i) + { + sectorBuffer[FSIB_SIG1+i] = FS_INFO_SIG1[i]; + sectorBuffer[FSIB_SIG2+i] = FS_INFO_SIG2[i]; + } + + partition->fat.numberFreeCluster = _FAT_fat_freeClusterCount(partition); + u32_to_u8array(sectorBuffer, FSIB_numberOfFreeCluster, partition->fat.numberFreeCluster); + u32_to_u8array(sectorBuffer, FSIB_numberLastAllocCluster, partition->fat.numberLastAllocCluster); + + sectorBuffer[FSIB_bootSig_55] = 0x55; + sectorBuffer[FSIB_bootSig_AA] = 0xAA; + + _FAT_disc_writeSectors (partition->disc, partition->fsInfoSector, 1, sectorBuffer); + + _FAT_mem_free(sectorBuffer); +} + +void _FAT_partition_readFSinfo(PARTITION * partition) +{ + if(partition->filesysType != FS_FAT32) + return; + + uint8_t *sectorBuffer = (uint8_t*) _FAT_mem_allocate(partition->bytesPerSector); + if(!sectorBuffer) { + return; + } + memset(sectorBuffer, 0, partition->bytesPerSector); + // Read first sector of disc + if (!_FAT_disc_readSectors (partition->disc, partition->fsInfoSector, 1, sectorBuffer)) { + _FAT_mem_free(sectorBuffer); + return; + } + + if(memcmp(sectorBuffer+FSIB_SIG1, FS_INFO_SIG1, 4) != 0 || + memcmp(sectorBuffer+FSIB_SIG2, FS_INFO_SIG2, 4) != 0 || + u8array_to_u32(sectorBuffer, FSIB_numberOfFreeCluster) == 0) { + //sector does not yet exist, create one! + _FAT_partition_createFSinfo(partition); + _FAT_mem_free(sectorBuffer); + return; + } + + partition->fat.numberFreeCluster = u8array_to_u32(sectorBuffer, FSIB_numberOfFreeCluster); + partition->fat.numberLastAllocCluster = u8array_to_u32(sectorBuffer, FSIB_numberLastAllocCluster); + _FAT_mem_free(sectorBuffer); +} + +void _FAT_partition_writeFSinfo(PARTITION * partition) +{ + if(partition->filesysType != FS_FAT32) + return; + + uint8_t *sectorBuffer = (uint8_t*) _FAT_mem_allocate(partition->bytesPerSector); + if(!sectorBuffer) { + return; + } + memset(sectorBuffer, 0, partition->bytesPerSector); + // Read first sector of disc + if (!_FAT_disc_readSectors (partition->disc, partition->fsInfoSector, 1, sectorBuffer)) { + _FAT_mem_free(sectorBuffer); + return; + } + + if(memcmp(sectorBuffer+FSIB_SIG1, FS_INFO_SIG1, 4) || memcmp(sectorBuffer+FSIB_SIG2, FS_INFO_SIG2, 4)) { + _FAT_mem_free(sectorBuffer); + return; + } + + u32_to_u8array(sectorBuffer, FSIB_numberOfFreeCluster, partition->fat.numberFreeCluster); + u32_to_u8array(sectorBuffer, FSIB_numberLastAllocCluster, partition->fat.numberLastAllocCluster); + + // Read first sector of disc + _FAT_disc_writeSectors (partition->disc, partition->fsInfoSector, 1, sectorBuffer); + _FAT_mem_free(sectorBuffer); +} diff --git a/portlibs/sources/libfat/partition.h b/portlibs/sources/libfat/partition.h new file mode 100644 index 00000000..ec27a0eb --- /dev/null +++ b/portlibs/sources/libfat/partition.h @@ -0,0 +1,107 @@ +/* + partition.h + Functions for mounting and dismounting partitions + on various block devices. + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _PARTITION_H +#define _PARTITION_H + +#include "common.h" +#include "cache.h" +#include "lock.h" + +#define MIN_SECTOR_SIZE 512 +#define MAX_SECTOR_SIZE 4096 + +// Filesystem type +typedef enum {FS_UNKNOWN, FS_FAT12, FS_FAT16, FS_FAT32} FS_TYPE; + +typedef struct { + sec_t fatStart; + uint32_t sectorsPerFat; + uint32_t lastCluster; + uint32_t firstFree; + uint32_t numberFreeCluster; + uint32_t numberLastAllocCluster; +} FAT; + +typedef struct { + const DISC_INTERFACE* disc; + CACHE* cache; + // Info about the partition + FS_TYPE filesysType; + uint64_t totalSize; + sec_t rootDirStart; + uint32_t rootDirCluster; + uint32_t numberOfSectors; + sec_t dataStart; + uint32_t bytesPerSector; + uint32_t sectorsPerCluster; + uint32_t bytesPerCluster; + uint32_t fsInfoSector; + FAT fat; + // Values that may change after construction + uint32_t cwdCluster; // Current working directory cluster + int openFileCount; + struct _FILE_STRUCT* firstOpenFile; // The start of a linked list of files + mutex_t lock; // A lock for partition operations + bool readOnly; // If this is set, then do not try writing to the disc + char label[12]; // Volume label +} PARTITION; + +/* +Mount the supplied device and return a pointer to the struct necessary to use it +*/ +PARTITION* _FAT_partition_constructor (const DISC_INTERFACE* disc, uint32_t cacheSize, uint32_t SectorsPerPage, sec_t startSector); + +/* +Dismount the device and free all structures used. +Will also attempt to synchronise all open files to disc. +*/ +void _FAT_partition_destructor (PARTITION* partition); + +/* +Return the partition specified in a path, as taken from the devoptab. +*/ +PARTITION* _FAT_partition_getPartitionFromPath (const char* path); + +/* +Create the fs info sector. +*/ +void _FAT_partition_createFSinfo(PARTITION * partition); + +/* +Read the fs info sector data. +*/ +void _FAT_partition_readFSinfo(PARTITION * partition); + +/* +Write the fs info sector data. +*/ +void _FAT_partition_writeFSinfo(PARTITION * partition); + +#endif // _PARTITION_H diff --git a/portlibs/sources/libmodplay/Makefile b/portlibs/sources/libmodplay/Makefile new file mode 100644 index 00000000..00bee7f2 --- /dev/null +++ b/portlibs/sources/libmodplay/Makefile @@ -0,0 +1,128 @@ +#--------------------------------------------------------------------------------- +# Clear the implicit built in rules +#--------------------------------------------------------------------------------- +.SUFFIXES: +#--------------------------------------------------------------------------------- +ifeq ($(strip $(DEVKITPPC)),) +$(error "Please set DEVKITPPC in your environment. export DEVKITPPC=<path to>devkitPPC") +endif + +include $(DEVKITPPC)/wii_rules + +# MACHDEP = -DGEKKO -O2 -mcpu=750 -meabi -mhard-float -ffunction-sections -fdata-sections -fmodulo-sched + +#--------------------------------------------------------------------------------- +# TARGET is the name of the output +# BUILD is the directory where object files & intermediate files will be placed +# SOURCES is a list of directories containing source code +# INCLUDES is a list of directories containing extra header files +#--------------------------------------------------------------------------------- +TARGET := modplay +BUILD ?= build +SOURCES := source +DATA := +INCLUDES := + +#--------------------------------------------------------------------------------- +# options for code generation +#--------------------------------------------------------------------------------- + +# CFLAGS = -g -O2 -Wall $(MACHDEP) $(INCLUDE) +CFLAGS = -ffast-math -O3 -pipe -mrvl -mcpu=750 -meabi -mhard-float -Wall $(MACHDEP) $(INCLUDE) -DGEKKO -DHAVE_CONFIG_H +CXXFLAGS = $(CFLAGS) +# LDFLAGS = -g $(MACHDEP) -Wl,-Map,$(notdir $@).map +ARFLAGS = rcs +ASFLAGS = -D_LANGUAGE_ASSEMBLY -DHW_RVL + +#--------------------------------------------------------------------------------- +# any extra libraries we wish to link with the project +#--------------------------------------------------------------------------------- +LIBS := + +#--------------------------------------------------------------------------------- +# list of directories containing libraries, this must be the top level containing +# include and lib +#--------------------------------------------------------------------------------- +LIBDIRS := + +#--------------------------------------------------------------------------------- +# no real need to edit anything past this point unless you need to add additional +# rules for different file extensions +#--------------------------------------------------------------------------------- +ifneq ($(BUILD),$(notdir $(CURDIR))) +#--------------------------------------------------------------------------------- + +export TOPDIR := $(CURDIR) +export OUTPUT := $(CURDIR)/lib$(TARGET) +export VPATH := $(foreach dir,$(SOURCES),$(CURDIR)/$(dir)) \ + $(foreach dir,$(DATA),$(CURDIR)/$(dir)) \ + $(foreach dir,$(STUBSOURCES),$(CURDIR)/$(dir)) +export DEPSDIR := $(CURDIR)/$(BUILD) + +#--------------------------------------------------------------------------------- +# automatically build a list of object files for our project +#--------------------------------------------------------------------------------- +CFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.c))) + +#--------------------------------------------------------------------------------- +# build a list of include paths +#--------------------------------------------------------------------------------- +export INCLUDE := $(foreach dir,$(INCLUDES), -iquote $(CURDIR)/$(dir)) \ + $(foreach dir,$(LIBDIRS),-I$(dir)/include) \ + -I$(CURDIR)/$(BUILD) \ + -I$(LIBOGC_INC) + +#--------------------------------------------------------------------------------- +# build a list of library paths +#--------------------------------------------------------------------------------- +export LIBPATHS := $(foreach dir,$(LIBDIRS),-L$(dir)/lib) \ + -L$(LIBOGC_LIB) + +export OUTPUT := $(CURDIR)/lib$(TARGET) + +export LD := $(CC) + +export OFILES := $(CFILES:.c=.o) + +.PHONY: $(BUILD) clean + +#--------------------------------------------------------------------------------- +$(BUILD): + @[ -d $@ ] || mkdir -p $@ + @make --no-print-directory -C $(BUILD) -f $(CURDIR)/Makefile + +#--------------------------------------------------------------------------------- +clean: + @echo clean ... + @rm -fr $(BUILD) lib$(TARGET).a + +#--------------------------------------------------------------------------------- +install: + @echo Installing ... + @mkdir -p ../../include/$(TARGET) + @install -v -m 644 lib$(TARGET).a ../../lib + @install -v -m 644 source/defines.h ../../include/$(TARGET) + @install -v -m 644 source/envelope.h ../../include/$(TARGET) + @install -v -m 644 source/mixer.h ../../include/$(TARGET) + @install -v -m 644 source/modplay.h ../../include/$(TARGET) + @install -v -m 644 source/modplay_core.h ../../include/$(TARGET) + + +#--------------------------------------------------------------------------------- +else + +DEPENDS = $(OFILES:.o=.d) $(OSTUBFILES:.o=.d) + +#--------------------------------------------------------------------------------- +# main targets +#--------------------------------------------------------------------------------- +$(OUTPUT).a: $(OFILES) + @rm -f $(OUTPUT).a + @$(AR) $(ARFLAGS) $(OUTPUT).a $(OFILES) + @echo built ... $(notdir $@) + +-include $(DEPENDS) + +#--------------------------------------------------------------------------------- +endif +#--------------------------------------------------------------------------------- diff --git a/portlibs/sources/libmodplay/source/defines.h b/portlibs/sources/libmodplay/source/defines.h new file mode 100644 index 00000000..0bb5ace8 --- /dev/null +++ b/portlibs/sources/libmodplay/source/defines.h @@ -0,0 +1,11 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __DEFINES_H__ +#define __DEFINES_H__ + +#include <gccore.h> + +#endif diff --git a/portlibs/sources/libmodplay/source/effects.c b/portlibs/sources/libmodplay/source/effects.c new file mode 100644 index 00000000..63dc0faa --- /dev/null +++ b/portlibs/sources/libmodplay/source/effects.c @@ -0,0 +1,1708 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#include "effects.h" +#include "modplay_core.h" + +static u32 mod_finetunes[16] = { + + 7895,7941,7985,8046,8107,8169,8232,8280, + 8363,8413,8463,8529,8581,8651,8723,8757 +}; + +static u16 wavetab[4][64] = { + + { /* Sine */ + (u16)0, (u16)24, (u16)49, (u16)74, (u16)97, (u16)120, (u16)141, (u16)161, + (u16)180, (u16)197, (u16)212, (u16)224, (u16)235, (u16)244, (u16)250, (u16)253, + (u16)255, (u16)253, (u16)250, (u16)244, (u16)235, (u16)224, (u16)212, (u16)197, + (u16)180, (u16)161, (u16)141, (u16)120, (u16)97, (u16)74, (u16)49, (u16)24, + (u16)0, (u16)-24, (u16)-49, (u16)-74, (u16)-97, (u16)-120,(u16)-141,(u16)-161, + (u16)-180,(u16)-197,(u16)-212,(u16)-224,(u16)-235,(u16)-244,(u16)-250,(u16)-253, + (u16)-255,(u16)-253,(u16)-250,(u16)-244,(u16)-235,(u16)-224,(u16)-212,(u16)-197, + (u16)-180,(u16)-161,(u16)-141,(u16)-120,(u16)-97, (u16)-74, (u16)-49, (u16)-24 + }, { /* Ramp down */ + + (u16)255, (u16)247, (u16)239, (u16)231, (u16)223, (u16)215, (u16)207, (u16)199, + (u16)191, (u16)183, (u16)175, (u16)167, (u16)159, (u16)151, (u16)143, (u16)135, + (u16)127, (u16)119, (u16)111, (u16)103, (u16)95, (u16)87, (u16)79, (u16)71, + (u16)63, (u16)55, (u16)47, (u16)39, (u16)31, (u16)23, (u16)15, (u16)7, + (u16)-1, (u16)-9, (u16)-17, (u16)-25, (u16)-33, (u16)-41, (u16)-49, (u16)-57, + (u16)-65, (u16)-73, (u16)-81, (u16)-89, (u16)-97, (u16)-105,(u16)-113,(u16)-121, + (u16)-129,(u16)-137,(u16)-145,(u16)-153,(u16)-161,(u16)-169,(u16)-177,(u16)-185, + (u16)-193,(u16)-201,(u16)-209,(u16)-217,(u16)-225,(u16)-233,(u16)-241,(u16)-249 + }, { /* Square wave */ + + (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, + (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, + (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, + (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, (u16)255, + (u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255, + (u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255, + (u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255, + (u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255,(u16)-255 + }, { /* Random */ + + (u16)-26, (u16)-251,(u16)-198,(u16)-46, (u16)-96, (u16)198, (u16)168, (u16)228, + (u16)-49, (u16)-153,(u16)-236,(u16)-174,(u16)-37, (u16)61, (u16)187, (u16)120, + (u16)56, (u16)-197,(u16)248, (u16)-58, (u16)-204,(u16)172, (u16)58, (u16)253, + (u16)-155,(u16)57, (u16)62, (u16)-62, (u16)60, (u16)-137,(u16)-101,(u16)-184, + (u16)66, (u16)-160,(u16)160, (u16)-29, (u16)-91, (u16)243, (u16)175, (u16)-175, + (u16)149, (u16)97, (u16)3, (u16)-113,(u16)7, (u16)249, (u16)-241,(u16)-247, + (u16)110, (u16)-180,(u16)-139,(u16)-20, (u16)246, (u16)-86, (u16)-80, (u16)-134, + (u16)219, (u16)117, (u16)-143,(u16)-226,(u16)-166,(u16)120, (u16)-47, (u16)29 + } +}; + + +/***************************************************************************** + * Pro/Soundtracker Effects * + *****************************************************************************/ + + +/**** EFFECT_NONE */ +static int effect_None_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + return 0; +} + +static int effect_None_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_None_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + +/**** EFFECT_ST00 - Arpeggio */ +static int effect_ST00_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + mod->channels[channel].effects[ecol].arpeggio_base = mod->channels[channel].st3_period; + return 0; +} + +static int effect_ST00_Process(MODFILE *mod, int channel, int ecol) { + + u8 note, dnote; + u8 octave; + u8 semitone; + + if (!mod->channels[channel].sample) + return 0; + + note = mod->channels[channel].last_note; + dnote = ((note >> 4) * 12) + (note & 0x0f); + dnote += mod->channels[channel].sample->relative_note; + dnote = ((dnote / 12) << 4) | (dnote % 12); + + octave = dnote >> 4; + semitone = dnote & 0x0f; + + if (mod->channels[channel].effects[ecol].arpeggio_count == 0) { + + MODFILE_SetNote(mod, channel, + mod->channels[channel].instrument->note[(octave << 4) | semitone], + mod->channels[channel].sample->middle_c, + mod->channels[channel].sample->finetune); + } else if (mod->channels[channel].effects[ecol].arpeggio_count == 1) { + + semitone += mod->channels[channel].effects[ecol].cur_operand >> 4; + if (semitone > 11) { + + semitone -= 12; + octave++; + } + MODFILE_SetNote(mod, channel, + mod->channels[channel].instrument->note[(octave << 4) | semitone], + mod->channels[channel].sample->middle_c, + mod->channels[channel].sample->finetune); + } else if (mod->channels[channel].effects[ecol].arpeggio_count == 2) { + + semitone += mod->channels[channel].effects[ecol].cur_operand & 0x0f; + if (semitone > 11) { + + semitone -= 12; + octave++; + } + MODFILE_SetNote(mod, channel, + mod->channels[channel].instrument->note[(octave << 4) | semitone], + mod->channels[channel].sample->middle_c, + mod->channels[channel].sample->finetune); + } + + if (++mod->channels[channel].effects[ecol].arpeggio_count > 2) + mod->channels[channel].effects[ecol].arpeggio_count = 0; + + return 0; +} + +static int effect_ST00_Stop(MODFILE *mod, int channel, int ecol) { + + u8 dnote, note; + + if (!mod->channels[channel].sample || + !mod->channels[channel].instrument) + return 0; + + note = mod->channels[channel].last_note; + dnote = ((note >> 4) * 12) + (note & 0x0f); + dnote += mod->channels[channel].sample->relative_note; + dnote = ((dnote / 12) << 4) | (dnote % 12); + + MODFILE_SetNote(mod, channel, + mod->channels[channel].instrument->note[dnote], + mod->channels[channel].sample->middle_c, + mod->channels[channel].sample->finetune); + + return 0; +} + + + + +/**** EFFECT_ST10 - Portamento Up */ +static int effect_ST10_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + return 0; +} + +static int effect_ST10_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + u32 period = mod->channels[channel].st3_period; + period -= 4 * (u32)mod->channels[channel].effects[ecol].cur_operand; + MODFILE_SetPeriod(mod, channel, period); + } + + return 0; +} + +static int effect_ST10_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_ST20 - Portamento Down */ +static int effect_ST20_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + return 0; +} + +static int effect_ST20_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + u32 period = mod->channels[channel].st3_period; + period += 4 * (u32)mod->channels[channel].effects[ecol].cur_operand; + MODFILE_SetPeriod(mod, channel, period); + } + + return 0; +} + +static int effect_ST20_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_ST30 - Tone Portamento */ +static int effect_ST30_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] == 0) + mod->channels[channel].effects[ecol].cur_operand = + mod->channels[channel].effects[ecol].toneporta_bak; + else + mod->channels[channel].effects[ecol].toneporta_bak = note->operand[ecol]; + + return EFFECT_DONOTCHANGEPERIOD | + EFFECT_DONOTRESETSAMPLEPOS; +} + +static int effect_ST30_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + if (mod->channels[channel].st3_period > mod->channels[channel].effects[ecol].toneporta_dest) { + + mod->channels[channel].st3_period -= 4 * (u32)mod->channels[channel].effects[ecol].cur_operand; + + if ((mod->channels[channel].st3_period < mod->channels[channel].effects[ecol].toneporta_dest) || + (mod->channels[channel].st3_period & 0x80000000)) + mod->channels[channel].st3_period = mod->channels[channel].effects[ecol].toneporta_dest; + } else if (mod->channels[channel].st3_period < mod->channels[channel].effects[ecol].toneporta_dest) { + + mod->channels[channel].st3_period += 4 * (u32)mod->channels[channel].effects[ecol].cur_operand; + + if (mod->channels[channel].st3_period > mod->channels[channel].effects[ecol].toneporta_dest) + mod->channels[channel].st3_period = mod->channels[channel].effects[ecol].toneporta_dest; + } + MODFILE_SetPeriod(mod, channel, mod->channels[channel].st3_period); + } + + return 0; +} + +static int effect_ST30_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_ST40 - Vibrato */ +static int effect_ST40_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u8 operand; + + if (note->operand[ecol] != 0) + mod->channels[channel].effects[ecol].vibrato_bak = note->operand[ecol]; + + operand = mod->channels[channel].effects[ecol].vibrato_bak; + mod->channels[channel].effects[ecol].cur_operand = operand; + + if (operand & 0x0f) + mod->channels[channel].effects[ecol].vibrato_depth = operand & 0x0f; + if (operand & 0xf0) + mod->channels[channel].effects[ecol].vibrato_freq = (operand >> 4) & 0x0f; + + return 0; +} + +static int effect_ST40_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + s32 wavetabval = (s32)(s16) + wavetab[mod->channels[channel].effects[ecol].vibrato_wave & 3] + [mod->channels[channel].effects[ecol].vibrato_sintabpos]; + + s32 periodofs = ((s32)(wavetabval * 4 * + (s32)(s16)mod->channels[channel].effects[ecol].vibrato_depth)) >> 7; + + MODFILE_SetPeriodOfs(mod, channel, periodofs); + + mod->channels[channel].effects[ecol].vibrato_sintabpos += mod->channels[channel].effects[ecol].vibrato_freq; + mod->channels[channel].effects[ecol].vibrato_sintabpos &= 63; + } + + return 0; +} + +static int effect_ST40_Stop(MODFILE *mod, int channel, int ecol) { + + MODFILE_SetPeriodOfs(mod, channel, 0); + return 0; +} + + + + +/**** EFFECT_STa0 - Volume Slide */ +static int effect_STa0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + return 0; +} + +static void doSTVolumeSlide(MODFILE *mod, int channel, int ecol) { + + if (mod->channels[channel].effects[ecol].cur_operand & 0xf0) { /* Up */ + + MODFILE_AddVolume(mod, channel, mod->channels[channel].effects[ecol].cur_operand >> 4); + } else + if (mod->channels[channel].effects[ecol].cur_operand & 0x0f) { /* Down */ + + MODFILE_SubVolume(mod, channel, mod->channels[channel].effects[ecol].cur_operand & 0x0f); + } +} + +static int effect_STa0_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + doSTVolumeSlide(mod, channel, ecol); + } + + return 0; +} + +static int effect_STa0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_ST50 - Tone Portamento + Volume Slide */ +static int effect_ST50_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + +/* effect_ST30_Start(mod, channel, ecol, note);*/ + effect_STa0_Start(mod, channel, ecol, note); + return 0; +} + +static int effect_ST50_Process(MODFILE *mod, int channel, int ecol) { + + effect_ST30_Process(mod, channel, ecol); + effect_STa0_Process(mod, channel, ecol); + return 0; +} + +static int effect_ST50_Stop(MODFILE *mod, int channel, int ecol) { + + effect_ST30_Stop(mod, channel, ecol); + effect_STa0_Stop(mod, channel, ecol); + return 0; +} + + + + +/**** EFFECT_ST60 - Vibrato + Volume Slide */ +static int effect_ST60_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + +/* effect_ST40_Start(mod, channel, ecol, note);*/ + effect_STa0_Start(mod, channel, ecol, note); + return 0; +} + +static int effect_ST60_Process(MODFILE *mod, int channel, int ecol) { + + effect_ST40_Process(mod, channel, ecol); + effect_STa0_Process(mod, channel, ecol); + return 0; +} + +static int effect_ST60_Stop(MODFILE *mod, int channel, int ecol) { + + effect_ST40_Stop(mod, channel, ecol); + effect_STa0_Stop(mod, channel, ecol); + return 0; +} + + + + +/**** EFFECT_ST70 - Tremolo */ +static int effect_ST70_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u8 operand; + + if (note->operand[ecol] == 0) + mod->channels[channel].effects[ecol].cur_operand = + mod->channels[channel].effects[ecol].tremolo_bak; + else + mod->channels[channel].effects[ecol].tremolo_bak = note->operand[ecol]; + + operand = mod->channels[channel].effects[ecol].cur_operand; + + mod->channels[channel].effects[ecol].tremolo_base = mod->channels[channel].voiceInfo.volume; + + if (operand & 0x0f) + mod->channels[channel].effects[ecol].tremolo_depth = operand & 0x0f; + if (operand & 0xf0) + mod->channels[channel].effects[ecol].tremolo_freq = (operand >> 4) & 0x0f; + + return 0; +} + +static int effect_ST70_Process(MODFILE *mod, int channel, int ecol) { + + u16 v; + s16 delta = wavetab[mod->channels[channel].effects[ecol].tremolo_wave & 3][mod->channels[channel].effects[ecol].tremolo_sintabpos]; + delta *= mod->channels[channel].effects[ecol].tremolo_depth; + delta >>= 7; + + v = mod->channels[channel].effects[ecol].tremolo_base + delta; + + if (v > 64) + v = 64; + if (v & 0xff80) + v = 0; + + mod->channels[channel].voiceInfo.volume = v; + + if (mod->speedcounter != 0) { + + mod->channels[channel].effects[ecol].tremolo_sintabpos += mod->channels[channel].effects[ecol].tremolo_freq; + mod->channels[channel].effects[ecol].tremolo_sintabpos &= 63; + } + + return 0; +} + +static int effect_ST70_Stop(MODFILE *mod, int channel, int ecol) { + + mod->channels[channel].voiceInfo.volume = mod->channels[channel].effects[ecol].tremolo_base; + return 0; +} + + + + +/**** EFFECT_ST80 - Panning */ +static int effect_ST80_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + mod->channels[channel].voiceInfo.panning = note->operand[ecol]; + return EFFECT_DONOTCHANGEPANNING; +} + +static int effect_ST80_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_ST80_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_ST90 - Sample Offset */ +static int effect_ST90_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + +/* return EFFECT_DONOTRESETSAMPLEPOS;*/ + return 0; +} + +static int effect_ST90_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter == 0) { + + MIXER_TYPE ofs; + + ofs = ((MIXER_TYPE)mod->channels[channel].effects[ecol].cur_operand) << (8 + MIXER_SHIFT); + if (ofs > ((MIXER_TYPE)mod->channels[channel].sample->sampleInfo.length) << MIXER_SHIFT) + mod->channels[channel].voiceInfo.playpos = + ((MIXER_TYPE)mod->channels[channel].sample->sampleInfo.length) << MIXER_SHIFT; + else + mod->channels[channel].voiceInfo.playpos = ofs; + + mod->channels[channel].voiceInfo.forward = TRUE; + } + + return 0; +} + +static int effect_ST90_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STb0 - Position Jump */ +static int effect_STb0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + mod->play_position = note->operand[ecol]; + mod->pattern_line = 0; + + return EFFECT_DONOTADVANCEPATTERN; +} + +static int effect_STb0_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STb0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STc0 - Set Volume */ +static int effect_STc0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] > 64) + mod->channels[channel].voiceInfo.volume = 64; + else + mod->channels[channel].voiceInfo.volume = note->operand[ecol]; + + return EFFECT_DONOTCHANGEVOLUME; +} + +static int effect_STc0_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STc0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STd0 - Pattern Break */ +static int effect_STd0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + do { + + mod->play_position++; + if (mod->play_position >= mod->songlength) + mod->play_position = 0; + } while (mod->playlist[mod->play_position] >= 0xfe); + + mod->pattern_line = note->operand[ecol]; + + return EFFECT_DONOTADVANCEPATTERN; +} + +static int effect_STd0_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STd0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STe1 - Fineslide Up */ +static int effect_STe1_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u32 period = mod->channels[channel].st3_period; + period -= 4 * (u32)mod->channels[channel].effects[ecol].cur_operand; + MODFILE_SetPeriod(mod, channel, period); + + return 0; +} + +static int effect_STe1_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STe1_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STe2 - Fineslide Down */ +static int effect_STe2_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u32 period = mod->channels[channel].st3_period; + period += 4 * (u32)mod->channels[channel].effects[ecol].cur_operand; + MODFILE_SetPeriod(mod, channel, period); + + return 0; +} + +static int effect_STe2_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STe2_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STe4 - Vibrato Control*/ +static int effect_STe4_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + mod->channels[channel].effects[ecol].vibrato_wave = note->operand[ecol] & 0x07; + return 0; +} + +static int effect_STe4_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STe4_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STe5 - Set Finetune */ +static int effect_STe5_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (mod->channels[channel].sample) + mod->channels[channel].sample->middle_c = + mod_finetunes[mod->channels[channel].effects[ecol].cur_operand & 0x0f]; + + return 0; +} + +static int effect_STe5_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->channels[channel].sample) + mod->channels[channel].sample->middle_c = + mod_finetunes[mod->channels[channel].effects[ecol].cur_operand & 0x0f]; + + return 0; +} + +static int effect_STe5_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STe6 - Pattern Loop */ +static int effect_STe6_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + BOOL doPatternLoop = FALSE; + int retVal = 0; + + if ((note->operand[ecol] & 0x0f) == 0) + mod->patternloop_to = mod->pattern_line; + else { + + doPatternLoop = TRUE; + if (mod->patternloop_count == 0) { + + mod->patternloop_count = note->operand[ecol] & 0x0f; + } else { + + if (--mod->patternloop_count == 0) + doPatternLoop = FALSE; + } + } + + if (doPatternLoop) { + + mod->pattern_line = mod->patternloop_to; + retVal = EFFECT_DONOTADVANCEPATTERN; + } + + return retVal; +} + +static int effect_STe6_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STe6_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STe7 - Tremolo Control */ +static int effect_STe7_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + mod->channels[channel].effects[ecol].tremolo_wave = note->operand[ecol] & 0x07; + return 0; +} + +static int effect_STe7_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STe7_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STe8 - Panning */ +static int effect_STe8_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + mod->channels[channel].voiceInfo.panning = + ((mod->channels[channel].effects[ecol].cur_operand & 0x0f) + 1) * 16; + return 0; +} + +static int effect_STe8_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STe8_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STe9 - Retrig Note */ +static int effect_STe9_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + return 0; +} + +static int effect_STe9_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + if ((mod->speedcounter % + (int)mod->channels[channel].effects[ecol].cur_operand) == 0) + MODFILE_TriggerNote(mod, channel, + mod->channels[channel].last_note, + mod->channels[channel].last_instrument, + 0xff, 0); + } + + return 0; +} + +static int effect_STe9_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STea - Fine Volume Up */ +static int effect_STea_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u8 operand; + + operand = mod->channels[channel].effects[ecol].cur_operand; + if (operand != 0) + mod->channels[channel].effects[ecol].finevolslideup_bak = operand; + else + operand = mod->channels[channel].effects[ecol].finevolslideup_bak; + + MODFILE_AddVolume(mod, channel, operand); + + return 0; +} + +static int effect_STea_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STea_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STeb - Fine Volume Down */ +static int effect_STeb_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u8 operand; + + operand = mod->channels[channel].effects[ecol].cur_operand; + if (operand != 0) + mod->channels[channel].effects[ecol].finevolslidedown_bak = operand; + else + operand = mod->channels[channel].effects[ecol].finevolslidedown_bak; + + MODFILE_SubVolume(mod, channel, operand); + + return 0; +} + +static int effect_STeb_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STeb_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STec - Note Cut */ +static int effect_STec_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + return 0; +} + +static int effect_STec_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + if (mod->speedcounter == mod->channels[channel].effects[ecol].cur_operand) + mod->channels[channel].voiceInfo.volume = 0; + } + + return 0; +} + +static int effect_STec_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STed - Note Delay */ +static int effect_STed_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + mod->channels[channel].effects[ecol].notedelay_note = note; + + return EFFECT_DONOTTRIGGERNOTE; +} + +static int effect_STed_Process(MODFILE *mod, int channel, int ecol) { + + MOD_Note *note = mod->channels[channel].effects[ecol].notedelay_note; + + if (mod->speedcounter != 0) { + + if (mod->speedcounter == mod->channels[channel].effects[ecol].cur_operand) { + + MODFILE_TriggerNote(mod, channel, note->note, note->instrument, note->volume, note->effect); + } + } + + return 0; +} + +static int effect_STed_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STee - Pattern Delay */ +static int effect_STee_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + return 0; +} + +static int effect_STee_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter == 0) { + + mod->patterndelay = mod->channels[channel].effects[ecol].cur_operand * mod->speed; + } + + return 0; +} + +static int effect_STee_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STef - Invert Loop */ +static int effect_STef_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + return 0; +} + +static int effect_STef_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STef_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STf0 - Set Speed */ +static int effect_STf0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] > 0) { + + if (note->operand[ecol] < 0x20) + mod->speed = note->operand[ecol]; + else + MODFILE_SetBPM(mod, note->operand[ecol]); + } + + return 0; +} + +static int effect_STf0_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STf0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_STg0 - Goto Line */ +static int effect_STg0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + mod->play_position = note->operand[ecol]; + mod->pattern_line = note->operand[ecol + 1]; + + return EFFECT_DONOTADVANCEPATTERN; +} + +static int effect_STg0_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_STg0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + + + + + +/***************************************************************************** + * Extended Module Effects * + *****************************************************************************/ + +/**** EFFECT_XM01 - Portamento Up */ +static int effect_XM01_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] == 0) + mod->channels[channel].effects[ecol].cur_operand = + mod->channels[channel].effects[ecol].porta_bak; + else + mod->channels[channel].effects[ecol].porta_bak = note->operand[ecol]; + + return 0; +} + +static int effect_XM01_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + u32 period = mod->channels[channel].st3_period; + period -= 4 * (u32)mod->channels[channel].effects[ecol].cur_operand; + MODFILE_SetPeriod(mod, channel, period); + } + + return 0; +} + +static int effect_XM01_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_XM02 - Portamento Down */ +static int effect_XM02_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] == 0) + mod->channels[channel].effects[ecol].cur_operand = + mod->channels[channel].effects[ecol].porta_bak; + else + mod->channels[channel].effects[ecol].porta_bak = note->operand[ecol]; + + return 0; +} + +static int effect_XM02_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + u32 period = mod->channels[channel].st3_period; + period += 4 * (u32)mod->channels[channel].effects[ecol].cur_operand; + MODFILE_SetPeriod(mod, channel, period); + } + + return 0; +} + +static int effect_XM02_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_XM10 - Global Volume */ +static int effect_XM10_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] > 64) + mod->cur_master_volume = 64; + else + mod->cur_master_volume = note->operand[ecol]; + + return 0; +} + +static int effect_XM10_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_XM10_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_XM11 - Global Volume Slide */ +static int effect_XM11_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] != 0) + mod->channels[channel].effects[ecol].gvolslide_bak = note->operand[ecol]; + + mod->channels[channel].effects[ecol].cur_operand = + mod->channels[channel].effects[ecol].gvolslide_bak; + + return 0; +} + +static int effect_XM11_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + u8 operand = mod->channels[channel].effects[ecol].cur_operand; + + if (operand & 0x0f) { + + if ((operand & 0x0f) > mod->cur_master_volume) + mod->cur_master_volume = 0; + else + mod->cur_master_volume -= operand & 0x0f; + } else { + + if ((operand >> 4) + mod->cur_master_volume > 64) + mod->cur_master_volume = 64; + else + mod->cur_master_volume += operand >> 4; + } + } + + return 0; +} + +static int effect_XM11_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_XM19 - Panning Slide */ +static int effect_XM19_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] != 0) + mod->channels[channel].effects[ecol].panslide_bak = note->operand[ecol]; + + mod->channels[channel].effects[ecol].cur_operand = + mod->channels[channel].effects[ecol].panslide_bak; + + return 0; +} + +static int effect_XM19_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + u8 operand = mod->channels[channel].effects[ecol].cur_operand; + + if (operand & 0xf0) { /* Right */ + + if (mod->channels[channel].voiceInfo.panning > 255 - (operand >> 4)) + mod->channels[channel].voiceInfo.panning = 255; + else + mod->channels[channel].voiceInfo.panning += operand >> 4; + } else + if (operand & 0x0f) { /* Left */ + + if (mod->channels[channel].voiceInfo.panning < (operand & 0x0f)) + mod->channels[channel].voiceInfo.panning = 0; + else + mod->channels[channel].voiceInfo.panning -= operand & 0x0f; + } + } + + return 0; +} + +static int effect_XM19_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_XMa0 - Volume Slide */ +static int effect_XMa0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] != 0) + mod->channels[channel].effects[ecol].volslide_bak = note->operand[ecol]; + + mod->channels[channel].effects[ecol].cur_operand = + mod->channels[channel].effects[ecol].volslide_bak; + + return 0; +} + +static int effect_XMa0_Process(MODFILE *mod, int channel, int ecol) { + + if (mod->speedcounter != 0) { + + doSTVolumeSlide(mod, channel, ecol); + } + + return 0; +} + +static int effect_XMa0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + + + + + +/***************************************************************************** + * Screamtracker 3 Effects * + *****************************************************************************/ + + +/**** EFFECT_S3Ma0 - Set Speed */ +static int effect_S3Ma0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] > 0) { + + mod->speed = note->operand[ecol]; + } + + return 0; +} + +static int effect_S3Ma0_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_S3Ma0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_S3Md0 - Volume Slide */ +static int effect_S3Md0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u8 operand; + + if (note->operand[ecol] != 0) + mod->channels[channel].effects[ecol].volslide_bak = note->operand[ecol]; + + mod->channels[channel].effects[ecol].cur_operand = operand = + mod->channels[channel].effects[ecol].volslide_bak; + + if ((operand & 0x0f) == 0x0f) { /* Fine up */ + + MODFILE_AddVolume(mod, channel, operand >> 4); + } else + if ((operand & 0xf0) == 0xf0) { /* Fine down */ + + MODFILE_SubVolume(mod, channel, operand & 0x0f); + } + + return 0; +} + +static int effect_S3Md0_Process(MODFILE *mod, int channel, int ecol) { + + u8 operand = mod->channels[channel].effects[ecol].cur_operand; + + if ((((operand & 0xf0) != 0xf0) && + ((operand & 0x0f) != 0x0f)) || (operand == 0xf0) || (operand == 0x0f)) { + + if (mod->channels[channel].effects[ecol].cur_operand & 0x0f) { /* Down */ + + MODFILE_SubVolume(mod, channel, mod->channels[channel].effects[ecol].cur_operand & 0x0f); + } else + if (mod->channels[channel].effects[ecol].cur_operand & 0xf0) { /* Up */ + + MODFILE_AddVolume(mod, channel, mod->channels[channel].effects[ecol].cur_operand >> 4); + } + } + + return 0; +} + +static int effect_S3Md0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_S3Me0 - Slide Down */ +static int effect_S3Me0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u8 operand; + + if (note->operand[ecol] != 0) + mod->channels[channel].effects[ecol].porta_bak = note->operand[ecol]; + + mod->channels[channel].effects[ecol].cur_operand = operand = + mod->channels[channel].effects[ecol].porta_bak; + + if ((operand & 0xf0) == 0xf0) { /* Fine Slide Down */ + + u32 period = mod->channels[channel].st3_period; + period += (operand & 0x0f) * 4; + MODFILE_SetPeriod(mod, channel, period); + } else + if ((operand & 0xf0) == 0xe0) { /* Extra Fine Slide Down */ + + u32 period = mod->channels[channel].st3_period; + period += operand & 0x0f; + MODFILE_SetPeriod(mod, channel, period); + } + + return 0; +} + +static int effect_S3Me0_Process(MODFILE *mod, int channel, int ecol) { + + u8 operand = mod->channels[channel].effects[ecol].cur_operand; + + if (((operand & 0xf0) != 0xf0) && + ((operand & 0xf0) != 0xe0)) { + + if (mod->speedcounter != 0) { + + u32 period = mod->channels[channel].st3_period; + period += 4 * (u32)mod->channels[channel].effects[ecol].cur_operand; + MODFILE_SetPeriod(mod, channel, period); + } + } + + return 0; +} + +static int effect_S3Me0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_S3Mfe - Slide Up */ +static int effect_S3Mf0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u8 operand; + + if (note->operand[ecol] != 0) + mod->channels[channel].effects[ecol].porta_bak = note->operand[ecol]; + + mod->channels[channel].effects[ecol].cur_operand = operand = + mod->channels[channel].effects[ecol].porta_bak; + + if ((operand & 0xf0) == 0xf0) { /* Fine Slide Up */ + + u32 period = mod->channels[channel].st3_period; + period -= (operand & 0x0f) * 4; + MODFILE_SetPeriod(mod, channel, period); + } else + if ((operand & 0xf0) == 0xe0) { /* Extra Fine Slide Up */ + + u32 period = mod->channels[channel].st3_period; + period -= operand & 0x0f; + MODFILE_SetPeriod(mod, channel, period); + } + + return 0; +} + +static int effect_S3Mf0_Process(MODFILE *mod, int channel, int ecol) { + + u8 operand = mod->channels[channel].effects[ecol].cur_operand; + + if (((operand & 0xf0) != 0xf0) && + ((operand & 0xf0) != 0xe0)) { + + if (mod->speedcounter != 0) { + + u32 period = mod->channels[channel].st3_period; + period -= 4 * (u32)mod->channels[channel].effects[ecol].cur_operand; + MODFILE_SetPeriod(mod, channel, period); + } + } + + return 0; +} + +static int effect_S3Mf0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_S3Mk0 - Vibrato + Volume Slide */ +static int effect_S3Mk0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + +/* effect_ST40_Start(mod, channel, ecol, note);*/ + effect_S3Md0_Start(mod, channel, ecol, note); + return 0; +} + +static int effect_S3Mk0_Process(MODFILE *mod, int channel, int ecol) { + + effect_ST40_Process(mod, channel, ecol); + effect_S3Md0_Process(mod, channel, ecol); + return 0; +} + +static int effect_S3Mk0_Stop(MODFILE *mod, int channel, int ecol) { + + effect_ST40_Stop(mod, channel, ecol); + effect_S3Md0_Stop(mod, channel, ecol); + return 0; +} + + + + +/**** EFFECT_S3Ml0 - Tone Portamento + Volume Slide */ +static int effect_S3Ml0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + +/* effect_ST30_Start(mod, channel, ecol, note);*/ + effect_S3Md0_Start(mod, channel, ecol, note); + return 0; +} + +static int effect_S3Ml0_Process(MODFILE *mod, int channel, int ecol) { + + effect_ST30_Process(mod, channel, ecol); + effect_S3Md0_Process(mod, channel, ecol); + return 0; +} + +static int effect_S3Ml0_Stop(MODFILE *mod, int channel, int ecol) { + + effect_ST30_Stop(mod, channel, ecol); + effect_S3Md0_Stop(mod, channel, ecol); + return 0; +} + + + + +/**** EFFECT_S3Mq0 - Retrig + Volume Slide */ +static int effect_S3Mq0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u8 operand = mod->channels[channel].effects[ecol].cur_operand; + + if (operand != 0) + mod->channels[channel].effects[ecol].retrig_bak = operand; + else + operand = mod->channels[channel].effects[ecol].retrig_bak; + + mod->channels[channel].effects[ecol].cur_operand = operand; + mod->channels[channel].effects[ecol].retrig_count = 0; + + return 0; +} + +static int effect_S3Mq0_Process(MODFILE *mod, int channel, int ecol) { + + mod->channels[channel].effects[ecol].retrig_count++; + if (mod->speedcounter != 0) { + + if (mod->channels[channel].effects[ecol].retrig_count >= + (mod->channels[channel].effects[ecol].cur_operand & 0x0f)) { + + if (mod->channels[channel].effects[ecol].retrig_count >= + (mod->channels[channel].effects[ecol].cur_operand & 0x0f)) + mod->channels[channel].effects[ecol].retrig_count = 0; + + /* Volume slide */ + if (mod->channels[channel].effects[ecol].cur_operand & 0xf0) { + + switch ((mod->channels[channel].effects[ecol].cur_operand >> 4) & 0x0f) { + + case 0: + case 8: + break; + case 1: + MODFILE_SubVolume(mod, channel, 1); + break; + case 2: + MODFILE_SubVolume(mod, channel, 2); + break; + case 3: + MODFILE_SubVolume(mod, channel, 4); + break; + case 4: + MODFILE_SubVolume(mod, channel, 8); + break; + case 5: + MODFILE_SubVolume(mod, channel, 16); + break; + case 6: { + u8 tmpvol = mod->channels[channel].voiceInfo.volume; + tmpvol = (tmpvol * 2) / 3; + mod->channels[channel].voiceInfo.volume = tmpvol; + break; + } + case 7: + mod->channels[channel].voiceInfo.volume >>= 1; + break; + case 9: + MODFILE_AddVolume(mod, channel, 1); + break; + case 10: + MODFILE_AddVolume(mod, channel, 2); + break; + case 11: + MODFILE_AddVolume(mod, channel, 4); + break; + case 12: + MODFILE_AddVolume(mod, channel, 8); + break; + case 13: + MODFILE_AddVolume(mod, channel, 16); + break; + case 14: { + u8 tmpvol = mod->channels[channel].voiceInfo.volume; + tmpvol = (tmpvol * 3) / 2; + if (tmpvol > 64) tmpvol = 64; + mod->channels[channel].voiceInfo.volume = tmpvol; + break; + } + case 15: + mod->channels[channel].voiceInfo.volume *= 2; + if (mod->channels[channel].voiceInfo.volume > 64) + mod->channels[channel].voiceInfo.volume = 64; + break; + } + } + /* Retrigger */ + mod->channels[channel].voiceInfo.playpos = 0; + mod->channels[channel].voiceInfo.playing = TRUE; + mod->channels[channel].voiceInfo.forward = TRUE; +/* MODFILE_TriggerNote(mod, channel, + mod->channels[channel].last_note, + mod->channels[channel].last_instrument, + 0xff, 0);*/ + + } + } + + return 0; +} + +static int effect_S3Mq0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + +/**** EFFECT_S3Mr0 - Tremolo */ +static int effect_S3Mr0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + u8 operand; + + if (note->operand[ecol] == 0) + mod->channels[channel].effects[ecol].cur_operand = + mod->channels[channel].effects[ecol].tremolo_bak; + else + mod->channels[channel].effects[ecol].tremolo_bak = note->operand[ecol]; + + operand = mod->channels[channel].effects[ecol].cur_operand; + + mod->channels[channel].effects[ecol].tremolo_base = mod->channels[channel].voiceInfo.volume; + + if (operand & 0x0f) + mod->channels[channel].effects[ecol].tremolo_depth = operand & 0x0f; + if (operand & 0xf0) + mod->channels[channel].effects[ecol].tremolo_freq = (operand >> 4) & 0x0f; + + return 0; +} + +static int effect_S3Mr0_Process(MODFILE *mod, int channel, int ecol) { + + u16 v; + s16 delta = wavetab[mod->channels[channel].effects[ecol].tremolo_wave & 3][mod->channels[channel].effects[ecol].tremolo_sintabpos]; + delta *= mod->channels[channel].effects[ecol].tremolo_depth; + delta >>= 7; + + v = mod->channels[channel].effects[ecol].tremolo_base + delta; + + if (v > 64) + v = 64; + if (v & 0xff80) + v = 0; + + mod->channels[channel].voiceInfo.volume = v; + + mod->channels[channel].effects[ecol].tremolo_sintabpos += mod->channels[channel].effects[ecol].tremolo_freq; + mod->channels[channel].effects[ecol].tremolo_sintabpos &= 63; + + return 0; +} + +static int effect_S3Mr0_Stop(MODFILE *mod, int channel, int ecol) { + + mod->channels[channel].voiceInfo.volume = mod->channels[channel].effects[ecol].tremolo_base; + return 0; +} + + + + +/**** EFFECT_S3Mt0 - Set Tempo */ +static int effect_S3Mt0_Start(MODFILE *mod, int channel, int ecol, MOD_Note *note) { + + if (note->operand[ecol] > 0) { + + MODFILE_SetBPM(mod, note->operand[ecol]); + } + + return 0; +} + +static int effect_S3Mt0_Process(MODFILE *mod, int channel, int ecol) { + + return 0; +} + +static int effect_S3Mt0_Stop(MODFILE *mod, int channel, int ecol) { + + return 0; +} + + + + + + + + + + + + + + + +const MODPLAY_EffectHandler MODPLAY_EffectHandlers[] = { + + /* Soundtracker */ + { effect_None_Start, effect_None_Process, effect_None_Stop }, /* EFFECT_NONE */ + { effect_ST00_Start, effect_ST00_Process, effect_ST00_Stop }, /* EFFECT_ST00 */ + { effect_ST10_Start, effect_ST10_Process, effect_ST10_Stop }, /* EFFECT_ST10 */ + { effect_ST20_Start, effect_ST20_Process, effect_ST20_Stop }, /* EFFECT_ST20 */ + { effect_ST30_Start, effect_ST30_Process, effect_ST30_Stop }, /* EFFECT_ST30 */ + { effect_ST40_Start, effect_ST40_Process, effect_ST40_Stop }, /* EFFECT_ST40 */ + { effect_ST50_Start, effect_ST50_Process, effect_ST50_Stop }, /* EFFECT_ST50 */ + { effect_ST60_Start, effect_ST60_Process, effect_ST60_Stop }, /* EFFECT_ST60 */ + { effect_ST70_Start, effect_ST70_Process, effect_ST70_Stop }, /* EFFECT_ST70 */ + { effect_ST80_Start, effect_ST80_Process, effect_ST80_Stop }, /* EFFECT_ST80 */ + { effect_ST90_Start, effect_ST90_Process, effect_ST90_Stop }, /* EFFECT_ST90 */ + { effect_STa0_Start, effect_STa0_Process, effect_STa0_Stop }, /* EFFECT_STa0 */ + { effect_STb0_Start, effect_STb0_Process, effect_STb0_Stop }, /* EFFECT_STb0 */ + { effect_STc0_Start, effect_STc0_Process, effect_STc0_Stop }, /* EFFECT_STc0 */ + { effect_STd0_Start, effect_STd0_Process, effect_STd0_Stop }, /* EFFECT_STd0 */ + { effect_STe1_Start, effect_STe1_Process, effect_STe1_Stop }, /* EFFECT_STe1 */ + { effect_STe2_Start, effect_STe2_Process, effect_STe2_Stop }, /* EFFECT_STe2 */ + { effect_STe4_Start, effect_STe4_Process, effect_STe4_Stop }, /* EFFECT_STe4 */ + { effect_STe5_Start, effect_STe5_Process, effect_STe5_Stop }, /* EFFECT_STe5 */ + { effect_STe6_Start, effect_STe6_Process, effect_STe6_Stop }, /* EFFECT_STe6 */ + { effect_STe7_Start, effect_STe7_Process, effect_STe7_Stop }, /* EFFECT_STe7 */ + { effect_STe8_Start, effect_STe8_Process, effect_STe8_Stop }, /* EFFECT_STe8 */ + { effect_STe9_Start, effect_STe9_Process, effect_STe9_Stop }, /* EFFECT_STe9 */ + { effect_STea_Start, effect_STea_Process, effect_STea_Stop }, /* EFFECT_STea */ + { effect_STeb_Start, effect_STeb_Process, effect_STeb_Stop }, /* EFFECT_STeb */ + { effect_STec_Start, effect_STec_Process, effect_STec_Stop }, /* EFFECT_STec */ + { effect_STed_Start, effect_STed_Process, effect_STed_Stop }, /* EFFECT_STed */ + { effect_STee_Start, effect_STee_Process, effect_STee_Stop }, /* EFFECT_STee */ + { effect_STef_Start, effect_STef_Process, effect_STef_Stop }, /* EFFECT_STef */ + { effect_STf0_Start, effect_STf0_Process, effect_STf0_Stop }, /* EFFECT_STf0 */ + { effect_STg0_Start, effect_STg0_Process, effect_STg0_Stop }, /* EFFECT_STg0 */ + + /* Extended Module */ + { effect_XM01_Start, effect_XM01_Process, effect_XM01_Stop }, /* EFFECT_XM01 */ + { effect_XM02_Start, effect_XM02_Process, effect_XM02_Stop }, /* EFFECT_XM02 */ + { effect_XM10_Start, effect_XM10_Process, effect_XM10_Stop }, /* EFFECT_XM10 */ + { effect_XM11_Start, effect_XM11_Process, effect_XM11_Stop }, /* EFFECT_XM11 */ + { effect_XM19_Start, effect_XM19_Process, effect_XM19_Stop }, /* EFFECT_XM19 */ + { effect_XMa0_Start, effect_XMa0_Process, effect_XMa0_Stop }, /* EFFECT_XMa0 */ + + /* S3M */ + { effect_S3Ma0_Start, effect_S3Ma0_Process, effect_S3Ma0_Stop }, /* EFFECT_S3Ma0 */ + { effect_S3Md0_Start, effect_S3Md0_Process, effect_S3Md0_Stop }, /* EFFECT_S3Md0 */ + { effect_S3Me0_Start, effect_S3Me0_Process, effect_S3Me0_Stop }, /* EFFECT_S3Me0 */ + { effect_S3Mf0_Start, effect_S3Mf0_Process, effect_S3Mf0_Stop }, /* EFFECT_S3Mfe */ + { effect_S3Mk0_Start, effect_S3Mk0_Process, effect_S3Mk0_Stop }, /* EFFECT_S3Mk0 */ + { effect_S3Ml0_Start, effect_S3Ml0_Process, effect_S3Ml0_Stop }, /* EFFECT_S3Ml0 */ + { effect_S3Mq0_Start, effect_S3Mq0_Process, effect_S3Mq0_Stop }, /* EFFECT_S3Mq0 */ + { effect_S3Mr0_Start, effect_S3Mr0_Process, effect_S3Mr0_Stop }, /* EFFECT_S3Mr0 */ + { effect_S3Mt0_Start, effect_S3Mt0_Process, effect_S3Mt0_Stop }, /* EFFECT_S3Mt0 */ + + { NULL, NULL, NULL } +}; diff --git a/portlibs/sources/libmodplay/source/effects.h b/portlibs/sources/libmodplay/source/effects.h new file mode 100644 index 00000000..927d3f98 --- /dev/null +++ b/portlibs/sources/libmodplay/source/effects.h @@ -0,0 +1,88 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __EFFECTS_H__ +#define __EFFECTS_H__ + +#include "modplay_core.h" + +enum Effect { + + EFFECT_NONE = 0, + + /* Soundtracker */ + EFFECT_ST00, /* Arpegggio */ + EFFECT_ST10, /* Portamento Up */ + EFFECT_ST20, /* Portamento Down */ + EFFECT_ST30, /* Tone Portamento */ + EFFECT_ST40, /* Vibrato */ + EFFECT_ST50, /* Tone Portamento + Volume Slide */ + EFFECT_ST60, /* Vibrato + Volume Slide */ + EFFECT_ST70, /* Tremolo */ + EFFECT_ST80, /* Panning */ + EFFECT_ST90, /* Sample Offset */ + EFFECT_STa0, /* Volume Slide */ + EFFECT_STb0, /* Position Jump */ + EFFECT_STc0, /* Set Volume */ + EFFECT_STd0, /* Pattern Break */ + EFFECT_STe1, /* Fineslide Up */ + EFFECT_STe2, /* Fineslide Down */ + EFFECT_STe4, /* Vibrato Control */ + EFFECT_STe5, /* Set Finetune */ + EFFECT_STe6, /* Pattern Loop */ + EFFECT_STe7, /* Tremolo Control */ + EFFECT_STe8, /* Panning */ + EFFECT_STe9, /* Retrig Note */ + EFFECT_STea, /* Fine Volume Up */ + EFFECT_STeb, /* Fine Volume Down */ + EFFECT_STec, /* Note Cut */ + EFFECT_STed, /* Note Delay */ + EFFECT_STee, /* Pattern Delay */ + EFFECT_STef, /* Invert Loop */ + EFFECT_STf0, /* Set Speed */ + EFFECT_STg0, /* Goto line */ + + /* Extended Module */ + EFFECT_XM01, /* Portamento Up */ + EFFECT_XM02, /* Portamento Down */ + EFFECT_XM10, /* Global Volume */ + EFFECT_XM11, /* Global Volume Slide */ + EFFECT_XM19, /* Panning Slide */ + EFFECT_XMa0, /* Volume Fade */ + + /* S3M */ + EFFECT_S3Ma0, /* Set Speed */ + EFFECT_S3Md0, /* Volume Slide */ + EFFECT_S3Me0, /* Slide Down */ + EFFECT_S3Mf0, /* Slide Up */ + EFFECT_S3Mk0, /* Vibrato + Volume Slide */ + EFFECT_S3Ml0, /* Tone Portamento + Volume Slide */ + EFFECT_S3Mq0, /* Retrig + Volume Slide */ + EFFECT_S3Mr0, /* Tremolo */ + EFFECT_S3Mt0, /* Set Tempo */ + + /* Insert new effects before this one */ + EFFECT_NUMEFFECTS +}; + + +#define EFFECT_DONOTTRIGGERNOTE 1 +#define EFFECT_DONOTADVANCEPATTERN 2 +#define EFFECT_DONOTRESETSAMPLEPOS 4 +#define EFFECT_DONOTCHANGEPERIOD 8 +#define EFFECT_DONOTCHANGEPANNING 16 +#define EFFECT_DONOTCHANGEVOLUME 32 + + +typedef struct MODPLAY_EffectHandler { + + int (*start)(MODFILE *mod, int channel, int ecol, MOD_Note *note); + int (*process)(MODFILE *mod, int channel, int ecol); + int (*stop)(MODFILE *mod, int channel, int ecol); +} MODPLAY_EffectHandler; + +extern const MODPLAY_EffectHandler MODPLAY_EffectHandlers[]; + +#endif diff --git a/portlibs/sources/libmodplay/source/envelope.c b/portlibs/sources/libmodplay/source/envelope.c new file mode 100644 index 00000000..190727f5 --- /dev/null +++ b/portlibs/sources/libmodplay/source/envelope.c @@ -0,0 +1,125 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#include "envelope.h" + +void EnvReset(Envelope *env) { + + if (env == NULL) + return; + + if (env->envConfig == NULL) + return; + + if (!env->envConfig->enabled) + return; + + env->hold = FALSE; + env->triggered = FALSE; + env->position = 0; + env->value = 0; + env->curPoint = 0; + + if (env->envConfig->numPoints > 0) { + + env->value = env->envConfig->envPoints[0].y; + } +} + + + +void EnvTrigger(Envelope *env) { + + if (env == NULL) + return; + + if (env->envConfig == NULL) + return; + + if (!env->envConfig->enabled) + return; + + EnvReset(env); + env->triggered = TRUE; + env->hold = TRUE; +} + + + +BOOL EnvProcess(Envelope *env) { + + if (env == NULL) + return FALSE; + + if (env->envConfig == NULL) + return FALSE; + + if (!env->envConfig->enabled) + return FALSE; + + if (env->envConfig->numPoints <= 1) + return FALSE; + + if (!env->triggered) + return FALSE; + + /* Only process if we're not at the sustain point */ + if (!(env->hold && (env->curPoint == env->envConfig->sustain))) { + + /* ... and only when we're not beyond the last env point */ + if (env->position < env->envConfig->envPoints[env->envConfig->numPoints-1].x) { + + s32 x1, y1, x2, y2, dx, dy; + s32 relativePos; + + x1 = env->envConfig->envPoints[env->curPoint].x; + y1 = env->envConfig->envPoints[env->curPoint].y; + x2 = env->envConfig->envPoints[env->curPoint + 1].x; + y2 = env->envConfig->envPoints[env->curPoint + 1].y; + + dx = x2 - x1; + dy = y2 - y1; + + env->position++; + relativePos = env->position - x1; + env->value = ((dy * relativePos) / dx) + y1; + + if (env->position >= env->envConfig->envPoints[env->curPoint + 1].x) { + + env->curPoint++; + /* Handle env loops */ + if ((env->envConfig->loop_end >= env->envConfig->loop_start) && + ((env->envConfig->loop_end < env->envConfig->numPoints) && + (env->envConfig->loop_start < env->envConfig->numPoints))) { + + if (env->curPoint == env->envConfig->loop_end) { + + env->curPoint = env->envConfig->loop_start; + env->position = env->envConfig->envPoints[env->curPoint].x; + env->value = env->envConfig->envPoints[env->curPoint].y; + } + } + } + } + } + + return TRUE; +} + + + +void EnvRelease(Envelope *env) { + + if (env == NULL) + return; + + if (env->envConfig == NULL) + return; + + if (!env->envConfig->enabled) + return; + + env->hold = FALSE; +} diff --git a/portlibs/sources/libmodplay/source/envelope.h b/portlibs/sources/libmodplay/source/envelope.h new file mode 100644 index 00000000..086d9405 --- /dev/null +++ b/portlibs/sources/libmodplay/source/envelope.h @@ -0,0 +1,57 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __ENVELOPE_H__ +#define __ENVELOPE_H__ + +#ifdef __cplusplus +extern "C" { +#endif + + +#include "defines.h" + +#define ENV_WIDTH 65536 +#define ENV_HEIGHT 65536 + +typedef struct EnvPoint { + + u16 x,y; +} EnvPoint; + +typedef struct EnvelopeConfig { + + BOOL enabled; + u8 numPoints; /* # of envelope points */ + u8 loop_start; + u8 loop_end; + u8 sustain; + + EnvPoint *envPoints; +} EnvelopeConfig; + +typedef struct Envelope { + + EnvelopeConfig *envConfig; + + BOOL triggered; + BOOL hold; + u8 curPoint; + u16 value; + u16 position; +} Envelope; + + +void EnvReset(Envelope *env); +void EnvTrigger(Envelope *env); +BOOL EnvProcess(Envelope *env); +void EnvRelease(Envelope *env); + + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/sources/libmodplay/source/mixer.c b/portlibs/sources/libmodplay/source/mixer.c new file mode 100644 index 00000000..563b1f02 --- /dev/null +++ b/portlibs/sources/libmodplay/source/mixer.c @@ -0,0 +1,546 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#include "mixer.h" + +#define DO_LOOPING \ + if (forward) \ + { \ + playpos += incval; \ + if (playpos >= loop_end) \ + { \ + if (looped) \ + { \ + if (pingpong) \ + { \ + forward = !forward; \ + playpos -= incval; \ + } else \ + playpos -= loop_end - loop_start; \ + } else \ + { \ + playpos = loop_end; \ + vinfo->playing = FALSE; \ + break; \ + } \ + } \ + } else \ + { \ + playpos -= incval; \ + if (/*playpos <= loop_start*/playpos - loop_start <= incval) \ + { \ + if (looped) \ + { \ + if (pingpong) \ + { \ + forward = !forward; \ + playpos += incval; \ + } else \ + playpos += loop_end - loop_start; \ + } else \ + { \ + playpos = loop_start; \ + vinfo->playing = FALSE; \ + break; \ + } \ + } \ + } + +#define DO_LOOPING_OLD \ + playpos += incval; \ + if (playpos >= loop_end) \ + { \ + if (looped) \ + { \ + playpos -= loop_end-loop_start; \ + } else \ + { \ + playpos = loop_end; \ + vinfo->playing = FALSE; \ + break; \ + } \ + } + +#define DO_LOOPING_PINGPONG \ + playpos += incval; \ + if (forward && playpos >= loop_end) \ + { \ + if (looped) \ + { \ + incval = -incval; \ + forward = FALSE; \ + } else \ + { \ + playpos = loop_end; \ + vinfo->playing = FALSE; \ + break; \ + } \ + } else \ + if (!forward && playpos <= loop_start) \ + { \ + if (looped) \ + { \ + incval = -incval; \ + forward = TRUE; \ + } else \ + { \ + playpos = loop_start; \ + vinfo->playing = FALSE; \ + break; \ + } \ + } + +int mix_destbufsize(int flags) { + + int size = 1; + + if (flags & MIXER_DEST_STEREO) + size *= 2; + if (flags & MIXER_DEST_16BIT) + size *= 2; + + return size; +} + +int clearbuf_final(int flags, void *dest, int nSamples) { + + if (flags & MIXER_USE_S32) { + + if (flags & MIXER_DEST_STEREO) { + + clearbuf_s32((s32*)dest, 2, nSamples); + } else { + + clearbuf_s32((s32*)dest, 1, nSamples); + } + } + + return nSamples; +} + +int mix_final_1616bit(int flags, void *dest, int nSamples, MOD_VOICEINFO16 *vinfo, u8 mainvol) { + + if (flags & MIXER_USE_S32) { + + if (flags & MIXER_DEST_STEREO) { + + if (vinfo->sampleInfo->bit_16) { + + mix_s16m_to_s32s_1616bit((s32*)dest, nSamples, vinfo, mainvol); + } else { + + mix_s8m_to_s32s_1616bit((s32*)dest, nSamples, vinfo, mainvol); + } + } else { + + if (vinfo->sampleInfo->bit_16) { + + mix_s16m_to_s32m_1616bit((s32*)dest, nSamples, vinfo, mainvol); + } else { + + mix_s8m_to_s32m_1616bit((s32*)dest, nSamples, vinfo, mainvol); + } + } + } + + return nSamples; +} + +int copybuf_final(int flags, void *dest, void *src, int nSamples) { + + if (flags & MIXER_USE_S32) { + + if (flags & MIXER_DEST_SIGNED) { + + if (flags & MIXER_DEST_16BIT) { + + if (flags & MIXER_DEST_STEREO) { + + copybuf_s32_to_s16((s16*)dest, (s32*)src, 2, nSamples); + } else { + + copybuf_s32_to_s16((s16*)dest, (s32*)src, 1, nSamples); + } + } else { + + if (flags & MIXER_DEST_STEREO) { + + copybuf_s32_to_s8((s8*)dest, (s32*)src, 2, nSamples); + } else { + + copybuf_s32_to_s8((s8*)dest, (s32*)src, 1, nSamples); + } + } + } else { + + if (flags & MIXER_DEST_16BIT) { + + if (flags & MIXER_DEST_STEREO) { + + copybuf_s32_to_u16((u16*)dest, (s32*)src, 2, nSamples); + } else { + + copybuf_s32_to_u16((u16*)dest, (s32*)src, 1, nSamples); + } + } else { + + if (flags & MIXER_DEST_STEREO) { + + copybuf_s32_to_u8((u8*)dest, (s32*)src, 2, nSamples); + } else { + + copybuf_s32_to_u8((u8*)dest, (s32*)src, 1, nSamples); + } + } + } + } + + return nSamples; +} + +/* Mix s8 mono -> s32 mono, 16.16bit fixed point */ +int mix_s8m_to_s32m_1616bit(s32 *dest, int nSamples, MOD_VOICEINFO16 *vinfo, u8 mainvol) { + + int k; + s32 volume; + MIXER_TYPE playpos = vinfo->playpos; + MIXER_TYPE incval = vinfo->incval; + MIXER_TYPE loop_end = ((MIXER_TYPE)vinfo->sampleInfo->loop_end) << MIXER_SHIFT; + MIXER_TYPE loop_start = ((MIXER_TYPE)vinfo->sampleInfo->loop_start) << MIXER_SHIFT; + BOOL looped = vinfo->sampleInfo->looped; + BOOL forward = vinfo->forward; + BOOL pingpong = vinfo->sampleInfo->pingpong; + s8 *sampledata = vinfo->sampleInfo->sampledata; + + if (!vinfo->playing) + return nSamples; + + volume = ((s32)vinfo->volume * (s32)mainvol * (s32)vinfo->envVolume) >> 12; + + for (k = 0; k < nSamples; k++) { + + s32 value = ((s32)(s16)((s8*)sampledata)[playpos >> MIXER_SHIFT]) << 8; + dest[k] += value * volume; + DO_LOOPING; + } + + vinfo->playpos = playpos; + vinfo->forward = forward; + + return nSamples; +} + +/* Mix s16 mono -> s32 mono, 16.16bit fixed point */ +int mix_s16m_to_s32m_1616bit(s32 *dest, int nSamples, MOD_VOICEINFO16 *vinfo, u8 mainvol) { + + int k; + s32 volume; + MIXER_TYPE playpos = vinfo->playpos; + MIXER_TYPE incval = vinfo->incval; + MIXER_TYPE loop_end = ((MIXER_TYPE)vinfo->sampleInfo->loop_end) << MIXER_SHIFT; + MIXER_TYPE loop_start = ((MIXER_TYPE)vinfo->sampleInfo->loop_start) << MIXER_SHIFT; + BOOL looped = vinfo->sampleInfo->looped; + BOOL forward = vinfo->forward; + BOOL pingpong = vinfo->sampleInfo->pingpong; + s16 *sampledata = vinfo->sampleInfo->sampledata; + + if (!vinfo->playing) + return nSamples; + + volume = ((s32)vinfo->volume * (s32)mainvol * (s32)vinfo->envVolume) >> 12; + + for (k = 0; k <nSamples; k++) { + + s32 value = (s32)((s16*)sampledata)[playpos >> MIXER_SHIFT]; + dest[k] += value * volume; + DO_LOOPING; + } + + vinfo->playpos = playpos; + vinfo->forward = forward; + + return nSamples; +} + +/* Mix s8 mono -> s32 stereo, 16.16bit fixed point */ +int mix_s8m_to_s32s_1616bit(s32 *dest, int nSamples, MOD_VOICEINFO16 *vinfo, u8 mainvol) { + + int k; + s32 volume; + u8 lvolume, rvolume; + MIXER_TYPE playpos = vinfo->playpos; + MIXER_TYPE incval = vinfo->incval; + MIXER_TYPE loop_end = ((MIXER_TYPE)vinfo->sampleInfo->loop_end) << MIXER_SHIFT; + MIXER_TYPE loop_start = ((MIXER_TYPE)vinfo->sampleInfo->loop_start) << MIXER_SHIFT; + BOOL looped = vinfo->sampleInfo->looped; + BOOL forward = vinfo->forward; + BOOL pingpong = vinfo->sampleInfo->pingpong; + s8 * sampledata = vinfo->sampleInfo->sampledata; + s32 panning; + + int mxamount = nSamples >> 3; + int mxrest = nSamples & ((1 << 3) - 1); + + if (!vinfo->playing) + return nSamples; + + volume = ((s32)vinfo->volume * (s32)mainvol * (s32)vinfo->envVolume) >> 12; + + panning = ((s32)(vinfo->panning >> 2) - 32) + ((s32)vinfo->envPanning - 32); + if (panning > 32) + panning = 32; + if (panning < -32) + panning = -32; + panning += 32; + + lvolume = (((u32)64 - panning) * volume) >> 6; + rvolume = (((u32)panning) * volume) >> 6; + + for (k = 0; k < mxamount; k++) { + + s32 value; + + value = ((s32)(s16)((s8*)sampledata)[playpos >> MIXER_SHIFT]) << 8; + (*(dest++)) += value * lvolume; + (*(dest++)) += value * rvolume; + DO_LOOPING; + + value = ((s32)(s16)((s8*)sampledata)[playpos >> MIXER_SHIFT]) << 8; + (*(dest++)) += value * lvolume; + (*(dest++)) += value * rvolume; + DO_LOOPING; + + value = ((s32)(s16)((s8*)sampledata)[playpos >> MIXER_SHIFT]) << 8; + (*(dest++)) += value * lvolume; + (*(dest++)) += value * rvolume; + DO_LOOPING; + + value = ((s32)(s16)((s8*)sampledata)[playpos >> MIXER_SHIFT]) << 8; + (*(dest++)) += value * lvolume; + (*(dest++)) += value * rvolume; + DO_LOOPING; + + value = ((s32)(s16)((s8*)sampledata)[playpos >> MIXER_SHIFT]) << 8; + (*(dest++)) += value * lvolume; + (*(dest++)) += value * rvolume; + DO_LOOPING; + + value = ((s32)(s16)((s8*)sampledata)[playpos >> MIXER_SHIFT]) << 8; + (*(dest++)) += value * lvolume; + (*(dest++)) += value * rvolume; + DO_LOOPING; + + value = ((s32)(s16)((s8*)sampledata)[playpos >> MIXER_SHIFT]) << 8; + (*(dest++)) += value * lvolume; + (*(dest++)) += value * rvolume; + DO_LOOPING; + + value = ((s32)(s16)((s8*)sampledata)[playpos >> MIXER_SHIFT]) << 8; + (*(dest++)) += value * lvolume; + (*(dest++)) += value * rvolume; + DO_LOOPING; + } + + for (k = 0; k < mxrest; k++) { + + s32 value; + + value = ((s32)(s16)((s8*)sampledata)[playpos >> MIXER_SHIFT]) << 8; + (*(dest++)) += value * lvolume; + (*(dest++)) += value * rvolume; + DO_LOOPING; + } + + vinfo->playpos = playpos; + vinfo->forward = forward; + + return nSamples; +} + +/* Mix s16 mono -> s32 stereo, 16.16bit fixed point */ +int mix_s16m_to_s32s_1616bit(s32 *dest, int nSamples, MOD_VOICEINFO16 *vinfo, u8 mainvol) { + + int k; + s32 volume; + u8 lvolume, rvolume; + MIXER_TYPE playpos = vinfo->playpos; + MIXER_TYPE incval = vinfo->incval; + MIXER_TYPE loop_end = ((MIXER_TYPE)vinfo->sampleInfo->loop_end) << MIXER_SHIFT; + MIXER_TYPE loop_start = ((MIXER_TYPE)vinfo->sampleInfo->loop_start) << MIXER_SHIFT; + BOOL looped = vinfo->sampleInfo->looped; + BOOL forward = vinfo->forward; + BOOL pingpong = vinfo->sampleInfo->pingpong; + s16 * sampledata = vinfo->sampleInfo->sampledata; + + if (!vinfo->playing) + return nSamples; + + volume = ((s32)vinfo->volume * (s32)mainvol * (s32)vinfo->envVolume) >> 12; + + lvolume = (((u32)64-(vinfo->panning >> 2))*volume) >> 6; + rvolume = (((u32)(vinfo->panning >> 2))*volume) >> 6; + + for (k = 0; k < nSamples * 2; k += 2) { + + s32 value = (s32)((s16*)sampledata)[playpos >> MIXER_SHIFT]; + dest[k] += value * lvolume; + dest[k + 1] += value * rvolume; + DO_LOOPING; + } + + vinfo->playpos = playpos; + vinfo->forward = forward; + + return nSamples; +} + +void clearbuf_s32(s32 *dest, int channels, int nSamples) { + + int k; + int mxamount; + int mxrest; + + mxamount = (nSamples * channels) >> 3; + mxrest = (nSamples * channels) & ((1 << 3) - 1); + + for (k = 0; k < mxamount; k++) { + + (*(dest++)) = 0; + (*(dest++)) = 0; + (*(dest++)) = 0; + (*(dest++)) = 0; + (*(dest++)) = 0; + (*(dest++)) = 0; + (*(dest++)) = 0; + (*(dest++)) = 0; + } + + for (k = 0; k < mxrest; k++) { + + (*(dest++)) = 0; + } + +/* for (k = 0; k < nSamples * channels; k++) + dest[k] = 0;*/ +} + +void copybuf_s32_to_s16(s16 *dest, s32 *src, int channels, int nSamples) { + + int k; + + for (k = 0; k < nSamples*channels; k++) { + + s32 value = src[k] >> 8; + + if (value < -32768) + value = -32768; + else if (value > 32767) + value = 32767; + + dest[k] = (s16)value; + } +} + +#define CLIP_S32(a) \ + if (a < -32768) a = 32768; else if (a > 32767) a = 32767; + +void copybuf_s32_to_u16(u16 *dest, s32 *src, int channels, int nSamples) { + + int k; + int mxamount; + int mxrest; + + mxamount = (nSamples * channels) >> 3; + mxrest = (nSamples * channels) & ((1 << 3) - 1); + + for (k = 0; k < mxamount; k++) { + + s32 value; + + value = (*(src++)) >> 7; + CLIP_S32(value); + (*(dest++)) = ((u16)(s16)value) ^ 0x8000; + + value = (*(src++)) >> 7; + CLIP_S32(value); + (*(dest++)) = ((u16)(s16)value) ^ 0x8000; + + value = (*(src++)) >> 7; + CLIP_S32(value); + (*(dest++)) = ((u16)(s16)value) ^ 0x8000; + + value = (*(src++)) >> 7; + CLIP_S32(value); + (*(dest++)) = ((u16)(s16)value) ^ 0x8000; + + value = (*(src++)) >> 7; + CLIP_S32(value); + (*(dest++)) = ((u16)(s16)value) ^ 0x8000; + + value = (*(src++)) >> 7; + CLIP_S32(value); + (*(dest++)) = ((u16)(s16)value) ^ 0x8000; + + value = (*(src++)) >> 7; + CLIP_S32(value); + (*(dest++)) = ((u16)(s16)value) ^ 0x8000; + + value = (*(src++)) >> 7; + CLIP_S32(value); + (*(dest++)) = ((u16)(s16)value) ^ 0x8000; + } + + for (k = 0; k < mxrest; k++) { + + s32 value; + + value = (*(src++)) >> 7; + CLIP_S32(value); + (*(dest++)) = ((u16)(s16)value) ^ 0x8000; + } + +/* for (k=0; k<nSamples*channels; k++) + { + s32 value = src[k]>>7; + if (value<-32768) + value = -32768; + else + if (value>32767) + value = 32767; + dest[k] = ((u16)(s16)value)^0x8000; + }*/ +} + +void copybuf_s32_to_s8(s8 *dest, s32 *src, int channels, int nSamples) { + + int k; + + for (k = 0; k < nSamples * channels; k++) { + + s32 value = src[k] >> 16; + + if (value < -128) + value = -128; + else if (value > 127) + value = 127; + dest[k] = (s8)value; + } +} + +void copybuf_s32_to_u8(u8 *dest, s32 *src, int channels, int nSamples) { + + int k; + + for (k = 0; k < nSamples * channels; k++) { + + s32 value = src[k] >> 16; + + if (value < -128) + value = -128; + else if (value > 127) + value = 127; + dest[k] = ((u8)(s8)value) ^ 0x80; + } +} diff --git a/portlibs/sources/libmodplay/source/mixer.h b/portlibs/sources/libmodplay/source/mixer.h new file mode 100644 index 00000000..d646abd1 --- /dev/null +++ b/portlibs/sources/libmodplay/source/mixer.h @@ -0,0 +1,77 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __MIXER_H__ +#define __MIXER_H__ + +#include "defines.h" + +/* +#define MIXER_TYPE u64 +#define MIXER_SHIFT 32 +*/ + +#define MIXER_TYPE u32 +#define MIXER_SHIFT 10 + + +typedef struct MOD_SAMPLEINFO16 { + + u32 length; + u32 loop_start; + u32 loop_end; + BOOL looped; + BOOL pingpong; + void *sampledata; + BOOL bit_16; + BOOL stereo; +} MOD_SAMPLEINFO16; + +typedef struct MOD_VOICEINFO16 { + + BOOL enabled; + BOOL playing; + BOOL forward; + u8 panning; + u8 envPanning; + /* u32 playpos; + u32 incval;*/ + MIXER_TYPE playpos; + MIXER_TYPE incval; + u8 volume; + u8 envVolume; + MOD_SAMPLEINFO16 *sampleInfo; +} MOD_VOICEINFO16; + +#define MIXER_USE_S32 1 +#define MIXER_3232BIT 2 +#define MIXER_SRC_SIGNED 4 +#define MIXER_DEST_STEREO 8 +#define MIXER_USE_DOUBLE 16 +#define MIXER_USE_FLOAT 32 +#define MIXER_DEST_16BIT 64 +#define MIXER_DEST_SIGNED 128 +#define MIXER_SRC_16BIT 256 + +int mix_s8m_to_s32m_1616bit (s32 *, int, MOD_VOICEINFO16 *, u8); +int mix_s8m_to_s32s_1616bit (s32 *, int, MOD_VOICEINFO16*, u8); + +int mix_s16m_to_s32s_1616bit(s32 *, int, MOD_VOICEINFO16 *, u8); +int mix_s16m_to_s32m_1616bit(s32 *, int, MOD_VOICEINFO16 *, u8); + +void clearbuf_s32(s32 *, int, int); + +void copybuf_s32_to_s16(s16 *, s32 *, int, int); +void copybuf_s32_to_u16(u16 *, s32 *, int, int); +void copybuf_s32_to_s8 (s8 *, s32 *, int, int); +void copybuf_s32_to_u8 (u8 *, s32 *, int, int); + +int mix_final_1616bit(int flags, void *dest, int nSamples, MOD_VOICEINFO16 *vinfo, u8 mainvol); +int copybuf_final(int flags, void *dest, void *src, int nSamples); +int clearbuf_final(int flags, void *dest, int nSamples); + +int mix_destbufsize(int flags); + +#endif diff --git a/portlibs/sources/libmodplay/source/mod.c b/portlibs/sources/libmodplay/source/mod.c new file mode 100644 index 00000000..5d190176 --- /dev/null +++ b/portlibs/sources/libmodplay/source/mod.c @@ -0,0 +1,600 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#include <stdio.h> +#include <stdlib.h> +#include <string.h> + +#include "effects.h" +#include "modplay.h" +#include "mod.h" + + +#define FORMAT_ID 1 +#define DESCRIPTION "Amiga Pro/Soundtracker" +#define AUTHOR "Christian Nowak <chnowak@web.de>" +#define VERSION "v0.03b" +#define COPYRIGHT "Copyright (c) 2002, 2003, 2007" + + +#define SAFE_MALLOC(dest, a) \ + dest = malloc(a); \ + if (dest == NULL) { \ + MODFILE_Free(mod); \ + return -2; \ + } + + + +static u32 s3m_finetunes[16] = { + + 7895,7941,7985,8046,8107,8169,8232,8280, + 8363,8413,8463,8529,8581,8651,8723,8757 +}; + + + +#define NUM_AMIGA_FREQS ((22 * 5) + 5) +static const struct { + + u16 amigafreq; + u8 st3note; +} s3m_amiga2st3[] = { + { 0x1ac0, 0x00 }, { 0x1940, 0x01 }, { 0x17d0, 0x02 }, { 0x1680, 0x03 }, { 0x1530, 0x04 }, + { 0x1400, 0x05 }, { 0x12e0, 0x06 }, { 0x11d0, 0x07 }, { 0x10d0, 0x08 }, { 0x0fe0, 0x09 }, + { 0x0f00, 0x0a }, { 0x0e2c, 0x0b }, { 0x0d60, 0x10 }, { 0x0ca0, 0x11 }, { 0x0be8, 0x12 }, + { 0x0b40, 0x13 }, { 0x0a98, 0x14 }, { 0x0a00, 0x15 }, { 0x0970, 0x16 }, { 0x08e8, 0x17 }, + { 0x0868, 0x18 }, { 0x07f0, 0x19 }, { 0x0780, 0x1a }, { 0x0716, 0x1b }, { 0x06b0, 0x20 }, + { 0x0650, 0x21 }, { 0x05f5, 0x22 }, { 0x05a0, 0x23 }, { 0x054f, 0x24 }, { 0x0503, 0x25 }, + { 0x04bb, 0x26 }, { 0x0477, 0x27 }, { 0x0436, 0x28 }, { 0x03fa, 0x29 }, { 0x03c1, 0x2a }, + { 0x0386, 0x2b }, { 0x0358, 0x30 }, { 0x0328, 0x31 }, { 0x02fa, 0x32 }, { 0x02d0, 0x33 }, + { 0x02a6, 0x34 }, { 0x0280, 0x35 }, { 0x025c, 0x36 }, { 0x023a, 0x37 }, { 0x021a, 0x38 }, + { 0x01fc, 0x39 }, { 0x01e0, 0x3a }, { 0x01c5, 0x3b }, { 0x01ac, 0x40 }, { 0x0194, 0x41 }, + { 0x017d, 0x42 }, { 0x0168, 0x43 }, { 0x0153, 0x44 }, { 0x0140, 0x45 }, { 0x012e, 0x46 }, + { 0x011d, 0x47 }, { 0x010d, 0x48 }, { 0x00fe, 0x49 }, { 0x00f0, 0x4a }, { 0x00e2, 0x4b }, + { 0x00d6, 0x50 }, { 0x00ca, 0x51 }, { 0x00be, 0x52 }, { 0x00b4, 0x53 }, { 0x00aa, 0x54 }, + { 0x00a0, 0x55 }, { 0x0097, 0x56 }, { 0x008f, 0x57 }, { 0x0087, 0x58 }, { 0x007f, 0x59 }, + { 0x0078, 0x5a }, { 0x0071, 0x5b }, { 0x006b, 0x60 }, { 0x0065, 0x61 }, { 0x005f, 0x62 }, + { 0x005a, 0x63 }, { 0x0055, 0x64 }, { 0x0050, 0x65 }, { 0x004c, 0x66 }, { 0x0047, 0x67 }, + { 0x0043, 0x68 }, { 0x003f, 0x69 }, { 0x003c, 0x6a }, { 0x0039, 0x6b }, { 0x0035, 0x70 }, + { 0x0032, 0x71 }, { 0x002f, 0x72 }, { 0x002d, 0x73 }, { 0x002a, 0x74 }, { 0x0028, 0x75 }, + { 0x0025, 0x76 }, { 0x0023, 0x77 }, { 0x0021, 0x78 }, { 0x001f, 0x79 }, { 0x001e, 0x7a }, + { 0x001c, 0x7b }, { 0x001a, 0x80 }, { 0x0019, 0x81 }, { 0x0017, 0x82 }, { 0x0016, 0x83 }, + { 0x0015, 0x84 }, { 0x0014, 0x85 }, { 0x0012, 0x86 }, { 0x0011, 0x87 }, { 0x0010, 0x88 }, + { 0x000f, 0x89 }, { 0x000f, 0x8a }, { 0x000e, 0x8b }, { 0x004b, 0x66 }, { 0x0474, 0x27 }, + { 0x0500, 0x25 }, { 0x05f4, 0x22 }, { 0x054c, 0x24 }, { 0x03f8, 0x29 }, + { 0x02b4, 0x34 } +}; + + +static int getSamplesSize(MODFILE *mod) { + + int i, s; + + for (i = s = 0; i < mod->nSamples; i++) + s += mod->samples[i].sampleInfo.length; + + return s; +} + +static int calcNumOfPatterns(MODFILE *mod, int modlength) { + + int n1, n2; + int i; + int patternsSize = 256 * (mod->nChannels - 1); + + for (i = n1 = 0; i < mod->songlength; i++) { + + if (mod->playlist[i] > n1) + n1 = mod->playlist[i]; + } + n1++; + + n2 = modlength - getSamplesSize(mod) - 1084; + + return n2 % patternsSize == 0 ? n2 / patternsSize : n1; +} + + + +/** + * int MODFILE_SetMOD(u8 *modfile, int modlength, MODFILE *mod); + * + * Processes the raw data of a Protracker MOD file and copies + * it to a structure. The structure can then be used as a handle + * of the MOD file. The original raw data isn't needed by the + * handle. + * + * Returns a value <0 on error. + * + * Parameters: + * modfile - A pointer to the raw MOD data + * modlength - The length of the raw data in bytes + * mod - A pointer to the MOD handle + **/ +int MODFILE_SetMOD(u8 *modfile, int modlength, MODFILE *mod) { + + int ofs = 0; + int i; + int sampledatalen; + int retval = 0; + + if (modfile == NULL || mod == NULL) + return -1; + + mod->nInstruments = 31; + + if ( (memcmp(&modfile[1080], "M.K.", 4) == 0) || + (memcmp(&modfile[1080], "FLT4", 4) == 0) ) { + + mod->nChannels = 4; + } else if (memcmp(&modfile[1080], "2CHN", 4) == 0) { + + mod->nChannels = 2; + } else if (memcmp(&modfile[1080], "6CHN", 4) == 0) { + + mod->nChannels = 6; + } else if (memcmp(&modfile[1080], "8CHN", 4) == 0) { + + mod->nChannels = 8; + } else if (memcmp(&modfile[1080], "10CH", 4) == 0) { + + mod->nChannels = 10; + } else if (memcmp(&modfile[1080], "12CH", 4) == 0) { + + mod->nChannels = 12; + } else if (memcmp(&modfile[1080], "14CH", 4) == 0) { + + mod->nChannels = 14; + } else if (memcmp(&modfile[1080], "16CH", 4) == 0) { + + mod->nChannels = 16; + } else if (memcmp(&modfile[1080], "18CH", 4) == 0) { + + mod->nChannels = 18; + } else if (memcmp(&modfile[1080], "20CH", 4) == 0) { + + mod->nChannels = 20; + } else if (memcmp(&modfile[1080], "22CH", 4) == 0) { + + mod->nChannels = 22; + } else if (memcmp(&modfile[1080], "24CH", 4) == 0) { + + mod->nChannels = 24; + } else if (memcmp(&modfile[1080], "26CH", 4) == 0) { + + mod->nChannels = 26; + } else if (memcmp(&modfile[1080], "28CH", 4) == 0) { + + mod->nChannels = 28; + } else if (memcmp(&modfile[1080], "30CH", 4) == 0) { + + mod->nChannels = 30; + } else if (memcmp(&modfile[1080], "32CH", 4) == 0) { + + mod->nChannels = 32; + } else { + + mod->nInstruments = 15; + mod->nChannels = 4; + } + + mod->nChannels++; /* Global fx channel */ + mod->nSamples = mod->nInstruments; /* The MOD format doesn't support multisamples */ + + /* 0 */ + memcpy(mod->songname, &modfile[ofs], 20); + ofs += 20; + /* Instruments */ + /* 20 */ + /* mod->instruments = malloc(mod->nInstruments * sizeof(MOD_Instrument));*/ + SAFE_MALLOC(mod->instruments, mod->nInstruments * sizeof(MOD_Instrument)); + memset(mod->instruments, 0, mod->nInstruments * sizeof(MOD_Instrument)); + /* mod->samples = malloc(mod->nSamples * sizeof(MOD_Sample));*/ + SAFE_MALLOC(mod->samples, mod->nSamples * sizeof(MOD_Sample)); + memset(mod->samples, 0, mod->nSamples * sizeof(MOD_Sample)); + + for (i = 0; i < mod->nInstruments; i++) { + + int temp, j; + + /* Name */ + memcpy(mod->samples[i].name, &modfile[ofs], 22); + ofs += 22; + /* Length */ + temp = modfile[ofs++] << 8; + temp |= modfile[ofs++]; + temp *= 2; + mod->samples[i].sampleInfo.length = temp; + /* Fine tune */ + temp = modfile[ofs++]; + if (temp > 7) temp -= 16; + temp += 8; + mod->samples[i].default_middle_c = s3m_finetunes[temp]; + /* Volume */ + mod->samples[i].default_volume = modfile[ofs++]; + /* Loop start */ + temp = modfile[ofs++] << 8; + temp |= modfile[ofs++]; + temp *= 2; + mod->samples[i].sampleInfo.loop_start = temp; + /* Loop end */ + temp = modfile[ofs++] << 8; + temp |= modfile[ofs++]; + temp *= 2; + mod->samples[i].sampleInfo.loop_end = mod->samples[i].sampleInfo.loop_start + temp; + + mod->samples[i].panning = 255; + mod->samples[i].sampleInfo.bit_16 = FALSE; + mod->samples[i].sampleInfo.stereo = FALSE; + mod->samples[i].sampleInfo.pingpong = FALSE; + mod->samples[i].relative_note = 0; + + mod->samples[i].sampleInfo.looped = TRUE; + if (temp <= 2) { + + mod->samples[i].sampleInfo.looped = FALSE; + mod->samples[i].sampleInfo.loop_start = mod->samples[i].sampleInfo.loop_end = + mod->samples[i].sampleInfo.length - 1; + } + + /* Define a new instrument */ + strcpy(mod->instruments[i].name, mod->samples[i].name); + for (j = 0; j < 256; j++) { + + mod->instruments[i].samples[j] = &mod->samples[i]; + mod->instruments[i].note[j] = j; + } + + /* Disable instrument envelopes */ + mod->instruments[i].envPanning.enabled = FALSE; + mod->instruments[i].envVolume.enabled = FALSE; + mod->instruments[i].volumeFade = 32767; + } + + /* Song length */ + mod->songlength = modfile[ofs++]; + /* CIAA speed */ + ofs++; + /* Arrangement */ + memcpy(mod->playlist, &modfile[ofs], 128); + ofs += 128; + /* I.D. */ + if (mod->nInstruments != 15) + ofs += 4; + + /* Calculate number of patterns */ + mod->nPatterns = calcNumOfPatterns(mod, modlength); +/* for (i = mod->nPatterns = 0; i < mod->songlength; i++) { + + if (mod->playlist[i] > mod->nPatterns) + mod->nPatterns = mod->playlist[i]; + } + + mod->nPatterns++;*/ + + /* Extract the patterns */ + /* mod->patterns = malloc(sizeof(MOD_Note*) * mod->nPatterns); + mod->patternLengths = malloc(sizeof(int) * mod->nPatterns);*/ + SAFE_MALLOC(mod->patterns, sizeof(MOD_Note*) * mod->nPatterns); + SAFE_MALLOC(mod->patternLengths, sizeof(int) * mod->nPatterns); + + for (i = 0; i < mod->nPatterns; i++) { + + int pline, pchannel; + u8 * curPattern; + + mod->patternLengths[i] = 64; + + /* Alloc mem for current pattern */ + /* mod->patterns[i] = malloc(sizeof(MOD_Note) * mod->nChannels * 64);*/ + SAFE_MALLOC(mod->patterns[i], sizeof(MOD_Note) * mod->nChannels * 64); + memset(mod->patterns[i], 255, sizeof(MOD_Note) * mod->nChannels * 64); + + /* Convert MOD pattern to our format */ + curPattern = &modfile[ofs]; + for (pline = 0; pline < 64; pline++) { + + u8 *curLine = &curPattern[(mod->nChannels - 1) * 4 * pline]; + MOD_Note *globalEffect = &mod->patterns[i][(pline * mod->nChannels) + mod->nChannels - 1]; + + for (pchannel = 0; pchannel < mod->nChannels - 1; pchannel++) { + + int j; + u8 *curNote = &curLine[4 * pchannel]; + u16 note; + u8 dnote; + u32 instrument; + u16 effect; + u8 operand; + u8 volume; + + note = (curNote[0] & 0x0f) << 8; + note |= curNote[1]; + instrument = curNote[0] & 0xf0; + instrument |= (curNote[2] & 0xf0) >> 4; + effect = curNote[2] & 0x0f; + operand = curNote[3]; + volume = 255; + + /* Convert note */ + dnote = 0xff; + if (note != 0) { + + for (j = 0; j < NUM_AMIGA_FREQS; j++) { + + if (s3m_amiga2st3[j].amigafreq == note) + dnote = s3m_amiga2st3[j].st3note; + } + } + + if ((dnote == 0xff) && (note != 0)) { /* Note not found */ + + fprintf(stderr, "Note not found: %x\n", note); + + retval = 1; + } + + /* Convert effect */ + switch (effect) { + + case 0x00: /* Arpeggio */ + if (operand != 0) + effect = EFFECT_ST00; + else + effect = EFFECT_NONE; + break; + case 0x01: /* Porta up */ + effect = EFFECT_ST10; + break; + case 0x02: /* Porta down */ + effect = EFFECT_ST20; + break; + case 0x03: /* Porta to note */ + effect = EFFECT_ST30; + break; + case 0x04: /* Vibrato */ + effect = EFFECT_ST40; + break; + case 0x05: /* Porta + volume slide */ + effect = EFFECT_ST50; + break; + case 0x06: /* Vibrato + volume slide */ + effect = EFFECT_ST60; + break; + case 0x07: /* Tremolo */ + effect = EFFECT_ST70; + break; + case 0x09: /* Sample offset */ + effect = EFFECT_ST90; + break; + case 0x0a: /* Volume slide */ + effect = EFFECT_STa0; + break; + case 0x0b: /* Pattern jump */ + globalEffect->effect[0] = EFFECT_STb0; + globalEffect->operand[0] = operand; + effect = EFFECT_NONE; + operand = 0; + break; + case 0x0c: /* Set volume */ + effect = EFFECT_NONE; + if (operand > 64) + operand = 64; + volume = operand; + break; + case 0x0d: /* Pattern break */ + operand = ((operand >> 4) * 10) + (operand & 0x0f); + if (operand >= 64) + operand = 0; + + if (globalEffect->effect[0] == EFFECT_STb0) { + + globalEffect->effect[0] = EFFECT_STg0; + globalEffect->operand[1] = operand; + } else { + + globalEffect->effect[0] = EFFECT_STd0; + globalEffect->operand[0] = operand; + } + effect = EFFECT_NONE; + operand = 0; + break; + case 0x0e: + switch (operand >> 4) { + + int temp; + + case 0x01: /* Fine porta up */ + effect = EFFECT_STe1; + operand = operand & 0x0f; + break; + case 0x02: /* Fine porta down */ + effect = EFFECT_STe2; + operand = operand & 0x0f; + break; + case 0x04: /* Set vibrato waveform */ + effect = EFFECT_STe4; + operand = operand & 0x0f; + break; + case 0x05: /* Set finetune */ + effect = EFFECT_STe5; + temp = operand & 0x0f; + if (temp > 7) temp -= 16; + temp += 8; + operand = operand & 0x0f; + break; + case 0x06: /* Pattern loop */ + operand = operand & 0x0f; + globalEffect->effect[0] = EFFECT_STe6; + globalEffect->operand[0] = operand; + effect = EFFECT_NONE; + operand = 0; + break; + case 0x07: /* Set tremolo waveform */ + effect = EFFECT_STe7; + operand = operand & 0x0f; + break; + case 0x08: /* Panning */ + effect = EFFECT_STe8; + operand = operand & 0x0f; + break; + case 0x09: /* Retrig */ + effect = EFFECT_STe9; + operand = operand & 0x0f; + break; + case 0x0a: /* Fine volume slide up */ + effect = EFFECT_STea; + operand = operand & 0x0f; + break; + case 0x0b: /* Fine volume slide down */ + effect = EFFECT_STeb; + operand = operand & 0x0f; + break; + case 0x0c: /* Note cut */ + effect = EFFECT_STec; + operand = operand & 0x0f; + break; + case 0x0d: /* Note delay */ + effect = EFFECT_STed; + operand = operand & 0x0f; + break; + case 0x0e: /* Pattern delay */ + operand = operand & 0x0f; + globalEffect->effect[0] = EFFECT_STee; + globalEffect->operand[0] = operand; + effect = EFFECT_NONE; + operand = 0; + break; + default: + effect = EFFECT_NONE; + break; + } + break; + case 0x0f: /* Set speed/tempo */ +/* if (operand < 32) + effect = 'A' - 'A' + 1; + else + effect = 'T' - 'A' + 1;*/ + effect = EFFECT_STf0; + break; + default: + effect = EFFECT_NONE; + break; + } + + j = (pline * mod->nChannels) + pchannel; + mod->patterns[i][j].note = dnote; + mod->patterns[i][j].instrument = instrument; + mod->patterns[i][j].volume = volume; + mod->patterns[i][j].effect[0] = effect; + mod->patterns[i][j].operand[0] = operand; + } + } + + ofs += 4 * (mod->nChannels - 1) * 64; + } + + /* Sample data */ + for (i = sampledatalen = 0; i < mod->nInstruments; i++) { + + sampledatalen += mod->samples[i].sampleInfo.length; + } + + if ((sampledatalen + 1084 + (mod->nPatterns * 64 * (mod->nChannels - 1) * 4)) != modlength) { + + ofs = modlength - sampledatalen; + } + + for (i = 0; i < mod->nInstruments; i++) { + + mod->samples[i].sampleInfo.sampledata = NULL; + if (mod->samples[i].sampleInfo.length != 0) { + + /* mod->samples[i].sampleInfo.sampledata = malloc(mod->samples[i].sampleInfo.length);*/ + SAFE_MALLOC(mod->samples[i].sampleInfo.sampledata, mod->samples[i].sampleInfo.length); + memcpy(mod->samples[i].sampleInfo.sampledata, &modfile[ofs], mod->samples[i].sampleInfo.length); + ofs += mod->samples[i].sampleInfo.length; + } + } + + for ( i = 0; i < mod->nChannels; i++) { + + mod->channels[i].voiceInfo.enabled = TRUE; + mod->channels[i].default_panning = (((i - 1) >> 1) & 1) ^ 1 ? 86 : 167; + } + + mod->start_speed = 6; + mod->start_tempo = 125; + mod->master_volume = 64; + + mod->filetype = MODULE_MOD; + + return retval; +} + + + + +/** + * BOOL MODFILE_IsMOD(u8 *modfile, int modlength); + * + * Checks whether the raw data in memory is a valid + * Protracker MOD file. + * + * Returns TRUE if the data is a Protracker MOD, + * FALSE if not. + * + * Parameters: + * + * modfile - Pointer to the raw data to be checked + * modlength - Length of the raw data in bytes + **/ +BOOL MODFILE_IsMOD(u8 *modfile, int modlength) { + + MODFILE temp; + int ret; + + if ((modfile == NULL) || (modlength < 1080)) + return FALSE; + + MODFILE_Init(&temp); + + if ((ret = MODFILE_SetMOD(modfile, modlength, &temp)) >= 0) { + + temp.set = TRUE; + MODFILE_Free(&temp); + } + + return ret == 0; +} + + + + +int MODFILE_MODGetFormatID(void) { + + return MODULE_MOD; +} + +char *MODFILE_MODGetDescription(void) { + + return DESCRIPTION; +} + +char *MODFILE_MODGetAuthor(void) { + + return AUTHOR; +} + +char *MODFILE_MODGetVersion(void) { + + return VERSION; +} + +char *MODFILE_MODGetCopyright(void) { + + return COPYRIGHT; +} diff --git a/portlibs/sources/libmodplay/source/mod.h b/portlibs/sources/libmodplay/source/mod.h new file mode 100644 index 00000000..25469a1b --- /dev/null +++ b/portlibs/sources/libmodplay/source/mod.h @@ -0,0 +1,30 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __MOD_H__ +#define __MOD_H__ + +#include "modplay.h" +#include "modplay_core.h" +#include "defines.h" + +#ifdef __cplusplus +extern "C" { +#endif + +int MODFILE_SetMOD(u8 *modfile, int modlength, MODFILE *mod); +BOOL MODFILE_IsMOD(u8 *modfile, int modlength); +int MODFILE_MODGetFormatID(void); +char *MODFILE_MODGetDescription(void); +char *MODFILE_MODGetAuthor(void); +char *MODFILE_MODGetVersion(void); +char *MODFILE_MODGetCopyright(void); + + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/sources/libmodplay/source/modplay.c b/portlibs/sources/libmodplay/source/modplay.c new file mode 100644 index 00000000..f66de947 --- /dev/null +++ b/portlibs/sources/libmodplay/source/modplay.c @@ -0,0 +1,651 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#include <stdio.h> +#include <stdlib.h> +#include <string.h> + +#include "modplay.h" +#include "s3m.h" +#include "mod.h" +#include "xm.h" + + +const MODFORMAT mod_formats[] = { + + { MODFILE_SetS3M, + MODFILE_IsS3M, + MODFILE_S3MGetFormatID, + MODFILE_S3MGetDescription, + MODFILE_S3MGetAuthor, + MODFILE_S3MGetVersion, + MODFILE_S3MGetCopyright + }, + + { MODFILE_SetXM, + MODFILE_IsXM, + MODFILE_XMGetFormatID, + MODFILE_XMGetDescription, + MODFILE_XMGetAuthor, + MODFILE_XMGetVersion, + MODFILE_XMGetCopyright + }, + + { MODFILE_SetMOD, + MODFILE_IsMOD, + MODFILE_MODGetFormatID, + MODFILE_MODGetDescription, + MODFILE_MODGetAuthor, + MODFILE_MODGetVersion, + MODFILE_MODGetCopyright + }, + + { NULL, NULL, NULL, NULL, NULL, NULL, NULL } +}; + + + + +/** + * void *loadFile(const char *fname, int *filelength); + * + * Tries to load a file specified by the fname parameter + * into a chunk of memory which the function allocates + * with the malloc() function prior to loading. + * + * Returns NULL on error and the address of the file in + * memory on success. + * + * Parameters: + * fname - The file to be loaded + * filelength - The length of the file in bytes is + * written to this location on success. + **/ +static void *loadFile(const char *fname, int *filelength) { + + FILE *fhandle; + void *file; + + fhandle = fopen(fname, "rb"); + + if (fhandle == NULL) + return NULL; + + fseek(fhandle, 0, SEEK_END); + (*filelength) = ftell(fhandle); + fseek(fhandle, 0, SEEK_SET); + + file = malloc(*filelength); + if (file == NULL) { + + fclose(fhandle); + return NULL; + } + + fread(file, 1, *filelength, fhandle); + fclose(fhandle); + + return file; +} + + + + +/** + * BOOL MODFILE_Is(u8 *modfile, int modlength); + * + * Checks whether the raw data in memory is a valid + * MOD file of any supported format. + * + * Returns TRUE if the data is of any supported + * format, FALSE if not. + * + * Parameters: + * + * modfile - Pointer to the raw data to be checked + * modlength - Length of the raw data in bytes + **/ +BOOL MODFILE_Is(u8 *modfile, int modlength) { + + int i = 0; + + while ((mod_formats[i].is != NULL) && + (mod_formats[i].set != NULL)) { + + if (mod_formats[i].is(modfile, modlength)) + return TRUE; + + i++; + } + + return FALSE; +} + + + + +/** + * int MODFILE_Set(u8 *modfile, int modlength, MODFILE *mod); + * + * Processes the raw data of a MOD file of any supported format + * and copies it to a structure. The structure can then be used + * as a handle of the MOD file. The original raw data isn't + * needed by the handle. + * The function works non-destructive if it fails, ie. it doesn't + * alter any data in the handle. + * + * Returns a value <0 on error. + * + * Parameters: + * modfile - A pointer to the raw MOD data + * modlength - The length of the raw data in bytes + * mod - A pointer to the MOD handle + **/ +int MODFILE_Set(u8 *modfile, int modlength, MODFILE *mod) { + + int i = 0, retval; + + if ((mod == NULL) || (modfile == NULL) || (modlength <= 0)) + return -1; + + if (mod->set) + return -1; + + while ((mod_formats[i].set != NULL) && + (mod_formats[i].is != NULL)) { + + if (mod_formats[i].is(modfile, modlength)) { + + if ((retval = mod_formats[i].set(modfile, modlength, mod)) >= 0) { + + mod->set = TRUE; + return 0; + } else { + + return retval; + } + } + + i++; + } + + return -1; +} + + + + +/** + * int MODFILE_Load(const char *fname, MODFILE *mod); + * + * Loads a MOD file of any supported format and copies + * it to a MODFILE structure. The structure can then + * be used as a handle of the module. + * + * Returns <0 on error. + * + * Parameters: + * + * fname - Name of the file to be loaded + * mod - Pointer to the MODFILE structure + **/ +int MODFILE_Load(const char *fname, MODFILE *mod) { + + u8 *modfile = NULL; + int modlength = 0; + int ret; + + if ((fname == NULL) || (mod == NULL)) + return -1; + + modfile = loadFile(fname, &modlength); + if (modfile == NULL) + return -1; + + ret = MODFILE_Set(modfile, modlength, mod); + + free(modfile); + + return ret; +} + + + + +/** + * void MODFILE_Start(MODFILE *mod); + * + * Resets all runtime-data in the MODFILE structure, + * prepares the music for playback and allocates + * a mixing buffer. + * + * Parameters: + * mod - A pointer too the module handle + **/ +void MODFILE_Start(MODFILE *mod) { + + int i; + + if (mod == NULL) + return; + + mod->speed = mod->start_speed; + MODFILE_SetBPM(mod, mod->start_tempo); + mod->pattern_line = 0; + mod->play_position = 0; + + mod->patterndelay = 0; + mod->samplescounter = 0; + mod->speedcounter = 0; + + mod->patternloop_to = 0; + mod->patternloop_count = 0; + + mod->cur_master_volume = mod->master_volume; + + mod->tempmixbuf = malloc(MODFILE_BPM2SamplesPerTick(mod, 32) * sizeof(s32) * 2); + + for (i = 0; i < mod->nSamples; i++) { + + mod->samples[i].middle_c = mod->samples[i].default_middle_c; + } + + for (i = 0; i < MODPLAY_MAX_CHANNELS; i++) { + + int c; + + mod->channels[i].voiceInfo.playing = FALSE; + mod->channels[i].voiceInfo.volume = 64; + mod->channels[i].last_instrument = 0; + + for (c = 0; c < MODPLAY_NUM_COMMANDS; c++) { + + mod->channels[i].effects[c].cur_effect = 255; + mod->channels[i].effects[c].cur_operand = 255; + mod->channels[i].effects[c].vibrato_wave = 0; + mod->channels[i].effects[c].tremolo_wave = 0; + mod->channels[i].effects[c].tremolo_sintabpos = 0; + mod->channels[i].effects[c].vibrato_sintabpos = 0; + } + + mod->channels[i].voiceInfo.panning = mod->channels[i].default_panning; + } + mod->playing = TRUE; +} + + + + +/** + * void MODFILE_Stop(MODFILE *mod); + * + * Stops music playback and deallocates the + * mixing buffer. + **/ +void MODFILE_Stop(MODFILE *mod) { + + if (mod->tempmixbuf != NULL) { + + free(mod->tempmixbuf); + mod->tempmixbuf = NULL; + mod->playing = FALSE; + } +} + + + + +/** + * void MODFILE_Player(MODFILE *mod); + * + * Calculates mod->mixingbuflen bytes of music data + * in the format specified with the MODFILE_SetFormat() + * format and stores the resulting data in the memory + * pointed to by mod->mixingbuf. + * + * Parameters: + * + * mod - A pointer to the MODFILE structure which defines + * the music to be calculated. + **/ +void MODFILE_Player(MODFILE *mod) { + + int len = mod->mixingbuflen; + int remain, l; + int mixflags; + u32 retval = 0; + u8 *buf8 = (u8*)mod->mixingbuf; + + if (mod->mixchannels == 2) + len >>= 1; + if (mod->bits == 16) + len >>= 1; + + mixflags = 0; + mixflags |= MIXER_USE_S32; + if (mod->mixchannels == 2) + mixflags |= MIXER_DEST_STEREO; + if (mod->bits == 16) + mixflags |= MIXER_DEST_16BIT; + if (mod->mixsigned) + mixflags |= MIXER_DEST_SIGNED; + remain = len; + l = 0; + + do { + + int tick_remain = mod->samplespertick - mod->samplescounter; + int res; + + res = MODFILE_Mix(mod, mixflags, &buf8[mix_destbufsize(mixflags) * l], tick_remain <= remain ? tick_remain : remain); + + l += res; + remain -= res; + + mod->samplescounter += res; + + if (mod->samplescounter >= mod->samplespertick) { + + mod->samplescounter -= mod->samplespertick; + mod->speedcounter++; + + if (mod->speedcounter >= (mod->speed + mod->patterndelay)) { + + mod->patterndelay = 0; + + retval |= MODFILE_Process(mod); + + mod->speedcounter = 0; + } + retval |= MODFILE_EffectHandler(mod); + } + } while (remain > 0); + + mod->notebeats = retval; + + if (mod->callback != NULL) + mod->callback(mod); +} + + + + +/** + * void MODFILE_Free(MODFILE *mod); + * + * Deallocates all resources occupied by the module + * in the MODFILE structure after they have been + * allocated by the MODFILE_Load() or any of the + * MODFILE_Set*() functions. + * + * Parameters: + * + * mod - A pointer to the MODFILE structure of which + * the resource shall be deallocated + **/ +void MODFILE_Free(MODFILE *mod) { + + int i; + + if (mod == NULL) + return; + + if (!mod->set) + return; + + /* Free patterns */ + if (mod->patterns != NULL) { + + for (i = 0; i < mod->nPatterns; i++) { + + if (mod->patterns[i] != NULL) { + + free(mod->patterns[i]); + mod->patterns[i] = NULL; + } + } + free(mod->patterns); + mod->patterns = NULL; + } + + /* Free instruments */ + if (mod->instruments != NULL) { + + for (i = 0; i < mod->nInstruments; i++) { + + if (mod->instruments[i].envVolume.envPoints != NULL) { + + free(mod->instruments[i].envVolume.envPoints); + mod->instruments[i].envVolume.envPoints = NULL; + } + + if (mod->instruments[i].envPanning.envPoints != NULL) { + + free(mod->instruments[i].envPanning.envPoints); + mod->instruments[i].envPanning.envPoints = NULL; + } + } + free(mod->instruments); + mod->instruments = NULL; + } + + /* Free samples */ + if (mod->samples != NULL ) { + + for (i = 0; i < mod->nSamples; i++) { + + if (mod->samples[i].sampleInfo.sampledata != NULL) { + + free(mod->samples[i].sampleInfo.sampledata); + mod->samples[i].sampleInfo.sampledata = NULL; + } + } + free(mod->samples); + mod->samples = NULL; + } + + if (mod->patternLengths != NULL) { + + free(mod->patternLengths); + mod->patternLengths = NULL; + } + + mod->set = FALSE; +} + + + + +/** + * void MODFILE_Init(MODFILE *mod); + * + * Initializes a MODFILE structure for usage. Must + * be called before the structure can be used by + * any other function. + * + * Parameters: + * + * mod - A pointer to the MODFILE structure + **/ +void MODFILE_Init(MODFILE *mod) { + + if (mod == NULL) + return; + + memset(mod, 0, sizeof(MODFILE)); +} + + + + +/** + * void MODFILE_SetFormat(MODFILE *mod, int freq, int channels, int bits, BOOL mixsigned); + * + * Sets the format of the output audio stream. Must + * be called prior to calling MODFILE_Start() and + * MODFILE_Player(). + * + * Parameters: + * + * mod - A pointer to the MODFILE structure of + * which the output format shall be changed + * freq - Output frequency. Common values are + * 11025Hz, 22050Hz and 44100Hz + * channels - 1 for mono and 2 for stereo + * bits - 8 or 16 are valid values + * mixsigned - TRUE if the output stream shall consist + * of signed values + **/ +void MODFILE_SetFormat(MODFILE *mod, int freq, int channels, int bits, BOOL mixsigned) { + + mod->playfreq = freq; + if ((channels == 1) || (channels == 2)) + mod->mixchannels = channels; + if ((bits == 8) || (bits == 16)) + mod->bits = bits; + mod->mixsigned = mixsigned; + + if (mod->playing) { + + if (mod->tempmixbuf != NULL) { + + free(mod->tempmixbuf); + mod->tempmixbuf = malloc(MODFILE_BPM2SamplesPerTick(mod,32) * sizeof(s32) * 2); + } + MODFILE_SetBPM(mod, mod->bpm); + } +} + + +int MODFILE_AllocSFXChannels(MODFILE *mod, int nChannels) { + + int i; + + if (mod == NULL || nChannels < 0 || nChannels > 32) + return -1; + + if (mod->nChannels + nChannels > MODPLAY_MAX_CHANNELS) + return -1; + + mod->nSFXChannels = nChannels; + + for (i = mod->nChannels; i < mod->nChannels + mod->nSFXChannels; i++) { + + mod->channels[i].voiceInfo.enabled = TRUE; + printf("%d\n", i); + } + + return 0; +} + +MOD_Instrument *MODFILE_MakeInstrument(void *rawData, int nBytes, int nBits) { + + MOD_Instrument *instr; + MOD_Sample *smpl; + int shiftVal = nBits == 16 ? 1 : 0; + int i; + + if (rawData == NULL || nBytes <= 0 || (nBits != 8 && nBits != 16)) + return NULL; + + instr = malloc(sizeof(MOD_Instrument)); + if (instr == NULL) + return NULL; + memset(instr, 0, sizeof(MOD_Instrument)); + + smpl = malloc(sizeof(MOD_Sample)); + if (smpl == NULL) { + + free(instr); + return NULL; + } + memset(smpl, 0, sizeof(MOD_Sample)); + + for (i = 0; i < 256; i++) { + + instr->samples[i] = smpl; + instr->note[i] = i; + } + + instr->name[0] = '\0'; + instr->volumeFade = 4096; + + instr->envVolume.sustain = 255; + instr->envVolume.loop_start = 255; + instr->envVolume.loop_end = 255; + + instr->envPanning.sustain = 255; + instr->envPanning.loop_start = 255; + instr->envPanning.loop_end = 255; + + smpl->name[0] = '\0'; + smpl->default_volume = 64; + smpl->middle_c = 8363; + smpl->default_middle_c = 8363; + smpl->finetune = 0; + smpl->relative_note = 0; + smpl->panning = 32; + smpl->volume = 64; + + smpl->sampleInfo.length = nBytes >> shiftVal; + smpl->sampleInfo.loop_start = 0; + smpl->sampleInfo.loop_end = (nBytes >> shiftVal) - 1; + smpl->sampleInfo.looped = FALSE; + smpl->sampleInfo.pingpong = FALSE; + smpl->sampleInfo.sampledata = rawData; + smpl->sampleInfo.bit_16 = nBits == 16; + smpl->sampleInfo.stereo = FALSE; + + return instr; +} + +void MODFILE_TriggerSFX(MODFILE *mod, MOD_Instrument *instr, int channel, u8 note) { + + u8 oct, sem; + u8 dnote; + int sfxchan; + + if (mod == NULL || instr == NULL) + return; + + if (channel < 0 || channel >= mod->nSFXChannels) + return; + + oct = note >> 4; + sem = note & 0x0f; + + if (sem >= 12) + return; + + sfxchan = mod->nChannels + channel; + + mod->channels[sfxchan].voiceInfo.playpos = 0; + mod->channels[sfxchan].voiceInfo.forward = TRUE; + mod->channels[sfxchan].instrument = instr; + mod->channels[sfxchan].sample = instr->samples[note]; + mod->channels[sfxchan].voiceInfo.sampleInfo = + &mod->channels[sfxchan].sample->sampleInfo; + + dnote = ((note >> 4) * 12) + (note & 0x0f); + dnote += mod->channels[sfxchan].sample->relative_note; + dnote = ((dnote / 12) << 4) | (dnote % 12); + MODFILE_SetNote(mod, sfxchan, + mod->channels[sfxchan].instrument->note[dnote], + mod->channels[sfxchan].sample->middle_c, + mod->channels[sfxchan].sample->finetune); + mod->channels[sfxchan].cur_note = dnote; + + mod->channels[sfxchan].voiceInfo.volume = mod->channels[sfxchan].sample->default_volume; + mod->channels[sfxchan].envVolume.envConfig = &mod->channels[sfxchan].instrument->envVolume; + EnvTrigger(&mod->channels[sfxchan].envVolume); + mod->channels[sfxchan].envPanning.envConfig = &mod->channels[sfxchan].instrument->envPanning; + EnvTrigger(&mod->channels[sfxchan].envPanning); + mod->channels[sfxchan].volumeFade = 32768; + mod->channels[sfxchan].volumeFadeDec = 0; + + mod->channels[sfxchan].voiceInfo.playing = TRUE; + + mod->channels[sfxchan].voiceInfo.panning = 128; +} diff --git a/portlibs/sources/libmodplay/source/modplay.h b/portlibs/sources/libmodplay/source/modplay.h new file mode 100644 index 00000000..9bde35b2 --- /dev/null +++ b/portlibs/sources/libmodplay/source/modplay.h @@ -0,0 +1,55 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + + #ifndef __MODPLAY_H__ +#define __MODPLAY_H__ + +#include "modplay_core.h" + + +#ifdef __cplusplus +extern "C" { +#endif + +#define MODULE_MOD 1 +#define MODULE_S3M 2 +#define MODULE_XM 3 + + +typedef struct MODFORMAT { + + int (*set)(u8 *, int, MODFILE *); + BOOL (*is) (u8 *, int); + int (*getFormatID)(void); + char *(*getDescription)(void); + char *(*getAuthor)(void); + char *(*getVersion)(void); + char *(*getCopyright)(void); +} MODFORMAT; + +extern const MODFORMAT mod_formats[]; + + + +int MODFILE_Load(const char *fname, MODFILE *mod); + +void MODFILE_Start(MODFILE *s3m); +void MODFILE_Stop(MODFILE *s3m); +void MODFILE_Player(MODFILE *s3m); +void MODFILE_Free(MODFILE *mod); +void MODFILE_Init(MODFILE *mod); +void MODFILE_SetFormat(MODFILE *mod, int freq, int channels, int bits, BOOL mixsigned); +int MODFILE_Set(u8 *modfile, int modlength, MODFILE *mod); +BOOL MODFILE_Is(u8 *, int); + +MOD_Instrument *MODFILE_MakeInstrument(void *rawData, int nBytes, int nBits); +int MODFILE_AllocSFXChannels(MODFILE *mod, int nChannels); +void MODFILE_TriggerSFX(MODFILE *mod, MOD_Instrument *instr, int channel, u8 note); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/sources/libmodplay/source/modplay_core.c b/portlibs/sources/libmodplay/source/modplay_core.c new file mode 100644 index 00000000..fc1fdd44 --- /dev/null +++ b/portlibs/sources/libmodplay/source/modplay_core.c @@ -0,0 +1,760 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <math.h> + +#include "modplay_core.h" +#include "mixer.h" +#include "effects.h" + + +static int linearperiodtab[768] = { + + 133808, 133687, 133566, 133446, 133325, 133205, 133085, 132965, + 132845, 132725, 132605, 132486, 132366, 132247, 132127, 132008, + 131889, 131770, 131651, 131532, 131414, 131295, 131177, 131059, + 130940, 130822, 130704, 130586, 130468, 130351, 130233, 130116, + 129998, 129881, 129764, 129647, 129530, 129413, 129296, 129180, + 129063, 128947, 128830, 128714, 128598, 128482, 128366, 128250, + 128134, 128019, 127903, 127788, 127673, 127558, 127442, 127328, + 127213, 127098, 126983, 126869, 126754, 126640, 126526, 126411, + 126297, 126183, 126070, 125956, 125842, 125729, 125615, 125502, + 125389, 125276, 125163, 125050, 124937, 124824, 124712, 124599, + 124487, 124374, 124262, 124150, 124038, 123926, 123814, 123703, + 123591, 123480, 123368, 123257, 123146, 123035, 122924, 122813, + 122702, 122591, 122481, 122370, 122260, 122150, 122039, 121929, + 121819, 121709, 121600, 121490, 121380, 121271, 121161, 121052, + 120943, 120834, 120725, 120616, 120507, 120398, 120290, 120181, + 120073, 119964, 119856, 119748, 119640, 119532, 119424, 119317, + 119209, 119101, 118994, 118887, 118779, 118672, 118565, 118458, + 118351, 118244, 118138, 118031, 117925, 117818, 117712, 117606, + 117500, 117394, 117288, 117182, 117076, 116971, 116865, 116760, + 116654, 116549, 116444, 116339, 116234, 116129, 116024, 115920, + 115815, 115711, 115606, 115502, 115398, 115294, 115190, 115086, + 114982, 114878, 114775, 114671, 114568, 114464, 114361, 114258, + 114155, 114052, 113949, 113846, 113743, 113641, 113538, 113436, + 113334, 113231, 113129, 113027, 112925, 112823, 112721, 112620, + 112518, 112417, 112315, 112214, 112113, 112012, 111911, 111810, + 111709, 111608, 111507, 111407, 111306, 111206, 111105, 111005, + 110905, 110805, 110705, 110605, 110505, 110406, 110306, 110207, + 110107, 110008, 109909, 109809, 109710, 109611, 109512, 109414, + 109315, 109216, 109118, 109019, 108921, 108823, 108725, 108627, + 108529, 108431, 108333, 108235, 108137, 108040, 107942, 107845, + 107748, 107651, 107553, 107456, 107359, 107263, 107166, 107069, + 106973, 106876, 106780, 106683, 106587, 106491, 106395, 106299, + 106203, 106107, 106011, 105916, 105820, 105725, 105629, 105534, + 105439, 105344, 105249, 105154, 105059, 104964, 104869, 104775, + 104680, 104586, 104492, 104397, 104303, 104209, 104115, 104021, + 103927, 103834, 103740, 103646, 103553, 103459, 103366, 103273, + 103180, 103086, 102993, 102901, 102808, 102715, 102622, 102530, + 102437, 102345, 102253, 102160, 102068, 101976, 101884, 101792, + 101700, 101609, 101517, 101425, 101334, 101242, 101151, 101060, + 100969, 100878, 100787, 100696, 100605, 100514, 100423, 100333, + 100242, 100152, 100061, 99971, 99881, 99791, 99701, 99611, + 99521, 99431, 99342, 99252, 99162, 99073, 98984, 98894, + 98805, 98716, 98627, 98538, 98449, 98360, 98271, 98183, + 98094, 98006, 97917, 97829, 97741, 97653, 97564, 97476, + 97389, 97301, 97213, 97125, 97038, 96950, 96863, 96775, + 96688, 96601, 96514, 96426, 96339, 96253, 96166, 96079, + 95992, 95906, 95819, 95733, 95646, 95560, 95474, 95388, + 95302, 95216, 95130, 95044, 94958, 94873, 94787, 94701, + 94616, 94531, 94445, 94360, 94275, 94190, 94105, 94020, + 93935, 93851, 93766, 93681, 93597, 93512, 93428, 93344, + 93260, 93175, 93091, 93007, 92923, 92840, 92756, 92672, + 92589, 92505, 92422, 92338, 92255, 92172, 92089, 92005, + 91922, 91840, 91757, 91674, 91591, 91509, 91426, 91344, + 91261, 91179, 91097, 91014, 90932, 90850, 90768, 90686, + 90605, 90523, 90441, 90360, 90278, 90197, 90115, 90034, + 89953, 89872, 89791, 89710, 89629, 89548, 89467, 89386, + 89306, 89225, 89145, 89064, 88984, 88904, 88823, 88743, + 88663, 88583, 88503, 88423, 88344, 88264, 88184, 88105, + 88025, 87946, 87867, 87787, 87708, 87629, 87550, 87471, + 87392, 87313, 87234, 87156, 87077, 86998, 86920, 86842, + 86763, 86685, 86607, 86529, 86451, 86373, 86295, 86217, + 86139, 86061, 85984, 85906, 85829, 85751, 85674, 85597, + 85519, 85442, 85365, 85288, 85211, 85134, 85057, 84981, + 84904, 84827, 84751, 84675, 84598, 84522, 84446, 84369, + 84293, 84217, 84141, 84065, 83989, 83914, 83838, 83762, + 83687, 83611, 83536, 83461, 83385, 83310, 83235, 83160, + 83085, 83010, 82935, 82860, 82785, 82711, 82636, 82561, + 82487, 82413, 82338, 82264, 82190, 82116, 82042, 81968, + 81894, 81820, 81746, 81672, 81598, 81525, 81451, 81378, + 81304, 81231, 81158, 81085, 81011, 80938, 80865, 80792, + 80719, 80647, 80574, 80501, 80429, 80356, 80284, 80211, + 80139, 80066, 79994, 79922, 79850, 79778, 79706, 79634, + 79562, 79490, 79419, 79347, 79275, 79204, 79133, 79061, + 78990, 78919, 78847, 78776, 78705, 78634, 78563, 78492, + 78422, 78351, 78280, 78209, 78139, 78068, 77998, 77928, + 77857, 77787, 77717, 77647, 77577, 77507, 77437, 77367, + 77297, 77227, 77158, 77088, 77019, 76949, 76880, 76810, + 76741, 76672, 76603, 76534, 76465, 76396, 76327, 76258, + 76189, 76120, 76052, 75983, 75914, 75846, 75778, 75709, + 75641, 75573, 75504, 75436, 75368, 75300, 75232, 75165, + 75097, 75029, 74961, 74894, 74826, 74759, 74691, 74624, + 74556, 74489, 74422, 74355, 74288, 74221, 74154, 74087, + 74020, 73953, 73887, 73820, 73753, 73687, 73620, 73554, + 73488, 73421, 73355, 73289, 73223, 73157, 73091, 73025, + 72959, 72893, 72827, 72762, 72696, 72630, 72565, 72499, + 72434, 72369, 72303, 72238, 72173, 72108, 72043, 71978, + 71913, 71848, 71783, 71718, 71654, 71589, 71524, 71460, + 71395, 71331, 71267, 71202, 71138, 71074, 71010, 70946, + 70882, 70818, 70754, 70690, 70626, 70563, 70499, 70435, + 70372, 70308, 70245, 70182, 70118, 70055, 69992, 69929, + 69866, 69803, 69740, 69677, 69614, 69551, 69488, 69426, + 69363, 69300, 69238, 69175, 69113, 69051, 68988, 68926, + 68864, 68802, 68740, 68678, 68616, 68554, 68492, 68430, + 68369, 68307, 68245, 68184, 68122, 68061, 67999, 67938, + 67877, 67815, 67754, 67693, 67632, 67571, 67510, 67449, + 67388, 67328, 67267, 67206, 67145, 67085, 67024, 66964 +}; + + + +static char * mod_notes[] = { + + "C-0", "C#0", "D-0", "D#0", "E-0", "F-0", "F#0", "G-0", "G#0", "A-0", "A#0", "B-0", "???", "???", "???", "???", + "C-1", "C#1", "D-1", "D#1", "E-1", "F-1", "F#1", "G-1", "G#1", "A-1", "A#1", "B-1", "???", "???", "???", "???", + "C-2", "C#2", "D-2", "D#2", "E-2", "F-2", "F#2", "G-2", "G#2", "A-2", "A#2", "B-2", "???", "???", "???", "???", + "C-3", "C#3", "D-3", "D#3", "E-3", "F-3", "F#3", "G-3", "G#3", "A-3", "A#3", "B-3", "???", "???", "???", "???", + "C-4", "C#4", "D-4", "D#4", "E-4", "F-4", "F#4", "G-4", "G#4", "A-4", "A#4", "B-4", "???", "???", "???", "???", + "C-5", "C#5", "D-5", "D#5", "E-5", "F-5", "F#5", "G-5", "G#5", "A-5", "A#5", "B-5", "???", "???", "???", "???", + "C-6", "C#6", "D-6", "D#6", "E-6", "F-6", "F#6", "G-6", "G#6", "A-6", "A#6", "B-6", "???", "???", "???", "???", + "C-7", "C#7", "D-7", "D#7", "E-7", "F-7", "F#7", "G-7", "G#7", "A-7", "A#7", "B-7", "???", "???", "???", "???" +}; + +static u32 mod_notetable[16][12] = { + + { 229079296, 216233728, 203923392, 192683520, 181443648, 171274240, + 161640064, 152541120, 143977408, 135948928, 128455680, 121363856 }, + + { 114539648, 108116864, 101961696, 96341760, 90721824, 85637120, + 80820032, 76270560, 71988704, 67974464, 64227840, 60681928 }, + + { 57269824, 54058432, 50980848, 48170880, 45360912, 42818560, + 40410016, 38135280, 35994352, 33987232, 32113920, 30340964 }, + + { 28634912, 27029216, 25490424, 24085440, 22680456, 21409280, + 20205008, 19067640, 17997176, 16993616, 16056960, 15170482 }, + + { 14317456, 13514608, 12745212, 12042720, 11340228, 10704640, + 10102504, 9533820, 8998588, 8496808, 8028480, 7585241 }, + + { 7158728, 6757304, 6372606, 6021360, 5670114, 5352320, + 5051252, 4766910, 4499294, 4248404, 4014240, 3792620 }, + + { 3579364, 3378652, 3186303, 3010680, 2835057, 2676160, + 2525626, 2383455, 2249647, 2124202, 2007120, 1896310 }, + + { 1789682, 1689326, 1593151, 1505340, 1417528, 1338080, + 1262813, 1191727, 1124823, 1062101, 1003560, 948155 }, + + { 894841, 844663, 796575, 752670, 708764, 669040, + 631406, 595863, 562411, 531050, 501780, 474077 }, + + { 447420, 422331, 398287, 376335, 354382, 334520, + 315703, 297931, 281205, 265525, 250890, 237038 }, + + { 223710, 211165, 199143, 188167, 177191, 167260, + 157851, 148965, 140602, 132762, 125445, 118519 }, + + { 111855, 105582, 99571, 94083, 88595, 83630, + 78925, 74482, 70301, 66381, 62722, 59259 }, + + { 55927, 52791, 49785, 47041, 44297, 41815, + 39462, 37241, 35150, 33190, 31361, 29629 }, + + { 27963, 26395, 24892, 23520, 22148, 20907, + 19731, 18620, 17575, 16595, 15680, 14814 }, + + { 13981, 13197, 12446, 11760, 11074, 10453, + 9865, 9310, 8787, 8297, 7840, 7407 }, + + { 6990, 6598, 6223, 5880, 5537, 5226, + 4932, 4655, 4393, 4148, 3920, 3703 } +}; + +int MODFILE_BPM2SamplesPerTick(MODFILE *mod, int bpm) { + + return (mod->playfreq * 5) / (2 * bpm); +} + + +static MIXER_TYPE MODFILE_Period2Incval(MODFILE *mod, u32 period) { + + if (mod->period_type == 1) { + + int freq; + int okt; + MIXER_TYPE t; + + okt = period / 768; + freq = linearperiodtab[period % 768]; + freq = freq >> okt; + freq <<= 2; + t = ((MIXER_TYPE)freq * ((MIXER_TYPE)1 << MIXER_SHIFT)) / (MIXER_TYPE)mod->playfreq; + + return t; + } else { + + unsigned long long int temp = period; + unsigned long long int playfreq = mod->playfreq; + unsigned long long int temp2 = 14317056; + unsigned long long int temp3 = 65536; + + if (period == 0) + return 0; + + temp = (temp2 * temp3) / (temp * playfreq); + +#if MIXER_SHIFT >= 16 + return ((MIXER_TYPE)temp) << (MIXER_SHIFT-16); +#else + return ((MIXER_TYPE)temp) >> (16-MIXER_SHIFT); +#endif + } +} + +static int MODFILE_Note2Period(MODFILE *mod, u8 dnote, int middle_c_freq, s8 finetune) { + + u32 note = dnote & 0x0f; + u32 octave = (dnote >> 4) & 0x0f; + + if (mod->period_type == 1) { + + int linnote = (octave * 12) + note; + + return (10 * 12 * 16 * 4) - (linnote * 16 * 4) - (finetune / 2); + } else { + + if (middle_c_freq == 0) + middle_c_freq = 8363; + + return mod_notetable[octave][note] / middle_c_freq; + } +} + +void MODFILE_SetNote(MODFILE *mod, int channel, u8 note, int middle_c, s8 finetune) { + + mod->channels[channel].st3_period = MODFILE_Note2Period(mod, note, middle_c, finetune); + mod->channels[channel].voiceInfo.incval = + MODFILE_Period2Incval(mod, + mod->channels[channel].st3_period + mod->channels[channel].st3_periodofs); +} + +void MODFILE_SetPeriod(MODFILE *mod, int channel, u32 period) { + + mod->channels[channel].st3_period = period; + mod->channels[channel].voiceInfo.incval = + MODFILE_Period2Incval(mod, + mod->channels[channel].st3_period + mod->channels[channel].st3_periodofs); +} + +void MODFILE_SetPeriodOfs(MODFILE *mod, int channel, s32 periodofs) { + + mod->channels[channel].st3_periodofs = periodofs; + mod->channels[channel].voiceInfo.incval = + MODFILE_Period2Incval(mod, + mod->channels[channel].st3_period + mod->channels[channel].st3_periodofs); +} + +void MODFILE_SetBPM(MODFILE *mod, int bpm) { + + if ((bpm >= 32) && (bpm < 256)) { + + mod->bpm = bpm; + mod->samplespertick = MODFILE_BPM2SamplesPerTick(mod, bpm); + } +} + +static MOD_Note *MODFILE_GetCurPatternData(MODFILE *mod, int patternline, int channel) { + + return &mod->patterns[mod->playlist[mod->play_position]] + [(patternline * mod->nChannels) + channel]; +} + +char *MODFILE_GetNoteString(u8 note) { + + if (note >= 128) + return "---"; + else + return mod_notes[note]; +} + +u8 MODFILE_GetNote(MODFILE *mod, int patternline, int channel) { + + MOD_Note *data = MODFILE_GetCurPatternData(mod, patternline, channel); + + return data->note; +} + +u16 MODFILE_GetEffect(MODFILE *mod, int patternline, int channel, int ecol) { + + MOD_Note *data = MODFILE_GetCurPatternData(mod, patternline, channel); + return data->effect[ecol] == 255 ? 0 : data->effect[ecol]; +} + +u8 MODFILE_GetEffectOp(MODFILE *mod, int patternline, int channel, int ecol) { + + MOD_Note *data = MODFILE_GetCurPatternData(mod, patternline, channel); + return data->operand[ecol] == 255 ? 0 : data->operand[ecol]; +} + +u32 MODFILE_GetInstr(MODFILE *mod, int patternline, int channel) { + + MOD_Note *data = MODFILE_GetCurPatternData(mod, patternline, channel); + return data->instrument == 255 ? 0 : data->instrument; +} + +void MODFILE_SubVolume(MODFILE *mod, int channel, u8 sub) { + + if (sub >= mod->channels[channel].voiceInfo.volume) + mod->channels[channel].voiceInfo.volume = 0; + else + mod->channels[channel].voiceInfo.volume -= sub; +} + +void MODFILE_AddVolume(MODFILE *mod, int channel, u8 add) { + + if (64 - add <= mod->channels[channel].voiceInfo.volume) + mod->channels[channel].voiceInfo.volume = 64; + else + mod->channels[channel].voiceInfo.volume += add; +} + +/* TODO: Rewrite(!) - Sieht aus wie hingekotzt... */ +BOOL MODFILE_TriggerNote(MODFILE *mod, int channel, u8 note, u8 instrument, u8 volume, u16 *commands) { + + BOOL ret = FALSE; + BOOL effect_07h = FALSE, + effect_0ch = FALSE; + int c; + + if (instrument - 1 >= mod->nInstruments) { + + return FALSE; + } + + if (instrument > 0) { + + if (!mod->instruments[instrument - 1].samples[note]) { + + return FALSE; + } + } +/* + for (c = 0; c < MODPLAY_NUM_COMMANDS; c++) { + + if (commands[c] == 0x07) effect_07h = TRUE; + if (commands[c] == 0x0c) effect_0ch = TRUE; + } +*/ + if ((note < 254) && (instrument != 255) && (!effect_07h) && (!effect_0ch)) { + + mod->channels[channel].voiceInfo.playpos = 0; + mod->channels[channel].voiceInfo.forward = TRUE; + + if (instrument > 0) { + + mod->channels[channel].last_instrument = instrument; + mod->channels[channel].instrument = &mod->instruments[instrument - 1]; + mod->channels[channel].sample = mod->instruments[instrument - 1].samples[note]; + mod->channels[channel].voiceInfo.sampleInfo = + &mod->channels[channel].sample->sampleInfo; + + ret = mod->channels[channel].voiceInfo.playing = TRUE; + } + + for (c = 0; c < MODPLAY_NUM_COMMANDS; c++) { + + if (mod->channels[channel].effects[c].vibrato_wave < 4) + mod->channels[channel].effects[c].vibrato_sintabpos = 0; + + if (mod->channels[channel].effects[c].tremolo_wave < 4) + mod->channels[channel].effects[c].tremolo_sintabpos = 0; + } + } + + if ((note < 254) && !((effect_07h) || (effect_0ch))) { + + u8 dnote; + + mod->channels[channel].last_note = note; + dnote = ((note >> 4) * 12) + (note & 0x0f); + if (mod->channels[channel].last_instrument != 0) + mod->channels[channel].sample = mod->instruments[mod->channels[channel].last_instrument - 1].samples[note]; + + if (mod->channels[channel].sample && + mod->channels[channel].instrument) { + + mod->channels[channel].voiceInfo.sampleInfo = + &mod->channels[channel].sample->sampleInfo; + dnote += mod->channels[channel].sample->relative_note; + dnote = ((dnote / 12) << 4) | (dnote % 12); + ret = mod->channels[channel].voiceInfo.playing = TRUE; + mod->channels[channel].voiceInfo.forward = TRUE; + + MODFILE_SetNote(mod, channel, + mod->channels[channel].instrument->note[dnote], + mod->channels[channel].sample->middle_c, + mod->channels[channel].sample->finetune); + mod->channels[channel].cur_note = dnote; + } + + for (c = 0; c < MODPLAY_NUM_COMMANDS; c++) + mod->channels[channel].effects[c].vibrato_base = mod->channels[channel].st3_period; + } + + /* Really trigger */ + if ((instrument != 255) && (instrument > 0)/* && mod->channels[channel].sample*/) { + +/* mod->channels[channel].voiceInfo.playpos = 0;*/ + mod->channels[channel].voiceInfo.panning = mod->channels[channel].default_panning; + mod->channels[channel].last_instrument = instrument; + mod->channels[channel].instrument = &mod->instruments[instrument - 1]; + mod->channels[channel].voiceInfo.volume = 64; + + if (mod->channels[channel].sample != NULL) { + + u8 tmp; + + mod->channels[channel].voiceInfo.volume = mod->channels[channel].sample->default_volume; + ret = mod->channels[channel].voiceInfo.playing = TRUE; + tmp = mod->channels[channel].sample->panning; + if (tmp <= 64) { + + mod->channels[channel].voiceInfo.panning = tmp == 64 ? 255 : tmp * 4 ; + } + } + + mod->channels[channel].envVolume.envConfig = &mod->channels[channel].instrument->envVolume; + EnvTrigger(&mod->channels[channel].envVolume); + mod->channels[channel].envPanning.envConfig = &mod->channels[channel].instrument->envPanning; + EnvTrigger(&mod->channels[channel].envPanning); + mod->channels[channel].volumeFade = 32768; + mod->channels[channel].volumeFadeDec = 0; + } + + if (volume <= 64) { + + mod->channels[channel].voiceInfo.volume = volume; + } + + if (note == 0xfe) { + + if (mod->channels[channel].voiceInfo.playing) { + + if (mod->channels[channel].envPanning.envConfig->enabled) + EnvRelease(&mod->channels[channel].envPanning); + + if (mod->channels[channel].envVolume.envConfig->enabled) + EnvRelease(&mod->channels[channel].envVolume); + else + mod->channels[channel].voiceInfo.playing = FALSE; + + mod->channels[channel].volumeFadeDec = mod->channels[channel].instrument->volumeFade; + } + } + + return ret; +} + +u32 MODFILE_Process(MODFILE *mod) { + + int i; + u32 retval = 0; + BOOL advancePattern = TRUE; + + for (i = 0; i < mod->nChannels; i++) { + +/* if (mod->channels[i].voiceInfo.enabled)*/ { + + int c; + MOD_Note *patternData = MODFILE_GetCurPatternData(mod, mod->pattern_line, i); + u8 note = patternData->note; + u32 instrument = patternData->instrument; + u8 volume = patternData->volume; + + BOOL doTrigger = TRUE; + BOOL resetSamplePos = TRUE; + BOOL changePeriod = TRUE; + BOOL changePanning = TRUE; + BOOL changeVolume = TRUE; + + for (c = 0; c < MODPLAY_NUM_COMMANDS; c++) { + + u16 command = patternData->effect[c]; + u8 operand = patternData->operand[c]; + u16 curcommand = mod->channels[i].effects[c].cur_effect; +/* u8 curoperand = mod->channels[i].effects[c].cur_operand;*/ + + if (note < 254 && mod->channels[i].sample != NULL) { + + u8 realnote = ((note >> 4) * 12) + (note & 0x0f); + + realnote += (int)(s8)mod->channels[i].sample->relative_note; + realnote = ((realnote / 12) << 4) | (realnote % 12); + + mod->channels[i].effects[c].toneporta_dest = + MODFILE_Note2Period(mod, realnote, + mod->channels[i].sample->middle_c, + mod->channels[i].sample->finetune); + } + + /* Stop the last effect */ + if (curcommand < EFFECT_NUMEFFECTS) { + + if (MODPLAY_EffectHandlers[curcommand].stop != NULL) { + + MODPLAY_EffectHandlers[curcommand].stop(mod, i, c); + } + } + + mod->channels[i].effects[c].cur_effect = command; + mod->channels[i].effects[c].cur_operand = operand; + mod->channels[i].effects[c].last_effect = command; + + if (volume <= 64) + mod->channels[i].voiceInfo.volume = volume; + + /* Start the next effect */ + if (command < EFFECT_NUMEFFECTS) { + + if (MODPLAY_EffectHandlers[command].start != NULL) { + + int r = MODPLAY_EffectHandlers[command].start(mod, i, c, patternData); + + if (r & EFFECT_DONOTTRIGGERNOTE) + doTrigger = FALSE; + + if (r & EFFECT_DONOTADVANCEPATTERN) + advancePattern = FALSE; + + if (r & EFFECT_DONOTRESETSAMPLEPOS) + resetSamplePos = FALSE; + + if (r & EFFECT_DONOTCHANGEPERIOD) + changePeriod = FALSE; + + if (r & EFFECT_DONOTCHANGEPANNING) + changePanning = FALSE; + + if (r & EFFECT_DONOTCHANGEVOLUME) + changeVolume = FALSE; + } + } + } + + if (doTrigger) { + + MIXER_TYPE playpos = mod->channels[i].voiceInfo.playpos; + u32 period = mod->channels[i].st3_period; + u8 panning = mod->channels[i].voiceInfo.panning; + u8 vol = mod->channels[i].voiceInfo.volume; + + if (MODFILE_TriggerNote(mod, i, note, instrument, volume, patternData->effect)) { + + retval |= 1 << i; + } + + if (!resetSamplePos) { + + mod->channels[i].voiceInfo.playpos = playpos; + } + + if (!changePeriod) { + + MODFILE_SetPeriod(mod, i, period); + } + + if (!changePanning) { + + mod->channels[i].voiceInfo.panning = panning; + } + + if (!changeVolume) { + + mod->channels[i].voiceInfo.volume = vol; + } + } + + if (volume <= 64) { + + mod->channels[i].voiceInfo.volume = volume; + } + + if (note != 0xff) + mod->channels[i].cur_note = note; + } + } + + if (advancePattern) { + + mod->pattern_line++; + if (mod->pattern_line >= mod->patternLengths[mod->playlist[mod->play_position]]) { + + mod->pattern_line = 0; + do { + + mod->play_position++; + if (mod->play_position >= mod->songlength) + mod->play_position = 0; + } while (mod->playlist[mod->play_position] >= 0xfe); + } + + if (mod->play_position >= mod->songlength) + mod->play_position = 0; + } + + return retval; +} + +u32 MODFILE_EffectHandler(MODFILE *mod) { + + u32 retval = 0; + int i; +/* + for (i = mod->nChannels; i < mod->nChannels + mod->nSFXChannels; i++) { + + if (mod->channels[i].voiceInfo.enabled) { + + if (EnvProcess(&mod->channels[i].envVolume)) + mod->channels[i].voiceInfo.envVolume = mod->channels[i].envVolume.value; + else + mod->channels[i].voiceInfo.envVolume = 64; + + if (EnvProcess(&mod->channels[i].envPanning)) { + mod->channels[i].voiceInfo.envPanning = mod->channels[i].envPanning.value; + } + else + mod->channels[i].voiceInfo.envPanning = 32; + } + } +*/ + for (i = 0; i < mod->nChannels; i++) { + + if (mod->channels[i].voiceInfo.enabled) { + + int c; + + /* Process envelopes */ + if (EnvProcess(&mod->channels[i].envVolume)) + mod->channels[i].voiceInfo.envVolume = mod->channels[i].envVolume.value; + else + mod->channels[i].voiceInfo.envVolume = 64; + + if (EnvProcess(&mod->channels[i].envPanning)) + mod->channels[i].voiceInfo.envPanning = mod->channels[i].envPanning.value; + else + mod->channels[i].voiceInfo.envPanning = 32; + + if (mod->channels[i].volumeFadeDec >= mod->channels[i].volumeFade) + mod->channels[i].volumeFade = 0; + else + mod->channels[i].volumeFade -= mod->channels[i].volumeFadeDec; + + for (c = 0; c < MODPLAY_NUM_COMMANDS; c++ ) { + + if (mod->channels[i].effects[c].cur_effect < EFFECT_NUMEFFECTS) + if (MODPLAY_EffectHandlers[mod->channels[i].effects[c].cur_effect].process != NULL) + MODPLAY_EffectHandlers[mod->channels[i].effects[c].cur_effect].process(mod, i, c); + } + } + } + + return retval; +} + +int MODFILE_Mix(MODFILE *mod, int flags, void *buf, int nSamples) { + + int i; + + clearbuf_final(flags, mod->tempmixbuf, nSamples); + + for (i = 0; i < mod->nChannels - 1; i++) { + + MOD_Channel *channel = &mod->channels[i]; + MOD_Sample *sample = channel->sample; + + if (channel->voiceInfo.enabled && + channel->voiceInfo.playing && + sample->sampleInfo.sampledata != NULL && + channel->voiceInfo.sampleInfo != NULL) { + +/* if(i == 0)*/ + mix_final_1616bit(flags, + mod->tempmixbuf, + nSamples, + &channel->voiceInfo, + ((u32)mod->cur_master_volume * + (u32)mod->master_volume * + (u32)mod->musicvolume * + (u32)(channel->volumeFade >> 9)) >> 18 + ); + } + } + + for (i = mod->nChannels + 1; i < mod->nChannels + mod->nSFXChannels; i++) { + + MOD_Channel *channel = &mod->channels[i]; + MOD_Sample *sample = channel->sample; + + if (channel->voiceInfo.enabled && + channel->voiceInfo.playing && + sample->sampleInfo.sampledata != NULL && + channel->voiceInfo.sampleInfo != NULL) { + + mix_final_1616bit(flags, + mod->tempmixbuf, + nSamples, + &channel->voiceInfo, + ((u32)mod->cur_master_volume * + (u32)mod->master_volume * + (u32)mod->sfxvolume * + (u32)(channel->volumeFade >> 9)) >> 18 + ); + } + } + + copybuf_final(flags, buf, mod->tempmixbuf, nSamples); + + return nSamples; +} + +void MODFILE_ClearPattern(MODFILE *mod, int pattern) { + + int pline, pchan; + + if (mod == NULL) + return; + + if (pattern < 0) + return; + + if (pattern >= mod->nPatterns) + return; + + for (pline = 0; pline < mod->patternLengths[pattern]; pline++) { + + for (pchan = 0; pchan < mod->nChannels; pchan++) { + + MOD_Note *n; + int c; + + n = &mod->patterns[pattern][(pline * mod->nChannels) + pchan]; + n->instrument = 0; + n->volume = 0xff; + n->note = 0xff; + + for (c = 0; c < MODPLAY_NUM_COMMANDS; c++) { + + n->effect[c] = EFFECT_NONE; + n->operand[c] = 0; + } + } + } +} diff --git a/portlibs/sources/libmodplay/source/modplay_core.h b/portlibs/sources/libmodplay/source/modplay_core.h new file mode 100644 index 00000000..449454c9 --- /dev/null +++ b/portlibs/sources/libmodplay/source/modplay_core.h @@ -0,0 +1,212 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __MODPLAY_CORE_H__ +#define __MODPLAY_CORE_H__ + +#include "defines.h" +#include "mixer.h" +#include "envelope.h" + +#define MODPLAY_MAX_CHANNELS 33 +#define MODPLAY_NUM_COMMANDS 2 + +typedef struct MOD_Note { + + u32 instrument; + u8 volume; + u8 note; + u16 effect[MODPLAY_NUM_COMMANDS]; + u8 operand[MODPLAY_NUM_COMMANDS]; +} MOD_Note; + +typedef struct MOD_ChannelEffect { + + u16 cur_effect; + u8 cur_operand; + u16 last_effect; + + /* Panning slide */ + u8 panslide_bak; + /* Volume Slide */ + u8 volslide_bak; + /* Portamento */ + u8 porta_bak; + /* Tone portamento */ + u8 toneporta_bak; + u32 toneporta_dest; + /* Vibrato */ + u8 vibrato_depth; + u8 vibrato_freq; + u8 vibrato_bak; + int vibrato_wave; + u32 vibrato_base; + int vibrato_sintabpos; + /* Tremolo */ + u8 tremolo_depth; + u8 tremolo_freq; + u8 tremolo_bak; + int tremolo_wave; + u8 tremolo_base; + int tremolo_sintabpos; + /* Retrig */ + u8 retrig_count; + u8 retrig_bak; + /* Note delay */ +/* u8 notedelay_note; + u8 notedelay_instrument; + u8 notedelay_volume; + u8 notedelay_tick;*/ + MOD_Note *notedelay_note; + /* Note cut */ + u8 notecut_tick; + /* Arpeggio */ + u8 arpeggio_count; + u8 arpeggio_bak; + u32 arpeggio_base; + /* Offset */ + u8 offset_bak; + /* Fine volslide */ + u8 finevolslidedown_bak; + u8 finevolslideup_bak; + u8 gvolslide_bak; +} MOD_ChannelEffect; + +typedef struct MOD_Sample { + + MOD_SAMPLEINFO16 sampleInfo; + + char name[28]; + u8 default_volume; + u32 middle_c; + u32 default_middle_c; + s8 finetune; + s8 relative_note; + u8 panning; + u8 volume; +} MOD_Sample; + +typedef struct MOD_Instrument { + + char name[28]; + MOD_Sample *samples[256]; /* Instrument note -> Sample number mapping */ + u8 note[256]; /* Instrument note -> Sample note mapping */ + + EnvelopeConfig envPanning; + EnvelopeConfig envVolume; + u16 volumeFade; +} MOD_Instrument; + +typedef struct MOD_Channel { + + u16 volumeFade; + u16 volumeFadeDec; + /* u32 instrument;*/ + MOD_Instrument *instrument; + /* u32 sample;*/ + MOD_Sample *sample; + MOD_VOICEINFO16 voiceInfo; + Envelope envPanning; + Envelope envVolume; + + u8 default_panning; + u8 cur_note; + u32 st3_period; + s32 st3_periodofs; + u8 last_instrument; + u8 last_note; + + MOD_ChannelEffect effects[MODPLAY_NUM_COMMANDS]; +} MOD_Channel; + +typedef struct MODFILE { + + char songname[28]; + int nChannels; + int nSFXChannels; + int songlength; + int nInstruments; + int nSamples; + int nPatterns; + int restart_position; + int period_type; /* 0 - Amiga, 1 - Linear (XM) */ + BOOL st2_vibrato; + BOOL st2_tempo; + BOOL amiga_sliding; + BOOL optimize_vols; + BOOL amiga_boundaries; + BOOL enable_sfx; /* Fast volume slides */ + BOOL unsigned_samples; + u8 master_volume; + u8 cur_master_volume; + u8 musicvolume; + u8 sfxvolume; + u8 start_speed; + u8 start_tempo; + u16 tracker_version; + + u8 playlist[256]; + + MOD_Channel channels[MODPLAY_MAX_CHANNELS]; + MOD_Instrument *instruments; + MOD_Sample *samples; + MOD_Note **patterns; + int *patternLengths; + + int playfreq; /* Output frequency (11025, 22050 or 44100) */ + int bits; /* Output resolution (8 or 16 bits) */ + u16 *mixingbuf; /* Output buffer */ + int mixingbuflen; /* Output buffer length in bytes */ + int mixchannels; /* 1 = mono, 2 = stereo */ + BOOL mixsigned; /* mixingbuf is signed */ + + /* Play time variables */ + int patterndelay; + int pattern_line; + int play_position; + int speedcounter; + int speed; + int bpm; + int samplespertick; + int samplescounter; + + /* Pattern loop */ + int patternloop_to; + int patternloop_count; + + void *tempmixbuf; + + int filetype; + + BOOL playing; + BOOL set; + + u32 notebeats; + void (*callback)(void*); + +} MODFILE; + +#include "modplay.h" + +int MODFILE_Mix(MODFILE *mod, int flags, void *buf, int nSamples); +u32 MODFILE_EffectHandler(MODFILE *mod); +u32 MODFILE_Process(MODFILE *mod); +BOOL MODFILE_TriggerNote(MODFILE *mod, int channel, u8 note, u8 instrument, u8 volume, u16 *commands); +void MODFILE_SetBPM(MODFILE *mod, int bpm); +int MODFILE_BPM2SamplesPerTick(MODFILE *mod, int bpm); +char * MODFILE_GetNoteString(u8 note); +u16 MODFILE_GetEffect(MODFILE*,int,int,int); +u8 MODFILE_GetEffectOp(MODFILE*,int,int,int); +u8 MODFILE_GetNote(MODFILE *mod, int patternline, int channel); +u32 MODFILE_GetInstr(MODFILE *mod, int patternline, int channel); +void MODFILE_ClearPattern(MODFILE *mod, int pattern); + +void MODFILE_SetNote(MODFILE *mod, int channel, u8 note, int middle_c, s8 finetune); +void MODFILE_SetPeriodOfs(MODFILE *mod, int channel, s32 periodofs); +void MODFILE_SetPeriod(MODFILE *mod, int channel, u32 period); +void MODFILE_SubVolume(MODFILE *mod, int channel, u8 sub); +void MODFILE_AddVolume(MODFILE *mod, int channel, u8 add); + +#endif diff --git a/portlibs/sources/libmodplay/source/s3m.c b/portlibs/sources/libmodplay/source/s3m.c new file mode 100644 index 00000000..2f10f84d --- /dev/null +++ b/portlibs/sources/libmodplay/source/s3m.c @@ -0,0 +1,575 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#include <stdlib.h> +#include <string.h> + +#include "modplay.h" +#include "s3m.h" +#include "effects.h" + + +#define DESCRIPTION "Future Crew Screamtracker 3" +#define AUTHOR "Christian Nowak <chnowak@web.de>" +#define VERSION "v0.01b" +#define COPYRIGHT "Copyright (c) 2003, 2007" + + +#define SAFE_MALLOC(dest, a) \ + dest = malloc(a); \ + if (dest == NULL) { \ + MODFILE_Free(s3m); \ + return -2; \ + } + + +/** + * int MODFILE_SetS3M(u8 *modfile, int modlength, MODFILE *mod); + * + * Processes the raw data of an S3M file and copies it to a + * structure. The structure can then be used as a handle + * of the S3M file. The original raw data isn't needed by the + * handle. + * + * Returns a value <0 on error. + * + * Parameters: + * modfile - A pointer to the raw S3M data + * modlength - The length of the raw data in bytes + * mod - A pointer to the S3M handle + **/ +int MODFILE_SetS3M(u8 *s3mfile, int s3mlength, MODFILE *s3m) { + + int ofs = 0; + int i; + BOOL panning_present = FALSE; + int remapChannels[MODPLAY_MAX_CHANNELS]; + + if (!MODFILE_IsS3M(s3mfile, s3mlength) || (s3m == NULL)) + return -1; + + /* 0 */ + memcpy(s3m->songname, &s3mfile[ofs], 28); + ofs+= 28; + /* 1c */ + ofs++; + /* 1d */ + if (s3mfile[ofs++] != 0x10) { + + return -1; + } + + ofs += 2; + + /* 20 */ + s3m->songlength = s3mfile[ofs++]; + s3m->songlength |= s3mfile[ofs++] << 8; + + /* 22 */ + s3m->nInstruments = s3mfile[ofs++]; + s3m->nInstruments |= s3mfile[ofs++] << 8; + s3m->nSamples = s3m->nInstruments; /* S3M doesn't have multisamples */ + + /* 24 */ + s3m->nPatterns = s3mfile[ofs++]; + s3m->nPatterns |= s3mfile[ofs++] << 8; + + /* 26 */ + s3m->st2_vibrato = (s3mfile[ofs] & 0x02) != 0; + s3m->st2_tempo = (s3mfile[ofs] & 0x04) != 0; + s3m->amiga_sliding = (s3mfile[ofs] & 0x08) != 0; + s3m->optimize_vols = (s3mfile[ofs] & 0x10) != 0; + s3m->amiga_boundaries = (s3mfile[ofs] & 0x20) != 0; + s3m->enable_sfx = (s3mfile[ofs] & 0x40) != 0; /* Fast volume slides */ + ofs += 2; + + /* 28 */ + s3m->tracker_version = (s3mfile[ofs] << 8) | s3mfile[ofs + 1]; + ofs += 2; + + /* 2a */ + s3m->unsigned_samples = (s3mfile[ofs] == 2); + ofs += 2; + + /* 2c */ + if (memcmp(&s3mfile[ofs], "SCRM", 4) != 0) { + + return -1; + } + ofs += 4; + + /* 30 */ + s3m->master_volume = s3mfile[ofs++]; + /* 31 */ + s3m->start_speed = s3mfile[ofs++]; + /* 32 */ + s3m->start_tempo = s3mfile[ofs++]; + /* 33 */ + ofs++; + /* 34 */ + ofs++; + /* 35 */ + panning_present = (s3mfile[ofs++] == 252); + /* 36 */ + ofs = 0x40; + + /* 40 */ + for (i = 0; i < MODPLAY_MAX_CHANNELS; i++) { + + s3m->channels[i].voiceInfo.enabled = FALSE; + remapChannels[i] = 255; + } + + for (i = s3m->nChannels = 0; i < 32; i++, ofs++) { + + if (s3mfile[ofs] < 16) { + + remapChannels[i] = s3m->nChannels; + s3m->nChannels++; + s3m->channels[remapChannels[i]].voiceInfo.enabled = TRUE; + s3m->channels[remapChannels[i]].default_panning = s3mfile[ofs] < 8 ? 86 : 167; + } + } + s3m->nChannels++; /* Global FX channel */ + + /* 60 */ + memcpy(s3m->playlist, &s3mfile[ofs], s3m->songlength); + ofs += s3m->songlength; + + /* Parapointers to intruments */ + /* s3m->instruments = malloc(s3m->nInstruments * sizeof(MOD_Instrument));*/ + SAFE_MALLOC(s3m->instruments, s3m->nInstruments * sizeof(MOD_Instrument)); + memset(s3m->instruments, 0, s3m->nInstruments * sizeof(MOD_Instrument)); + /* s3m->samples = malloc(s3m->nSamples * sizeof(MOD_Sample));*/ + SAFE_MALLOC(s3m->samples, s3m->nSamples * sizeof(MOD_Sample)); + memset(s3m->samples, 0, s3m->nSamples * sizeof(MOD_Sample)); + + for (i = 0; i < s3m->nInstruments; i++, ofs += 2) { + + int instrPointer = (s3mfile[ofs] | s3mfile[ofs+1] << 8) << 4; + + s3m->instruments[i].volumeFade = 32767; + /* 0 */ + /* s3m->instruments[i].adlib = s3mfile[instrPointer++] != 1;*/ + if (/*!s3m->instruments[i].adlib*/s3mfile[instrPointer++] == 1) { + + int sampleseg; + int j; + int temp; + + s3m->samples[i].relative_note = 0; + s3m->samples[i].panning = 255; + + /* 1 */ + /* memcpy(s3m->instruments[i].dosname, &s3mfile[instrPointer], 12); + s3m->instruments[i].dosname[12] = '\0';*/ + instrPointer += 12; + + /* d */ + sampleseg = s3mfile[instrPointer + 1] | + (s3mfile[instrPointer + 2] << 8) | + (s3mfile[instrPointer + 0] << 16); + sampleseg <<= 4; + instrPointer += 3; + + /* 10 */ + s3m->samples[i].sampleInfo.length = s3mfile[instrPointer] | + (s3mfile[instrPointer + 1] << 8) | + (s3mfile[instrPointer + 2] << 16) | + (s3mfile[instrPointer + 2] << 24); + instrPointer += 4; + + /* 14 */ + s3m->samples[i].sampleInfo.loop_start = s3mfile[instrPointer] | + (s3mfile[instrPointer + 1] << 8) | + (s3mfile[instrPointer + 2] << 16) | + (s3mfile[instrPointer + 3] << 24); + instrPointer += 4; + + /* 18 */ + s3m->samples[i].sampleInfo.loop_end = s3mfile[instrPointer] | + (s3mfile[instrPointer + 1] << 8) | + (s3mfile[instrPointer + 2] << 16) | + (s3mfile[instrPointer + 3] << 24); + instrPointer += 4; + + /* 1c */ + s3m->samples[i].default_volume = s3mfile[instrPointer++]; + + /* 1d */ + instrPointer++; + + /* 1e */ + /* s3m->instruments[i].packed = (s3mfile[instrPointer++] == 1);*/ + instrPointer++; + + /* 1f */ + s3m->samples[i].sampleInfo.looped = (s3mfile[instrPointer] & 1) != 0; + s3m->samples[i].sampleInfo.stereo = (s3mfile[instrPointer] & 2) != 0; + s3m->samples[i].sampleInfo.bit_16 = (s3mfile[instrPointer] & 4) != 0; + s3m->samples[i].sampleInfo.pingpong = FALSE; + instrPointer++; + + if (!s3m->samples[i].sampleInfo.looped) { + + s3m->samples[i].sampleInfo.loop_start = + s3m->samples[i].sampleInfo.loop_end = + s3m->samples[i].sampleInfo.length - 1; + } + + /* 20 */ + s3m->samples[i].default_middle_c = s3m->samples[i].middle_c = + s3mfile[instrPointer] | + (s3mfile[instrPointer + 1] << 8) | + (s3mfile[instrPointer + 2] << 16) | + (s3mfile[instrPointer + 3] << 24); + instrPointer += 4; + + /* 24 */ + instrPointer += 4; + + /* 28 */ + instrPointer += 2; + + /* 2a */ + instrPointer += 2; + + /* 2c */ + instrPointer += 4; + + /* 30 */ + memcpy(s3m->instruments[i].name, &s3mfile[instrPointer], 28); + instrPointer += 28; + + /* 4c */ + if (memcmp(&s3mfile[instrPointer], "SCRS", 4) != 0) { + + return -1; + } + + /* Define a new instrument */ + strcpy(s3m->instruments[i].name, s3m->samples[i].name); + for (j = 0; j < 256; j++) { + + s3m->instruments[i].samples[j] = &s3m->samples[i]; + s3m->instruments[i].note[j] = j; + } + + /* Disable instrument envelopes */ + s3m->instruments[i].envVolume.enabled = FALSE; + s3m->instruments[i].envPanning.enabled = FALSE; + + /* Copy sample data */ + temp = s3m->samples[i].sampleInfo.length * + (s3m->samples[i].sampleInfo.bit_16 || s3m->samples[i].sampleInfo.stereo ? 2 : 1); + + /* s3m->samples[i].sampleInfo.sampledata = malloc(temp);*/ + SAFE_MALLOC(s3m->samples[i].sampleInfo.sampledata, temp); + memset(s3m->samples[i].sampleInfo.sampledata, 0, temp); + + if (s3m->samples[i].sampleInfo.bit_16) { + + u8 *di = &s3mfile[sampleseg]; + int l = s3m->samples[i].sampleInfo.length; + + for (j = 0; j < l; j++) { + + u16 d; + + d = di[j<<1] | di[(j << 1) + 1] << 8; + if (s3m->unsigned_samples) + d ^= 0x8000; + ((u16*)s3m->samples[i].sampleInfo.sampledata)[j] = d; + } + } else { + + u8 *di = &s3mfile[sampleseg]; + int l = s3m->samples[i].sampleInfo.length; + + for (j = 0;j < l; j++) { + + u8 d; + + d = di[j]; + if (s3m->unsigned_samples) + d ^= 0x80; + ((u8*)s3m->samples[i].sampleInfo.sampledata)[j] = d; + } + } + } + } + + /* Parapointers to patterns */ + /* s3m->patterns = malloc(s3m->nPatterns * sizeof(MOD_Note*));*/ + SAFE_MALLOC(s3m->patterns, s3m->nPatterns * sizeof(MOD_Note*)); + memset(s3m->patterns, 0, s3m->nPatterns * sizeof(MOD_Note*)); + /* s3m->patternLengths = malloc(s3m->nPatterns * sizeof(int));*/ + SAFE_MALLOC(s3m->patternLengths, s3m->nPatterns * sizeof(int)); + + for (i = 0; i < s3m->nPatterns; i++, ofs += 2) { + + int pattPointer = (s3mfile[ofs] | s3mfile[ofs + 1] << 8) << 4; + int pattPackedLen; + int destChannel; + int destLine; + + s3m->patternLengths[i] = 64; + /* s3m->patterns[i] = malloc(sizeof(MOD_Note) * s3m->nChannels * 64);*/ + SAFE_MALLOC(s3m->patterns[i], sizeof(MOD_Note) * s3m->nChannels * 64); + memset(s3m->patterns[i], 255, sizeof(MOD_Note) * s3m->nChannels * 64); + + pattPackedLen = s3mfile[pattPointer] | + (s3mfile[pattPointer + 1] << 8); + pattPointer += 2; + + destChannel = destLine = 0; + + while (1) { + + int dest; + u8 compByte = s3mfile[pattPointer++]; + + if (compByte == 0) { + + destLine++; + if (destLine >= 64) { + + break; + } + } else { + + destChannel = remapChannels[compByte & 31]; + dest = (destLine * s3m->nChannels) + destChannel ; + if (destChannel != 255) { + + /* Note/Instrument */ + if (compByte & 32) { + + s3m->patterns[i][dest].note = s3mfile[pattPointer++]; + s3m->patterns[i][dest].instrument = s3mfile[pattPointer++]; + } + + /* Volume byte */ + if (compByte & 64) { + + s3m->patterns[i][dest].volume = s3mfile[pattPointer++]; + } + + /* Effect number/parameter */ + if (compByte & 128) { + + u16 effect = s3mfile[pattPointer++]; + u8 operand = s3mfile[pattPointer++]; + + /* Convert effect/operand to internal format */ + switch (effect) { + + case 'A' - 'A' + 1: /* Set Speed */ + effect = EFFECT_S3Ma0; + break; + + case 'B' - 'A' + 1: /* Jump To Order xy */ + s3m->patterns[i][(destLine * s3m->nChannels) + s3m->nChannels - 1].effect[0] = EFFECT_STb0; + s3m->patterns[i][(destLine * s3m->nChannels) + s3m->nChannels - 1].operand[0] = operand; + effect = EFFECT_NONE; + operand = 0; + break; + + case 'C' - 'A' + 1: /* Break Pattern */ + s3m->patterns[i][(destLine * s3m->nChannels) + s3m->nChannels - 1].effect[0] = EFFECT_STd0; + s3m->patterns[i][(destLine * s3m->nChannels) + s3m->nChannels - 1].operand[0] = operand; + effect = EFFECT_NONE; + operand = 0; + break; + + case 'D' - 'A' + 1: /* Volume Slide */ + effect = EFFECT_S3Md0; + break; + + case 'E' - 'A' + 1: /* Portamento Down */ + effect = EFFECT_S3Me0; + break; + + case 'F' - 'A' + 1: /* Portamento Up */ + effect = EFFECT_S3Mf0; + break; + + case 'G' - 'A' + 1: /* Tone Portamento */ + effect = EFFECT_ST30; + break; + + case 'H' - 'A' + 1: /* Vibrato */ + effect = EFFECT_ST40; + break; + + case 'I' - 'A' + 1: /* Tremor */ + effect = EFFECT_NONE; + break; + + case 'J' - 'A' + 1: /* Arpeggio */ + effect = EFFECT_ST00; + break; + + case 'K' - 'A' + 1: /* Vibrato + Volume Slide */ + effect = EFFECT_S3Mk0; + break; + + case 'L' - 'A' + 1: /* Tone Portamento + Volume Slide */ + effect = EFFECT_S3Ml0; + break; + + case 'O' - 'A' + 1: /* Sample Offset */ + effect = EFFECT_ST90; + break; + + case 'Q' - 'A' + 1: /* Retrig + Volume Slide */ + effect = EFFECT_S3Mq0; + break; + + case 'R' - 'A' + 1: /* Tremolo */ + effect = EFFECT_S3Mr0; + break; + + case 'S' - 'A' + 1: /* Various */ + + switch ((operand >> 4) & 0x0f) { + + case 0x02: /* Set Finetune */ + effect = EFFECT_STe5; + operand = operand & 0x0f; + break; + + case 0x03: /* Vibrato Waveform */ + effect = EFFECT_STe4; + operand = operand & 0x0f; + break; + + case 0x04: /* Tremolo Waveform */ + effect = EFFECT_STe7; + operand = operand & 0x0f; + break; + + case 0x08: /* Panning */ + effect = EFFECT_STe8; + operand = operand & 0x0f; + break; + + case 0x0b: /* Pattern Loop */ + operand = operand & 0x0f; + s3m->patterns[i][(destLine * s3m->nChannels) + s3m->nChannels - 1].effect[0] = EFFECT_STe6; + s3m->patterns[i][(destLine * s3m->nChannels) + s3m->nChannels - 1].operand[0] = operand; + effect = EFFECT_NONE; + operand = 0; + break; + + case 0x0c: /* Note Cut */ + effect = EFFECT_STec; + operand = operand & 0x0f; + break; + + case 0x0d: /* Note Delay */ + effect = EFFECT_STed; + operand = operand & 0x0f; + break; + + case 0x0e: /* Pattern Delay */ + operand = operand & 0x0f; + s3m->patterns[i][(destLine * s3m->nChannels) + s3m->nChannels - 1].effect[0] = EFFECT_STee; + s3m->patterns[i][(destLine * s3m->nChannels) + s3m->nChannels - 1].operand[0] = operand; + effect = EFFECT_NONE; + operand = 0; + break; + + default: + effect = EFFECT_NONE; + break; + } + break; + + case 'T' - 'A' + 1: /* Set Tempo */ + effect = EFFECT_S3Mt0; + break; + + case 'V' - 'A' + 1: /* Set Global Volume */ + effect = EFFECT_XM10; + break; + + default: + effect = EFFECT_NONE; + break; + } + + s3m->patterns[i][dest].effect[0] = effect; + s3m->patterns[i][dest].operand[0] = operand; + } + } else { + + if (compByte & 32) + pattPointer += 2; + if (compByte & 64) + pattPointer++; + if (compByte & 128) + pattPointer += 2; + } + } + } + } + + s3m->filetype = MODULE_S3M; + return 0; +} + + + + +/** + * BOOL MODFILE_IsS3M(u8 *modfile, int modlength); + * + * Checks whether the raw data in memory is a valid + * S3M file. + * + * Returns TRUE if the data is an S3M file, FALSE + * if not. + * + * Parameters: + * + * modfile - Pointer to the raw data to be checked + * modlength - Length of the raw data in bytes + **/ +BOOL MODFILE_IsS3M(u8 *modfile, int modlength) { + + if ((modfile == NULL) || (modlength < 0x30)) + return FALSE; + + return memcmp(&modfile[0x2c], "SCRM", 4) == 0; +} + + + + +int MODFILE_S3MGetFormatID(void) { + + return MODULE_S3M; +} + +char *MODFILE_S3MGetDescription(void) { + + return DESCRIPTION; +} + +char *MODFILE_S3MGetAuthor(void) { + + return AUTHOR; +} + +char *MODFILE_S3MGetVersion(void) { + + return VERSION; +} + +char *MODFILE_S3MGetCopyright(void) { + + return COPYRIGHT; +} diff --git a/portlibs/sources/libmodplay/source/s3m.h b/portlibs/sources/libmodplay/source/s3m.h new file mode 100644 index 00000000..10768df9 --- /dev/null +++ b/portlibs/sources/libmodplay/source/s3m.h @@ -0,0 +1,27 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __S3M_H__ +#define __S3M_H__ + +#include "modplay.h" + +#ifdef __cplusplus +extern "C" { +#endif + +int MODFILE_SetS3M(u8 *s3mfile, int s3mlength, MODFILE *s3m); +BOOL MODFILE_IsS3M(u8 *modfile, int modlength); +int MODFILE_S3MGetFormatID(void); +char *MODFILE_S3MGetDescription(void); +char *MODFILE_S3MGetAuthor(void); +char *MODFILE_S3MGetVersion(void); +char *MODFILE_S3MGetCopyright(void); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/sources/libmodplay/source/xm.c b/portlibs/sources/libmodplay/source/xm.c new file mode 100644 index 00000000..005e33e8 --- /dev/null +++ b/portlibs/sources/libmodplay/source/xm.c @@ -0,0 +1,769 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#include <stdio.h> +#include <stdlib.h> +#include <string.h> +#include <math.h> + +#include "modplay.h" +#include "effects.h" +#include "xm.h" + + +#define DESCRIPTION "Triton FastTracker II Extended Module" +#define AUTHOR "Christian Nowak <chnowak@web.de>, http://chn.roarvgm.com/" +#define VERSION "v0.01b" +#define COPYRIGHT "Copyright (c) 2003, 2007" + + + +#define SAFE_MALLOC(dest, a) \ + dest = malloc(a); \ + if (dest == NULL) { \ + MODFILE_Free(xm); \ + return -2; \ + } + +static int xmfinetab[] = { + + 7893, 7897, 7900, 7904, 7907, 7911, 7915, 7918, 7922, 7925, 7929, 7932, 7936, 7940, 7943, 7947, + 7950, 7954, 7958, 7961, 7965, 7968, 7972, 7975, 7979, 7983, 7986, 7990, 7993, 7997, 8001, 8004, + 8008, 8012, 8015, 8019, 8022, 8026, 8030, 8033, 8037, 8041, 8044, 8048, 8051, 8055, 8059, 8062, + 8066, 8070, 8073, 8077, 8081, 8084, 8088, 8091, 8095, 8099, 8102, 8106, 8110, 8113, 8117, 8121, + 8124, 8128, 8132, 8135, 8139, 8143, 8146, 8150, 8154, 8157, 8161, 8165, 8169, 8172, 8176, 8180, + 8183, 8187, 8191, 8194, 8198, 8202, 8205, 8209, 8213, 8217, 8220, 8224, 8228, 8231, 8235, 8239, + 8243, 8246, 8250, 8254, 8257, 8261, 8265, 8269, 8272, 8276, 8280, 8284, 8287, 8291, 8295, 8299, + 8302, 8306, 8310, 8314, 8317, 8321, 8325, 8329, 8332, 8336, 8340, 8344, 8347, 8351, 8355, 8359, + 8363, 8366, 8370, 8374, 8378, 8381, 8385, 8389, 8393, 8397, 8400, 8404, 8408, 8412, 8416, 8419, + 8423, 8427, 8431, 8435, 8438, 8442, 8446, 8450, 8454, 8457, 8461, 8465, 8469, 8473, 8476, 8480, + 8484, 8488, 8492, 8496, 8499, 8503, 8507, 8511, 8515, 8519, 8523, 8526, 8530, 8534, 8538, 8542, + 8546, 8549, 8553, 8557, 8561, 8565, 8569, 8573, 8577, 8580, 8584, 8588, 8592, 8596, 8600, 8604, + 8608, 8611, 8615, 8619, 8623, 8627, 8631, 8635, 8639, 8643, 8646, 8650, 8654, 8658, 8662, 8666, + 8670, 8674, 8678, 8682, 8686, 8690, 8693, 8697, 8701, 8705, 8709, 8713, 8717, 8721, 8725, 8729, + 8733, 8737, 8741, 8745, 8749, 8752, 8756, 8760, 8764, 8768, 8772, 8776, 8780, 8784, 8788, 8792, + 8796, 8800, 8804, 8808, 8812, 8816, 8820, 8824, 8828, 8832, 8836, 8840, 8844, 8848, 8852, 8856 +}; + + + + +static u32 getu32(u8 *d) { + + return d[0] | (d[1] << 8) | (d[2] << 16) | (d[3] << 24); +} + +static u16 getu16(u8 *d) { + + return d[0] | (d[1] << 8); +} + +static int xmgetfinefreq(int fine) { + + /* double fact = pow(2.0, 2.0 / 12.0);*/ + + return xmfinetab[fine + 128]; + /* return (int)(8363.0 * pow(fact, (double)fine / (double)steps));*/ + /*return 8363;*/ +} + +static void convertXMVolume(u8 v, u16 *e, u8 *o) { + + switch (v >> 4) { + + case 0x06: /* Volume slide down */ + *e = EFFECT_XMa0; + *o = v & 0x0f; + break; + + case 0x07: /* Volume slide up */ + *e = EFFECT_XMa0; + *o = (v & 0x0f) << 4; + break; + + case 0x08: /* Fine volume slide down */ + *e = EFFECT_STeb; + *o = v & 0x0f; + break; + + case 0x09: /* Fine volume slide up */ + *e = EFFECT_STea; + *o = v & 0x0f; + break; + + case 0x0c: /* Set panning */ + *e = EFFECT_ST80; + *o = (v & 0x0f) << 4; + break; + + case 0x0d: /* Panning slide left */ + *e = EFFECT_XM19; + *o = v & 0x0f; + break; + + case 0x0e: /* Panning slide right */ + *e = EFFECT_XM19; + *o = (v & 0x0f) << 4; + break; + + default: + break; + } +} + +static void convertXMEffects(MODFILE *mod, int pattern, int pline, u8 effect, u8 operand, u16 *e, u8 *o) { + + if ((e == NULL) || (o == NULL)) + return; + + *o = operand; + + switch (effect) { + + case 0x00: /* Arpeggio */ + if (operand != 0) + *e = EFFECT_ST00; + else + *e = EFFECT_NONE; + break; + case 0x01: /* Porta up */ + *e = EFFECT_XM01; + break; + case 0x02: /* Porta down */ + *e = EFFECT_XM02; + break; + case 0x03: /* Porta to note */ + *e = EFFECT_ST30; + break; + case 0x04: /* Vibrato */ + *e = EFFECT_ST40; + break; + case 0x05: /* Porta + volume slide */ + *e = EFFECT_ST50; + break; + case 0x06: /* Vibrato + volume slide */ + *e = EFFECT_ST60; + break; + case 0x07: /* Tremolo */ + *e = EFFECT_ST70; + break; + case 0x08: /* Panning */ + *e = EFFECT_ST80; + break; + case 0x09: /* Sample offset */ + *e = EFFECT_ST90; + break; + case 0x0a: /* Volume slide */ + *e = EFFECT_XMa0; + break; + case 0x0b: /* Pattern jump */ + mod->patterns[pattern][(pline * mod->nChannels) + mod->nChannels - 1].effect[0] = EFFECT_STb0; + mod->patterns[pattern][(pline * mod->nChannels) + mod->nChannels - 1].operand[0] = operand; + effect = EFFECT_NONE; + break; + case 0x0c: /* Set volume */ + *e = EFFECT_STc0; + if (operand > 64) + operand = 64; + *o = operand; + break; + case 0x0d: /* Pattern break */ + operand = ((operand >> 4) * 10) + (operand & 0x0f); + mod->patterns[pattern][(pline * mod->nChannels) + mod->nChannels - 1].effect[0] = EFFECT_STd0; + mod->patterns[pattern][(pline * mod->nChannels) + mod->nChannels - 1].operand[0] = operand; + *e = EFFECT_NONE; + break; + case 0x0e: + switch (operand >> 4) { + + int temp; + + case 0x01: /* Fine porta up */ + *e = EFFECT_STe1; + *o = operand & 0x0f; + break; + case 0x02: /* Fine porta down */ + *e = EFFECT_STe2; + *o = operand & 0x0f; + break; + case 0x04: /* Set vibrato waveform */ + *e = EFFECT_STe4; + *o = operand & 0x0f; + break; + case 0x05: /* Set finetune */ + *e = EFFECT_STe5; + temp = operand & 0x0f; + if (temp > 7) temp -= 16; + temp += 8; + *o = operand & 0x0f; + break; + case 0x06: /* Pattern loop */ + operand = operand & 0x0f; + mod->patterns[pattern][(pline * mod->nChannels) + mod->nChannels - 1].effect[0] = EFFECT_STe6; + mod->patterns[pattern][(pline * mod->nChannels) + mod->nChannels - 1].operand[0] = operand; + *e = EFFECT_NONE; + *o = 0; + break; + case 0x07: /* Set tremolo waveform */ + *e = EFFECT_STe7; + *o = operand & 0x0f; + break; + case 0x08: /* Panning */ + *e = EFFECT_STe8; + *o = operand & 0x0f; + break; + case 0x09: /* Retrig */ + *e = EFFECT_STe9; + *o = operand & 0x0f; + break; + case 0x0a: /* Fine volume slide up */ + *e = EFFECT_STea; + *o = operand & 0x0f; + break; + case 0x0b: /* Fine volume slide down */ + *e = EFFECT_STeb; + *o = operand & 0x0f; + break; + case 0x0c: /* Note cut */ + *e = EFFECT_STec; + *o = operand & 0x0f; + break; + case 0x0d: /* Note delay */ + *e = EFFECT_STed; + *o = operand & 0x0f; + break; + case 0x0e: /* Pattern delay */ + operand = operand & 0x0f; + mod->patterns[pattern][(pline * mod->nChannels) + mod->nChannels - 1].effect[0] = EFFECT_STee; + mod->patterns[pattern][(pline * mod->nChannels) + mod->nChannels - 1].operand[0] = operand; + *e = EFFECT_NONE; + *o = 0; + break; + default: + *e = EFFECT_NONE; + break; + } + break; + case 0x0f: /* Set speed/tempo */ + *e = EFFECT_STf0; + break; + case 0x10: /* Global volume */ + *e = EFFECT_XM10; + break; + case 0x11: /* Global volume slide */ + *e = EFFECT_XM11; + break; + case 0x19: /* Panning slide */ + *e = EFFECT_XM19; + break; + default: + *e = EFFECT_NONE; + break; + } +} + +int MODFILE_SetXM(u8 *xmfile, int xmlength, MODFILE *xm) { + + int ofs = 0; + int bak; + int headersize; + int nSamples = 0; + int i; + int sampleOfs; + + if (!MODFILE_IsXM(xmfile, xmlength)) + return -1; + + memcpy(xm->songname, &xmfile[17], 20); + xm->songname[17] = '\0'; + + ofs = 60; + headersize = getu32(&xmfile[ofs]); + xm->songlength = getu16(&xmfile[ofs + 4]); + xm->restart_position = getu16(&xmfile[ofs + 6]); + xm->nChannels = getu16(&xmfile[ofs + 8]); + xm->nChannels++; + xm->nPatterns = getu16(&xmfile[ofs + 10]); + xm->nInstruments = getu16(&xmfile[ofs + 12]); + if (getu16(&xmfile[ofs + 14]) & 1) + xm->period_type = 1; + else + xm->period_type = 0; + xm->start_tempo = getu16(&xmfile[ofs + 18]); + xm->start_speed = getu16(&xmfile[ofs + 16]); + memcpy(xm->playlist, &xmfile[ofs + 20], 256); + + ofs += headersize; + + /* Load patterns */ + SAFE_MALLOC(xm->patterns, sizeof(MOD_Note*) * xm->nPatterns); + SAFE_MALLOC(xm->patternLengths, sizeof(int) * xm->nPatterns); + /* xm->patterns = malloc(sizeof(MOD_Note*) * xm->nPatterns); + xm->patternLengths = malloc(sizeof(int) * xm->nPatterns);*/ + + for (i = 0; i < xm->nPatterns; i++) { + + int packedSize; + + headersize = getu32(&xmfile[ofs]); + xm->patternLengths[i] = getu16(&xmfile[ofs + 5]); + packedSize = getu16(&xmfile[ofs + 7]); + ofs += headersize; + + SAFE_MALLOC(xm->patterns[i], xm->patternLengths[i] * xm->nChannels * sizeof(MOD_Note)); + /* xm->patterns[i] = malloc(xm->patternLengths[i] * xm->nChannels * sizeof(MOD_Note));*/ + MODFILE_ClearPattern(xm, i); + + if (packedSize != 0) { /* There is patterndata */ + + int ppt = ofs; + int pline, pchannel; + + for (pline = 0; pline < xm->patternLengths[i]; pline++) { + + for (pchannel = 0; pchannel < xm->nChannels - 1; pchannel++) { + + MOD_Note *destNote = &xm->patterns[i][(pline * xm->nChannels) + pchannel]; + + if (xmfile[ppt] & 0x80) { /* A packed note */ + + u8 t = xmfile[ppt++]; + u8 effect = 0x00; + u8 operand = 0x00; + + if (t & 1) { + + u8 note = xmfile[ppt++]; + + if (note == 97) { /* A key off */ + + destNote->note = 0xfe; + } else { + + note--; + destNote->note = ((note / 12) << 4) | (note % 12); + } + } + if (t & 2) { + + u8 instrument = xmfile[ppt++]; + destNote->instrument = instrument; + } + if (t & 4) { + + u8 volume = xmfile[ppt++]; + if (volume == 0) + destNote->volume = 0xff; + else + if (volume < 0x10 || volume > 0x50) { + + destNote->volume = 0xff; + convertXMVolume(volume, &destNote->effect[0], &destNote->operand[0]); + } else { + + destNote->volume = volume - 0x10; + } + } + if (t & 8) { + + effect = xmfile[ppt++]; + } + if (t & 16) { + + operand = xmfile[ppt++]; + } + + convertXMEffects(xm, i, pline, effect, operand, &destNote->effect[1], &destNote->operand[1]); + + } else { /* Not a packed note */ + + u8 t; + u8 t2; + + t = xmfile[ppt++]; + + if (t == 97) { /* A key off */ + + destNote->note = 0xfe; + } else { + + t--; + destNote->note = ((t / 12) << 4) | (t % 12); + } + + destNote->instrument = xmfile[ppt++]; + + t = xmfile[ppt++]; + if (t == 0) + destNote->volume = 0xff; + else + if (t < 0x10 || t > 0x50) { + + destNote->volume = 0xff; + convertXMVolume(t, &destNote->effect[0], &destNote->operand[0]); + } else { + + destNote->volume = t - 0x10; + } + + t = xmfile[ppt++]; + t2 = xmfile[ppt++]; + convertXMEffects(xm, i, pline, t, t2, &destNote->effect[1], &destNote->operand[1]); + } + } + } + } + ofs += packedSize; + } + + /* Calculate number of samples */ + bak = ofs; + nSamples = 0; + for (i = 0; i < xm->nInstruments; i++) { + + int sheadersize = 0; + int samplesininstr; + int sampledatasize = 0; + + headersize = getu32(&xmfile[ofs]); + samplesininstr = getu16(&xmfile[ofs + 27]); + + if (samplesininstr > 0) + sheadersize = getu32(&xmfile[ofs + 29]); + + ofs += headersize; + + if (samplesininstr > 0) { + + int j; + + nSamples += samplesininstr; + + for (j = 0; j < samplesininstr; j++) { + + int ssize = getu32(&xmfile[ofs + 0]); + sampledatasize += ssize; + /* if (ssize == 0) + nSamples--;*/ + + ofs += sheadersize; + } + } + ofs += sampledatasize; + } + ofs = bak; + + xm->nSamples = nSamples; + + /* Load instruments */ + /* xm->samples = malloc(xm->nSamples * sizeof(MOD_Sample));*/ + SAFE_MALLOC(xm->samples, xm->nSamples * sizeof(MOD_Sample)); + memset(xm->samples, 0, xm->nSamples * sizeof(MOD_Sample)); + /* xm->instruments = malloc(xm->nInstruments * sizeof(MOD_Instrument));*/ + SAFE_MALLOC(xm->instruments, xm->nInstruments * sizeof(MOD_Instrument)); + memset(xm->instruments, 0, xm->nInstruments * sizeof(MOD_Instrument)); + + sampleOfs = 0; + + for (i = 0; i < xm->nInstruments; i++) { + + int sheadersize = 0; + int samplesininstr; + int j; + + headersize = getu32(&xmfile[ofs]); + samplesininstr = getu16(&xmfile[ofs + 27]); + memcpy(xm->instruments[i].name, &xmfile[ofs + 4], 22); + xm->instruments[i].name[22] = '\0'; + + /* Instrument note -> Sample note mapping */ + for (j = 0; j < 256; j++) { + + xm->instruments[i].note[j] = j; + } + + /* Sample number for all notes */ + for (j = 0; j < 256; j++) { + + xm->instruments[i].samples[j] = NULL; + } + + if (samplesininstr > 0) { + + sheadersize = getu32(&xmfile[ofs + 29]); + + /* Volume Fade */ + xm->instruments[i].volumeFade = getu16(&xmfile[ofs + 239]); + + /* Sample number for all notes */ + for (j = 0; j < 96; j++) { + + u8 dnote = ((j / 12) << 4) | (j % 12); + + xm->instruments[i].samples[dnote] = &xm->samples[(int)(unsigned int)xmfile[ofs + 33 + j] + sampleOfs]; + } + + /* Volume envelope */ + if ((xmfile[ofs + 233] & 1) && (xmfile[ofs + 225] > 0)) { + + xm->instruments[i].envVolume.enabled = TRUE; + xm->instruments[i].envVolume.numPoints = xmfile[ofs + 225]; + + /* Looping */ + if (xmfile[ofs + 233] & 4) { + + xm->instruments[i].envVolume.loop_start = xmfile[ofs + 228]; + xm->instruments[i].envVolume.loop_end = xmfile[ofs + 229]; + } else { + + xm->instruments[i].envVolume.loop_start = 255; + xm->instruments[i].envVolume.loop_end = 255; + } + + /* Sustain */ + if (xmfile[ofs + 233] & 2) { + + xm->instruments[i].envVolume.sustain = xmfile[ofs + 227]; + } else { + + xm->instruments[i].envVolume.sustain = 255; + } + + /* Envelope points */ + xm->instruments[i].envVolume.envPoints = malloc(sizeof(EnvPoint) * (int)xm->instruments[i].envVolume.numPoints); + for (j = 0; j < xm->instruments[i].envVolume.numPoints; j++) { + + xm->instruments[i].envVolume.envPoints[j].x = getu16(&xmfile[ofs + 129 + (j * 4)]); + xm->instruments[i].envVolume.envPoints[j].y = getu16(&xmfile[ofs + 129 + (j * 4) + 2]); + } + } else { + + xm->instruments[i].envVolume.enabled = FALSE; + } + + /* Panning envelope */ + if ((xmfile[ofs + 234] & 1) && (xmfile[ofs + 226] > 0)) { + + xm->instruments[i].envPanning.enabled = TRUE; + xm->instruments[i].envPanning.numPoints = xmfile[ofs + 226]; + + /* Looping */ + if (xmfile[ofs + 234] & 4) { + + xm->instruments[i].envPanning.loop_start = xmfile[ofs + 231]; + xm->instruments[i].envPanning.loop_end = xmfile[ofs + 232]; + } else { + + xm->instruments[i].envPanning.loop_start = 255; + xm->instruments[i].envPanning.loop_end = 255; + } + + /* Sustain */ + if (xmfile[ofs + 234] & 2) { + + xm->instruments[i].envPanning.sustain = xmfile[ofs + 230]; + } else { + + xm->instruments[i].envPanning.sustain = 255; + } + + /* Envelope points */ + xm->instruments[i].envPanning.envPoints = malloc(sizeof(EnvPoint) * (int)xm->instruments[i].envPanning.numPoints); + for (j = 0; j < xm->instruments[i].envPanning.numPoints; j++) { + + xm->instruments[i].envPanning.envPoints[j].x = getu16(&xmfile[ofs + 177 + (j * 4)]); + xm->instruments[i].envPanning.envPoints[j].y = getu16(&xmfile[ofs + 177 + (j * 4) + 2]); + } + } else { + + xm->instruments[i].envPanning.enabled = FALSE; + } + + ofs += headersize; /* Go to the sample headers */ + + /* Read sample headers */ + for (j = 0; j < samplesininstr; j++) { + + u8 flag = xmfile[ofs + 14]; + + xm->samples[sampleOfs + j].default_volume = 64; + xm->samples[sampleOfs + j].middle_c = + xm->samples[sampleOfs + j].default_middle_c = xmgetfinefreq((int)(s8)xmfile[ofs + 13]); + xm->samples[sampleOfs + j].finetune = (s8)xmfile[ofs + 13]; + + xm->samples[sampleOfs + j].panning = xmfile[ofs + 15] >> 2; + xm->samples[sampleOfs + j].default_volume = + xm->samples[sampleOfs + j].volume = xmfile[ofs + 12]; + memcpy(xm->samples[sampleOfs + j].name, &xmfile[ofs + 18], 22); + xm->samples[sampleOfs + j].name[22] = '\0'; + xm->samples[sampleOfs + j].relative_note = xmfile[ofs + 16]; + + xm->samples[sampleOfs + j].sampleInfo.length = getu32(&xmfile[ofs + 0]); + xm->samples[sampleOfs + j].sampleInfo.loop_start = getu32(&xmfile[ofs + 4]); + xm->samples[sampleOfs + j].sampleInfo.loop_end = getu32(&xmfile[ofs + 8]); + + xm->samples[sampleOfs + j].sampleInfo.stereo = FALSE; + xm->samples[sampleOfs + j].sampleInfo.bit_16 = (flag & 16) != 0; + + if (xm->samples[sampleOfs + j].sampleInfo.bit_16) { + + xm->samples[sampleOfs + j].sampleInfo.length /= 2; + xm->samples[sampleOfs + j].sampleInfo.loop_start /= 2; + xm->samples[sampleOfs + j].sampleInfo.loop_end /= 2; + } + + flag &= 0x03; + if ((flag == 0) || (flag == 3)) { + + xm->samples[sampleOfs + j].sampleInfo.looped = FALSE; + xm->samples[sampleOfs + j].sampleInfo.pingpong = FALSE; + } else if (flag == 1) { + + xm->samples[sampleOfs + j].sampleInfo.looped = TRUE; + xm->samples[sampleOfs + j].sampleInfo.pingpong = FALSE; + } else if (flag == 2) { + + xm->samples[sampleOfs + j].sampleInfo.looped = TRUE; + xm->samples[sampleOfs + j].sampleInfo.pingpong = TRUE; + } + + if (xm->samples[sampleOfs + j].sampleInfo.loop_end == 0) { + + xm->samples[sampleOfs + j].sampleInfo.looped = FALSE; + xm->samples[sampleOfs + j].sampleInfo.pingpong = FALSE; + } + + if (xm->samples[sampleOfs + j].sampleInfo.looped) { + + xm->samples[sampleOfs + j].sampleInfo.loop_end += + xm->samples[sampleOfs + j].sampleInfo.loop_start; + } else { + + xm->samples[sampleOfs + j].sampleInfo.loop_start = + xm->samples[sampleOfs + j].sampleInfo.loop_end = + xm->samples[sampleOfs + j].sampleInfo.length - 1; + } + + ofs += sheadersize; + } /* for (j = 0; j < samplesininstr; j++) */ + + /* Read sample data */ + for (j = 0; j < samplesininstr; j++) { + + if (xm->samples[sampleOfs + j].sampleInfo.length != 0) { + + u32 length = xm->samples[sampleOfs + j].sampleInfo.length; + + if (xm->samples[sampleOfs + j].sampleInfo.bit_16) { + + s16 *d; + s16 old, new; + u32 k; + + d = malloc(length * 2); + memcpy(d, &xmfile[ofs], length * 2); + xm->samples[sampleOfs + j].sampleInfo.sampledata = d; + ofs += length * 2; + + /* Convert the sampledata */ + old = 0; + for (k = 0; k < length; k++) { + + new = getu16((u8*)&d[k]) + old; + d[k] = new; + old = new; + } + } else { + + s8 * d; + s8 old, new; + u32 k; + + d = malloc(length); + memcpy(d, &xmfile[ofs], length); + xm->samples[sampleOfs + j].sampleInfo.sampledata = d; + ofs += length; + + /* Convert the sampledata */ + old = 0; + for (k = 0; k < length; k++) { + + new = d[k] + old; + d[k] = new; + old = new; + } + } + } + } + + sampleOfs += samplesininstr; + + } else {/* if (samplesininstr > 0) */ + + ofs += headersize; + } + } /* for (i = 0; i < xm->nInstruments; i++) */ + + xm->unsigned_samples = FALSE; + xm->master_volume = 64; + xm->filetype = MODULE_XM; + + for (i = 0; i < xm->nChannels; i++) { + + xm->channels[i].voiceInfo.enabled = TRUE; + xm->channels[i].default_panning = 128; + } + + return 0; +} + + + + +BOOL MODFILE_IsXM(u8 *xmfile, int xmlength) { + + if ((xmfile == NULL) || (xmlength < 1024)) + return FALSE; + + if (memcmp(&xmfile[0], "Extended Module: ", 17) != 0) + return FALSE; + + if (xmfile[37] != 0x1a) + return FALSE; + + return TRUE; +} + + + + +int MODFILE_XMGetFormatID(void) { + + return MODULE_XM; +} + + +char *MODFILE_XMGetDescription(void) { + + return DESCRIPTION; +} + + +char *MODFILE_XMGetAuthor(void) { + + return AUTHOR; +} + + +char *MODFILE_XMGetVersion(void) { + + return VERSION; +} + + +char *MODFILE_XMGetCopyright(void) { + + return COPYRIGHT; +} diff --git a/portlibs/sources/libmodplay/source/xm.h b/portlibs/sources/libmodplay/source/xm.h new file mode 100644 index 00000000..091e65c6 --- /dev/null +++ b/portlibs/sources/libmodplay/source/xm.h @@ -0,0 +1,28 @@ +/* + * Copyright (c) 2002, 2003, 2004, 2005, 2007 by Christian Nowak <chnowak@web.de> + * Last update: 20th October, 2007 + */ + +#ifndef __XM_H__ +#define __XM_H__ + +#include "modplay.h" + +#ifdef __cplusplus +extern "C" { +#endif + +int MODFILE_SetXM(u8 *xmfile, int xmlength, MODFILE *xm); +BOOL MODFILE_IsXM(u8 *xmfile, int xmlength); +int MODFILE_XMGetFormatID(void); +char *MODFILE_XMGetDescription(void); +char *MODFILE_XMGetAuthor(void); +char *MODFILE_XMGetVersion(void); +char *MODFILE_XMGetCopyright(void); + +#ifdef __cplusplus +} +#endif + + +#endif diff --git a/portlibs/sources/libntfs/Makefile b/portlibs/sources/libntfs/Makefile new file mode 100644 index 00000000..646a97b6 --- /dev/null +++ b/portlibs/sources/libntfs/Makefile @@ -0,0 +1,32 @@ +# Quick'n'dirty makefile [BC] v2 + +ifeq ($(strip $(DEVKITPPC)),) +$(error "Please set DEVKITPPC in your environment. export DEVKITPPC=<path to>devkitPPC") +endif + +include $(DEVKITPPC)/wii_rules + +LIBOGC_INC := $(DEVKITPRO)/libogc/include +LIBOGC_LIB := $(DEVKITPRO)/libogc/lib/wii + +CFLAGS := -O3 $(MACHDEP) -I$(LIBOGC_INC) -DHAVE_CONFIG_H + +LIB := ntfs +CFILES := $(wildcard *.c) +OFILES := $(CFILES:.c=.o) +ARC := lib$(LIB).a +HDR := ntfs.h + +all : $(OFILES) + $(AR) -r $(ARC) $(OFILES) + +clean : + rm -f $(OFILES) $(ARC) + +install : + cp -f $(ARC) ../../lib + cp -f $(HDR) ../../include + cp -f ntfsfile_frag.h ../../include + +%.o : %.c + $(CC) $(CFLAGS) -c $< -o $@ diff --git a/portlibs/sources/libntfs/acls.c b/portlibs/sources/libntfs/acls.c new file mode 100644 index 00000000..2a58eeaf --- /dev/null +++ b/portlibs/sources/libntfs/acls.c @@ -0,0 +1,4266 @@ +/** + * acls.c - General function to process NTFS ACLs + * + * This module is part of ntfs-3g library, but may also be + * integrated in tools running over Linux or Windows + * + * Copyright (c) 2007-2010 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 + /* + * integration into ntfs-3g + */ +#include "config.h" + +#ifdef HAVE_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#ifdef HAVE_FCNTL_H +#include <fcntl.h> +#endif +#ifdef HAVE_SYSLOG_H +#include <syslog.h> +#endif +#include <unistd.h> +#include <pwd.h> +#include <grp.h> + +#include "types.h" +#include "layout.h" +#include "security.h" +#include "acls.h" +#include "misc.h" +#else + + /* + * integration into secaudit, check whether Win32, + * may have to be adapted to compiler or something else + */ + +#ifndef WIN32 +#if defined(__WIN32) | defined(__WIN32__) | defined(WNSC) +#define WIN32 1 +#endif +#endif + +#include <stdio.h> +#include <time.h> +#include <string.h> +#include <stdlib.h> +#include <stdarg.h> +#include <sys/types.h> +#include <errno.h> + + /* + * integration into secaudit/Win32 + */ +#ifdef WIN32 +#include <fcntl.h> +#include <windows.h> +#define __LITTLE_ENDIAN 1234 +#define __BYTE_ORDER __LITTLE_ENDIAN +#else + /* + * integration into secaudit/STSC + */ +#ifdef STSC +#include <stat.h> +#undef __BYTE_ORDER +#define __BYTE_ORDER __BIG_ENDIAN +#else + /* + * integration into secaudit/Linux + */ +#include <sys/stat.h> +#include <endian.h> +#include <unistd.h> +#include <dlfcn.h> +#endif /* STSC */ +#endif /* WIN32 */ +#include "secaudit.h" +#endif /* HAVE_CONFIG_H */ + +/* + * A few useful constants + */ + +/* + * null SID (S-1-0-0) + */ + +static const char nullsidbytes[] = { + 1, /* revision */ + 1, /* auth count */ + 0, 0, 0, 0, 0, 0, /* base */ + 0, 0, 0, 0 /* 1st level */ + }; + +static const SID *nullsid = (const SID*)nullsidbytes; + +/* + * SID for world (S-1-1-0) + */ + +static const char worldsidbytes[] = { + 1, /* revision */ + 1, /* auth count */ + 0, 0, 0, 0, 0, 1, /* base */ + 0, 0, 0, 0 /* 1st level */ +} ; + +const SID *worldsid = (const SID*)worldsidbytes; + +/* + * SID for administrator + */ + +static const char adminsidbytes[] = { + 1, /* revision */ + 2, /* auth count */ + 0, 0, 0, 0, 0, 5, /* base */ + 32, 0, 0, 0, /* 1st level */ + 32, 2, 0, 0 /* 2nd level */ +}; + +const SID *adminsid = (const SID*)adminsidbytes; + +/* + * SID for system + */ + +static const char systemsidbytes[] = { + 1, /* revision */ + 1, /* auth count */ + 0, 0, 0, 0, 0, 5, /* base */ + 18, 0, 0, 0 /* 1st level */ + }; + +static const SID *systemsid = (const SID*)systemsidbytes; + +/* + * SID for generic creator-owner + * S-1-3-0 + */ + +static const char ownersidbytes[] = { + 1, /* revision */ + 1, /* auth count */ + 0, 0, 0, 0, 0, 3, /* base */ + 0, 0, 0, 0 /* 1st level */ +} ; + +static const SID *ownersid = (const SID*)ownersidbytes; + +/* + * SID for generic creator-group + * S-1-3-1 + */ + +static const char groupsidbytes[] = { + 1, /* revision */ + 1, /* auth count */ + 0, 0, 0, 0, 0, 3, /* base */ + 1, 0, 0, 0 /* 1st level */ +} ; + +static const SID *groupsid = (const SID*)groupsidbytes; + +/* + * Determine the size of a SID + */ + +int ntfs_sid_size(const SID * sid) +{ + return (sid->sub_authority_count * 4 + 8); +} + +/* + * Test whether two SID are equal + */ + +BOOL ntfs_same_sid(const SID *first, const SID *second) +{ + int size; + + size = ntfs_sid_size(first); + return ((ntfs_sid_size(second) == size) + && !memcmp(first, second, size)); +} + +/* + * Test whether a SID means "world user" + * Local users group also recognized as world + */ + +static int is_world_sid(const SID * usid) +{ + return ( + /* check whether S-1-1-0 : world */ + ((usid->sub_authority_count == 1) + && (usid->identifier_authority.high_part == const_cpu_to_be16(0)) + && (usid->identifier_authority.low_part == const_cpu_to_be32(1)) + && (usid->sub_authority[0] == const_cpu_to_le32(0))) + + /* check whether S-1-5-32-545 : local user */ + || ((usid->sub_authority_count == 2) + && (usid->identifier_authority.high_part == const_cpu_to_be16(0)) + && (usid->identifier_authority.low_part == const_cpu_to_be32(5)) + && (usid->sub_authority[0] == const_cpu_to_le32(32)) + && (usid->sub_authority[1] == const_cpu_to_le32(545))) + ); +} + +/* + * Test whether a SID means "some user (or group)" + * Currently we only check for S-1-5-21... but we should + * probably test for other configurations + */ + +BOOL ntfs_is_user_sid(const SID *usid) +{ + return ((usid->sub_authority_count == 5) + && (usid->identifier_authority.high_part == const_cpu_to_be16(0)) + && (usid->identifier_authority.low_part == const_cpu_to_be32(5)) + && (usid->sub_authority[0] == const_cpu_to_le32(21))); +} + +/* + * Determine the size of a security attribute + * whatever the order of fields + */ + +unsigned int ntfs_attr_size(const char *attr) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const ACL *pdacl; + const ACL *psacl; + const SID *psid; + unsigned int offdacl; + unsigned int offsacl; + unsigned int offowner; + unsigned int offgroup; + unsigned int endsid; + unsigned int endacl; + unsigned int attrsz; + + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)attr; + /* + * First check group, which is the last field in all descriptors + * we build, and in most descriptors built by Windows + */ + attrsz = sizeof(SECURITY_DESCRIPTOR_RELATIVE); + offgroup = le32_to_cpu(phead->group); + if (offgroup >= attrsz) { + /* find end of GSID */ + psid = (const SID*)&attr[offgroup]; + endsid = offgroup + ntfs_sid_size(psid); + if (endsid > attrsz) attrsz = endsid; + } + offowner = le32_to_cpu(phead->owner); + if (offowner >= attrsz) { + /* find end of USID */ + psid = (const SID*)&attr[offowner]; + endsid = offowner + ntfs_sid_size(psid); + attrsz = endsid; + } + offsacl = le32_to_cpu(phead->sacl); + if (offsacl >= attrsz) { + /* find end of SACL */ + psacl = (const ACL*)&attr[offsacl]; + endacl = offsacl + le16_to_cpu(psacl->size); + if (endacl > attrsz) + attrsz = endacl; + } + + + /* find end of DACL */ + offdacl = le32_to_cpu(phead->dacl); + if (offdacl >= attrsz) { + pdacl = (const ACL*)&attr[offdacl]; + endacl = offdacl + le16_to_cpu(pdacl->size); + if (endacl > attrsz) + attrsz = endacl; + } + return (attrsz); +} + +/* + * Do sanity checks on a SID read from storage + * (just check revision and number of authorities) + */ + +BOOL ntfs_valid_sid(const SID *sid) +{ + return ((sid->revision == SID_REVISION) + && (sid->sub_authority_count >= 1) + && (sid->sub_authority_count <= 8)); +} + +/* + * Check whether a SID is acceptable for an implicit + * mapping pattern. + * It should have been already checked it is a valid user SID. + * + * The last authority reference has to be >= 1000 (Windows usage) + * and <= 0x7fffffff, so that 30 bits from a uid and 30 more bits + * from a gid an be inserted with no overflow. + */ + +BOOL ntfs_valid_pattern(const SID *sid) +{ + int cnt; + u32 auth; + le32 leauth; + + cnt = sid->sub_authority_count; + leauth = sid->sub_authority[cnt-1]; + auth = le32_to_cpu(leauth); + return ((auth >= 1000) && (auth <= 0x7fffffff)); +} + +/* + * Compute the uid or gid associated to a SID + * through an implicit mapping + * + * Returns 0 (root) if it does not match pattern + */ + +static u32 findimplicit(const SID *xsid, const SID *pattern, int parity) +{ + BIGSID defsid; + SID *psid; + u32 xid; /* uid or gid */ + int cnt; + u32 carry; + le32 leauth; + u32 uauth; + u32 xlast; + u32 rlast; + + memcpy(&defsid,pattern,ntfs_sid_size(pattern)); + psid = (SID*)&defsid; + cnt = psid->sub_authority_count; + xid = 0; + if (xsid->sub_authority_count == cnt) { + psid->sub_authority[cnt-1] = xsid->sub_authority[cnt-1]; + leauth = xsid->sub_authority[cnt-1]; + xlast = le32_to_cpu(leauth); + leauth = pattern->sub_authority[cnt-1]; + rlast = le32_to_cpu(leauth); + + if ((xlast > rlast) && !((xlast ^ rlast ^ parity) & 1)) { + /* direct check for basic situation */ + if (ntfs_same_sid(psid,xsid)) + xid = ((xlast - rlast) >> 1) & 0x3fffffff; + else { + /* + * check whether part of mapping had to be + * recorded in a higher level authority + */ + carry = 1; + do { + leauth = psid->sub_authority[cnt-2]; + uauth = le32_to_cpu(leauth) + 1; + psid->sub_authority[cnt-2] + = cpu_to_le32(uauth); + } while (!ntfs_same_sid(psid,xsid) + && (++carry < 4)); + if (carry < 4) + xid = (((xlast - rlast) >> 1) + & 0x3fffffff) | (carry << 30); + } + } + } + return (xid); +} + +/* + * Find usid mapped to a Linux user + * Returns NULL if not found + */ + +const SID *ntfs_find_usid(const struct MAPPING* usermapping, + uid_t uid, SID *defusid) +{ + const struct MAPPING *p; + const SID *sid; + le32 leauth; + u32 uauth; + int cnt; + + if (!uid) + sid = adminsid; + else { + p = usermapping; + while (p && p->xid && ((uid_t)p->xid != uid)) + p = p->next; + if (p && !p->xid) { + /* + * default pattern has been reached : + * build an implicit SID according to pattern + * (the pattern format was checked while reading + * the mapping file) + */ + memcpy(defusid, p->sid, ntfs_sid_size(p->sid)); + cnt = defusid->sub_authority_count; + leauth = defusid->sub_authority[cnt-1]; + uauth = le32_to_cpu(leauth) + 2*(uid & 0x3fffffff); + defusid->sub_authority[cnt-1] = cpu_to_le32(uauth); + if (uid & 0xc0000000) { + leauth = defusid->sub_authority[cnt-2]; + uauth = le32_to_cpu(leauth) + ((uid >> 30) & 3); + defusid->sub_authority[cnt-2] = cpu_to_le32(uauth); + } + sid = defusid; + } else + sid = (p ? p->sid : (const SID*)NULL); + } + return (sid); +} + +/* + * Find Linux group mapped to a gsid + * Returns 0 (root) if not found + */ + +const SID *ntfs_find_gsid(const struct MAPPING* groupmapping, + gid_t gid, SID *defgsid) +{ + const struct MAPPING *p; + const SID *sid; + le32 leauth; + u32 uauth; + int cnt; + + if (!gid) + sid = adminsid; + else { + p = groupmapping; + while (p && p->xid && ((gid_t)p->xid != gid)) + p = p->next; + if (p && !p->xid) { + /* + * default pattern has been reached : + * build an implicit SID according to pattern + * (the pattern format was checked while reading + * the mapping file) + */ + memcpy(defgsid, p->sid, ntfs_sid_size(p->sid)); + cnt = defgsid->sub_authority_count; + leauth = defgsid->sub_authority[cnt-1]; + uauth = le32_to_cpu(leauth) + 2*(gid & 0x3fffffff) + 1; + defgsid->sub_authority[cnt-1] = cpu_to_le32(uauth); + if (gid & 0xc0000000) { + leauth = defgsid->sub_authority[cnt-2]; + uauth = le32_to_cpu(leauth) + ((gid >> 30) & 3); + defgsid->sub_authority[cnt-2] = cpu_to_le32(uauth); + } + sid = defgsid; + } else + sid = (p ? p->sid : (const SID*)NULL); + } + return (sid); +} + +/* + * Find Linux owner mapped to a usid + * Returns 0 (root) if not found + */ + +uid_t ntfs_find_user(const struct MAPPING* usermapping, const SID *usid) +{ + uid_t uid; + const struct MAPPING *p; + + p = usermapping; + while (p && p->xid && !ntfs_same_sid(usid, p->sid)) + p = p->next; + if (p && !p->xid) + /* + * No explicit mapping found, try implicit mapping + */ + uid = findimplicit(usid,p->sid,0); + else + uid = (p ? p->xid : 0); + return (uid); +} + +/* + * Find Linux group mapped to a gsid + * Returns 0 (root) if not found + */ + +gid_t ntfs_find_group(const struct MAPPING* groupmapping, const SID * gsid) +{ + gid_t gid; + const struct MAPPING *p; + int gsidsz; + + gsidsz = ntfs_sid_size(gsid); + p = groupmapping; + while (p && p->xid && !ntfs_same_sid(gsid, p->sid)) + p = p->next; + if (p && !p->xid) + /* + * No explicit mapping found, try implicit mapping + */ + gid = findimplicit(gsid,p->sid,1); + else + gid = (p ? p->xid : 0); + return (gid); +} + +/* + * Check the validity of the ACEs in a DACL or SACL + */ + +static BOOL valid_acl(const ACL *pacl, unsigned int end) +{ + const ACCESS_ALLOWED_ACE *pace; + unsigned int offace; + unsigned int acecnt; + unsigned int acesz; + unsigned int nace; + BOOL ok; + + ok = TRUE; + acecnt = le16_to_cpu(pacl->ace_count); + offace = sizeof(ACL); + for (nace = 0; (nace < acecnt) && ok; nace++) { + /* be sure the beginning is within range */ + if ((offace + sizeof(ACCESS_ALLOWED_ACE)) > end) + ok = FALSE; + else { + pace = (const ACCESS_ALLOWED_ACE*) + &((const char*)pacl)[offace]; + acesz = le16_to_cpu(pace->size); + if (((offace + acesz) > end) + || !ntfs_valid_sid(&pace->sid) + || ((ntfs_sid_size(&pace->sid) + 8) != (int)acesz)) + ok = FALSE; + offace += acesz; + } + } + return (ok); +} + +/* + * Do sanity checks on security descriptors read from storage + * basically, we make sure that every field holds within + * allocated storage + * Should not be called with a NULL argument + * returns TRUE if considered safe + * if not, error should be logged by caller + */ + +BOOL ntfs_valid_descr(const char *securattr, unsigned int attrsz) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const ACL *pdacl; + const ACL *psacl; + unsigned int offdacl; + unsigned int offsacl; + unsigned int offowner; + unsigned int offgroup; + BOOL ok; + + ok = TRUE; + + /* + * first check overall size if within allocation range + * and a DACL is present + * and owner and group SID are valid + */ + + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)securattr; + offdacl = le32_to_cpu(phead->dacl); + offsacl = le32_to_cpu(phead->sacl); + offowner = le32_to_cpu(phead->owner); + offgroup = le32_to_cpu(phead->group); + pdacl = (const ACL*)&securattr[offdacl]; + psacl = (const ACL*)&securattr[offsacl]; + + /* + * size check occurs before the above pointers are used + * + * "DR Watson" standard directory on WinXP has an + * old revision and no DACL though SE_DACL_PRESENT is set + */ + if ((attrsz >= sizeof(SECURITY_DESCRIPTOR_RELATIVE)) + && (phead->revision == SECURITY_DESCRIPTOR_REVISION) + && (offowner >= sizeof(SECURITY_DESCRIPTOR_RELATIVE)) + && ((offowner + 2) < attrsz) + && (offgroup >= sizeof(SECURITY_DESCRIPTOR_RELATIVE)) + && ((offgroup + 2) < attrsz) + && (!offdacl + || ((offdacl >= sizeof(SECURITY_DESCRIPTOR_RELATIVE)) + && (offdacl+sizeof(ACL) < attrsz))) + && (!offsacl + || ((offsacl >= sizeof(SECURITY_DESCRIPTOR_RELATIVE)) + && (offsacl+sizeof(ACL) < attrsz))) + && !(phead->owner & const_cpu_to_le32(3)) + && !(phead->group & const_cpu_to_le32(3)) + && !(phead->dacl & const_cpu_to_le32(3)) + && !(phead->sacl & const_cpu_to_le32(3)) + && (ntfs_attr_size(securattr) <= attrsz) + && ntfs_valid_sid((const SID*)&securattr[offowner]) + && ntfs_valid_sid((const SID*)&securattr[offgroup]) + /* + * if there is an ACL, as indicated by offdacl, + * require SE_DACL_PRESENT + * but "Dr Watson" has SE_DACL_PRESENT though no DACL + */ + && (!offdacl + || ((phead->control & SE_DACL_PRESENT) + && ((pdacl->revision == ACL_REVISION) + || (pdacl->revision == ACL_REVISION_DS)))) + /* same for SACL */ + && (!offsacl + || ((phead->control & SE_SACL_PRESENT) + && ((psacl->revision == ACL_REVISION) + || (psacl->revision == ACL_REVISION_DS))))) { + /* + * Check the DACL and SACL if present + */ + if ((offdacl && !valid_acl(pdacl,attrsz - offdacl)) + || (offsacl && !valid_acl(psacl,attrsz - offsacl))) + ok = FALSE; + } else + ok = FALSE; + return (ok); +} + +/* + * Copy the inheritable parts of an ACL + * + * Returns the size of the new ACL + * or zero if nothing is inheritable + */ + +int ntfs_inherit_acl(const ACL *oldacl, ACL *newacl, + const SID *usid, const SID *gsid, BOOL fordir) +{ + unsigned int src; + unsigned int dst; + int oldcnt; + int newcnt; + unsigned int selection; + int nace; + int acesz; + int usidsz; + int gsidsz; + const ACCESS_ALLOWED_ACE *poldace; + ACCESS_ALLOWED_ACE *pnewace; + + usidsz = ntfs_sid_size(usid); + gsidsz = ntfs_sid_size(gsid); + + /* ACL header */ + + newacl->revision = ACL_REVISION; + newacl->alignment1 = 0; + newacl->alignment2 = const_cpu_to_le16(0); + src = dst = sizeof(ACL); + + selection = (fordir ? CONTAINER_INHERIT_ACE : OBJECT_INHERIT_ACE); + newcnt = 0; + oldcnt = le16_to_cpu(oldacl->ace_count); + for (nace = 0; nace < oldcnt; nace++) { + poldace = (const ACCESS_ALLOWED_ACE*)((const char*)oldacl + src); + acesz = le16_to_cpu(poldace->size); + /* inheritance for access */ + if (poldace->flags & selection) { + pnewace = (ACCESS_ALLOWED_ACE*) + ((char*)newacl + dst); + memcpy(pnewace,poldace,acesz); + /* + * Replace generic creator-owner and + * creator-group by owner and group + */ + if (ntfs_same_sid(&pnewace->sid, ownersid)) { + memcpy(&pnewace->sid, usid, usidsz); + acesz = usidsz + 8; + pnewace->size = cpu_to_le16(acesz); + } + if (ntfs_same_sid(&pnewace->sid, groupsid)) { + memcpy(&pnewace->sid, gsid, gsidsz); + acesz = gsidsz + 8; + pnewace->size = cpu_to_le16(acesz); + } + if (pnewace->mask & GENERIC_ALL) { + pnewace->mask &= ~GENERIC_ALL; + if (fordir) + pnewace->mask |= OWNER_RIGHTS + | DIR_READ + | DIR_WRITE + | DIR_EXEC; + else + /* + * The last flag is not defined for a file, + * however Windows sets it, so do the same + */ + pnewace->mask |= OWNER_RIGHTS + | FILE_READ + | FILE_WRITE + | FILE_EXEC + | cpu_to_le32(0x40); + } + /* remove inheritance flags */ + pnewace->flags &= ~(OBJECT_INHERIT_ACE + | CONTAINER_INHERIT_ACE + | INHERIT_ONLY_ACE); + dst += acesz; + newcnt++; + } + /* inheritance for further inheritance */ + if (fordir + && (poldace->flags + & (CONTAINER_INHERIT_ACE | OBJECT_INHERIT_ACE))) { + pnewace = (ACCESS_ALLOWED_ACE*) + ((char*)newacl + dst); + memcpy(pnewace,poldace,acesz); + /* + * Replace generic creator-owner and + * creator-group by owner and group + */ + if (ntfs_same_sid(&pnewace->sid, ownersid)) { + memcpy(&pnewace->sid, usid, usidsz); + acesz = usidsz + 8; + } + if (ntfs_same_sid(&pnewace->sid, groupsid)) { + memcpy(&pnewace->sid, gsid, gsidsz); + acesz = gsidsz + 8; + } + dst += acesz; + newcnt++; + } + src += acesz; + } + /* + * Adjust header if something was inherited + */ + if (dst > sizeof(ACL)) { + newacl->ace_count = cpu_to_le16(newcnt); + newacl->size = cpu_to_le16(dst); + } else + dst = 0; + return (dst); +} + +#if POSIXACLS + +/* + * Do sanity checks on a Posix descriptor + * Should not be called with a NULL argument + * returns TRUE if considered safe + * if not, error should be logged by caller + */ + +BOOL ntfs_valid_posix(const struct POSIX_SECURITY *pxdesc) +{ + const struct POSIX_ACL *pacl; + int i; + BOOL ok; + u16 tag; + u32 id; + int perms; + struct { + u16 previous; + u32 previousid; + u16 tagsset; + mode_t mode; + int owners; + int groups; + int others; + } checks[2], *pchk; + + for (i=0; i<2; i++) { + checks[i].mode = 0; + checks[i].tagsset = 0; + checks[i].owners = 0; + checks[i].groups = 0; + checks[i].others = 0; + checks[i].previous = 0; + checks[i].previousid = 0; + } + ok = TRUE; + pacl = &pxdesc->acl; + /* + * header (strict for now) + */ + if ((pacl->version != POSIX_VERSION) + || (pacl->flags != 0) + || (pacl->filler != 0)) + ok = FALSE; + /* + * Reject multiple owner, group or other + * but do not require them to be present + * Also check the ACEs are in correct order + * which implies there is no duplicates + */ + for (i=0; i<pxdesc->acccnt + pxdesc->defcnt; i++) { + if (i >= pxdesc->firstdef) + pchk = &checks[1]; + else + pchk = &checks[0]; + perms = pacl->ace[i].perms; + tag = pacl->ace[i].tag; + pchk->tagsset |= tag; + id = pacl->ace[i].id; + if (perms & ~7) ok = FALSE; + if ((tag < pchk->previous) + || ((tag == pchk->previous) + && (id <= pchk->previousid))) + ok = FALSE; + pchk->previous = tag; + pchk->previousid = id; + switch (tag) { + case POSIX_ACL_USER_OBJ : + if (pchk->owners++) + ok = FALSE; + if (id != (u32)-1) + ok = FALSE; + pchk->mode |= perms << 6; + break; + case POSIX_ACL_GROUP_OBJ : + if (pchk->groups++) + ok = FALSE; + if (id != (u32)-1) + ok = FALSE; + pchk->mode = (pchk->mode & 07707) | (perms << 3); + break; + case POSIX_ACL_OTHER : + if (pchk->others++) + ok = FALSE; + if (id != (u32)-1) + ok = FALSE; + pchk->mode |= perms; + break; + case POSIX_ACL_USER : + case POSIX_ACL_GROUP : + if (id == (u32)-1) + ok = FALSE; + break; + case POSIX_ACL_MASK : + if (id != (u32)-1) + ok = FALSE; + pchk->mode = (pchk->mode & 07707) | (perms << 3); + break; + default : + ok = FALSE; + break; + } + } + if ((pxdesc->acccnt > 0) + && ((checks[0].owners != 1) || (checks[0].groups != 1) + || (checks[0].others != 1))) + ok = FALSE; + /* do not check owner, group or other are present in */ + /* the default ACL, Windows does not necessarily set them */ + /* descriptor */ + if (pxdesc->defcnt && (pxdesc->acccnt > pxdesc->firstdef)) + ok = FALSE; + if ((pxdesc->acccnt < 0) || (pxdesc->defcnt < 0)) + ok = FALSE; + /* check mode, unless null or no tag set */ + if (pxdesc->mode + && checks[0].tagsset + && (checks[0].mode != (pxdesc->mode & 0777))) + ok = FALSE; + /* check tagsset */ + if (pxdesc->tagsset != checks[0].tagsset) + ok = FALSE; + return (ok); +} + +/* + * Set standard header data into a Posix ACL + * The mode argument should provide the 3 upper bits of target mode + */ + +static mode_t posix_header(struct POSIX_SECURITY *pxdesc, mode_t basemode) +{ + mode_t mode; + u16 tagsset; + struct POSIX_ACE *pace; + int i; + + mode = basemode & 07000; + tagsset = 0; + for (i=0; i<pxdesc->acccnt; i++) { + pace = &pxdesc->acl.ace[i]; + tagsset |= pace->tag; + switch(pace->tag) { + case POSIX_ACL_USER_OBJ : + mode |= (pace->perms & 7) << 6; + break; + case POSIX_ACL_GROUP_OBJ : + case POSIX_ACL_MASK : + mode = (mode & 07707) | ((pace->perms & 7) << 3); + break; + case POSIX_ACL_OTHER : + mode |= pace->perms & 7; + break; + default : + break; + } + } + pxdesc->tagsset = tagsset; + pxdesc->mode = mode; + pxdesc->acl.version = POSIX_VERSION; + pxdesc->acl.flags = 0; + pxdesc->acl.filler = 0; + return (mode); +} + +/* + * Sort ACEs in a Posix ACL + * This is useful for always getting reusable converted ACLs, + * it also helps in merging ACEs. + * Repeated tag+id are allowed and not merged here. + * + * Tags should be in ascending sequence and for a repeatable tag + * ids should be in ascending sequence. + */ + +void ntfs_sort_posix(struct POSIX_SECURITY *pxdesc) +{ + struct POSIX_ACL *pacl; + struct POSIX_ACE ace; + int i; + int offs; + BOOL done; + u16 tag; + u16 previous; + u32 id; + u32 previousid; + + + /* + * Check sequencing of tag+id in access ACE's + */ + pacl = &pxdesc->acl; + do { + done = TRUE; + previous = pacl->ace[0].tag; + previousid = pacl->ace[0].id; + for (i=1; i<pxdesc->acccnt; i++) { + tag = pacl->ace[i].tag; + id = pacl->ace[i].id; + + if ((tag < previous) + || ((tag == previous) && (id < previousid))) { + done = FALSE; + memcpy(&ace,&pacl->ace[i-1],sizeof(struct POSIX_ACE)); + memcpy(&pacl->ace[i-1],&pacl->ace[i],sizeof(struct POSIX_ACE)); + memcpy(&pacl->ace[i],&ace,sizeof(struct POSIX_ACE)); + } else { + previous = tag; + previousid = id; + } + } + } while (!done); + /* + * Same for default ACEs + */ + do { + done = TRUE; + if ((pxdesc->defcnt) > 1) { + offs = pxdesc->firstdef; + previous = pacl->ace[offs].tag; + previousid = pacl->ace[offs].id; + for (i=offs+1; i<offs+pxdesc->defcnt; i++) { + tag = pacl->ace[i].tag; + id = pacl->ace[i].id; + + if ((tag < previous) + || ((tag == previous) && (id < previousid))) { + done = FALSE; + memcpy(&ace,&pacl->ace[i-1],sizeof(struct POSIX_ACE)); + memcpy(&pacl->ace[i-1],&pacl->ace[i],sizeof(struct POSIX_ACE)); + memcpy(&pacl->ace[i],&ace,sizeof(struct POSIX_ACE)); + } else { + previous = tag; + previousid = id; + } + } + } + } while (!done); +} + +/* + * Merge a new mode into a Posix descriptor + * The Posix descriptor is not reallocated, its size is unchanged + * + * returns 0 if ok + */ + +int ntfs_merge_mode_posix(struct POSIX_SECURITY *pxdesc, mode_t mode) +{ + int i; + BOOL maskfound; + struct POSIX_ACE *pace; + int todo; + + maskfound = FALSE; + todo = POSIX_ACL_USER_OBJ | POSIX_ACL_GROUP_OBJ | POSIX_ACL_OTHER; + for (i=pxdesc->acccnt-1; i>=0; i--) { + pace = &pxdesc->acl.ace[i]; + switch(pace->tag) { + case POSIX_ACL_USER_OBJ : + pace->perms = (mode >> 6) & 7; + todo &= ~POSIX_ACL_USER_OBJ; + break; + case POSIX_ACL_GROUP_OBJ : + if (!maskfound) + pace->perms = (mode >> 3) & 7; + todo &= ~POSIX_ACL_GROUP_OBJ; + break; + case POSIX_ACL_MASK : + pace->perms = (mode >> 3) & 7; + maskfound = TRUE; + break; + case POSIX_ACL_OTHER : + pace->perms = mode & 7; + todo &= ~POSIX_ACL_OTHER; + break; + default : + break; + } + } + pxdesc->mode = mode; + return (todo ? -1 : 0); +} + +/* + * Replace an access or default Posix ACL + * The resulting ACL is checked for validity + * + * Returns a new ACL or NULL if there is a problem + */ + +struct POSIX_SECURITY *ntfs_replace_acl(const struct POSIX_SECURITY *oldpxdesc, + const struct POSIX_ACL *newacl, int count, BOOL deflt) +{ + struct POSIX_SECURITY *newpxdesc; + size_t newsize; + int offset; + int oldoffset; + int i; + + if (deflt) + newsize = sizeof(struct POSIX_SECURITY) + + (oldpxdesc->acccnt + count)*sizeof(struct POSIX_ACE); + else + newsize = sizeof(struct POSIX_SECURITY) + + (oldpxdesc->defcnt + count)*sizeof(struct POSIX_ACE); + newpxdesc = (struct POSIX_SECURITY*)ntfs_malloc(newsize); + if (newpxdesc) { + if (deflt) { + offset = oldpxdesc->acccnt; + newpxdesc->acccnt = oldpxdesc->acccnt; + newpxdesc->defcnt = count; + newpxdesc->firstdef = offset; + /* copy access ACEs */ + for (i=0; i<newpxdesc->acccnt; i++) + newpxdesc->acl.ace[i] = oldpxdesc->acl.ace[i]; + /* copy default ACEs */ + for (i=0; i<count; i++) + newpxdesc->acl.ace[i + offset] = newacl->ace[i]; + } else { + offset = count; + newpxdesc->acccnt = count; + newpxdesc->defcnt = oldpxdesc->defcnt; + newpxdesc->firstdef = count; + /* copy access ACEs */ + for (i=0; i<count; i++) + newpxdesc->acl.ace[i] = newacl->ace[i]; + /* copy default ACEs */ + oldoffset = oldpxdesc->firstdef; + for (i=0; i<newpxdesc->defcnt; i++) + newpxdesc->acl.ace[i + offset] = oldpxdesc->acl.ace[i + oldoffset]; + } + /* assume special flags unchanged */ + posix_header(newpxdesc, oldpxdesc->mode); + if (!ntfs_valid_posix(newpxdesc)) { + /* do not log, this is an application error */ + free(newpxdesc); + newpxdesc = (struct POSIX_SECURITY*)NULL; + errno = EINVAL; + } + } else + errno = ENOMEM; + return (newpxdesc); +} + +/* + * Build an inherited Posix descriptor from parent + * descriptor (if any) restricted to creation mode + * + * Returns the inherited descriptor or NULL if there is a problem + */ + +struct POSIX_SECURITY *ntfs_build_inherited_posix( + const struct POSIX_SECURITY *pxdesc, mode_t mode, + mode_t mask, BOOL isdir) +{ + struct POSIX_SECURITY *pydesc; + struct POSIX_ACE *pyace; + int count; + int defcnt; + int size; + int i; + s16 tagsset; + + if (pxdesc && pxdesc->defcnt) { + if (isdir) + count = 2*pxdesc->defcnt + 3; + else + count = pxdesc->defcnt + 3; + } else + count = 3; + pydesc = (struct POSIX_SECURITY*)ntfs_malloc( + sizeof(struct POSIX_SECURITY) + count*sizeof(struct POSIX_ACE)); + if (pydesc) { + /* + * Copy inherited tags and adapt perms + * Use requested mode, ignoring umask + * (not possible with older versions of fuse) + */ + tagsset = 0; + defcnt = (pxdesc ? pxdesc->defcnt : 0); + for (i=defcnt-1; i>=0; i--) { + pyace = &pydesc->acl.ace[i]; + *pyace = pxdesc->acl.ace[pxdesc->firstdef + i]; + switch (pyace->tag) { + case POSIX_ACL_USER_OBJ : + pyace->perms &= (mode >> 6) & 7; + break; + case POSIX_ACL_GROUP_OBJ : + if (!(tagsset & POSIX_ACL_MASK)) + pyace->perms &= (mode >> 3) & 7; + break; + case POSIX_ACL_OTHER : + pyace->perms &= mode & 7; + break; + case POSIX_ACL_MASK : + pyace->perms &= (mode >> 3) & 7; + break; + default : + break; + } + tagsset |= pyace->tag; + } + pydesc->acccnt = defcnt; + /* + * If some standard tags were missing, append them from mode + * and sort the list + * Here we have to use the umask'ed mode + */ + if (~tagsset & (POSIX_ACL_USER_OBJ + | POSIX_ACL_GROUP_OBJ | POSIX_ACL_OTHER)) { + i = defcnt; + /* owner was missing */ + if (!(tagsset & POSIX_ACL_USER_OBJ)) { + pyace = &pydesc->acl.ace[i]; + pyace->tag = POSIX_ACL_USER_OBJ; + pyace->id = -1; + pyace->perms = ((mode & ~mask) >> 6) & 7; + tagsset |= POSIX_ACL_USER_OBJ; + i++; + } + /* owning group was missing */ + if (!(tagsset & POSIX_ACL_GROUP_OBJ)) { + pyace = &pydesc->acl.ace[i]; + pyace->tag = POSIX_ACL_GROUP_OBJ; + pyace->id = -1; + pyace->perms = ((mode & ~mask) >> 3) & 7; + tagsset |= POSIX_ACL_GROUP_OBJ; + i++; + } + /* other was missing */ + if (!(tagsset & POSIX_ACL_OTHER)) { + pyace = &pydesc->acl.ace[i]; + pyace->tag = POSIX_ACL_OTHER; + pyace->id = -1; + pyace->perms = mode & ~mask & 7; + tagsset |= POSIX_ACL_OTHER; + i++; + } + pydesc->acccnt = i; + pydesc->firstdef = i; + pydesc->defcnt = 0; + ntfs_sort_posix(pydesc); + } + + /* + * append as a default ACL if a directory + */ + pydesc->firstdef = pydesc->acccnt; + if (defcnt && isdir) { + size = sizeof(struct POSIX_ACE)*defcnt; + memcpy(&pydesc->acl.ace[pydesc->firstdef], + &pxdesc->acl.ace[pxdesc->firstdef],size); + pydesc->defcnt = defcnt; + } else { + pydesc->defcnt = 0; + } + /* assume special bits are not inherited */ + posix_header(pydesc, mode & 07000); + if (!ntfs_valid_posix(pydesc)) { + ntfs_log_error("Error building an inherited Posix desc\n"); + errno = EIO; + free(pydesc); + pydesc = (struct POSIX_SECURITY*)NULL; + } + } else + errno = ENOMEM; + return (pydesc); +} + +static int merge_lists_posix(struct POSIX_ACE *targetace, + const struct POSIX_ACE *firstace, + const struct POSIX_ACE *secondace, + int firstcnt, int secondcnt) +{ + int k; + + k = 0; + /* + * No list is exhausted : + * if same tag+id in both list : + * ignore ACE from second list + * else take the one with smaller tag+id + */ + while ((firstcnt > 0) && (secondcnt > 0)) + if ((firstace->tag == secondace->tag) + && (firstace->id == secondace->id)) { + secondace++; + secondcnt--; + } else + if ((firstace->tag < secondace->tag) + || ((firstace->tag == secondace->tag) + && (firstace->id < secondace->id))) { + targetace->tag = firstace->tag; + targetace->id = firstace->id; + targetace->perms = firstace->perms; + firstace++; + targetace++; + firstcnt--; + k++; + } else { + targetace->tag = secondace->tag; + targetace->id = secondace->id; + targetace->perms = secondace->perms; + secondace++; + targetace++; + secondcnt--; + k++; + } + /* + * One list is exhausted, copy the other one + */ + while (firstcnt > 0) { + targetace->tag = firstace->tag; + targetace->id = firstace->id; + targetace->perms = firstace->perms; + firstace++; + targetace++; + firstcnt--; + k++; + } + while (secondcnt > 0) { + targetace->tag = secondace->tag; + targetace->id = secondace->id; + targetace->perms = secondace->perms; + secondace++; + targetace++; + secondcnt--; + k++; + } + return (k); +} + +/* + * Merge two Posix ACLs + * The input ACLs have to be adequately sorted + * + * Returns the merged ACL, which is allocated and has to be freed by caller, + * or NULL if failed + */ + +struct POSIX_SECURITY *ntfs_merge_descr_posix(const struct POSIX_SECURITY *first, + const struct POSIX_SECURITY *second) +{ + struct POSIX_SECURITY *pxdesc; + struct POSIX_ACE *targetace; + const struct POSIX_ACE *firstace; + const struct POSIX_ACE *secondace; + size_t size; + int k; + + size = sizeof(struct POSIX_SECURITY) + + (first->acccnt + first->defcnt + + second->acccnt + second->defcnt)*sizeof(struct POSIX_ACE); + pxdesc = (struct POSIX_SECURITY*)ntfs_malloc(size); + if (pxdesc) { + /* + * merge access ACEs + */ + firstace = first->acl.ace; + secondace = second->acl.ace; + targetace = pxdesc->acl.ace; + k = merge_lists_posix(targetace,firstace,secondace, + first->acccnt,second->acccnt); + pxdesc->acccnt = k; + /* + * merge default ACEs + */ + pxdesc->firstdef = k; + firstace = &first->acl.ace[first->firstdef]; + secondace = &second->acl.ace[second->firstdef]; + targetace = &pxdesc->acl.ace[k]; + k = merge_lists_posix(targetace,firstace,secondace, + first->defcnt,second->defcnt); + pxdesc->defcnt = k; + /* + * build header + */ + pxdesc->acl.version = POSIX_VERSION; + pxdesc->acl.flags = 0; + pxdesc->acl.filler = 0; + pxdesc->mode = 0; + pxdesc->tagsset = 0; + } else + errno = ENOMEM; + return (pxdesc); +} + +struct BUILD_CONTEXT { + BOOL isdir; + BOOL adminowns; + BOOL groupowns; + u16 selfuserperms; + u16 selfgrpperms; + u16 grpperms; + u16 othperms; + u16 mask; + u16 designates; + u16 withmask; + u16 rootspecial; +} ; + + + +static BOOL build_user_denials(ACL *pacl, + const SID *usid, struct MAPPING* const mapping[], + ACE_FLAGS flags, const struct POSIX_ACE *pxace, + struct BUILD_CONTEXT *pset) +{ + BIGSID defsid; + ACCESS_ALLOWED_ACE *pdace; + const SID *sid; + int sidsz; + int pos; + int acecnt; + le32 grants; + le32 denials; + u16 perms; + u16 mixperms; + u16 tag; + BOOL rejected; + BOOL rootuser; + BOOL avoidmask; + + rejected = FALSE; + tag = pxace->tag; + perms = pxace->perms; + rootuser = FALSE; + pos = le16_to_cpu(pacl->size); + acecnt = le16_to_cpu(pacl->ace_count); + avoidmask = (pset->mask == (POSIX_PERM_R | POSIX_PERM_W | POSIX_PERM_X)) + && ((pset->designates && pset->withmask) + || (!pset->designates && !pset->withmask)); + if (tag == POSIX_ACL_USER_OBJ) { + sid = usid; + sidsz = ntfs_sid_size(sid); + grants = OWNER_RIGHTS; + } else { + if (pxace->id) { + sid = NTFS_FIND_USID(mapping[MAPUSERS], + pxace->id, (SID*)&defsid); + grants = WORLD_RIGHTS; + } else { + sid = adminsid; + rootuser = TRUE; + grants = WORLD_RIGHTS & ~ROOT_OWNER_UNMARK; + } + if (sid) { + sidsz = ntfs_sid_size(sid); + /* + * Insert denial of complement of mask for + * each designated user (except root) + * WRITE_OWNER is inserted so that + * the mask can be identified + */ + if (!avoidmask && !rootuser) { + denials = WRITE_OWNER; + pdace = (ACCESS_DENIED_ACE*)&((char*)pacl)[pos]; + if (pset->isdir) { + if (!(pset->mask & POSIX_PERM_X)) + denials |= DIR_EXEC; + if (!(pset->mask & POSIX_PERM_W)) + denials |= DIR_WRITE; + if (!(pset->mask & POSIX_PERM_R)) + denials |= DIR_READ; + } else { + if (!(pset->mask & POSIX_PERM_X)) + denials |= FILE_EXEC; + if (!(pset->mask & POSIX_PERM_W)) + denials |= FILE_WRITE; + if (!(pset->mask & POSIX_PERM_R)) + denials |= FILE_READ; + } + if (rootuser) + grants &= ~ROOT_OWNER_UNMARK; + pdace->type = ACCESS_DENIED_ACE_TYPE; + pdace->flags = flags; + pdace->size = cpu_to_le16(sidsz + 8); + pdace->mask = denials; + memcpy((char*)&pdace->sid, sid, sidsz); + pos += sidsz + 8; + acecnt++; + } + } else + rejected = TRUE; + } + if (!rejected) { + if (pset->isdir) { + if (perms & POSIX_PERM_X) + grants |= DIR_EXEC; + if (perms & POSIX_PERM_W) + grants |= DIR_WRITE; + if (perms & POSIX_PERM_R) + grants |= DIR_READ; + } else { + if (perms & POSIX_PERM_X) + grants |= FILE_EXEC; + if (perms & POSIX_PERM_W) + grants |= FILE_WRITE; + if (perms & POSIX_PERM_R) + grants |= FILE_READ; + } + + /* a possible ACE to deny owner what he/she would */ + /* induely get from administrator, group or world */ + /* unless owner is administrator or group */ + + denials = const_cpu_to_le32(0); + pdace = (ACCESS_DENIED_ACE*)&((char*)pacl)[pos]; + if (!pset->adminowns && !rootuser) { + if (!pset->groupowns) { + mixperms = pset->grpperms | pset->othperms; + if (tag == POSIX_ACL_USER_OBJ) + mixperms |= pset->selfuserperms; + if (pset->isdir) { + if (mixperms & POSIX_PERM_X) + denials |= DIR_EXEC; + if (mixperms & POSIX_PERM_W) + denials |= DIR_WRITE; + if (mixperms & POSIX_PERM_R) + denials |= DIR_READ; + } else { + if (mixperms & POSIX_PERM_X) + denials |= FILE_EXEC; + if (mixperms & POSIX_PERM_W) + denials |= FILE_WRITE; + if (mixperms & POSIX_PERM_R) + denials |= FILE_READ; + } + } else { + mixperms = ~pset->grpperms & pset->othperms; + if (tag == POSIX_ACL_USER_OBJ) + mixperms |= pset->selfuserperms; + if (pset->isdir) { + if (mixperms & POSIX_PERM_X) + denials |= DIR_EXEC; + if (mixperms & POSIX_PERM_W) + denials |= DIR_WRITE; + if (mixperms & POSIX_PERM_R) + denials |= DIR_READ; + } else { + if (mixperms & POSIX_PERM_X) + denials |= FILE_EXEC; + if (mixperms & POSIX_PERM_W) + denials |= FILE_WRITE; + if (mixperms & POSIX_PERM_R) + denials |= FILE_READ; + } + } + denials &= ~grants; + if (denials) { + pdace->type = ACCESS_DENIED_ACE_TYPE; + pdace->flags = flags; + pdace->size = cpu_to_le16(sidsz + 8); + pdace->mask = denials; + memcpy((char*)&pdace->sid, sid, sidsz); + pos += sidsz + 8; + acecnt++; + } + } + } + pacl->size = cpu_to_le16(pos); + pacl->ace_count = cpu_to_le16(acecnt); + return (!rejected); +} + +static BOOL build_user_grants(ACL *pacl, + const SID *usid, struct MAPPING* const mapping[], + ACE_FLAGS flags, const struct POSIX_ACE *pxace, + struct BUILD_CONTEXT *pset) +{ + BIGSID defsid; + ACCESS_ALLOWED_ACE *pgace; + const SID *sid; + int sidsz; + int pos; + int acecnt; + le32 grants; + u16 perms; + u16 tag; + BOOL rejected; + BOOL rootuser; + + rejected = FALSE; + tag = pxace->tag; + perms = pxace->perms; + rootuser = FALSE; + pos = le16_to_cpu(pacl->size); + acecnt = le16_to_cpu(pacl->ace_count); + if (tag == POSIX_ACL_USER_OBJ) { + sid = usid; + sidsz = ntfs_sid_size(sid); + grants = OWNER_RIGHTS; + } else { + if (pxace->id) { + sid = NTFS_FIND_USID(mapping[MAPUSERS], + pxace->id, (SID*)&defsid); + if (sid) + sidsz = ntfs_sid_size(sid); + else + rejected = TRUE; + grants = WORLD_RIGHTS; + } else { + sid = adminsid; + sidsz = ntfs_sid_size(sid); + rootuser = TRUE; + grants = WORLD_RIGHTS & ~ROOT_OWNER_UNMARK; + } + } + if (!rejected) { + if (pset->isdir) { + if (perms & POSIX_PERM_X) + grants |= DIR_EXEC; + if (perms & POSIX_PERM_W) + grants |= DIR_WRITE; + if (perms & POSIX_PERM_R) + grants |= DIR_READ; + } else { + if (perms & POSIX_PERM_X) + grants |= FILE_EXEC; + if (perms & POSIX_PERM_W) + grants |= FILE_WRITE; + if (perms & POSIX_PERM_R) + grants |= FILE_READ; + } + if (rootuser) + grants &= ~ROOT_OWNER_UNMARK; + pgace = (ACCESS_DENIED_ACE*)&((char*)pacl)[pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + pgace->size = cpu_to_le16(sidsz + 8); + pgace->flags = flags; + pgace->mask = grants; + memcpy((char*)&pgace->sid, sid, sidsz); + pos += sidsz + 8; + acecnt = le16_to_cpu(pacl->ace_count) + 1; + pacl->ace_count = cpu_to_le16(acecnt); + pacl->size = cpu_to_le16(pos); + } + return (!rejected); +} + + + /* a grant ACE for group */ + /* unless group-obj has the same rights as world */ + /* but present if group is owner or owner is administrator */ + /* this ACE will be inserted after denials for group */ + +static BOOL build_group_denials_grant(ACL *pacl, + const SID *gsid, struct MAPPING* const mapping[], + ACE_FLAGS flags, const struct POSIX_ACE *pxace, + struct BUILD_CONTEXT *pset) +{ + BIGSID defsid; + ACCESS_ALLOWED_ACE *pdace; + ACCESS_ALLOWED_ACE *pgace; + const SID *sid; + int sidsz; + int pos; + int acecnt; + le32 grants; + le32 denials; + u16 perms; + u16 mixperms; + u16 tag; + BOOL avoidmask; + BOOL rootgroup; + BOOL rejected; + + rejected = FALSE; + tag = pxace->tag; + perms = pxace->perms; + pos = le16_to_cpu(pacl->size); + acecnt = le16_to_cpu(pacl->ace_count); + rootgroup = FALSE; + avoidmask = (pset->mask == (POSIX_PERM_R | POSIX_PERM_W | POSIX_PERM_X)) + && ((pset->designates && pset->withmask) + || (!pset->designates && !pset->withmask)); + if (tag == POSIX_ACL_GROUP_OBJ) + sid = gsid; + else + if (pxace->id) + sid = NTFS_FIND_GSID(mapping[MAPGROUPS], + pxace->id, (SID*)&defsid); + else { + sid = adminsid; + rootgroup = TRUE; + } + if (sid) { + sidsz = ntfs_sid_size(sid); + /* + * Insert denial of complement of mask for + * each group + * WRITE_OWNER is inserted so that + * the mask can be identified + * Note : this mask may lead on Windows to + * deny rights to administrators belonging + * to some user group + */ + if ((!avoidmask && !rootgroup) + || (pset->rootspecial + && (tag == POSIX_ACL_GROUP_OBJ))) { + denials = WRITE_OWNER; + pdace = (ACCESS_DENIED_ACE*)&((char*)pacl)[pos]; + if (pset->isdir) { + if (!(pset->mask & POSIX_PERM_X)) + denials |= DIR_EXEC; + if (!(pset->mask & POSIX_PERM_W)) + denials |= DIR_WRITE; + if (!(pset->mask & POSIX_PERM_R)) + denials |= DIR_READ; + } else { + if (!(pset->mask & POSIX_PERM_X)) + denials |= FILE_EXEC; + if (!(pset->mask & POSIX_PERM_W)) + denials |= FILE_WRITE; + if (!(pset->mask & POSIX_PERM_R)) + denials |= FILE_READ; + } + pdace->type = ACCESS_DENIED_ACE_TYPE; + pdace->flags = flags; + pdace->size = cpu_to_le16(sidsz + 8); + pdace->mask = denials; + memcpy((char*)&pdace->sid, sid, sidsz); + pos += sidsz + 8; + acecnt++; + } + } else + rejected = TRUE; + if (!rejected + && (pset->adminowns + || pset->groupowns + || avoidmask + || rootgroup + || (perms != pset->othperms))) { + grants = WORLD_RIGHTS; + if (rootgroup) + grants &= ~ROOT_GROUP_UNMARK; + if (pset->isdir) { + if (perms & POSIX_PERM_X) + grants |= DIR_EXEC; + if (perms & POSIX_PERM_W) + grants |= DIR_WRITE; + if (perms & POSIX_PERM_R) + grants |= DIR_READ; + } else { + if (perms & POSIX_PERM_X) + grants |= FILE_EXEC; + if (perms & POSIX_PERM_W) + grants |= FILE_WRITE; + if (perms & POSIX_PERM_R) + grants |= FILE_READ; + } + + /* a possible ACE to deny group what it would get from world */ + /* or administrator, unless owner is administrator or group */ + + denials = const_cpu_to_le32(0); + pdace = (ACCESS_DENIED_ACE*)&((char*)pacl)[pos]; + if (!pset->adminowns + && !pset->groupowns + && !rootgroup) { + mixperms = pset->othperms; + if (tag == POSIX_ACL_GROUP_OBJ) + mixperms |= pset->selfgrpperms; + if (pset->isdir) { + if (mixperms & POSIX_PERM_X) + denials |= DIR_EXEC; + if (mixperms & POSIX_PERM_W) + denials |= DIR_WRITE; + if (mixperms & POSIX_PERM_R) + denials |= DIR_READ; + } else { + if (mixperms & POSIX_PERM_X) + denials |= FILE_EXEC; + if (mixperms & POSIX_PERM_W) + denials |= FILE_WRITE; + if (mixperms & POSIX_PERM_R) + denials |= FILE_READ; + } + denials &= ~(grants | OWNER_RIGHTS); + if (denials) { + pdace->type = ACCESS_DENIED_ACE_TYPE; + pdace->flags = flags; + pdace->size = cpu_to_le16(sidsz + 8); + pdace->mask = denials; + memcpy((char*)&pdace->sid, sid, sidsz); + pos += sidsz + 8; + acecnt++; + } + } + + /* now insert grants to group if more than world */ + if (pset->adminowns + || pset->groupowns + || (avoidmask && (pset->designates || pset->withmask)) + || (perms & ~pset->othperms) + || (pset->rootspecial + && (tag == POSIX_ACL_GROUP_OBJ)) + || (tag == POSIX_ACL_GROUP)) { + if (rootgroup) + grants &= ~ROOT_GROUP_UNMARK; + pgace = (ACCESS_DENIED_ACE*)&((char*)pacl)[pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + pgace->flags = flags; + pgace->size = cpu_to_le16(sidsz + 8); + pgace->mask = grants; + memcpy((char*)&pgace->sid, sid, sidsz); + pos += sidsz + 8; + acecnt++; + } + } + pacl->size = cpu_to_le16(pos); + pacl->ace_count = cpu_to_le16(acecnt); + return (!rejected); +} + + +/* + * Build an ACL composed of several ACE's + * returns size of ACL or zero if failed + * + * Three schemes are defined : + * + * 1) if root is neither owner nor group up to 7 ACE's are set up : + * - denials to owner (preventing grants to world or group to apply) + * + mask denials to designated user (unless mask allows all) + * + denials to designated user + * - grants to owner (always present - first grant) + * + grants to designated user + * + mask denial to group (unless mask allows all) + * - denials to group (preventing grants to world to apply) + * - grants to group (unless group has no more than world rights) + * + mask denials to designated group (unless mask allows all) + * + grants to designated group + * + denials to designated group + * - grants to world (unless none) + * - full privileges to administrator, always present + * - full privileges to system, always present + * + * The same scheme is applied for Posix ACLs, with the mask represented + * as denials prepended to grants for designated users and groups + * + * This is inspired by an Internet Draft from Marius Aamodt Eriksen + * for mapping NFSv4 ACLs to Posix ACLs (draft-ietf-nfsv4-acl-mapping-00.txt) + * More recent versions of the draft (draft-ietf-nfsv4-acl-mapping-05.txt) + * are not followed, as they ignore the Posix mask and lead to + * loss of compatibility with Linux implementations on other fs. + * + * Note that denials to group are located after grants to owner. + * This only occurs in the unfrequent situation where world + * has more rights than group and cannot be avoided if owner and other + * have some common right which is denied to group (eg for mode 745 + * executing has to be denied to group, but not to owner or world). + * This rare situation is processed by Windows correctly, but + * Windows utilities may want to change the order, with a + * consequence of applying the group denials to the Windows owner. + * The interpretation on Linux is not affected by the order change. + * + * 2) if root is either owner or group, two problems arise : + * - granting full rights to administrator (as needed to transpose + * to Windows rights bypassing granting to root) would imply + * Linux permissions to always be seen as rwx, no matter the chmod + * - there is no different SID to separate an administrator owner + * from an administrator group. Hence Linux permissions for owner + * would always be similar to permissions to group. + * + * as a work-around, up to 5 ACE's are set up if owner or group : + * - grants to owner, always present at first position + * - grants to group, always present + * - grants to world, unless none + * - full privileges to administrator, always present + * - full privileges to system, always present + * + * On Windows, these ACE's are processed normally, though they + * are redundant (owner, group and administrator are the same, + * as a consequence any denials would damage administrator rights) + * but on Linux, privileges to administrator are ignored (they + * are not needed as root has always full privileges), and + * neither grants to group are applied to owner, nor grants to + * world are applied to owner or group. + * + * 3) finally a similar situation arises when group is owner (they + * have the same SID), but is not root. + * In this situation up to 6 ACE's are set up : + * + * - denials to owner (preventing grants to world to apply) + * - grants to owner (always present) + * - grants to group (unless groups has same rights as world) + * - grants to world (unless none) + * - full privileges to administrator, always present + * - full privileges to system, always present + * + * On Windows, these ACE's are processed normally, though they + * are redundant (as owner and group are the same), but this has + * no impact on administrator rights + * + * Special flags (S_ISVTX, S_ISGID, S_ISUID) : + * an extra null ACE is inserted to hold these flags, using + * the same conventions as cygwin. + * + */ + +static int buildacls_posix(struct MAPPING* const mapping[], + char *secattr, int offs, const struct POSIX_SECURITY *pxdesc, + int isdir, const SID *usid, const SID *gsid) +{ + struct BUILD_CONTEXT aceset[2], *pset; + BOOL adminowns; + BOOL groupowns; + ACL *pacl; + ACCESS_ALLOWED_ACE *pgace; + ACCESS_ALLOWED_ACE *pdace; + const struct POSIX_ACE *pxace; + BOOL ok; + mode_t mode; + u16 tag; + u16 perms; + ACE_FLAGS flags; + int pos; + int i; + int k; + BIGSID defsid; + const SID *sid; + int acecnt; + int usidsz; + int gsidsz; + int wsidsz; + int asidsz; + int ssidsz; + int nsidsz; + le32 grants; + + usidsz = ntfs_sid_size(usid); + gsidsz = ntfs_sid_size(gsid); + wsidsz = ntfs_sid_size(worldsid); + asidsz = ntfs_sid_size(adminsid); + ssidsz = ntfs_sid_size(systemsid); + mode = pxdesc->mode; + /* adminowns and groupowns are used for both lists */ + adminowns = ntfs_same_sid(usid, adminsid) + || ntfs_same_sid(gsid, adminsid); + groupowns = !adminowns && ntfs_same_sid(usid, gsid); + + ok = TRUE; + + /* ACL header */ + pacl = (ACL*)&secattr[offs]; + pacl->revision = ACL_REVISION; + pacl->alignment1 = 0; + pacl->size = cpu_to_le16(sizeof(ACL) + usidsz + 8); + pacl->ace_count = const_cpu_to_le16(0); + pacl->alignment2 = const_cpu_to_le16(0); + + /* + * Determine what is allowed to some group or world + * to prevent designated users or other groups to get + * rights from groups or world + * Do the same if owner and group appear as designated + * user or group + * Also get global mask + */ + for (k=0; k<2; k++) { + pset = &aceset[k]; + pset->selfuserperms = 0; + pset->selfgrpperms = 0; + pset->grpperms = 0; + pset->othperms = 0; + pset->mask = (POSIX_PERM_R | POSIX_PERM_W | POSIX_PERM_X); + pset->designates = 0; + pset->withmask = 0; + pset->rootspecial = 0; + pset->adminowns = adminowns; + pset->groupowns = groupowns; + pset->isdir = isdir; + } + + for (i=pxdesc->acccnt+pxdesc->defcnt-1; i>=0; i--) { + if (i >= pxdesc->acccnt) { + pset = &aceset[1]; + pxace = &pxdesc->acl.ace[i + pxdesc->firstdef - pxdesc->acccnt]; + } else { + pset = &aceset[0]; + pxace = &pxdesc->acl.ace[i]; + } + switch (pxace->tag) { + case POSIX_ACL_USER : + pset->designates++; + if (pxace->id) { + sid = NTFS_FIND_USID(mapping[MAPUSERS], + pxace->id, (SID*)&defsid); + if (sid && ntfs_same_sid(sid,usid)) + pset->selfuserperms |= pxace->perms; + } else + /* root as designated user is processed apart */ + pset->rootspecial = TRUE; + break; + case POSIX_ACL_GROUP : + pset->designates++; + if (pxace->id) { + sid = NTFS_FIND_GSID(mapping[MAPUSERS], + pxace->id, (SID*)&defsid); + if (sid && ntfs_same_sid(sid,gsid)) + pset->selfgrpperms |= pxace->perms; + } else + /* root as designated group is processed apart */ + pset->rootspecial = TRUE; + /* fall through */ + case POSIX_ACL_GROUP_OBJ : + pset->grpperms |= pxace->perms; + break; + case POSIX_ACL_OTHER : + pset->othperms = pxace->perms; + break; + case POSIX_ACL_MASK : + pset->withmask++; + pset->mask = pxace->perms; + default : + break; + } + } + +if (pxdesc->defcnt && (pxdesc->firstdef != pxdesc->acccnt)) { +ntfs_log_error("** error : access and default not consecutive\n"); +return (0); +} + /* + * First insert all denials for owner and each + * designated user (with mask if needed) + */ + + pacl->ace_count = const_cpu_to_le16(0); + pacl->size = const_cpu_to_le16(sizeof(ACL)); + for (i=0; (i<(pxdesc->acccnt + pxdesc->defcnt)) && ok; i++) { + if (i >= pxdesc->acccnt) { + flags = INHERIT_ONLY_ACE + | OBJECT_INHERIT_ACE | CONTAINER_INHERIT_ACE; + pset = &aceset[1]; + pxace = &pxdesc->acl.ace[i + pxdesc->firstdef - pxdesc->acccnt]; + } else { + if (pxdesc->defcnt) + flags = NO_PROPAGATE_INHERIT_ACE; + else + flags = (isdir ? DIR_INHERITANCE + : FILE_INHERITANCE); + pset = &aceset[0]; + pxace = &pxdesc->acl.ace[i]; + } + tag = pxace->tag; + perms = pxace->perms; + switch (tag) { + + /* insert denial ACEs for each owner or allowed user */ + + case POSIX_ACL_USER : + case POSIX_ACL_USER_OBJ : + + ok = build_user_denials(pacl, + usid, mapping, flags, pxace, pset); + break; + default : + break; + } + } + + /* + * for directories, insert a world execution denial + * inherited to plain files. + * This is to prevent Windows from granting execution + * of files through inheritance from parent directory + */ + + if (isdir && ok) { + pos = le16_to_cpu(pacl->size); + pdace = (ACCESS_DENIED_ACE*) &secattr[offs + pos]; + pdace->type = ACCESS_DENIED_ACE_TYPE; + pdace->flags = INHERIT_ONLY_ACE | OBJECT_INHERIT_ACE; + pdace->size = cpu_to_le16(wsidsz + 8); + pdace->mask = FILE_EXEC; + memcpy((char*)&pdace->sid, worldsid, wsidsz); + pos += wsidsz + 8; + acecnt = le16_to_cpu(pacl->ace_count) + 1; + pacl->ace_count = cpu_to_le16(acecnt); + pacl->size = cpu_to_le16(pos); + } + + /* + * now insert (if needed) + * - grants to owner and designated users + * - mask and denials for all groups + * - grants to other + */ + + for (i=0; (i<(pxdesc->acccnt + pxdesc->defcnt)) && ok; i++) { + if (i >= pxdesc->acccnt) { + flags = INHERIT_ONLY_ACE + | OBJECT_INHERIT_ACE | CONTAINER_INHERIT_ACE; + pset = &aceset[1]; + pxace = &pxdesc->acl.ace[i + pxdesc->firstdef - pxdesc->acccnt]; + } else { + if (pxdesc->defcnt) + flags = NO_PROPAGATE_INHERIT_ACE; + else + flags = (isdir ? DIR_INHERITANCE + : FILE_INHERITANCE); + pset = &aceset[0]; + pxace = &pxdesc->acl.ace[i]; + } + tag = pxace->tag; + perms = pxace->perms; + switch (tag) { + + /* ACE for each owner or allowed user */ + + case POSIX_ACL_USER : + case POSIX_ACL_USER_OBJ : + ok = build_user_grants(pacl,usid, + mapping,flags,pxace,pset); + break; + + case POSIX_ACL_GROUP : + case POSIX_ACL_GROUP_OBJ : + + /* denials and grants for groups */ + + ok = build_group_denials_grant(pacl,gsid, + mapping,flags,pxace,pset); + break; + + case POSIX_ACL_OTHER : + + /* grants for other users */ + + pos = le16_to_cpu(pacl->size); + pgace = (ACCESS_ALLOWED_ACE*)&secattr[offs + pos]; + grants = WORLD_RIGHTS; + if (isdir) { + if (perms & POSIX_PERM_X) + grants |= DIR_EXEC; + if (perms & POSIX_PERM_W) + grants |= DIR_WRITE; + if (perms & POSIX_PERM_R) + grants |= DIR_READ; + } else { + if (perms & POSIX_PERM_X) + grants |= FILE_EXEC; + if (perms & POSIX_PERM_W) + grants |= FILE_WRITE; + if (perms & POSIX_PERM_R) + grants |= FILE_READ; + } + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + pgace->flags = flags; + pgace->size = cpu_to_le16(wsidsz + 8); + pgace->mask = grants; + memcpy((char*)&pgace->sid, worldsid, wsidsz); + pos += wsidsz + 8; + acecnt = le16_to_cpu(pacl->ace_count) + 1; + pacl->ace_count = cpu_to_le16(acecnt); + pacl->size = cpu_to_le16(pos); + break; + } + } + + if (!ok) { + errno = EINVAL; + pos = 0; + } else { + /* an ACE for administrators */ + /* always full access */ + + pos = le16_to_cpu(pacl->size); + acecnt = le16_to_cpu(pacl->ace_count); + if (isdir) + flags = OBJECT_INHERIT_ACE + | CONTAINER_INHERIT_ACE; + else + flags = NO_PROPAGATE_INHERIT_ACE; + pgace = (ACCESS_ALLOWED_ACE*)&secattr[offs + pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + pgace->flags = flags; + pgace->size = cpu_to_le16(asidsz + 8); + grants = OWNER_RIGHTS | FILE_READ | FILE_WRITE | FILE_EXEC; + pgace->mask = grants; + memcpy((char*)&pgace->sid, adminsid, asidsz); + pos += asidsz + 8; + acecnt++; + + /* an ACE for system (needed ?) */ + /* always full access */ + + pgace = (ACCESS_ALLOWED_ACE*)&secattr[offs + pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + pgace->flags = flags; + pgace->size = cpu_to_le16(ssidsz + 8); + grants = OWNER_RIGHTS | FILE_READ | FILE_WRITE | FILE_EXEC; + pgace->mask = grants; + memcpy((char*)&pgace->sid, systemsid, ssidsz); + pos += ssidsz + 8; + acecnt++; + + /* a null ACE to hold special flags */ + /* using the same representation as cygwin */ + + if (mode & (S_ISVTX | S_ISGID | S_ISUID)) { + nsidsz = ntfs_sid_size(nullsid); + pgace = (ACCESS_ALLOWED_ACE*)&secattr[offs + pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + pgace->flags = NO_PROPAGATE_INHERIT_ACE; + pgace->size = cpu_to_le16(nsidsz + 8); + grants = const_cpu_to_le32(0); + if (mode & S_ISUID) + grants |= FILE_APPEND_DATA; + if (mode & S_ISGID) + grants |= FILE_WRITE_DATA; + if (mode & S_ISVTX) + grants |= FILE_READ_DATA; + pgace->mask = grants; + memcpy((char*)&pgace->sid, nullsid, nsidsz); + pos += nsidsz + 8; + acecnt++; + } + + /* fix ACL header */ + pacl->size = cpu_to_le16(pos); + pacl->ace_count = cpu_to_le16(acecnt); + } + return (ok ? pos : 0); +} + +#endif /* POSIXACLS */ + +static int buildacls(char *secattr, int offs, mode_t mode, int isdir, + const SID * usid, const SID * gsid) +{ + ACL *pacl; + ACCESS_ALLOWED_ACE *pgace; + ACCESS_ALLOWED_ACE *pdace; + BOOL adminowns; + BOOL groupowns; + ACE_FLAGS gflags; + int pos; + int acecnt; + int usidsz; + int gsidsz; + int wsidsz; + int asidsz; + int ssidsz; + int nsidsz; + le32 grants; + le32 denials; + + usidsz = ntfs_sid_size(usid); + gsidsz = ntfs_sid_size(gsid); + wsidsz = ntfs_sid_size(worldsid); + asidsz = ntfs_sid_size(adminsid); + ssidsz = ntfs_sid_size(systemsid); + adminowns = ntfs_same_sid(usid, adminsid) + || ntfs_same_sid(gsid, adminsid); + groupowns = !adminowns && ntfs_same_sid(usid, gsid); + + /* ACL header */ + pacl = (ACL*)&secattr[offs]; + pacl->revision = ACL_REVISION; + pacl->alignment1 = 0; + pacl->size = cpu_to_le16(sizeof(ACL) + usidsz + 8); + pacl->ace_count = const_cpu_to_le16(1); + pacl->alignment2 = const_cpu_to_le16(0); + pos = sizeof(ACL); + acecnt = 0; + + /* compute a grant ACE for owner */ + /* this ACE will be inserted after denial for owner */ + + grants = OWNER_RIGHTS; + if (isdir) { + gflags = DIR_INHERITANCE; + if (mode & S_IXUSR) + grants |= DIR_EXEC; + if (mode & S_IWUSR) + grants |= DIR_WRITE; + if (mode & S_IRUSR) + grants |= DIR_READ; + } else { + gflags = FILE_INHERITANCE; + if (mode & S_IXUSR) + grants |= FILE_EXEC; + if (mode & S_IWUSR) + grants |= FILE_WRITE; + if (mode & S_IRUSR) + grants |= FILE_READ; + } + + /* a possible ACE to deny owner what he/she would */ + /* induely get from administrator, group or world */ + /* unless owner is administrator or group */ + + denials = const_cpu_to_le32(0); + pdace = (ACCESS_DENIED_ACE*) &secattr[offs + pos]; + if (!adminowns) { + if (!groupowns) { + if (isdir) { + pdace->flags = DIR_INHERITANCE; + if (mode & (S_IXGRP | S_IXOTH)) + denials |= DIR_EXEC; + if (mode & (S_IWGRP | S_IWOTH)) + denials |= DIR_WRITE; + if (mode & (S_IRGRP | S_IROTH)) + denials |= DIR_READ; + } else { + pdace->flags = FILE_INHERITANCE; + if (mode & (S_IXGRP | S_IXOTH)) + denials |= FILE_EXEC; + if (mode & (S_IWGRP | S_IWOTH)) + denials |= FILE_WRITE; + if (mode & (S_IRGRP | S_IROTH)) + denials |= FILE_READ; + } + } else { + if (isdir) { + pdace->flags = DIR_INHERITANCE; + if ((mode & S_IXOTH) && !(mode & S_IXGRP)) + denials |= DIR_EXEC; + if ((mode & S_IWOTH) && !(mode & S_IWGRP)) + denials |= DIR_WRITE; + if ((mode & S_IROTH) && !(mode & S_IRGRP)) + denials |= DIR_READ; + } else { + pdace->flags = FILE_INHERITANCE; + if ((mode & S_IXOTH) && !(mode & S_IXGRP)) + denials |= FILE_EXEC; + if ((mode & S_IWOTH) && !(mode & S_IWGRP)) + denials |= FILE_WRITE; + if ((mode & S_IROTH) && !(mode & S_IRGRP)) + denials |= FILE_READ; + } + } + denials &= ~grants; + if (denials) { + pdace->type = ACCESS_DENIED_ACE_TYPE; + pdace->size = cpu_to_le16(usidsz + 8); + pdace->mask = denials; + memcpy((char*)&pdace->sid, usid, usidsz); + pos += usidsz + 8; + acecnt++; + } + } + /* + * for directories, a world execution denial + * inherited to plain files + */ + + if (isdir) { + pdace = (ACCESS_DENIED_ACE*) &secattr[offs + pos]; + pdace->type = ACCESS_DENIED_ACE_TYPE; + pdace->flags = INHERIT_ONLY_ACE | OBJECT_INHERIT_ACE; + pdace->size = cpu_to_le16(wsidsz + 8); + pdace->mask = FILE_EXEC; + memcpy((char*)&pdace->sid, worldsid, wsidsz); + pos += wsidsz + 8; + acecnt++; + } + + + /* now insert grants to owner */ + pgace = (ACCESS_ALLOWED_ACE*) &secattr[offs + pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + pgace->size = cpu_to_le16(usidsz + 8); + pgace->flags = gflags; + pgace->mask = grants; + memcpy((char*)&pgace->sid, usid, usidsz); + pos += usidsz + 8; + acecnt++; + + /* a grant ACE for group */ + /* unless group has the same rights as world */ + /* but present if group is owner or owner is administrator */ + /* this ACE will be inserted after denials for group */ + + if (adminowns + || groupowns + || (((mode >> 3) ^ mode) & 7)) { + grants = WORLD_RIGHTS; + if (isdir) { + gflags = DIR_INHERITANCE; + if (mode & S_IXGRP) + grants |= DIR_EXEC; + if (mode & S_IWGRP) + grants |= DIR_WRITE; + if (mode & S_IRGRP) + grants |= DIR_READ; + } else { + gflags = FILE_INHERITANCE; + if (mode & S_IXGRP) + grants |= FILE_EXEC; + if (mode & S_IWGRP) + grants |= FILE_WRITE; + if (mode & S_IRGRP) + grants |= FILE_READ; + } + + /* a possible ACE to deny group what it would get from world */ + /* or administrator, unless owner is administrator or group */ + + denials = const_cpu_to_le32(0); + pdace = (ACCESS_ALLOWED_ACE*)&secattr[offs + pos]; + if (!adminowns && !groupowns) { + if (isdir) { + pdace->flags = DIR_INHERITANCE; + if (mode & S_IXOTH) + denials |= DIR_EXEC; + if (mode & S_IWOTH) + denials |= DIR_WRITE; + if (mode & S_IROTH) + denials |= DIR_READ; + } else { + pdace->flags = FILE_INHERITANCE; + if (mode & S_IXOTH) + denials |= FILE_EXEC; + if (mode & S_IWOTH) + denials |= FILE_WRITE; + if (mode & S_IROTH) + denials |= FILE_READ; + } + denials &= ~(grants | OWNER_RIGHTS); + if (denials) { + pdace->type = ACCESS_DENIED_ACE_TYPE; + pdace->size = cpu_to_le16(gsidsz + 8); + pdace->mask = denials; + memcpy((char*)&pdace->sid, gsid, gsidsz); + pos += gsidsz + 8; + acecnt++; + } + } + + if (adminowns + || groupowns + || ((mode >> 3) & ~mode & 7)) { + /* now insert grants to group */ + /* if more rights than other */ + pgace = (ACCESS_ALLOWED_ACE*)&secattr[offs + pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + pgace->flags = gflags; + pgace->size = cpu_to_le16(gsidsz + 8); + pgace->mask = grants; + memcpy((char*)&pgace->sid, gsid, gsidsz); + pos += gsidsz + 8; + acecnt++; + } + } + + /* an ACE for world users */ + + pgace = (ACCESS_ALLOWED_ACE*)&secattr[offs + pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + grants = WORLD_RIGHTS; + if (isdir) { + pgace->flags = DIR_INHERITANCE; + if (mode & S_IXOTH) + grants |= DIR_EXEC; + if (mode & S_IWOTH) + grants |= DIR_WRITE; + if (mode & S_IROTH) + grants |= DIR_READ; + } else { + pgace->flags = FILE_INHERITANCE; + if (mode & S_IXOTH) + grants |= FILE_EXEC; + if (mode & S_IWOTH) + grants |= FILE_WRITE; + if (mode & S_IROTH) + grants |= FILE_READ; + } + pgace->size = cpu_to_le16(wsidsz + 8); + pgace->mask = grants; + memcpy((char*)&pgace->sid, worldsid, wsidsz); + pos += wsidsz + 8; + acecnt++; + + /* an ACE for administrators */ + /* always full access */ + + pgace = (ACCESS_ALLOWED_ACE*)&secattr[offs + pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + if (isdir) + pgace->flags = DIR_INHERITANCE; + else + pgace->flags = FILE_INHERITANCE; + pgace->size = cpu_to_le16(asidsz + 8); + grants = OWNER_RIGHTS | FILE_READ | FILE_WRITE | FILE_EXEC; + pgace->mask = grants; + memcpy((char*)&pgace->sid, adminsid, asidsz); + pos += asidsz + 8; + acecnt++; + + /* an ACE for system (needed ?) */ + /* always full access */ + + pgace = (ACCESS_ALLOWED_ACE*)&secattr[offs + pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + if (isdir) + pgace->flags = DIR_INHERITANCE; + else + pgace->flags = FILE_INHERITANCE; + pgace->size = cpu_to_le16(ssidsz + 8); + grants = OWNER_RIGHTS | FILE_READ | FILE_WRITE | FILE_EXEC; + pgace->mask = grants; + memcpy((char*)&pgace->sid, systemsid, ssidsz); + pos += ssidsz + 8; + acecnt++; + + /* a null ACE to hold special flags */ + /* using the same representation as cygwin */ + + if (mode & (S_ISVTX | S_ISGID | S_ISUID)) { + nsidsz = ntfs_sid_size(nullsid); + pgace = (ACCESS_ALLOWED_ACE*)&secattr[offs + pos]; + pgace->type = ACCESS_ALLOWED_ACE_TYPE; + pgace->flags = NO_PROPAGATE_INHERIT_ACE; + pgace->size = cpu_to_le16(nsidsz + 8); + grants = const_cpu_to_le32(0); + if (mode & S_ISUID) + grants |= FILE_APPEND_DATA; + if (mode & S_ISGID) + grants |= FILE_WRITE_DATA; + if (mode & S_ISVTX) + grants |= FILE_READ_DATA; + pgace->mask = grants; + memcpy((char*)&pgace->sid, nullsid, nsidsz); + pos += nsidsz + 8; + acecnt++; + } + + /* fix ACL header */ + pacl->size = cpu_to_le16(pos); + pacl->ace_count = cpu_to_le16(acecnt); + return (pos); +} + +#if POSIXACLS + +/* + * Build a full security descriptor from a Posix ACL + * returns descriptor in allocated memory, must free() after use + */ + +char *ntfs_build_descr_posix(struct MAPPING* const mapping[], + struct POSIX_SECURITY *pxdesc, + int isdir, const SID *usid, const SID *gsid) +{ + int newattrsz; + SECURITY_DESCRIPTOR_RELATIVE *pnhead; + char *newattr; + int aclsz; + int usidsz; + int gsidsz; + int wsidsz; + int asidsz; + int ssidsz; + int k; + + usidsz = ntfs_sid_size(usid); + gsidsz = ntfs_sid_size(gsid); + wsidsz = ntfs_sid_size(worldsid); + asidsz = ntfs_sid_size(adminsid); + ssidsz = ntfs_sid_size(systemsid); + + /* allocate enough space for the new security attribute */ + newattrsz = sizeof(SECURITY_DESCRIPTOR_RELATIVE) /* header */ + + usidsz + gsidsz /* usid and gsid */ + + sizeof(ACL) /* acl header */ + + 2*(8 + usidsz) /* two possible ACE for user */ + + 3*(8 + gsidsz) /* three possible ACE for group and mask */ + + 8 + wsidsz /* one ACE for world */ + + 8 + asidsz /* one ACE for admin */ + + 8 + ssidsz; /* one ACE for system */ + if (isdir) /* a world denial for directories */ + newattrsz += 8 + wsidsz; + if (pxdesc->mode & 07000) /* a NULL ACE for special modes */ + newattrsz += 8 + ntfs_sid_size(nullsid); + /* account for non-owning users and groups */ + for (k=0; k<pxdesc->acccnt; k++) { + if ((pxdesc->acl.ace[k].tag == POSIX_ACL_USER) + || (pxdesc->acl.ace[k].tag == POSIX_ACL_GROUP)) + newattrsz += 3*40; /* fixme : maximum size */ + } + /* account for default ACE's */ + newattrsz += 2*40*pxdesc->defcnt; /* fixme : maximum size */ + newattr = (char*)ntfs_malloc(newattrsz); + if (newattr) { + /* build the main header part */ + pnhead = (SECURITY_DESCRIPTOR_RELATIVE*)newattr; + pnhead->revision = SECURITY_DESCRIPTOR_REVISION; + pnhead->alignment = 0; + /* + * The flag SE_DACL_PROTECTED prevents the ACL + * to be changed in an inheritance after creation + */ + pnhead->control = SE_DACL_PRESENT | SE_DACL_PROTECTED + | SE_SELF_RELATIVE; + /* + * Windows prefers ACL first, do the same to + * get the same hash value and avoid duplication + */ + /* build permissions */ + aclsz = buildacls_posix(mapping,newattr, + sizeof(SECURITY_DESCRIPTOR_RELATIVE), + pxdesc, isdir, usid, gsid); + if (aclsz && ((int)(sizeof(SECURITY_DESCRIPTOR_RELATIVE) + + aclsz + usidsz + gsidsz) <= newattrsz)) { + /* append usid and gsid */ + memcpy(&newattr[sizeof(SECURITY_DESCRIPTOR_RELATIVE) + + aclsz], usid, usidsz); + memcpy(&newattr[sizeof(SECURITY_DESCRIPTOR_RELATIVE) + + aclsz + usidsz], gsid, gsidsz); + /* positions of ACL, USID and GSID into header */ + pnhead->owner = + cpu_to_le32(sizeof(SECURITY_DESCRIPTOR_RELATIVE) + + aclsz); + pnhead->group = + cpu_to_le32(sizeof(SECURITY_DESCRIPTOR_RELATIVE) + + aclsz + usidsz); + pnhead->sacl = const_cpu_to_le32(0); + pnhead->dacl = + const_cpu_to_le32(sizeof(SECURITY_DESCRIPTOR_RELATIVE)); + } else { + /* ACL failure (errno set) or overflow */ + free(newattr); + newattr = (char*)NULL; + if (aclsz) { + /* hope error was detected before overflowing */ + ntfs_log_error("Security descriptor is longer than expected\n"); + errno = EIO; + } + } + } else + errno = ENOMEM; + return (newattr); +} + +#endif /* POSIXACLS */ + +/* + * Build a full security descriptor + * returns descriptor in allocated memory, must free() after use + */ + +char *ntfs_build_descr(mode_t mode, + int isdir, const SID * usid, const SID * gsid) +{ + int newattrsz; + SECURITY_DESCRIPTOR_RELATIVE *pnhead; + char *newattr; + int aclsz; + int usidsz; + int gsidsz; + int wsidsz; + int asidsz; + int ssidsz; + + usidsz = ntfs_sid_size(usid); + gsidsz = ntfs_sid_size(gsid); + wsidsz = ntfs_sid_size(worldsid); + asidsz = ntfs_sid_size(adminsid); + ssidsz = ntfs_sid_size(systemsid); + + /* allocate enough space for the new security attribute */ + newattrsz = sizeof(SECURITY_DESCRIPTOR_RELATIVE) /* header */ + + usidsz + gsidsz /* usid and gsid */ + + sizeof(ACL) /* acl header */ + + 2*(8 + usidsz) /* two possible ACE for user */ + + 2*(8 + gsidsz) /* two possible ACE for group */ + + 8 + wsidsz /* one ACE for world */ + + 8 + asidsz /* one ACE for admin */ + + 8 + ssidsz; /* one ACE for system */ + if (isdir) /* a world denial for directories */ + newattrsz += 8 + wsidsz; + if (mode & 07000) /* a NULL ACE for special modes */ + newattrsz += 8 + ntfs_sid_size(nullsid); + newattr = (char*)ntfs_malloc(newattrsz); + if (newattr) { + /* build the main header part */ + pnhead = (SECURITY_DESCRIPTOR_RELATIVE*) newattr; + pnhead->revision = SECURITY_DESCRIPTOR_REVISION; + pnhead->alignment = 0; + /* + * The flag SE_DACL_PROTECTED prevents the ACL + * to be changed in an inheritance after creation + */ + pnhead->control = SE_DACL_PRESENT | SE_DACL_PROTECTED + | SE_SELF_RELATIVE; + /* + * Windows prefers ACL first, do the same to + * get the same hash value and avoid duplication + */ + /* build permissions */ + aclsz = buildacls(newattr, + sizeof(SECURITY_DESCRIPTOR_RELATIVE), + mode, isdir, usid, gsid); + if (((int)sizeof(SECURITY_DESCRIPTOR_RELATIVE) + + aclsz + usidsz + gsidsz) <= newattrsz) { + /* append usid and gsid */ + memcpy(&newattr[sizeof(SECURITY_DESCRIPTOR_RELATIVE) + + aclsz], usid, usidsz); + memcpy(&newattr[sizeof(SECURITY_DESCRIPTOR_RELATIVE) + + aclsz + usidsz], gsid, gsidsz); + /* positions of ACL, USID and GSID into header */ + pnhead->owner = + cpu_to_le32(sizeof(SECURITY_DESCRIPTOR_RELATIVE) + + aclsz); + pnhead->group = + cpu_to_le32(sizeof(SECURITY_DESCRIPTOR_RELATIVE) + + aclsz + usidsz); + pnhead->sacl = const_cpu_to_le32(0); + pnhead->dacl = + const_cpu_to_le32(sizeof(SECURITY_DESCRIPTOR_RELATIVE)); + } else { + /* hope error was detected before overflowing */ + free(newattr); + newattr = (char*)NULL; + ntfs_log_error("Security descriptor is longer than expected\n"); + errno = EIO; + } + } else + errno = ENOMEM; + return (newattr); +} + +/* + * Create a mode_t permission set + * from owner, group and world grants as represented in ACEs + */ + +static int merge_permissions(BOOL isdir, + le32 owner, le32 group, le32 world, le32 special) + +{ + int perm; + + perm = 0; + /* build owner permission */ + if (owner) { + if (isdir) { + /* exec if any of list, traverse */ + if (owner & DIR_GEXEC) + perm |= S_IXUSR; + /* write if any of addfile, adddir, delchild */ + if (owner & DIR_GWRITE) + perm |= S_IWUSR; + /* read if any of list */ + if (owner & DIR_GREAD) + perm |= S_IRUSR; + } else { + /* exec if execute or generic execute */ + if (owner & FILE_GEXEC) + perm |= S_IXUSR; + /* write if any of writedata or generic write */ + if (owner & FILE_GWRITE) + perm |= S_IWUSR; + /* read if any of readdata or generic read */ + if (owner & FILE_GREAD) + perm |= S_IRUSR; + } + } + /* build group permission */ + if (group) { + if (isdir) { + /* exec if any of list, traverse */ + if (group & DIR_GEXEC) + perm |= S_IXGRP; + /* write if any of addfile, adddir, delchild */ + if (group & DIR_GWRITE) + perm |= S_IWGRP; + /* read if any of list */ + if (group & DIR_GREAD) + perm |= S_IRGRP; + } else { + /* exec if execute */ + if (group & FILE_GEXEC) + perm |= S_IXGRP; + /* write if any of writedata, appenddata */ + if (group & FILE_GWRITE) + perm |= S_IWGRP; + /* read if any of readdata */ + if (group & FILE_GREAD) + perm |= S_IRGRP; + } + } + /* build world permission */ + if (world) { + if (isdir) { + /* exec if any of list, traverse */ + if (world & DIR_GEXEC) + perm |= S_IXOTH; + /* write if any of addfile, adddir, delchild */ + if (world & DIR_GWRITE) + perm |= S_IWOTH; + /* read if any of list */ + if (world & DIR_GREAD) + perm |= S_IROTH; + } else { + /* exec if execute */ + if (world & FILE_GEXEC) + perm |= S_IXOTH; + /* write if any of writedata, appenddata */ + if (world & FILE_GWRITE) + perm |= S_IWOTH; + /* read if any of readdata */ + if (world & FILE_GREAD) + perm |= S_IROTH; + } + } + /* build special permission flags */ + if (special) { + if (special & FILE_APPEND_DATA) + perm |= S_ISUID; + if (special & FILE_WRITE_DATA) + perm |= S_ISGID; + if (special & FILE_READ_DATA) + perm |= S_ISVTX; + } + return (perm); +} + +#if POSIXACLS + +/* + * Normalize a Posix ACL either from a sorted raw set of + * access ACEs or default ACEs + * (standard case : different owner, group and administrator) + */ + +static int norm_std_permissions_posix(struct POSIX_SECURITY *posix_desc, + BOOL groupowns, int start, int count, int target) +{ + int j,k; + s32 id; + u16 tag; + u16 tagsset; + struct POSIX_ACE *pxace; + mode_t grantgrps; + mode_t grantwrld; + mode_t denywrld; + mode_t allow; + mode_t deny; + mode_t perms; + mode_t mode; + + mode = 0; + tagsset = 0; + /* + * Determine what is granted to some group or world + * Also get denials to world which are meant to prevent + * execution flags to be inherited by plain files + */ + pxace = posix_desc->acl.ace; + grantgrps = 0; + grantwrld = 0; + denywrld = 0; + for (j=start; j<(start + count); j++) { + if (pxace[j].perms & POSIX_PERM_DENIAL) { + /* deny world exec unless for default */ + if ((pxace[j].tag == POSIX_ACL_OTHER) + && !start) + denywrld = pxace[j].perms; + } else { + switch (pxace[j].tag) { + case POSIX_ACL_GROUP_OBJ : + grantgrps |= pxace[j].perms; + break; + case POSIX_ACL_GROUP : + if (pxace[j].id) + grantgrps |= pxace[j].perms; + break; + case POSIX_ACL_OTHER : + grantwrld = pxace[j].perms; + break; + default : + break; + } + } + } + /* + * Collect groups of ACEs related to the same id + * and determine what is granted and what is denied. + * It is important the ACEs have been sorted + */ + j = start; + k = target; + while (j < (start + count)) { + tag = pxace[j].tag; + id = pxace[j].id; + if (pxace[j].perms & POSIX_PERM_DENIAL) { + deny = pxace[j].perms | denywrld; + allow = 0; + } else { + deny = denywrld; + allow = pxace[j].perms; + } + j++; + while ((j < (start + count)) + && (pxace[j].tag == tag) + && (pxace[j].id == id)) { + if (pxace[j].perms & POSIX_PERM_DENIAL) + deny |= pxace[j].perms; + else + allow |= pxace[j].perms; + j++; + } + /* + * Build the permissions equivalent to grants and denials + */ + if (groupowns) { + if (tag == POSIX_ACL_MASK) + perms = ~deny; + else + perms = allow & ~deny; + } else + switch (tag) { + case POSIX_ACL_USER_OBJ : + perms = (allow | grantgrps | grantwrld) & ~deny; + break; + case POSIX_ACL_USER : + if (id) + perms = (allow | grantgrps | grantwrld) + & ~deny; + else + perms = allow; + break; + case POSIX_ACL_GROUP_OBJ : + perms = (allow | grantwrld) & ~deny; + break; + case POSIX_ACL_GROUP : + if (id) + perms = (allow | grantwrld) & ~deny; + else + perms = allow; + break; + case POSIX_ACL_MASK : + perms = ~deny; + break; + default : + perms = allow & ~deny; + break; + } + /* + * Store into a Posix ACE + */ + if (tag != POSIX_ACL_SPECIAL) { + pxace[k].tag = tag; + pxace[k].id = id; + pxace[k].perms = perms + & (POSIX_PERM_R | POSIX_PERM_W | POSIX_PERM_X); + tagsset |= tag; + k++; + } + switch (tag) { + case POSIX_ACL_USER_OBJ : + mode |= ((perms & 7) << 6); + break; + case POSIX_ACL_GROUP_OBJ : + case POSIX_ACL_MASK : + mode = (mode & 07707) | ((perms & 7) << 3); + break; + case POSIX_ACL_OTHER : + mode |= perms & 7; + break; + case POSIX_ACL_SPECIAL : + mode |= (perms & (S_ISVTX | S_ISUID | S_ISGID)); + break; + default : + break; + } + } + if (!start) { /* not satisfactory */ + posix_desc->mode = mode; + posix_desc->tagsset = tagsset; + } + return (k - target); +} + +#endif /* POSIXACLS */ + +/* + * Interpret an ACL and extract meaningful grants + * (standard case : different owner, group and administrator) + */ + +static int build_std_permissions(const char *securattr, + const SID *usid, const SID *gsid, BOOL isdir) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const ACL *pacl; + const ACCESS_ALLOWED_ACE *pace; + int offdacl; + int offace; + int acecnt; + int nace; + BOOL noown; + le32 special; + le32 allowown, allowgrp, allowall; + le32 denyown, denygrp, denyall; + + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)securattr; + offdacl = le32_to_cpu(phead->dacl); + pacl = (const ACL*)&securattr[offdacl]; + special = const_cpu_to_le32(0); + allowown = allowgrp = allowall = const_cpu_to_le32(0); + denyown = denygrp = denyall = const_cpu_to_le32(0); + noown = TRUE; + if (offdacl) { + acecnt = le16_to_cpu(pacl->ace_count); + offace = offdacl + sizeof(ACL); + } else { + acecnt = 0; + offace = 0; + } + for (nace = 0; nace < acecnt; nace++) { + pace = (const ACCESS_ALLOWED_ACE*)&securattr[offace]; + if (!(pace->flags & INHERIT_ONLY_ACE)) { + if (ntfs_same_sid(usid, &pace->sid) + || ntfs_same_sid(ownersid, &pace->sid)) { + noown = FALSE; + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) + allowown |= pace->mask; + else if (pace->type == ACCESS_DENIED_ACE_TYPE) + denyown |= pace->mask; + } else + if (ntfs_same_sid(gsid, &pace->sid) + && !(pace->mask & WRITE_OWNER)) { + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) + allowgrp |= pace->mask; + else if (pace->type == ACCESS_DENIED_ACE_TYPE) + denygrp |= pace->mask; + } else + if (is_world_sid((const SID*)&pace->sid)) { + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) + allowall |= pace->mask; + else + if (pace->type == ACCESS_DENIED_ACE_TYPE) + denyall |= pace->mask; + } else + if ((ntfs_same_sid((const SID*)&pace->sid,nullsid)) + && (pace->type == ACCESS_ALLOWED_ACE_TYPE)) + special |= pace->mask; + } + offace += le16_to_cpu(pace->size); + } + /* + * No indication about owner's rights : grant basic rights + * This happens for files created by Windows in directories + * created by Linux and owned by root, because Windows + * merges the admin ACEs + */ + if (noown) + allowown = (FILE_READ_DATA | FILE_WRITE_DATA | FILE_EXECUTE); + /* + * Add to owner rights granted to group or world + * unless denied personaly, and add to group rights + * granted to world unless denied specifically + */ + allowown |= (allowgrp | allowall); + allowgrp |= allowall; + return (merge_permissions(isdir, + allowown & ~(denyown | denyall), + allowgrp & ~(denygrp | denyall), + allowall & ~denyall, + special)); +} + +/* + * Interpret an ACL and extract meaningful grants + * (special case : owner and group are the same, + * and not administrator) + */ + +static int build_owngrp_permissions(const char *securattr, + const SID *usid, BOOL isdir) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const ACL *pacl; + const ACCESS_ALLOWED_ACE *pace; + int offdacl; + int offace; + int acecnt; + int nace; + le32 special; + BOOL grppresent; + le32 allowown, allowgrp, allowall; + le32 denyown, denygrp, denyall; + + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)securattr; + offdacl = le32_to_cpu(phead->dacl); + pacl = (const ACL*)&securattr[offdacl]; + special = const_cpu_to_le32(0); + allowown = allowgrp = allowall = const_cpu_to_le32(0); + denyown = denygrp = denyall = const_cpu_to_le32(0); + grppresent = FALSE; + if (offdacl) { + acecnt = le16_to_cpu(pacl->ace_count); + offace = offdacl + sizeof(ACL); + } else + acecnt = 0; + for (nace = 0; nace < acecnt; nace++) { + pace = (const ACCESS_ALLOWED_ACE*)&securattr[offace]; + if (!(pace->flags & INHERIT_ONLY_ACE)) { + if ((ntfs_same_sid(usid, &pace->sid) + || ntfs_same_sid(ownersid, &pace->sid)) + && (pace->mask & WRITE_OWNER)) { + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) + allowown |= pace->mask; + } else + if (ntfs_same_sid(usid, &pace->sid) + && (!(pace->mask & WRITE_OWNER))) { + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) { + allowgrp |= pace->mask; + grppresent = TRUE; + } + } else + if (is_world_sid((const SID*)&pace->sid)) { + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) + allowall |= pace->mask; + else + if (pace->type == ACCESS_DENIED_ACE_TYPE) + denyall |= pace->mask; + } else + if ((ntfs_same_sid((const SID*)&pace->sid,nullsid)) + && (pace->type == ACCESS_ALLOWED_ACE_TYPE)) + special |= pace->mask; + } + offace += le16_to_cpu(pace->size); + } + if (!grppresent) + allowgrp = allowall; + return (merge_permissions(isdir, + allowown & ~(denyown | denyall), + allowgrp & ~(denygrp | denyall), + allowall & ~denyall, + special)); +} + +#if POSIXACLS + +/* + * Normalize a Posix ACL either from a sorted raw set of + * access ACEs or default ACEs + * (special case : owner or/and group is administrator) + */ + +static int norm_ownadmin_permissions_posix(struct POSIX_SECURITY *posix_desc, + int start, int count, int target) +{ + int j,k; + s32 id; + u16 tag; + u16 tagsset; + struct POSIX_ACE *pxace; + int acccnt; + mode_t denywrld; + mode_t allow; + mode_t deny; + mode_t perms; + mode_t mode; + + mode = 0; + pxace = posix_desc->acl.ace; + acccnt = posix_desc->acccnt; + tagsset = 0; + denywrld = 0; + /* + * Get denials to world which are meant to prevent + * execution flags to be inherited by plain files + */ + for (j=start; j<(start + count); j++) { + if (pxace[j].perms & POSIX_PERM_DENIAL) { + /* deny world exec not for default */ + if ((pxace[j].tag == POSIX_ACL_OTHER) + && !start) + denywrld = pxace[j].perms; + } + } + /* + * Collect groups of ACEs related to the same id + * and determine what is granted (denials are ignored) + * It is important the ACEs have been sorted + */ + j = start; + k = target; + deny = 0; + while (j < (start + count)) { + allow = 0; + tag = pxace[j].tag; + id = pxace[j].id; + if (tag == POSIX_ACL_MASK) { + deny = pxace[j].perms; + j++; + while ((j < (start + count)) + && (pxace[j].tag == POSIX_ACL_MASK)) + j++; + } else { + if (!(pxace[j].perms & POSIX_PERM_DENIAL)) + allow = pxace[j].perms; + j++; + while ((j < (start + count)) + && (pxace[j].tag == tag) + && (pxace[j].id == id)) { + if (!(pxace[j].perms & POSIX_PERM_DENIAL)) + allow |= pxace[j].perms; + j++; + } + } + + /* + * Store the grants into a Posix ACE + */ + if (tag == POSIX_ACL_MASK) + perms = ~deny; + else + perms = allow & ~denywrld; + if (tag != POSIX_ACL_SPECIAL) { + pxace[k].tag = tag; + pxace[k].id = id; + pxace[k].perms = perms + & (POSIX_PERM_R | POSIX_PERM_W | POSIX_PERM_X); + tagsset |= tag; + k++; + } + switch (tag) { + case POSIX_ACL_USER_OBJ : + mode |= ((perms & 7) << 6); + break; + case POSIX_ACL_GROUP_OBJ : + case POSIX_ACL_MASK : + mode = (mode & 07707) | ((perms & 7) << 3); + break; + case POSIX_ACL_OTHER : + mode |= perms & 7; + break; + case POSIX_ACL_SPECIAL : + mode |= perms & (S_ISVTX | S_ISUID | S_ISGID); + break; + default : + break; + } + } + if (!start) { /* not satisfactory */ + posix_desc->mode = mode; + posix_desc->tagsset = tagsset; + } + return (k - target); +} + +#endif /* POSIXACLS */ + +/* + * Interpret an ACL and extract meaningful grants + * (special case : owner or/and group is administrator) + */ + + +static int build_ownadmin_permissions(const char *securattr, + const SID *usid, const SID *gsid, BOOL isdir) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const ACL *pacl; + const ACCESS_ALLOWED_ACE *pace; + int offdacl; + int offace; + int acecnt; + int nace; + BOOL firstapply; + int isforeign; + le32 special; + le32 allowown, allowgrp, allowall; + le32 denyown, denygrp, denyall; + + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)securattr; + offdacl = le32_to_cpu(phead->dacl); + pacl = (const ACL*)&securattr[offdacl]; + special = const_cpu_to_le32(0); + allowown = allowgrp = allowall = const_cpu_to_le32(0); + denyown = denygrp = denyall = const_cpu_to_le32(0); + if (offdacl) { + acecnt = le16_to_cpu(pacl->ace_count); + offace = offdacl + sizeof(ACL); + } else { + acecnt = 0; + offace = 0; + } + firstapply = TRUE; + isforeign = 3; + for (nace = 0; nace < acecnt; nace++) { + pace = (const ACCESS_ALLOWED_ACE*)&securattr[offace]; + if (!(pace->flags & INHERIT_ONLY_ACE) + && !(~pace->mask & (ROOT_OWNER_UNMARK | ROOT_GROUP_UNMARK))) { + if ((ntfs_same_sid(usid, &pace->sid) + || ntfs_same_sid(ownersid, &pace->sid)) + && (((pace->mask & WRITE_OWNER) && firstapply))) { + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) { + allowown |= pace->mask; + isforeign &= ~1; + } else + if (pace->type == ACCESS_DENIED_ACE_TYPE) + denyown |= pace->mask; + } else + if (ntfs_same_sid(gsid, &pace->sid) + && (!(pace->mask & WRITE_OWNER))) { + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) { + allowgrp |= pace->mask; + isforeign &= ~2; + } else + if (pace->type == ACCESS_DENIED_ACE_TYPE) + denygrp |= pace->mask; + } else if (is_world_sid((const SID*)&pace->sid)) { + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) + allowall |= pace->mask; + else + if (pace->type == ACCESS_DENIED_ACE_TYPE) + denyall |= pace->mask; + } + firstapply = FALSE; + } else + if (!(pace->flags & INHERIT_ONLY_ACE)) + if ((ntfs_same_sid((const SID*)&pace->sid,nullsid)) + && (pace->type == ACCESS_ALLOWED_ACE_TYPE)) + special |= pace->mask; + offace += le16_to_cpu(pace->size); + } + if (isforeign) { + allowown |= (allowgrp | allowall); + allowgrp |= allowall; + } + return (merge_permissions(isdir, + allowown & ~(denyown | denyall), + allowgrp & ~(denygrp | denyall), + allowall & ~denyall, + special)); +} + +#if OWNERFROMACL + +/* + * Define the owner of a file as the first user allowed + * to change the owner, instead of the user defined as owner. + * + * This produces better approximations for files written by a + * Windows user in an inheritable directory owned by another user, + * as the access rights are inheritable but the ownership is not. + * + * An important case is the directories "Documents and Settings/user" + * which the users must have access to, though Windows considers them + * as owned by administrator. + */ + +const SID *ntfs_acl_owner(const char *securattr) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const SID *usid; + const ACL *pacl; + const ACCESS_ALLOWED_ACE *pace; + int offdacl; + int offace; + int acecnt; + int nace; + BOOL found; + + found = FALSE; + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)securattr; + offdacl = le32_to_cpu(phead->dacl); + if (offdacl) { + pacl = (const ACL*)&securattr[offdacl]; + acecnt = le16_to_cpu(pacl->ace_count); + offace = offdacl + sizeof(ACL); + nace = 0; + do { + pace = (const ACCESS_ALLOWED_ACE*)&securattr[offace]; + if ((pace->mask & WRITE_OWNER) + && (pace->type == ACCESS_ALLOWED_ACE_TYPE) + && ntfs_is_user_sid(&pace->sid)) + found = TRUE; + offace += le16_to_cpu(pace->size); + } while (!found && (++nace < acecnt)); + } + if (found) + usid = &pace->sid; + else + usid = (const SID*)&securattr[le32_to_cpu(phead->owner)]; + return (usid); +} + +#else + +/* + * Special case for files owned by administrator with full + * access granted to a mapped user : consider this user as the tenant + * of the file. + * + * This situation cannot be represented with Linux concepts and can + * only be found for files or directories created by Windows. + * Typical situation : directory "Documents and Settings/user" which + * is on the path to user's files and must be given access to user + * only. + * + * Check file is owned by administrator and no user has rights before + * calling. + * Returns the uid of tenant or zero if none + */ + + +static uid_t find_tenant(struct MAPPING *const mapping[], + const char *securattr) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const ACL *pacl; + const ACCESS_ALLOWED_ACE *pace; + int offdacl; + int offace; + int acecnt; + int nace; + uid_t tid; + uid_t xid; + + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)securattr; + offdacl = le32_to_cpu(phead->dacl); + pacl = (const ACL*)&securattr[offdacl]; + tid = 0; + if (offdacl) { + acecnt = le16_to_cpu(pacl->ace_count); + offace = offdacl + sizeof(ACL); + } else + acecnt = 0; + for (nace = 0; nace < acecnt; nace++) { + pace = (const ACCESS_ALLOWED_ACE*)&securattr[offace]; + if ((pace->type == ACCESS_ALLOWED_ACE_TYPE) + && (pace->mask & DIR_WRITE)) { + xid = NTFS_FIND_USER(mapping[MAPUSERS], &pace->sid); + if (xid) tid = xid; + } + offace += le16_to_cpu(pace->size); + } + return (tid); +} + +#endif /* OWNERFROMACL */ + +#if POSIXACLS + +/* + * Build Posix permissions from an ACL + * returns a pointer to the requested permissions + * or a null pointer (with errno set) if there is a problem + * + * If the NTFS ACL was created according to our rules, the retrieved + * Posix ACL should be the exact ACL which was set. However if + * the NTFS ACL was built by a different tool, the result could + * be a a poor approximation of what was expected + */ + +struct POSIX_SECURITY *ntfs_build_permissions_posix( + struct MAPPING *const mapping[], + const char *securattr, + const SID *usid, const SID *gsid, BOOL isdir) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + struct POSIX_SECURITY *pxdesc; + const ACL *pacl; + const ACCESS_ALLOWED_ACE *pace; + struct POSIX_ACE *pxace; + struct { + uid_t prevuid; + gid_t prevgid; + int groupmasks; + s16 tagsset; + BOOL gotowner; + BOOL gotownermask; + BOOL gotgroup; + mode_t permswrld; + } ctx[2], *pctx; + int offdacl; + int offace; + int alloccnt; + int acecnt; + uid_t uid; + gid_t gid; + int i,j; + int k,l; + BOOL ignore; + BOOL adminowns; + BOOL groupowns; + BOOL firstinh; + BOOL genericinh; + + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)securattr; + offdacl = le32_to_cpu(phead->dacl); + if (offdacl) { + pacl = (const ACL*)&securattr[offdacl]; + acecnt = le16_to_cpu(pacl->ace_count); + offace = offdacl + sizeof(ACL); + } else { + acecnt = 0; + offace = 0; + } + adminowns = FALSE; + groupowns = ntfs_same_sid(gsid,usid); + firstinh = FALSE; + genericinh = FALSE; + /* + * Build a raw posix security descriptor + * by just translating permissions and ids + * Add 2 to the count of ACE to be able to insert + * a group ACE later in access and default ACLs + * and add 2 more to be able to insert ACEs for owner + * and 2 more for other + */ + alloccnt = acecnt + 6; + pxdesc = (struct POSIX_SECURITY*)ntfs_malloc( + sizeof(struct POSIX_SECURITY) + + alloccnt*sizeof(struct POSIX_ACE)); + k = 0; + l = alloccnt; + for (i=0; i<2; i++) { + pctx = &ctx[i]; + pctx->permswrld = 0; + pctx->prevuid = -1; + pctx->prevgid = -1; + pctx->groupmasks = 0; + pctx->tagsset = 0; + pctx->gotowner = FALSE; + pctx->gotgroup = FALSE; + pctx->gotownermask = FALSE; + } + for (j=0; j<acecnt; j++) { + pace = (const ACCESS_ALLOWED_ACE*)&securattr[offace]; + if (pace->flags & INHERIT_ONLY_ACE) { + pxace = &pxdesc->acl.ace[l - 1]; + pctx = &ctx[1]; + } else { + pxace = &pxdesc->acl.ace[k]; + pctx = &ctx[0]; + } + ignore = FALSE; + /* + * grants for root as a designated user or group + */ + if ((~pace->mask & (ROOT_OWNER_UNMARK | ROOT_GROUP_UNMARK)) + && (pace->type == ACCESS_ALLOWED_ACE_TYPE) + && ntfs_same_sid(&pace->sid, adminsid)) { + pxace->tag = (pace->mask & ROOT_OWNER_UNMARK ? POSIX_ACL_GROUP : POSIX_ACL_USER); + pxace->id = 0; + if ((pace->mask & (GENERIC_ALL | WRITE_OWNER)) + && (pace->flags & INHERIT_ONLY_ACE)) + ignore = genericinh = TRUE; + } else + if (ntfs_same_sid(usid, &pace->sid)) { + pxace->id = -1; + /* + * Owner has no write-owner right : + * a group was defined same as owner + * or admin was owner or group : + * denials are meant to owner + * and grants are meant to group + */ + if (!(pace->mask & (WRITE_OWNER | GENERIC_ALL)) + && (pace->type == ACCESS_ALLOWED_ACE_TYPE)) { + if (ntfs_same_sid(gsid,usid)) { + pxace->tag = POSIX_ACL_GROUP_OBJ; + pxace->id = -1; + } else { + if (ntfs_same_sid(&pace->sid,usid)) + groupowns = TRUE; + gid = NTFS_FIND_GROUP(mapping[MAPGROUPS],&pace->sid); + if (gid) { + pxace->tag = POSIX_ACL_GROUP; + pxace->id = gid; + pctx->prevgid = gid; + } else { + uid = NTFS_FIND_USER(mapping[MAPUSERS],&pace->sid); + if (uid) { + pxace->tag = POSIX_ACL_USER; + pxace->id = uid; + } else + ignore = TRUE; + } + } + } else { + /* + * when group owns, late denials for owner + * mean group mask + */ + if ((pace->type == ACCESS_DENIED_ACE_TYPE) + && (pace->mask & WRITE_OWNER)) { + pxace->tag = POSIX_ACL_MASK; + pctx->gotownermask = TRUE; + if (pctx->gotowner) + pctx->groupmasks++; + } else { + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) + pctx->gotowner = TRUE; + if (pctx->gotownermask && !pctx->gotowner) { + uid = NTFS_FIND_USER(mapping[MAPUSERS],&pace->sid); + pxace->id = uid; + pxace->tag = POSIX_ACL_USER; + } else + pxace->tag = POSIX_ACL_USER_OBJ; + /* system ignored, and admin */ + /* ignored at first position */ + if (pace->flags & INHERIT_ONLY_ACE) { + if ((firstinh && ntfs_same_sid(&pace->sid,adminsid)) + || ntfs_same_sid(&pace->sid,systemsid)) + ignore = TRUE; + if (!firstinh) { + firstinh = TRUE; + } + } else { + if ((adminowns && ntfs_same_sid(&pace->sid,adminsid)) + || ntfs_same_sid(&pace->sid,systemsid)) + ignore = TRUE; + if (ntfs_same_sid(usid,adminsid)) + adminowns = TRUE; + } + } + } + } else if (ntfs_same_sid(gsid, &pace->sid)) { + if ((pace->type == ACCESS_DENIED_ACE_TYPE) + && (pace->mask & WRITE_OWNER)) { + pxace->tag = POSIX_ACL_MASK; + pxace->id = -1; + if (pctx->gotowner) + pctx->groupmasks++; + } else { + if (pctx->gotgroup || (pctx->groupmasks > 1)) { + gid = NTFS_FIND_GROUP(mapping[MAPGROUPS],&pace->sid); + if (gid) { + pxace->id = gid; + pxace->tag = POSIX_ACL_GROUP; + pctx->prevgid = gid; + } else + ignore = TRUE; + } else { + pxace->id = -1; + pxace->tag = POSIX_ACL_GROUP_OBJ; + if (pace->type == ACCESS_ALLOWED_ACE_TYPE) + pctx->gotgroup = TRUE; + } + + if (ntfs_same_sid(gsid,adminsid) + || ntfs_same_sid(gsid,systemsid)) { + if (pace->mask & (WRITE_OWNER | GENERIC_ALL)) + ignore = TRUE; + if (ntfs_same_sid(gsid,adminsid)) + adminowns = TRUE; + else + genericinh = ignore; + } + } + } else if (is_world_sid((const SID*)&pace->sid)) { + pxace->id = -1; + pxace->tag = POSIX_ACL_OTHER; + if ((pace->type == ACCESS_DENIED_ACE_TYPE) + && (pace->flags & INHERIT_ONLY_ACE)) + ignore = TRUE; + } else if (ntfs_same_sid((const SID*)&pace->sid,nullsid)) { + pxace->id = -1; + pxace->tag = POSIX_ACL_SPECIAL; + } else { + uid = NTFS_FIND_USER(mapping[MAPUSERS],&pace->sid); + if (uid) { + if ((pace->type == ACCESS_DENIED_ACE_TYPE) + && (pace->mask & WRITE_OWNER) + && (pctx->prevuid != uid)) { + pxace->id = -1; + pxace->tag = POSIX_ACL_MASK; + } else { + pxace->id = uid; + pxace->tag = POSIX_ACL_USER; + } + pctx->prevuid = uid; + } else { + gid = NTFS_FIND_GROUP(mapping[MAPGROUPS],&pace->sid); + if (gid) { + if ((pace->type == ACCESS_DENIED_ACE_TYPE) + && (pace->mask & WRITE_OWNER) + && (pctx->prevgid != gid)) { + pxace->tag = POSIX_ACL_MASK; + pctx->groupmasks++; + } else { + pxace->tag = POSIX_ACL_GROUP; + } + pxace->id = gid; + pctx->prevgid = gid; + } else { + /* + * do not grant rights to unknown + * people and do not define root as a + * designated user or group + */ + ignore = TRUE; + } + } + } + if (!ignore) { + pxace->perms = 0; + /* specific decoding for vtx/uid/gid */ + if (pxace->tag == POSIX_ACL_SPECIAL) { + if (pace->mask & FILE_APPEND_DATA) + pxace->perms |= S_ISUID; + if (pace->mask & FILE_WRITE_DATA) + pxace->perms |= S_ISGID; + if (pace->mask & FILE_READ_DATA) + pxace->perms |= S_ISVTX; + } else + if (isdir) { + if (pace->mask & DIR_GEXEC) + pxace->perms |= POSIX_PERM_X; + if (pace->mask & DIR_GWRITE) + pxace->perms |= POSIX_PERM_W; + if (pace->mask & DIR_GREAD) + pxace->perms |= POSIX_PERM_R; + if ((pace->mask & GENERIC_ALL) + && (pace->flags & INHERIT_ONLY_ACE)) + pxace->perms |= POSIX_PERM_X + | POSIX_PERM_W + | POSIX_PERM_R; + } else { + if (pace->mask & FILE_GEXEC) + pxace->perms |= POSIX_PERM_X; + if (pace->mask & FILE_GWRITE) + pxace->perms |= POSIX_PERM_W; + if (pace->mask & FILE_GREAD) + pxace->perms |= POSIX_PERM_R; + } + + if (pace->type != ACCESS_ALLOWED_ACE_TYPE) + pxace->perms |= POSIX_PERM_DENIAL; + else + if (pxace->tag == POSIX_ACL_OTHER) + pctx->permswrld = pxace->perms; + pctx->tagsset |= pxace->tag; + if (pace->flags & INHERIT_ONLY_ACE) { + l--; + } else { + k++; + } + } + offace += le16_to_cpu(pace->size); + } + /* + * Create world perms if none (both lists) + */ + for (i=0; i<2; i++) + if ((genericinh || !i) + && !(ctx[i].tagsset & POSIX_ACL_OTHER)) { + if (i) + pxace = &pxdesc->acl.ace[--l]; + else + pxace = &pxdesc->acl.ace[k++]; + pxace->tag = POSIX_ACL_OTHER; + pxace->id = -1; + pxace->perms = 0; + ctx[i].tagsset |= POSIX_ACL_OTHER; + ctx[i].permswrld = 0; + } + /* + * Set basic owner perms if none (both lists) + * This happens for files created by Windows in directories + * created by Linux and owned by root, because Windows + * merges the admin ACEs + */ + for (i=0; i<2; i++) + if (!(ctx[i].tagsset & POSIX_ACL_USER_OBJ) + && (ctx[i].tagsset & POSIX_ACL_OTHER)) { + if (i) + pxace = &pxdesc->acl.ace[--l]; + else + pxace = &pxdesc->acl.ace[k++]; + pxace->tag = POSIX_ACL_USER_OBJ; + pxace->id = -1; + pxace->perms = POSIX_PERM_R | POSIX_PERM_W | POSIX_PERM_X; + ctx[i].tagsset |= POSIX_ACL_USER_OBJ; + } + /* + * Duplicate world perms as group_obj perms if none + */ + for (i=0; i<2; i++) + if ((ctx[i].tagsset & POSIX_ACL_OTHER) + && !(ctx[i].tagsset & POSIX_ACL_GROUP_OBJ)) { + if (i) + pxace = &pxdesc->acl.ace[--l]; + else + pxace = &pxdesc->acl.ace[k++]; + pxace->tag = POSIX_ACL_GROUP_OBJ; + pxace->id = -1; + pxace->perms = ctx[i].permswrld; + ctx[i].tagsset |= POSIX_ACL_GROUP_OBJ; + } + /* + * Also duplicate world perms as group perms if they + * were converted to mask and not followed by a group entry + */ + if (ctx[0].groupmasks) { + for (j=k-2; j>=0; j--) { + if ((pxdesc->acl.ace[j].tag == POSIX_ACL_MASK) + && (pxdesc->acl.ace[j].id != -1) + && ((pxdesc->acl.ace[j+1].tag != POSIX_ACL_GROUP) + || (pxdesc->acl.ace[j+1].id + != pxdesc->acl.ace[j].id))) { + pxace = &pxdesc->acl.ace[k]; + pxace->tag = POSIX_ACL_GROUP; + pxace->id = pxdesc->acl.ace[j].id; + pxace->perms = ctx[0].permswrld; + ctx[0].tagsset |= POSIX_ACL_GROUP; + k++; + } + if (pxdesc->acl.ace[j].tag == POSIX_ACL_MASK) + pxdesc->acl.ace[j].id = -1; + } + } + if (ctx[1].groupmasks) { + for (j=l; j<(alloccnt-1); j++) { + if ((pxdesc->acl.ace[j].tag == POSIX_ACL_MASK) + && (pxdesc->acl.ace[j].id != -1) + && ((pxdesc->acl.ace[j+1].tag != POSIX_ACL_GROUP) + || (pxdesc->acl.ace[j+1].id + != pxdesc->acl.ace[j].id))) { + pxace = &pxdesc->acl.ace[l - 1]; + pxace->tag = POSIX_ACL_GROUP; + pxace->id = pxdesc->acl.ace[j].id; + pxace->perms = ctx[1].permswrld; + ctx[1].tagsset |= POSIX_ACL_GROUP; + l--; + } + if (pxdesc->acl.ace[j].tag == POSIX_ACL_MASK) + pxdesc->acl.ace[j].id = -1; + } + } + + /* + * Insert default mask if none present and + * there are designated users or groups + * (the space for it has not beed used) + */ + for (i=0; i<2; i++) + if ((ctx[i].tagsset & (POSIX_ACL_USER | POSIX_ACL_GROUP)) + && !(ctx[i].tagsset & POSIX_ACL_MASK)) { + if (i) + pxace = &pxdesc->acl.ace[--l]; + else + pxace = &pxdesc->acl.ace[k++]; + pxace->tag = POSIX_ACL_MASK; + pxace->id = -1; + pxace->perms = POSIX_PERM_DENIAL; + ctx[i].tagsset |= POSIX_ACL_MASK; + } + + if (k > l) { + ntfs_log_error("Posix descriptor is longer than expected\n"); + errno = EIO; + free(pxdesc); + pxdesc = (struct POSIX_SECURITY*)NULL; + } else { + pxdesc->acccnt = k; + pxdesc->defcnt = alloccnt - l; + pxdesc->firstdef = l; + pxdesc->tagsset = ctx[0].tagsset; + pxdesc->acl.version = POSIX_VERSION; + pxdesc->acl.flags = 0; + pxdesc->acl.filler = 0; + ntfs_sort_posix(pxdesc); + if (adminowns) { + k = norm_ownadmin_permissions_posix(pxdesc, + 0, pxdesc->acccnt, 0); + pxdesc->acccnt = k; + l = norm_ownadmin_permissions_posix(pxdesc, + pxdesc->firstdef, pxdesc->defcnt, k); + pxdesc->firstdef = k; + pxdesc->defcnt = l; + } else { + k = norm_std_permissions_posix(pxdesc,groupowns, + 0, pxdesc->acccnt, 0); + pxdesc->acccnt = k; + l = norm_std_permissions_posix(pxdesc,groupowns, + pxdesc->firstdef, pxdesc->defcnt, k); + pxdesc->firstdef = k; + pxdesc->defcnt = l; + } + } + if (pxdesc && !ntfs_valid_posix(pxdesc)) { + ntfs_log_error("Invalid Posix descriptor built\n"); + errno = EIO; + free(pxdesc); + pxdesc = (struct POSIX_SECURITY*)NULL; + } + return (pxdesc); +} + +#endif /* POSIXACLS */ + +/* + * Build unix-style (mode_t) permissions from an ACL + * returns the requested permissions + * or a negative result (with errno set) if there is a problem + */ + +int ntfs_build_permissions(const char *securattr, + const SID *usid, const SID *gsid, BOOL isdir) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + int perm; + BOOL adminowns; + BOOL groupowns; + + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)securattr; + adminowns = ntfs_same_sid(usid,adminsid) + || ntfs_same_sid(gsid,adminsid); + groupowns = !adminowns && ntfs_same_sid(gsid,usid); + if (adminowns) + perm = build_ownadmin_permissions(securattr, usid, gsid, isdir); + else + if (groupowns) + perm = build_owngrp_permissions(securattr, usid, isdir); + else + perm = build_std_permissions(securattr, usid, gsid, isdir); + return (perm); +} + +/* + * The following must be in some library... + */ + +static unsigned long atoul(const char *p) +{ /* must be somewhere ! */ + unsigned long v; + + v = 0; + while ((*p >= '0') && (*p <= '9')) + v = v * 10 + (*p++) - '0'; + return (v); +} + +/* + * Build an internal representation of a SID + * Returns a copy in allocated memory if it succeeds + * The SID is checked to be a valid user one. + */ + +static SID *encodesid(const char *sidstr) +{ + SID *sid; + int cnt; + BIGSID bigsid; + SID *bsid; + u32 auth; + const char *p; + + sid = (SID*) NULL; + if (!strncmp(sidstr, "S-1-", 4)) { + bsid = (SID*)&bigsid; + bsid->revision = SID_REVISION; + p = &sidstr[4]; + auth = atoul(p); + bsid->identifier_authority.high_part = const_cpu_to_be16(0); + bsid->identifier_authority.low_part = cpu_to_be32(auth); + cnt = 0; + p = strchr(p, '-'); + while (p && (cnt < 8)) { + p++; + auth = atoul(p); + bsid->sub_authority[cnt] = cpu_to_le32(auth); + p = strchr(p, '-'); + cnt++; + } + bsid->sub_authority_count = cnt; + if ((cnt > 0) && ntfs_valid_sid(bsid) && ntfs_is_user_sid(bsid)) { + sid = (SID*) ntfs_malloc(4 * cnt + 8); + if (sid) + memcpy(sid, bsid, 4 * cnt + 8); + } + } + return (sid); +} + +/* + * Get a single mapping item from buffer + * + * Always reads a full line, truncating long lines + * Refills buffer when exhausted + * Returns pointer to item, or NULL when there is no more + */ + +static struct MAPLIST *getmappingitem(FILEREADER reader, void *fileid, + off_t *poffs, char *buf, int *psrc, s64 *psize) +{ + int src; + int dst; + char *p; + char *q; + char *pu; + char *pg; + int gotend; + struct MAPLIST *item; + + src = *psrc; + dst = 0; + /* allocate and get a full line */ + item = (struct MAPLIST*)ntfs_malloc(sizeof(struct MAPLIST)); + if (item) { + do { + gotend = 0; + while ((src < *psize) + && (buf[src] != '\n')) { + if (dst < LINESZ) + item->maptext[dst++] = buf[src]; + src++; + } + if (src >= *psize) { + *poffs += *psize; + *psize = reader(fileid, buf, (size_t)BUFSZ, *poffs); + src = 0; + } else { + gotend = 1; + src++; + item->maptext[dst] = '\0'; + dst = 0; + } + } while (*psize && ((item->maptext[0] == '#') || !gotend)); + if (gotend) { + pu = pg = (char*)NULL; + /* decompose into uid, gid and sid */ + p = item->maptext; + item->uidstr = item->maptext; + item->gidstr = strchr(item->uidstr, ':'); + if (item->gidstr) { + pu = item->gidstr++; + item->sidstr = strchr(item->gidstr, ':'); + if (item->sidstr) { + pg = item->sidstr++; + q = strchr(item->sidstr, ':'); + if (q) *q = 0; + } + } + if (pu && pg) + *pu = *pg = '\0'; + else { + ntfs_log_early_error("Bad mapping item \"%s\"\n", + item->maptext); + free(item); + item = (struct MAPLIST*)NULL; + } + } else { + free(item); /* free unused item */ + item = (struct MAPLIST*)NULL; + } + } + *psrc = src; + return (item); +} + +/* + * Read user mapping file and split into their attribute. + * Parameters are kept as text in a chained list until logins + * are converted to uid. + * Returns the head of list, if any + * + * If an absolute path is provided, the mapping file is assumed + * to be located in another mounted file system, and plain read() + * are used to get its contents. + * If a relative path is provided, the mapping file is assumed + * to be located on the current file system, and internal IO + * have to be used since we are still mounting and we have not + * entered the fuse loop yet. + */ + +struct MAPLIST *ntfs_read_mapping(FILEREADER reader, void *fileid) +{ + char buf[BUFSZ]; + struct MAPLIST *item; + struct MAPLIST *firstitem; + struct MAPLIST *lastitem; + int src; + off_t offs; + s64 size; + + firstitem = (struct MAPLIST*)NULL; + lastitem = (struct MAPLIST*)NULL; + offs = 0; + size = reader(fileid, buf, (size_t)BUFSZ, (off_t)0); + if (size > 0) { + src = 0; + do { + item = getmappingitem(reader, fileid, &offs, + buf, &src, &size); + if (item) { + item->next = (struct MAPLIST*)NULL; + if (lastitem) + lastitem->next = item; + else + firstitem = item; + lastitem = item; + } + } while (item); + } + return (firstitem); +} + +/* + * Free memory used to store the user mapping + * The only purpose is to facilitate the detection of memory leaks + */ + +void ntfs_free_mapping(struct MAPPING *mapping[]) +{ + struct MAPPING *user; + struct MAPPING *group; + + /* free user mappings */ + while (mapping[MAPUSERS]) { + user = mapping[MAPUSERS]; + /* do not free SIDs used for group mappings */ + group = mapping[MAPGROUPS]; + while (group && (group->sid != user->sid)) + group = group->next; + if (!group) + free(user->sid); + /* free group list if any */ + if (user->grcnt) + free(user->groups); + /* unchain item and free */ + mapping[MAPUSERS] = user->next; + free(user); + } + /* free group mappings */ + while (mapping[MAPGROUPS]) { + group = mapping[MAPGROUPS]; + free(group->sid); + /* unchain item and free */ + mapping[MAPGROUPS] = group->next; + free(group); + } +} + + +/* + * Build the user mapping list + * user identification may be given in symbolic or numeric format + * + * ! Note ! : does getpwnam() read /etc/passwd or some other file ? + * if so there is a possible recursion into fuse if this + * file is on NTFS, and fuse is not recursion safe. + */ + +struct MAPPING *ntfs_do_user_mapping(struct MAPLIST *firstitem) +{ + struct MAPLIST *item; + struct MAPPING *firstmapping; + struct MAPPING *lastmapping; + struct MAPPING *mapping; + struct passwd *pwd; + SID *sid; + int uid; + + firstmapping = (struct MAPPING*)NULL; + lastmapping = (struct MAPPING*)NULL; + for (item = firstitem; item; item = item->next) { + if ((item->uidstr[0] >= '0') && (item->uidstr[0] <= '9')) + uid = atoi(item->uidstr); + else { + uid = 0; + if (item->uidstr[0]) { + pwd = getpwnam(item->uidstr); + if (pwd) + uid = pwd->pw_uid; + else + ntfs_log_early_error("Invalid user \"%s\"\n", + item->uidstr); + } + } + /* + * Records with no uid and no gid are inserted + * to define the implicit mapping pattern + */ + if (uid + || (!item->uidstr[0] && !item->gidstr[0])) { + sid = encodesid(item->sidstr); + if (sid && !item->uidstr[0] && !item->gidstr[0] + && !ntfs_valid_pattern(sid)) { + ntfs_log_error("Bad implicit SID pattern %s\n", + item->sidstr); + sid = (SID*)NULL; + } + if (sid) { + mapping = + (struct MAPPING*) + ntfs_malloc(sizeof(struct MAPPING)); + if (mapping) { + mapping->sid = sid; + mapping->xid = uid; + mapping->grcnt = 0; + mapping->next = (struct MAPPING*)NULL; + if (lastmapping) + lastmapping->next = mapping; + else + firstmapping = mapping; + lastmapping = mapping; + } + } + } + } + return (firstmapping); +} + +/* + * Build the group mapping list + * group identification may be given in symbolic or numeric format + * + * gid not associated to a uid are processed first in order + * to favour real groups + * + * ! Note ! : does getgrnam() read /etc/group or some other file ? + * if so there is a possible recursion into fuse if this + * file is on NTFS, and fuse is not recursion safe. + */ + +struct MAPPING *ntfs_do_group_mapping(struct MAPLIST *firstitem) +{ + struct MAPLIST *item; + struct MAPPING *firstmapping; + struct MAPPING *lastmapping; + struct MAPPING *mapping; + struct group *grp; + BOOL secondstep; + BOOL ok; + int step; + SID *sid; + int gid; + + firstmapping = (struct MAPPING*)NULL; + lastmapping = (struct MAPPING*)NULL; + for (step=1; step<=2; step++) { + for (item = firstitem; item; item = item->next) { + secondstep = (item->uidstr[0] != '\0') + || !item->gidstr[0]; + ok = (step == 1 ? !secondstep : secondstep); + if ((item->gidstr[0] >= '0') + && (item->gidstr[0] <= '9')) + gid = atoi(item->gidstr); + else { + gid = 0; + if (item->gidstr[0]) { + grp = getgrnam(item->gidstr); + if (grp) + gid = grp->gr_gid; + else + ntfs_log_early_error("Invalid group \"%s\"\n", + item->gidstr); + } + } + /* + * Records with no uid and no gid are inserted in the + * second step to define the implicit mapping pattern + */ + if (ok + && (gid + || (!item->uidstr[0] && !item->gidstr[0]))) { + sid = encodesid(item->sidstr); + if (sid && !item->uidstr[0] && !item->gidstr[0] + && !ntfs_valid_pattern(sid)) { + /* error already logged */ + sid = (SID*)NULL; + } + if (sid) { + mapping = (struct MAPPING*) + ntfs_malloc(sizeof(struct MAPPING)); + if (mapping) { + mapping->sid = sid; + mapping->xid = gid; + mapping->grcnt = 0; + mapping->next = (struct MAPPING*)NULL; + if (lastmapping) + lastmapping->next = mapping; + else + firstmapping = mapping; + lastmapping = mapping; + } + } + } + } + } + return (firstmapping); +} diff --git a/portlibs/sources/libntfs/acls.h b/portlibs/sources/libntfs/acls.h new file mode 100644 index 00000000..8a83d32d --- /dev/null +++ b/portlibs/sources/libntfs/acls.h @@ -0,0 +1,199 @@ +/* + * + * Copyright (c) 2007-2008 Jean-Pierre Andre + * + */ + +/* + * This program 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 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 + */ + +#ifndef ACLS_H +#define ACLS_H + +/* + * JPA configuration modes for security.c / acls.c + * should be moved to some config file + */ + +#define BUFSZ 1024 /* buffer size to read mapping file */ +#define MAPPINGFILE ".NTFS-3G/UserMapping" /* default mapping file */ +#define LINESZ 120 /* maximum useful size of a mapping line */ +#define CACHE_PERMISSIONS_BITS 6 /* log2 of unitary allocation of permissions */ +#define CACHE_PERMISSIONS_SIZE 262144 /* max cacheable permissions */ + +/* + * JPA The following must be in some library... + * but did not found out where + */ + +#define endian_rev16(x) (((x >> 8) & 255) | ((x & 255) << 8)) +#define endian_rev32(x) (((x >> 24) & 255) | ((x >> 8) & 0xff00) \ + | ((x & 0xff00) << 8) | ((x & 255) << 24)) + +#define cpu_to_be16(x) endian_rev16(cpu_to_le16(x)) +#define cpu_to_be32(x) endian_rev32(cpu_to_le32(x)) + +/* + * Macro definitions needed to share code with secaudit + */ + +#define NTFS_FIND_USID(map,uid,buf) ntfs_find_usid(map,uid,buf) +#define NTFS_FIND_GSID(map,gid,buf) ntfs_find_gsid(map,gid,buf) +#define NTFS_FIND_USER(map,usid) ntfs_find_user(map,usid) +#define NTFS_FIND_GROUP(map,gsid) ntfs_find_group(map,gsid) + + +/* + * Matching of ntfs permissions to Linux permissions + * these constants are adapted to endianness + * when setting, set them all + * when checking, check one is present + */ + + /* flags which are set to mean exec, write or read */ + +#define FILE_READ (FILE_READ_DATA) +#define FILE_WRITE (FILE_WRITE_DATA | FILE_APPEND_DATA \ + | READ_CONTROL | FILE_WRITE_ATTRIBUTES | FILE_WRITE_EA) +#define FILE_EXEC (FILE_EXECUTE) +#define DIR_READ FILE_LIST_DIRECTORY +#define DIR_WRITE (FILE_ADD_FILE | FILE_ADD_SUBDIRECTORY | FILE_DELETE_CHILD \ + | READ_CONTROL | FILE_WRITE_ATTRIBUTES | FILE_WRITE_EA) +#define DIR_EXEC (FILE_TRAVERSE) + + /* flags tested for meaning exec, write or read */ + /* tests for write allow for interpretation of a sticky bit */ + +#define FILE_GREAD (FILE_READ_DATA | GENERIC_READ) +#define FILE_GWRITE (FILE_WRITE_DATA | FILE_APPEND_DATA | GENERIC_WRITE) +#define FILE_GEXEC (FILE_EXECUTE | GENERIC_EXECUTE) +#define DIR_GREAD (FILE_LIST_DIRECTORY | GENERIC_READ) +#define DIR_GWRITE (FILE_ADD_FILE | FILE_ADD_SUBDIRECTORY | GENERIC_WRITE) +#define DIR_GEXEC (FILE_TRAVERSE | GENERIC_EXECUTE) + + /* standard owner (and administrator) rights */ + +#define OWNER_RIGHTS (DELETE | READ_CONTROL | WRITE_DAC | WRITE_OWNER \ + | SYNCHRONIZE \ + | FILE_READ_ATTRIBUTES | FILE_WRITE_ATTRIBUTES \ + | FILE_READ_EA | FILE_WRITE_EA) + + /* standard world rights */ + +#define WORLD_RIGHTS (READ_CONTROL | FILE_READ_ATTRIBUTES | FILE_READ_EA \ + | SYNCHRONIZE) + + /* inheritance flags for files and directories */ + +#define FILE_INHERITANCE NO_PROPAGATE_INHERIT_ACE +#define DIR_INHERITANCE (OBJECT_INHERIT_ACE | CONTAINER_INHERIT_ACE) + +/* + * To identify NTFS ACL meaning Posix ACL granted to root + * we use rights always granted to anybody, so they have no impact + * either on Windows or on Linux. + */ + +#define ROOT_OWNER_UNMARK SYNCHRONIZE /* ACL granted to root as owner */ +#define ROOT_GROUP_UNMARK FILE_READ_EA /* ACL granted to root as group */ + +/* + * A type large enough to hold any SID + */ + +typedef char BIGSID[40]; + +/* + * Struct to hold the input mapping file + * (private to this module) + */ + +struct MAPLIST { + struct MAPLIST *next; + char *uidstr; /* uid text from the same record */ + char *gidstr; /* gid text from the same record */ + char *sidstr; /* sid text from the same record */ + char maptext[LINESZ + 1]; +}; + +typedef int (*FILEREADER)(void *fileid, char *buf, size_t size, off_t pos); + +/* + * Constants defined in acls.c + */ + +extern const SID *adminsid; +extern const SID *worldsid; + +/* + * Functions defined in acls.c + */ + +BOOL ntfs_valid_descr(const char *securattr, unsigned int attrsz); +BOOL ntfs_valid_pattern(const SID *sid); +BOOL ntfs_valid_sid(const SID *sid); +BOOL ntfs_same_sid(const SID *first, const SID *second); + +BOOL ntfs_is_user_sid(const SID *usid); + + +int ntfs_sid_size(const SID * sid); +unsigned int ntfs_attr_size(const char *attr); + +const SID *ntfs_find_usid(const struct MAPPING *usermapping, + uid_t uid, SID *pdefsid); +const SID *ntfs_find_gsid(const struct MAPPING *groupmapping, + gid_t gid, SID *pdefsid); +uid_t ntfs_find_user(const struct MAPPING *usermapping, const SID *usid); +gid_t ntfs_find_group(const struct MAPPING *groupmapping, const SID * gsid); +const SID *ntfs_acl_owner(const char *secattr); + +#if POSIXACLS + +BOOL ntfs_valid_posix(const struct POSIX_SECURITY *pxdesc); +void ntfs_sort_posix(struct POSIX_SECURITY *pxdesc); +int ntfs_merge_mode_posix(struct POSIX_SECURITY *pxdesc, mode_t mode); +struct POSIX_SECURITY *ntfs_build_inherited_posix( + const struct POSIX_SECURITY *pxdesc, mode_t mode, + mode_t umask, BOOL isdir); +struct POSIX_SECURITY *ntfs_replace_acl(const struct POSIX_SECURITY *oldpxdesc, + const struct POSIX_ACL *newacl, int count, BOOL deflt); +struct POSIX_SECURITY *ntfs_build_permissions_posix( + struct MAPPING* const mapping[], + const char *securattr, + const SID *usid, const SID *gsid, BOOL isdir); +struct POSIX_SECURITY *ntfs_merge_descr_posix(const struct POSIX_SECURITY *first, + const struct POSIX_SECURITY *second); +char *ntfs_build_descr_posix(struct MAPPING* const mapping[], + struct POSIX_SECURITY *pxdesc, + int isdir, const SID *usid, const SID *gsid); + +#endif /* POSIXACLS */ + +int ntfs_inherit_acl(const ACL *oldacl, ACL *newacl, + const SID *usid, const SID *gsid, BOOL fordir); +int ntfs_build_permissions(const char *securattr, + const SID *usid, const SID *gsid, BOOL isdir); +char *ntfs_build_descr(mode_t mode, + int isdir, const SID * usid, const SID * gsid); +struct MAPLIST *ntfs_read_mapping(FILEREADER reader, void *fileid); +struct MAPPING *ntfs_do_user_mapping(struct MAPLIST *firstitem); +struct MAPPING *ntfs_do_group_mapping(struct MAPLIST *firstitem); +void ntfs_free_mapping(struct MAPPING *mapping[]); + +#endif /* ACLS_H */ + diff --git a/portlibs/sources/libntfs/attrib.c b/portlibs/sources/libntfs/attrib.c new file mode 100644 index 00000000..e6f614f0 --- /dev/null +++ b/portlibs/sources/libntfs/attrib.c @@ -0,0 +1,6773 @@ +/** + * attrib.c - Attribute handling code. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2010 Anton Altaparmakov + * Copyright (c) 2002-2005 Richard Russon + * Copyright (c) 2002-2008 Szabolcs Szakacsits + * Copyright (c) 2004-2007 Yura Pakhuchiy + * Copyright (c) 2007-2011 Jean-Pierre Andre + * Copyright (c) 2010 Erik Larsson + * + * 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_LIMITS_H +#include <limits.h> +#endif + +#include "param.h" +#include "compat.h" +#include "attrib.h" +#include "attrlist.h" +#include "device.h" +#include "mft.h" +#include "debug.h" +#include "mst.h" +#include "volume.h" +#include "types.h" +#include "layout.h" +#include "inode.h" +#include "runlist.h" +#include "lcnalloc.h" +#include "dir.h" +#include "compress.h" +#include "bitmap.h" +#include "logging.h" +#include "misc.h" +#include "efs.h" + +ntfschar AT_UNNAMED[] = { const_cpu_to_le16('\0') }; +ntfschar STREAM_SDS[] = { const_cpu_to_le16('$'), + const_cpu_to_le16('S'), + const_cpu_to_le16('D'), + const_cpu_to_le16('S'), + const_cpu_to_le16('\0') }; + +ntfschar TXF_DATA[] = { const_cpu_to_le16('$'), + const_cpu_to_le16('T'), + const_cpu_to_le16('X'), + const_cpu_to_le16('F'), + const_cpu_to_le16('_'), + const_cpu_to_le16('D'), + const_cpu_to_le16('A'), + const_cpu_to_le16('T'), + const_cpu_to_le16('A'), + const_cpu_to_le16('\0') }; + +static int NAttrFlag(ntfs_attr *na, FILE_ATTR_FLAGS flag) +{ + if (na->type == AT_DATA && na->name == AT_UNNAMED) + return (na->ni->flags & flag); + return 0; +} + +static void NAttrSetFlag(ntfs_attr *na, FILE_ATTR_FLAGS flag) +{ + if (na->type == AT_DATA && na->name == AT_UNNAMED) + na->ni->flags |= flag; + else + ntfs_log_trace("Denied setting flag %d for not unnamed data " + "attribute\n", flag); +} + +static void NAttrClearFlag(ntfs_attr *na, FILE_ATTR_FLAGS flag) +{ + if (na->type == AT_DATA && na->name == AT_UNNAMED) + na->ni->flags &= ~flag; +} + +#define GenNAttrIno(func_name, flag) \ +int NAttr##func_name(ntfs_attr *na) { return NAttrFlag (na, flag); } \ +void NAttrSet##func_name(ntfs_attr *na) { NAttrSetFlag (na, flag); } \ +void NAttrClear##func_name(ntfs_attr *na){ NAttrClearFlag(na, flag); } + +GenNAttrIno(Compressed, FILE_ATTR_COMPRESSED) +GenNAttrIno(Encrypted, FILE_ATTR_ENCRYPTED) +GenNAttrIno(Sparse, FILE_ATTR_SPARSE_FILE) + +/** + * ntfs_get_attribute_value_length - Find the length of an attribute + * @a: + * + * Description... + * + * Returns: + */ +s64 ntfs_get_attribute_value_length(const ATTR_RECORD *a) +{ + if (!a) { + errno = EINVAL; + return 0; + } + errno = 0; + if (a->non_resident) + return sle64_to_cpu(a->data_size); + + return (s64)le32_to_cpu(a->value_length); +} + +/** + * ntfs_get_attribute_value - Get a copy of an attribute + * @vol: + * @a: + * @b: + * + * Description... + * + * Returns: + */ +s64 ntfs_get_attribute_value(const ntfs_volume *vol, + const ATTR_RECORD *a, u8 *b) +{ + runlist *rl; + s64 total, r; + int i; + + /* Sanity checks. */ + if (!vol || !a || !b) { + errno = EINVAL; + return 0; + } + /* Complex attribute? */ + /* + * Ignore the flags in case they are not zero for an attribute list + * attribute. Windows does not complain about invalid flags and chkdsk + * does not detect or fix them so we need to cope with it, too. + */ + if (a->type != AT_ATTRIBUTE_LIST && a->flags) { + ntfs_log_error("Non-zero (%04x) attribute flags. Cannot handle " + "this yet.\n", le16_to_cpu(a->flags)); + errno = EOPNOTSUPP; + return 0; + } + if (!a->non_resident) { + /* Attribute is resident. */ + + /* Sanity check. */ + if (le32_to_cpu(a->value_length) + le16_to_cpu(a->value_offset) + > le32_to_cpu(a->length)) { + return 0; + } + + memcpy(b, (const char*)a + le16_to_cpu(a->value_offset), + le32_to_cpu(a->value_length)); + errno = 0; + return (s64)le32_to_cpu(a->value_length); + } + + /* Attribute is not resident. */ + + /* If no data, return 0. */ + if (!(a->data_size)) { + errno = 0; + return 0; + } + /* + * FIXME: What about attribute lists?!? (AIA) + */ + /* Decompress the mapping pairs array into a runlist. */ + rl = ntfs_mapping_pairs_decompress(vol, a, NULL); + if (!rl) { + errno = EINVAL; + return 0; + } + /* + * FIXED: We were overflowing here in a nasty fashion when we + * reach the last cluster in the runlist as the buffer will + * only be big enough to hold data_size bytes while we are + * reading in allocated_size bytes which is usually larger + * than data_size, since the actual data is unlikely to have a + * size equal to a multiple of the cluster size! + * FIXED2: We were also overflowing here in the same fashion + * when the data_size was more than one run smaller than the + * allocated size which happens with Windows XP sometimes. + */ + /* Now load all clusters in the runlist into b. */ + for (i = 0, total = 0; rl[i].length; i++) { + if (total + (rl[i].length << vol->cluster_size_bits) >= + sle64_to_cpu(a->data_size)) { + unsigned char *intbuf = NULL; + /* + * We have reached the last run so we were going to + * overflow when executing the ntfs_pread() which is + * BAAAAAAAD! + * Temporary fix: + * Allocate a new buffer with size: + * rl[i].length << vol->cluster_size_bits, do the + * read into our buffer, then memcpy the correct + * amount of data into the caller supplied buffer, + * free our buffer, and continue. + * We have reached the end of data size so we were + * going to overflow in the same fashion. + * Temporary fix: same as above. + */ + intbuf = ntfs_malloc(rl[i].length << vol->cluster_size_bits); + if (!intbuf) { + free(rl); + return 0; + } + /* + * FIXME: If compressed file: Only read if lcn != -1. + * Otherwise, we are dealing with a sparse run and we + * just memset the user buffer to 0 for the length of + * the run, which should be 16 (= compression unit + * size). + * FIXME: Really only when file is compressed, or can + * we have sparse runs in uncompressed files as well? + * - Yes we can, in sparse files! But not necessarily + * size of 16, just run length. + */ + r = ntfs_pread(vol->dev, rl[i].lcn << + vol->cluster_size_bits, rl[i].length << + vol->cluster_size_bits, intbuf); + if (r != rl[i].length << vol->cluster_size_bits) { +#define ESTR "Error reading attribute value" + if (r == -1) + ntfs_log_perror(ESTR); + else if (r < rl[i].length << + vol->cluster_size_bits) { + ntfs_log_debug(ESTR ": Ran out of input data.\n"); + errno = EIO; + } else { + ntfs_log_debug(ESTR ": unknown error\n"); + errno = EIO; + } +#undef ESTR + free(rl); + free(intbuf); + return 0; + } + memcpy(b + total, intbuf, sle64_to_cpu(a->data_size) - + total); + free(intbuf); + total = sle64_to_cpu(a->data_size); + break; + } + /* + * FIXME: If compressed file: Only read if lcn != -1. + * Otherwise, we are dealing with a sparse run and we just + * memset the user buffer to 0 for the length of the run, which + * should be 16 (= compression unit size). + * FIXME: Really only when file is compressed, or can + * we have sparse runs in uncompressed files as well? + * - Yes we can, in sparse files! But not necessarily size of + * 16, just run length. + */ + r = ntfs_pread(vol->dev, rl[i].lcn << vol->cluster_size_bits, + rl[i].length << vol->cluster_size_bits, + b + total); + if (r != rl[i].length << vol->cluster_size_bits) { +#define ESTR "Error reading attribute value" + if (r == -1) + ntfs_log_perror(ESTR); + else if (r < rl[i].length << vol->cluster_size_bits) { + ntfs_log_debug(ESTR ": Ran out of input data.\n"); + errno = EIO; + } else { + ntfs_log_debug(ESTR ": unknown error\n"); + errno = EIO; + } +#undef ESTR + free(rl); + return 0; + } + total += r; + } + free(rl); + return total; +} + +/* Already cleaned up code below, but still look for FIXME:... */ + +/** + * __ntfs_attr_init - primary initialization of an ntfs attribute structure + * @na: ntfs attribute to initialize + * @ni: ntfs inode with which to initialize the ntfs attribute + * @type: attribute type + * @name: attribute name in little endian Unicode or NULL + * @name_len: length of attribute @name in Unicode characters (if @name given) + * + * Initialize the ntfs attribute @na with @ni, @type, @name, and @name_len. + */ +static void __ntfs_attr_init(ntfs_attr *na, ntfs_inode *ni, + const ATTR_TYPES type, ntfschar *name, const u32 name_len) +{ + na->rl = NULL; + na->ni = ni; + na->type = type; + na->name = name; + if (name) + na->name_len = name_len; + else + na->name_len = 0; +} + +/** + * ntfs_attr_init - initialize an ntfs_attr with data sizes and status + * @na: + * @non_resident: + * @compressed: + * @encrypted: + * @sparse: + * @allocated_size: + * @data_size: + * @initialized_size: + * @compressed_size: + * @compression_unit: + * + * Final initialization for an ntfs attribute. + */ +void ntfs_attr_init(ntfs_attr *na, const BOOL non_resident, + const ATTR_FLAGS data_flags, + const BOOL encrypted, const BOOL sparse, + const s64 allocated_size, const s64 data_size, + const s64 initialized_size, const s64 compressed_size, + const u8 compression_unit) +{ + if (!NAttrInitialized(na)) { + na->data_flags = data_flags; + if (non_resident) + NAttrSetNonResident(na); + if (data_flags & ATTR_COMPRESSION_MASK) + NAttrSetCompressed(na); + if (encrypted) + NAttrSetEncrypted(na); + if (sparse) + NAttrSetSparse(na); + na->allocated_size = allocated_size; + na->data_size = data_size; + na->initialized_size = initialized_size; + if ((data_flags & ATTR_COMPRESSION_MASK) || sparse) { + ntfs_volume *vol = na->ni->vol; + + na->compressed_size = compressed_size; + na->compression_block_clusters = 1 << compression_unit; + na->compression_block_size = 1 << (compression_unit + + vol->cluster_size_bits); + na->compression_block_size_bits = ffs( + na->compression_block_size) - 1; + } + NAttrSetInitialized(na); + } +} + +/** + * ntfs_attr_open - open an ntfs attribute for access + * @ni: open ntfs inode in which the ntfs attribute resides + * @type: attribute type + * @name: attribute name in little endian Unicode or AT_UNNAMED or NULL + * @name_len: length of attribute @name in Unicode characters (if @name given) + * + * Allocate a new ntfs attribute structure, initialize it with @ni, @type, + * @name, and @name_len, then return it. Return NULL on error with + * errno set to the error code. + * + * If @name is AT_UNNAMED look specifically for an unnamed attribute. If you + * do not care whether the attribute is named or not set @name to NULL. In + * both those cases @name_len is not used at all. + */ +ntfs_attr *ntfs_attr_open(ntfs_inode *ni, const ATTR_TYPES type, + ntfschar *name, u32 name_len) +{ + ntfs_attr_search_ctx *ctx; + ntfs_attr *na = NULL; + ntfschar *newname = NULL; + ATTR_RECORD *a; + le16 cs; + + ntfs_log_enter("Entering for inode %lld, attr 0x%x.\n", + (unsigned long long)ni->mft_no, type); + + if (!ni || !ni->vol || !ni->mrec) { + errno = EINVAL; + goto out; + } + na = ntfs_calloc(sizeof(ntfs_attr)); + if (!na) + goto out; + if (name && name != AT_UNNAMED && name != NTFS_INDEX_I30) { + name = ntfs_ucsndup(name, name_len); + if (!name) + goto err_out; + newname = name; + } + + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + goto err_out; + + if (ntfs_attr_lookup(type, name, name_len, 0, 0, NULL, 0, ctx)) + goto put_err_out; + + a = ctx->attr; + + if (!name) { + if (a->name_length) { + name = ntfs_ucsndup((ntfschar*)((u8*)a + le16_to_cpu( + a->name_offset)), a->name_length); + if (!name) + goto put_err_out; + newname = name; + name_len = a->name_length; + } else { + name = AT_UNNAMED; + name_len = 0; + } + } + + __ntfs_attr_init(na, ni, type, name, name_len); + + /* + * Wipe the flags in case they are not zero for an attribute list + * attribute. Windows does not complain about invalid flags and chkdsk + * does not detect or fix them so we need to cope with it, too. + */ + if (type == AT_ATTRIBUTE_LIST) + a->flags = 0; + + if ((type == AT_DATA) && !a->initialized_size) { + /* + * Define/redefine the compression state if stream is + * empty, based on the compression mark on parent + * directory (for unnamed data streams) or on current + * inode (for named data streams). The compression mark + * may change any time, the compression state can only + * change when stream is wiped out. + * + * Also prevent compression on NTFS version < 3.0 + * or cluster size > 4K or compression is disabled + */ + a->flags &= ~ATTR_COMPRESSION_MASK; + if ((ni->flags & FILE_ATTR_COMPRESSED) + && (ni->vol->major_ver >= 3) + && NVolCompression(ni->vol) + && (ni->vol->cluster_size <= MAX_COMPRESSION_CLUSTER_SIZE)) + a->flags |= ATTR_IS_COMPRESSED; + } + + cs = a->flags & (ATTR_IS_COMPRESSED | ATTR_IS_SPARSE); + + if (na->type == AT_DATA && na->name == AT_UNNAMED && + ((!(a->flags & ATTR_IS_SPARSE) != !NAttrSparse(na)) || + (!(a->flags & ATTR_IS_ENCRYPTED) != !NAttrEncrypted(na)))) { + errno = EIO; + ntfs_log_perror("Inode %lld has corrupt attribute flags " + "(0x%x <> 0x%x)",(unsigned long long)ni->mft_no, + a->flags, na->ni->flags); + goto put_err_out; + } + + if (a->non_resident) { + if ((a->flags & ATTR_COMPRESSION_MASK) + && !a->compression_unit) { + errno = EIO; + ntfs_log_perror("Compressed inode %lld attr 0x%x has " + "no compression unit", + (unsigned long long)ni->mft_no, type); + goto put_err_out; + } + ntfs_attr_init(na, TRUE, a->flags, + a->flags & ATTR_IS_ENCRYPTED, + a->flags & ATTR_IS_SPARSE, + sle64_to_cpu(a->allocated_size), + sle64_to_cpu(a->data_size), + sle64_to_cpu(a->initialized_size), + cs ? sle64_to_cpu(a->compressed_size) : 0, + cs ? a->compression_unit : 0); + } else { + s64 l = le32_to_cpu(a->value_length); + ntfs_attr_init(na, FALSE, a->flags, + a->flags & ATTR_IS_ENCRYPTED, + a->flags & ATTR_IS_SPARSE, (l + 7) & ~7, l, l, + cs ? (l + 7) & ~7 : 0, 0); + } + ntfs_attr_put_search_ctx(ctx); +out: + ntfs_log_leave("\n"); + return na; + +put_err_out: + ntfs_attr_put_search_ctx(ctx); +err_out: + free(newname); + free(na); + na = NULL; + goto out; +} + +/** + * ntfs_attr_close - free an ntfs attribute structure + * @na: ntfs attribute structure to free + * + * Release all memory associated with the ntfs attribute @na and then release + * @na itself. + */ +void ntfs_attr_close(ntfs_attr *na) +{ + if (!na) + return; + if (NAttrNonResident(na) && na->rl) + free(na->rl); + /* Don't release if using an internal constant. */ + if (na->name != AT_UNNAMED && na->name != NTFS_INDEX_I30 + && na->name != STREAM_SDS) + free(na->name); + free(na); +} + +/** + * ntfs_attr_map_runlist - map (a part of) a runlist of an ntfs attribute + * @na: ntfs attribute for which to map (part of) a runlist + * @vcn: map runlist part containing this vcn + * + * Map the part of a runlist containing the @vcn of the ntfs attribute @na. + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +int ntfs_attr_map_runlist(ntfs_attr *na, VCN vcn) +{ + LCN lcn; + ntfs_attr_search_ctx *ctx; + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x, vcn 0x%llx.\n", + (unsigned long long)na->ni->mft_no, na->type, (long long)vcn); + + lcn = ntfs_rl_vcn_to_lcn(na->rl, vcn); + if (lcn >= 0 || lcn == LCN_HOLE || lcn == LCN_ENOENT) + return 0; + + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + return -1; + + /* Find the attribute in the mft record. */ + if (!ntfs_attr_lookup(na->type, na->name, na->name_len, CASE_SENSITIVE, + vcn, NULL, 0, ctx)) { + runlist_element *rl; + + /* Decode the runlist. */ + rl = ntfs_mapping_pairs_decompress(na->ni->vol, ctx->attr, + na->rl); + if (rl) { + na->rl = rl; + ntfs_attr_put_search_ctx(ctx); + return 0; + } + } + + ntfs_attr_put_search_ctx(ctx); + return -1; +} + +#if PARTIAL_RUNLIST_UPDATING + +/* + * Map the runlist of an attribute from some point to the end + * + * Returns 0 if success, + * -1 if it failed (errno telling why) + */ + +static int ntfs_attr_map_partial_runlist(ntfs_attr *na, VCN vcn) +{ + LCN lcn; + VCN last_vcn; + VCN highest_vcn; + VCN needed; + VCN existing_vcn; + runlist_element *rl; + ATTR_RECORD *a; + BOOL startseen; + ntfs_attr_search_ctx *ctx; + + lcn = ntfs_rl_vcn_to_lcn(na->rl, vcn); + if (lcn >= 0 || lcn == LCN_HOLE || lcn == LCN_ENOENT) + return 0; + + existing_vcn = (na->rl ? na->rl->vcn : -1); + + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + return -1; + + /* Get the last vcn in the attribute. */ + last_vcn = na->allocated_size >> na->ni->vol->cluster_size_bits; + + needed = vcn; + highest_vcn = 0; + startseen = FALSE; + do { + /* Find the attribute in the mft record. */ + if (!ntfs_attr_lookup(na->type, na->name, na->name_len, CASE_SENSITIVE, + needed, NULL, 0, ctx)) { + + a = ctx->attr; + /* Decode and merge the runlist. */ + rl = ntfs_mapping_pairs_decompress(na->ni->vol, a, + na->rl); + if (rl) { + na->rl = rl; + highest_vcn = le64_to_cpu(a->highest_vcn); + /* corruption detection */ + if (((highest_vcn + 1) < last_vcn) + && ((highest_vcn + 1) <= needed)) { + ntfs_log_error("Corrupt attribute list\n"); + rl = (runlist_element*)NULL; + } + needed = highest_vcn + 1; + if (!a->lowest_vcn) + startseen = TRUE; + /* reaching a previously allocated part ? */ + if ((existing_vcn >= 0) + && (needed >= existing_vcn)) { + needed = last_vcn; + } + } + } else + rl = (runlist_element*)NULL; + } while (rl && (needed < last_vcn)); + ntfs_attr_put_search_ctx(ctx); + /* mark fully mapped if we did so */ + if (rl && startseen) + NAttrSetFullyMapped(na); + return (rl ? 0 : -1); +} + +#endif + +/** + * ntfs_attr_map_whole_runlist - map the whole runlist of an ntfs attribute + * @na: ntfs attribute for which to map the runlist + * + * Map the whole runlist of the ntfs attribute @na. For an attribute made up + * of only one attribute extent this is the same as calling + * ntfs_attr_map_runlist(na, 0) but for an attribute with multiple extents this + * will map the runlist fragments from each of the extents thus giving access + * to the entirety of the disk allocation of an attribute. + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +int ntfs_attr_map_whole_runlist(ntfs_attr *na) +{ + VCN next_vcn, last_vcn, highest_vcn; + ntfs_attr_search_ctx *ctx; + ntfs_volume *vol = na->ni->vol; + ATTR_RECORD *a; + int ret = -1; + + ntfs_log_enter("Entering for inode %llu, attr 0x%x.\n", + (unsigned long long)na->ni->mft_no, na->type); + + /* avoid multiple full runlist mappings */ + if (NAttrFullyMapped(na)) { + ret = 0; + goto out; + } + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + goto out; + + /* Map all attribute extents one by one. */ + next_vcn = last_vcn = highest_vcn = 0; + a = NULL; + while (1) { + runlist_element *rl; + + int not_mapped = 0; + if (ntfs_rl_vcn_to_lcn(na->rl, next_vcn) == LCN_RL_NOT_MAPPED) + not_mapped = 1; + + if (ntfs_attr_lookup(na->type, na->name, na->name_len, + CASE_SENSITIVE, next_vcn, NULL, 0, ctx)) + break; + + a = ctx->attr; + + if (not_mapped) { + /* Decode the runlist. */ + rl = ntfs_mapping_pairs_decompress(na->ni->vol, + a, na->rl); + if (!rl) + goto err_out; + na->rl = rl; + } + + /* Are we in the first extent? */ + if (!next_vcn) { + if (a->lowest_vcn) { + errno = EIO; + ntfs_log_perror("First extent of inode %llu " + "attribute has non-zero lowest_vcn", + (unsigned long long)na->ni->mft_no); + goto err_out; + } + /* Get the last vcn in the attribute. */ + last_vcn = sle64_to_cpu(a->allocated_size) >> + vol->cluster_size_bits; + } + + /* Get the lowest vcn for the next extent. */ + highest_vcn = sle64_to_cpu(a->highest_vcn); + next_vcn = highest_vcn + 1; + + /* Only one extent or error, which we catch below. */ + if (next_vcn <= 0) { + errno = ENOENT; + break; + } + + /* Avoid endless loops due to corruption. */ + if (next_vcn < sle64_to_cpu(a->lowest_vcn)) { + errno = EIO; + ntfs_log_perror("Inode %llu has corrupt attribute list", + (unsigned long long)na->ni->mft_no); + goto err_out; + } + } + if (!a) { + ntfs_log_perror("Couldn't find attribute for runlist mapping"); + goto err_out; + } + if (highest_vcn && highest_vcn != last_vcn - 1) { + errno = EIO; + ntfs_log_perror("Failed to load full runlist: inode: %llu " + "highest_vcn: 0x%llx last_vcn: 0x%llx", + (unsigned long long)na->ni->mft_no, + (long long)highest_vcn, (long long)last_vcn); + goto err_out; + } + if (errno == ENOENT) { + NAttrSetFullyMapped(na); + ret = 0; + } +err_out: + ntfs_attr_put_search_ctx(ctx); +out: + ntfs_log_leave("\n"); + return ret; +} + +/** + * ntfs_attr_vcn_to_lcn - convert a vcn into a lcn given an ntfs attribute + * @na: ntfs attribute whose runlist to use for conversion + * @vcn: vcn to convert + * + * Convert the virtual cluster number @vcn of an attribute into a logical + * cluster number (lcn) of a device using the runlist @na->rl to map vcns to + * their corresponding lcns. + * + * If the @vcn is not mapped yet, attempt to map the attribute extent + * containing the @vcn and retry the vcn to lcn conversion. + * + * Since lcns must be >= 0, we use negative return values with special meaning: + * + * Return value Meaning / Description + * ========================================== + * -1 = LCN_HOLE Hole / not allocated on disk. + * -3 = LCN_ENOENT There is no such vcn in the attribute. + * -4 = LCN_EINVAL Input parameter error. + * -5 = LCN_EIO Corrupt fs, disk i/o error, or not enough memory. + */ +LCN ntfs_attr_vcn_to_lcn(ntfs_attr *na, const VCN vcn) +{ + LCN lcn; + BOOL is_retry = FALSE; + + if (!na || !NAttrNonResident(na) || vcn < 0) + return (LCN)LCN_EINVAL; + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x.\n", (unsigned long + long)na->ni->mft_no, na->type); +retry: + /* Convert vcn to lcn. If that fails map the runlist and retry once. */ + lcn = ntfs_rl_vcn_to_lcn(na->rl, vcn); + if (lcn >= 0) + return lcn; + if (!is_retry && !ntfs_attr_map_runlist(na, vcn)) { + is_retry = TRUE; + goto retry; + } + /* + * If the attempt to map the runlist failed, or we are getting + * LCN_RL_NOT_MAPPED despite having mapped the attribute extent + * successfully, something is really badly wrong... + */ + if (!is_retry || lcn == (LCN)LCN_RL_NOT_MAPPED) + return (LCN)LCN_EIO; + /* lcn contains the appropriate error code. */ + return lcn; +} + +/** + * ntfs_attr_find_vcn - find a vcn in the runlist of an ntfs attribute + * @na: ntfs attribute whose runlist to search + * @vcn: vcn to find + * + * Find the virtual cluster number @vcn in the runlist of the ntfs attribute + * @na and return the the address of the runlist element containing the @vcn. + * + * Note you need to distinguish between the lcn of the returned runlist + * element being >= 0 and LCN_HOLE. In the later case you have to return zeroes + * on read and allocate clusters on write. You need to update the runlist, the + * attribute itself as well as write the modified mft record to disk. + * + * If there is an error return NULL with errno set to the error code. The + * following error codes are defined: + * EINVAL Input parameter error. + * ENOENT There is no such vcn in the runlist. + * ENOMEM Not enough memory. + * EIO I/O error or corrupt metadata. + */ +runlist_element *ntfs_attr_find_vcn(ntfs_attr *na, const VCN vcn) +{ + runlist_element *rl; + BOOL is_retry = FALSE; + + if (!na || !NAttrNonResident(na) || vcn < 0) { + errno = EINVAL; + return NULL; + } + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x, vcn %llx\n", + (unsigned long long)na->ni->mft_no, na->type, + (long long)vcn); +retry: + rl = na->rl; + if (!rl) + goto map_rl; + if (vcn < rl[0].vcn) + goto map_rl; + while (rl->length) { + if (vcn < rl[1].vcn) { + if (rl->lcn >= (LCN)LCN_HOLE) + return rl; + break; + } + rl++; + } + switch (rl->lcn) { + case (LCN)LCN_RL_NOT_MAPPED: + goto map_rl; + case (LCN)LCN_ENOENT: + errno = ENOENT; + break; + case (LCN)LCN_EINVAL: + errno = EINVAL; + break; + default: + errno = EIO; + break; + } + return NULL; +map_rl: + /* The @vcn is in an unmapped region, map the runlist and retry. */ + if (!is_retry && !ntfs_attr_map_runlist(na, vcn)) { + is_retry = TRUE; + goto retry; + } + /* + * If we already retried or the mapping attempt failed something has + * gone badly wrong. EINVAL and ENOENT coming from a failed mapping + * attempt are equivalent to errors for us as they should not happen + * in our code paths. + */ + if (is_retry || errno == EINVAL || errno == ENOENT) + errno = EIO; + return NULL; +} + +/** + * ntfs_attr_pread_i - see description at ntfs_attr_pread() + */ +static s64 ntfs_attr_pread_i(ntfs_attr *na, const s64 pos, s64 count, void *b) +{ + s64 br, to_read, ofs, total, total2, max_read, max_init; + ntfs_volume *vol; + runlist_element *rl; + u16 efs_padding_length; + + /* Sanity checking arguments is done in ntfs_attr_pread(). */ + + if ((na->data_flags & ATTR_COMPRESSION_MASK) && NAttrNonResident(na)) { + if ((na->data_flags & ATTR_COMPRESSION_MASK) + == ATTR_IS_COMPRESSED) + return ntfs_compressed_attr_pread(na, pos, count, b); + else { + /* compression mode not supported */ + errno = EOPNOTSUPP; + return -1; + } + } + /* + * Encrypted non-resident attributes are not supported. We return + * access denied, which is what Windows NT4 does, too. + * However, allow if mounted with efs_raw option + */ + vol = na->ni->vol; + if (!vol->efs_raw && NAttrEncrypted(na) && NAttrNonResident(na)) { + errno = EACCES; + return -1; + } + + if (!count) + return 0; + /* + * Truncate reads beyond end of attribute, + * but round to next 512 byte boundary for encrypted + * attributes with efs_raw mount option + */ + max_read = na->data_size; + max_init = na->initialized_size; + if (na->ni->vol->efs_raw + && (na->data_flags & ATTR_IS_ENCRYPTED) + && NAttrNonResident(na)) { + if (na->data_size != na->initialized_size) { + ntfs_log_error("uninitialized encrypted file not supported\n"); + errno = EINVAL; + return -1; + } + max_init = max_read = ((na->data_size + 511) & ~511) + 2; + } + if (pos + count > max_read) { + if (pos >= max_read) + return 0; + count = max_read - pos; + } + /* If it is a resident attribute, get the value from the mft record. */ + if (!NAttrNonResident(na)) { + ntfs_attr_search_ctx *ctx; + char *val; + + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + return -1; + if (ntfs_attr_lookup(na->type, na->name, na->name_len, 0, + 0, NULL, 0, ctx)) { +res_err_out: + ntfs_attr_put_search_ctx(ctx); + return -1; + } + val = (char*)ctx->attr + le16_to_cpu(ctx->attr->value_offset); + if (val < (char*)ctx->attr || val + + le32_to_cpu(ctx->attr->value_length) > + (char*)ctx->mrec + vol->mft_record_size) { + errno = EIO; + ntfs_log_perror("%s: Sanity check failed", __FUNCTION__); + goto res_err_out; + } + memcpy(b, val + pos, count); + ntfs_attr_put_search_ctx(ctx); + return count; + } + total = total2 = 0; + /* Zero out reads beyond initialized size. */ + if (pos + count > max_init) { + if (pos >= max_init) { + memset(b, 0, count); + return count; + } + total2 = pos + count - max_init; + count -= total2; + memset((u8*)b + count, 0, total2); + } + /* + * for encrypted non-resident attributes with efs_raw set + * the last two bytes aren't read from disk but contain + * the number of padding bytes so original size can be + * restored + */ + if (na->ni->vol->efs_raw && + (na->data_flags & ATTR_IS_ENCRYPTED) && + ((pos + count) > max_init-2)) { + efs_padding_length = 511 - ((na->data_size - 1) & 511); + if (pos+count == max_init) { + if (count == 1) { + *((u8*)b+count-1) = (u8)(efs_padding_length >> 8); + count--; + total2++; + } else { + *(u16*)((u8*)b+count-2) = cpu_to_le16(efs_padding_length); + count -= 2; + total2 +=2; + } + } else { + *((u8*)b+count-1) = (u8)(efs_padding_length & 0xff); + count--; + total2++; + } + } + + /* Find the runlist element containing the vcn. */ + rl = ntfs_attr_find_vcn(na, pos >> vol->cluster_size_bits); + if (!rl) { + /* + * If the vcn is not present it is an out of bounds read. + * However, we already truncated the read to the data_size, + * so getting this here is an error. + */ + if (errno == ENOENT) { + errno = EIO; + ntfs_log_perror("%s: Failed to find VCN #1", __FUNCTION__); + } + return -1; + } + /* + * Gather the requested data into the linear destination buffer. Note, + * a partial final vcn is taken care of by the @count capping of read + * length. + */ + ofs = pos - (rl->vcn << vol->cluster_size_bits); + for (; count; rl++, ofs = 0) { + if (rl->lcn == LCN_RL_NOT_MAPPED) { + rl = ntfs_attr_find_vcn(na, rl->vcn); + if (!rl) { + if (errno == ENOENT) { + errno = EIO; + ntfs_log_perror("%s: Failed to find VCN #2", + __FUNCTION__); + } + goto rl_err_out; + } + /* Needed for case when runs merged. */ + ofs = pos + total - (rl->vcn << vol->cluster_size_bits); + } + if (!rl->length) { + errno = EIO; + ntfs_log_perror("%s: Zero run length", __FUNCTION__); + goto rl_err_out; + } + if (rl->lcn < (LCN)0) { + if (rl->lcn != (LCN)LCN_HOLE) { + ntfs_log_perror("%s: Bad run (%lld)", + __FUNCTION__, + (long long)rl->lcn); + goto rl_err_out; + } + /* It is a hole, just zero the matching @b range. */ + to_read = min(count, (rl->length << + vol->cluster_size_bits) - ofs); + memset(b, 0, to_read); + /* Update progress counters. */ + total += to_read; + count -= to_read; + b = (u8*)b + to_read; + continue; + } + /* It is a real lcn, read it into @dst. */ + to_read = min(count, (rl->length << vol->cluster_size_bits) - + ofs); +retry: + ntfs_log_trace("Reading %lld bytes from vcn %lld, lcn %lld, ofs" + " %lld.\n", (long long)to_read, (long long)rl->vcn, + (long long )rl->lcn, (long long)ofs); + br = ntfs_pread(vol->dev, (rl->lcn << vol->cluster_size_bits) + + ofs, to_read, b); + /* If everything ok, update progress counters and continue. */ + if (br > 0) { + total += br; + count -= br; + b = (u8*)b + br; + } + if (br == to_read) + continue; + /* If the syscall was interrupted, try again. */ + if (br == (s64)-1 && errno == EINTR) + goto retry; + if (total) + return total; + if (!br) + errno = EIO; + ntfs_log_perror("%s: ntfs_pread failed", __FUNCTION__); + return -1; + } + /* Finally, return the number of bytes read. */ + return total + total2; +rl_err_out: + if (total) + return total; + errno = EIO; + return -1; +} + +/** + * ntfs_attr_pread - read from an attribute specified by an ntfs_attr structure + * @na: ntfs attribute to read from + * @pos: byte position in the attribute to begin reading from + * @count: number of bytes to read + * @b: output data buffer + * + * This function will read @count bytes starting at offset @pos from the ntfs + * attribute @na into the data buffer @b. + * + * On success, return the number of successfully read bytes. If this number is + * lower than @count this means that the read reached end of file or that an + * error was encountered during the read so that the read is partial. 0 means + * end of file or nothing was read (also return 0 when @count is 0). + * + * On error and nothing has been read, return -1 with errno set appropriately + * to the return code of ntfs_pread(), or to EINVAL in case of invalid + * arguments. + */ +s64 ntfs_attr_pread(ntfs_attr *na, const s64 pos, s64 count, void *b) +{ + s64 ret; + + if (!na || !na->ni || !na->ni->vol || !b || pos < 0 || count < 0) { + errno = EINVAL; + ntfs_log_perror("%s: na=%p b=%p pos=%lld count=%lld", + __FUNCTION__, na, b, (long long)pos, + (long long)count); + return -1; + } + + ntfs_log_enter("Entering for inode %lld attr 0x%x pos %lld count " + "%lld\n", (unsigned long long)na->ni->mft_no, + na->type, (long long)pos, (long long)count); + + ret = ntfs_attr_pread_i(na, pos, count, b); + + ntfs_log_leave("\n"); + return ret; +} + +static int ntfs_attr_fill_zero(ntfs_attr *na, s64 pos, s64 count) +{ + char *buf; + s64 written, size, end = pos + count; + s64 ofsi; + const runlist_element *rli; + ntfs_volume *vol; + int ret = -1; + + ntfs_log_trace("pos %lld, count %lld\n", (long long)pos, + (long long)count); + + if (!na || pos < 0 || count < 0) { + errno = EINVAL; + goto err_out; + } + + buf = ntfs_calloc(NTFS_BUF_SIZE); + if (!buf) + goto err_out; + + rli = na->rl; + ofsi = 0; + vol = na->ni->vol; + while (pos < end) { + while (rli->length && (ofsi + (rli->length << + vol->cluster_size_bits) <= pos)) { + ofsi += (rli->length << vol->cluster_size_bits); + rli++; + } + size = min(end - pos, NTFS_BUF_SIZE); + /* + * If the zeroed block is fully within a hole, + * we need not write anything, so advance as far + * as possible within the hole. + */ + if ((rli->lcn == (LCN)LCN_HOLE) + && (ofsi <= pos) + && (ofsi + (rli->length << vol->cluster_size_bits) + >= (pos + size))) { + size = min(end - pos, ofsi - pos + + (rli->length << vol->cluster_size_bits)); + pos += size; + } else { + written = ntfs_rl_pwrite(vol, rli, ofsi, pos, + size, buf); + if (written <= 0) { + ntfs_log_perror("Failed to zero space"); + goto err_free; + } + pos += written; + } + } + + ret = 0; +err_free: + free(buf); +err_out: + return ret; +} + +static int ntfs_attr_fill_hole(ntfs_attr *na, s64 count, s64 *ofs, + runlist_element **rl, VCN *update_from) +{ + s64 to_write; + s64 need; + ntfs_volume *vol = na->ni->vol; + int eo, ret = -1; + runlist *rlc; + LCN lcn_seek_from = -1; + VCN cur_vcn, from_vcn; + + to_write = min(count, ((*rl)->length << vol->cluster_size_bits) - *ofs); + + cur_vcn = (*rl)->vcn; + from_vcn = (*rl)->vcn + (*ofs >> vol->cluster_size_bits); + + ntfs_log_trace("count: %lld, cur_vcn: %lld, from: %lld, to: %lld, ofs: " + "%lld\n", (long long)count, (long long)cur_vcn, + (long long)from_vcn, (long long)to_write, (long long)*ofs); + + /* Map the runlist to be able to update mapping pairs later. */ +#if PARTIAL_RUNLIST_UPDATING + if ((!na->rl + || !NAttrDataAppending(na))) { + if (ntfs_attr_map_whole_runlist(na)) + goto err_out; + } else { + /* make sure the previous non-hole is mapped */ + rlc = *rl; + rlc--; + if (((*rl)->lcn == LCN_HOLE) + && cur_vcn + && (rlc->vcn < 0)) { + if (ntfs_attr_map_partial_runlist(na, cur_vcn - 1)) + goto err_out; + } + } +#else + if (ntfs_attr_map_whole_runlist(na)) + goto err_out; +#endif + + /* Restore @*rl, it probably get lost during runlist mapping. */ + *rl = ntfs_attr_find_vcn(na, cur_vcn); + if (!*rl) { + ntfs_log_error("Failed to find run after mapping runlist. " + "Please report to %s.\n", NTFS_DEV_LIST); + errno = EIO; + goto err_out; + } + + /* Search backwards to find the best lcn to start seek from. */ + rlc = *rl; + while (rlc->vcn) { + rlc--; + if (rlc->lcn >= 0) { + /* + * avoid fragmenting a compressed file + * Windows does not do that, and that may + * not be desirable for files which can + * be updated + */ + if (na->data_flags & ATTR_COMPRESSION_MASK) + lcn_seek_from = rlc->lcn + rlc->length; + else + lcn_seek_from = rlc->lcn + (from_vcn - rlc->vcn); + break; + } + } + if (lcn_seek_from == -1) { + /* Backwards search failed, search forwards. */ + rlc = *rl; + while (rlc->length) { + rlc++; + if (rlc->lcn >= 0) { + lcn_seek_from = rlc->lcn - (rlc->vcn - from_vcn); + if (lcn_seek_from < -1) + lcn_seek_from = -1; + break; + } + } + } + + need = ((*ofs + to_write - 1) >> vol->cluster_size_bits) + + 1 + (*rl)->vcn - from_vcn; + if ((na->data_flags & ATTR_COMPRESSION_MASK) + && (need < na->compression_block_clusters)) { + /* + * for a compressed file, be sure to allocate the full + * compression block, as we may need space to decompress + * existing compressed data. + * So allocate the space common to compression block + * and existing hole. + */ + VCN alloc_vcn; + + if ((from_vcn & -na->compression_block_clusters) <= (*rl)->vcn) + alloc_vcn = (*rl)->vcn; + else + alloc_vcn = from_vcn & -na->compression_block_clusters; + need = (alloc_vcn | (na->compression_block_clusters - 1)) + + 1 - alloc_vcn; + if (need > (*rl)->length) { + ntfs_log_error("Cannot allocate %lld clusters" + " within a hole of %lld\n", + (long long)need, + (long long)(*rl)->length); + errno = EIO; + goto err_out; + } + rlc = ntfs_cluster_alloc(vol, alloc_vcn, need, + lcn_seek_from, DATA_ZONE); + } else + rlc = ntfs_cluster_alloc(vol, from_vcn, need, + lcn_seek_from, DATA_ZONE); + if (!rlc) + goto err_out; + if (na->data_flags & (ATTR_COMPRESSION_MASK | ATTR_IS_SPARSE)) + na->compressed_size += need << vol->cluster_size_bits; + + *rl = ntfs_runlists_merge(na->rl, rlc); + /* + * For a compressed attribute, we must be sure there are two + * available entries, so reserve them before it gets too late. + */ + if (*rl && (na->data_flags & ATTR_COMPRESSION_MASK)) { + runlist_element *oldrl = na->rl; + na->rl = *rl; + *rl = ntfs_rl_extend(na,*rl,2); + if (!*rl) na->rl = oldrl; /* restore to original if failed */ + } + if (!*rl) { + eo = errno; + ntfs_log_perror("Failed to merge runlists"); + if (ntfs_cluster_free_from_rl(vol, rlc)) { + ntfs_log_perror("Failed to free hot clusters. " + "Please run chkdsk /f"); + } + errno = eo; + goto err_out; + } + na->unused_runs = 2; + na->rl = *rl; + if ((*update_from == -1) || (from_vcn < *update_from)) + *update_from = from_vcn; + *rl = ntfs_attr_find_vcn(na, cur_vcn); + if (!*rl) { + /* + * It's definitely a BUG, if we failed to find @cur_vcn, because + * we missed it during instantiating of the hole. + */ + ntfs_log_error("Failed to find run after hole instantiation. " + "Please report to %s.\n", NTFS_DEV_LIST); + errno = EIO; + goto err_out; + } + /* If leaved part of the hole go to the next run. */ + if ((*rl)->lcn < 0) + (*rl)++; + /* Now LCN shoudn't be less than 0. */ + if ((*rl)->lcn < 0) { + ntfs_log_error("BUG! LCN is lesser than 0. " + "Please report to the %s.\n", NTFS_DEV_LIST); + errno = EIO; + goto err_out; + } + if (*ofs) { + /* Clear non-sparse region from @cur_vcn to @*ofs. */ + if (ntfs_attr_fill_zero(na, cur_vcn << vol->cluster_size_bits, + *ofs)) + goto err_out; + } + if ((*rl)->vcn < cur_vcn) { + /* + * Clusters that replaced hole are merged with + * previous run, so we need to update offset. + */ + *ofs += (cur_vcn - (*rl)->vcn) << vol->cluster_size_bits; + } + if ((*rl)->vcn > cur_vcn) { + /* + * We left part of the hole, so we need to update offset + */ + *ofs -= ((*rl)->vcn - cur_vcn) << vol->cluster_size_bits; + } + + ret = 0; +err_out: + return ret; +} + +static int stuff_hole(ntfs_attr *na, const s64 pos); + +/* + * Split an existing hole for overwriting with data + * The hole may have to be split into two or three parts, so + * that the overwritten part fits within a single compression block + * + * No cluster allocation is needed, this will be done later in + * standard hole filling, hence no need to reserve runs for + * future needs. + * + * Returns the number of clusters with existing compressed data + * in the compression block to be written to + * (or the full block, if it was a full hole) + * -1 if there were an error + */ + +static int split_compressed_hole(ntfs_attr *na, runlist_element **prl, + s64 pos, s64 count, VCN *update_from) +{ + int compressed_part; + int cluster_size_bits = na->ni->vol->cluster_size_bits; + runlist_element *rl = *prl; + + compressed_part + = na->compression_block_clusters; + /* reserve entries in runlist if we have to split */ + if (rl->length > na->compression_block_clusters) { + *prl = ntfs_rl_extend(na,*prl,2); + if (!*prl) { + compressed_part = -1; + } else { + rl = *prl; + na->unused_runs = 2; + } + } + if (*prl && (rl->length > na->compression_block_clusters)) { + /* + * Locate the update part relative to beginning of + * current run + */ + int beginwrite = (pos >> cluster_size_bits) - rl->vcn; + s32 endblock = (((pos + count - 1) >> cluster_size_bits) + | (na->compression_block_clusters - 1)) + 1 - rl->vcn; + + compressed_part = na->compression_block_clusters + - (rl->length & (na->compression_block_clusters - 1)); + if ((beginwrite + compressed_part) >= na->compression_block_clusters) + compressed_part = na->compression_block_clusters; + /* + * if the run ends beyond end of needed block + * we have to split the run + */ + if (endblock < rl[0].length) { + runlist_element *xrl; + int n; + + /* + * we have to split into three parts if the run + * does not end within the first compression block. + * This means the hole begins before the + * compression block. + */ + if (endblock > na->compression_block_clusters) { + if (na->unused_runs < 2) { +ntfs_log_error("No free run, case 1\n"); + } + na->unused_runs -= 2; + xrl = rl; + n = 0; + while (xrl->length) { + xrl++; + n++; + } + do { + xrl[2] = *xrl; + xrl--; + } while (xrl != rl); + rl[1].length = na->compression_block_clusters; + rl[2].length = rl[0].length - endblock; + rl[0].length = endblock + - na->compression_block_clusters; + rl[1].lcn = LCN_HOLE; + rl[2].lcn = LCN_HOLE; + rl[1].vcn = rl[0].vcn + rl[0].length; + rl[2].vcn = rl[1].vcn + + na->compression_block_clusters; + rl = ++(*prl); + } else { + /* + * split into two parts and use the + * first one + */ + if (!na->unused_runs) { +ntfs_log_error("No free run, case 2\n"); + } + na->unused_runs--; + xrl = rl; + n = 0; + while (xrl->length) { + xrl++; + n++; + } + do { + xrl[1] = *xrl; + xrl--; + } while (xrl != rl); + if (beginwrite < endblock) { + /* we will write into the first part of hole */ + rl[1].length = rl[0].length - endblock; + rl[0].length = endblock; + rl[1].vcn = rl[0].vcn + rl[0].length; + rl[1].lcn = LCN_HOLE; + } else { + /* we will write into the second part of hole */ +// impossible ? + rl[1].length = rl[0].length - endblock; + rl[0].length = endblock; + rl[1].vcn = rl[0].vcn + rl[0].length; + rl[1].lcn = LCN_HOLE; + rl = ++(*prl); + } + } + } else { + if (rl[1].length) { + runlist_element *xrl; + int n; + + /* + * split into two parts and use the + * last one + */ + if (!na->unused_runs) { +ntfs_log_error("No free run, case 4\n"); + } + na->unused_runs--; + xrl = rl; + n = 0; + while (xrl->length) { + xrl++; + n++; + } + do { + xrl[1] = *xrl; + xrl--; + } while (xrl != rl); + } else { + rl[2].lcn = rl[1].lcn; + rl[2].vcn = rl[1].vcn; + rl[2].length = rl[1].length; + } + rl[1].vcn -= na->compression_block_clusters; + rl[1].lcn = LCN_HOLE; + rl[1].length = na->compression_block_clusters; + rl[0].length -= na->compression_block_clusters; + if (pos >= (rl[1].vcn << cluster_size_bits)) { + rl = ++(*prl); + } + } + if ((*update_from == -1) || ((*prl)->vcn < *update_from)) + *update_from = (*prl)->vcn; + } + return (compressed_part); +} + +/* + * Borrow space from adjacent hole for appending data + * The hole may have to be split so that the end of hole is not + * affected by cluster allocation and overwriting + * Cluster allocation is needed for the overwritten compression block + * + * Must always leave two unused entries in the runlist + * + * Returns the number of clusters with existing compressed data + * in the compression block to be written to + * -1 if there were an error + */ + +static int borrow_from_hole(ntfs_attr *na, runlist_element **prl, + s64 pos, s64 count, VCN *update_from, BOOL wasnonresident) +{ + int compressed_part = 0; + int cluster_size_bits = na->ni->vol->cluster_size_bits; + runlist_element *rl = *prl; + s32 endblock; + long long allocated; + runlist_element *zrl; + int irl; + BOOL undecided; + BOOL nothole; + + /* check whether the compression block is fully allocated */ + endblock = (((pos + count - 1) >> cluster_size_bits) | (na->compression_block_clusters - 1)) + 1 - rl->vcn; + allocated = 0; + zrl = rl; + irl = 0; + while (zrl->length && (zrl->lcn >= 0) && (allocated < endblock)) { + allocated += zrl->length; + zrl++; + irl++; + } + + undecided = (allocated < endblock) && (zrl->lcn == LCN_RL_NOT_MAPPED); + nothole = (allocated >= endblock) || (zrl->lcn != LCN_HOLE); + + if (undecided || nothole) { + runlist_element *orl = na->rl; + s64 olcn = (*prl)->lcn; +#if PARTIAL_RUNLIST_UPDATING + VCN prevblock; +#endif + /* + * Map the runlist, unless it has not been created. + * If appending data, a partial mapping from the + * end of previous block will do. + */ + irl = *prl - na->rl; +#if PARTIAL_RUNLIST_UPDATING + prevblock = pos >> cluster_size_bits; + if (prevblock) + prevblock--; + if (!NAttrBeingNonResident(na) + && (NAttrDataAppending(na) + ? ntfs_attr_map_partial_runlist(na,prevblock) + : ntfs_attr_map_whole_runlist(na))) { +#else + if (!NAttrBeingNonResident(na) + && ntfs_attr_map_whole_runlist(na)) { +#endif + rl = (runlist_element*)NULL; + } else { + /* + * Mapping the runlist may cause its relocation, + * and relocation may be at the same place with + * relocated contents. + * Have to find the current run again when this + * happens. + */ + if ((na->rl != orl) || ((*prl)->lcn != olcn)) { + zrl = &na->rl[irl]; + while (zrl->length && (zrl->lcn != olcn)) + zrl++; + *prl = zrl; + } + if (!(*prl)->length) { + ntfs_log_error("Mapped run not found," + " inode %lld lcn 0x%llx\n", + (long long)na->ni->mft_no, + (long long)olcn); + rl = (runlist_element*)NULL; + } else { + rl = ntfs_rl_extend(na,*prl,2); + na->unused_runs = 2; + } + } + *prl = rl; + if (rl && undecided) { + allocated = 0; + zrl = rl; + irl = 0; + while (zrl->length && (zrl->lcn >= 0) + && (allocated < endblock)) { + allocated += zrl->length; + zrl++; + irl++; + } + } + } + /* + * compression block not fully allocated and followed + * by a hole : we must allocate in the hole. + */ + if (rl && (allocated < endblock) && (zrl->lcn == LCN_HOLE)) { + s64 xofs; + + /* + * split the hole if not fully needed + */ + if ((allocated + zrl->length) > endblock) { + runlist_element *xrl; + + *prl = ntfs_rl_extend(na,*prl,1); + if (*prl) { + /* beware : rl was reallocated */ + rl = *prl; + zrl = &rl[irl]; + na->unused_runs = 0; + xrl = zrl; + while (xrl->length) xrl++; + do { + xrl[1] = *xrl; + } while (xrl-- != zrl); + zrl->length = endblock - allocated; + zrl[1].length -= zrl->length; + zrl[1].vcn = zrl->vcn + zrl->length; + } + } + if (*prl) { + if (wasnonresident) + compressed_part = na->compression_block_clusters + - zrl->length; + xofs = 0; + if (ntfs_attr_fill_hole(na, + zrl->length << cluster_size_bits, + &xofs, &zrl, update_from)) + compressed_part = -1; + else { + /* go back to initial cluster, now reallocated */ + while (zrl->vcn > (pos >> cluster_size_bits)) + zrl--; + *prl = zrl; + } + } + } + if (!*prl) { + ntfs_log_error("No elements to borrow from a hole\n"); + compressed_part = -1; + } else + if ((*update_from == -1) || ((*prl)->vcn < *update_from)) + *update_from = (*prl)->vcn; + return (compressed_part); +} + +static int ntfs_attr_truncate_i(ntfs_attr *na, const s64 newsize, + hole_type holes); + +/** + * ntfs_attr_pwrite - positioned write to an ntfs attribute + * @na: ntfs attribute to write to + * @pos: position in the attribute to write to + * @count: number of bytes to write + * @b: data buffer to write to disk + * + * This function will write @count bytes from data buffer @b to ntfs attribute + * @na at position @pos. + * + * On success, return the number of successfully written bytes. If this number + * is lower than @count this means that an error was encountered during the + * write so that the write is partial. 0 means nothing was written (also return + * 0 when @count is 0). + * + * On error and nothing has been written, return -1 with errno set + * appropriately to the return code of ntfs_pwrite(), or to EINVAL in case of + * invalid arguments. + */ +s64 ntfs_attr_pwrite(ntfs_attr *na, const s64 pos, s64 count, const void *b) +{ + s64 written, to_write, ofs, old_initialized_size, old_data_size; + s64 total = 0; + VCN update_from = -1; + ntfs_volume *vol; + s64 fullcount; + ntfs_attr_search_ctx *ctx = NULL; + runlist_element *rl; + s64 hole_end; + int eo; + int compressed_part; + struct { + unsigned int undo_initialized_size : 1; + unsigned int undo_data_size : 1; + } need_to = { 0, 0 }; + BOOL wasnonresident = FALSE; + BOOL compressed; + BOOL sparse; + BOOL updatemap; + + ntfs_log_enter("Entering for inode %lld, attr 0x%x, pos 0x%llx, count " + "0x%llx.\n", (long long)na->ni->mft_no, na->type, + (long long)pos, (long long)count); + + if (!na || !na->ni || !na->ni->vol || !b || pos < 0 || count < 0) { + errno = EINVAL; + ntfs_log_perror("%s", __FUNCTION__); + goto errno_set; + } + vol = na->ni->vol; + compressed = (na->data_flags & ATTR_COMPRESSION_MASK) + != const_cpu_to_le16(0); + na->unused_runs = 0; /* prepare overflow checks */ + /* + * Encrypted attributes are only supported in raw mode. We return + * access denied, which is what Windows NT4 does, too. + * Moreover a file cannot be both encrypted and compressed. + */ + if ((na->data_flags & ATTR_IS_ENCRYPTED) + && (compressed || !vol->efs_raw)) { + errno = EACCES; + goto errno_set; + } + /* + * Fill the gap, when writing beyond the end of a compressed + * file. This will make recursive calls + */ + if (compressed + && (na->type == AT_DATA) + && (pos > na->initialized_size) + && stuff_hole(na,pos)) + goto errno_set; + /* If this is a compressed attribute it needs special treatment. */ + wasnonresident = NAttrNonResident(na) != 0; + /* + * Compression is restricted to data streams and + * only ATTR_IS_COMPRESSED compression mode is supported. + */ + if (compressed + && ((na->type != AT_DATA) + || ((na->data_flags & ATTR_COMPRESSION_MASK) + != ATTR_IS_COMPRESSED))) { + errno = EOPNOTSUPP; + goto errno_set; + } + + if (!count) + goto out; + /* for a compressed file, get prepared to reserve a full block */ + fullcount = count; + /* If the write reaches beyond the end, extend the attribute. */ + old_data_size = na->data_size; + /* identify whether this is appending to a non resident data attribute */ + if ((na->type == AT_DATA) && (pos >= old_data_size) + && NAttrNonResident(na)) + NAttrSetDataAppending(na); + if (pos + count > na->data_size) { +#if PARTIAL_RUNLIST_UPDATING + /* + * When appending data, the attribute is first extended + * before being filled with data. This may cause the + * attribute to be made temporarily sparse, which + * implies reformating the inode and reorganizing the + * full runlist. To avoid unnecessary reorganization, + * we avoid sparse testing until the data is filled in. + */ + if (ntfs_attr_truncate_i(na, pos + count, + (NAttrDataAppending(na) ? + HOLES_DELAY : HOLES_OK))) { + ntfs_log_perror("Failed to enlarge attribute"); + goto errno_set; + } +#else + if (ntfs_attr_truncate(na, pos + count)) { + ntfs_log_perror("Failed to enlarge attribute"); + goto errno_set; + } +#endif + /* resizing may change the compression mode */ + compressed = (na->data_flags & ATTR_COMPRESSION_MASK) + != const_cpu_to_le16(0); + need_to.undo_data_size = 1; + } + sparse = (na->data_flags & ATTR_IS_SPARSE) != const_cpu_to_le16(0); + /* + * For compressed data, a single full block was allocated + * to deal with compression, possibly in a previous call. + * We are not able to process several blocks because + * some clusters are freed after compression and + * new allocations have to be done before proceeding, + * so truncate the requested count if needed (big buffers). + */ + if (compressed) { + fullcount = (pos | (na->compression_block_size - 1)) + 1 - pos; + if (count > fullcount) + count = fullcount; + } + old_initialized_size = na->initialized_size; + /* If it is a resident attribute, write the data to the mft record. */ + if (!NAttrNonResident(na)) { + char *val; + + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + goto err_out; + if (ntfs_attr_lookup(na->type, na->name, na->name_len, 0, + 0, NULL, 0, ctx)) { + ntfs_log_perror("%s: lookup failed", __FUNCTION__); + goto err_out; + } + val = (char*)ctx->attr + le16_to_cpu(ctx->attr->value_offset); + if (val < (char*)ctx->attr || val + + le32_to_cpu(ctx->attr->value_length) > + (char*)ctx->mrec + vol->mft_record_size) { + errno = EIO; + ntfs_log_perror("%s: Sanity check failed", __FUNCTION__); + goto err_out; + } + memcpy(val + pos, b, count); + if (ntfs_mft_record_write(vol, ctx->ntfs_ino->mft_no, + ctx->mrec)) { + /* + * NOTE: We are in a bad state at this moment. We have + * dirtied the mft record but we failed to commit it to + * disk. Since we have read the mft record ok before, + * it is unlikely to fail writing it, so is ok to just + * return error here... (AIA) + */ + ntfs_log_perror("%s: failed to write mft record", __FUNCTION__); + goto err_out; + } + ntfs_attr_put_search_ctx(ctx); + total = count; + goto out; + } + + /* Handle writes beyond initialized_size. */ + + if (pos + count > na->initialized_size) { +#if PARTIAL_RUNLIST_UPDATING + /* + * When appending, we only need to map the end of the runlist, + * starting at the last previously allocated run, so that + * we are able a new one to it. + * However, for compressed file, we need the full compression + * block, which may be split in several extents. + */ + if (NAttrDataAppending(na)) { + VCN block_begin = pos >> vol->cluster_size_bits; + + if (compressed) + block_begin &= -na->compression_block_clusters; + if (block_begin) + block_begin--; + if (ntfs_attr_map_partial_runlist(na, block_begin)) + goto err_out; + if ((update_from == -1) || (block_begin < update_from)) + update_from = block_begin; + } else +#endif + if (ntfs_attr_map_whole_runlist(na)) + goto err_out; + /* + * For a compressed attribute, we must be sure there is an + * available entry, and, when reopening a compressed file, + * we may need to split a hole. So reserve the entries + * before it gets too late. + */ + if (compressed) { + na->rl = ntfs_rl_extend(na,na->rl,2); + if (!na->rl) + goto err_out; + na->unused_runs = 2; + } + /* Set initialized_size to @pos + @count. */ + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + goto err_out; + if (ntfs_attr_lookup(na->type, na->name, na->name_len, 0, + 0, NULL, 0, ctx)) + goto err_out; + + /* If write starts beyond initialized_size, zero the gap. */ + if (pos > na->initialized_size) + if (ntfs_attr_fill_zero(na, na->initialized_size, + pos - na->initialized_size)) + goto err_out; + + ctx->attr->initialized_size = cpu_to_sle64(pos + count); + /* fix data_size for compressed files */ + if (compressed) { + na->data_size = pos + count; + ctx->attr->data_size = ctx->attr->initialized_size; + } + if (ntfs_mft_record_write(vol, ctx->ntfs_ino->mft_no, + ctx->mrec)) { + /* + * Undo the change in the in-memory copy and send it + * back for writing. + */ + ctx->attr->initialized_size = + cpu_to_sle64(old_initialized_size); + ntfs_mft_record_write(vol, ctx->ntfs_ino->mft_no, + ctx->mrec); + goto err_out; + } + na->initialized_size = pos + count; +#if CACHE_NIDATA_SIZE + if (na->ni->mrec->flags & MFT_RECORD_IS_DIRECTORY + ? na->type == AT_INDEX_ROOT && na->name == NTFS_INDEX_I30 + : na->type == AT_DATA && na->name == AT_UNNAMED) { + na->ni->data_size = na->data_size; + if ((compressed || NAttrSparse(na)) + && NAttrNonResident(na)) + na->ni->allocated_size = na->compressed_size; + else + na->ni->allocated_size = na->allocated_size; + set_nino_flag(na->ni,KnownSize); + } +#endif + ntfs_attr_put_search_ctx(ctx); + ctx = NULL; + /* + * NOTE: At this point the initialized_size in the mft record + * has been updated BUT there is random data on disk thus if + * we decide to abort, we MUST change the initialized_size + * again. + */ + need_to.undo_initialized_size = 1; + } + /* Find the runlist element containing the vcn. */ + rl = ntfs_attr_find_vcn(na, pos >> vol->cluster_size_bits); + if (!rl) { + /* + * If the vcn is not present it is an out of bounds write. + * However, we already extended the size of the attribute, + * so getting this here must be an error of some kind. + */ + if (errno == ENOENT) { + errno = EIO; + ntfs_log_perror("%s: Failed to find VCN #3", __FUNCTION__); + } + goto err_out; + } + /* + * Determine if there is compressed data in the current + * compression block (when appending to an existing file). + * If so, decompression will be needed, and the full block + * must be allocated to be identified as uncompressed. + * This comes in two variants, depending on whether + * compression has saved at least one cluster. + * The compressed size can never be over full size by + * more than 485 (maximum for 15 compression blocks + * compressed to 4098 and the last 3640 bytes compressed + * to 3640 + 3640/8 = 4095, with 15*2 + 4095 - 3640 = 485) + * This is less than the smallest cluster, so the hole is + * is never beyond the cluster next to the position of + * the first uncompressed byte to write. + */ + compressed_part = 0; + if (compressed) { + if ((rl->lcn == (LCN)LCN_HOLE) + && wasnonresident) { + if (rl->length < na->compression_block_clusters) + /* + * the needed block is in a hole smaller + * than the compression block : we can use + * it fully + */ + compressed_part + = na->compression_block_clusters + - rl->length; + else { + /* + * the needed block is in a hole bigger + * than the compression block : we must + * split the hole and use it partially + */ + compressed_part = split_compressed_hole(na, + &rl, pos, count, &update_from); + } + } else { + if (rl->lcn >= 0) { + /* + * the needed block contains data, make + * sure the full compression block is + * allocated. Borrow from hole if needed + */ + compressed_part = borrow_from_hole(na, + &rl, pos, count, &update_from, + wasnonresident); + } + } + + if (compressed_part < 0) + goto err_out; + + /* just making non-resident, so not yet compressed */ + if (NAttrBeingNonResident(na) + && (compressed_part < na->compression_block_clusters)) + compressed_part = 0; + } + ofs = pos - (rl->vcn << vol->cluster_size_bits); + /* + * Scatter the data from the linear data buffer to the volume. Note, a + * partial final vcn is taken care of by the @count capping of write + * length. + */ + for (hole_end = 0; count; rl++, ofs = 0) { + if (rl->lcn == LCN_RL_NOT_MAPPED) { + rl = ntfs_attr_find_vcn(na, rl->vcn); + if (!rl) { + if (errno == ENOENT) { + errno = EIO; + ntfs_log_perror("%s: Failed to find VCN" + " #4", __FUNCTION__); + } + goto rl_err_out; + } + /* Needed for case when runs merged. */ + ofs = pos + total - (rl->vcn << vol->cluster_size_bits); + } + if (!rl->length) { + errno = EIO; + ntfs_log_perror("%s: Zero run length", __FUNCTION__); + goto rl_err_out; + } + if (rl->lcn < (LCN)0) { + hole_end = rl->vcn + rl->length; + + if (rl->lcn != (LCN)LCN_HOLE) { + errno = EIO; + ntfs_log_perror("%s: Unexpected LCN (%lld)", + __FUNCTION__, + (long long)rl->lcn); + goto rl_err_out; + } + if (ntfs_attr_fill_hole(na, fullcount, &ofs, &rl, + &update_from)) + goto err_out; + } + if (compressed) { + while (rl->length + && (ofs >= (rl->length << vol->cluster_size_bits))) { + ofs -= rl->length << vol->cluster_size_bits; + rl++; + } + } + + /* It is a real lcn, write it to the volume. */ + to_write = min(count, (rl->length << vol->cluster_size_bits) - ofs); +retry: + ntfs_log_trace("Writing %lld bytes to vcn %lld, lcn %lld, ofs " + "%lld.\n", (long long)to_write, (long long)rl->vcn, + (long long)rl->lcn, (long long)ofs); + if (!NVolReadOnly(vol)) { + + s64 wpos = (rl->lcn << vol->cluster_size_bits) + ofs; + s64 wend = (rl->vcn << vol->cluster_size_bits) + ofs + to_write; + u32 bsize = vol->cluster_size; + /* Byte size needed to zero fill a cluster */ + s64 rounding = ((wend + bsize - 1) & ~(s64)(bsize - 1)) - wend; + /** + * Zero fill to cluster boundary if we're writing at the + * end of the attribute or into an ex-sparse cluster. + * This will cause the kernel not to seek and read disk + * blocks during write(2) to fill the end of the buffer + * which increases write speed by 2-10 fold typically. + * + * This is done even for compressed files, because + * data is generally first written uncompressed. + */ + if (rounding && ((wend == na->initialized_size) || + (wend < (hole_end << vol->cluster_size_bits)))){ + + char *cb; + + rounding += to_write; + + cb = ntfs_malloc(rounding); + if (!cb) + goto err_out; + + memcpy(cb, b, to_write); + memset(cb + to_write, 0, rounding - to_write); + + if (compressed) { + written = ntfs_compressed_pwrite(na, + rl, wpos, ofs, to_write, + rounding, cb, compressed_part, + &update_from); + } else { + written = ntfs_pwrite(vol->dev, wpos, + rounding, cb); + if (written == rounding) + written = to_write; + } + + free(cb); + } else { + if (compressed) { + written = ntfs_compressed_pwrite(na, + rl, wpos, ofs, to_write, + to_write, b, compressed_part, + &update_from); + } else + written = ntfs_pwrite(vol->dev, wpos, + to_write, b); + } + } else + written = to_write; + /* If everything ok, update progress counters and continue. */ + if (written > 0) { + total += written; + count -= written; + fullcount -= written; + b = (const u8*)b + written; + } + if (written != to_write) { + /* Partial write cannot be dealt with, stop there */ + /* If the syscall was interrupted, try again. */ + if (written == (s64)-1 && errno == EINTR) + goto retry; + if (!written) + errno = EIO; + goto rl_err_out; + } + compressed_part = 0; + } +done: + if (ctx) + ntfs_attr_put_search_ctx(ctx); + /* + * Update mapping pairs if needed. + * For a compressed file, we try to make a partial update + * of the mapping list. This makes a difference only if + * inode extents were needed. + */ +#if PARTIAL_RUNLIST_UPDATING + updatemap = NAttrFullyMapped(na) || NAttrDataAppending(na); +#else + updatemap = (compressed + ? NAttrFullyMapped(na) != 0 : update_from != -1); +#endif + if (updatemap) + if (ntfs_attr_update_mapping_pairs(na, + (update_from < 0 ? 0 : update_from))) { + /* + * FIXME: trying to recover by goto rl_err_out; + * could cause driver hang by infinite looping. + */ + total = -1; + goto out; + } +out: + ntfs_log_leave("\n"); + return total; +rl_err_out: + eo = errno; + if (total) { + if (need_to.undo_initialized_size) { + if (pos + total > na->initialized_size) + goto done; + /* + * TODO: Need to try to change initialized_size. If it + * succeeds goto done, otherwise goto err_out. (AIA) + */ + goto err_out; + } + goto done; + } + errno = eo; +err_out: + eo = errno; + if (need_to.undo_initialized_size) { + int err; + + err = 0; + if (!ctx) { + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + err = 1; + } else + ntfs_attr_reinit_search_ctx(ctx); + if (!err) { + err = ntfs_attr_lookup(na->type, na->name, + na->name_len, 0, 0, NULL, 0, ctx); + if (!err) { + na->initialized_size = old_initialized_size; + ctx->attr->initialized_size = cpu_to_sle64( + old_initialized_size); + err = ntfs_mft_record_write(vol, + ctx->ntfs_ino->mft_no, + ctx->mrec); + } + } + if (err) { + /* + * FIXME: At this stage could try to recover by filling + * old_initialized_size -> new_initialized_size with + * data or at least zeroes. (AIA) + */ + ntfs_log_error("Eeek! Failed to recover from error. " + "Leaving metadata in inconsistent " + "state! Run chkdsk!\n"); + } + } + if (ctx) + ntfs_attr_put_search_ctx(ctx); + /* Update mapping pairs if needed. */ + updatemap = (compressed + ? NAttrFullyMapped(na) != 0 : update_from != -1); + if (updatemap) + ntfs_attr_update_mapping_pairs(na, 0); + /* Restore original data_size if needed. */ + if (need_to.undo_data_size && ntfs_attr_truncate(na, old_data_size)) + ntfs_log_perror("Failed to restore data_size"); + errno = eo; +errno_set: + total = -1; + goto out; +} + +int ntfs_attr_pclose(ntfs_attr *na) +{ + s64 ofs; + int failed; + BOOL ok = TRUE; + VCN update_from = -1; + ntfs_volume *vol; + ntfs_attr_search_ctx *ctx = NULL; + runlist_element *rl; + int eo; + s64 hole; + int compressed_part; + BOOL compressed; + + ntfs_log_enter("Entering for inode 0x%llx, attr 0x%x.\n", + na->ni->mft_no, na->type); + + if (!na || !na->ni || !na->ni->vol) { + errno = EINVAL; + ntfs_log_perror("%s", __FUNCTION__); + goto errno_set; + } + vol = na->ni->vol; + na->unused_runs = 0; + compressed = (na->data_flags & ATTR_COMPRESSION_MASK) + != const_cpu_to_le16(0); + /* + * Encrypted non-resident attributes are not supported. We return + * access denied, which is what Windows NT4 does, too. + */ + if (NAttrEncrypted(na) && NAttrNonResident(na)) { + errno = EACCES; + goto errno_set; + } + /* If this is not a compressed attribute get out */ + /* same if it is resident */ + if (!compressed || !NAttrNonResident(na)) + goto out; + + /* safety check : no recursion on close */ + if (NAttrComprClosing(na)) { + errno = EIO; + ntfs_log_error("Bad ntfs_attr_pclose" + " recursion on inode %lld\n", + (long long)na->ni->mft_no); + goto out; + } + NAttrSetComprClosing(na); + /* + * For a compressed attribute, we must be sure there are two + * available entries, so reserve them before it gets too late. + */ + if (ntfs_attr_map_whole_runlist(na)) + goto err_out; + na->rl = ntfs_rl_extend(na,na->rl,2); + if (!na->rl) + goto err_out; + na->unused_runs = 2; + /* Find the runlist element containing the terminal vcn. */ + rl = ntfs_attr_find_vcn(na, (na->initialized_size - 1) >> vol->cluster_size_bits); + if (!rl) { + /* + * If the vcn is not present it is an out of bounds write. + * However, we have already written the last byte uncompressed, + * so getting this here must be an error of some kind. + */ + if (errno == ENOENT) { + errno = EIO; + ntfs_log_perror("%s: Failed to find VCN #5", __FUNCTION__); + } + goto err_out; + } + /* + * Scatter the data from the linear data buffer to the volume. Note, a + * partial final vcn is taken care of by the @count capping of write + * length. + */ + compressed_part = 0; + if (rl->lcn >= 0) { + runlist_element *xrl; + + xrl = rl; + do { + xrl++; + } while (xrl->lcn >= 0); + compressed_part = (-xrl->length) + & (na->compression_block_clusters - 1); + } else + if (rl->lcn == (LCN)LCN_HOLE) { + if (rl->length < na->compression_block_clusters) + compressed_part + = na->compression_block_clusters + - rl->length; + else + compressed_part + = na->compression_block_clusters; + } + /* done, if the last block set was compressed */ + if (compressed_part) + goto out; + + ofs = na->initialized_size - (rl->vcn << vol->cluster_size_bits); + + if (rl->lcn == LCN_RL_NOT_MAPPED) { + rl = ntfs_attr_find_vcn(na, rl->vcn); + if (!rl) { + if (errno == ENOENT) { + errno = EIO; + ntfs_log_perror("%s: Failed to find VCN" + " #6", __FUNCTION__); + } + goto rl_err_out; + } + /* Needed for case when runs merged. */ + ofs = na->initialized_size - (rl->vcn << vol->cluster_size_bits); + } + if (!rl->length) { + errno = EIO; + ntfs_log_perror("%s: Zero run length", __FUNCTION__); + goto rl_err_out; + } + if (rl->lcn < (LCN)0) { + hole = rl->vcn + rl->length; + if (rl->lcn != (LCN)LCN_HOLE) { + errno = EIO; + ntfs_log_perror("%s: Unexpected LCN (%lld)", + __FUNCTION__, + (long long)rl->lcn); + goto rl_err_out; + } + + if (ntfs_attr_fill_hole(na, (s64)0, &ofs, &rl, &update_from)) + goto err_out; + } + while (rl->length + && (ofs >= (rl->length << vol->cluster_size_bits))) { + ofs -= rl->length << vol->cluster_size_bits; + rl++; + } + +retry: + failed = 0; + if (update_from < 0) update_from = 0; + if (!NVolReadOnly(vol)) { + failed = ntfs_compressed_close(na, rl, ofs, &update_from); +#if CACHE_NIDATA_SIZE + if (na->ni->mrec->flags & MFT_RECORD_IS_DIRECTORY + ? na->type == AT_INDEX_ROOT && na->name == NTFS_INDEX_I30 + : na->type == AT_DATA && na->name == AT_UNNAMED) { + na->ni->data_size = na->data_size; + na->ni->allocated_size = na->compressed_size; + set_nino_flag(na->ni,KnownSize); + } +#endif + } + if (failed) { + /* If the syscall was interrupted, try again. */ + if (errno == EINTR) + goto retry; + else + goto rl_err_out; + } + if (ctx) + ntfs_attr_put_search_ctx(ctx); + /* Update mapping pairs if needed. */ + if (NAttrFullyMapped(na)) + if (ntfs_attr_update_mapping_pairs(na, update_from)) { + /* + * FIXME: trying to recover by goto rl_err_out; + * could cause driver hang by infinite looping. + */ + ok = FALSE; + goto out; + } +out: + ntfs_log_leave("\n"); + return (!ok); +rl_err_out: + /* + * need not restore old sizes, only compressed_size + * can have changed. It has been set according to + * the current runlist while updating the mapping pairs, + * and must be kept consistent with the runlists. + */ +err_out: + eo = errno; + if (ctx) + ntfs_attr_put_search_ctx(ctx); + /* Update mapping pairs if needed. */ + if (NAttrFullyMapped(na)) + ntfs_attr_update_mapping_pairs(na, 0); + errno = eo; +errno_set: + ok = FALSE; + goto out; +} + +/** + * ntfs_attr_mst_pread - multi sector transfer protected ntfs attribute read + * @na: multi sector transfer protected ntfs attribute to read from + * @pos: byte position in the attribute to begin reading from + * @bk_cnt: number of mst protected blocks to read + * @bk_size: size of each mst protected block in bytes + * @dst: output data buffer + * + * This function will read @bk_cnt blocks of size @bk_size bytes each starting + * at offset @pos from the ntfs attribute @na into the data buffer @b. + * + * On success, the multi sector transfer fixups are applied and the number of + * read blocks is returned. If this number is lower than @bk_cnt this means + * that the read has either reached end of attribute or that an error was + * encountered during the read so that the read is partial. 0 means end of + * attribute or nothing to read (also return 0 when @bk_cnt or @bk_size are 0). + * + * On error and nothing has been read, return -1 with errno set appropriately + * to the return code of ntfs_attr_pread() or to EINVAL in case of invalid + * arguments. + * + * NOTE: If an incomplete multi sector transfer is detected the magic is + * changed to BAAD but no error is returned, i.e. it is possible that any of + * the returned blocks have multi sector transfer errors. This should be + * detected by the caller by checking each block with is_baad_recordp(&block). + * The reasoning is that we want to fixup as many blocks as possible and we + * want to return even bad ones to the caller so, e.g. in case of ntfsck, the + * errors can be repaired. + */ +s64 ntfs_attr_mst_pread(ntfs_attr *na, const s64 pos, const s64 bk_cnt, + const u32 bk_size, void *dst) +{ + s64 br; + u8 *end; + + ntfs_log_trace("Entering for inode 0x%llx, attr type 0x%x, pos 0x%llx.\n", + (unsigned long long)na->ni->mft_no, na->type, + (long long)pos); + if (bk_cnt < 0 || bk_size % NTFS_BLOCK_SIZE) { + errno = EINVAL; + ntfs_log_perror("%s", __FUNCTION__); + return -1; + } + br = ntfs_attr_pread(na, pos, bk_cnt * bk_size, dst); + if (br <= 0) + return br; + br /= bk_size; + for (end = (u8*)dst + br * bk_size; (u8*)dst < end; dst = (u8*)dst + + bk_size) + ntfs_mst_post_read_fixup((NTFS_RECORD*)dst, bk_size); + /* Finally, return the number of blocks read. */ + return br; +} + +/** + * ntfs_attr_mst_pwrite - multi sector transfer protected ntfs attribute write + * @na: multi sector transfer protected ntfs attribute to write to + * @pos: position in the attribute to write to + * @bk_cnt: number of mst protected blocks to write + * @bk_size: size of each mst protected block in bytes + * @src: data buffer to write to disk + * + * This function will write @bk_cnt blocks of size @bk_size bytes each from + * data buffer @b to multi sector transfer (mst) protected ntfs attribute @na + * at position @pos. + * + * On success, return the number of successfully written blocks. If this number + * is lower than @bk_cnt this means that an error was encountered during the + * write so that the write is partial. 0 means nothing was written (also + * return 0 when @bk_cnt or @bk_size are 0). + * + * On error and nothing has been written, return -1 with errno set + * appropriately to the return code of ntfs_attr_pwrite(), or to EINVAL in case + * of invalid arguments. + * + * NOTE: We mst protect the data, write it, then mst deprotect it using a quick + * deprotect algorithm (no checking). This saves us from making a copy before + * the write and at the same time causes the usn to be incremented in the + * buffer. This conceptually fits in better with the idea that cached data is + * always deprotected and protection is performed when the data is actually + * going to hit the disk and the cache is immediately deprotected again + * simulating an mst read on the written data. This way cache coherency is + * achieved. + */ +s64 ntfs_attr_mst_pwrite(ntfs_attr *na, const s64 pos, s64 bk_cnt, + const u32 bk_size, void *src) +{ + s64 written, i; + + ntfs_log_trace("Entering for inode 0x%llx, attr type 0x%x, pos 0x%llx.\n", + (unsigned long long)na->ni->mft_no, na->type, + (long long)pos); + if (bk_cnt < 0 || bk_size % NTFS_BLOCK_SIZE) { + errno = EINVAL; + return -1; + } + if (!bk_cnt) + return 0; + /* Prepare data for writing. */ + for (i = 0; i < bk_cnt; ++i) { + int err; + + err = ntfs_mst_pre_write_fixup((NTFS_RECORD*) + ((u8*)src + i * bk_size), bk_size); + if (err < 0) { + /* Abort write at this position. */ + ntfs_log_perror("%s #1", __FUNCTION__); + if (!i) + return err; + bk_cnt = i; + break; + } + } + /* Write the prepared data. */ + written = ntfs_attr_pwrite(na, pos, bk_cnt * bk_size, src); + if (written <= 0) { + ntfs_log_perror("%s: written=%lld", __FUNCTION__, + (long long)written); + } + /* Quickly deprotect the data again. */ + for (i = 0; i < bk_cnt; ++i) + ntfs_mst_post_write_fixup((NTFS_RECORD*)((u8*)src + i * + bk_size)); + if (written <= 0) + return written; + /* Finally, return the number of complete blocks written. */ + return written / bk_size; +} + +/** + * ntfs_attr_find - find (next) attribute in mft record + * @type: attribute type to find + * @name: attribute name to find (optional, i.e. NULL means don't care) + * @name_len: attribute name length (only needed if @name present) + * @ic: IGNORE_CASE or CASE_SENSITIVE (ignored if @name not present) + * @val: attribute value to find (optional, resident attributes only) + * @val_len: attribute value length + * @ctx: search context with mft record and attribute to search from + * + * You shouldn't need to call this function directly. Use lookup_attr() instead. + * + * ntfs_attr_find() takes a search context @ctx as parameter and searches the + * mft record specified by @ctx->mrec, beginning at @ctx->attr, for an + * attribute of @type, optionally @name and @val. If found, ntfs_attr_find() + * returns 0 and @ctx->attr will point to the found attribute. + * + * If not found, ntfs_attr_find() returns -1, with errno set to ENOENT and + * @ctx->attr will point to the attribute before which the attribute being + * searched for would need to be inserted if such an action were to be desired. + * + * On actual error, ntfs_attr_find() returns -1 with errno set to the error + * code but not to ENOENT. In this case @ctx->attr is undefined and in + * particular do not rely on it not changing. + * + * If @ctx->is_first is TRUE, the search begins with @ctx->attr itself. If it + * is FALSE, the search begins after @ctx->attr. + * + * If @type is AT_UNUSED, return the first found attribute, i.e. one can + * enumerate all attributes by setting @type to AT_UNUSED and then calling + * ntfs_attr_find() repeatedly until it returns -1 with errno set to ENOENT to + * indicate that there are no more entries. During the enumeration, each + * successful call of ntfs_attr_find() will return the next attribute in the + * mft record @ctx->mrec. + * + * If @type is AT_END, seek to the end and return -1 with errno set to ENOENT. + * AT_END is not a valid attribute, its length is zero for example, thus it is + * safer to return error instead of success in this case. This also allows us + * to interoperate cleanly with ntfs_external_attr_find(). + * + * If @name is AT_UNNAMED search for an unnamed attribute. If @name is present + * but not AT_UNNAMED search for a named attribute matching @name. Otherwise, + * match both named and unnamed attributes. + * + * If @ic is IGNORE_CASE, the @name comparison is not case sensitive and + * @ctx->ntfs_ino must be set to the ntfs inode to which the mft record + * @ctx->mrec belongs. This is so we can get at the ntfs volume and hence at + * the upcase table. If @ic is CASE_SENSITIVE, the comparison is case + * sensitive. When @name is present, @name_len is the @name length in Unicode + * characters. + * + * If @name is not present (NULL), we assume that the unnamed attribute is + * being searched for. + * + * Finally, the resident attribute value @val is looked for, if present. + * If @val is not present (NULL), @val_len is ignored. + * + * ntfs_attr_find() only searches the specified mft record and it ignores the + * presence of an attribute list attribute (unless it is the one being searched + * for, obviously). If you need to take attribute lists into consideration, use + * ntfs_attr_lookup() instead (see below). This also means that you cannot use + * ntfs_attr_find() to search for extent records of non-resident attributes, as + * extents with lowest_vcn != 0 are usually described by the attribute list + * attribute only. - Note that it is possible that the first extent is only in + * the attribute list while the last extent is in the base mft record, so don't + * rely on being able to find the first extent in the base mft record. + * + * Warning: Never use @val when looking for attribute types which can be + * non-resident as this most likely will result in a crash! + */ +static int ntfs_attr_find(const ATTR_TYPES type, const ntfschar *name, + const u32 name_len, const IGNORE_CASE_BOOL ic, + const u8 *val, const u32 val_len, ntfs_attr_search_ctx *ctx) +{ + ATTR_RECORD *a; + ntfs_volume *vol; + ntfschar *upcase; + u32 upcase_len; + + ntfs_log_trace("attribute type 0x%x.\n", type); + + if (ctx->ntfs_ino) { + vol = ctx->ntfs_ino->vol; + upcase = vol->upcase; + upcase_len = vol->upcase_len; + } else { + if (name && name != AT_UNNAMED) { + errno = EINVAL; + ntfs_log_perror("%s", __FUNCTION__); + return -1; + } + vol = NULL; + upcase = NULL; + upcase_len = 0; + } + /* + * Iterate over attributes in mft record starting at @ctx->attr, or the + * attribute following that, if @ctx->is_first is TRUE. + */ + if (ctx->is_first) { + a = ctx->attr; + ctx->is_first = FALSE; + } else + a = (ATTR_RECORD*)((char*)ctx->attr + + le32_to_cpu(ctx->attr->length)); + for (;; a = (ATTR_RECORD*)((char*)a + le32_to_cpu(a->length))) { + if (p2n(a) < p2n(ctx->mrec) || (char*)a > (char*)ctx->mrec + + le32_to_cpu(ctx->mrec->bytes_allocated)) + break; + ctx->attr = a; + if (((type != AT_UNUSED) && (le32_to_cpu(a->type) > + le32_to_cpu(type))) || + (a->type == AT_END)) { + errno = ENOENT; + return -1; + } + if (!a->length) + break; + /* If this is an enumeration return this attribute. */ + if (type == AT_UNUSED) + return 0; + if (a->type != type) + continue; + /* + * If @name is AT_UNNAMED we want an unnamed attribute. + * If @name is present, compare the two names. + * Otherwise, match any attribute. + */ + if (name == AT_UNNAMED) { + /* The search failed if the found attribute is named. */ + if (a->name_length) { + errno = ENOENT; + return -1; + } + } else { + register int rc; + if (name && ((rc = ntfs_names_full_collate(name, + name_len, (ntfschar*)((char*)a + + le16_to_cpu(a->name_offset)), + a->name_length, ic, + upcase, upcase_len)))) { + /* + * If @name collates before a->name, + * there is no matching attribute. + */ + if (rc < 0) { + errno = ENOENT; + return -1; + } + /* If the strings are not equal, continue search. */ + continue; + } + } + /* + * The names match or @name not present and attribute is + * unnamed. If no @val specified, we have found the attribute + * and are done. + */ + if (!val) + return 0; + /* @val is present; compare values. */ + else { + register int rc; + + rc = memcmp(val, (char*)a +le16_to_cpu(a->value_offset), + min(val_len, + le32_to_cpu(a->value_length))); + /* + * If @val collates before the current attribute's + * value, there is no matching attribute. + */ + if (!rc) { + register u32 avl; + avl = le32_to_cpu(a->value_length); + if (val_len == avl) + return 0; + if (val_len < avl) { + errno = ENOENT; + return -1; + } + } else if (rc < 0) { + errno = ENOENT; + return -1; + } + } + } + errno = EIO; + ntfs_log_perror("%s: Corrupt inode (%lld)", __FUNCTION__, + ctx->ntfs_ino ? (long long)ctx->ntfs_ino->mft_no : -1); + return -1; +} + +void ntfs_attr_name_free(char **name) +{ + if (*name) { + free(*name); + *name = NULL; + } +} + +char *ntfs_attr_name_get(const ntfschar *uname, const int uname_len) +{ + char *name = NULL; + int name_len; + + name_len = ntfs_ucstombs(uname, uname_len, &name, 0); + if (name_len < 0) { + ntfs_log_perror("ntfs_ucstombs"); + return NULL; + + } else if (name_len > 0) + return name; + + ntfs_attr_name_free(&name); + return NULL; +} + +/** + * ntfs_external_attr_find - find an attribute in the attribute list of an inode + * @type: attribute type to find + * @name: attribute name to find (optional, i.e. NULL means don't care) + * @name_len: attribute name length (only needed if @name present) + * @ic: IGNORE_CASE or CASE_SENSITIVE (ignored if @name not present) + * @lowest_vcn: lowest vcn to find (optional, non-resident attributes only) + * @val: attribute value to find (optional, resident attributes only) + * @val_len: attribute value length + * @ctx: search context with mft record and attribute to search from + * + * You shouldn't need to call this function directly. Use ntfs_attr_lookup() + * instead. + * + * Find an attribute by searching the attribute list for the corresponding + * attribute list entry. Having found the entry, map the mft record for read + * if the attribute is in a different mft record/inode, find the attribute in + * there and return it. + * + * If @type is AT_UNUSED, return the first found attribute, i.e. one can + * enumerate all attributes by setting @type to AT_UNUSED and then calling + * ntfs_external_attr_find() repeatedly until it returns -1 with errno set to + * ENOENT to indicate that there are no more entries. During the enumeration, + * each successful call of ntfs_external_attr_find() will return the next + * attribute described by the attribute list of the base mft record described + * by the search context @ctx. + * + * If @type is AT_END, seek to the end of the base mft record ignoring the + * attribute list completely and return -1 with errno set to ENOENT. AT_END is + * not a valid attribute, its length is zero for example, thus it is safer to + * return error instead of success in this case. + * + * If @name is AT_UNNAMED search for an unnamed attribute. If @name is present + * but not AT_UNNAMED search for a named attribute matching @name. Otherwise, + * match both named and unnamed attributes. + * + * On first search @ctx->ntfs_ino must be the inode of the base mft record and + * @ctx must have been obtained from a call to ntfs_attr_get_search_ctx(). + * On subsequent calls, @ctx->ntfs_ino can be any extent inode, too + * (@ctx->base_ntfs_ino is then the base inode). + * + * After finishing with the attribute/mft record you need to call + * ntfs_attr_put_search_ctx() to cleanup the search context (unmapping any + * mapped extent inodes, etc). + * + * Return 0 if the search was successful and -1 if not, with errno set to the + * error code. + * + * On success, @ctx->attr is the found attribute, it is in mft record + * @ctx->mrec, and @ctx->al_entry is the attribute list entry for this + * attribute with @ctx->base_* being the base mft record to which @ctx->attr + * belongs. + * + * On error ENOENT, i.e. attribute not found, @ctx->attr is set to the + * attribute which collates just after the attribute being searched for in the + * base ntfs inode, i.e. if one wants to add the attribute to the mft record + * this is the correct place to insert it into, and if there is not enough + * space, the attribute should be placed in an extent mft record. + * @ctx->al_entry points to the position within @ctx->base_ntfs_ino->attr_list + * at which the new attribute's attribute list entry should be inserted. The + * other @ctx fields, base_ntfs_ino, base_mrec, and base_attr are set to NULL. + * The only exception to this is when @type is AT_END, in which case + * @ctx->al_entry is set to NULL also (see above). + * + * The following error codes are defined: + * ENOENT Attribute not found, not an error as such. + * EINVAL Invalid arguments. + * EIO I/O error or corrupt data structures found. + * ENOMEM Not enough memory to allocate necessary buffers. + */ +static int ntfs_external_attr_find(ATTR_TYPES type, const ntfschar *name, + const u32 name_len, const IGNORE_CASE_BOOL ic, + const VCN lowest_vcn, const u8 *val, const u32 val_len, + ntfs_attr_search_ctx *ctx) +{ + ntfs_inode *base_ni, *ni; + ntfs_volume *vol; + ATTR_LIST_ENTRY *al_entry, *next_al_entry; + u8 *al_start, *al_end; + ATTR_RECORD *a; + ntfschar *al_name; + u32 al_name_len; + BOOL is_first_search = FALSE; + + ni = ctx->ntfs_ino; + base_ni = ctx->base_ntfs_ino; + ntfs_log_trace("Entering for inode %lld, attribute type 0x%x.\n", + (unsigned long long)ni->mft_no, type); + if (!base_ni) { + /* First call happens with the base mft record. */ + base_ni = ctx->base_ntfs_ino = ctx->ntfs_ino; + ctx->base_mrec = ctx->mrec; + } + if (ni == base_ni) + ctx->base_attr = ctx->attr; + if (type == AT_END) + goto not_found; + vol = base_ni->vol; + al_start = base_ni->attr_list; + al_end = al_start + base_ni->attr_list_size; + if (!ctx->al_entry) { + ctx->al_entry = (ATTR_LIST_ENTRY*)al_start; + is_first_search = TRUE; + } + /* + * Iterate over entries in attribute list starting at @ctx->al_entry, + * or the entry following that, if @ctx->is_first is TRUE. + */ + if (ctx->is_first) { + al_entry = ctx->al_entry; + ctx->is_first = FALSE; + /* + * If an enumeration and the first attribute is higher than + * the attribute list itself, need to return the attribute list + * attribute. + */ + if ((type == AT_UNUSED) && is_first_search && + le32_to_cpu(al_entry->type) > + le32_to_cpu(AT_ATTRIBUTE_LIST)) + goto find_attr_list_attr; + } else { + al_entry = (ATTR_LIST_ENTRY*)((char*)ctx->al_entry + + le16_to_cpu(ctx->al_entry->length)); + /* + * If this is an enumeration and the attribute list attribute + * is the next one in the enumeration sequence, just return the + * attribute list attribute from the base mft record as it is + * not listed in the attribute list itself. + */ + if ((type == AT_UNUSED) && le32_to_cpu(ctx->al_entry->type) < + le32_to_cpu(AT_ATTRIBUTE_LIST) && + le32_to_cpu(al_entry->type) > + le32_to_cpu(AT_ATTRIBUTE_LIST)) { + int rc; +find_attr_list_attr: + + /* Check for bogus calls. */ + if (name || name_len || val || val_len || lowest_vcn) { + errno = EINVAL; + ntfs_log_perror("%s", __FUNCTION__); + return -1; + } + + /* We want the base record. */ + ctx->ntfs_ino = base_ni; + ctx->mrec = ctx->base_mrec; + ctx->is_first = TRUE; + /* Sanity checks are performed elsewhere. */ + ctx->attr = (ATTR_RECORD*)((u8*)ctx->mrec + + le16_to_cpu(ctx->mrec->attrs_offset)); + + /* Find the attribute list attribute. */ + rc = ntfs_attr_find(AT_ATTRIBUTE_LIST, NULL, 0, + IGNORE_CASE, NULL, 0, ctx); + + /* + * Setup the search context so the correct + * attribute is returned next time round. + */ + ctx->al_entry = al_entry; + ctx->is_first = TRUE; + + /* Got it. Done. */ + if (!rc) + return 0; + + /* Error! If other than not found return it. */ + if (errno != ENOENT) + return rc; + + /* Not found?!? Absurd! */ + errno = EIO; + ntfs_log_error("Attribute list wasn't found"); + return -1; + } + } + for (;; al_entry = next_al_entry) { + /* Out of bounds check. */ + if ((u8*)al_entry < base_ni->attr_list || + (u8*)al_entry > al_end) + break; /* Inode is corrupt. */ + ctx->al_entry = al_entry; + /* Catch the end of the attribute list. */ + if ((u8*)al_entry == al_end) + goto not_found; + if (!al_entry->length) + break; + if ((u8*)al_entry + 6 > al_end || (u8*)al_entry + + le16_to_cpu(al_entry->length) > al_end) + break; + next_al_entry = (ATTR_LIST_ENTRY*)((u8*)al_entry + + le16_to_cpu(al_entry->length)); + if (type != AT_UNUSED) { + if (le32_to_cpu(al_entry->type) > le32_to_cpu(type)) + goto not_found; + if (type != al_entry->type) + continue; + } + al_name_len = al_entry->name_length; + al_name = (ntfschar*)((u8*)al_entry + al_entry->name_offset); + /* + * If !@type we want the attribute represented by this + * attribute list entry. + */ + if (type == AT_UNUSED) + goto is_enumeration; + /* + * If @name is AT_UNNAMED we want an unnamed attribute. + * If @name is present, compare the two names. + * Otherwise, match any attribute. + */ + if (name == AT_UNNAMED) { + if (al_name_len) + goto not_found; + } else { + int rc; + + if (name && ((rc = ntfs_names_full_collate(name, + name_len, al_name, al_name_len, ic, + vol->upcase, vol->upcase_len)))) { + + /* + * If @name collates before al_name, + * there is no matching attribute. + */ + if (rc < 0) + goto not_found; + /* If the strings are not equal, continue search. */ + continue; + } + } + /* + * The names match or @name not present and attribute is + * unnamed. Now check @lowest_vcn. Continue search if the + * next attribute list entry still fits @lowest_vcn. Otherwise + * we have reached the right one or the search has failed. + */ + if (lowest_vcn && (u8*)next_al_entry >= al_start && + (u8*)next_al_entry + 6 < al_end && + (u8*)next_al_entry + le16_to_cpu( + next_al_entry->length) <= al_end && + sle64_to_cpu(next_al_entry->lowest_vcn) <= + lowest_vcn && + next_al_entry->type == al_entry->type && + next_al_entry->name_length == al_name_len && + ntfs_names_are_equal((ntfschar*)((char*) + next_al_entry + + next_al_entry->name_offset), + next_al_entry->name_length, + al_name, al_name_len, CASE_SENSITIVE, + vol->upcase, vol->upcase_len)) + continue; +is_enumeration: + if (MREF_LE(al_entry->mft_reference) == ni->mft_no) { + if (MSEQNO_LE(al_entry->mft_reference) != + le16_to_cpu( + ni->mrec->sequence_number)) { + ntfs_log_error("Found stale mft reference in " + "attribute list!\n"); + break; + } + } else { /* Mft references do not match. */ + /* Do we want the base record back? */ + if (MREF_LE(al_entry->mft_reference) == + base_ni->mft_no) { + ni = ctx->ntfs_ino = base_ni; + ctx->mrec = ctx->base_mrec; + } else { + /* We want an extent record. */ + ni = ntfs_extent_inode_open(base_ni, + al_entry->mft_reference); + if (!ni) + break; + ctx->ntfs_ino = ni; + ctx->mrec = ni->mrec; + } + } + a = ctx->attr = (ATTR_RECORD*)((char*)ctx->mrec + + le16_to_cpu(ctx->mrec->attrs_offset)); + /* + * ctx->ntfs_ino, ctx->mrec, and ctx->attr now point to the + * mft record containing the attribute represented by the + * current al_entry. + * + * We could call into ntfs_attr_find() to find the right + * attribute in this mft record but this would be less + * efficient and not quite accurate as ntfs_attr_find() ignores + * the attribute instance numbers for example which become + * important when one plays with attribute lists. Also, because + * a proper match has been found in the attribute list entry + * above, the comparison can now be optimized. So it is worth + * re-implementing a simplified ntfs_attr_find() here. + * + * Use a manual loop so we can still use break and continue + * with the same meanings as above. + */ +do_next_attr_loop: + if ((char*)a < (char*)ctx->mrec || (char*)a > (char*)ctx->mrec + + le32_to_cpu(ctx->mrec->bytes_allocated)) + break; + if (a->type == AT_END) + continue; + if (!a->length) + break; + if (al_entry->instance != a->instance) + goto do_next_attr; + /* + * If the type and/or the name are/is mismatched between the + * attribute list entry and the attribute record, there is + * corruption so we break and return error EIO. + */ + if (al_entry->type != a->type) + break; + if (!ntfs_names_are_equal((ntfschar*)((char*)a + + le16_to_cpu(a->name_offset)), + a->name_length, al_name, + al_name_len, CASE_SENSITIVE, + vol->upcase, vol->upcase_len)) + break; + ctx->attr = a; + /* + * If no @val specified or @val specified and it matches, we + * have found it! Also, if !@type, it is an enumeration, so we + * want the current attribute. + */ + if ((type == AT_UNUSED) || !val || (!a->non_resident && + le32_to_cpu(a->value_length) == val_len && + !memcmp((char*)a + le16_to_cpu(a->value_offset), + val, val_len))) { + return 0; + } +do_next_attr: + /* Proceed to the next attribute in the current mft record. */ + a = (ATTR_RECORD*)((char*)a + le32_to_cpu(a->length)); + goto do_next_attr_loop; + } + if (ni != base_ni) { + ctx->ntfs_ino = base_ni; + ctx->mrec = ctx->base_mrec; + ctx->attr = ctx->base_attr; + } + errno = EIO; + ntfs_log_perror("Inode is corrupt (%lld)", (long long)base_ni->mft_no); + return -1; +not_found: + /* + * If we were looking for AT_END or we were enumerating and reached the + * end, we reset the search context @ctx and use ntfs_attr_find() to + * seek to the end of the base mft record. + */ + if (type == AT_UNUSED || type == AT_END) { + ntfs_attr_reinit_search_ctx(ctx); + return ntfs_attr_find(AT_END, name, name_len, ic, val, val_len, + ctx); + } + /* + * The attribute wasn't found. Before we return, we want to ensure + * @ctx->mrec and @ctx->attr indicate the position at which the + * attribute should be inserted in the base mft record. Since we also + * want to preserve @ctx->al_entry we cannot reinitialize the search + * context using ntfs_attr_reinit_search_ctx() as this would set + * @ctx->al_entry to NULL. Thus we do the necessary bits manually (see + * ntfs_attr_init_search_ctx() below). Note, we _only_ preserve + * @ctx->al_entry as the remaining fields (base_*) are identical to + * their non base_ counterparts and we cannot set @ctx->base_attr + * correctly yet as we do not know what @ctx->attr will be set to by + * the call to ntfs_attr_find() below. + */ + ctx->mrec = ctx->base_mrec; + ctx->attr = (ATTR_RECORD*)((u8*)ctx->mrec + + le16_to_cpu(ctx->mrec->attrs_offset)); + ctx->is_first = TRUE; + ctx->ntfs_ino = ctx->base_ntfs_ino; + ctx->base_ntfs_ino = NULL; + ctx->base_mrec = NULL; + ctx->base_attr = NULL; + /* + * In case there are multiple matches in the base mft record, need to + * keep enumerating until we get an attribute not found response (or + * another error), otherwise we would keep returning the same attribute + * over and over again and all programs using us for enumeration would + * lock up in a tight loop. + */ + { + int ret; + + do { + ret = ntfs_attr_find(type, name, name_len, ic, val, + val_len, ctx); + } while (!ret); + return ret; + } +} + +/** + * ntfs_attr_lookup - find an attribute in an ntfs inode + * @type: attribute type to find + * @name: attribute name to find (optional, i.e. NULL means don't care) + * @name_len: attribute name length (only needed if @name present) + * @ic: IGNORE_CASE or CASE_SENSITIVE (ignored if @name not present) + * @lowest_vcn: lowest vcn to find (optional, non-resident attributes only) + * @val: attribute value to find (optional, resident attributes only) + * @val_len: attribute value length + * @ctx: search context with mft record and attribute to search from + * + * Find an attribute in an ntfs inode. On first search @ctx->ntfs_ino must + * be the base mft record and @ctx must have been obtained from a call to + * ntfs_attr_get_search_ctx(). + * + * This function transparently handles attribute lists and @ctx is used to + * continue searches where they were left off at. + * + * If @type is AT_UNUSED, return the first found attribute, i.e. one can + * enumerate all attributes by setting @type to AT_UNUSED and then calling + * ntfs_attr_lookup() repeatedly until it returns -1 with errno set to ENOENT + * to indicate that there are no more entries. During the enumeration, each + * successful call of ntfs_attr_lookup() will return the next attribute, with + * the current attribute being described by the search context @ctx. + * + * If @type is AT_END, seek to the end of the base mft record ignoring the + * attribute list completely and return -1 with errno set to ENOENT. AT_END is + * not a valid attribute, its length is zero for example, thus it is safer to + * return error instead of success in this case. It should never be needed to + * do this, but we implement the functionality because it allows for simpler + * code inside ntfs_external_attr_find(). + * + * If @name is AT_UNNAMED search for an unnamed attribute. If @name is present + * but not AT_UNNAMED search for a named attribute matching @name. Otherwise, + * match both named and unnamed attributes. + * + * After finishing with the attribute/mft record you need to call + * ntfs_attr_put_search_ctx() to cleanup the search context (unmapping any + * mapped extent inodes, etc). + * + * Return 0 if the search was successful and -1 if not, with errno set to the + * error code. + * + * On success, @ctx->attr is the found attribute, it is in mft record + * @ctx->mrec, and @ctx->al_entry is the attribute list entry for this + * attribute with @ctx->base_* being the base mft record to which @ctx->attr + * belongs. If no attribute list attribute is present @ctx->al_entry and + * @ctx->base_* are NULL. + * + * On error ENOENT, i.e. attribute not found, @ctx->attr is set to the + * attribute which collates just after the attribute being searched for in the + * base ntfs inode, i.e. if one wants to add the attribute to the mft record + * this is the correct place to insert it into, and if there is not enough + * space, the attribute should be placed in an extent mft record. + * @ctx->al_entry points to the position within @ctx->base_ntfs_ino->attr_list + * at which the new attribute's attribute list entry should be inserted. The + * other @ctx fields, base_ntfs_ino, base_mrec, and base_attr are set to NULL. + * The only exception to this is when @type is AT_END, in which case + * @ctx->al_entry is set to NULL also (see above). + * + * + * The following error codes are defined: + * ENOENT Attribute not found, not an error as such. + * EINVAL Invalid arguments. + * EIO I/O error or corrupt data structures found. + * ENOMEM Not enough memory to allocate necessary buffers. + */ +int ntfs_attr_lookup(const ATTR_TYPES type, const ntfschar *name, + const u32 name_len, const IGNORE_CASE_BOOL ic, + const VCN lowest_vcn, const u8 *val, const u32 val_len, + ntfs_attr_search_ctx *ctx) +{ + ntfs_volume *vol; + ntfs_inode *base_ni; + int ret = -1; + + ntfs_log_enter("Entering for attribute type 0x%x\n", type); + + if (!ctx || !ctx->mrec || !ctx->attr || (name && name != AT_UNNAMED && + (!ctx->ntfs_ino || !(vol = ctx->ntfs_ino->vol) || + !vol->upcase || !vol->upcase_len))) { + errno = EINVAL; + ntfs_log_perror("%s", __FUNCTION__); + goto out; + } + + if (ctx->base_ntfs_ino) + base_ni = ctx->base_ntfs_ino; + else + base_ni = ctx->ntfs_ino; + if (!base_ni || !NInoAttrList(base_ni) || type == AT_ATTRIBUTE_LIST) + ret = ntfs_attr_find(type, name, name_len, ic, val, val_len, ctx); + else + ret = ntfs_external_attr_find(type, name, name_len, ic, + lowest_vcn, val, val_len, ctx); +out: + ntfs_log_leave("\n"); + return ret; +} + +/** + * ntfs_attr_position - find given or next attribute type in an ntfs inode + * @type: attribute type to start lookup + * @ctx: search context with mft record and attribute to search from + * + * Find an attribute type in an ntfs inode or the next attribute which is not + * the AT_END attribute. Please see more details at ntfs_attr_lookup. + * + * Return 0 if the search was successful and -1 if not, with errno set to the + * error code. + * + * The following error codes are defined: + * EINVAL Invalid arguments. + * EIO I/O error or corrupt data structures found. + * ENOMEM Not enough memory to allocate necessary buffers. + * ENOSPC No attribute was found after 'type', only AT_END. + */ +int ntfs_attr_position(const ATTR_TYPES type, ntfs_attr_search_ctx *ctx) +{ + if (ntfs_attr_lookup(type, NULL, 0, CASE_SENSITIVE, 0, NULL, 0, ctx)) { + if (errno != ENOENT) + return -1; + if (ctx->attr->type == AT_END) { + errno = ENOSPC; + return -1; + } + } + return 0; +} + +/** + * ntfs_attr_init_search_ctx - initialize an attribute search context + * @ctx: attribute search context to initialize + * @ni: ntfs inode with which to initialize the search context + * @mrec: mft record with which to initialize the search context + * + * Initialize the attribute search context @ctx with @ni and @mrec. + */ +static void ntfs_attr_init_search_ctx(ntfs_attr_search_ctx *ctx, + ntfs_inode *ni, MFT_RECORD *mrec) +{ + if (!mrec) + mrec = ni->mrec; + ctx->mrec = mrec; + /* Sanity checks are performed elsewhere. */ + ctx->attr = (ATTR_RECORD*)((u8*)mrec + le16_to_cpu(mrec->attrs_offset)); + ctx->is_first = TRUE; + ctx->ntfs_ino = ni; + ctx->al_entry = NULL; + ctx->base_ntfs_ino = NULL; + ctx->base_mrec = NULL; + ctx->base_attr = NULL; +} + +/** + * ntfs_attr_reinit_search_ctx - reinitialize an attribute search context + * @ctx: attribute search context to reinitialize + * + * Reinitialize the attribute search context @ctx. + * + * This is used when a search for a new attribute is being started to reset + * the search context to the beginning. + */ +void ntfs_attr_reinit_search_ctx(ntfs_attr_search_ctx *ctx) +{ + if (!ctx->base_ntfs_ino) { + /* No attribute list. */ + ctx->is_first = TRUE; + /* Sanity checks are performed elsewhere. */ + ctx->attr = (ATTR_RECORD*)((u8*)ctx->mrec + + le16_to_cpu(ctx->mrec->attrs_offset)); + /* + * This needs resetting due to ntfs_external_attr_find() which + * can leave it set despite having zeroed ctx->base_ntfs_ino. + */ + ctx->al_entry = NULL; + return; + } /* Attribute list. */ + ntfs_attr_init_search_ctx(ctx, ctx->base_ntfs_ino, ctx->base_mrec); + return; +} + +/** + * ntfs_attr_get_search_ctx - allocate/initialize a new attribute search context + * @ni: ntfs inode with which to initialize the search context + * @mrec: mft record with which to initialize the search context + * + * Allocate a new attribute search context, initialize it with @ni and @mrec, + * and return it. Return NULL on error with errno set. + * + * @mrec can be NULL, in which case the mft record is taken from @ni. + * + * Note: For low level utilities which know what they are doing we allow @ni to + * be NULL and @mrec to be set. Do NOT do this unless you understand the + * implications!!! For example it is no longer safe to call ntfs_attr_lookup(). + */ +ntfs_attr_search_ctx *ntfs_attr_get_search_ctx(ntfs_inode *ni, MFT_RECORD *mrec) +{ + ntfs_attr_search_ctx *ctx; + + if (!ni && !mrec) { + errno = EINVAL; + ntfs_log_perror("NULL arguments"); + return NULL; + } + ctx = ntfs_malloc(sizeof(ntfs_attr_search_ctx)); + if (ctx) + ntfs_attr_init_search_ctx(ctx, ni, mrec); + return ctx; +} + +/** + * ntfs_attr_put_search_ctx - release an attribute search context + * @ctx: attribute search context to free + * + * Release the attribute search context @ctx. + */ +void ntfs_attr_put_search_ctx(ntfs_attr_search_ctx *ctx) +{ + // NOTE: save errno if it could change and function stays void! + free(ctx); +} + +/** + * ntfs_attr_find_in_attrdef - find an attribute in the $AttrDef system file + * @vol: ntfs volume to which the attribute belongs + * @type: attribute type which to find + * + * Search for the attribute definition record corresponding to the attribute + * @type in the $AttrDef system file. + * + * Return the attribute type definition record if found and NULL if not found + * or an error occurred. On error the error code is stored in errno. The + * following error codes are defined: + * ENOENT - The attribute @type is not specified in $AttrDef. + * EINVAL - Invalid parameters (e.g. @vol is not valid). + */ +ATTR_DEF *ntfs_attr_find_in_attrdef(const ntfs_volume *vol, + const ATTR_TYPES type) +{ + ATTR_DEF *ad; + + if (!vol || !vol->attrdef || !type) { + errno = EINVAL; + ntfs_log_perror("%s: type=%d", __FUNCTION__, type); + return NULL; + } + for (ad = vol->attrdef; (u8*)ad - (u8*)vol->attrdef < + vol->attrdef_len && ad->type; ++ad) { + /* We haven't found it yet, carry on searching. */ + if (le32_to_cpu(ad->type) < le32_to_cpu(type)) + continue; + /* We found the attribute; return it. */ + if (ad->type == type) + return ad; + /* We have gone too far already. No point in continuing. */ + break; + } + errno = ENOENT; + ntfs_log_perror("%s: type=%d", __FUNCTION__, type); + return NULL; +} + +/** + * ntfs_attr_size_bounds_check - check a size of an attribute type for validity + * @vol: ntfs volume to which the attribute belongs + * @type: attribute type which to check + * @size: size which to check + * + * Check whether the @size in bytes is valid for an attribute of @type on the + * ntfs volume @vol. This information is obtained from $AttrDef system file. + * + * Return 0 if valid and -1 if not valid or an error occurred. On error the + * error code is stored in errno. The following error codes are defined: + * ERANGE - @size is not valid for the attribute @type. + * ENOENT - The attribute @type is not specified in $AttrDef. + * EINVAL - Invalid parameters (e.g. @size is < 0 or @vol is not valid). + */ +int ntfs_attr_size_bounds_check(const ntfs_volume *vol, const ATTR_TYPES type, + const s64 size) +{ + ATTR_DEF *ad; + s64 min_size, max_size; + + if (size < 0) { + errno = EINVAL; + ntfs_log_perror("%s: size=%lld", __FUNCTION__, + (long long)size); + return -1; + } + + /* + * $ATTRIBUTE_LIST shouldn't be greater than 0x40000, otherwise + * Windows would crash. This is not listed in the AttrDef. + */ + if (type == AT_ATTRIBUTE_LIST && size > 0x40000) { + errno = ERANGE; + ntfs_log_perror("Too large attrlist (%lld)", (long long)size); + return -1; + } + + ad = ntfs_attr_find_in_attrdef(vol, type); + if (!ad) + return -1; + + min_size = sle64_to_cpu(ad->min_size); + max_size = sle64_to_cpu(ad->max_size); + + if ((min_size && (size < min_size)) || + ((max_size > 0) && (size > max_size))) { + errno = ERANGE; + ntfs_log_perror("Attr type %d size check failed (min,size,max=" + "%lld,%lld,%lld)", type, (long long)min_size, + (long long)size, (long long)max_size); + return -1; + } + return 0; +} + +/** + * ntfs_attr_can_be_non_resident - check if an attribute can be non-resident + * @vol: ntfs volume to which the attribute belongs + * @type: attribute type to check + * @name: attribute name to check + * @name_len: attribute name length + * + * Check whether the attribute of @type and @name with name length @name_len on + * the ntfs volume @vol is allowed to be non-resident. This information is + * obtained from $AttrDef system file and is augmented by rules imposed by + * Microsoft (e.g. see http://support.microsoft.com/kb/974729/). + * + * Return 0 if the attribute is allowed to be non-resident and -1 if not or an + * error occurred. On error the error code is stored in errno. The following + * error codes are defined: + * EPERM - The attribute is not allowed to be non-resident. + * ENOENT - The attribute @type is not specified in $AttrDef. + * EINVAL - Invalid parameters (e.g. @vol is not valid). + */ +static int ntfs_attr_can_be_non_resident(const ntfs_volume *vol, const ATTR_TYPES type, + const ntfschar *name, int name_len) +{ + ATTR_DEF *ad; + BOOL allowed; + + /* + * Microsoft has decreed that $LOGGED_UTILITY_STREAM attributes with a + * name of $TXF_DATA must be resident despite the entry for + * $LOGGED_UTILITY_STREAM in $AttrDef allowing them to be non-resident. + * Failure to obey this on the root directory mft record of a volume + * causes Windows Vista and later to see the volume as a RAW volume and + * thus cannot mount it at all. + */ + if ((type == AT_LOGGED_UTILITY_STREAM) + && name + && ntfs_names_are_equal(TXF_DATA, 9, name, name_len, + CASE_SENSITIVE, vol->upcase, vol->upcase_len)) + allowed = FALSE; + else { + /* Find the attribute definition record in $AttrDef. */ + ad = ntfs_attr_find_in_attrdef(vol, type); + if (!ad) + return -1; + /* Check the flags and return the result. */ + allowed = !(ad->flags & ATTR_DEF_RESIDENT); + } + if (!allowed) { + errno = EPERM; + ntfs_log_trace("Attribute can't be non-resident\n"); + return -1; + } + return 0; +} + +/** + * ntfs_attr_can_be_resident - check if an attribute can be resident + * @vol: ntfs volume to which the attribute belongs + * @type: attribute type which to check + * + * Check whether the attribute of @type on the ntfs volume @vol is allowed to + * be resident. This information is derived from our ntfs knowledge and may + * not be completely accurate, especially when user defined attributes are + * present. Basically we allow everything to be resident except for index + * allocation and extended attribute attributes. + * + * Return 0 if the attribute is allowed to be resident and -1 if not or an + * error occurred. On error the error code is stored in errno. The following + * error codes are defined: + * EPERM - The attribute is not allowed to be resident. + * EINVAL - Invalid parameters (e.g. @vol is not valid). + * + * Warning: In the system file $MFT the attribute $Bitmap must be non-resident + * otherwise windows will not boot (blue screen of death)! We cannot + * check for this here as we don't know which inode's $Bitmap is being + * asked about so the caller needs to special case this. + */ +int ntfs_attr_can_be_resident(const ntfs_volume *vol, const ATTR_TYPES type) +{ + if (!vol || !vol->attrdef || !type) { + errno = EINVAL; + return -1; + } + if (type != AT_INDEX_ALLOCATION) + return 0; + + ntfs_log_trace("Attribute can't be resident\n"); + errno = EPERM; + return -1; +} + +/** + * ntfs_make_room_for_attr - make room for an attribute inside an mft record + * @m: mft record + * @pos: position at which to make space + * @size: byte size to make available at this position + * + * @pos points to the attribute in front of which we want to make space. + * + * Return 0 on success or -1 on error. On error the error code is stored in + * errno. Possible error codes are: + * ENOSPC - There is not enough space available to complete operation. The + * caller has to make space before calling this. + * EINVAL - Input parameters were faulty. + */ +int ntfs_make_room_for_attr(MFT_RECORD *m, u8 *pos, u32 size) +{ + u32 biu; + + ntfs_log_trace("Entering for pos 0x%d, size %u.\n", + (int)(pos - (u8*)m), (unsigned) size); + + /* Make size 8-byte alignment. */ + size = (size + 7) & ~7; + + /* Rigorous consistency checks. */ + if (!m || !pos || pos < (u8*)m) { + errno = EINVAL; + ntfs_log_perror("%s: pos=%p m=%p", __FUNCTION__, pos, m); + return -1; + } + /* The -8 is for the attribute terminator. */ + if (pos - (u8*)m > (int)le32_to_cpu(m->bytes_in_use) - 8) { + errno = EINVAL; + return -1; + } + /* Nothing to do. */ + if (!size) + return 0; + + biu = le32_to_cpu(m->bytes_in_use); + /* Do we have enough space? */ + if (biu + size > le32_to_cpu(m->bytes_allocated) || + pos + size > (u8*)m + le32_to_cpu(m->bytes_allocated)) { + errno = ENOSPC; + ntfs_log_trace("No enough space in the MFT record\n"); + return -1; + } + /* Move everything after pos to pos + size. */ + memmove(pos + size, pos, biu - (pos - (u8*)m)); + /* Update mft record. */ + m->bytes_in_use = cpu_to_le32(biu + size); + return 0; +} + +/** + * ntfs_resident_attr_record_add - add resident attribute to inode + * @ni: opened ntfs inode to which MFT record add attribute + * @type: type of the new attribute + * @name: name of the new attribute + * @name_len: name length of the new attribute + * @val: value of the new attribute + * @size: size of new attribute (length of @val, if @val != NULL) + * @flags: flags of the new attribute + * + * Return offset to attribute from the beginning of the mft record on success + * and -1 on error. On error the error code is stored in errno. + * Possible error codes are: + * EINVAL - Invalid arguments passed to function. + * EEXIST - Attribute of such type and with same name already exists. + * EIO - I/O error occurred or damaged filesystem. + */ +int ntfs_resident_attr_record_add(ntfs_inode *ni, ATTR_TYPES type, + ntfschar *name, u8 name_len, u8 *val, u32 size, + ATTR_FLAGS data_flags) +{ + ntfs_attr_search_ctx *ctx; + u32 length; + ATTR_RECORD *a; + MFT_RECORD *m; + int err, offset; + ntfs_inode *base_ni; + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x, flags 0x%x.\n", + (long long) ni->mft_no, (unsigned) type, (unsigned) data_flags); + + if (!ni || (!name && name_len)) { + errno = EINVAL; + return -1; + } + + if (ntfs_attr_can_be_resident(ni->vol, type)) { + if (errno == EPERM) + ntfs_log_trace("Attribute can't be resident.\n"); + else + ntfs_log_trace("ntfs_attr_can_be_resident failed.\n"); + return -1; + } + + /* Locate place where record should be. */ + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + return -1; + /* + * Use ntfs_attr_find instead of ntfs_attr_lookup to find place for + * attribute in @ni->mrec, not any extent inode in case if @ni is base + * file record. + */ + if (!ntfs_attr_find(type, name, name_len, CASE_SENSITIVE, val, size, + ctx)) { + err = EEXIST; + ntfs_log_trace("Attribute already present.\n"); + goto put_err_out; + } + if (errno != ENOENT) { + err = EIO; + goto put_err_out; + } + a = ctx->attr; + m = ctx->mrec; + + /* Make room for attribute. */ + length = offsetof(ATTR_RECORD, resident_end) + + ((name_len * sizeof(ntfschar) + 7) & ~7) + + ((size + 7) & ~7); + if (ntfs_make_room_for_attr(ctx->mrec, (u8*) ctx->attr, length)) { + err = errno; + ntfs_log_trace("Failed to make room for attribute.\n"); + goto put_err_out; + } + + /* Setup record fields. */ + offset = ((u8*)a - (u8*)m); + a->type = type; + a->length = cpu_to_le32(length); + a->non_resident = 0; + a->name_length = name_len; + a->name_offset = (name_len + ? cpu_to_le16(offsetof(ATTR_RECORD, resident_end)) + : const_cpu_to_le16(0)); + a->flags = data_flags; + a->instance = m->next_attr_instance; + a->value_length = cpu_to_le32(size); + a->value_offset = cpu_to_le16(length - ((size + 7) & ~7)); + if (val) + memcpy((u8*)a + le16_to_cpu(a->value_offset), val, size); + else + memset((u8*)a + le16_to_cpu(a->value_offset), 0, size); + if (type == AT_FILE_NAME) + a->resident_flags = RESIDENT_ATTR_IS_INDEXED; + else + a->resident_flags = 0; + if (name_len) + memcpy((u8*)a + le16_to_cpu(a->name_offset), + name, sizeof(ntfschar) * name_len); + m->next_attr_instance = + cpu_to_le16((le16_to_cpu(m->next_attr_instance) + 1) & 0xffff); + if (ni->nr_extents == -1) + base_ni = ni->base_ni; + else + base_ni = ni; + if (type != AT_ATTRIBUTE_LIST && NInoAttrList(base_ni)) { + if (ntfs_attrlist_entry_add(ni, a)) { + err = errno; + ntfs_attr_record_resize(m, a, 0); + ntfs_log_trace("Failed add attribute entry to " + "ATTRIBUTE_LIST.\n"); + goto put_err_out; + } + } + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY + ? type == AT_INDEX_ROOT && name == NTFS_INDEX_I30 + : type == AT_DATA && name == AT_UNNAMED) { + ni->data_size = size; + ni->allocated_size = (size + 7) & ~7; + set_nino_flag(ni,KnownSize); + } + ntfs_inode_mark_dirty(ni); + ntfs_attr_put_search_ctx(ctx); + return offset; +put_err_out: + ntfs_attr_put_search_ctx(ctx); + errno = err; + return -1; +} + +/** + * ntfs_non_resident_attr_record_add - add extent of non-resident attribute + * @ni: opened ntfs inode to which MFT record add attribute + * @type: type of the new attribute extent + * @name: name of the new attribute extent + * @name_len: name length of the new attribute extent + * @lowest_vcn: lowest vcn of the new attribute extent + * @dataruns_size: dataruns size of the new attribute extent + * @flags: flags of the new attribute extent + * + * Return offset to attribute from the beginning of the mft record on success + * and -1 on error. On error the error code is stored in errno. + * Possible error codes are: + * EINVAL - Invalid arguments passed to function. + * EEXIST - Attribute of such type, with same lowest vcn and with same + * name already exists. + * EIO - I/O error occurred or damaged filesystem. + */ +int ntfs_non_resident_attr_record_add(ntfs_inode *ni, ATTR_TYPES type, + ntfschar *name, u8 name_len, VCN lowest_vcn, int dataruns_size, + ATTR_FLAGS flags) +{ + ntfs_attr_search_ctx *ctx; + u32 length; + ATTR_RECORD *a; + MFT_RECORD *m; + ntfs_inode *base_ni; + int err, offset; + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x, lowest_vcn %lld, " + "dataruns_size %d, flags 0x%x.\n", + (long long) ni->mft_no, (unsigned) type, + (long long) lowest_vcn, dataruns_size, (unsigned) flags); + + if (!ni || dataruns_size <= 0 || (!name && name_len)) { + errno = EINVAL; + return -1; + } + + if (ntfs_attr_can_be_non_resident(ni->vol, type, name, name_len)) { + if (errno == EPERM) + ntfs_log_perror("Attribute can't be non resident"); + else + ntfs_log_perror("ntfs_attr_can_be_non_resident failed"); + return -1; + } + + /* Locate place where record should be. */ + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + return -1; + /* + * Use ntfs_attr_find instead of ntfs_attr_lookup to find place for + * attribute in @ni->mrec, not any extent inode in case if @ni is base + * file record. + */ + if (!ntfs_attr_find(type, name, name_len, CASE_SENSITIVE, NULL, 0, + ctx)) { + err = EEXIST; + ntfs_log_perror("Attribute 0x%x already present", type); + goto put_err_out; + } + if (errno != ENOENT) { + ntfs_log_perror("ntfs_attr_find failed"); + err = EIO; + goto put_err_out; + } + a = ctx->attr; + m = ctx->mrec; + + /* Make room for attribute. */ + dataruns_size = (dataruns_size + 7) & ~7; + length = offsetof(ATTR_RECORD, compressed_size) + ((sizeof(ntfschar) * + name_len + 7) & ~7) + dataruns_size + + ((flags & (ATTR_IS_COMPRESSED | ATTR_IS_SPARSE)) ? + sizeof(a->compressed_size) : 0); + if (ntfs_make_room_for_attr(ctx->mrec, (u8*) ctx->attr, length)) { + err = errno; + ntfs_log_perror("Failed to make room for attribute"); + goto put_err_out; + } + + /* Setup record fields. */ + a->type = type; + a->length = cpu_to_le32(length); + a->non_resident = 1; + a->name_length = name_len; + a->name_offset = cpu_to_le16(offsetof(ATTR_RECORD, compressed_size) + + ((flags & (ATTR_IS_COMPRESSED | ATTR_IS_SPARSE)) ? + sizeof(a->compressed_size) : 0)); + a->flags = flags; + a->instance = m->next_attr_instance; + a->lowest_vcn = cpu_to_sle64(lowest_vcn); + a->mapping_pairs_offset = cpu_to_le16(length - dataruns_size); + a->compression_unit = (flags & ATTR_IS_COMPRESSED) + ? STANDARD_COMPRESSION_UNIT : 0; + /* If @lowest_vcn == 0, than setup empty attribute. */ + if (!lowest_vcn) { + a->highest_vcn = cpu_to_sle64(-1); + a->allocated_size = 0; + a->data_size = 0; + a->initialized_size = 0; + /* Set empty mapping pairs. */ + *((u8*)a + le16_to_cpu(a->mapping_pairs_offset)) = 0; + } + if (name_len) + memcpy((u8*)a + le16_to_cpu(a->name_offset), + name, sizeof(ntfschar) * name_len); + m->next_attr_instance = + cpu_to_le16((le16_to_cpu(m->next_attr_instance) + 1) & 0xffff); + if (ni->nr_extents == -1) + base_ni = ni->base_ni; + else + base_ni = ni; + if (type != AT_ATTRIBUTE_LIST && NInoAttrList(base_ni)) { + if (ntfs_attrlist_entry_add(ni, a)) { + err = errno; + ntfs_log_perror("Failed add attr entry to attrlist"); + ntfs_attr_record_resize(m, a, 0); + goto put_err_out; + } + } + ntfs_inode_mark_dirty(ni); + /* + * Locate offset from start of the MFT record where new attribute is + * placed. We need relookup it, because record maybe moved during + * update of attribute list. + */ + ntfs_attr_reinit_search_ctx(ctx); + if (ntfs_attr_lookup(type, name, name_len, CASE_SENSITIVE, + lowest_vcn, NULL, 0, ctx)) { + ntfs_log_perror("%s: attribute lookup failed", __FUNCTION__); + ntfs_attr_put_search_ctx(ctx); + return -1; + + } + offset = (u8*)ctx->attr - (u8*)ctx->mrec; + ntfs_attr_put_search_ctx(ctx); + return offset; +put_err_out: + ntfs_attr_put_search_ctx(ctx); + errno = err; + return -1; +} + +/** + * ntfs_attr_record_rm - remove attribute extent + * @ctx: search context describing the attribute which should be removed + * + * If this function succeed, user should reinit search context if he/she wants + * use it anymore. + * + * Return 0 on success and -1 on error. On error the error code is stored in + * errno. Possible error codes are: + * EINVAL - Invalid arguments passed to function. + * EIO - I/O error occurred or damaged filesystem. + */ +int ntfs_attr_record_rm(ntfs_attr_search_ctx *ctx) +{ + ntfs_inode *base_ni, *ni; + ATTR_TYPES type; + + if (!ctx || !ctx->ntfs_ino || !ctx->mrec || !ctx->attr) { + errno = EINVAL; + return -1; + } + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x.\n", + (long long) ctx->ntfs_ino->mft_no, + (unsigned) le32_to_cpu(ctx->attr->type)); + type = ctx->attr->type; + ni = ctx->ntfs_ino; + if (ctx->base_ntfs_ino) + base_ni = ctx->base_ntfs_ino; + else + base_ni = ctx->ntfs_ino; + + /* Remove attribute itself. */ + if (ntfs_attr_record_resize(ctx->mrec, ctx->attr, 0)) { + ntfs_log_trace("Couldn't remove attribute record. Bug or damaged MFT " + "record.\n"); + if (NInoAttrList(base_ni) && type != AT_ATTRIBUTE_LIST) + if (ntfs_attrlist_entry_add(ni, ctx->attr)) + ntfs_log_trace("Rollback failed. Leaving inconstant " + "metadata.\n"); + errno = EIO; + return -1; + } + ntfs_inode_mark_dirty(ni); + + /* + * Remove record from $ATTRIBUTE_LIST if present and we don't want + * delete $ATTRIBUTE_LIST itself. + */ + if (NInoAttrList(base_ni) && type != AT_ATTRIBUTE_LIST) { + if (ntfs_attrlist_entry_rm(ctx)) { + ntfs_log_trace("Couldn't delete record from " + "$ATTRIBUTE_LIST.\n"); + return -1; + } + } + + /* Post $ATTRIBUTE_LIST delete setup. */ + if (type == AT_ATTRIBUTE_LIST) { + if (NInoAttrList(base_ni) && base_ni->attr_list) + free(base_ni->attr_list); + base_ni->attr_list = NULL; + NInoClearAttrList(base_ni); + NInoAttrListClearDirty(base_ni); + } + + /* Free MFT record, if it doesn't contain attributes. */ + if (le32_to_cpu(ctx->mrec->bytes_in_use) - + le16_to_cpu(ctx->mrec->attrs_offset) == 8) { + if (ntfs_mft_record_free(ni->vol, ni)) { + // FIXME: We need rollback here. + ntfs_log_trace("Couldn't free MFT record.\n"); + errno = EIO; + return -1; + } + /* Remove done if we freed base inode. */ + if (ni == base_ni) + return 0; + } + + if (type == AT_ATTRIBUTE_LIST || !NInoAttrList(base_ni)) + return 0; + + /* Remove attribute list if we don't need it any more. */ + if (!ntfs_attrlist_need(base_ni)) { + ntfs_attr_reinit_search_ctx(ctx); + if (ntfs_attr_lookup(AT_ATTRIBUTE_LIST, NULL, 0, CASE_SENSITIVE, + 0, NULL, 0, ctx)) { + /* + * FIXME: Should we succeed here? Definitely something + * goes wrong because NInoAttrList(base_ni) returned + * that we have got attribute list. + */ + ntfs_log_trace("Couldn't find attribute list. Succeed " + "anyway.\n"); + return 0; + } + /* Deallocate clusters. */ + if (ctx->attr->non_resident) { + runlist *al_rl; + + al_rl = ntfs_mapping_pairs_decompress(base_ni->vol, + ctx->attr, NULL); + if (!al_rl) { + ntfs_log_trace("Couldn't decompress attribute list " + "runlist. Succeed anyway.\n"); + return 0; + } + if (ntfs_cluster_free_from_rl(base_ni->vol, al_rl)) { + ntfs_log_trace("Leaking clusters! Run chkdsk. " + "Couldn't free clusters from " + "attribute list runlist.\n"); + } + free(al_rl); + } + /* Remove attribute record itself. */ + if (ntfs_attr_record_rm(ctx)) { + /* + * FIXME: Should we succeed here? BTW, chkdsk doesn't + * complain if it find MFT record with attribute list, + * but without extents. + */ + ntfs_log_trace("Couldn't remove attribute list. Succeed " + "anyway.\n"); + return 0; + } + } + return 0; +} + +/** + * ntfs_attr_add - add attribute to inode + * @ni: opened ntfs inode to which add attribute + * @type: type of the new attribute + * @name: name in unicode of the new attribute + * @name_len: name length in unicode characters of the new attribute + * @val: value of new attribute + * @size: size of the new attribute / length of @val (if specified) + * + * @val should always be specified for always resident attributes (eg. FILE_NAME + * attribute), for attributes that can become non-resident @val can be NULL + * (eg. DATA attribute). @size can be specified even if @val is NULL, in this + * case data size will be equal to @size and initialized size will be equal + * to 0. + * + * If inode haven't got enough space to add attribute, add attribute to one of + * it extents, if no extents present or no one of them have enough space, than + * allocate new extent and add attribute to it. + * + * If on one of this steps attribute list is needed but not present, than it is + * added transparently to caller. So, this function should not be called with + * @type == AT_ATTRIBUTE_LIST, if you really need to add attribute list call + * ntfs_inode_add_attrlist instead. + * + * On success return 0. On error return -1 with errno set to the error code. + */ +int ntfs_attr_add(ntfs_inode *ni, ATTR_TYPES type, + ntfschar *name, u8 name_len, u8 *val, s64 size) +{ + u32 attr_rec_size; + int err, i, offset; + BOOL is_resident; + BOOL can_be_non_resident = FALSE; + ntfs_inode *attr_ni; + ntfs_attr *na; + ATTR_FLAGS data_flags; + + if (!ni || size < 0 || type == AT_ATTRIBUTE_LIST) { + errno = EINVAL; + ntfs_log_perror("%s: ni=%p size=%lld", __FUNCTION__, ni, + (long long)size); + return -1; + } + + ntfs_log_trace("Entering for inode %lld, attr %x, size %lld.\n", + (long long)ni->mft_no, type, (long long)size); + + if (ni->nr_extents == -1) + ni = ni->base_ni; + + /* Check the attribute type and the size. */ + if (ntfs_attr_size_bounds_check(ni->vol, type, size)) { + if (errno == ENOENT) + errno = EIO; + return -1; + } + + /* Sanity checks for always resident attributes. */ + if (ntfs_attr_can_be_non_resident(ni->vol, type, name, name_len)) { + if (errno != EPERM) { + err = errno; + ntfs_log_perror("ntfs_attr_can_be_non_resident failed"); + goto err_out; + } + /* @val is mandatory. */ + if (!val) { + errno = EINVAL; + ntfs_log_perror("val is mandatory for always resident " + "attributes"); + return -1; + } + if (size > ni->vol->mft_record_size) { + errno = ERANGE; + ntfs_log_perror("Attribute is too big"); + return -1; + } + } else + can_be_non_resident = TRUE; + + /* + * Determine resident or not will be new attribute. We add 8 to size in + * non resident case for mapping pairs. + */ + if (!ntfs_attr_can_be_resident(ni->vol, type)) { + is_resident = TRUE; + } else { + if (errno != EPERM) { + err = errno; + ntfs_log_perror("ntfs_attr_can_be_resident failed"); + goto err_out; + } + is_resident = FALSE; + } + /* Calculate attribute record size. */ + if (is_resident) + attr_rec_size = offsetof(ATTR_RECORD, resident_end) + + ((name_len * sizeof(ntfschar) + 7) & ~7) + + ((size + 7) & ~7); + else + attr_rec_size = offsetof(ATTR_RECORD, non_resident_end) + + ((name_len * sizeof(ntfschar) + 7) & ~7) + 8; + + /* + * If we have enough free space for the new attribute in the base MFT + * record, then add attribute to it. + */ + if (le32_to_cpu(ni->mrec->bytes_allocated) - + le32_to_cpu(ni->mrec->bytes_in_use) >= attr_rec_size) { + attr_ni = ni; + goto add_attr_record; + } + + /* Try to add to extent inodes. */ + if (ntfs_inode_attach_all_extents(ni)) { + err = errno; + ntfs_log_perror("Failed to attach all extents to inode"); + goto err_out; + } + for (i = 0; i < ni->nr_extents; i++) { + attr_ni = ni->extent_nis[i]; + if (le32_to_cpu(attr_ni->mrec->bytes_allocated) - + le32_to_cpu(attr_ni->mrec->bytes_in_use) >= + attr_rec_size) + goto add_attr_record; + } + + /* There is no extent that contain enough space for new attribute. */ + if (!NInoAttrList(ni)) { + /* Add attribute list not present, add it and retry. */ + if (ntfs_inode_add_attrlist(ni)) { + err = errno; + ntfs_log_perror("Failed to add attribute list"); + goto err_out; + } + return ntfs_attr_add(ni, type, name, name_len, val, size); + } + /* Allocate new extent. */ + attr_ni = ntfs_mft_record_alloc(ni->vol, ni); + if (!attr_ni) { + err = errno; + ntfs_log_perror("Failed to allocate extent record"); + goto err_out; + } + +add_attr_record: + if ((ni->flags & FILE_ATTR_COMPRESSED) + && (ni->vol->major_ver >= 3) + && NVolCompression(ni->vol) + && (ni->vol->cluster_size <= MAX_COMPRESSION_CLUSTER_SIZE) + && ((type == AT_DATA) + || ((type == AT_INDEX_ROOT) && (name == NTFS_INDEX_I30)))) + data_flags = ATTR_IS_COMPRESSED; + else + data_flags = const_cpu_to_le16(0); + if (is_resident) { + /* Add resident attribute. */ + offset = ntfs_resident_attr_record_add(attr_ni, type, name, + name_len, val, size, data_flags); + if (offset < 0) { + if (errno == ENOSPC && can_be_non_resident) + goto add_non_resident; + err = errno; + ntfs_log_perror("Failed to add resident attribute"); + goto free_err_out; + } + return 0; + } + +add_non_resident: + /* Add non resident attribute. */ + offset = ntfs_non_resident_attr_record_add(attr_ni, type, name, + name_len, 0, 8, data_flags); + if (offset < 0) { + err = errno; + ntfs_log_perror("Failed to add non resident attribute"); + goto free_err_out; + } + + /* If @size == 0, we are done. */ + if (!size) + return 0; + + /* Open new attribute and resize it. */ + na = ntfs_attr_open(ni, type, name, name_len); + if (!na) { + err = errno; + ntfs_log_perror("Failed to open just added attribute"); + goto rm_attr_err_out; + } + /* Resize and set attribute value. */ + if (ntfs_attr_truncate(na, size) || + (val && (ntfs_attr_pwrite(na, 0, size, val) != size))) { + err = errno; + ntfs_log_perror("Failed to initialize just added attribute"); + if (ntfs_attr_rm(na)) + ntfs_log_perror("Failed to remove just added attribute"); + ntfs_attr_close(na); + goto err_out; + } + ntfs_attr_close(na); + return 0; + +rm_attr_err_out: + /* Remove just added attribute. */ + if (ntfs_attr_record_resize(attr_ni->mrec, + (ATTR_RECORD*)((u8*)attr_ni->mrec + offset), 0)) + ntfs_log_perror("Failed to remove just added attribute #2"); +free_err_out: + /* Free MFT record, if it doesn't contain attributes. */ + if (le32_to_cpu(attr_ni->mrec->bytes_in_use) - + le16_to_cpu(attr_ni->mrec->attrs_offset) == 8) + if (ntfs_mft_record_free(attr_ni->vol, attr_ni)) + ntfs_log_perror("Failed to free MFT record"); +err_out: + errno = err; + return -1; +} + +/* + * Change an attribute flag + */ + +int ntfs_attr_set_flags(ntfs_inode *ni, ATTR_TYPES type, + ntfschar *name, u8 name_len, ATTR_FLAGS flags, ATTR_FLAGS mask) +{ + ntfs_attr_search_ctx *ctx; + int res; + + res = -1; + /* Search for designated attribute */ + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (ctx) { + if (!ntfs_attr_lookup(type, name, name_len, + CASE_SENSITIVE, 0, NULL, 0, ctx)) { + /* do the requested change (all small endian le16) */ + ctx->attr->flags = (ctx->attr->flags & ~mask) + | (flags & mask); + NInoSetDirty(ni); + res = 0; + } + ntfs_attr_put_search_ctx(ctx); + } + return (res); +} + + +/** + * ntfs_attr_rm - remove attribute from ntfs inode + * @na: opened ntfs attribute to delete + * + * Remove attribute and all it's extents from ntfs inode. If attribute was non + * resident also free all clusters allocated by attribute. + * + * Return 0 on success or -1 on error with errno set to the error code. + */ +int ntfs_attr_rm(ntfs_attr *na) +{ + ntfs_attr_search_ctx *ctx; + int ret = 0; + + if (!na) { + ntfs_log_trace("Invalid arguments passed.\n"); + errno = EINVAL; + return -1; + } + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x.\n", + (long long) na->ni->mft_no, na->type); + + /* Free cluster allocation. */ + if (NAttrNonResident(na)) { + if (ntfs_attr_map_whole_runlist(na)) + return -1; + if (ntfs_cluster_free(na->ni->vol, na, 0, -1) < 0) { + ntfs_log_trace("Failed to free cluster allocation. Leaving " + "inconstant metadata.\n"); + ret = -1; + } + } + + /* Search for attribute extents and remove them all. */ + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + return -1; + while (!ntfs_attr_lookup(na->type, na->name, na->name_len, + CASE_SENSITIVE, 0, NULL, 0, ctx)) { + if (ntfs_attr_record_rm(ctx)) { + ntfs_log_trace("Failed to remove attribute extent. Leaving " + "inconstant metadata.\n"); + ret = -1; + } + ntfs_attr_reinit_search_ctx(ctx); + } + ntfs_attr_put_search_ctx(ctx); + if (errno != ENOENT) { + ntfs_log_trace("Attribute lookup failed. Probably leaving inconstant " + "metadata.\n"); + ret = -1; + } + + return ret; +} + +/** + * ntfs_attr_record_resize - resize an attribute record + * @m: mft record containing attribute record + * @a: attribute record to resize + * @new_size: new size in bytes to which to resize the attribute record @a + * + * Resize the attribute record @a, i.e. the resident part of the attribute, in + * the mft record @m to @new_size bytes. + * + * Return 0 on success and -1 on error with errno set to the error code. + * The following error codes are defined: + * ENOSPC - Not enough space in the mft record @m to perform the resize. + * Note that on error no modifications have been performed whatsoever. + * + * Warning: If you make a record smaller without having copied all the data you + * are interested in the data may be overwritten! + */ +int ntfs_attr_record_resize(MFT_RECORD *m, ATTR_RECORD *a, u32 new_size) +{ + u32 old_size, alloc_size, attr_size; + + old_size = le32_to_cpu(m->bytes_in_use); + alloc_size = le32_to_cpu(m->bytes_allocated); + attr_size = le32_to_cpu(a->length); + + ntfs_log_trace("Sizes: old=%u alloc=%u attr=%u new=%u\n", + (unsigned)old_size, (unsigned)alloc_size, + (unsigned)attr_size, (unsigned)new_size); + + /* Align to 8 bytes, just in case the caller hasn't. */ + new_size = (new_size + 7) & ~7; + + /* If the actual attribute length has changed, move things around. */ + if (new_size != attr_size) { + + u32 new_muse = old_size - attr_size + new_size; + + /* Not enough space in this mft record. */ + if (new_muse > alloc_size) { + errno = ENOSPC; + ntfs_log_trace("Not enough space in the MFT record " + "(%u > %u)\n", new_muse, alloc_size); + return -1; + } + + if (a->type == AT_INDEX_ROOT && new_size > attr_size && + new_muse + 120 > alloc_size && old_size + 120 <= alloc_size) { + errno = ENOSPC; + ntfs_log_trace("Too big INDEX_ROOT (%u > %u)\n", + new_muse, alloc_size); + return STATUS_RESIDENT_ATTRIBUTE_FILLED_MFT; + } + + /* Move attributes following @a to their new location. */ + memmove((u8 *)a + new_size, (u8 *)a + attr_size, + old_size - ((u8 *)a - (u8 *)m) - attr_size); + + /* Adjust @m to reflect the change in used space. */ + m->bytes_in_use = cpu_to_le32(new_muse); + + /* Adjust @a to reflect the new size. */ + if (new_size >= offsetof(ATTR_REC, length) + sizeof(a->length)) + a->length = cpu_to_le32(new_size); + } + return 0; +} + +/** + * ntfs_resident_attr_value_resize - resize the value of a resident attribute + * @m: mft record containing attribute record + * @a: attribute record whose value to resize + * @new_size: new size in bytes to which to resize the attribute value of @a + * + * Resize the value of the attribute @a in the mft record @m to @new_size bytes. + * If the value is made bigger, the newly "allocated" space is cleared. + * + * Return 0 on success and -1 on error with errno set to the error code. + * The following error codes are defined: + * ENOSPC - Not enough space in the mft record @m to perform the resize. + * Note that on error no modifications have been performed whatsoever. + */ +int ntfs_resident_attr_value_resize(MFT_RECORD *m, ATTR_RECORD *a, + const u32 new_size) +{ + int ret; + + ntfs_log_trace("Entering for new size %u.\n", (unsigned)new_size); + + /* Resize the resident part of the attribute record. */ + if ((ret = ntfs_attr_record_resize(m, a, (le16_to_cpu(a->value_offset) + + new_size + 7) & ~7)) < 0) + return ret; + /* + * If we made the attribute value bigger, clear the area between the + * old size and @new_size. + */ + if (new_size > le32_to_cpu(a->value_length)) + memset((u8*)a + le16_to_cpu(a->value_offset) + + le32_to_cpu(a->value_length), 0, new_size - + le32_to_cpu(a->value_length)); + /* Finally update the length of the attribute value. */ + a->value_length = cpu_to_le32(new_size); + return 0; +} + +/** + * ntfs_attr_record_move_to - move attribute record to target inode + * @ctx: attribute search context describing the attribute record + * @ni: opened ntfs inode to which move attribute record + * + * If this function succeed, user should reinit search context if he/she wants + * use it anymore. + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +int ntfs_attr_record_move_to(ntfs_attr_search_ctx *ctx, ntfs_inode *ni) +{ + ntfs_attr_search_ctx *nctx; + ATTR_RECORD *a; + int err; + + if (!ctx || !ctx->attr || !ctx->ntfs_ino || !ni) { + ntfs_log_trace("Invalid arguments passed.\n"); + errno = EINVAL; + return -1; + } + + ntfs_log_trace("Entering for ctx->attr->type 0x%x, ctx->ntfs_ino->mft_no " + "0x%llx, ni->mft_no 0x%llx.\n", + (unsigned) le32_to_cpu(ctx->attr->type), + (long long) ctx->ntfs_ino->mft_no, + (long long) ni->mft_no); + + if (ctx->ntfs_ino == ni) + return 0; + + if (!ctx->al_entry) { + ntfs_log_trace("Inode should contain attribute list to use this " + "function.\n"); + errno = EINVAL; + return -1; + } + + /* Find place in MFT record where attribute will be moved. */ + a = ctx->attr; + nctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!nctx) + return -1; + + /* + * Use ntfs_attr_find instead of ntfs_attr_lookup to find place for + * attribute in @ni->mrec, not any extent inode in case if @ni is base + * file record. + */ + if (!ntfs_attr_find(a->type, (ntfschar*)((u8*)a + le16_to_cpu( + a->name_offset)), a->name_length, CASE_SENSITIVE, NULL, + 0, nctx)) { + ntfs_log_trace("Attribute of such type, with same name already " + "present in this MFT record.\n"); + err = EEXIST; + goto put_err_out; + } + if (errno != ENOENT) { + err = errno; + ntfs_log_debug("Attribute lookup failed.\n"); + goto put_err_out; + } + + /* Make space and move attribute. */ + if (ntfs_make_room_for_attr(ni->mrec, (u8*) nctx->attr, + le32_to_cpu(a->length))) { + err = errno; + ntfs_log_trace("Couldn't make space for attribute.\n"); + goto put_err_out; + } + memcpy(nctx->attr, a, le32_to_cpu(a->length)); + nctx->attr->instance = nctx->mrec->next_attr_instance; + nctx->mrec->next_attr_instance = cpu_to_le16( + (le16_to_cpu(nctx->mrec->next_attr_instance) + 1) & 0xffff); + ntfs_attr_record_resize(ctx->mrec, a, 0); + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_inode_mark_dirty(ni); + + /* Update attribute list. */ + ctx->al_entry->mft_reference = + MK_LE_MREF(ni->mft_no, le16_to_cpu(ni->mrec->sequence_number)); + ctx->al_entry->instance = nctx->attr->instance; + ntfs_attrlist_mark_dirty(ni); + + ntfs_attr_put_search_ctx(nctx); + return 0; +put_err_out: + ntfs_attr_put_search_ctx(nctx); + errno = err; + return -1; +} + +/** + * ntfs_attr_record_move_away - move away attribute record from it's mft record + * @ctx: attribute search context describing the attribute record + * @extra: minimum amount of free space in the new holder of record + * + * New attribute record holder must have free @extra bytes after moving + * attribute record to it. + * + * If this function succeed, user should reinit search context if he/she wants + * use it anymore. + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +int ntfs_attr_record_move_away(ntfs_attr_search_ctx *ctx, int extra) +{ + ntfs_inode *base_ni, *ni; + MFT_RECORD *m; + int i; + + if (!ctx || !ctx->attr || !ctx->ntfs_ino || extra < 0) { + errno = EINVAL; + ntfs_log_perror("%s: ctx=%p ctx->attr=%p extra=%d", __FUNCTION__, + ctx, ctx ? ctx->attr : NULL, extra); + return -1; + } + + ntfs_log_trace("Entering for attr 0x%x, inode %llu\n", + (unsigned) le32_to_cpu(ctx->attr->type), + (unsigned long long)ctx->ntfs_ino->mft_no); + + if (ctx->ntfs_ino->nr_extents == -1) + base_ni = ctx->base_ntfs_ino; + else + base_ni = ctx->ntfs_ino; + + if (!NInoAttrList(base_ni)) { + errno = EINVAL; + ntfs_log_perror("Inode %llu has no attrlist", + (unsigned long long)base_ni->mft_no); + return -1; + } + + if (ntfs_inode_attach_all_extents(ctx->ntfs_ino)) { + ntfs_log_perror("Couldn't attach extents, inode=%llu", + (unsigned long long)base_ni->mft_no); + return -1; + } + + /* Walk through all extents and try to move attribute to them. */ + for (i = 0; i < base_ni->nr_extents; i++) { + ni = base_ni->extent_nis[i]; + m = ni->mrec; + + if (ctx->ntfs_ino->mft_no == ni->mft_no) + continue; + + if (le32_to_cpu(m->bytes_allocated) - + le32_to_cpu(m->bytes_in_use) < + le32_to_cpu(ctx->attr->length) + extra) + continue; + + /* + * ntfs_attr_record_move_to can fail if extent with other lowest + * VCN already present in inode we trying move record to. So, + * do not return error. + */ + if (!ntfs_attr_record_move_to(ctx, ni)) + return 0; + } + + /* + * Failed to move attribute to one of the current extents, so allocate + * new extent and move attribute to it. + */ + ni = ntfs_mft_record_alloc(base_ni->vol, base_ni); + if (!ni) { + ntfs_log_perror("Couldn't allocate MFT record"); + return -1; + } + if (ntfs_attr_record_move_to(ctx, ni)) { + ntfs_log_perror("Couldn't move attribute to MFT record"); + return -1; + } + return 0; +} + +/** + * ntfs_attr_make_non_resident - convert a resident to a non-resident attribute + * @na: open ntfs attribute to make non-resident + * @ctx: ntfs search context describing the attribute + * + * Convert a resident ntfs attribute to a non-resident one. + * + * Return 0 on success and -1 on error with errno set to the error code. The + * following error codes are defined: + * EPERM - The attribute is not allowed to be non-resident. + * TODO: others... + * + * NOTE to self: No changes in the attribute list are required to move from + * a resident to a non-resident attribute. + * + * Warning: We do not set the inode dirty and we do not write out anything! + * We expect the caller to do this as this is a fairly low level + * function and it is likely there will be further changes made. + */ +int ntfs_attr_make_non_resident(ntfs_attr *na, + ntfs_attr_search_ctx *ctx) +{ + s64 new_allocated_size, bw; + ntfs_volume *vol = na->ni->vol; + ATTR_REC *a = ctx->attr; + runlist *rl; + int mp_size, mp_ofs, name_ofs, arec_size, err; + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x.\n", (unsigned long + long)na->ni->mft_no, na->type); + + /* Some preliminary sanity checking. */ + if (NAttrNonResident(na)) { + ntfs_log_trace("Eeek! Trying to make non-resident attribute " + "non-resident. Aborting...\n"); + errno = EINVAL; + return -1; + } + + /* Check that the attribute is allowed to be non-resident. */ + if (ntfs_attr_can_be_non_resident(vol, na->type, na->name, na->name_len)) + return -1; + + new_allocated_size = (le32_to_cpu(a->value_length) + vol->cluster_size + - 1) & ~(vol->cluster_size - 1); + + if (new_allocated_size > 0) { + if ((a->flags & ATTR_COMPRESSION_MASK) + == ATTR_IS_COMPRESSED) { + /* must allocate full compression blocks */ + new_allocated_size = ((new_allocated_size - 1) + | ((1L << (STANDARD_COMPRESSION_UNIT + + vol->cluster_size_bits)) - 1)) + 1; + } + /* Start by allocating clusters to hold the attribute value. */ + rl = ntfs_cluster_alloc(vol, 0, new_allocated_size >> + vol->cluster_size_bits, -1, DATA_ZONE); + if (!rl) + return -1; + } else + rl = NULL; + /* + * Setup the in-memory attribute structure to be non-resident so that + * we can use ntfs_attr_pwrite(). + */ + NAttrSetNonResident(na); + NAttrSetBeingNonResident(na); + na->rl = rl; + na->allocated_size = new_allocated_size; + na->data_size = na->initialized_size = le32_to_cpu(a->value_length); + /* + * FIXME: For now just clear all of these as we don't support them when + * writing. + */ + NAttrClearSparse(na); + NAttrClearEncrypted(na); + if ((a->flags & ATTR_COMPRESSION_MASK) == ATTR_IS_COMPRESSED) { + /* set compression writing parameters */ + na->compression_block_size + = 1 << (STANDARD_COMPRESSION_UNIT + vol->cluster_size_bits); + na->compression_block_clusters = 1 << STANDARD_COMPRESSION_UNIT; + } + + if (rl) { + /* Now copy the attribute value to the allocated cluster(s). */ + bw = ntfs_attr_pwrite(na, 0, le32_to_cpu(a->value_length), + (u8*)a + le16_to_cpu(a->value_offset)); + if (bw != le32_to_cpu(a->value_length)) { + err = errno; + ntfs_log_debug("Eeek! Failed to write out attribute value " + "(bw = %lli, errno = %i). " + "Aborting...\n", (long long)bw, err); + if (bw >= 0) + err = EIO; + goto cluster_free_err_out; + } + } + /* Determine the size of the mapping pairs array. */ + mp_size = ntfs_get_size_for_mapping_pairs(vol, rl, 0, INT_MAX); + if (mp_size < 0) { + err = errno; + ntfs_log_debug("Eeek! Failed to get size for mapping pairs array. " + "Aborting...\n"); + goto cluster_free_err_out; + } + /* Calculate new offsets for the name and the mapping pairs array. */ + if (na->ni->flags & FILE_ATTR_COMPRESSED) + name_ofs = (sizeof(ATTR_REC) + 7) & ~7; + else + name_ofs = (sizeof(ATTR_REC) - sizeof(a->compressed_size) + 7) & ~7; + mp_ofs = (name_ofs + a->name_length * sizeof(ntfschar) + 7) & ~7; + /* + * Determine the size of the resident part of the non-resident + * attribute record. (Not compressed thus no compressed_size element + * present.) + */ + arec_size = (mp_ofs + mp_size + 7) & ~7; + + /* Resize the resident part of the attribute record. */ + if (ntfs_attr_record_resize(ctx->mrec, a, arec_size) < 0) { + err = errno; + goto cluster_free_err_out; + } + + /* + * Convert the resident part of the attribute record to describe a + * non-resident attribute. + */ + a->non_resident = 1; + + /* Move the attribute name if it exists and update the offset. */ + if (a->name_length) + memmove((u8*)a + name_ofs, (u8*)a + le16_to_cpu(a->name_offset), + a->name_length * sizeof(ntfschar)); + a->name_offset = cpu_to_le16(name_ofs); + + /* Setup the fields specific to non-resident attributes. */ + a->lowest_vcn = cpu_to_sle64(0); + a->highest_vcn = cpu_to_sle64((new_allocated_size - 1) >> + vol->cluster_size_bits); + + a->mapping_pairs_offset = cpu_to_le16(mp_ofs); + + /* + * Update the flags to match the in-memory ones. + * However cannot change the compression state if we had + * a fuse_file_info open with a mark for release. + * The decisions about compression can only be made when + * creating/recreating the stream, not when making non resident. + */ + a->flags &= ~(ATTR_IS_SPARSE | ATTR_IS_ENCRYPTED); + if ((a->flags & ATTR_COMPRESSION_MASK) == ATTR_IS_COMPRESSED) { + /* support only ATTR_IS_COMPRESSED compression mode */ + a->compression_unit = STANDARD_COMPRESSION_UNIT; + a->compressed_size = const_cpu_to_le64(0); + } else { + a->compression_unit = 0; + a->flags &= ~ATTR_COMPRESSION_MASK; + na->data_flags = a->flags; + } + + memset(&a->reserved1, 0, sizeof(a->reserved1)); + + a->allocated_size = cpu_to_sle64(new_allocated_size); + a->data_size = a->initialized_size = cpu_to_sle64(na->data_size); + + /* Generate the mapping pairs array in the attribute record. */ + if (ntfs_mapping_pairs_build(vol, (u8*)a + mp_ofs, arec_size - mp_ofs, + rl, 0, NULL) < 0) { + // FIXME: Eeek! We need rollback! (AIA) + ntfs_log_trace("Eeek! Failed to build mapping pairs. Leaving " + "corrupt attribute record on disk. In memory " + "runlist is still intact! Error code is %i. " + "FIXME: Need to rollback instead!\n", errno); + return -1; + } + + /* Done! */ + return 0; + +cluster_free_err_out: + if (rl && ntfs_cluster_free(vol, na, 0, -1) < 0) + ntfs_log_trace("Eeek! Failed to release allocated clusters in error " + "code path. Leaving inconsistent metadata...\n"); + NAttrClearNonResident(na); + na->allocated_size = na->data_size; + na->rl = NULL; + free(rl); + errno = err; + return -1; +} + + +static int ntfs_resident_attr_resize(ntfs_attr *na, const s64 newsize); + +/** + * ntfs_resident_attr_resize - resize a resident, open ntfs attribute + * @na: resident ntfs attribute to resize + * @newsize: new size (in bytes) to which to resize the attribute + * + * Change the size of a resident, open ntfs attribute @na to @newsize bytes. + * Can also be used to force an attribute non-resident. In this case, the + * size cannot be changed. + * + * On success return 0 + * On error return values are: + * STATUS_RESIDENT_ATTRIBUTE_FILLED_MFT + * STATUS_ERROR - otherwise + * The following error codes are defined: + * ENOMEM - Not enough memory to complete operation. + * ERANGE - @newsize is not valid for the attribute type of @na. + * ENOSPC - There is no enough space in base mft to resize $ATTRIBUTE_LIST. + */ +static int ntfs_resident_attr_resize_i(ntfs_attr *na, const s64 newsize, + BOOL force_non_resident) +{ + ntfs_attr_search_ctx *ctx; + ntfs_volume *vol; + ntfs_inode *ni; + int err, ret = STATUS_ERROR; + + ntfs_log_trace("Inode 0x%llx attr 0x%x new size %lld\n", + (unsigned long long)na->ni->mft_no, na->type, + (long long)newsize); + + /* Get the attribute record that needs modification. */ + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + return -1; + if (ntfs_attr_lookup(na->type, na->name, na->name_len, 0, 0, NULL, 0, + ctx)) { + err = errno; + ntfs_log_perror("ntfs_attr_lookup failed"); + goto put_err_out; + } + vol = na->ni->vol; + /* + * Check the attribute type and the corresponding minimum and maximum + * sizes against @newsize and fail if @newsize is out of bounds. + */ + if (ntfs_attr_size_bounds_check(vol, na->type, newsize) < 0) { + err = errno; + if (err == ENOENT) + err = EIO; + ntfs_log_perror("%s: bounds check failed", __FUNCTION__); + goto put_err_out; + } + /* + * If @newsize is bigger than the mft record we need to make the + * attribute non-resident if the attribute type supports it. If it is + * smaller we can go ahead and attempt the resize. + */ + if ((newsize < vol->mft_record_size) && !force_non_resident) { + /* Perform the resize of the attribute record. */ + if (!(ret = ntfs_resident_attr_value_resize(ctx->mrec, ctx->attr, + newsize))) { + /* Update attribute size everywhere. */ + na->data_size = na->initialized_size = newsize; + na->allocated_size = (newsize + 7) & ~7; + if ((na->data_flags & ATTR_COMPRESSION_MASK) + || NAttrSparse(na)) + na->compressed_size = na->allocated_size; + if (na->ni->mrec->flags & MFT_RECORD_IS_DIRECTORY + ? na->type == AT_INDEX_ROOT && na->name == NTFS_INDEX_I30 + : na->type == AT_DATA && na->name == AT_UNNAMED) { + na->ni->data_size = na->data_size; + if (((na->data_flags & ATTR_COMPRESSION_MASK) + || NAttrSparse(na)) + && NAttrNonResident(na)) + na->ni->allocated_size + = na->compressed_size; + else + na->ni->allocated_size + = na->allocated_size; + set_nino_flag(na->ni,KnownSize); + if (na->type == AT_DATA) + NInoFileNameSetDirty(na->ni); + } + goto resize_done; + } + /* Prefer AT_INDEX_ALLOCATION instead of AT_ATTRIBUTE_LIST */ + if (ret == STATUS_RESIDENT_ATTRIBUTE_FILLED_MFT) { + err = errno; + goto put_err_out; + } + } + /* There is not enough space in the mft record to perform the resize. */ + + /* Make the attribute non-resident if possible. */ + if (!ntfs_attr_make_non_resident(na, ctx)) { + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_put_search_ctx(ctx); + /* + * do not truncate when forcing non-resident, this + * could cause the attribute to be made resident again, + * so size changes are not allowed. + */ + if (force_non_resident) { + ret = 0; + if (newsize != na->data_size) { + ntfs_log_error("Cannot change size when" + " forcing non-resident\n"); + errno = EIO; + ret = STATUS_ERROR; + } + return (ret); + } + /* Resize non-resident attribute */ + return ntfs_attr_truncate(na, newsize); + } else if (errno != ENOSPC && errno != EPERM) { + err = errno; + ntfs_log_perror("Failed to make attribute non-resident"); + goto put_err_out; + } + + /* Try to make other attributes non-resident and retry each time. */ + ntfs_attr_init_search_ctx(ctx, NULL, na->ni->mrec); + while (!ntfs_attr_lookup(AT_UNUSED, NULL, 0, 0, 0, NULL, 0, ctx)) { + ntfs_attr *tna; + ATTR_RECORD *a; + + a = ctx->attr; + if (a->non_resident) + continue; + + /* + * Check out whether convert is reasonable. Assume that mapping + * pairs will take 8 bytes. + */ + if (le32_to_cpu(a->length) <= offsetof(ATTR_RECORD, + compressed_size) + ((a->name_length * + sizeof(ntfschar) + 7) & ~7) + 8) + continue; + + tna = ntfs_attr_open(na->ni, a->type, (ntfschar*)((u8*)a + + le16_to_cpu(a->name_offset)), a->name_length); + if (!tna) { + err = errno; + ntfs_log_perror("Couldn't open attribute"); + goto put_err_out; + } + if (ntfs_attr_make_non_resident(tna, ctx)) { + ntfs_attr_close(tna); + continue; + } + if ((tna->type == AT_DATA) && !tna->name_len) { + /* + * If we had to make the unnamed data attribute + * non-resident, propagate its new allocated size + * to all name attributes and directory indexes + */ + tna->ni->allocated_size = tna->allocated_size; + NInoFileNameSetDirty(tna->ni); + } + if (((tna->data_flags & ATTR_COMPRESSION_MASK) + == ATTR_IS_COMPRESSED) + && ntfs_attr_pclose(tna)) { + err = errno; + ntfs_attr_close(tna); + goto put_err_out; + } + ntfs_inode_mark_dirty(tna->ni); + ntfs_attr_close(tna); + ntfs_attr_put_search_ctx(ctx); + return ntfs_resident_attr_resize_i(na, newsize, force_non_resident); + } + /* Check whether error occurred. */ + if (errno != ENOENT) { + err = errno; + ntfs_log_perror("%s: Attribute lookup failed 1", __FUNCTION__); + goto put_err_out; + } + + /* + * The standard information and attribute list attributes can't be + * moved out from the base MFT record, so try to move out others. + */ + if (na->type==AT_STANDARD_INFORMATION || na->type==AT_ATTRIBUTE_LIST) { + ntfs_attr_put_search_ctx(ctx); + if (ntfs_inode_free_space(na->ni, offsetof(ATTR_RECORD, + non_resident_end) + 8)) { + ntfs_log_perror("Could not free space in MFT record"); + return -1; + } + return ntfs_resident_attr_resize_i(na, newsize, force_non_resident); + } + + /* + * Move the attribute to a new mft record, creating an attribute list + * attribute or modifying it if it is already present. + */ + + /* Point search context back to attribute which we need resize. */ + ntfs_attr_init_search_ctx(ctx, na->ni, NULL); + if (ntfs_attr_lookup(na->type, na->name, na->name_len, CASE_SENSITIVE, + 0, NULL, 0, ctx)) { + ntfs_log_perror("%s: Attribute lookup failed 2", __FUNCTION__); + err = errno; + goto put_err_out; + } + + /* + * Check whether attribute is already single in this MFT record. + * 8 added for the attribute terminator. + */ + if (le32_to_cpu(ctx->mrec->bytes_in_use) == + le16_to_cpu(ctx->mrec->attrs_offset) + + le32_to_cpu(ctx->attr->length) + 8) { + err = ENOSPC; + ntfs_log_trace("MFT record is filled with one attribute\n"); + ret = STATUS_RESIDENT_ATTRIBUTE_FILLED_MFT; + goto put_err_out; + } + + /* Add attribute list if not present. */ + if (na->ni->nr_extents == -1) + ni = na->ni->base_ni; + else + ni = na->ni; + if (!NInoAttrList(ni)) { + ntfs_attr_put_search_ctx(ctx); + if (ntfs_inode_add_attrlist(ni)) + return -1; + return ntfs_resident_attr_resize_i(na, newsize, force_non_resident); + } + /* Allocate new mft record. */ + ni = ntfs_mft_record_alloc(vol, ni); + if (!ni) { + err = errno; + ntfs_log_perror("Couldn't allocate new MFT record"); + goto put_err_out; + } + /* Move attribute to it. */ + if (ntfs_attr_record_move_to(ctx, ni)) { + err = errno; + ntfs_log_perror("Couldn't move attribute to new MFT record"); + goto put_err_out; + } + /* Update ntfs attribute. */ + if (na->ni->nr_extents == -1) + na->ni = ni; + + ntfs_attr_put_search_ctx(ctx); + /* Try to perform resize once again. */ + return ntfs_resident_attr_resize_i(na, newsize, force_non_resident); + +resize_done: + /* + * Set the inode (and its base inode if it exists) dirty so it is + * written out later. + */ + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_put_search_ctx(ctx); + return 0; +put_err_out: + ntfs_attr_put_search_ctx(ctx); + errno = err; + return ret; +} + +static int ntfs_resident_attr_resize(ntfs_attr *na, const s64 newsize) +{ + int ret; + + ntfs_log_enter("Entering\n"); + ret = ntfs_resident_attr_resize_i(na, newsize, FALSE); + ntfs_log_leave("\n"); + return ret; +} + +/* + * Force an attribute to be made non-resident without + * changing its size. + * + * This is particularly needed when the attribute has no data, + * as the non-resident variant requires more space in the MFT + * record, and may imply expelling some other attribute. + * + * As a consequence the existing ntfs_attr_search_ctx's have to + * be closed or reinitialized. + * + * returns 0 if successful, + * < 0 if failed, with errno telling why + */ + +int ntfs_attr_force_non_resident(ntfs_attr *na) +{ + int res; + + res = ntfs_resident_attr_resize_i(na, na->data_size, TRUE); + if (!res && !NAttrNonResident(na)) { + res = -1; + errno = EIO; + ntfs_log_error("Failed to force non-resident\n"); + } + return (res); +} + +/** + * ntfs_attr_make_resident - convert a non-resident to a resident attribute + * @na: open ntfs attribute to make resident + * @ctx: ntfs search context describing the attribute + * + * Convert a non-resident ntfs attribute to a resident one. + * + * Return 0 on success and -1 on error with errno set to the error code. The + * following error codes are defined: + * EINVAL - Invalid arguments passed. + * EPERM - The attribute is not allowed to be resident. + * EIO - I/O error, damaged inode or bug. + * ENOSPC - There is no enough space to perform conversion. + * EOPNOTSUPP - Requested conversion is not supported yet. + * + * Warning: We do not set the inode dirty and we do not write out anything! + * We expect the caller to do this as this is a fairly low level + * function and it is likely there will be further changes made. + */ +static int ntfs_attr_make_resident(ntfs_attr *na, ntfs_attr_search_ctx *ctx) +{ + ntfs_volume *vol = na->ni->vol; + ATTR_REC *a = ctx->attr; + int name_ofs, val_ofs, err = EIO; + s64 arec_size, bytes_read; + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x.\n", (unsigned long + long)na->ni->mft_no, na->type); + + /* Should be called for the first extent of the attribute. */ + if (sle64_to_cpu(a->lowest_vcn)) { + ntfs_log_trace("Eeek! Should be called for the first extent of the " + "attribute. Aborting...\n"); + errno = EINVAL; + return -1; + } + + /* Some preliminary sanity checking. */ + if (!NAttrNonResident(na)) { + ntfs_log_trace("Eeek! Trying to make resident attribute resident. " + "Aborting...\n"); + errno = EINVAL; + return -1; + } + + /* Make sure this is not $MFT/$BITMAP or Windows will not boot! */ + if (na->type == AT_BITMAP && na->ni->mft_no == FILE_MFT) { + errno = EPERM; + return -1; + } + + /* Check that the attribute is allowed to be resident. */ + if (ntfs_attr_can_be_resident(vol, na->type)) + return -1; + + if (na->data_flags & ATTR_IS_ENCRYPTED) { + ntfs_log_trace("Making encrypted streams resident is not " + "implemented yet.\n"); + errno = EOPNOTSUPP; + return -1; + } + + /* Work out offsets into and size of the resident attribute. */ + name_ofs = 24; /* = sizeof(resident_ATTR_REC); */ + val_ofs = (name_ofs + a->name_length * sizeof(ntfschar) + 7) & ~7; + arec_size = (val_ofs + na->data_size + 7) & ~7; + + /* Sanity check the size before we start modifying the attribute. */ + if (le32_to_cpu(ctx->mrec->bytes_in_use) - le32_to_cpu(a->length) + + arec_size > le32_to_cpu(ctx->mrec->bytes_allocated)) { + errno = ENOSPC; + ntfs_log_trace("Not enough space to make attribute resident\n"); + return -1; + } + + /* Read and cache the whole runlist if not already done. */ + if (ntfs_attr_map_whole_runlist(na)) + return -1; + + /* Move the attribute name if it exists and update the offset. */ + if (a->name_length) { + memmove((u8*)a + name_ofs, (u8*)a + le16_to_cpu(a->name_offset), + a->name_length * sizeof(ntfschar)); + } + a->name_offset = cpu_to_le16(name_ofs); + + /* Resize the resident part of the attribute record. */ + if (ntfs_attr_record_resize(ctx->mrec, a, arec_size) < 0) { + /* + * Bug, because ntfs_attr_record_resize should not fail (we + * already checked that attribute fits MFT record). + */ + ntfs_log_error("BUG! Failed to resize attribute record. " + "Please report to the %s. Aborting...\n", + NTFS_DEV_LIST); + errno = EIO; + return -1; + } + + /* Convert the attribute record to describe a resident attribute. */ + a->non_resident = 0; + a->flags = 0; + a->value_length = cpu_to_le32(na->data_size); + a->value_offset = cpu_to_le16(val_ofs); + /* + * If a data stream was wiped out, adjust the compression mode + * to current state of compression flag + */ + if (!na->data_size + && (na->type == AT_DATA) + && (na->ni->vol->major_ver >= 3) + && NVolCompression(na->ni->vol) + && (na->ni->vol->cluster_size <= MAX_COMPRESSION_CLUSTER_SIZE) + && (na->ni->flags & FILE_ATTR_COMPRESSED)) { + a->flags |= ATTR_IS_COMPRESSED; + na->data_flags = a->flags; + } + /* + * File names cannot be non-resident so we would never see this here + * but at least it serves as a reminder that there may be attributes + * for which we do need to set this flag. (AIA) + */ + if (a->type == AT_FILE_NAME) + a->resident_flags = RESIDENT_ATTR_IS_INDEXED; + else + a->resident_flags = 0; + a->reservedR = 0; + + /* Sanity fixup... Shouldn't really happen. (AIA) */ + if (na->initialized_size > na->data_size) + na->initialized_size = na->data_size; + + /* Copy data from run list to resident attribute value. */ + bytes_read = ntfs_rl_pread(vol, na->rl, 0, na->initialized_size, + (u8*)a + val_ofs); + if (bytes_read != na->initialized_size) { + if (bytes_read < 0) + err = errno; + ntfs_log_trace("Eeek! Failed to read attribute data. Leaving " + "inconstant metadata. Run chkdsk. " + "Aborting...\n"); + errno = err; + return -1; + } + + /* Clear memory in gap between initialized_size and data_size. */ + if (na->initialized_size < na->data_size) + memset((u8*)a + val_ofs + na->initialized_size, 0, + na->data_size - na->initialized_size); + + /* + * Deallocate clusters from the runlist. + * + * NOTE: We can use ntfs_cluster_free() because we have already mapped + * the whole run list and thus it doesn't matter that the attribute + * record is in a transiently corrupted state at this moment in time. + */ + if (ntfs_cluster_free(vol, na, 0, -1) < 0) { + err = errno; + ntfs_log_perror("Eeek! Failed to release allocated clusters"); + ntfs_log_trace("Ignoring error and leaving behind wasted " + "clusters.\n"); + } + + /* Throw away the now unused runlist. */ + free(na->rl); + na->rl = NULL; + + /* Update in-memory struct ntfs_attr. */ + NAttrClearNonResident(na); + NAttrClearSparse(na); + NAttrClearEncrypted(na); + na->initialized_size = na->data_size; + na->allocated_size = na->compressed_size = (na->data_size + 7) & ~7; + na->compression_block_size = 0; + na->compression_block_size_bits = na->compression_block_clusters = 0; + return 0; +} + +/* + * If we are in the first extent, then set/clean sparse bit, + * update allocated and compressed size. + */ +static int ntfs_attr_update_meta(ATTR_RECORD *a, ntfs_attr *na, MFT_RECORD *m, + hole_type holes, ntfs_attr_search_ctx *ctx) +{ + int sparse, ret = 0; + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x\n", + (unsigned long long)na->ni->mft_no, na->type); + + if (a->lowest_vcn) + goto out; + + a->allocated_size = cpu_to_sle64(na->allocated_size); + + /* Update sparse bit, unless this is an intermediate state */ + if (holes == HOLES_DELAY) + sparse = (a->flags & ATTR_IS_SPARSE) != const_cpu_to_le16(0); + else { + sparse = ntfs_rl_sparse(na->rl); + if (sparse == -1) { + errno = EIO; + goto error; + } + } + + /* Check whether attribute becomes sparse, unless check is delayed. */ + if ((holes != HOLES_DELAY) + && sparse + && !(a->flags & (ATTR_IS_SPARSE | ATTR_IS_COMPRESSED))) { + /* + * Move attribute to another mft record, if attribute is too + * small to add compressed_size field to it and we have no + * free space in the current mft record. + */ + if ((le32_to_cpu(a->length) - + le16_to_cpu(a->mapping_pairs_offset) == 8) + && !(le32_to_cpu(m->bytes_allocated) - + le32_to_cpu(m->bytes_in_use))) { + + if (!NInoAttrList(na->ni)) { + ntfs_attr_put_search_ctx(ctx); + if (ntfs_inode_add_attrlist(na->ni)) + goto leave; + goto retry; + } + if (ntfs_attr_record_move_away(ctx, 8)) { + ntfs_log_perror("Failed to move attribute"); + goto error; + } + ntfs_attr_put_search_ctx(ctx); + goto retry; + } + if (!(le32_to_cpu(a->length) - le16_to_cpu( + a->mapping_pairs_offset))) { + errno = EIO; + ntfs_log_perror("Mapping pairs space is 0"); + goto error; + } + + NAttrSetSparse(na); + a->flags |= ATTR_IS_SPARSE; + na->data_flags = a->flags; + a->compression_unit = STANDARD_COMPRESSION_UNIT; /* Windows + set it so, even if attribute is not actually compressed. */ + + memmove((u8*)a + le16_to_cpu(a->name_offset) + 8, + (u8*)a + le16_to_cpu(a->name_offset), + a->name_length * sizeof(ntfschar)); + + a->name_offset = cpu_to_le16(le16_to_cpu(a->name_offset) + 8); + + a->mapping_pairs_offset = + cpu_to_le16(le16_to_cpu(a->mapping_pairs_offset) + 8); + } + + /* Attribute no longer sparse. */ + if (!sparse && (a->flags & ATTR_IS_SPARSE) && + !(a->flags & ATTR_IS_COMPRESSED)) { + + NAttrClearSparse(na); + a->flags &= ~ATTR_IS_SPARSE; + a->compression_unit = 0; + + memmove((u8*)a + le16_to_cpu(a->name_offset) - 8, + (u8*)a + le16_to_cpu(a->name_offset), + a->name_length * sizeof(ntfschar)); + + if (le16_to_cpu(a->name_offset) >= 8) + a->name_offset = cpu_to_le16(le16_to_cpu(a->name_offset) - 8); + + a->mapping_pairs_offset = + cpu_to_le16(le16_to_cpu(a->mapping_pairs_offset) - 8); + } + + /* Update compressed size if required. */ + if (NAttrFullyMapped(na) + && (sparse || (na->data_flags & ATTR_COMPRESSION_MASK))) { + s64 new_compr_size; + + new_compr_size = ntfs_rl_get_compressed_size(na->ni->vol, na->rl); + if (new_compr_size == -1) + goto error; + + na->compressed_size = new_compr_size; + a->compressed_size = cpu_to_sle64(new_compr_size); + } + /* + * Set FILE_NAME dirty flag, to update sparse bit and + * allocated size in the index. + */ + if (na->type == AT_DATA && na->name == AT_UNNAMED) { + if (sparse || (na->data_flags & ATTR_COMPRESSION_MASK)) + na->ni->allocated_size = na->compressed_size; + else + na->ni->allocated_size = na->allocated_size; + NInoFileNameSetDirty(na->ni); + } +out: + return ret; +leave: ret = -1; goto out; /* return -1 */ +retry: ret = -2; goto out; +error: ret = -3; goto out; +} + +#define NTFS_VCN_DELETE_MARK -2 +/** + * ntfs_attr_update_mapping_pairs_i - see ntfs_attr_update_mapping_pairs + */ +static int ntfs_attr_update_mapping_pairs_i(ntfs_attr *na, VCN from_vcn, + hole_type holes) +{ + ntfs_attr_search_ctx *ctx; + ntfs_inode *ni, *base_ni; + MFT_RECORD *m; + ATTR_RECORD *a; + VCN stop_vcn; + const runlist_element *stop_rl; + int err, mp_size, cur_max_mp_size, exp_max_mp_size, ret = -1; + BOOL finished_build; + BOOL first_updated = FALSE; + +retry: + if (!na || !na->rl) { + errno = EINVAL; + ntfs_log_perror("%s: na=%p", __FUNCTION__, na); + return -1; + } + + ntfs_log_trace("Entering for inode %llu, attr 0x%x\n", + (unsigned long long)na->ni->mft_no, na->type); + + if (!NAttrNonResident(na)) { + errno = EINVAL; + ntfs_log_perror("%s: resident attribute", __FUNCTION__); + return -1; + } + +#if PARTIAL_RUNLIST_UPDATING + /* + * For a file just been made sparse, we will have + * to reformat the first extent, so be sure the + * runlist is fully mapped and fully processed. + * Same if the file was sparse and is not any more. + * Note : not needed if the full runlist is to be processed + */ + if ((holes != HOLES_DELAY) + && (!NAttrFullyMapped(na) || from_vcn) + && !(na->data_flags & ATTR_IS_COMPRESSED)) { + BOOL changed; + + if (!(na->data_flags & ATTR_IS_SPARSE)) { + int sparse; + runlist_element *xrl; + + /* + * If attribute was not sparse, we only + * have to check whether there is a hole + * in the updated region. + */ + xrl = na->rl; + if (xrl->lcn == LCN_RL_NOT_MAPPED) + xrl++; + sparse = ntfs_rl_sparse(xrl); + if (sparse < 0) { + ntfs_log_error("Could not check whether sparse\n"); + errno = EIO; + return (-1); + } + changed = sparse > 0; + } else { + /* + * If attribute was sparse, the compressed + * size has been maintained, and it gives + * and easy way to check whether the + * attribute is still sparse. + */ + changed = (((na->data_size - 1) + | (na->ni->vol->cluster_size - 1)) + 1) + == na->compressed_size; + } + if (changed) { + if (ntfs_attr_map_whole_runlist(na)) { + ntfs_log_error("Could not map whole for sparse change\n"); + errno = EIO; + return (-1); + } + from_vcn = 0; + } + } +#endif + if (na->ni->nr_extents == -1) + base_ni = na->ni->base_ni; + else + base_ni = na->ni; + + ctx = ntfs_attr_get_search_ctx(base_ni, NULL); + if (!ctx) + return -1; + + /* Fill attribute records with new mapping pairs. */ + stop_vcn = 0; + stop_rl = na->rl; + finished_build = FALSE; + while (!ntfs_attr_lookup(na->type, na->name, na->name_len, + CASE_SENSITIVE, from_vcn, NULL, 0, ctx)) { + a = ctx->attr; + m = ctx->mrec; + if (!a->lowest_vcn) + first_updated = TRUE; + /* + * If runlist is updating not from the beginning, then set + * @stop_vcn properly, i.e. to the lowest vcn of record that + * contain @from_vcn. Also we do not need @from_vcn anymore, + * set it to 0 to make ntfs_attr_lookup enumerate attributes. + */ + if (from_vcn) { + LCN first_lcn; + + stop_vcn = sle64_to_cpu(a->lowest_vcn); + from_vcn = 0; + /* + * Check whether the first run we need to update is + * the last run in runlist, if so, then deallocate + * all attrubute extents starting this one. + */ + first_lcn = ntfs_rl_vcn_to_lcn(na->rl, stop_vcn); + if (first_lcn == LCN_EINVAL) { + errno = EIO; + ntfs_log_perror("Bad runlist"); + goto put_err_out; + } + if (first_lcn == LCN_ENOENT || + first_lcn == LCN_RL_NOT_MAPPED) + finished_build = TRUE; + } + + /* + * Check whether we finished mapping pairs build, if so mark + * extent as need to delete (by setting highest vcn to + * NTFS_VCN_DELETE_MARK (-2), we shall check it later and + * delete extent) and continue search. + */ + if (finished_build) { + ntfs_log_trace("Mark attr 0x%x for delete in inode " + "%lld.\n", (unsigned)le32_to_cpu(a->type), + (long long)ctx->ntfs_ino->mft_no); + a->highest_vcn = cpu_to_sle64(NTFS_VCN_DELETE_MARK); + ntfs_inode_mark_dirty(ctx->ntfs_ino); + continue; + } + + switch (ntfs_attr_update_meta(a, na, m, holes, ctx)) { + case -1: return -1; + case -2: goto retry; + case -3: goto put_err_out; + } + + /* + * Determine maximum possible length of mapping pairs, + * if we shall *not* expand space for mapping pairs. + */ + cur_max_mp_size = le32_to_cpu(a->length) - + le16_to_cpu(a->mapping_pairs_offset); + /* + * Determine maximum possible length of mapping pairs in the + * current mft record, if we shall expand space for mapping + * pairs. + */ + exp_max_mp_size = le32_to_cpu(m->bytes_allocated) - + le32_to_cpu(m->bytes_in_use) + cur_max_mp_size; + /* Get the size for the rest of mapping pairs array. */ + mp_size = ntfs_get_size_for_mapping_pairs(na->ni->vol, stop_rl, + stop_vcn, exp_max_mp_size); + if (mp_size <= 0) { + ntfs_log_perror("%s: get MP size failed", __FUNCTION__); + goto put_err_out; + } + /* Test mapping pairs for fitting in the current mft record. */ + if (mp_size > exp_max_mp_size) { + /* + * Mapping pairs of $ATTRIBUTE_LIST attribute must fit + * in the base mft record. Try to move out other + * attributes and try again. + */ + if (na->type == AT_ATTRIBUTE_LIST) { + ntfs_attr_put_search_ctx(ctx); + if (ntfs_inode_free_space(na->ni, mp_size - + cur_max_mp_size)) { + ntfs_log_perror("Attribute list is too " + "big. Defragment the " + "volume\n"); + return -1; + } + goto retry; + } + + /* Add attribute list if it isn't present, and retry. */ + if (!NInoAttrList(base_ni)) { + ntfs_attr_put_search_ctx(ctx); + if (ntfs_inode_add_attrlist(base_ni)) { + ntfs_log_perror("Can not add attrlist"); + return -1; + } + goto retry; + } + + /* + * Set mapping pairs size to maximum possible for this + * mft record. We shall write the rest of mapping pairs + * to another MFT records. + */ + mp_size = exp_max_mp_size; + } + + /* Change space for mapping pairs if we need it. */ + if (((mp_size + 7) & ~7) != cur_max_mp_size) { + if (ntfs_attr_record_resize(m, a, + le16_to_cpu(a->mapping_pairs_offset) + + mp_size)) { + errno = EIO; + ntfs_log_perror("Failed to resize attribute"); + goto put_err_out; + } + } + + /* Update lowest vcn. */ + a->lowest_vcn = cpu_to_sle64(stop_vcn); + ntfs_inode_mark_dirty(ctx->ntfs_ino); + if ((ctx->ntfs_ino->nr_extents == -1 || + NInoAttrList(ctx->ntfs_ino)) && + ctx->attr->type != AT_ATTRIBUTE_LIST) { + ctx->al_entry->lowest_vcn = cpu_to_sle64(stop_vcn); + ntfs_attrlist_mark_dirty(ctx->ntfs_ino); + } + + /* + * Generate the new mapping pairs array directly into the + * correct destination, i.e. the attribute record itself. + */ + if (!ntfs_mapping_pairs_build(na->ni->vol, (u8*)a + le16_to_cpu( + a->mapping_pairs_offset), mp_size, na->rl, + stop_vcn, &stop_rl)) + finished_build = TRUE; + if (stop_rl) + stop_vcn = stop_rl->vcn; + else + stop_vcn = 0; + if (!finished_build && errno != ENOSPC) { + ntfs_log_perror("Failed to build mapping pairs"); + goto put_err_out; + } + a->highest_vcn = cpu_to_sle64(stop_vcn - 1); + } + /* Check whether error occurred. */ + if (errno != ENOENT) { + ntfs_log_perror("%s: Attribute lookup failed", __FUNCTION__); + goto put_err_out; + } + /* + * If the base extent was skipped in the above process, + * we still may have to update the sizes. + */ + if (!first_updated) { + le16 spcomp; + + ntfs_attr_reinit_search_ctx(ctx); + if (!ntfs_attr_lookup(na->type, na->name, na->name_len, + CASE_SENSITIVE, 0, NULL, 0, ctx)) { + a = ctx->attr; + a->allocated_size = cpu_to_sle64(na->allocated_size); + spcomp = na->data_flags + & (ATTR_IS_COMPRESSED | ATTR_IS_SPARSE); + if (spcomp) + a->compressed_size = cpu_to_sle64(na->compressed_size); + if ((na->type == AT_DATA) && (na->name == AT_UNNAMED)) { + na->ni->allocated_size + = (spcomp + ? na->compressed_size + : na->allocated_size); + NInoFileNameSetDirty(na->ni); + } + } else { + ntfs_log_error("Failed to update sizes in base extent\n"); + goto put_err_out; + } + } + + /* Deallocate not used attribute extents and return with success. */ + if (finished_build) { + ntfs_attr_reinit_search_ctx(ctx); + ntfs_log_trace("Deallocate marked extents.\n"); + while (!ntfs_attr_lookup(na->type, na->name, na->name_len, + CASE_SENSITIVE, 0, NULL, 0, ctx)) { + if (sle64_to_cpu(ctx->attr->highest_vcn) != + NTFS_VCN_DELETE_MARK) + continue; + /* Remove unused attribute record. */ + if (ntfs_attr_record_rm(ctx)) { + ntfs_log_perror("Could not remove unused attr"); + goto put_err_out; + } + ntfs_attr_reinit_search_ctx(ctx); + } + if (errno != ENOENT) { + ntfs_log_perror("%s: Attr lookup failed", __FUNCTION__); + goto put_err_out; + } + ntfs_log_trace("Deallocate done.\n"); + ntfs_attr_put_search_ctx(ctx); + goto ok; + } + ntfs_attr_put_search_ctx(ctx); + ctx = NULL; + + /* Allocate new MFT records for the rest of mapping pairs. */ + while (1) { + /* Calculate size of rest mapping pairs. */ + mp_size = ntfs_get_size_for_mapping_pairs(na->ni->vol, + na->rl, stop_vcn, INT_MAX); + if (mp_size <= 0) { + ntfs_log_perror("%s: get mp size failed", __FUNCTION__); + goto put_err_out; + } + /* Allocate new mft record. */ + ni = ntfs_mft_record_alloc(na->ni->vol, base_ni); + if (!ni) { + ntfs_log_perror("Could not allocate new MFT record"); + goto put_err_out; + } + m = ni->mrec; + /* + * If mapping size exceed available space, set them to + * possible maximum. + */ + cur_max_mp_size = le32_to_cpu(m->bytes_allocated) - + le32_to_cpu(m->bytes_in_use) - + (offsetof(ATTR_RECORD, compressed_size) + + (((na->data_flags & ATTR_COMPRESSION_MASK) + || NAttrSparse(na)) ? + sizeof(a->compressed_size) : 0)) - + ((sizeof(ntfschar) * na->name_len + 7) & ~7); + if (mp_size > cur_max_mp_size) + mp_size = cur_max_mp_size; + /* Add attribute extent to new record. */ + err = ntfs_non_resident_attr_record_add(ni, na->type, + na->name, na->name_len, stop_vcn, mp_size, + na->data_flags); + if (err == -1) { + err = errno; + ntfs_log_perror("Could not add attribute extent"); + if (ntfs_mft_record_free(na->ni->vol, ni)) + ntfs_log_perror("Could not free MFT record"); + errno = err; + goto put_err_out; + } + a = (ATTR_RECORD*)((u8*)m + err); + + err = ntfs_mapping_pairs_build(na->ni->vol, (u8*)a + + le16_to_cpu(a->mapping_pairs_offset), mp_size, na->rl, + stop_vcn, &stop_rl); + if (stop_rl) + stop_vcn = stop_rl->vcn; + else + stop_vcn = 0; + if (err < 0 && errno != ENOSPC) { + err = errno; + ntfs_log_perror("Failed to build MP"); + if (ntfs_mft_record_free(na->ni->vol, ni)) + ntfs_log_perror("Couldn't free MFT record"); + errno = err; + goto put_err_out; + } + a->highest_vcn = cpu_to_sle64(stop_vcn - 1); + ntfs_inode_mark_dirty(ni); + /* All mapping pairs has been written. */ + if (!err) + break; + } +ok: + ret = 0; +out: + return ret; +put_err_out: + if (ctx) + ntfs_attr_put_search_ctx(ctx); + goto out; +} +#undef NTFS_VCN_DELETE_MARK + +/** + * ntfs_attr_update_mapping_pairs - update mapping pairs for ntfs attribute + * @na: non-resident ntfs open attribute for which we need update + * @from_vcn: update runlist starting this VCN + * + * Build mapping pairs from @na->rl and write them to the disk. Also, this + * function updates sparse bit, allocated and compressed size (allocates/frees + * space for this field if required). + * + * @na->allocated_size should be set to correct value for the new runlist before + * call to this function. Vice-versa @na->compressed_size will be calculated and + * set to correct value during this function. + * + * FIXME: This function does not update sparse bit and compressed size correctly + * if called with @from_vcn != 0. + * + * FIXME: Rewrite without using NTFS_VCN_DELETE_MARK define. + * + * On success return 0 and on error return -1 with errno set to the error code. + * The following error codes are defined: + * EINVAL - Invalid arguments passed. + * ENOMEM - Not enough memory to complete operation. + * ENOSPC - There is no enough space in base mft to resize $ATTRIBUTE_LIST + * or there is no free MFT records left to allocate. + */ +int ntfs_attr_update_mapping_pairs(ntfs_attr *na, VCN from_vcn) +{ + int ret; + + ntfs_log_enter("Entering\n"); + ret = ntfs_attr_update_mapping_pairs_i(na, from_vcn, HOLES_OK); + ntfs_log_leave("\n"); + return ret; +} + +/** + * ntfs_non_resident_attr_shrink - shrink a non-resident, open ntfs attribute + * @na: non-resident ntfs attribute to shrink + * @newsize: new size (in bytes) to which to shrink the attribute + * + * Reduce the size of a non-resident, open ntfs attribute @na to @newsize bytes. + * + * On success return 0 and on error return -1 with errno set to the error code. + * The following error codes are defined: + * ENOMEM - Not enough memory to complete operation. + * ERANGE - @newsize is not valid for the attribute type of @na. + */ +static int ntfs_non_resident_attr_shrink(ntfs_attr *na, const s64 newsize) +{ + ntfs_volume *vol; + ntfs_attr_search_ctx *ctx; + VCN first_free_vcn; + s64 nr_freed_clusters; + int err; + + ntfs_log_trace("Inode 0x%llx attr 0x%x new size %lld\n", (unsigned long long) + na->ni->mft_no, na->type, (long long)newsize); + + vol = na->ni->vol; + + /* + * Check the attribute type and the corresponding minimum size + * against @newsize and fail if @newsize is too small. + */ + if (ntfs_attr_size_bounds_check(vol, na->type, newsize) < 0) { + if (errno == ERANGE) { + ntfs_log_trace("Eeek! Size bounds check failed. " + "Aborting...\n"); + } else if (errno == ENOENT) + errno = EIO; + return -1; + } + + /* The first cluster outside the new allocation. */ + if (na->data_flags & ATTR_COMPRESSION_MASK) + /* + * For compressed files we must keep full compressions blocks, + * but currently we do not decompress/recompress the last + * block to truncate the data, so we may leave more allocated + * clusters than really needed. + */ + first_free_vcn = (((newsize - 1) + | (na->compression_block_size - 1)) + 1) + >> vol->cluster_size_bits; + else + first_free_vcn = (newsize + vol->cluster_size - 1) >> + vol->cluster_size_bits; + /* + * Compare the new allocation with the old one and only deallocate + * clusters if there is a change. + */ + if ((na->allocated_size >> vol->cluster_size_bits) != first_free_vcn) { + if (ntfs_attr_map_whole_runlist(na)) { + ntfs_log_trace("Eeek! ntfs_attr_map_whole_runlist " + "failed.\n"); + return -1; + } + /* Deallocate all clusters starting with the first free one. */ + nr_freed_clusters = ntfs_cluster_free(vol, na, first_free_vcn, + -1); + if (nr_freed_clusters < 0) { + ntfs_log_trace("Eeek! Freeing of clusters failed. " + "Aborting...\n"); + return -1; + } + + /* Truncate the runlist itself. */ + if (ntfs_rl_truncate(&na->rl, first_free_vcn)) { + /* + * Failed to truncate the runlist, so just throw it + * away, it will be mapped afresh on next use. + */ + free(na->rl); + na->rl = NULL; + ntfs_log_trace("Eeek! Run list truncation failed.\n"); + return -1; + } + + /* Prepare to mapping pairs update. */ + na->allocated_size = first_free_vcn << vol->cluster_size_bits; + /* Write mapping pairs for new runlist. */ + if (ntfs_attr_update_mapping_pairs(na, 0 /*first_free_vcn*/)) { + ntfs_log_trace("Eeek! Mapping pairs update failed. " + "Leaving inconstant metadata. " + "Run chkdsk.\n"); + return -1; + } + } + + /* Get the first attribute record. */ + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + return -1; + + if (ntfs_attr_lookup(na->type, na->name, na->name_len, CASE_SENSITIVE, + 0, NULL, 0, ctx)) { + err = errno; + if (err == ENOENT) + err = EIO; + ntfs_log_trace("Eeek! Lookup of first attribute extent failed. " + "Leaving inconstant metadata.\n"); + goto put_err_out; + } + + /* Update data and initialized size. */ + na->data_size = newsize; + ctx->attr->data_size = cpu_to_sle64(newsize); + if (newsize < na->initialized_size) { + na->initialized_size = newsize; + ctx->attr->initialized_size = cpu_to_sle64(newsize); + } + /* Update data size in the index. */ + if (na->ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) { + if (na->type == AT_INDEX_ROOT && na->name == NTFS_INDEX_I30) { + na->ni->data_size = na->data_size; + na->ni->allocated_size = na->allocated_size; + set_nino_flag(na->ni,KnownSize); + } + } else { + if (na->type == AT_DATA && na->name == AT_UNNAMED) { + na->ni->data_size = na->data_size; + NInoFileNameSetDirty(na->ni); + } + } + + /* If the attribute now has zero size, make it resident. */ + if (!newsize) { + if (ntfs_attr_make_resident(na, ctx)) { + /* If couldn't make resident, just continue. */ + if (errno != EPERM) + ntfs_log_error("Failed to make attribute " + "resident. Leaving as is...\n"); + } + } + + /* Set the inode dirty so it is written out later. */ + ntfs_inode_mark_dirty(ctx->ntfs_ino); + /* Done! */ + ntfs_attr_put_search_ctx(ctx); + return 0; +put_err_out: + ntfs_attr_put_search_ctx(ctx); + errno = err; + return -1; +} + +/** + * ntfs_non_resident_attr_expand - expand a non-resident, open ntfs attribute + * @na: non-resident ntfs attribute to expand + * @newsize: new size (in bytes) to which to expand the attribute + * + * Expand the size of a non-resident, open ntfs attribute @na to @newsize bytes, + * by allocating new clusters. + * + * On success return 0 and on error return -1 with errno set to the error code. + * The following error codes are defined: + * ENOMEM - Not enough memory to complete operation. + * ERANGE - @newsize is not valid for the attribute type of @na. + * ENOSPC - There is no enough space in base mft to resize $ATTRIBUTE_LIST. + */ +static int ntfs_non_resident_attr_expand_i(ntfs_attr *na, const s64 newsize, + hole_type holes) +{ + LCN lcn_seek_from; + VCN first_free_vcn; + ntfs_volume *vol; + ntfs_attr_search_ctx *ctx; + runlist *rl, *rln; + s64 org_alloc_size; + int err; + + ntfs_log_trace("Inode %lld, attr 0x%x, new size %lld old size %lld\n", + (unsigned long long)na->ni->mft_no, na->type, + (long long)newsize, (long long)na->data_size); + + vol = na->ni->vol; + + /* + * Check the attribute type and the corresponding maximum size + * against @newsize and fail if @newsize is too big. + */ + if (ntfs_attr_size_bounds_check(vol, na->type, newsize) < 0) { + if (errno == ENOENT) + errno = EIO; + ntfs_log_perror("%s: bounds check failed", __FUNCTION__); + return -1; + } + + if (na->type == AT_DATA) + NAttrSetDataAppending(na); + /* Save for future use. */ + org_alloc_size = na->allocated_size; + /* The first cluster outside the new allocation. */ + first_free_vcn = (newsize + vol->cluster_size - 1) >> + vol->cluster_size_bits; + /* + * Compare the new allocation with the old one and only allocate + * clusters if there is a change. + */ + if ((na->allocated_size >> vol->cluster_size_bits) < first_free_vcn) { +#if PARTIAL_RUNLIST_UPDATING + s64 start_update; + + /* + * Update from the last previously allocated run, + * as we may have to expand an existing hole. + */ + start_update = na->allocated_size >> vol->cluster_size_bits; + if (start_update) + start_update--; + if (ntfs_attr_map_partial_runlist(na, start_update)) { + ntfs_log_perror("failed to map partial runlist"); + return -1; + } +#else + if (ntfs_attr_map_whole_runlist(na)) { + ntfs_log_perror("ntfs_attr_map_whole_runlist failed"); + return -1; + } +#endif + + /* + * If we extend $DATA attribute on NTFS 3+ volume, we can add + * sparse runs instead of real allocation of clusters. + */ + if ((na->type == AT_DATA) && (vol->major_ver >= 3) + && (holes != HOLES_NO)) { + rl = ntfs_malloc(0x1000); + if (!rl) + return -1; + + rl[0].vcn = (na->allocated_size >> + vol->cluster_size_bits); + rl[0].lcn = LCN_HOLE; + rl[0].length = first_free_vcn - + (na->allocated_size >> vol->cluster_size_bits); + rl[1].vcn = first_free_vcn; + rl[1].lcn = LCN_ENOENT; + rl[1].length = 0; + } else { + /* + * Determine first after last LCN of attribute. + * We will start seek clusters from this LCN to avoid + * fragmentation. If there are no valid LCNs in the + * attribute let the cluster allocator choose the + * starting LCN. + */ + lcn_seek_from = -1; + if (na->rl->length) { + /* Seek to the last run list element. */ + for (rl = na->rl; (rl + 1)->length; rl++) + ; + /* + * If the last LCN is a hole or similar seek + * back to last valid LCN. + */ + while (rl->lcn < 0 && rl != na->rl) + rl--; + /* + * Only set lcn_seek_from it the LCN is valid. + */ + if (rl->lcn >= 0) + lcn_seek_from = rl->lcn + rl->length; + } + + rl = ntfs_cluster_alloc(vol, na->allocated_size >> + vol->cluster_size_bits, first_free_vcn - + (na->allocated_size >> + vol->cluster_size_bits), lcn_seek_from, + DATA_ZONE); + if (!rl) { + ntfs_log_perror("Cluster allocation failed " + "(%lld)", + (long long)first_free_vcn - + ((long long)na->allocated_size >> + vol->cluster_size_bits)); + return -1; + } + } + + /* Append new clusters to attribute runlist. */ + rln = ntfs_runlists_merge(na->rl, rl); + if (!rln) { + /* Failed, free just allocated clusters. */ + err = errno; + ntfs_log_perror("Run list merge failed"); + ntfs_cluster_free_from_rl(vol, rl); + free(rl); + errno = err; + return -1; + } + na->rl = rln; + + /* Prepare to mapping pairs update. */ + na->allocated_size = first_free_vcn << vol->cluster_size_bits; + /* Write mapping pairs for new runlist. */ +#if PARTIAL_RUNLIST_UPDATING + if (ntfs_attr_update_mapping_pairs_i(na, start_update, holes)) { +#else + if (ntfs_attr_update_mapping_pairs(na, 0)) { +#endif + err = errno; + ntfs_log_perror("Mapping pairs update failed"); + goto rollback; + } + } + + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) { + err = errno; + if (na->allocated_size == org_alloc_size) { + errno = err; + return -1; + } else + goto rollback; + } + + if (ntfs_attr_lookup(na->type, na->name, na->name_len, CASE_SENSITIVE, + 0, NULL, 0, ctx)) { + err = errno; + ntfs_log_perror("Lookup of first attribute extent failed"); + if (err == ENOENT) + err = EIO; + if (na->allocated_size != org_alloc_size) { + ntfs_attr_put_search_ctx(ctx); + goto rollback; + } else + goto put_err_out; + } + + /* Update data size. */ + na->data_size = newsize; + ctx->attr->data_size = cpu_to_sle64(newsize); + /* Update data size in the index. */ + if (na->ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) { + if (na->type == AT_INDEX_ROOT && na->name == NTFS_INDEX_I30) { + na->ni->data_size = na->data_size; + na->ni->allocated_size = na->allocated_size; + set_nino_flag(na->ni,KnownSize); + } + } else { + if (na->type == AT_DATA && na->name == AT_UNNAMED) { + na->ni->data_size = na->data_size; + NInoFileNameSetDirty(na->ni); + } + } + /* Set the inode dirty so it is written out later. */ + ntfs_inode_mark_dirty(ctx->ntfs_ino); + /* Done! */ + ntfs_attr_put_search_ctx(ctx); + return 0; +rollback: + /* Free allocated clusters. */ + if (ntfs_cluster_free(vol, na, org_alloc_size >> + vol->cluster_size_bits, -1) < 0) { + err = EIO; + ntfs_log_perror("Leaking clusters"); + } + /* Now, truncate the runlist itself. */ + if (ntfs_rl_truncate(&na->rl, org_alloc_size >> + vol->cluster_size_bits)) { + /* + * Failed to truncate the runlist, so just throw it away, it + * will be mapped afresh on next use. + */ + free(na->rl); + na->rl = NULL; + ntfs_log_perror("Couldn't truncate runlist. Rollback failed"); + } else { + /* Prepare to mapping pairs update. */ + na->allocated_size = org_alloc_size; + /* Restore mapping pairs. */ + if (ntfs_attr_update_mapping_pairs(na, 0 /*na->allocated_size >> + vol->cluster_size_bits*/)) { + ntfs_log_perror("Failed to restore old mapping pairs"); + } + } + errno = err; + return -1; +put_err_out: + ntfs_attr_put_search_ctx(ctx); + errno = err; + return -1; +} + + +static int ntfs_non_resident_attr_expand(ntfs_attr *na, const s64 newsize, + hole_type holes) +{ + int ret; + + ntfs_log_enter("Entering\n"); + ret = ntfs_non_resident_attr_expand_i(na, newsize, holes); + ntfs_log_leave("\n"); + return ret; +} + +/** + * ntfs_attr_truncate - resize an ntfs attribute + * @na: open ntfs attribute to resize + * @newsize: new size (in bytes) to which to resize the attribute + * @holes: how to create a hole if expanding + * + * Change the size of an open ntfs attribute @na to @newsize bytes. If the + * attribute is made bigger and the attribute is resident the newly + * "allocated" space is cleared and if the attribute is non-resident the + * newly allocated space is marked as not initialised and no real allocation + * on disk is performed. + * + * On success return 0. + * On error return values are: + * STATUS_RESIDENT_ATTRIBUTE_FILLED_MFT + * STATUS_ERROR - otherwise + * The following error codes are defined: + * EINVAL - Invalid arguments were passed to the function. + * EOPNOTSUPP - The desired resize is not implemented yet. + * EACCES - Encrypted attribute. + */ +static int ntfs_attr_truncate_i(ntfs_attr *na, const s64 newsize, + hole_type holes) +{ + int ret = STATUS_ERROR; + s64 fullsize; + BOOL compressed; + + if (!na || newsize < 0 || + (na->ni->mft_no == FILE_MFT && na->type == AT_DATA)) { + ntfs_log_trace("Invalid arguments passed.\n"); + errno = EINVAL; + return STATUS_ERROR; + } + + ntfs_log_enter("Entering for inode %lld, attr 0x%x, size %lld\n", + (unsigned long long)na->ni->mft_no, na->type, + (long long)newsize); + + if (na->data_size == newsize) { + ntfs_log_trace("Size is already ok\n"); + ret = STATUS_OK; + goto out; + } + /* + * Encrypted attributes are not supported. We return access denied, + * which is what Windows NT4 does, too. + */ + if (na->data_flags & ATTR_IS_ENCRYPTED) { + errno = EACCES; + ntfs_log_trace("Cannot truncate encrypted attribute\n"); + goto out; + } + /* + * TODO: Implement making handling of compressed attributes. + * Currently we can only expand the attribute or delete it, + * and only for ATTR_IS_COMPRESSED. This is however possible + * for resident attributes when there is no open fuse context + * (important case : $INDEX_ROOT:$I30) + */ + compressed = (na->data_flags & ATTR_COMPRESSION_MASK) + != const_cpu_to_le16(0); + if (compressed + && NAttrNonResident(na) + && ((na->data_flags & ATTR_COMPRESSION_MASK) != ATTR_IS_COMPRESSED)) { + errno = EOPNOTSUPP; + ntfs_log_perror("Failed to truncate compressed attribute"); + goto out; + } + if (NAttrNonResident(na)) { + /* + * For compressed data, the last block must be fully + * allocated, and we do not know the size of compression + * block until the attribute has been made non-resident. + * Moreover we can only process a single compression + * block at a time (from where we are about to write), + * so we silently do not allocate more. + * + * Note : do not request upsizing of compressed files + * unless being able to face the consequences ! + */ + if (compressed && newsize && (newsize > na->data_size)) + fullsize = (na->initialized_size + | (na->compression_block_size - 1)) + 1; + else + fullsize = newsize; + if (fullsize > na->data_size) + ret = ntfs_non_resident_attr_expand(na, fullsize, + holes); + else + ret = ntfs_non_resident_attr_shrink(na, fullsize); + } else + ret = ntfs_resident_attr_resize(na, newsize); +out: + ntfs_log_leave("Return status %d\n", ret); + return ret; +} + +/* + * Resize an attribute, creating a hole if relevant + */ + +int ntfs_attr_truncate(ntfs_attr *na, const s64 newsize) +{ + return (ntfs_attr_truncate_i(na, newsize, HOLES_OK)); +} + +/* + * Resize an attribute, avoiding hole creation + */ + +int ntfs_attr_truncate_solid(ntfs_attr *na, const s64 newsize) +{ + return (ntfs_attr_truncate_i(na, newsize, HOLES_NO)); +} + +/* + * Stuff a hole in a compressed file + * + * An unallocated hole must be aligned on compression block size. + * If needed current block and target block are stuffed with zeroes. + * + * Returns 0 if succeeded, + * -1 if it failed (as explained in errno) + */ + +static int stuff_hole(ntfs_attr *na, const s64 pos) +{ + s64 size; + s64 begin_size; + s64 end_size; + char *buf; + int ret; + + ret = 0; + /* + * If the attribute is resident, the compression block size + * is not defined yet and we can make no decision. + * So we first try resizing to the target and if the + * attribute is still resident, we're done + */ + if (!NAttrNonResident(na)) { + ret = ntfs_resident_attr_resize(na, pos); + if (!ret && !NAttrNonResident(na)) + na->initialized_size = na->data_size = pos; + } + if (!ret && NAttrNonResident(na)) { + /* does the hole span over several compression block ? */ + if ((pos ^ na->initialized_size) + & ~(na->compression_block_size - 1)) { + begin_size = ((na->initialized_size - 1) + | (na->compression_block_size - 1)) + + 1 - na->initialized_size; + end_size = pos & (na->compression_block_size - 1); + size = (begin_size > end_size ? begin_size : end_size); + } else { + /* short stuffing in a single compression block */ + begin_size = size = pos - na->initialized_size; + end_size = 0; + } + if (size) + buf = (char*)ntfs_malloc(size); + else + buf = (char*)NULL; + if (buf || !size) { + memset(buf,0,size); + /* stuff into current block */ + if (begin_size + && (ntfs_attr_pwrite(na, + na->initialized_size, begin_size, buf) + != begin_size)) + ret = -1; + /* create an unstuffed hole */ + if (!ret + && ((na->initialized_size + end_size) < pos) + && ntfs_non_resident_attr_expand(na, + pos - end_size, HOLES_OK)) + ret = -1; + else + na->initialized_size + = na->data_size = pos - end_size; + /* stuff into the target block */ + if (!ret && end_size + && (ntfs_attr_pwrite(na, + na->initialized_size, end_size, buf) + != end_size)) + ret = -1; + if (buf) + free(buf); + } else + ret = -1; + } + /* make absolutely sure we have reached the target */ + if (!ret && (na->initialized_size != pos)) { + ntfs_log_error("Failed to stuff a compressed file" + "target %lld reached %lld\n", + (long long)pos, (long long)na->initialized_size); + errno = EIO; + ret = -1; + } + return (ret); +} + +/** + * ntfs_attr_readall - read the entire data from an ntfs attribute + * @ni: open ntfs inode in which the ntfs attribute resides + * @type: attribute type + * @name: attribute name in little endian Unicode or AT_UNNAMED or NULL + * @name_len: length of attribute @name in Unicode characters (if @name given) + * @data_size: if non-NULL then store here the data size + * + * This function will read the entire content of an ntfs attribute. + * If @name is AT_UNNAMED then look specifically for an unnamed attribute. + * If @name is NULL then the attribute could be either named or not. + * In both those cases @name_len is not used at all. + * + * On success a buffer is allocated with the content of the attribute + * and which needs to be freed when it's not needed anymore. If the + * @data_size parameter is non-NULL then the data size is set there. + * + * On error NULL is returned with errno set to the error code. + */ +void *ntfs_attr_readall(ntfs_inode *ni, const ATTR_TYPES type, + ntfschar *name, u32 name_len, s64 *data_size) +{ + ntfs_attr *na; + void *data, *ret = NULL; + s64 size; + + ntfs_log_enter("Entering\n"); + + na = ntfs_attr_open(ni, type, name, name_len); + if (!na) { + ntfs_log_perror("ntfs_attr_open failed"); + goto err_exit; + } + data = ntfs_malloc(na->data_size); + if (!data) + goto out; + + size = ntfs_attr_pread(na, 0, na->data_size, data); + if (size != na->data_size) { + ntfs_log_perror("ntfs_attr_pread failed"); + free(data); + goto out; + } + ret = data; + if (data_size) + *data_size = size; +out: + ntfs_attr_close(na); +err_exit: + ntfs_log_leave("\n"); + return ret; +} + +/* + * Read some data from a data attribute + * + * Returns the amount of data read, negative if there was an error + */ + +int ntfs_attr_data_read(ntfs_inode *ni, + ntfschar *stream_name, int stream_name_len, + char *buf, size_t size, off_t offset) +{ + ntfs_attr *na = NULL; + int res, total = 0; + + na = ntfs_attr_open(ni, AT_DATA, stream_name, stream_name_len); + if (!na) { + res = -errno; + goto exit; + } + if ((size_t)offset < (size_t)na->data_size) { + if (offset + size > (size_t)na->data_size) + size = na->data_size - offset; + while (size) { + res = ntfs_attr_pread(na, offset, size, buf + total); + if ((off_t)res < (off_t)size) + ntfs_log_perror("ntfs_attr_pread partial read " + "(%lld : %lld <> %d)", + (long long)offset, + (long long)size, res); + if (res <= 0) { + res = -errno; + goto exit; + } + size -= res; + offset += res; + total += res; + } + } + res = total; +exit: + if (na) + ntfs_attr_close(na); + return res; +} + + +/* + * Write some data into a data attribute + * + * Returns the amount of data written, negative if there was an error + */ + +int ntfs_attr_data_write(ntfs_inode *ni, + ntfschar *stream_name, int stream_name_len, + char *buf, size_t size, off_t offset) +{ + ntfs_attr *na = NULL; + int res, total = 0; + + na = ntfs_attr_open(ni, AT_DATA, stream_name, stream_name_len); + if (!na) { + res = -errno; + goto exit; + } + while (size) { + res = ntfs_attr_pwrite(na, offset, size, buf + total); + if (res < (s64)size) + ntfs_log_perror("ntfs_attr_pwrite partial write (%lld: " + "%lld <> %d)", (long long)offset, + (long long)size, res); + if (res <= 0) { + res = -errno; + goto exit; + } + size -= res; + offset += res; + total += res; + } + res = total; +exit: + if (na) + ntfs_attr_close(na); + return res; +} + + +int ntfs_attr_exist(ntfs_inode *ni, const ATTR_TYPES type, ntfschar *name, + u32 name_len) +{ + ntfs_attr_search_ctx *ctx; + int ret; + + ntfs_log_trace("Entering\n"); + + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + return 0; + + ret = ntfs_attr_lookup(type, name, name_len, CASE_SENSITIVE, 0, NULL, 0, + ctx); + + ntfs_attr_put_search_ctx(ctx); + + return !ret; +} + +int ntfs_attr_remove(ntfs_inode *ni, const ATTR_TYPES type, ntfschar *name, + u32 name_len) +{ + ntfs_attr *na; + int ret; + + ntfs_log_trace("Entering\n"); + + if (!ni) { + ntfs_log_error("%s: NULL inode pointer", __FUNCTION__); + errno = EINVAL; + return -1; + } + + na = ntfs_attr_open(ni, type, name, name_len); + if (!na) { + /* do not log removal of non-existent stream */ + if (type != AT_DATA) { + ntfs_log_perror("Failed to open attribute 0x%02x of inode " + "0x%llx", type, (unsigned long long)ni->mft_no); + } + return -1; + } + + ret = ntfs_attr_rm(na); + if (ret) + ntfs_log_perror("Failed to remove attribute 0x%02x of inode " + "0x%llx", type, (unsigned long long)ni->mft_no); + ntfs_attr_close(na); + + return ret; +} + +/* Below macros are 32-bit ready. */ +#define BCX(x) ((x) - (((x) >> 1) & 0x77777777) - \ + (((x) >> 2) & 0x33333333) - \ + (((x) >> 3) & 0x11111111)) +#define BITCOUNT(x) (((BCX(x) + (BCX(x) >> 4)) & 0x0F0F0F0F) % 255) + +static u8 *ntfs_init_lut256(void) +{ + int i; + u8 *lut; + + lut = ntfs_malloc(256); + if (lut) + for(i = 0; i < 256; i++) + *(lut + i) = 8 - BITCOUNT(i); + return lut; +} + +s64 ntfs_attr_get_free_bits(ntfs_attr *na) +{ + u8 *buf, *lut; + s64 br = 0; + s64 total = 0; + s64 nr_free = 0; + + lut = ntfs_init_lut256(); + if (!lut) + return -1; + + buf = ntfs_malloc(65536); + if (!buf) + goto out; + + while (1) { + u32 *p; + br = ntfs_attr_pread(na, total, 65536, buf); + if (br <= 0) + break; + total += br; + p = (u32 *)buf + br / 4 - 1; + for (; (u8 *)p >= buf; p--) { + nr_free += lut[ *p & 255] + + lut[(*p >> 8) & 255] + + lut[(*p >> 16) & 255] + + lut[(*p >> 24) ]; + } + switch (br % 4) { + case 3: nr_free += lut[*(buf + br - 3)]; + case 2: nr_free += lut[*(buf + br - 2)]; + case 1: nr_free += lut[*(buf + br - 1)]; + } + } + free(buf); +out: + free(lut); + if (!total || br < 0) + return -1; + return nr_free; +} diff --git a/portlibs/sources/libntfs/attrib.h b/portlibs/sources/libntfs/attrib.h new file mode 100644 index 00000000..67fb957d --- /dev/null +++ b/portlibs/sources/libntfs/attrib.h @@ -0,0 +1,394 @@ +/* + * attrib.h - Exports for attribute handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2004 Anton Altaparmakov + * Copyright (c) 2004-2005 Yura Pakhuchiy + * Copyright (c) 2006-2007 Szabolcs Szakacsits + * Copyright (c) 2010 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 + */ + +#ifndef _NTFS_ATTRIB_H +#define _NTFS_ATTRIB_H + +/* Forward declarations */ +typedef struct _ntfs_attr ntfs_attr; +typedef struct _ntfs_attr_search_ctx ntfs_attr_search_ctx; + +#include "types.h" +#include "inode.h" +#include "unistr.h" +#include "runlist.h" +#include "volume.h" +#include "debug.h" +#include "logging.h" + +extern ntfschar AT_UNNAMED[]; +extern ntfschar STREAM_SDS[]; + +/* The little endian Unicode string $TXF_DATA as a global constant. */ +extern ntfschar TXF_DATA[10]; + +/** + * enum ntfs_lcn_special_values - special return values for ntfs_*_vcn_to_lcn() + * + * Special return values for ntfs_rl_vcn_to_lcn() and ntfs_attr_vcn_to_lcn(). + * + * TODO: Describe them. + */ +typedef enum { + LCN_HOLE = -1, /* Keep this as highest value or die! */ + LCN_RL_NOT_MAPPED = -2, + LCN_ENOENT = -3, + LCN_EINVAL = -4, + LCN_EIO = -5, +} ntfs_lcn_special_values; + +typedef enum { /* ways of processing holes when expanding */ + HOLES_NO, + HOLES_OK, + HOLES_DELAY +} hole_type; + +/** + * struct ntfs_attr_search_ctx - search context used in attribute search functions + * @mrec: buffer containing mft record to search + * @attr: attribute record in @mrec where to begin/continue search + * @is_first: if true lookup_attr() begins search with @attr, else after @attr + * + * Structure must be initialized to zero before the first call to one of the + * attribute search functions. Initialize @mrec to point to the mft record to + * search, and @attr to point to the first attribute within @mrec (not necessary + * if calling the _first() functions), and set @is_first to TRUE (not necessary + * if calling the _first() functions). + * + * If @is_first is TRUE, the search begins with @attr. If @is_first is FALSE, + * the search begins after @attr. This is so that, after the first call to one + * of the search attribute functions, we can call the function again, without + * any modification of the search context, to automagically get the next + * matching attribute. + */ +struct _ntfs_attr_search_ctx { + MFT_RECORD *mrec; + ATTR_RECORD *attr; + BOOL is_first; + ntfs_inode *ntfs_ino; + ATTR_LIST_ENTRY *al_entry; + ntfs_inode *base_ntfs_ino; + MFT_RECORD *base_mrec; + ATTR_RECORD *base_attr; +}; + +extern void ntfs_attr_reinit_search_ctx(ntfs_attr_search_ctx *ctx); +extern ntfs_attr_search_ctx *ntfs_attr_get_search_ctx(ntfs_inode *ni, + MFT_RECORD *mrec); +extern void ntfs_attr_put_search_ctx(ntfs_attr_search_ctx *ctx); + +extern int ntfs_attr_lookup(const ATTR_TYPES type, const ntfschar *name, + const u32 name_len, const IGNORE_CASE_BOOL ic, + const VCN lowest_vcn, const u8 *val, const u32 val_len, + ntfs_attr_search_ctx *ctx); + +extern int ntfs_attr_position(const ATTR_TYPES type, ntfs_attr_search_ctx *ctx); + +extern ATTR_DEF *ntfs_attr_find_in_attrdef(const ntfs_volume *vol, + const ATTR_TYPES type); + +/** + * ntfs_attrs_walk - syntactic sugar for walking all attributes in an inode + * @ctx: initialised attribute search context + * + * Syntactic sugar for walking attributes in an inode. + * + * Return 0 on success and -1 on error with errno set to the error code from + * ntfs_attr_lookup(). + * + * Example: When you want to enumerate all attributes in an open ntfs inode + * @ni, you can simply do: + * + * int err; + * ntfs_attr_search_ctx *ctx = ntfs_attr_get_search_ctx(ni, NULL); + * if (!ctx) + * // Error code is in errno. Handle this case. + * while (!(err = ntfs_attrs_walk(ctx))) { + * ATTR_RECORD *attr = ctx->attr; + * // attr now contains the next attribute. Do whatever you want + * // with it and then just continue with the while loop. + * } + * if (err && errno != ENOENT) + * // Ooops. An error occurred! You should handle this case. + * // Now finished with all attributes in the inode. + */ +static __inline__ int ntfs_attrs_walk(ntfs_attr_search_ctx *ctx) +{ + return ntfs_attr_lookup(AT_UNUSED, NULL, 0, CASE_SENSITIVE, 0, + NULL, 0, ctx); +} + +/** + * struct ntfs_attr - ntfs in memory non-resident attribute structure + * @rl: if not NULL, the decompressed runlist + * @ni: base ntfs inode to which this attribute belongs + * @type: attribute type + * @name: Unicode name of the attribute + * @name_len: length of @name in Unicode characters + * @state: NTFS attribute specific flags describing this attribute + * @allocated_size: copy from the attribute record + * @data_size: copy from the attribute record + * @initialized_size: copy from the attribute record + * @compressed_size: copy from the attribute record + * @compression_block_size: size of a compression block (cb) + * @compression_block_size_bits: log2 of the size of a cb + * @compression_block_clusters: number of clusters per cb + * + * This structure exists purely to provide a mechanism of caching the runlist + * of an attribute. If you want to operate on a particular attribute extent, + * you should not be using this structure at all. If you want to work with a + * resident attribute, you should not be using this structure at all. As a + * fail-safe check make sure to test NAttrNonResident() and if it is false, you + * know you shouldn't be using this structure. + * + * If you want to work on a resident attribute or on a specific attribute + * extent, you should use ntfs_lookup_attr() to retrieve the attribute (extent) + * record, edit that, and then write back the mft record (or set the + * corresponding ntfs inode dirty for delayed write back). + * + * @rl is the decompressed runlist of the attribute described by this + * structure. Obviously this only makes sense if the attribute is not resident, + * i.e. NAttrNonResident() is true. If the runlist hasn't been decompressed yet + * @rl is NULL, so be prepared to cope with @rl == NULL. + * + * @ni is the base ntfs inode of the attribute described by this structure. + * + * @type is the attribute type (see layout.h for the definition of ATTR_TYPES), + * @name and @name_len are the little endian Unicode name and the name length + * in Unicode characters of the attribute, respectively. + * + * @state contains NTFS attribute specific flags describing this attribute + * structure. See ntfs_attr_state_bits above. + */ +struct _ntfs_attr { + runlist_element *rl; + ntfs_inode *ni; + ATTR_TYPES type; + ATTR_FLAGS data_flags; + ntfschar *name; + u32 name_len; + unsigned long state; + s64 allocated_size; + s64 data_size; + s64 initialized_size; + s64 compressed_size; + u32 compression_block_size; + u8 compression_block_size_bits; + u8 compression_block_clusters; + s8 unused_runs; /* pre-reserved entries available */ +}; + +/** + * enum ntfs_attr_state_bits - bits for the state field in the ntfs_attr + * structure + */ +typedef enum { + NA_Initialized, /* 1: structure is initialized. */ + NA_NonResident, /* 1: Attribute is not resident. */ + NA_BeingNonResident, /* 1: Attribute is being made not resident. */ + NA_FullyMapped, /* 1: Attribute has been fully mapped */ + NA_DataAppending, /* 1: Attribute is being appended to */ + NA_ComprClosing, /* 1: Compressed attribute is being closed */ +} ntfs_attr_state_bits; + +#define test_nattr_flag(na, flag) test_bit(NA_##flag, (na)->state) +#define set_nattr_flag(na, flag) set_bit(NA_##flag, (na)->state) +#define clear_nattr_flag(na, flag) clear_bit(NA_##flag, (na)->state) + +#define NAttrInitialized(na) test_nattr_flag(na, Initialized) +#define NAttrSetInitialized(na) set_nattr_flag(na, Initialized) +#define NAttrClearInitialized(na) clear_nattr_flag(na, Initialized) + +#define NAttrNonResident(na) test_nattr_flag(na, NonResident) +#define NAttrSetNonResident(na) set_nattr_flag(na, NonResident) +#define NAttrClearNonResident(na) clear_nattr_flag(na, NonResident) + +#define NAttrBeingNonResident(na) test_nattr_flag(na, BeingNonResident) +#define NAttrSetBeingNonResident(na) set_nattr_flag(na, BeingNonResident) +#define NAttrClearBeingNonResident(na) clear_nattr_flag(na, BeingNonResident) + +#define NAttrFullyMapped(na) test_nattr_flag(na, FullyMapped) +#define NAttrSetFullyMapped(na) set_nattr_flag(na, FullyMapped) +#define NAttrClearFullyMapped(na) clear_nattr_flag(na, FullyMapped) + +#define NAttrDataAppending(na) test_nattr_flag(na, DataAppending) +#define NAttrSetDataAppending(na) set_nattr_flag(na, DataAppending) +#define NAttrClearDataAppending(na) clear_nattr_flag(na, DataAppending) + +#define NAttrComprClosing(na) test_nattr_flag(na, ComprClosing) +#define NAttrSetComprClosing(na) set_nattr_flag(na, ComprClosing) +#define NAttrClearComprClosing(na) clear_nattr_flag(na, ComprClosing) + +#define GenNAttrIno(func_name, flag) \ +extern int NAttr##func_name(ntfs_attr *na); \ +extern void NAttrSet##func_name(ntfs_attr *na); \ +extern void NAttrClear##func_name(ntfs_attr *na); + +GenNAttrIno(Compressed, FILE_ATTR_COMPRESSED) +GenNAttrIno(Encrypted, FILE_ATTR_ENCRYPTED) +GenNAttrIno(Sparse, FILE_ATTR_SPARSE_FILE) +#undef GenNAttrIno + +/** + * union attr_val - Union of all known attribute values + * + * For convenience. Used in the attr structure. + */ +typedef union { + u8 _default; /* Unnamed u8 to serve as default when just using + a_val without specifying any of the below. */ + STANDARD_INFORMATION std_inf; + ATTR_LIST_ENTRY al_entry; + FILE_NAME_ATTR filename; + OBJECT_ID_ATTR obj_id; + SECURITY_DESCRIPTOR_ATTR sec_desc; + VOLUME_NAME vol_name; + VOLUME_INFORMATION vol_inf; + DATA_ATTR data; + INDEX_ROOT index_root; + INDEX_BLOCK index_blk; + BITMAP_ATTR bmp; + REPARSE_POINT reparse; + EA_INFORMATION ea_inf; + EA_ATTR ea; + PROPERTY_SET property_set; + LOGGED_UTILITY_STREAM logged_util_stream; + EFS_ATTR_HEADER efs; +} attr_val; + +extern void ntfs_attr_init(ntfs_attr *na, const BOOL non_resident, + const ATTR_FLAGS data_flags, const BOOL encrypted, + const BOOL sparse, + const s64 allocated_size, const s64 data_size, + const s64 initialized_size, const s64 compressed_size, + const u8 compression_unit); + + /* warning : in the following "name" has to be freeable */ + /* or one of constants AT_UNNAMED, NTFS_INDEX_I30 or STREAM_SDS */ +extern ntfs_attr *ntfs_attr_open(ntfs_inode *ni, const ATTR_TYPES type, + ntfschar *name, u32 name_len); +extern void ntfs_attr_close(ntfs_attr *na); + +extern s64 ntfs_attr_pread(ntfs_attr *na, const s64 pos, s64 count, + void *b); +extern s64 ntfs_attr_pwrite(ntfs_attr *na, const s64 pos, s64 count, + const void *b); +extern int ntfs_attr_pclose(ntfs_attr *na); + +extern void *ntfs_attr_readall(ntfs_inode *ni, const ATTR_TYPES type, + ntfschar *name, u32 name_len, s64 *data_size); + +extern s64 ntfs_attr_mst_pread(ntfs_attr *na, const s64 pos, + const s64 bk_cnt, const u32 bk_size, void *dst); +extern s64 ntfs_attr_mst_pwrite(ntfs_attr *na, const s64 pos, + s64 bk_cnt, const u32 bk_size, void *src); + +extern int ntfs_attr_map_runlist(ntfs_attr *na, VCN vcn); +extern int ntfs_attr_map_whole_runlist(ntfs_attr *na); + +extern LCN ntfs_attr_vcn_to_lcn(ntfs_attr *na, const VCN vcn); +extern runlist_element *ntfs_attr_find_vcn(ntfs_attr *na, const VCN vcn); + +extern int ntfs_attr_size_bounds_check(const ntfs_volume *vol, + const ATTR_TYPES type, const s64 size); +extern int ntfs_attr_can_be_resident(const ntfs_volume *vol, + const ATTR_TYPES type); +int ntfs_attr_make_non_resident(ntfs_attr *na, + ntfs_attr_search_ctx *ctx); +int ntfs_attr_force_non_resident(ntfs_attr *na); +extern int ntfs_make_room_for_attr(MFT_RECORD *m, u8 *pos, u32 size); + +extern int ntfs_resident_attr_record_add(ntfs_inode *ni, ATTR_TYPES type, + ntfschar *name, u8 name_len, u8 *val, u32 size, + ATTR_FLAGS flags); +extern int ntfs_non_resident_attr_record_add(ntfs_inode *ni, ATTR_TYPES type, + ntfschar *name, u8 name_len, VCN lowest_vcn, int dataruns_size, + ATTR_FLAGS flags); +extern int ntfs_attr_record_rm(ntfs_attr_search_ctx *ctx); + +extern int ntfs_attr_add(ntfs_inode *ni, ATTR_TYPES type, + ntfschar *name, u8 name_len, u8 *val, s64 size); +extern int ntfs_attr_set_flags(ntfs_inode *ni, ATTR_TYPES type, + ntfschar *name, u8 name_len, ATTR_FLAGS flags, ATTR_FLAGS mask); +extern int ntfs_attr_rm(ntfs_attr *na); + +extern int ntfs_attr_record_resize(MFT_RECORD *m, ATTR_RECORD *a, u32 new_size); + +extern int ntfs_resident_attr_value_resize(MFT_RECORD *m, ATTR_RECORD *a, + const u32 new_size); + +extern int ntfs_attr_record_move_to(ntfs_attr_search_ctx *ctx, ntfs_inode *ni); +extern int ntfs_attr_record_move_away(ntfs_attr_search_ctx *ctx, int extra); + +extern int ntfs_attr_update_mapping_pairs(ntfs_attr *na, VCN from_vcn); + +extern int ntfs_attr_truncate(ntfs_attr *na, const s64 newsize); +extern int ntfs_attr_truncate_solid(ntfs_attr *na, const s64 newsize); + +/** + * get_attribute_value_length - return the length of the value of an attribute + * @a: pointer to a buffer containing the attribute record + * + * Return the byte size of the attribute value of the attribute @a (as it + * would be after eventual decompression and filling in of holes if sparse). + * If we return 0, check errno. If errno is 0 the actual length was 0, + * otherwise errno describes the error. + * + * FIXME: Describe possible errnos. + */ +extern s64 ntfs_get_attribute_value_length(const ATTR_RECORD *a); + +/** + * get_attribute_value - return the attribute value of an attribute + * @vol: volume on which the attribute is present + * @a: attribute to get the value of + * @b: destination buffer for the attribute value + * + * Make a copy of the attribute value of the attribute @a into the destination + * buffer @b. Note, that the size of @b has to be at least equal to the value + * returned by get_attribute_value_length(@a). + * + * Return number of bytes copied. If this is zero check errno. If errno is 0 + * then nothing was read due to a zero-length attribute value, otherwise + * errno describes the error. + */ +extern s64 ntfs_get_attribute_value(const ntfs_volume *vol, + const ATTR_RECORD *a, u8 *b); + +extern void ntfs_attr_name_free(char **name); +extern char *ntfs_attr_name_get(const ntfschar *uname, const int uname_len); +extern int ntfs_attr_exist(ntfs_inode *ni, const ATTR_TYPES type, + ntfschar *name, u32 name_len); +extern int ntfs_attr_remove(ntfs_inode *ni, const ATTR_TYPES type, + ntfschar *name, u32 name_len); +extern s64 ntfs_attr_get_free_bits(ntfs_attr *na); +extern int ntfs_attr_data_read(ntfs_inode *ni, + ntfschar *stream_name, int stream_name_len, + char *buf, size_t size, off_t offset); +extern int ntfs_attr_data_write(ntfs_inode *ni, + ntfschar *stream_name, int stream_name_len, + char *buf, size_t size, off_t offset); + +#endif /* defined _NTFS_ATTRIB_H */ + diff --git a/portlibs/sources/libntfs/attrib_frag.c b/portlibs/sources/libntfs/attrib_frag.c new file mode 100644 index 00000000..68b886cc --- /dev/null +++ b/portlibs/sources/libntfs/attrib_frag.c @@ -0,0 +1,369 @@ +/** + * attrib.c - Attribute handling code. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2005 Anton Altaparmakov + * Copyright (c) 2002-2005 Richard Russon + * Copyright (c) 2002-2008 Szabolcs Szakacsits + * Copyright (c) 2004-2007 Yura Pakhuchiy + * Copyright (c) 2007-2009 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "compat.h" +#include "attrib.h" +#include "attrlist.h" +#include "device.h" +#include "mft.h" +#include "debug.h" +#include "mst.h" +#include "volume.h" +#include "types.h" +#include "layout.h" +#include "inode.h" +#include "runlist.h" +#include "lcnalloc.h" +#include "dir.h" +#include "compress.h" +#include "bitmap.h" +#include "logging.h" +#include "misc.h" +#include "efs.h" +#include "ntfs.h" +#include "ntfsfile_frag.h" + +static inline u8 size_to_shift(u32 size) +{ + u8 ret = 0; + while (size) + { + ret++; + size >>= 1; + } + return ret - 1; +} + +/** + * ntfs_attr_pread_i - see description at ntfs_attr_pread() + */ +static s64 ntfs_attr_getfragments_i(ntfs_attr *na, const s64 pos, s64 count, u64 offset, + _ntfs_frag_append_t append_fragment, void *callback_data) +{ + u64 b = offset; + s64 br, to_read, ofs, total, total2, max_read, max_init; + ntfs_volume *vol; + runlist_element *rl; + //u16 efs_padding_length; + + /* Sanity checking arguments is done in ntfs_attr_pread(). */ + + if ((na->data_flags & ATTR_COMPRESSION_MASK) && NAttrNonResident(na)) + { + //return -1; // no compressed files + return -31; + /* + if ((na->data_flags & ATTR_COMPRESSION_MASK) + == ATTR_IS_COMPRESSED) + return ntfs_compressed_attr_pread(na, pos, count, b); + else { + // compression mode not supported + errno = EOPNOTSUPP; + return -1; + } + */ + } + /* + * Encrypted non-resident attributes are not supported. We return + * access denied, which is what Windows NT4 does, too. + * However, allow if mounted with efs_raw option + */ + vol = na->ni->vol; + if (!vol->efs_raw && NAttrEncrypted(na) && NAttrNonResident(na)) { + errno = EACCES; + //return -1; + return -32; + } + + if (!count) + return 0; + /* + * Truncate reads beyond end of attribute, + * but round to next 512 byte boundary for encrypted + * attributes with efs_raw mount option + */ + max_read = na->data_size; + max_init = na->initialized_size; + if (na->ni->vol->efs_raw + && (na->data_flags & ATTR_IS_ENCRYPTED) + && NAttrNonResident(na)) { + if (na->data_size != na->initialized_size) { + ntfs_log_error("uninitialized encrypted file not supported\n"); + errno = EINVAL; + //return -1; + return -33; + } + max_init = max_read = ((na->data_size + 511) & ~511) + 2; + } + if (pos + count > max_read) { + if (pos >= max_read) + return 0; + count = max_read - pos; + } + /* If it is a resident attribute, get the value from the mft record. */ + if (!NAttrNonResident(na)) + { + return -34; // No resident files + /* + ntfs_attr_search_ctx *ctx; + char *val; + + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) + return -1; + if (ntfs_attr_lookup(na->type, na->name, na->name_len, 0, + 0, NULL, 0, ctx)) { +res_err_out: + ntfs_attr_put_search_ctx(ctx); + return -1; + } + val = (char*)ctx->attr + le16_to_cpu(ctx->attr->value_offset); + if (val < (char*)ctx->attr || val + + le32_to_cpu(ctx->attr->value_length) > + (char*)ctx->mrec + vol->mft_record_size) { + errno = EIO; + ntfs_log_perror("%s: Sanity check failed", __FUNCTION__); + goto res_err_out; + } + memcpy(b, val + pos, count); + ntfs_attr_put_search_ctx(ctx); + return count; + */ + } + total = total2 = 0; + /* Zero out reads beyond initialized size. */ + if (pos + count > max_init) { + if (pos >= max_init) { + //memset(b, 0, count); + return count; + } + total2 = pos + count - max_init; + count -= total2; + //memset((u8*)b + count, 0, total2); + } + /* + * for encrypted non-resident attributes with efs_raw set + * the last two bytes aren't read from disk but contain + * the number of padding bytes so original size can be + * restored + */ + if (na->ni->vol->efs_raw && + (na->data_flags & ATTR_IS_ENCRYPTED) && + ((pos + count) > max_init-2)) + { + return -35; //No encrypted files + /* + efs_padding_length = 511 - ((na->data_size - 1) & 511); + if (pos+count == max_init) { + if (count == 1) { + *((u8*)b+count-1) = (u8)(efs_padding_length >> 8); + count--; + total2++; + } else { + *(u16*)((u8*)b+count-2) = cpu_to_le16(efs_padding_length); + count -= 2; + total2 +=2; + } + } else { + *((u8*)b+count-1) = (u8)(efs_padding_length & 0xff); + count--; + total2++; + } + */ + } + + /* Find the runlist element containing the vcn. */ + rl = ntfs_attr_find_vcn(na, pos >> vol->cluster_size_bits); + if (!rl) { + /* + * If the vcn is not present it is an out of bounds read. + * However, we already truncated the read to the data_size, + * so getting this here is an error. + */ + if (errno == ENOENT) { + errno = EIO; + ntfs_log_perror("%s: Failed to find VCN #1", __FUNCTION__); + } + //return -1; + return -36; + } + /* + * Gather the requested data into the linear destination buffer. Note, + * a partial final vcn is taken care of by the @count capping of read + * length. + */ + ofs = pos - (rl->vcn << vol->cluster_size_bits); + for (; count; rl++, ofs = 0) { + if (rl->lcn == LCN_RL_NOT_MAPPED) { + rl = ntfs_attr_find_vcn(na, rl->vcn); + if (!rl) { + if (errno == ENOENT) { + errno = EIO; + ntfs_log_perror("%s: Failed to find VCN #2", + __FUNCTION__); + } + goto rl_err_out; + } + /* Needed for case when runs merged. */ + ofs = pos + total - (rl->vcn << vol->cluster_size_bits); + } + if (!rl->length) { + errno = EIO; + ntfs_log_perror("%s: Zero run length", __FUNCTION__); + goto rl_err_out; + } + if (rl->lcn < (LCN)0) { + if (rl->lcn != (LCN)LCN_HOLE) { + ntfs_log_perror("%s: Bad run (%lld)", + __FUNCTION__, + (long long)rl->lcn); + goto rl_err_out; + } + /* It is a hole, just zero the matching @b range. */ + to_read = min(count, (rl->length << + vol->cluster_size_bits) - ofs); + //memset(b, 0, to_read); + /* Update progress counters. */ + total += to_read; + count -= to_read; + b = b + to_read; + continue; + } + /* It is a real lcn, read it into @dst. */ + to_read = min(count, (rl->length << vol->cluster_size_bits) - + ofs); +retry: + ntfs_log_trace("Reading %lld bytes from vcn %lld, lcn %lld, ofs" + " %lld.\n", (long long)to_read, (long long)rl->vcn, + (long long )rl->lcn, (long long)ofs); + /* + br = ntfs_pread(vol->dev, (rl->lcn << vol->cluster_size_bits) + + ofs, to_read, b); + */ + br = to_read; + // convert to sectors unit + u32 shift = size_to_shift(na->ni->vol->sector_size); + u32 off_sec = b >> shift; + u32 sector = ((rl->lcn << vol->cluster_size_bits) + ofs) >> shift; + u32 count_sec = to_read >> shift; + int ret; + ret = append_fragment(callback_data, off_sec, sector, count_sec); + if (ret) { + if (ret < 0) return ret; + return -50; + } + /* If everything ok, update progress counters and continue. */ + if (br > 0) { + total += br; + count -= br; + b = b + br; + } + if (br == to_read) + continue; + /* If the syscall was interrupted, try again. */ + if (br == (s64)-1 && errno == EINTR) + goto retry; + if (total) + return total; + if (!br) + errno = EIO; + ntfs_log_perror("%s: ntfs_pread failed", __FUNCTION__); + //return -1; + return -38; + } + /* Finally, return the number of bytes read. */ + return total + total2; +rl_err_out: + if (total) + return total; + errno = EIO; + //return -1; + return -39; +} + + +/** + * ntfs_attr_pread - read from an attribute specified by an ntfs_attr structure + * @na: ntfs attribute to read from + * @pos: byte position in the attribute to begin reading from + * @count: number of bytes to read + * @b: output data buffer + * + * This function will read @count bytes starting at offset @pos from the ntfs + * attribute @na into the data buffer @b. + * + * On success, return the number of successfully read bytes. If this number is + * lower than @count this means that the read reached end of file or that an + * error was encountered during the read so that the read is partial. 0 means + * end of file or nothing was read (also return 0 when @count is 0). + * + * On error and nothing has been read, return -1 with errno set appropriately + * to the return code of ntfs_pread(), or to EINVAL in case of invalid + * arguments. + */ +s64 ntfs_attr_getfragments(ntfs_attr *na, const s64 pos, s64 count, u64 offset, + _ntfs_frag_append_t append_fragment, void *callback_data) +{ + s64 ret; + + if (!na || !na->ni || !na->ni->vol || !callback_data || pos < 0 || count < 0) { + errno = EINVAL; + ntfs_log_perror("%s: na=%p b=%p pos=%lld count=%lld", + __FUNCTION__, na, callback_data, (long long)pos, + (long long)count); + //return -1; + return -21; + } + + /* + ntfs_log_enter("Entering for inode %lld attr 0x%x pos %lld count " + "%lld\n", (unsigned long long)na->ni->mft_no, + na->type, (long long)pos, (long long)count); + */ + + ret = ntfs_attr_getfragments_i(na, pos, count, offset, + append_fragment, callback_data); + + //ntfs_log_leave("\n"); + return ret; +} + diff --git a/portlibs/sources/libntfs/attrlist.c b/portlibs/sources/libntfs/attrlist.c new file mode 100644 index 00000000..9c62f316 --- /dev/null +++ b/portlibs/sources/libntfs/attrlist.c @@ -0,0 +1,314 @@ +/** + * attrlist.c - Attribute list attribute handling code. Originated from the Linux-NTFS + * project. + * + * Copyright (c) 2004-2005 Anton Altaparmakov + * Copyright (c) 2004-2005 Yura Pakhuchiy + * Copyright (c) 2006 Szabolcs Szakacsits + * + * 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_STRING_H +#include <string.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "types.h" +#include "layout.h" +#include "attrib.h" +#include "attrlist.h" +#include "debug.h" +#include "unistr.h" +#include "logging.h" +#include "misc.h" + +/** + * ntfs_attrlist_need - check whether inode need attribute list + * @ni: opened ntfs inode for which perform check + * + * Check whether all are attributes belong to one MFT record, in that case + * attribute list is not needed. + * + * Return 1 if inode need attribute list, 0 if not, -1 on error with errno set + * to the error code. If function succeed errno set to 0. The following error + * codes are defined: + * EINVAL - Invalid arguments passed to function or attribute haven't got + * attribute list. + */ +int ntfs_attrlist_need(ntfs_inode *ni) +{ + ATTR_LIST_ENTRY *ale; + + if (!ni) { + ntfs_log_trace("Invalid arguments.\n"); + errno = EINVAL; + return -1; + } + + ntfs_log_trace("Entering for inode 0x%llx.\n", (long long) ni->mft_no); + + if (!NInoAttrList(ni)) { + ntfs_log_trace("Inode haven't got attribute list.\n"); + errno = EINVAL; + return -1; + } + + if (!ni->attr_list) { + ntfs_log_trace("Corrupt in-memory struct.\n"); + errno = EINVAL; + return -1; + } + + errno = 0; + ale = (ATTR_LIST_ENTRY *)ni->attr_list; + while ((u8*)ale < ni->attr_list + ni->attr_list_size) { + if (MREF_LE(ale->mft_reference) != ni->mft_no) + return 1; + ale = (ATTR_LIST_ENTRY *)((u8*)ale + le16_to_cpu(ale->length)); + } + return 0; +} + +/** + * ntfs_attrlist_entry_add - add an attribute list attribute entry + * @ni: opened ntfs inode, which contains that attribute + * @attr: attribute record to add to attribute list + * + * Return 0 on success and -1 on error with errno set to the error code. The + * following error codes are defined: + * EINVAL - Invalid arguments passed to function. + * ENOMEM - Not enough memory to allocate necessary buffers. + * EIO - I/O error occurred or damaged filesystem. + * EEXIST - Such attribute already present in attribute list. + */ +int ntfs_attrlist_entry_add(ntfs_inode *ni, ATTR_RECORD *attr) +{ + ATTR_LIST_ENTRY *ale; + MFT_REF mref; + ntfs_attr *na = NULL; + ntfs_attr_search_ctx *ctx; + u8 *new_al; + int entry_len, entry_offset, err; + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x.\n", + (long long) ni->mft_no, + (unsigned) le32_to_cpu(attr->type)); + + if (!ni || !attr) { + ntfs_log_trace("Invalid arguments.\n"); + errno = EINVAL; + return -1; + } + + mref = MK_LE_MREF(ni->mft_no, le16_to_cpu(ni->mrec->sequence_number)); + + if (ni->nr_extents == -1) + ni = ni->base_ni; + + if (!NInoAttrList(ni)) { + ntfs_log_trace("Attribute list isn't present.\n"); + errno = ENOENT; + return -1; + } + + /* Determine size and allocate memory for new attribute list. */ + entry_len = (sizeof(ATTR_LIST_ENTRY) + sizeof(ntfschar) * + attr->name_length + 7) & ~7; + new_al = ntfs_calloc(ni->attr_list_size + entry_len); + if (!new_al) + return -1; + + /* Find place for the new entry. */ + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) { + err = errno; + goto err_out; + } + if (!ntfs_attr_lookup(attr->type, (attr->name_length) ? (ntfschar*) + ((u8*)attr + le16_to_cpu(attr->name_offset)) : + AT_UNNAMED, attr->name_length, CASE_SENSITIVE, + (attr->non_resident) ? le64_to_cpu(attr->lowest_vcn) : + 0, (attr->non_resident) ? NULL : ((u8*)attr + + le16_to_cpu(attr->value_offset)), (attr->non_resident) ? + 0 : le32_to_cpu(attr->value_length), ctx)) { + /* Found some extent, check it to be before new extent. */ + if (ctx->al_entry->lowest_vcn == attr->lowest_vcn) { + err = EEXIST; + ntfs_log_trace("Such attribute already present in the " + "attribute list.\n"); + ntfs_attr_put_search_ctx(ctx); + goto err_out; + } + /* Add new entry after this extent. */ + ale = (ATTR_LIST_ENTRY*)((u8*)ctx->al_entry + + le16_to_cpu(ctx->al_entry->length)); + } else { + /* Check for real errors. */ + if (errno != ENOENT) { + err = errno; + ntfs_log_trace("Attribute lookup failed.\n"); + ntfs_attr_put_search_ctx(ctx); + goto err_out; + } + /* No previous extents found. */ + ale = ctx->al_entry; + } + /* Don't need it anymore, @ctx->al_entry points to @ni->attr_list. */ + ntfs_attr_put_search_ctx(ctx); + + /* Determine new entry offset. */ + entry_offset = ((u8 *)ale - ni->attr_list); + /* Set pointer to new entry. */ + ale = (ATTR_LIST_ENTRY *)(new_al + entry_offset); + /* Zero it to fix valgrind warning. */ + memset(ale, 0, entry_len); + /* Form new entry. */ + ale->type = attr->type; + ale->length = cpu_to_le16(entry_len); + ale->name_length = attr->name_length; + ale->name_offset = offsetof(ATTR_LIST_ENTRY, name); + if (attr->non_resident) + ale->lowest_vcn = attr->lowest_vcn; + else + ale->lowest_vcn = 0; + ale->mft_reference = mref; + ale->instance = attr->instance; + memcpy(ale->name, (u8 *)attr + le16_to_cpu(attr->name_offset), + attr->name_length * sizeof(ntfschar)); + + /* Resize $ATTRIBUTE_LIST to new length. */ + na = ntfs_attr_open(ni, AT_ATTRIBUTE_LIST, AT_UNNAMED, 0); + if (!na) { + err = errno; + ntfs_log_trace("Failed to open $ATTRIBUTE_LIST attribute.\n"); + goto err_out; + } + if (ntfs_attr_truncate(na, ni->attr_list_size + entry_len)) { + err = errno; + ntfs_log_trace("$ATTRIBUTE_LIST resize failed.\n"); + goto err_out; + } + + /* Copy entries from old attribute list to new. */ + memcpy(new_al, ni->attr_list, entry_offset); + memcpy(new_al + entry_offset + entry_len, ni->attr_list + + entry_offset, ni->attr_list_size - entry_offset); + + /* Set new runlist. */ + free(ni->attr_list); + ni->attr_list = new_al; + ni->attr_list_size = ni->attr_list_size + entry_len; + NInoAttrListSetDirty(ni); + /* Done! */ + ntfs_attr_close(na); + return 0; +err_out: + if (na) + ntfs_attr_close(na); + free(new_al); + errno = err; + return -1; +} + +/** + * ntfs_attrlist_entry_rm - remove an attribute list attribute entry + * @ctx: attribute search context describing the attribute list entry + * + * Remove the attribute list entry @ctx->al_entry from the attribute list. + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +int ntfs_attrlist_entry_rm(ntfs_attr_search_ctx *ctx) +{ + u8 *new_al; + int new_al_len; + ntfs_inode *base_ni; + ntfs_attr *na; + ATTR_LIST_ENTRY *ale; + int err; + + if (!ctx || !ctx->ntfs_ino || !ctx->al_entry) { + ntfs_log_trace("Invalid arguments.\n"); + errno = EINVAL; + return -1; + } + + if (ctx->base_ntfs_ino) + base_ni = ctx->base_ntfs_ino; + else + base_ni = ctx->ntfs_ino; + ale = ctx->al_entry; + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x, lowest_vcn %lld.\n", + (long long) ctx->ntfs_ino->mft_no, + (unsigned) le32_to_cpu(ctx->al_entry->type), + (long long) le64_to_cpu(ctx->al_entry->lowest_vcn)); + + if (!NInoAttrList(base_ni)) { + ntfs_log_trace("Attribute list isn't present.\n"); + errno = ENOENT; + return -1; + } + + /* Allocate memory for new attribute list. */ + new_al_len = base_ni->attr_list_size - le16_to_cpu(ale->length); + new_al = ntfs_calloc(new_al_len); + if (!new_al) + return -1; + + /* Reisze $ATTRIBUTE_LIST to new length. */ + na = ntfs_attr_open(base_ni, AT_ATTRIBUTE_LIST, AT_UNNAMED, 0); + if (!na) { + err = errno; + ntfs_log_trace("Failed to open $ATTRIBUTE_LIST attribute.\n"); + goto err_out; + } + if (ntfs_attr_truncate(na, new_al_len)) { + err = errno; + ntfs_log_trace("$ATTRIBUTE_LIST resize failed.\n"); + goto err_out; + } + + /* Copy entries from old attribute list to new. */ + memcpy(new_al, base_ni->attr_list, (u8*)ale - base_ni->attr_list); + memcpy(new_al + ((u8*)ale - base_ni->attr_list), (u8*)ale + le16_to_cpu( + ale->length), new_al_len - ((u8*)ale - base_ni->attr_list)); + + /* Set new runlist. */ + free(base_ni->attr_list); + base_ni->attr_list = new_al; + base_ni->attr_list_size = new_al_len; + NInoAttrListSetDirty(base_ni); + /* Done! */ + ntfs_attr_close(na); + return 0; +err_out: + if (na) + ntfs_attr_close(na); + free(new_al); + errno = err; + return -1; +} diff --git a/portlibs/sources/libntfs/attrlist.h b/portlibs/sources/libntfs/attrlist.h new file mode 100644 index 00000000..2952e48b --- /dev/null +++ b/portlibs/sources/libntfs/attrlist.h @@ -0,0 +1,51 @@ +/* + * attrlist.h - Exports for attribute list attribute handling. + * Originated from Linux-NTFS project. + * + * Copyright (c) 2004 Anton Altaparmakov + * Copyright (c) 2004 Yura Pakhuchiy + * + * 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 + */ + +#ifndef _NTFS_ATTRLIST_H +#define _NTFS_ATTRLIST_H + +#include "attrib.h" + +extern int ntfs_attrlist_need(ntfs_inode *ni); + +extern int ntfs_attrlist_entry_add(ntfs_inode *ni, ATTR_RECORD *attr); +extern int ntfs_attrlist_entry_rm(ntfs_attr_search_ctx *ctx); + +/** + * ntfs_attrlist_mark_dirty - set the attribute list dirty + * @ni: ntfs inode which base inode contain dirty attribute list + * + * Set the attribute list dirty so it is written out later (at the latest at + * ntfs_inode_close() time). + * + * This function cannot fail. + */ +static __inline__ void ntfs_attrlist_mark_dirty(ntfs_inode *ni) +{ + if (ni->nr_extents == -1) + NInoAttrListSetDirty(ni->base_ni); + else + NInoAttrListSetDirty(ni); +} + +#endif /* defined _NTFS_ATTRLIST_H */ diff --git a/portlibs/sources/libntfs/bit_ops.h b/portlibs/sources/libntfs/bit_ops.h new file mode 100644 index 00000000..762be0b3 --- /dev/null +++ b/portlibs/sources/libntfs/bit_ops.h @@ -0,0 +1,57 @@ +/* + bit_ops.h + Functions for dealing with conversion of data between types + + Copyright (c) 2006 Michael "Chishm" Chisholm + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _BIT_OPS_H +#define _BIT_OPS_H + +#include <stdint.h> + +/*----------------------------------------------------------------- +Functions to deal with little endian values stored in uint8_t arrays +-----------------------------------------------------------------*/ +static inline uint16_t u8array_to_u16 (const uint8_t* item, int offset) { + return ( item[offset] | (item[offset + 1] << 8)); +} + +static inline uint32_t u8array_to_u32 (const uint8_t* item, int offset) { + return ( item[offset] | (item[offset + 1] << 8) | (item[offset + 2] << 16) | (item[offset + 3] << 24)); +} + +static inline void u16_to_u8array (uint8_t* item, int offset, uint16_t value) { + item[offset] = (uint8_t) value; + item[offset + 1] = (uint8_t)(value >> 8); +} + +static inline void u32_to_u8array (uint8_t* item, int offset, uint32_t value) { + item[offset] = (uint8_t) value; + item[offset + 1] = (uint8_t)(value >> 8); + item[offset + 2] = (uint8_t)(value >> 16); + item[offset + 3] = (uint8_t)(value >> 24); +} + +#endif // _BIT_OPS_H diff --git a/portlibs/sources/libntfs/bitmap.c b/portlibs/sources/libntfs/bitmap.c new file mode 100644 index 00000000..65162a29 --- /dev/null +++ b/portlibs/sources/libntfs/bitmap.c @@ -0,0 +1,300 @@ +/** + * bitmap.c - Bitmap handling code. Originated from the Linux-NTFS project. + * + * Copyright (c) 2002-2006 Anton Altaparmakov + * Copyright (c) 2004-2005 Richard Russon + * Copyright (c) 2004-2008 Szabolcs Szakacsits + * + * 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "types.h" +#include "attrib.h" +#include "bitmap.h" +#include "debug.h" +#include "logging.h" +#include "misc.h" + +/** + * ntfs_bit_set - set a bit in a field of bits + * @bitmap: field of bits + * @bit: bit to set + * @new_value: value to set bit to (0 or 1) + * + * Set the bit @bit in the @bitmap to @new_value. Ignore all errors. + */ +void ntfs_bit_set(u8 *bitmap, const u64 bit, const u8 new_value) +{ + if (!bitmap || new_value > 1) + return; + if (!new_value) + bitmap[bit >> 3] &= ~(1 << (bit & 7)); + else + bitmap[bit >> 3] |= (1 << (bit & 7)); +} + +/** + * ntfs_bit_get - get value of a bit in a field of bits + * @bitmap: field of bits + * @bit: bit to get + * + * Get and return the value of the bit @bit in @bitmap (0 or 1). + * Return -1 on error. + */ +char ntfs_bit_get(const u8 *bitmap, const u64 bit) +{ + if (!bitmap) + return -1; + return (bitmap[bit >> 3] >> (bit & 7)) & 1; +} + +/** + * ntfs_bit_get_and_set - get value of a bit in a field of bits and set it + * @bitmap: field of bits + * @bit: bit to get/set + * @new_value: value to set bit to (0 or 1) + * + * Return the value of the bit @bit and set it to @new_value (0 or 1). + * Return -1 on error. + */ +char ntfs_bit_get_and_set(u8 *bitmap, const u64 bit, const u8 new_value) +{ + register u8 old_bit, shift; + + if (!bitmap || new_value > 1) + return -1; + shift = bit & 7; + old_bit = (bitmap[bit >> 3] >> shift) & 1; + if (new_value != old_bit) + bitmap[bit >> 3] ^= 1 << shift; + return old_bit; +} + +/** + * ntfs_bitmap_set_bits_in_run - set a run of bits in a bitmap to a value + * @na: attribute containing the bitmap + * @start_bit: first bit to set + * @count: number of bits to set + * @value: value to set the bits to (i.e. 0 or 1) + * + * Set @count bits starting at bit @start_bit in the bitmap described by the + * attribute @na to @value, where @value is either 0 or 1. + * + * On success return 0 and on error return -1 with errno set to the error code. + */ +static int ntfs_bitmap_set_bits_in_run(ntfs_attr *na, s64 start_bit, + s64 count, int value) +{ + s64 bufsize, br; + u8 *buf, *lastbyte_buf; + int bit, firstbyte, lastbyte, lastbyte_pos, tmp, ret = -1; + + if (!na || start_bit < 0 || count < 0) { + errno = EINVAL; + ntfs_log_perror("%s: Invalid argument (%p, %lld, %lld)", + __FUNCTION__, na, (long long)start_bit, (long long)count); + return -1; + } + + bit = start_bit & 7; + if (bit) + firstbyte = 1; + else + firstbyte = 0; + + /* Calculate the required buffer size in bytes, capping it at 8kiB. */ + bufsize = ((count - (bit ? 8 - bit : 0) + 7) >> 3) + firstbyte; + if (bufsize > 8192) + bufsize = 8192; + + buf = ntfs_malloc(bufsize); + if (!buf) + return -1; + + /* Depending on @value, zero or set all bits in the allocated buffer. */ + memset(buf, value ? 0xff : 0, bufsize); + + /* If there is a first partial byte... */ + if (bit) { + /* read it in... */ + br = ntfs_attr_pread(na, start_bit >> 3, 1, buf); + if (br != 1) { + if (br >= 0) + errno = EIO; + goto free_err_out; + } + /* and set or clear the appropriate bits in it. */ + while ((bit & 7) && count--) { + if (value) + *buf |= 1 << bit++; + else + *buf &= ~(1 << bit++); + } + /* Update @start_bit to the new position. */ + start_bit = (start_bit + 7) & ~7; + } + + /* Loop until @count reaches zero. */ + lastbyte = 0; + lastbyte_buf = NULL; + bit = count & 7; + do { + /* If there is a last partial byte... */ + if (count > 0 && bit) { + lastbyte_pos = ((count + 7) >> 3) + firstbyte; + if (!lastbyte_pos) { + // FIXME: Eeek! BUG! + ntfs_log_error("Lastbyte is zero. Leaving " + "inconsistent metadata.\n"); + errno = EIO; + goto free_err_out; + } + /* and it is in the currently loaded bitmap window... */ + if (lastbyte_pos <= bufsize) { + lastbyte_buf = buf + lastbyte_pos - 1; + + /* read the byte in... */ + br = ntfs_attr_pread(na, (start_bit + count) >> + 3, 1, lastbyte_buf); + if (br != 1) { + // FIXME: Eeek! We need rollback! (AIA) + if (br >= 0) + errno = EIO; + ntfs_log_perror("Reading of last byte " + "failed (%lld). Leaving inconsistent " + "metadata", (long long)br); + goto free_err_out; + } + /* and set/clear the appropriate bits in it. */ + while (bit && count--) { + if (value) + *lastbyte_buf |= 1 << --bit; + else + *lastbyte_buf &= ~(1 << --bit); + } + /* We don't want to come back here... */ + bit = 0; + /* We have a last byte that we have handled. */ + lastbyte = 1; + } + } + + /* Write the prepared buffer to disk. */ + tmp = (start_bit >> 3) - firstbyte; + br = ntfs_attr_pwrite(na, tmp, bufsize, buf); + if (br != bufsize) { + // FIXME: Eeek! We need rollback! (AIA) + if (br >= 0) + errno = EIO; + ntfs_log_perror("Failed to write buffer to bitmap " + "(%lld != %lld). Leaving inconsistent metadata", + (long long)br, (long long)bufsize); + goto free_err_out; + } + + /* Update counters. */ + tmp = (bufsize - firstbyte - lastbyte) << 3; + if (firstbyte) { + firstbyte = 0; + /* + * Re-set the partial first byte so a subsequent write + * of the buffer does not have stale, incorrect bits. + */ + *buf = value ? 0xff : 0; + } + start_bit += tmp; + count -= tmp; + if (bufsize > (tmp = (count + 7) >> 3)) + bufsize = tmp; + + if (lastbyte && count != 0) { + // FIXME: Eeek! BUG! + ntfs_log_error("Last buffer but count is not zero " + "(%lld). Leaving inconsistent metadata.\n", + (long long)count); + errno = EIO; + goto free_err_out; + } + } while (count > 0); + + ret = 0; + +free_err_out: + free(buf); + return ret; +} + +/** + * ntfs_bitmap_set_run - set a run of bits in a bitmap + * @na: attribute containing the bitmap + * @start_bit: first bit to set + * @count: number of bits to set + * + * Set @count bits starting at bit @start_bit in the bitmap described by the + * attribute @na. + * + * On success return 0 and on error return -1 with errno set to the error code. + */ +int ntfs_bitmap_set_run(ntfs_attr *na, s64 start_bit, s64 count) +{ + int ret; + + ntfs_log_enter("Set from bit %lld, count %lld\n", + (long long)start_bit, (long long)count); + ret = ntfs_bitmap_set_bits_in_run(na, start_bit, count, 1); + ntfs_log_leave("\n"); + return ret; +} + +/** + * ntfs_bitmap_clear_run - clear a run of bits in a bitmap + * @na: attribute containing the bitmap + * @start_bit: first bit to clear + * @count: number of bits to clear + * + * Clear @count bits starting at bit @start_bit in the bitmap described by the + * attribute @na. + * + * On success return 0 and on error return -1 with errno set to the error code. + */ +int ntfs_bitmap_clear_run(ntfs_attr *na, s64 start_bit, s64 count) +{ + int ret; + + ntfs_log_enter("Clear from bit %lld, count %lld\n", + (long long)start_bit, (long long)count); + ret = ntfs_bitmap_set_bits_in_run(na, start_bit, count, 0); + ntfs_log_leave("\n"); + return ret; +} + diff --git a/portlibs/sources/libntfs/bitmap.h b/portlibs/sources/libntfs/bitmap.h new file mode 100644 index 00000000..10b5f6c5 --- /dev/null +++ b/portlibs/sources/libntfs/bitmap.h @@ -0,0 +1,96 @@ +/* + * bitmap.h - Exports for bitmap handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2004 Anton Altaparmakov + * Copyright (c) 2004-2005 Richard Russon + * + * 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 + */ + +#ifndef _NTFS_BITMAP_H +#define _NTFS_BITMAP_H + +#include "types.h" +#include "attrib.h" + +/* + * NOTES: + * + * - Operations are 8-bit only to ensure the functions work both on little + * and big endian machines! So don't make them 32-bit ops! + * - bitmap starts at bit = 0 and ends at bit = bitmap size - 1. + * - _Caller_ has to make sure that the bit to operate on is less than the + * size of the bitmap. + */ + +extern void ntfs_bit_set(u8 *bitmap, const u64 bit, const u8 new_value); +extern char ntfs_bit_get(const u8 *bitmap, const u64 bit); +extern char ntfs_bit_get_and_set(u8 *bitmap, const u64 bit, const u8 new_value); +extern int ntfs_bitmap_set_run(ntfs_attr *na, s64 start_bit, s64 count); +extern int ntfs_bitmap_clear_run(ntfs_attr *na, s64 start_bit, s64 count); + +/** + * ntfs_bitmap_set_bit - set a bit in a bitmap + * @na: attribute containing the bitmap + * @bit: bit to set + * + * Set the @bit in the bitmap described by the attribute @na. + * + * On success return 0 and on error return -1 with errno set to the error code. + */ +static __inline__ int ntfs_bitmap_set_bit(ntfs_attr *na, s64 bit) +{ + return ntfs_bitmap_set_run(na, bit, 1); +} + +/** + * ntfs_bitmap_clear_bit - clear a bit in a bitmap + * @na: attribute containing the bitmap + * @bit: bit to clear + * + * Clear @bit in the bitmap described by the attribute @na. + * + * On success return 0 and on error return -1 with errno set to the error code. + */ +static __inline__ int ntfs_bitmap_clear_bit(ntfs_attr *na, s64 bit) +{ + return ntfs_bitmap_clear_run(na, bit, 1); +} + +/* + * rol32 - rotate a 32-bit value left + * + * @word: value to rotate + * @shift: bits to roll + */ +static __inline__ u32 ntfs_rol32(u32 word, unsigned int shift) +{ + return (word << shift) | (word >> (32 - shift)); +} + +/* + * ror32 - rotate a 32-bit value right + * + * @word: value to rotate + * @shift: bits to roll + */ +static __inline__ u32 ntfs_ror32(u32 word, unsigned int shift) +{ + return (word >> shift) | (word << (32 - shift)); +} + +#endif /* defined _NTFS_BITMAP_H */ + diff --git a/portlibs/sources/libntfs/bootsect.c b/portlibs/sources/libntfs/bootsect.c new file mode 100644 index 00000000..e9bea370 --- /dev/null +++ b/portlibs/sources/libntfs/bootsect.c @@ -0,0 +1,285 @@ +/** + * bootsect.c - Boot sector handling code. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2006 Anton Altaparmakov + * Copyright (c) 2003-2008 Szabolcs Szakacsits + * Copyright (c) 2005 Yura Pakhuchiy + * + * 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "compat.h" +#include "bootsect.h" +#include "debug.h" +#include "logging.h" + +/** + * ntfs_boot_sector_is_ntfs - check if buffer contains a valid ntfs boot sector + * @b: buffer containing putative boot sector to analyze + * @silent: if zero, output progress messages to stderr + * + * Check if the buffer @b contains a valid ntfs boot sector. The buffer @b + * must be at least 512 bytes in size. + * + * If @silent is zero, output progress messages to stderr. Otherwise, do not + * output any messages (except when configured with --enable-debug in which + * case warning/debug messages may be displayed). + * + * Return TRUE if @b contains a valid ntfs boot sector and FALSE if not. + */ +BOOL ntfs_boot_sector_is_ntfs(NTFS_BOOT_SECTOR *b) +{ + u32 i; + BOOL ret = FALSE; + + ntfs_log_debug("Beginning bootsector check.\n"); + + ntfs_log_debug("Checking OEMid, NTFS signature.\n"); + if (b->oem_id != cpu_to_le64(0x202020205346544eULL)) { /* "NTFS " */ + ntfs_log_error("NTFS signature is missing.\n"); + goto not_ntfs; + } + + ntfs_log_debug("Checking bytes per sector.\n"); + if (le16_to_cpu(b->bpb.bytes_per_sector) < 256 || + le16_to_cpu(b->bpb.bytes_per_sector) > 4096) { + ntfs_log_error("Unexpected bytes per sector value (%d).\n", + le16_to_cpu(b->bpb.bytes_per_sector)); + goto not_ntfs; + } + + ntfs_log_debug("Checking sectors per cluster.\n"); + switch (b->bpb.sectors_per_cluster) { + case 1: case 2: case 4: case 8: case 16: case 32: case 64: case 128: + break; + default: + ntfs_log_error("Unexpected sectors per cluster value (%d).\n", + b->bpb.sectors_per_cluster); + goto not_ntfs; + } + + ntfs_log_debug("Checking cluster size.\n"); + i = (u32)le16_to_cpu(b->bpb.bytes_per_sector) * + b->bpb.sectors_per_cluster; + if (i > 65536) { + ntfs_log_error("Unexpected cluster size (%d).\n", i); + goto not_ntfs; + } + + ntfs_log_debug("Checking reserved fields are zero.\n"); + if (le16_to_cpu(b->bpb.reserved_sectors) || + le16_to_cpu(b->bpb.root_entries) || + le16_to_cpu(b->bpb.sectors) || + le16_to_cpu(b->bpb.sectors_per_fat) || + le32_to_cpu(b->bpb.large_sectors) || + b->bpb.fats) { + ntfs_log_error("Reserved fields aren't zero " + "(%d, %d, %d, %d, %d, %d).\n", + le16_to_cpu(b->bpb.reserved_sectors), + le16_to_cpu(b->bpb.root_entries), + le16_to_cpu(b->bpb.sectors), + le16_to_cpu(b->bpb.sectors_per_fat), + le32_to_cpu(b->bpb.large_sectors), + b->bpb.fats); + goto not_ntfs; + } + + ntfs_log_debug("Checking clusters per mft record.\n"); + if ((u8)b->clusters_per_mft_record < 0xe1 || + (u8)b->clusters_per_mft_record > 0xf7) { + switch (b->clusters_per_mft_record) { + case 1: case 2: case 4: case 8: case 0x10: case 0x20: case 0x40: + break; + default: + ntfs_log_error("Unexpected clusters per mft record " + "(%d).\n", b->clusters_per_mft_record); + goto not_ntfs; + } + } + + ntfs_log_debug("Checking clusters per index block.\n"); + if ((u8)b->clusters_per_index_record < 0xe1 || + (u8)b->clusters_per_index_record > 0xf7) { + switch (b->clusters_per_index_record) { + case 1: case 2: case 4: case 8: case 0x10: case 0x20: case 0x40: + break; + default: + ntfs_log_error("Unexpected clusters per index record " + "(%d).\n", b->clusters_per_index_record); + goto not_ntfs; + } + } + + if (b->end_of_sector_marker != cpu_to_le16(0xaa55)) + ntfs_log_debug("Warning: Bootsector has invalid end of sector " + "marker.\n"); + + ntfs_log_debug("Bootsector check completed successfully.\n"); + + ret = TRUE; +not_ntfs: + return ret; +} + +static const char *last_sector_error = +"HINTS: Either the volume is a RAID/LDM but it wasn't setup yet,\n" +" or it was not setup correctly (e.g. by not using mdadm --build ...),\n" +" or a wrong device is tried to be mounted,\n" +" or the partition table is corrupt (partition is smaller than NTFS),\n" +" or the NTFS boot sector is corrupt (NTFS size is not valid).\n"; + +/** + * ntfs_boot_sector_parse - setup an ntfs volume from an ntfs boot sector + * @vol: ntfs_volume to setup + * @bs: buffer containing ntfs boot sector to parse + * + * Parse the ntfs bootsector @bs and setup the ntfs volume @vol with the + * obtained values. + * + * Return 0 on success or -1 on error with errno set to the error code EINVAL. + */ +int ntfs_boot_sector_parse(ntfs_volume *vol, const NTFS_BOOT_SECTOR *bs) +{ + s64 sectors; + u8 sectors_per_cluster; + s8 c; + + /* We return -1 with errno = EINVAL on error. */ + errno = EINVAL; + + vol->sector_size = le16_to_cpu(bs->bpb.bytes_per_sector); + vol->sector_size_bits = ffs(vol->sector_size) - 1; + ntfs_log_debug("SectorSize = 0x%x\n", vol->sector_size); + ntfs_log_debug("SectorSizeBits = %u\n", vol->sector_size_bits); + /* + * The bounds checks on mft_lcn and mft_mirr_lcn (i.e. them being + * below or equal the number_of_clusters) really belong in the + * ntfs_boot_sector_is_ntfs but in this way we can just do this once. + */ + sectors_per_cluster = bs->bpb.sectors_per_cluster; + ntfs_log_debug("SectorsPerCluster = 0x%x\n", sectors_per_cluster); + if (sectors_per_cluster & (sectors_per_cluster - 1)) { + ntfs_log_error("sectors_per_cluster (%d) is not a power of 2." + "\n", sectors_per_cluster); + return -1; + } + + sectors = sle64_to_cpu(bs->number_of_sectors); + ntfs_log_debug("NumberOfSectors = %lld\n", (long long)sectors); + if (!sectors) { + ntfs_log_error("Volume size is set to zero.\n"); + return -1; + } + if (vol->dev->d_ops->seek(vol->dev, + (sectors - 1) << vol->sector_size_bits, + SEEK_SET) == -1) { + ntfs_log_perror("Failed to read last sector (%lld)", + (long long)sectors); + ntfs_log_error("%s", last_sector_error); + return -1; + } + + vol->nr_clusters = sectors >> (ffs(sectors_per_cluster) - 1); + + vol->mft_lcn = sle64_to_cpu(bs->mft_lcn); + vol->mftmirr_lcn = sle64_to_cpu(bs->mftmirr_lcn); + ntfs_log_debug("MFT LCN = %lld\n", (long long)vol->mft_lcn); + ntfs_log_debug("MFTMirr LCN = %lld\n", (long long)vol->mftmirr_lcn); + if (vol->mft_lcn > vol->nr_clusters || + vol->mftmirr_lcn > vol->nr_clusters) { + ntfs_log_error("$MFT LCN (%lld) or $MFTMirr LCN (%lld) is " + "greater than the number of clusters (%lld).\n", + (long long)vol->mft_lcn, (long long)vol->mftmirr_lcn, + (long long)vol->nr_clusters); + return -1; + } + + vol->cluster_size = sectors_per_cluster * vol->sector_size; + if (vol->cluster_size & (vol->cluster_size - 1)) { + ntfs_log_error("cluster_size (%d) is not a power of 2.\n", + vol->cluster_size); + return -1; + } + vol->cluster_size_bits = ffs(vol->cluster_size) - 1; + /* + * Need to get the clusters per mft record and handle it if it is + * negative. Then calculate the mft_record_size. A value of 0x80 is + * illegal, thus signed char is actually ok! + */ + c = bs->clusters_per_mft_record; + ntfs_log_debug("ClusterSize = 0x%x\n", (unsigned)vol->cluster_size); + ntfs_log_debug("ClusterSizeBits = %u\n", vol->cluster_size_bits); + ntfs_log_debug("ClustersPerMftRecord = 0x%x\n", c); + /* + * When clusters_per_mft_record is negative, it means that it is to + * be taken to be the negative base 2 logarithm of the mft_record_size + * min bytes. Then: + * mft_record_size = 2^(-clusters_per_mft_record) bytes. + */ + if (c < 0) + vol->mft_record_size = 1 << -c; + else + vol->mft_record_size = c << vol->cluster_size_bits; + if (vol->mft_record_size & (vol->mft_record_size - 1)) { + ntfs_log_error("mft_record_size (%d) is not a power of 2.\n", + vol->mft_record_size); + return -1; + } + vol->mft_record_size_bits = ffs(vol->mft_record_size) - 1; + ntfs_log_debug("MftRecordSize = 0x%x\n", (unsigned)vol->mft_record_size); + ntfs_log_debug("MftRecordSizeBits = %u\n", vol->mft_record_size_bits); + /* Same as above for INDX record. */ + c = bs->clusters_per_index_record; + ntfs_log_debug("ClustersPerINDXRecord = 0x%x\n", c); + if (c < 0) + vol->indx_record_size = 1 << -c; + else + vol->indx_record_size = c << vol->cluster_size_bits; + vol->indx_record_size_bits = ffs(vol->indx_record_size) - 1; + ntfs_log_debug("INDXRecordSize = 0x%x\n", (unsigned)vol->indx_record_size); + ntfs_log_debug("INDXRecordSizeBits = %u\n", vol->indx_record_size_bits); + /* + * Work out the size of the MFT mirror in number of mft records. If the + * cluster size is less than or equal to the size taken by four mft + * records, the mft mirror stores the first four mft records. If the + * cluster size is bigger than the size taken by four mft records, the + * mft mirror contains as many mft records as will fit into one + * cluster. + */ + if (vol->cluster_size <= 4 * vol->mft_record_size) + vol->mftmirr_size = 4; + else + vol->mftmirr_size = vol->cluster_size / vol->mft_record_size; + return 0; +} + diff --git a/portlibs/sources/libntfs/bootsect.h b/portlibs/sources/libntfs/bootsect.h new file mode 100644 index 00000000..a299e821 --- /dev/null +++ b/portlibs/sources/libntfs/bootsect.h @@ -0,0 +1,42 @@ +/* + * bootsect.h - Exports for bootsector record handling. + * Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2002 Anton Altaparmakov + * Copyright (c) 2006 Szabolcs Szakacsits + * + * 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 + */ + +#ifndef _NTFS_BOOTSECT_H +#define _NTFS_BOOTSECT_H + +#include "types.h" +#include "volume.h" +#include "layout.h" + +/** + * ntfs_boot_sector_is_ntfs - check a boot sector for describing an ntfs volume + * @b: buffer containing the boot sector + * + * This function checks the boot sector in @b for describing a valid ntfs + * volume. Return TRUE if @b is a valid NTFS boot sector or FALSE otherwise. + */ +extern BOOL ntfs_boot_sector_is_ntfs(NTFS_BOOT_SECTOR *b); +extern int ntfs_boot_sector_parse(ntfs_volume *vol, const NTFS_BOOT_SECTOR *bs); + +#endif /* defined _NTFS_BOOTSECT_H */ + diff --git a/portlibs/sources/libntfs/cache.c b/portlibs/sources/libntfs/cache.c new file mode 100644 index 00000000..b1ae2915 --- /dev/null +++ b/portlibs/sources/libntfs/cache.c @@ -0,0 +1,609 @@ +/** + * cache.c : deal with LRU caches + * + * Copyright (c) 2008-2010 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_STRING_H +#include <string.h> +#endif + +#include "types.h" +#include "security.h" +#include "cache.h" +#include "misc.h" +#include "logging.h" + +/* + * General functions to deal with LRU caches + * + * The cached data have to be organized in a structure in which + * the first fields must follow a mandatory pattern and further + * fields may contain any fixed size data. They are stored in an + * LRU list. + * + * A compare function must be provided for finding a wanted entry + * in the cache. Another function may be provided for invalidating + * an entry to facilitate multiple invalidation. + * + * These functions never return error codes. When there is a + * shortage of memory, data is simply not cached. + * When there is a hashing bug, hashing is dropped, and sequential + * searches are used. + */ + +/* + * Enter a new hash index, after a new record has been inserted + * + * Do not call when a record has been modified (with no key change) + */ + +static void inserthashindex(struct CACHE_HEADER *cache, + struct CACHED_GENERIC *current) +{ + int h; + struct HASH_ENTRY *link; + struct HASH_ENTRY *first; + + if (cache->dohash) { + h = cache->dohash(current); + if ((h >= 0) && (h < cache->max_hash)) { + /* get a free link and insert at top of hash list */ + link = cache->free_hash; + if (link) { + cache->free_hash = link->next; + first = cache->first_hash[h]; + if (first) + link->next = first; + else + link->next = NULL; + link->entry = current; + cache->first_hash[h] = link; + } else { + ntfs_log_error("No more hash entries," + " cache %s hashing dropped\n", + cache->name); + cache->dohash = (cache_hash)NULL; + } + } else { + ntfs_log_error("Illegal hash value," + " cache %s hashing dropped\n", + cache->name); + cache->dohash = (cache_hash)NULL; + } + } +} + +/* + * Drop a hash index when a record is about to be deleted + */ + +static void drophashindex(struct CACHE_HEADER *cache, + const struct CACHED_GENERIC *current, int hash) +{ + struct HASH_ENTRY *link; + struct HASH_ENTRY *previous; + + if (cache->dohash) { + if ((hash >= 0) && (hash < cache->max_hash)) { + /* find the link and unlink */ + link = cache->first_hash[hash]; + previous = (struct HASH_ENTRY*)NULL; + while (link && (link->entry != current)) { + previous = link; + link = link->next; + } + if (link) { + if (previous) + previous->next = link->next; + else + cache->first_hash[hash] = link->next; + link->next = cache->free_hash; + cache->free_hash = link; + } else { + ntfs_log_error("Bad hash list," + " cache %s hashing dropped\n", + cache->name); + cache->dohash = (cache_hash)NULL; + } + } else { + ntfs_log_error("Illegal hash value," + " cache %s hashing dropped\n", + cache->name); + cache->dohash = (cache_hash)NULL; + } + } +} + +/* + * Fetch an entry from cache + * + * returns the cache entry, or NULL if not available + * The returned entry may be modified, but not freed + */ + +struct CACHED_GENERIC *ntfs_fetch_cache(struct CACHE_HEADER *cache, + const struct CACHED_GENERIC *wanted, cache_compare compare) +{ + struct CACHED_GENERIC *current; + struct CACHED_GENERIC *previous; + struct HASH_ENTRY *link; + int h; + + current = (struct CACHED_GENERIC*)NULL; + if (cache) { + if (cache->dohash) { + /* + * When possible, use the hash table to + * locate the entry if present + */ + h = cache->dohash(wanted); + link = cache->first_hash[h]; + while (link && compare(link->entry, wanted)) + link = link->next; + if (link) + current = link->entry; + } + if (!cache->dohash) { + /* + * Search sequentially in LRU list if no hash table + * or if hashing has just failed + */ + current = cache->most_recent_entry; + while (current + && compare(current, wanted)) { + current = current->next; + } + } + if (current) { + previous = current->previous; + cache->hits++; + if (previous) { + /* + * found and not at head of list, unlink from current + * position and relink as head of list + */ + previous->next = current->next; + if (current->next) + current->next->previous + = current->previous; + else + cache->oldest_entry + = current->previous; + current->next = cache->most_recent_entry; + current->previous + = (struct CACHED_GENERIC*)NULL; + cache->most_recent_entry->previous = current; + cache->most_recent_entry = current; + } + } + cache->reads++; + } + return (current); +} + +/* + * Enter an inode number into cache + * returns the cache entry or NULL if not possible + */ + +struct CACHED_GENERIC *ntfs_enter_cache(struct CACHE_HEADER *cache, + const struct CACHED_GENERIC *item, + cache_compare compare) +{ + struct CACHED_GENERIC *current; + struct CACHED_GENERIC *before; + struct HASH_ENTRY *link; + int h; + + current = (struct CACHED_GENERIC*)NULL; + if (cache) { + if (cache->dohash) { + /* + * When possible, use the hash table to + * find out whether the entry if present + */ + h = cache->dohash(item); + link = cache->first_hash[h]; + while (link && compare(link->entry, item)) + link = link->next; + if (link) { + current = link->entry; + } + } + if (!cache->dohash) { + /* + * Search sequentially in LRU list to locate the end, + * and find out whether the entry is already in list + * As we normally go to the end, no statistics is + * kept. + */ + current = cache->most_recent_entry; + while (current + && compare(current, item)) { + current = current->next; + } + } + + if (!current) { + /* + * Not in list, get a free entry or reuse the + * last entry, and relink as head of list + * Note : we assume at least three entries, so + * before, previous and first are different when + * an entry is reused. + */ + + if (cache->free_entry) { + current = cache->free_entry; + cache->free_entry = cache->free_entry->next; + if (item->varsize) { + current->variable = ntfs_malloc( + item->varsize); + } else + current->variable = (void*)NULL; + current->varsize = item->varsize; + if (!cache->oldest_entry) + cache->oldest_entry = current; + } else { + /* reusing the oldest entry */ + current = cache->oldest_entry; + before = current->previous; + before->next = (struct CACHED_GENERIC*)NULL; + if (cache->dohash) + drophashindex(cache,current, + cache->dohash(current)); + if (cache->dofree) + cache->dofree(current); + cache->oldest_entry = current->previous; + if (item->varsize) { + if (current->varsize) + current->variable = MEM2_realloc( + current->variable, + item->varsize); + else + current->variable = ntfs_malloc( + item->varsize); + } else { + if (current->varsize) + free(current->variable); + current->variable = (void*)NULL; + } + current->varsize = item->varsize; + } + current->next = cache->most_recent_entry; + current->previous = (struct CACHED_GENERIC*)NULL; + if (cache->most_recent_entry) + cache->most_recent_entry->previous = current; + cache->most_recent_entry = current; + memcpy(current->payload, item->payload, cache->fixed_size); + if (item->varsize) { + if (current->variable) { + memcpy(current->variable, + item->variable, item->varsize); + } else { + /* + * no more memory for variable part + * recycle entry in free list + * not an error, just uncacheable + */ + cache->most_recent_entry = current->next; + current->next = cache->free_entry; + cache->free_entry = current; + current = (struct CACHED_GENERIC*)NULL; + } + } else { + current->variable = (void*)NULL; + current->varsize = 0; + } + if (cache->dohash && current) + inserthashindex(cache,current); + } + cache->writes++; + } + return (current); +} + +/* + * Invalidate a cache entry + * The entry is moved to the free entry list + * A specific function may be called for entry deletion + */ + +static void do_invalidate(struct CACHE_HEADER *cache, + struct CACHED_GENERIC *current, int flags) +{ + struct CACHED_GENERIC *previous; + + previous = current->previous; + if ((flags & CACHE_FREE) && cache->dofree) + cache->dofree(current); + /* + * Relink into free list + */ + if (current->next) + current->next->previous = current->previous; + else + cache->oldest_entry = current->previous; + if (previous) + previous->next = current->next; + else + cache->most_recent_entry = current->next; + current->next = cache->free_entry; + cache->free_entry = current; + if (current->variable) + free(current->variable); + current->varsize = 0; + } + + +/* + * Invalidate entries in cache + * + * Several entries may have to be invalidated (at least for inodes + * associated to directories which have been renamed), a different + * compare function may be provided to select entries to invalidate + * + * Returns the number of deleted entries, this can be used by + * the caller to signal a cache corruption if the entry was + * supposed to be found. + */ + +int ntfs_invalidate_cache(struct CACHE_HEADER *cache, + const struct CACHED_GENERIC *item, cache_compare compare, + int flags) +{ + struct CACHED_GENERIC *current; + struct CACHED_GENERIC *previous; + struct CACHED_GENERIC *next; + struct HASH_ENTRY *link; + int count; + int h; + + current = (struct CACHED_GENERIC*)NULL; + count = 0; + if (cache) { + if (!(flags & CACHE_NOHASH) && cache->dohash) { + /* + * When possible, use the hash table to + * find out whether the entry if present + */ + h = cache->dohash(item); + link = cache->first_hash[h]; + while (link) { + if (compare(link->entry, item)) + link = link->next; + else { + current = link->entry; + link = link->next; + if (current) { + drophashindex(cache,current,h); + do_invalidate(cache, + current,flags); + count++; + } + } + } + } + if ((flags & CACHE_NOHASH) || !cache->dohash) { + /* + * Search sequentially in LRU list + */ + current = cache->most_recent_entry; + previous = (struct CACHED_GENERIC*)NULL; + while (current) { + if (!compare(current, item)) { + next = current->next; + if (cache->dohash) + drophashindex(cache,current, + cache->dohash(current)); + do_invalidate(cache,current,flags); + current = next; + count++; + } else { + previous = current; + current = current->next; + } + } + } + } + return (count); +} + +int ntfs_remove_cache(struct CACHE_HEADER *cache, + struct CACHED_GENERIC *item, int flags) +{ + int count; + + count = 0; + if (cache) { + if (cache->dohash) + drophashindex(cache,item,cache->dohash(item)); + do_invalidate(cache,item,flags); + count++; + } + return (count); +} + +/* + * Free memory allocated to a cache + */ + +static void ntfs_free_cache(struct CACHE_HEADER *cache) +{ + struct CACHED_GENERIC *entry; + + if (cache) { + for (entry=cache->most_recent_entry; entry; entry=entry->next) { + if (cache->dofree) + cache->dofree(entry); + if (entry->variable) + free(entry->variable); + } + free(cache); + } +} + +/* + * Create a cache + * + * Returns the cache header, or NULL if the cache could not be created + */ + +static struct CACHE_HEADER *ntfs_create_cache(const char *name, + cache_free dofree, cache_hash dohash, + int full_item_size, + int item_count, int max_hash) +{ + struct CACHE_HEADER *cache; + struct CACHED_GENERIC *pc; + struct CACHED_GENERIC *qc; + struct HASH_ENTRY *ph; + struct HASH_ENTRY *qh; + struct HASH_ENTRY **px; + size_t size; + int i; + + size = sizeof(struct CACHE_HEADER) + item_count*full_item_size; + if (max_hash) + size += item_count*sizeof(struct HASH_ENTRY) + + max_hash*sizeof(struct HASH_ENTRY*); + cache = (struct CACHE_HEADER*)ntfs_malloc(size); + if (cache) { + /* header */ + cache->name = name; + cache->dofree = dofree; + if (dohash && max_hash) { + cache->dohash = dohash; + cache->max_hash = max_hash; + } else { + cache->dohash = (cache_hash)NULL; + cache->max_hash = 0; + } + cache->fixed_size = full_item_size - sizeof(struct CACHED_GENERIC); + cache->reads = 0; + cache->writes = 0; + cache->hits = 0; + /* chain the data entries, and mark an invalid entry */ + cache->most_recent_entry = (struct CACHED_GENERIC*)NULL; + cache->oldest_entry = (struct CACHED_GENERIC*)NULL; + cache->free_entry = &cache->entry[0]; + pc = &cache->entry[0]; + for (i=0; i<(item_count - 1); i++) { + qc = (struct CACHED_GENERIC*)((char*)pc + + full_item_size); + pc->next = qc; + pc->variable = (void*)NULL; + pc->varsize = 0; + pc = qc; + } + /* special for the last entry */ + pc->next = (struct CACHED_GENERIC*)NULL; + pc->variable = (void*)NULL; + pc->varsize = 0; + + if (max_hash) { + /* chain the hash entries */ + ph = (struct HASH_ENTRY*)(((char*)pc) + full_item_size); + cache->free_hash = ph; + for (i=0; i<(item_count - 1); i++) { + qh = &ph[1]; + ph->next = qh; + ph = qh; + } + /* special for the last entry */ + if (item_count) { + ph->next = (struct HASH_ENTRY*)NULL; + } + /* create and initialize the hash indexes */ + px = (struct HASH_ENTRY**)&ph[1]; + cache->first_hash = px; + for (i=0; i<max_hash; i++) + px[i] = (struct HASH_ENTRY*)NULL; + } else { + cache->free_hash = (struct HASH_ENTRY*)NULL; + cache->first_hash = (struct HASH_ENTRY**)NULL; + } + } + return (cache); +} + +/* + * Create all LRU caches + * + * No error return, if creation is not possible, cacheing will + * just be not available + */ + +void ntfs_create_lru_caches(ntfs_volume *vol) +{ +#if CACHE_INODE_SIZE + /* inode cache */ + vol->xinode_cache = ntfs_create_cache("inode",(cache_free)NULL, + ntfs_dir_inode_hash, sizeof(struct CACHED_INODE), + CACHE_INODE_SIZE, 2*CACHE_INODE_SIZE); +#endif +#if CACHE_NIDATA_SIZE + /* idata cache */ + vol->nidata_cache = ntfs_create_cache("nidata", + ntfs_inode_nidata_free, ntfs_inode_nidata_hash, + sizeof(struct CACHED_NIDATA), + CACHE_NIDATA_SIZE, 2*CACHE_NIDATA_SIZE); +#endif +#if CACHE_LOOKUP_SIZE + /* lookup cache */ + vol->lookup_cache = ntfs_create_cache("lookup", + (cache_free)NULL, ntfs_dir_lookup_hash, + sizeof(struct CACHED_LOOKUP), + CACHE_LOOKUP_SIZE, 2*CACHE_LOOKUP_SIZE); +#endif + vol->securid_cache = ntfs_create_cache("securid",(cache_free)NULL, + (cache_hash)NULL,sizeof(struct CACHED_SECURID), CACHE_SECURID_SIZE, 0); +#if CACHE_LEGACY_SIZE + vol->legacy_cache = ntfs_create_cache("legacy",(cache_free)NULL, + (cache_hash)NULL, sizeof(struct CACHED_PERMISSIONS_LEGACY), CACHE_LEGACY_SIZE, 0); +#endif +} + +/* + * Free all LRU caches + */ + +void ntfs_free_lru_caches(ntfs_volume *vol) +{ +#if CACHE_INODE_SIZE + ntfs_free_cache(vol->xinode_cache); +#endif +#if CACHE_NIDATA_SIZE + ntfs_free_cache(vol->nidata_cache); +#endif +#if CACHE_LOOKUP_SIZE + ntfs_free_cache(vol->lookup_cache); +#endif + ntfs_free_cache(vol->securid_cache); +#if CACHE_LEGACY_SIZE + ntfs_free_cache(vol->legacy_cache); +#endif +} diff --git a/portlibs/sources/libntfs/cache.h b/portlibs/sources/libntfs/cache.h new file mode 100644 index 00000000..be63b1a4 --- /dev/null +++ b/portlibs/sources/libntfs/cache.h @@ -0,0 +1,118 @@ +/* + * cache.h : deal with indexed LRU caches + * + * Copyright (c) 2008-2010 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 + */ + +#ifndef _NTFS_CACHE_H_ +#define _NTFS_CACHE_H_ + +#include "volume.h" + +struct CACHED_GENERIC { + struct CACHED_GENERIC *next; + struct CACHED_GENERIC *previous; + void *variable; + size_t varsize; + union ALIGNMENT payload[0]; +} ; + +struct CACHED_INODE { + struct CACHED_INODE *next; + struct CACHED_INODE *previous; + const char *pathname; + size_t varsize; + union ALIGNMENT payload[0]; + /* above fields must match "struct CACHED_GENERIC" */ + u64 inum; +} ; + +struct CACHED_NIDATA { + struct CACHED_NIDATA *next; + struct CACHED_NIDATA *previous; + const char *pathname; /* not used */ + size_t varsize; /* not used */ + union ALIGNMENT payload[0]; + /* above fields must match "struct CACHED_GENERIC" */ + u64 inum; + ntfs_inode *ni; +} ; + +struct CACHED_LOOKUP { + struct CACHED_LOOKUP *next; + struct CACHED_LOOKUP *previous; + const char *name; + size_t namesize; + union ALIGNMENT payload[0]; + /* above fields must match "struct CACHED_GENERIC" */ + u64 parent; + u64 inum; +} ; + +enum { + CACHE_FREE = 1, + CACHE_NOHASH = 2 +} ; + +typedef int (*cache_compare)(const struct CACHED_GENERIC *cached, + const struct CACHED_GENERIC *item); +typedef void (*cache_free)(const struct CACHED_GENERIC *cached); +typedef int (*cache_hash)(const struct CACHED_GENERIC *cached); + +struct HASH_ENTRY { + struct HASH_ENTRY *next; + struct CACHED_GENERIC *entry; +} ; + +struct CACHE_HEADER { + const char *name; + struct CACHED_GENERIC *most_recent_entry; + struct CACHED_GENERIC *oldest_entry; + struct CACHED_GENERIC *free_entry; + struct HASH_ENTRY *free_hash; + struct HASH_ENTRY **first_hash; + cache_free dofree; + cache_hash dohash; + unsigned long reads; + unsigned long writes; + unsigned long hits; + int fixed_size; + int max_hash; + struct CACHED_GENERIC entry[0]; +} ; + + /* cast to generic, avoiding gcc warnings */ +#define GENERIC(pstr) ((const struct CACHED_GENERIC*)(const void*)(pstr)) + +struct CACHED_GENERIC *ntfs_fetch_cache(struct CACHE_HEADER *cache, + const struct CACHED_GENERIC *wanted, + cache_compare compare); +struct CACHED_GENERIC *ntfs_enter_cache(struct CACHE_HEADER *cache, + const struct CACHED_GENERIC *item, + cache_compare compare); +int ntfs_invalidate_cache(struct CACHE_HEADER *cache, + const struct CACHED_GENERIC *item, + cache_compare compare, int flags); +int ntfs_remove_cache(struct CACHE_HEADER *cache, + struct CACHED_GENERIC *item, int flags); + +void ntfs_create_lru_caches(ntfs_volume *vol); +void ntfs_free_lru_caches(ntfs_volume *vol); + +#endif /* _NTFS_CACHE_H_ */ + diff --git a/portlibs/sources/libntfs/cache2.c b/portlibs/sources/libntfs/cache2.c new file mode 100644 index 00000000..872f1a57 --- /dev/null +++ b/portlibs/sources/libntfs/cache2.c @@ -0,0 +1,374 @@ +/* + cache.c + The cache is not visible to the user. It should be flushed + when any file is closed or changes are made to the filesystem. + + This cache implements a least-used-page replacement policy. This will + distribute sectors evenly over the pages, so if less than the maximum + pages are used at once, they should all eventually remain in the cache. + This also has the benefit of throwing out old sectors, so as not to keep + too many stale pages around. + + Copyright (c) 2006 Michael "Chishm" Chisholm + Copyright (c) 2009 shareese, rodries + Copyright (c) 2010 Dimok + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#include <ogc/lwp_watchdog.h> +#include <string.h> +#include <limits.h> + +#include "cache2.h" +#include "bit_ops.h" +#include "mem_allocate.h" + +#define CACHE_FREE UINT_MAX + +NTFS_CACHE* _NTFS_cache_constructor (unsigned int numberOfPages, unsigned int sectorsPerPage, const DISC_INTERFACE* discInterface, sec_t endOfPartition, sec_t sectorSize) { + NTFS_CACHE* cache; + unsigned int i; + NTFS_CACHE_ENTRY* cacheEntries; + + if(numberOfPages==0 || sectorsPerPage==0) return NULL; + + if (numberOfPages < 4) { + numberOfPages = 4; + } + + if (sectorsPerPage < 32) { + sectorsPerPage = 32; + } + + cache = (NTFS_CACHE*) ntfs_alloc (sizeof(NTFS_CACHE)); + if (cache == NULL) { + return NULL; + } + + cache->disc = discInterface; + cache->endOfPartition = endOfPartition; + cache->numberOfPages = numberOfPages; + cache->sectorsPerPage = sectorsPerPage; + cache->sectorSize = sectorSize; + + + cacheEntries = (NTFS_CACHE_ENTRY*) ntfs_alloc ( sizeof(NTFS_CACHE_ENTRY) * numberOfPages); + if (cacheEntries == NULL) { + ntfs_free (cache); + return NULL; + } + + for (i = 0; i < numberOfPages; i++) { + cacheEntries[i].sector = CACHE_FREE; + cacheEntries[i].count = 0; + cacheEntries[i].last_access = 0; + cacheEntries[i].dirty = false; + cacheEntries[i].cache = (uint8_t*) ntfs_align ( sectorsPerPage * cache->sectorSize ); + } + + cache->cacheEntries = cacheEntries; + + return cache; +} + +void _NTFS_cache_destructor (NTFS_CACHE* cache) { + unsigned int i; + + if(cache==NULL) return; + + // Clear out cache before destroying it + _NTFS_cache_flush(cache); + + // Free memory in reverse allocation order + for (i = 0; i < cache->numberOfPages; i++) { + ntfs_free (cache->cacheEntries[i].cache); + } + ntfs_free (cache->cacheEntries); + ntfs_free (cache); +} + +static u32 accessCounter = 0; + +static u32 accessTime(){ + accessCounter++; + return accessCounter; +} + +static NTFS_CACHE_ENTRY* _NTFS_cache_getPage(NTFS_CACHE *cache,sec_t sector) +{ + unsigned int i; + NTFS_CACHE_ENTRY* cacheEntries = cache->cacheEntries; + unsigned int numberOfPages = cache->numberOfPages; + unsigned int sectorsPerPage = cache->sectorsPerPage; + + bool foundFree = false; + unsigned int oldUsed = 0; + unsigned int oldAccess = UINT_MAX; + + for(i=0;i<numberOfPages;i++) { + if(sector>=cacheEntries[i].sector && sector<(cacheEntries[i].sector + cacheEntries[i].count)) { + cacheEntries[i].last_access = accessTime(); + return &(cacheEntries[i]); + } + + if(foundFree==false && (cacheEntries[i].sector==CACHE_FREE || cacheEntries[i].last_access<oldAccess)) { + if(cacheEntries[i].sector==CACHE_FREE) foundFree = true; + oldUsed = i; + oldAccess = cacheEntries[i].last_access; + } + } + + if(foundFree==false && cacheEntries[oldUsed].dirty==true) { + if(!cache->disc->writeSectors(cacheEntries[oldUsed].sector,cacheEntries[oldUsed].count,cacheEntries[oldUsed].cache)) return NULL; + cacheEntries[oldUsed].dirty = false; + } + sector = (sector/sectorsPerPage)*sectorsPerPage; // align base sector to page size + sec_t next_page = sector + sectorsPerPage; + if(next_page > cache->endOfPartition) next_page = cache->endOfPartition; + + if(!cache->disc->readSectors(sector,next_page-sector,cacheEntries[oldUsed].cache)) return NULL; + + cacheEntries[oldUsed].sector = sector; + cacheEntries[oldUsed].count = next_page-sector; + cacheEntries[oldUsed].last_access = accessTime(); + + return &(cacheEntries[oldUsed]); +} + +static NTFS_CACHE_ENTRY* _NTFS_cache_findPage(NTFS_CACHE *cache, sec_t sector, sec_t count) { + + unsigned int i; + NTFS_CACHE_ENTRY* cacheEntries = cache->cacheEntries; + unsigned int numberOfPages = cache->numberOfPages; + NTFS_CACHE_ENTRY *entry = NULL; + sec_t lowest = UINT_MAX; + + for(i=0;i<numberOfPages;i++) { + if (cacheEntries[i].sector != CACHE_FREE) { + bool intersect; + if (sector > cacheEntries[i].sector) { + intersect = sector - cacheEntries[i].sector < cacheEntries[i].count; + } else { + intersect = cacheEntries[i].sector - sector < count; + } + + if ( intersect && (cacheEntries[i].sector < lowest)) { + lowest = cacheEntries[i].sector; + entry = &cacheEntries[i]; + } + } + } + + return entry; +} + +bool _NTFS_cache_readSectors(NTFS_CACHE *cache,sec_t sector,sec_t numSectors,void *buffer) +{ + sec_t sec; + sec_t secs_to_read; + NTFS_CACHE_ENTRY *entry; + uint8_t *dest = buffer; + + while(numSectors>0) { + entry = _NTFS_cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + secs_to_read = entry->count - sec; + if(secs_to_read>numSectors) secs_to_read = numSectors; + + memcpy(dest,entry->cache + (sec*cache->sectorSize),(secs_to_read*cache->sectorSize)); + + dest += (secs_to_read*cache->sectorSize); + sector += secs_to_read; + numSectors -= secs_to_read; + } + + return true; +} + +/* +Reads some data from a cache page, determined by the sector number +*/ + +bool _NTFS_cache_readPartialSector (NTFS_CACHE* cache, void* buffer, sec_t sector, unsigned int offset, size_t size) +{ + sec_t sec; + NTFS_CACHE_ENTRY *entry; + + if (offset + size > cache->sectorSize) return false; + + entry = _NTFS_cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + memcpy(buffer,entry->cache + ((sec*cache->sectorSize) + offset),size); + + return true; +} + +bool _NTFS_cache_readLittleEndianValue (NTFS_CACHE* cache, uint32_t *value, sec_t sector, unsigned int offset, int num_bytes) { + uint8_t buf[4]; + if (!_NTFS_cache_readPartialSector(cache, buf, sector, offset, num_bytes)) return false; + + switch(num_bytes) { + case 1: *value = buf[0]; break; + case 2: *value = u8array_to_u16(buf,0); break; + case 4: *value = u8array_to_u32(buf,0); break; + default: return false; + } + return true; +} + +/* +Writes some data to a cache page, making sure it is loaded into memory first. +*/ + +bool _NTFS_cache_writePartialSector (NTFS_CACHE* cache, const void* buffer, sec_t sector, unsigned int offset, size_t size) +{ + sec_t sec; + NTFS_CACHE_ENTRY *entry; + + if (offset + size > cache->sectorSize) return false; + + entry = _NTFS_cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + memcpy(entry->cache + ((sec*cache->sectorSize) + offset),buffer,size); + + entry->dirty = true; + return true; +} + +bool _NTFS_cache_writeLittleEndianValue (NTFS_CACHE* cache, const uint32_t value, sec_t sector, unsigned int offset, int size) { + uint8_t buf[4] = {0, 0, 0, 0}; + + switch(size) { + case 1: buf[0] = value; break; + case 2: u16_to_u8array(buf, 0, value); break; + case 4: u32_to_u8array(buf, 0, value); break; + default: return false; + } + + return _NTFS_cache_writePartialSector(cache, buf, sector, offset, size); +} + +/* +Writes some data to a cache page, zeroing out the page first +*/ + +bool _NTFS_cache_eraseWritePartialSector (NTFS_CACHE* cache, const void* buffer, sec_t sector, unsigned int offset, size_t size) +{ + sec_t sec; + NTFS_CACHE_ENTRY *entry; + + if (offset + size > cache->sectorSize) return false; + + entry = _NTFS_cache_getPage(cache,sector); + if(entry==NULL) return false; + + sec = sector - entry->sector; + memset(entry->cache + (sec*cache->sectorSize),0,cache->sectorSize); + memcpy(entry->cache + ((sec*cache->sectorSize) + offset),buffer,size); + + entry->dirty = true; + return true; +} + +bool _NTFS_cache_writeSectors (NTFS_CACHE* cache, sec_t sector, sec_t numSectors, const void* buffer) +{ + sec_t sec; + sec_t secs_to_write; + NTFS_CACHE_ENTRY* entry; + const uint8_t *src = buffer; + + while(numSectors>0) + { + entry = _NTFS_cache_findPage(cache,sector,numSectors); + + if(entry!=NULL) { + + if ( entry->sector > sector) { + + secs_to_write = entry->sector - sector; + + cache->disc->writeSectors(sector,secs_to_write,src); + src += (secs_to_write*cache->sectorSize); + sector += secs_to_write; + numSectors -= secs_to_write; + } + + sec = sector - entry->sector; + secs_to_write = entry->count - sec; + + if(secs_to_write>numSectors) secs_to_write = numSectors; + + memcpy(entry->cache + (sec*cache->sectorSize),src,(secs_to_write*cache->sectorSize)); + + src += (secs_to_write*cache->sectorSize); + sector += secs_to_write; + numSectors -= secs_to_write; + + entry->dirty = true; + + } else { + cache->disc->writeSectors(sector,numSectors,src); + numSectors=0; + } + } + return true; +} + +/* +Flushes all dirty pages to disc, clearing the dirty flag. +*/ +bool _NTFS_cache_flush (NTFS_CACHE* cache) { + unsigned int i; + if(cache==NULL) return true; + + for (i = 0; i < cache->numberOfPages; i++) { + if (cache->cacheEntries[i].dirty) { + if (!cache->disc->writeSectors (cache->cacheEntries[i].sector, cache->cacheEntries[i].count, cache->cacheEntries[i].cache)) { + return false; + } + } + cache->cacheEntries[i].dirty = false; + } + + return true; +} + +void _NTFS_cache_invalidate (NTFS_CACHE* cache) { + unsigned int i; + if(cache==NULL) + return; + + _NTFS_cache_flush(cache); + for (i = 0; i < cache->numberOfPages; i++) { + cache->cacheEntries[i].sector = CACHE_FREE; + cache->cacheEntries[i].last_access = 0; + cache->cacheEntries[i].count = 0; + cache->cacheEntries[i].dirty = false; + } +} diff --git a/portlibs/sources/libntfs/cache2.h b/portlibs/sources/libntfs/cache2.h new file mode 100644 index 00000000..21daca7c --- /dev/null +++ b/portlibs/sources/libntfs/cache2.h @@ -0,0 +1,135 @@ +/* + NTFS_CACHE.h + The NTFS_CACHE is not visible to the user. It should be flushed + when any file is closed or changes are made to the filesystem. + + This NTFS_CACHE implements a least-used-page replacement policy. This will + distribute sectors evenly over the pages, so if less than the maximum + pages are used at once, they should all eventually remain in the NTFS_CACHE. + This also has the benefit of throwing out old sectors, so as not to keep + too many stale pages around. + + Copyright (c) 2006 Michael "Chishm" Chisholm + Copyright (c) 2009 shareese, rodries + + Redistribution and use in source and binary forms, with or without modification, + are permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, + this list of conditions and the following disclaimer. + 2. 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. + 3. The name of the author may not be used to endorse or promote products derived + from this software without specific prior written permission. + + THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. +*/ + +#ifndef _CACHE2_H +#define _CACHE2_H + +//#include "common.h" +//#include "disc.h" + +#include <stddef.h> +#include <stdint.h> +#include <gctypes.h> +#include <ogc/disc_io.h> +#include <gccore.h> + +typedef struct { + sec_t sector; + unsigned int count; + u64 last_access; + bool dirty; + u8* cache; +} NTFS_CACHE_ENTRY; + +typedef struct { + const DISC_INTERFACE* disc; + sec_t endOfPartition; + unsigned int numberOfPages; + unsigned int sectorsPerPage; + sec_t sectorSize; + NTFS_CACHE_ENTRY* cacheEntries; +} NTFS_CACHE; + +/* +Read data from a sector in the NTFS_CACHE +If the sector is not in the NTFS_CACHE, it will be swapped in +offset is the position to start reading from +size is the amount of data to read +Precondition: offset + size <= BYTES_PER_READ +*/ +//bool _NTFS_cache_readPartialSector (NTFS_CACHE* NTFS_CACHE, void* buffer, sec_t sector, unsigned int offset, size_t size); + +//bool _NTFS_cache_readLittleEndianValue (NTFS_CACHE* NTFS_CACHE, uint32_t *value, sec_t sector, unsigned int offset, int num_bytes); + +/* +Write data to a sector in the NTFS_CACHE +If the sector is not in the NTFS_CACHE, it will be swapped in. +When the sector is swapped out, the data will be written to the disc +offset is the position to start writing to +size is the amount of data to write +Precondition: offset + size <= BYTES_PER_READ +*/ +//bool _NTFS_cache_writePartialSector (NTFS_CACHE* NTFS_CACHE, const void* buffer, sec_t sector, unsigned int offset, size_t size); + +//bool _NTFS_cache_writeLittleEndianValue (NTFS_CACHE* NTFS_CACHE, const uint32_t value, sec_t sector, unsigned int offset, int num_bytes); + +/* +Write data to a sector in the NTFS_CACHE, zeroing the sector first +If the sector is not in the NTFS_CACHE, it will be swapped in. +When the sector is swapped out, the data will be written to the disc +offset is the position to start writing to +size is the amount of data to write +Precondition: offset + size <= BYTES_PER_READ +*/ +//bool _NTFS_cache_eraseWritePartialSector (NTFS_CACHE* NTFS_CACHE, const void* buffer, sec_t sector, unsigned int offset, size_t size); + +/* +Read several sectors from the NTFS_CACHE +*/ +bool _NTFS_cache_readSectors (NTFS_CACHE* NTFS_CACHE, sec_t sector, sec_t numSectors, void* buffer); + +/* +Read a full sector from the NTFS_CACHE +*/ +//static inline bool _NTFS_cache_readSector (NTFS_CACHE* NTFS_CACHE, void* buffer, sec_t sector) { +// return _NTFS_cache_readPartialSector (NTFS_CACHE, buffer, sector, 0, BYTES_PER_READ); +//} + +/* +Write a full sector to the NTFS_CACHE +*/ +//static inline bool _NTFS_cache_writeSector (NTFS_CACHE* NTFS_CACHE, const void* buffer, sec_t sector) { +// return _NTFS_cache_writePartialSector (NTFS_CACHE, buffer, sector, 0, BYTES_PER_READ); +//} + +bool _NTFS_cache_writeSectors (NTFS_CACHE* NTFS_CACHE, sec_t sector, sec_t numSectors, const void* buffer); + +/* +Write any dirty sectors back to disc and clear out the contents of the NTFS_CACHE +*/ +bool _NTFS_cache_flush (NTFS_CACHE* NTFS_CACHE); + +/* +Clear out the contents of the NTFS_CACHE without writing any dirty sectors first +*/ +void _NTFS_cache_invalidate (NTFS_CACHE* NTFS_CACHE); + +NTFS_CACHE* _NTFS_cache_constructor (unsigned int numberOfPages, unsigned int sectorsPerPage, const DISC_INTERFACE* discInterface, sec_t endOfPartition, sec_t sectorSize); + +void _NTFS_cache_destructor (NTFS_CACHE* NTFS_CACHE); + +#endif // _CACHE_H + diff --git a/portlibs/sources/libntfs/collate.c b/portlibs/sources/libntfs/collate.c new file mode 100644 index 00000000..5f7a015a --- /dev/null +++ b/portlibs/sources/libntfs/collate.c @@ -0,0 +1,271 @@ +/** + * collate.c - NTFS collation handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2004 Anton Altaparmakov + * Copyright (c) 2005 Yura Pakhuchiy + * + * 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_STRING_H +#include <string.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "attrib.h" +#include "index.h" +#include "collate.h" +#include "debug.h" +#include "unistr.h" +#include "logging.h" + +/** + * ntfs_collate_binary - Which of two binary objects should be listed first + * @vol: unused + * @data1: + * @data1_len: + * @data2: + * @data2_len: + * + * Description... + * + * Returns: + */ +static int ntfs_collate_binary(ntfs_volume *vol __attribute__((unused)), + const void *data1, const int data1_len, + const void *data2, const int data2_len) +{ + int rc; + + ntfs_log_trace("Entering.\n"); + rc = memcmp(data1, data2, min(data1_len, data2_len)); + if (!rc && (data1_len != data2_len)) { + if (data1_len < data2_len) + rc = -1; + else + rc = 1; + } + ntfs_log_trace("Done, returning %i.\n", rc); + return rc; +} + +/** + * ntfs_collate_ntofs_ulong - Which of two long ints should be listed first + * @vol: unused + * @data1: + * @data1_len: + * @data2: + * @data2_len: + * + * Description... + * + * Returns: + */ +static int ntfs_collate_ntofs_ulong(ntfs_volume *vol __attribute__((unused)), + const void *data1, const int data1_len, + const void *data2, const int data2_len) +{ + int rc; + u32 d1, d2; + + ntfs_log_trace("Entering.\n"); + if (data1_len != data2_len || data1_len != 4) { + ntfs_log_error("data1_len or/and data2_len not equal to 4.\n"); + return NTFS_COLLATION_ERROR; + } + d1 = le32_to_cpup(data1); + d2 = le32_to_cpup(data2); + if (d1 < d2) + rc = -1; + else { + if (d1 == d2) + rc = 0; + else + rc = 1; + } + ntfs_log_trace("Done, returning %i.\n", rc); + return rc; +} + +/** + * ntfs_collate_ntofs_ulongs - Which of two le32 arrays should be listed first + * + * Returns: -1, 0 or 1 depending of how the arrays compare + */ + +static int ntfs_collate_ntofs_ulongs(ntfs_volume *vol __attribute__((unused)), + const void *data1, const int data1_len, + const void *data2, const int data2_len) +{ + int rc; + int len; + const le32 *p1, *p2; + u32 d1, d2; + + ntfs_log_trace("Entering.\n"); + if ((data1_len != data2_len) || (data1_len <= 0) || (data1_len & 3)) { + ntfs_log_error("data1_len or data2_len not valid\n"); + return NTFS_COLLATION_ERROR; + } + p1 = (const le32*)data1; + p2 = (const le32*)data2; + len = data1_len; + do { + d1 = le32_to_cpup(p1); + p1++; + d2 = le32_to_cpup(p2); + p2++; + } while ((d1 == d2) && ((len -= 4) > 0)); + if (d1 < d2) + rc = -1; + else { + if (d1 == d2) + rc = 0; + else + rc = 1; + } + ntfs_log_trace("Done, returning %i.\n", rc); + return rc; +} + +/** + * ntfs_collate_ntofs_security_hash - Which of two security descriptors + * should be listed first + * @vol: unused + * @data1: + * @data1_len: + * @data2: + * @data2_len: + * + * JPA compare two security hash keys made of two unsigned le32 + * + * Returns: -1, 0 or 1 depending of how the keys compare + */ +static int ntfs_collate_ntofs_security_hash(ntfs_volume *vol __attribute__((unused)), + const void *data1, const int data1_len, + const void *data2, const int data2_len) +{ + int rc; + u32 d1, d2; + const le32 *p1, *p2; + + ntfs_log_trace("Entering.\n"); + if (data1_len != data2_len || data1_len != 8) { + ntfs_log_error("data1_len or/and data2_len not equal to 8.\n"); + return NTFS_COLLATION_ERROR; + } + p1 = (const le32*)data1; + p2 = (const le32*)data2; + d1 = le32_to_cpup(p1); + d2 = le32_to_cpup(p2); + if (d1 < d2) + rc = -1; + else { + if (d1 > d2) + rc = 1; + else { + p1++; + p2++; + d1 = le32_to_cpup(p1); + d2 = le32_to_cpup(p2); + if (d1 < d2) + rc = -1; + else { + if (d1 > d2) + rc = 1; + else + rc = 0; + } + } + } + ntfs_log_trace("Done, returning %i.\n", rc); + return rc; +} + +/** + * ntfs_collate_file_name - Which of two filenames should be listed first + * @vol: + * @data1: + * @data1_len: unused + * @data2: + * @data2_len: unused + * + * Description... + * + * Returns: + */ +static int ntfs_collate_file_name(ntfs_volume *vol, + const void *data1, const int data1_len __attribute__((unused)), + const void *data2, const int data2_len __attribute__((unused))) +{ + const FILE_NAME_ATTR *file_name_attr1; + const FILE_NAME_ATTR *file_name_attr2; + int rc; + + ntfs_log_trace("Entering.\n"); + file_name_attr1 = (const FILE_NAME_ATTR*)data1; + file_name_attr2 = (const FILE_NAME_ATTR*)data2; + rc = ntfs_names_full_collate( + (ntfschar*)&file_name_attr1->file_name, + file_name_attr1->file_name_length, + (ntfschar*)&file_name_attr2->file_name, + file_name_attr2->file_name_length, + CASE_SENSITIVE, vol->upcase, vol->upcase_len); + ntfs_log_trace("Done, returning %i.\n", rc); + return rc; +} + +/* + * Get a pointer to appropriate collation function. + * + * Returns NULL if the needed function is not implemented + */ + +COLLATE ntfs_get_collate_function(COLLATION_RULES cr) +{ + COLLATE collate; + + switch (cr) { + case COLLATION_BINARY : + collate = ntfs_collate_binary; + break; + case COLLATION_FILE_NAME : + collate = ntfs_collate_file_name; + break; + case COLLATION_NTOFS_SECURITY_HASH : + collate = ntfs_collate_ntofs_security_hash; + break; + case COLLATION_NTOFS_ULONG : + collate = ntfs_collate_ntofs_ulong; + break; + case COLLATION_NTOFS_ULONGS : + collate = ntfs_collate_ntofs_ulongs; + break; + default : + errno = EOPNOTSUPP; + collate = (COLLATE)NULL; + break; + } + return (collate); +} diff --git a/portlibs/sources/libntfs/collate.h b/portlibs/sources/libntfs/collate.h new file mode 100644 index 00000000..fe383835 --- /dev/null +++ b/portlibs/sources/libntfs/collate.h @@ -0,0 +1,34 @@ +/* + * collate.h - Defines for NTFS collation handling. Originated from the Linux-NTFS + * project. + * + * Copyright (c) 2004 Anton Altaparmakov + * Copyright (c) 2005 Yura Pakhuchiy + * + * 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 + */ + +#ifndef _NTFS_COLLATE_H +#define _NTFS_COLLATE_H + +#include "types.h" +#include "volume.h" + +#define NTFS_COLLATION_ERROR -2 + +extern COLLATE ntfs_get_collate_function(COLLATION_RULES); + +#endif /* _NTFS_COLLATE_H */ diff --git a/portlibs/sources/libntfs/compat.c b/portlibs/sources/libntfs/compat.c new file mode 100644 index 00000000..63114a48 --- /dev/null +++ b/portlibs/sources/libntfs/compat.c @@ -0,0 +1,250 @@ +/** + * compat.c - Tweaks for Windows compatibility + * + * Copyright (c) 2002 Richard Russon + * Copyright (c) 2002-2004 Anton Altaparmakov + * + * 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 + +#include "compat.h" + +#ifndef HAVE_FFS +/** + * ffs - Find the first set bit in an int + * @x: + * + * Description... + * + * Returns: + */ +int ffs(int x) +{ + int r = 1; + + if (!x) + return 0; + if (!(x & 0xffff)) { + x >>= 16; + r += 16; + } + if (!(x & 0xff)) { + x >>= 8; + r += 8; + } + if (!(x & 0xf)) { + x >>= 4; + r += 4; + } + if (!(x & 3)) { + x >>= 2; + r += 2; + } + if (!(x & 1)) { + x >>= 1; + r += 1; + } + return r; +} +#endif /* HAVE_FFS */ + +#ifndef HAVE_DAEMON +/* ************************************************************ + * From: src.opensolaris.org + * src/lib/libresolv2/common/bsd/daemon.c + */ +/* + * Copyright (c) 1997-2000 by Sun Microsystems, Inc. + * All rights reserved. + */ + +#if defined(LIBC_SCCS) && !defined(lint) +static const char sccsid[] = "@(#)daemon.c 8.1 (Berkeley) 6/4/93"; +static const char rcsid[] = "$Id: compat.c,v 1.1.1.1.2.1 2008-08-16 15:17:44 jpandre Exp $"; +#endif /* LIBC_SCCS and not lint */ + +/* + * Copyright (c) 1990, 1993 + * The Regents of the University of California. All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * 1. Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * 2. 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. + * 3. All advertising materials mentioning features or use of this software + * must display the following acknowledgement: + * This product includes software developed by the University of + * California, Berkeley and its contributors. + * 4. Neither the name of the University nor the names of its contributors + * may be used to endorse or promote products derived from this software + * without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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. + */ + +#ifdef HAVE_FCNTL_H +#include <fcntl.h> +#endif +#ifdef HAVE_UNISTD_H +#include <unistd.h> +#endif + +int daemon(int nochdir, int noclose) { + int fd; + + switch (fork()) { + case -1: + return (-1); + case 0: + break; + default: + _exit(0); + } + + if (setsid() == -1) + return (-1); + + if (!nochdir) + (void)chdir("/"); + + if (!noclose && (fd = open("/dev/null", O_RDWR, 0)) != -1) { + (void)dup2(fd, 0); + (void)dup2(fd, 1); + (void)dup2(fd, 2); + if (fd > 2) + (void)close (fd); + } + return (0); +} +/* + * End: src/lib/libresolv2/common/bsd/daemon.c + *************************************************************/ +#endif /* HAVE_DAEMON */ + +#ifndef HAVE_STRSEP +/* ************************************************************ + * From: src.opensolaris.org + * src/lib/libresolv2/common/bsd/strsep.c + */ +/* + * Copyright (c) 1997, by Sun Microsystems, Inc. + * All rights reserved. + */ + +#if defined(LIBC_SCCS) && !defined(lint) +static const char sccsid[] = "strsep.c 8.1 (Berkeley) 6/4/93"; +static const char rcsid[] = "$Id: compat.c,v 1.1.1.1.2.1 2008-08-16 15:17:44 jpandre Exp $"; +#endif /* LIBC_SCCS and not lint */ + +/* + * Copyright (c) 1990, 1993 + * The Regents of the University of California. All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * 1. Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * 2. 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. + * 3. All advertising materials mentioning features or use of this software + * must display the following acknowledgement: + * This product includes software developed by the University of + * California, Berkeley and its contributors. + * 4. Neither the name of the University nor the names of its contributors + * may be used to endorse or promote products derived from this software + * without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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. + */ + +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_STDIO_H +#include <stdio.h> +#endif + +/* + * Get next token from string *stringp, where tokens are possibly-empty + * strings separated by characters from delim. + * + * Writes NULs into the string at *stringp to end tokens. + * delim need not remain constant from call to call. + * On return, *stringp points past the last NUL written (if there might + * be further tokens), or is NULL (if there are definitely no more tokens). + * + * If *stringp is NULL, strsep returns NULL. + */ +char *strsep(char **stringp, const char *delim) { + char *s; + const char *spanp; + int c, sc; + char *tok; + + if ((s = *stringp) == NULL) + return (NULL); + for (tok = s;;) { + c = *s++; + spanp = delim; + do { + if ((sc = *spanp++) == c) { + if (c == 0) + s = NULL; + else + s[-1] = 0; + *stringp = s; + return (tok); + } + } while (sc != 0); + } + /* NOTREACHED */ +} + +/* + * End: src/lib/libresolv2/common/bsd/strsep.c + *************************************************************/ +#endif /* HAVE_STRSEP */ + diff --git a/portlibs/sources/libntfs/compat.h b/portlibs/sources/libntfs/compat.h new file mode 100644 index 00000000..957752a0 --- /dev/null +++ b/portlibs/sources/libntfs/compat.h @@ -0,0 +1,86 @@ +/* + * compat.h - Tweaks for Windows compatibility. + * + * Copyright (c) 2002 Richard Russon + * Copyright (c) 2002-2004 Anton Altaparmakov + * Copyright (c) 2008-2009 Szabolcs Szakacsits + * + * 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 + */ + +#ifndef _NTFS_COMPAT_H +#define _NTFS_COMPAT_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif +#ifdef HAVE_SYS_PARAM_H +#include <sys/param.h> +#endif + +#ifndef PATH_MAX +#define PATH_MAX 4096 +#endif + +#ifndef HAVE_FFS +extern int ffs(int i); +#endif /* HAVE_FFS */ + +#ifndef HAVE_DAEMON +extern int daemon(int nochdir, int noclose); +#endif /* HAVE_DAEMON */ + +#ifndef HAVE_STRSEP +extern char *strsep(char **stringp, const char *delim); +#endif /* HAVE_STRSEP */ + +#ifdef WINDOWS + +#define HAVE_STDIO_H /* mimic config.h */ +#define HAVE_STDARG_H + +#define atoll _atoi64 +#define fdatasync commit +#define __inline__ inline +#define __attribute__(X) /*nothing*/ + +#else /* !defined WINDOWS */ + +#ifndef O_BINARY +#define O_BINARY 0 /* unix is binary by default */ +#endif + +#ifdef GEKKO + +#include "mem_allocate.h" + +#define XATTR_CREATE 1 +#define XATTR_REPLACE 2 + +#define MINORBITS 20 +#define MINORMASK ((1U << MINORBITS) - 1) + +#define major(dev) ((unsigned int) ((dev) >> MINORBITS)) +#define minor(dev) ((unsigned int) ((dev) & MINORMASK)) +#define mkdev(ma,mi) (((ma) << MINORBITS) | (mi)) +#define random rand + +#endif /* defined GEKKO */ + +#endif /* defined WINDOWS */ + +#endif /* defined _NTFS_COMPAT_H */ + diff --git a/portlibs/sources/libntfs/compress.c b/portlibs/sources/libntfs/compress.c new file mode 100644 index 00000000..73d493e1 --- /dev/null +++ b/portlibs/sources/libntfs/compress.c @@ -0,0 +1,1836 @@ +/** + * compress.c - Compressed attribute handling code. Originated from the Linux-NTFS + * project. + * + * Copyright (c) 2004-2005 Anton Altaparmakov + * Copyright (c) 2004-2006 Szabolcs Szakacsits + * Copyright (c) 2005 Yura Pakhuchiy + * Copyright (c) 2009-2011 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 + * + * A part of the compression algorithm is based on lzhuf.c whose header + * describes the roles of the original authors (with no apparent copyright + * notice, and according to http://home.earthlink.net/~neilbawd/pall.html + * this was put into public domain in 1988 by Haruhiko OKUMURA). + * + * LZHUF.C English version 1.0 + * Based on Japanese version 29-NOV-1988 + * LZSS coded by Haruhiko OKUMURA + * Adaptive Huffman Coding coded by Haruyasu YOSHIZAKI + * Edited and translated to English by Kenji RIKITAKE + */ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#ifdef HAVE_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "attrib.h" +#include "debug.h" +#include "volume.h" +#include "types.h" +#include "layout.h" +#include "runlist.h" +#include "compress.h" +#include "lcnalloc.h" +#include "logging.h" +#include "misc.h" + +#undef le16_to_cpup +/* the standard le16_to_cpup() crashes for unaligned data on some processors */ +#define le16_to_cpup(p) (*(u8*)(p) + (((u8*)(p))[1] << 8)) + +/** + * enum ntfs_compression_constants - constants used in the compression code + */ +typedef enum { + /* Token types and access mask. */ + NTFS_SYMBOL_TOKEN = 0, + NTFS_PHRASE_TOKEN = 1, + NTFS_TOKEN_MASK = 1, + + /* Compression sub-block constants. */ + NTFS_SB_SIZE_MASK = 0x0fff, + NTFS_SB_SIZE = 0x1000, + NTFS_SB_IS_COMPRESSED = 0x8000, +} ntfs_compression_constants; + +#define THRESHOLD 3 /* minimal match length for compression */ +#define NIL NTFS_SB_SIZE /* End of tree's node */ + +struct COMPRESS_CONTEXT { + const unsigned char *inbuf; + unsigned int len; + unsigned int nbt; + int match_position; + unsigned int match_length; + u16 lson[NTFS_SB_SIZE + 1]; + u16 rson[NTFS_SB_SIZE + 257]; + u16 dad[NTFS_SB_SIZE + 1]; +} ; + +/* + * Initialize the match tree + */ + +static void ntfs_init_compress_tree(struct COMPRESS_CONTEXT *pctx) +{ + int i; + + for (i = NTFS_SB_SIZE + 1; i <= NTFS_SB_SIZE + 256; i++) + pctx->rson[i] = NIL; /* root */ + for (i = 0; i < NTFS_SB_SIZE; i++) + pctx->dad[i] = NIL; /* node */ +} + +/* + * Insert a new node into match tree for quickly locating + * further similar strings + */ + +static void ntfs_new_node (struct COMPRESS_CONTEXT *pctx, + unsigned int r) +{ + unsigned int pp; + BOOL less; + BOOL done; + const unsigned char *key; + int c; + unsigned long mxi; + unsigned int mxl; + + mxl = (1 << (16 - pctx->nbt)) + 2; + less = FALSE; + done = FALSE; + key = &pctx->inbuf[r]; + pp = NTFS_SB_SIZE + 1 + key[0]; + pctx->rson[r] = pctx->lson[r] = NIL; + pctx->match_length = 0; + do { + if (!less) { + if (pctx->rson[pp] != NIL) + pp = pctx->rson[pp]; + else { + pctx->rson[pp] = r; + pctx->dad[r] = pp; + done = TRUE; + } + } else { + if (pctx->lson[pp] != NIL) + pp = pctx->lson[pp]; + else { + pctx->lson[pp] = r; + pctx->dad[r] = pp; + done = TRUE; + } + } + if (!done) { + register unsigned long i; + register const unsigned char *p1,*p2; + + i = 1; + mxi = NTFS_SB_SIZE - r; + if (mxi < 2) + less = FALSE; + else { + p1 = key; + p2 = &pctx->inbuf[pp]; + /* this loop has a significant impact on performances */ + do { + } while ((p1[i] == p2[i]) && (++i < mxi)); + less = (i < mxi) && (p1[i] < p2[i]); + } + if (i >= THRESHOLD) { + if (i > pctx->match_length) { + pctx->match_position = + r - pp + 2*NTFS_SB_SIZE - 1; + if ((pctx->match_length = i) > mxl) { + i = pctx->rson[pp]; + pctx->rson[r] = i; + pctx->dad[i] = r; + i = pctx->lson[pp]; + pctx->lson[r] = i; + pctx->dad[i] = r; + i = pctx->dad[pp]; + pctx->dad[r] = i; + if (pctx->rson[i] == pp) + pctx->rson[i] = r; + else + pctx->lson[i] = r; + /* remove pp */ + pctx->dad[pp] = NIL; + done = TRUE; + pctx->match_length = mxl; + } + } else + if ((i == pctx->match_length) + && ((c = (r - pp + 2*NTFS_SB_SIZE - 1)) + < pctx->match_position)) + pctx->match_position = c; + } + } + } while (!done); +} + +/* + * Search for the longest previous string matching the + * current one + * + * Returns the end of the longest current string which matched + * or zero if there was a bug + */ + +static unsigned int ntfs_nextmatch(struct COMPRESS_CONTEXT *pctx, + unsigned int rr, int dd) +{ + unsigned int bestlen = 0; + + do { + rr++; + if (pctx->match_length > 0) + pctx->match_length--; + if (!pctx->len) { + ntfs_log_error("compress bug : void run\n"); + goto bug; + } + if (--pctx->len) { + if (rr >= NTFS_SB_SIZE) { + ntfs_log_error("compress bug : buffer overflow\n"); + goto bug; + } + if (((rr + bestlen) < NTFS_SB_SIZE)) { + while ((unsigned int)(1 << pctx->nbt) + <= (rr - 1)) + pctx->nbt++; + ntfs_new_node(pctx,rr); + if (pctx->match_length > bestlen) + bestlen = pctx->match_length; + } else + if (dd > 0) { + rr += dd; + if ((int)pctx->match_length > dd) + pctx->match_length -= dd; + else + pctx->match_length = 0; + if ((int)pctx->len < dd) { + ntfs_log_error("compress bug : run overflows\n"); + goto bug; + } + pctx->len -= dd; + dd = 0; + } + } + } while (dd-- > 0); + return (rr); +bug : + return (0); +} + +/* + * Compress an input block + * + * Returns the size of the compressed block (including header) + * or zero if there was an error + */ + +static unsigned int ntfs_compress_block(const char *inbuf, + unsigned int size, char *outbuf) +{ + struct COMPRESS_CONTEXT *pctx; + char *ptag; + int dd; + unsigned int rr; + unsigned int last_match_length; + unsigned int q; + unsigned int xout; + unsigned int ntag; + + pctx = (struct COMPRESS_CONTEXT*)ntfs_malloc(sizeof(struct COMPRESS_CONTEXT)); + if (pctx) { + pctx->inbuf = (const unsigned char*)inbuf; + ntfs_init_compress_tree(pctx); + xout = 2; + ntag = 0; + ptag = &outbuf[xout++]; + *ptag = 0; + rr = 0; + pctx->nbt = 4; + pctx->len = size; + pctx->match_length = 0; + ntfs_new_node(pctx,0); + do { + if (pctx->match_length > pctx->len) + pctx->match_length = pctx->len; + if (pctx->match_length < THRESHOLD) { + pctx->match_length = 1; + if (ntag >= 8) { + ntag = 0; + ptag = &outbuf[xout++]; + *ptag = 0; + } + outbuf[xout++] = inbuf[rr]; + ntag++; + } else { + while ((unsigned int)(1 << pctx->nbt) + <= (rr - 1)) + pctx->nbt++; + q = (pctx->match_position << (16 - pctx->nbt)) + + pctx->match_length - THRESHOLD; + if (ntag >= 8) { + ntag = 0; + ptag = &outbuf[xout++]; + *ptag = 0; + } + *ptag |= 1 << ntag++; + outbuf[xout++] = q & 255; + outbuf[xout++] = (q >> 8) & 255; + } + last_match_length = pctx->match_length; + dd = last_match_length; + if (dd-- > 0) { + rr = ntfs_nextmatch(pctx,rr,dd); + if (!rr) + goto bug; + } + /* + * stop if input is exhausted or output has exceeded + * the maximum size. Two extra bytes have to be + * reserved in output buffer, as 3 bytes may be + * output in a loop. + */ + } while ((pctx->len > 0) + && (rr < size) && (xout < (NTFS_SB_SIZE + 2))); + /* uncompressed must be full size, so accept if better */ + if (xout < (NTFS_SB_SIZE + 2)) { + outbuf[0] = (xout - 3) & 255; + outbuf[1] = 0xb0 + (((xout - 3) >> 8) & 15); + } else { + memcpy(&outbuf[2],inbuf,size); + if (size < NTFS_SB_SIZE) + memset(&outbuf[size+2],0,NTFS_SB_SIZE - size); + outbuf[0] = 0xff; + outbuf[1] = 0x3f; + xout = NTFS_SB_SIZE + 2; + } + free(pctx); + } else { + xout = 0; + errno = ENOMEM; + } + return (xout); /* 0 for an error, > size if cannot compress */ +bug : + return (0); +} + +/** + * ntfs_decompress - decompress a compression block into an array of pages + * @dest: buffer to which to write the decompressed data + * @dest_size: size of buffer @dest in bytes + * @cb_start: compression block to decompress + * @cb_size: size of compression block @cb_start in bytes + * + * This decompresses the compression block @cb_start into the destination + * buffer @dest. + * + * @cb_start is a pointer to the compression block which needs decompressing + * and @cb_size is the size of @cb_start in bytes (8-64kiB). + * + * Return 0 if success or -EOVERFLOW on error in the compressed stream. + */ +static int ntfs_decompress(u8 *dest, const u32 dest_size, + u8 *const cb_start, const u32 cb_size) +{ + /* + * Pointers into the compressed data, i.e. the compression block (cb), + * and the therein contained sub-blocks (sb). + */ + u8 *cb_end = cb_start + cb_size; /* End of cb. */ + u8 *cb = cb_start; /* Current position in cb. */ + u8 *cb_sb_start = cb; /* Beginning of the current sb in the cb. */ + u8 *cb_sb_end; /* End of current sb / beginning of next sb. */ + /* Variables for uncompressed data / destination. */ + u8 *dest_end = dest + dest_size; /* End of dest buffer. */ + u8 *dest_sb_start; /* Start of current sub-block in dest. */ + u8 *dest_sb_end; /* End of current sb in dest. */ + /* Variables for tag and token parsing. */ + u8 tag; /* Current tag. */ + int token; /* Loop counter for the eight tokens in tag. */ + + ntfs_log_trace("Entering, cb_size = 0x%x.\n", (unsigned)cb_size); +do_next_sb: + ntfs_log_debug("Beginning sub-block at offset = %d in the cb.\n", + (int)(cb - cb_start)); + /* + * Have we reached the end of the compression block or the end of the + * decompressed data? The latter can happen for example if the current + * position in the compression block is one byte before its end so the + * first two checks do not detect it. + */ + if (cb == cb_end || !le16_to_cpup((le16*)cb) || dest == dest_end) { + ntfs_log_debug("Completed. Returning success (0).\n"); + return 0; + } + /* Setup offset for the current sub-block destination. */ + dest_sb_start = dest; + dest_sb_end = dest + NTFS_SB_SIZE; + /* Check that we are still within allowed boundaries. */ + if (dest_sb_end > dest_end) + goto return_overflow; + /* Does the minimum size of a compressed sb overflow valid range? */ + if (cb + 6 > cb_end) + goto return_overflow; + /* Setup the current sub-block source pointers and validate range. */ + cb_sb_start = cb; + cb_sb_end = cb_sb_start + (le16_to_cpup((le16*)cb) & NTFS_SB_SIZE_MASK) + + 3; + if (cb_sb_end > cb_end) + goto return_overflow; + /* Now, we are ready to process the current sub-block (sb). */ + if (!(le16_to_cpup((le16*)cb) & NTFS_SB_IS_COMPRESSED)) { + ntfs_log_debug("Found uncompressed sub-block.\n"); + /* This sb is not compressed, just copy it into destination. */ + /* Advance source position to first data byte. */ + cb += 2; + /* An uncompressed sb must be full size. */ + if (cb_sb_end - cb != NTFS_SB_SIZE) + goto return_overflow; + /* Copy the block and advance the source position. */ + memcpy(dest, cb, NTFS_SB_SIZE); + cb += NTFS_SB_SIZE; + /* Advance destination position to next sub-block. */ + dest += NTFS_SB_SIZE; + goto do_next_sb; + } + ntfs_log_debug("Found compressed sub-block.\n"); + /* This sb is compressed, decompress it into destination. */ + /* Forward to the first tag in the sub-block. */ + cb += 2; +do_next_tag: + if (cb == cb_sb_end) { + /* Check if the decompressed sub-block was not full-length. */ + if (dest < dest_sb_end) { + int nr_bytes = dest_sb_end - dest; + + ntfs_log_debug("Filling incomplete sub-block with zeroes.\n"); + /* Zero remainder and update destination position. */ + memset(dest, 0, nr_bytes); + dest += nr_bytes; + } + /* We have finished the current sub-block. */ + goto do_next_sb; + } + /* Check we are still in range. */ + if (cb > cb_sb_end || dest > dest_sb_end) + goto return_overflow; + /* Get the next tag and advance to first token. */ + tag = *cb++; + /* Parse the eight tokens described by the tag. */ + for (token = 0; token < 8; token++, tag >>= 1) { + u16 lg, pt, length, max_non_overlap; + register u16 i; + u8 *dest_back_addr; + + /* Check if we are done / still in range. */ + if (cb >= cb_sb_end || dest > dest_sb_end) + break; + /* Determine token type and parse appropriately.*/ + if ((tag & NTFS_TOKEN_MASK) == NTFS_SYMBOL_TOKEN) { + /* + * We have a symbol token, copy the symbol across, and + * advance the source and destination positions. + */ + *dest++ = *cb++; + /* Continue with the next token. */ + continue; + } + /* + * We have a phrase token. Make sure it is not the first tag in + * the sb as this is illegal and would confuse the code below. + */ + if (dest == dest_sb_start) + goto return_overflow; + /* + * Determine the number of bytes to go back (p) and the number + * of bytes to copy (l). We use an optimized algorithm in which + * we first calculate log2(current destination position in sb), + * which allows determination of l and p in O(1) rather than + * O(n). We just need an arch-optimized log2() function now. + */ + lg = 0; + for (i = dest - dest_sb_start - 1; i >= 0x10; i >>= 1) + lg++; + /* Get the phrase token into i. */ + pt = le16_to_cpup((le16*)cb); + /* + * Calculate starting position of the byte sequence in + * the destination using the fact that p = (pt >> (12 - lg)) + 1 + * and make sure we don't go too far back. + */ + dest_back_addr = dest - (pt >> (12 - lg)) - 1; + if (dest_back_addr < dest_sb_start) + goto return_overflow; + /* Now calculate the length of the byte sequence. */ + length = (pt & (0xfff >> lg)) + 3; + /* Verify destination is in range. */ + if (dest + length > dest_sb_end) + goto return_overflow; + /* The number of non-overlapping bytes. */ + max_non_overlap = dest - dest_back_addr; + if (length <= max_non_overlap) { + /* The byte sequence doesn't overlap, just copy it. */ + memcpy(dest, dest_back_addr, length); + /* Advance destination pointer. */ + dest += length; + } else { + /* + * The byte sequence does overlap, copy non-overlapping + * part and then do a slow byte by byte copy for the + * overlapping part. Also, advance the destination + * pointer. + */ + memcpy(dest, dest_back_addr, max_non_overlap); + dest += max_non_overlap; + dest_back_addr += max_non_overlap; + length -= max_non_overlap; + while (length--) + *dest++ = *dest_back_addr++; + } + /* Advance source position and continue with the next token. */ + cb += 2; + } + /* No tokens left in the current tag. Continue with the next tag. */ + goto do_next_tag; +return_overflow: + errno = EOVERFLOW; + ntfs_log_perror("Failed to decompress file"); + return -1; +} + +/** + * ntfs_is_cb_compressed - internal function, do not use + * + * This is a very specialised function determining if a cb is compressed or + * uncompressed. It is assumed that checking for a sparse cb has already been + * performed and that the cb is not sparse. It makes all sorts of other + * assumptions as well and hence it is not useful anywhere other than where it + * is used at the moment. Please, do not make this function available for use + * outside of compress.c as it is bound to confuse people and not do what they + * want. + * + * Return TRUE on errors so that the error will be detected later on in the + * code. Might be a bit confusing to debug but there really should never be + * errors coming from here. + */ +static BOOL ntfs_is_cb_compressed(ntfs_attr *na, runlist_element *rl, + VCN cb_start_vcn, int cb_clusters) +{ + /* + * The simplest case: the run starting at @cb_start_vcn contains + * @cb_clusters clusters which are all not sparse, thus the cb is not + * compressed. + */ +restart: + cb_clusters -= rl->length - (cb_start_vcn - rl->vcn); + while (cb_clusters > 0) { + /* Go to the next run. */ + rl++; + /* Map the next runlist fragment if it is not mapped. */ + if (rl->lcn < LCN_HOLE || !rl->length) { + cb_start_vcn = rl->vcn; + rl = ntfs_attr_find_vcn(na, rl->vcn); + if (!rl || rl->lcn < LCN_HOLE || !rl->length) + return TRUE; + /* + * If the runs were merged need to deal with the + * resulting partial run so simply restart. + */ + if (rl->vcn < cb_start_vcn) + goto restart; + } + /* If the current run is sparse, the cb is compressed. */ + if (rl->lcn == LCN_HOLE) + return TRUE; + /* If the whole cb is not sparse, it is not compressed. */ + if (rl->length >= cb_clusters) + return FALSE; + cb_clusters -= rl->length; + }; + /* All cb_clusters were not sparse thus the cb is not compressed. */ + return FALSE; +} + +/** + * ntfs_compressed_attr_pread - read from a compressed attribute + * @na: ntfs attribute to read from + * @pos: byte position in the attribute to begin reading from + * @count: number of bytes to read + * @b: output data buffer + * + * NOTE: You probably want to be using attrib.c::ntfs_attr_pread() instead. + * + * This function will read @count bytes starting at offset @pos from the + * compressed ntfs attribute @na into the data buffer @b. + * + * On success, return the number of successfully read bytes. If this number + * is lower than @count this means that the read reached end of file or that + * an error was encountered during the read so that the read is partial. + * 0 means end of file or nothing was read (also return 0 when @count is 0). + * + * On error and nothing has been read, return -1 with errno set appropriately + * to the return code of ntfs_pread(), or to EINVAL in case of invalid + * arguments. + */ +s64 ntfs_compressed_attr_pread(ntfs_attr *na, s64 pos, s64 count, void *b) +{ + s64 br, to_read, ofs, total, total2; + u64 cb_size_mask; + VCN start_vcn, vcn, end_vcn; + ntfs_volume *vol; + runlist_element *rl; + u8 *dest, *cb, *cb_pos, *cb_end; + u32 cb_size; + int err; + ATTR_FLAGS data_flags; + FILE_ATTR_FLAGS compression; + unsigned int nr_cbs, cb_clusters; + + ntfs_log_trace("Entering for inode 0x%llx, attr 0x%x, pos 0x%llx, count 0x%llx.\n", + (unsigned long long)na->ni->mft_no, na->type, + (long long)pos, (long long)count); + data_flags = na->data_flags; + compression = na->ni->flags & FILE_ATTR_COMPRESSED; + if (!na || !na->ni || !na->ni->vol || !b + || ((data_flags & ATTR_COMPRESSION_MASK) + != ATTR_IS_COMPRESSED) + || pos < 0 || count < 0) { + errno = EINVAL; + return -1; + } + /* + * Encrypted attributes are not supported. We return access denied, + * which is what Windows NT4 does, too. + */ + if (NAttrEncrypted(na)) { + errno = EACCES; + return -1; + } + if (!count) + return 0; + /* Truncate reads beyond end of attribute. */ + if (pos + count > na->data_size) { + if (pos >= na->data_size) { + return 0; + } + count = na->data_size - pos; + } + /* If it is a resident attribute, simply use ntfs_attr_pread(). */ + if (!NAttrNonResident(na)) + return ntfs_attr_pread(na, pos, count, b); + total = total2 = 0; + /* Zero out reads beyond initialized size. */ + if (pos + count > na->initialized_size) { + if (pos >= na->initialized_size) { + memset(b, 0, count); + return count; + } + total2 = pos + count - na->initialized_size; + count -= total2; + memset((u8*)b + count, 0, total2); + } + vol = na->ni->vol; + cb_size = na->compression_block_size; + cb_size_mask = cb_size - 1UL; + cb_clusters = na->compression_block_clusters; + + /* Need a temporary buffer for each loaded compression block. */ + cb = (u8*)ntfs_malloc(cb_size); + if (!cb) + return -1; + + /* Need a temporary buffer for each uncompressed block. */ + dest = (u8*)ntfs_malloc(cb_size); + if (!dest) { + free(cb); + return -1; + } + /* + * The first vcn in the first compression block (cb) which we need to + * decompress. + */ + start_vcn = (pos & ~cb_size_mask) >> vol->cluster_size_bits; + /* Offset in the uncompressed cb at which to start reading data. */ + ofs = pos & cb_size_mask; + /* + * The first vcn in the cb after the last cb which we need to + * decompress. + */ + end_vcn = ((pos + count + cb_size - 1) & ~cb_size_mask) >> + vol->cluster_size_bits; + /* Number of compression blocks (cbs) in the wanted vcn range. */ + nr_cbs = (end_vcn - start_vcn) << vol->cluster_size_bits >> + na->compression_block_size_bits; + cb_end = cb + cb_size; +do_next_cb: + nr_cbs--; + cb_pos = cb; + vcn = start_vcn; + start_vcn += cb_clusters; + + /* Check whether the compression block is sparse. */ + rl = ntfs_attr_find_vcn(na, vcn); + if (!rl || rl->lcn < LCN_HOLE) { + free(cb); + free(dest); + if (total) + return total; + /* FIXME: Do we want EIO or the error code? (AIA) */ + errno = EIO; + return -1; + } + if (rl->lcn == LCN_HOLE) { + /* Sparse cb, zero out destination range overlapping the cb. */ + ntfs_log_debug("Found sparse compression block.\n"); + to_read = min(count, cb_size - ofs); + memset(b, 0, to_read); + ofs = 0; + total += to_read; + count -= to_read; + b = (u8*)b + to_read; + } else if (!ntfs_is_cb_compressed(na, rl, vcn, cb_clusters)) { + s64 tdata_size, tinitialized_size; + /* + * Uncompressed cb, read it straight into the destination range + * overlapping the cb. + */ + ntfs_log_debug("Found uncompressed compression block.\n"); + /* + * Read the uncompressed data into the destination buffer. + * NOTE: We cheat a little bit here by marking the attribute as + * not compressed in the ntfs_attr structure so that we can + * read the data by simply using ntfs_attr_pread(). (-8 + * NOTE: we have to modify data_size and initialized_size + * temporarily as well... + */ + to_read = min(count, cb_size - ofs); + ofs += vcn << vol->cluster_size_bits; + NAttrClearCompressed(na); + na->data_flags &= ~ATTR_COMPRESSION_MASK; + tdata_size = na->data_size; + tinitialized_size = na->initialized_size; + na->data_size = na->initialized_size = na->allocated_size; + do { + br = ntfs_attr_pread(na, ofs, to_read, b); + if (br <= 0) { + if (!br) { + ntfs_log_error("Failed to read an" + " uncompressed cluster," + " inode %lld offs 0x%llx\n", + (long long)na->ni->mft_no, + (long long)ofs); + errno = EIO; + } + err = errno; + na->data_size = tdata_size; + na->initialized_size = tinitialized_size; + na->ni->flags |= compression; + na->data_flags = data_flags; + free(cb); + free(dest); + if (total) + return total; + errno = err; + return br; + } + total += br; + count -= br; + b = (u8*)b + br; + to_read -= br; + ofs += br; + } while (to_read > 0); + na->data_size = tdata_size; + na->initialized_size = tinitialized_size; + na->ni->flags |= compression; + na->data_flags = data_flags; + ofs = 0; + } else { + s64 tdata_size, tinitialized_size; + + /* + * Compressed cb, decompress it into the temporary buffer, then + * copy the data to the destination range overlapping the cb. + */ + ntfs_log_debug("Found compressed compression block.\n"); + /* + * Read the compressed data into the temporary buffer. + * NOTE: We cheat a little bit here by marking the attribute as + * not compressed in the ntfs_attr structure so that we can + * read the raw, compressed data by simply using + * ntfs_attr_pread(). (-8 + * NOTE: We have to modify data_size and initialized_size + * temporarily as well... + */ + to_read = cb_size; + NAttrClearCompressed(na); + na->data_flags &= ~ATTR_COMPRESSION_MASK; + tdata_size = na->data_size; + tinitialized_size = na->initialized_size; + na->data_size = na->initialized_size = na->allocated_size; + do { + br = ntfs_attr_pread(na, + (vcn << vol->cluster_size_bits) + + (cb_pos - cb), to_read, cb_pos); + if (br <= 0) { + if (!br) { + ntfs_log_error("Failed to read a" + " compressed cluster, " + " inode %lld offs 0x%llx\n", + (long long)na->ni->mft_no, + (long long)(vcn << vol->cluster_size_bits)); + errno = EIO; + } + err = errno; + na->data_size = tdata_size; + na->initialized_size = tinitialized_size; + na->ni->flags |= compression; + na->data_flags = data_flags; + free(cb); + free(dest); + if (total) + return total; + errno = err; + return br; + } + cb_pos += br; + to_read -= br; + } while (to_read > 0); + na->data_size = tdata_size; + na->initialized_size = tinitialized_size; + na->ni->flags |= compression; + na->data_flags = data_flags; + /* Just a precaution. */ + if (cb_pos + 2 <= cb_end) + *(u16*)cb_pos = 0; + ntfs_log_debug("Successfully read the compression block.\n"); + if (ntfs_decompress(dest, cb_size, cb, cb_size) < 0) { + err = errno; + free(cb); + free(dest); + if (total) + return total; + errno = err; + return -1; + } + to_read = min(count, cb_size - ofs); + memcpy(b, dest + ofs, to_read); + total += to_read; + count -= to_read; + b = (u8*)b + to_read; + ofs = 0; + } + /* Do we have more work to do? */ + if (nr_cbs) + goto do_next_cb; + /* We no longer need the buffers. */ + free(cb); + free(dest); + /* Return number of bytes read. */ + return total + total2; +} + +/* + * Read data from a set of clusters + * + * Returns the amount of data read + */ + +static u32 read_clusters(ntfs_volume *vol, const runlist_element *rl, + s64 offs, u32 to_read, char *inbuf) +{ + u32 count; + int xgot; + u32 got; + s64 xpos; + BOOL first; + char *xinbuf; + const runlist_element *xrl; + + got = 0; + xrl = rl; + xinbuf = inbuf; + first = TRUE; + do { + count = xrl->length << vol->cluster_size_bits; + xpos = xrl->lcn << vol->cluster_size_bits; + if (first) { + count -= offs; + xpos += offs; + } + if ((to_read - got) < count) + count = to_read - got; + xgot = ntfs_pread(vol->dev, xpos, count, xinbuf); + if (xgot == (int)count) { + got += count; + xpos += count; + xinbuf += count; + xrl++; + } + first = FALSE; + } while ((xgot == (int)count) && (got < to_read)); + return (got); +} + +/* + * Write data to a set of clusters + * + * Returns the amount of data written + */ + +static s32 write_clusters(ntfs_volume *vol, const runlist_element *rl, + s64 offs, s32 to_write, const char *outbuf) +{ + s32 count; + s32 put, xput; + s64 xpos; + BOOL first; + const char *xoutbuf; + const runlist_element *xrl; + + put = 0; + xrl = rl; + xoutbuf = outbuf; + first = TRUE; + do { + count = xrl->length << vol->cluster_size_bits; + xpos = xrl->lcn << vol->cluster_size_bits; + if (first) { + count -= offs; + xpos += offs; + } + if ((to_write - put) < count) + count = to_write - put; + xput = ntfs_pwrite(vol->dev, xpos, count, xoutbuf); + if (xput == count) { + put += count; + xpos += count; + xoutbuf += count; + xrl++; + } + first = FALSE; + } while ((xput == count) && (put < to_write)); + return (put); +} + + +/* + * Compress and write a set of blocks + * + * returns the size actually written (rounded to a full cluster) + * or 0 if all zeroes (nothing is written) + * or -1 if could not compress (nothing is written) + * or -2 if there were an irrecoverable error (errno set) + */ + +static s32 ntfs_comp_set(ntfs_attr *na, runlist_element *rl, + s64 offs, u32 insz, const char *inbuf) +{ + ntfs_volume *vol; + char *outbuf; + char *pbuf; + u32 compsz; + s32 written; + s32 rounded; + unsigned int clsz; + u32 p; + unsigned int sz; + unsigned int bsz; + BOOL fail; + BOOL allzeroes; + /* a single compressed zero */ + static char onezero[] = { 0x01, 0xb0, 0x00, 0x00 } ; + /* a couple of compressed zeroes */ + static char twozeroes[] = { 0x02, 0xb0, 0x00, 0x00, 0x00 } ; + /* more compressed zeroes, to be followed by some count */ + static char morezeroes[] = { 0x03, 0xb0, 0x02, 0x00 } ; + + vol = na->ni->vol; + written = -1; /* default return */ + clsz = 1 << vol->cluster_size_bits; + /* may need 2 extra bytes per block and 2 more bytes */ + outbuf = (char*)ntfs_malloc(na->compression_block_size + + 2*(na->compression_block_size/NTFS_SB_SIZE) + + 2); + if (outbuf) { + fail = FALSE; + compsz = 0; + allzeroes = TRUE; + for (p=0; (p<insz) && !fail; p+=NTFS_SB_SIZE) { + if ((p + NTFS_SB_SIZE) < insz) + bsz = NTFS_SB_SIZE; + else + bsz = insz - p; + pbuf = &outbuf[compsz]; + sz = ntfs_compress_block(&inbuf[p],bsz,pbuf); + /* fail if all the clusters (or more) are needed */ + if (!sz || ((compsz + sz + clsz + 2) + > na->compression_block_size)) + fail = TRUE; + else { + if (allzeroes) { + /* check whether this is all zeroes */ + switch (sz) { + case 4 : + allzeroes = !memcmp( + pbuf,onezero,4); + break; + case 5 : + allzeroes = !memcmp( + pbuf,twozeroes,5); + break; + case 6 : + allzeroes = !memcmp( + pbuf,morezeroes,4); + break; + default : + allzeroes = FALSE; + break; + } + } + compsz += sz; + } + } + if (!fail && !allzeroes) { + /* add a couple of null bytes, space has been checked */ + outbuf[compsz++] = 0; + outbuf[compsz++] = 0; + /* write a full cluster, to avoid partial reading */ + rounded = ((compsz - 1) | (clsz - 1)) + 1; + written = write_clusters(vol, rl, offs, rounded, outbuf); + if (written != rounded) { + /* + * TODO : previously written text has been + * spoilt, should return a specific error + */ + ntfs_log_error("error writing compressed data\n"); + errno = EIO; + written = -2; + } + } else + if (!fail) + written = 0; + free(outbuf); + } + return (written); +} + +/* + * Check the validity of a compressed runlist + * The check starts at the beginning of current run and ends + * at the end of runlist + * errno is set if the runlist is not valid + */ + +static BOOL valid_compressed_run(ntfs_attr *na, runlist_element *rl, + BOOL fullcheck, const char *text) +{ + runlist_element *xrl; + const char *err; + BOOL ok = TRUE; + + xrl = rl; + while (xrl->vcn & (na->compression_block_clusters - 1)) + xrl--; + err = (const char*)NULL; + while (xrl->length) { + if ((xrl->vcn + xrl->length) != xrl[1].vcn) + err = "Runs not adjacent"; + if (xrl->lcn == LCN_HOLE) { + if ((xrl->vcn + xrl->length) + & (na->compression_block_clusters - 1)) { + err = "Invalid hole"; + } + if (fullcheck && (xrl[1].lcn == LCN_HOLE)) { + err = "Adjacent holes"; + } + } + if (err) { + ntfs_log_error("%s at %s index %ld inode %lld\n", + err, text, (long)(xrl - na->rl), + (long long)na->ni->mft_no); + errno = EIO; + ok = FALSE; + err = (const char*)NULL; + } + xrl++; + } + return (ok); +} + +/* + * Free unneeded clusters after overwriting compressed data + * + * This generally requires one or two empty slots at the end of runlist, + * but we do not want to reallocate the runlist here because + * there are many pointers to it. + * So the empty slots have to be reserved beforehand + * + * Returns zero unless some error occurred (described by errno) + * + * +======= start of block =====+ + * 0 |A chunk may overflow | <-- rl usedcnt : A + B + * |A on previous block | then B + * |A | + * +-- end of allocated chunk --+ freelength : C + * |B | (incl overflow) + * +== end of compressed data ==+ + * |C | <-- freerl freecnt : C + D + * |C chunk may overflow | + * |C on next block | + * +-- end of allocated chunk --+ + * |D | + * |D chunk may overflow | + * 15 |D on next block | + * +======== end of block ======+ + * + */ + +static int ntfs_compress_overwr_free(ntfs_attr *na, runlist_element *rl, + s32 usedcnt, s32 freecnt, VCN *update_from) +{ + BOOL beginhole; + BOOL mergeholes; + s32 oldlength; + s32 freelength; + s64 freelcn; + s64 freevcn; + runlist_element *freerl; + ntfs_volume *vol; + s32 carry; + int res; + + vol = na->ni->vol; + res = 0; + freelcn = rl->lcn + usedcnt; + freevcn = rl->vcn + usedcnt; + freelength = rl->length - usedcnt; + beginhole = !usedcnt && !rl->vcn; + /* can merge with hole before ? */ + mergeholes = !usedcnt + && rl[0].vcn + && (rl[-1].lcn == LCN_HOLE); + /* truncate current run, carry to subsequent hole */ + carry = freelength; + oldlength = rl->length; + if (mergeholes) { + /* merging with a hole before */ + freerl = rl; + } else { + rl->length -= freelength; /* warning : can be zero */ + freerl = ++rl; + } + if (!mergeholes && (usedcnt || beginhole)) { + s32 freed; + runlist_element *frl; + runlist_element *erl; + int holes = 0; + BOOL threeparts; + + /* free the unneeded clusters from initial run, then freerl */ + threeparts = (freelength > freecnt); + freed = 0; + frl = freerl; + if (freelength) { + res = ntfs_cluster_free_basic(vol,freelcn, + (threeparts ? freecnt : freelength)); + if (!res) + freed += (threeparts ? freecnt : freelength); + if (!usedcnt) { + holes++; + freerl--; + freerl->length += (threeparts + ? freecnt : freelength); + if (freerl->vcn < *update_from) + *update_from = freerl->vcn; + } + } + while (!res && frl->length && (freed < freecnt)) { + if (frl->length <= (freecnt - freed)) { + res = ntfs_cluster_free_basic(vol, frl->lcn, + frl->length); + if (!res) { + freed += frl->length; + frl->lcn = LCN_HOLE; + frl->length += carry; + carry = 0; + holes++; + } + } else { + res = ntfs_cluster_free_basic(vol, frl->lcn, + freecnt - freed); + if (!res) { + frl->lcn += freecnt - freed; + frl->vcn += freecnt - freed; + frl->length -= freecnt - freed; + freed = freecnt; + } + } + frl++; + } + na->compressed_size -= freed << vol->cluster_size_bits; + switch (holes) { + case 0 : + /* there are no hole, must insert one */ + /* space for hole has been prereserved */ + if (freerl->lcn == LCN_HOLE) { + if (threeparts) { + erl = freerl; + while (erl->length) + erl++; + do { + erl[2] = *erl; + } while (erl-- != freerl); + + freerl[1].length = freelength - freecnt; + freerl->length = freecnt; + freerl[1].lcn = freelcn + freecnt; + freerl[1].vcn = freevcn + freecnt; + freerl[2].lcn = LCN_HOLE; + freerl[2].vcn = freerl[1].vcn + + freerl[1].length; + freerl->vcn = freevcn; + } else { + freerl->vcn = freevcn; + freerl->length += freelength; + } + } else { + erl = freerl; + while (erl->length) + erl++; + if (threeparts) { + do { + erl[2] = *erl; + } while (erl-- != freerl); + freerl[1].lcn = freelcn + freecnt; + freerl[1].vcn = freevcn + freecnt; + freerl[1].length = oldlength - usedcnt - freecnt; + } else { + do { + erl[1] = *erl; + } while (erl-- != freerl); + } + freerl->lcn = LCN_HOLE; + freerl->vcn = freevcn; + freerl->length = freecnt; + } + break; + case 1 : + /* there is a single hole, may have to merge */ + freerl->vcn = freevcn; + freerl->length = freecnt; + if (freerl[1].lcn == LCN_HOLE) { + freerl->length += freerl[1].length; + erl = freerl; + do { + erl++; + *erl = erl[1]; + } while (erl->length); + } + break; + default : + /* there were several holes, must merge them */ + freerl->lcn = LCN_HOLE; + freerl->vcn = freevcn; + freerl->length = freecnt; + if (freerl[holes].lcn == LCN_HOLE) { + freerl->length += freerl[holes].length; + holes++; + } + erl = freerl; + do { + erl++; + *erl = erl[holes - 1]; + } while (erl->length); + break; + } + } else { + s32 freed; + runlist_element *frl; + runlist_element *xrl; + + freed = 0; + frl = freerl--; + if (freerl->vcn < *update_from) + *update_from = freerl->vcn; + while (!res && frl->length && (freed < freecnt)) { + if (frl->length <= (freecnt - freed)) { + freerl->length += frl->length; + freed += frl->length; + res = ntfs_cluster_free_basic(vol, frl->lcn, + frl->length); + frl++; + } else { + freerl->length += freecnt - freed; + res = ntfs_cluster_free_basic(vol, frl->lcn, + freecnt - freed); + frl->lcn += freecnt - freed; + frl->vcn += freecnt - freed; + frl->length -= freecnt - freed; + freed = freecnt; + } + } + /* remove unneded runlist entries */ + xrl = freerl; + /* group with next run if also a hole */ + if (frl->length && (frl->lcn == LCN_HOLE)) { + xrl->length += frl->length; + frl++; + } + while (frl->length) { + *++xrl = *frl++; + } + *++xrl = *frl; /* terminator */ + na->compressed_size -= freed << vol->cluster_size_bits; + } + return (res); +} + + +/* + * Free unneeded clusters after compression + * + * This generally requires one or two empty slots at the end of runlist, + * but we do not want to reallocate the runlist here because + * there are many pointers to it. + * So the empty slots have to be reserved beforehand + * + * Returns zero unless some error occurred (described by errno) + */ + +static int ntfs_compress_free(ntfs_attr *na, runlist_element *rl, + s64 used, s64 reserved, BOOL appending, + VCN *update_from) +{ + s32 freecnt; + s32 usedcnt; + int res; + s64 freelcn; + s64 freevcn; + s32 freelength; + BOOL mergeholes; + BOOL beginhole; + ntfs_volume *vol; + runlist_element *freerl; + + res = -1; /* default return */ + vol = na->ni->vol; + freecnt = (reserved - used) >> vol->cluster_size_bits; + usedcnt = (reserved >> vol->cluster_size_bits) - freecnt; + if (rl->vcn < *update_from) + *update_from = rl->vcn; + /* skip entries fully used, if any */ + while (rl->length && (rl->length < usedcnt)) { + usedcnt -= rl->length; /* must be > 0 */ + rl++; + } + if (rl->length) { + /* + * Splitting the current allocation block requires + * an extra runlist element to create the hole. + * The required entry has been prereserved when + * mapping the runlist. + */ + /* get the free part in initial run */ + freelcn = rl->lcn + usedcnt; + freevcn = rl->vcn + usedcnt; + /* new count of allocated clusters */ + if (!((freevcn + freecnt) + & (na->compression_block_clusters - 1))) { + if (!appending) + res = ntfs_compress_overwr_free(na,rl, + usedcnt,freecnt,update_from); + else { + freelength = rl->length - usedcnt; + beginhole = !usedcnt && !rl->vcn; + mergeholes = !usedcnt + && rl[0].vcn + && (rl[-1].lcn == LCN_HOLE); + if (mergeholes) { + s32 carry; + + /* shorten the runs which have free space */ + carry = freecnt; + freerl = rl; + while (freerl->length < carry) { + carry -= freerl->length; + freerl++; + } + freerl->length = carry; + freerl = rl; + } else { + rl->length = usedcnt; /* can be zero ? */ + freerl = ++rl; + } + if ((freelength > 0) + && !mergeholes + && (usedcnt || beginhole)) { + /* + * move the unused part to the end. Doing so, + * the vcn will be out of order. This does + * not harm, the vcn are meaningless now, and + * only the lcn are meaningful for freeing. + */ + /* locate current end */ + while (rl->length) + rl++; + /* new terminator relocated */ + rl[1].vcn = rl->vcn; + rl[1].lcn = LCN_ENOENT; + rl[1].length = 0; + /* hole, currently allocated */ + rl->vcn = freevcn; + rl->lcn = freelcn; + rl->length = freelength; + } else { + /* why is this different from the begin hole case ? */ + if ((freelength > 0) + && !mergeholes + && !usedcnt) { + freerl--; + freerl->length = freelength; + if (freerl->vcn < *update_from) + *update_from + = freerl->vcn; + } + } + /* free the hole */ + res = ntfs_cluster_free_from_rl(vol,freerl); + if (!res) { + na->compressed_size -= freecnt + << vol->cluster_size_bits; + if (mergeholes) { + /* merge with adjacent hole */ + freerl--; + freerl->length += freecnt; + } else { + if (beginhole) + freerl--; + /* mark hole as free */ + freerl->lcn = LCN_HOLE; + freerl->vcn = freevcn; + freerl->length = freecnt; + } + if (freerl->vcn < *update_from) + *update_from = freerl->vcn; + /* and set up the new end */ + freerl[1].lcn = LCN_ENOENT; + freerl[1].vcn = freevcn + freecnt; + freerl[1].length = 0; + } + } + } else { + ntfs_log_error("Bad end of a compression block set\n"); + errno = EIO; + } + } else { + ntfs_log_error("No cluster to free after compression\n"); + errno = EIO; + } + return (res); +} + +/* + * Read existing data, decompress and append buffer + * Do nothing if something fails + */ + +static int ntfs_read_append(ntfs_attr *na, const runlist_element *rl, + s64 offs, u32 compsz, s32 pos, BOOL appending, + char *outbuf, s64 to_write, const void *b) +{ + int fail = 1; + char *compbuf; + u32 decompsz; + u32 got; + + if (compsz == na->compression_block_size) { + /* if the full block was requested, it was a hole */ + memset(outbuf,0,compsz); + memcpy(&outbuf[pos],b,to_write); + fail = 0; + } else { + compbuf = (char*)ntfs_malloc(compsz); + if (compbuf) { + /* must align to full block for decompression */ + if (appending) + decompsz = ((pos - 1) | (NTFS_SB_SIZE - 1)) + 1; + else + decompsz = na->compression_block_size; + got = read_clusters(na->ni->vol, rl, offs, + compsz, compbuf); + if ((got == compsz) + && !ntfs_decompress((u8*)outbuf,decompsz, + (u8*)compbuf,compsz)) { + memcpy(&outbuf[pos],b,to_write); + fail = 0; + } + free(compbuf); + } + } + return (fail); +} + +/* + * Flush a full compression block + * + * returns the size actually written (rounded to a full cluster) + * or 0 if could not compress (and written uncompressed) + * or -1 if there were an irrecoverable error (errno set) + */ + +static int ntfs_flush(ntfs_attr *na, runlist_element *rl, s64 offs, + const char *outbuf, s32 count, BOOL compress, + BOOL appending, VCN *update_from) +{ + int rounded; + int written; + int clsz; + + if (compress) { + written = ntfs_comp_set(na, rl, offs, count, outbuf); + if (written == -1) + compress = FALSE; + if ((written >= 0) + && ntfs_compress_free(na,rl,offs + written, + offs + na->compression_block_size, appending, + update_from)) + written = -1; + } else + written = 0; + if (!compress) { + clsz = 1 << na->ni->vol->cluster_size_bits; + rounded = ((count - 1) | (clsz - 1)) + 1; + written = write_clusters(na->ni->vol, rl, + offs, rounded, outbuf); + if (written != rounded) + written = -1; + } + return (written); +} + +/* + * Write some data to be compressed. + * Compression only occurs when a few clusters (usually 16) are + * full. When this occurs an extra runlist slot may be needed, so + * it has to be reserved beforehand. + * + * Returns the size of uncompressed data written, + * or negative if an error occurred. + * When the returned size is less than requested, new clusters have + * to be allocated before the function is called again. + */ + +s64 ntfs_compressed_pwrite(ntfs_attr *na, runlist_element *wrl, s64 wpos, + s64 offs, s64 to_write, s64 rounded, + const void *b, int compressed_part, + VCN *update_from) +{ + ntfs_volume *vol; + runlist_element *brl; /* entry containing the beginning of block */ + int compression_length; + s64 written; + s64 to_read; + s64 to_flush; + s64 roffs; + s64 got; + s64 start_vcn; + s64 nextblock; + s64 endwrite; + u32 compsz; + char *inbuf; + char *outbuf; + BOOL fail; + BOOL done; + BOOL compress; + BOOL appending; + + if (!valid_compressed_run(na,wrl,FALSE,"begin compressed write")) { + return (-1); + } + if ((*update_from < 0) + || (compressed_part < 0) + || (compressed_part > (int)na->compression_block_clusters)) { + ntfs_log_error("Bad update vcn or compressed_part %d for compressed write\n", + compressed_part); + errno = EIO; + return (-1); + } + /* make sure there are two unused entries in runlist */ + if (na->unused_runs < 2) { + ntfs_log_error("No unused runs for compressed write\n"); + errno = EIO; + return (-1); + } + if (wrl->vcn < *update_from) + *update_from = wrl->vcn; + written = -1; /* default return */ + vol = na->ni->vol; + compression_length = na->compression_block_clusters; + compress = FALSE; + done = FALSE; + /* + * Cannot accept writing beyond the current compression set + * because when compression occurs, clusters are freed + * and have to be reallocated. + * (cannot happen with standard fuse 4K buffers) + * Caller has to avoid this situation, or face consequences. + */ + nextblock = ((offs + (wrl->vcn << vol->cluster_size_bits)) + | (na->compression_block_size - 1)) + 1; + /* determine whether we are appending to file */ + endwrite = offs + to_write + (wrl->vcn << vol->cluster_size_bits); + appending = endwrite >= na->initialized_size; + if (endwrite >= nextblock) { + /* it is time to compress */ + compress = TRUE; + /* only process what we can */ + to_write = rounded = nextblock + - (offs + (wrl->vcn << vol->cluster_size_bits)); + } + start_vcn = 0; + fail = FALSE; + brl = wrl; + roffs = 0; + /* + * If we are about to compress or we need to decompress + * existing data, we have to process a full set of blocks. + * So relocate the parameters to the beginning of allocation + * containing the first byte of the set of blocks. + */ + if (compress || compressed_part) { + /* find the beginning of block */ + start_vcn = (wrl->vcn + (offs >> vol->cluster_size_bits)) + & -compression_length; + if (start_vcn < *update_from) + *update_from = start_vcn; + while (brl->vcn && (brl->vcn > start_vcn)) { + /* jumping back a hole means big trouble */ + if (brl->lcn == (LCN)LCN_HOLE) { + ntfs_log_error("jump back over a hole when appending\n"); + fail = TRUE; + errno = EIO; + } + brl--; + offs += brl->length << vol->cluster_size_bits; + } + roffs = (start_vcn - brl->vcn) << vol->cluster_size_bits; + } + if (compressed_part && !fail) { + /* + * The set of compression blocks contains compressed data + * (we are reopening an existing file to append to it) + * Decompress the data and append + */ + compsz = compressed_part << vol->cluster_size_bits; + outbuf = (char*)ntfs_malloc(na->compression_block_size); + if (outbuf) { + if (appending) { + to_read = offs - roffs; + to_flush = to_read + to_write; + } else { + to_read = na->data_size + - (brl->vcn << vol->cluster_size_bits); + if (to_read > na->compression_block_size) + to_read = na->compression_block_size; + to_flush = to_read; + } + if (!ntfs_read_append(na, brl, roffs, compsz, + (s32)(offs - roffs), appending, + outbuf, to_write, b)) { + written = ntfs_flush(na, brl, roffs, + outbuf, to_flush, compress, appending, + update_from); + if (written >= 0) { + written = to_write; + done = TRUE; + } + } + free(outbuf); + } + } else { + if (compress && !fail) { + /* + * we are filling up a block, read the full set + * of blocks and compress it + */ + inbuf = (char*)ntfs_malloc(na->compression_block_size); + if (inbuf) { + to_read = offs - roffs; + if (to_read) + got = read_clusters(vol, brl, roffs, + to_read, inbuf); + else + got = 0; + if (got == to_read) { + memcpy(&inbuf[to_read],b,to_write); + written = ntfs_comp_set(na, brl, roffs, + to_read + to_write, inbuf); + /* + * if compression was not successful, + * only write the part which was requested + */ + if ((written >= 0) + /* free the unused clusters */ + && !ntfs_compress_free(na,brl, + written + roffs, + na->compression_block_size + + roffs, + appending, update_from)) { + done = TRUE; + written = to_write; + } + } + free(inbuf); + } + } + if (!done) { + /* + * if the compression block is not full, or + * if compression failed for whatever reason, + * write uncompressed + */ + /* check we are not overflowing current allocation */ + if ((wpos + rounded) + > ((wrl->lcn + wrl->length) + << vol->cluster_size_bits)) { + ntfs_log_error("writing on unallocated clusters\n"); + errno = EIO; + } else { + written = ntfs_pwrite(vol->dev, wpos, + rounded, b); + if (written == rounded) + written = to_write; + } + } + } + if ((written >= 0) + && !valid_compressed_run(na,wrl,TRUE,"end compressed write")) + written = -1; + return (written); +} + +/* + * Close a file written compressed. + * This compresses the last partial compression block of the file. + * Two empty runlist slots have to be reserved beforehand. + * + * Returns zero if closing is successful. + */ + +int ntfs_compressed_close(ntfs_attr *na, runlist_element *wrl, s64 offs, + VCN *update_from) +{ + ntfs_volume *vol; + runlist_element *brl; /* entry containing the beginning of block */ + int compression_length; + s64 written; + s64 to_read; + s64 roffs; + s64 got; + s64 start_vcn; + char *inbuf; + BOOL fail; + BOOL done; + + if (na->unused_runs < 2) { + ntfs_log_error("No unused runs for compressed close\n"); + errno = EIO; + return (-1); + } + if (*update_from < 0) { + ntfs_log_error("Bad update vcn for compressed close\n"); + errno = EIO; + return (-1); + } + if (wrl->vcn < *update_from) + *update_from = wrl->vcn; + vol = na->ni->vol; + compression_length = na->compression_block_clusters; + done = FALSE; + /* + * There generally is an uncompressed block at end of file, + * read the full block and compress it + */ + inbuf = (char*)ntfs_malloc(na->compression_block_size); + if (inbuf) { + start_vcn = (wrl->vcn + (offs >> vol->cluster_size_bits)) + & -compression_length; + if (start_vcn < *update_from) + *update_from = start_vcn; + to_read = offs + ((wrl->vcn - start_vcn) + << vol->cluster_size_bits); + brl = wrl; + fail = FALSE; + while (brl->vcn && (brl->vcn > start_vcn)) { + if (brl->lcn == (LCN)LCN_HOLE) { + ntfs_log_error("jump back over a hole when closing\n"); + fail = TRUE; + errno = EIO; + } + brl--; + } + if (!fail) { + /* roffs can be an offset from another uncomp block */ + roffs = (start_vcn - brl->vcn) + << vol->cluster_size_bits; + if (to_read) { + got = read_clusters(vol, brl, roffs, to_read, + inbuf); + if (got == to_read) { + written = ntfs_comp_set(na, brl, roffs, + to_read, inbuf); + if ((written >= 0) + /* free the unused clusters */ + && !ntfs_compress_free(na,brl, + written + roffs, + na->compression_block_size + roffs, + TRUE, update_from)) { + done = TRUE; + } else + /* if compression failed, leave uncompressed */ + if (written == -1) + done = TRUE; + } + } else + done = TRUE; + free(inbuf); + } + } + if (done && !valid_compressed_run(na,wrl,TRUE,"end compressed close")) + done = FALSE; + return (!done); +} diff --git a/portlibs/sources/libntfs/compress.h b/portlibs/sources/libntfs/compress.h new file mode 100644 index 00000000..c2569321 --- /dev/null +++ b/portlibs/sources/libntfs/compress.h @@ -0,0 +1,41 @@ +/* + * compress.h - Exports for compressed attribute handling. + * Originated from the Linux-NTFS project. + * + * Copyright (c) 2004 Anton Altaparmakov + * + * 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 + */ + +#ifndef _NTFS_COMPRESS_H +#define _NTFS_COMPRESS_H + +#include "types.h" +#include "attrib.h" + +extern s64 ntfs_compressed_attr_pread(ntfs_attr *na, s64 pos, s64 count, + void *b); + +extern s64 ntfs_compressed_pwrite(ntfs_attr *na, runlist_element *brl, s64 wpos, + s64 offs, s64 to_write, s64 rounded, + const void *b, int compressed_part, + VCN *update_from); + +extern int ntfs_compressed_close(ntfs_attr *na, runlist_element *brl, + s64 offs, VCN *update_from); + +#endif /* defined _NTFS_COMPRESS_H */ + diff --git a/portlibs/sources/libntfs/config.h b/portlibs/sources/libntfs/config.h new file mode 100644 index 00000000..a0a5da00 --- /dev/null +++ b/portlibs/sources/libntfs/config.h @@ -0,0 +1,388 @@ +/* config.h.in. Generated from configure.ac by autoheader. */ + +/* Define this to 1 if you want to enable support of encrypted files in + libntfs and utilities. */ +#undef ENABLE_CRYPTO + +/* Define to 1 if debug should be enabled */ +#undef ENABLE_DEBUG + +/* Define to 1 if the nfconv patch should be enabled */ +#undef ENABLE_NFCONV + +/* Define this to 1 if you want to enable generation of DCE compliant UUIDs. + */ +#undef ENABLE_UUID + +/* Define to 1 if using internal fuse */ +#undef FUSE_INTERNAL + +/* Define to 1 if you have the `atexit' function. */ +#define HAVE_ATEXIT 1 + +/* Define to 1 if you have the `basename' function. */ +#undef HAVE_BASENAME + +/* Define to 1 if you have the <byteswap.h> header file. */ +#undef HAVE_BYTESWAP_H + +/* Define to 1 if you have the `clock_gettime' function. */ +#undef HAVE_CLOCK_GETTIME + +/* Define to 1 if you have the <ctype.h> header file. */ +#define HAVE_CTYPE_H 1 + +/* Define to 1 if you have the `daemon' function. */ +#undef HAVE_DAEMON + +/* Define to 1 if you have the <dlfcn.h> header file. */ +#undef HAVE_DLFCN_H + +/* Define to 1 if you don't have `vprintf' but do have `_doprnt.' */ +#undef HAVE_DOPRNT + +/* Define to 1 if you have the `dup2' function. */ +#undef HAVE_DUP2 + +/* Define to 1 if you have the <endian.h> header file. */ +#undef HAVE_ENDIAN_H + +/* Define to 1 if you have the <errno.h> header file. */ +#define HAVE_ERRNO_H 1 + +/* Define to 1 if you have the <fcntl.h> header file. */ +#define HAVE_FCNTL_H 1 + +/* Define to 1 if you have the `fdatasync' function. */ +#undef HAVE_FDATASYNC + +/* Define to 1 if you have the <features.h> header file. */ +#undef HAVE_FEATURES_H + +/* Define to 1 if you have the `ffs' function. */ +#define HAVE_FFS 1 + +/* Define to 1 if you have the `fork' function. */ +#define HAVE_FORK 1 + +/* Define to 1 if you have the `getmntent' function. */ +#undef HAVE_GETMNTENT + +/* Define to 1 if you have the <getopt.h> header file. */ +#define HAVE_GETOPT_H 1 + +/* Define to 1 if you have the `getopt_long' function. */ +#define HAVE_GETOPT_LONG 1 + +/* Define to 1 if you have the `gettimeofday' function. */ +#undef HAVE_GETTIMEOFDAY + +/* Define to 1 if you have the `hasmntopt' function. */ +#undef HAVE_HASMNTOPT + +/* Define to 1 if you have the <inttypes.h> header file. */ +#define HAVE_INTTYPES_H 1 + +/* Define to 1 if you have the <libgen.h> header file. */ +#define HAVE_LIBGEN_H 1 + +/* Define to 1 if you have the <libintl.h> header file. */ +#undef HAVE_LIBINTL_H + +/* Define to 1 if you have the <limits.h> header file. */ +#define HAVE_LIMITS_H 1 + +/* Define to 1 if you have the <linux/fd.h> header file. */ +#undef HAVE_LINUX_FD_H + +/* Define to 1 if you have the <linux/hdreg.h> header file. */ +#undef HAVE_LINUX_HDREG_H + +/* Define to 1 if you have the <linux/major.h> header file. */ +#undef HAVE_LINUX_MAJOR_H + +/* Define to 1 if you have the <locale.h> header file. */ +#define HAVE_LOCALE_H 1 + +/* Define to 1 if you have the <machine/endian.h> header file. */ +#define HAVE_MACHINE_ENDIAN_H 1 + +/* Define to 1 if you have the <math.h> header file. */ +#define HAVE_MATH_H 1 + +/* Define to 1 if mbrtowc and mbstate_t are properly declared. */ +#define HAVE_MBRTOWC 1 + +/* Define to 1 if you have the `mbsinit' function. */ +#define HAVE_MBSINIT 1 + +/* Define to 1 if you have the `memmove' function. */ +#define HAVE_MEMMOVE 1 + +/* Define to 1 if you have the <memory.h> header file. */ +#undef HAVE_MEMORY_H + +/* Define to 1 if you have the `memset' function. */ +#define HAVE_MEMSET 1 + +/* Define to 1 if you have the <mntent.h> header file. */ +#undef HAVE_MNTENT_H + +/* Define to 1 if you have the <pwd.h> header file. */ +#define HAVE_PWD_H 1 + +/* Define to 1 if you have the `realpath' function. */ +#undef HAVE_REALPATH + +/* Define to 1 if you have the `regcomp' function. */ +#undef HAVE_REGCOMP + +/* Define to 1 if you have the `setlocale' function. */ +#define HAVE_SETLOCALE 1 + +/* Define to 1 if you have the `setxattr' function. */ +#undef HAVE_SETXATTR + +/* Define to 1 if `stat' has the bug that it succeeds when given the + zero-length file name argument. */ +#define HAVE_STAT_EMPTY_STRING_BUG 1 + +/* Define to 1 if you have the <stdarg.h> header file. */ +#define HAVE_STDARG_H 1 + +/* Define to 1 if stdbool.h conforms to C99. */ +#define HAVE_STDBOOL_H 1 + +/* Define to 1 if you have the <stddef.h> header file. */ +#define HAVE_STDDEF_H 1 + +/* Define to 1 if you have the <stdint.h> header file. */ +#define HAVE_STDINT_H 1 + +/* Define to 1 if you have the <stdio.h> header file. */ +#define HAVE_STDIO_H 1 + +/* Define to 1 if you have the <stdlib.h> header file. */ +#define HAVE_STDLIB_H 1 + +/* Define to 1 if you have the `strcasecmp' function. */ +#define HAVE_STRCASECMP 1 + +/* Define to 1 if you have the `strchr' function. */ +#define HAVE_STRCHR 1 + +/* Define to 1 if you have the `strdup' function. */ +#define HAVE_STRDUP 1 + +/* Define to 1 if you have the `strerror' function. */ +#define HAVE_STRERROR 1 + +/* Define to 1 if you have the `strftime' function. */ +#define HAVE_STRFTIME 1 + +/* Define to 1 if you have the <strings.h> header file. */ +#undef HAVE_STRINGS_H + +/* Define to 1 if you have the <string.h> header file. */ +#define HAVE_STRING_H 1 + +/* Define to 1 if you have the `strnlen' function. */ +#define HAVE_STRNLEN 1 + +/* Define to 1 if you have the `strsep' function. */ +#define HAVE_STRSEP 1 + +/* Define to 1 if you have the `strtol' function. */ +#define HAVE_STRTOL 1 + +/* Define to 1 if you have the `strtoul' function. */ +#define HAVE_STRTOUL 1 + +/* Define to 1 if `st_atim' is member of `struct stat'. */ +#undef HAVE_STRUCT_STAT_ST_ATIM + +/* Define to 1 if `st_atimensec' is member of `struct stat'. */ +#undef HAVE_STRUCT_STAT_ST_ATIMENSEC + +/* Define to 1 if `st_atimespec' is member of `struct stat'. */ +#undef HAVE_STRUCT_STAT_ST_ATIMESPEC + +/* Define to 1 if `st_blocks' is member of `struct stat'. */ +#undef HAVE_STRUCT_STAT_ST_BLOCKS + +/* Define to 1 if `st_rdev' is member of `struct stat'. */ +#undef HAVE_STRUCT_STAT_ST_RDEV + +/* Define to 1 if your `struct stat' has `st_blocks'. Deprecated, use + `HAVE_STRUCT_STAT_ST_BLOCKS' instead. */ +#undef HAVE_ST_BLOCKS + +/* Define to 1 if you have the `sysconf' function. */ +#define HAVE_SYSCONF 1 + +/* Define to 1 if you have the <syslog.h> header file. */ +#undef HAVE_SYSLOG_H + +/* Define to 1 if you have the <sys/byteorder.h> header file. */ +#undef HAVE_SYS_BYTEORDER_H + +/* Define to 1 if you have the <sys/endian.h> header file. */ +#undef HAVE_SYS_ENDIAN_H + +/* Define to 1 if you have the <sys/ioctl.h> header file. */ +#undef HAVE_SYS_IOCTL_H + +/* Define to 1 if you have the <sys/mkdev.h> header file. */ +#undef HAVE_SYS_MKDEV_H + +/* Define to 1 if you have the <sys/mount.h> header file. */ +#undef HAVE_SYS_MOUNT_H + +/* Define to 1 if you have the <sys/param.h> header file. */ +#define HAVE_SYS_PARAM_H 1 + +/* Define to 1 if you have the <sys/statvfs.h> header file. */ +#define HAVE_SYS_STATVFS_H 1 + +/* Define to 1 if you have the <sys/stat.h> header file. */ +#define HAVE_SYS_STAT_H 1 + +/* Define to 1 if you have the <sys/sysmacros.h> header file. */ +#undef HAVE_SYS_SYSMACROS_H + +/* Define to 1 if you have the <sys/types.h> header file. */ +#define HAVE_SYS_TYPES_H 1 + +/* Define to 1 if you have the <sys/vfs.h> header file. */ +#undef HAVE_SYS_VFS_H + +/* Define to 1 if you have the <time.h> header file. */ +#define HAVE_TIME_H 1 + +/* Define to 1 if you have the <unistd.h> header file. */ +#define HAVE_UNISTD_H 1 + +/* Define to 1 if you have the `utime' function. */ +#undef HAVE_UTIME + +/* Define to 1 if you have the `utimensat' function. */ +#undef HAVE_UTIMENSAT + +/* Define to 1 if you have the <utime.h> header file. */ +#define HAVE_UTIME_H 1 + +/* Define to 1 if `utime(file, NULL)' sets file's timestamp to the present. */ +#undef HAVE_UTIME_NULL + +/* Define to 1 if you have the `vprintf' function. */ +#define HAVE_VPRINTF 1 + +/* Define to 1 if you have the <wchar.h> header file. */ +#define HAVE_WCHAR_H 1 + +/* Define to 1 if you have the <windows.h> header file. */ +#undef HAVE_WINDOWS_H + +/* Define to 1 if the system has the type `_Bool'. */ +#undef HAVE__BOOL + +/* Don't update /etc/mtab */ +#undef IGNORE_MTAB + +/* Define to 1 if `lstat' dereferences a symlink specified with a trailing + slash. */ +#undef LSTAT_FOLLOWS_SLASHED_SYMLINK + +/* Define to 1 if your C compiler doesn't accept -c and -o together. */ +#undef NO_MINUS_C_MINUS_O + +/* Don't use default IO ops */ +#undef NO_NTFS_DEVICE_DEFAULT_IO_OPS + +/* Name of package */ +#define PACKAGE "ntfs-3g" + +/* Define to the address where bug reports for this package should be sent. */ +#define PACKAGE_BUGREPORT "ntfs-3g-devel@lists.sf.net" + +/* Define to the full name of this package. */ +#define PACKAGE_NAME "ntfs-3g" + +/* Define to the full name and version of this package. */ +#define PACKAGE_STRING "ntfs-3g 2011.4.12" + +/* Define to the one symbol short name of this package. */ +#define PACKAGE_TARNAME "ntfs-3g" + +/* Define to the version of this package. */ +#define PACKAGE_VERSION "2011.4.12" + +/* POSIX ACL support */ +#undef POSIXACLS + +/* Define to 1 if you have the ANSI C header files. */ +#define STDC_HEADERS 1 + +/* Enable extensions on AIX 3, Interix. */ +#ifndef _ALL_SOURCE +# define _ALL_SOURCE 1 +#endif +/* Enable GNU extensions on systems that have them. */ +#ifndef _GNU_SOURCE +# define _GNU_SOURCE 1 +#endif +/* Enable threading extensions on Solaris. */ +#ifndef _POSIX_PTHREAD_SEMANTICS +# define _POSIX_PTHREAD_SEMANTICS 1 +#endif +/* Enable extensions on HP NonStop. */ +#ifndef _TANDEM_SOURCE +# define _TANDEM_SOURCE 1 +#endif +/* Enable general extensions on Solaris. */ +#ifndef __EXTENSIONS__ +# define __EXTENSIONS__ 1 +#endif + +/* Version number of package */ +#define VERSION "2011.4.12" + +/* Define to 1 if this is a Windows OS */ +#undef WINDOWS + +/* Define to 1 if your processor stores words with the most significant byte + first (like Motorola and SPARC, unlike Intel and VAX). */ +#define WORDS_BIGENDIAN 1 + +/* Define to 1 if your processor stores words with the least significant byte + first (like Intel and VAX, unlike Motorola and SPARC). */ +#undef WORDS_LITTLEENDIAN + +/* system extended attributes mappings */ +#undef XATTR_MAPPINGS + +/* Number of bits in a file offset, on hosts where this is settable. */ +#define _FILE_OFFSET_BITS 64 + +/* Enable GNU extensions on systems that have them. */ +#ifndef _GNU_SOURCE +# undef _GNU_SOURCE +#endif + +/* Define for large files, on AIX-style hosts. */ +#define _LARGE_FILES 1 + +/* Required define if using POSIX threads */ +#undef _REENTRANT + +/* Define to `__inline__' or `__inline' if that's what the C compiler + calls it, or to nothing if 'inline' is not supported under any name. */ +#ifndef __cplusplus +#define inline __inline__ +#endif + +/* Define to `long int' if <sys/types.h> does not define. */ +#undef off_t + +/* Define to `unsigned int' if <sys/types.h> does not define. */ +#undef size_t diff --git a/portlibs/sources/libntfs/debug.c b/portlibs/sources/libntfs/debug.c new file mode 100644 index 00000000..f1934833 --- /dev/null +++ b/portlibs/sources/libntfs/debug.c @@ -0,0 +1,79 @@ +/** + * debug.c - Debugging output functions. Originated from the Linux-NTFS project. + * + * Copyright (c) 2002-2004 Anton Altaparmakov + * Copyright (c) 2004-2006 Szabolcs Szakacsits + * + * 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_ERRNO_H +#include <errno.h> +#endif + +#include "types.h" +#include "runlist.h" +#include "debug.h" +#include "logging.h" + +#ifdef DEBUG +/** + * ntfs_debug_runlist_dump - Dump a runlist. + * @rl: + * + * Description... + * + * Returns: + */ +void ntfs_debug_runlist_dump(const runlist_element *rl) +{ + int i = 0; + const char *lcn_str[5] = { "LCN_HOLE ", "LCN_RL_NOT_MAPPED", + "LCN_ENOENT ", "LCN_EINVAL ", + "LCN_unknown " }; + + ntfs_log_debug("NTFS-fs DEBUG: Dumping runlist (values in hex):\n"); + if (!rl) { + ntfs_log_debug("Run list not present.\n"); + return; + } + ntfs_log_debug("VCN LCN Run length\n"); + do { + LCN lcn = (rl + i)->lcn; + + if (lcn < (LCN)0) { + int idx = -lcn - 1; + + if (idx > -LCN_EINVAL - 1) + idx = 4; + ntfs_log_debug("%-16lld %s %-16lld%s\n", + (long long)rl[i].vcn, lcn_str[idx], + (long long)rl[i].length, + rl[i].length ? "" : " (runlist end)"); + } else + ntfs_log_debug("%-16lld %-16lld %-16lld%s\n", + (long long)rl[i].vcn, (long long)rl[i].lcn, + (long long)rl[i].length, + rl[i].length ? "" : " (runlist end)"); + } while (rl[i++].length); +} + +#endif + diff --git a/portlibs/sources/libntfs/debug.h b/portlibs/sources/libntfs/debug.h new file mode 100644 index 00000000..cf39b625 --- /dev/null +++ b/portlibs/sources/libntfs/debug.h @@ -0,0 +1,47 @@ +/* + * debug.h - Debugging output functions. Originated from the Linux-NTFS project. + * + * Copyright (c) 2002-2004 Anton Altaparmakov + * + * 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 + */ + +#ifndef _NTFS_DEBUG_H +#define _NTFS_DEBUG_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "logging.h" + +struct _runlist_element; + +#ifdef DEBUG +extern void ntfs_debug_runlist_dump(const struct _runlist_element *rl); +#else +static __inline__ void ntfs_debug_runlist_dump(const struct _runlist_element *rl __attribute__((unused))) {} +#endif + +#define NTFS_BUG(msg) \ +{ \ + int ___i; \ + ntfs_log_critical("Bug in %s(): %s\n", __FUNCTION__, msg); \ + ntfs_log_debug("Forcing segmentation fault!"); \ + ___i = ((int*)NULL)[1]; \ +} + +#endif /* defined _NTFS_DEBUG_H */ diff --git a/portlibs/sources/libntfs/device.c b/portlibs/sources/libntfs/device.c new file mode 100644 index 00000000..db840108 --- /dev/null +++ b/portlibs/sources/libntfs/device.c @@ -0,0 +1,753 @@ +/** + * device.c - Low level device io functions. Originated from the Linux-NTFS project. + * + * Copyright (c) 2004-2006 Anton Altaparmakov + * Copyright (c) 2004-2006 Szabolcs Szakacsits + * Copyright (c) 2010 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_UNISTD_H +#include <unistd.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif +#ifdef HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#ifdef HAVE_FCNTL_H +#include <fcntl.h> +#endif +#ifdef HAVE_SYS_IOCTL_H +#include <sys/ioctl.h> +#endif +#ifdef HAVE_SYS_PARAM_H +#include <sys/param.h> +#endif +#ifdef HAVE_SYS_MOUNT_H +#include <sys/mount.h> +#endif +#ifdef HAVE_LINUX_FD_H +#include <linux/fd.h> +#endif +#ifdef HAVE_LINUX_HDREG_H +#include <linux/hdreg.h> +#endif + +#include "types.h" +#include "mst.h" +#include "debug.h" +#include "device.h" +#include "logging.h" +#include "misc.h" + +#if defined(linux) && defined(_IO) && !defined(BLKGETSIZE) +#define BLKGETSIZE _IO(0x12,96) /* Get device size in 512-byte blocks. */ +#endif +#if defined(linux) && defined(_IOR) && !defined(BLKGETSIZE64) +#define BLKGETSIZE64 _IOR(0x12,114,size_t) /* Get device size in bytes. */ +#endif +#if defined(linux) && !defined(HDIO_GETGEO) +#define HDIO_GETGEO 0x0301 /* Get device geometry. */ +#endif +#if defined(linux) && defined(_IO) && !defined(BLKSSZGET) +# define BLKSSZGET _IO(0x12,104) /* Get device sector size in bytes. */ +#endif +#if defined(linux) && defined(_IO) && !defined(BLKBSZSET) +# define BLKBSZSET _IOW(0x12,113,size_t) /* Set device block size in bytes. */ +#endif + +/** + * ntfs_device_alloc - allocate an ntfs device structure and pre-initialize it + * @name: name of the device (must be present) + * @state: initial device state (usually zero) + * @dops: ntfs device operations to use with the device (must be present) + * @priv_data: pointer to private data (optional) + * + * Allocate an ntfs device structure and pre-initialize it with the user- + * specified device operations @dops, device state @state, device name @name, + * and optional private data @priv_data. + * + * Note, @name is copied and can hence be freed after this functions returns. + * + * On success return a pointer to the allocated ntfs device structure and on + * error return NULL with errno set to the error code returned by ntfs_malloc(). + */ +struct ntfs_device *ntfs_device_alloc(const char *name, const long state, + struct ntfs_device_operations *dops, void *priv_data) +{ + struct ntfs_device *dev; + + if (!name) { + errno = EINVAL; + return NULL; + } + + dev = ntfs_malloc(sizeof(struct ntfs_device)); + if (dev) { + if (!(dev->d_name = strdup(name))) { + int eo = errno; + free(dev); + errno = eo; + return NULL; + } + dev->d_ops = dops; + dev->d_state = state; + dev->d_private = priv_data; + } + return dev; +} + +/** + * ntfs_device_free - free an ntfs device structure + * @dev: ntfs device structure to free + * + * Free the ntfs device structure @dev. + * + * Return 0 on success or -1 on error with errno set to the error code. The + * following error codes are defined: + * EINVAL Invalid pointer @dev. + * EBUSY Device is still open. Close it before freeing it! + */ +int ntfs_device_free(struct ntfs_device *dev) +{ + if (!dev) { + errno = EINVAL; + return -1; + } + if (NDevOpen(dev)) { + errno = EBUSY; + return -1; + } + free(dev->d_name); + free(dev); + return 0; +} + +/* + * Sync the device + * + * returns zero if successful. + */ + +int ntfs_device_sync(struct ntfs_device *dev) +{ + int ret; + struct ntfs_device_operations *dops; + + if (NDevDirty(dev)) { + dops = dev->d_ops; + ret = dops->sync(dev); + } else + ret = 0; + return ret; +} + +/** + * ntfs_pread - positioned read from disk + * @dev: device to read from + * @pos: position in device to read from + * @count: number of bytes to read + * @b: output data buffer + * + * This function will read @count bytes from device @dev at position @pos into + * the data buffer @b. + * + * On success, return the number of successfully read bytes. If this number is + * lower than @count this means that we have either reached end of file or + * encountered an error during the read so that the read is partial. 0 means + * end of file or nothing to read (@count is 0). + * + * On error and nothing has been read, return -1 with errno set appropriately + * to the return code of either seek, read, or set to EINVAL in case of + * invalid arguments. + */ +s64 ntfs_pread(struct ntfs_device *dev, const s64 pos, s64 count, void *b) +{ + s64 br, total; + struct ntfs_device_operations *dops; + + ntfs_log_trace("pos %lld, count %lld\n",(long long)pos,(long long)count); + + if (!b || count < 0 || pos < 0) { + errno = EINVAL; + return -1; + } + if (!count) + return 0; + + dops = dev->d_ops; + + for (total = 0; count; count -= br, total += br) { + br = dops->pread(dev, (char*)b + total, count, pos + total); + /* If everything ok, continue. */ + if (br > 0) + continue; + /* If EOF or error return number of bytes read. */ + if (!br || total) + return total; + /* Nothing read and error, return error status. */ + return br; + } + /* Finally, return the number of bytes read. */ + return total; +} + +/** + * ntfs_pwrite - positioned write to disk + * @dev: device to write to + * @pos: position in file descriptor to write to + * @count: number of bytes to write + * @b: data buffer to write to disk + * + * This function will write @count bytes from data buffer @b to the device @dev + * at position @pos. + * + * On success, return the number of successfully written bytes. If this number + * is lower than @count this means that the write has been interrupted in + * flight or that an error was encountered during the write so that the write + * is partial. 0 means nothing was written (also return 0 when @count is 0). + * + * On error and nothing has been written, return -1 with errno set + * appropriately to the return code of either seek, write, or set + * to EINVAL in case of invalid arguments. + */ +s64 ntfs_pwrite(struct ntfs_device *dev, const s64 pos, s64 count, + const void *b) +{ + s64 written, total, ret = -1; + struct ntfs_device_operations *dops; + + ntfs_log_trace("pos %lld, count %lld\n",(long long)pos,(long long)count); + + if (!b || count < 0 || pos < 0) { + errno = EINVAL; + goto out; + } + if (!count) + return 0; + if (NDevReadOnly(dev)) { + errno = EROFS; + goto out; + } + + dops = dev->d_ops; + + NDevSetDirty(dev); + for (total = 0; count; count -= written, total += written) { + written = dops->pwrite(dev, (const char*)b + total, count, + pos + total); + /* If everything ok, continue. */ + if (written > 0) + continue; + /* + * If nothing written or error return number of bytes written. + */ + if (!written || total) + break; + /* Nothing written and error, return error status. */ + total = written; + break; + } + if (NDevSync(dev) && total && dops->sync(dev)) { + total--; /* on sync error, return partially written */ + } + ret = total; +out: + return ret; +} + +/** + * ntfs_mst_pread - multi sector transfer (mst) positioned read + * @dev: device to read from + * @pos: position in file descriptor to read from + * @count: number of blocks to read + * @bksize: size of each block that needs mst deprotecting + * @b: output data buffer + * + * Multi sector transfer (mst) positioned read. This function will read @count + * blocks of size @bksize bytes each from device @dev at position @pos into the + * the data buffer @b. + * + * On success, return the number of successfully read blocks. If this number is + * lower than @count this means that we have reached end of file, that the read + * was interrupted, or that an error was encountered during the read so that + * the read is partial. 0 means end of file or nothing was read (also return 0 + * when @count or @bksize are 0). + * + * On error and nothing was read, return -1 with errno set appropriately to the + * return code of either seek, read, or set to EINVAL in case of invalid + * arguments. + * + * NOTE: If an incomplete multi sector transfer has been detected the magic + * will have been changed to magic_BAAD but no error will be returned. Thus it + * is possible that we return count blocks as being read but that any number + * (between zero and count!) of these blocks is actually subject to a multi + * sector transfer error. This should be detected by the caller by checking for + * the magic being "BAAD". + */ +s64 ntfs_mst_pread(struct ntfs_device *dev, const s64 pos, s64 count, + const u32 bksize, void *b) +{ + s64 br, i; + + if (bksize & (bksize - 1) || bksize % NTFS_BLOCK_SIZE) { + errno = EINVAL; + return -1; + } + /* Do the read. */ + br = ntfs_pread(dev, pos, count * bksize, b); + if (br < 0) + return br; + /* + * Apply fixups to successfully read data, disregarding any errors + * returned from the MST fixup function. This is because we want to + * fixup everything possible and we rely on the fact that the "BAAD" + * magic will be detected later on. + */ + count = br / bksize; + for (i = 0; i < count; ++i) + ntfs_mst_post_read_fixup((NTFS_RECORD*) + ((u8*)b + i * bksize), bksize); + /* Finally, return the number of complete blocks read. */ + return count; +} + +/** + * ntfs_mst_pwrite - multi sector transfer (mst) positioned write + * @dev: device to write to + * @pos: position in file descriptor to write to + * @count: number of blocks to write + * @bksize: size of each block that needs mst protecting + * @b: data buffer to write to disk + * + * Multi sector transfer (mst) positioned write. This function will write + * @count blocks of size @bksize bytes each from data buffer @b to the device + * @dev at position @pos. + * + * On success, return the number of successfully written blocks. If this number + * is lower than @count this means that the write has been interrupted or that + * an error was encountered during the write so that the write is partial. 0 + * means nothing was written (also return 0 when @count or @bksize are 0). + * + * On error and nothing has been written, return -1 with errno set + * appropriately to the return code of either seek, write, or set + * to EINVAL in case of invalid arguments. + * + * NOTE: We mst protect the data, write it, then mst deprotect it using a quick + * deprotect algorithm (no checking). This saves us from making a copy before + * the write and at the same time causes the usn to be incremented in the + * buffer. This conceptually fits in better with the idea that cached data is + * always deprotected and protection is performed when the data is actually + * going to hit the disk and the cache is immediately deprotected again + * simulating an mst read on the written data. This way cache coherency is + * achieved. + */ +s64 ntfs_mst_pwrite(struct ntfs_device *dev, const s64 pos, s64 count, + const u32 bksize, void *b) +{ + s64 written, i; + + if (count < 0 || bksize % NTFS_BLOCK_SIZE) { + errno = EINVAL; + return -1; + } + if (!count) + return 0; + /* Prepare data for writing. */ + for (i = 0; i < count; ++i) { + int err; + + err = ntfs_mst_pre_write_fixup((NTFS_RECORD*) + ((u8*)b + i * bksize), bksize); + if (err < 0) { + /* Abort write at this position. */ + if (!i) + return err; + count = i; + break; + } + } + /* Write the prepared data. */ + written = ntfs_pwrite(dev, pos, count * bksize, b); + /* Quickly deprotect the data again. */ + for (i = 0; i < count; ++i) + ntfs_mst_post_write_fixup((NTFS_RECORD*)((u8*)b + i * bksize)); + if (written <= 0) + return written; + /* Finally, return the number of complete blocks written. */ + return written / bksize; +} + +/** + * ntfs_cluster_read - read ntfs clusters + * @vol: volume to read from + * @lcn: starting logical cluster number + * @count: number of clusters to read + * @b: output data buffer + * + * Read @count ntfs clusters starting at logical cluster number @lcn from + * volume @vol into buffer @b. Return number of clusters read or -1 on error, + * with errno set to the error code. + */ +s64 ntfs_cluster_read(const ntfs_volume *vol, const s64 lcn, const s64 count, + void *b) +{ + s64 br; + + if (!vol || lcn < 0 || count < 0) { + errno = EINVAL; + return -1; + } + if (vol->nr_clusters < lcn + count) { + errno = ESPIPE; + ntfs_log_perror("Trying to read outside of volume " + "(%lld < %lld)", (long long)vol->nr_clusters, + (long long)lcn + count); + return -1; + } + br = ntfs_pread(vol->dev, lcn << vol->cluster_size_bits, + count << vol->cluster_size_bits, b); + if (br < 0) { + ntfs_log_perror("Error reading cluster(s)"); + return br; + } + return br >> vol->cluster_size_bits; +} + +/** + * ntfs_cluster_write - write ntfs clusters + * @vol: volume to write to + * @lcn: starting logical cluster number + * @count: number of clusters to write + * @b: data buffer to write to disk + * + * Write @count ntfs clusters starting at logical cluster number @lcn from + * buffer @b to volume @vol. Return the number of clusters written or -1 on + * error, with errno set to the error code. + */ +s64 ntfs_cluster_write(const ntfs_volume *vol, const s64 lcn, + const s64 count, const void *b) +{ + s64 bw; + + if (!vol || lcn < 0 || count < 0) { + errno = EINVAL; + return -1; + } + if (vol->nr_clusters < lcn + count) { + errno = ESPIPE; + ntfs_log_perror("Trying to write outside of volume " + "(%lld < %lld)", (long long)vol->nr_clusters, + (long long)lcn + count); + return -1; + } + if (!NVolReadOnly(vol)) + bw = ntfs_pwrite(vol->dev, lcn << vol->cluster_size_bits, + count << vol->cluster_size_bits, b); + else + bw = count << vol->cluster_size_bits; + if (bw < 0) { + ntfs_log_perror("Error writing cluster(s)"); + return bw; + } + return bw >> vol->cluster_size_bits; +} + +/** + * ntfs_device_offset_valid - test if a device offset is valid + * @dev: open device + * @ofs: offset to test for validity + * + * Test if the offset @ofs is an existing location on the device described + * by the open device structure @dev. + * + * Return 0 if it is valid and -1 if it is not valid. + */ +static int ntfs_device_offset_valid(struct ntfs_device *dev, s64 ofs) +{ + char ch; + + if (dev->d_ops->seek(dev, ofs, SEEK_SET) >= 0 && + dev->d_ops->read(dev, &ch, 1) == 1) + return 0; + return -1; +} + +/** + * ntfs_device_size_get - return the size of a device in blocks + * @dev: open device + * @block_size: block size in bytes in which to return the result + * + * Return the number of @block_size sized blocks in the device described by the + * open device @dev. + * + * Adapted from e2fsutils-1.19, Copyright (C) 1995 Theodore Ts'o. + * + * On error return -1 with errno set to the error code. + */ +s64 ntfs_device_size_get(struct ntfs_device *dev, int block_size) +{ + s64 high, low; + + if (!dev || block_size <= 0 || (block_size - 1) & block_size) { + errno = EINVAL; + return -1; + } +#ifdef BLKGETSIZE64 + { u64 size; + + if (dev->d_ops->ioctl(dev, BLKGETSIZE64, &size) >= 0) { + ntfs_log_debug("BLKGETSIZE64 nr bytes = %llu (0x%llx)\n", + (unsigned long long)size, + (unsigned long long)size); + return (s64)size / block_size; + } + } +#endif +#ifdef BLKGETSIZE + { unsigned long size; + + if (dev->d_ops->ioctl(dev, BLKGETSIZE, &size) >= 0) { + ntfs_log_debug("BLKGETSIZE nr 512 byte blocks = %lu (0x%lx)\n", + size, size); + return (s64)size * 512 / block_size; + } + } +#endif +#ifdef FDGETPRM + { struct floppy_struct this_floppy; + + if (dev->d_ops->ioctl(dev, FDGETPRM, &this_floppy) >= 0) { + ntfs_log_debug("FDGETPRM nr 512 byte blocks = %lu (0x%lx)\n", + (unsigned long)this_floppy.size, + (unsigned long)this_floppy.size); + return (s64)this_floppy.size * 512 / block_size; + } + } +#endif + /* + * We couldn't figure it out by using a specialized ioctl, + * so do binary search to find the size of the device. + */ + low = 0LL; + for (high = 1024LL; !ntfs_device_offset_valid(dev, high); high <<= 1) + low = high; + while (low < high - 1LL) { + const s64 mid = (low + high) / 2; + + if (!ntfs_device_offset_valid(dev, mid)) + low = mid; + else + high = mid; + } + dev->d_ops->seek(dev, 0LL, SEEK_SET); + return (low + 1LL) / block_size; +} + +/** + * ntfs_device_partition_start_sector_get - get starting sector of a partition + * @dev: open device + * + * On success, return the starting sector of the partition @dev in the parent + * block device of @dev. On error return -1 with errno set to the error code. + * + * The following error codes are defined: + * EINVAL Input parameter error + * EOPNOTSUPP System does not support HDIO_GETGEO ioctl + * ENOTTY @dev is a file or a device not supporting HDIO_GETGEO + */ +s64 ntfs_device_partition_start_sector_get(struct ntfs_device *dev) +{ + if (!dev) { + errno = EINVAL; + return -1; + } +#ifdef HDIO_GETGEO + { struct hd_geometry geo; + + if (!dev->d_ops->ioctl(dev, HDIO_GETGEO, &geo)) { + ntfs_log_debug("HDIO_GETGEO start_sect = %lu (0x%lx)\n", + geo.start, geo.start); + return geo.start; + } + } +#else + errno = EOPNOTSUPP; +#endif + return -1; +} + +/** + * ntfs_device_heads_get - get number of heads of device + * @dev: open device + * + * On success, return the number of heads on the device @dev. On error return + * -1 with errno set to the error code. + * + * The following error codes are defined: + * EINVAL Input parameter error + * EOPNOTSUPP System does not support HDIO_GETGEO ioctl + * ENOTTY @dev is a file or a device not supporting HDIO_GETGEO + */ +int ntfs_device_heads_get(struct ntfs_device *dev) +{ + if (!dev) { + errno = EINVAL; + return -1; + } +#ifdef HDIO_GETGEO + { struct hd_geometry geo; + + if (!dev->d_ops->ioctl(dev, HDIO_GETGEO, &geo)) { + ntfs_log_debug("HDIO_GETGEO heads = %u (0x%x)\n", + (unsigned)geo.heads, + (unsigned)geo.heads); + return geo.heads; + } + } +#else + errno = EOPNOTSUPP; +#endif + return -1; +} + +/** + * ntfs_device_sectors_per_track_get - get number of sectors per track of device + * @dev: open device + * + * On success, return the number of sectors per track on the device @dev. On + * error return -1 with errno set to the error code. + * + * The following error codes are defined: + * EINVAL Input parameter error + * EOPNOTSUPP System does not support HDIO_GETGEO ioctl + * ENOTTY @dev is a file or a device not supporting HDIO_GETGEO + */ +int ntfs_device_sectors_per_track_get(struct ntfs_device *dev) +{ + if (!dev) { + errno = EINVAL; + return -1; + } +#ifdef HDIO_GETGEO + { struct hd_geometry geo; + + if (!dev->d_ops->ioctl(dev, HDIO_GETGEO, &geo)) { + ntfs_log_debug("HDIO_GETGEO sectors_per_track = %u (0x%x)\n", + (unsigned)geo.sectors, + (unsigned)geo.sectors); + return geo.sectors; + } + } +#else + errno = EOPNOTSUPP; +#endif + return -1; +} + +/** + * ntfs_device_sector_size_get - get sector size of a device + * @dev: open device + * + * On success, return the sector size in bytes of the device @dev. + * On error return -1 with errno set to the error code. + * + * The following error codes are defined: + * EINVAL Input parameter error + * EOPNOTSUPP System does not support BLKSSZGET ioctl + * ENOTTY @dev is a file or a device not supporting BLKSSZGET + */ +int ntfs_device_sector_size_get(struct ntfs_device *dev) +{ + if (!dev) { + errno = EINVAL; + return -1; + } +#ifdef BLKSSZGET + { + int sect_size = 0; + + if (!dev->d_ops->ioctl(dev, BLKSSZGET, §_size)) { + ntfs_log_debug("BLKSSZGET sector size = %d bytes\n", + sect_size); + return sect_size; + } + } +#else + errno = EOPNOTSUPP; +#endif + return -1; +} + +/** + * ntfs_device_block_size_set - set block size of a device + * @dev: open device + * @block_size: block size to set @dev to + * + * On success, return 0. + * On error return -1 with errno set to the error code. + * + * The following error codes are defined: + * EINVAL Input parameter error + * EOPNOTSUPP System does not support BLKBSZSET ioctl + * ENOTTY @dev is a file or a device not supporting BLKBSZSET + */ +int ntfs_device_block_size_set(struct ntfs_device *dev, + int block_size __attribute__((unused))) +{ + if (!dev) { + errno = EINVAL; + return -1; + } +#ifdef BLKBSZSET + { + size_t s_block_size = block_size; + if (!dev->d_ops->ioctl(dev, BLKBSZSET, &s_block_size)) { + ntfs_log_debug("Used BLKBSZSET to set block size to " + "%d bytes.\n", block_size); + return 0; + } + /* If not a block device, pretend it was successful. */ + if (!NDevBlock(dev)) + return 0; + } +#else + /* If not a block device, pretend it was successful. */ + if (!NDevBlock(dev)) + return 0; + errno = EOPNOTSUPP; +#endif + return -1; +} diff --git a/portlibs/sources/libntfs/device.h b/portlibs/sources/libntfs/device.h new file mode 100644 index 00000000..ad34ac56 --- /dev/null +++ b/portlibs/sources/libntfs/device.h @@ -0,0 +1,134 @@ +/* + * device.h - Exports for low level device io. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2006 Anton Altaparmakov + * + * 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 + */ + +#ifndef _NTFS_DEVICE_H +#define _NTFS_DEVICE_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "device_io.h" +#include "types.h" +#include "support.h" +#include "volume.h" + +/** + * enum ntfs_device_state_bits - + * + * Defined bits for the state field in the ntfs_device structure. + */ +typedef enum { + ND_Open, /* 1: Device is open. */ + ND_ReadOnly, /* 1: Device is read-only. */ + ND_Dirty, /* 1: Device is dirty, needs sync. */ + ND_Block, /* 1: Device is a block device. */ + ND_Sync, /* 1: Device is mounted with "-o sync" */ +} ntfs_device_state_bits; + +#define test_ndev_flag(nd, flag) test_bit(ND_##flag, (nd)->d_state) +#define set_ndev_flag(nd, flag) set_bit(ND_##flag, (nd)->d_state) +#define clear_ndev_flag(nd, flag) clear_bit(ND_##flag, (nd)->d_state) + +#define NDevOpen(nd) test_ndev_flag(nd, Open) +#define NDevSetOpen(nd) set_ndev_flag(nd, Open) +#define NDevClearOpen(nd) clear_ndev_flag(nd, Open) + +#define NDevReadOnly(nd) test_ndev_flag(nd, ReadOnly) +#define NDevSetReadOnly(nd) set_ndev_flag(nd, ReadOnly) +#define NDevClearReadOnly(nd) clear_ndev_flag(nd, ReadOnly) + +#define NDevDirty(nd) test_ndev_flag(nd, Dirty) +#define NDevSetDirty(nd) set_ndev_flag(nd, Dirty) +#define NDevClearDirty(nd) clear_ndev_flag(nd, Dirty) + +#define NDevBlock(nd) test_ndev_flag(nd, Block) +#define NDevSetBlock(nd) set_ndev_flag(nd, Block) +#define NDevClearBlock(nd) clear_ndev_flag(nd, Block) + +#define NDevSync(nd) test_ndev_flag(nd, Sync) +#define NDevSetSync(nd) set_ndev_flag(nd, Sync) +#define NDevClearSync(nd) clear_ndev_flag(nd, Sync) + +/** + * struct ntfs_device - + * + * The ntfs device structure defining all operations needed to access the low + * level device underlying the ntfs volume. + */ +struct ntfs_device { + struct ntfs_device_operations *d_ops; /* Device operations. */ + unsigned long d_state; /* State of the device. */ + char *d_name; /* Name of device. */ + void *d_private; /* Private data used by the + device operations. */ +}; + +struct stat; + +/** + * struct ntfs_device_operations - + * + * The ntfs device operations defining all operations that can be performed on + * the low level device described by an ntfs device structure. + */ +struct ntfs_device_operations { + int (*open)(struct ntfs_device *dev, int flags); + int (*close)(struct ntfs_device *dev); + s64 (*seek)(struct ntfs_device *dev, s64 offset, int whence); + s64 (*read)(struct ntfs_device *dev, void *buf, s64 count); + s64 (*write)(struct ntfs_device *dev, const void *buf, s64 count); + s64 (*pread)(struct ntfs_device *dev, void *buf, s64 count, s64 offset); + s64 (*pwrite)(struct ntfs_device *dev, const void *buf, s64 count, + s64 offset); + int (*sync)(struct ntfs_device *dev); + int (*stat)(struct ntfs_device *dev, struct stat *buf); + int (*ioctl)(struct ntfs_device *dev, int request, void *argp); +}; + +extern struct ntfs_device *ntfs_device_alloc(const char *name, const long state, + struct ntfs_device_operations *dops, void *priv_data); +extern int ntfs_device_free(struct ntfs_device *dev); +extern int ntfs_device_sync(struct ntfs_device *dev); + +extern s64 ntfs_pread(struct ntfs_device *dev, const s64 pos, s64 count, + void *b); +extern s64 ntfs_pwrite(struct ntfs_device *dev, const s64 pos, s64 count, + const void *b); + +extern s64 ntfs_mst_pread(struct ntfs_device *dev, const s64 pos, s64 count, + const u32 bksize, void *b); +extern s64 ntfs_mst_pwrite(struct ntfs_device *dev, const s64 pos, s64 count, + const u32 bksize, void *b); + +extern s64 ntfs_cluster_read(const ntfs_volume *vol, const s64 lcn, + const s64 count, void *b); +extern s64 ntfs_cluster_write(const ntfs_volume *vol, const s64 lcn, + const s64 count, const void *b); + +extern s64 ntfs_device_size_get(struct ntfs_device *dev, int block_size); +extern s64 ntfs_device_partition_start_sector_get(struct ntfs_device *dev); +extern int ntfs_device_heads_get(struct ntfs_device *dev); +extern int ntfs_device_sectors_per_track_get(struct ntfs_device *dev); +extern int ntfs_device_sector_size_get(struct ntfs_device *dev); +extern int ntfs_device_block_size_set(struct ntfs_device *dev, int block_size); + +#endif /* defined _NTFS_DEVICE_H */ diff --git a/portlibs/sources/libntfs/device_io.c b/portlibs/sources/libntfs/device_io.c new file mode 100644 index 00000000..f76bf703 --- /dev/null +++ b/portlibs/sources/libntfs/device_io.c @@ -0,0 +1,40 @@ +/* + * device_io.c - Default device io operations. Originated from the Linux-NTFS project. + * + * Copyright (c) 2003 Anton Altaparmakov + * + * 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 + */ + +#include "config.h" + +#ifndef GEKKO +#ifndef NO_NTFS_DEVICE_DEFAULT_IO_OPS + +#ifndef __CYGWIN32__ + +/* Not on Cygwin; use standard Unix style low level device operations. */ +#include "unix_io.c" + +#else /* __CYGWIN32__ */ + +/* On Cygwin; use Win32 low level device operations. */ +#include "win32_io.c" + +#endif /* __CYGWIN32__ */ + +#endif /* NO_NTFS_DEVICE_DEFAULT_IO_OPS */ +#endif /* GEKKO */ diff --git a/portlibs/sources/libntfs/device_io.h b/portlibs/sources/libntfs/device_io.h new file mode 100644 index 00000000..fad4d85f --- /dev/null +++ b/portlibs/sources/libntfs/device_io.h @@ -0,0 +1,82 @@ +/* + * device_io.h - Exports for default device io. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2006 Anton Altaparmakov + * + * 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 + */ + +#ifndef _NTFS_DEVICE_IO_H +#define _NTFS_DEVICE_IO_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#ifndef NO_NTFS_DEVICE_DEFAULT_IO_OPS + +#ifndef __CYGWIN32__ + +#ifndef GEKKO +/* Not on Cygwin; use standard Unix style low level device operations. */ +#define ntfs_device_default_io_ops ntfs_device_unix_io_ops +#else +/* Wii i/o device. */ +#define ntfs_device_default_io_ops ntfs_device_gekko_io_ops +#endif + +#else /* __CYGWIN32__ */ + +#ifndef HDIO_GETGEO +# define HDIO_GETGEO 0x301 +/** + * struct hd_geometry - + */ +struct hd_geometry { + unsigned char heads; + unsigned char sectors; + unsigned short cylinders; + unsigned long start; +}; +#endif +#ifndef BLKGETSIZE +# define BLKGETSIZE 0x1260 +#endif +#ifndef BLKSSZGET +# define BLKSSZGET 0x1268 +#endif +#ifndef BLKGETSIZE64 +# define BLKGETSIZE64 0x80041272 +#endif +#ifndef BLKBSZSET +# define BLKBSZSET 0x40041271 +#endif + +/* On Cygwin; use Win32 low level device operations. */ +#define ntfs_device_default_io_ops ntfs_device_win32_io_ops + +#endif /* __CYGWIN32__ */ + + +/* Forward declaration. */ +struct ntfs_device_operations; + +extern struct ntfs_device_operations ntfs_device_default_io_ops; + +#endif /* NO_NTFS_DEVICE_DEFAULT_IO_OPS */ + +#endif /* defined _NTFS_DEVICE_IO_H */ + diff --git a/portlibs/sources/libntfs/dir.c b/portlibs/sources/libntfs/dir.c new file mode 100644 index 00000000..198bc29d --- /dev/null +++ b/portlibs/sources/libntfs/dir.c @@ -0,0 +1,2661 @@ +/** + * 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-2010 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_SYSMACROS_H +#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" + +#ifdef HAVE_SETXATTR +#include <sys/xattr.h> +#endif + +/* + * 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 = dir_ni->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, index_vcn_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; + } + + 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; + } + 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->key_length) > + index_end) { + ntfs_log_error("Index 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; + + if (!le16_to_cpu(ie->length)) { + ntfs_log_error("Zero length index entry in inode %lld" + "\n", (unsigned long long)dir_ni->mft_no); + 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 = vol->cluster_size; + index_vcn_size_bits = vol->cluster_size_bits; + } else { + index_vcn_size = vol->sector_size; + index_vcn_size_bits = vol->sector_size_bits; + } + + /* Get the starting vcn of the index_block holding the child node. */ + vcn = sle64_to_cpup((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", + (unsigned long long)vcn); + goto close_err_out; + } + + if (sle64_to_cpu(ia->index_block_vcn) != vcn) { + ntfs_log_error("Actual VCN (0x%llx) of index buffer is different " + "from expected VCN (0x%llx).\n", + (long long)sle64_to_cpu(ia->index_block_vcn), + (long long)vcn); + errno = EIO; + goto close_err_out; + } + if (le32_to_cpu(ia->index.allocated_size) + 0x18 != index_block_size) { + ntfs_log_error("Index buffer (VCN 0x%llx) of directory inode 0x%llx " + "has a size (%u) differing from the directory " + "specified size (%u).\n", (long long)vcn, + (unsigned long long)dir_ni->mft_no, + (unsigned) le32_to_cpu(ia->index.allocated_size) + 0x18, + (unsigned)index_block_size); + errno = EIO; + goto close_err_out; + } + index_end = (u8*)&ia->index + le32_to_cpu(ia->index.index_length); + if (index_end > (u8*)ia + index_block_size) { + ntfs_log_error("Size of index buffer (VCN 0x%llx) of directory inode " + "0x%llx exceeds maximum size.\n", + (long long)vcn, (unsigned long long)dir_ni->mft_no); + errno = EIO; + goto close_err_out; + } + + /* 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->key_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; + + if (!le16_to_cpu(ie->length)) { + errno = EIO; + ntfs_log_error("Zero length index entry in inode %lld" + "\n", (unsigned long long)dir_ni->mft_no); + 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((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); + 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') }; + +/* + * union index_union - + * More helpers for ntfs_readdir(). + */ +typedef union { + INDEX_ROOT *ir; + INDEX_ALLOCATION *ia; +} index_union __attribute__((__transparent_union__)); + +/** + * enum INDEX_TYPE - + * More helpers for ntfs_readdir(). + */ +typedef enum { + INDEX_TYPE_ROOT, /* index root */ + INDEX_TYPE_ALLOCATION, /* index allocation */ +} INDEX_TYPE; + +/** + * ntfs_filldir - ntfs specific filldir method + * @dir_ni: ntfs inode of current directory + * @pos: current position in directory + * @ivcn_bits: log(2) of index vcn size + * @index_type: specifies whether @iu is an index root or an index allocation + * @iu: index root or index block to which @ie belongs + * @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, u8 ivcn_bits, + const INDEX_TYPE index_type, index_union iu, 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"); + + /* Advance the position even if going to skip the entry. */ + if (index_type == INDEX_TYPE_ALLOCATION) + *pos = (u8*)ie - (u8*)iu.ia + (sle64_to_cpu( + iu.ia->index_block_vcn) << ivcn_bits) + + dir_ni->vol->mft_record_size; + else /* if (index_type == INDEX_TYPE_ROOT) */ + *pos = (u8*)ie - (u8*)iu.ir; + /* 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_I30_INDEX_PRESENT) + dt_type = NTFS_DT_DIR; + else if (fn->file_attributes & FILE_ATTR_SYSTEM) + dt_type = NTFS_DT_UNKNOWN; + else + dt_type = NTFS_DT_REG; + + /* return metadata files and hidden files if requested */ + mref = le64_to_cpu(ie->indexed_file); + metadata = (MREF(mref) != FILE_root) && (MREF(mref) < FILE_first_user); + 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 + res = -1; + } + } else + res = 0; + return (res); +} + +/** + * ntfs_mft_get_parent_ref - find mft reference of parent directory of an inode + * @ni: ntfs inode whose parent directory to find + * + * Find the parent directory of the ntfs inode @ni. To do this, find the first + * file name attribute in the mft record of @ni and return the parent mft + * reference from that. + * + * Note this only makes sense for directories, since files can be hard linked + * from multiple directories and there is no way for us to tell which one is + * being looked for. + * + * Technically directories can have hard links, too, but we consider that as + * illegal as Linux/UNIX do not support directory hard links. + * + * Return the mft reference of the parent directory on success or -1 on error + * with errno set to the error code. + */ +static MFT_REF ntfs_mft_get_parent_ref(ntfs_inode *ni) +{ + MFT_REF mref; + ntfs_attr_search_ctx *ctx; + FILE_NAME_ATTR *fn; + int eo; + + ntfs_log_trace("Entering.\n"); + + if (!ni) { + errno = EINVAL; + return ERR_MREF(-1); + } + + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + return ERR_MREF(-1); + if (ntfs_attr_lookup(AT_FILE_NAME, AT_UNNAMED, 0, 0, 0, NULL, 0, ctx)) { + ntfs_log_error("No file name found in inode %lld\n", + (unsigned long long)ni->mft_no); + goto err_out; + } + if (ctx->attr->non_resident) { + ntfs_log_error("File name attribute must be resident (inode " + "%lld)\n", (unsigned long long)ni->mft_no); + goto io_err_out; + } + fn = (FILE_NAME_ATTR*)((u8*)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + if ((u8*)fn + le32_to_cpu(ctx->attr->value_length) > + (u8*)ctx->attr + le32_to_cpu(ctx->attr->length)) { + ntfs_log_error("Corrupt file name attribute in inode %lld.\n", + (unsigned long long)ni->mft_no); + goto io_err_out; + } + mref = le64_to_cpu(fn->parent_directory); + ntfs_attr_put_search_ctx(ctx); + return mref; +io_err_out: + errno = EIO; +err_out: + eo = errno; + ntfs_attr_put_search_ctx(ctx); + errno = eo; + return ERR_MREF(-1); +} + +/** + * ntfs_readdir - read the contents of an ntfs directory + * @dir_ni: ntfs inode of current directory + * @pos: current position in directory + * @dirent: context for filldir callback supplied by the caller + * @filldir: filldir callback supplied by the caller + * + * Parse the index root and the index blocks that are marked in use in the + * index bitmap and hand each found directory entry to the @filldir callback + * supplied by the caller. + * + * Return 0 on success or -1 on error with errno set to the error code. + * + * Note: Index blocks are parsed in ascending vcn order, from which follows + * that the directory entries are not returned sorted. + */ +int ntfs_readdir(ntfs_inode *dir_ni, s64 *pos, + void *dirent, ntfs_filldir_t filldir) +{ + s64 i_size, br, ia_pos, bmp_pos, ia_start; + ntfs_volume *vol; + ntfs_attr *ia_na, *bmp_na = NULL; + ntfs_attr_search_ctx *ctx = NULL; + u8 *index_end, *bmp = NULL; + INDEX_ROOT *ir; + INDEX_ENTRY *ie; + INDEX_ALLOCATION *ia = NULL; + int rc, ir_pos, bmp_buf_size, bmp_buf_pos, eo; + u32 index_block_size, index_vcn_size; + u8 index_block_size_bits, index_vcn_size_bits; + + ntfs_log_trace("Entering.\n"); + + if (!dir_ni || !pos || !filldir) { + errno = EINVAL; + return -1; + } + + if (!(dir_ni->mrec->flags & MFT_RECORD_IS_DIRECTORY)) { + errno = ENOTDIR; + return -1; + } + + vol = dir_ni->vol; + + ntfs_log_trace("Entering for inode %lld, *pos 0x%llx.\n", + (unsigned long long)dir_ni->mft_no, (long long)*pos); + + /* Open the index allocation attribute. */ + ia_na = ntfs_attr_open(dir_ni, AT_INDEX_ALLOCATION, NTFS_INDEX_I30, 4); + if (!ia_na) { + if (errno != ENOENT) { + ntfs_log_perror("Failed to open index allocation attribute. " + "Directory inode %lld is corrupt or bug", + (unsigned long long)dir_ni->mft_no); + return -1; + } + i_size = 0; + } else + i_size = ia_na->data_size; + + rc = 0; + + /* Are we at end of dir yet? */ + if (*pos >= i_size + vol->mft_record_size) + goto done; + + /* Emulate . and .. for all directories. */ + if (!*pos) { + rc = filldir(dirent, dotdot, 1, FILE_NAME_POSIX, *pos, + MK_MREF(dir_ni->mft_no, + le16_to_cpu(dir_ni->mrec->sequence_number)), + NTFS_DT_DIR); + if (rc) + goto err_out; + ++*pos; + } + if (*pos == 1) { + MFT_REF parent_mref; + + parent_mref = ntfs_mft_get_parent_ref(dir_ni); + if (parent_mref == ERR_MREF(-1)) { + ntfs_log_perror("Parent directory not found"); + goto dir_err_out; + } + + rc = filldir(dirent, dotdot, 2, FILE_NAME_POSIX, *pos, + parent_mref, NTFS_DT_DIR); + if (rc) + goto err_out; + ++*pos; + } + + ctx = ntfs_attr_get_search_ctx(dir_ni, NULL); + if (!ctx) + goto err_out; + + /* Get the offset into the index root attribute. */ + ir_pos = (int)*pos; + /* 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 dir_err_out; + } + /* Get to the index root value. */ + ir = (INDEX_ROOT*)((u8*)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + + /* Determine the size of a vcn in the directory index. */ + 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 dir_err_out; + } + index_block_size_bits = ffs(index_block_size) - 1; + if (vol->cluster_size <= index_block_size) { + index_vcn_size = vol->cluster_size; + index_vcn_size_bits = vol->cluster_size_bits; + } else { + index_vcn_size = vol->sector_size; + index_vcn_size_bits = vol->sector_size_bits; + } + + /* Are we jumping straight into the index allocation attribute? */ + if (*pos >= vol->mft_record_size) { + ntfs_attr_put_search_ctx(ctx); + ctx = NULL; + goto skip_index_root; + } + + 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 or until filldir tells us it has had enough + * or signals an error (both covered by the rc test). + */ + for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) { + ntfs_log_debug("In index root, offset %d.\n", (int)((u8*)ie - (u8*)ir)); + /* Bounds checks. */ + if ((u8*)ie < (u8*)ctx->mrec || (u8*)ie + + sizeof(INDEX_ENTRY_HEADER) > index_end || + (u8*)ie + le16_to_cpu(ie->key_length) > + index_end) + goto dir_err_out; + /* The last entry cannot contain a name. */ + if (ie->ie_flags & INDEX_ENTRY_END) + break; + + if (!le16_to_cpu(ie->length)) + goto dir_err_out; + + /* Skip index root entry if continuing previous readdir. */ + if (ir_pos > (u8*)ie - (u8*)ir) + continue; + /* + * Submit the directory entry to ntfs_filldir(), which will + * invoke the filldir() callback as appropriate. + */ + rc = ntfs_filldir(dir_ni, pos, index_vcn_size_bits, + INDEX_TYPE_ROOT, ir, ie, dirent, filldir); + if (rc) { + ntfs_attr_put_search_ctx(ctx); + ctx = NULL; + goto err_out; + } + } + ntfs_attr_put_search_ctx(ctx); + ctx = NULL; + + /* If there is no index allocation attribute we are finished. */ + if (!ia_na) + goto EOD; + + /* Advance *pos to the beginning of the index allocation. */ + *pos = vol->mft_record_size; + +skip_index_root: + + if (!ia_na) + goto done; + + /* Allocate a buffer for the current index block. */ + ia = ntfs_malloc(index_block_size); + if (!ia) + goto err_out; + + bmp_na = ntfs_attr_open(dir_ni, AT_BITMAP, NTFS_INDEX_I30, 4); + if (!bmp_na) { + ntfs_log_perror("Failed to open index bitmap attribute"); + goto dir_err_out; + } + + /* Get the offset into the index allocation attribute. */ + ia_pos = *pos - vol->mft_record_size; + + bmp_pos = ia_pos >> index_block_size_bits; + if (bmp_pos >> 3 >= bmp_na->data_size) { + ntfs_log_error("Current index position exceeds index bitmap " + "size.\n"); + goto dir_err_out; + } + + bmp_buf_size = min(bmp_na->data_size - (bmp_pos >> 3), 4096); + bmp = ntfs_malloc(bmp_buf_size); + if (!bmp) + goto err_out; + + br = ntfs_attr_pread(bmp_na, bmp_pos >> 3, bmp_buf_size, bmp); + if (br != bmp_buf_size) { + if (br != -1) + errno = EIO; + ntfs_log_perror("Failed to read from index bitmap attribute"); + goto err_out; + } + + bmp_buf_pos = 0; + /* If the index block is not in use find the next one that is. */ + while (!(bmp[bmp_buf_pos >> 3] & (1 << (bmp_buf_pos & 7)))) { +find_next_index_buffer: + bmp_pos++; + bmp_buf_pos++; + /* If we have reached the end of the bitmap, we are done. */ + if (bmp_pos >> 3 >= bmp_na->data_size) + goto EOD; + ia_pos = bmp_pos << index_block_size_bits; + if (bmp_buf_pos >> 3 < bmp_buf_size) + continue; + /* Read next chunk from the index bitmap. */ + bmp_buf_pos = 0; + if ((bmp_pos >> 3) + bmp_buf_size > bmp_na->data_size) + bmp_buf_size = bmp_na->data_size - (bmp_pos >> 3); + br = ntfs_attr_pread(bmp_na, bmp_pos >> 3, bmp_buf_size, bmp); + if (br != bmp_buf_size) { + if (br != -1) + errno = EIO; + ntfs_log_perror("Failed to read from index bitmap attribute"); + goto err_out; + } + } + + ntfs_log_debug("Handling index block 0x%llx.\n", (long long)bmp_pos); + + /* Read the index block starting at bmp_pos. */ + br = ntfs_attr_mst_pread(ia_na, bmp_pos << index_block_size_bits, 1, + index_block_size, ia); + if (br != 1) { + if (br != -1) + errno = EIO; + ntfs_log_perror("Failed to read index block"); + goto err_out; + } + + ia_start = ia_pos & ~(s64)(index_block_size - 1); + if (sle64_to_cpu(ia->index_block_vcn) != ia_start >> + index_vcn_size_bits) { + ntfs_log_error("Actual VCN (0x%llx) of index buffer is different " + "from expected VCN (0x%llx) in inode 0x%llx.\n", + (long long)sle64_to_cpu(ia->index_block_vcn), + (long long)ia_start >> index_vcn_size_bits, + (unsigned long long)dir_ni->mft_no); + goto dir_err_out; + } + if (le32_to_cpu(ia->index.allocated_size) + 0x18 != index_block_size) { + ntfs_log_error("Index buffer (VCN 0x%llx) of directory inode %lld " + "has a size (%u) differing from the directory " + "specified size (%u).\n", (long long)ia_start >> + index_vcn_size_bits, + (unsigned long long)dir_ni->mft_no, + (unsigned) le32_to_cpu(ia->index.allocated_size) + + 0x18, (unsigned)index_block_size); + goto dir_err_out; + } + index_end = (u8*)&ia->index + le32_to_cpu(ia->index.index_length); + if (index_end > (u8*)ia + index_block_size) { + ntfs_log_error("Size of index buffer (VCN 0x%llx) of directory inode " + "%lld exceeds maximum size.\n", + (long long)ia_start >> index_vcn_size_bits, + (unsigned long long)dir_ni->mft_no); + goto dir_err_out; + } + /* The first index entry. */ + ie = (INDEX_ENTRY*)((u8*)&ia->index + + le32_to_cpu(ia->index.entries_offset)); + /* + * Loop until we exceed valid memory (corruption case) or until we + * reach the last entry or until ntfs_filldir tells us it has had + * enough or signals an error (both covered by the rc test). + */ + for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) { + ntfs_log_debug("In index allocation, offset 0x%llx.\n", + (long long)ia_start + ((u8*)ie - (u8*)ia)); + /* Bounds checks. */ + if ((u8*)ie < (u8*)ia || (u8*)ie + + sizeof(INDEX_ENTRY_HEADER) > index_end || + (u8*)ie + le16_to_cpu(ie->key_length) > + index_end) { + ntfs_log_error("Index entry out of bounds in directory inode " + "%lld.\n", (unsigned long long)dir_ni->mft_no); + goto dir_err_out; + } + /* The last entry cannot contain a name. */ + if (ie->ie_flags & INDEX_ENTRY_END) + break; + + if (!le16_to_cpu(ie->length)) + goto dir_err_out; + + /* Skip index entry if continuing previous readdir. */ + if (ia_pos - ia_start > (u8*)ie - (u8*)ia) + continue; + /* + * Submit the directory entry to ntfs_filldir(), which will + * invoke the filldir() callback as appropriate. + */ + rc = ntfs_filldir(dir_ni, pos, index_vcn_size_bits, + INDEX_TYPE_ALLOCATION, ia, ie, dirent, filldir); + if (rc) + goto err_out; + } + goto find_next_index_buffer; +EOD: + /* We are finished, set *pos to EOD. */ + *pos = i_size + vol->mft_record_size; +done: + free(ia); + free(bmp); + if (bmp_na) + ntfs_attr_close(bmp_na); + if (ia_na) + ntfs_attr_close(ia_na); + ntfs_log_debug("EOD, *pos 0x%llx, returning 0.\n", (long long)*pos); + return 0; +dir_err_out: + errno = EIO; +err_out: + eo = errno; + ntfs_log_trace("failed.\n"); + if (ctx) + ntfs_attr_put_search_ctx(ctx); + free(ia); + free(bmp); + if (bmp_na) + ntfs_attr_close(bmp_na); + if (ia_na) + ntfs_attr_close(ia_na); + errno = eo; + return -1; +} + + +/** + * __ntfs_create - create object on ntfs volume + * @dir_ni: ntfs inode for directory in which create new object + * @securid: id of inheritable security descriptor, 0 if none + * @name: unicode name of new object + * @name_len: length of the name in unicode characters + * @type: type of the object to create + * @dev: major and minor device numbers (obtained from makedev()) + * @target: target in unicode (only for symlinks) + * @target_len: length of target in unicode characters + * + * Internal, use ntfs_create{,_device,_symlink} wrappers instead. + * + * @type can be: + * S_IFREG to create regular file + * S_IFDIR to create directory + * S_IFBLK to create block device + * S_IFCHR to create character device + * S_IFLNK to create symbolic link + * S_IFIFO to create FIFO + * S_IFSOCK to create socket + * other values are invalid. + * + * @dev is used only if @type is S_IFBLK or S_IFCHR, in other cases its value + * ignored. + * + * @target and @target_len are used only if @type is S_IFLNK, in other cases + * their value ignored. + * + * Return opened ntfs inode that describes created object on success or NULL + * on error with errno set to the error code. + */ +static ntfs_inode *__ntfs_create(ntfs_inode *dir_ni, le32 securid, + ntfschar *name, u8 name_len, mode_t type, dev_t dev, + ntfschar *target, int target_len) +{ + ntfs_inode *ni; + int rollback_data = 0, rollback_sd = 0; + FILE_NAME_ATTR *fn = NULL; + STANDARD_INFORMATION *si = NULL; + int err, fn_len, si_len; + + ntfs_log_trace("Entering.\n"); + + /* Sanity checks. */ + if (!dir_ni || !name || !name_len) { + ntfs_log_error("Invalid arguments.\n"); + errno = EINVAL; + return NULL; + } + + if (dir_ni->flags & FILE_ATTR_REPARSE_POINT) { + errno = EOPNOTSUPP; + return NULL; + } + + ni = ntfs_mft_record_alloc(dir_ni->vol, NULL); + if (!ni) + return NULL; +#if CACHE_NIDATA_SIZE + ntfs_inode_invalidate(dir_ni->vol, ni->mft_no); +#endif + /* + * Create STANDARD_INFORMATION attribute. + * JPA Depending on available inherited security descriptor, + * Write STANDARD_INFORMATION v1.2 (no inheritance) or v3 + */ + if (securid) + si_len = sizeof(STANDARD_INFORMATION); + else + si_len = offsetof(STANDARD_INFORMATION, v1_end); + si = ntfs_calloc(si_len); + if (!si) { + err = errno; + goto err_out; + } + si->creation_time = ni->creation_time; + si->last_data_change_time = ni->last_data_change_time; + si->last_mft_change_time = ni->last_mft_change_time; + si->last_access_time = ni->last_access_time; + if (securid) { + set_nino_flag(ni, v3_Extensions); + ni->owner_id = si->owner_id = 0; + ni->security_id = si->security_id = securid; + ni->quota_charged = si->quota_charged = const_cpu_to_le64(0); + ni->usn = si->usn = const_cpu_to_le64(0); + } else + clear_nino_flag(ni, v3_Extensions); + if (!S_ISREG(type) && !S_ISDIR(type)) { + si->file_attributes = FILE_ATTR_SYSTEM; + ni->flags = FILE_ATTR_SYSTEM; + } + ni->flags |= FILE_ATTR_ARCHIVE; + if (NVolHideDotFiles(dir_ni->vol) + && (name_len > 1) + && (name[0] == const_cpu_to_le16('.')) + && (name[1] != const_cpu_to_le16('.'))) + ni->flags |= FILE_ATTR_HIDDEN; + /* + * Set compression flag according to parent directory + * unless NTFS version < 3.0 or cluster size > 4K + * or compression has been disabled + */ + if ((dir_ni->flags & FILE_ATTR_COMPRESSED) + && (dir_ni->vol->major_ver >= 3) + && NVolCompression(dir_ni->vol) + && (dir_ni->vol->cluster_size <= MAX_COMPRESSION_CLUSTER_SIZE) + && (S_ISREG(type) || S_ISDIR(type))) + ni->flags |= FILE_ATTR_COMPRESSED; + /* Add STANDARD_INFORMATION to inode. */ + if (ntfs_attr_add(ni, AT_STANDARD_INFORMATION, AT_UNNAMED, 0, + (u8*)si, si_len)) { + err = errno; + ntfs_log_error("Failed to add STANDARD_INFORMATION " + "attribute.\n"); + goto err_out; + } + + if (!securid) { + if (ntfs_sd_add_everyone(ni)) { + err = errno; + goto err_out; + } + } + rollback_sd = 1; + + if (S_ISDIR(type)) { + INDEX_ROOT *ir = NULL; + INDEX_ENTRY *ie; + int ir_len, index_len; + + /* Create INDEX_ROOT attribute. */ + index_len = sizeof(INDEX_HEADER) + sizeof(INDEX_ENTRY_HEADER); + ir_len = offsetof(INDEX_ROOT, index) + index_len; + ir = ntfs_calloc(ir_len); + if (!ir) { + err = errno; + goto err_out; + } + ir->type = AT_FILE_NAME; + ir->collation_rule = COLLATION_FILE_NAME; + ir->index_block_size = cpu_to_le32(ni->vol->indx_record_size); + if (ni->vol->cluster_size <= ni->vol->indx_record_size) + ir->clusters_per_index_block = + ni->vol->indx_record_size >> + ni->vol->cluster_size_bits; + else + ir->clusters_per_index_block = + ni->vol->indx_record_size >> + ni->vol->sector_size_bits; + ir->index.entries_offset = cpu_to_le32(sizeof(INDEX_HEADER)); + ir->index.index_length = cpu_to_le32(index_len); + ir->index.allocated_size = cpu_to_le32(index_len); + ie = (INDEX_ENTRY*)((u8*)ir + sizeof(INDEX_ROOT)); + ie->length = cpu_to_le16(sizeof(INDEX_ENTRY_HEADER)); + ie->key_length = 0; + ie->ie_flags = INDEX_ENTRY_END; + /* Add INDEX_ROOT attribute to inode. */ + if (ntfs_attr_add(ni, AT_INDEX_ROOT, NTFS_INDEX_I30, 4, + (u8*)ir, ir_len)) { + err = errno; + free(ir); + ntfs_log_error("Failed to add INDEX_ROOT attribute.\n"); + goto err_out; + } + free(ir); + } else { + INTX_FILE *data; + int data_len; + + switch (type) { + case S_IFBLK: + case S_IFCHR: + data_len = offsetof(INTX_FILE, device_end); + data = ntfs_malloc(data_len); + if (!data) { + err = errno; + goto err_out; + } + data->major = cpu_to_le64(major(dev)); + data->minor = cpu_to_le64(minor(dev)); + if (type == S_IFBLK) + data->magic = INTX_BLOCK_DEVICE; + if (type == S_IFCHR) + data->magic = INTX_CHARACTER_DEVICE; + break; + case S_IFLNK: + data_len = sizeof(INTX_FILE_TYPES) + + target_len * sizeof(ntfschar); + data = ntfs_malloc(data_len); + if (!data) { + err = errno; + goto err_out; + } + data->magic = INTX_SYMBOLIC_LINK; + memcpy(data->target, target, + target_len * sizeof(ntfschar)); + break; + case S_IFSOCK: + data = NULL; + data_len = 1; + break; + default: /* FIFO or regular file. */ + data = NULL; + data_len = 0; + break; + } + /* Add DATA attribute to inode. */ + if (ntfs_attr_add(ni, AT_DATA, AT_UNNAMED, 0, (u8*)data, + data_len)) { + err = errno; + ntfs_log_error("Failed to add DATA attribute.\n"); + free(data); + goto err_out; + } + rollback_data = 1; + free(data); + } + /* Create FILE_NAME attribute. */ + fn_len = sizeof(FILE_NAME_ATTR) + name_len * sizeof(ntfschar); + fn = ntfs_calloc(fn_len); + if (!fn) { + err = errno; + goto err_out; + } + fn->parent_directory = MK_LE_MREF(dir_ni->mft_no, + le16_to_cpu(dir_ni->mrec->sequence_number)); + fn->file_name_length = name_len; + fn->file_name_type = FILE_NAME_POSIX; + if (S_ISDIR(type)) + fn->file_attributes = FILE_ATTR_I30_INDEX_PRESENT; + if (!S_ISREG(type) && !S_ISDIR(type)) + fn->file_attributes = FILE_ATTR_SYSTEM; + else + fn->file_attributes |= ni->flags & FILE_ATTR_COMPRESSED; + fn->file_attributes |= FILE_ATTR_ARCHIVE; + fn->file_attributes |= ni->flags & FILE_ATTR_HIDDEN; + fn->creation_time = ni->creation_time; + fn->last_data_change_time = ni->last_data_change_time; + fn->last_mft_change_time = ni->last_mft_change_time; + fn->last_access_time = ni->last_access_time; + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + fn->data_size = fn->allocated_size = const_cpu_to_le64(0); + else { + fn->data_size = cpu_to_sle64(ni->data_size); + fn->allocated_size = cpu_to_sle64(ni->allocated_size); + } + memcpy(fn->file_name, name, name_len * sizeof(ntfschar)); + /* Add FILE_NAME attribute to inode. */ + if (ntfs_attr_add(ni, AT_FILE_NAME, AT_UNNAMED, 0, (u8*)fn, fn_len)) { + err = errno; + ntfs_log_error("Failed to add FILE_NAME attribute.\n"); + goto err_out; + } + /* Add FILE_NAME attribute to index. */ + if (ntfs_index_add_filename(dir_ni, fn, MK_MREF(ni->mft_no, + le16_to_cpu(ni->mrec->sequence_number)))) { + err = errno; + ntfs_log_perror("Failed to add entry to the index"); + goto err_out; + } + /* Set hard links count and directory flag. */ + ni->mrec->link_count = cpu_to_le16(1); + if (S_ISDIR(type)) + ni->mrec->flags |= MFT_RECORD_IS_DIRECTORY; + ntfs_inode_mark_dirty(ni); + /* Done! */ + free(fn); + free(si); + ntfs_log_trace("Done.\n"); + return ni; +err_out: + ntfs_log_trace("Failed.\n"); + + if (rollback_sd) + ntfs_attr_remove(ni, AT_SECURITY_DESCRIPTOR, AT_UNNAMED, 0); + + if (rollback_data) + ntfs_attr_remove(ni, AT_DATA, AT_UNNAMED, 0); + /* + * Free extent MFT records (should not exist any with current + * ntfs_create implementation, but for any case if something will be + * changed in the future). + */ + while (ni->nr_extents) + if (ntfs_mft_record_free(ni->vol, *(ni->extent_nis))) { + err = errno; + ntfs_log_error("Failed to free extent MFT record. " + "Leaving inconsistent metadata.\n"); + } + if (ntfs_mft_record_free(ni->vol, ni)) + ntfs_log_error("Failed to free MFT record. " + "Leaving inconsistent metadata. Run chkdsk.\n"); + free(fn); + free(si); + errno = err; + return NULL; +} + +/** + * Some wrappers around __ntfs_create() ... + */ + +ntfs_inode *ntfs_create(ntfs_inode *dir_ni, le32 securid, ntfschar *name, + u8 name_len, mode_t type) +{ + if (type != S_IFREG && type != S_IFDIR && type != S_IFIFO && + type != S_IFSOCK) { + ntfs_log_error("Invalid arguments.\n"); + return NULL; + } + return __ntfs_create(dir_ni, securid, name, name_len, type, 0, NULL, 0); +} + +ntfs_inode *ntfs_create_device(ntfs_inode *dir_ni, le32 securid, + ntfschar *name, u8 name_len, mode_t type, dev_t dev) +{ + if (type != S_IFCHR && type != S_IFBLK) { + ntfs_log_error("Invalid arguments.\n"); + return NULL; + } + return __ntfs_create(dir_ni, securid, name, name_len, type, dev, NULL, 0); +} + +ntfs_inode *ntfs_create_symlink(ntfs_inode *dir_ni, le32 securid, + ntfschar *name, u8 name_len, ntfschar *target, int target_len) +{ + if (!target || !target_len) { + ntfs_log_error("%s: Invalid argument (%p, %d)\n", __FUNCTION__, + target, target_len); + return NULL; + } + return __ntfs_create(dir_ni, securid, name, name_len, S_IFLNK, 0, + target, target_len); +} + +int ntfs_check_empty_dir(ntfs_inode *ni) +{ + ntfs_attr *na; + int ret = 0; + + if (!(ni->mrec->flags & MFT_RECORD_IS_DIRECTORY)) + return 0; + + na = ntfs_attr_open(ni, AT_INDEX_ROOT, NTFS_INDEX_I30, 4); + if (!na) { + errno = EIO; + ntfs_log_perror("Failed to open directory"); + return -1; + } + + /* Non-empty directory? */ + if ((na->data_size != sizeof(INDEX_ROOT) + sizeof(INDEX_ENTRY_HEADER))){ + /* Both ENOTEMPTY and EEXIST are ok. We use the more common. */ + errno = ENOTEMPTY; + ntfs_log_debug("Directory is not empty\n"); + ret = -1; + } + + ntfs_attr_close(na); + return ret; +} + +static int ntfs_check_unlinkable_dir(ntfs_inode *ni, FILE_NAME_ATTR *fn) +{ + int link_count = le16_to_cpu(ni->mrec->link_count); + int ret; + + ret = ntfs_check_empty_dir(ni); + if (!ret || errno != ENOTEMPTY) + return ret; + /* + * Directory is non-empty, so we can unlink only if there is more than + * one "real" hard link, i.e. links aren't different DOS and WIN32 names + */ + if ((link_count == 1) || + (link_count == 2 && fn->file_name_type == FILE_NAME_DOS)) { + errno = ENOTEMPTY; + ntfs_log_debug("Non-empty directory without hard links\n"); + goto no_hardlink; + } + + ret = 0; +no_hardlink: + return ret; +} + +/** + * ntfs_delete - delete file or directory from ntfs volume + * @ni: ntfs inode for object to delte + * @dir_ni: ntfs inode for directory in which delete object + * @name: unicode name of the object to delete + * @name_len: length of the name in unicode characters + * + * @ni is always closed after the call to this function (even if it failed), + * user does not need to call ntfs_inode_close himself. + * + * Return 0 on success or -1 on error with errno set to the error code. + */ +int ntfs_delete(ntfs_volume *vol, const char *pathname, + ntfs_inode *ni, ntfs_inode *dir_ni, ntfschar *name, u8 name_len) +{ + ntfs_attr_search_ctx *actx = NULL; + FILE_NAME_ATTR *fn = NULL; + BOOL looking_for_dos_name = FALSE, looking_for_win32_name = FALSE; + BOOL case_sensitive_match = TRUE; + int err = 0; +#if CACHE_NIDATA_SIZE + int i; +#endif +#if CACHE_INODE_SIZE + struct CACHED_INODE item; + const char *p; + u64 inum = (u64)-1; + int count; +#endif +#if CACHE_LOOKUP_SIZE + struct CACHED_LOOKUP lkitem; +#endif + + ntfs_log_trace("Entering.\n"); + + if (!ni || !dir_ni || !name || !name_len) { + ntfs_log_error("Invalid arguments.\n"); + errno = EINVAL; + goto err_out; + } + if (ni->nr_extents == -1) + ni = ni->base_ni; + if (dir_ni->nr_extents == -1) + dir_ni = dir_ni->base_ni; + /* + * Search for FILE_NAME attribute with such name. If it's in POSIX or + * WIN32_AND_DOS namespace, then simply remove it from index and inode. + * If filename in DOS or in WIN32 namespace, then remove DOS name first, + * only then remove WIN32 name. + */ + actx = ntfs_attr_get_search_ctx(ni, NULL); + if (!actx) + goto err_out; +search: + while (!ntfs_attr_lookup(AT_FILE_NAME, AT_UNNAMED, 0, CASE_SENSITIVE, + 0, NULL, 0, actx)) { + char *s; + IGNORE_CASE_BOOL case_sensitive = IGNORE_CASE; + + errno = 0; + fn = (FILE_NAME_ATTR*)((u8*)actx->attr + + le16_to_cpu(actx->attr->value_offset)); + s = ntfs_attr_name_get(fn->file_name, fn->file_name_length); + ntfs_log_trace("name: '%s' type: %d dos: %d win32: %d " + "case: %d\n", s, fn->file_name_type, + looking_for_dos_name, looking_for_win32_name, + case_sensitive_match); + ntfs_attr_name_free(&s); + if (looking_for_dos_name) { + if (fn->file_name_type == FILE_NAME_DOS) + break; + else + continue; + } + if (looking_for_win32_name) { + if (fn->file_name_type == FILE_NAME_WIN32) + break; + else + continue; + } + + /* Ignore hard links from other directories */ + if (dir_ni->mft_no != MREF_LE(fn->parent_directory)) { + ntfs_log_debug("MFT record numbers don't match " + "(%llu != %llu)\n", + (long long unsigned)dir_ni->mft_no, + (long long unsigned)MREF_LE(fn->parent_directory)); + continue; + } + if (case_sensitive_match + || ((fn->file_name_type == FILE_NAME_POSIX) + && NVolCaseSensitive(ni->vol))) + case_sensitive = CASE_SENSITIVE; + + if (ntfs_names_are_equal(fn->file_name, fn->file_name_length, + name, name_len, case_sensitive, + ni->vol->upcase, ni->vol->upcase_len)){ + + if (fn->file_name_type == FILE_NAME_WIN32) { + looking_for_dos_name = TRUE; + ntfs_attr_reinit_search_ctx(actx); + continue; + } + if (fn->file_name_type == FILE_NAME_DOS) + looking_for_dos_name = TRUE; + break; + } + } + if (errno) { + /* + * If case sensitive search failed, then try once again + * ignoring case. + */ + if (errno == ENOENT && case_sensitive_match) { + case_sensitive_match = FALSE; + ntfs_attr_reinit_search_ctx(actx); + goto search; + } + goto err_out; + } + + if (ntfs_check_unlinkable_dir(ni, fn) < 0) + goto err_out; + + if (ntfs_index_remove(dir_ni, ni, fn, le32_to_cpu(actx->attr->value_length))) + goto err_out; + + if (ntfs_attr_record_rm(actx)) + goto err_out; + + ni->mrec->link_count = cpu_to_le16(le16_to_cpu( + ni->mrec->link_count) - 1); + + ntfs_inode_mark_dirty(ni); + if (looking_for_dos_name) { + looking_for_dos_name = FALSE; + looking_for_win32_name = TRUE; + ntfs_attr_reinit_search_ctx(actx); + goto search; + } + /* TODO: Update object id, quota and securiry indexes if required. */ + /* + * If hard link count is not equal to zero then we are done. In other + * case there are no reference to this inode left, so we should free all + * non-resident attributes and mark all MFT record as not in use. + */ +#if CACHE_LOOKUP_SIZE + /* invalidate entry in lookup cache */ + lkitem.name = (const char*)NULL; + lkitem.namesize = 0; + lkitem.inum = ni->mft_no; + lkitem.parent = dir_ni->mft_no; + ntfs_invalidate_cache(vol->lookup_cache, GENERIC(&lkitem), + lookup_cache_inv_compare, CACHE_NOHASH); +#endif +#if CACHE_INODE_SIZE + inum = ni->mft_no; + if (pathname) { + /* invalide cache entry, even if there was an error */ + /* Remove leading /'s. */ + p = pathname; + while (*p == PATH_SEP) + p++; + if (p[0] && (p[strlen(p)-1] == PATH_SEP)) + ntfs_log_error("Unnormalized path %s\n",pathname); + item.pathname = p; + item.varsize = strlen(p); + } else { + item.pathname = (const char*)NULL; + item.varsize = 0; + } + item.inum = inum; + count = ntfs_invalidate_cache(vol->xinode_cache, GENERIC(&item), + inode_cache_inv_compare, CACHE_NOHASH); + if (pathname && !count) + ntfs_log_error("Could not delete inode cache entry for %s\n", + pathname); +#endif + if (ni->mrec->link_count) { + ntfs_inode_update_times(ni, NTFS_UPDATE_CTIME); + goto ok; + } + if (ntfs_delete_reparse_index(ni)) { + /* + * Failed to remove the reparse index : proceed anyway + * This is not a critical error, the entry is useless + * because of sequence_number, and stopping file deletion + * would be much worse as the file is not referenced now. + */ + err = errno; + } + if (ntfs_delete_object_id_index(ni)) { + /* + * Failed to remove the object id index : proceed anyway + * This is not a critical error. + */ + err = errno; + } + ntfs_attr_reinit_search_ctx(actx); + while (!ntfs_attrs_walk(actx)) { + if (actx->attr->non_resident) { + runlist *rl; + + rl = ntfs_mapping_pairs_decompress(ni->vol, actx->attr, + NULL); + if (!rl) { + err = errno; + ntfs_log_error("Failed to decompress runlist. " + "Leaving inconsistent metadata.\n"); + continue; + } + if (ntfs_cluster_free_from_rl(ni->vol, rl)) { + err = errno; + ntfs_log_error("Failed to free clusters. " + "Leaving inconsistent metadata.\n"); + continue; + } + free(rl); + } + } + if (errno != ENOENT) { + err = errno; + ntfs_log_error("Attribute enumeration failed. " + "Probably leaving inconsistent metadata.\n"); + } + /* All extents should be attached after attribute walk. */ +#if CACHE_NIDATA_SIZE + /* + * Disconnect extents before deleting them, so they are + * not wrongly moved to cache through the chainings + */ + for (i=ni->nr_extents-1; i>=0; i--) { + ni->extent_nis[i]->base_ni = (ntfs_inode*)NULL; + ni->extent_nis[i]->nr_extents = 0; + if (ntfs_mft_record_free(ni->vol, ni->extent_nis[i])) { + err = errno; + ntfs_log_error("Failed to free extent MFT record. " + "Leaving inconsistent metadata.\n"); + } + } + free(ni->extent_nis); + ni->nr_extents = 0; + ni->extent_nis = (ntfs_inode**)NULL; +#else + while (ni->nr_extents) + if (ntfs_mft_record_free(ni->vol, *(ni->extent_nis))) { + err = errno; + ntfs_log_error("Failed to free extent MFT record. " + "Leaving inconsistent metadata.\n"); + } +#endif + if (ntfs_mft_record_free(ni->vol, ni)) { + err = errno; + ntfs_log_error("Failed to free base MFT record. " + "Leaving inconsistent metadata.\n"); + } + ni = NULL; +ok: + ntfs_inode_update_times(dir_ni, NTFS_UPDATE_MCTIME); +out: + if (actx) + ntfs_attr_put_search_ctx(actx); + if (ntfs_inode_close(dir_ni) && !err) + err = errno; + if (ntfs_inode_close(ni) && !err) + err = errno; + if (err) { + errno = err; + ntfs_log_debug("Could not delete file: %s\n", strerror(errno)); + return -1; + } + ntfs_log_trace("Done.\n"); + return 0; +err_out: + err = errno; + goto out; +} + +/** + * ntfs_link - create hard link for file or directory + * @ni: ntfs inode for object to create hard link + * @dir_ni: ntfs inode for directory in which new link should be placed + * @name: unicode name of the new link + * @name_len: length of the name in unicode characters + * + * NOTE: At present we allow creating hardlinks to directories, we use them + * in a temporary state during rename. But it's defenitely bad idea to have + * hard links to directories as a result of operation. + * FIXME: Create internal __ntfs_link that allows hard links to a directories + * and external ntfs_link that do not. Write ntfs_rename that uses __ntfs_link. + * + * Return 0 on success or -1 on error with errno set to the error code. + */ +static int ntfs_link_i(ntfs_inode *ni, ntfs_inode *dir_ni, ntfschar *name, + u8 name_len, FILE_NAME_TYPE_FLAGS nametype) +{ + FILE_NAME_ATTR *fn = NULL; + int fn_len, err; + + ntfs_log_trace("Entering.\n"); + + if (!ni || !dir_ni || !name || !name_len || + ni->mft_no == dir_ni->mft_no) { + err = EINVAL; + ntfs_log_perror("ntfs_link wrong arguments"); + goto err_out; + } + + if ((ni->flags & FILE_ATTR_REPARSE_POINT) + && !ntfs_possible_symlink(ni)) { + err = EOPNOTSUPP; + goto err_out; + } + + /* Create FILE_NAME attribute. */ + fn_len = sizeof(FILE_NAME_ATTR) + name_len * sizeof(ntfschar); + fn = ntfs_calloc(fn_len); + if (!fn) { + err = errno; + goto err_out; + } + fn->parent_directory = MK_LE_MREF(dir_ni->mft_no, + le16_to_cpu(dir_ni->mrec->sequence_number)); + fn->file_name_length = name_len; + fn->file_name_type = nametype; + fn->file_attributes = ni->flags; + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) { + fn->file_attributes |= FILE_ATTR_I30_INDEX_PRESENT; + fn->data_size = fn->allocated_size = const_cpu_to_le64(0); + } else { + fn->allocated_size = cpu_to_sle64(ni->allocated_size); + fn->data_size = cpu_to_sle64(ni->data_size); + } + fn->creation_time = ni->creation_time; + fn->last_data_change_time = ni->last_data_change_time; + fn->last_mft_change_time = ni->last_mft_change_time; + fn->last_access_time = ni->last_access_time; + memcpy(fn->file_name, name, name_len * sizeof(ntfschar)); + /* Add FILE_NAME attribute to index. */ + if (ntfs_index_add_filename(dir_ni, fn, MK_MREF(ni->mft_no, + le16_to_cpu(ni->mrec->sequence_number)))) { + err = errno; + ntfs_log_perror("Failed to add filename to the index"); + goto err_out; + } + /* Add FILE_NAME attribute to inode. */ + if (ntfs_attr_add(ni, AT_FILE_NAME, AT_UNNAMED, 0, (u8*)fn, fn_len)) { + ntfs_log_error("Failed to add FILE_NAME attribute.\n"); + err = errno; + /* Try to remove just added attribute from index. */ + if (ntfs_index_remove(dir_ni, ni, fn, fn_len)) + goto rollback_failed; + goto err_out; + } + /* Increment hard links count. */ + ni->mrec->link_count = cpu_to_le16(le16_to_cpu( + ni->mrec->link_count) + 1); + /* Done! */ + ntfs_inode_mark_dirty(ni); + free(fn); + ntfs_log_trace("Done.\n"); + return 0; +rollback_failed: + ntfs_log_error("Rollback failed. Leaving inconsistent metadata.\n"); +err_out: + free(fn); + errno = err; + return -1; +} + +int ntfs_link(ntfs_inode *ni, ntfs_inode *dir_ni, ntfschar *name, u8 name_len) +{ + return (ntfs_link_i(ni, dir_ni, name, name_len, FILE_NAME_POSIX)); +} + +/* + * Get a parent directory from an inode entry + * + * This is only used in situations where the path used to access + * the current file is not known for sure. The result may be different + * from the path when the file is linked in several parent directories. + * + * Currently this is only used for translating ".." in the target + * of a Vista relative symbolic link + */ + +ntfs_inode *ntfs_dir_parent_inode(ntfs_inode *ni) +{ + ntfs_inode *dir_ni = (ntfs_inode*)NULL; + u64 inum; + FILE_NAME_ATTR *fn; + ntfs_attr_search_ctx *ctx; + + if (ni->mft_no != FILE_root) { + /* find the name in the attributes */ + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + return ((ntfs_inode*)NULL); + + if (!ntfs_attr_lookup(AT_FILE_NAME, AT_UNNAMED, 0, + CASE_SENSITIVE, 0, NULL, 0, ctx)) { + /* We know this will always be resident. */ + fn = (FILE_NAME_ATTR*)((u8*)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + inum = le64_to_cpu(fn->parent_directory); + if (inum != (u64)-1) { + dir_ni = ntfs_inode_open(ni->vol, MREF(inum)); + } + } + ntfs_attr_put_search_ctx(ctx); + } + return (dir_ni); +} + +#ifdef HAVE_SETXATTR + +#define MAX_DOS_NAME_LENGTH 12 + +/* + * Get a DOS name for a file in designated directory + * + * Returns size if found + * 0 if not found + * -1 if there was an error (described by errno) + */ + +static int get_dos_name(ntfs_inode *ni, u64 dnum, ntfschar *dosname) +{ + size_t outsize = 0; + FILE_NAME_ATTR *fn; + ntfs_attr_search_ctx *ctx; + + /* find the name in the attributes */ + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + return -1; + + while (!ntfs_attr_lookup(AT_FILE_NAME, AT_UNNAMED, 0, CASE_SENSITIVE, + 0, NULL, 0, ctx)) { + /* We know this will always be resident. */ + fn = (FILE_NAME_ATTR*)((u8*)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + + if ((fn->file_name_type & FILE_NAME_DOS) + && (MREF_LE(fn->parent_directory) == dnum)) { + /* + * Found a DOS or WIN32+DOS name for the entry + * copy name, after truncation for safety + */ + outsize = fn->file_name_length; +/* TODO : reject if name is too long ? */ + if (outsize > MAX_DOS_NAME_LENGTH) + outsize = MAX_DOS_NAME_LENGTH; + memcpy(dosname,fn->file_name,outsize*sizeof(ntfschar)); + } + } + ntfs_attr_put_search_ctx(ctx); + return (outsize); +} + + +/* + * Get a long name for a file in designated directory + * + * Returns size if found + * 0 if not found + * -1 if there was an error (described by errno) + */ + +static int get_long_name(ntfs_inode *ni, u64 dnum, ntfschar *longname) +{ + size_t outsize = 0; + FILE_NAME_ATTR *fn; + ntfs_attr_search_ctx *ctx; + + /* find the name in the attributes */ + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + return -1; + + /* first search for WIN32 or DOS+WIN32 names */ + while (!ntfs_attr_lookup(AT_FILE_NAME, AT_UNNAMED, 0, CASE_SENSITIVE, + 0, NULL, 0, ctx)) { + /* We know this will always be resident. */ + fn = (FILE_NAME_ATTR*)((u8*)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + + if ((fn->file_name_type & FILE_NAME_WIN32) + && (MREF_LE(fn->parent_directory) == dnum)) { + /* + * Found a WIN32 or WIN32+DOS name for the entry + * copy name + */ + outsize = fn->file_name_length; + memcpy(longname,fn->file_name,outsize*sizeof(ntfschar)); + } + } + /* if not found search for POSIX names */ + if (!outsize) { + ntfs_attr_reinit_search_ctx(ctx); + while (!ntfs_attr_lookup(AT_FILE_NAME, AT_UNNAMED, 0, CASE_SENSITIVE, + 0, NULL, 0, ctx)) { + /* We know this will always be resident. */ + fn = (FILE_NAME_ATTR*)((u8*)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + + if ((fn->file_name_type == FILE_NAME_POSIX) + && (MREF_LE(fn->parent_directory) == dnum)) { + /* + * Found a POSIX name for the entry + * copy name + */ + outsize = fn->file_name_length; + memcpy(longname,fn->file_name,outsize*sizeof(ntfschar)); + } + } + } + ntfs_attr_put_search_ctx(ctx); + return (outsize); +} + + +/* + * Get the ntfs DOS name into an extended attribute + */ + +int ntfs_get_ntfs_dos_name(ntfs_inode *ni, ntfs_inode *dir_ni, + char *value, size_t size) +{ + int outsize = 0; + char *outname = (char*)NULL; + u64 dnum; + int doslen; + ntfschar dosname[MAX_DOS_NAME_LENGTH]; + + dnum = dir_ni->mft_no; + doslen = get_dos_name(ni, dnum, dosname); + if (doslen > 0) { + /* + * Found a DOS name for the entry, make + * uppercase and encode into the buffer + * if there is enough space + */ + ntfs_name_upcase(dosname, doslen, + ni->vol->upcase, ni->vol->upcase_len); + if (ntfs_ucstombs(dosname, doslen, &outname, size) < 0) { + ntfs_log_error("Cannot represent dosname in current locale.\n"); + outsize = -errno; + } else { + outsize = strlen(outname); + if (value && (outsize <= (int)size)) + memcpy(value, outname, outsize); + else + if (size && (outsize > (int)size)) + outsize = -ERANGE; + free(outname); + } + } else { + if (doslen == 0) + errno = ENODATA; + outsize = -errno; + } + return (outsize); +} + +/* + * Change the name space of an existing file or directory + * + * Returns the old namespace if successful + * -1 if an error occurred (described by errno) + */ + +static int set_namespace(ntfs_inode *ni, ntfs_inode *dir_ni, + ntfschar *name, int len, + FILE_NAME_TYPE_FLAGS nametype) +{ + ntfs_attr_search_ctx *actx; + ntfs_index_context *icx; + FILE_NAME_ATTR *fnx; + FILE_NAME_ATTR *fn = NULL; + BOOL found; + int lkup; + int ret; + + ret = -1; + actx = ntfs_attr_get_search_ctx(ni, NULL); + if (actx) { + found = FALSE; + do { + lkup = ntfs_attr_lookup(AT_FILE_NAME, AT_UNNAMED, 0, + CASE_SENSITIVE, 0, NULL, 0, actx); + if (!lkup) { + fn = (FILE_NAME_ATTR*)((u8*)actx->attr + + le16_to_cpu(actx->attr->value_offset)); + found = (MREF_LE(fn->parent_directory) + == dir_ni->mft_no) + && !memcmp(fn->file_name, name, + len*sizeof(ntfschar)); + } + } while (!lkup && !found); + if (found) { + icx = ntfs_index_ctx_get(dir_ni, NTFS_INDEX_I30, 4); + if (icx) { + lkup = ntfs_index_lookup((char*)fn, len, icx); + if (!lkup && icx->data && icx->data_len) { + fnx = (FILE_NAME_ATTR*)icx->data; + ret = fn->file_name_type; + fn->file_name_type = nametype; + fnx->file_name_type = nametype; + ntfs_inode_mark_dirty(ni); + ntfs_index_entry_mark_dirty(icx); + } + ntfs_index_ctx_put(icx); + } + } + ntfs_attr_put_search_ctx(actx); + } + return (ret); +} + +/* + * Set a DOS name to a file and adjust name spaces + * + * If the new names are collapsible (same uppercased chars) : + * + * - the existing DOS name or DOS+Win32 name is made Posix + * - if it was a real DOS name, the existing long name is made DOS+Win32 + * and the existing DOS name is deleted + * - finally the existing long name is made DOS+Win32 unless already done + * + * If the new names are not collapsible : + * + * - insert the short name as a DOS name + * - delete the old long name or existing short name + * - insert the new long name (as a Win32 or DOS+Win32 name) + * + * Deleting the old long name will not delete the file + * provided the old name was in the Posix name space, + * because the alternate name has been set before. + * + * The inodes of file and parent directory are always closed + * + * Returns 0 if successful + * -1 if failed + */ + +static int set_dos_name(ntfs_inode *ni, ntfs_inode *dir_ni, + ntfschar *shortname, int shortlen, + ntfschar *longname, int longlen, + ntfschar *deletename, int deletelen, BOOL existed) +{ + unsigned int linkcount; + ntfs_volume *vol; + BOOL collapsible; + BOOL deleted; + BOOL done; + FILE_NAME_TYPE_FLAGS oldnametype; + u64 dnum; + u64 fnum; + int res; + + res = -1; + vol = ni->vol; + dnum = dir_ni->mft_no; + fnum = ni->mft_no; + /* save initial link count */ + linkcount = le16_to_cpu(ni->mrec->link_count); + + /* check whether the same name may be used as DOS and WIN32 */ + collapsible = ntfs_collapsible_chars(ni->vol, shortname, shortlen, + longname, longlen); + if (collapsible) { + deleted = FALSE; + done = FALSE; + if (existed) { + oldnametype = set_namespace(ni, dir_ni, deletename, + deletelen, FILE_NAME_POSIX); + if (oldnametype == FILE_NAME_DOS) { + if (set_namespace(ni, dir_ni, longname, longlen, + FILE_NAME_WIN32_AND_DOS) >= 0) { + if (!ntfs_delete(vol, + (const char*)NULL, ni, dir_ni, + deletename, deletelen)) + res = 0; + deleted = TRUE; + } else + done = TRUE; + } + } + if (!deleted) { + if (!done && (set_namespace(ni, dir_ni, + longname, longlen, + FILE_NAME_WIN32_AND_DOS) >= 0)) + res = 0; + ntfs_inode_update_times(ni, NTFS_UPDATE_CTIME); + ntfs_inode_update_times(dir_ni, NTFS_UPDATE_MCTIME); + if (ntfs_inode_close_in_dir(ni,dir_ni) && !res) + res = -1; + if (ntfs_inode_close(dir_ni) && !res) + res = -1; + } + } else { + if (!ntfs_link_i(ni, dir_ni, shortname, shortlen, + FILE_NAME_DOS) + /* make sure a new link was recorded */ + && (le16_to_cpu(ni->mrec->link_count) > linkcount)) { + /* delete the existing long name or short name */ +// is it ok to not provide the path ? + if (!ntfs_delete(vol, (char*)NULL, ni, dir_ni, + deletename, deletelen)) { + /* delete closes the inodes, so have to open again */ + dir_ni = ntfs_inode_open(vol, dnum); + if (dir_ni) { + ni = ntfs_inode_open(vol, fnum); + if (ni) { + if (!ntfs_link_i(ni, dir_ni, + longname, longlen, + FILE_NAME_WIN32)) + res = 0; + if (ntfs_inode_close_in_dir(ni, + dir_ni) + && !res) + res = -1; + } + if (ntfs_inode_close(dir_ni) && !res) + res = -1; + } + } + } else { + ntfs_inode_close_in_dir(ni,dir_ni); + ntfs_inode_close(dir_ni); + } + } + return (res); +} + + +/* + * Set the ntfs DOS name into an extended attribute + * + * The DOS name will be added as another file name attribute + * using the existing file name information from the original + * name or overwriting the DOS Name if one exists. + * + * The inode of the file is always closed + */ + +int ntfs_set_ntfs_dos_name(ntfs_inode *ni, ntfs_inode *dir_ni, + const char *value, size_t size, int flags) +{ + int res = 0; + int longlen = 0; + int shortlen = 0; + char newname[MAX_DOS_NAME_LENGTH + 1]; + ntfschar oldname[MAX_DOS_NAME_LENGTH]; + int oldlen; + ntfs_volume *vol; + u64 fnum; + u64 dnum; + BOOL closed = FALSE; + ntfschar *shortname = NULL; + ntfschar longname[NTFS_MAX_NAME_LEN]; + + vol = ni->vol; + fnum = ni->mft_no; + /* convert the string to the NTFS wide chars */ + if (size > MAX_DOS_NAME_LENGTH) + size = MAX_DOS_NAME_LENGTH; + strncpy(newname, value, size); + newname[size] = 0; + shortlen = ntfs_mbstoucs(newname, &shortname); + /* make sure the short name has valid chars */ + if ((shortlen < 0) || ntfs_forbidden_chars(shortname,shortlen)) { + ntfs_inode_close_in_dir(ni,dir_ni); + ntfs_inode_close(dir_ni); + res = -errno; + return res; + } + dnum = dir_ni->mft_no; + longlen = get_long_name(ni, dnum, longname); + if (longlen > 0) { + oldlen = get_dos_name(ni, dnum, oldname); + if ((oldlen >= 0) + && !ntfs_forbidden_chars(longname, longlen)) { + if (oldlen > 0) { + if (flags & XATTR_CREATE) { + res = -1; + errno = EEXIST; + } else + if ((shortlen == oldlen) + && !memcmp(shortname,oldname, + oldlen*sizeof(ntfschar))) + /* already set, done */ + res = 0; + else { + res = set_dos_name(ni, dir_ni, + shortname, shortlen, + longname, longlen, + oldname, oldlen, TRUE); + closed = TRUE; + } + } else { + if (flags & XATTR_REPLACE) { + res = -1; + errno = ENODATA; + } else { + res = set_dos_name(ni, dir_ni, + shortname, shortlen, + longname, longlen, + longname, longlen, FALSE); + closed = TRUE; + } + } + } else + res = -1; + } else { + res = -1; + errno = ENOENT; + } + free(shortname); + if (!closed) { + ntfs_inode_close_in_dir(ni,dir_ni); + ntfs_inode_close(dir_ni); + } + return (res ? -1 : 0); +} + +/* + * Delete the ntfs DOS name + */ + +int ntfs_remove_ntfs_dos_name(ntfs_inode *ni, ntfs_inode *dir_ni) +{ + int res; + int oldnametype; + int longlen = 0; + int shortlen; + u64 dnum; + ntfs_volume *vol; + BOOL deleted = FALSE; + ntfschar shortname[MAX_DOS_NAME_LENGTH]; + ntfschar longname[NTFS_MAX_NAME_LEN]; + + res = -1; + vol = ni->vol; + dnum = dir_ni->mft_no; + longlen = get_long_name(ni, dnum, longname); + if (longlen > 0) { + shortlen = get_dos_name(ni, dnum, shortname); + if (shortlen >= 0) { + /* migrate the long name as Posix */ + oldnametype = set_namespace(ni,dir_ni,longname,longlen, + FILE_NAME_POSIX); + switch (oldnametype) { + case FILE_NAME_WIN32_AND_DOS : + /* name was Win32+DOS : done */ + res = 0; + break; + case FILE_NAME_DOS : + /* name was DOS, make it back to DOS */ + set_namespace(ni,dir_ni,longname,longlen, + FILE_NAME_DOS); + errno = ENOENT; + break; + case FILE_NAME_WIN32 : + /* name was Win32, make it Posix and delete */ + if (set_namespace(ni,dir_ni,shortname,shortlen, + FILE_NAME_POSIX) >= 0) { + if (!ntfs_delete(vol, + (const char*)NULL, ni, + dir_ni, shortname, + shortlen)) + res = 0; + deleted = TRUE; + } else { + /* + * DOS name has been found, but cannot + * migrate to Posix : something bad + * has happened + */ + errno = EIO; + ntfs_log_error("Could not change" + " DOS name of inode %lld to Posix\n", + (long long)ni->mft_no); + } + break; + default : + /* name was Posix or not found : error */ + errno = ENOENT; + break; + } + } + } else { + errno = ENOENT; + res = -1; + } + if (!deleted) { + ntfs_inode_close_in_dir(ni,dir_ni); + ntfs_inode_close(dir_ni); + } + return (res); +} + +#endif diff --git a/portlibs/sources/libntfs/dir.h b/portlibs/sources/libntfs/dir.h new file mode 100644 index 00000000..56e76fe7 --- /dev/null +++ b/portlibs/sources/libntfs/dir.h @@ -0,0 +1,128 @@ +/* + * dir.h - Exports for directory handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2002 Anton Altaparmakov + * Copyright (c) 2005-2006 Yura Pakhuchiy + * Copyright (c) 2004-2005 Richard Russon + * Copyright (c) 2005-2008 Szabolcs Szakacsits + * + * 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 + */ + +#ifndef _NTFS_DIR_H +#define _NTFS_DIR_H + +#include "types.h" + +#define PATH_SEP '/' + +/* + * We do not have these under DJGPP, so define our version that do not conflict + * with other S_IFs defined under DJGPP. + */ +#ifdef DJGPP +#ifndef S_IFLNK +#define S_IFLNK 0120000 +#endif +#ifndef S_ISLNK +#define S_ISLNK(m) (((m) & S_IFMT) == S_IFLNK) +#endif +#ifndef S_IFSOCK +#define S_IFSOCK 0140000 +#endif +#ifndef S_ISSOCK +#define S_ISSOCK(m) (((m) & S_IFMT) == S_IFSOCK) +#endif +#endif + +/* + * The little endian Unicode strings $I30, $SII, $SDH, $O, $Q, $R + * as a global constant. + */ +extern ntfschar NTFS_INDEX_I30[5]; +extern ntfschar NTFS_INDEX_SII[5]; +extern ntfschar NTFS_INDEX_SDH[5]; +extern ntfschar NTFS_INDEX_O[3]; +extern ntfschar NTFS_INDEX_Q[3]; +extern ntfschar NTFS_INDEX_R[3]; + +extern u64 ntfs_inode_lookup_by_name(ntfs_inode *dir_ni, + const ntfschar *uname, const int uname_len); +extern u64 ntfs_inode_lookup_by_mbsname(ntfs_inode *dir_ni, const char *name); +extern void ntfs_inode_update_mbsname(ntfs_inode *dir_ni, const char *name, + u64 inum); + +extern ntfs_inode *ntfs_pathname_to_inode(ntfs_volume *vol, ntfs_inode *parent, + const char *pathname); +extern ntfs_inode *ntfs_create(ntfs_inode *dir_ni, le32 securid, + ntfschar *name, u8 name_len, mode_t type); +extern ntfs_inode *ntfs_create_device(ntfs_inode *dir_ni, le32 securid, + ntfschar *name, u8 name_len, mode_t type, dev_t dev); +extern ntfs_inode *ntfs_create_symlink(ntfs_inode *dir_ni, le32 securid, + ntfschar *name, u8 name_len, ntfschar *target, int target_len); +extern int ntfs_check_empty_dir(ntfs_inode *ni); +extern int ntfs_delete(ntfs_volume *vol, const char *path, + ntfs_inode *ni, ntfs_inode *dir_ni, ntfschar *name, + u8 name_len); + +extern int ntfs_link(ntfs_inode *ni, ntfs_inode *dir_ni, ntfschar *name, + u8 name_len); + +/* + * File types (adapted from include <linux/fs.h>) + */ +#define NTFS_DT_UNKNOWN 0 +#define NTFS_DT_FIFO 1 +#define NTFS_DT_CHR 2 +#define NTFS_DT_DIR 4 +#define NTFS_DT_BLK 6 +#define NTFS_DT_REG 8 +#define NTFS_DT_LNK 10 +#define NTFS_DT_SOCK 12 +#define NTFS_DT_WHT 14 + +/* + * This is the "ntfs_filldir" function type, used by ntfs_readdir() to let + * the caller specify what kind of dirent layout it wants to have. + * This allows the caller to read directories into their application or + * to have different dirent layouts depending on the binary type. + */ +typedef int (*ntfs_filldir_t)(void *dirent, const ntfschar *name, + const int name_len, const int name_type, const s64 pos, + const MFT_REF mref, const unsigned dt_type); + +extern int ntfs_readdir(ntfs_inode *dir_ni, s64 *pos, + void *dirent, ntfs_filldir_t filldir); + +ntfs_inode *ntfs_dir_parent_inode(ntfs_inode *ni); + +int ntfs_get_ntfs_dos_name(ntfs_inode *ni, ntfs_inode *dir_ni, + char *value, size_t size); +int ntfs_set_ntfs_dos_name(ntfs_inode *ni, ntfs_inode *dir_ni, + const char *value, size_t size, int flags); +int ntfs_remove_ntfs_dos_name(ntfs_inode *ni, ntfs_inode *dir_ni); + +#if CACHE_INODE_SIZE + +struct CACHED_GENERIC; + +extern int ntfs_dir_inode_hash(const struct CACHED_GENERIC *cached); +extern int ntfs_dir_lookup_hash(const struct CACHED_GENERIC *cached); + +#endif + +#endif /* defined _NTFS_DIR_H */ + diff --git a/portlibs/sources/libntfs/efs.c b/portlibs/sources/libntfs/efs.c new file mode 100644 index 00000000..6ccec20a --- /dev/null +++ b/portlibs/sources/libntfs/efs.c @@ -0,0 +1,439 @@ +/** + * efs.c - Limited processing of encrypted files + * + * This module is part of ntfs-3g library + * + * Copyright (c) 2009 Martin Bene + * Copyright (c) 2009-2010 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_SETXATTR +#include <sys/xattr.h> +#endif + +#ifdef HAVE_SYS_SYSMACROS_H +#include <sys/sysmacros.h> +#endif + +#include "types.h" +#include "debug.h" +#include "attrib.h" +#include "inode.h" +#include "dir.h" +#include "efs.h" +#include "index.h" +#include "logging.h" +#include "misc.h" +#include "efs.h" + +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +static ntfschar logged_utility_stream_name[] = { + const_cpu_to_le16('$'), + const_cpu_to_le16('E'), + const_cpu_to_le16('F'), + const_cpu_to_le16('S'), + const_cpu_to_le16(0) +} ; + + +/* + * Get the ntfs EFS info into an extended attribute + */ + +int ntfs_get_efs_info(ntfs_inode *ni, char *value, size_t size) +{ + EFS_ATTR_HEADER *efs_info; + s64 attr_size = 0; + + if (ni) { + if (ni->flags & FILE_ATTR_ENCRYPTED) { + efs_info = (EFS_ATTR_HEADER*)ntfs_attr_readall(ni, + AT_LOGGED_UTILITY_STREAM,(ntfschar*)NULL, 0, + &attr_size); + if (efs_info + && (le32_to_cpu(efs_info->length) == attr_size)) { + if (attr_size <= (s64)size) { + if (value) + memcpy(value,efs_info,attr_size); + else { + errno = EFAULT; + attr_size = 0; + } + } else + if (size) { + errno = ERANGE; + attr_size = 0; + } + free (efs_info); + } else { + if (efs_info) { + free(efs_info); + ntfs_log_error("Bad efs_info for inode %lld\n", + (long long)ni->mft_no); + } else { + ntfs_log_error("Could not get efsinfo" + " for inode %lld\n", + (long long)ni->mft_no); + } + errno = EIO; + attr_size = 0; + } + } else { + errno = ENODATA; + ntfs_log_trace("Inode %lld is not encrypted\n", + (long long)ni->mft_no); + } + } + return (attr_size ? (int)attr_size : -errno); +} + +/* + * Fix all encrypted AT_DATA attributes of an inode + * + * The fix may require making an attribute non resident, which + * requires more space in the MFT record, and may cause some + * attribute to be expelled and the full record to be reorganized. + * When this happens, the search for data attributes has to be + * reinitialized. + * + * Returns zero if successful. + * -1 if there is a problem. + */ + +static int fixup_loop(ntfs_inode *ni) +{ + ntfs_attr_search_ctx *ctx; + ntfs_attr *na; + ATTR_RECORD *a; + BOOL restart; + BOOL first; + int cnt; + int maxcnt; + int res = 0; + + maxcnt = 0; + do { + restart = FALSE; + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) { + ntfs_log_error("Failed to get ctx for efs\n"); + res = -1; + } + cnt = 0; + while (!restart && !res + && !ntfs_attr_lookup(AT_DATA, NULL, 0, + CASE_SENSITIVE, 0, NULL, 0, ctx)) { + cnt++; + a = ctx->attr; + na = ntfs_attr_open(ctx->ntfs_ino, AT_DATA, + (ntfschar*)((u8*)a + le16_to_cpu(a->name_offset)), + a->name_length); + if (!na) { + ntfs_log_error("can't open DATA Attribute\n"); + res = -1; + } + if (na && !(ctx->attr->flags & ATTR_IS_ENCRYPTED)) { + if (!NAttrNonResident(na) + && ntfs_attr_make_non_resident(na, ctx)) { + /* + * ntfs_attr_make_non_resident fails if there + * is not enough space in the MFT record. + * When this happens, force making non-resident + * so that some other attribute is expelled. + */ + if (ntfs_attr_force_non_resident(na)) { + res = -1; + } else { + /* make sure there is some progress */ + if (cnt <= maxcnt) { + errno = EIO; + ntfs_log_error("Multiple failure" + " making non resident\n"); + res = -1; + } else { + ntfs_attr_put_search_ctx(ctx); + ctx = (ntfs_attr_search_ctx*)NULL; + restart = TRUE; + maxcnt = cnt; + } + } + } + if (!restart && !res + && ntfs_efs_fixup_attribute(ctx, na)) { + ntfs_log_error("Error in efs fixup of AT_DATA Attribute\n"); + res = -1; + } + } + if (na) + ntfs_attr_close(na); + } + first = FALSE; + } while (restart && !res); + if (ctx) + ntfs_attr_put_search_ctx(ctx); + return (res); +} + +/* + * Set the efs data from an extended attribute + * Warning : the new data is not checked + * Returns 0, or -1 if there is a problem + */ + +int ntfs_set_efs_info(ntfs_inode *ni, const char *value, size_t size, + int flags) + +{ + int res; + int written; + ntfs_attr *na; + const EFS_ATTR_HEADER *info_header; + + res = 0; + if (ni && value && size) { + if (ni->flags & (FILE_ATTR_ENCRYPTED | FILE_ATTR_COMPRESSED)) { + if (ni->flags & FILE_ATTR_ENCRYPTED) { + ntfs_log_trace("Inode %lld already encrypted\n", + (long long)ni->mft_no); + errno = EEXIST; + } else { + /* + * Possible problem : if encrypted file was + * restored in a compressed directory, it was + * restored as compressed. + * TODO : decompress first. + */ + ntfs_log_error("Inode %lld cannot be encrypted and compressed\n", + (long long)ni->mft_no); + errno = EIO; + } + return -1; + } + info_header = (const EFS_ATTR_HEADER*)value; + /* make sure we get a likely efsinfo */ + if (le32_to_cpu(info_header->length) != size) { + errno = EINVAL; + return (-1); + } + if (!ntfs_attr_exist(ni,AT_LOGGED_UTILITY_STREAM, + (ntfschar*)NULL,0)) { + if (!(flags & XATTR_REPLACE)) { + /* + * no logged_utility_stream attribute : add one, + * apparently, this does not feed the new value in + */ + res = ntfs_attr_add(ni,AT_LOGGED_UTILITY_STREAM, + logged_utility_stream_name,4, + (u8*)NULL,(s64)size); + } else { + errno = ENODATA; + res = -1; + } + } else { + errno = EEXIST; + res = -1; + } + if (!res) { + /* + * open and update the existing efs data + */ + na = ntfs_attr_open(ni, AT_LOGGED_UTILITY_STREAM, + logged_utility_stream_name, 4); + if (na) { + /* resize attribute */ + res = ntfs_attr_truncate(na, (s64)size); + /* overwrite value if any */ + if (!res && value) { + written = (int)ntfs_attr_pwrite(na, + (s64)0, (s64)size, value); + if (written != (s64)size) { + ntfs_log_error("Failed to " + "update efs data\n"); + errno = EIO; + res = -1; + } + } + ntfs_attr_close(na); + } else + res = -1; + } + if (!res) { + /* Don't handle AT_DATA Attribute(s) if inode is a directory */ + if (!(ni->mrec->flags & MFT_RECORD_IS_DIRECTORY)) { + /* iterate over AT_DATA attributes */ + /* set encrypted flag, truncate attribute to match padding bytes */ + + if (fixup_loop(ni)) + return -1; + } + ni->flags |= FILE_ATTR_ENCRYPTED; + NInoSetDirty(ni); + NInoFileNameSetDirty(ni); + } + } else { + errno = EINVAL; + res = -1; + } + return (res ? -1 : 0); +} + +/* + * Fixup raw encrypted AT_DATA Attribute + * read padding length from last two bytes + * truncate attribute, make non-resident, + * set data size to match padding length + * set ATTR_IS_ENCRYPTED flag on attribute + * + * Return 0 if successful + * -1 if failed (errno tells why) + */ + +int ntfs_efs_fixup_attribute(ntfs_attr_search_ctx *ctx, ntfs_attr *na) +{ + u64 newsize; + u64 oldsize; + le16 appended_bytes; + u16 padding_length; + ntfs_inode *ni; + BOOL close_ctx = FALSE; + + if (!na) { + ntfs_log_error("no na specified for efs_fixup_attribute\n"); + goto err_out; + } + if (!ctx) { + ctx = ntfs_attr_get_search_ctx(na->ni, NULL); + if (!ctx) { + ntfs_log_error("Failed to get ctx for efs\n"); + goto err_out; + } + close_ctx = TRUE; + if (ntfs_attr_lookup(AT_DATA, na->name, na->name_len, + CASE_SENSITIVE, 0, NULL, 0, ctx)) { + ntfs_log_error("attr lookup for AT_DATA attribute failed in efs fixup\n"); + goto err_out; + } + } else { + if (!NAttrNonResident(na)) { + ntfs_log_error("Cannot make non resident" + " when a context has been allocated\n"); + goto err_out; + } + } + + /* no extra bytes are added to void attributes */ + oldsize = na->data_size; + if (oldsize) { + /* make sure size is valid for a raw encrypted stream */ + if ((oldsize & 511) != 2) { + ntfs_log_error("Bad raw encrypted stream\n"); + goto err_out; + } + /* read padding length from last two bytes of attribute */ + if (ntfs_attr_pread(na, oldsize - 2, 2, &appended_bytes) != 2) { + ntfs_log_error("Error reading padding length\n"); + goto err_out; + } + padding_length = le16_to_cpu(appended_bytes); + if (padding_length > 511 || padding_length > na->data_size-2) { + errno = EINVAL; + ntfs_log_error("invalid padding length %d for data_size %lld\n", + padding_length, (long long)oldsize); + goto err_out; + } + newsize = oldsize - padding_length - 2; + /* + * truncate attribute to possibly free clusters allocated + * for the last two bytes, but do not truncate to new size + * to avoid losing useful data + */ + if (ntfs_attr_truncate(na, oldsize - 2)) { + ntfs_log_error("Error truncating attribute\n"); + goto err_out; + } + } else + newsize = 0; + + /* + * Encrypted AT_DATA Attributes MUST be non-resident + * This has to be done after the attribute is resized, as + * resizing down to zero may cause the attribute to be made + * resident. + */ + if (!NAttrNonResident(na) + && ntfs_attr_make_non_resident(na, ctx)) { + if (!close_ctx + || ntfs_attr_force_non_resident(na)) { + ntfs_log_error("Error making DATA attribute non-resident\n"); + goto err_out; + } else { + /* + * must reinitialize context after forcing + * non-resident. We need a context for updating + * the state, and at this point, we are sure + * the context is not used elsewhere. + */ + ntfs_attr_reinit_search_ctx(ctx); + if (ntfs_attr_lookup(AT_DATA, na->name, na->name_len, + CASE_SENSITIVE, 0, NULL, 0, ctx)) { + ntfs_log_error("attr lookup for AT_DATA attribute failed in efs fixup\n"); + goto err_out; + } + } + } + ni = na->ni; + if (!na->name_len) { + ni->data_size = newsize; + ni->allocated_size = na->allocated_size; + } + NInoSetDirty(ni); + NInoFileNameSetDirty(ni); + + ctx->attr->data_size = cpu_to_le64(newsize); + if (le64_to_cpu(ctx->attr->initialized_size) > newsize) + ctx->attr->initialized_size = ctx->attr->data_size; + ctx->attr->flags |= ATTR_IS_ENCRYPTED; + if (close_ctx) + ntfs_attr_put_search_ctx(ctx); + + return (0); +err_out: + if (close_ctx && ctx) + ntfs_attr_put_search_ctx(ctx); + return (-1); +} + +#endif /* HAVE_SETXATTR */ diff --git a/portlibs/sources/libntfs/efs.h b/portlibs/sources/libntfs/efs.h new file mode 100644 index 00000000..6eada067 --- /dev/null +++ b/portlibs/sources/libntfs/efs.h @@ -0,0 +1,30 @@ +/* + * + * Copyright (c) 2009 Martin Bene + * + * 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 + */ + +#ifndef EFS_H +#define EFS_H + +int ntfs_get_efs_info(ntfs_inode *ni, char *value, size_t size); + +int ntfs_set_efs_info(ntfs_inode *ni, + const char *value, size_t size, int flags); +int ntfs_efs_fixup_attribute(ntfs_attr_search_ctx *ctx, ntfs_attr *na); + +#endif /* EFS_H */ diff --git a/portlibs/sources/libntfs/endians.h b/portlibs/sources/libntfs/endians.h new file mode 100644 index 00000000..397f1c20 --- /dev/null +++ b/portlibs/sources/libntfs/endians.h @@ -0,0 +1,203 @@ +/* + * endians.h - Definitions related to handling of byte ordering. + * Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2005 Anton Altaparmakov + * + * 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 + */ + +#ifndef _NTFS_ENDIANS_H +#define _NTFS_ENDIANS_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +/* + * Notes: + * We define the conversion functions including typecasts since the + * defaults don't necessarily perform appropriate typecasts. + * Also, using our own functions means that we can change them if it + * turns out that we do need to use the unaligned access macros on + * architectures requiring aligned memory accesses... + */ + +#ifdef HAVE_ENDIAN_H +#include <endian.h> +#endif +#ifdef HAVE_SYS_ENDIAN_H +#include <sys/endian.h> +#endif +#ifdef HAVE_MACHINE_ENDIAN_H +#include <machine/endian.h> +#endif +#ifdef HAVE_SYS_BYTEORDER_H +#include <sys/byteorder.h> +#endif +#ifdef HAVE_SYS_PARAM_H +#include <sys/param.h> +#endif + +#ifndef __BYTE_ORDER +# if defined(_BYTE_ORDER) +# define __BYTE_ORDER _BYTE_ORDER +# define __LITTLE_ENDIAN _LITTLE_ENDIAN +# define __BIG_ENDIAN _BIG_ENDIAN +# elif defined(BYTE_ORDER) +# define __BYTE_ORDER BYTE_ORDER +# define __LITTLE_ENDIAN LITTLE_ENDIAN +# define __BIG_ENDIAN BIG_ENDIAN +# elif defined(__BYTE_ORDER__) +# define __BYTE_ORDER __BYTE_ORDER__ +# define __LITTLE_ENDIAN __LITTLE_ENDIAN__ +# define __BIG_ENDIAN __BIG_ENDIAN__ +# elif (defined(_LITTLE_ENDIAN) && !defined(_BIG_ENDIAN)) || \ + defined(WORDS_LITTLEENDIAN) +# define __BYTE_ORDER 1 +# define __LITTLE_ENDIAN 1 +# define __BIG_ENDIAN 0 +# elif (!defined(_LITTLE_ENDIAN) && defined(_BIG_ENDIAN)) || \ + defined(WORDS_BIGENDIAN) +# define __BYTE_ORDER 0 +# define __LITTLE_ENDIAN 1 +# define __BIG_ENDIAN 0 +# else +# error "__BYTE_ORDER is not defined." +# endif +#endif + +#define __ntfs_bswap_constant_16(x) \ + (u16)((((u16)(x) & 0xff00) >> 8) | \ + (((u16)(x) & 0x00ff) << 8)) + +#define __ntfs_bswap_constant_32(x) \ + (u32)((((u32)(x) & 0xff000000u) >> 24) | \ + (((u32)(x) & 0x00ff0000u) >> 8) | \ + (((u32)(x) & 0x0000ff00u) << 8) | \ + (((u32)(x) & 0x000000ffu) << 24)) + +#define __ntfs_bswap_constant_64(x) \ + (u64)((((u64)(x) & 0xff00000000000000ull) >> 56) | \ + (((u64)(x) & 0x00ff000000000000ull) >> 40) | \ + (((u64)(x) & 0x0000ff0000000000ull) >> 24) | \ + (((u64)(x) & 0x000000ff00000000ull) >> 8) | \ + (((u64)(x) & 0x00000000ff000000ull) << 8) | \ + (((u64)(x) & 0x0000000000ff0000ull) << 24) | \ + (((u64)(x) & 0x000000000000ff00ull) << 40) | \ + (((u64)(x) & 0x00000000000000ffull) << 56)) + +#ifdef HAVE_BYTESWAP_H +# include <byteswap.h> +#else +# define bswap_16(x) __ntfs_bswap_constant_16(x) +# define bswap_32(x) __ntfs_bswap_constant_32(x) +# define bswap_64(x) __ntfs_bswap_constant_64(x) +#endif + +#if defined(__LITTLE_ENDIAN) && (__BYTE_ORDER == __LITTLE_ENDIAN) + +#define __le16_to_cpu(x) (x) +#define __le32_to_cpu(x) (x) +#define __le64_to_cpu(x) (x) + +#define __cpu_to_le16(x) (x) +#define __cpu_to_le32(x) (x) +#define __cpu_to_le64(x) (x) + +#define __constant_le16_to_cpu(x) (x) +#define __constant_le32_to_cpu(x) (x) +#define __constant_le64_to_cpu(x) (x) + +#define __constant_cpu_to_le16(x) (x) +#define __constant_cpu_to_le32(x) (x) +#define __constant_cpu_to_le64(x) (x) + +#elif defined(__BIG_ENDIAN) && (__BYTE_ORDER == __BIG_ENDIAN) + +#define __le16_to_cpu(x) bswap_16(x) +#define __le32_to_cpu(x) bswap_32(x) +#define __le64_to_cpu(x) bswap_64(x) + +#define __cpu_to_le16(x) bswap_16(x) +#define __cpu_to_le32(x) bswap_32(x) +#define __cpu_to_le64(x) bswap_64(x) + +#define __constant_le16_to_cpu(x) __ntfs_bswap_constant_16((u16)(x)) +#define __constant_le32_to_cpu(x) __ntfs_bswap_constant_32((u32)(x)) +#define __constant_le64_to_cpu(x) __ntfs_bswap_constant_64((u64)(x)) + +#define __constant_cpu_to_le16(x) __ntfs_bswap_constant_16((u16)(x)) +#define __constant_cpu_to_le32(x) __ntfs_bswap_constant_32((u32)(x)) +#define __constant_cpu_to_le64(x) __ntfs_bswap_constant_64((u64)(x)) + +#else + +#error "You must define __BYTE_ORDER to be __LITTLE_ENDIAN or __BIG_ENDIAN." + +#endif + +/* Unsigned from LE to CPU conversion. */ + +#define le16_to_cpu(x) (u16)__le16_to_cpu((u16)(x)) +#define le32_to_cpu(x) (u32)__le32_to_cpu((u32)(x)) +#define le64_to_cpu(x) (u64)__le64_to_cpu((u64)(x)) + +#define le16_to_cpup(x) (u16)__le16_to_cpu(*(const u16*)(x)) +#define le32_to_cpup(x) (u32)__le32_to_cpu(*(const u32*)(x)) +#define le64_to_cpup(x) (u64)__le64_to_cpu(*(const u64*)(x)) + +/* Signed from LE to CPU conversion. */ + +#define sle16_to_cpu(x) (s16)__le16_to_cpu((s16)(x)) +#define sle32_to_cpu(x) (s32)__le32_to_cpu((s32)(x)) +#define sle64_to_cpu(x) (s64)__le64_to_cpu((s64)(x)) + +#define sle16_to_cpup(x) (s16)__le16_to_cpu(*(s16*)(x)) +#define sle32_to_cpup(x) (s32)__le32_to_cpu(*(s32*)(x)) +#define sle64_to_cpup(x) (s64)__le64_to_cpu(*(s64*)(x)) + +/* Unsigned from CPU to LE conversion. */ + +#define cpu_to_le16(x) (u16)__cpu_to_le16((u16)(x)) +#define cpu_to_le32(x) (u32)__cpu_to_le32((u32)(x)) +#define cpu_to_le64(x) (u64)__cpu_to_le64((u64)(x)) + +#define cpu_to_le16p(x) (u16)__cpu_to_le16(*(u16*)(x)) +#define cpu_to_le32p(x) (u32)__cpu_to_le32(*(u32*)(x)) +#define cpu_to_le64p(x) (u64)__cpu_to_le64(*(u64*)(x)) + +/* Signed from CPU to LE conversion. */ + +#define cpu_to_sle16(x) (s16)__cpu_to_le16((s16)(x)) +#define cpu_to_sle32(x) (s32)__cpu_to_le32((s32)(x)) +#define cpu_to_sle64(x) (s64)__cpu_to_le64((s64)(x)) + +#define cpu_to_sle16p(x) (s16)__cpu_to_le16(*(s16*)(x)) +#define cpu_to_sle32p(x) (s32)__cpu_to_le32(*(s32*)(x)) +#define cpu_to_sle64p(x) (s64)__cpu_to_le64(*(s64*)(x)) + +/* Constant endianness conversion defines. */ + +#define const_le16_to_cpu(x) __constant_le16_to_cpu(x) +#define const_le32_to_cpu(x) __constant_le32_to_cpu(x) +#define const_le64_to_cpu(x) __constant_le64_to_cpu(x) + +#define const_cpu_to_le16(x) __constant_cpu_to_le16(x) +#define const_cpu_to_le32(x) __constant_cpu_to_le32(x) +#define const_cpu_to_le64(x) __constant_cpu_to_le64(x) + +#endif /* defined _NTFS_ENDIANS_H */ diff --git a/portlibs/sources/libntfs/gekko_io.c b/portlibs/sources/libntfs/gekko_io.c new file mode 100644 index 00000000..7ac24c7d --- /dev/null +++ b/portlibs/sources/libntfs/gekko_io.c @@ -0,0 +1,658 @@ +/** + * gekko_io.c - Gekko style disk io functions. + * + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2010 Dimok + * + * 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; 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_MATH_H +#include <math.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_FCNTL_H +#include <fcntl.h> +#endif +#ifdef HAVE_UNISTD_H +#include <unistd.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#ifdef HAVE_LIMITS_H +#include <limits.h> +#endif +#ifdef HAVE_LOCALE_H +#include <locale.h> +#endif + +#include "ntfs.h" +#include "types.h" +#include "logging.h" +#include "device_io.h" +#include "gekko_io.h" +#include "cache.h" +#include "device.h" +#include "bootsect.h" + +#define DEV_FD(dev) ((gekko_fd *)dev->d_private) + +/* Prototypes */ +static s64 ntfs_device_gekko_io_readbytes(struct ntfs_device *dev, s64 offset, s64 count, void *buf); +static bool ntfs_device_gekko_io_readsectors(struct ntfs_device *dev, sec_t sector, sec_t numSectors, void* buffer); +static s64 ntfs_device_gekko_io_writebytes(struct ntfs_device *dev, s64 offset, s64 count, const void *buf); +static bool ntfs_device_gekko_io_writesectors(struct ntfs_device *dev, sec_t sector, sec_t numSectors, const void* buffer); + +/** + * + */ +static int ntfs_device_gekko_io_open(struct ntfs_device *dev, int flags) +{ + ntfs_log_trace("dev %p, flags %i\n", dev, flags); + + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + // Get the device interface + const DISC_INTERFACE* interface = fd->interface; + if (!interface) { + errno = ENODEV; + return -1; + } + + // Start the device interface and ensure that it is inserted + if (!interface->startup()) { + ntfs_log_perror("device failed to start\n"); + errno = EIO; + return -1; + } + if (!interface->isInserted()) { + ntfs_log_perror("device media is not inserted\n"); + errno = EIO; + return -1; + } + + // Check that the device isn't already open (used by another volume?) + if (NDevOpen(dev)) { + ntfs_log_perror("device is busy (already open)\n"); + errno = EBUSY; + return -1; + } + + // Check that there is a valid NTFS boot sector at the start of the device + NTFS_BOOT_SECTOR *boot = (NTFS_BOOT_SECTOR *) ntfs_alloc(MAX_SECTOR_SIZE); + if(boot == NULL) { + errno = ENOMEM; + return -1; + } + + if (!interface->readSectors(fd->startSector, 1, boot)) { + ntfs_log_perror("read failure @ sector %d\n", fd->startSector); + errno = EIO; + ntfs_free(boot); + return -1; + } + + if (!ntfs_boot_sector_is_ntfs(boot)) { + errno = EINVALPART; + ntfs_free(boot); + return -1; + } + + // Parse the boot sector + fd->hiddenSectors = le32_to_cpu(boot->bpb.hidden_sectors); + fd->sectorSize = le16_to_cpu(boot->bpb.bytes_per_sector); + fd->sectorCount = sle64_to_cpu(boot->number_of_sectors); + fd->pos = 0; + fd->len = (fd->sectorCount * fd->sectorSize); + fd->ino = le64_to_cpu(boot->volume_serial_number); + + // Free memory for boot sector + ntfs_free(boot); + + // Mark the device as read-only (if required) + if (flags & O_RDONLY) { + NDevSetReadOnly(dev); + } + + // Create the cache + fd->cache = _NTFS_cache_constructor(fd->cachePageCount, fd->cachePageSize, interface, fd->startSector + fd->sectorCount, fd->sectorSize); + + // Mark the device as open + NDevSetBlock(dev); + NDevSetOpen(dev); + + return 0; +} + +/** + * + */ +static int ntfs_device_gekko_io_close(struct ntfs_device *dev) +{ + ntfs_log_trace("dev %p\n", dev); + + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + // Check that the device is actually open + if (!NDevOpen(dev)) { + ntfs_log_perror("device is not open\n"); + errno = EIO; + return -1; + } + + // Mark the device as closed + NDevClearOpen(dev); + NDevClearBlock(dev); + + // Flush the device (if dirty and not read-only) + if (NDevDirty(dev) && !NDevReadOnly(dev)) { + ntfs_log_debug("device is dirty, will now sync\n"); + + // ...? + + // Mark the device as clean + NDevClearDirty(dev); + + } + + // Flush and destroy the cache (if required) + if (fd->cache) { + _NTFS_cache_flush(fd->cache); + _NTFS_cache_destructor(fd->cache); + } + + // Shutdown the device interface + /*const DISC_INTERFACE* interface = fd->interface; + if (interface) { + interface->shutdown(); + }*/ + + // Free the device driver private data + ntfs_free(dev->d_private); + dev->d_private = NULL; + + return 0; +} + +/** + * + */ +static s64 ntfs_device_gekko_io_seek(struct ntfs_device *dev, s64 offset, int whence) +{ + ntfs_log_trace("dev %p, offset %Li, whence %i\n", dev, offset, whence); + + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + // Set the current position on the device (in bytes) + switch(whence) { + case SEEK_SET: fd->pos = MIN(MAX(offset, 0), fd->len); break; + case SEEK_CUR: fd->pos = MIN(MAX(fd->pos + offset, 0), fd->len); break; + case SEEK_END: fd->pos = MIN(MAX(fd->len + offset, 0), fd->len); break; + } + + return 0; +} + +/** + * + */ +static s64 ntfs_device_gekko_io_read(struct ntfs_device *dev, void *buf, s64 count) +{ + return ntfs_device_gekko_io_readbytes(dev, DEV_FD(dev)->pos, count, buf); +} + +/** + * + */ +static s64 ntfs_device_gekko_io_write(struct ntfs_device *dev, const void *buf, s64 count) +{ + return ntfs_device_gekko_io_writebytes(dev, DEV_FD(dev)->pos, count, buf); +} + +/** + * + */ +static s64 ntfs_device_gekko_io_pread(struct ntfs_device *dev, void *buf, s64 count, s64 offset) +{ + return ntfs_device_gekko_io_readbytes(dev, offset, count, buf); +} + +/** + * + */ +static s64 ntfs_device_gekko_io_pwrite(struct ntfs_device *dev, const void *buf, s64 count, s64 offset) +{ + return ntfs_device_gekko_io_writebytes(dev, offset, count, buf); +} + +/** + * + */ +static s64 ntfs_device_gekko_io_readbytes(struct ntfs_device *dev, s64 offset, s64 count, void *buf) +{ + ntfs_log_trace("dev %p, offset %Li, count %Li\n", dev, offset, count); + + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + // Get the device interface + const DISC_INTERFACE* interface = fd->interface; + if (!interface) { + errno = ENODEV; + return -1; + } + + if(offset < 0) + { + errno = EROFS; + return -1; + } + + if(!count) + return 0; + + sec_t sec_start = (sec_t) fd->startSector; + sec_t sec_count = 1; + u32 buffer_offset = (u32) (offset % fd->sectorSize); + u8 *buffer = NULL; + + // Determine the range of sectors required for this read + if (offset > 0) { + sec_start += (sec_t) floor((f64) offset / (f64) fd->sectorSize); + } + if (buffer_offset+count > fd->sectorSize) { + sec_count = (sec_t) ceil((f64) (buffer_offset+count) / (f64) fd->sectorSize); + } + + // If this read happens to be on the sector boundaries then do the read straight into the destination buffer + + if((buffer_offset == 0) && (count % fd->sectorSize == 0)) { + + // Read from the device + ntfs_log_trace("direct read from sector %d (%d sector(s) long)\n", sec_start, sec_count); + if (!ntfs_device_gekko_io_readsectors(dev, sec_start, sec_count, buf)) { + ntfs_log_perror("direct read failure @ sector %d (%d sector(s) long)\n", sec_start, sec_count); + errno = EIO; + return -1; + } + + // Else read into a buffer and copy over only what was requested + } + else + { + + // Allocate a buffer to hold the read data + buffer = (u8*)ntfs_alloc(sec_count * fd->sectorSize); + if (!buffer) { + errno = ENOMEM; + return -1; + } + + // Read from the device + ntfs_log_trace("buffered read from sector %d (%d sector(s) long)\n", sec_start, sec_count); + ntfs_log_trace("count: %d sec_count:%d fd->sectorSize: %d )\n", (u32)count, (u32)sec_count,(u32)fd->sectorSize); + if (!ntfs_device_gekko_io_readsectors(dev, sec_start, sec_count, buffer)) { + ntfs_log_perror("buffered read failure @ sector %d (%d sector(s) long)\n", sec_start, sec_count); + ntfs_free(buffer); + errno = EIO; + return -1; + } + + // Copy what was requested to the destination buffer + memcpy(buf, buffer + buffer_offset, count); + ntfs_free(buffer); + + } + + return count; +} + +/** + * + */ +static s64 ntfs_device_gekko_io_writebytes(struct ntfs_device *dev, s64 offset, s64 count, const void *buf) +{ + ntfs_log_trace("dev %p, offset %lli, count %lli\n", dev, offset, count); + + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + // Get the device interface + const DISC_INTERFACE* interface = fd->interface; + if (!interface) { + errno = ENODEV; + return -1; + } + + // Check that the device can be written to + if (NDevReadOnly(dev)) { + errno = EROFS; + return -1; + } + + if(count < 0 || offset < 0) { + errno = EROFS; + return -1; + } + + if(count == 0) + return 0; + + sec_t sec_start = (sec_t) fd->startSector; + sec_t sec_count = 1; + u32 buffer_offset = (u32) (offset % fd->sectorSize); + u8 *buffer = NULL; + + // Determine the range of sectors required for this write + if (offset > 0) { + sec_start += (sec_t) floor((f64) offset / (f64) fd->sectorSize); + } + if ((buffer_offset+count) > fd->sectorSize) { + sec_count = (sec_t) ceil((f64) (buffer_offset+count) / (f64) fd->sectorSize); + } + + // If this write happens to be on the sector boundaries then do the write straight to disc + if((buffer_offset == 0) && (count % fd->sectorSize == 0)) + { + // Write to the device + ntfs_log_trace("direct write to sector %d (%d sector(s) long)\n", sec_start, sec_count); + if (!ntfs_device_gekko_io_writesectors(dev, sec_start, sec_count, buf)) { + ntfs_log_perror("direct write failure @ sector %d (%d sector(s) long)\n", sec_start, sec_count); + errno = EIO; + return -1; + } + // Else write from a buffer aligned to the sector boundaries + } + else + { + // Allocate a buffer to hold the write data + buffer = (u8 *) ntfs_alloc(sec_count * fd->sectorSize); + if (!buffer) { + errno = ENOMEM; + return -1; + } + // Read the first and last sectors of the buffer from disc (if required) + // NOTE: This is done because the data does not line up with the sector boundaries, + // we just read in the buffer edges where the data overlaps with the rest of the disc + if(buffer_offset != 0) + { + if (!ntfs_device_gekko_io_readsectors(dev, sec_start, 1, buffer)) { + ntfs_log_perror("read failure @ sector %d\n", sec_start); + ntfs_free(buffer); + errno = EIO; + return -1; + } + } + if((buffer_offset+count) % fd->sectorSize != 0) + { + if (!ntfs_device_gekko_io_readsectors(dev, sec_start + sec_count - 1, 1, buffer + ((sec_count-1) * fd->sectorSize))) { + ntfs_log_perror("read failure @ sector %d\n", sec_start + sec_count - 1); + ntfs_free(buffer); + errno = EIO; + return -1; + } + } + + // Copy the data into the write buffer + memcpy(buffer + buffer_offset, buf, count); + + // Write to the device + ntfs_log_trace("buffered write to sector %d (%d sector(s) long)\n", sec_start, sec_count); + if (!ntfs_device_gekko_io_writesectors(dev, sec_start, sec_count, buffer)) { + ntfs_log_perror("buffered write failure @ sector %d\n", sec_start); + ntfs_free(buffer); + errno = EIO; + return -1; + } + + // Free the buffer + ntfs_free(buffer); + } + + // Mark the device as dirty (if we actually wrote anything) + NDevSetDirty(dev); + + return count; +} + +static bool ntfs_device_gekko_io_readsectors(struct ntfs_device *dev, sec_t sector, sec_t numSectors, void* buffer) +{ + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return false; + } + // Read the sectors from disc (or cache, if enabled) + if (fd->cache) + return _NTFS_cache_readSectors(fd->cache, sector, numSectors, buffer); + else + return fd->interface->readSectors(sector, numSectors, buffer); + + return false; +} + +static bool ntfs_device_gekko_io_writesectors(struct ntfs_device *dev, sec_t sector, sec_t numSectors, const void* buffer) +{ + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return false; + } + + // Write the sectors to disc (or cache, if enabled) + if (fd->cache) + return _NTFS_cache_writeSectors(fd->cache, sector, numSectors, buffer); + else + return fd->interface->writeSectors(sector, numSectors, buffer); + + return false; +} + +/** + * + */ +static int ntfs_device_gekko_io_sync(struct ntfs_device *dev) +{ + gekko_fd *fd = DEV_FD(dev); + ntfs_log_trace("dev %p\n", dev); + + // Check that the device can be written to + if (NDevReadOnly(dev)) { + errno = EROFS; + return -1; + } + + // Mark the device as clean + NDevClearDirty(dev); + NDevClearSync(dev); + + // Flush any sectors in the disc cache (if required) + if (fd->cache) { + if (!_NTFS_cache_flush(fd->cache)) { + errno = EIO; + return -1; + } + } + + return 0; +} + +/** + * + */ +static int ntfs_device_gekko_io_stat(struct ntfs_device *dev, struct stat *buf) +{ + ntfs_log_trace("dev %p, buf %p\n", dev, buf); + + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + // Short circuit cases were we don't actually have to do anything + if (!buf) + return 0; + + // Build the device mode + mode_t mode = (S_IFBLK) | + (S_IRUSR | S_IRGRP | S_IROTH) | + ((!NDevReadOnly(dev)) ? (S_IWUSR | S_IWGRP | S_IWOTH) : 0); + + // Zero out the stat buffer + memset(buf, 0, sizeof(struct stat)); + + // Build the device stats + buf->st_dev = fd->interface->ioType; + buf->st_ino = fd->ino; + buf->st_mode = mode; + buf->st_rdev = fd->interface->ioType; + buf->st_blksize = fd->sectorSize; + buf->st_blocks = fd->sectorCount; + + return 0; +} + +/** + * + */ +static int ntfs_device_gekko_io_ioctl(struct ntfs_device *dev, int request, void *argp) +{ + ntfs_log_trace("dev %p, request %i, argp %p\n", dev, request, argp); + + // Get the device driver descriptor + gekko_fd *fd = DEV_FD(dev); + if (!fd) { + errno = EBADF; + return -1; + } + + // Figure out which i/o control was requested + switch (request) { + + // Get block device size (sectors) + #if defined(BLKGETSIZE) + case BLKGETSIZE: { + *(u32*)argp = fd->sectorCount; + return 0; + } + #endif + + // Get block device size (bytes) + #if defined(BLKGETSIZE64) + case BLKGETSIZE64: { + *(u64*)argp = (fd->sectorCount * fd->sectorSize); + return 0; + } + #endif + + // Get hard drive geometry + #if defined(HDIO_GETGEO) + case HDIO_GETGEO: { + struct hd_geometry *geo = (struct hd_geometry*)argp; + geo->sectors = 0; + geo->heads = 0; + geo->cylinders = 0; + geo->start = fd->hiddenSectors; + return -1; + } + #endif + + // Get block device sector size (bytes) + #if defined(BLKSSZGET) + case BLKSSZGET: { + *(int*)argp = fd->sectorSize; + return 0; + } + #endif + + // Set block device block size (bytes) + #if defined(BLKBSZSET) + case BLKBSZSET: { + int sectorSize = *(int*)argp; + fd->sectorSize = sectorSize; + return 0; + } + #endif + + // Unimplemented ioctrl + default: { + ntfs_log_perror("Unimplemented ioctrl %i\n", request); + errno = EOPNOTSUPP; + return -1; + } + + } + + return 0; +} + +/** + * Device operations for working with gekko style devices and files. + */ +struct ntfs_device_operations ntfs_device_gekko_io_ops = { + .open = ntfs_device_gekko_io_open, + .close = ntfs_device_gekko_io_close, + .seek = ntfs_device_gekko_io_seek, + .read = ntfs_device_gekko_io_read, + .write = ntfs_device_gekko_io_write, + .pread = ntfs_device_gekko_io_pread, + .pwrite = ntfs_device_gekko_io_pwrite, + .sync = ntfs_device_gekko_io_sync, + .stat = ntfs_device_gekko_io_stat, + .ioctl = ntfs_device_gekko_io_ioctl, +}; diff --git a/portlibs/sources/libntfs/gekko_io.h b/portlibs/sources/libntfs/gekko_io.h new file mode 100644 index 00000000..bc5516ab --- /dev/null +++ b/portlibs/sources/libntfs/gekko_io.h @@ -0,0 +1,58 @@ +/* +* gekko_io.h - Platform specifics for device io. +* +* Copyright (c) 2009 Rhys "Shareese" Koedijk +* +* 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; if not, write to the Free Software Foundation, +* Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA +*/ + +#ifndef _GEKKO_IO_H +#define _GEKKO_IO_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "types.h" +#include "cache2.h" +#include <gccore.h> +#include <ogc/disc_io.h> + +#define MAX_SECTOR_SIZE 4096 + +/** + * gekko_fd - Gekko device driver descriptor + */ +typedef struct _gekko_fd { + const DISC_INTERFACE* interface; /* Device disc interface */ + sec_t startSector; /* LBA of partition start */ + sec_t hiddenSectors; /* LBA offset to true partition start (as described by boot sector) */ + u16 sectorSize; /* Device sector size (in bytes) */ + u64 sectorCount; /* Total number of sectors in partition */ + u64 pos; /* Current position within the partition (in bytes) */ + u64 len; /* Total length of partition (in bytes) */ + ino_t ino; /* Device identifier */ + NTFS_CACHE *cache; /* Cache */ + u32 cachePageCount; /* The number of pages in the cache */ + u32 cachePageSize; /* The number of sectors per cache page */ +} gekko_fd; + +/* Forward declarations */ +struct ntfs_device_operations; + +/* Gekko device driver i/o operations */ +extern struct ntfs_device_operations ntfs_device_gekko_io_ops; + +#endif /* _GEKKO_IO_H */ diff --git a/portlibs/sources/libntfs/index.c b/portlibs/sources/libntfs/index.c new file mode 100644 index 00000000..8080b889 --- /dev/null +++ b/portlibs/sources/libntfs/index.c @@ -0,0 +1,2085 @@ +/** + * index.c - NTFS index handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2004-2005 Anton Altaparmakov + * Copyright (c) 2004-2005 Richard Russon + * Copyright (c) 2005-2006 Yura Pakhuchiy + * Copyright (c) 2005-2008 Szabolcs Szakacsits + * Copyright (c) 2007 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_STRING_H +#include <string.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "attrib.h" +#include "debug.h" +#include "index.h" +#include "collate.h" +#include "mst.h" +#include "dir.h" +#include "logging.h" +#include "bitmap.h" +#include "reparse.h" +#include "misc.h" + +/** + * ntfs_index_entry_mark_dirty - mark an index entry dirty + * @ictx: ntfs index context describing the index entry + * + * Mark the index entry described by the index entry context @ictx dirty. + * + * If the index entry is in the index root attribute, simply mark the inode + * containing the index root attribute dirty. This ensures the mftrecord, and + * hence the index root attribute, will be written out to disk later. + * + * If the index entry is in an index block belonging to the index allocation + * attribute, set ib_dirty to TRUE, thus index block will be updated during + * ntfs_index_ctx_put. + */ +void ntfs_index_entry_mark_dirty(ntfs_index_context *ictx) +{ + if (ictx->is_in_root) + ntfs_inode_mark_dirty(ictx->actx->ntfs_ino); + else + ictx->ib_dirty = TRUE; +} + +static s64 ntfs_ib_vcn_to_pos(ntfs_index_context *icx, VCN vcn) +{ + return vcn << icx->vcn_size_bits; +} + +static VCN ntfs_ib_pos_to_vcn(ntfs_index_context *icx, s64 pos) +{ + return pos >> icx->vcn_size_bits; +} + +static int ntfs_ib_write(ntfs_index_context *icx, INDEX_BLOCK *ib) +{ + s64 ret, vcn = sle64_to_cpu(ib->index_block_vcn); + + ntfs_log_trace("vcn: %lld\n", (long long)vcn); + + ret = ntfs_attr_mst_pwrite(icx->ia_na, ntfs_ib_vcn_to_pos(icx, vcn), + 1, icx->block_size, ib); + if (ret != 1) { + ntfs_log_perror("Failed to write index block %lld, inode %llu", + (long long)vcn, (unsigned long long)icx->ni->mft_no); + return STATUS_ERROR; + } + + return STATUS_OK; +} + +static int ntfs_icx_ib_write(ntfs_index_context *icx) +{ + if (ntfs_ib_write(icx, icx->ib)) + return STATUS_ERROR; + + icx->ib_dirty = FALSE; + + return STATUS_OK; +} + +/** + * ntfs_index_ctx_get - allocate and initialize a new index context + * @ni: ntfs inode with which to initialize the context + * @name: name of the which context describes + * @name_len: length of the index name + * + * Allocate a new index context, initialize it with @ni and return it. + * Return NULL if allocation failed. + */ +ntfs_index_context *ntfs_index_ctx_get(ntfs_inode *ni, + ntfschar *name, u32 name_len) +{ + ntfs_index_context *icx; + + ntfs_log_trace("Entering\n"); + + if (!ni) { + errno = EINVAL; + return NULL; + } + if (ni->nr_extents == -1) + ni = ni->base_ni; + icx = ntfs_calloc(sizeof(ntfs_index_context)); + if (icx) + *icx = (ntfs_index_context) { + .ni = ni, + .name = name, + .name_len = name_len, + }; + return icx; +} + +static void ntfs_index_ctx_free(ntfs_index_context *icx) +{ + ntfs_log_trace("Entering\n"); + + if (!icx->entry) + return; + + if (icx->actx) + ntfs_attr_put_search_ctx(icx->actx); + + if (!icx->is_in_root) { + if (icx->ib_dirty) { + /* FIXME: Error handling!!! */ + ntfs_ib_write(icx, icx->ib); + } + free(icx->ib); + } + + ntfs_attr_close(icx->ia_na); +} + +/** + * ntfs_index_ctx_put - release an index context + * @icx: index context to free + * + * Release the index context @icx, releasing all associated resources. + */ +void ntfs_index_ctx_put(ntfs_index_context *icx) +{ + ntfs_index_ctx_free(icx); + free(icx); +} + +/** + * ntfs_index_ctx_reinit - reinitialize an index context + * @icx: index context to reinitialize + * + * Reinitialize the index context @icx so it can be used for ntfs_index_lookup. + */ +void ntfs_index_ctx_reinit(ntfs_index_context *icx) +{ + ntfs_log_trace("Entering\n"); + + ntfs_index_ctx_free(icx); + + *icx = (ntfs_index_context) { + .ni = icx->ni, + .name = icx->name, + .name_len = icx->name_len, + }; +} + +static VCN *ntfs_ie_get_vcn_addr(INDEX_ENTRY *ie) +{ + return (VCN *)((u8 *)ie + le16_to_cpu(ie->length) - sizeof(VCN)); +} + +/** + * Get the subnode vcn to which the index entry refers. + */ +VCN ntfs_ie_get_vcn(INDEX_ENTRY *ie) +{ + return sle64_to_cpup(ntfs_ie_get_vcn_addr(ie)); +} + +static INDEX_ENTRY *ntfs_ie_get_first(INDEX_HEADER *ih) +{ + return (INDEX_ENTRY *)((u8 *)ih + le32_to_cpu(ih->entries_offset)); +} + +static INDEX_ENTRY *ntfs_ie_get_next(INDEX_ENTRY *ie) +{ + return (INDEX_ENTRY *)((char *)ie + le16_to_cpu(ie->length)); +} + +static u8 *ntfs_ie_get_end(INDEX_HEADER *ih) +{ + /* FIXME: check if it isn't overflowing the index block size */ + return (u8 *)ih + le32_to_cpu(ih->index_length); +} + +static int ntfs_ie_end(INDEX_ENTRY *ie) +{ + return ie->ie_flags & INDEX_ENTRY_END || !ie->length; +} + +/** + * Find the last entry in the index block + */ +static INDEX_ENTRY *ntfs_ie_get_last(INDEX_ENTRY *ie, char *ies_end) +{ + ntfs_log_trace("Entering\n"); + + while ((char *)ie < ies_end && !ntfs_ie_end(ie)) + ie = ntfs_ie_get_next(ie); + + return ie; +} + +static INDEX_ENTRY *ntfs_ie_get_by_pos(INDEX_HEADER *ih, int pos) +{ + INDEX_ENTRY *ie; + + ntfs_log_trace("pos: %d\n", pos); + + ie = ntfs_ie_get_first(ih); + + while (pos-- > 0) + ie = ntfs_ie_get_next(ie); + + return ie; +} + +static INDEX_ENTRY *ntfs_ie_prev(INDEX_HEADER *ih, INDEX_ENTRY *ie) +{ + INDEX_ENTRY *ie_prev = NULL; + INDEX_ENTRY *tmp; + + ntfs_log_trace("Entering\n"); + + tmp = ntfs_ie_get_first(ih); + + while (tmp != ie) { + ie_prev = tmp; + tmp = ntfs_ie_get_next(tmp); + } + + return ie_prev; +} + +char *ntfs_ie_filename_get(INDEX_ENTRY *ie) +{ + FILE_NAME_ATTR *fn; + + fn = (FILE_NAME_ATTR *)&ie->key; + return ntfs_attr_name_get(fn->file_name, fn->file_name_length); +} + +void ntfs_ie_filename_dump(INDEX_ENTRY *ie) +{ + char *s; + + s = ntfs_ie_filename_get(ie); + ntfs_log_debug("'%s' ", s); + ntfs_attr_name_free(&s); +} + +void ntfs_ih_filename_dump(INDEX_HEADER *ih) +{ + INDEX_ENTRY *ie; + + ntfs_log_trace("Entering\n"); + + ie = ntfs_ie_get_first(ih); + while (!ntfs_ie_end(ie)) { + ntfs_ie_filename_dump(ie); + ie = ntfs_ie_get_next(ie); + } +} + +static int ntfs_ih_numof_entries(INDEX_HEADER *ih) +{ + int n; + INDEX_ENTRY *ie; + u8 *end; + + ntfs_log_trace("Entering\n"); + + end = ntfs_ie_get_end(ih); + ie = ntfs_ie_get_first(ih); + for (n = 0; !ntfs_ie_end(ie) && (u8 *)ie < end; n++) + ie = ntfs_ie_get_next(ie); + return n; +} + +static int ntfs_ih_one_entry(INDEX_HEADER *ih) +{ + return (ntfs_ih_numof_entries(ih) == 1); +} + +static int ntfs_ih_zero_entry(INDEX_HEADER *ih) +{ + return (ntfs_ih_numof_entries(ih) == 0); +} + +static void ntfs_ie_delete(INDEX_HEADER *ih, INDEX_ENTRY *ie) +{ + u32 new_size; + + ntfs_log_trace("Entering\n"); + + new_size = le32_to_cpu(ih->index_length) - le16_to_cpu(ie->length); + ih->index_length = cpu_to_le32(new_size); + memmove(ie, (u8 *)ie + le16_to_cpu(ie->length), + new_size - ((u8 *)ie - (u8 *)ih)); +} + +static void ntfs_ie_set_vcn(INDEX_ENTRY *ie, VCN vcn) +{ + *ntfs_ie_get_vcn_addr(ie) = cpu_to_le64(vcn); +} + +/** + * Insert @ie index entry at @pos entry. Used @ih values should be ok already. + */ +static void ntfs_ie_insert(INDEX_HEADER *ih, INDEX_ENTRY *ie, INDEX_ENTRY *pos) +{ + int ie_size = le16_to_cpu(ie->length); + + ntfs_log_trace("Entering\n"); + + ih->index_length = cpu_to_le32(le32_to_cpu(ih->index_length) + ie_size); + memmove((u8 *)pos + ie_size, pos, + le32_to_cpu(ih->index_length) - ((u8 *)pos - (u8 *)ih) - ie_size); + memcpy(pos, ie, ie_size); +} + +static INDEX_ENTRY *ntfs_ie_dup(INDEX_ENTRY *ie) +{ + INDEX_ENTRY *dup; + + ntfs_log_trace("Entering\n"); + + dup = ntfs_malloc(le16_to_cpu(ie->length)); + if (dup) + memcpy(dup, ie, le16_to_cpu(ie->length)); + + return dup; +} + +static INDEX_ENTRY *ntfs_ie_dup_novcn(INDEX_ENTRY *ie) +{ + INDEX_ENTRY *dup; + int size = le16_to_cpu(ie->length); + + ntfs_log_trace("Entering\n"); + + if (ie->ie_flags & INDEX_ENTRY_NODE) + size -= sizeof(VCN); + + dup = ntfs_malloc(size); + if (dup) { + memcpy(dup, ie, size); + dup->ie_flags &= ~INDEX_ENTRY_NODE; + dup->length = cpu_to_le16(size); + } + return dup; +} + +static int ntfs_ia_check(ntfs_index_context *icx, INDEX_BLOCK *ib, VCN vcn) +{ + u32 ib_size = (unsigned)le32_to_cpu(ib->index.allocated_size) + 0x18; + + ntfs_log_trace("Entering\n"); + + if (!ntfs_is_indx_record(ib->magic)) { + + ntfs_log_error("Corrupt index block signature: vcn %lld inode " + "%llu\n", (long long)vcn, + (unsigned long long)icx->ni->mft_no); + return -1; + } + + if (sle64_to_cpu(ib->index_block_vcn) != vcn) { + + ntfs_log_error("Corrupt index block: VCN (%lld) is different " + "from expected VCN (%lld) in inode %llu\n", + (long long)sle64_to_cpu(ib->index_block_vcn), + (long long)vcn, + (unsigned long long)icx->ni->mft_no); + return -1; + } + + if (ib_size != icx->block_size) { + + ntfs_log_error("Corrupt index block : VCN (%lld) of inode %llu " + "has a size (%u) differing from the index " + "specified size (%u)\n", (long long)vcn, + (unsigned long long)icx->ni->mft_no, ib_size, + icx->block_size); + return -1; + } + return 0; +} + +static INDEX_ROOT *ntfs_ir_lookup(ntfs_inode *ni, ntfschar *name, + u32 name_len, ntfs_attr_search_ctx **ctx) +{ + ATTR_RECORD *a; + INDEX_ROOT *ir = NULL; + + ntfs_log_trace("Entering\n"); + + *ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!*ctx) + return NULL; + + if (ntfs_attr_lookup(AT_INDEX_ROOT, name, name_len, CASE_SENSITIVE, + 0, NULL, 0, *ctx)) { + ntfs_log_perror("Failed to lookup $INDEX_ROOT"); + goto err_out; + } + + a = (*ctx)->attr; + if (a->non_resident) { + errno = EINVAL; + ntfs_log_perror("Non-resident $INDEX_ROOT detected"); + goto err_out; + } + + ir = (INDEX_ROOT *)((char *)a + le16_to_cpu(a->value_offset)); +err_out: + if (!ir) { + ntfs_attr_put_search_ctx(*ctx); + *ctx = NULL; + } + return ir; +} + +static INDEX_ROOT *ntfs_ir_lookup2(ntfs_inode *ni, ntfschar *name, u32 len) +{ + ntfs_attr_search_ctx *ctx; + INDEX_ROOT *ir; + + ir = ntfs_ir_lookup(ni, name, len, &ctx); + if (ir) + ntfs_attr_put_search_ctx(ctx); + return ir; +} + +/** + * Find a key in the index block. + * + * Return values: + * STATUS_OK with errno set to ESUCCESS if we know for sure that the + * entry exists and @ie_out points to this entry. + * STATUS_NOT_FOUND with errno set to ENOENT if we know for sure the + * entry doesn't exist and @ie_out is the insertion point. + * STATUS_KEEP_SEARCHING if we can't answer the above question and + * @vcn will contain the node index block. + * STATUS_ERROR with errno set if on unexpected error during lookup. + */ +static int ntfs_ie_lookup(const void *key, const int key_len, + ntfs_index_context *icx, INDEX_HEADER *ih, + VCN *vcn, INDEX_ENTRY **ie_out) +{ + INDEX_ENTRY *ie; + u8 *index_end; + int rc, item = 0; + + ntfs_log_trace("Entering\n"); + + index_end = ntfs_ie_get_end(ih); + + /* + * Loop until we exceed valid memory (corruption case) or until we + * reach the last entry. + */ + for (ie = ntfs_ie_get_first(ih); ; ie = ntfs_ie_get_next(ie)) { + /* Bounds checks. */ + if ((u8 *)ie + sizeof(INDEX_ENTRY_HEADER) > index_end || + (u8 *)ie + le16_to_cpu(ie->length) > index_end) { + errno = ERANGE; + ntfs_log_error("Index entry out of bounds in inode " + "%llu.\n", + (unsigned long long)icx->ni->mft_no); + return STATUS_ERROR; + } + /* + * The last entry cannot contain a key. It can however contain + * a pointer to a child node in the B+tree so we just break out. + */ + if (ntfs_ie_end(ie)) + break; + /* + * Not a perfect match, need to do full blown collation so we + * know which way in the B+tree we have to go. + */ + if (!icx->collate) { + ntfs_log_error("Collation function not defined\n"); + errno = EOPNOTSUPP; + return STATUS_ERROR; + } + rc = icx->collate(icx->ni->vol, key, key_len, + &ie->key, le16_to_cpu(ie->key_length)); + if (rc == NTFS_COLLATION_ERROR) { + ntfs_log_error("Collation error. Perhaps a filename " + "contains invalid characters?\n"); + errno = ERANGE; + return STATUS_ERROR; + } + /* + * If @key collates before the key of the current entry, there + * is definitely no such key 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; + + if (!rc) { + *ie_out = ie; + errno = 0; + icx->parent_pos[icx->pindex] = item; + return STATUS_OK; + } + + item++; + } + /* + * We have finished with this index block without success. Check for the + * presence of a child node and if not present return with errno ENOENT, + * otherwise we will keep searching in another index block. + */ + if (!(ie->ie_flags & INDEX_ENTRY_NODE)) { + ntfs_log_debug("Index entry wasn't found.\n"); + *ie_out = ie; + errno = ENOENT; + return STATUS_NOT_FOUND; + } + + /* Get the starting vcn of the index_block holding the child node. */ + *vcn = ntfs_ie_get_vcn(ie); + if (*vcn < 0) { + errno = EINVAL; + ntfs_log_perror("Negative vcn in inode %llu", + (unsigned long long)icx->ni->mft_no); + return STATUS_ERROR; + } + + ntfs_log_trace("Parent entry number %d\n", item); + icx->parent_pos[icx->pindex] = item; + + return STATUS_KEEP_SEARCHING; +} + +static ntfs_attr *ntfs_ia_open(ntfs_index_context *icx, ntfs_inode *ni) +{ + ntfs_attr *na; + + na = ntfs_attr_open(ni, AT_INDEX_ALLOCATION, icx->name, icx->name_len); + if (!na) { + ntfs_log_perror("Failed to open index allocation of inode " + "%llu", (unsigned long long)ni->mft_no); + return NULL; + } + + return na; +} + +static int ntfs_ib_read(ntfs_index_context *icx, VCN vcn, INDEX_BLOCK *dst) +{ + s64 pos, ret; + + ntfs_log_trace("vcn: %lld\n", (long long)vcn); + + pos = ntfs_ib_vcn_to_pos(icx, vcn); + + ret = ntfs_attr_mst_pread(icx->ia_na, pos, 1, icx->block_size, (u8 *)dst); + if (ret != 1) { + if (ret == -1) + ntfs_log_perror("Failed to read index block"); + else + ntfs_log_error("Failed to read full index block at " + "%lld\n", (long long)pos); + return -1; + } + + if (ntfs_ia_check(icx, dst, vcn)) + return -1; + + return 0; +} + +static int ntfs_icx_parent_inc(ntfs_index_context *icx) +{ + icx->pindex++; + if (icx->pindex >= MAX_PARENT_VCN) { + errno = EOPNOTSUPP; + ntfs_log_perror("Index is over %d level deep", MAX_PARENT_VCN); + return STATUS_ERROR; + } + return STATUS_OK; +} + +static int ntfs_icx_parent_dec(ntfs_index_context *icx) +{ + icx->pindex--; + if (icx->pindex < 0) { + errno = EINVAL; + ntfs_log_perror("Corrupt index pointer (%d)", icx->pindex); + return STATUS_ERROR; + } + return STATUS_OK; +} + +/** + * ntfs_index_lookup - find a key in an index and return its index entry + * @key: [IN] key for which to search in the index + * @key_len: [IN] length of @key in bytes + * @icx: [IN/OUT] context describing the index and the returned entry + * + * Before calling ntfs_index_lookup(), @icx must have been obtained from a + * call to ntfs_index_ctx_get(). + * + * Look for the @key in the index specified by the index lookup context @icx. + * ntfs_index_lookup() walks the contents of the index looking for the @key. + * + * If the @key is found in the index, 0 is returned and @icx is setup to + * describe the index entry containing the matching @key. @icx->entry is the + * index entry and @icx->data and @icx->data_len are the index entry data and + * its length in bytes, respectively. + * + * If the @key is not found in the index, -1 is returned, errno = ENOENT and + * @icx is setup to describe the index entry whose key collates immediately + * after the search @key, i.e. this is the position in the index at which + * an index entry with a key of @key would need to be inserted. + * + * If an error occurs return -1, set errno to error code and @icx is left + * untouched. + * + * When finished with the entry and its data, call ntfs_index_ctx_put() to free + * the context and other associated resources. + * + * If the index entry was modified, call ntfs_index_entry_mark_dirty() before + * the call to ntfs_index_ctx_put() to ensure that the changes are written + * to disk. + */ +int ntfs_index_lookup(const void *key, const int key_len, ntfs_index_context *icx) +{ + VCN old_vcn, vcn; + ntfs_inode *ni = icx->ni; + INDEX_ROOT *ir; + INDEX_ENTRY *ie; + INDEX_BLOCK *ib = NULL; + int ret, err = 0; + + ntfs_log_trace("Entering\n"); + + if (!key || key_len <= 0) { + errno = EINVAL; + ntfs_log_perror("key: %p key_len: %d", key, key_len); + return -1; + } + + ir = ntfs_ir_lookup(ni, icx->name, icx->name_len, &icx->actx); + if (!ir) { + if (errno == ENOENT) + errno = EIO; + return -1; + } + + icx->block_size = le32_to_cpu(ir->index_block_size); + if (icx->block_size < NTFS_BLOCK_SIZE) { + errno = EINVAL; + ntfs_log_perror("Index block size (%d) is smaller than the " + "sector size (%d)", icx->block_size, NTFS_BLOCK_SIZE); + goto err_out; + } + + if (ni->vol->cluster_size <= icx->block_size) + icx->vcn_size_bits = ni->vol->cluster_size_bits; + else + icx->vcn_size_bits = ni->vol->sector_size_bits; + /* get the appropriate collation function */ + icx->collate = ntfs_get_collate_function(ir->collation_rule); + if (!icx->collate) { + err = errno = EOPNOTSUPP; + ntfs_log_perror("Unknown collation rule 0x%x", + (unsigned)le32_to_cpu(ir->collation_rule)); + goto err_out; + } + + old_vcn = VCN_INDEX_ROOT_PARENT; + /* + * FIXME: check for both ir and ib that the first index entry is + * within the index block. + */ + ret = ntfs_ie_lookup(key, key_len, icx, &ir->index, &vcn, &ie); + if (ret == STATUS_ERROR) { + err = errno; + goto err_out; + } + + icx->ir = ir; + + if (ret != STATUS_KEEP_SEARCHING) { + /* STATUS_OK or STATUS_NOT_FOUND */ + err = errno; + icx->is_in_root = TRUE; + icx->parent_vcn[icx->pindex] = old_vcn; + goto done; + } + + /* Child node present, descend into it. */ + + icx->ia_na = ntfs_ia_open(icx, ni); + if (!icx->ia_na) + goto err_out; + + ib = ntfs_malloc(icx->block_size); + if (!ib) { + err = errno; + goto err_out; + } + +descend_into_child_node: + + icx->parent_vcn[icx->pindex] = old_vcn; + if (ntfs_icx_parent_inc(icx)) { + err = errno; + goto err_out; + } + old_vcn = vcn; + + ntfs_log_debug("Descend into node with VCN %lld\n", (long long)vcn); + + if (ntfs_ib_read(icx, vcn, ib)) + goto err_out; + + ret = ntfs_ie_lookup(key, key_len, icx, &ib->index, &vcn, &ie); + if (ret != STATUS_KEEP_SEARCHING) { + err = errno; + if (ret == STATUS_ERROR) + goto err_out; + + /* STATUS_OK or STATUS_NOT_FOUND */ + icx->is_in_root = FALSE; + icx->ib = ib; + icx->parent_vcn[icx->pindex] = vcn; + goto done; + } + + if ((ib->index.ih_flags & NODE_MASK) == LEAF_NODE) { + ntfs_log_error("Index entry with child node found in a leaf " + "node in inode 0x%llx.\n", + (unsigned long long)ni->mft_no); + goto err_out; + } + + goto descend_into_child_node; +err_out: + free(ib); + if (!err) + err = EIO; + errno = err; + return -1; +done: + icx->entry = ie; + icx->data = (u8 *)ie + offsetof(INDEX_ENTRY, key); + icx->data_len = le16_to_cpu(ie->key_length); + ntfs_log_trace("Done.\n"); + if (err) { + errno = err; + return -1; + } + return 0; + +} + +static INDEX_BLOCK *ntfs_ib_alloc(VCN ib_vcn, u32 ib_size, + INDEX_HEADER_FLAGS node_type) +{ + INDEX_BLOCK *ib; + int ih_size = sizeof(INDEX_HEADER); + + ntfs_log_trace("ib_vcn: %lld ib_size: %u\n", (long long)ib_vcn, ib_size); + + ib = ntfs_calloc(ib_size); + if (!ib) + return NULL; + + ib->magic = magic_INDX; + ib->usa_ofs = cpu_to_le16(sizeof(INDEX_BLOCK)); + ib->usa_count = cpu_to_le16(ib_size / NTFS_BLOCK_SIZE + 1); + /* Set USN to 1 */ + *(u16 *)((char *)ib + le16_to_cpu(ib->usa_ofs)) = cpu_to_le16(1); + ib->lsn = cpu_to_le64(0); + + ib->index_block_vcn = cpu_to_sle64(ib_vcn); + + ib->index.entries_offset = cpu_to_le32((ih_size + + le16_to_cpu(ib->usa_count) * 2 + 7) & ~7); + ib->index.index_length = 0; + ib->index.allocated_size = cpu_to_le32(ib_size - + (sizeof(INDEX_BLOCK) - ih_size)); + ib->index.ih_flags = node_type; + + return ib; +} + +/** + * Find the median by going through all the entries + */ +static INDEX_ENTRY *ntfs_ie_get_median(INDEX_HEADER *ih) +{ + INDEX_ENTRY *ie, *ie_start; + u8 *ie_end; + int i = 0, median; + + ntfs_log_trace("Entering\n"); + + ie = ie_start = ntfs_ie_get_first(ih); + ie_end = (u8 *)ntfs_ie_get_end(ih); + + while ((u8 *)ie < ie_end && !ntfs_ie_end(ie)) { + ie = ntfs_ie_get_next(ie); + i++; + } + /* + * NOTE: this could be also the entry at the half of the index block. + */ + median = i / 2 - 1; + + ntfs_log_trace("Entries: %d median: %d\n", i, median); + + for (i = 0, ie = ie_start; i <= median; i++) + ie = ntfs_ie_get_next(ie); + + return ie; +} + +static s64 ntfs_ibm_vcn_to_pos(ntfs_index_context *icx, VCN vcn) +{ + return ntfs_ib_vcn_to_pos(icx, vcn) / icx->block_size; +} + +static s64 ntfs_ibm_pos_to_vcn(ntfs_index_context *icx, s64 pos) +{ + return ntfs_ib_pos_to_vcn(icx, pos * icx->block_size); +} + +static int ntfs_ibm_add(ntfs_index_context *icx) +{ + u8 bmp[8]; + + ntfs_log_trace("Entering\n"); + + if (ntfs_attr_exist(icx->ni, AT_BITMAP, icx->name, icx->name_len)) + return STATUS_OK; + /* + * AT_BITMAP must be at least 8 bytes. + */ + memset(bmp, 0, sizeof(bmp)); + if (ntfs_attr_add(icx->ni, AT_BITMAP, icx->name, icx->name_len, + bmp, sizeof(bmp))) { + ntfs_log_perror("Failed to add AT_BITMAP"); + return STATUS_ERROR; + } + + return STATUS_OK; +} + +static int ntfs_ibm_modify(ntfs_index_context *icx, VCN vcn, int set) +{ + u8 byte; + s64 pos = ntfs_ibm_vcn_to_pos(icx, vcn); + u32 bpos = pos / 8; + u32 bit = 1 << (pos % 8); + ntfs_attr *na; + int ret = STATUS_ERROR; + + ntfs_log_trace("%s vcn: %lld\n", set ? "set" : "clear", (long long)vcn); + + na = ntfs_attr_open(icx->ni, AT_BITMAP, icx->name, icx->name_len); + if (!na) { + ntfs_log_perror("Failed to open $BITMAP attribute"); + return -1; + } + + if (set) { + if (na->data_size < bpos + 1) { + if (ntfs_attr_truncate(na, (na->data_size + 8) & ~7)) { + ntfs_log_perror("Failed to truncate AT_BITMAP"); + goto err_na; + } + } + } + + if (ntfs_attr_pread(na, bpos, 1, &byte) != 1) { + ntfs_log_perror("Failed to read $BITMAP"); + goto err_na; + } + + if (set) + byte |= bit; + else + byte &= ~bit; + + if (ntfs_attr_pwrite(na, bpos, 1, &byte) != 1) { + ntfs_log_perror("Failed to write $Bitmap"); + goto err_na; + } + + ret = STATUS_OK; +err_na: + ntfs_attr_close(na); + return ret; +} + + +static int ntfs_ibm_set(ntfs_index_context *icx, VCN vcn) +{ + return ntfs_ibm_modify(icx, vcn, 1); +} + +static int ntfs_ibm_clear(ntfs_index_context *icx, VCN vcn) +{ + return ntfs_ibm_modify(icx, vcn, 0); +} + +static VCN ntfs_ibm_get_free(ntfs_index_context *icx) +{ + u8 *bm; + int bit; + s64 vcn, byte, size; + + ntfs_log_trace("Entering\n"); + + bm = ntfs_attr_readall(icx->ni, AT_BITMAP, icx->name, icx->name_len, + &size); + if (!bm) + return (VCN)-1; + + for (byte = 0; byte < size; byte++) { + + if (bm[byte] == 255) + continue; + + for (bit = 0; bit < 8; bit++) { + if (!(bm[byte] & (1 << bit))) { + vcn = ntfs_ibm_pos_to_vcn(icx, byte * 8 + bit); + goto out; + } + } + } + + vcn = ntfs_ibm_pos_to_vcn(icx, size * 8); +out: + ntfs_log_trace("allocated vcn: %lld\n", (long long)vcn); + + if (ntfs_ibm_set(icx, vcn)) + vcn = (VCN)-1; + + free(bm); + return vcn; +} + +static INDEX_BLOCK *ntfs_ir_to_ib(INDEX_ROOT *ir, VCN ib_vcn) +{ + INDEX_BLOCK *ib; + INDEX_ENTRY *ie_last; + char *ies_start, *ies_end; + int i; + + ntfs_log_trace("Entering\n"); + + ib = ntfs_ib_alloc(ib_vcn, le32_to_cpu(ir->index_block_size), LEAF_NODE); + if (!ib) + return NULL; + + ies_start = (char *)ntfs_ie_get_first(&ir->index); + ies_end = (char *)ntfs_ie_get_end(&ir->index); + ie_last = ntfs_ie_get_last((INDEX_ENTRY *)ies_start, ies_end); + /* + * Copy all entries, including the termination entry + * as well, which can never have any data. + */ + i = (char *)ie_last - ies_start + le16_to_cpu(ie_last->length); + memcpy(ntfs_ie_get_first(&ib->index), ies_start, i); + + ib->index.ih_flags = ir->index.ih_flags; + ib->index.index_length = cpu_to_le32(i + + le32_to_cpu(ib->index.entries_offset)); + return ib; +} + +static void ntfs_ir_nill(INDEX_ROOT *ir) +{ + INDEX_ENTRY *ie_last; + char *ies_start, *ies_end; + + ntfs_log_trace("Entering\n"); + /* + * TODO: This function could be much simpler. + */ + ies_start = (char *)ntfs_ie_get_first(&ir->index); + ies_end = (char *)ntfs_ie_get_end(&ir->index); + ie_last = ntfs_ie_get_last((INDEX_ENTRY *)ies_start, ies_end); + /* + * Move the index root termination entry forward + */ + if ((char *)ie_last > ies_start) { + memmove(ies_start, (char *)ie_last, le16_to_cpu(ie_last->length)); + ie_last = (INDEX_ENTRY *)ies_start; + } +} + +static int ntfs_ib_copy_tail(ntfs_index_context *icx, INDEX_BLOCK *src, + INDEX_ENTRY *median, VCN new_vcn) +{ + u8 *ies_end; + INDEX_ENTRY *ie_head; /* first entry after the median */ + int tail_size, ret; + INDEX_BLOCK *dst; + + ntfs_log_trace("Entering\n"); + + dst = ntfs_ib_alloc(new_vcn, icx->block_size, + src->index.ih_flags & NODE_MASK); + if (!dst) + return STATUS_ERROR; + + ie_head = ntfs_ie_get_next(median); + + ies_end = (u8 *)ntfs_ie_get_end(&src->index); + tail_size = ies_end - (u8 *)ie_head; + memcpy(ntfs_ie_get_first(&dst->index), ie_head, tail_size); + + dst->index.index_length = cpu_to_le32(tail_size + + le32_to_cpu(dst->index.entries_offset)); + ret = ntfs_ib_write(icx, dst); + + free(dst); + return ret; +} + +static int ntfs_ib_cut_tail(ntfs_index_context *icx, INDEX_BLOCK *ib, + INDEX_ENTRY *ie) +{ + char *ies_start, *ies_end; + INDEX_ENTRY *ie_last; + + ntfs_log_trace("Entering\n"); + + ies_start = (char *)ntfs_ie_get_first(&ib->index); + ies_end = (char *)ntfs_ie_get_end(&ib->index); + + ie_last = ntfs_ie_get_last((INDEX_ENTRY *)ies_start, ies_end); + if (ie_last->ie_flags & INDEX_ENTRY_NODE) + ntfs_ie_set_vcn(ie_last, ntfs_ie_get_vcn(ie)); + + memcpy(ie, ie_last, le16_to_cpu(ie_last->length)); + + ib->index.index_length = cpu_to_le32(((char *)ie - ies_start) + + le16_to_cpu(ie->length) + le32_to_cpu(ib->index.entries_offset)); + + if (ntfs_ib_write(icx, ib)) + return STATUS_ERROR; + + return STATUS_OK; +} + +static int ntfs_ia_add(ntfs_index_context *icx) +{ + ntfs_log_trace("Entering\n"); + + if (ntfs_ibm_add(icx)) + return -1; + + if (!ntfs_attr_exist(icx->ni, AT_INDEX_ALLOCATION, icx->name, icx->name_len)) { + + if (ntfs_attr_add(icx->ni, AT_INDEX_ALLOCATION, icx->name, + icx->name_len, NULL, 0)) { + ntfs_log_perror("Failed to add AT_INDEX_ALLOCATION"); + return -1; + } + } + + icx->ia_na = ntfs_ia_open(icx, icx->ni); + if (!icx->ia_na) + return -1; + + return 0; +} + +static int ntfs_ir_reparent(ntfs_index_context *icx) +{ + ntfs_attr_search_ctx *ctx = NULL; + INDEX_ROOT *ir; + INDEX_ENTRY *ie; + INDEX_BLOCK *ib = NULL; + VCN new_ib_vcn; + int ix_root_size; + int ret = STATUS_ERROR; + + ntfs_log_trace("Entering\n"); + + ir = ntfs_ir_lookup2(icx->ni, icx->name, icx->name_len); + if (!ir) + goto out; + + if ((ir->index.ih_flags & NODE_MASK) == SMALL_INDEX) + if (ntfs_ia_add(icx)) + goto out; + + new_ib_vcn = ntfs_ibm_get_free(icx); + if (new_ib_vcn == -1) + goto out; + + ir = ntfs_ir_lookup2(icx->ni, icx->name, icx->name_len); + if (!ir) + goto clear_bmp; + + ib = ntfs_ir_to_ib(ir, new_ib_vcn); + if (ib == NULL) { + ntfs_log_perror("Failed to move index root to index block"); + goto clear_bmp; + } + + if (ntfs_ib_write(icx, ib)) + goto clear_bmp; + +retry : + ir = ntfs_ir_lookup(icx->ni, icx->name, icx->name_len, &ctx); + if (!ir) + goto clear_bmp; + + ntfs_ir_nill(ir); + + ie = ntfs_ie_get_first(&ir->index); + ie->ie_flags |= INDEX_ENTRY_NODE; + ie->length = cpu_to_le16(sizeof(INDEX_ENTRY_HEADER) + sizeof(VCN)); + + ir->index.ih_flags = LARGE_INDEX; + ir->index.index_length = cpu_to_le32(le32_to_cpu(ir->index.entries_offset) + + le16_to_cpu(ie->length)); + ir->index.allocated_size = ir->index.index_length; + ix_root_size = sizeof(INDEX_ROOT) - sizeof(INDEX_HEADER) + + le32_to_cpu(ir->index.allocated_size); + if (ntfs_resident_attr_value_resize(ctx->mrec, ctx->attr, + ix_root_size)) { + /* + * When there is no space to build a non-resident + * index, we may have to move the root to an extent + */ + if ((errno == ENOSPC) + && !ctx->al_entry + && !ntfs_inode_add_attrlist(icx->ni)) { + ntfs_attr_put_search_ctx(ctx); + ctx = (ntfs_attr_search_ctx*)NULL; + ir = ntfs_ir_lookup(icx->ni, icx->name, icx->name_len, + &ctx); + if (ir + && !ntfs_attr_record_move_away(ctx, ix_root_size + - le32_to_cpu(ctx->attr->value_length))) { + ntfs_attr_put_search_ctx(ctx); + ctx = (ntfs_attr_search_ctx*)NULL; + goto retry; + } + } + /* FIXME: revert index root */ + goto clear_bmp; + } + /* + * FIXME: do it earlier if we have enough space in IR (should always), + * so in error case we wouldn't lose the IB. + */ + ntfs_ie_set_vcn(ie, new_ib_vcn); + + ret = STATUS_OK; +err_out: + free(ib); + ntfs_attr_put_search_ctx(ctx); +out: + return ret; +clear_bmp: + ntfs_ibm_clear(icx, new_ib_vcn); + goto err_out; +} + +/** + * ntfs_ir_truncate - Truncate index root attribute + * + * Returns STATUS_OK, STATUS_RESIDENT_ATTRIBUTE_FILLED_MFT or STATUS_ERROR. + */ +static int ntfs_ir_truncate(ntfs_index_context *icx, int data_size) +{ + ntfs_attr *na; + int ret; + + ntfs_log_trace("Entering\n"); + + na = ntfs_attr_open(icx->ni, AT_INDEX_ROOT, icx->name, icx->name_len); + if (!na) { + ntfs_log_perror("Failed to open INDEX_ROOT"); + return STATUS_ERROR; + } + /* + * INDEX_ROOT must be resident and its entries can be moved to + * INDEX_BLOCK, so ENOSPC isn't a real error. + */ + ret = ntfs_attr_truncate(na, data_size + offsetof(INDEX_ROOT, index)); + if (ret == STATUS_OK) { + + icx->ir = ntfs_ir_lookup2(icx->ni, icx->name, icx->name_len); + if (!icx->ir) + return STATUS_ERROR; + + icx->ir->index.allocated_size = cpu_to_le32(data_size); + + } else if (ret == STATUS_ERROR) + ntfs_log_perror("Failed to truncate INDEX_ROOT"); + + ntfs_attr_close(na); + return ret; +} + +/** + * ntfs_ir_make_space - Make more space for the index root attribute + * + * On success return STATUS_OK or STATUS_KEEP_SEARCHING. + * On error return STATUS_ERROR. + */ +static int ntfs_ir_make_space(ntfs_index_context *icx, int data_size) +{ + int ret; + + ntfs_log_trace("Entering\n"); + + ret = ntfs_ir_truncate(icx, data_size); + if (ret == STATUS_RESIDENT_ATTRIBUTE_FILLED_MFT) { + + ret = ntfs_ir_reparent(icx); + if (ret == STATUS_OK) + ret = STATUS_KEEP_SEARCHING; + else + ntfs_log_perror("Failed to nodify INDEX_ROOT"); + } + + return ret; +} + +/* + * NOTE: 'ie' must be a copy of a real index entry. + */ +static int ntfs_ie_add_vcn(INDEX_ENTRY **ie) +{ + INDEX_ENTRY *p, *old = *ie; + + old->length = cpu_to_le16(le16_to_cpu(old->length) + sizeof(VCN)); + p = MEM2_realloc(old, le16_to_cpu(old->length)); + if (!p) + return STATUS_ERROR; + + p->ie_flags |= INDEX_ENTRY_NODE; + *ie = p; + + return STATUS_OK; +} + +static int ntfs_ih_insert(INDEX_HEADER *ih, INDEX_ENTRY *orig_ie, VCN new_vcn, + int pos) +{ + INDEX_ENTRY *ie_node, *ie; + int ret = STATUS_ERROR; + VCN old_vcn; + + ntfs_log_trace("Entering\n"); + + ie = ntfs_ie_dup(orig_ie); + if (!ie) + return STATUS_ERROR; + + if (!(ie->ie_flags & INDEX_ENTRY_NODE)) + if (ntfs_ie_add_vcn(&ie)) + goto out; + + ie_node = ntfs_ie_get_by_pos(ih, pos); + old_vcn = ntfs_ie_get_vcn(ie_node); + ntfs_ie_set_vcn(ie_node, new_vcn); + + ntfs_ie_insert(ih, ie, ie_node); + ntfs_ie_set_vcn(ie_node, old_vcn); + ret = STATUS_OK; +out: + free(ie); + + return ret; +} + +static VCN ntfs_icx_parent_vcn(ntfs_index_context *icx) +{ + return icx->parent_vcn[icx->pindex]; +} + +static VCN ntfs_icx_parent_pos(ntfs_index_context *icx) +{ + return icx->parent_pos[icx->pindex]; +} + + +static int ntfs_ir_insert_median(ntfs_index_context *icx, INDEX_ENTRY *median, + VCN new_vcn) +{ + u32 new_size; + int ret; + + ntfs_log_trace("Entering\n"); + + icx->ir = ntfs_ir_lookup2(icx->ni, icx->name, icx->name_len); + if (!icx->ir) + return STATUS_ERROR; + + new_size = le32_to_cpu(icx->ir->index.index_length) + + le16_to_cpu(median->length); + if (!(median->ie_flags & INDEX_ENTRY_NODE)) + new_size += sizeof(VCN); + + ret = ntfs_ir_make_space(icx, new_size); + if (ret != STATUS_OK) + return ret; + + icx->ir = ntfs_ir_lookup2(icx->ni, icx->name, icx->name_len); + if (!icx->ir) + return STATUS_ERROR; + + return ntfs_ih_insert(&icx->ir->index, median, new_vcn, + ntfs_icx_parent_pos(icx)); +} + +static int ntfs_ib_split(ntfs_index_context *icx, INDEX_BLOCK *ib); + +/** + * On success return STATUS_OK or STATUS_KEEP_SEARCHING. + * On error return STATUS_ERROR. + */ +static int ntfs_ib_insert(ntfs_index_context *icx, INDEX_ENTRY *ie, VCN new_vcn) +{ + INDEX_BLOCK *ib; + u32 idx_size, allocated_size; + int err = STATUS_ERROR; + VCN old_vcn; + + ntfs_log_trace("Entering\n"); + + ib = ntfs_malloc(icx->block_size); + if (!ib) + return -1; + + old_vcn = ntfs_icx_parent_vcn(icx); + + if (ntfs_ib_read(icx, old_vcn, ib)) + goto err_out; + + idx_size = le32_to_cpu(ib->index.index_length); + allocated_size = le32_to_cpu(ib->index.allocated_size); + /* FIXME: sizeof(VCN) should be included only if ie has no VCN */ + if (idx_size + le16_to_cpu(ie->length) + sizeof(VCN) > allocated_size) { + err = ntfs_ib_split(icx, ib); + if (err == STATUS_OK) + err = STATUS_KEEP_SEARCHING; + goto err_out; + } + + if (ntfs_ih_insert(&ib->index, ie, new_vcn, ntfs_icx_parent_pos(icx))) + goto err_out; + + if (ntfs_ib_write(icx, ib)) + goto err_out; + + err = STATUS_OK; +err_out: + free(ib); + return err; +} + +/** + * ntfs_ib_split - Split an index block + * + * On success return STATUS_OK or STATUS_KEEP_SEARCHING. + * On error return is STATUS_ERROR. + */ +static int ntfs_ib_split(ntfs_index_context *icx, INDEX_BLOCK *ib) +{ + INDEX_ENTRY *median; + VCN new_vcn; + int ret; + + ntfs_log_trace("Entering\n"); + + if (ntfs_icx_parent_dec(icx)) + return STATUS_ERROR; + + median = ntfs_ie_get_median(&ib->index); + new_vcn = ntfs_ibm_get_free(icx); + if (new_vcn == -1) + return STATUS_ERROR; + + if (ntfs_ib_copy_tail(icx, ib, median, new_vcn)) { + ntfs_ibm_clear(icx, new_vcn); + return STATUS_ERROR; + } + + if (ntfs_icx_parent_vcn(icx) == VCN_INDEX_ROOT_PARENT) + ret = ntfs_ir_insert_median(icx, median, new_vcn); + else + ret = ntfs_ib_insert(icx, median, new_vcn); + + if (ret != STATUS_OK) { + ntfs_ibm_clear(icx, new_vcn); + return ret; + } + + ret = ntfs_ib_cut_tail(icx, ib, median); + + return ret; +} + +/* JPA static */ +int ntfs_ie_add(ntfs_index_context *icx, INDEX_ENTRY *ie) +{ + INDEX_HEADER *ih; + int allocated_size, new_size; + int ret = STATUS_ERROR; + +#ifdef DEBUG +/* removed by JPA to make function usable for security indexes + char *fn; + fn = ntfs_ie_filename_get(ie); + ntfs_log_trace("file: '%s'\n", fn); + ntfs_attr_name_free(&fn); +*/ +#endif + + while (1) { + + if (!ntfs_index_lookup(&ie->key, le16_to_cpu(ie->key_length), icx)) { + errno = EEXIST; + ntfs_log_perror("Index already have such entry"); + goto err_out; + } + if (errno != ENOENT) { + ntfs_log_perror("Failed to find place for new entry"); + goto err_out; + } + + if (icx->is_in_root) + ih = &icx->ir->index; + else + ih = &icx->ib->index; + + allocated_size = le32_to_cpu(ih->allocated_size); + new_size = le32_to_cpu(ih->index_length) + le16_to_cpu(ie->length); + + if (new_size <= allocated_size) + break; + + ntfs_log_trace("index block sizes: allocated: %d needed: %d\n", + allocated_size, new_size); + + if (icx->is_in_root) { + if (ntfs_ir_make_space(icx, new_size) == STATUS_ERROR) + goto err_out; + } else { + if (ntfs_ib_split(icx, icx->ib) == STATUS_ERROR) + goto err_out; + } + + ntfs_inode_mark_dirty(icx->actx->ntfs_ino); + ntfs_index_ctx_reinit(icx); + } + + ntfs_ie_insert(ih, ie, icx->entry); + ntfs_index_entry_mark_dirty(icx); + + ret = STATUS_OK; +err_out: + ntfs_log_trace("%s\n", ret ? "Failed" : "Done"); + return ret; +} + +/** + * ntfs_index_add_filename - add filename to directory index + * @ni: ntfs inode describing directory to which index add filename + * @fn: FILE_NAME attribute to add + * @mref: reference of the inode which @fn describes + * + * Return 0 on success or -1 on error with errno set to the error code. + */ +int ntfs_index_add_filename(ntfs_inode *ni, FILE_NAME_ATTR *fn, MFT_REF mref) +{ + INDEX_ENTRY *ie; + ntfs_index_context *icx; + int fn_size, ie_size, err, ret = -1; + + ntfs_log_trace("Entering\n"); + + if (!ni || !fn) { + ntfs_log_error("Invalid arguments.\n"); + errno = EINVAL; + return -1; + } + + fn_size = (fn->file_name_length * sizeof(ntfschar)) + + sizeof(FILE_NAME_ATTR); + ie_size = (sizeof(INDEX_ENTRY_HEADER) + fn_size + 7) & ~7; + + ie = ntfs_calloc(ie_size); + if (!ie) + return -1; + + ie->indexed_file = cpu_to_le64(mref); + ie->length = cpu_to_le16(ie_size); + ie->key_length = cpu_to_le16(fn_size); + memcpy(&ie->key, fn, fn_size); + + icx = ntfs_index_ctx_get(ni, NTFS_INDEX_I30, 4); + if (!icx) + goto out; + + ret = ntfs_ie_add(icx, ie); + err = errno; + ntfs_index_ctx_put(icx); + errno = err; +out: + free(ie); + return ret; +} + +static int ntfs_ih_takeout(ntfs_index_context *icx, INDEX_HEADER *ih, + INDEX_ENTRY *ie, INDEX_BLOCK *ib) +{ + INDEX_ENTRY *ie_roam; + int ret = STATUS_ERROR; + + ntfs_log_trace("Entering\n"); + + ie_roam = ntfs_ie_dup_novcn(ie); + if (!ie_roam) + return STATUS_ERROR; + + ntfs_ie_delete(ih, ie); + + if (ntfs_icx_parent_vcn(icx) == VCN_INDEX_ROOT_PARENT) + ntfs_inode_mark_dirty(icx->actx->ntfs_ino); + else + if (ntfs_ib_write(icx, ib)) + goto out; + + ntfs_index_ctx_reinit(icx); + + ret = ntfs_ie_add(icx, ie_roam); +out: + free(ie_roam); + return ret; +} + +/** + * Used if an empty index block to be deleted has END entry as the parent + * in the INDEX_ROOT which is the only one there. + */ +static void ntfs_ir_leafify(ntfs_index_context *icx, INDEX_HEADER *ih) +{ + INDEX_ENTRY *ie; + + ntfs_log_trace("Entering\n"); + + ie = ntfs_ie_get_first(ih); + ie->ie_flags &= ~INDEX_ENTRY_NODE; + ie->length = cpu_to_le16(le16_to_cpu(ie->length) - sizeof(VCN)); + + ih->index_length = cpu_to_le32(le32_to_cpu(ih->index_length) - sizeof(VCN)); + ih->ih_flags &= ~LARGE_INDEX; + + /* Not fatal error */ + ntfs_ir_truncate(icx, le32_to_cpu(ih->index_length)); +} + +/** + * Used if an empty index block to be deleted has END entry as the parent + * in the INDEX_ROOT which is not the only one there. + */ +static int ntfs_ih_reparent_end(ntfs_index_context *icx, INDEX_HEADER *ih, + INDEX_BLOCK *ib) +{ + INDEX_ENTRY *ie, *ie_prev; + + ntfs_log_trace("Entering\n"); + + ie = ntfs_ie_get_by_pos(ih, ntfs_icx_parent_pos(icx)); + ie_prev = ntfs_ie_prev(ih, ie); + + ntfs_ie_set_vcn(ie, ntfs_ie_get_vcn(ie_prev)); + + return ntfs_ih_takeout(icx, ih, ie_prev, ib); +} + +static int ntfs_index_rm_leaf(ntfs_index_context *icx) +{ + INDEX_BLOCK *ib = NULL; + INDEX_HEADER *parent_ih; + INDEX_ENTRY *ie; + int ret = STATUS_ERROR; + + ntfs_log_trace("pindex: %d\n", icx->pindex); + + if (ntfs_icx_parent_dec(icx)) + return STATUS_ERROR; + + if (ntfs_ibm_clear(icx, icx->parent_vcn[icx->pindex + 1])) + return STATUS_ERROR; + + if (ntfs_icx_parent_vcn(icx) == VCN_INDEX_ROOT_PARENT) + parent_ih = &icx->ir->index; + else { + ib = ntfs_malloc(icx->block_size); + if (!ib) + return STATUS_ERROR; + + if (ntfs_ib_read(icx, ntfs_icx_parent_vcn(icx), ib)) + goto out; + + parent_ih = &ib->index; + } + + ie = ntfs_ie_get_by_pos(parent_ih, ntfs_icx_parent_pos(icx)); + if (!ntfs_ie_end(ie)) { + ret = ntfs_ih_takeout(icx, parent_ih, ie, ib); + goto out; + } + + if (ntfs_ih_zero_entry(parent_ih)) { + + if (ntfs_icx_parent_vcn(icx) == VCN_INDEX_ROOT_PARENT) { + ntfs_ir_leafify(icx, parent_ih); + goto ok; + } + + ret = ntfs_index_rm_leaf(icx); + goto out; + } + + if (ntfs_ih_reparent_end(icx, parent_ih, ib)) + goto out; +ok: + ret = STATUS_OK; +out: + free(ib); + return ret; +} + +static int ntfs_index_rm_node(ntfs_index_context *icx) +{ + int entry_pos, pindex; + VCN vcn; + INDEX_BLOCK *ib = NULL; + INDEX_ENTRY *ie_succ, *ie, *entry = icx->entry; + INDEX_HEADER *ih; + u32 new_size; + int delta, ret = STATUS_ERROR; + + ntfs_log_trace("Entering\n"); + + if (!icx->ia_na) { + icx->ia_na = ntfs_ia_open(icx, icx->ni); + if (!icx->ia_na) + return STATUS_ERROR; + } + + ib = ntfs_malloc(icx->block_size); + if (!ib) + return STATUS_ERROR; + + ie_succ = ntfs_ie_get_next(icx->entry); + entry_pos = icx->parent_pos[icx->pindex]++; + pindex = icx->pindex; +descend: + vcn = ntfs_ie_get_vcn(ie_succ); + if (ntfs_ib_read(icx, vcn, ib)) + goto out; + + ie_succ = ntfs_ie_get_first(&ib->index); + + if (ntfs_icx_parent_inc(icx)) + goto out; + + icx->parent_vcn[icx->pindex] = vcn; + icx->parent_pos[icx->pindex] = 0; + + if ((ib->index.ih_flags & NODE_MASK) == INDEX_NODE) + goto descend; + + if (ntfs_ih_zero_entry(&ib->index)) { + errno = EIO; + ntfs_log_perror("Empty index block"); + goto out; + } + + ie = ntfs_ie_dup(ie_succ); + if (!ie) + goto out; + + if (ntfs_ie_add_vcn(&ie)) + goto out2; + + ntfs_ie_set_vcn(ie, ntfs_ie_get_vcn(icx->entry)); + + if (icx->is_in_root) + ih = &icx->ir->index; + else + ih = &icx->ib->index; + + delta = le16_to_cpu(ie->length) - le16_to_cpu(icx->entry->length); + new_size = le32_to_cpu(ih->index_length) + delta; + if (delta > 0) { + if (icx->is_in_root) { + ret = ntfs_ir_make_space(icx, new_size); + if (ret != STATUS_OK) + goto out2; + + ih = &icx->ir->index; + entry = ntfs_ie_get_by_pos(ih, entry_pos); + + } else if (new_size > le32_to_cpu(ih->allocated_size)) { + icx->pindex = pindex; + ret = ntfs_ib_split(icx, icx->ib); + if (ret == STATUS_OK) + ret = STATUS_KEEP_SEARCHING; + goto out2; + } + } + + ntfs_ie_delete(ih, entry); + ntfs_ie_insert(ih, ie, entry); + + if (icx->is_in_root) { + if (ntfs_ir_truncate(icx, new_size)) + goto out2; + } else + if (ntfs_icx_ib_write(icx)) + goto out2; + + ntfs_ie_delete(&ib->index, ie_succ); + + if (ntfs_ih_zero_entry(&ib->index)) { + if (ntfs_index_rm_leaf(icx)) + goto out2; + } else + if (ntfs_ib_write(icx, ib)) + goto out2; + + ret = STATUS_OK; +out2: + free(ie); +out: + free(ib); + return ret; +} + +/** + * ntfs_index_rm - remove entry from the index + * @icx: index context describing entry to delete + * + * Delete entry described by @icx from the index. Index context is always + * reinitialized after use of this function, so it can be used for index + * lookup once again. + * + * Return 0 on success or -1 on error with errno set to the error code. + */ +/*static JPA*/ +int ntfs_index_rm(ntfs_index_context *icx) +{ + INDEX_HEADER *ih; + int err, ret = STATUS_OK; + + ntfs_log_trace("Entering\n"); + + if (!icx || (!icx->ib && !icx->ir) || ntfs_ie_end(icx->entry)) { + ntfs_log_error("Invalid arguments.\n"); + errno = EINVAL; + goto err_out; + } + if (icx->is_in_root) + ih = &icx->ir->index; + else + ih = &icx->ib->index; + + if (icx->entry->ie_flags & INDEX_ENTRY_NODE) { + + ret = ntfs_index_rm_node(icx); + + } else if (icx->is_in_root || !ntfs_ih_one_entry(ih)) { + + ntfs_ie_delete(ih, icx->entry); + + if (icx->is_in_root) { + err = ntfs_ir_truncate(icx, le32_to_cpu(ih->index_length)); + if (err != STATUS_OK) + goto err_out; + } else + if (ntfs_icx_ib_write(icx)) + goto err_out; + } else { + if (ntfs_index_rm_leaf(icx)) + goto err_out; + } +out: + return ret; +err_out: + ret = STATUS_ERROR; + goto out; +} + +int ntfs_index_remove(ntfs_inode *dir_ni, ntfs_inode *ni, + const void *key, const int keylen) +{ + int ret = STATUS_ERROR; + ntfs_index_context *icx; + + icx = ntfs_index_ctx_get(dir_ni, NTFS_INDEX_I30, 4); + if (!icx) + return -1; + + while (1) { + + if (ntfs_index_lookup(key, keylen, icx)) + goto err_out; + + if ((((FILE_NAME_ATTR *)icx->data)->file_attributes & + FILE_ATTR_REPARSE_POINT) + && !ntfs_possible_symlink(ni)) { + errno = EOPNOTSUPP; + goto err_out; + } + + ret = ntfs_index_rm(icx); + if (ret == STATUS_ERROR) + goto err_out; + else if (ret == STATUS_OK) + break; + + ntfs_inode_mark_dirty(icx->actx->ntfs_ino); + ntfs_index_ctx_reinit(icx); + } + + ntfs_inode_mark_dirty(icx->actx->ntfs_ino); +out: + ntfs_index_ctx_put(icx); + return ret; +err_out: + ret = STATUS_ERROR; + ntfs_log_perror("Delete failed"); + goto out; +} + +/** + * ntfs_index_root_get - read the index root of an attribute + * @ni: open ntfs inode in which the ntfs attribute resides + * @attr: attribute for which we want its index root + * + * This function will read the related index root an ntfs attribute. + * + * On success a buffer is allocated with the content of the index root + * and which needs to be freed when it's not needed anymore. + * + * On error NULL is returned with errno set to the error code. + */ +INDEX_ROOT *ntfs_index_root_get(ntfs_inode *ni, ATTR_RECORD *attr) +{ + ntfs_attr_search_ctx *ctx; + ntfschar *name; + INDEX_ROOT *root = NULL; + + name = (ntfschar *)((u8 *)attr + le16_to_cpu(attr->name_offset)); + + if (!ntfs_ir_lookup(ni, name, attr->name_length, &ctx)) + return NULL; + + root = ntfs_malloc(sizeof(INDEX_ROOT)); + if (!root) + goto out; + + *root = *((INDEX_ROOT *)((u8 *)ctx->attr + + le16_to_cpu(ctx->attr->value_offset))); +out: + ntfs_attr_put_search_ctx(ctx); + return root; +} + + +/* + * Walk down the index tree (leaf bound) + * until there are no subnode in the first index entry + * returns the entry at the bottom left in subnode + */ + +static INDEX_ENTRY *ntfs_index_walk_down(INDEX_ENTRY *ie, + ntfs_index_context *ictx) +{ + INDEX_ENTRY *entry; + s64 vcn; + + entry = ie; + do { + vcn = ntfs_ie_get_vcn(entry); + if (ictx->is_in_root) { + + /* down from level zero */ + + ictx->ir = (INDEX_ROOT*)NULL; + ictx->ib = (INDEX_BLOCK*)ntfs_malloc(ictx->block_size); + ictx->pindex = 1; + ictx->is_in_root = FALSE; + } else { + + /* down from non-zero level */ + + ictx->pindex++; + } + ictx->parent_pos[ictx->pindex] = 0; + ictx->parent_vcn[ictx->pindex] = vcn; + if (!ntfs_ib_read(ictx,vcn,ictx->ib)) { + ictx->entry = ntfs_ie_get_first(&ictx->ib->index); + entry = ictx->entry; + } else + entry = (INDEX_ENTRY*)NULL; + } while (entry && (entry->ie_flags & INDEX_ENTRY_NODE)); + return (entry); +} + +/* + * Walk up the index tree (root bound) + * until there is a valid data entry in parent + * returns the parent entry or NULL if no more parent + */ + +static INDEX_ENTRY *ntfs_index_walk_up(INDEX_ENTRY *ie, + ntfs_index_context *ictx) +{ + INDEX_ENTRY *entry; + s64 vcn; + + entry = ie; + if (ictx->pindex > 0) { + do { + ictx->pindex--; + if (!ictx->pindex) { + + /* we have reached the root */ + + free(ictx->ib); + ictx->ib = (INDEX_BLOCK*)NULL; + ictx->is_in_root = TRUE; + /* a new search context is to be allocated */ + if (ictx->actx) + free(ictx->actx); + ictx->ir = ntfs_ir_lookup(ictx->ni, + ictx->name, ictx->name_len, + &ictx->actx); + if (ictx->ir) + entry = ntfs_ie_get_by_pos( + &ictx->ir->index, + ictx->parent_pos[ictx->pindex]); + else + entry = (INDEX_ENTRY*)NULL; + } else { + /* up into non-root node */ + vcn = ictx->parent_vcn[ictx->pindex]; + if (!ntfs_ib_read(ictx,vcn,ictx->ib)) { + entry = ntfs_ie_get_by_pos( + &ictx->ib->index, + ictx->parent_pos[ictx->pindex]); + } else + entry = (INDEX_ENTRY*)NULL; + } + ictx->entry = entry; + } while (entry && (ictx->pindex > 0) + && (entry->ie_flags & INDEX_ENTRY_END)); + } else + entry = (INDEX_ENTRY*)NULL; + return (entry); +} + +/* + * Get next entry in an index according to collating sequence. + * Must be initialized through a ntfs_index_lookup() + * + * Returns next entry or NULL if none + * + * Sample layout : + * + * +---+---+---+---+---+---+---+---+ n ptrs to subnodes + * | | | 10| 25| 33| | | | n-1 keys in between + * +---+---+---+---+---+---+---+---+ no key in last entry + * | A | A + * | | | +-------------------------------+ + * +--------------------------+ | +-----+ | + * | +--+ | | + * V | V | + * +---+---+---+---+---+---+---+---+ | +---+---+---+---+---+---+---+---+ + * | 11| 12| 13| 14| 15| 16| 17| | | | 26| 27| 28| 29| 30| 31| 32| | + * +---+---+---+---+---+---+---+---+ | +---+---+---+---+---+---+---+---+ + * | | + * +-----------------------+ | + * | | + * +---+---+---+---+---+---+---+---+ + * | 18| 19| 20| 21| 22| 23| 24| | + * +---+---+---+---+---+---+---+---+ + */ + +INDEX_ENTRY *ntfs_index_next(INDEX_ENTRY *ie, ntfs_index_context *ictx) +{ + INDEX_ENTRY *next; + int flags; + + /* + * lookup() may have returned an invalid node + * when searching for a partial key + * if this happens, walk up + */ + + if (ie->ie_flags & INDEX_ENTRY_END) + next = ntfs_index_walk_up(ie, ictx); + else { + /* + * get next entry in same node + * there is always one after any entry with data + */ + + next = (INDEX_ENTRY*)((char*)ie + le16_to_cpu(ie->length)); + ++ictx->parent_pos[ictx->pindex]; + flags = next->ie_flags; + + /* walk down if it has a subnode */ + + if (flags & INDEX_ENTRY_NODE) { + next = ntfs_index_walk_down(next,ictx); + } else { + + /* walk up it has no subnode, nor data */ + + if (flags & INDEX_ENTRY_END) { + next = ntfs_index_walk_up(next, ictx); + } + } + } + /* return NULL if stuck at end of a block */ + + if (next && (next->ie_flags & INDEX_ENTRY_END)) + next = (INDEX_ENTRY*)NULL; + return (next); +} + + diff --git a/portlibs/sources/libntfs/index.h b/portlibs/sources/libntfs/index.h new file mode 100644 index 00000000..c0e76180 --- /dev/null +++ b/portlibs/sources/libntfs/index.h @@ -0,0 +1,167 @@ +/* + * index.h - Defines for NTFS index handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2004 Anton Altaparmakov + * Copyright (c) 2004-2005 Richard Russon + * Copyright (c) 2005 Yura Pakhuchiy + * Copyright (c) 2006-2008 Szabolcs Szakacsits + * + * 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 + */ + +#ifndef _NTFS_INDEX_H +#define _NTFS_INDEX_H + +/* Convenience macros to test the versions of gcc. + * Use them like this: + * #if __GNUC_PREREQ (2,8) + * ... code requiring gcc 2.8 or later ... + * #endif + * Note - they won't work for gcc1 or glibc1, since the _MINOR macros + * were not defined then. + */ + +#ifndef __GNUC_PREREQ +# if defined __GNUC__ && defined __GNUC_MINOR__ +# define __GNUC_PREREQ(maj, min) \ + ((__GNUC__ << 16) + __GNUC_MINOR__ >= ((maj) << 16) + (min)) +# else +# define __GNUC_PREREQ(maj, min) 0 +# endif +#endif + +/* allows us to warn about unused results of certain function calls */ +#ifndef __attribute_warn_unused_result__ +# if __GNUC_PREREQ (3,4) +# define __attribute_warn_unused_result__ \ + __attribute__ ((__warn_unused_result__)) +# else +# define __attribute_warn_unused_result__ /* empty */ +# endif +#endif + +#include "attrib.h" +#include "types.h" +#include "layout.h" +#include "inode.h" +#include "mft.h" + +#define VCN_INDEX_ROOT_PARENT ((VCN)-2) + +#define MAX_PARENT_VCN 32 + +typedef int (*COLLATE)(ntfs_volume *vol, const void *data1, int len1, + const void *data2, int len2); + +/** + * struct ntfs_index_context - + * @ni: inode containing the @entry described by this context + * @name: name of the index described by this context + * @name_len: length of the index name + * @entry: index entry (points into @ir or @ia) + * @data: index entry data (points into @entry) + * @data_len: length in bytes of @data + * @is_in_root: TRUE if @entry is in @ir or FALSE if it is in @ia + * @ir: index root if @is_in_root or NULL otherwise + * @actx: attribute search context if in root or NULL otherwise + * @ia: index block if @is_in_root is FALSE or NULL otherwise + * @ia_na: opened INDEX_ALLOCATION attribute + * @parent_pos: parent entries' positions in the index block + * @parent_vcn: entry's parent node or VCN_INDEX_ROOT_PARENT + * @new_vcn: new VCN if we need to create a new index block + * @median: move to the parent if splitting index blocks + * @ib_dirty: TRUE if index block was changed + * @block_size: index block size + * @vcn_size_bits: VCN size bits for this index block + * + * @ni is the inode this context belongs to. + * + * @entry is the index entry described by this context. @data and @data_len + * are the index entry data and its length in bytes, respectively. @data + * simply points into @entry. This is probably what the user is interested in. + * + * If @is_in_root is TRUE, @entry is in the index root attribute @ir described + * by the attribute search context @actx and inode @ni. @ia and + * @ib_dirty are undefined in this case. + * + * If @is_in_root is FALSE, @entry is in the index allocation attribute and @ia + * point to the index allocation block and VCN where it's placed, + * respectively. @ir and @actx are NULL in this case. @ia_na is opened + * INDEX_ALLOCATION attribute. @ib_dirty is TRUE if index block was changed and + * FALSE otherwise. + * + * To obtain a context call ntfs_index_ctx_get(). + * + * When finished with the @entry and its @data, call ntfs_index_ctx_put() to + * free the context and other associated resources. + * + * If the index entry was modified, call ntfs_index_entry_mark_dirty() before + * the call to ntfs_index_ctx_put() to ensure that the changes are written + * to disk. + */ +typedef struct { + ntfs_inode *ni; + ntfschar *name; + u32 name_len; + INDEX_ENTRY *entry; + void *data; + u16 data_len; + COLLATE collate; + BOOL is_in_root; + INDEX_ROOT *ir; + ntfs_attr_search_ctx *actx; + INDEX_BLOCK *ib; + ntfs_attr *ia_na; + int parent_pos[MAX_PARENT_VCN]; /* parent entries' positions */ + VCN parent_vcn[MAX_PARENT_VCN]; /* entry's parent nodes */ + int pindex; /* maximum it's the number of the parent nodes */ + BOOL ib_dirty; + u32 block_size; + u8 vcn_size_bits; +} ntfs_index_context; + +extern ntfs_index_context *ntfs_index_ctx_get(ntfs_inode *ni, + ntfschar *name, u32 name_len); +extern void ntfs_index_ctx_put(ntfs_index_context *ictx); +extern void ntfs_index_ctx_reinit(ntfs_index_context *ictx); + +extern int ntfs_index_lookup(const void *key, const int key_len, + ntfs_index_context *ictx) __attribute_warn_unused_result__; + +extern INDEX_ENTRY *ntfs_index_next(INDEX_ENTRY *ie, + ntfs_index_context *ictx); + +extern int ntfs_index_add_filename(ntfs_inode *ni, FILE_NAME_ATTR *fn, + MFT_REF mref); +extern int ntfs_index_remove(ntfs_inode *dir_ni, ntfs_inode *ni, + const void *key, const int keylen); + +extern INDEX_ROOT *ntfs_index_root_get(ntfs_inode *ni, ATTR_RECORD *attr); + +extern VCN ntfs_ie_get_vcn(INDEX_ENTRY *ie); + +extern void ntfs_index_entry_mark_dirty(ntfs_index_context *ictx); + +extern char *ntfs_ie_filename_get(INDEX_ENTRY *ie); +extern void ntfs_ie_filename_dump(INDEX_ENTRY *ie); +extern void ntfs_ih_filename_dump(INDEX_HEADER *ih); + +/* the following was added by JPA for use in security.c */ +extern int ntfs_ie_add(ntfs_index_context *icx, INDEX_ENTRY *ie); +extern int ntfs_index_rm(ntfs_index_context *icx); + +#endif /* _NTFS_INDEX_H */ + diff --git a/portlibs/sources/libntfs/inode.c b/portlibs/sources/libntfs/inode.c new file mode 100644 index 00000000..bdc12a30 --- /dev/null +++ b/portlibs/sources/libntfs/inode.c @@ -0,0 +1,1575 @@ +/** + * inode.c - Inode handling code. Originated from the Linux-NTFS project. + * + * Copyright (c) 2002-2005 Anton Altaparmakov + * Copyright (c) 2002-2008 Szabolcs Szakacsits + * Copyright (c) 2004-2007 Yura Pakhuchiy + * Copyright (c) 2004-2005 Richard Russon + * Copyright (c) 2009-2010 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_STRING_H +#include <string.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_SETXATTR +#include <sys/xattr.h> +#endif + +#include "param.h" +#include "compat.h" +#include "types.h" +#include "volume.h" +#include "cache.h" +#include "inode.h" +#include "attrib.h" +#include "debug.h" +#include "mft.h" +#include "attrlist.h" +#include "runlist.h" +#include "lcnalloc.h" +#include "index.h" +#include "dir.h" +#include "ntfstime.h" +#include "logging.h" +#include "misc.h" + +ntfs_inode *ntfs_inode_base(ntfs_inode *ni) +{ + if (ni->nr_extents == -1) + return ni->base_ni; + return ni; +} + +/** + * ntfs_inode_mark_dirty - set the inode (and its base inode if it exists) dirty + * @ni: ntfs inode to set dirty + * + * Set the inode @ni dirty so it is written out later (at the latest at + * ntfs_inode_close() time). If @ni is an extent inode, set the base inode + * dirty, too. + * + * This function cannot fail. + */ +void ntfs_inode_mark_dirty(ntfs_inode *ni) +{ + NInoSetDirty(ni); + if (ni->nr_extents == -1) + NInoSetDirty(ni->base_ni); +} + +/** + * __ntfs_inode_allocate - Create and initialise an NTFS inode object + * @vol: + * + * Description... + * + * Returns: + */ +static ntfs_inode *__ntfs_inode_allocate(ntfs_volume *vol) +{ + ntfs_inode *ni; + + ni = (ntfs_inode*)ntfs_calloc(sizeof(ntfs_inode)); + if (ni) + ni->vol = vol; + return ni; +} + +/** + * ntfs_inode_allocate - Create an NTFS inode object + * @vol: + * + * Description... + * + * Returns: + */ +ntfs_inode *ntfs_inode_allocate(ntfs_volume *vol) +{ + return __ntfs_inode_allocate(vol); +} + +/** + * __ntfs_inode_release - Destroy an NTFS inode object + * @ni: + * + * Description... + * + * Returns: + */ +static void __ntfs_inode_release(ntfs_inode *ni) +{ + if (NInoDirty(ni)) + ntfs_log_error("Releasing dirty inode %lld!\n", + (long long)ni->mft_no); + if (NInoAttrList(ni) && ni->attr_list) + free(ni->attr_list); + free(ni->mrec); + free(ni); + return; +} + +/** + * ntfs_inode_open - open an inode ready for access + * @vol: volume to get the inode from + * @mref: inode number / mft record number to open + * + * Allocate an ntfs_inode structure and initialize it for the given inode + * specified by @mref. @mref specifies the inode number / mft record to read, + * including the sequence number, which can be 0 if no sequence number checking + * is to be performed. + * + * Then, allocate a buffer for the mft record, read the mft record from the + * volume @vol, and attach it to the ntfs_inode structure (->mrec). The + * mft record is mst deprotected and sanity checked for validity and we abort + * if deprotection or checks fail. + * + * Finally, search for an attribute list attribute in the mft record and if one + * is found, load the attribute list attribute value and attach it to the + * ntfs_inode structure (->attr_list). Also set the NI_AttrList bit to indicate + * this. + * + * Return a pointer to the ntfs_inode structure on success or NULL on error, + * with errno set to the error code. + */ +static ntfs_inode *ntfs_inode_real_open(ntfs_volume *vol, const MFT_REF mref) +{ + s64 l; + ntfs_inode *ni = NULL; + ntfs_attr_search_ctx *ctx; + STANDARD_INFORMATION *std_info; + le32 lthle; + int olderrno; + + ntfs_log_enter("Entering for inode %lld\n", (long long)MREF(mref)); + if (!vol) { + errno = EINVAL; + goto out; + } + ni = __ntfs_inode_allocate(vol); + if (!ni) + goto out; + if (ntfs_file_record_read(vol, mref, &ni->mrec, NULL)) + goto err_out; + if (!(ni->mrec->flags & MFT_RECORD_IN_USE)) { + errno = ENOENT; + goto err_out; + } + ni->mft_no = MREF(mref); + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + goto err_out; + /* Receive some basic information about inode. */ + if (ntfs_attr_lookup(AT_STANDARD_INFORMATION, AT_UNNAMED, + 0, CASE_SENSITIVE, 0, NULL, 0, ctx)) { + if (!ni->mrec->base_mft_record) + ntfs_log_perror("No STANDARD_INFORMATION in base record" + " %lld", (long long)MREF(mref)); + goto put_err_out; + } + std_info = (STANDARD_INFORMATION *)((u8 *)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + ni->flags = std_info->file_attributes; + ni->creation_time = std_info->creation_time; + ni->last_data_change_time = std_info->last_data_change_time; + ni->last_mft_change_time = std_info->last_mft_change_time; + ni->last_access_time = std_info->last_access_time; + /* JPA insert v3 extensions if present */ + /* length may be seen as 72 (v1.x) or 96 (v3.x) */ + lthle = ctx->attr->length; + if (le32_to_cpu(lthle) > sizeof(STANDARD_INFORMATION)) { + set_nino_flag(ni, v3_Extensions); + ni->owner_id = std_info->owner_id; + ni->security_id = std_info->security_id; + ni->quota_charged = std_info->quota_charged; + ni->usn = std_info->usn; + } else { + clear_nino_flag(ni, v3_Extensions); + ni->owner_id = const_cpu_to_le32(0); + ni->security_id = const_cpu_to_le32(0); + } + /* Set attribute list information. */ + olderrno = errno; + if (ntfs_attr_lookup(AT_ATTRIBUTE_LIST, AT_UNNAMED, 0, + CASE_SENSITIVE, 0, NULL, 0, ctx)) { + if (errno != ENOENT) + goto put_err_out; + /* Attribute list attribute does not present. */ + /* restore previous errno to avoid misinterpretation */ + errno = olderrno; + goto get_size; + } + NInoSetAttrList(ni); + l = ntfs_get_attribute_value_length(ctx->attr); + if (!l) + goto put_err_out; + if (l > 0x40000) { + errno = EIO; + ntfs_log_perror("Too large attrlist attribute (%lld), inode " + "%lld", (long long)l, (long long)MREF(mref)); + goto put_err_out; + } + ni->attr_list_size = l; + ni->attr_list = ntfs_malloc(ni->attr_list_size); + if (!ni->attr_list) + goto put_err_out; + l = ntfs_get_attribute_value(vol, ctx->attr, ni->attr_list); + if (!l) + goto put_err_out; + if (l != ni->attr_list_size) { + errno = EIO; + ntfs_log_perror("Unexpected attrlist size (%lld <> %u), inode " + "%lld", (long long)l, ni->attr_list_size, + (long long)MREF(mref)); + goto put_err_out; + } +get_size: + olderrno = errno; + if (ntfs_attr_lookup(AT_DATA, AT_UNNAMED, 0, 0, 0, NULL, 0, ctx)) { + if (errno != ENOENT) + goto put_err_out; + /* Directory or special file. */ + /* restore previous errno to avoid misinterpretation */ + errno = olderrno; + ni->data_size = ni->allocated_size = 0; + } else { + if (ctx->attr->non_resident) { + ni->data_size = sle64_to_cpu(ctx->attr->data_size); + if (ctx->attr->flags & + (ATTR_IS_COMPRESSED | ATTR_IS_SPARSE)) + ni->allocated_size = sle64_to_cpu( + ctx->attr->compressed_size); + else + ni->allocated_size = sle64_to_cpu( + ctx->attr->allocated_size); + } else { + ni->data_size = le32_to_cpu(ctx->attr->value_length); + ni->allocated_size = (ni->data_size + 7) & ~7; + } + set_nino_flag(ni,KnownSize); + } + ntfs_attr_put_search_ctx(ctx); +out: + ntfs_log_leave("\n"); + return ni; + +put_err_out: + ntfs_attr_put_search_ctx(ctx); +err_out: + __ntfs_inode_release(ni); + ni = NULL; + goto out; +} + +/** + * ntfs_inode_close - close an ntfs inode and free all associated memory + * @ni: ntfs inode to close + * + * Make sure the ntfs inode @ni is clean. + * + * If the ntfs inode @ni is a base inode, close all associated extent inodes, + * then deallocate all memory attached to it, and finally free the ntfs inode + * structure itself. + * + * If it is an extent inode, we disconnect it from its base inode before we + * destroy it. + * + * It is OK to pass NULL to this function, it is just noop in this case. + * + * Return 0 on success or -1 on error with errno set to the error code. On + * error, @ni has not been freed. The user should attempt to handle the error + * and call ntfs_inode_close() again. The following error codes are defined: + * + * EBUSY @ni and/or its attribute list runlist is/are dirty and the + * attempt to write it/them to disk failed. + * EINVAL @ni is invalid (probably it is an extent inode). + * EIO I/O error while trying to write inode to disk. + */ + +int ntfs_inode_real_close(ntfs_inode *ni) +{ + int ret = -1; + + if (!ni) + return 0; + + ntfs_log_enter("Entering for inode %lld\n", (long long)ni->mft_no); + + /* If we have dirty metadata, write it out. */ + if (NInoDirty(ni) || NInoAttrListDirty(ni)) { + if (ntfs_inode_sync(ni)) { + if (errno != EIO) + errno = EBUSY; + goto err; + } + } + /* Is this a base inode with mapped extent inodes? */ + if (ni->nr_extents > 0) { + while (ni->nr_extents > 0) { + if (ntfs_inode_real_close(ni->extent_nis[0])) { + if (errno != EIO) + errno = EBUSY; + goto err; + } + } + } else if (ni->nr_extents == -1) { + ntfs_inode **tmp_nis; + ntfs_inode *base_ni; + s32 i; + + /* + * If the inode is an extent inode, disconnect it from the + * base inode before destroying it. + */ + base_ni = ni->base_ni; + for (i = 0; i < base_ni->nr_extents; ++i) { + tmp_nis = base_ni->extent_nis; + if (tmp_nis[i] != ni) + continue; + /* Found it. Disconnect. */ + memmove(tmp_nis + i, tmp_nis + i + 1, + (base_ni->nr_extents - i - 1) * + sizeof(ntfs_inode *)); + /* Buffer should be for multiple of four extents. */ + if ((--base_ni->nr_extents) & 3) { + i = -1; + break; + } + /* + * ElectricFence is unhappy with realloc(x,0) as free(x) + * thus we explicitly separate these two cases. + */ + if (base_ni->nr_extents) { + /* Resize the memory buffer. */ + tmp_nis = MEM2_realloc(tmp_nis, base_ni->nr_extents * + sizeof(ntfs_inode *)); + /* Ignore errors, they don't really matter. */ + if (tmp_nis) + base_ni->extent_nis = tmp_nis; + } else if (tmp_nis) { + free(tmp_nis); + base_ni->extent_nis = (ntfs_inode**)NULL; + } + /* Allow for error checking. */ + i = -1; + break; + } + + /* + * We could successfully sync, so only log this error + * and try to sync other inode extents too. + */ + if (i != -1) + ntfs_log_error("Extent inode %lld was not found\n", + (long long)ni->mft_no); + } + + __ntfs_inode_release(ni); + ret = 0; +err: + ntfs_log_leave("\n"); + return ret; +} + +#if CACHE_NIDATA_SIZE + +/* + * Free an inode structure when there is not more space + * in the cache + */ + +void ntfs_inode_nidata_free(const struct CACHED_GENERIC *cached) +{ + ntfs_inode_real_close(((const struct CACHED_NIDATA*)cached)->ni); +} + +/* + * Compute a hash value for an inode entry + */ + +int ntfs_inode_nidata_hash(const struct CACHED_GENERIC *item) +{ + return (((const struct CACHED_NIDATA*)item)->inum + % (2*CACHE_NIDATA_SIZE)); +} + +/* + * inum comparing for entering/fetching from cache + */ + +static int idata_cache_compare(const struct CACHED_GENERIC *cached, + const struct CACHED_GENERIC *wanted) +{ + return (((const struct CACHED_NIDATA*)cached)->inum + != ((const struct CACHED_NIDATA*)wanted)->inum); +} + +/* + * Invalidate an inode entry when not needed anymore. + * The entry should have been synced, it may be reused later, + * if it is requested before it is dropped from cache. + */ + +void ntfs_inode_invalidate(ntfs_volume *vol, const MFT_REF mref) +{ + struct CACHED_NIDATA item; + int count; + + item.inum = MREF(mref); + item.ni = (ntfs_inode*)NULL; + item.pathname = (const char*)NULL; + item.varsize = 0; + count = ntfs_invalidate_cache(vol->nidata_cache, + GENERIC(&item),idata_cache_compare,CACHE_FREE); +} + +#endif + +/* + * Open an inode + * + * When possible, an entry recorded in the cache is reused + * + * **NEVER REOPEN** an inode, this can lead to a duplicated + * cache entry (hard to detect), and to an obsolete one being + * reused. System files are however protected from being cached. + */ + +ntfs_inode *ntfs_inode_open(ntfs_volume *vol, const MFT_REF mref) +{ + ntfs_inode *ni; +#if CACHE_NIDATA_SIZE + struct CACHED_NIDATA item; + struct CACHED_NIDATA *cached; + + /* fetch idata from cache */ + item.inum = MREF(mref); + debug_double_inode(item.inum,1); + item.pathname = (const char*)NULL; + item.varsize = 0; + cached = (struct CACHED_NIDATA*)ntfs_fetch_cache(vol->nidata_cache, + GENERIC(&item),idata_cache_compare); + if (cached) { + ni = cached->ni; + /* do not keep open entries in cache */ + ntfs_remove_cache(vol->nidata_cache, + (struct CACHED_GENERIC*)cached,0); + } else { + ni = ntfs_inode_real_open(vol, mref); + } + if (!ni) { + debug_double_inode(item.inum, 0); + } +#else + ni = ntfs_inode_real_open(vol, mref); +#endif + return (ni); +} + +/* + * Close an inode entry + * + * If cacheing is in use, the entry is synced and kept available + * in cache for further use. + * + * System files (inode < 16 or having the IS_4 flag) are protected + * against being cached. + */ + +int ntfs_inode_close(ntfs_inode *ni) +{ + int res; +#if CACHE_NIDATA_SIZE + BOOL dirty; + struct CACHED_NIDATA item; + + if (ni) { + debug_double_inode(ni->mft_no,0); + /* do not cache system files : could lead to double entries */ + if (ni->vol && ni->vol->nidata_cache + && ((ni->mft_no == FILE_root) + || ((ni->mft_no >= FILE_first_user) + && !(ni->mrec->flags & MFT_RECORD_IS_4)))) { + /* If we have dirty metadata, write it out. */ + dirty = NInoDirty(ni) || NInoAttrListDirty(ni); + if (dirty) { + res = ntfs_inode_sync(ni); + /* do a real close if sync failed */ + if (res) + ntfs_inode_real_close(ni); + } else + res = 0; + + if (!res) { + /* feed idata into cache */ + item.inum = ni->mft_no; + item.ni = ni; + item.pathname = (const char*)NULL; + item.varsize = 0; + debug_cached_inode(ni); + ntfs_enter_cache(ni->vol->nidata_cache, + GENERIC(&item), idata_cache_compare); + } + } else { + /* cache not ready or system file, really close */ + res = ntfs_inode_real_close(ni); + } + } else + res = 0; +#else + res = ntfs_inode_real_close(ni); +#endif + return (res); +} + +/** + * ntfs_extent_inode_open - load an extent inode and attach it to its base + * @base_ni: base ntfs inode + * @mref: mft reference of the extent inode to load (in little endian) + * + * First check if the extent inode @mref is already attached to the base ntfs + * inode @base_ni, and if so, return a pointer to the attached extent inode. + * + * If the extent inode is not already attached to the base inode, allocate an + * ntfs_inode structure and initialize it for the given inode @mref. @mref + * specifies the inode number / mft record to read, including the sequence + * number, which can be 0 if no sequence number checking is to be performed. + * + * Then, allocate a buffer for the mft record, read the mft record from the + * volume @base_ni->vol, and attach it to the ntfs_inode structure (->mrec). + * The mft record is mst deprotected and sanity checked for validity and we + * abort if deprotection or checks fail. + * + * Finally attach the ntfs inode to its base inode @base_ni and return a + * pointer to the ntfs_inode structure on success or NULL on error, with errno + * set to the error code. + * + * Note, extent inodes are never closed directly. They are automatically + * disposed off by the closing of the base inode. + */ +ntfs_inode *ntfs_extent_inode_open(ntfs_inode *base_ni, const MFT_REF mref) +{ + u64 mft_no = MREF_LE(mref); + ntfs_inode *ni = NULL; + ntfs_inode **extent_nis; + int i; + + if (!base_ni) { + errno = EINVAL; + ntfs_log_perror("%s", __FUNCTION__); + return NULL; + } + + ntfs_log_enter("Opening extent inode %lld (base mft record %lld).\n", + (unsigned long long)mft_no, + (unsigned long long)base_ni->mft_no); + + /* Is the extent inode already open and attached to the base inode? */ + if (base_ni->nr_extents > 0) { + extent_nis = base_ni->extent_nis; + for (i = 0; i < base_ni->nr_extents; i++) { + u16 seq_no; + + ni = extent_nis[i]; + if (mft_no != ni->mft_no) + continue; + /* Verify the sequence number if given. */ + seq_no = MSEQNO_LE(mref); + if (seq_no && seq_no != le16_to_cpu( + ni->mrec->sequence_number)) { + errno = EIO; + ntfs_log_perror("Found stale extent mft " + "reference mft=%lld", + (long long)ni->mft_no); + goto out; + } + goto out; + } + } + /* Wasn't there, we need to load the extent inode. */ + ni = __ntfs_inode_allocate(base_ni->vol); + if (!ni) + goto out; + if (ntfs_file_record_read(base_ni->vol, le64_to_cpu(mref), &ni->mrec, NULL)) + goto err_out; + ni->mft_no = mft_no; + ni->nr_extents = -1; + ni->base_ni = base_ni; + /* Attach extent inode to base inode, reallocating memory if needed. */ + if (!(base_ni->nr_extents & 3)) { + i = (base_ni->nr_extents + 4) * sizeof(ntfs_inode *); + + extent_nis = ntfs_malloc(i); + if (!extent_nis) + goto err_out; + if (base_ni->nr_extents) { + memcpy(extent_nis, base_ni->extent_nis, + i - 4 * sizeof(ntfs_inode *)); + free(base_ni->extent_nis); + } + base_ni->extent_nis = extent_nis; + } + base_ni->extent_nis[base_ni->nr_extents++] = ni; +out: + ntfs_log_leave("\n"); + return ni; +err_out: + __ntfs_inode_release(ni); + ni = NULL; + goto out; +} + +/** + * ntfs_inode_attach_all_extents - attach all extents for target inode + * @ni: opened ntfs inode for which perform attach + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +int ntfs_inode_attach_all_extents(ntfs_inode *ni) +{ + ATTR_LIST_ENTRY *ale; + u64 prev_attached = 0; + + if (!ni) { + ntfs_log_trace("Invalid arguments.\n"); + errno = EINVAL; + return -1; + } + + if (ni->nr_extents == -1) + ni = ni->base_ni; + + ntfs_log_trace("Entering for inode 0x%llx.\n", (long long) ni->mft_no); + + /* Inode haven't got attribute list, thus nothing to attach. */ + if (!NInoAttrList(ni)) + return 0; + + if (!ni->attr_list) { + ntfs_log_trace("Corrupt in-memory struct.\n"); + errno = EINVAL; + return -1; + } + + /* Walk through attribute list and attach all extents. */ + errno = 0; + ale = (ATTR_LIST_ENTRY *)ni->attr_list; + while ((u8*)ale < ni->attr_list + ni->attr_list_size) { + if (ni->mft_no != MREF_LE(ale->mft_reference) && + prev_attached != MREF_LE(ale->mft_reference)) { + if (!ntfs_extent_inode_open(ni, ale->mft_reference)) { + ntfs_log_trace("Couldn't attach extent inode.\n"); + return -1; + } + prev_attached = MREF_LE(ale->mft_reference); + } + ale = (ATTR_LIST_ENTRY *)((u8*)ale + le16_to_cpu(ale->length)); + } + return 0; +} + +/** + * ntfs_inode_sync_standard_information - update standard information attribute + * @ni: ntfs inode to update standard information + * + * Return 0 on success or -1 on error with errno set to the error code. + */ +static int ntfs_inode_sync_standard_information(ntfs_inode *ni) +{ + ntfs_attr_search_ctx *ctx; + STANDARD_INFORMATION *std_info; + u32 lth; + le32 lthle; + + ntfs_log_trace("Entering for inode %lld\n", (long long)ni->mft_no); + + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + return -1; + if (ntfs_attr_lookup(AT_STANDARD_INFORMATION, AT_UNNAMED, + 0, CASE_SENSITIVE, 0, NULL, 0, ctx)) { + ntfs_log_perror("Failed to sync standard info (inode %lld)", + (long long)ni->mft_no); + ntfs_attr_put_search_ctx(ctx); + return -1; + } + std_info = (STANDARD_INFORMATION *)((u8 *)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + std_info->file_attributes = ni->flags; + if (!test_nino_flag(ni, TimesSet)) { + std_info->creation_time = ni->creation_time; + std_info->last_data_change_time = ni->last_data_change_time; + std_info->last_mft_change_time = ni->last_mft_change_time; + std_info->last_access_time = ni->last_access_time; + } + + /* JPA update v3.x extensions, ensuring consistency */ + + lthle = ctx->attr->length; + lth = le32_to_cpu(lthle); + if (test_nino_flag(ni, v3_Extensions) + && (lth <= sizeof(STANDARD_INFORMATION))) + ntfs_log_error("bad sync of standard information\n"); + + if (lth > sizeof(STANDARD_INFORMATION)) { + std_info->owner_id = ni->owner_id; + std_info->security_id = ni->security_id; + std_info->quota_charged = ni->quota_charged; + std_info->usn = ni->usn; + } + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_put_search_ctx(ctx); + return 0; +} + +/** + * ntfs_inode_sync_file_name - update FILE_NAME attributes + * @ni: ntfs inode to update FILE_NAME attributes + * + * Update all FILE_NAME attributes for inode @ni in the index. + * + * Return 0 on success or -1 on error with errno set to the error code. + */ +static int ntfs_inode_sync_file_name(ntfs_inode *ni, ntfs_inode *dir_ni) +{ + ntfs_attr_search_ctx *ctx = NULL; + ntfs_index_context *ictx; + ntfs_inode *index_ni; + FILE_NAME_ATTR *fn; + FILE_NAME_ATTR *fnx; + REPARSE_POINT *rpp; + le32 reparse_tag; + int err = 0; + + ntfs_log_trace("Entering for inode %lld\n", (long long)ni->mft_no); + + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) { + err = errno; + goto err_out; + } + /* Collect the reparse tag, if any */ + reparse_tag = cpu_to_le32(0); + if (ni->flags & FILE_ATTR_REPARSE_POINT) { + if (!ntfs_attr_lookup(AT_REPARSE_POINT, NULL, + 0, CASE_SENSITIVE, 0, NULL, 0, ctx)) { + rpp = (REPARSE_POINT*)((u8 *)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + reparse_tag = rpp->reparse_tag; + } + ntfs_attr_reinit_search_ctx(ctx); + } + /* Walk through all FILE_NAME attributes and update them. */ + while (!ntfs_attr_lookup(AT_FILE_NAME, NULL, 0, 0, 0, NULL, 0, ctx)) { + fn = (FILE_NAME_ATTR *)((u8 *)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + if (MREF_LE(fn->parent_directory) == ni->mft_no) { + /* + * WARNING: We cheat here and obtain 2 attribute + * search contexts for one inode (first we obtained + * above, second will be obtained inside + * ntfs_index_lookup), it's acceptable for library, + * but will deadlock in the kernel. + */ + index_ni = ni; + } else + if (dir_ni) + index_ni = dir_ni; + else + index_ni = ntfs_inode_open(ni->vol, + le64_to_cpu(fn->parent_directory)); + if (!index_ni) { + if (!err) + err = errno; + ntfs_log_perror("Failed to open inode %lld with index", + (long long)le64_to_cpu(fn->parent_directory)); + continue; + } + ictx = ntfs_index_ctx_get(index_ni, NTFS_INDEX_I30, 4); + if (!ictx) { + if (!err) + err = errno; + ntfs_log_perror("Failed to get index ctx, inode %lld", + (long long)index_ni->mft_no); + if ((ni != index_ni) && !dir_ni + && ntfs_inode_close(index_ni) && !err) + err = errno; + continue; + } + if (ntfs_index_lookup(fn, sizeof(FILE_NAME_ATTR), ictx)) { + if (!err) { + if (errno == ENOENT) + err = EIO; + else + err = errno; + } + ntfs_log_perror("Index lookup failed, inode %lld", + (long long)index_ni->mft_no); + ntfs_index_ctx_put(ictx); + if (ni != index_ni && ntfs_inode_close(index_ni) && !err) + err = errno; + continue; + } + /* Update flags and file size. */ + fnx = (FILE_NAME_ATTR *)ictx->data; + fnx->file_attributes = + (fnx->file_attributes & ~FILE_ATTR_VALID_FLAGS) | + (ni->flags & FILE_ATTR_VALID_FLAGS); + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + fnx->data_size = fnx->allocated_size + = const_cpu_to_le64(0); + else { + fnx->allocated_size = cpu_to_sle64(ni->allocated_size); + fnx->data_size = cpu_to_sle64(ni->data_size); + /* + * The file name record has also to be fixed if some + * attribute update implied the unnamed data to be + * made non-resident + */ + fn->allocated_size = fnx->allocated_size; + } + /* update or clear the reparse tag in the index */ + fnx->reparse_point_tag = reparse_tag; + if (!test_nino_flag(ni, TimesSet)) { + fnx->creation_time = ni->creation_time; + fnx->last_data_change_time = ni->last_data_change_time; + fnx->last_mft_change_time = ni->last_mft_change_time; + fnx->last_access_time = ni->last_access_time; + } else { + fnx->creation_time = fn->creation_time; + fnx->last_data_change_time = fn->last_data_change_time; + fnx->last_mft_change_time = fn->last_mft_change_time; + fnx->last_access_time = fn->last_access_time; + } + ntfs_index_entry_mark_dirty(ictx); + ntfs_index_ctx_put(ictx); + if ((ni != index_ni) && !dir_ni + && ntfs_inode_close(index_ni) && !err) + err = errno; + } + /* Check for real error occurred. */ + if (errno != ENOENT) { + err = errno; + ntfs_log_perror("Attribute lookup failed, inode %lld", + (long long)ni->mft_no); + goto err_out; + } + ntfs_attr_put_search_ctx(ctx); + if (err) { + errno = err; + return -1; + } + return 0; +err_out: + if (ctx) + ntfs_attr_put_search_ctx(ctx); + errno = err; + return -1; +} + +/** + * ntfs_inode_sync - write the inode (and its dirty extents) to disk + * @ni: ntfs inode to write + * + * Write the inode @ni to disk as well as its dirty extent inodes if such + * exist and @ni is a base inode. If @ni is an extent inode, only @ni is + * written completely disregarding its base inode and any other extent inodes. + * + * For a base inode with dirty extent inodes if any writes fail for whatever + * reason, the failing inode is skipped and the sync process is continued. At + * the end the error condition that brought about the failure is returned. Thus + * the smallest amount of data loss possible occurs. + * + * Return 0 on success or -1 on error with errno set to the error code. + * The following error codes are defined: + * EINVAL - Invalid arguments were passed to the function. + * EBUSY - Inode and/or one of its extents is busy, try again later. + * EIO - I/O error while writing the inode (or one of its extents). + */ +static int ntfs_inode_sync_in_dir(ntfs_inode *ni, ntfs_inode *dir_ni) +{ + int ret = 0; + int err = 0; + if (!ni) { + errno = EINVAL; + ntfs_log_error("Failed to sync NULL inode\n"); + return -1; + } + + ntfs_log_enter("Entering for inode %lld\n", (long long)ni->mft_no); + + /* Update STANDARD_INFORMATION. */ + if ((ni->mrec->flags & MFT_RECORD_IN_USE) && ni->nr_extents != -1 && + ntfs_inode_sync_standard_information(ni)) { + if (!err || errno == EIO) { + err = errno; + if (err != EIO) + err = EBUSY; + } + } + + /* Update FILE_NAME's in the index. */ + if ((ni->mrec->flags & MFT_RECORD_IN_USE) && ni->nr_extents != -1 && + NInoFileNameTestAndClearDirty(ni) && + ntfs_inode_sync_file_name(ni, dir_ni)) { + if (!err || errno == EIO) { + err = errno; + if (err != EIO) + err = EBUSY; + } + ntfs_log_perror("Failed to sync FILE_NAME (inode %lld)", + (long long)ni->mft_no); + NInoFileNameSetDirty(ni); + } + + /* Write out attribute list from cache to disk. */ + if ((ni->mrec->flags & MFT_RECORD_IN_USE) && ni->nr_extents != -1 && + NInoAttrList(ni) && NInoAttrListTestAndClearDirty(ni)) { + ntfs_attr *na; + + na = ntfs_attr_open(ni, AT_ATTRIBUTE_LIST, AT_UNNAMED, 0); + if (!na) { + if (!err || errno == EIO) { + err = errno; + if (err != EIO) + err = EBUSY; + ntfs_log_perror("Attribute list sync failed " + "(open, inode %lld)", + (long long)ni->mft_no); + } + NInoAttrListSetDirty(ni); + goto sync_inode; + } + + if (na->data_size == ni->attr_list_size) { + if (ntfs_attr_pwrite(na, 0, ni->attr_list_size, + ni->attr_list) != ni->attr_list_size) { + if (!err || errno == EIO) { + err = errno; + if (err != EIO) + err = EBUSY; + ntfs_log_perror("Attribute list sync " + "failed (write, inode %lld)", + (long long)ni->mft_no); + } + NInoAttrListSetDirty(ni); + } + } else { + err = EIO; + ntfs_log_error("Attribute list sync failed (bad size, " + "inode %lld)\n", (long long)ni->mft_no); + NInoAttrListSetDirty(ni); + } + ntfs_attr_close(na); + } + +sync_inode: + /* Write this inode out to the $MFT (and $MFTMirr if applicable). */ + if (NInoTestAndClearDirty(ni)) { + if (ntfs_mft_record_write(ni->vol, ni->mft_no, ni->mrec)) { + if (!err || errno == EIO) { + err = errno; + if (err != EIO) + err = EBUSY; + } + NInoSetDirty(ni); + ntfs_log_perror("MFT record sync failed, inode %lld", + (long long)ni->mft_no); + } + } + + /* If this is a base inode with extents write all dirty extents, too. */ + if (ni->nr_extents > 0) { + s32 i; + + for (i = 0; i < ni->nr_extents; ++i) { + ntfs_inode *eni; + + eni = ni->extent_nis[i]; + if (!NInoTestAndClearDirty(eni)) + continue; + + if (ntfs_mft_record_write(eni->vol, eni->mft_no, + eni->mrec)) { + if (!err || errno == EIO) { + err = errno; + if (err != EIO) + err = EBUSY; + } + NInoSetDirty(eni); + ntfs_log_perror("Extent MFT record sync failed," + " inode %lld/%lld", + (long long)ni->mft_no, + (long long)eni->mft_no); + } + } + } + + if (err) { + errno = err; + ret = -1; + } + + ntfs_log_leave("\n"); + return ret; +} + +int ntfs_inode_sync(ntfs_inode *ni) +{ + return (ntfs_inode_sync_in_dir(ni, (ntfs_inode*)NULL)); +} + +/* + * Close an inode with an open parent inode + */ + +int ntfs_inode_close_in_dir(ntfs_inode *ni, ntfs_inode *dir_ni) +{ + int res; + + res = ntfs_inode_sync_in_dir(ni, dir_ni); + if (res) { + if (errno != EIO) + errno = EBUSY; + } else + res = ntfs_inode_close(ni); + return (res); +} + +/** + * ntfs_inode_add_attrlist - add attribute list to inode and fill it + * @ni: opened ntfs inode to which add attribute list + * + * Return 0 on success or -1 on error with errno set to the error code. + * The following error codes are defined: + * EINVAL - Invalid arguments were passed to the function. + * EEXIST - Attribute list already exist. + * EIO - Input/Ouput error occurred. + * ENOMEM - Not enough memory to perform add. + */ +int ntfs_inode_add_attrlist(ntfs_inode *ni) +{ + int err; + ntfs_attr_search_ctx *ctx; + u8 *al = NULL, *aln; + int al_len = 0; + ATTR_LIST_ENTRY *ale = NULL; + ntfs_attr *na; + + if (!ni) { + errno = EINVAL; + ntfs_log_perror("%s", __FUNCTION__); + return -1; + } + + ntfs_log_trace("inode %llu\n", (unsigned long long) ni->mft_no); + + if (NInoAttrList(ni) || ni->nr_extents) { + errno = EEXIST; + ntfs_log_perror("Inode already has attribute list"); + return -1; + } + + /* Form attribute list. */ + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) { + err = errno; + goto err_out; + } + /* Walk through all attributes. */ + while (!ntfs_attr_lookup(AT_UNUSED, NULL, 0, 0, 0, NULL, 0, ctx)) { + + int ale_size; + + if (ctx->attr->type == AT_ATTRIBUTE_LIST) { + err = EIO; + ntfs_log_perror("Attribute list already present"); + goto put_err_out; + } + + ale_size = (sizeof(ATTR_LIST_ENTRY) + sizeof(ntfschar) * + ctx->attr->name_length + 7) & ~7; + al_len += ale_size; + + aln = MEM2_realloc(al, al_len); + if (!aln) { + err = errno; + ntfs_log_perror("Failed to realloc %d bytes", al_len); + goto put_err_out; + } + ale = (ATTR_LIST_ENTRY *)(aln + ((u8 *)ale - al)); + al = aln; + + memset(ale, 0, ale_size); + + /* Add attribute to attribute list. */ + ale->type = ctx->attr->type; + ale->length = cpu_to_le16((sizeof(ATTR_LIST_ENTRY) + + sizeof(ntfschar) * ctx->attr->name_length + 7) & ~7); + ale->name_length = ctx->attr->name_length; + ale->name_offset = (u8 *)ale->name - (u8 *)ale; + if (ctx->attr->non_resident) + ale->lowest_vcn = ctx->attr->lowest_vcn; + else + ale->lowest_vcn = 0; + ale->mft_reference = MK_LE_MREF(ni->mft_no, + le16_to_cpu(ni->mrec->sequence_number)); + ale->instance = ctx->attr->instance; + memcpy(ale->name, (u8 *)ctx->attr + + le16_to_cpu(ctx->attr->name_offset), + ctx->attr->name_length * sizeof(ntfschar)); + ale = (ATTR_LIST_ENTRY *)(al + al_len); + } + /* Check for real error occurred. */ + if (errno != ENOENT) { + err = errno; + ntfs_log_perror("%s: Attribute lookup failed, inode %lld", + __FUNCTION__, (long long)ni->mft_no); + goto put_err_out; + } + + /* Set in-memory attribute list. */ + ni->attr_list = al; + ni->attr_list_size = al_len; + NInoSetAttrList(ni); + NInoAttrListSetDirty(ni); + + /* Free space if there is not enough it for $ATTRIBUTE_LIST. */ + if (le32_to_cpu(ni->mrec->bytes_allocated) - + le32_to_cpu(ni->mrec->bytes_in_use) < + offsetof(ATTR_RECORD, resident_end)) { + if (ntfs_inode_free_space(ni, + offsetof(ATTR_RECORD, resident_end))) { + /* Failed to free space. */ + err = errno; + ntfs_log_perror("Failed to free space for attrlist"); + goto rollback; + } + } + + /* Add $ATTRIBUTE_LIST to mft record. */ + if (ntfs_resident_attr_record_add(ni, + AT_ATTRIBUTE_LIST, NULL, 0, NULL, 0, 0) < 0) { + err = errno; + ntfs_log_perror("Couldn't add $ATTRIBUTE_LIST to MFT"); + goto rollback; + } + + /* Resize it. */ + na = ntfs_attr_open(ni, AT_ATTRIBUTE_LIST, AT_UNNAMED, 0); + if (!na) { + err = errno; + ntfs_log_perror("Failed to open just added $ATTRIBUTE_LIST"); + goto remove_attrlist_record; + } + if (ntfs_attr_truncate(na, al_len)) { + err = errno; + ntfs_log_perror("Failed to resize just added $ATTRIBUTE_LIST"); + ntfs_attr_close(na); + goto remove_attrlist_record;; + } + + ntfs_attr_put_search_ctx(ctx); + ntfs_attr_close(na); + return 0; + +remove_attrlist_record: + /* Prevent ntfs_attr_recorm_rm from freeing attribute list. */ + ni->attr_list = NULL; + NInoClearAttrList(ni); + /* Remove $ATTRIBUTE_LIST record. */ + ntfs_attr_reinit_search_ctx(ctx); + if (!ntfs_attr_lookup(AT_ATTRIBUTE_LIST, NULL, 0, + CASE_SENSITIVE, 0, NULL, 0, ctx)) { + if (ntfs_attr_record_rm(ctx)) + ntfs_log_perror("Rollback failed to remove attrlist"); + } else + ntfs_log_perror("Rollback failed to find attrlist"); + /* Setup back in-memory runlist. */ + ni->attr_list = al; + ni->attr_list_size = al_len; + NInoSetAttrList(ni); +rollback: + /* + * Scan attribute list for attributes that placed not in the base MFT + * record and move them to it. + */ + ntfs_attr_reinit_search_ctx(ctx); + ale = (ATTR_LIST_ENTRY*)al; + while ((u8*)ale < al + al_len) { + if (MREF_LE(ale->mft_reference) != ni->mft_no) { + if (!ntfs_attr_lookup(ale->type, ale->name, + ale->name_length, + CASE_SENSITIVE, + sle64_to_cpu(ale->lowest_vcn), + NULL, 0, ctx)) { + if (ntfs_attr_record_move_to(ctx, ni)) + ntfs_log_perror("Rollback failed to " + "move attribute"); + } else + ntfs_log_perror("Rollback failed to find attr"); + ntfs_attr_reinit_search_ctx(ctx); + } + ale = (ATTR_LIST_ENTRY*)((u8*)ale + le16_to_cpu(ale->length)); + } + /* Remove in-memory attribute list. */ + ni->attr_list = NULL; + ni->attr_list_size = 0; + NInoClearAttrList(ni); + NInoAttrListClearDirty(ni); +put_err_out: + ntfs_attr_put_search_ctx(ctx); +err_out: + free(al); + errno = err; + return -1; +} + +/** + * ntfs_inode_free_space - free space in the MFT record of an inode + * @ni: ntfs inode in which MFT record needs more free space + * @size: amount of space needed to free + * + * Return 0 on success or -1 on error with errno set to the error code. + */ +int ntfs_inode_free_space(ntfs_inode *ni, int size) +{ + ntfs_attr_search_ctx *ctx; + int freed; + + if (!ni || size < 0) { + errno = EINVAL; + ntfs_log_perror("%s: ni=%p size=%d", __FUNCTION__, ni, size); + return -1; + } + + ntfs_log_trace("Entering for inode %lld, size %d\n", + (unsigned long long)ni->mft_no, size); + + freed = (le32_to_cpu(ni->mrec->bytes_allocated) - + le32_to_cpu(ni->mrec->bytes_in_use)); + + if (size <= freed) + return 0; + + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (!ctx) + return -1; + /* + * $STANDARD_INFORMATION and $ATTRIBUTE_LIST must stay in the base MFT + * record, so position search context on the first attribute after them. + */ + if (ntfs_attr_position(AT_FILE_NAME, ctx)) + goto put_err_out; + + while (1) { + int record_size; + /* + * Check whether attribute is from different MFT record. If so, + * find next, because we don't need such. + */ + while (ctx->ntfs_ino->mft_no != ni->mft_no) { +retry: + if (ntfs_attr_position(AT_UNUSED, ctx)) + goto put_err_out; + } + + if (ntfs_inode_base(ctx->ntfs_ino)->mft_no == FILE_MFT && + ctx->attr->type == AT_DATA) + goto retry; + + if (ctx->attr->type == AT_INDEX_ROOT) + goto retry; + + record_size = le32_to_cpu(ctx->attr->length); + + if (ntfs_attr_record_move_away(ctx, 0)) { + ntfs_log_perror("Failed to move out attribute #2"); + break; + } + freed += record_size; + + /* Check whether we are done. */ + if (size <= freed) { + ntfs_attr_put_search_ctx(ctx); + return 0; + } + /* + * Reposition to first attribute after $STANDARD_INFORMATION + * and $ATTRIBUTE_LIST instead of simply skipping this attribute + * because in the case when we have got only in-memory attribute + * list then ntfs_attr_lookup will fail when it tries to find + * $ATTRIBUTE_LIST. + */ + ntfs_attr_reinit_search_ctx(ctx); + if (ntfs_attr_position(AT_FILE_NAME, ctx)) + break; + } +put_err_out: + ntfs_attr_put_search_ctx(ctx); + if (errno == ENOSPC) + ntfs_log_trace("No attributes left that could be moved out.\n"); + return -1; +} + +/** + * ntfs_inode_update_times - update selected time fields for ntfs inode + * @ni: ntfs inode for which update time fields + * @mask: select which time fields should be updated + * + * This function updates time fields to current time. Fields to update are + * selected using @mask (see enum @ntfs_time_update_flags for posssible values). + */ +void ntfs_inode_update_times(ntfs_inode *ni, ntfs_time_update_flags mask) +{ + ntfs_time now; + + if (!ni) { + ntfs_log_error("%s(): Invalid arguments.\n", __FUNCTION__); + return; + } + + if ((ni->mft_no < FILE_first_user && ni->mft_no != FILE_root) || + NVolReadOnly(ni->vol) || !mask) + return; + + now = ntfs_current_time(); + if (mask & NTFS_UPDATE_ATIME) + ni->last_access_time = now; + if (mask & NTFS_UPDATE_MTIME) + ni->last_data_change_time = now; + if (mask & NTFS_UPDATE_CTIME) + ni->last_mft_change_time = now; + + NInoFileNameSetDirty(ni); + NInoSetDirty(ni); +} + +/** + * ntfs_inode_badclus_bad - check for $Badclus:$Bad data attribute + * @mft_no: mft record number where @attr is present + * @attr: attribute record used to check for the $Bad attribute + * + * Check if the mft record given by @mft_no and @attr contains the bad sector + * list. Please note that mft record numbers describing $Badclus extent inodes + * will not match the current $Badclus:$Bad check. + * + * On success return 1 if the file is $Badclus:$Bad, otherwise return 0. + * On error return -1 with errno set to the error code. + */ +int ntfs_inode_badclus_bad(u64 mft_no, ATTR_RECORD *attr) +{ + int len, ret = 0; + ntfschar *ustr; + + if (!attr) { + ntfs_log_error("Invalid argument.\n"); + errno = EINVAL; + return -1; + } + + if (mft_no != FILE_BadClus) + return 0; + + if (attr->type != AT_DATA) + return 0; + + if ((ustr = ntfs_str2ucs("$Bad", &len)) == NULL) { + ntfs_log_perror("Couldn't convert '$Bad' to Unicode"); + return -1; + } + + if (ustr && ntfs_names_are_equal(ustr, len, + (ntfschar *)((u8 *)attr + le16_to_cpu(attr->name_offset)), + attr->name_length, 0, NULL, 0)) + ret = 1; + + ntfs_ucsfree(ustr); + + return ret; +} + +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +/* + * Get high precision NTFS times + * + * They are returned in following order : create, update, access, change + * provided they fit in requested size. + * + * Returns the modified size if successfull (or 32 if buffer size is null) + * -errno if failed + */ + +int ntfs_inode_get_times(ntfs_inode *ni, char *value, size_t size) +{ + ntfs_attr_search_ctx *ctx; + STANDARD_INFORMATION *std_info; + u64 *times; + int ret; + + ret = 0; + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (ctx) { + if (ntfs_attr_lookup(AT_STANDARD_INFORMATION, AT_UNNAMED, + 0, CASE_SENSITIVE, 0, NULL, 0, ctx)) { + ntfs_log_perror("Failed to get standard info (inode %lld)", + (long long)ni->mft_no); + } else { + std_info = (STANDARD_INFORMATION *)((u8 *)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + if (value && (size >= 8)) { + times = (u64*)value; + times[0] = le64_to_cpu(std_info->creation_time); + ret = 8; + if (size >= 16) { + times[1] = le64_to_cpu(std_info->last_data_change_time); + ret = 16; + } + if (size >= 24) { + times[2] = le64_to_cpu(std_info->last_access_time); + ret = 24; + } + if (size >= 32) { + times[3] = le64_to_cpu(std_info->last_mft_change_time); + ret = 32; + } + } else + if (!size) + ret = 32; + else + ret = -ERANGE; + } + ntfs_attr_put_search_ctx(ctx); + } + return (ret ? ret : -errno); +} + +/* + * Set high precision NTFS times + * + * They are expected in this order : create, update, access + * provided they are present in input. The change time is set to + * current time. + * + * The times are inserted directly in the standard_information and + * file names attributes to avoid manipulating low precision times + * + * Returns 0 if success + * -1 if there were an error (described by errno) + */ + +int ntfs_inode_set_times(ntfs_inode *ni, const char *value, size_t size, + int flags) +{ + ntfs_attr_search_ctx *ctx; + STANDARD_INFORMATION *std_info; + FILE_NAME_ATTR *fn; + const u64 *times; + ntfs_time now; + int cnt; + int ret; + + ret = -1; + if ((size >= 8) && !(flags & XATTR_CREATE)) { + times = (const u64*)value; + now = ntfs_current_time(); + /* update the standard information attribute */ + ctx = ntfs_attr_get_search_ctx(ni, NULL); + if (ctx) { + if (ntfs_attr_lookup(AT_STANDARD_INFORMATION, + AT_UNNAMED, 0, CASE_SENSITIVE, + 0, NULL, 0, ctx)) { + ntfs_log_perror("Failed to get standard info (inode %lld)", + (long long)ni->mft_no); + } else { + std_info = (STANDARD_INFORMATION *)((u8 *)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + /* + * Mark times set to avoid overwriting + * them when the inode is closed. + * The inode structure must also be updated + * (with loss of precision) because of cacheing. + * TODO : use NTFS precision in inode, and + * return sub-second times in getattr() + */ + set_nino_flag(ni, TimesSet); + std_info->creation_time = cpu_to_le64(times[0]); + ni->creation_time + = std_info->creation_time; + if (size >= 16) { + std_info->last_data_change_time = cpu_to_le64(times[1]); + ni->last_data_change_time + = std_info->last_data_change_time; + } + if (size >= 24) { + std_info->last_access_time = cpu_to_le64(times[2]); + ni->last_access_time + = std_info->last_access_time; + } + std_info->last_mft_change_time = now; + ni->last_mft_change_time = now; + ntfs_inode_mark_dirty(ctx->ntfs_ino); + NInoFileNameSetDirty(ni); + + /* update the file names attributes */ + ntfs_attr_reinit_search_ctx(ctx); + cnt = 0; + while (!ntfs_attr_lookup(AT_FILE_NAME, + AT_UNNAMED, 0, CASE_SENSITIVE, + 0, NULL, 0, ctx)) { + fn = (FILE_NAME_ATTR*)((u8 *)ctx->attr + + le16_to_cpu(ctx->attr->value_offset)); + fn->creation_time + = cpu_to_le64(times[0]); + if (size >= 16) + fn->last_data_change_time + = cpu_to_le64(times[1]); + if (size >= 24) + fn->last_access_time + = cpu_to_le64(times[2]); + fn->last_mft_change_time = now; + cnt++; + } + if (cnt) + ret = 0; + else { + ntfs_log_perror("Failed to get file names (inode %lld)", + (long long)ni->mft_no); + } + } + ntfs_attr_put_search_ctx(ctx); + } + } else + if (size < 8) + errno = ERANGE; + else + errno = EEXIST; + return (ret); +} + +#endif /* HAVE_SETXATTR */ diff --git a/portlibs/sources/libntfs/inode.h b/portlibs/sources/libntfs/inode.h new file mode 100644 index 00000000..5a6f7da6 --- /dev/null +++ b/portlibs/sources/libntfs/inode.h @@ -0,0 +1,225 @@ +/* + * inode.h - Defines for NTFS inode handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2001-2004 Anton Altaparmakov + * Copyright (c) 2004-2007 Yura Pakhuchiy + * Copyright (c) 2004-2005 Richard Russon + * Copyright (c) 2006-2008 Szabolcs Szakacsits + * + * 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 + */ + +#ifndef _NTFS_INODE_H +#define _NTFS_INODE_H + +/* Forward declaration */ +typedef struct _ntfs_inode ntfs_inode; + +#include "types.h" +#include "layout.h" +#include "support.h" +#include "volume.h" +#include "ntfstime.h" + +/** + * enum ntfs_inode_state_bits - + * + * Defined bits for the state field in the ntfs_inode structure. + * (f) = files only, (d) = directories only + */ +typedef enum { + NI_Dirty, /* 1: Mft record needs to be written to disk. */ + + /* The NI_AttrList* tests only make sense for base inodes. */ + NI_AttrList, /* 1: Mft record contains an attribute list. */ + NI_AttrListDirty, /* 1: Attribute list needs to be written to the + mft record and then to disk. */ + NI_FileNameDirty, /* 1: FILE_NAME attributes need to be updated + in the index. */ + NI_v3_Extensions, /* 1: JPA v3.x extensions present. */ + NI_TimesSet, /* 1: Use times which were set */ + NI_KnownSize, /* 1: Set if sizes are meaningful */ +} ntfs_inode_state_bits; + +#define test_nino_flag(ni, flag) test_bit(NI_##flag, (ni)->state) +#define set_nino_flag(ni, flag) set_bit(NI_##flag, (ni)->state) +#define clear_nino_flag(ni, flag) clear_bit(NI_##flag, (ni)->state) + +#define test_and_set_nino_flag(ni, flag) \ + test_and_set_bit(NI_##flag, (ni)->state) +#define test_and_clear_nino_flag(ni, flag) \ + test_and_clear_bit(NI_##flag, (ni)->state) + +#define NInoDirty(ni) test_nino_flag(ni, Dirty) +#define NInoSetDirty(ni) set_nino_flag(ni, Dirty) +#define NInoClearDirty(ni) clear_nino_flag(ni, Dirty) +#define NInoTestAndSetDirty(ni) test_and_set_nino_flag(ni, Dirty) +#define NInoTestAndClearDirty(ni) test_and_clear_nino_flag(ni, Dirty) + +#define NInoAttrList(ni) test_nino_flag(ni, AttrList) +#define NInoSetAttrList(ni) set_nino_flag(ni, AttrList) +#define NInoClearAttrList(ni) clear_nino_flag(ni, AttrList) + + +#define test_nino_al_flag(ni, flag) test_nino_flag(ni, AttrList##flag) +#define set_nino_al_flag(ni, flag) set_nino_flag(ni, AttrList##flag) +#define clear_nino_al_flag(ni, flag) clear_nino_flag(ni, AttrList##flag) + +#define test_and_set_nino_al_flag(ni, flag) \ + test_and_set_nino_flag(ni, AttrList##flag) +#define test_and_clear_nino_al_flag(ni, flag) \ + test_and_clear_nino_flag(ni, AttrList##flag) + +#define NInoAttrListDirty(ni) test_nino_al_flag(ni, Dirty) +#define NInoAttrListSetDirty(ni) set_nino_al_flag(ni, Dirty) +#define NInoAttrListClearDirty(ni) clear_nino_al_flag(ni, Dirty) +#define NInoAttrListTestAndSetDirty(ni) test_and_set_nino_al_flag(ni, Dirty) +#define NInoAttrListTestAndClearDirty(ni) test_and_clear_nino_al_flag(ni, Dirty) + +#define NInoFileNameDirty(ni) test_nino_flag(ni, FileNameDirty) +#define NInoFileNameSetDirty(ni) set_nino_flag(ni, FileNameDirty) +#define NInoFileNameClearDirty(ni) clear_nino_flag(ni, FileNameDirty) +#define NInoFileNameTestAndSetDirty(ni) \ + test_and_set_nino_flag(ni, FileNameDirty) +#define NInoFileNameTestAndClearDirty(ni) \ + test_and_clear_nino_flag(ni, FileNameDirty) + +/** + * struct _ntfs_inode - The NTFS in-memory inode structure. + * + * It is just used as an extension to the fields already provided in the VFS + * inode. + */ +struct _ntfs_inode { + u64 mft_no; /* Inode / mft record number. */ + MFT_RECORD *mrec; /* The actual mft record of the inode. */ + ntfs_volume *vol; /* Pointer to the ntfs volume of this inode. */ + unsigned long state; /* NTFS specific flags describing this inode. + See ntfs_inode_state_bits above. */ + FILE_ATTR_FLAGS flags; /* Flags describing the file. + (Copy from STANDARD_INFORMATION) */ + /* + * Attribute list support (for use by the attribute lookup functions). + * Setup during ntfs_open_inode() for all inodes with attribute lists. + * Only valid if NI_AttrList is set in state. + */ + u32 attr_list_size; /* Length of attribute list value in bytes. */ + u8 *attr_list; /* Attribute list value itself. */ + /* Below fields are always valid. */ + s32 nr_extents; /* For a base mft record, the number of + attached extent inodes (0 if none), for + extent records this is -1. */ + union { /* This union is only used if nr_extents != 0. */ + ntfs_inode **extent_nis;/* For nr_extents > 0, array of the + ntfs inodes of the extent mft + records belonging to this base + inode which have been loaded. */ + ntfs_inode *base_ni; /* For nr_extents == -1, the ntfs + inode of the base mft record. */ + }; + + /* Below fields are valid only for base inode. */ + + /* + * These two fields are used to sync filename index and guaranteed to be + * correct, however value in index itself maybe wrong (windows itself + * do not update them properly). + * For directories, they hold the index size, provided the + * flag KnownSize is set. + */ + s64 data_size; /* Data size of unnamed DATA attribute + (or INDEX_ROOT for directories) */ + s64 allocated_size; /* Allocated size stored in the filename + index. (NOTE: Equal to allocated size of + the unnamed data attribute for normal or + encrypted files and to compressed size + of the unnamed data attribute for sparse or + compressed files.) */ + + /* + * These four fields are copy of relevant fields from + * STANDARD_INFORMATION attribute and used to sync it and FILE_NAME + * attribute in the index. + */ + ntfs_time creation_time; + ntfs_time last_data_change_time; + ntfs_time last_mft_change_time; + ntfs_time last_access_time; + /* NTFS 3.x extensions added by JPA */ + /* only if NI_v3_Extensions is set in state */ + le32 owner_id; + le32 security_id; + le64 quota_charged; + le64 usn; +}; + +typedef enum { + NTFS_UPDATE_ATIME = 1 << 0, + NTFS_UPDATE_MTIME = 1 << 1, + NTFS_UPDATE_CTIME = 1 << 2, +} ntfs_time_update_flags; + +#define NTFS_UPDATE_MCTIME (NTFS_UPDATE_MTIME | NTFS_UPDATE_CTIME) +#define NTFS_UPDATE_AMCTIME (NTFS_UPDATE_ATIME | NTFS_UPDATE_MCTIME) + +extern ntfs_inode *ntfs_inode_base(ntfs_inode *ni); + +extern ntfs_inode *ntfs_inode_allocate(ntfs_volume *vol); + +extern ntfs_inode *ntfs_inode_open(ntfs_volume *vol, const MFT_REF mref); + +extern int ntfs_inode_close(ntfs_inode *ni); +extern int ntfs_inode_close_in_dir(ntfs_inode *ni, ntfs_inode *dir_ni); + +#if CACHE_NIDATA_SIZE + +struct CACHED_GENERIC; + +extern int ntfs_inode_real_close(ntfs_inode *ni); +extern void ntfs_inode_invalidate(ntfs_volume *vol, const MFT_REF mref); +extern void ntfs_inode_nidata_free(const struct CACHED_GENERIC *cached); +extern int ntfs_inode_nidata_hash(const struct CACHED_GENERIC *item); + +#endif + + +extern ntfs_inode *ntfs_extent_inode_open(ntfs_inode *base_ni, + const MFT_REF mref); + +extern int ntfs_inode_attach_all_extents(ntfs_inode *ni); + +extern void ntfs_inode_mark_dirty(ntfs_inode *ni); + +extern void ntfs_inode_update_times(ntfs_inode *ni, ntfs_time_update_flags mask); + +extern int ntfs_inode_sync(ntfs_inode *ni); + +extern int ntfs_inode_add_attrlist(ntfs_inode *ni); + +extern int ntfs_inode_free_space(ntfs_inode *ni, int size); + +extern int ntfs_inode_badclus_bad(u64 mft_no, ATTR_RECORD *a); + +extern int ntfs_inode_get_times(ntfs_inode *ni, char *value, size_t size); + +extern int ntfs_inode_set_times(ntfs_inode *ni, const char *value, + size_t size, int flags); + +/* debugging */ +#define debug_double_inode(num, type) +#define debug_cached_inode(ni) + +#endif /* defined _NTFS_INODE_H */ diff --git a/portlibs/sources/libntfs/layout.h b/portlibs/sources/libntfs/layout.h new file mode 100644 index 00000000..daff97d1 --- /dev/null +++ b/portlibs/sources/libntfs/layout.h @@ -0,0 +1,2662 @@ +/* + * layout.h - Ntfs on-disk layout structures. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2005 Anton Altaparmakov + * Copyright (c) 2005 Yura Pakhuchiy + * Copyright (c) 2005-2006 Szabolcs Szakacsits + * + * 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 + */ + +#ifndef _NTFS_LAYOUT_H +#define _NTFS_LAYOUT_H + +#include "types.h" +#include "endians.h" +#include "support.h" + +/* The NTFS oem_id */ +#define magicNTFS const_cpu_to_le64(0x202020205346544e) /* "NTFS " */ +#define NTFS_SB_MAGIC 0x5346544e /* 'NTFS' */ + +/* + * Location of bootsector on partition: + * The standard NTFS_BOOT_SECTOR is on sector 0 of the partition. + * On NT4 and above there is one backup copy of the boot sector to + * be found on the last sector of the partition (not normally accessible + * from within Windows as the bootsector contained number of sectors + * value is one less than the actual value!). + * On versions of NT 3.51 and earlier, the backup copy was located at + * number of sectors/2 (integer divide), i.e. in the middle of the volume. + */ + +/** + * struct BIOS_PARAMETER_BLOCK - BIOS parameter block (bpb) structure. + */ +typedef struct { + u16 bytes_per_sector; /* Size of a sector in bytes. */ + u8 sectors_per_cluster; /* Size of a cluster in sectors. */ + u16 reserved_sectors; /* zero */ + u8 fats; /* zero */ + u16 root_entries; /* zero */ + u16 sectors; /* zero */ + u8 media_type; /* 0xf8 = hard disk */ + u16 sectors_per_fat; /* zero */ +/*0x0d*/u16 sectors_per_track; /* Required to boot Windows. */ +/*0x0f*/u16 heads; /* Required to boot Windows. */ +/*0x11*/u32 hidden_sectors; /* Offset to the start of the partition + relative to the disk in sectors. + Required to boot Windows. */ +/*0x15*/u32 large_sectors; /* zero */ +/* sizeof() = 25 (0x19) bytes */ +} __attribute__((__packed__)) BIOS_PARAMETER_BLOCK; + +/** + * struct NTFS_BOOT_SECTOR - NTFS boot sector structure. + */ +typedef struct { + u8 jump[3]; /* Irrelevant (jump to boot up code).*/ + u64 oem_id; /* Magic "NTFS ". */ +/*0x0b*/BIOS_PARAMETER_BLOCK bpb; /* See BIOS_PARAMETER_BLOCK. */ + u8 physical_drive; /* 0x00 floppy, 0x80 hard disk */ + u8 current_head; /* zero */ + u8 extended_boot_signature; /* 0x80 */ + u8 reserved2; /* zero */ +/*0x28*/s64 number_of_sectors; /* Number of sectors in volume. Gives + maximum volume size of 2^63 sectors. + Assuming standard sector size of 512 + bytes, the maximum byte size is + approx. 4.7x10^21 bytes. (-; */ + s64 mft_lcn; /* Cluster location of mft data. */ + s64 mftmirr_lcn; /* Cluster location of copy of mft. */ + s8 clusters_per_mft_record; /* Mft record size in clusters. */ + u8 reserved0[3]; /* zero */ + s8 clusters_per_index_record; /* Index block size in clusters. */ + u8 reserved1[3]; /* zero */ + u64 volume_serial_number; /* Irrelevant (serial number). */ + u32 checksum; /* Boot sector checksum. */ +/*0x54*/u8 bootstrap[426]; /* Irrelevant (boot up code). */ + u16 end_of_sector_marker; /* End of bootsector magic. Always is + 0xaa55 in little endian. */ +/* sizeof() = 512 (0x200) bytes */ +} __attribute__((__packed__)) NTFS_BOOT_SECTOR; + +/** + * enum NTFS_RECORD_TYPES - + * + * Magic identifiers present at the beginning of all ntfs record containing + * records (like mft records for example). + */ +typedef enum { + /* Found in $MFT/$DATA. */ + magic_FILE = const_cpu_to_le32(0x454c4946), /* Mft entry. */ + magic_INDX = const_cpu_to_le32(0x58444e49), /* Index buffer. */ + magic_HOLE = const_cpu_to_le32(0x454c4f48), /* ? (NTFS 3.0+?) */ + + /* Found in $LogFile/$DATA. */ + magic_RSTR = const_cpu_to_le32(0x52545352), /* Restart page. */ + magic_RCRD = const_cpu_to_le32(0x44524352), /* Log record page. */ + + /* Found in $LogFile/$DATA. (May be found in $MFT/$DATA, also?) */ + magic_CHKD = const_cpu_to_le32(0x444b4843), /* Modified by chkdsk. */ + + /* Found in all ntfs record containing records. */ + magic_BAAD = const_cpu_to_le32(0x44414142), /* Failed multi sector + transfer was detected. */ + + /* + * Found in $LogFile/$DATA when a page is full or 0xff bytes and is + * thus not initialized. User has to initialize the page before using + * it. + */ + magic_empty = const_cpu_to_le32(0xffffffff),/* Record is empty and has + to be initialized before + it can be used. */ +} NTFS_RECORD_TYPES; + +/* + * Generic magic comparison macros. Finally found a use for the ## preprocessor + * operator! (-8 + */ +#define ntfs_is_magic(x, m) ( (u32)(x) == (u32)magic_##m ) +#define ntfs_is_magicp(p, m) ( *(u32*)(p) == (u32)magic_##m ) + +/* + * Specialised magic comparison macros for the NTFS_RECORD_TYPES defined above. + */ +#define ntfs_is_file_record(x) ( ntfs_is_magic (x, FILE) ) +#define ntfs_is_file_recordp(p) ( ntfs_is_magicp(p, FILE) ) +#define ntfs_is_mft_record(x) ( ntfs_is_file_record(x) ) +#define ntfs_is_mft_recordp(p) ( ntfs_is_file_recordp(p) ) +#define ntfs_is_indx_record(x) ( ntfs_is_magic (x, INDX) ) +#define ntfs_is_indx_recordp(p) ( ntfs_is_magicp(p, INDX) ) +#define ntfs_is_hole_record(x) ( ntfs_is_magic (x, HOLE) ) +#define ntfs_is_hole_recordp(p) ( ntfs_is_magicp(p, HOLE) ) + +#define ntfs_is_rstr_record(x) ( ntfs_is_magic (x, RSTR) ) +#define ntfs_is_rstr_recordp(p) ( ntfs_is_magicp(p, RSTR) ) +#define ntfs_is_rcrd_record(x) ( ntfs_is_magic (x, RCRD) ) +#define ntfs_is_rcrd_recordp(p) ( ntfs_is_magicp(p, RCRD) ) + +#define ntfs_is_chkd_record(x) ( ntfs_is_magic (x, CHKD) ) +#define ntfs_is_chkd_recordp(p) ( ntfs_is_magicp(p, CHKD) ) + +#define ntfs_is_baad_record(x) ( ntfs_is_magic (x, BAAD) ) +#define ntfs_is_baad_recordp(p) ( ntfs_is_magicp(p, BAAD) ) + +#define ntfs_is_empty_record(x) ( ntfs_is_magic (x, empty) ) +#define ntfs_is_empty_recordp(p) ( ntfs_is_magicp(p, empty) ) + + +#define NTFS_BLOCK_SIZE 512 +#define NTFS_BLOCK_SIZE_BITS 9 + +/** + * struct NTFS_RECORD - + * + * The Update Sequence Array (usa) is an array of the u16 values which belong + * to the end of each sector protected by the update sequence record in which + * this array is contained. Note that the first entry is the Update Sequence + * Number (usn), a cyclic counter of how many times the protected record has + * been written to disk. The values 0 and -1 (ie. 0xffff) are not used. All + * last u16's of each sector have to be equal to the usn (during reading) or + * are set to it (during writing). If they are not, an incomplete multi sector + * transfer has occurred when the data was written. + * The maximum size for the update sequence array is fixed to: + * maximum size = usa_ofs + (usa_count * 2) = 510 bytes + * The 510 bytes comes from the fact that the last u16 in the array has to + * (obviously) finish before the last u16 of the first 512-byte sector. + * This formula can be used as a consistency check in that usa_ofs + + * (usa_count * 2) has to be less than or equal to 510. + */ +typedef struct { + NTFS_RECORD_TYPES magic;/* A four-byte magic identifying the + record type and/or status. */ + u16 usa_ofs; /* Offset to the Update Sequence Array (usa) + from the start of the ntfs record. */ + u16 usa_count; /* Number of u16 sized entries in the usa + including the Update Sequence Number (usn), + thus the number of fixups is the usa_count + minus 1. */ +} __attribute__((__packed__)) NTFS_RECORD; + +/** + * enum NTFS_SYSTEM_FILES - System files mft record numbers. + * + * All these files are always marked as used in the bitmap attribute of the + * mft; presumably in order to avoid accidental allocation for random other + * mft records. Also, the sequence number for each of the system files is + * always equal to their mft record number and it is never modified. + */ +typedef enum { + FILE_MFT = 0, /* Master file table (mft). Data attribute + contains the entries and bitmap attribute + records which ones are in use (bit==1). */ + FILE_MFTMirr = 1, /* Mft mirror: copy of first four mft records + in data attribute. If cluster size > 4kiB, + copy of first N mft records, with + N = cluster_size / mft_record_size. */ + FILE_LogFile = 2, /* Journalling log in data attribute. */ + FILE_Volume = 3, /* Volume name attribute and volume information + attribute (flags and ntfs version). Windows + refers to this file as volume DASD (Direct + Access Storage Device). */ + FILE_AttrDef = 4, /* Array of attribute definitions in data + attribute. */ + FILE_root = 5, /* Root directory. */ + FILE_Bitmap = 6, /* Allocation bitmap of all clusters (lcns) in + data attribute. */ + FILE_Boot = 7, /* Boot sector (always at cluster 0) in data + attribute. */ + FILE_BadClus = 8, /* Contains all bad clusters in the non-resident + data attribute. */ + FILE_Secure = 9, /* Shared security descriptors in data attribute + and two indexes into the descriptors. + Appeared in Windows 2000. Before that, this + file was named $Quota but was unused. */ + FILE_UpCase = 10, /* Uppercase equivalents of all 65536 Unicode + characters in data attribute. */ + FILE_Extend = 11, /* Directory containing other system files (eg. + $ObjId, $Quota, $Reparse and $UsnJrnl). This + is new to NTFS3.0. */ + FILE_reserved12 = 12, /* Reserved for future use (records 12-15). */ + FILE_reserved13 = 13, + FILE_reserved14 = 14, + FILE_reserved15 = 15, + FILE_first_user = 16, /* First user file, used as test limit for + whether to allow opening a file or not. */ +} NTFS_SYSTEM_FILES; + +/** + * enum MFT_RECORD_FLAGS - + * + * These are the so far known MFT_RECORD_* flags (16-bit) which contain + * information about the mft record in which they are present. + * + * MFT_RECORD_IS_4 exists on all $Extend sub-files. + * It seems that it marks it is a metadata file with MFT record >24, however, + * it is unknown if it is limited to metadata files only. + * + * MFT_RECORD_IS_VIEW_INDEX exists on every metafile with a non directory + * index, that means an INDEX_ROOT and an INDEX_ALLOCATION with a name other + * than "$I30". It is unknown if it is limited to metadata files only. + */ +typedef enum { + MFT_RECORD_IN_USE = const_cpu_to_le16(0x0001), + MFT_RECORD_IS_DIRECTORY = const_cpu_to_le16(0x0002), + MFT_RECORD_IS_4 = const_cpu_to_le16(0x0004), + MFT_RECORD_IS_VIEW_INDEX = const_cpu_to_le16(0x0008), + MFT_REC_SPACE_FILLER = 0xffff, /* Just to make flags + 16-bit. */ +} __attribute__((__packed__)) MFT_RECORD_FLAGS; + +/* + * mft references (aka file references or file record segment references) are + * used whenever a structure needs to refer to a record in the mft. + * + * A reference consists of a 48-bit index into the mft and a 16-bit sequence + * number used to detect stale references. + * + * For error reporting purposes we treat the 48-bit index as a signed quantity. + * + * The sequence number is a circular counter (skipping 0) describing how many + * times the referenced mft record has been (re)used. This has to match the + * sequence number of the mft record being referenced, otherwise the reference + * is considered stale and removed (FIXME: only ntfsck or the driver itself?). + * + * If the sequence number is zero it is assumed that no sequence number + * consistency checking should be performed. + * + * FIXME: Since inodes are 32-bit as of now, the driver needs to always check + * for high_part being 0 and if not either BUG(), cause a panic() or handle + * the situation in some other way. This shouldn't be a problem as a volume has + * to become HUGE in order to need more than 32-bits worth of mft records. + * Assuming the standard mft record size of 1kb only the records (never mind + * the non-resident attributes, etc.) would require 4Tb of space on their own + * for the first 32 bits worth of records. This is only if some strange person + * doesn't decide to foul play and make the mft sparse which would be a really + * horrible thing to do as it would trash our current driver implementation. )-: + * Do I hear screams "we want 64-bit inodes!" ?!? (-; + * + * FIXME: The mft zone is defined as the first 12% of the volume. This space is + * reserved so that the mft can grow contiguously and hence doesn't become + * fragmented. Volume free space includes the empty part of the mft zone and + * when the volume's free 88% are used up, the mft zone is shrunk by a factor + * of 2, thus making more space available for more files/data. This process is + * repeated every time there is no more free space except for the mft zone until + * there really is no more free space. + */ + +/* + * Typedef the MFT_REF as a 64-bit value for easier handling. + * Also define two unpacking macros to get to the reference (MREF) and + * sequence number (MSEQNO) respectively. + * The _LE versions are to be applied on little endian MFT_REFs. + * Note: The _LE versions will return a CPU endian formatted value! + */ +#define MFT_REF_MASK_CPU 0x0000ffffffffffffULL +#define MFT_REF_MASK_LE const_cpu_to_le64(MFT_REF_MASK_CPU) + +typedef u64 MFT_REF; +typedef le64 leMFT_REF; /* a little-endian MFT_MREF */ + +#define MK_MREF(m, s) ((MFT_REF)(((MFT_REF)(s) << 48) | \ + ((MFT_REF)(m) & MFT_REF_MASK_CPU))) +#define MK_LE_MREF(m, s) const_cpu_to_le64(((MFT_REF)(((MFT_REF)(s) << 48) | \ + ((MFT_REF)(m) & MFT_REF_MASK_CPU)))) + +#define MREF(x) ((u64)((x) & MFT_REF_MASK_CPU)) +#define MSEQNO(x) ((u16)(((x) >> 48) & 0xffff)) +#define MREF_LE(x) ((u64)(const_le64_to_cpu(x) & MFT_REF_MASK_CPU)) +#define MSEQNO_LE(x) ((u16)((const_le64_to_cpu(x) >> 48) & 0xffff)) + +#define IS_ERR_MREF(x) (((x) & 0x0000800000000000ULL) ? 1 : 0) +#define ERR_MREF(x) ((u64)((s64)(x))) +#define MREF_ERR(x) ((int)((s64)(x))) + +/** + * struct MFT_RECORD - An MFT record layout (NTFS 3.1+) + * + * The mft record header present at the beginning of every record in the mft. + * This is followed by a sequence of variable length attribute records which + * is terminated by an attribute of type AT_END which is a truncated attribute + * in that it only consists of the attribute type code AT_END and none of the + * other members of the attribute structure are present. + */ +typedef struct { +/*Ofs*/ +/* 0 NTFS_RECORD; -- Unfolded here as gcc doesn't like unnamed structs. */ + NTFS_RECORD_TYPES magic;/* Usually the magic is "FILE". */ + u16 usa_ofs; /* See NTFS_RECORD definition above. */ + u16 usa_count; /* See NTFS_RECORD definition above. */ + +/* 8*/ LSN lsn; /* $LogFile sequence number for this record. + Changed every time the record is modified. */ +/* 16*/ u16 sequence_number; /* Number of times this mft record has been + reused. (See description for MFT_REF + above.) NOTE: The increment (skipping zero) + is done when the file is deleted. NOTE: If + this is zero it is left zero. */ +/* 18*/ u16 link_count; /* Number of hard links, i.e. the number of + directory entries referencing this record. + NOTE: Only used in mft base records. + NOTE: When deleting a directory entry we + check the link_count and if it is 1 we + delete the file. Otherwise we delete the + FILE_NAME_ATTR being referenced by the + directory entry from the mft record and + decrement the link_count. + FIXME: Careful with Win32 + DOS names! */ +/* 20*/ u16 attrs_offset; /* Byte offset to the first attribute in this + mft record from the start of the mft record. + NOTE: Must be aligned to 8-byte boundary. */ +/* 22*/ MFT_RECORD_FLAGS flags; /* Bit array of MFT_RECORD_FLAGS. When a file + is deleted, the MFT_RECORD_IN_USE flag is + set to zero. */ +/* 24*/ u32 bytes_in_use; /* Number of bytes used in this mft record. + NOTE: Must be aligned to 8-byte boundary. */ +/* 28*/ u32 bytes_allocated; /* Number of bytes allocated for this mft + record. This should be equal to the mft + record size. */ +/* 32*/ MFT_REF base_mft_record; /* This is zero for base mft records. + When it is not zero it is a mft reference + pointing to the base mft record to which + this record belongs (this is then used to + locate the attribute list attribute present + in the base record which describes this + extension record and hence might need + modification when the extension record + itself is modified, also locating the + attribute list also means finding the other + potential extents, belonging to the non-base + mft record). */ +/* 40*/ u16 next_attr_instance; /* The instance number that will be + assigned to the next attribute added to this + mft record. NOTE: Incremented each time + after it is used. NOTE: Every time the mft + record is reused this number is set to zero. + NOTE: The first instance number is always 0. + */ +/* The below fields are specific to NTFS 3.1+ (Windows XP and above): */ +/* 42*/ u16 reserved; /* Reserved/alignment. */ +/* 44*/ u32 mft_record_number; /* Number of this mft record. */ +/* sizeof() = 48 bytes */ +/* + * When (re)using the mft record, we place the update sequence array at this + * offset, i.e. before we start with the attributes. This also makes sense, + * otherwise we could run into problems with the update sequence array + * containing in itself the last two bytes of a sector which would mean that + * multi sector transfer protection wouldn't work. As you can't protect data + * by overwriting it since you then can't get it back... + * When reading we obviously use the data from the ntfs record header. + */ +} __attribute__((__packed__)) MFT_RECORD; + +/** + * struct MFT_RECORD_OLD - An MFT record layout (NTFS <=3.0) + * + * This is the version without the NTFS 3.1+ specific fields. + */ +typedef struct { +/*Ofs*/ +/* 0 NTFS_RECORD; -- Unfolded here as gcc doesn't like unnamed structs. */ + NTFS_RECORD_TYPES magic;/* Usually the magic is "FILE". */ + u16 usa_ofs; /* See NTFS_RECORD definition above. */ + u16 usa_count; /* See NTFS_RECORD definition above. */ + +/* 8*/ LSN lsn; /* $LogFile sequence number for this record. + Changed every time the record is modified. */ +/* 16*/ u16 sequence_number; /* Number of times this mft record has been + reused. (See description for MFT_REF + above.) NOTE: The increment (skipping zero) + is done when the file is deleted. NOTE: If + this is zero it is left zero. */ +/* 18*/ u16 link_count; /* Number of hard links, i.e. the number of + directory entries referencing this record. + NOTE: Only used in mft base records. + NOTE: When deleting a directory entry we + check the link_count and if it is 1 we + delete the file. Otherwise we delete the + FILE_NAME_ATTR being referenced by the + directory entry from the mft record and + decrement the link_count. + FIXME: Careful with Win32 + DOS names! */ +/* 20*/ u16 attrs_offset; /* Byte offset to the first attribute in this + mft record from the start of the mft record. + NOTE: Must be aligned to 8-byte boundary. */ +/* 22*/ MFT_RECORD_FLAGS flags; /* Bit array of MFT_RECORD_FLAGS. When a file + is deleted, the MFT_RECORD_IN_USE flag is + set to zero. */ +/* 24*/ u32 bytes_in_use; /* Number of bytes used in this mft record. + NOTE: Must be aligned to 8-byte boundary. */ +/* 28*/ u32 bytes_allocated; /* Number of bytes allocated for this mft + record. This should be equal to the mft + record size. */ +/* 32*/ MFT_REF base_mft_record; /* This is zero for base mft records. + When it is not zero it is a mft reference + pointing to the base mft record to which + this record belongs (this is then used to + locate the attribute list attribute present + in the base record which describes this + extension record and hence might need + modification when the extension record + itself is modified, also locating the + attribute list also means finding the other + potential extents, belonging to the non-base + mft record). */ +/* 40*/ u16 next_attr_instance; /* The instance number that will be + assigned to the next attribute added to this + mft record. NOTE: Incremented each time + after it is used. NOTE: Every time the mft + record is reused this number is set to zero. + NOTE: The first instance number is always 0. + */ +/* sizeof() = 42 bytes */ +/* + * When (re)using the mft record, we place the update sequence array at this + * offset, i.e. before we start with the attributes. This also makes sense, + * otherwise we could run into problems with the update sequence array + * containing in itself the last two bytes of a sector which would mean that + * multi sector transfer protection wouldn't work. As you can't protect data + * by overwriting it since you then can't get it back... + * When reading we obviously use the data from the ntfs record header. + */ +} __attribute__((__packed__)) MFT_RECORD_OLD; + +/** + * enum ATTR_TYPES - System defined attributes (32-bit). + * + * Each attribute type has a corresponding attribute name (Unicode string of + * maximum 64 character length) as described by the attribute definitions + * present in the data attribute of the $AttrDef system file. + * + * On NTFS 3.0 volumes the names are just as the types are named in the below + * enum exchanging AT_ for the dollar sign ($). If that isn't a revealing + * choice of symbol... (-; + */ +typedef enum { + AT_UNUSED = const_cpu_to_le32( 0), + AT_STANDARD_INFORMATION = const_cpu_to_le32( 0x10), + AT_ATTRIBUTE_LIST = const_cpu_to_le32( 0x20), + AT_FILE_NAME = const_cpu_to_le32( 0x30), + AT_OBJECT_ID = const_cpu_to_le32( 0x40), + AT_SECURITY_DESCRIPTOR = const_cpu_to_le32( 0x50), + AT_VOLUME_NAME = const_cpu_to_le32( 0x60), + AT_VOLUME_INFORMATION = const_cpu_to_le32( 0x70), + AT_DATA = const_cpu_to_le32( 0x80), + AT_INDEX_ROOT = const_cpu_to_le32( 0x90), + AT_INDEX_ALLOCATION = const_cpu_to_le32( 0xa0), + AT_BITMAP = const_cpu_to_le32( 0xb0), + AT_REPARSE_POINT = const_cpu_to_le32( 0xc0), + AT_EA_INFORMATION = const_cpu_to_le32( 0xd0), + AT_EA = const_cpu_to_le32( 0xe0), + AT_PROPERTY_SET = const_cpu_to_le32( 0xf0), + AT_LOGGED_UTILITY_STREAM = const_cpu_to_le32( 0x100), + AT_FIRST_USER_DEFINED_ATTRIBUTE = const_cpu_to_le32( 0x1000), + AT_END = const_cpu_to_le32(0xffffffff), +} ATTR_TYPES; + +/** + * enum COLLATION_RULES - The collation rules for sorting views/indexes/etc + * (32-bit). + * + * COLLATION_UNICODE_STRING - Collate Unicode strings by comparing their binary + * Unicode values, except that when a character can be uppercased, the + * upper case value collates before the lower case one. + * COLLATION_FILE_NAME - Collate file names as Unicode strings. The collation + * is done very much like COLLATION_UNICODE_STRING. In fact I have no idea + * what the difference is. Perhaps the difference is that file names + * would treat some special characters in an odd way (see + * unistr.c::ntfs_collate_names() and unistr.c::legal_ansi_char_array[] + * for what I mean but COLLATION_UNICODE_STRING would not give any special + * treatment to any characters at all, but this is speculation. + * COLLATION_NTOFS_ULONG - Sorting is done according to ascending u32 key + * values. E.g. used for $SII index in FILE_Secure, which sorts by + * security_id (u32). + * COLLATION_NTOFS_SID - Sorting is done according to ascending SID values. + * E.g. used for $O index in FILE_Extend/$Quota. + * COLLATION_NTOFS_SECURITY_HASH - Sorting is done first by ascending hash + * values and second by ascending security_id values. E.g. used for $SDH + * index in FILE_Secure. + * COLLATION_NTOFS_ULONGS - Sorting is done according to a sequence of ascending + * u32 key values. E.g. used for $O index in FILE_Extend/$ObjId, which + * sorts by object_id (16-byte), by splitting up the object_id in four + * u32 values and using them as individual keys. E.g. take the following + * two security_ids, stored as follows on disk: + * 1st: a1 61 65 b7 65 7b d4 11 9e 3d 00 e0 81 10 42 59 + * 2nd: 38 14 37 d2 d2 f3 d4 11 a5 21 c8 6b 79 b1 97 45 + * To compare them, they are split into four u32 values each, like so: + * 1st: 0xb76561a1 0x11d47b65 0xe0003d9e 0x59421081 + * 2nd: 0xd2371438 0x11d4f3d2 0x6bc821a5 0x4597b179 + * Now, it is apparent why the 2nd object_id collates after the 1st: the + * first u32 value of the 1st object_id is less than the first u32 of + * the 2nd object_id. If the first u32 values of both object_ids were + * equal then the second u32 values would be compared, etc. + */ +typedef enum { + COLLATION_BINARY = const_cpu_to_le32(0), /* Collate by binary + compare where the first byte is most + significant. */ + COLLATION_FILE_NAME = const_cpu_to_le32(1), /* Collate file names + as Unicode strings. */ + COLLATION_UNICODE_STRING = const_cpu_to_le32(2), /* Collate Unicode + strings by comparing their binary + Unicode values, except that when a + character can be uppercased, the upper + case value collates before the lower + case one. */ + COLLATION_NTOFS_ULONG = const_cpu_to_le32(16), + COLLATION_NTOFS_SID = const_cpu_to_le32(17), + COLLATION_NTOFS_SECURITY_HASH = const_cpu_to_le32(18), + COLLATION_NTOFS_ULONGS = const_cpu_to_le32(19), +} COLLATION_RULES; + +/** + * enum ATTR_DEF_FLAGS - + * + * The flags (32-bit) describing attribute properties in the attribute + * definition structure. FIXME: This information is based on Regis's + * information and, according to him, it is not certain and probably + * incomplete. The INDEXABLE flag is fairly certainly correct as only the file + * name attribute has this flag set and this is the only attribute indexed in + * NT4. + */ +typedef enum { + ATTR_DEF_INDEXABLE = const_cpu_to_le32(0x02), /* Attribute can be + indexed. */ + ATTR_DEF_MULTIPLE = const_cpu_to_le32(0x04), /* Attribute type + can be present multiple times in the + mft records of an inode. */ + ATTR_DEF_NOT_ZERO = const_cpu_to_le32(0x08), /* Attribute value + must contain at least one non-zero + byte. */ + ATTR_DEF_INDEXED_UNIQUE = const_cpu_to_le32(0x10), /* Attribute must be + indexed and the attribute value must be + unique for the attribute type in all of + the mft records of an inode. */ + ATTR_DEF_NAMED_UNIQUE = const_cpu_to_le32(0x20), /* Attribute must be + named and the name must be unique for + the attribute type in all of the mft + records of an inode. */ + ATTR_DEF_RESIDENT = const_cpu_to_le32(0x40), /* Attribute must be + resident. */ + ATTR_DEF_ALWAYS_LOG = const_cpu_to_le32(0x80), /* Always log + modifications to this attribute, + regardless of whether it is resident or + non-resident. Without this, only log + modifications if the attribute is + resident. */ +} ATTR_DEF_FLAGS; + +/** + * struct ATTR_DEF - + * + * The data attribute of FILE_AttrDef contains a sequence of attribute + * definitions for the NTFS volume. With this, it is supposed to be safe for an + * older NTFS driver to mount a volume containing a newer NTFS version without + * damaging it (that's the theory. In practice it's: not damaging it too much). + * Entries are sorted by attribute type. The flags describe whether the + * attribute can be resident/non-resident and possibly other things, but the + * actual bits are unknown. + */ +typedef struct { +/*hex ofs*/ +/* 0*/ ntfschar name[0x40]; /* Unicode name of the attribute. Zero + terminated. */ +/* 80*/ ATTR_TYPES type; /* Type of the attribute. */ +/* 84*/ u32 display_rule; /* Default display rule. + FIXME: What does it mean? (AIA) */ +/* 88*/ COLLATION_RULES collation_rule; /* Default collation rule. */ +/* 8c*/ ATTR_DEF_FLAGS flags; /* Flags describing the attribute. */ +/* 90*/ s64 min_size; /* Optional minimum attribute size. */ +/* 98*/ s64 max_size; /* Maximum size of attribute. */ +/* sizeof() = 0xa0 or 160 bytes */ +} __attribute__((__packed__)) ATTR_DEF; + +/** + * enum ATTR_FLAGS - Attribute flags (16-bit). + */ +typedef enum { + ATTR_IS_COMPRESSED = const_cpu_to_le16(0x0001), + ATTR_COMPRESSION_MASK = const_cpu_to_le16(0x00ff), /* Compression + method mask. Also, first + illegal value. */ + ATTR_IS_ENCRYPTED = const_cpu_to_le16(0x4000), + ATTR_IS_SPARSE = const_cpu_to_le16(0x8000), +} __attribute__((__packed__)) ATTR_FLAGS; + +/* + * Attribute compression. + * + * Only the data attribute is ever compressed in the current ntfs driver in + * Windows. Further, compression is only applied when the data attribute is + * non-resident. Finally, to use compression, the maximum allowed cluster size + * on a volume is 4kib. + * + * The compression method is based on independently compressing blocks of X + * clusters, where X is determined from the compression_unit value found in the + * non-resident attribute record header (more precisely: X = 2^compression_unit + * clusters). On Windows NT/2k, X always is 16 clusters (compression_unit = 4). + * + * There are three different cases of how a compression block of X clusters + * can be stored: + * + * 1) The data in the block is all zero (a sparse block): + * This is stored as a sparse block in the runlist, i.e. the runlist + * entry has length = X and lcn = -1. The mapping pairs array actually + * uses a delta_lcn value length of 0, i.e. delta_lcn is not present at + * all, which is then interpreted by the driver as lcn = -1. + * NOTE: Even uncompressed files can be sparse on NTFS 3.0 volumes, then + * the same principles apply as above, except that the length is not + * restricted to being any particular value. + * + * 2) The data in the block is not compressed: + * This happens when compression doesn't reduce the size of the block + * in clusters. I.e. if compression has a small effect so that the + * compressed data still occupies X clusters, then the uncompressed data + * is stored in the block. + * This case is recognised by the fact that the runlist entry has + * length = X and lcn >= 0. The mapping pairs array stores this as + * normal with a run length of X and some specific delta_lcn, i.e. + * delta_lcn has to be present. + * + * 3) The data in the block is compressed: + * The common case. This case is recognised by the fact that the run + * list entry has length L < X and lcn >= 0. The mapping pairs array + * stores this as normal with a run length of X and some specific + * delta_lcn, i.e. delta_lcn has to be present. This runlist entry is + * immediately followed by a sparse entry with length = X - L and + * lcn = -1. The latter entry is to make up the vcn counting to the + * full compression block size X. + * + * In fact, life is more complicated because adjacent entries of the same type + * can be coalesced. This means that one has to keep track of the number of + * clusters handled and work on a basis of X clusters at a time being one + * block. An example: if length L > X this means that this particular runlist + * entry contains a block of length X and part of one or more blocks of length + * L - X. Another example: if length L < X, this does not necessarily mean that + * the block is compressed as it might be that the lcn changes inside the block + * and hence the following runlist entry describes the continuation of the + * potentially compressed block. The block would be compressed if the + * following runlist entry describes at least X - L sparse clusters, thus + * making up the compression block length as described in point 3 above. (Of + * course, there can be several runlist entries with small lengths so that the + * sparse entry does not follow the first data containing entry with + * length < X.) + * + * NOTE: At the end of the compressed attribute value, there most likely is not + * just the right amount of data to make up a compression block, thus this data + * is not even attempted to be compressed. It is just stored as is, unless + * the number of clusters it occupies is reduced when compressed in which case + * it is stored as a compressed compression block, complete with sparse + * clusters at the end. + */ + +/** + * enum RESIDENT_ATTR_FLAGS - Flags of resident attributes (8-bit). + */ +typedef enum { + RESIDENT_ATTR_IS_INDEXED = 0x01, /* Attribute is referenced in an index + (has implications for deleting and + modifying the attribute). */ +} __attribute__((__packed__)) RESIDENT_ATTR_FLAGS; + +/** + * struct ATTR_RECORD - Attribute record header. + * + * Always aligned to 8-byte boundary. + */ +typedef struct { +/*Ofs*/ +/* 0*/ ATTR_TYPES type; /* The (32-bit) type of the attribute. */ +/* 4*/ u32 length; /* Byte size of the resident part of the + attribute (aligned to 8-byte boundary). + Used to get to the next attribute. */ +/* 8*/ u8 non_resident; /* If 0, attribute is resident. + If 1, attribute is non-resident. */ +/* 9*/ u8 name_length; /* Unicode character size of name of attribute. + 0 if unnamed. */ +/* 10*/ u16 name_offset; /* If name_length != 0, the byte offset to the + beginning of the name from the attribute + record. Note that the name is stored as a + Unicode string. When creating, place offset + just at the end of the record header. Then, + follow with attribute value or mapping pairs + array, resident and non-resident attributes + respectively, aligning to an 8-byte + boundary. */ +/* 12*/ ATTR_FLAGS flags; /* Flags describing the attribute. */ +/* 14*/ u16 instance; /* The instance of this attribute record. This + number is unique within this mft record (see + MFT_RECORD/next_attribute_instance notes + above for more details). */ +/* 16*/ union { + /* Resident attributes. */ + struct { +/* 16 */ u32 value_length; /* Byte size of attribute value. */ +/* 20 */ u16 value_offset; /* Byte offset of the attribute + value from the start of the + attribute record. When creating, + align to 8-byte boundary if we + have a name present as this might + not have a length of a multiple + of 8-bytes. */ +/* 22 */ RESIDENT_ATTR_FLAGS resident_flags; /* See above. */ +/* 23 */ s8 reservedR; /* Reserved/alignment to 8-byte + boundary. */ +/* 24 */ void *resident_end[0]; /* Use offsetof(ATTR_RECORD, + resident_end) to get size of + a resident attribute. */ + } __attribute__((__packed__)); + /* Non-resident attributes. */ + struct { +/* 16*/ VCN lowest_vcn; /* Lowest valid virtual cluster number + for this portion of the attribute value or + 0 if this is the only extent (usually the + case). - Only when an attribute list is used + does lowest_vcn != 0 ever occur. */ +/* 24*/ VCN highest_vcn; /* Highest valid vcn of this extent of + the attribute value. - Usually there is only one + portion, so this usually equals the attribute + value size in clusters minus 1. Can be -1 for + zero length files. Can be 0 for "single extent" + attributes. */ +/* 32*/ u16 mapping_pairs_offset; /* Byte offset from the + beginning of the structure to the mapping pairs + array which contains the mappings between the + vcns and the logical cluster numbers (lcns). + When creating, place this at the end of this + record header aligned to 8-byte boundary. */ +/* 34*/ u8 compression_unit; /* The compression unit expressed + as the log to the base 2 of the number of + clusters in a compression unit. 0 means not + compressed. (This effectively limits the + compression unit size to be a power of two + clusters.) WinNT4 only uses a value of 4. */ +/* 35*/ u8 reserved1[5]; /* Align to 8-byte boundary. */ +/* The sizes below are only used when lowest_vcn is zero, as otherwise it would + be difficult to keep them up-to-date.*/ +/* 40*/ s64 allocated_size; /* Byte size of disk space + allocated to hold the attribute value. Always + is a multiple of the cluster size. When a file + is compressed, this field is a multiple of the + compression block size (2^compression_unit) and + it represents the logically allocated space + rather than the actual on disk usage. For this + use the compressed_size (see below). */ +/* 48*/ s64 data_size; /* Byte size of the attribute + value. Can be larger than allocated_size if + attribute value is compressed or sparse. */ +/* 56*/ s64 initialized_size; /* Byte size of initialized + portion of the attribute value. Usually equals + data_size. */ +/* 64 */ void *non_resident_end[0]; /* Use offsetof(ATTR_RECORD, + non_resident_end) to get + size of a non resident + attribute. */ +/* sizeof(uncompressed attr) = 64*/ +/* 64*/ s64 compressed_size; /* Byte size of the attribute + value after compression. Only present when + compressed. Always is a multiple of the + cluster size. Represents the actual amount of + disk space being used on the disk. */ +/* 72 */ void *compressed_end[0]; + /* Use offsetof(ATTR_RECORD, compressed_end) to + get size of a compressed attribute. */ +/* sizeof(compressed attr) = 72*/ + } __attribute__((__packed__)); + } __attribute__((__packed__)); +} __attribute__((__packed__)) ATTR_RECORD; + +typedef ATTR_RECORD ATTR_REC; + +/** + * enum FILE_ATTR_FLAGS - File attribute flags (32-bit). + */ +typedef enum { + /* + * These flags are only present in the STANDARD_INFORMATION attribute + * (in the field file_attributes). + */ + FILE_ATTR_READONLY = const_cpu_to_le32(0x00000001), + FILE_ATTR_HIDDEN = const_cpu_to_le32(0x00000002), + FILE_ATTR_SYSTEM = const_cpu_to_le32(0x00000004), + /* Old DOS volid. Unused in NT. = cpu_to_le32(0x00000008), */ + + FILE_ATTR_DIRECTORY = const_cpu_to_le32(0x00000010), + /* FILE_ATTR_DIRECTORY is not considered valid in NT. It is reserved + for the DOS SUBDIRECTORY flag. */ + FILE_ATTR_ARCHIVE = const_cpu_to_le32(0x00000020), + FILE_ATTR_DEVICE = const_cpu_to_le32(0x00000040), + FILE_ATTR_NORMAL = const_cpu_to_le32(0x00000080), + + FILE_ATTR_TEMPORARY = const_cpu_to_le32(0x00000100), + FILE_ATTR_SPARSE_FILE = const_cpu_to_le32(0x00000200), + FILE_ATTR_REPARSE_POINT = const_cpu_to_le32(0x00000400), + FILE_ATTR_COMPRESSED = const_cpu_to_le32(0x00000800), + + FILE_ATTR_OFFLINE = const_cpu_to_le32(0x00001000), + FILE_ATTR_NOT_CONTENT_INDEXED = const_cpu_to_le32(0x00002000), + FILE_ATTR_ENCRYPTED = const_cpu_to_le32(0x00004000), + + FILE_ATTR_VALID_FLAGS = const_cpu_to_le32(0x00007fb7), + /* FILE_ATTR_VALID_FLAGS masks out the old DOS VolId and the + FILE_ATTR_DEVICE and preserves everything else. This mask + is used to obtain all flags that are valid for reading. */ + FILE_ATTR_VALID_SET_FLAGS = const_cpu_to_le32(0x000031a7), + /* FILE_ATTR_VALID_SET_FLAGS masks out the old DOS VolId, the + FILE_ATTR_DEVICE, FILE_ATTR_DIRECTORY, FILE_ATTR_SPARSE_FILE, + FILE_ATTR_REPARSE_POINT, FILE_ATRE_COMPRESSED and FILE_ATTR_ENCRYPTED + and preserves the rest. This mask is used to to obtain all flags that + are valid for setting. */ + + /** + * FILE_ATTR_I30_INDEX_PRESENT - Is it a directory? + * + * This is a copy of the MFT_RECORD_IS_DIRECTORY bit from the mft + * record, telling us whether this is a directory or not, i.e. whether + * it has an index root attribute named "$I30" or not. + * + * This flag is only present in the FILE_NAME attribute (in the + * file_attributes field). + */ + FILE_ATTR_I30_INDEX_PRESENT = const_cpu_to_le32(0x10000000), + + /** + * FILE_ATTR_VIEW_INDEX_PRESENT - Does have a non-directory index? + * + * This is a copy of the MFT_RECORD_IS_VIEW_INDEX bit from the mft + * record, telling us whether this file has a view index present (eg. + * object id index, quota index, one of the security indexes and the + * reparse points index). + * + * This flag is only present in the $STANDARD_INFORMATION and + * $FILE_NAME attributes. + */ + FILE_ATTR_VIEW_INDEX_PRESENT = const_cpu_to_le32(0x20000000), +} __attribute__((__packed__)) FILE_ATTR_FLAGS; + +/* + * NOTE on times in NTFS: All times are in MS standard time format, i.e. they + * are the number of 100-nanosecond intervals since 1st January 1601, 00:00:00 + * universal coordinated time (UTC). (In Linux time starts 1st January 1970, + * 00:00:00 UTC and is stored as the number of 1-second intervals since then.) + */ + +/** + * struct STANDARD_INFORMATION - Attribute: Standard information (0x10). + * + * NOTE: Always resident. + * NOTE: Present in all base file records on a volume. + * NOTE: There is conflicting information about the meaning of each of the time + * fields but the meaning as defined below has been verified to be + * correct by practical experimentation on Windows NT4 SP6a and is hence + * assumed to be the one and only correct interpretation. + */ +typedef struct { +/*Ofs*/ +/* 0*/ s64 creation_time; /* Time file was created. Updated when + a filename is changed(?). */ +/* 8*/ s64 last_data_change_time; /* Time the data attribute was last + modified. */ +/* 16*/ s64 last_mft_change_time; /* Time this mft record was last + modified. */ +/* 24*/ s64 last_access_time; /* Approximate time when the file was + last accessed (obviously this is not + updated on read-only volumes). In + Windows this is only updated when + accessed if some time delta has + passed since the last update. Also, + last access times updates can be + disabled altogether for speed. */ +/* 32*/ FILE_ATTR_FLAGS file_attributes; /* Flags describing the file. */ +/* 36*/ union { + /* NTFS 1.2 (and previous, presumably) */ + struct { + /* 36 */ u8 reserved12[12]; /* Reserved/alignment to 8-byte + boundary. */ + /* 48 */ void *v1_end[0]; /* Marker for offsetof(). */ + } __attribute__((__packed__)); +/* sizeof() = 48 bytes */ + /* NTFS 3.0 */ + struct { +/* + * If a volume has been upgraded from a previous NTFS version, then these + * fields are present only if the file has been accessed since the upgrade. + * Recognize the difference by comparing the length of the resident attribute + * value. If it is 48, then the following fields are missing. If it is 72 then + * the fields are present. Maybe just check like this: + * if (resident.ValueLength < sizeof(STANDARD_INFORMATION)) { + * Assume NTFS 1.2- format. + * If (volume version is 3.0+) + * Upgrade attribute to NTFS 3.0 format. + * else + * Use NTFS 1.2- format for access. + * } else + * Use NTFS 3.0 format for access. + * Only problem is that it might be legal to set the length of the value to + * arbitrarily large values thus spoiling this check. - But chkdsk probably + * views that as a corruption, assuming that it behaves like this for all + * attributes. + */ + /* 36*/ u32 maximum_versions; /* Maximum allowed versions for + file. Zero if version numbering is disabled. */ + /* 40*/ u32 version_number; /* This file's version (if any). + Set to zero if maximum_versions is zero. */ + /* 44*/ u32 class_id; /* Class id from bidirectional + class id index (?). */ + /* 48*/ u32 owner_id; /* Owner_id of the user owning + the file. Translate via $Q index in FILE_Extend + /$Quota to the quota control entry for the user + owning the file. Zero if quotas are disabled. */ + /* 52*/ u32 security_id; /* Security_id for the file. + Translate via $SII index and $SDS data stream + in FILE_Secure to the security descriptor. */ + /* 56*/ u64 quota_charged; /* Byte size of the charge to + the quota for all streams of the file. Note: Is + zero if quotas are disabled. */ + /* 64*/ u64 usn; /* Last update sequence number + of the file. This is a direct index into the + change (aka usn) journal file. It is zero if + the usn journal is disabled. + NOTE: To disable the journal need to delete + the journal file itself and to then walk the + whole mft and set all Usn entries in all mft + records to zero! (This can take a while!) + The journal is FILE_Extend/$UsnJrnl. Win2k + will recreate the journal and initiate + logging if necessary when mounting the + partition. This, in contrast to disabling the + journal is a very fast process, so the user + won't even notice it. */ + /* 72*/ void *v3_end[0]; /* Marker for offsetof(). */ + } __attribute__((__packed__)); + } __attribute__((__packed__)); +/* sizeof() = 72 bytes (NTFS 3.0) */ +} __attribute__((__packed__)) STANDARD_INFORMATION; + +/** + * struct ATTR_LIST_ENTRY - Attribute: Attribute list (0x20). + * + * - Can be either resident or non-resident. + * - Value consists of a sequence of variable length, 8-byte aligned, + * ATTR_LIST_ENTRY records. + * - The attribute list attribute contains one entry for each attribute of + * the file in which the list is located, except for the list attribute + * itself. The list is sorted: first by attribute type, second by attribute + * name (if present), third by instance number. The extents of one + * non-resident attribute (if present) immediately follow after the initial + * extent. They are ordered by lowest_vcn and have their instance set to zero. + * It is not allowed to have two attributes with all sorting keys equal. + * - Further restrictions: + * - If not resident, the vcn to lcn mapping array has to fit inside the + * base mft record. + * - The attribute list attribute value has a maximum size of 256kb. This + * is imposed by the Windows cache manager. + * - Attribute lists are only used when the attributes of mft record do not + * fit inside the mft record despite all attributes (that can be made + * non-resident) having been made non-resident. This can happen e.g. when: + * - File has a large number of hard links (lots of file name + * attributes present). + * - The mapping pairs array of some non-resident attribute becomes so + * large due to fragmentation that it overflows the mft record. + * - The security descriptor is very complex (not applicable to + * NTFS 3.0 volumes). + * - There are many named streams. + */ +typedef struct { +/*Ofs*/ +/* 0*/ ATTR_TYPES type; /* Type of referenced attribute. */ +/* 4*/ u16 length; /* Byte size of this entry. */ +/* 6*/ u8 name_length; /* Size in Unicode chars of the name of the + attribute or 0 if unnamed. */ +/* 7*/ u8 name_offset; /* Byte offset to beginning of attribute name + (always set this to where the name would + start even if unnamed). */ +/* 8*/ VCN lowest_vcn; /* Lowest virtual cluster number of this portion + of the attribute value. This is usually 0. It + is non-zero for the case where one attribute + does not fit into one mft record and thus + several mft records are allocated to hold + this attribute. In the latter case, each mft + record holds one extent of the attribute and + there is one attribute list entry for each + extent. NOTE: This is DEFINITELY a signed + value! The windows driver uses cmp, followed + by jg when comparing this, thus it treats it + as signed. */ +/* 16*/ MFT_REF mft_reference; /* The reference of the mft record holding + the ATTR_RECORD for this portion of the + attribute value. */ +/* 24*/ u16 instance; /* If lowest_vcn = 0, the instance of the + attribute being referenced; otherwise 0. */ +/* 26*/ ntfschar name[0]; /* Use when creating only. When reading use + name_offset to determine the location of the + name. */ +/* sizeof() = 26 + (attribute_name_length * 2) bytes */ +} __attribute__((__packed__)) ATTR_LIST_ENTRY; + +/* + * The maximum allowed length for a file name. + */ +#define NTFS_MAX_NAME_LEN 255 + +/** + * enum FILE_NAME_TYPE_FLAGS - Possible namespaces for filenames in ntfs. + * (8-bit). + */ +typedef enum { + FILE_NAME_POSIX = 0x00, + /* This is the largest namespace. It is case sensitive and + allows all Unicode characters except for: '\0' and '/'. + Beware that in WinNT/2k files which eg have the same name + except for their case will not be distinguished by the + standard utilities and thus a "del filename" will delete + both "filename" and "fileName" without warning. */ + FILE_NAME_WIN32 = 0x01, + /* The standard WinNT/2k NTFS long filenames. Case insensitive. + All Unicode chars except: '\0', '"', '*', '/', ':', '<', + '>', '?', '\' and '|'. Further, names cannot end with a '.' + or a space. */ + FILE_NAME_DOS = 0x02, + /* The standard DOS filenames (8.3 format). Uppercase only. + All 8-bit characters greater space, except: '"', '*', '+', + ',', '/', ':', ';', '<', '=', '>', '?' and '\'. */ + FILE_NAME_WIN32_AND_DOS = 0x03, + /* 3 means that both the Win32 and the DOS filenames are + identical and hence have been saved in this single filename + record. */ +} __attribute__((__packed__)) FILE_NAME_TYPE_FLAGS; + +/** + * struct FILE_NAME_ATTR - Attribute: Filename (0x30). + * + * NOTE: Always resident. + * NOTE: All fields, except the parent_directory, are only updated when the + * filename is changed. Until then, they just become out of sync with + * reality and the more up to date values are present in the standard + * information attribute. + * NOTE: There is conflicting information about the meaning of each of the time + * fields but the meaning as defined below has been verified to be + * correct by practical experimentation on Windows NT4 SP6a and is hence + * assumed to be the one and only correct interpretation. + */ +typedef struct { +/*hex ofs*/ +/* 0*/ MFT_REF parent_directory; /* Directory this filename is + referenced from. */ +/* 8*/ s64 creation_time; /* Time file was created. */ +/* 10*/ s64 last_data_change_time; /* Time the data attribute was last + modified. */ +/* 18*/ s64 last_mft_change_time; /* Time this mft record was last + modified. */ +/* 20*/ s64 last_access_time; /* Last time this mft record was + accessed. */ +/* 28*/ s64 allocated_size; /* Byte size of on-disk allocated space + for the data attribute. So for + normal $DATA, this is the + allocated_size from the unnamed + $DATA attribute and for compressed + and/or sparse $DATA, this is the + compressed_size from the unnamed + $DATA attribute. NOTE: This is a + multiple of the cluster size. */ +/* 30*/ s64 data_size; /* Byte size of actual data in data + attribute. */ +/* 38*/ FILE_ATTR_FLAGS file_attributes; /* Flags describing the file. */ +/* 3c*/ union { + /* 3c*/ struct { + /* 3c*/ u16 packed_ea_size; /* Size of the buffer needed to + pack the extended attributes + (EAs), if such are present.*/ + /* 3e*/ u16 reserved; /* Reserved for alignment. */ + } __attribute__((__packed__)); + /* 3c*/ u32 reparse_point_tag; /* Type of reparse point, + present only in reparse + points and only if there are + no EAs. */ + } __attribute__((__packed__)); +/* 40*/ u8 file_name_length; /* Length of file name in + (Unicode) characters. */ +/* 41*/ FILE_NAME_TYPE_FLAGS file_name_type; /* Namespace of the file name.*/ +/* 42*/ ntfschar file_name[0]; /* File name in Unicode. */ +} __attribute__((__packed__)) FILE_NAME_ATTR; + +/** + * struct GUID - GUID structures store globally unique identifiers (GUID). + * + * A GUID is a 128-bit value consisting of one group of eight hexadecimal + * digits, followed by three groups of four hexadecimal digits each, followed + * by one group of twelve hexadecimal digits. GUIDs are Microsoft's + * implementation of the distributed computing environment (DCE) universally + * unique identifier (UUID). + * + * Example of a GUID: + * 1F010768-5A73-BC91-0010-A52216A7227B + */ +typedef struct { + u32 data1; /* The first eight hexadecimal digits of the GUID. */ + u16 data2; /* The first group of four hexadecimal digits. */ + u16 data3; /* The second group of four hexadecimal digits. */ + u8 data4[8]; /* The first two bytes are the third group of four + hexadecimal digits. The remaining six bytes are the + final 12 hexadecimal digits. */ +} __attribute__((__packed__)) GUID; + +/** + * struct OBJ_ID_INDEX_DATA - FILE_Extend/$ObjId contains an index named $O. + * + * This index contains all object_ids present on the volume as the index keys + * and the corresponding mft_record numbers as the index entry data parts. + * + * The data part (defined below) also contains three other object_ids: + * birth_volume_id - object_id of FILE_Volume on which the file was first + * created. Optional (i.e. can be zero). + * birth_object_id - object_id of file when it was first created. Usually + * equals the object_id. Optional (i.e. can be zero). + * domain_id - Reserved (always zero). + */ +typedef struct { + MFT_REF mft_reference; /* Mft record containing the object_id in + the index entry key. */ + union { + struct { + GUID birth_volume_id; + GUID birth_object_id; + GUID domain_id; + } __attribute__((__packed__)); + u8 extended_info[48]; + } __attribute__((__packed__)); +} __attribute__((__packed__)) OBJ_ID_INDEX_DATA; + +/** + * struct OBJECT_ID_ATTR - Attribute: Object id (NTFS 3.0+) (0x40). + * + * NOTE: Always resident. + */ +typedef struct { + GUID object_id; /* Unique id assigned to the + file.*/ + /* The following fields are optional. The attribute value size is 16 + bytes, i.e. sizeof(GUID), if these are not present at all. Note, + the entries can be present but one or more (or all) can be zero + meaning that that particular value(s) is(are) not defined. Note, + when the fields are missing here, it is well possible that they are + to be found within the $Extend/$ObjId system file indexed under the + above object_id. */ + union { + struct { + GUID birth_volume_id; /* Unique id of volume on which + the file was first created.*/ + GUID birth_object_id; /* Unique id of file when it was + first created. */ + GUID domain_id; /* Reserved, zero. */ + } __attribute__((__packed__)); + u8 extended_info[48]; + } __attribute__((__packed__)); +} __attribute__((__packed__)) OBJECT_ID_ATTR; + +#if 0 +/** + * enum IDENTIFIER_AUTHORITIES - + * + * The pre-defined IDENTIFIER_AUTHORITIES used as SID_IDENTIFIER_AUTHORITY in + * the SID structure (see below). + */ +typedef enum { /* SID string prefix. */ + SECURITY_NULL_SID_AUTHORITY = {0, 0, 0, 0, 0, 0}, /* S-1-0 */ + SECURITY_WORLD_SID_AUTHORITY = {0, 0, 0, 0, 0, 1}, /* S-1-1 */ + SECURITY_LOCAL_SID_AUTHORITY = {0, 0, 0, 0, 0, 2}, /* S-1-2 */ + SECURITY_CREATOR_SID_AUTHORITY = {0, 0, 0, 0, 0, 3}, /* S-1-3 */ + SECURITY_NON_UNIQUE_AUTHORITY = {0, 0, 0, 0, 0, 4}, /* S-1-4 */ + SECURITY_NT_SID_AUTHORITY = {0, 0, 0, 0, 0, 5}, /* S-1-5 */ +} IDENTIFIER_AUTHORITIES; +#endif + +/** + * enum RELATIVE_IDENTIFIERS - + * + * These relative identifiers (RIDs) are used with the above identifier + * authorities to make up universal well-known SIDs. + * + * Note: The relative identifier (RID) refers to the portion of a SID, which + * identifies a user or group in relation to the authority that issued the SID. + * For example, the universal well-known SID Creator Owner ID (S-1-3-0) is + * made up of the identifier authority SECURITY_CREATOR_SID_AUTHORITY (3) and + * the relative identifier SECURITY_CREATOR_OWNER_RID (0). + */ +typedef enum { /* Identifier authority. */ + SECURITY_NULL_RID = 0, /* S-1-0 */ + SECURITY_WORLD_RID = 0, /* S-1-1 */ + SECURITY_LOCAL_RID = 0, /* S-1-2 */ + + SECURITY_CREATOR_OWNER_RID = 0, /* S-1-3 */ + SECURITY_CREATOR_GROUP_RID = 1, /* S-1-3 */ + + SECURITY_CREATOR_OWNER_SERVER_RID = 2, /* S-1-3 */ + SECURITY_CREATOR_GROUP_SERVER_RID = 3, /* S-1-3 */ + + SECURITY_DIALUP_RID = 1, + SECURITY_NETWORK_RID = 2, + SECURITY_BATCH_RID = 3, + SECURITY_INTERACTIVE_RID = 4, + SECURITY_SERVICE_RID = 6, + SECURITY_ANONYMOUS_LOGON_RID = 7, + SECURITY_PROXY_RID = 8, + SECURITY_ENTERPRISE_CONTROLLERS_RID=9, + SECURITY_SERVER_LOGON_RID = 9, + SECURITY_PRINCIPAL_SELF_RID = 0xa, + SECURITY_AUTHENTICATED_USER_RID = 0xb, + SECURITY_RESTRICTED_CODE_RID = 0xc, + SECURITY_TERMINAL_SERVER_RID = 0xd, + + SECURITY_LOGON_IDS_RID = 5, + SECURITY_LOGON_IDS_RID_COUNT = 3, + + SECURITY_LOCAL_SYSTEM_RID = 0x12, + + SECURITY_NT_NON_UNIQUE = 0x15, + + SECURITY_BUILTIN_DOMAIN_RID = 0x20, + + /* + * Well-known domain relative sub-authority values (RIDs). + */ + + /* Users. */ + DOMAIN_USER_RID_ADMIN = 0x1f4, + DOMAIN_USER_RID_GUEST = 0x1f5, + DOMAIN_USER_RID_KRBTGT = 0x1f6, + + /* Groups. */ + DOMAIN_GROUP_RID_ADMINS = 0x200, + DOMAIN_GROUP_RID_USERS = 0x201, + DOMAIN_GROUP_RID_GUESTS = 0x202, + DOMAIN_GROUP_RID_COMPUTERS = 0x203, + DOMAIN_GROUP_RID_CONTROLLERS = 0x204, + DOMAIN_GROUP_RID_CERT_ADMINS = 0x205, + DOMAIN_GROUP_RID_SCHEMA_ADMINS = 0x206, + DOMAIN_GROUP_RID_ENTERPRISE_ADMINS= 0x207, + DOMAIN_GROUP_RID_POLICY_ADMINS = 0x208, + + /* Aliases. */ + DOMAIN_ALIAS_RID_ADMINS = 0x220, + DOMAIN_ALIAS_RID_USERS = 0x221, + DOMAIN_ALIAS_RID_GUESTS = 0x222, + DOMAIN_ALIAS_RID_POWER_USERS = 0x223, + + DOMAIN_ALIAS_RID_ACCOUNT_OPS = 0x224, + DOMAIN_ALIAS_RID_SYSTEM_OPS = 0x225, + DOMAIN_ALIAS_RID_PRINT_OPS = 0x226, + DOMAIN_ALIAS_RID_BACKUP_OPS = 0x227, + + DOMAIN_ALIAS_RID_REPLICATOR = 0x228, + DOMAIN_ALIAS_RID_RAS_SERVERS = 0x229, + DOMAIN_ALIAS_RID_PREW2KCOMPACCESS = 0x22a, +} RELATIVE_IDENTIFIERS; + +/* + * The universal well-known SIDs: + * + * NULL_SID S-1-0-0 + * WORLD_SID S-1-1-0 + * LOCAL_SID S-1-2-0 + * CREATOR_OWNER_SID S-1-3-0 + * CREATOR_GROUP_SID S-1-3-1 + * CREATOR_OWNER_SERVER_SID S-1-3-2 + * CREATOR_GROUP_SERVER_SID S-1-3-3 + * + * (Non-unique IDs) S-1-4 + * + * NT well-known SIDs: + * + * NT_AUTHORITY_SID S-1-5 + * DIALUP_SID S-1-5-1 + * + * NETWORD_SID S-1-5-2 + * BATCH_SID S-1-5-3 + * INTERACTIVE_SID S-1-5-4 + * SERVICE_SID S-1-5-6 + * ANONYMOUS_LOGON_SID S-1-5-7 (aka null logon session) + * PROXY_SID S-1-5-8 + * SERVER_LOGON_SID S-1-5-9 (aka domain controller account) + * SELF_SID S-1-5-10 (self RID) + * AUTHENTICATED_USER_SID S-1-5-11 + * RESTRICTED_CODE_SID S-1-5-12 (running restricted code) + * TERMINAL_SERVER_SID S-1-5-13 (running on terminal server) + * + * (Logon IDs) S-1-5-5-X-Y + * + * (NT non-unique IDs) S-1-5-0x15-... + * + * (Built-in domain) S-1-5-0x20 + */ + +/** + * union SID_IDENTIFIER_AUTHORITY - A 48-bit value used in the SID structure + * + * NOTE: This is stored as a big endian number. + */ +typedef union { + struct { + u16 high_part; /* High 16-bits. */ + u32 low_part; /* Low 32-bits. */ + } __attribute__((__packed__)); + u8 value[6]; /* Value as individual bytes. */ +} __attribute__((__packed__)) SID_IDENTIFIER_AUTHORITY; + +/** + * struct SID - + * + * The SID structure is a variable-length structure used to uniquely identify + * users or groups. SID stands for security identifier. + * + * The standard textual representation of the SID is of the form: + * S-R-I-S-S... + * Where: + * - The first "S" is the literal character 'S' identifying the following + * digits as a SID. + * - R is the revision level of the SID expressed as a sequence of digits + * in decimal. + * - I is the 48-bit identifier_authority, expressed as digits in decimal, + * if I < 2^32, or hexadecimal prefixed by "0x", if I >= 2^32. + * - S... is one or more sub_authority values, expressed as digits in + * decimal. + * + * Example SID; the domain-relative SID of the local Administrators group on + * Windows NT/2k: + * S-1-5-32-544 + * This translates to a SID with: + * revision = 1, + * sub_authority_count = 2, + * identifier_authority = {0,0,0,0,0,5}, // SECURITY_NT_AUTHORITY + * sub_authority[0] = 32, // SECURITY_BUILTIN_DOMAIN_RID + * sub_authority[1] = 544 // DOMAIN_ALIAS_RID_ADMINS + */ +typedef struct { + u8 revision; + u8 sub_authority_count; + SID_IDENTIFIER_AUTHORITY identifier_authority; + u32 sub_authority[1]; /* At least one sub_authority. */ +} __attribute__((__packed__)) SID; + +/** + * enum SID_CONSTANTS - Current constants for SIDs. + */ +typedef enum { + SID_REVISION = 1, /* Current revision level. */ + SID_MAX_SUB_AUTHORITIES = 15, /* Maximum number of those. */ + SID_RECOMMENDED_SUB_AUTHORITIES = 1, /* Will change to around 6 in + a future revision. */ +} SID_CONSTANTS; + +/** + * enum ACE_TYPES - The predefined ACE types (8-bit, see below). + */ +typedef enum { + ACCESS_MIN_MS_ACE_TYPE = 0, + ACCESS_ALLOWED_ACE_TYPE = 0, + ACCESS_DENIED_ACE_TYPE = 1, + SYSTEM_AUDIT_ACE_TYPE = 2, + SYSTEM_ALARM_ACE_TYPE = 3, /* Not implemented as of Win2k. */ + ACCESS_MAX_MS_V2_ACE_TYPE = 3, + + ACCESS_ALLOWED_COMPOUND_ACE_TYPE= 4, + ACCESS_MAX_MS_V3_ACE_TYPE = 4, + + /* The following are Win2k only. */ + ACCESS_MIN_MS_OBJECT_ACE_TYPE = 5, + ACCESS_ALLOWED_OBJECT_ACE_TYPE = 5, + ACCESS_DENIED_OBJECT_ACE_TYPE = 6, + SYSTEM_AUDIT_OBJECT_ACE_TYPE = 7, + SYSTEM_ALARM_OBJECT_ACE_TYPE = 8, + ACCESS_MAX_MS_OBJECT_ACE_TYPE = 8, + + ACCESS_MAX_MS_V4_ACE_TYPE = 8, + + /* This one is for WinNT&2k. */ + ACCESS_MAX_MS_ACE_TYPE = 8, +} __attribute__((__packed__)) ACE_TYPES; + +/** + * enum ACE_FLAGS - The ACE flags (8-bit) for audit and inheritance. + * + * SUCCESSFUL_ACCESS_ACE_FLAG is only used with system audit and alarm ACE + * types to indicate that a message is generated (in Windows!) for successful + * accesses. + * + * FAILED_ACCESS_ACE_FLAG is only used with system audit and alarm ACE types + * to indicate that a message is generated (in Windows!) for failed accesses. + */ +typedef enum { + /* The inheritance flags. */ + OBJECT_INHERIT_ACE = 0x01, + CONTAINER_INHERIT_ACE = 0x02, + NO_PROPAGATE_INHERIT_ACE = 0x04, + INHERIT_ONLY_ACE = 0x08, + INHERITED_ACE = 0x10, /* Win2k only. */ + VALID_INHERIT_FLAGS = 0x1f, + + /* The audit flags. */ + SUCCESSFUL_ACCESS_ACE_FLAG = 0x40, + FAILED_ACCESS_ACE_FLAG = 0x80, +} __attribute__((__packed__)) ACE_FLAGS; + +/** + * struct ACE_HEADER - + * + * An ACE is an access-control entry in an access-control list (ACL). + * An ACE defines access to an object for a specific user or group or defines + * the types of access that generate system-administration messages or alarms + * for a specific user or group. The user or group is identified by a security + * identifier (SID). + * + * Each ACE starts with an ACE_HEADER structure (aligned on 4-byte boundary), + * which specifies the type and size of the ACE. The format of the subsequent + * data depends on the ACE type. + */ +typedef struct { + ACE_TYPES type; /* Type of the ACE. */ + ACE_FLAGS flags; /* Flags describing the ACE. */ + u16 size; /* Size in bytes of the ACE. */ +} __attribute__((__packed__)) ACE_HEADER; + +/** + * enum ACCESS_MASK - The access mask (32-bit). + * + * Defines the access rights. + */ +typedef enum { + /* + * The specific rights (bits 0 to 15). Depend on the type of the + * object being secured by the ACE. + */ + + /* Specific rights for files and directories are as follows: */ + + /* Right to read data from the file. (FILE) */ + FILE_READ_DATA = const_cpu_to_le32(0x00000001), + /* Right to list contents of a directory. (DIRECTORY) */ + FILE_LIST_DIRECTORY = const_cpu_to_le32(0x00000001), + + /* Right to write data to the file. (FILE) */ + FILE_WRITE_DATA = const_cpu_to_le32(0x00000002), + /* Right to create a file in the directory. (DIRECTORY) */ + FILE_ADD_FILE = const_cpu_to_le32(0x00000002), + + /* Right to append data to the file. (FILE) */ + FILE_APPEND_DATA = const_cpu_to_le32(0x00000004), + /* Right to create a subdirectory. (DIRECTORY) */ + FILE_ADD_SUBDIRECTORY = const_cpu_to_le32(0x00000004), + + /* Right to read extended attributes. (FILE/DIRECTORY) */ + FILE_READ_EA = const_cpu_to_le32(0x00000008), + + /* Right to write extended attributes. (FILE/DIRECTORY) */ + FILE_WRITE_EA = const_cpu_to_le32(0x00000010), + + /* Right to execute a file. (FILE) */ + FILE_EXECUTE = const_cpu_to_le32(0x00000020), + /* Right to traverse the directory. (DIRECTORY) */ + FILE_TRAVERSE = const_cpu_to_le32(0x00000020), + + /* + * Right to delete a directory and all the files it contains (its + * children), even if the files are read-only. (DIRECTORY) + */ + FILE_DELETE_CHILD = const_cpu_to_le32(0x00000040), + + /* Right to read file attributes. (FILE/DIRECTORY) */ + FILE_READ_ATTRIBUTES = const_cpu_to_le32(0x00000080), + + /* Right to change file attributes. (FILE/DIRECTORY) */ + FILE_WRITE_ATTRIBUTES = const_cpu_to_le32(0x00000100), + + /* + * The standard rights (bits 16 to 23). Are independent of the type of + * object being secured. + */ + + /* Right to delete the object. */ + DELETE = const_cpu_to_le32(0x00010000), + + /* + * Right to read the information in the object's security descriptor, + * not including the information in the SACL. I.e. right to read the + * security descriptor and owner. + */ + READ_CONTROL = const_cpu_to_le32(0x00020000), + + /* Right to modify the DACL in the object's security descriptor. */ + WRITE_DAC = const_cpu_to_le32(0x00040000), + + /* Right to change the owner in the object's security descriptor. */ + WRITE_OWNER = const_cpu_to_le32(0x00080000), + + /* + * Right to use the object for synchronization. Enables a process to + * wait until the object is in the signalled state. Some object types + * do not support this access right. + */ + SYNCHRONIZE = const_cpu_to_le32(0x00100000), + + /* + * The following STANDARD_RIGHTS_* are combinations of the above for + * convenience and are defined by the Win32 API. + */ + + /* These are currently defined to READ_CONTROL. */ + STANDARD_RIGHTS_READ = const_cpu_to_le32(0x00020000), + STANDARD_RIGHTS_WRITE = const_cpu_to_le32(0x00020000), + STANDARD_RIGHTS_EXECUTE = const_cpu_to_le32(0x00020000), + + /* Combines DELETE, READ_CONTROL, WRITE_DAC, and WRITE_OWNER access. */ + STANDARD_RIGHTS_REQUIRED = const_cpu_to_le32(0x000f0000), + + /* + * Combines DELETE, READ_CONTROL, WRITE_DAC, WRITE_OWNER, and + * SYNCHRONIZE access. + */ + STANDARD_RIGHTS_ALL = const_cpu_to_le32(0x001f0000), + + /* + * The access system ACL and maximum allowed access types (bits 24 to + * 25, bits 26 to 27 are reserved). + */ + ACCESS_SYSTEM_SECURITY = const_cpu_to_le32(0x01000000), + MAXIMUM_ALLOWED = const_cpu_to_le32(0x02000000), + + /* + * The generic rights (bits 28 to 31). These map onto the standard and + * specific rights. + */ + + /* Read, write, and execute access. */ + GENERIC_ALL = const_cpu_to_le32(0x10000000), + + /* Execute access. */ + GENERIC_EXECUTE = const_cpu_to_le32(0x20000000), + + /* + * Write access. For files, this maps onto: + * FILE_APPEND_DATA | FILE_WRITE_ATTRIBUTES | FILE_WRITE_DATA | + * FILE_WRITE_EA | STANDARD_RIGHTS_WRITE | SYNCHRONIZE + * For directories, the mapping has the same numerical value. See + * above for the descriptions of the rights granted. + */ + GENERIC_WRITE = const_cpu_to_le32(0x40000000), + + /* + * Read access. For files, this maps onto: + * FILE_READ_ATTRIBUTES | FILE_READ_DATA | FILE_READ_EA | + * STANDARD_RIGHTS_READ | SYNCHRONIZE + * For directories, the mapping has the same numerical value. See + * above for the descriptions of the rights granted. + */ + GENERIC_READ = const_cpu_to_le32(0x80000000), +} ACCESS_MASK; + +/** + * struct GENERIC_MAPPING - + * + * The generic mapping array. Used to denote the mapping of each generic + * access right to a specific access mask. + * + * FIXME: What exactly is this and what is it for? (AIA) + */ +typedef struct { + ACCESS_MASK generic_read; + ACCESS_MASK generic_write; + ACCESS_MASK generic_execute; + ACCESS_MASK generic_all; +} __attribute__((__packed__)) GENERIC_MAPPING; + +/* + * The predefined ACE type structures are as defined below. + */ + +/** + * struct ACCESS_DENIED_ACE - + * + * ACCESS_ALLOWED_ACE, ACCESS_DENIED_ACE, SYSTEM_AUDIT_ACE, SYSTEM_ALARM_ACE + */ +typedef struct { +/* 0 ACE_HEADER; -- Unfolded here as gcc doesn't like unnamed structs. */ + ACE_TYPES type; /* Type of the ACE. */ + ACE_FLAGS flags; /* Flags describing the ACE. */ + u16 size; /* Size in bytes of the ACE. */ + +/* 4*/ ACCESS_MASK mask; /* Access mask associated with the ACE. */ +/* 8*/ SID sid; /* The SID associated with the ACE. */ +} __attribute__((__packed__)) ACCESS_ALLOWED_ACE, ACCESS_DENIED_ACE, + SYSTEM_AUDIT_ACE, SYSTEM_ALARM_ACE; + +/** + * enum OBJECT_ACE_FLAGS - The object ACE flags (32-bit). + */ +typedef enum { + ACE_OBJECT_TYPE_PRESENT = const_cpu_to_le32(1), + ACE_INHERITED_OBJECT_TYPE_PRESENT = const_cpu_to_le32(2), +} OBJECT_ACE_FLAGS; + +/** + * struct ACCESS_ALLOWED_OBJECT_ACE - + */ +typedef struct { +/* 0 ACE_HEADER; -- Unfolded here as gcc doesn't like unnamed structs. */ + ACE_TYPES type; /* Type of the ACE. */ + ACE_FLAGS flags; /* Flags describing the ACE. */ + u16 size; /* Size in bytes of the ACE. */ + +/* 4*/ ACCESS_MASK mask; /* Access mask associated with the ACE. */ +/* 8*/ OBJECT_ACE_FLAGS object_flags; /* Flags describing the object ACE. */ +/* 12*/ GUID object_type; +/* 28*/ GUID inherited_object_type; +/* 44*/ SID sid; /* The SID associated with the ACE. */ +} __attribute__((__packed__)) ACCESS_ALLOWED_OBJECT_ACE, + ACCESS_DENIED_OBJECT_ACE, + SYSTEM_AUDIT_OBJECT_ACE, + SYSTEM_ALARM_OBJECT_ACE; + +/** + * struct ACL - An ACL is an access-control list (ACL). + * + * An ACL starts with an ACL header structure, which specifies the size of + * the ACL and the number of ACEs it contains. The ACL header is followed by + * zero or more access control entries (ACEs). The ACL as well as each ACE + * are aligned on 4-byte boundaries. + */ +typedef struct { + u8 revision; /* Revision of this ACL. */ + u8 alignment1; + u16 size; /* Allocated space in bytes for ACL. Includes this + header, the ACEs and the remaining free space. */ + u16 ace_count; /* Number of ACEs in the ACL. */ + u16 alignment2; +/* sizeof() = 8 bytes */ +} __attribute__((__packed__)) ACL; + +/** + * enum ACL_CONSTANTS - Current constants for ACLs. + */ +typedef enum { + /* Current revision. */ + ACL_REVISION = 2, + ACL_REVISION_DS = 4, + + /* History of revisions. */ + ACL_REVISION1 = 1, + MIN_ACL_REVISION = 2, + ACL_REVISION2 = 2, + ACL_REVISION3 = 3, + ACL_REVISION4 = 4, + MAX_ACL_REVISION = 4, +} ACL_CONSTANTS; + +/** + * enum SECURITY_DESCRIPTOR_CONTROL - + * + * The security descriptor control flags (16-bit). + * + * SE_OWNER_DEFAULTED - This boolean flag, when set, indicates that the + * SID pointed to by the Owner field was provided by a + * defaulting mechanism rather than explicitly provided by the + * original provider of the security descriptor. This may + * affect the treatment of the SID with respect to inheritance + * of an owner. + * + * SE_GROUP_DEFAULTED - This boolean flag, when set, indicates that the + * SID in the Group field was provided by a defaulting mechanism + * rather than explicitly provided by the original provider of + * the security descriptor. This may affect the treatment of + * the SID with respect to inheritance of a primary group. + * + * SE_DACL_PRESENT - This boolean flag, when set, indicates that the + * security descriptor contains a discretionary ACL. If this + * flag is set and the Dacl field of the SECURITY_DESCRIPTOR is + * null, then a null ACL is explicitly being specified. + * + * SE_DACL_DEFAULTED - This boolean flag, when set, indicates that the + * ACL pointed to by the Dacl field was provided by a defaulting + * mechanism rather than explicitly provided by the original + * provider of the security descriptor. This may affect the + * treatment of the ACL with respect to inheritance of an ACL. + * This flag is ignored if the DaclPresent flag is not set. + * + * SE_SACL_PRESENT - This boolean flag, when set, indicates that the + * security descriptor contains a system ACL pointed to by the + * Sacl field. If this flag is set and the Sacl field of the + * SECURITY_DESCRIPTOR is null, then an empty (but present) + * ACL is being specified. + * + * SE_SACL_DEFAULTED - This boolean flag, when set, indicates that the + * ACL pointed to by the Sacl field was provided by a defaulting + * mechanism rather than explicitly provided by the original + * provider of the security descriptor. This may affect the + * treatment of the ACL with respect to inheritance of an ACL. + * This flag is ignored if the SaclPresent flag is not set. + * + * SE_SELF_RELATIVE - This boolean flag, when set, indicates that the + * security descriptor is in self-relative form. In this form, + * all fields of the security descriptor are contiguous in memory + * and all pointer fields are expressed as offsets from the + * beginning of the security descriptor. + */ +typedef enum { + SE_OWNER_DEFAULTED = const_cpu_to_le16(0x0001), + SE_GROUP_DEFAULTED = const_cpu_to_le16(0x0002), + SE_DACL_PRESENT = const_cpu_to_le16(0x0004), + SE_DACL_DEFAULTED = const_cpu_to_le16(0x0008), + SE_SACL_PRESENT = const_cpu_to_le16(0x0010), + SE_SACL_DEFAULTED = const_cpu_to_le16(0x0020), + SE_DACL_AUTO_INHERIT_REQ = const_cpu_to_le16(0x0100), + SE_SACL_AUTO_INHERIT_REQ = const_cpu_to_le16(0x0200), + SE_DACL_AUTO_INHERITED = const_cpu_to_le16(0x0400), + SE_SACL_AUTO_INHERITED = const_cpu_to_le16(0x0800), + SE_DACL_PROTECTED = const_cpu_to_le16(0x1000), + SE_SACL_PROTECTED = const_cpu_to_le16(0x2000), + SE_RM_CONTROL_VALID = const_cpu_to_le16(0x4000), + SE_SELF_RELATIVE = const_cpu_to_le16(0x8000), +} __attribute__((__packed__)) SECURITY_DESCRIPTOR_CONTROL; + +/** + * struct SECURITY_DESCRIPTOR_RELATIVE - + * + * Self-relative security descriptor. Contains the owner and group SIDs as well + * as the sacl and dacl ACLs inside the security descriptor itself. + */ +typedef struct { + u8 revision; /* Revision level of the security descriptor. */ + u8 alignment; + SECURITY_DESCRIPTOR_CONTROL control; /* Flags qualifying the type of + the descriptor as well as the following fields. */ + u32 owner; /* Byte offset to a SID representing an object's + owner. If this is NULL, no owner SID is present in + the descriptor. */ + u32 group; /* Byte offset to a SID representing an object's + primary group. If this is NULL, no primary group + SID is present in the descriptor. */ + u32 sacl; /* Byte offset to a system ACL. Only valid, if + SE_SACL_PRESENT is set in the control field. If + SE_SACL_PRESENT is set but sacl is NULL, a NULL ACL + is specified. */ + u32 dacl; /* Byte offset to a discretionary ACL. Only valid, if + SE_DACL_PRESENT is set in the control field. If + SE_DACL_PRESENT is set but dacl is NULL, a NULL ACL + (unconditionally granting access) is specified. */ +/* sizeof() = 0x14 bytes */ +} __attribute__((__packed__)) SECURITY_DESCRIPTOR_RELATIVE; + +/** + * struct SECURITY_DESCRIPTOR - Absolute security descriptor. + * + * Does not contain the owner and group SIDs, nor the sacl and dacl ACLs inside + * the security descriptor. Instead, it contains pointers to these structures + * in memory. Obviously, absolute security descriptors are only useful for in + * memory representations of security descriptors. + * + * On disk, a self-relative security descriptor is used. + */ +typedef struct { + u8 revision; /* Revision level of the security descriptor. */ + u8 alignment; + SECURITY_DESCRIPTOR_CONTROL control; /* Flags qualifying the type of + the descriptor as well as the following fields. */ + SID *owner; /* Points to a SID representing an object's owner. If + this is NULL, no owner SID is present in the + descriptor. */ + SID *group; /* Points to a SID representing an object's primary + group. If this is NULL, no primary group SID is + present in the descriptor. */ + ACL *sacl; /* Points to a system ACL. Only valid, if + SE_SACL_PRESENT is set in the control field. If + SE_SACL_PRESENT is set but sacl is NULL, a NULL ACL + is specified. */ + ACL *dacl; /* Points to a discretionary ACL. Only valid, if + SE_DACL_PRESENT is set in the control field. If + SE_DACL_PRESENT is set but dacl is NULL, a NULL ACL + (unconditionally granting access) is specified. */ +} __attribute__((__packed__)) SECURITY_DESCRIPTOR; + +/** + * enum SECURITY_DESCRIPTOR_CONSTANTS - + * + * Current constants for security descriptors. + */ +typedef enum { + /* Current revision. */ + SECURITY_DESCRIPTOR_REVISION = 1, + SECURITY_DESCRIPTOR_REVISION1 = 1, + + /* The sizes of both the absolute and relative security descriptors is + the same as pointers, at least on ia32 architecture are 32-bit. */ + SECURITY_DESCRIPTOR_MIN_LENGTH = sizeof(SECURITY_DESCRIPTOR), +} SECURITY_DESCRIPTOR_CONSTANTS; + +/* + * Attribute: Security descriptor (0x50). + * + * A standard self-relative security descriptor. + * + * NOTE: Can be resident or non-resident. + * NOTE: Not used in NTFS 3.0+, as security descriptors are stored centrally + * in FILE_Secure and the correct descriptor is found using the security_id + * from the standard information attribute. + */ +typedef SECURITY_DESCRIPTOR_RELATIVE SECURITY_DESCRIPTOR_ATTR; + +/* + * On NTFS 3.0+, all security descriptors are stored in FILE_Secure. Only one + * referenced instance of each unique security descriptor is stored. + * + * FILE_Secure contains no unnamed data attribute, i.e. it has zero length. It + * does, however, contain two indexes ($SDH and $SII) as well as a named data + * stream ($SDS). + * + * Every unique security descriptor is assigned a unique security identifier + * (security_id, not to be confused with a SID). The security_id is unique for + * the NTFS volume and is used as an index into the $SII index, which maps + * security_ids to the security descriptor's storage location within the $SDS + * data attribute. The $SII index is sorted by ascending security_id. + * + * A simple hash is computed from each security descriptor. This hash is used + * as an index into the $SDH index, which maps security descriptor hashes to + * the security descriptor's storage location within the $SDS data attribute. + * The $SDH index is sorted by security descriptor hash and is stored in a B+ + * tree. When searching $SDH (with the intent of determining whether or not a + * new security descriptor is already present in the $SDS data stream), if a + * matching hash is found, but the security descriptors do not match, the + * search in the $SDH index is continued, searching for a next matching hash. + * + * When a precise match is found, the security_id corresponding to the security + * descriptor in the $SDS attribute is read from the found $SDH index entry and + * is stored in the $STANDARD_INFORMATION attribute of the file/directory to + * which the security descriptor is being applied. The $STANDARD_INFORMATION + * attribute is present in all base mft records (i.e. in all files and + * directories). + * + * If a match is not found, the security descriptor is assigned a new unique + * security_id and is added to the $SDS data attribute. Then, entries + * referencing the this security descriptor in the $SDS data attribute are + * added to the $SDH and $SII indexes. + * + * Note: Entries are never deleted from FILE_Secure, even if nothing + * references an entry any more. + */ + +/** + * struct SECURITY_DESCRIPTOR_HEADER - + * + * This header precedes each security descriptor in the $SDS data stream. + * This is also the index entry data part of both the $SII and $SDH indexes. + */ +typedef struct { + u32 hash; /* Hash of the security descriptor. */ + u32 security_id; /* The security_id assigned to the descriptor. */ + u64 offset; /* Byte offset of this entry in the $SDS stream. */ + u32 length; /* Size in bytes of this entry in $SDS stream. */ +} __attribute__((__packed__)) SECURITY_DESCRIPTOR_HEADER; + +/** + * struct SDH_INDEX_DATA - + */ +typedef struct { + u32 hash; /* Hash of the security descriptor. */ + u32 security_id; /* The security_id assigned to the descriptor. */ + u64 offset; /* Byte offset of this entry in the $SDS stream. */ + u32 length; /* Size in bytes of this entry in $SDS stream. */ + u32 reserved_II; /* Padding - always unicode "II" or zero. This field + isn't counted in INDEX_ENTRY's data_length. */ +} __attribute__((__packed__)) SDH_INDEX_DATA; + +/** + * struct SII_INDEX_DATA - + */ +typedef SECURITY_DESCRIPTOR_HEADER SII_INDEX_DATA; + +/** + * struct SDS_ENTRY - + * + * The $SDS data stream contains the security descriptors, aligned on 16-byte + * boundaries, sorted by security_id in a B+ tree. Security descriptors cannot + * cross 256kib boundaries (this restriction is imposed by the Windows cache + * manager). Each security descriptor is contained in a SDS_ENTRY structure. + * Also, each security descriptor is stored twice in the $SDS stream with a + * fixed offset of 0x40000 bytes (256kib, the Windows cache manager's max size) + * between them; i.e. if a SDS_ENTRY specifies an offset of 0x51d0, then the + * the first copy of the security descriptor will be at offset 0x51d0 in the + * $SDS data stream and the second copy will be at offset 0x451d0. + */ +typedef struct { +/* 0 SECURITY_DESCRIPTOR_HEADER; -- Unfolded here as gcc doesn't like + unnamed structs. */ + u32 hash; /* Hash of the security descriptor. */ + u32 security_id; /* The security_id assigned to the descriptor. */ + u64 offset; /* Byte offset of this entry in the $SDS stream. */ + u32 length; /* Size in bytes of this entry in $SDS stream. */ +/* 20*/ SECURITY_DESCRIPTOR_RELATIVE sid; /* The self-relative security + descriptor. */ +} __attribute__((__packed__)) SDS_ENTRY; + +/** + * struct SII_INDEX_KEY - The index entry key used in the $SII index. + * + * The collation type is COLLATION_NTOFS_ULONG. + */ +typedef struct { + u32 security_id; /* The security_id assigned to the descriptor. */ +} __attribute__((__packed__)) SII_INDEX_KEY; + +/** + * struct SDH_INDEX_KEY - The index entry key used in the $SDH index. + * + * The keys are sorted first by hash and then by security_id. + * The collation rule is COLLATION_NTOFS_SECURITY_HASH. + */ +typedef struct { + u32 hash; /* Hash of the security descriptor. */ + u32 security_id; /* The security_id assigned to the descriptor. */ +} __attribute__((__packed__)) SDH_INDEX_KEY; + +/** + * struct VOLUME_NAME - Attribute: Volume name (0x60). + * + * NOTE: Always resident. + * NOTE: Present only in FILE_Volume. + */ +typedef struct { + ntfschar name[0]; /* The name of the volume in Unicode. */ +} __attribute__((__packed__)) VOLUME_NAME; + +/** + * enum VOLUME_FLAGS - Possible flags for the volume (16-bit). + */ +typedef enum { + VOLUME_IS_DIRTY = const_cpu_to_le16(0x0001), + VOLUME_RESIZE_LOG_FILE = const_cpu_to_le16(0x0002), + VOLUME_UPGRADE_ON_MOUNT = const_cpu_to_le16(0x0004), + VOLUME_MOUNTED_ON_NT4 = const_cpu_to_le16(0x0008), + VOLUME_DELETE_USN_UNDERWAY = const_cpu_to_le16(0x0010), + VOLUME_REPAIR_OBJECT_ID = const_cpu_to_le16(0x0020), + VOLUME_CHKDSK_UNDERWAY = const_cpu_to_le16(0x4000), + VOLUME_MODIFIED_BY_CHKDSK = const_cpu_to_le16(0x8000), + VOLUME_FLAGS_MASK = const_cpu_to_le16(0xc03f), +} __attribute__((__packed__)) VOLUME_FLAGS; + +/** + * struct VOLUME_INFORMATION - Attribute: Volume information (0x70). + * + * NOTE: Always resident. + * NOTE: Present only in FILE_Volume. + * NOTE: Windows 2000 uses NTFS 3.0 while Windows NT4 service pack 6a uses + * NTFS 1.2. I haven't personally seen other values yet. + */ +typedef struct { + u64 reserved; /* Not used (yet?). */ + u8 major_ver; /* Major version of the ntfs format. */ + u8 minor_ver; /* Minor version of the ntfs format. */ + VOLUME_FLAGS flags; /* Bit array of VOLUME_* flags. */ +} __attribute__((__packed__)) VOLUME_INFORMATION; + +/** + * struct DATA_ATTR - Attribute: Data attribute (0x80). + * + * NOTE: Can be resident or non-resident. + * + * Data contents of a file (i.e. the unnamed stream) or of a named stream. + */ +typedef struct { + u8 data[0]; /* The file's data contents. */ +} __attribute__((__packed__)) DATA_ATTR; + +/** + * enum INDEX_HEADER_FLAGS - Index header flags (8-bit). + */ +typedef enum { + /* When index header is in an index root attribute: */ + SMALL_INDEX = 0, /* The index is small enough to fit inside the + index root attribute and there is no index + allocation attribute present. */ + LARGE_INDEX = 1, /* The index is too large to fit in the index + root attribute and/or an index allocation + attribute is present. */ + /* + * When index header is in an index block, i.e. is part of index + * allocation attribute: + */ + LEAF_NODE = 0, /* This is a leaf node, i.e. there are no more + nodes branching off it. */ + INDEX_NODE = 1, /* This node indexes other nodes, i.e. is not a + leaf node. */ + NODE_MASK = 1, /* Mask for accessing the *_NODE bits. */ +} __attribute__((__packed__)) INDEX_HEADER_FLAGS; + +/** + * struct INDEX_HEADER - + * + * This is the header for indexes, describing the INDEX_ENTRY records, which + * follow the INDEX_HEADER. Together the index header and the index entries + * make up a complete index. + * + * IMPORTANT NOTE: The offset, length and size structure members are counted + * relative to the start of the index header structure and not relative to the + * start of the index root or index allocation structures themselves. + */ +typedef struct { +/* 0*/ u32 entries_offset; /* Byte offset from the INDEX_HEADER to first + INDEX_ENTRY, aligned to 8-byte boundary. */ +/* 4*/ u32 index_length; /* Data size in byte of the INDEX_ENTRY's, + including the INDEX_HEADER, aligned to 8. */ +/* 8*/ u32 allocated_size; /* Allocated byte size of this index (block), + multiple of 8 bytes. See more below. */ + /* + For the index root attribute, the above two numbers are always + equal, as the attribute is resident and it is resized as needed. + + For the index allocation attribute, the attribute is not resident + and the allocated_size is equal to the index_block_size specified + by the corresponding INDEX_ROOT attribute minus the INDEX_BLOCK + size not counting the INDEX_HEADER part (i.e. minus -24). + */ +/* 12*/ INDEX_HEADER_FLAGS ih_flags; /* Bit field of INDEX_HEADER_FLAGS. */ +/* 13*/ u8 reserved[3]; /* Reserved/align to 8-byte boundary.*/ +/* sizeof() == 16 */ +} __attribute__((__packed__)) INDEX_HEADER; + +/** + * struct INDEX_ROOT - Attribute: Index root (0x90). + * + * NOTE: Always resident. + * + * This is followed by a sequence of index entries (INDEX_ENTRY structures) + * as described by the index header. + * + * When a directory is small enough to fit inside the index root then this + * is the only attribute describing the directory. When the directory is too + * large to fit in the index root, on the other hand, two additional attributes + * are present: an index allocation attribute, containing sub-nodes of the B+ + * directory tree (see below), and a bitmap attribute, describing which virtual + * cluster numbers (vcns) in the index allocation attribute are in use by an + * index block. + * + * NOTE: The root directory (FILE_root) contains an entry for itself. Other + * directories do not contain entries for themselves, though. + */ +typedef struct { +/* 0*/ ATTR_TYPES type; /* Type of the indexed attribute. Is + $FILE_NAME for directories, zero + for view indexes. No other values + allowed. */ +/* 4*/ COLLATION_RULES collation_rule; /* Collation rule used to sort the + index entries. If type is $FILE_NAME, + this must be COLLATION_FILE_NAME. */ +/* 8*/ u32 index_block_size; /* Size of index block in bytes (in + the index allocation attribute). */ +/* 12*/ s8 clusters_per_index_block; /* Size of index block in clusters (in + the index allocation attribute), when + an index block is >= than a cluster, + otherwise sectors per index block. */ +/* 13*/ u8 reserved[3]; /* Reserved/align to 8-byte boundary. */ +/* 16*/ INDEX_HEADER index; /* Index header describing the + following index entries. */ +/* sizeof()= 32 bytes */ +} __attribute__((__packed__)) INDEX_ROOT; + +/** + * struct INDEX_BLOCK - Attribute: Index allocation (0xa0). + * + * NOTE: Always non-resident (doesn't make sense to be resident anyway!). + * + * This is an array of index blocks. Each index block starts with an + * INDEX_BLOCK structure containing an index header, followed by a sequence of + * index entries (INDEX_ENTRY structures), as described by the INDEX_HEADER. + */ +typedef struct { +/* 0 NTFS_RECORD; -- Unfolded here as gcc doesn't like unnamed structs. */ + NTFS_RECORD_TYPES magic;/* Magic is "INDX". */ + u16 usa_ofs; /* See NTFS_RECORD definition. */ + u16 usa_count; /* See NTFS_RECORD definition. */ + +/* 8*/ LSN lsn; /* $LogFile sequence number of the last + modification of this index block. */ +/* 16*/ VCN index_block_vcn; /* Virtual cluster number of the index block. */ +/* 24*/ INDEX_HEADER index; /* Describes the following index entries. */ +/* sizeof()= 40 (0x28) bytes */ +/* + * When creating the index block, we place the update sequence array at this + * offset, i.e. before we start with the index entries. This also makes sense, + * otherwise we could run into problems with the update sequence array + * containing in itself the last two bytes of a sector which would mean that + * multi sector transfer protection wouldn't work. As you can't protect data + * by overwriting it since you then can't get it back... + * When reading use the data from the ntfs record header. + */ +} __attribute__((__packed__)) INDEX_BLOCK; + +typedef INDEX_BLOCK INDEX_ALLOCATION; + +/** + * struct REPARSE_INDEX_KEY - + * + * The system file FILE_Extend/$Reparse contains an index named $R listing + * all reparse points on the volume. The index entry keys are as defined + * below. Note, that there is no index data associated with the index entries. + * + * The index entries are sorted by the index key file_id. The collation rule is + * COLLATION_NTOFS_ULONGS. FIXME: Verify whether the reparse_tag is not the + * primary key / is not a key at all. (AIA) + */ +typedef struct { + u32 reparse_tag; /* Reparse point type (inc. flags). */ + MFT_REF file_id; /* Mft record of the file containing the + reparse point attribute. */ +} __attribute__((__packed__)) REPARSE_INDEX_KEY; + +/** + * enum QUOTA_FLAGS - Quota flags (32-bit). + */ +typedef enum { + /* The user quota flags. Names explain meaning. */ + QUOTA_FLAG_DEFAULT_LIMITS = const_cpu_to_le32(0x00000001), + QUOTA_FLAG_LIMIT_REACHED = const_cpu_to_le32(0x00000002), + QUOTA_FLAG_ID_DELETED = const_cpu_to_le32(0x00000004), + + QUOTA_FLAG_USER_MASK = const_cpu_to_le32(0x00000007), + /* Bit mask for user quota flags. */ + + /* These flags are only present in the quota defaults index entry, + i.e. in the entry where owner_id = QUOTA_DEFAULTS_ID. */ + QUOTA_FLAG_TRACKING_ENABLED = const_cpu_to_le32(0x00000010), + QUOTA_FLAG_ENFORCEMENT_ENABLED = const_cpu_to_le32(0x00000020), + QUOTA_FLAG_TRACKING_REQUESTED = const_cpu_to_le32(0x00000040), + QUOTA_FLAG_LOG_THRESHOLD = const_cpu_to_le32(0x00000080), + QUOTA_FLAG_LOG_LIMIT = const_cpu_to_le32(0x00000100), + QUOTA_FLAG_OUT_OF_DATE = const_cpu_to_le32(0x00000200), + QUOTA_FLAG_CORRUPT = const_cpu_to_le32(0x00000400), + QUOTA_FLAG_PENDING_DELETES = const_cpu_to_le32(0x00000800), +} QUOTA_FLAGS; + +/** + * struct QUOTA_CONTROL_ENTRY - + * + * The system file FILE_Extend/$Quota contains two indexes $O and $Q. Quotas + * are on a per volume and per user basis. + * + * The $Q index contains one entry for each existing user_id on the volume. The + * index key is the user_id of the user/group owning this quota control entry, + * i.e. the key is the owner_id. The user_id of the owner of a file, i.e. the + * owner_id, is found in the standard information attribute. The collation rule + * for $Q is COLLATION_NTOFS_ULONG. + * + * The $O index contains one entry for each user/group who has been assigned + * a quota on that volume. The index key holds the SID of the user_id the + * entry belongs to, i.e. the owner_id. The collation rule for $O is + * COLLATION_NTOFS_SID. + * + * The $O index entry data is the user_id of the user corresponding to the SID. + * This user_id is used as an index into $Q to find the quota control entry + * associated with the SID. + * + * The $Q index entry data is the quota control entry and is defined below. + */ +typedef struct { + u32 version; /* Currently equals 2. */ + QUOTA_FLAGS flags; /* Flags describing this quota entry. */ + u64 bytes_used; /* How many bytes of the quota are in use. */ + s64 change_time; /* Last time this quota entry was changed. */ + s64 threshold; /* Soft quota (-1 if not limited). */ + s64 limit; /* Hard quota (-1 if not limited). */ + s64 exceeded_time; /* How long the soft quota has been exceeded. */ +/* The below field is NOT present for the quota defaults entry. */ + SID sid; /* The SID of the user/object associated with + this quota entry. If this field is missing + then the INDEX_ENTRY is padded with zeros + to multiply of 8 which are not counted in + the data_length field. If the sid is present + then this structure is padded with zeros to + multiply of 8 and the padding is counted in + the INDEX_ENTRY's data_length. */ +} __attribute__((__packed__)) QUOTA_CONTROL_ENTRY; + +/** + * struct QUOTA_O_INDEX_DATA - + */ +typedef struct { + u32 owner_id; + u32 unknown; /* Always 32. Seems to be padding and it's not + counted in the INDEX_ENTRY's data_length. + This field shouldn't be really here. */ +} __attribute__((__packed__)) QUOTA_O_INDEX_DATA; + +/** + * enum PREDEFINED_OWNER_IDS - Predefined owner_id values (32-bit). + */ +typedef enum { + QUOTA_INVALID_ID = const_cpu_to_le32(0x00000000), + QUOTA_DEFAULTS_ID = const_cpu_to_le32(0x00000001), + QUOTA_FIRST_USER_ID = const_cpu_to_le32(0x00000100), +} PREDEFINED_OWNER_IDS; + +/** + * enum INDEX_ENTRY_FLAGS - Index entry flags (16-bit). + */ +typedef enum { + INDEX_ENTRY_NODE = const_cpu_to_le16(1), /* This entry contains a + sub-node, i.e. a reference to an index + block in form of a virtual cluster + number (see below). */ + INDEX_ENTRY_END = const_cpu_to_le16(2), /* This signifies the last + entry in an index block. The index + entry does not represent a file but it + can point to a sub-node. */ + INDEX_ENTRY_SPACE_FILLER = 0xffff, /* Just to force 16-bit width. */ +} __attribute__((__packed__)) INDEX_ENTRY_FLAGS; + +/** + * struct INDEX_ENTRY_HEADER - This the index entry header (see below). + * + * ========================================================== + * !!!!! SEE DESCRIPTION OF THE FIELDS AT INDEX_ENTRY !!!!! + * ========================================================== + */ +typedef struct { +/* 0*/ union { + MFT_REF indexed_file; + struct { + u16 data_offset; + u16 data_length; + u32 reservedV; + } __attribute__((__packed__)); + } __attribute__((__packed__)); +/* 8*/ u16 length; +/* 10*/ u16 key_length; +/* 12*/ INDEX_ENTRY_FLAGS flags; +/* 14*/ u16 reserved; +/* sizeof() = 16 bytes */ +} __attribute__((__packed__)) INDEX_ENTRY_HEADER; + +/** + * struct INDEX_ENTRY - This is an index entry. + * + * A sequence of such entries follows each INDEX_HEADER structure. Together + * they make up a complete index. The index follows either an index root + * attribute or an index allocation attribute. + * + * NOTE: Before NTFS 3.0 only filename attributes were indexed. + */ +typedef struct { +/* 0 INDEX_ENTRY_HEADER; -- Unfolded here as gcc dislikes unnamed structs. */ + union { /* Only valid when INDEX_ENTRY_END is not set. */ + MFT_REF indexed_file; /* The mft reference of the file + described by this index + entry. Used for directory + indexes. */ + struct { /* Used for views/indexes to find the entry's data. */ + u16 data_offset; /* Data byte offset from this + INDEX_ENTRY. Follows the + index key. */ + u16 data_length; /* Data length in bytes. */ + u32 reservedV; /* Reserved (zero). */ + } __attribute__((__packed__)); + } __attribute__((__packed__)); +/* 8*/ u16 length; /* Byte size of this index entry, multiple of + 8-bytes. Size includes INDEX_ENTRY_HEADER + and the optional subnode VCN. See below. */ +/* 10*/ u16 key_length; /* Byte size of the key value, which is in the + index entry. It follows field reserved. Not + multiple of 8-bytes. */ +/* 12*/ INDEX_ENTRY_FLAGS ie_flags; /* Bit field of INDEX_ENTRY_* flags. */ +/* 14*/ u16 reserved; /* Reserved/align to 8-byte boundary. */ +/* End of INDEX_ENTRY_HEADER */ +/* 16*/ union { /* The key of the indexed attribute. NOTE: Only present + if INDEX_ENTRY_END bit in flags is not set. NOTE: On + NTFS versions before 3.0 the only valid key is the + FILE_NAME_ATTR. On NTFS 3.0+ the following + additional index keys are defined: */ + FILE_NAME_ATTR file_name;/* $I30 index in directories. */ + SII_INDEX_KEY sii; /* $SII index in $Secure. */ + SDH_INDEX_KEY sdh; /* $SDH index in $Secure. */ + GUID object_id; /* $O index in FILE_Extend/$ObjId: The + object_id of the mft record found in + the data part of the index. */ + REPARSE_INDEX_KEY reparse; /* $R index in + FILE_Extend/$Reparse. */ + SID sid; /* $O index in FILE_Extend/$Quota: + SID of the owner of the user_id. */ + u32 owner_id; /* $Q index in FILE_Extend/$Quota: + user_id of the owner of the quota + control entry in the data part of + the index. */ + } __attribute__((__packed__)) key; + /* The (optional) index data is inserted here when creating. + VCN vcn; If INDEX_ENTRY_NODE bit in ie_flags is set, the last + eight bytes of this index entry contain the virtual + cluster number of the index block that holds the + entries immediately preceding the current entry. + + If the key_length is zero, then the vcn immediately + follows the INDEX_ENTRY_HEADER. + + The address of the vcn of "ie" INDEX_ENTRY is given by + (char*)ie + le16_to_cpu(ie->length) - sizeof(VCN) + */ +} __attribute__((__packed__)) INDEX_ENTRY; + +/** + * struct BITMAP_ATTR - Attribute: Bitmap (0xb0). + * + * Contains an array of bits (aka a bitfield). + * + * When used in conjunction with the index allocation attribute, each bit + * corresponds to one index block within the index allocation attribute. Thus + * the number of bits in the bitmap * index block size / cluster size is the + * number of clusters in the index allocation attribute. + */ +typedef struct { + u8 bitmap[0]; /* Array of bits. */ +} __attribute__((__packed__)) BITMAP_ATTR; + +/** + * enum PREDEFINED_REPARSE_TAGS - + * + * The reparse point tag defines the type of the reparse point. It also + * includes several flags, which further describe the reparse point. + * + * The reparse point tag is an unsigned 32-bit value divided in three parts: + * + * 1. The least significant 16 bits (i.e. bits 0 to 15) specify the type of + * the reparse point. + * 2. The 13 bits after this (i.e. bits 16 to 28) are reserved for future use. + * 3. The most significant three bits are flags describing the reparse point. + * They are defined as follows: + * bit 29: Name surrogate bit. If set, the filename is an alias for + * another object in the system. + * bit 30: High-latency bit. If set, accessing the first byte of data will + * be slow. (E.g. the data is stored on a tape drive.) + * bit 31: Microsoft bit. If set, the tag is owned by Microsoft. User + * defined tags have to use zero here. + */ +typedef enum { + IO_REPARSE_TAG_IS_ALIAS = const_cpu_to_le32(0x20000000), + IO_REPARSE_TAG_IS_HIGH_LATENCY = const_cpu_to_le32(0x40000000), + IO_REPARSE_TAG_IS_MICROSOFT = const_cpu_to_le32(0x80000000), + + IO_REPARSE_TAG_RESERVED_ZERO = const_cpu_to_le32(0x00000000), + IO_REPARSE_TAG_RESERVED_ONE = const_cpu_to_le32(0x00000001), + IO_REPARSE_TAG_RESERVED_RANGE = const_cpu_to_le32(0x00000001), + + IO_REPARSE_TAG_NSS = const_cpu_to_le32(0x68000005), + IO_REPARSE_TAG_NSS_RECOVER = const_cpu_to_le32(0x68000006), + IO_REPARSE_TAG_SIS = const_cpu_to_le32(0x68000007), + IO_REPARSE_TAG_DFS = const_cpu_to_le32(0x68000008), + + IO_REPARSE_TAG_MOUNT_POINT = const_cpu_to_le32(0x88000003), + + IO_REPARSE_TAG_HSM = const_cpu_to_le32(0xa8000004), + + IO_REPARSE_TAG_SYMBOLIC_LINK = const_cpu_to_le32(0xe8000000), + + IO_REPARSE_TAG_VALID_VALUES = const_cpu_to_le32(0xe000ffff), +} PREDEFINED_REPARSE_TAGS; + +/** + * struct REPARSE_POINT - Attribute: Reparse point (0xc0). + * + * NOTE: Can be resident or non-resident. + */ +typedef struct { + u32 reparse_tag; /* Reparse point type (inc. flags). */ + u16 reparse_data_length; /* Byte size of reparse data. */ + u16 reserved; /* Align to 8-byte boundary. */ + u8 reparse_data[0]; /* Meaning depends on reparse_tag. */ +} __attribute__((__packed__)) REPARSE_POINT; + +/** + * struct EA_INFORMATION - Attribute: Extended attribute information (0xd0). + * + * NOTE: Always resident. + */ +typedef struct { + u16 ea_length; /* Byte size of the packed extended + attributes. */ + u16 need_ea_count; /* The number of extended attributes which have + the NEED_EA bit set. */ + u32 ea_query_length; /* Byte size of the buffer required to query + the extended attributes when calling + ZwQueryEaFile() in Windows NT/2k. I.e. the + byte size of the unpacked extended + attributes. */ +} __attribute__((__packed__)) EA_INFORMATION; + +/** + * enum EA_FLAGS - Extended attribute flags (8-bit). + */ +typedef enum { + NEED_EA = 0x80, /* Indicate that the file to which the EA + belongs cannot be interpreted without + understanding the associated extended + attributes. */ +} __attribute__((__packed__)) EA_FLAGS; + +/** + * struct EA_ATTR - Attribute: Extended attribute (EA) (0xe0). + * + * Like the attribute list and the index buffer list, the EA attribute value is + * a sequence of EA_ATTR variable length records. + * + * FIXME: It appears weird that the EA name is not Unicode. Is it true? + * FIXME: It seems that name is always uppercased. Is it true? + */ +typedef struct { + u32 next_entry_offset; /* Offset to the next EA_ATTR. */ + EA_FLAGS flags; /* Flags describing the EA. */ + u8 name_length; /* Length of the name of the extended + attribute in bytes. */ + u16 value_length; /* Byte size of the EA's value. */ + u8 name[0]; /* Name of the EA. */ + u8 value[0]; /* The value of the EA. Immediately + follows the name. */ +} __attribute__((__packed__)) EA_ATTR; + +/** + * struct PROPERTY_SET - Attribute: Property set (0xf0). + * + * Intended to support Native Structure Storage (NSS) - a feature removed from + * NTFS 3.0 during beta testing. + */ +typedef struct { + /* Irrelevant as feature unused. */ +} __attribute__((__packed__)) PROPERTY_SET; + +/** + * struct LOGGED_UTILITY_STREAM - Attribute: Logged utility stream (0x100). + * + * NOTE: Can be resident or non-resident. + * + * Operations on this attribute are logged to the journal ($LogFile) like + * normal metadata changes. + * + * Used by the Encrypting File System (EFS). All encrypted files have this + * attribute with the name $EFS. See below for the relevant structures. + */ +typedef struct { + /* Can be anything the creator chooses. */ +} __attribute__((__packed__)) LOGGED_UTILITY_STREAM; + +/* + * $EFS Data Structure: + * + * The following information is about the data structures that are contained + * inside a logged utility stream (0x100) with a name of "$EFS". + * + * The stream starts with an instance of EFS_ATTR_HEADER. + * + * Next, at offsets offset_to_ddf_array and offset_to_drf_array (unless any of + * them is 0) there is a EFS_DF_ARRAY_HEADER immediately followed by a sequence + * of multiple data decryption/recovery fields. + * + * Each data decryption/recovery field starts with a EFS_DF_HEADER and the next + * one (if it exists) can be found by adding EFS_DF_HEADER->df_length bytes to + * the offset of the beginning of the current EFS_DF_HEADER. + * + * The data decryption/recovery field contains an EFS_DF_CERTIFICATE_HEADER, a + * SID, an optional GUID, an optional container name, a non-optional user name, + * and the encrypted FEK. + * + * Note all the below are best guesses so may have mistakes/inaccuracies. + * Corrections/clarifications/additions are always welcome! + * + * Ntfs.sys takes an EFS value length of <= 0x54 or > 0x40000 to BSOD, i.e. it + * is invalid. + */ + +/** + * struct EFS_ATTR_HEADER - "$EFS" header. + * + * The header of the Logged utility stream (0x100) attribute named "$EFS". + */ +typedef struct { +/* 0*/ u32 length; /* Length of EFS attribute in bytes. */ + u32 state; /* Always 0? */ + u32 version; /* Efs version. Always 2? */ + u32 crypto_api_version; /* Always 0? */ +/* 16*/ u8 unknown4[16]; /* MD5 hash of decrypted FEK? This field is + created with a call to UuidCreate() so is + unlikely to be an MD5 hash and is more + likely to be GUID of this encrytped file + or something like that. */ +/* 32*/ u8 unknown5[16]; /* MD5 hash of DDFs? */ +/* 48*/ u8 unknown6[16]; /* MD5 hash of DRFs? */ +/* 64*/ u32 offset_to_ddf_array;/* Offset in bytes to the array of data + decryption fields (DDF), see below. Zero if + no DDFs are present. */ + u32 offset_to_drf_array;/* Offset in bytes to the array of data + recovery fields (DRF), see below. Zero if + no DRFs are present. */ + u32 reserved; /* Reserved. */ +} __attribute__((__packed__)) EFS_ATTR_HEADER; + +/** + * struct EFS_DF_ARRAY_HEADER - + */ +typedef struct { + u32 df_count; /* Number of data decryption/recovery fields in + the array. */ +} __attribute__((__packed__)) EFS_DF_ARRAY_HEADER; + +/** + * struct EFS_DF_HEADER - + */ +typedef struct { +/* 0*/ u32 df_length; /* Length of this data decryption/recovery + field in bytes. */ + u32 cred_header_offset; /* Offset in bytes to the credential header. */ + u32 fek_size; /* Size in bytes of the encrypted file + encryption key (FEK). */ + u32 fek_offset; /* Offset in bytes to the FEK from the start of + the data decryption/recovery field. */ +/* 16*/ u32 unknown1; /* always 0? Might be just padding. */ +} __attribute__((__packed__)) EFS_DF_HEADER; + +/** + * struct EFS_DF_CREDENTIAL_HEADER - + */ +typedef struct { +/* 0*/ u32 cred_length; /* Length of this credential in bytes. */ + u32 sid_offset; /* Offset in bytes to the user's sid from start + of this structure. Zero if no sid is + present. */ +/* 8*/ u32 type; /* Type of this credential: + 1 = CryptoAPI container. + 2 = Unexpected type. + 3 = Certificate thumbprint. + other = Unknown type. */ + union { + /* CryptoAPI container. */ + struct { +/* 12*/ u32 container_name_offset; /* Offset in bytes to + the name of the container from start of this + structure (may not be zero). */ +/* 16*/ u32 provider_name_offset; /* Offset in bytes to + the name of the provider from start of this + structure (may not be zero). */ + u32 public_key_blob_offset; /* Offset in bytes to + the public key blob from start of this + structure. */ +/* 24*/ u32 public_key_blob_size; /* Size in bytes of + public key blob. */ + } __attribute__((__packed__)); + /* Certificate thumbprint. */ + struct { +/* 12*/ u32 cert_thumbprint_header_size; /* Size in + bytes of the header of the certificate + thumbprint. */ +/* 16*/ u32 cert_thumbprint_header_offset; /* Offset in + bytes to the header of the certificate + thumbprint from start of this structure. */ + u32 unknown1; /* Always 0? Might be padding... */ + u32 unknown2; /* Always 0? Might be padding... */ + } __attribute__((__packed__)); + } __attribute__((__packed__)); +} __attribute__((__packed__)) EFS_DF_CREDENTIAL_HEADER; + +typedef EFS_DF_CREDENTIAL_HEADER EFS_DF_CRED_HEADER; + +/** + * struct EFS_DF_CERTIFICATE_THUMBPRINT_HEADER - + */ +typedef struct { +/* 0*/ u32 thumbprint_offset; /* Offset in bytes to the thumbprint. */ + u32 thumbprint_size; /* Size of thumbprint in bytes. */ +/* 8*/ u32 container_name_offset; /* Offset in bytes to the name of the + container from start of this + structure or 0 if no name present. */ + u32 provider_name_offset; /* Offset in bytes to the name of the + cryptographic provider from start of + this structure or 0 if no name + present. */ +/* 16*/ u32 user_name_offset; /* Offset in bytes to the user name + from start of this structure or 0 if + no user name present. (This is also + known as lpDisplayInformation.) */ +} __attribute__((__packed__)) EFS_DF_CERTIFICATE_THUMBPRINT_HEADER; + +typedef EFS_DF_CERTIFICATE_THUMBPRINT_HEADER EFS_DF_CERT_THUMBPRINT_HEADER; + +typedef enum { + INTX_SYMBOLIC_LINK = + const_cpu_to_le64(0x014B4E4C78746E49ULL), /* "IntxLNK\1" */ + INTX_CHARACTER_DEVICE = + const_cpu_to_le64(0x0052484378746E49ULL), /* "IntxCHR\0" */ + INTX_BLOCK_DEVICE = + const_cpu_to_le64(0x004B4C4278746E49ULL), /* "IntxBLK\0" */ +} INTX_FILE_TYPES; + +typedef struct { + INTX_FILE_TYPES magic; /* Intx file magic. */ + union { + /* For character and block devices. */ + struct { + u64 major; /* Major device number. */ + u64 minor; /* Minor device number. */ + void *device_end[0]; /* Marker for offsetof(). */ + } __attribute__((__packed__)); + /* For symbolic links. */ + ntfschar target[0]; + } __attribute__((__packed__)); +} __attribute__((__packed__)) INTX_FILE; + +#endif /* defined _NTFS_LAYOUT_H */ diff --git a/portlibs/sources/libntfs/lcnalloc.c b/portlibs/sources/libntfs/lcnalloc.c new file mode 100644 index 00000000..a27d43a1 --- /dev/null +++ b/portlibs/sources/libntfs/lcnalloc.c @@ -0,0 +1,771 @@ +/** + * lcnalloc.c - Cluster (de)allocation code. Originated from the Linux-NTFS project. + * + * Copyright (c) 2002-2004 Anton Altaparmakov + * Copyright (c) 2004 Yura Pakhuchiy + * Copyright (c) 2004-2008 Szabolcs Szakacsits + * Copyright (c) 2008-2009 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "types.h" +#include "attrib.h" +#include "bitmap.h" +#include "debug.h" +#include "runlist.h" +#include "volume.h" +#include "lcnalloc.h" +#include "logging.h" +#include "misc.h" + +/* + * Plenty possibilities for big optimizations all over in the cluster + * allocation, however at the moment the dominant bottleneck (~ 90%) is + * the update of the mapping pairs which converges to the cubic Faulhaber's + * formula as the function of the number of extents (fragments, runs). + */ +#define NTFS_LCNALLOC_BSIZE 4096 +#define NTFS_LCNALLOC_SKIP NTFS_LCNALLOC_BSIZE + +enum { + ZONE_MFT = 1, + ZONE_DATA1 = 2, + ZONE_DATA2 = 4 +} ; + +static void ntfs_cluster_set_zone_pos(LCN start, LCN end, LCN *pos, LCN tc) +{ + ntfs_log_trace("pos: %lld tc: %lld\n", (long long)*pos, (long long)tc); + + if (tc >= end) + *pos = start; + else if (tc >= start) + *pos = tc; +} + +static void ntfs_cluster_update_zone_pos(ntfs_volume *vol, u8 zone, LCN tc) +{ + ntfs_log_trace("tc = %lld, zone = %d\n", (long long)tc, zone); + + if (zone == ZONE_MFT) + ntfs_cluster_set_zone_pos(vol->mft_lcn, vol->mft_zone_end, + &vol->mft_zone_pos, tc); + else if (zone == ZONE_DATA1) + ntfs_cluster_set_zone_pos(vol->mft_zone_end, vol->nr_clusters, + &vol->data1_zone_pos, tc); + else /* zone == ZONE_DATA2 */ + ntfs_cluster_set_zone_pos(0, vol->mft_zone_start, + &vol->data2_zone_pos, tc); +} + +/* + * Unmark full zones when a cluster has been freed in a full zone + * + * Next allocation will reuse the freed cluster + */ + +static void update_full_status(ntfs_volume *vol, LCN lcn) +{ + if (lcn >= vol->mft_zone_end) { + if (vol->full_zones & ZONE_DATA1) { + ntfs_cluster_update_zone_pos(vol, ZONE_DATA1, lcn); + vol->full_zones &= ~ZONE_DATA1; + } + } else + if (lcn < vol->mft_zone_start) { + if (vol->full_zones & ZONE_DATA2) { + ntfs_cluster_update_zone_pos(vol, ZONE_DATA2, lcn); + vol->full_zones &= ~ZONE_DATA2; + } + } else { + if (vol->full_zones & ZONE_MFT) { + ntfs_cluster_update_zone_pos(vol, ZONE_MFT, lcn); + vol->full_zones &= ~ZONE_MFT; + } + } +} + +static s64 max_empty_bit_range(unsigned char *buf, int size) +{ + int i, j, run = 0; + int max_range = 0; + s64 start_pos = -1; + + ntfs_log_trace("Entering\n"); + + i = 0; + while (i < size) { + switch (*buf) { + case 0 : + do { + buf++; + run += 8; + i++; + } while ((i < size) && !*buf); + break; + case 255 : + if (run > max_range) { + max_range = run; + start_pos = (s64)i * 8 - run; + } + run = 0; + do { + buf++; + i++; + } while ((i < size) && (*buf == 255)); + break; + default : + for (j = 0; j < 8; j++) { + + int bit = *buf & (1 << j); + + if (bit) { + if (run > max_range) { + max_range = run; + start_pos = (s64)i * 8 + (j - run); + } + run = 0; + } else + run++; + } + i++; + buf++; + + } + } + + if (run > max_range) + start_pos = (s64)i * 8 - run; + + return start_pos; +} + +static int bitmap_writeback(ntfs_volume *vol, s64 pos, s64 size, void *b, + u8 *writeback) +{ + s64 written; + + ntfs_log_trace("Entering\n"); + + if (!*writeback) + return 0; + + *writeback = 0; + + written = ntfs_attr_pwrite(vol->lcnbmp_na, pos, size, b); + if (written != size) { + if (!written) + errno = EIO; + ntfs_log_perror("Bitmap write error (%lld, %lld)", + (long long)pos, (long long)size); + return -1; + } + + return 0; +} + +/** + * ntfs_cluster_alloc - allocate clusters on an ntfs volume + * @vol: mounted ntfs volume on which to allocate the clusters + * @start_vcn: vcn to use for the first allocated cluster + * @count: number of clusters to allocate + * @start_lcn: starting lcn at which to allocate the clusters (or -1 if none) + * @zone: zone from which to allocate the clusters + * + * Allocate @count clusters preferably starting at cluster @start_lcn or at the + * current allocator position if @start_lcn is -1, on the mounted ntfs volume + * @vol. @zone is either DATA_ZONE for allocation of normal clusters and + * MFT_ZONE for allocation of clusters for the master file table, i.e. the + * $MFT/$DATA attribute. + * + * On success return a runlist describing the allocated cluster(s). + * + * On error return NULL with errno set to the error code. + * + * Notes on the allocation algorithm + * ================================= + * + * There are two data zones. First is the area between the end of the mft zone + * and the end of the volume, and second is the area between the start of the + * volume and the start of the mft zone. On unmodified/standard NTFS 1.x + * volumes, the second data zone doesn't exist due to the mft zone being + * expanded to cover the start of the volume in order to reserve space for the + * mft bitmap attribute. + * + * The complexity stems from the need of implementing the mft vs data zoned + * approach and from the fact that we have access to the lcn bitmap via up to + * NTFS_LCNALLOC_BSIZE bytes at a time, so we need to cope with crossing over + * boundaries of two buffers. Further, the fact that the allocator allows for + * caller supplied hints as to the location of where allocation should begin + * and the fact that the allocator keeps track of where in the data zones the + * next natural allocation should occur, contribute to the complexity of the + * function. But it should all be worthwhile, because this allocator: + * 1) implements MFT zone reservation + * 2) causes reduction in fragmentation. + * The code is not optimized for speed. + */ +runlist *ntfs_cluster_alloc(ntfs_volume *vol, VCN start_vcn, s64 count, + LCN start_lcn, const NTFS_CLUSTER_ALLOCATION_ZONES zone) +{ + LCN zone_start, zone_end; /* current search range */ + LCN last_read_pos, lcn; + LCN bmp_pos; /* current bit position inside the bitmap */ + LCN prev_lcn = 0, prev_run_len = 0; + s64 clusters, br; + runlist *rl = NULL, *trl; + u8 *buf, *byte, bit, writeback; + u8 pass = 1; /* 1: inside zone; 2: start of zone */ + u8 search_zone; /* 4: data2 (start) 1: mft (middle) 2: data1 (end) */ + u8 done_zones = 0; + u8 has_guess, used_zone_pos; + int err = 0, rlpos, rlsize, buf_size; + + ntfs_log_enter("Entering with count = 0x%llx, start_lcn = 0x%llx, " + "zone = %s_ZONE.\n", (long long)count, (long long) + start_lcn, zone == MFT_ZONE ? "MFT" : "DATA"); + + if (!vol || count < 0 || start_lcn < -1 || !vol->lcnbmp_na || + (s8)zone < FIRST_ZONE || zone > LAST_ZONE) { + errno = EINVAL; + ntfs_log_perror("%s: vcn: %lld, count: %lld, lcn: %lld", + __FUNCTION__, (long long)start_vcn, + (long long)count, (long long)start_lcn); + goto out; + } + + /* Return empty runlist if @count == 0 */ + if (!count) { + rl = ntfs_malloc(0x1000); + if (rl) { + rl[0].vcn = start_vcn; + rl[0].lcn = LCN_RL_NOT_MAPPED; + rl[0].length = 0; + } + goto out; + } + + buf = ntfs_malloc(NTFS_LCNALLOC_BSIZE); + if (!buf) + goto out; + /* + * If no @start_lcn was requested, use the current zone + * position otherwise use the requested @start_lcn. + */ + has_guess = 1; + zone_start = start_lcn; + + if (zone_start < 0) { + if (zone == DATA_ZONE) + zone_start = vol->data1_zone_pos; + else + zone_start = vol->mft_zone_pos; + has_guess = 0; + } + + used_zone_pos = has_guess ? 0 : 1; + + if (!zone_start || zone_start == vol->mft_zone_start || + zone_start == vol->mft_zone_end) + pass = 2; + + if (zone_start < vol->mft_zone_start) { + zone_end = vol->mft_zone_start; + search_zone = ZONE_DATA2; + } else if (zone_start < vol->mft_zone_end) { + zone_end = vol->mft_zone_end; + search_zone = ZONE_MFT; + } else { + zone_end = vol->nr_clusters; + search_zone = ZONE_DATA1; + } + + bmp_pos = zone_start; + + /* Loop until all clusters are allocated. */ + clusters = count; + rlpos = rlsize = 0; + while (1) { + /* check whether we have exhausted the current zone */ + if (search_zone & vol->full_zones) + goto zone_pass_done; + last_read_pos = bmp_pos >> 3; + br = ntfs_attr_pread(vol->lcnbmp_na, last_read_pos, + NTFS_LCNALLOC_BSIZE, buf); + if (br <= 0) { + if (!br) + goto zone_pass_done; + err = errno; + ntfs_log_perror("Reading $BITMAP failed"); + goto err_ret; + } + /* + * We might have read less than NTFS_LCNALLOC_BSIZE bytes + * if we are close to the end of the attribute. + */ + buf_size = (int)br << 3; + lcn = bmp_pos & 7; + bmp_pos &= ~7; + writeback = 0; + + while (lcn < buf_size) { + byte = buf + (lcn >> 3); + bit = 1 << (lcn & 7); + if (has_guess) { + if (*byte & bit) { + has_guess = 0; + break; + } + } else { + lcn = max_empty_bit_range(buf, br); + if (lcn < 0) + break; + has_guess = 1; + continue; + } + + /* First free bit is at lcn + bmp_pos. */ + + /* Reallocate memory if necessary. */ + if ((rlpos + 2) * (int)sizeof(runlist) >= rlsize) { + rlsize += 4096; + trl = MEM2_realloc(rl, rlsize); + if (!trl) { + err = ENOMEM; + ntfs_log_perror("realloc() failed"); + goto wb_err_ret; + } + rl = trl; + } + + /* Allocate the bitmap bit. */ + *byte |= bit; + writeback = 1; + if (vol->free_clusters <= 0) + ntfs_log_error("Non-positive free clusters " + "(%lld)!\n", + (long long)vol->free_clusters); + else + vol->free_clusters--; + + /* + * Coalesce with previous run if adjacent LCNs. + * Otherwise, append a new run. + */ + if (prev_lcn == lcn + bmp_pos - prev_run_len && rlpos) { + ntfs_log_debug("Cluster coalesce: prev_lcn: " + "%lld lcn: %lld bmp_pos: %lld " + "prev_run_len: %lld\n", + (long long)prev_lcn, + (long long)lcn, (long long)bmp_pos, + (long long)prev_run_len); + rl[rlpos - 1].length = ++prev_run_len; + } else { + if (rlpos) + rl[rlpos].vcn = rl[rlpos - 1].vcn + + prev_run_len; + else { + rl[rlpos].vcn = start_vcn; + ntfs_log_debug("Start_vcn: %lld\n", + (long long)start_vcn); + } + + rl[rlpos].lcn = prev_lcn = lcn + bmp_pos; + rl[rlpos].length = prev_run_len = 1; + rlpos++; + } + + ntfs_log_debug("RUN: %-16lld %-16lld %-16lld\n", + (long long)rl[rlpos - 1].vcn, + (long long)rl[rlpos - 1].lcn, + (long long)rl[rlpos - 1].length); + /* Done? */ + if (!--clusters) { + if (used_zone_pos) + ntfs_cluster_update_zone_pos(vol, + search_zone, lcn + bmp_pos + 1 + + NTFS_LCNALLOC_SKIP); + goto done_ret; + } + + lcn++; + } + + if (bitmap_writeback(vol, last_read_pos, br, buf, &writeback)) { + err = errno; + goto err_ret; + } + + if (!used_zone_pos) { + + used_zone_pos = 1; + + if (search_zone == ZONE_MFT) + zone_start = vol->mft_zone_pos; + else if (search_zone == ZONE_DATA1) + zone_start = vol->data1_zone_pos; + else + zone_start = vol->data2_zone_pos; + + if (!zone_start || zone_start == vol->mft_zone_start || + zone_start == vol->mft_zone_end) + pass = 2; + bmp_pos = zone_start; + } else + bmp_pos += buf_size; + + if (bmp_pos < zone_end) + continue; + +zone_pass_done: + ntfs_log_trace("Finished current zone pass(%i).\n", pass); + if (pass == 1) { + pass = 2; + zone_end = zone_start; + + if (search_zone == ZONE_MFT) + zone_start = vol->mft_zone_start; + else if (search_zone == ZONE_DATA1) + zone_start = vol->mft_zone_end; + else + zone_start = 0; + + /* Sanity check. */ + if (zone_end < zone_start) + zone_end = zone_start; + + bmp_pos = zone_start; + + continue; + } + /* pass == 2 */ +done_zones_check: + done_zones |= search_zone; + vol->full_zones |= search_zone; + if (done_zones < (ZONE_MFT + ZONE_DATA1 + ZONE_DATA2)) { + ntfs_log_trace("Switching zone.\n"); + pass = 1; + if (rlpos) { + LCN tc = rl[rlpos - 1].lcn + + rl[rlpos - 1].length + NTFS_LCNALLOC_SKIP; + + if (used_zone_pos) + ntfs_cluster_update_zone_pos(vol, + search_zone, tc); + } + + switch (search_zone) { + case ZONE_MFT: + ntfs_log_trace("Zone switch: mft -> data1\n"); +switch_to_data1_zone: search_zone = ZONE_DATA1; + zone_start = vol->data1_zone_pos; + zone_end = vol->nr_clusters; + if (zone_start == vol->mft_zone_end) + pass = 2; + break; + case ZONE_DATA1: + ntfs_log_trace("Zone switch: data1 -> data2\n"); + search_zone = ZONE_DATA2; + zone_start = vol->data2_zone_pos; + zone_end = vol->mft_zone_start; + if (!zone_start) + pass = 2; + break; + case ZONE_DATA2: + if (!(done_zones & ZONE_DATA1)) { + ntfs_log_trace("data2 -> data1\n"); + goto switch_to_data1_zone; + } + ntfs_log_trace("Zone switch: data2 -> mft\n"); + search_zone = ZONE_MFT; + zone_start = vol->mft_zone_pos; + zone_end = vol->mft_zone_end; + if (zone_start == vol->mft_zone_start) + pass = 2; + break; + } + + bmp_pos = zone_start; + + if (zone_start == zone_end) { + ntfs_log_trace("Empty zone, skipped.\n"); + goto done_zones_check; + } + + continue; + } + + ntfs_log_trace("All zones are finished, no space on device.\n"); + err = ENOSPC; + goto err_ret; + } +done_ret: + ntfs_log_debug("At done_ret.\n"); + /* Add runlist terminator element. */ + rl[rlpos].vcn = rl[rlpos - 1].vcn + rl[rlpos - 1].length; + rl[rlpos].lcn = LCN_RL_NOT_MAPPED; + rl[rlpos].length = 0; + if (bitmap_writeback(vol, last_read_pos, br, buf, &writeback)) { + err = errno; + goto err_ret; + } +done_err_ret: + free(buf); + if (err) { + errno = err; + ntfs_log_perror("Failed to allocate clusters"); + rl = NULL; + } +out: + ntfs_log_leave("\n"); + return rl; + +wb_err_ret: + ntfs_log_trace("At wb_err_ret.\n"); + if (bitmap_writeback(vol, last_read_pos, br, buf, &writeback)) + err = errno; +err_ret: + ntfs_log_trace("At err_ret.\n"); + if (rl) { + /* Add runlist terminator element. */ + rl[rlpos].vcn = rl[rlpos - 1].vcn + rl[rlpos - 1].length; + rl[rlpos].lcn = LCN_RL_NOT_MAPPED; + rl[rlpos].length = 0; + ntfs_debug_runlist_dump(rl); + ntfs_cluster_free_from_rl(vol, rl); + free(rl); + rl = NULL; + } + goto done_err_ret; +} + +/** + * ntfs_cluster_free_from_rl - free clusters from runlist + * @vol: mounted ntfs volume on which to free the clusters + * @rl: runlist from which deallocate clusters + * + * On success return 0 and on error return -1 with errno set to the error code. + */ +int ntfs_cluster_free_from_rl(ntfs_volume *vol, runlist *rl) +{ + s64 nr_freed = 0; + int ret = -1; + + ntfs_log_trace("Entering.\n"); + + for (; rl->length; rl++) { + + ntfs_log_trace("Dealloc lcn 0x%llx, len 0x%llx.\n", + (long long)rl->lcn, (long long)rl->length); + + if (rl->lcn >= 0) { + update_full_status(vol,rl->lcn); + if (ntfs_bitmap_clear_run(vol->lcnbmp_na, rl->lcn, + rl->length)) { + ntfs_log_perror("Cluster deallocation failed " + "(%lld, %lld)", + (long long)rl->lcn, + (long long)rl->length); + goto out; + } + nr_freed += rl->length ; + } + } + + ret = 0; +out: + vol->free_clusters += nr_freed; + if (vol->free_clusters > vol->nr_clusters) + ntfs_log_error("Too many free clusters (%lld > %lld)!", + (long long)vol->free_clusters, + (long long)vol->nr_clusters); + return ret; +} + +/* + * Basic cluster run free + * Returns 0 if successful + */ + +int ntfs_cluster_free_basic(ntfs_volume *vol, s64 lcn, s64 count) +{ + s64 nr_freed = 0; + int ret = -1; + + ntfs_log_trace("Entering.\n"); + ntfs_log_trace("Dealloc lcn 0x%llx, len 0x%llx.\n", + (long long)lcn, (long long)count); + + if (lcn >= 0) { + update_full_status(vol,lcn); + if (ntfs_bitmap_clear_run(vol->lcnbmp_na, lcn, + count)) { + ntfs_log_perror("Cluster deallocation failed " + "(%lld, %lld)", + (long long)lcn, + (long long)count); + goto out; + } + nr_freed += count; + } + ret = 0; +out: + vol->free_clusters += nr_freed; + if (vol->free_clusters > vol->nr_clusters) + ntfs_log_error("Too many free clusters (%lld > %lld)!", + (long long)vol->free_clusters, + (long long)vol->nr_clusters); + return ret; +} + +/** + * ntfs_cluster_free - free clusters on an ntfs volume + * @vol: mounted ntfs volume on which to free the clusters + * @na: attribute whose runlist describes the clusters to free + * @start_vcn: vcn in @rl at which to start freeing clusters + * @count: number of clusters to free or -1 for all clusters + * + * Free @count clusters starting at the cluster @start_vcn in the runlist + * described by the attribute @na from the mounted ntfs volume @vol. + * + * If @count is -1, all clusters from @start_vcn to the end of the runlist + * are deallocated. + * + * On success return the number of deallocated clusters (not counting sparse + * clusters) and on error return -1 with errno set to the error code. + */ +int ntfs_cluster_free(ntfs_volume *vol, ntfs_attr *na, VCN start_vcn, s64 count) +{ + runlist *rl; + s64 delta, to_free, nr_freed = 0; + int ret = -1; + + if (!vol || !vol->lcnbmp_na || !na || start_vcn < 0 || + (count < 0 && count != -1)) { + ntfs_log_trace("Invalid arguments!\n"); + errno = EINVAL; + return -1; + } + + ntfs_log_enter("Entering for inode 0x%llx, attr 0x%x, count 0x%llx, " + "vcn 0x%llx.\n", (unsigned long long)na->ni->mft_no, + na->type, (long long)count, (long long)start_vcn); + + rl = ntfs_attr_find_vcn(na, start_vcn); + if (!rl) { + if (errno == ENOENT) + ret = 0; + goto leave; + } + + if (rl->lcn < 0 && rl->lcn != LCN_HOLE) { + errno = EIO; + ntfs_log_perror("%s: Unexpected lcn (%lld)", __FUNCTION__, + (long long)rl->lcn); + goto leave; + } + + /* Find the starting cluster inside the run that needs freeing. */ + delta = start_vcn - rl->vcn; + + /* The number of clusters in this run that need freeing. */ + to_free = rl->length - delta; + if (count >= 0 && to_free > count) + to_free = count; + + if (rl->lcn != LCN_HOLE) { + /* Do the actual freeing of the clusters in this run. */ + update_full_status(vol,rl->lcn + delta); + if (ntfs_bitmap_clear_run(vol->lcnbmp_na, rl->lcn + delta, + to_free)) + goto leave; + nr_freed = to_free; + } + + /* Go to the next run and adjust the number of clusters left to free. */ + ++rl; + if (count >= 0) + count -= to_free; + + /* + * Loop over the remaining runs, using @count as a capping value, and + * free them. + */ + for (; rl->length && count != 0; ++rl) { + // FIXME: Need to try ntfs_attr_map_runlist() for attribute + // list support! (AIA) + if (rl->lcn < 0 && rl->lcn != LCN_HOLE) { + // FIXME: Eeek! We need rollback! (AIA) + errno = EIO; + ntfs_log_perror("%s: Invalid lcn (%lli)", + __FUNCTION__, (long long)rl->lcn); + goto out; + } + + /* The number of clusters in this run that need freeing. */ + to_free = rl->length; + if (count >= 0 && to_free > count) + to_free = count; + + if (rl->lcn != LCN_HOLE) { + update_full_status(vol,rl->lcn); + if (ntfs_bitmap_clear_run(vol->lcnbmp_na, rl->lcn, + to_free)) { + // FIXME: Eeek! We need rollback! (AIA) + ntfs_log_perror("%s: Clearing bitmap run failed", + __FUNCTION__); + goto out; + } + nr_freed += to_free; + } + + if (count >= 0) + count -= to_free; + } + + if (count != -1 && count != 0) { + // FIXME: Eeek! BUG() + errno = EIO; + ntfs_log_perror("%s: count still not zero (%lld)", __FUNCTION__, + (long long)count); + goto out; + } + + ret = nr_freed; +out: + vol->free_clusters += nr_freed ; + if (vol->free_clusters > vol->nr_clusters) + ntfs_log_error("Too many free clusters (%lld > %lld)!", + (long long)vol->free_clusters, + (long long)vol->nr_clusters); +leave: + ntfs_log_leave("\n"); + return ret; +} diff --git a/portlibs/sources/libntfs/lcnalloc.h b/portlibs/sources/libntfs/lcnalloc.h new file mode 100644 index 00000000..cbf4c5cd --- /dev/null +++ b/portlibs/sources/libntfs/lcnalloc.h @@ -0,0 +1,51 @@ +/* + * lcnalloc.h - Exports for cluster (de)allocation. Originated from the Linux-NTFS + * project. + * + * Copyright (c) 2002 Anton Altaparmakov + * Copyright (c) 2004 Yura Pakhuchiy + * + * 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 + */ + +#ifndef _NTFS_LCNALLOC_H +#define _NTFS_LCNALLOC_H + +#include "types.h" +#include "runlist.h" +#include "volume.h" + +/** + * enum NTFS_CLUSTER_ALLOCATION_ZONES - + */ +typedef enum { + FIRST_ZONE = 0, /* For sanity checking. */ + MFT_ZONE = 0, /* Allocate from $MFT zone. */ + DATA_ZONE = 1, /* Allocate from $DATA zone. */ + LAST_ZONE = 1, /* For sanity checking. */ +} NTFS_CLUSTER_ALLOCATION_ZONES; + +extern runlist *ntfs_cluster_alloc(ntfs_volume *vol, VCN start_vcn, s64 count, + LCN start_lcn, const NTFS_CLUSTER_ALLOCATION_ZONES zone); + +extern int ntfs_cluster_free_from_rl(ntfs_volume *vol, runlist *rl); +extern int ntfs_cluster_free_basic(ntfs_volume *vol, s64 lcn, s64 count); + +extern int ntfs_cluster_free(ntfs_volume *vol, ntfs_attr *na, VCN start_vcn, + s64 count); + +#endif /* defined _NTFS_LCNALLOC_H */ + diff --git a/portlibs/sources/libntfs/logfile.c b/portlibs/sources/libntfs/logfile.c new file mode 100644 index 00000000..0f8bce96 --- /dev/null +++ b/portlibs/sources/libntfs/logfile.c @@ -0,0 +1,738 @@ +/** + * logfile.c - NTFS journal handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2002-2005 Anton Altaparmakov + * Copyright (c) 2005 Yura Pakhuchiy + * Copyright (c) 2005-2009 Szabolcs Szakacsits + * + * 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_STRING_H +#include <string.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "attrib.h" +#include "debug.h" +#include "logfile.h" +#include "volume.h" +#include "mst.h" +#include "logging.h" +#include "misc.h" + +/** + * ntfs_check_restart_page_header - check the page header for consistency + * @rp: restart page header to check + * @pos: position in logfile at which the restart page header resides + * + * Check the restart page header @rp for consistency and return TRUE if it is + * consistent and FALSE otherwise. + * + * This function only needs NTFS_BLOCK_SIZE bytes in @rp, i.e. it does not + * require the full restart page. + */ +static BOOL ntfs_check_restart_page_header(RESTART_PAGE_HEADER *rp, s64 pos) +{ + u32 logfile_system_page_size, logfile_log_page_size; + u16 ra_ofs, usa_count, usa_ofs, usa_end = 0; + BOOL have_usa = TRUE; + + ntfs_log_trace("Entering.\n"); + /* + * If the system or log page sizes are smaller than the ntfs block size + * or either is not a power of 2 we cannot handle this log file. + */ + logfile_system_page_size = le32_to_cpu(rp->system_page_size); + logfile_log_page_size = le32_to_cpu(rp->log_page_size); + if (logfile_system_page_size < NTFS_BLOCK_SIZE || + logfile_log_page_size < NTFS_BLOCK_SIZE || + logfile_system_page_size & + (logfile_system_page_size - 1) || + logfile_log_page_size & (logfile_log_page_size - 1)) { + ntfs_log_error("$LogFile uses unsupported page size.\n"); + return FALSE; + } + /* + * We must be either at !pos (1st restart page) or at pos = system page + * size (2nd restart page). + */ + if (pos && pos != logfile_system_page_size) { + ntfs_log_error("Found restart area in incorrect " + "position in $LogFile.\n"); + return FALSE; + } + /* We only know how to handle version 1.1. */ + if (sle16_to_cpu(rp->major_ver) != 1 || + sle16_to_cpu(rp->minor_ver) != 1) { + ntfs_log_error("$LogFile version %i.%i is not " + "supported. (This driver supports version " + "1.1 only.)\n", (int)sle16_to_cpu(rp->major_ver), + (int)sle16_to_cpu(rp->minor_ver)); + return FALSE; + } + /* + * If chkdsk has been run the restart page may not be protected by an + * update sequence array. + */ + if (ntfs_is_chkd_record(rp->magic) && !le16_to_cpu(rp->usa_count)) { + have_usa = FALSE; + goto skip_usa_checks; + } + /* Verify the size of the update sequence array. */ + usa_count = 1 + (logfile_system_page_size >> NTFS_BLOCK_SIZE_BITS); + if (usa_count != le16_to_cpu(rp->usa_count)) { + ntfs_log_error("$LogFile restart page specifies " + "inconsistent update sequence array count.\n"); + return FALSE; + } + /* Verify the position of the update sequence array. */ + usa_ofs = le16_to_cpu(rp->usa_ofs); + usa_end = usa_ofs + usa_count * sizeof(u16); + if (usa_ofs < sizeof(RESTART_PAGE_HEADER) || + usa_end > NTFS_BLOCK_SIZE - sizeof(u16)) { + ntfs_log_error("$LogFile restart page specifies " + "inconsistent update sequence array offset.\n"); + return FALSE; + } +skip_usa_checks: + /* + * Verify the position of the restart area. It must be: + * - aligned to 8-byte boundary, + * - after the update sequence array, and + * - within the system page size. + */ + ra_ofs = le16_to_cpu(rp->restart_area_offset); + if (ra_ofs & 7 || (have_usa ? ra_ofs < usa_end : + ra_ofs < sizeof(RESTART_PAGE_HEADER)) || + ra_ofs > logfile_system_page_size) { + ntfs_log_error("$LogFile restart page specifies " + "inconsistent restart area offset.\n"); + return FALSE; + } + /* + * Only restart pages modified by chkdsk are allowed to have chkdsk_lsn + * set. + */ + if (!ntfs_is_chkd_record(rp->magic) && sle64_to_cpu(rp->chkdsk_lsn)) { + ntfs_log_error("$LogFile restart page is not modified " + "by chkdsk but a chkdsk LSN is specified.\n"); + return FALSE; + } + ntfs_log_trace("Done.\n"); + return TRUE; +} + +/** + * ntfs_check_restart_area - check the restart area for consistency + * @rp: restart page whose restart area to check + * + * Check the restart area of the restart page @rp for consistency and return + * TRUE if it is consistent and FALSE otherwise. + * + * This function assumes that the restart page header has already been + * consistency checked. + * + * This function only needs NTFS_BLOCK_SIZE bytes in @rp, i.e. it does not + * require the full restart page. + */ +static BOOL ntfs_check_restart_area(RESTART_PAGE_HEADER *rp) +{ + u64 file_size; + RESTART_AREA *ra; + u16 ra_ofs, ra_len, ca_ofs; + u8 fs_bits; + + ntfs_log_trace("Entering.\n"); + ra_ofs = le16_to_cpu(rp->restart_area_offset); + ra = (RESTART_AREA*)((u8*)rp + ra_ofs); + /* + * Everything before ra->file_size must be before the first word + * protected by an update sequence number. This ensures that it is + * safe to access ra->client_array_offset. + */ + if (ra_ofs + offsetof(RESTART_AREA, file_size) > + NTFS_BLOCK_SIZE - sizeof(u16)) { + ntfs_log_error("$LogFile restart area specifies " + "inconsistent file offset.\n"); + return FALSE; + } + /* + * Now that we can access ra->client_array_offset, make sure everything + * up to the log client array is before the first word protected by an + * update sequence number. This ensures we can access all of the + * restart area elements safely. Also, the client array offset must be + * aligned to an 8-byte boundary. + */ + ca_ofs = le16_to_cpu(ra->client_array_offset); + if (((ca_ofs + 7) & ~7) != ca_ofs || + ra_ofs + ca_ofs > (u16)(NTFS_BLOCK_SIZE - + sizeof(u16))) { + ntfs_log_error("$LogFile restart area specifies " + "inconsistent client array offset.\n"); + return FALSE; + } + /* + * The restart area must end within the system page size both when + * calculated manually and as specified by ra->restart_area_length. + * Also, the calculated length must not exceed the specified length. + */ + ra_len = ca_ofs + le16_to_cpu(ra->log_clients) * + sizeof(LOG_CLIENT_RECORD); + if ((u32)(ra_ofs + ra_len) > le32_to_cpu(rp->system_page_size) || + (u32)(ra_ofs + le16_to_cpu(ra->restart_area_length)) > + le32_to_cpu(rp->system_page_size) || + ra_len > le16_to_cpu(ra->restart_area_length)) { + ntfs_log_error("$LogFile restart area is out of bounds " + "of the system page size specified by the " + "restart page header and/or the specified " + "restart area length is inconsistent.\n"); + return FALSE; + } + /* + * The ra->client_free_list and ra->client_in_use_list must be either + * LOGFILE_NO_CLIENT or less than ra->log_clients or they are + * overflowing the client array. + */ + if ((ra->client_free_list != LOGFILE_NO_CLIENT && + le16_to_cpu(ra->client_free_list) >= + le16_to_cpu(ra->log_clients)) || + (ra->client_in_use_list != LOGFILE_NO_CLIENT && + le16_to_cpu(ra->client_in_use_list) >= + le16_to_cpu(ra->log_clients))) { + ntfs_log_error("$LogFile restart area specifies " + "overflowing client free and/or in use lists.\n"); + return FALSE; + } + /* + * Check ra->seq_number_bits against ra->file_size for consistency. + * We cannot just use ffs() because the file size is not a power of 2. + */ + file_size = (u64)sle64_to_cpu(ra->file_size); + fs_bits = 0; + while (file_size) { + file_size >>= 1; + fs_bits++; + } + if (le32_to_cpu(ra->seq_number_bits) != (u32)(67 - fs_bits)) { + ntfs_log_error("$LogFile restart area specifies " + "inconsistent sequence number bits.\n"); + return FALSE; + } + /* The log record header length must be a multiple of 8. */ + if (((le16_to_cpu(ra->log_record_header_length) + 7) & ~7) != + le16_to_cpu(ra->log_record_header_length)) { + ntfs_log_error("$LogFile restart area specifies " + "inconsistent log record header length.\n"); + return FALSE; + } + /* Ditto for the log page data offset. */ + if (((le16_to_cpu(ra->log_page_data_offset) + 7) & ~7) != + le16_to_cpu(ra->log_page_data_offset)) { + ntfs_log_error("$LogFile restart area specifies " + "inconsistent log page data offset.\n"); + return FALSE; + } + ntfs_log_trace("Done.\n"); + return TRUE; +} + +/** + * ntfs_check_log_client_array - check the log client array for consistency + * @rp: restart page whose log client array to check + * + * Check the log client array of the restart page @rp for consistency and + * return TRUE if it is consistent and FALSE otherwise. + * + * This function assumes that the restart page header and the restart area have + * already been consistency checked. + * + * Unlike ntfs_check_restart_page_header() and ntfs_check_restart_area(), this + * function needs @rp->system_page_size bytes in @rp, i.e. it requires the full + * restart page and the page must be multi sector transfer deprotected. + */ +static BOOL ntfs_check_log_client_array(RESTART_PAGE_HEADER *rp) +{ + RESTART_AREA *ra; + LOG_CLIENT_RECORD *ca, *cr; + u16 nr_clients, idx; + BOOL in_free_list, idx_is_first; + + ntfs_log_trace("Entering.\n"); + ra = (RESTART_AREA*)((u8*)rp + le16_to_cpu(rp->restart_area_offset)); + ca = (LOG_CLIENT_RECORD*)((u8*)ra + + le16_to_cpu(ra->client_array_offset)); + /* + * Check the ra->client_free_list first and then check the + * ra->client_in_use_list. Check each of the log client records in + * each of the lists and check that the array does not overflow the + * ra->log_clients value. Also keep track of the number of records + * visited as there cannot be more than ra->log_clients records and + * that way we detect eventual loops in within a list. + */ + nr_clients = le16_to_cpu(ra->log_clients); + idx = le16_to_cpu(ra->client_free_list); + in_free_list = TRUE; +check_list: + for (idx_is_first = TRUE; idx != LOGFILE_NO_CLIENT_CPU; nr_clients--, + idx = le16_to_cpu(cr->next_client)) { + if (!nr_clients || idx >= le16_to_cpu(ra->log_clients)) + goto err_out; + /* Set @cr to the current log client record. */ + cr = ca + idx; + /* The first log client record must not have a prev_client. */ + if (idx_is_first) { + if (cr->prev_client != LOGFILE_NO_CLIENT) + goto err_out; + idx_is_first = FALSE; + } + } + /* Switch to and check the in use list if we just did the free list. */ + if (in_free_list) { + in_free_list = FALSE; + idx = le16_to_cpu(ra->client_in_use_list); + goto check_list; + } + ntfs_log_trace("Done.\n"); + return TRUE; +err_out: + ntfs_log_error("$LogFile log client array is corrupt.\n"); + return FALSE; +} + +/** + * ntfs_check_and_load_restart_page - check the restart page for consistency + * @log_na: opened ntfs attribute for journal $LogFile + * @rp: restart page to check + * @pos: position in @log_na at which the restart page resides + * @wrp: [OUT] copy of the multi sector transfer deprotected restart page + * @lsn: [OUT] set to the current logfile lsn on success + * + * Check the restart page @rp for consistency and return 0 if it is consistent + * and errno otherwise. The restart page may have been modified by chkdsk in + * which case its magic is CHKD instead of RSTR. + * + * This function only needs NTFS_BLOCK_SIZE bytes in @rp, i.e. it does not + * require the full restart page. + * + * If @wrp is not NULL, on success, *@wrp will point to a buffer containing a + * copy of the complete multi sector transfer deprotected page. On failure, + * *@wrp is undefined. + * + * Similarly, if @lsn is not NULL, on success *@lsn will be set to the current + * logfile lsn according to this restart page. On failure, *@lsn is undefined. + * + * The following error codes are defined: + * EINVAL - The restart page is inconsistent. + * ENOMEM - Not enough memory to load the restart page. + * EIO - Failed to reading from $LogFile. + */ +static int ntfs_check_and_load_restart_page(ntfs_attr *log_na, + RESTART_PAGE_HEADER *rp, s64 pos, RESTART_PAGE_HEADER **wrp, + LSN *lsn) +{ + RESTART_AREA *ra; + RESTART_PAGE_HEADER *trp; + int err; + + ntfs_log_trace("Entering.\n"); + /* Check the restart page header for consistency. */ + if (!ntfs_check_restart_page_header(rp, pos)) { + /* Error output already done inside the function. */ + return EINVAL; + } + /* Check the restart area for consistency. */ + if (!ntfs_check_restart_area(rp)) { + /* Error output already done inside the function. */ + return EINVAL; + } + ra = (RESTART_AREA*)((u8*)rp + le16_to_cpu(rp->restart_area_offset)); + /* + * Allocate a buffer to store the whole restart page so we can multi + * sector transfer deprotect it. + */ + trp = ntfs_malloc(le32_to_cpu(rp->system_page_size)); + if (!trp) + return errno; + /* + * Read the whole of the restart page into the buffer. If it fits + * completely inside @rp, just copy it from there. Otherwise read it + * from disk. + */ + if (le32_to_cpu(rp->system_page_size) <= NTFS_BLOCK_SIZE) + memcpy(trp, rp, le32_to_cpu(rp->system_page_size)); + else if (ntfs_attr_pread(log_na, pos, + le32_to_cpu(rp->system_page_size), trp) != + le32_to_cpu(rp->system_page_size)) { + err = errno; + ntfs_log_error("Failed to read whole restart page into the " + "buffer.\n"); + if (err != ENOMEM) + err = EIO; + goto err_out; + } + /* + * Perform the multi sector transfer deprotection on the buffer if the + * restart page is protected. + */ + if ((!ntfs_is_chkd_record(trp->magic) || le16_to_cpu(trp->usa_count)) + && ntfs_mst_post_read_fixup((NTFS_RECORD*)trp, + le32_to_cpu(rp->system_page_size))) { + /* + * A multi sector tranfer error was detected. We only need to + * abort if the restart page contents exceed the multi sector + * transfer fixup of the first sector. + */ + if (le16_to_cpu(rp->restart_area_offset) + + le16_to_cpu(ra->restart_area_length) > + NTFS_BLOCK_SIZE - (int)sizeof(u16)) { + ntfs_log_error("Multi sector transfer error " + "detected in $LogFile restart page.\n"); + err = EINVAL; + goto err_out; + } + } + /* + * If the restart page is modified by chkdsk or there are no active + * logfile clients, the logfile is consistent. Otherwise, need to + * check the log client records for consistency, too. + */ + err = 0; + if (ntfs_is_rstr_record(rp->magic) && + ra->client_in_use_list != LOGFILE_NO_CLIENT) { + if (!ntfs_check_log_client_array(trp)) { + err = EINVAL; + goto err_out; + } + } + if (lsn) { + if (ntfs_is_rstr_record(rp->magic)) + *lsn = sle64_to_cpu(ra->current_lsn); + else /* if (ntfs_is_chkd_record(rp->magic)) */ + *lsn = sle64_to_cpu(rp->chkdsk_lsn); + } + ntfs_log_trace("Done.\n"); + if (wrp) + *wrp = trp; + else { +err_out: + free(trp); + } + return err; +} + +/** + * ntfs_check_logfile - check in the journal if the volume is consistent + * @log_na: ntfs attribute of loaded journal $LogFile to check + * @rp: [OUT] on success this is a copy of the current restart page + * + * Check the $LogFile journal for consistency and return TRUE if it is + * consistent and FALSE if not. On success, the current restart page is + * returned in *@rp. Caller must call ntfs_free(*@rp) when finished with it. + * + * At present we only check the two restart pages and ignore the log record + * pages. + * + * Note that the MstProtected flag is not set on the $LogFile inode and hence + * when reading pages they are not deprotected. This is because we do not know + * if the $LogFile was created on a system with a different page size to ours + * yet and mst deprotection would fail if our page size is smaller. + */ +BOOL ntfs_check_logfile(ntfs_attr *log_na, RESTART_PAGE_HEADER **rp) +{ + s64 size, pos; + LSN rstr1_lsn, rstr2_lsn; + ntfs_volume *vol = log_na->ni->vol; + u8 *kaddr = NULL; + RESTART_PAGE_HEADER *rstr1_ph = NULL; + RESTART_PAGE_HEADER *rstr2_ph = NULL; + int log_page_size, log_page_mask, err; + BOOL logfile_is_empty = TRUE; + u8 log_page_bits; + + ntfs_log_trace("Entering.\n"); + /* An empty $LogFile must have been clean before it got emptied. */ + if (NVolLogFileEmpty(vol)) + goto is_empty; + size = log_na->data_size; + /* Make sure the file doesn't exceed the maximum allowed size. */ + if (size > (s64)MaxLogFileSize) + size = MaxLogFileSize; + log_page_size = DefaultLogPageSize; + log_page_mask = log_page_size - 1; + /* + * Use generic_ffs() instead of ffs() to enable the compiler to + * optimize log_page_size and log_page_bits into constants. + */ + log_page_bits = ffs(log_page_size) - 1; + size &= ~(log_page_size - 1); + + /* + * Ensure the log file is big enough to store at least the two restart + * pages and the minimum number of log record pages. + */ + if (size < log_page_size * 2 || (size - log_page_size * 2) >> + log_page_bits < MinLogRecordPages) { + ntfs_log_error("$LogFile is too small.\n"); + return FALSE; + } + /* Allocate memory for restart page. */ + kaddr = ntfs_malloc(NTFS_BLOCK_SIZE); + if (!kaddr) + return FALSE; + /* + * Read through the file looking for a restart page. Since the restart + * page header is at the beginning of a page we only need to search at + * what could be the beginning of a page (for each page size) rather + * than scanning the whole file byte by byte. If all potential places + * contain empty and uninitialized records, the log file can be assumed + * to be empty. + */ + for (pos = 0; pos < size; pos <<= 1) { + /* + * Read first NTFS_BLOCK_SIZE bytes of potential restart page. + */ + if (ntfs_attr_pread(log_na, pos, NTFS_BLOCK_SIZE, kaddr) != + NTFS_BLOCK_SIZE) { + ntfs_log_error("Failed to read first NTFS_BLOCK_SIZE " + "bytes of potential restart page.\n"); + goto err_out; + } + + /* + * A non-empty block means the logfile is not empty while an + * empty block after a non-empty block has been encountered + * means we are done. + */ + if (!ntfs_is_empty_recordp((le32*)kaddr)) + logfile_is_empty = FALSE; + else if (!logfile_is_empty) + break; + /* + * A log record page means there cannot be a restart page after + * this so no need to continue searching. + */ + if (ntfs_is_rcrd_recordp((le32*)kaddr)) + break; + /* If not a (modified by chkdsk) restart page, continue. */ + if (!ntfs_is_rstr_recordp((le32*)kaddr) && + !ntfs_is_chkd_recordp((le32*)kaddr)) { + if (!pos) + pos = NTFS_BLOCK_SIZE >> 1; + continue; + } + /* + * Check the (modified by chkdsk) restart page for consistency + * and get a copy of the complete multi sector transfer + * deprotected restart page. + */ + err = ntfs_check_and_load_restart_page(log_na, + (RESTART_PAGE_HEADER*)kaddr, pos, + !rstr1_ph ? &rstr1_ph : &rstr2_ph, + !rstr1_ph ? &rstr1_lsn : &rstr2_lsn); + if (!err) { + /* + * If we have now found the first (modified by chkdsk) + * restart page, continue looking for the second one. + */ + if (!pos) { + pos = NTFS_BLOCK_SIZE >> 1; + continue; + } + /* + * We have now found the second (modified by chkdsk) + * restart page, so we can stop looking. + */ + break; + } + /* + * Error output already done inside the function. Note, we do + * not abort if the restart page was invalid as we might still + * find a valid one further in the file. + */ + if (err != EINVAL) + goto err_out; + /* Continue looking. */ + if (!pos) + pos = NTFS_BLOCK_SIZE >> 1; + } + if (kaddr) { + free(kaddr); + kaddr = NULL; + } + if (logfile_is_empty) { + NVolSetLogFileEmpty(vol); +is_empty: + ntfs_log_trace("Done. ($LogFile is empty.)\n"); + return TRUE; + } + if (!rstr1_ph) { + if (rstr2_ph) + ntfs_log_error("BUG: rstr2_ph isn't NULL!\n"); + ntfs_log_error("Did not find any restart pages in " + "$LogFile and it was not empty.\n"); + return FALSE; + } + /* If both restart pages were found, use the more recent one. */ + if (rstr2_ph) { + /* + * If the second restart area is more recent, switch to it. + * Otherwise just throw it away. + */ + if (rstr2_lsn > rstr1_lsn) { + ntfs_log_debug("Using second restart page as it is more " + "recent.\n"); + free(rstr1_ph); + rstr1_ph = rstr2_ph; + /* rstr1_lsn = rstr2_lsn; */ + } else { + ntfs_log_debug("Using first restart page as it is more " + "recent.\n"); + free(rstr2_ph); + } + rstr2_ph = NULL; + } + /* All consistency checks passed. */ + if (rp) + *rp = rstr1_ph; + else + free(rstr1_ph); + ntfs_log_trace("Done.\n"); + return TRUE; +err_out: + free(kaddr); + free(rstr1_ph); + free(rstr2_ph); + return FALSE; +} + +/** + * ntfs_is_logfile_clean - check in the journal if the volume is clean + * @log_na: ntfs attribute of loaded journal $LogFile to check + * @rp: copy of the current restart page + * + * Analyze the $LogFile journal and return TRUE if it indicates the volume was + * shutdown cleanly and FALSE if not. + * + * At present we only look at the two restart pages and ignore the log record + * pages. This is a little bit crude in that there will be a very small number + * of cases where we think that a volume is dirty when in fact it is clean. + * This should only affect volumes that have not been shutdown cleanly but did + * not have any pending, non-check-pointed i/o, i.e. they were completely idle + * at least for the five seconds preceding the unclean shutdown. + * + * This function assumes that the $LogFile journal has already been consistency + * checked by a call to ntfs_check_logfile() and in particular if the $LogFile + * is empty this function requires that NVolLogFileEmpty() is true otherwise an + * empty volume will be reported as dirty. + */ +BOOL ntfs_is_logfile_clean(ntfs_attr *log_na, RESTART_PAGE_HEADER *rp) +{ + RESTART_AREA *ra; + + ntfs_log_trace("Entering.\n"); + /* An empty $LogFile must have been clean before it got emptied. */ + if (NVolLogFileEmpty(log_na->ni->vol)) { + ntfs_log_trace("$LogFile is empty\n"); + return TRUE; + } + if (!rp) { + ntfs_log_error("Restart page header is NULL\n"); + return FALSE; + } + if (!ntfs_is_rstr_record(rp->magic) && + !ntfs_is_chkd_record(rp->magic)) { + ntfs_log_error("Restart page buffer is invalid\n"); + return FALSE; + } + + ra = (RESTART_AREA*)((u8*)rp + le16_to_cpu(rp->restart_area_offset)); + /* + * If the $LogFile has active clients, i.e. it is open, and we do not + * have the RESTART_VOLUME_IS_CLEAN bit set in the restart area flags, + * we assume there was an unclean shutdown. + */ + if (ra->client_in_use_list != LOGFILE_NO_CLIENT && + !(ra->flags & RESTART_VOLUME_IS_CLEAN)) { + ntfs_log_error("The disk contains an unclean file system (%d, " + "%d).\n", le16_to_cpu(ra->client_in_use_list), + le16_to_cpu(ra->flags)); + return FALSE; + } + /* $LogFile indicates a clean shutdown. */ + ntfs_log_trace("$LogFile indicates a clean shutdown\n"); + return TRUE; +} + +/** + * ntfs_empty_logfile - empty the contents of the $LogFile journal + * @na: ntfs attribute of journal $LogFile to empty + * + * Empty the contents of the $LogFile journal @na and return 0 on success and + * -1 on error. + * + * This function assumes that the $LogFile journal has already been consistency + * checked by a call to ntfs_check_logfile() and that ntfs_is_logfile_clean() + * has been used to ensure that the $LogFile is clean. + */ +int ntfs_empty_logfile(ntfs_attr *na) +{ + s64 pos, count; + char buf[NTFS_BUF_SIZE]; + + ntfs_log_trace("Entering.\n"); + + if (NVolLogFileEmpty(na->ni->vol)) + return 0; + + if (!NAttrNonResident(na)) { + errno = EIO; + ntfs_log_perror("Resident $LogFile $DATA attribute"); + return -1; + } + + memset(buf, -1, NTFS_BUF_SIZE); + + pos = 0; + while ((count = na->data_size - pos) > 0) { + + if (count > NTFS_BUF_SIZE) + count = NTFS_BUF_SIZE; + + count = ntfs_attr_pwrite(na, pos, count, buf); + if (count <= 0) { + ntfs_log_perror("Failed to reset $LogFile"); + if (count != -1) + errno = EIO; + return -1; + } + pos += count; + if(pos>=64*1024) break; //only clear first 64kb + } + + NVolSetLogFileEmpty(na->ni->vol); + + return 0; +} diff --git a/portlibs/sources/libntfs/logfile.h b/portlibs/sources/libntfs/logfile.h new file mode 100644 index 00000000..798d562d --- /dev/null +++ b/portlibs/sources/libntfs/logfile.h @@ -0,0 +1,394 @@ +/* + * logfile.h - Exports for $LogFile handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2005 Anton Altaparmakov + * + * 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 + */ + +#ifndef _NTFS_LOGFILE_H +#define _NTFS_LOGFILE_H + +#include "types.h" +#include "endians.h" +#include "layout.h" + +/* + * Journal ($LogFile) organization: + * + * Two restart areas present in the first two pages (restart pages, one restart + * area in each page). When the volume is dismounted they should be identical, + * except for the update sequence array which usually has a different update + * sequence number. + * + * These are followed by log records organized in pages headed by a log record + * header going up to log file size. Not all pages contain log records when a + * volume is first formatted, but as the volume ages, all records will be used. + * When the log file fills up, the records at the beginning are purged (by + * modifying the oldest_lsn to a higher value presumably) and writing begins + * at the beginning of the file. Effectively, the log file is viewed as a + * circular entity. + * + * NOTE: Windows NT, 2000, and XP all use log file version 1.1 but they accept + * versions <= 1.x, including 0.-1. (Yes, that is a minus one in there!) We + * probably only want to support 1.1 as this seems to be the current version + * and we don't know how that differs from the older versions. The only + * exception is if the journal is clean as marked by the two restart pages + * then it doesn't matter whether we are on an earlier version. We can just + * reinitialize the logfile and start again with version 1.1. + */ + +/* Some $LogFile related constants. */ +#define MaxLogFileSize 0x100000000ULL +#define DefaultLogPageSize 4096 +#define MinLogRecordPages 48 + +/** + * struct RESTART_PAGE_HEADER - Log file restart page header. + * + * Begins the restart area. + */ +typedef struct { +/*Ofs*/ +/* 0 NTFS_RECORD; -- Unfolded here as gcc doesn't like unnamed structs. */ +/* 0*/ NTFS_RECORD_TYPES magic;/* The magic is "RSTR". */ +/* 4*/ le16 usa_ofs; /* See NTFS_RECORD definition in layout.h. + When creating, set this to be immediately + after this header structure (without any + alignment). */ +/* 6*/ le16 usa_count; /* See NTFS_RECORD definition in layout.h. */ + +/* 8*/ leLSN chkdsk_lsn; /* The last log file sequence number found by + chkdsk. Only used when the magic is changed + to "CHKD". Otherwise this is zero. */ +/* 16*/ le32 system_page_size; /* Byte size of system pages when the log file + was created, has to be >= 512 and a power of + 2. Use this to calculate the required size + of the usa (usa_count) and add it to usa_ofs. + Then verify that the result is less than the + value of the restart_area_offset. */ +/* 20*/ le32 log_page_size; /* Byte size of log file pages, has to be >= + 512 and a power of 2. The default is 4096 + and is used when the system page size is + between 4096 and 8192. Otherwise this is + set to the system page size instead. */ +/* 24*/ le16 restart_area_offset;/* Byte offset from the start of this header to + the RESTART_AREA. Value has to be aligned + to 8-byte boundary. When creating, set this + to be after the usa. */ +/* 26*/ sle16 minor_ver; /* Log file minor version. Only check if major + version is 1. */ +/* 28*/ sle16 major_ver; /* Log file major version. We only support + version 1.1. */ +/* sizeof() = 30 (0x1e) bytes */ +} __attribute__((__packed__)) RESTART_PAGE_HEADER; + +/* + * Constant for the log client indices meaning that there are no client records + * in this particular client array. Also inside the client records themselves, + * this means that there are no client records preceding or following this one. + */ +#define LOGFILE_NO_CLIENT const_cpu_to_le16(0xffff) +#define LOGFILE_NO_CLIENT_CPU 0xffff + +/* + * These are the so far known RESTART_AREA_* flags (16-bit) which contain + * information about the log file in which they are present. + */ +enum { + RESTART_VOLUME_IS_CLEAN = const_cpu_to_le16(0x0002), + RESTART_SPACE_FILLER = 0xffff, /* gcc: Force enum bit width to 16. */ +} __attribute__((__packed__)); + +typedef le16 RESTART_AREA_FLAGS; + +/** + * struct RESTART_AREA - Log file restart area record. + * + * The offset of this record is found by adding the offset of the + * RESTART_PAGE_HEADER to the restart_area_offset value found in it. + * See notes at restart_area_offset above. + */ +typedef struct { +/*Ofs*/ +/* 0*/ leLSN current_lsn; /* The current, i.e. last LSN inside the log + when the restart area was last written. + This happens often but what is the interval? + Is it just fixed time or is it every time a + check point is written or something else? + On create set to 0. */ +/* 8*/ le16 log_clients; /* Number of log client records in the array of + log client records which follows this + restart area. Must be 1. */ +/* 10*/ le16 client_free_list; /* The index of the first free log client record + in the array of log client records. + LOGFILE_NO_CLIENT means that there are no + free log client records in the array. + If != LOGFILE_NO_CLIENT, check that + log_clients > client_free_list. On Win2k + and presumably earlier, on a clean volume + this is != LOGFILE_NO_CLIENT, and it should + be 0, i.e. the first (and only) client + record is free and thus the logfile is + closed and hence clean. A dirty volume + would have left the logfile open and hence + this would be LOGFILE_NO_CLIENT. On WinXP + and presumably later, the logfile is always + open, even on clean shutdown so this should + always be LOGFILE_NO_CLIENT. */ +/* 12*/ le16 client_in_use_list;/* The index of the first in-use log client + record in the array of log client records. + LOGFILE_NO_CLIENT means that there are no + in-use log client records in the array. If + != LOGFILE_NO_CLIENT check that log_clients + > client_in_use_list. On Win2k and + presumably earlier, on a clean volume this + is LOGFILE_NO_CLIENT, i.e. there are no + client records in use and thus the logfile + is closed and hence clean. A dirty volume + would have left the logfile open and hence + this would be != LOGFILE_NO_CLIENT, and it + should be 0, i.e. the first (and only) + client record is in use. On WinXP and + presumably later, the logfile is always + open, even on clean shutdown so this should + always be 0. */ +/* 14*/ RESTART_AREA_FLAGS flags;/* Flags modifying LFS behaviour. On Win2k + and presumably earlier this is always 0. On + WinXP and presumably later, if the logfile + was shutdown cleanly, the second bit, + RESTART_VOLUME_IS_CLEAN, is set. This bit + is cleared when the volume is mounted by + WinXP and set when the volume is dismounted, + thus if the logfile is dirty, this bit is + clear. Thus we don't need to check the + Windows version to determine if the logfile + is clean. Instead if the logfile is closed, + we know it must be clean. If it is open and + this bit is set, we also know it must be + clean. If on the other hand the logfile is + open and this bit is clear, we can be almost + certain that the logfile is dirty. */ +/* 16*/ le32 seq_number_bits; /* How many bits to use for the sequence + number. This is calculated as 67 - the + number of bits required to store the logfile + size in bytes and this can be used in with + the specified file_size as a consistency + check. */ +/* 20*/ le16 restart_area_length;/* Length of the restart area including the + client array. Following checks required if + version matches. Otherwise, skip them. + restart_area_offset + restart_area_length + has to be <= system_page_size. Also, + restart_area_length has to be >= + client_array_offset + (log_clients * + sizeof(log client record)). */ +/* 22*/ le16 client_array_offset;/* Offset from the start of this record to + the first log client record if versions are + matched. When creating, set this to be + after this restart area structure, aligned + to 8-bytes boundary. If the versions do not + match, this is ignored and the offset is + assumed to be (sizeof(RESTART_AREA) + 7) & + ~7, i.e. rounded up to first 8-byte + boundary. Either way, client_array_offset + has to be aligned to an 8-byte boundary. + Also, restart_area_offset + + client_array_offset has to be <= 510. + Finally, client_array_offset + (log_clients + * sizeof(log client record)) has to be <= + system_page_size. On Win2k and presumably + earlier, this is 0x30, i.e. immediately + following this record. On WinXP and + presumably later, this is 0x40, i.e. there + are 16 extra bytes between this record and + the client array. This probably means that + the RESTART_AREA record is actually bigger + in WinXP and later. */ +/* 24*/ sle64 file_size; /* Usable byte size of the log file. If the + restart_area_offset + the offset of the + file_size are > 510 then corruption has + occurred. This is the very first check when + starting with the restart_area as if it + fails it means that some of the above values + will be corrupted by the multi sector + transfer protection. The file_size has to + be rounded down to be a multiple of the + log_page_size in the RESTART_PAGE_HEADER and + then it has to be at least big enough to + store the two restart pages and 48 (0x30) + log record pages. */ +/* 32*/ le32 last_lsn_data_length;/* Length of data of last LSN, not including + the log record header. On create set to + 0. */ +/* 36*/ le16 log_record_header_length;/* Byte size of the log record header. + If the version matches then check that the + value of log_record_header_length is a + multiple of 8, i.e. + (log_record_header_length + 7) & ~7 == + log_record_header_length. When creating set + it to sizeof(LOG_RECORD_HEADER), aligned to + 8 bytes. */ +/* 38*/ le16 log_page_data_offset;/* Offset to the start of data in a log record + page. Must be a multiple of 8. On create + set it to immediately after the update + sequence array of the log record page. */ +/* 40*/ le32 restart_log_open_count;/* A counter that gets incremented every + time the logfile is restarted which happens + at mount time when the logfile is opened. + When creating set to a random value. Win2k + sets it to the low 32 bits of the current + system time in NTFS format (see time.h). */ +/* 44*/ le32 reserved; /* Reserved/alignment to 8-byte boundary. */ +/* sizeof() = 48 (0x30) bytes */ +} __attribute__((__packed__)) RESTART_AREA; + +/** + * struct LOG_CLIENT_RECORD - Log client record. + * + * The offset of this record is found by adding the offset of the + * RESTART_AREA to the client_array_offset value found in it. + */ +typedef struct { +/*Ofs*/ +/* 0*/ leLSN oldest_lsn; /* Oldest LSN needed by this client. On create + set to 0. */ +/* 8*/ leLSN client_restart_lsn;/* LSN at which this client needs to restart + the volume, i.e. the current position within + the log file. At present, if clean this + should = current_lsn in restart area but it + probably also = current_lsn when dirty most + of the time. At create set to 0. */ +/* 16*/ le16 prev_client; /* The offset to the previous log client record + in the array of log client records. + LOGFILE_NO_CLIENT means there is no previous + client record, i.e. this is the first one. + This is always LOGFILE_NO_CLIENT. */ +/* 18*/ le16 next_client; /* The offset to the next log client record in + the array of log client records. + LOGFILE_NO_CLIENT means there are no next + client records, i.e. this is the last one. + This is always LOGFILE_NO_CLIENT. */ +/* 20*/ le16 seq_number; /* On Win2k and presumably earlier, this is set + to zero every time the logfile is restarted + and it is incremented when the logfile is + closed at dismount time. Thus it is 0 when + dirty and 1 when clean. On WinXP and + presumably later, this is always 0. */ +/* 22*/ u8 reserved[6]; /* Reserved/alignment. */ +/* 28*/ le32 client_name_length;/* Length of client name in bytes. Should + always be 8. */ +/* 32*/ ntfschar client_name[64];/* Name of the client in Unicode. Should + always be "NTFS" with the remaining bytes + set to 0. */ +/* sizeof() = 160 (0xa0) bytes */ +} __attribute__((__packed__)) LOG_CLIENT_RECORD; + +/** + * struct RECORD_PAGE_HEADER - Log page record page header. + * + * Each log page begins with this header and is followed by several LOG_RECORD + * structures, starting at offset 0x40 (the size of this structure and the + * following update sequence array and then aligned to 8 byte boundary, but is + * this specified anywhere?). + */ +typedef struct { +/* 0 NTFS_RECORD; -- Unfolded here as gcc doesn't like unnamed structs. */ + NTFS_RECORD_TYPES magic;/* Usually the magic is "RCRD". */ + u16 usa_ofs; /* See NTFS_RECORD definition in layout.h. + When creating, set this to be immediately + after this header structure (without any + alignment). */ + u16 usa_count; /* See NTFS_RECORD definition in layout.h. */ + + union { + LSN last_lsn; + s64 file_offset; + } __attribute__((__packed__)) copy; + u32 flags; + u16 page_count; + u16 page_position; + union { + struct { + u16 next_record_offset; + u8 reserved[6]; + LSN last_end_lsn; + } __attribute__((__packed__)) packed; + } __attribute__((__packed__)) header; +} __attribute__((__packed__)) RECORD_PAGE_HEADER; + +/** + * enum LOG_RECORD_FLAGS - Possible 16-bit flags for log records. + * + * (Or is it log record pages?) + */ +typedef enum { + LOG_RECORD_MULTI_PAGE = const_cpu_to_le16(0x0001), /* ??? */ + LOG_RECORD_SIZE_PLACE_HOLDER = 0xffff, + /* This has nothing to do with the log record. It is only so + gcc knows to make the flags 16-bit. */ +} __attribute__((__packed__)) LOG_RECORD_FLAGS; + +/** + * struct LOG_CLIENT_ID - The log client id structure identifying a log client. + */ +typedef struct { + u16 seq_number; + u16 client_index; +} __attribute__((__packed__)) LOG_CLIENT_ID; + +/** + * struct LOG_RECORD - Log record header. + * + * Each log record seems to have a constant size of 0x70 bytes. + */ +typedef struct { + LSN this_lsn; + LSN client_previous_lsn; + LSN client_undo_next_lsn; + u32 client_data_length; + LOG_CLIENT_ID client_id; + u32 record_type; + u32 transaction_id; + u16 flags; + u16 reserved_or_alignment[3]; +/* Now are at ofs 0x30 into struct. */ + u16 redo_operation; + u16 undo_operation; + u16 redo_offset; + u16 redo_length; + u16 undo_offset; + u16 undo_length; + u16 target_attribute; + u16 lcns_to_follow; /* Number of lcn_list entries + following this entry. */ +/* Now at ofs 0x40. */ + u16 record_offset; + u16 attribute_offset; + u32 alignment_or_reserved; + VCN target_vcn; +/* Now at ofs 0x50. */ + struct { /* Only present if lcns_to_follow + is not 0. */ + LCN lcn; + } __attribute__((__packed__)) lcn_list[0]; +} __attribute__((__packed__)) LOG_RECORD; + +extern BOOL ntfs_check_logfile(ntfs_attr *log_na, RESTART_PAGE_HEADER **rp); +extern BOOL ntfs_is_logfile_clean(ntfs_attr *log_na, RESTART_PAGE_HEADER *rp); +extern int ntfs_empty_logfile(ntfs_attr *na); + +#endif /* defined _NTFS_LOGFILE_H */ diff --git a/portlibs/sources/libntfs/logging.c b/portlibs/sources/libntfs/logging.c new file mode 100644 index 00000000..ccccbb8f --- /dev/null +++ b/portlibs/sources/libntfs/logging.c @@ -0,0 +1,637 @@ +/** + * logging.c - Centralised logging. Originated from the Linux-NTFS project. + * + * Copyright (c) 2005 Richard Russon + * Copyright (c) 2005-2008 Szabolcs Szakacsits + * Copyright (c) 2010 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_STDARG_H +#include <stdarg.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_SYSLOG_H +#include <syslog.h> +#endif + +#include "logging.h" +#include "misc.h" + +#ifndef PATH_SEP +#define PATH_SEP '/' +#endif + +#ifdef DEBUG +static int tab; +#endif + +/* Some gcc 3.x, 4.[01].X crash with internal compiler error. */ +#if __GNUC__ <= 3 || (__GNUC__ == 4 && __GNUC_MINOR__ <= 1) +# define BROKEN_GCC_FORMAT_ATTRIBUTE +#else +# define BROKEN_GCC_FORMAT_ATTRIBUTE __attribute__((format(printf, 6, 0))) +#endif + +/** + * struct ntfs_logging - Control info for the logging system + * @levels: Bitfield of logging levels + * @flags: Flags which affect the output style + * @handler: Function to perform the actual logging + */ +struct ntfs_logging { + u32 levels; + u32 flags; + ntfs_log_handler *handler BROKEN_GCC_FORMAT_ATTRIBUTE; +}; + +/** + * ntfs_log + * This struct controls all the logging within the library and tools. + */ +static struct ntfs_logging ntfs_log = { +#ifdef DEBUG + NTFS_LOG_LEVEL_DEBUG | NTFS_LOG_LEVEL_TRACE | NTFS_LOG_LEVEL_ENTER | + NTFS_LOG_LEVEL_LEAVE | +#endif + NTFS_LOG_LEVEL_INFO | NTFS_LOG_LEVEL_QUIET | NTFS_LOG_LEVEL_WARNING | + NTFS_LOG_LEVEL_ERROR | NTFS_LOG_LEVEL_PERROR | NTFS_LOG_LEVEL_CRITICAL | + NTFS_LOG_LEVEL_PROGRESS, + NTFS_LOG_FLAG_ONLYNAME, +#ifdef DEBUG + ntfs_log_handler_outerr +#else + ntfs_log_handler_null +#endif +}; + + +/** + * ntfs_log_get_levels - Get a list of the current logging levels + * + * Find out which logging levels are enabled. + * + * Returns: Log levels in a 32-bit field + */ +u32 ntfs_log_get_levels(void) +{ + return ntfs_log.levels; +} + +/** + * ntfs_log_set_levels - Enable extra logging levels + * @levels: 32-bit field of log levels to set + * + * Enable one or more logging levels. + * The logging levels are named: NTFS_LOG_LEVEL_*. + * + * Returns: Log levels that were enabled before the call + */ +u32 ntfs_log_set_levels(u32 levels) +{ + u32 old; + old = ntfs_log.levels; + ntfs_log.levels |= levels; + return old; +} + +/** + * ntfs_log_clear_levels - Disable some logging levels + * @levels: 32-bit field of log levels to clear + * + * Disable one or more logging levels. + * The logging levels are named: NTFS_LOG_LEVEL_*. + * + * Returns: Log levels that were enabled before the call + */ +u32 ntfs_log_clear_levels(u32 levels) +{ + u32 old; + old = ntfs_log.levels; + ntfs_log.levels &= (~levels); + return old; +} + + +/** + * ntfs_log_get_flags - Get a list of logging style flags + * + * Find out which logging flags are enabled. + * + * Returns: Logging flags in a 32-bit field + */ +u32 ntfs_log_get_flags(void) +{ + return ntfs_log.flags; +} + +/** + * ntfs_log_set_flags - Enable extra logging style flags + * @flags: 32-bit field of logging flags to set + * + * Enable one or more logging flags. + * The log flags are named: NTFS_LOG_LEVEL_*. + * + * Returns: Logging flags that were enabled before the call + */ +u32 ntfs_log_set_flags(u32 flags) +{ + u32 old; + old = ntfs_log.flags; + ntfs_log.flags |= flags; + return old; +} + +/** + * ntfs_log_clear_flags - Disable some logging styles + * @flags: 32-bit field of logging flags to clear + * + * Disable one or more logging flags. + * The log flags are named: NTFS_LOG_LEVEL_*. + * + * Returns: Logging flags that were enabled before the call + */ +u32 ntfs_log_clear_flags(u32 flags) +{ + u32 old; + old = ntfs_log.flags; + ntfs_log.flags &= (~flags); + return old; +} + + +/** + * ntfs_log_get_stream - Default output streams for logging levels + * @level: Log level + * + * By default, urgent messages are sent to "stderr". + * Other messages are sent to "stdout". + * + * Returns: "string" Prefix to be used + */ +static FILE * ntfs_log_get_stream(u32 level) +{ + FILE *stream; + + switch (level) { + case NTFS_LOG_LEVEL_INFO: + case NTFS_LOG_LEVEL_QUIET: + case NTFS_LOG_LEVEL_PROGRESS: + case NTFS_LOG_LEVEL_VERBOSE: + stream = stdout; + break; + + case NTFS_LOG_LEVEL_DEBUG: + case NTFS_LOG_LEVEL_TRACE: + case NTFS_LOG_LEVEL_ENTER: + case NTFS_LOG_LEVEL_LEAVE: + case NTFS_LOG_LEVEL_WARNING: + case NTFS_LOG_LEVEL_ERROR: + case NTFS_LOG_LEVEL_CRITICAL: + case NTFS_LOG_LEVEL_PERROR: + default: + stream = stderr; + break; + } + + return stream; +} + +/** + * ntfs_log_get_prefix - Default prefixes for logging levels + * @level: Log level to be prefixed + * + * Prefixing the logging output can make it easier to parse. + * + * Returns: "string" Prefix to be used + */ +static const char * ntfs_log_get_prefix(u32 level) +{ + const char *prefix; + + switch (level) { + case NTFS_LOG_LEVEL_DEBUG: + prefix = "DEBUG: "; + break; + case NTFS_LOG_LEVEL_TRACE: + prefix = "TRACE: "; + break; + case NTFS_LOG_LEVEL_QUIET: + prefix = "QUIET: "; + break; + case NTFS_LOG_LEVEL_INFO: + prefix = "INFO: "; + break; + case NTFS_LOG_LEVEL_VERBOSE: + prefix = "VERBOSE: "; + break; + case NTFS_LOG_LEVEL_PROGRESS: + prefix = "PROGRESS: "; + break; + case NTFS_LOG_LEVEL_WARNING: + prefix = "WARNING: "; + break; + case NTFS_LOG_LEVEL_ERROR: + prefix = "ERROR: "; + break; + case NTFS_LOG_LEVEL_PERROR: + prefix = "ERROR: "; + break; + case NTFS_LOG_LEVEL_CRITICAL: + prefix = "CRITICAL: "; + break; + default: + prefix = ""; + break; + } + + return prefix; +} + + +/** + * ntfs_log_set_handler - Provide an alternate logging handler + * @handler: function to perform the logging + * + * This alternate handler will be called for all future logging requests. + * If no @handler is specified, logging will revert to the default handler. + */ +void ntfs_log_set_handler(ntfs_log_handler *handler) +{ + if (handler) { + ntfs_log.handler = handler; +#ifdef HAVE_SYSLOG_H + if (handler == ntfs_log_handler_syslog) + openlog("ntfs-3g", LOG_PID, LOG_USER); +#endif + } else + ntfs_log.handler = ntfs_log_handler_null; +} + +/** + * ntfs_log_redirect - Pass on the request to the real handler + * @function: Function in which the log line occurred + * @file: File in which the log line occurred + * @line: Line number on which the log line occurred + * @level: Level at which the line is logged + * @data: User specified data, possibly specific to a handler + * @format: printf-style formatting string + * @...: Arguments to be formatted + * + * This is just a redirector function. The arguments are simply passed to the + * main logging handler (as defined in the global logging struct @ntfs_log). + * + * Returns: -1 Error occurred + * 0 Message wasn't logged + * num Number of output characters + */ +int ntfs_log_redirect(const char *function, const char *file, + int line, u32 level, void *data, const char *format, ...) +{ + int olderr = errno; + int ret; + va_list args; + + if (!(ntfs_log.levels & level)) /* Don't log this message */ + return 0; + + va_start(args, format); + errno = olderr; + ret = ntfs_log.handler(function, file, line, level, data, format, args); + va_end(args); + + errno = olderr; + return ret; +} + + +/** + * ntfs_log_handler_syslog - syslog logging handler + * @function: Function in which the log line occurred + * @file: File in which the log line occurred + * @line: Line number on which the log line occurred + * @level: Level at which the line is logged + * @data: User specified data, possibly specific to a handler + * @format: printf-style formatting string + * @args: Arguments to be formatted + * + * A simple syslog logging handler. Ignores colors. + * + * Returns: -1 Error occurred + * 0 Message wasn't logged + * num Number of output characters + */ + + +#ifdef HAVE_SYSLOG_H + +#define LOG_LINE_LEN 512 + +int ntfs_log_handler_syslog(const char *function __attribute__((unused)), + const char *file __attribute__((unused)), + int line __attribute__((unused)), u32 level, + void *data __attribute__((unused)), + const char *format, va_list args) +{ + char logbuf[LOG_LINE_LEN]; + int ret, olderr = errno; + +#ifndef DEBUG + if ((level & NTFS_LOG_LEVEL_PERROR) && errno == ENOSPC) + return 1; +#endif + ret = vsnprintf(logbuf, LOG_LINE_LEN, format, args); + if (ret < 0) { + vsyslog(LOG_NOTICE, format, args); + ret = 1; + goto out; + } + + if ((LOG_LINE_LEN > ret + 3) && (level & NTFS_LOG_LEVEL_PERROR)) { + strncat(logbuf, ": ", LOG_LINE_LEN - ret - 1); + strncat(logbuf, strerror(olderr), LOG_LINE_LEN - (ret + 3)); + ret = strlen(logbuf); + } + + syslog(LOG_NOTICE, "%s", logbuf); +out: + errno = olderr; + return ret; +} +#endif + +/* + * Early logging before the logs are redirected + * + * (not quite satisfactory : this appears before the ntfs-g banner, + * and with a different pid) + */ + +void ntfs_log_early_error(const char *format, ...) +{ + va_list args; + + va_start(args, format); +#ifdef HAVE_SYSLOG_H + openlog("ntfs-3g", LOG_PID, LOG_USER); + ntfs_log_handler_syslog(NULL, NULL, 0, + NTFS_LOG_LEVEL_ERROR, NULL, + format, args); +#else + vfprintf(stderr,format,args); +#endif + va_end(args); +} + +/** + * ntfs_log_handler_fprintf - Basic logging handler + * @function: Function in which the log line occurred + * @file: File in which the log line occurred + * @line: Line number on which the log line occurred + * @level: Level at which the line is logged + * @data: User specified data, possibly specific to a handler + * @format: printf-style formatting string + * @args: Arguments to be formatted + * + * A simple logging handler. This is where the log line is finally displayed. + * It is more likely that you will want to set the handler to either + * ntfs_log_handler_outerr or ntfs_log_handler_stderr. + * + * Note: For this handler, @data is a pointer to a FILE output stream. + * If @data is NULL, nothing will be displayed. + * + * Returns: -1 Error occurred + * 0 Message wasn't logged + * num Number of output characters + */ +int ntfs_log_handler_fprintf(const char *function, const char *file, + int line, u32 level, void *data, const char *format, va_list args) +{ +#ifdef DEBUG + int i; +#endif + int ret = 0; + int olderr = errno; + FILE *stream; + + if (!data) /* Interpret data as a FILE stream. */ + return 0; /* If it's NULL, we can't do anything. */ + stream = (FILE*)data; + +#ifdef DEBUG + if (level == NTFS_LOG_LEVEL_LEAVE) { + if (tab) + tab--; + return 0; + } + + for (i = 0; i < tab; i++) + ret += fprintf(stream, " "); +#endif + if ((ntfs_log.flags & NTFS_LOG_FLAG_ONLYNAME) && + (strchr(file, PATH_SEP))) /* Abbreviate the filename */ + file = strrchr(file, PATH_SEP) + 1; + + if (ntfs_log.flags & NTFS_LOG_FLAG_PREFIX) /* Prefix the output */ + ret += fprintf(stream, "%s", ntfs_log_get_prefix(level)); + + if (ntfs_log.flags & NTFS_LOG_FLAG_FILENAME) /* Source filename */ + ret += fprintf(stream, "%s ", file); + + if (ntfs_log.flags & NTFS_LOG_FLAG_LINE) /* Source line number */ + ret += fprintf(stream, "(%d) ", line); + + if ((ntfs_log.flags & NTFS_LOG_FLAG_FUNCTION) || /* Source function */ + (level & NTFS_LOG_LEVEL_TRACE) || (level & NTFS_LOG_LEVEL_ENTER)) + ret += fprintf(stream, "%s(): ", function); + + ret += vfprintf(stream, format, args); + + if (level & NTFS_LOG_LEVEL_PERROR) + ret += fprintf(stream, ": %s\n", strerror(olderr)); + +#ifdef DEBUG + if (level == NTFS_LOG_LEVEL_ENTER) + tab++; +#endif + fflush(stream); + errno = olderr; + return ret; +} + +/** + * ntfs_log_handler_null - Null logging handler (no output) + * @function: Function in which the log line occurred + * @file: File in which the log line occurred + * @line: Line number on which the log line occurred + * @level: Level at which the line is logged + * @data: User specified data, possibly specific to a handler + * @format: printf-style formatting string + * @args: Arguments to be formatted + * + * This handler produces no output. It provides a way to temporarily disable + * logging, without having to change the levels and flags. + * + * Returns: 0 Message wasn't logged + */ +int ntfs_log_handler_null(const char *function __attribute__((unused)), const char *file __attribute__((unused)), + int line __attribute__((unused)), u32 level __attribute__((unused)), void *data __attribute__((unused)), + const char *format __attribute__((unused)), va_list args __attribute__((unused))) +{ + return 0; +} + +/** + * ntfs_log_handler_stdout - All logs go to stdout + * @function: Function in which the log line occurred + * @file: File in which the log line occurred + * @line: Line number on which the log line occurred + * @level: Level at which the line is logged + * @data: User specified data, possibly specific to a handler + * @format: printf-style formatting string + * @args: Arguments to be formatted + * + * Display a log message to stdout. + * + * Note: For this handler, @data is a pointer to a FILE output stream. + * If @data is NULL, then stdout will be used. + * + * Note: This function calls ntfs_log_handler_fprintf to do the main work. + * + * Returns: -1 Error occurred + * 0 Message wasn't logged + * num Number of output characters + */ +int ntfs_log_handler_stdout(const char *function, const char *file, + int line, u32 level, void *data, const char *format, va_list args) +{ + if (!data) + data = stdout; + + return ntfs_log_handler_fprintf(function, file, line, level, data, format, args); +} + +/** + * ntfs_log_handler_outerr - Logs go to stdout/stderr depending on level + * @function: Function in which the log line occurred + * @file: File in which the log line occurred + * @line: Line number on which the log line occurred + * @level: Level at which the line is logged + * @data: User specified data, possibly specific to a handler + * @format: printf-style formatting string + * @args: Arguments to be formatted + * + * Display a log message. The output stream will be determined by the log + * level. + * + * Note: For this handler, @data is a pointer to a FILE output stream. + * If @data is NULL, the function ntfs_log_get_stream will be called + * + * Note: This function calls ntfs_log_handler_fprintf to do the main work. + * + * Returns: -1 Error occurred + * 0 Message wasn't logged + * num Number of output characters + */ +int ntfs_log_handler_outerr(const char *function, const char *file, + int line, u32 level, void *data, const char *format, va_list args) +{ + if (!data) + data = ntfs_log_get_stream(level); + + return ntfs_log_handler_fprintf(function, file, line, level, data, format, args); +} + +/** + * ntfs_log_handler_stderr - All logs go to stderr + * @function: Function in which the log line occurred + * @file: File in which the log line occurred + * @line: Line number on which the log line occurred + * @level: Level at which the line is logged + * @data: User specified data, possibly specific to a handler + * @format: printf-style formatting string + * @args: Arguments to be formatted + * + * Display a log message to stderr. + * + * Note: For this handler, @data is a pointer to a FILE output stream. + * If @data is NULL, then stdout will be used. + * + * Note: This function calls ntfs_log_handler_fprintf to do the main work. + * + * Returns: -1 Error occurred + * 0 Message wasn't logged + * num Number of output characters + */ +int ntfs_log_handler_stderr(const char *function, const char *file, + int line, u32 level, void *data, const char *format, va_list args) +{ + if (!data) + data = stderr; + + return ntfs_log_handler_fprintf(function, file, line, level, data, format, args); +} + + +/** + * ntfs_log_parse_option - Act upon command line options + * @option: Option flag + * + * Delegate some of the work of parsing the command line. All the options begin + * with "--log-". Options cause log levels to be enabled in @ntfs_log (the + * global logging structure). + * + * Note: The "colour" option changes the logging handler. + * + * Returns: TRUE Option understood + * FALSE Invalid log option + */ +BOOL ntfs_log_parse_option(const char *option) +{ + if (strcmp(option, "--log-debug") == 0) { + ntfs_log_set_levels(NTFS_LOG_LEVEL_DEBUG); + return TRUE; + } else if (strcmp(option, "--log-verbose") == 0) { + ntfs_log_set_levels(NTFS_LOG_LEVEL_VERBOSE); + return TRUE; + } else if (strcmp(option, "--log-quiet") == 0) { + ntfs_log_clear_levels(NTFS_LOG_LEVEL_QUIET); + return TRUE; + } else if (strcmp(option, "--log-trace") == 0) { + ntfs_log_set_levels(NTFS_LOG_LEVEL_TRACE); + return TRUE; + } + + ntfs_log_debug("Unknown logging option '%s'\n", option); + return FALSE; +} + diff --git a/portlibs/sources/libntfs/logging.h b/portlibs/sources/libntfs/logging.h new file mode 100644 index 00000000..82f39fe1 --- /dev/null +++ b/portlibs/sources/libntfs/logging.h @@ -0,0 +1,121 @@ +/* + * logging.h - Centralised logging. Originated from the Linux-NTFS project. + * + * Copyright (c) 2005 Richard Russon + * Copyright (c) 2007-2008 Szabolcs Szakacsits + * + * 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 + */ + +#ifndef _LOGGING_H_ +#define _LOGGING_H_ + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#ifdef HAVE_STDARG_H +#include <stdarg.h> +#endif + +#include "types.h" + +/* Function prototype for the logging handlers */ +typedef int (ntfs_log_handler)(const char *function, const char *file, int line, + u32 level, void *data, const char *format, va_list args); + +/* Set the logging handler from one of the functions, below. */ +void ntfs_log_set_handler(ntfs_log_handler *handler + __attribute__((format(printf, 6, 0)))); + +/* Logging handlers */ +ntfs_log_handler ntfs_log_handler_syslog __attribute__((format(printf, 6, 0))); +ntfs_log_handler ntfs_log_handler_fprintf __attribute__((format(printf, 6, 0))); +ntfs_log_handler ntfs_log_handler_null __attribute__((format(printf, 6, 0))); +ntfs_log_handler ntfs_log_handler_stdout __attribute__((format(printf, 6, 0))); +ntfs_log_handler ntfs_log_handler_outerr __attribute__((format(printf, 6, 0))); +ntfs_log_handler ntfs_log_handler_stderr __attribute__((format(printf, 6, 0))); + +/* Enable/disable certain log levels */ +u32 ntfs_log_set_levels(u32 levels); +u32 ntfs_log_clear_levels(u32 levels); +u32 ntfs_log_get_levels(void); + +/* Enable/disable certain log flags */ +u32 ntfs_log_set_flags(u32 flags); +u32 ntfs_log_clear_flags(u32 flags); +u32 ntfs_log_get_flags(void); + +/* Turn command-line options into logging flags */ +BOOL ntfs_log_parse_option(const char *option); + +int ntfs_log_redirect(const char *function, const char *file, int line, + u32 level, void *data, const char *format, ...) + __attribute__((format(printf, 6, 7))); + +/* Logging levels - Determine what gets logged */ +#define NTFS_LOG_LEVEL_DEBUG (1 << 0) /* x = 42 */ +#define NTFS_LOG_LEVEL_TRACE (1 << 1) /* Entering function x() */ +#define NTFS_LOG_LEVEL_QUIET (1 << 2) /* Quietable output */ +#define NTFS_LOG_LEVEL_INFO (1 << 3) /* Volume needs defragmenting */ +#define NTFS_LOG_LEVEL_VERBOSE (1 << 4) /* Forced to continue */ +#define NTFS_LOG_LEVEL_PROGRESS (1 << 5) /* 54% complete */ +#define NTFS_LOG_LEVEL_WARNING (1 << 6) /* You should backup before starting */ +#define NTFS_LOG_LEVEL_ERROR (1 << 7) /* Operation failed, no damage done */ +#define NTFS_LOG_LEVEL_PERROR (1 << 8) /* Message : standard error description */ +#define NTFS_LOG_LEVEL_CRITICAL (1 << 9) /* Operation failed,damage may have occurred */ +#define NTFS_LOG_LEVEL_ENTER (1 << 10) /* Enter a function */ +#define NTFS_LOG_LEVEL_LEAVE (1 << 11) /* Leave a function */ + +/* Logging style flags - Manage the style of the output */ +#define NTFS_LOG_FLAG_PREFIX (1 << 0) /* Prefix messages with "ERROR: ", etc */ +#define NTFS_LOG_FLAG_FILENAME (1 << 1) /* Show the file origin of the message */ +#define NTFS_LOG_FLAG_LINE (1 << 2) /* Show the line number of the message */ +#define NTFS_LOG_FLAG_FUNCTION (1 << 3) /* Show the function name containing the message */ +#define NTFS_LOG_FLAG_ONLYNAME (1 << 4) /* Only display the filename, not the pathname */ + +/* Macros to simplify logging. One for each level defined above. + * Note, ntfs_log_debug/trace have effect only if DEBUG is defined. + */ +#define ntfs_log_critical(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_CRITICAL,NULL,FORMAT,##ARGS) +#define ntfs_log_error(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_ERROR,NULL,FORMAT,##ARGS) +#define ntfs_log_info(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_INFO,NULL,FORMAT,##ARGS) +#define ntfs_log_perror(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_PERROR,NULL,FORMAT,##ARGS) +#define ntfs_log_progress(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_PROGRESS,NULL,FORMAT,##ARGS) +#define ntfs_log_quiet(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_QUIET,NULL,FORMAT,##ARGS) +#define ntfs_log_verbose(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_VERBOSE,NULL,FORMAT,##ARGS) +#define ntfs_log_warning(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_WARNING,NULL,FORMAT,##ARGS) + +/* By default debug and trace messages are compiled into the program, + * but not displayed. + */ +#ifdef DEBUG +#define ntfs_log_debug(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_DEBUG,NULL,FORMAT,##ARGS) +#define ntfs_log_trace(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_TRACE,NULL,FORMAT,##ARGS) +#define ntfs_log_enter(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_ENTER,NULL,FORMAT,##ARGS) +#define ntfs_log_leave(FORMAT, ARGS...) ntfs_log_redirect(__FUNCTION__,__FILE__,__LINE__,NTFS_LOG_LEVEL_LEAVE,NULL,FORMAT,##ARGS) +#else +#define ntfs_log_debug(FORMAT, ARGS...)do {} while (0) +#define ntfs_log_trace(FORMAT, ARGS...)do {} while (0) +#define ntfs_log_enter(FORMAT, ARGS...)do {} while (0) +#define ntfs_log_leave(FORMAT, ARGS...)do {} while (0) +#endif /* DEBUG */ + +void ntfs_log_early_error(const char *format, ...) + __attribute__((format(printf, 1, 2))); + +#endif /* _LOGGING_H_ */ + diff --git a/portlibs/sources/libntfs/mem2.h b/portlibs/sources/libntfs/mem2.h new file mode 100644 index 00000000..b8fa93cf --- /dev/null +++ b/portlibs/sources/libntfs/mem2.h @@ -0,0 +1,27 @@ +// 2 MEM2 allocators, one for general purpose, one for covers +// Aligned and padded to 32 bytes, as required by many functions + +#ifndef __MEM2_H_ +#define __MEM2_H_ + +#ifdef __cplusplus +extern "C" +{ +#endif + +#include <gctypes.h> + +void MEM2_init(unsigned int mem2Size); +void MEM2_cleanup(void); +void MEM2_takeBigOnes(bool b); +void *MEM2_alloc(unsigned int s); +void *MEM2_realloc(void *p, unsigned int s); +void MEM2_free(void *p); +unsigned int MEM2_usableSize(void *p); +unsigned int MEM2_freesize(); + +#ifdef __cplusplus +} +#endif + +#endif // !defined(__MEM2_H_) diff --git a/portlibs/sources/libntfs/mem_allocate.h b/portlibs/sources/libntfs/mem_allocate.h new file mode 100644 index 00000000..07681005 --- /dev/null +++ b/portlibs/sources/libntfs/mem_allocate.h @@ -0,0 +1,45 @@ +/** + * mem_allocate.h - Memory allocation and destruction calls. + * + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef _MEM_ALLOCATE_H +#define _MEM_ALLOCATE_H + +#include <malloc.h> +#include "mem2.h" + + +static inline void* ntfs_alloc (size_t size) +{ + return MEM2_alloc(size); +} + +static inline void* ntfs_align (size_t size) +{ + return MEM2_alloc(size); +} + +static inline void ntfs_free (void* mem) +{ + //using normal free, it will decide which free to use (just to be on the safe side) + free(mem); +} + +#endif /* _MEM_ALLOCATE_H */ diff --git a/portlibs/sources/libntfs/mft.c b/portlibs/sources/libntfs/mft.c new file mode 100644 index 00000000..e93c6646 --- /dev/null +++ b/portlibs/sources/libntfs/mft.c @@ -0,0 +1,1909 @@ +/** + * mft.c - Mft record handling code. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2004 Anton Altaparmakov + * Copyright (c) 2004-2005 Richard Russon + * Copyright (c) 2004-2008 Szabolcs Szakacsits + * Copyright (c) 2005 Yura Pakhuchiy + * + * 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_LIMITS_H +#include <limits.h> +#endif +#include <time.h> + +#include "compat.h" +#include "types.h" +#include "device.h" +#include "debug.h" +#include "bitmap.h" +#include "attrib.h" +#include "inode.h" +#include "volume.h" +#include "layout.h" +#include "lcnalloc.h" +#include "mft.h" +#include "logging.h" +#include "misc.h" + +/** + * ntfs_mft_records_read - read records from the mft from disk + * @vol: volume to read from + * @mref: starting mft record number to read + * @count: number of mft records to read + * @b: output data buffer + * + * Read @count mft records starting at @mref from volume @vol into buffer + * @b. Return 0 on success or -1 on error, with errno set to the error + * code. + * + * If any of the records exceed the initialized size of the $MFT/$DATA + * attribute, i.e. they cannot possibly be allocated mft records, assume this + * is a bug and return error code ESPIPE. + * + * The read mft records are mst deprotected and are hence ready to use. The + * caller should check each record with is_baad_record() in case mst + * deprotection failed. + * + * NOTE: @b has to be at least of size @count * vol->mft_record_size. + */ +int ntfs_mft_records_read(const ntfs_volume *vol, const MFT_REF mref, + const s64 count, MFT_RECORD *b) +{ + s64 br; + VCN m; + + ntfs_log_trace("inode %llu\n", (unsigned long long)MREF(mref)); + + if (!vol || !vol->mft_na || !b || count < 0) { + errno = EINVAL; + ntfs_log_perror("%s: b=%p count=%lld mft=%llu", __FUNCTION__, + b, (long long)count, (unsigned long long)MREF(mref)); + return -1; + } + m = MREF(mref); + /* Refuse to read non-allocated mft records. */ + if (m + count > vol->mft_na->initialized_size >> + vol->mft_record_size_bits) { + errno = ESPIPE; + ntfs_log_perror("Trying to read non-allocated mft records " + "(%lld > %lld)", (long long)m + count, + (long long)vol->mft_na->initialized_size >> + vol->mft_record_size_bits); + return -1; + } + br = ntfs_attr_mst_pread(vol->mft_na, m << vol->mft_record_size_bits, + count, vol->mft_record_size, b); + if (br != count) { + if (br != -1) + errno = EIO; + ntfs_log_perror("Failed to read of MFT, mft=%llu count=%lld " + "br=%lld", (long long)m, (long long)count, + (long long)br); + return -1; + } + return 0; +} + +/** + * ntfs_mft_records_write - write mft records to disk + * @vol: volume to write to + * @mref: starting mft record number to write + * @count: number of mft records to write + * @b: data buffer containing the mft records to write + * + * Write @count mft records starting at @mref from data buffer @b to volume + * @vol. Return 0 on success or -1 on error, with errno set to the error code. + * + * If any of the records exceed the initialized size of the $MFT/$DATA + * attribute, i.e. they cannot possibly be allocated mft records, assume this + * is a bug and return error code ESPIPE. + * + * Before the mft records are written, they are mst protected. After the write, + * they are deprotected again, thus resulting in an increase in the update + * sequence number inside the data buffer @b. + * + * If any mft records are written which are also represented in the mft mirror + * $MFTMirr, we make a copy of the relevant parts of the data buffer @b into a + * temporary buffer before we do the actual write. Then if at least one mft + * record was successfully written, we write the appropriate mft records from + * the copied buffer to the mft mirror, too. + */ +int ntfs_mft_records_write(const ntfs_volume *vol, const MFT_REF mref, + const s64 count, MFT_RECORD *b) +{ + s64 bw; + VCN m; + void *bmirr = NULL; + int cnt = 0, res = 0; + + if (!vol || !vol->mft_na || vol->mftmirr_size <= 0 || !b || count < 0) { + errno = EINVAL; + return -1; + } + m = MREF(mref); + /* Refuse to write non-allocated mft records. */ + if (m + count > vol->mft_na->initialized_size >> + vol->mft_record_size_bits) { + errno = ESPIPE; + ntfs_log_perror("Trying to write non-allocated mft records " + "(%lld > %lld)", (long long)m + count, + (long long)vol->mft_na->initialized_size >> + vol->mft_record_size_bits); + return -1; + } + if (m < vol->mftmirr_size) { + if (!vol->mftmirr_na) { + errno = EINVAL; + return -1; + } + cnt = vol->mftmirr_size - m; + if (cnt > count) + cnt = count; + bmirr = ntfs_malloc(cnt * vol->mft_record_size); + if (!bmirr) + return -1; + memcpy(bmirr, b, cnt * vol->mft_record_size); + } + bw = ntfs_attr_mst_pwrite(vol->mft_na, m << vol->mft_record_size_bits, + count, vol->mft_record_size, b); + if (bw != count) { + if (bw != -1) + errno = EIO; + if (bw >= 0) + ntfs_log_debug("Error: partial write while writing $Mft " + "record(s)!\n"); + else + ntfs_log_perror("Error writing $Mft record(s)"); + res = errno; + } + if (bmirr && bw > 0) { + if (bw < cnt) + cnt = bw; + bw = ntfs_attr_mst_pwrite(vol->mftmirr_na, + m << vol->mft_record_size_bits, cnt, + vol->mft_record_size, bmirr); + if (bw != cnt) { + if (bw != -1) + errno = EIO; + ntfs_log_debug("Error: failed to sync $MFTMirr! Run " + "chkdsk.\n"); + res = errno; + } + } + free(bmirr); + if (!res) + return res; + errno = res; + return -1; +} + +int ntfs_mft_record_check(const ntfs_volume *vol, const MFT_REF mref, + MFT_RECORD *m) +{ + ATTR_RECORD *a; + int ret = -1; + + if (!ntfs_is_file_record(m->magic)) { + ntfs_log_error("Record %llu has no FILE magic (0x%x)\n", + (unsigned long long)MREF(mref), *(le32 *)m); + goto err_out; + } + + if (le32_to_cpu(m->bytes_allocated) != vol->mft_record_size) { + ntfs_log_error("Record %llu has corrupt allocation size " + "(%u <> %u)\n", (unsigned long long)MREF(mref), + vol->mft_record_size, + le32_to_cpu(m->bytes_allocated)); + goto err_out; + } + + a = (ATTR_RECORD *)((char *)m + le16_to_cpu(m->attrs_offset)); + if (p2n(a) < p2n(m) || (char *)a > (char *)m + vol->mft_record_size) { + ntfs_log_error("Record %llu is corrupt\n", + (unsigned long long)MREF(mref)); + goto err_out; + } + + ret = 0; +err_out: + if (ret) + errno = EIO; + return ret; +} + +/** + * ntfs_file_record_read - read a FILE record from the mft from disk + * @vol: volume to read from + * @mref: mft reference specifying mft record to read + * @mrec: address of pointer in which to return the mft record + * @attr: address of pointer in which to return the first attribute + * + * Read a FILE record from the mft of @vol from the storage medium. @mref + * specifies the mft record to read, including the sequence number, which can + * be 0 if no sequence number checking is to be performed. + * + * The function allocates a buffer large enough to hold the mft record and + * reads the record into the buffer (mst deprotecting it in the process). + * *@mrec is then set to point to the buffer. + * + * If @attr is not NULL, *@attr is set to point to the first attribute in the + * mft record, i.e. *@attr is a pointer into *@mrec. + * + * Return 0 on success, or -1 on error, with errno set to the error code. + * + * The read mft record is checked for having the magic FILE, + * and for having a matching sequence number (if MSEQNO(*@mref) != 0). + * If either of these fails, -1 is returned and errno is set to EIO. If you get + * this, but you still want to read the mft record (e.g. in order to correct + * it), use ntfs_mft_record_read() directly. + * + * Note: Caller has to free *@mrec when finished. + * + * Note: We do not check if the mft record is flagged in use. The caller can + * check if desired. + */ +int ntfs_file_record_read(const ntfs_volume *vol, const MFT_REF mref, + MFT_RECORD **mrec, ATTR_RECORD **attr) +{ + MFT_RECORD *m; + + if (!vol || !mrec) { + errno = EINVAL; + ntfs_log_perror("%s: mrec=%p", __FUNCTION__, mrec); + return -1; + } + + m = *mrec; + if (!m) { + m = ntfs_malloc(vol->mft_record_size); + if (!m) + return -1; + } + if (ntfs_mft_record_read(vol, mref, m)) + goto err_out; + + if (ntfs_mft_record_check(vol, mref, m)) + goto err_out; + + if (MSEQNO(mref) && MSEQNO(mref) != le16_to_cpu(m->sequence_number)) { + ntfs_log_error("Record %llu has wrong SeqNo (%d <> %d)\n", + (unsigned long long)MREF(mref), MSEQNO(mref), + le16_to_cpu(m->sequence_number)); + errno = EIO; + goto err_out; + } + *mrec = m; + if (attr) + *attr = (ATTR_RECORD*)((char*)m + le16_to_cpu(m->attrs_offset)); + return 0; +err_out: + if (m != *mrec) + free(m); + return -1; +} + +/** + * ntfs_mft_record_layout - layout an mft record into a memory buffer + * @vol: volume to which the mft record will belong + * @mref: mft reference specifying the mft record number + * @mrec: destination buffer of size >= @vol->mft_record_size bytes + * + * Layout an empty, unused mft record with the mft reference @mref into the + * buffer @m. The volume @vol is needed because the mft record structure was + * modified in NTFS 3.1 so we need to know which volume version this mft record + * will be used on. + * + * On success return 0 and on error return -1 with errno set to the error code. + */ +int ntfs_mft_record_layout(const ntfs_volume *vol, const MFT_REF mref, + MFT_RECORD *mrec) +{ + ATTR_RECORD *a; + + if (!vol || !mrec) { + errno = EINVAL; + ntfs_log_perror("%s: mrec=%p", __FUNCTION__, mrec); + return -1; + } + /* Aligned to 2-byte boundary. */ + if (vol->major_ver < 3 || (vol->major_ver == 3 && !vol->minor_ver)) + mrec->usa_ofs = cpu_to_le16((sizeof(MFT_RECORD_OLD) + 1) & ~1); + else { + /* Abort if mref is > 32 bits. */ + if (MREF(mref) & 0x0000ffff00000000ull) { + errno = ERANGE; + ntfs_log_perror("Mft reference exceeds 32 bits"); + return -1; + } + mrec->usa_ofs = cpu_to_le16((sizeof(MFT_RECORD) + 1) & ~1); + /* + * Set the NTFS 3.1+ specific fields while we know that the + * volume version is 3.1+. + */ + mrec->reserved = cpu_to_le16(0); + mrec->mft_record_number = cpu_to_le32(MREF(mref)); + } + mrec->magic = magic_FILE; + if (vol->mft_record_size >= NTFS_BLOCK_SIZE) + mrec->usa_count = cpu_to_le16(vol->mft_record_size / + NTFS_BLOCK_SIZE + 1); + else { + mrec->usa_count = cpu_to_le16(1); + ntfs_log_error("Sector size is bigger than MFT record size. " + "Setting usa_count to 1. If Windows chkdsk " + "reports this as corruption, please email %s " + "stating that you saw this message and that " + "the file system created was corrupt. " + "Thank you.\n", NTFS_DEV_LIST); + } + /* Set the update sequence number to 1. */ + *(u16*)((u8*)mrec + le16_to_cpu(mrec->usa_ofs)) = cpu_to_le16(1); + mrec->lsn = cpu_to_le64(0ull); + mrec->sequence_number = cpu_to_le16(1); + mrec->link_count = cpu_to_le16(0); + /* Aligned to 8-byte boundary. */ + mrec->attrs_offset = cpu_to_le16((le16_to_cpu(mrec->usa_ofs) + + (le16_to_cpu(mrec->usa_count) << 1) + 7) & ~7); + mrec->flags = cpu_to_le16(0); + /* + * Using attrs_offset plus eight bytes (for the termination attribute), + * aligned to 8-byte boundary. + */ + mrec->bytes_in_use = cpu_to_le32((le16_to_cpu(mrec->attrs_offset) + 8 + + 7) & ~7); + mrec->bytes_allocated = cpu_to_le32(vol->mft_record_size); + mrec->base_mft_record = cpu_to_le64((MFT_REF)0); + mrec->next_attr_instance = cpu_to_le16(0); + a = (ATTR_RECORD*)((u8*)mrec + le16_to_cpu(mrec->attrs_offset)); + a->type = AT_END; + a->length = cpu_to_le32(0); + /* Finally, clear the unused part of the mft record. */ + memset((u8*)a + 8, 0, vol->mft_record_size - ((u8*)a + 8 - (u8*)mrec)); + return 0; +} + +/** + * ntfs_mft_record_format - format an mft record on an ntfs volume + * @vol: volume on which to format the mft record + * @mref: mft reference specifying mft record to format + * + * Format the mft record with the mft reference @mref in $MFT/$DATA, i.e. lay + * out an empty, unused mft record in memory and write it to the volume @vol. + * + * On success return 0 and on error return -1 with errno set to the error code. + */ +int ntfs_mft_record_format(const ntfs_volume *vol, const MFT_REF mref) +{ + MFT_RECORD *m; + int ret = -1; + + ntfs_log_enter("Entering\n"); + + m = ntfs_calloc(vol->mft_record_size); + if (!m) + goto out; + + if (ntfs_mft_record_layout(vol, mref, m)) + goto free_m; + + if (ntfs_mft_record_write(vol, mref, m)) + goto free_m; + + ret = 0; +free_m: + free(m); +out: + ntfs_log_leave("\n"); + return ret; +} + +static const char *es = " Leaving inconsistent metadata. Run chkdsk."; + +/** + * ntfs_ffz - Find the first unset (zero) bit in a word + * @word: + * + * Description... + * + * Returns: + */ +static inline unsigned int ntfs_ffz(unsigned int word) +{ + return ffs(~word) - 1; +} + +static int ntfs_is_mft(ntfs_inode *ni) +{ + if (ni && ni->mft_no == FILE_MFT) + return 1; + return 0; +} + +#ifndef PAGE_SIZE +#define PAGE_SIZE 4096 +#endif + +#define RESERVED_MFT_RECORDS 64 + +/** + * ntfs_mft_bitmap_find_free_rec - find a free mft record in the mft bitmap + * @vol: volume on which to search for a free mft record + * @base_ni: open base inode if allocating an extent mft record or NULL + * + * Search for a free mft record in the mft bitmap attribute on the ntfs volume + * @vol. + * + * If @base_ni is NULL start the search at the default allocator position. + * + * If @base_ni is not NULL start the search at the mft record after the base + * mft record @base_ni. + * + * Return the free mft record on success and -1 on error with errno set to the + * error code. An error code of ENOSPC means that there are no free mft + * records in the currently initialized mft bitmap. + */ +static int ntfs_mft_bitmap_find_free_rec(ntfs_volume *vol, ntfs_inode *base_ni) +{ + s64 pass_end, ll, data_pos, pass_start, ofs, bit; + ntfs_attr *mftbmp_na; + u8 *buf, *byte; + unsigned int size; + u8 pass, b; + int ret = -1; + + ntfs_log_enter("Entering\n"); + + mftbmp_na = vol->mftbmp_na; + /* + * Set the end of the pass making sure we do not overflow the mft + * bitmap. + */ + size = PAGE_SIZE; + pass_end = vol->mft_na->allocated_size >> vol->mft_record_size_bits; + ll = mftbmp_na->initialized_size << 3; + if (pass_end > ll) + pass_end = ll; + pass = 1; + if (!base_ni) + data_pos = vol->mft_data_pos; + else + data_pos = base_ni->mft_no + 1; + if (data_pos < RESERVED_MFT_RECORDS) + data_pos = RESERVED_MFT_RECORDS; + if (data_pos >= pass_end) { + data_pos = RESERVED_MFT_RECORDS; + pass = 2; + /* This happens on a freshly formatted volume. */ + if (data_pos >= pass_end) { + errno = ENOSPC; + goto leave; + } + } + if (ntfs_is_mft(base_ni)) { + data_pos = 0; + pass = 2; + } + pass_start = data_pos; + buf = ntfs_malloc(PAGE_SIZE); + if (!buf) + goto leave; + + ntfs_log_debug("Starting bitmap search: pass %u, pass_start 0x%llx, " + "pass_end 0x%llx, data_pos 0x%llx.\n", pass, + (long long)pass_start, (long long)pass_end, + (long long)data_pos); +#ifdef DEBUG + byte = NULL; + b = 0; +#endif + /* Loop until a free mft record is found. */ + for (; pass <= 2; size = PAGE_SIZE) { + /* Cap size to pass_end. */ + ofs = data_pos >> 3; + ll = ((pass_end + 7) >> 3) - ofs; + if (size > ll) + size = ll; + ll = ntfs_attr_pread(mftbmp_na, ofs, size, buf); + if (ll < 0) { + ntfs_log_perror("Failed to read $MFT bitmap"); + free(buf); + goto leave; + } + ntfs_log_debug("Read 0x%llx bytes.\n", (long long)ll); + /* If we read at least one byte, search @buf for a zero bit. */ + if (ll) { + size = ll << 3; + bit = data_pos & 7; + data_pos &= ~7ull; + ntfs_log_debug("Before inner for loop: size 0x%x, " + "data_pos 0x%llx, bit 0x%llx, " + "*byte 0x%hhx, b %u.\n", size, + (long long)data_pos, (long long)bit, + byte ? *byte : -1, b); + for (; bit < size && data_pos + bit < pass_end; + bit &= ~7ull, bit += 8) { + /* + * If we're extending $MFT and running out of the first + * mft record (base record) then give up searching since + * no guarantee that the found record will be accessible. + */ + if (ntfs_is_mft(base_ni) && bit > 400) + goto out; + + byte = buf + (bit >> 3); + if (*byte == 0xff) + continue; + + /* Note: ffz() result must be zero based. */ + b = ntfs_ffz((unsigned long)*byte); + if (b < 8 && b >= (bit & 7)) { + free(buf); + ret = data_pos + (bit & ~7ull) + b; + goto leave; + } + } + ntfs_log_debug("After inner for loop: size 0x%x, " + "data_pos 0x%llx, bit 0x%llx, " + "*byte 0x%hhx, b %u.\n", size, + (long long)data_pos, (long long)bit, + byte ? *byte : -1, b); + data_pos += size; + /* + * If the end of the pass has not been reached yet, + * continue searching the mft bitmap for a zero bit. + */ + if (data_pos < pass_end) + continue; + } + /* Do the next pass. */ + pass++; + if (pass == 2) { + /* + * Starting the second pass, in which we scan the first + * part of the zone which we omitted earlier. + */ + pass_end = pass_start; + data_pos = pass_start = RESERVED_MFT_RECORDS; + ntfs_log_debug("pass %i, pass_start 0x%llx, pass_end " + "0x%llx.\n", pass, (long long)pass_start, + (long long)pass_end); + if (data_pos >= pass_end) + break; + } + } + /* No free mft records in currently initialized mft bitmap. */ +out: + free(buf); + errno = ENOSPC; +leave: + ntfs_log_leave("\n"); + return ret; +} + +static int ntfs_mft_attr_extend(ntfs_attr *na) +{ + int ret = STATUS_ERROR; + ntfs_log_enter("Entering\n"); + + if (!NInoAttrList(na->ni)) { + if (ntfs_inode_add_attrlist(na->ni)) { + ntfs_log_perror("%s: Can not add attrlist #3", __FUNCTION__); + goto out; + } + /* We can't sync the $MFT inode since its runlist is bogus. */ + ret = STATUS_KEEP_SEARCHING; + goto out; + } + + if (ntfs_attr_update_mapping_pairs(na, 0)) { + ntfs_log_perror("%s: MP update failed", __FUNCTION__); + goto out; + } + + ret = STATUS_OK; +out: + ntfs_log_leave("\n"); + return ret; +} + +/** + * ntfs_mft_bitmap_extend_allocation_i - see ntfs_mft_bitmap_extend_allocation + */ +static int ntfs_mft_bitmap_extend_allocation_i(ntfs_volume *vol) +{ + LCN lcn; + s64 ll = 0; /* silence compiler warning */ + ntfs_attr *mftbmp_na; + runlist_element *rl, *rl2 = NULL; /* silence compiler warning */ + ntfs_attr_search_ctx *ctx; + MFT_RECORD *m = NULL; /* silence compiler warning */ + ATTR_RECORD *a = NULL; /* silence compiler warning */ + int err, mp_size; + int ret = STATUS_ERROR; + u32 old_alen = 0; /* silence compiler warning */ + BOOL mp_rebuilt = FALSE; + BOOL update_mp = FALSE; + + mftbmp_na = vol->mftbmp_na; + /* + * Determine the last lcn of the mft bitmap. The allocated size of the + * mft bitmap cannot be zero so we are ok to do this. + */ + rl = ntfs_attr_find_vcn(mftbmp_na, (mftbmp_na->allocated_size - 1) >> + vol->cluster_size_bits); + if (!rl || !rl->length || rl->lcn < 0) { + ntfs_log_error("Failed to determine last allocated " + "cluster of mft bitmap attribute.\n"); + if (rl) + errno = EIO; + return STATUS_ERROR; + } + lcn = rl->lcn + rl->length; + + rl2 = ntfs_cluster_alloc(vol, rl[1].vcn, 1, lcn, DATA_ZONE); + if (!rl2) { + ntfs_log_error("Failed to allocate a cluster for " + "the mft bitmap.\n"); + return STATUS_ERROR; + } + rl = ntfs_runlists_merge(mftbmp_na->rl, rl2); + if (!rl) { + err = errno; + ntfs_log_error("Failed to merge runlists for mft " + "bitmap.\n"); + if (ntfs_cluster_free_from_rl(vol, rl2)) + ntfs_log_error("Failed to deallocate " + "cluster.%s\n", es); + free(rl2); + errno = err; + return STATUS_ERROR; + } + mftbmp_na->rl = rl; + ntfs_log_debug("Adding one run to mft bitmap.\n"); + /* Find the last run in the new runlist. */ + for (; rl[1].length; rl++) + ; + /* + * Update the attribute record as well. Note: @rl is the last + * (non-terminator) runlist element of mft bitmap. + */ + ctx = ntfs_attr_get_search_ctx(mftbmp_na->ni, NULL); + if (!ctx) + goto undo_alloc; + + if (ntfs_attr_lookup(mftbmp_na->type, mftbmp_na->name, + mftbmp_na->name_len, 0, rl[1].vcn, NULL, 0, ctx)) { + ntfs_log_error("Failed to find last attribute extent of " + "mft bitmap attribute.\n"); + goto undo_alloc; + } + m = ctx->mrec; + a = ctx->attr; + ll = sle64_to_cpu(a->lowest_vcn); + rl2 = ntfs_attr_find_vcn(mftbmp_na, ll); + if (!rl2 || !rl2->length) { + ntfs_log_error("Failed to determine previous last " + "allocated cluster of mft bitmap attribute.\n"); + if (rl2) + errno = EIO; + goto undo_alloc; + } + /* Get the size for the new mapping pairs array for this extent. */ + mp_size = ntfs_get_size_for_mapping_pairs(vol, rl2, ll, INT_MAX); + if (mp_size <= 0) { + ntfs_log_error("Get size for mapping pairs failed for " + "mft bitmap attribute extent.\n"); + goto undo_alloc; + } + /* Expand the attribute record if necessary. */ + old_alen = le32_to_cpu(a->length); + if (ntfs_attr_record_resize(m, a, mp_size + + le16_to_cpu(a->mapping_pairs_offset))) { + ntfs_log_info("extending $MFT bitmap\n"); + ret = ntfs_mft_attr_extend(vol->mftbmp_na); + if (ret == STATUS_OK) + goto ok; + if (ret == STATUS_ERROR) { + ntfs_log_perror("%s: ntfs_mft_attr_extend failed", __FUNCTION__); + update_mp = TRUE; + } + goto undo_alloc; + } + mp_rebuilt = TRUE; + /* Generate the mapping pairs array directly into the attr record. */ + if (ntfs_mapping_pairs_build(vol, (u8*)a + + le16_to_cpu(a->mapping_pairs_offset), mp_size, rl2, ll, + NULL)) { + ntfs_log_error("Failed to build mapping pairs array for " + "mft bitmap attribute.\n"); + errno = EIO; + goto undo_alloc; + } + /* Update the highest_vcn. */ + a->highest_vcn = cpu_to_sle64(rl[1].vcn - 1); + /* + * We now have extended the mft bitmap allocated_size by one cluster. + * Reflect this in the ntfs_attr structure and the attribute record. + */ + if (a->lowest_vcn) { + /* + * We are not in the first attribute extent, switch to it, but + * first ensure the changes will make it to disk later. + */ + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_reinit_search_ctx(ctx); + if (ntfs_attr_lookup(mftbmp_na->type, mftbmp_na->name, + mftbmp_na->name_len, 0, 0, NULL, 0, ctx)) { + ntfs_log_error("Failed to find first attribute " + "extent of mft bitmap attribute.\n"); + goto restore_undo_alloc; + } + a = ctx->attr; + } +ok: + mftbmp_na->allocated_size += vol->cluster_size; + a->allocated_size = cpu_to_sle64(mftbmp_na->allocated_size); + /* Ensure the changes make it to disk. */ + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_put_search_ctx(ctx); + return STATUS_OK; + +restore_undo_alloc: + err = errno; + ntfs_attr_reinit_search_ctx(ctx); + if (ntfs_attr_lookup(mftbmp_na->type, mftbmp_na->name, + mftbmp_na->name_len, 0, rl[1].vcn, NULL, 0, ctx)) { + ntfs_log_error("Failed to find last attribute extent of " + "mft bitmap attribute.%s\n", es); + ntfs_attr_put_search_ctx(ctx); + mftbmp_na->allocated_size += vol->cluster_size; + /* + * The only thing that is now wrong is ->allocated_size of the + * base attribute extent which chkdsk should be able to fix. + */ + errno = err; + return STATUS_ERROR; + } + m = ctx->mrec; + a = ctx->attr; + a->highest_vcn = cpu_to_sle64(rl[1].vcn - 2); + errno = err; +undo_alloc: + err = errno; + + /* Remove the last run from the runlist. */ + lcn = rl->lcn; + rl->lcn = rl[1].lcn; + rl->length = 0; + + /* FIXME: use an ntfs_cluster_free_* function */ + if (ntfs_bitmap_clear_bit(vol->lcnbmp_na, lcn)) + ntfs_log_error("Failed to free cluster.%s\n", es); + else + vol->free_clusters++; + if (mp_rebuilt) { + if (ntfs_mapping_pairs_build(vol, (u8*)a + + le16_to_cpu(a->mapping_pairs_offset), + old_alen - le16_to_cpu(a->mapping_pairs_offset), + rl2, ll, NULL)) + ntfs_log_error("Failed to restore mapping " + "pairs array.%s\n", es); + if (ntfs_attr_record_resize(m, a, old_alen)) + ntfs_log_error("Failed to restore attribute " + "record.%s\n", es); + ntfs_inode_mark_dirty(ctx->ntfs_ino); + } + if (update_mp) { + if (ntfs_attr_update_mapping_pairs(vol->mftbmp_na, 0)) + ntfs_log_perror("%s: MP update failed", __FUNCTION__); + } + if (ctx) + ntfs_attr_put_search_ctx(ctx); + errno = err; + return ret; +} + +/** + * ntfs_mft_bitmap_extend_allocation - extend mft bitmap attribute by a cluster + * @vol: volume on which to extend the mft bitmap attribute + * + * Extend the mft bitmap attribute on the ntfs volume @vol by one cluster. + * + * Note: Only changes allocated_size, i.e. does not touch initialized_size or + * data_size. + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +static int ntfs_mft_bitmap_extend_allocation(ntfs_volume *vol) +{ + int ret; + + ntfs_log_enter("Entering\n"); + ret = ntfs_mft_bitmap_extend_allocation_i(vol); + ntfs_log_leave("\n"); + return ret; +} +/** + * ntfs_mft_bitmap_extend_initialized - extend mft bitmap initialized data + * @vol: volume on which to extend the mft bitmap attribute + * + * Extend the initialized portion of the mft bitmap attribute on the ntfs + * volume @vol by 8 bytes. + * + * Note: Only changes initialized_size and data_size, i.e. requires that + * allocated_size is big enough to fit the new initialized_size. + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +static int ntfs_mft_bitmap_extend_initialized(ntfs_volume *vol) +{ + s64 old_data_size, old_initialized_size, ll; + ntfs_attr *mftbmp_na; + ntfs_attr_search_ctx *ctx; + ATTR_RECORD *a; + int err; + int ret = -1; + + ntfs_log_enter("Entering\n"); + + mftbmp_na = vol->mftbmp_na; + ctx = ntfs_attr_get_search_ctx(mftbmp_na->ni, NULL); + if (!ctx) + goto out; + + if (ntfs_attr_lookup(mftbmp_na->type, mftbmp_na->name, + mftbmp_na->name_len, 0, 0, NULL, 0, ctx)) { + ntfs_log_error("Failed to find first attribute extent of " + "mft bitmap attribute.\n"); + err = errno; + goto put_err_out; + } + a = ctx->attr; + old_data_size = mftbmp_na->data_size; + old_initialized_size = mftbmp_na->initialized_size; + mftbmp_na->initialized_size += 8; + a->initialized_size = cpu_to_sle64(mftbmp_na->initialized_size); + if (mftbmp_na->initialized_size > mftbmp_na->data_size) { + mftbmp_na->data_size = mftbmp_na->initialized_size; + a->data_size = cpu_to_sle64(mftbmp_na->data_size); + } + /* Ensure the changes make it to disk. */ + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_put_search_ctx(ctx); + /* Initialize the mft bitmap attribute value with zeroes. */ + ll = 0; + ll = ntfs_attr_pwrite(mftbmp_na, old_initialized_size, 8, &ll); + if (ll == 8) { + ntfs_log_debug("Wrote eight initialized bytes to mft bitmap.\n"); + vol->free_mft_records += (8 * 8); + ret = 0; + goto out; + } + ntfs_log_error("Failed to write to mft bitmap.\n"); + err = errno; + if (ll >= 0) + err = EIO; + /* Try to recover from the error. */ + ctx = ntfs_attr_get_search_ctx(mftbmp_na->ni, NULL); + if (!ctx) + goto err_out; + + if (ntfs_attr_lookup(mftbmp_na->type, mftbmp_na->name, + mftbmp_na->name_len, 0, 0, NULL, 0, ctx)) { + ntfs_log_error("Failed to find first attribute extent of " + "mft bitmap attribute.%s\n", es); +put_err_out: + ntfs_attr_put_search_ctx(ctx); + goto err_out; + } + a = ctx->attr; + mftbmp_na->initialized_size = old_initialized_size; + a->initialized_size = cpu_to_sle64(old_initialized_size); + if (mftbmp_na->data_size != old_data_size) { + mftbmp_na->data_size = old_data_size; + a->data_size = cpu_to_sle64(old_data_size); + } + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_put_search_ctx(ctx); + ntfs_log_debug("Restored status of mftbmp: allocated_size 0x%llx, " + "data_size 0x%llx, initialized_size 0x%llx.\n", + (long long)mftbmp_na->allocated_size, + (long long)mftbmp_na->data_size, + (long long)mftbmp_na->initialized_size); +err_out: + errno = err; +out: + ntfs_log_leave("\n"); + return ret; +} + +/** + * ntfs_mft_data_extend_allocation - extend mft data attribute + * @vol: volume on which to extend the mft data attribute + * + * Extend the mft data attribute on the ntfs volume @vol by 16 mft records + * worth of clusters or if not enough space for this by one mft record worth + * of clusters. + * + * Note: Only changes allocated_size, i.e. does not touch initialized_size or + * data_size. + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +static int ntfs_mft_data_extend_allocation(ntfs_volume *vol) +{ + LCN lcn; + VCN old_last_vcn; + s64 min_nr, nr, ll = 0; /* silence compiler warning */ + ntfs_attr *mft_na; + runlist_element *rl, *rl2; + ntfs_attr_search_ctx *ctx; + MFT_RECORD *m = NULL; /* silence compiler warning */ + ATTR_RECORD *a = NULL; /* silence compiler warning */ + int err, mp_size; + int ret = STATUS_ERROR; + u32 old_alen = 0; /* silence compiler warning */ + BOOL mp_rebuilt = FALSE; + BOOL update_mp = FALSE; + + ntfs_log_enter("Extending mft data allocation.\n"); + + mft_na = vol->mft_na; + /* + * Determine the preferred allocation location, i.e. the last lcn of + * the mft data attribute. The allocated size of the mft data + * attribute cannot be zero so we are ok to do this. + */ + rl = ntfs_attr_find_vcn(mft_na, + (mft_na->allocated_size - 1) >> vol->cluster_size_bits); + + if (!rl || !rl->length || rl->lcn < 0) { + ntfs_log_error("Failed to determine last allocated " + "cluster of mft data attribute.\n"); + if (rl) + errno = EIO; + goto out; + } + + lcn = rl->lcn + rl->length; + ntfs_log_debug("Last lcn of mft data attribute is 0x%llx.\n", (long long)lcn); + /* Minimum allocation is one mft record worth of clusters. */ + min_nr = vol->mft_record_size >> vol->cluster_size_bits; + if (!min_nr) + min_nr = 1; + /* Want to allocate 16 mft records worth of clusters. */ + nr = vol->mft_record_size << 4 >> vol->cluster_size_bits; + if (!nr) + nr = min_nr; + + old_last_vcn = rl[1].vcn; + do { + rl2 = ntfs_cluster_alloc(vol, old_last_vcn, nr, lcn, MFT_ZONE); + if (rl2) + break; + if (errno != ENOSPC || nr == min_nr) { + ntfs_log_perror("Failed to allocate (%lld) clusters " + "for $MFT", (long long)nr); + goto out; + } + /* + * There is not enough space to do the allocation, but there + * might be enough space to do a minimal allocation so try that + * before failing. + */ + nr = min_nr; + ntfs_log_debug("Retrying mft data allocation with minimal cluster " + "count %lli.\n", (long long)nr); + } while (1); + + ntfs_log_debug("Allocated %lld clusters.\n", (long long)nr); + + rl = ntfs_runlists_merge(mft_na->rl, rl2); + if (!rl) { + err = errno; + ntfs_log_error("Failed to merge runlists for mft data " + "attribute.\n"); + if (ntfs_cluster_free_from_rl(vol, rl2)) + ntfs_log_error("Failed to deallocate clusters " + "from the mft data attribute.%s\n", es); + free(rl2); + errno = err; + goto out; + } + mft_na->rl = rl; + + /* Find the last run in the new runlist. */ + for (; rl[1].length; rl++) + ; + /* Update the attribute record as well. */ + ctx = ntfs_attr_get_search_ctx(mft_na->ni, NULL); + if (!ctx) + goto undo_alloc; + + if (ntfs_attr_lookup(mft_na->type, mft_na->name, mft_na->name_len, 0, + rl[1].vcn, NULL, 0, ctx)) { + ntfs_log_error("Failed to find last attribute extent of " + "mft data attribute.\n"); + goto undo_alloc; + } + m = ctx->mrec; + a = ctx->attr; + ll = sle64_to_cpu(a->lowest_vcn); + rl2 = ntfs_attr_find_vcn(mft_na, ll); + if (!rl2 || !rl2->length) { + ntfs_log_error("Failed to determine previous last " + "allocated cluster of mft data attribute.\n"); + if (rl2) + errno = EIO; + goto undo_alloc; + } + /* Get the size for the new mapping pairs array for this extent. */ + mp_size = ntfs_get_size_for_mapping_pairs(vol, rl2, ll, INT_MAX); + if (mp_size <= 0) { + ntfs_log_error("Get size for mapping pairs failed for " + "mft data attribute extent.\n"); + goto undo_alloc; + } + /* Expand the attribute record if necessary. */ + old_alen = le32_to_cpu(a->length); + if (ntfs_attr_record_resize(m, a, + mp_size + le16_to_cpu(a->mapping_pairs_offset))) { + ret = ntfs_mft_attr_extend(vol->mft_na); + if (ret == STATUS_OK) + goto ok; + if (ret == STATUS_ERROR) { + ntfs_log_perror("%s: ntfs_mft_attr_extend failed", __FUNCTION__); + update_mp = TRUE; + } + goto undo_alloc; + } + mp_rebuilt = TRUE; + /* + * Generate the mapping pairs array directly into the attribute record. + */ + if (ntfs_mapping_pairs_build(vol, + (u8*)a + le16_to_cpu(a->mapping_pairs_offset), mp_size, + rl2, ll, NULL)) { + ntfs_log_error("Failed to build mapping pairs array of " + "mft data attribute.\n"); + errno = EIO; + goto undo_alloc; + } + /* Update the highest_vcn. */ + a->highest_vcn = cpu_to_sle64(rl[1].vcn - 1); + /* + * We now have extended the mft data allocated_size by nr clusters. + * Reflect this in the ntfs_attr structure and the attribute record. + * @rl is the last (non-terminator) runlist element of mft data + * attribute. + */ + if (a->lowest_vcn) { + /* + * We are not in the first attribute extent, switch to it, but + * first ensure the changes will make it to disk later. + */ + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_reinit_search_ctx(ctx); + if (ntfs_attr_lookup(mft_na->type, mft_na->name, + mft_na->name_len, 0, 0, NULL, 0, ctx)) { + ntfs_log_error("Failed to find first attribute " + "extent of mft data attribute.\n"); + goto restore_undo_alloc; + } + a = ctx->attr; + } +ok: + mft_na->allocated_size += nr << vol->cluster_size_bits; + a->allocated_size = cpu_to_sle64(mft_na->allocated_size); + /* Ensure the changes make it to disk. */ + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_put_search_ctx(ctx); + ret = STATUS_OK; +out: + ntfs_log_leave("\n"); + return ret; + +restore_undo_alloc: + err = errno; + ntfs_attr_reinit_search_ctx(ctx); + if (ntfs_attr_lookup(mft_na->type, mft_na->name, mft_na->name_len, 0, + rl[1].vcn, NULL, 0, ctx)) { + ntfs_log_error("Failed to find last attribute extent of " + "mft data attribute.%s\n", es); + ntfs_attr_put_search_ctx(ctx); + mft_na->allocated_size += nr << vol->cluster_size_bits; + /* + * The only thing that is now wrong is ->allocated_size of the + * base attribute extent which chkdsk should be able to fix. + */ + errno = err; + ret = STATUS_ERROR; + goto out; + } + m = ctx->mrec; + a = ctx->attr; + a->highest_vcn = cpu_to_sle64(old_last_vcn - 1); + errno = err; +undo_alloc: + err = errno; + if (ntfs_cluster_free(vol, mft_na, old_last_vcn, -1) < 0) + ntfs_log_error("Failed to free clusters from mft data " + "attribute.%s\n", es); + if (ntfs_rl_truncate(&mft_na->rl, old_last_vcn)) + ntfs_log_error("Failed to truncate mft data attribute " + "runlist.%s\n", es); + if (mp_rebuilt) { + if (ntfs_mapping_pairs_build(vol, (u8*)a + + le16_to_cpu(a->mapping_pairs_offset), + old_alen - le16_to_cpu(a->mapping_pairs_offset), + rl2, ll, NULL)) + ntfs_log_error("Failed to restore mapping pairs " + "array.%s\n", es); + if (ntfs_attr_record_resize(m, a, old_alen)) + ntfs_log_error("Failed to restore attribute " + "record.%s\n", es); + ntfs_inode_mark_dirty(ctx->ntfs_ino); + } + if (update_mp) { + if (ntfs_attr_update_mapping_pairs(vol->mft_na, 0)) + ntfs_log_perror("%s: MP update failed", __FUNCTION__); + } + if (ctx) + ntfs_attr_put_search_ctx(ctx); + errno = err; + goto out; +} + + +static int ntfs_mft_record_init(ntfs_volume *vol, s64 size) +{ + int ret = -1; + ntfs_attr *mft_na, *mftbmp_na; + s64 old_data_initialized, old_data_size; + ntfs_attr_search_ctx *ctx; + + ntfs_log_enter("Entering\n"); + + /* NOTE: Caller must sanity check vol, vol->mft_na and vol->mftbmp_na */ + + mft_na = vol->mft_na; + mftbmp_na = vol->mftbmp_na; + + /* + * The mft record is outside the initialized data. Extend the mft data + * attribute until it covers the allocated record. The loop is only + * actually traversed more than once when a freshly formatted volume + * is first written to so it optimizes away nicely in the common case. + */ + ntfs_log_debug("Status of mft data before extension: " + "allocated_size 0x%llx, data_size 0x%llx, " + "initialized_size 0x%llx.\n", + (long long)mft_na->allocated_size, + (long long)mft_na->data_size, + (long long)mft_na->initialized_size); + while (size > mft_na->allocated_size) { + if (ntfs_mft_data_extend_allocation(vol) == STATUS_ERROR) + goto out; + ntfs_log_debug("Status of mft data after allocation extension: " + "allocated_size 0x%llx, data_size 0x%llx, " + "initialized_size 0x%llx.\n", + (long long)mft_na->allocated_size, + (long long)mft_na->data_size, + (long long)mft_na->initialized_size); + } + + old_data_initialized = mft_na->initialized_size; + old_data_size = mft_na->data_size; + + /* + * Extend mft data initialized size (and data size of course) to reach + * the allocated mft record, formatting the mft records along the way. + * Note: We only modify the ntfs_attr structure as that is all that is + * needed by ntfs_mft_record_format(). We will update the attribute + * record itself in one fell swoop later on. + */ + while (size > mft_na->initialized_size) { + s64 ll2 = mft_na->initialized_size >> vol->mft_record_size_bits; + mft_na->initialized_size += vol->mft_record_size; + if (mft_na->initialized_size > mft_na->data_size) + mft_na->data_size = mft_na->initialized_size; + ntfs_log_debug("Initializing mft record 0x%llx.\n", (long long)ll2); + if (ntfs_mft_record_format(vol, ll2) < 0) { + ntfs_log_perror("Failed to format mft record"); + goto undo_data_init; + } + } + + /* Update the mft data attribute record to reflect the new sizes. */ + ctx = ntfs_attr_get_search_ctx(mft_na->ni, NULL); + if (!ctx) + goto undo_data_init; + + if (ntfs_attr_lookup(mft_na->type, mft_na->name, mft_na->name_len, 0, + 0, NULL, 0, ctx)) { + ntfs_log_error("Failed to find first attribute extent of " + "mft data attribute.\n"); + ntfs_attr_put_search_ctx(ctx); + goto undo_data_init; + } + ctx->attr->initialized_size = cpu_to_sle64(mft_na->initialized_size); + ctx->attr->data_size = cpu_to_sle64(mft_na->data_size); + ctx->attr->allocated_size = cpu_to_sle64(mft_na->allocated_size); + + /* Ensure the changes make it to disk. */ + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_put_search_ctx(ctx); + ntfs_log_debug("Status of mft data after mft record initialization: " + "allocated_size 0x%llx, data_size 0x%llx, " + "initialized_size 0x%llx.\n", + (long long)mft_na->allocated_size, + (long long)mft_na->data_size, + (long long)mft_na->initialized_size); + + /* Sanity checks. */ + if (mft_na->data_size > mft_na->allocated_size || + mft_na->initialized_size > mft_na->data_size) + NTFS_BUG("mft_na sanity checks failed"); + + /* Sync MFT to minimize data loss if there won't be clean unmount. */ + if (ntfs_inode_sync(mft_na->ni)) + goto undo_data_init; + + ret = 0; +out: + ntfs_log_leave("\n"); + return ret; + +undo_data_init: + mft_na->initialized_size = old_data_initialized; + mft_na->data_size = old_data_size; + goto out; +} + +static int ntfs_mft_rec_init(ntfs_volume *vol, s64 size) +{ + int ret = -1; + ntfs_attr *mft_na, *mftbmp_na; + s64 old_data_initialized, old_data_size; + ntfs_attr_search_ctx *ctx; + + ntfs_log_enter("Entering\n"); + + mft_na = vol->mft_na; + mftbmp_na = vol->mftbmp_na; + + if (size > mft_na->allocated_size || size > mft_na->initialized_size) { + errno = EIO; + ntfs_log_perror("%s: unexpected $MFT sizes, see below", __FUNCTION__); + ntfs_log_error("$MFT: size=%lld allocated_size=%lld " + "data_size=%lld initialized_size=%lld\n", + (long long)size, + (long long)mft_na->allocated_size, + (long long)mft_na->data_size, + (long long)mft_na->initialized_size); + goto out; + } + + old_data_initialized = mft_na->initialized_size; + old_data_size = mft_na->data_size; + + /* Update the mft data attribute record to reflect the new sizes. */ + ctx = ntfs_attr_get_search_ctx(mft_na->ni, NULL); + if (!ctx) + goto undo_data_init; + + if (ntfs_attr_lookup(mft_na->type, mft_na->name, mft_na->name_len, 0, + 0, NULL, 0, ctx)) { + ntfs_log_error("Failed to find first attribute extent of " + "mft data attribute.\n"); + ntfs_attr_put_search_ctx(ctx); + goto undo_data_init; + } + ctx->attr->initialized_size = cpu_to_sle64(mft_na->initialized_size); + ctx->attr->data_size = cpu_to_sle64(mft_na->data_size); + + /* CHECKME: ctx->attr->allocation_size is already ok? */ + + /* Ensure the changes make it to disk. */ + ntfs_inode_mark_dirty(ctx->ntfs_ino); + ntfs_attr_put_search_ctx(ctx); + + /* Sanity checks. */ + if (mft_na->data_size > mft_na->allocated_size || + mft_na->initialized_size > mft_na->data_size) + NTFS_BUG("mft_na sanity checks failed"); +out: + ntfs_log_leave("\n"); + return ret; + +undo_data_init: + mft_na->initialized_size = old_data_initialized; + mft_na->data_size = old_data_size; + goto out; +} + +static ntfs_inode *ntfs_mft_rec_alloc(ntfs_volume *vol) +{ + s64 ll, bit; + ntfs_attr *mft_na, *mftbmp_na; + MFT_RECORD *m; + ntfs_inode *ni = NULL; + ntfs_inode *base_ni; + int err; + le16 seq_no, usn; + + ntfs_log_enter("Entering\n"); + + mft_na = vol->mft_na; + mftbmp_na = vol->mftbmp_na; + + base_ni = mft_na->ni; + + bit = ntfs_mft_bitmap_find_free_rec(vol, base_ni); + if (bit >= 0) + goto found_free_rec; + + if (errno != ENOSPC) + goto out; + + errno = ENOSPC; + /* strerror() is intentionally used below, we want to log this error. */ + ntfs_log_error("No free mft record for $MFT: %s\n", strerror(errno)); + goto err_out; + +found_free_rec: + if (ntfs_bitmap_set_bit(mftbmp_na, bit)) { + ntfs_log_error("Failed to allocate bit in mft bitmap #2\n"); + goto err_out; + } + + ll = (bit + 1) << vol->mft_record_size_bits; + if (ll > mft_na->initialized_size) + if (ntfs_mft_rec_init(vol, ll) < 0) + goto undo_mftbmp_alloc; + /* + * We now have allocated and initialized the mft record. Need to read + * it from disk and re-format it, preserving the sequence number if it + * is not zero as well as the update sequence number if it is not zero + * or -1 (0xffff). + */ + m = ntfs_malloc(vol->mft_record_size); + if (!m) + goto undo_mftbmp_alloc; + + if (ntfs_mft_record_read(vol, bit, m)) { + free(m); + goto undo_mftbmp_alloc; + } + /* Sanity check that the mft record is really not in use. */ + if (ntfs_is_file_record(m->magic) && (m->flags & MFT_RECORD_IN_USE)) { + ntfs_log_error("Inode %lld is used but it wasn't marked in " + "$MFT bitmap. Fixed.\n", (long long)bit); + free(m); + goto undo_mftbmp_alloc; + } + + seq_no = m->sequence_number; + usn = *(le16*)((u8*)m + le16_to_cpu(m->usa_ofs)); + if (ntfs_mft_record_layout(vol, bit, m)) { + ntfs_log_error("Failed to re-format mft record.\n"); + free(m); + goto undo_mftbmp_alloc; + } + if (seq_no) + m->sequence_number = seq_no; + seq_no = usn; + if (seq_no && seq_no != const_cpu_to_le16(0xffff)) + *(le16*)((u8*)m + le16_to_cpu(m->usa_ofs)) = usn; + /* Set the mft record itself in use. */ + m->flags |= MFT_RECORD_IN_USE; + /* Now need to open an ntfs inode for the mft record. */ + ni = ntfs_inode_allocate(vol); + if (!ni) { + ntfs_log_error("Failed to allocate buffer for inode.\n"); + free(m); + goto undo_mftbmp_alloc; + } + ni->mft_no = bit; + ni->mrec = m; + /* + * If we are allocating an extent mft record, make the opened inode an + * extent inode and attach it to the base inode. Also, set the base + * mft record reference in the extent inode. + */ + ni->nr_extents = -1; + ni->base_ni = base_ni; + m->base_mft_record = MK_LE_MREF(base_ni->mft_no, + le16_to_cpu(base_ni->mrec->sequence_number)); + /* + * Attach the extent inode to the base inode, reallocating + * memory if needed. + */ + if (!(base_ni->nr_extents & 3)) { + ntfs_inode **extent_nis; + int i; + + i = (base_ni->nr_extents + 4) * sizeof(ntfs_inode *); + extent_nis = ntfs_malloc(i); + if (!extent_nis) { + free(m); + free(ni); + goto undo_mftbmp_alloc; + } + if (base_ni->nr_extents) { + memcpy(extent_nis, base_ni->extent_nis, + i - 4 * sizeof(ntfs_inode *)); + free(base_ni->extent_nis); + } + base_ni->extent_nis = extent_nis; + } + base_ni->extent_nis[base_ni->nr_extents++] = ni; + + /* Make sure the allocated inode is written out to disk later. */ + ntfs_inode_mark_dirty(ni); + /* Initialize time, allocated and data size in ntfs_inode struct. */ + ni->data_size = ni->allocated_size = 0; + ni->flags = 0; + ni->creation_time = ni->last_data_change_time = + ni->last_mft_change_time = + ni->last_access_time = ntfs_current_time(); + /* Update the default mft allocation position if it was used. */ + if (!base_ni) + vol->mft_data_pos = bit + 1; + /* Return the opened, allocated inode of the allocated mft record. */ + ntfs_log_error("allocated %sinode %lld\n", + base_ni ? "extent " : "", (long long)bit); +out: + ntfs_log_leave("\n"); + return ni; + +undo_mftbmp_alloc: + err = errno; + if (ntfs_bitmap_clear_bit(mftbmp_na, bit)) + ntfs_log_error("Failed to clear bit in mft bitmap.%s\n", es); + errno = err; +err_out: + if (!errno) + errno = EIO; + ni = NULL; + goto out; +} + +/** + * ntfs_mft_record_alloc - allocate an mft record on an ntfs volume + * @vol: volume on which to allocate the mft record + * @base_ni: open base inode if allocating an extent mft record or NULL + * + * Allocate an mft record in $MFT/$DATA of an open ntfs volume @vol. + * + * If @base_ni is NULL make the mft record a base mft record and allocate it at + * the default allocator position. + * + * If @base_ni is not NULL make the allocated mft record an extent record, + * allocate it starting at the mft record after the base mft record and attach + * the allocated and opened ntfs inode to the base inode @base_ni. + * + * On success return the now opened ntfs (extent) inode of the mft record. + * + * On error return NULL with errno set to the error code. + * + * To find a free mft record, we scan the mft bitmap for a zero bit. To + * optimize this we start scanning at the place specified by @base_ni or if + * @base_ni is NULL we start where we last stopped and we perform wrap around + * when we reach the end. Note, we do not try to allocate mft records below + * number 24 because numbers 0 to 15 are the defined system files anyway and 16 + * to 24 are special in that they are used for storing extension mft records + * for the $DATA attribute of $MFT. This is required to avoid the possibility + * of creating a run list with a circular dependence which once written to disk + * can never be read in again. Windows will only use records 16 to 24 for + * normal files if the volume is completely out of space. We never use them + * which means that when the volume is really out of space we cannot create any + * more files while Windows can still create up to 8 small files. We can start + * doing this at some later time, it does not matter much for now. + * + * When scanning the mft bitmap, we only search up to the last allocated mft + * record. If there are no free records left in the range 24 to number of + * allocated mft records, then we extend the $MFT/$DATA attribute in order to + * create free mft records. We extend the allocated size of $MFT/$DATA by 16 + * records at a time or one cluster, if cluster size is above 16kiB. If there + * is not sufficient space to do this, we try to extend by a single mft record + * or one cluster, if cluster size is above the mft record size, but we only do + * this if there is enough free space, which we know from the values returned + * by the failed cluster allocation function when we tried to do the first + * allocation. + * + * No matter how many mft records we allocate, we initialize only the first + * allocated mft record, incrementing mft data size and initialized size + * accordingly, open an ntfs_inode for it and return it to the caller, unless + * there are less than 24 mft records, in which case we allocate and initialize + * mft records until we reach record 24 which we consider as the first free mft + * record for use by normal files. + * + * If during any stage we overflow the initialized data in the mft bitmap, we + * extend the initialized size (and data size) by 8 bytes, allocating another + * cluster if required. The bitmap data size has to be at least equal to the + * number of mft records in the mft, but it can be bigger, in which case the + * superfluous bits are padded with zeroes. + * + * Thus, when we return successfully (return value non-zero), we will have: + * - initialized / extended the mft bitmap if necessary, + * - initialized / extended the mft data if necessary, + * - set the bit corresponding to the mft record being allocated in the + * mft bitmap, + * - open an ntfs_inode for the allocated mft record, and we will + * - return the ntfs_inode. + * + * On error (return value zero), nothing will have changed. If we had changed + * anything before the error occurred, we will have reverted back to the + * starting state before returning to the caller. Thus, except for bugs, we + * should always leave the volume in a consistent state when returning from + * this function. + * + * Note, this function cannot make use of most of the normal functions, like + * for example for attribute resizing, etc, because when the run list overflows + * the base mft record and an attribute list is used, it is very important that + * the extension mft records used to store the $DATA attribute of $MFT can be + * reached without having to read the information contained inside them, as + * this would make it impossible to find them in the first place after the + * volume is dismounted. $MFT/$BITMAP probably does not need to follow this + * rule because the bitmap is not essential for finding the mft records, but on + * the other hand, handling the bitmap in this special way would make life + * easier because otherwise there might be circular invocations of functions + * when reading the bitmap but if we are careful, we should be able to avoid + * all problems. + */ +ntfs_inode *ntfs_mft_record_alloc(ntfs_volume *vol, ntfs_inode *base_ni) +{ + s64 ll, bit; + ntfs_attr *mft_na, *mftbmp_na; + MFT_RECORD *m; + ntfs_inode *ni = NULL; + int err; + le16 seq_no, usn; + + if (base_ni) + ntfs_log_enter("Entering (allocating an extent mft record for " + "base mft record %lld).\n", + (long long)base_ni->mft_no); + else + ntfs_log_enter("Entering (allocating a base mft record)\n"); + if (!vol || !vol->mft_na || !vol->mftbmp_na) { + errno = EINVAL; + goto out; + } + + if (ntfs_is_mft(base_ni)) { + ni = ntfs_mft_rec_alloc(vol); + goto out; + } + + mft_na = vol->mft_na; + mftbmp_na = vol->mftbmp_na; +retry: + bit = ntfs_mft_bitmap_find_free_rec(vol, base_ni); + if (bit >= 0) { + ntfs_log_debug("found free record (#1) at %lld\n", + (long long)bit); + goto found_free_rec; + } + if (errno != ENOSPC) + goto out; + /* + * No free mft records left. If the mft bitmap already covers more + * than the currently used mft records, the next records are all free, + * so we can simply allocate the first unused mft record. + * Note: We also have to make sure that the mft bitmap at least covers + * the first 24 mft records as they are special and whilst they may not + * be in use, we do not allocate from them. + */ + ll = mft_na->initialized_size >> vol->mft_record_size_bits; + if (mftbmp_na->initialized_size << 3 > ll && + mftbmp_na->initialized_size > RESERVED_MFT_RECORDS / 8) { + bit = ll; + if (bit < RESERVED_MFT_RECORDS) + bit = RESERVED_MFT_RECORDS; + ntfs_log_debug("found free record (#2) at %lld\n", + (long long)bit); + goto found_free_rec; + } + /* + * The mft bitmap needs to be expanded until it covers the first unused + * mft record that we can allocate. + * Note: The smallest mft record we allocate is mft record 24. + */ + ntfs_log_debug("Status of mftbmp before extension: allocated_size 0x%llx, " + "data_size 0x%llx, initialized_size 0x%llx.\n", + (long long)mftbmp_na->allocated_size, + (long long)mftbmp_na->data_size, + (long long)mftbmp_na->initialized_size); + if (mftbmp_na->initialized_size + 8 > mftbmp_na->allocated_size) { + + int ret = ntfs_mft_bitmap_extend_allocation(vol); + + if (ret == STATUS_ERROR) + goto err_out; + if (ret == STATUS_KEEP_SEARCHING) { + ret = ntfs_mft_bitmap_extend_allocation(vol); + if (ret != STATUS_OK) + goto err_out; + } + + ntfs_log_debug("Status of mftbmp after allocation extension: " + "allocated_size 0x%llx, data_size 0x%llx, " + "initialized_size 0x%llx.\n", + (long long)mftbmp_na->allocated_size, + (long long)mftbmp_na->data_size, + (long long)mftbmp_na->initialized_size); + } + /* + * We now have sufficient allocated space, extend the initialized_size + * as well as the data_size if necessary and fill the new space with + * zeroes. + */ + bit = mftbmp_na->initialized_size << 3; + if (ntfs_mft_bitmap_extend_initialized(vol)) + goto err_out; + ntfs_log_debug("Status of mftbmp after initialized extension: " + "allocated_size 0x%llx, data_size 0x%llx, " + "initialized_size 0x%llx.\n", + (long long)mftbmp_na->allocated_size, + (long long)mftbmp_na->data_size, + (long long)mftbmp_na->initialized_size); + ntfs_log_debug("found free record (#3) at %lld\n", (long long)bit); +found_free_rec: + /* @bit is the found free mft record, allocate it in the mft bitmap. */ + if (ntfs_bitmap_set_bit(mftbmp_na, bit)) { + ntfs_log_error("Failed to allocate bit in mft bitmap.\n"); + goto err_out; + } + + /* The mft bitmap is now uptodate. Deal with mft data attribute now. */ + ll = (bit + 1) << vol->mft_record_size_bits; + if (ll > mft_na->initialized_size) + if (ntfs_mft_record_init(vol, ll) < 0) + goto undo_mftbmp_alloc; + + /* + * We now have allocated and initialized the mft record. Need to read + * it from disk and re-format it, preserving the sequence number if it + * is not zero as well as the update sequence number if it is not zero + * or -1 (0xffff). + */ + m = ntfs_malloc(vol->mft_record_size); + if (!m) + goto undo_mftbmp_alloc; + + if (ntfs_mft_record_read(vol, bit, m)) { + free(m); + goto undo_mftbmp_alloc; + } + /* Sanity check that the mft record is really not in use. */ + if (ntfs_is_file_record(m->magic) && (m->flags & MFT_RECORD_IN_USE)) { + ntfs_log_error("Inode %lld is used but it wasn't marked in " + "$MFT bitmap. Fixed.\n", (long long)bit); + free(m); + goto retry; + } + seq_no = m->sequence_number; + usn = *(le16*)((u8*)m + le16_to_cpu(m->usa_ofs)); + if (ntfs_mft_record_layout(vol, bit, m)) { + ntfs_log_error("Failed to re-format mft record.\n"); + free(m); + goto undo_mftbmp_alloc; + } + if (seq_no) + m->sequence_number = seq_no; + seq_no = usn; + if (seq_no && seq_no != const_cpu_to_le16(0xffff)) + *(le16*)((u8*)m + le16_to_cpu(m->usa_ofs)) = usn; + /* Set the mft record itself in use. */ + m->flags |= MFT_RECORD_IN_USE; + /* Now need to open an ntfs inode for the mft record. */ + ni = ntfs_inode_allocate(vol); + if (!ni) { + ntfs_log_error("Failed to allocate buffer for inode.\n"); + free(m); + goto undo_mftbmp_alloc; + } + ni->mft_no = bit; + ni->mrec = m; + /* + * If we are allocating an extent mft record, make the opened inode an + * extent inode and attach it to the base inode. Also, set the base + * mft record reference in the extent inode. + */ + if (base_ni) { + ni->nr_extents = -1; + ni->base_ni = base_ni; + m->base_mft_record = MK_LE_MREF(base_ni->mft_no, + le16_to_cpu(base_ni->mrec->sequence_number)); + /* + * Attach the extent inode to the base inode, reallocating + * memory if needed. + */ + if (!(base_ni->nr_extents & 3)) { + ntfs_inode **extent_nis; + int i; + + i = (base_ni->nr_extents + 4) * sizeof(ntfs_inode *); + extent_nis = ntfs_malloc(i); + if (!extent_nis) { + free(m); + free(ni); + goto undo_mftbmp_alloc; + } + if (base_ni->nr_extents) { + memcpy(extent_nis, base_ni->extent_nis, + i - 4 * sizeof(ntfs_inode *)); + free(base_ni->extent_nis); + } + base_ni->extent_nis = extent_nis; + } + base_ni->extent_nis[base_ni->nr_extents++] = ni; + } + /* Make sure the allocated inode is written out to disk later. */ + ntfs_inode_mark_dirty(ni); + /* Initialize time, allocated and data size in ntfs_inode struct. */ + ni->data_size = ni->allocated_size = 0; + ni->flags = 0; + ni->creation_time = ni->last_data_change_time = + ni->last_mft_change_time = + ni->last_access_time = ntfs_current_time(); + /* Update the default mft allocation position if it was used. */ + if (!base_ni) + vol->mft_data_pos = bit + 1; + /* Return the opened, allocated inode of the allocated mft record. */ + ntfs_log_debug("allocated %sinode 0x%llx.\n", + base_ni ? "extent " : "", (long long)bit); + vol->free_mft_records--; +out: + ntfs_log_leave("\n"); + return ni; + +undo_mftbmp_alloc: + err = errno; + if (ntfs_bitmap_clear_bit(mftbmp_na, bit)) + ntfs_log_error("Failed to clear bit in mft bitmap.%s\n", es); + errno = err; +err_out: + if (!errno) + errno = EIO; + ni = NULL; + goto out; +} + +/** + * ntfs_mft_record_free - free an mft record on an ntfs volume + * @vol: volume on which to free the mft record + * @ni: open ntfs inode of the mft record to free + * + * Free the mft record of the open inode @ni on the mounted ntfs volume @vol. + * Note that this function calls ntfs_inode_close() internally and hence you + * cannot use the pointer @ni any more after this function returns success. + * + * On success return 0 and on error return -1 with errno set to the error code. + */ +int ntfs_mft_record_free(ntfs_volume *vol, ntfs_inode *ni) +{ + u64 mft_no; + int err; + u16 seq_no; + le16 old_seq_no; + + ntfs_log_trace("Entering for inode 0x%llx.\n", (long long) ni->mft_no); + + if (!vol || !vol->mftbmp_na || !ni) { + errno = EINVAL; + return -1; + } + + /* Cache the mft reference for later. */ + mft_no = ni->mft_no; + + /* Mark the mft record as not in use. */ + ni->mrec->flags &= ~MFT_RECORD_IN_USE; + + /* Increment the sequence number, skipping zero, if it is not zero. */ + old_seq_no = ni->mrec->sequence_number; + seq_no = le16_to_cpu(old_seq_no); + if (seq_no == 0xffff) + seq_no = 1; + else if (seq_no) + seq_no++; + ni->mrec->sequence_number = cpu_to_le16(seq_no); + + /* Set the inode dirty and write it out. */ + ntfs_inode_mark_dirty(ni); + if (ntfs_inode_sync(ni)) { + err = errno; + goto sync_rollback; + } + + /* Clear the bit in the $MFT/$BITMAP corresponding to this record. */ + if (ntfs_bitmap_clear_bit(vol->mftbmp_na, mft_no)) { + err = errno; + // FIXME: If ntfs_bitmap_clear_run() guarantees rollback on + // error, this could be changed to goto sync_rollback; + goto bitmap_rollback; + } + + /* Throw away the now freed inode. */ +#if CACHE_NIDATA_SIZE + if (!ntfs_inode_real_close(ni)) { +#else + if (!ntfs_inode_close(ni)) { +#endif + vol->free_mft_records++; + return 0; + } + err = errno; + + /* Rollback what we did... */ +bitmap_rollback: + if (ntfs_bitmap_set_bit(vol->mftbmp_na, mft_no)) + ntfs_log_debug("Eeek! Rollback failed in ntfs_mft_record_free(). " + "Leaving inconsistent metadata!\n"); +sync_rollback: + ni->mrec->flags |= MFT_RECORD_IN_USE; + ni->mrec->sequence_number = old_seq_no; + ntfs_inode_mark_dirty(ni); + errno = err; + return -1; +} + +/** + * ntfs_mft_usn_dec - Decrement USN by one + * @mrec: pointer to an mft record + * + * On success return 0 and on error return -1 with errno set. + */ +int ntfs_mft_usn_dec(MFT_RECORD *mrec) +{ + u16 usn; + le16 *usnp; + + if (!mrec) { + errno = EINVAL; + return -1; + } + usnp = (le16*)((char*)mrec + le16_to_cpu(mrec->usa_ofs)); + usn = le16_to_cpup(usnp); + if (usn-- <= 1) + usn = 0xfffe; + *usnp = cpu_to_le16(usn); + + return 0; +} + diff --git a/portlibs/sources/libntfs/mft.h b/portlibs/sources/libntfs/mft.h new file mode 100644 index 00000000..bb15f0f3 --- /dev/null +++ b/portlibs/sources/libntfs/mft.h @@ -0,0 +1,132 @@ +/* + * mft.h - Exports for MFT record handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2002 Anton Altaparmakov + * Copyright (c) 2004-2005 Richard Russon + * Copyright (c) 2006-2008 Szabolcs Szakacsits + * + * 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 + */ + +#ifndef _NTFS_MFT_H +#define _NTFS_MFT_H + +#include "volume.h" +#include "inode.h" +#include "layout.h" +#include "logging.h" + +extern int ntfs_mft_records_read(const ntfs_volume *vol, const MFT_REF mref, + const s64 count, MFT_RECORD *b); + +/** + * ntfs_mft_record_read - read a record from the mft + * @vol: volume to read from + * @mref: mft record number to read + * @b: output data buffer + * + * Read the mft record specified by @mref from volume @vol into buffer @b. + * Return 0 on success or -1 on error, with errno set to the error code. + * + * The read mft record is mst deprotected and is hence ready to use. The caller + * should check the record with is_baad_record() in case mst deprotection + * failed. + * + * NOTE: @b has to be at least of size vol->mft_record_size. + */ +static __inline__ int ntfs_mft_record_read(const ntfs_volume *vol, + const MFT_REF mref, MFT_RECORD *b) +{ + int ret; + + ntfs_log_enter("Entering for inode %lld\n", (long long)MREF(mref)); + ret = ntfs_mft_records_read(vol, mref, 1, b); + ntfs_log_leave("\n"); + return ret; +} + +extern int ntfs_mft_record_check(const ntfs_volume *vol, const MFT_REF mref, + MFT_RECORD *m); + +extern int ntfs_file_record_read(const ntfs_volume *vol, const MFT_REF mref, + MFT_RECORD **mrec, ATTR_RECORD **attr); + +extern int ntfs_mft_records_write(const ntfs_volume *vol, const MFT_REF mref, + const s64 count, MFT_RECORD *b); + +/** + * ntfs_mft_record_write - write an mft record to disk + * @vol: volume to write to + * @mref: mft record number to write + * @b: data buffer containing the mft record to write + * + * Write the mft record specified by @mref from buffer @b to volume @vol. + * Return 0 on success or -1 on error, with errno set to the error code. + * + * Before the mft record is written, it is mst protected. After the write, it + * is deprotected again, thus resulting in an increase in the update sequence + * number inside the buffer @b. + * + * NOTE: @b has to be at least of size vol->mft_record_size. + */ +static __inline__ int ntfs_mft_record_write(const ntfs_volume *vol, + const MFT_REF mref, MFT_RECORD *b) +{ + int ret; + + ntfs_log_enter("Entering for inode %lld\n", (long long)MREF(mref)); + ret = ntfs_mft_records_write(vol, mref, 1, b); + ntfs_log_leave("\n"); + return ret; +} + +/** + * ntfs_mft_record_get_data_size - return number of bytes used in mft record @b + * @m: mft record to get the data size of + * + * Takes the mft record @m and returns the number of bytes used in the record + * or 0 on error (i.e. @m is not a valid mft record). Zero is not a valid size + * for an mft record as it at least has to have the MFT_RECORD itself and a + * zero length attribute of type AT_END, thus making the minimum size 56 bytes. + * + * Aside: The size is independent of NTFS versions 1.x/3.x because the 8-byte + * alignment of the first attribute mask the difference in MFT_RECORD size + * between NTFS 1.x and 3.x. Also, you would expect every mft record to + * contain an update sequence array as well but that could in theory be + * non-existent (don't know if Windows' NTFS driver/chkdsk wouldn't view this + * as corruption in itself though). + */ +static __inline__ u32 ntfs_mft_record_get_data_size(const MFT_RECORD *m) +{ + if (!m || !ntfs_is_mft_record(m->magic)) + return 0; + /* Get the number of used bytes and return it. */ + return le32_to_cpu(m->bytes_in_use); +} + +extern int ntfs_mft_record_layout(const ntfs_volume *vol, const MFT_REF mref, + MFT_RECORD *mrec); + +extern int ntfs_mft_record_format(const ntfs_volume *vol, const MFT_REF mref); + +extern ntfs_inode *ntfs_mft_record_alloc(ntfs_volume *vol, ntfs_inode *base_ni); + +extern int ntfs_mft_record_free(ntfs_volume *vol, ntfs_inode *ni); + +extern int ntfs_mft_usn_dec(MFT_RECORD *mrec); + +#endif /* defined _NTFS_MFT_H */ + diff --git a/portlibs/sources/libntfs/misc.c b/portlibs/sources/libntfs/misc.c new file mode 100644 index 00000000..22b2e878 --- /dev/null +++ b/portlibs/sources/libntfs/misc.c @@ -0,0 +1,65 @@ +/** + * misc.c : miscellaneous : + * - dealing with errors in memory allocation + * + * Copyright (c) 2008 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_STRING_H +#include <string.h> +#endif + +#include "types.h" +#include "misc.h" +#include "logging.h" +#include "mem2.h" + +/** + * ntfs_calloc + * + * Return a pointer to the allocated memory or NULL if the request fails. + */ +void *ntfs_calloc(size_t size) +{ + void *p; + + p = MEM2_alloc(size); + if(p) + memset(p, 0, size); + + if (!p) + ntfs_log_perror("Failed to calloc %lld bytes", (long long)size); + return p; +} + +void *ntfs_malloc(size_t size) +{ + void *p; + + p = MEM2_alloc(size); + if (!p) + ntfs_log_perror("Failed to malloc %lld bytes", (long long)size); + return p; +} diff --git a/portlibs/sources/libntfs/misc.h b/portlibs/sources/libntfs/misc.h new file mode 100644 index 00000000..a03e964e --- /dev/null +++ b/portlibs/sources/libntfs/misc.h @@ -0,0 +1,30 @@ +/* + * misc.h : miscellaneous exports + * - memory allocation + * + * Copyright (c) 2008 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 + */ + +#ifndef _NTFS_MISC_H_ +#define _NTFS_MISC_H_ + +void *ntfs_calloc(size_t size); +void *ntfs_malloc(size_t size); + +#endif /* _NTFS_MISC_H_ */ + diff --git a/portlibs/sources/libntfs/mst.c b/portlibs/sources/libntfs/mst.c new file mode 100644 index 00000000..470942d6 --- /dev/null +++ b/portlibs/sources/libntfs/mst.c @@ -0,0 +1,231 @@ +/** + * mst.c - Multi sector fixup handling code. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2004 Anton Altaparmakov + * Copyright (c) 2006-2009 Szabolcs Szakacsits + * + * 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_ERRNO_H +#include <errno.h> +#endif + +#include "mst.h" +#include "logging.h" + +/** + * ntfs_mst_post_read_fixup - deprotect multi sector transfer protected data + * @b: pointer to the data to deprotect + * @size: size in bytes of @b + * + * Perform the necessary post read multi sector transfer fixups and detect the + * presence of incomplete multi sector transfers. - In that case, overwrite the + * magic of the ntfs record header being processed with "BAAD" (in memory only!) + * and abort processing. + * + * Return 0 on success and -1 on error, with errno set to the error code. The + * following error codes are defined: + * EINVAL Invalid arguments or invalid NTFS record in buffer @b. + * EIO Multi sector transfer error was detected. Magic of the NTFS + * record in @b will have been set to "BAAD". + */ +int ntfs_mst_post_read_fixup(NTFS_RECORD *b, const u32 size) +{ + u16 usa_ofs, usa_count, usn; + u16 *usa_pos, *data_pos; + + ntfs_log_trace("Entering\n"); + + /* Setup the variables. */ + usa_ofs = le16_to_cpu(b->usa_ofs); + /* Decrement usa_count to get number of fixups. */ + usa_count = le16_to_cpu(b->usa_count) - 1; + /* Size and alignment checks. */ + if (size & (NTFS_BLOCK_SIZE - 1) || usa_ofs & 1 || + (u32)(usa_ofs + (usa_count * 2)) > size || + (size >> NTFS_BLOCK_SIZE_BITS) != usa_count) { + errno = EINVAL; + ntfs_log_perror("%s: magic: 0x%08x size: %d usa_ofs: %d " + "usa_count: %d", __FUNCTION__, *(le32 *)b, + size, usa_ofs, usa_count); + return -1; + } + /* Position of usn in update sequence array. */ + usa_pos = (u16*)b + usa_ofs/sizeof(u16); + /* + * The update sequence number which has to be equal to each of the + * u16 values before they are fixed up. Note no need to care for + * endianness since we are comparing and moving data for on disk + * structures which means the data is consistent. - If it is + * consistency the wrong endianness it doesn't make any difference. + */ + usn = *usa_pos; + /* + * Position in protected data of first u16 that needs fixing up. + */ + data_pos = (u16*)b + NTFS_BLOCK_SIZE/sizeof(u16) - 1; + /* + * Check for incomplete multi sector transfer(s). + */ + while (usa_count--) { + if (*data_pos != usn) { + /* + * Incomplete multi sector transfer detected! )-: + * Set the magic to "BAAD" and return failure. + * Note that magic_BAAD is already converted to le32. + */ + errno = EIO; + ntfs_log_perror("Incomplete multi-sector transfer: " + "magic: 0x%08x size: %d usa_ofs: %d usa_count:" + " %d data: %d usn: %d", *(le32 *)b, size, + usa_ofs, usa_count, *data_pos, usn); + b->magic = magic_BAAD; + return -1; + } + data_pos += NTFS_BLOCK_SIZE/sizeof(u16); + } + /* Re-setup the variables. */ + usa_count = le16_to_cpu(b->usa_count) - 1; + data_pos = (u16*)b + NTFS_BLOCK_SIZE/sizeof(u16) - 1; + /* Fixup all sectors. */ + while (usa_count--) { + /* + * Increment position in usa and restore original data from + * the usa into the data buffer. + */ + *data_pos = *(++usa_pos); + /* Increment position in data as well. */ + data_pos += NTFS_BLOCK_SIZE/sizeof(u16); + } + return 0; +} + +/** + * ntfs_mst_pre_write_fixup - apply multi sector transfer protection + * @b: pointer to the data to protect + * @size: size in bytes of @b + * + * Perform the necessary pre write multi sector transfer fixup on the data + * pointer to by @b of @size. + * + * Return 0 if fixups applied successfully or -1 if no fixups were performed + * due to errors. In that case errno i set to the error code (EINVAL). + * + * NOTE: We consider the absence / invalidity of an update sequence array to + * mean error. This means that you have to create a valid update sequence + * array header in the ntfs record before calling this function, otherwise it + * will fail (the header needs to contain the position of the update sequence + * array together with the number of elements in the array). You also need to + * initialise the update sequence number before calling this function + * otherwise a random word will be used (whatever was in the record at that + * position at that time). + */ +int ntfs_mst_pre_write_fixup(NTFS_RECORD *b, const u32 size) +{ + u16 usa_ofs, usa_count, usn; + u16 *usa_pos, *data_pos; + + ntfs_log_trace("Entering\n"); + + /* Sanity check + only fixup if it makes sense. */ + if (!b || ntfs_is_baad_record(b->magic) || + ntfs_is_hole_record(b->magic)) { + errno = EINVAL; + ntfs_log_perror("%s: bad argument", __FUNCTION__); + return -1; + } + /* Setup the variables. */ + usa_ofs = le16_to_cpu(b->usa_ofs); + /* Decrement usa_count to get number of fixups. */ + usa_count = le16_to_cpu(b->usa_count) - 1; + /* Size and alignment checks. */ + if (size & (NTFS_BLOCK_SIZE - 1) || usa_ofs & 1 || + (u32)(usa_ofs + (usa_count * 2)) > size || + (size >> NTFS_BLOCK_SIZE_BITS) != usa_count) { + errno = EINVAL; + ntfs_log_perror("%s", __FUNCTION__); + return -1; + } + /* Position of usn in update sequence array. */ + usa_pos = (u16*)((u8*)b + usa_ofs); + /* + * Cyclically increment the update sequence number + * (skipping 0 and -1, i.e. 0xffff). + */ + usn = le16_to_cpup(usa_pos) + 1; + if (usn == 0xffff || !usn) + usn = 1; + usn = cpu_to_le16(usn); + *usa_pos = usn; + /* Position in data of first u16 that needs fixing up. */ + data_pos = (u16*)b + NTFS_BLOCK_SIZE/sizeof(u16) - 1; + /* Fixup all sectors. */ + while (usa_count--) { + /* + * Increment the position in the usa and save the + * original data from the data buffer into the usa. + */ + *(++usa_pos) = *data_pos; + /* Apply fixup to data. */ + *data_pos = usn; + /* Increment position in data as well. */ + data_pos += NTFS_BLOCK_SIZE/sizeof(u16); + } + return 0; +} + +/** + * ntfs_mst_post_write_fixup - deprotect multi sector transfer protected data + * @b: pointer to the data to deprotect + * + * Perform the necessary post write multi sector transfer fixup, not checking + * for any errors, because we assume we have just used + * ntfs_mst_pre_write_fixup(), thus the data will be fine or we would never + * have gotten here. + */ +void ntfs_mst_post_write_fixup(NTFS_RECORD *b) +{ + u16 *usa_pos, *data_pos; + + u16 usa_ofs = le16_to_cpu(b->usa_ofs); + u16 usa_count = le16_to_cpu(b->usa_count) - 1; + + ntfs_log_trace("Entering\n"); + + /* Position of usn in update sequence array. */ + usa_pos = (u16*)b + usa_ofs/sizeof(u16); + + /* Position in protected data of first u16 that needs fixing up. */ + data_pos = (u16*)b + NTFS_BLOCK_SIZE/sizeof(u16) - 1; + + /* Fixup all sectors. */ + while (usa_count--) { + /* + * Increment position in usa and restore original data from + * the usa into the data buffer. + */ + *data_pos = *(++usa_pos); + + /* Increment position in data as well. */ + data_pos += NTFS_BLOCK_SIZE/sizeof(u16); + } +} + diff --git a/portlibs/sources/libntfs/mst.h b/portlibs/sources/libntfs/mst.h new file mode 100644 index 00000000..ca813821 --- /dev/null +++ b/portlibs/sources/libntfs/mst.h @@ -0,0 +1,34 @@ +/* + * mst.h - Exports for multi sector transfer fixup functions. + * Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2002 Anton Altaparmakov + * + * 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 + */ + +#ifndef _NTFS_MST_H +#define _NTFS_MST_H + +#include "types.h" +#include "layout.h" + +extern int ntfs_mst_post_read_fixup(NTFS_RECORD *b, const u32 size); +extern int ntfs_mst_pre_write_fixup(NTFS_RECORD *b, const u32 size); +extern void ntfs_mst_post_write_fixup(NTFS_RECORD *b); + +#endif /* defined _NTFS_MST_H */ + diff --git a/portlibs/sources/libntfs/ntfs.c b/portlibs/sources/libntfs/ntfs.c new file mode 100644 index 00000000..9beb31f3 --- /dev/null +++ b/portlibs/sources/libntfs/ntfs.c @@ -0,0 +1,662 @@ +/** + * ntfs.c - Simple functionality for startup, mounting and unmounting of NTFS-based devices. + * + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; 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 + +#include "ntfs.h" +#include "ntfsinternal.h" +#include "ntfsfile.h" +#include "ntfsdir.h" +#include "gekko_io.h" +#include "cache.h" + +// NTFS device driver devoptab +static const devoptab_t devops_ntfs = { + NULL, /* Device name */ + sizeof (ntfs_file_state), + ntfs_open_r, + ntfs_close_r, + ntfs_write_r, + ntfs_read_r, + ntfs_seek_r, + ntfs_fstat_r, + ntfs_stat_r, + ntfs_link_r, + ntfs_unlink_r, + ntfs_chdir_r, + ntfs_rename_r, + ntfs_mkdir_r, + sizeof (ntfs_dir_state), + ntfs_diropen_r, + ntfs_dirreset_r, + ntfs_dirnext_r, + ntfs_dirclose_r, + ntfs_statvfs_r, + ntfs_ftruncate_r, + ntfs_fsync_r, + NULL /* Device data */ +}; + +void ntfsInit (void) +{ + static bool isInit = false; + + // Initialise ntfs-3g (if not already done so) + if (!isInit) { + isInit = true; + + // Set the log handler + #ifdef NTFS_ENABLE_LOG + ntfs_log_set_handler(ntfs_log_handler_stderr); + #else + ntfs_log_set_handler(ntfs_log_handler_null); + #endif + // Set our current local + ntfs_set_locale(); + + } + + return; +} + +int ntfsFindPartitions (const DISC_INTERFACE *interface, sec_t **partitions) +{ + MASTER_BOOT_RECORD mbr; + PARTITION_RECORD *partition = NULL; + sec_t partition_starts[NTFS_MAX_PARTITIONS] = {0}; + int partition_count = 0; + sec_t part_lba = 0; + int i; + + union { + u8 buffer[MAX_SECTOR_SIZE]; + MASTER_BOOT_RECORD mbr; + EXTENDED_BOOT_RECORD ebr; + NTFS_BOOT_SECTOR boot; + } sector; + + // Sanity check + if (!interface) { + errno = EINVAL; + return -1; + } + if (!partitions) + return 0; + + // Initialise ntfs-3g + ntfsInit(); + + // Start the device and check that it is inserted + if (!interface->startup()) { + errno = EIO; + return -1; + } + if (!interface->isInserted()) { + return 0; + } + + // Read the first sector on the device + if (!interface->readSectors(0, 1, §or.buffer)) { + errno = EIO; + return -1; + } + + // If this is the devices master boot record + if (sector.mbr.signature == MBR_SIGNATURE) { + memcpy(&mbr, §or, sizeof(MASTER_BOOT_RECORD)); + ntfs_log_debug("Valid Master Boot Record found\n"); + + // Search the partition table for all NTFS partitions (max. 4 primary partitions) + for (i = 0; i < 4; i++) { + partition = &mbr.partitions[i]; + part_lba = le32_to_cpu(mbr.partitions[i].lba_start); + + ntfs_log_debug("Partition %i: %s, sector %d, type 0x%x\n", i + 1, + partition->status == PARTITION_STATUS_BOOTABLE ? "bootable (active)" : "non-bootable", + part_lba, partition->type); + + // Figure out what type of partition this is + switch (partition->type) { + + // Ignore empty partitions + case PARTITION_TYPE_EMPTY: + continue; + + // NTFS partition + case PARTITION_TYPE_NTFS: { + ntfs_log_debug("Partition %i: Claims to be NTFS\n", i + 1); + + // Read and validate the NTFS partition + if (interface->readSectors(part_lba, 1, §or)) { + if (sector.boot.oem_id == NTFS_OEM_ID) { + ntfs_log_debug("Partition %i: Valid NTFS boot sector found\n", i + 1); + if (partition_count < NTFS_MAX_PARTITIONS) { + partition_starts[partition_count] = part_lba; + partition_count++; + } + } else { + ntfs_log_debug("Partition %i: Invalid NTFS boot sector, not actually NTFS\n", i + 1); + } + } + + break; + + } + + // DOS 3.3+ or Windows 95 extended partition + case PARTITION_TYPE_DOS33_EXTENDED: + case PARTITION_TYPE_WIN95_EXTENDED: { + ntfs_log_debug("Partition %i: Claims to be Extended\n", i + 1); + + // Walk the extended partition chain, finding all NTFS partitions within it + sec_t ebr_lba = part_lba; + sec_t next_erb_lba = 0; + do { + + // Read and validate the extended boot record + if (interface->readSectors(ebr_lba + next_erb_lba, 1, §or)) { + if (sector.ebr.signature == EBR_SIGNATURE) { + ntfs_log_debug("Logical Partition @ %d: %s type 0x%x\n", ebr_lba + next_erb_lba, + sector.ebr.partition.status == PARTITION_STATUS_BOOTABLE ? "bootable (active)" : "non-bootable", + sector.ebr.partition.type); + + // Get the start sector of the current partition + // and the next extended boot record in the chain + part_lba = ebr_lba + next_erb_lba + le32_to_cpu(sector.ebr.partition.lba_start); + next_erb_lba = le32_to_cpu(sector.ebr.next_ebr.lba_start); + + // Check if this partition has a valid NTFS boot record + if (interface->readSectors(part_lba, 1, §or)) { + if (sector.boot.oem_id == NTFS_OEM_ID) { + ntfs_log_debug("Logical Partition @ %d: Valid NTFS boot sector found\n", part_lba); + if(sector.ebr.partition.type != PARTITION_TYPE_NTFS) { + ntfs_log_warning("Logical Partition @ %d: Is NTFS but type is 0x%x; 0x%x was expected\n", part_lba, sector.ebr.partition.type, PARTITION_TYPE_NTFS); + } + if (partition_count < NTFS_MAX_PARTITIONS) { + partition_starts[partition_count] = part_lba; + partition_count++; + } + } + } + + } else { + next_erb_lba = 0; + } + } + + } while (next_erb_lba); + + break; + + } + + // Unknown or unsupported partition type + default: { + + // Check if this partition has a valid NTFS boot record anyway, + // it might be misrepresented due to a lazy partition editor + if (interface->readSectors(part_lba, 1, §or)) { + if (sector.boot.oem_id == NTFS_OEM_ID) { + ntfs_log_debug("Partition %i: Valid NTFS boot sector found\n", i + 1); + if(partition->type != PARTITION_TYPE_NTFS) { + ntfs_log_warning("Partition %i: Is NTFS but type is 0x%x; 0x%x was expected\n", i + 1, partition->type, PARTITION_TYPE_NTFS); + } + if (partition_count < NTFS_MAX_PARTITIONS) { + partition_starts[partition_count] = part_lba; + partition_count++; + } + } + } + + break; + + } + + } + + } + + // Else it is assumed this device has no master boot record + } else { + ntfs_log_debug("No Master Boot Record was found!\n"); + + // As a last-ditched effort, search the first 64 sectors of the device for stray NTFS partitions + for (i = 0; i < 64; i++) { + if (interface->readSectors(i, 1, §or)) { + if (sector.boot.oem_id == NTFS_OEM_ID) { + ntfs_log_debug("Valid NTFS boot sector found at sector %d!\n", i); + if (partition_count < NTFS_MAX_PARTITIONS) { + partition_starts[partition_count] = i; + partition_count++; + } + } + } + } + + } + + // Return the found partitions (if any) + if (partition_count > 0) { + *partitions = (sec_t*)ntfs_alloc(sizeof(sec_t) * partition_count); + if (*partitions) { + memcpy(*partitions, &partition_starts, sizeof(sec_t) * partition_count); + return partition_count; + } + } + + return 0; +} + +int ntfsMountAll (ntfs_md **mounts, u32 flags) +{ + const INTERFACE_ID *discs = ntfsGetDiscInterfaces(); + const INTERFACE_ID *disc = NULL; + ntfs_md mount_points[NTFS_MAX_MOUNTS]; + sec_t *partitions = NULL; + int mount_count = 0; + int partition_count = 0; + char name[128]; + int i, j, k; + + // Initialise ntfs-3g + ntfsInit(); + + // Find and mount all NTFS partitions on all known devices + for (i = 0; discs[i].name != NULL && discs[i].interface != NULL; i++) { + disc = &discs[i]; + partition_count = ntfsFindPartitions(disc->interface, &partitions); + if (partition_count > 0 && partitions) { + for (j = 0, k = 0; j < partition_count; j++) { + + // Find the next unused mount name + do { + sprintf(name, "%s%i", NTFS_MOUNT_PREFIX, k++); + if (k >= NTFS_MAX_MOUNTS) { + ntfs_free(partitions); + errno = EADDRNOTAVAIL; + return -1; + } + } while (ntfsGetDevice(name, false)); + + // Mount the partition + if (mount_count < NTFS_MAX_MOUNTS) { + if (ntfsMount(name, disc->interface, partitions[j], CACHE_DEFAULT_PAGE_SIZE, CACHE_DEFAULT_PAGE_COUNT, flags)) { + strcpy(mount_points[mount_count].name, name); + mount_points[mount_count].interface = disc->interface; + mount_points[mount_count].startSector = partitions[j]; + mount_count++; + } + } + + } + ntfs_free(partitions); + } + } + + // Return the mounts (if any) + if (mount_count > 0 && mounts) { + *mounts = (ntfs_md*)ntfs_alloc(sizeof(ntfs_md) * mount_count); + if (*mounts) { + memcpy(*mounts, &mount_points, sizeof(ntfs_md) * mount_count); + return mount_count; + } + } + + return 0; +} + +int ntfsMountDevice (const DISC_INTERFACE *interface, ntfs_md **mounts, u32 flags) +{ + const INTERFACE_ID *discs = ntfsGetDiscInterfaces(); + const INTERFACE_ID *disc = NULL; + ntfs_md mount_points[NTFS_MAX_MOUNTS]; + sec_t *partitions = NULL; + int mount_count = 0; + int partition_count = 0; + char name[128]; + int i, j, k; + + // Sanity check + if (!interface) { + errno = EINVAL; + return -1; + } + + // Initialise ntfs-3g + ntfsInit(); + + // Find the specified device then find and mount all NTFS partitions on it + for (i = 0; discs[i].name != NULL && discs[i].interface != NULL; i++) { + if (discs[i].interface == interface) { + disc = &discs[i]; + partition_count = ntfsFindPartitions(disc->interface, &partitions); + if (partition_count > 0 && partitions) { + for (j = 0, k = 0; j < partition_count; j++) { + + // Find the next unused mount name + do { + sprintf(name, "%s%i", NTFS_MOUNT_PREFIX, k++); + if (k >= NTFS_MAX_MOUNTS) { + ntfs_free(partitions); + errno = EADDRNOTAVAIL; + return -1; + } + } while (ntfsGetDevice(name, false)); + + // Mount the partition + if (mount_count < NTFS_MAX_MOUNTS) { + if (ntfsMount(name, disc->interface, partitions[j], CACHE_DEFAULT_PAGE_SIZE, CACHE_DEFAULT_PAGE_COUNT, flags)) { + strcpy(mount_points[mount_count].name, name); + mount_points[mount_count].interface = disc->interface; + mount_points[mount_count].startSector = partitions[j]; + mount_count++; + } + } + + } + ntfs_free(partitions); + } + break; + } + } + + // If we couldn't find the device then return with error status + if (!disc) { + errno = ENODEV; + return -1; + } + + // Return the mounts (if any) + if (mount_count > 0 && mounts) { + *mounts = (ntfs_md*)ntfs_alloc(sizeof(ntfs_md) * mount_count); + if (*mounts) { + memcpy(*mounts, &mount_points, sizeof(ntfs_md) * mount_count); + return mount_count; + } + } + + return 0; +} + +bool ntfsMount (const char *name, const DISC_INTERFACE *interface, sec_t startSector, u32 cachePageCount, u32 cachePageSize, u32 flags) +{ + ntfs_vd *vd = NULL; + gekko_fd *fd = NULL; + + // Sanity check + if (!name || !interface) { + errno = EINVAL; + return false; + } + + // Initialise ntfs-3g + ntfsInit(); + + // Check that the requested mount name is free + if (ntfsGetDevice(name, false)) { + errno = EADDRINUSE; + return false; + } + + // Check that we can at least read from this device + if (!(interface->features & FEATURE_MEDIUM_CANREAD)) { + errno = EPERM; + return false; + } + + // Allocate the volume descriptor + vd = (ntfs_vd*)ntfs_alloc(sizeof(ntfs_vd)); + if (!vd) { + errno = ENOMEM; + return false; + } + + // Setup the volume descriptor + vd->id = interface->ioType; + vd->flags = 0; + vd->uid = 0; + vd->gid = 0; + vd->fmask = 0; + vd->dmask = 0; + vd->atime = ((flags & NTFS_UPDATE_ACCESS_TIMES) ? ATIME_ENABLED : ATIME_DISABLED); + vd->showHiddenFiles = (flags & NTFS_SHOW_HIDDEN_FILES); + vd->showSystemFiles = (flags & NTFS_SHOW_SYSTEM_FILES); + + // Allocate the device driver descriptor + fd = (gekko_fd*)ntfs_alloc(sizeof(gekko_fd)); + if (!fd) { + ntfs_free(vd); + errno = ENOMEM; + return false; + } + + // Setup the device driver descriptor + fd->interface = interface; + fd->startSector = startSector; + fd->sectorSize = 0; + fd->sectorCount = 0; + fd->cachePageCount = cachePageCount; + fd->cachePageSize = cachePageSize; + + // Allocate the device driver + vd->dev = ntfs_device_alloc(name, 0, &ntfs_device_gekko_io_ops, fd); + if (!vd->dev) { + ntfs_free(fd); + ntfs_free(vd); + return false; + } + + // Build the mount flags + if (flags & NTFS_READ_ONLY) + vd->flags |= MS_RDONLY; + else + { + if (!(interface->features & FEATURE_MEDIUM_CANWRITE)) + vd->flags |= MS_RDONLY; + if ((interface->features & FEATURE_MEDIUM_CANREAD) && (interface->features & FEATURE_MEDIUM_CANWRITE)) + vd->flags |= MS_EXCLUSIVE; + } + if (flags & NTFS_RECOVER) + vd->flags |= MS_RECOVER; + if (flags & NTFS_IGNORE_HIBERFILE) + vd->flags |= MS_IGNORE_HIBERFILE; + + if (vd->flags & MS_RDONLY) + ntfs_log_debug("Mounting \"%s\" as read-only\n", name); + + // Mount the device + vd->vol = ntfs_device_mount(vd->dev, vd->flags); + if (!vd->vol) { + switch(ntfs_volume_error(errno)) { + case NTFS_VOLUME_NOT_NTFS: errno = EINVALPART; break; + case NTFS_VOLUME_CORRUPT: errno = EINVALPART; break; + case NTFS_VOLUME_HIBERNATED: errno = EHIBERNATED; break; + case NTFS_VOLUME_UNCLEAN_UNMOUNT: errno = EDIRTY; break; + default: errno = EINVAL; break; + } + ntfs_device_free(vd->dev); + ntfs_free(vd); + return false; + } + + if (flags & NTFS_IGNORE_CASE) + ntfs_set_ignore_case(vd->vol); + + // Initialise the volume descriptor + if (ntfsInitVolume(vd)) { + ntfs_umount(vd->vol, true); + ntfs_free(vd); + return false; + } + + // Add the device to the devoptab table + if (ntfsAddDevice(name, vd)) { + ntfsDeinitVolume(vd); + ntfs_umount(vd->vol, true); + ntfs_free(vd); + return false; + } + + return true; +} + +void ntfsUnmount (const char *name, bool force) +{ + ntfs_vd *vd = NULL; + + // Get the devices volume descriptor + vd = ntfsGetVolume(name); + if (!vd) + return; + + // Remove the device from the devoptab table + ntfsRemoveDevice(name); + + // Deinitialise the volume descriptor + ntfsDeinitVolume(vd); + + // Unmount the volume + ntfs_umount(vd->vol, force); + + // Free the volume descriptor + ntfs_free(vd); + + return; +} + +const char *ntfsGetVolumeName (const char *name) +{ + ntfs_vd *vd = NULL; + + // Sanity check + if (!name) { + errno = EINVAL; + return NULL; + } + + // Get the devices volume descriptor + vd = ntfsGetVolume(name); + if (!vd) { + errno = ENODEV; + return NULL; + } + return vd->vol->vol_name; +} + +bool ntfsSetVolumeName (const char *name, const char *volumeName) +{ + ntfs_vd *vd = NULL; + ntfs_attr *na = NULL; + ntfschar *ulabel = NULL; + int ulabel_len; + + // Sanity check + if (!name) { + errno = EINVAL; + return false; + } + + // Get the devices volume descriptor + vd = ntfsGetVolume(name); + if (!vd) { + errno = ENODEV; + return false; + } + + // Lock + ntfsLock(vd); + + // Convert the new volume name to unicode + ulabel_len = ntfsLocalToUnicode(volumeName, &ulabel) * sizeof(ntfschar); + if (ulabel_len < 0) { + ntfsUnlock(vd); + errno = EINVAL; + return false; + } + + // Check if the volume name attribute exists + na = ntfs_attr_open(vd->vol->vol_ni, AT_VOLUME_NAME, NULL, 0); + if (na) { + + // It does, resize it to match the length of the new volume name + if (ntfs_attr_truncate(na, ulabel_len)) { + free(ulabel); + ntfsUnlock(vd); + return false; + } + + // Write the new volume name + if (ntfs_attr_pwrite(na, 0, ulabel_len, ulabel) != ulabel_len) { + free(ulabel); + ntfsUnlock(vd); + return false; + } + + } else { + + // It doesn't, create it now + if (ntfs_attr_add(vd->vol->vol_ni, AT_VOLUME_NAME, NULL, 0, (u8*)ulabel, ulabel_len)) { + free(ulabel); + ntfsUnlock(vd); + return false; + } + + } + + // Reset the volumes name cache (as it has now been changed) + vd->name[0] = '\0'; + + // Close the volume name attribute + if (na) + ntfs_attr_close(na); + + // Sync the volume node + if (ntfs_inode_sync(vd->vol->vol_ni)) { + free(ulabel); + ntfsUnlock(vd); + return false; + } + + // Clean up + free(ulabel); + + // Unlock + ntfsUnlock(vd); + + return true; +} + +const devoptab_t *ntfsGetDevOpTab (void) +{ + return &devops_ntfs; +} diff --git a/portlibs/sources/libntfs/ntfs.h b/portlibs/sources/libntfs/ntfs.h new file mode 100644 index 00000000..22474232 --- /dev/null +++ b/portlibs/sources/libntfs/ntfs.h @@ -0,0 +1,147 @@ +/** + * ntfs.h - Simple functionality for startup, mounting and unmounting of NTFS-based devices. + * + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef _LIBNTFS_H +#define _LIBNTFS_H + +#ifdef __cplusplus +extern "C" { +#endif + +#include <gctypes.h> +#include <gccore.h> +#include <ogc/disc_io.h> + +/* NTFS errno values */ +#define ENOPART 3000 /* No partition was found */ +#define EINVALPART 3001 /* Specified partition is invalid or not supported */ +#define EDIRTY 3002 /* Volume is dirty and NTFS_RECOVER was not specified during mount */ +#define EHIBERNATED 3003 /* Volume is hibernated and NTFS_IGNORE_HIBERFILE was not specified during mount */ + +/* NTFS cache options */ +#define CACHE_DEFAULT_PAGE_COUNT 8 /* The default number of pages in the cache */ +#define CACHE_DEFAULT_PAGE_SIZE 128 /* The default number of sectors per cache page */ + +/* NTFS mount flags */ +#define NTFS_DEFAULT 0x00000000 /* Standard mount, expects a clean, non-hibernated volume */ +#define NTFS_SHOW_HIDDEN_FILES 0x00000001 /* Display hidden files when enumerating directories */ +#define NTFS_SHOW_SYSTEM_FILES 0x00000002 /* Display system files when enumerating directories */ +#define NTFS_UPDATE_ACCESS_TIMES 0x00000004 /* Update file and directory access times */ +#define NTFS_RECOVER 0x00000008 /* Reset $LogFile if dirty (i.e. from unclean disconnect) */ +#define NTFS_IGNORE_HIBERFILE 0x00000010 /* Mount even if volume is hibernated */ +#define NTFS_READ_ONLY 0x00000020 /* Mount in read only mode */ +#define NTFS_IGNORE_CASE 0x00000040 /* Ignore case sensitivity. Everything must be and will be provided in lowercase. */ +#define NTFS_SU NTFS_SHOW_HIDDEN_FILES | NTFS_SHOW_SYSTEM_FILES +#define NTFS_FORCE NTFS_RECOVER | NTFS_IGNORE_HIBERFILE + +/** + * ntfs_md - NTFS mount descriptor + */ +typedef struct _ntfs_md { + char name[32]; /* Mount name (can be accessed as "name:/") */ + const DISC_INTERFACE *interface; /* Block device containing the mounted partition */ + sec_t startSector; /* Local block address to first sector of partition */ +} ntfs_md; + +/** + * Find all NTFS partitions on a block device. + * + * @param INTERFACE The block device to search + * @param PARTITIONS (out) A pointer to receive the array of partition start sectors + * + * @return The number of entries in PARTITIONS or -1 if an error occurred (see errno) + * @note The caller is responsible for freeing PARTITIONS when finished with it + */ +extern int ntfsFindPartitions (const DISC_INTERFACE *interface, sec_t **partitions); + +/** + * Mount all NTFS partitions on all inserted block devices. + * + * @param MOUNTS (out) A pointer to receive the array of mount descriptors + * @param FLAGS Additional mounting flags. (see above) + * + * @return The number of entries in MOUNTS or -1 if an error occurred (see errno) + * @note The caller is responsible for freeing MOUNTS when finished with it + * @note All device caches are setup using default values (see above) + */ +extern int ntfsMountAll (ntfs_md **mounts, u32 flags); + +/** + * Mount all NTFS partitions on a block devices. + * + * @param INTERFACE The block device to mount. + * @param MOUNTS (out) A pointer to receive the array of mount descriptors + * @param FLAGS Additional mounting flags. (see above) + * + * @return The number of entries in MOUNTS or -1 if an error occurred (see errno) + * @note The caller is responsible for freeing MOUNTS when finished with it + * @note The device cache is setup using default values (see above) + */ +extern int ntfsMountDevice (const DISC_INTERFACE* interface, ntfs_md **mounts, u32 flags); + +/** + * Mount a NTFS partition from a specific sector on a block device. + * + * @param NAME The name to mount the device under (can then be accessed as "NAME:/") + * @param INTERFACE The block device to mount + * @param STARTSECTOR The sector the partition begins at (see @ntfsFindPartitions) + * @param CACHEPAGECOUNT The total number of pages in the device cache + * @param CACHEPAGESIZE The number of sectors per cache page + * @param FLAGS Additional mounting flags (see above) + * + * @return True if mount was successful, false if no partition was found or an error occurred (see errno) + * @note ntfsFindPartitions should be used first to locate the partitions start sector + */ +extern bool ntfsMount (const char *name, const DISC_INTERFACE *interface, sec_t startSector, u32 cachePageCount, u32 cachePageSize, u32 flags); + +/** + * Unmount a NTFS partition. + * + * @param NAME The name of mount used in ntfsMountSimple() and ntfsMount() + * @param FORCE If true unmount even if the device is busy (may lead to data lose) + */ +extern void ntfsUnmount (const char *name, bool force); + +/** + * Get the volume name of a mounted NTFS partition. + * + * @param NAME The name of mount (see @ntfsMountAll, @ntfsMountDevice, and @ntfsMount) + * + * @return The volumes name if successful or NULL if an error occurred (see errno) + */ +extern const char *ntfsGetVolumeName (const char *name); + +/** + * Set the volume name of a mounted NTFS partition. + * + * @param NAME The name of mount (see @ntfsMountAll, @ntfsMountDevice, and @ntfsMount) + * @param VOLUMENAME The new volume name + * + * @return True if mount was successful, false if an error occurred (see errno) + * @note The mount must be write-enabled else this will fail + */ +extern bool ntfsSetVolumeName (const char *name, const char *volumeName); + +#ifdef __cplusplus +} +#endif + +#endif /* _LIBNTFS_H */ diff --git a/portlibs/sources/libntfs/ntfsdir.c b/portlibs/sources/libntfs/ntfsdir.c new file mode 100644 index 00000000..ad54b514 --- /dev/null +++ b/portlibs/sources/libntfs/ntfsdir.c @@ -0,0 +1,636 @@ +/** + * ntfs_dir.c - devoptab directory routines for NTFS-based devices. + * + * Copyright (c) 2010 Dimok + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; 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_SYS_STATVFS_H +#include <sys/statvfs.h> +#endif +#ifdef HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif + +#include "ntfsinternal.h" +#include "ntfsdir.h" +#include "device.h" +#include <sys/dir.h> + +#define STATE(x) ((ntfs_dir_state*)(x)->dirStruct) + +void ntfsCloseDir (ntfs_dir_state *dir) +{ + // Sanity check + if (!dir || !dir->vd) + return; + + // Free the directory entries (if any) + while (dir->first) { + ntfs_dir_entry *next = dir->first->next; + ntfs_free(dir->first->name); + ntfs_free(dir->first); + dir->first = next; + } + + // Close the directory (if open) + if (dir->ni) + ntfsCloseEntry(dir->vd, dir->ni); + + // Reset the directory state + dir->ni = NULL; + dir->first = NULL; + dir->current = NULL; + + return; +} + +int ntfs_stat_r (struct _reent *r, const char *path, struct stat *st) +{ + // Short circuit cases were we don't actually have to do anything + if (!st || !path) + return 0; + + ntfs_log_trace("path %s, st %p\n", path, st); + + ntfs_vd *vd = NULL; + ntfs_inode *ni = NULL; + + // Get the volume descriptor for this path + vd = ntfsGetVolume(path); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + if(strcmp(path, ".") == 0 || strcmp(path, "..") == 0) + { + memset(st, 0, sizeof(struct stat)); + st->st_mode = S_IFDIR; + return 0; + } + + // Lock + ntfsLock(vd); + + // Find the entry + ni = ntfsOpenEntry(vd, path); + if (!ni) { + r->_errno = errno; + ntfsUnlock(vd); + return -1; + } + + // Get the entry stats + int ret = ntfsStat(vd, ni, st); + if (ret) + r->_errno = errno; + + // Close the entry + ntfsCloseEntry(vd, ni); + + ntfsUnlock(vd); + + return 0; +} + +int ntfs_link_r (struct _reent *r, const char *existing, const char *newLink) +{ + ntfs_log_trace("existing %s, newLink %s\n", existing, newLink); + + ntfs_vd *vd = NULL; + ntfs_inode *ni = NULL; + + // Get the volume descriptor for this path + vd = ntfsGetVolume(existing); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Lock + ntfsLock(vd); + + // Create a symbolic link between the two paths + ni = ntfsCreate(vd, existing, S_IFLNK, newLink); + if (!ni) { + ntfsUnlock(vd); + r->_errno = errno; + return -1; + } + + // Close the symbolic link + ntfsCloseEntry(vd, ni); + + // Unlock + ntfsUnlock(vd); + + return 0; +} + +int ntfs_unlink_r (struct _reent *r, const char *name) +{ + ntfs_log_trace("name %s\n", name); + + // Unlink the entry + int ret = ntfsUnlink(ntfsGetVolume(name), name); + if (ret) + r->_errno = errno; + + return ret; +} + +int ntfs_chdir_r (struct _reent *r, const char *name) +{ + ntfs_log_trace("name %s\n", name); + + ntfs_vd *vd = NULL; + ntfs_inode *ni = NULL; + + // Get the volume descriptor for this path + vd = ntfsGetVolume(name); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Lock + ntfsLock(vd); + + // Find the directory + ni = ntfsOpenEntry(vd, name); + if (!ni) { + ntfsUnlock(vd); + r->_errno = ENOENT; + return -1; + } + + // Ensure that this directory is indeed a directory + if (!(ni->mrec->flags && MFT_RECORD_IS_DIRECTORY)) { + ntfsCloseEntry(vd, ni); + ntfsUnlock(vd); + r->_errno = ENOTDIR; + return -1; + } + + // Close the old current directory (if any) + if (vd->cwd_ni) + ntfsCloseEntry(vd, vd->cwd_ni); + + // Set the new current directory + vd->cwd_ni = ni; + + // Unlock + ntfsUnlock(vd); + + return 0; +} + +int ntfs_rename_r (struct _reent *r, const char *oldName, const char *newName) +{ + ntfs_log_trace("oldName %s, newName %s\n", oldName, newName); + + ntfs_vd *vd = NULL; + ntfs_inode *ni = NULL; + + // Get the volume descriptor for this path + vd = ntfsGetVolume(oldName); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Lock + ntfsLock(vd); + + // You cannot rename between devices + if(vd != ntfsGetVolume(newName)) { + ntfsUnlock(vd); + r->_errno = EXDEV; + return -1; + } + + // Check that there is no existing entry with the new name + ni = ntfsOpenEntry(vd, newName); + if (ni) { + ntfsCloseEntry(vd, ni); + ntfsUnlock(vd); + r->_errno = EEXIST; + return -1; + } + + // Link the old entry with the new one + if (ntfsLink(vd, oldName, newName)) { + ntfsUnlock(vd); + return -1; + } + + // Unlink the old entry + if (ntfsUnlink(vd, oldName)) { + if (ntfsUnlink(vd, newName)) { + ntfsUnlock(vd); + return -1; + } + ntfsUnlock(vd); + return -1; + } + + // Unlock + ntfsUnlock(vd); + + return 0; +} + +int ntfs_mkdir_r (struct _reent *r, const char *path, int mode) +{ + ntfs_log_trace("path %s, mode %i\n", path, mode); + + ntfs_vd *vd = NULL; + ntfs_inode *ni = NULL; + + // Get the volume descriptor for this path + vd = ntfsGetVolume(path); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Lock + ntfsLock(vd); + + // Create the directory + ni = ntfsCreate(vd, path, S_IFDIR, NULL); + if (!ni) { + ntfsUnlock(vd); + r->_errno = errno; + return -1; + } + + // Close the directory + ntfsCloseEntry(vd, ni); + + // Unlock + ntfsUnlock(vd); + + return 0; +} + +int ntfs_statvfs_r (struct _reent *r, const char *path, struct statvfs *buf) +{ + ntfs_log_trace("path %s, buf %p\n", path, buf); + + ntfs_vd *vd = NULL; + s64 size; + int delta_bits; + + // Get the volume descriptor for this path + vd = ntfsGetVolume(path); + if (!vd) { + r->_errno = ENODEV; + return -1; + } + + // Short circuit cases were we don't actually have to do anything + if (!buf) + return 0; + + // Lock + ntfsLock(vd); + + // Zero out the stat buffer + memset(buf, 0, sizeof(struct statvfs)); + + if(ntfs_volume_get_free_space(vd->vol) < 0) + { + ntfsUnlock(vd); + return -1; + } + + // File system block size + buf->f_bsize = vd->vol->cluster_size; + + // Fundamental file system block size + buf->f_frsize = vd->vol->cluster_size; + + // Total number of blocks on file system in units of f_frsize + buf->f_blocks = vd->vol->nr_clusters; + + // Free blocks available for all and for non-privileged processes + size = MAX(vd->vol->free_clusters, 0); + buf->f_bfree = buf->f_bavail = size; + + // Free inodes on the free space + delta_bits = vd->vol->cluster_size_bits - vd->vol->mft_record_size_bits; + if (delta_bits >= 0) + size <<= delta_bits; + else + size >>= -delta_bits; + + // Number of inodes at this point in time + buf->f_files = (vd->vol->mftbmp_na->allocated_size << 3) + size; + + // Free inodes available for all and for non-privileged processes + size += vd->vol->free_mft_records; + buf->f_ffree = buf->f_favail = MAX(size, 0); + + // File system id + buf->f_fsid = vd->id; + + // Bit mask of f_flag values. + buf->f_flag = (NVolReadOnly(vd->vol) ? ST_RDONLY : 0); + + // Maximum length of filenames + buf->f_namemax = NTFS_MAX_NAME_LEN; + + // Unlock + ntfsUnlock(vd); + + return 0; +} + +/** + * PRIVATE: Callback for directory walking + */ +int ntfs_readdir_filler (DIR_ITER *dirState, const ntfschar *name, const int name_len, const int name_type, + const s64 pos, const MFT_REF mref, const unsigned dt_type) +{ + ntfs_dir_state *dir = STATE(dirState); + ntfs_dir_entry *entry = NULL; + char *entry_name = NULL; + + // Sanity check + if (!dir || !dir->vd) { + errno = EINVAL; + return -1; + } + + // Ignore DOS file names + if (name_type == FILE_NAME_DOS) { + return 0; + } + + // Preliminary check that this entry can be enumerated (as described by the volume descriptor) + if (MREF(mref) == FILE_root || MREF(mref) >= FILE_first_user || dir->vd->showSystemFiles) { + + // Convert the entry name to our current local + if (ntfsUnicodeToLocal(name, name_len, &entry_name, 0) < 0) { + return -1; + } + + if(dir->first && dir->first->mref == FILE_root && + MREF(mref) == FILE_root && strcmp(entry_name, "..") == 0) + { + return 0; + } + + // If this is not the parent or self directory reference + if ((strcmp(entry_name, ".") != 0) && (strcmp(entry_name, "..") != 0)) { + + // Open the entry + ntfs_inode *ni = ntfs_pathname_to_inode(dir->vd->vol, dir->ni, entry_name); + if (!ni) + return -1; + + // Double check that this entry can be emuerated (as described by the volume descriptor) + if (((ni->flags & FILE_ATTR_HIDDEN) && !dir->vd->showHiddenFiles) || + ((ni->flags & FILE_ATTR_SYSTEM) && !dir->vd->showSystemFiles)) { + ntfs_inode_close(ni); + return 0; + } + + // Close the entry + ntfs_inode_close(ni); + + } + + // Allocate a new directory entry + entry = (ntfs_dir_entry *) ntfs_alloc(sizeof(ntfs_dir_entry)); + if (!entry) + return -1; + + // Setup the entry + entry->name = entry_name; + entry->next = NULL; + entry->mref = MREF(mref); + + // Link the entry to the directory + if (!dir->first) { + dir->first = entry; + } else { + ntfs_dir_entry *last = dir->first; + while (last->next) last = last->next; + last->next = entry; + } + + } + + return 0; +} + +DIR_ITER *ntfs_diropen_r (struct _reent *r, DIR_ITER *dirState, const char *path) +{ + ntfs_log_trace("dirState %p, path %s\n", dirState, path); + + ntfs_dir_state* dir = STATE(dirState); + s64 position = 0; + + // Get the volume descriptor for this path + dir->vd = ntfsGetVolume(path); + if (!dir->vd) { + r->_errno = ENODEV; + return NULL; + } + + // Lock + ntfsLock(dir->vd); + + // Find the directory + dir->ni = ntfsOpenEntry(dir->vd, path); + if (!dir->ni) { + ntfsUnlock(dir->vd); + r->_errno = ENOENT; + return NULL; + } + + // Ensure that this directory is indeed a directory + if (!(dir->ni->mrec->flags && MFT_RECORD_IS_DIRECTORY)) { + ntfsCloseEntry(dir->vd, dir->ni); + ntfsUnlock(dir->vd); + r->_errno = ENOTDIR; + return NULL; + } + + // Read the directory + dir->first = dir->current = NULL; + if (ntfs_readdir(dir->ni, &position, dirState, (ntfs_filldir_t)ntfs_readdir_filler)) { + ntfsCloseDir(dir); + ntfsUnlock(dir->vd); + r->_errno = errno; + return NULL; + } + + // Move to the first entry in the directory + dir->current = dir->first; + + // Update directory times + ntfsUpdateTimes(dir->vd, dir->ni, NTFS_UPDATE_ATIME); + + // Insert the directory into the double-linked FILO list of open directories + if (dir->vd->firstOpenDir) { + dir->nextOpenDir = dir->vd->firstOpenDir; + dir->vd->firstOpenDir->prevOpenDir = dir; + } else { + dir->nextOpenDir = NULL; + } + dir->prevOpenDir = NULL; + dir->vd->cwd_ni = dir->ni; + dir->vd->firstOpenDir = dir; + dir->vd->openDirCount++; + + // Unlock + ntfsUnlock(dir->vd); + + return dirState; +} + +int ntfs_dirreset_r (struct _reent *r, DIR_ITER *dirState) +{ + ntfs_log_trace("dirState %p\n", dirState); + + ntfs_dir_state* dir = STATE(dirState); + + // Sanity check + if (!dir || !dir->vd || !dir->ni) { + r->_errno = EBADF; + return -1; + } + + // Lock + ntfsLock(dir->vd); + + // Move to the first entry in the directory + dir->current = dir->first; + + // Update directory times + ntfsUpdateTimes(dir->vd, dir->ni, NTFS_UPDATE_ATIME); + + // Unlock + ntfsUnlock(dir->vd); + + return 0; +} + +int ntfs_dirnext_r (struct _reent *r, DIR_ITER *dirState, char *filename, struct stat *filestat) +{ + ntfs_log_trace("dirState %p, filename %p, filestat %p\n", dirState, filename, filestat); + + ntfs_dir_state* dir = STATE(dirState); + ntfs_inode *ni = NULL; + + // Sanity check + if (!dir || !dir->vd || !dir->ni) { + r->_errno = EBADF; + return -1; + } + + // Lock + ntfsLock(dir->vd); + + // Check that there is a entry waiting to be fetched + if (!dir->current) { + ntfsUnlock(dir->vd); + r->_errno = ENOENT; + return -1; + } + + // Fetch the current entry + strcpy(filename, dir->current->name); + if(filestat != NULL) + { + if(strcmp(dir->current->name, ".") == 0 || strcmp(dir->current->name, "..") == 0) + { + memset(filestat, 0, sizeof(struct stat)); + filestat->st_mode = S_IFDIR; + } + else + { + ni = ntfsOpenEntry(dir->vd, dir->current->name); + if (ni) { + ntfsStat(dir->vd, ni, filestat); + ntfsCloseEntry(dir->vd, ni); + } + } + } + + // Move to the next entry in the directory + dir->current = dir->current->next; + + // Update directory times + ntfsUpdateTimes(dir->vd, dir->ni, NTFS_UPDATE_ATIME); + + // Unlock + ntfsUnlock(dir->vd); + + return 0; +} + +int ntfs_dirclose_r (struct _reent *r, DIR_ITER *dirState) +{ + ntfs_log_trace("dirState %p\n", dirState); + + ntfs_dir_state* dir = STATE(dirState); + + // Sanity check + if (!dir || !dir->vd) { + r->_errno = EBADF; + return -1; + } + + // Lock + ntfsLock(dir->vd); + + // Close the directory + ntfsCloseDir(dir); + + // Remove the directory from the double-linked FILO list of open directories + dir->vd->openDirCount--; + if (dir->nextOpenDir) + dir->nextOpenDir->prevOpenDir = dir->prevOpenDir; + if (dir->prevOpenDir) + dir->prevOpenDir->nextOpenDir = dir->nextOpenDir; + else + dir->vd->firstOpenDir = dir->nextOpenDir; + + // Unlock + ntfsUnlock(dir->vd); + + return 0; +} diff --git a/portlibs/sources/libntfs/ntfsdir.h b/portlibs/sources/libntfs/ntfsdir.h new file mode 100644 index 00000000..0550592f --- /dev/null +++ b/portlibs/sources/libntfs/ntfsdir.h @@ -0,0 +1,68 @@ +/** + * ntfs_dir.c - devoptab directory routines for NTFS-based devices. + * + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef _NTFSDIR_H +#define _NTFSDIR_H + +#include "ntfsinternal.h" +#include <sys/reent.h> + +/** + * ntfs_dir_entry - Directory entry + */ +typedef struct _ntfs_dir_entry { + char *name; + u64 mref; + struct _ntfs_dir_entry *next; +} ntfs_dir_entry; + +/** + * ntfs_dir_state - Directory state + */ +typedef struct _ntfs_dir_state { + ntfs_vd *vd; /* Volume this directory belongs to */ + ntfs_inode *ni; /* Directory descriptor */ + ntfs_dir_entry *first; /* The first entry in the directory */ + ntfs_dir_entry *current; /* The current entry in the directory */ + struct _ntfs_dir_state *prevOpenDir; /* The previous entry in a double-linked FILO list of open directories */ + struct _ntfs_dir_state *nextOpenDir; /* The next entry in a double-linked FILO list of open directories */ +} ntfs_dir_state; + +/* Directory state routines */ +void ntfsCloseDir (ntfs_dir_state *file); + +/* Gekko devoptab directory routines for NTFS-based devices */ +extern int ntfs_stat_r (struct _reent *r, const char *path, struct stat *st); +extern int ntfs_link_r (struct _reent *r, const char *existing, const char *newLink); +extern int ntfs_unlink_r (struct _reent *r, const char *name); +extern int ntfs_chdir_r (struct _reent *r, const char *name); +extern int ntfs_rename_r (struct _reent *r, const char *oldName, const char *newName); +extern int ntfs_mkdir_r (struct _reent *r, const char *path, int mode); +extern int ntfs_statvfs_r (struct _reent *r, const char *path, struct statvfs *buf); + +/* Gekko devoptab directory walking routines for NTFS-based devices */ +extern DIR_ITER *ntfs_diropen_r (struct _reent *r, DIR_ITER *dirState, const char *path); +extern int ntfs_dirreset_r (struct _reent *r, DIR_ITER *dirState); +extern int ntfs_dirnext_r (struct _reent *r, DIR_ITER *dirState, char *filename, struct stat *filestat); +extern int ntfs_dirclose_r (struct _reent *r, DIR_ITER *dirState); + +#endif /* _NTFSDIR_H */ + diff --git a/portlibs/sources/libntfs/ntfsfile.c b/portlibs/sources/libntfs/ntfsfile.c new file mode 100644 index 00000000..f361812a --- /dev/null +++ b/portlibs/sources/libntfs/ntfsfile.c @@ -0,0 +1,526 @@ +/** + * ntfsfile.c - devoptab file routines for NTFS-based devices. + * + * Copyright (c) 2010 Dimok + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; 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_SYS_STAT_H +#include <sys/stat.h> +#endif +#ifdef HAVE_FCNTL_H +#include <fcntl.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif + +#include "ntfsinternal.h" +#include "ntfsfile.h" + +#define STATE(x) ((ntfs_file_state*)x) + +void ntfsCloseFile (ntfs_file_state *file) +{ + // Sanity check + if (!file || !file->vd) + return; + + // Special case fix ups for compressed and/or encrypted files + if (file->compressed) + ntfs_attr_pclose(file->data_na); +#ifdef HAVE_SETXATTR + if (file->encrypted) + ntfs_efs_fixup_attribute(NULL, file->data_na); +#endif + // Close the file data attribute (if open) + if (file->data_na) + ntfs_attr_close(file->data_na); + + // Sync the file (and its attributes) to disc + if(file->write) + { + ntfsUpdateTimes(file->vd, file->ni, NTFS_UPDATE_ATIME | NTFS_UPDATE_CTIME); + ntfsSync(file->vd, file->ni); + } + + if (file->read) + ntfsUpdateTimes(file->vd, file->ni, NTFS_UPDATE_ATIME); + + // Close the file (if open) + if (file->ni) + ntfsCloseEntry(file->vd, file->ni); + + // Reset the file state + file->ni = NULL; + file->data_na = NULL; + file->flags = 0; + file->read = false; + file->write = false; + file->append = false; + file->pos = 0; + file->len = 0; + + return; +} + +int ntfs_open_r (struct _reent *r, void *fileStruct, const char *path, int flags, int mode) +{ + ntfs_log_trace("fileStruct %p, path %s, flags %i, mode %i\n", (void *) fileStruct, path, flags, mode); + + ntfs_file_state* file = STATE(fileStruct); + + // Get the volume descriptor for this path + file->vd = ntfsGetVolume(path); + if (!file->vd) { + r->_errno = ENODEV; + return -1; + } + + // Lock + ntfsLock(file->vd); + + // Determine which mode the file is opened for + file->flags = flags; + if ((flags & 0x03) == O_RDONLY) { + file->read = true; + file->write = false; + file->append = false; + } else if ((flags & 0x03) == O_WRONLY) { + file->read = false; + file->write = true; + file->append = (flags & O_APPEND); + } else if ((flags & 0x03) == O_RDWR) { + file->read = true; + file->write = true; + file->append = (flags & O_APPEND); + } else { + r->_errno = EACCES; + ntfsUnlock(file->vd); + return -1; + } + + // Try and find the file and (if found) ensure that it is not a directory + file->ni = ntfsOpenEntry(file->vd, path); + if (file->ni && (file->ni->mrec->flags & MFT_RECORD_IS_DIRECTORY)) { + ntfsCloseEntry(file->vd, file->ni); + ntfsUnlock(file->vd); + r->_errno = EISDIR; + return -1; + } + + // Are we creating this file? + if ((flags & O_CREAT) && !file->ni) { + + // Create the file + file->ni = ntfsCreate(file->vd, path, S_IFREG, NULL); + if (!file->ni) { + ntfsUnlock(file->vd); + return -1; + } + + } + + // Sanity check, the file should be open by now + if (!file->ni) { + ntfsUnlock(file->vd); + r->_errno = ENOENT; + return -1; + } + + // Open the files data attribute + file->data_na = ntfs_attr_open(file->ni, AT_DATA, AT_UNNAMED, 0); + if(!file->data_na) { + ntfsCloseEntry(file->vd, file->ni); + ntfsUnlock(file->vd); + return -1; + } + + // Determine if this files data is compressed and/or encrypted + file->compressed = NAttrCompressed(file->data_na) || (file->ni->flags & FILE_ATTR_COMPRESSED); + file->encrypted = NAttrEncrypted(file->data_na) || (file->ni->flags & FILE_ATTR_ENCRYPTED); + + // We cannot read/write encrypted files + if (file->encrypted) { + ntfs_attr_close(file->data_na); + ntfsCloseEntry(file->vd, file->ni); + ntfsUnlock(file->vd); + r->_errno = EACCES; + return -1; + } + + // Make sure we aren't trying to write to a read-only file + if ((file->ni->flags & FILE_ATTR_READONLY) && file->write) { + ntfs_attr_close(file->data_na); + ntfsCloseEntry(file->vd, file->ni); + ntfsUnlock(file->vd); + r->_errno = EROFS; + return -1; + } + + // Truncate the file if requested + if ((flags & O_TRUNC) && file->write) { + if (ntfs_attr_truncate(file->data_na, 0)) { + ntfs_attr_close(file->data_na); + ntfsCloseEntry(file->vd, file->ni); + ntfsUnlock(file->vd); + r->_errno = errno; + return -1; + } + } + + // Set the files current position and length + file->pos = 0; + file->len = file->data_na->data_size; + + ntfs_log_trace("file->len %llu\n", file->len); + + // Update file times + ntfsUpdateTimes(file->vd, file->ni, NTFS_UPDATE_ATIME); + + // Insert the file into the double-linked FILO list of open files + if (file->vd->firstOpenFile) { + file->nextOpenFile = file->vd->firstOpenFile; + file->vd->firstOpenFile->prevOpenFile = file; + } else { + file->nextOpenFile = NULL; + } + file->prevOpenFile = NULL; + file->vd->firstOpenFile = file; + file->vd->openFileCount++; + + // Unlock + ntfsUnlock(file->vd); + + return (int)fileStruct; +} + +int ntfs_close_r (struct _reent *r, int fd) +{ + ntfs_log_trace("fd %p\n", (void *) fd); + + ntfs_file_state* file = STATE(fd); + + // Sanity check + if (!file || !file->vd) { + r->_errno = EBADF; + return -1; + } + + // Lock + ntfsLock(file->vd); + + // Close the file + ntfsCloseFile(file); + + // Remove the file from the double-linked FILO list of open files + file->vd->openFileCount--; + if (file->nextOpenFile) + file->nextOpenFile->prevOpenFile = file->prevOpenFile; + if (file->prevOpenFile) + file->prevOpenFile->nextOpenFile = file->nextOpenFile; + else + file->vd->firstOpenFile = file->nextOpenFile; + + // Unlock + ntfsUnlock(file->vd); + + return 0; +} + +ssize_t ntfs_write_r (struct _reent *r, int fd, const char *ptr, size_t len) +{ + ntfs_log_trace("fd %p, ptr %p, len %u\n", (void *) fd, ptr, len); + + ntfs_file_state* file = STATE(fd); + ssize_t written = 0; + off_t old_pos = 0; + + // Sanity check + if (!file || !file->vd || !file->ni || !file->data_na) { + r->_errno = EINVAL; + return -1; + } + + // Short circuit cases where we don't actually have to do anything + if (!ptr || len <= 0) { + return 0; + } + + // Lock + ntfsLock(file->vd); + + // Check that we are allowed to write to this file + if (!file->write) { + ntfsUnlock(file->vd); + r->_errno = EACCES; + return -1; + } + + // If we are in append mode, backup the current position and move to the end of the file + if (file->append) { + old_pos = file->pos; + file->pos = file->len; + } + + // Write to the files data atrribute + while (len) { + ssize_t ret = ntfs_attr_pwrite(file->data_na, file->pos, len, ptr); + if (ret <= 0) { + ntfsUnlock(file->vd); + r->_errno = errno; + return -1; + } + len -= ret; + file->pos += ret; + written += ret; + } + + // If we are in append mode, restore the current position to were it was prior to this write + if (file->append) { + file->pos = old_pos; + } + + // Mark the file for archiving (if we actually wrote something) + if (written) + file->ni->flags |= FILE_ATTR_ARCHIVE; + + // Update the files data length + file->len = file->data_na->data_size; + + // Unlock + ntfsUnlock(file->vd); + + return written; +} + +ssize_t ntfs_read_r (struct _reent *r, int fd, char *ptr, size_t len) +{ + ntfs_log_trace("fd %p, ptr %p, len %u\n", (void *) fd, ptr, len); + + ntfs_file_state* file = STATE(fd); + ssize_t read = 0; + + // Sanity check + if (!file || !file->vd || !file->ni || !file->data_na) { + r->_errno = EINVAL; + return -1; + } + + // Short circuit cases where we don't actually have to do anything + if (!ptr || len <= 0) { + return 0; + } + + // Lock + ntfsLock(file->vd); + + // Check that we are allowed to read from this file + if (!file->read) { + ntfsUnlock(file->vd); + r->_errno = EACCES; + return -1; + } + + // Don't read past the end of file + if (file->pos + len > file->len) { + r->_errno = EOVERFLOW; + len = file->len - file->pos; + ntfs_log_trace("EOVERFLOW"); + } + + ntfs_log_trace("file->pos:%d, len:%d, file->len:%d \n", (u32)file->pos, (u32)len, (u32)file->len); + + // Read from the files data attribute + while (len) { + ssize_t ret = ntfs_attr_pread(file->data_na, file->pos, len, ptr); + if (ret <= 0 || ret > len) { + ntfsUnlock(file->vd); + r->_errno = errno; + return -1; + } + ptr += ret; + len -= ret; + file->pos += ret; + read += ret; + } + //ntfs_log_trace("file->pos: %d \n", (u32)file->pos); + // Update file times (if we actually read something) + + // Unlock + ntfsUnlock(file->vd); + + return read; +} + +off_t ntfs_seek_r (struct _reent *r, int fd, off_t pos, int dir) +{ + ntfs_log_trace("fd %p, pos %llu, dir %i\n", (void *) fd, pos, dir); + + ntfs_file_state* file = STATE(fd); + off_t position = 0; + + // Sanity check + if (!file || !file->vd || !file->ni || !file->data_na) { + r->_errno = EINVAL; + return -1; + } + + // Lock + ntfsLock(file->vd); + + // Set the files current position + switch(dir) { + case SEEK_SET: position = file->pos = MIN(MAX(pos, 0), file->len); break; + case SEEK_CUR: position = file->pos = MIN(MAX(file->pos + pos, 0), file->len); break; + case SEEK_END: position = file->pos = MIN(MAX(file->len + pos, 0), file->len); break; + } + + // Unlock + ntfsUnlock(file->vd); + + return position; +} +int ntfs_fstat_r (struct _reent *r, int fd, struct stat *st) +{ + ntfs_log_trace("fd %p\n", (void *) fd); + + ntfs_file_state* file = STATE(fd); + int ret = 0; + + // Sanity check + if (!file || !file->vd || !file->ni || !file->data_na) { + r->_errno = EINVAL; + return -1; + } + + // Short circuit cases were we don't actually have to do anything + if (!st) + return 0; + + // Get the file stats + ret = ntfsStat(file->vd, file->ni, st); + if (ret) + r->_errno = errno; + + return ret; +} + +int ntfs_ftruncate_r (struct _reent *r, int fd, off_t len) +{ + ntfs_log_trace("fd %p, len %llu\n", (void *) fd, (u64) len); + + ntfs_file_state* file = STATE(fd); + + // Sanity check + if (!file || !file->vd || !file->ni || !file->data_na) { + r->_errno = EINVAL; + return -1; + } + + // Lock + ntfsLock(file->vd); + + // Check that we are allowed to write to this file + if (!file->write) { + ntfsUnlock(file->vd); + r->_errno = EACCES; + return -1; + } + + // For compressed files, only deleting and expanding contents are implemented + if (file->compressed && + len > 0 && + len < file->data_na->initialized_size) { + ntfsUnlock(file->vd); + r->_errno = EOPNOTSUPP; + return -1; + } + + // Resize the files data attribute, either by expanding or truncating + if (file->compressed && len > file->data_na->initialized_size) { + char zero = 0; + if (ntfs_attr_pwrite(file->data_na, len - 1, 1, &zero) <= 0) { + ntfsUnlock(file->vd); + r->_errno = errno; + return -1; + } + } else { + if (ntfs_attr_truncate(file->data_na, len)) { + ntfsUnlock(file->vd); + r->_errno = errno; + return -1; + } + } + + // Mark the file for archiving (if we actually changed something) + if (file->len != file->data_na->data_size) + file->ni->flags |= FILE_ATTR_ARCHIVE; + + // Update file times (if we actually changed something) + if (file->len != file->data_na->data_size) + ntfsUpdateTimes(file->vd, file->ni, NTFS_UPDATE_AMCTIME); + + // Update the files data length + file->len = file->data_na->data_size; + + // Sync the file (and its attributes) to disc + ntfsSync(file->vd, file->ni); + + // Unlock + ntfsUnlock(file->vd); + + return 0; +} + +int ntfs_fsync_r (struct _reent *r, int fd) +{ + ntfs_log_trace("fd %p\n", (void *) fd); + + ntfs_file_state* file = STATE(fd); + int ret = 0; + + // Sanity check + if (!file || !file->vd || !file->ni || !file->data_na) { + r->_errno = EINVAL; + return -1; + } + + // Lock + ntfsLock(file->vd); + + // Sync the file (and its attributes) to disc + ret = ntfsSync(file->vd, file->ni); + if (ret) + r->_errno = errno; + + // Unlock + ntfsUnlock(file->vd); + + return ret; +} diff --git a/portlibs/sources/libntfs/ntfsfile.h b/portlibs/sources/libntfs/ntfsfile.h new file mode 100644 index 00000000..8e5ffcc6 --- /dev/null +++ b/portlibs/sources/libntfs/ntfsfile.h @@ -0,0 +1,65 @@ +/** + * ntfsfile.c - devoptab file routines for NTFS-based devices. + * + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef _NTFSFILE_H +#define _NTFSFILE_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "ntfsinternal.h" +#include <sys/reent.h> + +/** + * ntfs_file_state - File state + */ +typedef struct _ntfs_file_state { + ntfs_vd *vd; /* Volume this file belongs to */ + ntfs_inode *ni; /* File descriptor */ + ntfs_attr *data_na; /* File data descriptor */ + int flags; /* Opening flags */ + bool read; /* True if allowed to read from file */ + bool write; /* True if allowed to write to file */ + bool append; /* True if allowed to append to file */ + bool compressed; /* True if file data is compressed */ + bool encrypted; /* True if file data is encryted */ + off_t pos; /* Current position within the file (in bytes) */ + u64 len; /* Total length of the file (in bytes) */ + struct _ntfs_file_state *prevOpenFile; /* The previous entry in a double-linked FILO list of open files */ + struct _ntfs_file_state *nextOpenFile; /* The next entry in a double-linked FILO list of open files */ +} ntfs_file_state; + +/* File state routines */ +void ntfsCloseFile (ntfs_file_state *file); + +/* Gekko devoptab file routines for NTFS-based devices */ +extern int ntfs_open_r (struct _reent *r, void *fileStruct, const char *path, int flags, int mode); +extern int ntfs_close_r (struct _reent *r, int fd); +extern ssize_t ntfs_write_r (struct _reent *r, int fd, const char *ptr, size_t len); +extern ssize_t ntfs_read_r (struct _reent *r, int fd, char *ptr, size_t len); +extern off_t ntfs_seek_r (struct _reent *r, int fd, off_t pos, int dir); +extern int ntfs_fstat_r (struct _reent *r, int fd, struct stat *st); +extern int ntfs_ftruncate_r (struct _reent *r, int fd, off_t len); +extern int ntfs_fsync_r (struct _reent *r, int fd); + +#endif /* _NTFSFILE_H */ + diff --git a/portlibs/sources/libntfs/ntfsfile_frag.c b/portlibs/sources/libntfs/ntfsfile_frag.c new file mode 100644 index 00000000..8771b931 --- /dev/null +++ b/portlibs/sources/libntfs/ntfsfile_frag.c @@ -0,0 +1,121 @@ +/** + * ntfsfile.c - devoptab file routines for NTFS-based devices. + * Copyright (c) 2010 Miigotu + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; 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_SYS_STAT_H +#include <sys/stat.h> +#endif +#ifdef HAVE_FCNTL_H +#include <fcntl.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif + +#include "ntfsinternal.h" +#include "ntfsfile.h" +#include "ntfs.h" +#include "ntfsfile_frag.h" + +s64 ntfs_attr_getfragments(ntfs_attr *na, const s64 pos, s64 count, u64 offset, + _ntfs_frag_append_t append_fragment, void *callback_data); + +static inline u8 size_to_shift(u32 size) +{ + u8 ret = 0; + while (size) + { + ret++; + size >>= 1; + } + return ret - 1; +} + +int _NTFS_get_fragments (const char *path, + _ntfs_frag_append_t append_fragment, void *callback_data) +{ + struct _reent r; + ntfs_file_state file_st, *file = &file_st; + ssize_t read = 0; + int ret_val = -11; + + // Open File + r._errno = 0; + int fd = ntfs_open_r(&r, file, path, O_RDONLY, 0); + if (fd != (int)file) return -12; + + + // Sanity check + if (!file || !file->vd || !file->ni || !file->data_na) { + //r->_errno = EINVAL; + return -13; + } + + // Lock + ntfsLock(file->vd); + + + u64 offset = 0; + u64 len = file->len; + + // Read from the files data attribute + while (len) { + s64 ret = ntfs_attr_getfragments(file->data_na, file->pos, + len, offset, append_fragment, callback_data); + if (ret <= 0 || ret > len) { + ntfsUnlock(file->vd); + //r->_errno = errno; + ret_val = -14; + if (ret < 0) ret_val = ret; + goto out; + } + offset += ret; + len -= ret; + file->pos += ret; + read += ret; + } + + u32 shift = size_to_shift(file->ni->vol->sector_size); + + // set file size + append_fragment(callback_data, file->len >> shift, 0, 0); + // success + ret_val = 0; + + +out: + // Unlock + ntfsUnlock(file->vd); + // Close the file + ntfs_close_r (&r, fd); + + return ret_val; +} + diff --git a/portlibs/sources/libntfs/ntfsfile_frag.h b/portlibs/sources/libntfs/ntfsfile_frag.h new file mode 100644 index 00000000..889abb1a --- /dev/null +++ b/portlibs/sources/libntfs/ntfsfile_frag.h @@ -0,0 +1,15 @@ +#ifndef NTFS_FRAG_H_ +#define NTFS_FRAG_H_ + +#ifdef __cplusplus +extern "C" { +#endif + +typedef int (*_ntfs_frag_append_t)(void *ff, u32 offset, u32 sector, u32 count); +int _NTFS_get_fragments (const char *path, _ntfs_frag_append_t append_fragment, void *callback_data); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/portlibs/sources/libntfs/ntfsinternal.c b/portlibs/sources/libntfs/ntfsinternal.c new file mode 100644 index 00000000..c2de0941 --- /dev/null +++ b/portlibs/sources/libntfs/ntfsinternal.c @@ -0,0 +1,868 @@ +/** + * ntfsinternal.h - Internal support routines for NTFS-based devices. + * + * Copyright (c) 2010 Dimok + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; 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 + +#include "ntfsinternal.h" +#include "ntfsdir.h" +#include "ntfsfile.h" + +#if defined(__wii__) +#include <sdcard/wiisd_io.h> +#include <sdcard/gcsd.h> +#include <ogc/usbstorage.h> + +const INTERFACE_ID ntfs_disc_interfaces[] = { + { "sd", &__io_wiisd }, + { "usb", &__io_usbstorage }, + { "carda", &__io_gcsda }, + { "cardb", &__io_gcsdb }, + { NULL, NULL } +}; + +#elif defined(__gamecube__) +#include <sdcard/gcsd.h> + +const INTERFACE_ID ntfs_disc_interfaces[] = { + { "carda", &__io_gcsda }, + { "cardb", &__io_gcsdb }, + { NULL, NULL } +}; + +#endif + +int ntfsAddDevice (const char *name, void *deviceData) +{ + const devoptab_t *devoptab_ntfs = ntfsGetDevOpTab(); + devoptab_t *dev = NULL; + char *devname = NULL; + int i; + + // Sanity check + if (!name || !deviceData || !devoptab_ntfs) { + errno = EINVAL; + return -1; + } + + // Allocate a devoptab for this device + dev = (devoptab_t *) ntfs_alloc(sizeof(devoptab_t) + strlen(name) + 1); + if (!dev) { + errno = ENOMEM; + return false; + } + + // Use the space allocated at the end of the devoptab for storing the device name + devname = (char*)(dev + 1); + strcpy(devname, name); + + // Setup the devoptab + memcpy(dev, devoptab_ntfs, sizeof(devoptab_t)); + dev->name = devname; + dev->deviceData = deviceData; + + // Add the device to the devoptab table (if there is a free slot) + for (i = 0; i < STD_MAX; i++) { + if (devoptab_list[i] == devoptab_list[0] && i != 0) { + devoptab_list[i] = dev; + return 0; + } + } + + // If we reach here then there are no free slots in the devoptab table for this device + errno = EADDRNOTAVAIL; + return -1; +} + +void ntfsRemoveDevice (const char *path) +{ + const devoptab_t *devoptab = NULL; + char name[128] = {0}; + int i; + + // Get the device name from the path + strncpy(name, path, 127); + strtok(name, ":/"); + + // Find and remove the specified device from the devoptab table + // NOTE: We do this manually due to a 'bug' in RemoveDevice + // which ignores names with suffixes and causes names + // like "ntfs" and "ntfs1" to be seen as equals + for (i = 0; i < STD_MAX; i++) { + devoptab = devoptab_list[i]; + if (devoptab && devoptab->name) { + if (strcmp(name, devoptab->name) == 0) { + devoptab_list[i] = devoptab_list[0]; + ntfs_free((devoptab_t*)devoptab); + break; + } + } + } + + return; +} + +const devoptab_t *ntfsGetDevice (const char *path, bool useDefaultDevice) +{ + const devoptab_t *devoptab = NULL; + char name[128] = {0}; + int i; + + // Get the device name from the path + strncpy(name, path, 127); + strtok(name, ":/"); + + // Search the devoptab table for the specified device name + // NOTE: We do this manually due to a 'bug' in GetDeviceOpTab + // which ignores names with suffixes and causes names + // like "ntfs" and "ntfs1" to be seen as equals + for (i = 0; i < STD_MAX; i++) { + devoptab = devoptab_list[i]; + if (devoptab && devoptab->name) { + if (strcmp(name, devoptab->name) == 0) { + return devoptab; + } + } + } + + // If we reach here then we couldn't find the device name, + // chances are that this path has no device name in it. + // Call GetDeviceOpTab to get our default device (chdir). + if (useDefaultDevice) + return GetDeviceOpTab(""); + + return NULL; +} + +const INTERFACE_ID *ntfsGetDiscInterfaces (void) +{ + // Get all know disc interfaces on the host system + return ntfs_disc_interfaces; +} + +ntfs_vd *ntfsGetVolume (const char *path) +{ + // Get the volume descriptor from the paths associated devoptab (if found) + const devoptab_t *devoptab_ntfs = ntfsGetDevOpTab(); + const devoptab_t *devoptab = ntfsGetDevice(path, true); + if (devoptab && devoptab_ntfs && (devoptab->open_r == devoptab_ntfs->open_r)) + return (ntfs_vd*)devoptab->deviceData; + + return NULL; +} + +int ntfsInitVolume (ntfs_vd *vd) +{ + // Sanity check + if (!vd) { + errno = ENODEV; + return -1; + } + + // Initialise the volume lock + LWP_MutexInit(&vd->lock, false); + + // Reset the volumes name cache + vd->name[0] = '\0'; + + // Reset the volumes current directory + vd->cwd_ni = NULL; + + // Reset open directory and file stats + vd->openDirCount = 0; + vd->openFileCount = 0; + vd->firstOpenDir = NULL; + vd->firstOpenFile = NULL; + + return 0; +} + +void ntfsDeinitVolume (ntfs_vd *vd) +{ + // Sanity check + if (!vd) { + errno = ENODEV; + return; + } + + // Lock + ntfsLock(vd); + + // Close any directories which are still open (lazy programmers!) + ntfs_dir_state *nextDir = vd->firstOpenDir; + while (nextDir) { + ntfs_log_warning("Cleaning up orphaned directory @ %p\n", nextDir); + ntfsCloseDir(nextDir); + nextDir = nextDir->nextOpenDir; + } + + // Close any files which are still open (lazy programmers!) + ntfs_file_state *nextFile = vd->firstOpenFile; + while (nextFile) { + ntfs_log_warning("Cleaning up orphaned file @ %p\n", nextFile); + ntfsCloseFile(nextFile); + nextFile = nextFile->nextOpenFile; + } + + // Reset open directory and file stats + vd->openDirCount = 0; + vd->openFileCount = 0; + vd->firstOpenDir = NULL; + vd->firstOpenFile = NULL; + + // Close the volumes current directory (if any) + //if (vd->cwd_ni) { + //ntfsCloseEntry(vd, vd->cwd_ni); + //vd->cwd_ni = NULL; + //} + + // Force the underlying device to sync + ntfs_device_sync(vd->dev); + + // Unlock + ntfsUnlock(vd); + + // Deinitialise the volume lock + LWP_MutexDestroy(vd->lock); + + return; +} + +ntfs_inode *ntfsOpenEntry (ntfs_vd *vd, const char *path) +{ + return ntfsParseEntry(vd, path, 1); +} + +ntfs_inode *ntfsParseEntry (ntfs_vd *vd, const char *path, int reparseLevel) +{ + ntfs_inode *ni = NULL; + char *target = NULL; + int attr_size; + + // Sanity check + if (!vd) { + errno = ENODEV; + return NULL; + } + + // Get the actual path of the entry + path = ntfsRealPath(path); + if (!path) { + errno = EINVAL; + return NULL; + } else if (path[0] == '\0') { + path = "."; + } + + // Find the entry, taking into account our current directory (if any) + if (path[0] != PATH_SEP) + ni = ntfs_pathname_to_inode(vd->vol, vd->cwd_ni, path++); + else + ni = ntfs_pathname_to_inode(vd->vol, NULL, path); + + // If the entry was found and it has reparse data then parse its true path; + // this resolves the true location of symbolic links and directory junctions + if (ni && (ni->flags & FILE_ATTR_REPARSE_POINT)) { + if (ntfs_possible_symlink(ni)) { + + // Sanity check, give up if we are parsing to deep + if (reparseLevel > NTFS_MAX_SYMLINK_DEPTH) { + ntfsCloseEntry(vd, ni); + errno = ELOOP; + return NULL; + } + + // Get the target path of this entry + target = ntfs_make_symlink(ni, path, &attr_size); + if (!target) { + ntfsCloseEntry(vd, ni); + return NULL; + } + + // Close the entry (we are no longer interested in it) + ntfsCloseEntry(vd, ni); + + // Parse the entries target + ni = ntfsParseEntry(vd, target, reparseLevel++); + + // Clean up + // use free because the value was not allocated with ntfs_alloc + free(target); + + } + } + + return ni; +} + +void ntfsCloseEntry (ntfs_vd *vd, ntfs_inode *ni) +{ + // Sanity check + if (!vd) { + errno = ENODEV; + return; + } + + // Lock + ntfsLock(vd); + + // Sync the entry (if it is dirty) + if (NInoDirty(ni)) + ntfsSync(vd, ni); + + // Close the entry + ntfs_inode_close(ni); + + // Unlock + ntfsUnlock(vd); + + return; +} + + +ntfs_inode *ntfsCreate (ntfs_vd *vd, const char *path, mode_t type, const char *target) +{ + ntfs_inode *dir_ni = NULL, *ni = NULL; + char *dir = NULL; + char *name = NULL; + ntfschar *uname = NULL, *utarget = NULL; + int uname_len, utarget_len; + + // Sanity check + if (!vd) { + errno = ENODEV; + return NULL; + } + + // You cannot link between devices + if(target) { + if(vd != ntfsGetVolume(target)) { + errno = EXDEV; + return NULL; + } + } + + // Get the actual paths of the entry + path = ntfsRealPath(path); + target = ntfsRealPath(target); + if (!path) { + errno = EINVAL; + return NULL; + } + + // Lock + ntfsLock(vd); + + // Get the unicode name for the entry and find its parent directory + // TODO: This looks horrible, clean it up + dir = strdup(path); + if (!dir) { + errno = EINVAL; + goto cleanup; + } + name = strrchr(dir, '/'); + if (name) + name++; + else + name = dir; + uname_len = ntfsLocalToUnicode(name, &uname); + if (uname_len < 0) { + errno = EINVAL; + goto cleanup; + } + name = strrchr(dir, '/'); + if(name) + { + name++; + name[0] = 0; + } + + // Open the entries parent directory + dir_ni = ntfsOpenEntry(vd, dir); + if (!dir_ni) { + goto cleanup; + } + + // Create the entry + switch (type) { + + // Symbolic link + case S_IFLNK: + if (!target) { + errno = EINVAL; + goto cleanup; + } + utarget_len = ntfsLocalToUnicode(target, &utarget); + if (utarget_len < 0) { + errno = EINVAL; + goto cleanup; + } + ni = ntfs_create_symlink(dir_ni, 0, uname, uname_len, utarget, utarget_len); + break; + + // Directory or file + case S_IFDIR: + case S_IFREG: + ni = ntfs_create(dir_ni, 0, uname, uname_len, type); + break; + + } + + // If the entry was created + if (ni) { + + // Mark the entry for archiving + ni->flags |= FILE_ATTR_ARCHIVE; + + // Mark the entry as dirty + NInoSetDirty(ni); + + // Sync the entry to disc + ntfsSync(vd, ni); + + // Update parent directories times + ntfsUpdateTimes(vd, dir_ni, NTFS_UPDATE_MCTIME); + + } + +cleanup: + + if(dir_ni) + ntfsCloseEntry(vd, dir_ni); + + // use free because the value was not allocated with ntfs_alloc + if(utarget) + free(utarget); + + if(uname) + free(uname); + + if(dir) + ntfs_free(dir); + + // Unlock + ntfsUnlock(vd); + + return ni; +} + +int ntfsLink (ntfs_vd *vd, const char *old_path, const char *new_path) +{ + ntfs_inode *dir_ni = NULL, *ni = NULL; + char *dir = NULL; + char *name = NULL; + ntfschar *uname = NULL; + int uname_len; + int res = 0; + + // Sanity check + if (!vd) { + errno = ENODEV; + return -1; + } + + // You cannot link between devices + if(vd != ntfsGetVolume(new_path)) { + errno = EXDEV; + return -1; + } + + // Get the actual paths of the entry + old_path = ntfsRealPath(old_path); + new_path = ntfsRealPath(new_path); + if (!old_path || !new_path) { + errno = EINVAL; + return -1; + } + + // Lock + ntfsLock(vd); + + // Get the unicode name for the entry and find its parent directory + // TODO: This looks horrible, clean it up + dir = strdup(new_path); + if (!dir) { + errno = EINVAL; + goto cleanup; + } + name = strrchr(dir, '/'); + if (name) + name++; + else + name = dir; + uname_len = ntfsLocalToUnicode(name, &uname); + if (uname_len < 0) { + errno = EINVAL; + goto cleanup; + } + *name = 0; + + // Find the entry + ni = ntfsOpenEntry(vd, old_path); + if (!ni) { + errno = ENOENT; + res = -1; + goto cleanup; + } + + // Open the entries new parent directory + dir_ni = ntfsOpenEntry(vd, dir); + if (!dir_ni) { + errno = ENOENT; + res = -1; + goto cleanup; + } + + // Link the entry to its new parent + if (ntfs_link(ni, dir_ni, uname, uname_len)) { + res = -1; + goto cleanup; + } + + // Update entry times + ntfsUpdateTimes(vd, dir_ni, NTFS_UPDATE_MCTIME); + + // Sync the entry to disc + ntfsSync(vd, ni); + +cleanup: + + if(dir_ni) + ntfsCloseEntry(vd, dir_ni); + + if(ni) + ntfsCloseEntry(vd, ni); + + // use free because the value was not allocated with ntfs_alloc + if(uname) + free(uname); + + if(dir) + ntfs_free(dir); + + // Unlock + ntfsUnlock(vd); + + return res; +} + +int ntfsUnlink (ntfs_vd *vd, const char *path) +{ + ntfs_inode *dir_ni = NULL, *ni = NULL; + char *dir = NULL; + char *name = NULL; + ntfschar *uname = NULL; + int uname_len; + int res = 0; + + // Sanity check + if (!vd) { + errno = ENODEV; + return -1; + } + + // Get the actual path of the entry + path = ntfsRealPath(path); + if (!path) { + errno = EINVAL; + return -1; + } + + // Lock + ntfsLock(vd); + + // Get the unicode name for the entry and find its parent directory + // TODO: This looks horrible + dir = strdup(path); + if (!dir) { + errno = EINVAL; + goto cleanup; + } + name = strrchr(dir, '/'); + if (name) + name++; + else + name = dir; + uname_len = ntfsLocalToUnicode(name, &uname); + if (uname_len < 0) { + errno = EINVAL; + goto cleanup; + } + name = strrchr(dir, '/'); + if(name) + { + name++; + name[0] = 0; + } + + // Find the entry + ni = ntfsOpenEntry(vd, path); + if (!ni) { + errno = ENOENT; + res = -1; + goto cleanup; + } + + // Open the entries parent directory + dir_ni = ntfsOpenEntry(vd, dir); + if (!dir_ni) { + errno = ENOENT; + res = -1; + goto cleanup; + } + + // Unlink the entry from its parent + if (ntfs_delete(vd->vol, path, ni, dir_ni, uname, uname_len)) { + res = -1; + } + + // Force the underlying device to sync + ntfs_device_sync(vd->dev); + + // ntfs_delete() ALWAYS closes ni and dir_ni; so no need for us to anymore + dir_ni = ni = NULL; + +cleanup: + + if(dir_ni) + ntfsCloseEntry(vd, dir_ni); + + if(ni) + ntfsCloseEntry(vd, ni); + + // use free because the value was not allocated with ntfs_alloc + if(uname) + free(uname); + + if(dir) + ntfs_free(dir); + + // Unlock + ntfsUnlock(vd); + + return 0; +} + +int ntfsSync (ntfs_vd *vd, ntfs_inode *ni) +{ + int res = 0; + + // Sanity check + if (!vd) { + errno = ENODEV; + return -1; + } + + // Sanity check + if (!ni) { + errno = ENOENT; + return -1; + } + + // Lock + ntfsLock(vd); + + // Sync the entry + res = ntfs_inode_sync(ni); + + // Force the underlying device to sync + ntfs_device_sync(vd->dev); + + // Unlock + ntfsUnlock(vd); + + return res; + +} + +int ntfsStat (ntfs_vd *vd, ntfs_inode *ni, struct stat *st) +{ + ntfs_attr *na = NULL; + int res = 0; + + // Sanity check + if (!vd) { + errno = ENODEV; + return -1; + } + + // Sanity check + if (!ni) { + errno = ENOENT; + return -1; + } + + // Short circuit cases were we don't actually have to do anything + if (!st) + return 0; + + // Lock + ntfsLock(vd); + + // Zero out the stat buffer + memset(st, 0, sizeof(struct stat)); + + // Is this entry a directory + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) { + st->st_mode = S_IFDIR | (0777 & ~vd->dmask); + st->st_nlink = 1; + + // Open the directories index allocation table attribute + na = ntfs_attr_open(ni, AT_INDEX_ALLOCATION, NTFS_INDEX_I30, 4); + if (na) { + st->st_size = na->data_size; + st->st_blocks = na->allocated_size >> 9; + ntfs_attr_close(na); + } + + // Else it must be a file + } else { + st->st_mode = S_IFREG | (0777 & ~vd->fmask); + st->st_size = ni->data_size; + st->st_blocks = (ni->allocated_size + 511) >> 9; + st->st_nlink = le16_to_cpu(ni->mrec->link_count); + } + + // Fill in the generic entry stats + st->st_dev = vd->id; + st->st_uid = vd->uid; + st->st_gid = vd->gid; + st->st_ino = ni->mft_no; + st->st_atime = ni->last_access_time; + st->st_ctime = ni->last_mft_change_time; + st->st_mtime = ni->last_data_change_time; + + // Update entry times + ntfsUpdateTimes(vd, ni, NTFS_UPDATE_ATIME); + + // Unlock + ntfsUnlock(vd); + + return res; +} + +void ntfsUpdateTimes (ntfs_vd *vd, ntfs_inode *ni, ntfs_time_update_flags mask) +{ + // Run the access time update strategy against the device driver settings first + if (vd && vd->atime == ATIME_DISABLED) + mask &= ~NTFS_UPDATE_ATIME; + + // Update entry times + if (ni && mask) + ntfs_inode_update_times(ni, mask); + + return; +} + +const char *ntfsRealPath (const char *path) +{ + // Sanity check + if (!path) + return NULL; + + // Move the path pointer to the start of the actual path + if (strchr(path, ':') != NULL) { + path = strchr(path, ':') + 1; + } + if (strchr(path, ':') != NULL) { + return NULL; + } + + return path; +} + +int ntfsUnicodeToLocal (const ntfschar *ins, const int ins_len, char **outs, int outs_len) +{ + int len = 0; + int i; + + // Sanity check + if (!ins || !ins_len || !outs) + return 0; + + char * ucstombs_out = NULL; + + // Convert the unicode string to our current local + len = ntfs_ucstombs(ins, ins_len, &ucstombs_out, outs_len); + + if(ucstombs_out) + { + //use proper allocation + *outs = (char *) ntfs_alloc(strlen(ucstombs_out) + 1); + if(!*outs) + { + errno = ENOMEM; + return -1; + } + strcpy(*outs, ucstombs_out); + free(ucstombs_out); + ucstombs_out = NULL; + } + + if (len == -1 && errno == EILSEQ) + { + // The string could not be converted to the current local, + // do it manually by replacing non-ASCII characters with underscores + if (!*outs || outs_len >= ins_len) + { + if (!*outs) + { + *outs = (char *) ntfs_alloc(ins_len + 1); + if (!*outs) { + errno = ENOMEM; + return -1; + } + } + for (i = 0; i < ins_len; i++) { + ntfschar uc = le16_to_cpu(ins[i]); + if (uc > 0xff) + uc = (ntfschar)'_'; + *outs[i] = (char)uc; + } + *outs[ins_len] = (ntfschar)'\0'; + len = ins_len; + } + } + + return len; +} + +int ntfsLocalToUnicode (const char *ins, ntfschar **outs) +{ + // Sanity check + if (!ins || !outs) + return 0; + + // Convert the local string to unicode + return ntfs_mbstoucs(ins, outs); +} diff --git a/portlibs/sources/libntfs/ntfsinternal.h b/portlibs/sources/libntfs/ntfsinternal.h new file mode 100644 index 00000000..11dfb8fd --- /dev/null +++ b/portlibs/sources/libntfs/ntfsinternal.h @@ -0,0 +1,178 @@ +/** + * ntfsinternal.h - Internal support routines for NTFS-based devices. + * + * Copyright (c) 2009 Rhys "Shareese" Koedijk + * Copyright (c) 2006 Michael "Chishm" Chisholm + * + * 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; if not, write to the Free Software Foundation, + * Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef _NTFSINTERNAL_H +#define _NTFSINTERNAL_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#include "types.h" +#include "compat.h" +#include "logging.h" +#include "layout.h" +#include "device.h" +#include "volume.h" +#include "dir.h" +#include "inode.h" +#include "attrib.h" +#include "reparse.h" +#include "security.h" +#include "efs.h" +#include "unistr.h" + +#include <gccore.h> +#include <ogc/disc_io.h> +#include <sys/iosupport.h> + +#define NTFS_MOUNT_PREFIX "ntfs" /* Device name prefix to use when auto-mounting */ +#define NTFS_MAX_PARTITIONS 32 /* Maximum number of partitions that can be found */ +#define NTFS_MAX_MOUNTS 10 /* Maximum number of mounts available at one time */ +#define NTFS_MAX_SYMLINK_DEPTH 10 /* Maximum search depth when resolving symbolic links */ + +#define NTFS_OEM_ID cpu_to_le64(0x202020205346544eULL) /* "NTFS " */ + +#define MBR_SIGNATURE cpu_to_le16(0xAA55) +#define EBR_SIGNATURE cpu_to_le16(0xAA55) + +#define PARTITION_STATUS_NONBOOTABLE 0x00 /* Non-bootable */ +#define PARTITION_STATUS_BOOTABLE 0x80 /* Bootable (active) */ + +#define PARTITION_TYPE_EMPTY 0x00 /* Empty */ +#define PARTITION_TYPE_DOS33_EXTENDED 0x05 /* DOS 3.3+ extended partition */ +#define PARTITION_TYPE_NTFS 0x07 /* Windows NT NTFS */ +#define PARTITION_TYPE_WIN95_EXTENDED 0x0F /* Windows 95 extended partition */ + +/* Forward declarations */ +struct _ntfs_file_state; +struct _ntfs_dir_state; + +/** + * PRIMARY_PARTITION - Block device partition record + */ +typedef struct _PARTITION_RECORD { + u8 status; /* Partition status; see above */ + u8 chs_start[3]; /* Cylinder-head-sector address to first block of partition */ + u8 type; /* Partition type; see above */ + u8 chs_end[3]; /* Cylinder-head-sector address to last block of partition */ + u32 lba_start; /* Local block address to first sector of partition */ + u32 block_count; /* Number of blocks in partition */ +} __attribute__((__packed__)) PARTITION_RECORD; + +/** + * MASTER_BOOT_RECORD - Block device master boot record + */ +typedef struct _MASTER_BOOT_RECORD { + u8 code_area[446]; /* Code area; normally empty */ + PARTITION_RECORD partitions[4]; /* 4 primary partitions */ + u16 signature; /* MBR signature; 0xAA55 */ +} __attribute__((__packed__)) MASTER_BOOT_RECORD; + +/** + * EXTENDED_PARTITION - Block device extended boot record + */ +typedef struct _EXTENDED_BOOT_RECORD { + u8 code_area[446]; /* Code area; normally empty */ + PARTITION_RECORD partition; /* Primary partition */ + PARTITION_RECORD next_ebr; /* Next extended boot record in the chain */ + u8 reserved[32]; /* Normally empty */ + u16 signature; /* EBR signature; 0xAA55 */ +} __attribute__((__packed__)) EXTENDED_BOOT_RECORD; + +/** + * INTERFACE_ID - Disc interface identifier + */ +typedef struct _INTERFACE_ID { + const char *name; /* Interface name */ + const DISC_INTERFACE *interface; /* Disc interface */ +} INTERFACE_ID; + +/** + * ntfs_atime_t - File access time update strategies + */ +typedef enum { + ATIME_ENABLED, /* Update access times */ + ATIME_DISABLED /* Don't update access times */ +} ntfs_atime_t; + +/** + * ntfs_vd - NTFS volume descriptor + */ +typedef struct _ntfs_vd { + struct ntfs_device *dev; /* NTFS device handle */ + ntfs_volume *vol; /* NTFS volume handle */ + mutex_t lock; /* Volume lock mutex */ + s64 id; /* Filesystem id */ + u32 flags; /* Mount flags */ + char name[128]; /* Volume name (cached) */ + u16 uid; /* User id for entry creation */ + u16 gid; /* Group id for entry creation */ + u16 fmask; /* Unix style permission mask for file creation */ + u16 dmask; /* Unix style permission mask for directory creation */ + ntfs_atime_t atime; /* Entry access time update strategy */ + bool showHiddenFiles; /* If true, show hidden files when enumerating directories */ + bool showSystemFiles; /* If true, show system files when enumerating directories */ + ntfs_inode *cwd_ni; /* Current directory */ + struct _ntfs_dir_state *firstOpenDir; /* The start of a FILO linked list of currently opened directories */ + struct _ntfs_file_state *firstOpenFile; /* The start of a FILO linked list of currently opened files */ + u16 openDirCount; /* The total number of directories currently open in this volume */ + u16 openFileCount; /* The total number of files currently open in this volume */ +} ntfs_vd; + +/* Lock volume */ +static inline void ntfsLock (ntfs_vd *vd) +{ + LWP_MutexLock(vd->lock); +} + +/* Unlock volume */ +static inline void ntfsUnlock (ntfs_vd *vd) +{ + LWP_MutexUnlock(vd->lock); +} + +/* Gekko device related routines */ +int ntfsAddDevice (const char *name, void *deviceData); +void ntfsRemoveDevice (const char *path); +const devoptab_t *ntfsGetDevice (const char *path, bool useDefaultDevice); +const devoptab_t *ntfsGetDevOpTab (void); +const INTERFACE_ID* ntfsGetDiscInterfaces (void); + +/* Miscellaneous helper/support routines */ +int ntfsInitVolume (ntfs_vd *vd); +void ntfsDeinitVolume (ntfs_vd *vd); +ntfs_vd *ntfsGetVolume (const char *path); +ntfs_inode *ntfsOpenEntry (ntfs_vd *vd, const char *path); +ntfs_inode *ntfsParseEntry (ntfs_vd *vd, const char *path, int reparseLevel); +void ntfsCloseEntry (ntfs_vd *vd, ntfs_inode *ni); +ntfs_inode *ntfsCreate (ntfs_vd *vd, const char *path, mode_t type, const char *target); +int ntfsLink (ntfs_vd *vd, const char *old_path, const char *new_path); +int ntfsUnlink (ntfs_vd *vd, const char *path); +int ntfsSync (ntfs_vd *vd, ntfs_inode *ni); +int ntfsStat (ntfs_vd *vd, ntfs_inode *ni, struct stat *st); +void ntfsUpdateTimes (ntfs_vd *vd, ntfs_inode *ni, ntfs_time_update_flags mask); + +const char *ntfsRealPath (const char *path); +int ntfsUnicodeToLocal (const ntfschar *ins, const int ins_len, char **outs, int outs_len); +int ntfsLocalToUnicode (const char *ins, ntfschar **outs); + +#endif /* _NTFSINTERNAL_H */ diff --git a/portlibs/sources/libntfs/ntfstime.h b/portlibs/sources/libntfs/ntfstime.h new file mode 100644 index 00000000..426269d7 --- /dev/null +++ b/portlibs/sources/libntfs/ntfstime.h @@ -0,0 +1,121 @@ +/* + * ntfstime.h - NTFS time related functions. Originated from the Linux-NTFS project. + * + * Copyright (c) 2005 Anton Altaparmakov + * Copyright (c) 2005 Yura Pakhuchiy + * Copyright (c) 2010 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 + */ + +#ifndef _NTFS_NTFSTIME_H +#define _NTFS_NTFSTIME_H + +#ifdef HAVE_TIME_H +#include <time.h> +#endif +#ifdef HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#ifdef HAVE_GETTIMEOFDAY +#include <sys/time.h> +#endif + +#include "types.h" + +/* + * There are four times more conversions of internal representation + * to ntfs representation than any other conversion, so the most + * efficient internal representation is ntfs representation + * (with low endianness) + */ +typedef sle64 ntfs_time; + +#define NTFS_TIME_OFFSET ((s64)(369 * 365 + 89) * 24 * 3600 * 10000000) + +/** + * ntfs2timespec - Convert an NTFS time to Unix time + * @ntfs_time: An NTFS time in 100ns units since 1601 + * + * NTFS stores times as the number of 100ns intervals since January 1st 1601 at + * 00:00 UTC. This system will not suffer from Y2K problems until ~57000AD. + * + * Return: A Unix time (number of seconds since 1970, and nanoseconds) + */ +static __inline__ struct timespec ntfs2timespec(ntfs_time ntfstime) +{ + struct timespec spec; + s64 cputime; + + cputime = sle64_to_cpu(ntfstime); + spec.tv_sec = (cputime - (NTFS_TIME_OFFSET)) / 10000000; + spec.tv_nsec = (cputime - (NTFS_TIME_OFFSET) + - (s64)spec.tv_sec*10000000)*100; + /* force zero nsec for overflowing dates */ + if ((spec.tv_nsec < 0) || (spec.tv_nsec > 999999999)) + spec.tv_nsec = 0; + return (spec); +} + +/** + * timespec2ntfs - Convert Linux time to NTFS time + * @utc_time: Linux time to convert to NTFS + * + * Convert the Linux time @utc_time to its corresponding NTFS time. + * + * Linux stores time in a long at present and measures it as the number of + * 1-second intervals since 1st January 1970, 00:00:00 UTC + * with a separated non-negative nanosecond value + * + * NTFS uses Microsoft's standard time format which is stored in a sle64 and is + * measured as the number of 100 nano-second intervals since 1st January 1601, + * 00:00:00 UTC. + * + * Return: An NTFS time (100ns units since Jan 1601) + */ +static __inline__ ntfs_time timespec2ntfs(struct timespec spec) +{ + s64 units; + + units = (s64)spec.tv_sec * 10000000 + + NTFS_TIME_OFFSET + spec.tv_nsec/100; + return (cpu_to_le64(units)); +} + +/* + * Return the current time in ntfs format + */ + +static __inline__ ntfs_time ntfs_current_time(void) +{ + struct timespec now; + +#if defined(HAVE_CLOCK_GETTIME) || defined(HAVE_SYS_CLOCK_GETTIME) + clock_gettime(CLOCK_REALTIME, &now); +#elif defined(HAVE_GETTIMEOFDAY) + struct timeval microseconds; + + gettimeofday(µseconds, (struct timezone*)NULL); + now.tv_sec = microseconds.tv_sec; + now.tv_nsec = microseconds.tv_usec*1000; +#else + now.tv_sec = time((time_t*)NULL); + now.tv_nsec = 0; +#endif + return (timespec2ntfs(now)); +} + +#endif /* _NTFS_NTFSTIME_H */ diff --git a/portlibs/sources/libntfs/object_id.c b/portlibs/sources/libntfs/object_id.c new file mode 100644 index 00000000..8799ddba --- /dev/null +++ b/portlibs/sources/libntfs/object_id.c @@ -0,0 +1,641 @@ +/** + * object_id.c - Processing of object ids + * + * This module is part of ntfs-3g library + * + * Copyright (c) 2009 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_SETXATTR +#include <sys/xattr.h> +#endif + +#ifdef HAVE_SYS_SYSMACROS_H +#include <sys/sysmacros.h> +#endif + +#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 "lcnalloc.h" +#include "object_id.h" +#include "logging.h" +#include "misc.h" + +/* + * Endianness considerations + * + * According to RFC 4122, GUIDs should be printed with the most + * significant byte first, and the six fields be compared individually + * for ordering. RFC 4122 does not define the internal representation. + * + * Here we always copy disk images with no endianness change, + * and, for indexing, GUIDs are compared as if they were a sequence + * of four unsigned 32 bit integers. + * + * --------------------- begin from RFC 4122 ---------------------- + * Consider each field of the UUID to be an unsigned integer as shown + * in the table in section Section 4.1.2. Then, to compare a pair of + * UUIDs, arithmetically compare the corresponding fields from each + * UUID in order of significance and according to their data type. + * Two UUIDs are equal if and only if all the corresponding fields + * are equal. + * + * UUIDs, as defined in this document, can also be ordered + * lexicographically. For a pair of UUIDs, the first one follows the + * second if the most significant field in which the UUIDs differ is + * greater for the first UUID. The second precedes the first if the + * most significant field in which the UUIDs differ is greater for + * the second UUID. + * + * The fields are encoded as 16 octets, with the sizes and order of the + * fields defined above, and with each field encoded with the Most + * Significant Byte first (known as network byte order). Note that the + * field names, particularly for multiplexed fields, follow historical + * practice. + * + * 0 1 2 3 + * 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 + * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + * | time_low | + * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + * | time_mid | time_hi_and_version | + * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + * |clk_seq_hi_res | clk_seq_low | node (0-1) | + * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + * | node (2-5) | + * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ + * + * ---------------------- end from RFC 4122 ----------------------- + */ + +typedef struct { + union { + /* alignment may be needed to evaluate collations */ + u32 alignment; + GUID guid; + } object_id; +} OBJECT_ID_INDEX_KEY; + +typedef struct { + le64 file_id; + GUID birth_volume_id; + GUID birth_object_id; + GUID domain_id; +} OBJECT_ID_INDEX_DATA; // known as OBJ_ID_INDEX_DATA + +struct OBJECT_ID_INDEX { /* index entry in $Extend/$ObjId */ + INDEX_ENTRY_HEADER header; + OBJECT_ID_INDEX_KEY key; + OBJECT_ID_INDEX_DATA data; +} ; + +static ntfschar objid_index_name[] = { const_cpu_to_le16('$'), + const_cpu_to_le16('O') }; +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +/* + * Set the index for a new object id + * + * Returns 0 if success + * -1 if failure, explained by errno + */ + +static int set_object_id_index(ntfs_inode *ni, ntfs_index_context *xo, + const OBJECT_ID_ATTR *object_id) +{ + struct OBJECT_ID_INDEX indx; + u64 file_id_cpu; + le64 file_id; + le16 seqn; + + seqn = ni->mrec->sequence_number; + file_id_cpu = MK_MREF(ni->mft_no,le16_to_cpu(seqn)); + file_id = cpu_to_le64(file_id_cpu); + indx.header.data_offset = const_cpu_to_le16( + sizeof(INDEX_ENTRY_HEADER) + + sizeof(OBJECT_ID_INDEX_KEY)); + indx.header.data_length = const_cpu_to_le16( + sizeof(OBJECT_ID_INDEX_DATA)); + indx.header.reservedV = const_cpu_to_le32(0); + indx.header.length = const_cpu_to_le16( + sizeof(struct OBJECT_ID_INDEX)); + indx.header.key_length = const_cpu_to_le16( + sizeof(OBJECT_ID_INDEX_KEY)); + indx.header.flags = const_cpu_to_le16(0); + indx.header.reserved = const_cpu_to_le16(0); + + memcpy(&indx.key.object_id,object_id,sizeof(GUID)); + + indx.data.file_id = file_id; + memcpy(&indx.data.birth_volume_id, + &object_id->birth_volume_id,sizeof(GUID)); + memcpy(&indx.data.birth_object_id, + &object_id->birth_object_id,sizeof(GUID)); + memcpy(&indx.data.domain_id, + &object_id->domain_id,sizeof(GUID)); + ntfs_index_ctx_reinit(xo); + return (ntfs_ie_add(xo,(INDEX_ENTRY*)&indx)); +} + +#endif /* HAVE_SETXATTR */ + +/* + * Open the $Extend/$ObjId file and its index + * + * Return the index context if opened + * or NULL if an error occurred (errno tells why) + * + * The index has to be freed and inode closed when not needed any more. + */ + +static ntfs_index_context *open_object_id_index(ntfs_volume *vol) +{ + u64 inum; + ntfs_inode *ni; + ntfs_inode *dir_ni; + ntfs_index_context *xo; + + /* do not use path_name_to inode - could reopen root */ + dir_ni = ntfs_inode_open(vol, FILE_Extend); + ni = (ntfs_inode*)NULL; + if (dir_ni) { + inum = ntfs_inode_lookup_by_mbsname(dir_ni,"$ObjId"); + if (inum != (u64)-1) + ni = ntfs_inode_open(vol, inum); + ntfs_inode_close(dir_ni); + } + if (ni) { + xo = ntfs_index_ctx_get(ni, objid_index_name, 2); + if (!xo) { + ntfs_inode_close(ni); + } + } else + xo = (ntfs_index_context*)NULL; + return (xo); +} + +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +/* + * Merge object_id data stored in the index into + * a full object_id struct. + * + * returns 0 if merging successful + * -1 if no data could be merged. This is generally not an error + */ + +static int merge_index_data(ntfs_inode *ni, + const OBJECT_ID_ATTR *objectid_attr, + OBJECT_ID_ATTR *full_objectid) +{ + OBJECT_ID_INDEX_KEY key; + struct OBJECT_ID_INDEX *entry; + ntfs_index_context *xo; + ntfs_inode *xoni; + int res; + + res = -1; + xo = open_object_id_index(ni->vol); + if (xo) { + memcpy(&key.object_id,objectid_attr,sizeof(GUID)); + if (!ntfs_index_lookup(&key, + sizeof(OBJECT_ID_INDEX_KEY), xo)) { + entry = (struct OBJECT_ID_INDEX*)xo->entry; + /* make sure inode numbers match */ + if (entry + && (MREF(le64_to_cpu(entry->data.file_id)) + == ni->mft_no)) { + memcpy(&full_objectid->birth_volume_id, + &entry->data.birth_volume_id, + sizeof(GUID)); + memcpy(&full_objectid->birth_object_id, + &entry->data.birth_object_id, + sizeof(GUID)); + memcpy(&full_objectid->domain_id, + &entry->data.domain_id, + sizeof(GUID)); + res = 0; + } + } + xoni = xo->ni; + ntfs_index_ctx_put(xo); + ntfs_inode_close(xoni); + } + return (res); +} + +#endif /* HAVE_SETXATTR */ + +/* + * Remove an object id index entry if attribute present + * + * Returns the size of existing object id + * (the existing object_d is returned) + * -1 if failure, explained by errno + */ + +static int remove_object_id_index(ntfs_attr *na, ntfs_index_context *xo, + OBJECT_ID_ATTR *old_attr) +{ + OBJECT_ID_INDEX_KEY key; + struct OBJECT_ID_INDEX *entry; + s64 size; + int ret; + + ret = na->data_size; + if (ret) { + /* read the existing object id attribute */ + size = ntfs_attr_pread(na, 0, sizeof(GUID), old_attr); + if (size >= (s64)sizeof(GUID)) { + memcpy(&key.object_id, + &old_attr->object_id,sizeof(GUID)); + size = sizeof(GUID); + if (!ntfs_index_lookup(&key, + sizeof(OBJECT_ID_INDEX_KEY), xo)) { + entry = (struct OBJECT_ID_INDEX*)xo->entry; + memcpy(&old_attr->birth_volume_id, + &entry->data.birth_volume_id, + sizeof(GUID)); + memcpy(&old_attr->birth_object_id, + &entry->data.birth_object_id, + sizeof(GUID)); + memcpy(&old_attr->domain_id, + &entry->data.domain_id, + sizeof(GUID)); + size = sizeof(OBJECT_ID_ATTR); + if (ntfs_index_rm(xo)) + ret = -1; + } + } else { + ret = -1; + errno = ENODATA; + } + } + return (ret); +} + +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +/* + * Update the object id and index + * + * The object_id attribute should have been created and the + * non-duplication of the GUID should have been checked before. + * + * Returns 0 if success + * -1 if failure, explained by errno + * If could not remove the existing index, nothing is done, + * If could not write the new data, no index entry is inserted + * If failed to insert the index, data is removed + */ + +static int update_object_id(ntfs_inode *ni, ntfs_index_context *xo, + const OBJECT_ID_ATTR *value, size_t size) +{ + OBJECT_ID_ATTR old_attr; + ntfs_attr *na; + int oldsize; + int written; + int res; + + res = 0; + + na = ntfs_attr_open(ni, AT_OBJECT_ID, AT_UNNAMED, 0); + if (na) { + + /* remove the existing index entry */ + oldsize = remove_object_id_index(na,xo,&old_attr); + if (oldsize < 0) + res = -1; + else { + /* resize attribute */ + res = ntfs_attr_truncate(na, (s64)sizeof(GUID)); + /* write the object_id in attribute */ + if (!res && value) { + written = (int)ntfs_attr_pwrite(na, + (s64)0, (s64)sizeof(GUID), + &value->object_id); + if (written != (s64)sizeof(GUID)) { + ntfs_log_error("Failed to update " + "object id\n"); + errno = EIO; + res = -1; + } + } + /* write index part if provided */ + if (!res + && ((size < sizeof(OBJECT_ID_ATTR)) + || set_object_id_index(ni,xo,value))) { + /* + * If cannot index, try to remove the object + * id and log the error. There will be an + * inconsistency if removal fails. + */ + ntfs_attr_rm(na); + ntfs_log_error("Failed to index object id." + " Possible corruption.\n"); + } + } + ntfs_attr_close(na); + NInoSetDirty(ni); + } else + res = -1; + return (res); +} + +/* + * Add a (dummy) object id to an inode if it does not exist + * + * returns 0 if attribute was inserted (or already present) + * -1 if adding failed (explained by errno) + */ + +static int add_object_id(ntfs_inode *ni, int flags) +{ + int res; + u8 dummy; + + res = -1; /* default return */ + if (!ntfs_attr_exist(ni,AT_OBJECT_ID, AT_UNNAMED,0)) { + if (!(flags & XATTR_REPLACE)) { + /* + * no object id attribute : add one, + * apparently, this does not feed the new value in + * Note : NTFS version must be >= 3 + */ + if (ni->vol->major_ver >= 3) { + res = ntfs_attr_add(ni, AT_OBJECT_ID, + AT_UNNAMED, 0, &dummy, (s64)0); + NInoSetDirty(ni); + } else + errno = EOPNOTSUPP; + } else + errno = ENODATA; + } else { + if (flags & XATTR_CREATE) + errno = EEXIST; + else + res = 0; + } + return (res); +} + +#endif /* HAVE_SETXATTR */ + +/* + * Delete an object_id index entry + * + * Returns 0 if success + * -1 if failure, explained by errno + */ + +int ntfs_delete_object_id_index(ntfs_inode *ni) +{ + ntfs_index_context *xo; + ntfs_inode *xoni; + ntfs_attr *na; + OBJECT_ID_ATTR old_attr; + int res; + + res = 0; + na = ntfs_attr_open(ni, AT_OBJECT_ID, AT_UNNAMED, 0); + if (na) { + /* + * read the existing object id + * and un-index it + */ + xo = open_object_id_index(ni->vol); + if (xo) { + if (remove_object_id_index(na,xo,&old_attr) < 0) + res = -1; + xoni = xo->ni; + ntfs_index_entry_mark_dirty(xo); + NInoSetDirty(xoni); + ntfs_index_ctx_put(xo); + ntfs_inode_close(xoni); + } + ntfs_attr_close(na); + } + return (res); +} + +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +/* + * Get the ntfs object id into an extended attribute + * + * If present, the object_id from the attribute and the GUIDs + * from the index are returned (formatted as OBJECT_ID_ATTR) + * + * Returns the global size (can be 0, 16 or 64) + * and the buffer is updated if it is long enough + */ + +int ntfs_get_ntfs_object_id(ntfs_inode *ni, char *value, size_t size) +{ + OBJECT_ID_ATTR full_objectid; + OBJECT_ID_ATTR *objectid_attr; + s64 attr_size; + int full_size; + + full_size = 0; /* default to no data and some error to be defined */ + if (ni) { + objectid_attr = (OBJECT_ID_ATTR*)ntfs_attr_readall(ni, + AT_OBJECT_ID,(ntfschar*)NULL, 0, &attr_size); + if (objectid_attr) { + /* restrict to only GUID present in attr */ + if (attr_size == sizeof(GUID)) { + memcpy(&full_objectid.object_id, + objectid_attr,sizeof(GUID)); + full_size = sizeof(GUID); + /* get data from index, if any */ + if (!merge_index_data(ni, objectid_attr, + &full_objectid)) { + full_size = sizeof(OBJECT_ID_ATTR); + } + if (full_size <= (s64)size) { + if (value) + memcpy(value,&full_objectid, + full_size); + else + errno = EINVAL; + } + } else { + /* unexpected size, better return unsupported */ + errno = EOPNOTSUPP; + full_size = 0; + } + free(objectid_attr); + } else + errno = ENODATA; + } + return (full_size ? (int)full_size : -errno); +} + +/* + * Set the object id from an extended attribute + * + * If the size is 64, the attribute and index are set. + * else if the size is not less than 16 only the attribute is set. + * The object id index is set accordingly. + * + * Returns 0, or -1 if there is a problem + */ + +int ntfs_set_ntfs_object_id(ntfs_inode *ni, + const char *value, size_t size, int flags) +{ + OBJECT_ID_INDEX_KEY key; + ntfs_inode *xoni; + ntfs_index_context *xo; + int res; + + res = 0; + if (ni && value && (size >= sizeof(GUID))) { + xo = open_object_id_index(ni->vol); + if (xo) { + /* make sure the GUID was not used somewhere */ + memcpy(&key.object_id, value, sizeof(GUID)); + if (ntfs_index_lookup(&key, + sizeof(OBJECT_ID_INDEX_KEY), xo)) { + ntfs_index_ctx_reinit(xo); + res = add_object_id(ni, flags); + if (!res) { + /* update value and index */ + res = update_object_id(ni,xo, + (const OBJECT_ID_ATTR*)value, + size); + } + } else { + /* GUID is present elsewhere */ + res = -1; + errno = EEXIST; + } + xoni = xo->ni; + ntfs_index_entry_mark_dirty(xo); + NInoSetDirty(xoni); + ntfs_index_ctx_put(xo); + ntfs_inode_close(xoni); + } else { + res = -1; + } + } else { + errno = EINVAL; + res = -1; + } + return (res ? -1 : 0); +} + +/* + * Remove the object id + * + * Returns 0, or -1 if there is a problem + */ + +int ntfs_remove_ntfs_object_id(ntfs_inode *ni) +{ + int res; + int olderrno; + ntfs_attr *na; + ntfs_inode *xoni; + ntfs_index_context *xo; + int oldsize; + OBJECT_ID_ATTR old_attr; + + res = 0; + if (ni) { + /* + * open and delete the object id + */ + na = ntfs_attr_open(ni, AT_OBJECT_ID, + AT_UNNAMED,0); + if (na) { + /* first remove index (old object id needed) */ + xo = open_object_id_index(ni->vol); + if (xo) { + oldsize = remove_object_id_index(na,xo, + &old_attr); + if (oldsize < 0) { + res = -1; + } else { + /* now remove attribute */ + res = ntfs_attr_rm(na); + if (res + && (oldsize > (int)sizeof(GUID))) { + /* + * If we could not remove the + * attribute, try to restore the + * index and log the error. There + * will be an inconsistency if + * the reindexing fails. + */ + set_object_id_index(ni, xo, + &old_attr); + ntfs_log_error( + "Failed to remove object id." + " Possible corruption.\n"); + } + } + + xoni = xo->ni; + ntfs_index_entry_mark_dirty(xo); + NInoSetDirty(xoni); + ntfs_index_ctx_put(xo); + ntfs_inode_close(xoni); + } + olderrno = errno; + ntfs_attr_close(na); + /* avoid errno pollution */ + if (errno == ENOENT) + errno = olderrno; + } else { + errno = ENODATA; + res = -1; + } + NInoSetDirty(ni); + } else { + errno = EINVAL; + res = -1; + } + return (res ? -1 : 0); +} + +#endif /* HAVE_SETXATTR */ diff --git a/portlibs/sources/libntfs/object_id.h b/portlibs/sources/libntfs/object_id.h new file mode 100644 index 00000000..31af9fd8 --- /dev/null +++ b/portlibs/sources/libntfs/object_id.h @@ -0,0 +1,35 @@ +/* + * + * Copyright (c) 2008 Jean-Pierre Andre + * + */ + +/* + * This program 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 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 + */ + +#ifndef OBJECT_ID_H +#define OBJECT_ID_H + +int ntfs_get_ntfs_object_id(ntfs_inode *ni, char *value, size_t size); + +int ntfs_set_ntfs_object_id(ntfs_inode *ni, const char *value, + size_t size, int flags); +int ntfs_remove_ntfs_object_id(ntfs_inode *ni); + +int ntfs_delete_object_id_index(ntfs_inode *ni); + +#endif /* OBJECT_ID_H */ diff --git a/portlibs/sources/libntfs/param.h b/portlibs/sources/libntfs/param.h new file mode 100644 index 00000000..7420c79f --- /dev/null +++ b/portlibs/sources/libntfs/param.h @@ -0,0 +1,101 @@ +/* + * param.h - Parameter values for ntfs-3g + * + * Copyright (c) 2009-2010 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 + */ + +#ifndef _NTFS_PARAM_H +#define _NTFS_PARAM_H + +#define CACHE_INODE_SIZE 32 /* inode cache, zero or >= 3 and not too big */ +#define CACHE_NIDATA_SIZE 64 /* idata cache, zero or >= 3 and not too big */ +#define CACHE_LOOKUP_SIZE 64 /* lookup cache, zero or >= 3 and not too big */ +#define CACHE_SECURID_SIZE 16 /* securid cache, zero or >= 3 and not too big */ +#define CACHE_LEGACY_SIZE 8 /* legacy cache size, zero or >= 3 and not too big */ + +#define FORCE_FORMAT_v1x 0 /* Insert security data as in NTFS v1.x */ +#define OWNERFROMACL 1 /* Get the owner from ACL (not Windows owner) */ + + /* default security sub-authorities */ +enum { + DEFSECAUTH1 = -1153374643, /* 3141592653 */ + DEFSECAUTH2 = 589793238, + DEFSECAUTH3 = 462843383, + DEFSECBASE = 10000 +}; + +/* + * Parameters for compression + */ + + /* default option for compression */ +#define DEFAULT_COMPRESSION FALSE + /* (log2 of) number of clusters in a compression block for new files */ +#define STANDARD_COMPRESSION_UNIT 4 + /* maximum cluster size for allowing compression for new files */ +#define MAX_COMPRESSION_CLUSTER_SIZE 4096 + +/* + * Parameters for runlists + */ + + /* only update the final extent of a runlist when appending data */ +#define PARTIAL_RUNLIST_UPDATING 0 + +/* + * Parameters for user and xattr mappings + */ + +#define XATTRMAPPINGFILE ".NTFS-3G/XattrMapping" /* default mapping file */ + + +/* + * Permission checking modes for high level and low level + * + * The choices for high and low lowel are independent, they have + * no effect on the library + * + * Stick to the recommended values unless you understand the consequences + * on protection and performances. Use of cacheing is good for + * performances, but bad on security with internal fuse or external + * fuse older than 2.8 + * + * Possible values for high level : + * 1 : no cache, kernel control (recommended) + * 4 : no cache, file system control + * 7 : no cache, kernel control for ACLs + * + * Possible values for low level : + * 2 : no cache, kernel control + * 3 : use kernel/fuse cache, kernel control (external fuse >= 2.8) + * 5 : no cache, file system control (recommended) + * 8 : no cache, kernel control for ACLs + * + * Use of options 7 and 8 requires a patch to fuse + * When Posix ACLs are selected in the configure options, a value + * of 6 is added in the mount report. + */ + +#define HPERMSCONFIG 1 +#if defined(FUSE_INTERNAL) || !defined(FUSE_VERSION) || (FUSE_VERSION < 28) +#define LPERMSCONFIG 5 +#else +#define LPERMSCONFIG 3 +#endif + +#endif /* defined _NTFS_PARAM_H */ diff --git a/portlibs/sources/libntfs/reparse.c b/portlibs/sources/libntfs/reparse.c new file mode 100644 index 00000000..05490bf4 --- /dev/null +++ b/portlibs/sources/libntfs/reparse.c @@ -0,0 +1,1227 @@ +/** + * reparse.c - Processing of reparse points + * + * This module is part of ntfs-3g library + * + * Copyright (c) 2008-2009 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_SETXATTR +#include <sys/xattr.h> +#endif + +#ifdef HAVE_SYS_SYSMACROS_H +#include <sys/sysmacros.h> +#endif + +#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 "lcnalloc.h" +#include "logging.h" +#include "misc.h" +#include "reparse.h" + +/* the definitions in layout.h are wrong, we use names defined in + http://msdn.microsoft.com/en-us/library/aa365740(VS.85).aspx +*/ + +#define IO_REPARSE_TAG_DFS const_cpu_to_le32(0x8000000A) +#define IO_REPARSE_TAG_DFSR const_cpu_to_le32(0x80000012) +#define IO_REPARSE_TAG_HSM const_cpu_to_le32(0xC0000004) +#define IO_REPARSE_TAG_HSM2 const_cpu_to_le32(0x80000006) +#define IO_REPARSE_TAG_MOUNT_POINT const_cpu_to_le32(0xA0000003) +#define IO_REPARSE_TAG_SIS const_cpu_to_le32(0x80000007) +#define IO_REPARSE_TAG_SYMLINK const_cpu_to_le32(0xA000000C) + +struct MOUNT_POINT_REPARSE_DATA { /* reparse data for junctions */ + le16 subst_name_offset; + le16 subst_name_length; + le16 print_name_offset; + le16 print_name_length; + char path_buffer[0]; /* above data assume this is char array */ +} ; + +struct SYMLINK_REPARSE_DATA { /* reparse data for symlinks */ + le16 subst_name_offset; + le16 subst_name_length; + le16 print_name_offset; + le16 print_name_length; + le32 flags; /* 1 for full target, otherwise 0 */ + char path_buffer[0]; /* above data assume this is char array */ +} ; + +struct REPARSE_INDEX { /* index entry in $Extend/$Reparse */ + INDEX_ENTRY_HEADER header; + REPARSE_INDEX_KEY key; + le32 filling; +} ; + +static const ntfschar dir_junction_head[] = { + const_cpu_to_le16('\\'), + const_cpu_to_le16('?'), + const_cpu_to_le16('?'), + const_cpu_to_le16('\\') +} ; + +static const ntfschar vol_junction_head[] = { + const_cpu_to_le16('\\'), + const_cpu_to_le16('?'), + const_cpu_to_le16('?'), + const_cpu_to_le16('\\'), + const_cpu_to_le16('V'), + const_cpu_to_le16('o'), + const_cpu_to_le16('l'), + const_cpu_to_le16('u'), + const_cpu_to_le16('m'), + const_cpu_to_le16('e'), + const_cpu_to_le16('{'), +} ; + +static ntfschar reparse_index_name[] = { const_cpu_to_le16('$'), + const_cpu_to_le16('R') }; + +static const char mappingdir[] = ".NTFS-3G/"; + +/* + * Fix a file name with doubtful case in some directory index + * and return the name with the casing used in directory. + * + * Should only be used to translate paths stored with case insensitivity + * (such as directory junctions) when no case conflict is expected. + * If there some ambiguity, the name which collates first is returned. + * + * The name is converted to upper case and searched the usual way. + * The collation rules for file names are such that we should get the + * first candidate if any. + */ + +static u64 ntfs_fix_file_name(ntfs_inode *dir_ni, ntfschar *uname, + int uname_len) +{ + ntfs_volume *vol = dir_ni->vol; + ntfs_index_context *icx; + u64 mref; + le64 lemref; + int lkup; + int olderrno; + int i; + u32 cpuchar; + INDEX_ENTRY *entry; + FILE_NAME_ATTR *found; + struct { + FILE_NAME_ATTR attr; + ntfschar file_name[NTFS_MAX_NAME_LEN + 1]; + } find; + + mref = (u64)-1; /* default return (not found) */ + icx = ntfs_index_ctx_get(dir_ni, NTFS_INDEX_I30, 4); + if (icx) { + if (uname_len > NTFS_MAX_NAME_LEN) + uname_len = NTFS_MAX_NAME_LEN; + find.attr.file_name_length = uname_len; + for (i=0; i<uname_len; i++) { + cpuchar = le16_to_cpu(uname[i]); + /* + * We need upper or lower value, whichever is smaller, + * but we can only convert to upper case, so we + * will fail when searching for an upper case char + * whose lower case is smaller (such as umlauted Y) + */ + if ((cpuchar < vol->upcase_len) + && (le16_to_cpu(vol->upcase[cpuchar]) < cpuchar)) + find.attr.file_name[i] = vol->upcase[cpuchar]; + else + find.attr.file_name[i] = uname[i]; + } + olderrno = errno; + lkup = ntfs_index_lookup((char*)&find, uname_len, icx); + if (errno == ENOENT) + errno = olderrno; + /* + * We generally only get the first matching candidate, + * so we still have to check whether this is a real match + */ + if (icx->entry && (icx->entry->ie_flags & INDEX_ENTRY_END)) + /* get next entry if reaching end of block */ + entry = ntfs_index_next(icx->entry, icx); + else + entry = icx->entry; + if (entry) { + found = &entry->key.file_name; + if (lkup + && ntfs_names_are_equal(find.attr.file_name, + find.attr.file_name_length, + found->file_name, found->file_name_length, + IGNORE_CASE, + vol->upcase, vol->upcase_len)) + lkup = 0; + if (!lkup) { + /* + * name found : + * fix original name and return inode + */ + lemref = entry->indexed_file; + mref = le64_to_cpu(lemref); + if (NVolCaseSensitive(vol) || !vol->locase) { + for (i=0; i<found->file_name_length; i++) + uname[i] = found->file_name[i]; + } else { + for (i=0; i<found->file_name_length; i++) + uname[i] = vol->locase[found->file_name[i]]; + } + } + } + ntfs_index_ctx_put(icx); + } + return (mref); +} + +/* + * Search for a directory junction or a symbolic link + * along the target path, with target defined as a full absolute path + * + * Returns the path translated to a Linux path + * or NULL if the path is not valid + */ + +static char *search_absolute(ntfs_volume *vol, ntfschar *path, + int count, BOOL isdir) +{ + ntfs_inode *ni; + u64 inum; + char *target; + int start; + int len; + + target = (char*)NULL; /* default return */ + ni = ntfs_inode_open(vol, (MFT_REF)FILE_root); + if (ni) { + start = 0; + do { + len = 0; + while (((start + len) < count) + && (path[start + len] != const_cpu_to_le16('\\'))) + len++; + inum = ntfs_fix_file_name(ni, &path[start], len); + ntfs_inode_close(ni); + ni = (ntfs_inode*)NULL; + if (inum != (u64)-1) { + inum = MREF(inum); + ni = ntfs_inode_open(vol, inum); + start += len; + if (start < count) + path[start++] = const_cpu_to_le16('/'); + } + } while (ni + && (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + && (start < count)); + if (ni + && (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY ? isdir : !isdir)) + if (ntfs_ucstombs(path, count, &target, 0) < 0) { + if (target) { + free(target); + target = (char*)NULL; + } + } + if (ni) + ntfs_inode_close(ni); + } + return (target); +} + +/* + * Search for a symbolic link along the target path, + * with the target defined as a relative path + * + * Note : the path used to access the current inode, may be + * different from the one implied in the target definition, + * when an inode has names in several directories. + * + * Returns the path translated to a Linux path + * or NULL if the path is not valid + */ + +static char *search_relative(ntfs_inode *ni, ntfschar *path, int count) +{ + char *target = (char*)NULL; + ntfs_inode *curni; + ntfs_inode *newni; + u64 inum; + int pos; + int lth; + BOOL ok; + int max = 32; /* safety */ + + pos = 0; + ok = TRUE; + curni = ntfs_dir_parent_inode(ni); + while (curni && ok && (pos < (count - 1)) && --max) { + if ((count >= (pos + 2)) + && (path[pos] == const_cpu_to_le16('.')) + && (path[pos+1] == const_cpu_to_le16('\\'))) { + path[1] = const_cpu_to_le16('/'); + pos += 2; + } else { + if ((count >= (pos + 3)) + && (path[pos] == const_cpu_to_le16('.')) + &&(path[pos+1] == const_cpu_to_le16('.')) + && (path[pos+2] == const_cpu_to_le16('\\'))) { + path[2] = const_cpu_to_le16('/'); + pos += 3; + newni = ntfs_dir_parent_inode(curni); + if (curni != ni) + ntfs_inode_close(curni); + curni = newni; + if (!curni) + ok = FALSE; + } else { + lth = 0; + while (((pos + lth) < count) + && (path[pos + lth] != const_cpu_to_le16('\\'))) + lth++; + if (lth > 0) + inum = ntfs_fix_file_name(curni,&path[pos],lth); + else + inum = (u64)-1; + if (!lth + || ((curni != ni) + && ntfs_inode_close(curni)) + || (inum == (u64)-1)) + ok = FALSE; + else { + curni = ntfs_inode_open(ni->vol, MREF(inum)); + if (!curni) + ok = FALSE; + else { + if (ok && ((pos + lth) < count)) { + path[pos + lth] = const_cpu_to_le16('/'); + pos += lth + 1; + } else { + pos += lth; + if ((ni->mrec->flags ^ curni->mrec->flags) + & MFT_RECORD_IS_DIRECTORY) + ok = FALSE; + if (ntfs_inode_close(curni)) + ok = FALSE; + } + } + } + } + } + } + + if (ok && (ntfs_ucstombs(path, count, &target, 0) < 0)) { + free(target); // needed ? + target = (char*)NULL; + } + return (target); +} + +/* + * Check whether a drive letter has been defined in .NTFS-3G + * + * Returns 1 if found, + * 0 if not found, + * -1 if there was an error (described by errno) + */ + +static int ntfs_drive_letter(ntfs_volume *vol, ntfschar letter) +{ + char defines[NTFS_MAX_NAME_LEN + 5]; + char *drive; + int ret; + int sz; + int olderrno; + ntfs_inode *ni; + + ret = -1; + drive = (char*)NULL; + sz = ntfs_ucstombs(&letter, 1, &drive, 0); + if (sz > 0) { + strcpy(defines,mappingdir); + if ((*drive >= 'a') && (*drive <= 'z')) + *drive += 'A' - 'a'; + strcat(defines,drive); + strcat(defines,":"); + olderrno = errno; + ni = ntfs_pathname_to_inode(vol, NULL, defines); + if (ni && !ntfs_inode_close(ni)) + ret = 1; + else + if (errno == ENOENT) { + ret = 0; + /* avoid errno pollution */ + errno = olderrno; + } + } + if (drive) + free(drive); + return (ret); +} + +/* + * Do some sanity checks on reparse data + * + * The only general check is about the size (at least the tag must + * be present) + * If the reparse data looks like a junction point or symbolic + * link, more checks can be done. + * + */ + +static BOOL valid_reparse_data(ntfs_inode *ni, + const REPARSE_POINT *reparse_attr, size_t size) +{ + BOOL ok; + unsigned int offs; + unsigned int lth; + const struct MOUNT_POINT_REPARSE_DATA *mount_point_data; + const struct SYMLINK_REPARSE_DATA *symlink_data; + + ok = ni && reparse_attr + && (size >= sizeof(REPARSE_POINT)) + && (((size_t)le16_to_cpu(reparse_attr->reparse_data_length) + + sizeof(REPARSE_POINT)) == size); + if (ok) { + switch (reparse_attr->reparse_tag) { + case IO_REPARSE_TAG_MOUNT_POINT : + mount_point_data = (const struct MOUNT_POINT_REPARSE_DATA*) + reparse_attr->reparse_data; + offs = le16_to_cpu(mount_point_data->subst_name_offset); + lth = le16_to_cpu(mount_point_data->subst_name_length); + /* consistency checks */ + if (!(ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + || ((size_t)((sizeof(REPARSE_POINT) + + sizeof(struct MOUNT_POINT_REPARSE_DATA) + + offs + lth)) > size)) + ok = FALSE; + break; + case IO_REPARSE_TAG_SYMLINK : + symlink_data = (const struct SYMLINK_REPARSE_DATA*) + reparse_attr->reparse_data; + offs = le16_to_cpu(symlink_data->subst_name_offset); + lth = le16_to_cpu(symlink_data->subst_name_length); + if ((size_t)((sizeof(REPARSE_POINT) + + sizeof(struct SYMLINK_REPARSE_DATA) + + offs + lth)) > size) + ok = FALSE; + break; + default : + break; + } + } + if (!ok) + errno = EINVAL; + return (ok); +} + +/* + * Check and translate the target of a junction point or + * a full absolute symbolic link. + * + * A full target definition begins with "\??\" or "\\?\" + * + * The fully defined target is redefined as a relative link, + * - either to the target if found on the same device. + * - or into the /.NTFS-3G directory for the user to define + * In the first situation, the target is translated to case-sensitive path. + * + * returns the target converted to a relative symlink + * or NULL if there were some problem, as described by errno + */ + +static char *ntfs_get_fulllink(ntfs_volume *vol, ntfschar *junction, + int count, const char *mnt_point, BOOL isdir) +{ + char *target; + char *fulltarget; + int sz; + char *q; + enum { DIR_JUNCTION, VOL_JUNCTION, NO_JUNCTION } kind; + + target = (char*)NULL; + fulltarget = (char*)NULL; + /* + * For a valid directory junction we want \??\x:\ + * where \ is an individual char and x a non-null char + */ + if ((count >= 7) + && !memcmp(junction,dir_junction_head,8) + && junction[4] + && (junction[5] == const_cpu_to_le16(':')) + && (junction[6] == const_cpu_to_le16('\\'))) + kind = DIR_JUNCTION; + else + /* + * For a valid volume junction we want \\?\Volume{ + * and a final \ (where \ is an individual char) + */ + if ((count >= 12) + && !memcmp(junction,vol_junction_head,22) + && (junction[count-1] == const_cpu_to_le16('\\'))) + kind = VOL_JUNCTION; + else + kind = NO_JUNCTION; + /* + * Directory junction with an explicit path and + * no specific definition for the drive letter : + * try to interpret as a target on the same volume + */ + if ((kind == DIR_JUNCTION) + && (count >= 7) + && junction[7] + && !ntfs_drive_letter(vol, junction[4])) { + target = search_absolute(vol,&junction[7],count - 7, isdir); + if (target) { + fulltarget = (char*)ntfs_malloc(strlen(mnt_point) + + strlen(target) + 2); + if (fulltarget) { + strcpy(fulltarget,mnt_point); + strcat(fulltarget,"/"); + strcat(fulltarget,target); + } + free(target); + } + } + /* + * Volume junctions or directory junctions with + * target not found on current volume : + * link to /.NTFS-3G/target which the user can + * define as a symbolic link to the real target + */ + if (((kind == DIR_JUNCTION) && !fulltarget) + || (kind == VOL_JUNCTION)) { + sz = ntfs_ucstombs(&junction[4], + (kind == VOL_JUNCTION ? count - 5 : count - 4), + &target, 0); + if ((sz > 0) && target) { + /* reverse slashes */ + for (q=target; *q; q++) + if (*q == '\\') + *q = '/'; + /* force uppercase drive letter */ + if ((target[1] == ':') + && (target[0] >= 'a') + && (target[0] <= 'z')) + target[0] += 'A' - 'a'; + fulltarget = (char*)ntfs_malloc(strlen(mnt_point) + + sizeof(mappingdir) + strlen(target) + 1); + if (fulltarget) { + strcpy(fulltarget,mnt_point); + strcat(fulltarget,"/"); + strcat(fulltarget,mappingdir); + strcat(fulltarget,target); + } + } + if (target) + free(target); + } + return (fulltarget); +} + +/* + * Check and translate the target of an absolute symbolic link. + * + * An absolute target definition begins with "\" or "x:\" + * + * The absolute target is redefined as a relative link, + * - either to the target if found on the same device. + * - or into the /.NTFS-3G directory for the user to define + * In the first situation, the target is translated to case-sensitive path. + * + * returns the target converted to a relative symlink + * or NULL if there were some problem, as described by errno + */ + +static char *ntfs_get_abslink(ntfs_volume *vol, ntfschar *junction, + int count, const char *mnt_point, BOOL isdir) +{ + char *target; + char *fulltarget; + int sz; + char *q; + enum { FULL_PATH, ABS_PATH, REJECTED_PATH } kind; + + target = (char*)NULL; + fulltarget = (char*)NULL; + /* + * For a full valid path we want x:\ + * where \ is an individual char and x a non-null char + */ + if ((count >= 3) + && junction[0] + && (junction[1] == const_cpu_to_le16(':')) + && (junction[2] == const_cpu_to_le16('\\'))) + kind = FULL_PATH; + else + /* + * For an absolute path we want an initial \ + */ + if ((count >= 0) + && (junction[0] == const_cpu_to_le16('\\'))) + kind = ABS_PATH; + else + kind = REJECTED_PATH; + /* + * Full path, with a drive letter and + * no specific definition for the drive letter : + * try to interpret as a target on the same volume. + * Do the same for an abs path with no drive letter. + */ + if (((kind == FULL_PATH) + && (count >= 3) + && junction[3] + && !ntfs_drive_letter(vol, junction[0])) + || (kind == ABS_PATH)) { + if (kind == ABS_PATH) + target = search_absolute(vol, &junction[1], + count - 1, isdir); + else + target = search_absolute(vol, &junction[3], + count - 3, isdir); + if (target) { + fulltarget = (char*)ntfs_malloc(strlen(mnt_point) + + strlen(target) + 2); + if (fulltarget) { + strcpy(fulltarget,mnt_point); + strcat(fulltarget,"/"); + strcat(fulltarget,target); + } + free(target); + } + } + /* + * full path with target not found on current volume : + * link to /.NTFS-3G/target which the user can + * define as a symbolic link to the real target + */ + if ((kind == FULL_PATH) && !fulltarget) { + sz = ntfs_ucstombs(&junction[0], + count,&target, 0); + if ((sz > 0) && target) { + /* reverse slashes */ + for (q=target; *q; q++) + if (*q == '\\') + *q = '/'; + /* force uppercase drive letter */ + if ((target[1] == ':') + && (target[0] >= 'a') + && (target[0] <= 'z')) + target[0] += 'A' - 'a'; + fulltarget = (char*)ntfs_malloc(strlen(mnt_point) + + sizeof(mappingdir) + strlen(target) + 1); + if (fulltarget) { + strcpy(fulltarget,mnt_point); + strcat(fulltarget,"/"); + strcat(fulltarget,mappingdir); + strcat(fulltarget,target); + } + } + if (target) + free(target); + } + return (fulltarget); +} + +/* + * Check and translate the target of a relative symbolic link. + * + * A relative target definition does not begin with "\" + * + * The original definition of relative target is kept, it is just + * translated to a case-sensitive path. + * + * returns the target converted to a relative symlink + * or NULL if there were some problem, as described by errno + */ + +static char *ntfs_get_rellink(ntfs_inode *ni, ntfschar *junction, int count) +{ + char *target; + + target = search_relative(ni,junction,count); + return (target); +} + +/* + * Get the target for a junction point or symbolic link + * Should only be called for files or directories with reparse data + * + * returns the target converted to a relative path, or NULL + * if some error occurred, as described by errno + * errno is EOPNOTSUPP if the reparse point is not a valid + * symbolic link or directory junction + */ + +char *ntfs_make_symlink(ntfs_inode *ni, const char *mnt_point, + int *pattr_size) +{ + s64 attr_size = 0; + char *target; + unsigned int offs; + unsigned int lth; + ntfs_volume *vol; + REPARSE_POINT *reparse_attr; + struct MOUNT_POINT_REPARSE_DATA *mount_point_data; + struct SYMLINK_REPARSE_DATA *symlink_data; + enum { FULL_TARGET, ABS_TARGET, REL_TARGET } kind; + ntfschar *p; + BOOL bad; + BOOL isdir; + + target = (char*)NULL; + bad = TRUE; + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + != const_cpu_to_le16(0); + vol = ni->vol; + reparse_attr = (REPARSE_POINT*)ntfs_attr_readall(ni, + AT_REPARSE_POINT,(ntfschar*)NULL, 0, &attr_size); + if (reparse_attr && attr_size + && valid_reparse_data(ni, reparse_attr, attr_size)) { + switch (reparse_attr->reparse_tag) { + case IO_REPARSE_TAG_MOUNT_POINT : + mount_point_data = (struct MOUNT_POINT_REPARSE_DATA*) + reparse_attr->reparse_data; + offs = le16_to_cpu(mount_point_data->subst_name_offset); + lth = le16_to_cpu(mount_point_data->subst_name_length); + /* reparse data consistency has been checked */ + target = ntfs_get_fulllink(vol, + (ntfschar*)&mount_point_data->path_buffer[offs], + lth/2, mnt_point, isdir); + if (target) + bad = FALSE; + break; + case IO_REPARSE_TAG_SYMLINK : + symlink_data = (struct SYMLINK_REPARSE_DATA*) + reparse_attr->reparse_data; + offs = le16_to_cpu(symlink_data->subst_name_offset); + lth = le16_to_cpu(symlink_data->subst_name_length); + p = (ntfschar*)&symlink_data->path_buffer[offs]; + /* + * Predetermine the kind of target, + * the called function has to make a full check + */ + if (*p++ == const_cpu_to_le16('\\')) { + if ((*p == const_cpu_to_le16('?')) + || (*p == const_cpu_to_le16('\\'))) + kind = FULL_TARGET; + else + kind = ABS_TARGET; + } else + if (*p == const_cpu_to_le16(':')) + kind = ABS_TARGET; + else + kind = REL_TARGET; + p--; + /* reparse data consistency has been checked */ + switch (kind) { + case FULL_TARGET : + if (!(symlink_data->flags + & const_cpu_to_le32(1))) { + target = ntfs_get_fulllink(vol, + p, lth/2, + mnt_point, isdir); + if (target) + bad = FALSE; + } + break; + case ABS_TARGET : + if (symlink_data->flags + & const_cpu_to_le32(1)) { + target = ntfs_get_abslink(vol, + p, lth/2, + mnt_point, isdir); + if (target) + bad = FALSE; + } + break; + case REL_TARGET : + if (symlink_data->flags + & const_cpu_to_le32(1)) { + target = ntfs_get_rellink(ni, + p, lth/2); + if (target) + bad = FALSE; + } + break; + } + break; + } + free(reparse_attr); + } + *pattr_size = attr_size; + if (bad) + errno = EOPNOTSUPP; + return (target); +} + +/* + * Check whether a reparse point looks like a junction point + * or a symbolic link. + * Should only be called for files or directories with reparse data + * + * The validity of the target is not checked. + */ + +BOOL ntfs_possible_symlink(ntfs_inode *ni) +{ + s64 attr_size = 0; + REPARSE_POINT *reparse_attr; + BOOL possible; + + possible = FALSE; + reparse_attr = (REPARSE_POINT*)ntfs_attr_readall(ni, + AT_REPARSE_POINT,(ntfschar*)NULL, 0, &attr_size); + if (reparse_attr && attr_size) { + switch (reparse_attr->reparse_tag) { + case IO_REPARSE_TAG_MOUNT_POINT : + case IO_REPARSE_TAG_SYMLINK : + possible = TRUE; + default : ; + } + free(reparse_attr); + } + return (possible); +} + +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +/* + * Set the index for new reparse data + * + * Returns 0 if success + * -1 if failure, explained by errno + */ + +static int set_reparse_index(ntfs_inode *ni, ntfs_index_context *xr, + le32 reparse_tag) +{ + struct REPARSE_INDEX indx; + u64 file_id_cpu; + le64 file_id; + le16 seqn; + + seqn = ni->mrec->sequence_number; + file_id_cpu = MK_MREF(ni->mft_no,le16_to_cpu(seqn)); + file_id = cpu_to_le64(file_id_cpu); + indx.header.data_offset = const_cpu_to_le16( + sizeof(INDEX_ENTRY_HEADER) + + sizeof(REPARSE_INDEX_KEY)); + indx.header.data_length = const_cpu_to_le16(0); + indx.header.reservedV = const_cpu_to_le32(0); + indx.header.length = const_cpu_to_le16( + sizeof(struct REPARSE_INDEX)); + indx.header.key_length = const_cpu_to_le16( + sizeof(REPARSE_INDEX_KEY)); + indx.header.flags = const_cpu_to_le16(0); + indx.header.reserved = const_cpu_to_le16(0); + indx.key.reparse_tag = reparse_tag; + /* danger on processors which require proper alignment ! */ + memcpy(&indx.key.file_id, &file_id, 8); + indx.filling = const_cpu_to_le32(0); + ntfs_index_ctx_reinit(xr); + return (ntfs_ie_add(xr,(INDEX_ENTRY*)&indx)); +} + +#endif /* HAVE_SETXATTR */ + +/* + * Remove a reparse data index entry if attribute present + * + * Returns the size of existing reparse data + * (the existing reparse tag is returned) + * -1 if failure, explained by errno + */ + +static int remove_reparse_index(ntfs_attr *na, ntfs_index_context *xr, + le32 *preparse_tag) +{ + REPARSE_INDEX_KEY key; + u64 file_id_cpu; + le64 file_id; + s64 size; + le16 seqn; + int ret; + + ret = na->data_size; + if (ret) { + /* read the existing reparse_tag */ + size = ntfs_attr_pread(na, 0, 4, preparse_tag); + if (size == 4) { + seqn = na->ni->mrec->sequence_number; + file_id_cpu = MK_MREF(na->ni->mft_no,le16_to_cpu(seqn)); + file_id = cpu_to_le64(file_id_cpu); + key.reparse_tag = *preparse_tag; + /* danger on processors which require proper alignment ! */ + memcpy(&key.file_id, &file_id, 8); + if (!ntfs_index_lookup(&key, sizeof(REPARSE_INDEX_KEY), xr) + && ntfs_index_rm(xr)) + ret = -1; + } else { + ret = -1; + errno = ENODATA; + } + } + return (ret); +} + +/* + * Open the $Extend/$Reparse file and its index + * + * Return the index context if opened + * or NULL if an error occurred (errno tells why) + * + * The index has to be freed and inode closed when not needed any more. + */ + +static ntfs_index_context *open_reparse_index(ntfs_volume *vol) +{ + u64 inum; + ntfs_inode *ni; + ntfs_inode *dir_ni; + ntfs_index_context *xr; + + /* do not use path_name_to inode - could reopen root */ + dir_ni = ntfs_inode_open(vol, FILE_Extend); + ni = (ntfs_inode*)NULL; + if (dir_ni) { + inum = ntfs_inode_lookup_by_mbsname(dir_ni,"$Reparse"); + if (inum != (u64)-1) + ni = ntfs_inode_open(vol, inum); + ntfs_inode_close(dir_ni); + } + if (ni) { + xr = ntfs_index_ctx_get(ni, reparse_index_name, 2); + if (!xr) { + ntfs_inode_close(ni); + } + } else + xr = (ntfs_index_context*)NULL; + return (xr); +} + +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +/* + * Update the reparse data and index + * + * The reparse data attribute should have been created, and + * an existing index is expected if there is an existing value. + * + * Returns 0 if success + * -1 if failure, explained by errno + * If could not remove the existing index, nothing is done, + * If could not write the new data, no index entry is inserted + * If failed to insert the index, data is removed + */ + +static int update_reparse_data(ntfs_inode *ni, ntfs_index_context *xr, + const char *value, size_t size) +{ + int res; + int written; + int oldsize; + ntfs_attr *na; + le32 reparse_tag; + + res = 0; + na = ntfs_attr_open(ni, AT_REPARSE_POINT, AT_UNNAMED, 0); + if (na) { + /* remove the existing reparse data */ + oldsize = remove_reparse_index(na,xr,&reparse_tag); + if (oldsize < 0) + res = -1; + else { + /* resize attribute */ + res = ntfs_attr_truncate(na, (s64)size); + /* overwrite value if any */ + if (!res && value) { + written = (int)ntfs_attr_pwrite(na, + (s64)0, (s64)size, value); + if (written != (s64)size) { + ntfs_log_error("Failed to update " + "reparse data\n"); + errno = EIO; + res = -1; + } + } + if (!res + && set_reparse_index(ni,xr, + ((const REPARSE_POINT*)value)->reparse_tag) + && (oldsize > 0)) { + /* + * If cannot index, try to remove the reparse + * data and log the error. There will be an + * inconsistency if removal fails. + */ + ntfs_attr_rm(na); + ntfs_log_error("Failed to index reparse data." + " Possible corruption.\n"); + } + } + ntfs_attr_close(na); + NInoSetDirty(ni); + } else + res = -1; + return (res); +} + +#endif /* HAVE_SETXATTR */ + +/* + * Delete a reparse index entry + * + * Returns 0 if success + * -1 if failure, explained by errno + */ + +int ntfs_delete_reparse_index(ntfs_inode *ni) +{ + ntfs_index_context *xr; + ntfs_inode *xrni; + ntfs_attr *na; + le32 reparse_tag; + int res; + + res = 0; + na = ntfs_attr_open(ni, AT_REPARSE_POINT, AT_UNNAMED, 0); + if (na) { + /* + * read the existing reparse data (the tag is enough) + * and un-index it + */ + xr = open_reparse_index(ni->vol); + if (xr) { + if (remove_reparse_index(na,xr,&reparse_tag) < 0) + res = -1; + xrni = xr->ni; + ntfs_index_entry_mark_dirty(xr); + NInoSetDirty(xrni); + ntfs_index_ctx_put(xr); + ntfs_inode_close(xrni); + } + ntfs_attr_close(na); + } + return (res); +} + +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +/* + * Get the ntfs reparse data into an extended attribute + * + * Returns the reparse data size + * and the buffer is updated if it is long enough + */ + +int ntfs_get_ntfs_reparse_data(ntfs_inode *ni, char *value, size_t size) +{ + REPARSE_POINT *reparse_attr; + s64 attr_size; + + attr_size = 0; /* default to no data and no error */ + if (ni) { + if (ni->flags & FILE_ATTR_REPARSE_POINT) { + reparse_attr = (REPARSE_POINT*)ntfs_attr_readall(ni, + AT_REPARSE_POINT,(ntfschar*)NULL, 0, &attr_size); + if (reparse_attr) { + if (attr_size <= (s64)size) { + if (value) + memcpy(value,reparse_attr, + attr_size); + else + errno = EINVAL; + } + free(reparse_attr); + } + } else + errno = ENODATA; + } + return (attr_size ? (int)attr_size : -errno); +} + +/* + * Set the reparse data from an extended attribute + * + * Warning : the new data is not checked + * + * Returns 0, or -1 if there is a problem + */ + +int ntfs_set_ntfs_reparse_data(ntfs_inode *ni, + const char *value, size_t size, int flags) +{ + int res; + u8 dummy; + ntfs_inode *xrni; + ntfs_index_context *xr; + + res = 0; + if (ni && valid_reparse_data(ni, (const REPARSE_POINT*)value, size)) { + xr = open_reparse_index(ni->vol); + if (xr) { + if (!ntfs_attr_exist(ni,AT_REPARSE_POINT, + AT_UNNAMED,0)) { + if (!(flags & XATTR_REPLACE)) { + /* + * no reparse data attribute : add one, + * apparently, this does not feed the new value in + * Note : NTFS version must be >= 3 + */ + if (ni->vol->major_ver >= 3) { + res = ntfs_attr_add(ni, + AT_REPARSE_POINT, + AT_UNNAMED,0,&dummy, + (s64)0); + if (!res) { + ni->flags |= + FILE_ATTR_REPARSE_POINT; + NInoFileNameSetDirty(ni); + } + NInoSetDirty(ni); + } else { + errno = EOPNOTSUPP; + res = -1; + } + } else { + errno = ENODATA; + res = -1; + } + } else { + if (flags & XATTR_CREATE) { + errno = EEXIST; + res = -1; + } + } + if (!res) { + /* update value and index */ + res = update_reparse_data(ni,xr,value,size); + } + xrni = xr->ni; + ntfs_index_entry_mark_dirty(xr); + NInoSetDirty(xrni); + ntfs_index_ctx_put(xr); + ntfs_inode_close(xrni); + } else { + res = -1; + } + } else { + errno = EINVAL; + res = -1; + } + return (res ? -1 : 0); +} + +/* + * Remove the reparse data + * + * Returns 0, or -1 if there is a problem + */ + +int ntfs_remove_ntfs_reparse_data(ntfs_inode *ni) +{ + int res; + int olderrno; + ntfs_attr *na; + ntfs_inode *xrni; + ntfs_index_context *xr; + le32 reparse_tag; + + res = 0; + if (ni) { + /* + * open and delete the reparse data + */ + na = ntfs_attr_open(ni, AT_REPARSE_POINT, + AT_UNNAMED,0); + if (na) { + /* first remove index (reparse data needed) */ + xr = open_reparse_index(ni->vol); + if (xr) { + if (remove_reparse_index(na,xr, + &reparse_tag) < 0) { + res = -1; + } else { + /* now remove attribute */ + res = ntfs_attr_rm(na); + if (!res) { + ni->flags &= + ~FILE_ATTR_REPARSE_POINT; + NInoFileNameSetDirty(ni); + } else { + /* + * If we could not remove the + * attribute, try to restore the + * index and log the error. There + * will be an inconsistency if + * the reindexing fails. + */ + set_reparse_index(ni, xr, + reparse_tag); + ntfs_log_error( + "Failed to remove reparse data." + " Possible corruption.\n"); + } + } + xrni = xr->ni; + ntfs_index_entry_mark_dirty(xr); + NInoSetDirty(xrni); + ntfs_index_ctx_put(xr); + ntfs_inode_close(xrni); + } + olderrno = errno; + ntfs_attr_close(na); + /* avoid errno pollution */ + if (errno == ENOENT) + errno = olderrno; + } else { + errno = ENODATA; + res = -1; + } + NInoSetDirty(ni); + } else { + errno = EINVAL; + res = -1; + } + return (res ? -1 : 0); +} + +#endif /* HAVE_SETXATTR */ diff --git a/portlibs/sources/libntfs/reparse.h b/portlibs/sources/libntfs/reparse.h new file mode 100644 index 00000000..35f4aa45 --- /dev/null +++ b/portlibs/sources/libntfs/reparse.h @@ -0,0 +1,39 @@ +/* + * + * Copyright (c) 2008 Jean-Pierre Andre + * + */ + +/* + * This program 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 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 + */ + +#ifndef REPARSE_H +#define REPARSE_H + +char *ntfs_make_symlink(ntfs_inode *ni, const char *mnt_point, + int *pattr_size); +BOOL ntfs_possible_symlink(ntfs_inode *ni); + +int ntfs_get_ntfs_reparse_data(ntfs_inode *ni, char *value, size_t size); + +int ntfs_set_ntfs_reparse_data(ntfs_inode *ni, const char *value, + size_t size, int flags); +int ntfs_remove_ntfs_reparse_data(ntfs_inode *ni); + +int ntfs_delete_reparse_index(ntfs_inode *ni); + +#endif /* REPARSE_H */ diff --git a/portlibs/sources/libntfs/runlist.c b/portlibs/sources/libntfs/runlist.c new file mode 100644 index 00000000..383a80b2 --- /dev/null +++ b/portlibs/sources/libntfs/runlist.c @@ -0,0 +1,2171 @@ +/** + * runlist.c - Run list handling code. Originated from the Linux-NTFS project. + * + * Copyright (c) 2002-2005 Anton Altaparmakov + * Copyright (c) 2002-2005 Richard Russon + * Copyright (c) 2002-2008 Szabolcs Szakacsits + * Copyright (c) 2004 Yura Pakhuchiy + * Copyright (c) 2007-2010 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "compat.h" +#include "types.h" +#include "volume.h" +#include "layout.h" +#include "debug.h" +#include "device.h" +#include "logging.h" +#include "misc.h" + +/** + * ntfs_rl_mm - runlist memmove + * @base: + * @dst: + * @src: + * @size: + * + * Description... + * + * Returns: + */ +static void ntfs_rl_mm(runlist_element *base, int dst, int src, int size) +{ + if ((dst != src) && (size > 0)) + memmove(base + dst, base + src, size * sizeof(*base)); +} + +/** + * ntfs_rl_mc - runlist memory copy + * @dstbase: + * @dst: + * @srcbase: + * @src: + * @size: + * + * Description... + * + * Returns: + */ +static void ntfs_rl_mc(runlist_element *dstbase, int dst, + runlist_element *srcbase, int src, int size) +{ + if (size > 0) + memcpy(dstbase + dst, srcbase + src, size * sizeof(*dstbase)); +} + +/** + * ntfs_rl_realloc - Reallocate memory for runlists + * @rl: original runlist + * @old_size: number of runlist elements in the original runlist @rl + * @new_size: number of runlist elements we need space for + * + * As the runlists grow, more memory will be required. To prevent large + * numbers of small reallocations of memory, this function returns a 4kiB block + * of memory. + * + * N.B. If the new allocation doesn't require a different number of 4kiB + * blocks in memory, the function will return the original pointer. + * + * On success, return a pointer to the newly allocated, or recycled, memory. + * On error, return NULL with errno set to the error code. + */ +static runlist_element *ntfs_rl_realloc(runlist_element *rl, int old_size, + int new_size) +{ + old_size = (old_size * sizeof(runlist_element) + 0xfff) & ~0xfff; + new_size = (new_size * sizeof(runlist_element) + 0xfff) & ~0xfff; + if (old_size == new_size) + return rl; + return realloc(rl, new_size); +} + +/* + * Extend a runlist by some entry count + * The runlist may have to be reallocated + * + * Returns the reallocated runlist + * or NULL if reallocation was not possible (with errno set) + * the runlist is left unchanged if the reallocation fails + */ + +runlist_element *ntfs_rl_extend(ntfs_attr *na, runlist_element *rl, + int more_entries) +{ + runlist_element *newrl; + int last; + int irl; + + if (na->rl && rl) { + irl = (int)(rl - na->rl); + last = irl; + while (na->rl[last].length) + last++; + newrl = ntfs_rl_realloc(na->rl,last+1,last+more_entries+1); + if (!newrl) { + errno = ENOMEM; + rl = (runlist_element*)NULL; + } else + na->rl = newrl; + rl = &newrl[irl]; + } else { + ntfs_log_error("Cannot extend unmapped runlist"); + errno = EIO; + rl = (runlist_element*)NULL; + } + return (rl); +} + +/** + * ntfs_rl_are_mergeable - test if two runlists can be joined together + * @dst: original runlist + * @src: new runlist to test for mergeability with @dst + * + * Test if two runlists can be joined together. For this, their VCNs and LCNs + * must be adjacent. + * + * Return: TRUE Success, the runlists can be merged. + * FALSE Failure, the runlists cannot be merged. + */ +static BOOL ntfs_rl_are_mergeable(runlist_element *dst, runlist_element *src) +{ + if (!dst || !src) { + ntfs_log_debug("Eeek. ntfs_rl_are_mergeable() invoked with NULL " + "pointer!\n"); + return FALSE; + } + + /* We can merge unmapped regions even if they are misaligned. */ + if ((dst->lcn == LCN_RL_NOT_MAPPED) && (src->lcn == LCN_RL_NOT_MAPPED)) + return TRUE; + /* If the runs are misaligned, we cannot merge them. */ + if ((dst->vcn + dst->length) != src->vcn) + return FALSE; + /* If both runs are non-sparse and contiguous, we can merge them. */ + if ((dst->lcn >= 0) && (src->lcn >= 0) && + ((dst->lcn + dst->length) == src->lcn)) + return TRUE; + /* If we are merging two holes, we can merge them. */ + if ((dst->lcn == LCN_HOLE) && (src->lcn == LCN_HOLE)) + return TRUE; + /* Cannot merge. */ + return FALSE; +} + +/** + * __ntfs_rl_merge - merge two runlists without testing if they can be merged + * @dst: original, destination runlist + * @src: new runlist to merge with @dst + * + * Merge the two runlists, writing into the destination runlist @dst. The + * caller must make sure the runlists can be merged or this will corrupt the + * destination runlist. + */ +static void __ntfs_rl_merge(runlist_element *dst, runlist_element *src) +{ + dst->length += src->length; +} + +/** + * ntfs_rl_append - append a runlist after a given element + * @dst: original runlist to be worked on + * @dsize: number of elements in @dst (including end marker) + * @src: runlist to be inserted into @dst + * @ssize: number of elements in @src (excluding end marker) + * @loc: append the new runlist @src after this element in @dst + * + * Append the runlist @src after element @loc in @dst. Merge the right end of + * the new runlist, if necessary. Adjust the size of the hole before the + * appended runlist. + * + * On success, return a pointer to the new, combined, runlist. Note, both + * runlists @dst and @src are deallocated before returning so you cannot use + * the pointers for anything any more. (Strictly speaking the returned runlist + * may be the same as @dst but this is irrelevant.) + * + * On error, return NULL, with errno set to the error code. Both runlists are + * left unmodified. + */ +static runlist_element *ntfs_rl_append(runlist_element *dst, int dsize, + runlist_element *src, int ssize, int loc) +{ + BOOL right = FALSE; /* Right end of @src needs merging */ + int marker; /* End of the inserted runs */ + + if (!dst || !src) { + ntfs_log_debug("Eeek. ntfs_rl_append() invoked with NULL " + "pointer!\n"); + errno = EINVAL; + return NULL; + } + + /* First, check if the right hand end needs merging. */ + if ((loc + 1) < dsize) + right = ntfs_rl_are_mergeable(src + ssize - 1, dst + loc + 1); + + /* Space required: @dst size + @src size, less one if we merged. */ + dst = ntfs_rl_realloc(dst, dsize, dsize + ssize - right); + if (!dst) + return NULL; + /* + * We are guaranteed to succeed from here so can start modifying the + * original runlists. + */ + + /* First, merge the right hand end, if necessary. */ + if (right) + __ntfs_rl_merge(src + ssize - 1, dst + loc + 1); + + /* marker - First run after the @src runs that have been inserted */ + marker = loc + ssize + 1; + + /* Move the tail of @dst out of the way, then copy in @src. */ + ntfs_rl_mm(dst, marker, loc + 1 + right, dsize - loc - 1 - right); + ntfs_rl_mc(dst, loc + 1, src, 0, ssize); + + /* Adjust the size of the preceding hole. */ + dst[loc].length = dst[loc + 1].vcn - dst[loc].vcn; + + /* We may have changed the length of the file, so fix the end marker */ + if (dst[marker].lcn == LCN_ENOENT) + dst[marker].vcn = dst[marker-1].vcn + dst[marker-1].length; + + return dst; +} + +/** + * ntfs_rl_insert - insert a runlist into another + * @dst: original runlist to be worked on + * @dsize: number of elements in @dst (including end marker) + * @src: new runlist to be inserted + * @ssize: number of elements in @src (excluding end marker) + * @loc: insert the new runlist @src before this element in @dst + * + * Insert the runlist @src before element @loc in the runlist @dst. Merge the + * left end of the new runlist, if necessary. Adjust the size of the hole + * after the inserted runlist. + * + * On success, return a pointer to the new, combined, runlist. Note, both + * runlists @dst and @src are deallocated before returning so you cannot use + * the pointers for anything any more. (Strictly speaking the returned runlist + * may be the same as @dst but this is irrelevant.) + * + * On error, return NULL, with errno set to the error code. Both runlists are + * left unmodified. + */ +static runlist_element *ntfs_rl_insert(runlist_element *dst, int dsize, + runlist_element *src, int ssize, int loc) +{ + BOOL left = FALSE; /* Left end of @src needs merging */ + BOOL disc = FALSE; /* Discontinuity between @dst and @src */ + int marker; /* End of the inserted runs */ + + if (!dst || !src) { + ntfs_log_debug("Eeek. ntfs_rl_insert() invoked with NULL " + "pointer!\n"); + errno = EINVAL; + return NULL; + } + + /* disc => Discontinuity between the end of @dst and the start of @src. + * This means we might need to insert a "notmapped" run. + */ + if (loc == 0) + disc = (src[0].vcn > 0); + else { + s64 merged_length; + + left = ntfs_rl_are_mergeable(dst + loc - 1, src); + + merged_length = dst[loc - 1].length; + if (left) + merged_length += src->length; + + disc = (src[0].vcn > dst[loc - 1].vcn + merged_length); + } + + /* Space required: @dst size + @src size, less one if we merged, plus + * one if there was a discontinuity. + */ + dst = ntfs_rl_realloc(dst, dsize, dsize + ssize - left + disc); + if (!dst) + return NULL; + /* + * We are guaranteed to succeed from here so can start modifying the + * original runlist. + */ + + if (left) + __ntfs_rl_merge(dst + loc - 1, src); + + /* + * marker - First run after the @src runs that have been inserted + * Nominally: marker = @loc + @ssize (location + number of runs in @src) + * If "left", then the first run in @src has been merged with one in @dst. + * If "disc", then @dst and @src don't meet and we need an extra run to fill the gap. + */ + marker = loc + ssize - left + disc; + + /* Move the tail of @dst out of the way, then copy in @src. */ + ntfs_rl_mm(dst, marker, loc, dsize - loc); + ntfs_rl_mc(dst, loc + disc, src, left, ssize - left); + + /* Adjust the VCN of the first run after the insertion ... */ + dst[marker].vcn = dst[marker - 1].vcn + dst[marker - 1].length; + /* ... and the length. */ + if (dst[marker].lcn == LCN_HOLE || dst[marker].lcn == LCN_RL_NOT_MAPPED) + dst[marker].length = dst[marker + 1].vcn - dst[marker].vcn; + + /* Writing beyond the end of the file and there's a discontinuity. */ + if (disc) { + if (loc > 0) { + dst[loc].vcn = dst[loc - 1].vcn + dst[loc - 1].length; + dst[loc].length = dst[loc + 1].vcn - dst[loc].vcn; + } else { + dst[loc].vcn = 0; + dst[loc].length = dst[loc + 1].vcn; + } + dst[loc].lcn = LCN_RL_NOT_MAPPED; + } + return dst; +} + +/** + * ntfs_rl_replace - overwrite a runlist element with another runlist + * @dst: original runlist to be worked on + * @dsize: number of elements in @dst (including end marker) + * @src: new runlist to be inserted + * @ssize: number of elements in @src (excluding end marker) + * @loc: index in runlist @dst to overwrite with @src + * + * Replace the runlist element @dst at @loc with @src. Merge the left and + * right ends of the inserted runlist, if necessary. + * + * On success, return a pointer to the new, combined, runlist. Note, both + * runlists @dst and @src are deallocated before returning so you cannot use + * the pointers for anything any more. (Strictly speaking the returned runlist + * may be the same as @dst but this is irrelevant.) + * + * On error, return NULL, with errno set to the error code. Both runlists are + * left unmodified. + */ +static runlist_element *ntfs_rl_replace(runlist_element *dst, int dsize, + runlist_element *src, int ssize, + int loc) +{ + signed delta; + BOOL left = FALSE; /* Left end of @src needs merging */ + BOOL right = FALSE; /* Right end of @src needs merging */ + int tail; /* Start of tail of @dst */ + int marker; /* End of the inserted runs */ + + if (!dst || !src) { + ntfs_log_debug("Eeek. ntfs_rl_replace() invoked with NULL " + "pointer!\n"); + errno = EINVAL; + return NULL; + } + + /* First, see if the left and right ends need merging. */ + if ((loc + 1) < dsize) + right = ntfs_rl_are_mergeable(src + ssize - 1, dst + loc + 1); + if (loc > 0) + left = ntfs_rl_are_mergeable(dst + loc - 1, src); + + /* Allocate some space. We'll need less if the left, right, or both + * ends get merged. The -1 accounts for the run being replaced. + */ + delta = ssize - 1 - left - right; + if (delta > 0) { + dst = ntfs_rl_realloc(dst, dsize, dsize + delta); + if (!dst) + return NULL; + } + /* + * We are guaranteed to succeed from here so can start modifying the + * original runlists. + */ + + /* First, merge the left and right ends, if necessary. */ + if (right) + __ntfs_rl_merge(src + ssize - 1, dst + loc + 1); + if (left) + __ntfs_rl_merge(dst + loc - 1, src); + + /* + * tail - Offset of the tail of @dst + * Nominally: @tail = @loc + 1 (location, skipping the replaced run) + * If "right", then one of @dst's runs is already merged into @src. + */ + tail = loc + right + 1; + + /* + * marker - First run after the @src runs that have been inserted + * Nominally: @marker = @loc + @ssize (location + number of runs in @src) + * If "left", then the first run in @src has been merged with one in @dst. + */ + marker = loc + ssize - left; + + /* Move the tail of @dst out of the way, then copy in @src. */ + ntfs_rl_mm(dst, marker, tail, dsize - tail); + ntfs_rl_mc(dst, loc, src, left, ssize - left); + + /* We may have changed the length of the file, so fix the end marker */ + if (((dsize - tail) > 0) && (dst[marker].lcn == LCN_ENOENT)) + dst[marker].vcn = dst[marker - 1].vcn + dst[marker - 1].length; + + return dst; +} + +/** + * ntfs_rl_split - insert a runlist into the centre of a hole + * @dst: original runlist to be worked on + * @dsize: number of elements in @dst (including end marker) + * @src: new runlist to be inserted + * @ssize: number of elements in @src (excluding end marker) + * @loc: index in runlist @dst at which to split and insert @src + * + * Split the runlist @dst at @loc into two and insert @new in between the two + * fragments. No merging of runlists is necessary. Adjust the size of the + * holes either side. + * + * On success, return a pointer to the new, combined, runlist. Note, both + * runlists @dst and @src are deallocated before returning so you cannot use + * the pointers for anything any more. (Strictly speaking the returned runlist + * may be the same as @dst but this is irrelevant.) + * + * On error, return NULL, with errno set to the error code. Both runlists are + * left unmodified. + */ +static runlist_element *ntfs_rl_split(runlist_element *dst, int dsize, + runlist_element *src, int ssize, int loc) +{ + if (!dst || !src) { + ntfs_log_debug("Eeek. ntfs_rl_split() invoked with NULL pointer!\n"); + errno = EINVAL; + return NULL; + } + + /* Space required: @dst size + @src size + one new hole. */ + dst = ntfs_rl_realloc(dst, dsize, dsize + ssize + 1); + if (!dst) + return dst; + /* + * We are guaranteed to succeed from here so can start modifying the + * original runlists. + */ + + /* Move the tail of @dst out of the way, then copy in @src. */ + ntfs_rl_mm(dst, loc + 1 + ssize, loc, dsize - loc); + ntfs_rl_mc(dst, loc + 1, src, 0, ssize); + + /* Adjust the size of the holes either size of @src. */ + dst[loc].length = dst[loc+1].vcn - dst[loc].vcn; + dst[loc+ssize+1].vcn = dst[loc+ssize].vcn + dst[loc+ssize].length; + dst[loc+ssize+1].length = dst[loc+ssize+2].vcn - dst[loc+ssize+1].vcn; + + return dst; +} + + +/** + * ntfs_runlists_merge_i - see ntfs_runlists_merge + */ +static runlist_element *ntfs_runlists_merge_i(runlist_element *drl, + runlist_element *srl) +{ + int di, si; /* Current index into @[ds]rl. */ + int sstart; /* First index with lcn > LCN_RL_NOT_MAPPED. */ + int dins; /* Index into @drl at which to insert @srl. */ + int dend, send; /* Last index into @[ds]rl. */ + int dfinal, sfinal; /* The last index into @[ds]rl with + lcn >= LCN_HOLE. */ + int marker = 0; + VCN marker_vcn = 0; + + ntfs_log_debug("dst:\n"); + ntfs_debug_runlist_dump(drl); + ntfs_log_debug("src:\n"); + ntfs_debug_runlist_dump(srl); + + /* Check for silly calling... */ + if (!srl) + return drl; + + /* Check for the case where the first mapping is being done now. */ + if (!drl) { + drl = srl; + /* Complete the source runlist if necessary. */ + if (drl[0].vcn) { + /* Scan to the end of the source runlist. */ + for (dend = 0; drl[dend].length; dend++) + ; + dend++; + drl = ntfs_rl_realloc(drl, dend, dend + 1); + if (!drl) + return drl; + /* Insert start element at the front of the runlist. */ + ntfs_rl_mm(drl, 1, 0, dend); + drl[0].vcn = 0; + drl[0].lcn = LCN_RL_NOT_MAPPED; + drl[0].length = drl[1].vcn; + } + goto finished; + } + + si = di = 0; + + /* Skip any unmapped start element(s) in the source runlist. */ + while (srl[si].length && srl[si].lcn < (LCN)LCN_HOLE) + si++; + + /* Can't have an entirely unmapped source runlist. */ + if (!srl[si].length) { + errno = EINVAL; + ntfs_log_perror("%s: unmapped source runlist", __FUNCTION__); + return NULL; + } + + /* Record the starting points. */ + sstart = si; + + /* + * Skip forward in @drl until we reach the position where @srl needs to + * be inserted. If we reach the end of @drl, @srl just needs to be + * appended to @drl. + */ + for (; drl[di].length; di++) { + if (drl[di].vcn + drl[di].length > srl[sstart].vcn) + break; + } + dins = di; + + /* Sanity check for illegal overlaps. */ + if ((drl[di].vcn == srl[si].vcn) && (drl[di].lcn >= 0) && + (srl[si].lcn >= 0)) { + errno = ERANGE; + ntfs_log_perror("Run lists overlap. Cannot merge"); + return NULL; + } + + /* Scan to the end of both runlists in order to know their sizes. */ + for (send = si; srl[send].length; send++) + ; + for (dend = di; drl[dend].length; dend++) + ; + + if (srl[send].lcn == (LCN)LCN_ENOENT) + marker_vcn = srl[marker = send].vcn; + + /* Scan to the last element with lcn >= LCN_HOLE. */ + for (sfinal = send; sfinal >= 0 && srl[sfinal].lcn < LCN_HOLE; sfinal--) + ; + for (dfinal = dend; dfinal >= 0 && drl[dfinal].lcn < LCN_HOLE; dfinal--) + ; + + { + BOOL start; + BOOL finish; + int ds = dend + 1; /* Number of elements in drl & srl */ + int ss = sfinal - sstart + 1; + + start = ((drl[dins].lcn < LCN_RL_NOT_MAPPED) || /* End of file */ + (drl[dins].vcn == srl[sstart].vcn)); /* Start of hole */ + finish = ((drl[dins].lcn >= LCN_RL_NOT_MAPPED) && /* End of file */ + ((drl[dins].vcn + drl[dins].length) <= /* End of hole */ + (srl[send - 1].vcn + srl[send - 1].length))); + + /* Or we'll lose an end marker */ + if (finish && !drl[dins].length) + ss++; + if (marker && (drl[dins].vcn + drl[dins].length > srl[send - 1].vcn)) + finish = FALSE; + + ntfs_log_debug("dfinal = %i, dend = %i\n", dfinal, dend); + ntfs_log_debug("sstart = %i, sfinal = %i, send = %i\n", sstart, sfinal, send); + ntfs_log_debug("start = %i, finish = %i\n", start, finish); + ntfs_log_debug("ds = %i, ss = %i, dins = %i\n", ds, ss, dins); + + if (start) { + if (finish) + drl = ntfs_rl_replace(drl, ds, srl + sstart, ss, dins); + else + drl = ntfs_rl_insert(drl, ds, srl + sstart, ss, dins); + } else { + if (finish) + drl = ntfs_rl_append(drl, ds, srl + sstart, ss, dins); + else + drl = ntfs_rl_split(drl, ds, srl + sstart, ss, dins); + } + if (!drl) { + ntfs_log_perror("Merge failed"); + return drl; + } + free(srl); + if (marker) { + ntfs_log_debug("Triggering marker code.\n"); + for (ds = dend; drl[ds].length; ds++) + ; + /* We only need to care if @srl ended after @drl. */ + if (drl[ds].vcn <= marker_vcn) { + int slots = 0; + + if (drl[ds].vcn == marker_vcn) { + ntfs_log_debug("Old marker = %lli, replacing with " + "LCN_ENOENT.\n", + (long long)drl[ds].lcn); + drl[ds].lcn = (LCN)LCN_ENOENT; + goto finished; + } + /* + * We need to create an unmapped runlist element in + * @drl or extend an existing one before adding the + * ENOENT terminator. + */ + if (drl[ds].lcn == (LCN)LCN_ENOENT) { + ds--; + slots = 1; + } + if (drl[ds].lcn != (LCN)LCN_RL_NOT_MAPPED) { + /* Add an unmapped runlist element. */ + if (!slots) { + /* FIXME/TODO: We need to have the + * extra memory already! (AIA) + */ + drl = ntfs_rl_realloc(drl, ds, ds + 2); + if (!drl) + goto critical_error; + slots = 2; + } + ds++; + /* Need to set vcn if it isn't set already. */ + if (slots != 1) + drl[ds].vcn = drl[ds - 1].vcn + + drl[ds - 1].length; + drl[ds].lcn = (LCN)LCN_RL_NOT_MAPPED; + /* We now used up a slot. */ + slots--; + } + drl[ds].length = marker_vcn - drl[ds].vcn; + /* Finally add the ENOENT terminator. */ + ds++; + if (!slots) { + /* FIXME/TODO: We need to have the extra + * memory already! (AIA) + */ + drl = ntfs_rl_realloc(drl, ds, ds + 1); + if (!drl) + goto critical_error; + } + drl[ds].vcn = marker_vcn; + drl[ds].lcn = (LCN)LCN_ENOENT; + drl[ds].length = (s64)0; + } + } + } + +finished: + /* The merge was completed successfully. */ + ntfs_log_debug("Merged runlist:\n"); + ntfs_debug_runlist_dump(drl); + return drl; + +critical_error: + /* Critical error! We cannot afford to fail here. */ + ntfs_log_perror("libntfs: Critical error"); + ntfs_log_debug("Forcing segmentation fault!\n"); + marker_vcn = ((runlist*)NULL)->lcn; + return drl; +} + +/** + * ntfs_runlists_merge - merge two runlists into one + * @drl: original runlist to be worked on + * @srl: new runlist to be merged into @drl + * + * First we sanity check the two runlists @srl and @drl to make sure that they + * are sensible and can be merged. The runlist @srl must be either after the + * runlist @drl or completely within a hole (or unmapped region) in @drl. + * + * Merging of runlists is necessary in two cases: + * 1. When attribute lists are used and a further extent is being mapped. + * 2. When new clusters are allocated to fill a hole or extend a file. + * + * There are four possible ways @srl can be merged. It can: + * - be inserted at the beginning of a hole, + * - split the hole in two and be inserted between the two fragments, + * - be appended at the end of a hole, or it can + * - replace the whole hole. + * It can also be appended to the end of the runlist, which is just a variant + * of the insert case. + * + * On success, return a pointer to the new, combined, runlist. Note, both + * runlists @drl and @srl are deallocated before returning so you cannot use + * the pointers for anything any more. (Strictly speaking the returned runlist + * may be the same as @dst but this is irrelevant.) + * + * On error, return NULL, with errno set to the error code. Both runlists are + * left unmodified. The following error codes are defined: + * ENOMEM Not enough memory to allocate runlist array. + * EINVAL Invalid parameters were passed in. + * ERANGE The runlists overlap and cannot be merged. + */ +runlist_element *ntfs_runlists_merge(runlist_element *drl, + runlist_element *srl) +{ + runlist_element *rl; + + ntfs_log_enter("Entering\n"); + rl = ntfs_runlists_merge_i(drl, srl); + ntfs_log_leave("\n"); + return rl; +} + +/** + * ntfs_mapping_pairs_decompress - convert mapping pairs array to runlist + * @vol: ntfs volume on which the attribute resides + * @attr: attribute record whose mapping pairs array to decompress + * @old_rl: optional runlist in which to insert @attr's runlist + * + * Decompress the attribute @attr's mapping pairs array into a runlist. On + * success, return the decompressed runlist. + * + * If @old_rl is not NULL, decompressed runlist is inserted into the + * appropriate place in @old_rl and the resultant, combined runlist is + * returned. The original @old_rl is deallocated. + * + * On error, return NULL with errno set to the error code. @old_rl is left + * unmodified in that case. + * + * The following error codes are defined: + * ENOMEM Not enough memory to allocate runlist array. + * EIO Corrupt runlist. + * EINVAL Invalid parameters were passed in. + * ERANGE The two runlists overlap. + * + * FIXME: For now we take the conceptionally simplest approach of creating the + * new runlist disregarding the already existing one and then splicing the + * two into one, if that is possible (we check for overlap and discard the new + * runlist if overlap present before returning NULL, with errno = ERANGE). + */ +static runlist_element *ntfs_mapping_pairs_decompress_i(const ntfs_volume *vol, + const ATTR_RECORD *attr, runlist_element *old_rl) +{ + VCN vcn; /* Current vcn. */ + LCN lcn; /* Current lcn. */ + s64 deltaxcn; /* Change in [vl]cn. */ + runlist_element *rl; /* The output runlist. */ + const u8 *buf; /* Current position in mapping pairs array. */ + const u8 *attr_end; /* End of attribute. */ + int err, rlsize; /* Size of runlist buffer. */ + u16 rlpos; /* Current runlist position in units of + runlist_elements. */ + u8 b; /* Current byte offset in buf. */ + + ntfs_log_trace("Entering for attr 0x%x.\n", + (unsigned)le32_to_cpu(attr->type)); + /* Make sure attr exists and is non-resident. */ + if (!attr || !attr->non_resident || + sle64_to_cpu(attr->lowest_vcn) < (VCN)0) { + errno = EINVAL; + return NULL; + } + /* Start at vcn = lowest_vcn and lcn 0. */ + vcn = sle64_to_cpu(attr->lowest_vcn); + lcn = 0; + /* Get start of the mapping pairs array. */ + buf = (const u8*)attr + le16_to_cpu(attr->mapping_pairs_offset); + attr_end = (const u8*)attr + le32_to_cpu(attr->length); + if (buf < (const u8*)attr || buf > attr_end) { + ntfs_log_debug("Corrupt attribute.\n"); + errno = EIO; + return NULL; + } + /* Current position in runlist array. */ + rlpos = 0; + /* Allocate first 4kiB block and set current runlist size to 4kiB. */ + rlsize = 0x1000; + rl = ntfs_malloc(rlsize); + if (!rl) + return NULL; + /* Insert unmapped starting element if necessary. */ + if (vcn) { + rl->vcn = (VCN)0; + rl->lcn = (LCN)LCN_RL_NOT_MAPPED; + rl->length = vcn; + rlpos++; + } + while (buf < attr_end && *buf) { + /* + * Allocate more memory if needed, including space for the + * not-mapped and terminator elements. + */ + if ((int)((rlpos + 3) * sizeof(*old_rl)) > rlsize) { + runlist_element *rl2; + + rlsize += 0x1000; + rl2 = realloc(rl, rlsize); + if (!rl2) { + int eo = errno; + free(rl); + errno = eo; + return NULL; + } + rl = rl2; + } + /* Enter the current vcn into the current runlist element. */ + rl[rlpos].vcn = vcn; + /* + * Get the change in vcn, i.e. the run length in clusters. + * Doing it this way ensures that we signextend negative values. + * A negative run length doesn't make any sense, but hey, I + * didn't make up the NTFS specs and Windows NT4 treats the run + * length as a signed value so that's how it is... + */ + b = *buf & 0xf; + if (b) { + if (buf + b > attr_end) + goto io_error; + for (deltaxcn = (s8)buf[b--]; b; b--) + deltaxcn = (deltaxcn << 8) + buf[b]; + } else { /* The length entry is compulsory. */ + ntfs_log_debug("Missing length entry in mapping pairs " + "array.\n"); + deltaxcn = (s64)-1; + } + /* + * Assume a negative length to indicate data corruption and + * hence clean-up and return NULL. + */ + if (deltaxcn < 0) { + ntfs_log_debug("Invalid length in mapping pairs array.\n"); + goto err_out; + } + /* + * Enter the current run length into the current runlist + * element. + */ + rl[rlpos].length = deltaxcn; + /* Increment the current vcn by the current run length. */ + vcn += deltaxcn; + /* + * There might be no lcn change at all, as is the case for + * sparse clusters on NTFS 3.0+, in which case we set the lcn + * to LCN_HOLE. + */ + if (!(*buf & 0xf0)) + rl[rlpos].lcn = (LCN)LCN_HOLE; + else { + /* Get the lcn change which really can be negative. */ + u8 b2 = *buf & 0xf; + b = b2 + ((*buf >> 4) & 0xf); + if (buf + b > attr_end) + goto io_error; + for (deltaxcn = (s8)buf[b--]; b > b2; b--) + deltaxcn = (deltaxcn << 8) + buf[b]; + /* Change the current lcn to it's new value. */ + lcn += deltaxcn; +#ifdef DEBUG + /* + * On NTFS 1.2-, apparently can have lcn == -1 to + * indicate a hole. But we haven't verified ourselves + * whether it is really the lcn or the deltaxcn that is + * -1. So if either is found give us a message so we + * can investigate it further! + */ + if (vol->major_ver < 3) { + if (deltaxcn == (LCN)-1) + ntfs_log_debug("lcn delta == -1\n"); + if (lcn == (LCN)-1) + ntfs_log_debug("lcn == -1\n"); + } +#endif + /* Check lcn is not below -1. */ + if (lcn < (LCN)-1) { + ntfs_log_debug("Invalid LCN < -1 in mapping pairs " + "array.\n"); + goto err_out; + } + /* Enter the current lcn into the runlist element. */ + rl[rlpos].lcn = lcn; + } + /* Get to the next runlist element. */ + rlpos++; + /* Increment the buffer position to the next mapping pair. */ + buf += (*buf & 0xf) + ((*buf >> 4) & 0xf) + 1; + } + if (buf >= attr_end) + goto io_error; + /* + * If there is a highest_vcn specified, it must be equal to the final + * vcn in the runlist - 1, or something has gone badly wrong. + */ + deltaxcn = sle64_to_cpu(attr->highest_vcn); + if (deltaxcn && vcn - 1 != deltaxcn) { +mpa_err: + ntfs_log_debug("Corrupt mapping pairs array in non-resident " + "attribute.\n"); + goto err_out; + } + /* Setup not mapped runlist element if this is the base extent. */ + if (!attr->lowest_vcn) { + VCN max_cluster; + + max_cluster = ((sle64_to_cpu(attr->allocated_size) + + vol->cluster_size - 1) >> + vol->cluster_size_bits) - 1; + /* + * A highest_vcn of zero means this is a single extent + * attribute so simply terminate the runlist with LCN_ENOENT). + */ + if (deltaxcn) { + /* + * If there is a difference between the highest_vcn and + * the highest cluster, the runlist is either corrupt + * or, more likely, there are more extents following + * this one. + */ + if (deltaxcn < max_cluster) { + ntfs_log_debug("More extents to follow; deltaxcn = " + "0x%llx, max_cluster = 0x%llx\n", + (long long)deltaxcn, + (long long)max_cluster); + rl[rlpos].vcn = vcn; + vcn += rl[rlpos].length = max_cluster - deltaxcn; + rl[rlpos].lcn = (LCN)LCN_RL_NOT_MAPPED; + rlpos++; + } else if (deltaxcn > max_cluster) { + ntfs_log_debug("Corrupt attribute. deltaxcn = " + "0x%llx, max_cluster = 0x%llx\n", + (long long)deltaxcn, + (long long)max_cluster); + goto mpa_err; + } + } + rl[rlpos].lcn = (LCN)LCN_ENOENT; + } else /* Not the base extent. There may be more extents to follow. */ + rl[rlpos].lcn = (LCN)LCN_RL_NOT_MAPPED; + + /* Setup terminating runlist element. */ + rl[rlpos].vcn = vcn; + rl[rlpos].length = (s64)0; + /* If no existing runlist was specified, we are done. */ + if (!old_rl) { + ntfs_log_debug("Mapping pairs array successfully decompressed:\n"); + ntfs_debug_runlist_dump(rl); + return rl; + } + /* Now combine the new and old runlists checking for overlaps. */ + old_rl = ntfs_runlists_merge(old_rl, rl); + if (old_rl) + return old_rl; + err = errno; + free(rl); + ntfs_log_debug("Failed to merge runlists.\n"); + errno = err; + return NULL; +io_error: + ntfs_log_debug("Corrupt attribute.\n"); +err_out: + free(rl); + errno = EIO; + return NULL; +} + +runlist_element *ntfs_mapping_pairs_decompress(const ntfs_volume *vol, + const ATTR_RECORD *attr, runlist_element *old_rl) +{ + runlist_element *rle; + + ntfs_log_enter("Entering\n"); + rle = ntfs_mapping_pairs_decompress_i(vol, attr, old_rl); + ntfs_log_leave("\n"); + return rle; +} + +/** + * ntfs_rl_vcn_to_lcn - convert a vcn into a lcn given a runlist + * @rl: runlist to use for conversion + * @vcn: vcn to convert + * + * Convert the virtual cluster number @vcn of an attribute into a logical + * cluster number (lcn) of a device using the runlist @rl to map vcns to their + * corresponding lcns. + * + * Since lcns must be >= 0, we use negative return values with special meaning: + * + * Return value Meaning / Description + * ================================================== + * -1 = LCN_HOLE Hole / not allocated on disk. + * -2 = LCN_RL_NOT_MAPPED This is part of the runlist which has not been + * inserted into the runlist yet. + * -3 = LCN_ENOENT There is no such vcn in the attribute. + * -4 = LCN_EINVAL Input parameter error. + */ +LCN ntfs_rl_vcn_to_lcn(const runlist_element *rl, const VCN vcn) +{ + int i; + + if (vcn < (VCN)0) + return (LCN)LCN_EINVAL; + /* + * If rl is NULL, assume that we have found an unmapped runlist. The + * caller can then attempt to map it and fail appropriately if + * necessary. + */ + if (!rl) + return (LCN)LCN_RL_NOT_MAPPED; + + /* Catch out of lower bounds vcn. */ + if (vcn < rl[0].vcn) + return (LCN)LCN_ENOENT; + + for (i = 0; rl[i].length; i++) { + if (vcn < rl[i+1].vcn) { + if (rl[i].lcn >= (LCN)0) + return rl[i].lcn + (vcn - rl[i].vcn); + return rl[i].lcn; + } + } + /* + * The terminator element is setup to the correct value, i.e. one of + * LCN_HOLE, LCN_RL_NOT_MAPPED, or LCN_ENOENT. + */ + if (rl[i].lcn < (LCN)0) + return rl[i].lcn; + /* Just in case... We could replace this with BUG() some day. */ + return (LCN)LCN_ENOENT; +} + +/** + * ntfs_rl_pread - gather read from disk + * @vol: ntfs volume to read from + * @rl: runlist specifying where to read the data from + * @pos: byte position within runlist @rl at which to begin the read + * @count: number of bytes to read + * @b: data buffer into which to read from disk + * + * This function will read @count bytes from the volume @vol to the data buffer + * @b gathering the data as specified by the runlist @rl. The read begins at + * offset @pos into the runlist @rl. + * + * On success, return the number of successfully read bytes. If this number is + * lower than @count this means that the read reached end of file or that an + * error was encountered during the read so that the read is partial. 0 means + * nothing was read (also return 0 when @count is 0). + * + * On error and nothing has been read, return -1 with errno set appropriately + * to the return code of ntfs_pread(), or to EINVAL in case of invalid + * arguments. + * + * NOTE: If we encounter EOF while reading we return EIO because we assume that + * the run list must point to valid locations within the ntfs volume. + */ +s64 ntfs_rl_pread(const ntfs_volume *vol, const runlist_element *rl, + const s64 pos, s64 count, void *b) +{ + s64 bytes_read, to_read, ofs, total; + int err = EIO; + + if (!vol || !rl || pos < 0 || count < 0) { + errno = EINVAL; + ntfs_log_perror("Failed to read runlist [vol: %p rl: %p " + "pos: %lld count: %lld]", vol, rl, + (long long)pos, (long long)count); + return -1; + } + if (!count) + return count; + /* Seek in @rl to the run containing @pos. */ + for (ofs = 0; rl->length && (ofs + (rl->length << + vol->cluster_size_bits) <= pos); rl++) + ofs += (rl->length << vol->cluster_size_bits); + /* Offset in the run at which to begin reading. */ + ofs = pos - ofs; + for (total = 0LL; count; rl++, ofs = 0) { + if (!rl->length) + goto rl_err_out; + if (rl->lcn < (LCN)0) { + if (rl->lcn != (LCN)LCN_HOLE) + goto rl_err_out; + /* It is a hole. Just fill buffer @b with zeroes. */ + to_read = min(count, (rl->length << + vol->cluster_size_bits) - ofs); + memset(b, 0, to_read); + /* Update counters and proceed with next run. */ + total += to_read; + count -= to_read; + b = (u8*)b + to_read; + continue; + } + /* It is a real lcn, read it from the volume. */ + to_read = min(count, (rl->length << vol->cluster_size_bits) - + ofs); +retry: + bytes_read = ntfs_pread(vol->dev, (rl->lcn << + vol->cluster_size_bits) + ofs, to_read, b); + /* If everything ok, update progress counters and continue. */ + if (bytes_read > 0) { + total += bytes_read; + count -= bytes_read; + b = (u8*)b + bytes_read; + continue; + } + /* If the syscall was interrupted, try again. */ + if (bytes_read == (s64)-1 && errno == EINTR) + goto retry; + if (bytes_read == (s64)-1) + err = errno; + goto rl_err_out; + } + /* Finally, return the number of bytes read. */ + return total; +rl_err_out: + if (total) + return total; + errno = err; + return -1; +} + +/** + * ntfs_rl_pwrite - scatter write to disk + * @vol: ntfs volume to write to + * @rl: runlist entry specifying where to write the data to + * @ofs: offset in file for runlist element indicated in @rl + * @pos: byte position from runlist beginning at which to begin the write + * @count: number of bytes to write + * @b: data buffer to write to disk + * + * This function will write @count bytes from data buffer @b to the volume @vol + * scattering the data as specified by the runlist @rl. The write begins at + * offset @pos into the runlist @rl. If a run is sparse then the related buffer + * data is ignored which means that the caller must ensure they are consistent. + * + * On success, return the number of successfully written bytes. If this number + * is lower than @count this means that the write has been interrupted in + * flight or that an error was encountered during the write so that the write + * is partial. 0 means nothing was written (also return 0 when @count is 0). + * + * On error and nothing has been written, return -1 with errno set + * appropriately to the return code of ntfs_pwrite(), or to to EINVAL in case + * of invalid arguments. + */ +s64 ntfs_rl_pwrite(const ntfs_volume *vol, const runlist_element *rl, + s64 ofs, const s64 pos, s64 count, void *b) +{ + s64 written, to_write, total = 0; + int err = EIO; + + if (!vol || !rl || pos < 0 || count < 0) { + errno = EINVAL; + ntfs_log_perror("Failed to write runlist [vol: %p rl: %p " + "pos: %lld count: %lld]", vol, rl, + (long long)pos, (long long)count); + goto errno_set; + } + if (!count) + goto out; + /* Seek in @rl to the run containing @pos. */ + while (rl->length && (ofs + (rl->length << + vol->cluster_size_bits) <= pos)) { + ofs += (rl->length << vol->cluster_size_bits); + rl++; + } + /* Offset in the run at which to begin writing. */ + ofs = pos - ofs; + for (total = 0LL; count; rl++, ofs = 0) { + if (!rl->length) + goto rl_err_out; + if (rl->lcn < (LCN)0) { + + if (rl->lcn != (LCN)LCN_HOLE) + goto rl_err_out; + + to_write = min(count, (rl->length << + vol->cluster_size_bits) - ofs); + + total += to_write; + count -= to_write; + b = (u8*)b + to_write; + continue; + } + /* It is a real lcn, write it to the volume. */ + to_write = min(count, (rl->length << vol->cluster_size_bits) - + ofs); +retry: + if (!NVolReadOnly(vol)) + written = ntfs_pwrite(vol->dev, (rl->lcn << + vol->cluster_size_bits) + ofs, + to_write, b); + else + written = to_write; + /* If everything ok, update progress counters and continue. */ + if (written > 0) { + total += written; + count -= written; + b = (u8*)b + written; + continue; + } + /* If the syscall was interrupted, try again. */ + if (written == (s64)-1 && errno == EINTR) + goto retry; + if (written == (s64)-1) + err = errno; + goto rl_err_out; + } +out: + return total; +rl_err_out: + if (total) + goto out; + errno = err; +errno_set: + total = -1; + goto out; +} + +/** + * ntfs_get_nr_significant_bytes - get number of bytes needed to store a number + * @n: number for which to get the number of bytes for + * + * Return the number of bytes required to store @n unambiguously as + * a signed number. + * + * This is used in the context of the mapping pairs array to determine how + * many bytes will be needed in the array to store a given logical cluster + * number (lcn) or a specific run length. + * + * Return the number of bytes written. This function cannot fail. + */ +int ntfs_get_nr_significant_bytes(const s64 n) +{ + u64 l; + int i; + + l = (n < 0 ? ~n : n); + i = 1; + if (l >= 128) { + l >>= 7; + do { + i++; + l >>= 8; + } while (l); + } + return i; +} + +/** + * ntfs_get_size_for_mapping_pairs - get bytes needed for mapping pairs array + * @vol: ntfs volume (needed for the ntfs version) + * @rl: runlist for which to determine the size of the mapping pairs + * @start_vcn: vcn at which to start the mapping pairs array + * + * Walk the runlist @rl and calculate the size in bytes of the mapping pairs + * array corresponding to the runlist @rl, starting at vcn @start_vcn. This + * for example allows us to allocate a buffer of the right size when building + * the mapping pairs array. + * + * If @rl is NULL, just return 1 (for the single terminator byte). + * + * Return the calculated size in bytes on success. On error, return -1 with + * errno set to the error code. The following error codes are defined: + * EINVAL - Run list contains unmapped elements. Make sure to only pass + * fully mapped runlists to this function. + * - @start_vcn is invalid. + * EIO - The runlist is corrupt. + */ +int ntfs_get_size_for_mapping_pairs(const ntfs_volume *vol, + const runlist_element *rl, const VCN start_vcn, int max_size) +{ + LCN prev_lcn; + int rls; + + if (start_vcn < 0) { + ntfs_log_trace("start_vcn %lld (should be >= 0)\n", + (long long) start_vcn); + errno = EINVAL; + goto errno_set; + } + if (!rl) { + if (start_vcn) { + ntfs_log_trace("rl NULL, start_vcn %lld (should be > 0)\n", + (long long) start_vcn); + errno = EINVAL; + goto errno_set; + } + rls = 1; + goto out; + } + /* Skip to runlist element containing @start_vcn. */ + while (rl->length && start_vcn >= rl[1].vcn) + rl++; + if ((!rl->length && start_vcn > rl->vcn) || start_vcn < rl->vcn) { + errno = EINVAL; + goto errno_set; + } + prev_lcn = 0; + /* Always need the terminating zero byte. */ + rls = 1; + /* Do the first partial run if present. */ + if (start_vcn > rl->vcn) { + s64 delta; + + /* We know rl->length != 0 already. */ + if (rl->length < 0 || rl->lcn < LCN_HOLE) + goto err_out; + delta = start_vcn - rl->vcn; + /* Header byte + length. */ + rls += 1 + ntfs_get_nr_significant_bytes(rl->length - delta); + /* + * If the logical cluster number (lcn) denotes a hole and we + * are on NTFS 3.0+, we don't store it at all, i.e. we need + * zero space. On earlier NTFS versions we just store the lcn. + * Note: this assumes that on NTFS 1.2-, holes are stored with + * an lcn of -1 and not a delta_lcn of -1 (unless both are -1). + */ + if (rl->lcn >= 0 || vol->major_ver < 3) { + prev_lcn = rl->lcn; + if (rl->lcn >= 0) + prev_lcn += delta; + /* Change in lcn. */ + rls += ntfs_get_nr_significant_bytes(prev_lcn); + } + /* Go to next runlist element. */ + rl++; + } + /* Do the full runs. */ + for (; rl->length && (rls <= max_size); rl++) { + if (rl->length < 0 || rl->lcn < LCN_HOLE) + goto err_out; + /* Header byte + length. */ + rls += 1 + ntfs_get_nr_significant_bytes(rl->length); + /* + * If the logical cluster number (lcn) denotes a hole and we + * are on NTFS 3.0+, we don't store it at all, i.e. we need + * zero space. On earlier NTFS versions we just store the lcn. + * Note: this assumes that on NTFS 1.2-, holes are stored with + * an lcn of -1 and not a delta_lcn of -1 (unless both are -1). + */ + if (rl->lcn >= 0 || vol->major_ver < 3) { + /* Change in lcn. */ + rls += ntfs_get_nr_significant_bytes(rl->lcn - + prev_lcn); + prev_lcn = rl->lcn; + } + } +out: + return rls; +err_out: + if (rl->lcn == LCN_RL_NOT_MAPPED) + errno = EINVAL; + else + errno = EIO; +errno_set: + rls = -1; + goto out; +} + +/** + * ntfs_write_significant_bytes - write the significant bytes of a number + * @dst: destination buffer to write to + * @dst_max: pointer to last byte of destination buffer for bounds checking + * @n: number whose significant bytes to write + * + * Store in @dst, the minimum bytes of the number @n which are required to + * identify @n unambiguously as a signed number, taking care not to exceed + * @dest_max, the maximum position within @dst to which we are allowed to + * write. + * + * This is used when building the mapping pairs array of a runlist to compress + * a given logical cluster number (lcn) or a specific run length to the minimum + * size possible. + * + * Return the number of bytes written on success. On error, i.e. the + * destination buffer @dst is too small, return -1 with errno set ENOSPC. + */ +int ntfs_write_significant_bytes(u8 *dst, const u8 *dst_max, const s64 n) +{ + s64 l = n; + int i; + + i = 0; + if (dst > dst_max) + goto err_out; + *dst++ = l; + i++; + while ((l > 0x7f) || (l < -0x80)) { + if (dst > dst_max) + goto err_out; + l >>= 8; + *dst++ = l; + i++; + } + return i; +err_out: + errno = ENOSPC; + return -1; +} + +/** + * ntfs_mapping_pairs_build - build the mapping pairs array from a runlist + * @vol: ntfs volume (needed for the ntfs version) + * @dst: destination buffer to which to write the mapping pairs array + * @dst_len: size of destination buffer @dst in bytes + * @rl: runlist for which to build the mapping pairs array + * @start_vcn: vcn at which to start the mapping pairs array + * @stop_vcn: first vcn outside destination buffer on success or ENOSPC error + * + * Create the mapping pairs array from the runlist @rl, starting at vcn + * @start_vcn and save the array in @dst. @dst_len is the size of @dst in + * bytes and it should be at least equal to the value obtained by calling + * ntfs_get_size_for_mapping_pairs(). + * + * If @rl is NULL, just write a single terminator byte to @dst. + * + * On success or ENOSPC error, if @stop_vcn is not NULL, *@stop_vcn is set to + * the first vcn outside the destination buffer. Note that on error @dst has + * been filled with all the mapping pairs that will fit, thus it can be treated + * as partial success, in that a new attribute extent needs to be created or the + * next extent has to be used and the mapping pairs build has to be continued + * with @start_vcn set to *@stop_vcn. + * + * Return 0 on success. On error, return -1 with errno set to the error code. + * The following error codes are defined: + * EINVAL - Run list contains unmapped elements. Make sure to only pass + * fully mapped runlists to this function. + * - @start_vcn is invalid. + * EIO - The runlist is corrupt. + * ENOSPC - The destination buffer is too small. + */ +int ntfs_mapping_pairs_build(const ntfs_volume *vol, u8 *dst, + const int dst_len, const runlist_element *rl, + const VCN start_vcn, runlist_element const **stop_rl) +{ + LCN prev_lcn; + u8 *dst_max, *dst_next; + s8 len_len, lcn_len; + int ret = 0; + + if (start_vcn < 0) + goto val_err; + if (!rl) { + if (start_vcn) + goto val_err; + if (stop_rl) + *stop_rl = rl; + if (dst_len < 1) + goto nospc_err; + goto ok; + } + /* Skip to runlist element containing @start_vcn. */ + while (rl->length && start_vcn >= rl[1].vcn) + rl++; + if ((!rl->length && start_vcn > rl->vcn) || start_vcn < rl->vcn) + goto val_err; + /* + * @dst_max is used for bounds checking in + * ntfs_write_significant_bytes(). + */ + dst_max = dst + dst_len - 1; + prev_lcn = 0; + /* Do the first partial run if present. */ + if (start_vcn > rl->vcn) { + s64 delta; + + /* We know rl->length != 0 already. */ + if (rl->length < 0 || rl->lcn < LCN_HOLE) + goto err_out; + delta = start_vcn - rl->vcn; + /* Write length. */ + len_len = ntfs_write_significant_bytes(dst + 1, dst_max, + rl->length - delta); + if (len_len < 0) + goto size_err; + /* + * If the logical cluster number (lcn) denotes a hole and we + * are on NTFS 3.0+, we don't store it at all, i.e. we need + * zero space. On earlier NTFS versions we just write the lcn + * change. FIXME: Do we need to write the lcn change or just + * the lcn in that case? Not sure as I have never seen this + * case on NT4. - We assume that we just need to write the lcn + * change until someone tells us otherwise... (AIA) + */ + if (rl->lcn >= 0 || vol->major_ver < 3) { + prev_lcn = rl->lcn; + if (rl->lcn >= 0) + prev_lcn += delta; + /* Write change in lcn. */ + lcn_len = ntfs_write_significant_bytes(dst + 1 + + len_len, dst_max, prev_lcn); + if (lcn_len < 0) + goto size_err; + } else + lcn_len = 0; + dst_next = dst + len_len + lcn_len + 1; + if (dst_next > dst_max) + goto size_err; + /* Update header byte. */ + *dst = lcn_len << 4 | len_len; + /* Position at next mapping pairs array element. */ + dst = dst_next; + /* Go to next runlist element. */ + rl++; + } + /* Do the full runs. */ + for (; rl->length; rl++) { + if (rl->length < 0 || rl->lcn < LCN_HOLE) + goto err_out; + /* Write length. */ + len_len = ntfs_write_significant_bytes(dst + 1, dst_max, + rl->length); + if (len_len < 0) + goto size_err; + /* + * If the logical cluster number (lcn) denotes a hole and we + * are on NTFS 3.0+, we don't store it at all, i.e. we need + * zero space. On earlier NTFS versions we just write the lcn + * change. FIXME: Do we need to write the lcn change or just + * the lcn in that case? Not sure as I have never seen this + * case on NT4. - We assume that we just need to write the lcn + * change until someone tells us otherwise... (AIA) + */ + if (rl->lcn >= 0 || vol->major_ver < 3) { + /* Write change in lcn. */ + lcn_len = ntfs_write_significant_bytes(dst + 1 + + len_len, dst_max, rl->lcn - prev_lcn); + if (lcn_len < 0) + goto size_err; + prev_lcn = rl->lcn; + } else + lcn_len = 0; + dst_next = dst + len_len + lcn_len + 1; + if (dst_next > dst_max) + goto size_err; + /* Update header byte. */ + *dst = lcn_len << 4 | len_len; + /* Position at next mapping pairs array element. */ + dst += 1 + len_len + lcn_len; + } + /* Set stop vcn. */ + if (stop_rl) + *stop_rl = rl; +ok: + /* Add terminator byte. */ + *dst = 0; +out: + return ret; +size_err: + /* Set stop vcn. */ + if (stop_rl) + *stop_rl = rl; + /* Add terminator byte. */ + *dst = 0; +nospc_err: + errno = ENOSPC; + goto errno_set; +val_err: + errno = EINVAL; + goto errno_set; +err_out: + if (rl->lcn == LCN_RL_NOT_MAPPED) + errno = EINVAL; + else + errno = EIO; +errno_set: + ret = -1; + goto out; +} + +/** + * ntfs_rl_truncate - truncate a runlist starting at a specified vcn + * @arl: address of runlist to truncate + * @start_vcn: first vcn which should be cut off + * + * Truncate the runlist *@arl starting at vcn @start_vcn as well as the memory + * buffer holding the runlist. + * + * Return 0 on success and -1 on error with errno set to the error code. + * + * NOTE: @arl is the address of the runlist. We need the address so we can + * modify the pointer to the runlist with the new, reallocated memory buffer. + */ +int ntfs_rl_truncate(runlist **arl, const VCN start_vcn) +{ + runlist *rl; + BOOL is_end = FALSE; + + if (!arl || !*arl) { + errno = EINVAL; + if (!arl) + ntfs_log_perror("rl_truncate error: arl: %p", arl); + else + ntfs_log_perror("rl_truncate error:" + " arl: %p *arl: %p", arl, *arl); + return -1; + } + + rl = *arl; + + if (start_vcn < rl->vcn) { + errno = EINVAL; + ntfs_log_perror("Start_vcn lies outside front of runlist"); + return -1; + } + + /* Find the starting vcn in the run list. */ + while (rl->length) { + if (start_vcn < rl[1].vcn) + break; + rl++; + } + + if (!rl->length) { + errno = EIO; + ntfs_log_trace("Truncating already truncated runlist?\n"); + return -1; + } + + /* Truncate the run. */ + rl->length = start_vcn - rl->vcn; + + /* + * If a run was partially truncated, make the following runlist + * element a terminator instead of the truncated runlist + * element itself. + */ + if (rl->length) { + ++rl; + if (!rl->length) + is_end = TRUE; + rl->vcn = start_vcn; + rl->length = 0; + } + rl->lcn = (LCN)LCN_ENOENT; + /** + * Reallocate memory if necessary. + * FIXME: Below code is broken, because runlist allocations must be + * a multiply of 4096. The code caused crashes and corruptions. + */ +/* + if (!is_end) { + size_t new_size = (rl - *arl + 1) * sizeof(runlist_element); + rl = realloc(*arl, new_size); + if (rl) + *arl = rl; + } +*/ + return 0; +} + +/** + * ntfs_rl_sparse - check whether runlist have sparse regions or not. + * @rl: runlist to check + * + * Return 1 if have, 0 if not, -1 on error with errno set to the error code. + */ +int ntfs_rl_sparse(runlist *rl) +{ + runlist *rlc; + + if (!rl) { + errno = EINVAL; + ntfs_log_perror("%s: ", __FUNCTION__); + return -1; + } + + for (rlc = rl; rlc->length; rlc++) + if (rlc->lcn < 0) { + if (rlc->lcn != LCN_HOLE) { + errno = EINVAL; + ntfs_log_perror("%s: bad runlist", __FUNCTION__); + return -1; + } + return 1; + } + return 0; +} + +/** + * ntfs_rl_get_compressed_size - calculate length of non sparse regions + * @vol: ntfs volume (need for cluster size) + * @rl: runlist to calculate for + * + * Return compressed size or -1 on error with errno set to the error code. + */ +s64 ntfs_rl_get_compressed_size(ntfs_volume *vol, runlist *rl) +{ + runlist *rlc; + s64 ret = 0; + + if (!rl) { + errno = EINVAL; + ntfs_log_perror("%s: ", __FUNCTION__); + return -1; + } + + for (rlc = rl; rlc->length; rlc++) { + if (rlc->lcn < 0) { + if (rlc->lcn != LCN_HOLE) { + errno = EINVAL; + ntfs_log_perror("%s: bad runlist", __FUNCTION__); + return -1; + } + } else + ret += rlc->length; + } + return ret << vol->cluster_size_bits; +} + + +#ifdef NTFS_TEST +/** + * test_rl_helper + */ +#define MKRL(R,V,L,S) \ + (R)->vcn = V; \ + (R)->lcn = L; \ + (R)->length = S; +/* +} +*/ +/** + * test_rl_dump_runlist - Runlist test: Display the contents of a runlist + * @rl: + * + * Description... + * + * Returns: + */ +static void test_rl_dump_runlist(const runlist_element *rl) +{ + int abbr = 0; /* abbreviate long lists */ + int len = 0; + int i; + const char *lcn_str[5] = { "HOLE", "NOTMAP", "ENOENT", "XXXX" }; + + if (!rl) { + printf(" Run list not present.\n"); + return; + } + + if (abbr) + for (len = 0; rl[len].length; len++) ; + + printf(" VCN LCN len\n"); + for (i = 0; ; i++, rl++) { + LCN lcn = rl->lcn; + + if ((abbr) && (len > 20)) { + if (i == 4) + printf(" ...\n"); + if ((i > 3) && (i < (len - 3))) + continue; + } + + if (lcn < (LCN)0) { + int ind = -lcn - 1; + + if (ind > -LCN_ENOENT - 1) + ind = 3; + printf("%8lld %8s %8lld\n", + rl->vcn, lcn_str[ind], rl->length); + } else + printf("%8lld %8lld %8lld\n", + rl->vcn, rl->lcn, rl->length); + if (!rl->length) + break; + } + if ((abbr) && (len > 20)) + printf(" (%d entries)\n", len+1); + printf("\n"); +} + +/** + * test_rl_runlists_merge - Runlist test: Merge two runlists + * @drl: + * @srl: + * + * Description... + * + * Returns: + */ +static runlist_element * test_rl_runlists_merge(runlist_element *drl, runlist_element *srl) +{ + runlist_element *res = NULL; + + printf("dst:\n"); + test_rl_dump_runlist(drl); + printf("src:\n"); + test_rl_dump_runlist(srl); + + res = ntfs_runlists_merge(drl, srl); + + printf("res:\n"); + test_rl_dump_runlist(res); + + return res; +} + +/** + * test_rl_read_buffer - Runlist test: Read a file containing a runlist + * @file: + * @buf: + * @bufsize: + * + * Description... + * + * Returns: + */ +static int test_rl_read_buffer(const char *file, u8 *buf, int bufsize) +{ + FILE *fptr; + + fptr = fopen(file, "r"); + if (!fptr) { + printf("open %s\n", file); + return 0; + } + + if (fread(buf, bufsize, 1, fptr) == 99) { + printf("read %s\n", file); + return 0; + } + + fclose(fptr); + return 1; +} + +/** + * test_rl_pure_src - Runlist test: Complicate the simple tests a little + * @contig: + * @multi: + * @vcn: + * @len: + * + * Description... + * + * Returns: + */ +static runlist_element * test_rl_pure_src(BOOL contig, BOOL multi, int vcn, int len) +{ + runlist_element *result; + int fudge; + + if (contig) + fudge = 0; + else + fudge = 999; + + result = ntfs_malloc(4096); + if (!result) + return NULL; + + if (multi) { + MKRL(result+0, vcn + (0*len/4), fudge + vcn + 1000 + (0*len/4), len / 4) + MKRL(result+1, vcn + (1*len/4), fudge + vcn + 1000 + (1*len/4), len / 4) + MKRL(result+2, vcn + (2*len/4), fudge + vcn + 1000 + (2*len/4), len / 4) + MKRL(result+3, vcn + (3*len/4), fudge + vcn + 1000 + (3*len/4), len / 4) + MKRL(result+4, vcn + (4*len/4), LCN_RL_NOT_MAPPED, 0) + } else { + MKRL(result+0, vcn, fudge + vcn + 1000, len) + MKRL(result+1, vcn + len, LCN_RL_NOT_MAPPED, 0) + } + return result; +} + +/** + * test_rl_pure_test - Runlist test: Perform tests using simple runlists + * @test: + * @contig: + * @multi: + * @vcn: + * @len: + * @file: + * @size: + * + * Description... + * + * Returns: + */ +static void test_rl_pure_test(int test, BOOL contig, BOOL multi, int vcn, int len, runlist_element *file, int size) +{ + runlist_element *src; + runlist_element *dst; + runlist_element *res; + + src = test_rl_pure_src(contig, multi, vcn, len); + dst = ntfs_malloc(4096); + if (!src || !dst) { + printf("Test %2d ---------- FAILED! (no free memory?)\n", test); + return; + } + + memcpy(dst, file, size); + + printf("Test %2d ----------\n", test); + res = test_rl_runlists_merge(dst, src); + + free(res); +} + +/** + * test_rl_pure - Runlist test: Create tests using simple runlists + * @contig: + * @multi: + * + * Description... + * + * Returns: + */ +static void test_rl_pure(char *contig, char *multi) +{ + /* VCN, LCN, len */ + static runlist_element file1[] = { + { 0, -1, 100 }, /* HOLE */ + { 100, 1100, 100 }, /* DATA */ + { 200, -1, 100 }, /* HOLE */ + { 300, 1300, 100 }, /* DATA */ + { 400, -1, 100 }, /* HOLE */ + { 500, -3, 0 } /* NOENT */ + }; + static runlist_element file2[] = { + { 0, 1000, 100 }, /* DATA */ + { 100, -1, 100 }, /* HOLE */ + { 200, -3, 0 } /* NOENT */ + }; + static runlist_element file3[] = { + { 0, 1000, 100 }, /* DATA */ + { 100, -3, 0 } /* NOENT */ + }; + static runlist_element file4[] = { + { 0, -3, 0 } /* NOENT */ + }; + static runlist_element file5[] = { + { 0, -2, 100 }, /* NOTMAP */ + { 100, 1100, 100 }, /* DATA */ + { 200, -2, 100 }, /* NOTMAP */ + { 300, 1300, 100 }, /* DATA */ + { 400, -2, 100 }, /* NOTMAP */ + { 500, -3, 0 } /* NOENT */ + }; + static runlist_element file6[] = { + { 0, 1000, 100 }, /* DATA */ + { 100, -2, 100 }, /* NOTMAP */ + { 200, -3, 0 } /* NOENT */ + }; + BOOL c, m; + + if (strcmp(contig, "contig") == 0) + c = TRUE; + else if (strcmp(contig, "noncontig") == 0) + c = FALSE; + else { + printf("rl pure [contig|noncontig] [single|multi]\n"); + return; + } + if (strcmp(multi, "multi") == 0) + m = TRUE; + else if (strcmp(multi, "single") == 0) + m = FALSE; + else { + printf("rl pure [contig|noncontig] [single|multi]\n"); + return; + } + + test_rl_pure_test(1, c, m, 0, 40, file1, sizeof(file1)); + test_rl_pure_test(2, c, m, 40, 40, file1, sizeof(file1)); + test_rl_pure_test(3, c, m, 60, 40, file1, sizeof(file1)); + test_rl_pure_test(4, c, m, 0, 100, file1, sizeof(file1)); + test_rl_pure_test(5, c, m, 200, 40, file1, sizeof(file1)); + test_rl_pure_test(6, c, m, 240, 40, file1, sizeof(file1)); + test_rl_pure_test(7, c, m, 260, 40, file1, sizeof(file1)); + test_rl_pure_test(8, c, m, 200, 100, file1, sizeof(file1)); + test_rl_pure_test(9, c, m, 400, 40, file1, sizeof(file1)); + test_rl_pure_test(10, c, m, 440, 40, file1, sizeof(file1)); + test_rl_pure_test(11, c, m, 460, 40, file1, sizeof(file1)); + test_rl_pure_test(12, c, m, 400, 100, file1, sizeof(file1)); + test_rl_pure_test(13, c, m, 160, 100, file2, sizeof(file2)); + test_rl_pure_test(14, c, m, 100, 140, file2, sizeof(file2)); + test_rl_pure_test(15, c, m, 200, 40, file2, sizeof(file2)); + test_rl_pure_test(16, c, m, 240, 40, file2, sizeof(file2)); + test_rl_pure_test(17, c, m, 100, 40, file3, sizeof(file3)); + test_rl_pure_test(18, c, m, 140, 40, file3, sizeof(file3)); + test_rl_pure_test(19, c, m, 0, 40, file4, sizeof(file4)); + test_rl_pure_test(20, c, m, 40, 40, file4, sizeof(file4)); + test_rl_pure_test(21, c, m, 0, 40, file5, sizeof(file5)); + test_rl_pure_test(22, c, m, 40, 40, file5, sizeof(file5)); + test_rl_pure_test(23, c, m, 60, 40, file5, sizeof(file5)); + test_rl_pure_test(24, c, m, 0, 100, file5, sizeof(file5)); + test_rl_pure_test(25, c, m, 200, 40, file5, sizeof(file5)); + test_rl_pure_test(26, c, m, 240, 40, file5, sizeof(file5)); + test_rl_pure_test(27, c, m, 260, 40, file5, sizeof(file5)); + test_rl_pure_test(28, c, m, 200, 100, file5, sizeof(file5)); + test_rl_pure_test(29, c, m, 400, 40, file5, sizeof(file5)); + test_rl_pure_test(30, c, m, 440, 40, file5, sizeof(file5)); + test_rl_pure_test(31, c, m, 460, 40, file5, sizeof(file5)); + test_rl_pure_test(32, c, m, 400, 100, file5, sizeof(file5)); + test_rl_pure_test(33, c, m, 160, 100, file6, sizeof(file6)); + test_rl_pure_test(34, c, m, 100, 140, file6, sizeof(file6)); +} + +/** + * test_rl_zero - Runlist test: Merge a zero-length runlist + * + * Description... + * + * Returns: + */ +static void test_rl_zero(void) +{ + runlist_element *jim = NULL; + runlist_element *bob = NULL; + + bob = calloc(3, sizeof(runlist_element)); + if (!bob) + return; + + MKRL(bob+0, 10, 99, 5) + MKRL(bob+1, 15, LCN_RL_NOT_MAPPED, 0) + + jim = test_rl_runlists_merge(jim, bob); + if (!jim) + return; + + free(jim); +} + +/** + * test_rl_frag_combine - Runlist test: Perform tests using fragmented files + * @vol: + * @attr1: + * @attr2: + * @attr3: + * + * Description... + * + * Returns: + */ +static void test_rl_frag_combine(ntfs_volume *vol, ATTR_RECORD *attr1, ATTR_RECORD *attr2, ATTR_RECORD *attr3) +{ + runlist_element *run1; + runlist_element *run2; + runlist_element *run3; + + run1 = ntfs_mapping_pairs_decompress(vol, attr1, NULL); + if (!run1) + return; + + run2 = ntfs_mapping_pairs_decompress(vol, attr2, NULL); + if (!run2) + return; + + run1 = test_rl_runlists_merge(run1, run2); + + run3 = ntfs_mapping_pairs_decompress(vol, attr3, NULL); + if (!run3) + return; + + run1 = test_rl_runlists_merge(run1, run3); + + free(run1); +} + +/** + * test_rl_frag - Runlist test: Create tests using very fragmented files + * @test: + * + * Description... + * + * Returns: + */ +static void test_rl_frag(char *test) +{ + ntfs_volume vol; + ATTR_RECORD *attr1 = ntfs_malloc(1024); + ATTR_RECORD *attr2 = ntfs_malloc(1024); + ATTR_RECORD *attr3 = ntfs_malloc(1024); + + if (!attr1 || !attr2 || !attr3) + goto out; + + vol.sb = NULL; + vol.sector_size_bits = 9; + vol.cluster_size = 2048; + vol.cluster_size_bits = 11; + vol.major_ver = 3; + + if (!test_rl_read_buffer("runlist-data/attr1.bin", (u8*) attr1, 1024)) + goto out; + if (!test_rl_read_buffer("runlist-data/attr2.bin", (u8*) attr2, 1024)) + goto out; + if (!test_rl_read_buffer("runlist-data/attr3.bin", (u8*) attr3, 1024)) + goto out; + + if (strcmp(test, "123") == 0) test_rl_frag_combine(&vol, attr1, attr2, attr3); + else if (strcmp(test, "132") == 0) test_rl_frag_combine(&vol, attr1, attr3, attr2); + else if (strcmp(test, "213") == 0) test_rl_frag_combine(&vol, attr2, attr1, attr3); + else if (strcmp(test, "231") == 0) test_rl_frag_combine(&vol, attr2, attr3, attr1); + else if (strcmp(test, "312") == 0) test_rl_frag_combine(&vol, attr3, attr1, attr2); + else if (strcmp(test, "321") == 0) test_rl_frag_combine(&vol, attr3, attr2, attr1); + else + printf("Frag: No such test '%s'\n", test); + +out: + free(attr1); + free(attr2); + free(attr3); +} + +/** + * test_rl_main - Runlist test: Program start (main) + * @argc: + * @argv: + * + * Description... + * + * Returns: + */ +int test_rl_main(int argc, char *argv[]) +{ + if ((argc == 2) && (strcmp(argv[1], "zero") == 0)) test_rl_zero(); + else if ((argc == 3) && (strcmp(argv[1], "frag") == 0)) test_rl_frag(argv[2]); + else if ((argc == 4) && (strcmp(argv[1], "pure") == 0)) test_rl_pure(argv[2], argv[3]); + else + printf("rl [zero|frag|pure] {args}\n"); + + return 0; +} + +#endif + diff --git a/portlibs/sources/libntfs/runlist.h b/portlibs/sources/libntfs/runlist.h new file mode 100644 index 00000000..4b73af9f --- /dev/null +++ b/portlibs/sources/libntfs/runlist.h @@ -0,0 +1,90 @@ +/* + * runlist.h - Exports for runlist handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2002 Anton Altaparmakov + * Copyright (c) 2002 Richard Russon + * + * 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 + */ + +#ifndef _NTFS_RUNLIST_H +#define _NTFS_RUNLIST_H + +#include "types.h" + +/* Forward declarations */ +typedef struct _runlist_element runlist_element; +typedef runlist_element runlist; + +#include "attrib.h" +#include "volume.h" + +/** + * struct _runlist_element - in memory vcn to lcn mapping array element. + * @vcn: starting vcn of the current array element + * @lcn: starting lcn of the current array element + * @length: length in clusters of the current array element + * + * The last vcn (in fact the last vcn + 1) is reached when length == 0. + * + * When lcn == -1 this means that the count vcns starting at vcn are not + * physically allocated (i.e. this is a hole / data is sparse). + */ +struct _runlist_element {/* In memory vcn to lcn mapping structure element. */ + VCN vcn; /* vcn = Starting virtual cluster number. */ + LCN lcn; /* lcn = Starting logical cluster number. */ + s64 length; /* Run length in clusters. */ +}; + +extern runlist_element *ntfs_rl_extend(ntfs_attr *na, runlist_element *rl, + int more_entries); + +extern LCN ntfs_rl_vcn_to_lcn(const runlist_element *rl, const VCN vcn); + +extern s64 ntfs_rl_pread(const ntfs_volume *vol, const runlist_element *rl, + const s64 pos, s64 count, void *b); +extern s64 ntfs_rl_pwrite(const ntfs_volume *vol, const runlist_element *rl, + s64 ofs, const s64 pos, s64 count, void *b); + +extern runlist_element *ntfs_runlists_merge(runlist_element *drl, + runlist_element *srl); + +extern runlist_element *ntfs_mapping_pairs_decompress(const ntfs_volume *vol, + const ATTR_RECORD *attr, runlist_element *old_rl); + +extern int ntfs_get_nr_significant_bytes(const s64 n); + +extern int ntfs_get_size_for_mapping_pairs(const ntfs_volume *vol, + const runlist_element *rl, const VCN start_vcn, int max_size); + +extern int ntfs_write_significant_bytes(u8 *dst, const u8 *dst_max, + const s64 n); + +extern int ntfs_mapping_pairs_build(const ntfs_volume *vol, u8 *dst, + const int dst_len, const runlist_element *rl, + const VCN start_vcn, runlist_element const **stop_rl); + +extern int ntfs_rl_truncate(runlist **arl, const VCN start_vcn); + +extern int ntfs_rl_sparse(runlist *rl); +extern s64 ntfs_rl_get_compressed_size(ntfs_volume *vol, runlist *rl); + +#ifdef NTFS_TEST +int test_rl_main(int argc, char *argv[]); +#endif + +#endif /* defined _NTFS_RUNLIST_H */ + diff --git a/portlibs/sources/libntfs/security.c b/portlibs/sources/libntfs/security.c new file mode 100644 index 00000000..c7a87efb --- /dev/null +++ b/portlibs/sources/libntfs/security.c @@ -0,0 +1,5099 @@ +/** + * security.c - Handling security/ACLs in NTFS. Originated from the Linux-NTFS project. + * + * Copyright (c) 2004 Anton Altaparmakov + * Copyright (c) 2005-2006 Szabolcs Szakacsits + * Copyright (c) 2006 Yura Pakhuchiy + * Copyright (c) 2007-2010 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_FCNTL_H +#include <fcntl.h> +#endif +#ifdef HAVE_SETXATTR +#include <sys/xattr.h> +#endif +#ifdef HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif + +#include <unistd.h> +#include <pwd.h> +#include <grp.h> + +#include "param.h" +#include "types.h" +#include "layout.h" +#include "attrib.h" +#include "index.h" +#include "dir.h" +#include "bitmap.h" +#include "security.h" +#include "acls.h" +#include "cache.h" +#include "misc.h" + +/* + * JPA NTFS constants or structs + * should be moved to layout.h + */ + +#define ALIGN_SDS_BLOCK 0x40000 /* Alignment for a $SDS block */ +#define ALIGN_SDS_ENTRY 16 /* Alignment for a $SDS entry */ +#define STUFFSZ 0x4000 /* unitary stuffing size for $SDS */ +#define FIRST_SECURITY_ID 0x100 /* Lowest security id */ + + /* Mask for attributes which can be forced */ +#define FILE_ATTR_SETTABLE ( FILE_ATTR_READONLY \ + | FILE_ATTR_HIDDEN \ + | FILE_ATTR_SYSTEM \ + | FILE_ATTR_ARCHIVE \ + | FILE_ATTR_TEMPORARY \ + | FILE_ATTR_OFFLINE \ + | FILE_ATTR_NOT_CONTENT_INDEXED ) + +struct SII { /* this is an image of an $SII index entry */ + le16 offs; + le16 size; + le32 fill1; + le16 indexsz; + le16 indexksz; + le16 flags; + le16 fill2; + le32 keysecurid; + + /* did not find official description for the following */ + le32 hash; + le32 securid; + le32 dataoffsl; /* documented as badly aligned */ + le32 dataoffsh; + le32 datasize; +} ; + +struct SDH { /* this is an image of an $SDH index entry */ + le16 offs; + le16 size; + le32 fill1; + le16 indexsz; + le16 indexksz; + le16 flags; + le16 fill2; + le32 keyhash; + le32 keysecurid; + + /* did not find official description for the following */ + le32 hash; + le32 securid; + le32 dataoffsl; + le32 dataoffsh; + le32 datasize; + le32 fill3; + } ; + +/* + * A few useful constants + */ + +static ntfschar sii_stream[] = { const_cpu_to_le16('$'), + const_cpu_to_le16('S'), + const_cpu_to_le16('I'), + const_cpu_to_le16('I'), + const_cpu_to_le16(0) }; +static ntfschar sdh_stream[] = { const_cpu_to_le16('$'), + const_cpu_to_le16('S'), + const_cpu_to_le16('D'), + const_cpu_to_le16('H'), + const_cpu_to_le16(0) }; + +/* + * null SID (S-1-0-0) + */ + +extern const SID *nullsid; + +/* + * The zero GUID. + */ + +static const GUID __zero_guid = { const_cpu_to_le32(0), const_cpu_to_le16(0), + const_cpu_to_le16(0), { 0, 0, 0, 0, 0, 0, 0, 0 } }; +static const GUID *const zero_guid = &__zero_guid; + +/** + * ntfs_guid_is_zero - check if a GUID is zero + * @guid: [IN] guid to check + * + * Return TRUE if @guid is a valid pointer to a GUID and it is the zero GUID + * and FALSE otherwise. + */ +BOOL ntfs_guid_is_zero(const GUID *guid) +{ + return (memcmp(guid, zero_guid, sizeof(*zero_guid))); +} + +/** + * ntfs_guid_to_mbs - convert a GUID to a multi byte string + * @guid: [IN] guid to convert + * @guid_str: [OUT] string in which to return the GUID (optional) + * + * Convert the GUID pointed to by @guid to a multi byte string of the form + * "XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX". Therefore, @guid_str (if not NULL) + * needs to be able to store at least 37 bytes. + * + * If @guid_str is not NULL it will contain the converted GUID on return. If + * it is NULL a string will be allocated and this will be returned. The caller + * is responsible for free()ing the string in that case. + * + * On success return the converted string and on failure return NULL with errno + * set to the error code. + */ +char *ntfs_guid_to_mbs(const GUID *guid, char *guid_str) +{ + char *_guid_str; + int res; + + if (!guid) { + errno = EINVAL; + return NULL; + } + _guid_str = guid_str; + if (!_guid_str) { + _guid_str = (char*)ntfs_malloc(37); + if (!_guid_str) + return _guid_str; + } + res = snprintf(_guid_str, 37, + "%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x", + (unsigned int)le32_to_cpu(guid->data1), + le16_to_cpu(guid->data2), le16_to_cpu(guid->data3), + guid->data4[0], guid->data4[1], + guid->data4[2], guid->data4[3], guid->data4[4], + guid->data4[5], guid->data4[6], guid->data4[7]); + if (res == 36) + return _guid_str; + if (!guid_str) + free(_guid_str); + errno = EINVAL; + return NULL; +} + +/** + * ntfs_sid_to_mbs_size - determine maximum size for the string of a SID + * @sid: [IN] SID for which to determine the maximum string size + * + * Determine the maximum multi byte string size in bytes which is needed to + * store the standard textual representation of the SID pointed to by @sid. + * See ntfs_sid_to_mbs(), below. + * + * On success return the maximum number of bytes needed to store the multi byte + * string and on failure return -1 with errno set to the error code. + */ +int ntfs_sid_to_mbs_size(const SID *sid) +{ + int size, i; + + if (!ntfs_sid_is_valid(sid)) { + errno = EINVAL; + return -1; + } + /* Start with "S-". */ + size = 2; + /* + * Add the SID_REVISION. Hopefully the compiler will optimize this + * away as SID_REVISION is a constant. + */ + for (i = SID_REVISION; i > 0; i /= 10) + size++; + /* Add the "-". */ + size++; + /* + * Add the identifier authority. If it needs to be in decimal, the + * maximum is 2^32-1 = 4294967295 = 10 characters. If it needs to be + * in hexadecimal, then maximum is 0x665544332211 = 14 characters. + */ + if (!sid->identifier_authority.high_part) + size += 10; + else + size += 14; + /* + * Finally, add the sub authorities. For each we have a "-" followed + * by a decimal which can be up to 2^32-1 = 4294967295 = 10 characters. + */ + size += (1 + 10) * sid->sub_authority_count; + /* We need the zero byte at the end, too. */ + size++; + return size * sizeof(char); +} + +/** + * ntfs_sid_to_mbs - convert a SID to a multi byte string + * @sid: [IN] SID to convert + * @sid_str: [OUT] string in which to return the SID (optional) + * @sid_str_size: [IN] size in bytes of @sid_str + * + * Convert the SID pointed to by @sid to its standard textual representation. + * @sid_str (if not NULL) needs to be able to store at least + * ntfs_sid_to_mbs_size() bytes. @sid_str_size is the size in bytes of + * @sid_str if @sid_str is not NULL. + * + * The standard textual representation of the SID is of the form: + * S-R-I-S-S... + * Where: + * - The first "S" is the literal character 'S' identifying the following + * digits as a SID. + * - R is the revision level of the SID expressed as a sequence of digits + * in decimal. + * - I is the 48-bit identifier_authority, expressed as digits in decimal, + * if I < 2^32, or hexadecimal prefixed by "0x", if I >= 2^32. + * - S... is one or more sub_authority values, expressed as digits in + * decimal. + * + * If @sid_str is not NULL it will contain the converted SUID on return. If it + * is NULL a string will be allocated and this will be returned. The caller is + * responsible for free()ing the string in that case. + * + * On success return the converted string and on failure return NULL with errno + * set to the error code. + */ +char *ntfs_sid_to_mbs(const SID *sid, char *sid_str, size_t sid_str_size) +{ + u64 u; + le32 leauth; + char *s; + int i, j, cnt; + + /* + * No need to check @sid if !@sid_str since ntfs_sid_to_mbs_size() will + * check @sid, too. 8 is the minimum SID string size. + */ + if (sid_str && (sid_str_size < 8 || !ntfs_sid_is_valid(sid))) { + errno = EINVAL; + return NULL; + } + /* Allocate string if not provided. */ + if (!sid_str) { + cnt = ntfs_sid_to_mbs_size(sid); + if (cnt < 0) + return NULL; + s = (char*)ntfs_malloc(cnt); + if (!s) + return s; + sid_str = s; + /* So we know we allocated it. */ + sid_str_size = 0; + } else { + s = sid_str; + cnt = sid_str_size; + } + /* Start with "S-R-". */ + i = snprintf(s, cnt, "S-%hhu-", (unsigned char)sid->revision); + if (i < 0 || i >= cnt) + goto err_out; + s += i; + cnt -= i; + /* Add the identifier authority. */ + for (u = i = 0, j = 40; i < 6; i++, j -= 8) + u += (u64)sid->identifier_authority.value[i] << j; + if (!sid->identifier_authority.high_part) + i = snprintf(s, cnt, "%lu", (unsigned long)u); + else + i = snprintf(s, cnt, "0x%llx", (unsigned long long)u); + if (i < 0 || i >= cnt) + goto err_out; + s += i; + cnt -= i; + /* Finally, add the sub authorities. */ + for (j = 0; j < sid->sub_authority_count; j++) { + leauth = sid->sub_authority[j]; + i = snprintf(s, cnt, "-%u", (unsigned int) + le32_to_cpu(leauth)); + if (i < 0 || i >= cnt) + goto err_out; + s += i; + cnt -= i; + } + return sid_str; +err_out: + if (i >= cnt) + i = EMSGSIZE; + else + i = errno; + if (!sid_str_size) + free(sid_str); + errno = i; + return NULL; +} + +/** + * ntfs_generate_guid - generatates a random current guid. + * @guid: [OUT] pointer to a GUID struct to hold the generated guid. + * + * perhaps not a very good random number generator though... + */ +void ntfs_generate_guid(GUID *guid) +{ + unsigned int i; + u8 *p = (u8 *)guid; + + for (i = 0; i < sizeof(GUID); i++) { + p[i] = (u8)(random() & 0xFF); + if (i == 7) + p[7] = (p[7] & 0x0F) | 0x40; + if (i == 8) + p[8] = (p[8] & 0x3F) | 0x80; + } +} + +/** + * ntfs_security_hash - calculate the hash of a security descriptor + * @sd: self-relative security descriptor whose hash to calculate + * @length: size in bytes of the security descritor @sd + * + * Calculate the hash of the self-relative security descriptor @sd of length + * @length bytes. + * + * This hash is used in the $Secure system file as the primary key for the $SDH + * index and is also stored in the header of each security descriptor in the + * $SDS data stream as well as in the index data of both the $SII and $SDH + * indexes. In all three cases it forms part of the SDS_ENTRY_HEADER + * structure. + * + * Return the calculated security hash in little endian. + */ +le32 ntfs_security_hash(const SECURITY_DESCRIPTOR_RELATIVE *sd, const u32 len) +{ + const le32 *pos = (const le32*)sd; + const le32 *end = pos + (len >> 2); + u32 hash = 0; + + while (pos < end) { + hash = le32_to_cpup(pos) + ntfs_rol32(hash, 3); + pos++; + } + return cpu_to_le32(hash); +} + +/* + * Get the first entry of current index block + * cut and pasted form ntfs_ie_get_first() in index.c + */ + +static INDEX_ENTRY *ntfs_ie_get_first(INDEX_HEADER *ih) +{ + return (INDEX_ENTRY*)((u8*)ih + le32_to_cpu(ih->entries_offset)); +} + +/* + * Stuff a 256KB block into $SDS before writing descriptors + * into the block. + * + * This prevents $SDS from being automatically declared as sparse + * when the second copy of the first security descriptor is written + * 256KB further ahead. + * + * Having $SDS declared as a sparse file is not wrong by itself + * and chkdsk leaves it as a sparse file. It does however complain + * and add a sparse flag (0x0200) into field file_attributes of + * STANDARD_INFORMATION of $Secure. This probably means that a + * sparse attribute (ATTR_IS_SPARSE) is only allowed in sparse + * files (FILE_ATTR_SPARSE_FILE). + * + * Windows normally does not convert to sparse attribute or sparse + * file. Stuffing is just a way to get to the same result. + */ + +static int entersecurity_stuff(ntfs_volume *vol, off_t offs) +{ + int res; + int written; + unsigned long total; + char *stuff; + + res = 0; + total = 0; + stuff = (char*)ntfs_malloc(STUFFSZ); + if (stuff) { + memset(stuff, 0, STUFFSZ); + do { + written = ntfs_attr_data_write(vol->secure_ni, + STREAM_SDS, 4, stuff, STUFFSZ, offs); + if (written == STUFFSZ) { + total += STUFFSZ; + offs += STUFFSZ; + } else { + errno = ENOSPC; + res = -1; + } + } while (!res && (total < ALIGN_SDS_BLOCK)); + free(stuff); + } else { + errno = ENOMEM; + res = -1; + } + return (res); +} + +/* + * Enter a new security descriptor into $Secure (data only) + * it has to be written twice with an offset of 256KB + * + * Should only be called by entersecurityattr() to ensure consistency + * + * Returns zero if sucessful + */ + +static int entersecurity_data(ntfs_volume *vol, + const SECURITY_DESCRIPTOR_RELATIVE *attr, s64 attrsz, + le32 hash, le32 keyid, off_t offs, int gap) +{ + int res; + int written1; + int written2; + char *fullattr; + int fullsz; + SECURITY_DESCRIPTOR_HEADER *phsds; + + res = -1; + fullsz = attrsz + gap + sizeof(SECURITY_DESCRIPTOR_HEADER); + fullattr = (char*)ntfs_malloc(fullsz); + if (fullattr) { + /* + * Clear the gap from previous descriptor + * this could be useful for appending the second + * copy to the end of file. When creating a new + * 256K block, the gap is cleared while writing + * the first copy + */ + if (gap) + memset(fullattr,0,gap); + memcpy(&fullattr[gap + sizeof(SECURITY_DESCRIPTOR_HEADER)], + attr,attrsz); + phsds = (SECURITY_DESCRIPTOR_HEADER*)&fullattr[gap]; + phsds->hash = hash; + phsds->security_id = keyid; + phsds->offset = cpu_to_le64(offs); + phsds->length = cpu_to_le32(fullsz - gap); + written1 = ntfs_attr_data_write(vol->secure_ni, + STREAM_SDS, 4, fullattr, fullsz, + offs - gap); + written2 = ntfs_attr_data_write(vol->secure_ni, + STREAM_SDS, 4, fullattr, fullsz, + offs - gap + ALIGN_SDS_BLOCK); + if ((written1 == fullsz) + && (written2 == written1)) + res = 0; + else + errno = ENOSPC; + free(fullattr); + } else + errno = ENOMEM; + return (res); +} + +/* + * Enter a new security descriptor in $Secure (indexes only) + * + * Should only be called by entersecurityattr() to ensure consistency + * + * Returns zero if sucessful + */ + +static int entersecurity_indexes(ntfs_volume *vol, s64 attrsz, + le32 hash, le32 keyid, off_t offs) +{ + union { + struct { + le32 dataoffsl; + le32 dataoffsh; + } parts; + le64 all; + } realign; + int res; + ntfs_index_context *xsii; + ntfs_index_context *xsdh; + struct SII newsii; + struct SDH newsdh; + + res = -1; + /* enter a new $SII record */ + + xsii = vol->secure_xsii; + ntfs_index_ctx_reinit(xsii); + newsii.offs = const_cpu_to_le16(20); + newsii.size = const_cpu_to_le16(sizeof(struct SII) - 20); + newsii.fill1 = const_cpu_to_le32(0); + newsii.indexsz = const_cpu_to_le16(sizeof(struct SII)); + newsii.indexksz = const_cpu_to_le16(sizeof(SII_INDEX_KEY)); + newsii.flags = const_cpu_to_le16(0); + newsii.fill2 = const_cpu_to_le16(0); + newsii.keysecurid = keyid; + newsii.hash = hash; + newsii.securid = keyid; + realign.all = cpu_to_le64(offs); + newsii.dataoffsh = realign.parts.dataoffsh; + newsii.dataoffsl = realign.parts.dataoffsl; + newsii.datasize = cpu_to_le32(attrsz + + sizeof(SECURITY_DESCRIPTOR_HEADER)); + if (!ntfs_ie_add(xsii,(INDEX_ENTRY*)&newsii)) { + + /* enter a new $SDH record */ + + xsdh = vol->secure_xsdh; + ntfs_index_ctx_reinit(xsdh); + newsdh.offs = const_cpu_to_le16(24); + newsdh.size = const_cpu_to_le16( + sizeof(SECURITY_DESCRIPTOR_HEADER)); + newsdh.fill1 = const_cpu_to_le32(0); + newsdh.indexsz = const_cpu_to_le16( + sizeof(struct SDH)); + newsdh.indexksz = const_cpu_to_le16( + sizeof(SDH_INDEX_KEY)); + newsdh.flags = const_cpu_to_le16(0); + newsdh.fill2 = const_cpu_to_le16(0); + newsdh.keyhash = hash; + newsdh.keysecurid = keyid; + newsdh.hash = hash; + newsdh.securid = keyid; + newsdh.dataoffsh = realign.parts.dataoffsh; + newsdh.dataoffsl = realign.parts.dataoffsl; + newsdh.datasize = cpu_to_le32(attrsz + + sizeof(SECURITY_DESCRIPTOR_HEADER)); + /* special filler value, Windows generally */ + /* fills with 0x00490049, sometimes with zero */ + newsdh.fill3 = const_cpu_to_le32(0x00490049); + if (!ntfs_ie_add(xsdh,(INDEX_ENTRY*)&newsdh)) + res = 0; + } + return (res); +} + +/* + * Enter a new security descriptor in $Secure (data and indexes) + * Returns id of entry, or zero if there is a problem. + * (should not be called for NTFS version < 3.0) + * + * important : calls have to be serialized, however no locking is + * needed while fuse is not multithreaded + */ + +static le32 entersecurityattr(ntfs_volume *vol, + const SECURITY_DESCRIPTOR_RELATIVE *attr, s64 attrsz, + le32 hash) +{ + union { + struct { + le32 dataoffsl; + le32 dataoffsh; + } parts; + le64 all; + } realign; + le32 securid; + le32 keyid; + u32 newkey; + off_t offs; + int gap; + int size; + BOOL found; + struct SII *psii; + INDEX_ENTRY *entry; + INDEX_ENTRY *next; + ntfs_index_context *xsii; + int retries; + ntfs_attr *na; + int olderrno; + + /* find the first available securid beyond the last key */ + /* in $Secure:$SII. This also determines the first */ + /* available location in $Secure:$SDS, as this stream */ + /* is always appended to and the id's are allocated */ + /* in sequence */ + + securid = const_cpu_to_le32(0); + xsii = vol->secure_xsii; + ntfs_index_ctx_reinit(xsii); + offs = size = 0; + keyid = const_cpu_to_le32(-1); + olderrno = errno; + found = !ntfs_index_lookup((char*)&keyid, + sizeof(SII_INDEX_KEY), xsii); + if (!found && (errno != ENOENT)) { + ntfs_log_perror("Inconsistency in index $SII"); + psii = (struct SII*)NULL; + } else { + /* restore errno to avoid misinterpretation */ + errno = olderrno; + entry = xsii->entry; + psii = (struct SII*)xsii->entry; + } + if (psii) { + /* + * Get last entry in block, but must get first one + * one first, as we should already be beyond the + * last one. For some reason the search for the last + * entry sometimes does not return the last block... + * we assume this can only happen in root block + */ + if (xsii->is_in_root) + entry = ntfs_ie_get_first + ((INDEX_HEADER*)&xsii->ir->index); + else + entry = ntfs_ie_get_first + ((INDEX_HEADER*)&xsii->ib->index); + /* + * All index blocks should be at least half full + * so there always is a last entry but one, + * except when creating the first entry in index root. + * This was however found not to be true : chkdsk + * sometimes deletes all the (unused) keys in the last + * index block without rebalancing the tree. + * When this happens, a new search is restarted from + * the smallest key. + */ + keyid = const_cpu_to_le32(0); + retries = 0; + while (entry) { + next = ntfs_index_next(entry,xsii); + if (next) { + psii = (struct SII*)next; + /* save last key and */ + /* available position */ + keyid = psii->keysecurid; + realign.parts.dataoffsh + = psii->dataoffsh; + realign.parts.dataoffsl + = psii->dataoffsl; + offs = le64_to_cpu(realign.all); + size = le32_to_cpu(psii->datasize); + } + entry = next; + if (!entry && !keyid && !retries) { + /* search failed, retry from smallest key */ + ntfs_index_ctx_reinit(xsii); + found = !ntfs_index_lookup((char*)&keyid, + sizeof(SII_INDEX_KEY), xsii); + if (!found && (errno != ENOENT)) { + ntfs_log_perror("Index $SII is broken"); + } else { + /* restore errno */ + errno = olderrno; + entry = xsii->entry; + } + retries++; + } + } + } + if (!keyid) { + /* + * could not find any entry, before creating the first + * entry, make a double check by making sure size of $SII + * is less than needed for one entry + */ + securid = const_cpu_to_le32(0); + na = ntfs_attr_open(vol->secure_ni,AT_INDEX_ROOT,sii_stream,4); + if (na) { + if ((size_t)na->data_size < sizeof(struct SII)) { + ntfs_log_error("Creating the first security_id\n"); + securid = const_cpu_to_le32(FIRST_SECURITY_ID); + } + ntfs_attr_close(na); + } + if (!securid) { + ntfs_log_error("Error creating a security_id\n"); + errno = EIO; + } + } else { + newkey = le32_to_cpu(keyid) + 1; + securid = cpu_to_le32(newkey); + } + /* + * The security attr has to be written twice 256KB + * apart. This implies that offsets like + * 0x40000*odd_integer must be left available for + * the second copy. So align to next block when + * the last byte overflows on a wrong block. + */ + + if (securid) { + gap = (-size) & (ALIGN_SDS_ENTRY - 1); + offs += gap + size; + if ((offs + attrsz + sizeof(SECURITY_DESCRIPTOR_HEADER) - 1) + & ALIGN_SDS_BLOCK) { + offs = ((offs + attrsz + + sizeof(SECURITY_DESCRIPTOR_HEADER) - 1) + | (ALIGN_SDS_BLOCK - 1)) + 1; + } + if (!(offs & (ALIGN_SDS_BLOCK - 1))) + entersecurity_stuff(vol, offs); + /* + * now write the security attr to storage : + * first data, then SII, then SDH + * If failure occurs while writing SDS, data will never + * be accessed through indexes, and will be overwritten + * by the next allocated descriptor + * If failure occurs while writing SII, the id has not + * recorded and will be reallocated later + * If failure occurs while writing SDH, the space allocated + * in SDS or SII will not be reused, an inconsistency + * will persist with no significant consequence + */ + if (entersecurity_data(vol, attr, attrsz, hash, securid, offs, gap) + || entersecurity_indexes(vol, attrsz, hash, securid, offs)) + securid = const_cpu_to_le32(0); + } + /* inode now is dirty, synchronize it all */ + ntfs_index_entry_mark_dirty(vol->secure_xsii); + ntfs_index_ctx_reinit(vol->secure_xsii); + ntfs_index_entry_mark_dirty(vol->secure_xsdh); + ntfs_index_ctx_reinit(vol->secure_xsdh); + NInoSetDirty(vol->secure_ni); + if (ntfs_inode_sync(vol->secure_ni)) + ntfs_log_perror("Could not sync $Secure\n"); + return (securid); +} + +/* + * Find a matching security descriptor in $Secure, + * if none, allocate a new id and write the descriptor to storage + * Returns id of entry, or zero if there is a problem. + * + * important : calls have to be serialized, however no locking is + * needed while fuse is not multithreaded + */ + +static le32 setsecurityattr(ntfs_volume *vol, + const SECURITY_DESCRIPTOR_RELATIVE *attr, s64 attrsz) +{ + struct SDH *psdh; /* this is an image of index (le) */ + union { + struct { + le32 dataoffsl; + le32 dataoffsh; + } parts; + le64 all; + } realign; + BOOL found; + BOOL collision; + size_t size; + size_t rdsize; + s64 offs; + int res; + ntfs_index_context *xsdh; + char *oldattr; + SDH_INDEX_KEY key; + INDEX_ENTRY *entry; + le32 securid; + le32 hash; + int olderrno; + + hash = ntfs_security_hash(attr,attrsz); + oldattr = (char*)NULL; + securid = const_cpu_to_le32(0); + res = 0; + xsdh = vol->secure_xsdh; + if (vol->secure_ni && xsdh && !vol->secure_reentry++) { + ntfs_index_ctx_reinit(xsdh); + /* + * find the nearest key as (hash,0) + * (do not search for partial key : in case of collision, + * it could return a key which is not the first one which + * collides) + */ + key.hash = hash; + key.security_id = const_cpu_to_le32(0); + olderrno = errno; + found = !ntfs_index_lookup((char*)&key, + sizeof(SDH_INDEX_KEY), xsdh); + if (!found && (errno != ENOENT)) + ntfs_log_perror("Inconsistency in index $SDH"); + else { + /* restore errno to avoid misinterpretation */ + errno = olderrno; + entry = xsdh->entry; + found = FALSE; + /* + * lookup() may return a node with no data, + * if so get next + */ + if (entry->ie_flags & INDEX_ENTRY_END) + entry = ntfs_index_next(entry,xsdh); + do { + collision = FALSE; + psdh = (struct SDH*)entry; + if (psdh) + size = (size_t) le32_to_cpu(psdh->datasize) + - sizeof(SECURITY_DESCRIPTOR_HEADER); + else size = 0; + /* if hash is not the same, the key is not present */ + if (psdh && (size > 0) + && (psdh->keyhash == hash)) { + /* if hash is the same */ + /* check the whole record */ + realign.parts.dataoffsh = psdh->dataoffsh; + realign.parts.dataoffsl = psdh->dataoffsl; + offs = le64_to_cpu(realign.all) + + sizeof(SECURITY_DESCRIPTOR_HEADER); + oldattr = (char*)ntfs_malloc(size); + if (oldattr) { + rdsize = ntfs_attr_data_read( + vol->secure_ni, + STREAM_SDS, 4, + oldattr, size, offs); + found = (rdsize == size) + && !memcmp(oldattr,attr,size); + free(oldattr); + /* if the records do not compare */ + /* (hash collision), try next one */ + if (!found) { + entry = ntfs_index_next( + entry,xsdh); + collision = TRUE; + } + } else + res = ENOMEM; + } + } while (collision && entry); + if (found) + securid = psdh->keysecurid; + else { + if (res) { + errno = res; + securid = const_cpu_to_le32(0); + } else { + /* + * no matching key : + * have to build a new one + */ + securid = entersecurityattr(vol, + attr, attrsz, hash); + } + } + } + } + if (--vol->secure_reentry) + ntfs_log_perror("Reentry error, check no multithreading\n"); + return (securid); +} + + +/* + * Update the security descriptor of a file + * Either as an attribute (complying with pre v3.x NTFS version) + * or, when possible, as an entry in $Secure (for NTFS v3.x) + * + * returns 0 if success + */ + +static int update_secur_descr(ntfs_volume *vol, + char *newattr, ntfs_inode *ni) +{ + int newattrsz; + int written; + int res; + ntfs_attr *na; + + newattrsz = ntfs_attr_size(newattr); + +#if !FORCE_FORMAT_v1x + if ((vol->major_ver < 3) || !vol->secure_ni) { +#endif + + /* update for NTFS format v1.x */ + + /* update the old security attribute */ + na = ntfs_attr_open(ni, AT_SECURITY_DESCRIPTOR, AT_UNNAMED, 0); + if (na) { + /* resize attribute */ + res = ntfs_attr_truncate(na, (s64) newattrsz); + /* overwrite value */ + if (!res) { + written = (int)ntfs_attr_pwrite(na, (s64) 0, + (s64) newattrsz, newattr); + if (written != newattrsz) { + ntfs_log_error("Failed to update " + "a v1.x security descriptor\n"); + errno = EIO; + res = -1; + } + } + + ntfs_attr_close(na); + /* if old security attribute was found, also */ + /* truncate standard information attribute to v1.x */ + /* this is needed when security data is wanted */ + /* as v1.x though volume is formatted for v3.x */ + na = ntfs_attr_open(ni, AT_STANDARD_INFORMATION, + AT_UNNAMED, 0); + if (na) { + clear_nino_flag(ni, v3_Extensions); + /* + * Truncating the record does not sweep extensions + * from copy in memory. Clear security_id to be safe + */ + ni->security_id = const_cpu_to_le32(0); + res = ntfs_attr_truncate(na, (s64)48); + ntfs_attr_close(na); + clear_nino_flag(ni, v3_Extensions); + } + } else { + /* + * insert the new security attribute if there + * were none + */ + res = ntfs_attr_add(ni, AT_SECURITY_DESCRIPTOR, + AT_UNNAMED, 0, (u8*)newattr, + (s64) newattrsz); + } +#if !FORCE_FORMAT_v1x + } else { + + /* update for NTFS format v3.x */ + + le32 securid; + + securid = setsecurityattr(vol, + (const SECURITY_DESCRIPTOR_RELATIVE*)newattr, + (s64)newattrsz); + if (securid) { + na = ntfs_attr_open(ni, AT_STANDARD_INFORMATION, + AT_UNNAMED, 0); + if (na) { + res = 0; + if (!test_nino_flag(ni, v3_Extensions)) { + /* expand standard information attribute to v3.x */ + res = ntfs_attr_truncate(na, + (s64)sizeof(STANDARD_INFORMATION)); + ni->owner_id = const_cpu_to_le32(0); + ni->quota_charged = const_cpu_to_le64(0); + ni->usn = const_cpu_to_le64(0); + ntfs_attr_remove(ni, + AT_SECURITY_DESCRIPTOR, + AT_UNNAMED, 0); + } + set_nino_flag(ni, v3_Extensions); + ni->security_id = securid; + ntfs_attr_close(na); + } else { + ntfs_log_error("Failed to update " + "standard informations\n"); + errno = EIO; + res = -1; + } + } else + res = -1; + } +#endif + + /* mark node as dirty */ + NInoSetDirty(ni); + return (res); +} + +/* + * Upgrade the security descriptor of a file + * This is intended to allow graceful upgrades for files which + * were created in previous versions, with a security attributes + * and no security id. + * + * It will allocate a security id and replace the individual + * security attribute by a reference to the global one + * + * Special files are not upgraded (currently / and files in + * directories /$*) + * + * Though most code is similar to update_secur_desc() it has + * been kept apart to facilitate the further processing of + * special cases or even to remove it if found dangerous. + * + * returns 0 if success, + * 1 if not upgradable. This is not an error. + * -1 if there is a problem + */ + +static int upgrade_secur_desc(ntfs_volume *vol, + const char *attr, ntfs_inode *ni) +{ + int attrsz; + int res; + le32 securid; + ntfs_attr *na; + + /* + * upgrade requires NTFS format v3.x + * also refuse upgrading for special files + * whose number is less than FILE_first_user + */ + + if ((vol->major_ver >= 3) + && (ni->mft_no >= FILE_first_user)) { + attrsz = ntfs_attr_size(attr); + securid = setsecurityattr(vol, + (const SECURITY_DESCRIPTOR_RELATIVE*)attr, + (s64)attrsz); + if (securid) { + na = ntfs_attr_open(ni, AT_STANDARD_INFORMATION, + AT_UNNAMED, 0); + if (na) { + res = 0; + /* expand standard information attribute to v3.x */ + res = ntfs_attr_truncate(na, + (s64)sizeof(STANDARD_INFORMATION)); + ni->owner_id = const_cpu_to_le32(0); + ni->quota_charged = const_cpu_to_le64(0); + ni->usn = const_cpu_to_le64(0); + ntfs_attr_remove(ni, AT_SECURITY_DESCRIPTOR, + AT_UNNAMED, 0); + set_nino_flag(ni, v3_Extensions); + ni->security_id = securid; + ntfs_attr_close(na); + } else { + ntfs_log_error("Failed to upgrade " + "standard informations\n"); + errno = EIO; + res = -1; + } + } else + res = -1; + /* mark node as dirty */ + NInoSetDirty(ni); + } else + res = 1; + + return (res); +} + +/* + * Optional simplified checking of group membership + * + * This only takes into account the groups defined in + * /etc/group at initialization time. + * It does not take into account the groups dynamically set by + * setgroups() nor the changes in /etc/group since initialization + * + * This optional method could be useful if standard checking + * leads to a performance concern. + * + * Should not be called for user root, however the group may be root + * + */ + +static BOOL staticgroupmember(struct SECURITY_CONTEXT *scx, uid_t uid, gid_t gid) +{ + BOOL ingroup; + int grcnt; + gid_t *groups; + struct MAPPING *user; + + ingroup = FALSE; + if (uid) { + user = scx->mapping[MAPUSERS]; + while (user && ((uid_t)user->xid != uid)) + user = user->next; + if (user) { + groups = user->groups; + grcnt = user->grcnt; + while ((--grcnt >= 0) && (groups[grcnt] != gid)) { } + ingroup = (grcnt >= 0); + } + } + return (ingroup); +} + + +/* + * Check whether current thread owner is member of file group + * + * Should not be called for user root, however the group may be root + * + * As indicated by Miklos Szeredi : + * + * The group list is available in + * + * /proc/$PID/task/$TID/status + * + * and fuse supplies TID in get_fuse_context()->pid. The only problem is + * finding out PID, for which I have no good solution, except to iterate + * through all processes. This is rather slow, but may be speeded up + * with caching and heuristics (for single threaded programs PID = TID). + * + * The following implementation gets the group list from + * /proc/$TID/task/$TID/status which apparently exists and + * contains the same data. + */ + +static BOOL groupmember(struct SECURITY_CONTEXT *scx, uid_t uid, gid_t gid) +{ + static char key[] = "\nGroups:"; + char buf[BUFSZ+1]; + char filename[64]; + enum { INKEY, INSEP, INNUM, INEND } state; + int fd; + char c; + int matched; + BOOL ismember; + int got; + char *p; + gid_t grp; + pid_t tid; + + if (scx->vol->secure_flags & (1 << SECURITY_STATICGRPS)) + ismember = staticgroupmember(scx, uid, gid); + else { + ismember = FALSE; /* default return */ + tid = scx->tid; + sprintf(filename,"/proc/%u/task/%u/status",tid,tid); + fd = open(filename,O_RDONLY); + if (fd >= 0) { + got = read(fd, buf, BUFSZ); + buf[got] = 0; + state = INKEY; + matched = 0; + p = buf; + grp = 0; + /* + * A simple automaton to process lines like + * Groups: 14 500 513 + */ + do { + c = *p++; + if (!c) { + /* refill buffer */ + got = read(fd, buf, BUFSZ); + buf[got] = 0; + p = buf; + c = *p++; /* 0 at end of file */ + } + switch (state) { + case INKEY : + if (key[matched] == c) { + if (!key[++matched]) + state = INSEP; + } else + if (key[0] == c) + matched = 1; + else + matched = 0; + break; + case INSEP : + if ((c >= '0') && (c <= '9')) { + grp = c - '0'; + state = INNUM; + } else + if ((c != ' ') && (c != '\t')) + state = INEND; + break; + case INNUM : + if ((c >= '0') && (c <= '9')) + grp = grp*10 + c - '0'; + else { + ismember = (grp == gid); + if ((c != ' ') && (c != '\t')) + state = INEND; + else + state = INSEP; + } + default : + break; + } + } while (!ismember && c && (state != INEND)); + close(fd); + if (!c) + ntfs_log_error("No group record found in %s\n",filename); + } else + ntfs_log_error("Could not open %s\n",filename); + } + return (ismember); +} + +/* + * Cacheing is done two-way : + * - from uid, gid and perm to securid (CACHED_SECURID) + * - from a securid to uid, gid and perm (CACHED_PERMISSIONS) + * + * CACHED_SECURID data is kept in a most-recent-first list + * which should not be too long to be efficient. Its optimal + * size is depends on usage and is hard to determine. + * + * CACHED_PERMISSIONS data is kept in a two-level indexed array. It + * is optimal at the expense of storage. Use of a most-recent-first + * list would save memory and provide similar performances for + * standard usage, but not for file servers with too many file + * owners + * + * CACHED_PERMISSIONS_LEGACY is a special case for CACHED_PERMISSIONS + * for legacy directories which were not allocated a security_id + * it is organized in a most-recent-first list. + * + * In main caches, data is never invalidated, as the meaning of + * a security_id only changes when user mapping is changed, which + * current implies remounting. However returned entries may be + * overwritten at next update, so data has to be copied elsewhere + * before another cache update is made. + * In legacy cache, data has to be invalidated when protection is + * changed. + * + * Though the same data may be found in both list, they + * must be kept separately : the interpretation of ACL + * in both direction are approximations which could be non + * reciprocal for some configuration of the user mapping data + * + * During the process of recompiling ntfs-3g from a tgz archive, + * security processing added 7.6% to the cpu time used by ntfs-3g + * and 30% if the cache is disabled. + */ + +static struct PERMISSIONS_CACHE *create_caches(struct SECURITY_CONTEXT *scx, + u32 securindex) +{ + struct PERMISSIONS_CACHE *cache; + unsigned int index1; + unsigned int i; + + cache = (struct PERMISSIONS_CACHE*)NULL; + /* create the first permissions blocks */ + index1 = securindex >> CACHE_PERMISSIONS_BITS; + cache = (struct PERMISSIONS_CACHE*) + ntfs_malloc(sizeof(struct PERMISSIONS_CACHE) + + index1*sizeof(struct CACHED_PERMISSIONS*)); + if (cache) { + cache->head.last = index1; + cache->head.p_reads = 0; + cache->head.p_hits = 0; + cache->head.p_writes = 0; + *scx->pseccache = cache; + for (i=0; i<=index1; i++) + cache->cachetable[i] + = (struct CACHED_PERMISSIONS*)NULL; + } + return (cache); +} + +/* + * Free memory used by caches + * The only purpose is to facilitate the detection of memory leaks + */ + +static void free_caches(struct SECURITY_CONTEXT *scx) +{ + unsigned int index1; + struct PERMISSIONS_CACHE *pseccache; + + pseccache = *scx->pseccache; + if (pseccache) { + for (index1=0; index1<=pseccache->head.last; index1++) + if (pseccache->cachetable[index1]) { +#if POSIXACLS + struct CACHED_PERMISSIONS *cacheentry; + unsigned int index2; + + for (index2=0; index2<(1<< CACHE_PERMISSIONS_BITS); index2++) { + cacheentry = &pseccache->cachetable[index1][index2]; + if (cacheentry->valid + && cacheentry->pxdesc) + free(cacheentry->pxdesc); + } +#endif + free(pseccache->cachetable[index1]); + } + free(pseccache); + } +} + +static int compare(const struct CACHED_SECURID *cached, + const struct CACHED_SECURID *item) +{ +#if POSIXACLS + size_t csize; + size_t isize; + + /* only compare data and sizes */ + csize = (cached->variable ? + sizeof(struct POSIX_ACL) + + (((struct POSIX_SECURITY*)cached->variable)->acccnt + + ((struct POSIX_SECURITY*)cached->variable)->defcnt) + *sizeof(struct POSIX_ACE) : + 0); + isize = (item->variable ? + sizeof(struct POSIX_ACL) + + (((struct POSIX_SECURITY*)item->variable)->acccnt + + ((struct POSIX_SECURITY*)item->variable)->defcnt) + *sizeof(struct POSIX_ACE) : + 0); + return ((cached->uid != item->uid) + || (cached->gid != item->gid) + || (cached->dmode != item->dmode) + || (csize != isize) + || (csize + && isize + && memcmp(&((struct POSIX_SECURITY*)cached->variable)->acl, + &((struct POSIX_SECURITY*)item->variable)->acl, csize))); +#else + return ((cached->uid != item->uid) + || (cached->gid != item->gid) + || (cached->dmode != item->dmode)); +#endif +} + +static int leg_compare(const struct CACHED_PERMISSIONS_LEGACY *cached, + const struct CACHED_PERMISSIONS_LEGACY *item) +{ + return (cached->mft_no != item->mft_no); +} + +/* + * Resize permission cache table + * do not call unless resizing is needed + * + * If allocation fails, the cache size is not updated + * Lack of memory is not considered as an error, the cache is left + * consistent and errno is not set. + */ + +static void resize_cache(struct SECURITY_CONTEXT *scx, + u32 securindex) +{ + struct PERMISSIONS_CACHE *oldcache; + struct PERMISSIONS_CACHE *newcache; + int newcnt; + int oldcnt; + unsigned int index1; + unsigned int i; + + oldcache = *scx->pseccache; + index1 = securindex >> CACHE_PERMISSIONS_BITS; + newcnt = index1 + 1; + if (newcnt <= ((CACHE_PERMISSIONS_SIZE + + (1 << CACHE_PERMISSIONS_BITS) + - 1) >> CACHE_PERMISSIONS_BITS)) { + /* expand cache beyond current end, do not use realloc() */ + /* to avoid losing data when there is no more memory */ + oldcnt = oldcache->head.last + 1; + newcache = (struct PERMISSIONS_CACHE*) + ntfs_malloc( + sizeof(struct PERMISSIONS_CACHE) + + (newcnt - 1)*sizeof(struct CACHED_PERMISSIONS*)); + if (newcache) { + memcpy(newcache,oldcache, + sizeof(struct PERMISSIONS_CACHE) + + (oldcnt - 1)*sizeof(struct CACHED_PERMISSIONS*)); + free(oldcache); + /* mark new entries as not valid */ + for (i=newcache->head.last+1; i<=index1; i++) + newcache->cachetable[i] + = (struct CACHED_PERMISSIONS*)NULL; + newcache->head.last = index1; + *scx->pseccache = newcache; + } + } +} + +/* + * Enter uid, gid and mode into cache, if possible + * + * returns the updated or created cache entry, + * or NULL if not possible (typically if there is no + * security id associated) + */ + +#if POSIXACLS +static struct CACHED_PERMISSIONS *enter_cache(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, uid_t uid, gid_t gid, + struct POSIX_SECURITY *pxdesc) +#else +static struct CACHED_PERMISSIONS *enter_cache(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, uid_t uid, gid_t gid, mode_t mode) +#endif +{ + struct CACHED_PERMISSIONS *cacheentry; + struct CACHED_PERMISSIONS *cacheblock; + struct PERMISSIONS_CACHE *pcache; + u32 securindex; +#if POSIXACLS + int pxsize; + struct POSIX_SECURITY *pxcached; +#endif + unsigned int index1; + unsigned int index2; + int i; + + /* cacheing is only possible if a security_id has been defined */ + if (test_nino_flag(ni, v3_Extensions) + && ni->security_id) { + /* + * Immediately test the most frequent situation + * where the entry exists + */ + securindex = le32_to_cpu(ni->security_id); + index1 = securindex >> CACHE_PERMISSIONS_BITS; + index2 = securindex & ((1 << CACHE_PERMISSIONS_BITS) - 1); + pcache = *scx->pseccache; + if (pcache + && (pcache->head.last >= index1) + && pcache->cachetable[index1]) { + cacheentry = &pcache->cachetable[index1][index2]; + cacheentry->uid = uid; + cacheentry->gid = gid; +#if POSIXACLS + if (cacheentry->valid && cacheentry->pxdesc) + free(cacheentry->pxdesc); + if (pxdesc) { + pxsize = sizeof(struct POSIX_SECURITY) + + (pxdesc->acccnt + pxdesc->defcnt)*sizeof(struct POSIX_ACE); + pxcached = (struct POSIX_SECURITY*)ntfs_malloc(pxsize); + if (pxcached) { + memcpy(pxcached, pxdesc, pxsize); + cacheentry->pxdesc = pxcached; + } else { + cacheentry->valid = 0; + cacheentry = (struct CACHED_PERMISSIONS*)NULL; + } + cacheentry->mode = pxdesc->mode & 07777; + } else + cacheentry->pxdesc = (struct POSIX_SECURITY*)NULL; +#else + cacheentry->mode = mode & 07777; +#endif + cacheentry->inh_fileid = const_cpu_to_le32(0); + cacheentry->inh_dirid = const_cpu_to_le32(0); + cacheentry->valid = 1; + pcache->head.p_writes++; + } else { + if (!pcache) { + /* create the first cache block */ + pcache = create_caches(scx, securindex); + } else { + if (index1 > pcache->head.last) { + resize_cache(scx, securindex); + pcache = *scx->pseccache; + } + } + /* allocate block, if cache table was allocated */ + if (pcache && (index1 <= pcache->head.last)) { + cacheblock = (struct CACHED_PERMISSIONS*) + ntfs_malloc(sizeof(struct CACHED_PERMISSIONS) + << CACHE_PERMISSIONS_BITS); + pcache->cachetable[index1] = cacheblock; + for (i=0; i<(1 << CACHE_PERMISSIONS_BITS); i++) + cacheblock[i].valid = 0; + cacheentry = &cacheblock[index2]; + if (cacheentry) { + cacheentry->uid = uid; + cacheentry->gid = gid; +#if POSIXACLS + if (pxdesc) { + pxsize = sizeof(struct POSIX_SECURITY) + + (pxdesc->acccnt + pxdesc->defcnt)*sizeof(struct POSIX_ACE); + pxcached = (struct POSIX_SECURITY*)ntfs_malloc(pxsize); + if (pxcached) { + memcpy(pxcached, pxdesc, pxsize); + cacheentry->pxdesc = pxcached; + } else { + cacheentry->valid = 0; + cacheentry = (struct CACHED_PERMISSIONS*)NULL; + } + cacheentry->mode = pxdesc->mode & 07777; + } else + cacheentry->pxdesc = (struct POSIX_SECURITY*)NULL; +#else + cacheentry->mode = mode & 07777; +#endif + cacheentry->inh_fileid = const_cpu_to_le32(0); + cacheentry->inh_dirid = const_cpu_to_le32(0); + cacheentry->valid = 1; + pcache->head.p_writes++; + } + } else + cacheentry = (struct CACHED_PERMISSIONS*)NULL; + } + } else { + cacheentry = (struct CACHED_PERMISSIONS*)NULL; +#if CACHE_LEGACY_SIZE + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) { + struct CACHED_PERMISSIONS_LEGACY wanted; + struct CACHED_PERMISSIONS_LEGACY *legacy; + + wanted.perm.uid = uid; + wanted.perm.gid = gid; +#if POSIXACLS + wanted.perm.mode = pxdesc->mode & 07777; + wanted.perm.inh_fileid = const_cpu_to_le32(0); + wanted.perm.inh_dirid = const_cpu_to_le32(0); + wanted.mft_no = ni->mft_no; + wanted.variable = (void*)pxdesc; + wanted.varsize = sizeof(struct POSIX_SECURITY) + + (pxdesc->acccnt + pxdesc->defcnt)*sizeof(struct POSIX_ACE); +#else + wanted.perm.mode = mode & 07777; + wanted.perm.inh_fileid = const_cpu_to_le32(0); + wanted.perm.inh_dirid = const_cpu_to_le32(0); + wanted.mft_no = ni->mft_no; + wanted.variable = (void*)NULL; + wanted.varsize = 0; +#endif + legacy = (struct CACHED_PERMISSIONS_LEGACY*)ntfs_enter_cache( + scx->vol->legacy_cache, GENERIC(&wanted), + (cache_compare)leg_compare); + if (legacy) { + cacheentry = &legacy->perm; +#if POSIXACLS + /* + * give direct access to the cached pxdesc + * in the permissions structure + */ + cacheentry->pxdesc = legacy->variable; +#endif + } + } +#endif + } + return (cacheentry); +} + +/* + * Fetch owner, group and permission of a file, if cached + * + * Beware : do not use the returned entry after a cache update : + * the cache may be relocated making the returned entry meaningless + * + * returns the cache entry, or NULL if not available + */ + +static struct CACHED_PERMISSIONS *fetch_cache(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni) +{ + struct CACHED_PERMISSIONS *cacheentry; + struct PERMISSIONS_CACHE *pcache; + u32 securindex; + unsigned int index1; + unsigned int index2; + + /* cacheing is only possible if a security_id has been defined */ + cacheentry = (struct CACHED_PERMISSIONS*)NULL; + if (test_nino_flag(ni, v3_Extensions) + && (ni->security_id)) { + securindex = le32_to_cpu(ni->security_id); + index1 = securindex >> CACHE_PERMISSIONS_BITS; + index2 = securindex & ((1 << CACHE_PERMISSIONS_BITS) - 1); + pcache = *scx->pseccache; + if (pcache + && (pcache->head.last >= index1) + && pcache->cachetable[index1]) { + cacheentry = &pcache->cachetable[index1][index2]; + /* reject if entry is not valid */ + if (!cacheentry->valid) + cacheentry = (struct CACHED_PERMISSIONS*)NULL; + else + pcache->head.p_hits++; + if (pcache) + pcache->head.p_reads++; + } + } +#if CACHE_LEGACY_SIZE + else { + cacheentry = (struct CACHED_PERMISSIONS*)NULL; + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) { + struct CACHED_PERMISSIONS_LEGACY wanted; + struct CACHED_PERMISSIONS_LEGACY *legacy; + + wanted.mft_no = ni->mft_no; + wanted.variable = (void*)NULL; + wanted.varsize = 0; + legacy = (struct CACHED_PERMISSIONS_LEGACY*)ntfs_fetch_cache( + scx->vol->legacy_cache, GENERIC(&wanted), + (cache_compare)leg_compare); + if (legacy) cacheentry = &legacy->perm; + } + } +#endif +#if POSIXACLS + if (cacheentry && !cacheentry->pxdesc) { + ntfs_log_error("No Posix descriptor in cache\n"); + cacheentry = (struct CACHED_PERMISSIONS*)NULL; + } +#endif + return (cacheentry); +} + +/* + * Retrieve a security attribute from $Secure + */ + +static char *retrievesecurityattr(ntfs_volume *vol, SII_INDEX_KEY id) +{ + struct SII *psii; + union { + struct { + le32 dataoffsl; + le32 dataoffsh; + } parts; + le64 all; + } realign; + int found; + size_t size; + size_t rdsize; + s64 offs; + ntfs_inode *ni; + ntfs_index_context *xsii; + char *securattr; + + securattr = (char*)NULL; + ni = vol->secure_ni; + xsii = vol->secure_xsii; + if (ni && xsii) { + ntfs_index_ctx_reinit(xsii); + found = + !ntfs_index_lookup((char*)&id, + sizeof(SII_INDEX_KEY), xsii); + if (found) { + psii = (struct SII*)xsii->entry; + size = + (size_t) le32_to_cpu(psii->datasize) + - sizeof(SECURITY_DESCRIPTOR_HEADER); + /* work around bad alignment problem */ + realign.parts.dataoffsh = psii->dataoffsh; + realign.parts.dataoffsl = psii->dataoffsl; + offs = le64_to_cpu(realign.all) + + sizeof(SECURITY_DESCRIPTOR_HEADER); + + securattr = (char*)ntfs_malloc(size); + if (securattr) { + rdsize = ntfs_attr_data_read( + ni, STREAM_SDS, 4, + securattr, size, offs); + if ((rdsize != size) + || !ntfs_valid_descr(securattr, + rdsize)) { + /* error to be logged by caller */ + free(securattr); + securattr = (char*)NULL; + } + } + } else + if (errno != ENOENT) + ntfs_log_perror("Inconsistency in index $SII"); + } + if (!securattr) { + ntfs_log_error("Failed to retrieve a security descriptor\n"); + errno = EIO; + } + return (securattr); +} + +/* + * Get the security descriptor associated to a file + * + * Either : + * - read the security descriptor attribute (v1.x format) + * - or find the descriptor in $Secure:$SDS (v3.x format) + * + * in both case, sanity checks are done on the attribute and + * the descriptor can be assumed safe + * + * The returned descriptor is dynamically allocated and has to be freed + */ + +static char *getsecurityattr(ntfs_volume *vol, ntfs_inode *ni) +{ + SII_INDEX_KEY securid; + char *securattr; + s64 readallsz; + + /* + * Warning : in some situations, after fixing by chkdsk, + * v3_Extensions are marked present (long standard informations) + * with a default security descriptor inserted in an + * attribute + */ + if (test_nino_flag(ni, v3_Extensions) + && vol->secure_ni && ni->security_id) { + /* get v3.x descriptor in $Secure */ + securid.security_id = ni->security_id; + securattr = retrievesecurityattr(vol,securid); + if (!securattr) + ntfs_log_error("Bad security descriptor for 0x%lx\n", + (long)le32_to_cpu(ni->security_id)); + } else { + /* get v1.x security attribute */ + readallsz = 0; + securattr = ntfs_attr_readall(ni, AT_SECURITY_DESCRIPTOR, + AT_UNNAMED, 0, &readallsz); + if (securattr && !ntfs_valid_descr(securattr, readallsz)) { + ntfs_log_error("Bad security descriptor for inode %lld\n", + (long long)ni->mft_no); + free(securattr); + securattr = (char*)NULL; + } + } + if (!securattr) { + /* + * in some situations, there is no security + * descriptor, and chkdsk does not detect or fix + * anything. This could be a normal situation. + * When this happens, simulate a descriptor with + * minimum rights, so that a real descriptor can + * be created by chown or chmod + */ + ntfs_log_error("No security descriptor found for inode %lld\n", + (long long)ni->mft_no); + securattr = ntfs_build_descr(0, 0, adminsid, adminsid); + } + return (securattr); +} + +#if POSIXACLS + +/* + * Determine which access types to a file are allowed + * according to the relation of current process to the file + * + * Do not call if default_permissions is set + */ + +static int access_check_posix(struct SECURITY_CONTEXT *scx, + struct POSIX_SECURITY *pxdesc, mode_t request, + uid_t uid, gid_t gid) +{ + struct POSIX_ACE *pxace; + int userperms; + int groupperms; + int mask; + BOOL somegroup; + BOOL needgroups; + mode_t perms; + int i; + + perms = pxdesc->mode; + /* owner and root access */ + if (!scx->uid || (uid == scx->uid)) { + if (!scx->uid) { + /* root access if owner or other execution */ + if (perms & 0101) + perms = 07777; + else { + /* root access if some group execution */ + groupperms = 0; + mask = 7; + for (i=pxdesc->acccnt-1; i>=0 ; i--) { + pxace = &pxdesc->acl.ace[i]; + switch (pxace->tag) { + case POSIX_ACL_USER_OBJ : + case POSIX_ACL_GROUP_OBJ : + case POSIX_ACL_GROUP : + groupperms |= pxace->perms; + break; + case POSIX_ACL_MASK : + mask = pxace->perms & 7; + break; + default : + break; + } + } + perms = (groupperms & mask & 1) | 6; + } + } else + perms &= 07700; + } else { + /* + * analyze designated users, get mask + * and identify whether we need to check + * the group memberships. The groups are + * not needed when all groups have the + * same permissions as other for the + * requested modes. + */ + userperms = -1; + groupperms = -1; + needgroups = FALSE; + mask = 7; + for (i=pxdesc->acccnt-1; i>=0 ; i--) { + pxace = &pxdesc->acl.ace[i]; + switch (pxace->tag) { + case POSIX_ACL_USER : + if ((uid_t)pxace->id == scx->uid) + userperms = pxace->perms; + break; + case POSIX_ACL_MASK : + mask = pxace->perms & 7; + break; + case POSIX_ACL_GROUP_OBJ : + case POSIX_ACL_GROUP : + if (((pxace->perms & mask) ^ perms) + & (request >> 6) & 7) + needgroups = TRUE; + break; + default : + break; + } + } + /* designated users */ + if (userperms >= 0) + perms = (perms & 07000) + (userperms & mask); + else if (!needgroups) + perms &= 07007; + else { + /* owning group */ + if (!(~(perms >> 3) & request & mask) + && ((gid == scx->gid) + || groupmember(scx, scx->uid, gid))) + perms &= 07070; + else { + /* other groups */ + groupperms = -1; + somegroup = FALSE; + for (i=pxdesc->acccnt-1; i>=0 ; i--) { + pxace = &pxdesc->acl.ace[i]; + if ((pxace->tag == POSIX_ACL_GROUP) + && groupmember(scx, uid, pxace->id)) { + if (!(~pxace->perms & request & mask)) + groupperms = pxace->perms; + somegroup = TRUE; + } + } + if (groupperms >= 0) + perms = (perms & 07000) + (groupperms & mask); + else + if (somegroup) + perms = 0; + else + perms &= 07007; + } + } + } + return (perms); +} + +/* + * Get permissions to access a file + * Takes into account the relation of user to file (owner, group, ...) + * Do no use as mode of the file + * Do no call if default_permissions is set + * + * returns -1 if there is a problem + */ + +static int ntfs_get_perm(struct SECURITY_CONTEXT *scx, + ntfs_inode * ni, mode_t request) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const struct CACHED_PERMISSIONS *cached; + char *securattr; + const SID *usid; /* owner of file/directory */ + const SID *gsid; /* group of file/directory */ + uid_t uid; + gid_t gid; + int perm; + BOOL isdir; + struct POSIX_SECURITY *pxdesc; + + if (!scx->mapping[MAPUSERS]) + perm = 07777; + else { + /* check whether available in cache */ + cached = fetch_cache(scx,ni); + if (cached) { + uid = cached->uid; + gid = cached->gid; + perm = access_check_posix(scx,cached->pxdesc,request,uid,gid); + } else { + perm = 0; /* default to no permission */ + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + != const_cpu_to_le16(0); + securattr = getsecurityattr(scx->vol, ni); + if (securattr) { + phead = (const SECURITY_DESCRIPTOR_RELATIVE*) + securattr; + gsid = (const SID*)& + securattr[le32_to_cpu(phead->group)]; + gid = ntfs_find_group(scx->mapping[MAPGROUPS],gsid); +#if OWNERFROMACL + usid = ntfs_acl_owner(securattr); + pxdesc = ntfs_build_permissions_posix(scx->mapping,securattr, + usid, gsid, isdir); + if (pxdesc) + perm = pxdesc->mode & 07777; + else + perm = -1; + uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); +#else + usid = (const SID*)& + securattr[le32_to_cpu(phead->owner)]; + pxdesc = ntfs_build_permissions_posix(scx,securattr, + usid, gsid, isdir); + if (pxdesc) + perm = pxdesc->mode & 07777; + else + perm = -1; + if (!perm && ntfs_same_sid(usid, adminsid)) { + uid = find_tenant(scx, securattr); + if (uid) + perm = 0700; + } else + uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); +#endif + /* + * Create a security id if there were none + * and upgrade option is selected + */ + if (!test_nino_flag(ni, v3_Extensions) + && (perm >= 0) + && (scx->vol->secure_flags + & (1 << SECURITY_ADDSECURIDS))) { + upgrade_secur_desc(scx->vol, + securattr, ni); + /* + * fetch owner and group for cacheing + * if there is a securid + */ + } + if (test_nino_flag(ni, v3_Extensions) + && (perm >= 0)) { + enter_cache(scx, ni, uid, + gid, pxdesc); + } + if (pxdesc) { + perm = access_check_posix(scx,pxdesc,request,uid,gid); + free(pxdesc); + } + free(securattr); + } else { + perm = -1; + uid = gid = 0; + } + } + } + return (perm); +} + +/* + * Get a Posix ACL + * + * returns size or -errno if there is a problem + * if size was too small, no copy is done and errno is not set, + * the caller is expected to issue a new call + */ + +int ntfs_get_posix_acl(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + const char *name, char *value, size_t size) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + struct POSIX_SECURITY *pxdesc; + const struct CACHED_PERMISSIONS *cached; + char *securattr; + const SID *usid; /* owner of file/directory */ + const SID *gsid; /* group of file/directory */ + uid_t uid; + gid_t gid; + int perm; + BOOL isdir; + size_t outsize; + + outsize = 0; /* default to error */ + if (!scx->mapping[MAPUSERS]) + errno = ENOTSUP; + else { + /* check whether available in cache */ + cached = fetch_cache(scx,ni); + if (cached) + pxdesc = cached->pxdesc; + else { + securattr = getsecurityattr(scx->vol, ni); + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + != const_cpu_to_le16(0); + if (securattr) { + phead = + (const SECURITY_DESCRIPTOR_RELATIVE*) + securattr; + gsid = (const SID*)& + securattr[le32_to_cpu(phead->group)]; +#if OWNERFROMACL + usid = ntfs_acl_owner(securattr); +#else + usid = (const SID*)& + securattr[le32_to_cpu(phead->owner)]; +#endif + pxdesc = ntfs_build_permissions_posix(scx->mapping,securattr, + usid, gsid, isdir); + + /* + * fetch owner and group for cacheing + */ + if (pxdesc) { + perm = pxdesc->mode & 07777; + /* + * Create a security id if there were none + * and upgrade option is selected + */ + if (!test_nino_flag(ni, v3_Extensions) + && (scx->vol->secure_flags + & (1 << SECURITY_ADDSECURIDS))) { + upgrade_secur_desc(scx->vol, + securattr, ni); + } +#if OWNERFROMACL + uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); +#else + if (!perm && ntfs_same_sid(usid, adminsid)) { + uid = find_tenant(scx, + securattr); + if (uid) + perm = 0700; + } else + uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); +#endif + gid = ntfs_find_group(scx->mapping[MAPGROUPS],gsid); + if (pxdesc->tagsset & POSIX_ACL_EXTENSIONS) + enter_cache(scx, ni, uid, + gid, pxdesc); + } + free(securattr); + } else + pxdesc = (struct POSIX_SECURITY*)NULL; + } + + if (pxdesc) { + if (ntfs_valid_posix(pxdesc)) { + if (!strcmp(name,"system.posix_acl_default")) { + if (ni->mrec->flags + & MFT_RECORD_IS_DIRECTORY) + outsize = sizeof(struct POSIX_ACL) + + pxdesc->defcnt*sizeof(struct POSIX_ACE); + else { + /* + * getting default ACL from plain file : + * return EACCES if size > 0 as + * indicated in the man, but return ok + * if size == 0, so that ls does not + * display an error + */ + if (size > 0) { + outsize = 0; + errno = EACCES; + } else + outsize = sizeof(struct POSIX_ACL); + } + if (outsize && (outsize <= size)) { + memcpy(value,&pxdesc->acl,sizeof(struct POSIX_ACL)); + memcpy(&value[sizeof(struct POSIX_ACL)], + &pxdesc->acl.ace[pxdesc->firstdef], + outsize-sizeof(struct POSIX_ACL)); + } + } else { + outsize = sizeof(struct POSIX_ACL) + + pxdesc->acccnt*sizeof(struct POSIX_ACE); + if (outsize <= size) + memcpy(value,&pxdesc->acl,outsize); + } + } else { + outsize = 0; + errno = EIO; + ntfs_log_error("Invalid Posix ACL built\n"); + } + if (!cached) + free(pxdesc); + } else + outsize = 0; + } + return (outsize ? (int)outsize : -errno); +} + +#else /* POSIXACLS */ + + +/* + * Get permissions to access a file + * Takes into account the relation of user to file (owner, group, ...) + * Do no use as mode of the file + * + * returns -1 if there is a problem + */ + +static int ntfs_get_perm(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, mode_t request) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const struct CACHED_PERMISSIONS *cached; + char *securattr; + const SID *usid; /* owner of file/directory */ + const SID *gsid; /* group of file/directory */ + BOOL isdir; + uid_t uid; + gid_t gid; + int perm; + + if (!scx->mapping[MAPUSERS] || (!scx->uid && !(request & S_IEXEC))) + perm = 07777; + else { + /* check whether available in cache */ + cached = fetch_cache(scx,ni); + if (cached) { + perm = cached->mode; + uid = cached->uid; + gid = cached->gid; + } else { + perm = 0; /* default to no permission */ + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + != const_cpu_to_le16(0); + securattr = getsecurityattr(scx->vol, ni); + if (securattr) { + phead = (const SECURITY_DESCRIPTOR_RELATIVE*) + securattr; + gsid = (const SID*)& + securattr[le32_to_cpu(phead->group)]; + gid = ntfs_find_group(scx->mapping[MAPGROUPS],gsid); +#if OWNERFROMACL + usid = ntfs_acl_owner(securattr); + perm = ntfs_build_permissions(securattr, + usid, gsid, isdir); + uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); +#else + usid = (const SID*)& + securattr[le32_to_cpu(phead->owner)]; + perm = ntfs_build_permissions(securattr, + usid, gsid, isdir); + if (!perm && ntfs_same_sid(usid, adminsid)) { + uid = find_tenant(scx, securattr); + if (uid) + perm = 0700; + } else + uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); +#endif + /* + * Create a security id if there were none + * and upgrade option is selected + */ + if (!test_nino_flag(ni, v3_Extensions) + && (perm >= 0) + && (scx->vol->secure_flags + & (1 << SECURITY_ADDSECURIDS))) { + upgrade_secur_desc(scx->vol, + securattr, ni); + /* + * fetch owner and group for cacheing + * if there is a securid + */ + } + if (test_nino_flag(ni, v3_Extensions) + && (perm >= 0)) { + enter_cache(scx, ni, uid, + gid, perm); + } + free(securattr); + } else { + perm = -1; + uid = gid = 0; + } + } + if (perm >= 0) { + if (!scx->uid) { + /* root access and execution */ + if (perm & 0111) + perm = 07777; + else + perm = 0; + } else + if (uid == scx->uid) + perm &= 07700; + else + /* + * avoid checking group membership + * when the requested perms for group + * are the same as perms for other + */ + if ((gid == scx->gid) + || ((((perm >> 3) ^ perm) + & (request >> 6) & 7) + && groupmember(scx, scx->uid, gid))) + perm &= 07070; + else + perm &= 07007; + } + } + return (perm); +} + +#endif /* POSIXACLS */ + +/* + * Get an NTFS ACL + * + * Returns size or -errno if there is a problem + * if size was too small, no copy is done and errno is not set, + * the caller is expected to issue a new call + */ + +int ntfs_get_ntfs_acl(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + char *value, size_t size) +{ + char *securattr; + size_t outsize; + + outsize = 0; /* default to no data and no error */ + securattr = getsecurityattr(scx->vol, ni); + if (securattr) { + outsize = ntfs_attr_size(securattr); + if (outsize <= size) { + memcpy(value,securattr,outsize); + } + free(securattr); + } + return (outsize ? (int)outsize : -errno); +} + +/* + * Get owner, group and permissions in an stat structure + * returns permissions, or -1 if there is a problem + */ + +int ntfs_get_owner_mode(struct SECURITY_CONTEXT *scx, + ntfs_inode * ni, struct stat *stbuf) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + char *securattr; + const SID *usid; /* owner of file/directory */ + const SID *gsid; /* group of file/directory */ + const struct CACHED_PERMISSIONS *cached; + int perm; + BOOL isdir; +#if POSIXACLS + struct POSIX_SECURITY *pxdesc; +#endif + + if (!scx->mapping[MAPUSERS]) + perm = 07777; + else { + /* check whether available in cache */ + cached = fetch_cache(scx,ni); + if (cached) { + perm = cached->mode; + stbuf->st_uid = cached->uid; + stbuf->st_gid = cached->gid; + stbuf->st_mode = (stbuf->st_mode & ~07777) + perm; + } else { + perm = -1; /* default to error */ + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + != const_cpu_to_le16(0); + securattr = getsecurityattr(scx->vol, ni); + if (securattr) { + phead = + (const SECURITY_DESCRIPTOR_RELATIVE*) + securattr; + gsid = (const SID*)& + securattr[le32_to_cpu(phead->group)]; +#if OWNERFROMACL + usid = ntfs_acl_owner(securattr); +#else + usid = (const SID*)& + securattr[le32_to_cpu(phead->owner)]; +#endif +#if POSIXACLS + pxdesc = ntfs_build_permissions_posix(scx->mapping, securattr, + usid, gsid, isdir); + if (pxdesc) + perm = pxdesc->mode & 07777; + else + perm = -1; +#else + perm = ntfs_build_permissions(securattr, + usid, gsid, isdir); +#endif + /* + * fetch owner and group for cacheing + */ + if (perm >= 0) { + /* + * Create a security id if there were none + * and upgrade option is selected + */ + if (!test_nino_flag(ni, v3_Extensions) + && (scx->vol->secure_flags + & (1 << SECURITY_ADDSECURIDS))) { + upgrade_secur_desc(scx->vol, + securattr, ni); + } +#if OWNERFROMACL + stbuf->st_uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); +#else + if (!perm && ntfs_same_sid(usid, adminsid)) { + stbuf->st_uid = + find_tenant(scx, + securattr); + if (stbuf->st_uid) + perm = 0700; + } else + stbuf->st_uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); +#endif + stbuf->st_gid = ntfs_find_group(scx->mapping[MAPGROUPS],gsid); + stbuf->st_mode = + (stbuf->st_mode & ~07777) + perm; +#if POSIXACLS + enter_cache(scx, ni, stbuf->st_uid, + stbuf->st_gid, pxdesc); + free(pxdesc); +#else + enter_cache(scx, ni, stbuf->st_uid, + stbuf->st_gid, perm); +#endif + } + free(securattr); + } + } + } + return (perm); +} + +#if POSIXACLS + +/* + * Get the base for a Posix inheritance and + * build an inherited Posix descriptor + */ + +static struct POSIX_SECURITY *inherit_posix(struct SECURITY_CONTEXT *scx, + ntfs_inode *dir_ni, mode_t mode, BOOL isdir) +{ + const struct CACHED_PERMISSIONS *cached; + const SECURITY_DESCRIPTOR_RELATIVE *phead; + struct POSIX_SECURITY *pxdesc; + struct POSIX_SECURITY *pydesc; + char *securattr; + const SID *usid; + const SID *gsid; + uid_t uid; + gid_t gid; + + pydesc = (struct POSIX_SECURITY*)NULL; + /* check whether parent directory is available in cache */ + cached = fetch_cache(scx,dir_ni); + if (cached) { + uid = cached->uid; + gid = cached->gid; + pxdesc = cached->pxdesc; + if (pxdesc) { + pydesc = ntfs_build_inherited_posix(pxdesc,mode, + scx->umask,isdir); + } + } else { + securattr = getsecurityattr(scx->vol, dir_ni); + if (securattr) { + phead = (const SECURITY_DESCRIPTOR_RELATIVE*) + securattr; + gsid = (const SID*)& + securattr[le32_to_cpu(phead->group)]; + gid = ntfs_find_group(scx->mapping[MAPGROUPS],gsid); +#if OWNERFROMACL + usid = ntfs_acl_owner(securattr); + pxdesc = ntfs_build_permissions_posix(scx->mapping,securattr, + usid, gsid, TRUE); + uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); +#else + usid = (const SID*)& + securattr[le32_to_cpu(phead->owner)]; + pxdesc = ntfs_build_permissions_posix(scx->mapping,securattr, + usid, gsid, TRUE); + if (pxdesc && ntfs_same_sid(usid, adminsid)) { + uid = find_tenant(scx, securattr); + } else + uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); +#endif + if (pxdesc) { + /* + * Create a security id if there were none + * and upgrade option is selected + */ + if (!test_nino_flag(dir_ni, v3_Extensions) + && (scx->vol->secure_flags + & (1 << SECURITY_ADDSECURIDS))) { + upgrade_secur_desc(scx->vol, + securattr, dir_ni); + /* + * fetch owner and group for cacheing + * if there is a securid + */ + } + if (test_nino_flag(dir_ni, v3_Extensions)) { + enter_cache(scx, dir_ni, uid, + gid, pxdesc); + } + pydesc = ntfs_build_inherited_posix(pxdesc, + mode, scx->umask, isdir); + free(pxdesc); + } + free(securattr); + } + } + return (pydesc); +} + +/* + * Allocate a security_id for a file being created + * + * Returns zero if not possible (NTFS v3.x required) + */ + +le32 ntfs_alloc_securid(struct SECURITY_CONTEXT *scx, + uid_t uid, gid_t gid, ntfs_inode *dir_ni, + mode_t mode, BOOL isdir) +{ +#if !FORCE_FORMAT_v1x + const struct CACHED_SECURID *cached; + struct CACHED_SECURID wanted; + struct POSIX_SECURITY *pxdesc; + char *newattr; + int newattrsz; + const SID *usid; + const SID *gsid; + BIGSID defusid; + BIGSID defgsid; + le32 securid; +#endif + + securid = const_cpu_to_le32(0); + +#if !FORCE_FORMAT_v1x + + pxdesc = inherit_posix(scx, dir_ni, mode, isdir); + if (pxdesc) { + /* check whether target securid is known in cache */ + + wanted.uid = uid; + wanted.gid = gid; + wanted.dmode = pxdesc->mode & mode & 07777; + if (isdir) wanted.dmode |= 0x10000; + wanted.variable = (void*)pxdesc; + wanted.varsize = sizeof(struct POSIX_SECURITY) + + (pxdesc->acccnt + pxdesc->defcnt)*sizeof(struct POSIX_ACE); + cached = (const struct CACHED_SECURID*)ntfs_fetch_cache( + scx->vol->securid_cache, GENERIC(&wanted), + (cache_compare)compare); + /* quite simple, if we are lucky */ + if (cached) + securid = cached->securid; + + /* not in cache : make sure we can create ids */ + + if (!cached && (scx->vol->major_ver >= 3)) { + usid = ntfs_find_usid(scx->mapping[MAPUSERS],uid,(SID*)&defusid); + gsid = ntfs_find_gsid(scx->mapping[MAPGROUPS],gid,(SID*)&defgsid); + if (!usid || !gsid) { + ntfs_log_error("File created by an unmapped user/group %d/%d\n", + (int)uid, (int)gid); + usid = gsid = adminsid; + } + newattr = ntfs_build_descr_posix(scx->mapping, pxdesc, + isdir, usid, gsid); + if (newattr) { + newattrsz = ntfs_attr_size(newattr); + securid = setsecurityattr(scx->vol, + (const SECURITY_DESCRIPTOR_RELATIVE*)newattr, + newattrsz); + if (securid) { + /* update cache, for subsequent use */ + wanted.securid = securid; + ntfs_enter_cache(scx->vol->securid_cache, + GENERIC(&wanted), + (cache_compare)compare); + } + free(newattr); + } else { + /* + * could not build new security attribute + * errno set by ntfs_build_descr() + */ + } + } + free(pxdesc); + } +#endif + return (securid); +} + +/* + * Apply Posix inheritance to a newly created file + * (for NTFS 1.x only : no securid) + */ + +int ntfs_set_inherited_posix(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, uid_t uid, gid_t gid, + ntfs_inode *dir_ni, mode_t mode) +{ + struct POSIX_SECURITY *pxdesc; + char *newattr; + const SID *usid; + const SID *gsid; + BIGSID defusid; + BIGSID defgsid; + BOOL isdir; + int res; + + res = -1; + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) != const_cpu_to_le16(0); + pxdesc = inherit_posix(scx, dir_ni, mode, isdir); + if (pxdesc) { + usid = ntfs_find_usid(scx->mapping[MAPUSERS],uid,(SID*)&defusid); + gsid = ntfs_find_gsid(scx->mapping[MAPGROUPS],gid,(SID*)&defgsid); + if (!usid || !gsid) { + ntfs_log_error("File created by an unmapped user/group %d/%d\n", + (int)uid, (int)gid); + usid = gsid = adminsid; + } + newattr = ntfs_build_descr_posix(scx->mapping, pxdesc, + isdir, usid, gsid); + if (newattr) { + /* Adjust Windows read-only flag */ + res = update_secur_descr(scx->vol, newattr, ni); + if (!res && !isdir) { + if (mode & S_IWUSR) + ni->flags &= ~FILE_ATTR_READONLY; + else + ni->flags |= FILE_ATTR_READONLY; + } +#if CACHE_LEGACY_SIZE + /* also invalidate legacy cache */ + if (isdir && !ni->security_id) { + struct CACHED_PERMISSIONS_LEGACY legacy; + + legacy.mft_no = ni->mft_no; + legacy.variable = pxdesc; + legacy.varsize = sizeof(struct POSIX_SECURITY) + + (pxdesc->acccnt + pxdesc->defcnt)*sizeof(struct POSIX_ACE); + ntfs_invalidate_cache(scx->vol->legacy_cache, + GENERIC(&legacy), + (cache_compare)leg_compare,0); + } +#endif + free(newattr); + + } else { + /* + * could not build new security attribute + * errno set by ntfs_build_descr() + */ + } + } + return (res); +} + +#else + +le32 ntfs_alloc_securid(struct SECURITY_CONTEXT *scx, + uid_t uid, gid_t gid, mode_t mode, BOOL isdir) +{ +#if !FORCE_FORMAT_v1x + const struct CACHED_SECURID *cached; + struct CACHED_SECURID wanted; + char *newattr; + int newattrsz; + const SID *usid; + const SID *gsid; + BIGSID defusid; + BIGSID defgsid; + le32 securid; +#endif + + securid = const_cpu_to_le32(0); + +#if !FORCE_FORMAT_v1x + /* check whether target securid is known in cache */ + + wanted.uid = uid; + wanted.gid = gid; + wanted.dmode = mode & 07777; + if (isdir) wanted.dmode |= 0x10000; + wanted.variable = (void*)NULL; + wanted.varsize = 0; + cached = (const struct CACHED_SECURID*)ntfs_fetch_cache( + scx->vol->securid_cache, GENERIC(&wanted), + (cache_compare)compare); + /* quite simple, if we are lucky */ + if (cached) + securid = cached->securid; + + /* not in cache : make sure we can create ids */ + + if (!cached && (scx->vol->major_ver >= 3)) { + usid = ntfs_find_usid(scx->mapping[MAPUSERS],uid,(SID*)&defusid); + gsid = ntfs_find_gsid(scx->mapping[MAPGROUPS],gid,(SID*)&defgsid); + if (!usid || !gsid) { + ntfs_log_error("File created by an unmapped user/group %d/%d\n", + (int)uid, (int)gid); + usid = gsid = adminsid; + } + newattr = ntfs_build_descr(mode, isdir, usid, gsid); + if (newattr) { + newattrsz = ntfs_attr_size(newattr); + securid = setsecurityattr(scx->vol, + (const SECURITY_DESCRIPTOR_RELATIVE*)newattr, + newattrsz); + if (securid) { + /* update cache, for subsequent use */ + wanted.securid = securid; + ntfs_enter_cache(scx->vol->securid_cache, + GENERIC(&wanted), + (cache_compare)compare); + } + free(newattr); + } else { + /* + * could not build new security attribute + * errno set by ntfs_build_descr() + */ + } + } +#endif + return (securid); +} + +#endif + +/* + * Update ownership and mode of a file, reusing an existing + * security descriptor when possible + * + * Returns zero if successful + */ + +#if POSIXACLS +int ntfs_set_owner_mode(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + uid_t uid, gid_t gid, mode_t mode, + struct POSIX_SECURITY *pxdesc) +#else +int ntfs_set_owner_mode(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + uid_t uid, gid_t gid, mode_t mode) +#endif +{ + int res; + const struct CACHED_SECURID *cached; + struct CACHED_SECURID wanted; + char *newattr; + const SID *usid; + const SID *gsid; + BIGSID defusid; + BIGSID defgsid; + BOOL isdir; + + res = 0; + + /* check whether target securid is known in cache */ + + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) != const_cpu_to_le16(0); + wanted.uid = uid; + wanted.gid = gid; + wanted.dmode = mode & 07777; + if (isdir) wanted.dmode |= 0x10000; +#if POSIXACLS + wanted.variable = (void*)pxdesc; + if (pxdesc) + wanted.varsize = sizeof(struct POSIX_SECURITY) + + (pxdesc->acccnt + pxdesc->defcnt)*sizeof(struct POSIX_ACE); + else + wanted.varsize = 0; +#else + wanted.variable = (void*)NULL; + wanted.varsize = 0; +#endif + if (test_nino_flag(ni, v3_Extensions)) { + cached = (const struct CACHED_SECURID*)ntfs_fetch_cache( + scx->vol->securid_cache, GENERIC(&wanted), + (cache_compare)compare); + /* quite simple, if we are lucky */ + if (cached) { + ni->security_id = cached->securid; + NInoSetDirty(ni); + } + } else cached = (struct CACHED_SECURID*)NULL; + + if (!cached) { + /* + * Do not use usid and gsid from former attributes, + * but recompute them to get repeatable results + * which can be kept in cache. + */ + usid = ntfs_find_usid(scx->mapping[MAPUSERS],uid,(SID*)&defusid); + gsid = ntfs_find_gsid(scx->mapping[MAPGROUPS],gid,(SID*)&defgsid); + if (!usid || !gsid) { + ntfs_log_error("File made owned by an unmapped user/group %d/%d\n", + uid, gid); + usid = gsid = adminsid; + } +#if POSIXACLS + if (pxdesc) + newattr = ntfs_build_descr_posix(scx->mapping, pxdesc, + isdir, usid, gsid); + else + newattr = ntfs_build_descr(mode, + isdir, usid, gsid); +#else + newattr = ntfs_build_descr(mode, + isdir, usid, gsid); +#endif + if (newattr) { + res = update_secur_descr(scx->vol, newattr, ni); + if (!res) { + /* adjust Windows read-only flag */ + if (!isdir) { + if (mode & S_IWUSR) + ni->flags &= ~FILE_ATTR_READONLY; + else + ni->flags |= FILE_ATTR_READONLY; + NInoFileNameSetDirty(ni); + } + /* update cache, for subsequent use */ + if (test_nino_flag(ni, v3_Extensions)) { + wanted.securid = ni->security_id; + ntfs_enter_cache(scx->vol->securid_cache, + GENERIC(&wanted), + (cache_compare)compare); + } +#if CACHE_LEGACY_SIZE + /* also invalidate legacy cache */ + if (isdir && !ni->security_id) { + struct CACHED_PERMISSIONS_LEGACY legacy; + + legacy.mft_no = ni->mft_no; +#if POSIXACLS + legacy.variable = wanted.variable; + legacy.varsize = wanted.varsize; +#else + legacy.variable = (void*)NULL; + legacy.varsize = 0; +#endif + ntfs_invalidate_cache(scx->vol->legacy_cache, + GENERIC(&legacy), + (cache_compare)leg_compare,0); + } +#endif + } + free(newattr); + } else { + /* + * could not build new security attribute + * errno set by ntfs_build_descr() + */ + res = -1; + } + } + return (res); +} + +/* + * Check whether user has ownership rights on a file + * + * Returns TRUE if allowed + * if not, errno tells why + */ + +BOOL ntfs_allowed_as_owner(struct SECURITY_CONTEXT *scx, ntfs_inode *ni) +{ + const struct CACHED_PERMISSIONS *cached; + char *oldattr; + const SID *usid; + uid_t processuid; + uid_t uid; + BOOL gotowner; + int allowed; + + processuid = scx->uid; +/* TODO : use CAP_FOWNER process capability */ + /* + * Always allow for root + * Also always allow if no mapping has been defined + */ + if (!scx->mapping[MAPUSERS] || !processuid) + allowed = TRUE; + else { + gotowner = FALSE; /* default */ + /* get the owner, either from cache or from old attribute */ + cached = fetch_cache(scx, ni); + if (cached) { + uid = cached->uid; + gotowner = TRUE; + } else { + oldattr = getsecurityattr(scx->vol, ni); + if (oldattr) { +#if OWNERFROMACL + usid = ntfs_acl_owner(oldattr); +#else + const SECURITY_DESCRIPTOR_RELATIVE *phead; + + phead = (const SECURITY_DESCRIPTOR_RELATIVE*) + oldattr; + usid = (const SID*)&oldattr + [le32_to_cpu(phead->owner)]; +#endif + uid = ntfs_find_user(scx->mapping[MAPUSERS], + usid); + gotowner = TRUE; + free(oldattr); + } + } + allowed = FALSE; + if (gotowner) { +/* TODO : use CAP_FOWNER process capability */ + if (!processuid || (processuid == uid)) + allowed = TRUE; + else + errno = EPERM; + } + } + return (allowed); +} + +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +#if POSIXACLS + +/* + * Set a new access or default Posix ACL to a file + * (or remove ACL if no input data) + * Validity of input data is checked after merging + * + * Returns 0, or -1 if there is a problem which errno describes + */ + +int ntfs_set_posix_acl(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + const char *name, const char *value, size_t size, + int flags) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const struct CACHED_PERMISSIONS *cached; + char *oldattr; + uid_t processuid; + const SID *usid; + const SID *gsid; + uid_t uid; + uid_t gid; + int res; + mode_t mode; + BOOL isdir; + BOOL deflt; + BOOL exist; + int count; + struct POSIX_SECURITY *oldpxdesc; + struct POSIX_SECURITY *newpxdesc; + + /* get the current pxsec, either from cache or from old attribute */ + res = -1; + deflt = !strcmp(name,"system.posix_acl_default"); + if (size) + count = (size - sizeof(struct POSIX_ACL)) / sizeof(struct POSIX_ACE); + else + count = 0; + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) != const_cpu_to_le16(0); + newpxdesc = (struct POSIX_SECURITY*)NULL; + if ((!value + || (((const struct POSIX_ACL*)value)->version == POSIX_VERSION)) + && (!deflt || isdir || (!size && !value))) { + cached = fetch_cache(scx, ni); + if (cached) { + uid = cached->uid; + gid = cached->gid; + oldpxdesc = cached->pxdesc; + if (oldpxdesc) { + mode = oldpxdesc->mode; + newpxdesc = ntfs_replace_acl(oldpxdesc, + (const struct POSIX_ACL*)value,count,deflt); + } + } else { + oldattr = getsecurityattr(scx->vol, ni); + if (oldattr) { + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)oldattr; +#if OWNERFROMACL + usid = ntfs_acl_owner(oldattr); +#else + usid = (const SID*)&oldattr[le32_to_cpu(phead->owner)]; +#endif + gsid = (const SID*)&oldattr[le32_to_cpu(phead->group)]; + uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); + gid = ntfs_find_group(scx->mapping[MAPGROUPS],gsid); + oldpxdesc = ntfs_build_permissions_posix(scx->mapping, + oldattr, usid, gsid, isdir); + if (oldpxdesc) { + if (deflt) + exist = oldpxdesc->defcnt > 0; + else + exist = oldpxdesc->acccnt > 3; + if ((exist && (flags & XATTR_CREATE)) + || (!exist && (flags & XATTR_REPLACE))) { + errno = (exist ? EEXIST : ENODATA); + } else { + mode = oldpxdesc->mode; + newpxdesc = ntfs_replace_acl(oldpxdesc, + (const struct POSIX_ACL*)value,count,deflt); + } + free(oldpxdesc); + } + free(oldattr); + } + } + } else + errno = EINVAL; + + if (newpxdesc) { + processuid = scx->uid; +/* TODO : use CAP_FOWNER process capability */ + if (!processuid || (uid == processuid)) { + /* + * clear setgid if file group does + * not match process group + */ + if (processuid && (gid != scx->gid) + && !groupmember(scx, scx->uid, gid)) { + newpxdesc->mode &= ~S_ISGID; + } + res = ntfs_set_owner_mode(scx, ni, uid, gid, + newpxdesc->mode, newpxdesc); + } else + errno = EPERM; + free(newpxdesc); + } + return (res ? -1 : 0); +} + +/* + * Remove a default Posix ACL from a file + * + * Returns 0, or -1 if there is a problem which errno describes + */ + +int ntfs_remove_posix_acl(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + const char *name) +{ + return (ntfs_set_posix_acl(scx, ni, name, + (const char*)NULL, 0, 0)); +} + +#endif + +/* + * Set a new NTFS ACL to a file + * + * Returns 0, or -1 if there is a problem + */ + +int ntfs_set_ntfs_acl(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + const char *value, size_t size, int flags) +{ + char *attr; + int res; + + res = -1; + if ((size > 0) + && !(flags & XATTR_CREATE) + && ntfs_valid_descr(value,size) + && (ntfs_attr_size(value) == size)) { + /* need copying in order to write */ + attr = (char*)ntfs_malloc(size); + if (attr) { + memcpy(attr,value,size); + res = update_secur_descr(scx->vol, attr, ni); + /* + * No need to invalidate standard caches : + * the relation between a securid and + * the associated protection is unchanged, + * only the relation between a file and + * its securid and protection is changed. + */ +#if CACHE_LEGACY_SIZE + /* + * we must however invalidate the legacy + * cache, which is based on inode numbers. + * For safety, invalidate even if updating + * failed. + */ + if ((ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + && !ni->security_id) { + struct CACHED_PERMISSIONS_LEGACY legacy; + + legacy.mft_no = ni->mft_no; + legacy.variable = (char*)NULL; + legacy.varsize = 0; + ntfs_invalidate_cache(scx->vol->legacy_cache, + GENERIC(&legacy), + (cache_compare)leg_compare,0); + } +#endif + free(attr); + } else + errno = ENOMEM; + } else + errno = EINVAL; + return (res ? -1 : 0); +} + +#endif /* HAVE_SETXATTR */ + +/* + * Set new permissions to a file + * Checks user mapping has been defined before request for setting + * + * rejected if request is not originated by owner or root + * + * returns 0 on success + * -1 on failure, with errno = EIO + */ + +int ntfs_set_mode(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, mode_t mode) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const struct CACHED_PERMISSIONS *cached; + char *oldattr; + const SID *usid; + const SID *gsid; + uid_t processuid; + uid_t uid; + uid_t gid; + int res; +#if POSIXACLS + BOOL isdir; + int pxsize; + const struct POSIX_SECURITY *oldpxdesc; + struct POSIX_SECURITY *newpxdesc = (struct POSIX_SECURITY*)NULL; +#endif + + /* get the current owner, either from cache or from old attribute */ + res = 0; + cached = fetch_cache(scx, ni); + if (cached) { + uid = cached->uid; + gid = cached->gid; +#if POSIXACLS + oldpxdesc = cached->pxdesc; + if (oldpxdesc) { + /* must copy before merging */ + pxsize = sizeof(struct POSIX_SECURITY) + + (oldpxdesc->acccnt + oldpxdesc->defcnt)*sizeof(struct POSIX_ACE); + newpxdesc = (struct POSIX_SECURITY*)ntfs_malloc(pxsize); + if (newpxdesc) { + memcpy(newpxdesc, oldpxdesc, pxsize); + if (ntfs_merge_mode_posix(newpxdesc, mode)) + res = -1; + } else + res = -1; + } else + newpxdesc = (struct POSIX_SECURITY*)NULL; +#endif + } else { + oldattr = getsecurityattr(scx->vol, ni); + if (oldattr) { + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)oldattr; +#if OWNERFROMACL + usid = ntfs_acl_owner(oldattr); +#else + usid = (const SID*)&oldattr[le32_to_cpu(phead->owner)]; +#endif + gsid = (const SID*)&oldattr[le32_to_cpu(phead->group)]; + uid = ntfs_find_user(scx->mapping[MAPUSERS],usid); + gid = ntfs_find_group(scx->mapping[MAPGROUPS],gsid); +#if POSIXACLS + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) != const_cpu_to_le16(0); + newpxdesc = ntfs_build_permissions_posix(scx->mapping, + oldattr, usid, gsid, isdir); + if (!newpxdesc || ntfs_merge_mode_posix(newpxdesc, mode)) + res = -1; +#endif + free(oldattr); + } else + res = -1; + } + + if (!res) { + processuid = scx->uid; +/* TODO : use CAP_FOWNER process capability */ + if (!processuid || (uid == processuid)) { + /* + * clear setgid if file group does + * not match process group + */ + if (processuid && (gid != scx->gid) + && !groupmember(scx, scx->uid, gid)) + mode &= ~S_ISGID; +#if POSIXACLS + if (newpxdesc) { + newpxdesc->mode = mode; + res = ntfs_set_owner_mode(scx, ni, uid, gid, + mode, newpxdesc); + } else + res = ntfs_set_owner_mode(scx, ni, uid, gid, + mode, newpxdesc); +#else + res = ntfs_set_owner_mode(scx, ni, uid, gid, mode); +#endif + } else { + errno = EPERM; + res = -1; /* neither owner nor root */ + } + } else { + /* + * Should not happen : a default descriptor is generated + * by getsecurityattr() when there are none + */ + ntfs_log_error("File has no security descriptor\n"); + res = -1; + errno = EIO; + } +#if POSIXACLS + if (newpxdesc) free(newpxdesc); +#endif + return (res ? -1 : 0); +} + +/* + * Create a default security descriptor for files whose descriptor + * cannot be inherited + */ + +int ntfs_sd_add_everyone(ntfs_inode *ni) +{ + /* JPA SECURITY_DESCRIPTOR_ATTR *sd; */ + SECURITY_DESCRIPTOR_RELATIVE *sd; + ACL *acl; + ACCESS_ALLOWED_ACE *ace; + SID *sid; + int ret, sd_len; + + /* Create SECURITY_DESCRIPTOR attribute (everyone has full access). */ + /* + * Calculate security descriptor length. We have 2 sub-authorities in + * owner and group SIDs, but structure SID contain only one, so add + * 4 bytes to every SID. + */ + sd_len = sizeof(SECURITY_DESCRIPTOR_ATTR) + 2 * (sizeof(SID) + 4) + + sizeof(ACL) + sizeof(ACCESS_ALLOWED_ACE); + sd = (SECURITY_DESCRIPTOR_RELATIVE*)ntfs_calloc(sd_len); + if (!sd) + return -1; + + sd->revision = SECURITY_DESCRIPTOR_REVISION; + sd->control = SE_DACL_PRESENT | SE_SELF_RELATIVE; + + sid = (SID*)((u8*)sd + sizeof(SECURITY_DESCRIPTOR_ATTR)); + sid->revision = SID_REVISION; + sid->sub_authority_count = 2; + sid->sub_authority[0] = const_cpu_to_le32(SECURITY_BUILTIN_DOMAIN_RID); + sid->sub_authority[1] = const_cpu_to_le32(DOMAIN_ALIAS_RID_ADMINS); + sid->identifier_authority.value[5] = 5; + sd->owner = cpu_to_le32((u8*)sid - (u8*)sd); + + sid = (SID*)((u8*)sid + sizeof(SID) + 4); + sid->revision = SID_REVISION; + sid->sub_authority_count = 2; + sid->sub_authority[0] = const_cpu_to_le32(SECURITY_BUILTIN_DOMAIN_RID); + sid->sub_authority[1] = const_cpu_to_le32(DOMAIN_ALIAS_RID_ADMINS); + sid->identifier_authority.value[5] = 5; + sd->group = cpu_to_le32((u8*)sid - (u8*)sd); + + acl = (ACL*)((u8*)sid + sizeof(SID) + 4); + acl->revision = ACL_REVISION; + acl->size = const_cpu_to_le16(sizeof(ACL) + sizeof(ACCESS_ALLOWED_ACE)); + acl->ace_count = const_cpu_to_le16(1); + sd->dacl = cpu_to_le32((u8*)acl - (u8*)sd); + + ace = (ACCESS_ALLOWED_ACE*)((u8*)acl + sizeof(ACL)); + ace->type = ACCESS_ALLOWED_ACE_TYPE; + ace->flags = OBJECT_INHERIT_ACE | CONTAINER_INHERIT_ACE; + ace->size = const_cpu_to_le16(sizeof(ACCESS_ALLOWED_ACE)); + ace->mask = const_cpu_to_le32(0x1f01ff); /* FIXME */ + ace->sid.revision = SID_REVISION; + ace->sid.sub_authority_count = 1; + ace->sid.sub_authority[0] = const_cpu_to_le32(0); + ace->sid.identifier_authority.value[5] = 1; + + ret = ntfs_attr_add(ni, AT_SECURITY_DESCRIPTOR, AT_UNNAMED, 0, (u8*)sd, + sd_len); + if (ret) + ntfs_log_perror("Failed to add initial SECURITY_DESCRIPTOR"); + + free(sd); + return ret; +} + +/* + * Check whether user can access a file in a specific way + * + * Returns 1 if access is allowed, including user is root or no + * user mapping defined + * 2 if sticky and accesstype is S_IWRITE + S_IEXEC + S_ISVTX + * 0 and sets errno if there is a problem or if access + * is not allowed + * + * This is used for Posix ACL and checking creation of DOS file names + */ + +int ntfs_allowed_access(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, + int accesstype) /* access type required (S_Ixxx values) */ +{ + int perm; + int res; + int allow; + struct stat stbuf; + + /* + * Always allow for root unless execution is requested. + * (was checked by fuse until kernel 2.6.29) + * Also always allow if no mapping has been defined + */ + if (!scx->mapping[MAPUSERS] + || (!scx->uid + && (!(accesstype & S_IEXEC) + || (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY)))) + allow = 1; + else { + perm = ntfs_get_perm(scx, ni, accesstype); + if (perm >= 0) { + res = EACCES; + switch (accesstype) { + case S_IEXEC: + allow = (perm & (S_IXUSR | S_IXGRP | S_IXOTH)) != 0; + break; + case S_IWRITE: + allow = (perm & (S_IWUSR | S_IWGRP | S_IWOTH)) != 0; + break; + case S_IWRITE + S_IEXEC: + allow = ((perm & (S_IWUSR | S_IWGRP | S_IWOTH)) != 0) + && ((perm & (S_IXUSR | S_IXGRP | S_IXOTH)) != 0); + break; + case S_IREAD: + allow = (perm & (S_IRUSR | S_IRGRP | S_IROTH)) != 0; + break; + case S_IREAD + S_IEXEC: + allow = ((perm & (S_IRUSR | S_IRGRP | S_IROTH)) != 0) + && ((perm & (S_IXUSR | S_IXGRP | S_IXOTH)) != 0); + break; + case S_IREAD + S_IWRITE: + allow = ((perm & (S_IRUSR | S_IRGRP | S_IROTH)) != 0) + && ((perm & (S_IWUSR | S_IWGRP | S_IWOTH)) != 0); + break; + case S_IWRITE + S_IEXEC + S_ISVTX: + if (perm & S_ISVTX) { + if ((ntfs_get_owner_mode(scx,ni,&stbuf) >= 0) + && (stbuf.st_uid == scx->uid)) + allow = 1; + else + allow = 2; + } else + allow = ((perm & (S_IWUSR | S_IWGRP | S_IWOTH)) != 0) + && ((perm & (S_IXUSR | S_IXGRP | S_IXOTH)) != 0); + break; + case S_IREAD + S_IWRITE + S_IEXEC: + allow = ((perm & (S_IRUSR | S_IRGRP | S_IROTH)) != 0) + && ((perm & (S_IWUSR | S_IWGRP | S_IWOTH)) != 0) + && ((perm & (S_IXUSR | S_IXGRP | S_IXOTH)) != 0); + break; + default : + res = EINVAL; + allow = 0; + break; + } + if (!allow) + errno = res; + } else + allow = 0; + } + return (allow); +} + +#if 0 /* not needed any more */ + +/* + * Check whether user can access the parent directory + * of a file in a specific way + * + * Returns true if access is allowed, including user is root and + * no user mapping defined + * + * Sets errno if there is a problem or if not allowed + * + * This is used for Posix ACL and checking creation of DOS file names + */ + +BOOL old_ntfs_allowed_dir_access(struct SECURITY_CONTEXT *scx, + const char *path, int accesstype) +{ + int allow; + char *dirpath; + char *name; + ntfs_inode *ni; + ntfs_inode *dir_ni; + struct stat stbuf; + + allow = 0; + dirpath = strdup(path); + if (dirpath) { + /* the root of file system is seen as a parent of itself */ + /* is that correct ? */ + name = strrchr(dirpath, '/'); + *name = 0; + dir_ni = ntfs_pathname_to_inode(scx->vol, NULL, dirpath); + if (dir_ni) { + allow = ntfs_allowed_access(scx, + dir_ni, accesstype); + ntfs_inode_close(dir_ni); + /* + * for an not-owned sticky directory, have to + * check whether file itself is owned + */ + if ((accesstype == (S_IWRITE + S_IEXEC + S_ISVTX)) + && (allow == 2)) { + ni = ntfs_pathname_to_inode(scx->vol, NULL, + path); + allow = FALSE; + if (ni) { + allow = (ntfs_get_owner_mode(scx,ni,&stbuf) >= 0) + && (stbuf.st_uid == scx->uid); + ntfs_inode_close(ni); + } + } + } + free(dirpath); + } + return (allow); /* errno is set if not allowed */ +} + +#endif + +/* + * Define a new owner/group to a file + * + * returns zero if successful + */ + +int ntfs_set_owner(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + uid_t uid, gid_t gid) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const struct CACHED_PERMISSIONS *cached; + char *oldattr; + const SID *usid; + const SID *gsid; + uid_t fileuid; + uid_t filegid; + mode_t mode; + int perm; + BOOL isdir; + int res; +#if POSIXACLS + struct POSIX_SECURITY *pxdesc; + BOOL pxdescbuilt = FALSE; +#endif + + res = 0; + /* get the current owner and mode from cache or security attributes */ + oldattr = (char*)NULL; + cached = fetch_cache(scx,ni); + if (cached) { + fileuid = cached->uid; + filegid = cached->gid; + mode = cached->mode; +#if POSIXACLS + pxdesc = cached->pxdesc; + if (!pxdesc) + res = -1; +#endif + } else { + fileuid = 0; + filegid = 0; + mode = 0; + oldattr = getsecurityattr(scx->vol, ni); + if (oldattr) { + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + != const_cpu_to_le16(0); + phead = (const SECURITY_DESCRIPTOR_RELATIVE*) + oldattr; + gsid = (const SID*) + &oldattr[le32_to_cpu(phead->group)]; +#if OWNERFROMACL + usid = ntfs_acl_owner(oldattr); +#else + usid = (const SID*) + &oldattr[le32_to_cpu(phead->owner)]; +#endif +#if POSIXACLS + pxdesc = ntfs_build_permissions_posix(scx->mapping, oldattr, + usid, gsid, isdir); + if (pxdesc) { + pxdescbuilt = TRUE; + fileuid = ntfs_find_user(scx->mapping[MAPUSERS],usid); + filegid = ntfs_find_group(scx->mapping[MAPGROUPS],gsid); + mode = perm = pxdesc->mode; + } else + res = -1; +#else + mode = perm = ntfs_build_permissions(oldattr, + usid, gsid, isdir); + if (perm >= 0) { + fileuid = ntfs_find_user(scx->mapping[MAPUSERS],usid); + filegid = ntfs_find_group(scx->mapping[MAPGROUPS],gsid); + } else + res = -1; +#endif + free(oldattr); + } else + res = -1; + } + if (!res) { + /* check requested by root */ + /* or chgrp requested by owner to an owned group */ + if (!scx->uid + || ((((int)uid < 0) || (uid == fileuid)) + && ((gid == scx->gid) || groupmember(scx, scx->uid, gid)) + && (fileuid == scx->uid))) { + /* replace by the new usid and gsid */ + /* or reuse old gid and sid for cacheing */ + if ((int)uid < 0) + uid = fileuid; + if ((int)gid < 0) + gid = filegid; + /* clear setuid and setgid if owner has changed */ + /* unless request originated by root */ + if (uid && (fileuid != uid)) + mode &= 01777; +#if POSIXACLS + res = ntfs_set_owner_mode(scx, ni, uid, gid, + mode, pxdesc); +#else + res = ntfs_set_owner_mode(scx, ni, uid, gid, mode); +#endif + } else { + res = -1; /* neither owner nor root */ + errno = EPERM; + } +#if POSIXACLS + if (pxdescbuilt) + free(pxdesc); +#endif + } else { + /* + * Should not happen : a default descriptor is generated + * by getsecurityattr() when there are none + */ + ntfs_log_error("File has no security descriptor\n"); + res = -1; + errno = EIO; + } + return (res ? -1 : 0); +} + +/* + * Define new owner/group and mode to a file + * + * returns zero if successful + */ + +int ntfs_set_ownmod(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + uid_t uid, gid_t gid, const mode_t mode) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + const struct CACHED_PERMISSIONS *cached; + char *oldattr; + const SID *usid; + const SID *gsid; + uid_t fileuid; + uid_t filegid; + BOOL isdir; + int res; +#if POSIXACLS + const struct POSIX_SECURITY *oldpxdesc; + struct POSIX_SECURITY *newpxdesc = (struct POSIX_SECURITY*)NULL; + int pxsize; +#endif + + res = 0; + /* get the current owner and mode from cache or security attributes */ + oldattr = (char*)NULL; + cached = fetch_cache(scx,ni); + if (cached) { + fileuid = cached->uid; + filegid = cached->gid; +#if POSIXACLS + oldpxdesc = cached->pxdesc; + if (oldpxdesc) { + /* must copy before merging */ + pxsize = sizeof(struct POSIX_SECURITY) + + (oldpxdesc->acccnt + oldpxdesc->defcnt)*sizeof(struct POSIX_ACE); + newpxdesc = (struct POSIX_SECURITY*)ntfs_malloc(pxsize); + if (newpxdesc) { + memcpy(newpxdesc, oldpxdesc, pxsize); + if (ntfs_merge_mode_posix(newpxdesc, mode)) + res = -1; + } else + res = -1; + } +#endif + } else { + fileuid = 0; + filegid = 0; + oldattr = getsecurityattr(scx->vol, ni); + if (oldattr) { + isdir = (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + != const_cpu_to_le16(0); + phead = (const SECURITY_DESCRIPTOR_RELATIVE*) + oldattr; + gsid = (const SID*) + &oldattr[le32_to_cpu(phead->group)]; +#if OWNERFROMACL + usid = ntfs_acl_owner(oldattr); +#else + usid = (const SID*) + &oldattr[le32_to_cpu(phead->owner)]; +#endif +#if POSIXACLS + newpxdesc = ntfs_build_permissions_posix(scx->mapping, oldattr, + usid, gsid, isdir); + if (!newpxdesc || ntfs_merge_mode_posix(newpxdesc, mode)) + res = -1; + else { + fileuid = ntfs_find_user(scx->mapping[MAPUSERS],usid); + filegid = ntfs_find_group(scx->mapping[MAPGROUPS],gsid); + } +#endif + free(oldattr); + } else + res = -1; + } + if (!res) { + /* check requested by root */ + /* or chgrp requested by owner to an owned group */ + if (!scx->uid + || ((((int)uid < 0) || (uid == fileuid)) + && ((gid == scx->gid) || groupmember(scx, scx->uid, gid)) + && (fileuid == scx->uid))) { + /* replace by the new usid and gsid */ + /* or reuse old gid and sid for cacheing */ + if ((int)uid < 0) + uid = fileuid; + if ((int)gid < 0) + gid = filegid; +#if POSIXACLS + res = ntfs_set_owner_mode(scx, ni, uid, gid, + mode, newpxdesc); +#else + res = ntfs_set_owner_mode(scx, ni, uid, gid, mode); +#endif + } else { + res = -1; /* neither owner nor root */ + errno = EPERM; + } + } else { + /* + * Should not happen : a default descriptor is generated + * by getsecurityattr() when there are none + */ + ntfs_log_error("File has no security descriptor\n"); + res = -1; + errno = EIO; + } +#if POSIXACLS + free(newpxdesc); +#endif + return (res ? -1 : 0); +} + +/* + * Build a security id for a descriptor inherited from + * parent directory the Windows way + */ + +static le32 build_inherited_id(struct SECURITY_CONTEXT *scx, + const char *parentattr, BOOL fordir) +{ + const SECURITY_DESCRIPTOR_RELATIVE *pphead; + const ACL *ppacl; + const SID *usid; + const SID *gsid; + BIGSID defusid; + BIGSID defgsid; + int offpacl; + int offowner; + int offgroup; + SECURITY_DESCRIPTOR_RELATIVE *pnhead; + ACL *pnacl; + int parentattrsz; + char *newattr; + int newattrsz; + int aclsz; + int usidsz; + int gsidsz; + int pos; + le32 securid; + + parentattrsz = ntfs_attr_size(parentattr); + pphead = (const SECURITY_DESCRIPTOR_RELATIVE*)parentattr; + if (scx->mapping[MAPUSERS]) { + usid = ntfs_find_usid(scx->mapping[MAPUSERS], scx->uid, (SID*)&defusid); + gsid = ntfs_find_gsid(scx->mapping[MAPGROUPS], scx->gid, (SID*)&defgsid); + if (!usid) + usid = adminsid; + if (!gsid) + gsid = adminsid; + } else { + /* + * If there is no user mapping, we have to copy owner + * and group from parent directory. + * Windows never has to do that, because it can always + * rely on a user mapping + */ + offowner = le32_to_cpu(pphead->owner); + usid = (const SID*)&parentattr[offowner]; + offgroup = le32_to_cpu(pphead->group); + gsid = (const SID*)&parentattr[offgroup]; + } + /* + * new attribute is smaller than parent's + * except for differences in SIDs which appear in + * owner, group and possible grants and denials in + * generic creator-owner and creator-group ACEs. + * For directories, an ACE may be duplicated for + * access and inheritance, so we double the count. + */ + usidsz = ntfs_sid_size(usid); + gsidsz = ntfs_sid_size(gsid); + newattrsz = parentattrsz + 3*usidsz + 3*gsidsz; + if (fordir) + newattrsz *= 2; + newattr = (char*)ntfs_malloc(newattrsz); + if (newattr) { + pnhead = (SECURITY_DESCRIPTOR_RELATIVE*)newattr; + pnhead->revision = SECURITY_DESCRIPTOR_REVISION; + pnhead->alignment = 0; + pnhead->control = SE_SELF_RELATIVE; + pos = sizeof(SECURITY_DESCRIPTOR_RELATIVE); + /* + * locate and inherit DACL + * do not test SE_DACL_PRESENT (wrong for "DR Watson") + */ + pnhead->dacl = const_cpu_to_le32(0); + if (pphead->dacl) { + offpacl = le32_to_cpu(pphead->dacl); + ppacl = (const ACL*)&parentattr[offpacl]; + pnacl = (ACL*)&newattr[pos]; + aclsz = ntfs_inherit_acl(ppacl, pnacl, usid, gsid, fordir); + if (aclsz) { + pnhead->dacl = cpu_to_le32(pos); + pos += aclsz; + pnhead->control |= SE_DACL_PRESENT; + } + } + /* + * locate and inherit SACL + */ + pnhead->sacl = const_cpu_to_le32(0); + if (pphead->sacl) { + offpacl = le32_to_cpu(pphead->sacl); + ppacl = (const ACL*)&parentattr[offpacl]; + pnacl = (ACL*)&newattr[pos]; + aclsz = ntfs_inherit_acl(ppacl, pnacl, usid, gsid, fordir); + if (aclsz) { + pnhead->sacl = cpu_to_le32(pos); + pos += aclsz; + pnhead->control |= SE_SACL_PRESENT; + } + } + /* + * inherit or redefine owner + */ + memcpy(&newattr[pos],usid,usidsz); + pnhead->owner = cpu_to_le32(pos); + pos += usidsz; + /* + * inherit or redefine group + */ + memcpy(&newattr[pos],gsid,gsidsz); + pnhead->group = cpu_to_le32(pos); + pos += usidsz; + securid = setsecurityattr(scx->vol, + (SECURITY_DESCRIPTOR_RELATIVE*)newattr, pos); + free(newattr); + } else + securid = const_cpu_to_le32(0); + return (securid); +} + +/* + * Get an inherited security id + * + * For Windows compatibility, the normal initial permission setting + * may be inherited from the parent directory instead of being + * defined by the creation arguments. + * + * The following creates an inherited id for that purpose. + * + * Note : the owner and group of parent directory are also + * inherited (which is not the case on Windows) if no user mapping + * is defined. + * + * Returns the inherited id, or zero if not possible (eg on NTFS 1.x) + */ + +le32 ntfs_inherited_id(struct SECURITY_CONTEXT *scx, + ntfs_inode *dir_ni, BOOL fordir) +{ + struct CACHED_PERMISSIONS *cached; + char *parentattr; + le32 securid; + + securid = const_cpu_to_le32(0); + cached = (struct CACHED_PERMISSIONS*)NULL; + /* + * Try to get inherited id from cache + */ + if (test_nino_flag(dir_ni, v3_Extensions) + && dir_ni->security_id) { + cached = fetch_cache(scx, dir_ni); + if (cached) + securid = (fordir ? cached->inh_dirid + : cached->inh_fileid); + } + /* + * Not cached or not available in cache, compute it all + * Note : if parent directory has no id, it is not cacheable + */ + if (!securid) { + parentattr = getsecurityattr(scx->vol, dir_ni); + if (parentattr) { + securid = build_inherited_id(scx, + parentattr, fordir); + free(parentattr); + /* + * Store the result into cache for further use + */ + if (securid) { + cached = fetch_cache(scx, dir_ni); + if (cached) { + if (fordir) + cached->inh_dirid = securid; + else + cached->inh_fileid = securid; + } + } + } + } + return (securid); +} + +/* + * Link a group to a member of group + * + * Returns 0 if OK, -1 (and errno set) if error + */ + +static int link_single_group(struct MAPPING *usermapping, struct passwd *user, + gid_t gid) +{ + struct group *group; + char **grmem; + int grcnt; + gid_t *groups; + int res; + + res = 0; + group = getgrgid(gid); + if (group && group->gr_mem) { + grcnt = usermapping->grcnt; + groups = usermapping->groups; + grmem = group->gr_mem; + while (*grmem && strcmp(user->pw_name, *grmem)) + grmem++; + if (*grmem) { + if (!grcnt) + groups = (gid_t*)ntfs_malloc(sizeof(gid_t)); + else + groups = (gid_t*)MEM2_realloc(groups, + (grcnt+1)*sizeof(gid_t)); + if (groups) + groups[grcnt++] = gid; + else { + res = -1; + errno = ENOMEM; + } + } + usermapping->grcnt = grcnt; + usermapping->groups = groups; + } + return (res); +} + + +/* + * Statically link group to users + * This is based on groups defined in /etc/group and does not take + * the groups dynamically set by setgroups() nor any changes in + * /etc/group into account + * + * Only mapped groups and root group are linked to mapped users + * + * Returns 0 if OK, -1 (and errno set) if error + * + */ + +static int link_group_members(struct SECURITY_CONTEXT *scx) +{ + struct MAPPING *usermapping; + struct MAPPING *groupmapping; + struct passwd *user; + int res; + + res = 0; + for (usermapping=scx->mapping[MAPUSERS]; usermapping && !res; + usermapping=usermapping->next) { + usermapping->grcnt = 0; + usermapping->groups = (gid_t*)NULL; + user = getpwuid(usermapping->xid); + if (user && user->pw_name) { + for (groupmapping=scx->mapping[MAPGROUPS]; + groupmapping && !res; + groupmapping=groupmapping->next) { + if (link_single_group(usermapping, user, + groupmapping->xid)) + res = -1; + } + if (!res && link_single_group(usermapping, + user, (gid_t)0)) + res = -1; + } + } + return (res); +} + +/* + * Apply default single user mapping + * returns zero if successful + */ + +static int ntfs_do_default_mapping(struct SECURITY_CONTEXT *scx, + uid_t uid, gid_t gid, const SID *usid) +{ + struct MAPPING *usermapping; + struct MAPPING *groupmapping; + SID *sid; + int sidsz; + int res; + + res = -1; + sidsz = ntfs_sid_size(usid); + sid = (SID*)ntfs_malloc(sidsz); + if (sid) { + memcpy(sid,usid,sidsz); + usermapping = (struct MAPPING*)ntfs_malloc(sizeof(struct MAPPING)); + if (usermapping) { + groupmapping = (struct MAPPING*)ntfs_malloc(sizeof(struct MAPPING)); + if (groupmapping) { + usermapping->sid = sid; + usermapping->xid = uid; + usermapping->next = (struct MAPPING*)NULL; + groupmapping->sid = sid; + groupmapping->xid = gid; + groupmapping->next = (struct MAPPING*)NULL; + scx->mapping[MAPUSERS] = usermapping; + scx->mapping[MAPGROUPS] = groupmapping; + res = 0; + } + } + } + return (res); +} + +/* + * Make sure there are no ambiguous mapping + * Ambiguous mapping may lead to undesired configurations and + * we had rather be safe until the consequences are understood + */ + +#if 0 /* not activated for now */ + +static BOOL check_mapping(const struct MAPPING *usermapping, + const struct MAPPING *groupmapping) +{ + const struct MAPPING *mapping1; + const struct MAPPING *mapping2; + BOOL ambiguous; + + ambiguous = FALSE; + for (mapping1=usermapping; mapping1; mapping1=mapping1->next) + for (mapping2=mapping1->next; mapping2; mapping1=mapping2->next) + if (ntfs_same_sid(mapping1->sid,mapping2->sid)) { + if (mapping1->xid != mapping2->xid) + ambiguous = TRUE; + } else { + if (mapping1->xid == mapping2->xid) + ambiguous = TRUE; + } + for (mapping1=groupmapping; mapping1; mapping1=mapping1->next) + for (mapping2=mapping1->next; mapping2; mapping1=mapping2->next) + if (ntfs_same_sid(mapping1->sid,mapping2->sid)) { + if (mapping1->xid != mapping2->xid) + ambiguous = TRUE; + } else { + if (mapping1->xid == mapping2->xid) + ambiguous = TRUE; + } + return (ambiguous); +} + +#endif + +#if 0 /* not used any more */ + +/* + * Try and apply default single user mapping + * returns zero if successful + */ + +static int ntfs_default_mapping(struct SECURITY_CONTEXT *scx) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + ntfs_inode *ni; + char *securattr; + const SID *usid; + int res; + + res = -1; + ni = ntfs_pathname_to_inode(scx->vol, NULL, "/."); + if (ni) { + securattr = getsecurityattr(scx->vol, ni); + if (securattr) { + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)securattr; + usid = (SID*)&securattr[le32_to_cpu(phead->owner)]; + if (ntfs_is_user_sid(usid)) + res = ntfs_do_default_mapping(scx, + scx->uid, scx->gid, usid); + free(securattr); + } + ntfs_inode_close(ni); + } + return (res); +} + +#endif + +/* + * Basic read from a user mapping file on another volume + */ + +static int basicread(void *fileid, char *buf, size_t size, off_t offs __attribute__((unused))) +{ + return (read(*(int*)fileid, buf, size)); +} + + +/* + * Read from a user mapping file on current NTFS partition + */ + +static int localread(void *fileid, char *buf, size_t size, off_t offs) +{ + return (ntfs_attr_data_read((ntfs_inode*)fileid, + AT_UNNAMED, 0, buf, size, offs)); +} + +/* + * Build the user mapping + * - according to a mapping file if defined (or default present), + * - or try default single user mapping if possible + * + * The mapping is specific to a mounted device + * No locking done, mounting assumed non multithreaded + * + * returns zero if mapping is successful + * (failure should not be interpreted as an error) + */ + +int ntfs_build_mapping(struct SECURITY_CONTEXT *scx, const char *usermap_path, + BOOL allowdef) +{ + struct MAPLIST *item; + struct MAPLIST *firstitem; + struct MAPPING *usermapping; + struct MAPPING *groupmapping; + ntfs_inode *ni; + int fd; + static struct { + u8 revision; + u8 levels; + be16 highbase; + be32 lowbase; + le32 level1; + le32 level2; + le32 level3; + le32 level4; + le32 level5; + } defmap = { + 1, 5, const_cpu_to_be16(0), const_cpu_to_be32(5), + const_cpu_to_le32(21), + const_cpu_to_le32(DEFSECAUTH1), const_cpu_to_le32(DEFSECAUTH2), + const_cpu_to_le32(DEFSECAUTH3), const_cpu_to_le32(DEFSECBASE) + } ; + + /* be sure not to map anything until done */ + scx->mapping[MAPUSERS] = (struct MAPPING*)NULL; + scx->mapping[MAPGROUPS] = (struct MAPPING*)NULL; + + if (!usermap_path) usermap_path = MAPPINGFILE; + if (usermap_path[0] == '/') { + fd = open(usermap_path,O_RDONLY); + if (fd > 0) { + firstitem = ntfs_read_mapping(basicread, (void*)&fd); + close(fd); + } else + firstitem = (struct MAPLIST*)NULL; + } else { + ni = ntfs_pathname_to_inode(scx->vol, NULL, usermap_path); + if (ni) { + firstitem = ntfs_read_mapping(localread, ni); + ntfs_inode_close(ni); + } else + firstitem = (struct MAPLIST*)NULL; + } + + + if (firstitem) { + usermapping = ntfs_do_user_mapping(firstitem); + groupmapping = ntfs_do_group_mapping(firstitem); + if (usermapping && groupmapping) { + scx->mapping[MAPUSERS] = usermapping; + scx->mapping[MAPGROUPS] = groupmapping; + } else + ntfs_log_error("There were no valid user or no valid group\n"); + /* now we can free the memory copy of input text */ + /* and rely on internal representation */ + while (firstitem) { + item = firstitem->next; + free(firstitem); + firstitem = item; + } + } else { + /* no mapping file, try a default mapping */ + if (allowdef) { + if (!ntfs_do_default_mapping(scx, + 0, 0, (const SID*)&defmap)) + ntfs_log_info("Using default user mapping\n"); + } + } + return (!scx->mapping[MAPUSERS] || link_group_members(scx)); +} + +#ifdef HAVE_SETXATTR /* extended attributes interface required */ + +/* + * Get the ntfs attribute into an extended attribute + * The attribute is returned according to cpu endianness + */ + +int ntfs_get_ntfs_attrib(ntfs_inode *ni, char *value, size_t size) +{ + u32 attrib; + size_t outsize; + + outsize = 0; /* default to no data and no error */ + if (ni) { + attrib = le32_to_cpu(ni->flags); + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + attrib |= const_le32_to_cpu(FILE_ATTR_DIRECTORY); + else + attrib &= ~const_le32_to_cpu(FILE_ATTR_DIRECTORY); + if (!attrib) + attrib |= const_le32_to_cpu(FILE_ATTR_NORMAL); + outsize = sizeof(FILE_ATTR_FLAGS); + if (size >= outsize) { + if (value) + memcpy(value,&attrib,outsize); + else + errno = EINVAL; + } + } + return (outsize ? (int)outsize : -errno); +} + +/* + * Return the ntfs attribute into an extended attribute + * The attribute is expected according to cpu endianness + * + * Returns 0, or -1 if there is a problem + */ + +int ntfs_set_ntfs_attrib(ntfs_inode *ni, + const char *value, size_t size, int flags) +{ + u32 attrib; + le32 settable; + ATTR_FLAGS dirflags; + int res; + + res = -1; + if (ni && value && (size >= sizeof(FILE_ATTR_FLAGS))) { + if (!(flags & XATTR_CREATE)) { + /* copy to avoid alignment problems */ + memcpy(&attrib,value,sizeof(FILE_ATTR_FLAGS)); + settable = FILE_ATTR_SETTABLE; + res = 0; + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) { + /* + * Accept changing compression for a directory + * and set index root accordingly + */ + settable |= FILE_ATTR_COMPRESSED; + if ((ni->flags ^ cpu_to_le32(attrib)) + & FILE_ATTR_COMPRESSED) { + if (ni->flags & FILE_ATTR_COMPRESSED) + dirflags = const_cpu_to_le16(0); + else + dirflags = ATTR_IS_COMPRESSED; + res = ntfs_attr_set_flags(ni, + AT_INDEX_ROOT, + NTFS_INDEX_I30, 4, + dirflags, + ATTR_COMPRESSION_MASK); + } + } + if (!res) { + ni->flags = (ni->flags & ~settable) + | (cpu_to_le32(attrib) & settable); + NInoFileNameSetDirty(ni); + NInoSetDirty(ni); + } + } else + errno = EEXIST; + } else + errno = EINVAL; + return (res ? -1 : 0); +} + +#endif /* HAVE_SETXATTR */ + +/* + * Open $Secure once for all + * returns zero if it succeeds + * non-zero if it fails. This is not an error (on NTFS v1.x) + */ + + +int ntfs_open_secure(ntfs_volume *vol) +{ + ntfs_inode *ni; + int res; + + res = -1; + vol->secure_ni = (ntfs_inode*)NULL; + vol->secure_xsii = (ntfs_index_context*)NULL; + vol->secure_xsdh = (ntfs_index_context*)NULL; + if (vol->major_ver >= 3) { + /* make sure this is a genuine $Secure inode 9 */ + ni = ntfs_pathname_to_inode(vol, NULL, "$Secure"); + if (ni && (ni->mft_no == 9)) { + vol->secure_reentry = 0; + vol->secure_xsii = ntfs_index_ctx_get(ni, + sii_stream, 4); + vol->secure_xsdh = ntfs_index_ctx_get(ni, + sdh_stream, 4); + if (ni && vol->secure_xsii && vol->secure_xsdh) { + vol->secure_ni = ni; + res = 0; + } + } + } + return (res); +} + +/* + * Final cleaning + * Allocated memory is freed to facilitate the detection of memory leaks + */ + +void ntfs_close_secure(struct SECURITY_CONTEXT *scx) +{ + ntfs_volume *vol; + + vol = scx->vol; + if (vol->secure_ni) { + ntfs_index_ctx_put(vol->secure_xsii); + ntfs_index_ctx_put(vol->secure_xsdh); + ntfs_inode_close(vol->secure_ni); + + } + ntfs_free_mapping(scx->mapping); + free_caches(scx); +} + +/* + * API for direct access to security descriptors + * based on Win32 API + */ + + +/* + * Selective feeding of a security descriptor into user buffer + * + * Returns TRUE if successful + */ + +static BOOL feedsecurityattr(const char *attr, u32 selection, + char *buf, u32 buflen, u32 *psize) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + SECURITY_DESCRIPTOR_RELATIVE *pnhead; + const ACL *pdacl; + const ACL *psacl; + const SID *pusid; + const SID *pgsid; + unsigned int offdacl; + unsigned int offsacl; + unsigned int offowner; + unsigned int offgroup; + unsigned int daclsz; + unsigned int saclsz; + unsigned int usidsz; + unsigned int gsidsz; + unsigned int size; /* size of requested attributes */ + BOOL ok; + unsigned int pos; + unsigned int avail; + le16 control; + + avail = 0; + control = SE_SELF_RELATIVE; + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)attr; + size = sizeof(SECURITY_DESCRIPTOR_RELATIVE); + + /* locate DACL if requested and available */ + if (phead->dacl && (selection & DACL_SECURITY_INFORMATION)) { + offdacl = le32_to_cpu(phead->dacl); + pdacl = (const ACL*)&attr[offdacl]; + daclsz = le16_to_cpu(pdacl->size); + size += daclsz; + avail |= DACL_SECURITY_INFORMATION; + } else + offdacl = daclsz = 0; + + /* locate owner if requested and available */ + offowner = le32_to_cpu(phead->owner); + if (offowner && (selection & OWNER_SECURITY_INFORMATION)) { + /* find end of USID */ + pusid = (const SID*)&attr[offowner]; + usidsz = ntfs_sid_size(pusid); + size += usidsz; + avail |= OWNER_SECURITY_INFORMATION; + } else + offowner = usidsz = 0; + + /* locate group if requested and available */ + offgroup = le32_to_cpu(phead->group); + if (offgroup && (selection & GROUP_SECURITY_INFORMATION)) { + /* find end of GSID */ + pgsid = (const SID*)&attr[offgroup]; + gsidsz = ntfs_sid_size(pgsid); + size += gsidsz; + avail |= GROUP_SECURITY_INFORMATION; + } else + offgroup = gsidsz = 0; + + /* locate SACL if requested and available */ + if (phead->sacl && (selection & SACL_SECURITY_INFORMATION)) { + /* find end of SACL */ + offsacl = le32_to_cpu(phead->sacl); + psacl = (const ACL*)&attr[offsacl]; + saclsz = le16_to_cpu(psacl->size); + size += saclsz; + avail |= SACL_SECURITY_INFORMATION; + } else + offsacl = saclsz = 0; + + /* + * Check having enough size in destination buffer + * (required size is returned nevertheless so that + * the request can be reissued with adequate size) + */ + if (size > buflen) { + *psize = size; + errno = EINVAL; + ok = FALSE; + } else { + if (selection & OWNER_SECURITY_INFORMATION) + control |= phead->control & SE_OWNER_DEFAULTED; + if (selection & GROUP_SECURITY_INFORMATION) + control |= phead->control & SE_GROUP_DEFAULTED; + if (selection & DACL_SECURITY_INFORMATION) + control |= phead->control + & (SE_DACL_PRESENT + | SE_DACL_DEFAULTED + | SE_DACL_AUTO_INHERITED + | SE_DACL_PROTECTED); + if (selection & SACL_SECURITY_INFORMATION) + control |= phead->control + & (SE_SACL_PRESENT + | SE_SACL_DEFAULTED + | SE_SACL_AUTO_INHERITED + | SE_SACL_PROTECTED); + /* + * copy header and feed new flags, even if no detailed data + */ + memcpy(buf,attr,sizeof(SECURITY_DESCRIPTOR_RELATIVE)); + pnhead = (SECURITY_DESCRIPTOR_RELATIVE*)buf; + pnhead->control = control; + pos = sizeof(SECURITY_DESCRIPTOR_RELATIVE); + + /* copy DACL if requested and available */ + if (selection & avail & DACL_SECURITY_INFORMATION) { + pnhead->dacl = cpu_to_le32(pos); + memcpy(&buf[pos],&attr[offdacl],daclsz); + pos += daclsz; + } else + pnhead->dacl = const_cpu_to_le32(0); + + /* copy SACL if requested and available */ + if (selection & avail & SACL_SECURITY_INFORMATION) { + pnhead->sacl = cpu_to_le32(pos); + memcpy(&buf[pos],&attr[offsacl],saclsz); + pos += saclsz; + } else + pnhead->sacl = const_cpu_to_le32(0); + + /* copy owner if requested and available */ + if (selection & avail & OWNER_SECURITY_INFORMATION) { + pnhead->owner = cpu_to_le32(pos); + memcpy(&buf[pos],&attr[offowner],usidsz); + pos += usidsz; + } else + pnhead->owner = const_cpu_to_le32(0); + + /* copy group if requested and available */ + if (selection & avail & GROUP_SECURITY_INFORMATION) { + pnhead->group = cpu_to_le32(pos); + memcpy(&buf[pos],&attr[offgroup],gsidsz); + pos += gsidsz; + } else + pnhead->group = const_cpu_to_le32(0); + if (pos != size) + ntfs_log_error("Error in security descriptor size\n"); + *psize = size; + ok = TRUE; + } + + return (ok); +} + +/* + * Merge a new security descriptor into the old one + * and assign to designated file + * + * Returns TRUE if successful + */ + +static BOOL mergesecurityattr(ntfs_volume *vol, const char *oldattr, + const char *newattr, u32 selection, ntfs_inode *ni) +{ + const SECURITY_DESCRIPTOR_RELATIVE *oldhead; + const SECURITY_DESCRIPTOR_RELATIVE *newhead; + SECURITY_DESCRIPTOR_RELATIVE *targhead; + const ACL *pdacl; + const ACL *psacl; + const SID *powner; + const SID *pgroup; + int offdacl; + int offsacl; + int offowner; + int offgroup; + unsigned int size; + le16 control; + char *target; + int pos; + int oldattrsz; + int newattrsz; + BOOL ok; + + ok = FALSE; /* default return */ + oldhead = (const SECURITY_DESCRIPTOR_RELATIVE*)oldattr; + newhead = (const SECURITY_DESCRIPTOR_RELATIVE*)newattr; + oldattrsz = ntfs_attr_size(oldattr); + newattrsz = ntfs_attr_size(newattr); + target = (char*)ntfs_malloc(oldattrsz + newattrsz); + if (target) { + targhead = (SECURITY_DESCRIPTOR_RELATIVE*)target; + pos = sizeof(SECURITY_DESCRIPTOR_RELATIVE); + control = SE_SELF_RELATIVE; + /* + * copy new DACL if selected + * or keep old DACL if any + */ + if ((selection & DACL_SECURITY_INFORMATION) ? + newhead->dacl : oldhead->dacl) { + if (selection & DACL_SECURITY_INFORMATION) { + offdacl = le32_to_cpu(newhead->dacl); + pdacl = (const ACL*)&newattr[offdacl]; + } else { + offdacl = le32_to_cpu(oldhead->dacl); + pdacl = (const ACL*)&oldattr[offdacl]; + } + size = le16_to_cpu(pdacl->size); + memcpy(&target[pos], pdacl, size); + targhead->dacl = cpu_to_le32(pos); + pos += size; + } else + targhead->dacl = const_cpu_to_le32(0); + if (selection & DACL_SECURITY_INFORMATION) { + control |= newhead->control + & (SE_DACL_PRESENT + | SE_DACL_DEFAULTED + | SE_DACL_PROTECTED); + if (newhead->control & SE_DACL_AUTO_INHERIT_REQ) + control |= SE_DACL_AUTO_INHERITED; + } else + control |= oldhead->control + & (SE_DACL_PRESENT + | SE_DACL_DEFAULTED + | SE_DACL_AUTO_INHERITED + | SE_DACL_PROTECTED); + /* + * copy new SACL if selected + * or keep old SACL if any + */ + if ((selection & SACL_SECURITY_INFORMATION) ? + newhead->sacl : oldhead->sacl) { + if (selection & SACL_SECURITY_INFORMATION) { + offsacl = le32_to_cpu(newhead->sacl); + psacl = (const ACL*)&newattr[offsacl]; + } else { + offsacl = le32_to_cpu(oldhead->sacl); + psacl = (const ACL*)&oldattr[offsacl]; + } + size = le16_to_cpu(psacl->size); + memcpy(&target[pos], psacl, size); + targhead->sacl = cpu_to_le32(pos); + pos += size; + } else + targhead->sacl = const_cpu_to_le32(0); + if (selection & SACL_SECURITY_INFORMATION) { + control |= newhead->control + & (SE_SACL_PRESENT + | SE_SACL_DEFAULTED + | SE_SACL_PROTECTED); + if (newhead->control & SE_SACL_AUTO_INHERIT_REQ) + control |= SE_SACL_AUTO_INHERITED; + } else + control |= oldhead->control + & (SE_SACL_PRESENT + | SE_SACL_DEFAULTED + | SE_SACL_AUTO_INHERITED + | SE_SACL_PROTECTED); + /* + * copy new OWNER if selected + * or keep old OWNER if any + */ + if ((selection & OWNER_SECURITY_INFORMATION) ? + newhead->owner : oldhead->owner) { + if (selection & OWNER_SECURITY_INFORMATION) { + offowner = le32_to_cpu(newhead->owner); + powner = (const SID*)&newattr[offowner]; + } else { + offowner = le32_to_cpu(oldhead->owner); + powner = (const SID*)&oldattr[offowner]; + } + size = ntfs_sid_size(powner); + memcpy(&target[pos], powner, size); + targhead->owner = cpu_to_le32(pos); + pos += size; + } else + targhead->owner = const_cpu_to_le32(0); + if (selection & OWNER_SECURITY_INFORMATION) + control |= newhead->control & SE_OWNER_DEFAULTED; + else + control |= oldhead->control & SE_OWNER_DEFAULTED; + /* + * copy new GROUP if selected + * or keep old GROUP if any + */ + if ((selection & GROUP_SECURITY_INFORMATION) ? + newhead->group : oldhead->group) { + if (selection & GROUP_SECURITY_INFORMATION) { + offgroup = le32_to_cpu(newhead->group); + pgroup = (const SID*)&newattr[offgroup]; + control |= newhead->control + & SE_GROUP_DEFAULTED; + } else { + offgroup = le32_to_cpu(oldhead->group); + pgroup = (const SID*)&oldattr[offgroup]; + control |= oldhead->control + & SE_GROUP_DEFAULTED; + } + size = ntfs_sid_size(pgroup); + memcpy(&target[pos], pgroup, size); + targhead->group = cpu_to_le32(pos); + pos += size; + } else + targhead->group = const_cpu_to_le32(0); + if (selection & GROUP_SECURITY_INFORMATION) + control |= newhead->control & SE_GROUP_DEFAULTED; + else + control |= oldhead->control & SE_GROUP_DEFAULTED; + targhead->revision = SECURITY_DESCRIPTOR_REVISION; + targhead->alignment = 0; + targhead->control = control; + ok = !update_secur_descr(vol, target, ni); + free(target); + } + return (ok); +} + +/* + * Return the security descriptor of a file + * This is intended to be similar to GetFileSecurity() from Win32 + * in order to facilitate the development of portable tools + * + * returns zero if unsuccessful (following Win32 conventions) + * -1 if no securid + * the securid if any + * + * The Win32 API is : + * + * BOOL WINAPI GetFileSecurity( + * __in LPCTSTR lpFileName, + * __in SECURITY_INFORMATION RequestedInformation, + * __out_opt PSECURITY_DESCRIPTOR pSecurityDescriptor, + * __in DWORD nLength, + * __out LPDWORD lpnLengthNeeded + * ); + * + */ + +int ntfs_get_file_security(struct SECURITY_API *scapi, + const char *path, u32 selection, + char *buf, u32 buflen, u32 *psize) +{ + ntfs_inode *ni; + char *attr; + int res; + + res = 0; /* default return */ + if (scapi && (scapi->magic == MAGIC_API)) { + ni = ntfs_pathname_to_inode(scapi->security.vol, NULL, path); + if (ni) { + attr = getsecurityattr(scapi->security.vol, ni); + if (attr) { + if (feedsecurityattr(attr,selection, + buf,buflen,psize)) { + if (test_nino_flag(ni, v3_Extensions) + && ni->security_id) + res = le32_to_cpu( + ni->security_id); + else + res = -1; + } + free(attr); + } + ntfs_inode_close(ni); + } else + errno = ENOENT; + if (!res) *psize = 0; + } else + errno = EINVAL; /* do not clear *psize */ + return (res); +} + + +/* + * Set the security descriptor of a file or directory + * This is intended to be similar to SetFileSecurity() from Win32 + * in order to facilitate the development of portable tools + * + * returns zero if unsuccessful (following Win32 conventions) + * -1 if no securid + * the securid if any + * + * The Win32 API is : + * + * BOOL WINAPI SetFileSecurity( + * __in LPCTSTR lpFileName, + * __in SECURITY_INFORMATION SecurityInformation, + * __in PSECURITY_DESCRIPTOR pSecurityDescriptor + * ); + */ + +int ntfs_set_file_security(struct SECURITY_API *scapi, + const char *path, u32 selection, const char *attr) +{ + const SECURITY_DESCRIPTOR_RELATIVE *phead; + ntfs_inode *ni; + int attrsz; + BOOL missing; + char *oldattr; + int res; + + res = 0; /* default return */ + if (scapi && (scapi->magic == MAGIC_API) && attr) { + phead = (const SECURITY_DESCRIPTOR_RELATIVE*)attr; + attrsz = ntfs_attr_size(attr); + /* if selected, owner and group must be present or defaulted */ + missing = ((selection & OWNER_SECURITY_INFORMATION) + && !phead->owner + && !(phead->control & SE_OWNER_DEFAULTED)) + || ((selection & GROUP_SECURITY_INFORMATION) + && !phead->group + && !(phead->control & SE_GROUP_DEFAULTED)); + if (!missing + && (phead->control & SE_SELF_RELATIVE) + && ntfs_valid_descr(attr, attrsz)) { + ni = ntfs_pathname_to_inode(scapi->security.vol, + NULL, path); + if (ni) { + oldattr = getsecurityattr(scapi->security.vol, + ni); + if (oldattr) { + if (mergesecurityattr( + scapi->security.vol, + oldattr, attr, + selection, ni)) { + if (test_nino_flag(ni, + v3_Extensions)) + res = le32_to_cpu( + ni->security_id); + else + res = -1; + } + free(oldattr); + } + ntfs_inode_close(ni); + } + } else + errno = EINVAL; + } else + errno = EINVAL; + return (res); +} + + +/* + * Return the attributes of a file + * This is intended to be similar to GetFileAttributes() from Win32 + * in order to facilitate the development of portable tools + * + * returns -1 if unsuccessful (Win32 : INVALID_FILE_ATTRIBUTES) + * + * The Win32 API is : + * + * DWORD WINAPI GetFileAttributes( + * __in LPCTSTR lpFileName + * ); + */ + +int ntfs_get_file_attributes(struct SECURITY_API *scapi, const char *path) +{ + ntfs_inode *ni; + s32 attrib; + + attrib = -1; /* default return */ + if (scapi && (scapi->magic == MAGIC_API) && path) { + ni = ntfs_pathname_to_inode(scapi->security.vol, NULL, path); + if (ni) { + attrib = le32_to_cpu(ni->flags); + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) + attrib |= const_le32_to_cpu(FILE_ATTR_DIRECTORY); + else + attrib &= ~const_le32_to_cpu(FILE_ATTR_DIRECTORY); + if (!attrib) + attrib |= const_le32_to_cpu(FILE_ATTR_NORMAL); + + ntfs_inode_close(ni); + } else + errno = ENOENT; + } else + errno = EINVAL; /* do not clear *psize */ + return (attrib); +} + + +/* + * Set attributes to a file or directory + * This is intended to be similar to SetFileAttributes() from Win32 + * in order to facilitate the development of portable tools + * + * Only a few flags can be set (same list as Win32) + * + * returns zero if unsuccessful (following Win32 conventions) + * nonzero if successful + * + * The Win32 API is : + * + * BOOL WINAPI SetFileAttributes( + * __in LPCTSTR lpFileName, + * __in DWORD dwFileAttributes + * ); + */ + +BOOL ntfs_set_file_attributes(struct SECURITY_API *scapi, + const char *path, s32 attrib) +{ + ntfs_inode *ni; + le32 settable; + ATTR_FLAGS dirflags; + int res; + + res = 0; /* default return */ + if (scapi && (scapi->magic == MAGIC_API) && path) { + ni = ntfs_pathname_to_inode(scapi->security.vol, NULL, path); + if (ni) { + settable = FILE_ATTR_SETTABLE; + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) { + /* + * Accept changing compression for a directory + * and set index root accordingly + */ + settable |= FILE_ATTR_COMPRESSED; + if ((ni->flags ^ cpu_to_le32(attrib)) + & FILE_ATTR_COMPRESSED) { + if (ni->flags & FILE_ATTR_COMPRESSED) + dirflags = const_cpu_to_le16(0); + else + dirflags = ATTR_IS_COMPRESSED; + res = ntfs_attr_set_flags(ni, + AT_INDEX_ROOT, + NTFS_INDEX_I30, 4, + dirflags, + ATTR_COMPRESSION_MASK); + } + } + if (!res) { + ni->flags = (ni->flags & ~settable) + | (cpu_to_le32(attrib) & settable); + NInoSetDirty(ni); + } + if (!ntfs_inode_close(ni)) + res = -1; + } else + errno = ENOENT; + } + return (res); +} + + +BOOL ntfs_read_directory(struct SECURITY_API *scapi, + const char *path, ntfs_filldir_t callback, void *context) +{ + ntfs_inode *ni; + BOOL ok; + s64 pos; + + ok = FALSE; /* default return */ + if (scapi && (scapi->magic == MAGIC_API) && callback) { + ni = ntfs_pathname_to_inode(scapi->security.vol, NULL, path); + if (ni) { + if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY) { + pos = 0; + ntfs_readdir(ni,&pos,context,callback); + ok = !ntfs_inode_close(ni); + } else { + ntfs_inode_close(ni); + errno = ENOTDIR; + } + } else + errno = ENOENT; + } else + errno = EINVAL; /* do not clear *psize */ + return (ok); +} + +/* + * read $SDS (for auditing security data) + * + * Returns the number or read bytes, or -1 if there is an error + */ + +int ntfs_read_sds(struct SECURITY_API *scapi, + char *buf, u32 size, u32 offset) +{ + int got; + + got = -1; /* default return */ + if (scapi && (scapi->magic == MAGIC_API)) { + if (scapi->security.vol->secure_ni) + got = ntfs_attr_data_read(scapi->security.vol->secure_ni, + STREAM_SDS, 4, buf, size, offset); + else + errno = EOPNOTSUPP; + } else + errno = EINVAL; + return (got); +} + +/* + * read $SII (for auditing security data) + * + * Returns next entry, or NULL if there is an error + */ + +INDEX_ENTRY *ntfs_read_sii(struct SECURITY_API *scapi, + INDEX_ENTRY *entry) +{ + SII_INDEX_KEY key; + INDEX_ENTRY *ret; + BOOL found; + ntfs_index_context *xsii; + + ret = (INDEX_ENTRY*)NULL; /* default return */ + if (scapi && (scapi->magic == MAGIC_API)) { + xsii = scapi->security.vol->secure_xsii; + if (xsii) { + if (!entry) { + key.security_id = const_cpu_to_le32(0); + found = !ntfs_index_lookup((char*)&key, + sizeof(SII_INDEX_KEY), xsii); + /* not supposed to find */ + if (!found && (errno == ENOENT)) + ret = xsii->entry; + } else + ret = ntfs_index_next(entry,xsii); + if (!ret) + errno = ENODATA; + } else + errno = EOPNOTSUPP; + } else + errno = EINVAL; + return (ret); +} + +/* + * read $SDH (for auditing security data) + * + * Returns next entry, or NULL if there is an error + */ + +INDEX_ENTRY *ntfs_read_sdh(struct SECURITY_API *scapi, + INDEX_ENTRY *entry) +{ + SDH_INDEX_KEY key; + INDEX_ENTRY *ret; + BOOL found; + ntfs_index_context *xsdh; + + ret = (INDEX_ENTRY*)NULL; /* default return */ + if (scapi && (scapi->magic == MAGIC_API)) { + xsdh = scapi->security.vol->secure_xsdh; + if (xsdh) { + if (!entry) { + key.hash = const_cpu_to_le32(0); + key.security_id = const_cpu_to_le32(0); + found = !ntfs_index_lookup((char*)&key, + sizeof(SDH_INDEX_KEY), xsdh); + /* not supposed to find */ + if (!found && (errno == ENOENT)) + ret = xsdh->entry; + } else + ret = ntfs_index_next(entry,xsdh); + if (!ret) + errno = ENODATA; + } else errno = ENOTSUP; + } else + errno = EINVAL; + return (ret); +} + +/* + * Get the mapped user SID + * A buffer of 40 bytes has to be supplied + * + * returns the size of the SID, or zero and errno set if not found + */ + +int ntfs_get_usid(struct SECURITY_API *scapi, uid_t uid, char *buf) +{ + const SID *usid; + BIGSID defusid; + int size; + + size = 0; + if (scapi && (scapi->magic == MAGIC_API)) { + usid = ntfs_find_usid(scapi->security.mapping[MAPUSERS], uid, (SID*)&defusid); + if (usid) { + size = ntfs_sid_size(usid); + memcpy(buf,usid,size); + } else + errno = ENODATA; + } else + errno = EINVAL; + return (size); +} + +/* + * Get the mapped group SID + * A buffer of 40 bytes has to be supplied + * + * returns the size of the SID, or zero and errno set if not found + */ + +int ntfs_get_gsid(struct SECURITY_API *scapi, gid_t gid, char *buf) +{ + const SID *gsid; + BIGSID defgsid; + int size; + + size = 0; + if (scapi && (scapi->magic == MAGIC_API)) { + gsid = ntfs_find_gsid(scapi->security.mapping[MAPGROUPS], gid, (SID*)&defgsid); + if (gsid) { + size = ntfs_sid_size(gsid); + memcpy(buf,gsid,size); + } else + errno = ENODATA; + } else + errno = EINVAL; + return (size); +} + +/* + * Get the user mapped to a SID + * + * returns the uid, or -1 if not found + */ + +int ntfs_get_user(struct SECURITY_API *scapi, const SID *usid) +{ + int uid; + + uid = -1; + if (scapi && (scapi->magic == MAGIC_API) && ntfs_valid_sid(usid)) { + if (ntfs_same_sid(usid,adminsid)) + uid = 0; + else { + uid = ntfs_find_user(scapi->security.mapping[MAPUSERS], usid); + if (!uid) { + uid = -1; + errno = ENODATA; + } + } + } else + errno = EINVAL; + return (uid); +} + +/* + * Get the group mapped to a SID + * + * returns the uid, or -1 if not found + */ + +int ntfs_get_group(struct SECURITY_API *scapi, const SID *gsid) +{ + int gid; + + gid = -1; + if (scapi && (scapi->magic == MAGIC_API) && ntfs_valid_sid(gsid)) { + if (ntfs_same_sid(gsid,adminsid)) + gid = 0; + else { + gid = ntfs_find_group(scapi->security.mapping[MAPGROUPS], gsid); + if (!gid) { + gid = -1; + errno = ENODATA; + } + } + } else + errno = EINVAL; + return (gid); +} + +/* + * Initializations before calling ntfs_get_file_security() + * ntfs_set_file_security() and ntfs_read_directory() + * + * Only allowed for root + * + * Returns an (obscured) struct SECURITY_API* needed for further calls + * NULL if not root (EPERM) or device is mounted (EBUSY) + */ + +struct SECURITY_API *ntfs_initialize_file_security(const char *device, + unsigned long flags) +{ + ntfs_volume *vol; + unsigned long mntflag; + int mnt; + struct SECURITY_API *scapi; + struct SECURITY_CONTEXT *scx; + + scapi = (struct SECURITY_API*)NULL; + mnt = ntfs_check_if_mounted(device, &mntflag); + if (!mnt && !(mntflag & NTFS_MF_MOUNTED) && !getuid()) { + vol = ntfs_mount(device, flags); + if (vol) { + scapi = (struct SECURITY_API*) + ntfs_malloc(sizeof(struct SECURITY_API)); + if (!ntfs_volume_get_free_space(vol) + && scapi) { + scapi->magic = MAGIC_API; + scapi->seccache = (struct PERMISSIONS_CACHE*)NULL; + scx = &scapi->security; + scx->vol = vol; + scx->uid = getuid(); + scx->gid = getgid(); + scx->pseccache = &scapi->seccache; + scx->vol->secure_flags = 0; + /* accept no mapping and no $Secure */ + ntfs_build_mapping(scx,(const char*)NULL,TRUE); + ntfs_open_secure(vol); + } else { + if (scapi) + free(scapi); + else + errno = ENOMEM; + mnt = ntfs_umount(vol,FALSE); + scapi = (struct SECURITY_API*)NULL; + } + } + } else + if (getuid()) + errno = EPERM; + else + errno = EBUSY; + return (scapi); +} + +/* + * Leaving after ntfs_initialize_file_security() + * + * Returns FALSE if FAILED + */ + +BOOL ntfs_leave_file_security(struct SECURITY_API *scapi) +{ + int ok; + ntfs_volume *vol; + + ok = FALSE; + if (scapi && (scapi->magic == MAGIC_API) && scapi->security.vol) { + vol = scapi->security.vol; + ntfs_close_secure(&scapi->security); + free(scapi); + if (!ntfs_umount(vol, 0)) + ok = TRUE; + } + return (ok); +} + diff --git a/portlibs/sources/libntfs/security.h b/portlibs/sources/libntfs/security.h new file mode 100644 index 00000000..9d7dd331 --- /dev/null +++ b/portlibs/sources/libntfs/security.h @@ -0,0 +1,361 @@ +/* + * security.h - Exports for handling security/ACLs in NTFS. + * Originated from the Linux-NTFS project. + * + * Copyright (c) 2004 Anton Altaparmakov + * Copyright (c) 2005-2006 Szabolcs Szakacsits + * Copyright (c) 2007-2010 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 + */ + +#ifndef _NTFS_SECURITY_H +#define _NTFS_SECURITY_H + +#include "types.h" +#include "layout.h" +#include "inode.h" +#include "dir.h" + +#ifndef POSIXACLS +#define POSIXACLS 0 +#endif + +typedef u16 be16; +typedef u32 be32; + +#if __BYTE_ORDER == __LITTLE_ENDIAN +#define const_cpu_to_be16(x) ((((x) & 255L) << 8) + (((x) >> 8) & 255L)) +#define const_cpu_to_be32(x) ((((x) & 255L) << 24) + (((x) & 0xff00L) << 8) \ + + (((x) >> 8) & 0xff00L) + (((x) >> 24) & 255L)) +#else +#define const_cpu_to_be16(x) (x) +#define const_cpu_to_be32(x) (x) +#endif + +/* + * item in the mapping list + */ + +struct MAPPING { + struct MAPPING *next; + int xid; /* linux id : uid or gid */ + SID *sid; /* Windows id : usid or gsid */ + int grcnt; /* group count (for users only) */ + gid_t *groups; /* groups which the user is member of */ +}; + +/* + * Entry in the permissions cache + * Note : this cache is not organized as a generic cache + */ + +struct CACHED_PERMISSIONS { + uid_t uid; + gid_t gid; + le32 inh_fileid; + le32 inh_dirid; +#if POSIXACLS + struct POSIX_SECURITY *pxdesc; + unsigned int pxdescsize:16; +#endif + unsigned int mode:12; + unsigned int valid:1; +} ; + +/* + * Entry in the permissions cache for directories with no security_id + */ + +struct CACHED_PERMISSIONS_LEGACY { + struct CACHED_PERMISSIONS_LEGACY *next; + struct CACHED_PERMISSIONS_LEGACY *previous; + void *variable; + size_t varsize; + union ALIGNMENT payload[0]; + /* above fields must match "struct CACHED_GENERIC" */ + u64 mft_no; + struct CACHED_PERMISSIONS perm; +} ; + +/* + * Entry in the securid cache + */ + +struct CACHED_SECURID { + struct CACHED_SECURID *next; + struct CACHED_SECURID *previous; + void *variable; + size_t varsize; + union ALIGNMENT payload[0]; + /* above fields must match "struct CACHED_GENERIC" */ + uid_t uid; + gid_t gid; + unsigned int dmode; + le32 securid; +} ; + +/* + * Header of the security cache + * (has no cache structure by itself) + */ + +struct CACHED_PERMISSIONS_HEADER { + unsigned int last; + /* statistics for permissions */ + unsigned long p_writes; + unsigned long p_reads; + unsigned long p_hits; +} ; + +/* + * The whole permissions cache + */ + +struct PERMISSIONS_CACHE { + struct CACHED_PERMISSIONS_HEADER head; + struct CACHED_PERMISSIONS *cachetable[1]; /* array of variable size */ +} ; + +/* + * Security flags values + */ + +enum { + SECURITY_DEFAULT, /* rely on fuse for permissions checking */ + SECURITY_RAW, /* force same ownership/permissions on files */ + SECURITY_ACL, /* enable Posix ACLs (when compiled in) */ + SECURITY_ADDSECURIDS, /* upgrade old security descriptors */ + SECURITY_STATICGRPS, /* use static groups for access control */ + SECURITY_WANTED /* a security related option was present */ +} ; + +/* + * Security context, needed by most security functions + */ + +enum { MAPUSERS, MAPGROUPS, MAPCOUNT } ; + +struct SECURITY_CONTEXT { + ntfs_volume *vol; + struct MAPPING *mapping[MAPCOUNT]; + struct PERMISSIONS_CACHE **pseccache; + uid_t uid; /* uid of user requesting (not the mounter) */ + gid_t gid; /* gid of user requesting (not the mounter) */ + pid_t tid; /* thread id of thread requesting */ + mode_t umask; /* umask of requesting thread */ + } ; + +#if POSIXACLS + +/* + * Posix ACL structures + */ + +struct POSIX_ACE { + u16 tag; + u16 perms; + s32 id; +} __attribute__((__packed__)); + +struct POSIX_ACL { + u8 version; + u8 flags; + u16 filler; + struct POSIX_ACE ace[0]; +} __attribute__((__packed__)); + +struct POSIX_SECURITY { + mode_t mode; + int acccnt; + int defcnt; + int firstdef; + u16 tagsset; + s32 alignment[0]; + struct POSIX_ACL acl; +} ; + +/* + * Posix tags, cpu-endian 16 bits + */ + +enum { + POSIX_ACL_USER_OBJ = 1, + POSIX_ACL_USER = 2, + POSIX_ACL_GROUP_OBJ = 4, + POSIX_ACL_GROUP = 8, + POSIX_ACL_MASK = 16, + POSIX_ACL_OTHER = 32, + POSIX_ACL_SPECIAL = 64 /* internal use only */ +} ; + +#define POSIX_ACL_EXTENSIONS (POSIX_ACL_USER | POSIX_ACL_GROUP | POSIX_ACL_MASK) + +/* + * Posix permissions, cpu-endian 16 bits + */ + +enum { + POSIX_PERM_X = 1, + POSIX_PERM_W = 2, + POSIX_PERM_R = 4, + POSIX_PERM_DENIAL = 64 /* internal use only */ +} ; + +#define POSIX_VERSION 2 + +#endif + +extern BOOL ntfs_guid_is_zero(const GUID *guid); +extern char *ntfs_guid_to_mbs(const GUID *guid, char *guid_str); + +/** + * ntfs_sid_is_valid - determine if a SID is valid + * @sid: SID for which to determine if it is valid + * + * Determine if the SID pointed to by @sid is valid. + * + * Return TRUE if it is valid and FALSE otherwise. + */ +static __inline__ BOOL ntfs_sid_is_valid(const SID *sid) +{ + if (!sid || sid->revision != SID_REVISION || + sid->sub_authority_count > SID_MAX_SUB_AUTHORITIES) + return FALSE; + return TRUE; +} + +extern int ntfs_sid_to_mbs_size(const SID *sid); +extern char *ntfs_sid_to_mbs(const SID *sid, char *sid_str, + size_t sid_str_size); +extern void ntfs_generate_guid(GUID *guid); +extern int ntfs_sd_add_everyone(ntfs_inode *ni); + +extern le32 ntfs_security_hash(const SECURITY_DESCRIPTOR_RELATIVE *sd, + const u32 len); + +int ntfs_build_mapping(struct SECURITY_CONTEXT *scx, const char *usermap_path, + BOOL allowdef); +int ntfs_get_owner_mode(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, struct stat*); +int ntfs_set_mode(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, mode_t mode); +BOOL ntfs_allowed_as_owner(struct SECURITY_CONTEXT *scx, ntfs_inode *ni); +int ntfs_allowed_access(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, int accesstype); +BOOL old_ntfs_allowed_dir_access(struct SECURITY_CONTEXT *scx, + const char *path, int accesstype); + +#if POSIXACLS +le32 ntfs_alloc_securid(struct SECURITY_CONTEXT *scx, + uid_t uid, gid_t gid, ntfs_inode *dir_ni, + mode_t mode, BOOL isdir); +#else +le32 ntfs_alloc_securid(struct SECURITY_CONTEXT *scx, + uid_t uid, gid_t gid, mode_t mode, BOOL isdir); +#endif +int ntfs_set_owner(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + uid_t uid, gid_t gid); +int ntfs_set_ownmod(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, uid_t uid, gid_t gid, mode_t mode); +#if POSIXACLS +int ntfs_set_owner_mode(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, uid_t uid, gid_t gid, + mode_t mode, struct POSIX_SECURITY *pxdesc); +#else +int ntfs_set_owner_mode(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, uid_t uid, gid_t gid, mode_t mode); +#endif +le32 ntfs_inherited_id(struct SECURITY_CONTEXT *scx, + ntfs_inode *dir_ni, BOOL fordir); +int ntfs_open_secure(ntfs_volume *vol); +void ntfs_close_secure(struct SECURITY_CONTEXT *scx); + +#if POSIXACLS + +int ntfs_set_inherited_posix(struct SECURITY_CONTEXT *scx, + ntfs_inode *ni, uid_t uid, gid_t gid, + ntfs_inode *dir_ni, mode_t mode); +int ntfs_get_posix_acl(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + const char *name, char *value, size_t size); +int ntfs_set_posix_acl(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + const char *name, const char *value, size_t size, + int flags); +int ntfs_remove_posix_acl(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + const char *name); +#endif + +int ntfs_get_ntfs_acl(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + char *value, size_t size); +int ntfs_set_ntfs_acl(struct SECURITY_CONTEXT *scx, ntfs_inode *ni, + const char *value, size_t size, int flags); + +int ntfs_get_ntfs_attrib(ntfs_inode *ni, char *value, size_t size); +int ntfs_set_ntfs_attrib(ntfs_inode *ni, + const char *value, size_t size, int flags); + + +/* + * Security API for direct access to security descriptors + * based on Win32 API + */ + +#define MAGIC_API 0x09042009 + +struct SECURITY_API { + u32 magic; + struct SECURITY_CONTEXT security; + struct PERMISSIONS_CACHE *seccache; +} ; + +/* + * The following constants are used in interfacing external programs. + * They are not to be stored on disk and must be defined in their + * native cpu representation. + * When disk representation (le) is needed, use SE_DACL_PRESENT, etc. + */ +enum { OWNER_SECURITY_INFORMATION = 1, + GROUP_SECURITY_INFORMATION = 2, + DACL_SECURITY_INFORMATION = 4, + SACL_SECURITY_INFORMATION = 8 +} ; + +int ntfs_get_file_security(struct SECURITY_API *scapi, + const char *path, u32 selection, + char *buf, u32 buflen, u32 *psize); +int ntfs_set_file_security(struct SECURITY_API *scapi, + const char *path, u32 selection, const char *attr); +int ntfs_get_file_attributes(struct SECURITY_API *scapi, + const char *path); +BOOL ntfs_set_file_attributes(struct SECURITY_API *scapi, + const char *path, s32 attrib); +BOOL ntfs_read_directory(struct SECURITY_API *scapi, + const char *path, ntfs_filldir_t callback, void *context); +int ntfs_read_sds(struct SECURITY_API *scapi, + char *buf, u32 size, u32 offset); +INDEX_ENTRY *ntfs_read_sii(struct SECURITY_API *scapi, + INDEX_ENTRY *entry); +INDEX_ENTRY *ntfs_read_sdh(struct SECURITY_API *scapi, + INDEX_ENTRY *entry); +struct SECURITY_API *ntfs_initialize_file_security(const char *device, + unsigned long flags); +BOOL ntfs_leave_file_security(struct SECURITY_API *scx); + +int ntfs_get_usid(struct SECURITY_API *scapi, uid_t uid, char *buf); +int ntfs_get_gsid(struct SECURITY_API *scapi, gid_t gid, char *buf); +int ntfs_get_user(struct SECURITY_API *scapi, const SID *usid); +int ntfs_get_group(struct SECURITY_API *scapi, const SID *gsid); + +#endif /* defined _NTFS_SECURITY_H */ diff --git a/portlibs/sources/libntfs/support.h b/portlibs/sources/libntfs/support.h new file mode 100644 index 00000000..6af4761e --- /dev/null +++ b/portlibs/sources/libntfs/support.h @@ -0,0 +1,85 @@ +/* + * support.h - Useful definitions and macros. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2004 Anton Altaparmakov + * + * 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 + */ + +#ifndef _NTFS_SUPPORT_H +#define _NTFS_SUPPORT_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#ifdef HAVE_STDDEF_H +#include <stddef.h> +#endif + +/* + * Our mailing list. Use this define to prevent typos in email address. + */ +#define NTFS_DEV_LIST "ntfs-3g-devel@lists.sf.net" + +/* + * Generic macro to convert pointers to values for comparison purposes. + */ +#ifndef p2n +#define p2n(p) ((ptrdiff_t)((ptrdiff_t*)(p))) +#endif + +/* + * The classic min and max macros. + */ +#ifndef min +#define min(a,b) ((a) <= (b) ? (a) : (b)) +#endif + +#ifndef max +#define max(a,b) ((a) >= (b) ? (a) : (b)) +#endif + +/* + * Useful macro for determining the offset of a struct member. + */ +#ifndef offsetof +#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER) +#endif + +/* + * Simple bit operation macros. NOTE: These are NOT atomic. + */ +#define test_bit(bit, var) ((var) & (1 << (bit))) +#define set_bit(bit, var) (var) |= 1 << (bit) +#define clear_bit(bit, var) (var) &= ~(1 << (bit)) + +#define test_and_set_bit(bit, var) \ +({ \ + const BOOL old_state = test_bit(bit, var); \ + set_bit(bit, var); \ + old_state; \ +}) + +#define test_and_clear_bit(bit, var) \ +({ \ + const BOOL old_state = test_bit(bit, var); \ + clear_bit(bit, var); \ + old_state; \ +}) + +#endif /* defined _NTFS_SUPPORT_H */ + diff --git a/portlibs/sources/libntfs/types.h b/portlibs/sources/libntfs/types.h new file mode 100644 index 00000000..77758eaf --- /dev/null +++ b/portlibs/sources/libntfs/types.h @@ -0,0 +1,141 @@ +/* + * types.h - Misc type definitions not related to on-disk structure. + * Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2004 Anton Altaparmakov + * + * 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 + */ + +#ifndef _NTFS_TYPES_H +#define _NTFS_TYPES_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#if HAVE_STDINT_H || !HAVE_CONFIG_H +#include <stdint.h> +#endif +#ifdef HAVE_SYS_TYPES_H +#include <sys/types.h> +#endif + +#ifdef GEKKO +#include <gctypes.h> +#include "compat.h" +#else /* GEKKO */ + +typedef uint8_t u8; /* Unsigned types of an exact size */ +typedef uint16_t u16; +typedef uint32_t u32; +typedef uint64_t u64; + +typedef int8_t s8; /* Signed types of an exact size */ +typedef int16_t s16; +typedef int32_t s32; +typedef int64_t s64; + +#endif /* GEKKO */ + +typedef u16 le16; +typedef u32 le32; +typedef u64 le64; + +/* + * Declare sle{16,32,64} to be unsigned because we do not want sign extension + * on BE architectures. + */ +typedef u16 sle16; +typedef u32 sle32; +typedef u64 sle64; + +typedef u16 ntfschar; /* 2-byte Unicode character type. */ +#define UCHAR_T_SIZE_BITS 1 + +/* + * Clusters are signed 64-bit values on NTFS volumes. We define two types, LCN + * and VCN, to allow for type checking and better code readability. + */ +typedef s64 VCN; +typedef sle64 leVCN; +typedef s64 LCN; +typedef sle64 leLCN; + +/* + * The NTFS journal $LogFile uses log sequence numbers which are signed 64-bit + * values. We define our own type LSN, to allow for type checking and better + * code readability. + */ +typedef s64 LSN; +typedef sle64 leLSN; + +/* + * Cygwin has a collision between our BOOL and <windef.h>'s + * As long as this file will be included after <windows.h> were fine. + */ +#ifndef GEKKO +#ifndef _WINDEF_H +/** + * enum BOOL - These are just to make the code more readable... + */ +typedef enum { +#ifndef FALSE + FALSE = 0, +#endif +#ifndef NO + NO = 0, +#endif +#ifndef ZERO + ZERO = 0, +#endif +#ifndef TRUE + TRUE = 1, +#endif +#ifndef YES + YES = 1, +#endif +#ifndef ONE + ONE = 1, +#endif +} BOOL; +#endif /* defined _WINDEF_H */ +#endif /* defined GECKO */ + +/** + * enum IGNORE_CASE_BOOL - + */ +typedef enum { + CASE_SENSITIVE = 0, + IGNORE_CASE = 1, +} IGNORE_CASE_BOOL; + +#define STATUS_OK (0) +#define STATUS_ERROR (-1) +#define STATUS_RESIDENT_ATTRIBUTE_FILLED_MFT (-2) +#define STATUS_KEEP_SEARCHING (-3) +#define STATUS_NOT_FOUND (-4) + +/* + * Force alignment in a struct if required by processor + */ +union ALIGNMENT { + u64 u64align; + void *ptralign; +} ; + +#endif /* defined _NTFS_TYPES_H */ + diff --git a/portlibs/sources/libntfs/unistr.c b/portlibs/sources/libntfs/unistr.c new file mode 100644 index 00000000..343e7a34 --- /dev/null +++ b/portlibs/sources/libntfs/unistr.c @@ -0,0 +1,1521 @@ +/** + * unistr.c - Unicode string handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2004 Anton Altaparmakov + * Copyright (c) 2002-2009 Szabolcs Szakacsits + * Copyright (c) 2008-2011 Jean-Pierre Andre + * Copyright (c) 2008 Bernhard Kaindl + * + * 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_WCHAR_H +#include <wchar.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_LOCALE_H +#include <locale.h> +#endif + +#if defined(__APPLE__) || defined(__DARWIN__) +#ifdef ENABLE_NFCONV +#include <CoreFoundation/CoreFoundation.h> +#endif /* ENABLE_NFCONV */ +#endif /* defined(__APPLE__) || defined(__DARWIN__) */ + +#include "compat.h" +#include "attrib.h" +#include "types.h" +#include "unistr.h" +#include "debug.h" +#include "logging.h" +#include "misc.h" + +#define NOREVBOM 0 /* JPA rejecting U+FFFE and U+FFFF, open to debate */ + +/* + * IMPORTANT + * ========= + * + * All these routines assume that the Unicode characters are in little endian + * encoding inside the strings!!! + */ + +static int use_utf8 = 1; /* use UTF-8 encoding for file names */ + +#if defined(__APPLE__) || defined(__DARWIN__) +#ifdef ENABLE_NFCONV +/** + * This variable controls whether or not automatic normalization form conversion + * should be performed when translating NTFS unicode file names to UTF-8. + * Defaults to on, but can be controlled from the outside using the function + * int ntfs_macosx_normalize_filenames(int normalize); + */ +static int nfconvert_utf8 = 1; +#endif /* ENABLE_NFCONV */ +#endif /* defined(__APPLE__) || defined(__DARWIN__) */ + +/* + * This is used by the name collation functions to quickly determine what + * characters are (in)valid. + */ +#if 0 +static const u8 legal_ansi_char_array[0x40] = { + 0x00, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, + 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, + + 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, + 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, 0x10, + + 0x17, 0x07, 0x18, 0x17, 0x17, 0x17, 0x17, 0x17, + 0x17, 0x17, 0x18, 0x16, 0x16, 0x17, 0x07, 0x00, + + 0x17, 0x17, 0x17, 0x17, 0x17, 0x17, 0x17, 0x17, + 0x17, 0x17, 0x04, 0x16, 0x18, 0x16, 0x18, 0x18, +}; +#endif + +/** + * ntfs_names_are_equal - compare two Unicode names for equality + * @s1: name to compare to @s2 + * @s1_len: length in Unicode characters of @s1 + * @s2: name to compare to @s1 + * @s2_len: length in Unicode characters of @s2 + * @ic: ignore case bool + * @upcase: upcase table (only if @ic == IGNORE_CASE) + * @upcase_size: length in Unicode characters of @upcase (if present) + * + * Compare the names @s1 and @s2 and return TRUE (1) if the names are + * identical, or FALSE (0) if they are not identical. If @ic is IGNORE_CASE, + * the @upcase table is used to perform a case insensitive comparison. + */ +BOOL ntfs_names_are_equal(const ntfschar *s1, size_t s1_len, + const ntfschar *s2, size_t s2_len, + const IGNORE_CASE_BOOL ic, + const ntfschar *upcase, const u32 upcase_size) +{ + if (s1_len != s2_len) + return FALSE; + if (!s1_len) + return TRUE; + if (ic == CASE_SENSITIVE) + return ntfs_ucsncmp(s1, s2, s1_len) ? FALSE: TRUE; + return ntfs_ucsncasecmp(s1, s2, s1_len, upcase, upcase_size) ? FALSE: + TRUE; +} + +/* + * ntfs_names_full_collate() fully collate two Unicode names + * + * @name1: first Unicode name to compare + * @name1_len: length of first Unicode name to compare + * @name2: second Unicode name to compare + * @name2_len: length of second Unicode name to compare + * @ic: either CASE_SENSITIVE or IGNORE_CASE + * @upcase: upcase table (ignored if @ic is CASE_SENSITIVE) + * @upcase_len: upcase table size (ignored if @ic is CASE_SENSITIVE) + * + * -1 if the first name collates before the second one, + * 0 if the names match, + * 1 if the second name collates before the first one, or + * + */ +int ntfs_names_full_collate(const ntfschar *name1, const u32 name1_len, + const ntfschar *name2, const u32 name2_len, + const IGNORE_CASE_BOOL ic, const ntfschar *upcase, + const u32 upcase_len) +{ + u32 cnt; + u16 c1, c2; + u16 u1, u2; + +#ifdef DEBUG + if (!name1 || !name2 || (ic && (!upcase || !upcase_len))) { + ntfs_log_debug("ntfs_names_collate received NULL pointer!\n"); + exit(1); + } +#endif + cnt = min(name1_len, name2_len); + if (cnt > 0) { + if (ic == CASE_SENSITIVE) { + while (--cnt && (*name1 == *name2)) { + name1++; + name2++; + } + u1 = c1 = le16_to_cpu(*name1); + u2 = c2 = le16_to_cpu(*name2); + if (u1 < upcase_len) + u1 = le16_to_cpu(upcase[u1]); + if (u2 < upcase_len) + u2 = le16_to_cpu(upcase[u2]); + if ((u1 == u2) && cnt) + do { + name1++; + u1 = le16_to_cpu(*name1); + name2++; + u2 = le16_to_cpu(*name2); + if (u1 < upcase_len) + u1 = le16_to_cpu(upcase[u1]); + if (u2 < upcase_len) + u2 = le16_to_cpu(upcase[u2]); + } while ((u1 == u2) && --cnt); + if (u1 < u2) + return -1; + if (u1 > u2) + return 1; + if (name1_len < name2_len) + return -1; + if (name1_len > name2_len) + return 1; + if (c1 < c2) + return -1; + if (c1 > c2) + return 1; + } else { + do { + u1 = c1 = le16_to_cpu(*name1); + name1++; + u2 = c2 = le16_to_cpu(*name2); + name2++; + if (u1 < upcase_len) + u1 = le16_to_cpu(upcase[u1]); + if (u2 < upcase_len) + u2 = le16_to_cpu(upcase[u2]); + } while ((u1 == u2) && --cnt); + if (u1 < u2) + return -1; + if (u1 > u2) + return 1; + if (name1_len < name2_len) + return -1; + if (name1_len > name2_len) + return 1; + } + } else { + if (name1_len < name2_len) + return -1; + if (name1_len > name2_len) + return 1; + } + return 0; +} + +/** + * ntfs_ucsncmp - compare two little endian Unicode strings + * @s1: first string + * @s2: second string + * @n: maximum unicode characters to compare + * + * Compare the first @n characters of the Unicode strings @s1 and @s2, + * The strings in little endian format and appropriate le16_to_cpu() + * conversion is performed on non-little endian machines. + * + * The function returns an integer less than, equal to, or greater than zero + * if @s1 (or the first @n Unicode characters thereof) is found, respectively, + * to be less than, to match, or be greater than @s2. + */ +int ntfs_ucsncmp(const ntfschar *s1, const ntfschar *s2, size_t n) +{ + ntfschar c1, c2; + size_t i; + +#ifdef DEBUG + if (!s1 || !s2) { + ntfs_log_debug("ntfs_wcsncmp() received NULL pointer!\n"); + exit(1); + } +#endif + for (i = 0; i < n; ++i) { + c1 = le16_to_cpu(s1[i]); + c2 = le16_to_cpu(s2[i]); + if (c1 < c2) + return -1; + if (c1 > c2) + return 1; + if (!c1) + break; + } + return 0; +} + +/** + * ntfs_ucsncasecmp - compare two little endian Unicode strings, ignoring case + * @s1: first string + * @s2: second string + * @n: maximum unicode characters to compare + * @upcase: upcase table + * @upcase_size: upcase table size in Unicode characters + * + * Compare the first @n characters of the Unicode strings @s1 and @s2, + * ignoring case. The strings in little endian format and appropriate + * le16_to_cpu() conversion is performed on non-little endian machines. + * + * Each character is uppercased using the @upcase table before the comparison. + * + * The function returns an integer less than, equal to, or greater than zero + * if @s1 (or the first @n Unicode characters thereof) is found, respectively, + * to be less than, to match, or be greater than @s2. + */ +int ntfs_ucsncasecmp(const ntfschar *s1, const ntfschar *s2, size_t n, + const ntfschar *upcase, const u32 upcase_size) +{ + u16 c1, c2; + size_t i; + +#ifdef DEBUG + if (!s1 || !s2 || !upcase) { + ntfs_log_debug("ntfs_wcsncasecmp() received NULL pointer!\n"); + exit(1); + } +#endif + for (i = 0; i < n; ++i) { + if ((c1 = le16_to_cpu(s1[i])) < upcase_size) + c1 = le16_to_cpu(upcase[c1]); + if ((c2 = le16_to_cpu(s2[i])) < upcase_size) + c2 = le16_to_cpu(upcase[c2]); + if (c1 < c2) + return -1; + if (c1 > c2) + return 1; + if (!c1) + break; + } + return 0; +} + +/** + * ntfs_ucsnlen - determine the length of a little endian Unicode string + * @s: pointer to Unicode string + * @maxlen: maximum length of string @s + * + * Return the number of Unicode characters in the little endian Unicode + * string @s up to a maximum of maxlen Unicode characters, not including + * the terminating (ntfschar)'\0'. If there is no (ntfschar)'\0' between @s + * and @s + @maxlen, @maxlen is returned. + * + * This function never looks beyond @s + @maxlen. + */ +u32 ntfs_ucsnlen(const ntfschar *s, u32 maxlen) +{ + u32 i; + + for (i = 0; i < maxlen; i++) { + if (!le16_to_cpu(s[i])) + break; + } + return i; +} + +/** + * ntfs_ucsndup - duplicate little endian Unicode string + * @s: pointer to Unicode string + * @maxlen: maximum length of string @s + * + * Return a pointer to a new little endian Unicode string which is a duplicate + * of the string s. Memory for the new string is obtained with ntfs_malloc(3), + * and can be freed with free(3). + * + * A maximum of @maxlen Unicode characters are copied and a terminating + * (ntfschar)'\0' little endian Unicode character is added. + * + * This function never looks beyond @s + @maxlen. + * + * Return a pointer to the new little endian Unicode string on success and NULL + * on failure with errno set to the error code. + */ +ntfschar *ntfs_ucsndup(const ntfschar *s, u32 maxlen) +{ + ntfschar *dst; + u32 len; + + len = ntfs_ucsnlen(s, maxlen); + dst = ntfs_malloc((len + 1) * sizeof(ntfschar)); + if (dst) { + memcpy(dst, s, len * sizeof(ntfschar)); + dst[len] = cpu_to_le16(L'\0'); + } + return dst; +} + +/** + * ntfs_name_upcase - Map an Unicode name to its uppercase equivalent + * @name: + * @name_len: + * @upcase: + * @upcase_len: + * + * Description... + * + * Returns: + */ +void ntfs_name_upcase(ntfschar *name, u32 name_len, const ntfschar *upcase, + const u32 upcase_len) +{ + u32 i; + u16 u; + + for (i = 0; i < name_len; i++) + if ((u = le16_to_cpu(name[i])) < upcase_len) + name[i] = upcase[u]; +} + +/** + * ntfs_name_locase - Map a Unicode name to its lowercase equivalent + */ +void ntfs_name_locase(ntfschar *name, u32 name_len, const ntfschar *locase, + const u32 locase_len) +{ + u32 i; + u16 u; + + if (locase) + for (i = 0; i < name_len; i++) + if ((u = le16_to_cpu(name[i])) < locase_len) + name[i] = locase[u]; +} + +/** + * ntfs_file_value_upcase - Convert a filename to upper case + * @file_name_attr: + * @upcase: + * @upcase_len: + * + * Description... + * + * Returns: + */ +void ntfs_file_value_upcase(FILE_NAME_ATTR *file_name_attr, + const ntfschar *upcase, const u32 upcase_len) +{ + ntfs_name_upcase((ntfschar*)&file_name_attr->file_name, + file_name_attr->file_name_length, upcase, upcase_len); +} + +/* + NTFS uses Unicode (UTF-16LE [NTFS-3G uses UCS-2LE, which is enough + for now]) for path names, but the Unicode code points need to be + converted before a path can be accessed under NTFS. For 7 bit ASCII/ANSI, + glibc does this even without a locale in a hard-coded fashion as that + appears to be is easy because the low 7-bit ASCII range appears to be + available in all charsets but it does not convert anything if + there was some error with the locale setup or none set up like + when mount is called during early boot where he (by policy) do + not use locales (and may be not available if /usr is not yet mounted), + so this patch fixes the resulting issues for systems which use + UTF-8 and for others, specifying the locale in fstab brings them + the encoding which they want. + + If no locale is defined or there was a problem with setting one + up and whenever nl_langinfo(CODESET) returns a sting starting with + "ANSI", use an internal UCS-2LE <-> UTF-8 codeset converter to fix + the bug where NTFS-3G does not show any path names which include + international characters!!! (and also fails on creating them) as result. + + Author: Bernhard Kaindl <bk@suse.de> + Jean-Pierre Andre made it compliant with RFC3629/RFC2781. +*/ + +/* + * Return the amount of 8-bit elements in UTF-8 needed (without the terminating + * null) to store a given UTF-16LE string. + * + * Return -1 with errno set if string has invalid byte sequence or too long. + */ +static int utf16_to_utf8_size(const ntfschar *ins, const int ins_len, int outs_len) +{ + int i, ret = -1; + int count = 0; + BOOL surrog; + + surrog = FALSE; + for (i = 0; i < ins_len && ins[i]; i++) { + unsigned short c = le16_to_cpu(ins[i]); + if (surrog) { + if ((c >= 0xdc00) && (c < 0xe000)) { + surrog = FALSE; + count += 4; + } else + goto fail; + } else + if (c < 0x80) + count++; + else if (c < 0x800) + count += 2; + else if (c < 0xd800) + count += 3; + else if (c < 0xdc00) + surrog = TRUE; +#if NOREVBOM + else if ((c >= 0xe000) && (c < 0xfffe)) +#else + else if (c >= 0xe000) +#endif + count += 3; + else + goto fail; + if (count > outs_len) { + errno = ENAMETOOLONG; + goto out; + } + } + if (surrog) + goto fail; + + ret = count; +out: + return ret; +fail: + errno = EILSEQ; + goto out; +} + +/* + * ntfs_utf16_to_utf8 - convert a little endian UTF16LE string to an UTF-8 string + * @ins: input utf16 string buffer + * @ins_len: length of input string in utf16 characters + * @outs: on return contains the (allocated) output multibyte string + * @outs_len: length of output buffer in bytes + * + * Return -1 with errno set if string has invalid byte sequence or too long. + */ +static int ntfs_utf16_to_utf8(const ntfschar *ins, const int ins_len, + char **outs, int outs_len) +{ +#if defined(__APPLE__) || defined(__DARWIN__) +#ifdef ENABLE_NFCONV + char *original_outs_value = *outs; + int original_outs_len = outs_len; +#endif /* ENABLE_NFCONV */ +#endif /* defined(__APPLE__) || defined(__DARWIN__) */ + + char *t; + int i, size, ret = -1; + int halfpair; + + halfpair = 0; + if (!*outs) + outs_len = PATH_MAX; + + size = utf16_to_utf8_size(ins, ins_len, outs_len); + + if (size < 0) + goto out; + + if (!*outs) { + outs_len = size + 1; + *outs = ntfs_malloc(outs_len); + if (!*outs) + goto out; + } + + t = *outs; + + for (i = 0; i < ins_len && ins[i]; i++) { + unsigned short c = le16_to_cpu(ins[i]); + /* size not double-checked */ + if (halfpair) { + if ((c >= 0xdc00) && (c < 0xe000)) { + *t++ = 0xf0 + (((halfpair + 64) >> 8) & 7); + *t++ = 0x80 + (((halfpair + 64) >> 2) & 63); + *t++ = 0x80 + ((c >> 6) & 15) + ((halfpair & 3) << 4); + *t++ = 0x80 + (c & 63); + halfpair = 0; + } else + goto fail; + } else if (c < 0x80) { + *t++ = c; + } else { + if (c < 0x800) { + *t++ = (0xc0 | ((c >> 6) & 0x3f)); + *t++ = 0x80 | (c & 0x3f); + } else if (c < 0xd800) { + *t++ = 0xe0 | (c >> 12); + *t++ = 0x80 | ((c >> 6) & 0x3f); + *t++ = 0x80 | (c & 0x3f); + } else if (c < 0xdc00) + halfpair = c; + else if (c >= 0xe000) { + *t++ = 0xe0 | (c >> 12); + *t++ = 0x80 | ((c >> 6) & 0x3f); + *t++ = 0x80 | (c & 0x3f); + } else + goto fail; + } + } + *t = '\0'; + +#if defined(__APPLE__) || defined(__DARWIN__) +#ifdef ENABLE_NFCONV + if(nfconvert_utf8 && (t - *outs) > 0) { + char *new_outs = NULL; + int new_outs_len = ntfs_macosx_normalize_utf8(*outs, &new_outs, 0); // Normalize to decomposed form + if(new_outs_len >= 0 && new_outs != NULL) { + if(original_outs_value != *outs) { + // We have allocated outs ourselves. + free(*outs); + *outs = new_outs; + t = *outs + new_outs_len; + } + else { + // We need to copy new_outs into the fixed outs buffer. + memset(*outs, 0, original_outs_len); + strncpy(*outs, new_outs, original_outs_len-1); + t = *outs + original_outs_len; + free(new_outs); + } + } + else { + ntfs_log_error("Failed to normalize NTFS string to UTF-8 NFD: %s\n", *outs); + ntfs_log_error(" new_outs=0x%p\n", new_outs); + ntfs_log_error(" new_outs_len=%d\n", new_outs_len); + } + } +#endif /* ENABLE_NFCONV */ +#endif /* defined(__APPLE__) || defined(__DARWIN__) */ + + ret = t - *outs; +out: + return ret; +fail: + errno = EILSEQ; + goto out; +} + +/* + * Return the amount of 16-bit elements in UTF-16LE needed + * (without the terminating null) to store given UTF-8 string. + * + * Return -1 with errno set if it's longer than PATH_MAX or string is invalid. + * + * Note: This does not check whether the input sequence is a valid utf8 string, + * and should be used only in context where such check is made! + */ +static int utf8_to_utf16_size(const char *s) +{ + int ret = -1; + unsigned int byte; + size_t count = 0; + + while ((byte = *((const unsigned char *)s++))) { + if (++count >= PATH_MAX) + goto fail; + if (byte >= 0xc0) { + if (byte >= 0xF5) { + errno = EILSEQ; + goto out; + } + if (!*s) + break; + if (byte >= 0xC0) + s++; + if (!*s) + break; + if (byte >= 0xE0) + s++; + if (!*s) + break; + if (byte >= 0xF0) { + s++; + if (++count >= PATH_MAX) + goto fail; + } + } + } + ret = count; +out: + return ret; +fail: + errno = ENAMETOOLONG; + goto out; +} +/* + * This converts one UTF-8 sequence to cpu-endian Unicode value + * within range U+0 .. U+10ffff and excluding U+D800 .. U+DFFF + * + * Return the number of used utf8 bytes or -1 with errno set + * if sequence is invalid. + */ +static int utf8_to_unicode(u32 *wc, const char *s) +{ + unsigned int byte = *((const unsigned char *)s); + + /* single byte */ + if (byte == 0) { + *wc = (u32) 0; + return 0; + } else if (byte < 0x80) { + *wc = (u32) byte; + return 1; + /* double byte */ + } else if (byte < 0xc2) { + goto fail; + } else if (byte < 0xE0) { + if ((s[1] & 0xC0) == 0x80) { + *wc = ((u32)(byte & 0x1F) << 6) + | ((u32)(s[1] & 0x3F)); + return 2; + } else + goto fail; + /* three-byte */ + } else if (byte < 0xF0) { + if (((s[1] & 0xC0) == 0x80) && ((s[2] & 0xC0) == 0x80)) { + *wc = ((u32)(byte & 0x0F) << 12) + | ((u32)(s[1] & 0x3F) << 6) + | ((u32)(s[2] & 0x3F)); + /* Check valid ranges */ +#if NOREVBOM + if (((*wc >= 0x800) && (*wc <= 0xD7FF)) + || ((*wc >= 0xe000) && (*wc <= 0xFFFD))) + return 3; +#else + if (((*wc >= 0x800) && (*wc <= 0xD7FF)) + || ((*wc >= 0xe000) && (*wc <= 0xFFFF))) + return 3; +#endif + } + goto fail; + /* four-byte */ + } else if (byte < 0xF5) { + if (((s[1] & 0xC0) == 0x80) && ((s[2] & 0xC0) == 0x80) + && ((s[3] & 0xC0) == 0x80)) { + *wc = ((u32)(byte & 0x07) << 18) + | ((u32)(s[1] & 0x3F) << 12) + | ((u32)(s[2] & 0x3F) << 6) + | ((u32)(s[3] & 0x3F)); + /* Check valid ranges */ + if ((*wc <= 0x10ffff) && (*wc >= 0x10000)) + return 4; + } + goto fail; + } +fail: + errno = EILSEQ; + return -1; +} + +/** + * ntfs_utf8_to_utf16 - convert a UTF-8 string to a UTF-16LE string + * @ins: input multibyte string buffer + * @outs: on return contains the (allocated) output utf16 string + * @outs_len: length of output buffer in utf16 characters + * + * Return -1 with errno set. + */ +static int ntfs_utf8_to_utf16(const char *ins, ntfschar **outs) +{ +#if defined(__APPLE__) || defined(__DARWIN__) +#ifdef ENABLE_NFCONV + char *new_ins = NULL; + if(nfconvert_utf8) { + int new_ins_len; + new_ins_len = ntfs_macosx_normalize_utf8(ins, &new_ins, 1); // Normalize to composed form + if(new_ins_len >= 0) + ins = new_ins; + else + ntfs_log_error("Failed to normalize NTFS string to UTF-8 NFC: %s\n", ins); + } +#endif /* ENABLE_NFCONV */ +#endif /* defined(__APPLE__) || defined(__DARWIN__) */ + const char *t = ins; + u32 wc; + BOOL allocated; + ntfschar *outpos; + int shorts, ret = -1; + + shorts = utf8_to_utf16_size(ins); + if (shorts < 0) + goto fail; + + allocated = FALSE; + if (!*outs) { + *outs = ntfs_malloc((shorts + 1) * sizeof(ntfschar)); + if (!*outs) + goto fail; + allocated = TRUE; + } + + outpos = *outs; + + while(1) { + int m = utf8_to_unicode(&wc, t); + if (m <= 0) { + if (m < 0) { + /* do not leave space allocated if failed */ + if (allocated) { + free(*outs); + *outs = (ntfschar*)NULL; + } + goto fail; + } + *outpos++ = const_cpu_to_le16(0); + break; + } + if (wc < 0x10000) + *outpos++ = cpu_to_le16(wc); + else { + wc -= 0x10000; + *outpos++ = cpu_to_le16((wc >> 10) + 0xd800); + *outpos++ = cpu_to_le16((wc & 0x3ff) + 0xdc00); + } + t += m; + } + + ret = --outpos - *outs; +fail: +#if defined(__APPLE__) || defined(__DARWIN__) +#ifdef ENABLE_NFCONV + if(new_ins != NULL) + free(new_ins); +#endif /* ENABLE_NFCONV */ +#endif /* defined(__APPLE__) || defined(__DARWIN__) */ + return ret; +} + +/** + * ntfs_ucstombs - convert a little endian Unicode string to a multibyte string + * @ins: input Unicode string buffer + * @ins_len: length of input string in Unicode characters + * @outs: on return contains the (allocated) output multibyte string + * @outs_len: length of output buffer in bytes + * + * Convert the input little endian, 2-byte Unicode string @ins, of length + * @ins_len into the multibyte string format dictated by the current locale. + * + * If *@outs is NULL, the function allocates the string and the caller is + * responsible for calling free(*@outs); when finished with it. + * + * On success the function returns the number of bytes written to the output + * string *@outs (>= 0), not counting the terminating NULL byte. If the output + * string buffer was allocated, *@outs is set to it. + * + * On error, -1 is returned, and errno is set to the error code. The following + * error codes can be expected: + * EINVAL Invalid arguments (e.g. @ins or @outs is NULL). + * EILSEQ The input string cannot be represented as a multibyte + * sequence according to the current locale. + * ENAMETOOLONG Destination buffer is too small for input string. + * ENOMEM Not enough memory to allocate destination buffer. + */ +int ntfs_ucstombs(const ntfschar *ins, const int ins_len, char **outs, + int outs_len) +{ + char *mbs; + int mbs_len; +#ifdef MB_CUR_MAX + wchar_t wc; + int i, o; + int cnt = 0; +#ifdef HAVE_MBSINIT + mbstate_t mbstate; +#endif +#endif /* MB_CUR_MAX */ + + if (!ins || !outs) { + errno = EINVAL; + return -1; + } + mbs = *outs; + mbs_len = outs_len; + if (mbs && !mbs_len) { + errno = ENAMETOOLONG; + return -1; + } + if (use_utf8) + return ntfs_utf16_to_utf8(ins, ins_len, outs, outs_len); +#ifdef MB_CUR_MAX + if (!mbs) { + mbs_len = (ins_len + 1) * MB_CUR_MAX; + mbs = ntfs_malloc(mbs_len); + if (!mbs) + return -1; + } +#ifdef HAVE_MBSINIT + memset(&mbstate, 0, sizeof(mbstate)); +#else + wctomb(NULL, 0); +#endif + for (i = o = 0; i < ins_len; i++) { + /* Reallocate memory if necessary or abort. */ + if ((int)(o + MB_CUR_MAX) > mbs_len) { + char *tc; + if (mbs == *outs) { + errno = ENAMETOOLONG; + return -1; + } + tc = ntfs_malloc((mbs_len + 64) & ~63); + if (!tc) + goto err_out; + memcpy(tc, mbs, mbs_len); + mbs_len = (mbs_len + 64) & ~63; + free(mbs); + mbs = tc; + } + /* Convert the LE Unicode character to a CPU wide character. */ + wc = (wchar_t)le16_to_cpu(ins[i]); + if (!wc) + break; + /* Convert the CPU endian wide character to multibyte. */ +#ifdef HAVE_MBSINIT + cnt = wcrtomb(mbs + o, wc, &mbstate); +#else + cnt = wctomb(mbs + o, wc); +#endif + if (cnt == -1) + goto err_out; + if (cnt <= 0) { + ntfs_log_debug("Eeek. cnt <= 0, cnt = %i\n", cnt); + errno = EINVAL; + goto err_out; + } + o += cnt; + } +#ifdef HAVE_MBSINIT + /* Make sure we are back in the initial state. */ + if (!mbsinit(&mbstate)) { + ntfs_log_debug("Eeek. mbstate not in initial state!\n"); + errno = EILSEQ; + goto err_out; + } +#endif + /* Now write the NULL character. */ + mbs[o] = '\0'; + if (*outs != mbs) + *outs = mbs; + return o; +err_out: + if (mbs != *outs) { + int eo = errno; + free(mbs); + errno = eo; + } +#else /* MB_CUR_MAX */ + errno = EILSEQ; +#endif /* MB_CUR_MAX */ + return -1; +} + +/** + * ntfs_mbstoucs - convert a multibyte string to a little endian Unicode string + * @ins: input multibyte string buffer + * @outs: on return contains the (allocated) output Unicode string + * + * Convert the input multibyte string @ins, from the current locale into the + * corresponding little endian, 2-byte Unicode string. + * + * The function allocates the string and the caller is responsible for calling + * free(*@outs); when finished with it. + * + * On success the function returns the number of Unicode characters written to + * the output string *@outs (>= 0), not counting the terminating Unicode NULL + * character. + * + * On error, -1 is returned, and errno is set to the error code. The following + * error codes can be expected: + * EINVAL Invalid arguments (e.g. @ins or @outs is NULL). + * EILSEQ The input string cannot be represented as a Unicode + * string according to the current locale. + * ENAMETOOLONG Destination buffer is too small for input string. + * ENOMEM Not enough memory to allocate destination buffer. + */ +int ntfs_mbstoucs(const char *ins, ntfschar **outs) +{ +#ifdef MB_CUR_MAX + ntfschar *ucs; + const char *s; + wchar_t wc; + int i, o, cnt, ins_len, ucs_len, ins_size; +#ifdef HAVE_MBSINIT + mbstate_t mbstate; +#endif +#endif /* MB_CUR_MAX */ + + if (!ins || !outs) { + errno = EINVAL; + return -1; + } + + if (use_utf8) + return ntfs_utf8_to_utf16(ins, outs); + +#ifdef MB_CUR_MAX + /* Determine the size of the multi-byte string in bytes. */ + ins_size = strlen(ins); + /* Determine the length of the multi-byte string. */ + s = ins; +#if defined(HAVE_MBSINIT) + memset(&mbstate, 0, sizeof(mbstate)); + ins_len = mbsrtowcs(NULL, (const char **)&s, 0, &mbstate); +#ifdef __CYGWIN32__ + if (!ins_len && *ins) { + /* Older Cygwin had broken mbsrtowcs() implementation. */ + ins_len = strlen(ins); + } +#endif +#elif !defined(DJGPP) + ins_len = mbstowcs(NULL, s, 0); +#else + /* Eeek!!! DJGPP has broken mbstowcs() implementation!!! */ + ins_len = strlen(ins); +#endif + if (ins_len == -1) + return ins_len; +#ifdef HAVE_MBSINIT + if ((s != ins) || !mbsinit(&mbstate)) { +#else + if (s != ins) { +#endif + errno = EILSEQ; + return -1; + } + /* Add the NULL terminator. */ + ins_len++; + ucs_len = ins_len; + ucs = ntfs_malloc(ucs_len * sizeof(ntfschar)); + if (!ucs) + return -1; +#ifdef HAVE_MBSINIT + memset(&mbstate, 0, sizeof(mbstate)); +#else + mbtowc(NULL, NULL, 0); +#endif + for (i = o = cnt = 0; i < ins_size; i += cnt, o++) { + /* Reallocate memory if necessary. */ + if (o >= ucs_len) { + ntfschar *tc; + ucs_len = (ucs_len * sizeof(ntfschar) + 64) & ~63; + tc = MEM2_realloc(ucs, ucs_len); + if (!tc) + goto err_out; + ucs = tc; + ucs_len /= sizeof(ntfschar); + } + /* Convert the multibyte character to a wide character. */ +#ifdef HAVE_MBSINIT + cnt = mbrtowc(&wc, ins + i, ins_size - i, &mbstate); +#else + cnt = mbtowc(&wc, ins + i, ins_size - i); +#endif + if (!cnt) + break; + if (cnt == -1) + goto err_out; + if (cnt < -1) { + ntfs_log_trace("Eeek. cnt = %i\n", cnt); + errno = EINVAL; + goto err_out; + } + /* Make sure we are not overflowing the NTFS Unicode set. */ + if ((unsigned long)wc >= (unsigned long)(1 << + (8 * sizeof(ntfschar)))) { + errno = EILSEQ; + goto err_out; + } + /* Convert the CPU wide character to a LE Unicode character. */ + ucs[o] = cpu_to_le16(wc); + } +#ifdef HAVE_MBSINIT + /* Make sure we are back in the initial state. */ + if (!mbsinit(&mbstate)) { + ntfs_log_trace("Eeek. mbstate not in initial state!\n"); + errno = EILSEQ; + goto err_out; + } +#endif + /* Now write the NULL character. */ + ucs[o] = cpu_to_le16(L'\0'); + *outs = ucs; + return o; +err_out: + free(ucs); +#else /* MB_CUR_MAX */ + errno = EILSEQ; +#endif /* MB_CUR_MAX */ + return -1; +} + +/* + * Turn a UTF8 name uppercase + * + * Returns an allocated uppercase name which has to be freed by caller + * or NULL if there is an error (described by errno) + */ + +char *ntfs_uppercase_mbs(const char *low, + const ntfschar *upcase, u32 upcase_size) +{ + int size; + char *upp; + u32 wc; + int n; + const char *s; + char *t; + + size = strlen(low); + upp = (char*)ntfs_malloc(3*size + 1); + if (upp) { + s = low; + t = upp; + do { + n = utf8_to_unicode(&wc, s); + if (n > 0) { + if (wc < upcase_size) + wc = le16_to_cpu(upcase[wc]); + if (wc < 0x80) + *t++ = wc; + else if (wc < 0x800) { + *t++ = (0xc0 | ((wc >> 6) & 0x3f)); + *t++ = 0x80 | (wc & 0x3f); + } else if (wc < 0x10000) { + *t++ = 0xe0 | (wc >> 12); + *t++ = 0x80 | ((wc >> 6) & 0x3f); + *t++ = 0x80 | (wc & 0x3f); + } else { + *t++ = 0xf0 | ((wc >> 18) & 7); + *t++ = 0x80 | ((wc >> 12) & 63); + *t++ = 0x80 | ((wc >> 6) & 0x3f); + *t++ = 0x80 | (wc & 0x3f); + } + s += n; + } + } while (n > 0); + if (n < 0) { + free(upp); + upp = (char*)NULL; + errno = EILSEQ; + } + *t = 0; + } + return (upp); +} + +/** + * ntfs_upcase_table_build - build the default upcase table for NTFS + * @uc: destination buffer where to store the built table + * @uc_len: size of destination buffer in bytes + * + * ntfs_upcase_table_build() builds the default upcase table for NTFS and + * stores it in the caller supplied buffer @uc of size @uc_len. + * + * Note, @uc_len must be at least 128kiB in size or bad things will happen! + */ +void ntfs_upcase_table_build(ntfschar *uc, u32 uc_len) +{ +#if 1 /* Vista */ + /* + * This is the table as defined by Vista + */ + /* + * "Start" is inclusive and "End" is exclusive, every value has the + * value of "Add" added to it. + */ + static int uc_run_table[][3] = { /* Start, End, Add */ + {0x0061, 0x007b, -32}, {0x00e0, 0x00f7, -32}, {0x00f8, 0x00ff, -32}, + {0x0256, 0x0258, -205}, {0x028a, 0x028c, -217}, {0x037b, 0x037e, 130}, + {0x03ac, 0x03ad, -38}, {0x03ad, 0x03b0, -37}, {0x03b1, 0x03c2, -32}, + {0x03c2, 0x03c3, -31}, {0x03c3, 0x03cc, -32}, {0x03cc, 0x03cd, -64}, + {0x03cd, 0x03cf, -63}, {0x0430, 0x0450, -32}, {0x0450, 0x0460, -80}, + {0x0561, 0x0587, -48}, {0x1f00, 0x1f08, 8}, {0x1f10, 0x1f16, 8}, + {0x1f20, 0x1f28, 8}, {0x1f30, 0x1f38, 8}, {0x1f40, 0x1f46, 8}, + {0x1f51, 0x1f52, 8}, {0x1f53, 0x1f54, 8}, {0x1f55, 0x1f56, 8}, + {0x1f57, 0x1f58, 8}, {0x1f60, 0x1f68, 8}, {0x1f70, 0x1f72, 74}, + {0x1f72, 0x1f76, 86}, {0x1f76, 0x1f78, 100}, {0x1f78, 0x1f7a, 128}, + {0x1f7a, 0x1f7c, 112}, {0x1f7c, 0x1f7e, 126}, {0x1f80, 0x1f88, 8}, + {0x1f90, 0x1f98, 8}, {0x1fa0, 0x1fa8, 8}, {0x1fb0, 0x1fb2, 8}, + {0x1fb3, 0x1fb4, 9}, {0x1fcc, 0x1fcd, -9}, {0x1fd0, 0x1fd2, 8}, + {0x1fe0, 0x1fe2, 8}, {0x1fe5, 0x1fe6, 7}, {0x1ffc, 0x1ffd, -9}, + {0x2170, 0x2180, -16}, {0x24d0, 0x24ea, -26}, {0x2c30, 0x2c5f, -48}, + {0x2d00, 0x2d26, -7264}, {0xff41, 0xff5b, -32}, {0} + }; + /* + * "Start" is exclusive and "End" is inclusive, every second value is + * decremented by one. + */ + static int uc_dup_table[][2] = { /* Start, End */ + {0x0100, 0x012f}, {0x0132, 0x0137}, {0x0139, 0x0149}, {0x014a, 0x0178}, + {0x0179, 0x017e}, {0x01a0, 0x01a6}, {0x01b3, 0x01b7}, {0x01cd, 0x01dd}, + {0x01de, 0x01ef}, {0x01f4, 0x01f5}, {0x01f8, 0x01f9}, {0x01fa, 0x0220}, + {0x0222, 0x0234}, {0x023b, 0x023c}, {0x0241, 0x0242}, {0x0246, 0x024f}, + {0x03d8, 0x03ef}, {0x03f7, 0x03f8}, {0x03fa, 0x03fb}, {0x0460, 0x0481}, + {0x048a, 0x04bf}, {0x04c1, 0x04c4}, {0x04c5, 0x04c8}, {0x04c9, 0x04ce}, + {0x04ec, 0x04ed}, {0x04d0, 0x04eb}, {0x04ee, 0x04f5}, {0x04f6, 0x0513}, + {0x1e00, 0x1e95}, {0x1ea0, 0x1ef9}, {0x2183, 0x2184}, {0x2c60, 0x2c61}, + {0x2c67, 0x2c6c}, {0x2c75, 0x2c76}, {0x2c80, 0x2ce3}, {0} + }; + /* + * Set the Unicode character at offset "Offset" to "Value". Note, + * "Value" is host endian. + */ + static int uc_byte_table[][2] = { /* Offset, Value */ + {0x00ff, 0x0178}, {0x0180, 0x0243}, {0x0183, 0x0182}, {0x0185, 0x0184}, + {0x0188, 0x0187}, {0x018c, 0x018b}, {0x0192, 0x0191}, {0x0195, 0x01f6}, + {0x0199, 0x0198}, {0x019a, 0x023d}, {0x019e, 0x0220}, {0x01a8, 0x01a7}, + {0x01ad, 0x01ac}, {0x01b0, 0x01af}, {0x01b9, 0x01b8}, {0x01bd, 0x01bc}, + {0x01bf, 0x01f7}, {0x01c6, 0x01c4}, {0x01c9, 0x01c7}, {0x01cc, 0x01ca}, + {0x01dd, 0x018e}, {0x01f3, 0x01f1}, {0x023a, 0x2c65}, {0x023e, 0x2c66}, + {0x0253, 0x0181}, {0x0254, 0x0186}, {0x0259, 0x018f}, {0x025b, 0x0190}, + {0x0260, 0x0193}, {0x0263, 0x0194}, {0x0268, 0x0197}, {0x0269, 0x0196}, + {0x026b, 0x2c62}, {0x026f, 0x019c}, {0x0272, 0x019d}, {0x0275, 0x019f}, + {0x027d, 0x2c64}, {0x0280, 0x01a6}, {0x0283, 0x01a9}, {0x0288, 0x01ae}, + {0x0289, 0x0244}, {0x028c, 0x0245}, {0x0292, 0x01b7}, {0x03f2, 0x03f9}, + {0x04cf, 0x04c0}, {0x1d7d, 0x2c63}, {0x214e, 0x2132}, {0} + }; +#else /* Vista */ + /* + * This is the table as defined by Windows XP + */ + static int uc_run_table[][3] = { /* Start, End, Add */ + {0x0061, 0x007B, -32}, {0x0451, 0x045D, -80}, {0x1F70, 0x1F72, 74}, + {0x00E0, 0x00F7, -32}, {0x045E, 0x0460, -80}, {0x1F72, 0x1F76, 86}, + {0x00F8, 0x00FF, -32}, {0x0561, 0x0587, -48}, {0x1F76, 0x1F78, 100}, + {0x0256, 0x0258, -205}, {0x1F00, 0x1F08, 8}, {0x1F78, 0x1F7A, 128}, + {0x028A, 0x028C, -217}, {0x1F10, 0x1F16, 8}, {0x1F7A, 0x1F7C, 112}, + {0x03AC, 0x03AD, -38}, {0x1F20, 0x1F28, 8}, {0x1F7C, 0x1F7E, 126}, + {0x03AD, 0x03B0, -37}, {0x1F30, 0x1F38, 8}, {0x1FB0, 0x1FB2, 8}, + {0x03B1, 0x03C2, -32}, {0x1F40, 0x1F46, 8}, {0x1FD0, 0x1FD2, 8}, + {0x03C2, 0x03C3, -31}, {0x1F51, 0x1F52, 8}, {0x1FE0, 0x1FE2, 8}, + {0x03C3, 0x03CC, -32}, {0x1F53, 0x1F54, 8}, {0x1FE5, 0x1FE6, 7}, + {0x03CC, 0x03CD, -64}, {0x1F55, 0x1F56, 8}, {0x2170, 0x2180, -16}, + {0x03CD, 0x03CF, -63}, {0x1F57, 0x1F58, 8}, {0x24D0, 0x24EA, -26}, + {0x0430, 0x0450, -32}, {0x1F60, 0x1F68, 8}, {0xFF41, 0xFF5B, -32}, + {0} + }; + static int uc_dup_table[][2] = { /* Start, End */ + {0x0100, 0x012F}, {0x01A0, 0x01A6}, {0x03E2, 0x03EF}, {0x04CB, 0x04CC}, + {0x0132, 0x0137}, {0x01B3, 0x01B7}, {0x0460, 0x0481}, {0x04D0, 0x04EB}, + {0x0139, 0x0149}, {0x01CD, 0x01DD}, {0x0490, 0x04BF}, {0x04EE, 0x04F5}, + {0x014A, 0x0178}, {0x01DE, 0x01EF}, {0x04BF, 0x04BF}, {0x04F8, 0x04F9}, + {0x0179, 0x017E}, {0x01F4, 0x01F5}, {0x04C1, 0x04C4}, {0x1E00, 0x1E95}, + {0x018B, 0x018B}, {0x01FA, 0x0218}, {0x04C7, 0x04C8}, {0x1EA0, 0x1EF9}, + {0} + }; + static int uc_byte_table[][2] = { /* Offset, Value */ + {0x00FF, 0x0178}, {0x01AD, 0x01AC}, {0x01F3, 0x01F1}, {0x0269, 0x0196}, + {0x0183, 0x0182}, {0x01B0, 0x01AF}, {0x0253, 0x0181}, {0x026F, 0x019C}, + {0x0185, 0x0184}, {0x01B9, 0x01B8}, {0x0254, 0x0186}, {0x0272, 0x019D}, + {0x0188, 0x0187}, {0x01BD, 0x01BC}, {0x0259, 0x018F}, {0x0275, 0x019F}, + {0x018C, 0x018B}, {0x01C6, 0x01C4}, {0x025B, 0x0190}, {0x0283, 0x01A9}, + {0x0192, 0x0191}, {0x01C9, 0x01C7}, {0x0260, 0x0193}, {0x0288, 0x01AE}, + {0x0199, 0x0198}, {0x01CC, 0x01CA}, {0x0263, 0x0194}, {0x0292, 0x01B7}, + {0x01A8, 0x01A7}, {0x01DD, 0x018E}, {0x0268, 0x0197}, + {0} + }; +#endif /* Vista */ + int i, r; + int k, off; + + memset((char*)uc, 0, uc_len); + uc_len >>= 1; + if (uc_len > 65536) + uc_len = 65536; + for (i = 0; (u32)i < uc_len; i++) + uc[i] = cpu_to_le16(i); + for (r = 0; uc_run_table[r][0]; r++) { + off = uc_run_table[r][2]; + for (i = uc_run_table[r][0]; i < uc_run_table[r][1]; i++) + uc[i] = cpu_to_le16(i + off); + } + for (r = 0; uc_dup_table[r][0]; r++) + for (i = uc_dup_table[r][0]; i < uc_dup_table[r][1]; i += 2) + uc[i + 1] = cpu_to_le16(i); + for (r = 0; uc_byte_table[r][0]; r++) { + k = uc_byte_table[r][1]; + uc[uc_byte_table[r][0]] = cpu_to_le16(k); + } +} + +/* + * Allocate and build the default upcase table + * + * Returns the number of entries + * 0 if failed + */ + +#define UPCASE_LEN 65536 /* default number of entries in upcase */ + +u32 ntfs_upcase_build_default(ntfschar **upcase) +{ + u32 upcase_len; + + *upcase = (ntfschar*)ntfs_malloc(UPCASE_LEN*2); + if (*upcase) { + ntfs_upcase_table_build(*upcase, UPCASE_LEN*2); + upcase_len = UPCASE_LEN; + } + return (upcase_len); +} + +/* + * Build a table for converting to lower case + * + * This is only meaningful when there is a single lower case + * character leading to an upper case one, and currently the + * only exception is the greek letter sigma which has a single + * upper case glyph (code U+03A3), but two lower case glyphs + * (code U+03C3 and U+03C2, the latter to be used at the end + * of a word). In the following implementation the upper case + * sigma will be lowercased as U+03C3. + */ + +ntfschar *ntfs_locase_table_build(const ntfschar *uc, u32 uc_cnt) +{ + ntfschar *lc; + u32 upp; + u32 i; + + lc = (ntfschar*)ntfs_malloc(uc_cnt*sizeof(ntfschar)); + if (lc) { + for (i=0; i<uc_cnt; i++) + lc[i] = cpu_to_le16(i); + for (i=0; i<uc_cnt; i++) { + upp = le16_to_cpu(uc[i]); + if ((upp != i) && (upp < uc_cnt)) + lc[upp] = cpu_to_le16(i); + } + } else + ntfs_log_error("Could not build the locase table\n"); + return (lc); +} + +/** + * ntfs_str2ucs - convert a string to a valid NTFS file name + * @s: input string + * @len: length of output buffer in Unicode characters + * + * Convert the input @s string into the corresponding little endian, + * 2-byte Unicode string. The length of the converted string is less + * or equal to the maximum length allowed by the NTFS format (255). + * + * If @s is NULL then return AT_UNNAMED. + * + * On success the function returns the Unicode string in an allocated + * buffer and the caller is responsible to free it when it's not needed + * anymore. + * + * On error NULL is returned and errno is set to the error code. + */ +ntfschar *ntfs_str2ucs(const char *s, int *len) +{ + ntfschar *ucs = NULL; + + if (s && ((*len = ntfs_mbstoucs(s, &ucs)) == -1)) { + ntfs_log_perror("Couldn't convert '%s' to Unicode", s); + return NULL; + } + if (*len > NTFS_MAX_NAME_LEN) { + free(ucs); + errno = ENAMETOOLONG; + return NULL; + } + if (!ucs || !*len) { + ucs = AT_UNNAMED; + *len = 0; + } + return ucs; +} + +/** + * ntfs_ucsfree - free memory allocated by ntfs_str2ucs() + * @ucs input string to be freed + * + * Free memory at @ucs and which was allocated by ntfs_str2ucs. + * + * Return value: none. + */ +void ntfs_ucsfree(ntfschar *ucs) +{ + if (ucs && (ucs != AT_UNNAMED)) + free(ucs); +} + +/* + * Check whether a name contains no chars forbidden + * for DOS or Win32 use + * + * If there is a bad char, errno is set to EINVAL + */ + +BOOL ntfs_forbidden_chars(const ntfschar *name, int len) +{ + BOOL forbidden; + int ch; + int i; + u32 mainset = (1L << ('\"' - 0x20)) + | (1L << ('*' - 0x20)) + | (1L << ('/' - 0x20)) + | (1L << (':' - 0x20)) + | (1L << ('<' - 0x20)) + | (1L << ('>' - 0x20)) + | (1L << ('?' - 0x20)); + + forbidden = (len == 0) + || (le16_to_cpu(name[len-1]) == ' ') + || (le16_to_cpu(name[len-1]) == '.'); + for (i=0; i<len; i++) { + ch = le16_to_cpu(name[i]); + if ((ch < 0x20) + || ((ch < 0x40) + && ((1L << (ch - 0x20)) & mainset)) + || (ch == '\\') + || (ch == '|')) + forbidden = TRUE; + } + if (forbidden) + errno = EINVAL; + return (forbidden); +} + +/* + * Check whether the same name can be used as a DOS and + * a Win32 name + * + * The names must be the same, or the short name the uppercase + * variant of the long name + */ + +BOOL ntfs_collapsible_chars(ntfs_volume *vol, + const ntfschar *shortname, int shortlen, + const ntfschar *longname, int longlen) +{ + BOOL collapsible; + unsigned int ch; + int i; + + collapsible = shortlen == longlen; + if (collapsible) + for (i=0; i<shortlen; i++) { + ch = le16_to_cpu(longname[i]); + if ((ch >= vol->upcase_len) + || ((shortname[i] != longname[i]) + && (shortname[i] != vol->upcase[ch]))) + collapsible = FALSE; + } + return (collapsible); +} + +/* + * Define the character encoding to be used. + * Use UTF-8 unless specified otherwise. + */ + +int ntfs_set_char_encoding(const char *locale) +{ + use_utf8 = 0; + if (!locale || strstr(locale,"utf8") || strstr(locale,"UTF8") + || strstr(locale,"utf-8") || strstr(locale,"UTF-8")) + use_utf8 = 1; + else + if (setlocale(LC_ALL, locale)) + use_utf8 = 0; + else { + ntfs_log_error("Invalid locale, encoding to UTF-8\n"); + use_utf8 = 1; + } + return 0; /* always successful */ +} + +#if defined(__APPLE__) || defined(__DARWIN__) + +int ntfs_macosx_normalize_filenames(int normalize) { +#ifdef ENABLE_NFCONV + if(normalize == 0 || normalize == 1) { + nfconvert_utf8 = normalize; + return 0; + } + else + return -1; +#else + return -1; +#endif /* ENABLE_NFCONV */ +} + +int ntfs_macosx_normalize_utf8(const char *utf8_string, char **target, + int composed) { +#ifdef ENABLE_NFCONV + /* For this code to compile, the CoreFoundation framework must be fed to the linker. */ + CFStringRef cfSourceString; + CFMutableStringRef cfMutableString; + CFRange rangeToProcess; + CFIndex requiredBufferLength; + char *result = NULL; + int resultLength = -1; + + /* Convert the UTF-8 string to a CFString. */ + cfSourceString = CFStringCreateWithCString(kCFAllocatorDefault, utf8_string, kCFStringEncodingUTF8); + if(cfSourceString == NULL) { + ntfs_log_error("CFStringCreateWithCString failed!\n"); + return -2; + } + + /* Create a mutable string from cfSourceString that we are free to modify. */ + cfMutableString = CFStringCreateMutableCopy(kCFAllocatorDefault, 0, cfSourceString); + CFRelease(cfSourceString); /* End-of-life. */ + if(cfMutableString == NULL) { + ntfs_log_error("CFStringCreateMutableCopy failed!\n"); + return -3; + } + + /* Normalize the mutable string to the desired normalization form. */ + CFStringNormalize(cfMutableString, (composed != 0 ? kCFStringNormalizationFormC : kCFStringNormalizationFormD)); + + /* Store the resulting string in a '\0'-terminated UTF-8 encoded char* buffer. */ + rangeToProcess = CFRangeMake(0, CFStringGetLength(cfMutableString)); + if(CFStringGetBytes(cfMutableString, rangeToProcess, kCFStringEncodingUTF8, 0, false, NULL, 0, &requiredBufferLength) > 0) { + resultLength = sizeof(char)*(requiredBufferLength + 1); + result = ntfs_calloc(resultLength); + + if(result != NULL) { + if(CFStringGetBytes(cfMutableString, rangeToProcess, kCFStringEncodingUTF8, + 0, false, (UInt8*)result, resultLength-1, &requiredBufferLength) <= 0) { + ntfs_log_error("Could not perform UTF-8 conversion of normalized CFMutableString.\n"); + free(result); + result = NULL; + } + } + else + ntfs_log_error("Could not perform a ntfs_calloc of %d bytes for char *result.\n", resultLength); + } + else + ntfs_log_error("Could not perform check for required length of UTF-8 conversion of normalized CFMutableString.\n"); + + + CFRelease(cfMutableString); + + if(result != NULL) { + *target = result; + return resultLength - 1; + } + else + return -1; +#else + return -1; +#endif /* ENABLE_NFCONV */ +} +#endif /* defined(__APPLE__) || defined(__DARWIN__) */ diff --git a/portlibs/sources/libntfs/unistr.h b/portlibs/sources/libntfs/unistr.h new file mode 100644 index 00000000..8cadc3c4 --- /dev/null +++ b/portlibs/sources/libntfs/unistr.h @@ -0,0 +1,119 @@ +/* + * unistr.h - Exports for Unicode string handling. Originated from the Linux-NTFS + * project. + * + * Copyright (c) 2000-2004 Anton Altaparmakov + * + * 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 + */ + +#ifndef _NTFS_UNISTR_H +#define _NTFS_UNISTR_H + +#include "types.h" +#include "layout.h" + +extern BOOL ntfs_names_are_equal(const ntfschar *s1, size_t s1_len, + const ntfschar *s2, size_t s2_len, const IGNORE_CASE_BOOL ic, + const ntfschar *upcase, const u32 upcase_size); + +extern int ntfs_names_full_collate(const ntfschar *name1, const u32 name1_len, + const ntfschar *name2, const u32 name2_len, + const IGNORE_CASE_BOOL ic, + const ntfschar *upcase, const u32 upcase_len); + +extern int ntfs_ucsncmp(const ntfschar *s1, const ntfschar *s2, size_t n); + +extern int ntfs_ucsncasecmp(const ntfschar *s1, const ntfschar *s2, size_t n, + const ntfschar *upcase, const u32 upcase_size); + +extern u32 ntfs_ucsnlen(const ntfschar *s, u32 maxlen); + +extern ntfschar *ntfs_ucsndup(const ntfschar *s, u32 maxlen); + +extern void ntfs_name_upcase(ntfschar *name, u32 name_len, + const ntfschar *upcase, const u32 upcase_len); + +extern void ntfs_name_locase(ntfschar *name, u32 name_len, + const ntfschar *locase, const u32 locase_len); + +extern void ntfs_file_value_upcase(FILE_NAME_ATTR *file_name_attr, + const ntfschar *upcase, const u32 upcase_len); + +extern int ntfs_ucstombs(const ntfschar *ins, const int ins_len, char **outs, + int outs_len); +extern int ntfs_mbstoucs(const char *ins, ntfschar **outs); + +extern char *ntfs_uppercase_mbs(const char *low, + const ntfschar *upcase, u32 upcase_len); + +extern void ntfs_upcase_table_build(ntfschar *uc, u32 uc_len); +extern u32 ntfs_upcase_build_default(ntfschar **upcase); +extern ntfschar *ntfs_locase_table_build(const ntfschar *uc, u32 uc_cnt); + +extern ntfschar *ntfs_str2ucs(const char *s, int *len); + +extern void ntfs_ucsfree(ntfschar *ucs); + +extern BOOL ntfs_forbidden_chars(const ntfschar *name, int len); +extern BOOL ntfs_collapsible_chars(ntfs_volume *vol, + const ntfschar *shortname, int shortlen, + const ntfschar *longname, int longlen); + +extern int ntfs_set_char_encoding(const char *locale); + +#if defined(__APPLE__) || defined(__DARWIN__) +/** + * Mac OS X only. + * + * Sets file name Unicode normalization form conversion on or off. + * normalize=0 : Off + * normalize=1 : On + * If set to on, all filenames returned by ntfs-3g will be converted to the NFD + * normalization form, while all filenames recieved by ntfs-3g will be converted to the NFC + * normalization form. Since Windows and most other OS:es use the NFC form while Mac OS X + * mostly uses NFD, this conversion increases compatibility between Mac applications and + * NTFS-3G. + * + * @param normalize decides whether or not the string functions will do automatic filename + * normalization when converting to and from UTF-8. 0 means normalization is disabled, + * 1 means it is enabled. + * @return -1 if the argument was invalid or an error occurred, 0 if all went well. + */ +extern int ntfs_macosx_normalize_filenames(int normalize); + +/** + * Mac OS X only. + * + * Normalizes the input string "utf8_string" to one of the normalization forms NFD or NFC. + * The parameter "composed" decides whether output should be in composed, NFC, form + * (composed == 1) or decomposed, NFD, form (composed == 0). + * Input is assumed to be properly UTF-8 encoded and null-terminated. Output will be a newly + * ntfs_calloc'ed string encoded in UTF-8. It is the callers responsibility to free(...) the + * allocated string when it's no longer needed. + * + * @param utf8_string the input string, which may be in any normalization form. + * @param target a pointer where the resulting string will be stored. + * @param composed decides which composition form to normalize the input string to. 0 means + * composed form (NFC), 1 means decomposed form (NFD). + * @return -1 if the normalization failed for some reason, otherwise the length of the + * normalized string stored in target. + */ +extern int ntfs_macosx_normalize_utf8(const char *utf8_string, char **target, int composed); +#endif /* defined(__APPLE__) || defined(__DARWIN__) */ + +#endif /* defined _NTFS_UNISTR_H */ + diff --git a/portlibs/sources/libntfs/volume.c b/portlibs/sources/libntfs/volume.c new file mode 100644 index 00000000..28e4c907 --- /dev/null +++ b/portlibs/sources/libntfs/volume.c @@ -0,0 +1,1732 @@ +/** + * volume.c - NTFS volume handling code. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2006 Anton Altaparmakov + * Copyright (c) 2002-2009 Szabolcs Szakacsits + * Copyright (c) 2004-2005 Richard Russon + * Copyright (c) 2010 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_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_FCNTL_H +#include <fcntl.h> +#endif +#ifdef HAVE_UNISTD_H +#include <unistd.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif +#ifdef HAVE_SYS_STAT_H +#include <sys/stat.h> +#endif +#ifdef HAVE_LIMITS_H +#include <limits.h> +#endif +#ifdef HAVE_LOCALE_H +#include <locale.h> +#endif + +#include "compat.h" +#include "volume.h" +#include "attrib.h" +#include "mft.h" +#include "bootsect.h" +#include "device.h" +#include "debug.h" +#include "inode.h" +#include "runlist.h" +#include "logfile.h" +#include "dir.h" +#include "logging.h" +#include "cache.h" +#include "misc.h" + +const char *ntfs_home = +"News, support and information: http://tuxera.com\n"; + +static const char *invalid_ntfs_msg = +"The device '%s' doesn't seem to have a valid NTFS.\n" +"Maybe the wrong device is used? Or the whole disk instead of a\n" +"partition (e.g. /dev/sda, not /dev/sda1)? Or the other way around?\n"; + +static const char *corrupt_volume_msg = +"NTFS is either inconsistent, or there is a hardware fault, or it's a\n" +"SoftRAID/FakeRAID hardware. In the first case run chkdsk /f on Windows\n" +"then reboot into Windows twice. The usage of the /f parameter is very\n" +"important! If the device is a SoftRAID/FakeRAID then first activate\n" +"it and mount a different device under the /dev/mapper/ directory, (e.g.\n" +"/dev/mapper/nvidia_eahaabcc1). Please see the 'dmraid' documentation\n" +"for more details.\n"; + +static const char *hibernated_volume_msg = +"The NTFS partition is hibernated. Please resume and shutdown Windows\n" +"properly, or mount the volume read-only with the 'ro' mount option, or\n" +"mount the volume read-write with the 'remove_hiberfile' mount option.\n" +"For example type on the command line:\n" +"\n" +" mount -t ntfs-3g -o remove_hiberfile %s %s\n" +"\n"; + +static const char *unclean_journal_msg = +"Write access is denied because the disk wasn't safely powered\n" +"off and the 'norecover' mount option was specified.\n"; + +static const char *opened_volume_msg = +"Mount is denied because the NTFS volume is already exclusively opened.\n" +"The volume may be already mounted, or another software may use it which\n" +"could be identified for example by the help of the 'fuser' command.\n"; + +static const char *fakeraid_msg = +"Either the device is missing or it's powered down, or you have\n" +"SoftRAID hardware and must use an activated, different device under\n" +"/dev/mapper/, (e.g. /dev/mapper/nvidia_eahaabcc1) to mount NTFS.\n" +"Please see the 'dmraid' documentation for help.\n"; + +static const char *access_denied_msg = +"Please check '%s' and the ntfs-3g binary permissions,\n" +"and the mounting user ID. More explanation is provided at\n" +"http://tuxera.com/community/ntfs-3g-faq/#unprivileged\n"; + +/** + * ntfs_volume_alloc - Create an NTFS volume object and initialise it + * + * Description... + * + * Returns: + */ +ntfs_volume *ntfs_volume_alloc(void) +{ + return ntfs_calloc(sizeof(ntfs_volume)); +} + +static void ntfs_attr_free(ntfs_attr **na) +{ + if (na && *na) { + ntfs_attr_close(*na); + *na = NULL; + } +} + +static int ntfs_inode_free(ntfs_inode **ni) +{ + int ret = -1; + + if (ni && *ni) { + ret = ntfs_inode_close(*ni); + *ni = NULL; + } + + return ret; +} + +static void ntfs_error_set(int *err) +{ + if (!*err) + *err = errno; +} + +/** + * __ntfs_volume_release - Destroy an NTFS volume object + * @v: + * + * Description... + * + * Returns: + */ +static int __ntfs_volume_release(ntfs_volume *v) +{ + int err = 0; + + if (ntfs_inode_free(&v->vol_ni)) + ntfs_error_set(&err); + /* + * FIXME: Inodes must be synced before closing + * attributes, otherwise unmount could fail. + */ + if (v->lcnbmp_ni && NInoDirty(v->lcnbmp_ni)) + ntfs_inode_sync(v->lcnbmp_ni); + ntfs_attr_free(&v->lcnbmp_na); + if (ntfs_inode_free(&v->lcnbmp_ni)) + ntfs_error_set(&err); + + if (v->mft_ni && NInoDirty(v->mft_ni)) + ntfs_inode_sync(v->mft_ni); + ntfs_attr_free(&v->mftbmp_na); + ntfs_attr_free(&v->mft_na); + if (ntfs_inode_free(&v->mft_ni)) + ntfs_error_set(&err); + + if (v->mftmirr_ni && NInoDirty(v->mftmirr_ni)) + ntfs_inode_sync(v->mftmirr_ni); + ntfs_attr_free(&v->mftmirr_na); + if (ntfs_inode_free(&v->mftmirr_ni)) + ntfs_error_set(&err); + + if (v->dev) { + struct ntfs_device *dev = v->dev; + + if (dev->d_ops->sync(dev)) + ntfs_error_set(&err); + if (dev->d_ops->close(dev)) + ntfs_error_set(&err); + } + + ntfs_free_lru_caches(v); + free(v->vol_name); + free(v->upcase); + if (v->locase) free(v->locase); + free(v->attrdef); + free(v); + + errno = err; + return errno ? -1 : 0; +} + +static void ntfs_attr_setup_flag(ntfs_inode *ni) +{ + STANDARD_INFORMATION *si; + + si = ntfs_attr_readall(ni, AT_STANDARD_INFORMATION, AT_UNNAMED, 0, NULL); + if (si) { + ni->flags = si->file_attributes; + free(si); + } +} + +/** + * ntfs_mft_load - load the $MFT and setup the ntfs volume with it + * @vol: ntfs volume whose $MFT to load + * + * Load $MFT from @vol and setup @vol with it. After calling this function the + * volume @vol is ready for use by all read access functions provided by the + * ntfs library. + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +static int ntfs_mft_load(ntfs_volume *vol) +{ + VCN next_vcn, last_vcn, highest_vcn; + s64 l; + MFT_RECORD *mb = NULL; + ntfs_attr_search_ctx *ctx = NULL; + ATTR_RECORD *a; + int eo; + + /* Manually setup an ntfs_inode. */ + vol->mft_ni = ntfs_inode_allocate(vol); + mb = ntfs_malloc(vol->mft_record_size); + if (!vol->mft_ni || !mb) { + ntfs_log_perror("Error allocating memory for $MFT"); + goto error_exit; + } + vol->mft_ni->mft_no = 0; + vol->mft_ni->mrec = mb; + /* Can't use any of the higher level functions yet! */ + l = ntfs_mst_pread(vol->dev, vol->mft_lcn << vol->cluster_size_bits, 1, + vol->mft_record_size, mb); + if (l != 1) { + if (l != -1) + errno = EIO; + ntfs_log_perror("Error reading $MFT"); + goto error_exit; + } + + if (ntfs_mft_record_check(vol, 0, mb)) + goto error_exit; + + ctx = ntfs_attr_get_search_ctx(vol->mft_ni, NULL); + if (!ctx) + goto error_exit; + + /* Find the $ATTRIBUTE_LIST attribute in $MFT if present. */ + if (ntfs_attr_lookup(AT_ATTRIBUTE_LIST, AT_UNNAMED, 0, 0, 0, NULL, 0, + ctx)) { + if (errno != ENOENT) { + ntfs_log_error("$MFT has corrupt attribute list.\n"); + goto io_error_exit; + } + goto mft_has_no_attr_list; + } + NInoSetAttrList(vol->mft_ni); + l = ntfs_get_attribute_value_length(ctx->attr); + if (l <= 0 || l > 0x40000) { + ntfs_log_error("$MFT/$ATTR_LIST invalid length (%lld).\n", + (long long)l); + goto io_error_exit; + } + vol->mft_ni->attr_list_size = l; + vol->mft_ni->attr_list = ntfs_malloc(l); + if (!vol->mft_ni->attr_list) + goto error_exit; + + l = ntfs_get_attribute_value(vol, ctx->attr, vol->mft_ni->attr_list); + if (!l) { + ntfs_log_error("Failed to get value of $MFT/$ATTR_LIST.\n"); + goto io_error_exit; + } + if (l != vol->mft_ni->attr_list_size) { + ntfs_log_error("Partial read of $MFT/$ATTR_LIST (%lld != " + "%u).\n", (long long)l, + vol->mft_ni->attr_list_size); + goto io_error_exit; + } + +mft_has_no_attr_list: + + ntfs_attr_setup_flag(vol->mft_ni); + + /* We now have a fully setup ntfs inode for $MFT in vol->mft_ni. */ + + /* Get an ntfs attribute for $MFT/$DATA and set it up, too. */ + vol->mft_na = ntfs_attr_open(vol->mft_ni, AT_DATA, AT_UNNAMED, 0); + if (!vol->mft_na) { + ntfs_log_perror("Failed to open ntfs attribute"); + goto error_exit; + } + /* Read all extents from the $DATA attribute in $MFT. */ + ntfs_attr_reinit_search_ctx(ctx); + last_vcn = vol->mft_na->allocated_size >> vol->cluster_size_bits; + highest_vcn = next_vcn = 0; + a = NULL; + while (!ntfs_attr_lookup(AT_DATA, AT_UNNAMED, 0, 0, next_vcn, NULL, 0, + ctx)) { + runlist_element *nrl; + + a = ctx->attr; + /* $MFT must be non-resident. */ + if (!a->non_resident) { + ntfs_log_error("$MFT must be non-resident.\n"); + goto io_error_exit; + } + /* $MFT must be uncompressed and unencrypted. */ + if (a->flags & ATTR_COMPRESSION_MASK || + a->flags & ATTR_IS_ENCRYPTED) { + ntfs_log_error("$MFT must be uncompressed and " + "unencrypted.\n"); + goto io_error_exit; + } + /* + * Decompress the mapping pairs array of this extent and merge + * the result into the existing runlist. No need for locking + * as we have exclusive access to the inode at this time and we + * are a mount in progress task, too. + */ + nrl = ntfs_mapping_pairs_decompress(vol, a, vol->mft_na->rl); + if (!nrl) { + ntfs_log_perror("ntfs_mapping_pairs_decompress() failed"); + goto error_exit; + } + vol->mft_na->rl = nrl; + + /* Get the lowest vcn for the next extent. */ + highest_vcn = sle64_to_cpu(a->highest_vcn); + next_vcn = highest_vcn + 1; + + /* Only one extent or error, which we catch below. */ + if (next_vcn <= 0) + break; + + /* Avoid endless loops due to corruption. */ + if (next_vcn < sle64_to_cpu(a->lowest_vcn)) { + ntfs_log_error("$MFT has corrupt attribute list.\n"); + goto io_error_exit; + } + } + if (!a) { + ntfs_log_error("$MFT/$DATA attribute not found.\n"); + goto io_error_exit; + } + if (highest_vcn && highest_vcn != last_vcn - 1) { + ntfs_log_error("Failed to load runlist for $MFT/$DATA.\n"); + ntfs_log_error("highest_vcn = 0x%llx, last_vcn - 1 = 0x%llx\n", + (long long)highest_vcn, (long long)last_vcn - 1); + goto io_error_exit; + } + /* Done with the $Mft mft record. */ + ntfs_attr_put_search_ctx(ctx); + ctx = NULL; + /* + * The volume is now setup so we can use all read access functions. + */ + vol->mftbmp_na = ntfs_attr_open(vol->mft_ni, AT_BITMAP, AT_UNNAMED, 0); + if (!vol->mftbmp_na) { + ntfs_log_perror("Failed to open $MFT/$BITMAP"); + goto error_exit; + } + return 0; +io_error_exit: + errno = EIO; +error_exit: + eo = errno; + if (ctx) + ntfs_attr_put_search_ctx(ctx); + if (vol->mft_na) { + ntfs_attr_close(vol->mft_na); + vol->mft_na = NULL; + } + if (vol->mft_ni) { + ntfs_inode_close(vol->mft_ni); + vol->mft_ni = NULL; + } + errno = eo; + return -1; +} + +/** + * ntfs_mftmirr_load - load the $MFTMirr and setup the ntfs volume with it + * @vol: ntfs volume whose $MFTMirr to load + * + * Load $MFTMirr from @vol and setup @vol with it. After calling this function + * the volume @vol is ready for use by all write access functions provided by + * the ntfs library (assuming ntfs_mft_load() has been called successfully + * beforehand). + * + * Return 0 on success and -1 on error with errno set to the error code. + */ +static int ntfs_mftmirr_load(ntfs_volume *vol) +{ + int err; + + vol->mftmirr_ni = ntfs_inode_open(vol, FILE_MFTMirr); + if (!vol->mftmirr_ni) { + ntfs_log_perror("Failed to open inode $MFTMirr"); + return -1; + } + + vol->mftmirr_na = ntfs_attr_open(vol->mftmirr_ni, AT_DATA, AT_UNNAMED, 0); + if (!vol->mftmirr_na) { + ntfs_log_perror("Failed to open $MFTMirr/$DATA"); + goto error_exit; + } + + if (ntfs_attr_map_runlist(vol->mftmirr_na, 0) < 0) { + ntfs_log_perror("Failed to map runlist of $MFTMirr/$DATA"); + goto error_exit; + } + + return 0; + +error_exit: + err = errno; + if (vol->mftmirr_na) { + ntfs_attr_close(vol->mftmirr_na); + vol->mftmirr_na = NULL; + } + ntfs_inode_close(vol->mftmirr_ni); + vol->mftmirr_ni = NULL; + errno = err; + return -1; +} + +/** + * ntfs_volume_startup - allocate and setup an ntfs volume + * @dev: device to open + * @flags: optional mount flags + * + * Load, verify, and parse bootsector; load and setup $MFT and $MFTMirr. After + * calling this function, the volume is setup sufficiently to call all read + * and write access functions provided by the library. + * + * Return the allocated volume structure on success and NULL on error with + * errno set to the error code. + */ +ntfs_volume *ntfs_volume_startup(struct ntfs_device *dev, unsigned long flags) +{ + LCN mft_zone_size, mft_lcn; + s64 br; + ntfs_volume *vol; + NTFS_BOOT_SECTOR *bs; + int eo; + + if (!dev || !dev->d_ops || !dev->d_name) { + errno = EINVAL; + ntfs_log_perror("%s: dev = %p", __FUNCTION__, dev); + return NULL; + } + + bs = ntfs_malloc(sizeof(NTFS_BOOT_SECTOR)); + if (!bs) + return NULL; + + /* Allocate the volume structure. */ + vol = ntfs_volume_alloc(); + if (!vol) + goto error_exit; + + /* Create the default upcase table. */ + vol->upcase_len = ntfs_upcase_build_default(&vol->upcase); + if (!vol->upcase_len || !vol->upcase) + goto error_exit; + + /* Default with no locase table and case sensitive file names */ + vol->locase = (ntfschar*)NULL; + NVolSetCaseSensitive(vol); + + /* by default, all files are shown and not marked hidden */ + NVolSetShowSysFiles(vol); + NVolSetShowHidFiles(vol); + NVolClearHideDotFiles(vol); + if (flags & MS_RDONLY) + NVolSetReadOnly(vol); + + /* ...->open needs bracketing to compile with glibc 2.7 */ + if ((dev->d_ops->open)(dev, NVolReadOnly(vol) ? O_RDONLY: O_RDWR)) { + ntfs_log_perror("Error opening '%s'", dev->d_name); + goto error_exit; + } + /* Attach the device to the volume. */ + vol->dev = dev; + + /* Now read the bootsector. */ + br = ntfs_pread(dev, 0, sizeof(NTFS_BOOT_SECTOR), bs); + if (br != sizeof(NTFS_BOOT_SECTOR)) { + if (br != -1) + errno = EINVAL; + if (!br) + ntfs_log_error("Failed to read bootsector (size=0)\n"); + else + ntfs_log_perror("Error reading bootsector"); + goto error_exit; + } + if (!ntfs_boot_sector_is_ntfs(bs)) { + errno = EINVAL; + goto error_exit; + } + if (ntfs_boot_sector_parse(vol, bs) < 0) + goto error_exit; + + free(bs); + bs = NULL; + /* Now set the device block size to the sector size. */ + if (ntfs_device_block_size_set(vol->dev, vol->sector_size)) + ntfs_log_debug("Failed to set the device block size to the " + "sector size. This may affect performance " + "but should be harmless otherwise. Error: " + "%s\n", strerror(errno)); + + /* We now initialize the cluster allocator. */ + vol->full_zones = 0; + mft_zone_size = vol->nr_clusters >> 3; /* 12.5% */ + + /* Setup the mft zone. */ + vol->mft_zone_start = vol->mft_zone_pos = vol->mft_lcn; + ntfs_log_debug("mft_zone_pos = 0x%llx\n", (long long)vol->mft_zone_pos); + + /* + * Calculate the mft_lcn for an unmodified NTFS volume (see mkntfs + * source) and if the actual mft_lcn is in the expected place or even + * further to the front of the volume, extend the mft_zone to cover the + * beginning of the volume as well. This is in order to protect the + * area reserved for the mft bitmap as well within the mft_zone itself. + * On non-standard volumes we don't protect it as the overhead would be + * higher than the speed increase we would get by doing it. + */ + mft_lcn = (8192 + 2 * vol->cluster_size - 1) / vol->cluster_size; + if (mft_lcn * vol->cluster_size < 16 * 1024) + mft_lcn = (16 * 1024 + vol->cluster_size - 1) / + vol->cluster_size; + if (vol->mft_zone_start <= mft_lcn) + vol->mft_zone_start = 0; + ntfs_log_debug("mft_zone_start = 0x%llx\n", (long long)vol->mft_zone_start); + + /* + * Need to cap the mft zone on non-standard volumes so that it does + * not point outside the boundaries of the volume. We do this by + * halving the zone size until we are inside the volume. + */ + vol->mft_zone_end = vol->mft_lcn + mft_zone_size; + while (vol->mft_zone_end >= vol->nr_clusters) { + mft_zone_size >>= 1; + vol->mft_zone_end = vol->mft_lcn + mft_zone_size; + } + ntfs_log_debug("mft_zone_end = 0x%llx\n", (long long)vol->mft_zone_end); + + /* + * Set the current position within each data zone to the start of the + * respective zone. + */ + vol->data1_zone_pos = vol->mft_zone_end; + ntfs_log_debug("data1_zone_pos = %lld\n", (long long)vol->data1_zone_pos); + vol->data2_zone_pos = 0; + ntfs_log_debug("data2_zone_pos = %lld\n", (long long)vol->data2_zone_pos); + + /* Set the mft data allocation position to mft record 24. */ + vol->mft_data_pos = 24; + + /* + * The cluster allocator is now fully operational. + */ + + /* Need to setup $MFT so we can use the library read functions. */ + if (ntfs_mft_load(vol) < 0) { + ntfs_log_perror("Failed to load $MFT"); + goto error_exit; + } + + /* Need to setup $MFTMirr so we can use the write functions, too. */ + if (ntfs_mftmirr_load(vol) < 0) { + ntfs_log_perror("Failed to load $MFTMirr"); + goto error_exit; + } + return vol; +error_exit: + eo = errno; + free(bs); + if (vol) + __ntfs_volume_release(vol); + errno = eo; + return NULL; +} + +/** + * ntfs_volume_check_logfile - check logfile on target volume + * @vol: volume on which to check logfile + * + * Return 0 on success and -1 on error with errno set error code. + */ +static int ntfs_volume_check_logfile(ntfs_volume *vol) +{ + ntfs_inode *ni; + ntfs_attr *na = NULL; + RESTART_PAGE_HEADER *rp = NULL; + int err = 0; + + ni = ntfs_inode_open(vol, FILE_LogFile); + if (!ni) { + ntfs_log_perror("Failed to open inode FILE_LogFile"); + errno = EIO; + return -1; + } + + na = ntfs_attr_open(ni, AT_DATA, AT_UNNAMED, 0); + if (!na) { + ntfs_log_perror("Failed to open $FILE_LogFile/$DATA"); + err = EIO; + goto out; + } + + if (!ntfs_check_logfile(na, &rp) || !ntfs_is_logfile_clean(na, rp)) + err = EOPNOTSUPP; + free(rp); + ntfs_attr_close(na); +out: + if (ntfs_inode_close(ni)) + ntfs_error_set(&err); + if (err) { + errno = err; + return -1; + } + return 0; +} + +/** + * ntfs_hiberfile_open - Find and open '/hiberfil.sys' + * @vol: An ntfs volume obtained from ntfs_mount + * + * Return: inode Success, hiberfil.sys is valid + * NULL hiberfil.sys doesn't exist or some other error occurred + */ +static ntfs_inode *ntfs_hiberfile_open(ntfs_volume *vol) +{ + u64 inode; + ntfs_inode *ni_root; + ntfs_inode *ni_hibr = NULL; + ntfschar *unicode = NULL; + int unicode_len; + const char *hiberfile = "hiberfil.sys"; + + if (!vol) { + errno = EINVAL; + return NULL; + } + + ni_root = ntfs_inode_open(vol, FILE_root); + if (!ni_root) { + ntfs_log_debug("Couldn't open the root directory.\n"); + return NULL; + } + + unicode_len = ntfs_mbstoucs(hiberfile, &unicode); + if (unicode_len < 0) { + ntfs_log_perror("Couldn't convert 'hiberfil.sys' to Unicode"); + goto out; + } + + inode = ntfs_inode_lookup_by_name(ni_root, unicode, unicode_len); + if (inode == (u64)-1) { + ntfs_log_debug("Couldn't find file '%s'.\n", hiberfile); + goto out; + } + + inode = MREF(inode); + ni_hibr = ntfs_inode_open(vol, inode); + if (!ni_hibr) { + ntfs_log_debug("Couldn't open inode %lld.\n", (long long)inode); + goto out; + } +out: + if (ntfs_inode_close(ni_root)) { + ntfs_inode_close(ni_hibr); + ni_hibr = NULL; + } + free(unicode); + return ni_hibr; +} + + +#define NTFS_HIBERFILE_HEADER_SIZE 4096 + +/** + * ntfs_volume_check_hiberfile - check hiberfil.sys whether Windows is + * hibernated on the target volume + * @vol: volume on which to check hiberfil.sys + * + * Return: 0 if Windows isn't hibernated for sure + * -1 otherwise and errno is set to the appropriate value + */ +int ntfs_volume_check_hiberfile(ntfs_volume *vol, int verbose) +{ + ntfs_inode *ni; + ntfs_attr *na = NULL; + int bytes_read, err; + char *buf = NULL; + + ni = ntfs_hiberfile_open(vol); + if (!ni) { + if (errno == ENOENT) + return 0; + return -1; + } + + buf = ntfs_malloc(NTFS_HIBERFILE_HEADER_SIZE); + if (!buf) + goto out; + + na = ntfs_attr_open(ni, AT_DATA, AT_UNNAMED, 0); + if (!na) { + ntfs_log_perror("Failed to open hiberfil.sys data attribute"); + goto out; + } + + bytes_read = ntfs_attr_pread(na, 0, NTFS_HIBERFILE_HEADER_SIZE, buf); + if (bytes_read == -1) { + ntfs_log_perror("Failed to read hiberfil.sys"); + goto out; + } + if (bytes_read < NTFS_HIBERFILE_HEADER_SIZE) { + if (verbose) + ntfs_log_error("Hibernated non-system partition, " + "refused to mount.\n"); + errno = EPERM; + goto out; + } + if (memcmp(buf, "hibr", 4) == 0) { + if (verbose) + ntfs_log_error("Windows is hibernated, refused to mount.\n"); + errno = EPERM; + goto out; + } + /* All right, all header bytes are zero */ + errno = 0; +out: + if (na) + ntfs_attr_close(na); + free(buf); + err = errno; + if (ntfs_inode_close(ni)) + ntfs_error_set(&err); + errno = err; + return errno ? -1 : 0; +} + +/* + * Make sure a LOGGED_UTILITY_STREAM attribute named "$TXF_DATA" + * on the root directory is resident. + * When it is non-resident, the partition cannot be mounted on Vista + * (see http://support.microsoft.com/kb/974729) + * + * We take care to avoid this situation, however this can be a + * consequence of having used an older version (including older + * Windows version), so we had better fix it. + * + * Returns 0 if unneeded or successful + * -1 if there was an error, explained by errno + */ + +static int fix_txf_data(ntfs_volume *vol) +{ + void *txf_data; + s64 txf_data_size; + ntfs_inode *ni; + ntfs_attr *na; + int res; + + res = 0; + ntfs_log_debug("Loading root directory\n"); + ni = ntfs_inode_open(vol, FILE_root); + if (!ni) { + ntfs_log_perror("Failed to open root directory"); + res = -1; + } else { + /* Get the $TXF_DATA attribute */ + na = ntfs_attr_open(ni, AT_LOGGED_UTILITY_STREAM, TXF_DATA, 9); + if (na) { + if (NAttrNonResident(na)) { + /* + * Fix the attribute by truncating, then + * rewriting it. + */ + ntfs_log_debug("Making $TXF_DATA resident\n"); + txf_data = ntfs_attr_readall(ni, + AT_LOGGED_UTILITY_STREAM, + TXF_DATA, 9, &txf_data_size); + if (txf_data) { + if (ntfs_attr_truncate(na, 0) + || (ntfs_attr_pwrite(na, 0, + txf_data_size, txf_data) + != txf_data_size)) + res = -1; + free(txf_data); + } + if (res) + ntfs_log_error("Failed to make $TXF_DATA resident\n"); + else + ntfs_log_error("$TXF_DATA made resident\n"); + } + ntfs_attr_close(na); + } + if (ntfs_inode_close(ni)) { + ntfs_log_perror("Failed to close root"); + res = -1; + } + } + return (res); +} + +/** + * ntfs_device_mount - open ntfs volume + * @dev: device to open + * @flags: optional mount flags + * + * This function mounts an ntfs volume. @dev should describe the device which + * to mount as the ntfs volume. + * + * @flags is an optional second parameter. The same flags are used as for + * the mount system call (man 2 mount). Currently only the following flag + * is implemented: + * MS_RDONLY - mount volume read-only + * + * The function opens the device @dev and verifies that it contains a valid + * bootsector. Then, it allocates an ntfs_volume structure and initializes + * some of the values inside the structure from the information stored in the + * bootsector. It proceeds to load the necessary system files and completes + * setting up the structure. + * + * Return the allocated volume structure on success and NULL on error with + * errno set to the error code. + */ +ntfs_volume *ntfs_device_mount(struct ntfs_device *dev, unsigned long flags) +{ + s64 l; + ntfs_volume *vol; + u8 *m = NULL, *m2 = NULL; + ntfs_attr_search_ctx *ctx = NULL; + ntfs_inode *ni; + ntfs_attr *na; + ATTR_RECORD *a; + VOLUME_INFORMATION *vinf; + ntfschar *vname; + int i, j, eo; + unsigned int k; + u32 u; + + vol = ntfs_volume_startup(dev, flags); + if (!vol) + return NULL; + + /* Load data from $MFT and $MFTMirr and compare the contents. */ + m = ntfs_malloc(vol->mftmirr_size << vol->mft_record_size_bits); + m2 = ntfs_malloc(vol->mftmirr_size << vol->mft_record_size_bits); + if (!m || !m2) + goto error_exit; + + l = ntfs_attr_mst_pread(vol->mft_na, 0, vol->mftmirr_size, + vol->mft_record_size, m); + if (l != vol->mftmirr_size) { + if (l == -1) + ntfs_log_perror("Failed to read $MFT"); + else { + ntfs_log_error("Failed to read $MFT, unexpected length " + "(%lld != %d).\n", (long long)l, + vol->mftmirr_size); + errno = EIO; + } + goto error_exit; + } + l = ntfs_attr_mst_pread(vol->mftmirr_na, 0, vol->mftmirr_size, + vol->mft_record_size, m2); + if (l != vol->mftmirr_size) { + if (l == -1) { + ntfs_log_perror("Failed to read $MFTMirr"); + goto error_exit; + } + vol->mftmirr_size = l; + } + ntfs_log_debug("Comparing $MFTMirr to $MFT...\n"); + for (i = 0; i < vol->mftmirr_size; ++i) { + MFT_RECORD *mrec, *mrec2; + const char *ESTR[12] = { "$MFT", "$MFTMirr", "$LogFile", + "$Volume", "$AttrDef", "root directory", "$Bitmap", + "$Boot", "$BadClus", "$Secure", "$UpCase", "$Extend" }; + const char *s; + + if (i < 12) + s = ESTR[i]; + else if (i < 16) + s = "system file"; + else + s = "mft record"; + + mrec = (MFT_RECORD*)(m + i * vol->mft_record_size); + if (mrec->flags & MFT_RECORD_IN_USE) { + if (ntfs_is_baad_recordp(mrec)) { + ntfs_log_error("$MFT error: Incomplete multi " + "sector transfer detected in " + "'%s'.\n", s); + goto io_error_exit; + } + if (!ntfs_is_mft_recordp(mrec)) { + ntfs_log_error("$MFT error: Invalid mft " + "record for '%s'.\n", s); + goto io_error_exit; + } + } + mrec2 = (MFT_RECORD*)(m2 + i * vol->mft_record_size); + if (mrec2->flags & MFT_RECORD_IN_USE) { + if (ntfs_is_baad_recordp(mrec2)) { + ntfs_log_error("$MFTMirr error: Incomplete " + "multi sector transfer " + "detected in '%s'.\n", s); + goto io_error_exit; + } + if (!ntfs_is_mft_recordp(mrec2)) { + ntfs_log_error("$MFTMirr error: Invalid mft " + "record for '%s'.\n", s); + goto io_error_exit; + } + } + if (memcmp(mrec, mrec2, ntfs_mft_record_get_data_size(mrec))) { + ntfs_log_error("$MFTMirr does not match $MFT (record " + "%d).\n", i); + goto io_error_exit; + } + } + + free(m2); + free(m); + m = m2 = NULL; + + /* Now load the bitmap from $Bitmap. */ + ntfs_log_debug("Loading $Bitmap...\n"); + vol->lcnbmp_ni = ntfs_inode_open(vol, FILE_Bitmap); + if (!vol->lcnbmp_ni) { + ntfs_log_perror("Failed to open inode FILE_Bitmap"); + goto error_exit; + } + + vol->lcnbmp_na = ntfs_attr_open(vol->lcnbmp_ni, AT_DATA, AT_UNNAMED, 0); + if (!vol->lcnbmp_na) { + ntfs_log_perror("Failed to open ntfs attribute"); + goto error_exit; + } + + if (vol->lcnbmp_na->data_size > vol->lcnbmp_na->allocated_size) { + ntfs_log_error("Corrupt cluster map size (%lld > %lld)\n", + (long long)vol->lcnbmp_na->data_size, + (long long)vol->lcnbmp_na->allocated_size); + goto io_error_exit; + } + + /* Now load the upcase table from $UpCase. */ + ntfs_log_debug("Loading $UpCase...\n"); + ni = ntfs_inode_open(vol, FILE_UpCase); + if (!ni) { + ntfs_log_perror("Failed to open inode FILE_UpCase"); + goto error_exit; + } + /* Get an ntfs attribute for $UpCase/$DATA. */ + na = ntfs_attr_open(ni, AT_DATA, AT_UNNAMED, 0); + if (!na) { + ntfs_log_perror("Failed to open ntfs attribute"); + goto error_exit; + } + /* + * Note: Normally, the upcase table has a length equal to 65536 + * 2-byte Unicode characters but allow for different cases, so no + * checks done. Just check we don't overflow 32-bits worth of Unicode + * characters. + */ + if (na->data_size & ~0x1ffffffffULL) { + ntfs_log_error("Error: Upcase table is too big (max 32-bit " + "allowed).\n"); + errno = EINVAL; + goto error_exit; + } + if (vol->upcase_len != na->data_size >> 1) { + vol->upcase_len = na->data_size >> 1; + /* Throw away default table. */ + free(vol->upcase); + vol->upcase = ntfs_malloc(na->data_size); + if (!vol->upcase) + goto error_exit; + } + /* Read in the $DATA attribute value into the buffer. */ + l = ntfs_attr_pread(na, 0, na->data_size, vol->upcase); + if (l != na->data_size) { + ntfs_log_error("Failed to read $UpCase, unexpected length " + "(%lld != %lld).\n", (long long)l, + (long long)na->data_size); + errno = EIO; + goto error_exit; + } + /* Done with the $UpCase mft record. */ + ntfs_attr_close(na); + if (ntfs_inode_close(ni)) { + ntfs_log_perror("Failed to close $UpCase"); + goto error_exit; + } + /* Consistency check of $UpCase, restricted to plain ASCII chars */ + k = 0x20; + while ((k < vol->upcase_len) + && (k < 0x7f) + && (le16_to_cpu(vol->upcase[k]) + == ((k < 'a') || (k > 'z') ? k : k + 'A' - 'a'))) + k++; + if (k < 0x7f) { + ntfs_log_error("Corrupted file $UpCase\n"); + goto io_error_exit; + } + + /* + * Now load $Volume and set the version information and flags in the + * vol structure accordingly. + */ + ntfs_log_debug("Loading $Volume...\n"); + vol->vol_ni = ntfs_inode_open(vol, FILE_Volume); + if (!vol->vol_ni) { + ntfs_log_perror("Failed to open inode FILE_Volume"); + goto error_exit; + } + /* Get a search context for the $Volume/$VOLUME_INFORMATION lookup. */ + ctx = ntfs_attr_get_search_ctx(vol->vol_ni, NULL); + if (!ctx) + goto error_exit; + + /* Find the $VOLUME_INFORMATION attribute. */ + if (ntfs_attr_lookup(AT_VOLUME_INFORMATION, AT_UNNAMED, 0, 0, 0, NULL, + 0, ctx)) { + ntfs_log_perror("$VOLUME_INFORMATION attribute not found in " + "$Volume"); + goto error_exit; + } + a = ctx->attr; + /* Has to be resident. */ + if (a->non_resident) { + ntfs_log_error("Attribute $VOLUME_INFORMATION must be " + "resident but it isn't.\n"); + errno = EIO; + goto error_exit; + } + /* Get a pointer to the value of the attribute. */ + vinf = (VOLUME_INFORMATION*)(le16_to_cpu(a->value_offset) + (char*)a); + /* Sanity checks. */ + if ((char*)vinf + le32_to_cpu(a->value_length) > (char*)ctx->mrec + + le32_to_cpu(ctx->mrec->bytes_in_use) || + le16_to_cpu(a->value_offset) + le32_to_cpu( + a->value_length) > le32_to_cpu(a->length)) { + ntfs_log_error("$VOLUME_INFORMATION in $Volume is corrupt.\n"); + errno = EIO; + goto error_exit; + } + /* Setup vol from the volume information attribute value. */ + vol->major_ver = vinf->major_ver; + vol->minor_ver = vinf->minor_ver; + /* Do not use le16_to_cpu() macro here as our VOLUME_FLAGS are + defined using cpu_to_le16() macro and hence are consistent. */ + vol->flags = vinf->flags; + /* + * Reinitialize the search context for the $Volume/$VOLUME_NAME lookup. + */ + ntfs_attr_reinit_search_ctx(ctx); + if (ntfs_attr_lookup(AT_VOLUME_NAME, AT_UNNAMED, 0, 0, 0, NULL, 0, + ctx)) { + if (errno != ENOENT) { + ntfs_log_perror("Failed to lookup of $VOLUME_NAME in " + "$Volume failed"); + goto error_exit; + } + /* + * Attribute not present. This has been seen in the field. + * Treat this the same way as if the attribute was present but + * had zero length. + */ + vol->vol_name = ntfs_malloc(1); + if (!vol->vol_name) + goto error_exit; + vol->vol_name[0] = '\0'; + } else { + a = ctx->attr; + /* Has to be resident. */ + if (a->non_resident) { + ntfs_log_error("$VOLUME_NAME must be resident.\n"); + errno = EIO; + goto error_exit; + } + /* Get a pointer to the value of the attribute. */ + vname = (ntfschar*)(le16_to_cpu(a->value_offset) + (char*)a); + u = le32_to_cpu(a->value_length) / 2; + /* + * Convert Unicode volume name to current locale multibyte + * format. + */ + vol->vol_name = NULL; + if (ntfs_ucstombs(vname, u, &vol->vol_name, 0) == -1) { + ntfs_log_perror("Volume name could not be converted " + "to current locale"); + ntfs_log_debug("Forcing name into ASCII by replacing " + "non-ASCII characters with underscores.\n"); + vol->vol_name = ntfs_malloc(u + 1); + if (!vol->vol_name) + goto error_exit; + + for (j = 0; j < (s32)u; j++) { + u16 uc = le16_to_cpu(vname[j]); + if (uc > 0xff) + uc = (u16)'_'; + vol->vol_name[j] = (char)uc; + } + vol->vol_name[u] = '\0'; + } + } + ntfs_attr_put_search_ctx(ctx); + ctx = NULL; + /* Now load the attribute definitions from $AttrDef. */ + ntfs_log_debug("Loading $AttrDef...\n"); + ni = ntfs_inode_open(vol, FILE_AttrDef); + if (!ni) { + ntfs_log_perror("Failed to open $AttrDef"); + goto error_exit; + } + /* Get an ntfs attribute for $AttrDef/$DATA. */ + na = ntfs_attr_open(ni, AT_DATA, AT_UNNAMED, 0); + if (!na) { + ntfs_log_perror("Failed to open ntfs attribute"); + goto error_exit; + } + /* Check we don't overflow 32-bits. */ + if (na->data_size > 0xffffffffLL) { + ntfs_log_error("Attribute definition table is too big (max " + "32-bit allowed).\n"); + errno = EINVAL; + goto error_exit; + } + vol->attrdef_len = na->data_size; + vol->attrdef = ntfs_malloc(na->data_size); + if (!vol->attrdef) + goto error_exit; + /* Read in the $DATA attribute value into the buffer. */ + l = ntfs_attr_pread(na, 0, na->data_size, vol->attrdef); + if (l != na->data_size) { + ntfs_log_error("Failed to read $AttrDef, unexpected length " + "(%lld != %lld).\n", (long long)l, + (long long)na->data_size); + errno = EIO; + goto error_exit; + } + /* Done with the $AttrDef mft record. */ + ntfs_attr_close(na); + if (ntfs_inode_close(ni)) { + ntfs_log_perror("Failed to close $AttrDef"); + goto error_exit; + } + /* + * Check for dirty logfile and hibernated Windows. + * We care only about read-write mounts. + */ + if (!(flags & (MS_RDONLY | MS_FORENSIC))) { + if (!(flags & MS_IGNORE_HIBERFILE) && + ntfs_volume_check_hiberfile(vol, 1) < 0) + goto error_exit; + if (ntfs_volume_check_logfile(vol) < 0) { + if (!(flags & MS_RECOVER)) + goto error_exit; + ntfs_log_info("The file system wasn't safely " + "closed on Windows. Fixing.\n"); + if (ntfs_logfile_reset(vol)) + goto error_exit; + } + /* make $TXF_DATA resident if present on the root directory */ + if (fix_txf_data(vol)) + goto error_exit; + } + + return vol; +io_error_exit: + errno = EIO; +error_exit: + eo = errno; + if (ctx) + ntfs_attr_put_search_ctx(ctx); + free(m); + free(m2); + __ntfs_volume_release(vol); + errno = eo; + return NULL; +} + +/* + * Set appropriate flags for showing NTFS metafiles + * or files marked as hidden. + * Not set in ntfs_mount() to avoid breaking existing tools. + */ + +int ntfs_set_shown_files(ntfs_volume *vol, + BOOL show_sys_files, BOOL show_hid_files, + BOOL hide_dot_files) +{ + int res; + + res = -1; + if (vol) { + NVolClearShowSysFiles(vol); + NVolClearShowHidFiles(vol); + NVolClearHideDotFiles(vol); + if (show_sys_files) + NVolSetShowSysFiles(vol); + if (show_hid_files) + NVolSetShowHidFiles(vol); + if (hide_dot_files) + NVolSetHideDotFiles(vol); + res = 0; + } + if (res) + ntfs_log_error("Failed to set file visibility\n"); + return (res); +} + +/* + * Set ignore case mode + */ + +int ntfs_set_ignore_case(ntfs_volume *vol) +{ + int res; + + res = -1; + if (vol && vol->upcase) { + vol->locase = ntfs_locase_table_build(vol->upcase, + vol->upcase_len); + if (vol->locase) { + NVolClearCaseSensitive(vol); + res = 0; + } + } + if (res) + ntfs_log_error("Failed to set ignore_case mode\n"); + return (res); +} + +/** + * ntfs_mount - open ntfs volume + * @name: name of device/file to open + * @flags: optional mount flags + * + * This function mounts an ntfs volume. @name should contain the name of the + * device/file to mount as the ntfs volume. + * + * @flags is an optional second parameter. The same flags are used as for + * the mount system call (man 2 mount). Currently only the following flags + * is implemented: + * MS_RDONLY - mount volume read-only + * + * The function opens the device or file @name and verifies that it contains a + * valid bootsector. Then, it allocates an ntfs_volume structure and initializes + * some of the values inside the structure from the information stored in the + * bootsector. It proceeds to load the necessary system files and completes + * setting up the structure. + * + * Return the allocated volume structure on success and NULL on error with + * errno set to the error code. + * + * Note, that a copy is made of @name, and hence it can be discarded as + * soon as the function returns. + */ +ntfs_volume *ntfs_mount(const char *name __attribute__((unused)), + unsigned long flags __attribute__((unused))) +{ +#ifndef NO_NTFS_DEVICE_DEFAULT_IO_OPS + struct ntfs_device *dev; + ntfs_volume *vol; + + /* Allocate an ntfs_device structure. */ + dev = ntfs_device_alloc(name, 0, &ntfs_device_default_io_ops, NULL); + if (!dev) + return NULL; + /* Call ntfs_device_mount() to do the actual mount. */ + vol = ntfs_device_mount(dev, flags); + if (!vol) { + int eo = errno; + ntfs_device_free(dev); + errno = eo; + } else + ntfs_create_lru_caches(vol); + return vol; +#else + /* + * ntfs_mount() makes no sense if NO_NTFS_DEVICE_DEFAULT_IO_OPS is + * defined as there are no device operations available in libntfs in + * this case. + */ + errno = EOPNOTSUPP; + return NULL; +#endif +} + +/** + * ntfs_umount - close ntfs volume + * @vol: address of ntfs_volume structure of volume to close + * @force: if true force close the volume even if it is busy + * + * Deallocate all structures (including @vol itself) associated with the ntfs + * volume @vol. + * + * Return 0 on success. On error return -1 with errno set appropriately + * (most likely to one of EAGAIN, EBUSY or EINVAL). The EAGAIN error means that + * an operation is in progress and if you try the close later the operation + * might be completed and the close succeed. + * + * If @force is true (i.e. not zero) this function will close the volume even + * if this means that data might be lost. + * + * @vol must have previously been returned by a call to ntfs_mount(). + * + * @vol itself is deallocated and should no longer be dereferenced after this + * function returns success. If it returns an error then nothing has been done + * so it is safe to continue using @vol. + */ +int ntfs_umount(ntfs_volume *vol, const BOOL force __attribute__((unused))) +{ + struct ntfs_device *dev; + int ret; + + if (!vol) { + errno = EINVAL; + return -1; + } + dev = vol->dev; + ret = __ntfs_volume_release(vol); + ntfs_device_free(dev); + return ret; +} + +#ifdef HAVE_MNTENT_H + +#ifndef HAVE_REALPATH +/** + * realpath - If there is no realpath on the system + */ +static char *realpath(const char *path, char *resolved_path) +{ + strncpy(resolved_path, path, PATH_MAX); + resolved_path[PATH_MAX] = '\0'; + return resolved_path; +} +#endif + +/** + * ntfs_mntent_check - desc + * + * If you are wanting to use this, you actually wanted to use + * ntfs_check_if_mounted(), you just didn't realize. (-: + * + * See description of ntfs_check_if_mounted(), below. + */ +static int ntfs_mntent_check(const char *file, unsigned long *mnt_flags) +{ + struct mntent *mnt; + char *real_file = NULL, *real_fsname = NULL; + FILE *f; + int err = 0; + + real_file = ntfs_malloc(PATH_MAX + 1); + if (!real_file) + return -1; + real_fsname = ntfs_malloc(PATH_MAX + 1); + if (!real_fsname) { + err = errno; + goto exit; + } + if (!realpath(file, real_file)) { + err = errno; + goto exit; + } + if (!(f = setmntent(MOUNTED, "r"))) { + err = errno; + goto exit; + } + while ((mnt = getmntent(f))) { + if (!realpath(mnt->mnt_fsname, real_fsname)) + continue; + if (!strcmp(real_file, real_fsname)) + break; + } + endmntent(f); + if (!mnt) + goto exit; + *mnt_flags = NTFS_MF_MOUNTED; + if (!strcmp(mnt->mnt_dir, "/")) + *mnt_flags |= NTFS_MF_ISROOT; +#ifdef HAVE_HASMNTOPT + if (hasmntopt(mnt, "ro") && !hasmntopt(mnt, "rw")) + *mnt_flags |= NTFS_MF_READONLY; +#endif +exit: + free(real_file); + free(real_fsname); + if (err) { + errno = err; + return -1; + } + return 0; +} +#endif /* HAVE_MNTENT_H */ + +/** + * ntfs_check_if_mounted - check if an ntfs volume is currently mounted + * @file: device file to check + * @mnt_flags: pointer into which to return the ntfs mount flags (see volume.h) + * + * If the running system does not support the {set,get,end}mntent() calls, + * just return 0 and set *@mnt_flags to zero. + * + * When the system does support the calls, ntfs_check_if_mounted() first tries + * to find the device @file in /etc/mtab (or wherever this is kept on the + * running system). If it is not found, assume the device is not mounted and + * return 0 and set *@mnt_flags to zero. + * + * If the device @file is found, set the NTFS_MF_MOUNTED flags in *@mnt_flags. + * + * Further if @file is mounted as the file system root ("/"), set the flag + * NTFS_MF_ISROOT in *@mnt_flags. + * + * Finally, check if the file system is mounted read-only, and if so set the + * NTFS_MF_READONLY flag in *@mnt_flags. + * + * On success return 0 with *@mnt_flags set to the ntfs mount flags. + * + * On error return -1 with errno set to the error code. + */ +int ntfs_check_if_mounted(const char *file __attribute__((unused)), + unsigned long *mnt_flags) +{ + *mnt_flags = 0; +#ifdef HAVE_MNTENT_H + return ntfs_mntent_check(file, mnt_flags); +#else + return 0; +#endif +} + +/** + * ntfs_version_is_supported - check if NTFS version is supported. + * @vol: ntfs volume whose version we're interested in. + * + * The function checks if the NTFS volume version is known or not. + * Version 1.1 and 1.2 are used by Windows NT3.x and NT4. + * Version 2.x is used by Windows 2000 Betas. + * Version 3.0 is used by Windows 2000. + * Version 3.1 is used by Windows XP, Windows Server 2003 and Longhorn. + * + * Return 0 if NTFS version is supported otherwise -1 with errno set. + * + * The following error codes are defined: + * EOPNOTSUPP - Unknown NTFS version + * EINVAL - Invalid argument + */ +int ntfs_version_is_supported(ntfs_volume *vol) +{ + u8 major, minor; + + if (!vol) { + errno = EINVAL; + return -1; + } + + major = vol->major_ver; + minor = vol->minor_ver; + + if (NTFS_V1_1(major, minor) || NTFS_V1_2(major, minor)) + return 0; + + if (NTFS_V2_X(major, minor)) + return 0; + + if (NTFS_V3_0(major, minor) || NTFS_V3_1(major, minor)) + return 0; + + errno = EOPNOTSUPP; + return -1; +} + +/** + * ntfs_logfile_reset - "empty" $LogFile data attribute value + * @vol: ntfs volume whose $LogFile we intend to reset. + * + * Fill the value of the $LogFile data attribute, i.e. the contents of + * the file, with 0xff's, thus marking the journal as empty. + * + * FIXME(?): We might need to zero the LSN field of every single mft + * record as well. (But, first try without doing that and see what + * happens, since chkdsk might pickup the pieces and do it for us...) + * + * On success return 0. + * + * On error return -1 with errno set to the error code. + */ +int ntfs_logfile_reset(ntfs_volume *vol) +{ + ntfs_inode *ni; + ntfs_attr *na; + int eo; + + if (!vol) { + errno = EINVAL; + return -1; + } + + ni = ntfs_inode_open(vol, FILE_LogFile); + if (!ni) { + ntfs_log_perror("Failed to open inode FILE_LogFile"); + return -1; + } + + na = ntfs_attr_open(ni, AT_DATA, AT_UNNAMED, 0); + if (!na) { + eo = errno; + ntfs_log_perror("Failed to open $FILE_LogFile/$DATA"); + goto error_exit; + } + + if (ntfs_empty_logfile(na)) { + eo = errno; + ntfs_attr_close(na); + goto error_exit; + } + + ntfs_attr_close(na); + return ntfs_inode_close(ni); + +error_exit: + ntfs_inode_close(ni); + errno = eo; + return -1; +} + +/** + * ntfs_volume_write_flags - set the flags of an ntfs volume + * @vol: ntfs volume where we set the volume flags + * @flags: new flags + * + * Set the on-disk volume flags in the mft record of $Volume and + * on volume @vol to @flags. + * + * Return 0 if successful and -1 if not with errno set to the error code. + */ +int ntfs_volume_write_flags(ntfs_volume *vol, const le16 flags) +{ + ATTR_RECORD *a; + VOLUME_INFORMATION *c; + ntfs_attr_search_ctx *ctx; + int ret = -1; /* failure */ + + if (!vol || !vol->vol_ni) { + errno = EINVAL; + return -1; + } + /* Get a pointer to the volume information attribute. */ + ctx = ntfs_attr_get_search_ctx(vol->vol_ni, NULL); + if (!ctx) + return -1; + + if (ntfs_attr_lookup(AT_VOLUME_INFORMATION, AT_UNNAMED, 0, 0, 0, NULL, + 0, ctx)) { + ntfs_log_error("Attribute $VOLUME_INFORMATION was not found " + "in $Volume!\n"); + goto err_out; + } + a = ctx->attr; + /* Sanity check. */ + if (a->non_resident) { + ntfs_log_error("Attribute $VOLUME_INFORMATION must be resident " + "but it isn't.\n"); + errno = EIO; + goto err_out; + } + /* Get a pointer to the value of the attribute. */ + c = (VOLUME_INFORMATION*)(le16_to_cpu(a->value_offset) + (char*)a); + /* Sanity checks. */ + if ((char*)c + le32_to_cpu(a->value_length) > (char*)ctx->mrec + + le32_to_cpu(ctx->mrec->bytes_in_use) || + le16_to_cpu(a->value_offset) + + le32_to_cpu(a->value_length) > le32_to_cpu(a->length)) { + ntfs_log_error("Attribute $VOLUME_INFORMATION in $Volume is " + "corrupt!\n"); + errno = EIO; + goto err_out; + } + /* Set the volume flags. */ + vol->flags = c->flags = flags & VOLUME_FLAGS_MASK; + /* Write them to disk. */ + ntfs_inode_mark_dirty(vol->vol_ni); + if (ntfs_inode_sync(vol->vol_ni)) + goto err_out; + + ret = 0; /* success */ +err_out: + ntfs_attr_put_search_ctx(ctx); + return ret; +} + +int ntfs_volume_error(int err) +{ + int ret; + + switch (err) { + case 0: + ret = NTFS_VOLUME_OK; + break; + case EINVAL: + ret = NTFS_VOLUME_NOT_NTFS; + break; + case EIO: + ret = NTFS_VOLUME_CORRUPT; + break; + case EPERM: + ret = NTFS_VOLUME_HIBERNATED; + break; + case EOPNOTSUPP: + ret = NTFS_VOLUME_UNCLEAN_UNMOUNT; + break; + case EBUSY: + ret = NTFS_VOLUME_LOCKED; + break; + case ENXIO: + ret = NTFS_VOLUME_RAID; + break; + case EACCES: + ret = NTFS_VOLUME_NO_PRIVILEGE; + break; + default: + ret = NTFS_VOLUME_UNKNOWN_REASON; + break; + } + return ret; +} + + +void ntfs_mount_error(const char *volume, const char *mntpoint, int err) +{ + switch (err) { + case NTFS_VOLUME_NOT_NTFS: + ntfs_log_error(invalid_ntfs_msg, volume); + break; + case NTFS_VOLUME_CORRUPT: + ntfs_log_error("%s", corrupt_volume_msg); + break; + case NTFS_VOLUME_HIBERNATED: + ntfs_log_error(hibernated_volume_msg, volume, mntpoint); + break; + case NTFS_VOLUME_UNCLEAN_UNMOUNT: + ntfs_log_error("%s", unclean_journal_msg); + break; + case NTFS_VOLUME_LOCKED: + ntfs_log_error("%s", opened_volume_msg); + break; + case NTFS_VOLUME_RAID: + ntfs_log_error("%s", fakeraid_msg); + break; + case NTFS_VOLUME_NO_PRIVILEGE: + ntfs_log_error(access_denied_msg, volume); + break; + } +} + +int ntfs_set_locale(void) +{ + const char *locale; + + locale = setlocale(LC_ALL, ""); + if (!locale) { + locale = setlocale(LC_ALL, NULL); + ntfs_log_error("Couldn't set local environment, using default " + "'%s'.\n", locale); + return 1; + } + return 0; +} + +/* + * Feed the counts of free clusters and free mft records + */ + +int ntfs_volume_get_free_space(ntfs_volume *vol) +{ + ntfs_attr *na; + int ret; + + ret = -1; /* default return */ + vol->free_clusters = ntfs_attr_get_free_bits(vol->lcnbmp_na); + if (vol->free_clusters < 0) { + ntfs_log_perror("Failed to read NTFS $Bitmap"); + } else { + na = vol->mftbmp_na; + vol->free_mft_records = ntfs_attr_get_free_bits(na); + + if (vol->free_mft_records >= 0) + vol->free_mft_records += (na->allocated_size - na->data_size) << 3; + + if (vol->free_mft_records < 0) + ntfs_log_perror("Failed to calculate free MFT records"); + else + ret = 0; + } + return (ret); +} diff --git a/portlibs/sources/libntfs/volume.h b/portlibs/sources/libntfs/volume.h new file mode 100644 index 00000000..b3f47bf9 --- /dev/null +++ b/portlibs/sources/libntfs/volume.h @@ -0,0 +1,307 @@ +/* + * volume.h - Exports for NTFS volume handling. Originated from the Linux-NTFS project. + * + * Copyright (c) 2000-2004 Anton Altaparmakov + * Copyright (c) 2004-2005 Richard Russon + * Copyright (c) 2005-2006 Yura Pakhuchiy + * Copyright (c) 2005-2009 Szabolcs Szakacsits + * Copyright (c) 2010 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 + */ + +#ifndef _NTFS_VOLUME_H +#define _NTFS_VOLUME_H + +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif + +#ifdef HAVE_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_SYS_PARAM_H +#include <sys/param.h> +#endif +#ifdef HAVE_SYS_MOUNT_H +#include <sys/mount.h> +#endif +#ifdef HAVE_MNTENT_H +#include <mntent.h> +#endif + +/* + * Under Cygwin, DJGPP and FreeBSD we do not have MS_RDONLY, + * so we define them ourselves. + */ +#ifndef MS_RDONLY +#define MS_RDONLY 1 +#endif + +#define MS_EXCLUSIVE 0x08000000 + +#ifndef MS_RECOVER +#define MS_RECOVER 0x10000000 +#endif + +#define MS_IGNORE_HIBERFILE 0x20000000 +#define MS_FORENSIC 0x04000000 /* No modification during mount */ + +/* Forward declaration */ +typedef struct _ntfs_volume ntfs_volume; + +#include "param.h" +#include "types.h" +#include "support.h" +#include "device.h" +#include "inode.h" +#include "attrib.h" +#include "index.h" + +/** + * enum ntfs_mount_flags - + * + * Flags returned by the ntfs_check_if_mounted() function. + */ +typedef enum { + NTFS_MF_MOUNTED = 1, /* Device is mounted. */ + NTFS_MF_ISROOT = 2, /* Device is mounted as system root. */ + NTFS_MF_READONLY = 4, /* Device is mounted read-only. */ +} ntfs_mount_flags; + +extern int ntfs_check_if_mounted(const char *file, unsigned long *mnt_flags); + +typedef enum { + NTFS_VOLUME_OK = 0, + NTFS_VOLUME_SYNTAX_ERROR = 11, + NTFS_VOLUME_NOT_NTFS = 12, + NTFS_VOLUME_CORRUPT = 13, + NTFS_VOLUME_HIBERNATED = 14, + NTFS_VOLUME_UNCLEAN_UNMOUNT = 15, + NTFS_VOLUME_LOCKED = 16, + NTFS_VOLUME_RAID = 17, + NTFS_VOLUME_UNKNOWN_REASON = 18, + NTFS_VOLUME_NO_PRIVILEGE = 19, + NTFS_VOLUME_OUT_OF_MEMORY = 20, + NTFS_VOLUME_FUSE_ERROR = 21, + NTFS_VOLUME_INSECURE = 22 +} ntfs_volume_status; + +/** + * enum ntfs_volume_state_bits - + * + * Defined bits for the state field in the ntfs_volume structure. + */ +typedef enum { + NV_ReadOnly, /* 1: Volume is read-only. */ + NV_CaseSensitive, /* 1: Volume is mounted case-sensitive. */ + NV_LogFileEmpty, /* 1: $logFile journal is empty. */ + NV_ShowSysFiles, /* 1: Show NTFS metafiles. */ + NV_ShowHidFiles, /* 1: Show files marked hidden. */ + NV_HideDotFiles, /* 1: Set hidden flag on dot files */ + NV_Compression, /* 1: allow compression */ +} ntfs_volume_state_bits; + +#define test_nvol_flag(nv, flag) test_bit(NV_##flag, (nv)->state) +#define set_nvol_flag(nv, flag) set_bit(NV_##flag, (nv)->state) +#define clear_nvol_flag(nv, flag) clear_bit(NV_##flag, (nv)->state) + +#define NVolReadOnly(nv) test_nvol_flag(nv, ReadOnly) +#define NVolSetReadOnly(nv) set_nvol_flag(nv, ReadOnly) +#define NVolClearReadOnly(nv) clear_nvol_flag(nv, ReadOnly) + +#define NVolCaseSensitive(nv) test_nvol_flag(nv, CaseSensitive) +#define NVolSetCaseSensitive(nv) set_nvol_flag(nv, CaseSensitive) +#define NVolClearCaseSensitive(nv) clear_nvol_flag(nv, CaseSensitive) + +#define NVolLogFileEmpty(nv) test_nvol_flag(nv, LogFileEmpty) +#define NVolSetLogFileEmpty(nv) set_nvol_flag(nv, LogFileEmpty) +#define NVolClearLogFileEmpty(nv) clear_nvol_flag(nv, LogFileEmpty) + +#define NVolShowSysFiles(nv) test_nvol_flag(nv, ShowSysFiles) +#define NVolSetShowSysFiles(nv) set_nvol_flag(nv, ShowSysFiles) +#define NVolClearShowSysFiles(nv) clear_nvol_flag(nv, ShowSysFiles) + +#define NVolShowHidFiles(nv) test_nvol_flag(nv, ShowHidFiles) +#define NVolSetShowHidFiles(nv) set_nvol_flag(nv, ShowHidFiles) +#define NVolClearShowHidFiles(nv) clear_nvol_flag(nv, ShowHidFiles) + +#define NVolHideDotFiles(nv) test_nvol_flag(nv, HideDotFiles) +#define NVolSetHideDotFiles(nv) set_nvol_flag(nv, HideDotFiles) +#define NVolClearHideDotFiles(nv) clear_nvol_flag(nv, HideDotFiles) + +#define NVolCompression(nv) test_nvol_flag(nv, Compression) +#define NVolSetCompression(nv) set_nvol_flag(nv, Compression) +#define NVolClearCompression(nv) clear_nvol_flag(nv, Compression) + +/* + * NTFS version 1.1 and 1.2 are used by Windows NT4. + * NTFS version 2.x is used by Windows 2000 Beta + * NTFS version 3.0 is used by Windows 2000. + * NTFS version 3.1 is used by Windows XP, 2003 and Vista. + */ + +#define NTFS_V1_1(major, minor) ((major) == 1 && (minor) == 1) +#define NTFS_V1_2(major, minor) ((major) == 1 && (minor) == 2) +#define NTFS_V2_X(major, minor) ((major) == 2) +#define NTFS_V3_0(major, minor) ((major) == 3 && (minor) == 0) +#define NTFS_V3_1(major, minor) ((major) == 3 && (minor) == 1) + +#define NTFS_BUF_SIZE 8192 + +/** + * struct _ntfs_volume - structure describing an open volume in memory. + */ +struct _ntfs_volume { + union { + struct ntfs_device *dev; /* NTFS device associated with + the volume. */ + void *sb; /* For kernel porting compatibility. */ + }; + char *vol_name; /* Name of the volume. */ + unsigned long state; /* NTFS specific flags describing this volume. + See ntfs_volume_state_bits above. */ + + ntfs_inode *vol_ni; /* ntfs_inode structure for FILE_Volume. */ + u8 major_ver; /* Ntfs major version of volume. */ + u8 minor_ver; /* Ntfs minor version of volume. */ + le16 flags; /* Bit array of VOLUME_* flags. */ + + u16 sector_size; /* Byte size of a sector. */ + u8 sector_size_bits; /* Log(2) of the byte size of a sector. */ + u32 cluster_size; /* Byte size of a cluster. */ + u32 mft_record_size; /* Byte size of a mft record. */ + u32 indx_record_size; /* Byte size of a INDX record. */ + u8 cluster_size_bits; /* Log(2) of the byte size of a cluster. */ + u8 mft_record_size_bits;/* Log(2) of the byte size of a mft record. */ + u8 indx_record_size_bits;/* Log(2) of the byte size of a INDX record. */ + + /* Variables used by the cluster and mft allocators. */ + u8 mft_zone_multiplier; /* Initial mft zone multiplier. */ + u8 full_zones; /* cluster zones which are full */ + s64 mft_data_pos; /* Mft record number at which to allocate the + next mft record. */ + LCN mft_zone_start; /* First cluster of the mft zone. */ + LCN mft_zone_end; /* First cluster beyond the mft zone. */ + LCN mft_zone_pos; /* Current position in the mft zone. */ + LCN data1_zone_pos; /* Current position in the first data zone. */ + LCN data2_zone_pos; /* Current position in the second data zone. */ + + s64 nr_clusters; /* Volume size in clusters, hence also the + number of bits in lcn_bitmap. */ + ntfs_inode *lcnbmp_ni; /* ntfs_inode structure for FILE_Bitmap. */ + ntfs_attr *lcnbmp_na; /* ntfs_attr structure for the data attribute + of FILE_Bitmap. Each bit represents a + cluster on the volume, bit 0 representing + lcn 0 and so on. A set bit means that the + cluster and vice versa. */ + + LCN mft_lcn; /* Logical cluster number of the data attribute + for FILE_MFT. */ + ntfs_inode *mft_ni; /* ntfs_inode structure for FILE_MFT. */ + ntfs_attr *mft_na; /* ntfs_attr structure for the data attribute + of FILE_MFT. */ + ntfs_attr *mftbmp_na; /* ntfs_attr structure for the bitmap attribute + of FILE_MFT. Each bit represents an mft + record in the $DATA attribute, bit 0 + representing mft record 0 and so on. A set + bit means that the mft record is in use and + vice versa. */ + + ntfs_inode *secure_ni; /* ntfs_inode structure for FILE $Secure */ + ntfs_index_context *secure_xsii; /* index for using $Secure:$SII */ + ntfs_index_context *secure_xsdh; /* index for using $Secure:$SDH */ + int secure_reentry; /* check for non-rentries */ + unsigned int secure_flags; /* flags, see security.h for values */ + + int mftmirr_size; /* Size of the FILE_MFTMirr in mft records. */ + LCN mftmirr_lcn; /* Logical cluster number of the data attribute + for FILE_MFTMirr. */ + ntfs_inode *mftmirr_ni; /* ntfs_inode structure for FILE_MFTMirr. */ + ntfs_attr *mftmirr_na; /* ntfs_attr structure for the data attribute + of FILE_MFTMirr. */ + + ntfschar *upcase; /* Upper case equivalents of all 65536 2-byte + Unicode characters. Obtained from + FILE_UpCase. */ + u32 upcase_len; /* Length in Unicode characters of the upcase + table. */ + ntfschar *locase; /* Lower case equivalents of all 65536 2-byte + Unicode characters. Only if option + case_ignore is set. */ + + ATTR_DEF *attrdef; /* Attribute definitions. Obtained from + FILE_AttrDef. */ + s32 attrdef_len; /* Size of the attribute definition table in + bytes. */ + + s64 free_clusters; /* Track the number of free clusters which + greatly improves statfs() performance */ + s64 free_mft_records; /* Same for free mft records (see above) */ + BOOL efs_raw; /* volume is mounted for raw access to + efs-encrypted files */ +#ifdef XATTR_MAPPINGS + struct XATTRMAPPING *xattr_mapping; +#endif /* XATTR_MAPPINGS */ +#if CACHE_INODE_SIZE + struct CACHE_HEADER *xinode_cache; +#endif +#if CACHE_NIDATA_SIZE + struct CACHE_HEADER *nidata_cache; +#endif +#if CACHE_LOOKUP_SIZE + struct CACHE_HEADER *lookup_cache; +#endif +#if CACHE_SECURID_SIZE + struct CACHE_HEADER *securid_cache; +#endif +#if CACHE_LEGACY_SIZE + struct CACHE_HEADER *legacy_cache; +#endif + +}; + +extern const char *ntfs_home; + +extern ntfs_volume *ntfs_volume_alloc(void); + +extern ntfs_volume *ntfs_volume_startup(struct ntfs_device *dev, + unsigned long flags); + +extern ntfs_volume *ntfs_device_mount(struct ntfs_device *dev, + unsigned long flags); + +extern ntfs_volume *ntfs_mount(const char *name, unsigned long flags); +extern int ntfs_umount(ntfs_volume *vol, const BOOL force); + +extern int ntfs_version_is_supported(ntfs_volume *vol); +extern int ntfs_volume_check_hiberfile(ntfs_volume *vol, int verbose); +extern int ntfs_logfile_reset(ntfs_volume *vol); + +extern int ntfs_volume_write_flags(ntfs_volume *vol, const le16 flags); + +extern int ntfs_volume_error(int err); +extern void ntfs_mount_error(const char *vol, const char *mntpoint, int err); + +extern int ntfs_volume_get_free_space(ntfs_volume *vol); + +extern int ntfs_set_shown_files(ntfs_volume *vol, + BOOL show_sys_files, BOOL show_hid_files, BOOL hide_dot_files); +extern int ntfs_set_locale(void); +extern int ntfs_set_ignore_case(ntfs_volume *vol); + +#endif /* defined _NTFS_VOLUME_H */ + diff --git a/portlibs/sources/libntfs/xattrs.c b/portlibs/sources/libntfs/xattrs.c new file mode 100644 index 00000000..5be2c06a --- /dev/null +++ b/portlibs/sources/libntfs/xattrs.c @@ -0,0 +1,791 @@ +/** + * xattrs.c : common functions to deal with system extended attributes + * + * Copyright (c) 2010 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_SETXATTR /* extended attributes support required */ + +#ifdef HAVE_STDIO_H +#include <stdio.h> +#endif +#ifdef HAVE_STDLIB_H +#include <stdlib.h> +#endif +#ifdef HAVE_STRING_H +#include <string.h> +#endif +#ifdef HAVE_FCNTL_H +#include <fcntl.h> +#endif +#ifdef HAVE_UNISTD_H +#include <unistd.h> +#endif +#ifdef HAVE_ERRNO_H +#include <errno.h> +#endif + +#include "types.h" +#include "param.h" +#include "layout.h" +#include "attrib.h" +#include "index.h" +#include "dir.h" +#include "security.h" +#include "acls.h" +#include "efs.h" +#include "reparse.h" +#include "object_id.h" +#include "misc.h" +#include "logging.h" +#include "xattrs.h" + +#if POSIXACLS +#if __BYTE_ORDER == __BIG_ENDIAN + +/* + * Posix ACL structures + */ + +struct LE_POSIX_ACE { + le16 tag; + le16 perms; + le32 id; +} __attribute__((__packed__)); + +struct LE_POSIX_ACL { + u8 version; + u8 flags; + le16 filler; + struct LE_POSIX_ACE ace[0]; +} __attribute__((__packed__)); + +#endif +#endif + +static const char xattr_ntfs_3g[] = "ntfs-3g."; +static const char nf_ns_user_prefix[] = "user."; +static const int nf_ns_user_prefix_len = sizeof(nf_ns_user_prefix) - 1; + +static const char nf_ns_xattr_ntfs_acl[] = "system.ntfs_acl"; +static const char nf_ns_xattr_attrib[] = "system.ntfs_attrib"; +static const char nf_ns_xattr_attrib_be[] = "system.ntfs_attrib_be"; +static const char nf_ns_xattr_efsinfo[] = "system.ntfs_efsinfo"; +static const char nf_ns_xattr_reparse[] = "system.ntfs_reparse_data"; +static const char nf_ns_xattr_object_id[] = "system.ntfs_object_id"; +static const char nf_ns_xattr_dos_name[] = "system.ntfs_dos_name"; +static const char nf_ns_xattr_times[] = "system.ntfs_times"; +static const char nf_ns_xattr_times_be[] = "system.ntfs_times_be"; +static const char nf_ns_xattr_crtime[] = "system.ntfs_crtime"; +static const char nf_ns_xattr_crtime_be[] = "system.ntfs_crtime_be"; +static const char nf_ns_xattr_posix_access[] = "system.posix_acl_access"; +static const char nf_ns_xattr_posix_default[] = "system.posix_acl_default"; + +static const char nf_ns_alt_xattr_efsinfo[] = "user.ntfs.efsinfo"; + +struct XATTRNAME { + enum SYSTEMXATTRS xattr; + const char *name; +} ; + +static struct XATTRNAME nf_ns_xattr_names[] = { + { XATTR_NTFS_ACL, nf_ns_xattr_ntfs_acl }, + { XATTR_NTFS_ATTRIB, nf_ns_xattr_attrib }, + { XATTR_NTFS_ATTRIB_BE, nf_ns_xattr_attrib_be }, + { XATTR_NTFS_EFSINFO, nf_ns_xattr_efsinfo }, + { XATTR_NTFS_REPARSE_DATA, nf_ns_xattr_reparse }, + { XATTR_NTFS_OBJECT_ID, nf_ns_xattr_object_id }, + { XATTR_NTFS_DOS_NAME, nf_ns_xattr_dos_name }, + { XATTR_NTFS_TIMES, nf_ns_xattr_times }, + { XATTR_NTFS_TIMES_BE, nf_ns_xattr_times_be }, + { XATTR_NTFS_CRTIME, nf_ns_xattr_crtime }, + { XATTR_NTFS_CRTIME_BE, nf_ns_xattr_crtime_be }, + { XATTR_POSIX_ACC, nf_ns_xattr_posix_access }, + { XATTR_POSIX_DEF, nf_ns_xattr_posix_default }, + { XATTR_UNMAPPED, (char*)NULL } /* terminator */ +}; + +/* + * Make an integer big-endian + * + * Swap bytes on a small-endian computer and does nothing on a + * big-endian computer. + */ + +static void fix_big_endian(char *p, int size) +{ +#if __BYTE_ORDER == __LITTLE_ENDIAN + int i,j; + int c; + + i = 0; + j = size - 1; + while (i < j) { + c = p[i]; + p[i++] = p[j]; + p[j--] = c; + } +#endif +} + +#if POSIXACLS +#if __BYTE_ORDER == __BIG_ENDIAN + +/* + * Make a Posix ACL CPU endian + */ + +static int le_acl_to_cpu(const struct LE_POSIX_ACL *le_acl, size_t size, + struct POSIX_ACL *acl) +{ + int i; + int cnt; + + acl->version = le_acl->version; + acl->flags = le_acl->flags; + acl->filler = 0; + cnt = (size - sizeof(struct LE_POSIX_ACL)) / sizeof(struct LE_POSIX_ACE); + for (i=0; i<cnt; i++) { + acl->ace[i].tag = le16_to_cpu(le_acl->ace[i].tag); + acl->ace[i].perms = le16_to_cpu(le_acl->ace[i].perms); + acl->ace[i].id = le32_to_cpu(le_acl->ace[i].id); + } + return (0); +} + +/* + * Make a Posix ACL little endian + */ + +int cpu_to_le_acl(const struct POSIX_ACL *acl, size_t size, + struct LE_POSIX_ACL *le_acl) +{ + int i; + int cnt; + + le_acl->version = acl->version; + le_acl->flags = acl->flags; + le_acl->filler = const_cpu_to_le16(0); + cnt = (size - sizeof(struct POSIX_ACL)) / sizeof(struct POSIX_ACE); + for (i=0; i<cnt; i++) { + le_acl->ace[i].tag = cpu_to_le16(acl->ace[i].tag); + le_acl->ace[i].perms = cpu_to_le16(acl->ace[i].perms); + le_acl->ace[i].id = cpu_to_le32(acl->ace[i].id); + } + return (0); +} + +#endif +#endif + +/* + * Determine whether an extended attribute is mapped to + * internal data (original name in system namespace, or renamed) + */ + +enum SYSTEMXATTRS ntfs_xattr_system_type(const char *name, + ntfs_volume *vol) +{ + struct XATTRNAME *p; + enum SYSTEMXATTRS ret; +#ifdef XATTR_MAPPINGS + const struct XATTRMAPPING *q; +#endif /* XATTR_MAPPINGS */ + + p = nf_ns_xattr_names; + while (p->name && strcmp(p->name,name)) + p++; + ret = p->xattr; +#ifdef XATTR_MAPPINGS + if (!p->name && vol && vol->xattr_mapping) { + q = vol->xattr_mapping; + while (q && strcmp(q->name,name)) + q = q->next; + if (q) + ret = q->xattr; + } +#else /* XATTR_MAPPINGS */ + if (!p->name + && vol + && vol->efs_raw + && !strcmp(nf_ns_alt_xattr_efsinfo,name)) + ret = XATTR_NTFS_EFSINFO; +#endif /* XATTR_MAPPINGS */ + return (ret); +} + +#ifdef XATTR_MAPPINGS + +/* + * Basic read from a user mapping file on another volume + */ + +static int basicread(void *fileid, char *buf, size_t size, off_t offs __attribute__((unused))) +{ + return (read(*(int*)fileid, buf, size)); +} + + +/* + * Read from a user mapping file on current NTFS partition + */ + +static int localread(void *fileid, char *buf, size_t size, off_t offs) +{ + return (ntfs_attr_data_read((ntfs_inode*)fileid, + AT_UNNAMED, 0, buf, size, offs)); +} + +/* + * Get a single mapping item from buffer + * + * Always reads a full line, truncating long lines + * Refills buffer when exhausted + * Returns pointer to item, or NULL when there is no more + * Note : errors are logged, but not returned +// TODO partially share with acls.c + */ + +static struct XATTRMAPPING *getmappingitem(FILEREADER reader, void *fileid, + off_t *poffs, char *buf, int *psrc, s64 *psize) +{ + int src; + int dst; + char *pe; + char *ps; + char *pu; + enum SYSTEMXATTRS xattr; + int gotend; + char maptext[LINESZ]; + struct XATTRMAPPING *item; + + src = *psrc; + dst = 0; + do { + gotend = 0; + while ((src < *psize) + && (buf[src] != '\n')) { + /* ignore spaces */ + if ((dst < LINESZ) + && (buf[src] != '\r') + && (buf[src] != '\t') + && (buf[src] != ' ')) + maptext[dst++] = buf[src]; + src++; + } + if (src >= *psize) { + *poffs += *psize; + *psize = reader(fileid, buf, (size_t)BUFSZ, *poffs); + src = 0; + } else { + gotend = 1; + src++; + maptext[dst] = '\0'; + dst = 0; + } + } while (*psize && ((maptext[0] == '#') || !gotend)); + item = (struct XATTRMAPPING*)NULL; + if (gotend) { + /* decompose into system name and user name */ + ps = maptext; + pu = strchr(maptext,':'); + if (pu) { + *pu++ = 0; + pe = strchr(pu,':'); + if (pe) + *pe = 0; + /* check name validity */ + if ((strlen(pu) < 6) || strncmp(pu,"user.",5)) + pu = (char*)NULL; + xattr = ntfs_xattr_system_type(ps, + (ntfs_volume*)NULL); + if (xattr == XATTR_UNMAPPED) + pu = (char*)NULL; + } + if (pu) { + item = (struct XATTRMAPPING*)ntfs_malloc( + sizeof(struct XATTRMAPPING) + + strlen(pu)); + if (item) { + item->xattr = xattr; + strcpy(item->name,pu); + item->next = (struct XATTRMAPPING*)NULL; + } + } else { + ntfs_log_early_error("Bad xattr mapping item, aborting\n"); + } + } + *psrc = src; + return (item); +} + +/* + * Read xattr mapping file and split into their attribute. + * Parameters are kept in a chained list. + * Returns the head of list, if any + * Errors are logged, but not returned + * + * If an absolute path is provided, the mapping file is assumed + * to be located in another mounted file system, and plain read() + * are used to get its contents. + * If a relative path is provided, the mapping file is assumed + * to be located on the current file system, and internal IO + * have to be used since we are still mounting and we have not + * entered the fuse loop yet. + */ + +static struct XATTRMAPPING *ntfs_read_xattr_mapping(FILEREADER reader, + void *fileid) +{ + char buf[BUFSZ]; + struct XATTRMAPPING *item; + struct XATTRMAPPING *current; + struct XATTRMAPPING *firstitem; + struct XATTRMAPPING *lastitem; + BOOL duplicated; + int src; + off_t offs; + s64 size; + + firstitem = (struct XATTRMAPPING*)NULL; + lastitem = (struct XATTRMAPPING*)NULL; + offs = 0; + size = reader(fileid, buf, (size_t)BUFSZ, (off_t)0); + if (size > 0) { + src = 0; + do { + item = getmappingitem(reader, fileid, &offs, + buf, &src, &size); + if (item) { + /* check no double mapping */ + duplicated = FALSE; + for (current=firstitem; current; current=current->next) + if ((current->xattr == item->xattr) + || !strcmp(current->name,item->name)) + duplicated = TRUE; + if (duplicated) { + free(item); + ntfs_log_early_error("Conflicting xattr mapping ignored\n"); + } else { + item->next = (struct XATTRMAPPING*)NULL; + if (lastitem) + lastitem->next = item; + else + firstitem = item; + lastitem = item; + } + } + } while (item); + } + return (firstitem); +} + +/* + * Build the extended attribute mappings to user namespace + * + * Note : no error is returned. If we refused mounting when there + * is an error it would be too difficult to fix the offending file + */ + +struct XATTRMAPPING *ntfs_xattr_build_mapping(ntfs_volume *vol, + const char *xattrmap_path) +{ + struct XATTRMAPPING *firstmapping; + struct XATTRMAPPING *mapping; + BOOL user_efs; + BOOL notfound; + ntfs_inode *ni; + int fd; + + firstmapping = (struct XATTRMAPPING*)NULL; + notfound = FALSE; + if (!xattrmap_path) + xattrmap_path = XATTRMAPPINGFILE; + if (xattrmap_path[0] == '/') { + fd = open(xattrmap_path,O_RDONLY); + if (fd > 0) { + firstmapping = ntfs_read_xattr_mapping(basicread, (void*)&fd); + close(fd); + } else + notfound = TRUE; + } else { + ni = ntfs_pathname_to_inode(vol, NULL, xattrmap_path); + if (ni) { + firstmapping = ntfs_read_xattr_mapping(localread, ni); + ntfs_inode_close(ni); + } else + notfound = TRUE; + } + if (notfound && strcmp(xattrmap_path, XATTRMAPPINGFILE)) { + ntfs_log_early_error("Could not open \"%s\"\n",xattrmap_path); + } + if (vol->efs_raw) { + user_efs = TRUE; + for (mapping=firstmapping; mapping; mapping=mapping->next) + if (mapping->xattr == XATTR_NTFS_EFSINFO) + user_efs = FALSE; + } else + user_efs = FALSE; + if (user_efs) { + mapping = (struct XATTRMAPPING*)ntfs_malloc( + sizeof(struct XATTRMAPPING) + + strlen(nf_ns_alt_xattr_efsinfo)); + if (mapping) { + mapping->next = firstmapping; + mapping->xattr = XATTR_NTFS_EFSINFO; + strcpy(mapping->name,nf_ns_alt_xattr_efsinfo); + firstmapping = mapping; + } + } + return (firstmapping); +} + +void ntfs_xattr_free_mapping(struct XATTRMAPPING *mapping) +{ + struct XATTRMAPPING *p, *q; + + p = mapping; + while (p) { + q = p->next; + free(p); + p = q; + } +} + +#endif /* XATTR_MAPPINGS */ + + +int ntfs_xattr_system_getxattr(struct SECURITY_CONTEXT *scx, + enum SYSTEMXATTRS attr, + ntfs_inode *ni, ntfs_inode *dir_ni, + char *value, size_t size) +{ + int res; + int i; +#if POSIXACLS +#if __BYTE_ORDER == __BIG_ENDIAN + struct POSIX_ACL *acl; +#endif +#endif + + /* + * the returned value is the needed + * size. If it is too small, no copy + * is done, and the caller has to + * issue a new call with correct size. + */ + switch (attr) { + case XATTR_NTFS_ACL : + res = ntfs_get_ntfs_acl(scx, ni, value, size); + break; +#if POSIXACLS +#if __BYTE_ORDER == __BIG_ENDIAN + case XATTR_POSIX_ACC : + acl = (struct POSIX_ACL*)ntfs_malloc(size); + if (acl) { + res = ntfs_get_posix_acl(scx, ni, + nf_ns_xattr_posix_access, (char*)acl, size); + if (res > 0) { + if (cpu_to_le_acl(acl,res, + (struct LE_POSIX_ACL*)value)) + res = -errno; + } + free(acl); + } else + res = -errno; + break; + case XATTR_POSIX_DEF : + acl = (struct POSIX_ACL*)ntfs_malloc(size); + if (acl) { + res = ntfs_get_posix_acl(scx, ni, + nf_ns_xattr_posix_default, (char*)acl, size); + if (res > 0) { + if (cpu_to_le_acl(acl,res, + (struct LE_POSIX_ACL*)value)) + res = -errno; + } + free(acl); + } else + res = -errno; + break; +#else + case XATTR_POSIX_ACC : + res = ntfs_get_posix_acl(scx, ni, nf_ns_xattr_posix_access, + value, size); + break; + case XATTR_POSIX_DEF : + res = ntfs_get_posix_acl(scx, ni, nf_ns_xattr_posix_default, + value, size); + break; +#endif +#endif + case XATTR_NTFS_ATTRIB : + res = ntfs_get_ntfs_attrib(ni, value, size); + break; + case XATTR_NTFS_ATTRIB_BE : + res = ntfs_get_ntfs_attrib(ni, value, size); + if ((res == 4) && value) { + if (size >= 4) + fix_big_endian(value,4); + else + res = -EINVAL; + } + break; + case XATTR_NTFS_EFSINFO : + if (ni->vol->efs_raw) + res = ntfs_get_efs_info(ni, value, size); + else + res = -EPERM; + break; + case XATTR_NTFS_REPARSE_DATA : + res = ntfs_get_ntfs_reparse_data(ni, value, size); + break; + case XATTR_NTFS_OBJECT_ID : + res = ntfs_get_ntfs_object_id(ni, value, size); + break; + case XATTR_NTFS_DOS_NAME: + if (dir_ni) + res = ntfs_get_ntfs_dos_name(ni, dir_ni, value, size); + else + res = -errno; + break; + case XATTR_NTFS_TIMES: + res = ntfs_inode_get_times(ni, value, size); + break; + case XATTR_NTFS_TIMES_BE: + res = ntfs_inode_get_times(ni, value, size); + if ((res > 0) && value) { + for (i=0; (i+1)*sizeof(u64)<=(unsigned int)res; i++) + fix_big_endian(&value[i*sizeof(u64)], + sizeof(u64)); + } + break; + case XATTR_NTFS_CRTIME: + res = ntfs_inode_get_times(ni, value, + (size >= sizeof(u64) ? sizeof(u64) : size)); + break; + case XATTR_NTFS_CRTIME_BE: + res = ntfs_inode_get_times(ni, value, + (size >= sizeof(u64) ? sizeof(u64) : size)); + if ((res >= (int)sizeof(u64)) && value) + fix_big_endian(value,sizeof(u64)); + break; + default : + errno = EOPNOTSUPP; + res = -errno; + break; + } + return (res); +} + +int ntfs_xattr_system_setxattr(struct SECURITY_CONTEXT *scx, + enum SYSTEMXATTRS attr, + ntfs_inode *ni, ntfs_inode *dir_ni, + const char *value, size_t size, int flags) +{ + int res; + int i; + char buf[4*sizeof(u64)]; +#if POSIXACLS +#if __BYTE_ORDER == __BIG_ENDIAN + struct POSIX_ACL *acl; +#endif +#endif + + switch (attr) { + case XATTR_NTFS_ACL : + res = ntfs_set_ntfs_acl(scx, ni, value, size, flags); + break; +#if POSIXACLS +#if __BYTE_ORDER == __BIG_ENDIAN + case XATTR_POSIX_ACC : + acl = (struct POSIX_ACL*)ntfs_malloc(size); + if (acl) { + if (!le_acl_to_cpu((const struct LE_POSIX_ACL*)value, + size, acl)) { + res = ntfs_set_posix_acl(scx ,ni , + nf_ns_xattr_posix_access, + (char*)acl, size, flags); + } else + res = -errno; + free(acl); + } else + res = -errno; + break; + case XATTR_POSIX_DEF : + acl = (struct POSIX_ACL*)ntfs_malloc(size); + if (acl) { + if (!le_acl_to_cpu((const struct LE_POSIX_ACL*)value, + size, acl)) { + res = ntfs_set_posix_acl(scx ,ni , + nf_ns_xattr_posix_default, + (char*)acl, size, flags); + } else + res = -errno; + free(acl); + } else + res = -errno; + break; +#else + case XATTR_POSIX_ACC : + res = ntfs_set_posix_acl(scx ,ni , nf_ns_xattr_posix_access, + value, size, flags); + break; + case XATTR_POSIX_DEF : + res = ntfs_set_posix_acl(scx, ni, nf_ns_xattr_posix_default, + value, size, flags); + break; +#endif +#endif + case XATTR_NTFS_ATTRIB : + res = ntfs_set_ntfs_attrib(ni, value, size, flags); + break; + case XATTR_NTFS_ATTRIB_BE : + if (value && (size >= 4)) { + memcpy(buf,value,4); + fix_big_endian(buf,4); + res = ntfs_set_ntfs_attrib(ni, buf, 4, flags); + } else + res = ntfs_set_ntfs_attrib(ni, value, size, flags); + break; + case XATTR_NTFS_EFSINFO : + if (ni->vol->efs_raw) + res = ntfs_set_efs_info(ni, value, size, flags); + else + res = -EPERM; + break; + case XATTR_NTFS_REPARSE_DATA : + res = ntfs_set_ntfs_reparse_data(ni, value, size, flags); + break; + case XATTR_NTFS_OBJECT_ID : + res = ntfs_set_ntfs_object_id(ni, value, size, flags); + break; + case XATTR_NTFS_DOS_NAME: + if (dir_ni) + /* warning : this closes both inodes */ + res = ntfs_set_ntfs_dos_name(ni, dir_ni, value, + size, flags); + else + res = -errno; + break; + case XATTR_NTFS_TIMES: + res = ntfs_inode_set_times(ni, value, size, flags); + break; + case XATTR_NTFS_TIMES_BE: + if (value && (size > 0) && (size <= 4*sizeof(u64))) { + memcpy(buf,value,size); + for (i=0; (i+1)*sizeof(u64)<=size; i++) + fix_big_endian(&buf[i*sizeof(u64)], + sizeof(u64)); + res = ntfs_inode_set_times(ni, buf, size, flags); + } else + res = ntfs_inode_set_times(ni, value, size, flags); + break; + case XATTR_NTFS_CRTIME: + res = ntfs_inode_set_times(ni, value, + (size >= sizeof(u64) ? sizeof(u64) : size), flags); + break; + case XATTR_NTFS_CRTIME_BE: + if (value && (size >= sizeof(u64))) { + memcpy(buf,value,sizeof(u64)); + fix_big_endian(buf,sizeof(u64)); + res = ntfs_inode_set_times(ni, buf, sizeof(u64), flags); + } else + res = ntfs_inode_set_times(ni, value, size, flags); + break; + default : + errno = EOPNOTSUPP; + res = -errno; + break; + } + return (res); +} + +int ntfs_xattr_system_removexattr(struct SECURITY_CONTEXT *scx, + enum SYSTEMXATTRS attr, + ntfs_inode *ni, ntfs_inode *dir_ni) +{ + int res; + + res = 0; + switch (attr) { + /* + * Removal of NTFS ACL, ATTRIB, EFSINFO or TIMES + * is never allowed + */ + case XATTR_NTFS_ACL : + case XATTR_NTFS_ATTRIB : + case XATTR_NTFS_ATTRIB_BE : + case XATTR_NTFS_EFSINFO : + case XATTR_NTFS_TIMES : + case XATTR_NTFS_TIMES_BE : + case XATTR_NTFS_CRTIME : + case XATTR_NTFS_CRTIME_BE : + res = -EPERM; + break; +#if POSIXACLS + case XATTR_POSIX_ACC : + case XATTR_POSIX_DEF : + if (ni) { + if (!ntfs_allowed_as_owner(scx, ni) + || ntfs_remove_posix_acl(scx, ni, + (attr == XATTR_POSIX_ACC ? + nf_ns_xattr_posix_access : + nf_ns_xattr_posix_default))) + res = -errno; + } else + res = -errno; + break; +#endif + case XATTR_NTFS_REPARSE_DATA : + if (ni) { + if (!ntfs_allowed_as_owner(scx, ni) + || ntfs_remove_ntfs_reparse_data(ni)) + res = -errno; + } else + res = -errno; + break; + case XATTR_NTFS_OBJECT_ID : + if (ni) { + if (!ntfs_allowed_as_owner(scx, ni) + || ntfs_remove_ntfs_object_id(ni)) + res = -errno; + } else + res = -errno; + break; + case XATTR_NTFS_DOS_NAME: + if (ni && dir_ni) { + if (ntfs_remove_ntfs_dos_name(ni,dir_ni)) + res = -errno; + /* ni and dir_ni have been closed */ + } else + res = -errno; + break; + default : + errno = EOPNOTSUPP; + res = -errno; + break; + } + return (res); +} + +#endif /* HAVE_SETXATTR */ diff --git a/portlibs/sources/libntfs/xattrs.h b/portlibs/sources/libntfs/xattrs.h new file mode 100644 index 00000000..51583114 --- /dev/null +++ b/portlibs/sources/libntfs/xattrs.h @@ -0,0 +1,75 @@ +/* + * xattrs.h : definitions related to system extended attributes + * + * Copyright (c) 2010 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 + */ + +#ifndef _NTFS_XATTR_H_ +#define _NTFS_XATTR_H_ + +/* + * Identification of data mapped to the system name space + */ + +enum SYSTEMXATTRS { + XATTR_UNMAPPED, + XATTR_NTFS_ACL, + XATTR_NTFS_ATTRIB, + XATTR_NTFS_ATTRIB_BE, + XATTR_NTFS_EFSINFO, + XATTR_NTFS_REPARSE_DATA, + XATTR_NTFS_OBJECT_ID, + XATTR_NTFS_DOS_NAME, + XATTR_NTFS_TIMES, + XATTR_NTFS_TIMES_BE, + XATTR_NTFS_CRTIME, + XATTR_NTFS_CRTIME_BE, + XATTR_POSIX_ACC, + XATTR_POSIX_DEF +} ; + +struct XATTRMAPPING { + struct XATTRMAPPING *next; + enum SYSTEMXATTRS xattr; + char name[1]; /* variable length */ +} ; + +#ifdef XATTR_MAPPINGS + +struct XATTRMAPPING *ntfs_xattr_build_mapping(ntfs_volume *vol, + const char *path); +void ntfs_xattr_free_mapping(struct XATTRMAPPING*); + +#endif /* XATTR_MAPPINGS */ + +enum SYSTEMXATTRS ntfs_xattr_system_type(const char *name, + ntfs_volume *vol); + +int ntfs_xattr_system_getxattr(struct SECURITY_CONTEXT *scx, + enum SYSTEMXATTRS attr, + ntfs_inode *ni, ntfs_inode *dir_ni, + char *value, size_t size); +int ntfs_xattr_system_setxattr(struct SECURITY_CONTEXT *scx, + enum SYSTEMXATTRS attr, + ntfs_inode *ni, ntfs_inode *dir_ni, + const char *value, size_t size, int flags); +int ntfs_xattr_system_removexattr(struct SECURITY_CONTEXT *scx, + enum SYSTEMXATTRS attr, + ntfs_inode *ni, ntfs_inode *dir_ni); + +#endif /* _NTFS_XATTR_H_ */ diff --git a/resources/app_booter/Makefile b/resources/app_booter/Makefile new file mode 100644 index 00000000..8595d247 --- /dev/null +++ b/resources/app_booter/Makefile @@ -0,0 +1,158 @@ +#--------------------------------------------------------------------------------- +# Clear the implicit built in rules +#--------------------------------------------------------------------------------- +.SUFFIXES: +#--------------------------------------------------------------------------------- +ifeq ($(strip $(DEVKITPPC)),) +$(error "Please set DEVKITPPC in your environment. export DEVKITPPC=<path to>devkitPPC") +endif +export PORTLIBS := ../../portlibs/ppc +export PATH := $(DEVKITPPC)/bin:$(PORTLIBS)/bin:$(PATH) +export LIBOGC_INC := $(DEVKITPRO)/libogc/include +export LIBOGC_LIB := $(DEVKITPRO)/libogc/lib/wii + +PREFIX := powerpc-gekko- + +export AS := $(PREFIX)as +export CC := $(PREFIX)gcc +export CXX := $(PREFIX)g++ +export AR := $(PREFIX)ar +export LD := $(PREFIX)ld +export OBJCOPY := $(PREFIX)objcopy + +#--------------------------------------------------------------------------------- +# TARGET is the name of the output +# BUILD is the directory where object files & intermediate files will be placed +# SOURCES is a list of directories containing source code +# INCLUDES is a list of directories containing extra header files +#--------------------------------------------------------------------------------- +TARGET := app_booter +BUILD := build +SOURCES := source +DATA := data +INCLUDES := + +#--------------------------------------------------------------------------------- +# options for code generation +#--------------------------------------------------------------------------------- +MACHDEP := -mno-eabi -mno-sdata -mcpu=750 +CFLAGS := -Wall -W -Os -ffreestanding -std=gnu99 -Wstrict-aliasing=2 $(MACHDEP) $(INCLUDE) +CXXFLAGS := $(CFLAGS) + +#--------------------------------------------------------------------------------- +# move loader to another location - THANKS CREDIAR - 0x81330000 for HBC +#--------------------------------------------------------------------------------- +#LDFLAGS = -g $(MACHDEP) -Wl,-Map,$(notdir $@).map +#LDFLAGS = -g $(MACHDEP) -Wl,-Map,$(notdir $@).map -Wl,--section-start,.init=0x80003f00 +Q := @ +MAKEFLAGS += --no-print-directory +#--------------------------------------------------------------------------------- +# any extra libraries we wish to link with the project +#--------------------------------------------------------------------------------- +#LIBS := + +#--------------------------------------------------------------------------------- +# list of directories containing libraries, this must be the top level containing +# include and lib +#--------------------------------------------------------------------------------- +#LIBDIRS := $(CURDIR) + +#--------------------------------------------------------------------------------- +# no real need to edit anything past this point unless you need to add additional +# rules for different file extensions +#--------------------------------------------------------------------------------- +ifneq ($(BUILD),$(notdir $(CURDIR))) +#--------------------------------------------------------------------------------- + +export OUTPUT := $(CURDIR)/$(TARGET) + +export VPATH := $(foreach dir,$(SOURCES),$(CURDIR)/$(dir)) \ + $(foreach dir,$(DATA),$(CURDIR)/$(dir)) + +export DEPSDIR := $(CURDIR)/$(BUILD) + +#--------------------------------------------------------------------------------- +# automatically build a list of object files for our project +#--------------------------------------------------------------------------------- +CFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.c))) +CPPFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.cpp))) +sFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.s))) +SFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.S))) +BINFILES := $(foreach dir,$(DATA),$(notdir $(wildcard $(dir)/*.*))) +PNGFILES := $(foreach dir,$(SOURCES),$(notdir $(wildcard $(dir)/*.png))) + +#--------------------------------------------------------------------------------- +# use CXX for linking C++ projects, CC for standard C +#--------------------------------------------------------------------------------- +export OFILES := $(addsuffix .o,$(BINFILES)) \ + $(CPPFILES:.cpp=.o) $(CFILES:.c=.o) \ + $(sFILES:.s=.o) $(SFILES:.S=.o) + +#--------------------------------------------------------------------------------- +# build a list of include paths +#--------------------------------------------------------------------------------- +export INCLUDE := $(foreach dir,$(INCLUDES), -iquote $(CURDIR)/$(dir)) \ + $(foreach dir,$(LIBDIRS),-I$(dir)/include) \ + -I$(CURDIR)/$(BUILD) \ + -I$(LIBOGC_INC) + +#--------------------------------------------------------------------------------- +# build a list of library paths +#--------------------------------------------------------------------------------- +export LIBPATHS := $(foreach dir,$(LIBDIRS),-L$(dir)/lib) \ + -L$(LIBOGC_LIB) + +export OUTPUT := $(CURDIR)/$(TARGET) +.PHONY: $(BUILD) clean install + +#--------------------------------------------------------------------------------- +$(BUILD): + @[ -d $@ ] || mkdir -p $@ + @$(MAKE) --no-print-directory -C $(BUILD) -f $(CURDIR)/Makefile + +#--------------------------------------------------------------------------------- +clean: + @echo clean ... + @rm -fr $(BUILD) $(OUTPUT).elf $(OUTPUT).bin + +#--------------------------------------------------------------------------------- +install: + @echo Installing to WiiFlow Source... + @cp $(OUTPUT).bin ../../data/ + @echo DONE! + +#--------------------------------------------------------------------------------- +else + +DEPENDS := $(OFILES:.o=.d) + +#--------------------------------------------------------------------------------- +# main targets +#--------------------------------------------------------------------------------- +$(OUTPUT).bin: $(OUTPUT).elf +$(OUTPUT).elf: $(OFILES) + +#--------------------------------------------------------------------------------- +# This rule links in binary data with the .jpg extension +#--------------------------------------------------------------------------------- +%.bin: %.elf + @echo " OBJCOPY $@" + $(Q)$(OBJCOPY) -O binary $< $@ + +%.elf: link.ld $(OFILES) + @echo " LINK $@" + $(Q)$(LD) -n -T $^ $(LDFLAGS) -o $@ + +%.o: %.c + @echo " COMPILE $@" + $(Q)$(CC) $(CFLAGS) -c $< -o $@ + +%.o: %.s + @echo " ASSEMBLE $@" + $(Q)$(CC) $(CFLAGS) -c $< -o $@ + +-include $(DEPENDS) + +#--------------------------------------------------------------------------------- +endif +#--------------------------------------------------------------------------------- diff --git a/resources/app_booter/forwarder.pnproj b/resources/app_booter/forwarder.pnproj new file mode 100644 index 00000000..37bf9717 --- /dev/null +++ b/resources/app_booter/forwarder.pnproj @@ -0,0 +1 @@ +<Project name="Forwarder"><Folder name="source"><Folder name="images"><File path="source\images\background.png"></File><File path="source\images\background169.png"></File></Folder><File path="source\cfg.c"></File><File path="source\cfg.h"></File><File path="source\dolloader.c"></File><File path="source\dolloader.h"></File><File path="source\elfloader.c"></File><File path="source\elfloader.h"></File><File path="source\elf_abi.h"></File><File path="source\fatmounter.c"></File><File path="source\fatmounter.h"></File><File path="source\filelist.h"></File><File path="source\main.cpp"></File><File path="source\video.cpp"></File><File path="source\video.h"></File></Folder><File path="Makefile"></File></Project> \ No newline at end of file diff --git a/resources/app_booter/forwarder.pnps b/resources/app_booter/forwarder.pnps new file mode 100644 index 00000000..1697fa21 --- /dev/null +++ b/resources/app_booter/forwarder.pnps @@ -0,0 +1 @@ +<pd><ViewState><e p="Forwarder" x="true"></e><e p="Forwarder\source" x="false"></e></ViewState></pd> \ No newline at end of file diff --git a/resources/app_booter/readme.txt b/resources/app_booter/readme.txt new file mode 100644 index 00000000..27c9eed3 --- /dev/null +++ b/resources/app_booter/readme.txt @@ -0,0 +1,6 @@ +Copyright 2011 Dimok +This code is licensed to you under the terms of the GNU GPL, version 2; +see file COPYING or http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt + +Compile: +Requires devkitPPC R17 (not working with R18+). \ No newline at end of file diff --git a/resources/app_booter/source/crt0.s b/resources/app_booter/source/crt0.s new file mode 100644 index 00000000..23ab29a0 --- /dev/null +++ b/resources/app_booter/source/crt0.s @@ -0,0 +1,21 @@ +# Copyright 2008-2009 Segher Boessenkool <segher@kernel.crashing.org> +# This code is licensed to you under the terms of the GNU GPL, version 2; +# see file COPYING or http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt + + .globl _start +_start: + + # Disable interrupts, enable FP. + mfmsr 3 ; rlwinm 3,3,0,17,15 ; ori 3,3,0x2000 ; mtmsr 3 ; isync + + # Setup stack. + lis 1,_stack_top@ha ; addi 1,1,_stack_top@l ; li 0,0 ; stwu 0,-64(1) + + # Clear BSS. + lis 3,__bss_start@ha ; addi 3,3,__bss_start@l + li 4,0 + lis 5,__bss_end@ha ; addi 5,5,__bss_end@l ; sub 5,5,3 + bl memset + + # Go! + b main diff --git a/resources/app_booter/source/dolloader.c b/resources/app_booter/source/dolloader.c new file mode 100644 index 00000000..5f635e6c --- /dev/null +++ b/resources/app_booter/source/dolloader.c @@ -0,0 +1,56 @@ +#include <gctypes.h> +#include "string.h" +#include "dolloader.h" +#include "sync.h" + +#define ARENA1_HI_LIMIT 0x81800000 + +typedef struct _dolheader { + u32 text_pos[7]; + u32 data_pos[11]; + u32 text_start[7]; + u32 data_start[11]; + u32 text_size[7]; + u32 data_size[11]; + u32 bss_start; + u32 bss_size; + u32 entry_point; +} dolheader; + +u32 load_dol_image(const void *dolstart) +{ + if(!dolstart) + return 0; + + u32 i; + dolheader *dolfile = (dolheader *) dolstart; + +/* if (dolfile->bss_start > 0 && dolfile->bss_start < ARENA1_HI_LIMIT) { + u32 bss_size = dolfile->bss_size; + if (dolfile->bss_start + bss_size > ARENA1_HI_LIMIT) { + bss_size = ARENA1_HI_LIMIT - dolfile->bss_start; + } + memset((void *) dolfile->bss_start, 0, bss_size); + sync_before_exec((void *) dolfile->bss_start, bss_size); + } */ + + for (i = 0; i < 7; i++) + { + if ((!dolfile->text_size[i]) || (dolfile->text_start[i] < 0x100)) + continue; + + memcpy((void *) dolfile->text_start[i], dolstart + dolfile->text_pos[i], dolfile->text_size[i]); + sync_before_exec((void *) dolfile->text_start[i], dolfile->text_size[i]); + } + + for (i = 0; i < 11; i++) + { + if ((!dolfile->data_size[i]) || (dolfile->data_start[i] < 0x100)) + continue; + + memcpy((void *) dolfile->data_start[i], dolstart + dolfile->data_pos[i], dolfile->data_size[i]); + sync_before_exec((void *) dolfile->data_start[i], dolfile->data_size[i]); + } + + return dolfile->entry_point; +} diff --git a/resources/app_booter/source/dolloader.h b/resources/app_booter/source/dolloader.h new file mode 100644 index 00000000..db7bb1fb --- /dev/null +++ b/resources/app_booter/source/dolloader.h @@ -0,0 +1,17 @@ +#ifndef _DOLLOADER_H_ +#define _DOLLOADER_H_ + +#ifdef __cplusplus +extern "C" { +#endif + +typedef void (*entrypoint) (void); + +u32 load_dol_image(const void *dolstart); + + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/resources/app_booter/source/elf_abi.h b/resources/app_booter/source/elf_abi.h new file mode 100644 index 00000000..4d763a19 --- /dev/null +++ b/resources/app_booter/source/elf_abi.h @@ -0,0 +1,593 @@ +/* + * Copyright (c) 1995, 1996, 2001, 2002 + * Erik Theisen. All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * 1. Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * 2. 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. + * 3. The name of the author may not be used to endorse or promote products + * derived from this software without specific prior written permission + * + * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. + */ + +/* + * This is the ELF ABI header file + * formerly known as "elf_abi.h". + */ + +#ifndef _ELF_ABI_H +#define _ELF_ABI_H + +#include <gctypes.h> + +/* + * This version doesn't work for 64-bit ABIs - Erik. + */ + +/* + * These typedefs need to be handled better. + */ +typedef u32 Elf32_Addr; /* Unsigned program address */ +typedef u32 Elf32_Off; /* Unsigned file offset */ +typedef s32 Elf32_Sword; /* Signed large integer */ +typedef u32 Elf32_Word; /* Unsigned large integer */ +typedef u16 Elf32_Half; /* Unsigned medium integer */ + +/* e_ident[] identification indexes */ +#define EI_MAG0 0 /* file ID */ +#define EI_MAG1 1 /* file ID */ +#define EI_MAG2 2 /* file ID */ +#define EI_MAG3 3 /* file ID */ +#define EI_CLASS 4 /* file class */ +#define EI_DATA 5 /* data encoding */ +#define EI_VERSION 6 /* ELF header version */ +#define EI_OSABI 7 /* OS/ABI specific ELF extensions */ +#define EI_ABIVERSION 8 /* ABI target version */ +#define EI_PAD 9 /* start of pad bytes */ +#define EI_NIDENT 16 /* Size of e_ident[] */ + +/* e_ident[] magic number */ +#define ELFMAG0 0x7f /* e_ident[EI_MAG0] */ +#define ELFMAG1 'E' /* e_ident[EI_MAG1] */ +#define ELFMAG2 'L' /* e_ident[EI_MAG2] */ +#define ELFMAG3 'F' /* e_ident[EI_MAG3] */ +#define ELFMAG "\177ELF" /* magic */ +#define SELFMAG 4 /* size of magic */ + +/* e_ident[] file class */ +#define ELFCLASSNONE 0 /* invalid */ +#define ELFCLASS32 1 /* 32-bit objs */ +#define ELFCLASS64 2 /* 64-bit objs */ +#define ELFCLASSNUM 3 /* number of classes */ + +/* e_ident[] data encoding */ +#define ELFDATANONE 0 /* invalid */ +#define ELFDATA2LSB 1 /* Little-Endian */ +#define ELFDATA2MSB 2 /* Big-Endian */ +#define ELFDATANUM 3 /* number of data encode defines */ + +/* e_ident[] OS/ABI specific ELF extensions */ +#define ELFOSABI_NONE 0 /* No extension specified */ +#define ELFOSABI_HPUX 1 /* Hewlett-Packard HP-UX */ +#define ELFOSABI_NETBSD 2 /* NetBSD */ +#define ELFOSABI_LINUX 3 /* Linux */ +#define ELFOSABI_SOLARIS 6 /* Sun Solaris */ +#define ELFOSABI_AIX 7 /* AIX */ +#define ELFOSABI_IRIX 8 /* IRIX */ +#define ELFOSABI_FREEBSD 9 /* FreeBSD */ +#define ELFOSABI_TRU64 10 /* Compaq TRU64 UNIX */ +#define ELFOSABI_MODESTO 11 /* Novell Modesto */ +#define ELFOSABI_OPENBSD 12 /* OpenBSD */ +/* 64-255 Architecture-specific value range */ + +/* e_ident[] ABI Version */ +#define ELFABIVERSION 0 + +/* e_ident */ +#define IS_ELF(ehdr) ((ehdr).e_ident[EI_MAG0] == ELFMAG0 && \ + (ehdr).e_ident[EI_MAG1] == ELFMAG1 && \ + (ehdr).e_ident[EI_MAG2] == ELFMAG2 && \ + (ehdr).e_ident[EI_MAG3] == ELFMAG3) + +/* ELF Header */ +typedef struct elfhdr{ + unsigned char e_ident[EI_NIDENT]; /* ELF Identification */ + Elf32_Half e_type; /* object file type */ + Elf32_Half e_machine; /* machine */ + Elf32_Word e_version; /* object file version */ + Elf32_Addr e_entry; /* virtual entry point */ + Elf32_Off e_phoff; /* program header table offset */ + Elf32_Off e_shoff; /* section header table offset */ + Elf32_Word e_flags; /* processor-specific flags */ + Elf32_Half e_ehsize; /* ELF header size */ + Elf32_Half e_phentsize; /* program header entry size */ + Elf32_Half e_phnum; /* number of program header entries */ + Elf32_Half e_shentsize; /* section header entry size */ + Elf32_Half e_shnum; /* number of section header entries */ + Elf32_Half e_shstrndx; /* section header table's "section + header string table" entry offset */ +} Elf32_Ehdr; + +/* e_type */ +#define ET_NONE 0 /* No file type */ +#define ET_REL 1 /* relocatable file */ +#define ET_EXEC 2 /* executable file */ +#define ET_DYN 3 /* shared object file */ +#define ET_CORE 4 /* core file */ +#define ET_NUM 5 /* number of types */ +#define ET_LOOS 0xfe00 /* reserved range for operating */ +#define ET_HIOS 0xfeff /* system specific e_type */ +#define ET_LOPROC 0xff00 /* reserved range for processor */ +#define ET_HIPROC 0xffff /* specific e_type */ + +/* e_machine */ +#define EM_NONE 0 /* No Machine */ +#define EM_M32 1 /* AT&T WE 32100 */ +#define EM_SPARC 2 /* SPARC */ +#define EM_386 3 /* Intel 80386 */ +#define EM_68K 4 /* Motorola 68000 */ +#define EM_88K 5 /* Motorola 88000 */ +#if 0 +#define EM_486 6 /* RESERVED - was Intel 80486 */ +#endif +#define EM_860 7 /* Intel 80860 */ +#define EM_MIPS 8 /* MIPS R3000 Big-Endian only */ +#define EM_S370 9 /* IBM System/370 Processor */ +#define EM_MIPS_RS4_BE 10 /* MIPS R4000 Big-Endian */ +#if 0 +#define EM_SPARC64 11 /* RESERVED - was SPARC v9 + 64-bit unoffical */ +#endif +/* RESERVED 11-14 for future use */ +#define EM_PARISC 15 /* HPPA */ +/* RESERVED 16 for future use */ +#define EM_VPP500 17 /* Fujitsu VPP500 */ +#define EM_SPARC32PLUS 18 /* Enhanced instruction set SPARC */ +#define EM_960 19 /* Intel 80960 */ +#define EM_PPC 20 /* PowerPC */ +#define EM_PPC64 21 /* 64-bit PowerPC */ +#define EM_S390 22 /* IBM System/390 Processor */ +/* RESERVED 23-35 for future use */ +#define EM_V800 36 /* NEC V800 */ +#define EM_FR20 37 /* Fujitsu FR20 */ +#define EM_RH32 38 /* TRW RH-32 */ +#define EM_RCE 39 /* Motorola RCE */ +#define EM_ARM 40 /* Advanced Risc Machines ARM */ +#define EM_ALPHA 41 /* Digital Alpha */ +#define EM_SH 42 /* Hitachi SH */ +#define EM_SPARCV9 43 /* SPARC Version 9 */ +#define EM_TRICORE 44 /* Siemens TriCore embedded processor */ +#define EM_ARC 45 /* Argonaut RISC Core */ +#define EM_H8_300 46 /* Hitachi H8/300 */ +#define EM_H8_300H 47 /* Hitachi H8/300H */ +#define EM_H8S 48 /* Hitachi H8S */ +#define EM_H8_500 49 /* Hitachi H8/500 */ +#define EM_IA_64 50 /* Intel Merced */ +#define EM_MIPS_X 51 /* Stanford MIPS-X */ +#define EM_COLDFIRE 52 /* Motorola Coldfire */ +#define EM_68HC12 53 /* Motorola M68HC12 */ +#define EM_MMA 54 /* Fujitsu MMA Multimedia Accelerator*/ +#define EM_PCP 55 /* Siemens PCP */ +#define EM_NCPU 56 /* Sony nCPU embeeded RISC */ +#define EM_NDR1 57 /* Denso NDR1 microprocessor */ +#define EM_STARCORE 58 /* Motorola Start*Core processor */ +#define EM_ME16 59 /* Toyota ME16 processor */ +#define EM_ST100 60 /* STMicroelectronic ST100 processor */ +#define EM_TINYJ 61 /* Advanced Logic Corp. Tinyj emb.fam*/ +#define EM_X86_64 62 /* AMD x86-64 */ +#define EM_PDSP 63 /* Sony DSP Processor */ +/* RESERVED 64,65 for future use */ +#define EM_FX66 66 /* Siemens FX66 microcontroller */ +#define EM_ST9PLUS 67 /* STMicroelectronics ST9+ 8/16 mc */ +#define EM_ST7 68 /* STmicroelectronics ST7 8 bit mc */ +#define EM_68HC16 69 /* Motorola MC68HC16 microcontroller */ +#define EM_68HC11 70 /* Motorola MC68HC11 microcontroller */ +#define EM_68HC08 71 /* Motorola MC68HC08 microcontroller */ +#define EM_68HC05 72 /* Motorola MC68HC05 microcontroller */ +#define EM_SVX 73 /* Silicon Graphics SVx */ +#define EM_ST19 74 /* STMicroelectronics ST19 8 bit mc */ +#define EM_VAX 75 /* Digital VAX */ +#define EM_CHRIS 76 /* Axis Communications embedded proc. */ +#define EM_JAVELIN 77 /* Infineon Technologies emb. proc. */ +#define EM_FIREPATH 78 /* Element 14 64-bit DSP Processor */ +#define EM_ZSP 79 /* LSI Logic 16-bit DSP Processor */ +#define EM_MMIX 80 /* Donald Knuth's edu 64-bit proc. */ +#define EM_HUANY 81 /* Harvard University mach-indep objs */ +#define EM_PRISM 82 /* SiTera Prism */ +#define EM_AVR 83 /* Atmel AVR 8-bit microcontroller */ +#define EM_FR30 84 /* Fujitsu FR30 */ +#define EM_D10V 85 /* Mitsubishi DV10V */ +#define EM_D30V 86 /* Mitsubishi DV30V */ +#define EM_V850 87 /* NEC v850 */ +#define EM_M32R 88 /* Mitsubishi M32R */ +#define EM_MN10300 89 /* Matsushita MN10200 */ +#define EM_MN10200 90 /* Matsushita MN10200 */ +#define EM_PJ 91 /* picoJava */ +#define EM_NUM 92 /* number of machine types */ + +/* Version */ +#define EV_NONE 0 /* Invalid */ +#define EV_CURRENT 1 /* Current */ +#define EV_NUM 2 /* number of versions */ + +/* Section Header */ +typedef struct { + Elf32_Word sh_name; /* name - index into section header + string table section */ + Elf32_Word sh_type; /* type */ + Elf32_Word sh_flags; /* flags */ + Elf32_Addr sh_addr; /* address */ + Elf32_Off sh_offset; /* file offset */ + Elf32_Word sh_size; /* section size */ + Elf32_Word sh_link; /* section header table index link */ + Elf32_Word sh_info; /* extra information */ + Elf32_Word sh_addralign; /* address alignment */ + Elf32_Word sh_entsize; /* section entry size */ +} Elf32_Shdr; + +/* Special Section Indexes */ +#define SHN_UNDEF 0 /* undefined */ +#define SHN_LORESERVE 0xff00 /* lower bounds of reserved indexes */ +#define SHN_LOPROC 0xff00 /* reserved range for processor */ +#define SHN_HIPROC 0xff1f /* specific section indexes */ +#define SHN_LOOS 0xff20 /* reserved range for operating */ +#define SHN_HIOS 0xff3f /* specific semantics */ +#define SHN_ABS 0xfff1 /* absolute value */ +#define SHN_COMMON 0xfff2 /* common symbol */ +#define SHN_XINDEX 0xffff /* Index is an extra table */ +#define SHN_HIRESERVE 0xffff /* upper bounds of reserved indexes */ + +/* sh_type */ +#define SHT_NULL 0 /* inactive */ +#define SHT_PROGBITS 1 /* program defined information */ +#define SHT_SYMTAB 2 /* symbol table section */ +#define SHT_STRTAB 3 /* string table section */ +#define SHT_RELA 4 /* relocation section with addends*/ +#define SHT_HASH 5 /* symbol hash table section */ +#define SHT_DYNAMIC 6 /* dynamic section */ +#define SHT_NOTE 7 /* note section */ +#define SHT_NOBITS 8 /* no space section */ +#define SHT_REL 9 /* relation section without addends */ +#define SHT_SHLIB 10 /* reserved - purpose unknown */ +#define SHT_DYNSYM 11 /* dynamic symbol table section */ +#define SHT_INIT_ARRAY 14 /* Array of constructors */ +#define SHT_FINI_ARRAY 15 /* Array of destructors */ +#define SHT_PREINIT_ARRAY 16 /* Array of pre-constructors */ +#define SHT_GROUP 17 /* Section group */ +#define SHT_SYMTAB_SHNDX 18 /* Extended section indeces */ +#define SHT_NUM 19 /* number of section types */ +#define SHT_LOOS 0x60000000 /* Start OS-specific */ +#define SHT_HIOS 0x6fffffff /* End OS-specific */ +#define SHT_LOPROC 0x70000000 /* reserved range for processor */ +#define SHT_HIPROC 0x7fffffff /* specific section header types */ +#define SHT_LOUSER 0x80000000 /* reserved range for application */ +#define SHT_HIUSER 0xffffffff /* specific indexes */ + +/* Section names */ +#define ELF_BSS ".bss" /* uninitialized data */ +#define ELF_COMMENT ".comment" /* version control information */ +#define ELF_DATA ".data" /* initialized data */ +#define ELF_DATA1 ".data1" /* initialized data */ +#define ELF_DEBUG ".debug" /* debug */ +#define ELF_DYNAMIC ".dynamic" /* dynamic linking information */ +#define ELF_DYNSTR ".dynstr" /* dynamic string table */ +#define ELF_DYNSYM ".dynsym" /* dynamic symbol table */ +#define ELF_FINI ".fini" /* termination code */ +#define ELF_FINI_ARRAY ".fini_array" /* Array of destructors */ +#define ELF_GOT ".got" /* global offset table */ +#define ELF_HASH ".hash" /* symbol hash table */ +#define ELF_INIT ".init" /* initialization code */ +#define ELF_INIT_ARRAY ".init_array" /* Array of constuctors */ +#define ELF_INTERP ".interp" /* Pathname of program interpreter */ +#define ELF_LINE ".line" /* Symbolic line numnber information */ +#define ELF_NOTE ".note" /* Contains note section */ +#define ELF_PLT ".plt" /* Procedure linkage table */ +#define ELF_PREINIT_ARRAY ".preinit_array" /* Array of pre-constructors */ +#define ELF_REL_DATA ".rel.data" /* relocation data */ +#define ELF_REL_FINI ".rel.fini" /* relocation termination code */ +#define ELF_REL_INIT ".rel.init" /* relocation initialization code */ +#define ELF_REL_DYN ".rel.dyn" /* relocaltion dynamic link info */ +#define ELF_REL_RODATA ".rel.rodata" /* relocation read-only data */ +#define ELF_REL_TEXT ".rel.text" /* relocation code */ +#define ELF_RODATA ".rodata" /* read-only data */ +#define ELF_RODATA1 ".rodata1" /* read-only data */ +#define ELF_SHSTRTAB ".shstrtab" /* section header string table */ +#define ELF_STRTAB ".strtab" /* string table */ +#define ELF_SYMTAB ".symtab" /* symbol table */ +#define ELF_SYMTAB_SHNDX ".symtab_shndx"/* symbol table section index */ +#define ELF_TBSS ".tbss" /* thread local uninit data */ +#define ELF_TDATA ".tdata" /* thread local init data */ +#define ELF_TDATA1 ".tdata1" /* thread local init data */ +#define ELF_TEXT ".text" /* code */ + +/* Section Attribute Flags - sh_flags */ +#define SHF_WRITE 0x1 /* Writable */ +#define SHF_ALLOC 0x2 /* occupies memory */ +#define SHF_EXECINSTR 0x4 /* executable */ +#define SHF_MERGE 0x10 /* Might be merged */ +#define SHF_STRINGS 0x20 /* Contains NULL terminated strings */ +#define SHF_INFO_LINK 0x40 /* sh_info contains SHT index */ +#define SHF_LINK_ORDER 0x80 /* Preserve order after combining*/ +#define SHF_OS_NONCONFORMING 0x100 /* Non-standard OS specific handling */ +#define SHF_GROUP 0x200 /* Member of section group */ +#define SHF_TLS 0x400 /* Thread local storage */ +#define SHF_MASKOS 0x0ff00000 /* OS specific */ +#define SHF_MASKPROC 0xf0000000 /* reserved bits for processor */ + /* specific section attributes */ + +/* Section Group Flags */ +#define GRP_COMDAT 0x1 /* COMDAT group */ +#define GRP_MASKOS 0x0ff00000 /* Mask OS specific flags */ +#define GRP_MASKPROC 0xf0000000 /* Mask processor specific flags */ + +/* Symbol Table Entry */ +typedef struct elf32_sym { + Elf32_Word st_name; /* name - index into string table */ + Elf32_Addr st_value; /* symbol value */ + Elf32_Word st_size; /* symbol size */ + unsigned char st_info; /* type and binding */ + unsigned char st_other; /* 0 - no defined meaning */ + Elf32_Half st_shndx; /* section header index */ +} Elf32_Sym; + +/* Symbol table index */ +#define STN_UNDEF 0 /* undefined */ + +/* Extract symbol info - st_info */ +#define ELF32_ST_BIND(x) ((x) >> 4) +#define ELF32_ST_TYPE(x) (((unsigned int) x) & 0xf) +#define ELF32_ST_INFO(b,t) (((b) << 4) + ((t) & 0xf)) +#define ELF32_ST_VISIBILITY(x) ((x) & 0x3) + +/* Symbol Binding - ELF32_ST_BIND - st_info */ +#define STB_LOCAL 0 /* Local symbol */ +#define STB_GLOBAL 1 /* Global symbol */ +#define STB_WEAK 2 /* like global - lower precedence */ +#define STB_NUM 3 /* number of symbol bindings */ +#define STB_LOOS 10 /* reserved range for operating */ +#define STB_HIOS 12 /* system specific symbol bindings */ +#define STB_LOPROC 13 /* reserved range for processor */ +#define STB_HIPROC 15 /* specific symbol bindings */ + +/* Symbol type - ELF32_ST_TYPE - st_info */ +#define STT_NOTYPE 0 /* not specified */ +#define STT_OBJECT 1 /* data object */ +#define STT_FUNC 2 /* function */ +#define STT_SECTION 3 /* section */ +#define STT_FILE 4 /* file */ +#define STT_NUM 5 /* number of symbol types */ +#define STT_TLS 6 /* Thread local storage symbol */ +#define STT_LOOS 10 /* reserved range for operating */ +#define STT_HIOS 12 /* system specific symbol types */ +#define STT_LOPROC 13 /* reserved range for processor */ +#define STT_HIPROC 15 /* specific symbol types */ + +/* Symbol visibility - ELF32_ST_VISIBILITY - st_other */ +#define STV_DEFAULT 0 /* Normal visibility rules */ +#define STV_INTERNAL 1 /* Processor specific hidden class */ +#define STV_HIDDEN 2 /* Symbol unavailable in other mods */ +#define STV_PROTECTED 3 /* Not preemptible, not exported */ + + +/* Relocation entry with implicit addend */ +typedef struct +{ + Elf32_Addr r_offset; /* offset of relocation */ + Elf32_Word r_info; /* symbol table index and type */ +} Elf32_Rel; + +/* Relocation entry with explicit addend */ +typedef struct +{ + Elf32_Addr r_offset; /* offset of relocation */ + Elf32_Word r_info; /* symbol table index and type */ + Elf32_Sword r_addend; +} Elf32_Rela; + +/* Extract relocation info - r_info */ +#define ELF32_R_SYM(i) ((i) >> 8) +#define ELF32_R_TYPE(i) ((unsigned char) (i)) +#define ELF32_R_INFO(s,t) (((s) << 8) + (unsigned char)(t)) + +/* Program Header */ +typedef struct { + Elf32_Word p_type; /* segment type */ + Elf32_Off p_offset; /* segment offset */ + Elf32_Addr p_vaddr; /* virtual address of segment */ + Elf32_Addr p_paddr; /* physical address - ignored? */ + Elf32_Word p_filesz; /* number of bytes in file for seg. */ + Elf32_Word p_memsz; /* number of bytes in mem. for seg. */ + Elf32_Word p_flags; /* flags */ + Elf32_Word p_align; /* memory alignment */ +} Elf32_Phdr; + +/* Segment types - p_type */ +#define PT_NULL 0 /* unused */ +#define PT_LOAD 1 /* loadable segment */ +#define PT_DYNAMIC 2 /* dynamic linking section */ +#define PT_INTERP 3 /* the RTLD */ +#define PT_NOTE 4 /* auxiliary information */ +#define PT_SHLIB 5 /* reserved - purpose undefined */ +#define PT_PHDR 6 /* program header */ +#define PT_TLS 7 /* Thread local storage template */ +#define PT_NUM 8 /* Number of segment types */ +#define PT_LOOS 0x60000000 /* reserved range for operating */ +#define PT_HIOS 0x6fffffff /* system specific segment types */ +#define PT_LOPROC 0x70000000 /* reserved range for processor */ +#define PT_HIPROC 0x7fffffff /* specific segment types */ + +/* Segment flags - p_flags */ +#define PF_X 0x1 /* Executable */ +#define PF_W 0x2 /* Writable */ +#define PF_R 0x4 /* Readable */ +#define PF_MASKOS 0x0ff00000 /* OS specific segment flags */ +#define PF_MASKPROC 0xf0000000 /* reserved bits for processor */ + /* specific segment flags */ +/* Dynamic structure */ +typedef struct +{ + Elf32_Sword d_tag; /* controls meaning of d_val */ + union + { + Elf32_Word d_val; /* Multiple meanings - see d_tag */ + Elf32_Addr d_ptr; /* program virtual address */ + } d_un; +} Elf32_Dyn; + +extern Elf32_Dyn _DYNAMIC[]; + +/* Dynamic Array Tags - d_tag */ +#define DT_NULL 0 /* marks end of _DYNAMIC array */ +#define DT_NEEDED 1 /* string table offset of needed lib */ +#define DT_PLTRELSZ 2 /* size of relocation entries in PLT */ +#define DT_PLTGOT 3 /* address PLT/GOT */ +#define DT_HASH 4 /* address of symbol hash table */ +#define DT_STRTAB 5 /* address of string table */ +#define DT_SYMTAB 6 /* address of symbol table */ +#define DT_RELA 7 /* address of relocation table */ +#define DT_RELASZ 8 /* size of relocation table */ +#define DT_RELAENT 9 /* size of relocation entry */ +#define DT_STRSZ 10 /* size of string table */ +#define DT_SYMENT 11 /* size of symbol table entry */ +#define DT_INIT 12 /* address of initialization func. */ +#define DT_FINI 13 /* address of termination function */ +#define DT_SONAME 14 /* string table offset of shared obj */ +#define DT_RPATH 15 /* string table offset of library + search path */ +#define DT_SYMBOLIC 16 /* start sym search in shared obj. */ +#define DT_REL 17 /* address of rel. tbl. w addends */ +#define DT_RELSZ 18 /* size of DT_REL relocation table */ +#define DT_RELENT 19 /* size of DT_REL relocation entry */ +#define DT_PLTREL 20 /* PLT referenced relocation entry */ +#define DT_DEBUG 21 /* bugger */ +#define DT_TEXTREL 22 /* Allow rel. mod. to unwritable seg */ +#define DT_JMPREL 23 /* add. of PLT's relocation entries */ +#define DT_BIND_NOW 24 /* Process relocations of object */ +#define DT_INIT_ARRAY 25 /* Array with addresses of init fct */ +#define DT_FINI_ARRAY 26 /* Array with addresses of fini fct */ +#define DT_INIT_ARRAYSZ 27 /* Size in bytes of DT_INIT_ARRAY */ +#define DT_FINI_ARRAYSZ 28 /* Size in bytes of DT_FINI_ARRAY */ +#define DT_RUNPATH 29 /* Library search path */ +#define DT_FLAGS 30 /* Flags for the object being loaded */ +#define DT_ENCODING 32 /* Start of encoded range */ +#define DT_PREINIT_ARRAY 32 /* Array with addresses of preinit fct*/ +#define DT_PREINIT_ARRAYSZ 33 /* size in bytes of DT_PREINIT_ARRAY */ +#define DT_NUM 34 /* Number used. */ +#define DT_LOOS 0x60000000 /* reserved range for OS */ +#define DT_HIOS 0x6fffffff /* specific dynamic array tags */ +#define DT_LOPROC 0x70000000 /* reserved range for processor */ +#define DT_HIPROC 0x7fffffff /* specific dynamic array tags */ + +/* Dynamic Tag Flags - d_un.d_val */ +#define DF_ORIGIN 0x01 /* Object may use DF_ORIGIN */ +#define DF_SYMBOLIC 0x02 /* Symbol resolutions starts here */ +#define DF_TEXTREL 0x04 /* Object contains text relocations */ +#define DF_BIND_NOW 0x08 /* No lazy binding for this object */ +#define DF_STATIC_TLS 0x10 /* Static thread local storage */ + +/* Standard ELF hashing function */ +unsigned long elf_hash(const unsigned char *name); + +#define ELF_TARG_VER 1 /* The ver for which this code is intended */ + +/* + * XXX - PowerPC defines really don't belong in here, + * but we'll put them in for simplicity. + */ + +/* Values for Elf32/64_Ehdr.e_flags. */ +#define EF_PPC_EMB 0x80000000 /* PowerPC embedded flag */ + +/* Cygnus local bits below */ +#define EF_PPC_RELOCATABLE 0x00010000 /* PowerPC -mrelocatable flag*/ +#define EF_PPC_RELOCATABLE_LIB 0x00008000 /* PowerPC -mrelocatable-lib + flag */ + +/* PowerPC relocations defined by the ABIs */ +#define R_PPC_NONE 0 +#define R_PPC_ADDR32 1 /* 32bit absolute address */ +#define R_PPC_ADDR24 2 /* 26bit address, 2 bits ignored. */ +#define R_PPC_ADDR16 3 /* 16bit absolute address */ +#define R_PPC_ADDR16_LO 4 /* lower 16bit of absolute address */ +#define R_PPC_ADDR16_HI 5 /* high 16bit of absolute address */ +#define R_PPC_ADDR16_HA 6 /* adjusted high 16bit */ +#define R_PPC_ADDR14 7 /* 16bit address, 2 bits ignored */ +#define R_PPC_ADDR14_BRTAKEN 8 +#define R_PPC_ADDR14_BRNTAKEN 9 +#define R_PPC_REL24 10 /* PC relative 26 bit */ +#define R_PPC_REL14 11 /* PC relative 16 bit */ +#define R_PPC_REL14_BRTAKEN 12 +#define R_PPC_REL14_BRNTAKEN 13 +#define R_PPC_GOT16 14 +#define R_PPC_GOT16_LO 15 +#define R_PPC_GOT16_HI 16 +#define R_PPC_GOT16_HA 17 +#define R_PPC_PLTREL24 18 +#define R_PPC_COPY 19 +#define R_PPC_GLOB_DAT 20 +#define R_PPC_JMP_SLOT 21 +#define R_PPC_RELATIVE 22 +#define R_PPC_LOCAL24PC 23 +#define R_PPC_UADDR32 24 +#define R_PPC_UADDR16 25 +#define R_PPC_REL32 26 +#define R_PPC_PLT32 27 +#define R_PPC_PLTREL32 28 +#define R_PPC_PLT16_LO 29 +#define R_PPC_PLT16_HI 30 +#define R_PPC_PLT16_HA 31 +#define R_PPC_SDAREL16 32 +#define R_PPC_SECTOFF 33 +#define R_PPC_SECTOFF_LO 34 +#define R_PPC_SECTOFF_HI 35 +#define R_PPC_SECTOFF_HA 36 +/* Keep this the last entry. */ +#define R_PPC_NUM 37 + +/* The remaining relocs are from the Embedded ELF ABI, and are not + in the SVR4 ELF ABI. */ +#define R_PPC_EMB_NADDR32 101 +#define R_PPC_EMB_NADDR16 102 +#define R_PPC_EMB_NADDR16_LO 103 +#define R_PPC_EMB_NADDR16_HI 104 +#define R_PPC_EMB_NADDR16_HA 105 +#define R_PPC_EMB_SDAI16 106 +#define R_PPC_EMB_SDA2I16 107 +#define R_PPC_EMB_SDA2REL 108 +#define R_PPC_EMB_SDA21 109 /* 16 bit offset in SDA */ +#define R_PPC_EMB_MRKREF 110 +#define R_PPC_EMB_RELSEC16 111 +#define R_PPC_EMB_RELST_LO 112 +#define R_PPC_EMB_RELST_HI 113 +#define R_PPC_EMB_RELST_HA 114 +#define R_PPC_EMB_BIT_FLD 115 +#define R_PPC_EMB_RELSDA 116 /* 16 bit relative offset in SDA */ + +/* Diab tool relocations. */ +#define R_PPC_DIAB_SDA21_LO 180 /* like EMB_SDA21, but lower 16 bit */ +#define R_PPC_DIAB_SDA21_HI 181 /* like EMB_SDA21, but high 16 bit */ +#define R_PPC_DIAB_SDA21_HA 182 /* like EMB_SDA21, adjusted high 16 */ +#define R_PPC_DIAB_RELSDA_LO 183 /* like EMB_RELSDA, but lower 16 bit */ +#define R_PPC_DIAB_RELSDA_HI 184 /* like EMB_RELSDA, but high 16 bit */ +#define R_PPC_DIAB_RELSDA_HA 185 /* like EMB_RELSDA, adjusted high 16 */ + +/* This is a phony reloc to handle any old fashioned TOC16 references + that may still be in object files. */ +#define R_PPC_TOC16 255 + +#endif /* _ELF_H */ diff --git a/resources/app_booter/source/elfloader.c b/resources/app_booter/source/elfloader.c new file mode 100644 index 00000000..07d396cd --- /dev/null +++ b/resources/app_booter/source/elfloader.c @@ -0,0 +1,92 @@ +/* + * Copyright (c) 2001 William L. Pitts + * Modifications (c) 2004 Felix Domke + * All rights reserved. + * + * Redistribution and use in source and binary forms are freely + * permitted provided that the above copyright notice and this + * paragraph and the following disclaimer are duplicated in all + * such forms. + * + * This software is provided "AS IS" and without any express or + * implied warranties, including, without limitation, the implied + * warranties of merchantability and fitness for a particular + * purpose. + */ + +#include <stdio.h> + +#include "elf_abi.h" +#include "sync.h" +#include "string.h" + +/* ====================================================================== + * Determine if a valid ELF image exists at the given memory location. + * First looks at the ELF header magic field, the makes sure that it is + * executable and makes sure that it is for a PowerPC. + * ====================================================================== */ +s32 valid_elf_image (void *addr) +{ + Elf32_Ehdr *ehdr; /* Elf header structure pointer */ + + ehdr = (Elf32_Ehdr *) addr; + + if (!IS_ELF (*ehdr)) + return 0; + + if (ehdr->e_type != ET_EXEC) + return -1; + + if (ehdr->e_machine != EM_PPC) + return -1; + + return 1; +} + + +/* ====================================================================== + * A very simple elf loader, assumes the image is valid, returns the + * entry point address. + * ====================================================================== */ + +u32 load_elf_image (void *elfstart) { + Elf32_Ehdr *ehdr; + Elf32_Phdr *phdrs; + u8 *image; + int i; + + ehdr = (Elf32_Ehdr *) elfstart; + + if(ehdr->e_phoff == 0 || ehdr->e_phnum == 0) + return 0; + + if(ehdr->e_phentsize != sizeof(Elf32_Phdr)) + return 0; + + phdrs = (Elf32_Phdr*)(elfstart + ehdr->e_phoff); + + for(i=0;i<ehdr->e_phnum;i++) { + + if(phdrs[i].p_type != PT_LOAD) + continue; + + phdrs[i].p_paddr &= 0x3FFFFFFF; + phdrs[i].p_paddr |= 0x80000000; + + if(phdrs[i].p_filesz > phdrs[i].p_memsz) + return 0; + + if(!phdrs[i].p_filesz) + continue; + + image = (u8 *) (elfstart + phdrs[i].p_offset); + memcpy ((void *) phdrs[i].p_paddr, (const void *) image, phdrs[i].p_filesz); + + sync_before_exec ((void *) phdrs[i].p_paddr, phdrs[i].p_memsz); + + //if(phdrs[i].p_flags & PF_X) + //ICInvalidateRange ((void *) phdrs[i].p_paddr, phdrs[i].p_memsz); + } + + return ((ehdr->e_entry & 0x3FFFFFFF) | 0x80000000); +} diff --git a/resources/app_booter/source/elfloader.h b/resources/app_booter/source/elfloader.h new file mode 100644 index 00000000..1b4d161a --- /dev/null +++ b/resources/app_booter/source/elfloader.h @@ -0,0 +1,16 @@ +#ifndef _ELFLOADER_H_ +#define _ELFLOADER_H_ + +#ifdef __cplusplus +extern "C" +{ +#endif + +s32 valid_elf_image (void *addr); +u32 load_elf_image (void *addr); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/resources/app_booter/source/link.ld b/resources/app_booter/source/link.ld new file mode 100644 index 00000000..7c0f44a5 --- /dev/null +++ b/resources/app_booter/source/link.ld @@ -0,0 +1,27 @@ +/* Copyright 2008-2009 Segher Boessenkool <segher@kernel.crashing.org> + This code is licensed to you under the terms of the GNU GPL, version 2; + see file COPYING or http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt */ + +OUTPUT_FORMAT("elf32-powerpc") +OUTPUT_ARCH(powerpc:common) + +ENTRY(_start) + +SECTIONS { + . = 0x93000000; + + .start : { crt0.o(*) } + .text : { *(.text) } + .rodata : { *(.rodata .rodata.*)} + .data : { *(.data) } + + __bss_start = .; + .bss : { *(.bss) } + __bss_end = .; + + . = ALIGN(0x40); + .stack : { + . += 0x8000; + _stack_top = .; + } +} diff --git a/resources/app_booter/source/main.c b/resources/app_booter/source/main.c new file mode 100644 index 00000000..3180f485 --- /dev/null +++ b/resources/app_booter/source/main.c @@ -0,0 +1,39 @@ +/* Copyright 2011 Dimok + This code is licensed to you under the terms of the GNU GPL, version 2; + see file COPYING or http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt */ +#include <gccore.h> +#include <stdio.h> +#include <stdarg.h> +#include "string.h" + +#include "dolloader.h" +#include "elfloader.h" +#include "sync.h" + +#define EXECUTABLE_MEM_ADDR 0x92000000 +#define SYSTEM_ARGV ((struct __argv *) 0x93200000) + +void main(void) +{ + void *exeBuffer = (void *) EXECUTABLE_MEM_ADDR; + u32 exeEntryPointAddress = 0; + entrypoint exeEntryPoint; + + if (valid_elf_image(exeBuffer) == 1) + exeEntryPointAddress = load_elf_image(exeBuffer); + else + exeEntryPointAddress = load_dol_image(exeBuffer); + + exeEntryPoint = (entrypoint) exeEntryPointAddress; + if (!exeEntryPoint) + return; + + if (SYSTEM_ARGV->argvMagic == ARGV_MAGIC) + { + void *new_argv = (void *) (exeEntryPointAddress + 8); + memcpy(new_argv, SYSTEM_ARGV, sizeof(struct __argv)); + sync_before_exec(new_argv, sizeof(struct __argv)); + } + + exeEntryPoint (); +} diff --git a/resources/app_booter/source/string.c b/resources/app_booter/source/string.c new file mode 100644 index 00000000..016396b8 --- /dev/null +++ b/resources/app_booter/source/string.c @@ -0,0 +1,25 @@ +// Copyright 2008-2009 Segher Boessenkool <segher@kernel.crashing.org> +// This code is licensed to you under the terms of the GNU GPL, version 2; +// see file COPYING or http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt + +#include <stdio.h> + +void *memset(void *b, int c, size_t len) +{ + size_t i; + + for (i = 0; i < len; i++) + ((unsigned char *)b)[i] = c; + + return b; +} + +void *memcpy(void *dst, const void *src, size_t len) +{ + size_t i; + + for (i = 0; i < len; i++) + ((unsigned char *)dst)[i] = ((unsigned char *)src)[i]; + + return dst; +} diff --git a/resources/app_booter/source/string.h b/resources/app_booter/source/string.h new file mode 100644 index 00000000..4df2aed8 --- /dev/null +++ b/resources/app_booter/source/string.h @@ -0,0 +1,9 @@ +#ifndef STRING_H_ +#define STRING_H_ + +#include <stdio.h> + +void *memcpy(void *dst, const void *src, size_t len); +void *memset(void *b, int c, size_t len); + +#endif diff --git a/resources/app_booter/source/sync.c b/resources/app_booter/source/sync.c new file mode 100644 index 00000000..48d1dada --- /dev/null +++ b/resources/app_booter/source/sync.c @@ -0,0 +1,18 @@ +// Copyright 2008-2009 Segher Boessenkool <segher@kernel.crashing.org> +// This code is licensed to you under the terms of the GNU GPL, version 2; +// see file COPYING or http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt + +#include <gctypes.h> + +void sync_before_exec(const void *p, u32 len) +{ + u32 a, b; + + a = (u32)p & ~0x1f; + b = ((u32)p + len + 0x1f) & ~0x1f; + + for ( ; a < b; a += 32) + asm("dcbst 0,%0 ; sync ; icbi 0,%0" : : "b"(a)); + + asm("sync ; isync"); +} diff --git a/resources/app_booter/source/sync.h b/resources/app_booter/source/sync.h new file mode 100644 index 00000000..80dd47eb --- /dev/null +++ b/resources/app_booter/source/sync.h @@ -0,0 +1,8 @@ +#ifndef __SYNC_H_ +#define __SYNC_H_ + +void sync_before_read(void *p, u32 len); +void sync_after_write(const void *p, u32 len); +void sync_before_exec(const void *p, u32 len); + +#endif diff --git a/resources/dvdskin(original).png b/resources/dvdskin(original).png new file mode 100644 index 0000000000000000000000000000000000000000..ec1c686b5cdd618c9b3b24e277f6558333751c9a GIT binary patch literal 7713 zcmYkBcOX^oAIG0NT=!o4O0E&t%3fI|<3`zX?HM;3$SfqQV-;mqMk1SQWM!r35~0Xm zMTv$@*@WNy{`dRqInO!&Jm)#*^ZvYF?<baYQI`qJjRgQO>Fb?0qm4uWU;quLUBwCi zHl+=)TV}dipyCtnJZ*x!e$MzD0M&^M|1Q(f<^&f#Gh+aPP67Z$0kB8A1<e8AF9*N^ z835IE062Xzn@rVc5Ac2$Z2Zi<ule1+eDf+GU3T;Gleu`of)Jn}qo7>!dqxC+6T$lD z&shXIE@xdGQnK~G_muSSP1JM+M*)7a*@vs(UIa_yF`4Msug``PAs`@tS>fwaT1|O% zy?Sd!<L`!$MU7@=L$=0L^H_7pi{|||X$QM~cMpfM4=ps;i|LO--5eJGz4x!UmGx2P z_0s3D7Uk@_x7>V^W^d@v@E`4Temgqce!D-l8n*uI+rI_tw|hTj@9wT=AN?!VJeW5L z`}>&xaP9t)f5mL4=Arx*VxMf-9|qURwr_`94M}_VHUE8=_;k1lhvttu!N1>yf0|cA zSHB(I^!cS}MUS0pPSD=;)sJRQC4zrn3fYbUn@%}8lE4eZ{#{@loLhpta&!?xh+4gS zw0~NWzB3=0T6@C~le6HOAaQJPtmM8_*Fh^w7&y_W#jE%=$>pN*h^h+U_9<eyamx`f zk00gpAD}_VUs0zK`MTA35%9JQsZ|IvoW*!yigxS8)MH({z*Q<y_orHC|FPyY*OJL^ zWnNO@*ANnk`E-cB_5jJv-xwkXTqm<{INJhcjXAHs#p2FmNJwrh{eVT`6Pw*@7MsG3 zD}&rl7!l1$2j%AM9dc~(yd@uX!27jU@vu@@d(1QBr%r}>n=NF{MeXfj)F&?D=5s@d zVSv`Yp`oH;CsJjiTm&Pro|1r48qe<KmGBe-jT*iftR*nylLG{2d)ZnT#7%GYKx)0e zcb1wA+71t<#F#ho5H|9zp>xp)vXVpA{3D@L$ra&C{STfms>sb`cxM>IrToC69>1E6 z!yos+<ZM|KjjW;bFU)XYj6xS<!M~;JnlJ0{HOzEm;jiZK7i89jJMgOG=CITms?Bv} zwk#|(nnJniYnj{QiBDis%rjs89n#?=0ZKUyi1<29oa_9?F{+ujvmvMxx7gP*hJWWT zkKW#zYn59zSlTEpW+qEX@c{K!G+A{13y*IKQF6h)q(W6Z9Jnec*%y^My;av>R#a(1 z60dWLrUxKoVnqA(&Oa>WbYHo7f*LFMM-`;#F1(wvyWWAyY0;U%lDh-SBC=AEJ>RuL z?M^B!94r=wca)jtcTRHAf6{_0jgH!}u`q1fJp3-zyjiF*|HwAG3F&eA%O*bzAh1it zvLXyaQeuG@*&t=oK6A>$5FX5&PO;kaJk_&2t~zg+iH!GkYR#WOIu6Ywx*R5QD|dGg zsv0*|j|58J4pwe2Uo>eZ^~N;*I{R&xIa{WCoY^4c#I4sa<(y#!D%>inmzvDsy)lx| z$;U6j^uoOfS7Fi^U$LW}O5HJNThTc(Xv<(}#LD(TyCIHZ5aE-j^_l3h_I$~N@P!XD zcC$PqaZDnarDhQIF91vK2(afJ2gFg)6bSg8D^eX9szlf%IxwX;x*7tj%NN-(aex}z zajVdgqBElaPhv7r?UV?|=5SS0pHLfGHl=Ize3u_L7%RC;z?9Wa^k*F>E`*;9_cPAG z-m&El+^6i@f*8aLQ}K$btu>=uq3kQc_XQ`+;QpS02D*#JpvOTKGjB$3mL_*XCRtHP z!=o>A&pbHRzl9@X!_=})1_>qGr<8v#Ze#`I%a4hIMDx(~7%Z8)ErT^6qx}K)drW}G zYsH6|aJ;D3&1pF2R>s&-84TnmQy;|hNrXEc?Tt<B1jQrA>FjT>JlcMB>$XJrk6h_w zUg_4;%ez@oqYQt=Iw+hG!Zic&Fv|8UYrz>aRlUs_4z*1;IFxt;utwpCiYr+<@W~t` zdEFK9eeRLH;uzkNQWJoAcMP;QUT4J+3w)>VTDsCfCmV6}qmj_^aW2_c#b{uZk1PW2 zGPTU)a`uSJCLCrgrcqNkRses1EtIZ6E+n|I_xJ~7=+=g{`-17&RPcoQWIMjn9Gsmp zeO|t4Z^jR(y>;`8qAjCSUoj1Qapd=^=Gk8=GMhf3sGs-&0rR<hQB;SQ!w#OLG}>h9 ze1gbJ#O823D{<Pj8R~Qa(^b$SA3YPb^Xi>SeZt+7E}O*pJJ#!3l7}h<!9ouBq1+QV zJ^XWcRrAjr=K`;PX=R-%Z+Cku?;b23g}8;x@_bv9{Iu5Hkym3C5NA)4EOzJ{;i`Q^ zb^?=63DfP0UkD5{En9V!=YBT4Jy;%p`mohOHn*p@f#{5`YMTw9XZfzySDS42YId&+ z4Xp3rAvMl0?LC^hTc%_2T^FoctSqz}nW@5pmBALvrF>6+BSq<Pz2T8u=A(sT3MUql z8@YWg&=?}}$A=4zbbY5|uJ|%HN@YbJwthE+a}zUKM--pci8;oifS;t|AtU&0pwYky zUZDY=1x5Ky^)j)uJ3dw6_Drsgk3dJXOExUxZ@%v(@2Xa6MMq*EJOjQ(C_FYVzSA_U zFl^1aJovlh1^ti?zaZrIqc}JJd2Jf^;M15p;g`+EYhqtve=4<Lf$cg$9!<muqec=^ z6m~~XNKI#$MyEy)*yja=rvyNtAAq>;y?XpRPfJy|M@2%h7rim@YXy+ty(lZ^m}_9b zta4czR`o8-(%3^ai&I<|?D<REaJbKF8xK&I$`bd1>wpSh34A&OIr{`j>AwtS>iy3R z{nK@ysdqt0>Nvm%?f`$qk4Hy4+fB|9(I0XrKwLhQGIqb{b>owy4|0)Y59-4-MrvhT zD4gVGf(3INfF)XcAE8Gm+tlvpx0pKyBe$T)r!8P{yd%G!5aZh&&tRoL5q<xJ+_@`= zxpI|&+bK5G28K(Fq0ZBe3V93BsS7Z6Z$P-*+<^ryS5;=liJ@uFexFiLECU%xJ2L`f zq&6ss!o!5)@QTU^h^0D{4t!YuuZ2rG?P48#J4AZChWD?xO^SsN9AODK?KT5y-?et} z564B48s;Uz_)%gS3OKxG7BY5ONH-wnUi}e}B7H;60f4!CSDo>&^u7})@b&Jzp_3|_ znDJo90uHJ#!E6qEaj4d!Cs<g&dqyOTs4iy|mDg{mA6|WHA$sN^GUsn#b*zwt`=>!+ zLe~@IeHbyi3Z`MsC6oMoeNc42(}7Y->ZLoQX#ibMQ0jFAic&?DVCSVixi%c{3u^5p zpct)6%Xk}}aTFwRMbM(;X^_B+HwHPM56r~Y_S9iXyM437O)UdZIL3gXE-Ra+0KKO? zCLfeWBGQ6vlyJ8ym6Mik=)>s|a?Is=M9?bqOcE+u%s1qa12fTa2#G5SGw%StOL0bo z0}ExW8;SG}4jwm4s(K+DT_pnfb7W-vwSc?T*Kd4E7XuH&dqH_%E{9M8)~&T}>a4Wz z>F$)qfsMD!AZfF(ge_lFH!v5F7JJsrLK5)Kh?*lgOgTc1O)FZDWBYc#B|Mf<Qu-^3 z8i#fn{}{tUS5<HZ!<Nrkx^lBr>obsuLe@?*0Xa#l3nx1%I2#z@-YgJKvISlkz%k<+ zrElrFab~#(3;l|Aw-bSeO*#=>&zuYh%H(rz9v{5O`IB0zZ1{={2%hg-fvf#uG&e-) zKLn$<a>W7hITn;JJWNALVIX-<?v&D|fdUh0Mr&b1aQf}plzs+F%y>rq`G}yX93~12 zJ&e+jsRSe$EnTrhVe^;2zHW@({tTI<mnLnm=>00fRat8XH427{Z~iHO^*`7fK*6bg zP29ex*v>9Zzz;b$iFBlI&FoapmNhzI==LqyjV8{&_WEiTaMY<h*$L}6w3>4FR>zIA z6WzI)hy6k07DZrG&AI#WOkHd{MH2LU54BTWIx8#(r}{`j99v^~MnFb*6+>tcgDL1~ zBqGW7%o;GjGi^&LlBg}Xu=}B10hDX8cclh?19<gffVOHDe1|$6%@dEDq_khTlA{OF zPgwK9EP4lQmK!Dprc*<Kp8Cwspt$&Xk3u@=2CwbN6pY#;=(lzrmXlnO5HDc?b8Uf9 ztv}O#uT6~pz94@QWWELGf=|}~pX6&yko`|M1ZM#@mdDdFnCIT+TMu5r^mTj0q`z;$ zQiWM+eI$B&W?}ey0?bX-uzVZd5X(6q3->`equ}PLl>UM7>}!0duB%3}0Eb8BaNCp5 z45_`>Y-g;*OGwGkIr5W0&(s3b6{C=w%~(Q}Z(M^yK9@fowL28n*pwV9YLrOSJlgHM z(e8DHB#C>`=3mmSDvxi}c^PXK?Ht_XIk%mG42f7Cn8Hy2W1;(%&m9%~j?GD7BX3s_ zC9m)8upgh%*4Uru3tPFB{Stq3qAY%oH?dc!Q3S^dVdfn{jjbs#ibdwUYpq5!yTALW zvHr9#WWhXpZ-?go2NJ_Jg!p&S^qJo!BlS^&{^?tCXh#&e#EBm2Tz!?qBT{}1hXlYd z2ayqXwW4{XZvVWo40Y-JRZc|2ztnYH`*kwI4h>8;IyJVcx8EKetcGpB{<iz+cFW?W z)u3<tU+Du|W}H{D45;cRV;)LA+2=k~?~uHh0Xvqj6!}AJLtxvZ{#5YCCtkrf51N;| zZ(e8G{@e3k1MCZYufVqk(f@l__^1EA#)gRO9SrqKly6lDN!jyKopoD0t}del^#2-b zUh)4AYF6*`1^?Z!|F$>U(AXjEMT4L9J7xA$3kkR1%)aB>s!D6wD5PN923nMSdp;#O zC(O^-IcG9Ic&v8xj>ba_PCIS?q0jBccPG4pzkK;hdy(M7_3S>xPqr~M;kDf4x#fzN z80d}aVmk!}p07oTI)v^1R6Eh+O>6D{S)-%<vQBC5JBD&^ekoO6J{4I}@p!kV=L{+x z5IOo>3J_bO8h<c0hjY4`dtSF+^Qbj#H?JP_T-R7f@b5t4allA#YOeuBol151z;qK0 z{__plJME%hH!E&8_j-CER=xf5d1#wDw*R`Uv)3!&CB4R4cx7ORBsqOXS>m0-L3rQg zm=DVvD<70e&i}QGkN?kthdK1>bFcbBSLii&TG@!H-N!|$kkbz&D<E~6nED)fSMp_E zHV~uAx#vI*D!fQ2<$K|nSw-I0B#+jO{}@u=BnbEUF71nQUee0%m-M7EnqhbmKp~W7 zY+{%uXZf}pr<T3$W2b(cRC)EC$vcL%B6w<15CznJ2(a84DRb-yF*^BjK%~ebJyi*< zD`+%)MtOObU4htTa_56NfLQr<yL4N2I%MA~d7`FYc!w?yJ>OD%(;m8Vi~l6?GWpCb z4IAamHCB8RgFoGR9=VSw9kvEZ&zcx-mL1O7oQ{kPqTz1H&lGECLp63c7t^_sYk<I9 z*gn)uTg}c7QO(#{g*joVMiqqWO!OnfJF@z<xYPEZ{iR|eikoS^>q3_vZe?1oUo0;W zi1p1{&e6D6)*$ve@mM=&SMN24+qW}FHtO|zD7}>eBj3!peuP&zNs;yayD;H@>78n* zv??ax8lfJg1Jo96`$|EaaS;(ro8L|QOB9B$HBTN>xi$@-Cg?DN2&xPJzReo7gh`kL zBZN1+`6(@j`k6e#cx2RkT!6^ScpPM_P7JdYQK;0TJOw?VAcR(1Fii}a_~@u3{Qkv! zbb_@2EUAzh_HTn$dwvlze38?Mj-hkf{B71rC(psQa#GLYn2>Uo0*3r#q6k1M&9VI9 zGY=bh=y+cED<k#G*DYm-c3Rz3exX5s0ZZWEv#%RPr_E6s8#1?FG2EKfS^7SFSv@D? z)j-#i)2)1r4vE&(Wmfur{ye6`Wm=u_aS4MRcLXM9&m?rgJRTv;%xb(rhhSSqsWieS z*mCKyNs)HX{lwx?A~`(%`TkpqaF)7|pOQ|oQBP-R;-K)LRvuVni)kluf?=MIInRCG zbLGKQ3E<^`Z~^7CsAmN}c1mhRGT?a9xMX;y1A5_U1o;gY_@yIHV#%y6i2~E=yP4vb z06w<xYm@~BO=K9@etov9C>*Rk1C2vjD@gFt)F6V=uWuf!(mZc0M#1%?lE9J*KTV2= zCu5VL-sti`o(>CvNoFo&_Z{QnL>Tcxs)ypdA|MI;L+q;JNkKhO!RK>uBjr}5u2L?@ z@g|nIAZ;7FQZNLc-rW&wV-`)MPl~wr>d#&Q&IfH`AU3^DlVRm<7Wcgf&NtAy7+yxU zcl$JHN-f(m+T(J1_k4b1GEu+uZ;Y-QT$lb?4C3^S2T`Fgl5NG4Cq__lXVwHye7t+* zFJ|8(x3?3!gN7$@!G&XZNhDFP^-q2w8n)m&v7<N(*14z0uo<CX`ZAo_rV@MI;kr8e z?JM6u>MgW#4V`s5B>>kFQOg5?eZgPXY3hdvH&0Lk;^LwlPmkEl7Y!&a0V2~#g>KEd zHzyhNJ>0)t{HZTeLOk`JIoqkQy*0CHNg}*1FASOVKwn5msi7e<-^i&;SwCZXD`0T> zyS@F%qRoIa_CjJOa)T=4xmK8<l!|sG&lCxm{ljDc3SKMKyWjt)@gz-N{=7@X>6?#4 zG)!4;&E|0EFW-7~Y+9fHDto*=j{U}UuNT#p-<-7I6xreF;Wk6jdfgva+zRyX(?wQ# zil;g_UBw?Cj;sYL05Z#41W>fm5)QUCcCWjrh$}Kd*&Z|Zy7s1YW4s#sI3D7rd6>{I zi(oo-?YStNy7Kw-snE?AB}n&sqH#f?!5J^y+FyUQn{3u{DQJHOh)e-v&c<UBPQ}#n zz$eg3+3q(r=>~-pcGnS)O%m$Dn?Eng{Eas>Vj^}V#p)K_)G^e1NfCe4P%Ap#TM2p? zXdn=_<{;9qGcs>r4lEQXsU%PFdQ(`Ao)I^AotB;|3^6rcY#oy9(|O1U&>Wzl+%V@A zvZC__El81zpW=k3I+}Xi)lQul{4y-R$L=3z@;DlsW9Jjh?BpwAj;1!|BH@I$o<8HM z^207Dc-7k~X2Li3c1L~${@<FCXb1vr`Wh_=ZFD)zIXZ|2yc_Z><XhmX=cC0{SvH@7 zKf12uvoYjIuk*4{J=z|bR7wGiyHNMF3l!`!3qhg)=}_zrLc&AxwDOS>KwZ2foY(VR z+}q1~ZJG6%T6jy%-_NjgP~AX6GmZ(`<)vXhB}p|D32}^UOTum-PFmZ;tISJ~+`!*W zBK(b&#$E+mpDNV!-A$IG6ep+uO9428d{s-KGiZ?1sNz+tPlMb;LE^#X=M)lcyDrhp z*m)83U_v5EAg$G$b@eJj2%NkadQ2z*>7E!=>s|IeDxwgbzOI(K*v&1ioC<aj$LW{s z7y<6m#M5ddF)A1y6RpUh$^eXP<&oo9Nd6u=hr8N$8V`m%)4aY<E8r+PYIKB0c;C8k zRL+8B3iUnM&{~Nj70;?aJHGoHP5!X6;Haz8^b|Rxqe3s2;qRaS3`WfGx^#2Zd0qLe zh}>Sko=dr#SwHW5bZR}{Gt*TTqJ_*`t%_dp`-@)%rp}8=Td$}l^IZBI<e?L9#8!<< zKh=_DWXu@qCi*$s!@mR&uU-fU;Z28AQBSD3U~n{gQi`!y$@6hu{p(~7MuSrg@l0zZ z8V=z_2+tHsS-0p3=><dAXsf6)E<@_wE@QK=F@pIF9>iAx%=qLes%^7;F7Uaeaj_?l zH-;e5jwD%4(BiMy+{vN$R@{ypkTO|b&iL2p&0Jbr!L9e#4{3{ZyFO6t)hXMx0s-=q zKBY)y6xk&YCTE-OOo}!tzOkmm-6{ts*q`A5-15Naex8;tkbA&IF98znEL{UN@=|p1 zSN~iD2HKZyrg<=YRbm_iV<2-Fr2_)29x;nYxwjf8?+h`u%(y+R*CM9P#GL+Bqetce zb+T73WqUZEfXIU3fU@U;VgvWS|6sF+cflvH(6tYTXAE+F^%)T4!!=)heeWu<H#_AT z`mhA9r)(-BSEvEZ#!O23KC~?Qk}^B`L{yrr?XM!IPu)P|aK(XAHhQ9}%pSkXt<eor zYx99}M=uODy8Qqqmc2AG#&+hBZDW?ms^6Mu6@scJDB<UGqgtO(Hd$4Cjor{U2S!52 zx~gXXC~mQz4Vrv}^#nu#{Kq!aZf+spCfsLVFqe?0<=+PbffsSPzoP4ra@W{flL($U zo&lLTuzP3$9<j+$lJy#kdG4Nsb87lD>*JA>jUTt{e%PelX@Sd?RNQflcdmBnu~Si1 znwi3lV+bELN=eIo@tu~@+?x)(!2clqvDzK%^o~-E9<^)6M<vQOtPFD_4Hi+$#E?^+ zZ8>%}iDhY9eXa+`p(+k}xcrLkN&bFZ?D@(^ZyE0<!;kInnZ#t6ls&eVcRn}?T;BQc z*jxQf0<zy~;i>q(Ody44HS5$0-He(1O{uF3kqv=={E$RB;&utp3&Vk@!Lg@58Co@8 zrHj=%Ee%R)IJ9_7BZFEbbbfAZjPq!R9-E(zUNMc9>ZCCtbgww$L8s-|tv`XMlv#y2 zs0p{l)3yxeh?i8y>Lo(+6|Y?38Tz=OpZ!WETnLt)BMZYnRS$Y}?@rLeVG~%U-)rOg zPA=rkbY`U)dxeU1qb4+I<4LR0&6Ew$RsYUZI}gM^e04K+@r>qQM@C(*KzC67$V^g6 zAgVPV+1BL`42QE%(306AjAisf$~h(XPbC!AqDkzifw4&23U`20mUoZeFqH$)d+dFz z<Q}$0cQI^eC5R2W770NcoH{AbR5QgHVN3fLLl2xLUM|<b(Q&B?$|9evrZ`?Z4eUSo zfd{*`sKsG%$p6D&j{0@5GI<GJrNt{{)K9X?|C$|*OhB>Hv3Ex!NH1(Js-O~q)juQR zXrAmC|24#{$zvl+3Oq(oN%ok#L^>+}lKGLEKj^Jime@_bs`NGTdq?DwHh;9wcMwHT zm6!6^`_+C1k@F(SPc{17x}m%2iHdk_by<@FQMrY|2gsTBga+7Wrk2)f7U<qNKw4!` z+!EH!{Eeat7sqqIap2*HDKaW`znJh!87a{ti$Wq82UjrCAOZ8Bj%DX*nWr{9mgdgX zgUjsOu*$}}RRrNc@*}TpBN&qL-b2_AI>i&FhF#VL10KMs##>eWApV6v#-dvhAWz9P z4iz>{>+IQhc(9P~GU7^+0dV}R{${;tu8VNeZSiUtpB-#?lX>jZdp1C(;9`!)J2r~M zC?$Dfa!j)|c~D^b?v5uKW%naEJwbfFmwm}1cS<%=8FOV%1lZo+G-$BD?%F<7?O3@G z{e-w5|Dq$??MCHnsa7X!?I+J=sc!cTSU%4bAN1s^MfG|3?iLAfzjH;<Vss1T!D9U6 zPgnD>C)5WVmUo-D!10F`x&DAD*3TPGJ(1Y?g?fyr)c?W5dZ-ks_Gy=czhCf@FwKe2 z5~Jkct`>a7T7O=Spz4u?d%pzBDn0JmTe^1J>8uXN?U2E2pZ}=d8#wvL-Z_99mQ{r~ zg2#2Dm7fq9-W%rTyA4>tXT8hH56JHOm*YY$C>{4XRO%GaE0}57FuA&e`VVYC=fS}_ zb~95a^fys>1*Lyu%=4F~@u^Z)nKSbn7loJ~p~(7K?-j2EW6D9&2UTt;q|TWIdwq(5 zb|4Y}Cq<XLrM7+Rpd)*KM9n%eL0!VbPG~Ulc+|q#B6qwZ^g^&b@7%+plgVle$C{JC z#sxSfGa*l9O9l9rv?LGp?D@q9Vu*U)^fhl2*a}>4$WRQ`IaHcBAdbou-uVy^C*|~r zm}03EYmV%{DZoVVD^IGRyV1_|8<A6QDFI~-4~^7xoTXzOvtVdiwxn!EZ^1yvqvzEX zrkrr%vG)l5VwD9OQ(^Y__3H5RWj?BM5}R;We5qL$5A=h9iJ0#wpy+a11t{UhqIBzG z5A_t^E*eE<e3SY?FLm&<&EfH}**FVI-90-AQw9EHBy{u){q}wL^yxfS;*76Bg!vz> zS#I4MFyoi1Y2BaEvm^V}_;Ef+a(w<xz4FoCgVrE%wXM;Y7l-T~ioWQoky5G9m3rZ@ zq^5c4Gk&aVsVD0gaY~0YhF@$O)p$6*?=Z9#B?YUJ-O#)?0WziKo7QPZwLt&E#q$+f H<cR+P#n{aZ literal 0 HcmV?d00001 diff --git a/scripts/buildtype.sh b/scripts/buildtype.sh new file mode 100644 index 00000000..998a0d13 --- /dev/null +++ b/scripts/buildtype.sh @@ -0,0 +1,30 @@ +#!/bin/bash + +FILENAME=source/loader/alt_ios_gen.c +GENERATE=0 +VERSION=249 + +if [ ! -z "$1" ]; +then + VERSION=$1 +fi + +if [ ! -f $FILENAME ]; +then + GENERATE=1 +else + CURRENT_VERSION=`grep mainIOS\ = $FILENAME | awk '{printf "%d", $4}'` + if [ $CURRENT_VERSION -ne $VERSION ]; + then + GENERATE=1 + fi +fi + +if [ $GENERATE -eq 1 ]; +then + + cat <<EOF > $FILENAME +#include "alt_ios.h" +int mainIOS = $VERSION; +EOF +fi \ No newline at end of file diff --git a/scripts/rvl.ld b/scripts/rvl.ld new file mode 100644 index 00000000..0fb899fc --- /dev/null +++ b/scripts/rvl.ld @@ -0,0 +1,304 @@ +/* + * Linkscript for Wii + */ + +OUTPUT_FORMAT("elf32-powerpc", "elf32-powerpc", "elf32-powerpc"); +OUTPUT_ARCH(powerpc:common); +EXTERN(_start); +ENTRY(_start); + +PHDRS +{ + /*cdat PT_LOAD FLAGS(6);*/ + stub PT_LOAD FLAGS(5); + text PT_LOAD FLAGS(5); + data PT_LOAD FLAGS(6); +} + +SECTIONS +{ + /*. = 0x80004000; + .cdat : + { + KEEP(*(.cdat)) + } :cdat = 0 + __cdat_end = .;*/ + + /* stub is loaded at physical address 0x00003400 (though both 0x80003400 and 0x00003400 are equivalent for IOS) */ + /* This can also be used to load an arbitrary standalone stub at an arbitrary address in memory, for any purpose */ + /* Use -Wl,--section-start,.stub=0xADDRESS to change */ + . = 0x00003400; + + .stub : + { + KEEP(*(.stub)) + } :stub = 0 + + /* default base address */ + /* use -Wl,--section-start,.init=0xADDRESS to change */ + . = 0x80B00000; + + /* Program */ + .init : + { + __init_start = .; + KEEP (*crt0.o(*.init)) + KEEP (*(.init)) + } :text = 0 + .plt : { *(.plt) } + .interp : { *(.interp) } + .hash : { *(.hash) } + .dynsym : { *(.dynsym) } + .dynstr : { *(.dynstr) } + .gnu.version : { *(.gnu.version) } + .gnu.version_d : { *(.gnu.version_d) } + .gnu.version_r : { *(.gnu.version_r) } + .rel.init : { *(.rel.init) } + .rela.init : { *(.rela.init) } + .rel.text : { *(.rel.text .rel.text.* .rel.gnu.linkonce.t.*) } + .rela.text : { *(.rela.text .rela.text.* .rela.gnu.linkonce.t.*) } + .rel.fini : { *(.rel.fini) } + .rela.fini : { *(.rela.fini) } + .rel.rodata : { *(.rel.rodata .rel.rodata.* .rel.gnu.linkonce.r.*) } + .rela.rodata : { *(.rela.rodata .rela.rodata.* .rela.gnu.linkonce.r.*) } + .rel.data : { *(.rel.data .rel.data.* .rel.gnu.linkonce.d.*) } + .rela.data : { *(.rela.data .rela.data.* .rela.gnu.linkonce.d.*) } + .rel.tdata : { *(.rel.tdata .rel.tdata.* .rel.gnu.linkonce.td.*) } + .rela.tdata : { *(.rela.tdata .rela.tdata.* .rela.gnu.linkonce.td.*) } + .rel.tbss : { *(.rel.tbss .rel.tbss.* .rel.gnu.linkonce.tb.*) } + .rela.tbss : { *(.rela.tbss .rela.tbss.* .rela.gnu.linkonce.tb.*) } + .rel.ctors : { *(.rel.ctors) } + .rela.ctors : { *(.rela.ctors) } + .rel.dtors : { *(.rel.dtors) } + .rela.dtors : { *(.rela.dtors) } + .rel.got : { *(.rel.got) } + .rela.got : { *(.rela.got) } + .rela.got1 : { *(.rela.got1) } + .rela.got2 : { *(.rela.got2) } + .rel.sdata : { *(.rel.sdata .rel.sdata.* .rel.gnu.linkonce.s.*) } + .rela.sdata : { *(.rela.sdata .rela.sdata.* .rela.gnu.linkonce.s.*) } + .rel.sbss : { *(.rel.sbss .rel.sbss.* .rel.gnu.linkonce.sb.*) } + .rela.sbss : { *(.rela.sbss .rela.sbss.* .rel.gnu.linkonce.sb.*) } + .rel.sdata2 : { *(.rel.sdata2 .rel.sdata2.* .rel.gnu.linkonce.s2.*) } + .rela.sdata2 : { *(.rela.sdata2 .rela.sdata2.* .rela.gnu.linkonce.s2.*) } + .rel.sbss2 : { *(.rel.sbss2 .rel.sbss2.* .rel.gnu.linkonce.sb2.*) } + .rela.sbss2 : { *(.rela.sbss2 .rela.sbss2.* .rela.gnu.linkonce.sb2.*) } + .rel.bss : { *(.rel.bss .rel.bss.* .rel.gnu.linkonce.b.*) } + .rela.bss : { *(.rela.bss .rela.bss.* .rela.gnu.linkonce.b.*) } + .rel.plt : { *(.rel.plt) } + .rela.plt : { *(.rela.plt) } + + .text : + { + *(.text) + *(.text.*) + /* .gnu.warning sections are handled specially by elf32.em. */ + *(.gnu.warning) + *(.gnu.linkonce.t.*) + . = ALIGN(32); /* REQUIRED. LD is flaky without it. */ + } = 0 + + .fini : + { + KEEP (*(.fini)) + . = ALIGN(32); /* REQUIRED. LD is flaky without it. */ + } = 0 + + PROVIDE (__etext = .); + PROVIDE (_etext = .); + PROVIDE (etext = .); + + .rodata : { *(.rodata) *(.rodata.*) *(.gnu.linkonce.r.*) } :data + .rodata1 : { *(.rodata1) } + .sdata2 : { *(.sdata2) *(.sdata2.*) *(.gnu.linkonce.s2.*) } + .sbss2 : { *(.sbss2) *(.sbss2.*) *(.gnu.linkonce.sb2.*) } + /* Adjust the address for the data segment. We want to adjust up to + the same address within the page on the next page up. */ + /* Ensure the __preinit_array_start label is properly aligned. We + could instead move the label definition inside the section, but + the linker would then create the section even if it turns out to + be empty, which isn't pretty. */ + . = ALIGN(32 / 8); + PROVIDE (__preinit_array_start = .); + .preinit_array : { *(.preinit_array) } + PROVIDE (__preinit_array_end = .); + PROVIDE (__init_array_start = .); + .init_array : { *(.init_array) } + PROVIDE (__init_array_end = .); + PROVIDE (__fini_array_start = .); + .fini_array : { *(.fini_array) } + PROVIDE (__fini_array_end = .); + .data : + { + *(.data) + *(.data.*) + *(.gnu.linkonce.d.*) + SORT(CONSTRUCTORS) + . = ALIGN(32); /* REQUIRED. LD is flaky without it. */ + } + + .data1 : { *(.data1) } + .tdata : { *(.tdata .tdata.* .gnu.linkonce.td.*) } + .tbss : { *(.tbss .tbss.* .gnu.linkonce.tb.*) *(.tcommon) } + .eh_frame : { KEEP (*(.eh_frame)) } + .gcc_except_table : { *(.gcc_except_table) } + .fixup : { *(.fixup) } + .got1 : { *(.got1) } + .got2 : { *(.got2) } + .dynamic : { *(.dynamic) } + + .ctors : + { + /* gcc uses crtbegin.o to find the start of + the constructors, so we make sure it is + first. Because this is a wildcard, it + doesn't matter if the user does not + actually link against crtbegin.o; the + linker won't look for a file to match a + wildcard. The wildcard also means that it + doesn't matter which directory crtbegin.o + is in. */ + + KEEP (*crtbegin.o(.ctors)) + + /* We don't want to include the .ctor section from + from the crtend.o file until after the sorted ctors. + The .ctor section from the crtend file contains the + end of ctors marker and it must be last */ + + KEEP (*(EXCLUDE_FILE (*crtend.o ) .ctors)) + KEEP (*(SORT(.ctors.*))) + KEEP (*(.ctors)) + . = ALIGN(32); /* REQUIRED. LD is flaky without it. */ + } + + .dtors : + { + KEEP (*crtbegin.o(.dtors)) + KEEP (*(EXCLUDE_FILE (*crtend.o ) .dtors)) + KEEP (*(SORT(.dtors.*))) + KEEP (*(.dtors)) + . = ALIGN(32); /* REQUIRED. LD is flaky without it. */ + } + + .jcr : { KEEP (*(.jcr)) } + .got : { *(.got.plt) *(.got) } + + + /* We want the small data sections together, so single-instruction offsets + can access them all, and initialized data all before uninitialized, so + we can shorten the on-disk segment size. */ + + .sdata : + { + *(.sdata) + *(.sdata.*) + *(.gnu.linkonce.s.*) + . = ALIGN(32); /* REQUIRED. LD is flaky without it. */ + } + + _edata = .; + PROVIDE (edata = .); + + .sbss : + { + __sbss_start = .; + PROVIDE (__sbss_start = .); + PROVIDE (___sbss_start = .); + *(.dynsbss) + *(.sbss) + *(.sbss.*) + *(.gnu.linkonce.sb.*) + *(.scommon) + PROVIDE (__sbss_end = .); + PROVIDE (___sbss_end = .); + . = ALIGN(32); /* REQUIRED. LD is flaky without it. */ + __sbss_end = .; + } + + .bss : + { + __bss_start = .; + PROVIDE (__bss_start = .); + *(.dynbss) + *(.bss) + *(.bss.*) + *(.gnu.linkonce.b.*) + *(COMMON) + /* Align here to ensure that the .bss section occupies space up to + _end. Align after .bss to ensure correct alignment even if the + .bss section disappears because there are no input sections. */ + + . = ALIGN(32); + + PROVIDE (__bss_end = .); + __bss_end = .; + } + . = ALIGN(32); + _end = .; + PROVIDE(end = .); + /* Stabs debugging sections. */ + .stab 0 : { *(.stab) } + .stabstr 0 : { *(.stabstr) } + .stab.excl 0 : { *(.stab.excl) } + .stab.exclstr 0 : { *(.stab.exclstr) } + .stab.index 0 : { *(.stab.index) } + .stab.indexstr 0 : { *(.stab.indexstr) } + .comment 0 : { *(.comment) } + /* DWARF debug sections. + Symbols in the DWARF debugging sections are relative to the beginning + of the section so we begin them at 0. */ + /* DWARF 1 */ + .debug 0 : { *(.debug) } + .line 0 : { *(.line) } + /* GNU DWARF 1 extensions */ + .debug_srcinfo 0 : { *(.debug_srcinfo) } + .debug_sfnames 0 : { *(.debug_sfnames) } + /* DWARF 1.1 and DWARF 2 */ + .debug_aranges 0 : { *(.debug_aranges) } + .debug_pubnames 0 : { *(.debug_pubnames) } + /* DWARF 2 */ + .debug_info 0 : { *(.debug_info) } + .debug_abbrev 0 : { *(.debug_abbrev) } + .debug_line 0 : { *(.debug_line) } + .debug_frame 0 : { *(.debug_frame) } + .debug_str 0 : { *(.debug_str) } + .debug_loc 0 : { *(.debug_loc) } + .debug_macinfo 0 : { *(.debug_macinfo) } + /* SGI/MIPS DWARF 2 extensions */ + .debug_weaknames 0 : { *(.debug_weaknames) } + .debug_funcnames 0 : { *(.debug_funcnames) } + .debug_typenames 0 : { *(.debug_typenames) } + .debug_varnames 0 : { *(.debug_varnames) } + /* These must appear regardless of . */ +} + +__isIPL = 0; +__stack_addr = (__bss_start + SIZEOF(.bss) + 0x20000 + 7) & (-8); +__stack_end = (__bss_start + SIZEOF(.bss)); +__intrstack_addr = (__stack_addr + 0x4000); +__intrstack_end = (__stack_addr); +__Arena1Lo = (__intrstack_addr + 31) & (-32); +__Arena1Hi = (0x81700000); +__Arena2Lo = (0x90002000); +__Arena2Hi = (0x933E0000); + +__gxregs = (__Arena1Hi + 31) & (-32); +__ipcbufferLo = (0x933e0000); +__ipcbufferHi = (0x93400000); + +/* for backward compatibility with old crt0 */ +PROVIDE (__stack = (0x81700000)); + +PROVIDE(__isIPL = __isIPL); +PROVIDE(__stack_addr = __stack_addr); +PROVIDE(__stack_end = __stack_end); +PROVIDE(__intrstack_addr = __intrstack_addr); +PROVIDE(__intrstack_end = __intrstack_end); +PROVIDE(__Arena1Lo = __Arena1Lo); +PROVIDE(__Arena1Hi = __Arena1Hi); +PROVIDE(__Arena2Lo = __Arena2Lo); +PROVIDE(__Arena2Hi = __Arena2Hi); +PROVIDE(__ipcbufferLo = __ipcbufferLo); +PROVIDE(__ipcbufferHi = __ipcbufferHi); +PROVIDE(__gxregs = __gxregs); diff --git a/scripts/svnrev.sh b/scripts/svnrev.sh new file mode 100644 index 00000000..2a9f3940 --- /dev/null +++ b/scripts/svnrev.sh @@ -0,0 +1,42 @@ +#! /bin/bash +# +rev_new_raw=$(svnversion -n . 2>/dev/null | tr '\n' ' ' | tr -d '\r') +[ -n "$rev_new_raw" ] || rev_new_raw=$(SubWCRev . 2>/dev/null | tr '\n' ' ' | tr -d '\r') + +if [ "$rev_new_raw" == "exported" ]; +then + echo This copy of wiiflow is not under source control + exit +fi + + +rev_new_raw=$(echo $rev_new_raw | sed 's/[^0-9]*\([0-9]*\)\(.*\)/\1 \2/') +rev_new=0 +a=$(echo $rev_new_raw | sed 's/\([0-9]*\).*/\1/') +let "a+=0" +#find max rev +while [ "$a" ]; do + [ "$a" -gt "$rev_new" ] && rev_new=$a + rev_new_raw=$(echo -n $rev_new_raw | sed 's/[0-9]*[^0-9]*\([0-9]*\)\(.*\)/\1 \2/') + a=$(echo $rev_new_raw | sed 's/\([0-9]*\).*/\1/') +done + +rev_old=$(cat ./source/svnrev.h 2>/dev/null | tr -d '\n' | sed 's/[^0-9]*\([0-9]*\).*/\1/') + +if [ "$rev_new" != "$rev_old" ] || [ ! -f ./source/svnrev.h ]; then + + cat <<EOF > ./source/svnrev.h +#define SVN_REV "$rev_new" +EOF + + if [ -n "$rev_old" ]; then + echo "Changed Rev $rev_old to $rev_new" >&2 + else + echo "svnrev.h created" >&2 + fi + + rev_new=`expr $rev_new + 1` + rev_date=`date +%Y%m%d%H%M -u` + + +fi diff --git a/source/btnmap.h b/source/btnmap.h new file mode 100644 index 00000000..3d2ee209 --- /dev/null +++ b/source/btnmap.h @@ -0,0 +1,215 @@ +#define WBTN_UP (WPAD_BUTTON_UP | WPAD_CLASSIC_BUTTON_UP) +#define WBTN_DOWN (WPAD_BUTTON_DOWN | WPAD_CLASSIC_BUTTON_DOWN) +#define WBTN_LEFT (WPAD_BUTTON_LEFT | WPAD_CLASSIC_BUTTON_LEFT) +#define WBTN_RIGHT (WPAD_BUTTON_RIGHT | WPAD_CLASSIC_BUTTON_RIGHT) +#define WBTN_PLUS (WPAD_BUTTON_PLUS | WPAD_CLASSIC_BUTTON_PLUS) +#define WBTN_MINUS (WPAD_BUTTON_MINUS | WPAD_CLASSIC_BUTTON_MINUS) +#define WBTN_HOME (WPAD_BUTTON_HOME | WPAD_CLASSIC_BUTTON_HOME) +#define WBTN_A (WPAD_BUTTON_A | WPAD_CLASSIC_BUTTON_A) +#define WBTN_B (WPAD_BUTTON_B | WPAD_CLASSIC_BUTTON_B) +#define WBTN_1 (WPAD_BUTTON_1 | WPAD_CLASSIC_BUTTON_Y) +#define WBTN_2 (WPAD_BUTTON_2 | WPAD_CLASSIC_BUTTON_X) + +#define WBTN_UP_PRESSED (wii_btnsPressed & WBTN_UP) +#define WBTN_DOWN_PRESSED (wii_btnsPressed & WBTN_DOWN) +#define WBTN_LEFT_PRESSED (wii_btnsPressed & WBTN_LEFT) +#define WBTN_RIGHT_PRESSED (wii_btnsPressed & WBTN_RIGHT) +#define WBTN_MINUS_PRESSED (wii_btnsPressed & WBTN_MINUS) +#define WBTN_PLUS_PRESSED (wii_btnsPressed & WBTN_PLUS) +#define WBTN_HOME_PRESSED (wii_btnsPressed & WBTN_HOME) +#define WBTN_A_PRESSED (wii_btnsPressed & WBTN_A) +#define WBTN_B_PRESSED (wii_btnsPressed & WBTN_B) +#define WBTN_1_PRESSED (wii_btnsPressed & WBTN_1) +#define WBTN_2_PRESSED (wii_btnsPressed & WBTN_2) + +#define WBTN_UP_HELD (wii_btnsHeld & WBTN_UP) +#define WBTN_DOWN_HELD (wii_btnsHeld & WBTN_DOWN) +#define WBTN_LEFT_HELD (wii_btnsHeld & WBTN_LEFT) +#define WBTN_RIGHT_HELD (wii_btnsHeld & WBTN_RIGHT) +#define WBTN_MINUS_HELD (wii_btnsHeld & WBTN_MINUS) +#define WBTN_PLUS_HELD (wii_btnsHeld & WBTN_PLUS) +#define WBTN_HOME_HELD (wii_btnsHeld & WBTN_HOME) +#define WBTN_A_HELD (wii_btnsHeld & WBTN_A) +#define WBTN_B_HELD (wii_btnsHeld & WBTN_B) +#define WBTN_1_HELD (wii_btnsHeld & WBTN_1) +#define WBTN_2_HELD (wii_btnsHeld & WBTN_2) + +#define GBTN_UP (PAD_BUTTON_UP) +#define GBTN_DOWN (PAD_BUTTON_DOWN) +#define GBTN_LEFT (PAD_BUTTON_LEFT) +#define GBTN_RIGHT (PAD_BUTTON_RIGHT) +#define GBTN_PLUS (PAD_TRIGGER_R) +#define GBTN_MINUS (PAD_TRIGGER_L) +#define GBTN_HOME (PAD_BUTTON_MENU) +#define GBTN_A (PAD_BUTTON_A) +#define GBTN_B (PAD_BUTTON_B) +#define GBTN_1 (PAD_BUTTON_Y) +#define GBTN_2 (PAD_BUTTON_X) + +#define GBTN_UP_PRESSED (gc_btnsPressed & GBTN_UP) +#define GBTN_DOWN_PRESSED (gc_btnsPressed & GBTN_DOWN) +#define GBTN_LEFT_PRESSED (gc_btnsPressed & GBTN_LEFT) +#define GBTN_RIGHT_PRESSED (gc_btnsPressed & GBTN_RIGHT) +#define GBTN_MINUS_PRESSED (gc_btnsPressed & GBTN_MINUS) +#define GBTN_PLUS_PRESSED (gc_btnsPressed & GBTN_PLUS) +#define GBTN_HOME_PRESSED (gc_btnsPressed & GBTN_HOME) +#define GBTN_A_PRESSED (gc_btnsPressed & GBTN_A) +#define GBTN_B_PRESSED (gc_btnsPressed & GBTN_B) +#define GBTN_1_PRESSED (gc_btnsPressed & GBTN_1) +#define GBTN_2_PRESSED (gc_btnsPressed & GBTN_2) + +#define GBTN_UP_HELD (gc_btnsHeld & GBTN_UP) +#define GBTN_DOWN_HELD (gc_btnsHeld & GBTN_DOWN) +#define GBTN_LEFT_HELD (gc_btnsHeld & GBTN_LEFT) +#define GBTN_RIGHT_HELD (gc_btnsHeld & GBTN_RIGHT) +#define GBTN_MINUS_HELD (gc_btnsHeld & GBTN_MINUS) +#define GBTN_PLUS_HELD (gc_btnsHeld & GBTN_PLUS) +#define GBTN_HOME_HELD (gc_btnsHeld & GBTN_HOME) +#define GBTN_A_HELD (gc_btnsHeld & GBTN_A) +#define GBTN_B_HELD (gc_btnsHeld & GBTN_B) +#define GBTN_1_HELD (gc_btnsHeld & GBTN_1) +#define GBTN_2_HELD (gc_btnsHeld & GBTN_2) + +#define BTN_UP_PRESSED (WBTN_UP_PRESSED || GBTN_UP_PRESSED) +#define BTN_DOWN_PRESSED (WBTN_DOWN_PRESSED || GBTN_DOWN_PRESSED) +#define BTN_LEFT_PRESSED (WBTN_LEFT_PRESSED || GBTN_LEFT_PRESSED) +#define BTN_RIGHT_PRESSED (WBTN_RIGHT_PRESSED || GBTN_RIGHT_PRESSED) +#define BTN_MINUS_PRESSED (WBTN_MINUS_PRESSED || GBTN_MINUS_PRESSED) +#define BTN_PLUS_PRESSED (WBTN_PLUS_PRESSED || GBTN_PLUS_PRESSED) +#define BTN_HOME_PRESSED (WBTN_HOME_PRESSED || GBTN_HOME_PRESSED) +#define BTN_A_PRESSED (WBTN_A_PRESSED || GBTN_A_PRESSED) +#define BTN_B_PRESSED (WBTN_B_PRESSED || GBTN_B_PRESSED) +#define BTN_1_PRESSED (WBTN_1_PRESSED || GBTN_1_PRESSED) +#define BTN_2_PRESSED (WBTN_2_PRESSED || GBTN_2_PRESSED) + +#define BTN_UP_HELD (WBTN_UP_HELD || GBTN_UP_HELD) +#define BTN_DOWN_HELD (WBTN_DOWN_HELD || GBTN_DOWN_HELD) +#define BTN_LEFT_HELD (WBTN_LEFT_HELD || GBTN_LEFT_HELD) +#define BTN_RIGHT_HELD (WBTN_RIGHT_HELD || GBTN_RIGHT_HELD) +#define BTN_MINUS_HELD (WBTN_MINUS_HELD || GBTN_MINUS_HELD) +#define BTN_PLUS_HELD (WBTN_PLUS_HELD || GBTN_PLUS_HELD) +#define BTN_HOME_HELD (WBTN_HOME_HELD || GBTN_HOME_HELD) +#define BTN_A_HELD (WBTN_A_HELD || GBTN_A_HELD) +#define BTN_B_HELD (WBTN_B_HELD || GBTN_B_HELD) +#define BTN_1_HELD (WBTN_1_HELD || GBTN_1_HELD) +#define BTN_2_HELD (WBTN_2_HELD || GBTN_2_HELD) + +#define BTN_UP_REPEAT (wii_btnRepeat(WBTN_UP) || gc_btnRepeat(GBTN_UP)) +#define BTN_DOWN_REPEAT (wii_btnRepeat(WBTN_DOWN) || gc_btnRepeat(GBTN_DOWN)) +#define BTN_LEFT_REPEAT (wii_btnRepeat(WBTN_LEFT) || gc_btnRepeat(GBTN_LEFT)) +#define BTN_RIGHT_REPEAT (wii_btnRepeat(WBTN_RIGHT) || gc_btnRepeat(GBTN_RIGHT)) +/* #define BTN_MINUS_REPEAT (wii_btnRepeat(WBTN_MINUS) || gc_btnRepeat(GBTN_MINUS)) +#define BTN_PLUS_REPEAT (wii_btnRepeat(WBTN_PLUS) || gc_btnRepeat(GBTN_PLUS)) +#define BTN_HOME_REPEAT (wii_btnRepeat(WBTN_HOME) || gc_btnRepeat(GBTN_HOME)) */ +#define BTN_A_REPEAT (wii_btnRepeat(WBTN_A) || gc_btnRepeat(GBTN_A)) +/* #define BTN_B_REPEAT (wii_btnRepeat(WBTN_B) || gc_btnRepeat(GBTN_B)) +#define BTN_1_REPEAT (wii_btnRepeat(WBTN_1) || gc_btnRepeat(GBTN_1)) +#define BTN_2_REPEAT (wii_btnRepeat(WBTN_2) || gc_btnRepeat(GBTN_2)) */ + +#define LEFT_STICK_UP lStick_Up() +#define LEFT_STICK_DOWN lStick_Down() +#define LEFT_STICK_LEFT lStick_Left() +#define LEFT_STICK_RIGHT lStick_Right() + +#define RIGHT_STICK_UP rStick_Up() +#define RIGHT_STICK_DOWN rStick_Down() +#define RIGHT_STICK_LEFT rStick_Left() +#define RIGHT_STICK_RIGHT rStick_Right() + +#define WROLL_LEFT wRoll_Left() +#define WROLL_RIGHT wRoll_Right() + +/* Internal */ +#define LEFT_STICK_ANG_UP ((left_stick_angle[chan] >= 300 && left_stick_angle[chan] <= 360) \ + || (left_stick_angle[chan] >= 0 && left_stick_angle[chan] <= 60)) +#define LEFT_STICK_ANG_RIGHT (left_stick_angle[chan] >= 30 && left_stick_angle[chan] <= 150) +#define LEFT_STICK_ANG_DOWN (left_stick_angle[chan] >= 120 && left_stick_angle[chan] <= 240) +#define LEFT_STICK_ANG_LEFT (left_stick_angle[chan] >= 210 && left_stick_angle[chan] <= 330) + +#define RIGHT_STICK_ANG_UP ((right_stick_angle[chan] >= 300 && right_stick_angle[chan] <= 360) \ + || (right_stick_angle[chan] >= 0 && right_stick_angle[chan] <= 60)) +#define RIGHT_STICK_ANG_RIGHT (right_stick_angle[chan] >= 30 && right_stick_angle[chan] <= 150) +#define RIGHT_STICK_ANG_DOWN (right_stick_angle[chan] >= 120 && right_stick_angle[chan] <= 240) +#define RIGHT_STICK_ANG_LEFT (right_stick_angle[chan] >= 210 && right_stick_angle[chan] <= 330) + + +/* +//Button values reference// +WPAD_BUTTON_2 0x0001 +PAD_BUTTON_LEFT 0x0001 + +WPAD_BUTTON_1 0x0002 +PAD_BUTTON_RIGHT 0x0002 + +WPAD_BUTTON_B 0x0004 +PAD_BUTTON_DOWN 0x0004 + +WPAD_BUTTON_A 0x0008 +PAD_BUTTON_UP 0x0008 + +WPAD_BUTTON_MINUS 0x0010 +PAD_TRIGGER_Z 0x0010 + +PAD_TRIGGER_R 0x0020 + +PAD_TRIGGER_L 0x0040 + +WPAD_BUTTON_HOME 0x0080 + +WPAD_BUTTON_LEFT 0x0100 +PAD_BUTTON_A 0x0100 + +WPAD_BUTTON_RIGHT 0x0200 +PAD_BUTTON_B 0x0200 + +WPAD_BUTTON_DOWN 0x0400 +PAD_BUTTON_X 0x0400 + +WPAD_BUTTON_UP 0x0800 +PAD_BUTTON_Y 0x0800 + +WPAD_BUTTON_PLUS 0x1000 +PAD_BUTTON_MENU 0x1000 +PAD_BUTTON_START 0x1000 + +WPAD_NUNCHUK_BUTTON_Z (0x0001<<16) +WPAD_CLASSIC_BUTTON_UP (0x0001<<16) +WPAD_GUITAR_HERO_3_BUTTON_STRUM_UP (0x0001<<16) + +WPAD_NUNCHUK_BUTTON_C (0x0002<<16) +WPAD_CLASSIC_BUTTON_LEFT (0x0002<<16) + +WPAD_CLASSIC_BUTTON_ZR (0x0004<<16) + +WPAD_CLASSIC_BUTTON_X (0x0008<<16) +WPAD_GUITAR_HERO_3_BUTTON_YELLOW (0x0008<<16) + +WPAD_CLASSIC_BUTTON_A (0x0010<<16) +WPAD_GUITAR_HERO_3_BUTTON_GREEN (0x0010<<16) + +WPAD_CLASSIC_BUTTON_Y (0x0020<<16) +WPAD_GUITAR_HERO_3_BUTTON_BLUE (0x0020<<16) + +WPAD_CLASSIC_BUTTON_B (0x0040<<16) +WPAD_GUITAR_HERO_3_BUTTON_RED (0x0040<<16) + +WPAD_CLASSIC_BUTTON_ZL (0x0080<<16) +WPAD_GUITAR_HERO_3_BUTTON_ORANGE (0x0080<<16) + +WPAD_CLASSIC_BUTTON_FULL_R (0x0200<<16) + +WPAD_CLASSIC_BUTTON_PLUS (0x0400<<16) +WPAD_GUITAR_HERO_3_BUTTON_PLUS (0x0400<<16) + +WPAD_CLASSIC_BUTTON_HOME (0x0800<<16) + +WPAD_CLASSIC_BUTTON_MINUS (0x1000<<16) +WPAD_GUITAR_HERO_3_BUTTON_MINUS (0x1000<<16) + +WPAD_CLASSIC_BUTTON_FULL_L (0x2000<<16) + +WPAD_CLASSIC_BUTTON_DOWN (0x4000<<16) +WPAD_GUITAR_HERO_3_BUTTON_STRUM_DOWN (0x4000<<16) + +WPAD_CLASSIC_BUTTON_RIGHT (0x8000<<16) +*/ \ No newline at end of file diff --git a/source/channel/MD5.c b/source/channel/MD5.c new file mode 100644 index 00000000..21092629 --- /dev/null +++ b/source/channel/MD5.c @@ -0,0 +1,633 @@ +/* ========================================================================== ** + * + * MD5.c + * + * Copyright: + * Copyright (C) 2003-2005 by Christopher R. Hertel + * + * Email: crh@ubiqx.mn.org + * + * $Id: MD5.c,v 0.6 2005/06/08 18:35:59 crh Exp $ + * + * + * Modifications and additions by dimok + * + * -------------------------------------------------------------------------- ** + * + * Description: + * Implements the MD5 hash algorithm, as described in RFC 1321. + * + * -------------------------------------------------------------------------- ** + * + * License: + * + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Lesser General Public + * License as published by the Free Software Foundation; either + * version 2.1 of the License, or (at your option) any later version. + * + * This library 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 + * Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public + * License along with this library; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + * + * -------------------------------------------------------------------------- ** + * + * Notes: + * + * None of this will make any sense unless you're studying RFC 1321 as you + * read the code. + * + * MD5 is described in RFC 1321. + * The MD*4* algorithm is described in RFC 1320 (that's 1321 - 1). + * MD5 is very similar to MD4, but not quite similar enough to justify + * putting the two into a single module. Besides, I wanted to add a few + * extra functions to this one to expand its usability. + * + * There are three primary motivations for this particular implementation. + * 1) Programmer's pride. I wanted to be able to say I'd done it, and I + * wanted to learn from the experience. + * 2) Portability. I wanted an implementation that I knew to be portable + * to a reasonable number of platforms. In particular, the algorithm is + * designed with little-endian platforms in mind, but I wanted an + * endian-agnostic implementation. + * 3) Compactness. While not an overriding goal, I thought it worth-while + * to see if I could reduce the overall size of the result. This is in + * keeping with my hopes that this library will be suitable for use in + * some embedded environments. + * Beyond that, cleanliness and clarity are always worth pursuing. + * + * As mentioned above, the code really only makes sense if you are familiar + * with the MD5 algorithm or are using RFC 1321 as a guide. This code is + * quirky, however, so you'll want to be reading carefully. + * + * Yeah...most of the comments are cut-and-paste from my MD4 implementation. + * + * -------------------------------------------------------------------------- ** + * + * References: + * IETF RFC 1321: The MD5 Message-Digest Algorithm + * Ron Rivest. IETF, April, 1992 + * + * ========================================================================== ** + */ + +#include <stdint.h> +#include <stddef.h> +#include <stdlib.h> +#include <stdio.h> +#include <string.h> +#include <malloc.h> +#include <ctype.h> + +#include "MD5.h" +#include "utils.h" +#include "mem2.hpp" + +/* -------------------------------------------------------------------------- ** + * Static Constants: + * + * K[][] - In round one, the values of k (which are used to index + * particular four-byte sequences in the input) are simply + * sequential. In later rounds, however, they are a bit more + * varied. Rather than calculate the values of k (which may + * or may not be possible--I haven't though about it) the + * values are stored in this array. + * + * S[][] - In each round there is a left rotate operation performed as + * part of the 16 permutations. The number of bits varies in + * a repeating patter. This array keeps track of the patterns + * used in each round. + * + * T[][] - There are four rounds of 16 permutations for a total of 64. + * In each of these 64 permutation operations, a different + * constant value is added to the mix. The constants are + * based on the sine function...read RFC 1321 for more detail. + * In any case, the correct constants are stored in the T[][] + * array. They're divided up into four groups of 16. + */ + +static const uint8_t K[3][16] = + { + /* Round 1: skipped (since it is simply sequential). */ + { 1, 6, 11, 0, 5, 10, 15, 4, 9, 14, 3, 8, 13, 2, 7, 12 }, /* R2 */ + { 5, 8, 11, 14, 1, 4, 7, 10, 13, 0, 3, 6, 9, 12, 15, 2 }, /* R3 */ + { 0, 7, 14, 5, 12, 3, 10, 1, 8, 15, 6, 13, 4, 11, 2, 9 } /* R4 */ + }; + +static const uint8_t S[4][4] = + { + { 7, 12, 17, 22 }, /* Round 1 */ + { 5, 9, 14, 20 }, /* Round 2 */ + { 4, 11, 16, 23 }, /* Round 3 */ + { 6, 10, 15, 21 } /* Round 4 */ + }; + + +static const uint32_t T[4][16] = + { + { 0xd76aa478, 0xe8c7b756, 0x242070db, 0xc1bdceee, /* Round 1 */ + 0xf57c0faf, 0x4787c62a, 0xa8304613, 0xfd469501, + 0x698098d8, 0x8b44f7af, 0xffff5bb1, 0x895cd7be, + 0x6b901122, 0xfd987193, 0xa679438e, 0x49b40821 }, + + { 0xf61e2562, 0xc040b340, 0x265e5a51, 0xe9b6c7aa, /* Round 2 */ + 0xd62f105d, 0x02441453, 0xd8a1e681, 0xe7d3fbc8, + 0x21e1cde6, 0xc33707d6, 0xf4d50d87, 0x455a14ed, + 0xa9e3e905, 0xfcefa3f8, 0x676f02d9, 0x8d2a4c8a }, + + { 0xfffa3942, 0x8771f681, 0x6d9d6122, 0xfde5380c, /* Round 3 */ + 0xa4beea44, 0x4bdecfa9, 0xf6bb4b60, 0xbebfbc70, + 0x289b7ec6, 0xeaa127fa, 0xd4ef3085, 0x04881d05, + 0xd9d4d039, 0xe6db99e5, 0x1fa27cf8, 0xc4ac5665 }, + + { 0xf4292244, 0x432aff97, 0xab9423a7, 0xfc93a039, /* Round 4 */ + 0x655b59c3, 0x8f0ccc92, 0xffeff47d, 0x85845dd1, + 0x6fa87e4f, 0xfe2ce6e0, 0xa3014314, 0x4e0811a1, + 0xf7537e82, 0xbd3af235, 0x2ad7d2bb, 0xeb86d391 }, + }; + + +/* -------------------------------------------------------------------------- ** + * Macros: + * md5F(), md5G(), md5H(), and md5I() are described in RFC 1321. + * All of these operations are bitwise, and so not impacted by endian-ness. + * + * GetLongByte() + * Extract one byte from a (32-bit) longword. A value of 0 for <idx> + * indicates the lowest order byte, while 3 indicates the highest order + * byte. + * + */ + +#define md5F( X, Y, Z ) ( ((X) & (Y)) | ((~(X)) & (Z)) ) +#define md5G( X, Y, Z ) ( ((X) & (Z)) | ((Y) & (~(Z))) ) +#define md5H( X, Y, Z ) ( (X) ^ (Y) ^ (Z) ) +#define md5I( X, Y, Z ) ( (Y) ^ ((X) | (~(Z))) ) + +#define GetLongByte( L, idx ) ((unsigned char)(( L >> (((idx) & 0x03) << 3) ) & 0xFF)) + +#define STR2HEX(x) ((x >= 0x30) && (x <= 0x39)) ? x - 0x30 : toupper((int)x)-0x37 + + +/* -------------------------------------------------------------------------- ** + * Static Functions: + */ + +static void Permute( uint32_t ABCD[4], const unsigned char block[64] ) + /* ------------------------------------------------------------------------ ** + * Permute the ABCD "registers" using the 64-byte <block> as a driver. + * + * Input: ABCD - Pointer to an array of four unsigned longwords. + * block - An array of bytes, 64 bytes in size. + * + * Output: none. + * + * Notes: The MD5 algorithm operates on a set of four longwords stored + * (conceptually) in four "registers". It is easy to imagine a + * simple MD4/5 chip that would operate this way. In any case, + * the mangling of the contents of those registers is driven by + * the input message. The message is chopped and finally padded + * into 64-byte chunks and each chunk is used to manipulate the + * contents of the registers. + * + * The MD5 Algorithm calls for padding the input to ensure that + * it is a multiple of 64 bytes in length. The last 16 bytes + * of the padding space are used to store the message length + * (the length of the original message, before padding, expressed + * in terms of bits). If there is not enough room for 16 bytes + * worth of bitcount (eg., if the original message was 122 bytes + * long) then the block is padded to the end with zeros and + * passed to this function. Then *another* block is filled with + * zeros except for the last 16 bytes which contain the length. + * + * Oh... and the algorithm requires that there be at least one + * padding byte. The first padding byte has a value of 0x80, + * and any others are 0x00. + * + * ------------------------------------------------------------------------ ** + */ + { + int round; + int i, j; + uint8_t s; + uint32_t a, b, c, d; + uint32_t KeepABCD[4]; + uint32_t X[16]; + + /* Store the current ABCD values for later re-use. + */ + for( i = 0; i < 4; i++ ) + KeepABCD[i] = ABCD[i]; + + /* Convert the input block into an array of unsigned longs, taking care + * to read the block in Little Endian order (the algorithm assumes this). + * The uint32_t values are then handled in host order. + */ + for( i = 0, j = 0; i < 16; i++ ) + { + X[i] = (uint32_t)block[j++]; + X[i] |= ((uint32_t)block[j++] << 8); + X[i] |= ((uint32_t)block[j++] << 16); + X[i] |= ((uint32_t)block[j++] << 24); + } + + /* This loop performs the four rounds of permutations. + * The rounds are each very similar. The differences are in three areas: + * - The function (F, G, H, or I) used to perform bitwise permutations + * on the registers, + * - The order in which values from X[] are chosen. + * - Changes to the number of bits by which the registers are rotated. + * This implementation uses a switch statement to deal with some of the + * differences between rounds. Other differences are handled by storing + * values in arrays and using the round number to select the correct set + * of values. + * + * (My implementation appears to be a poor compromise between speed, size, + * and clarity. Ugh. [crh]) + */ + for( round = 0; round < 4; round++ ) + { + for( i = 0; i < 16; i++ ) + { + j = (4 - (i % 4)) & 0x3; /* <j> handles the rotation of ABCD. */ + s = S[round][i%4]; /* <s> is the bit shift for this iteration. */ + + b = ABCD[(j+1) & 0x3]; /* Copy the b,c,d values per ABCD rotation. */ + c = ABCD[(j+2) & 0x3]; /* This isn't really necessary, it just looks */ + d = ABCD[(j+3) & 0x3]; /* clean & will hopefully be optimized away. */ + + /* The actual perumation function. + * This is broken out to minimize the code within the switch(). + */ + switch( round ) + { + case 0: + /* round 1 */ + a = md5F( b, c, d ) + X[i]; + break; + case 1: + /* round 2 */ + a = md5G( b, c, d ) + X[ K[0][i] ]; + break; + case 2: + /* round 3 */ + a = md5H( b, c, d ) + X[ K[1][i] ]; + break; + default: + /* round 4 */ + a = md5I( b, c, d ) + X[ K[2][i] ]; + break; + } + a = 0xFFFFFFFF & ( ABCD[j] + a + T[round][i] ); + ABCD[j] = b + (0xFFFFFFFF & (( a << s ) | ( a >> (32 - s) ))); + } + } + + /* Use the stored original A, B, C, D values to perform + * one last convolution. + */ + for( i = 0; i < 4; i++ ) + ABCD[i] = 0xFFFFFFFF & ( ABCD[i] + KeepABCD[i] ); + + } /* Permute */ + + +/* -------------------------------------------------------------------------- ** + * Functions: + */ + +auth_md5Ctx *auth_md5InitCtx( auth_md5Ctx *ctx ) + /* ------------------------------------------------------------------------ ** + * Initialize an MD5 context. + * + * Input: ctx - A pointer to the MD5 context structure to be initialized. + * Contexts are typically created thusly: + * ctx = (auth_md5Ctx *)malloc( sizeof(auth_md5Ctx) ); + * + * Output: A pointer to the initialized context (same as <ctx>). + * + * Notes: The purpose of the context is to make it possible to generate + * an MD5 Message Digest in stages, rather than having to pass a + * single large block to a single MD5 function. The context + * structure keeps track of various bits of state information. + * + * Once the context is initialized, the blocks of message data + * are passed to the <auth_md5SumCtx()> function. Once the + * final bit of data has been handed to <auth_md5SumCtx()> the + * context can be closed out by calling <auth_md5CloseCtx()>, + * which also calculates the final MD5 result. + * + * Don't forget to free an allocated context structure when + * you've finished using it. + * + * See Also: <auth_md5SumCtx()>, <auth_md5CloseCtx()> + * + * ------------------------------------------------------------------------ ** + */ + { + ctx->len = 0; + ctx->b_used = 0; + + ctx->ABCD[0] = 0x67452301; /* The array ABCD[] contains the four 4-byte */ + ctx->ABCD[1] = 0xefcdab89; /* "registers" that are manipulated to */ + ctx->ABCD[2] = 0x98badcfe; /* produce the MD5 digest. The input acts */ + ctx->ABCD[3] = 0x10325476; /* upon the registers, not the other way */ + /* 'round. The initial values are those */ + /* given in RFC 1321 (pg. 4). Note, however, that RFC 1321 */ + /* provides these values as bytes, not as longwords, and the */ + /* bytes are arranged in little-endian order as if they were */ + /* the bytes of (little endian) 32-bit ints. That's */ + /* confusing as all getout (to me, anyway). The values given */ + /* here are provided as 32-bit values in C language format, */ + /* so they are endian-agnostic. */ + return( ctx ); + } /* auth_md5InitCtx */ + + +auth_md5Ctx *auth_md5SumCtx( auth_md5Ctx *ctx, + const unsigned char *src, + const int len ) + /* ------------------------------------------------------------------------ ** + * Build an MD5 Message Digest within the given context. + * + * Input: ctx - Pointer to the context in which the MD5 sum is being + * built. + * src - A chunk of source data. This will be used to drive + * the MD5 algorithm. + * len - The number of bytes in <src>. + * + * Output: A pointer to the updated context (same as <ctx>). + * + * See Also: <auth_md5InitCtx()>, <auth_md5CloseCtx()>, <auth_md5Sum()> + * + * ------------------------------------------------------------------------ ** + */ + { + int i; + + /* Add the new block's length to the total length. + */ + ctx->len += (uint32_t)len; + + /* Copy the new block's data into the context block. + * Call the Permute() function whenever the context block is full. + */ + for( i = 0; i < len; i++ ) + { + ctx->block[ ctx->b_used ] = src[i]; + (ctx->b_used)++; + if( 64 == ctx->b_used ) + { + Permute( ctx->ABCD, ctx->block ); + ctx->b_used = 0; + } + } + + /* Return the updated context. + */ + return( ctx ); + } /* auth_md5SumCtx */ + + +auth_md5Ctx *auth_md5CloseCtx( auth_md5Ctx *ctx, unsigned char *dst ) + /* ------------------------------------------------------------------------ ** + * Close an MD5 Message Digest context and generate the final MD5 sum. + * + * Input: ctx - Pointer to the context in which the MD5 sum is being + * built. + * dst - A pointer to at least 16 bytes of memory, which will + * receive the finished MD5 sum. + * + * Output: A pointer to the closed context (same as <ctx>). + * You might use this to free a malloc'd context structure. :) + * + * Notes: The context (<ctx>) is returned in an undefined state. + * It must be re-initialized before re-use. + * + * See Also: <auth_md5InitCtx()>, <auth_md5SumCtx()> + * + * ------------------------------------------------------------------------ ** + */ + { + int i; + uint32_t l; + + /* Add the required 0x80 padding initiator byte. + * The auth_md5SumCtx() function always permutes and resets the context + * block when it gets full, so we know that there must be at least one + * free byte in the context block. + */ + ctx->block[ctx->b_used] = 0x80; + (ctx->b_used)++; + + /* Zero out any remaining free bytes in the context block. + */ + for( i = ctx->b_used; i < 64; i++ ) + ctx->block[i] = 0; + + /* We need 8 bytes to store the length field. + * If we don't have 8, call Permute() and reset the context block. + */ + if( 56 < ctx->b_used ) + { + Permute( ctx->ABCD, ctx->block ); + for( i = 0; i < 64; i++ ) + ctx->block[i] = 0; + } + + /* Add the total length and perform the final perumation. + * Note: The 60'th byte is read from the *original* <ctx->len> value + * and shifted to the correct position. This neatly avoids + * any MAXINT numeric overflow issues. + */ + l = ctx->len << 3; + for( i = 0; i < 4; i++ ) + ctx->block[56+i] |= GetLongByte( l, i ); + ctx->block[60] = ((GetLongByte( ctx->len, 3 ) & 0xE0) >> 5); /* See Above! */ + Permute( ctx->ABCD, ctx->block ); + + /* Now copy the result into the output buffer and we're done. + */ + for( i = 0; i < 4; i++ ) + { + dst[ 0+i] = GetLongByte( ctx->ABCD[0], i ); + dst[ 4+i] = GetLongByte( ctx->ABCD[1], i ); + dst[ 8+i] = GetLongByte( ctx->ABCD[2], i ); + dst[12+i] = GetLongByte( ctx->ABCD[3], i ); + } + + /* Return the context. + * This is done for compatibility with the other auth_md5*Ctx() functions. + */ + return( ctx ); + } /* auth_md5CloseCtx */ + + +unsigned char * MD5(unsigned char *dst, const unsigned char *src, const int len ) + /* ------------------------------------------------------------------------ ** + * Compute an MD5 message digest. + * + * Input: dst - Destination buffer into which the result will be written. + * Must be 16 bytes, minimum. + * src - Source data block to be MD5'd. + * len - The length, in bytes, of the source block. + * (Note that the length is given in bytes, not bits.) + * + * Output: A pointer to <dst>, which will contain the calculated 16-byte + * MD5 message digest. + * + * Notes: This function is a shortcut. It takes a single input block. + * For more drawn-out operations, see <auth_md5InitCtx()>. + * + * This function is interface-compatible with the + * <auth_md4Sum()> function in the MD4 module. + * + * The MD5 algorithm is designed to work on data with an + * arbitrary *bit* length. Most implementations, this one + * included, handle the input data in byte-sized chunks. + * + * The MD5 algorithm does much of its work using four-byte + * words, and so can be tuned for speed based on the endian-ness + * of the host. This implementation is intended to be + * endian-neutral, which may make it a teeny bit slower than + * others. ...maybe. + * + * See Also: <auth_md5InitCtx()> + * + * ------------------------------------------------------------------------ ** + */ + { + auth_md5Ctx ctx[1]; + + (void)auth_md5InitCtx( ctx ); /* Open a context. */ + (void)auth_md5SumCtx( ctx, src, len ); /* Pass only one block. */ + (void)auth_md5CloseCtx( ctx, dst ); /* Close the context. */ + + return( dst ); /* Makes life easy. */ + } /* auth_md5Sum */ + + + +unsigned char * MD5fromFile(unsigned char *dst, const char *src) + /* ------------------------------------------------------------------------ ** + * Compute an MD5 message digest. + * + * Input: dst - Destination buffer into which the result will be written. + * Must be 16 bytes, minimum. + * src - filepath of the file to be checked + * + * Output: A pointer to <dst>, which will contain the calculated 16-byte + * MD5 message digest. + * + * Notes: This function is a shortcut. It takes a single input block. + * For more drawn-out operations, see <auth_md5InitCtx()>. + * + * This function is interface-compatible with the + * <auth_md4Sum()> function in the MD4 module. + * + * The MD5 algorithm is designed to work on data with an + * arbitrary *bit* length. Most implementations, this one + * included, handle the input data in byte-sized chunks. + * + * The MD5 algorithm does much of its work using four-byte + * words, and so can be tuned for speed based on the endian-ness + * of the host. This implementation is intended to be + * endian-neutral, which may make it a teeny bit slower than + * others. ...maybe. + * + * See Also: <auth_md5InitCtx()> + * + * ------------------------------------------------------------------------ ** + */ + { + auth_md5Ctx ctx[1]; + + FILE * file; + unsigned int blksize = 0; + unsigned int read = 0; + + file = fopen(src, "rb"); + + if (file==NULL){ + return NULL; + } + + (void)auth_md5InitCtx( ctx ); /* Open a context. */ + + fseek (file , 0 , SEEK_END); + unsigned long long filesize = ftell(file); + rewind (file); + + if(filesize < 1048576) //1MB cache for files bigger than 1 MB + blksize = filesize; + else + blksize = 1048576; + + unsigned char * buffer = MEM2_alloc(blksize); + + if(!!buffer) + { + //no memory + SAFE_CLOSE(file); + return NULL; + } + + do + { + read = fread(buffer, 1, blksize, file); + (void)auth_md5SumCtx( ctx, buffer, read ); /* Pass only one block. */ + + } while(read > 0); + + SAFE_CLOSE(file); + SAFE_FREE(buffer); + + (void)auth_md5CloseCtx( ctx, dst ); /* Close the context. */ + + return( dst ); /* Makes life easy. */ + } /* auth_md5Sum */ + + +const char * MD5ToString(const unsigned char * hash, char * dst) +{ + char hexchar[3]; + short i = 0, n = 0; + + for (i = 0; i < 16; i++) + { + sprintf(hexchar, "%02X", hash[i]); + + dst[n++] = hexchar[0]; + dst[n++] = hexchar[1]; + } + + dst[n] = 0x00; + + return dst; +} + +unsigned char * StringToMD5(const char * hash, unsigned char * dst) +{ + char hexchar[2]; + short i = 0, n = 0; + + for (i = 0; i < 16; i++) + { + hexchar[0] = hash[n++]; + hexchar[1] = hash[n++]; + + dst[i] = STR2HEX(hexchar[0]); + dst[i] <<= 4; + dst[i] += STR2HEX(hexchar[1]); + } + + return dst; +} + + +/* ========================================================================== */ diff --git a/source/channel/MD5.h b/source/channel/MD5.h new file mode 100644 index 00000000..33b9fe40 --- /dev/null +++ b/source/channel/MD5.h @@ -0,0 +1,244 @@ +#ifndef MD5_H +#define MD5_H + +#ifdef __cplusplus +extern "C" +{ +#endif +/* ========================================================================== ** + * + * MD5.h + * + * Copyright: + * Copyright (C) 2003-2005 by Christopher R. Hertel + * + * Email: crh@ubiqx.mn.org + * + * $Id: MD5.h,v 0.6 2005/06/08 18:35:59 crh Exp $ + * + * Modifications and additions by dimok + * + * -------------------------------------------------------------------------- ** + * + * Description: + * Implements the MD5 hash algorithm, as described in RFC 1321. + * + * -------------------------------------------------------------------------- ** + * + * License: + * + * This library is free software; you can redistribute it and/or + * modify it under the terms of the GNU Lesser General Public + * License as published by the Free Software Foundation; either + * version 2.1 of the License, or (at your option) any later version. + * + * This library 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 + * Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public + * License along with this library; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + * + * -------------------------------------------------------------------------- ** + * + * Notes: + * + * None of this will make any sense unless you're studying RFC 1321 as you + * read the code. + * + * MD5 is described in RFC 1321. + * The MD*4* algorithm is described in RFC 1320 (that's 1321 - 1). + * MD5 is very similar to MD4, but not quite similar enough to justify + * putting the two into a single module. Besides, I wanted to add a few + * extra functions to this one to expand its usability. + * + * There are three primary motivations for this particular implementation. + * 1) Programmer's pride. I wanted to be able to say I'd done it, and I + * wanted to learn from the experience. + * 2) Portability. I wanted an implementation that I knew to be portable + * to a reasonable number of platforms. In particular, the algorithm is + * designed with little-endian platforms in mind, but I wanted an + * endian-agnostic implementation. + * 3) Compactness. While not an overriding goal, I thought it worth-while + * to see if I could reduce the overall size of the result. This is in + * keeping with my hopes that this library will be suitable for use in + * some embedded environments. + * Beyond that, cleanliness and clarity are always worth pursuing. + * + * As mentioned above, the code really only makes sense if you are familiar + * with the MD5 algorithm or are using RFC 1321 as a guide. This code is + * quirky, however, so you'll want to be reading carefully. + * + * Yeah...most of the comments are cut-and-paste from my MD4 implementation. + * + * -------------------------------------------------------------------------- ** + * + * References: + * IETF RFC 1321: The MD5 Message-Digest Algorithm + * Ron Rivest. IETF, April, 1992 + * + * ========================================================================== ** + */ +/* -------------------------------------------------------------------------- ** + * Typedefs: + */ + +typedef struct + { + unsigned int len; + unsigned int ABCD[4]; + int b_used; + unsigned char block[64]; + } auth_md5Ctx; + + +/* -------------------------------------------------------------------------- ** + * Functions: + */ + +auth_md5Ctx *auth_md5InitCtx( auth_md5Ctx *ctx ); + /* ------------------------------------------------------------------------ ** + * Initialize an MD5 context. + * + * Input: ctx - A pointer to the MD5 context structure to be initialized. + * Contexts are typically created thusly: + * ctx = (auth_md5Ctx *)malloc( sizeof(auth_md5Ctx) ); + * + * Output: A pointer to the initialized context (same as <ctx>). + * + * Notes: The purpose of the context is to make it possible to generate + * an MD5 Message Digest in stages, rather than having to pass a + * single large block to a single MD5 function. The context + * structure keeps track of various bits of state information. + * + * Once the context is initialized, the blocks of message data + * are passed to the <auth_md5SumCtx()> function. Once the + * final bit of data has been handed to <auth_md5SumCtx()> the + * context can be closed out by calling <auth_md5CloseCtx()>, + * which also calculates the final MD5 result. + * + * Don't forget to free an allocated context structure when + * you've finished using it. + * + * See Also: <auth_md5SumCtx()>, <auth_md5CloseCtx()> + * + * ------------------------------------------------------------------------ ** + */ + + +auth_md5Ctx *auth_md5SumCtx( auth_md5Ctx *ctx, const unsigned char *src, const int len ); + /* ------------------------------------------------------------------------ ** + * Build an MD5 Message Digest within the given context. + * + * Input: ctx - Pointer to the context in which the MD5 sum is being + * built. + * src - A chunk of source data. This will be used to drive + * the MD5 algorithm. + * len - The number of bytes in <src>. + * + * Output: A pointer to the updated context (same as <ctx>). + * + * See Also: <auth_md5InitCtx()>, <auth_md5CloseCtx()>, <auth_md5Sum()> + * + * ------------------------------------------------------------------------ ** + */ + + +auth_md5Ctx *auth_md5CloseCtx( auth_md5Ctx *ctx, unsigned char *dst ); + /* ------------------------------------------------------------------------ ** + * Close an MD5 Message Digest context and generate the final MD5 sum. + * + * Input: ctx - Pointer to the context in which the MD5 sum is being + * built. + * dst - A pointer to at least 16 bytes of memory, which will + * receive the finished MD5 sum. + * + * Output: A pointer to the closed context (same as <ctx>). + * You might use this to free a malloc'd context structure. :) + * + * Notes: The context (<ctx>) is returned in an undefined state. + * It must be re-initialized before re-use. + * + * See Also: <auth_md5InitCtx()>, <auth_md5SumCtx()> + * + * ------------------------------------------------------------------------ ** + */ + + +unsigned char * MD5(unsigned char * hash, const unsigned char *src, const int len ); + /* ------------------------------------------------------------------------ ** + * Compute an MD5 message digest. + * + * Input: dst - Destination buffer into which the result will be written. + * Must be 16 bytes, minimum. + * src - Source data block to be MD5'd. + * len - The length, in bytes, of the source block. + * (Note that the length is given in bytes, not bits.) + * + * Output: A pointer to <dst>, which will contain the calculated 16-byte + * MD5 message digest. + * + * Notes: This function is a shortcut. It takes a single input block. + * For more drawn-out operations, see <auth_md5InitCtx()>. + * + * This function is interface-compatible with the + * <auth_md4Sum()> function in the MD4 module. + * + * The MD5 algorithm is designed to work on data with an + * arbitrary *bit* length. Most implementations, this one + * included, handle the input data in byte-sized chunks. + * + * The MD5 algorithm does much of its work using four-byte + * words, and so can be tuned for speed based on the endian-ness + * of the host. This implementation is intended to be + * endian-neutral, which may make it a teeny bit slower than + * others. ...maybe. + * + * See Also: <auth_md5InitCtx()> + * + * ------------------------------------------------------------------------ ** + */ + +unsigned char * MD5fromFile(unsigned char *dst, const char *src); + /* ------------------------------------------------------------------------ ** + * Compute an MD5 message digest. + * + * Input: dst - Destination buffer into which the result will be written. + * Must be 16 bytes, minimum. + * src - filepath to the file to be MD5'd. + * + * Output: A pointer to <dst>, which will contain the calculated 16-byte + * MD5 message digest. + * + * Notes: This function is a shortcut. It takes a single input block. + * For more drawn-out operations, see <auth_md5InitCtx()>. + * + * This function is interface-compatible with the + * <auth_md4Sum()> function in the MD4 module. + * + * The MD5 algorithm is designed to work on data with an + * arbitrary *bit* length. Most implementations, this one + * included, handle the input data in byte-sized chunks. + * + * The MD5 algorithm does much of its work using four-byte + * words, and so can be tuned for speed based on the endian-ness + * of the host. This implementation is intended to be + * endian-neutral, which may make it a teeny bit slower than + * others. ...maybe. + * + * See Also: <auth_md5InitCtx()> + * + * ------------------------------------------------------------------------ ** + */ + +const char * MD5ToString(const unsigned char *hash, char *dst); +unsigned char * StringToMD5(const char * hash, unsigned char * dst); + +/* ========================================================================== */ + +#ifdef __cplusplus +} +#endif +#endif /* AUTH_MD5_H */ diff --git a/source/channel/banner.cpp b/source/channel/banner.cpp new file mode 100644 index 00000000..06ba9c68 --- /dev/null +++ b/source/channel/banner.cpp @@ -0,0 +1,184 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by r-win + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * Banner Handling Class + * + * for wiiflow 2010 + ***************************************************************************/ + +#include <malloc.h> +#include <ogcsys.h> +#include <string.h> +#include <stdio.h> +#include <ogc/conf.h> +#include <ogc/isfs.h> + +#include "memory/smartptr.hpp" +#include "banner.h" +#include "MD5.h" +#include "loader/fs.h" +#include "loader/utils.h" +#include "gecko.h" +#include "U8Archive.h" + +#define IMET_OFFSET 0x40 +#define IMET_SIGNATURE 0x494d4554 + +Banner::Banner(u8 *bnr, u64 title) +{ + this->title = title; + opening = bnr; + imet = NULL; + + if (opening == NULL) return; + + IMET *imet = (IMET *) opening; + if (imet->sig != IMET_SIGNATURE) + { + imet = (IMET *) (opening + IMET_OFFSET); + } + + if (imet->sig == IMET_SIGNATURE) + { + unsigned char md5[16]; + unsigned char imetmd5[16]; + + memcpy(imetmd5, imet->md5, 16); + memset(imet->md5, 0, 16); + + MD5(md5, (unsigned char*)(imet), sizeof(IMET)); + if (memcmp(imetmd5, md5, 16) == 0) + { + this->imet = imet; + } + else + { + gprintf("Invalid md5, banner not valid for title %08x\n", title); + } + } + else + { + gprintf("Invalid signature found, banner not valid for title %08x\n", title); + } +} + +Banner::~Banner() +{ + SAFE_FREE(opening); +} + +bool Banner::IsValid() +{ + return imet != NULL; +} + +u16 *Banner::GetName(int language) +{ + if (imet == NULL) return NULL; + + if (imet->name_japanese[language*IMET_MAX_NAME_LEN] == 0) // Requested language is not found + { + if (imet->name_english[0] == 0) // And the channel name is not available in english + { + return NULL; + } + language = CONF_LANG_ENGLISH; + } + + if (language >= 0) + { + return &imet->name_japanese[language * IMET_MAX_NAME_LEN]; // Return a pointer to the start of the channel name + } + return NULL; +} + +bool Banner::GetName(u8 *name, int language) +{ + if (imet == NULL) return false; + + u16 *channelname = GetName(language); + if (channelname) + { + memcpy(name, channelname, IMET_MAX_NAME_LEN * sizeof(u16)); + return true; + } + return false; +} + +bool Banner::GetName(wchar_t *name, int language) +{ + if (imet == NULL) return false; + + u16 *channelname = GetName(language); + if (channelname) + { + for (int i = 0; i < IMET_MAX_NAME_LEN; i++) + { + name[i] = channelname[i]; + } + return true; + } + return false; +} + +const u8 *Banner::GetFile(char *name, u32 *size) +{ + const u8 *bnrArc = (const u8 *)(((u8 *) imet) + sizeof(IMET)); + return u8_get_file(bnrArc, name, size); +} + +Banner * Banner::GetBanner(u64 title, char *appname, bool isfs, bool imetOnly) +{ + void *buf = NULL; + if (isfs) + { + u32 size = 0; + + buf = ISFS_GetFile((u8 *) appname, &size, imetOnly ? sizeof(IMET) + IMET_OFFSET : 0); + if (size == 0) + { + SAFE_FREE(buf); + return NULL; + } + } + else + { + FILE *fp = fopen(appname, "rb"); + if (fp == NULL) return NULL; + + u32 size = sizeof(IMET) + IMET_OFFSET; + if (!imetOnly) + { + fseek(fp, 0, SEEK_END); + size = ftell(fp); + fseek(fp, 0, SEEK_SET); + } + + buf = malloc(size); + + fread(buf, size, 1, fp); + SAFE_CLOSE(fp); + } + + return new Banner((u8 *) buf, title); +} \ No newline at end of file diff --git a/source/channel/banner.h b/source/channel/banner.h new file mode 100644 index 00000000..ad29b30a --- /dev/null +++ b/source/channel/banner.h @@ -0,0 +1,85 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by r-win + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * Channel Launcher Class + * + * for WiiXplorer 2010 + ***************************************************************************/ + +#ifndef _BANNER_H_ +#define _BANNER_H_ + +#include "safe_vector.hpp" +#include <string> + +#define IMET_MAX_NAME_LEN 0x2a + +typedef struct +{ + u8 zeroes1[0x40]; + u32 sig; // "IMET" + u32 unk1; + u32 unk2; + u32 filesizes[3]; + u32 unk3; + u16 name_japanese[IMET_MAX_NAME_LEN]; + u16 name_english[IMET_MAX_NAME_LEN]; + u16 name_german[IMET_MAX_NAME_LEN]; + u16 name_french[IMET_MAX_NAME_LEN]; + u16 name_spanish[IMET_MAX_NAME_LEN]; + u16 name_italian[IMET_MAX_NAME_LEN]; + u16 name_dutch[IMET_MAX_NAME_LEN]; + u16 name_simp_chinese[IMET_MAX_NAME_LEN]; + u16 name_trad_chinese[IMET_MAX_NAME_LEN]; + u16 name_korean[IMET_MAX_NAME_LEN]; + u8 zeroes2[0x24c]; + u8 md5[0x10]; +} IMET; + +using namespace std; + +class Banner +{ + public: + Banner(u8 *bnr, u64 title = 0); + ~Banner(); + + bool IsValid(); + + bool GetName(u8 *name, int language); + bool GetName(wchar_t *name, int language); + const u8 *GetFile(char *name, u32 *size); + + static Banner *GetBanner(u64 title, char *appname, bool isfs, bool imetOnly = false); + + private: + u8 *opening; + u64 title; + IMET *imet; + + u16 *GetName(int language); + + static bool GetChannelNameFromApp(u64 title, wchar_t* name, int language); +}; + +#endif //_BANNER_H_ diff --git a/source/channel/channel_launcher.c b/source/channel/channel_launcher.c new file mode 100644 index 00000000..803f8ec1 --- /dev/null +++ b/source/channel/channel_launcher.c @@ -0,0 +1,301 @@ +#include "channel_launcher.h" + +#include <stdlib.h> +#include <string.h> +#include <stdio.h> + +#include "disc.h" +#include "patchcode.h" +#include "videopatch.h" +#include "fst.h" +#include "lz77.h" +#include "utils.h" +#include "fs.h" +#include "gecko.h" +#include "mem2.hpp" + +GXRModeObj * __Disc_SelectVMode(u8 videoselected, u64 chantitle); +void PatchCountryStrings(void *Address, int Size); +void __Disc_SetLowMem(void); +void __Disc_SetVMode(void); +void __Disc_SetTime(void); +void _unstub_start(); + +extern void __exception_closeall(); + +typedef void (*entrypoint) (void); + +typedef struct _dolheader{ + u32 section_pos[18]; + u32 section_start[18]; + u32 section_size[18]; + u32 bss_start; + u32 bss_size; + u32 entry_point; + u32 padding[7]; +} __attribute__((packed)) dolheader; + +u32 entryPoint; + +s32 BootChannel(u8 *data, u64 chantitle, u8 vidMode, bool vipatch, bool countryString, u8 patchVidMode) +{ + u32 ios; + Identify(chantitle, &ios); + + entryPoint = LoadChannel(data); + SAFE_FREE(data); + + /* Select an appropriate video mode */ + GXRModeObj * vmode = __Disc_SelectVMode(vidMode, chantitle); + + /* Set time */ + __Disc_SetTime(); + + __Disc_SetLowMem(); + + if (hooktype != 0) + ocarina_do_code(); + + PatchChannel(vidMode, vmode, vipatch, countryString, patchVidMode); + + entrypoint appJump = (entrypoint)entryPoint; + + IOSReloadBlock(IOS_GetVersion()); + + /* Set an appropriate video mode */ + __Disc_SetVMode(); + + // IOS Version Check + *(vu32*)0x80003140 = ((ios << 16)) | 0xFFFF; + *(vu32*)0x80003188 = ((ios << 16)) | 0xFFFF; + DCFlushRange((void *)0x80003140, 32); + DCFlushRange((void *)0x80003188, 32); + + // Game ID Online Check + *(vu32 *)0x80000000 = TITLE_LOWER(chantitle); + *(vu32 *)0x80003180 = TITLE_LOWER(chantitle); + DCFlushRange((void *)0x80000000, 32); + DCFlushRange((void *)0x80003180, 32); + + /* Shutdown IOS subsystems */ + SYS_ResetSystem(SYS_SHUTDOWN, 0, 0); + + gprintf("Jumping to entrypoint %08x\n", entryPoint); + + if (entryPoint != 0x3400) + { + if (hooktype != 0) + { + __asm__( + "lis %r3, entryPoint@h\n" + "ori %r3, %r3, entryPoint@l\n" + "lwz %r3, 0(%r3)\n" + "mtlr %r3\n" + "lis %r3, 0x8000\n" + "ori %r3, %r3, 0x18A8\n" + "mtctr %r3\n" + "bctr\n" + ); + } + else appJump(); + } + else if (hooktype != 0) + { + __asm__( + "lis %r3, returnpoint@h\n" + "ori %r3, %r3, returnpoint@l\n" + "mtlr %r3\n" + "lis %r3, 0x8000\n" + "ori %r3, %r3, 0x18A8\n" + "mtctr %r3\n" + "bctr\n" + "returnpoint:\n" + "bl DCDisable\n" + "bl ICDisable\n" + "li %r3, 0\n" + "mtsrr1 %r3\n" + "lis %r4, entryPoint@h\n" + "ori %r4,%r4,entryPoint@l\n" + "lwz %r4, 0(%r4)\n" + "mtsrr0 %r4\n" + "rfi\n" + ); + } + else _unstub_start(); + + return 0; +} + +void *dolchunkoffset[18]; +u32 dolchunksize[18]; +u32 dolchunkcount; + +u32 LoadChannel(u8 *buffer) +{ + dolchunkcount = 0; + dolheader *dolfile = (dolheader *)buffer; + + if(dolfile->bss_start) + { + ICInvalidateRange((void *)dolfile->bss_start, dolfile->bss_size); + memset((void *)dolfile->bss_start, 0, dolfile->bss_size); + DCFlushRange((void *)dolfile->bss_start, dolfile->bss_size); + } + + int i; + for(i = 0; i < 18; i++) + { + if (!dolfile->section_size[i]) continue; + if (dolfile->section_pos[i] < sizeof(dolheader)) continue; + if(!(dolfile->section_start[i] & 0x80000000)) dolfile->section_start[i] |= 0x80000000; + + dolchunkoffset[dolchunkcount] = (void *)dolfile->section_start[i]; + dolchunksize[dolchunkcount] = dolfile->section_size[i]; + + gprintf("Moving section %u from offset %08x to %08x-%08x...\n", i, dolfile->section_pos[i], dolchunkoffset[dolchunkcount], dolchunkoffset[dolchunkcount]+dolchunksize[dolchunkcount]); + ICInvalidateRange(dolchunkoffset[dolchunkcount], dolchunksize[dolchunkcount]); + memmove (dolchunkoffset[dolchunkcount], buffer + dolfile->section_pos[i], dolchunksize[dolchunkcount]); + DCFlushRange(dolchunkoffset[dolchunkcount], dolchunksize[dolchunkcount]); + + dolchunkcount++; + } + return dolfile->entry_point; +} + +void PatchChannel(u8 vidMode, GXRModeObj *vmode, bool vipatch, bool countryString, u8 patchVidModes) +{ + int i; + bool hookpatched = false; + + for (i=0;i < dolchunkcount;i++) + { + patchVideoModes(dolchunkoffset[i], dolchunksize[i], vidMode, vmode, patchVidModes); + if (vipatch) vidolpatcher(dolchunkoffset[i], dolchunksize[i]); + if (configbytes[0] != 0xCD) langpatcher(dolchunkoffset[i], dolchunksize[i]); + if (countryString) PatchCountryStrings(dolchunkoffset[i], dolchunksize[i]); + + if (hooktype != 0) + if (dogamehooks(dolchunkoffset[i], dolchunksize[i], true)) + hookpatched = true; + } + if (hooktype != 0 && !hookpatched) + { + gprintf("Error: Could not patch the hook\n"); + gprintf("Ocarina and debugger won't work\n"); + } +} + +bool Identify_GenerateTik(signed_blob **outbuf, u32 *outlen) +{ + signed_blob *buffer = (signed_blob *)MEM2_alloc(STD_SIGNED_TIK_SIZE); + if (!buffer) return false; + memset(buffer, 0, STD_SIGNED_TIK_SIZE); + + sig_rsa2048 *signature = (sig_rsa2048 *)buffer; + signature->type = ES_SIG_RSA2048; + + tik *tik_data = (tik *)SIGNATURE_PAYLOAD(buffer); + strcpy(tik_data->issuer, "Root-CA00000001-XS00000003"); + memset(tik_data->cidx_mask, 0xFF, 32); + + *outbuf = buffer; + *outlen = STD_SIGNED_TIK_SIZE; + + return true; +} + +bool Identify(u64 titleid, u32 *ios) +{ + char filepath[ISFS_MAXPATH] ATTRIBUTE_ALIGN(32); + + sprintf(filepath, "/title/%08x/%08x/content/title.tmd", TITLE_UPPER(titleid), TITLE_LOWER(titleid)); + u32 tmdSize; + u8 *tmdBuffer = ISFS_GetFile((u8 *) &filepath, &tmdSize, -1); + if (tmdBuffer == NULL || tmdSize == 0) + { + gprintf("Reading TMD...Failed!\n"); + return false; + } + + *ios = (u32)(tmdBuffer[0x18b]); + + u32 tikSize; + signed_blob *tikBuffer = NULL; + + if(!Identify_GenerateTik(&tikBuffer,&tikSize)) + { + gprintf("Generating fake ticket...Failed!"); + return false; + } + + sprintf(filepath, "/sys/cert.sys"); + u32 certSize; + u8 *certBuffer = ISFS_GetFile((u8 *) &filepath, &certSize, -1); + if (certBuffer == NULL || certSize == 0) + { + gprintf("Reading certs...Failed!\n"); + SAFE_FREE(tmdBuffer); + SAFE_FREE(tikBuffer); + return false; + } + + s32 ret = ES_Identify((signed_blob*)certBuffer, certSize, (signed_blob*)tmdBuffer, tmdSize, tikBuffer, tikSize, NULL); + if (ret < 0) + { + switch(ret) + { + case ES_EINVAL: + gprintf("Error! ES_Identify (ret = %d;) Data invalid!\n", ret); + break; + case ES_EALIGN: + gprintf("Error! ES_Identify (ret = %d;) Data not aligned!\n", ret); + break; + case ES_ENOTINIT: + gprintf("Error! ES_Identify (ret = %d;) ES not initialized!\n", ret); + break; + case ES_ENOMEM: + gprintf("Error! ES_Identify (ret = %d;) No memory!\n", ret); + break; + default: + gprintf("Error! ES_Identify (ret = %d)\n", ret); + break; + } + } + + SAFE_FREE(tmdBuffer); + SAFE_FREE(tikBuffer); + SAFE_FREE(certBuffer); + + return ret < 0 ? false : true; +} + +u8 * GetDol(u64 title, char *id, u32 bootcontent) +{ + char filepath[ISFS_MAXPATH] ATTRIBUTE_ALIGN(32); + sprintf(filepath, "/title/%08x/%08x/content/%08x.app", TITLE_UPPER(title), TITLE_LOWER(title), bootcontent); + + gprintf("Loading DOL: %s...", filepath); + u32 contentSize = 0; + u8 *data = ISFS_GetFile((u8 *) &filepath, &contentSize, -1); + if (data != NULL) + { + gprintf("Done!\n"); + + if (isLZ77compressed(data)) + { + u8 *decompressed; + u32 size = 0; + if (decompressLZ77content(data, contentSize, &decompressed, &size) < 0) + { + gprintf("Decompression failed\n"); + SAFE_FREE(data); + return NULL; + } + SAFE_FREE(data); + data = decompressed; + } + return data; + } + gprintf("Failed!\n"); + return NULL; +} \ No newline at end of file diff --git a/source/channel/channel_launcher.h b/source/channel/channel_launcher.h new file mode 100644 index 00000000..98301dc6 --- /dev/null +++ b/source/channel/channel_launcher.h @@ -0,0 +1,25 @@ +#ifndef _CHAN_LAUNCHER +#define _CHAN_LAUNCHER + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + +#include <gctypes.h> +#include <gccore.h> + +s32 BootChannel(u8 *data, u64 chantitle, u8 vidMode, bool vipatch, bool countryString, u8 patchVidMode); + +u32 LoadChannel(u8 *buffer); +void PatchChannel(u8 vidMode, GXRModeObj *vmode, bool vipatch, bool countryString, u8 patchVidModes); + +u8 * GetDol(u64 title, char *id, u32 bootcontent); + +bool Identify(u64 titleid, u32 *ios); +bool Identify_GenerateTik(signed_blob **outbuf, u32 *outlen); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif /* _CHAN_LAUNCHER */ diff --git a/source/channel/channels.cpp b/source/channel/channels.cpp new file mode 100644 index 00000000..e7dd65b0 --- /dev/null +++ b/source/channel/channels.cpp @@ -0,0 +1,285 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by dude + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * Channel Launcher Class + * + * for WiiXplorer 2010 + ***************************************************************************/ + +#include "mem2.hpp" + +#include <cstdio> +#include <cstdlib> +#include <cstring> + +#include "channels.h" +#include "banner.h" +#include "wstringEx.hpp" +#include "gecko.h" +#include "utils.h" +#include "fs.h" +#include "config.hpp" +#include "text.hpp" + +#include "channel_launcher.h" + +#define DOWNLOADED_CHANNELS 0x00010001 +#define SYSTEM_CHANNELS 0x00010002 +#define RF_NEWS_CHANNEL 0x48414741 +#define RF_FORECAST_CHANNEL 0x48414641 + +extern "C" void ShowError(const wstringEx &error); +#define error(x) //ShowError(x) + +Channels::Channels() +{ +} + +void Channels::Init(u32 channelType, string lang, bool reload) +{ + if (reload) init = !reload; + if (!init || channelType != this->channelType || + lang != this->langCode) + { + this->channelType = channelType; + this->langCode = lang; + + this->channels.clear(); + Search(channelType, lang); + init = true; + } +} + +Channels::~Channels() +{ +} + +u8 * Channels::Load(u64 title, char *id) +{ + char app[ISFS_MAXPATH] ATTRIBUTE_ALIGN(32); + u32 bootcontent; + + if(!GetAppNameFromTmd(title, app, true, &bootcontent)) + return NULL; + + return GetDol(title, id, bootcontent); +} + +u8 Channels::GetRequestedIOS(u64 title) +{ + u8 IOS = 0; + + char tmd[ISFS_MAXPATH] ATTRIBUTE_ALIGN(32); + sprintf(tmd, "/title/%08x/%08x/content/title.tmd", TITLE_UPPER(title), TITLE_LOWER(title)); + + u32 size; + u8 *titleTMD = (u8 *) ISFS_GetFile((u8 *) &tmd, &size, -1); + + if(size > 0x18B) + IOS = titleTMD[0x18B]; + + SAFE_FREE(titleTMD); + + return IOS; +} + +bool Channels::Launch(u8 *data, u64 chantitle, u8 vidMode, bool vipatch, bool countryString, u8 patchVidMode) +{ + return BootChannel(data, chantitle, vidMode, vipatch, countryString, patchVidMode); +} + +u64* Channels::GetChannelList(u32* count) +{ + u32 countall; + if (ES_GetNumTitles(&countall) < 0 || !countall) return NULL; + + u64* titles = (u64*)MEM2_alloc(countall * sizeof(u64)); + if (!titles) return NULL; + + if(ES_GetTitles(titles, countall) < 0) + { + SAFE_FREE(titles); + return NULL; + } + + u64* channels = (u64*)MEM2_alloc(countall * sizeof(u64)); + if (!channels) + { + SAFE_FREE(titles); + return NULL; + } + + *count = 0; + for (u32 i = 0; i < countall; i++) + { + u32 type = TITLE_UPPER(titles[i]); + + if (type == DOWNLOADED_CHANNELS || type == SYSTEM_CHANNELS) + { + if (TITLE_LOWER(titles[i]) == RF_NEWS_CHANNEL || // skip region free news and forecast channel + TITLE_LOWER(titles[i]) == RF_FORECAST_CHANNEL) + continue; + + channels[(*count)++] = titles[i]; + } + } + SAFE_FREE(titles); + + return (u64*)MEM2_realloc(channels, *count * sizeof(u64)); +} + +bool Channels::GetAppNameFromTmd(u64 title, char* app, bool dol, u32* bootcontent) +{ + u32 high = TITLE_UPPER(title); + u32 low = TITLE_LOWER(title); + + bool ret = false; + + char tmd[ISFS_MAXPATH] ATTRIBUTE_ALIGN(32); + sprintf(tmd, "/title/%08x/%08x/content/title.tmd", high, low); + + u32 size; + u8 *data = ISFS_GetFile((u8 *) &tmd, &size, -1); + if (data == NULL || size < 0x208) return ret; + + _tmd * tmd_file = (_tmd *) SIGNATURE_PAYLOAD((u32 *)data); + u16 i; + for(i = 0; i < tmd_file->num_contents; ++i) + if(tmd_file->contents[i].index == (dol ? tmd_file->boot_index : 0)) + { + *bootcontent = tmd_file->contents[i].cid; + sprintf(app, "/title/%08x/%08x/content/%08x.app", high, low, *bootcontent); + ret = true; + break; + } + + SAFE_FREE(data); + + return ret; +} + +Banner * Channels::GetBanner(u64 title, bool imetOnly) +{ + char app[ISFS_MAXPATH] ATTRIBUTE_ALIGN(32); + u32 cid; + if (!GetAppNameFromTmd(title, app, false, &cid)) + { + gprintf("No title found\n"); + return NULL; + } + return Banner::GetBanner(title, app, true, imetOnly); +} + +bool Channels::GetChannelNameFromApp(u64 title, wchar_t* name, int language) +{ + bool ret = false; + + if (language > CONF_LANG_KOREAN) + language = CONF_LANG_ENGLISH; + + Banner *banner = GetBanner(title, true); + if (banner != NULL) + { + ret = banner->GetName(name, language); + delete banner; + banner = NULL; + } + + return ret; +} + +int Channels::GetLanguage(const char *lang) +{ + if (strncmp(lang, "JP", 2) == 0) return CONF_LANG_JAPANESE; + else if (strncmp(lang, "EN", 2) == 0) return CONF_LANG_ENGLISH; + else if (strncmp(lang, "DE", 2) == 0) return CONF_LANG_GERMAN; + else if (strncmp(lang, "FR", 2) == 0) return CONF_LANG_FRENCH; + else if (strncmp(lang, "ES", 2) == 0) return CONF_LANG_SPANISH; + else if (strncmp(lang, "IT", 2) == 0) return CONF_LANG_ITALIAN; + else if (strncmp(lang, "NL", 2) == 0) return CONF_LANG_DUTCH; + else if (strncmp(lang, "ZHTW", 4) == 0) return CONF_LANG_TRAD_CHINESE; + else if (strncmp(lang, "ZH", 2) == 0) return CONF_LANG_SIMP_CHINESE; + else if (strncmp(lang, "KO", 2) == 0) return CONF_LANG_KOREAN; + + return CONF_LANG_ENGLISH; // Default to EN +} + +void Channels::Search(u32 channelType, string lang) +{ + u32 count; + u64* list = GetChannelList(&count); + if (!list) return; + + int language = lang.size() == 0 ? CONF_GetLanguage() : GetLanguage(lang.c_str()); + + for (u32 i = 0; i < count; i++) + { + if (channelType == 0 || channelType == TITLE_UPPER(list[i])) + { + Channel channel; + if (GetChannelNameFromApp(list[i], channel.name, language)) + { + channel.title = list[i]; + + u32 title_h = (u32)channel.title; + sprintf(channel.id, "%c%c%c%c", title_h >> 24, title_h >> 16, title_h >> 8, title_h); + + channels.push_back(channel); + } + } + } + + SAFE_FREE(list); +} + +wchar_t * Channels::GetName(int index) +{ + if (index < 0 || index > Count() - 1) + { + return (wchar_t *) ""; + } + return channels.at(index).name; +} + +int Channels::Count() +{ + return channels.size(); +} + +char * Channels::GetId(int index) +{ + if (index < 0 || index > Count() - 1) return (char *) ""; + return channels.at(index).id; +} + +u64 Channels::GetTitle(int index) +{ + if (index < 0 || index > Count() - 1) return 0; + return channels.at(index).title; +} + +Channel * Channels::GetChannel(int index) +{ + if (index < 0 || index > Count() - 1) return NULL; + return &channels.at(index); +} diff --git a/source/channel/channels.h b/source/channel/channels.h new file mode 100644 index 00000000..14d86aaa --- /dev/null +++ b/source/channel/channels.h @@ -0,0 +1,84 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by dude + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * Channel Launcher Class + * + * for WiiXplorer 2010 + ***************************************************************************/ + +#ifndef _CHANNELS_H_ +#define _CHANNELS_H_ + +#include "safe_vector.hpp" +#include <string> + +#include "smartptr.hpp" +#include "banner.h" + +#define IMET_MAX_NAME_LEN 0x2a + +using namespace std; + +typedef struct +{ + u64 title; + char id[4]; + wchar_t name[IMET_MAX_NAME_LEN+1]; +} Channel; + +class Channels +{ + public: + Channels(); + ~Channels(); + + void Init(u32 channelType, string lang, bool reload = false); + + u8 * Load(u64 title, char* id); + u8 GetRequestedIOS(u64 title); + bool Launch(u8 *data, u64 chantitle, u8 vidMode, bool vipatch, bool countryString, u8 patchVidMode); + + int Count(); + wchar_t *GetName(int index); + char *GetId(int index); + u64 GetTitle(int index); + Channel *GetChannel(int index); + + static Banner * GetBanner(u64 title, bool imetOnly = false); + private: + bool init; + u32 channelType; + string langCode; + + safe_vector<Channel> channels; + + static int GetLanguage(const char *lang); + u64* GetChannelList(u32* count); + static bool GetAppNameFromTmd(u64 title, char* app, bool dol = false, u32* bootcontent = NULL); + static bool GetChannelNameFromApp(u64 title, wchar_t* name, int language); + + void Search(u32 channelType, string lang); + +}; + +#endif diff --git a/source/channel/lz77.c b/source/channel/lz77.c new file mode 100644 index 00000000..c1f9e827 --- /dev/null +++ b/source/channel/lz77.c @@ -0,0 +1,218 @@ +/******************************************************************************* + * lz77.c + * + * Copyright (c) 2009 The Lemon Man + * Copyright (c) 2009 Nicksasa + * Copyright (c) 2009 WiiPower + * + * Distributed under the terms of the GNU General Public License (v2) + * See http://www.gnu.org/licenses/gpl-2.0.txt for more info. + * + * Description: + * ----------- + * + ******************************************************************************/ + +#include <gccore.h> +#include <malloc.h> +#include <stdio.h> +#include <unistd.h> +#include <string.h> + +#include "lz77.h" +#include "mem2.hpp" + +#define ALIGN32(x) (((x) + 31) & ~31) + +u32 packBytes(int a, int b, int c, int d) +{ + return (d << 24) | (c << 16) | (b << 8) | (a); +} + +s32 __decompressLZ77_11(u8 *in, u32 inputLen, u8 **output, u32 *outputLen) +{ + int x, y; + + u8 *out = NULL; + + u32 compressedPos = 0x4; + u32 decompressedPos = 0x0; + u32 decompressedSize = 0; + + decompressedSize = packBytes(in[0], in[1], in[2], in[3]) >> 8; + + if (!decompressedSize) + { + decompressedSize = packBytes(in[4], in[5], in[6], in[7]); + compressedPos += 0x4; + } + + printf("Decompressed size : %i\n", decompressedSize); + + out = MEM2_alloc(ALIGN32(decompressedSize)); + if (out == NULL) + { + printf("Out of memory\n"); + return -1; + } + + while (compressedPos < inputLen && decompressedPos < decompressedSize) + { + u8 byteFlag = in[compressedPos]; + compressedPos++; + + for (x = 7; x >= 0; x--) + { + if ((byteFlag & (1 << x)) > 0) + { + u8 first = in[compressedPos]; + u8 second = in[compressedPos + 1]; + + u32 pos, copyLen; + + if (first < 0x20) + { + u8 third = in[compressedPos + 2]; + + if (first >= 0x10) + { + u32 fourth = in[compressedPos + 3]; + + pos = (u32)(((third & 0xF) << 8) | fourth) + 1; + copyLen = (u32)((second << 4) | ((first & 0xF) << 12) | (third >> 4)) + 273; + + compressedPos += 4; + } else + { + pos = (u32)(((second & 0xF) << 8) | third) + 1; + copyLen = (u32)(((first & 0xF) << 4) | (second >> 4)) + 17; + + compressedPos += 3; + } + } else + { + pos = (u32)(((first & 0xF) << 8) | second) + 1; + copyLen = (u32)(first >> 4) + 1; + + compressedPos += 2; + } + + for (y = 0; y < copyLen; y++) + { + out[decompressedPos + y] = out[decompressedPos - pos + y]; + } + + decompressedPos += copyLen; + } else + { + out[decompressedPos] = in[compressedPos]; + + decompressedPos++; + compressedPos++; + } + + if (compressedPos >= inputLen || decompressedPos >= decompressedSize) + break; + } + } + *output = out; + *outputLen = decompressedSize; + return 0; +} + +s32 __decompressLZ77_10(u8 *in, u32 inputLen, u8 **output, u32 *outputLen) +{ + int x, y; + + u8 *out = NULL; + + u32 compressedPos = 0; + u32 decompressedSize = 0x4; + u32 decompressedPos = 0; + + decompressedSize = packBytes(in[0], in[1], in[2], in[3]) >> 8; + + //int compressionType = (packBytes(in[0], in[1], in[2], in[3]) >> 4) & 0xF; + + printf("Decompressed size : %i\n", decompressedSize); + + out = MEM2_alloc(ALIGN32(decompressedSize)); + if (out == NULL) + { + printf("Out of memory\n"); + return -1; + } + + compressedPos += 0x4; + + while (decompressedPos < decompressedSize) + { + u8 flag = *(u8*)(in + compressedPos); + compressedPos += 1; + + for (x = 0; x < 8; x++) + { + if (flag & 0x80) + { + u8 first = in[compressedPos]; + u8 second = in[compressedPos + 1]; + + u16 pos = (u16)((((first << 8) + second) & 0xFFF) + 1); + u8 copyLen = (u8)(3 + ((first >> 4) & 0xF)); + + for (y = 0; y < copyLen; y++) + { + out[decompressedPos + y] = out[decompressedPos - pos + (y % pos)]; + } + + compressedPos += 2; + decompressedPos += copyLen; + } else + { + out[decompressedPos] = in[compressedPos]; + compressedPos += 1; + decompressedPos += 1; + } + + flag <<= 1; + + if (decompressedPos >= decompressedSize) + break; + } + } + + *output = out; + *outputLen = decompressedSize; + return 0; +} + +int isLZ77compressed(u8 *buffer) +{ + if ((buffer[0] == LZ77_0x10_FLAG) || (buffer[0] == LZ77_0x11_FLAG)) + { + return 1; + } + + return 0; +} + +int decompressLZ77content(u8 *buffer, u32 length, u8 **output, u32 *outputLen) +{ + int ret; + switch (buffer[0]) + { + case LZ77_0x10_FLAG: + printf("LZ77 variant 0x10 compressed content...unpacking may take a while...\n"); + ret = __decompressLZ77_10(buffer, length, output, outputLen); + break; + case LZ77_0x11_FLAG: + printf("LZ77 variant 0x11 compressed content...unpacking may take a while...\n"); + ret = __decompressLZ77_11(buffer, length, output, outputLen); + break; + default: + printf("Not compressed ...\n"); + ret = -1; + break; + } + return ret; +} diff --git a/source/channel/lz77.h b/source/channel/lz77.h new file mode 100644 index 00000000..ebaf0b5e --- /dev/null +++ b/source/channel/lz77.h @@ -0,0 +1,34 @@ +/******************************************************************************* + * lz77.h + * + * Copyright (c) 2009 The Lemon Man + * Copyright (c) 2009 Nicksasa + * Copyright (c) 2009 WiiPower + * + * Distributed under the terms of the GNU General Public License (v2) + * See http://www.gnu.org/licenses/gpl-2.0.txt for more info. + * + * Description: + * ----------- + * + ******************************************************************************/ + +#ifndef _LZ77_MODULE +#define _LZ77_MODULE + +#define LZ77_0x10_FLAG 0x10 +#define LZ77_0x11_FLAG 0x11 + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + +int isLZ77compressed(u8 *buffer); +int decompressLZ77content(u8 *buffer, u32 length, u8 **output, u32 *outputLen); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif + diff --git a/source/channel/nand.cpp b/source/channel/nand.cpp new file mode 100644 index 00000000..1cc347a8 --- /dev/null +++ b/source/channel/nand.cpp @@ -0,0 +1,176 @@ +/*************************************************************************** + * Copyright (C) 2011 + * by Miigotu + * Rewritten code from Mighty Channels and Triiforce + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * Nand/Emulation Handling Class + * + * for wiiflow 2011 + ***************************************************************************/ + +#include <stdio.h> +#include <ogcsys.h> +#include <malloc.h> +#include <string.h> +#include <cstdlib> + +#include "nand.hpp" +#include "utils.h" +#include "gecko.h" +#include "mem2.hpp" + +static NandDevice NandDeviceList[] = { + { "Disable", 0, 0x00, 0x00 }, + { "SD/SDHC Card", 1, 0xF0, 0xF1 }, + { "USB 2.0 Mass Storage Device", 2, 0xF2, 0xF3 }, +}; + +Nand * Nand::instance = NULL; + +Nand * Nand::Instance() +{ + if(instance == NULL) + instance = new Nand(); + return instance; +} + +void Nand::DestroyInstance() +{ + if(instance) delete instance; + instance = NULL; +} + +void Nand::Init(string path, u32 partition, bool disable) +{ + EmuDevice = disable ? REAL_NAND : partition == 0 ? EMU_SD : EMU_USB; + Partition = disable ? REAL_NAND : partition > 0 ? partition - 1 : partition; + Set_NandPath(path); + Disabled = disable; +} + +s32 Nand::Nand_Mount(NandDevice *Device) +{ + s32 fd = IOS_Open("fat", 0); + if (fd < 0) return fd; + + static ioctlv vector[1] ATTRIBUTE_ALIGN(32); + + vector[0].data = &Partition; + vector[0].len = sizeof(u32); + + s32 ret = IOS_Ioctlv(fd, Device->Mount, 1, 0, vector); + IOS_Close(fd); + + return ret; +} + +s32 Nand::Nand_Unmount(NandDevice *Device) +{ + s32 fd = IOS_Open("fat", 0); + if (fd < 0) return fd; + + s32 ret = IOS_Ioctlv(fd, Device->Unmount, 0, 0, NULL); + IOS_Close(fd); + + return ret; +} + +s32 Nand::Nand_Enable(NandDevice *Device) +{ + s32 fd = IOS_Open("/dev/fs", 0); + if (fd < 0) return fd; + + int NandPathlen = strlen(NandPath) + 1; + + static ioctlv vector[2] ATTRIBUTE_ALIGN(32); + + static u32 mode ATTRIBUTE_ALIGN(32) = Device->Mode | FullMode; + + vector[0].data = &mode; + vector[0].len = sizeof(u32); + vector[1].data = NandPath; + vector[1].len = NandPathlen; + + s32 ret = IOS_Ioctlv(fd, 100, 2, 0, vector); + IOS_Close(fd); + + return ret; +} + +s32 Nand::Nand_Disable(void) +{ + s32 fd = IOS_Open("/dev/fs", 0); + if (fd < 0) return fd; + + u32 inbuf ATTRIBUTE_ALIGN(32) = 0; + s32 ret = IOS_Ioctl(fd, 100, &inbuf, sizeof(inbuf), NULL, 0); + IOS_Close(fd); + + return ret; +} + +s32 Nand::Enable_Emu() +{ + if(MountedDevice == EmuDevice || Disabled) + return 0; + + Disable_Emu(); + + NandDevice *Device = &NandDeviceList[EmuDevice]; + + s32 ret = Nand_Mount(Device); + if (ret < 0) return ret; + + ret = Nand_Enable(Device); + if (ret < 0) return ret; + + MountedDevice = EmuDevice; + + return 0; +} + +s32 Nand::Disable_Emu() +{ + if(MountedDevice == 0) + return 0; + + NandDevice * Device = &NandDeviceList[MountedDevice]; + + Nand_Disable(); + Nand_Unmount(Device); + + MountedDevice = 0; + + return 0; +} + +void Nand::Set_NandPath(string path) +{ + if(isalnum(*(path.begin()))) path.insert(path.begin(), '/'); + else *(path.begin()) = '/'; + + if(isalnum(*(path.end()))) path.push_back('/'); + else *(path.end()) = '/'; + + if(path.size() <= 32) + memcpy(NandPath, path.c_str(), path.size()); +} \ No newline at end of file diff --git a/source/channel/nand.hpp b/source/channel/nand.hpp new file mode 100644 index 00000000..a4fd020e --- /dev/null +++ b/source/channel/nand.hpp @@ -0,0 +1,72 @@ +#ifndef _NAND_H_ +#define _NAND_H_ + +#include <gccore.h> +#include <malloc.h> +#include <stdio.h> +#include <unistd.h> +#include <string.h> +#include <iostream> +#include <string> + +#define REAL_NAND 0 +#define EMU_SD 1 +#define EMU_USB 2 + +#define DOWNLOADED_CHANNELS 0x00010001 +#define SYSTEM_CHANNELS 0x00010002 +#define RF_NEWS_CHANNEL 0x48414741 +#define RF_FORECAST_CHANNEL 0x48414641 + +/* 'NAND Device' structure */ +typedef struct nandDevice +{ + const char *Name; + u32 Mode; + u32 Mount; + u32 Unmount; +} NandDevice; + +using namespace std; + +class Nand +{ + public: + static Nand * Instance(); + static void DestroyInstance(); + + /* Prototypes */ + void Init(string path, u32 partition, bool disable = false); + s32 Enable_Emu(); + s32 Disable_Emu(); + + void Set_Partition(u32 partition) { Partition = partition; }; + void Set_FullMode(bool fullmode) { FullMode = fullmode ? 0x100 : 0; }; + + const char * Get_NandPath(void) { return NandPath; }; + u32 Get_Partition(void) { return Partition; }; + + void Set_NandPath(string path); + + private: + Nand() : MountedDevice(0), EmuDevice(REAL_NAND), Disabled(true), Partition(0), FullMode(0x100), NandPath() {} + ~Nand(void){} + + /* Prototypes */ + s32 Nand_Mount(NandDevice *Device); + s32 Nand_Unmount(NandDevice *Device); + s32 Nand_Enable(NandDevice *Device); + s32 Nand_Disable(void); + + u32 MountedDevice; + u32 EmuDevice; + bool Disabled; + + u32 Partition ATTRIBUTE_ALIGN(32); + u32 FullMode ATTRIBUTE_ALIGN(32); + char NandPath[32] ATTRIBUTE_ALIGN(32); + + static Nand * instance; +}; + +#endif diff --git a/source/channel/stub.s b/source/channel/stub.s new file mode 100644 index 00000000..5a8ce915 --- /dev/null +++ b/source/channel/stub.s @@ -0,0 +1,18 @@ +#define STUB 0x3400 + + .text + .section .text + .globl _unstub_start + +_unstub_start: + isync + // set MSR[DR:IR] = 00, jump to STUB + lis 3,STUB@h + ori 3,3,STUB@l + mtsrr0 3 + + mfmsr 3 + li 4,0x30 + andc 3,3,4 + mtsrr1 3 + rfi diff --git a/source/cheats/gct.cpp b/source/cheats/gct.cpp new file mode 100644 index 00000000..97699981 --- /dev/null +++ b/source/cheats/gct.cpp @@ -0,0 +1,363 @@ +#include <iostream> +#include <fstream> +#include <stdlib.h> +#include <string.h> +#include "gct.h" + +#define ERRORRANGE "Error: CheatNr out of range" + +GCTCheats::GCTCheats(void) +{ + Reset(); +} + +GCTCheats::~GCTCheats(void) +{ + string sGameID =""; + string sGameTitle = ""; +} + +unsigned int GCTCheats::getCnt() +{ + return iCntCheats; +} + +string GCTCheats::getGameName(void) +{ + return sGameTitle; +} + +string GCTCheats::getGameID(void) +{ + return sGameID; +} + +string GCTCheats::getCheat(unsigned int nr) +{ + if (nr <= (iCntCheats-1)) + return sCheats[nr]; + return ERRORRANGE; +} + +string GCTCheats::getCheatName(unsigned int nr) +{ + if (nr <= (iCntCheats-1)) + return sCheatName[nr]; + return ERRORRANGE; +} + +string GCTCheats::getCheatComment(unsigned int nr) +{ + if (nr <= (iCntCheats-1)) + return sCheatComment[nr]; + return ERRORRANGE; +} + +int GCTCheats::createGCT(unsigned int nr,const char * filename) +{ + if (nr == 0)return 0; + + ofstream filestr; + filestr.open(filename); + if (filestr.fail()) return 0; + + //Header and Footer + char header[] = { 0x00, 0xd0, 0xc0, 0xde, 0x00, 0xd0, 0xc0, 0xde}; + char footer[] = { 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}; + + string buf = getCheat(nr); + filestr.write(header,sizeof(header)); + + int x = 0; + while (x < (int)buf.size()) + { + string temp = buf.substr(x,2); + long int li = strtol(temp.c_str(),NULL,16); + temp = li; + filestr.write(temp.c_str(),1); + x +=2; + } + filestr.write(footer,sizeof(footer)); + filestr.close(); + + return 1; +} + +int GCTCheats::createGCT(const char * chtbuffer,const char * filename) +{ + ofstream filestr; + filestr.open(filename); + if (filestr.fail()) return 0; + + //Header and Footer + char header[] = { 0x00, 0xd0, 0xc0, 0xde, 0x00, 0xd0, 0xc0, 0xde}; + char footer[] = { 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}; + + string buf = chtbuffer; + filestr.write(header,sizeof(header)); + + int x = 0; + while (x < (int)buf.size()) + { + string temp = buf.substr(x,2); + long int li = strtol(temp.c_str(),NULL,16); + temp = li; + filestr.write(temp.c_str(),1); + x +=2; + } + filestr.write(footer,sizeof(footer)); + filestr.close(); + + return 1; +} + +int GCTCheats::createGCT(int nr[],int cnt,const char * filename) +{ + if (cnt == 0) return 0; + + ofstream filestr; + filestr.open(filename); + if (filestr.fail()) return 0; + + //Header and Footer + char header[] = { 0x00, 0xd0, 0xc0, 0xde, 0x00, 0xd0, 0xc0, 0xde}; + char footer[] = { 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}; + + filestr.write(header,sizeof(header)); + + int c = 0; + while (c != cnt) + { + string buf = getCheat(nr[c]); + + int x = 0; + while (x < (int)buf.size()) + { + string temp = buf.substr(x,2); + long int li = strtol(temp.c_str(),NULL,16); + temp = li; + filestr.write(temp.c_str(),1); + x +=2; + } + c++; + } + filestr.write(footer,sizeof(footer)); + filestr.close(); + + return 1; +} + +//creates gct from internal array +int GCTCheats::createGCT(const char * filename) +{ + ofstream filestr; + filestr.open(filename); + if (filestr.fail()) return 0; + + //Header and Footer + char header[] = { 0x00, 0xd0, 0xc0, 0xde, 0x00, 0xd0, 0xc0, 0xde}; + char footer[] = { 0xF0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}; + + filestr.write(header,sizeof(header)); + + for (unsigned int i=0; i < iCntCheats; ++i) + if (sCheatSelected[i] == true) + { + // cheat is selected, export it + string buf = getCheat(i); + + int x = 0; + while (x < (int)buf.size()) + { + string temp = buf.substr(x,2); + long int li = strtol(temp.c_str(),NULL,16); + temp = li; + filestr.write(temp.c_str(),1); + x +=2; + } + } + filestr.write(footer,sizeof(footer)); + filestr.close(); + + return 1; +} + +//creates txt from internal array +int GCTCheats::createTXT(const char * filename) +{ + + // save gct file + fstream file; + file.open(filename,ios::out); + + file << sGameID << endl; + file << sGameTitle << endl << endl; + + for (unsigned int i=0; i < iCntCheats; ++i) + if (sCheatSelected[i]) + { + file << sCheatName[i] << endl; + for (unsigned int j=0; j+8 < sCheats[i].size(); j+=16) + file << sCheats[i].substr(j,8) << " " << sCheats[i].substr(j+8,8) << endl; + + file << "#selected#" << sCheatComment[i] << endl; + file << endl; + } + + for (unsigned int i=0; i < iCntCheats; ++i) + if (!sCheatSelected[i]) + { + file << sCheatName[i] << endl; + for (unsigned int j=0; j+8 < sCheats[i].size(); j+=16) + file << sCheats[i].substr(j,8) << " " << sCheats[i].substr(j+8,8) << endl; + + if (sCheatComment[i].size() > 1) + file << sCheatComment[i] << endl; + file << endl; + } + + file.close(); + return 1; +} + + +int GCTCheats::openTxtfile(const char * filename) +{ + Reset(); + + ifstream filestr; + filestr.open(filename); + if (filestr.fail()) return 0; + + int i = 0; + string str; + int codestatus; + bool codedynamic = false; // cheat contains X-Codes? + + filestr.seekg(0,ios_base::end); + int size = filestr.tellg(); + if (size <= 0) return -1; + filestr.seekg(0,ios_base::beg); + + getline(filestr,sGameID); + if (sGameID[sGameID.length() - 1] == '\r') + sGameID.erase(sGameID.length() - 1); + + getline(filestr,sGameTitle); + if (sGameTitle[sGameTitle.length() - 1] == '\r') + sGameTitle.erase(sGameTitle.length() - 1); + + getline(filestr,sCheatName[i]); // skip first line if file uses CRLF + if (!sGameTitle[sGameTitle.length() - 1] == '\r') + filestr.seekg(0,ios_base::beg); + + while (!filestr.eof()) { + getline(filestr,sCheatName[i]); // '\n' delimiter by default + if (sCheatName[i][sCheatName[i].length() - 1] == '\r') + sCheatName[i].erase(sCheatName[i].length() - 1); + + string cheatdata; + bool emptyline = false; + + while (!emptyline) + { + getline(filestr,str); + if (str[str.length() - 1] == '\r') + str.erase(str.length() - 1); + + if (str == "" || str[0] == '\r' || str[0] == '\n') + { + emptyline = true; + break; + } + + codestatus = IsCodeEx(str); + if (codestatus == 1) + // line contains X code, so whole cheat is dynamic + codedynamic = true; + + if (codestatus == 2) + { + // remove any garbage (comment) after code + while (str.size() > 17) + str.erase(str.length() - 1); + + cheatdata.append(str); + size_t found=cheatdata.find(' '); + cheatdata.replace(found,1,""); + } + else + sCheatComment[i] = str; + + if (filestr.eof()) break; + + } + + if (!codedynamic && cheatdata.size() > 0) + { + sCheats[i] = cheatdata; + sCheatSelected[i] = false; + // if comment starts with dynamic, it is selected + if (sCheatComment[i].compare(0,10,"#selected#") == 0) + { + sCheatSelected[i] = true; + sCheatComment[i].erase(0,10); + } + i++; + } + else + sCheatComment[i] = ""; + + codedynamic = false; + if (i == MAXCHEATS) break; + } + iCntCheats = i; + filestr.close(); + return 1; +} + +bool GCTCheats::IsCode(const std::string& str) +{ + if (str[8] == ' ' && str.size() >= 17) + { + // accept strings longer than 17 in case there is a comment on the same line as the code + char part1[9]; + char part2[9]; + snprintf(part1,sizeof(part1),"%c%c%c%c%c%c%c%c",str[0],str[1],str[2],str[3],str[4],str[5],str[6],str[7]); + snprintf(part1,sizeof(part2),"%c%c%c%c%c%c%c%c",str[9],str[10],str[11],str[12],str[13],str[14],str[15],str[16]); + if ((strtok(part1,"0123456789ABCDEFabcdef") == NULL) && (strtok(part2,"0123456789ABCDEFabcdef") == NULL)) + return true; + } + return false; +} + + +int GCTCheats::IsCodeEx(const std::string& str) +{ + int status = 2; + if (str[8] == ' ' && str.size() >= 17) + { + // accept strings longer than 17 in case there is a comment on the same line as the code + for (int i = 0; i < 17; ++i) + { + if (!(str[i] == '0' || str[i] == '1' || str[i] == '2' || str[i] == '3' || + str[i] == '4' || str[i] == '5' || str[i] == '6' || str[i] == '7' || + str[i] == '8' || str[i] == '9' || str[i] == 'a' || str[i] == 'b' || + str[i] == 'c' || str[i] == 'd' || str[i] == 'e' || str[i] == 'f' || + str[i] == 'A' || str[i] == 'B' || str[i] == 'C' || str[i] == 'D' || + str[i] == 'E' || str[i] == 'F' || str[i] == 'x' || str[i] == 'X') && i!=8 ) + status = 0; // not even x -> no code + if ((str[i] == 'x' || str[i] == 'X') && i!=8 && status >= 1) + status = 1; + } + return status; + } + return 0; // no code +} + +void GCTCheats::Reset() +{ + iCntCheats = 0; + for (int i=0;i<MAXCHEATS;++i) + sCheatSelected[i] = false; +} \ No newline at end of file diff --git a/source/cheats/gct.h b/source/cheats/gct.h new file mode 100644 index 00000000..2032920d --- /dev/null +++ b/source/cheats/gct.h @@ -0,0 +1,94 @@ +/* + * gct.h + * Class to handle Ocarina TXT Cheatfiles + * + */ + +#ifndef _GCT_H +#define _GCT_H + +#include <sstream> + +#define MAXCHEATS 100 + +using namespace std; + +//!Handles Ocarina TXT Cheatfiles +class GCTCheats { +private: + string sGameID; + string sGameTitle; + string sCheatName[MAXCHEATS]; + string sCheats[MAXCHEATS]; + string sCheatComment[MAXCHEATS]; + unsigned int iCntCheats; + +public: + //!Array which shows which cheat is selected + bool sCheatSelected[MAXCHEATS]; + //!Constructor + GCTCheats(void); + //!Destructor + ~GCTCheats(void); + //!Open txt file with cheats + //!\param filename name of TXT file + //!\return error code + int openTxtfile(const char * filename); + //!Creates GCT file for one cheat + //!\param nr selected Cheat Numbers + //!\param filename name of GCT file + //!\return error code + int createGCT(unsigned int nr,const char * filename); + //!Creates GCT file from a buffer + //!\param chtbuffer buffer that holds the cheat data + //!\param filename name of GCT file + //!\return error code + int createGCT(const char * chtbuffer,const char * filename); + //!Creates GCT file + //!\param nr[] array of selected Cheat Numbers + //!\param cnt size of array + //!\param filename name of GCT file + //!\return error code + int createGCT(int nr[],int cnt,const char * filename); + //!Creates GCT file + //!\param filename name of GCT file + //!\return error code + int createGCT(const char * filename); + //!Creates directly gct in memory + //!\param filename name of TXT file + //!\return GCT buffer + string createGCTbuff(int nr[],int cnt); + //!Creates TXT file + //!\param filename name of GCT file + //!\return error code + int createTXT(const char * filename); + //!Gets Count cheats + //!\return Count cheats + unsigned int getCnt(); + //!Gets Game Name + //!\return Game Name + string getGameName(void); + //!Gets GameID + //!\return GameID + string getGameID(void); + //!Gets cheat data + //!\return cheat data + string getCheat(unsigned int nr); + //!Gets Cheat Name + //!\return Cheat Name + string getCheatName(unsigned int nr); + //!Gets Cheat Comment + //!\return Cheat Comment + string getCheatComment(unsigned int nr); + //!Check if string is a code + //!\return true/false + bool IsCode(const std::string& s); + //!Check if string is a code + //!\return 0=ok, 1="X", 2=no code + int IsCodeEx(const std::string& s); +private: + //!Resets the internal state, as if no file was loaded + void Reset(); +}; + +#endif /* _GCT_H */ \ No newline at end of file diff --git a/source/config/config.cpp b/source/config/config.cpp new file mode 100644 index 00000000..7b6f888b --- /dev/null +++ b/source/config/config.cpp @@ -0,0 +1,525 @@ + +#include <fstream> + +#include "config.hpp" +#include "text.hpp" +#include "DeviceHandler.hpp" +#include "gecko.h" + +using namespace std; + +static const char *g_whitespaces = " \f\n\r\t\v"; +static const int g_floatPrecision = 10; + +const string Config::emptyString; + +Config::Config(void) : + m_loaded(false), m_changed(false), m_domains(), m_filename(), m_iter() +{ +} + +static string trimEnd(string line) +{ + string::size_type i = line.find_last_not_of(g_whitespaces); + if (i == string::npos) line.clear(); + else line.resize(i + 1); + return line; +} + +static string trim(string line) +{ + string::size_type i = line.find_last_not_of(g_whitespaces); + if (i == string::npos) + { + line.clear(); + return line; + } + else + line.resize(i + 1); + i = line.find_first_not_of(g_whitespaces); + if (i > 0) + line.erase(0, i); + return line; +} + +static string unescNewlines(const string &text) +{ + string s; + bool escaping = false; + + s.reserve(text.size()); + for (string::size_type i = 0; i < text.size(); ++i) + { + if (escaping) + { + switch (text[i]) + { + case 'n': + s.push_back('\n'); + break; + default: + s.push_back(text[i]); + } + escaping = false; + } + else if (text[i] == '\\') + escaping = true; + else + s.push_back(text[i]); + } + return s; +} + +static string escNewlines(const string &text) +{ + string s; + + s.reserve(text.size()); + for (string::size_type i = 0; i < text.size(); ++i) + { + switch (text[i]) + { + case '\n': + s.push_back('\\'); + s.push_back('n'); + break; + case '\\': + s.push_back('\\'); + s.push_back('\\'); + break; + default: + s.push_back(text[i]); + } + } + return s; +} + +bool Config::hasDomain(const string &domain) const +{ + return m_domains.find(domain) != m_domains.end(); +} + +void Config::copyDomain(const string &dst, const string &src) +{ + m_domains[dst] = m_domains[src]; +} + +const string &Config::firstDomain(void) +{ + m_iter = m_domains.begin(); + if (m_iter == m_domains.end()) + return Config::emptyString; + return m_iter->first; +} + +const string &Config::nextDomain(void) +{ + ++m_iter; + if (m_iter == m_domains.end()) + return Config::emptyString; + return m_iter->first; +} + +const string &Config::nextDomain(const string &start) const +{ + Config::DomainMap::const_iterator i; + Config::DomainMap::const_iterator j; + if (m_domains.empty()) + return Config::emptyString; + i = m_domains.find(start); + if (i == m_domains.end()) + return m_domains.begin()->first; + j = i; + ++j; + return j != m_domains.end() ? j->first : i->first; +} + +const string &Config::prevDomain(const string &start) const +{ + Config::DomainMap::const_iterator i; + if (m_domains.empty()) + return Config::emptyString; + i = m_domains.find(start); + if (i == m_domains.end() || i == m_domains.begin()) + return m_domains.begin()->first; + --i; + return i->first; +} + +bool Config::load(const char *filename) +{ + if (m_loaded && m_changed) save(); + + ifstream file(filename, ios::in | ios::binary); + string line; + string domain(""); + + m_changed = false; + m_loaded = false; + m_filename = filename; + u32 n = 0; + if (!file.is_open()) return m_loaded; + m_domains.clear(); + while (file.good()) + { + line.clear(); + getline(file, line, '\n'); + ++n; + if (!file.bad() && !file.fail()) + { + line = trimEnd(line); + if (line.empty() || line[0] == '#') continue; + if (line[0] == '[') + { + string::size_type i = line.find_first_of(']'); + if (i != string::npos && i > 1) + { + domain = upperCase(line.substr(1, i - 1)); + if (m_domains.find(domain) != m_domains.end()) + domain.clear(); + } + } + else + if (!domain.empty()) + { + string::size_type i = line.find_first_of('='); + if (i != string::npos && i > 0) + m_domains[domain][lowerCase(trim(line.substr(0, i)))] = unescNewlines(trim(line.substr(i + 1))); + } + } + } + m_loaded = true; + return m_loaded; +} + +void Config::unload(void) +{ + m_loaded = false; + m_changed = false; + m_filename = emptyString; + m_domains.clear(); +} + +void Config::save(bool unload) +{ + if (m_changed) + { + ofstream file(m_filename.c_str(), ios::out | ios::binary); + for (Config::DomainMap::iterator k = m_domains.begin(); k != m_domains.end(); ++k) + { + Config::KeyMap *m = &k->second; + file << '\n' << '[' << k->first << ']' << '\n'; + for (Config::KeyMap::iterator l = m->begin(); l != m->end(); ++l) + file << l->first << '=' << escNewlines(l->second) << '\n'; + } + m_changed = false; + } + if(unload) this->unload(); +} + +bool Config::has(const std::string &domain, const std::string &key) const +{ + if (domain.empty() || key.empty()) return false; + DomainMap::const_iterator i = m_domains.find(upperCase(domain)); + if (i == m_domains.end()) return false; + return i->second.find(lowerCase(key)) != i->second.end(); +} + +void Config::setWString(const string &domain, const string &key, const wstringEx &val) +{ + if (domain.empty() || key.empty()) return; + m_changed = true; + m_domains[upperCase(domain)][lowerCase(key)] = val.toUTF8(); +} + +void Config::setString(const string &domain, const string &key, const string &val) +{ + if (domain.empty() || key.empty()) return; + m_changed = true; + m_domains[upperCase(domain)][lowerCase(key)] = val; +} + +void Config::setBool(const string &domain, const string &key, bool val) +{ + if (domain.empty() || key.empty()) return; + m_changed = true; + m_domains[upperCase(domain)][lowerCase(key)] = val ? "yes" : "no"; +} + +void Config::remove(const string &domain, const string &key) +{ + if (domain.empty() || key.empty()) return; + m_changed = true; + m_domains[upperCase(domain)].erase(lowerCase(key)); +} + +void Config::setOptBool(const string &domain, const string &key, int val) +{ + if (domain.empty() || key.empty()) return; + m_changed = true; + switch (val) + { + case 0: + m_domains[upperCase(domain)][lowerCase(key)] = "no"; + break; + case 1: + m_domains[upperCase(domain)][lowerCase(key)] = "yes"; + break; + default: + m_domains[upperCase(domain)][lowerCase(key)] = "default"; + } +} + +void Config::setInt(const string &domain, const string &key, int val) +{ + if (domain.empty() || key.empty()) return; + m_changed = true; + m_domains[upperCase(domain)][lowerCase(key)] = sfmt("%i", val); +} + +void Config::setUInt(const std::string &domain, const std::string &key, unsigned int val) +{ + if (domain.empty() || key.empty()) return; + m_changed = true; + m_domains[upperCase(domain)][lowerCase(key)] = sfmt("%u", val); +} + +void Config::setFloat(const string &domain, const string &key, float val) +{ + if (domain.empty() || key.empty()) return; + m_changed = true; + m_domains[upperCase(domain)][lowerCase(key)] = sfmt("%.*g", g_floatPrecision, val); +} + +void Config::setVector3D(const std::string &domain, const std::string &key, const Vector3D &val) +{ + if (domain.empty() || key.empty()) return; + m_changed = true; + m_domains[upperCase(domain)][lowerCase(key)] = sfmt("%.*g, %.*g, %.*g", g_floatPrecision, val.x, g_floatPrecision, val.y, g_floatPrecision, val.z); +} + +void Config::setColor(const std::string &domain, const std::string &key, const CColor &val) +{ + if (domain.empty() || key.empty()) return; + m_changed = true; + m_domains[upperCase(domain)][lowerCase(key)] = sfmt("#%.2X%.2X%.2X%.2X", val.r, val.g, val.b, val.a); +} + +wstringEx Config::getWString(const string &domain, const string &key, const wstringEx &defVal) +{ + if (domain.empty() || key.empty()) return defVal; + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + if (data.empty()) + { + data = defVal.toUTF8(); + m_changed = true; + return defVal; + } + wstringEx ws; + ws.fromUTF8(data.c_str()); + return ws; +} + +string Config::getString(const string &domain, const string &key, const string &defVal) +{ + if (domain.empty() || key.empty()) return defVal; + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + if (data.empty() || strncasecmp(data.c_str(), "usb:", 4) == 0) + { + data = defVal; + m_changed = true; + } + return data; +} + +safe_vector<string> Config::getStrings(const string &domain, const string &key, char seperator, const string &defVal) +{ + safe_vector<string> retval; + + if (domain.empty() || key.empty()) + { + if (defVal != std::string()) + retval.push_back(defVal); + return retval; + } + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + if (data.empty()) + { + if (defVal != std::string()) + retval.push_back(defVal); + return retval; + } + // Parse the string into different substrings + + // skip delimiters at beginning. + string::size_type lastPos = data.find_first_not_of(seperator, 0); + + // find first "non-delimiter". + string::size_type pos = data.find_first_of(seperator, lastPos); + + while (string::npos != pos || string::npos != lastPos) + { + // found a token, add it to the vector. + retval.push_back(data.substr(lastPos, pos - lastPos)); + + // skip delimiters. Note the "not_of" + lastPos = data.find_first_not_of(seperator, pos); + + // find next "non-delimiter" + pos = data.find_first_of(seperator, lastPos); + } + + return retval; +} + +bool Config::getBool(const string &domain, const string &key, bool defVal) +{ + if (domain.empty() || key.empty()) return defVal; + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + if (data.empty()) + { + data = defVal ? "yes" : "no"; + m_changed = true; + return defVal; + } + string s(lowerCase(trim(data))); + if (s == "yes" || s == "true" || s == "y" || s == "1") + return true; + return false; +} + +bool Config::testOptBool(const string &domain, const string &key, bool defVal) +{ + if (domain.empty() || key.empty()) return defVal; + KeyMap &km = m_domains[upperCase(domain)]; + KeyMap::iterator i = km.find(lowerCase(key)); + if (i == km.end()) return defVal; + string s(lowerCase(trim(i->second))); + if (s == "yes" || s == "true" || s == "y" || s == "1") + return true; + if (s == "no" || s == "false" || s == "n" || s == "0") + return false; + return defVal; +} + +int Config::getOptBool(const string &domain, const string &key, int defVal) +{ + if (domain.empty() || key.empty()) return defVal; + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + if (data.empty()) + { + switch (defVal) + { + case 0: + data = "no"; + break; + case 1: + data = "yes"; + break; + default: + data = "default"; + } + m_changed = true; + return defVal; + } + string s(lowerCase(trim(data))); + if (s == "yes" || s == "true" || s == "y" || s == "1") + return 1; + if (s == "no" || s == "false" || s == "n" || s == "0") + return 0; + return 2; +} + +int Config::getInt(const string &domain, const string &key, int defVal) +{ + if (domain.empty() || key.empty()) return defVal; + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + if (data.empty()) + { + data = sfmt("%i", defVal); + m_changed = true; + return defVal; + } + return strtol(data.c_str(), 0, 10); +} + +bool Config::getInt(const std::string &domain, const std::string &key, int *value) +{ + if (domain.empty() || key.empty()) return false; + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + if (data.empty()) return false; + *value = strtol(data.c_str(), 0, 10); + return true; +} + +unsigned int Config::getUInt(const string &domain, const string &key, unsigned int defVal) +{ + if (domain.empty() || key.empty()) return defVal; + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + if (data.empty()) + { + data = sfmt("%u", defVal); + m_changed = true; + return defVal; + } + return strtoul(data.c_str(), 0, 10); +} + +float Config::getFloat(const string &domain, const string &key, float defVal) +{ + if (domain.empty() || key.empty()) return defVal; + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + if (data.empty()) + { + data = sfmt("%.*g", g_floatPrecision, defVal); + m_changed = true; + return defVal; + } + return strtod(data.c_str(), 0); +} + +Vector3D Config::getVector3D(const std::string &domain, const std::string &key, const Vector3D &defVal) +{ + if (domain.empty() || key.empty()) return defVal; + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + string::size_type i; + string::size_type j = string::npos; + i = data.find_first_of(','); + if (i != string::npos) j = data.find_first_of(',', i + 1); + if (j == string::npos) + { + data = sfmt("%.*g, %.*g, %.*g", g_floatPrecision, defVal.x, g_floatPrecision, defVal.y, g_floatPrecision, defVal.z); + m_changed = true; + return defVal; + } + return Vector3D(strtod(data.substr(0, i).c_str(), 0), strtod(data.substr(i + 1, j - i - 1).c_str(), 0), strtod(data.substr(j + 1).c_str(), 0)); +} + +CColor Config::getColor(const std::string &domain, const std::string &key, const CColor &defVal) +{ + if (domain.empty() || key.empty()) return defVal; + string &data = m_domains[upperCase(domain)][lowerCase(key)]; + string text(upperCase(trim(data))); + u32 i = (u32)text.find_first_of('#'); + if (i != string::npos) + { + text.erase(0, i + 1); + i = (u32)text.find_first_not_of("0123456789ABCDEF"); + if ((i != string::npos && i >= 6) || (i == string::npos && text.size() >= 6)) + { + u32 n = ((i != string::npos && i >= 8) || (i == string::npos && text.size() >= 8)) ? 8 : 6; + for (i = 0; i < n; ++i) + if (text[i] <= '9') + text[i] -= '0'; + else + text[i] -= 'A' - 10; + CColor c(text[0] * 0x10 + text[1], text[2] * 0x10 + text[3], text[4] * 0x10 + text[5], 1.f); + if (n == 8) + c.a = text[6] * 0x10 + text[7]; + return c; + } + } + data = sfmt("#%.2X%.2X%.2X%.2X", defVal.r, defVal.g, defVal.b, defVal.a); + m_changed = true; + return defVal; +} \ No newline at end of file diff --git a/source/config/config.hpp b/source/config/config.hpp new file mode 100644 index 00000000..b41f2af6 --- /dev/null +++ b/source/config/config.hpp @@ -0,0 +1,73 @@ + +#ifndef __CONFIG_HPP +#define __CONFIG_HPP + +#include <map> +#include <string> +#include "safe_vector.hpp" + +#include "video.hpp" +#include "smartptr.hpp" +#include "wstringEx.hpp" + +class CColor; +class Vector3D; + +class Config +{ +public: + Config(void); + void clear(void) { m_domains.clear(); } + bool load(const char *filename = 0); + void unload(void); + void save(bool unload = false); + bool loaded(void) const { return m_loaded; } + bool has(const std::string &domain, const std::string &key) const; + // Set + void setWString(const std::string &domain, const std::string &key, const wstringEx &val); + void setString(const std::string &domain, const std::string &key, const std::string &val); + void setBool(const std::string &domain, const std::string &key, bool val); + void setOptBool(const std::string &domain, const std::string &key, int val); + void setInt(const std::string &domain, const std::string &key, int val); + void setUInt(const std::string &domain, const std::string &key, unsigned int val); + void setFloat(const std::string &domain, const std::string &key, float val); + void setVector3D(const std::string &domain, const std::string &key, const Vector3D &val); + void setColor(const std::string &domain, const std::string &key, const CColor &val); + // Get + wstringEx getWString(const std::string &domain, const std::string &key, const wstringEx &defVal = wstringEx()); + std::string getString(const std::string &domain, const std::string &key, const std::string &defVal = std::string()); + safe_vector<std::string> getStrings(const std::string &domain, const std::string &key, char seperator = ',', const std::string &defval = std::string()); + bool getBool(const std::string &domain, const std::string &key, bool defVal = false); + int getOptBool(const std::string &domain, const std::string &key, int defVal = 2); + bool testOptBool(const std::string &domain, const std::string &key, bool defVal); + int getInt(const std::string &domain, const std::string &key, int defVal = 0); + bool getInt(const std::string &domain, const std::string &key, int *value); + unsigned int getUInt(const std::string &domain, const std::string &key, unsigned int defVal = 0); + float getFloat(const std::string &domain, const std::string &key, float defVal = 0.f); + Vector3D getVector3D(const std::string &domain, const std::string &key, const Vector3D &defVal = Vector3D()); + CColor getColor(const std::string &domain, const std::string &key, const CColor &defVal = CColor()); + // Remove + void remove(const std::string &domain, const std::string &key); + // + const std::string &firstDomain(void); + const std::string &nextDomain(void); + const std::string &nextDomain(const std::string &start) const; + const std::string &prevDomain(const std::string &start) const; + bool hasDomain(const std::string &domain) const; + void copyDomain(const std::string &dst, const std::string &src); +private: + typedef std::map<std::string, std::string> KeyMap; + typedef std::map<std::string, KeyMap> DomainMap; +private: + bool m_loaded; + bool m_changed; + DomainMap m_domains; + std::string m_filename; + DomainMap::iterator m_iter; + static const std::string emptyString; +private: + Config(const Config &); + Config &operator=(const Config &); +}; + +#endif // !defined(__CONFIG_HPP) diff --git a/source/defines.h b/source/defines.h new file mode 100644 index 00000000..0146a77d --- /dev/null +++ b/source/defines.h @@ -0,0 +1,31 @@ +#define APP_NAME "WiiFlow" +#define APP_VERSION "3.0 ALPHA" + +#define APPDATA_DIR "wiiflow" +#define APPDATA_DIR2 "apps/wiiflow" + +#define GAMES_DIR "%s:/wbfs" +#define HOMEBREW_DIR "%s:/apps" + +#define CFG_FILENAME "wiiflow.ini" +#define LANG_FILENAME "languages.ini" +#define CAT_FILENAME "categories.ini" +#define TITLES_FILENAME "titles.ini" +#define CTITLES_FILENAME "custom_titles.ini" + +#define DEVELOPERS "r-win, Miigotu, OverjoY" +#define PAST_DEVELOPERS "Hibernatus, Narolez, Hulk" +#define LOADER_AUTHOR "Kwiirk, Waninkoko, Hermes" +#define GUI_AUTHOR "Hibernatus" + +#define THANKS \ +"Lustar, CedWii, Benjay, Domi78, Oops, Celtiore, Jiiwah, FluffyKiwi, Roku93, \ +Spayrosam, Bluescreen81, Chappy23, BlindDude, Bubba, DJTaz, OggZee, Usptactical, \ +WiiPower, Hermes, Spidy1000, Dimok, Kovani, Drexyl, DvZ, Etheboss, FIX94, GaiaKnight, \ +nibb, NJ7, Plasma, Pakatus, ravmn, spidercaleb, Ziggy34, And to anyone who has donated or contributed to Wiiflow that we missed!" + +#define THANKS_SITES "devkitpro.org, wiibrew.org, gametdb.com, ohloh.net, wiifanart.com, wiiflowiki.com, tgames.fr.nf" +#define THANKS_CODE "CFG Loader, uLoader, USB Loader GX, NeoGamma, WiiXplorer, Triiforce, Mighty Channels" + +#define WIINNERTAG_URL "http://www.wiinnertag.com/wiinnertag_scripts/update_sign.php?key={KEY}&game_id={ID6}" +#define DUTAG_URL "http://tag.darkumbra.net/{KEY}.update={ID6}" \ No newline at end of file diff --git a/source/devicemounter/DeviceHandler.cpp b/source/devicemounter/DeviceHandler.cpp new file mode 100644 index 00000000..a36705e7 --- /dev/null +++ b/source/devicemounter/DeviceHandler.cpp @@ -0,0 +1,332 @@ +/**************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include <malloc.h> +#include <unistd.h> +#include <string.h> +#include <ogc/mutex.h> +#include <ogc/system.h> +#include <sdcard/gcsd.h> + +#include "DeviceHandler.hpp" +#include "wbfs.h" +#include "usbstorage.h" + +extern const DISC_INTERFACE __io_sdhc; + +DeviceHandler * DeviceHandler::instance = NULL; +unsigned int DeviceHandler::watchdog_timeout = 10; + +DeviceHandler::~DeviceHandler() +{ + UnMountAll(); +} + +DeviceHandler * DeviceHandler::Instance() +{ + if (instance == NULL) + instance = new DeviceHandler(); + + return instance; +} + +void DeviceHandler::DestroyInstance() +{ + if(instance) delete instance; + instance = NULL; +} + +bool DeviceHandler::MountAll() +{ + bool result = false; + + for(u32 i = SD; i <= USB8; i++) + if(Mount(i)) result = true; + + return result; +} + +void DeviceHandler::UnMountAll() +{ + for(u32 i = SD; i <= GCSDB; i++) + UnMount(i); + + if(sd) delete sd; + if(usb) delete usb; + if(gca) delete gca; + if(gcb) delete gca; + + sd = NULL; + usb = NULL; + gca = NULL; + gcb = NULL; +} + +bool DeviceHandler::Mount(int dev) +{ + if(dev == SD) + return MountSD(); + else if(dev >= USB1 && dev <= USB8) + return MountUSB(dev-USB1); + else if(dev == GCSDA) + return MountGCA(); + else if(dev == GCSDB) + return MountGCB(); + + return false; +} + +bool DeviceHandler::IsInserted(int dev) +{ + if(dev == SD) + return SD_Inserted() && sd->IsMounted(0); + else if(dev >= USB1 && dev <= USB8) + return USB_Inserted() && usb->IsMounted(dev-USB1); + else if(dev == GCSDA) + return GCA_Inserted() && gca->IsMounted(0); + else if(dev == GCSDB) + return GCB_Inserted() && gcb->IsMounted(0); + + return false; +} + +void DeviceHandler::UnMount(int dev) +{ + if(dev == SD) + UnMountSD(); + else if(dev >= USB1 && dev <= USB8) + UnMountUSB(dev-USB1); + else if(dev == GCSDA) + UnMountGCA(); + else if(dev == GCSDB) + UnMountGCB(); +} + +bool DeviceHandler::MountSD() +{ + if(!sd) + { + sd = new PartitionHandle(&__io_sdhc); + if(sd->GetPartitionCount() < 1) + { + delete sd; + sd = NULL; + return false; + } + } + + //! Mount only one SD Partition + return sd->Mount(0, DeviceName[SD]); +} + +bool DeviceHandler::MountUSB(int pos) +{ + if(!usb) usb = new PartitionHandle(&__io_usbstorage); + + if(usb->GetPartitionCount() < 1) + { + delete usb; + usb = NULL; + return false; + } + + // Set the watchdog + InternalSetWatchdog(watchdog_timeout); + + if(pos >= usb->GetPartitionCount()) + return false; + + return usb->Mount(pos, DeviceName[USB1+pos]); +} + +bool DeviceHandler::MountAllUSB() +{ + if(!usb) usb = new PartitionHandle(&__io_usbstorage); + + bool result = false; + + for(int i = 0; i < usb->GetPartitionCount(); i++) + if(MountUSB(i)) + result = true; + + return result; +} + +bool DeviceHandler::MountGCA() +{ + if(!gca) gca = new PartitionHandle(&__io_gcsda); + + if(gca->GetPartitionCount() < 1) + { + delete gca; + gca = NULL; + return false; + } + + //! Mount only one Partition + return gca->Mount(0, DeviceName[GCSDA]); +} + +bool DeviceHandler::MountGCB() +{ + if(!gcb) gcb = new PartitionHandle(&__io_gcsdb); + + if(gcb->GetPartitionCount() < 1) + { + delete gcb; + gcb = NULL; + return false; + } + + //! Mount only one Partition + return gcb->Mount(0, DeviceName[GCSDB]);; +} + +void DeviceHandler::UnMountUSB(int pos) +{ + if(!usb) return; + + if(pos >= usb->GetPartitionCount()) + return; + + usb->UnMount(pos); +} + +void DeviceHandler::UnMountAllUSB() +{ + if(!usb) return; + + for(int i = 0; i < usb->GetPartitionCount(); i++) + usb->UnMount(i); + + delete usb; + usb = NULL; +} + +bool DeviceHandler::InternalSetWatchdog(unsigned int timeout) +{ + if (Instance()->USB_Inserted()) + return USBStorage_SetWatchdog(timeout) == 0; + + return false; +} + +bool DeviceHandler::SetWatchdog(unsigned int timeout) +{ + watchdog_timeout = timeout; + return InternalSetWatchdog(timeout); +} + +int DeviceHandler::PathToDriveType(const char * path) +{ + if(!path) return -1; + + for(int i = SD; i <= GCSDB; i++) + if(strncmp(path, DeviceName[i], strlen(DeviceName[i])) == 0) + return i; + + return -1; +} + +const char * DeviceHandler::GetFSName(int dev) +{ + if(dev == SD && DeviceHandler::instance->sd) + return DeviceHandler::instance->sd->GetFSName(0); + else if(dev >= USB1 && dev <= USB8 && DeviceHandler::instance->usb) + return DeviceHandler::instance->usb->GetFSName(dev-USB1); + else if(dev == GCSDA && DeviceHandler::instance->gca) + return DeviceHandler::instance->gca->GetFSName(0); + else if(dev == GCSDB && DeviceHandler::instance->gcb) + return DeviceHandler::instance->gcb->GetFSName(0); + + return NULL; +} + +int DeviceHandler::GetFSType(int dev) +{ + const char *name = GetFSName(dev); + if(!name) return -1; + + if (strncasecmp(name, "WBFS", 4) == 0) + return PART_FS_WBFS; + else if (strncasecmp(name, "FAT", 3) == 0) + return PART_FS_FAT; + else if (strncasecmp(name, "NTFS", 4) == 0) + return PART_FS_NTFS; + else if (strncasecmp(name, "LINUX", 5) == 0) + return PART_FS_EXT; + + return -1; +} + +s16 DeviceHandler::GetMountedCount(int dev) +{ + if(dev == SD && DeviceHandler::instance->sd && IsInserted(SD)) + return 1; + else if(dev >= USB1 && dev <= USB8 && DeviceHandler::instance->usb) + for(int i = 0; i < usb->GetPartitionCount(); i++) + { + if(!IsInserted(i)) return i; + } + else if(dev == GCSDA && DeviceHandler::instance->gca && IsInserted(GCSDA)) + return 1; + else if(dev == GCSDB && DeviceHandler::instance->gcb && IsInserted(GCSDB)) + return 1; + + return -1; +} + +wbfs_t * DeviceHandler::GetWbfsHandle(int dev) +{ + if(dev == SD && DeviceHandler::instance->sd) + return DeviceHandler::instance->sd->GetWbfsHandle(0); + else if(dev >= USB1 && dev <= USB8 && DeviceHandler::instance->usb) + return DeviceHandler::instance->usb->GetWbfsHandle(dev-USB1); + else if(dev == GCSDA && DeviceHandler::instance->gca) + return DeviceHandler::instance->gca->GetWbfsHandle(0); + else if(dev == GCSDB && DeviceHandler::instance->gcb) + return DeviceHandler::instance->gcb->GetWbfsHandle(0); + + return NULL; +} + +s32 DeviceHandler::Open_WBFS(int dev) +{ + u32 part_lba; + u32 part_fs = GetFSType(dev); + char *partition = (char *)DeviceName[dev]; + + if(dev == SD && IsInserted(dev)) + part_lba = Instance()->sd->GetLBAStart(dev); + else if(dev >= USB1 && dev <= USB8 && IsInserted(dev)) + part_lba = Instance()->usb->GetLBAStart(dev - USB1); + else if(dev == GCSDA && IsInserted(dev)) + part_lba = Instance()->gca->GetLBAStart(dev); + else if(dev == GCSDB && IsInserted(dev)) + part_lba = Instance()->gcb->GetLBAStart(dev); + else return -1; + + return WBFS_Init(GetWbfsHandle(dev), part_fs, part_lba, partition, dev); +} \ No newline at end of file diff --git a/source/devicemounter/DeviceHandler.hpp b/source/devicemounter/DeviceHandler.hpp new file mode 100644 index 00000000..0e9ef862 --- /dev/null +++ b/source/devicemounter/DeviceHandler.hpp @@ -0,0 +1,121 @@ +/**************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#ifndef DEVICE_HANDLER_HPP_ +#define DEVICE_HANDLER_HPP_ + +#include "PartitionHandle.h" + +enum +{ + SD = 0, + USB1, + USB2, + USB3, + USB4, + USB5, + USB6, + USB7, + USB8, + GCSDA, + GCSDB, + MAXDEVICES +}; + +const char DeviceName[MAXDEVICES][6] = +{ + "sd", + "usb1", + "usb2", + "usb3", + "usb4", + "usb5", + "usb6", + "usb7", + "usb8", + "gca", + "gcb", +}; + +class DeviceHandler +{ + public: + static DeviceHandler * Instance(); + static void DestroyInstance(); + + bool MountAll(); + void UnMountAll(); + bool Mount(int dev); + bool IsInserted(int dev); + void UnMount(int dev); + + //! Individual Mounts/UnMounts... + bool MountSD(); + bool MountUSB(int part); + bool MountAllUSB(); + bool MountGCA(); + bool MountGCB(); + + bool SD_Inserted() { if(sd) return sd->IsInserted(); return false; }; + bool USB_Inserted() { if(usb) return usb->IsInserted(); return false; }; + bool GCA_Inserted() { if(gca) return gca->IsInserted(); return false; }; + bool GCB_Inserted() { if(gcb) return gcb->IsInserted(); return false; }; + + void UnMountSD() { if(sd) delete sd; sd = NULL; }; + void UnMountUSB(int pos); + void UnMountAllUSB(); + void UnMountGCA() { if(gca) delete gca; gca = NULL; }; + void UnMountGCB() { if(gcb) delete gcb; gcb = NULL; }; + + const PartitionHandle * GetSDHandle() { return sd; }; + const PartitionHandle * GetUSBHandle() { return usb; }; + const PartitionHandle * GetGCAHandle() { return gca; }; + const PartitionHandle * GetGCBHandle() { return gcb; }; + + static bool SetWatchdog(unsigned int timeout); + static int PathToDriveType(const char * path); + static const char * GetFSName(int dev); + static int GetFSType(int dev); + s16 GetMountedCount(int dev); + static const char * PathToFSName(const char * path) { return GetFSName(PathToDriveType(path)); }; + static wbfs_t * GetWbfsHandle(int dev); + //static u32 GetLBAStart(int dev); + s32 Open_WBFS(int dev); + + private: + DeviceHandler() : sd(0), usb(0), gca(0), gcb(0) { }; + ~DeviceHandler(); + static bool InternalSetWatchdog(unsigned int timeout); + + static DeviceHandler * instance; + static unsigned int watchdog_timeout; + + PartitionHandle * sd; + PartitionHandle * usb; + PartitionHandle * gca; + PartitionHandle * gcb; +}; + +#endif diff --git a/source/devicemounter/PartitionHandle.cpp b/source/devicemounter/PartitionHandle.cpp new file mode 100644 index 00000000..7063c5b4 --- /dev/null +++ b/source/devicemounter/PartitionHandle.cpp @@ -0,0 +1,385 @@ + /**************************************************************************** + * Copyright (C) 2010 + * by Dimok + * modified for Debugging, GPT, WBFS, and EXT by Miigotu + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * By Dimok for WiiXplorer 2010 + * By Miigotu for WiiFlow 2010 + ***************************************************************************/ +#include <gccore.h> +#include <stdio.h> +#include <string.h> +#include <malloc.h> + +#include "PartitionHandle.h" +#include "utils.h" +#include "ntfs.h" +#include "fat.h" +#include "ext2.h" +#include "wbfs.h" +#include <sdcard/gcsd.h> + +#define PARTITION_TYPE_DOS33_EXTENDED 0x05 /* DOS 3.3+ extended partition */ +#define PARTITION_TYPE_WIN95_EXTENDED 0x0F /* Windows 95 extended partition */ +#define PARTITION_TYPE_GPT_TABLE 0xEE /* New Standard */ + +#define CACHE 8 +#define SECTORS 64 + +extern const DISC_INTERFACE __io_sdhc; + +extern u32 sector_size; + +static inline const char * PartFromType(int type) +{ + switch (type) + { + case 0x00: return "Unused"; //Or WBFS + case 0x01: return "FAT12"; + case 0x04: return "FAT16"; + case 0x05: return "Extended"; + case 0x06: return "FAT16"; + case 0x07: return "NTFS"; + case 0x0b: return "FAT32"; + case 0x0c: return "FAT32"; + case 0x0e: return "FAT16"; + case 0x0f: return "Extended"; + case 0x82: return "LxSWP"; + case 0x83: return "LINUX"; + case 0x8e: return "LxLVM"; + case 0xa8: return "OSX"; + case 0xab: return "OSXBT"; + case 0xaf: return "OSXHF"; + case 0xe8: return "LUKS"; + case 0xee: return "GPT"; + default: return "Unknown"; + } +} + +PartitionHandle::PartitionHandle(const DISC_INTERFACE *discio) +{ + interface = discio; + + // Sanity check + if(!interface) return; + + // Start the device and check that it is inserted + if(!interface->startup()) return; + if(!interface->isInserted()) return; + + FindPartitions(); +} + +PartitionHandle::~PartitionHandle() +{ + UnMountAll(); + + //shutdown device + interface->shutdown(); +} + +bool PartitionHandle::IsMounted(int pos) +{ + if(pos < 0 || pos >= (int) MountNameList.size()) + return false; + + if(MountNameList[pos].size() == 0) + return false; + + return true; +} + +bool PartitionHandle::Mount(int pos, const char * name) +{ + if(!valid(pos)) return false; + if(!name) return false; + + UnMount(pos); + + if(pos >= (int) MountNameList.size()) + MountNameList.resize(GetPartitionCount()); + + MountNameList[pos] = name; + SetWbfsHandle(pos, NULL); + + if(strncmp(GetFSName(pos), "FAT", 3) == 0) + { + if(fatMount(MountNameList[pos].c_str(), interface, GetLBAStart(pos), CACHE, SECTORS)) + return true; + } + else if(strncmp(GetFSName(pos), "NTFS", 4) == 0) + { + if(ntfsMount(MountNameList[pos].c_str(), interface, GetLBAStart(pos), CACHE, SECTORS, NTFS_SU | NTFS_RECOVER | NTFS_IGNORE_CASE)) + return true; + } + else if(strncmp(GetFSName(pos), "LINUX", 5) == 0) + { + if(ext2Mount(MountNameList[pos].c_str(), interface, GetLBAStart(pos), CACHE, SECTORS, EXT2_FLAG_DEFAULT)) + return true; + } + else if(strncmp(GetFSName(pos), "WBFS", 4) == 0) + { + if (interface == &__io_usbstorage) + SetWbfsHandle(pos, wbfs_open_partition(__WBFS_ReadUSB, __WBFS_WriteUSB, NULL, sector_size, GetSecCount(pos), GetLBAStart(pos), 0)); + else if (interface == &__io_sdhc) + SetWbfsHandle(pos, wbfs_open_partition(__WBFS_ReadSDHC, __WBFS_WriteSDHC, NULL, sector_size, GetSecCount(pos), GetLBAStart(pos), 0)); + + if(GetWbfsHandle(pos)) return true; + } + + MountNameList[pos].clear(); + + return false; +} + +void PartitionHandle::UnMount(int pos) +{ + if(!interface) return; + + if(pos >= (int) MountNameList.size()) return; + + if(MountNameList[pos].size() == 0) return; + + char DeviceName[20]; + snprintf(DeviceName, sizeof(DeviceName), "%s:", MountNameList[pos].c_str()); + + wbfs_t* wbfshandle = GetWbfsHandle(pos); + if(wbfshandle) wbfs_close(wbfshandle); + SetWbfsHandle(pos, NULL); + WBFS_Close(); + + fatUnmount(DeviceName); + ntfsUnmount(DeviceName, true); + ext2Unmount(DeviceName); + + //Remove mount name from the list + MountNameList[pos].clear(); +} + +int PartitionHandle::FindPartitions() +{ + MASTER_BOOT_RECORD mbr; + + // Read the first sector on the device + if(!interface->readSectors(0, 1, &mbr)) return 0; + + // Check if it's a RAW disc, without a partition table + if(CheckRAW((VOLUME_BOOT_RECORD *)&mbr)) return 1; + + // Verify this is the device's master boot record + if(mbr.signature != MBR_SIGNATURE) return 0; + + for (int i = 0; i < 4; i++) + { + PARTITION_RECORD * partition = (PARTITION_RECORD *) &mbr.partitions[i]; + VOLUME_BOOT_RECORD vbr; + + if (le32(partition->lba_start) == 0) continue; // Invalid partition + + if(!interface->readSectors(le32(partition->lba_start), 1, &vbr)) continue; + + // Check if the partition is WBFS + bool isWBFS = memcmp((u8 *)&vbr, WBFS_SIGNATURE, sizeof(WBFS_SIGNATURE)) == 0; + + if(!isWBFS && i == 0 && partition->type == PARTITION_TYPE_GPT_TABLE) + return CheckGPT() ? PartitionList.size() : 0; + + if(!isWBFS && vbr.Signature != VBR_SIGNATURE && partition->type != 0x83) continue; + + if(!isWBFS && (partition->type == PARTITION_TYPE_DOS33_EXTENDED || partition->type == PARTITION_TYPE_WIN95_EXTENDED)) + { + CheckEBR(i, le32(partition->lba_start)); + continue; + } + if(isWBFS || le32(partition->block_count) > 0) + { + PartitionFS PartitionEntry = {"0",0,0,0,0,0,0,0}; + PartitionEntry.FSName = isWBFS ? "WBFS" : PartFromType(partition->type); + PartitionEntry.LBA_Start = le32(partition->lba_start); + PartitionEntry.SecCount = isWBFS ? ((wbfs_head_t *)&vbr)->n_hd_sec : le32(partition->block_count); + PartitionEntry.Bootable = (partition->status == PARTITION_BOOTABLE); + PartitionEntry.PartitionType = partition->type; + PartitionEntry.PartitionNum = i; + PartitionEntry.EBR_Sector = 0; + + PartitionList.push_back(PartitionEntry); + } + } + return PartitionList.size(); +} + +void PartitionHandle::CheckEBR(u8 PartNum, sec_t ebr_lba) +{ + EXTENDED_BOOT_RECORD ebr; + sec_t next_erb_lba = 0; + + do + { + // Read and validate the extended boot record + if(!interface->readSectors(ebr_lba + next_erb_lba, 1, &ebr)) return; + + // Check if the partition is WBFS + bool isWBFS = memcmp((u8 *)&ebr, WBFS_SIGNATURE, sizeof(WBFS_SIGNATURE)) == 0; + + if(!isWBFS && ebr.signature != EBR_SIGNATURE) return; + + if(isWBFS || le32(ebr.partition.block_count) > 0) + { + PartitionFS PartitionEntry = {"0",0,0,0,0,0,0,0}; + PartitionEntry.FSName = isWBFS ? "WBFS" : PartFromType(ebr.partition.type); + PartitionEntry.LBA_Start = ebr_lba + next_erb_lba + le32(ebr.partition.lba_start); + PartitionEntry.SecCount = isWBFS ? ((wbfs_head_t *)&ebr)->n_hd_sec : le32(ebr.partition.block_count); + PartitionEntry.Bootable = (ebr.partition.status == PARTITION_BOOTABLE); + PartitionEntry.PartitionType = ebr.partition.type; + PartitionEntry.PartitionNum = PartNum; + PartitionEntry.EBR_Sector = ebr_lba + next_erb_lba; + + PartitionList.push_back(PartitionEntry); + } + // Get the start sector of the current partition + // and the next extended boot record in the chain + next_erb_lba = le32(ebr.next_ebr.lba_start); + } + while(next_erb_lba > 0); +} + +bool PartitionHandle::CheckGPT(void) +{ + GPT_PARTITION_TABLE gpt; + bool success = false; // To return false unless at least 1 partition is verified + + if(!interface->readSectors(1, 33, &gpt)) return false; // To read all 128 possible partitions + + // Verify this is the Primary GPT entry + if(strncmp(gpt.magic, GPT_SIGNATURE, 8) != 0) return false; + if(le32(gpt.Entry_Size) != 128) return false; + if(le64(gpt.Table_LBA) != 2) return false; + if(le64(gpt.Header_LBA) != 1) return false; + if(le64(gpt.First_Usable_LBA) != 34) return false; + if(gpt.Reserved != 0) return false; + + VOLUME_BOOT_RECORD * vbr = new VOLUME_BOOT_RECORD; + for(u8 i = 0; i < le32(gpt.Num_Entries) && PartitionList.size() <= 8; i++) + { + GUID_PARTITION_ENTRY * entry = (GUID_PARTITION_ENTRY *) &gpt.partitions[i]; + + int Start = le64(entry->First_LBA); + int End = le64(entry->Last_LBA); + int Size = End - Start; + + if(!interface->readSectors(Start, 1, vbr)) continue; + + PartitionFS PartitionEntry = {"0",0,0,0,0,0,0,0}; + if(memcmp((u8 *)vbr + BPB_NTFS_ADDR, NTFS_SIGNATURE, sizeof(NTFS_SIGNATURE)) == 0) + { + PartitionEntry.FSName = "NTFS"; + PartitionEntry.PartitionType = 0x07; + PartitionEntry.SecCount = le64(vbr->Number_of_Sectors); + } + else if(memcmp((u8 *)vbr + BPB_FAT32_ADDR, FAT_SIGNATURE, sizeof(FAT_SIGNATURE)) == 0) + { + PartitionEntry.FSName = "FAT32"; + PartitionEntry.PartitionType = 0x0c; + PartitionEntry.SecCount = le16(vbr->bpb.FatSectors); + if (PartitionEntry.SecCount == 0) + PartitionEntry.SecCount = le32(vbr->bpb.Large_Sectors); + } + else if(memcmp((u8 *)vbr + BPB_FAT16_ADDR, FAT_SIGNATURE, sizeof(FAT_SIGNATURE)) == 0) + { + PartitionEntry.FSName = "FAT16"; + PartitionEntry.PartitionType = 0x0e; + + PartitionEntry.SecCount = le16(vbr->bpb.FatSectors); + if (PartitionEntry.SecCount == 0) + PartitionEntry.SecCount = le32(vbr->bpb.Large_Sectors); + } + else if(memcmp((u8 *)vbr, WBFS_SIGNATURE, sizeof(WBFS_SIGNATURE)) == 0) + { + PartitionEntry.FSName = "WBFS"; + PartitionEntry.SecCount = ((wbfs_head_t *)vbr)->n_hd_sec; + } + else + { + bzero(&PartitionEntry, sizeof(PartitionFS)); + if(interface->readSectors(Start + 1, 1, vbr)) + { + if(memcmp((u8 *)vbr + BPB_EXT2_ADDR, EXT_SIGNATURE, sizeof(EXT_SIGNATURE)) == 0) + { + PartitionEntry.FSName = "LINUX"; + PartitionEntry.PartitionType = 0x83; + PartitionEntry.SecCount = Size; + } + else continue; + } + else continue; + } + + if(PartitionEntry.SecCount != 0 && PartitionEntry.FSName[0] != '0') + { + PartitionEntry.LBA_Start = Start; + PartitionEntry.PartitionNum = i; + + success = true; + PartitionList.push_back(PartitionEntry); + } + } + return success; +} + +bool PartitionHandle::CheckRAW(VOLUME_BOOT_RECORD * vbr) +{ + PartitionFS PartitionEntry = {"0",0,0,0,0,0,0,0}; + if(memcmp((u8 *)vbr + BPB_NTFS_ADDR, NTFS_SIGNATURE, sizeof(NTFS_SIGNATURE)) == 0) + { + PartitionEntry.FSName = "NTFS"; + PartitionEntry.PartitionType = 0x07; + PartitionEntry.SecCount = le64(vbr->Number_of_Sectors); + } + else if(memcmp((u8 *)vbr + BPB_FAT32_ADDR, FAT_SIGNATURE, sizeof(FAT_SIGNATURE)) == 0) + { + PartitionEntry.FSName = "FAT32"; + PartitionEntry.PartitionType = 0x0c; + PartitionEntry.SecCount = le16(vbr->bpb.FatSectors); + if (PartitionEntry.SecCount == 0) + PartitionEntry.SecCount = le32(vbr->bpb.Large_Sectors); + } + else if(memcmp((u8 *)vbr + BPB_FAT16_ADDR, FAT_SIGNATURE, sizeof(FAT_SIGNATURE)) == 0) + { + PartitionEntry.FSName = "FAT16"; + PartitionEntry.PartitionType = 0x0e; + PartitionEntry.SecCount = le16(vbr->bpb.FatSectors); + if (PartitionEntry.SecCount == 0) + PartitionEntry.SecCount = le32(vbr->bpb.Large_Sectors); + } + else if(memcmp((u8 *)vbr, WBFS_SIGNATURE, sizeof(WBFS_SIGNATURE)) == 0) + { + PartitionEntry.FSName = "WBFS"; + PartitionEntry.SecCount = ((wbfs_head_t *)vbr)->n_hd_sec; + } + + if(PartitionEntry.FSName[0] != '0') + { + PartitionList.push_back(PartitionEntry); + return true; + } + return false; +} \ No newline at end of file diff --git a/source/devicemounter/PartitionHandle.h b/source/devicemounter/PartitionHandle.h new file mode 100644 index 00000000..a45c0d9f --- /dev/null +++ b/source/devicemounter/PartitionHandle.h @@ -0,0 +1,218 @@ + /**************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#ifndef PARTITION_HANDLE_H +#define PARTITION_HANDLE_H + +#include <gccore.h> +#include "safe_vector.hpp" +#include "libwbfs/libwbfs.h" +#include <string> + +#define MAX_PARTITIONS 32 /* Maximum number of partitions that can be found */ +#define MAX_MOUNTS 10 /* Maximum number of mounts available at one time */ +#define MAX_SYMLINK_DEPTH 10 /* Maximum search depth when resolving symbolic links */ + +#define MBR_SIGNATURE 0x55AA +#define EBR_SIGNATURE MBR_SIGNATURE +#define VBR_SIGNATURE MBR_SIGNATURE +#define GPT_SIGNATURE "EFI PART" + +#define PARTITION_BOOTABLE 0x80 /* Bootable (active) */ +#define PARTITION_NONBOOTABLE 0x00 /* Non-bootable */ + +#define BYTES_PER_SECTOR 512 /* Default in libogc */ + +enum SIG_OFFSETS { + BPB_NTFS_ADDR = 0x3, + BPB_FAT16_ADDR = 0x36, + BPB_EXT2_ADDR = 0x38, + BPB_FAT32_ADDR = 0x52, +}; + +static const char FAT_SIGNATURE[3] = {'F', 'A', 'T'}; +static const char NTFS_SIGNATURE[4] = {'N', 'T', 'F', 'S'}; +static const char WBFS_SIGNATURE[4] = {'W', 'B', 'F', 'S'}; +static const char EXT_SIGNATURE[2] = {0x53, 0xEF}; + +typedef struct _PARTITION_RECORD { + u8 status; /* Partition status; see above */ + u8 chs_start[3]; /* Cylinder-head-sector address to first block of partition */ + u8 type; /* Partition type; see above */ + u8 chs_end[3]; /* Cylinder-head-sector address to last block of partition */ + u32 lba_start; /* Local block address to first sector of partition */ + u32 block_count; /* Number of blocks in partition */ +} __attribute__((__packed__)) PARTITION_RECORD; + +typedef struct _MASTER_BOOT_RECORD { + u8 code_area[440]; /* Code area; normally empty */ + u8 disk_guid[4]; /* Disk signature (optional) */ + u8 reserved[2]; /* Usually zeroed */ + PARTITION_RECORD partitions[4]; /* 4 primary partitions */ + u16 signature; /* MBR signature; 0xAA55 */ +} __attribute__((__packed__)) MASTER_BOOT_RECORD; + +typedef struct _EXTENDED_BOOT_RECORD { + u8 code_area[446]; /* Code area; normally empty */ + PARTITION_RECORD partition; /* Primary partition */ + PARTITION_RECORD next_ebr; /* Next extended boot record in the chain */ + u8 reserved[32]; /* Normally empty */ + u16 signature; /* EBR signature; 0xAA55 */ +} __attribute__((__packed__)) EXTENDED_BOOT_RECORD; + +typedef struct _GUID_PARTITION_ENTRY +{ + u8 Type_GUID[16]; /* Partition type GUID */ + u8 Unique_GUID[16]; /* Unique partition GUID */ + u64 First_LBA; /* First LBA (little-endian) */ + u64 Last_LBA; /* Last LBA (inclusive, usually odd) */ + u64 Attributes; /* GUID Attribute flags (e.g. bit 60 denotes read-only) */ + char Name[72]; /* Partition name (36 UTF-16LE code units) */ +} __attribute__((__packed__)) GUID_PARTITION_ENTRY; + +typedef struct _GPT_PARTITION_TABLE { + char magic[8]; /* "EFI PART" */ + u32 Revision; + u32 Header_Size; /* Size of this header */ + u32 CheckSum; + u32 Reserved; /* Must be 0 */ + u64 Header_LBA; /* Location of this header, always 1 in primary copy */ + u64 Backup_Header_LBA; /* Location of backup header, always max lba - 1 */ + u64 First_Usable_LBA; /* Primary GPT partition table's last LBA + 1 */ + u64 Last_Usable_LBA; /* Secondary GPT partition table's first LBA - 1 */ + u8 GUID[16]; /* Disk GUID (also referred as UUID on UNIXes) */ + u64 Table_LBA; /* Always 2 in primary copy, or Header_LBA + 1. Secondary copy is Backup_Header_LBA - 1 */ + u32 Num_Entries; /* Number of entries in the partition info array */ + u32 Entry_Size; /* Size of each array entry, usually 128 */ + u32 Entries_CheckSum; /* CRC32 of partition array */ + u8 Zeroes[420]; /* Pad to a total 512 byte LBA or sizeof 1 LBA */ + GUID_PARTITION_ENTRY partitions[128]; /* Max 128 Partition Entries */ +} __attribute__((__packed__)) GPT_PARTITION_TABLE; + +typedef struct _PartitionFS { + const char * FSName; + u32 LBA_Start; + u32 SecCount; + bool Bootable; + u8 PartitionType; + u8 PartitionNum; + u32 EBR_Sector; + wbfs_t *wbfshandle; +} PartitionFS; + +typedef struct _BIOS_PARAMETER_BLOCK { + u16 Bytes_Per_Sector; /* Size of a sector in bytes. */ + u8 Sectors_Per_Cluster; /* Size of a cluster in sectors. */ + u16 ReservedSsectors; /* zero on ntfs */ + u8 Fats; /* zero on ntfs */ + u16 Root_Entries; /* zero on ntfs */ + u16 FatSectors; /* Number of sectors in volume. (FAT) Zero on ntfs */ + u8 Media_Type; /* 0xf8 = hard disk */ + u16 Sectors_Per_Fat; /* zero on ntfs*/ + u16 Sectors_Per_Track; /* Required to boot Windows. (0x0d) */ + u16 Heads; /* Required to boot Windows. (0x0f) */ + u32 Hidden_Sectors; /* Offset to the start of the partition (0x11) in sectors. */ + u32 Large_Sectors; /* Number of sectors in volume if Sectors is 0 (FAT) Zero on ntfs (0x15) */ +} __attribute__((__packed__)) BIOS_PARAMETER_BLOCK; /* 25 (0x19) bytes */ + +typedef struct _VOLUME_BOOT_RECORD { + u8 Jump[3]; /* Irrelevant (jump to boot up code).*/ + char Name[8]; /* Magic "NTFS ". */ + BIOS_PARAMETER_BLOCK bpb; /* See BIOS_PARAMETER_BLOCK. (0x0b) */ + u8 Drive_Type; /* 0x00 floppy, 0x80 hard disk */ + u8 Current_Head; /* zero on ntfs */ + u8 Extended_Boot_Signature; /* 0x80 on ntfs (Doesnt show this in M$ docs)*/ + u8 Reserved0; /* zero on ntfs */ + s64 Number_of_Sectors; /* Number of sectors in volume. (NTFS)(0x28)*/ + s64 MFT; /* Cluster location of mft data. */ + s64 MFT_Mirror; /* Cluster location of copy of mft. */ + s8 Clusters_Per_MFT; /* Mft record size in clusters. */ + u8 Reserved1[3]; /* zero */ + s8 Clusters_Per_Index; /* Index block size in clusters. */ + u8 Reserved2[3]; /* zero */ + u64 Volume_Serial_Number; /* Irrelevant (serial number). */ + u8 Checksum[4]; /* Boot sector checksum. */ + u8 Bootstrap[426]; /* Irrelevant (boot up code). (0x54) */ + u16 Signature; /* End of bootsector magic. LE 0xaa55 */ +} __attribute__((__packed__)) VOLUME_BOOT_RECORD; /* 512 (0x200) bytes */ + +class PartitionHandle +{ + public: + //! Constructor reads the MBR and all EBRs and lists up the Partitions + PartitionHandle(const DISC_INTERFACE *discio); + //! Destructor unmounts drives + ~PartitionHandle(); + //! Is Drive inserted + bool IsInserted() { if(!interface) return false; else return interface->isInserted(); }; + //! Is the partition Mounted + bool IsMounted(int pos); + //! Mount a specific Partition + bool Mount(int pos, const char * name); + //! UnMount a specific Partition + void UnMount(int pos); + //! UnMount all Partition + void UnMountAll() { for(u32 i = 0; i < PartitionList.size(); ++i) UnMount(i); }; + //! Get the Mountname + const char * MountName(int pos) { if(pos < 0 || pos >= (int) MountNameList.size() || !MountNameList[pos].size()) return NULL; else return MountNameList[pos].c_str(); }; + //! Get the Name of the FileSystem e.g. "FAT32" + const char * GetFSName(int pos) { if(valid(pos)) return PartitionList[pos].FSName; else return NULL; }; + //! Get the LBA where the partition is located + u32 GetLBAStart(int pos) { if(valid(pos)) return PartitionList[pos].LBA_Start; else return 0; }; + //! Get the partition size in sectors of this partition + u32 GetSecCount(int pos) { if(valid(pos)) return PartitionList[pos].SecCount; else return 0; }; + //! Check if the partition is Active or NonBootable + bool IsActive(int pos) { if(valid(pos)) return PartitionList[pos].Bootable; else return false; }; + //! Get the partition type + int GetPartitionType(int pos) { if(valid(pos)) return PartitionList[pos].PartitionType; else return -1; }; + //! Get the entrie number in MBR of this partition + int GetPartitionNum(int pos) { if(valid(pos)) return PartitionList[pos].PartitionNum; else return -1; }; + //! Get the EBR sector where this partition is described + int GetEBRSector(int pos) { if(valid(pos)) return PartitionList[pos].EBR_Sector; else return 0; }; + //! Get the count of found partitions + int GetPartitionCount() { return PartitionList.size(); }; + //! Get the partition size in bytes + u64 GetSize(int pos) { if(valid(pos)) return (u64) PartitionList[pos].SecCount*BYTES_PER_SECTOR; else return 0; }; + //! Get the wbfs mount handle + wbfs_t * GetWbfsHandle(int pos) { if(valid(pos)) return PartitionList[pos].wbfshandle; else return 0; }; + //! Set the wbfs mount handle + bool SetWbfsHandle(int pos, wbfs_t * wbfshandle) { if(valid(pos)) {PartitionList[pos].wbfshandle = wbfshandle; return true;} else return false; }; + //! Get the whole partition record struct + PartitionFS * GetPartitionRecord(int pos) { if(valid(pos)) return &PartitionList[pos]; else return NULL; }; + //! Get the disc interface of this handle + const DISC_INTERFACE * GetDiscInterface() { return interface; }; + protected: + bool valid(int pos) { return (pos >= 0 && pos < (int) PartitionList.size()); } + bool CheckRAW(VOLUME_BOOT_RECORD * vbr); + int FindPartitions(); + void CheckEBR(u8 PartNum, sec_t ebr_lba); + bool CheckGPT(void); + + const DISC_INTERFACE *interface; + safe_vector<PartitionFS> PartitionList; + safe_vector<std::string> MountNameList; +}; + +#endif diff --git a/source/devicemounter/libwbfs/libwbfs.c b/source/devicemounter/libwbfs/libwbfs.c new file mode 100644 index 00000000..04c3a7ff --- /dev/null +++ b/source/devicemounter/libwbfs/libwbfs.c @@ -0,0 +1,720 @@ +// Copyright 2009 Kwiirk +// Licensed under the terms of the GNU GPL, version 2 +// http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt + +// Modified by oggzee + +#include "libwbfs.h" + +#define likely(x) __builtin_expect(!!(x), 1) +#define unlikely(x) __builtin_expect(!!(x), 0) + +#define ERROR(x) do {wbfs_error(x);goto error;}while(0) +#define ALIGN_LBA(x) (((x)+p->hd_sec_sz-1)&(~(p->hd_sec_sz-1))) + +wbfs_t wbfs_iso_file; + +static int force_mode=0; + +void wbfs_set_force_mode(int force) +{ + force_mode = force; +} + +static u8 size_to_shift(u32 size) +{ + u8 ret = 0; + while(size) + { + ret++; + size >>= 1; + } + return ret - 1; +} + +#define read_le32_unaligned(x) ((x)[0]|((x)[1]<<8)|((x)[2]<<16)|((x)[3]<<24)) + +wbfs_t *wbfs_open_hd(rw_sector_callback_t read_hdsector, rw_sector_callback_t write_hdsector, void *callback_data, int hd_sector_size, int num_hd_sector __attribute((unused)), int reset) +{ + int i=num_hd_sector,ret; + u8 *ptr,*tmp_buffer = wbfs_ioalloc(hd_sector_size); + u8 part_table[16*4]; + ret = read_hdsector(callback_data,0,1,tmp_buffer); + if(ret) return 0; + //find wbfs partition + wbfs_memcpy(part_table, tmp_buffer + 0x1be, 16 * 4); + ptr = part_table; + for(i = 0; i < 4; i++, ptr += 16) + { + u32 part_lba = read_le32_unaligned(ptr + 0x8); + wbfs_head_t *head = (wbfs_head_t *)tmp_buffer; + ret = read_hdsector(callback_data, part_lba, 1, tmp_buffer); + // verify there is the magic. + if (head->magic == wbfs_htonl(WBFS_MAGIC)) + { + wbfs_t *p = wbfs_open_partition(read_hdsector, write_hdsector, callback_data, hd_sector_size, 0, part_lba,reset); + wbfs_iofree(tmp_buffer); + return p; + } + } + wbfs_iofree(tmp_buffer); + if(reset)// XXX make a empty hd partition.. + { + } + return 0; +} + +wbfs_t *wbfs_open_partition(rw_sector_callback_t read_hdsector, rw_sector_callback_t write_hdsector, void *callback_data, int hd_sector_size, int num_hd_sector, u32 part_lba, int reset) +{ + wbfs_t *p = wbfs_malloc(sizeof(wbfs_t)); + + wbfs_head_t *head = wbfs_ioalloc(hd_sector_size?hd_sector_size:512); + + //constants, but put here for consistancy + p->wii_sec_sz = 0x8000; + p->wii_sec_sz_s = size_to_shift(0x8000); + p->n_wii_sec = (num_hd_sector / 0x8000) * hd_sector_size; + p->n_wii_sec_per_disc = 143432 * 2;//support for double layers discs.. + p->head = head; + p->part_lba = part_lba; + // init the partition + if (reset) + { + u8 sz_s; + wbfs_memset(head, 0, hd_sector_size); + head->magic = wbfs_htonl(WBFS_MAGIC); + head->hd_sec_sz_s = size_to_shift(hd_sector_size); + head->n_hd_sec = wbfs_htonl(num_hd_sector); + // choose minimum wblk_sz that fits this partition size + for(sz_s = 6; sz_s < 11; sz_s++) + { + // ensure that wbfs_sec_sz is big enough to address every blocks using 16 bits + if(p->n_wii_sec < ((1U << 16) * (1 << sz_s))) break; + } + head->wbfs_sec_sz_s = sz_s + p->wii_sec_sz_s; + } + else read_hdsector(callback_data, p->part_lba, 1, head); + if (head->magic != wbfs_htonl(WBFS_MAGIC)) ERROR("bad magic"); + if(!force_mode && hd_sector_size && head->hd_sec_sz_s !=size_to_shift(hd_sector_size)) ERROR("hd sector size doesn't match"); + if(!force_mode && num_hd_sector && head->n_hd_sec != wbfs_htonl(num_hd_sector)) ERROR("hd num sector doesn't match"); + p->hd_sec_sz = 1 << head->hd_sec_sz_s; + p->hd_sec_sz_s = head->hd_sec_sz_s; + p->n_hd_sec = wbfs_ntohl(head->n_hd_sec); + + p->n_wii_sec = (p->n_hd_sec / p->wii_sec_sz) * (p->hd_sec_sz); + + p->wbfs_sec_sz_s = head->wbfs_sec_sz_s; + p->wbfs_sec_sz = 1 << p->wbfs_sec_sz_s; + p->n_wbfs_sec = p->n_wii_sec >> (p->wbfs_sec_sz_s - p->wii_sec_sz_s); + p->n_wbfs_sec_per_disc = p->n_wii_sec_per_disc >> (p->wbfs_sec_sz_s - p->wii_sec_sz_s); + p->disc_info_sz = ALIGN_LBA(sizeof(wbfs_disc_info_t) + p->n_wbfs_sec_per_disc * 2); + + //printf("hd_sector_size %X wii_sector size %X wbfs sector_size %X\n",p->hd_sec_sz,p->wii_sec_sz,p->wbfs_sec_sz); + p->read_hdsector = read_hdsector; + p->write_hdsector = write_hdsector; + p->callback_data = callback_data; + + p->freeblks_lba = (p->wbfs_sec_sz - p->n_wbfs_sec /8 ) >> p->hd_sec_sz_s; + + if(!reset) p->freeblks = 0; // will alloc and read only if needed + else + { + // init with all free blocks + p->freeblks = wbfs_ioalloc(ALIGN_LBA(p->n_wbfs_sec/8)); + wbfs_memset(p->freeblks,0xff,p->n_wbfs_sec/8); + } + p->max_disc = (p->freeblks_lba - 1) / (p->disc_info_sz >> p->hd_sec_sz_s); + if(p->max_disc > p->hd_sec_sz - sizeof(wbfs_head_t)) p->max_disc = p->hd_sec_sz - sizeof(wbfs_head_t); + + p->tmp_buffer = wbfs_ioalloc(p->hd_sec_sz); + p->n_disc_open = 0; + return p; +error: + wbfs_free(p); + wbfs_iofree(head); + + return 0; +} + +void wbfs_sync(wbfs_t *p) +{ + // copy back descriptors + if(p->write_hdsector) + { + p->write_hdsector(p->callback_data,p->part_lba+0,1, p->head); + if(p->freeblks) p->write_hdsector(p->callback_data, p->part_lba + p->freeblks_lba, ALIGN_LBA(p->n_wbfs_sec / 8) >> p->hd_sec_sz_s, p->freeblks); + } +} + +void wbfs_close(wbfs_t *p) +{ + wbfs_sync(p); + + if(p->n_disc_open) ERROR("trying to close wbfs while discs still open"); + + wbfs_iofree(p->head); + wbfs_iofree(p->tmp_buffer); + if(p->freeblks) wbfs_iofree(p->freeblks); + + wbfs_free(p); + +error: + return; +} + +wbfs_disc_t *wbfs_open_disc(wbfs_t* p, const u8 *discid) +{ + u32 i; + int disc_info_sz_lba = p->disc_info_sz>>p->hd_sec_sz_s; + wbfs_disc_t *d = 0; + for(i = 0; i < p->max_disc; i++) + { + if (p->head->disc_table[i]) + { + p->read_hdsector(p->callback_data, p->part_lba+1+i*disc_info_sz_lba,1,p->tmp_buffer); + if(wbfs_memcmp(discid,p->tmp_buffer,6)==0) + { + d = wbfs_malloc(sizeof(*d)); + if(!d) ERROR("allocating memory"); + d->p = p; + d->i = i; + d->header = wbfs_ioalloc(p->disc_info_sz); + if(!d->header) + ERROR("allocating memory"); + p->read_hdsector(p->callback_data, p->part_lba + 1 + i * disc_info_sz_lba, disc_info_sz_lba, d->header); + p->n_disc_open ++; +// for(i = 0; i < p->n_wbfs_sec_per_disc; i++) +// printf("%d,", wbfs_ntohs(d->header->wlba_table[i])); + return d; + } + } + } + return 0; +error: + if(d) wbfs_iofree(d); + return 0; + +} +void wbfs_close_disc(wbfs_disc_t*d) +{ + d->p->n_disc_open --; + wbfs_iofree(d->header); + wbfs_free(d); +} +// offset is pointing 32bit words to address the whole dvd, although len is in bytes +int wbfs_disc_read(wbfs_disc_t *d, u32 offset, u32 len, u8 *data) +{ + if (d->p == &wbfs_iso_file) return wbfs_iso_file_read(d, offset, data, len); + + wbfs_t *p = d->p; + u16 wlba = offset>>(p->wbfs_sec_sz_s-2); + u32 iwlba_shift = p->wbfs_sec_sz_s - p->hd_sec_sz_s; + u32 lba_mask = (p->wbfs_sec_sz-1)>>(p->hd_sec_sz_s); + u32 lba = (offset>>(p->hd_sec_sz_s-2))&lba_mask; + u32 off = offset&((p->hd_sec_sz>>2)-1); + u16 iwlba = wbfs_ntohs(d->header->wlba_table[wlba]); + u32 len_copied; + int err = 0; + u8 *ptr = data; + if(unlikely(iwlba==0)) return 1; + if(unlikely(off)) + { + off *= 4; + err = p->read_hdsector(p->callback_data, p->part_lba + (iwlba<<iwlba_shift) + lba, 1, p->tmp_buffer); + if(err) return err; + len_copied = p->hd_sec_sz - off; + if(likely(len < len_copied)) len_copied = len; + wbfs_memcpy(ptr, p->tmp_buffer + off, len_copied); + len -= len_copied; + ptr += len_copied; + lba++; + if(unlikely(lba>lba_mask && len)) + { + lba=0; + iwlba = wbfs_ntohs(d->header->wlba_table[++wlba]); + if(unlikely(iwlba==0)) return 1; + } + } + while(likely(len>=p->hd_sec_sz)) + { + u32 nlb = len>>(p->hd_sec_sz_s); + + if(unlikely(lba + nlb > p->wbfs_sec_sz)) // dont cross wbfs sectors.. + nlb = p->wbfs_sec_sz-lba; + err = p->read_hdsector(p->callback_data, p->part_lba + (iwlba<<iwlba_shift) + lba, nlb, ptr); + if(err) return err; + len -= nlb << p->hd_sec_sz_s; + ptr += nlb << p->hd_sec_sz_s; + lba += nlb; + if(unlikely(lba > lba_mask && len)) + { + lba = 0; + iwlba = wbfs_ntohs(d->header->wlba_table[++wlba]); + if(unlikely(iwlba==0)) return 1; + } + } + if(unlikely(len)) + { + err = p->read_hdsector(p->callback_data, p->part_lba + (iwlba << iwlba_shift) + lba, 1, p->tmp_buffer); + if(err) return err; + wbfs_memcpy(ptr, p->tmp_buffer, len); + } + return 0; +} + +// disc listing +u32 wbfs_count_discs(wbfs_t *p) +{ + u32 i,count=0; + for(i = 0; i < p->max_disc; i++) + if (p->head->disc_table[i]) count++; + return count; + +} + +u32 wbfs_sector_used(wbfs_t *p, wbfs_disc_info_t *di) +{ + u32 tot_blk = 0, j; + for(j = 0; j < p->n_wbfs_sec_per_disc; j++) + if(wbfs_ntohs(di->wlba_table[j])) tot_blk++; + return tot_blk; +} + +u32 wbfs_sector_used2(wbfs_t *p, wbfs_disc_info_t *di, u32 *last_blk) +{ + u32 tot_blk = 0, j; + for(j = 0; j < p->n_wbfs_sec_per_disc; j++) + if(wbfs_ntohs(di->wlba_table[j])) + { + if (last_blk) *last_blk = j; + tot_blk++; + } + return tot_blk; +} + +u32 wbfs_get_disc_info(wbfs_t *p, u32 index,u8 *header,int header_size,u32 *size)//size in 32 bit +{ + u32 i,count=0; + if (!p) return 1; + int disc_info_sz_lba = p->disc_info_sz >> p->hd_sec_sz_s; + + for(i = 0; i < p->max_disc; i++) + if (p->head->disc_table[i]) + { + if(count++ == index) + { + p->read_hdsector(p->callback_data, p->part_lba + 1 + i * disc_info_sz_lba, 1, p->tmp_buffer); + if(header_size > (int)p->hd_sec_sz) header_size = p->hd_sec_sz; + u32 magic = wbfs_ntohl(*(u32*)(p->tmp_buffer + 24)); + if(magic != 0x5D1C9EA3) + { + p->head->disc_table[i]=0; + return 1; + } + memcpy(header, p->tmp_buffer, header_size); + if(size) + { + u8 *header = wbfs_ioalloc(p->disc_info_sz); + p->read_hdsector(p->callback_data, p->part_lba + 1 + i * disc_info_sz_lba, disc_info_sz_lba, header); + u32 sec_used = wbfs_sector_used(p,(wbfs_disc_info_t *)header); + wbfs_iofree(header); + *size = sec_used<<(p->wbfs_sec_sz_s-2); + } + return 0; + } + } + return 1; +} + +static void load_freeblocks(wbfs_t *p) +{ + if(p->freeblks) return; + // XXX should handle malloc error.. + p->freeblks = wbfs_ioalloc(ALIGN_LBA(p->n_wbfs_sec/8)); + p->read_hdsector(p->callback_data, p->part_lba + p->freeblks_lba, ALIGN_LBA(p->n_wbfs_sec / 8) >> p->hd_sec_sz_s, p->freeblks); +} + +u32 wbfs_count_usedblocks(wbfs_t *p) +{ + u32 i, j, count = 0; + load_freeblocks(p); + for(i = 0; i < p->n_wbfs_sec / (8 * 4); i++) + { + u32 v = wbfs_ntohl(p->freeblks[i]); + if(v == ~0U) + count += 32; + else if(v != 0) + for(j = 0; j < 32; j++) + if (v & (1 << j)) + count++; + } + return count; +} + +// write access +// static +int block_used(u8 *used, u32 i, u32 wblk_sz) +{ + u32 k; + i *= wblk_sz; + for(k = 0; k < wblk_sz; k++) + if(i + k < 143432 * 2 && used[i + k]) return 1; + return 0; +} + +static u32 alloc_block(wbfs_t *p) +{ + u32 i,j; + for(i = 0; i < p->n_wbfs_sec / (8 * 4); i++) + { + u32 v = wbfs_ntohl(p->freeblks[i]); + if(v != 0) + { + for(j = 0; j < 32; j++) + if (v & (1 << j)) + { + p->freeblks[i] = wbfs_htonl(v & ~(1<<j)); + return (i * 32) + j + 1; + } + } + } + return ~0; +} +static void free_block(wbfs_t *p,int bl) +{ + int i = (bl - 1) / (32); + int j = (bl - 1) & 31; + u32 v = wbfs_ntohl(p->freeblks[i]); + p->freeblks[i] = wbfs_htonl(v | 1 << j); +} + +u32 wbfs_add_disc(wbfs_t *p, read_wiidisc_callback_t read_src_wii_disc, void *callback_data,progress_callback_t spinner,void *spinner_data,partition_selector_t sel,int copy_1_1) +{ + int i,discn; + u32 tot,cur; + u32 wii_sec_per_wbfs_sect = 1 << (p->wbfs_sec_sz_s - p->wii_sec_sz_s); + wiidisc_t *d = 0; + u8 *used = 0; + wbfs_disc_info_t *info = 0; + u8* copy_buffer = 0; + int retval = -1; + int num_wbfs_sect_to_copy; + u32 last_used; + used = wbfs_malloc(p->n_wii_sec_per_disc); + + if(!used) ERROR("unable to alloc memory"); + // copy_1_1 needs disk usage for layers detection + //if(!copy_1_1) + { + d = wd_open_disc(read_src_wii_disc, callback_data); + if(!d) ERROR("unable to open wii disc"); + + wd_build_disc_usage(d, sel, used); + wd_close_disc(d); + d = 0; + } + + for(i = 0; i < p->max_disc; i++)// find a free slot. + if(p->head->disc_table[i]==0) break; + + if(i == p->max_disc) ERROR("no space left on device (table full)"); + p->head->disc_table[i] = 1; + discn = i; + load_freeblocks(p); + + // build disc info + info = wbfs_ioalloc(p->disc_info_sz); + read_src_wii_disc(callback_data, 0, 0x100, info->disc_header_copy); + + copy_buffer = wbfs_ioalloc(p->wii_sec_sz); + if(!copy_buffer) ERROR("alloc memory"); + tot = 0; + cur = 0; + num_wbfs_sect_to_copy = p->n_wbfs_sec_per_disc; + // count total number of sectors to write + last_used = 0; + for(i = 0; i < num_wbfs_sect_to_copy; i++) + { + if(block_used(used, i, wii_sec_per_wbfs_sect)) + { + tot += wii_sec_per_wbfs_sect; + last_used = i; + } + } + if (copy_1_1) + { + // detect single or dual layer + if ( (last_used + 1) > (p->n_wbfs_sec_per_disc / 2) ) + num_wbfs_sect_to_copy = p->n_wbfs_sec_per_disc; + else num_wbfs_sect_to_copy = p->n_wbfs_sec_per_disc / 2; + + tot = num_wbfs_sect_to_copy * wii_sec_per_wbfs_sect; + } + /* + // num of hd sectors to copy could be specified directly + if (copy_1_1 > 1) { + u32 hd_sec_per_wii_sec = p->wii_sec_sz / p->hd_sec_sz; + num_wbfs_sect_to_copy = copy_1_1 / hd_sec_per_wii_sec / wii_sec_per_wbfs_sect; + tot = num_wbfs_sect_to_copy * wii_sec_per_wbfs_sect; + }*/ + int ret = 0; + if(spinner) spinner(0, tot, spinner_data); + for(i=0; i < num_wbfs_sect_to_copy; i++) + { + u16 bl = 0; + if(copy_1_1 || block_used(used,i, wii_sec_per_wbfs_sect)) + { + u16 j; + + bl = alloc_block(p); + if (bl==0xffff) + ERROR("no space left on device (disc full)"); + for(j = 0; j < wii_sec_per_wbfs_sect; j++) + { + u32 offset = (i * (p->wbfs_sec_sz >> 2)) + (j * (p->wii_sec_sz >> 2)); + + ret = read_src_wii_disc(callback_data, offset, p->wii_sec_sz, copy_buffer); + if (ret) + { + if (copy_1_1 && i > p->n_wbfs_sec_per_disc / 2) + { + // end of dual layer data + if (j > 0) info->wlba_table[i] = wbfs_htons(bl); + spinner(tot,tot,spinner_data); + break; + } + //ERROR("read error"); + printf("\rWARNING: read (%u) error (%d)\n", offset, ret); + } + + //fix the partition table + if(offset == (0x40000>>2)) wd_fix_partition_table(d, sel, copy_buffer); + p->write_hdsector(p->callback_data, p->part_lba + bl * (p->wbfs_sec_sz / p->hd_sec_sz) + j + * (p->wii_sec_sz / p->hd_sec_sz), p->wii_sec_sz / p->hd_sec_sz, copy_buffer); + cur++; + if(spinner) spinner(cur,tot,spinner_data); + } + } + if (ret) break; + info->wlba_table[i] = wbfs_htons(bl); + wbfs_sync(p); + } + // write disc info + int disc_info_sz_lba = p->disc_info_sz>>p->hd_sec_sz_s; + p->write_hdsector(p->callback_data,p->part_lba+1+discn*disc_info_sz_lba,disc_info_sz_lba,info); + wbfs_sync(p); + retval = 0; +error: + if(d) wd_close_disc(d); + if(used) wbfs_free(used); + if(info) wbfs_iofree(info); + if(copy_buffer) wbfs_iofree(copy_buffer); + // init with all free blocks + + return retval; +} + +u32 wbfs_rm_disc(wbfs_t *p, u8* discid) +{ + wbfs_disc_t *d = wbfs_open_disc(p,discid); + int i; + int discn = 0; + int disc_info_sz_lba = p->disc_info_sz>>p->hd_sec_sz_s; + if(!d) return 1; + load_freeblocks(p); + discn = d->i; + for( i=0; i< p->n_wbfs_sec_per_disc; i++) + { + u32 iwlba = wbfs_ntohs(d->header->wlba_table[i]); + if (iwlba) free_block(p,iwlba); + } + memset(d->header,0,p->disc_info_sz); + p->write_hdsector(p->callback_data,p->part_lba+1+discn*disc_info_sz_lba,disc_info_sz_lba,d->header); + p->head->disc_table[discn] = 0; + wbfs_close_disc(d); + wbfs_sync(p); + return 0; +} +// trim the file-system to its minimum size +u32 wbfs_trim(wbfs_t *p) +{ + u32 maxbl; + load_freeblocks(p); + maxbl = alloc_block(p); + p->n_hd_sec = maxbl << (p->wbfs_sec_sz_s - p->hd_sec_sz_s); + p->head->n_hd_sec = wbfs_htonl(p->n_hd_sec); + // make all block full + memset(p->freeblks, 0, p->n_wbfs_sec / 8); + wbfs_sync(p); + // os layer will truncate the file. + return maxbl; +} + +// data extraction +u32 wbfs_extract_disc(wbfs_disc_t*d, rw_sector_callback_t write_dst_wii_sector,void *callback_data,progress_callback_t spinner) +{ + wbfs_t *p = d->p; + u8* copy_buffer = 0; + int i; + int src_wbs_nlb = p->wbfs_sec_sz / p->hd_sec_sz; + int dst_wbs_nlb = p->wbfs_sec_sz / p->wii_sec_sz; + copy_buffer = wbfs_ioalloc(p->wbfs_sec_sz); + if (!copy_buffer) ERROR("alloc memory"); + + for(i = 0; i < p->n_wbfs_sec_per_disc; i++) + { + u32 iwlba = wbfs_ntohs(d->header->wlba_table[i]); + if (iwlba) + { + + if(spinner) spinner(i, p->n_wbfs_sec_per_disc, NULL); + p->read_hdsector(p->callback_data, p->part_lba + iwlba * src_wbs_nlb, src_wbs_nlb, copy_buffer); + write_dst_wii_sector(callback_data, i * dst_wbs_nlb, dst_wbs_nlb, copy_buffer); + } + } + wbfs_iofree(copy_buffer); + return 0; +error: + return 1; +} + +u32 wbfs_size_disc(wbfs_t *p,read_wiidisc_callback_t read_src_wii_disc, void *callback_data,partition_selector_t sel, u32 *comp_size, u32 *real_size) +{ + int i; + u32 tot = 0, last = 0; + u32 wii_sec_per_wbfs_sect = 1 << (p->wbfs_sec_sz_s - p->wii_sec_sz_s); + wiidisc_t *d = 0; + + u8 *used =wbfs_malloc(p->n_wii_sec_per_disc); + if(!used) ERROR("unable to alloc memory"); + + d = wd_open_disc(read_src_wii_disc,callback_data); + if(!d) ERROR("unable to open wii disc"); + + wd_build_disc_usage(d, sel, used); + wd_close_disc(d); + d = 0; + + // count total number to write for spinner + for (i = 0; i < p->n_wbfs_sec_per_disc; i++) + { + if (block_used(used, i, wii_sec_per_wbfs_sect)) + { + tot += wii_sec_per_wbfs_sect; + last = i * wii_sec_per_wbfs_sect; + } + } + +error: + if(d) wd_close_disc(d); + if(used) wbfs_free(used); + + *comp_size = tot; + *real_size = last; + + return 0; +} + +// offset is pointing 32bit words to address the whole dvd, although len is in bytes +//int wbfs_disc_read(wbfs_disc_t*d,u32 offset, u8 *data, u32 len) + +// offset points 32bit words, count counts bytes +//int (*read_wiidisc_callback_t)(void*fp,u32 offset,u32 count,void*iobuf); + +// connect wiidisc to wbfs_disc +int read_wiidisc_wbfsdisc(void *fp, u32 offset, u32 count, void *iobuf) +{ + return wbfs_disc_read((wbfs_disc_t *)fp, offset, count, iobuf); +} + +u32 wbfs_extract_file(wbfs_disc_t *d, char *path, void **data) +{ + wiidisc_t *wd = 0; + u32 ret = 0; + + wd = wd_open_disc(read_wiidisc_wbfsdisc, d); + if (!wd) + { + wbfs_error( "opening wbfs disc" ); + return -1; + } + *data = wd_extract_file(wd, &ret, ONLY_GAME_PARTITION, path); + if (!*data) + { + //ERROR("file not found"); + ret = 0; + } + wd_close_disc(wd); + + return ret; +} + +int wbfs_get_fragments(wbfs_disc_t *d, _frag_append_t append_fragment, void *callback_data, u32 hdd_sector_size) +{ + if (!d) return -1; + + wbfs_t *p = d->p; + int src_wbs_nlb = p->wbfs_sec_sz / hdd_sector_size; + int i, ret, last = 0; + for( i=0; i< p->n_wbfs_sec_per_disc; i++) + { + u32 iwlba = wbfs_ntohs(d->header->wlba_table[i]); + if (iwlba) + { + ret = append_fragment(callback_data, + i * src_wbs_nlb, // offset + p->part_lba + iwlba * src_wbs_nlb, // sector + src_wbs_nlb); // count + if (ret) return ret; // error + last = i; + } + } + if (last < p->n_wbfs_sec_per_disc / 2) + last = p->n_wbfs_sec_per_disc / 2; + + u32 size = last * src_wbs_nlb; + append_fragment(callback_data, size, 0, 0); // set size + return 0; +} + +// wrapper for reading .iso files using wbfs apis + +#include <unistd.h> +#include <sys/stat.h> + +// offset is pointing 32bit words to address the whole dvd, although len is in bytes +int wbfs_iso_file_read(wbfs_disc_t*d,u32 offset, u8 *data, u32 len) +{ + if (!d || d->p != &wbfs_iso_file) return -1; + int fd = (int)d->header; //HMM? + //int fd = d->i; + off_t off = ((u64)offset) << 2; + off_t ret_off; + int ret; + ret_off = lseek(fd, off, SEEK_SET); + if (ret_off != off) return -1; + ret = read(fd, data, len); + if (ret != len) return -2; + return 0; +} + + +u32 wbfs_disc_sector_used(wbfs_disc_t *d, u32 *num_blk) +{ + if(!d) return 0; + + if (d->p == &wbfs_iso_file) + { + int fd = (int)d->header; //HMM? + //int fd = d->i; + struct stat st; + if (fstat(fd, &st) == -1) return 0; + if (num_blk) *num_blk = (st.st_size >> 9); // in 512 units + return st.st_blocks; // in 512 units (can be sparse) + } + u32 last_blk = 0; + u32 ret; + ret = wbfs_sector_used2(d->p, d->header, &last_blk); + if (num_blk) *num_blk = last_blk + 1; + return ret; +} diff --git a/source/devicemounter/libwbfs/libwbfs.h b/source/devicemounter/libwbfs/libwbfs.h new file mode 100644 index 00000000..d257ab9a --- /dev/null +++ b/source/devicemounter/libwbfs/libwbfs.h @@ -0,0 +1,239 @@ +#ifndef LIBWBFS_H +#define LIBWBFS_H + +#include "libwbfs_os.h" // this file is provided by the project wanting to compile libwbfs +#include "wiidisc.h" + +#ifdef __cplusplus + extern "C" { +#endif /* __cplusplus */ + +enum { + WBFS_DEVICE_USB = 1, /* USB device */ + WBFS_DEVICE_SDHC /* SDHC device */ +}; + +typedef u32 be32_t; +typedef u16 be16_t; + +extern int wd_last_error; + +typedef struct wbfs_head +{ + be32_t magic; + // parameters copied in the partition for easy dumping, and bug reports + be32_t n_hd_sec; // total number of hd_sec in this partition + u8 hd_sec_sz_s; // sector size in this partition + u8 wbfs_sec_sz_s; // size of a wbfs sec + u8 padding3[2]; + u8 disc_table[0]; // size depends on hd sector size +}__attribute((packed)) wbfs_head_t ; + +typedef struct wbfs_disc_info +{ + u8 disc_header_copy[0x100]; + be16_t wlba_table[0]; +}wbfs_disc_info_t; + +// WBFS first wbfs_sector structure: +// +// ----------- +// | wbfs_head | (hd_sec_sz) +// ----------- +// | | +// | disc_info | +// | | +// ----------- +// | | +// | disc_info | +// | | +// ----------- +// | | +// | ... | +// | | +// ----------- +// | | +// | disc_info | +// | | +// ----------- +// | | +// |freeblk_tbl| +// | | +// ----------- +// + +// callback definition. Return 1 on fatal error (callback is supposed to make retries until no hopes..) +typedef int (*rw_sector_callback_t)(void*fp,u32 lba,u32 count,void*iobuf); +typedef void (*progress_callback_t)(int status,int total,void *user_data); + + +typedef struct wbfs_s +{ + wbfs_head_t *head; + + /* hdsectors, the size of the sector provided by the hosting hard drive */ + u32 hd_sec_sz; + u8 hd_sec_sz_s; // the power of two of the last number + u32 n_hd_sec; // the number of hd sector in the wbfs partition + + /* standard wii sector (0x8000 bytes) */ + u32 wii_sec_sz; + u8 wii_sec_sz_s; + u32 n_wii_sec; + u32 n_wii_sec_per_disc; + + /* The size of a wbfs sector */ + u32 wbfs_sec_sz; + u32 wbfs_sec_sz_s; + u16 n_wbfs_sec; // this must fit in 16 bit! + u16 n_wbfs_sec_per_disc; // size of the lookup table + + u32 part_lba; + /* virtual methods to read write the partition */ + rw_sector_callback_t read_hdsector; + rw_sector_callback_t write_hdsector; + void *callback_data; + + u16 max_disc; + u32 freeblks_lba; + u32 *freeblks; + u16 disc_info_sz; + + u8 *tmp_buffer; // pre-allocated buffer for unaligned read + + u32 n_disc_open; + +}wbfs_t; + +typedef struct wbfs_disc_s +{ + wbfs_t *p; + wbfs_disc_info_t *header; // pointer to wii header + int i; // disc index in the wbfs header (disc_table) +}wbfs_disc_t; + + +#define WBFS_MAGIC (('W'<<24)|('B'<<16)|('F'<<8)|('S')) + +/*! @brief open a MSDOS partitionned harddrive. This tries to find a wbfs partition into the harddrive + @param read_hdsector,write_hdsector: accessors to a harddrive + @hd_sector_size: size of the hd sector. Can be set to zero if the partition in already initialized + @num_hd_sector: number of sectors in this disc. Can be set to zero if the partition in already initialized + @reset: not implemented, This will format the whole harddrive with one wbfs partition that fits the whole disk. + calls wbfs_error() to have textual meaning of errors + @return NULL in case of error +*/ +wbfs_t*wbfs_open_hd(rw_sector_callback_t read_hdsector, + rw_sector_callback_t write_hdsector, + void *callback_data, + int hd_sector_size, int num_hd_sector, int reset); + +/*! @brief open a wbfs partition + @param read_hdsector,write_hdsector: accessors to the partition + @hd_sector_size: size of the hd sector. Can be set to zero if the partition in already initialized + @num_hd_sector: number of sectors in this partition. Can be set to zero if the partition in already initialized + @partition_lba: The partitio offset if you provided accessors to the whole disc. + @reset: initialize the partition with an empty wbfs. + calls wbfs_error() to have textual meaning of errors + @return NULL in case of error +*/ +wbfs_t*wbfs_open_partition(rw_sector_callback_t read_hdsector, + rw_sector_callback_t write_hdsector, + void *callback_data, + int hd_sector_size, int num_hd_sector, u32 partition_lba, int reset); + + +/*! @brief close a wbfs partition, and sync the metadatas to the disc */ +void wbfs_close(wbfs_t*); + +/*! @brief open a disc inside a wbfs partition use a 6 char discid+vendorid + @return NULL if discid is not present +*/ +wbfs_disc_t *wbfs_open_disc(wbfs_t* p, const u8 *diskid); + +/*! @brief close a already open disc inside a wbfs partition */ +void wbfs_close_disc(wbfs_disc_t*d); + +u32 wbfs_sector_used(wbfs_t *p,wbfs_disc_info_t *di); +u32 wbfs_sector_used2(wbfs_t *p,wbfs_disc_info_t *di, u32 *last_blk); + +/*! @brief accessor to the wii disc + @param d: a pointer to already open disc + @param offset: an offset inside the disc, *points 32bit words*, allowing to access 16GB data + @param len: The length of the data to fetch, in *bytes* + */ +// offset is pointing 32bit words to address the whole dvd, although len is in bytes +int wbfs_disc_read(wbfs_disc_t*d,u32 offset, u32 len, u8 *data); + +/*! @return the number of discs inside the paritition */ +u32 wbfs_count_discs(wbfs_t*p); +/*! get the disc info of ith disc inside the partition. It correspond to the first 0x100 bytes of the wiidvd + http://www.wiibrew.org/wiki/Wiidisc#Header + @param i: index of the disc inside the partition + @param header: pointer to 0x100 bytes to write the header + @size: optional pointer to a 32bit word that will get the size in 32bit words of the DVD taken on the partition. +*/ +u32 wbfs_get_disc_info(wbfs_t*p, u32 i,u8 *header,int header_size,u32 *size); + +/*! get the number of used block of the partition. + to be multiplied by p->wbfs_sec_sz (use 64bit multiplication) to have the number in bytes +*/ +u32 wbfs_count_usedblocks(wbfs_t*p); + +/******************* write access ******************/ + +/*! add a wii dvd inside the partition + @param read_src_wii_disc: a callback to access the wii dvd. offsets are in 32bit, len in bytes! + @callback_data: private data passed to the callback + @spinner: a pointer to a function that is regulary called to update a progress bar. + @sel: selects which partitions to copy. + @copy_1_1: makes a 1:1 copy, whenever a game would not use the wii disc format, and some data is hidden outside the filesystem. + */ +u32 wbfs_add_disc(wbfs_t*p,read_wiidisc_callback_t read_src_wii_disc, void *callback_data, + progress_callback_t spinner,void *spinner_data,partition_selector_t sel,int copy_1_1); + + +/*! remove a wiidvd inside a partition */ +u32 wbfs_rm_disc(wbfs_t*p, u8* discid); + + + + + +/*! trim the file-system to its minimum size + This allows to use wbfs as a wiidisc container + */ +u32 wbfs_trim(wbfs_t*p); + +/*! extract a disc from the wbfs, unused sectors are just untouched, allowing descent filesystem to only really usefull space to store the disc. +Even if the filesize is 4.7GB, the disc usage will be less. + */ +u32 wbfs_extract_disc(wbfs_disc_t*d, rw_sector_callback_t write_dst_wii_sector,void *callback_data,progress_callback_t spinner); + +/*! extract a file from the wii disc filesystem. + E.G. Allows to extract the opening.bnr to install a game as a system menu channel + */ +u32 wbfs_extract_file(wbfs_disc_t*d, char *path, void **data); + + +u64 wbfs_estimate_disc(wbfs_t *p, read_wiidisc_callback_t read_src_wii_disc, void *callback_data, partition_selector_t sel); + +// remove some sanity checks +void wbfs_set_force_mode(int force); + +u32 wbfs_size_disc(wbfs_t*p,read_wiidisc_callback_t read_src_wii_disc, + void *callback_data,partition_selector_t sel, + u32 *comp_size, u32 *real_size); + +typedef int (*_frag_append_t)(void *ff, u32 offset, u32 sector, u32 count); +int wbfs_get_fragments(wbfs_disc_t *d, _frag_append_t append_fragment, void *callback_data, u32 hdd_sector_size); + +extern wbfs_t wbfs_iso_file; +u32 wbfs_disc_sector_used(wbfs_disc_t *d, u32 *num_blk); +int wbfs_iso_file_read(wbfs_disc_t*d,u32 offset, u8 *data, u32 len); + +#ifdef __cplusplus + } +#endif /* __cplusplus */ + +#endif diff --git a/source/devicemounter/libwbfs/libwbfs_os.h b/source/devicemounter/libwbfs/libwbfs_os.h new file mode 100644 index 00000000..a4a86fe4 --- /dev/null +++ b/source/devicemounter/libwbfs/libwbfs_os.h @@ -0,0 +1,37 @@ +#ifndef LIBWBFS_GLUE_H +#define LIBWBFS_GLUE_H + +#include <gctypes.h> +#include "utils.h" +#include "mem2.hpp" + +#define debug_printf(fmt, ...); + +#include <stdio.h> +#define wbfs_fatal(x) do { wd_last_error = 1; } while(0) +#define wbfs_error(x) do { wd_last_error = 2; } while(0) + +#include <stdlib.h> +#include <malloc.h> + +#define wbfs_malloc(x) MEM2_alloc(x) +#define wbfs_free(x) SAFE_FREE(x) + +#define wbfs_ioalloc(x) MEM2_alloc(((x) + 31) & ~31) +#define wbfs_iofree(x) SAFE_FREE(x) + +#define wbfs_be16(x) (*((u16*)(x))) +#define wbfs_be32(x) (*((u32*)(x))) +#define wbfs_ntohl(x) (x) +#define wbfs_htonl(x) (x) +#define wbfs_ntohs(x) (x) +#define wbfs_htons(x) (x) + +#include <string.h> + +#define wbfs_memcmp(x,y,z) memcmp(x,y,z) +#define wbfs_memcpy(x,y,z) memcpy(x,y,z) +#define wbfs_memset(x,y,z) memset(x,y,z) + + +#endif diff --git a/source/devicemounter/libwbfs/rijndael.c b/source/devicemounter/libwbfs/rijndael.c new file mode 100644 index 00000000..de91e96a --- /dev/null +++ b/source/devicemounter/libwbfs/rijndael.c @@ -0,0 +1,432 @@ +/* Rijndael Block Cipher - rijndael.c + + Written by Mike Scott 21st April 1999 + mike@compapp.dcu.ie + + Permission for free direct or derivative use is granted subject + to compliance with any conditions that the originators of the + algorithm place on its exploitation. + + */ + +#include <stdio.h> +#include <string.h> + +#define u8 unsigned char /* 8 bits */ +#define u32 unsigned long /* 32 bits */ +#define u64 unsigned long long + +/* rotates x one bit to the left */ + +#define ROTL(x) (((x)>>7)|((x)<<1)) + +/* Rotates 32-bit word left by 1, 2 or 3 byte */ + +#define ROTL8(x) (((x)<<8)|((x)>>24)) +#define ROTL16(x) (((x)<<16)|((x)>>16)) +#define ROTL24(x) (((x)<<24)|((x)>>8)) + +/* Fixed Data */ + +static u8 InCo[4] = { 0xB, 0xD, 0x9, 0xE }; /* Inverse Coefficients */ + +static u8 fbsub[256]; +static u8 rbsub[256]; +static u8 ptab[256], ltab[256]; +static u32 ftable[256]; +static u32 rtable[256]; +static u32 rco[30]; + +/* Parameter-dependent data */ + +int Nk, Nb, Nr; +u8 fi[24], ri[24]; +u32 fkey[120]; +u32 rkey[120]; + +static u32 pack(u8 *b) +{ /* pack bytes into a 32-bit Word */ + return ((u32 ) b[3] << 24) | ((u32 ) b[2] << 16) | ((u32 ) b[1] << 8) | (u32 ) b[0]; +} + +static void unpack(u32 a, u8 *b) +{ /* unpack bytes from a word */ + b[0] = (u8 ) a; + b[1] = (u8 ) (a >> 8); + b[2] = (u8 ) (a >> 16); + b[3] = (u8 ) (a >> 24); +} + +static u8 xtime(u8 a) +{ + u8 b; + if (a & 0x80) + b = 0x1B; + else b = 0; + a <<= 1; + a ^= b; + return a; +} + +static u8 bmul(u8 x, u8 y) +{ /* x.y= AntiLog(Log(x) + Log(y)) */ + if (x && y) + return ptab[(ltab[x] + ltab[y]) % 255]; + else return 0; +} + +static u32 SubByte(u32 a) +{ + u8 b[4]; + unpack(a, b); + b[0] = fbsub[b[0]]; + b[1] = fbsub[b[1]]; + b[2] = fbsub[b[2]]; + b[3] = fbsub[b[3]]; + return pack(b); +} + +static u8 product(u32 x, u32 y) +{ /* dot product of two 4-byte arrays */ + u8 xb[4], yb[4]; + unpack(x, xb); + unpack(y, yb); + return bmul(xb[0], yb[0]) ^ bmul(xb[1], yb[1]) ^ bmul(xb[2], yb[2]) ^ bmul(xb[3], yb[3]); +} + +static u32 InvMixCol(u32 x) +{ /* matrix Multiplication */ + u32 y, m; + u8 b[4]; + + m = pack(InCo); + b[3] = product(m, x); + m = ROTL24( m ); + b[2] = product(m, x); + m = ROTL24( m ); + b[1] = product(m, x); + m = ROTL24( m ); + b[0] = product(m, x); + y = pack(b); + return y; +} + +u8 ByteSub(u8 x) +{ + u8 y = ptab[255 - ltab[x]]; /* multiplicative inverse */ + x = y; + x = ROTL( x ); + y ^= x; + x = ROTL( x ); + y ^= x; + x = ROTL( x ); + y ^= x; + x = ROTL( x ); + y ^= x; + y ^= 0x63; + return y; +} + +void gentables(void) +{ /* generate tables */ + int i; + u8 y, b[4]; + + /* use 3 as primitive root to generate power and log tables */ + + ltab[0] = 0; + ptab[0] = 1; + ltab[1] = 0; + ptab[1] = 3; + ltab[3] = 1; + for (i = 2; i < 256; i++) + { + ptab[i] = ptab[i - 1] ^ xtime(ptab[i - 1]); + ltab[ptab[i]] = i; + } + + /* affine transformation:- each bit is xored with itself shifted one bit */ + + fbsub[0] = 0x63; + rbsub[0x63] = 0; + for (i = 1; i < 256; i++) + { + y = ByteSub((u8 ) i); + fbsub[i] = y; + rbsub[y] = i; + } + + for (i = 0, y = 1; i < 30; i++) + { + rco[i] = y; + y = xtime(y); + } + + /* calculate forward and reverse tables */ + for (i = 0; i < 256; i++) + { + y = fbsub[i]; + b[3] = y ^ xtime(y); + b[2] = y; + b[1] = y; + b[0] = xtime(y); + ftable[i] = pack(b); + + y = rbsub[i]; + b[3] = bmul(InCo[0], y); + b[2] = bmul(InCo[1], y); + b[1] = bmul(InCo[2], y); + b[0] = bmul(InCo[3], y); + rtable[i] = pack(b); + } +} + +void gkey(int nb, int nk, char *key) +{ /* blocksize=32*nb bits. Key=32*nk bits */ + /* currently nb,bk = 4, 6 or 8 */ + /* key comes as 4*Nk bytes */ + /* Key Scheduler. Create expanded encryption key */ + int i, j, k, m, N; + int C1, C2, C3; + u32 CipherKey[8]; + + Nb = nb; + Nk = nk; + + /* Nr is number of rounds */ + if (Nb >= Nk) + Nr = 6 + Nb; + else Nr = 6 + Nk; + + C1 = 1; + if (Nb < 8) + { + C2 = 2; + C3 = 3; + } + else + { + C2 = 3; + C3 = 4; + } + + /* pre-calculate forward and reverse increments */ + for (m = j = 0; j < nb; j++, m += 3) + { + fi[m] = (j + C1) % nb; + fi[m + 1] = (j + C2) % nb; + fi[m + 2] = (j + C3) % nb; + ri[m] = (nb + j - C1) % nb; + ri[m + 1] = (nb + j - C2) % nb; + ri[m + 2] = (nb + j - C3) % nb; + } + + N = Nb * (Nr + 1); + + for (i = j = 0; i < Nk; i++, j += 4) + { + CipherKey[i] = pack((u8 *) &key[j]); + } + for (i = 0; i < Nk; i++) + fkey[i] = CipherKey[i]; + for (j = Nk, k = 0; j < N; j += Nk, k++) + { + fkey[j] = fkey[j - Nk] ^ SubByte(ROTL24( fkey[j-1] )) ^ rco[k]; + if (Nk <= 6) + { + for (i = 1; i < Nk && (i + j) < N; i++) + fkey[i + j] = fkey[i + j - Nk] ^ fkey[i + j - 1]; + } + else + { + for (i = 1; i < 4 && (i + j) < N; i++) + fkey[i + j] = fkey[i + j - Nk] ^ fkey[i + j - 1]; + if ((j + 4) < N) fkey[j + 4] = fkey[j + 4 - Nk] ^ SubByte(fkey[j + 3]); + for (i = 5; i < Nk && (i + j) < N; i++) + fkey[i + j] = fkey[i + j - Nk] ^ fkey[i + j - 1]; + } + + } + + /* now for the expanded decrypt key in reverse order */ + + for (j = 0; j < Nb; j++) + rkey[j + N - Nb] = fkey[j]; + for (i = Nb; i < N - Nb; i += Nb) + { + k = N - Nb - i; + for (j = 0; j < Nb; j++) + rkey[k + j] = InvMixCol(fkey[i + j]); + } + for (j = N - Nb; j < N; j++) + rkey[j - N + Nb] = fkey[j]; +} + +/* There is an obvious time/space trade-off possible here. * + * Instead of just one ftable[], I could have 4, the other * + * 3 pre-rotated to save the ROTL8, ROTL16 and ROTL24 overhead */ + +void encrypt(char *buff) +{ + int i, j, k, m; + u32 a[8], b[8], *x, *y, *t; + + for (i = j = 0; i < Nb; i++, j += 4) + { + a[i] = pack((u8 *) &buff[j]); + a[i] ^= fkey[i]; + } + k = Nb; + x = a; + y = b; + + /* State alternates between a and b */ + for (i = 1; i < Nr; i++) + { /* Nr is number of rounds. May be odd. */ + + /* if Nb is fixed - unroll this next + loop and hard-code in the values of fi[] */ + + for (m = j = 0; j < Nb; j++, m += 3) + { /* deal with each 32-bit element of the State */ + /* This is the time-critical bit */ + y[j] = fkey[k++] ^ ftable[(u8 ) x[j]] ^ ROTL8( ftable[( u8 )( x[fi[m]] >> 8 )] ) + ^ ROTL16( ftable[( u8 )( x[fi[m+1]] >> 16 )] ) ^ ROTL24( ftable[x[fi[m+2]] >> 24] ); + } + t = x; + x = y; + y = t; /* swap pointers */ + } + + /* Last Round - unroll if possible */ + for (m = j = 0; j < Nb; j++, m += 3) + { + y[j] = fkey[k++] ^ (u32 ) fbsub[(u8 ) x[j]] ^ ROTL8( ( u32 )fbsub[( u8 )( x[fi[m]] >> 8 )] ) + ^ ROTL16( ( u32 )fbsub[( u8 )( x[fi[m+1]] >> 16 )] ) ^ ROTL24( ( u32 )fbsub[x[fi[m+2]] >> 24] ); + } + for (i = j = 0; i < Nb; i++, j += 4) + { + unpack(y[i], (u8 *) &buff[j]); + x[i] = y[i] = 0; /* clean up stack */ + } + return; +} + +void decrypt(char *buff) +{ + int i, j, k, m; + u32 a[8], b[8], *x, *y, *t; + + for (i = j = 0; i < Nb; i++, j += 4) + { + a[i] = pack((u8 *) &buff[j]); + a[i] ^= rkey[i]; + } + k = Nb; + x = a; + y = b; + + /* State alternates between a and b */ + for (i = 1; i < Nr; i++) + { /* Nr is number of rounds. May be odd. */ + + /* if Nb is fixed - unroll this next + loop and hard-code in the values of ri[] */ + + for (m = j = 0; j < Nb; j++, m += 3) + { /* This is the time-critical bit */ + y[j] = rkey[k++] ^ rtable[(u8 ) x[j]] ^ ROTL8( rtable[( u8 )( x[ri[m]] >> 8 )] ) + ^ ROTL16( rtable[( u8 )( x[ri[m+1]] >> 16 )] ) ^ ROTL24( rtable[x[ri[m+2]] >> 24] ); + } + t = x; + x = y; + y = t; /* swap pointers */ + } + + /* Last Round - unroll if possible */ + for (m = j = 0; j < Nb; j++, m += 3) + { + y[j] = rkey[k++] ^ (u32 ) rbsub[(u8 ) x[j]] ^ ROTL8( ( u32 )rbsub[( u8 )( x[ri[m]] >> 8 )] ) + ^ ROTL16( ( u32 )rbsub[( u8 )( x[ri[m+1]] >> 16 )] ) ^ ROTL24( ( u32 )rbsub[x[ri[m+2]] >> 24] ); + } + for (i = j = 0; i < Nb; i++, j += 4) + { + unpack(y[i], (u8 *) &buff[j]); + x[i] = y[i] = 0; /* clean up stack */ + } + return; +} + +void aes_set_key(u8 *key) +{ + gentables(); + gkey(4, 4, (char*) key); +} + +// CBC mode decryption +void aes_decrypt(u8 *iv, u8 *inbuf, u8 *outbuf, unsigned long long len) +{ + u8 block[16]; + unsigned int blockno = 0, i; + + //printf("aes_decrypt(%p, %p, %p, %lld)\n", iv, inbuf, outbuf, len); + + for (blockno = 0; blockno <= (len / sizeof(block)); blockno++) + { + unsigned int fraction; + if (blockno == (len / sizeof(block))) // last block + { + fraction = len % sizeof(block); + if (fraction == 0) break; + memset(block, 0, sizeof(block)); + } + else fraction = 16; + + // debug_printf("block %d: fraction = %d\n", blockno, fraction); + memcpy(block, inbuf + blockno * sizeof(block), fraction); + decrypt((char*) block); + u8 *ctext_ptr; + if (blockno == 0) + ctext_ptr = iv; + else ctext_ptr = inbuf + (blockno - 1) * sizeof(block); + + for (i = 0; i < fraction; i++) + outbuf[blockno * sizeof(block) + i] = ctext_ptr[i] ^ block[i]; + // debug_printf("Block %d output: ", blockno); + // hexdump(outbuf + blockno*sizeof(block), 16); + } +} + +// CBC mode encryption +void aes_encrypt(u8 *iv, u8 *inbuf, u8 *outbuf, unsigned long long len) +{ + u8 block[16]; + unsigned int blockno = 0, i; + + // debug_printf("aes_decrypt(%p, %p, %p, %lld)\n", iv, inbuf, outbuf, len); + + for (blockno = 0; blockno <= (len / sizeof(block)); blockno++) + { + unsigned int fraction; + if (blockno == (len / sizeof(block))) // last block + { + fraction = len % sizeof(block); + if (fraction == 0) break; + memset(block, 0, sizeof(block)); + } + else fraction = 16; + + // debug_printf("block %d: fraction = %d\n", blockno, fraction); + memcpy(block, inbuf + blockno * sizeof(block), fraction); + + for (i = 0; i < fraction; i++) + block[i] = inbuf[blockno * sizeof(block) + i] ^ iv[i]; + + encrypt((char*) block); + memcpy(iv, block, sizeof(block)); + memcpy(outbuf + blockno * sizeof(block), block, sizeof(block)); + // debug_printf("Block %d output: ", blockno); + // hexdump(outbuf + blockno*sizeof(block), 16); + } +} + diff --git a/source/devicemounter/libwbfs/wiidisc.c b/source/devicemounter/libwbfs/wiidisc.c new file mode 100644 index 00000000..c3de5d5f --- /dev/null +++ b/source/devicemounter/libwbfs/wiidisc.c @@ -0,0 +1,370 @@ +// Copyright 2009 Kwiirk based on negentig.c: +// Copyright 2007,2008 Segher Boessenkool <segher@kernel.crashing.org> +// Licensed under the terms of the GNU GPL, version 2 +// http://www.gnu.org/licenses/old-licenses/gpl-2.0.txt + +#include "wiidisc.h" + +void aes_set_key(u8 *key); +void aes_decrypt(u8 *iv, u8 *inbuf, u8 *outbuf, unsigned long long len); + +int wd_last_error = 0; + +int wd_get_last_error(void) +{ + return wd_last_error; +} + +static void _decrypt_title_key(u8 *tik, u8 *title_key) +{ + u8 common_key[16] = { + 0xeb, 0xe4, 0x2a, 0x22, 0x5e, 0x85, 0x93, 0xe4, + 0x48, 0xd9, 0xc5, 0x45, 0x73, 0x81, 0xaa, 0xf7 + }; + + u8 iv[16]; + + wbfs_memset(iv, 0, sizeof iv); + wbfs_memcpy(iv, tik + 0x01dc, 8); + aes_set_key(common_key); + //_aes_cbc_dec(common_key, iv, tik + 0x01bf, 16, title_key); + aes_decrypt(iv, tik + 0x01bf, title_key, 16); +} +static u32 _be32(const u8 *p) +{ + return (p[0] << 24) | (p[1] << 16) | (p[2] << 8) | p[3]; +} + +static void disc_read(wiidisc_t *d, u32 offset, u8 *data, u32 len) +{ + if (data) + { + int ret = 0; + if (len == 0) return; + ret = d->read(d->fp, offset, len, data); + if (ret) wbfs_fatal("error reading disc"); + } + if (d->sector_usage_table) + { + u32 blockno = offset >> 13; + do + { + d->sector_usage_table[blockno] = 1; + blockno += 1; + if (len > 0x8000) len -= 0x8000; + } while(len > 0x8000); + } +} + +static void partition_raw_read(wiidisc_t *d, u32 offset, u8 *data, u32 len) +{ + disc_read(d, d->partition_raw_offset + offset, data, len); +} + +static void partition_read_block(wiidisc_t *d, u32 blockno, u8 *block) +{ + u8*raw = d->tmp_buffer; + u8 iv[16]; + u32 offset; + if (d->sector_usage_table) d->sector_usage_table[d->partition_block+blockno] = 1; + offset = d->partition_data_offset + ((0x8000 >> 2) * blockno); + partition_raw_read(d,offset, raw, 0x8000); + + // decrypt data + memcpy(iv, raw + 0x3d0, 16); + aes_set_key(d->disc_key); + aes_decrypt(iv, raw + 0x400, block, 0x7c00); +} + +static void partition_read(wiidisc_t *d, u32 offset, u8 *data, u32 len, int fake) +{ + u8 *block = d->tmp_buffer2; + u32 offset_in_block; + u32 len_in_block; + if (fake && d->sector_usage_table == 0) return; + + while (len) + { + offset_in_block = offset % (0x7c00 >> 2); + len_in_block = 0x7c00 - (offset_in_block << 2); + if (len_in_block > len) len_in_block = len; + if (!fake) + { + partition_read_block(d,offset / (0x7c00 >> 2), block); + wbfs_memcpy(data, block + (offset_in_block << 2), len_in_block); + } + else d->sector_usage_table[d->partition_block + (offset / (0x7c00 >> 2))] = 1; + data += len_in_block; + offset += len_in_block >> 2; + len -= len_in_block; + } +} + +static u32 do_fst(wiidisc_t *d, u8 *fst, const char *names, u32 i) +{ + u32 offset; + u32 size; + const char *name; + u32 j; + + name = names + (_be32(fst + 12 * i) & 0x00ffffff); + size = _be32(fst + 12 * i + 8); + + if (i == 0) + { + for (j = 1; j < size && !d->extracted_buffer; ) + j = do_fst(d, fst, names, j); + return size; + } + //printf("name %s\n",name); + + if (fst[12 * i]) + { + for (j = i + 1; j < size && !d->extracted_buffer; ) + j = do_fst(d, fst, names, j); + + return size; + } + else + { + offset = _be32(fst + 12 * i + 4); + if (d->extract_pathname && strcasecmp(name, d->extract_pathname) == 0) + { + d->extracted_buffer = wbfs_ioalloc(size); + if (d->extracted_buffer != 0) + { + d->extracted_size = size; + partition_read(d, offset, d->extracted_buffer, size, 0); + } + } + else partition_read(d, offset, 0, size, 1); + return i + 1; + } +} + +static void do_files(wiidisc_t*d) +{ + u8 *b = wbfs_ioalloc(0x480); // XXX: determine actual header size + u32 dol_offset; + u32 fst_offset; + u32 fst_size; + u32 apl_offset; + u32 apl_size; + u8 *apl_header = wbfs_ioalloc(0x20); + u8 *fst; + u32 n_files; + partition_read(d, 0, b, 0x480, 0); + + dol_offset = _be32(b + 0x0420); + fst_offset = _be32(b + 0x0424); + fst_size = _be32(b + 0x0428) << 2; + + apl_offset = 0x2440 >> 2; + partition_read(d, apl_offset, apl_header, 0x20, 0); + apl_size = 0x20 + _be32(apl_header + 0x14) + _be32(apl_header + 0x18); + // fake read dol and partition + if (apl_size) partition_read(d, apl_offset, 0, apl_size, 1); + partition_read(d, dol_offset, 0, (fst_offset - dol_offset) << 2, 1); + + if (fst_size) + { + fst = wbfs_ioalloc(fst_size); + if (fst == 0) wbfs_fatal("malloc fst"); + partition_read(d, fst_offset, fst, fst_size,0); + n_files = _be32(fst + 8); + + + if (d->extract_pathname && strcmp(d->extract_pathname, "FST") == 0) + { + // if empty pathname requested return fst + d->extracted_buffer = fst; + d->extracted_size = fst_size; + d->extract_pathname = NULL; + // skip do_fst if only fst requested + n_files = 0; + } + + if (12 * n_files <= fst_size) + if (n_files > 1) do_fst(d, fst, (char *)fst + 12 * n_files, 0); + + if (fst != d->extracted_buffer) wbfs_iofree( fst ); + } + wbfs_iofree(b); + wbfs_iofree(apl_header); +} + +static void do_partition(wiidisc_t*d) +{ + u8 *tik = wbfs_ioalloc(0x2a4); + u8 *b = wbfs_ioalloc(0x1c); + u64 tmd_offset; + u32 tmd_size; + u8 *tmd; + u64 cert_offset; + u32 cert_size; + u8 *cert; + u64 h3_offset; + + // read ticket, and read some offsets and sizes + partition_raw_read(d, 0, tik, 0x2a4); + partition_raw_read(d, 0x2a4 >> 2, b, 0x1c); + + tmd_size = _be32(b); + tmd_offset = _be32(b + 4); + cert_size = _be32(b + 8); + cert_offset = _be32(b + 0x0c); + h3_offset = _be32(b + 0x10); + d->partition_data_offset = _be32(b + 0x14); + d->partition_block = (d->partition_raw_offset + d->partition_data_offset) >> 13; + tmd = wbfs_ioalloc(tmd_size); + if (tmd == 0) wbfs_fatal("malloc tmd"); + partition_raw_read(d, tmd_offset, tmd, tmd_size); + + if(d->extract_pathname && strcmp(d->extract_pathname, "TMD") == 0 && !d->extracted_buffer) + { + d->extracted_buffer = tmd; + d->extracted_size = tmd_size; + } + + cert = wbfs_ioalloc(cert_size); + if (cert == 0) wbfs_fatal("malloc cert"); + partition_raw_read(d, cert_offset, cert, cert_size); + + _decrypt_title_key(tik, d->disc_key); + + partition_raw_read(d, h3_offset, 0, 0x18000); + + wbfs_iofree(b); + wbfs_iofree(tik); + wbfs_iofree(cert); + if(tmd != d->extracted_buffer) + wbfs_iofree( tmd ); + + do_files(d); + +} +static int test_parition_skip(u32 partition_type, partition_selector_t part_sel) +{ + switch(part_sel) + { + case ALL_PARTITIONS: + return 0; + case REMOVE_UPDATE_PARTITION: + return (partition_type == 1); + case ONLY_GAME_PARTITION: + return (partition_type != 0); + default: + return (partition_type != part_sel); + } +} +static void do_disc(wiidisc_t *d) +{ + u8 *b = wbfs_ioalloc(0x100); + u64 partition_offset[32]; // XXX: don't know the real maximum + u64 partition_type[32]; // XXX: don't know the real maximum + u32 n_partitions; + u32 magic; + u32 i; + disc_read(d, 0, b, 0x100); + magic = _be32(b + 24); + if (magic != 0x5D1C9EA3) + { + wbfs_iofree(b); + wbfs_error("not a wii disc"); + return ; + } + disc_read(d, 0x40000 >> 2, b, 0x100); + n_partitions = _be32(b); + disc_read(d, _be32(b + 4), b, 0x100); + for (i = 0; i < n_partitions; i++) + { + partition_offset[i] = _be32(b + 8 * i); + partition_type[i] = _be32(b + 8 * i + 4); + } + for (i = 0; i < n_partitions; i++) + { + d->partition_raw_offset = partition_offset[i]; + if (!test_parition_skip(partition_type[i], d->part_sel)) do_partition(d); + } + wbfs_iofree(b); +} + +wiidisc_t *wd_open_disc(read_wiidisc_callback_t read, void *fp) +{ + wiidisc_t *d = wbfs_malloc(sizeof (wiidisc_t)); + if (!d) return 0; + wbfs_memset(d, 0, sizeof (wiidisc_t)); + d->read = read; + d->fp = fp; + d->part_sel = ALL_PARTITIONS; + d->tmp_buffer = wbfs_ioalloc(0x8000); + d->tmp_buffer2 = wbfs_malloc(0x8000); + return d; +} + +void wd_close_disc(wiidisc_t *d) +{ + wbfs_iofree(d->tmp_buffer); + wbfs_free(d->tmp_buffer2); + wbfs_free(d); +} + +// returns a buffer allocated with wbfs_ioalloc() or NULL if not found of alloc error +// XXX pathname not implemented. files are extracted by their name. +// first file found with that name is returned. +u8 *wd_extract_file(wiidisc_t *d, u32 *size, partition_selector_t partition_type, const char *pathname) +{ + u8 *retval = 0; + d->extract_pathname = pathname; + d->extracted_buffer = 0; + d->part_sel = partition_type; + do_disc(d); + d->extract_pathname = 0; + d->part_sel = ALL_PARTITIONS; + retval = d->extracted_buffer; + if (size != 0) + *size = d->extracted_size; + d->extracted_buffer = 0; + d->extracted_size = 0; + return retval; +} + +void wd_build_disc_usage(wiidisc_t *d, partition_selector_t selector, u8 *usage_table) +{ + d->sector_usage_table = usage_table; + wbfs_memset(usage_table, 0, 143432 * 2); + d->part_sel = selector; + do_disc(d); + d->part_sel = ALL_PARTITIONS; + d->sector_usage_table = 0; +} + +void wd_fix_partition_table(wiidisc_t *d, partition_selector_t selector, u8 *partition_table) +{ + u8 *b = partition_table; + u32 partition_offset; + u32 partition_type; + u32 n_partitions, i, j; + u32 *b32; + if (selector == ALL_PARTITIONS) return; + n_partitions = _be32(b); + if (_be32(b + 4) - (0x40000 >> 2) > 0x50) + wbfs_fatal("cannot modify this partition table. Please report the bug."); + + b += (_be32(b + 4) - (0x40000 >> 2)) * 4; + j = 0; + for (i = 0; i < n_partitions; i++) + { + partition_offset = _be32(b + 8 * i); + partition_type = _be32(b + 8 * i + 4); + if (!test_parition_skip(partition_type, selector)) + { + b32 = (u32*)(b + 8 * j); + b32[0] = wbfs_htonl(partition_offset); + b32[1] = wbfs_htonl(partition_type); + j++; + } + } + b32 = (u32 *)(partition_table); + *b32 = wbfs_htonl(j); +} diff --git a/source/devicemounter/libwbfs/wiidisc.h b/source/devicemounter/libwbfs/wiidisc.h new file mode 100644 index 00000000..f3591073 --- /dev/null +++ b/source/devicemounter/libwbfs/wiidisc.h @@ -0,0 +1,67 @@ +#ifndef WIIDISC_H +#define WIIDISC_H +#include <stdio.h> +#include "libwbfs_os.h" // this file is provided by the project wanting to compile libwbfs and wiidisc + +#ifdef __cplusplus +extern "C" +{ +#endif /* __cplusplus */ + + // callback definition. Return 1 on fatal error (callback is supposed to make retries until no hopes..) + // offset points 32bit words, count counts bytes + typedef int (*read_wiidisc_callback_t)(void *fp, u32 offset, u32 count, void *iobuf); + + typedef enum + { + UPDATE_PARTITION_TYPE = 0, + GAME_PARTITION_TYPE, + OTHER_PARTITION_TYPE, + // value in between selects partition types of that value + ALL_PARTITIONS = 0xffffffff - 3, + REMOVE_UPDATE_PARTITION, // keeps game + channel installers + ONLY_GAME_PARTITION, + } partition_selector_t; + + typedef struct wiidisc_s + { + read_wiidisc_callback_t read; + void *fp; + u8 *sector_usage_table; + + // everything points 32bit words. + u32 disc_raw_offset; + u32 partition_raw_offset; + u32 partition_data_offset; + u32 partition_data_size; + u32 partition_block; + + u8 *tmp_buffer; + u8 *tmp_buffer2; + u8 disc_key[16]; + int dont_decrypt; + + partition_selector_t part_sel; + + const char *extract_pathname; + u8 *extracted_buffer; + u32 extracted_size; + void *user_data; + } wiidisc_t; + + int wd_get_last_error(void); + + wiidisc_t *wd_open_disc(read_wiidisc_callback_t read, void *fp); + void wd_close_disc(wiidisc_t *); + // returns a buffer allocated with wbfs_ioalloc() or NULL if not found of alloc error + u8 * wd_extract_file(wiidisc_t *d, u32 *size, partition_selector_t partition_type, const char *pathname); + void wd_build_disc_usage(wiidisc_t *d, partition_selector_t selector, u8 *usage_table); + + // effectively remove not copied partition from the partition table. + void wd_fix_partition_table(wiidisc_t *d, partition_selector_t selector, u8 *partition_table); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif diff --git a/source/devicemounter/sdhc.c b/source/devicemounter/sdhc.c new file mode 100644 index 00000000..d7acd5d0 --- /dev/null +++ b/source/devicemounter/sdhc.c @@ -0,0 +1,228 @@ +#include <stdio.h> +#include <unistd.h> +#include <string.h> +#include <ogcsys.h> +#include <sdcard/wiisd_io.h> + +#include "sdhc.h" + +/* IOCTL comamnds */ +#define IOCTL_SDHC_INIT 0x01 +#define IOCTL_SDHC_READ 0x02 +#define IOCTL_SDHC_WRITE 0x03 +#define IOCTL_SDHC_ISINSERTED 0x04 + +#define SDHC_HEAPSIZE 0x8000 +#define SDHC_MEM2_SIZE 0x10000 + +int sdhc_mode_sd = 0; +int sdhc_inited = 0; + +/* Variables */ +static char fs[] ATTRIBUTE_ALIGN(32) = "/dev/sdio/sdhc"; + +static s32 hid = -1, fd = -1; +static u32 sector_size = SDHC_SECTOR_SIZE; +static void *sdhc_buf2; + +extern void* SYS_AllocArena2MemLo(u32 size,u32 align); + +bool SDHC_Init(void) +{ + s32 ret; + + if (sdhc_inited) return true; + + if (sdhc_mode_sd) + { + sdhc_inited = __io_wiisd.startup(); + return sdhc_inited; + } + + /* Already open */ + if (fd >= 0) return true; + + /* Create heap */ + if (hid < 0) hid = iosCreateHeap(SDHC_HEAPSIZE); + if (hid < 0) goto err; + + // allocate buf2 + if (sdhc_buf2 == NULL) + { + sdhc_buf2 = SYS_AllocArena2MemLo(SDHC_MEM2_SIZE, 32); + if (sdhc_buf2 == NULL) goto err; + } + + /* Open SDHC device */ + fd = IOS_Open(fs, 0); + if (fd < 0) goto err; + + /* Initialize SDHC */ + ret = IOS_IoctlvFormat(hid, fd, IOCTL_SDHC_INIT, ":"); + if (ret) goto err; + + sdhc_inited = 1; + return true; + +err: + /* Close SDHC device */ + if (fd >= 0) + { + IOS_Close(fd); + fd = -1; + } + + return false; +} + +bool SDHC_Close(void) +{ + sdhc_inited = 0; + if (sdhc_mode_sd) { + return __io_wiisd.shutdown(); + } + + /* Close SDHC device */ + if (fd >= 0) { + IOS_Close(fd); + fd = -1; + } + + return true; +} + +bool SDHC_IsInserted(void) +{ + s32 ret; + if (sdhc_mode_sd) { + return __io_wiisd.isInserted(); + } + + /* Check if SD card is inserted */ + ret = IOS_IoctlvFormat(hid, fd, IOCTL_SDHC_ISINSERTED, ":"); + + return (!ret) ? true : false; +} + +bool SDHC_ReadSectors(u32 sector, u32 count, void *buffer) +{ + if (sdhc_mode_sd) + return __io_wiisd.readSectors(sector, count, buffer); + + u32 size; + s32 ret = -1; + + /* Device not opened */ + if (fd < 0) + return false; + + /* Buffer not aligned */ + if ((u32)buffer & 0x1F) + { + if (!sdhc_buf2) + return false; + + int cnt; + int max_sec = SDHC_MEM2_SIZE / sector_size; + //dbg_printf("sdhc_read(%u,%u) unaligned(%p)\n", sector, count, buffer); + while (count) + { + if (count > max_sec) + cnt = max_sec; + else + cnt = count; + + size = cnt * sector_size; + ret = IOS_IoctlvFormat(hid, fd, IOCTL_SDHC_READ, + "ii:d", sector, cnt, sdhc_buf2, size); + + if (ret) + return false; + + memcpy(buffer, sdhc_buf2, size); + count -= cnt; + sector += cnt; + buffer += size; + } + } + else + { + size = sector_size * count; + /* Read data */ + ret = IOS_IoctlvFormat(hid, fd, IOCTL_SDHC_READ, "ii:d", sector, count, buffer, size); + } + + return (!ret) ? true : false; +} + +bool SDHC_WriteSectors(u32 sector, u32 count, void *buffer) +{ + if (sdhc_mode_sd) + return __io_wiisd.writeSectors(sector, count, buffer); + + u32 size; + s32 ret = -1; + + /* Device not opened */ + if (fd < 0) + return false; + + /* Buffer not aligned */ + if ((u32)buffer & 0x1F) + { + if (!sdhc_buf2) + return false; + + int cnt; + int max_sec = SDHC_MEM2_SIZE / sector_size; + + while (count) + { + if (count > max_sec) + cnt = max_sec; + else + cnt = count; + + size = cnt * sector_size; + memcpy(sdhc_buf2, buffer, size); + ret = IOS_IoctlvFormat(hid, fd, IOCTL_SDHC_WRITE, "ii:d", sector, cnt, sdhc_buf2, size); + + if (ret) + return false; + + count -= cnt; + sector += cnt; + buffer += size; + } + } + else + { + size = sector_size * count; + /* Read data */ + ret = IOS_IoctlvFormat(hid, fd, IOCTL_SDHC_WRITE, "ii:d", sector, count, buffer, size); + } + + return (!ret) ? true : false; +} + +bool SDHC_ClearStatus(void) +{ + return true; +} + +bool __io_SDHC_Close(void) +{ + return true; +} + +const DISC_INTERFACE __io_sdhc = { + DEVICE_TYPE_WII_SD, + FEATURE_MEDIUM_CANREAD | FEATURE_MEDIUM_CANWRITE | FEATURE_WII_SD, + (FN_MEDIUM_STARTUP)&SDHC_Init, + (FN_MEDIUM_ISINSERTED)&SDHC_IsInserted, + (FN_MEDIUM_READSECTORS)&SDHC_ReadSectors, + (FN_MEDIUM_WRITESECTORS)&SDHC_WriteSectors, + (FN_MEDIUM_CLEARSTATUS)&SDHC_ClearStatus, + //(FN_MEDIUM_SHUTDOWN)&SDHC_Close + (FN_MEDIUM_SHUTDOWN)&__io_SDHC_Close +}; \ No newline at end of file diff --git a/source/devicemounter/sdhc.h b/source/devicemounter/sdhc.h new file mode 100644 index 00000000..18453413 --- /dev/null +++ b/source/devicemounter/sdhc.h @@ -0,0 +1,18 @@ +#ifndef _SDHC_H_ +#define _SDHC_H_ + +/* Constants */ +#define SDHC_SECTOR_SIZE 0x200 + +/* Disc interfaces */ +extern const DISC_INTERFACE __io_sdhc; + +/* Prototypes */ +bool SDHC_Init(void); +bool SDHC_Close(void); +bool SDHC_ReadSectors(u32, u32, void *); +bool SDHC_WriteSectors(u32, u32, void *); +extern int sdhc_mode_sd; +extern int sdhc_inited; + +#endif diff --git a/source/devicemounter/usbstorage.c b/source/devicemounter/usbstorage.c new file mode 100644 index 00000000..fcd826d4 --- /dev/null +++ b/source/devicemounter/usbstorage.c @@ -0,0 +1,297 @@ +/*------------------------------------------------------------- + +usbstorage_starlet.c -- USB mass storage support, inside starlet +Copyright (C) 2009 Kwiirk + +If this driver is linked before libogc, this will replace the original +usbstorage driver by svpe from libogc +This software is provided 'as-is', without any express or implied +warranty. In no event will the authors be held liable for any +damages arising from the use of this software. + +Permission is granted to anyone to use this software for any +purpose, including commercial applications, and to alter it and +redistribute it freely, subject to the following restrictions: + +1. The origin of this software must not be misrepresented; you +must not claim that you wrote the original software. If you use +this software in a product, an acknowledgment in the product +documentation would be appreciated but is not required. + +2. Altered source versions must be plainly marked as such, and +must not be misrepresented as being the original software. + +3. This notice may not be removed or altered from any source +distribution. + +-------------------------------------------------------------*/ + +#include <gccore.h> +#include <malloc.h> +#include <stdio.h> +#include <string.h> + +#include "gecko.h" + +/* IOCTL commands */ +#define UMS_BASE (('U'<<24)|('M'<<16)|('S'<<8)) +#define USB_IOCTL_UMS_INIT (UMS_BASE+0x1) +#define USB_IOCTL_UMS_GET_CAPACITY (UMS_BASE+0x2) +#define USB_IOCTL_UMS_READ_SECTORS (UMS_BASE+0x3) +#define USB_IOCTL_UMS_WRITE_SECTORS (UMS_BASE+0x4) +#define USB_IOCTL_UMS_READ_STRESS (UMS_BASE+0x5) +#define USB_IOCTL_UMS_SET_VERBOSE (UMS_BASE+0x6) + +#define USB_IOCTL_UMS_WATCHDOG (UMS_BASE+0x80) + +#define UMS_HEAPSIZE 0x8000 +#define USB_MEM2_SIZE 0x10000 + +/* Variables */ +static char fs[] ATTRIBUTE_ALIGN(32) = "/dev/usb2"; +static char fs2[] ATTRIBUTE_ALIGN(32) = "/dev/usb123"; +static char fs3[] ATTRIBUTE_ALIGN(32) = "/dev/usb/ehc"; + +static s32 hid = -1, fd = -1; +u32 sector_size; +static void *usb_buf2; + +extern void* SYS_AllocArena2MemLo(u32 size,u32 align); + +inline s32 __USBStorage_isMEM2Buffer(const void *buffer) +{ + u32 high_addr = ((u32)buffer) >> 24; + + return (high_addr == 0x90) || (high_addr == 0xD0); +} + + +u32 USBStorage_GetCapacity(u32 *_sector_size) +{ + if (fd >= 0) + { + u32 ret; + + ret = IOS_IoctlvFormat(hid, fd, USB_IOCTL_UMS_GET_CAPACITY, ":i", §or_size); + + static bool first = true; + if (first) + { + gprintf("\nSECTORS: %lu\n", ret); + gprintf("SEC SIZE: %lu\n", sector_size); + u32 size = ((((ret / 1024U) * sector_size) / 1024U) / 1024U); + if(size >= 1000U) + { + gprintf("HDD SIZE: %lu.%lu TB [%u]\n", size / 1024U, (size * 100U) % 1024U, sector_size); + } + else + { + gprintf("HDD SIZE: %lu GB [%u]\n", size, sector_size); + } + first = false; + } + + if (ret && _sector_size) + *_sector_size = sector_size; + + return ret; + } + + return 0; +} + +s32 USBStorage_OpenDev() +{ + /* Already open */ + if (fd >= 0) return fd; + + /* Create heap */ + if (hid < 0) + { + hid = iosCreateHeap(UMS_HEAPSIZE); + if (hid < 0) return IPC_ENOMEM; // = -22 + } + + // allocate buf2 + if (usb_buf2 == NULL) usb_buf2 = SYS_AllocArena2MemLo(USB_MEM2_SIZE, 32); + + /* Open USB device */ + fd = IOS_Open(fs, 0); + if (fd < 0) fd = IOS_Open(fs2, 0); + if (fd < 0) fd = IOS_Open(fs3, 0); + return fd; +} + +s32 USBStorage_SetWatchdog(u32 seconds) +{ + if (fd < 0) return fd; + + static ioctlv vector[1] ATTRIBUTE_ALIGN(32); + static u32 secs[8] ATTRIBUTE_ALIGN(32); + + secs[0] = seconds; + vector[0].data = secs; + vector[0].len = 4; + + return IOS_Ioctlv(fd, USB_IOCTL_UMS_WATCHDOG, 1, 0, vector); +} + +s32 USBStorage_Init(void) +{ + s32 ret; + USBStorage_OpenDev(); + if (fd < 0) return fd; + + /* Initialize USB storage */ + ret = IOS_IoctlvFormat(hid, fd, USB_IOCTL_UMS_INIT, ":"); + + /* Get device capacity */ + ret = USBStorage_GetCapacity(NULL); + if (!ret) goto err; + + return 0; + +err: + /* Close USB device */ + if (fd >= 0) + { + IOS_Close(fd); + fd = -1; + } +/* + if (hid > 0) { + iosDestroyHeap(hid); + hid = -1; + } */ + //USB_Deinitialize(); //Screwing up inputs even worse if i do this here..grr + return -1; +} + +void USBStorage_Deinit(void) +{ + /* Close USB device */ + if (fd >= 0) + { + IOS_Close(fd); + fd = -1; + } +/* if (hid > 0) { + iosDestroyHeap(hid); + hid = -1; + } */ + USB_Deinitialize(); +} + +s32 USBStorage_ReadSectors(u32 sector, u32 numSectors, void *buffer) +{ + void *buf = (void *)buffer; + u32 len = (sector_size * numSectors); + s32 ret; + + /* Device not opened */ + if (fd < 0) + return fd; + + /* MEM1 buffer */ + if (!__USBStorage_isMEM2Buffer(buffer)) + { + /* Allocate memory */ + //buf = iosAlloc(hid, len); + buf = usb_buf2; + if (!buf) return IPC_ENOMEM; + } + + /* Read data */ + ret = IOS_IoctlvFormat(hid, fd, USB_IOCTL_UMS_READ_SECTORS, "ii:d", sector, numSectors, buf, len); + + /* Copy data */ + if (buf != buffer) + { + memcpy(buffer, buf, len); + //iosFree(hid, buf); + } + + return ret; +} + +s32 USBStorage_WriteSectors(u32 sector, u32 numSectors, const void *buffer) +{ + void *buf = (void *)buffer; + u32 len = (sector_size * numSectors); + s32 ret; + + /* Device not opened */ + if (fd < 0) return fd; + + /* MEM1 buffer */ + if (!__USBStorage_isMEM2Buffer(buffer)) + { + /* Allocate memory */ + //buf = iosAlloc(hid, len); + buf = usb_buf2; + if (!buf) return IPC_ENOMEM; + + /* Copy data */ + memcpy(buf, buffer, len); + } + + /* Write data */ + ret = IOS_IoctlvFormat(hid, fd, USB_IOCTL_UMS_WRITE_SECTORS, "ii:d", sector, numSectors, buf, len); + + /* Free memory */ + //if (buf != buffer) + // iosFree(hid, buf); + + return ret; +} + +// DISC_INTERFACE methods + +static bool __io_usb_IsInserted(void) +{ + s32 ret; + u32 sec_size; + if (fd < 0) return false; + ret = USBStorage_GetCapacity(&sec_size); + if (ret == 0) return false; + if (sec_size != 512) return false; + return true; +} + +static bool __io_usb_Startup(void) +{ + if (USBStorage_Init() < 0) return false; + return __io_usb_IsInserted(); +} + +bool __io_usb_ReadSectors(u32 sector, u32 count, void *buffer) +{ + return USBStorage_ReadSectors(sector, count, buffer) >= 0; +} + +bool __io_usb_WriteSectors(u32 sector, u32 count, void *buffer) +{ + return USBStorage_WriteSectors(sector, count, buffer) >= 0; +} + +static bool __io_usb_ClearStatus(void) +{ + return true; +} + +static bool __io_usb_Shutdown(void) +{ + // do nothing + return true; +} + +DISC_INTERFACE __io_usbstorage = { + DEVICE_TYPE_WII_USB, + FEATURE_MEDIUM_CANREAD | FEATURE_MEDIUM_CANWRITE | FEATURE_WII_USB, + (FN_MEDIUM_STARTUP) &__io_usb_Startup, + (FN_MEDIUM_ISINSERTED) &__io_usb_IsInserted, + (FN_MEDIUM_READSECTORS) &__io_usb_ReadSectors, + (FN_MEDIUM_WRITESECTORS) &__io_usb_WriteSectors, + (FN_MEDIUM_CLEARSTATUS) &__io_usb_ClearStatus, + (FN_MEDIUM_SHUTDOWN) &__io_usb_Shutdown +}; \ No newline at end of file diff --git a/source/devicemounter/usbstorage.h b/source/devicemounter/usbstorage.h new file mode 100644 index 00000000..9a2846c0 --- /dev/null +++ b/source/devicemounter/usbstorage.h @@ -0,0 +1,22 @@ +#ifndef _USBSTORAGE_H_ +#define _USBSTORAGE_H_ + +#include <ogcsys.h> + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + +/* Prototypes */ +s32 USBStorage_GetCapacity(u32 *); +s32 USBStorage_SetWatchdog(u32); +s32 USBStorage_Init(void); +void USBStorage_Deinit(void); +s32 USBStorage_ReadSectors(u32, u32, void *); +s32 USBStorage_WriteSectors(u32, u32, void *); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif diff --git a/source/fonts.h b/source/fonts.h new file mode 100644 index 00000000..2dd6fd27 --- /dev/null +++ b/source/fonts.h @@ -0,0 +1,20 @@ +// Can put this in defines.h later, but its easier +//not having to recompile the whole menu for now by doing it this way + +#define WIIFONT_NAME "WiiNTLG-Regular.ttc" +#define WIIFONT_NAME_KOR "Wii-kr_Round Gothic B.ttf" +const u8 WIIFONT_HASH[] = {0x32, 0xb3, 0x39, 0xcb, 0xbb, 0x50, 0x7d, 0x50, 0x27, 0x79, 0x25, 0x9a, 0x78, 0x66, 0x99, 0x5d, 0x03, 0x0b, 0x1d, 0x88}; +const u8 WIIFONT_HASH_KOR[] = {0xb7, 0x15, 0x6d, 0xf0, 0xf4, 0xae, 0x07, 0x8f, 0xd1, 0x53, 0x58, 0x3e, 0x93, 0x6e, 0x07, 0xc0, 0x98, 0x77, 0x49, 0x0e}; + +#define FONT_BOLD 36u +#define FONT_NOBOLD 8u + +#define TITLEFONT_PT_SZ 36u +#define BTNFONT_PT_SZ 24u +#define LBLFONT_PT_SZ 24u +#define TEXTFONT_PT_SZ 14u + +#define TITLEFONT TITLEFONT_PT_SZ, TITLEFONT_PT_SZ + 4, FONT_BOLD, 1, "title_font" +#define BUTTONFONT BTNFONT_PT_SZ, BTNFONT_PT_SZ + 4, FONT_BOLD, 1, "button_font" +#define LABELFONT LBLFONT_PT_SZ, LBLFONT_PT_SZ + 4, FONT_BOLD, 1, "label_font" +#define TEXTFONT TEXTFONT_PT_SZ, TEXTFONT_PT_SZ + 4, FONT_NOBOLD, 1, "text_Font" \ No newline at end of file diff --git a/source/gecko/gecko.c b/source/gecko/gecko.c new file mode 100644 index 00000000..f86ce3fb --- /dev/null +++ b/source/gecko/gecko.c @@ -0,0 +1,123 @@ +#include <gccore.h> +#include <malloc.h> +#include <stdio.h> +#include <string.h> +#include <sys/iosupport.h> + +#include "wifi_gecko.h" + +/* init-globals */ +bool geckoinit = false; +bool textVideoInit = false; + +#include <stdarg.h> + +static ssize_t __out_write(struct _reent *r __attribute__((unused)), int fd __attribute__((unused)), const char *ptr, size_t len) +{ + if(geckoinit && ptr) + { + u32 level; + level = IRQ_Disable(); + usb_sendbuffer(1, ptr, len); + IRQ_Restore(level); + } + + return len; +} + +static const devoptab_t gecko_out = { + "stdout", // device name + 0, // size of file structure + NULL, // device open + NULL, // device close + __out_write,// device write + NULL, // device read + NULL, // device seek + NULL, // device fstat + NULL, // device stat + NULL, // device link + NULL, // device unlink + NULL, // device chdir + NULL, // device rename + NULL, // device mkdir + 0, // dirStateSize + NULL, // device diropen_r + NULL, // device dirreset_r + NULL, // device dirnext_r + NULL, // device dirclose_r + NULL, // device statvfs_r + NULL, // device ftruncate_r + NULL, // device fsync_r + NULL, // device deviceData + NULL, // device chmod_r + NULL, // device fchmod_r +}; + +static void USBGeckoOutput() +{ + devoptab_list[STD_OUT] = &gecko_out; + devoptab_list[STD_ERR] = &gecko_out; +} + +//using the gprintf from crediar because it is smaller than mine +void gprintf( const char *format, ... ) +{ + char * tmp = NULL; + va_list va; + va_start(va, format); + if((vasprintf(&tmp, format, va) >= 0) && tmp) + { + WifiGecko_Send(tmp, strlen(tmp)); + if (geckoinit) + __out_write(NULL, 0, tmp, strlen(tmp)); + } + va_end(va); + + SAFE_FREE(tmp); +} + +char ascii(char s) { + if(s < 0x20) return '.'; + if(s > 0x7E) return '.'; + return s; +} + +void ghexdump(void *d, int len) { + u8 *data; + int i, off; + data = (u8*)d; + + gprintf("\n 0 1 2 3 4 5 6 7 8 9 A B C D E F 0123456789ABCDEF"); + gprintf("\n==== =============================================== ================\n"); + + for (off=0; off<len; off += 16) + { + gprintf("%04x ",off); + for(i=0; i<16; i++) + if((i+off)>=len) gprintf(" "); + else gprintf("%02x ",data[off+i]); + + gprintf(" "); + for(i=0; i<16; i++) + if((i+off)>=len) gprintf(" "); + else gprintf("%c",ascii(data[off+i])); + gprintf("\n"); + } +} + + +bool InitGecko() +{ + if (geckoinit) return geckoinit; + + USBGeckoOutput(); + + u32 geckoattached = usb_isgeckoalive(EXI_CHANNEL_1); + if (geckoattached) + { + usb_flush(EXI_CHANNEL_1); + return true; + } + else return false; +} + diff --git a/source/gecko/gecko.h b/source/gecko/gecko.h new file mode 100644 index 00000000..36bafe95 --- /dev/null +++ b/source/gecko/gecko.h @@ -0,0 +1,21 @@ + + +#ifndef _GECKO_H_ +#define _GECKO_H_ + +#ifdef __cplusplus +extern "C" { +#endif + + extern bool geckoinit; + + //use this just like printf(); + void gprintf(const char *format, ...); + void ghexdump(void *d, int len); + bool InitGecko(); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/source/gecko/wifi_gecko.c b/source/gecko/wifi_gecko.c new file mode 100644 index 00000000..b73dd32b --- /dev/null +++ b/source/gecko/wifi_gecko.c @@ -0,0 +1,135 @@ +/**************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include <stdarg.h> +#include <stdlib.h> +#include <stdio.h> +#include <string.h> +#include <unistd.h> +#include <network.h> +#include "wifi_gecko.h" + +static int connection = -1; +static int init = 0; + +const char *dest_ip = NULL; +u16 dest_port = 0; + +void WifiGecko_Init(const char *ip, const u16 port) +{ + dest_ip = ip; + dest_port = port; + init = 1; +} + +void WifiGecko_Close() +{ + if (!init) return; + + if(connection >= 0) + net_close(connection); + + connection = -1; +} + +int WifiGecko_Connect() +{ + if (!init) return -2; + + if(connection >= 0) + return connection; + + if (dest_ip == NULL || dest_port == 0) return connection; + + connection = net_socket(AF_INET, SOCK_STREAM, IPPROTO_IP); + if (connection < 0) + return connection; + + struct sockaddr_in connect_addr; + memset(&connect_addr, 0, sizeof(connect_addr)); + connect_addr.sin_family = AF_INET; + connect_addr.sin_port = htons(dest_port); + inet_aton(dest_ip, &connect_addr.sin_addr); + + if(net_connect(connection, (struct sockaddr*)&connect_addr, sizeof(connect_addr)) < 0) + { + WifiGecko_Close(); + return -1; + } + + // First time connect, send hello message + char *msg = "Wiiflow WiFi Gecko output console connected\n"; + net_send(connection, msg, strlen(msg), 0); + + return connection; +} + +int WifiGecko_Send(const char * data, int datasize) +{ + if (!init) return -2; + + if(WifiGecko_Connect() < 0) + return connection; + + int ret = 0, done = 0, blocksize = 1024; + + while (done < datasize) + { + if(blocksize > datasize-done) + blocksize = datasize-done; + + ret = net_send(connection, data + done, blocksize, 0); + if (ret < 0) + { + WifiGecko_Close(); + return ret; + } + else if(ret == 0) + { + break; + } + + done += ret; + usleep (1000); + } + + return ret; +} + +void wifi_printf(const char * format, ...) +{ + if (!init) return; + + char * tmp = NULL; + va_list va; + va_start(va, format); + if((vasprintf(&tmp, format, va) >= 0) && tmp) + { + WifiGecko_Send(tmp, strlen(tmp)); + } + va_end(va); + + SAFE_FREE(tmp); +} \ No newline at end of file diff --git a/source/gecko/wifi_gecko.h b/source/gecko/wifi_gecko.h new file mode 100644 index 00000000..5cb8048e --- /dev/null +++ b/source/gecko/wifi_gecko.h @@ -0,0 +1,45 @@ +/**************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#ifndef WIFI_GECKO_H_ +#define WIFI_GECKO_H_ + +#include "utils.h" + +#ifdef __cplusplus +extern "C" { +#endif + +void WifiGecko_Init(const char *ip, u16 port); +int WifiGecko_Connect(); +void WifiGecko_Close(); +int WifiGecko_Send(const char * data, int datasize); +void wifi_printf(const char * format, ...); + +#ifdef __cplusplus +} +#endif + +#endif \ No newline at end of file diff --git a/source/gui/FreeTypeGX.cpp b/source/gui/FreeTypeGX.cpp new file mode 100644 index 00000000..e3fcb256 --- /dev/null +++ b/source/gui/FreeTypeGX.cpp @@ -0,0 +1,705 @@ +/* + * FreeTypeGX is a wrapper class for libFreeType which renders a compiled + * FreeType parsable font into a GX texture for Wii homebrew development. + * Copyright (C) 2008 Armin Tamzarian + * + * This file is part of FreeTypeGX. + * + * FreeTypeGX is free software: you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License as published + * by the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * FreeTypeGX 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 Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public License + * along with FreeTypeGX. If not, see <http://www.gnu.org/licenses/>. + */ + +#include "FreeTypeGX.h" + +#include "mem2.hpp" + +#include <stdio.h> + +/** + * Default constructor for the FreeTypeGX class. + * + * @param textureFormat Optional format (GX_TF_*) of the texture as defined by the libogc gx.h header file. If not specified default value is GX_TF_RGBA8. + * @param positionFormat Optional positional format (GX_POS_*) of the texture as defined by the libogc gx.h header file. If not specified default value is GX_POS_XYZ. + */ +FreeTypeGX::FreeTypeGX(uint8_t textureFormat, uint8_t positionFormat) { + FT_Init_FreeType(&this->ftLibrary); + + this->textureFormat = textureFormat; + this->positionFormat = positionFormat; + xScale = 1.f; + yScale = 1.f; + xPos = 0.f; + yPos = 0.f; + this->ftFace = 0; +} + +/** + * Default destructor for the FreeTypeGX class. + */ +FreeTypeGX::~FreeTypeGX() { + this->unloadFont(); + if (this->ftLibrary != 0) + { + FT_Done_FreeType(this->ftLibrary); + this->ftLibrary = 0; + } +} + +/** + * Convert a short char sctring to a wide char string. + * + * This routine converts a supplied shot character string into a wide character string. + * Note that it is the user's responsibility to clear the returned buffer once it is no longer needed. + * + * @param strChar Character string to be converted. + * @return Wide character representation of supplied character string. + */ +wchar_t* FreeTypeGX::charToWideChar(char* strChar) { + wchar_t *strWChar; + strWChar = new wchar_t[strlen(strChar) + 1]; + + char *tempSrc = strChar; + wchar_t *tempDest = strWChar; + while((*tempDest++ = *tempSrc++)); + + return strWChar; +} + +/** + * Loads and processes a specified true type font buffer to a specific point size. + * + * This routine takes a precompiled true type font buffer and loads the necessary processed data into memory. This routine should be called before drawText will succeed. + * + * @param fontBuffer A pointer in memory to a precompiled true type font buffer. + * @param bufferSize Size of the true type font buffer in bytes. + * @param pointSize The desired point size this wrapper's configured font face. + * @param cacheAll Optional flag to specify if all font characters should be cached when the class object is created. If specified as false the characters only become cached the first time they are used. If not specified default value is false. + */ +uint16_t FreeTypeGX::loadFont(uint8_t* fontBuffer, FT_Long bufferSize, FT_UInt pointSize, FT_Pos weight, uint32_t index, bool cacheAll) { + this->unloadFont(); + this->ftPointSize = pointSize != 0 ? pointSize : this->ftPointSize; + this->ftWeight = weight; + + // check if the index is valid + if (index != 0) + { + FT_New_Memory_Face(this->ftLibrary, (FT_Byte *)fontBuffer, bufferSize, -1, &this->ftFace); + if (index >= (uint32_t) this->ftFace->num_faces) + index = this->ftFace->num_faces - 1; // Use the last face + FT_Done_Face(this->ftFace); + this->ftFace = NULL; + } + + FT_New_Memory_Face(this->ftLibrary, (FT_Byte *)fontBuffer, bufferSize, index, &this->ftFace); + FT_Set_Pixel_Sizes(this->ftFace, 0, this->ftPointSize); + + this->ftSlot = this->ftFace->glyph; + this->ftKerningEnabled = FT_HAS_KERNING(this->ftFace); + + if (cacheAll) { + return this->cacheGlyphDataComplete(); + } + + return 0; +} + +/** + * + * \overload + */ +uint16_t FreeTypeGX::loadFont(const uint8_t* fontBuffer, FT_Long bufferSize, FT_UInt pointSize, FT_Pos weight, uint32_t index, bool cacheAll) { + return this->loadFont((uint8_t *)fontBuffer, bufferSize, pointSize, weight, index, cacheAll); +} + +/** + * Clears all loaded font glyph data. + * + * This routine clears all members of the font map structure and frees all allocated memory back to the system. + */ +void FreeTypeGX::unloadFont() { + for( std::map<wchar_t, ftgxCharData>::iterator i = this->fontData.begin(); i != this->fontData.end(); i++) { + SAFE_FREE(i->second.glyphDataTexture); + } + + this->fontData.clear(); + if (this->ftFace != NULL) + { + FT_Done_Face(this->ftFace); + this->ftFace = NULL; + } +} + +/** + * Adjusts the texture data buffer to necessary width for a given texture format. + * + * This routine determines adjusts the given texture width into the required width to hold the necessary texture data for proper alignment. + * + * @param textureWidth The initial guess for the texture width. + * @param textureFormat The texture format to which the data is to be converted. + * @return The correctly adjusted texture width. + */ +uint16_t FreeTypeGX::adjustTextureWidth(uint16_t textureWidth, uint8_t textureFormat) { + uint16_t alignment; + + switch(textureFormat) { + case GX_TF_I4: /* 8x8 Tiles - 4-bit Intensity */ + case GX_TF_I8: /* 8x4 Tiles - 8-bit Intensity */ + case GX_TF_IA4: /* 8x4 Tiles - 4-bit Intensity, , 4-bit Alpha */ + alignment = 8; + break; + + case GX_TF_IA8: /* 4x4 Tiles - 8-bit Intensity, 8-bit Alpha */ + case GX_TF_RGB565: /* 4x4 Tiles - RGB565 Format */ + case GX_TF_RGB5A3: /* 4x4 Tiles - RGB5A3 Format */ + case GX_TF_RGBA8: /* 4x4 Tiles - RGBA8 Dual Cache Line Format */ + default: + alignment = 4; + break; + } + return textureWidth % alignment == 0 ? textureWidth : alignment + textureWidth - (textureWidth % alignment); + +} + +/** + * Adjusts the texture data buffer to necessary height for a given texture format. + * + * This routine determines adjusts the given texture height into the required height to hold the necessary texture data for proper alignment. + * + * @param textureHeight The initial guess for the texture height. + * @param textureFormat The texture format to which the data is to be converted. + * @return The correctly adjusted texture height. + */ +uint16_t FreeTypeGX::adjustTextureHeight(uint16_t textureHeight, uint8_t textureFormat) { + uint16_t alignment; + + switch(textureFormat) { + case GX_TF_I4: /* 8x8 Tiles - 4-bit Intensity */ + alignment = 8; + break; + + case GX_TF_I8: /* 8x4 Tiles - 8-bit Intensity */ + case GX_TF_IA4: /* 8x4 Tiles - 4-bit Intensity, , 4-bit Alpha */ + case GX_TF_IA8: /* 4x4 Tiles - 8-bit Intensity, 8-bit Alpha */ + case GX_TF_RGB565: /* 4x4 Tiles - RGB565 Format */ + case GX_TF_RGB5A3: /* 4x4 Tiles - RGB5A3 Format */ + case GX_TF_RGBA8: /* 4x4 Tiles - RGBA8 Dual Cache Line Format */ + default: + alignment = 4; + break; + } + return textureHeight % alignment == 0 ? textureHeight : alignment + textureHeight - (textureHeight % alignment); + +} + +/** + * Caches the given font glyph in the instance font texture buffer. + * + * This routine renders and stores the requested glyph's bitmap and relevant information into its own quickly addressible + * structure within an instance-specific map. + * + * @param charCode The requested glyph's character code. + * @return A pointer to the allocated font structure. + */ +ftgxCharData *FreeTypeGX::cacheGlyphData(wchar_t charCode) { + FT_UInt gIndex; + uint16_t textureWidth = 0, textureHeight = 0; + + gIndex = FT_Get_Char_Index( this->ftFace, charCode ); + if (!FT_Load_Glyph(this->ftFace, gIndex, FT_LOAD_DEFAULT )) { + FT_Render_Glyph( this->ftSlot, FT_RENDER_MODE_NORMAL ); + + if(this->ftSlot->format == FT_GLYPH_FORMAT_BITMAP) { + FT_Bitmap *glyphBitmap = &this->ftSlot->bitmap; + FT_Bitmap_Embolden(this->ftLibrary, glyphBitmap, this->ftWeight, this->ftWeight); + + textureWidth = adjustTextureWidth(glyphBitmap->width, this->textureFormat); + textureHeight = adjustTextureHeight(glyphBitmap->rows, this->textureFormat); + + this->fontData[charCode] = (ftgxCharData){ + this->ftSlot->advance.x >> 6, + gIndex, + textureWidth, + textureHeight, + this->ftSlot->bitmap_top, + this->ftSlot->bitmap_top, + textureHeight - this->ftSlot->bitmap_top, + NULL + }; + this->loadGlyphData(glyphBitmap, &this->fontData[charCode]); + + return &this->fontData[charCode]; + } + } + + return NULL; +} + +/** + * Locates each character in this wrapper's configured font face and proccess them. + * + * This routine locates each character in the configured font face and renders the glyph's bitmap. + * Each bitmap and relevant information is loaded into its own quickly addressible structure within an instance-specific map. + */ +uint16_t FreeTypeGX::cacheGlyphDataComplete() { + uint16_t i = 0; + FT_UInt gIndex; + FT_ULong charCode = FT_Get_First_Char( this->ftFace, &gIndex ); + while ( gIndex != 0 ) { + + if(this->cacheGlyphData(charCode) != NULL) { + i++; + } + + charCode = FT_Get_Next_Char( this->ftFace, charCode, &gIndex ); + } + + return i; +} + +/** + * Loads the rendered bitmap into the relevant structure's data buffer. + * + * This routine does a simple byte-wise copy of the glyph's rendered 8-bit grayscale bitmap into the structure's buffer. + * Each byte is converted from the bitmap's intensity value into the a uint32_t RGBA value. + * + * @param bmp A pointer to the most recently rendered glyph's bitmap. + * @param charData A pointer to an allocated ftgxCharData structure whose data represent that of the last rendered glyph. + */ +void FreeTypeGX::loadGlyphData(FT_Bitmap *bmp, ftgxCharData *charData) { + + uint32_t *glyphData = (uint32_t *)MEM2_alloc(charData->textureWidth * charData->textureHeight * 4); + if (glyphData == 0) + return; + memset(glyphData, 0x00, charData->textureWidth * charData->textureHeight * 4); + + for (uint16_t imagePosY = 0; imagePosY < bmp->rows; imagePosY++) { + for (uint16_t imagePosX = 0; imagePosX < bmp->width; imagePosX++) { + uint32_t pixel = (uint32_t) bmp->buffer[imagePosY * bmp->width + imagePosX]; + glyphData[imagePosY * charData->textureWidth + imagePosX] = 0x00000000 | (pixel << 24) | (pixel << 16) | (pixel << 8) | pixel; + } + } + + switch(this->textureFormat) { + case GX_TF_I4: + charData->glyphDataTexture = Metaphrasis::convertBufferToI4(glyphData, charData->textureWidth, charData->textureHeight); + break; + case GX_TF_I8: + charData->glyphDataTexture = Metaphrasis::convertBufferToI8(glyphData, charData->textureWidth, charData->textureHeight); + break; + case GX_TF_IA4: + charData->glyphDataTexture = Metaphrasis::convertBufferToIA4(glyphData, charData->textureWidth, charData->textureHeight); + break; + case GX_TF_IA8: + charData->glyphDataTexture = Metaphrasis::convertBufferToIA8(glyphData, charData->textureWidth, charData->textureHeight); + break; + case GX_TF_RGB565: + charData->glyphDataTexture = Metaphrasis::convertBufferToRGB565(glyphData, charData->textureWidth, charData->textureHeight); + break; + case GX_TF_RGB5A3: + charData->glyphDataTexture = Metaphrasis::convertBufferToRGB5A3(glyphData, charData->textureWidth, charData->textureHeight); + break; + case GX_TF_RGBA8: + default: + charData->glyphDataTexture = Metaphrasis::convertBufferToRGBA8(glyphData, charData->textureWidth, charData->textureHeight); + break; + } + + SAFE_FREE(glyphData); +} + +/** + * Determines the x offset of the rendered string. + * + * This routine calculates the x offset of the rendered string based off of a supplied positional format parameter. + * + * @param width Current pixel width of the string. + * @param format Positional format of the string. + */ +uint16_t FreeTypeGX::getStyleOffsetWidth(uint16_t width, uint16_t format) { + + if (format & FTGX_JUSTIFY_LEFT ) { + return 0; + } + else if (format & FTGX_JUSTIFY_CENTER ) { + return width >> 1; + } + else if (format & FTGX_JUSTIFY_RIGHT ) { + return width; + } + + return 0; +} + +/** + * Determines the y offset of the rendered string. + * + * This routine calculates the y offset of the rendered string based off of a supplied positional format parameter. + * + * @param offset Current pixel offset data of the string. + * @param format Positional format of the string. + */ +uint16_t FreeTypeGX::getStyleOffsetHeight(ftgxDataOffset offset, uint16_t format) { + if (format & FTGX_ALIGN_TOP ) { + return -offset.max; + } + else if (format & FTGX_ALIGN_MIDDLE ) { + return -(offset.max - offset.min) >> 1; + } + else if (format & FTGX_ALIGN_BOTTOM ) { + return offset.min; + } + + return 0; +} + +/** + * Processes the supplied text string and prints the results at the specified coordinates. + * + * This routine processes each character of the supplied text string, loads the relevant preprocessed bitmap buffer, + * a texture from said buffer, and loads the resultant texture into the EFB. + * + * @param x Screen X coordinate at which to output the text. + * @param y Screen Y coordinate at which to output the text. Note that this value corresponds to the text string origin and not the top or bottom of the glyphs. + * @param text NULL terminated string to output. + * @param color Optional color to apply to the text characters. If not specified default value is ftgxWhite: (GXColor){0xff, 0xff, 0xff, 0xff} + * @param textStyle Flags which specify any styling which should be applied to the rendered string. + * @return The number of characters printed. + */ +uint16_t FreeTypeGX::drawText(uint16_t x, uint16_t y, wchar_t *text, GXColor color, uint16_t textStyle) { + uint16_t strLength = wcslen(text); + uint16_t x_pos = x, printed = 0; + uint16_t x_offset = 0, y_offset = 0; + GXTexObj glyphTexture; + FT_Vector pairDelta; + + if(textStyle & 0x000F) { + x_offset = this->getStyleOffsetWidth(this->getWidth(text), textStyle); + } + if(textStyle & 0x00F0) { + y_offset = this->getStyleOffsetHeight(this->getOffset(text), textStyle); + } + + GX_SetBlendMode(GX_BM_BLEND, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + + for (uint16_t i = 0; i < strLength; i++) { + + ftgxCharData* glyphData = NULL; + if( this->fontData.find(text[i]) != this->fontData.end() ) { + glyphData = &this->fontData[text[i]]; + } + else { + glyphData = this->cacheGlyphData(text[i]); + } + + if(glyphData != NULL) { + + if(this->ftKerningEnabled && i) { + FT_Get_Kerning( this->ftFace, this->fontData[text[i - 1]].glyphIndex, glyphData->glyphIndex, FT_KERNING_DEFAULT, &pairDelta ); + x_pos += pairDelta.x >> 6; + } + + GX_InitTexObj(&glyphTexture, glyphData->glyphDataTexture, glyphData->textureWidth, glyphData->textureHeight, this->textureFormat, GX_CLAMP, GX_CLAMP, GX_FALSE); + this->copyTextureToFramebuffer(&glyphTexture, this->positionFormat, glyphData->textureWidth, glyphData->textureHeight, x_pos - x_offset, y - glyphData->renderOffsetY - y_offset, color); + + x_pos += glyphData->glyphAdvanceX; + printed++; + } + } + + if(textStyle & 0x0F00) { + this->drawTextFeature(x - x_offset, y, this->getWidth(text), this->getOffset(text), textStyle, color); + } + + return printed; +} + +/** + * \overload + */ +uint16_t FreeTypeGX::drawText(uint16_t x, uint16_t y, wchar_t const *text, GXColor color, uint16_t textStyle) { + return this->drawText(x, y, (wchar_t *)text, color, textStyle); +} + +void FreeTypeGX::drawTextFeature(uint16_t x, uint16_t y, uint16_t width, ftgxDataOffset offsetData, uint16_t format, GXColor color) { + uint16_t featureHeight = this->ftPointSize >> 4 > 0 ? this->ftPointSize >> 4 : 1; + + if (format & FTGX_STYLE_UNDERLINE ) { + switch(format & 0x00F0) { + case FTGX_ALIGN_TOP: + this->copyFeatureToFramebuffer(this->positionFormat, width, featureHeight, x, y + offsetData.max + 1, color); + break; + case FTGX_ALIGN_MIDDLE: + this->copyFeatureToFramebuffer(this->positionFormat, width, featureHeight, x, y + ((offsetData.max - offsetData.min) >> 1) + 1, color); + break; + case FTGX_ALIGN_BOTTOM: + this->copyFeatureToFramebuffer(this->positionFormat, width, featureHeight, x, y - offsetData.min, color); + break; + default: + this->copyFeatureToFramebuffer(this->positionFormat, width, featureHeight, x, y + 1, color); + break; + } + } + + if (format & FTGX_STYLE_STRIKE ) { + switch(format & 0x00F0) { + case FTGX_ALIGN_TOP: + this->copyFeatureToFramebuffer(this->positionFormat, width, featureHeight, x, y + ((offsetData.max + offsetData.min) >> 1), color); + break; + case FTGX_ALIGN_MIDDLE: + this->copyFeatureToFramebuffer(this->positionFormat, width, featureHeight, x, y, color); + break; + case FTGX_ALIGN_BOTTOM: + this->copyFeatureToFramebuffer(this->positionFormat, width, featureHeight, x, y - ((offsetData.max + offsetData.min) >> 1), color); + break; + default: + this->copyFeatureToFramebuffer(this->positionFormat, width, featureHeight, x, y - ((offsetData.max - offsetData.min) >> 1), color); + break; + } + } +} + +/** + * Processes the supplied string and return the width of the string in pixels. + * + * This routine processes each character of the supplied text string and calculates the width of the entire string. + * Note that if precaching of the entire font set is not enabled any uncached glyph will be cached after the call to this function. + * + * @param text NULL terminated string to calculate. + * @return The width of the text string in pixels. + */ +uint16_t FreeTypeGX::getWidth(wchar_t *text) { + uint16_t strLength = wcslen(text); + uint16_t strWidth = 0; + FT_Vector pairDelta; + + for (uint16_t i = 0; i < strLength; i++) { + + ftgxCharData* glyphData = NULL; + if( this->fontData.find(text[i]) != this->fontData.end() ) { + glyphData = &this->fontData[text[i]]; + } + else { + glyphData = this->cacheGlyphData(text[i]); + } + + if(glyphData != NULL) { + if(this->ftKerningEnabled && (i > 0)) { + FT_Get_Kerning( this->ftFace, this->fontData[text[i - 1]].glyphIndex, glyphData->glyphIndex, FT_KERNING_DEFAULT, &pairDelta ); + strWidth += pairDelta.x >> 6; + } + + strWidth += glyphData->glyphAdvanceX; + } + } + + return strWidth; +} + +/** + * + * \overload + */ +uint16_t FreeTypeGX::getWidth(wchar_t const *text) { + return this->getWidth((wchar_t *)text); +} + +/** + * Processes the supplied string and return the height of the string in pixels. + * + * This routine processes each character of the supplied text string and calculates the height of the entire string. + * Note that if precaching of the entire font set is not enabled any uncached glyph will be cached after the call to this function. + * + * @param text NULL terminated string to calculate. + * @return The height of the text string in pixels. + */ +uint16_t FreeTypeGX::getHeight(wchar_t *text) { + ftgxDataOffset offset = this->getOffset(text); + + return offset.max + offset.min; +} + +/** + * + * \overload + */ +uint16_t FreeTypeGX::getHeight(wchar_t const *text) { + return this->getHeight((wchar_t *)text); +} + +/** + * Get the maximum offset above and minimum offset below the font origin line. + * + * This function calculates the maximum pixel height above the font origin line and the minimum + * pixel height below the font origin line and returns the values in an addressible structure. + * + * @param text NULL terminated string to calculate. + * @return The max and min values above and below the font origin line. + */ +ftgxDataOffset FreeTypeGX::getOffset(wchar_t *text) { + uint16_t strLength = wcslen(text); + uint16_t strMax = 0, strMin = 0; + + for (uint16_t i = 0; i < strLength; i++) { + + ftgxCharData* glyphData = NULL; + if( this->fontData.find(text[i]) != this->fontData.end() ) { + glyphData = &this->fontData[text[i]]; + } + else { + glyphData = this->cacheGlyphData(text[i]); + } + + if(glyphData != NULL) { + strMax = glyphData->renderOffsetMax > strMax ? glyphData->renderOffsetMax : strMax; + strMin = glyphData->renderOffsetMin > strMin ? glyphData->renderOffsetMin : strMin; + } + } + + return (ftgxDataOffset){strMax, strMin}; +} + +/** + * + * \overload + */ +ftgxDataOffset FreeTypeGX::getOffset(wchar_t const *text) { + return this->getOffset(text); +} + +/** + * Copies the supplied texture quad to the EFB. + * + * This routine uses the in-built GX quad builder functions to define the texture bounds and location on the EFB target. + * + * @param texObj A pointer to the glyph's initialized texture object. + * @param positionFormat The positional format of the graphics subsystem. + * @param texWidth The pixel width of the texture object. + * @param texHeight The pixel height of the texture object. + * @param screenX The screen X coordinate at which to output the rendered texture. + * @param screenY The screen Y coordinate at which to output the rendered texture. + * @param color Color to apply to the texture. + */ +void FreeTypeGX::copyTextureToFramebuffer(GXTexObj *texObj, uint8_t positionFormat, uint16_t texWidth, uint16_t texHeight, int16_t screenX, int16_t screenY, GXColor color) { + + f32 f32TexWidth = texWidth, + f32TexHeight = texHeight; + float x = (float)screenX + xPos; + float y = (float)screenY + yPos; + +// Mtx model; +// guMtxIdentity(model); +// guMtxTransApply(model, model, screenX, screenY, 0.0f); +// GX_LoadPosMtxImm(model, GX_PNMTX0); + + GX_LoadTexObj(texObj, GX_TEXMAP0); + +// GX_SetTevOp (GX_TEVSTAGE0, GX_MODULATE); +// GX_SetVtxDesc (GX_VA_TEX0, GX_DIRECT); + + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + switch(positionFormat) { + case GX_POS_XY: + GX_Position2f32(x * xScale, y * yScale); + GX_Color4u8(color.r, color.g, color.b, color.a); + GX_TexCoord2f32(0.0f, 0.0f); + + GX_Position2f32((f32TexWidth + x) * xScale, y * yScale); + GX_Color4u8(color.r, color.g, color.b, color.a); + GX_TexCoord2f32(1.0f, 0.0f); + + GX_Position2f32((f32TexWidth + x) * xScale, (f32TexHeight + y) * yScale); + GX_Color4u8(color.r, color.g, color.b, color.a); + GX_TexCoord2f32(1.0f, 1.0f); + + GX_Position2f32(x * xScale, (f32TexHeight + y) * yScale); + GX_Color4u8(color.r, color.g, color.b, color.a); + GX_TexCoord2f32(0.0f, 1.0f); + break; + + case GX_POS_XYZ: + GX_Position3f32(x * xScale, y * yScale, 0); + GX_Color4u8(color.r, color.g, color.b, color.a); + GX_TexCoord2f32(0.0f, 0.0f); + + GX_Position3f32((f32TexWidth + x) * xScale, y * yScale, 0); + GX_Color4u8(color.r, color.g, color.b, color.a); + GX_TexCoord2f32(1.0f, 0.0f); + + GX_Position3f32((f32TexWidth + x) * xScale, (f32TexHeight + y) * yScale, 0); + GX_Color4u8(color.r, color.g, color.b, color.a); + GX_TexCoord2f32(1.0f, 1.0f); + + GX_Position3f32(x * xScale, (f32TexHeight + y) * yScale, 0); + GX_Color4u8(color.r, color.g, color.b, color.a); + GX_TexCoord2f32(0.0f, 1.0f); + break; + default: + break; + } + GX_End(); + +// GX_SetTevOp (GX_TEVSTAGE0, GX_PASSCLR); +// GX_SetVtxDesc (GX_VA_TEX0, GX_NONE); +} + +/** + * Creates a feature quad to the EFB. + * + * + * + * @param positionFormat The positional format of the graphics subsystem. + * @param featureWidth The pixel width of the quad. + * @param featureHeight The pixel height of the quad. + * @param screenX The screen X coordinate at which to output the quad. + * @param screenY The screen Y coordinate at which to output the quad. + * @param color Color to apply to the texture. + */ +void FreeTypeGX::copyFeatureToFramebuffer(uint8_t positionFormat, uint16_t featureWidth, uint16_t featureHeight, int16_t screenX, int16_t screenY, GXColor color) { + f32 f32FeatureWidth = featureWidth, + f32FeatureHeight = featureHeight; + + return; + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + switch(positionFormat) { + case GX_POS_XY: + GX_Position2f32(screenX, screenY); + GX_Color4u8(color.r, color.g, color.b, color.a); + + GX_Position2f32(f32FeatureWidth + screenX, screenY); + GX_Color4u8(color.r, color.g, color.b, color.a); + + GX_Position2f32(f32FeatureWidth + screenX, f32FeatureHeight + screenY); + GX_Color4u8(color.r, color.g, color.b, color.a); + + GX_Position2f32(screenX, f32FeatureHeight + screenY); + GX_Color4u8(color.r, color.g, color.b, color.a); + break; + + case GX_POS_XYZ: + GX_Position3f32(screenX, screenY, 0); + GX_Color4u8(color.r, color.g, color.b, color.a); + + GX_Position3f32(f32FeatureWidth + screenX, screenY, 0); + GX_Color4u8(color.r, color.g, color.b, color.a); + + GX_Position3f32(f32FeatureWidth + screenX, f32FeatureHeight + screenY, 0); + GX_Color4u8(color.r, color.g, color.b, color.a); + + GX_Position3f32(screenX, f32FeatureHeight + screenY, 0); + GX_Color4u8(color.r, color.g, color.b, color.a); + break; + default: + break; + } + GX_End(); +} diff --git a/source/gui/FreeTypeGX.h b/source/gui/FreeTypeGX.h new file mode 100644 index 00000000..5ef37561 --- /dev/null +++ b/source/gui/FreeTypeGX.h @@ -0,0 +1,281 @@ +/* + * FreeTypeGX is a wrapper class for libFreeType which renders a compiled + * FreeType parsable font into a GX texture for Wii homebrew development. + * Copyright (C) 2008 Armin Tamzarian + * + * This file is part of FreeTypeGX. + * + * FreeTypeGX is free software: you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License as published + * by the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * FreeTypeGX 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 Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public License + * along with FreeTypeGX. If not, see <http://www.gnu.org/licenses/>. + */ + +/** \mainpage FreeTypeGX + * + * \section sec_intro Introduction + * + * FreeTypeGX is a wrapper class for libFreeType which renders a compiled FreeType parsable font into a GX texture for Wii homebrew development. + * <br> + * FreeTypeGX is written in C++ and makes use of a selectable pre-buffered or buffer-on-demand methodology to allow fast and efficient printing of text to the EFB. + * <p> + * This library was developed in-full by Armin Tamzarian with the support of developers in \#wiibrew on EFnet. + * + * \section sec_installation_source Installation (Source Code) + * + * -# Ensure that you have the <a href = "http://www.tehskeen.com/forums/showthread.php?t=9404">libFreeType</a> Wii library installed in your development environment with the library added to your Makefile where appropriate. + * -# Ensure that you have the <a href = "http://code.google.com/p/metaphrasis">Metaphrasis</a> library installed in your development environment with the library added to your Makefile where appropriate. + * -# Extract the FreeTypeGX archive. + * -# Copy the contents of the <i>src</i> directory into your project's development path. + * -# Include the FreeTypeGX header file in your code using syntax such as the following: + * \code + * #include "FreeTypeGX.h" + * \endcode + * + * \section sec_installation_library Installation (Library) + * + * -# Ensure that you have the <a href = "http://www.tehskeen.com/forums/showthread.php?t=9404">libFreeType</a> Wii library installed in your development environment with the library added to your Makefile where appropriate. + * -# Ensure that you have the <a href = "http://code.google.com/p/metaphrasis">Metaphrasis</a> library installed in your development environment with the library added to your Makefile where appropriate. + * -# Extract the FreeTypeGX archive. + * -# Copy the contents of the <i>lib</i> directory into your <i>devKitPro/libogc</i> directory. + * -# Include the FreeTypeGX header file in your code using syntax such as the following: + * \code + * #include "FreeTypeGX.h" + * \endcode + * + * \section sec_freetypegx_prerequisites FreeTypeGX Prerequisites + * + * Before you begin using FreeTypeGX in your project you must ensure that the desired font in compiled into your project. For this example I will assume you are building your project with a Makefile using devKitPro evironment and are attempting to include a font whose filename is rursus_compact_mono.ttf. + * + * -# Copy the font into a directory which will be processed by the project's Makefile. If you are unsure about where you should place your font just copy the it into your project's source directory. + * \n\n + * -# Modify the Makefile to convert the font into an object file: + * \code + * %.ttf.o : %.ttf + * @echo $(notdir $<) + * $(bin2o) + * \endcode + * \n + * -# Include the font object's generated header file in your source code: + * \code + * #include "rursus_compact_mono_ttf.h" + * \endcode + * This header file defines the two variables that you will need for use within your project: + * \code + * extern const u8 rursus_compact_mono_ttf[]; A pointer to the font buffer within the compiled project. + * extern const u32 rursus_compact_mono_ttf_size; The size of the font's buffer in bytes. + * \endcode + * + * \section sec_freetypegx_usage FreeTypeGX Usage + * + * -# Within the file you included the FreeTypeGX.h header create an instance object of the FreeTypeGX class: + * \code + * FreeTypeGX *freeTypeGX = new FreeTypeGX(); + * \endcode + * Alternately you can specify a texture format to which you would like to render the font characters. Note that the default value for this parameter is GX_TF_RGBA8. + * \code + * FreeTypeGX *freeTypeGX = new FreeTypeGX(GX_TF_RGB565); + * \endcode + * Furthermore, you can also specify a positional format as defined in your graphics subsystem initialization. Note that the default value for this parameter is GX_POS_XYZ. + * \code + * FreeTypeGX *freeTypeGX = new FreeTypeGX(GX_TF_RGB565, GX_POS_XY); + * \endcode + * \n + * Currently supported textures are: + * \li <i>GX_TF_I4</i> + * \li <i>GX_TF_I8</i> + * \li <i>GX_TF_IA4</i> + * \li <i>GX_TF_IA8</i> + * \li <i>GX_TF_RGB565</i> + * \li <i>GX_TF_RGB5A3</i> + * \li <i>GX_TF_RGBA8</i> + * + * \n + * Currently supported position formats are: + * \li <i>GX_POS_XY</i> + * \li <i>GX_POS_XYZ</i> + * + * \n + * -# Using the allocated FreeTypeGX instance object call the loadFont function to load the font from the compiled buffer and specify the desired point size. Note that this function can be called multiple times to load a new: + * \code + * fontSystem->loadFont(rursus_compact_mono_ttf, rursus_compact_mono_ttf_size, 64); + * \endcode + * Alternately you can specify a flag which will load and cache all available font glyphs immidiately. Note that on large font sets enabling this feature could take a significant amount of time. + * \code + * fontSystem->loadFont(rursus_compact_mono_ttf, rursus_compact_mono_ttf_size, 64, true); + * \endcode + * \n + * -# Using the allocated FreeTypeGX instance object call the drawText function to print a string at the specified screen X and Y coordinates to the current EFB: + * \code + * freeTypeGX->drawText(10, 25, _TEXT("FreeTypeGX Rocks!")); + * \endcode + * Alternately you can specify a <i>GXColor</i> object you would like to apply to the printed characters: + * \code + * freeTypeGX->drawText(10, 25, _TEXT("FreeTypeGX Rocks!"), + * (GXColor){0xff, 0xee, 0xaa, 0xff}); + * \endcode + * Furthermore you can also specify a group of styling parameters which will modify the positioning or style of the text: + * \code + * freeTypeGX->drawText(10, 25, _TEXT("FreeTypeGX Rocks!"), + * (GXColor){0xff, 0xee, 0xaa, 0xff}, + * FTGX_JUSTIFY_CENTER | FTGX_ALIGN_BOTTOM | FTGX_STYLE_UNDERLINE); + * \endcode + * \n + * Currently style parameters are: + * \li <i>FTGX_JUSTIFY_LEFT</i> + * \li <i>FTGX_JUSTIFY_CENTER</i> + * \li <i>FTGX_JUSTIFY_RIGHT</i> + * \li <i>FTGX_ALIGN_TOP</i> + * \li <i>FTGX_ALIGN_MIDDLE</i> + * \li <i>FTGX_ALIGN_BOTTOM</i> + * \li <i>FTGX_STYLE_UNDERLINE</i> + * \li <i>FTGX_STYLE_STRIKE</i> + * + * \section sec_license License + * + * FreeTypeGX is distributed under the GNU Lesser General Public License. + * + * \section sec_contact Contact + * + * If you have any suggestions, questions, or comments regarding this library feel free to e-mail me at tamzarian1989 [at] gmail [dawt] com. + */ + +#ifndef FREETYPEGX_H_ +#define FREETYPEGX_H_ + +#include <gccore.h> +#include <ft2build.h> +#include FT_FREETYPE_H +#include FT_BITMAP_H +#include "Metaphrasis.h" +#include "utils.h" + +#include <malloc.h> +#include <string.h> +#include <wchar.h> +#include <map> + +/*! \struct ftgxCharData_ + * + * Font face character glyph relevant data structure. + */ +typedef struct ftgxCharData_ { + uint16_t glyphAdvanceX; /**< Character glyph X coordinate advance in pixels. */ + uint16_t glyphIndex; /**< Charachter glyph index in the font face. */ + + uint16_t textureWidth; /**< Texture width in pixels/bytes. */ + uint16_t textureHeight; /**< Texture glyph height in pixels/bytes. */ + + uint16_t renderOffsetY; /**< Texture Y axis bearing offset. */ + uint16_t renderOffsetMax; /**< Texture Y axis bearing maximum value. */ + uint16_t renderOffsetMin; /**< Texture Y axis bearing minimum value. */ + + uint32_t* glyphDataTexture; /**< Glyph texture bitmap data buffer. */ +} ftgxCharData; + +/*! \struct ftgxDataOffset_ + * + * Offset structure which hold both a maximum and minimum value. + */ +typedef struct ftgxDataOffset_ { + uint16_t max; /**< Maximum data offset. */ + uint16_t min; /**< Minimum data offset. */ +} ftgxDataOffset; + +#define _TEXT(t) L ## t /**< Unicode helper macro. */ + +#define FTGX_NULL 0x0000 +#define FTGX_JUSTIFY_LEFT 0x0001 +#define FTGX_JUSTIFY_CENTER 0x0002 +#define FTGX_JUSTIFY_RIGHT 0x0004 + +#define FTGX_ALIGN_TOP 0x0010 +#define FTGX_ALIGN_MIDDLE 0x0020 +#define FTGX_ALIGN_BOTTOM 0x0040 + +#define FTGX_STYLE_UNDERLINE 0x0100 +#define FTGX_STYLE_STRIKE 0x0200 + +const GXColor ftgxWhite = (GXColor){0xff, 0xff, 0xff, 0xff}; /**< Constant color value used only to sanitize Doxygen documentation. */ + +/*! \class FreeTypeGX + * \brief Wrapper class for the libFreeType library with GX rendering. + * \author Armin Tamzarian + * \version 0.2.3 + * + * FreeTypeGX acts as a wrapper class for the libFreeType library. It supports precaching of transformed glyph data into + * a specified texture format. Rendering of the data to the EFB is accomplished through the application of high performance + * GX texture functions resulting in high throughput of string rendering. + */ +class FreeTypeGX { + + private: + FT_Library ftLibrary; /**< FreeType FT_Library instance. */ + FT_Face ftFace; /**< FreeType reusable FT_Face typographic object. */ + FT_GlyphSlot ftSlot; /**< FreeType reusable FT_GlyphSlot glyph container object. */ + FT_UInt ftPointSize; /**< Requested size of the rendered font. */ + FT_Pos ftWeight; /**< Requested weight of the rendered font. */ + bool ftKerningEnabled; /**< Flag indicating the availability of font kerning data. */ + float xScale; + float yScale; + float xPos; + float yPos; + + uint8_t textureFormat; /**< Defined texture format of the target EFB. */ + uint8_t positionFormat; /**< Defined position format of the texture. */ + std::map<wchar_t, ftgxCharData> fontData; /**< Map which holds the glyph data structures for the corresponding characters. */ + + static uint16_t adjustTextureWidth(uint16_t textureWidth, uint8_t textureFormat); + static uint16_t adjustTextureHeight(uint16_t textureHeight, uint8_t textureFormat); + + static uint16_t getStyleOffsetWidth(uint16_t width, uint16_t format); + static uint16_t getStyleOffsetHeight(ftgxDataOffset offset, uint16_t format); + + void copyTextureToFramebuffer(GXTexObj *texObj, uint8_t positionFormat, uint16_t texWidth, uint16_t texHeight, int16_t screenX, int16_t screenY, GXColor color); + static void copyFeatureToFramebuffer(uint8_t positionFormat, uint16_t featureWidth, uint16_t featureHeight, int16_t screenX, int16_t screenY, GXColor color); + + void unloadFont(); + ftgxCharData *cacheGlyphData(wchar_t charCode); + uint16_t cacheGlyphDataComplete(); + void loadGlyphData(FT_Bitmap *bmp, ftgxCharData *charData); + void drawTextFeature(uint16_t x, uint16_t y, uint16_t width, ftgxDataOffset offsetData, uint16_t format, GXColor color); + + public: + FreeTypeGX(uint8_t textureFormat = GX_TF_RGBA8, uint8_t positionFormat = GX_POS_XYZ); + ~FreeTypeGX(); + + static wchar_t* charToWideChar(char* p); + + uint16_t loadFont(uint8_t* fontBuffer, FT_Long bufferSize, FT_UInt pointSize, FT_Pos weight = 0, uint32_t index = 0, bool cacheAll = false); + uint16_t loadFont(const uint8_t* fontBuffer, FT_Long bufferSize, FT_UInt pointSize, FT_Pos weight = 0, uint32_t index = 0, bool cacheAll = false); + + uint16_t drawText(uint16_t x, uint16_t y, wchar_t *text, GXColor color = ftgxWhite, uint16_t textStyling = FTGX_NULL); + uint16_t drawText(uint16_t x, uint16_t y, wchar_t const *text, GXColor color = ftgxWhite, uint16_t textStyling = FTGX_NULL); + + uint16_t getWidth(wchar_t *text); + uint16_t getWidth(wchar_t const *text); + uint16_t getHeight(wchar_t *text); + uint16_t getHeight(wchar_t const *text); + ftgxDataOffset getOffset(wchar_t *text); + ftgxDataOffset getOffset(wchar_t const *text); + + float getXScale(void) const { return xScale; } + float getYScale(void) const { return yScale; } + void setXScale(float f) { xScale = f; } + void setYScale(float f) { yScale = f; } + float getX(void) const { return xPos; } + float getY(void) const { return yPos; } + void setX(float f) { xPos = f; } + void setY(float f) { yPos = f; } + void reset(void) { xScale = 1.f; yScale = 1.f; xPos = 0.f; yPos = 0.f; }; +}; + +#endif /* FREETYPEGX_H_ */ diff --git a/source/gui/GameTDB.cpp b/source/gui/GameTDB.cpp new file mode 100644 index 00000000..e4a5fd41 --- /dev/null +++ b/source/gui/GameTDB.cpp @@ -0,0 +1,1006 @@ +/**************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + ***************************************************************************/ +#include <stdio.h> +#include <stdlib.h> +#include <string> +#include <cstring> +#include "GameTDB.hpp" +#include "config.hpp" +#include "video.hpp" +#include "gecko.h" +#include "defines.h" + +#define NAME_OFFSET_DB "gametdb_offsets.bin" +#define MAXREADSIZE 1024*1024 // Cache size only for parsing the offsets: 1MB + +typedef struct _ReplaceStruct +{ + const char * orig; + char replace; + short size; +} ReplaceStruct; + +//! More replacements can be added if needed +static const ReplaceStruct Replacements[] = +{ + { ">", '>', 4 }, + { "<", '<', 4 }, + { """, '\"', 6 }, + { "'", '\'', 6 }, + { "&", '&', 5 }, + { NULL, '\0', 0 } +}; + +GameTDB::GameTDB() + : isLoaded(false), isParsed(false), file(0), filepath(0), LangCode("EN"), GameNodeCache(0) +{ +} + +GameTDB::GameTDB(const char * filepath) + : isLoaded(false), isParsed(false), file(0), filepath(0), LangCode("EN"), GameNodeCache(0) +{ + OpenFile(filepath); +} + +GameTDB::~GameTDB() +{ + CloseFile(); +} + +bool GameTDB::OpenFile(const char * filepath) +{ + if(!filepath) return false; + + gprintf("Trying to open '%s'...", filepath); + file = fopen(filepath, "rb"); + if(file) + { + this->filepath = filepath; + + gprintf("success\n"); + + int pos; + string OffsetsPath = filepath; + if((pos = OffsetsPath.find_last_of('/')) != (int) string::npos) + OffsetsPath[pos] = '\0'; + else + OffsetsPath.clear(); //! Relative path + + gprintf("Checking game offsets\n"); + LoadGameOffsets(OffsetsPath.c_str()); + /*if (!isParsed) + { + gprintf("Checking titles.ini\n"); + CheckTitlesIni(OffsetsPath.c_str()); + }*/ + } + else gprintf("failed\n"); + + isLoaded = (file != NULL); + return isLoaded; +} + +void GameTDB::CloseFile() +{ + OffsetMap.clear(); + + if(GameNodeCache) + delete [] GameNodeCache; + GameNodeCache = NULL; + + if(file) fclose(file); + file = NULL; +} + +void GameTDB::Refresh() +{ + gprintf("Refreshing file '%s'\n", filepath); + CloseFile(); + + if (filepath == NULL) + return; + + OpenFile(filepath); +} + +bool GameTDB::LoadGameOffsets(const char * path) +{ + if(!path) return false; + + string OffsetDBPath = path; + if(strlen(path) > 0 && path[strlen(path)-1] != '/') + OffsetDBPath += '/'; + OffsetDBPath += NAME_OFFSET_DB; + + FILE * fp = fopen(OffsetDBPath.c_str(), "rb"); + if(!fp) + { + bool result = ParseFile(); + if(result) + SaveGameOffsets(OffsetDBPath.c_str()); + + return result; + } + + unsigned long long ExistingVersion = GetGameTDBVersion(); + unsigned long long Version = 0; + unsigned int NodeCount = 0; + + fread(&Version, 1, sizeof(Version), fp); + + if(ExistingVersion != Version) + { + fclose(fp); + bool result = ParseFile(); + if(result) + SaveGameOffsets(OffsetDBPath.c_str()); + + return result; + } + + fread(&NodeCount, 1, sizeof(NodeCount), fp); + + if(NodeCount == 0) + { + fclose(fp); + bool result = ParseFile(); + if(result) + SaveGameOffsets(OffsetDBPath.c_str()); + + return result; + } + + OffsetMap.resize(NodeCount); + + if(fread(&OffsetMap[0], 1, NodeCount*sizeof(GameOffsets), fp) != NodeCount*sizeof(GameOffsets)) + { + fclose(fp); + bool result = ParseFile(); + if(result) + SaveGameOffsets(OffsetDBPath.c_str()); + + return result; + } + + fclose(fp); + + return true; +} + +bool GameTDB::SaveGameOffsets(const char * path) +{ + if(OffsetMap.size() == 0 || !path) + return false; + + FILE * fp = fopen(path, "wb"); + if(!fp) return false; + + unsigned long long ExistingVersion = GetGameTDBVersion(); + unsigned int NodeCount = OffsetMap.size(); + + if(fwrite(&ExistingVersion, 1, sizeof(ExistingVersion), fp) != sizeof(ExistingVersion)) + { + fclose(fp); + return false; + } + + if(fwrite(&NodeCount, 1, sizeof(NodeCount), fp) != sizeof(NodeCount)) + { + fclose(fp); + return false; + } + + if(fwrite(&OffsetMap[0], 1, NodeCount*sizeof(GameOffsets), fp) != NodeCount*sizeof(GameOffsets)) + { + fclose(fp); + return false; + } + + fclose(fp); + + return true; +} + +unsigned long long GameTDB::GetGameTDBVersion() +{ + if(!file) + return 0; + + char TmpText[1024]; + + if(GetData(TmpText, 0, sizeof(TmpText)) < 0) + return 0; + + char * VersionText = GetNodeText(TmpText, "<GameTDB version=\"", "/>"); + if(!VersionText) + return 0; + + return strtoull(VersionText, NULL, 10); +} + +int GameTDB::GetData(char * data, int offset, int size) +{ + if(!file || !data) + return -1; + + fseek(file, offset, SEEK_SET); + + return fread(data, 1, size, file); +} + +char * GameTDB::LoadGameNode(const char * id) +{ + unsigned int read = 0; + + GameOffsets * offset = this->GetGameOffset(id); + if(!offset) + return NULL; + + char * data = new (std::nothrow) char[offset->nodesize+1]; + if(!data) + return NULL; + + if((read = GetData(data, offset->gamenode, offset->nodesize)) != offset->nodesize) + { + delete [] data; + return NULL; + } + + data[read] = '\0'; + + return data; +} + +char * GameTDB::GetGameNode(const char * id) +{ + char * data = NULL; + + if(GameNodeCache != 0 && strncmp(id, GameIDCache, strlen(GameIDCache)) == 0) + { + data = new (std::nothrow) char[strlen(GameNodeCache)+1]; + if(data) + strcpy(data, GameNodeCache); + } + else + { + if(GameNodeCache) + delete [] GameNodeCache; + + GameNodeCache = LoadGameNode(id); + + if(GameNodeCache) + { + snprintf(GameIDCache, sizeof(GameIDCache), id); + data = new (std::nothrow) char[strlen(GameNodeCache)+1]; + if(data) + strcpy(data, GameNodeCache); + } + } + + return data; +} + +GameOffsets * GameTDB::GetGameOffset(const char * gameID) +{ + for(unsigned int i = 0; i < OffsetMap.size(); ++i) + { + if(strncmp(gameID, OffsetMap[i].gameID, strlen(OffsetMap[i].gameID)) == 0) + return &OffsetMap[i]; + } + + return 0; +} + +static inline char * CleanText(char * in_text) +{ + if(!in_text) + return NULL; + + const char * ptr = in_text; + char * text = in_text; + + while(*ptr != '\0') + { + for(int i = 0; Replacements[i].orig != 0; ++i) + { + if(strncmp(ptr, Replacements[i].orig, Replacements[i].size) == 0) + { + ptr += Replacements[i].size; + *text = Replacements[i].replace; + ++text; + i = 0; + continue; + } + } + + if(*ptr == '\r') + { + ++ptr; + continue; + } + + *text = *ptr; + ++ptr; + ++text; + } + + *text = '\0'; + + return in_text; +} + +char * GameTDB::GetNodeText(char * data, const char * nodestart, const char * nodeend) +{ + if(!data || !nodestart || !nodeend) + return NULL; + + char * position = strstr(data, nodestart); + if(!position) + return NULL; + + position += strlen(nodestart); + + char * end = strstr(position, nodeend); + if(!end) + return NULL; + + *end = '\0'; + + return CleanText(position); +} + +char * GameTDB::SeekLang(char * text, const char * langcode) +{ + if(!text || !langcode) return NULL; + + char * ptr = text; + while((ptr = strstr(ptr, "<locale lang=")) != NULL) + { + ptr += strlen("<locale lang=\""); + + if(strncmp(ptr, langcode, strlen(langcode)) == 0) + { + //! Cut off all the other languages + char * end = strstr(ptr, "</locale>"); + if(!end) + return NULL; + + end += strlen("</locale>"); + *end = '\0'; + + return ptr; + } + } + + return NULL; +} + +bool GameTDB::ParseFile() +{ + OffsetMap.clear(); + + if(!file) + return false; + + char * Line = new (std::nothrow) char[MAXREADSIZE+1]; + if(!Line) + return false; + + bool readnew = false; + int i, currentPos = 0; + int read = 0; + const char * gameNode = NULL; + const char * idNode = NULL; + const char * gameEndNode = NULL; + + while((read = GetData(Line, currentPos, MAXREADSIZE)) > 0) + { + gameNode = Line; + readnew = false; + + //! Ensure the null termination at the end + Line[read] = '\0'; + + while((gameNode = strstr(gameNode, "<game name=\"")) != NULL) + { + idNode = strstr(gameNode, "<id>"); + gameEndNode = strstr(gameNode, "</game>"); + if(!idNode || !gameEndNode) + { + //! We are in the middle of the game node, reread complete node and more + currentPos += (gameNode-Line); + fseek(file, currentPos, SEEK_SET); + readnew = true; + break; + } + + idNode += strlen("<id>"); + gameEndNode += strlen("</game>"); + + int size = OffsetMap.size(); + OffsetMap.resize(size+1); + + for(i = 0; i < 7 && *idNode != '<'; ++i, ++idNode) + OffsetMap[size].gameID[i] = *idNode; + OffsetMap[size].gameID[i] = '\0'; + OffsetMap[size].gamenode = currentPos+(gameNode-Line); + OffsetMap[size].nodesize = (gameEndNode-gameNode); + gameNode = gameEndNode; + } + + if(readnew) + continue; + + currentPos += read; + } + + delete [] Line; + + return true; +} + +bool GameTDB::FindTitle(char * data, string & title, string langCode) +{ + char * language = SeekLang(data, langCode.c_str()); + if(!language) + { + language = SeekLang(data, "EN"); + if(!language) + { + return false; + } + } + + char * the_title = GetNodeText(language, "<title>", ""); + if(!the_title) + { + return false; + } + + title = the_title; + return true; +} + +bool GameTDB::GetTitle(const char * id, string & title) +{ + if(!id) return false; + + char * data = GetGameNode(id); + if(!data) return false; + + bool retval = FindTitle(data, title, LangCode); + + delete [] data; + + return retval; +} + +bool GameTDB::GetSynopsis(const char * id, string & synopsis) +{ + if(!id) return false; + + char * data = GetGameNode(id); + if(!data) return false; + + char * language = SeekLang(data, LangCode.c_str()); + if(!language) + { + language = SeekLang(data, "EN"); + if(!language) + { + delete [] data; + return false; + } + } + + char * the_synopsis = GetNodeText(language, "", ""); + if(!the_synopsis) + { + delete [] data; + return false; + } + + synopsis = the_synopsis; + + delete [] data; + + return true; +} + +bool GameTDB::GetRegion(const char * id, string & region) +{ + if(!id) return false; + + char * data = GetGameNode(id); + if(!data) return false; + + char * the_region = GetNodeText(data, "", ""); + if(!the_region) + { + delete [] data; + return false; + } + + region = the_region; + + delete [] data; + + return true; +} + +bool GameTDB::GetDeveloper(const char * id, string & dev) +{ + if(!id) return false; + + char * data = GetGameNode(id); + if(!data) return false; + + char * the_dev = GetNodeText(data, "", ""); + if(!the_dev) + { + delete [] data; + return false; + } + + dev = the_dev; + + delete [] data; + + return true; +} + +bool GameTDB::GetPublisher(const char * id, string & pub) +{ + if(!id) return false; + + char * data = GetGameNode(id); + if(!data) return false; + + char * the_pub = GetNodeText(data, "", ""); + if(!the_pub) + { + delete [] data; + return false; + } + + pub = the_pub; + + delete [] data; + + return true; +} + +unsigned int GameTDB::GetPublishDate(const char * id) +{ + if(!id) return 0; + + char * data = GetGameNode(id); + if(!data) return 0; + + char * year_string = GetNodeText(data, ""); + if(!year_string) + { + delete [] data; + return 0; + } + + unsigned int year, day, month; + + year = atoi(year_string); + + char * month_string = strstr(year_string, "month=\""); + if(!month_string) + { + delete [] data; + return 0; + } + + month_string += strlen("month=\""); + + month = atoi(month_string); + + char * day_string = strstr(month_string, "day=\""); + if(!day_string) + { + delete [] data; + return 0; + } + + day_string += strlen("day=\""); + + day = atoi(day_string); + + delete [] data; + + return ((year & 0xFFFF) << 16 | (month & 0xFF) << 8 | (day & 0xFF)); +} + +bool GameTDB::GetGenres(const char * id, safe_vector & genre) +{ + if(!id) return false; + + char * data = GetGameNode(id); + if(!data) return false; + + char * the_genre = GetNodeText(data, "", ""); + if(!the_genre) + { + delete [] data; + return false; + } + + unsigned int genre_num = 0; + const char * ptr = the_genre; + + while(*ptr != '\0') + { + if(genre_num >= genre.size()) + genre.resize(genre_num+1); + + if(*ptr == ',' || *ptr == '/' || *ptr == ';') + { + ptr++; + while(*ptr == ' ') ptr++; + genre[genre_num].push_back('\0'); + genre_num++; + continue; + } + + if(genre[genre_num].size() == 0) + genre[genre_num].push_back(toupper((int)*ptr)); + else + genre[genre_num].push_back(*ptr); + + ++ptr; + } + genre[genre_num].push_back('\0'); + + delete [] data; + + return true; +} + +const char * GameTDB::RatingToString(int rating) +{ + switch(rating) + { + case 0: + return "CERO"; + case 1: + return "ESRB"; + case 2: + return "PEGI"; + default: + break; + } + + return NULL; +} + +int GameTDB::GetRating(const char * id) +{ + int rating = -1; + + if(!id) return rating; + + char * data = GetGameNode(id); + if(!data) return rating; + + char * rating_text = GetNodeText(data, ""); + if(!rating_text) + { + delete [] data; + return rating; + } + + if(strncmp(rating_text, "CERO", 4) == 0) + rating = 0; + + else if(strncmp(rating_text, "ESRB", 4) == 0) + rating = 1; + + else if(strncmp(rating_text, "PEGI", 4) == 0) + rating = 2; + + delete [] data; + + return rating; +} + +bool GameTDB::GetRatingValue(const char * id, string & rating_value) +{ + if(!id) return false; + + char * data = GetGameNode(id); + if(!data) return false; + + char * rating_text = GetNodeText(data, ""); + if(!rating_text) + { + delete [] data; + return false; + } + + char * value_text = GetNodeText(rating_text, "value=\"", "\""); + if(!value_text) + { + delete [] data; + return false; + } + + rating_value = value_text; + + delete [] data; + + return true; +} + +int GameTDB::GetRatingDescriptors(const char * id, safe_vector & desc_list) +{ + if(!id) + return -1; + + char * data = GetGameNode(id); + if(!data) + return -1; + + char * descriptor_text = GetNodeText(data, "", ""); + if(!descriptor_text) + { + delete [] data; + return -1; + } + + unsigned int list_num = 0; + desc_list.clear(); + + while(*descriptor_text != '\0') + { + if(strncmp(descriptor_text, "", strlen("")) == 0) + { + desc_list[list_num].push_back('\0'); + descriptor_text = strstr(descriptor_text, ""); + if(!descriptor_text) + break; + + descriptor_text += strlen(""); + list_num++; + } + + if(list_num >= desc_list.size()) + desc_list.resize(list_num+1); + + desc_list[list_num].push_back(*descriptor_text); + ++descriptor_text; + } + + delete [] data; + + return desc_list.size(); +} + +int GameTDB::GetWifiPlayers(const char * id) +{ + int players = -1; + + if(!id) + return players; + + char * data = GetGameNode(id); + if(!data) + return players; + + char * PlayersNode = GetNodeText(data, ""); + if(!PlayersNode) + { + delete [] data; + return players; + } + + players = atoi(PlayersNode); + + return players; +} + +int GameTDB::GetWifiFeatures(const char * id, safe_vector & feat_list) +{ + if(!id) + return -1; + + char * data = GetGameNode(id); + if(!data) + return -1; + + char * feature_text = GetNodeText(data, "", ""); + if(!feature_text) + { + delete [] data; + return -1; + } + + unsigned int list_num = 0; + feat_list.clear(); + + while(*feature_text != '\0') + { + if(strncmp(feature_text, "", strlen("")) == 0) + { + feat_list[list_num].push_back('\0'); + feature_text = strstr(feature_text, ""); + if(!feature_text) + break; + + feature_text += strlen(""); + list_num++; + } + + if(list_num >= feat_list.size()) + feat_list.resize(list_num+1); + + + if(feat_list[list_num].size() == 0) + feat_list[list_num].push_back(toupper((int)*feature_text)); + else + feat_list[list_num].push_back(*feature_text); + + ++feature_text; + } + + delete [] data; + + return feat_list.size(); +} + +int GameTDB::GetPlayers(const char * id) +{ + int players = -1; + + if(!id) + return players; + + char * data = GetGameNode(id); + if(!data) + return players; + + char * PlayersNode = GetNodeText(data, ""); + if(!PlayersNode) + { + delete [] data; + return players; + } + + players = atoi(PlayersNode); + + return players; +} + +int GameTDB::GetAccessories(const char * id, safe_vector & acc_list) +{ + if(!id) + return -1; + + char * data = GetGameNode(id); + if(!data) + return -1; + + char * ControlsNode = GetNodeText(data, ""); + if(!ControlsNode) + { + delete [] data; + return -1; + } + + unsigned int list_num = 0; + acc_list.clear(); + + while(ControlsNode && *ControlsNode != '\0') + { + if(list_num >= acc_list.size()) + acc_list.resize(list_num+1); + + for(const char * ptr = ControlsNode; *ptr != '"' && *ptr != '\0'; ptr++) + acc_list[list_num].Name.push_back(*ptr); + + acc_list[list_num].Name.push_back('\0'); + + char * requiredField = strstr(ControlsNode, "required=\""); + if(!requiredField) + { + delete [] data; + return -1; + } + + requiredField += strlen("required=\""); + + acc_list[list_num].Required = strncmp(requiredField, "true", 4) == 0; + + ControlsNode = strstr(requiredField, ""); + if(!ColorNode) return color; + + char format[8]; + sprintf(format, "0x%s", ColorNode); + + return strtoul(format, NULL, 16); +} + +unsigned int GameTDB::GetCaseColor(const char * id) +{ + unsigned int color = -1; + if(!id) return color; + + char * data = GetGameNode(id); + if(!data) return color; + + color = FindCaseColor(data); + + delete [] data; + return color; +} + +bool GameTDB::GetGameXMLInfo(const char * id, GameXMLInfo * gameInfo) +{ + if(!id || !gameInfo) + return false; + + gameInfo->GameID = id; + + GetTitle(id, gameInfo->Title); + GetSynopsis(id, gameInfo->Synopsis); + GetRegion(id, gameInfo->Region); + GetDeveloper(id, gameInfo->Developer); + GetPublisher(id, gameInfo->Publisher); + gameInfo->PublishDate = GetPublishDate(id); + GetGenres(id, gameInfo->Genres); + gameInfo->RatingType = GetRating(id); + GetRatingValue(id, gameInfo->RatingValue); + GetRatingDescriptors(id, gameInfo->RatingDescriptors); + gameInfo->WifiPlayers = GetWifiPlayers(id); + GetWifiFeatures(id, gameInfo->WifiFeatures); + gameInfo->Players = GetPlayers(id); + GetAccessories(id, gameInfo->Accessories); + gameInfo->CaseColor = GetCaseColor(id); + + return true; +} + +bool GameTDB::IsLoaded() +{ + return isLoaded; +} diff --git a/source/gui/GameTDB.hpp b/source/gui/GameTDB.hpp new file mode 100644 index 00000000..62fef472 --- /dev/null +++ b/source/gui/GameTDB.hpp @@ -0,0 +1,160 @@ +/**************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + ***************************************************************************/ +#ifndef GAMETDB_HPP_ +#define GAMETDB_HPP_ + +#include "safe_vector.hpp" +#include + +using namespace std; + +typedef struct _Accessory +{ + string Name; + bool Required; +} Accessory; + +typedef struct _GameXMLInfo +{ + string GameID; + string Region; + string Title; + string Synopsis; + string Developer; + string Publisher; + unsigned int PublishDate; + safe_vector Genres; + int RatingType; + string RatingValue; + safe_vector RatingDescriptors; + int WifiPlayers; + safe_vector WifiFeatures; + int Players; + safe_vector Accessories; + int CaseColor; + +} GameXMLInfo; + +typedef struct _GameOffsets +{ + char gameID[7]; + unsigned int gamenode; + unsigned int nodesize; +} __attribute__((__packed__)) GameOffsets; + +class GameTDB +{ + public: + //! Constructor + GameTDB(); + //! Constructor + //! If filepath is passed the xml file is opened and the node offsets are loaded + GameTDB(const char * filepath); + //! Destructor + ~GameTDB(); + //! If filepath is passed the xml file is opened and the node offsets are loaded + bool OpenFile(const char * filepath); + //! Closes the GameTDB xml file + void CloseFile(); + //! Refresh the GameTDB xml file, in case the file has been updated + void Refresh(); + //! Set the language code which should be use to find the appropriate language + //! If the language code is not found, the language code defaults to EN + void SetLanguageCode(const char * code) { if(code) LangCode = code; }; + //! Get the current set language code + const char * GetLanguageCode() { return LangCode.c_str(); }; + //! Get the title of a specific game id in the language defined in LangCode + bool GetTitle(const char * id, string & title); + //! Get the synopsis of a specific game id in the language defined in LangCode + bool GetSynopsis(const char * id, string & synopsis); + //! Get the region of a game for a specific game id + bool GetRegion(const char * id, string & region); + //! Get the developer of a game for a specific game id + bool GetDeveloper(const char * id, string & dev); + //! Get the publisher of a game for a specific game id + bool GetPublisher(const char * id, string & pub); + //! Get the publish date of a game for a specific game id + //! First 1 byte is the day, than 1 byte month and last 2 bytes is the year + //! year = (return >> 16), month = (return >> 8) & 0xFF, day = return & 0xFF + unsigned int GetPublishDate(const char * id); + //! Get the genre list of a game for a specific game id + bool GetGenres(const char * id, safe_vector & genre); + //! Get the rating type for a specific game id + //! The rating type can be converted to a string with GameTDB::RatingToString(rating) + int GetRating(const char * id); + //! Get the rating value for a specific game id + bool GetRatingValue(const char * id, string & rating_value); + //! Get the rating descriptor list inside a vector for a specific game id + //! Returns the amount of descriptors found or -1 if failed + int GetRatingDescriptors(const char * id, safe_vector & desc_list); + //! Get the wifi player count for a specific game id + //! Returns the amount of wifi players or -1 if failed + int GetWifiPlayers(const char * id); + //! Get the wifi feature list inside a vector for a specific game id + //! Returns the amount of wifi features found or -1 if failed + int GetWifiFeatures(const char * id, safe_vector & feat_list); + //! Get the player count for a specific game id + //! Returns the amount of players or -1 if failed + int GetPlayers(const char * id); + //! Returns the amount of accessoires found or -1 if failed + //! Get the accessoire (inputs) list inside a vector for a specific game id + int GetAccessories(const char * id, safe_vector & acc_list); + //! Get the box (case) color for a specific game id + //! Returns the color in RGB (first 3 bytes) + unsigned int GetCaseColor(const char * id); + //! Get the complete game info in the GameXMLInfo struct + bool GetGameXMLInfo(const char * id, GameXMLInfo * gameInfo); + //! Convert a specific game rating to a string + static const char * RatingToString(int rating); + //! Get the version of the gametdb xml database + unsigned long long GetGameTDBVersion(); + //! Get the entry count in the xml database + inline size_t GetEntryCount() { return OffsetMap.size(); }; + //! Is a database loaded + bool IsLoaded(); + private: + bool ParseFile(); + bool LoadGameOffsets(const char * path); + bool SaveGameOffsets(const char * path); + bool CheckTitlesIni(const char * path); + bool FindTitle(char * data, string & title, string langCode); + unsigned int FindCaseColor(char * data); + inline int GetData(char * data, int offset, int size); + inline char * LoadGameNode(const char * id); + inline char * GetGameNode(const char * id); + inline GameOffsets * GetGameOffset(const char * id); + inline char * SeekLang(char * text, const char * langcode); + inline char * GetNodeText(char * data, const char * nodestart, const char * nodeend); + + bool isLoaded; + bool isParsed; + safe_vector OffsetMap; + FILE * file; + const char *filepath; + string LangCode; + char * GameNodeCache; + char GameIDCache[7]; +}; + +#endif diff --git a/source/gui/Metaphrasis.cpp b/source/gui/Metaphrasis.cpp new file mode 100644 index 00000000..79a33071 --- /dev/null +++ b/source/gui/Metaphrasis.cpp @@ -0,0 +1,384 @@ +/* + * Metaphrasis is a static conversion class for transforming RGBA image + * buffers into verious GX texture formats for Wii homebrew development. + * Copyright (C) 2008 Armin Tamzarian + * + * This file is part of Metaphrasis. + * + * Metaphrasis is free software: you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License as published + * by the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * Metaphrasis 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 Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public License + * along with Metaphrasis. If not, see . + */ + +#include "Metaphrasis.h" +#include "mem2.hpp" + +/** + * Default constructor for the Metaphrasis class. + */ + +Metaphrasis::Metaphrasis() { +} + +/** + * Default destructor for the Metaphrasis class. + */ + +Metaphrasis::~Metaphrasis() { +} + +/** + * Convert the specified RGBA data buffer into the I4 texture format + * + * This routine converts the RGBA data buffer into the I4 texture format and returns a pointer to the converted buffer. + * + * @param rgbaBuffer Buffer containing the temporarily rendered RGBA data. + * @param bufferWidth Pixel width of the data buffer. + * @param bufferHeight Pixel height of the data buffer. + * @return A pointer to the allocated buffer. + */ + +uint32_t* Metaphrasis::convertBufferToI4(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight) { + uint32_t bufferSize = bufferWidth * bufferHeight >> 1; + uint32_t* dataBufferI4 = (uint32_t *)MEM2_alloc(bufferSize); + memset(dataBufferI4, 0x00, bufferSize); + + uint32_t *src = (uint32_t *)rgbaBuffer; + uint8_t *dst = (uint8_t *)dataBufferI4; + + for(uint16_t y = 0; y < bufferHeight; y += 8) { + for(uint16_t x = 0; x < bufferWidth; x += 8) { + for(uint16_t rows = 0; rows < 8; rows++) { + *dst++ = (src[((y + rows) * bufferWidth) + (x + 0)] & 0xf0) | ((src[((y + rows) * bufferWidth) + (x + 1)] & 0xf0) >> 4); + *dst++ = (src[((y + rows) * bufferWidth) + (x + 2)] & 0xf0) | ((src[((y + rows) * bufferWidth) + (x + 3)] & 0xf0) >> 4); + *dst++ = (src[((y + rows) * bufferWidth) + (x + 4)] & 0xf0) | ((src[((y + rows) * bufferWidth) + (x + 5)] & 0xf0) >> 4); + *dst++ = (src[((y + rows) * bufferWidth) + (x + 5)] & 0xf0) | ((src[((y + rows) * bufferWidth) + (x + 7)] & 0xf0) >> 4); + } + } + } + DCFlushRange(dataBufferI4, bufferSize); + + return dataBufferI4; +} + +/** + * Convert the specified RGBA data buffer into the I8 texture format + * + * This routine converts the RGBA data buffer into the I8 texture format and returns a pointer to the converted buffer. + * + * @param rgbaBuffer Buffer containing the temporarily rendered RGBA data. + * @param bufferWidth Pixel width of the data buffer. + * @param bufferHeight Pixel height of the data buffer. + * @return A pointer to the allocated buffer. + */ + +uint32_t* Metaphrasis::convertBufferToI8(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight) { + uint32_t bufferSize = bufferWidth * bufferHeight; + uint32_t* dataBufferI8 = (uint32_t *)MEM2_alloc(bufferSize); + memset(dataBufferI8, 0x00, bufferSize); + + uint32_t *src = (uint32_t *)rgbaBuffer; + uint8_t *dst = (uint8_t *)dataBufferI8; + + for(uint16_t y = 0; y < bufferHeight; y += 4) { + for(uint16_t x = 0; x < bufferWidth; x += 8) { + for(uint16_t rows = 0; rows < 4; rows++) { + *dst++ = src[((y + rows) * bufferWidth) + (x + 0)] & 0xff; + *dst++ = src[((y + rows) * bufferWidth) + (x + 1)] & 0xff; + *dst++ = src[((y + rows) * bufferWidth) + (x + 2)] & 0xff; + *dst++ = src[((y + rows) * bufferWidth) + (x + 3)] & 0xff; + *dst++ = src[((y + rows) * bufferWidth) + (x + 4)] & 0xff; + *dst++ = src[((y + rows) * bufferWidth) + (x + 5)] & 0xff; + *dst++ = src[((y + rows) * bufferWidth) + (x + 6)] & 0xff; + *dst++ = src[((y + rows) * bufferWidth) + (x + 7)] & 0xff; + } + } + } + DCFlushRange(dataBufferI8, bufferSize); + + return dataBufferI8; +} + +/** + * Downsample the specified RGBA value data buffer to an IA4 value. + * + * This routine downsamples the given RGBA data value into the IA4 texture data format. + * + * @param rgba A 32-bit RGBA value to convert to the IA4 format. + * @return The IA4 value of the given RGBA value. + */ + +uint8_t Metaphrasis::convertRGBAToIA4(uint32_t rgba) { + uint8_t i, a; + + i = (rgba >> 8) & 0xf0; + a = (rgba ) & 0xff; + + return i | (a >> 4); +} + +/** + * Convert the specified RGBA data buffer into the IA4 texture format + * + * This routine converts the RGBA data buffer into the IA4 texture format and returns a pointer to the converted buffer. + * + * @param rgbaBuffer Buffer containing the temporarily rendered RGBA data. + * @param bufferWidth Pixel width of the data buffer. + * @param bufferHeight Pixel height of the data buffer. + * @return A pointer to the allocated buffer. + */ + +uint32_t* Metaphrasis::convertBufferToIA4(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight) { + uint32_t bufferSize = bufferWidth * bufferHeight; + uint32_t* dataBufferIA4 = (uint32_t *)MEM2_alloc(bufferSize); + memset(dataBufferIA4, 0x00, bufferSize); + + uint32_t *src = (uint32_t *)rgbaBuffer; + uint8_t *dst = (uint8_t *)dataBufferIA4; + + for(uint16_t y = 0; y < bufferHeight; y += 4) { + for(uint16_t x = 0; x < bufferWidth; x += 8) { + for(uint16_t rows = 0; rows < 4; rows++) { + *dst++ = Metaphrasis::convertRGBAToIA4(src[((y + rows) * bufferWidth) + (x + 0)]); + *dst++ = Metaphrasis::convertRGBAToIA4(src[((y + rows) * bufferWidth) + (x + 1)]); + *dst++ = Metaphrasis::convertRGBAToIA4(src[((y + rows) * bufferWidth) + (x + 2)]); + *dst++ = Metaphrasis::convertRGBAToIA4(src[((y + rows) * bufferWidth) + (x + 3)]); + *dst++ = Metaphrasis::convertRGBAToIA4(src[((y + rows) * bufferWidth) + (x + 4)]); + *dst++ = Metaphrasis::convertRGBAToIA4(src[((y + rows) * bufferWidth) + (x + 5)]); + *dst++ = Metaphrasis::convertRGBAToIA4(src[((y + rows) * bufferWidth) + (x + 6)]); + *dst++ = Metaphrasis::convertRGBAToIA4(src[((y + rows) * bufferWidth) + (x + 7)]); + } + } + } + DCFlushRange(dataBufferIA4, bufferSize); + + return dataBufferIA4; +} + +/** + * Downsample the specified RGBA value data buffer to an IA8 value. + * + * This routine downsamples the given RGBA data value into the IA8 texture data format. + * + * @param rgba A 32-bit RGBA value to convert to the IA8 format. + * @return The IA8 value of the given RGBA value. + */ + +uint16_t Metaphrasis::convertRGBAToIA8(uint32_t rgba) { + uint8_t i, a; + + i = (rgba >> 8) & 0xff; + a = (rgba ) & 0xff; + + return (i << 8) | a; +} + +/** + * Convert the specified RGBA data buffer into the IA8 texture format + * + * This routine converts the RGBA data buffer into the IA8 texture format and returns a pointer to the converted buffer. + * + * @param rgbaBuffer Buffer containing the temporarily rendered RGBA data. + * @param bufferWidth Pixel width of the data buffer. + * @param bufferHeight Pixel height of the data buffer. + * @return A pointer to the allocated buffer. + */ + +uint32_t* Metaphrasis::convertBufferToIA8(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight) { + uint32_t bufferSize = (bufferWidth * bufferHeight) << 1; + uint32_t* dataBufferIA8 = (uint32_t *)MEM2_alloc(bufferSize); + memset(dataBufferIA8, 0x00, bufferSize); + + uint32_t *src = (uint32_t *)rgbaBuffer; + uint16_t *dst = (uint16_t *)dataBufferIA8; + + for(uint16_t y = 0; y < bufferHeight; y += 4) { + for(uint16_t x = 0; x < bufferWidth; x += 4) { + for(uint16_t rows = 0; rows < 4; rows++) { + *dst++ = Metaphrasis::convertRGBAToIA8(src[((y + rows) * bufferWidth) + (x + 0)]); + *dst++ = Metaphrasis::convertRGBAToIA8(src[((y + rows) * bufferWidth) + (x + 1)]); + *dst++ = Metaphrasis::convertRGBAToIA8(src[((y + rows) * bufferWidth) + (x + 2)]); + *dst++ = Metaphrasis::convertRGBAToIA8(src[((y + rows) * bufferWidth) + (x + 3)]); + } + } + } + DCFlushRange(dataBufferIA8, bufferSize); + + return dataBufferIA8; +} + +/** + * Convert the specified RGBA data buffer into the RGBA8 texture format + * + * This routine converts the RGBA data buffer into the RGBA8 texture format and returns a pointer to the converted buffer. + * + * @param rgbaBuffer Buffer containing the temporarily rendered RGBA data. + * @param bufferWidth Pixel width of the data buffer. + * @param bufferHeight Pixel height of the data buffer. + * @return A pointer to the allocated buffer. + */ + +uint32_t* Metaphrasis::convertBufferToRGBA8(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight) { + uint32_t bufferSize = (bufferWidth * bufferHeight) << 2; + uint32_t* dataBufferRGBA8 = (uint32_t *)MEM2_alloc(bufferSize); + memset(dataBufferRGBA8, 0x00, bufferSize); + + uint8_t *src = (uint8_t *)rgbaBuffer; + uint8_t *dst = (uint8_t *)dataBufferRGBA8; + + for(uint16_t block = 0; block < bufferHeight; block += 4) { + for(uint16_t i = 0; i < bufferWidth; i += 4) { + for (uint16_t c = 0; c < 4; c++) { + for (uint16_t ar = 0; ar < 4; ar++) { + *dst++ = src[(((i + ar) + ((block + c) * bufferWidth)) * 4) + 3]; + *dst++ = src[((i + ar) + ((block + c) * bufferWidth)) * 4]; + } + } + for (uint16_t c = 0; c < 4; c++) { + for (uint16_t gb = 0; gb < 4; gb++) { + *dst++ = src[(((i + gb) + ((block + c) * bufferWidth)) * 4) + 1]; + *dst++ = src[(((i + gb) + ((block + c) * bufferWidth)) * 4) + 2]; + } + } + } + } + DCFlushRange(dataBufferRGBA8, bufferSize); + + return dataBufferRGBA8; +} + +/** + * Downsample the specified RGBA value data buffer to an RGB565 value. + * + * This routine downsamples the given RGBA data value into the RGB565 texture data format. + * Attribution for this routine is given fully to NoNameNo of GRRLIB Wii library. + * + * @param rgba A 32-bit RGBA value to convert to the RGB565 format. + * @return The RGB565 value of the given RGBA value. + */ + +uint16_t Metaphrasis::convertRGBAToRGB565(uint32_t rgba) { + uint8_t r, g, b; + + r = (((rgba >> 24) & 0xff) * 31) / 255; + g = (((rgba >> 16) & 0xff) * 63) / 255; + b = (((rgba >> 8) & 0xff) * 31) / 255; + + return (((r << 6) | g ) << 5 ) | b; +} + +/** + * Convert the specified RGBA data buffer into the RGB565 texture format + * + * This routine converts the RGBA data buffer into the RGB565 texture format and returns a pointer to the converted buffer. + * + * @param rgbaBuffer Buffer containing the temporarily rendered RGBA data. + * @param bufferWidth Pixel width of the data buffer. + * @param bufferHeight Pixel height of the data buffer. + * @return A pointer to the allocated buffer. + */ + +uint32_t* Metaphrasis::convertBufferToRGB565(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight) { + uint32_t bufferSize = (bufferWidth * bufferHeight) << 1; + uint32_t* dataBufferRGB565 = (uint32_t *)MEM2_alloc(bufferSize); + memset(dataBufferRGB565, 0x00, bufferSize); + + uint32_t *src = (uint32_t *)rgbaBuffer; + uint16_t *dst = (uint16_t *)dataBufferRGB565; + + for(uint16_t y = 0; y < bufferHeight; y += 4) { + for(uint16_t x = 0; x < bufferWidth; x += 4) { + for(uint16_t rows = 0; rows < 4; rows++) { + *dst++ = Metaphrasis::convertRGBAToRGB565(src[((y + rows) * bufferWidth) + (x + 0)]); + *dst++ = Metaphrasis::convertRGBAToRGB565(src[((y + rows) * bufferWidth) + (x + 1)]); + *dst++ = Metaphrasis::convertRGBAToRGB565(src[((y + rows) * bufferWidth) + (x + 2)]); + *dst++ = Metaphrasis::convertRGBAToRGB565(src[((y + rows) * bufferWidth) + (x + 3)]); + } + } + } + DCFlushRange(dataBufferRGB565, bufferSize); + + return dataBufferRGB565; +} + +/** + * Downsample the specified RGBA value data buffer to an RGB5A3 value. + * + * This routine downsamples the given RGBA data value into the RGB5A3 texture data format. + * Attribution for this routine is given fully to WiiGator via the TehSkeen forum. + * + * @param rgba A 32-bit RGBA value to convert to the RGB5A3 format. + * @return The RGB5A3 value of the given RGBA value. + */ + +uint16_t Metaphrasis::convertRGBAToRGB5A3(uint32_t rgba) { + uint32_t r, g, b, a; + uint16_t color; + + r = (rgba >> 24) & 0xff; + g = (rgba >> 16) & 0xff; + b = (rgba >> 8) & 0xff; + a = (rgba ) & 0xff; + + if (a > 0xe0) { + r = r >> 3; + g = g >> 3; + b = b >> 3; + + color = (r << 10) | (g << 5) | b; + color |= 0x8000; + } + else { + r = r >> 4; + g = g >> 4; + b = b >> 4; + a = a >> 5; + + color = (a << 12) | (r << 8) | (g << 4) | b; + } + + return color; +} + +/** + * Convert the specified RGBA data buffer into the RGB5A3 texture format + * + * This routine converts the RGBA data buffer into the RGB5A3 texture format and returns a pointer to the converted buffer. + * + * @param rgbaBuffer Buffer containing the temporarily rendered RGBA data. + * @param bufferWidth Pixel width of the data buffer. + * @param bufferHeight Pixel height of the data buffer. + * @return A pointer to the allocated buffer. + */ + +uint32_t* Metaphrasis::convertBufferToRGB5A3(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight) { + uint32_t bufferSize = (bufferWidth * bufferHeight) << 1; + uint32_t* dataBufferRGB5A3 = (uint32_t *)MEM2_alloc(bufferSize); + memset(dataBufferRGB5A3, 0x00, bufferSize); + + uint32_t *src = (uint32_t *)rgbaBuffer; + uint16_t *dst = (uint16_t *)dataBufferRGB5A3; + + for(uint16_t y = 0; y < bufferHeight; y += 4) { + for(uint16_t x = 0; x < bufferWidth; x += 4) { + for(uint16_t rows = 0; rows < 4; rows++) { + *dst++ = Metaphrasis::convertRGBAToRGB5A3(src[((y + rows) * bufferWidth) + (x + 0)]); + *dst++ = Metaphrasis::convertRGBAToRGB5A3(src[((y + rows) * bufferWidth) + (x + 1)]); + *dst++ = Metaphrasis::convertRGBAToRGB5A3(src[((y + rows) * bufferWidth) + (x + 2)]); + *dst++ = Metaphrasis::convertRGBAToRGB5A3(src[((y + rows) * bufferWidth) + (x + 3)]); + } + } + } + DCFlushRange(dataBufferRGB5A3, bufferSize); + + return dataBufferRGB5A3; +} diff --git a/source/gui/Metaphrasis.h b/source/gui/Metaphrasis.h new file mode 100644 index 00000000..4ca88713 --- /dev/null +++ b/source/gui/Metaphrasis.h @@ -0,0 +1,116 @@ +/* + * Metaphrasis is a static conversion class for transforming RGBA image + * buffers into verious GX texture formats for Wii homebrew development. + * Copyright (C) 2008 Armin Tamzarian + * + * This file is part of Metaphrasis. + * + * Metaphrasis is free software: you can redistribute it and/or modify + * it under the terms of the GNU Lesser General Public License as published + * by the Free Software Foundation, either version 3 of the License, or + * (at your option) any later version. + * + * Metaphrasis 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 Lesser General Public License for more details. + * + * You should have received a copy of the GNU Lesser General Public License + * along with Metaphrasis. If not, see . + */ + +/** \mainpage Metaphrasis + * + * \section sec_intro Introduction + * + * Metaphrasis is a static conversion class for transforming RGBA image buffers into verious GX texture formats for Wii homebrew development. + *
+ * Metaphrasis is written in C++ and makes use of a community standard and newly developed algorithms for conversion of 32-bit RGBA data buffers into various GX texture formats common to both the Gamecube and Wii platforms. + *

+ * This library was developed in-full by Armin Tamzarian with the support of developers in \#wiibrew on EFnet, Chaosteil of libwiisprite, and DrTwox of GRRLIB. + * + * \section sec_installation_source Installation (Source Code) + * + * -# Extract the Metaphrasis archive. + * -# Copy the contents of the src directory into your project's development path. + * -# Include the Metaphrasis header file in your code using syntax such as the following: + * \code + * #include "Metaphrasis.h" + * \endcode + * + * \section sec_installation_library Installation (Library) + * + * -# Extract the Metaphrasis archive. + * -# Copy the contents of the lib directory into your devKitPro/libogc directory. + * -# Include the Metaphrasis header file in your code using syntax such as the following: + * \code + * #include "Metaphrasis.h" + * \endcode + * + * \section sec_usage Usage + * + * -# Create a buffer full of 32-bit RGBA values noting both the pixel height and width of the buffer. + * -# Call one of the many conversion routines from within your code. (Note: All methods within the Metaphrasis class are static and thus no class instance need be allocated) + * \code + * uint32_t* rgba8Buffer = Metaphrasis::convertBufferToRGBA8(rgbaBuffer, bufferWidth, bufferHeight); + * \endcode + * -# Free your temporary RGBA value buffer if you no longer need said values. + * + * Currently supported conversion routines are as follows: + * \li convertBufferToI4 + * \li convertBufferToI8 + * \li convertBufferToIA4 + * \li convertBufferToIA8 + * \li convertBufferToRGBA8 + * \li convertBufferToRGB565 + * \li convertBufferToRGB5A3 + * + * \section sec_license License + * + * Metaphrasis is distributed under the GNU Lesser General Public License. + * + * \section sec_contact Contact + * + * If you have any suggestions, questions, or comments regarding this library feel free to e-mail me at tamzarian1989 [at] gmail [dawt] com. + */ + +#ifndef METAPHRASIS_H_ +#define METAPHRASIS_H_ + +#include +#include +#include +#include + +/*! \class Metaphrasis + * \brief A static conversion class for transforming RGBA image buffers into verious GX texture formats for + * Wii homebrew development. + * \author Armin Tamzarian + * \version 0.1.0 + * + * Metaphrasis is a static conversion class for transforming RGBA image buffers into verious GX texture formats for + * Wii homebrew development. Metaphrasis is written in C++ and makes use of a community standard and newly developed + * algorithms for conversion of 32-bit RGBA data buffers into various GX texture formats common to both the Gamecube + * and Wii platforms. + */ +class Metaphrasis { + public: + Metaphrasis(); + virtual ~Metaphrasis(); + + static uint32_t* convertBufferToI4(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight); + static uint32_t* convertBufferToI8(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight); + static uint32_t* convertBufferToIA4(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight); + static uint32_t* convertBufferToIA8(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight); + static uint32_t* convertBufferToRGBA8(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight); + static uint32_t* convertBufferToRGB565(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight); + static uint32_t* convertBufferToRGB5A3(uint32_t* rgbaBuffer, uint16_t bufferWidth, uint16_t bufferHeight); + + static uint8_t convertRGBAToIA4(uint32_t rgba); + static uint16_t convertRGBAToIA8(uint32_t rgba); + static uint16_t convertRGBAToRGB565(uint32_t rgba); + static uint16_t convertRGBAToRGB5A3(uint32_t rgba); + +}; + +#endif /*METAPHRASIS_H_*/ diff --git a/source/gui/Timer.h b/source/gui/Timer.h new file mode 100644 index 00000000..1baea970 --- /dev/null +++ b/source/gui/Timer.h @@ -0,0 +1,18 @@ +#ifndef _TIMER_HPP +#define _TIMER_HPP + +#include + +class Timer +{ + public: + Timer() { starttick = gettime(); }; + ~Timer() { }; + float elapsed() { return (float) (gettime()-starttick)/(1000.0f*TB_TIMER_CLOCK); }; + float elapsed_millisecs() { return 1000.0f*elapsed(); }; + void reset() { starttick = gettime(); } + protected: + u64 starttick; +}; + +#endif \ No newline at end of file diff --git a/source/gui/WiiMovie.cpp b/source/gui/WiiMovie.cpp new file mode 100644 index 00000000..07184815 --- /dev/null +++ b/source/gui/WiiMovie.cpp @@ -0,0 +1,352 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * WiiMovie.cpp + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include +#include + +#include "WiiMovie.hpp" +#include "musicplayer.h" +#include "gecko.h" + +#define SND_BUFFERS 8 +#define FRAME_BUFFERS 8 + +static BufferCircle * soundBuffer = NULL; + +WiiMovie::WiiMovie(const char * filepath) +{ + VideoFrameCount = 0; + fps = 0.0f; + ExitRequested = false; + fullScreen = false; + Playing = false; + volume = 128; + ThreadStack = NULL; + PlayThread = LWP_THREAD_NULL; + + gprintf("Opening video '%s'\n", filepath); + + string file(filepath); + Video = openVideo(file); + if(!Video) + { + gprintf("Open video failed\n"); + ExitRequested = true; + return; + } + + SndChannels = (Video->getNumChannels() == 2) ? VOICE_STEREO_16BIT : VOICE_MONO_16BIT; + SndFrequence = Video->getFrequency(); + fps = Video->getFps(); + maxSoundSize = Video->getMaxAudioSamples()*Video->getNumChannels()*2; + gprintf("Open video succeeded: sound channels: %d, Frequency: %d, FPS: %4.3f\n", SndChannels, SndFrequence, fps); + + if (Video->hasSound()) + { + gprintf("Video has sound\n"); + soundBuffer = &SoundBuffer; + soundBuffer->Resize(SND_BUFFERS); + soundBuffer->SetBufferBlockSize(maxSoundSize * FRAME_BUFFERS); + } + + PlayThreadStack = NULL; + ThreadStack = (u8 *) memalign(32, 32768); + if (!ThreadStack) + return; + + LWP_MutexInit(&mutex, true); + LWP_CreateThread (&ReadThread, UpdateThread, this, ThreadStack, 32768, LWP_PRIO_HIGHEST); + gprintf("Reading frames thread started\n"); +} + +WiiMovie::~WiiMovie() +{ + gprintf("Destructing WiiMovie object\n"); + Playing = true; + ExitRequested = true; + + Stop(); + + LWP_ResumeThread(ReadThread); + LWP_JoinThread(ReadThread, NULL); + LWP_MutexDestroy(mutex); + + ASND_StopVoice(10); + MusicPlayer::Instance()->Play(); + + if (ReadThread != LWP_THREAD_NULL) + { + LWP_ResumeThread(ReadThread); + LWP_JoinThread(ReadThread, NULL); + } + if (mutex != LWP_MUTEX_NULL) + { + LWP_MutexUnlock(mutex); + LWP_MutexDestroy(mutex); + } + if (ThreadStack != NULL) + { + SAFE_FREE(ThreadStack); + ThreadStack = NULL; + } + + soundBuffer = NULL; + + Frames.clear(); + + if(Video) + closeVideo(Video); +} + +bool WiiMovie::Play(bool loop) +{ + if(!Video) return false; + + gprintf("Start playing video\n"); + + PlayThreadStack = (u8 *) memalign(32, 32768); + if (PlayThreadStack == NULL) return false; + + Playing = true; + PlayTime.reset(); + + Video->loop = loop; + + gprintf("Start playing thread\n"); + + LWP_ResumeThread(ReadThread); + LWP_CreateThread(&PlayThread, PlayingThread, this, PlayThreadStack, 32768, 70); + + return true; +} + +void WiiMovie::Stop() +{ + gprintf("Stopping WiiMovie video\n"); + ExitRequested = true; + if (PlayThread != LWP_THREAD_NULL) + { + LWP_JoinThread(PlayThread, NULL); + } + PlayThread = LWP_THREAD_NULL; + gprintf("Playing thread stopped\n"); + + SAFE_FREE(PlayThreadStack); +} + +void WiiMovie::SetVolume(int vol) +{ + volume = 255 * vol/100; + ASND_ChangeVolumeVoice(10, volume, volume); +} + +void WiiMovie::SetScreenSize(int width, int height, int top, int left) +{ + screenwidth = width; + screenheight = height; + screenleft = left; + screentop = top; +} + +void WiiMovie::SetFullscreen() +{ + if(!Video) return; + + float newscale = 1000.0f; + + float vidwidth = (float) width * 1.0f; + float vidheight = (float) height * 1.0f; + int retries = 100; + fullScreen = true; + + while(vidheight * newscale > screenheight || vidwidth * newscale > screenwidth) + { + if(vidheight * newscale > screenheight) + newscale = screenheight/vidheight; + if(vidwidth * newscale > screenwidth) + newscale = screenwidth/vidwidth; + + retries--; + if(retries == 0) + { + newscale = 1.0f; + break; + } + } + + scaleX = scaleY = newscale; +} + +void WiiMovie::SetFrameSize(int w, int h) +{ + if(!Video) return; + + scaleX = (float) w /(float) width; + scaleY = (float) h /(float) height; +} + +void WiiMovie::SetAspectRatio(float Aspect) +{ + if(!Video) return; + + float vidwidth = (float) height*scaleY*Aspect; + + scaleX = (float) width/vidwidth; +} + +extern "C" void THPSoundCallback(int voice) +{ + if (!soundBuffer || !soundBuffer->IsBufferReady()) return; + + if(ASND_AddVoice(voice, soundBuffer->GetBuffer(), soundBuffer->GetBufferSize()) != SND_OK) + return; + + soundBuffer->LoadNext(); +} + +void WiiMovie::FrameLoadLoop() +{ + while (!ExitRequested) + { + LoadNextFrame(); + + while (Frames.size() > FRAME_BUFFERS && !ExitRequested) + usleep(100); + } +} + +void * WiiMovie::UpdateThread(void *arg) +{ + WiiMovie *movie = static_cast(arg); + while (!movie->ExitRequested) + { + movie->ReadNextFrame(); + usleep(100); + } + return NULL; +} + +void * WiiMovie::PlayingThread(void *arg) +{ + WiiMovie *movie = static_cast(arg); + movie->FrameLoadLoop(); + + return NULL; +} + +void WiiMovie::ReadNextFrame() +{ + if(!Playing) LWP_SuspendThread(ReadThread); + + u32 FramesNeeded = (u32) (PlayTime.elapsed()*fps); + + gprintf("Reading needed frames: %d\n", FramesNeeded); + + while(VideoFrameCount < FramesNeeded) + { + LWP_MutexLock(mutex); + Video->loadNextFrame(); + LWP_MutexUnlock(mutex); + + ++VideoFrameCount; + + gprintf("Loaded video frame: %d\n", VideoFrameCount); + + if(Video->hasSound()) + { + u32 newWhich = SoundBuffer.Which(); + int i = 0; + for (i = 0; i < SoundBuffer.Size()-2; ++i) + { + if (!SoundBuffer.IsBufferReady(newWhich)) break; + + newWhich = (newWhich + 1) % SoundBuffer.Size(); + } + + if (i == SoundBuffer.Size() - 2) return; + + int currentSize = SoundBuffer.GetBufferSize(newWhich); + currentSize += Video->getCurrentBuffer((s16 *) (&SoundBuffer.GetBuffer(newWhich)[currentSize]))*SndChannels*2; + SoundBuffer.SetBufferSize(newWhich, currentSize); + + if(currentSize >= (FRAME_BUFFERS-1)*maxSoundSize) + SoundBuffer.SetBufferReady(newWhich, true); + + if(ASND_StatusVoice(10) == SND_UNUSED && SoundBuffer.IsBufferReady()) + { + ASND_StopVoice(10); + ASND_SetVoice(10, SndChannels == 2 ? VOICE_STEREO_16BIT : VOICE_MONO_16BIT, SndFrequence, 0, SoundBuffer.GetBuffer(), SoundBuffer.GetBufferSize(), volume, volume, THPSoundCallback); + SoundBuffer.LoadNext(); + } + } + } + +// usleep(100); +} + +void WiiMovie::LoadNextFrame() +{ + if(!Video || !Playing) + { + return; + } + + VideoFrame VideoF; + LWP_MutexLock(mutex); + Video->getCurrentFrame(VideoF); + LWP_MutexUnlock(mutex); + + if(!VideoF.getData()) return; + + if(width != VideoF.getWidth()) + { + width = VideoF.getWidth(); + height = VideoF.getHeight(); + if (fullScreen) + SetFullscreen(); + else + { + // Calculate new top and left + screenleft = (screenwidth - width) / 2; + screentop = (screenheight - height) / 2; + } + } + + STexture frame; + if (frame.fromRAW(VideoF.getData(), VideoF.getWidth(), VideoF.getHeight()) == STexture::TE_OK) + Frames.push_back(frame); +} + +bool WiiMovie::GetNextFrame(STexture *tex) +{ + if (!Video || Frames.size() == 0) return false; + + *tex = Frames.at(0); + Frames.erase(Frames.begin()); + return true; +} diff --git a/source/gui/WiiMovie.hpp b/source/gui/WiiMovie.hpp new file mode 100644 index 00000000..ef702e61 --- /dev/null +++ b/source/gui/WiiMovie.hpp @@ -0,0 +1,61 @@ +#ifndef WII_MOVIE_H_ +#define WII_MOVIE_H_ + +#include "gcvid.h" +#include "Timer.h" +#include "texture.hpp" +#include "BufferCircle.hpp" + +using namespace std; + +class WiiMovie +{ + public: + WiiMovie(const char * filepath); + ~WiiMovie(); + bool Play(bool loop = false); + void Stop(); + void SetVolume(int vol); + void SetScreenSize(int width, int height, int top, int left); + void SetFullscreen(); + void SetFrameSize(int w, int h); + void SetAspectRatio(float Aspect); + bool GetNextFrame(STexture *tex); + protected: + static void * UpdateThread(void *arg); + static void * PlayingThread(void *arg); + void FrameLoadLoop(); + void ReadNextFrame(); + void LoadNextFrame(); + + u8 * ThreadStack; + u8 * PlayThreadStack; + lwp_t ReadThread; + lwp_t PlayThread; + mutex_t mutex; + + VideoFile * Video; + BufferCircle SoundBuffer; + float fps; + Timer PlayTime; + u32 VideoFrameCount; + safe_vector Frames; + bool Playing; + bool ExitRequested; + bool fullScreen; + int maxSoundSize; + int SndChannels; + int SndFrequence; + int volume; + + int screentop; + int screenleft; + int screenwidth; + int screenheight; + float scaleX; + float scaleY; + int width; + int height; +}; + +#endif diff --git a/source/gui/boxmesh.cpp b/source/gui/boxmesh.cpp new file mode 100644 index 00000000..00c04b1e --- /dev/null +++ b/source/gui/boxmesh.cpp @@ -0,0 +1,186 @@ +#include "boxmesh.hpp" + +// Quick and dirty hardcoded DVD box mesh + +static const guVector g_coverBL = { -0.65f, -0.915f, 0.f }; +static const guVector g_coverTR = { 0.65f, 0.915f, 0.f }; +static const float g_boxCoverY = 0.1f; +static const float g_boxBorderWidth = 0.025f; +static const guVector g_frontCoverBL = { g_coverBL.x, g_coverBL.y + g_boxCoverY, g_coverBL.z }; +static const guVector g_frontCoverTR = { g_coverTR.x, g_coverTR.y + g_boxCoverY, g_coverTR.z }; +static const guVector g_backCoverBL = { g_frontCoverBL.x, g_frontCoverBL.y, g_frontCoverBL.z - 0.16f }; +static const guVector g_backCoverTR = { g_frontCoverTR.x, g_frontCoverTR.y, g_frontCoverTR.z - 0.16f }; +const float g_boxCoverYCenter = (g_frontCoverTR.y - g_frontCoverBL.y) * 0.5f; +const float g_coverYCenter = (g_coverTR.y - g_coverBL.y) * 0.5f; +const Vector3D g_boxSize( + g_coverTR.x - g_coverBL.x + 2 * g_boxBorderWidth, + g_coverTR.y - g_coverBL.y + 2 * g_boxBorderWidth, + g_coverTR.z - g_coverBL.z + 2 * g_boxBorderWidth); + +#define w(x) ((float)x / 64.0f) +#define h(y) ((float)y / 256.0f) + + +const SMeshVert g_boxMeshQ[] = { // Quads + // Bordure du bas devant + { { g_frontCoverBL.x, g_frontCoverBL.y, g_frontCoverBL.z }, CTexCoord(w(0), h(256)) }, + { { g_frontCoverBL.x, g_frontCoverBL.y - g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(256)) }, + { { g_frontCoverTR.x, g_frontCoverBL.y - g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(224)) }, + { { g_frontCoverTR.x, g_frontCoverBL.y, g_frontCoverBL.z }, CTexCoord(w(0), h(224)) }, + + // Bordure du haut devant + { { g_frontCoverBL.x, g_frontCoverTR.y + g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(0)) }, + { { g_frontCoverBL.x, g_frontCoverTR.y, g_frontCoverBL.z }, CTexCoord(w(0), h(0)) }, + { { g_frontCoverTR.x, g_frontCoverTR.y, g_frontCoverBL.z }, CTexCoord(w(0), h(32)) }, + { { g_frontCoverTR.x, g_frontCoverTR.y + g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(32)) }, + + // Bordure du bas derrière + { { g_backCoverBL.x, g_backCoverBL.y - g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(256)) }, + { { g_backCoverBL.x, g_backCoverBL.y, g_backCoverBL.z }, CTexCoord(w(64), h(256)) }, + { { g_backCoverTR.x, g_backCoverBL.y, g_backCoverBL.z }, CTexCoord(w(64), h(224)) }, + { { g_backCoverTR.x, g_backCoverBL.y - g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(224)) }, + + // Bordure du haut derrière + { { g_backCoverBL.x, g_backCoverTR.y, g_backCoverBL.z }, CTexCoord(w(64), h(0)) }, + { { g_backCoverBL.x, g_backCoverTR.y + g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(0)) }, + { { g_backCoverTR.x, g_backCoverTR.y + g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(32)) }, + { { g_backCoverTR.x, g_backCoverTR.y, g_backCoverBL.z }, CTexCoord(w(64), h(32)) }, + + // Bordure de droite devant + { { g_frontCoverTR.x, g_frontCoverBL.y, g_frontCoverBL.z }, CTexCoord(w(0), h(256)) }, + { { g_frontCoverTR.x + g_boxBorderWidth, g_frontCoverBL.y, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(256)) }, + { { g_frontCoverTR.x + g_boxBorderWidth, g_frontCoverTR.y, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(0)) }, + { { g_frontCoverTR.x, g_frontCoverTR.y, g_frontCoverBL.z }, CTexCoord(w(0), h(0)) }, + + // Bordure de droite derrière + { { g_backCoverTR.x + g_boxBorderWidth, g_backCoverBL.y, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(256)) }, + { { g_backCoverTR.x, g_backCoverBL.y, g_backCoverBL.z }, CTexCoord(w(64), h(256)) }, + { { g_backCoverTR.x, g_backCoverTR.y, g_backCoverBL.z }, CTexCoord(w(64), h(0)) }, + { { g_backCoverTR.x + g_boxBorderWidth, g_backCoverTR.y, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(0)) }, + + // Face du haut + { { g_frontCoverBL.x, g_frontCoverTR.y + g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(0)) }, + { { g_frontCoverTR.x, g_frontCoverTR.y + g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(32)) }, + { { g_backCoverTR.x, g_backCoverTR.y + g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(32)) }, + { { g_backCoverBL.x, g_backCoverTR.y + g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(0)) }, + + // Angle face du haut / face de droite + { { g_frontCoverTR.x, g_frontCoverTR.y + g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(32)) }, + { { g_frontCoverTR.x + g_boxBorderWidth, g_frontCoverTR.y, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(0)) }, + { { g_backCoverTR.x + g_boxBorderWidth, g_backCoverTR.y, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(0)) }, + { { g_backCoverTR.x, g_backCoverTR.y + g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(32)) }, + + // Face de droite + { { g_frontCoverTR.x + g_boxBorderWidth, g_frontCoverTR.y, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(0)) }, + { { g_frontCoverTR.x + g_boxBorderWidth, g_frontCoverBL.y, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(256)) }, + { { g_backCoverTR.x + g_boxBorderWidth, g_backCoverBL.y, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(256)) }, + { { g_backCoverTR.x + g_boxBorderWidth, g_backCoverTR.y, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(0)) }, + + // Angle face de droite / face du bas + { { g_frontCoverTR.x + g_boxBorderWidth, g_frontCoverBL.y, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(256)) }, + { { g_frontCoverTR.x, g_frontCoverBL.y - g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(224)) }, + { { g_backCoverTR.x, g_backCoverBL.y - g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(224)) }, + { { g_backCoverTR.x + g_boxBorderWidth, g_backCoverBL.y, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(256)) }, + + // Face du bas + { { g_frontCoverTR.x, g_frontCoverBL.y - g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(224)) }, + { { g_frontCoverBL.x, g_frontCoverBL.y - g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(256)) }, + { { g_backCoverBL.x, g_backCoverBL.y - g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(256)) }, + { { g_backCoverTR.x, g_backCoverBL.y - g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(224)) }, + + // Face de gauche en haut + { { g_frontCoverBL.x, g_frontCoverTR.y, g_frontCoverBL.z }, CTexCoord(w(0), h(0)) }, + { { g_frontCoverBL.x, g_frontCoverTR.y + g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(0), h(0)) }, + { { g_backCoverBL.x, g_backCoverTR.y + g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(0), h(0)) }, + { { g_backCoverBL.x, g_backCoverTR.y, g_backCoverBL.z}, CTexCoord(w(0), h(0)) }, + + // Face de gauche en bas + { { g_frontCoverBL.x, g_frontCoverBL.y - g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(0), h(0)) }, + { { g_frontCoverBL.x, g_frontCoverBL.y, g_frontCoverBL.z }, CTexCoord(w(0), h(0)) }, + { { g_backCoverBL.x, g_backCoverBL.y, g_backCoverBL.z }, CTexCoord(w(0), h(0)) }, + { { g_backCoverBL.x, g_backCoverBL.y - g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(0), h(0)) } +}; + +const SMeshVert g_boxMeshT[] = { // Triangles + // Haut devant + { { g_frontCoverTR.x, g_frontCoverTR.y, g_frontCoverBL.z }, CTexCoord(w(0), h(16)) }, + { { g_frontCoverTR.x + g_boxBorderWidth, g_frontCoverTR.y, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(0)) }, + { { g_frontCoverTR.x, g_frontCoverTR.y + g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(32)) }, + + // Haut derrière + { { g_backCoverTR.x, g_backCoverTR.y, g_backCoverBL.z }, CTexCoord(w(64), h(16)) }, + { { g_backCoverTR.x, g_backCoverTR.y + g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(32)) }, + { { g_backCoverTR.x + g_boxBorderWidth, g_backCoverTR.y, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(0)) }, + + // Bas devant + { { g_frontCoverTR.x, g_frontCoverBL.y, g_frontCoverBL.z }, CTexCoord(w(0), h(240)) }, + { { g_frontCoverTR.x, g_frontCoverBL.y - g_boxBorderWidth, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(224)) }, + { { g_frontCoverTR.x + g_boxBorderWidth, g_frontCoverBL.y, g_frontCoverBL.z - g_boxBorderWidth }, CTexCoord(w(10), h(256)) }, + + // Bas derrière + { { g_backCoverTR.x, g_backCoverBL.y, g_backCoverBL.z }, CTexCoord(w(64), h(240)) }, + { { g_backCoverTR.x + g_boxBorderWidth, g_backCoverBL.y, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(256)) }, + { { g_backCoverTR.x, g_backCoverBL.y - g_boxBorderWidth, g_backCoverBL.z + g_boxBorderWidth }, CTexCoord(w(54), h(224)) } +}; + +#undef h +#undef w + +const SMeshVert g_flatCoverMesh[] = { + { { g_coverBL.x, g_coverBL.y, g_coverBL.z }, CTexCoord(0.f, 1.f) }, + { { g_coverTR.x, g_coverBL.y, g_coverBL.z }, CTexCoord(1.f, 1.f) }, + { { g_coverTR.x, g_coverTR.y, g_coverBL.z }, CTexCoord(1.f, 0.f) }, + { { g_coverBL.x, g_coverTR.y, g_coverBL.z }, CTexCoord(0.f, 0.f) } +}; + +const CTexCoord g_flatCoverBoxTex[sizeof g_flatCoverMesh / sizeof g_flatCoverMesh[0]] = { + CTexCoord(1.46f / 2.76f, 1.f), + CTexCoord(1.f, 1.f), + CTexCoord(1.f, 0.f), + CTexCoord(1.46f / 2.76f, 0.f) +}; + +const SMeshVert g_boxBackCoverMesh[] = { + { { g_backCoverTR.x, g_backCoverBL.y, g_backCoverBL.z }, CTexCoord(0.f, 1.f) }, + { { g_backCoverBL.x, g_backCoverBL.y, g_backCoverBL.z }, CTexCoord(1.3f / 2.76f, 1.f) }, + { { g_backCoverBL.x, g_backCoverTR.y, g_backCoverBL.z }, CTexCoord(1.3f / 2.76f, 0.f) }, + { { g_backCoverTR.x, g_backCoverTR.y, g_backCoverBL.z }, CTexCoord(0.f, 0.f) }, + + { { g_frontCoverBL.x, g_frontCoverBL.y, g_frontCoverBL.z }, CTexCoord(1.46f / 2.76f, 1.f) }, + { { g_frontCoverBL.x, g_frontCoverTR.y, g_frontCoverBL.z }, CTexCoord(1.46f / 2.76f, 0.f) }, + { { g_backCoverBL.x, g_backCoverTR.y, g_backCoverBL.z }, CTexCoord(1.3f / 2.76f, 0.f) }, + { { g_backCoverBL.x, g_backCoverBL.y, g_backCoverBL.z }, CTexCoord(1.3f / 2.76f, 1.f) }, +}; + +const SMeshVert g_boxCoverMesh[] = { + { { g_frontCoverBL.x, g_frontCoverBL.y, g_frontCoverBL.z }, CTexCoord(1.46f / 2.76f, 1.f) }, + { { g_frontCoverTR.x, g_frontCoverBL.y, g_frontCoverBL.z }, CTexCoord(1.f, 1.f) }, + { { g_frontCoverTR.x, g_frontCoverTR.y, g_frontCoverBL.z }, CTexCoord(1.f, 0.f) }, + { { g_frontCoverBL.x, g_frontCoverTR.y, g_frontCoverBL.z }, CTexCoord(1.46f / 2.76f, 0.f) } +}; + +const CTexCoord g_boxCoverFlatTex[sizeof g_boxCoverMesh / sizeof g_boxCoverMesh[0]] = { + CTexCoord(0.f, 1.f), + CTexCoord(1.f, 1.f), + CTexCoord(1.f, 0.f), + CTexCoord(0.f, 0.f) +}; + +const CTexCoord g_boxCoverBackTex[sizeof g_boxBackCoverMesh / sizeof g_boxBackCoverMesh[0]] = +{ + CTexCoord(0.f, 1.f), + CTexCoord(1.3f / 1.46f, 1.f), + CTexCoord(1.3f / 1.46f, 0.f), + CTexCoord(0.f, 0.f), + + CTexCoord(1.f, 1.f), + CTexCoord(1.f, 0.f), + CTexCoord(1.3f / 1.46f, 0.f), + CTexCoord(1.3f / 1.46f, 1.f) +}; + +const u32 g_flatCoverMeshSize = sizeof g_flatCoverMesh / sizeof g_flatCoverMesh[0]; +const u32 g_boxMeshQSize = sizeof g_boxMeshQ / sizeof g_boxMeshQ[0]; +const u32 g_boxMeshTSize = sizeof g_boxMeshT / sizeof g_boxMeshT[0]; +const u32 g_boxCoverMeshSize = sizeof g_boxCoverMesh / sizeof g_boxCoverMesh[0]; +const u32 g_boxBackCoverMeshSize = sizeof g_boxBackCoverMesh / sizeof g_boxBackCoverMesh[0]; diff --git a/source/gui/boxmesh.hpp b/source/gui/boxmesh.hpp new file mode 100644 index 00000000..99320508 --- /dev/null +++ b/source/gui/boxmesh.hpp @@ -0,0 +1,41 @@ + +#ifndef __BOXMESH_HPP +#define __BOXMESH_HPP + +#include "video.hpp" + +// Quick and dirty hardcoded DVD box mesh +// Should be replaced by a true mesh loader +// Lacks normals + +struct SMeshVert +{ + guVector pos; + CTexCoord texCoord; +}; + +// Flat cover +extern const SMeshVert g_flatCoverMesh[]; +extern const u32 g_flatCoverMeshSize; +extern const CTexCoord g_flatCoverBoxTex[]; + +// Box +extern const SMeshVert g_boxMeshQ[]; // Quads +extern const u32 g_boxMeshQSize; +extern const SMeshVert g_boxMeshT[]; // Triangles +extern const u32 g_boxMeshTSize; +// Box cover +extern const SMeshVert g_boxBackCoverMesh[]; +extern const u32 g_boxBackCoverMeshSize; +extern const SMeshVert g_boxCoverMesh[]; +extern const u32 g_boxCoverMeshSize; +extern const CTexCoord g_boxCoverFlatTex[]; +extern const CTexCoord g_boxCoverBackTex[]; +// +extern const float g_boxCoverYCenter; +extern const float g_coverYCenter; + +// Bounding box size +extern const Vector3D g_boxSize; + +#endif // !defined(__BOXMESH_HPP) diff --git a/source/gui/coverflow.cpp b/source/gui/coverflow.cpp new file mode 100644 index 00000000..c508bc7e --- /dev/null +++ b/source/gui/coverflow.cpp @@ -0,0 +1,2656 @@ +// Coverflow + +#include +#include +#include +#include +#include +#include +#include + +#include + +#include "coverflow.hpp" +#include "pngu.h" +#include "boxmesh.hpp" +#include "wstringEx.hpp" +#include "lockMutex.hpp" +#include "fonts.h" +//#include "gecko.h" + +using namespace std; + +extern const u8 dvdskin_png[]; +extern const u8 dvdskin_red_png[]; +extern const u8 dvdskin_black_png[]; +extern const u8 nopic_png[]; +extern const u8 loading_png[]; +extern const u8 flatnopic_png[]; +extern const u8 flatloading_png[]; + +static lwp_t coverLoaderThread = LWP_THREAD_NULL; +SmartBuf coverLoaderThreadStack; + +static inline int loopNum(int i, int s) +{ + return i < 0 ? (s - (-i % s)) % s : i % s; +} + +CCoverFlow::CCover::CCover(void) +{ + index = 0; + txtAngle = 0.f; + txtTargetAngle = 0.f; + txtColor = 0; + txtTargetColor = 0; + color = 0x00FFFFFF; + targetColor = 0xFFFFFFFF; + shadowColor = 0x00000000; + targetShadowColor = 0x00000000; + scale = Vector3D(1.f, 1.f, 1.f); + targetScale = Vector3D(1.f, 1.f, 1.f); +} + +CCoverFlow::CItem::CItem(dir_discHdr *itemHdr, const char *itemPic, const char *itemBoxPic, int playcount, unsigned int lastPlayed) : + hdr(itemHdr), + picPath(itemPic), + boxPicPath(itemBoxPic), + playcount(playcount), + lastPlayed(lastPlayed) +{ + state = CCoverFlow::STATE_Loading; + boxTexture = false; +} + +static inline wchar_t upperCaseWChar(wchar_t c) +{ + return c >= L'a' && c <= L'z' ? c & 0x00DF : c; +} + +CCoverFlow::CCoverFlow(void) +{ + m_loNormal.camera = Vector3D(0.f, 1.5f, 5.f); + m_loNormal.cameraAim = Vector3D(0.f, 0.f, -1.f); + m_loNormal.leftScale = Vector3D(1.f, 1.f, 1.f); + m_loNormal.rightScale = Vector3D(1.f, 1.f, 1.f); + m_loNormal.centerScale = Vector3D(1.f, 1.f, 1.f); + m_loNormal.rowCenterScale = Vector3D(1.f, 1.f, 1.f); + m_loNormal.leftPos = Vector3D(-1.6f, 0.f, 0.f); + m_loNormal.rightPos = Vector3D(1.6f, 0.f, 0.f); + m_loNormal.centerPos = Vector3D(0.f, 0.f, 1.f); + m_loNormal.rowCenterPos = Vector3D(0.f, 0.f, 0.f); + m_loNormal.leftAngle = Vector3D(0.f, 70.f, 0.f); + m_loNormal.rightAngle = Vector3D(0.f, -70.f, 0.f); + m_loNormal.centerAngle = Vector3D(0.f, 0.f, 0.f); + m_loNormal.rowCenterAngle = Vector3D(0.f, 0.f, 0.f); + m_loNormal.leftSpacer = Vector3D(-0.35f, 0.f, 0.f); + m_loNormal.rightSpacer = Vector3D(0.35f, 0.f, 0.f); + m_loNormal.leftDeltaAngle = Vector3D(0.f, 0.f, 0.f); + m_loNormal.rightDeltaAngle = Vector3D(0.f, 0.f, 0.f); + m_loNormal.txtLeftAngle = -55.f; + m_loNormal.txtRightAngle = 55.f; + m_loNormal.txtCenterAngle = 0.f; + m_loNormal.txtLeftPos = Vector3D(-4.f, 0.f, 1.3f); + m_loNormal.txtRightPos = Vector3D(4.f, 0.f, 1.3f); + m_loNormal.txtCenterPos = Vector3D(0.f, 0.f, 2.6f); + m_loNormal.txtSideWidth = 500.f; + m_loNormal.txtCenterWidth = 500.f; + m_loNormal.txtSideStyle = FTGX_ALIGN_BOTTOM | FTGX_JUSTIFY_CENTER; + m_loNormal.txtCenterStyle = FTGX_ALIGN_BOTTOM | FTGX_JUSTIFY_CENTER; + m_loNormal.endColor = CColor(0x3FFFFFFF); + m_loNormal.begColor = CColor(0xCFFFFFFF); + m_loNormal.mouseOffColor = CColor(0xFF00FF00); + m_loNormal.shadowColorCenter = CColor(0x00000000); + m_loNormal.shadowColorEnd = CColor(0x00000000); + m_loNormal.shadowColorBeg = CColor(0x00000000); + m_loNormal.shadowColorOff = CColor(0x00000000); + m_loNormal.topSpacer = Vector3D(0.f, 2.f, 0.f); + m_loNormal.bottomSpacer = Vector3D(0.f, -2.f, 0.f); + m_loNormal.topDeltaAngle = Vector3D(0.f, 0.f, 0.f); + m_loNormal.bottomDeltaAngle = Vector3D(0.f, 0.f, 0.f); + m_loNormal.topAngle = Vector3D(0.f, 0.f, 0.f); + m_loNormal.bottomAngle = Vector3D(0.f, 0.f, 0.f); + // + m_loSelected.camera = Vector3D(0.f, 1.5f, 5.f); + m_loSelected.cameraAim = Vector3D(0.f, 0.f, -1.f); + m_loSelected.leftScale = Vector3D(1.f, 1.f, 1.f); + m_loSelected.rightScale = Vector3D(1.f, 1.f, 1.f); + m_loSelected.centerScale = Vector3D(1.f, 1.f, 1.f); + m_loSelected.rowCenterScale = Vector3D(1.f, 1.f, 1.f); + m_loSelected.leftPos = Vector3D(-4.6f, 2.f, 0.f); + m_loSelected.rightPos = Vector3D(4.6f, 2.f, 0.f); + m_loSelected.centerPos = Vector3D(-0.6f, 0.f, 2.6f); + m_loSelected.rowCenterPos = Vector3D(0.f, 0.f, 0.f); + m_loSelected.leftAngle = Vector3D(-45.f, 90.f, 0.f); + m_loSelected.rightAngle = Vector3D(-45.f, -90.f, 0.f); + m_loSelected.centerAngle = Vector3D(0.f, 380.f, 0.f); + m_loSelected.rowCenterAngle = Vector3D(0.f, 0.f, 0.f); + m_loSelected.leftSpacer = Vector3D(-0.35f, 0.f, 0.f); + m_loSelected.rightSpacer = Vector3D(0.35f, 0.f, 0.f); + m_loSelected.leftDeltaAngle = Vector3D(0.f, 0.f, 0.f); + m_loSelected.rightDeltaAngle = Vector3D(0.f, 0.f, 0.f); + m_loSelected.txtLeftAngle = -55.f; + m_loSelected.txtRightAngle = 55.f; + m_loSelected.txtCenterAngle = 0.f; + m_loSelected.txtLeftPos = Vector3D(-4.35f, 0.f, 1.3f); + m_loSelected.txtRightPos = Vector3D(4.35f, 0.f, 1.3f); + m_loSelected.txtCenterPos = Vector3D(2.3f, 1.8f, 1.f); + m_loSelected.txtSideWidth = 500.f; + m_loSelected.txtCenterWidth = 310.f; + m_loSelected.txtSideStyle = FTGX_ALIGN_BOTTOM | FTGX_JUSTIFY_CENTER; + m_loSelected.txtCenterStyle = FTGX_ALIGN_TOP | FTGX_JUSTIFY_RIGHT; + m_loSelected.endColor = CColor(0x3FFFFFFF); + m_loSelected.begColor = CColor(0xCFFFFFFF); + m_loSelected.mouseOffColor = CColor(0xFF00FF00); + m_loSelected.shadowColorCenter = CColor(0x00000000); + m_loSelected.shadowColorEnd = CColor(0x00000000); + m_loSelected.shadowColorBeg = CColor(0x00000000); + m_loSelected.shadowColorOff = CColor(0x00000000); + m_loSelected.topSpacer = Vector3D(0.f, 2.f, 0.f); + m_loSelected.bottomSpacer = Vector3D(0.f, -2.f, 0.f); + m_loSelected.topDeltaAngle = Vector3D(0.f, 0.f, 0.f); + m_loSelected.bottomDeltaAngle = Vector3D(0.f, 0.f, 0.f); + m_loSelected.topAngle = Vector3D(0.f, 0.f, 0.f); + m_loSelected.bottomAngle = Vector3D(0.f, 0.f, 0.f); + // + m_mirrorAlpha = 0.2f; + m_txtMirrorAlpha = 0.2f; + m_delay = 0; + m_minDelay = 5; + m_jump = 0; + m_mutex = 0; + m_loadingCovers = false; + m_moved = false; + m_selected = false; + m_hideCover = false; + m_tickCount = 0; + m_hqCover = -1; + m_blurRadius = 3; + m_blurFactor = 1.f; + // + m_mirrorBlur = false; + m_effectTex.width = 96; + m_effectTex.height = 72; + m_effectTex.format = GX_TF_RGBA8; + m_shadowScale = 1.f; + m_shadowX = 0.f; + m_shadowY = 0.f; + m_flipCoverPos = Vector3D(0.f, 0.f, 0.f); + m_flipCoverAngle = Vector3D(0.f, 180.f, 0.f); + m_flipCoverScale = Vector3D(1.f, 1.f, 1.f); + // Settings + m_lodBias = -0.3f; + m_aniso = GX_ANISO_1; + m_edgeLOD = false; + m_numBufCovers = 100; + m_compressTextures = true; + m_compressCache = false; + m_deletePicsAfterCaching = false; + m_box = true; + m_rows = 1; + m_columns = 11; + m_range = m_rows * m_columns; + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + m_mouse[chan] = -1; + sndCopyNum = 0; + m_soundVolume = 0xFF; + m_sorting = SORT_ALPHA; + // + LWP_MutexInit(&m_mutex, 0); +} + +bool CCoverFlow::init(const SmartBuf &font, u32 font_size) +{ + // Load font + m_font.fromBuffer(font, font_size, TITLEFONT); + m_fontColor = CColor(0xFFFFFFFF); + m_fanartFontColor = CColor(0xFFFFFFFF); + // + if (CONF_GetAspectRatio() == CONF_ASPECT_16_9) + guPerspective(m_projMtx, 45, 16.f / 9.f, .1f, 300.f); + else + guPerspective(m_projMtx, 45, 4.f / 3.f, .1f, 300.f); + return true; +} + +void CCoverFlow::simulateOtherScreenFormat(bool s) +{ + if ((CONF_GetAspectRatio() == CONF_ASPECT_16_9) != s) + guPerspective(m_projMtx, 45, 16.f / 9.f, .1f, 300.f); + else + guPerspective(m_projMtx, 45, 4.f / 3.f, .1f, 300.f); +} + +CCoverFlow::~CCoverFlow(void) +{ + clear(); +/* for(u8 i = 0; i < 4; i++) */ + SMART_FREE(m_sound[0]); + SMART_FREE(m_hoverSound); + SMART_FREE(m_selectSound); + SMART_FREE(m_cancelSound); + LWP_MutexDestroy(m_mutex); +} + +void CCoverFlow::setCachePath(const char *path, bool deleteSource, bool compress) +{ + m_cachePath = path; + m_deletePicsAfterCaching = deleteSource; + m_compressCache = compress; +} + +void CCoverFlow::setTextureQuality(float lodBias, int aniso, bool edgeLOD) +{ + m_lodBias = min(max(-3.f, lodBias), 1.f); + switch (aniso) + { + case 1: + m_aniso = GX_ANISO_2; + break; + case 2: + m_aniso = GX_ANISO_4; + break; + default: + m_aniso = GX_ANISO_1; + } + m_edgeLOD = edgeLOD; +} + +void CCoverFlow::setBoxMode(bool box) +{ + m_box = box; +} + +void CCoverFlow::setBufferSize(u32 numCovers) +{ + if (!m_covers.empty()) return; + m_numBufCovers = min(max(3u, numCovers / 2u), 400u); +} + +void CCoverFlow::setTextures(const string &loadingPic, const string &loadingPicFlat, const string &noCoverPic, const string &noCoverPicFlat) +{ + if (!m_covers.empty()) return; + m_pngLoadCover = loadingPic; + m_pngLoadCoverFlat = loadingPicFlat; + m_pngNoCover = noCoverPic; + m_pngNoCoverFlat = noCoverPicFlat; +} + +void CCoverFlow::setFont(SFont font, const CColor &color) +{ + if (!!font.data) m_font = font; + m_fontColor = color; + if (!m_covers.empty()) + { + for (u32 i = 0; i < m_range; ++i) + _loadCover(i, m_covers[i].index); + _updateAllTargets(); + } +} + +void CCoverFlow::_transposeCover(safe_vector &dst, u32 rows, u32 columns, int pos) +{ + int i = pos - (int)(rows * columns / 2); + int j = rows >= 3 ? abs(i) - ((abs(i) + (int)rows / 2) / (int)rows) * 2 : abs(i); + if (m_rows >= 3) + j += ((j + ((int)m_rows - 2) / 2) / ((int)m_rows - 2)) * 2; + int k = m_range / 2 + (i < 0 ? -j : j); + if ((u32)k < m_range) + dst[pos] = m_covers[k]; +} + +void CCoverFlow::setRange(u32 rows, u32 columns) +{ + rows = rows < 3u ? 1u : min(rows | 1u, 9u) + 2u; + columns = min(max(3u, columns | 1u), 21u) + 2u; + u32 range = rows * columns; + if (rows == m_rows && columns == m_columns && range == m_range) + return; + if (!m_covers.empty()) + { + stopCoverLoader(); + safe_vector tmpCovers; + tmpCovers.resize(range); + if (rows >= 3) + for (u32 x = 0; x < columns; ++x) + for (u32 y = 1; y < rows - 1; ++y) + _transposeCover(tmpCovers, rows, columns, x * rows + y); + else + for (u32 x = 0; x < range; ++x) + _transposeCover(tmpCovers, rows, columns, x); + swap(tmpCovers, m_covers); + m_rows = rows; + m_columns = columns; + m_range = range; + _loadAllCovers(m_covers[m_range / 2].index); + _updateAllTargets(); + startCoverLoader(); + } + else + { + m_rows = rows; + m_columns = columns; + m_range = range; + } +} + +void CCoverFlow::setCameraPos(bool selected, const Vector3D &pos, const Vector3D &aim) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.camera = pos; + lo.cameraAim = aim; +} + +void CCoverFlow::setCameraOsc(bool selected, const Vector3D &speed, const Vector3D &) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.cameraOscSpeed = speed; + lo.cameraOscAmp = amp; +} + +void CCoverFlow::setCoverScale(bool selected, const Vector3D &left, const Vector3D &right, const Vector3D ¢er, const Vector3D &rowCenter) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.leftScale = left; + lo.rightScale = right; + lo.centerScale = center; + lo.rowCenterScale = rowCenter; +} + +void CCoverFlow::setCoverPos(bool selected, const Vector3D &left, const Vector3D &right, const Vector3D ¢er, const Vector3D &rowCenter) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.leftPos = left; + lo.rightPos = right; + lo.centerPos = center; + lo.rowCenterPos = rowCenter; +} + +void CCoverFlow::setCoverAngleOsc(bool selected, const Vector3D &speed, const Vector3D &) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.coverOscASpeed = speed; + lo.coverOscAAmp = amp; +} + +void CCoverFlow::setCoverPosOsc(bool selected, const Vector3D &speed, const Vector3D &) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.coverOscPSpeed = speed; + lo.coverOscPAmp = amp; +} + +void CCoverFlow::setSpacers(bool selected, const Vector3D &left, const Vector3D &right) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.leftSpacer = left; + lo.rightSpacer = right; +} + +void CCoverFlow::setDeltaAngles(bool selected, const Vector3D &left, const Vector3D &right) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.leftDeltaAngle = left; + lo.rightDeltaAngle = right; +} + +void CCoverFlow::setAngles(bool selected, const Vector3D &left, const Vector3D &right, const Vector3D ¢er, const Vector3D &rowCenter) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.leftAngle = left; + lo.rightAngle = right; + lo.centerAngle = center; + lo.rowCenterAngle = rowCenter; +} + +void CCoverFlow::setTitleAngles(bool selected, float left, float right, float center) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.txtLeftAngle = left; + lo.txtRightAngle = right; + lo.txtCenterAngle = center; +} + +void CCoverFlow::setTitlePos(bool selected, const Vector3D &left, const Vector3D &right, const Vector3D ¢er) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.txtLeftPos = left; + lo.txtRightPos= right; + lo.txtCenterPos= center; +} + +void CCoverFlow::setTitleWidth(bool selected, float side, float center) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.txtSideWidth = side; + lo.txtCenterWidth= center; +} + +void CCoverFlow::setTitleStyle(bool selected, u16 side, u16 center) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + lo.txtSideStyle = side; + lo.txtCenterStyle = center; +} + +void CCoverFlow::setColors(bool selected, const CColor &begColor, const CColor &endColor, const CColor &offColor) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + + lo.begColor = begColor; + lo.endColor = endColor; + lo.mouseOffColor = offColor; +} + +void CCoverFlow::setFanartPlaying(const bool isPlaying) +{ + m_fanartPlaying = isPlaying; +} + +void CCoverFlow::setFanartTextColor(const CColor textColor) +{ + m_fanartFontColor = textColor; +} + +void CCoverFlow::setMirrorAlpha(float cover, float title) +{ + m_mirrorAlpha = cover; + m_txtMirrorAlpha = title; +} + +void CCoverFlow::setMirrorBlur(bool blur) +{ + m_mirrorBlur = blur; +} + +void CCoverFlow::setShadowColors(bool selected, const CColor ¢erColor, const CColor &begColor, const CColor &endColor, const CColor &offColor) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + + lo.shadowColorCenter = centerColor; + lo.shadowColorBeg = begColor; + lo.shadowColorEnd = endColor; + lo.shadowColorOff = offColor; +} + +void CCoverFlow::setShadowPos(float scale, float x, float y) +{ + m_shadowScale = scale; + m_shadowX = x; + m_shadowY = y; +} + +void CCoverFlow::setRowSpacers(bool selected, const Vector3D &top, const Vector3D &bottom) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + + lo.topSpacer = top; + lo.bottomSpacer = bottom; +} + +void CCoverFlow::setRowDeltaAngles(bool selected, const Vector3D &top, const Vector3D &bottom) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + + lo.topDeltaAngle = top; + lo.bottomDeltaAngle = bottom; +} + +void CCoverFlow::setRowAngles(bool selected, const Vector3D &top, const Vector3D &bottom) +{ + SLayout &lo = selected ? m_loSelected : m_loNormal; + + lo.topAngle = top; + lo.bottomAngle = bottom; +} + +void CCoverFlow::setCoverFlipping(const Vector3D &pos, const Vector3D &angle, const Vector3D &scale) +{ + m_flipCoverPos = pos; + m_flipCoverAngle = angle; + m_flipCoverScale = scale; +} + +void CCoverFlow::setBlur(u32 blurResolution, u32 blurRadius, float blurFactor) +{ + static const struct { u32 x; u32 y; } blurRes[] = { + { 64, 48 }, { 96, 72 }, { 128, 96 }, { 192, 144 } + }; + u32 i = min(max(0u, blurResolution), sizeof blurRes / sizeof blurRes[0] - 1u); + m_effectTex.width = blurRes[i].x; + m_effectTex.height = blurRes[i].y; + SMART_FREE(m_effectTex.data); + m_blurRadius = min(max(1u, blurRadius), 3u); + m_blurFactor = min(max(1.f, blurFactor), 2.f); +} + +bool CCoverFlow::setSorting(Sorting sorting) +{ + m_sorting = sorting; + return start(); +} + +void CCoverFlow::setSounds(const SmartGuiSound &sound, const SmartGuiSound &hoverSound, const SmartGuiSound &selectSound, const SmartGuiSound &cancelSound) +{ + for(u8 i = 0; i < 4; i++) + m_sound[i] = sound; + m_hoverSound = hoverSound; + m_selectSound = selectSound; + m_cancelSound = cancelSound; +} + +void CCoverFlow::setSoundVolume(u8 vol) +{ + m_soundVolume = vol; +} + +void CCoverFlow::_stopSound(SmartGuiSound snd) +{ + snd->Stop(); +} + +void CCoverFlow::_playSound(SmartGuiSound snd) +{ + snd->Play(m_soundVolume); +} + +void CCoverFlow::stopSound(void) +{ + for(u8 i = 0; i < 4; i++) + _stopSound(m_sound[i]); + + _stopSound(m_hoverSound); +} + +void CCoverFlow::applySettings(void) +{ + if (m_covers.empty()) return; + + LockMutex lock(m_mutex); + _updateAllTargets(); +} + +void CCoverFlow::stopCoverLoader(bool empty) +{ + m_loadingCovers = false; + + if (coverLoaderThread != LWP_THREAD_NULL && !m_loadingCovers) + { + if(LWP_ThreadIsSuspended(coverLoaderThread)) + LWP_ResumeThread(coverLoaderThread); + + LWP_JoinThread(coverLoaderThread, NULL); + coverLoaderThread = LWP_THREAD_NULL; + + SMART_FREE(coverLoaderThreadStack); + + if (empty) + for (u32 i = 0; i < m_items.size(); ++i) + { + SMART_FREE(m_items[i].texture.data); + m_items[i].state = CCoverFlow::STATE_Loading; + } + } +} + +void CCoverFlow::startCoverLoader(void) +{ + if (m_covers.empty() || coverLoaderThread != LWP_THREAD_NULL || m_loadingCovers) return; + + m_loadingCovers = true; + + unsigned int stack_size = (unsigned int)32768; + SMART_FREE(coverLoaderThreadStack); + coverLoaderThreadStack = smartMem2Alloc(stack_size); + LWP_CreateThread(&coverLoaderThread, (void *(*)(void *))CCoverFlow::_coverLoader, (void *)this, coverLoaderThreadStack.get(), stack_size, 40); + +} + +void CCoverFlow::clear(void) +{ + stopCoverLoader(true); + m_covers.clear(); + m_items.clear(); +} + +void CCoverFlow::reserve(u32 capacity) +{ + m_items.reserve(capacity); +} + +void CCoverFlow::addItem(dir_discHdr *hdr, const char *picPath, const char *boxPicPath, int playcount, unsigned int lastPlayed) +{ + if (!m_covers.empty()) return; + m_items.push_back(CCoverFlow::CItem(hdr, picPath, boxPicPath, playcount, lastPlayed)); +} + +// Draws a plane in the Z-Buffer only. +void CCoverFlow::_drawMirrorZ(void) +{ + GX_LoadPosMtxImm(m_viewMtx, GX_PNMTX0); + // GX setup + GX_SetNumChans(0); + GX_ClearVtxDesc(); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetNumTexGens(0); + GX_SetTevOp(GX_TEVSTAGE0, GX_MODULATE); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORDNULL, GX_TEXMAP_DISABLE, GX_COLORNULL); + GX_SetAlphaUpdate(GX_FALSE); + GX_SetColorUpdate(GX_FALSE); + GX_SetZMode(GX_ENABLE, GX_LEQUAL, GX_TRUE); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(-10000.f, 0.f, -10000.f); + GX_Position3f32(10000.f, 0.f, -10000.f); + GX_Position3f32(10000.f, 0.f, 10000.f); + GX_Position3f32(-10000.f, 0.f, 10000.f); + GX_End(); + GX_SetAlphaUpdate(GX_TRUE); + GX_SetColorUpdate(GX_TRUE); +} + +void CCoverFlow::_effectBg(const STexture &tex) +{ + Mtx modelViewMtx; + GXTexObj texObj; + + GX_ClearVtxDesc(); + GX_SetNumTevStages(1); + GX_SetNumChans(0); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetNumTexGens(1); + GX_SetTevColorIn(GX_TEVSTAGE0, GX_CC_ZERO, GX_CC_ZERO, GX_CC_ZERO, GX_CC_TEXC); + GX_SetTevAlphaIn(GX_TEVSTAGE0, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO); + GX_SetTevColorOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLORNULL); + GX_SetBlendMode(GX_BM_NONE, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + GX_SetAlphaUpdate(GX_TRUE); + GX_SetCullMode(GX_CULL_NONE); + GX_SetZMode(GX_DISABLE, GX_ALWAYS, GX_FALSE); + guMtxIdentity(modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + GX_InitTexObj(&texObj, tex.data.get(), tex.width, tex.height, tex.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(0.f, 0.f, 0.f); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(640.f, 0.f, 0.f); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(640.f, 480.f, 0.f); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(0.f, 480.f, 0.f); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); +} + +void CCoverFlow::_effectBlur(CVideo &vid, bool vertical) +{ + int kSize = m_blurRadius * 2 + 1; + GXTexObj texObj; + Mtx mh1; + Mtx mh2; + Mtx mh3; + Mtx mh4; + Mtx mh5; + Mtx mh6; + Mtx modelViewMtx; + float pixDist = m_blurFactor; + float w = (float)m_effectTex.width; + float h = (float)m_effectTex.height; + float x = 0.f; + float y = 0.f; + CColor kGauss7(0xFF * 20 / 64, 0xFF * 15 / 64, 0xFF * 6 / 64, 0xFF * 1 / 64); + CColor kGauss5(0xFF * 6 / 16, 0xFF * 4 / 16, 0xFF * 1 / 16, 0); + CColor kGauss3(0xFF * 2 / 4, 0xFF * 1 / 4, 0, 0); + CColor kBox(0xFF / kSize, 0xFF / kSize, 0xFF / kSize, 0xFF / kSize); + Mtx44 projMtx; + + GX_SetScissor(0, 0, m_effectTex.width, m_effectTex.height); + GX_SetPixelFmt(GX_PF_RGBA6_Z24, GX_ZC_LINEAR); + GX_InvVtxCache(); + GX_InvalidateTexAll(); + GX_InitTexObj(&texObj, m_effectTex.data.get(), m_effectTex.width, m_effectTex.height, m_effectTex.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + GX_SetNumTevStages(kSize); + GX_SetNumTexGens(kSize); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + guMtxIdentity(mh1); + guMtxIdentity(mh2); + guMtxIdentity(mh3); + guMtxIdentity(mh4); + guMtxIdentity(mh5); + guMtxIdentity(mh6); + if (vertical) + { + guMtxRowCol(mh1, 0, 3) = pixDist * -1.f / w; + guMtxRowCol(mh2, 0, 3) = pixDist * 1.f / w; + guMtxRowCol(mh3, 0, 3) = pixDist * -2.f / w; + guMtxRowCol(mh4, 0, 3) = pixDist * 2.f / w; + guMtxRowCol(mh5, 0, 3) = pixDist * -3.f / w; + guMtxRowCol(mh6, 0, 3) = pixDist * 3.f / w; + } + else + { + guMtxRowCol(mh1, 1, 3) = pixDist * -1.f / h; + guMtxRowCol(mh2, 1, 3) = pixDist * 1.f / h; + guMtxRowCol(mh3, 1, 3) = pixDist * -2.f / h; + guMtxRowCol(mh4, 1, 3) = pixDist * 2.f / h; + guMtxRowCol(mh5, 1, 3) = pixDist * -3.f / h; + guMtxRowCol(mh6, 1, 3) = pixDist * 3.f / h; + } + GX_LoadTexMtxImm(mh1, GX_TEXMTX1, GX_MTX2x4); + GX_LoadTexMtxImm(mh2, GX_TEXMTX2, GX_MTX2x4); + GX_LoadTexMtxImm(mh3, GX_TEXMTX3, GX_MTX2x4); + GX_LoadTexMtxImm(mh4, GX_TEXMTX4, GX_MTX2x4); + GX_LoadTexMtxImm(mh3, GX_TEXMTX5, GX_MTX2x4); + GX_LoadTexMtxImm(mh4, GX_TEXMTX6, GX_MTX2x4); + GX_SetTexCoordGen(GX_TEXCOORD1, GX_TG_MTX2x4, GX_TG_TEX0, GX_TEXMTX1); + GX_SetTexCoordGen(GX_TEXCOORD2, GX_TG_MTX2x4, GX_TG_TEX0, GX_TEXMTX2); + GX_SetTexCoordGen(GX_TEXCOORD3, GX_TG_MTX2x4, GX_TG_TEX0, GX_TEXMTX3); + GX_SetTexCoordGen(GX_TEXCOORD4, GX_TG_MTX2x4, GX_TG_TEX0, GX_TEXMTX4); + GX_SetTexCoordGen(GX_TEXCOORD5, GX_TG_MTX2x4, GX_TG_TEX0, GX_TEXMTX5); + GX_SetTexCoordGen(GX_TEXCOORD6, GX_TG_MTX2x4, GX_TG_TEX0, GX_TEXMTX6); + switch (m_blurRadius) + { + case 1: + GX_SetTevKColor(GX_KCOLOR0, kGauss3); + break; + case 2: + GX_SetTevKColor(GX_KCOLOR0, kGauss5); + break; + case 3: + GX_SetTevKColor(GX_KCOLOR0, kGauss7); + break; + default: + GX_SetTevKColor(GX_KCOLOR0, kBox); + } + GX_SetTevKColorSel(GX_TEVSTAGE0, GX_TEV_KCSEL_K0_R); + GX_SetTevKColorSel(GX_TEVSTAGE1, GX_TEV_KCSEL_K0_G); + GX_SetTevKColorSel(GX_TEVSTAGE2, GX_TEV_KCSEL_K0_G); + GX_SetTevKColorSel(GX_TEVSTAGE3, GX_TEV_KCSEL_K0_B); + GX_SetTevKColorSel(GX_TEVSTAGE4, GX_TEV_KCSEL_K0_B); + GX_SetTevKColorSel(GX_TEVSTAGE5, GX_TEV_KCSEL_K0_A); + GX_SetTevKColorSel(GX_TEVSTAGE6, GX_TEV_KCSEL_K0_A); + GX_SetTevKAlphaSel(GX_TEVSTAGE0, GX_TEV_KASEL_K0_R); + GX_SetTevKAlphaSel(GX_TEVSTAGE1, GX_TEV_KASEL_K0_G); + GX_SetTevKAlphaSel(GX_TEVSTAGE2, GX_TEV_KASEL_K0_G); + GX_SetTevKAlphaSel(GX_TEVSTAGE3, GX_TEV_KASEL_K0_B); + GX_SetTevKAlphaSel(GX_TEVSTAGE4, GX_TEV_KASEL_K0_B); + GX_SetTevKAlphaSel(GX_TEVSTAGE5, GX_TEV_KASEL_K0_A); + GX_SetTevKAlphaSel(GX_TEVSTAGE6, GX_TEV_KASEL_K0_A); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLORNULL); + GX_SetTevColorIn(GX_TEVSTAGE0, GX_CC_ZERO, GX_CC_TEXC, GX_CC_KONST, GX_CC_ZERO); + GX_SetTevAlphaIn(GX_TEVSTAGE0, GX_CA_ZERO, GX_CA_TEXA, GX_CA_KONST, GX_CA_ZERO); + GX_SetTevColorOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + for (int i = 1; i < kSize; ++i) + { + GX_SetTevOrder(GX_TEVSTAGE0 + i, GX_TEXCOORD0 + i, GX_TEXMAP0, GX_COLORNULL); + GX_SetTevColorIn(GX_TEVSTAGE0 + i, GX_CC_ZERO, GX_CC_TEXC, GX_CC_KONST, GX_CC_CPREV); + GX_SetTevAlphaIn(GX_TEVSTAGE0 + i, GX_CA_ZERO, GX_CA_TEXA, GX_CA_KONST, GX_CA_APREV); + GX_SetTevColorOp(GX_TEVSTAGE0 + i, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0 + i, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + } + GX_SetBlendMode(GX_BM_NONE, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + GX_SetZMode(GX_DISABLE, GX_ALWAYS, GX_FALSE); + GX_SetViewport(0, 0, 640.f, 480.f, 0.f, 1.f); + guOrtho(projMtx, 0, 480.f + 0, 0, 640.f + 0, 0.f, 1000.0f); + GX_LoadProjectionMtx(projMtx, GX_ORTHOGRAPHIC); + GX_ClearVtxDesc(); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetAlphaUpdate(GX_TRUE); + GX_SetCullMode(GX_CULL_NONE); + guMtxIdentity(modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(x, y, 0.f); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(x + w, y, 0.f); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(x + w, y + h, 0.f); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(x, y + h, 0.f); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + vid.renderToTexture(m_effectTex, true); +} + +bool CCoverFlow::_effectVisible(void) +{ + SLayout &lo = m_selected ? m_loSelected : m_loNormal; + return (m_mirrorAlpha > 0.01f && m_mirrorBlur) + || lo.shadowColorCenter.a > 0 || lo.shadowColorBeg.a > 0 + || lo.shadowColorEnd.a > 0 || lo.shadowColorOff.a > 0; +} + +void CCoverFlow::makeEffectTexture(CVideo &vid, const STexture &bg) +{ + if (!_effectVisible()) return; + int aa = 8; + + GX_SetDither(GX_DISABLE); + vid.setAA(aa, true, m_effectTex.width, m_effectTex.height); + for (int i = 0; i < aa; ++i) + { + vid.prepareAAPass(i); + vid.setup2DProjection(false, true); + _effectBg(bg); + if (m_mirrorBlur) + _draw(CCoverFlow::CFDR_NORMAL, true, false); + vid.shiftViewPort(m_shadowX, m_shadowY); + _draw(CCoverFlow::CFDR_SHADOW, false, true); + vid.renderAAPass(i); + } + GX_SetPixelFmt(GX_PF_RGBA6_Z24, GX_ZC_LINEAR); + GX_InvVtxCache(); + GX_InvalidateTexAll(); + vid.setup2DProjection(false, true); + GX_SetViewport(0.f, 0.f, (float)m_effectTex.width, (float)m_effectTex.height, 0.f, 1.f); + GX_SetScissor(0, 0, m_effectTex.width, m_effectTex.height); + vid.drawAAScene(); + vid.renderToTexture(m_effectTex, true); + _effectBlur(vid, false); + _effectBlur(vid, true); + GX_SetDither(GX_ENABLE); +} + +void CCoverFlow::drawEffect(void) +{ + if (m_covers.empty()) return; + + if (_effectVisible()) + { + Mtx modelViewMtx; + GXTexObj texObj; + float w = 640.f; + float h = 480.f; + float x = 0.f; + float y = 0.f; + + GX_SetNumTevStages(1); + GX_SetNumChans(0); + GX_ClearVtxDesc(); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetNumTexGens(1); + GX_SetTevColorIn(GX_TEVSTAGE0, GX_CC_ZERO, GX_CC_ZERO, GX_CC_ZERO, GX_CC_TEXC); + GX_SetTevAlphaIn(GX_TEVSTAGE0, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO, GX_CA_TEXA); + GX_SetTevColorOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLORNULL); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetBlendMode(GX_BM_BLEND, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + GX_SetAlphaUpdate(GX_FALSE); + GX_SetCullMode(GX_CULL_NONE); + GX_SetZMode(GX_ENABLE, GX_LEQUAL, GX_FALSE); + guMtxIdentity(modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + GX_InitTexObj(&texObj, m_effectTex.data.get(), m_effectTex.width, m_effectTex.height, m_effectTex.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(x, y, -999.f); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(x + w, y, -999.f); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(x + w, y + h, -999.f); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(x, y + h, -999.f); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + } + if (!m_mirrorBlur) + _draw(CCoverFlow::CFDR_NORMAL, true, true); +} + +void CCoverFlow::draw(void) +{ + _draw(); +} + +void CCoverFlow::drawText(bool withRectangle) +{ + LockMutex lock(m_mutex); + Vector3D up(0.f, 1.f, 0.f); + Vector3D dir(m_cameraAim); + Vector3D pos(m_cameraPos); + + if (m_covers.empty()) return; + if (m_fontColor.a == 0) return; + + pos += _cameraMoves(); + // Camera + GX_LoadProjectionMtx(m_projMtx, GX_PERSPECTIVE); + guLookAt(m_viewMtx, &pos, &up, &dir); + // Text + GX_SetNumChans(1); + GX_SetCullMode(GX_CULL_NONE); + GX_SetZMode(GX_DISABLE, GX_LEQUAL, GX_FALSE); + GX_SetBlendMode(GX_BM_BLEND, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + for (u32 i = 0; i < m_range; ++i) + { + _drawTitle(loopNum((i & 1) != 0 ? m_range / 2 - (i + 1) / 2 : m_range / 2 + i / 2, m_range), true, withRectangle); + _drawTitle(loopNum((i & 1) != 0 ? m_range / 2 - (i + 1) / 2 : m_range / 2 + i / 2, m_range), false, withRectangle); + } +} + +void CCoverFlow::hideCover(void) +{ + m_hideCover = true; +} + +void CCoverFlow::showCover(void) +{ + m_hideCover = false; +} + +inline int innerToOuter(int i, int range) +{ + return loopNum((i & 1) != 0 ? range / 2 - (i + 1) / 2 : range / 2 + i / 2, range); +} + +void CCoverFlow::_draw(DrawMode dm, bool mirror, bool blend) +{ + LockMutex lock(m_mutex); + Vector3D up(0.f, 1.f, 0.f); + Vector3D dir(m_cameraAim); + Vector3D pos(m_cameraPos); + + if (mirror && m_mirrorAlpha <= 0.f) return; + if (m_covers.empty()) return; + + pos += _cameraMoves(); + // GX setup + GX_ClearVtxDesc(); + GX_SetNumTevStages(1); + if (dm == CCoverFlow::CFDR_NORMAL) + { + GX_SetNumChans(0); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetNumTexGens(1); + GX_SetTevColorIn(GX_TEVSTAGE0, GX_CC_ZERO, GX_CC_KONST, GX_CC_TEXC, GX_CC_ZERO); + GX_SetTevAlphaIn(GX_TEVSTAGE0, GX_CA_ZERO, GX_CA_KONST, GX_CA_TEXA, GX_CA_ZERO); + GX_SetTevColorOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLORNULL); + } + else + { + GX_SetNumChans(1); + GX_SetNumTexGens(0); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetTevColorIn(GX_TEVSTAGE0, GX_CC_ZERO, GX_CC_ZERO, GX_CC_ZERO, GX_CC_KONST); + GX_SetTevAlphaIn(GX_TEVSTAGE0, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO, GX_CA_KONST); + GX_SetTevColorOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORDNULL, GX_TEXMAP_NULL, GX_COLORNULL); + } + GX_SetTevKColor(GX_KCOLOR0, CColor(0xFF, 0xFF, 0xFF, 0xFF)); + GX_SetTevKColorSel(GX_TEVSTAGE0, GX_TEV_KCSEL_K0); + GX_SetTevKAlphaSel(GX_TEVSTAGE0, GX_TEV_KASEL_K0_A); + if (blend) + GX_SetBlendMode(GX_BM_BLEND, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + else + GX_SetBlendMode(GX_BM_NONE, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + GX_SetAlphaUpdate(GX_TRUE); + // Camera + GX_LoadProjectionMtx(m_projMtx, GX_PERSPECTIVE); + guLookAt(m_viewMtx, &pos, &up, &dir); + // Covers + GX_SetCullMode(m_box ? (mirror ? GX_CULL_BACK : GX_CULL_FRONT) : GX_CULL_NONE); + if (dm == CCoverFlow::CFDR_SHADOW) + { + // Shadow + GX_SetZMode(GX_DISABLE, GX_LEQUAL, GX_FALSE); + for (int x = (int)m_columns - 3; x >= 0; --x) + { + int xx = innerToOuter(x, m_columns); + if (m_rows >= 3) + for (int y = (int)m_rows - 3; y >= 0; --y) + _drawCover(xx * m_rows + innerToOuter(y, m_rows), mirror, dm); + else + _drawCover(xx, mirror, dm); + } + } + else + { + // Normal + GX_SetZMode(GX_ENABLE, GX_LEQUAL, GX_TRUE); + for (int x = 0; x < (int)m_columns - 2; ++x) + { + int xx = innerToOuter(x, m_columns); + if (m_rows >= 3) + for (int y = 0; y < (int)m_rows - 2; ++y) + _drawCover(xx * m_rows + innerToOuter(y, m_rows), mirror, dm); + else + _drawCover(xx, mirror, dm); + } + // Vanishing covers + GX_SetZMode(GX_ENABLE, GX_LEQUAL, GX_FALSE); + for (u32 y = 0; y < m_rows; ++y) + { + _drawCover(y, mirror, dm); + _drawCover((m_columns - 1) * m_rows + y, mirror, dm); + } + if (m_rows >= 3) + for (u32 x = 1; x < m_columns - 1; ++x) + { + _drawCover(x * m_rows, mirror, dm); + _drawCover(x * m_rows + m_rows - 1, mirror, dm); + } + } +} + +Vector3D CCoverFlow::_cameraMoves(void) +{ + SLayout &lo = m_selected ? m_loSelected : m_loNormal; + float tick = (float)m_tickCount * 0.005f; + return Vector3D(cos(tick * lo.cameraOscSpeed.x) * lo.cameraOscAmp.x, + cos(tick * lo.cameraOscSpeed.y) * lo.cameraOscAmp.y, + cos(tick * lo.cameraOscSpeed.z) * lo.cameraOscAmp.z); +} + +Vector3D CCoverFlow::_coverMovesA(void) +{ + SLayout &lo = m_selected ? m_loSelected : m_loNormal; + float tick = (float)m_tickCount * 0.005f; + return Vector3D(cos(tick * lo.coverOscASpeed.x) * lo.coverOscAAmp.x, + sin(tick * lo.coverOscASpeed.y) * lo.coverOscAAmp.y, + cos(tick * lo.coverOscASpeed.z) * lo.coverOscAAmp.z); +} + +Vector3D CCoverFlow::_coverMovesP(void) +{ + SLayout &lo = m_selected ? m_loSelected : m_loNormal; + float tick = (float)m_tickCount * 0.005f; + return Vector3D(cos(tick * lo.coverOscPSpeed.x) * lo.coverOscPAmp.x, + sin(tick * lo.coverOscPSpeed.y) * lo.coverOscPAmp.y, + cos(tick * lo.coverOscPSpeed.z) * lo.coverOscPAmp.z); +} + +void CCoverFlow::_drawTitle(int i, bool mirror, bool rectangle) +{ + Mtx modelMtx; + Mtx modelViewMtx; + Vector3D rotAxis(0.f, 1.f, 0.f); + CColor color(m_fanartPlaying ? m_fanartFontColor : m_fontColor); + + if (m_hideCover) return; + if (m_covers[i].txtColor == 0) return; + + color.a = mirror ? (u8)((float)m_covers[i].txtColor * m_txtMirrorAlpha) : m_covers[i].txtColor; + if (rectangle && !mirror) + { + // GX setup + GX_SetNumTevStages(1); + GX_SetNumChans(1); + GX_ClearVtxDesc(); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_CLR0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_CLR0, GX_CLR_RGBA, GX_RGBA8, 0); + GX_SetNumTexGens(0); + GX_SetTevColorIn(GX_TEVSTAGE0, GX_CC_ZERO, GX_CC_ZERO, GX_CC_ZERO, GX_CC_RASC); + GX_SetTevAlphaIn(GX_TEVSTAGE0, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO, GX_CA_RASA); + GX_SetTevColorOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORDNULL, GX_TEXMAP_NULL, GX_COLOR0A0); + GX_SetBlendMode(GX_BM_BLEND, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + // + Mtx rotMtx; + guMtxIdentity(modelMtx); + guMtxScaleApply(modelMtx, modelMtx, 0.005f, 0.005f, 0.005f); + guMtxRotDeg(rotMtx, 'Y', m_covers[i].txtAngle); + guMtxConcat(rotMtx, modelMtx, modelMtx); + guMtxTransApply(modelMtx, modelMtx, m_covers[i].txtPos.x, mirror ? -m_covers[i].txtPos.y : m_covers[i].txtPos.y, m_covers[i].txtPos.z); + guMtxConcat(m_viewMtx, modelMtx, modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + const SLayout &lo = m_selected ? m_loSelected : m_loNormal; + u16 s = (u32)i == m_range / 2 ? lo.txtCenterStyle : lo.txtSideStyle; + float x; + float y; + float w = (u32)i == m_range / 2 ? lo.txtCenterWidth : lo.txtSideWidth; + float h = m_font.lineSpacing; + if ((s & FTGX_JUSTIFY_CENTER) != 0) + x = -w * 0.5f; + else if ((s & FTGX_JUSTIFY_RIGHT) != 0) + x = -w; + else + x = 0.f; + if ((s & FTGX_ALIGN_MIDDLE) != 0) + y = -h * 0.5f; + else if ((s & FTGX_ALIGN_TOP) != 0) + y = -h; + else + y = 0.f; + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(x, y, 0.f); + GX_Color4u8(color.r, color.g, color.b, color.a / 2); + GX_Position3f32(x + w, y, 0.f); + GX_Color4u8(color.r, color.g, color.b, color.a / 2); + GX_Position3f32(x + w, y + h, 0.f); + GX_Color4u8(color.r, color.g, color.b, color.a / 2); + GX_Position3f32(x, y + h, 0.f); + GX_Color4u8(color.r, color.g, color.b, color.a / 2); + GX_End(); + } + m_covers[i].title.setColor(color); + m_font.font->reset(); + m_font.font->setXScale(0.005f); + m_font.font->setYScale(mirror ? 0.005f : -0.005f); + GX_ClearVtxDesc(); + GX_SetNumTevStages(1); + GX_SetNumChans(1); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_CLR0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_CLR0, GX_CLR_RGBA, GX_RGBA8, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetNumTexGens(1); + GX_SetTevOp(GX_TEVSTAGE0, GX_MODULATE); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLOR0A0); + GX_SetBlendMode(GX_BM_BLEND, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + // + guMtxIdentity(modelMtx); + guMtxRotAxisDeg(modelMtx, &rotAxis, m_covers[i].txtAngle); + guMtxTransApply(modelMtx, modelMtx, m_covers[i].txtPos.x, mirror ? -m_covers[i].txtPos.y : m_covers[i].txtPos.y, m_covers[i].txtPos.z); + guMtxConcat(m_viewMtx, modelMtx, modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + m_covers[i].title.draw(); +} + +void CCoverFlow::_drawCover(int i, bool mirror, CCoverFlow::DrawMode dm) +{ + Mtx modelMtx; + Mtx rotMtx; + Mtx modelViewMtx; + Vector3D osc; + Vector3D oscP; + + if (m_hideCover) + return; + if (m_covers[i].color.a == 0 || (dm == CCoverFlow::CFDR_SHADOW && m_covers[i].shadowColor.a == 0)) + return; + if (dm == CCoverFlow::CFDR_STENCIL && (i > 0xFF || _invisibleCover(i / m_rows, i % m_rows))) + return; + if ((u32)i == m_range / 2) + { + osc = _coverMovesA(); + oscP = _coverMovesP(); + } + // + guMtxIdentity(modelMtx); + guMtxScaleApply(modelMtx, modelMtx, m_covers[i].scale.x, m_covers[i].scale.y, m_covers[i].scale.z); + if (dm == CCoverFlow::CFDR_SHADOW) + guMtxScaleApply(modelMtx, modelMtx, 1.f + (m_shadowScale - 1.f) * g_boxSize.y / g_boxSize.x, m_shadowScale, m_shadowScale); + guMtxRotDeg(rotMtx, 'Z', m_covers[i].angle.z + osc.z); + guMtxConcat(rotMtx, modelMtx, modelMtx); + guMtxRotDeg(rotMtx, 'X', m_covers[i].angle.x + osc.x); + guMtxConcat(rotMtx, modelMtx, modelMtx); + guMtxRotDeg(rotMtx, 'Y', m_covers[i].angle.y + osc.y); + guMtxConcat(rotMtx, modelMtx, modelMtx); + guMtxTransApply(modelMtx, modelMtx, m_covers[i].pos.x + oscP.x, m_covers[i].pos.y + oscP.y + g_coverYCenter, m_covers[i].pos.z + oscP.z); + if (mirror) + guMtxScaleApply(modelMtx, modelMtx, 1.f, -1.f, 1.f); + guMtxConcat(m_viewMtx, modelMtx, modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + // Cover + if (m_box) + _drawCoverBox(i, mirror, dm); + else + _drawCoverFlat(i, mirror, dm); +} + +STexture &CCoverFlow::_coverTexture(int i) +{ + if (!m_items[i].texture.data) + return m_items[i].state == CCoverFlow::STATE_Loading ? m_loadingTexture : m_noCoverTexture; + return m_items[i].texture; +} + +void CCoverFlow::_drawCoverFlat(int i, bool mirror, CCoverFlow::DrawMode dm) +{ + GXTexObj texObj; + STexture &tex = _coverTexture(m_covers[i].index); + bool boxTex = m_items[m_covers[i].index].boxTexture && !!m_items[m_covers[i].index].texture.data; + + switch (dm) + { + case CCoverFlow::CFDR_NORMAL: + { + CColor color(m_covers[i].color); + if (mirror) + color.a = (u8)((float)color.a * m_mirrorAlpha); + GX_SetTevKColor(GX_KCOLOR0, color); + break; + } + case CCoverFlow::CFDR_STENCIL: + GX_SetTevKColor(GX_KCOLOR0, CColor(i + 1, 0xFF, 0xFF, 0xFF)); + break; + case CCoverFlow::CFDR_SHADOW: + { + CColor color(m_covers[i].shadowColor); + if (mirror) + color.a = (u8)((float)color.a * m_mirrorAlpha); + GX_SetTevKColor(GX_KCOLOR0, color); + break; + } + } + if (dm == CCoverFlow::CFDR_NORMAL) + { + GX_InitTexObj(&texObj, tex.data.get(), tex.width, tex.height, tex.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + if (tex.maxLOD > 0) + GX_InitTexObjLOD(&texObj, GX_LIN_MIP_LIN, GX_LINEAR, 0.f, (float)tex.maxLOD, mirror ? 1.f : m_lodBias, GX_FALSE, m_edgeLOD ? GX_TRUE : GX_FALSE, m_aniso); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + } + GX_Begin(GX_QUADS, GX_VTXFMT0, g_flatCoverMeshSize); + for (u32 j = 0; j < g_flatCoverMeshSize; ++j) + { + GX_Position3f32(g_flatCoverMesh[j].pos.x, g_flatCoverMesh[j].pos.y, g_flatCoverMesh[j].pos.z); + if (dm == CCoverFlow::CFDR_NORMAL) + { + if (boxTex) + GX_TexCoord2f32(g_flatCoverBoxTex[j].x, g_flatCoverBoxTex[j].y); + else + GX_TexCoord2f32(g_flatCoverMesh[j].texCoord.x, g_flatCoverMesh[j].texCoord.y); + } + } + GX_End(); +} + +void CCoverFlow::_drawCoverBox(int i, bool mirror, CCoverFlow::DrawMode dm) +{ + GXTexObj texObj; + STexture &tex = _coverTexture(m_covers[i].index); + CColor color; + bool flatTex = !m_items[m_covers[i].index].boxTexture && !!m_items[m_covers[i].index].texture.data; + + switch (dm) + { + case CCoverFlow::CFDR_NORMAL: + color = m_covers[i].color; + if (mirror) + color.a = (u8)((float)color.a * m_mirrorAlpha); + GX_SetTevKColor(GX_KCOLOR0, color); + break; + case CCoverFlow::CFDR_STENCIL: + GX_SetTevKColor(GX_KCOLOR0, CColor(i + 1, 0xFF, 0xFF, 0xFF)); + break; + case CCoverFlow::CFDR_SHADOW: + color = m_covers[i].shadowColor; + if (mirror) + color.a = (u8)((float)color.a * m_mirrorAlpha); + GX_SetTevKColor(GX_KCOLOR0, color); + break; + } + if (dm == CCoverFlow::CFDR_NORMAL) + { + // set dvd box texture, depending on game + if (m_items[m_covers[i].index].hdr->hdr.casecolor == 0xFF0000 || + strncmp((char *) m_items[m_covers[i].index].hdr->hdr.id, "SMNE01", 6) == 0 || + strncmp((char *) m_items[m_covers[i].index].hdr->hdr.id, "SMNP01", 6) == 0 || + strncmp((char *) m_items[m_covers[i].index].hdr->hdr.id, "SMNJ01", 6) == 0 || + strncmp((char *) m_items[m_covers[i].index].hdr->hdr.id, "SMNK01", 6) == 0 || + strncmp((char *) m_items[m_covers[i].index].hdr->hdr.id, "SMNW01", 6) == 0) + { + GX_InitTexObj(&texObj, m_dvdSkin_Red.data.get(), m_dvdSkin_Red.width, m_dvdSkin_Red.height, m_dvdSkin_Red.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + } + else if (m_items[m_covers[i].index].hdr->hdr.casecolor == 0x000000 || + strncmp((char *) m_items[m_covers[i].index].hdr->hdr.id, "RZZJEL", 6) == 0 || + strncmp((char *) m_items[m_covers[i].index].hdr->hdr.id, "RZNJ01", 6) == 0) + { + GX_InitTexObj(&texObj, m_dvdSkin_Black.data.get(), m_dvdSkin_Black.width, m_dvdSkin_Black.height, m_dvdSkin_Black.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + } + else GX_InitTexObj(&texObj, m_dvdSkin.data.get(), m_dvdSkin.width, m_dvdSkin.height, m_dvdSkin.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + } + GX_Begin(GX_QUADS, GX_VTXFMT0, g_boxMeshQSize); + for (u32 j = 0; j < g_boxMeshQSize; ++j) + { + GX_Position3f32(g_boxMeshQ[j].pos.x, g_boxMeshQ[j].pos.y, g_boxMeshQ[j].pos.z); + if (dm == CCoverFlow::CFDR_NORMAL) + GX_TexCoord2f32(g_boxMeshQ[j].texCoord.x, g_boxMeshQ[j].texCoord.y); + } + GX_End(); + GX_Begin(GX_TRIANGLES, GX_VTXFMT0, g_boxMeshTSize); + for (u32 j = 0; j < g_boxMeshTSize; ++j) + { + GX_Position3f32(g_boxMeshT[j].pos.x, g_boxMeshT[j].pos.y, g_boxMeshT[j].pos.z); + if (dm == CCoverFlow::CFDR_NORMAL) + GX_TexCoord2f32(g_boxMeshT[j].texCoord.x, g_boxMeshT[j].texCoord.y); + } + GX_End(); + if (dm == CCoverFlow::CFDR_NORMAL) + { + STexture *myTex = &tex; + if (flatTex) + myTex = &m_noCoverTexture; + GX_InitTexObj(&texObj, myTex->data.get(), myTex->width, myTex->height, myTex->format, GX_CLAMP, GX_CLAMP, GX_FALSE); + if (myTex->maxLOD > 0) + GX_InitTexObjLOD(&texObj, GX_LIN_MIP_LIN, GX_LINEAR, 0.f, (float)myTex->maxLOD, mirror ? 1.f : m_lodBias, GX_FALSE, m_edgeLOD ? GX_TRUE : GX_FALSE, m_aniso); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + } + GX_Begin(GX_QUADS, GX_VTXFMT0, g_boxBackCoverMeshSize); + for (u32 j = 0; j < g_boxBackCoverMeshSize; ++j) + { + GX_Position3f32(g_boxBackCoverMesh[j].pos.x, g_boxBackCoverMesh[j].pos.y, g_boxBackCoverMesh[j].pos.z); + if (dm == CCoverFlow::CFDR_NORMAL) + GX_TexCoord2f32(g_boxBackCoverMesh[j].texCoord.x, g_boxBackCoverMesh[j].texCoord.y); + } + GX_End(); + if (dm == CCoverFlow::CFDR_NORMAL && flatTex) + { + GX_InitTexObj(&texObj, tex.data.get(), tex.width, tex.height, tex.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + if (tex.maxLOD > 0) + GX_InitTexObjLOD(&texObj, GX_LIN_MIP_LIN, GX_LINEAR, 0.f, (float)tex.maxLOD, mirror ? 1.f : m_lodBias, GX_FALSE, m_edgeLOD ? GX_TRUE : GX_FALSE, m_aniso); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + } + GX_Begin(GX_QUADS, GX_VTXFMT0, g_boxCoverMeshSize); + for (u32 j = 0; j < g_boxCoverMeshSize; ++j) + { + GX_Position3f32(g_boxCoverMesh[j].pos.x, g_boxCoverMesh[j].pos.y, g_boxCoverMesh[j].pos.z); + if (dm == CCoverFlow::CFDR_NORMAL) + { + if (flatTex) + GX_TexCoord2f32(g_boxCoverFlatTex[j].x, g_boxCoverFlatTex[j].y); + else + GX_TexCoord2f32(g_boxCoverMesh[j].texCoord.x, g_boxCoverMesh[j].texCoord.y); + } + } + GX_End(); +} + +void CCoverFlow::_loadCover(int i, int item) +{ + m_covers[i].index = item; + m_covers[i].title.setText(m_font, m_items[item].hdr->title); +} + +std::string CCoverFlow::getId(void) const +{ + if (m_covers.empty() || m_items.empty()) return ""; + return std::string((char *) &m_items[loopNum(m_covers[m_range / 2].index + m_jump, m_items.size())].hdr->hdr.id); +} + +std::string CCoverFlow::getNextId(void) const +{ + if (m_covers.empty() || m_items.empty()) return ""; + return std::string((char *) &m_items[loopNum(m_covers[m_range / 2].index + m_jump + 1, m_items.size())].hdr->hdr.id); +} + +dir_discHdr * CCoverFlow::getHdr(void) const +{ + if (m_covers.empty() || m_items.empty()) return NULL; + return m_items[loopNum(m_covers[m_range / 2].index + m_jump, m_items.size())].hdr; +} + +dir_discHdr * CCoverFlow::getNextHdr(void) const +{ + if (m_covers.empty() || m_items.empty()) return NULL; + return m_items[loopNum(m_covers[m_range / 2].index + m_jump + 1, m_items.size())].hdr; +} + +wstringEx CCoverFlow::getTitle(void) const +{ + if (m_covers.empty()) return L""; + + return m_items[m_covers[m_range / 2].index].hdr->title; +} + +u64 CCoverFlow::getChanTitle(void) const +{ + if (m_covers.empty() || m_items.empty()) return 0; + + return m_items[loopNum(m_covers[m_range / 2].index + m_jump, m_items.size())].hdr->hdr.chantitle; +} + + +bool CCoverFlow::select(void) +{ + if (m_covers.empty() || m_jump != 0) return false; + if (m_selected) return true; + + LockMutex lock(m_mutex); + int curPos = (int)m_range / 2; + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if ((u32)m_mouse[chan] < m_range && m_mouse[chan] != curPos) + { + int j; + if (m_rows >= 3) + j = ((m_mouse[chan] / m_rows - 1) * (m_rows - 2) + m_mouse[chan] % m_rows - 1) + - ((curPos / m_rows - 1) * (m_rows - 2) + curPos % m_rows - 1); + else + j = m_mouse[chan] - (int)(m_range / 2); + _setJump(j); + } + m_cameraPos += _cameraMoves(); + m_covers[m_range / 2].angle += _coverMovesA(); + m_covers[m_range / 2].pos += _coverMovesP(); + m_selected = true; + m_covers[m_range / 2].angle -= _coverMovesA(); + m_covers[m_range / 2].pos -= _coverMovesP(); + m_cameraPos -= _cameraMoves(); + _updateAllTargets(); + _playSound(m_selectSound); + return true; +} + +void CCoverFlow::cancel(void) +{ + if (m_covers.empty()) return; + + LockMutex lock(m_mutex); + _unselect(); + _updateAllTargets(); + _playSound(m_cancelSound); +} + +void CCoverFlow::_updateAllTargets(bool instant) +{ + m_targetCameraPos = m_selected ? m_loSelected.camera : m_loNormal.camera; + m_targetCameraAim = m_selected ? m_loSelected.cameraAim : m_loNormal.cameraAim; + for (u32 i = 0; i < m_range; ++i) + _updateTarget(i, instant); +} + +void CCoverFlow::_updateTarget(int i, bool instant) +{ + SLayout &lo = m_selected ? m_loSelected : m_loNormal; + int hcenter = m_columns / 2; + int vcenter = m_rows / 2; + int x = i / m_rows; + int y = i % m_rows; + CCover &cvr = m_covers[i]; + + // Left covers + if (x < hcenter) + { + Vector3D deltaAngle(lo.leftDeltaAngle * (float)(hcenter - 1 - x)); + cvr.targetAngle = lo.leftAngle + deltaAngle; + cvr.targetPos = lo.leftPos + lo.leftSpacer.rotateY(deltaAngle.y * 0.5f) * (float)(hcenter - 1 - x); + cvr.targetScale = lo.leftScale; + if (_invisibleCover(x, y)) + { + cvr.targetColor = CColor(lo.endColor.r, lo.endColor.g, lo.endColor.b, 0); + cvr.targetShadowColor = CColor(lo.shadowColorEnd.r, lo.shadowColorEnd.g, lo.shadowColorEnd.b, 0); + } + else + { + u8 a = (x - 1) * 0xFF / max(1, hcenter - 2); + cvr.targetColor = CColor::interpolate(lo.endColor, lo.begColor, a); + cvr.targetShadowColor = CColor::interpolate(lo.shadowColorEnd, lo.shadowColorBeg, a); + } + cvr.txtTargetAngle = lo.txtLeftAngle; + cvr.txtTargetPos = lo.txtLeftPos; + cvr.txtTargetColor = 0; + cvr.title.setFrame(lo.txtSideWidth, lo.txtSideStyle, false, instant); + } + // Right covers + else if (x > hcenter) + { + Vector3D deltaAngle(lo.rightDeltaAngle * (float)(x - hcenter - 1)); + cvr.targetAngle = lo.rightAngle + deltaAngle; + cvr.targetPos = lo.rightPos + lo.rightSpacer.rotateY(deltaAngle.y * 0.5f) * (float)(x - hcenter - 1); + cvr.targetScale = lo.rightScale; + if (_invisibleCover(x, y)) + { + cvr.targetColor = CColor(lo.endColor.r, lo.endColor.g, lo.endColor.b, 0); + cvr.targetShadowColor = CColor(lo.shadowColorEnd.r, lo.shadowColorEnd.g, lo.shadowColorEnd.b, 0); + } + else + { + u8 a = (m_columns - x - 2) * 0xFF / max(1, hcenter - 2); + cvr.targetColor = CColor::interpolate(lo.endColor, lo.begColor, a); + cvr.targetShadowColor = CColor::interpolate(lo.shadowColorEnd, lo.shadowColorBeg, a); + } + cvr.txtTargetAngle = lo.txtRightAngle; + cvr.txtTargetPos = lo.txtRightPos; + cvr.txtTargetColor = 0; + cvr.title.setFrame(lo.txtSideWidth, lo.txtSideStyle, false, instant); + } + // New center cover + else if (y == vcenter) + { + cvr.targetColor = 0xFFFFFFFF; + cvr.targetShadowColor = lo.shadowColorCenter; + cvr.targetAngle = lo.centerAngle; + cvr.targetPos = lo.centerPos; + cvr.targetScale = lo.centerScale; + cvr.txtTargetColor = 0xFF; + cvr.txtTargetAngle = lo.txtCenterAngle; + cvr.txtTargetPos = lo.txtCenterPos; + cvr.title.setFrame(lo.txtCenterWidth, lo.txtCenterStyle, false, instant); + } + else // Center of a row + { + cvr.targetColor = lo.begColor; + cvr.targetShadowColor = lo.shadowColorBeg; + cvr.targetAngle = lo.rowCenterAngle; + cvr.targetPos = lo.rowCenterPos; + cvr.targetScale = lo.rowCenterScale; + cvr.txtTargetColor = 0; + if (y < vcenter) + { + cvr.txtTargetAngle = lo.txtLeftAngle; + cvr.txtTargetPos = lo.txtLeftPos; + } + else // (y > vcenter) + { + cvr.txtTargetAngle = lo.txtRightAngle; + cvr.txtTargetPos = lo.txtRightPos; + } + cvr.title.setFrame(lo.txtSideWidth, lo.txtSideStyle, false, instant); + } + // Top row + if (y < vcenter) + { + Vector3D deltaAngle(lo.topDeltaAngle * (float)(vcenter - y - 1)); + cvr.targetAngle += lo.topAngle + deltaAngle; + cvr.targetPos += lo.topSpacer.rotateX(deltaAngle.x * 0.5f) * (float)(vcenter - y); + if (_invisibleCover(x, y)) + { + cvr.targetColor = CColor(lo.endColor.r, lo.endColor.g, lo.endColor.b, 0); + cvr.targetShadowColor = CColor(lo.shadowColorEnd.r, lo.shadowColorEnd.g, lo.shadowColorEnd.b, 0); + } + else + { + u8 a = (y - 1) * 0xFF / max(1, vcenter - 2); + CColor c1(CColor::interpolate(lo.endColor, lo.begColor, a)); + cvr.targetColor = CColor::interpolate(c1, cvr.targetColor, 0x7F); + CColor c2(CColor::interpolate(lo.shadowColorEnd, lo.shadowColorBeg, a)); + cvr.targetShadowColor = CColor::interpolate(c2, cvr.targetShadowColor, 0x7F); + } + } + // Bottom row + else if (y > vcenter) + { + Vector3D deltaAngle(lo.bottomDeltaAngle * (float)(y - vcenter - 1)); + cvr.targetAngle += lo.bottomAngle + deltaAngle; + cvr.targetPos += lo.bottomSpacer.rotateX(deltaAngle.x * 0.5f) * (float)(y - vcenter); + if (_invisibleCover(x, y)) + { + cvr.targetColor = CColor(lo.endColor.r, lo.endColor.g, lo.endColor.b, 0); + cvr.targetShadowColor = CColor(lo.shadowColorEnd.r, lo.shadowColorEnd.g, lo.shadowColorEnd.b, 0); + } + else + { + u8 a = (m_rows - y - 2) * 0xFF / max(1, vcenter - 2); + CColor c1(CColor::interpolate(lo.endColor, lo.begColor, a)); + cvr.targetColor = CColor::interpolate(c1, cvr.targetColor, 0x7F); + CColor c2(CColor::interpolate(lo.shadowColorEnd, lo.shadowColorBeg, a)); + cvr.targetShadowColor = CColor::interpolate(c2, cvr.targetShadowColor, 0x7F); + } + } + else if (vcenter > 0 && !_invisibleCover(x, y) && x != hcenter) + { + cvr.targetColor = CColor::interpolate(lo.begColor, cvr.targetColor, 0x7F); + cvr.targetShadowColor = CColor::interpolate(lo.shadowColorBeg, cvr.targetShadowColor, 0x7F); + } + // Mouse selection + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if (!m_selected && (u32)m_mouse[chan] < m_range) + { + if (i == m_mouse[chan]) + { + cvr.targetColor = 0xFFFFFFFF; + cvr.targetShadowColor = lo.shadowColorCenter; + cvr.txtTargetAngle = lo.txtCenterAngle; + cvr.txtTargetPos = lo.txtCenterPos; + cvr.txtTargetColor = 0xFF; + cvr.title.setFrame(lo.txtCenterWidth, lo.txtCenterStyle, false, instant); + } + else + { + cvr.targetColor = lo.mouseOffColor; + cvr.targetShadowColor = lo.shadowColorOff; + cvr.txtTargetAngle = m_mouse[chan] > i ? lo.txtLeftAngle : lo.txtRightAngle; + cvr.txtTargetPos = m_mouse[chan] > i ? lo.txtLeftPos : lo.txtRightPos; + cvr.txtTargetColor = 0; + cvr.title.setFrame(lo.txtSideWidth, lo.txtSideStyle, false, instant); + } + if (_invisibleCover(x, y)) + { + cvr.targetColor.a = 0; + cvr.targetShadowColor.a = 0; + } + } + // + if (instant) + _instantTarget(i); +} + +void CCoverFlow::_instantTarget(int i) +{ + CCover &cvr = m_covers[i]; + + cvr.angle = cvr.targetAngle; + cvr.pos = cvr.targetPos; + cvr.scale = cvr.targetScale; + cvr.color = cvr.targetColor; + cvr.shadowColor = cvr.targetShadowColor; + cvr.txtAngle = cvr.txtTargetAngle; + cvr.txtPos = cvr.txtTargetPos; + cvr.txtColor = cvr.txtTargetColor; +} + +bool CCoverFlow::_sortByPlayCount(CItem item1, CItem item2) +{ + return (item1.playcount == item2.playcount) ? _sortByAlpha(item1, item2) : item1.playcount > item2.playcount; +} + +bool CCoverFlow::_sortByLastPlayed(CItem item1, CItem item2) +{ + return (item1.lastPlayed == item2.lastPlayed) ? _sortByPlayCount(item1, item2) : item1.lastPlayed > item2.lastPlayed; +} + +bool CCoverFlow::_sortByGameID(CItem item1, CItem item2) +{ + u32 s = min(strlen((char *) &item1.hdr->hdr.id), strlen((char *) &item2.hdr->hdr.id)); + for (u32 k = 0; k < s; ++k) + { + if (toupper(item1.hdr->hdr.id[k]) > toupper(item2.hdr->hdr.id[k])) + return false; + else if (toupper(item1.hdr->hdr.id[k]) < toupper(item2.hdr->hdr.id[k])) + return true; + } + + return strlen((char *) &item1.hdr->hdr.id) < strlen((char *) &item2.hdr->hdr.id); +} + +bool CCoverFlow::_sortByAlpha(CItem item1, CItem item2) +{ + u32 s = min(wcslen(item1.hdr->title), wcslen(item2.hdr->title)); + wstringEx title1 = item1.hdr->title; + wstringEx title2 = item2.hdr->title; + + for (u32 j = 0, k = 0; j < s && k < s; ++j && ++k) + { + while (!iswalnum(title1[j]) && j < s) j++; + while (!iswalnum(title2[k]) && k < s) k++; + + if (upperCaseWChar(title1[j]) < upperCaseWChar(title2[k])) + return true; + else if(upperCaseWChar(title1[j]) > upperCaseWChar(title2[k])) + return false; + } + return title1.length() < title2.length(); +} + +bool CCoverFlow::_sortByPlayers(CItem item1, CItem item2) +{ + if(item1.hdr->hdr.players == item2.hdr->hdr.players) return _sortByAlpha(item1, item2); + return item1.hdr->hdr.players < item2.hdr->hdr.players; +} + +bool CCoverFlow::_sortByWifiPlayers(CItem item1, CItem item2) +{ + if(item1.hdr->hdr.wifi == item2.hdr->hdr.wifi) return _sortByAlpha(item1, item2); + return item1.hdr->hdr.wifi < item2.hdr->hdr.wifi; +} + +bool CCoverFlow::start(const char *id) +{ + if (m_items.empty()) return true; + + // Sort items + if (m_sorting == SORT_ALPHA) + sort(m_items.begin(), m_items.end(), CCoverFlow::_sortByAlpha); + else if (m_sorting == SORT_PLAYCOUNT) + sort(m_items.begin(), m_items.end(), CCoverFlow::_sortByPlayCount); + else if (m_sorting == SORT_LASTPLAYED) + sort(m_items.begin(), m_items.end(), CCoverFlow::_sortByLastPlayed); + else if (m_sorting == SORT_GAMEID) + sort(m_items.begin(), m_items.end(), CCoverFlow::_sortByGameID); + else if (m_sorting == SORT_PLAYERS) + sort(m_items.begin(), m_items.end(), CCoverFlow::_sortByPlayers); + else if (m_sorting == SORT_WIFIPLAYERS) + sort(m_items.begin(), m_items.end(), CCoverFlow::_sortByWifiPlayers); + + // Load resident textures + if (STexture::TE_OK != m_dvdSkin.fromPNG(dvdskin_png)) return false; + if (STexture::TE_OK != m_dvdSkin_Red.fromPNG(dvdskin_red_png)) return false; + if (STexture::TE_OK != m_dvdSkin_Black.fromPNG(dvdskin_black_png)) return false; + + if (m_box) + { + if (m_pngLoadCover.empty() || STexture::TE_OK != m_loadingTexture.fromPNGFile(m_pngLoadCover.c_str(), GX_TF_CMPR, ALLOC_MEM2, 32, 512)) + if (STexture::TE_OK != m_loadingTexture.fromPNG(loading_png, GX_TF_CMPR, ALLOC_MEM2, 32, 512)) return false; + + if (m_pngNoCover.empty() || STexture::TE_OK != m_noCoverTexture.fromPNGFile(m_pngNoCover.c_str(), GX_TF_CMPR, ALLOC_MEM2, 32, 512)) + if (STexture::TE_OK != m_noCoverTexture.fromPNG(nopic_png, GX_TF_CMPR, ALLOC_MEM2, 32, 512)) return false; + } + else + { + if (m_pngLoadCoverFlat.empty() || STexture::TE_OK != m_loadingTexture.fromPNGFile(m_pngLoadCoverFlat.c_str(), GX_TF_CMPR, ALLOC_MEM2, 32, 512)) + if (STexture::TE_OK != m_loadingTexture.fromPNG(flatloading_png, GX_TF_CMPR, ALLOC_MEM2, 32, 512)) return false; + + if (m_pngNoCoverFlat.empty() || STexture::TE_OK != m_noCoverTexture.fromPNGFile(m_pngNoCoverFlat.c_str(), GX_TF_CMPR, ALLOC_MEM2, 32, 512)) + if (STexture::TE_OK != m_noCoverTexture.fromPNG(flatnopic_png, GX_TF_CMPR, ALLOC_MEM2, 32, 512)) return false; + } + + m_covers.clear(); + m_covers.resize(m_range); + m_jump = 0; + m_selected = false; + if (id == 0 || !findId(id, true)) + _loadAllCovers(0); + _updateAllTargets(); + startCoverLoader(); + return true; +} + +void CCoverFlow::up(void) +{ + if (m_covers.empty()) return; + if (m_jump != 0) return; + + LockMutex lock(m_mutex); + _left(m_minDelay, 1); +} + +void CCoverFlow::down(void) +{ + if (m_covers.empty()) return; + if (m_jump != 0) return; + + LockMutex lock(m_mutex); + _right(m_minDelay, 1); +} + +void CCoverFlow::left(void) +{ + if (m_covers.empty()) return; + if (m_jump != 0) return; + + LockMutex lock(m_mutex); + _left(m_minDelay, m_rows >= 3 ? m_rows - 2 : 1); +} + +void CCoverFlow::right(void) +{ + if (m_covers.empty()) return; + if (m_jump != 0) return; + + LockMutex lock(m_mutex); + _right(m_minDelay, m_rows >= 3 ? m_rows - 2 : 1); +} +#include "gecko.h" +void CCoverFlow::_playSound(void) +{ + if (m_soundVolume > 0) + { + sndCopyNum++; + if(sndCopyNum == 4) sndCopyNum = 0; + _playSound( m_sound[sndCopyNum] ); + //gprintf("\n\nPlaying flipsound copy # %u\n\n", sndCopyNum); + } +} + +void CCoverFlow::_left(int repeatDelay, u32 step) +{ + int prev, arrStep; + + if (m_delay > 0) return; + + m_moved = true; + m_delay = repeatDelay; + m_covers[m_range / 2].angle += _coverMovesA(); + m_covers[m_range / 2].pos += _coverMovesP(); + if (m_rows >= 3) + { + prev = m_covers[m_range / 2].index; + // Shift the array to the right + arrStep = step % (m_rows - 2) + (step / (m_rows - 2)) * m_rows; + for (int i = (int)m_range - 1; i >= arrStep; --i) + m_covers[i] = m_covers[i - arrStep]; + _loadAllCovers(loopNum((int)prev - step, m_items.size())); + _updateAllTargets(); + if (arrStep % m_rows != 0) + for (u32 i = 0; i < m_columns; ++i) + _instantTarget(i * m_rows); + if (arrStep / m_rows != 0) + for (u32 i = 0; i < m_rows; ++i) + _instantTarget(i); + } + else + { + prev = m_covers[0].index; + // Shift the array to the right + for (int i = (int)m_range - 1; i > 0; --i) + m_covers[i] = m_covers[i - 1]; + _loadCover(0, loopNum(prev - step, m_items.size())); + _updateAllTargets(); + _instantTarget(0); + } + _playSound(); + m_covers[m_range / 2].angle -= _coverMovesA(); + m_covers[m_range / 2].pos -= _coverMovesP(); +} + +void CCoverFlow::_right(int repeatDelay, u32 step) +{ + int prev, arrStep; + + if (m_delay > 0) return; + + m_moved = true; + m_delay = repeatDelay; + m_covers[m_range / 2].angle += _coverMovesA(); + m_covers[m_range / 2].pos += _coverMovesP(); + if (m_rows >= 3) + { + prev = m_covers[m_range / 2].index; + // Shift the array to the left + arrStep = step % (m_rows - 2) + (step / (m_rows - 2)) * m_rows; + for (u32 i = 0; i < m_range - arrStep; ++i) + m_covers[i] = m_covers[i + arrStep]; + _loadAllCovers(loopNum(prev + step, m_items.size())); + _updateAllTargets(); + if (arrStep % m_rows != 0) + for (u32 i = 0; i < m_columns; ++i) + _instantTarget(i * m_rows + m_rows - 1); + if (arrStep / m_rows != 0) + for (u32 i = 0; i < m_rows; ++i) + _instantTarget(i + (m_columns - 1) * m_rows); + } + else + { + prev = m_covers[m_range - 1].index; + // Shift the array to the left + for (u32 i = 0; i < m_range - 1; ++i) + m_covers[i] = m_covers[i + 1]; + _loadCover(m_range - 1, loopNum(prev + step, m_items.size())); + _updateAllTargets(); + _instantTarget(m_range - 1); + } + _playSound(); + m_covers[m_range / 2].angle -= _coverMovesA(); + m_covers[m_range / 2].pos -= _coverMovesP(); +} + +u32 CCoverFlow::_currentPos(void) const +{ + if (m_covers.empty()) return 0; + + return m_covers[m_range / 2].index; +} + +void CCoverFlow::mouse(CVideo &vid, int chan, int x, int y) +{ + if (m_covers.empty()) return; + + int m = m_mouse[chan]; + if (x < 0 || y < 0) + m_mouse[chan] = -1; + else + { + vid.prepareStencil(); + _draw(CCoverFlow::CFDR_STENCIL, false, false); + vid.renderStencil(); + m_mouse[chan] = vid.stencilVal(x, y) - 1; + } + if (m != m_mouse[chan]) + { + if ((u32)m_mouse[chan] < m_range) + _playSound(m_hoverSound); + _updateAllTargets(); + } +} + +bool CCoverFlow::mouseOver(CVideo &vid, int x, int y) +{ + if (m_covers.empty()) return false; + + vid.prepareStencil(); + _draw(CCoverFlow::CFDR_STENCIL, false, false); + vid.renderStencil(); + vid.prepareStencil(); + _draw(CCoverFlow::CFDR_STENCIL, false, false); + vid.renderStencil(); + return vid.stencilVal(x, y) == (int)m_range / 2 + 1; +} + +bool CCoverFlow::findId(const char *id, bool instant) +{ + LockMutex lock(m_mutex); + u32 i, curPos = _currentPos(); + + if (m_items.empty() || (instant && m_covers.empty())) + return false; + // + for (i = 0; i < m_items.size(); ++i) + if (memcmp(&m_items[i].hdr->hdr.id, id, strlen(id)) == 0) + break; + if (i >= m_items.size()) + return false; + m_jump = 0; + if (instant) + { + _loadAllCovers(i); + _updateAllTargets(); + } + else + { + int j = (int)i - (int)curPos; + if (abs(j) <= (int)m_items.size() / 2) + _setJump(j); + else + _setJump(j < 0 ? j + (int)m_items.size() : j - (int)m_items.size()); + } + return true; +} + +void CCoverFlow::pageUp(void) +{ + if (m_covers.empty()) return; + + int n, j; + if (m_rows >= 3) + { + j = m_jump - max(1, (int)m_columns - 2); + if (m_jump != 0) + { + n = ((int)m_items.size() - 1) / (m_rows - 2) + 1; + j = j < 0 ? -(-j % n) : j % n; + } + j *= (int)m_rows - 2; + } + else + { + j = m_jump - max(1, (int)m_range / 2); + if (m_jump != 0) + { + n = (int)m_items.size(); + j = j < 0 ? -(-j % n) : j % n; + } + } + _setJump(j); +} + +void CCoverFlow::pageDown(void) +{ + if (m_covers.empty()) return; + + int n, j; + if (m_rows >= 3) + { + j = m_jump + max(1, (int)m_columns - 2); + if (m_jump != 0) + { + n = ((int)m_items.size() - 1) / (m_rows - 2) + 1; + j = j < 0 ? -(-j % n) : j % n; + } + j *= (int)m_rows - 2; + } + else + { + j = m_jump + max(1, (int)m_range / 2); + if (m_jump != 0) + { + n = (int)m_items.size(); + j = j < 0 ? -(-j % n) : j % n; + } + } + _setJump(j); +} + +void CCoverFlow::flip(bool force, bool f) +{ + if (m_covers.empty() || !m_selected) return; + LockMutex lock(m_mutex); + + CCoverFlow::CCover &cvr = m_covers[m_range / 2]; + if (!force) + f = m_loSelected.centerAngle == cvr.targetAngle && m_loSelected.centerPos == cvr.targetPos && m_loSelected.centerScale == cvr.targetScale; + if (f) + { + cvr.targetPos = m_loSelected.centerPos + m_flipCoverPos; + cvr.targetAngle = m_loSelected.centerAngle + m_flipCoverAngle; + cvr.targetScale = m_loSelected.centerScale * m_flipCoverScale; + cvr.txtTargetColor = m_flipCoverPos == Vector3D(0.f, 0.f, 0.f) ? 0xFF : 0; + } + else + { + cvr.targetPos = m_loSelected.centerPos; + cvr.targetAngle = m_loSelected.centerAngle; + cvr.targetScale = m_loSelected.centerScale; + cvr.txtTargetColor = 0xFF; + } +} + +bool CCoverFlow::_invisibleCover(u32 x, u32 y) +{ + return (m_rows > 1 && (y == 0 || y == m_rows - 1)) || x == 0 || x == m_columns - 1; +} + +void CCoverFlow::_loadAllCovers(int i) +{ + int r = (int)m_rows; + int c = (int)m_columns; + int s = (int)m_items.size(); + + if (m_rows >= 3) + for (int j = 0; j < r; ++j) + for (int k = 0; k < c; ++k) + _loadCover(j + k * r, loopNum(i + (j - r / 2) + (k - c / 2) * (r - 2), s)); + else + for (int k = 0; k < (int)m_range; ++k) + _loadCover(k, loopNum(i + k - (int)m_range / 2, s)); +} + +void CCoverFlow::_setJump(int j) +{ + _loadAllCovers(_currentPos()); + m_jump = j; + if (m_jump == 0) + _updateAllTargets(); +} + +void CCoverFlow::_completeJump(void) +{ + if (m_rows >= 3) + _loadAllCovers((int)m_covers[m_range / 2].index + m_jump); + else + { + if (m_jump < 0) + _loadAllCovers((int)m_covers[0].index + m_jump + (int)m_range / 2); + else + _loadAllCovers((int)m_covers[m_range - 1].index + m_jump - ((int)m_range - 1) / 2); + } +} + +void CCoverFlow::nextLetter(wchar_t *c) +{ + if (m_covers.empty()) + { + c[0] = L'\0'; + return; + } + + if (m_sorting == SORT_WIFIPLAYERS || m_sorting == SORT_PLAYERS) + return nextPlayers(m_sorting == SORT_WIFIPLAYERS, c); + + if (m_sorting == SORT_GAMEID) + return nextID(c); + + LockMutex lock(m_mutex); + + u32 i, j = 0, k = 0, n = m_items.size(); + + _completeJump(); + u32 curPos = _currentPos(); + + while (!iswalnum(m_items[curPos].hdr->title[j]) && m_items[curPos].hdr->title[j+1] != L'\0') j++; + c[0] = upperCaseWChar(m_items[curPos].hdr->title[j]); + + for (i = 1; i < n; ++i) + { + k = 0; + while (!iswalnum(m_items[loopNum(curPos + i, n)].hdr->title[k]) && m_items[loopNum(curPos + i, n)].hdr->title[k+1] != L'\0') k++; + if (upperCaseWChar(m_items[loopNum(curPos + i, n)].hdr->title[k]) != c[0]) + break; + } + if (i < n) + { + _setJump(i); + c[0] = upperCaseWChar(m_items[loopNum(curPos + i, n)].hdr->title[k]); + } + _updateAllTargets(); +} + +void CCoverFlow::prevLetter(wchar_t *c) +{ + if (m_covers.empty()) + { + c[0] = L'\0'; + return; + } + + if (m_sorting == SORT_WIFIPLAYERS || m_sorting == SORT_PLAYERS) + return prevPlayers(m_sorting == SORT_WIFIPLAYERS, c); + + if (m_sorting == SORT_GAMEID) + return prevID(c); + + LockMutex lock(m_mutex); + u32 i, j = 0, k = 0, n = m_items.size(); + + _completeJump(); + u32 curPos = _currentPos(); + + while (!iswalnum(m_items[curPos].hdr->title[j]) && m_items[curPos].hdr->title[j+1] != L'\0') j++; + c[0] = upperCaseWChar(m_items[curPos].hdr->title[j]); + + for (i = 1; i < n; ++i) + { + k = 0; + while (!iswalnum(m_items[loopNum(curPos - i, n)].hdr->title[k]) && m_items[loopNum(curPos - i, n)].hdr->title[k+1] != L'\0') k++; + if (upperCaseWChar(m_items[loopNum(curPos - i, n)].hdr->title[k]) != c[0]) + { + c[0] = upperCaseWChar(m_items[loopNum(curPos - i, n)].hdr->title[k]); + while(i < n) + { + ++i; + k = 0; + while (!iswalnum(m_items[loopNum(curPos - i, n)].hdr->title[k]) && m_items[loopNum(curPos - i, n)].hdr->title[k+1] != L'\0') k++; + if(upperCaseWChar(m_items[loopNum(curPos - i, n)].hdr->title[k]) != c[0]) + break; + } + i--; + break; + } + } + + if (i < n) + { + _setJump(-i); + k = 0; + while (!iswalnum(m_items[loopNum(curPos - i, n)].hdr->title[k]) && m_items[loopNum(curPos - i, n)].hdr->title[k+1] != L'\0') k++; + c[0] = upperCaseWChar(m_items[loopNum(curPos - i, n)].hdr->title[k]); + } + + _updateAllTargets(); +} + +void CCoverFlow::nextPlayers(bool wifi, wchar_t *c) +{ + LockMutex lock(m_mutex); + u32 i, n = m_items.size(); + + _completeJump(); + u32 curPos = _currentPos(); + int players = wifi ? m_items[curPos].hdr->hdr.wifi : m_items[curPos].hdr->hdr.players; + + for (i = 1; i < n; ++i) + if ((wifi ? m_items[loopNum(curPos + i, n)].hdr->hdr.wifi : m_items[loopNum(curPos + i, n)].hdr->hdr.players) != players) + break; + + if (i < n) + { + _setJump(i); + players = wifi ? m_items[loopNum(curPos + i, n)].hdr->hdr.wifi : m_items[loopNum(curPos + i, n)].hdr->hdr.players; + } + + char p[4] = {0 ,0 ,0 ,0}; + sprintf(p, "%d", players); + mbstowcs(c, p, strlen(p)); + + _updateAllTargets(); +} + +void CCoverFlow::prevPlayers(bool wifi, wchar_t *c) +{ + LockMutex lock(m_mutex); + u32 i, n = m_items.size(); + + _completeJump(); + u32 curPos = _currentPos(); + int players = wifi ? m_items[curPos].hdr->hdr.wifi : m_items[curPos].hdr->hdr.players; + + for (i = 1; i < n; ++i) + if ((wifi ? m_items[loopNum(curPos - i, n)].hdr->hdr.wifi : m_items[loopNum(curPos - i, n)].hdr->hdr.players) != players) + { + players = wifi ? m_items[loopNum(curPos - i, n)].hdr->hdr.wifi : m_items[loopNum(curPos - i, n)].hdr->hdr.players; + while(i < n && (wifi ? m_items[loopNum(curPos - i, n)].hdr->hdr.wifi : m_items[loopNum(curPos - i, n)].hdr->hdr.players) == players) ++i; + i--; + break; + } + + if (i < n) + { + _setJump(-i); + players = wifi ? m_items[loopNum(curPos - i, n)].hdr->hdr.wifi : m_items[loopNum(curPos - i, n)].hdr->hdr.players; + } + + char p[4] = {0 ,0 ,0 ,0}; + sprintf(p, "%d", players); + mbstowcs(c, p, strlen(p)); + + _updateAllTargets(); +} + +void CCoverFlow::nextID(wchar_t *c) +{ + LockMutex lock(m_mutex); + u32 i, n = m_items.size(); + + _completeJump(); + u32 curPos = _currentPos(); + char *system = (char *)m_items[curPos].hdr->hdr.id; + + for (i = 1; i < n; ++i) + if ((char)m_items[loopNum(curPos + i, n)].hdr->hdr.id[0] != system[0]) + break; + + if (i < n) + { + _setJump(i); + system = (char *)m_items[loopNum(curPos + i, n)].hdr->hdr.id; + } + + system[1] = '\0'; + mbstowcs(c, system, 1); + + _updateAllTargets(); +} + +void CCoverFlow::prevID(wchar_t *c) +{ + LockMutex lock(m_mutex); + u32 i, n = m_items.size(); + + _completeJump(); + u32 curPos = _currentPos(); + char *system = (char *)m_items[curPos].hdr->hdr.id; + + for (i = 1; i < n; ++i) + if ((char)m_items[loopNum(curPos - i, n)].hdr->hdr.id[0] != system[0]) + { + system = (char *)m_items[loopNum(curPos - i, n)].hdr->hdr.id; + while(i < n && (char)m_items[loopNum(curPos - i, n)].hdr->hdr.id[0] == system[0]) ++i; + i--; + break; + } + + if (i < n) + { + _setJump(-i); + system = (char *)m_items[loopNum(curPos - i, n)].hdr->hdr.id; + } + + system[1] = '\0'; + mbstowcs(c, system, 1); + + _updateAllTargets(); +} + +void CCoverFlow::_coverTick(int i) +{ + float speed = m_selected ? 0.07f : 0.1f; + Vector3D posDist(m_covers[i].targetPos - m_covers[i].pos); + + if (posDist.sqNorm() < 0.5f) + speed *= 0.5f; + m_covers[i].angle += (m_covers[i].targetAngle - m_covers[i].angle) * speed; + m_covers[i].pos += posDist * speed; + m_covers[i].scale += (m_covers[i].targetScale - m_covers[i].scale) * speed; + if (m_covers[i].color != m_covers[i].targetColor) + { + CColor c(m_covers[i].color); + m_covers[i].color = CColor::interpolate(c, m_covers[i].targetColor, 0x20); + if (m_covers[i].color == c) // If the interpolation doesn't do anything because of numerical approximation, force the target color + m_covers[i].color = m_covers[i].targetColor; + } + if (m_covers[i].shadowColor != m_covers[i].targetShadowColor) + { + CColor c(m_covers[i].shadowColor); + m_covers[i].shadowColor = CColor::interpolate(c, m_covers[i].targetShadowColor, 0x20); + if (m_covers[i].shadowColor == c) // If the interpolation doesn't do anything because of numerical approximation, force the target color + m_covers[i].shadowColor = m_covers[i].targetShadowColor; + } + m_covers[i].txtAngle += (m_covers[i].txtTargetAngle - m_covers[i].txtAngle) * speed; + m_covers[i].txtPos += (m_covers[i].txtTargetPos - m_covers[i].txtPos) * speed; + int colorDist = (int)m_covers[i].txtTargetColor - (int)m_covers[i].txtColor; + m_covers[i].txtColor += abs(colorDist) >= 8 ? (u8)(colorDist / 8) : (u8)colorDist; + m_covers[i].title.tick(); +} + +void CCoverFlow::_unselect(void) +{ + if (m_selected) + { + m_cameraPos += _cameraMoves(); + m_covers[m_range / 2].angle += _coverMovesA(); + m_covers[m_range / 2].pos += _coverMovesP(); + m_selected = false; + m_covers[m_range / 2].angle -= _coverMovesA(); + m_covers[m_range / 2].pos -= _coverMovesP(); + m_cameraPos -= _cameraMoves(); + m_targetCameraPos = m_loNormal.camera; + m_targetCameraAim = m_loNormal.cameraAim; + } +} + +void CCoverFlow::_jump(void) +{ + int step, delay = 2; + + if (m_rows >= 3) + step = (u32)abs(m_jump) <= (m_rows - 2) / 2 ? 1 : m_rows - 2; + else + // Cheat and skip covers we wouldn't see anyway + // This means the jump shouldn't be modified before it's done completely + step = (u32)abs(m_jump) > m_range + 1 ? abs(m_jump) - (m_range + 1) : 1; + if (m_jump < 0) + { + _left(delay, step); + m_jump += step; + } + else if (m_jump > 0) + { + _right(delay, step); + m_jump -= step; + } +} + +void CCoverFlow::tick(void) +{ + if (m_covers.empty()) return; + + LockMutex lock(m_mutex); + ++m_tickCount; + if (m_delay > 0) + --m_delay; + else + _jump(); + for (u32 i = 0; i < m_range; ++i) + _coverTick(i); + m_cameraPos += (m_targetCameraPos - m_cameraPos) * 0.2f; + m_cameraAim += (m_targetCameraAim - m_cameraAim) * 0.2f; +} + +struct SWFCHeader +{ + u8 newFmt : 1; // Was 0 in beta + u8 full : 1; + u8 cmpr : 1; + u8 zipped : 1; + u8 backCover : 1; + u16 width; + u16 height; + u8 maxLOD; + u16 backWidth; + u16 backHeight; + u8 backMaxLOD; +public: + u32 getWidth(void) const { return width * 4; } + u32 getHeight(void) const { return height * 4; } + u32 getBackWidth(void) const { return backWidth * 4; } + u32 getBackHeight(void) const { return backHeight * 4; } + SWFCHeader(void) + { + memset(this, 0, sizeof *this); + } + SWFCHeader(const STexture &tex, bool f, bool z, const STexture &backTex = STexture()) + { + newFmt = 1; + full = f ? 1 : 0; + cmpr = tex.format == GX_TF_CMPR ? 1 : 0; + zipped = z ? 1 : 0; + width = tex.width / 4; + height = tex.height / 4; + maxLOD = tex.maxLOD; + backCover = !!backTex.data ? 1 : 0; + backWidth = backTex.width / 4; + backHeight = backTex.height / 4; + backMaxLOD = backTex.maxLOD; + } +}; + +bool CCoverFlow::preCacheCover(const char *id, const u8 *png, bool full) +{ + if (m_cachePath.empty()) return false; + + STexture tex; + u8 textureFmt = m_compressTextures ? GX_TF_CMPR : GX_TF_RGB565; + + if (STexture::TE_OK != tex.fromPNG(png, textureFmt, ALLOC_MEM2, 32)) return false; + + u32 bufSize = fixGX_GetTexBufferSize(tex.width, tex.height, tex.format, tex.maxLOD > 0 ? GX_TRUE : GX_FALSE, tex.maxLOD); + uLongf zBufferSize = m_compressCache ? bufSize + bufSize / 100 + 12 : bufSize; + SmartBuf zBuffer = m_compressCache ? smartMem2Alloc(zBufferSize) : tex.data; + if (!!zBuffer && (!m_compressCache || compress(zBuffer.get(), &zBufferSize, tex.data.get(), bufSize) == Z_OK)) + { + FILE *file = fopen(sfmt("%s/%s.wfc", m_cachePath.c_str(), id).c_str(), "wb"); + if (file != 0) + { + SWFCHeader header(tex, full, m_compressCache); + fwrite(&header, 1, sizeof header, file); + fwrite(zBuffer.get(), 1, zBufferSize, file); + SAFE_CLOSE(file); + } + } + + return true; +} + +bool CCoverFlow::fullCoverCached(const char *id) +{ + bool found = false; + + FILE *file = fopen(sfmt("%s/%s.wfc", m_cachePath.c_str(), id).c_str(), "rb"); + if (file != 0) + { + SWFCHeader header; + found = fread(&header, 1, sizeof header, file) == sizeof header + && header.full != 0 && m_compressTextures == (header.cmpr != 0) + && header.getWidth() >= 8 && header.getHeight() >= 8 + && header.getWidth() <= 1024 && header.getHeight() <= 1024; + SAFE_CLOSE(file); + } + return found; +} + +bool CCoverFlow::_loadCoverTexPNG(u32 i, bool box, bool hq) +{ + if (!m_loadingCovers) return false; + + u8 textureFmt = m_compressTextures ? GX_TF_CMPR : GX_TF_RGB565; + STexture tex; + + const char *path = box ? m_items[i].boxPicPath.c_str() : m_items[i].picPath.c_str(); + if (STexture::TE_OK != tex.fromPNGFile(path, textureFmt, ALLOC_MEM2, 32)) return false; + + if (!m_loadingCovers) return false; + + LWP_MutexLock(m_mutex); + m_items[i].texture = tex; + m_items[i].boxTexture = box; + m_items[i].state = CCoverFlow::STATE_Ready; + LWP_MutexUnlock(m_mutex); + + // Save the texture to the cache folder for the next time + if (!m_cachePath.empty()) + { + u32 bufSize = fixGX_GetTexBufferSize(tex.width, tex.height, tex.format, tex.maxLOD > 0 ? GX_TRUE : GX_FALSE, tex.maxLOD); + uLongf zBufferSize = m_compressCache ? bufSize + bufSize / 100 + 12 : bufSize; + SmartBuf zBuffer = m_compressCache ? smartMem2Alloc(zBufferSize) : tex.data; + if (!!zBuffer && (!m_compressCache || compress(zBuffer.get(), &zBufferSize, tex.data.get(), bufSize) == Z_OK)) + { + FILE *file = fopen(sfmt("%s/%s.wfc", m_cachePath.c_str(), m_items[i].hdr->hdr.id).c_str(), "wb"); + if (file != 0) + { + SWFCHeader header(tex, box, m_compressCache); + fwrite(&header, 1, sizeof header, file); + fwrite(zBuffer.get(), 1, zBufferSize, file); + SAFE_CLOSE(file); + if (m_deletePicsAfterCaching) + remove(path); + } + } + } + if (!hq) _dropHQLOD(i); + + return true; +} + +bool CCoverFlow::_calcTexLQLOD(STexture &tex) +{ + bool done = false; + + while (tex.width > 512 && tex.height > 512 && tex.maxLOD > 0) + { + --tex.maxLOD; + tex.width >>= 1; + tex.height >>= 1; + done = true; + } + return done; +} + +void CCoverFlow::_dropHQLOD(int i) +{ + if ((u32)i >= m_items.size()) return; + + LockMutex lock(m_mutex); + + STexture &prevTex = m_items[i].texture; + STexture newTex; + + newTex.maxLOD = prevTex.maxLOD; + newTex.width = prevTex.width; + newTex.height = prevTex.height; + newTex.format = prevTex.format; + + if (!CCoverFlow::_calcTexLQLOD(newTex)) return; + + u32 prevTexLen = fixGX_GetTexBufferSize(prevTex.width, prevTex.height, prevTex.format, prevTex.maxLOD > 0 ? GX_TRUE : GX_FALSE, prevTex.maxLOD); + u32 newTexLen = fixGX_GetTexBufferSize(newTex.width, newTex.height, newTex.format, newTex.maxLOD > 0 ? GX_TRUE : GX_FALSE, newTex.maxLOD); + newTex.data = smartMem2Alloc(newTexLen); + if (!newTex.data) return; + if (!prevTex.data) return; + memcpy(newTex.data.get(), prevTex.data.get() + (prevTexLen - newTexLen), newTexLen); + DCFlushRange(newTex.data.get(), newTexLen); + prevTex = newTex; +} + +CCoverFlow::CLRet CCoverFlow::_loadCoverTex(u32 i, bool box, bool hq) +{ + if (!m_loadingCovers) return CL_ERROR; + + bool allocFailed = false; + + // Try to find the texture in the cache + if (!m_cachePath.empty()) + { + FILE *file = fopen(sfmt("%s/%s.wfc", m_cachePath.c_str(), m_items[i].hdr->hdr.id).c_str(), "rb"); + if (file != 0) + { + bool success = false; + fseek(file, 0, SEEK_END); + u32 fileSize = ftell(file); + SWFCHeader header; + if (fileSize > sizeof header) + { + fseek(file, 0, SEEK_SET); + fread(&header, 1, sizeof header, file); + // Try to find a matching cache file, otherwise try the PNG file, otherwise try again with the cache file with less constraints + if (header.newFmt != 0 && (((!box || header.full != 0) && (header.cmpr != 0) == m_compressTextures) || (!_loadCoverTexPNG(i, box, hq)))) + { + STexture tex; + tex.format = header.cmpr != 0 ? GX_TF_CMPR : GX_TF_RGB565; + tex.width = header.getWidth(); + tex.height = header.getHeight(); + tex.maxLOD = header.maxLOD; + + u32 bufSize = fixGX_GetTexBufferSize(tex.width, tex.height, tex.format, tex.maxLOD > 0 ? GX_TRUE : GX_FALSE, tex.maxLOD); + if (!hq) CCoverFlow::_calcTexLQLOD(tex); + u32 texLen = fixGX_GetTexBufferSize(tex.width, tex.height, tex.format, tex.maxLOD > 0 ? GX_TRUE : GX_FALSE, tex.maxLOD); + + tex.data = smartMem2Alloc(texLen); + SmartBuf ptrTex = (header.zipped != 0) ? smartMem2Alloc(bufSize) : tex.data; + + if (!ptrTex || !tex.data) + allocFailed = true; + else + { + SmartBuf zBuffer = (header.zipped != 0) ? smartMem2Alloc(fileSize - sizeof header) : ptrTex; + if (!!zBuffer && ((header.zipped != 0) || fileSize - sizeof header == bufSize)) + { + if (header.zipped == 0) + { + fseek(file, fileSize - sizeof header - texLen, SEEK_CUR); + fread(tex.data.get(), 1, texLen, file); + } + else + fread(zBuffer.get(), 1, fileSize - sizeof header, file); + uLongf size = bufSize; + if (header.zipped == 0 || (uncompress(ptrTex.get(), &size, zBuffer.get(), fileSize - sizeof header) == Z_OK && size == bufSize)) + { + if (header.zipped != 0) memcpy(tex.data.get(), ptrTex.get() + bufSize - texLen, texLen); + LockMutex lock(m_mutex); + m_items[i].texture = tex; + DCFlushRange(tex.data.get(), texLen); + m_items[i].state = CCoverFlow::STATE_Ready; + m_items[i].boxTexture = header.full != 0; + success = true; + } + } + } + } + } + // + SAFE_CLOSE(file); + if (success) return CCoverFlow::CL_OK; + } + } + if (allocFailed) return CCoverFlow::CL_NOMEM; + + // If not found, load the PNG + return _loadCoverTexPNG(i, box, hq) ? CCoverFlow::CL_OK : CCoverFlow::CL_ERROR; +} + +int CCoverFlow::_coverLoader(CCoverFlow *cf) +{ + bool box = cf->m_box; + CCoverFlow::CLRet ret; + u32 bufferSize = cf->m_range + cf->m_numBufCovers * 2; + + while (cf->m_loadingCovers) + { + u32 i; + ret = CCoverFlow::CL_OK; + cf->m_moved = false; + u32 numItems = cf->m_items.size(); + u32 firstItem = cf->m_covers[cf->m_range / 2].index; + u32 lastVisible = bufferSize - 1; + int newHQCover = firstItem; + if ((u32)cf->m_hqCover < numItems && newHQCover != cf->m_hqCover) + { + cf->_dropHQLOD(cf->m_hqCover); + cf->m_hqCover = -1; + } + for (u32 j = numItems - 1; j > lastVisible; --j) + { + i = loopNum((j & 1) != 0 ? firstItem - (j + 1) / 2 : firstItem + j / 2, numItems); + LWP_MutexLock(cf->m_mutex); + SMART_FREE(cf->m_items[i].texture.data); + cf->m_items[i].state = CCoverFlow::STATE_Loading; + LWP_MutexUnlock(cf->m_mutex); + } + for (u32 j = 0; j <= lastVisible; ++j) + { + if (!cf->m_loadingCovers || cf->m_moved || ret == CCoverFlow::CL_NOMEM) + break; + i = loopNum((j & 1) != 0 ? firstItem - (j + 1) / 2 : firstItem + j / 2, numItems); + if (cf->m_items[i].state != CCoverFlow::STATE_Loading && (i != (u32)newHQCover || newHQCover == cf->m_hqCover)) + continue; + cf->m_hqCover = newHQCover; + ret = cf->_loadCoverTex(i, box, i == (u32)newHQCover); + if (ret == CCoverFlow::CL_ERROR) + { + ret = cf->_loadCoverTex(i, !box, i == (u32)newHQCover); + if (ret == CCoverFlow::CL_ERROR && cf->m_loadingCovers) + cf->m_items[i].state = CCoverFlow::STATE_NoCover; + } + } + if (ret == CCoverFlow::CL_NOMEM && bufferSize > 3) + bufferSize -= 2; + } + return 0; +} diff --git a/source/gui/coverflow.hpp b/source/gui/coverflow.hpp new file mode 100644 index 00000000..bfe7b7ce --- /dev/null +++ b/source/gui/coverflow.hpp @@ -0,0 +1,343 @@ +// Coverflow + +#ifndef __COVERFLOW_HPP +#define __COVERFLOW_HPP + +#include +#include +#include +#include "safe_vector.hpp" + +#include +#include + +#include "video.hpp" +#include "smartptr.hpp" +#include "FreeTypeGX.h" +#include "text.hpp" +#include "config.hpp" +#include "gui_sound.h" +#include "disc.h" +#include "utils.h" + +enum Sorting +{ + SORT_ALPHA, + SORT_GAMEID, + SORT_PLAYCOUNT, + SORT_LASTPLAYED, + SORT_WIFIPLAYERS, + SORT_PLAYERS, + SORT_MAX, + SORT_ESRB, + SORT_CONTROLLERS, +}; + +class CCoverFlow +{ +public: + CCoverFlow(void); + ~CCoverFlow(void); + // + bool init(const SmartBuf &font, u32 font_size); + // Cover list management + void clear(void); + void reserve(u32 capacity); + void addItem(dir_discHdr *hdr, const char *picPath, const char *boxPicPath, int playcount = 0, unsigned int lastPlayed = 0); + bool empty(void) const { return m_items.empty(); } + // + bool start(const char *id = 0); + void stopCoverLoader(bool empty = false); + void startCoverLoader(void); + // + void simulateOtherScreenFormat(bool s); + // Commands + void tick(void); + bool findId(const char *id, bool instant = false); + void pageUp(void); + void pageDown(void); + void nextLetter(wchar_t *c); + void prevLetter(wchar_t *c); + void nextPlayers(bool wifi, wchar_t *c); + void prevPlayers(bool wifi, wchar_t *c); + void nextID(wchar_t *c); + void prevID(wchar_t *c); + void left(void); + void right(void); + void up(void); + void down(void); + bool select(void); + void flip(bool force = false, bool f = true); + void cancel(void); + bool selected(void) const { return m_selected; } + void makeEffectTexture(CVideo &vid, const STexture &bg); + void drawText(bool withRectangle = false); + void draw(void); + void drawEffect(void); + void hideCover(void); + void showCover(void); + void mouse(CVideo &vid, int chan, int x, int y); + bool mouseOver(CVideo &vid, int x, int y); + // Accessors for settings + void setCompression(bool enable) { m_compressTextures = enable; } + bool getBoxMode(void) const { return m_box;} + void setBufferSize(u32 numCovers); + void setTextures(const std::string &loadingPic, const std::string &loadingPicFlat, const std::string &noCoverPic, const std::string &noCoverPicFlat); + void setFont(SFont font, const CColor &color); + void setRange(u32 rows, u32 columns); + void setBoxMode(bool box); + void setTextureQuality(float lodBias, int aniso, bool edgeLOD); + void setCameraPos(bool selected, const Vector3D &pos, const Vector3D &aim); + void setCameraOsc(bool selected, const Vector3D &speed, const Vector3D &); + void setCoverScale(bool selected, const Vector3D &left, const Vector3D &right, const Vector3D ¢er, const Vector3D &rowCenter); + void setCoverPos(bool selected, const Vector3D &left, const Vector3D &right, const Vector3D ¢er, const Vector3D &rowCenter); + void setCoverAngleOsc(bool selected, const Vector3D &speed, const Vector3D &); + void setCoverPosOsc(bool selected, const Vector3D &speed, const Vector3D &); + void setSpacers(bool selected, const Vector3D &left, const Vector3D &right); + void setDeltaAngles(bool selected, const Vector3D &left, const Vector3D &right); + void setAngles(bool selected, const Vector3D &left, const Vector3D &right, const Vector3D ¢er, const Vector3D &rowCenter); + void setTitleAngles(bool selected, float left, float right, float center); + void setTitlePos(bool selected, const Vector3D &left, const Vector3D &right, const Vector3D ¢er); + void setTitleWidth(bool selected, float side, float center); + void setTitleStyle(bool selected, u16 side, u16 center); + void setColors(bool selected, const CColor &begColor, const CColor &endColor, const CColor &offColor); + void setFanartPlaying(const bool isPlaying); + void setFanartTextColor(const CColor textColor); + void setShadowColors(bool selected, const CColor ¢erColor, const CColor &begColor, const CColor &endColor, const CColor &offColor); + void setShadowPos(float scale, float x, float y); + void setMirrorAlpha(float cover, float title); + void setMirrorBlur(bool blur); + void setRowSpacers(bool selected, const Vector3D &top, const Vector3D &bottom); + void setRowDeltaAngles(bool selected, const Vector3D &top, const Vector3D &bottom); + void setRowAngles(bool selected, const Vector3D &top, const Vector3D &bottom); + void setCoverFlipping(const Vector3D &pos, const Vector3D &angle, const Vector3D &scale); + void setBlur(u32 blurResolution, u32 blurRadius, float blurFactor); + bool setSorting(Sorting sorting); + // + void setSounds(const SmartGuiSound &sound, const SmartGuiSound &hoverSound, const SmartGuiSound &selectSound, const SmartGuiSound &cancelSound); + void setSoundVolume(u8 vol); + void stopSound(void); + // + void applySettings(void); + void setCachePath(const char *path, bool deleteSource, bool compress); + bool fullCoverCached(const char *id); + bool preCacheCover(const char *id, const u8 *png, bool full); + // + std::string getId(void) const; + std::string getNextId(void) const; + dir_discHdr * getHdr(void) const; + dir_discHdr * getNextHdr(void) const; + wstringEx getTitle(void) const; + u64 getChanTitle(void) const; +private: + enum DrawMode { CFDR_NORMAL, CFDR_STENCIL, CFDR_SHADOW }; + struct SLayout + { + Vector3D camera; + Vector3D cameraAim; + Vector3D leftScale; + Vector3D rightScale; + Vector3D centerScale; + Vector3D rowCenterScale; + Vector3D leftPos; + Vector3D rightPos; + Vector3D centerPos; + Vector3D rowCenterPos; + Vector3D leftAngle; + Vector3D rightAngle; + Vector3D centerAngle; + Vector3D rowCenterAngle; + Vector3D leftSpacer; + Vector3D rightSpacer; + Vector3D leftDeltaAngle; + Vector3D rightDeltaAngle; + float txtLeftAngle; + float txtRightAngle; + float txtCenterAngle; + Vector3D txtLeftPos; + Vector3D txtRightPos; + Vector3D txtCenterPos; + float txtSideWidth; + float txtCenterWidth; + u16 txtSideStyle; + u16 txtCenterStyle; + Vector3D cameraOscSpeed; + Vector3D cameraOscAmp; + Vector3D coverOscASpeed; + Vector3D coverOscAAmp; + Vector3D coverOscPSpeed; + Vector3D coverOscPAmp; + CColor begColor; + CColor endColor; + CColor mouseOffColor; + CColor shadowColorCenter; + CColor shadowColorEnd; + CColor shadowColorBeg; + CColor shadowColorOff; + Vector3D topSpacer; + Vector3D bottomSpacer; + Vector3D topAngle; + Vector3D bottomAngle; + Vector3D topDeltaAngle; + Vector3D bottomDeltaAngle; + }; + enum TexState { STATE_Loading, STATE_Ready, STATE_NoCover }; + struct CItem + { + dir_discHdr *hdr; + std::string picPath; + std::string boxPicPath; + int playcount; + unsigned int lastPlayed; + STexture texture; + volatile bool boxTexture; + volatile enum TexState state; + // + CItem(dir_discHdr *itemHdr, const char *itemPic, const char *itemBoxPic, int playcount, unsigned int lastPlayed); + }; + struct CCover + { + u32 index; + Vector3D scale; + Vector3D targetScale; + Vector3D angle; + Vector3D targetAngle; + Vector3D pos; + Vector3D targetPos; + CColor color; + CColor targetColor; + float txtAngle; + float txtTargetAngle; + Vector3D txtPos; + Vector3D txtTargetPos; + u8 txtColor; + u8 txtTargetColor; + CText title; + CColor shadowColor; + CColor targetShadowColor; + // + CCover(void); + }; + enum CLRet { CL_OK, CL_ERROR, CL_NOMEM }; +private: + Mtx m_projMtx; + Mtx m_viewMtx; + Vector3D m_cameraPos; + Vector3D m_cameraAim; + Vector3D m_targetCameraPos; + Vector3D m_targetCameraAim; + safe_vector m_items; + safe_vector m_covers; + int m_delay; + int m_minDelay; + int m_jump; + mutex_t m_mutex; + volatile bool m_loadingCovers; + volatile bool m_moved; + volatile int m_hqCover; + bool m_selected; + int m_tickCount; + STexture m_loadingTexture; + STexture m_noCoverTexture; + STexture m_dvdSkin; + STexture m_dvdSkin_Red; + STexture m_dvdSkin_Black; + // Settings + std::string m_pngLoadCover; + std::string m_pngLoadCoverFlat; + std::string m_pngNoCover; + std::string m_pngNoCoverFlat; + u32 m_numBufCovers; + SFont m_font; + CColor m_fontColor; + CColor m_fanartFontColor; + bool m_fanartPlaying; + bool m_box; + u32 m_range; + u32 m_rows; + u32 m_columns; + SLayout m_loNormal; + SLayout m_loSelected; + int m_mouse[WPAD_MAX_WIIMOTES]; + bool m_hideCover; + bool m_compressTextures; + bool m_compressCache; + std::string m_cachePath; + bool m_deletePicsAfterCaching; + bool m_mirrorBlur; + float m_mirrorAlpha; + float m_txtMirrorAlpha; + float m_shadowScale; + float m_shadowX; + float m_shadowY; + STexture m_effectTex; + u32 m_blurRadius; + float m_blurFactor; + Vector3D m_flipCoverPos; + Vector3D m_flipCoverAngle; + Vector3D m_flipCoverScale; + u8 sndCopyNum; + SmartGuiSound m_sound[4]; + SmartGuiSound m_hoverSound; + SmartGuiSound m_selectSound; + SmartGuiSound m_cancelSound; + u8 m_soundVolume; + float m_lodBias; + u8 m_aniso; + bool m_edgeLOD; + Sorting m_sorting; +private: + void _draw(DrawMode dm = CFDR_NORMAL, bool mirror = false, bool blend = true); + u32 _currentPos(void) const; + void _effectBg(const STexture &tex); + void _effectBlur(CVideo &vid, bool vertical); + bool _effectVisible(void); + void _drawMirrorZ(void); + void _drawTitle(int i, bool mirror, bool rectangle); + void _drawCover(int i, bool mirror, CCoverFlow::DrawMode dm); + void _drawCoverFlat(int i, bool mirror, CCoverFlow::DrawMode dm); + void _drawCoverBox(int i, bool mirror, CCoverFlow::DrawMode dm); + void _updateTarget(int i, bool instant = false); + void _updateAllTargets(bool instant = false); + void _loadCover(int i, int item); + void _loadCoverTexture(int i); + void _coverTick(int i); + void _unselect(void); + Vector3D _cameraMoves(void); + Vector3D _coverMovesA(void); + Vector3D _coverMovesP(void); + STexture &_coverTexture(int i); + void _left(int repeatDelay, u32 step); + void _right(int repeatDelay, u32 step); + void _jump(void); + void _completeJump(void); + void _setJump(int j); + void _loadAllCovers(int i); + static bool _calcTexLQLOD(STexture &tex); + void _dropHQLOD(int i); + bool _loadCoverTexPNG(u32 i, bool box, bool hq); + CLRet _loadCoverTex(u32 i, bool box, bool hq); + bool _invisibleCover(u32 x, u32 y); + void _instantTarget(int i); + void _transposeCover(safe_vector &dst, u32 rows, u32 columns, int pos); + void _playSound(void); + + void _stopSound(SmartGuiSound snd); + void _playSound(SmartGuiSound snd); + + static bool _sortByPlayCount(CItem item1, CItem item2); + static bool _sortByLastPlayed(CItem item1, CItem item2); + static bool _sortByGameID(CItem item1, CItem item2); + static bool _sortByAlpha(CItem item1, CItem item2); + static bool _sortByPlayers(CItem item1, CItem item2); + static bool _sortByWifiPlayers(CItem item1, CItem item2); + +private: + static int _coverLoader(CCoverFlow *cf); + static float _step(float cur, float tgt, float spd); +private: + CCoverFlow(const CCoverFlow &); + CCoverFlow &operator=(const CCoverFlow &); +}; + +#endif // !defined(__COVERFLOW_HPP) diff --git a/source/gui/cursor.cpp b/source/gui/cursor.cpp new file mode 100644 index 00000000..bd1394fe --- /dev/null +++ b/source/gui/cursor.cpp @@ -0,0 +1,218 @@ + +#include "cursor.hpp" +#include "pngu.h" + +#include + +using namespace std; + +extern const u8 player1_point_png[]; +extern const u8 player2_point_png[]; +extern const u8 player3_point_png[]; +extern const u8 player4_point_png[]; + +static inline u32 coordsI8(u32 x, u32 y, u32 w) +{ + return (((y >> 2) * (w >> 3) + (x >> 3)) << 5) + ((y & 3) << 3) + (x & 7); +} + +static inline u32 coordsRGBA8(u32 x, u32 y, u32 w) +{ + return ((((y >> 2) * (w >> 2) + (x >> 2)) << 5) + ((y & 3) << 2) + (x & 3)) << 1; +} + +bool CCursor::init(const char *png, bool wideFix, CColor shadowColor, float shadowX, float shadowY, bool blur, int chan) +{ + bool ok = true; + bool shadow = shadowColor.a > 0; + + m_wideFix = wideFix; + m_x = -1; + m_y = -1; + if (STexture::TE_OK != m_texture.fromPNGFile(png, GX_TF_RGBA8)) + { + if (chan == 0) + ok = STexture::TE_OK == m_texture.fromPNG(player1_point_png, GX_TF_RGBA8); + else if (chan == 1) + ok = STexture::TE_OK == m_texture.fromPNG(player2_point_png, GX_TF_RGBA8); + else if (chan == 2) + ok = STexture::TE_OK == m_texture.fromPNG(player3_point_png, GX_TF_RGBA8); + else if (chan == 3) + ok = STexture::TE_OK == m_texture.fromPNG(player4_point_png, GX_TF_RGBA8); + } + if (ok && shadow) + { + m_shadowColor = shadowColor; + m_shadowX = shadowX; + m_shadowY = shadowY; + m_shadow.width = m_texture.width; + m_shadow.height = m_texture.height; + m_shadow.maxLOD = 0; + m_shadow.format = GX_TF_I8; + m_shadow.data = smartMem2Alloc(GX_GetTexBufferSize(m_shadow.width, m_shadow.height, m_shadow.format, GX_FALSE, 0)); + if (!!m_shadow.data) + { + const u8 *src = m_texture.data.get(); + u8 *dst = m_shadow.data.get(); + u32 w = m_shadow.width; + for (u32 yy = 0; yy < m_shadow.height; ++yy) + for (u32 xx = 0; xx < m_shadow.width; ++xx) + dst[coordsI8(xx, yy, w)] = src[coordsRGBA8(xx, yy, w)]; + + if (blur) _blur(); + } + } + return ok; +} + +void CCursor::draw(int x, int y, float a) +{ + GXTexObj texObj; + float w = (float)m_texture.width * 0.5f; + float h = (float)m_texture.height * 0.5f; + Mtx modelViewMtx; + Vector3D v; + float xScale = m_wideFix ? 0.75f : 1.f; + + m_x = x - m_texture.width / 2; + m_y = y - m_texture.height / 2; + // + GX_SetNumChans(1); + GX_ClearVtxDesc(); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_CLR0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_CLR0, GX_CLR_RGBA, GX_RGBA8, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetNumTexGens(1); + GX_SetTevOp(GX_TEVSTAGE0, GX_MODULATE); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLOR0A0); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetBlendMode(GX_BM_BLEND, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + GX_SetAlphaUpdate(GX_TRUE); + GX_SetCullMode(GX_CULL_NONE); + GX_SetZMode(GX_DISABLE, GX_LEQUAL, GX_TRUE); + // Shadow + if (!!m_shadow.data) + { + guMtxIdentity(modelViewMtx); + guMtxTransApply(modelViewMtx, modelViewMtx, (float)x - w + m_shadowX * xScale, (float)y - h + m_shadowY, 0.f); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + GX_InitTexObj(&texObj, m_shadow.data.get(), m_shadow.width, m_shadow.height, m_shadow.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + v = Vector3D(w, h, 0.f).rotateZ(a); + GX_Position3f32(v.x * xScale, v.y, v.z); + GX_Color4u8(m_shadowColor.r, m_shadowColor.g, m_shadowColor.b, m_shadowColor.a); + GX_TexCoord2f32(1.f, 1.f); + v = Vector3D(-w, h, 0.f).rotateZ(a); + GX_Position3f32(v.x * xScale, v.y, v.z); + GX_Color4u8(m_shadowColor.r, m_shadowColor.g, m_shadowColor.b, m_shadowColor.a); + GX_TexCoord2f32(0.f, 1.f); + v = Vector3D(-w, -h, 0.f).rotateZ(a); + GX_Position3f32(v.x * xScale, v.y, v.z); + GX_Color4u8(m_shadowColor.r, m_shadowColor.g, m_shadowColor.b, m_shadowColor.a); + GX_TexCoord2f32(0.f, 0.f); + v = Vector3D(w, -h, 0.f).rotateZ(a); + GX_Position3f32(v.x * xScale, v.y, v.z); + GX_Color4u8(m_shadowColor.r, m_shadowColor.g, m_shadowColor.b, m_shadowColor.a); + GX_TexCoord2f32(1.f, 0.f); + GX_End(); + } + // + guMtxIdentity(modelViewMtx); + guMtxTransApply(modelViewMtx, modelViewMtx, (float)x - w, (float)y - h, 0.f); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + GX_InitTexObj(&texObj, m_texture.data.get(), m_texture.width, m_texture.height, m_texture.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + v = Vector3D(w, h, 0.f).rotateZ(a); + GX_Position3f32(v.x * xScale, v.y, v.z); + GX_Color4u8(0xFF, 0xFF, 0xFF, 0xFF); + GX_TexCoord2f32(1.f, 1.f); + v = Vector3D(-w, h, 0.f).rotateZ(a); + GX_Position3f32(v.x * xScale, v.y, v.z); + GX_Color4u8(0xFF, 0xFF, 0xFF, 0xFF); + GX_TexCoord2f32(0.f, 1.f); + v = Vector3D(-w, -h, 0.f).rotateZ(a); + GX_Position3f32(v.x * xScale, v.y, v.z); + GX_Color4u8(0xFF, 0xFF, 0xFF, 0xFF); + GX_TexCoord2f32(0.f, 0.f); + v = Vector3D(w, -h, 0.f).rotateZ(a); + GX_Position3f32(v.x * xScale, v.y, v.z); + GX_Color4u8(0xFF, 0xFF, 0xFF, 0xFF); + GX_TexCoord2f32(1.f, 0.f); + GX_End(); +} + +void CCursor::_blur(void) +{ + int radius = 3; + int w = m_shadow.width; + int h = m_shadow.height; + int div = 2 * radius + 1; + u8 *r = 0; + u8 *pic = m_shadow.data.get(); + int sum; + int yp; + int yi; + int pass = 2; + SmartBuf xMinBuf = smartMem2Alloc(w * sizeof (int)); + SmartBuf xMaxBuf = smartMem2Alloc(w * sizeof (int)); + SmartBuf yMinBuf = smartMem2Alloc(h * sizeof (int)); + SmartBuf yMaxBuf = smartMem2Alloc(h * sizeof (int)); + SmartBuf buf = smartMem2Alloc(m_shadow.width * m_shadow.height); + if (!xMinBuf || !xMaxBuf || !yMinBuf || !yMaxBuf || !buf) + return; + int *xmin = (int *)xMinBuf.get(); + int *xmax = (int *)xMaxBuf.get(); + int *ymin = (int *)yMinBuf.get(); + int *ymax = (int *)yMaxBuf.get(); + r = buf.get(); + for (int i = 0; i < w; ++i) + { + xmax[i] = min(i + radius + 1, w - 1); + xmin[i] = max(i - radius, 0); + } + for (int i = 0; i < h; ++i) + { + ymax[i] = min(i + radius + 1, h - 1) * w; + ymin[i] = max(i - radius, 0) * w; + } + for (int k = 0; k < pass; ++k) // 2 passes for much better quality + { + yi = 0; + for (int y = 0; y < h; ++y) + { + sum = 0; + for (int i = -radius; i <= radius; ++i) + sum += pic[coordsI8(min(max(0, i), w - 1), y, w)]; + for (int x = 0; x < w; ++x) + { + r[yi] = sum / div; + sum += pic[coordsI8(xmax[x], y, w)]; + sum -= pic[coordsI8(xmin[x], y, w)]; + ++yi; + } + } + for (int x = 0; x < w; ++x) + { + sum = 0; + yp = -radius * w; + for (int i = -radius; i <= radius; ++i) + { + yi = max(0, yp) + x; + sum += r[yi]; + yp += w; + } + yi = x; + for (int y = 0; y < h; ++y) + { + pic[coordsI8(x, y, w)] = sum / div; + sum += r[x + ymax[y]] - r[x + ymin[y]]; + yi += w; + } + } + } +} diff --git a/source/gui/cursor.hpp b/source/gui/cursor.hpp new file mode 100644 index 00000000..4a0f2a28 --- /dev/null +++ b/source/gui/cursor.hpp @@ -0,0 +1,31 @@ + +#ifndef __CURSOR_HPP +#define __CURSOR_HPP + +#include "video.hpp" + +class CCursor +{ +public: + bool init(const char *png, bool wideFix, CColor shadowColor, float shadowX, float shadowY, bool blur, int chan); + void draw(int x, int y, float a); + u32 width(void) const { return m_texture.height; } + u32 height(void) const { return m_texture.width; } + int x(void) const { return m_x; } + int y(void) const { return m_y; } +private: + STexture m_texture; + STexture m_shadow; + Mtx m_projMtx; + Mtx m_viewMtx; + int m_x; + int m_y; + bool m_wideFix; + float m_shadowX; + float m_shadowY; + CColor m_shadowColor; +private: + void _blur(void); +}; + +#endif // !defined()__CURSOR_HPP diff --git a/source/gui/fanart.cpp b/source/gui/fanart.cpp new file mode 100644 index 00000000..34c9a0d4 --- /dev/null +++ b/source/gui/fanart.cpp @@ -0,0 +1,301 @@ +#include "fanart.hpp" +#include "pngu.h" +#include "boxmesh.hpp" +#include "text.hpp" +#include "gecko.h" + +using namespace std; + +static guVector _GRRaxisx = (guVector){1, 0, 0}; // DO NOT MODIFY!!! +static guVector _GRRaxisy = (guVector){0, 1, 0}; // Even at runtime +static guVector _GRRaxisz = (guVector){0, 0, 1}; // NOT ever! + +CFanart::CFanart(void) + : m_animationComplete(false), m_loaded(false), m_cfg(), m_bg(), m_bglq() +{ +} + +CFanart::~CFanart(void) +{ +} + +void CFanart::unload() +{ + m_cfg.unload(); + m_loaded = false; + m_elms.clear(); +} + +bool CFanart::load(Config &m_globalConfig, const char *path, const char *id) +{ + bool retval = false; + + if (!m_globalConfig.getBool("FANART", "enable_fanart", true)) + return retval; + + unload(); + + const char *dir = fmt("%s/%s", path, id); + STexture fanBg, fanBgLq; + + STexture::TexErr texErr = fanBg.fromPNGFile(sfmt("%s/background.png", dir).c_str(), GX_TF_RGBA8); + if (texErr == STexture::TE_ERROR) + { + dir = fmt("%s/%.3s", path, id); + texErr = fanBg.fromPNGFile(sfmt("%s/background.png", dir).c_str(), GX_TF_RGBA8); + } + + if (texErr == STexture::TE_OK) + { + m_cfg.load(sfmt("%s/%s.ini", dir, id).c_str()); + if (!m_cfg.loaded()) m_cfg.load(sfmt("%s/%.3s.ini", dir, id).c_str()); + + fanBgLq.fromPNGFile(sfmt("%s/background_lq.png", dir).c_str(), GX_TF_RGBA8); + + for (int i = 1; i <= 6; i++) + { + CFanartElement elm(m_cfg, dir, i); + if (elm.IsValid()) m_elms.push_back(elm); + } + + m_loaded = true; + retval = true; + m_defaultDelay = m_globalConfig.getInt("FANART", "delay_after_animation", 200); + m_delayAfterAnimation = m_cfg.getInt("GENERAL", "delay_after_animation", m_defaultDelay); + m_allowArtworkOnTop = m_globalConfig.getBool("FANART", "allow_artwork_on_top", true); + m_globalHideCover = m_globalConfig.getOptBool("FANART", "hidecover", 2); // 0 is false, 1 is true, 2 is default + m_globalShowCoverAfterAnimation = m_globalConfig.getOptBool("FANART", "show_cover_after_animation", 2); + } + + m_bg = fanBg; + m_bglq = fanBgLq; + + return retval; +} + +void CFanart::getBackground(STexture &hq, STexture &lq) +{ + if (m_loaded) + { + hq = m_bg; + lq = m_bglq; + } +} + +CColor CFanart::getTextColor(CColor themeTxtColor) +{ + return m_loaded ? m_cfg.getColor("GENERAL", "textcolor", CColor(themeTxtColor)) : themeTxtColor; +} + +bool CFanart::hideCover() +{ + if (!isLoaded()) + return false; // If no fanart is loaded, return false +/* + +fanart_hidecover defaults to True +fanart_showafter defaults to False + + hideCover | fanart_hideCover | showAfter | fanart_showAfter | animating | hide +1 True * * * * True +2 False * * * * False +3 default False * * * False +4 default default/True True * True True +5 default default/True True * False False +6 default default/True False * * True +7 default default/True default True True True +8 default default/True default True False False +9 * * * * * True +*/ + // rules 1 and 2 + if (m_globalHideCover != 2) + return m_globalHideCover == 1; + // rule 3 + if (!m_cfg.getBool("GENERAL", "hidecover", true)) + return false; + // rules 4, 5 and 6 + if (m_globalShowCoverAfterAnimation != 2) + return m_globalShowCoverAfterAnimation == 0 || !isAnimationComplete(); + // rules 7 and 8 + if (m_cfg.getBool("GENERAL", "show_cover_after_animation", false)) + return !isAnimationComplete(); + // rule 9 + return true; +} + +bool CFanart::isLoaded() +{ + return m_loaded; +} + +bool CFanart::isAnimationComplete() +{ + return m_animationComplete && m_delayAfterAnimation <= 0; +} + +void CFanart::tick() +{ + m_animationComplete = true; + for (u32 i = 0; i < m_elms.size(); ++i) + { + m_elms[i].tick(); + if (!m_elms[i].IsAnimationComplete()) + m_animationComplete = false; + } + if (m_animationComplete && m_delayAfterAnimation > 0) + m_delayAfterAnimation--; +} + +void CFanart::draw(bool front) +{ + if (!m_allowArtworkOnTop && front) + return; // It's not allowed to draw fanart on top, it has already been drawn + + GX_SetNumChans(1); + GX_ClearVtxDesc(); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_CLR0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_CLR0, GX_CLR_RGBA, GX_RGBA8, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetNumTexGens(1); + GX_SetTevOp(GX_TEVSTAGE0, GX_MODULATE); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLOR0A0); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetBlendMode(GX_BM_BLEND, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + GX_SetAlphaUpdate(GX_TRUE); + GX_SetCullMode(GX_CULL_NONE); + GX_SetZMode(GX_DISABLE, GX_LEQUAL, GX_TRUE); + + for (u32 i = 0; i < m_elms.size(); ++i) + if (!m_allowArtworkOnTop || ((front && m_elms[i].ShowOnTop()) || !front)) + m_elms[i].draw(); +} + +CFanartElement::CFanartElement(Config &cfg, const char *dir, int artwork) + : m_artwork(artwork), m_isValid(false) +{ + m_isValid = m_art.fromPNGFile(sfmt("%s/artwork%d.png", dir, artwork).c_str(), GX_TF_RGBA8) == STexture::TE_OK; + if (!m_isValid) return; + + const char *section = fmt("artwork%d", artwork); + + m_show_on_top = cfg.getBool(section, "show_on_top", true); + + m_x = cfg.getInt(section, "x", 0); + m_y = cfg.getInt(section, "y", 0); + m_scaleX = cfg.getFloat(section, "scale_x", 1.f); + m_scaleY = cfg.getFloat(section, "scale_y", 1.f); + m_alpha = min(cfg.getInt(section, "alpha", 255), 255); + m_delay = (int) (cfg.getFloat(section, "delay", 0.f) * 50); + m_angle = cfg.getFloat(section, "angle", 0.f); + + m_event_duration = (int) (cfg.getFloat(section, "duration", 0.f) * 50); + m_event_x = m_event_duration == 0 ? m_x : cfg.getInt(section, "event_x", m_x); + m_event_y = m_event_duration == 0 ? m_y : cfg.getInt(section, "event_y", m_y); + m_event_scaleX = m_event_duration == 0 ? m_scaleX : cfg.getInt(section, "event_scale_x", m_scaleX); + m_event_scaleY = m_event_duration == 0 ? m_scaleY : cfg.getInt(section, "event_scale_y", m_scaleY); + m_event_alpha = m_event_duration == 0 ? m_alpha : min(cfg.getInt(section, "event_alpha", m_alpha), 255); // Not from m_alpha, because the animation can start less translucent than m_alpha + m_event_angle = m_event_duration == 0 ? m_angle : cfg.getFloat(section, "event_angle", m_angle); + + m_step_x = m_event_duration == 0 ? 0 : (m_x - m_event_x) / m_event_duration; + m_step_y = m_event_duration == 0 ? 0 : (m_y - m_event_y) / m_event_duration; + m_step_scaleX = m_event_duration == 0 ? 0 : (m_scaleX - m_event_scaleX) / m_event_duration; + m_step_scaleY = m_event_duration == 0 ? 0 : (m_scaleY - m_event_scaleY) / m_event_duration; + m_step_alpha = m_event_duration == 0 ? 0 : (m_alpha - m_event_alpha) / m_event_duration; + m_step_angle = m_event_duration == 0 ? 0 : (m_angle - m_event_angle) / m_event_duration; +} + +CFanartElement::~CFanartElement(void) +{ +} + +bool CFanartElement::IsValid() +{ + return m_isValid; +} + +bool CFanartElement::IsAnimationComplete() +{ + return m_event_duration == 0; +} + +bool CFanartElement::ShowOnTop() +{ + return m_show_on_top; +} + +void CFanartElement::tick() +{ + if (m_delay > 0) + { + m_delay--; + return; + } + + if ((m_step_x < 0 && m_event_x > m_x) || (m_step_x > 0 && m_event_x < m_x)) + m_event_x = (int) (m_event_x + m_step_x); + if ((m_step_y < 0 && m_event_y > m_y) || (m_step_y > 0 && m_event_y < m_y)) + m_event_y = (int) (m_event_y + m_step_y); + if ((m_step_alpha < 0 && m_event_alpha > m_alpha) || (m_step_alpha > 0 && m_event_alpha < m_alpha)) + m_event_alpha = (int) (m_event_alpha + m_step_alpha); + if ((m_step_scaleX < 0 && m_event_scaleX > m_scaleX) || (m_step_scaleX > 0 && m_event_scaleX < m_scaleX)) + m_event_scaleX += m_step_scaleX; + if ((m_step_scaleY < 0 && m_event_scaleY > m_scaleY) || (m_step_scaleY > 0 && m_event_scaleY < m_scaleY)) + m_event_scaleY += m_step_scaleY; + if ((m_step_angle < 0 && m_event_angle > m_angle) || (m_step_angle > 0 && m_event_angle < m_angle)) + m_event_angle = (int) (m_event_angle + m_step_angle); + + if (m_event_duration > 0) + { + m_event_duration--; + } +} + +void CFanartElement::draw() +{ + if (m_event_alpha == 0 || m_event_scaleX == 0.f || m_event_scaleY == 0.f || m_delay > 0) + return; + + GXTexObj artwork; + Mtx modelViewMtx, idViewMtx, rotViewMtxZ; + + guMtxIdentity(idViewMtx); + guMtxScaleApply(idViewMtx, idViewMtx, m_event_scaleX, m_event_scaleY, 1.f); + + guMtxRotAxisDeg(rotViewMtxZ, &_GRRaxisz, m_event_angle); + guMtxConcat(rotViewMtxZ, idViewMtx, modelViewMtx); + + guMtxTransApply(modelViewMtx, modelViewMtx, m_event_x, m_event_y, 0.f); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + + GX_InitTexObj(&artwork, m_art.data.get(), m_art.width, m_art.height, m_art.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&artwork, GX_TEXMAP0); + + float w = (float)(m_art.width / 2); // * m_event_scaleX; + float h = (float)(m_art.height / 2); // * m_event_scaleY; + + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + + // Draw top left + GX_Position3f32(-w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, m_event_alpha); + GX_TexCoord2f32(0.f, 0.f); + + // Draw top right + GX_Position3f32(w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, m_event_alpha); + GX_TexCoord2f32(1.f, 0.f); + + // Draw bottom right + GX_Position3f32(w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, m_event_alpha); + GX_TexCoord2f32(1.f, 1.f); + + // Draw bottom left + GX_Position3f32(-w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, m_event_alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); +} \ No newline at end of file diff --git a/source/gui/fanart.hpp b/source/gui/fanart.hpp new file mode 100644 index 00000000..b0c35be3 --- /dev/null +++ b/source/gui/fanart.hpp @@ -0,0 +1,92 @@ +// Fan Art + +#ifndef __FANART_HPP +#define __FANART_HPP + +#include +#include +#include +#include "safe_vector.hpp" + +#include "config.hpp" +#include "texture.hpp" +#include "gui.hpp" + +class CFanartElement +{ +public: + CFanartElement(Config &cfg, const char *dir, int artwork); + ~CFanartElement(void); + + void draw(); + void tick(); + + bool IsValid(); + bool IsAnimationComplete(); + bool ShowOnTop(); +private: + STexture m_art; + int m_artwork; + int m_delay; + int m_event_duration; + + int m_x; + int m_y; + int m_alpha; + float m_scaleX; + float m_scaleY; + float m_angle; + + int m_event_x; + int m_event_y; + int m_event_alpha; + float m_event_scaleX; + float m_event_scaleY; + float m_event_angle; + + float m_step_x; + float m_step_y; + float m_step_alpha; + float m_step_scaleX; + float m_step_scaleY; + float m_step_angle; + + bool m_show_on_top; + + bool m_isValid; +}; + +class CFanart +{ +public: + CFanart(void); + ~CFanart(void); + + void unload(); + bool load(Config &m_globalConfig, const char *path, const char *id); + bool isAnimationComplete(); + bool isLoaded(); + + void getBackground(STexture &hq, STexture &lq); + CColor getTextColor(CColor themeTxtColor = CColor(0xFFFFFFFF)); + bool hideCover(); + void draw(bool front = true); + void tick(); + +private: + safe_vector m_elms; + + bool m_animationComplete; + u16 m_delayAfterAnimation; + u8 m_globalHideCover; + u8 m_globalShowCoverAfterAnimation; + u16 m_defaultDelay; + bool m_allowArtworkOnTop; + bool m_loaded; + Config m_cfg; + + STexture m_bg; + STexture m_bglq; +}; + +#endif // __FANART_HPP \ No newline at end of file diff --git a/source/gui/gcvid.cpp b/source/gui/gcvid.cpp new file mode 100644 index 00000000..4d510e48 --- /dev/null +++ b/source/gui/gcvid.cpp @@ -0,0 +1,826 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by thakis + * + * Modification and adjustment for the Wii by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * gcvid.cpp + ***************************************************************************/ + +#include "gcvid.h" +#include "utils.h" + +#include //NULL +#include //memcmp +#include +#include +using namespace std; + +void readThpHeader(FILE* f, ThpHeader& h) +{ + fread(&h, sizeof(h), 1, f); +} + +void readThpComponents(FILE* f, ThpComponents& c) +{ + fread(&c, sizeof(c), 1, f); +} + +void readThpVideoInfo(FILE* f, ThpVideoInfo& i, bool isVersion11) +{ + fread(&i, sizeof(i), 1, f); + if(!isVersion11) + { + i.unknown = 0; + fseek(f, -4, SEEK_CUR); + } +} + +void readThpAudioInfo(FILE* f, ThpAudioInfo& i, bool isVersion11) +{ + fread(&i, sizeof(i), 1, f); + if(!isVersion11) + { + i.numData = 1; + fseek(f, -4, SEEK_CUR); + } +} + +void readMthHeader(FILE* f, MthHeader& h) +{ + fread(&h, sizeof(h), 1, f); +} + + +struct DecStruct +{ + const u8* currSrcByte; + u32 blockCount; + u8 index; + u8 shift; +}; + +void thpAudioInitialize(DecStruct& s, const u8* srcStart) +{ + s.currSrcByte = srcStart; + s.blockCount = 2; + s.index = (*s.currSrcByte >> 4) & 0x7; + s.shift = *s.currSrcByte & 0xf; + ++s.currSrcByte; +} + +s32 thpAudioGetNewSample(DecStruct& s) +{ + //the following if is executed all 14 calls + //to thpAudioGetNewSample() (once for each + //microblock) because mask & 0xf can contain + //16 different values and starts with 2 + if((s.blockCount & 0xf) == 0) + { + s.index = (*s.currSrcByte >> 4) & 0x7; + s.shift = *s.currSrcByte & 0xf; + ++s.currSrcByte; + s.blockCount += 2; + } + + s32 ret; + if((s.blockCount & 1) != 0) + { + s32 t = (*s.currSrcByte << 28) & 0xf0000000; + ret = t >> 28; //this has to be an arithmetic shift + ++s.currSrcByte; + } + else + { + s32 t = (*s.currSrcByte << 24) & 0xf0000000; + ret = t >> 28; //this has to be an arithmetic shift + } + + ++s.blockCount; + return ret; +} + +int thpAudioDecode(s16 * destBuffer, const u8* srcBuffer, bool separateChannelsInOutput, bool isInputStereo) +{ + if(destBuffer == NULL || srcBuffer == NULL) + return 0; + + ThpAudioBlockHeader* head = (ThpAudioBlockHeader*)srcBuffer; + + u32 channelInSize = head->channelSize; + u32 numSamples = head->numSamples; + + const u8* srcChannel1 = srcBuffer + sizeof(ThpAudioBlockHeader); + const u8* srcChannel2 = srcChannel1 + channelInSize; + + s16* table1 = head->table1; + s16* table2 = head->table2; + + s16* destChannel1, * destChannel2; + u32 delta; + + if(separateChannelsInOutput) + { + //separated channels in output + destChannel1 = destBuffer; + destChannel2 = destBuffer + numSamples; + delta = 1; + } + else + { + //interleaved channels in output + destChannel1 = destBuffer; + destChannel2 = destBuffer + 1; + delta = 2; + } + + DecStruct s; + if(!isInputStereo) + { + //mono channel in input + + thpAudioInitialize(s, srcChannel1); + + s16 prev1 = *(s16*)(srcBuffer + 72); + s16 prev2 = *(s16*)(srcBuffer + 74); + + for(u32 i = 0; i < numSamples; ++i) + { + s64 res = (s64)thpAudioGetNewSample(s); + res = ((res << s.shift) << 11); //convert to 53.11 fixedpoint + + //these values are 53.11 fixed point numbers + s64 val1 = table1[2*s.index]; + s64 val2 = table1[2*s.index + 1]; + + //convert to 48.16 fixed point + res = (val1*prev1 + val2*prev2 + res) << 5; + + //rounding: + u16 decimalPlaces = res & 0xffff; + if(decimalPlaces > 0x8000) //i.e. > 0.5 + //round up + ++res; + else if(decimalPlaces == 0x8000) //i.e. == 0.5 + if((res & 0x10000) != 0) + //round up every other number + ++res; + + //get nonfractional parts of number, clamp to [-32768, 32767] + s32 final = (res >> 16); + if(final > 32767) final = 32767; + else if(final < -32768) final = -32768; + + prev2 = prev1; + prev1 = final; + *destChannel1 = (s16)final; + *destChannel2 = (s16)final; + destChannel1 += delta; + destChannel2 += delta; + } + } + else + { + //two channels in input - nearly the same as for one channel, + //so no comments here (different lines are marked with XXX) + + thpAudioInitialize(s, srcChannel1); + s16 prev1 = *(s16*)(srcBuffer + 72); + s16 prev2 = *(s16*)(srcBuffer + 74); + for(u32 i = 0; i < numSamples; ++i) + { + s64 res = (s64)thpAudioGetNewSample(s); + res = ((res << s.shift) << 11); + s64 val1 = table1[2*s.index]; + s64 val2 = table1[2*s.index + 1]; + res = (val1*prev1 + val2*prev2 + res) << 5; + u16 decimalPlaces = res & 0xffff; + if(decimalPlaces > 0x8000) + ++res; + else if(decimalPlaces == 0x8000) + if((res & 0x10000) != 0) + ++res; + s32 final = (res >> 16); + if(final > 32767) final = 32767; + else if(final < -32768) final = -32768; + prev2 = prev1; + prev1 = final; + *destChannel1 = (s16)final; + destChannel1 += delta; + } + + thpAudioInitialize(s, srcChannel2);//XXX + prev1 = *(s16*)(srcBuffer + 76);//XXX + prev2 = *(s16*)(srcBuffer + 78);//XXX + for(u32 j = 0; j < numSamples; ++j) + { + s64 res = (s64)thpAudioGetNewSample(s); + res = ((res << s.shift) << 11); + s64 val1 = table2[2*s.index];//XXX + s64 val2 = table2[2*s.index + 1];//XXX + res = (val1*prev1 + val2*prev2 + res) << 5; + u16 decimalPlaces = res & 0xffff; + if(decimalPlaces > 0x8000) + ++res; + else if(decimalPlaces == 0x8000) + if((res & 0x10000) != 0) + ++res; + s32 final = (res >> 16); + if(final > 32767) final = 32767; + else if(final < -32768) final = -32768; + prev2 = prev1; + prev1 = final; + *destChannel2 = (s16)final; + destChannel2 += delta; + } + } + + return numSamples; +} + + +VideoFrame::VideoFrame() +: _data(NULL), _w(0), _h(0), _p(0) +{} + +VideoFrame::~VideoFrame() +{ dealloc(); } + +void VideoFrame::resize(int width, int height) +{ + if(width == _w && height == _h) + return; + + dealloc(); + _w = width; + _h = height; + + //24 bpp, 4 byte padding + _p = 3*width; + _p += (4 - _p%4)%4; + + _data = (u8 *) malloc(_p * _h); +} + +int VideoFrame::getWidth() const +{ return _w; } + +int VideoFrame::getHeight() const +{ return _h; } + +int VideoFrame::getPitch() const +{ return _p; } + +u8* VideoFrame::getData() +{ return _data; } + +const u8* VideoFrame::getData() const +{ return _data; } + +void VideoFrame::dealloc() +{ + SAFE_FREE(_data); + _w = _h = _p = 0; +} + +//swaps red and blue channel of a video frame +void swapRB(VideoFrame& f) +{ + u8* currLine = f.getData(); + + int hyt = f.getHeight(); + int pitch = f.getPitch(); + + for(int y = 0; y < hyt; ++y) + { + for(int x = 0, x2 = 2; x < pitch; x += 3, x2 += 3) + { + u8 t = currLine[x]; + currLine[x] = currLine[x2]; + currLine[x2] = t; + } + currLine += pitch; + } +} + +enum FILETYPE +{ + THP, MTH, JPG, + UNKNOWN = -1 +}; + +FILETYPE getFiletype(FILE* f) +{ + long t = ftell(f); + fseek(f, 0, SEEK_SET); + + u8 buff[4]; + fread(buff, 1, 4, f); + + FILETYPE ret = UNKNOWN; + if(memcmp("THP\0", buff, 4) == 0) + ret = THP; + else if(memcmp("MTHP", buff, 4) == 0) + ret = MTH; + else if(buff[0] == 0xff && buff[1] == 0xd8) + ret = JPG; + + fseek(f, t, SEEK_SET); + return ret; +} + +long getFilesize(FILE* f) +{ + long t = ftell(f); + fseek(f, 0, SEEK_END); + long ret = ftell(f); + fseek(f, t, SEEK_SET); + return ret; +} + +void decodeJpeg(const u8* data, int size, VideoFrame& dest); + + +VideoFile::VideoFile(FILE* f) +: loop(true), _f(f) +{} + +VideoFile::~VideoFile() +{ + SAFE_CLOSE(_f); +} + +int VideoFile::getWidth() const +{ return 0; } + +int VideoFile::getHeight() const +{ return 0; } + +float VideoFile::getFps() const +{ return 0.f; } + +int VideoFile::getFrameCount() const +{ return 0; } + +int VideoFile::getCurrentFrameNr() const +{ return 0; } + +bool VideoFile::hasSound() const +{ return false; } + +int VideoFile::getNumChannels() const +{ return 0; } + +int VideoFile::getFrequency() const +{ return 0; } + +int VideoFile::getMaxAudioSamples() const +{ return 0; } + +int VideoFile::getCurrentBuffer(s16*) const +{ return 0; } + +void VideoFile::loadFrame(VideoFrame& frame, const u8* data, int size) const +{ + decodeJpeg(data, size, frame); +} + + +ThpVideoFile::ThpVideoFile(FILE* f) +: VideoFile(f) +{ + readThpHeader(f, _head); + + //this is just to find files that have this field != 0, i + //have no such a file + assert(_head.offsetsDataOffset == 0); + + readThpComponents(f, _components); + for(u32 i = 0; i < _components.numComponents; ++i) + { + if(_components.componentTypes[i] == 0) //video + readThpVideoInfo(_f, _videoInfo, _head.version == 0x00011000); + else if(_components.componentTypes[i] == 1) //audio + { + readThpAudioInfo(_f, _audioInfo, _head.version == 0x00011000); + assert(_head.maxAudioSamples != 0); + } + } + + _numInts = 3; + if(_head.maxAudioSamples != 0) + _numInts = 4; + + _currFrameNr = -1; + _nextFrameOffset = _head.firstFrameOffset; + _nextFrameSize = _head.firstFrameSize; + _currFrameData.resize(_head.maxBufferSize); //include some padding + loadNextFrame(); +} + +int ThpVideoFile::getWidth() const +{ return _videoInfo.width; } + +int ThpVideoFile::getHeight() const +{ return _videoInfo.height; } + +float ThpVideoFile::getFps() const +{ return _head.fps; } + +int ThpVideoFile::getFrameCount() const +{ return _head.numFrames; } + +int ThpVideoFile::getCurrentFrameNr() const +{ return _currFrameNr; } + +bool ThpVideoFile::loadNextFrame() +{ + ++_currFrameNr; + if(_currFrameNr >= (int) _head.numFrames) + { + if (!loop) + return false; + + _currFrameNr = 0; + _nextFrameOffset = _head.firstFrameOffset; + _nextFrameSize = _head.firstFrameSize; + } + + fseek(_f, _nextFrameOffset, SEEK_SET); + fread(&_currFrameData[0], 1, _nextFrameSize, _f); + + _nextFrameOffset += _nextFrameSize; + _nextFrameSize = *(u32*)&_currFrameData[0]; + return true; +} + +void ThpVideoFile::getCurrentFrame(VideoFrame& f) const +{ + int size = *(u32*)(&_currFrameData[0] + 8); + loadFrame(f, &_currFrameData[0] + 4*_numInts, size); +} + +bool ThpVideoFile::hasSound() const +{ return _head.maxAudioSamples != 0; } + +int ThpVideoFile::getNumChannels() const +{ + if(hasSound()) + return _audioInfo.numChannels; + else + return 0; +} + +int ThpVideoFile::getFrequency() const +{ + if(hasSound()) + return _audioInfo.frequency; + else + return 0; +} + +int ThpVideoFile::getMaxAudioSamples() const +{ return _head.maxAudioSamples; } + +int ThpVideoFile::getCurrentBuffer(s16* data) const +{ + if(!hasSound()) + return 0; + + int jpegSize = *(u32*)(&_currFrameData[0] + 8); + const u8* src = &_currFrameData[0] + _numInts*4 + jpegSize; + + return thpAudioDecode(data, src, false, _audioInfo.numChannels == 2); +} + +MthVideoFile::MthVideoFile(FILE* f) +: VideoFile(f) +{ + readMthHeader(f, _head); + + _currFrameNr = -1; + _nextFrameOffset = _head.offset; + _nextFrameSize = _head.firstFrameSize; + _thisFrameSize = 0; + + _currFrameData.resize(_head.maxFrameSize); + loadNextFrame(); +} + + +int MthVideoFile::getWidth() const +{ return _head.width; } + +int MthVideoFile::getHeight() const +{ return _head.height; } + +float MthVideoFile::getFps() const +{ + return (float) 1.0f*_head.fps; //TODO: This has to be in there somewhere +} + +int MthVideoFile::getFrameCount() const +{ + return _head.numFrames; +} + +int MthVideoFile::getCurrentFrameNr() const +{ return _currFrameNr; } + +bool MthVideoFile::loadNextFrame() +{ + ++_currFrameNr; + if(_currFrameNr >= (int) _head.numFrames) + { + if (!loop) + return false; + _currFrameNr = 0; + _nextFrameOffset = _head.offset; + _nextFrameSize = _head.firstFrameSize; + } + + fseek(_f, _nextFrameOffset, SEEK_SET); + _currFrameData.resize(_nextFrameSize); + fread(&_currFrameData[0], 1, _nextFrameSize, _f); + _thisFrameSize = _nextFrameSize; + + u32 nextSize; + nextSize = *(u32*)(&_currFrameData[0]); + _nextFrameOffset += _nextFrameSize; + _nextFrameSize = nextSize; + return true; +} + +void MthVideoFile::getCurrentFrame(VideoFrame& f) const +{ + int size = _thisFrameSize; + loadFrame(f, &_currFrameData[0] + 4, size - 4); +} + + +JpgVideoFile::JpgVideoFile(FILE* f) +: VideoFile(f) +{ + safe_vector data(getFilesize(f)); + fread(&data[0], 1, getFilesize(f), f); + + loadFrame(_currFrame, &data[0], getFilesize(f)); +} + +int JpgVideoFile::getWidth() const +{ return _currFrame.getWidth(); } + +int JpgVideoFile::getHeight() const +{ return _currFrame.getHeight(); } + +int JpgVideoFile::getFrameCount() const +{ return 1; } + +void JpgVideoFile::getCurrentFrame(VideoFrame& f) const +{ + f.resize(_currFrame.getWidth(), _currFrame.getHeight()); + memcpy(f.getData(), _currFrame.getData(),f.getPitch()*f.getHeight()); +} + +VideoFile* openVideo(const string& fileName) +{ + FILE* f = fopen(fileName.c_str(), "rb"); + if(f == NULL) + return NULL; + + FILETYPE type = getFiletype(f); + switch(type) + { + case THP: + return new ThpVideoFile(f); + case MTH: + return new MthVideoFile(f); + case JPG: + return new JpgVideoFile(f); + + default: + SAFE_CLOSE(f); + return NULL; + } +} + +void closeVideo(VideoFile*& vf) +{ + if(vf != NULL) + delete vf; + vf = NULL; +} + +//as mentioned above, we have to convert 0xff to 0xff 0x00 +//after the image date has begun (ie, after the 0xff 0xda marker) +//but we must not convert the end-of-image-marker (0xff 0xd9) +//this way. There may be 0xff 0xd9 bytes embedded in the image +//data though, so I add 4 bytes to the input buffer +//and fill them with zeroes and check for 0xff 0xd9 0 0 +//as end-of-image marker. this is not correct, but works +//and is easier to code... ;-) +//a better solution would be to patch jpeglib so that this conversion +//is not neccessary + +u8 endBytesThp[] = { 0xff, 0xd9, 0, 0 }; //used in thp files +u8 endBytesMth[] = { 0xff, 0xd9, 0xff, 0 }; //used in mth files + +int countRequiredSize(const u8* data, int size, int& start, int& end) +{ + start = 2*size; + end = size; + int count = 0; + + int j; + for(j = size - 1; data[j] == 0; --j) + ; //search end of data + + if(data[j] == 0xd9) //thp file + end = j - 1; + else if(data[j] == 0xff) //mth file + end = j - 2; + + for(int i = 0; i < end; ++i) + { + if(data[i] == 0xff) + { + //if i == srcSize - 1, then this would normally overrun src - that's why 4 padding + //bytes are included at the end of src + if(data[i + 1] == 0xda && start == 2*size) + start = i; + if(i > start) + ++count; + } + } + return size + count; +} + +void convertToRealJpeg(u8* dest, const u8* src, int srcSize, int start, int end) +{ + int di = 0; + for(int i = 0; i < srcSize; ++i, ++di) + { + dest[di] = src[i]; + //if i == srcSize - 1, then this would normally overrun src - that's why 4 padding + //bytes are included at the end of src + if(src[i] == 0xff && i > start && i < end) + { + ++di; + dest[di] = 0; + } + } +} + +void decodeRealJpeg(const u8* data, int size, VideoFrame& dest); + +void decodeJpeg(const u8* data, int size, VideoFrame& dest) +{ + //convert format so jpeglib understands it... + int start, end; + int newSize = countRequiredSize(data, size, start, end); + u8* buff = new u8[newSize]; + convertToRealJpeg(buff, data, size, start, end); + + //...and feed it to jpeglib + decodeRealJpeg(buff, newSize, dest); + + delete [] buff; +} + +extern "C" +{ +#include "jpeglib.h" +#include +} + +//the following functions are needed to let +//libjpeg read from memory instead of from a file... +//it's a little clumsy to do :-| +const u8* g_jpegBuffer; +int g_jpegSize; +bool g_isLoading = false; + +void jpegInitSource(j_decompress_ptr) +{} + +boolean jpegFillInputBuffer(j_decompress_ptr cinfo) +{ + cinfo->src->next_input_byte = g_jpegBuffer; + cinfo->src->bytes_in_buffer = g_jpegSize; + return TRUE; +} + +void jpegSkipInputData(j_decompress_ptr cinfo, long num_bytes) +{ + cinfo->src->next_input_byte += num_bytes; + cinfo->src->bytes_in_buffer -= num_bytes; +} + +boolean jpegResyncToRestart(j_decompress_ptr cinfo, int desired) +{ + jpeg_resync_to_restart(cinfo, desired); + return TRUE; +} + +void jpegTermSource(j_decompress_ptr) +{} + +void jpegErrorHandler(j_common_ptr cinfo) +{ + char buff[1024]; + (*cinfo->err->format_message)(cinfo, buff); + //MessageBox(g_hWnd, buff, "JpegLib error:", MB_OK); +} + +void decodeRealJpeg(const u8* data, int size, VideoFrame& dest) +{ + if(g_isLoading) + return; + g_isLoading = true; + + //decompressor state + jpeg_decompress_struct cinfo; + jpeg_error_mgr errorMgr; + + //read from memory manager + jpeg_source_mgr sourceMgr; + + cinfo.err = jpeg_std_error(&errorMgr); + errorMgr.error_exit = jpegErrorHandler; + + jpeg_create_decompress(&cinfo); + + //setup read-from-memory + g_jpegBuffer = data; + g_jpegSize = size; + sourceMgr.bytes_in_buffer = size; + sourceMgr.next_input_byte = data; + sourceMgr.init_source = jpegInitSource; + sourceMgr.fill_input_buffer = jpegFillInputBuffer; + sourceMgr.skip_input_data = jpegSkipInputData; + sourceMgr.resync_to_restart = jpegResyncToRestart; + sourceMgr.term_source = jpegTermSource; + cinfo.src = &sourceMgr; + + jpeg_read_header(&cinfo, TRUE); + +#if 1 + //set quality/speed parameters to speed: + cinfo.do_fancy_upsampling = FALSE; + cinfo.do_block_smoothing = FALSE; + + //this actually slows decoding down: + //cinfo.dct_method = JDCT_FASTEST; +#endif + + jpeg_start_decompress(&cinfo); + + dest.resize(cinfo.output_width, cinfo.output_height); + + if(cinfo.num_components == 3) + { + int y = 0; + while(cinfo.output_scanline < cinfo.output_height) + { + //invert image because windows wants it downside up + u8* destBuffer = &dest.getData()[(dest.getHeight() - y - 1)*dest.getPitch()]; + + //NO idea why jpeglib wants a pointer to a pointer + jpeg_read_scanlines(&cinfo, &destBuffer, 1); + ++y; + } + + //jpeglib gives an error in jpeg_finish_decompress() if no all + //scanlines are read by the application... :-| + //(but because we read all scanlines, it's not really needed) + cinfo.output_scanline = cinfo.output_height; + + } + else + { + //MessageBox(g_hWnd, "Only RGB videos are currently supported.", "oops?", MB_OK); + } + + jpeg_finish_decompress(&cinfo); + jpeg_destroy_decompress(&cinfo); + g_isLoading = false; +} diff --git a/source/gui/gcvid.h b/source/gui/gcvid.h new file mode 100644 index 00000000..6ad2fe4d --- /dev/null +++ b/source/gui/gcvid.h @@ -0,0 +1,333 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by thakis + * + * Modification and adjustment for the Wii by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * gcvid.h + ***************************************************************************/ + +#ifndef THAKIS_GCVID_H +#define THAKIS_GCVID_H THAKIS_GCVID_H + +#include //FILE* +#include +#include "safe_vector.hpp" + + +#include + +#pragma pack(push, 1) + +///////////////////////////////////////////////////////////////////// +//THP + +struct ThpHeader +{ + char tag[4]; //'THP\0' + + //from monk's thp player: + u32 version; //0x00011000 = 1.1, 0x00010000 = 1.0 + u32 maxBufferSize; + u32 maxAudioSamples; //!= 0 if sound is stored in file + + + float fps; //usually 29.something (=0x41efc28f) for ntsc + u32 numFrames; + u32 firstFrameSize; //size of first frame + + u32 dataSize; //size of file - ThpHeader.offset + + //from monk's thp player: + u32 componentDataOffset; //ThpComponents stored here + u32 offsetsDataOffset; //?? if != 0, offset to table with offsets of all frames? + + u32 firstFrameOffset; + u32 lastFrameOffset; +}; + +//monk: + +struct ThpComponents +{ + u32 numComponents; //usually 1 or 2 (video or video + audio) + + //component type 0 is video, type 1 is audio, + //type 0xff is "no component" (numComponent many entries + //are != 0xff) + u8 componentTypes[16]; +}; + +struct ThpVideoInfo +{ + u32 width; + u32 height; + u32 unknown; //only for version 1.1 thp files +}; + +struct ThpAudioInfo +{ + u32 numChannels; + u32 frequency; + u32 numSamples; + u32 numData; //only for version 1.1 - that many + //audio blocks are after each video block + //(for surround sound?) +}; + +//endmonk + + +//a frame image is basically a normal jpeg image (without +//the jfif application marker), the only important difference +//is that after the image start marker (0xff 0xda) values +//of 0xff are simply written as 0xff whereas the jpeg +//standard requires them to be written as 0xff 0x00 because +//0xff is the start of a 2-byte control code in jpeg + +//frame (offsets relative to frame start): +//u32 total (image, sound, etc) size of NEXT frame +//u32 size1 at 0x04 (total size of PREV frame according to monk) +//u32 image data size at 0x08 +//size of one audio block ONLY IF THE FILE HAS SOUND. ThpAudioInfo.numData +//many audio blocks after jpeg data +//jpeg data +//audio block(s) + +struct ThpAudioBlockHeader +{ + //size 80 byte + u32 channelSize; //size of one channel in bytes + u32 numSamples; //number of samples/channel + s16 table1[16]; //table for first channel + s16 table2[16]; //table for second channel + s16 channel1Prev1; + s16 channel1Prev2; + s16 channel2Prev1; + s16 channel2Prev2; +}; + +//audio block: +//u32 size of this audioblock +// +//u32 numBytes/channel of audioblock - that many bytes per channel after adpcm table) +// +//u32 number of samples per channel +// +//2*16 shorts adpcm table (one per channel - always stored both, +//even for mono files), 5.11 fixed point values +// +//4 s16: 2 shorts prev1 and prev2 for each channel (even for mono files) +// +//sound data + +//sound data: +//8 byte are 14 samples: +//the first byte stores index (upper nibble) and shift (lower nibble), +//the following 7 bytes contain 14o samples a 4 bit each + + +///////////////////////////////////////////////////////////////////// +//MTH ("mute thp"?) + +//similar to a thp file, but without sound + +struct MthHeader +{ + //one of the unknown has to be fps in some form + + char tag[4]; //'MTHP' + u32 unknown; + u32 unknown2; + u32 maxFrameSize; + + u32 width; + u32 height; + u32 fps; + u32 numFrames; + + u32 offset; + u32 unknown5; + u32 firstFrameSize; + + //5 padding u32's follow +}; + +//frame: +//u32 size of NEXT frame +//jpeg data + +//see thp (above) for jpeg format. there's a small difference, though: +//mth jpegs end with 0xff 0xd9 0xff instead of 0xff 0xd9 + +#pragma pack(pop) + +//little helper class that represents one frame of video +//data is 24 bpp, scanlines aligned to 4 byte boundary +class VideoFrame +{ + public: + VideoFrame(); + ~VideoFrame(); + + void resize(int width, int height); + + int getWidth() const; + int getHeight() const; + int getPitch() const; + u8* getData(); + const u8* getData() const; + + void dealloc(); + + private: + u8* _data; + int _w; + int _h; + int _p; //pitch in bytes + + //copy constructor and asignment operator are not allowed + //VideoFrame(const VideoFrame& f); + VideoFrame& operator=(const VideoFrame& f); +}; + +//swaps red and blue channel of a video frame +void swapRB(VideoFrame& f); + + +class VideoFile +{ + public: + VideoFile(FILE* f); + virtual ~VideoFile(); + + + virtual int getWidth() const; + virtual int getHeight() const; + virtual float getFps() const; + virtual int getFrameCount() const; + virtual int getCurrentFrameNr() const; + + virtual bool loadNextFrame() = 0; + + virtual void getCurrentFrame(VideoFrame& frame) const = 0; + + //sound support: + virtual bool hasSound() const; + virtual int getNumChannels() const; + virtual int getFrequency() const; + virtual int getMaxAudioSamples() const; + virtual int getCurrentBuffer(s16* data) const; + + bool loop; + protected: + + FILE* _f; + + //void loadFrame(long offset, int size); + void loadFrame(VideoFrame& frame, const u8* data, int size) const; + +}; + +VideoFile* openVideo(const std::string& fileName); +void closeVideo(VideoFile*& vf); + + +class ThpVideoFile : public VideoFile +{ + public: + ThpVideoFile(FILE* f); + + virtual int getWidth() const; + virtual int getHeight() const; + virtual float getFps() const; + virtual int getFrameCount() const; + + virtual int getCurrentFrameNr() const; + + virtual bool loadNextFrame(); + + virtual void getCurrentFrame(VideoFrame& frame) const; + + virtual bool hasSound() const; + virtual int getNumChannels() const; + virtual int getFrequency() const; + virtual int getMaxAudioSamples() const; + virtual int getCurrentBuffer(s16* data) const; + + + protected: + ThpHeader _head; + ThpComponents _components; + ThpVideoInfo _videoInfo; + ThpAudioInfo _audioInfo; + int _numInts; + + int _currFrameNr; + int _nextFrameOffset; + int _nextFrameSize; + safe_vector _currFrameData; +}; + +class MthVideoFile : public VideoFile +{ + public: + MthVideoFile(FILE* f); + + virtual int getWidth() const; + virtual int getHeight() const; + virtual float getFps() const; + virtual int getFrameCount() const; + + virtual int getCurrentFrameNr() const; + + virtual bool loadNextFrame(); + + virtual void getCurrentFrame(VideoFrame& frame) const; + + protected: + MthHeader _head; + + int _currFrameNr; + int _nextFrameOffset; + int _nextFrameSize; + int _thisFrameSize; + safe_vector _currFrameData; +}; + +class JpgVideoFile : public VideoFile +{ + public: + JpgVideoFile(FILE* f); + + virtual int getWidth() const; + virtual int getHeight() const; + virtual int getFrameCount() const; + + virtual bool loadNextFrame() { return false; } + virtual void getCurrentFrame(VideoFrame& frame) const; + + private: + VideoFrame _currFrame; +}; + +#endif //THAKIS_GCVID_H diff --git a/source/gui/gui.cpp b/source/gui/gui.cpp new file mode 100644 index 00000000..2af7e034 --- /dev/null +++ b/source/gui/gui.cpp @@ -0,0 +1,917 @@ +#include "gui.hpp" +#include + +using namespace std; + +template static inline T loopNum(T i, T s) +{ + return (i + s) % s; +} + +STexture CButtonsMgr::_noTexture; +SmartGuiSound CButtonsMgr::_noSound = SmartGuiSound(new GuiSound()); + +bool CButtonsMgr::init(CVideo &vid) +{ + m_elts.clear(); + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + m_selected[chan] = -1; + m_rumble[chan] = 0; + } + m_rumbleEnabled = false; + m_soundVolume = 0xFF; + m_noclick = false; + m_vid = vid; + soundInit(); + + return true; +} + +u32 CButtonsMgr::addButton(SFont font, const wstringEx &text, int x, int y, u32 width, u32 height, const CColor &color, + const SButtonTextureSet &texSet, const SmartGuiSound &clickSound, const SmartGuiSound &hoverSound) +{ + CButtonsMgr::SButton *b = new CButtonsMgr::SButton; + SmartPtr elt(b); + + b->font = font; + b->visible = false; + b->text = text; + b->textColor = color; + b->x = x + width / 2; + b->y = y + height / 2; + b->w = width; + b->h = height; + b->alpha = 0; + b->targetAlpha = 0; + b->scaleX = 0.f; + b->scaleY = 0.f; + b->targetScaleX = 0.f; + b->targetScaleY = 0.f; + b->click = 0.f; + b->tex = texSet; + b->clickSound = clickSound; + b->hoverSound = hoverSound; + b->moveByX = 0; + b->moveByY = 0; + + u32 sz = m_elts.size(); + m_elts.push_back(elt); + + return m_elts.size() > sz ? m_elts.size() - 1 : -2; +} + +void CButtonsMgr::reset(u32 id, bool instant) +{ + if (id < m_elts.size()) + { + CButtonsMgr::SElement &b = *m_elts[id]; + b.x -= b.moveByX; + b.y -= b.moveByY; + if (instant) + { + b.pos.x -= b.moveByX; + b.pos.y -= b.moveByY; + } + b.targetPos.x -= b.moveByX; + b.targetPos.y -= b.moveByY; + b.moveByX = 0; + b.moveByY = 0; + } +} + +void CButtonsMgr::moveBy(u32 id, int x, int y, bool instant) +{ + if (id < m_elts.size()) + { + CButtonsMgr::SElement &b = *m_elts[id]; + b.moveByX += x; + b.moveByY += y; + b.x += x; + b.y += y; + if (instant) + { + b.pos.x += x; + b.pos.y += y; + } + b.targetPos.x += x; + b.targetPos.y += y; + } +} + +void CButtonsMgr::getDimensions(u32 id, int &x, int &y, u32 &width, u32 &height) +{ + if (id < m_elts.size()) + { + CButtonsMgr::SElement &b = *m_elts[id]; + x = b.targetPos.x; + y = b.targetPos.y; + width = b.w; + height = b.h; + if (b.t == GUIELT_LABEL) + { + CButtonsMgr::SLabel *s = (CButtonsMgr::SLabel *) m_elts[id].get(); + + // Calculate height + height = s->text.getTotalHeight(); + } + } +} + +void CButtonsMgr::hide(u32 id, int dx, int dy, float scaleX, float scaleY, bool instant) +{ + if (id < m_elts.size()) + { + CButtonsMgr::SElement &b = *m_elts[id]; + b.hideParam.dx = dx; + b.hideParam.dy = dy; + b.hideParam.scaleX = scaleX; + b.hideParam.scaleY = scaleY; + b.visible = false; + b.targetScaleX = scaleX; + b.targetScaleY = scaleY; + b.targetPos = Vector3D((float)(b.x + dx), (float)(b.y + dy), 0.f); + b.targetAlpha = 0x00; + if (instant) + { + b.scaleX = b.targetScaleX; + b.scaleY = b.targetScaleY; + b.pos = b.targetPos; + b.alpha = b.targetAlpha; + } + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if (m_selected[chan] == id) + m_selected[chan] = -1; + } +} + +void CButtonsMgr::hide(u32 id, bool instant) +{ + if (id < m_elts.size()) + { + CButtonsMgr::SElement &b = *m_elts[id]; + hide(id, b.hideParam.dx, b.hideParam.dy, b.hideParam.scaleX, b.hideParam.scaleY, instant); + } +} + +void CButtonsMgr::stopSounds(void) +{ + for (u32 i = 0; i < m_elts.size(); ++i) + if (m_elts[i]->t == CButtonsMgr::GUIELT_BUTTON) + { + CButtonsMgr::SButton &b = (CButtonsMgr::SButton &)*m_elts[i]; + if (!!b.hoverSound) + b.hoverSound->Stop(); + if (!!b.clickSound) + b.clickSound->Stop(); + } +} + +void CButtonsMgr::setSoundVolume(int vol) +{ + m_soundVolume = min(max(0, vol), 0xFF); +} + +void CButtonsMgr::show(u32 id, bool instant) +{ + if (id < m_elts.size()) + { + CButtonsMgr::SElement &b = *m_elts[id]; + b.visible = true; + b.targetScaleX = 1.0f; + b.targetScaleY = 1.0f; + b.targetPos = Vector3D((float)b.x, (float)b.y, 0); + b.targetAlpha = 0xFF; + + if (instant) + { + b.scaleX = b.targetScaleX; + b.scaleY = b.targetScaleY; + b.pos = b.targetPos; + b.alpha = b.targetAlpha; + } + } +} + +void CButtonsMgr::setRumble(int chan, bool wii, bool gc) +{ + wii_rumble[chan] = wii; + gc_rumble[chan] = gc; +} + +void CButtonsMgr::mouse(int chan, int x, int y) +{ + if (m_elts.empty()) return; + + float w, h; + u32 s = m_selected[chan]; + + if (m_selected[chan] < m_elts.size()) + { + m_elts[m_selected[chan]]->targetScaleX = 1.f; + m_elts[m_selected[chan]]->targetScaleY = 1.f; + } + m_selected[chan] = -1; + for (int i = (int)m_elts.size() - 1; i >= 0; --i) + { + CButtonsMgr::SElement &b = *m_elts[i]; + if (b.t == CButtonsMgr::GUIELT_BUTTON) + { + SButton &but = *(CButtonsMgr::SButton *)&b; + w = (float)(but.w / 2); + h = (float)(but.h / 2); + if (but.visible && (float)x >= but.pos.x - w && (float)x < but.pos.x + w && (float)y >= but.pos.y - h && (float)y < but.pos.y + h) + { + m_selected[chan] = i; + but.targetScaleX = 1.05f; + but.targetScaleY = 1.05f; + // + if (s != m_selected[chan]) + { + if (m_soundVolume > 0 && !!but.hoverSound) + but.hoverSound->Play(m_soundVolume); + if (m_rumbleEnabled) + { + m_rumble[chan] = 4; + if(wii_rumble[chan]) WPAD_Rumble(chan, 1); + if(gc_rumble[chan]) PAD_ControlMotor(chan, 1); + } + } + break; + } + } + } +} + +bool CButtonsMgr::selected(u32 button) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + if(m_selected[chan] == button) + { + if(m_selected[chan] != (u32)-1) + if(!m_noclick) + click(m_selected[chan]); + return true; + } + } + return false; +} + +void CButtonsMgr::up(void) +{ + if (m_elts.empty()) return; + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + if (m_selected[chan] < m_elts.size()) + { + m_elts[m_selected[chan]]->targetScaleX = 1.f; + m_elts[m_selected[chan]]->targetScaleY = 1.f; + } + u32 start = m_selected[chan]; + m_selected[chan] = -1; + for (u32 i = 1; i <= m_elts.size(); ++i) + { + u32 j = loopNum(start - i, m_elts.size()); + CButtonsMgr::SElement &b = *m_elts[j]; + if (b.t == CButtonsMgr::GUIELT_BUTTON && b.visible) + { + m_selected[chan] = j; + b.targetScaleX = 1.1f; + b.targetScaleY = 1.1f; + break; + } + } + } +} + +void CButtonsMgr::down(void) +{ + if (m_elts.empty()) return; + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + if (m_selected[chan] < m_elts.size()) + { + m_elts[m_selected[chan]]->targetScaleX = 1.f; + m_elts[m_selected[chan]]->targetScaleY = 1.f; + } + u32 start = m_selected[chan]; + m_selected[chan] = -1; + for (u32 i = 1; i <= m_elts.size(); ++i) + { + u32 j = loopNum(start + i, m_elts.size()); + CButtonsMgr::SElement &b = *m_elts[j]; + if (b.t == CButtonsMgr::GUIELT_BUTTON && b.visible) + { + m_selected[chan] = j; + b.targetScaleX = 1.1f; + b.targetScaleY = 1.1f; + break; + } + } + } +} + +void CButtonsMgr::noClick(bool noclick) +{ + m_noclick = noclick; +} + +void CButtonsMgr::click(u32 id) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + WPAD_Rumble(chan, 0); + PAD_ControlMotor(chan, 0); + + if (id == (u32)-1) id = m_selected[chan]; + if (id < m_elts.size() && m_elts[id]->t == CButtonsMgr::GUIELT_BUTTON) + { + CButtonsMgr::SButton &b = *((CButtonsMgr::SButton *)m_elts[id].get()); + b.click = 1.f; + b.scaleX = 1.1f; + b.scaleY = 1.1f; + if (m_soundVolume > 0 && !!b.clickSound) b.clickSound->Play(m_soundVolume); + } + } +} + +void CButtonsMgr::SElement::tick(void) +{ + scaleX += (targetScaleX - scaleX) * (targetScaleX > scaleX ? 0.3f : 0.1f); + scaleY += (targetScaleY - scaleY) * (targetScaleY > scaleY ? 0.3f : 0.1f); + int alphaDist = (int)targetAlpha - (int)alpha; + alpha += abs(alphaDist) >= 8 ? (u8)(alphaDist / 8) : (u8)alphaDist; + pos += (targetPos - pos) * 0.1f; +} + +void CButtonsMgr::SLabel::tick(void) +{ + CButtonsMgr::SElement::tick(); + text.tick(); +} + +void CButtonsMgr::SButton::tick(void) +{ + CButtonsMgr::SElement::tick(); + click += -click * 0.2f; + if (click < 0.01f) click = 0.f; +} + +void CButtonsMgr::SProgressBar::tick(void) +{ + CButtonsMgr::SElement::tick(); + val += (targetVal - val) * 0.1f; +} + +void CButtonsMgr::tick(void) +{ + for (u32 i = 0; i < m_elts.size(); ++i) + m_elts[i]->tick(); + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if (m_rumble[chan] > 0 && --m_rumble[chan] == 0) + { + WPAD_Rumble(chan, 0); + PAD_ControlMotor(chan, 0); + } + +} + +u32 CButtonsMgr::addLabel(SFont font, const wstringEx &text, int x, int y, u32 width, u32 height, const CColor &color, u16 style, const STexture &bg) +{ + CButtonsMgr::SLabel *b = new CButtonsMgr::SLabel; + SmartPtr elt(b); + + b->font = font; + b->visible = false; + b->textStyle = style; + b->text.setText(b->font, text); + b->text.setFrame(width, b->textStyle, false, true); + b->textColor = color; + b->x = x + width / 2; + b->y = y + height / 2; + b->w = width; + b->h = height; + b->alpha = 0; + b->targetAlpha = 0; + b->scaleX = 0.f; + b->scaleY = 0.f; + b->targetScaleX = 0.f; + b->targetScaleY = 0.f; + b->texBg = bg; + b->moveByX = 0; + b->moveByY = 0; + + u32 sz = m_elts.size(); + m_elts.push_back(elt); + + return m_elts.size() > sz ? m_elts.size() - 1 : -2; +} + +u32 CButtonsMgr::addProgressBar(int x, int y, u32 width, u32 height, SButtonTextureSet &texSet) +{ + CButtonsMgr::SProgressBar *b = new CButtonsMgr::SProgressBar; + SmartPtr elt(b); + + b->visible = false; + b->x = x + width / 2; + b->y = y + height / 2; + b->w = width; + b->h = height; + b->alpha = 0; + b->targetAlpha = 0; + b->scaleX = 0.f; + b->scaleY = 0.f; + b->targetScaleX = 0.f; + b->targetScaleY = 0.f; + b->tex = texSet; + b->val = 0.f; + b->targetVal = 0.f; + b->moveByX = 0; + b->moveByY = 0; + + u32 sz = m_elts.size(); + m_elts.push_back(elt); + + return m_elts.size() > sz ? m_elts.size() - 1 : -2; +} + +u32 CButtonsMgr::addPicButton(STexture &texNormal, STexture &texSelected, int x, int y, u32 width, u32 height, const SmartGuiSound &clickSound, const SmartGuiSound &hoverSound) +{ + SButtonTextureSet texSet; + + texSet.center = texNormal; + texSet.centerSel = texSelected; + u32 i = addButton(SFont(), wstringEx(), x, y, width, height, CColor(), texSet, clickSound, hoverSound); + return i; +} + +u32 CButtonsMgr::addPicButton(const u8 *pngNormal, const u8 *pngSelected, int x, int y, u32 width, u32 height, const SmartGuiSound &clickSound, const SmartGuiSound &hoverSound) +{ + SButtonTextureSet texSet; + + texSet.center.fromPNG(pngNormal); + texSet.centerSel.fromPNG(pngSelected); + u32 i = addButton(SFont(), wstringEx(), x, y, width, height, CColor(), texSet, clickSound, hoverSound); + return i; +} + +void CButtonsMgr::setText(u32 id, const wstringEx &text, bool unwrap) +{ + if (id < m_elts.size()) + { + CButtonsMgr::SLabel *lbl; + switch (m_elts[id]->t) + { + case CButtonsMgr::GUIELT_BUTTON: + ((CButtonsMgr::SButton *)m_elts[id].get())->text = text; + break; + case CButtonsMgr::GUIELT_LABEL: + lbl = (CButtonsMgr::SLabel *)m_elts[id].get(); + lbl->text.setText(lbl->font, text); + if (unwrap) lbl->text.setFrame(100000, lbl->textStyle, true, true); + lbl->text.setFrame(lbl->w, lbl->textStyle, false, !unwrap); + break; + case CButtonsMgr::GUIELT_PROGRESS: + break; + } + } +} + +void CButtonsMgr::setText(u32 id, const wstringEx &text, u32 startline,bool unwrap) +{ + if (id < m_elts.size()) + { + CButtonsMgr::SLabel *lbl; + switch (m_elts[id]->t) + { + case CButtonsMgr::GUIELT_BUTTON: + //((CButtonsMgr::SButton *)m_elts[id].get())->text = text; + break; + case CButtonsMgr::GUIELT_LABEL: + lbl = (CButtonsMgr::SLabel *)m_elts[id].get(); + lbl->text.setText(lbl->font, text, startline); + if (unwrap) lbl->text.setFrame(100000, lbl->textStyle, true, true); + lbl->text.setFrame(lbl->w, lbl->textStyle, false, !unwrap); + break; + case CButtonsMgr::GUIELT_PROGRESS: + break; + } + } +} + +void CButtonsMgr::setTexture(u32 id, STexture &bg) +{ + if (id < m_elts.size()) + { + CButtonsMgr::SLabel *lbl; + switch (m_elts[id]->t) + { + case CButtonsMgr::GUIELT_BUTTON: + break; + case CButtonsMgr::GUIELT_LABEL: + lbl = (CButtonsMgr::SLabel *)m_elts[id].get(); + lbl->texBg = bg;//change texture + break; + case CButtonsMgr::GUIELT_PROGRESS: + break; + } + } +} + +void CButtonsMgr::setTexture(u32 id, STexture &bg, int width, int height) +{ + if (id < m_elts.size()) + { + CButtonsMgr::SLabel *lbl; + switch (m_elts[id]->t) + { + case CButtonsMgr::GUIELT_BUTTON: + break; + case CButtonsMgr::GUIELT_LABEL: + lbl = (CButtonsMgr::SLabel *)m_elts[id].get(); + lbl->texBg = bg;//change texture + lbl->w = width; + lbl->h = height; + break; + case CButtonsMgr::GUIELT_PROGRESS: + break; + } + } +} + +void CButtonsMgr::setProgress(u32 id, float f, bool instant) +{ + if (m_elts[id]->t == CButtonsMgr::GUIELT_PROGRESS) + { + CButtonsMgr::SProgressBar *b = (CButtonsMgr::SProgressBar *)m_elts[id].get(); + b->targetVal = std::min(std::max(0.f, f), 1.f); + if (instant) b->val = b->targetVal; + } +} + +void CButtonsMgr::_drawBtn(const CButtonsMgr::SButton &b, bool selected, bool click) +{ + GXTexObj texObjLeft; + GXTexObj texObjCenter; + GXTexObj texObjRight; + Mtx modelViewMtx; + u8 alpha = b.alpha; + float w, h, wh, scaleX = b.scaleX, scaleY = b.scaleY; + + if (click) + { + alpha = (u8)(b.click * 255.f); + scaleX = (1.f - b.click) * 1.6f; + scaleY = (1.f - b.click) * 1.6f; + } + if (alpha == 0 || scaleX == 0.f || scaleY == 0.f) return; + guMtxIdentity(modelViewMtx); + guMtxTransApply(modelViewMtx, modelViewMtx, b.pos.x, b.pos.y, 0.f); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + if (!!b.tex.left.data && !!b.tex.right.data && !!b.tex.leftSel.data && !!b.tex.rightSel.data && !!b.tex.center.data && !!b.tex.centerSel.data) + { + if (selected) + { + GX_InitTexObj(&texObjLeft, b.tex.leftSel.data.get(), b.tex.leftSel.width, b.tex.leftSel.height, b.tex.leftSel.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_InitTexObj(&texObjCenter, b.tex.centerSel.data.get(), b.tex.centerSel.width, b.tex.centerSel.height, b.tex.centerSel.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_InitTexObj(&texObjRight, b.tex.rightSel.data.get(), b.tex.rightSel.width, b.tex.rightSel.height, b.tex.rightSel.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + } + else + { + GX_InitTexObj(&texObjLeft, b.tex.left.data.get(), b.tex.left.width, b.tex.left.height, b.tex.left.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_InitTexObj(&texObjCenter, b.tex.center.data.get(), b.tex.center.width, b.tex.center.height, b.tex.center.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_InitTexObj(&texObjRight, b.tex.right.data.get(), b.tex.right.width, b.tex.right.height, b.tex.right.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + } + w = (float)(b.w / 2) * scaleX; + h = (float)(b.h / 2) * scaleY; + wh = (float)(b.h / 2) * scaleX; + GX_LoadTexObj(&texObjLeft, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(-w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(2.f * wh - w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(2.f * wh - w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(-w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + GX_LoadTexObj(&texObjCenter, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(2.f * wh - w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(w - 2.f * wh, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(w - 2.f * wh, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(2.f * wh - w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + GX_LoadTexObj(&texObjRight, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(w - 2.f * wh, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(w - 2.f * wh, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + } + else if (!!b.tex.center.data && !!b.tex.centerSel.data) + { + if (selected) + GX_InitTexObj(&texObjLeft, b.tex.centerSel.data.get(), b.tex.centerSel.width, b.tex.centerSel.height, b.tex.centerSel.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + else + GX_InitTexObj(&texObjLeft, b.tex.center.data.get(), b.tex.center.width, b.tex.center.height, b.tex.center.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + w = (float)(b.w / 2) * scaleX; + h = (float)(b.h / 2) * scaleY; + GX_LoadTexObj(&texObjLeft, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(-w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(-w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + } + if (!b.font.font) return; + b.font.font->reset(); + CColor txtColor(b.textColor.r, b.textColor.g, b.textColor.b, (u8)((int)b.textColor.a * (int)alpha / 0xFF)); + b.font.font->setXScale(scaleX); + b.font.font->setYScale(scaleY); + b.font.font->drawText(0, 0, b.text.c_str(), txtColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE); +} + +void CButtonsMgr::_drawLbl(CButtonsMgr::SLabel &b) +{ + GXTexObj texObj; + Mtx modelViewMtx; + u8 alpha = b.alpha; + float scaleX = b.scaleX; + float scaleY = b.scaleY; + + if (alpha == 0 || scaleX == 0.f || scaleY == 0.f) + return; + float w = (float)(b.w / 2) * scaleX; + float h = (float)(b.h / 2) * scaleY; + guMtxIdentity(modelViewMtx); + guMtxTransApply(modelViewMtx, modelViewMtx, b.pos.x, b.pos.y, 0.f); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + if (!!b.texBg.data) + { + GX_InitTexObj(&texObj, b.texBg.data.get(), b.texBg.width, b.texBg.height, b.texBg.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(-w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(-w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + } + + if (!b.font.font) return; + + b.font.font->reset(); + b.text.setColor(CColor(b.textColor.r, b.textColor.g, b.textColor.b, (u8)((int)b.textColor.a * (int)alpha / 0xFF))); + b.font.font->setXScale(scaleX); + b.font.font->setYScale(scaleY); + float posX = b.pos.x; + float posY = b.pos.y; + if ((b.textStyle & FTGX_JUSTIFY_CENTER) == 0) + { + if ((b.textStyle & FTGX_JUSTIFY_RIGHT) != 0) + posX += w; + else + posX -= w; + } + if ((b.textStyle & FTGX_ALIGN_MIDDLE) == 0) + { + if ((b.textStyle & FTGX_ALIGN_BOTTOM) != 0) + posY += h; + else + posY -= h; + } + guMtxIdentity(modelViewMtx); + guMtxTransApply(modelViewMtx, modelViewMtx, posX, posY, 0.f); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + if (b.moveByX != 0 || b.moveByY != 0) + GX_SetScissor(b.targetPos.x - b.moveByX - m_vid.width()/2, b.targetPos.y - b.moveByY - m_vid.height()/2, b.w, b.h); + + b.text.draw(); + if (b.moveByX != 0 || b.moveByY != 0) + GX_SetScissor(0, 0, m_vid.width(), m_vid.height()); +} + +void CButtonsMgr::_drawPBar(const CButtonsMgr::SProgressBar &b) +{ + Mtx modelMtx, modelViewMtx, viewMtx; + u8 alpha = b.alpha; + float scaleX = b.scaleX; + float scaleY = b.scaleY; + + if (alpha == 0 || scaleX == 0.f || scaleY == 0.f) return; + + guMtxIdentity(modelMtx); + guMtxIdentity(viewMtx); + guMtxTransApply(modelMtx, modelMtx, b.pos.x, b.pos.y, 0.f); + guMtxConcat(viewMtx, modelMtx, modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + if (!!b.tex.left.data && !!b.tex.right.data && !!b.tex.leftSel.data && !!b.tex.rightSel.data && !!b.tex.center.data && !!b.tex.centerSel.data) + { + GXTexObj texObjBg, texObjBgL, texObjBgR, texObjBar, texObjBarL, texObjBarR; + float w, h, wh, x1,x2, tx; + GX_InitTexObj(&texObjBarL, b.tex.leftSel.data.get(), b.tex.leftSel.width, b.tex.leftSel.height, b.tex.leftSel.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_InitTexObj(&texObjBar, b.tex.centerSel.data.get(), b.tex.centerSel.width, b.tex.centerSel.height, b.tex.centerSel.format, GX_REPEAT, GX_CLAMP, GX_FALSE); + GX_InitTexObj(&texObjBarR, b.tex.rightSel.data.get(), b.tex.rightSel.width, b.tex.rightSel.height, b.tex.rightSel.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_InitTexObj(&texObjBgL, b.tex.left.data.get(), b.tex.left.width, b.tex.left.height, b.tex.left.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_InitTexObj(&texObjBg, b.tex.center.data.get(), b.tex.center.width, b.tex.center.height, b.tex.center.format, GX_REPEAT, GX_CLAMP, GX_FALSE); + GX_InitTexObj(&texObjBgR, b.tex.right.data.get(), b.tex.right.width, b.tex.right.height, b.tex.right.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + w = (float)(b.w / 2) * scaleX; + h = (float)(b.h / 2) * scaleY; + wh = (float)(b.h / 2) * scaleX; + x1 = 2.f * wh - w; + x2 = w - 2.f * wh; + GX_LoadTexObj(&texObjBgL, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(-w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(x1, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(x1, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(-w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + GX_LoadTexObj(&texObjBg, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(x1, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(x2, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(x2, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(x1, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + GX_LoadTexObj(&texObjBgR, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(x2, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(x2, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + // + x2 = x1 + (2.f * w - 4.f * wh) * b.val; + tx = (2.f * b.w - 4.f * b.h) * b.val / b.h * b.tex.centerSel.height / b.tex.centerSel.width; + GX_LoadTexObj(&texObjBarL, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(-w, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(x1, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(x1, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(-w, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + GX_LoadTexObj(&texObjBar, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(x1, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(x2, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(tx, 0.f); + GX_Position3f32(x2, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(tx, 1.f); + GX_Position3f32(x1, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + GX_LoadTexObj(&texObjBarR, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(x2, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(x2 + wh * 2.f, -h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(x2 + wh * 2.f, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(x2, h, 0.f); + GX_Color4u8(0xFF, 0xFF, 0xFF, alpha); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + } +} + +void CButtonsMgr::draw(void) +{ + if (m_elts.empty()) return; + GX_SetNumChans(1); + GX_ClearVtxDesc(); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_CLR0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_CLR0, GX_CLR_RGBA, GX_RGBA8, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetNumTexGens(1); + GX_SetTevOp(GX_TEVSTAGE0, GX_MODULATE); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLOR0A0); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetBlendMode(GX_BM_BLEND, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + GX_SetAlphaUpdate(GX_TRUE); + GX_SetCullMode(GX_CULL_NONE); + GX_SetZMode(GX_DISABLE, GX_LEQUAL, GX_TRUE); + + for (u32 i = 0; i < m_elts.size(); ++i) + { + switch (m_elts[i]->t) + { + case CButtonsMgr::GUIELT_BUTTON: + { + CButtonsMgr::SButton &b = (CButtonsMgr::SButton &)*m_elts[i]; + + bool drawSelected = false; + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + if (i == m_selected[chan]) + { + drawSelected = true; + break; + } + } + + CButtonsMgr::_drawBtn(b, drawSelected, false); + if (b.click > 0.f) + CButtonsMgr::_drawBtn(b, true, true); + break; + } + case CButtonsMgr::GUIELT_LABEL: + { + CButtonsMgr::SLabel &b = (CButtonsMgr::SLabel &)*m_elts[i]; + CButtonsMgr::_drawLbl(b); + break; + } + case CButtonsMgr::GUIELT_PROGRESS: + { + CButtonsMgr::SProgressBar &b = (CButtonsMgr::SProgressBar &)*m_elts[i]; + CButtonsMgr::_drawPBar(b); + break; + } + } + } +} diff --git a/source/gui/gui.hpp b/source/gui/gui.hpp new file mode 100644 index 00000000..3fce9951 --- /dev/null +++ b/source/gui/gui.hpp @@ -0,0 +1,159 @@ + +// Buttons + +#ifndef __GUI_HPP +#define __GUI_HPP + +#include +#include + +#include "video.hpp" +#include "FreeTypeGX.h" +#include "wstringEx.hpp" +#include "smartptr.hpp" +#include "text.hpp" +#include "gui_sound.h" + +#include "safe_vector.hpp" + +struct SButtonTextureSet +{ + STexture left; + STexture right; + STexture center; + STexture leftSel; + STexture rightSel; + STexture centerSel; +}; + +class CButtonsMgr +{ +public: + bool init(CVideo &vid); + void setRumble(bool enabled) { m_rumbleEnabled = enabled; } + void reserve(u32 capacity) { m_elts.reserve(capacity); } + u32 addButton(SFont font, const wstringEx &text, int x, int y, u32 width, u32 height, const CColor &color, + const SButtonTextureSet &texSet, const SmartGuiSound &clickSound = _noSound, const SmartGuiSound &hoverSound = _noSound); + u32 addLabel(SFont font, const wstringEx &text, int x, int y, u32 width, u32 height, const CColor &color, u16 style, const STexture &bg = _noTexture); + u32 addPicButton(const u8 *pngNormal, const u8 *pngSelected, int x, int y, u32 width, u32 height, + const SmartGuiSound &clickSound = _noSound, const SmartGuiSound &hoverSound = _noSound); + u32 addPicButton(STexture &texNormal, STexture &texSelected, int x, int y, u32 width, u32 height, + const SmartGuiSound &clickSound = _noSound, const SmartGuiSound &hoverSound = _noSound); + u32 addProgressBar(int x, int y, u32 width, u32 height, SButtonTextureSet &texSet); + void setText(u32 id, const wstringEx &text, bool unwrap = false); + void setText(u32 id, const wstringEx &text, u32 startline, bool unwrap = false); + void setTexture(u32 id ,STexture &bg); + void setTexture(u32 id, STexture &bg, int width, int height); + void setProgress(u32 id, float f, bool instant = false); + void reset(u32 id, bool instant = false); + void moveBy(u32 id, int x, int y, bool instant = false); + void getDimensions(u32 id, int &x, int &y, u32 &width, u32 &height); + void hide(u32 id, int dx, int dy, float scaleX, float scaleY, bool instant = false); + void hide(u32 id, bool instant = false); + void show(u32 id, bool instant = false); + void mouse(int chan, int x, int y); + void up(void); + void down(void); + void draw(void); + void tick(void); + void noClick(bool noclick = false); + void click(u32 id = (u32)-1); + bool selected(u32 button = (u32)-1); + void setRumble(int, bool wii = false, bool gc = false); + void deselect(void){ for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) m_selected[chan] = (u32)-1; } + void stopSounds(void); + void setSoundVolume(int vol); +private: + struct SHideParam + { + int dx; + int dy; + float scaleX; + float scaleY; + public: + SHideParam(void) : dx(0), dy(0), scaleX(1.f), scaleY(1.f) { } + }; + enum EltType { + GUIELT_BUTTON, + GUIELT_LABEL, + GUIELT_PROGRESS + }; + struct SElement + { + SHideParam hideParam; + EltType t; + bool visible; + int x; + int y; + int w; + int h; + Vector3D pos; + Vector3D targetPos; + u8 alpha; + u8 targetAlpha; + float scaleX; + float scaleY; + float targetScaleX; + float targetScaleY; + int moveByX; + int moveByY; + public: + virtual ~SElement(void) { } + virtual void tick(void); + protected: + SElement(void) { } + }; + struct SButton : public SElement + { + SFont font; + SButtonTextureSet tex; + wstringEx text; + CColor textColor; + float click; + SmartGuiSound clickSound; + SmartGuiSound hoverSound; + public: + SButton(void) { t = GUIELT_BUTTON; } + virtual void tick(void); + }; + struct SLabel : public SElement + { + SFont font; + CText text; + CColor textColor; + u16 textStyle; + STexture texBg; + public: + SLabel(void) { t = GUIELT_LABEL; } + virtual void tick(void); + }; + struct SProgressBar : public SElement + { + SButtonTextureSet tex; + float val; + float targetVal; + public: + SProgressBar(void) { t = GUIELT_PROGRESS; } + virtual void tick(void); + }; +private: + safe_vector > m_elts; + u32 m_selected[WPAD_MAX_WIIMOTES]; + bool m_rumbleEnabled; + u8 m_rumble[WPAD_MAX_WIIMOTES]; + bool wii_rumble[WPAD_MAX_WIIMOTES]; + bool gc_rumble[WPAD_MAX_WIIMOTES]; + SmartGuiSound m_sndHover; + SmartGuiSound m_sndClick; + u8 m_soundVolume; + bool m_noclick; + CVideo m_vid; +private: + void _drawBtn(const SButton &b, bool selected, bool click); + void _drawLbl(SLabel &b); + void _drawPBar(const SProgressBar &b); + static STexture _noTexture; + static SmartGuiSound _noSound; +}; + +#endif // !defined(__GUI_HPP) diff --git a/source/gui/png.h b/source/gui/png.h new file mode 100644 index 00000000..e0cec0c2 --- /dev/null +++ b/source/gui/png.h @@ -0,0 +1,3569 @@ +/* png.h - header file for PNG reference library + * + * libpng version 1.2.29 - May 8, 2008 + * Copyright (c) 1998-2008 Glenn Randers-Pehrson + * (Version 0.96 Copyright (c) 1996, 1997 Andreas Dilger) + * (Version 0.88 Copyright (c) 1995, 1996 Guy Eric Schalnat, Group 42, Inc.) + * + * Authors and maintainers: + * libpng versions 0.71, May 1995, through 0.88, January 1996: Guy Schalnat + * libpng versions 0.89c, June 1996, through 0.96, May 1997: Andreas Dilger + * libpng versions 0.97, January 1998, through 1.2.29 - May 8, 2008: Glenn + * See also "Contributing Authors", below. + * + * Note about libpng version numbers: + * + * Due to various miscommunications, unforeseen code incompatibilities + * and occasional factors outside the authors' control, version numbering + * on the library has not always been consistent and straightforward. + * The following table summarizes matters since version 0.89c, which was + * the first widely used release: + * + * source png.h png.h shared-lib + * version string int version + * ------- ------ ----- ---------- + * 0.89c "1.0 beta 3" 0.89 89 1.0.89 + * 0.90 "1.0 beta 4" 0.90 90 0.90 [should have been 2.0.90] + * 0.95 "1.0 beta 5" 0.95 95 0.95 [should have been 2.0.95] + * 0.96 "1.0 beta 6" 0.96 96 0.96 [should have been 2.0.96] + * 0.97b "1.00.97 beta 7" 1.00.97 97 1.0.1 [should have been 2.0.97] + * 0.97c 0.97 97 2.0.97 + * 0.98 0.98 98 2.0.98 + * 0.99 0.99 98 2.0.99 + * 0.99a-m 0.99 99 2.0.99 + * 1.00 1.00 100 2.1.0 [100 should be 10000] + * 1.0.0 (from here on, the 100 2.1.0 [100 should be 10000] + * 1.0.1 png.h string is 10001 2.1.0 + * 1.0.1a-e identical to the 10002 from here on, the shared library + * 1.0.2 source version) 10002 is 2.V where V is the source code + * 1.0.2a-b 10003 version, except as noted. + * 1.0.3 10003 + * 1.0.3a-d 10004 + * 1.0.4 10004 + * 1.0.4a-f 10005 + * 1.0.5 (+ 2 patches) 10005 + * 1.0.5a-d 10006 + * 1.0.5e-r 10100 (not source compatible) + * 1.0.5s-v 10006 (not binary compatible) + * 1.0.6 (+ 3 patches) 10006 (still binary incompatible) + * 1.0.6d-f 10007 (still binary incompatible) + * 1.0.6g 10007 + * 1.0.6h 10007 10.6h (testing xy.z so-numbering) + * 1.0.6i 10007 10.6i + * 1.0.6j 10007 2.1.0.6j (incompatible with 1.0.0) + * 1.0.7beta11-14 DLLNUM 10007 2.1.0.7beta11-14 (binary compatible) + * 1.0.7beta15-18 1 10007 2.1.0.7beta15-18 (binary compatible) + * 1.0.7rc1-2 1 10007 2.1.0.7rc1-2 (binary compatible) + * 1.0.7 1 10007 (still compatible) + * 1.0.8beta1-4 1 10008 2.1.0.8beta1-4 + * 1.0.8rc1 1 10008 2.1.0.8rc1 + * 1.0.8 1 10008 2.1.0.8 + * 1.0.9beta1-6 1 10009 2.1.0.9beta1-6 + * 1.0.9rc1 1 10009 2.1.0.9rc1 + * 1.0.9beta7-10 1 10009 2.1.0.9beta7-10 + * 1.0.9rc2 1 10009 2.1.0.9rc2 + * 1.0.9 1 10009 2.1.0.9 + * 1.0.10beta1 1 10010 2.1.0.10beta1 + * 1.0.10rc1 1 10010 2.1.0.10rc1 + * 1.0.10 1 10010 2.1.0.10 + * 1.0.11beta1-3 1 10011 2.1.0.11beta1-3 + * 1.0.11rc1 1 10011 2.1.0.11rc1 + * 1.0.11 1 10011 2.1.0.11 + * 1.0.12beta1-2 2 10012 2.1.0.12beta1-2 + * 1.0.12rc1 2 10012 2.1.0.12rc1 + * 1.0.12 2 10012 2.1.0.12 + * 1.1.0a-f - 10100 2.1.1.0a-f (branch abandoned) + * 1.2.0beta1-2 2 10200 2.1.2.0beta1-2 + * 1.2.0beta3-5 3 10200 3.1.2.0beta3-5 + * 1.2.0rc1 3 10200 3.1.2.0rc1 + * 1.2.0 3 10200 3.1.2.0 + * 1.2.1beta1-4 3 10201 3.1.2.1beta1-4 + * 1.2.1rc1-2 3 10201 3.1.2.1rc1-2 + * 1.2.1 3 10201 3.1.2.1 + * 1.2.2beta1-6 12 10202 12.so.0.1.2.2beta1-6 + * 1.0.13beta1 10 10013 10.so.0.1.0.13beta1 + * 1.0.13rc1 10 10013 10.so.0.1.0.13rc1 + * 1.2.2rc1 12 10202 12.so.0.1.2.2rc1 + * 1.0.13 10 10013 10.so.0.1.0.13 + * 1.2.2 12 10202 12.so.0.1.2.2 + * 1.2.3rc1-6 12 10203 12.so.0.1.2.3rc1-6 + * 1.2.3 12 10203 12.so.0.1.2.3 + * 1.2.4beta1-3 13 10204 12.so.0.1.2.4beta1-3 + * 1.0.14rc1 13 10014 10.so.0.1.0.14rc1 + * 1.2.4rc1 13 10204 12.so.0.1.2.4rc1 + * 1.0.14 10 10014 10.so.0.1.0.14 + * 1.2.4 13 10204 12.so.0.1.2.4 + * 1.2.5beta1-2 13 10205 12.so.0.1.2.5beta1-2 + * 1.0.15rc1-3 10 10015 10.so.0.1.0.15rc1-3 + * 1.2.5rc1-3 13 10205 12.so.0.1.2.5rc1-3 + * 1.0.15 10 10015 10.so.0.1.0.15 + * 1.2.5 13 10205 12.so.0.1.2.5 + * 1.2.6beta1-4 13 10206 12.so.0.1.2.6beta1-4 + * 1.0.16 10 10016 10.so.0.1.0.16 + * 1.2.6 13 10206 12.so.0.1.2.6 + * 1.2.7beta1-2 13 10207 12.so.0.1.2.7beta1-2 + * 1.0.17rc1 10 10017 10.so.0.1.0.17rc1 + * 1.2.7rc1 13 10207 12.so.0.1.2.7rc1 + * 1.0.17 10 10017 10.so.0.1.0.17 + * 1.2.7 13 10207 12.so.0.1.2.7 + * 1.2.8beta1-5 13 10208 12.so.0.1.2.8beta1-5 + * 1.0.18rc1-5 10 10018 10.so.0.1.0.18rc1-5 + * 1.2.8rc1-5 13 10208 12.so.0.1.2.8rc1-5 + * 1.0.18 10 10018 10.so.0.1.0.18 + * 1.2.8 13 10208 12.so.0.1.2.8 + * 1.2.9beta1-3 13 10209 12.so.0.1.2.9beta1-3 + * 1.2.9beta4-11 13 10209 12.so.0.9[.0] + * 1.2.9rc1 13 10209 12.so.0.9[.0] + * 1.2.9 13 10209 12.so.0.9[.0] + * 1.2.10beta1-8 13 10210 12.so.0.10[.0] + * 1.2.10rc1-3 13 10210 12.so.0.10[.0] + * 1.2.10 13 10210 12.so.0.10[.0] + * 1.2.11beta1-4 13 10211 12.so.0.11[.0] + * 1.0.19rc1-5 10 10019 10.so.0.19[.0] + * 1.2.11rc1-5 13 10211 12.so.0.11[.0] + * 1.0.19 10 10019 10.so.0.19[.0] + * 1.2.11 13 10211 12.so.0.11[.0] + * 1.0.20 10 10020 10.so.0.20[.0] + * 1.2.12 13 10212 12.so.0.12[.0] + * 1.2.13beta1 13 10213 12.so.0.13[.0] + * 1.0.21 10 10021 10.so.0.21[.0] + * 1.2.13 13 10213 12.so.0.13[.0] + * 1.2.14beta1-2 13 10214 12.so.0.14[.0] + * 1.0.22rc1 10 10022 10.so.0.22[.0] + * 1.2.14rc1 13 10214 12.so.0.14[.0] + * 1.0.22 10 10022 10.so.0.22[.0] + * 1.2.14 13 10214 12.so.0.14[.0] + * 1.2.15beta1-6 13 10215 12.so.0.15[.0] + * 1.0.23rc1-5 10 10023 10.so.0.23[.0] + * 1.2.15rc1-5 13 10215 12.so.0.15[.0] + * 1.0.23 10 10023 10.so.0.23[.0] + * 1.2.15 13 10215 12.so.0.15[.0] + * 1.2.16beta1-2 13 10216 12.so.0.16[.0] + * 1.2.16rc1 13 10216 12.so.0.16[.0] + * 1.0.24 10 10024 10.so.0.24[.0] + * 1.2.16 13 10216 12.so.0.16[.0] + * 1.2.17beta1-2 13 10217 12.so.0.17[.0] + * 1.0.25rc1 10 10025 10.so.0.25[.0] + * 1.2.17rc1-3 13 10217 12.so.0.17[.0] + * 1.0.25 10 10025 10.so.0.25[.0] + * 1.2.17 13 10217 12.so.0.17[.0] + * 1.0.26 10 10026 10.so.0.26[.0] + * 1.2.18 13 10218 12.so.0.18[.0] + * 1.2.19beta1-31 13 10219 12.so.0.19[.0] + * 1.0.27rc1-6 10 10027 10.so.0.27[.0] + * 1.2.19rc1-6 13 10219 12.so.0.19[.0] + * 1.0.27 10 10027 10.so.0.27[.0] + * 1.2.19 13 10219 12.so.0.19[.0] + * 1.2.20beta01-04 13 10220 12.so.0.20[.0] + * 1.0.28rc1-6 10 10028 10.so.0.28[.0] + * 1.2.20rc1-6 13 10220 12.so.0.20[.0] + * 1.0.28 10 10028 10.so.0.28[.0] + * 1.2.20 13 10220 12.so.0.20[.0] + * 1.2.21beta1-2 13 10221 12.so.0.21[.0] + * 1.2.21rc1-3 13 10221 12.so.0.21[.0] + * 1.0.29 10 10029 10.so.0.29[.0] + * 1.2.21 13 10221 12.so.0.21[.0] + * 1.2.22beta1-4 13 10222 12.so.0.22[.0] + * 1.0.30rc1 10 10030 10.so.0.30[.0] + * 1.2.22rc1 13 10222 12.so.0.22[.0] + * 1.0.30 10 10030 10.so.0.30[.0] + * 1.2.22 13 10222 12.so.0.22[.0] + * 1.2.23beta01-05 13 10223 12.so.0.23[.0] + * 1.2.23rc01 13 10223 12.so.0.23[.0] + * 1.2.23 13 10223 12.so.0.23[.0] + * 1.2.24beta01-02 13 10224 12.so.0.24[.0] + * 1.2.24rc01 13 10224 12.so.0.24[.0] + * 1.2.24 13 10224 12.so.0.24[.0] + * 1.2.25beta01-06 13 10225 12.so.0.25[.0] + * 1.2.25rc01-02 13 10225 12.so.0.25[.0] + * 1.0.31 10 10031 10.so.0.31[.0] + * 1.2.25 13 10225 12.so.0.25[.0] + * 1.2.26beta01-06 13 10226 12.so.0.26[.0] + * 1.2.26rc01 13 10226 12.so.0.26[.0] + * 1.2.26 13 10226 12.so.0.26[.0] + * 1.0.32 10 10032 10.so.0.32[.0] + * 1.2.27beta01-06 13 10227 12.so.0.27[.0] + * 1.2.27rc01 13 10227 12.so.0.27[.0] + * 1.0.33 10 10033 10.so.0.33[.0] + * 1.2.27 13 10227 12.so.0.27[.0] + * 1.0.34 10 10034 10.so.0.34[.0] + * 1.2.28 13 10228 12.so.0.28[.0] + * 1.2.29beta01-03 13 10229 12.so.0.29[.0] + * 1.2.29rc01 13 10229 12.so.0.29[.0] + * 1.0.35 10 10035 10.so.0.35[.0] + * 1.2.29 13 10229 12.so.0.29[.0] + * + * Henceforth the source version will match the shared-library major + * and minor numbers; the shared-library major version number will be + * used for changes in backward compatibility, as it is intended. The + * PNG_LIBPNG_VER macro, which is not used within libpng but is available + * for applications, is an unsigned integer of the form xyyzz corresponding + * to the source version x.y.z (leading zeros in y and z). Beta versions + * were given the previous public release number plus a letter, until + * version 1.0.6j; from then on they were given the upcoming public + * release number plus "betaNN" or "rcNN". + * + * Binary incompatibility exists only when applications make direct access + * to the info_ptr or png_ptr members through png.h, and the compiled + * application is loaded with a different version of the library. + * + * DLLNUM will change each time there are forward or backward changes + * in binary compatibility (e.g., when a new feature is added). + * + * See libpng.txt or libpng.3 for more information. The PNG specification + * is available as a W3C Recommendation and as an ISO Specification, + * defines should NOT be changed. + */ +#define PNG_INFO_gAMA 0x0001 +#define PNG_INFO_sBIT 0x0002 +#define PNG_INFO_cHRM 0x0004 +#define PNG_INFO_PLTE 0x0008 +#define PNG_INFO_tRNS 0x0010 +#define PNG_INFO_bKGD 0x0020 +#define PNG_INFO_hIST 0x0040 +#define PNG_INFO_pHYs 0x0080 +#define PNG_INFO_oFFs 0x0100 +#define PNG_INFO_tIME 0x0200 +#define PNG_INFO_pCAL 0x0400 +#define PNG_INFO_sRGB 0x0800 /* GR-P, 0.96a */ +#define PNG_INFO_iCCP 0x1000 /* ESR, 1.0.6 */ +#define PNG_INFO_sPLT 0x2000 /* ESR, 1.0.6 */ +#define PNG_INFO_sCAL 0x4000 /* ESR, 1.0.6 */ +#define PNG_INFO_IDAT 0x8000L /* ESR, 1.0.6 */ + +/* This is used for the transformation routines, as some of them + * change these values for the row. It also should enable using + * the routines for other purposes. + */ +typedef struct png_row_info_struct +{ + png_uint_32 width; /* width of row */ + png_uint_32 rowbytes; /* number of bytes in row */ + png_byte color_type; /* color type of row */ + png_byte bit_depth; /* bit depth of row */ + png_byte channels; /* number of channels (1, 2, 3, or 4) */ + png_byte pixel_depth; /* bits per pixel (depth * channels) */ +} png_row_info; + +typedef png_row_info FAR * png_row_infop; +typedef png_row_info FAR * FAR * png_row_infopp; + +/* These are the function types for the I/O functions and for the functions + * that allow the user to override the default I/O functions with his or her + * own. The png_error_ptr type should match that of user-supplied warning + * and error functions, while the png_rw_ptr type should match that of the + * user read/write data functions. + */ +typedef struct png_struct_def png_struct; +typedef png_struct FAR * png_structp; + +typedef void (PNGAPI *png_error_ptr) PNGARG((png_structp, png_const_charp)); +typedef void (PNGAPI *png_rw_ptr) PNGARG((png_structp, png_bytep, png_size_t)); +typedef void (PNGAPI *png_flush_ptr) PNGARG((png_structp)); +typedef void (PNGAPI *png_read_status_ptr) PNGARG((png_structp, png_uint_32, + int)); +typedef void (PNGAPI *png_write_status_ptr) PNGARG((png_structp, png_uint_32, + int)); + +#ifdef PNG_PROGRESSIVE_READ_SUPPORTED +typedef void (PNGAPI *png_progressive_info_ptr) PNGARG((png_structp, png_infop)); +typedef void (PNGAPI *png_progressive_end_ptr) PNGARG((png_structp, png_infop)); +typedef void (PNGAPI *png_progressive_row_ptr) PNGARG((png_structp, png_bytep, + png_uint_32, int)); +#endif + +#if defined(PNG_READ_USER_TRANSFORM_SUPPORTED) || \ + defined(PNG_WRITE_USER_TRANSFORM_SUPPORTED) || \ + defined(PNG_LEGACY_SUPPORTED) +typedef void (PNGAPI *png_user_transform_ptr) PNGARG((png_structp, + png_row_infop, png_bytep)); +#endif + +#if defined(PNG_USER_CHUNKS_SUPPORTED) +typedef int (PNGAPI *png_user_chunk_ptr) PNGARG((png_structp, png_unknown_chunkp)); +#endif +#if defined(PNG_UNKNOWN_CHUNKS_SUPPORTED) +typedef void (PNGAPI *png_unknown_chunk_ptr) PNGARG((png_structp)); +#endif + +/* Transform masks for the high-level interface */ +#define PNG_TRANSFORM_IDENTITY 0x0000 /* read and write */ +#define PNG_TRANSFORM_STRIP_16 0x0001 /* read only */ +#define PNG_TRANSFORM_STRIP_ALPHA 0x0002 /* read only */ +#define PNG_TRANSFORM_PACKING 0x0004 /* read and write */ +#define PNG_TRANSFORM_PACKSWAP 0x0008 /* read and write */ +#define PNG_TRANSFORM_EXPAND 0x0010 /* read only */ +#define PNG_TRANSFORM_INVERT_MONO 0x0020 /* read and write */ +#define PNG_TRANSFORM_SHIFT 0x0040 /* read and write */ +#define PNG_TRANSFORM_BGR 0x0080 /* read and write */ +#define PNG_TRANSFORM_SWAP_ALPHA 0x0100 /* read and write */ +#define PNG_TRANSFORM_SWAP_ENDIAN 0x0200 /* read and write */ +#define PNG_TRANSFORM_INVERT_ALPHA 0x0400 /* read and write */ +#define PNG_TRANSFORM_STRIP_FILLER 0x0800 /* WRITE only */ + +/* Flags for MNG supported features */ +#define PNG_FLAG_MNG_EMPTY_PLTE 0x01 +#define PNG_FLAG_MNG_FILTER_64 0x04 +#define PNG_ALL_MNG_FEATURES 0x05 + +typedef png_voidp (*png_malloc_ptr) PNGARG((png_structp, png_size_t)); +typedef void (*png_free_ptr) PNGARG((png_structp, png_voidp)); + +/* The structure that holds the information to read and write PNG files. + * The only people who need to care about what is inside of this are the + * people who will be modifying the library for their own special needs. + * It should NOT be accessed directly by an application, except to store + * the jmp_buf. + */ + +struct png_struct_def +{ +#ifdef PNG_SETJMP_SUPPORTED + jmp_buf jmpbuf; /* used in png_error */ +#endif + png_error_ptr error_fn; /* function for printing errors and aborting */ + png_error_ptr warning_fn; /* function for printing warnings */ + png_voidp error_ptr; /* user supplied struct for error functions */ + png_rw_ptr write_data_fn; /* function for writing output data */ + png_rw_ptr read_data_fn; /* function for reading input data */ + png_voidp io_ptr; /* ptr to application struct for I/O functions */ + +#if defined(PNG_READ_USER_TRANSFORM_SUPPORTED) + png_user_transform_ptr read_user_transform_fn; /* user read transform */ +#endif + +#if defined(PNG_WRITE_USER_TRANSFORM_SUPPORTED) + png_user_transform_ptr write_user_transform_fn; /* user write transform */ +#endif + +/* These were added in libpng-1.0.2 */ +#if defined(PNG_USER_TRANSFORM_PTR_SUPPORTED) +#if defined(PNG_READ_USER_TRANSFORM_SUPPORTED) || \ + defined(PNG_WRITE_USER_TRANSFORM_SUPPORTED) + png_voidp user_transform_ptr; /* user supplied struct for user transform */ + png_byte user_transform_depth; /* bit depth of user transformed pixels */ + png_byte user_transform_channels; /* channels in user transformed pixels */ +#endif +#endif + + png_uint_32 mode; /* tells us where we are in the PNG file */ + png_uint_32 flags; /* flags indicating various things to libpng */ + png_uint_32 transformations; /* which transformations to perform */ + + z_stream zstream; /* pointer to decompression structure (below) */ + png_bytep zbuf; /* buffer for zlib */ + png_size_t zbuf_size; /* size of zbuf */ + int zlib_level; /* holds zlib compression level */ + int zlib_method; /* holds zlib compression method */ + int zlib_window_bits; /* holds zlib compression window bits */ + int zlib_mem_level; /* holds zlib compression memory level */ + int zlib_strategy; /* holds zlib compression strategy */ + + png_uint_32 width; /* width of image in pixels */ + png_uint_32 height; /* height of image in pixels */ + png_uint_32 num_rows; /* number of rows in current pass */ + png_uint_32 usr_width; /* width of row at start of write */ + png_uint_32 rowbytes; /* size of row in bytes */ + png_uint_32 irowbytes; /* size of current interlaced row in bytes */ + png_uint_32 iwidth; /* width of current interlaced row in pixels */ + png_uint_32 row_number; /* current row in interlace pass */ + png_bytep prev_row; /* buffer to save previous (unfiltered) row */ + png_bytep row_buf; /* buffer to save current (unfiltered) row */ +#ifndef PNG_NO_WRITE_FILTERING + png_bytep sub_row; /* buffer to save "sub" row when filtering */ + png_bytep up_row; /* buffer to save "up" row when filtering */ + png_bytep avg_row; /* buffer to save "avg" row when filtering */ + png_bytep paeth_row; /* buffer to save "Paeth" row when filtering */ +#endif + png_row_info row_info; /* used for transformation routines */ + + png_uint_32 idat_size; /* current IDAT size for read */ + png_uint_32 crc; /* current chunk CRC value */ + png_colorp palette; /* palette from the input file */ + png_uint_16 num_palette; /* number of color entries in palette */ + png_uint_16 num_trans; /* number of transparency values */ + png_byte chunk_name[5]; /* null-terminated name of current chunk */ + png_byte compression; /* file compression type (always 0) */ + png_byte filter; /* file filter type (always 0) */ + png_byte interlaced; /* PNG_INTERLACE_NONE, PNG_INTERLACE_ADAM7 */ + png_byte pass; /* current interlace pass (0 - 6) */ + png_byte do_filter; /* row filter flags (see PNG_FILTER_ below ) */ + png_byte color_type; /* color type of file */ + png_byte bit_depth; /* bit depth of file */ + png_byte usr_bit_depth; /* bit depth of users row */ + png_byte pixel_depth; /* number of bits per pixel */ + png_byte channels; /* number of channels in file */ + png_byte usr_channels; /* channels at start of write */ + png_byte sig_bytes; /* magic bytes read/written from start of file */ + +#if defined(PNG_READ_FILLER_SUPPORTED) || defined(PNG_WRITE_FILLER_SUPPORTED) +#ifdef PNG_LEGACY_SUPPORTED + png_byte filler; /* filler byte for pixel expansion */ +#else + png_uint_16 filler; /* filler bytes for pixel expansion */ +#endif +#endif + +#if defined(PNG_bKGD_SUPPORTED) + png_byte background_gamma_type; +# ifdef PNG_FLOATING_POINT_SUPPORTED + float background_gamma; +# endif + png_color_16 background; /* background color in screen gamma space */ +#if defined(PNG_READ_GAMMA_SUPPORTED) + png_color_16 background_1; /* background normalized to gamma 1.0 */ +#endif +#endif /* PNG_bKGD_SUPPORTED */ + +#if defined(PNG_WRITE_FLUSH_SUPPORTED) + png_flush_ptr output_flush_fn;/* Function for flushing output */ + png_uint_32 flush_dist; /* how many rows apart to flush, 0 - no flush */ + png_uint_32 flush_rows; /* number of rows written since last flush */ +#endif + +#if defined(PNG_READ_GAMMA_SUPPORTED) || defined(PNG_READ_BACKGROUND_SUPPORTED) + int gamma_shift; /* number of "insignificant" bits 16-bit gamma */ +#ifdef PNG_FLOATING_POINT_SUPPORTED + float gamma; /* file gamma value */ + float screen_gamma; /* screen gamma value (display_exponent) */ +#endif +#endif + +#if defined(PNG_READ_GAMMA_SUPPORTED) || defined(PNG_READ_BACKGROUND_SUPPORTED) + png_bytep gamma_table; /* gamma table for 8-bit depth files */ + png_bytep gamma_from_1; /* converts from 1.0 to screen */ + png_bytep gamma_to_1; /* converts from file to 1.0 */ + png_uint_16pp gamma_16_table; /* gamma table for 16-bit depth files */ + png_uint_16pp gamma_16_from_1; /* converts from 1.0 to screen */ + png_uint_16pp gamma_16_to_1; /* converts from file to 1.0 */ +#endif + +#if defined(PNG_READ_GAMMA_SUPPORTED) || defined(PNG_sBIT_SUPPORTED) + png_color_8 sig_bit; /* significant bits in each available channel */ +#endif + +#if defined(PNG_READ_SHIFT_SUPPORTED) || defined(PNG_WRITE_SHIFT_SUPPORTED) + png_color_8 shift; /* shift for significant bit tranformation */ +#endif + +#if defined(PNG_tRNS_SUPPORTED) || defined(PNG_READ_BACKGROUND_SUPPORTED) \ + || defined(PNG_READ_EXPAND_SUPPORTED) || defined(PNG_READ_BACKGROUND_SUPPORTED) + png_bytep trans; /* transparency values for paletted files */ + png_color_16 trans_values; /* transparency values for non-paletted files */ +#endif + + png_read_status_ptr read_row_fn; /* called after each row is decoded */ + png_write_status_ptr write_row_fn; /* called after each row is encoded */ +#ifdef PNG_PROGRESSIVE_READ_SUPPORTED + png_progressive_info_ptr info_fn; /* called after header data fully read */ + png_progressive_row_ptr row_fn; /* called after each prog. row is decoded */ + png_progressive_end_ptr end_fn; /* called after image is complete */ + png_bytep save_buffer_ptr; /* current location in save_buffer */ + png_bytep save_buffer; /* buffer for previously read data */ + png_bytep current_buffer_ptr; /* current location in current_buffer */ + png_bytep current_buffer; /* buffer for recently used data */ + png_uint_32 push_length; /* size of current input chunk */ + png_uint_32 skip_length; /* bytes to skip in input data */ + png_size_t save_buffer_size; /* amount of data now in save_buffer */ + png_size_t save_buffer_max; /* total size of save_buffer */ + png_size_t buffer_size; /* total amount of available input data */ + png_size_t current_buffer_size; /* amount of data now in current_buffer */ + int process_mode; /* what push library is currently doing */ + int cur_palette; /* current push library palette index */ + +# if defined(PNG_TEXT_SUPPORTED) + png_size_t current_text_size; /* current size of text input data */ + png_size_t current_text_left; /* how much text left to read in input */ + png_charp current_text; /* current text chunk buffer */ + png_charp current_text_ptr; /* current location in current_text */ +# endif /* PNG_TEXT_SUPPORTED */ +#endif /* PNG_PROGRESSIVE_READ_SUPPORTED */ + +#if defined(__TURBOC__) && !defined(_Windows) && !defined(__FLAT__) +/* for the Borland special 64K segment handler */ + png_bytepp offset_table_ptr; + png_bytep offset_table; + png_uint_16 offset_table_number; + png_uint_16 offset_table_count; + png_uint_16 offset_table_count_free; +#endif + +#if defined(PNG_READ_DITHER_SUPPORTED) + png_bytep palette_lookup; /* lookup table for dithering */ + png_bytep dither_index; /* index translation for palette files */ +#endif + +#if defined(PNG_READ_DITHER_SUPPORTED) || defined(PNG_hIST_SUPPORTED) + png_uint_16p hist; /* histogram */ +#endif + +#if defined(PNG_WRITE_WEIGHTED_FILTER_SUPPORTED) + png_byte heuristic_method; /* heuristic for row filter selection */ + png_byte num_prev_filters; /* number of weights for previous rows */ + png_bytep prev_filters; /* filter type(s) of previous row(s) */ + png_uint_16p filter_weights; /* weight(s) for previous line(s) */ + png_uint_16p inv_filter_weights; /* 1/weight(s) for previous line(s) */ + png_uint_16p filter_costs; /* relative filter calculation cost */ + png_uint_16p inv_filter_costs; /* 1/relative filter calculation cost */ +#endif + +#if defined(PNG_TIME_RFC1123_SUPPORTED) + png_charp time_buffer; /* String to hold RFC 1123 time text */ +#endif + +/* New members added in libpng-1.0.6 */ + +#ifdef PNG_FREE_ME_SUPPORTED + png_uint_32 free_me; /* flags items libpng is responsible for freeing */ +#endif + +#if defined(PNG_USER_CHUNKS_SUPPORTED) + png_voidp user_chunk_ptr; + png_user_chunk_ptr read_user_chunk_fn; /* user read chunk handler */ +#endif + +#if defined(PNG_UNKNOWN_CHUNKS_SUPPORTED) + int num_chunk_list; + png_bytep chunk_list; +#endif + +/* New members added in libpng-1.0.3 */ +#if defined(PNG_READ_RGB_TO_GRAY_SUPPORTED) + png_byte rgb_to_gray_status; + /* These were changed from png_byte in libpng-1.0.6 */ + png_uint_16 rgb_to_gray_red_coeff; + png_uint_16 rgb_to_gray_green_coeff; + png_uint_16 rgb_to_gray_blue_coeff; +#endif + +/* New member added in libpng-1.0.4 (renamed in 1.0.9) */ +#if defined(PNG_MNG_FEATURES_SUPPORTED) || \ + defined(PNG_READ_EMPTY_PLTE_SUPPORTED) || \ + defined(PNG_WRITE_EMPTY_PLTE_SUPPORTED) +/* changed from png_byte to png_uint_32 at version 1.2.0 */ +#ifdef PNG_1_0_X + png_byte mng_features_permitted; +#else + png_uint_32 mng_features_permitted; +#endif /* PNG_1_0_X */ +#endif + +/* New member added in libpng-1.0.7 */ +#if defined(PNG_READ_GAMMA_SUPPORTED) || defined(PNG_READ_BACKGROUND_SUPPORTED) + png_fixed_point int_gamma; +#endif + +/* New member added in libpng-1.0.9, ifdef'ed out in 1.0.12, enabled in 1.2.0 */ +#if defined(PNG_MNG_FEATURES_SUPPORTED) + png_byte filter_type; +#endif + +#if defined(PNG_1_0_X) +/* New member added in libpng-1.0.10, ifdef'ed out in 1.2.0 */ + png_uint_32 row_buf_size; +#endif + +/* New members added in libpng-1.2.0 */ +#if defined(PNG_ASSEMBLER_CODE_SUPPORTED) +# if !defined(PNG_1_0_X) +# if defined(PNG_MMX_CODE_SUPPORTED) + png_byte mmx_bitdepth_threshold; + png_uint_32 mmx_rowbytes_threshold; +# endif + png_uint_32 asm_flags; +# endif +#endif + +/* New members added in libpng-1.0.2 but first enabled by default in 1.2.0 */ +#ifdef PNG_USER_MEM_SUPPORTED + png_voidp mem_ptr; /* user supplied struct for mem functions */ + png_malloc_ptr malloc_fn; /* function for allocating memory */ + png_free_ptr free_fn; /* function for freeing memory */ +#endif + +/* New member added in libpng-1.0.13 and 1.2.0 */ + png_bytep big_row_buf; /* buffer to save current (unfiltered) row */ + +#if defined(PNG_READ_DITHER_SUPPORTED) +/* The following three members were added at version 1.0.14 and 1.2.4 */ + png_bytep dither_sort; /* working sort array */ + png_bytep index_to_palette; /* where the original index currently is */ + /* in the palette */ + png_bytep palette_to_index; /* which original index points to this */ + /* palette color */ +#endif + +/* New members added in libpng-1.0.16 and 1.2.6 */ + png_byte compression_type; + +#ifdef PNG_SET_USER_LIMITS_SUPPORTED + png_uint_32 user_width_max; + png_uint_32 user_height_max; +#endif + +/* New member added in libpng-1.0.25 and 1.2.17 */ +#if defined(PNG_UNKNOWN_CHUNKS_SUPPORTED) + /* storage for unknown chunk that the library doesn't recognize. */ + png_unknown_chunk unknown_chunk; +#endif + +/* New members added in libpng-1.2.26 */ + png_uint_32 old_big_row_buf_size, old_prev_row_size; +}; + + +/* This triggers a compiler error in png.c, if png.c and png.h + * do not agree upon the version number. + */ +typedef png_structp version_1_2_29; + +typedef png_struct FAR * FAR * png_structpp; + +/* Here are the function definitions most commonly used. This is not + * the place to find out how to use libpng. See libpng.txt for the + * full explanation, see example.c for the summary. This just provides + * a simple one line description of the use of each function. + */ + +/* Returns the version number of the library */ +extern PNG_EXPORT(png_uint_32,png_access_version_number) PNGARG((void)); + +/* Tell lib we have already handled the first magic bytes. + * Handling more than 8 bytes from the beginning of the file is an error. + */ +extern PNG_EXPORT(void,png_set_sig_bytes) PNGARG((png_structp png_ptr, + int num_bytes)); + +/* Check sig[start] through sig[start + num_to_check - 1] to see if it's a + * PNG file. Returns zero if the supplied bytes match the 8-byte PNG + * signature, and non-zero otherwise. Having num_to_check == 0 or + * start > 7 will always fail (ie return non-zero). + */ +extern PNG_EXPORT(int,png_sig_cmp) PNGARG((png_bytep sig, png_size_t start, + png_size_t num_to_check)); + +/* Simple signature checking function. This is the same as calling + * png_check_sig(sig, n) := !png_sig_cmp(sig, 0, n). + */ +extern PNG_EXPORT(int,png_check_sig) PNGARG((png_bytep sig, int num)); + +/* Allocate and initialize png_ptr struct for reading, and any other memory. */ +extern PNG_EXPORT(png_structp,png_create_read_struct) + PNGARG((png_const_charp user_png_ver, png_voidp error_ptr, + png_error_ptr error_fn, png_error_ptr warn_fn)); + +/* Allocate and initialize png_ptr struct for writing, and any other memory */ +extern PNG_EXPORT(png_structp,png_create_write_struct) + PNGARG((png_const_charp user_png_ver, png_voidp error_ptr, + png_error_ptr error_fn, png_error_ptr warn_fn)); + +#ifdef PNG_WRITE_SUPPORTED +extern PNG_EXPORT(png_uint_32,png_get_compression_buffer_size) + PNGARG((png_structp png_ptr)); +#endif + +#ifdef PNG_WRITE_SUPPORTED +extern PNG_EXPORT(void,png_set_compression_buffer_size) + PNGARG((png_structp png_ptr, png_uint_32 size)); +#endif + +/* Reset the compression stream */ +extern PNG_EXPORT(int,png_reset_zstream) PNGARG((png_structp png_ptr)); + +/* New functions added in libpng-1.0.2 (not enabled by default until 1.2.0) */ +#ifdef PNG_USER_MEM_SUPPORTED +extern PNG_EXPORT(png_structp,png_create_read_struct_2) + PNGARG((png_const_charp user_png_ver, png_voidp error_ptr, + png_error_ptr error_fn, png_error_ptr warn_fn, png_voidp mem_ptr, + png_malloc_ptr malloc_fn, png_free_ptr free_fn)); +extern PNG_EXPORT(png_structp,png_create_write_struct_2) + PNGARG((png_const_charp user_png_ver, png_voidp error_ptr, + png_error_ptr error_fn, png_error_ptr warn_fn, png_voidp mem_ptr, + png_malloc_ptr malloc_fn, png_free_ptr free_fn)); +#endif + +/* Write a PNG chunk - size, type, (optional) data, CRC. */ +extern PNG_EXPORT(void,png_write_chunk) PNGARG((png_structp png_ptr, + png_bytep chunk_name, png_bytep data, png_size_t length)); + +/* Write the start of a PNG chunk - length and chunk name. */ +extern PNG_EXPORT(void,png_write_chunk_start) PNGARG((png_structp png_ptr, + png_bytep chunk_name, png_uint_32 length)); + +/* Write the data of a PNG chunk started with png_write_chunk_start(). */ +extern PNG_EXPORT(void,png_write_chunk_data) PNGARG((png_structp png_ptr, + png_bytep data, png_size_t length)); + +/* Finish a chunk started with png_write_chunk_start() (includes CRC). */ +extern PNG_EXPORT(void,png_write_chunk_end) PNGARG((png_structp png_ptr)); + +/* Allocate and initialize the info structure */ +extern PNG_EXPORT(png_infop,png_create_info_struct) + PNGARG((png_structp png_ptr)); + +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +/* Initialize the info structure (old interface - DEPRECATED) */ +extern PNG_EXPORT(void,png_info_init) PNGARG((png_infop info_ptr)); +#undef png_info_init +#define png_info_init(info_ptr) png_info_init_3(&info_ptr,\ + png_sizeof(png_info)); +#endif + +extern PNG_EXPORT(void,png_info_init_3) PNGARG((png_infopp info_ptr, + png_size_t png_info_struct_size)); + +/* Writes all the PNG information before the image. */ +extern PNG_EXPORT(void,png_write_info_before_PLTE) PNGARG((png_structp png_ptr, + png_infop info_ptr)); +extern PNG_EXPORT(void,png_write_info) PNGARG((png_structp png_ptr, + png_infop info_ptr)); + +#ifndef PNG_NO_SEQUENTIAL_READ_SUPPORTED +/* read the information before the actual image data. */ +extern PNG_EXPORT(void,png_read_info) PNGARG((png_structp png_ptr, + png_infop info_ptr)); +#endif + +#if defined(PNG_TIME_RFC1123_SUPPORTED) +extern PNG_EXPORT(png_charp,png_convert_to_rfc1123) + PNGARG((png_structp png_ptr, png_timep ptime)); +#endif + +#if !defined(_WIN32_WCE) +/* "time.h" functions are not supported on WindowsCE */ +#if defined(PNG_WRITE_tIME_SUPPORTED) +/* convert from a struct tm to png_time */ +extern PNG_EXPORT(void,png_convert_from_struct_tm) PNGARG((png_timep ptime, + struct tm FAR * ttime)); + +/* convert from time_t to png_time. Uses gmtime() */ +extern PNG_EXPORT(void,png_convert_from_time_t) PNGARG((png_timep ptime, + time_t ttime)); +#endif /* PNG_WRITE_tIME_SUPPORTED */ +#endif /* _WIN32_WCE */ + +#if defined(PNG_READ_EXPAND_SUPPORTED) +/* Expand data to 24-bit RGB, or 8-bit grayscale, with alpha if available. */ +extern PNG_EXPORT(void,png_set_expand) PNGARG((png_structp png_ptr)); +#if !defined(PNG_1_0_X) +extern PNG_EXPORT(void,png_set_expand_gray_1_2_4_to_8) PNGARG((png_structp + png_ptr)); +#endif +extern PNG_EXPORT(void,png_set_palette_to_rgb) PNGARG((png_structp png_ptr)); +extern PNG_EXPORT(void,png_set_tRNS_to_alpha) PNGARG((png_structp png_ptr)); +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +/* Deprecated */ +extern PNG_EXPORT(void,png_set_gray_1_2_4_to_8) PNGARG((png_structp png_ptr)); +#endif +#endif + +#if defined(PNG_READ_BGR_SUPPORTED) || defined(PNG_WRITE_BGR_SUPPORTED) +/* Use blue, green, red order for pixels. */ +extern PNG_EXPORT(void,png_set_bgr) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_GRAY_TO_RGB_SUPPORTED) +/* Expand the grayscale to 24-bit RGB if necessary. */ +extern PNG_EXPORT(void,png_set_gray_to_rgb) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_RGB_TO_GRAY_SUPPORTED) +/* Reduce RGB to grayscale. */ +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(void,png_set_rgb_to_gray) PNGARG((png_structp png_ptr, + int error_action, double red, double green )); +#endif +extern PNG_EXPORT(void,png_set_rgb_to_gray_fixed) PNGARG((png_structp png_ptr, + int error_action, png_fixed_point red, png_fixed_point green )); +extern PNG_EXPORT(png_byte,png_get_rgb_to_gray_status) PNGARG((png_structp + png_ptr)); +#endif + +extern PNG_EXPORT(void,png_build_grayscale_palette) PNGARG((int bit_depth, + png_colorp palette)); + +#if defined(PNG_READ_STRIP_ALPHA_SUPPORTED) +extern PNG_EXPORT(void,png_set_strip_alpha) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_SWAP_ALPHA_SUPPORTED) || \ + defined(PNG_WRITE_SWAP_ALPHA_SUPPORTED) +extern PNG_EXPORT(void,png_set_swap_alpha) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_INVERT_ALPHA_SUPPORTED) || \ + defined(PNG_WRITE_INVERT_ALPHA_SUPPORTED) +extern PNG_EXPORT(void,png_set_invert_alpha) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_FILLER_SUPPORTED) || defined(PNG_WRITE_FILLER_SUPPORTED) +/* Add a filler byte to 8-bit Gray or 24-bit RGB images. */ +extern PNG_EXPORT(void,png_set_filler) PNGARG((png_structp png_ptr, + png_uint_32 filler, int flags)); +/* The values of the PNG_FILLER_ defines should NOT be changed */ +#define PNG_FILLER_BEFORE 0 +#define PNG_FILLER_AFTER 1 +/* Add an alpha byte to 8-bit Gray or 24-bit RGB images. */ +#if !defined(PNG_1_0_X) +extern PNG_EXPORT(void,png_set_add_alpha) PNGARG((png_structp png_ptr, + png_uint_32 filler, int flags)); +#endif +#endif /* PNG_READ_FILLER_SUPPORTED || PNG_WRITE_FILLER_SUPPORTED */ + +#if defined(PNG_READ_SWAP_SUPPORTED) || defined(PNG_WRITE_SWAP_SUPPORTED) +/* Swap bytes in 16-bit depth files. */ +extern PNG_EXPORT(void,png_set_swap) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_PACK_SUPPORTED) || defined(PNG_WRITE_PACK_SUPPORTED) +/* Use 1 byte per pixel in 1, 2, or 4-bit depth files. */ +extern PNG_EXPORT(void,png_set_packing) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_PACKSWAP_SUPPORTED) || defined(PNG_WRITE_PACKSWAP_SUPPORTED) +/* Swap packing order of pixels in bytes. */ +extern PNG_EXPORT(void,png_set_packswap) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_SHIFT_SUPPORTED) || defined(PNG_WRITE_SHIFT_SUPPORTED) +/* Converts files to legal bit depths. */ +extern PNG_EXPORT(void,png_set_shift) PNGARG((png_structp png_ptr, + png_color_8p true_bits)); +#endif + +#if defined(PNG_READ_INTERLACING_SUPPORTED) || \ + defined(PNG_WRITE_INTERLACING_SUPPORTED) +/* Have the code handle the interlacing. Returns the number of passes. */ +extern PNG_EXPORT(int,png_set_interlace_handling) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_INVERT_SUPPORTED) || defined(PNG_WRITE_INVERT_SUPPORTED) +/* Invert monochrome files */ +extern PNG_EXPORT(void,png_set_invert_mono) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_BACKGROUND_SUPPORTED) +/* Handle alpha and tRNS by replacing with a background color. */ +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(void,png_set_background) PNGARG((png_structp png_ptr, + png_color_16p background_color, int background_gamma_code, + int need_expand, double background_gamma)); +#endif +#define PNG_BACKGROUND_GAMMA_UNKNOWN 0 +#define PNG_BACKGROUND_GAMMA_SCREEN 1 +#define PNG_BACKGROUND_GAMMA_FILE 2 +#define PNG_BACKGROUND_GAMMA_UNIQUE 3 +#endif + +#if defined(PNG_READ_16_TO_8_SUPPORTED) +/* strip the second byte of information from a 16-bit depth file. */ +extern PNG_EXPORT(void,png_set_strip_16) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_DITHER_SUPPORTED) +/* Turn on dithering, and reduce the palette to the number of colors available. */ +extern PNG_EXPORT(void,png_set_dither) PNGARG((png_structp png_ptr, + png_colorp palette, int num_palette, int maximum_colors, + png_uint_16p histogram, int full_dither)); +#endif + +#if defined(PNG_READ_GAMMA_SUPPORTED) +/* Handle gamma correction. Screen_gamma=(display_exponent) */ +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(void,png_set_gamma) PNGARG((png_structp png_ptr, + double screen_gamma, double default_file_gamma)); +#endif +#endif + +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +#if defined(PNG_READ_EMPTY_PLTE_SUPPORTED) || \ + defined(PNG_WRITE_EMPTY_PLTE_SUPPORTED) +/* Permit or disallow empty PLTE (0: not permitted, 1: permitted) */ +/* Deprecated and will be removed. Use png_permit_mng_features() instead. */ +extern PNG_EXPORT(void,png_permit_empty_plte) PNGARG((png_structp png_ptr, + int empty_plte_permitted)); +#endif +#endif + +#if defined(PNG_WRITE_FLUSH_SUPPORTED) +/* Set how many lines between output flushes - 0 for no flushing */ +extern PNG_EXPORT(void,png_set_flush) PNGARG((png_structp png_ptr, int nrows)); +/* Flush the current PNG output buffer */ +extern PNG_EXPORT(void,png_write_flush) PNGARG((png_structp png_ptr)); +#endif + +/* optional update palette with requested transformations */ +extern PNG_EXPORT(void,png_start_read_image) PNGARG((png_structp png_ptr)); + +/* optional call to update the users info structure */ +extern PNG_EXPORT(void,png_read_update_info) PNGARG((png_structp png_ptr, + png_infop info_ptr)); + +#ifndef PNG_NO_SEQUENTIAL_READ_SUPPORTED +/* read one or more rows of image data. */ +extern PNG_EXPORT(void,png_read_rows) PNGARG((png_structp png_ptr, + png_bytepp row, png_bytepp display_row, png_uint_32 num_rows)); +#endif + +#ifndef PNG_NO_SEQUENTIAL_READ_SUPPORTED +/* read a row of data. */ +extern PNG_EXPORT(void,png_read_row) PNGARG((png_structp png_ptr, + png_bytep row, + png_bytep display_row)); +#endif + +#ifndef PNG_NO_SEQUENTIAL_READ_SUPPORTED +/* read the whole image into memory at once. */ +extern PNG_EXPORT(void,png_read_image) PNGARG((png_structp png_ptr, + png_bytepp image)); +#endif + +/* write a row of image data */ +extern PNG_EXPORT(void,png_write_row) PNGARG((png_structp png_ptr, + png_bytep row)); + +/* write a few rows of image data */ +extern PNG_EXPORT(void,png_write_rows) PNGARG((png_structp png_ptr, + png_bytepp row, png_uint_32 num_rows)); + +/* write the image data */ +extern PNG_EXPORT(void,png_write_image) PNGARG((png_structp png_ptr, + png_bytepp image)); + +/* writes the end of the PNG file. */ +extern PNG_EXPORT(void,png_write_end) PNGARG((png_structp png_ptr, + png_infop info_ptr)); + +#ifndef PNG_NO_SEQUENTIAL_READ_SUPPORTED +/* read the end of the PNG file. */ +extern PNG_EXPORT(void,png_read_end) PNGARG((png_structp png_ptr, + png_infop info_ptr)); +#endif + +/* free any memory associated with the png_info_struct */ +extern PNG_EXPORT(void,png_destroy_info_struct) PNGARG((png_structp png_ptr, + png_infopp info_ptr_ptr)); + +/* free any memory associated with the png_struct and the png_info_structs */ +extern PNG_EXPORT(void,png_destroy_read_struct) PNGARG((png_structpp + png_ptr_ptr, png_infopp info_ptr_ptr, png_infopp end_info_ptr_ptr)); + +/* free all memory used by the read (old method - NOT DLL EXPORTED) */ +extern void png_read_destroy PNGARG((png_structp png_ptr, png_infop info_ptr, + png_infop end_info_ptr)); + +/* free any memory associated with the png_struct and the png_info_structs */ +extern PNG_EXPORT(void,png_destroy_write_struct) + PNGARG((png_structpp png_ptr_ptr, png_infopp info_ptr_ptr)); + +/* free any memory used in png_ptr struct (old method - NOT DLL EXPORTED) */ +extern void png_write_destroy PNGARG((png_structp png_ptr)); + +/* set the libpng method of handling chunk CRC errors */ +extern PNG_EXPORT(void,png_set_crc_action) PNGARG((png_structp png_ptr, + int crit_action, int ancil_action)); + +/* Values for png_set_crc_action() to say how to handle CRC errors in + * ancillary and critical chunks, and whether to use the data contained + * therein. Note that it is impossible to "discard" data in a critical + * chunk. For versions prior to 0.90, the action was always error/quit, + * whereas in version 0.90 and later, the action for CRC errors in ancillary + * chunks is warn/discard. These values should NOT be changed. + * + * value action:critical action:ancillary + */ +#define PNG_CRC_DEFAULT 0 /* error/quit warn/discard data */ +#define PNG_CRC_ERROR_QUIT 1 /* error/quit error/quit */ +#define PNG_CRC_WARN_DISCARD 2 /* (INVALID) warn/discard data */ +#define PNG_CRC_WARN_USE 3 /* warn/use data warn/use data */ +#define PNG_CRC_QUIET_USE 4 /* quiet/use data quiet/use data */ +#define PNG_CRC_NO_CHANGE 5 /* use current value use current value */ + +/* These functions give the user control over the scan-line filtering in + * libpng and the compression methods used by zlib. These functions are + * mainly useful for testing, as the defaults should work with most users. + * Those users who are tight on memory or want faster performance at the + * expense of compression can modify them. See the compression library + * header file (zlib.h) for an explination of the compression functions. + */ + +/* set the filtering method(s) used by libpng. Currently, the only valid + * value for "method" is 0. + */ +extern PNG_EXPORT(void,png_set_filter) PNGARG((png_structp png_ptr, int method, + int filters)); + +/* Flags for png_set_filter() to say which filters to use. The flags + * are chosen so that they don't conflict with real filter types + * below, in case they are supplied instead of the #defined constants. + * These values should NOT be changed. + */ +#define PNG_NO_FILTERS 0x00 +#define PNG_FILTER_NONE 0x08 +#define PNG_FILTER_SUB 0x10 +#define PNG_FILTER_UP 0x20 +#define PNG_FILTER_AVG 0x40 +#define PNG_FILTER_PAETH 0x80 +#define PNG_ALL_FILTERS (PNG_FILTER_NONE | PNG_FILTER_SUB | PNG_FILTER_UP | \ + PNG_FILTER_AVG | PNG_FILTER_PAETH) + +/* Filter values (not flags) - used in pngwrite.c, pngwutil.c for now. + * These defines should NOT be changed. + */ +#define PNG_FILTER_VALUE_NONE 0 +#define PNG_FILTER_VALUE_SUB 1 +#define PNG_FILTER_VALUE_UP 2 +#define PNG_FILTER_VALUE_AVG 3 +#define PNG_FILTER_VALUE_PAETH 4 +#define PNG_FILTER_VALUE_LAST 5 + +#if defined(PNG_WRITE_WEIGHTED_FILTER_SUPPORTED) /* EXPERIMENTAL */ +/* The "heuristic_method" is given by one of the PNG_FILTER_HEURISTIC_ + * defines, either the default (minimum-sum-of-absolute-differences), or + * the experimental method (weighted-minimum-sum-of-absolute-differences). + * + * Weights are factors >= 1.0, indicating how important it is to keep the + * filter type consistent between rows. Larger numbers mean the current + * filter is that many times as likely to be the same as the "num_weights" + * previous filters. This is cumulative for each previous row with a weight. + * There needs to be "num_weights" values in "filter_weights", or it can be + * NULL if the weights aren't being specified. Weights have no influence on + * the selection of the first row filter. Well chosen weights can (in theory) + * improve the compression for a given image. + * + * Costs are factors >= 1.0 indicating the relative decoding costs of a + * filter type. Higher costs indicate more decoding expense, and are + * therefore less likely to be selected over a filter with lower computational + * costs. There needs to be a value in "filter_costs" for each valid filter + * type (given by PNG_FILTER_VALUE_LAST), or it can be NULL if you aren't + * setting the costs. Costs try to improve the speed of decompression without + * unduly increasing the compressed image size. + * + * A negative weight or cost indicates the default value is to be used, and + * values in the range [0.0, 1.0) indicate the value is to remain unchanged. + * The default values for both weights and costs are currently 1.0, but may + * change if good general weighting/cost heuristics can be found. If both + * the weights and costs are set to 1.0, this degenerates the WEIGHTED method + * to the UNWEIGHTED method, but with added encoding time/computation. + */ +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(void,png_set_filter_heuristics) PNGARG((png_structp png_ptr, + int heuristic_method, int num_weights, png_doublep filter_weights, + png_doublep filter_costs)); +#endif +#endif /* PNG_WRITE_WEIGHTED_FILTER_SUPPORTED */ + +/* Heuristic used for row filter selection. These defines should NOT be + * changed. + */ +#define PNG_FILTER_HEURISTIC_DEFAULT 0 /* Currently "UNWEIGHTED" */ +#define PNG_FILTER_HEURISTIC_UNWEIGHTED 1 /* Used by libpng < 0.95 */ +#define PNG_FILTER_HEURISTIC_WEIGHTED 2 /* Experimental feature */ +#define PNG_FILTER_HEURISTIC_LAST 3 /* Not a valid value */ + +/* Set the library compression level. Currently, valid values range from + * 0 - 9, corresponding directly to the zlib compression levels 0 - 9 + * (0 - no compression, 9 - "maximal" compression). Note that tests have + * shown that zlib compression levels 3-6 usually perform as well as level 9 + * for PNG images, and do considerably fewer caclulations. In the future, + * these values may not correspond directly to the zlib compression levels. + */ +extern PNG_EXPORT(void,png_set_compression_level) PNGARG((png_structp png_ptr, + int level)); + +extern PNG_EXPORT(void,png_set_compression_mem_level) + PNGARG((png_structp png_ptr, int mem_level)); + +extern PNG_EXPORT(void,png_set_compression_strategy) + PNGARG((png_structp png_ptr, int strategy)); + +extern PNG_EXPORT(void,png_set_compression_window_bits) + PNGARG((png_structp png_ptr, int window_bits)); + +extern PNG_EXPORT(void,png_set_compression_method) PNGARG((png_structp png_ptr, + int method)); + +/* These next functions are called for input/output, memory, and error + * handling. They are in the file pngrio.c, pngwio.c, and pngerror.c, + * and call standard C I/O routines such as fread(), fwrite(), and + * fprintf(). These functions can be made to use other I/O routines + * at run time for those applications that need to handle I/O in a + * different manner by calling png_set_???_fn(). See libpng.txt for + * more information. + */ + +#if !defined(PNG_NO_STDIO) +/* Initialize the input/output for the PNG file to the default functions. */ +extern PNG_EXPORT(void,png_init_io) PNGARG((png_structp png_ptr, png_FILE_p fp)); +#endif + +/* Replace the (error and abort), and warning functions with user + * supplied functions. If no messages are to be printed you must still + * write and use replacement functions. The replacement error_fn should + * still do a longjmp to the last setjmp location if you are using this + * method of error handling. If error_fn or warning_fn is NULL, the + * default function will be used. + */ + +extern PNG_EXPORT(void,png_set_error_fn) PNGARG((png_structp png_ptr, + png_voidp error_ptr, png_error_ptr error_fn, png_error_ptr warning_fn)); + +/* Return the user pointer associated with the error functions */ +extern PNG_EXPORT(png_voidp,png_get_error_ptr) PNGARG((png_structp png_ptr)); + +/* Replace the default data output functions with a user supplied one(s). + * If buffered output is not used, then output_flush_fn can be set to NULL. + * If PNG_WRITE_FLUSH_SUPPORTED is not defined at libpng compile time + * output_flush_fn will be ignored (and thus can be NULL). + */ +extern PNG_EXPORT(void,png_set_write_fn) PNGARG((png_structp png_ptr, + png_voidp io_ptr, png_rw_ptr write_data_fn, png_flush_ptr output_flush_fn)); + +/* Replace the default data input function with a user supplied one. */ +extern PNG_EXPORT(void,png_set_read_fn) PNGARG((png_structp png_ptr, + png_voidp io_ptr, png_rw_ptr read_data_fn)); + +/* Return the user pointer associated with the I/O functions */ +extern PNG_EXPORT(png_voidp,png_get_io_ptr) PNGARG((png_structp png_ptr)); + +extern PNG_EXPORT(void,png_set_read_status_fn) PNGARG((png_structp png_ptr, + png_read_status_ptr read_row_fn)); + +extern PNG_EXPORT(void,png_set_write_status_fn) PNGARG((png_structp png_ptr, + png_write_status_ptr write_row_fn)); + +#ifdef PNG_USER_MEM_SUPPORTED +/* Replace the default memory allocation functions with user supplied one(s). */ +extern PNG_EXPORT(void,png_set_mem_fn) PNGARG((png_structp png_ptr, + png_voidp mem_ptr, png_malloc_ptr malloc_fn, png_free_ptr free_fn)); +/* Return the user pointer associated with the memory functions */ +extern PNG_EXPORT(png_voidp,png_get_mem_ptr) PNGARG((png_structp png_ptr)); +#endif + +#if defined(PNG_READ_USER_TRANSFORM_SUPPORTED) || \ + defined(PNG_LEGACY_SUPPORTED) +extern PNG_EXPORT(void,png_set_read_user_transform_fn) PNGARG((png_structp + png_ptr, png_user_transform_ptr read_user_transform_fn)); +#endif + +#if defined(PNG_WRITE_USER_TRANSFORM_SUPPORTED) || \ + defined(PNG_LEGACY_SUPPORTED) +extern PNG_EXPORT(void,png_set_write_user_transform_fn) PNGARG((png_structp + png_ptr, png_user_transform_ptr write_user_transform_fn)); +#endif + +#if defined(PNG_READ_USER_TRANSFORM_SUPPORTED) || \ + defined(PNG_WRITE_USER_TRANSFORM_SUPPORTED) || \ + defined(PNG_LEGACY_SUPPORTED) +extern PNG_EXPORT(void,png_set_user_transform_info) PNGARG((png_structp + png_ptr, png_voidp user_transform_ptr, int user_transform_depth, + int user_transform_channels)); +/* Return the user pointer associated with the user transform functions */ +extern PNG_EXPORT(png_voidp,png_get_user_transform_ptr) + PNGARG((png_structp png_ptr)); +#endif + +#ifdef PNG_USER_CHUNKS_SUPPORTED +extern PNG_EXPORT(void,png_set_read_user_chunk_fn) PNGARG((png_structp png_ptr, + png_voidp user_chunk_ptr, png_user_chunk_ptr read_user_chunk_fn)); +extern PNG_EXPORT(png_voidp,png_get_user_chunk_ptr) PNGARG((png_structp + png_ptr)); +#endif + +#ifdef PNG_PROGRESSIVE_READ_SUPPORTED +/* Sets the function callbacks for the push reader, and a pointer to a + * user-defined structure available to the callback functions. + */ +extern PNG_EXPORT(void,png_set_progressive_read_fn) PNGARG((png_structp png_ptr, + png_voidp progressive_ptr, + png_progressive_info_ptr info_fn, png_progressive_row_ptr row_fn, + png_progressive_end_ptr end_fn)); + +/* returns the user pointer associated with the push read functions */ +extern PNG_EXPORT(png_voidp,png_get_progressive_ptr) + PNGARG((png_structp png_ptr)); + +/* function to be called when data becomes available */ +extern PNG_EXPORT(void,png_process_data) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_bytep buffer, png_size_t buffer_size)); + +/* function that combines rows. Not very much different than the + * png_combine_row() call. Is this even used????? + */ +extern PNG_EXPORT(void,png_progressive_combine_row) PNGARG((png_structp png_ptr, + png_bytep old_row, png_bytep new_row)); +#endif /* PNG_PROGRESSIVE_READ_SUPPORTED */ + +extern PNG_EXPORT(png_voidp,png_malloc) PNGARG((png_structp png_ptr, + png_uint_32 size)); + +#if defined(PNG_1_0_X) +# define png_malloc_warn png_malloc +#else +/* Added at libpng version 1.2.4 */ +extern PNG_EXPORT(png_voidp,png_malloc_warn) PNGARG((png_structp png_ptr, + png_uint_32 size)); +#endif + +/* frees a pointer allocated by png_malloc() */ +extern PNG_EXPORT(void,png_free) PNGARG((png_structp png_ptr, png_voidp ptr)); + +#if defined(PNG_1_0_X) +/* Function to allocate memory for zlib. */ +extern PNG_EXPORT(voidpf,png_zalloc) PNGARG((voidpf png_ptr, uInt items, + uInt size)); + +/* Function to free memory for zlib */ +extern PNG_EXPORT(void,png_zfree) PNGARG((voidpf png_ptr, voidpf ptr)); +#endif + +/* Free data that was allocated internally */ +extern PNG_EXPORT(void,png_free_data) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_32 free_me, int num)); +#ifdef PNG_FREE_ME_SUPPORTED +/* Reassign responsibility for freeing existing data, whether allocated + * by libpng or by the application */ +extern PNG_EXPORT(void,png_data_freer) PNGARG((png_structp png_ptr, + png_infop info_ptr, int freer, png_uint_32 mask)); +#endif +/* assignments for png_data_freer */ +#define PNG_DESTROY_WILL_FREE_DATA 1 +#define PNG_SET_WILL_FREE_DATA 1 +#define PNG_USER_WILL_FREE_DATA 2 +/* Flags for png_ptr->free_me and info_ptr->free_me */ +#define PNG_FREE_HIST 0x0008 +#define PNG_FREE_ICCP 0x0010 +#define PNG_FREE_SPLT 0x0020 +#define PNG_FREE_ROWS 0x0040 +#define PNG_FREE_PCAL 0x0080 +#define PNG_FREE_SCAL 0x0100 +#define PNG_FREE_UNKN 0x0200 +#define PNG_FREE_LIST 0x0400 +#define PNG_FREE_PLTE 0x1000 +#define PNG_FREE_TRNS 0x2000 +#define PNG_FREE_TEXT 0x4000 +#define PNG_FREE_ALL 0x7fff +#define PNG_FREE_MUL 0x4220 /* PNG_FREE_SPLT|PNG_FREE_TEXT|PNG_FREE_UNKN */ + +#ifdef PNG_USER_MEM_SUPPORTED +extern PNG_EXPORT(png_voidp,png_malloc_default) PNGARG((png_structp png_ptr, + png_uint_32 size)); +extern PNG_EXPORT(void,png_free_default) PNGARG((png_structp png_ptr, + png_voidp ptr)); +#endif + +extern PNG_EXPORT(png_voidp,png_memcpy_check) PNGARG((png_structp png_ptr, + png_voidp s1, png_voidp s2, png_uint_32 size)); + +extern PNG_EXPORT(png_voidp,png_memset_check) PNGARG((png_structp png_ptr, + png_voidp s1, int value, png_uint_32 size)); + +#if defined(USE_FAR_KEYWORD) /* memory model conversion function */ +extern void *png_far_to_near PNGARG((png_structp png_ptr,png_voidp ptr, + int check)); +#endif /* USE_FAR_KEYWORD */ + +#ifndef PNG_NO_ERROR_TEXT +/* Fatal error in PNG image of libpng - can't continue */ +extern PNG_EXPORT(void,png_error) PNGARG((png_structp png_ptr, + png_const_charp error_message)); + +/* The same, but the chunk name is prepended to the error string. */ +extern PNG_EXPORT(void,png_chunk_error) PNGARG((png_structp png_ptr, + png_const_charp error_message)); +#else +/* Fatal error in PNG image of libpng - can't continue */ +extern PNG_EXPORT(void,png_err) PNGARG((png_structp png_ptr)); +#endif + +#ifndef PNG_NO_WARNINGS +/* Non-fatal error in libpng. Can continue, but may have a problem. */ +extern PNG_EXPORT(void,png_warning) PNGARG((png_structp png_ptr, + png_const_charp warning_message)); + +#ifdef PNG_READ_SUPPORTED +/* Non-fatal error in libpng, chunk name is prepended to message. */ +extern PNG_EXPORT(void,png_chunk_warning) PNGARG((png_structp png_ptr, + png_const_charp warning_message)); +#endif /* PNG_READ_SUPPORTED */ +#endif /* PNG_NO_WARNINGS */ + +/* The png_set_ functions are for storing values in the png_info_struct. + * Similarly, the png_get_ calls are used to read values from the + * png_info_struct, either storing the parameters in the passed variables, or + * setting pointers into the png_info_struct where the data is stored. The + * png_get_ functions return a non-zero value if the data was available + * in info_ptr, or return zero and do not change any of the parameters if the + * data was not available. + * + * These functions should be used instead of directly accessing png_info + * to avoid problems with future changes in the size and internal layout of + * png_info_struct. + */ +/* Returns "flag" if chunk data is valid in info_ptr. */ +extern PNG_EXPORT(png_uint_32,png_get_valid) PNGARG((png_structp png_ptr, +png_infop info_ptr, png_uint_32 flag)); + +/* Returns number of bytes needed to hold a transformed row. */ +extern PNG_EXPORT(png_uint_32,png_get_rowbytes) PNGARG((png_structp png_ptr, +png_infop info_ptr)); + +#if defined(PNG_INFO_IMAGE_SUPPORTED) +/* Returns row_pointers, which is an array of pointers to scanlines that was +returned from png_read_png(). */ +extern PNG_EXPORT(png_bytepp,png_get_rows) PNGARG((png_structp png_ptr, +png_infop info_ptr)); +/* Set row_pointers, which is an array of pointers to scanlines for use +by png_write_png(). */ +extern PNG_EXPORT(void,png_set_rows) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_bytepp row_pointers)); +#endif + +/* Returns number of color channels in image. */ +extern PNG_EXPORT(png_byte,png_get_channels) PNGARG((png_structp png_ptr, +png_infop info_ptr)); + +#ifdef PNG_EASY_ACCESS_SUPPORTED +/* Returns image width in pixels. */ +extern PNG_EXPORT(png_uint_32, png_get_image_width) PNGARG((png_structp +png_ptr, png_infop info_ptr)); + +/* Returns image height in pixels. */ +extern PNG_EXPORT(png_uint_32, png_get_image_height) PNGARG((png_structp +png_ptr, png_infop info_ptr)); + +/* Returns image bit_depth. */ +extern PNG_EXPORT(png_byte, png_get_bit_depth) PNGARG((png_structp +png_ptr, png_infop info_ptr)); + +/* Returns image color_type. */ +extern PNG_EXPORT(png_byte, png_get_color_type) PNGARG((png_structp +png_ptr, png_infop info_ptr)); + +/* Returns image filter_type. */ +extern PNG_EXPORT(png_byte, png_get_filter_type) PNGARG((png_structp +png_ptr, png_infop info_ptr)); + +/* Returns image interlace_type. */ +extern PNG_EXPORT(png_byte, png_get_interlace_type) PNGARG((png_structp +png_ptr, png_infop info_ptr)); + +/* Returns image compression_type. */ +extern PNG_EXPORT(png_byte, png_get_compression_type) PNGARG((png_structp +png_ptr, png_infop info_ptr)); + +/* Returns image resolution in pixels per meter, from pHYs chunk data. */ +extern PNG_EXPORT(png_uint_32, png_get_pixels_per_meter) PNGARG((png_structp +png_ptr, png_infop info_ptr)); +extern PNG_EXPORT(png_uint_32, png_get_x_pixels_per_meter) PNGARG((png_structp +png_ptr, png_infop info_ptr)); +extern PNG_EXPORT(png_uint_32, png_get_y_pixels_per_meter) PNGARG((png_structp +png_ptr, png_infop info_ptr)); + +/* Returns pixel aspect ratio, computed from pHYs chunk data. */ +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(float, png_get_pixel_aspect_ratio) PNGARG((png_structp +png_ptr, png_infop info_ptr)); +#endif + +/* Returns image x, y offset in pixels or microns, from oFFs chunk data. */ +extern PNG_EXPORT(png_int_32, png_get_x_offset_pixels) PNGARG((png_structp +png_ptr, png_infop info_ptr)); +extern PNG_EXPORT(png_int_32, png_get_y_offset_pixels) PNGARG((png_structp +png_ptr, png_infop info_ptr)); +extern PNG_EXPORT(png_int_32, png_get_x_offset_microns) PNGARG((png_structp +png_ptr, png_infop info_ptr)); +extern PNG_EXPORT(png_int_32, png_get_y_offset_microns) PNGARG((png_structp +png_ptr, png_infop info_ptr)); + +#endif /* PNG_EASY_ACCESS_SUPPORTED */ + +/* Returns pointer to signature string read from PNG header */ +extern PNG_EXPORT(png_bytep,png_get_signature) PNGARG((png_structp png_ptr, +png_infop info_ptr)); + +#if defined(PNG_bKGD_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_bKGD) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_color_16p *background)); +#endif + +#if defined(PNG_bKGD_SUPPORTED) +extern PNG_EXPORT(void,png_set_bKGD) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_color_16p background)); +#endif + +#if defined(PNG_cHRM_SUPPORTED) +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(png_uint_32,png_get_cHRM) PNGARG((png_structp png_ptr, + png_infop info_ptr, double *white_x, double *white_y, double *red_x, + double *red_y, double *green_x, double *green_y, double *blue_x, + double *blue_y)); +#endif +#ifdef PNG_FIXED_POINT_SUPPORTED +extern PNG_EXPORT(png_uint_32,png_get_cHRM_fixed) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_fixed_point *int_white_x, png_fixed_point + *int_white_y, png_fixed_point *int_red_x, png_fixed_point *int_red_y, + png_fixed_point *int_green_x, png_fixed_point *int_green_y, png_fixed_point + *int_blue_x, png_fixed_point *int_blue_y)); +#endif +#endif + +#if defined(PNG_cHRM_SUPPORTED) +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(void,png_set_cHRM) PNGARG((png_structp png_ptr, + png_infop info_ptr, double white_x, double white_y, double red_x, + double red_y, double green_x, double green_y, double blue_x, double blue_y)); +#endif +#ifdef PNG_FIXED_POINT_SUPPORTED +extern PNG_EXPORT(void,png_set_cHRM_fixed) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_fixed_point int_white_x, png_fixed_point int_white_y, + png_fixed_point int_red_x, png_fixed_point int_red_y, png_fixed_point + int_green_x, png_fixed_point int_green_y, png_fixed_point int_blue_x, + png_fixed_point int_blue_y)); +#endif +#endif + +#if defined(PNG_gAMA_SUPPORTED) +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(png_uint_32,png_get_gAMA) PNGARG((png_structp png_ptr, + png_infop info_ptr, double *file_gamma)); +#endif +extern PNG_EXPORT(png_uint_32,png_get_gAMA_fixed) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_fixed_point *int_file_gamma)); +#endif + +#if defined(PNG_gAMA_SUPPORTED) +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(void,png_set_gAMA) PNGARG((png_structp png_ptr, + png_infop info_ptr, double file_gamma)); +#endif +extern PNG_EXPORT(void,png_set_gAMA_fixed) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_fixed_point int_file_gamma)); +#endif + +#if defined(PNG_hIST_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_hIST) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_16p *hist)); +#endif + +#if defined(PNG_hIST_SUPPORTED) +extern PNG_EXPORT(void,png_set_hIST) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_16p hist)); +#endif + +extern PNG_EXPORT(png_uint_32,png_get_IHDR) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_32 *width, png_uint_32 *height, + int *bit_depth, int *color_type, int *interlace_method, + int *compression_method, int *filter_method)); + +extern PNG_EXPORT(void,png_set_IHDR) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_32 width, png_uint_32 height, int bit_depth, + int color_type, int interlace_method, int compression_method, + int filter_method)); + +#if defined(PNG_oFFs_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_oFFs) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_int_32 *offset_x, png_int_32 *offset_y, + int *unit_type)); +#endif + +#if defined(PNG_oFFs_SUPPORTED) +extern PNG_EXPORT(void,png_set_oFFs) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_int_32 offset_x, png_int_32 offset_y, + int unit_type)); +#endif + +#if defined(PNG_pCAL_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_pCAL) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_charp *purpose, png_int_32 *X0, png_int_32 *X1, + int *type, int *nparams, png_charp *units, png_charpp *params)); +#endif + +#if defined(PNG_pCAL_SUPPORTED) +extern PNG_EXPORT(void,png_set_pCAL) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_charp purpose, png_int_32 X0, png_int_32 X1, + int type, int nparams, png_charp units, png_charpp params)); +#endif + +#if defined(PNG_pHYs_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_pHYs) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_32 *res_x, png_uint_32 *res_y, int *unit_type)); +#endif + +#if defined(PNG_pHYs_SUPPORTED) +extern PNG_EXPORT(void,png_set_pHYs) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_32 res_x, png_uint_32 res_y, int unit_type)); +#endif + +extern PNG_EXPORT(png_uint_32,png_get_PLTE) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_colorp *palette, int *num_palette)); + +extern PNG_EXPORT(void,png_set_PLTE) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_colorp palette, int num_palette)); + +#if defined(PNG_sBIT_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_sBIT) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_color_8p *sig_bit)); +#endif + +#if defined(PNG_sBIT_SUPPORTED) +extern PNG_EXPORT(void,png_set_sBIT) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_color_8p sig_bit)); +#endif + +#if defined(PNG_sRGB_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_sRGB) PNGARG((png_structp png_ptr, + png_infop info_ptr, int *intent)); +#endif + +#if defined(PNG_sRGB_SUPPORTED) +extern PNG_EXPORT(void,png_set_sRGB) PNGARG((png_structp png_ptr, + png_infop info_ptr, int intent)); +extern PNG_EXPORT(void,png_set_sRGB_gAMA_and_cHRM) PNGARG((png_structp png_ptr, + png_infop info_ptr, int intent)); +#endif + +#if defined(PNG_iCCP_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_iCCP) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_charpp name, int *compression_type, + png_charpp profile, png_uint_32 *proflen)); + /* Note to maintainer: profile should be png_bytepp */ +#endif + +#if defined(PNG_iCCP_SUPPORTED) +extern PNG_EXPORT(void,png_set_iCCP) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_charp name, int compression_type, + png_charp profile, png_uint_32 proflen)); + /* Note to maintainer: profile should be png_bytep */ +#endif + +#if defined(PNG_sPLT_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_sPLT) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_sPLT_tpp entries)); +#endif + +#if defined(PNG_sPLT_SUPPORTED) +extern PNG_EXPORT(void,png_set_sPLT) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_sPLT_tp entries, int nentries)); +#endif + +#if defined(PNG_TEXT_SUPPORTED) +/* png_get_text also returns the number of text chunks in *num_text */ +extern PNG_EXPORT(png_uint_32,png_get_text) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_textp *text_ptr, int *num_text)); +#endif + +/* + * Note while png_set_text() will accept a structure whose text, + * language, and translated keywords are NULL pointers, the structure + * returned by png_get_text will always contain regular + * zero-terminated C strings. They might be empty strings but + * they will never be NULL pointers. + */ + +#if defined(PNG_TEXT_SUPPORTED) +extern PNG_EXPORT(void,png_set_text) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_textp text_ptr, int num_text)); +#endif + +#if defined(PNG_tIME_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_tIME) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_timep *mod_time)); +#endif + +#if defined(PNG_tIME_SUPPORTED) +extern PNG_EXPORT(void,png_set_tIME) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_timep mod_time)); +#endif + +#if defined(PNG_tRNS_SUPPORTED) +extern PNG_EXPORT(png_uint_32,png_get_tRNS) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_bytep *trans, int *num_trans, + png_color_16p *trans_values)); +#endif + +#if defined(PNG_tRNS_SUPPORTED) +extern PNG_EXPORT(void,png_set_tRNS) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_bytep trans, int num_trans, + png_color_16p trans_values)); +#endif + +#if defined(PNG_tRNS_SUPPORTED) +#endif + +#if defined(PNG_sCAL_SUPPORTED) +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(png_uint_32,png_get_sCAL) PNGARG((png_structp png_ptr, + png_infop info_ptr, int *unit, double *width, double *height)); +#else +#ifdef PNG_FIXED_POINT_SUPPORTED +extern PNG_EXPORT(png_uint_32,png_get_sCAL_s) PNGARG((png_structp png_ptr, + png_infop info_ptr, int *unit, png_charpp swidth, png_charpp sheight)); +#endif +#endif +#endif /* PNG_sCAL_SUPPORTED */ + +#if defined(PNG_sCAL_SUPPORTED) +#ifdef PNG_FLOATING_POINT_SUPPORTED +extern PNG_EXPORT(void,png_set_sCAL) PNGARG((png_structp png_ptr, + png_infop info_ptr, int unit, double width, double height)); +#else +#ifdef PNG_FIXED_POINT_SUPPORTED +extern PNG_EXPORT(void,png_set_sCAL_s) PNGARG((png_structp png_ptr, + png_infop info_ptr, int unit, png_charp swidth, png_charp sheight)); +#endif +#endif +#endif /* PNG_sCAL_SUPPORTED || PNG_WRITE_sCAL_SUPPORTED */ + +#if defined(PNG_UNKNOWN_CHUNKS_SUPPORTED) +/* provide a list of chunks and how they are to be handled, if the built-in + handling or default unknown chunk handling is not desired. Any chunks not + listed will be handled in the default manner. The IHDR and IEND chunks + must not be listed. + keep = 0: follow default behaviour + = 1: do not keep + = 2: keep only if safe-to-copy + = 3: keep even if unsafe-to-copy +*/ +extern PNG_EXPORT(void, png_set_keep_unknown_chunks) PNGARG((png_structp + png_ptr, int keep, png_bytep chunk_list, int num_chunks)); +extern PNG_EXPORT(void, png_set_unknown_chunks) PNGARG((png_structp png_ptr, + png_infop info_ptr, png_unknown_chunkp unknowns, int num_unknowns)); +extern PNG_EXPORT(void, png_set_unknown_chunk_location) + PNGARG((png_structp png_ptr, png_infop info_ptr, int chunk, int location)); +extern PNG_EXPORT(png_uint_32,png_get_unknown_chunks) PNGARG((png_structp + png_ptr, png_infop info_ptr, png_unknown_chunkpp entries)); +#endif +#ifdef PNG_HANDLE_AS_UNKNOWN_SUPPORTED +PNG_EXPORT(int,png_handle_as_unknown) PNGARG((png_structp png_ptr, png_bytep + chunk_name)); +#endif + +/* Png_free_data() will turn off the "valid" flag for anything it frees. + If you need to turn it off for a chunk that your application has freed, + you can use png_set_invalid(png_ptr, info_ptr, PNG_INFO_CHNK); */ +extern PNG_EXPORT(void, png_set_invalid) PNGARG((png_structp png_ptr, + png_infop info_ptr, int mask)); + +#if defined(PNG_INFO_IMAGE_SUPPORTED) +/* The "params" pointer is currently not used and is for future expansion. */ +extern PNG_EXPORT(void, png_read_png) PNGARG((png_structp png_ptr, + png_infop info_ptr, + int transforms, + png_voidp params)); +extern PNG_EXPORT(void, png_write_png) PNGARG((png_structp png_ptr, + png_infop info_ptr, + int transforms, + png_voidp params)); +#endif + +/* Define PNG_DEBUG at compile time for debugging information. Higher + * numbers for PNG_DEBUG mean more debugging information. This has + * only been added since version 0.95 so it is not implemented throughout + * libpng yet, but more support will be added as needed. + */ +#ifdef PNG_DEBUG +#if (PNG_DEBUG > 0) +#if !defined(PNG_DEBUG_FILE) && defined(_MSC_VER) +#include +#if (PNG_DEBUG > 1) +#define png_debug(l,m) _RPT0(_CRT_WARN,m) +#define png_debug1(l,m,p1) _RPT1(_CRT_WARN,m,p1) +#define png_debug2(l,m,p1,p2) _RPT2(_CRT_WARN,m,p1,p2) +#endif +#else /* PNG_DEBUG_FILE || !_MSC_VER */ +#ifndef PNG_DEBUG_FILE +#define PNG_DEBUG_FILE stderr +#endif /* PNG_DEBUG_FILE */ +#if (PNG_DEBUG > 1) +#define png_debug(l,m) \ +{ \ + int num_tabs=l; \ + fprintf(PNG_DEBUG_FILE,"%s"m,(num_tabs==1 ? "\t" : \ + (num_tabs==2 ? "\t\t":(num_tabs>2 ? "\t\t\t":"")))); \ +} +#define png_debug1(l,m,p1) \ +{ \ + int num_tabs=l; \ + fprintf(PNG_DEBUG_FILE,"%s"m,(num_tabs==1 ? "\t" : \ + (num_tabs==2 ? "\t\t":(num_tabs>2 ? "\t\t\t":""))),p1); \ +} +#define png_debug2(l,m,p1,p2) \ +{ \ + int num_tabs=l; \ + fprintf(PNG_DEBUG_FILE,"%s"m,(num_tabs==1 ? "\t" : \ + (num_tabs==2 ? "\t\t":(num_tabs>2 ? "\t\t\t":""))),p1,p2); \ +} +#endif /* (PNG_DEBUG > 1) */ +#endif /* _MSC_VER */ +#endif /* (PNG_DEBUG > 0) */ +#endif /* PNG_DEBUG */ +#ifndef png_debug +#define png_debug(l, m) +#endif +#ifndef png_debug1 +#define png_debug1(l, m, p1) +#endif +#ifndef png_debug2 +#define png_debug2(l, m, p1, p2) +#endif + +extern PNG_EXPORT(png_charp,png_get_copyright) PNGARG((png_structp png_ptr)); +extern PNG_EXPORT(png_charp,png_get_header_ver) PNGARG((png_structp png_ptr)); +extern PNG_EXPORT(png_charp,png_get_header_version) PNGARG((png_structp png_ptr)); +extern PNG_EXPORT(png_charp,png_get_libpng_ver) PNGARG((png_structp png_ptr)); + +#ifdef PNG_MNG_FEATURES_SUPPORTED +extern PNG_EXPORT(png_uint_32,png_permit_mng_features) PNGARG((png_structp + png_ptr, png_uint_32 mng_features_permitted)); +#endif + +/* For use in png_set_keep_unknown, added to version 1.2.6 */ +#define PNG_HANDLE_CHUNK_AS_DEFAULT 0 +#define PNG_HANDLE_CHUNK_NEVER 1 +#define PNG_HANDLE_CHUNK_IF_SAFE 2 +#define PNG_HANDLE_CHUNK_ALWAYS 3 + +/* Added to version 1.2.0 */ +#if defined(PNG_ASSEMBLER_CODE_SUPPORTED) +#if defined(PNG_MMX_CODE_SUPPORTED) +#define PNG_ASM_FLAG_MMX_SUPPORT_COMPILED 0x01 /* not user-settable */ +#define PNG_ASM_FLAG_MMX_SUPPORT_IN_CPU 0x02 /* not user-settable */ +#define PNG_ASM_FLAG_MMX_READ_COMBINE_ROW 0x04 +#define PNG_ASM_FLAG_MMX_READ_INTERLACE 0x08 +#define PNG_ASM_FLAG_MMX_READ_FILTER_SUB 0x10 +#define PNG_ASM_FLAG_MMX_READ_FILTER_UP 0x20 +#define PNG_ASM_FLAG_MMX_READ_FILTER_AVG 0x40 +#define PNG_ASM_FLAG_MMX_READ_FILTER_PAETH 0x80 +#define PNG_ASM_FLAGS_INITIALIZED 0x80000000 /* not user-settable */ + +#define PNG_MMX_READ_FLAGS ( PNG_ASM_FLAG_MMX_READ_COMBINE_ROW \ + | PNG_ASM_FLAG_MMX_READ_INTERLACE \ + | PNG_ASM_FLAG_MMX_READ_FILTER_SUB \ + | PNG_ASM_FLAG_MMX_READ_FILTER_UP \ + | PNG_ASM_FLAG_MMX_READ_FILTER_AVG \ + | PNG_ASM_FLAG_MMX_READ_FILTER_PAETH ) +#define PNG_MMX_WRITE_FLAGS ( 0 ) + +#define PNG_MMX_FLAGS ( PNG_ASM_FLAG_MMX_SUPPORT_COMPILED \ + | PNG_ASM_FLAG_MMX_SUPPORT_IN_CPU \ + | PNG_MMX_READ_FLAGS \ + | PNG_MMX_WRITE_FLAGS ) + +#define PNG_SELECT_READ 1 +#define PNG_SELECT_WRITE 2 +#endif /* PNG_MMX_CODE_SUPPORTED */ + +#if !defined(PNG_1_0_X) +/* pngget.c */ +extern PNG_EXPORT(png_uint_32,png_get_mmx_flagmask) + PNGARG((int flag_select, int *compilerID)); + +/* pngget.c */ +extern PNG_EXPORT(png_uint_32,png_get_asm_flagmask) + PNGARG((int flag_select)); + +/* pngget.c */ +extern PNG_EXPORT(png_uint_32,png_get_asm_flags) + PNGARG((png_structp png_ptr)); + +/* pngget.c */ +extern PNG_EXPORT(png_byte,png_get_mmx_bitdepth_threshold) + PNGARG((png_structp png_ptr)); + +/* pngget.c */ +extern PNG_EXPORT(png_uint_32,png_get_mmx_rowbytes_threshold) + PNGARG((png_structp png_ptr)); + +/* pngset.c */ +extern PNG_EXPORT(void,png_set_asm_flags) + PNGARG((png_structp png_ptr, png_uint_32 asm_flags)); + +/* pngset.c */ +extern PNG_EXPORT(void,png_set_mmx_thresholds) + PNGARG((png_structp png_ptr, png_byte mmx_bitdepth_threshold, + png_uint_32 mmx_rowbytes_threshold)); + +#endif /* PNG_1_0_X */ + +#if !defined(PNG_1_0_X) +/* png.c, pnggccrd.c, or pngvcrd.c */ +extern PNG_EXPORT(int,png_mmx_support) PNGARG((void)); +#endif /* PNG_ASSEMBLER_CODE_SUPPORTED */ + +/* Strip the prepended error numbers ("#nnn ") from error and warning + * messages before passing them to the error or warning handler. */ +#ifdef PNG_ERROR_NUMBERS_SUPPORTED +extern PNG_EXPORT(void,png_set_strip_error_numbers) PNGARG((png_structp + png_ptr, png_uint_32 strip_mode)); +#endif + +#endif /* PNG_1_0_X */ + +/* Added at libpng-1.2.6 */ +#ifdef PNG_SET_USER_LIMITS_SUPPORTED +extern PNG_EXPORT(void,png_set_user_limits) PNGARG((png_structp + png_ptr, png_uint_32 user_width_max, png_uint_32 user_height_max)); +extern PNG_EXPORT(png_uint_32,png_get_user_width_max) PNGARG((png_structp + png_ptr)); +extern PNG_EXPORT(png_uint_32,png_get_user_height_max) PNGARG((png_structp + png_ptr)); +#endif + +/* Maintainer: Put new public prototypes here ^, in libpng.3, and project defs */ + +#ifdef PNG_READ_COMPOSITE_NODIV_SUPPORTED +/* With these routines we avoid an integer divide, which will be slower on + * most machines. However, it does take more operations than the corresponding + * divide method, so it may be slower on a few RISC systems. There are two + * shifts (by 8 or 16 bits) and an addition, versus a single integer divide. + * + * Note that the rounding factors are NOT supposed to be the same! 128 and + * 32768 are correct for the NODIV code; 127 and 32767 are correct for the + * standard method. + * + * [Optimized code by Greg Roelofs and Mark Adler...blame us for bugs. :-) ] + */ + + /* fg and bg should be in `gamma 1.0' space; alpha is the opacity */ + +# define png_composite(composite, fg, alpha, bg) \ + { png_uint_16 temp = (png_uint_16)((png_uint_16)(fg) * (png_uint_16)(alpha) \ + + (png_uint_16)(bg)*(png_uint_16)(255 - \ + (png_uint_16)(alpha)) + (png_uint_16)128); \ + (composite) = (png_byte)((temp + (temp >> 8)) >> 8); } + +# define png_composite_16(composite, fg, alpha, bg) \ + { png_uint_32 temp = (png_uint_32)((png_uint_32)(fg) * (png_uint_32)(alpha) \ + + (png_uint_32)(bg)*(png_uint_32)(65535L - \ + (png_uint_32)(alpha)) + (png_uint_32)32768L); \ + (composite) = (png_uint_16)((temp + (temp >> 16)) >> 16); } + +#else /* standard method using integer division */ + +# define png_composite(composite, fg, alpha, bg) \ + (composite) = (png_byte)(((png_uint_16)(fg) * (png_uint_16)(alpha) + \ + (png_uint_16)(bg) * (png_uint_16)(255 - (png_uint_16)(alpha)) + \ + (png_uint_16)127) / 255) + +# define png_composite_16(composite, fg, alpha, bg) \ + (composite) = (png_uint_16)(((png_uint_32)(fg) * (png_uint_32)(alpha) + \ + (png_uint_32)(bg)*(png_uint_32)(65535L - (png_uint_32)(alpha)) + \ + (png_uint_32)32767) / (png_uint_32)65535L) + +#endif /* PNG_READ_COMPOSITE_NODIV_SUPPORTED */ + +/* Inline macros to do direct reads of bytes from the input buffer. These + * require that you are using an architecture that uses PNG byte ordering + * (MSB first) and supports unaligned data storage. I think that PowerPC + * in big-endian mode and 680x0 are the only ones that will support this. + * The x86 line of processors definitely do not. The png_get_int_32() + * routine also assumes we are using two's complement format for negative + * values, which is almost certainly true. + */ +#if defined(PNG_READ_BIG_ENDIAN_SUPPORTED) +# define png_get_uint_32(buf) ( *((png_uint_32p) (buf))) +# define png_get_uint_16(buf) ( *((png_uint_16p) (buf))) +# define png_get_int_32(buf) ( *((png_int_32p) (buf))) +#else +extern PNG_EXPORT(png_uint_32,png_get_uint_32) PNGARG((png_bytep buf)); +extern PNG_EXPORT(png_uint_16,png_get_uint_16) PNGARG((png_bytep buf)); +extern PNG_EXPORT(png_int_32,png_get_int_32) PNGARG((png_bytep buf)); +#endif /* !PNG_READ_BIG_ENDIAN_SUPPORTED */ +extern PNG_EXPORT(png_uint_32,png_get_uint_31) + PNGARG((png_structp png_ptr, png_bytep buf)); +/* No png_get_int_16 -- may be added if there's a real need for it. */ + +/* Place a 32-bit number into a buffer in PNG byte order (big-endian). + */ +extern PNG_EXPORT(void,png_save_uint_32) + PNGARG((png_bytep buf, png_uint_32 i)); +extern PNG_EXPORT(void,png_save_int_32) + PNGARG((png_bytep buf, png_int_32 i)); + +/* Place a 16-bit number into a buffer in PNG byte order. + * The parameter is declared unsigned int, not png_uint_16, + * just to avoid potential problems on pre-ANSI C compilers. + */ +extern PNG_EXPORT(void,png_save_uint_16) + PNGARG((png_bytep buf, unsigned int i)); +/* No png_save_int_16 -- may be added if there's a real need for it. */ + +/* ************************************************************************* */ + +/* These next functions are used internally in the code. They generally + * shouldn't be used unless you are writing code to add or replace some + * functionality in libpng. More information about most functions can + * be found in the files where the functions are located. + */ + + +/* Various modes of operation, that are visible to applications because + * they are used for unknown chunk location. + */ +#define PNG_HAVE_IHDR 0x01 +#define PNG_HAVE_PLTE 0x02 +#define PNG_HAVE_IDAT 0x04 +#define PNG_AFTER_IDAT 0x08 /* Have complete zlib datastream */ +#define PNG_HAVE_IEND 0x10 + +#if defined(PNG_INTERNAL) + +/* More modes of operation. Note that after an init, mode is set to + * zero automatically when the structure is created. + */ +#define PNG_HAVE_gAMA 0x20 +#define PNG_HAVE_cHRM 0x40 +#define PNG_HAVE_sRGB 0x80 +#define PNG_HAVE_CHUNK_HEADER 0x100 +#define PNG_WROTE_tIME 0x200 +#define PNG_WROTE_INFO_BEFORE_PLTE 0x400 +#define PNG_BACKGROUND_IS_GRAY 0x800 +#define PNG_HAVE_PNG_SIGNATURE 0x1000 +#define PNG_HAVE_CHUNK_AFTER_IDAT 0x2000 /* Have another chunk after IDAT */ + +/* flags for the transformations the PNG library does on the image data */ +#define PNG_BGR 0x0001 +#define PNG_INTERLACE 0x0002 +#define PNG_PACK 0x0004 +#define PNG_SHIFT 0x0008 +#define PNG_SWAP_BYTES 0x0010 +#define PNG_INVERT_MONO 0x0020 +#define PNG_DITHER 0x0040 +#define PNG_BACKGROUND 0x0080 +#define PNG_BACKGROUND_EXPAND 0x0100 + /* 0x0200 unused */ +#define PNG_16_TO_8 0x0400 +#define PNG_RGBA 0x0800 +#define PNG_EXPAND 0x1000 +#define PNG_GAMMA 0x2000 +#define PNG_GRAY_TO_RGB 0x4000 +#define PNG_FILLER 0x8000L +#define PNG_PACKSWAP 0x10000L +#define PNG_SWAP_ALPHA 0x20000L +#define PNG_STRIP_ALPHA 0x40000L +#define PNG_INVERT_ALPHA 0x80000L +#define PNG_USER_TRANSFORM 0x100000L +#define PNG_RGB_TO_GRAY_ERR 0x200000L +#define PNG_RGB_TO_GRAY_WARN 0x400000L +#define PNG_RGB_TO_GRAY 0x600000L /* two bits, RGB_TO_GRAY_ERR|WARN */ + /* 0x800000L Unused */ +#define PNG_ADD_ALPHA 0x1000000L /* Added to libpng-1.2.7 */ +#define PNG_EXPAND_tRNS 0x2000000L /* Added to libpng-1.2.9 */ + /* 0x4000000L unused */ + /* 0x8000000L unused */ + /* 0x10000000L unused */ + /* 0x20000000L unused */ + /* 0x40000000L unused */ + +/* flags for png_create_struct */ +#define PNG_STRUCT_PNG 0x0001 +#define PNG_STRUCT_INFO 0x0002 + +/* Scaling factor for filter heuristic weighting calculations */ +#define PNG_WEIGHT_SHIFT 8 +#define PNG_WEIGHT_FACTOR (1<<(PNG_WEIGHT_SHIFT)) +#define PNG_COST_SHIFT 3 +#define PNG_COST_FACTOR (1<<(PNG_COST_SHIFT)) + +/* flags for the png_ptr->flags rather than declaring a byte for each one */ +#define PNG_FLAG_ZLIB_CUSTOM_STRATEGY 0x0001 +#define PNG_FLAG_ZLIB_CUSTOM_LEVEL 0x0002 +#define PNG_FLAG_ZLIB_CUSTOM_MEM_LEVEL 0x0004 +#define PNG_FLAG_ZLIB_CUSTOM_WINDOW_BITS 0x0008 +#define PNG_FLAG_ZLIB_CUSTOM_METHOD 0x0010 +#define PNG_FLAG_ZLIB_FINISHED 0x0020 +#define PNG_FLAG_ROW_INIT 0x0040 +#define PNG_FLAG_FILLER_AFTER 0x0080 +#define PNG_FLAG_CRC_ANCILLARY_USE 0x0100 +#define PNG_FLAG_CRC_ANCILLARY_NOWARN 0x0200 +#define PNG_FLAG_CRC_CRITICAL_USE 0x0400 +#define PNG_FLAG_CRC_CRITICAL_IGNORE 0x0800 +#define PNG_FLAG_FREE_PLTE 0x1000 +#define PNG_FLAG_FREE_TRNS 0x2000 +#define PNG_FLAG_FREE_HIST 0x4000 +#define PNG_FLAG_KEEP_UNKNOWN_CHUNKS 0x8000L +#define PNG_FLAG_KEEP_UNSAFE_CHUNKS 0x10000L +#define PNG_FLAG_LIBRARY_MISMATCH 0x20000L +#define PNG_FLAG_STRIP_ERROR_NUMBERS 0x40000L +#define PNG_FLAG_STRIP_ERROR_TEXT 0x80000L +#define PNG_FLAG_MALLOC_NULL_MEM_OK 0x100000L +#define PNG_FLAG_ADD_ALPHA 0x200000L /* Added to libpng-1.2.8 */ +#define PNG_FLAG_STRIP_ALPHA 0x400000L /* Added to libpng-1.2.8 */ + /* 0x800000L unused */ + /* 0x1000000L unused */ + /* 0x2000000L unused */ + /* 0x4000000L unused */ + /* 0x8000000L unused */ + /* 0x10000000L unused */ + /* 0x20000000L unused */ + /* 0x40000000L unused */ + +#define PNG_FLAG_CRC_ANCILLARY_MASK (PNG_FLAG_CRC_ANCILLARY_USE | \ + PNG_FLAG_CRC_ANCILLARY_NOWARN) + +#define PNG_FLAG_CRC_CRITICAL_MASK (PNG_FLAG_CRC_CRITICAL_USE | \ + PNG_FLAG_CRC_CRITICAL_IGNORE) + +#define PNG_FLAG_CRC_MASK (PNG_FLAG_CRC_ANCILLARY_MASK | \ + PNG_FLAG_CRC_CRITICAL_MASK) + +/* save typing and make code easier to understand */ + +#define PNG_COLOR_DIST(c1, c2) (abs((int)((c1).red) - (int)((c2).red)) + \ + abs((int)((c1).green) - (int)((c2).green)) + \ + abs((int)((c1).blue) - (int)((c2).blue))) + +/* Added to libpng-1.2.6 JB */ +#define PNG_ROWBYTES(pixel_bits, width) \ + ((pixel_bits) >= 8 ? \ + ((width) * (((png_uint_32)(pixel_bits)) >> 3)) : \ + (( ((width) * ((png_uint_32)(pixel_bits))) + 7) >> 3) ) + +/* PNG_OUT_OF_RANGE returns true if value is outside the range + ideal-delta..ideal+delta. Each argument is evaluated twice. + "ideal" and "delta" should be constants, normally simple + integers, "value" a variable. Added to libpng-1.2.6 JB */ +#define PNG_OUT_OF_RANGE(value, ideal, delta) \ + ( (value) < (ideal)-(delta) || (value) > (ideal)+(delta) ) + +/* variables declared in png.c - only it needs to define PNG_NO_EXTERN */ +#if !defined(PNG_NO_EXTERN) || defined(PNG_ALWAYS_EXTERN) +/* place to hold the signature string for a PNG file. */ +#ifdef PNG_USE_GLOBAL_ARRAYS + PNG_EXPORT_VAR (PNG_CONST png_byte FARDATA) png_sig[8]; +#else +#endif +#endif /* PNG_NO_EXTERN */ + +/* Constant strings for known chunk types. If you need to add a chunk, + * define the name here, and add an invocation of the macro in png.c and + * wherever it's needed. + */ +#define PNG_IHDR png_byte png_IHDR[5] = { 73, 72, 68, 82, '\0'} +#define PNG_IDAT png_byte png_IDAT[5] = { 73, 68, 65, 84, '\0'} +#define PNG_IEND png_byte png_IEND[5] = { 73, 69, 78, 68, '\0'} +#define PNG_PLTE png_byte png_PLTE[5] = { 80, 76, 84, 69, '\0'} +#define PNG_bKGD png_byte png_bKGD[5] = { 98, 75, 71, 68, '\0'} +#define PNG_cHRM png_byte png_cHRM[5] = { 99, 72, 82, 77, '\0'} +#define PNG_gAMA png_byte png_gAMA[5] = {103, 65, 77, 65, '\0'} +#define PNG_hIST png_byte png_hIST[5] = {104, 73, 83, 84, '\0'} +#define PNG_iCCP png_byte png_iCCP[5] = {105, 67, 67, 80, '\0'} +#define PNG_iTXt png_byte png_iTXt[5] = {105, 84, 88, 116, '\0'} +#define PNG_oFFs png_byte png_oFFs[5] = {111, 70, 70, 115, '\0'} +#define PNG_pCAL png_byte png_pCAL[5] = {112, 67, 65, 76, '\0'} +#define PNG_sCAL png_byte png_sCAL[5] = {115, 67, 65, 76, '\0'} +#define PNG_pHYs png_byte png_pHYs[5] = {112, 72, 89, 115, '\0'} +#define PNG_sBIT png_byte png_sBIT[5] = {115, 66, 73, 84, '\0'} +#define PNG_sPLT png_byte png_sPLT[5] = {115, 80, 76, 84, '\0'} +#define PNG_sRGB png_byte png_sRGB[5] = {115, 82, 71, 66, '\0'} +#define PNG_tEXt png_byte png_tEXt[5] = {116, 69, 88, 116, '\0'} +#define PNG_tIME png_byte png_tIME[5] = {116, 73, 77, 69, '\0'} +#define PNG_tRNS png_byte png_tRNS[5] = {116, 82, 78, 83, '\0'} +#define PNG_zTXt png_byte png_zTXt[5] = {122, 84, 88, 116, '\0'} + +#ifdef PNG_USE_GLOBAL_ARRAYS +PNG_EXPORT_VAR (png_byte FARDATA) png_IHDR[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_IDAT[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_IEND[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_PLTE[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_bKGD[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_cHRM[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_gAMA[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_hIST[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_iCCP[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_iTXt[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_oFFs[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_pCAL[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_sCAL[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_pHYs[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_sBIT[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_sPLT[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_sRGB[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_tEXt[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_tIME[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_tRNS[5]; +PNG_EXPORT_VAR (png_byte FARDATA) png_zTXt[5]; +#endif /* PNG_USE_GLOBAL_ARRAYS */ + +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +/* Initialize png_ptr struct for reading, and allocate any other memory. + * (old interface - DEPRECATED - use png_create_read_struct instead). + */ +extern PNG_EXPORT(void,png_read_init) PNGARG((png_structp png_ptr)); +#undef png_read_init +#define png_read_init(png_ptr) png_read_init_3(&png_ptr, \ + PNG_LIBPNG_VER_STRING, png_sizeof(png_struct)); +#endif + +extern PNG_EXPORT(void,png_read_init_3) PNGARG((png_structpp ptr_ptr, + png_const_charp user_png_ver, png_size_t png_struct_size)); +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +extern PNG_EXPORT(void,png_read_init_2) PNGARG((png_structp png_ptr, + png_const_charp user_png_ver, png_size_t png_struct_size, png_size_t + png_info_size)); +#endif + +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +/* Initialize png_ptr struct for writing, and allocate any other memory. + * (old interface - DEPRECATED - use png_create_write_struct instead). + */ +extern PNG_EXPORT(void,png_write_init) PNGARG((png_structp png_ptr)); +#undef png_write_init +#define png_write_init(png_ptr) png_write_init_3(&png_ptr, \ + PNG_LIBPNG_VER_STRING, png_sizeof(png_struct)); +#endif + +extern PNG_EXPORT(void,png_write_init_3) PNGARG((png_structpp ptr_ptr, + png_const_charp user_png_ver, png_size_t png_struct_size)); +extern PNG_EXPORT(void,png_write_init_2) PNGARG((png_structp png_ptr, + png_const_charp user_png_ver, png_size_t png_struct_size, png_size_t + png_info_size)); + +/* Allocate memory for an internal libpng struct */ +PNG_EXTERN png_voidp png_create_struct PNGARG((int type)); + +/* Free memory from internal libpng struct */ +PNG_EXTERN void png_destroy_struct PNGARG((png_voidp struct_ptr)); + +PNG_EXTERN png_voidp png_create_struct_2 PNGARG((int type, png_malloc_ptr + malloc_fn, png_voidp mem_ptr)); +PNG_EXTERN void png_destroy_struct_2 PNGARG((png_voidp struct_ptr, + png_free_ptr free_fn, png_voidp mem_ptr)); + +/* Free any memory that info_ptr points to and reset struct. */ +PNG_EXTERN void png_info_destroy PNGARG((png_structp png_ptr, + png_infop info_ptr)); + +#ifndef PNG_1_0_X +/* Function to allocate memory for zlib. */ +PNG_EXTERN voidpf png_zalloc PNGARG((voidpf png_ptr, uInt items, uInt size)); + +/* Function to free memory for zlib */ +PNG_EXTERN void png_zfree PNGARG((voidpf png_ptr, voidpf ptr)); + +#ifdef PNG_SIZE_T +/* Function to convert a sizeof an item to png_sizeof item */ + PNG_EXTERN png_size_t PNGAPI png_convert_size PNGARG((size_t size)); +#endif + +/* Next four functions are used internally as callbacks. PNGAPI is required + * but not PNG_EXPORT. PNGAPI added at libpng version 1.2.3. */ + +PNG_EXTERN void PNGAPI png_default_read_data PNGARG((png_structp png_ptr, + png_bytep data, png_size_t length)); + +#ifdef PNG_PROGRESSIVE_READ_SUPPORTED +PNG_EXTERN void PNGAPI png_push_fill_buffer PNGARG((png_structp png_ptr, + png_bytep buffer, png_size_t length)); +#endif + +PNG_EXTERN void PNGAPI png_default_write_data PNGARG((png_structp png_ptr, + png_bytep data, png_size_t length)); + +#if defined(PNG_WRITE_FLUSH_SUPPORTED) +#if !defined(PNG_NO_STDIO) +PNG_EXTERN void PNGAPI png_default_flush PNGARG((png_structp png_ptr)); +#endif +#endif +#else /* PNG_1_0_X */ +#ifdef PNG_PROGRESSIVE_READ_SUPPORTED +PNG_EXTERN void png_push_fill_buffer PNGARG((png_structp png_ptr, + png_bytep buffer, png_size_t length)); +#endif +#endif /* PNG_1_0_X */ + +/* Reset the CRC variable */ +PNG_EXTERN void png_reset_crc PNGARG((png_structp png_ptr)); + +/* Write the "data" buffer to whatever output you are using. */ +PNG_EXTERN void png_write_data PNGARG((png_structp png_ptr, png_bytep data, + png_size_t length)); + +/* Read data from whatever input you are using into the "data" buffer */ +PNG_EXTERN void png_read_data PNGARG((png_structp png_ptr, png_bytep data, + png_size_t length)); + +/* Read bytes into buf, and update png_ptr->crc */ +PNG_EXTERN void png_crc_read PNGARG((png_structp png_ptr, png_bytep buf, + png_size_t length)); + +/* Decompress data in a chunk that uses compression */ +#if defined(PNG_zTXt_SUPPORTED) || defined(PNG_iTXt_SUPPORTED) || \ + defined(PNG_iCCP_SUPPORTED) || defined(PNG_sPLT_SUPPORTED) +PNG_EXTERN png_charp png_decompress_chunk PNGARG((png_structp png_ptr, + int comp_type, png_charp chunkdata, png_size_t chunklength, + png_size_t prefix_length, png_size_t *data_length)); +#endif + +/* Read "skip" bytes, read the file crc, and (optionally) verify png_ptr->crc */ +PNG_EXTERN int png_crc_finish PNGARG((png_structp png_ptr, png_uint_32 skip)); + +/* Read the CRC from the file and compare it to the libpng calculated CRC */ +PNG_EXTERN int png_crc_error PNGARG((png_structp png_ptr)); + +/* Calculate the CRC over a section of data. Note that we are only + * passing a maximum of 64K on systems that have this as a memory limit, + * since this is the maximum buffer size we can specify. + */ +PNG_EXTERN void png_calculate_crc PNGARG((png_structp png_ptr, png_bytep ptr, + png_size_t length)); + +#if defined(PNG_WRITE_FLUSH_SUPPORTED) +PNG_EXTERN void png_flush PNGARG((png_structp png_ptr)); +#endif + +/* simple function to write the signature */ +PNG_EXTERN void png_write_sig PNGARG((png_structp png_ptr)); + +/* write various chunks */ + +/* Write the IHDR chunk, and update the png_struct with the necessary + * information. + */ +PNG_EXTERN void png_write_IHDR PNGARG((png_structp png_ptr, png_uint_32 width, + png_uint_32 height, + int bit_depth, int color_type, int compression_method, int filter_method, + int interlace_method)); + +PNG_EXTERN void png_write_PLTE PNGARG((png_structp png_ptr, png_colorp palette, + png_uint_32 num_pal)); + +PNG_EXTERN void png_write_IDAT PNGARG((png_structp png_ptr, png_bytep data, + png_size_t length)); + +PNG_EXTERN void png_write_IEND PNGARG((png_structp png_ptr)); + +#if defined(PNG_WRITE_gAMA_SUPPORTED) +#ifdef PNG_FLOATING_POINT_SUPPORTED +PNG_EXTERN void png_write_gAMA PNGARG((png_structp png_ptr, double file_gamma)); +#endif +#ifdef PNG_FIXED_POINT_SUPPORTED +PNG_EXTERN void png_write_gAMA_fixed PNGARG((png_structp png_ptr, png_fixed_point + file_gamma)); +#endif +#endif + +#if defined(PNG_WRITE_sBIT_SUPPORTED) +PNG_EXTERN void png_write_sBIT PNGARG((png_structp png_ptr, png_color_8p sbit, + int color_type)); +#endif + +#if defined(PNG_WRITE_cHRM_SUPPORTED) +#ifdef PNG_FLOATING_POINT_SUPPORTED +PNG_EXTERN void png_write_cHRM PNGARG((png_structp png_ptr, + double white_x, double white_y, + double red_x, double red_y, double green_x, double green_y, + double blue_x, double blue_y)); +#endif +#ifdef PNG_FIXED_POINT_SUPPORTED +PNG_EXTERN void png_write_cHRM_fixed PNGARG((png_structp png_ptr, + png_fixed_point int_white_x, png_fixed_point int_white_y, + png_fixed_point int_red_x, png_fixed_point int_red_y, png_fixed_point + int_green_x, png_fixed_point int_green_y, png_fixed_point int_blue_x, + png_fixed_point int_blue_y)); +#endif +#endif + +#if defined(PNG_WRITE_sRGB_SUPPORTED) +PNG_EXTERN void png_write_sRGB PNGARG((png_structp png_ptr, + int intent)); +#endif + +#if defined(PNG_WRITE_iCCP_SUPPORTED) +PNG_EXTERN void png_write_iCCP PNGARG((png_structp png_ptr, + png_charp name, int compression_type, + png_charp profile, int proflen)); + /* Note to maintainer: profile should be png_bytep */ +#endif + +#if defined(PNG_WRITE_sPLT_SUPPORTED) +PNG_EXTERN void png_write_sPLT PNGARG((png_structp png_ptr, + png_sPLT_tp palette)); +#endif + +#if defined(PNG_WRITE_tRNS_SUPPORTED) +PNG_EXTERN void png_write_tRNS PNGARG((png_structp png_ptr, png_bytep trans, + png_color_16p values, int number, int color_type)); +#endif + +#if defined(PNG_WRITE_bKGD_SUPPORTED) +PNG_EXTERN void png_write_bKGD PNGARG((png_structp png_ptr, + png_color_16p values, int color_type)); +#endif + +#if defined(PNG_WRITE_hIST_SUPPORTED) +PNG_EXTERN void png_write_hIST PNGARG((png_structp png_ptr, png_uint_16p hist, + int num_hist)); +#endif + +#if defined(PNG_WRITE_TEXT_SUPPORTED) || defined(PNG_WRITE_pCAL_SUPPORTED) || \ + defined(PNG_WRITE_iCCP_SUPPORTED) || defined(PNG_WRITE_sPLT_SUPPORTED) +PNG_EXTERN png_size_t png_check_keyword PNGARG((png_structp png_ptr, + png_charp key, png_charpp new_key)); +#endif + +#if defined(PNG_WRITE_tEXt_SUPPORTED) +PNG_EXTERN void png_write_tEXt PNGARG((png_structp png_ptr, png_charp key, + png_charp text, png_size_t text_len)); +#endif + +#if defined(PNG_WRITE_zTXt_SUPPORTED) +PNG_EXTERN void png_write_zTXt PNGARG((png_structp png_ptr, png_charp key, + png_charp text, png_size_t text_len, int compression)); +#endif + +#if defined(PNG_WRITE_iTXt_SUPPORTED) +PNG_EXTERN void png_write_iTXt PNGARG((png_structp png_ptr, + int compression, png_charp key, png_charp lang, png_charp lang_key, + png_charp text)); +#endif + +#if defined(PNG_TEXT_SUPPORTED) /* Added at version 1.0.14 and 1.2.4 */ +PNG_EXTERN int png_set_text_2 PNGARG((png_structp png_ptr, + png_infop info_ptr, png_textp text_ptr, int num_text)); +#endif + +#if defined(PNG_WRITE_oFFs_SUPPORTED) +PNG_EXTERN void png_write_oFFs PNGARG((png_structp png_ptr, + png_int_32 x_offset, png_int_32 y_offset, int unit_type)); +#endif + +#if defined(PNG_WRITE_pCAL_SUPPORTED) +PNG_EXTERN void png_write_pCAL PNGARG((png_structp png_ptr, png_charp purpose, + png_int_32 X0, png_int_32 X1, int type, int nparams, + png_charp units, png_charpp params)); +#endif + +#if defined(PNG_WRITE_pHYs_SUPPORTED) +PNG_EXTERN void png_write_pHYs PNGARG((png_structp png_ptr, + png_uint_32 x_pixels_per_unit, png_uint_32 y_pixels_per_unit, + int unit_type)); +#endif + +#if defined(PNG_WRITE_tIME_SUPPORTED) +PNG_EXTERN void png_write_tIME PNGARG((png_structp png_ptr, + png_timep mod_time)); +#endif + +#if defined(PNG_WRITE_sCAL_SUPPORTED) +#if defined(PNG_FLOATING_POINT_SUPPORTED) && !defined(PNG_NO_STDIO) +PNG_EXTERN void png_write_sCAL PNGARG((png_structp png_ptr, + int unit, double width, double height)); +#else +#ifdef PNG_FIXED_POINT_SUPPORTED +PNG_EXTERN void png_write_sCAL_s PNGARG((png_structp png_ptr, + int unit, png_charp width, png_charp height)); +#endif +#endif +#endif + +/* Called when finished processing a row of data */ +PNG_EXTERN void png_write_finish_row PNGARG((png_structp png_ptr)); + +/* Internal use only. Called before first row of data */ +PNG_EXTERN void png_write_start_row PNGARG((png_structp png_ptr)); + +#if defined(PNG_READ_GAMMA_SUPPORTED) +PNG_EXTERN void png_build_gamma_table PNGARG((png_structp png_ptr)); +#endif + +/* combine a row of data, dealing with alpha, etc. if requested */ +PNG_EXTERN void png_combine_row PNGARG((png_structp png_ptr, png_bytep row, + int mask)); + +#if defined(PNG_READ_INTERLACING_SUPPORTED) +/* expand an interlaced row */ +/* OLD pre-1.0.9 interface: +PNG_EXTERN void png_do_read_interlace PNGARG((png_row_infop row_info, + png_bytep row, int pass, png_uint_32 transformations)); + */ +PNG_EXTERN void png_do_read_interlace PNGARG((png_structp png_ptr)); +#endif + +/* GRR TO DO (2.0 or whenever): simplify other internal calling interfaces */ + +#if defined(PNG_WRITE_INTERLACING_SUPPORTED) +/* grab pixels out of a row for an interlaced pass */ +PNG_EXTERN void png_do_write_interlace PNGARG((png_row_infop row_info, + png_bytep row, int pass)); +#endif + +/* unfilter a row */ +PNG_EXTERN void png_read_filter_row PNGARG((png_structp png_ptr, + png_row_infop row_info, png_bytep row, png_bytep prev_row, int filter)); + +/* Choose the best filter to use and filter the row data */ +PNG_EXTERN void png_write_find_filter PNGARG((png_structp png_ptr, + png_row_infop row_info)); + +/* Write out the filtered row. */ +PNG_EXTERN void png_write_filtered_row PNGARG((png_structp png_ptr, + png_bytep filtered_row)); +/* finish a row while reading, dealing with interlacing passes, etc. */ +PNG_EXTERN void png_read_finish_row PNGARG((png_structp png_ptr)); + +/* initialize the row buffers, etc. */ +PNG_EXTERN void png_read_start_row PNGARG((png_structp png_ptr)); +/* optional call to update the users info structure */ +PNG_EXTERN void png_read_transform_info PNGARG((png_structp png_ptr, + png_infop info_ptr)); + +/* these are the functions that do the transformations */ +#if defined(PNG_READ_FILLER_SUPPORTED) +PNG_EXTERN void png_do_read_filler PNGARG((png_row_infop row_info, + png_bytep row, png_uint_32 filler, png_uint_32 flags)); +#endif + +#if defined(PNG_READ_SWAP_ALPHA_SUPPORTED) +PNG_EXTERN void png_do_read_swap_alpha PNGARG((png_row_infop row_info, + png_bytep row)); +#endif + +#if defined(PNG_WRITE_SWAP_ALPHA_SUPPORTED) +PNG_EXTERN void png_do_write_swap_alpha PNGARG((png_row_infop row_info, + png_bytep row)); +#endif + +#if defined(PNG_READ_INVERT_ALPHA_SUPPORTED) +PNG_EXTERN void png_do_read_invert_alpha PNGARG((png_row_infop row_info, + png_bytep row)); +#endif + +#if defined(PNG_WRITE_INVERT_ALPHA_SUPPORTED) +PNG_EXTERN void png_do_write_invert_alpha PNGARG((png_row_infop row_info, + png_bytep row)); +#endif + +#if defined(PNG_WRITE_FILLER_SUPPORTED) || \ + defined(PNG_READ_STRIP_ALPHA_SUPPORTED) +PNG_EXTERN void png_do_strip_filler PNGARG((png_row_infop row_info, + png_bytep row, png_uint_32 flags)); +#endif + +#if defined(PNG_READ_SWAP_SUPPORTED) || defined(PNG_WRITE_SWAP_SUPPORTED) +PNG_EXTERN void png_do_swap PNGARG((png_row_infop row_info, png_bytep row)); +#endif + +#if defined(PNG_READ_PACKSWAP_SUPPORTED) || defined(PNG_WRITE_PACKSWAP_SUPPORTED) +PNG_EXTERN void png_do_packswap PNGARG((png_row_infop row_info, png_bytep row)); +#endif + +#if defined(PNG_READ_RGB_TO_GRAY_SUPPORTED) +PNG_EXTERN int png_do_rgb_to_gray PNGARG((png_structp png_ptr, png_row_infop + row_info, png_bytep row)); +#endif + +#if defined(PNG_READ_GRAY_TO_RGB_SUPPORTED) +PNG_EXTERN void png_do_gray_to_rgb PNGARG((png_row_infop row_info, + png_bytep row)); +#endif + +#if defined(PNG_READ_PACK_SUPPORTED) +PNG_EXTERN void png_do_unpack PNGARG((png_row_infop row_info, png_bytep row)); +#endif + +#if defined(PNG_READ_SHIFT_SUPPORTED) +PNG_EXTERN void png_do_unshift PNGARG((png_row_infop row_info, png_bytep row, + png_color_8p sig_bits)); +#endif + +#if defined(PNG_READ_INVERT_SUPPORTED) || defined(PNG_WRITE_INVERT_SUPPORTED) +PNG_EXTERN void png_do_invert PNGARG((png_row_infop row_info, png_bytep row)); +#endif + +#if defined(PNG_READ_16_TO_8_SUPPORTED) +PNG_EXTERN void png_do_chop PNGARG((png_row_infop row_info, png_bytep row)); +#endif + +#if defined(PNG_READ_DITHER_SUPPORTED) +PNG_EXTERN void png_do_dither PNGARG((png_row_infop row_info, + png_bytep row, png_bytep palette_lookup, png_bytep dither_lookup)); + +# if defined(PNG_CORRECT_PALETTE_SUPPORTED) +PNG_EXTERN void png_correct_palette PNGARG((png_structp png_ptr, + png_colorp palette, int num_palette)); +# endif +#endif + +#if defined(PNG_READ_BGR_SUPPORTED) || defined(PNG_WRITE_BGR_SUPPORTED) +PNG_EXTERN void png_do_bgr PNGARG((png_row_infop row_info, png_bytep row)); +#endif + +#if defined(PNG_WRITE_PACK_SUPPORTED) +PNG_EXTERN void png_do_pack PNGARG((png_row_infop row_info, + png_bytep row, png_uint_32 bit_depth)); +#endif + +#if defined(PNG_WRITE_SHIFT_SUPPORTED) +PNG_EXTERN void png_do_shift PNGARG((png_row_infop row_info, png_bytep row, + png_color_8p bit_depth)); +#endif + +#if defined(PNG_READ_BACKGROUND_SUPPORTED) +#if defined(PNG_READ_GAMMA_SUPPORTED) +PNG_EXTERN void png_do_background PNGARG((png_row_infop row_info, png_bytep row, + png_color_16p trans_values, png_color_16p background, + png_color_16p background_1, + png_bytep gamma_table, png_bytep gamma_from_1, png_bytep gamma_to_1, + png_uint_16pp gamma_16, png_uint_16pp gamma_16_from_1, + png_uint_16pp gamma_16_to_1, int gamma_shift)); +#else +PNG_EXTERN void png_do_background PNGARG((png_row_infop row_info, png_bytep row, + png_color_16p trans_values, png_color_16p background)); +#endif +#endif + +#if defined(PNG_READ_GAMMA_SUPPORTED) +PNG_EXTERN void png_do_gamma PNGARG((png_row_infop row_info, png_bytep row, + png_bytep gamma_table, png_uint_16pp gamma_16_table, + int gamma_shift)); +#endif + +#if defined(PNG_READ_EXPAND_SUPPORTED) +PNG_EXTERN void png_do_expand_palette PNGARG((png_row_infop row_info, + png_bytep row, png_colorp palette, png_bytep trans, int num_trans)); +PNG_EXTERN void png_do_expand PNGARG((png_row_infop row_info, + png_bytep row, png_color_16p trans_value)); +#endif + +/* The following decodes the appropriate chunks, and does error correction, + * then calls the appropriate callback for the chunk if it is valid. + */ + +/* decode the IHDR chunk */ +PNG_EXTERN void png_handle_IHDR PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +PNG_EXTERN void png_handle_PLTE PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +PNG_EXTERN void png_handle_IEND PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); + +#if defined(PNG_READ_bKGD_SUPPORTED) +PNG_EXTERN void png_handle_bKGD PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_cHRM_SUPPORTED) +PNG_EXTERN void png_handle_cHRM PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_gAMA_SUPPORTED) +PNG_EXTERN void png_handle_gAMA PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_hIST_SUPPORTED) +PNG_EXTERN void png_handle_hIST PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_iCCP_SUPPORTED) +extern void png_handle_iCCP PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif /* PNG_READ_iCCP_SUPPORTED */ + +#if defined(PNG_READ_iTXt_SUPPORTED) +PNG_EXTERN void png_handle_iTXt PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_oFFs_SUPPORTED) +PNG_EXTERN void png_handle_oFFs PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_pCAL_SUPPORTED) +PNG_EXTERN void png_handle_pCAL PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_pHYs_SUPPORTED) +PNG_EXTERN void png_handle_pHYs PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_sBIT_SUPPORTED) +PNG_EXTERN void png_handle_sBIT PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_sCAL_SUPPORTED) +PNG_EXTERN void png_handle_sCAL PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_sPLT_SUPPORTED) +extern void png_handle_sPLT PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif /* PNG_READ_sPLT_SUPPORTED */ + +#if defined(PNG_READ_sRGB_SUPPORTED) +PNG_EXTERN void png_handle_sRGB PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_tEXt_SUPPORTED) +PNG_EXTERN void png_handle_tEXt PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_tIME_SUPPORTED) +PNG_EXTERN void png_handle_tIME PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_tRNS_SUPPORTED) +PNG_EXTERN void png_handle_tRNS PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +#if defined(PNG_READ_zTXt_SUPPORTED) +PNG_EXTERN void png_handle_zTXt PNGARG((png_structp png_ptr, png_infop info_ptr, + png_uint_32 length)); +#endif + +PNG_EXTERN void png_handle_unknown PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_32 length)); + +PNG_EXTERN void png_check_chunk_name PNGARG((png_structp png_ptr, + png_bytep chunk_name)); + +/* handle the transformations for reading and writing */ +PNG_EXTERN void png_do_read_transformations PNGARG((png_structp png_ptr)); +PNG_EXTERN void png_do_write_transformations PNGARG((png_structp png_ptr)); + +PNG_EXTERN void png_init_read_transformations PNGARG((png_structp png_ptr)); + +#ifdef PNG_PROGRESSIVE_READ_SUPPORTED +PNG_EXTERN void png_push_read_chunk PNGARG((png_structp png_ptr, + png_infop info_ptr)); +PNG_EXTERN void png_push_read_sig PNGARG((png_structp png_ptr, + png_infop info_ptr)); +PNG_EXTERN void png_push_check_crc PNGARG((png_structp png_ptr)); +PNG_EXTERN void png_push_crc_skip PNGARG((png_structp png_ptr, + png_uint_32 length)); +PNG_EXTERN void png_push_crc_finish PNGARG((png_structp png_ptr)); +PNG_EXTERN void png_push_save_buffer PNGARG((png_structp png_ptr)); +PNG_EXTERN void png_push_restore_buffer PNGARG((png_structp png_ptr, + png_bytep buffer, png_size_t buffer_length)); +PNG_EXTERN void png_push_read_IDAT PNGARG((png_structp png_ptr)); +PNG_EXTERN void png_process_IDAT_data PNGARG((png_structp png_ptr, + png_bytep buffer, png_size_t buffer_length)); +PNG_EXTERN void png_push_process_row PNGARG((png_structp png_ptr)); +PNG_EXTERN void png_push_handle_unknown PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_32 length)); +PNG_EXTERN void png_push_have_info PNGARG((png_structp png_ptr, + png_infop info_ptr)); +PNG_EXTERN void png_push_have_end PNGARG((png_structp png_ptr, + png_infop info_ptr)); +PNG_EXTERN void png_push_have_row PNGARG((png_structp png_ptr, png_bytep row)); +PNG_EXTERN void png_push_read_end PNGARG((png_structp png_ptr, + png_infop info_ptr)); +PNG_EXTERN void png_process_some_data PNGARG((png_structp png_ptr, + png_infop info_ptr)); +PNG_EXTERN void png_read_push_finish_row PNGARG((png_structp png_ptr)); +#if defined(PNG_READ_tEXt_SUPPORTED) +PNG_EXTERN void png_push_handle_tEXt PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_32 length)); +PNG_EXTERN void png_push_read_tEXt PNGARG((png_structp png_ptr, + png_infop info_ptr)); +#endif +#if defined(PNG_READ_zTXt_SUPPORTED) +PNG_EXTERN void png_push_handle_zTXt PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_32 length)); +PNG_EXTERN void png_push_read_zTXt PNGARG((png_structp png_ptr, + png_infop info_ptr)); +#endif +#if defined(PNG_READ_iTXt_SUPPORTED) +PNG_EXTERN void png_push_handle_iTXt PNGARG((png_structp png_ptr, + png_infop info_ptr, png_uint_32 length)); +PNG_EXTERN void png_push_read_iTXt PNGARG((png_structp png_ptr, + png_infop info_ptr)); +#endif + +#endif /* PNG_PROGRESSIVE_READ_SUPPORTED */ + +#ifdef PNG_MNG_FEATURES_SUPPORTED +PNG_EXTERN void png_do_read_intrapixel PNGARG((png_row_infop row_info, + png_bytep row)); +PNG_EXTERN void png_do_write_intrapixel PNGARG((png_row_infop row_info, + png_bytep row)); +#endif + +#if defined(PNG_ASSEMBLER_CODE_SUPPORTED) +#if defined(PNG_MMX_CODE_SUPPORTED) +/* png.c */ /* PRIVATE */ +PNG_EXTERN void png_init_mmx_flags PNGARG((png_structp png_ptr)); +#endif +#endif + +#if defined(PNG_INCH_CONVERSIONS) && defined(PNG_FLOATING_POINT_SUPPORTED) +PNG_EXTERN png_uint_32 png_get_pixels_per_inch PNGARG((png_structp png_ptr, +png_infop info_ptr)); + +PNG_EXTERN png_uint_32 png_get_x_pixels_per_inch PNGARG((png_structp png_ptr, +png_infop info_ptr)); + +PNG_EXTERN png_uint_32 png_get_y_pixels_per_inch PNGARG((png_structp png_ptr, +png_infop info_ptr)); + +PNG_EXTERN float png_get_x_offset_inches PNGARG((png_structp png_ptr, +png_infop info_ptr)); + +PNG_EXTERN float png_get_y_offset_inches PNGARG((png_structp png_ptr, +png_infop info_ptr)); + +#if defined(PNG_pHYs_SUPPORTED) +PNG_EXTERN png_uint_32 png_get_pHYs_dpi PNGARG((png_structp png_ptr, +png_infop info_ptr, png_uint_32 *res_x, png_uint_32 *res_y, int *unit_type)); +#endif /* PNG_pHYs_SUPPORTED */ +#endif /* PNG_INCH_CONVERSIONS && PNG_FLOATING_POINT_SUPPORTED */ + +/* Maintainer: Put new private prototypes here ^ and in libpngpf.3 */ + +#endif /* PNG_INTERNAL */ + +#ifdef __cplusplus +} +#endif + +#endif /* PNG_VERSION_INFO_ONLY */ +/* do not put anything past this line */ +#endif /* PNG_H */ diff --git a/source/gui/pngconf.h b/source/gui/pngconf.h new file mode 100644 index 00000000..06a182f2 --- /dev/null +++ b/source/gui/pngconf.h @@ -0,0 +1,1481 @@ + +/* pngconf.h - machine configurable file for libpng + * + * libpng version 1.2.29 - May 8, 2008 + * For conditions of distribution and use, see copyright notice in png.h + * Copyright (c) 1998-2008 Glenn Randers-Pehrson + * (Version 0.96 Copyright (c) 1996, 1997 Andreas Dilger) + * (Version 0.88 Copyright (c) 1995, 1996 Guy Eric Schalnat, Group 42, Inc.) + */ + +/* Any machine specific code is near the front of this file, so if you + * are configuring libpng for a machine, you may want to read the section + * starting here down to where it starts to typedef png_color, png_text, + * and png_info. + */ + +#ifndef PNGCONF_H +#define PNGCONF_H + +#define PNG_1_2_X + +/* + * PNG_USER_CONFIG has to be defined on the compiler command line. This + * includes the resource compiler for Windows DLL configurations. + */ +#ifdef PNG_USER_CONFIG +# ifndef PNG_USER_PRIVATEBUILD +# define PNG_USER_PRIVATEBUILD +# endif +#include "pngusr.h" +#endif + +/* PNG_CONFIGURE_LIBPNG is set by the "configure" script. */ +#ifdef PNG_CONFIGURE_LIBPNG +#ifdef HAVE_CONFIG_H +#include "config.h" +#endif +#endif + +/* + * Added at libpng-1.2.8 + * + * If you create a private DLL you need to define in "pngusr.h" the followings: + * #define PNG_USER_PRIVATEBUILD + * e.g. #define PNG_USER_PRIVATEBUILD "Build by MyCompany for xyz reasons." + * #define PNG_USER_DLLFNAME_POSTFIX + * e.g. // private DLL "libpng13gx.dll" + * #define PNG_USER_DLLFNAME_POSTFIX "gx" + * + * The following macros are also at your disposal if you want to complete the + * DLL VERSIONINFO structure. + * - PNG_USER_VERSIONINFO_COMMENTS + * - PNG_USER_VERSIONINFO_COMPANYNAME + * - PNG_USER_VERSIONINFO_LEGALTRADEMARKS + */ + +#ifdef __STDC__ +#ifdef SPECIALBUILD +# pragma message("PNG_LIBPNG_SPECIALBUILD (and deprecated SPECIALBUILD)\ + are now LIBPNG reserved macros. Use PNG_USER_PRIVATEBUILD instead.") +#endif + +#ifdef PRIVATEBUILD +# pragma message("PRIVATEBUILD is deprecated.\ + Use PNG_USER_PRIVATEBUILD instead.") +# define PNG_USER_PRIVATEBUILD PRIVATEBUILD +#endif +#endif /* __STDC__ */ + +#ifndef PNG_VERSION_INFO_ONLY + +/* End of material added to libpng-1.2.8 */ + +/* Added at libpng-1.2.19, removed at libpng-1.2.20 because it caused trouble + Restored at libpng-1.2.21 */ +#if !defined(PNG_NO_WARN_UNINITIALIZED_ROW) && \ + !defined(PNG_WARN_UNINITIALIZED_ROW) +# define PNG_WARN_UNINITIALIZED_ROW 1 +#endif +/* End of material added at libpng-1.2.19/1.2.21 */ + +/* This is the size of the compression buffer, and thus the size of + * an IDAT chunk. Make this whatever size you feel is best for your + * machine. One of these will be allocated per png_struct. When this + * is full, it writes the data to the disk, and does some other + * calculations. Making this an extremely small size will slow + * the library down, but you may want to experiment to determine + * where it becomes significant, if you are concerned with memory + * usage. Note that zlib allocates at least 32Kb also. For readers, + * this describes the size of the buffer available to read the data in. + * Unless this gets smaller than the size of a row (compressed), + * it should not make much difference how big this is. + */ + +#ifndef PNG_ZBUF_SIZE +# define PNG_ZBUF_SIZE 8192 +#endif + +/* Enable if you want a write-only libpng */ + +#ifndef PNG_NO_READ_SUPPORTED +# define PNG_READ_SUPPORTED +#endif + +/* Enable if you want a read-only libpng */ + +#ifndef PNG_NO_WRITE_SUPPORTED +# define PNG_WRITE_SUPPORTED +#endif + +/* Enabled by default in 1.2.0. You can disable this if you don't need to + support PNGs that are embedded in MNG datastreams */ +#if !defined(PNG_1_0_X) && !defined(PNG_NO_MNG_FEATURES) +# ifndef PNG_MNG_FEATURES_SUPPORTED +# define PNG_MNG_FEATURES_SUPPORTED +# endif +#endif + +#ifndef PNG_NO_FLOATING_POINT_SUPPORTED +# ifndef PNG_FLOATING_POINT_SUPPORTED +# define PNG_FLOATING_POINT_SUPPORTED +# endif +#endif + +/* If you are running on a machine where you cannot allocate more + * than 64K of memory at once, uncomment this. While libpng will not + * normally need that much memory in a chunk (unless you load up a very + * large file), zlib needs to know how big of a chunk it can use, and + * libpng thus makes sure to check any memory allocation to verify it + * will fit into memory. +#define PNG_MAX_MALLOC_64K + */ +#if defined(MAXSEG_64K) && !defined(PNG_MAX_MALLOC_64K) +# define PNG_MAX_MALLOC_64K +#endif + +/* Special munging to support doing things the 'cygwin' way: + * 'Normal' png-on-win32 defines/defaults: + * PNG_BUILD_DLL -- building dll + * PNG_USE_DLL -- building an application, linking to dll + * (no define) -- building static library, or building an + * application and linking to the static lib + * 'Cygwin' defines/defaults: + * PNG_BUILD_DLL -- (ignored) building the dll + * (no define) -- (ignored) building an application, linking to the dll + * PNG_STATIC -- (ignored) building the static lib, or building an + * application that links to the static lib. + * ALL_STATIC -- (ignored) building various static libs, or building an + * application that links to the static libs. + * Thus, + * a cygwin user should define either PNG_BUILD_DLL or PNG_STATIC, and + * this bit of #ifdefs will define the 'correct' config variables based on + * that. If a cygwin user *wants* to define 'PNG_USE_DLL' that's okay, but + * unnecessary. + * + * Also, the precedence order is: + * ALL_STATIC (since we can't #undef something outside our namespace) + * PNG_BUILD_DLL + * PNG_STATIC + * (nothing) == PNG_USE_DLL + * + * CYGWIN (2002-01-20): The preceding is now obsolete. With the advent + * of auto-import in binutils, we no longer need to worry about + * __declspec(dllexport) / __declspec(dllimport) and friends. Therefore, + * we don't need to worry about PNG_STATIC or ALL_STATIC when it comes + * to __declspec() stuff. However, we DO need to worry about + * PNG_BUILD_DLL and PNG_STATIC because those change some defaults + * such as CONSOLE_IO and whether GLOBAL_ARRAYS are allowed. + */ +#if defined(__CYGWIN__) +# if defined(ALL_STATIC) +# if defined(PNG_BUILD_DLL) +# undef PNG_BUILD_DLL +# endif +# if defined(PNG_USE_DLL) +# undef PNG_USE_DLL +# endif +# if defined(PNG_DLL) +# undef PNG_DLL +# endif +# if !defined(PNG_STATIC) +# define PNG_STATIC +# endif +# else +# if defined (PNG_BUILD_DLL) +# if defined(PNG_STATIC) +# undef PNG_STATIC +# endif +# if defined(PNG_USE_DLL) +# undef PNG_USE_DLL +# endif +# if !defined(PNG_DLL) +# define PNG_DLL +# endif +# else +# if defined(PNG_STATIC) +# if defined(PNG_USE_DLL) +# undef PNG_USE_DLL +# endif +# if defined(PNG_DLL) +# undef PNG_DLL +# endif +# else +# if !defined(PNG_USE_DLL) +# define PNG_USE_DLL +# endif +# if !defined(PNG_DLL) +# define PNG_DLL +# endif +# endif +# endif +# endif +#endif + +/* This protects us against compilers that run on a windowing system + * and thus don't have or would rather us not use the stdio types: + * stdin, stdout, and stderr. The only one currently used is stderr + * in png_error() and png_warning(). #defining PNG_NO_CONSOLE_IO will + * prevent these from being compiled and used. #defining PNG_NO_STDIO + * will also prevent these, plus will prevent the entire set of stdio + * macros and functions (FILE *, printf, etc.) from being compiled and used, + * unless (PNG_DEBUG > 0) has been #defined. + * + * #define PNG_NO_CONSOLE_IO + * #define PNG_NO_STDIO + */ + +#if defined(_WIN32_WCE) +# include + /* Console I/O functions are not supported on WindowsCE */ +# define PNG_NO_CONSOLE_IO +# ifdef PNG_DEBUG +# undef PNG_DEBUG +# endif +#endif + +#ifdef PNG_BUILD_DLL +# ifndef PNG_CONSOLE_IO_SUPPORTED +# ifndef PNG_NO_CONSOLE_IO +# define PNG_NO_CONSOLE_IO +# endif +# endif +#endif + +# ifdef PNG_NO_STDIO +# ifndef PNG_NO_CONSOLE_IO +# define PNG_NO_CONSOLE_IO +# endif +# ifdef PNG_DEBUG +# if (PNG_DEBUG > 0) +# include +# endif +# endif +# else +# if !defined(_WIN32_WCE) +/* "stdio.h" functions are not supported on WindowsCE */ +# include +# endif +# endif + +/* This macro protects us against machines that don't have function + * prototypes (ie K&R style headers). If your compiler does not handle + * function prototypes, define this macro and use the included ansi2knr. + * I've always been able to use _NO_PROTO as the indicator, but you may + * need to drag the empty declaration out in front of here, or change the + * ifdef to suit your own needs. + */ +#ifndef PNGARG + +#ifdef OF /* zlib prototype munger */ +# define PNGARG(arglist) OF(arglist) +#else + +#ifdef _NO_PROTO +# define PNGARG(arglist) () +# ifndef PNG_TYPECAST_NULL +# define PNG_TYPECAST_NULL +# endif +#else +# define PNGARG(arglist) arglist +#endif /* _NO_PROTO */ + + +#endif /* OF */ + +#endif /* PNGARG */ + +/* Try to determine if we are compiling on a Mac. Note that testing for + * just __MWERKS__ is not good enough, because the Codewarrior is now used + * on non-Mac platforms. + */ +#ifndef MACOS +# if (defined(__MWERKS__) && defined(macintosh)) || defined(applec) || \ + defined(THINK_C) || defined(__SC__) || defined(TARGET_OS_MAC) +# define MACOS +# endif +#endif + +/* enough people need this for various reasons to include it here */ +#if !defined(MACOS) && !defined(RISCOS) && !defined(_WIN32_WCE) +# include +#endif + +#if !defined(PNG_SETJMP_NOT_SUPPORTED) && !defined(PNG_NO_SETJMP_SUPPORTED) +# define PNG_SETJMP_SUPPORTED +#endif + +#ifdef PNG_SETJMP_SUPPORTED +/* This is an attempt to force a single setjmp behaviour on Linux. If + * the X config stuff didn't define _BSD_SOURCE we wouldn't need this. + */ + +# ifdef __linux__ +# ifdef _BSD_SOURCE +# define PNG_SAVE_BSD_SOURCE +# undef _BSD_SOURCE +# endif +# ifdef _SETJMP_H + /* If you encounter a compiler error here, see the explanation + * near the end of INSTALL. + */ + __pngconf.h__ already includes setjmp.h; + __dont__ include it again.; +# endif +# endif /* __linux__ */ + + /* include setjmp.h for error handling */ +# include + +# ifdef __linux__ +# ifdef PNG_SAVE_BSD_SOURCE +# ifndef _BSD_SOURCE +# define _BSD_SOURCE +# endif +# undef PNG_SAVE_BSD_SOURCE +# endif +# endif /* __linux__ */ +#endif /* PNG_SETJMP_SUPPORTED */ + +#ifdef BSD +# include +#else +# include +#endif + +/* Other defines for things like memory and the like can go here. */ +#ifdef PNG_INTERNAL + +#include + +/* The functions exported by PNG_EXTERN are PNG_INTERNAL functions, which + * aren't usually used outside the library (as far as I know), so it is + * debatable if they should be exported at all. In the future, when it is + * possible to have run-time registry of chunk-handling functions, some of + * these will be made available again. +#define PNG_EXTERN extern + */ +#define PNG_EXTERN + +/* Other defines specific to compilers can go here. Try to keep + * them inside an appropriate ifdef/endif pair for portability. + */ + +#if defined(PNG_FLOATING_POINT_SUPPORTED) +# if defined(MACOS) + /* We need to check that hasn't already been included earlier + * as it seems it doesn't agree with , yet we should really use + * if possible. + */ +# if !defined(__MATH_H__) && !defined(__MATH_H) && !defined(__cmath__) +# include +# endif +# else +# include +# endif +# if defined(_AMIGA) && defined(__SASC) && defined(_M68881) + /* Amiga SAS/C: We must include builtin FPU functions when compiling using + * MATH=68881 + */ +# include +# endif +#endif + +/* Codewarrior on NT has linking problems without this. */ +#if (defined(__MWERKS__) && defined(WIN32)) || defined(__STDC__) +# define PNG_ALWAYS_EXTERN +#endif + +/* This provides the non-ANSI (far) memory allocation routines. */ +#if defined(__TURBOC__) && defined(__MSDOS__) +# include +# include +#endif + +/* I have no idea why is this necessary... */ +#if defined(_MSC_VER) && (defined(WIN32) || defined(_Windows) || \ + defined(_WINDOWS) || defined(_WIN32) || defined(__WIN32__)) +# include +#endif + +/* This controls how fine the dithering gets. As this allocates + * a largish chunk of memory (32K), those who are not as concerned + * with dithering quality can decrease some or all of these. + */ +#ifndef PNG_DITHER_RED_BITS +# define PNG_DITHER_RED_BITS 5 +#endif +#ifndef PNG_DITHER_GREEN_BITS +# define PNG_DITHER_GREEN_BITS 5 +#endif +#ifndef PNG_DITHER_BLUE_BITS +# define PNG_DITHER_BLUE_BITS 5 +#endif + +/* This controls how fine the gamma correction becomes when you + * are only interested in 8 bits anyway. Increasing this value + * results in more memory being used, and more pow() functions + * being called to fill in the gamma tables. Don't set this value + * less then 8, and even that may not work (I haven't tested it). + */ + +#ifndef PNG_MAX_GAMMA_8 +# define PNG_MAX_GAMMA_8 11 +#endif + +/* This controls how much a difference in gamma we can tolerate before + * we actually start doing gamma conversion. + */ +#ifndef PNG_GAMMA_THRESHOLD +# define PNG_GAMMA_THRESHOLD 0.05 +#endif + +#endif /* PNG_INTERNAL */ + +/* The following uses const char * instead of char * for error + * and warning message functions, so some compilers won't complain. + * If you do not want to use const, define PNG_NO_CONST here. + */ + +#ifndef PNG_NO_CONST +# define PNG_CONST const +#else +# define PNG_CONST +#endif + +/* The following defines give you the ability to remove code from the + * library that you will not be using. I wish I could figure out how to + * automate this, but I can't do that without making it seriously hard + * on the users. So if you are not using an ability, change the #define + * to and #undef, and that part of the library will not be compiled. If + * your linker can't find a function, you may want to make sure the + * ability is defined here. Some of these depend upon some others being + * defined. I haven't figured out all the interactions here, so you may + * have to experiment awhile to get everything to compile. If you are + * creating or using a shared library, you probably shouldn't touch this, + * as it will affect the size of the structures, and this will cause bad + * things to happen if the library and/or application ever change. + */ + +/* Any features you will not be using can be undef'ed here */ + +/* GR-P, 0.96a: Set "*TRANSFORMS_SUPPORTED as default but allow user + * to turn it off with "*TRANSFORMS_NOT_SUPPORTED" or *PNG_NO_*_TRANSFORMS + * on the compile line, then pick and choose which ones to define without + * having to edit this file. It is safe to use the *TRANSFORMS_NOT_SUPPORTED + * if you only want to have a png-compliant reader/writer but don't need + * any of the extra transformations. This saves about 80 kbytes in a + * typical installation of the library. (PNG_NO_* form added in version + * 1.0.1c, for consistency) + */ + +/* The size of the png_text structure changed in libpng-1.0.6 when + * iTXt support was added. iTXt support was turned off by default through + * libpng-1.2.x, to support old apps that malloc the png_text structure + * instead of calling png_set_text() and letting libpng malloc it. It + * was turned on by default in libpng-1.3.0. + */ + +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +# ifndef PNG_NO_iTXt_SUPPORTED +# define PNG_NO_iTXt_SUPPORTED +# endif +# ifndef PNG_NO_READ_iTXt +# define PNG_NO_READ_iTXt +# endif +# ifndef PNG_NO_WRITE_iTXt +# define PNG_NO_WRITE_iTXt +# endif +#endif + +#if !defined(PNG_NO_iTXt_SUPPORTED) +# if !defined(PNG_READ_iTXt_SUPPORTED) && !defined(PNG_NO_READ_iTXt) +# define PNG_READ_iTXt +# endif +# if !defined(PNG_WRITE_iTXt_SUPPORTED) && !defined(PNG_NO_WRITE_iTXt) +# define PNG_WRITE_iTXt +# endif +#endif + +/* The following support, added after version 1.0.0, can be turned off here en + * masse by defining PNG_LEGACY_SUPPORTED in case you need binary compatibility + * with old applications that require the length of png_struct and png_info + * to remain unchanged. + */ + +#ifdef PNG_LEGACY_SUPPORTED +# define PNG_NO_FREE_ME +# define PNG_NO_READ_UNKNOWN_CHUNKS +# define PNG_NO_WRITE_UNKNOWN_CHUNKS +# define PNG_NO_READ_USER_CHUNKS +# define PNG_NO_READ_iCCP +# define PNG_NO_WRITE_iCCP +# define PNG_NO_READ_iTXt +# define PNG_NO_WRITE_iTXt +# define PNG_NO_READ_sCAL +# define PNG_NO_WRITE_sCAL +# define PNG_NO_READ_sPLT +# define PNG_NO_WRITE_sPLT +# define PNG_NO_INFO_IMAGE +# define PNG_NO_READ_RGB_TO_GRAY +# define PNG_NO_READ_USER_TRANSFORM +# define PNG_NO_WRITE_USER_TRANSFORM +# define PNG_NO_USER_MEM +# define PNG_NO_READ_EMPTY_PLTE +# define PNG_NO_MNG_FEATURES +# define PNG_NO_FIXED_POINT_SUPPORTED +#endif + +/* Ignore attempt to turn off both floating and fixed point support */ +#if !defined(PNG_FLOATING_POINT_SUPPORTED) || \ + !defined(PNG_NO_FIXED_POINT_SUPPORTED) +# define PNG_FIXED_POINT_SUPPORTED +#endif + +#ifndef PNG_NO_FREE_ME +# define PNG_FREE_ME_SUPPORTED +#endif + +#if defined(PNG_READ_SUPPORTED) + +#if !defined(PNG_READ_TRANSFORMS_NOT_SUPPORTED) && \ + !defined(PNG_NO_READ_TRANSFORMS) +# define PNG_READ_TRANSFORMS_SUPPORTED +#endif + +#ifdef PNG_READ_TRANSFORMS_SUPPORTED +# ifndef PNG_NO_READ_EXPAND +# define PNG_READ_EXPAND_SUPPORTED +# endif +# ifndef PNG_NO_READ_SHIFT +# define PNG_READ_SHIFT_SUPPORTED +# endif +# ifndef PNG_NO_READ_PACK +# define PNG_READ_PACK_SUPPORTED +# endif +# ifndef PNG_NO_READ_BGR +# define PNG_READ_BGR_SUPPORTED +# endif +# ifndef PNG_NO_READ_SWAP +# define PNG_READ_SWAP_SUPPORTED +# endif +# ifndef PNG_NO_READ_PACKSWAP +# define PNG_READ_PACKSWAP_SUPPORTED +# endif +# ifndef PNG_NO_READ_INVERT +# define PNG_READ_INVERT_SUPPORTED +# endif +# ifndef PNG_NO_READ_DITHER +# define PNG_READ_DITHER_SUPPORTED +# endif +# ifndef PNG_NO_READ_BACKGROUND +# define PNG_READ_BACKGROUND_SUPPORTED +# endif +# ifndef PNG_NO_READ_16_TO_8 +# define PNG_READ_16_TO_8_SUPPORTED +# endif +# ifndef PNG_NO_READ_FILLER +# define PNG_READ_FILLER_SUPPORTED +# endif +# ifndef PNG_NO_READ_GAMMA +# define PNG_READ_GAMMA_SUPPORTED +# endif +# ifndef PNG_NO_READ_GRAY_TO_RGB +# define PNG_READ_GRAY_TO_RGB_SUPPORTED +# endif +# ifndef PNG_NO_READ_SWAP_ALPHA +# define PNG_READ_SWAP_ALPHA_SUPPORTED +# endif +# ifndef PNG_NO_READ_INVERT_ALPHA +# define PNG_READ_INVERT_ALPHA_SUPPORTED +# endif +# ifndef PNG_NO_READ_STRIP_ALPHA +# define PNG_READ_STRIP_ALPHA_SUPPORTED +# endif +# ifndef PNG_NO_READ_USER_TRANSFORM +# define PNG_READ_USER_TRANSFORM_SUPPORTED +# endif +# ifndef PNG_NO_READ_RGB_TO_GRAY +# define PNG_READ_RGB_TO_GRAY_SUPPORTED +# endif +#endif /* PNG_READ_TRANSFORMS_SUPPORTED */ + +#if !defined(PNG_NO_PROGRESSIVE_READ) && \ + !defined(PNG_PROGRESSIVE_READ_SUPPORTED) /* if you don't do progressive */ +# define PNG_PROGRESSIVE_READ_SUPPORTED /* reading. This is not talking */ +#endif /* about interlacing capability! You'll */ + /* still have interlacing unless you change the following line: */ + +#define PNG_READ_INTERLACING_SUPPORTED /* required in PNG-compliant decoders */ + +#ifndef PNG_NO_READ_COMPOSITE_NODIV +# ifndef PNG_NO_READ_COMPOSITED_NODIV /* libpng-1.0.x misspelling */ +# define PNG_READ_COMPOSITE_NODIV_SUPPORTED /* well tested on Intel, SGI */ +# endif +#endif + +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +/* Deprecated, will be removed from version 2.0.0. + Use PNG_MNG_FEATURES_SUPPORTED instead. */ +#ifndef PNG_NO_READ_EMPTY_PLTE +# define PNG_READ_EMPTY_PLTE_SUPPORTED +#endif +#endif + +#endif /* PNG_READ_SUPPORTED */ + +#if defined(PNG_WRITE_SUPPORTED) + +# if !defined(PNG_WRITE_TRANSFORMS_NOT_SUPPORTED) && \ + !defined(PNG_NO_WRITE_TRANSFORMS) +# define PNG_WRITE_TRANSFORMS_SUPPORTED +#endif + +#ifdef PNG_WRITE_TRANSFORMS_SUPPORTED +# ifndef PNG_NO_WRITE_SHIFT +# define PNG_WRITE_SHIFT_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_PACK +# define PNG_WRITE_PACK_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_BGR +# define PNG_WRITE_BGR_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_SWAP +# define PNG_WRITE_SWAP_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_PACKSWAP +# define PNG_WRITE_PACKSWAP_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_INVERT +# define PNG_WRITE_INVERT_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_FILLER +# define PNG_WRITE_FILLER_SUPPORTED /* same as WRITE_STRIP_ALPHA */ +# endif +# ifndef PNG_NO_WRITE_SWAP_ALPHA +# define PNG_WRITE_SWAP_ALPHA_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_INVERT_ALPHA +# define PNG_WRITE_INVERT_ALPHA_SUPPORTED +# endif +# ifndef PNG_NO_WRITE_USER_TRANSFORM +# define PNG_WRITE_USER_TRANSFORM_SUPPORTED +# endif +#endif /* PNG_WRITE_TRANSFORMS_SUPPORTED */ + +#if !defined(PNG_NO_WRITE_INTERLACING_SUPPORTED) && \ + !defined(PNG_WRITE_INTERLACING_SUPPORTED) +#define PNG_WRITE_INTERLACING_SUPPORTED /* not required for PNG-compliant + encoders, but can cause trouble + if left undefined */ +#endif + +#if !defined(PNG_NO_WRITE_WEIGHTED_FILTER) && \ + !defined(PNG_WRITE_WEIGHTED_FILTER) && \ + defined(PNG_FLOATING_POINT_SUPPORTED) +# define PNG_WRITE_WEIGHTED_FILTER_SUPPORTED +#endif + +#ifndef PNG_NO_WRITE_FLUSH +# define PNG_WRITE_FLUSH_SUPPORTED +#endif + +#if defined(PNG_1_0_X) || defined (PNG_1_2_X) +/* Deprecated, see PNG_MNG_FEATURES_SUPPORTED, above */ +#ifndef PNG_NO_WRITE_EMPTY_PLTE +# define PNG_WRITE_EMPTY_PLTE_SUPPORTED +#endif +#endif + +#endif /* PNG_WRITE_SUPPORTED */ + +#ifndef PNG_1_0_X +# ifndef PNG_NO_ERROR_NUMBERS +# define PNG_ERROR_NUMBERS_SUPPORTED +# endif +#endif /* PNG_1_0_X */ + +#if defined(PNG_READ_USER_TRANSFORM_SUPPORTED) || \ + defined(PNG_WRITE_USER_TRANSFORM_SUPPORTED) +# ifndef PNG_NO_USER_TRANSFORM_PTR +# define PNG_USER_TRANSFORM_PTR_SUPPORTED +# endif +#endif + +#ifndef PNG_NO_STDIO +# define PNG_TIME_RFC1123_SUPPORTED +#endif + +/* This adds extra functions in pngget.c for accessing data from the + * info pointer (added in version 0.99) + * png_get_image_width() + * png_get_image_height() + * png_get_bit_depth() + * png_get_color_type() + * png_get_compression_type() + * png_get_filter_type() + * png_get_interlace_type() + * png_get_pixel_aspect_ratio() + * png_get_pixels_per_meter() + * png_get_x_offset_pixels() + * png_get_y_offset_pixels() + * png_get_x_offset_microns() + * png_get_y_offset_microns() + */ +#if !defined(PNG_NO_EASY_ACCESS) && !defined(PNG_EASY_ACCESS_SUPPORTED) +# define PNG_EASY_ACCESS_SUPPORTED +#endif + +/* PNG_ASSEMBLER_CODE was enabled by default in version 1.2.0 + * and removed from version 1.2.20. The following will be removed + * from libpng-1.4.0 +*/ + +#if defined(PNG_READ_SUPPORTED) && !defined(PNG_NO_OPTIMIZED_CODE) +# ifndef PNG_OPTIMIZED_CODE_SUPPORTED +# define PNG_OPTIMIZED_CODE_SUPPORTED +# endif +#endif + +#if defined(PNG_READ_SUPPORTED) && !defined(PNG_NO_ASSEMBLER_CODE) +# ifndef PNG_ASSEMBLER_CODE_SUPPORTED +# define PNG_ASSEMBLER_CODE_SUPPORTED +# endif + +# if defined(__GNUC__) && defined(__x86_64__) && (__GNUC__ < 4) + /* work around 64-bit gcc compiler bugs in gcc-3.x */ +# if !defined(PNG_MMX_CODE_SUPPORTED) && !defined(PNG_NO_MMX_CODE) +# define PNG_NO_MMX_CODE +# endif +# endif + +# if defined(__APPLE__) +# if !defined(PNG_MMX_CODE_SUPPORTED) && !defined(PNG_NO_MMX_CODE) +# define PNG_NO_MMX_CODE +# endif +# endif + +# if (defined(__MWERKS__) && ((__MWERKS__ < 0x0900) || macintosh)) +# if !defined(PNG_MMX_CODE_SUPPORTED) && !defined(PNG_NO_MMX_CODE) +# define PNG_NO_MMX_CODE +# endif +# endif + +# if !defined(PNG_MMX_CODE_SUPPORTED) && !defined(PNG_NO_MMX_CODE) +# define PNG_MMX_CODE_SUPPORTED +# endif + +#endif +/* end of obsolete code to be removed from libpng-1.4.0 */ + +#if !defined(PNG_1_0_X) +#if !defined(PNG_NO_USER_MEM) && !defined(PNG_USER_MEM_SUPPORTED) +# define PNG_USER_MEM_SUPPORTED +#endif +#endif /* PNG_1_0_X */ + +/* Added at libpng-1.2.6 */ +#if !defined(PNG_1_0_X) +#ifndef PNG_SET_USER_LIMITS_SUPPORTED +#if !defined(PNG_NO_SET_USER_LIMITS) && !defined(PNG_SET_USER_LIMITS_SUPPORTED) +# define PNG_SET_USER_LIMITS_SUPPORTED +#endif +#endif +#endif /* PNG_1_0_X */ + +/* Added at libpng-1.0.16 and 1.2.6. To accept all valid PNGS no matter + * how large, set these limits to 0x7fffffffL + */ +#ifndef PNG_USER_WIDTH_MAX +# define PNG_USER_WIDTH_MAX 1000000L +#endif +#ifndef PNG_USER_HEIGHT_MAX +# define PNG_USER_HEIGHT_MAX 1000000L +#endif + +/* These are currently experimental features, define them if you want */ + +/* very little testing */ +/* +#ifdef PNG_READ_SUPPORTED +# ifndef PNG_READ_16_TO_8_ACCURATE_SCALE_SUPPORTED +# define PNG_READ_16_TO_8_ACCURATE_SCALE_SUPPORTED +# endif +#endif +*/ + +/* This is only for PowerPC big-endian and 680x0 systems */ +/* some testing */ +/* +#ifndef PNG_READ_BIG_ENDIAN_SUPPORTED +# define PNG_READ_BIG_ENDIAN_SUPPORTED +#endif +*/ + +/* Buggy compilers (e.g., gcc 2.7.2.2) need this */ +/* +#define PNG_NO_POINTER_INDEXING +*/ + +/* These functions are turned off by default, as they will be phased out. */ +/* +#define PNG_USELESS_TESTS_SUPPORTED +#define PNG_CORRECT_PALETTE_SUPPORTED +*/ + +/* Any chunks you are not interested in, you can undef here. The + * ones that allocate memory may be expecially important (hIST, + * tEXt, zTXt, tRNS, pCAL). Others will just save time and make png_info + * a bit smaller. + */ + +#if defined(PNG_READ_SUPPORTED) && \ + !defined(PNG_READ_ANCILLARY_CHUNKS_NOT_SUPPORTED) && \ + !defined(PNG_NO_READ_ANCILLARY_CHUNKS) +# define PNG_READ_ANCILLARY_CHUNKS_SUPPORTED +#endif + +#if defined(PNG_WRITE_SUPPORTED) && \ + !defined(PNG_WRITE_ANCILLARY_CHUNKS_NOT_SUPPORTED) && \ + !defined(PNG_NO_WRITE_ANCILLARY_CHUNKS) +# define PNG_WRITE_ANCILLARY_CHUNKS_SUPPORTED +#endif + +#ifdef PNG_READ_ANCILLARY_CHUNKS_SUPPORTED + +#ifdef PNG_NO_READ_TEXT +# define PNG_NO_READ_iTXt +# define PNG_NO_READ_tEXt +# define PNG_NO_READ_zTXt +#endif +#ifndef PNG_NO_READ_bKGD +# define PNG_READ_bKGD_SUPPORTED +# define PNG_bKGD_SUPPORTED +#endif +#ifndef PNG_NO_READ_cHRM +# define PNG_READ_cHRM_SUPPORTED +# define PNG_cHRM_SUPPORTED +#endif +#ifndef PNG_NO_READ_gAMA +# define PNG_READ_gAMA_SUPPORTED +# define PNG_gAMA_SUPPORTED +#endif +#ifndef PNG_NO_READ_hIST +# define PNG_READ_hIST_SUPPORTED +# define PNG_hIST_SUPPORTED +#endif +#ifndef PNG_NO_READ_iCCP +# define PNG_READ_iCCP_SUPPORTED +# define PNG_iCCP_SUPPORTED +#endif +#ifndef PNG_NO_READ_iTXt +# ifndef PNG_READ_iTXt_SUPPORTED +# define PNG_READ_iTXt_SUPPORTED +# endif +# ifndef PNG_iTXt_SUPPORTED +# define PNG_iTXt_SUPPORTED +# endif +#endif +#ifndef PNG_NO_READ_oFFs +# define PNG_READ_oFFs_SUPPORTED +# define PNG_oFFs_SUPPORTED +#endif +#ifndef PNG_NO_READ_pCAL +# define PNG_READ_pCAL_SUPPORTED +# define PNG_pCAL_SUPPORTED +#endif +#ifndef PNG_NO_READ_sCAL +# define PNG_READ_sCAL_SUPPORTED +# define PNG_sCAL_SUPPORTED +#endif +#ifndef PNG_NO_READ_pHYs +# define PNG_READ_pHYs_SUPPORTED +# define PNG_pHYs_SUPPORTED +#endif +#ifndef PNG_NO_READ_sBIT +# define PNG_READ_sBIT_SUPPORTED +# define PNG_sBIT_SUPPORTED +#endif +#ifndef PNG_NO_READ_sPLT +# define PNG_READ_sPLT_SUPPORTED +# define PNG_sPLT_SUPPORTED +#endif +#ifndef PNG_NO_READ_sRGB +# define PNG_READ_sRGB_SUPPORTED +# define PNG_sRGB_SUPPORTED +#endif +#ifndef PNG_NO_READ_tEXt +# define PNG_READ_tEXt_SUPPORTED +# define PNG_tEXt_SUPPORTED +#endif +#ifndef PNG_NO_READ_tIME +# define PNG_READ_tIME_SUPPORTED +# define PNG_tIME_SUPPORTED +#endif +#ifndef PNG_NO_READ_tRNS +# define PNG_READ_tRNS_SUPPORTED +# define PNG_tRNS_SUPPORTED +#endif +#ifndef PNG_NO_READ_zTXt +# define PNG_READ_zTXt_SUPPORTED +# define PNG_zTXt_SUPPORTED +#endif +#ifndef PNG_NO_READ_UNKNOWN_CHUNKS +# define PNG_READ_UNKNOWN_CHUNKS_SUPPORTED +# ifndef PNG_UNKNOWN_CHUNKS_SUPPORTED +# define PNG_UNKNOWN_CHUNKS_SUPPORTED +# endif +# ifndef PNG_NO_HANDLE_AS_UNKNOWN +# define PNG_HANDLE_AS_UNKNOWN_SUPPORTED +# endif +#endif +#if !defined(PNG_NO_READ_USER_CHUNKS) && \ + defined(PNG_READ_UNKNOWN_CHUNKS_SUPPORTED) +# define PNG_READ_USER_CHUNKS_SUPPORTED +# define PNG_USER_CHUNKS_SUPPORTED +# ifdef PNG_NO_READ_UNKNOWN_CHUNKS +# undef PNG_NO_READ_UNKNOWN_CHUNKS +# endif +# ifdef PNG_NO_HANDLE_AS_UNKNOWN +# undef PNG_NO_HANDLE_AS_UNKNOWN +# endif +#endif +#ifndef PNG_NO_READ_OPT_PLTE +# define PNG_READ_OPT_PLTE_SUPPORTED /* only affects support of the */ +#endif /* optional PLTE chunk in RGB and RGBA images */ +#if defined(PNG_READ_iTXt_SUPPORTED) || defined(PNG_READ_tEXt_SUPPORTED) || \ + defined(PNG_READ_zTXt_SUPPORTED) +# define PNG_READ_TEXT_SUPPORTED +# define PNG_TEXT_SUPPORTED +#endif + +#endif /* PNG_READ_ANCILLARY_CHUNKS_SUPPORTED */ + +#ifdef PNG_WRITE_ANCILLARY_CHUNKS_SUPPORTED + +#ifdef PNG_NO_WRITE_TEXT +# define PNG_NO_WRITE_iTXt +# define PNG_NO_WRITE_tEXt +# define PNG_NO_WRITE_zTXt +#endif +#ifndef PNG_NO_WRITE_bKGD +# define PNG_WRITE_bKGD_SUPPORTED +# ifndef PNG_bKGD_SUPPORTED +# define PNG_bKGD_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_cHRM +# define PNG_WRITE_cHRM_SUPPORTED +# ifndef PNG_cHRM_SUPPORTED +# define PNG_cHRM_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_gAMA +# define PNG_WRITE_gAMA_SUPPORTED +# ifndef PNG_gAMA_SUPPORTED +# define PNG_gAMA_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_hIST +# define PNG_WRITE_hIST_SUPPORTED +# ifndef PNG_hIST_SUPPORTED +# define PNG_hIST_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_iCCP +# define PNG_WRITE_iCCP_SUPPORTED +# ifndef PNG_iCCP_SUPPORTED +# define PNG_iCCP_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_iTXt +# ifndef PNG_WRITE_iTXt_SUPPORTED +# define PNG_WRITE_iTXt_SUPPORTED +# endif +# ifndef PNG_iTXt_SUPPORTED +# define PNG_iTXt_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_oFFs +# define PNG_WRITE_oFFs_SUPPORTED +# ifndef PNG_oFFs_SUPPORTED +# define PNG_oFFs_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_pCAL +# define PNG_WRITE_pCAL_SUPPORTED +# ifndef PNG_pCAL_SUPPORTED +# define PNG_pCAL_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_sCAL +# define PNG_WRITE_sCAL_SUPPORTED +# ifndef PNG_sCAL_SUPPORTED +# define PNG_sCAL_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_pHYs +# define PNG_WRITE_pHYs_SUPPORTED +# ifndef PNG_pHYs_SUPPORTED +# define PNG_pHYs_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_sBIT +# define PNG_WRITE_sBIT_SUPPORTED +# ifndef PNG_sBIT_SUPPORTED +# define PNG_sBIT_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_sPLT +# define PNG_WRITE_sPLT_SUPPORTED +# ifndef PNG_sPLT_SUPPORTED +# define PNG_sPLT_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_sRGB +# define PNG_WRITE_sRGB_SUPPORTED +# ifndef PNG_sRGB_SUPPORTED +# define PNG_sRGB_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_tEXt +# define PNG_WRITE_tEXt_SUPPORTED +# ifndef PNG_tEXt_SUPPORTED +# define PNG_tEXt_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_tIME +# define PNG_WRITE_tIME_SUPPORTED +# ifndef PNG_tIME_SUPPORTED +# define PNG_tIME_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_tRNS +# define PNG_WRITE_tRNS_SUPPORTED +# ifndef PNG_tRNS_SUPPORTED +# define PNG_tRNS_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_zTXt +# define PNG_WRITE_zTXt_SUPPORTED +# ifndef PNG_zTXt_SUPPORTED +# define PNG_zTXt_SUPPORTED +# endif +#endif +#ifndef PNG_NO_WRITE_UNKNOWN_CHUNKS +# define PNG_WRITE_UNKNOWN_CHUNKS_SUPPORTED +# ifndef PNG_UNKNOWN_CHUNKS_SUPPORTED +# define PNG_UNKNOWN_CHUNKS_SUPPORTED +# endif +# ifndef PNG_NO_HANDLE_AS_UNKNOWN +# ifndef PNG_HANDLE_AS_UNKNOWN_SUPPORTED +# define PNG_HANDLE_AS_UNKNOWN_SUPPORTED +# endif +# endif +#endif +#if defined(PNG_WRITE_iTXt_SUPPORTED) || defined(PNG_WRITE_tEXt_SUPPORTED) || \ + defined(PNG_WRITE_zTXt_SUPPORTED) +# define PNG_WRITE_TEXT_SUPPORTED +# ifndef PNG_TEXT_SUPPORTED +# define PNG_TEXT_SUPPORTED +# endif +#endif + +#endif /* PNG_WRITE_ANCILLARY_CHUNKS_SUPPORTED */ + +/* Turn this off to disable png_read_png() and + * png_write_png() and leave the row_pointers member + * out of the info structure. + */ +#ifndef PNG_NO_INFO_IMAGE +# define PNG_INFO_IMAGE_SUPPORTED +#endif + +/* need the time information for reading tIME chunks */ +#if defined(PNG_tIME_SUPPORTED) +# if !defined(_WIN32_WCE) + /* "time.h" functions are not supported on WindowsCE */ +# include +# endif +#endif + +/* Some typedefs to get us started. These should be safe on most of the + * common platforms. The typedefs should be at least as large as the + * numbers suggest (a png_uint_32 must be at least 32 bits long), but they + * don't have to be exactly that size. Some compilers dislike passing + * unsigned shorts as function parameters, so you may be better off using + * unsigned int for png_uint_16. Likewise, for 64-bit systems, you may + * want to have unsigned int for png_uint_32 instead of unsigned long. + */ + +typedef unsigned long png_uint_32; +typedef long png_int_32; +typedef unsigned short png_uint_16; +typedef short png_int_16; +typedef unsigned char png_byte; + +/* This is usually size_t. It is typedef'ed just in case you need it to + change (I'm not sure if you will or not, so I thought I'd be safe) */ +#ifdef PNG_SIZE_T + typedef PNG_SIZE_T png_size_t; +# define png_sizeof(x) png_convert_size(sizeof (x)) +#else + typedef size_t png_size_t; +# define png_sizeof(x) sizeof (x) +#endif + +/* The following is needed for medium model support. It cannot be in the + * PNG_INTERNAL section. Needs modification for other compilers besides + * MSC. Model independent support declares all arrays and pointers to be + * large using the far keyword. The zlib version used must also support + * model independent data. As of version zlib 1.0.4, the necessary changes + * have been made in zlib. The USE_FAR_KEYWORD define triggers other + * changes that are needed. (Tim Wegner) + */ + +/* Separate compiler dependencies (problem here is that zlib.h always + defines FAR. (SJT) */ +#ifdef __BORLANDC__ +# if defined(__LARGE__) || defined(__HUGE__) || defined(__COMPACT__) +# define LDATA 1 +# else +# define LDATA 0 +# endif + /* GRR: why is Cygwin in here? Cygwin is not Borland C... */ +# if !defined(__WIN32__) && !defined(__FLAT__) && !defined(__CYGWIN__) +# define PNG_MAX_MALLOC_64K +# if (LDATA != 1) +# ifndef FAR +# define FAR __far +# endif +# define USE_FAR_KEYWORD +# endif /* LDATA != 1 */ + /* Possibly useful for moving data out of default segment. + * Uncomment it if you want. Could also define FARDATA as + * const if your compiler supports it. (SJT) +# define FARDATA FAR + */ +# endif /* __WIN32__, __FLAT__, __CYGWIN__ */ +#endif /* __BORLANDC__ */ + + +/* Suggest testing for specific compiler first before testing for + * FAR. The Watcom compiler defines both __MEDIUM__ and M_I86MM, + * making reliance oncertain keywords suspect. (SJT) + */ + +/* MSC Medium model */ +#if defined(FAR) +# if defined(M_I86MM) +# define USE_FAR_KEYWORD +# define FARDATA FAR +# include +# endif +#endif + +/* SJT: default case */ +#ifndef FAR +# define FAR +#endif + +/* At this point FAR is always defined */ +#ifndef FARDATA +# define FARDATA +#endif + +/* Typedef for floating-point numbers that are converted + to fixed-point with a multiple of 100,000, e.g., int_gamma */ +typedef png_int_32 png_fixed_point; + +/* Add typedefs for pointers */ +typedef void FAR * png_voidp; +typedef png_byte FAR * png_bytep; +typedef png_uint_32 FAR * png_uint_32p; +typedef png_int_32 FAR * png_int_32p; +typedef png_uint_16 FAR * png_uint_16p; +typedef png_int_16 FAR * png_int_16p; +typedef PNG_CONST char FAR * png_const_charp; +typedef char FAR * png_charp; +typedef png_fixed_point FAR * png_fixed_point_p; + +#ifndef PNG_NO_STDIO +#if defined(_WIN32_WCE) +typedef HANDLE png_FILE_p; +#else +typedef FILE * png_FILE_p; +#endif +#endif + +#ifdef PNG_FLOATING_POINT_SUPPORTED +typedef double FAR * png_doublep; +#endif + +/* Pointers to pointers; i.e. arrays */ +typedef png_byte FAR * FAR * png_bytepp; +typedef png_uint_32 FAR * FAR * png_uint_32pp; +typedef png_int_32 FAR * FAR * png_int_32pp; +typedef png_uint_16 FAR * FAR * png_uint_16pp; +typedef png_int_16 FAR * FAR * png_int_16pp; +typedef PNG_CONST char FAR * FAR * png_const_charpp; +typedef char FAR * FAR * png_charpp; +typedef png_fixed_point FAR * FAR * png_fixed_point_pp; +#ifdef PNG_FLOATING_POINT_SUPPORTED +typedef double FAR * FAR * png_doublepp; +#endif + +/* Pointers to pointers to pointers; i.e., pointer to array */ +typedef char FAR * FAR * FAR * png_charppp; + +#if defined(PNG_1_0_X) || defined(PNG_1_2_X) +/* SPC - Is this stuff deprecated? */ +/* It'll be removed as of libpng-1.3.0 - GR-P */ +/* libpng typedefs for types in zlib. If zlib changes + * or another compression library is used, then change these. + * Eliminates need to change all the source files. + */ +typedef charf * png_zcharp; +typedef charf * FAR * png_zcharpp; +typedef z_stream FAR * png_zstreamp; +#endif /* (PNG_1_0_X) || defined(PNG_1_2_X) */ + +/* + * Define PNG_BUILD_DLL if the module being built is a Windows + * LIBPNG DLL. + * + * Define PNG_USE_DLL if you want to *link* to the Windows LIBPNG DLL. + * It is equivalent to Microsoft predefined macro _DLL that is + * automatically defined when you compile using the share + * version of the CRT (C Run-Time library) + * + * The cygwin mods make this behavior a little different: + * Define PNG_BUILD_DLL if you are building a dll for use with cygwin + * Define PNG_STATIC if you are building a static library for use with cygwin, + * -or- if you are building an application that you want to link to the + * static library. + * PNG_USE_DLL is defined by default (no user action needed) unless one of + * the other flags is defined. + */ + +#if !defined(PNG_DLL) && (defined(PNG_BUILD_DLL) || defined(PNG_USE_DLL)) +# define PNG_DLL +#endif +/* If CYGWIN, then disallow GLOBAL ARRAYS unless building a static lib. + * When building a static lib, default to no GLOBAL ARRAYS, but allow + * command-line override + */ +#if defined(__CYGWIN__) +# if !defined(PNG_STATIC) +# if defined(PNG_USE_GLOBAL_ARRAYS) +# undef PNG_USE_GLOBAL_ARRAYS +# endif +# if !defined(PNG_USE_LOCAL_ARRAYS) +# define PNG_USE_LOCAL_ARRAYS +# endif +# else +# if defined(PNG_USE_LOCAL_ARRAYS) || defined(PNG_NO_GLOBAL_ARRAYS) +# if defined(PNG_USE_GLOBAL_ARRAYS) +# undef PNG_USE_GLOBAL_ARRAYS +# endif +# endif +# endif +# if !defined(PNG_USE_LOCAL_ARRAYS) && !defined(PNG_USE_GLOBAL_ARRAYS) +# define PNG_USE_LOCAL_ARRAYS +# endif +#endif + +/* Do not use global arrays (helps with building DLL's) + * They are no longer used in libpng itself, since version 1.0.5c, + * but might be required for some pre-1.0.5c applications. + */ +#if !defined(PNG_USE_LOCAL_ARRAYS) && !defined(PNG_USE_GLOBAL_ARRAYS) +# if defined(PNG_NO_GLOBAL_ARRAYS) || \ + (defined(__GNUC__) && defined(PNG_DLL)) || defined(_MSC_VER) +# define PNG_USE_LOCAL_ARRAYS +# else +# define PNG_USE_GLOBAL_ARRAYS +# endif +#endif + +#if defined(__CYGWIN__) +# undef PNGAPI +# define PNGAPI __cdecl +# undef PNG_IMPEXP +# define PNG_IMPEXP +#endif + +/* If you define PNGAPI, e.g., with compiler option "-DPNGAPI=__stdcall", + * you may get warnings regarding the linkage of png_zalloc and png_zfree. + * Don't ignore those warnings; you must also reset the default calling + * convention in your compiler to match your PNGAPI, and you must build + * zlib and your applications the same way you build libpng. + */ + +#if defined(__MINGW32__) && !defined(PNG_MODULEDEF) +# ifndef PNG_NO_MODULEDEF +# define PNG_NO_MODULEDEF +# endif +#endif + +#if !defined(PNG_IMPEXP) && defined(PNG_BUILD_DLL) && !defined(PNG_NO_MODULEDEF) +# define PNG_IMPEXP +#endif + +#if defined(PNG_DLL) || defined(_DLL) || defined(__DLL__ ) || \ + (( defined(_Windows) || defined(_WINDOWS) || \ + defined(WIN32) || defined(_WIN32) || defined(__WIN32__) )) + +# ifndef PNGAPI +# if defined(__GNUC__) || (defined (_MSC_VER) && (_MSC_VER >= 800)) +# define PNGAPI __cdecl +# else +# define PNGAPI _cdecl +# endif +# endif + +# if !defined(PNG_IMPEXP) && (!defined(PNG_DLL) || \ + 0 /* WINCOMPILER_WITH_NO_SUPPORT_FOR_DECLIMPEXP */) +# define PNG_IMPEXP +# endif + +# if !defined(PNG_IMPEXP) + +# define PNG_EXPORT_TYPE1(type,symbol) PNG_IMPEXP type PNGAPI symbol +# define PNG_EXPORT_TYPE2(type,symbol) type PNG_IMPEXP PNGAPI symbol + + /* Borland/Microsoft */ +# if defined(_MSC_VER) || defined(__BORLANDC__) +# if (_MSC_VER >= 800) || (__BORLANDC__ >= 0x500) +# define PNG_EXPORT PNG_EXPORT_TYPE1 +# else +# define PNG_EXPORT PNG_EXPORT_TYPE2 +# if defined(PNG_BUILD_DLL) +# define PNG_IMPEXP __export +# else +# define PNG_IMPEXP /*__import */ /* doesn't exist AFAIK in + VC++ */ +# endif /* Exists in Borland C++ for + C++ classes (== huge) */ +# endif +# endif + +# if !defined(PNG_IMPEXP) +# if defined(PNG_BUILD_DLL) +# define PNG_IMPEXP __declspec(dllexport) +# else +# define PNG_IMPEXP __declspec(dllimport) +# endif +# endif +# endif /* PNG_IMPEXP */ +#else /* !(DLL || non-cygwin WINDOWS) */ +# if (defined(__IBMC__) || defined(__IBMCPP__)) && defined(__OS2__) +# ifndef PNGAPI +# define PNGAPI _System +# endif +# else +# if 0 /* ... other platforms, with other meanings */ +# endif +# endif +#endif + +#ifndef PNGAPI +# define PNGAPI +#endif +#ifndef PNG_IMPEXP +# define PNG_IMPEXP +#endif + +#ifdef PNG_BUILDSYMS +# ifndef PNG_EXPORT +# define PNG_EXPORT(type,symbol) PNG_FUNCTION_EXPORT symbol END +# endif +# ifdef PNG_USE_GLOBAL_ARRAYS +# ifndef PNG_EXPORT_VAR +# define PNG_EXPORT_VAR(type) PNG_DATA_EXPORT +# endif +# endif +#endif + +#ifndef PNG_EXPORT +# define PNG_EXPORT(type,symbol) PNG_IMPEXP type PNGAPI symbol +#endif + +#ifdef PNG_USE_GLOBAL_ARRAYS +# ifndef PNG_EXPORT_VAR +# define PNG_EXPORT_VAR(type) extern PNG_IMPEXP type +# endif +#endif + +/* User may want to use these so they are not in PNG_INTERNAL. Any library + * functions that are passed far data must be model independent. + */ + +#ifndef PNG_ABORT +# define PNG_ABORT() abort() +#endif + +#ifdef PNG_SETJMP_SUPPORTED +# define png_jmpbuf(png_ptr) ((png_ptr)->jmpbuf) +#else +# define png_jmpbuf(png_ptr) \ + (LIBPNG_WAS_COMPILED_WITH__PNG_SETJMP_NOT_SUPPORTED) +#endif + +#if defined(USE_FAR_KEYWORD) /* memory model independent fns */ +/* use this to make far-to-near assignments */ +# define CHECK 1 +# define NOCHECK 0 +# define CVT_PTR(ptr) (png_far_to_near(png_ptr,ptr,CHECK)) +# define CVT_PTR_NOCHECK(ptr) (png_far_to_near(png_ptr,ptr,NOCHECK)) +# define png_snprintf _fsnprintf /* Added to v 1.2.19 */ +# define png_strlen _fstrlen +# define png_memcmp _fmemcmp /* SJT: added */ +# define png_memcpy _fmemcpy +# define png_memset _fmemset +#else /* use the usual functions */ +# define CVT_PTR(ptr) (ptr) +# define CVT_PTR_NOCHECK(ptr) (ptr) +# ifndef PNG_NO_SNPRINTF +# ifdef _MSC_VER +# define png_snprintf _snprintf /* Added to v 1.2.19 */ +# define png_snprintf2 _snprintf +# define png_snprintf6 _snprintf +# else +# define png_snprintf snprintf /* Added to v 1.2.19 */ +# define png_snprintf2 snprintf +# define png_snprintf6 snprintf +# endif +# else + /* You don't have or don't want to use snprintf(). Caution: Using + * sprintf instead of snprintf exposes your application to accidental + * or malevolent buffer overflows. If you don't have snprintf() + * as a general rule you should provide one (you can get one from + * Portable OpenSSH). */ +# define png_snprintf(s1,n,fmt,x1) sprintf(s1,fmt,x1) +# define png_snprintf2(s1,n,fmt,x1,x2) sprintf(s1,fmt,x1,x2) +# define png_snprintf6(s1,n,fmt,x1,x2,x3,x4,x5,x6) \ + sprintf(s1,fmt,x1,x2,x3,x4,x5,x6) +# endif +# define png_strlen strlen +# define png_memcmp memcmp /* SJT: added */ +# define png_memcpy memcpy +# define png_memset memset +#endif +/* End of memory model independent support */ + +/* Just a little check that someone hasn't tried to define something + * contradictory. + */ +#if (PNG_ZBUF_SIZE > 65536L) && defined(PNG_MAX_MALLOC_64K) +# undef PNG_ZBUF_SIZE +# define PNG_ZBUF_SIZE 65536L +#endif + +/* Added at libpng-1.2.8 */ +#endif /* PNG_VERSION_INFO_ONLY */ + +#endif /* PNGCONF_H */ diff --git a/source/gui/pngu.c b/source/gui/pngu.c new file mode 100644 index 00000000..d9385495 --- /dev/null +++ b/source/gui/pngu.c @@ -0,0 +1,1257 @@ +/******************************************************************************************** + +PNGU Version : 0.2a + +Coder : frontier + +More info : http://frontier-dev.net + +********************************************************************************************/ +#include +#include +#include + +#include "pngu.h" +#include "png.h" +#include "mem2.hpp" +#include "utils.h" + +#undef malloc +#define malloc MEM2_alloc + +// Constants +#define PNGU_SOURCE_BUFFER 1 +#define PNGU_SOURCE_DEVICE 2 + + +// Prototypes of helper functions +int pngu_info (IMGCTX ctx); +int pngu_decode (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, PNGU_u32 stripAlpha, int force32bits); +void pngu_free_info (IMGCTX ctx); +void pngu_read_data_from_buffer (png_structp png_ptr, png_bytep data, png_size_t length); +void pngu_write_data_to_buffer (png_structp png_ptr, png_bytep data, png_size_t length); +void pngu_flush_data_to_buffer (png_structp png_ptr); +int pngu_clamp (int value, int min, int max); + + +// PNGU Image context struct +struct _IMGCTX +{ + int source; + void *buffer; + char *filename; + PNGU_u32 cursor; + PNGU_u32 buf_size; // buffer size + + PNGU_u32 propRead; + PNGUPROP prop; + + PNGU_u32 infoRead; + png_structp png_ptr; + png_infop info_ptr; + FILE *fd; + + png_bytep *row_pointers; + png_bytep img_data; +}; + + +// PNGU Implementation // + +IMGCTX PNGU_SelectImageFromBuffer (const void *buffer) +{ + if (!buffer) return NULL; + + IMGCTX ctx = malloc (sizeof (struct _IMGCTX)); + if (!ctx) return NULL; + + ctx->buffer = (void *) buffer; + ctx->source = PNGU_SOURCE_BUFFER; + ctx->cursor = 0; + ctx->filename = NULL; + ctx->propRead = 0; + ctx->infoRead = 0; + ctx->buf_size = 0; + + return ctx; +} + + +IMGCTX PNGU_SelectImageFromDevice (const char *filename) +{ + if (!filename) return NULL; + + IMGCTX ctx = malloc (sizeof (struct _IMGCTX)); + if (!ctx) return NULL; + + ctx->buffer = NULL; + ctx->source = PNGU_SOURCE_DEVICE; + ctx->cursor = 0; + + ctx->filename = malloc (strlen (filename) + 1); + if (!ctx->filename) + { + SAFE_FREE(ctx); + return NULL; + } + strcpy(ctx->filename, filename); + + ctx->propRead = 0; + ctx->infoRead = 0; + + return ctx; +} + + +void PNGU_ReleaseImageContext (IMGCTX ctx) +{ + if (!ctx) return; + + if (ctx->filename) SAFE_FREE (ctx->filename); + + if ((ctx->propRead) && (ctx->prop.trans)) + SAFE_FREE (ctx->prop.trans); + + pngu_free_info (ctx); + + SAFE_FREE (ctx); +} + + +int PNGU_GetImageProperties (IMGCTX ctx, PNGUPROP *imgprop) +{ + if (!ctx->propRead) + { + int res = pngu_info (ctx); + if (res != PNGU_OK) + return res; + } + + *imgprop = ctx->prop; + + return PNGU_OK; +} + + +int PNGU_DecodeToYCbYCr (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride) +{ + + // width needs to be divisible by two + if (width % 2) return PNGU_ODD_WIDTH; + + // stride needs to be divisible by two + if (stride % 2) return PNGU_ODD_STRIDE; + + int result = pngu_decode (ctx, width, height, 1, 0); + if (result != PNGU_OK) + return result; + + PNGU_u32 x, y, buffWidth = (width + stride) / 2; + // Copy image to the output buffer + for (y = 0; y < height; y++) + for (x = 0; x < (width / 2); x++) + ((PNGU_u32 *)buffer)[y*buffWidth+x] = PNGU_RGB8_TO_YCbYCr (*(ctx->row_pointers[y]+x*6), *(ctx->row_pointers[y]+x*6+1), *(ctx->row_pointers[y]+x*6+2), + *(ctx->row_pointers[y]+x*6+3), *(ctx->row_pointers[y]+x*6+4), *(ctx->row_pointers[y]+x*6+5)); + + // Free resources + SAFE_FREE (ctx->img_data); + SAFE_FREE (ctx->row_pointers); + + // Success + return PNGU_OK; +} + + +int PNGU_DecodeToRGB565 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride) +{ + + int result = pngu_decode (ctx, width, height, 1, 0); + if (result != PNGU_OK) return result; + + PNGU_u32 x, y, buffWidth = width + stride; + // Copy image to the output buffer + for (y = 0; y < height; y++) + for (x = 0; x < width; x++) + ((PNGU_u16 *)buffer)[y*buffWidth+x] = + (((PNGU_u16) (ctx->row_pointers[y][x*3] & 0xF8)) << 8) | + (((PNGU_u16) (ctx->row_pointers[y][x*3+1] & 0xFC)) << 3) | + (((PNGU_u16) (ctx->row_pointers[y][x*3+2] & 0xF8)) >> 3); + + // Free resources + SAFE_FREE (ctx->img_data); + SAFE_FREE (ctx->row_pointers); + + // Success + return PNGU_OK; +} + + +int PNGU_DecodeToRGBA8 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride, PNGU_u8 default_alpha) +{ + + int result = pngu_decode (ctx, width, height, 0, 0); + if (result != PNGU_OK) + return result; + + PNGU_u32 x, y, buffWidth = width + stride; + // Check is source image has an alpha channel + if ( (ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY_ALPHA) || (ctx->prop.imgColorType == PNGU_COLOR_TYPE_RGB_ALPHA) ) + { + // Alpha channel present, copy image to the output buffer + for (y = 0; y < height; y++) + memcpy (buffer + (y * buffWidth * 4), ctx->row_pointers[y], width * 4); + } + else + { + // No alpha channel present, copy image to the output buffer + for (y = 0; y < height; y++) + for (x = 0; x < width; x++) + ((PNGU_u32 *)buffer)[y*buffWidth+x] = + (((PNGU_u32) ctx->row_pointers[y][x*3]) << 24) | + (((PNGU_u32) ctx->row_pointers[y][x*3+1]) << 16) | + (((PNGU_u32) ctx->row_pointers[y][x*3+2]) << 8) | + ((PNGU_u32) default_alpha); + } + + // Free resources + SAFE_FREE (ctx->img_data); + SAFE_FREE (ctx->row_pointers); + + // Success + return PNGU_OK; +} + + +int PNGU_DecodeTo4x4RGB565 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer) +{ + + // width and height need to be divisible by four +// if ((width % 4) || (height % 4)) +// return PNGU_INVALID_WIDTH_OR_HEIGHT; + + int result = pngu_decode (ctx, width, height, 1, 0); + if (result != PNGU_OK) return result; + + PNGU_u32 x, y, qwidth = width / 4, qheight = height / 4; + // Copy image to the output buffer + for (y = 0; y < qheight; y++) + { + if (((y + 0xFF) & 0xFF) == 0) + usleep(100); + for (x = 0; x < qwidth; x++) + { + int blockbase = (y * qwidth + x) * 4; + + PNGU_u64 field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4]+x*12)); + PNGU_u64 field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase] = + (((field64 & 0xF800000000000000ULL) | ((field64 & 0xFC000000000000ULL) << 3) | ((field64 & 0xF80000000000ULL) << 5)) | + (((field64 & 0xF800000000ULL) << 8) | ((field64 & 0xFC000000ULL) << 11) | ((field64 & 0xF80000ULL) << 13)) | + (((field64 & 0xF800ULL) << 16) | ((field64 & 0xFCULL) << 19) | ((field32 & 0xF8000000ULL) >> 11)) | + (((field32 & 0xF80000ULL) >> 8) | ((field32 & 0xFC00ULL) >> 5) | ((field32 & 0xF8ULL) >> 3))); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+1]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+1]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+1] = + (((field64 & 0xF800000000000000ULL) | ((field64 & 0xFC000000000000ULL) << 3) | ((field64 & 0xF80000000000ULL) << 5)) | + (((field64 & 0xF800000000ULL) << 8) | ((field64 & 0xFC000000ULL) << 11) | ((field64 & 0xF80000ULL) << 13)) | + (((field64 & 0xF800ULL) << 16) | ((field64 & 0xFCULL) << 19) | ((field32 & 0xF8000000ULL) >> 11)) | + (((field32 & 0xF80000ULL) >> 8) | ((field32 & 0xFC00ULL) >> 5) | ((field32 & 0xF8ULL) >> 3))); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+2]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+2]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+2] = + (((field64 & 0xF800000000000000ULL) | ((field64 & 0xFC000000000000ULL) << 3) | ((field64 & 0xF80000000000ULL) << 5)) | + (((field64 & 0xF800000000ULL) << 8) | ((field64 & 0xFC000000ULL) << 11) | ((field64 & 0xF80000ULL) << 13)) | + (((field64 & 0xF800ULL) << 16) | ((field64 & 0xFCULL) << 19) | ((field32 & 0xF8000000ULL) >> 11)) | + (((field32 & 0xF80000ULL) >> 8) | ((field32 & 0xFC00ULL) >> 5) | ((field32 & 0xF8ULL) >> 3))); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+3]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+3]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+3] = + (((field64 & 0xF800000000000000ULL) | ((field64 & 0xFC000000000000ULL) << 3) | ((field64 & 0xF80000000000ULL) << 5)) | + (((field64 & 0xF800000000ULL) << 8) | ((field64 & 0xFC000000ULL) << 11) | ((field64 & 0xF80000ULL) << 13)) | + (((field64 & 0xF800ULL) << 16) | ((field64 & 0xFCULL) << 19) | ((field32 & 0xF8000000ULL) >> 11)) | + (((field32 & 0xF80000ULL) >> 8) | ((field32 & 0xFC00ULL) >> 5) | ((field32 & 0xF8ULL) >> 3))); + } + } + + // Free resources + SAFE_FREE (ctx->img_data); + SAFE_FREE (ctx->row_pointers); + + // Success + return PNGU_OK; +} + + +int PNGU_DecodeTo4x4RGB5A3 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u8 default_alpha) +{ + + // width and height need to be divisible by four + if ((width % 4) || (height % 4)) return PNGU_INVALID_WIDTH_OR_HEIGHT; + + int result = pngu_decode (ctx, width, height, 0, 0); + if (result != PNGU_OK) return result; + + // Init some vars + PNGU_u32 x, y, qwidth = width / 4, qheight = height / 4; + + // Check if source image has an alpha channel + if ( (ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY_ALPHA) || (ctx->prop.imgColorType == PNGU_COLOR_TYPE_RGB_ALPHA) ) + { + // Alpha channel present, copy image to the output buffer + for (y = 0; y < qheight; y++) + for (x = 0; x < qwidth; x++) + { + int blockbase = (y * qwidth + x) * 4; + PNGU_u64 tmp; + + PNGU_u64 fieldA = *((PNGU_u64 *)(ctx->row_pointers[y*4]+x*16)); + PNGU_u64 fieldB = *((PNGU_u64 *)(ctx->row_pointers[y*4]+x*16+8)); + // If first pixel is opaque set MSB to 1 and encode colors in RGB555, else set MSB to 0 and encode colors in ARGB3444 + if ((fieldA & 0xE000000000ULL) == 0xE000000000ULL) + tmp = 0x8000000000000000ULL | ((fieldA & 0xF800000000000000ULL) >> 1) | ((fieldA & 0xF8000000000000ULL) << 2) | ((fieldA & 0xF80000000000ULL) << 5); + else + tmp = ((fieldA & 0xE000000000ULL) << 23) | ((fieldA & 0xF000000000000000ULL) >> 4) | (fieldA & 0xF0000000000000ULL) | ((fieldA & 0xF00000000000ULL) << 4); + + // If second pixel is opaque set MSB to 1 and encode colors in RGB555, else set MSB to 0 and encode colors in ARGB3444 + if ((fieldA & 0xE0ULL) == 0xE0ULL) + tmp = tmp | 0x800000000000ULL | ((fieldA & 0xF8000000ULL) << 15) | ((fieldA & 0xF80000ULL) << 18) | ((fieldA & 0xF800ULL) << 21); + else + tmp = tmp | ((fieldA & 0xE0ULL) << 39) | ((fieldA & 0xF0000000ULL) << 12) | ((fieldA & 0xF00000ULL) << 16) | ((fieldA & 0xF000ULL) << 20); + + // If third pixel is opaque set MSB to 1 and encode colors in RGB555, else set MSB to 0 and encode colors in ARGB3444 + if ((fieldB & 0xE000000000ULL) == 0xE000000000ULL) + tmp = tmp | 0x80000000ULL | ((fieldB & 0xF800000000000000ULL) >> 33) | ((fieldB & 0xF8000000000000ULL) >> 30) | ((fieldB & 0xF80000000000ULL) >> 27); + else + tmp = tmp | ((fieldB & 0xE000000000ULL) >> 9) | ((fieldB & 0xF000000000000000ULL) >> 36) | ((fieldB & 0xF0000000000000ULL) >> 32) | ((fieldB & 0xF00000000000ULL) >> 28); + + // If fourth pixel is opaque set MSB to 1 and encode colors in RGB555, else set MSB to 0 and encode colors in ARGB3444 + if ((fieldB & 0xE0ULL) == 0xE0ULL) + tmp = tmp | 0x8000ULL | ((fieldB & 0xF8000000ULL) >> 17) | ((fieldB & 0xF80000ULL) >> 14) | ((fieldB & 0xF800ULL) >> 11); + else + tmp = tmp | ((fieldB & 0xE0ULL) << 7) | ((fieldB & 0xF0000000ULL) >> 20) | ((fieldB & 0xF00000ULL) >> 16) | ((fieldB & 0xF000ULL) >> 12); + ((PNGU_u64 *) buffer)[blockbase] = tmp; + + fieldA = *((PNGU_u64 *)(ctx->row_pointers[y*4+1]+x*16)); + fieldB = *((PNGU_u64 *)(ctx->row_pointers[y*4+1]+x*16+8)); + if ((fieldA & 0xE000000000ULL) == 0xE000000000ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = 0x8000000000000000ULL | ((fieldA & 0xF800000000000000ULL) >> 1) | ((fieldA & 0xF8000000000000ULL) << 2) | ((fieldA & 0xF80000000000ULL) << 5); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = ((fieldA & 0xE000000000ULL) << 23) | ((fieldA & 0xF000000000000000ULL) >> 4) | (fieldA & 0xF0000000000000ULL) | ((fieldA & 0xF00000000000ULL) << 4); + + if ((fieldA & 0xE0ULL) == 0xE0ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = tmp | 0x800000000000ULL | ((fieldA & 0xF8000000ULL) << 15) | ((fieldA & 0xF80000ULL) << 18) | ((fieldA & 0xF800ULL) << 21); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = tmp | ((fieldA & 0xE0ULL) << 39) | ((fieldA & 0xF0000000ULL) << 12) | ((fieldA & 0xF00000ULL) << 16) | ((fieldA & 0xF000ULL) << 20); + + if ((fieldB & 0xE000000000ULL) == 0xE000000000ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = tmp | 0x80000000ULL | ((fieldB & 0xF800000000000000ULL) >> 33) | ((fieldB & 0xF8000000000000ULL) >> 30) | ((fieldB & 0xF80000000000ULL) >> 27); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = tmp | ((fieldB & 0xE000000000ULL) >> 9) | ((fieldB & 0xF000000000000000ULL) >> 36) | ((fieldB & 0xF0000000000000ULL) >> 32) | ((fieldB & 0xF00000000000ULL) >> 28); + + if ((fieldB & 0xE0ULL) == 0xE0ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = tmp | 0x8000ULL | ((fieldB & 0xF8000000ULL) >> 17) | ((fieldB & 0xF80000ULL) >> 14) | ((fieldB & 0xF800ULL) >> 11); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = tmp | ((fieldB & 0xE0ULL) << 7) | ((fieldB & 0xF0000000ULL) >> 20) | ((fieldB & 0xF00000ULL) >> 16) | ((fieldB & 0xF000ULL) >> 12); + ((PNGU_u64 *) buffer)[blockbase+1] = tmp; + + fieldA = *((PNGU_u64 *)(ctx->row_pointers[y*4+2]+x*16)); + fieldB = *((PNGU_u64 *)(ctx->row_pointers[y*4+2]+x*16+8)); + if ((fieldA & 0xE000000000ULL) == 0xE000000000ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = 0x8000000000000000ULL | ((fieldA & 0xF800000000000000ULL) >> 1) | ((fieldA & 0xF8000000000000ULL) << 2) | ((fieldA & 0xF80000000000ULL) << 5); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = ((fieldA & 0xE000000000ULL) << 23) | ((fieldA & 0xF000000000000000ULL) >> 4) | (fieldA & 0xF0000000000000ULL) | ((fieldA & 0xF00000000000ULL) << 4); + + if ((fieldA & 0xE0ULL) == 0xE0ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = tmp | 0x800000000000ULL | ((fieldA & 0xF8000000ULL) << 15) | ((fieldA & 0xF80000ULL) << 18) | ((fieldA & 0xF800ULL) << 21); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = tmp | ((fieldA & 0xE0ULL) << 39) | ((fieldA & 0xF0000000ULL) << 12) | ((fieldA & 0xF00000ULL) << 16) | ((fieldA & 0xF000ULL) << 20); + + if ((fieldB & 0xE000000000ULL) == 0xE000000000ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = tmp | 0x80000000ULL | ((fieldB & 0xF800000000000000ULL) >> 33) | ((fieldB & 0xF8000000000000ULL) >> 30) | ((fieldB & 0xF80000000000ULL) >> 27); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = tmp | ((fieldB & 0xE000000000ULL) >> 9) | ((fieldB & 0xF000000000000000ULL) >> 36) | ((fieldB & 0xF0000000000000ULL) >> 32) | ((fieldB & 0xF00000000000ULL) >> 28); + + if ((fieldB & 0xE0ULL) == 0xE0ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = tmp | 0x8000ULL | ((fieldB & 0xF8000000ULL) >> 17) | ((fieldB & 0xF80000ULL) >> 14) | ((fieldB & 0xF800ULL) >> 11); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = tmp | ((fieldB & 0xE0ULL) << 7) | ((fieldB & 0xF0000000ULL) >> 20) | ((fieldB & 0xF00000ULL) >> 16) | ((fieldB & 0xF000ULL) >> 12); + ((PNGU_u64 *) buffer)[blockbase+2] = tmp; + + fieldA = *((PNGU_u64 *)(ctx->row_pointers[y*4+3]+x*16)); + fieldB = *((PNGU_u64 *)(ctx->row_pointers[y*4+3]+x*16+8)); + if ((fieldA & 0xE000000000ULL) == 0xE000000000ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = 0x8000000000000000ULL | ((fieldA & 0xF800000000000000ULL) >> 1) | ((fieldA & 0xF8000000000000ULL) << 2) | ((fieldA & 0xF80000000000ULL) << 5); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = ((fieldA & 0xE000000000ULL) << 23) | ((fieldA & 0xF000000000000000ULL) >> 4) | (fieldA & 0xF0000000000000ULL) | ((fieldA & 0xF00000000000ULL) << 4); + + if ((fieldA & 0xE0ULL) == 0xE0ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = tmp | 0x800000000000ULL | ((fieldA & 0xF8000000ULL) << 15) | ((fieldA & 0xF80000ULL) << 18) | ((fieldA & 0xF800ULL) << 21); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = tmp | ((fieldA & 0xE0ULL) << 39) | ((fieldA & 0xF0000000ULL) << 12) | ((fieldA & 0xF00000ULL) << 16) | ((fieldA & 0xF000ULL) << 20); + + if ((fieldB & 0xE000000000ULL) == 0xE000000000ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = tmp | 0x80000000ULL | ((fieldB & 0xF800000000000000ULL) >> 33) | ((fieldB & 0xF8000000000000ULL) >> 30) | ((fieldB & 0xF80000000000ULL) >> 27); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = tmp | ((fieldB & 0xE000000000ULL) >> 9) | ((fieldB & 0xF000000000000000ULL) >> 36) | ((fieldB & 0xF0000000000000ULL) >> 32) | ((fieldB & 0xF00000000000ULL) >> 28); + + if ((fieldB & 0xE0ULL) == 0xE0ULL) + // Opaque pixel, so set MSB to 1 and encode colors in RGB555 + tmp = tmp | 0x8000ULL | ((fieldB & 0xF8000000ULL) >> 17) | ((fieldB & 0xF80000ULL) >> 14) | ((fieldB & 0xF800ULL) >> 11); + else + // Tranlucid pixel, so set MSB to 0 and encode colors in ARGB3444 + tmp = tmp | ((fieldB & 0xE0ULL) << 7) | ((fieldB & 0xF0000000ULL) >> 20) | ((fieldB & 0xF00000ULL) >> 16) | ((fieldB & 0xF000ULL) >> 12); + ((PNGU_u64 *) buffer)[blockbase+3] = tmp; + } + } + else + { + // No alpha channel present, copy image to the output buffer + PNGU_u64 alphaMask; + default_alpha = (default_alpha >> 5); + if (default_alpha == 7) + { + // The user wants an opaque texture, so set MSB to 1 and encode colors in RGB555 + alphaMask = 0x8000800080008000ULL; + + for (y = 0; y < qheight; y++) + for (x = 0; x < qwidth; x++) + { + int blockbase = (y * qwidth + x) * 4; + + PNGU_u64 field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4]+x*12)); + PNGU_u64 field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase] = + alphaMask | ((field64 & 0xF800000000000000ULL) >> 1) | ((field64 & 0xF8000000000000ULL) << 2) | + ((field64 & 0xF80000000000ULL) << 5) | ((field64 & 0xF800000000ULL) << 7) | ((field64 & 0xF8000000ULL) << 10) | + ((field64 & 0xF80000ULL) << 13) | ((field64 & 0xF800ULL) << 15) | ((field64 & 0xF8ULL) << 18) | + ((field32 & 0xF8000000ULL) >> 11) | ((field32 & 0xF80000ULL) >> 9) | ((field32 & 0xF800ULL) >> 6) | ((field32 & 0xF8ULL) >> 3); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+1]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+1]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+1] = + alphaMask | ((field64 & 0xF800000000000000ULL) >> 1) | ((field64 & 0xF8000000000000ULL) << 2) | + ((field64 & 0xF80000000000ULL) << 5) | ((field64 & 0xF800000000ULL) << 7) | ((field64 & 0xF8000000ULL) << 10) | + ((field64 & 0xF80000ULL) << 13) | ((field64 & 0xF800ULL) << 15) | ((field64 & 0xF8ULL) << 18) | + ((field32 & 0xF8000000ULL) >> 11) | ((field32 & 0xF80000ULL) >> 9) | ((field32 & 0xF800ULL) >> 6) | ((field32 & 0xF8ULL) >> 3); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+2]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+2]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+2] = + alphaMask | ((field64 & 0xF800000000000000ULL) >> 1) | ((field64 & 0xF8000000000000ULL) << 2) | + ((field64 & 0xF80000000000ULL) << 5) | ((field64 & 0xF800000000ULL) << 7) | ((field64 & 0xF8000000ULL) << 10) | + ((field64 & 0xF80000ULL) << 13) | ((field64 & 0xF800ULL) << 15) | ((field64 & 0xF8ULL) << 18) | + ((field32 & 0xF8000000ULL) >> 11) | ((field32 & 0xF80000ULL) >> 9) | ((field32 & 0xF800ULL) >> 6) | ((field32 & 0xF8ULL) >> 3); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+3]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+3]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+3] = + alphaMask | ((field64 & 0xF800000000000000ULL) >> 1) | ((field64 & 0xF8000000000000ULL) << 2) | + ((field64 & 0xF80000000000ULL) << 5) | ((field64 & 0xF800000000ULL) << 7) | ((field64 & 0xF8000000ULL) << 10) | + ((field64 & 0xF80000ULL) << 13) | ((field64 & 0xF800ULL) << 15) | ((field64 & 0xF8ULL) << 18) | + ((field32 & 0xF8000000ULL) >> 11) | ((field32 & 0xF80000ULL) >> 9) | ((field32 & 0xF800ULL) >> 6) | ((field32 & 0xF8ULL) >> 3); + } + } + else + { + // The user wants a translucid texture, so set MSB to 0 and encode colors in ARGB3444 + default_alpha = (default_alpha << 4); + alphaMask = (((PNGU_u64) default_alpha) << 56) | (((PNGU_u64) default_alpha) << 40) | + (((PNGU_u64) default_alpha) << 24) | (((PNGU_u64) default_alpha) << 8); + + for (y = 0; y < qheight; y++) + for (x = 0; x < qwidth; x++) + { + int blockbase = (y * qwidth + x) * 4; + + PNGU_u64 field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4]+x*12)); + PNGU_u64 field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase] = + alphaMask | ((field64 & 0xF000000000000000ULL) >> 4) | (field64 & 0xF0000000000000ULL) | ((field64 & 0xF00000000000ULL) << 4) | + ((field64 & 0xF000000000ULL) << 4) | ((field64 & 0xF0000000ULL) << 8) | ((field64 & 0xF00000ULL) << 12) | + ((field64 & 0xF000ULL) << 12) | ((field64 & 0xF0ULL) << 16) | ((field32 & 0xF0000000ULL) >> 12) | + ((field32 & 0xF00000ULL) >> 12) | ((field32 & 0xF000ULL) >> 8) | ((field32 & 0xF0ULL) >> 4); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+1]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+1]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+1] = + alphaMask | ((field64 & 0xF000000000000000ULL) >> 4) | (field64 & 0xF0000000000000ULL) | ((field64 & 0xF00000000000ULL) << 4) | + ((field64 & 0xF000000000ULL) << 4) | ((field64 & 0xF0000000ULL) << 8) | ((field64 & 0xF00000ULL) << 12) | + ((field64 & 0xF000ULL) << 12) | ((field64 & 0xF0ULL) << 16) | ((field32 & 0xF0000000ULL) >> 12) | + ((field32 & 0xF00000ULL) >> 12) | ((field32 & 0xF000ULL) >> 8) | ((field32 & 0xF0ULL) >> 4); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+2]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+2]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+2] = + alphaMask | ((field64 & 0xF000000000000000ULL) >> 4) | (field64 & 0xF0000000000000ULL) | ((field64 & 0xF00000000000ULL) << 4) | + ((field64 & 0xF000000000ULL) << 4) | ((field64 & 0xF0000000ULL) << 8) | ((field64 & 0xF00000ULL) << 12) | + ((field64 & 0xF000ULL) << 12) | ((field64 & 0xF0ULL) << 16) | ((field32 & 0xF0000000ULL) >> 12) | + ((field32 & 0xF00000ULL) >> 12) | ((field32 & 0xF000ULL) >> 8) | ((field32 & 0xF0ULL) >> 4); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+3]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+3]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+3] = + alphaMask | ((field64 & 0xF000000000000000ULL) >> 4) | (field64 & 0xF0000000000000ULL) | ((field64 & 0xF00000000000ULL) << 4) | + ((field64 & 0xF000000000ULL) << 4) | ((field64 & 0xF0000000ULL) << 8) | ((field64 & 0xF00000ULL) << 12) | + ((field64 & 0xF000ULL) << 12) | ((field64 & 0xF0ULL) << 16) | ((field32 & 0xF0000000ULL) >> 12) | + ((field32 & 0xF00000ULL) >> 12) | ((field32 & 0xF000ULL) >> 8) | ((field32 & 0xF0ULL) >> 4); + } + } + } + + // Free resources + SAFE_FREE (ctx->img_data); + SAFE_FREE (ctx->row_pointers); + + // Success + return PNGU_OK; +} + + +int PNGU_DecodeTo4x4RGBA8 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u8 default_alpha) +{ + // width and height need to be divisible by four +// if ((width % 4) || (height % 4)) +// return PNGU_INVALID_WIDTH_OR_HEIGHT; + + int result = pngu_decode (ctx, width, height, 0, 0); + if (result != PNGU_OK) return result; + + // Init some variables + PNGU_u32 x, y, qwidth = width / 4, qheight = height / 4; + + // Check is source image has an alpha channel + if ( (ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY_ALPHA) || (ctx->prop.imgColorType == PNGU_COLOR_TYPE_RGB_ALPHA) ) + { + // Alpha channel present, copy image to the output buffer + for (y = 0; y < qheight; y++) + for (x = 0; x < qwidth; x++) + { + int blockbase = (y * qwidth + x) * 8; + + PNGU_u64 fieldA = *((PNGU_u64 *)(ctx->row_pointers[y*4]+x*16)); + PNGU_u64 fieldB = *((PNGU_u64 *)(ctx->row_pointers[y*4]+x*16+8)); + ((PNGU_u64 *) buffer)[blockbase] = + ((fieldA & 0xFF00000000ULL) << 24) | ((fieldA & 0xFF00000000000000ULL) >> 8) | + ((fieldA & 0xFFULL) << 40) | ((fieldA & 0xFF000000ULL) << 8) | + ((fieldB & 0xFF00000000ULL) >> 8) | ((fieldB & 0xFF00000000000000ULL) >> 40) | + ((fieldB & 0xFFULL) << 8) | ((fieldB & 0xFF000000ULL) >> 24); + ((PNGU_u64 *) buffer)[blockbase+4] = + ((fieldA & 0xFFFF0000000000ULL) << 8) | ((fieldA & 0xFFFF00ULL) << 24) | + ((fieldB & 0xFFFF0000000000ULL) >> 24) | ((fieldB & 0xFFFF00ULL) >> 8); + + fieldA = *((PNGU_u64 *)(ctx->row_pointers[y*4+1]+x*16)); + fieldB = *((PNGU_u64 *)(ctx->row_pointers[y*4+1]+x*16+8)); + ((PNGU_u64 *) buffer)[blockbase+1] = + ((fieldA & 0xFF00000000ULL) << 24) | ((fieldA & 0xFF00000000000000ULL) >> 8) | + ((fieldA & 0xFFULL) << 40) | ((fieldA & 0xFF000000ULL) << 8) | + ((fieldB & 0xFF00000000ULL) >> 8) | ((fieldB & 0xFF00000000000000ULL) >> 40) | + ((fieldB & 0xFFULL) << 8) | ((fieldB & 0xFF000000ULL) >> 24); + ((PNGU_u64 *) buffer)[blockbase+5] = + ((fieldA & 0xFFFF0000000000ULL) << 8) | ((fieldA & 0xFFFF00ULL) << 24) | + ((fieldB & 0xFFFF0000000000ULL) >> 24) | ((fieldB & 0xFFFF00ULL) >> 8); + + fieldA = *((PNGU_u64 *)(ctx->row_pointers[y*4+2]+x*16)); + fieldB = *((PNGU_u64 *)(ctx->row_pointers[y*4+2]+x*16+8)); + ((PNGU_u64 *) buffer)[blockbase+2] = + ((fieldA & 0xFF00000000ULL) << 24) | ((fieldA & 0xFF00000000000000ULL) >> 8) | + ((fieldA & 0xFFULL) << 40) | ((fieldA & 0xFF000000ULL) << 8) | + ((fieldB & 0xFF00000000ULL) >> 8) | ((fieldB & 0xFF00000000000000ULL) >> 40) | + ((fieldB & 0xFFULL) << 8) | ((fieldB & 0xFF000000ULL) >> 24); + ((PNGU_u64 *) buffer)[blockbase+6] = + ((fieldA & 0xFFFF0000000000ULL) << 8) | ((fieldA & 0xFFFF00ULL) << 24) | + ((fieldB & 0xFFFF0000000000ULL) >> 24) | ((fieldB & 0xFFFF00ULL) >> 8); + + fieldA = *((PNGU_u64 *)(ctx->row_pointers[y*4+3]+x*16)); + fieldB = *((PNGU_u64 *)(ctx->row_pointers[y*4+3]+x*16+8)); + ((PNGU_u64 *) buffer)[blockbase+3] = + ((fieldA & 0xFF00000000ULL) << 24) | ((fieldA & 0xFF00000000000000ULL) >> 8) | + ((fieldA & 0xFFULL) << 40) | ((fieldA & 0xFF000000ULL) << 8) | + ((fieldB & 0xFF00000000ULL) >> 8) | ((fieldB & 0xFF00000000000000ULL) >> 40) | + ((fieldB & 0xFFULL) << 8) | ((fieldB & 0xFF000000ULL) >> 24); + ((PNGU_u64 *) buffer)[blockbase+7] = + ((fieldA & 0xFFFF0000000000ULL) << 8) | ((fieldA & 0xFFFF00ULL) << 24) | + ((fieldB & 0xFFFF0000000000ULL) >> 24) | ((fieldB & 0xFFFF00ULL) >> 8); + } + } + else + { + // No alpha channel present, copy image to the output buffer + PNGU_u64 alphaMask = (((PNGU_u64)default_alpha) << 56) | (((PNGU_u64)default_alpha) << 40) | + (((PNGU_u64)default_alpha) << 24) | (((PNGU_u64)default_alpha) << 8); + + for (y = 0; y < qheight; y++) + for (x = 0; x < qwidth; x++) + { + int blockbase = (y * qwidth + x) * 8; + + PNGU_u64 field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4]+x*12)); + PNGU_u64 field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase] = + (((field64 & 0xFF00000000000000ULL) >> 8) | (field64 & 0xFF00000000ULL) | + ((field64 & 0xFF00ULL) << 8) | ((field32 & 0xFF0000ULL) >> 16) | alphaMask); + ((PNGU_u64 *) buffer)[blockbase+4] = + (((field64 & 0xFFFF0000000000ULL) << 8) | ((field64 & 0xFFFF0000ULL) << 16) | + ((field64 & 0xFFULL) << 24) | ((field32 & 0xFF000000ULL) >> 8) | (field32 & 0xFFFFULL)); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+1]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+1]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+1] = + (((field64 & 0xFF00000000000000ULL) >> 8) | (field64 & 0xFF00000000ULL) | + ((field64 & 0xFF00ULL) << 8) | ((field32 & 0xFF0000ULL) >> 16) | alphaMask); + ((PNGU_u64 *) buffer)[blockbase+5] = + (((field64 & 0xFFFF0000000000ULL) << 8) | ((field64 & 0xFFFF0000ULL) << 16) | + ((field64 & 0xFFULL) << 24) | ((field32 & 0xFF000000ULL) >> 8) | (field32 & 0xFFFFULL)); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+2]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+2]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+2] = + (((field64 & 0xFF00000000000000ULL) >> 8) | (field64 & 0xFF00000000ULL) | + ((field64 & 0xFF00ULL) << 8) | ((field32 & 0xFF0000ULL) >> 16) | alphaMask); + ((PNGU_u64 *) buffer)[blockbase+6] = + (((field64 & 0xFFFF0000000000ULL) << 8) | ((field64 & 0xFFFF0000ULL) << 16) | + ((field64 & 0xFFULL) << 24) | ((field32 & 0xFF000000ULL) >> 8) | (field32 & 0xFFFFULL)); + + field64 = *((PNGU_u64 *)(ctx->row_pointers[y*4+3]+x*12)); + field32 = (PNGU_u64) *((PNGU_u32 *)(ctx->row_pointers[y*4+3]+x*12+8)); + ((PNGU_u64 *) buffer)[blockbase+3] = + (((field64 & 0xFF00000000000000ULL) >> 8) | (field64 & 0xFF00000000ULL) | + ((field64 & 0xFF00ULL) << 8) | ((field32 & 0xFF0000ULL) >> 16) | alphaMask); + ((PNGU_u64 *) buffer)[blockbase+7] = + (((field64 & 0xFFFF0000000000ULL) << 8) | ((field64 & 0xFFFF0000ULL) << 16) | + ((field64 & 0xFFULL) << 24) | ((field32 & 0xFF000000ULL) >> 8) | (field32 & 0xFFFFULL)); + } + } + + // Free resources + SAFE_FREE (ctx->img_data); + SAFE_FREE (ctx->row_pointers); + + // Success + return PNGU_OK; +} + + +static inline PNGU_u16 rgb8ToRGB565(PNGU_u8 *color) +{ + return ((color[0] >> 3) << 11) | ((color[1] >> 2) << 5) | (color[2] >> 3); +} + + +static int colorDistance(const PNGU_u8 *c0, const PNGU_u8 *c1) +{ + return (c1[0] - c0[0]) * (c1[0] - c0[0]) + (c1[1] - c0[1]) * (c1[1] - c0[1]) + (c1[2] - c0[2]) * (c1[2] - c0[2]); +} + + +static void getBaseColors(PNGU_u8 *color0, PNGU_u8 *color1, const PNGU_u8 *srcBlock) +{ + int i, j, maxDistance = -1; + + for (i = 0; i < 15; ++i) + for (j = i + 1; j < 16; ++j) + { + int distance = colorDistance(srcBlock + i * 4, srcBlock + j * 4); + if (distance > maxDistance) + { + maxDistance = distance; + *(PNGU_u32 *)color0 = ((PNGU_u32 *)srcBlock)[i]; + *(PNGU_u32 *)color1 = ((PNGU_u32 *)srcBlock)[j]; + } + } + if (rgb8ToRGB565(color0) < rgb8ToRGB565(color1)) + { + PNGU_u32 tmp = *(PNGU_u32 *)color0; + *(PNGU_u32 *)color0 = *(PNGU_u32 *)color1; + *(PNGU_u32 *)color1 = tmp; + } +} + + +static PNGU_u32 colorIndices(const PNGU_u8 *color0, const PNGU_u8 *color1, const PNGU_u8 *srcBlock) +{ + PNGU_u16 colors[4][4]; + PNGU_u32 res = 0; + int i; + + // Make the 4 colors available in the block + colors[0][0] = (color0[0] & 0xF8) | (color0[0] >> 5); + colors[0][1] = (color0[1] & 0xFC) | (color0[1] >> 6); + colors[0][2] = (color0[2] & 0xF8) | (color0[2] >> 5); + colors[1][0] = (color1[0] & 0xF8) | (color1[0] >> 5); + colors[1][1] = (color1[1] & 0xFC) | (color1[1] >> 6); + colors[1][2] = (color1[2] & 0xF8) | (color1[2] >> 5); + colors[2][0] = (2 * colors[0][0] + 1 * colors[1][0]) / 3; + colors[2][1] = (2 * colors[0][1] + 1 * colors[1][1]) / 3; + colors[2][2] = (2 * colors[0][2] + 1 * colors[1][2]) / 3; + colors[3][0] = (1 * colors[0][0] + 2 * colors[1][0]) / 3; + colors[3][1] = (1 * colors[0][1] + 2 * colors[1][1]) / 3; + colors[3][2] = (1 * colors[0][2] + 2 * colors[1][2]) / 3; + for (i = 15; i >= 0; --i) + { + int c0 = srcBlock[i * 4 + 0]; + int c1 = srcBlock[i * 4 + 1]; + int c2 = srcBlock[i * 4 + 2]; + int d0 = abs(colors[0][0] - c0) + abs(colors[0][1] - c1) + abs(colors[0][2] - c2); + int d1 = abs(colors[1][0] - c0) + abs(colors[1][1] - c1) + abs(colors[1][2] - c2); + int d2 = abs(colors[2][0] - c0) + abs(colors[2][1] - c1) + abs(colors[2][2] - c2); + int d3 = abs(colors[3][0] - c0) + abs(colors[3][1] - c1) + abs(colors[3][2] - c2); + int b0 = d0 > d3; + int b1 = d1 > d2; + int b2 = d0 > d2; + int b3 = d1 > d3; + int b4 = d2 > d3; + int x0 = b1 & b2; + int x1 = b0 & b3; + int x2 = b0 & b4; + res |= (x2 | ((x0 | x1) << 1)) << ((15 - i) << 1); + } + return res; +} + + +int PNGU_DecodeToCMPR(IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer) +{ + PNGU_u8 srcBlock[16 * 4]; + PNGU_u8 color0[4]; + PNGU_u8 color1[4]; + PNGU_u8 *outBuf = (PNGU_u8 *)buffer; + int ii, jj, k; + + int result = pngu_decode (ctx, width, height, 0, 1); + if (result != PNGU_OK) return result; + width = width & ~7u; + height = height & ~7u; + // Alpha channel present, copy image to the output buffer + for (jj = 0; jj < (int)height; jj += 8) + for (ii = 0; ii < (int)width; ii += 8) + for (k = 0; k < 4; ++k) + { + int j = jj + ((k >> 1) << 2); + int i = ii + ((k & 1) << 2); + memcpy(srcBlock, ctx->row_pointers[j] + i * 4, 16); + memcpy(srcBlock + 4 * 4, ctx->row_pointers[j + 1] + i * 4, 16); + memcpy(srcBlock + 8 * 4, ctx->row_pointers[j + 2] + i * 4, 16); + memcpy(srcBlock + 12 * 4, ctx->row_pointers[j + 3] + i * 4, 16); + getBaseColors(color0, color1, srcBlock); + *(PNGU_u16 *)outBuf = rgb8ToRGB565(color0); + outBuf += 2; + *(PNGU_u16 *)outBuf = rgb8ToRGB565(color1); + outBuf += 2; + *(PNGU_u32 *)outBuf = colorIndices(color0, color1, srcBlock); + outBuf += 4; + } + // Free resources + SAFE_FREE (ctx->img_data); + SAFE_FREE (ctx->row_pointers); + + // Success + return PNGU_OK; +} + + +void user_error (png_structp png_ptr, png_const_charp c) +{ + longjmp (png_ptr->jmpbuf, 1); +} +int PNGU_EncodeFromYCbYCr (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride) +{ + + // Erase from the context any readed info + pngu_free_info (ctx); + ctx->propRead = 0; + + // Check if the user has selected a file to write the image + if (ctx->source == PNGU_SOURCE_BUFFER); + + else if (ctx->source == PNGU_SOURCE_DEVICE) + { + // Open file + if (!(ctx->fd = fopen (ctx->filename, "wb"))) + return PNGU_CANT_OPEN_FILE; + } + + else + return PNGU_NO_FILE_SELECTED; + + // Allocation of libpng structs + ctx->png_ptr = png_create_write_struct (PNG_LIBPNG_VER_STRING, NULL, NULL, NULL); + if (!(ctx->png_ptr)) + { + if (ctx->source == PNGU_SOURCE_DEVICE) + fclose (ctx->fd); + return PNGU_LIB_ERROR; + } + + ctx->info_ptr = png_create_info_struct (ctx->png_ptr); + if (!(ctx->info_ptr)) + { + png_destroy_write_struct (&(ctx->png_ptr), (png_infopp)NULL); + if (ctx->source == PNGU_SOURCE_DEVICE) + fclose (ctx->fd); + return PNGU_LIB_ERROR; + } + + if (ctx->source == PNGU_SOURCE_BUFFER) + { + // Installation of our custom data writer function + ctx->cursor = 0; + png_set_write_fn (ctx->png_ptr, ctx, pngu_write_data_to_buffer, pngu_flush_data_to_buffer); + } + else if (ctx->source == PNGU_SOURCE_DEVICE) + { + // Default data writer uses function fwrite, so it needs to use our FILE* + png_init_io (ctx->png_ptr, ctx->fd); + } + + // Setup output file properties + png_set_IHDR (ctx->png_ptr, ctx->info_ptr, width, height, 8, PNG_COLOR_TYPE_RGB, + PNG_INTERLACE_NONE, PNG_COMPRESSION_TYPE_DEFAULT, PNG_FILTER_TYPE_DEFAULT); + + // Allocate memory to store the image in RGB format + png_uint_32 rowbytes = width * 3; + if (rowbytes % 4) + rowbytes = ((rowbytes / 4) + 1) * 4; // Add extra padding so each row starts in a 4 byte boundary + + ctx->img_data = malloc (rowbytes * height); + if (!ctx->img_data) + { + png_destroy_write_struct (&(ctx->png_ptr), (png_infopp)NULL); + if (ctx->source == PNGU_SOURCE_DEVICE) + fclose (ctx->fd); + return PNGU_LIB_ERROR; + } + + ctx->row_pointers = malloc (sizeof (png_bytep) * height); + if (!ctx->row_pointers) + { + png_destroy_write_struct (&(ctx->png_ptr), (png_infopp)NULL); + if (ctx->source == PNGU_SOURCE_DEVICE) + fclose (ctx->fd); + return PNGU_LIB_ERROR; + } + + // Encode YCbYCr image into RGB8 format + PNGU_u32 x, y, buffWidth = (width + stride) / 2; + for (y = 0; y < height; y++) + { + ctx->row_pointers[y] = ctx->img_data + (y * rowbytes); + + for (x = 0; x < (width / 2); x++) + PNGU_YCbYCr_TO_RGB8 ( ((PNGU_u32 *)buffer)[y*buffWidth+x], + ((PNGU_u8 *) ctx->row_pointers[y]+x*6), ((PNGU_u8 *) ctx->row_pointers[y]+x*6+1), + ((PNGU_u8 *) ctx->row_pointers[y]+x*6+2), ((PNGU_u8 *) ctx->row_pointers[y]+x*6+3), + ((PNGU_u8 *) ctx->row_pointers[y]+x*6+4), ((PNGU_u8 *) ctx->row_pointers[y]+x*6+5) ); + } + + // Tell libpng where is our image data + png_set_rows (ctx->png_ptr, ctx->info_ptr, ctx->row_pointers); + + // Write file header and image data + png_write_png (ctx->png_ptr, ctx->info_ptr, PNG_TRANSFORM_IDENTITY, NULL); + + // Tell libpng we have no more data to write + png_write_end (ctx->png_ptr, (png_infop) NULL); + + // Free resources + SAFE_FREE (ctx->img_data); + SAFE_FREE (ctx->row_pointers); + png_destroy_write_struct (&(ctx->png_ptr), &(ctx->info_ptr)); + if (ctx->source == PNGU_SOURCE_DEVICE) + fclose (ctx->fd); + + // Success + return PNGU_OK; +} + + +// This function is taken from a libogc example +PNGU_u32 PNGU_RGB8_TO_YCbYCr (PNGU_u8 r1, PNGU_u8 g1, PNGU_u8 b1, PNGU_u8 r2, PNGU_u8 g2, PNGU_u8 b2) +{ + int y1 = (299 * r1 + 587 * g1 + 114 * b1) / 1000; + int cb1 = (-16874 * r1 - 33126 * g1 + 50000 * b1 + 12800000) / 100000; + int cr1 = (50000 * r1 - 41869 * g1 - 8131 * b1 + 12800000) / 100000; + + int y2 = (299 * r2 + 587 * g2 + 114 * b2) / 1000; + int cb2 = (-16874 * r2 - 33126 * g2 + 50000 * b2 + 12800000) / 100000; + int cr2 = (50000 * r2 - 41869 * g2 - 8131 * b2 + 12800000) / 100000; + + int cb = (cb1 + cb2) >> 1; + int cr = (cr1 + cr2) >> 1; + + return (PNGU_u32) ((y1 << 24) | (cb << 16) | (y2 << 8) | cr); +} + + +void PNGU_YCbYCr_TO_RGB8 (PNGU_u32 ycbycr, PNGU_u8 *r1, PNGU_u8 *g1, PNGU_u8 *b1, PNGU_u8 *r2, PNGU_u8 *g2, PNGU_u8 *b2) +{ + PNGU_u8 *val = (PNGU_u8 *) &ycbycr; + + int r = 1.371f * (val[3] - 128); + int g = - 0.698f * (val[3] - 128) - 0.336f * (val[1] - 128); + int b = 1.732f * (val[1] - 128); + + *r1 = pngu_clamp (val[0] + r, 0, 255); + *g1 = pngu_clamp (val[0] + g, 0, 255); + *b1 = pngu_clamp (val[0] + b, 0, 255); + + *r2 = pngu_clamp (val[2] + r, 0, 255); + *g2 = pngu_clamp (val[2] + g, 0, 255); + *b2 = pngu_clamp (val[2] + b, 0, 255); +} + + +int pngu_info (IMGCTX ctx) +{ + png_byte magic[8]; + + // Check if there is a file selected and if it is a valid .png + if (ctx->source == PNGU_SOURCE_BUFFER) + memcpy (magic, ctx->buffer, 8); + + else if (ctx->source == PNGU_SOURCE_DEVICE) + { + // Open file + if (!(ctx->fd = fopen (ctx->filename, "rb"))) + return PNGU_CANT_OPEN_FILE; + + // Load first 8 bytes into magic buffer + if (fread (magic, 1, 8, ctx->fd) != 8) + { + fclose (ctx->fd); + return PNGU_CANT_READ_FILE; + } + } + + else + return PNGU_NO_FILE_SELECTED;; + + if (png_sig_cmp(magic, 0, 8) != 0) + { + if (ctx->source == PNGU_SOURCE_DEVICE) + fclose (ctx->fd); + return PNGU_FILE_IS_NOT_PNG; + } + + // Allocation of libpng structs + ctx->png_ptr = png_create_read_struct (PNG_LIBPNG_VER_STRING, NULL, NULL, NULL); + if (!(ctx->png_ptr)) + { + if (ctx->source == PNGU_SOURCE_DEVICE) + fclose (ctx->fd); + return PNGU_LIB_ERROR; + } + + ctx->info_ptr = png_create_info_struct (ctx->png_ptr); + if (!(ctx->info_ptr)) + { + if (ctx->source == PNGU_SOURCE_DEVICE) + fclose (ctx->fd); + png_destroy_read_struct (&(ctx->png_ptr), (png_infopp)NULL, (png_infopp)NULL); + return PNGU_LIB_ERROR; + } + + if (ctx->source == PNGU_SOURCE_BUFFER) + { + // Installation of our custom data provider function + ctx->cursor = 0; + png_set_read_fn (ctx->png_ptr, ctx, pngu_read_data_from_buffer); + } + else if (ctx->source == PNGU_SOURCE_DEVICE) + { + // Default data provider uses function fread, so it needs to use our FILE* + png_init_io (ctx->png_ptr, ctx->fd); + png_set_sig_bytes (ctx->png_ptr, 8); // We have read 8 bytes already to check PNG authenticity + } + + // Read png header + png_read_info (ctx->png_ptr, ctx->info_ptr); + + // Query image properties if they have not been queried before + if (!ctx->propRead) + { + png_uint_32 width, height; + png_get_IHDR(ctx->png_ptr, ctx->info_ptr, &width, &height, + (int *) &(ctx->prop.imgBitDepth), + (int *) &(ctx->prop.imgColorType), + NULL, NULL, NULL); + + ctx->prop.imgWidth = width; + ctx->prop.imgHeight = height; + switch (ctx->prop.imgColorType) + { + case PNG_COLOR_TYPE_GRAY: + ctx->prop.imgColorType = PNGU_COLOR_TYPE_GRAY; + break; + case PNG_COLOR_TYPE_GRAY_ALPHA: + ctx->prop.imgColorType = PNGU_COLOR_TYPE_GRAY_ALPHA; + break; + case PNG_COLOR_TYPE_PALETTE: + ctx->prop.imgColorType = PNGU_COLOR_TYPE_PALETTE; + break; + case PNG_COLOR_TYPE_RGB: + ctx->prop.imgColorType = PNGU_COLOR_TYPE_RGB; + break; + case PNG_COLOR_TYPE_RGB_ALPHA: + ctx->prop.imgColorType = PNGU_COLOR_TYPE_RGB_ALPHA; + break; + default: + ctx->prop.imgColorType = PNGU_COLOR_TYPE_UNKNOWN; + break; + } + + // Constant used to scale 16 bit values to 8 bit values + int scale = 1; + if (ctx->prop.imgBitDepth == 16) + scale = 256; + + // Query background color, if any. + png_color_16p background; + ctx->prop.validBckgrnd = 0; + if (((ctx->prop.imgColorType == PNGU_COLOR_TYPE_RGB) || (ctx->prop.imgColorType == PNGU_COLOR_TYPE_RGB_ALPHA)) && + (png_get_bKGD (ctx->png_ptr, ctx->info_ptr, &background))) + { + ctx->prop.validBckgrnd = 1; + ctx->prop.bckgrnd.r = background->red / scale; + ctx->prop.bckgrnd.g = background->green / scale; + ctx->prop.bckgrnd.b = background->blue / scale; + } + else if (((ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY) || (ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY_ALPHA)) && + (png_get_bKGD (ctx->png_ptr, ctx->info_ptr, &background))) + { + ctx->prop.validBckgrnd = 1; + ctx->prop.bckgrnd.r = ctx->prop.bckgrnd.g = ctx->prop.bckgrnd.b = background->gray / scale; + } + + // Query list of transparent colors, if any. + int i; + png_bytep trans; + png_color_16p trans_values; + ctx->prop.numTrans = 0; + ctx->prop.trans = NULL; + if (((ctx->prop.imgColorType == PNGU_COLOR_TYPE_RGB) || (ctx->prop.imgColorType == PNGU_COLOR_TYPE_RGB_ALPHA)) && + (png_get_tRNS (ctx->png_ptr, ctx->info_ptr, &trans, (int *) &(ctx->prop.numTrans), &trans_values))) + { + if (ctx->prop.numTrans) + { + ctx->prop.trans = malloc (sizeof (PNGUCOLOR) * ctx->prop.numTrans); + if (ctx->prop.trans) + { + for (i = 0; i < ctx->prop.numTrans; i++) + { + ctx->prop.trans[i].r = trans_values[i].red / scale; + ctx->prop.trans[i].g = trans_values[i].green / scale; + ctx->prop.trans[i].b = trans_values[i].blue / scale; + } + } + else + ctx->prop.numTrans = 0; + } + } + else if (((ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY) || (ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY_ALPHA)) && + (png_get_tRNS (ctx->png_ptr, ctx->info_ptr, &trans, (int *) &(ctx->prop.numTrans), &trans_values))) + { + if (ctx->prop.numTrans) + { + ctx->prop.trans = malloc (sizeof (PNGUCOLOR) * ctx->prop.numTrans); + if (ctx->prop.trans) + for (i = 0; i < ctx->prop.numTrans; i++) + ctx->prop.trans[i].r = ctx->prop.trans[i].g = ctx->prop.trans[i].b = + trans_values[i].gray / scale; + else + ctx->prop.numTrans = 0; + } + } + + ctx->propRead = 1; + } + + // Success + ctx->infoRead = 1; + + return PNGU_OK; +} + + +int pngu_decode (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, PNGU_u32 stripAlpha, int force32bit) +{ + int i; + int mem_err = 0; + + // Read info if it hasn't been read before + if (!ctx->infoRead) + { + i = pngu_info (ctx); + if (i != PNGU_OK) return i; + } + + // Check if the user has specified the real width and height of the image + if ( (ctx->prop.imgWidth != width) || (ctx->prop.imgHeight != height) ) + return PNGU_INVALID_WIDTH_OR_HEIGHT; + + // Check if color type is supported by PNGU + if ( (ctx->prop.imgColorType == PNGU_COLOR_TYPE_PALETTE) || (ctx->prop.imgColorType == PNGU_COLOR_TYPE_UNKNOWN) ) + return PNGU_UNSUPPORTED_COLOR_TYPE; + + // error handling + jmp_buf save_jmp; + memcpy(save_jmp, png_jmpbuf(ctx->png_ptr), sizeof(save_jmp)); + if (setjmp(png_jmpbuf(ctx->png_ptr))) + { + error: + memcpy(png_jmpbuf(ctx->png_ptr), save_jmp, sizeof(save_jmp)); + SAFE_FREE(ctx->row_pointers); + SAFE_FREE(ctx->img_data); + pngu_free_info (ctx); + //printf("*** This is a corrupted image!!\n"); sleep(5); + return mem_err ? PNGU_LIB_ERROR : -666; + } + png_set_error_fn (ctx->png_ptr, NULL, user_error, user_error); + // Scale 16 bit samples to 8 bit + if (ctx->prop.imgBitDepth == 16) + png_set_strip_16 (ctx->png_ptr); + + // Remove alpha channel if we don't need it + if (stripAlpha && ((ctx->prop.imgColorType == PNGU_COLOR_TYPE_RGB_ALPHA) || (ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY_ALPHA))) + png_set_strip_alpha (ctx->png_ptr); + + // Expand 1, 2 and 4 bit samples to 8 bit + if (ctx->prop.imgBitDepth < 8) + png_set_packing (ctx->png_ptr); + + // Transform grayscale images to RGB + if ( (ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY) || (ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY_ALPHA) ) + png_set_gray_to_rgb (ctx->png_ptr); + + // Transform RBG images to RGBA + if (force32bit && (ctx->prop.imgColorType == PNGU_COLOR_TYPE_GRAY || ctx->prop.imgColorType == PNGU_COLOR_TYPE_RGB)) + png_set_filler(ctx->png_ptr, 0xFF, PNG_FILLER_AFTER); + + // Flush transformations + png_read_update_info (ctx->png_ptr, ctx->info_ptr); + + // Allocate memory to store the image + png_uint_32 rowbytes = png_get_rowbytes (ctx->png_ptr, ctx->info_ptr); + if (rowbytes % 4) + rowbytes = ((rowbytes / 4) + 1) * 4; // Add extra padding so each row starts in a 4 byte boundary + + ctx->img_data = malloc (rowbytes * ctx->prop.imgHeight); + if (!ctx->img_data) + { + mem_err = 1; + goto error; + } + + ctx->row_pointers = malloc (sizeof (png_bytep) * ctx->prop.imgHeight); + if (!ctx->row_pointers) + { + mem_err = 1; + goto error; + } + + for (i = 0; i < ctx->prop.imgHeight; i++) + ctx->row_pointers[i] = ctx->img_data + (i * rowbytes); + + // Transform the image and copy it to our allocated memory + if (png_get_interlace_type(ctx->png_ptr, ctx->info_ptr) != PNG_INTERLACE_NONE) + png_read_image (ctx->png_ptr, ctx->row_pointers); + else + { + int rowsLeft = ctx->prop.imgHeight; + png_bytep *curRow = ctx->row_pointers; + while (rowsLeft > 0) + { + int chunk = rowsLeft > 0x80 ? 0x80 : rowsLeft; + png_read_rows(ctx->png_ptr, curRow, NULL, chunk); + usleep(1000); + curRow += chunk; + rowsLeft -= chunk; + } + } + + // restore default error handling + memcpy(png_jmpbuf(ctx->png_ptr), save_jmp, sizeof(save_jmp)); + // Free resources + pngu_free_info (ctx); + + // Success + return PNGU_OK; +} + + +void pngu_free_info (IMGCTX ctx) +{ + if (ctx->infoRead) + { + if (ctx->source == PNGU_SOURCE_DEVICE) + fclose (ctx->fd); + + png_destroy_read_struct (&(ctx->png_ptr), &(ctx->info_ptr), (png_infopp)NULL); + + ctx->infoRead = 0; + } +} + + +void pngu_read_data_from_buffer (png_structp png_ptr, png_bytep data, png_size_t length) +{ + IMGCTX ctx = (IMGCTX) png_get_io_ptr (png_ptr); + if (ctx->buf_size && (ctx->cursor + length > ctx->buf_size)) + { + static char err_str[40]; + snprintf(err_str, sizeof(err_str), "read error (%x/%x)", + ctx->cursor + length, ctx->buf_size); + png_error(png_ptr, err_str); + } + memcpy (data, ctx->buffer + ctx->cursor, length); + ctx->cursor += length; +} + + +void pngu_write_data_to_buffer (png_structp png_ptr, png_bytep data, png_size_t length) +{ + IMGCTX ctx = (IMGCTX) png_get_io_ptr (png_ptr); + memcpy (ctx->buffer + ctx->cursor, data, length); + ctx->cursor += length; +} + + +void pngu_flush_data_to_buffer (png_structp png_ptr) +{ + // Nothing to do here +} + + +// Function used in YCbYCr to RGB decoding +int pngu_clamp (int value, int min, int max) +{ + if (value < min) value = min; + else if (value > max) value = max; + + return value; +} + diff --git a/source/gui/pngu.h b/source/gui/pngu.h new file mode 100644 index 00000000..eb72ca50 --- /dev/null +++ b/source/gui/pngu.h @@ -0,0 +1,174 @@ +/******************************************************************************************** + +PNGU Version : 0.2a + +Coder : frontier + +More info : http://frontier-dev.net + +********************************************************************************************/ +#ifndef __PNGU__ +#define __PNGU__ + +// Return codes +#define PNGU_OK 0 +#define PNGU_ODD_WIDTH 1 +#define PNGU_ODD_STRIDE 2 +#define PNGU_INVALID_WIDTH_OR_HEIGHT 3 +#define PNGU_FILE_IS_NOT_PNG 4 +#define PNGU_UNSUPPORTED_COLOR_TYPE 5 +#define PNGU_NO_FILE_SELECTED 6 +#define PNGU_CANT_OPEN_FILE 7 +#define PNGU_CANT_READ_FILE 8 +#define PNGU_LIB_ERROR 9 + +// Color types +#define PNGU_COLOR_TYPE_GRAY 1 +#define PNGU_COLOR_TYPE_GRAY_ALPHA 2 +#define PNGU_COLOR_TYPE_PALETTE 3 +#define PNGU_COLOR_TYPE_RGB 4 +#define PNGU_COLOR_TYPE_RGB_ALPHA 5 +#define PNGU_COLOR_TYPE_UNKNOWN 6 + + +#ifdef __cplusplus + extern "C" { +#endif + +// Types +typedef unsigned char PNGU_u8; +typedef unsigned short PNGU_u16; +typedef unsigned int PNGU_u32; +typedef unsigned long long PNGU_u64; + +typedef struct +{ + PNGU_u8 r; + PNGU_u8 g; + PNGU_u8 b; +} PNGUCOLOR; + +typedef struct +{ + PNGU_u32 imgWidth; // In pixels + PNGU_u32 imgHeight; // In pixels + PNGU_u32 imgBitDepth; // In bitx + PNGU_u32 imgColorType; // PNGU_COLOR_TYPE_* + PNGU_u32 validBckgrnd; // Non zero if there is a background color + PNGUCOLOR bckgrnd; // Backgroun color + PNGU_u32 numTrans; // Number of transparent colors + PNGUCOLOR *trans; // Transparent colors +} PNGUPROP; + +// Image context, always initialize with SelectImageFrom* and free with ReleaseImageContext +struct _IMGCTX; +typedef struct _IMGCTX *IMGCTX; + + +/**************************************************************************** +* Pixel conversion * +****************************************************************************/ + +// Macro to convert RGB8 values to RGB565 +#define PNGU_RGB8_TO_RGB565(r,g,b) ( ((((PNGU_u16) r) & 0xF8U) << 8) | ((((PNGU_u16) g) & 0xFCU) << 3) | (((PNGU_u16) b) >> 3) ) + +// Macro to convert RGBA8 values to RGB5A3 +#define PNGU_RGB8_TO_RGB5A3(r,g,b,a) (PNGU_u16) (((a & 0xE0U) == 0xE0U) ? \ + (0x8000U | ((((PNGU_u16) r) & 0xF8U) << 7) | ((((PNGU_u16) g) & 0xF8U) << 2) | (((PNGU_u16) b) >> 3)) : \ + (((((PNGU_u16) a) & 0xE0U) << 7) | ((((PNGU_u16) r) & 0xF0U) << 4) | (((PNGU_u16) g) & 0xF0U) | ((((PNGU_u16) b) & 0xF0U) >> 4))) + +// Function to convert two RGB8 values to YCbYCr +PNGU_u32 PNGU_RGB8_TO_YCbYCr (PNGU_u8 r1, PNGU_u8 g1, PNGU_u8 b1, PNGU_u8 r2, PNGU_u8 g2, PNGU_u8 b2); + +// Function to convert an YCbYCr to two RGB8 values. +void PNGU_YCbYCr_TO_RGB8 (PNGU_u32 ycbycr, PNGU_u8 *r1, PNGU_u8 *g1, PNGU_u8 *b1, PNGU_u8 *r2, PNGU_u8 *g2, PNGU_u8 *b2); + + +/**************************************************************************** +* Image context handling * +****************************************************************************/ + +// Selects a PNG file, previosly loaded into a buffer, and creates an image context for subsequent procesing. +IMGCTX PNGU_SelectImageFromBuffer (const void *buffer); + +// Selects a PNG file, from any devoptab device, and creates an image context for subsequent procesing. +IMGCTX PNGU_SelectImageFromDevice (const char *filename); + +// Frees resources associated with an image context. Always call this function when you no longer need the IMGCTX. +void PNGU_ReleaseImageContext (IMGCTX ctx); + + +/**************************************************************************** +* Miscelaneous * +****************************************************************************/ + +// Retrieves info from selected PNG file, including image dimensions, color format, background and transparency colors. +int PNGU_GetImageProperties (IMGCTX ctx, PNGUPROP *fileproperties); + + +/**************************************************************************** +* Image conversion * +****************************************************************************/ + +// Expands selected image into an YCbYCr buffer. You need to specify context, image dimensions, +// destination address and stride in pixels (stride = buffer width - image width). +int PNGU_DecodeToYCbYCr (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride); + +// Macro for decoding an image inside a buffer at given coordinates. +#define PNGU_DECODE_TO_COORDS_YCbYCr(ctx,coordX,coordY,imgWidth,imgHeight,bufferWidth,bufferHeight,buffer) \ + \ + PNGU_DecodeToYCbYCr (ctx, imgWidth, imgHeight, ((void *) buffer) + (coordY) * (bufferWidth) * 2 + \ + (coordX) * 2, (bufferWidth) - (imgWidth)) + +// Expands selected image into a linear RGB565 buffer. You need to specify context, image dimensions, +// destination address and stride in pixels (stride = buffer width - image width). +int PNGU_DecodeToRGB565 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride); + +// Macro for decoding an image inside a buffer at given coordinates. +#define PNGU_DECODE_TO_COORDS_RGB565(ctx,coordX,coordY,imgWidth,imgHeight,bufferWidth,bufferHeight,buffer) \ + \ + PNGU_DecodeToRGB565 (ctx, imgWidth, imgHeight, ((void *) buffer) + (coordY) * (bufferWidth) * 2 + \ + (coordX) * 2, (bufferWidth) - (imgWidth)) + +// Expands selected image into a linear RGBA8 buffer. You need to specify context, image dimensions, +// destination address, stride in pixels and default alpha value, which is used if the source image +// doesn't have an alpha channel. +int PNGU_DecodeToRGBA8 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride, PNGU_u8 default_alpha); + +// Macro for decoding an image inside a buffer at given coordinates. +#define PNGU_DECODE_TO_COORDS_RGBA8(ctx,coordX,coordY,imgWidth,imgHeight,default_alpha,bufferWidth,bufferHeight,buffer) \ + \ + PNGU_DecodeToRGBA8 (ctx, imgWidth, imgHeight, ((void *) buffer) + (coordY) * (bufferWidth) * 2 + \ + (coordX) * 2, (bufferWidth) - (imgWidth), default_alpha) + +// Expands selected image into a 4x4 tiled RGB565 buffer. You need to specify context, image dimensions +// and destination address. +int PNGU_DecodeTo4x4RGB565 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer); + +// Compressed version (DXT1/CMPR) +int PNGU_DecodeToCMPR(IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer); + +// Expands selected image into a 4x4 tiled RGB5A3 buffer. You need to specify context, image dimensions, +// destination address and default alpha value, which is used if the source image doesn't have an alpha channel. +int PNGU_DecodeTo4x4RGB5A3 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u8 default_alpha); + +// Expands selected image into a 4x4 tiled RGBA8 buffer. You need to specify context, image dimensions, +// destination address and default alpha value, which is used if the source image doesn't have an alpha channel. +int PNGU_DecodeTo4x4RGBA8 (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u8 default_alpha); + +// Encodes an YCbYCr image in PNG format and stores it in the selected device or memory buffer. You need to +// specify context, image dimensions, destination address and stride in pixels (stride = buffer width - image width). +int PNGU_EncodeFromYCbYCr (IMGCTX ctx, PNGU_u32 width, PNGU_u32 height, void *buffer, PNGU_u32 stride); + +// Macro for encoding an image stored into an YCbYCr buffer at given coordinates. +#define PNGU_ENCODE_TO_COORDS_YCbYCr(ctx,coordX,coordY,imgWidth,imgHeight,bufferWidth,bufferHeight,buffer) \ + \ + PNGU_EncodeFromYCbYCr (ctx, imgWidth, imgHeight, ((void *) buffer) + (coordY) * (bufferWidth) * 2 + \ + (coordX) * 2, (bufferWidth) - (imgWidth)) + +#ifdef __cplusplus + } +#endif + +#endif + diff --git a/source/gui/text.cpp b/source/gui/text.cpp new file mode 100644 index 00000000..8d837e4b --- /dev/null +++ b/source/gui/text.cpp @@ -0,0 +1,482 @@ +#include "text.hpp" + +using namespace std; + +static const wchar_t *g_whitespaces = L" \f\n\r\t\v"; + +// Simplified use of sprintf +const char *fmt(const char *format, ...) +{ + enum { + MAX_MSG_SIZE = 512, + MAX_USES = 8 + }; + + static int currentStr = 0; + currentStr = (currentStr + 1) % MAX_USES; + + va_list va; + va_start(va, format); + static char buffer[MAX_USES][MAX_MSG_SIZE]; + vsnprintf(buffer[currentStr], MAX_MSG_SIZE, format, va); + buffer[currentStr][MAX_MSG_SIZE - 1] = '\0'; + va_end(va); + + return buffer[currentStr]; +} + +string sfmt(const char *format, ...) +{ + va_list va; + va_start(va, format); + u32 length = vsnprintf(0, 0, format, va) + 1; + va_end(va); + char *tmp = new char[length + 1]; + va_start(va, format); + vsnprintf(tmp, length, format, va); + va_end(va); + string s = tmp; + delete[] tmp; + return s; +} + +static inline bool fmtCount(const wstringEx &format, int &i, int &s) +{ + int state = 0; + + i = 0; + s = 0; + for (u32 k = 0; k < format.size(); ++k) + { + if (state == 0) + { + if (format[k] == L'%') + state = 1; + } + else if (state == 1) + { + switch (format[k]) + { + case L'%': + state = 0; + break; + case L'i': + case L'd': + state = 0; + ++i; + break; + case L's': + state = 0; + ++s; + break; + default: + return false; + } + } + } + return true; +} + +// Only handles the cases i need for translations : plain %i and %s +bool checkFmt(const wstringEx &ref, const wstringEx &format) +{ + int s; + int i; + int refs; + int refi; + if (!fmtCount(ref, refi, refs)) + return false; + if (!fmtCount(format, i, s)) + return false; + return i == refi && s == refs; +} + +wstringEx wfmt(const wstringEx &format, ...) +{ + // Don't care about performance + va_list va; + string f(format.toUTF8()); + va_start(va, format); + u32 length = vsnprintf(0, 0, f.c_str(), va) + 1; + va_end(va); + char *tmp = new char[length + 1]; + va_start(va, format); + vsnprintf(tmp, length, f.c_str(), va); + va_end(va); + wstringEx ws; + ws.fromUTF8(tmp); + delete[] tmp; + return ws; +} + +string vectorToString(const safe_vector &vect, string sep) +{ + string s; + for (u32 i = 0; i < vect.size(); ++i) + { + if (i > 0) + s.append(sep); + s.append(vect[i]); + } + return s; +} + +wstringEx vectorToString(const safe_vector &vect, char sep) +{ + wstringEx s; + for (u32 i = 0; i < vect.size(); ++i) + { + if (i > 0) + s.push_back(sep); + s.append(vect[i]); + } + return s; +} + +safe_vector stringToVector(const string &text, char sep) +{ + safe_vector v; + if (text.empty()) return v; + u32 count = 1; + for (u32 i = 0; i < text.size(); ++i) + if (text[i] == sep) + ++count; + v.reserve(count); + string::size_type off = 0; + string::size_type i = 0; + do + { + i = text.find_first_of(sep, off); + if (i != string::npos) + { + string ws(text.substr(off, i - off)); + v.push_back(ws); + off = i + 1; + } + else + v.push_back(text.substr(off)); + } while (i != string::npos); + return v; +} + +safe_vector stringToVector(const wstringEx &text, char sep) +{ + safe_vector v; + if (text.empty()) return v; + u32 count = 1; + for (u32 i = 0; i < text.size(); ++i) + if (text[i] == sep) + ++count; + v.reserve(count); + wstringEx::size_type off = 0; + wstringEx::size_type i = 0; + do + { + i = text.find_first_of(sep, off); + if (i != wstringEx::npos) + { + wstringEx ws(text.substr(off, i - off)); + v.push_back(ws); + off = i + 1; + } + else + v.push_back(text.substr(off)); + } while (i != wstringEx::npos); + return v; +} + +bool SFont::fromBuffer(const SmartBuf &buffer, u32 bufferSize, u32 size, u32 lspacing, u32 w, u32 idx, const char *) +{ + if (!buffer || !font) return false; + + size = min(max(6u, size), 1000u); + lineSpacing = min(max(6u, lspacing), 1000u); + weight = min(w, 32u); + index = idx; + + SMART_FREE(data); + data = smartMem2Alloc(bufferSize); + if(!data) return false; + + memcpy(data.get(), buffer.get(), bufferSize); + dataSize = bufferSize; + + font->loadFont(data.get(), dataSize, size, weight, index, false); + + return true; +} + +bool SFont::fromFile(const char *filename, u32 size, u32 lspacing, u32 w, u32 idx) +{ + if (!font) return false; + size = min(max(6u, size), 1000u); + weight = min(w, 32u); + index = idx = 0; + + lineSpacing = min(max(6u, lspacing), 1000u); + + FILE *file = fopen(filename, "rb"); + if (file == NULL) return false; + fseek(file, 0, SEEK_END); + u32 fileSize = ftell(file); + fseek(file, 0, SEEK_SET); + if (fileSize == 0) return false; + + SMART_FREE(data); + data = smartMem2Alloc(fileSize); + if (!data) + { + SAFE_CLOSE(file); + return false; + } + + fread(data.get(), 1, fileSize, file); + + dataSize = fileSize; + + font->loadFont(data.get(), dataSize, size, weight, index, false); + return true; +} + +void CText::setText(SFont font, const wstringEx &t) +{ + CText::SWord w; + m_lines.clear(); + if (!!font.font) m_font = font; + if (!m_font.font) return; + + firstLine = 0; + // Don't care about performance + safe_vector lines = stringToVector(t, L'\n'); + m_lines.reserve(lines.size()); + // + for (u32 k = 0; k < lines.size(); ++k) + { + wstringEx &l = lines[k]; + m_lines.push_back(CText::CLine()); + m_lines.back().reserve(32); + wstringEx::size_type i = l.find_first_not_of(g_whitespaces); + wstringEx::size_type j; + while (i != wstringEx::npos) + { + j = l.find_first_of(g_whitespaces, i); + if (j != wstringEx::npos && j > i) + { + w.text.assign(l, i, j - i); + m_lines.back().push_back(w); + i = l.find_first_not_of(g_whitespaces, j); + } + else if (j == wstringEx::npos) + { + w.text.assign(l, i, l.size() - i); + m_lines.back().push_back(w); + i = wstringEx::npos; + } + } + } +} + +void CText::setText(SFont font, const wstringEx &t, u32 startline) +{ + CText::SWord w; + totalHeight = 0; + + m_lines.clear(); + if (!!font.font) m_font = font; + if (!m_font.font) return; + + firstLine = startline; + // Don't care about performance + safe_vector lines = stringToVector(t, L'\n'); + m_lines.reserve(lines.size()); + // + for (u32 k = 0; k < lines.size(); ++k) + { + wstringEx &l = lines[k]; + m_lines.push_back(CText::CLine()); + m_lines.back().reserve(32); + wstringEx::size_type i = l.find_first_not_of(g_whitespaces); + wstringEx::size_type j; + while (i != wstringEx::npos) + { + j = l.find_first_of(g_whitespaces, i); + if (j != wstringEx::npos && j > i) + { + w.text.assign(l, i, j - i); + m_lines.back().push_back(w); + i = l.find_first_not_of(g_whitespaces, j); + } + else if (j == wstringEx::npos) + { + w.text.assign(l, i, l.size() - i); + m_lines.back().push_back(w); + i = wstringEx::npos; + } + } + } +} + + +void CText::setFrame(float width, u16 style, bool ignoreNewlines, bool instant) +{ + float shift; + + totalHeight = 0; + + if (!m_font.font) return; + + float space = m_font.font->getWidth(L" "); + float posX = 0.f; + float posY = 0.f; + u32 lineBeg = 0; + + if(firstLine > m_lines.size()) firstLine = 0; + + for (u32 k = firstLine; k < m_lines.size(); ++k) + { + CText::CLine &words = m_lines[k]; + if (words.empty()) + { + posY += (float)m_font.lineSpacing; + continue; + } + + for (u32 i = 0; i < words.size(); ++i) + { + float wordWidth = m_font.font->getWidth(words[i].text.c_str()); + if (posX == 0.f || posX + (float)wordWidth + space * 2 <= width) + { + words[i].targetPos = Vector3D(posX, posY, 0.f); + posX += wordWidth + space; + } + else + { + posY += (float)m_font.lineSpacing; + words[i].targetPos = Vector3D(0.f, posY, 0.f); + if ((style & (FTGX_JUSTIFY_CENTER | FTGX_JUSTIFY_RIGHT)) != 0) + { + posX -= space; + shift = (style & FTGX_JUSTIFY_CENTER) != 0 ? -posX * 0.5f : -posX; + for (u32 j = lineBeg; j < i; ++j) + words[j].targetPos.x += shift; + } + posX = wordWidth + space; + lineBeg = i; + } + } + // Quick patch for newline support + if (!ignoreNewlines && k + 1 < m_lines.size()) + posX = 9999999.f; + } + totalHeight = posY + m_font.lineSpacing; + + if ((style & (FTGX_JUSTIFY_CENTER | FTGX_JUSTIFY_RIGHT)) != 0) + { + posX -= space; + shift = (style & FTGX_JUSTIFY_CENTER) != 0 ? -posX * 0.5f : -posX; + for (u32 k = firstLine; k < m_lines.size(); ++k) + for (u32 j = lineBeg; j < m_lines[k].size(); ++j) + m_lines[k][j].targetPos.x += shift; + } + if ((style & (FTGX_ALIGN_MIDDLE | FTGX_ALIGN_BOTTOM)) != 0) + { + posY += (float)m_font.lineSpacing; + shift = (style & FTGX_ALIGN_MIDDLE) != 0 ? -posY * 0.5f : -posY; + for (u32 k = firstLine; k < m_lines.size(); ++k) + for (u32 j = 0; j < m_lines[k].size(); ++j) + m_lines[k][j].targetPos.y += shift; + } + if (instant) + for (u32 k = firstLine; k < m_lines.size(); ++k) + for (u32 i = 0; i < m_lines[k].size(); ++i) + m_lines[k][i].pos = m_lines[k][i].targetPos; +} + +void CText::setColor(const CColor &c) +{ + m_color = c; +} + +void CText::tick(void) +{ + for (u32 k = 0; k < m_lines.size(); ++k) + for (u32 i = 0; i < m_lines[k].size(); ++i) + m_lines[k][i].pos += (m_lines[k][i].targetPos - m_lines[k][i].pos) * 0.05f; +} + +void CText::draw(void) +{ + if (!m_font.font) return; + + for (u32 k = firstLine; k < m_lines.size(); ++k) + for (u32 i = 0; i < m_lines[k].size(); ++i) + { + m_font.font->setX(m_lines[k][i].pos.x); + m_font.font->setY(m_lines[k][i].pos.y); + m_font.font->drawText(0, m_font.lineSpacing, m_lines[k][i].text.c_str(), m_color); + } +} + +int CText::getTotalHeight(void) +{ + return totalHeight; +} + +string upperCase(string text) +{ + char c; + for (string::size_type i = 0; i < text.size(); ++i) + { + c = text[i]; + if (c >= 'a' && c <= 'z') + text[i] = c & 0xDF; + } + return text; +} + + +string lowerCase(string text) +{ + char c; + for (string::size_type i = 0; i < text.size(); ++i) + { + c = text[i]; + if (c >= 'A' && c <= 'Z') + text[i] = c | 0x20; + } + return text; +} + +// trim from start +string ltrim(string s) +{ + s.erase(s.begin(), find_if(s.begin(), s.end(), not1(ptr_fun(isspace)))); + return s; +} + +// trim from end +string rtrim(string s) +{ + s.erase(find_if(s.rbegin(), s.rend(), not1(ptr_fun(isspace))).base(), s.end()); + return s; +} + +void Asciify( wchar_t *str ) +{ + const wchar_t *ptr = str; + wchar_t *ctr = str; + + while(*ptr != '\0') + { + switch(*ptr) + { + case 0x14c: + *ctr = 0x4f; + break; + } + *ctr = *ptr; + ++ptr; + ++ctr; + } + *ctr = '\0'; +} diff --git a/source/gui/text.hpp b/source/gui/text.hpp new file mode 100644 index 00000000..a3a2b5d4 --- /dev/null +++ b/source/gui/text.hpp @@ -0,0 +1,71 @@ + +#ifndef __TEXT_HPP +#define __TEXT_HPP + +#include "safe_vector.hpp" +#include + +#include "wstringEx.hpp" +#include "FreeTypeGX.h" +#include "video.hpp" + +#include "smartptr.hpp" + +struct SFont +{ + SmartBuf data; + size_t dataSize; + SmartPtr font; + u32 lineSpacing; + u32 weight; + u32 index; +public: + bool fromBuffer(const SmartBuf &buffer, u32 bufferSize, u32 size, u32 lspacing, u32 w = 0, u32 idx = 0, const char *genKey = NULL); + bool fromFile(const char *filename, u32 size, u32 lspacing, u32 w = 0, u32 idx = 0); + SFont(void) : data(SmartBuf(NULL, SmartBuf::SRCALL_MEM2)), dataSize(0), font(SmartPtr(new FreeTypeGX)), lineSpacing(0), weight(0), index(0) { } + ~SFont(void) { } +}; + +class CText +{ +public: + void setText(SFont font, const wstringEx &t); + void setText(SFont font, const wstringEx &t, u32 startline); + void setColor(const CColor &c); + void setFrame(float width, u16 style, bool ignoreNewlines = false, bool instant = false); + void tick(void); + void draw(void); + int getTotalHeight(); +private: + + struct SWord + { + wstringEx text; + Vector3D pos; + Vector3D targetPos; + }; +private: + typedef safe_vector CLine; + safe_vector m_lines; + SFont m_font; + CColor m_color; + u32 firstLine; + u32 totalHeight; +}; + +// Nothing to do with CText. Q&D helpers for string formating. +const char *fmt(const char *format, ...); +std::string sfmt(const char *format, ...); +wstringEx wfmt(const wstringEx &format, ...); +bool checkFmt(const wstringEx &ref, const wstringEx &format); +std::string vectorToString(const safe_vector &vect, std::string sep); +wstringEx vectorToString(const safe_vector &vect, char sep); +safe_vector stringToVector(const wstringEx &text, char sep); +safe_vector stringToVector(const std::string &text, char sep); +std::string upperCase(std::string text); +std::string lowerCase(std::string text); +std::string ltrim(std::string s); +std::string rtrim(std::string s); +void Asciify( wchar_t *str ); + +#endif // !defined(__TEXT_HPP) diff --git a/source/gui/texture.cpp b/source/gui/texture.cpp new file mode 100644 index 00000000..d8e7db91 --- /dev/null +++ b/source/gui/texture.cpp @@ -0,0 +1,538 @@ +#include +#include +#include + +#include "texture.hpp" +#include "pngu.h" + +using namespace std; + +static u32 upperPower(u32 width) +{ + u32 i = 8; + u32 maxWidth = 1024; + while (i < width && i < maxWidth) + i <<= 1; + return i; +} + +u32 fixGX_GetTexBufferSize(u16 wd, u16 ht, u32 fmt, u8 mipmap, u8 maxlod) +{ + if (mipmap) return GX_GetTexBufferSize(wd, ht, fmt, mipmap, maxlod + 1); + return GX_GetTexBufferSize(wd, ht, fmt, mipmap, maxlod); +} + +static inline u32 coordsRGBA8(u32 x, u32 y, u32 w) +{ + return ((((y >> 2) * (w >> 2) + (x >> 2)) << 5) + ((y & 3) << 2) + (x & 3)) << 1; +} + +static inline u32 coordsRGB565(u32 x, u32 y, u32 w) +{ + return (((y >> 2) * (w >> 2) + (x >> 2)) << 4) + ((y & 3) << 2) + (x & 3); +} + +void STexture::_convertToFlippedRGBA8(u8 *dst, const u8 * src, u32 width, u32 height) +{ + u32 block, i, c, ar, gb; + + for (block = 0; block < height; block += 4) + { + for (i = 0; i < width; i += 4) + { + /* Alpha and Red */ + for (c = 0; c < 4; ++c) + { + for (ar = 0; ar < 4; ++ar) + { + u32 y = height - 1 - (c + block); + u32 x = ar + i; + u32 offset = ((((y >> 2) * (width >> 2) + (x >> 2)) << 5) + ((y & 3) << 2) + (x & 3)) << 1; + /* Alpha pixels */ + dst[offset] = 255; + /* Red pixels */ + dst[offset+1] = src[((i + ar) + ((block + c) * width)) * 3]; + } + } + + /* Green and Blue */ + for (c = 0; c < 4; ++c) + { + for (gb = 0; gb < 4; ++gb) + { + u32 y = height - 1 - (c + block); + u32 x = gb + i; + u32 offset = ((((y >> 2) * (width >> 2) + (x >> 2)) << 5) + ((y & 3) << 2) + (x & 3)) << 1; + /* Green pixels */ + dst[offset+32] = src[(((i + gb) + ((block + c) * width)) * 3) + 1]; + /* Blue pixels */ + dst[offset+33] = src[(((i + gb) + ((block + c) * width)) * 3) + 2]; + } + } + } + } +} + +void STexture::_convertToRGBA8(u8 *dst, const u8 *src, u32 width, u32 height) +{ + for (u32 y = 0; y < height; ++y) + for (u32 x = 0; x < width; ++x) + { + u32 i = (x + y * width) * 4; + dst[coordsRGBA8(x, y, width) + 1] = src[i]; + dst[coordsRGBA8(x, y, width) + 32] = src[i + 1]; + dst[coordsRGBA8(x, y, width) + 33] = src[i + 2]; + dst[coordsRGBA8(x, y, width)] = src[i + 3]; + } +} + +void STexture::_convertToRGB565(u8 *dst, const u8 *src, u32 width, u32 height) +{ + u16 *dst16 = (u16 *)dst; + + for (u32 y = 0; y < height; ++y) + for (u32 x = 0; x < width; ++x) + { + u32 i = (x + y * width) * 4; + dst16[coordsRGB565(x, y, width)] = ((src[i] & 0xF8) << 8) | ((src[i + 1] & 0xFC) << 3) | (src[i + 2] >> 3); + } +} + +static inline u16 rgb8ToRGB565(u8 *color) +{ + return ((color[0] >> 3) << 11) | ((color[1] >> 2) << 5) | (color[2] >> 3); +} + +static int colorDistance(const u8 *c0, const u8 *c1) +{ + return (c1[0] - c0[0]) * (c1[0] - c0[0]) + (c1[1] - c0[1]) * (c1[1] - c0[1]) + (c1[2] - c0[2]) * (c1[2] - c0[2]); +} + +static void getBaseColors(u8 *color0, u8 *color1, const u8 *srcBlock) +{ + int maxDistance = -1; + for (int i = 0; i < 15; ++i) + for (int j = i + 1; j < 16; ++j) + { + int distance = colorDistance(srcBlock + i * 4, srcBlock + j * 4); + if (distance > maxDistance) + { + maxDistance = distance; + *(u32 *)color0 = ((u32 *)srcBlock)[i]; + *(u32 *)color1 = ((u32 *)srcBlock)[j]; + } + } + if (rgb8ToRGB565(color0) < rgb8ToRGB565(color1)) + { + u32 tmp; + tmp = *(u32 *)color0; + *(u32 *)color0 = *(u32 *)color1; + *(u32 *)color1 = tmp; + } +} + +static u32 colorIndices(const u8 *color0, const u8 *color1, const u8 *srcBlock) +{ + u16 colors[4][4]; + u32 res = 0; + + // Make the 4 colors available in the block + colors[0][0] = (color0[0] & 0xF8) | (color0[0] >> 5); + colors[0][1] = (color0[1] & 0xFC) | (color0[1] >> 6); + colors[0][2] = (color0[2] & 0xF8) | (color0[2] >> 5); + colors[1][0] = (color1[0] & 0xF8) | (color1[0] >> 5); + colors[1][1] = (color1[1] & 0xFC) | (color1[1] >> 6); + colors[1][2] = (color1[2] & 0xF8) | (color1[2] >> 5); + colors[2][0] = (2 * colors[0][0] + 1 * colors[1][0]) / 3; + colors[2][1] = (2 * colors[0][1] + 1 * colors[1][1]) / 3; + colors[2][2] = (2 * colors[0][2] + 1 * colors[1][2]) / 3; + colors[3][0] = (1 * colors[0][0] + 2 * colors[1][0]) / 3; + colors[3][1] = (1 * colors[0][1] + 2 * colors[1][1]) / 3; + colors[3][2] = (1 * colors[0][2] + 2 * colors[1][2]) / 3; + for (int i = 15; i >= 0; --i) + { + int c0 = srcBlock[i * 4 + 0]; + int c1 = srcBlock[i * 4 + 1]; + int c2 = srcBlock[i * 4 + 2]; + int d0 = abs(colors[0][0] - c0) + abs(colors[0][1] - c1) + abs(colors[0][2] - c2); + int d1 = abs(colors[1][0] - c0) + abs(colors[1][1] - c1) + abs(colors[1][2] - c2); + int d2 = abs(colors[2][0] - c0) + abs(colors[2][1] - c1) + abs(colors[2][2] - c2); + int d3 = abs(colors[3][0] - c0) + abs(colors[3][1] - c1) + abs(colors[3][2] - c2); + int b0 = d0 > d3; + int b1 = d1 > d2; + int b2 = d0 > d2; + int b3 = d1 > d3; + int b4 = d2 > d3; + int x0 = b1 & b2; + int x1 = b0 & b3; + int x2 = b0 & b4; + res |= (x2 | ((x0 | x1) << 1)) << ((15 - i) << 1); + } + return res; +} + +void STexture::_convertToCMPR(u8 *dst, const u8 *src, u32 width, u32 height) +{ + u8 srcBlock[16 * 4]; + u8 color0[4]; + u8 color1[4]; + + for (u32 jj = 0; jj < height; jj += 8) + for (u32 ii = 0; ii < width; ii += 8) + for (u32 k = 0; k < 4; ++k) + { + int i = ii + ((k & 1) << 2); + int j = jj + ((k >> 1) << 2); + memcpy(srcBlock, src + (j * width + i) * 4, 16); + memcpy(srcBlock + 4 * 4, src + ((j + 1) * width + i) * 4, 16); + memcpy(srcBlock + 8 * 4, src + ((j + 2) * width + i) * 4, 16); + memcpy(srcBlock + 12 * 4, src + ((j + 3) * width + i) * 4, 16); + getBaseColors(color0, color1, srcBlock); + *(u16 *)dst = rgb8ToRGB565(color0); + dst += 2; + *(u16 *)dst = rgb8ToRGB565(color1); + dst += 2; + *(u32 *)dst = colorIndices(color0, color1, srcBlock); + dst += 4; + } +} + +STexture::TexErr STexture::fromPNGFile(const char *filename, u8 f, Alloc alloc, u32 minMipSize, u32 maxMipSize) +{ + SmartBuf ptrPng; + + FILE *file = fopen(filename, "rb"); + if (file == 0) return STexture::TE_ERROR; + fseek(file, 0, SEEK_END); + u32 fileSize = ftell(file); + fseek(file, 0, SEEK_SET); + if (fileSize > 0) + { + ptrPng = smartMem2Alloc(fileSize); + if (!!ptrPng) + if (fread(ptrPng.get(), 1, fileSize, file) != fileSize) + SMART_FREE(ptrPng); + } + SAFE_CLOSE(file); + return !!ptrPng ? fromPNG(ptrPng.get(), f, alloc, minMipSize, maxMipSize) : STexture::TE_NOMEM; +} + +STexture::TexErr STexture::fromRAW(const u8 *buffer, u32 w, u32 h, u8 f, Alloc alloc) +{ + SmartBuf tmpData; + + switch (f) + { + case GX_TF_RGBA8: + case GX_TF_RGB565: + case GX_TF_CMPR: + break; + default: + f = GX_TF_RGBA8; + } + + switch (alloc) + { + case ALLOC_MEM2: + tmpData = smartMem2Alloc(GX_GetTexBufferSize(w, h, f, GX_FALSE, 0)); + break; + case ALLOC_MALLOC: + tmpData = smartMemAlign32(GX_GetTexBufferSize(w, h, f, GX_FALSE, 0)); + break; + } + if (!tmpData) return STexture::TE_NOMEM; + + format = f; + width = w; + height = h; + maxLOD = 0; + data = tmpData; + switch (f) + { + case GX_TF_RGBA8: + STexture::_convertToFlippedRGBA8(tmpData.get(), buffer, width, height); + break; + case GX_TF_RGB565: + STexture::_convertToRGB565(tmpData.get(), buffer, width, height); + break; + case GX_TF_CMPR: + STexture::_convertToCMPR(tmpData.get(), buffer, width, height); + break; + } + DCFlushRange(data.get(), GX_GetTexBufferSize(width, height, format, GX_FALSE, 0)); + + return STexture::TE_OK; +} + +STexture::TexErr STexture::fromPNG(const u8 *buffer, u8 f, Alloc alloc, u32 minMipSize, u32 maxMipSize) +{ + PNGUPROP imgProp; + SmartBuf tmpData; + u8 maxLODTmp = 0; + u8 minLODTmp = 0; + u32 baseWidth; + u32 baseHeight; + + IMGCTX ctx = PNGU_SelectImageFromBuffer(buffer); + if (ctx == 0) return STexture::TE_ERROR; + if (PNGU_GetImageProperties(ctx, &imgProp) != PNGU_OK) + { + PNGU_ReleaseImageContext(ctx); + return STexture::TE_ERROR; + } + if (imgProp.imgWidth > 1024 || imgProp.imgHeight > 1024) + { + PNGU_ReleaseImageContext(ctx); + return STexture::TE_ERROR; + } + switch (f) + { + case GX_TF_RGBA8: + case GX_TF_RGB565: + case GX_TF_CMPR: + break; + default: + f = (imgProp.imgColorType == PNGU_COLOR_TYPE_GRAY_ALPHA || imgProp.imgColorType == PNGU_COLOR_TYPE_RGB_ALPHA) ? GX_TF_RGBA8 : GX_TF_RGB565; + } + u32 pngWidth = imgProp.imgWidth & (f == GX_TF_CMPR ? ~7u : ~3u); + u32 pngHeight = imgProp.imgHeight & (f == GX_TF_CMPR ? ~7u : ~3u); + if (minMipSize > 0 || maxMipSize > 0) + STexture::_calcMipMaps(maxLODTmp, minLODTmp, baseWidth, baseHeight, imgProp.imgWidth, imgProp.imgHeight, minMipSize, maxMipSize); + if (maxLODTmp > 0) + { + u32 newWidth = baseWidth; + u32 newHeight = baseHeight; + for (int i = 0; i < minLODTmp; ++i) + { + newWidth >>= 1; + newHeight >>= 1; + } + SmartBuf tmpData2 = smartMem2Alloc(imgProp.imgWidth * imgProp.imgHeight * 4); + switch (alloc) + { + case ALLOC_MEM2: + tmpData = smartMem2Alloc(fixGX_GetTexBufferSize(newWidth, newHeight, f, GX_TRUE, maxLODTmp - minLODTmp)); + break; + case ALLOC_MALLOC: + tmpData = smartMemAlign32(fixGX_GetTexBufferSize(newWidth, newHeight, f, GX_TRUE, maxLODTmp - minLODTmp)); + break; + } + if (!tmpData || !tmpData2) + { + SMART_FREE(tmpData); + SMART_FREE(tmpData2); + PNGU_ReleaseImageContext(ctx); + return STexture::TE_NOMEM; + } + PNGU_DecodeToRGBA8(ctx, imgProp.imgWidth, imgProp.imgHeight, tmpData2.get(), 0, 0xFF); + PNGU_ReleaseImageContext(ctx); + DCFlushRange(tmpData2.get(), imgProp.imgWidth * imgProp.imgHeight * 4); + + tmpData2 = STexture::_genMipMaps(tmpData2.get(), imgProp.imgWidth, imgProp.imgHeight, maxLODTmp, baseWidth, baseHeight); + if (!tmpData2) return STexture::TE_NOMEM; + + u32 nWidth = newWidth; + u32 nHeight = newHeight; + u8 *pSrc = tmpData2.get(); + if (minLODTmp > 0) + pSrc += fixGX_GetTexBufferSize(baseWidth, baseHeight, GX_TF_RGBA8, minLODTmp > 1 ? GX_TRUE : GX_FALSE, minLODTmp - 1); + u8 *pDst = tmpData.get(); + for (u8 i = minLODTmp; i <= maxLODTmp; ++i) + { + switch (f) + { + case GX_TF_RGBA8: + STexture::_convertToRGBA8(pDst, pSrc, nWidth, nHeight); + break; + case GX_TF_RGB565: + STexture::_convertToRGB565(pDst, pSrc, nWidth, nHeight); + break; + case GX_TF_CMPR: + STexture::_convertToCMPR(pDst, pSrc, nWidth, nHeight); + break; + } + pSrc += nWidth * nHeight * 4; + pDst += GX_GetTexBufferSize(nWidth, nHeight, f, GX_FALSE, 0); + nWidth >>= 1; + nHeight >>= 1; + } + maxLOD = maxLODTmp - minLODTmp; + data = tmpData; + format = f; + width = newWidth; + height = newHeight; + DCFlushRange(data.get(), fixGX_GetTexBufferSize(width, height, format, maxLOD > 0 ? GX_TRUE : GX_FALSE, maxLOD)); + } + else + { + switch (alloc) + { + case ALLOC_MEM2: + tmpData = smartMem2Alloc(GX_GetTexBufferSize(pngWidth, pngHeight, f, GX_FALSE, maxLOD)); + break; + case ALLOC_MALLOC: + tmpData = smartMemAlign32(GX_GetTexBufferSize(pngWidth, pngHeight, f, GX_FALSE, maxLOD)); + break; + } + if (!tmpData) + { + PNGU_ReleaseImageContext(ctx); + return STexture::TE_NOMEM; + } + format = f; + width = pngWidth; + height = pngHeight; + maxLOD = 0; + data = tmpData; + switch (f) + { + case GX_TF_RGBA8: + PNGU_DecodeTo4x4RGBA8(ctx, imgProp.imgWidth, imgProp.imgHeight, data.get(), 0xFF); + break; + case GX_TF_RGB565: + PNGU_DecodeTo4x4RGB565(ctx, imgProp.imgWidth, imgProp.imgHeight, data.get()); + break; + case GX_TF_CMPR: + PNGU_DecodeToCMPR(ctx, imgProp.imgWidth, imgProp.imgHeight, data.get()); + break; + } + PNGU_ReleaseImageContext(ctx); + DCFlushRange(data.get(), GX_GetTexBufferSize(width, height, format, GX_FALSE, 0)); + } + return STexture::TE_OK; +} + +void STexture::_resize(u8 *dst, u32 dstWidth, u32 dstHeight, const u8 *src, u32 srcWidth, u32 srcHeight) +{ + float wc = (float)srcWidth / (float)dstWidth; + float hc = (float)srcHeight / (float)dstHeight; + float ax1; + float ay1; + + for (u32 y = 0; y < dstHeight; ++y) + { + for (u32 x = 0; x < dstWidth; ++x) + { + float xf = ((float)x + 0.5f) * wc - 0.5f; + float yf = ((float)y + 0.5f) * hc - 0.5f; + u32 x0 = (int)xf; + u32 y0 = (int)yf; + if (x0 >= srcWidth - 1) + { + x0 = srcWidth - 2; + ax1 = 1.f; + } + else + ax1 = xf - (float)x0; + float ax0 = 1.f - ax1; + if (y0 >= srcHeight - 1) + { + y0 = srcHeight - 2; + ay1 = 1.f; + } + else + ay1 = yf - (float)y0; + float ay0 = 1.f - ay1; + u8 *pdst = dst + (x + y * dstWidth) * 4; + const u8 *psrc0 = src + (x0 + y0 * srcWidth) * 4; + const u8 *psrc1 = psrc0 + srcWidth * 4; + for (int c = 0; c < 3; ++c) + pdst[c] = (u8)((((float)psrc0[c] * ax0) + ((float)psrc0[4 + c] * ax1)) * ay0 + (((float)psrc1[c] * ax0) + ((float)psrc1[4 + c] * ax1)) * ay1 + 0.5f); + pdst[3] = 0xFF; // Alpha not handled, it would require using it in the weights for color channels, easy but slower and useless so far. + } + } +} + +// For powers of two +void STexture::_resizeD2x2(u8 *dst, const u8 *src, u32 srcWidth, u32 srcHeight) +{ +#if 0 + u32 *dst32 = (u32 *)dst; + const u32 *src32 = (const u32 *)src; + u32 i = 0, i0 = 0, i1 = 1, i2 = srcWidth, i3 = srcWidth + 1, dstWidth = srcWidth >> 1, dstHeight = srcHeight >> 1; + + for (u32 y = 0; y < dstHeight; ++y) + { + for (u32 x = 0; x < dstWidth; ++x) + { + dst32[i] = (((src32[i0] & 0xFCFCFCFC) >> 2) + + ((src32[i1] & 0xFCFCFCFC) >> 2) + + ((src32[i2] & 0xFCFCFCFC) >> 2) + + ((src32[i3] & 0xFCFCFCFC) >> 2)) | 0x000000FF; + ++i; + i0 += 2; + i1 += 2; + i2 += 2; + i3 += 2; + } + i0 += srcWidth; + i1 += srcWidth; + i2 += srcWidth; + i3 += srcWidth; + } +#else + u32 i = 0, i0 = 0, i1 = 4, i2 = srcWidth * 4, i3 = (srcWidth + 1) * 4, dstWidth = srcWidth >> 1, dstHeight = srcHeight >> 1, w4 = srcWidth * 4; + + for (u32 y = 0; y < dstHeight; ++y) + { + for (u32 x = 0; x < dstWidth; ++x) + { + dst[i] = ((u32)src[i0] + src[i1] + src[i2] + src[i3]) >> 2; + dst[i + 1] = ((u32)src[i0 + 1] + src[i1 + 1] + src[i2 + 1] + src[i3 + 1]) >> 2; + dst[i + 2] = ((u32)src[i0 + 2] + src[i1 + 2] + src[i2 + 2] + src[i3 + 2]) >> 2; + dst[i + 3] = ((u32)src[i0 + 3] + src[i1 + 3] + src[i2 + 3] + src[i3 + 3]) >> 2; + i += 4; + i0 += 8; + i1 += 8; + i2 += 8; + i3 += 8; + } + i0 += w4; + i1 += w4; + i2 += w4; + i3 += w4; + } +#endif +} + +void STexture::_calcMipMaps(u8 &maxLOD, u8 &minLOD, u32 &lod0Width, u32 &lod0Height, u32 width, u32 height, u32 minSize, u32 maxSize) +{ + if (minSize < 8) minSize = 8; + lod0Width = upperPower(width); + lod0Height = upperPower(height); + if (width - (lod0Width >> 1) < lod0Width >> 3 && minSize <= lod0Width >> 1) + lod0Width >>= 1; + if (height - (lod0Height >> 1) < lod0Height >> 3 && minSize <= lod0Height >> 1) + lod0Height >>= 1; + maxLOD = 0; + for (u32 i = min(lod0Width, lod0Height); i > minSize; i >>= 1) + ++maxLOD; + minLOD = 0; + if (maxSize > 8) + for (u32 i = max(lod0Width, lod0Height); i > maxSize; i >>= 1) + ++minLOD; + if (minLOD > maxLOD) + maxLOD = minLOD; +} + +SmartBuf STexture::_genMipMaps(const u8 *src, u32 width, u32 height, u8 maxLOD, u32 lod0Width, u32 lod0Height) +{ + u32 bufSize = fixGX_GetTexBufferSize(lod0Width, lod0Height, GX_TF_RGBA8, GX_TRUE, maxLOD); + SmartBuf dst = smartMem2Alloc(bufSize); + if (!dst) return dst; + STexture::_resize(dst.get(), lod0Width, lod0Height, src, width, height); + DCFlushRange(dst.get(), lod0Width * lod0Height * 4); + u32 nWidth = lod0Width; + u32 nHeight = lod0Height; + u8 *pDst = dst.get(); + for (u8 i = 0; i < maxLOD; ++i) + { + u8 *pSrc = pDst; + pDst += nWidth * nHeight * 4; + STexture::_resizeD2x2(pDst, pSrc, nWidth, nHeight); + DCFlushRange(pDst, nWidth * nWidth); + nWidth >>= 1; + nHeight >>= 1; + } + return dst; +} diff --git a/source/gui/texture.hpp b/source/gui/texture.hpp new file mode 100644 index 00000000..8ad87c25 --- /dev/null +++ b/source/gui/texture.hpp @@ -0,0 +1,36 @@ + +#ifndef __TEXTURE_HPP +#define __TEXTURE_HPP + +#include + +#include "smartptr.hpp" + +struct STexture +{ + SmartBuf data; + u32 width; + u32 height; + u8 format; + u8 maxLOD; + STexture(void) : data(), width(0), height(0), format(-1), maxLOD(0) { } + // Utility funcs + enum TexErr { TE_OK, TE_ERROR, TE_NOMEM }; + // This function doesn't use MEM2 if the PNG is loaded from memory and there's no mip mapping + TexErr fromPNG(const u8 *buffer, u8 f = -1, Alloc alloc = ALLOC_MEM2, u32 minMipSize = 0, u32 maxMipSize = 0); + TexErr fromPNGFile(const char *filename, u8 f = -1, Alloc alloc = ALLOC_MEM2, u32 minMipSize = 0, u32 maxMipSize = 0); + TexErr fromRAW(const u8 *buffer, u32 w, u32 h, u8 f = -1, Alloc alloc = ALLOC_MEM2); +private: + static void _resize(u8 *dst, u32 dstWidth, u32 dstHeight, const u8 *src, u32 srcWidth, u32 srcHeight); + static void _resizeD2x2(u8 *dst, const u8 *src, u32 srcWidth, u32 srcHeight); + static SmartBuf _genMipMaps(const u8 *src, u32 width, u32 height, u8 maxLOD, u32 lod0Width, u32 lod0Height); + static void _calcMipMaps(u8 &maxLOD, u8 &minLOD, u32 &lod0Width, u32 &lod0Height, u32 width, u32 height, u32 minSize, u32 maxSize); + static void _convertToRGBA8(u8 *dst, const u8 *src, u32 width, u32 height); + static void _convertToFlippedRGBA8(u8 *dst, const u8 *src, u32 width, u32 height); + static void _convertToRGB565(u8 *dst, const u8 *src, u32 width, u32 height); + static void _convertToCMPR(u8 *dst, const u8 *src, u32 width, u32 height); +}; + +u32 fixGX_GetTexBufferSize(u16 wd, u16 ht, u32 fmt, u8 mipmap, u8 maxlod); + +#endif //!defined(__TEXTURE_HPP) diff --git a/source/gui/vector.hpp b/source/gui/vector.hpp new file mode 100644 index 00000000..9de228af --- /dev/null +++ b/source/gui/vector.hpp @@ -0,0 +1,168 @@ + +#ifndef __VECTOR_HPP +#define __VECTOR_HPP + +#include +#include + +class Vector3D : public guVector +{ +public: + Vector3D(void) + { + x = 0.f; + y = 0.f; + z = 0.f; + } + + Vector3D(const guVector &v) + { + x = v.x; + y = v.y; + z = v.z; + } + + Vector3D(float px, float py, float pz) + { + x = px; + y = py; + z = pz; + } + + Vector3D(float px, float py) + { + x = px; + y = py; + z = 0.f; + } + + float sqNorm(void) const + { + return x * x + y * y + z * z; + } + + float norm(void) const + { + return sqrt(sqNorm()); + } + + Vector3D operator-(const Vector3D &v) const + { + return Vector3D(x - v.x, y - v.y, z - v.z); + } + + Vector3D operator+(const Vector3D &v) const + { + return Vector3D(x + v.x, y + v.y, z + v.z); + } + + bool operator!=(const Vector3D &v) const + { + return fabs(x - v.x) > 0.f || fabs(y - v.y) > 0.f || fabs(z - v.z) > 0.f; + } + + bool operator==(const Vector3D &v) const + { + return fabs(x - v.x) == 0.f && fabs(y - v.y) == 0.f && fabs(z - v.z) == 0.f; + } + + Vector3D &operator-=(const Vector3D &v) + { + x -= v.x; + y -= v.y; + z -= v.z; + return *this; + } + + Vector3D &operator+=(const Vector3D &v) + { + x += v.x; + y += v.y; + z += v.z; + return *this; + } + + Vector3D &operator*=(const Vector3D &v) + { + x *= v.x; + y *= v.y; + z *= v.z; + return *this; + } + + Vector3D operator/(float f) const + { + return f == 0.f ? *this : Vector3D(x / f, y / f, z / f); + } + + Vector3D operator*(const Vector3D &v) const + { + return Vector3D(x * v.x, y * v.y, z * v.z); + } + + Vector3D operator*(float f) const + { + return Vector3D(x * f, y * f, z * f); + } + + Vector3D unit(void) const + { + return operator/(norm()); + } + + Vector3D operator-(void) const + { + return Vector3D(-x, -y, -z); + } + + Vector3D rotateX(float angle) const + { + angle *= 0.01745329251994329577; + float c = cos(angle); + float s = sin(angle); + return Vector3D(x, y * c - z * s, z * c + y * s); + } + + Vector3D rotateY(float angle) const + { + angle *= 0.01745329251994329577; + float c = cos(angle); + float s = sin(angle); + return Vector3D(x * c + z * s, y, z * c - x * s); + } + + Vector3D rotateZ(float angle) const + { + angle *= 0.01745329251994329577; + float c = cos(angle); + float s = sin(angle); + return Vector3D(x * c - y * s, y * c + x * s, z); + } + + Vector3D rotateX(float c, float s) const + { + return Vector3D(x, y * c - z * s, z * c + y * s); + } + + Vector3D rotateY(float c, float s) const + { + return Vector3D(x * c + z * s, y, z * c - x * s); + } + + Vector3D rotateZ(float c, float s) const + { + return Vector3D(x * c - y * s, y * c + x * s, z); + } + + float dot(const Vector3D &v) const + { + return x * v.x + y * v.y + z * v.z; + } + + Vector3D cross(const Vector3D &v) const + { + return Vector3D(y * v.z - z * v.y, z * v.x - x * v.z, x * v.y - y * v.x); + } +}; + +#endif // !defined(__VECTOR_HPP) diff --git a/source/gui/video.cpp b/source/gui/video.cpp new file mode 100644 index 00000000..f683f480 --- /dev/null +++ b/source/gui/video.cpp @@ -0,0 +1,650 @@ +#include "pngu.h" +#include "video.hpp" +#include +#include +#include "gecko.h" + +#define DEFAULT_FIFO_SIZE (256 * 1024) + +using namespace std; + +extern const u8 wait_01_png[]; +extern const u8 wait_02_png[]; +extern const u8 wait_03_png[]; +extern const u8 wait_04_png[]; +extern const u8 wait_05_png[]; +extern const u8 wait_06_png[]; +extern const u8 wait_07_png[]; +extern const u8 wait_08_png[]; +extern const u8 wait_09_png[]; +extern const u8 wait_10_png[]; + +const float CVideo::_jitter2[2][2] = { + { 0.246490f, 0.249999f }, + { -0.246490f, -0.249999f } +}; + +const float CVideo::_jitter3[3][2] = { + { -0.373411f, -0.250550f }, + { 0.256263f, 0.368119f }, + { 0.117148f, -0.117570f } +}; + +const float CVideo::_jitter4[4][2] = { + { -0.208147f, 0.353730f }, + { 0.203849f, -0.353780f }, + { -0.292626f, -0.149945f }, + { 0.296924f, 0.149994f } +}; + +const float CVideo::_jitter5[5][2] = { + { 0.5f, 0.5f }, + { 0.3f, 0.1f }, + { 0.7f, 0.9f }, + { 0.9f, 0.3f }, + { 0.1f, 0.7f } +}; + +const float CVideo::_jitter6[6][2] = { + { 0.4646464646f, 0.4646464646f }, + { 0.1313131313f, 0.7979797979f }, + { 0.5353535353f, 0.8686868686f }, + { 0.8686868686f, 0.5353535353f }, + { 0.7979797979f, 0.1313131313f }, + { 0.2020202020f, 0.2020202020f } +}; + +const float CVideo::_jitter8[8][2] = { + { -0.334818f, 0.435331f }, + { 0.286438f, -0.393495f }, + { 0.459462f, 0.141540f }, + { -0.414498f, -0.192829f }, + { -0.183790f, 0.082102f }, + { -0.079263f, -0.317383f }, + { 0.102254f, 0.299133f }, + { 0.164216f, -0.054399f } +}; + +const int CVideo::_stencilWidth = 128; +const int CVideo::_stencilHeight = 128; + +static lwp_t waitThread = LWP_THREAD_NULL; +SmartBuf waitThreadStack; + +extern "C" +{ + extern __typeof(malloc) __real_malloc; + extern __typeof(memalign) __real_memalign; +} + +CVideo::CVideo(void) : + m_rmode(NULL), m_frameBuf(), m_curFB(0), m_fifo(NULL), + m_yScale(0.0f), m_xfbHeight(0), m_wide(false), + m_width2D(640), m_height2D(480), m_x2D(0), m_y2D(0), m_aa(0), m_aaAlpha(false), + m_aaWidth(0), m_aaHeight(0), m_showWaitMessage(false), m_showingWaitMessages(false) +{ + memset(m_frameBuf, 0, sizeof m_frameBuf); +} + +CVideo::~CVideo(void) +{ + cleanup(); +} + +void CColor::blend(const CColor &src) +{ + if (src.a == 0) return; + r = (u8)(((int)src.r * (int)src.a + (int)r * (0xFF - (int)src.a)) / 0xFF); + g = (u8)(((int)src.g * (int)src.a + (int)g * (0xFF - (int)src.a)) / 0xFF); + b = (u8)(((int)src.b * (int)src.a + (int)b * (0xFF - (int)src.a)) / 0xFF); +} + +CColor CColor::interpolate(const CColor &c1, const CColor &c2, u8 n) +{ + CColor c; + c.r = (u8)(((int)c2.r * (int)n + (int)c1.r * (0xFF - (int)n)) / 0xFF); + c.g = (u8)(((int)c2.g * (int)n + (int)c1.g * (0xFF - (int)n)) / 0xFF); + c.b = (u8)(((int)c2.b * (int)n + (int)c1.b * (0xFF - (int)n)) / 0xFF); + c.a = (u8)(((int)c2.a * (int)n + (int)c1.a * (0xFF - (int)n)) / 0xFF); + return c; +} + +void CVideo::setAA(u8 aa, bool alpha, int width, int height) +{ + if (aa <= 8 && aa != 7 && width <= m_rmode->fbWidth && height <= m_rmode->efbHeight && ((width | height) & 3) == 0) + { + m_aa = aa; + m_aaAlpha = alpha; + m_aaWidth = width; + m_aaHeight = height; + } +} + +void CVideo::init(void) +{ + VIDEO_Init(); + m_wide = CONF_GetAspectRatio() == CONF_ASPECT_16_9; + m_rmode = VIDEO_GetPreferredMode(NULL); + + u32 type = CONF_GetVideo(); + + m_rmode->viWidth = m_wide ? 700 : 672; + + //CONF_VIDEO_NTSC and CONF_VIDEO_MPAL and m_rmode TVEurgb60Hz480IntDf are the same max height and width. + if (type == CONF_VIDEO_PAL && m_rmode != &TVEurgb60Hz480IntDf) + { + m_rmode->viHeight = VI_MAX_HEIGHT_PAL; + m_rmode->viXOrigin = (VI_MAX_WIDTH_PAL - m_rmode->viWidth) / 2; + m_rmode->viYOrigin = (VI_MAX_HEIGHT_PAL - m_rmode->viHeight) / 2; + } + else + { + m_rmode->viHeight = VI_MAX_HEIGHT_NTSC; + m_rmode->viXOrigin = (VI_MAX_WIDTH_NTSC - m_rmode->viWidth) / 2; + m_rmode->viYOrigin = (VI_MAX_HEIGHT_NTSC - m_rmode->viHeight) / 2; + } + + s8 hoffset = 0; //Use horizontal offset set in wii menu. + if (CONF_GetDisplayOffsetH(&hoffset) == 0) + m_rmode->viXOrigin += hoffset; + + m_frameBuf[0] = MEM_K0_TO_K1(SYS_AllocateFramebuffer(m_rmode)); + m_frameBuf[1] = MEM_K0_TO_K1(SYS_AllocateFramebuffer(m_rmode)); + VIDEO_Configure(m_rmode); + m_curFB = 0; + VIDEO_SetNextFramebuffer(m_frameBuf[m_curFB]); + VIDEO_SetBlack(FALSE); + VIDEO_Flush(); + VIDEO_WaitVSync(); + if (m_rmode->viTVMode & VI_NON_INTERLACE) + VIDEO_WaitVSync(); + m_fifo = __real_memalign(32, DEFAULT_FIFO_SIZE); + memset(m_fifo, 0, DEFAULT_FIFO_SIZE); + GX_Init(m_fifo, DEFAULT_FIFO_SIZE); + GX_SetCopyClear(CColor(0), 0x00FFFFFF); + _setViewPort(0, 0, m_rmode->fbWidth, m_rmode->efbHeight); + m_yScale = GX_GetYScaleFactor(m_rmode->efbHeight, m_rmode->xfbHeight); + m_xfbHeight = GX_SetDispCopyYScale(m_yScale); + GX_SetScissor(0, 0, m_rmode->fbWidth, m_rmode->efbHeight); + GX_SetDispCopySrc(0, 0, m_rmode->fbWidth, m_rmode->efbHeight); + GX_SetDispCopyDst(m_rmode->fbWidth, m_xfbHeight); + GX_SetCopyFilter(m_rmode->aa, m_rmode->sample_pattern, GX_TRUE, m_rmode->vfilter); + GX_SetFieldMode(m_rmode->field_rendering, ((m_rmode->viHeight == 2 * m_rmode->xfbHeight) ? GX_ENABLE : GX_DISABLE)); + GX_SetCullMode(GX_CULL_NONE); + GX_CopyDisp(m_frameBuf[m_curFB], GX_TRUE); + GX_SetDispCopyGamma(GX_GM_1_0); + GX_ClearVtxDesc(); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_CLR0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_CLR0, GX_CLR_RGBA, GX_RGB8, 0); + GX_SetNumTexGens(0); + GX_SetTevOp(GX_TEVSTAGE0, GX_MODULATE); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORDNULL, GX_TEXMAP_NULL, GX_COLOR0A0); + GX_SetNumChans(0); + GX_SetZCompLoc(GX_ENABLE); + setup2DProjection(); + m_stencil = smartMemAlign32(CVideo::_stencilWidth * CVideo::_stencilHeight); + memset(m_stencil.get(), 0, CVideo::_stencilWidth * CVideo::_stencilHeight); +} + +void CVideo::set2DViewport(u32 w, u32 h, int x, int y) +{ + m_width2D = std::min(std::max(512u, w), 800u); + m_height2D = std::min(std::max(384u, h), 600u); + m_x2D = std::min(std::max(-50, x), 50); + m_y2D = std::min(std::max(-50, y), 50); +} + +void CVideo::setup2DProjection(bool setViewPort, bool noScale) +{ + Mtx44 projMtx; + float width2D = noScale ? 640.f : (int)m_width2D; + float height2D = noScale ? 480.f : (int)m_height2D; + float x = noScale ? 0.f : (float)(640 - width2D) * 0.5f + (float)m_x2D; + float y = noScale ? 0.f : (float)(480 - height2D) * 0.5f + (float)m_y2D; + + if (setViewPort) + _setViewPort(0, 0, m_rmode->fbWidth, m_rmode->efbHeight); + guOrtho(projMtx, y, height2D + y, x, width2D + x, 0.f, 1000.0f); + GX_LoadProjectionMtx(projMtx, GX_ORTHOGRAPHIC); +} + +void CVideo::renderToTexture(STexture &tex, bool clear) +{ + if (!tex.data) tex.data = smartMem2Alloc(GX_GetTexBufferSize(tex.width, tex.height, tex.format, GX_FALSE, 0)); + if (!tex.data) return; + GX_DrawDone(); + GX_SetCopyFilter(GX_FALSE, NULL, GX_FALSE, NULL); + GX_SetTexCopySrc(0, 0, tex.width, tex.height); + GX_SetTexCopyDst(tex.width, tex.height, tex.format, GX_FALSE); + GX_CopyTex(tex.data.get(), clear ? GX_TRUE : GX_FALSE); + GX_PixModeSync(); + GX_SetCopyFilter(m_rmode->aa, m_rmode->sample_pattern, GX_TRUE, m_rmode->vfilter); + DCFlushRange(tex.data.get(), GX_GetTexBufferSize(tex.width, tex.height, tex.format, GX_FALSE, 0)); + GX_SetScissor(0, 0, m_rmode->fbWidth, m_rmode->efbHeight); +} + +void CVideo::prepare(void) +{ + GX_SetPixelFmt(GX_PF_RGB8_Z24, GX_ZC_LINEAR); + _setViewPort(0.f, 0.f, (float)m_rmode->fbWidth, (float)m_rmode->efbHeight); + GX_SetScissor(0, 0, m_rmode->fbWidth, m_rmode->efbHeight); + GX_InvVtxCache(); + GX_InvalidateTexAll(); +} + +void CVideo::cleanup(void) +{ + for (u32 i = 0; i < sizeof m_aaBuffer / sizeof m_aaBuffer[0]; ++i) + { + SMART_FREE(m_aaBuffer[i]); + m_aaBufferSize[i] = 0; + } +} + +void CVideo::prepareAAPass(int aaStep) +{ + float x = 0.f; + float y = 0.f; + u32 w = m_aaWidth <= 0 ? m_rmode->fbWidth : (u32)m_aaWidth; + u32 h = m_aaHeight <= 0 ? m_rmode->efbHeight: (u32)m_aaHeight; + switch (m_aa) + { + case 2: + x += CVideo::_jitter2[aaStep][0]; + y += CVideo::_jitter2[aaStep][1]; + break; + case 3: + x += CVideo::_jitter3[aaStep][0]; + y += CVideo::_jitter3[aaStep][1]; + break; + case 4: + x += CVideo::_jitter4[aaStep][0]; + y += CVideo::_jitter4[aaStep][1]; + break; + case 5: + x += CVideo::_jitter5[aaStep][0]; + y += CVideo::_jitter5[aaStep][1]; + break; + case 6: + x += CVideo::_jitter6[aaStep][0]; + y += CVideo::_jitter6[aaStep][1]; + break; + case 8: + x += CVideo::_jitter8[aaStep][0]; + y += CVideo::_jitter8[aaStep][1]; + break; + } + GX_SetPixelFmt(m_aaAlpha ? GX_PF_RGBA6_Z24 : GX_PF_RGB8_Z24, GX_ZC_LINEAR); + _setViewPort(x, y, (float)w, (float)h); + GX_SetScissor(0, 0, w, h); + GX_InvVtxCache(); + GX_InvalidateTexAll(); +} + +void CVideo::renderAAPass(int aaStep) +{ + u8 texFmt = GX_TF_RGBA8; + u32 w = m_aaWidth <= 0 ? m_rmode->fbWidth : (u32)m_aaWidth; + u32 h = m_aaHeight <= 0 ? m_rmode->efbHeight: (u32)m_aaHeight; + u32 bufLen = GX_GetTexBufferSize(w, h, texFmt, GX_FALSE, 0); + + if (!m_aaBuffer[aaStep] || m_aaBufferSize[aaStep] < bufLen) + { + m_aaBuffer[aaStep] = smartMem2Alloc(bufLen); + if (!!m_aaBuffer[aaStep]) + m_aaBufferSize[aaStep] = bufLen; + } + if (!m_aaBuffer[aaStep] || m_aaBufferSize[aaStep] < bufLen) + return; + GX_SetZMode(GX_DISABLE, GX_ALWAYS, GX_TRUE); + GX_DrawDone(); + GX_SetCopyFilter(GX_FALSE, NULL, GX_FALSE, NULL); + GX_SetTexCopySrc(0, 0, w, h); + GX_SetTexCopyDst(w, h, texFmt, GX_FALSE); + GX_CopyTex(m_aaBuffer[aaStep].get(), GX_TRUE); + GX_PixModeSync(); + GX_SetCopyFilter(m_rmode->aa, m_rmode->sample_pattern, GX_TRUE, m_rmode->vfilter); +} + +void CVideo::drawAAScene(bool fs) +{ + GXTexObj texObj[8]; + Mtx modelViewMtx; + u8 texFmt = GX_TF_RGBA8; + u32 tw = m_aaWidth <= 0 ? m_rmode->fbWidth : (u32)m_aaWidth; + u32 th = m_aaHeight <= 0 ? m_rmode->efbHeight: (u32)m_aaHeight; + float w = fs ? 640.f : (float)tw; + float h = fs ? 480.f : (float)th; + float x = 0.f; + float y = 0.f; + int aa; + + if (m_aa <= 0 || m_aa > 8) + return; + // + for (aa = 0; aa < m_aa; ++aa) + if (!m_aaBuffer[aa]) + break; + if (aa == 7) + aa = 6; + // + GX_SetNumChans(0); + for (int i = 0; i < aa; ++i) + { + GX_InitTexObj(&texObj[i], m_aaBuffer[i].get(), tw , th, texFmt, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj[i], GX_TEXMAP0 + i); + } + GX_SetNumTexGens(1); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetTevKColor(GX_KCOLOR0, CColor(0xFF / 1, 0xFF / 5, 0xFF, 0xFF)); // Renders better gradients than 0xFF / aa + GX_SetTevKColor(GX_KCOLOR1, CColor(0xFF / 2, 0xFF / 6, 0xFF, 0xFF)); + GX_SetTevKColor(GX_KCOLOR2, CColor(0xFF / 3, 0xFF / 7, 0xFF, 0xFF)); + GX_SetTevKColor(GX_KCOLOR3, CColor(0xFF / 4, 0xFF / 8, 0xFF, 0xFF)); + for (int i = 0; i < aa; ++i) + { + GX_SetTevKColorSel(GX_TEVSTAGE0 + i, GX_TEV_KCSEL_K0_R + i); + GX_SetTevKAlphaSel(GX_TEVSTAGE0 + i, GX_TEV_KASEL_K0_R + i); + GX_SetTevOrder(GX_TEVSTAGE0 + i, GX_TEXCOORD0, GX_TEXMAP0 + i, GX_COLORNULL); + GX_SetTevColorIn(GX_TEVSTAGE0 + i, i == 0 ? GX_CC_ZERO : GX_CC_CPREV, GX_CC_TEXC, GX_CC_KONST, GX_CC_ZERO); + GX_SetTevAlphaIn(GX_TEVSTAGE0 + i, i == 0 ? GX_CA_ZERO : GX_CA_APREV, GX_CA_TEXA, GX_CA_KONST, GX_CA_ZERO); + GX_SetTevColorOp(GX_TEVSTAGE0 + i, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0 + i, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + } + GX_SetNumTevStages(aa); + // + GX_SetAlphaUpdate(GX_TRUE); + GX_SetCullMode(GX_CULL_NONE); + GX_SetZMode(GX_DISABLE, GX_ALWAYS, GX_FALSE); + GX_SetBlendMode(GX_BM_NONE, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + // + GX_ClearVtxDesc(); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + guMtxIdentity(modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(x, y, 0.f); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(x + w, y, 0.f); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(x + w, y + h, 0.f); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(x, y + h, 0.f); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + GX_SetNumChans(1); + GX_SetNumTexGens(1); + GX_SetNumTevStages(1); +} + +void CVideo::_setViewPort(float x, float y, float w, float h) +{ + m_vpX = x; + m_vpY = y; + m_vpW = w; + m_vpH = h; + GX_SetViewport(x, y, w, h, 0.f, 1.f); +} + +void CVideo::shiftViewPort(float x, float y) +{ + GX_SetViewport(m_vpX + x, m_vpY + y, m_vpW, m_vpH, 0.f, 1.f); +} + +static inline u32 coordsI8(u32 x, u32 y, u32 w) +{ + return (((y >> 2) * (w >> 3) + (x >> 3)) << 5) + ((y & 3) << 3) + (x & 7); +} + +int CVideo::stencilVal(int x, int y) +{ + if ((u32)x >= m_rmode->fbWidth || (u32)y >= m_rmode->efbHeight) + return 0; + x = x * CVideo::_stencilWidth / 640; + y = y * CVideo::_stencilHeight / 480; + u32 i = coordsI8(x, y, (u32)CVideo::_stencilWidth); + if (i >= (u32)(CVideo::_stencilWidth * CVideo::_stencilHeight)) + return 0; + return m_stencil.get()[i]; +} + +void CVideo::prepareStencil(void) +{ + GX_SetPixelFmt(GX_PF_Y8, GX_ZC_LINEAR); + _setViewPort(0.f, 0.f, (float)CVideo::_stencilWidth, (float)CVideo::_stencilHeight); + GX_SetScissor(0, 0, CVideo::_stencilWidth, CVideo::_stencilHeight); + GX_InvVtxCache(); + GX_InvalidateTexAll(); +} + +void CVideo::renderStencil(void) +{ + GX_DrawDone(); + GX_SetZMode(GX_DISABLE, GX_ALWAYS, GX_TRUE); + GX_SetColorUpdate(GX_TRUE); + GX_SetCopyFilter(GX_FALSE, NULL, GX_FALSE, NULL); + GX_SetTexCopySrc(0, 0, CVideo::_stencilWidth, CVideo::_stencilHeight); + GX_SetTexCopyDst(CVideo::_stencilWidth, CVideo::_stencilHeight, GX_CTF_R8, GX_FALSE); + GX_CopyTex(m_stencil.get(), GX_TRUE); + GX_PixModeSync(); + DCFlushRange(m_stencil.get(), CVideo::_stencilWidth * CVideo::_stencilHeight); + GX_SetCopyFilter(m_rmode->aa, m_rmode->sample_pattern, GX_TRUE, m_rmode->vfilter); +} + +void CVideo::render(void) +{ + GX_DrawDone(); + GX_SetZMode(GX_DISABLE, GX_ALWAYS, GX_TRUE); + GX_SetColorUpdate(GX_TRUE); + GX_CopyDisp(MEM_K1_TO_K0(m_frameBuf[m_curFB]), GX_TRUE); + DCFlushRange(m_frameBuf[m_curFB], 2 * m_rmode->fbWidth * m_rmode->xfbHeight); + VIDEO_SetNextFramebuffer(m_frameBuf[m_curFB]); + VIDEO_Flush(); + VIDEO_WaitVSync(); + m_curFB ^= 1; + GX_InvalidateTexAll(); +} + +void CVideo::_showWaitMessages(CVideo *m) +{ + m->m_showingWaitMessages = true; + u32 frames = m->m_waitMessageDelay * 50; + u32 waitFrames = frames; + + u8 fadeStep = 2 * (u32) (255.f / (waitFrames * m->m_waitMessages.size())); + s8 fadeDirection = 1; + s16 currentLightLevel = 0; + + safe_vector::iterator waitItr = m->m_waitMessages.begin(); + + gprintf("Going to show a wait message screen, delay: %d, # images: %d\n", waitFrames, m->m_waitMessages.size()); + + m->waitMessage(*waitItr); + waitItr++; + + if (m->m_useWiiLight) + { + WIILIGHT_SetLevel(0); + WIILIGHT_TurnOn(); + } + while (m->m_showWaitMessage) + { + if (m->m_useWiiLight) + { + currentLightLevel += (fadeStep * fadeDirection); + if (currentLightLevel >= 255) + { + currentLightLevel = 255; + fadeDirection = -1; + } + else if (currentLightLevel <= 0) + { + currentLightLevel = 0; + fadeDirection = 1; + } + WIILIGHT_SetLevel(currentLightLevel); + } + + if (waitFrames == 0) + { + if (waitItr == m->m_waitMessages.end()) + waitItr = m->m_waitMessages.begin(); + + while (!*waitItr->data) + { + gprintf("Skipping one image, because loaded data is not valid\n"); + waitItr++; + + if (waitItr == m->m_waitMessages.end()) + waitItr = m->m_waitMessages.begin(); + } + + m->waitMessage(*waitItr); + waitItr++; + + waitFrames = frames; + } + waitFrames--; + VIDEO_WaitVSync(); + } + if (m->m_useWiiLight) + { + WIILIGHT_SetLevel(0); + WIILIGHT_TurnOff(); + } + m->m_waitMessages.clear(); + gprintf("Stop showing images\n"); + m->m_showingWaitMessages = false; +} + +void CVideo::hideWaitMessage(bool force) +{ + m_showWaitMessage = false; + CheckWaitThread(force); +} + +void CVideo::CheckWaitThread(bool force) +{ + if (force || (!m_showingWaitMessages && waitThread != LWP_THREAD_NULL)) + { + m_showWaitMessage = false; + + if(LWP_ThreadIsSuspended(waitThread)) + LWP_ResumeThread(waitThread); + + LWP_JoinThread(waitThread, NULL); + + SMART_FREE(waitThreadStack); + waitThread = LWP_THREAD_NULL; + + m_waitMessages.clear(); + } +} + +void CVideo::waitMessage(float delay) +{ + waitMessage(safe_vector(), delay); +} + +void CVideo::waitMessage(const safe_vector &tex, float delay, bool useWiiLight) +{ + hideWaitMessage(true); + + m_useWiiLight = useWiiLight; + + if (tex.size() == 0) + { + STexture m_wTextures[10]; + m_wTextures[0].fromPNG(wait_01_png); + m_wTextures[1].fromPNG(wait_02_png); + m_wTextures[2].fromPNG(wait_03_png); + m_wTextures[3].fromPNG(wait_04_png); + m_wTextures[4].fromPNG(wait_05_png); + m_wTextures[5].fromPNG(wait_06_png); + m_wTextures[6].fromPNG(wait_07_png); + m_wTextures[7].fromPNG(wait_08_png); + m_wTextures[8].fromPNG(wait_09_png); + m_wTextures[9].fromPNG(wait_10_png); + m_waitMessages.reserve(10); + for (int i = 0; i < 10; i++) + m_waitMessages.push_back(m_wTextures[i]); + + m_waitMessageDelay = 0.2f; + } + else + { + m_waitMessages = tex; + m_waitMessageDelay = delay; + } + + if (m_waitMessages.size() == 1) + waitMessage(m_waitMessages[0]); + else if (m_waitMessages.size() > 1) + { + m_showWaitMessage = true; + unsigned int stack_size = (unsigned int)32768; //Try 32768? + SMART_FREE(waitThreadStack); + waitThreadStack = SmartBuf((unsigned char *)__real_malloc(stack_size), SmartBuf::SRCALL_MALLOC); + waitThreadStack = smartMem2Alloc(stack_size); + LWP_CreateThread(&waitThread, (void *(*)(void *))CVideo::_showWaitMessages, (void *)this, waitThreadStack.get(), stack_size, 30); + } +} + +void CVideo::waitMessage(const STexture &tex) +{ + Mtx modelViewMtx; + GXTexObj texObj; + + for (int i = 0; i < 3; ++i) + { + prepare(); + setup2DProjection(); + //prepareAAPass(i); + //setup2DProjection(false, true); + GX_SetNumChans(0); + GX_ClearVtxDesc(); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetNumTexGens(1); + GX_SetTevColorIn(GX_TEVSTAGE0, GX_CC_ZERO, GX_CC_ZERO, GX_CC_ZERO, GX_CC_TEXC); + GX_SetTevAlphaIn(GX_TEVSTAGE0, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO, GX_CA_TEXA); + GX_SetTevColorOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLORNULL); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetBlendMode(GX_BM_NONE, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + GX_SetAlphaUpdate(GX_TRUE); + GX_SetCullMode(GX_CULL_NONE); + GX_SetZMode(GX_DISABLE, GX_ALWAYS, GX_FALSE); + guMtxIdentity(modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + GX_InitTexObj(&texObj, tex.data.get(), tex.width, tex.height, tex.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32((float)((640 - tex.width) / 2), (float)((480 - tex.height) / 2), 0.f); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32((float)((640 + tex.width) / 2), (float)((480 - tex.height) / 2), 0.f); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32((float)((640 + tex.width) / 2), (float)((480 + tex.height) / 2), 0.f); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32((float)((640 - tex.width) / 2), (float)((480 + tex.height) / 2), 0.f); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + render(); + } + GX_SetNumChans(1); +} + +s32 CVideo::TakeScreenshot(const char *path) +{ + IMGCTX ctx = PNGU_SelectImageFromDevice (path); + s32 ret = PNGU_EncodeFromYCbYCr(ctx, m_rmode->fbWidth, m_rmode->efbHeight, m_frameBuf[m_curFB], 1); + PNGU_ReleaseImageContext (ctx); + return ret; +} \ No newline at end of file diff --git a/source/gui/video.hpp b/source/gui/video.hpp new file mode 100644 index 00000000..90b5c1fd --- /dev/null +++ b/source/gui/video.hpp @@ -0,0 +1,119 @@ + +#ifndef __VIDEO_HPP +#define __VIDEO_HPP + +#include + +#include "smartptr.hpp" +#include "vector.hpp" +#include "texture.hpp" + +#include "safe_vector.hpp" + +class CTexCoord +{ +public: + float x; + float y; +public: + CTexCoord(void) { x = 0.f; y = 0.f; } + CTexCoord(float px, float py) { x = px; y = py; } +}; + +class CColor : public GXColor +{ +public: + CColor(void) { r = 0; g = 0; b = 0; a = 0xFF; } + CColor(u8 pr, u8 pg, u8 pb) { r = pr; g = pg; b = pb; a = 0xFF; } + CColor(u8 pr, u8 pg, u8 pb, u8 pa) { r = pr; g = pg; b = pb; a = pa; } + CColor(u32 rgba8) + { + a = (rgba8 & 0xFF000000) >> 24; + r = (rgba8 & 0x00FF0000) >> 16; + g = (rgba8 & 0x0000FF00) >> 8; + b = rgba8 & 0x000000FF; + } + int intVal() { return a << 24 | r << 16 | g << 8 | b; } + bool operator==(const CColor &c) const { return c.r == r && c.g == g && c.b == b && c.a == a; } + bool operator!=(const CColor &c) const { return c.r != r || c.g != g || c.b != b || c.a != a; } + void blend(const CColor &src); + static CColor interpolate(const CColor &c1, const CColor &c2, u8 n); +}; + +class CVideo +{ +public: + CVideo(void); + ~CVideo(void); + void init(void); + void prepare(void); + void setAA(u8 aa, bool alpha = false, int width = 0, int height = 0); + void prepareAAPass(int aaStep); + void render(void); + void renderAAPass(int aaStep); + void drawAAScene(bool fs = true); + void renderToTexture(STexture &tex, bool clear); + void cleanup(void); + void setup2DProjection(bool setViewPort = true, bool noScale = false); + u32 width(void) const { return m_rmode->fbWidth; } + u32 height(void) const { return m_rmode->efbHeight; } + u32 width2D(void) { return m_width2D; } + u32 height2D(void) { return m_height2D; } + bool wide(void) const { return m_wide; } + void set2DViewport(u32 w, u32 h, int x, int y); + void prepareStencil(void); + void renderStencil(void); + int stencilVal(int x, int y); + void hideWaitMessage(bool force = false); + void waitMessage(float delay); + void waitMessage(const safe_vector &tex, float delay, bool useWiiLight = true); + void waitMessage(const STexture &tex); + void CheckWaitThread(bool force = false); + s32 TakeScreenshot(const char *); + void shiftViewPort(float x, float y); +private: + GXRModeObj *m_rmode; + void *m_frameBuf[2]; + int m_curFB; + void *m_fifo; + float m_yScale; + u32 m_xfbHeight; + bool m_wide; + u32 m_width2D; + u32 m_height2D; + int m_x2D; + int m_y2D; + u8 m_aa; + bool m_aaAlpha; + int m_aaWidth; + int m_aaHeight; + SmartBuf m_stencil; + SmartBuf m_aaBuffer[8]; + u32 m_aaBufferSize[8]; + float m_vpX; + float m_vpY; + float m_vpW; + float m_vpH; + float m_waitMessageDelay; + bool m_showWaitMessage; + volatile bool m_showingWaitMessages; + bool m_useWiiLight; + safe_vector m_waitMessages; + // + static const int _stencilWidth; + static const int _stencilHeight; + static const float _jitter2[2][2]; + static const float _jitter3[3][2]; + static const float _jitter4[4][2]; + static const float _jitter5[5][2]; + static const float _jitter6[6][2]; + static const float _jitter8[8][2]; +private: + void _drawAASceneWithAlpha(float w, float h); + void _setViewPort(float x, float y, float w, float h); + static void _showWaitMessages(CVideo *m); +private: + CVideo(const CVideo &); +}; + +#endif //!defined(__VIDEO_HPP) diff --git a/source/homebrew/homebrew.cpp b/source/homebrew/homebrew.cpp new file mode 100644 index 00000000..e71df861 --- /dev/null +++ b/source/homebrew/homebrew.cpp @@ -0,0 +1,137 @@ +#include +#include +//#include +#include +#include +#include +#include "safe_vector.hpp" +#include +#include "smartptr.hpp" +#include "gecko.h" + +#define EXECUTE_ADDR ((u8 *) 0x92000000) +#define BOOTER_ADDR ((u8 *) 0x93000000) +#define ARGS_ADDR ((u8 *) 0x93200000) + +extern const u8 app_booter_bin[]; +extern const u32 app_booter_bin_size; + +typedef void (*entrypoint) (void); +extern "C" { void __exception_closeall(); } + +static u8 *homebrewbuffer = EXECUTE_ADDR; +static u32 homebrewsize = 0; +static safe_vector Arguments; + +bool bootHB; + +void AddBootArgument(const char * argv) +{ + std::string arg(argv); + Arguments.push_back(arg); +} + +int CopyHomebrewMemory(u8 *temp, u32 pos, u32 len) +{ + homebrewsize += len; + memcpy(homebrewbuffer+pos, temp, len); + DCFlushRange(homebrewbuffer+pos, len); + + return 1; +} + +void FreeHomebrewBuffer() +{ + homebrewbuffer = EXECUTE_ADDR; + homebrewsize = 0; + + Arguments.clear(); +} + +int LoadHomebrew(const char * filepath) +{ + if(!filepath) return -1; + + FILE *file = fopen(filepath ,"rb"); + if(!file) return -2; + + fseek(file, 0, SEEK_END); + u32 filesize = ftell(file); + rewind(file); + + SmartBuf buffer = smartAnyAlloc(filesize); + if (!buffer) + { + fclose(file); + return -3; + } + + bool good_read = fread((u8 *)buffer.get(), 1, filesize, file) == filesize; + fclose(file); + if (!good_read) return -4; + + DCFlushRange((u8 *)buffer.get(), filesize); + + return CopyHomebrewMemory((u8*)buffer.get(), 0, filesize); +} + +static int SetupARGV(struct __argv * args) +{ + if(!args) return -1; + + bzero(args, sizeof(struct __argv)); + args->argvMagic = ARGV_MAGIC; + + u32 argc = 0; + u32 position = 0; + u32 stringlength = 1; + + /** Append Arguments **/ + for(u32 i = 0; i < Arguments.size(); i++) + stringlength += Arguments[i].size()+1; + + args->length = stringlength; + //! Put the argument into mem2 too, to avoid overwriting it + args->commandLine = (char *) ARGS_ADDR + sizeof(struct __argv); + + /** Append Arguments **/ + for(u32 i = 0; i < Arguments.size(); i++) + { + strcpy(&args->commandLine[position], Arguments[i].c_str()); + position += Arguments[i].size() + 1; + argc++; + } + + args->argc = argc; + + args->commandLine[args->length - 1] = '\0'; + args->argv = &args->commandLine; + args->endARGV = args->argv + 1; + + Arguments.clear(); + + return 0; +} + +int BootHomebrew() +{ + if(homebrewsize == 0) return -1; + + struct __argv args; + SetupARGV(&args); + + memcpy(BOOTER_ADDR, app_booter_bin, app_booter_bin_size); + DCFlushRange(BOOTER_ADDR, app_booter_bin_size); + + entrypoint entry = (entrypoint) BOOTER_ADDR; + + if (args.argvMagic == ARGV_MAGIC) + { + memmove(ARGS_ADDR, &args, sizeof(args)); + DCFlushRange(ARGS_ADDR, sizeof(args) + args.length); + } + SYS_ResetSystem(SYS_SHUTDOWN, 0, 0); + entry(); + + return 0; +} \ No newline at end of file diff --git a/source/homebrew/homebrew.h b/source/homebrew/homebrew.h new file mode 100644 index 00000000..667a8417 --- /dev/null +++ b/source/homebrew/homebrew.h @@ -0,0 +1,10 @@ +#ifndef _BOOTHOMEBREW_H_ +#define _BOOTHOMEBREW_H_ + extern bool bootHB; + int BootHomebrew(); + int CopyHomebrewMemory(u8 *temp, u32 pos, u32 len); + void AddBootArgument(const char * arg); + void FreeHomebrewBuffer(); + int LoadHomebrew(const char * filepath); + +#endif diff --git a/source/list/cache.cpp b/source/list/cache.cpp new file mode 100644 index 00000000..054a0b32 --- /dev/null +++ b/source/list/cache.cpp @@ -0,0 +1,162 @@ +#include "cache.hpp" + +template +CCache::CCache(T &tmp, string path, u32 index, CMode mode) /* Load/Save One */ +{ + filename = path; + //gprintf("Openning DB: %s\n", filename.c_str()); + + cache = fopen(filename.c_str(), io[mode]); + if(!cache) return; + + switch(mode) + { + case LOAD: + LoadOne(tmp, index); + break; + case SAVE: + SaveOne(tmp, index); + break; + default: + return; + } +} + +template +CCache::CCache(safe_vector &list, string path , CMode mode) /* Load/Save All */ +{ + filename = path; + //gprintf("Openning DB: %s\n", filename.c_str()); + + cache = fopen(filename.c_str(), io[mode]); + if(!cache) return; + + switch(mode) + { + case LOAD: + LoadAll(list); + break; + case SAVE: + SaveAll(list); + break; + default: + return; + } +} + +template +CCache::CCache(safe_vector &list, string path, T tmp, CMode mode) /* Add One */ +{ + filename = path; + //gprintf("Openning DB: %s\n", filename.c_str()); + + cache = fopen(filename.c_str(), io[mode]); + if(!cache) return; + + switch(mode) + { + case ADD: + AddOne(list, tmp); + break; + default: + return; + } +} + +template +CCache::CCache(safe_vector &list, string path, u32 index, CMode mode) /* Remove One */ +{ + filename = path; + //gprintf("Openning DB: %s\n", filename.c_str()); + + cache = fopen(filename.c_str(), io[mode]); + if(!cache) return; + + switch(mode) + { + case REMOVE: + RemoveOne(list, index); + break; + default: + return; + } +} + +template +CCache::~CCache() +{ + //gprintf("Closing DB: %s\n", filename.c_str()); + if(cache) fclose(cache); + cache = NULL; +} + +template +void CCache::SaveAll(safe_vector list) +{ + //gprintf("Updating DB: %s\n", filename.c_str()); + if(!cache) return; + fwrite((void *)&list[0], 1, list.size() * sizeof(T), cache); +} + +template +void CCache::SaveOne(T tmp, u32 index) +{ + //gprintf("Updating Item number %u in DB: %s\n", index, filename.c_str()); + if(!cache) return; + fseek(cache, index * sizeof(T), SEEK_SET); + fwrite((void *)&tmp, 1, sizeof(T), cache); +} + +template +void CCache::LoadAll(safe_vector &list) +{ + if(!cache) return; + + //gprintf("Loading DB: %s\n", filename.c_str()); + + T tmp; + fseek(cache, 0, SEEK_END); + u64 fileSize = ftell(cache); + fseek(cache, 0, SEEK_SET); + + u32 count = (u32)(fileSize / sizeof(T)); + + list.reserve(count + list.size()); + for(u32 i = 0; i < count; i++) + { + LoadOne(tmp, i); + list.push_back(tmp); + } +} + + +template +void CCache::LoadOne(T &tmp, u32 index) +{ + if(!cache) return; + + //gprintf("Fetching Item number %u in DB: %s\n", index, filename.c_str()); + fseek(cache, index * sizeof(T), SEEK_SET); + fread((void *)&tmp, 1, sizeof(T), cache); + //gprintf("Path %s\n", tmp.path); +} + +template +void CCache::AddOne(safe_vector &list, T tmp) +{ + //gprintf("Adding Item number %u in DB: %s\n", list.size()+1, filename.c_str()); + list.push_back(tmp); + + if(!cache) return; + fwrite((void *)&tmp, 1, sizeof(T), cache); // FILE* is opened as "ab+" so its always written to the EOF. +} + +template +void CCache::RemoveOne(safe_vector &list, u32 index) +{ + //gprintf("Removing Item number %u in DB: %s\n", index, filename.c_str()); + list.erase(list.begin() + index); + SaveAll(list); +} + +template class CCache; \ No newline at end of file diff --git a/source/list/cache.hpp b/source/list/cache.hpp new file mode 100644 index 00000000..ea6ec0c5 --- /dev/null +++ b/source/list/cache.hpp @@ -0,0 +1,49 @@ +#ifndef CCACHE +#define CCACHE + +#include +#include +#include +#include "safe_vector.hpp" +#include "disc.h" + +//#include "gecko.h" +using namespace std; + +const char io[4][5] = { + "wb", + "rb", + "ab", + "wb", +}; + +enum CMode +{ + SAVE, + LOAD, + ADD, + REMOVE +}; + +template +class CCache +{ + public: + CCache(T &tmp, string path, u32 index, CMode mode); /* Load/Save One */ + CCache(safe_vector &list, string path, CMode mode); /* Load/Save All */ + CCache(safe_vector &list, string path, T tmp, CMode mode); /* Add One */ + CCache(safe_vector &list, string path, u32 index, CMode mode); /* Remove One */ + ~CCache(); + private: + void SaveAll(safe_vector list); + void SaveOne(T tmp, u32 index); + void LoadAll(safe_vector &list); + void LoadOne(T &tmp, u32 index); + + void AddOne(safe_vector &list, T tmp); + void RemoveOne(safe_vector &list, u32 index); + + FILE *cache; + string filename; +}; +#endif \ No newline at end of file diff --git a/source/list/cachedlist.cpp b/source/list/cachedlist.cpp new file mode 100644 index 00000000..cb9dae1c --- /dev/null +++ b/source/list/cachedlist.cpp @@ -0,0 +1,131 @@ +#include "cachedlist.hpp" +#include + +template +void CachedList::Load(string path, string containing) /* Load All */ +{ + gprintf("\nLoading files containing %s in %s\n", containing.c_str(), path.c_str()); + m_loaded = false; + m_database = sfmt("%s/%s.db", m_cacheDir.c_str(), (make_db_name(path)).c_str()); + + gprintf("Database file: %s\n", m_database.c_str()); + m_wbfsFS = strncasecmp(DeviceHandler::Instance()->PathToFSName(path.c_str()), "WBFS", 4) == 0; + + bool update_games = false; + bool update_homebrew = false; + if(!m_wbfsFS) + { + update_games = strcasestr(path.c_str(), "wbfs") != NULL && force_update[COVERFLOW_USB]; + update_homebrew = strcasestr(path.c_str(), "apps") != NULL && force_update[COVERFLOW_HOMEBREW]; + + if(update_games || update_homebrew) + remove(m_database.c_str()); + + struct stat filestat, cache; + gprintf("%s\n", path.c_str()); + if(stat(path.c_str(), &filestat) == -1) return; + + bool update_lang = m_lastLanguage != m_curLanguage; + bool noDB = stat(m_database.c_str(), &cache) == -1; + bool mtimes = filestat.st_mtime > cache.st_mtime; + + m_update = update_lang || noDB || mtimes; + if(m_update) gprintf("Cache is being updated because %s\n", update_lang ? "languages are different!" : noDB ? "a database was not found!" : "the WBFS folder was modified!"); + } + + if(update_games) force_update[COVERFLOW_USB] = false; + if(update_homebrew) force_update[COVERFLOW_HOMEBREW] = false; + + bool music = typeid(T) == typeid(std::string); + + if(m_update || m_wbfsFS || music) + { + gprintf("Calling list to update filelist\n"); + safe_vector pathlist; + list.GetPaths(pathlist, containing, path, m_wbfsFS); + list.GetHeaders(pathlist, *this, m_settingsDir, m_curLanguage); + + path.append("/touch.db"); + FILE *file = fopen(path.c_str(), "wb"); + fclose(file); + remove(path.c_str()); + + if(!music && pathlist.size() > 0) + { + Save(); + pathlist.clear(); + } + } + else + CCache(*this, m_database, LOAD); + + m_lastLanguage = m_curLanguage; + m_update = false; + m_loaded = true; +} + +template<> +void CachedList::LoadChannels(string path, u32 channelType) /* Load All */ +{ + m_loaded = false; + m_update = true; + + bool emu = !path.empty(); + if(emu) + { + m_database = sfmt("%s/%s.db", m_cacheDir.c_str(), make_db_name(sfmt("%s/emu", path.c_str())).c_str()); + + size_t find = m_database.find("//"); + if(find != string::npos) + m_database.replace(find, 2, "/"); + + if(force_update[COVERFLOW_CHANNEL]) + remove(m_database.c_str()); + + //gprintf("%s\n", m_database.c_str()); + struct stat filestat, cache; + + string newpath = sfmt("%s%s", path.c_str(), "title"); + + if(stat(newpath.c_str(), &filestat) == -1) return; + + m_update = force_update[COVERFLOW_CHANNEL] || m_lastchannelLang != m_channelLang || stat(m_database.c_str(), &cache) == -1 || filestat.st_mtime > cache.st_mtime; + } + + force_update[COVERFLOW_CHANNEL] = false; + + if(m_update) + { + list.GetChannels(*this, m_settingsDir, channelType, m_channelLang); + + m_loaded = true; + m_update = false; + m_lastchannelLang = m_channelLang; + + if(this->size() > 0 && emu) Save(); + } + else + CCache(*this, m_database, LOAD); + + m_loaded = true; +} + +template +string CachedList::make_db_name(string path) +{ + string buffer = path; + size_t find = buffer.find(":/"); + if(find != string::npos) + buffer.replace(find, 2, "_"); + + find = buffer.find("/"); + while(find != string::npos) + { + buffer[find] = '_'; + find = buffer.find("/"); + } + return buffer; +} + +template class CachedList; +template class CachedList; diff --git a/source/list/cachedlist.hpp b/source/list/cachedlist.hpp new file mode 100644 index 00000000..dd6ad3bd --- /dev/null +++ b/source/list/cachedlist.hpp @@ -0,0 +1,74 @@ +#ifndef CACHEDLIST +#define CACHEDLIST + +#include "list.hpp" +#include "cache.hpp" +#include "safe_vector.hpp" +#include "gecko.h" + +using namespace std; + +enum { + COVERFLOW_USB, + COVERFLOW_CHANNEL, + COVERFLOW_HOMEBREW, + COVERFLOW_MAX +}; + +template +class CachedList : public safe_vector +{ + public: + void Init(string cachedir, string settingsDir, string curLanguage) /* Initialize Private Variables */ + { + m_cacheDir = cachedir; + m_settingsDir = settingsDir; + m_curLanguage = m_lastLanguage = curLanguage; + m_channelLang = m_lastchannelLang = curLanguage; + m_loaded = false; + m_database = ""; + m_update = false; + for(u32 i = 0; i < COVERFLOW_MAX; i++) + force_update[i] = false; + } + + void Update(u32 view = COVERFLOW_MAX) /* Force db update on next load */ + { + if(view == COVERFLOW_MAX) + for(u32 i = 0; i < COVERFLOW_MAX; i++) + force_update[i] = true; + else + force_update[view] = true; + } + + void Load(string path, string containing); + void LoadChannels(string path, u32 channelType); + + void Unload(){if(m_loaded) {this->clear(); m_loaded = false; m_database = "";}}; + void Save() {if(m_loaded) CCache(*this, m_database, SAVE);} /* Save All */ + + void Get(T tmp, u32 index) {if(m_loaded) CCache(tmp, m_database, index, LOAD);} /* Load One */ + void Set(T tmp, u32 index) {if(m_loaded) CCache(tmp, m_database, index, SAVE);} /* Save One */ + + void Add(T tmp) {if(m_loaded) CCache(*this, m_database, tmp, ADD);} /* Add One */ + void Remove(u32 index) {if(m_loaded) CCache(*this, m_database, index, REMOVE);} /* Remove One */ + + void SetLanguage(string curLanguage) { m_curLanguage = m_channelLang = curLanguage; } + private: + string make_db_name(string path); + + bool m_loaded; + bool m_update; + bool m_wbfsFS; + u8 force_update[COVERFLOW_MAX]; + CList list; + string m_database; + string m_cacheDir; + string m_settingsDir; + string m_curLanguage; + string m_lastLanguage; + string m_channelLang; + string m_lastchannelLang; +}; + +#endif \ No newline at end of file diff --git a/source/list/list.cpp b/source/list/list.cpp new file mode 100644 index 00000000..441cc411 --- /dev/null +++ b/source/list/list.cpp @@ -0,0 +1,360 @@ +#include "list.hpp" +#include "gecko.h" +#include "GameTDB.hpp" +#include "config.hpp" +#include "defines.h" +#include "channels.h" + +template +void CList::GetPaths(safe_vector &pathlist, string containing, string directory, bool wbfs_fs) +{ + if (!wbfs_fs) + { + /* Open primary directory */ + DIR *dir_itr = opendir(directory.c_str()); + if (!dir_itr) return; + + safe_vector compares = stringToVector(containing, '|'); + safe_vector temp_pathlist; + + struct dirent *ent; + + /* Read primary entries */ + while((ent = readdir(dir_itr)) != NULL) + { + if (ent->d_name[0] == '.') continue; + //if (strlen(ent->d_name) < 6) continue; + + if(ent->d_type == DT_REG) + { + for(safe_vector::iterator compare = compares.begin(); compare != compares.end(); compare++) + if (strcasestr(ent->d_name, (*compare).c_str()) != NULL) + { + //gprintf("Pushing %s to the list.\n", sfmt("%s/%s", directory.c_str(), ent->d_name).c_str()); + pathlist.push_back(sfmt("%s/%s", directory.c_str(), ent->d_name)); + break; + } + } + else + { + temp_pathlist.push_back(sfmt("%s/%s", directory.c_str(), ent->d_name)); + } + } + closedir(dir_itr); + + if(temp_pathlist.size() > 0) + { + for(safe_vector::iterator templist = temp_pathlist.begin(); templist != temp_pathlist.end(); templist++) + { + dir_itr = opendir((*templist).c_str()); + if (!dir_itr) continue; + + /* Read secondary entries */ + while((ent = readdir(dir_itr)) != NULL) + { + if(ent->d_type != DT_REG) continue; + if (strlen(ent->d_name) < 8) continue; + + for(safe_vector::iterator compare = compares.begin(); compare != compares.end(); compare++) + if (strcasestr(ent->d_name, (*compare).c_str()) != NULL) + { + //gprintf("Pushing %s to the list.\n", sfmt("%s/%s", (*templist).c_str(), ent->d_name).c_str()); + pathlist.push_back(sfmt("%s/%s", (*templist).c_str(), ent->d_name)); + break; + } + } + closedir(dir_itr); + } + } + } + else + { + if(strcasestr(containing.c_str(), ".dol") != 0) return; + + int partition = DeviceHandler::Instance()->PathToDriveType(directory.c_str()); + wbfs_t* handle = DeviceHandler::Instance()->GetWbfsHandle(partition); + if (!handle) return; + + u32 count = wbfs_count_discs(handle); + for(u32 i = 0; i < count; i++) + pathlist.push_back(directory); + } +} + +template <> +void CList::GetHeaders(safe_vector pathlist, safe_vector &headerlist, string, string) +{ + //gprintf("Getting headers for CList\n"); + + if(pathlist.size() < 1) return; + headerlist.reserve(pathlist.size() + headerlist.size()); + + for(safe_vector::iterator itr = pathlist.begin(); itr != pathlist.end(); itr++) + headerlist.push_back((*itr).c_str()); +} + +template <> +void CList::GetHeaders(safe_vector pathlist, safe_vector &headerlist, string settingsDir, string curLanguage) +{ + if(pathlist.size() < 1) return; + headerlist.reserve(pathlist.size() + headerlist.size()); + + gprintf("Getting headers for paths in pathlist (%d)\n", pathlist.size()); + + dir_discHdr tmp; + u32 count = 0; + string GTitle; + + Config custom_titles; + if (settingsDir.size() > 0) + { + string custom_titles_path = sfmt("%s/" CTITLES_FILENAME, settingsDir.c_str()); + custom_titles.load(custom_titles_path.c_str()); + } + + GameTDB gameTDB; + if (settingsDir.size() > 0) + { + gameTDB.OpenFile(sfmt("%s/wiitdb.xml", settingsDir.c_str()).c_str()); + if(curLanguage.size() == 0) curLanguage = "EN"; + gameTDB.SetLanguageCode(curLanguage.c_str()); + } + + for(safe_vector::iterator itr = pathlist.begin(); itr != pathlist.end(); itr++) + { + bzero(&tmp, sizeof(dir_discHdr)); + strncpy(tmp.path, (*itr).c_str(), sizeof(tmp.path)); + tmp.hdr.index = headerlist.size(); + tmp.hdr.casecolor = 1; + + bool wbfs = (*itr).rfind(".wbfs") != string::npos || (*itr).rfind(".WBFS") != string::npos; + if (wbfs || (*itr).rfind(".iso") != string::npos || (*itr).rfind(".ISO") != string::npos) + { + Check_For_ID(tmp.hdr.id, (*itr).c_str(), "[", "]"); /* [GAMEID] Title, [GAMEID]_Title, Title [GAMEID], Title_[GAMEID] */ + if(tmp.hdr.id[0] == 0) + { + Check_For_ID(tmp.hdr.id, (*itr).c_str(), "/", "."); /* GAMEID.wbfs, GAMEID.iso */ + if(tmp.hdr.id[0] == 0) + { + Check_For_ID(tmp.hdr.id, (*itr).c_str(), "/", "_"); /* GAMEID_Title */ + if(tmp.hdr.id[0] == 0) + { + Check_For_ID(tmp.hdr.id, (*itr).c_str(), "_", "."); /* Title_GAMEID */ // <-- Unsafe? + if(tmp.hdr.id[0] == 0) + Check_For_ID(tmp.hdr.id, (*itr).c_str(), " ", "."); /* Title GAMEID */ //<-- Unsafe? + } + } + } + + if (!isalnum(tmp.hdr.id[0]) || tmp.hdr.id[0] == 0 || memcmp(tmp.hdr.id, "__CFG_", sizeof tmp.hdr.id) == 0) + { + gprintf("Skipping file: '%s'\n", (*itr).c_str()); + continue; + } + + // Get info from custom titles + GTitle = custom_titles.getString("TITLES", (const char *) tmp.hdr.id); + int ccolor = custom_titles.getColor("COVERS", (const char *) tmp.hdr.id, tmp.hdr.casecolor).intVal(); + + if(GTitle.size() > 0 || (gameTDB.IsLoaded() && gameTDB.GetTitle((char *)tmp.hdr.id, GTitle))) + { + mbstowcs(tmp.title, GTitle.c_str(), sizeof(tmp.title)); + Asciify(tmp.title); + tmp.hdr.casecolor = ccolor != 1 ? ccolor : gameTDB.GetCaseColor((char *)tmp.hdr.id); + + tmp.hdr.wifi = gameTDB.GetWifiPlayers((char *)tmp.hdr.id); + tmp.hdr.players = gameTDB.GetPlayers((char *)tmp.hdr.id); + //tmp.hdr.controllers = gameTDB.GetAccessories((char *)tmp.hdr.id); + + tmp.hdr.magic = 0x5D1C9EA3; + headerlist.push_back(tmp); + continue; + } + + FILE *fp = fopen((*itr).c_str(), "rb"); + if (fp) + { + fseek(fp, wbfs ? 512 : 0, SEEK_SET); + fread(&tmp.hdr, sizeof(discHdr), 1, fp); + SAFE_CLOSE(fp); + } + + if (tmp.hdr.magic == 0x5D1C9EA3) + { + mbstowcs(tmp.title, (const char *)tmp.hdr.title, sizeof(tmp.hdr.title)); + Asciify(tmp.title); + + headerlist.push_back(tmp); + continue; + } + + if(wbfs) + { + wbfs_t *part = WBFS_Ext_OpenPart((char *)(*itr).c_str()); + if (!part) continue; + + /* Get header */ + if(wbfs_get_disc_info(part, 0, (u8*)&tmp.hdr, sizeof(discHdr), NULL) == 0 + && memcmp(tmp.hdr.id, "__CFG_", sizeof tmp.hdr.id) != 0) + { + mbstowcs(tmp.title, (const char *)tmp.hdr.title, sizeof(tmp.title)); + Asciify(tmp.title); + + headerlist.push_back(tmp); + } + WBFS_Ext_ClosePart(part); + continue; + } + } + else if((*itr).rfind(".dol") != string::npos || (*itr).rfind(".DOL") != string::npos + || (*itr).rfind(".elf") != string::npos || (*itr).rfind(".ELF") != string::npos) + { + char *filename = &(*itr)[(*itr).find_last_of('/')+1]; + + if(strcasecmp(filename, "boot.dol") != 0 && strcasecmp(filename, "boot.elf") != 0) continue; + + (*itr)[(*itr).find_last_of('/')] = 0; + (*itr).assign(&(*itr)[(*itr).find_last_of('/') + 1]); + + (*itr)[0] = toupper((*itr)[0]); + for (u32 i = 1; i < (*itr).size(); ++i) + { + if((*itr)[i] == '_' || (*itr)[i] == '-') + (*itr)[i] = ' '; + + if((*itr)[i] == ' ') + { + (*itr)[i + 1] = toupper((*itr)[i + 1]); + i++; + } + else (*itr)[i] = tolower((*itr)[i]); + } + mbstowcs(tmp.title, (*itr).c_str(), sizeof(tmp.title)); + + for (u32 i = 0; i < 6; ++i) + (*itr)[i] = toupper((*itr)[i]); + + memcpy(tmp.hdr.id, (*itr).c_str(), 6); + + + for (u32 i = 0; i < 6; ++i) + if(!isalnum(tmp.hdr.id[i]) || tmp.hdr.id[i] == ' ' || tmp.hdr.id[i] == '\0') + tmp.hdr.id[i] = '_'; + + tmp.hdr.casecolor = 1; + + Asciify(tmp.title); + headerlist.push_back(tmp); + continue; + } + else if(strncasecmp(DeviceHandler::Instance()->PathToFSName((*itr).c_str()), "WBFS", 4) == 0) + { + u8 partition = DeviceHandler::Instance()->PathToDriveType((*itr).c_str()); + wbfs_t* handle = DeviceHandler::Instance()->GetWbfsHandle(partition); + if (!handle) return; + + s32 ret = wbfs_get_disc_info(handle, count, (u8 *)&tmp.hdr, sizeof(struct discHdr), NULL); + count++; + if(ret != 0) continue; + + if (tmp.hdr.magic == 0x5D1C9EA3 && memcmp(tmp.hdr.id, "__CFG_", sizeof tmp.hdr.id) != 0) + { + // Get info from custom titles + GTitle = custom_titles.getString("TITLES", (const char *) tmp.hdr.id); + int ccolor = custom_titles.getColor("COVERS", (const char *) tmp.hdr.id, tmp.hdr.casecolor).intVal(); + if(GTitle.size() > 0 || (gameTDB.GetTitle((char *)tmp.hdr.id, GTitle))) + { + mbstowcs(tmp.title, GTitle.c_str(), sizeof(tmp.title)); + tmp.hdr.casecolor = ccolor != 1 ? ccolor : gameTDB.GetCaseColor((char *)tmp.hdr.id); + + tmp.hdr.wifi = gameTDB.GetWifiPlayers((char *)tmp.hdr.id); + tmp.hdr.players = gameTDB.GetPlayers((char *)tmp.hdr.id); + //tmp.hdr.controllers = gameTDB.GetAccessories((char *)tmp.hdr.id); + + } + else mbstowcs(tmp.title, tmp.hdr.title, sizeof(tmp.title)); + + Asciify(tmp.title); + headerlist.push_back(tmp); + } + continue; + } + } + + if(gameTDB.IsLoaded()) + gameTDB.CloseFile(); +} + +template <> +void CList::GetChannels(safe_vector &headerlist, string settingsDir, u32 channelType, string curLanguage) +{ + Channels m_channels; + m_channels.Init(channelType, curLanguage, true); + + Config custom_titles; + if (settingsDir.size() > 0) + { + string custom_titles_path = sfmt("%s/" CTITLES_FILENAME, settingsDir.c_str()); + custom_titles.load(custom_titles_path.c_str()); + } + + GameTDB gameTDB; + if (settingsDir.size() > 0) + { + gameTDB.OpenFile(sfmt("%s/wiitdb.xml", settingsDir.c_str()).c_str()); + if(curLanguage.size() == 0) curLanguage = "EN"; + gameTDB.SetLanguageCode(curLanguage.c_str()); + } + + u32 count = m_channels.Count(); + + headerlist.reserve(count); + + for (u32 i = 0; i < count; ++i) + { + Channel *chan = m_channels.GetChannel(i); + + if (chan->id == NULL) continue; // Skip invalid channels + + dir_discHdr tmp; + bzero(&tmp, sizeof(dir_discHdr)); + tmp.hdr.index = headerlist.size(); + tmp.hdr.casecolor = 1; + + memcpy(tmp.hdr.id, chan->id, 4); + memcpy(tmp.title, chan->name, sizeof(tmp.title)); + string GTitle = custom_titles.getString("TITLES", (const char *) tmp.hdr.id); + int ccolor = custom_titles.getColor("COVERS", (const char *) tmp.hdr.id, tmp.hdr.casecolor).intVal(); + + if(GTitle.size() > 0 || (gameTDB.IsLoaded() && gameTDB.GetTitle((char *)tmp.hdr.id, GTitle))) + mbstowcs(tmp.title, GTitle.c_str(), sizeof(tmp.title)); + + Asciify(tmp.title); + + tmp.hdr.casecolor = ccolor != 1 ? ccolor : gameTDB.GetCaseColor((char *)tmp.hdr.id); + + tmp.hdr.wifi = gameTDB.GetWifiPlayers((char *)tmp.hdr.id); + tmp.hdr.players = gameTDB.GetPlayers((char *)tmp.hdr.id); + //tmp.hdr.controllers = gameTDB.GetAccessories((char *)tmp.hdr.id); + + tmp.hdr.chantitle = chan->title; + + headerlist.push_back(tmp); + } + + if(gameTDB.IsLoaded()) + gameTDB.CloseFile(); +} + +template +void CList::Check_For_ID(u8 *id, string path, string one, string two) +{ + size_t idstart = path.find_last_of(one); + size_t idend = path.find_last_of(two); + if (idend != string::npos && idstart != string::npos && idend - idstart == 7) + for(u8 pos = 0; pos < 6; pos++) + id[pos] = toupper(path[idstart + 1 + pos]); +} + +template class CList; +template class CList; \ No newline at end of file diff --git a/source/list/list.hpp b/source/list/list.hpp new file mode 100644 index 00000000..a96ca3a9 --- /dev/null +++ b/source/list/list.hpp @@ -0,0 +1,32 @@ +#ifndef CLIST +#define CLIST + +#include +#include +#include +#include +#include +#include + +#include "DeviceHandler.hpp" +#include "safe_vector.hpp" +#include "wbfs_ext.h" +#include "libwbfs/libwbfs.h" +#include "disc.h" +#include "text.hpp" +#include "cache.hpp" + +using namespace std; +template +class CList +{ + public: + CList(){}; + ~CList(){}; + void GetPaths(safe_vector &pathlist, string containing, string directory, bool wbfs_fs = false); + void GetHeaders(safe_vector pathlist, safe_vector &headerlist, string, string); + void GetChannels(safe_vector &headerlist, string, u32, string); + private: + void Check_For_ID(u8 *id, string path, string one, string two); +}; +#endif diff --git a/source/loader/alt_ios.cpp b/source/loader/alt_ios.cpp new file mode 100644 index 00000000..a64e4fd2 --- /dev/null +++ b/source/loader/alt_ios.cpp @@ -0,0 +1,113 @@ +#include "DeviceHandler.hpp" +#include "wdvd.h" +#include "disc.h" +#include "usbstorage.h" +#include "mem2.hpp" +#include "alt_ios.h" +#include "sys.h" +#include "wbfs.h" + +#include +#include + +#include "gecko.h" + +extern "C" {extern u8 currentPartition;} +extern int __Arena2Lo; + +#define HAVE_AHBPROT ((*(vu32*)0xcd800064 == 0xFFFFFFFF) ? 1 : 0) +#define MEM_REG_BASE 0xd8b4000 +#define MEM_PROT (MEM_REG_BASE + 0x20a) + +static void disable_memory_protection() +{ + gprintf("Disable memory protection..."); + int mem_prot = read32(MEM_PROT); + gprintf("current value: %08X...", mem_prot); + write32(MEM_PROT, mem_prot & 0x0000FFFF); + gprintf("done\n"); +} + +static u32 apply_patch(const u8 *pattern, u32 pattern_size, const u8 *patch, u32 patch_size, u32 patch_offset) +{ + //gprintf("Applying AHBPROT patch..."); + u8 *ptr_start = (u8*)*((u32*)0x80003134), *ptr_end = (u8*)0x94000000; + u32 found = 0; + u8 *location = NULL; + while (ptr_start < (ptr_end - patch_size)) + { + if (!memcmp(ptr_start, pattern, pattern_size)) + { + found++; + location = ptr_start + patch_offset; + u8 *start = location; + u32 i; + for (i = 0; i < patch_size; i++) + *location++ = patch[i]; + + DCFlushRange((u8 *)(((u32)start) >> 5 << 5), (patch_size >> 5 << 5) + 64); + ICInvalidateRange((u8 *)(((u32)start) >> 5 << 5), (patch_size >> 5 << 5) + 64); + } + ptr_start++; + } + //gprintf("done\n"); + return found; +} + +const u8 es_set_ahbprot_pattern[] = { 0x68, 0x5B, 0x22, 0xEC, 0x00, 0x52, 0x18, 0x9B, 0x68, 0x1B, 0x46, 0x98, 0x07, 0xDB }; +const u8 es_set_ahbprot_patch[] = { 0x01 }; + +u32 IOSPATCH_AHBPROT() +{ + if (HAVE_AHBPROT) + { + disable_memory_protection(); + return apply_patch((const u8 *) es_set_ahbprot_pattern, sizeof(es_set_ahbprot_pattern), (const u8 *) es_set_ahbprot_patch, sizeof(es_set_ahbprot_patch), 25); + } + return 0; +} + +bool loadIOS(int ios, bool launch_game) +{ + gprintf("Reloading into IOS %i from %i (AHBPROT: %u)...", ios, IOS_GetVersion(), HAVE_AHBPROT); + + Close_Inputs(); + DeviceHandler::Instance()->UnMountAll(); + + WDVD_Close(); + USBStorage_Deinit(); + + //gprintf("AHBPROT state before reloading: %s\n", HAVE_AHBPROT ? "enabled" : "disabled"); + //IOSPATCH_AHBPROT(); + +/* void *backup = MEM1_alloc(0x200000); // 0x126CA0 bytes were needed last time i checked. But take more just in case. + if (backup != 0) + { + memcpy(backup, &__Arena2Lo, 0x200000); + DCFlushRange(backup, 0x200000); + } */ + + bool iosOK = IOS_ReloadIOS(ios) == 0; + +/* if (backup != 0) + { + memcpy(&__Arena2Lo, backup, 0x200000); + DCFlushRange(&__Arena2Lo, 0x200000); + free(backup); + } */ + + gprintf("%s, Current IOS: %i\n", iosOK ? "OK" : "FAILED!", IOS_GetVersion()); + + //IOSPATCH_AHBPROT(); + //gprintf("Current AHBPROT state: %s\n", HAVE_AHBPROT ? "enabled" : "disabled"); + + if (launch_game) + { + DeviceHandler::Instance()->MountAll(); + DeviceHandler::Instance()->Open_WBFS(currentPartition); + Disc_Init(); + } + else Open_Inputs(); + + return iosOK; +} \ No newline at end of file diff --git a/source/loader/alt_ios.h b/source/loader/alt_ios.h new file mode 100644 index 00000000..ffbaf039 --- /dev/null +++ b/source/loader/alt_ios.h @@ -0,0 +1,18 @@ +#ifndef _ALT_IOS_H_ +#define _ALT_IOS_H_ + +#include + +#ifdef __cplusplus +extern "C" { +#endif + +bool loadIOS(int ios, bool launch_game); + +extern int mainIOS; + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/source/loader/alt_ios_gen.c b/source/loader/alt_ios_gen.c new file mode 100644 index 00000000..8ca429f3 --- /dev/null +++ b/source/loader/alt_ios_gen.c @@ -0,0 +1,2 @@ +#include "alt_ios.h" +int mainIOS = 249; diff --git a/source/loader/apploader.c b/source/loader/apploader.c new file mode 100644 index 00000000..dcaa3eea --- /dev/null +++ b/source/loader/apploader.c @@ -0,0 +1,280 @@ +#include +#include +#include + +#include "apploader.h" +#include "wdvd.h" +#include "patchcode.h" +#include "disc.h" +#include "videopatch.h" +#include "wip.h" +#include "wbfs.h" +#include "sys.h" +#include "gecko.h" + +/* Apploader function pointers */ +typedef int (*app_main)(void **dst, int *size, int *offset); +typedef void (*app_init)(void (*report)(const char *fmt, ...)); +typedef void *(*app_final)(); +typedef void (*app_entry)(void (**init)(void (*report)(const char *fmt, ...)), int (**main)(), void *(**final)()); + +/* Constants */ +#define APPLDR_OFFSET 0x2440 + +/* Variables */ +static u32 buffer[0x20] ATTRIBUTE_ALIGN(32); + +static bool maindolpatches(void *dst, int len, u8 vidMode, GXRModeObj *vmode, bool vipatch, bool countryString, u8 patchVidModes); +static bool Remove_001_Protection(void *Address, int Size); +static bool PrinceOfPersiaPatch(); + +static void __noprint(const char *fmt, ...) +{ +} + +s32 Apploader_Run(entry_point *entry, u8 vidMode, GXRModeObj *vmode, bool vipatch, bool countryString, u8 patchVidModes) +{ + void *dst = NULL; + int len = 0; + int offset = 0; + app_init appldr_init; + app_main appldr_main; + app_final appldr_final; + + /* Read apploader header */ + s32 ret = WDVD_Read(buffer, 0x20, APPLDR_OFFSET); + if (ret < 0) return ret; + + /* Calculate apploader length */ + u32 appldr_len = buffer[5] + buffer[6]; + + SYS_SetArena1Hi(APPLOADER_END); + + /* Read apploader code */ + // Either you limit memory usage or you don't touch the heap after that, because this is writing at 0x1200000 + ret = WDVD_Read(APPLOADER_START, appldr_len, APPLDR_OFFSET + 0x20); + if (ret < 0) return ret; + + DCFlushRange(APPLOADER_START, appldr_len); + + /* Set apploader entry function */ + app_entry appldr_entry = (app_entry)buffer[4]; + + /* Call apploader entry */ + appldr_entry(&appldr_init, &appldr_main, &appldr_final); + + /* Initialize apploader */ + appldr_init(__noprint); + + bool hookpatched = false; + + while (appldr_main(&dst, &len, &offset)) + { + /* Read data from DVD */ + WDVD_Read(dst, len, (u64)(offset << 2)); + if(maindolpatches(dst, len, vidMode, vmode, vipatch, countryString, patchVidModes)) + hookpatched = true; + } + + if (hooktype != 0 && !hookpatched) + { + gprintf("Error: Could not patch the hook\n"); + gprintf("Ocarina and debugger won't work\n"); + } + + PrinceOfPersiaPatch(); + + /* Set entry point from apploader */ + *entry = appldr_final(); + + IOSReloadBlock(IOS_GetVersion()); + *(vu32 *)0x80003140 = *(vu32 *)0x80003188; // IOS Version Check + *(vu32 *)0x80003180 = *(vu32 *)0x80000000; // Game ID Online Check + *(vu32 *)0x80003184 = 0x80000000; + + DCFlushRange((void*)0x80000000, 0x3f00); + + return 0; +} + +void PatchCountryStrings(void *Address, int Size) +{ + u8 SearchPattern[4] = {0x00, 0x00, 0x00, 0x00}; + u8 PatchData[4] = {0x00, 0x00, 0x00, 0x00}; + u8 *Addr = (u8*)Address; + int wiiregion = CONF_GetRegion(); + + switch (wiiregion) + { + case CONF_REGION_JP: + SearchPattern[0] = 0x00; + SearchPattern[1] = 'J'; + SearchPattern[2] = 'P'; + break; + case CONF_REGION_EU: + SearchPattern[0] = 0x02; + SearchPattern[1] = 'E'; + SearchPattern[2] = 'U'; + break; + case CONF_REGION_KR: + SearchPattern[0] = 0x04; + SearchPattern[1] = 'K'; + SearchPattern[2] = 'R'; + break; + case CONF_REGION_CN: + SearchPattern[0] = 0x05; + SearchPattern[1] = 'C'; + SearchPattern[2] = 'N'; + break; + case CONF_REGION_US: + default: + SearchPattern[0] = 0x01; + SearchPattern[1] = 'U'; + SearchPattern[2] = 'S'; + } + switch (((const u8 *)0x80000000)[3]) + { + case 'J': + PatchData[1] = 'J'; + PatchData[2] = 'P'; + break; + case 'D': + case 'F': + case 'P': + case 'X': + case 'Y': + PatchData[1] = 'E'; + PatchData[2] = 'U'; + break; + + case 'E': + default: + PatchData[1] = 'U'; + PatchData[2] = 'S'; + } + while (Size >= 4) + if (Addr[0] == SearchPattern[0] && Addr[1] == SearchPattern[1] && Addr[2] == SearchPattern[2] && Addr[3] == SearchPattern[3]) + { + //*Addr = PatchData[0]; + Addr += 1; + *Addr = PatchData[1]; + Addr += 1; + *Addr = PatchData[2]; + Addr += 1; + //*Addr = PatchData[3]; + Addr += 1; + Size -= 4; + } + else + { + Addr += 4; + Size -= 4; + } +} + +static bool PrinceOfPersiaPatch() +{ + if (memcmp("SPX", (char *)0x80000000, 3) == 0 || memcmp("RPW", (char *)0x80000000, 3) == 0) + { + u8 *p = (u8 *)0x807AEB6A; + *p++ = 0x6F; + *p++ = 0x6A; + *p++ = 0x7A; + *p++ = 0x6B; + p = (u8 *)0x807AEB75; + *p++ = 0x69; + *p++ = 0x39; + *p++ = 0x7C; + *p++ = 0x7A; + p = (u8 *)0x807AEB82; + *p++ = 0x68; + *p++ = 0x6B; + *p++ = 0x73; + *p++ = 0x76; + p = (u8 *)0x807AEB92; + *p++ = 0x75; + *p++ = 0x70; + *p++ = 0x80; + *p++ = 0x71; + p = (u8 *)0x807AEB9D; + *p++ = 0x6F; + *p++ = 0x3F; + *p++ = 0x82; + *p++ = 0x80; + return true; + } + return false; +} + +bool NewSuperMarioBrosPatch(void *Address, int Size) +{ + if (memcmp("SMN", (char *)0x80000000, 3) == 0) + { + u8 SearchPattern1[32] = {// PAL + 0x94, 0x21, 0xFF, 0xD0, 0x7C, 0x08, 0x02, 0xA6, + 0x90, 0x01, 0x00, 0x34, 0x39, 0x61, 0x00, 0x30, + 0x48, 0x12, 0xD9, 0x39, 0x7C, 0x7B, 0x1B, 0x78, + 0x7C, 0x9C, 0x23, 0x78, 0x7C, 0xBD, 0x2B, 0x78}; + u8 SearchPattern2[32] = {// NTSC + 0x94, 0x21, 0xFF, 0xD0, 0x7C, 0x08, 0x02, 0xA6, + 0x90, 0x01, 0x00, 0x34, 0x39, 0x61, 0x00, 0x30, + 0x48, 0x12, 0xD7, 0x89, 0x7C, 0x7B, 0x1B, 0x78, + 0x7C, 0x9C, 0x23, 0x78, 0x7C, 0xBD, 0x2B, 0x78}; + u8 PatchData[4] = {0x4E, 0x80, 0x00, 0x20}; + + void *Addr = Address; + void *Addr_end = Address+Size; + while (Addr <= Addr_end-sizeof(SearchPattern1)) + { + if ( memcmp(Addr, SearchPattern1, sizeof(SearchPattern1))==0 + || memcmp(Addr, SearchPattern2, sizeof(SearchPattern2))==0) + { + memcpy(Addr,PatchData,sizeof(PatchData)); + return true; + } + Addr += 4; + } + } + return false; +} + +static bool maindolpatches(void *dst, int len, u8 vidMode, GXRModeObj *vmode, bool vipatch, bool countryString, u8 patchVidModes) +{ + bool ret = false; + + DCFlushRange(dst, len); + + patchVideoModes(dst, len, vidMode, vmode, patchVidModes); + + if (hooktype != 0) ret = dogamehooks(dst, len, false); + if (vipatch) vidolpatcher(dst, len); + if (configbytes[0] != 0xCD) langpatcher(dst, len); + if (countryString) PatchCountryStrings(dst, len); // Country Patch by WiiPower + + Remove_001_Protection(dst, len); + + // NSMB Patch by WiiPower + NewSuperMarioBrosPatch(dst,len); + + do_wip_code((u8 *) dst, len); + + DCFlushRange(dst, len); + + return ret; +} + +static bool Remove_001_Protection(void *Address, int Size) +{ + static const u8 SearchPattern[] = {0x40, 0x82, 0x00, 0x0C, 0x38, 0x60, 0x00, 0x01, 0x48, 0x00, 0x02, 0x44, 0x38, 0x61, 0x00, 0x18}; + static const u8 PatchData[] = {0x40, 0x82, 0x00, 0x04, 0x38, 0x60, 0x00, 0x01, 0x48, 0x00, 0x02, 0x44, 0x38, 0x61, 0x00, 0x18}; + u8 *Addr_end = Address + Size; + u8 *Addr; + + for (Addr = Address; Addr <= Addr_end - sizeof SearchPattern; Addr += 4) + if (memcmp(Addr, SearchPattern, sizeof SearchPattern) == 0) + { + memcpy(Addr, PatchData, sizeof PatchData); + return true; + } + return false; +} \ No newline at end of file diff --git a/source/loader/apploader.h b/source/loader/apploader.h new file mode 100644 index 00000000..31f5901a --- /dev/null +++ b/source/loader/apploader.h @@ -0,0 +1,10 @@ +#ifndef _APPLOADER_H_ +#define _APPLOADER_H_ + +/* Entry point */ +typedef void (*entry_point)(void); + +/* Prototypes */ +s32 Apploader_Run(entry_point *, u8, GXRModeObj *vmode, bool, bool, u8); + +#endif diff --git a/source/loader/cios.cpp b/source/loader/cios.cpp new file mode 100644 index 00000000..ea124d9d --- /dev/null +++ b/source/loader/cios.cpp @@ -0,0 +1,105 @@ +/*************************************************************************** + * Copyright (C) 2011 + * by Dimok + * Modifications by xFede + * Wiiflowized and heavily improved by Miigotu + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + ***************************************************************************/ + + +#include +#include +#include +#include + +#include "cios.hpp" +#include "utils.h" +#include "mem2.hpp" +#include "fs.h" + +#define ARRAY_SIZE(a) (sizeof a / sizeof a[0]) + +static u32 allowedBases[] = { 37, 38, 53, 55, 56, 57, 58 }; + +/* Check if the cIOS is a D2X. */ +bool cIOSInfo::D2X(u8 ios, u8 *base) +{ + bool ret = false; + + iosinfo_t *info = GetInfo(ios); + if(info != NULL) + { + *base = (u8)info->baseios; + SAFE_FREE(info); + ret = true; + } + return ret; +} + +/* + * Reads the ios info struct from the .app file. + * @return pointer to iosinfo_t on success else NULL. The user is responsible for freeing the buffer. + */ + +iosinfo_t *cIOSInfo::GetInfo(u8 ios) +{ + u32 TMD_Length; + if (ES_GetStoredTMDSize(TITLE_ID(1, ios), &TMD_Length) < 0) return NULL; + + signed_blob *TMD = (signed_blob*) MEM2_alloc(ALIGN32(TMD_Length)); + if (!TMD) return NULL; + + if (ES_GetStoredTMD(TITLE_ID(1, ios), TMD, TMD_Length) < 0) + { + SAFE_FREE(TMD); + return NULL; + } + + char filepath[ISFS_MAXPATH] ATTRIBUTE_ALIGN(32); + sprintf(filepath, "/title/%08x/%08x/content/%08x.app", 0x00000001, ios, *(u8 *)((u32)TMD+0x1E7)); + + SAFE_FREE(TMD); + + u32 size = 0; + u8 *buffer = ISFS_GetFile((u8 *) filepath, &size, sizeof(iosinfo_t)); + if(!buffer) return NULL; + + iosinfo_t *iosinfo = (iosinfo_t *) buffer; + + bool baseMatch = false; + for(u8 i = 0; i < ARRAY_SIZE(allowedBases); i++) + if(iosinfo->baseios == allowedBases[i]) + { + baseMatch = true; + break; + } + + if(iosinfo->magicword != 0x1ee7c105 /* Magic Word */ + || iosinfo->magicversion != 1 /* Magic Version */ + || iosinfo->version < 6 /* Version */ + || !baseMatch /* Base */ + || strncasecmp(iosinfo->name, "d2x", 3) != 0) /* Name */ + { + SAFE_FREE(buffer); + return NULL; + } + return iosinfo; +} \ No newline at end of file diff --git a/source/loader/cios.hpp b/source/loader/cios.hpp new file mode 100644 index 00000000..795aa205 --- /dev/null +++ b/source/loader/cios.hpp @@ -0,0 +1,23 @@ +#ifndef _CIOSINFO_H_ +#define _CIOSINFO_H_ + +#include + +typedef struct _iosinfo_t +{ + u32 magicword; //0x1ee7c105 + u32 magicversion; // 1 + u32 version; // Example: 5 + u32 baseios; // Example: 56 + char name[0x10]; // Example: d2x + char versionstring[0x10]; // Example: beta2 +} __attribute__((packed)) iosinfo_t; + +class cIOSInfo +{ + public: + static bool D2X(u8 ios, u8 *base); + static iosinfo_t *GetInfo(u8 ios); +}; + +#endif \ No newline at end of file diff --git a/source/loader/codehandler.h b/source/loader/codehandler.h new file mode 100644 index 00000000..a5a80be1 --- /dev/null +++ b/source/loader/codehandler.h @@ -0,0 +1,277 @@ +/* + This file was autogenerated by raw2c. +Visit http://www.devkitpro.org +*/ + +const unsigned char codehandler[] = { + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0x00, 0x27, 0x74, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x94, 0x21, 0xff, 0x58, 0x90, 0x01, 0x00, 0x08, + 0x7c, 0x08, 0x02, 0xa6, 0x90, 0x01, 0x00, 0xac, 0x7c, 0x00, 0x00, 0x26, 0x90, 0x01, 0x00, 0x0c, + 0x7c, 0x09, 0x02, 0xa6, 0x90, 0x01, 0x00, 0x10, 0x7c, 0x01, 0x02, 0xa6, 0x90, 0x01, 0x00, 0x14, + 0xbc, 0x61, 0x00, 0x18, 0x7f, 0x20, 0x00, 0xa6, 0x63, 0x3a, 0x20, 0x00, 0x73, 0x5a, 0xf9, 0xff, + 0x7f, 0x40, 0x01, 0x24, 0xd8, 0x41, 0x00, 0x98, 0xd8, 0x61, 0x00, 0xa0, 0x3f, 0xe0, 0x80, 0x00, + 0x3e, 0x80, 0xcc, 0x00, 0xa3, 0x94, 0x40, 0x10, 0x63, 0x95, 0x00, 0xff, 0xb2, 0xb4, 0x40, 0x10, + 0x48, 0x00, 0x06, 0x55, 0x3a, 0xa0, 0x00, 0x00, 0x3a, 0xc0, 0x00, 0x19, 0x3a, 0xe0, 0x00, 0xd0, + 0x3f, 0x00, 0xcd, 0x00, 0x63, 0xf2, 0x27, 0x74, 0x80, 0x01, 0x00, 0xac, 0x90, 0x12, 0x00, 0x04, + 0x92, 0xb8, 0x64, 0x3c, 0x48, 0x00, 0x04, 0x2d, 0x41, 0x82, 0x05, 0xa4, 0x2c, 0x1d, 0x00, 0x04, + 0x40, 0x80, 0x00, 0x10, 0x2c, 0x1d, 0x00, 0x01, 0x41, 0x80, 0x05, 0x94, 0x48, 0x00, 0x03, 0x4c, + 0x41, 0x82, 0x04, 0xf0, 0x2c, 0x1d, 0x00, 0x06, 0x41, 0x82, 0x00, 0x8c, 0x2c, 0x1d, 0x00, 0x07, + 0x41, 0x82, 0x03, 0x30, 0x2c, 0x1d, 0x00, 0x08, 0x41, 0x82, 0x05, 0x80, 0x2c, 0x1d, 0x00, 0x09, + 0x41, 0x82, 0x00, 0xa0, 0x2c, 0x1d, 0x00, 0x10, 0x41, 0x82, 0x00, 0x98, 0x2c, 0x1d, 0x00, 0x2f, + 0x41, 0x82, 0x00, 0x70, 0x2c, 0x1d, 0x00, 0x30, 0x41, 0x82, 0x00, 0x78, 0x2c, 0x1d, 0x00, 0x38, + 0x41, 0x82, 0x05, 0x28, 0x2c, 0x1d, 0x00, 0x40, 0x41, 0x82, 0x03, 0x40, 0x2c, 0x1d, 0x00, 0x41, + 0x41, 0x82, 0x03, 0x58, 0x2c, 0x1d, 0x00, 0x44, 0x41, 0x82, 0x00, 0x68, 0x2c, 0x1d, 0x00, 0x50, + 0x41, 0x82, 0x00, 0x20, 0x2c, 0x1d, 0x00, 0x60, 0x41, 0x82, 0x00, 0x24, 0x2c, 0x1d, 0x00, 0x89, + 0x41, 0x82, 0x00, 0x50, 0x2c, 0x1d, 0x00, 0x99, 0x41, 0x82, 0x05, 0x0c, 0x48, 0x00, 0x05, 0x10, + 0x80, 0x72, 0x00, 0x00, 0x48, 0x00, 0x04, 0x29, 0x48, 0x00, 0x05, 0x04, 0x48, 0x00, 0x05, 0x89, + 0x48, 0x00, 0x04, 0xfc, 0x38, 0x80, 0x00, 0x01, 0x90, 0x92, 0x00, 0x00, 0x48, 0x00, 0x04, 0xf0, + 0x48, 0x00, 0x04, 0x09, 0x3a, 0x00, 0x00, 0xa0, 0x63, 0xec, 0x27, 0x98, 0x48, 0x00, 0x03, 0x14, + 0x38, 0x60, 0x01, 0x20, 0x63, 0xec, 0x27, 0x98, 0x48, 0x00, 0x03, 0xc9, 0x48, 0x00, 0x04, 0xd0, + 0x2f, 0x1d, 0x00, 0x10, 0x2e, 0x9d, 0x00, 0x44, 0x63, 0xe4, 0x1a, 0xb4, 0x3c, 0x60, 0x80, 0x00, + 0x60, 0x63, 0x03, 0x00, 0x48, 0x00, 0x05, 0x09, 0x38, 0x63, 0x0a, 0x00, 0x48, 0x00, 0x05, 0x01, + 0x38, 0x63, 0x06, 0x00, 0x48, 0x00, 0x04, 0xf9, 0x63, 0xec, 0x27, 0x88, 0x92, 0xac, 0x00, 0x00, + 0x92, 0xac, 0x00, 0x04, 0x92, 0xac, 0x00, 0x08, 0x63, 0xe4, 0x27, 0x98, 0x81, 0x24, 0x00, 0x18, + 0x80, 0x72, 0x00, 0x00, 0x2c, 0x03, 0x00, 0x02, 0x40, 0x82, 0x00, 0x0c, 0x41, 0x96, 0x00, 0x0c, + 0x48, 0x00, 0x00, 0x20, 0x38, 0x60, 0x00, 0x00, 0x90, 0x6c, 0x00, 0x0c, 0x40, 0x82, 0x00, 0x14, + 0x40, 0x96, 0x00, 0x10, 0x61, 0x29, 0x04, 0x00, 0x91, 0x24, 0x00, 0x18, 0x48, 0x00, 0x02, 0x14, + 0x55, 0x29, 0x05, 0xa8, 0x91, 0x24, 0x00, 0x18, 0x41, 0x96, 0x04, 0x54, 0x41, 0x9a, 0x00, 0x08, + 0x39, 0x8c, 0x00, 0x04, 0x38, 0x60, 0x00, 0x04, 0x48, 0x00, 0x03, 0x09, 0x40, 0x99, 0x00, 0x10, + 0x39, 0x8c, 0x00, 0x04, 0x38, 0x60, 0x00, 0x04, 0x48, 0x00, 0x02, 0xf9, 0x63, 0xe4, 0x27, 0x88, + 0x80, 0x64, 0x00, 0x00, 0x80, 0x84, 0x00, 0x04, 0x7c, 0x72, 0xfb, 0xa6, 0x7c, 0x95, 0xfb, 0xa6, + 0x48, 0x00, 0x04, 0x1c, 0x7c, 0x32, 0x43, 0xa6, 0x7c, 0x3a, 0x02, 0xa6, 0x7c, 0x73, 0x43, 0xa6, + 0x7c, 0x7b, 0x02, 0xa6, 0x54, 0x63, 0x05, 0xa8, 0x90, 0x60, 0x27, 0xb0, 0x54, 0x63, 0x06, 0x1e, + 0x60, 0x63, 0x20, 0x00, 0x7c, 0x7b, 0x03, 0xa6, 0x3c, 0x60, 0x80, 0x00, 0x60, 0x63, 0x1a, 0xe8, + 0x7c, 0x7a, 0x03, 0xa6, 0x4c, 0x00, 0x00, 0x64, 0x3c, 0x60, 0x80, 0x00, 0x60, 0x63, 0x27, 0x98, + 0x90, 0x23, 0x00, 0x14, 0x7c, 0x61, 0x1b, 0x78, 0x7c, 0x73, 0x42, 0xa6, 0xbc, 0x41, 0x00, 0x24, + 0x7c, 0x24, 0x0b, 0x78, 0x7c, 0x32, 0x42, 0xa6, 0x90, 0x04, 0x00, 0x1c, 0x90, 0x24, 0x00, 0x20, + 0x7c, 0x68, 0x02, 0xa6, 0x90, 0x64, 0x00, 0x9c, 0x7c, 0x60, 0x00, 0x26, 0x90, 0x64, 0x00, 0x00, + 0x7c, 0x61, 0x02, 0xa6, 0x90, 0x64, 0x00, 0x04, 0x7c, 0x69, 0x02, 0xa6, 0x90, 0x64, 0x00, 0x08, + 0x7c, 0x72, 0x02, 0xa6, 0x90, 0x64, 0x00, 0x0c, 0x7c, 0x73, 0x02, 0xa6, 0x90, 0x64, 0x00, 0x10, + 0x39, 0x20, 0x00, 0x00, 0x7d, 0x32, 0xfb, 0xa6, 0x7d, 0x35, 0xfb, 0xa6, 0x3c, 0xa0, 0x80, 0x00, + 0x60, 0xa5, 0x1b, 0x70, 0x3f, 0xe0, 0xd0, 0x04, 0x63, 0xff, 0x00, 0xa0, 0x93, 0xe5, 0x00, 0x00, + 0x7c, 0x00, 0x28, 0x6c, 0x7c, 0x00, 0x04, 0xac, 0x7c, 0x00, 0x2f, 0xac, 0x4c, 0x00, 0x01, 0x2c, + 0xd0, 0x04, 0x00, 0xa0, 0x3b, 0xff, 0x00, 0x04, 0x3f, 0xff, 0x00, 0x20, 0x57, 0xf0, 0x01, 0x4b, + 0x41, 0x82, 0xff, 0xdc, 0x3f, 0xe0, 0x80, 0x00, 0x63, 0xe5, 0x27, 0x88, 0x82, 0x05, 0x00, 0x00, + 0x82, 0x25, 0x00, 0x04, 0x82, 0x65, 0x00, 0x0c, 0x2c, 0x13, 0x00, 0x00, 0x41, 0x82, 0x00, 0x74, + 0x2c, 0x13, 0x00, 0x02, 0x40, 0x82, 0x00, 0x18, 0x81, 0x24, 0x00, 0x14, 0x39, 0x33, 0x00, 0x03, + 0x91, 0x25, 0x00, 0x00, 0x91, 0x25, 0x00, 0x0c, 0x48, 0x00, 0x00, 0x6c, 0x7c, 0x10, 0x98, 0x00, + 0x41, 0x82, 0x00, 0x38, 0x7c, 0x11, 0x98, 0x00, 0x41, 0x82, 0x00, 0x30, 0x7d, 0x30, 0x8a, 0x14, + 0x91, 0x25, 0x00, 0x0c, 0x82, 0x05, 0x00, 0x08, 0x2c, 0x10, 0x00, 0x00, 0x41, 0x82, 0x00, 0x48, + 0x80, 0x64, 0x00, 0x10, 0x7c, 0x10, 0x18, 0x00, 0x40, 0x82, 0x00, 0x10, 0x3a, 0x00, 0x00, 0x00, + 0x92, 0x05, 0x00, 0x08, 0x48, 0x00, 0x00, 0x30, 0x3a, 0x20, 0x00, 0x00, 0x92, 0x25, 0x00, 0x0c, + 0x81, 0x24, 0x00, 0x18, 0x61, 0x29, 0x04, 0x00, 0x91, 0x24, 0x00, 0x18, 0x48, 0x00, 0x00, 0x30, + 0x7e, 0x12, 0xfb, 0xa6, 0x7e, 0x35, 0xfb, 0xa6, 0x39, 0x20, 0x00, 0x01, 0x91, 0x25, 0x00, 0x0c, + 0x48, 0x00, 0x00, 0x1c, 0x38, 0xa0, 0x00, 0x02, 0x63, 0xe4, 0x27, 0x74, 0x90, 0xa4, 0x00, 0x00, + 0x38, 0x60, 0x00, 0x11, 0x48, 0x00, 0x01, 0xb9, 0x4b, 0xff, 0xfc, 0x71, 0x7c, 0x20, 0x00, 0xa6, + 0x54, 0x21, 0x07, 0xfa, 0x54, 0x21, 0x04, 0x5e, 0x7c, 0x20, 0x01, 0x24, 0x63, 0xe1, 0x27, 0x98, + 0x80, 0x61, 0x00, 0x00, 0x7c, 0x6f, 0xf1, 0x20, 0x80, 0x61, 0x00, 0x14, 0x7c, 0x7a, 0x03, 0xa6, + 0x80, 0x61, 0x00, 0x18, 0x7c, 0x7b, 0x03, 0xa6, 0x80, 0x61, 0x00, 0x9c, 0x7c, 0x68, 0x03, 0xa6, + 0xb8, 0x41, 0x00, 0x24, 0x80, 0x01, 0x00, 0x1c, 0x80, 0x21, 0x00, 0x20, 0x4c, 0x00, 0x00, 0x64, + 0x92, 0xb2, 0x00, 0x00, 0x48, 0x00, 0x02, 0x54, 0x2e, 0x9d, 0x00, 0x02, 0x38, 0x60, 0x00, 0x08, + 0x63, 0xec, 0x27, 0x7c, 0x48, 0x00, 0x00, 0xfd, 0x80, 0xac, 0x00, 0x00, 0x80, 0x6c, 0x00, 0x04, + 0x98, 0x65, 0x00, 0x00, 0x41, 0x94, 0x00, 0x10, 0xb0, 0x65, 0x00, 0x00, 0x41, 0x96, 0x00, 0x08, + 0x90, 0x65, 0x00, 0x00, 0x7c, 0x00, 0x28, 0xac, 0x7c, 0x00, 0x04, 0xac, 0x7c, 0x00, 0x2f, 0xac, + 0x4c, 0x00, 0x01, 0x2c, 0x48, 0x00, 0x02, 0x08, 0x48, 0x00, 0x01, 0x21, 0x38, 0x60, 0x00, 0x04, + 0x63, 0xec, 0x27, 0x7c, 0x48, 0x00, 0x00, 0xbd, 0x82, 0x0c, 0x00, 0x00, 0x3d, 0x80, 0x80, 0x00, + 0x61, 0x8c, 0x28, 0xb8, 0x48, 0x00, 0x00, 0x1c, 0x48, 0x00, 0x01, 0x01, 0x38, 0x60, 0x00, 0x08, + 0x63, 0xec, 0x27, 0x7c, 0x48, 0x00, 0x00, 0x9d, 0x82, 0x0c, 0x00, 0x04, 0x81, 0x8c, 0x00, 0x00, + 0x63, 0xfb, 0x27, 0x84, 0x3a, 0x20, 0x0f, 0x80, 0x48, 0x00, 0x02, 0x39, 0x41, 0x82, 0x00, 0x20, + 0x7e, 0x23, 0x8b, 0x78, 0x48, 0x00, 0x00, 0x7d, 0x48, 0x00, 0x00, 0xd1, 0x41, 0x82, 0xff, 0xfc, + 0x7d, 0x8c, 0x72, 0x14, 0x35, 0x6b, 0xff, 0xff, 0x41, 0x81, 0xff, 0xe8, 0x80, 0x7b, 0x00, 0x00, + 0x2c, 0x03, 0x00, 0x00, 0x41, 0x82, 0x00, 0x08, 0x48, 0x00, 0x00, 0x59, 0x7c, 0x00, 0x60, 0xac, + 0x7c, 0x00, 0x04, 0xac, 0x7c, 0x00, 0x67, 0xac, 0x4c, 0x00, 0x01, 0x2c, 0x48, 0x00, 0x01, 0x80, + 0x7f, 0xc8, 0x02, 0xa6, 0x3c, 0x60, 0xa0, 0x00, 0x48, 0x00, 0x00, 0x15, 0x76, 0x03, 0x08, 0x00, + 0x56, 0x1d, 0x86, 0x3e, 0x7f, 0xc8, 0x03, 0xa6, 0x4e, 0x80, 0x00, 0x20, 0x92, 0xf8, 0x68, 0x14, + 0x90, 0x78, 0x68, 0x24, 0x92, 0xd8, 0x68, 0x20, 0x80, 0xb8, 0x68, 0x20, 0x70, 0xa5, 0x00, 0x01, + 0x40, 0x82, 0xff, 0xf8, 0x82, 0x18, 0x68, 0x24, 0x90, 0xb8, 0x68, 0x14, 0x4e, 0x80, 0x00, 0x20, + 0x7d, 0x48, 0x02, 0xa6, 0x7c, 0x69, 0x03, 0xa6, 0x39, 0xc0, 0x00, 0x00, 0x48, 0x00, 0x00, 0x79, + 0x48, 0x00, 0x00, 0x75, 0x4b, 0xff, 0xff, 0xad, 0x41, 0x82, 0xff, 0xf4, 0x7f, 0xae, 0x61, 0xae, + 0x39, 0xce, 0x00, 0x01, 0x42, 0x00, 0xff, 0xe8, 0x7d, 0x48, 0x03, 0xa6, 0x4e, 0x80, 0x00, 0x20, + 0x7d, 0x48, 0x02, 0xa6, 0x7c, 0x69, 0x03, 0xa6, 0x39, 0xc0, 0x00, 0x00, 0x7c, 0x6c, 0x70, 0xae, + 0x48, 0x00, 0x00, 0x1d, 0x41, 0x82, 0xff, 0xf8, 0x39, 0xce, 0x00, 0x01, 0x42, 0x00, 0xff, 0xf0, + 0x7d, 0x48, 0x03, 0xa6, 0x4e, 0x80, 0x00, 0x20, 0x38, 0x60, 0x00, 0xaa, 0x7f, 0xc8, 0x02, 0xa6, + 0x54, 0x63, 0xa0, 0x16, 0x64, 0x63, 0xb0, 0x00, 0x3a, 0xc0, 0x00, 0x19, 0x3a, 0xe0, 0x00, 0xd0, + 0x3f, 0x00, 0xcd, 0x00, 0x4b, 0xff, 0xff, 0x69, 0x56, 0x03, 0x37, 0xff, 0x7f, 0xc8, 0x03, 0xa6, + 0x4e, 0x80, 0x00, 0x20, 0x7f, 0xc8, 0x02, 0xa6, 0x3c, 0x60, 0xd0, 0x00, 0x4b, 0xff, 0xff, 0x51, + 0x56, 0x03, 0x37, 0xff, 0x41, 0x82, 0xff, 0xf4, 0x7f, 0xc8, 0x03, 0xa6, 0x4e, 0x80, 0x00, 0x20, + 0x4b, 0xff, 0xff, 0xb9, 0x38, 0x60, 0x00, 0x08, 0x63, 0xec, 0x27, 0x7c, 0x4b, 0xff, 0xff, 0x55, + 0x80, 0xac, 0x00, 0x04, 0x81, 0x8c, 0x00, 0x00, 0x63, 0xfb, 0x27, 0x84, 0x62, 0xb1, 0xf8, 0x00, + 0x7e, 0x0c, 0x28, 0x50, 0x48, 0x00, 0x00, 0xed, 0x41, 0x81, 0x00, 0x10, 0x82, 0x3b, 0x00, 0x00, + 0x2c, 0x11, 0x00, 0x00, 0x41, 0x82, 0x00, 0x68, 0x7e, 0x23, 0x8b, 0x78, 0x4b, 0xff, 0xff, 0x55, + 0x4b, 0xff, 0xff, 0xa5, 0x4b, 0xff, 0xff, 0xa1, 0x4b, 0xff, 0xfe, 0xd9, 0x41, 0x82, 0xff, 0xf4, + 0x2c, 0x1d, 0x00, 0xcc, 0x41, 0x82, 0x00, 0x48, 0x2c, 0x1d, 0x00, 0xbb, 0x41, 0x82, 0xff, 0xdc, + 0x2c, 0x1d, 0x00, 0xaa, 0x40, 0x82, 0xff, 0xdc, 0x7d, 0x8c, 0x72, 0x14, 0x35, 0x6b, 0xff, 0xff, + 0x41, 0x80, 0x00, 0x2c, 0x4b, 0xff, 0xff, 0xb4, 0x7e, 0xb5, 0xfb, 0xa6, 0x7e, 0xb2, 0xfb, 0xa6, + 0x63, 0xe4, 0x27, 0x98, 0x81, 0x24, 0x00, 0x18, 0x55, 0x29, 0x05, 0xa8, 0x91, 0x24, 0x00, 0x18, + 0x48, 0x00, 0x00, 0x0c, 0x38, 0x60, 0x00, 0x80, 0x4b, 0xff, 0xff, 0x25, 0x80, 0x92, 0x00, 0x00, + 0x2c, 0x04, 0x00, 0x00, 0x40, 0x82, 0xfa, 0x50, 0xb3, 0x94, 0x40, 0x10, 0xc8, 0x41, 0x00, 0x98, + 0xc8, 0x61, 0x00, 0xa0, 0x7f, 0x20, 0x00, 0xa6, 0x80, 0x01, 0x00, 0xac, 0x7c, 0x08, 0x03, 0xa6, + 0x80, 0x01, 0x00, 0x0c, 0x7c, 0x0f, 0xf1, 0x20, 0x80, 0x01, 0x00, 0x10, 0x7c, 0x09, 0x03, 0xa6, + 0x80, 0x01, 0x00, 0x14, 0x7c, 0x01, 0x03, 0xa6, 0xb8, 0x61, 0x00, 0x18, 0x80, 0x01, 0x00, 0x08, + 0x38, 0x21, 0x00, 0xa8, 0x4c, 0x00, 0x01, 0x2c, 0x4e, 0x80, 0x00, 0x20, 0x7e, 0x23, 0x20, 0x50, + 0x3c, 0xa0, 0x48, 0x00, 0x52, 0x25, 0x01, 0xba, 0x90, 0xa3, 0x00, 0x00, 0x7c, 0x00, 0x18, 0xac, + 0x7c, 0x00, 0x04, 0xac, 0x7c, 0x00, 0x1f, 0xac, 0x4c, 0x00, 0x01, 0x2c, 0x4e, 0x80, 0x00, 0x20, + 0x7d, 0x70, 0x8b, 0xd7, 0x7d, 0x4b, 0x89, 0xd6, 0x7d, 0x4a, 0x80, 0x50, 0x91, 0x5b, 0x00, 0x00, + 0x4e, 0x80, 0x00, 0x20, 0x7f, 0xa8, 0x02, 0xa6, 0x3d, 0xe0, 0x80, 0x00, 0x61, 0xef, 0x28, 0xb8, + 0x63, 0xe7, 0x18, 0x08, 0x3c, 0xc0, 0x80, 0x00, 0x7c, 0xd0, 0x33, 0x78, 0x39, 0x00, 0x00, 0x00, + 0x3c, 0x60, 0x00, 0xd0, 0x60, 0x63, 0xc0, 0xde, 0x80, 0x8f, 0x00, 0x00, 0x7c, 0x03, 0x20, 0x00, + 0x40, 0x82, 0x00, 0x18, 0x80, 0x8f, 0x00, 0x04, 0x7c, 0x03, 0x20, 0x00, 0x40, 0x82, 0x00, 0x0c, + 0x39, 0xef, 0x00, 0x08, 0x48, 0x00, 0x00, 0x0c, 0x7f, 0xa8, 0x03, 0xa6, 0x4e, 0x80, 0x00, 0x20, + 0x80, 0x6f, 0x00, 0x00, 0x80, 0x8f, 0x00, 0x04, 0x39, 0xef, 0x00, 0x08, 0x71, 0x09, 0x00, 0x01, + 0x2f, 0x89, 0x00, 0x00, 0x39, 0x20, 0x00, 0x00, 0x54, 0x6a, 0x1f, 0x7e, 0x54, 0x65, 0x3f, 0x7e, + 0x74, 0x6b, 0x10, 0x00, 0x54, 0x63, 0x01, 0xfe, 0x40, 0x82, 0x00, 0x0c, 0x54, 0xcc, 0x00, 0x0c, + 0x48, 0x00, 0x00, 0x08, 0x7e, 0x0c, 0x83, 0x78, 0x2e, 0x05, 0x00, 0x00, 0x2c, 0x0a, 0x00, 0x01, + 0x41, 0xa0, 0x00, 0x2c, 0x41, 0xa2, 0x00, 0xe4, 0x2c, 0x0a, 0x00, 0x03, 0x41, 0xa0, 0x01, 0xac, + 0x41, 0x82, 0x02, 0x50, 0x2c, 0x0a, 0x00, 0x05, 0x41, 0x80, 0x02, 0xd4, 0x41, 0xa2, 0x04, 0xe0, + 0x2c, 0x0a, 0x00, 0x07, 0x41, 0xa0, 0x05, 0x0c, 0x48, 0x00, 0x05, 0xf0, 0x7d, 0x8c, 0x1a, 0x14, + 0x2c, 0x05, 0x00, 0x03, 0x41, 0x82, 0x00, 0x48, 0x41, 0x81, 0x00, 0x60, 0x40, 0xbe, 0xff, 0x84, + 0x2e, 0x05, 0x00, 0x01, 0x41, 0x91, 0x00, 0x2c, 0x54, 0x8a, 0x84, 0x3e, 0x41, 0x92, 0x00, 0x10, + 0x7c, 0x89, 0x61, 0xae, 0x39, 0x29, 0x00, 0x01, 0x48, 0x00, 0x00, 0x0c, 0x7c, 0x89, 0x63, 0x2e, + 0x39, 0x29, 0x00, 0x02, 0x35, 0x4a, 0xff, 0xff, 0x40, 0xa0, 0xff, 0xe4, 0x4b, 0xff, 0xff, 0x54, + 0x55, 0x8c, 0x00, 0x3a, 0x90, 0x8c, 0x00, 0x00, 0x4b, 0xff, 0xff, 0x48, 0x7c, 0x89, 0x23, 0x78, + 0x40, 0x9e, 0x04, 0xc8, 0x35, 0x29, 0xff, 0xff, 0x41, 0x80, 0x04, 0xc0, 0x7c, 0xa9, 0x78, 0xae, + 0x7c, 0xa9, 0x61, 0xae, 0x4b, 0xff, 0xff, 0xf0, 0x39, 0xef, 0x00, 0x08, 0x40, 0xbe, 0xff, 0x24, + 0x80, 0xaf, 0xff, 0xf8, 0x81, 0x6f, 0xff, 0xfc, 0x54, 0xb1, 0x04, 0x3e, 0x54, 0xaa, 0x85, 0x3e, + 0x54, 0xa5, 0x27, 0x3e, 0x2e, 0x85, 0x00, 0x01, 0x41, 0x96, 0x00, 0x10, 0x41, 0xb5, 0x00, 0x14, + 0x7c, 0x89, 0x61, 0xae, 0x48, 0x00, 0x00, 0x10, 0x7c, 0x89, 0x63, 0x2e, 0x48, 0x00, 0x00, 0x08, + 0x7c, 0x89, 0x61, 0x2e, 0x7c, 0x84, 0x5a, 0x14, 0x7d, 0x29, 0x8a, 0x14, 0x35, 0x4a, 0xff, 0xff, + 0x40, 0x80, 0xff, 0xd4, 0x4b, 0xff, 0xfe, 0xdc, 0x54, 0x69, 0x07, 0xff, 0x41, 0x82, 0x00, 0x10, + 0x55, 0x08, 0xf8, 0x7e, 0x71, 0x09, 0x00, 0x01, 0x2f, 0x89, 0x00, 0x00, 0x2e, 0x85, 0x00, 0x04, + 0x2d, 0x8a, 0x00, 0x05, 0x51, 0x08, 0x08, 0x3c, 0x40, 0x9e, 0x00, 0x78, 0x41, 0x8d, 0x04, 0xb8, + 0x7d, 0x8c, 0x1a, 0x14, 0x41, 0x8c, 0x00, 0x0c, 0x41, 0x94, 0x00, 0x30, 0x48, 0x00, 0x00, 0x1c, + 0x40, 0x94, 0x00, 0x10, 0x55, 0x8c, 0x00, 0x3a, 0x81, 0x6c, 0x00, 0x00, 0x48, 0x00, 0x00, 0x1c, + 0x55, 0x8c, 0x00, 0x3c, 0xa1, 0x6c, 0x00, 0x00, 0x7c, 0x89, 0x20, 0xf8, 0x55, 0x29, 0x84, 0x3e, + 0x7d, 0x6b, 0x48, 0x38, 0x54, 0x84, 0x04, 0x3e, 0x7f, 0x0b, 0x20, 0x40, 0x70, 0xa9, 0x00, 0x03, + 0x41, 0x82, 0x00, 0x18, 0x2c, 0x09, 0x00, 0x02, 0x41, 0x82, 0x00, 0x18, 0x41, 0x81, 0x00, 0x1c, + 0x40, 0x9a, 0x00, 0x20, 0x48, 0x00, 0x00, 0x18, 0x41, 0x9a, 0x00, 0x18, 0x48, 0x00, 0x00, 0x10, + 0x41, 0x99, 0x00, 0x10, 0x48, 0x00, 0x00, 0x08, 0x41, 0x98, 0x00, 0x08, 0x61, 0x08, 0x00, 0x01, + 0x40, 0x8e, 0xfe, 0x40, 0x41, 0x94, 0xfe, 0x3c, 0x81, 0x6f, 0xff, 0xf8, 0x40, 0x9e, 0x00, 0x20, + 0x70, 0x6c, 0x00, 0x08, 0x41, 0x82, 0x00, 0x0c, 0x71, 0x0c, 0x00, 0x01, 0x41, 0x82, 0x00, 0x10, + 0x39, 0x8b, 0x00, 0x10, 0x51, 0x8b, 0x03, 0x36, 0x48, 0x00, 0x00, 0x08, 0x55, 0x6b, 0x07, 0x16, + 0x91, 0x6f, 0xff, 0xf8, 0x4b, 0xff, 0xfe, 0x0c, 0x40, 0xbe, 0xfe, 0x08, 0x54, 0x69, 0x16, 0xba, + 0x54, 0x6e, 0x87, 0xfe, 0x2d, 0x8e, 0x00, 0x00, 0x2e, 0x05, 0x00, 0x04, 0x70, 0xae, 0x00, 0x03, + 0x2e, 0x8e, 0x00, 0x02, 0x41, 0x94, 0x00, 0x14, 0x41, 0x96, 0x00, 0x50, 0x7c, 0x64, 0x07, 0x34, + 0x7c, 0x84, 0x7a, 0x14, 0x48, 0x00, 0x00, 0x68, 0x54, 0x65, 0xa7, 0xff, 0x41, 0x82, 0x00, 0x0c, + 0x7d, 0x27, 0x48, 0x2e, 0x7c, 0x84, 0x4a, 0x14, 0x41, 0x8e, 0x00, 0x08, 0x7c, 0x8c, 0x22, 0x14, + 0x2e, 0x8e, 0x00, 0x01, 0x41, 0x96, 0x00, 0x08, 0x80, 0x84, 0x00, 0x00, 0x54, 0x63, 0x67, 0xff, + 0x41, 0x82, 0x00, 0x3c, 0x40, 0x90, 0x00, 0x0c, 0x7c, 0x84, 0x32, 0x14, 0x48, 0x00, 0x00, 0x30, + 0x7c, 0x84, 0x82, 0x14, 0x48, 0x00, 0x00, 0x28, 0x54, 0x65, 0xa7, 0xff, 0x41, 0x82, 0x00, 0x0c, + 0x7d, 0x27, 0x48, 0x2e, 0x7c, 0x84, 0x4a, 0x14, 0x40, 0x90, 0x00, 0x0c, 0x7c, 0xcc, 0x21, 0x2e, + 0x4b, 0xff, 0xfd, 0x80, 0x7e, 0x0c, 0x21, 0x2e, 0x4b, 0xff, 0xfd, 0x78, 0x40, 0x90, 0x00, 0x0c, + 0x7c, 0x86, 0x23, 0x78, 0x4b, 0xff, 0xfd, 0x6c, 0x7c, 0x90, 0x23, 0x78, 0x4b, 0xff, 0xfd, 0x64, + 0x54, 0x89, 0x1e, 0x78, 0x39, 0x29, 0x00, 0x40, 0x2c, 0x05, 0x00, 0x02, 0x41, 0x80, 0x00, 0x48, + 0x54, 0x6b, 0x50, 0x03, 0x41, 0x82, 0x00, 0x14, 0x41, 0x81, 0x00, 0x08, 0x48, 0x00, 0x00, 0x10, + 0x41, 0xbe, 0xfd, 0x40, 0x48, 0x00, 0x00, 0x08, 0x40, 0xbe, 0xfd, 0x38, 0x2c, 0x05, 0x00, 0x03, + 0x41, 0x81, 0x00, 0x10, 0x41, 0xa2, 0x00, 0x10, 0x7d, 0xe7, 0x48, 0x2e, 0x4b, 0xff, 0xfd, 0x24, + 0x7d, 0xe7, 0x49, 0x2e, 0x7c, 0x64, 0x07, 0x34, 0x54, 0x84, 0x1a, 0x78, 0x7d, 0xef, 0x22, 0x14, + 0x4b, 0xff, 0xfd, 0x10, 0x40, 0xbe, 0xfd, 0x0c, 0x7c, 0xa7, 0x4a, 0x14, 0x40, 0x92, 0x00, 0x14, + 0x54, 0x64, 0x04, 0x3e, 0x91, 0xe5, 0x00, 0x00, 0x90, 0x85, 0x00, 0x04, 0x4b, 0xff, 0xfc, 0xf4, + 0x81, 0x25, 0x00, 0x04, 0x2c, 0x09, 0x00, 0x00, 0x41, 0xa2, 0xfc, 0xe8, 0x39, 0x29, 0xff, 0xff, + 0x91, 0x25, 0x00, 0x04, 0x81, 0xe5, 0x00, 0x00, 0x4b, 0xff, 0xfc, 0xd8, 0x40, 0xbe, 0xfc, 0xd4, + 0x54, 0x6b, 0x16, 0xba, 0x7f, 0x47, 0x5a, 0x14, 0x81, 0x3a, 0x00, 0x00, 0x54, 0x6e, 0x67, 0xbe, + 0x41, 0x92, 0x00, 0x84, 0x2e, 0x05, 0x00, 0x05, 0x40, 0x90, 0x01, 0x74, 0x2e, 0x05, 0x00, 0x03, + 0x40, 0x90, 0x00, 0x90, 0x2e, 0x05, 0x00, 0x01, 0x54, 0x65, 0x87, 0xff, 0x41, 0x82, 0x00, 0x08, + 0x7c, 0x8c, 0x22, 0x14, 0x2f, 0x0e, 0x00, 0x01, 0x40, 0x92, 0x00, 0x24, 0x41, 0xb9, 0x00, 0x18, + 0x41, 0x9a, 0x00, 0x0c, 0x88, 0x84, 0x00, 0x00, 0x48, 0x00, 0x00, 0xf8, 0xa0, 0x84, 0x00, 0x00, + 0x48, 0x00, 0x00, 0xf0, 0x80, 0x84, 0x00, 0x00, 0x48, 0x00, 0x00, 0xe8, 0x54, 0x73, 0xe5, 0x3e, + 0x41, 0xb9, 0x00, 0x20, 0x41, 0x9a, 0x00, 0x10, 0x99, 0x24, 0x00, 0x00, 0x38, 0x84, 0x00, 0x01, + 0x48, 0x00, 0x00, 0x18, 0xb1, 0x24, 0x00, 0x00, 0x38, 0x84, 0x00, 0x02, 0x48, 0x00, 0x00, 0x0c, + 0x91, 0x24, 0x00, 0x00, 0x38, 0x84, 0x00, 0x04, 0x36, 0x73, 0xff, 0xff, 0x40, 0x80, 0xff, 0xd4, + 0x4b, 0xff, 0xfc, 0x40, 0x54, 0x65, 0x87, 0xff, 0x41, 0x82, 0x00, 0x08, 0x7c, 0x84, 0x62, 0x14, + 0x71, 0xc5, 0x00, 0x01, 0x41, 0x82, 0x00, 0x9c, 0x7c, 0x84, 0x4a, 0x14, 0x48, 0x00, 0x00, 0x94, + 0x54, 0x6a, 0x87, 0xbe, 0x54, 0x8e, 0x16, 0xba, 0x7e, 0x67, 0x72, 0x14, 0x40, 0x92, 0x00, 0x08, + 0x3a, 0x6f, 0xff, 0xfc, 0x80, 0x9a, 0x00, 0x00, 0x81, 0x33, 0x00, 0x00, 0x71, 0x4b, 0x00, 0x01, + 0x41, 0x82, 0x00, 0x08, 0x7c, 0x9a, 0x23, 0x78, 0x71, 0x4b, 0x00, 0x02, 0x41, 0x82, 0x00, 0x10, + 0x7d, 0x33, 0x4b, 0x78, 0x40, 0xb2, 0x00, 0x08, 0x7e, 0x6c, 0x9a, 0x14, 0x54, 0x65, 0x67, 0x3f, + 0x2c, 0x05, 0x00, 0x09, 0x40, 0x80, 0x00, 0x54, 0x48, 0x00, 0x00, 0x79, 0x7c, 0x89, 0x22, 0x14, + 0x48, 0x00, 0x00, 0x40, 0x7c, 0x89, 0x21, 0xd6, 0x48, 0x00, 0x00, 0x38, 0x7d, 0x24, 0x23, 0x78, + 0x48, 0x00, 0x00, 0x30, 0x7d, 0x24, 0x20, 0x38, 0x48, 0x00, 0x00, 0x28, 0x7d, 0x24, 0x22, 0x78, + 0x48, 0x00, 0x00, 0x20, 0x7d, 0x24, 0x20, 0x30, 0x48, 0x00, 0x00, 0x18, 0x7d, 0x24, 0x24, 0x30, + 0x48, 0x00, 0x00, 0x10, 0x5d, 0x24, 0x20, 0x3e, 0x48, 0x00, 0x00, 0x08, 0x7d, 0x24, 0x26, 0x30, + 0x90, 0x9a, 0x00, 0x00, 0x4b, 0xff, 0xfb, 0x8c, 0x2c, 0x05, 0x00, 0x0a, 0x41, 0x81, 0xfb, 0x84, + 0xc0, 0x5a, 0x00, 0x00, 0xc0, 0x73, 0x00, 0x00, 0x41, 0x82, 0x00, 0x0c, 0xec, 0x43, 0x10, 0x2a, + 0x48, 0x00, 0x00, 0x08, 0xec, 0x43, 0x00, 0xb2, 0xd0, 0x5a, 0x00, 0x00, 0x4b, 0xff, 0xfb, 0x64, + 0x7d, 0x48, 0x02, 0xa6, 0x54, 0xa5, 0x1e, 0x78, 0x7d, 0x4a, 0x2a, 0x14, 0x80, 0x9a, 0x00, 0x00, + 0x81, 0x33, 0x00, 0x00, 0x7d, 0x48, 0x03, 0xa6, 0x4e, 0x80, 0x00, 0x20, 0x40, 0xbe, 0xfb, 0x44, + 0x54, 0x69, 0xc0, 0x3e, 0x7d, 0x8e, 0x63, 0x78, 0x48, 0x00, 0x00, 0x35, 0x41, 0x92, 0x00, 0x0c, + 0x7e, 0x31, 0x22, 0x14, 0x48, 0x00, 0x00, 0x08, 0x7d, 0x29, 0x22, 0x14, 0x54, 0x64, 0xc4, 0x3f, + 0x38, 0xa0, 0x00, 0x00, 0x41, 0x82, 0xfb, 0x1c, 0x7d, 0x45, 0x88, 0xae, 0x7d, 0x45, 0x49, 0xae, + 0x38, 0xa5, 0x00, 0x01, 0x7c, 0x05, 0x20, 0x00, 0x4b, 0xff, 0xff, 0xec, 0x2e, 0x8a, 0x00, 0x04, + 0x55, 0x31, 0x36, 0xba, 0x2c, 0x11, 0x00, 0x3c, 0x7e, 0x27, 0x88, 0x2e, 0x40, 0x82, 0x00, 0x08, + 0x7d, 0xd1, 0x73, 0x78, 0x41, 0x96, 0x00, 0x08, 0xa2, 0x31, 0x00, 0x00, 0x55, 0x29, 0x56, 0xba, + 0x2c, 0x09, 0x00, 0x3c, 0x7d, 0x27, 0x48, 0x2e, 0x40, 0x82, 0x00, 0x08, 0x7d, 0xc9, 0x73, 0x78, + 0x41, 0x96, 0x00, 0x08, 0xa1, 0x29, 0x00, 0x00, 0x4e, 0x80, 0x00, 0x20, 0x2c, 0x05, 0x00, 0x04, + 0x40, 0x80, 0x00, 0x28, 0x7c, 0x89, 0x23, 0x78, 0x7d, 0xc3, 0x62, 0x14, 0x55, 0xce, 0x00, 0x3c, + 0x4b, 0xff, 0xff, 0xad, 0x7c, 0x84, 0x20, 0xf8, 0x54, 0x84, 0x04, 0x3e, 0x7d, 0x2b, 0x20, 0x38, + 0x7e, 0x24, 0x20, 0x38, 0x4b, 0xff, 0xfb, 0xc4, 0x54, 0x6b, 0xe4, 0x3e, 0x4b, 0xff, 0xfb, 0xbc, + 0x7c, 0x9a, 0x23, 0x78, 0x54, 0x84, 0x18, 0x38, 0x40, 0x92, 0x00, 0x20, 0x40, 0x9e, 0x00, 0x0c, + 0x7d, 0xe8, 0x03, 0xa6, 0x4e, 0x80, 0x00, 0x21, 0x7d, 0xe4, 0x7a, 0x14, 0x39, 0xef, 0x00, 0x07, + 0x55, 0xef, 0x00, 0x38, 0x4b, 0xff, 0xfa, 0x6c, 0x2e, 0x05, 0x00, 0x03, 0x41, 0x91, 0x00, 0x5c, + 0x3c, 0xa0, 0x48, 0x00, 0x7d, 0x83, 0x62, 0x14, 0x55, 0x8c, 0x00, 0x3a, 0x40, 0x92, 0x00, 0x20, + 0x40, 0xbe, 0xfa, 0x50, 0x57, 0x44, 0x00, 0x3a, 0x7c, 0x8c, 0x20, 0x50, 0x50, 0x85, 0x01, 0xba, + 0x50, 0x65, 0x07, 0xfe, 0x90, 0xac, 0x00, 0x00, 0x4b, 0xff, 0xfa, 0x38, 0x40, 0xbe, 0xff, 0xbc, + 0x7d, 0x2c, 0x78, 0x50, 0x51, 0x25, 0x01, 0xba, 0x90, 0xac, 0x00, 0x00, 0x39, 0x8c, 0x00, 0x04, + 0x7d, 0x6f, 0x22, 0x14, 0x39, 0x6b, 0xff, 0xfc, 0x7d, 0x2b, 0x60, 0x50, 0x51, 0x25, 0x01, 0xba, + 0x90, 0xab, 0x00, 0x00, 0x4b, 0xff, 0xff, 0x94, 0x2e, 0x05, 0x00, 0x06, 0x41, 0x92, 0x00, 0x28, + 0x4b, 0xff, 0xfb, 0x28, 0x55, 0x8c, 0x84, 0x3e, 0x57, 0x44, 0x84, 0x3e, 0x57, 0x5a, 0x04, 0x3e, + 0x7c, 0x0c, 0x20, 0x00, 0x41, 0x80, 0xfb, 0xa8, 0x7c, 0x0c, 0xd0, 0x00, 0x40, 0x80, 0xfb, 0xa0, + 0x4b, 0xff, 0xf9, 0xe0, 0x57, 0x45, 0xff, 0xfe, 0x68, 0xa5, 0x00, 0x01, 0x71, 0x03, 0x00, 0x01, + 0x7c, 0x05, 0x18, 0x00, 0x41, 0x82, 0x00, 0x1c, 0x51, 0x1a, 0x0f, 0xbc, 0x6b, 0x5a, 0x00, 0x02, + 0x57, 0x45, 0xff, 0xff, 0x41, 0x82, 0x00, 0x08, 0x6b, 0x5a, 0x00, 0x01, 0x93, 0x4f, 0xff, 0xfc, + 0x53, 0x48, 0x07, 0xfe, 0x4b, 0xff, 0xf9, 0xac, 0x2c, 0x0b, 0x00, 0x00, 0x41, 0x82, 0x01, 0x38, + 0x2c, 0x05, 0x00, 0x01, 0x41, 0x82, 0x00, 0x18, 0x2c, 0x05, 0x00, 0x02, 0x41, 0x82, 0x00, 0x14, + 0x2c, 0x05, 0x00, 0x03, 0x41, 0x82, 0x00, 0x70, 0x4b, 0xff, 0xf9, 0x80, 0x54, 0xcc, 0x00, 0x0c, + 0x54, 0x97, 0x46, 0x3e, 0x54, 0x98, 0xc4, 0x3e, 0x54, 0x84, 0x06, 0x3e, 0x40, 0x9e, 0x00, 0xfc, + 0x56, 0xf9, 0x06, 0x31, 0x7d, 0x9a, 0x63, 0x78, 0x7f, 0x43, 0xd2, 0x14, 0x57, 0x5a, 0x00, 0x3a, + 0x41, 0x82, 0x00, 0x18, 0x7e, 0xf7, 0x07, 0x74, 0x7e, 0xf7, 0x00, 0xd0, 0x1f, 0x37, 0x00, 0x02, + 0x3b, 0x39, 0x00, 0x04, 0x7f, 0x59, 0xd0, 0x50, 0x2c, 0x17, 0x00, 0x00, 0x41, 0x82, 0x00, 0x1c, + 0x3b, 0x20, 0x00, 0x00, 0x7e, 0xe9, 0x03, 0xa6, 0xa3, 0x7a, 0x00, 0x04, 0x7f, 0x79, 0xca, 0x78, + 0x3b, 0x5a, 0x00, 0x02, 0x42, 0x00, 0xff, 0xf4, 0x7c, 0x18, 0xc8, 0x00, 0x40, 0x82, 0x00, 0xac, + 0x4b, 0xff, 0xfe, 0x90, 0x51, 0x08, 0x08, 0x3c, 0x40, 0x9e, 0x00, 0x9c, 0x54, 0x77, 0xb0, 0x03, + 0x41, 0x81, 0x00, 0x88, 0x41, 0x80, 0x00, 0x8c, 0x54, 0x7e, 0x06, 0x3e, 0x1f, 0xde, 0x00, 0x02, + 0x54, 0x97, 0x00, 0x1e, 0x6e, 0xf8, 0x80, 0x00, 0x2c, 0x18, 0x00, 0x00, 0x40, 0x82, 0x00, 0x08, + 0x62, 0xf7, 0x30, 0x00, 0x54, 0x98, 0x80, 0x1e, 0x1f, 0x3e, 0x00, 0x04, 0x7f, 0x19, 0xc0, 0x50, + 0x3b, 0x20, 0x00, 0x00, 0x1f, 0x59, 0x00, 0x04, 0x7f, 0x6f, 0xd0, 0x2e, 0x7f, 0x57, 0xd0, 0x2e, + 0x3b, 0x39, 0x00, 0x01, 0x7c, 0x17, 0xc0, 0x40, 0x41, 0x81, 0x00, 0x34, 0x7c, 0x19, 0xf0, 0x00, + 0x41, 0x81, 0x00, 0x14, 0x7c, 0x1a, 0xd8, 0x00, 0x41, 0x82, 0xff, 0xdc, 0x3a, 0xf7, 0x00, 0x04, + 0x4b, 0xff, 0xff, 0xd0, 0x80, 0x6f, 0xff, 0xf8, 0x60, 0x63, 0x03, 0x00, 0x90, 0x6f, 0xff, 0xf8, + 0x92, 0xef, 0xff, 0xfc, 0x7e, 0xf0, 0xbb, 0x78, 0x48, 0x00, 0x00, 0x1c, 0x80, 0x6f, 0xff, 0xf8, + 0x60, 0x63, 0x01, 0x00, 0x90, 0x6f, 0xff, 0xf8, 0x61, 0x08, 0x00, 0x01, 0x48, 0x00, 0x00, 0x08, + 0x7c, 0x90, 0x23, 0x78, 0x54, 0x64, 0x06, 0x3e, 0x1c, 0x84, 0x00, 0x08, 0x7d, 0xe4, 0x7a, 0x14, + 0x4b, 0xff, 0xf8, 0x70, 0x40, 0x92, 0x00, 0x0c, 0x39, 0x00, 0x00, 0x00, 0x48, 0x00, 0x00, 0x14, + 0x54, 0x69, 0x06, 0xff, 0x54, 0x65, 0x67, 0xfe, 0x7d, 0x08, 0x4c, 0x30, 0x55, 0x17, 0xff, 0xff, + 0x40, 0x82, 0x00, 0x08, 0x7d, 0x08, 0x2a, 0x78, 0x54, 0x85, 0x00, 0x1f, 0x41, 0x82, 0x00, 0x08, + 0x7c, 0xa6, 0x2b, 0x78, 0x54, 0x85, 0x80, 0x1f, 0x41, 0x82, 0x00, 0x08, 0x7c, 0xb0, 0x2b, 0x78, + 0x4b, 0xff, 0xf8, 0x30, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + +}; +const int codehandler_size = sizeof(codehandler); diff --git a/source/loader/codehandleronly.h b/source/loader/codehandleronly.h new file mode 100644 index 00000000..d125bae7 --- /dev/null +++ b/source/loader/codehandleronly.h @@ -0,0 +1,180 @@ +/* + This file was autogenerated by raw2c. +Visit http://www.devkitpro.org +*/ + +const unsigned char codehandleronly[] = { + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0x00, 0x21, 0x60, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x94, 0x21, 0xff, 0x58, 0x90, 0x01, 0x00, 0x08, + 0x7c, 0x08, 0x02, 0xa6, 0x90, 0x01, 0x00, 0xac, 0x7c, 0x00, 0x00, 0x26, 0x90, 0x01, 0x00, 0x0c, + 0x7c, 0x09, 0x02, 0xa6, 0x90, 0x01, 0x00, 0x10, 0x7c, 0x01, 0x02, 0xa6, 0x90, 0x01, 0x00, 0x14, + 0xbc, 0x61, 0x00, 0x18, 0x7f, 0x20, 0x00, 0xa6, 0x63, 0x3a, 0x20, 0x00, 0x73, 0x5a, 0xf9, 0xff, + 0x7f, 0x40, 0x01, 0x24, 0xd8, 0x41, 0x00, 0x98, 0xd8, 0x61, 0x00, 0xa0, 0x3f, 0xe0, 0x80, 0x00, + 0x3e, 0x80, 0xcc, 0x00, 0xa3, 0x94, 0x40, 0x10, 0x63, 0x95, 0x00, 0xff, 0xb2, 0xb4, 0x40, 0x10, + 0x7f, 0xa8, 0x02, 0xa6, 0x3d, 0xe0, 0x80, 0x00, 0x61, 0xef, 0x22, 0xa8, 0x63, 0xe7, 0x18, 0x08, + 0x3c, 0xc0, 0x80, 0x00, 0x7c, 0xd0, 0x33, 0x78, 0x39, 0x00, 0x00, 0x00, 0x3c, 0x60, 0x00, 0xd0, + 0x60, 0x63, 0xc0, 0xde, 0x80, 0x8f, 0x00, 0x00, 0x7c, 0x03, 0x20, 0x00, 0x40, 0x82, 0x00, 0x18, + 0x80, 0x8f, 0x00, 0x04, 0x7c, 0x03, 0x20, 0x00, 0x40, 0x82, 0x00, 0x0c, 0x39, 0xef, 0x00, 0x08, + 0x48, 0x00, 0x00, 0x4c, 0x7f, 0xa8, 0x03, 0xa6, 0xb3, 0x94, 0x40, 0x10, 0xc8, 0x41, 0x00, 0x98, + 0xc8, 0x61, 0x00, 0xa0, 0x7f, 0x20, 0x00, 0xa6, 0x80, 0x01, 0x00, 0xac, 0x7c, 0x08, 0x03, 0xa6, + 0x80, 0x01, 0x00, 0x0c, 0x7c, 0x0f, 0xf1, 0x20, 0x80, 0x01, 0x00, 0x10, 0x7c, 0x09, 0x03, 0xa6, + 0x80, 0x01, 0x00, 0x14, 0x7c, 0x01, 0x03, 0xa6, 0xb8, 0x61, 0x00, 0x18, 0x80, 0x01, 0x00, 0x08, + 0x38, 0x21, 0x00, 0xa8, 0x4c, 0x00, 0x01, 0x2c, 0x4e, 0x80, 0x00, 0x20, 0x80, 0x6f, 0x00, 0x00, + 0x80, 0x8f, 0x00, 0x04, 0x39, 0xef, 0x00, 0x08, 0x71, 0x09, 0x00, 0x01, 0x2f, 0x89, 0x00, 0x00, + 0x39, 0x20, 0x00, 0x00, 0x54, 0x6a, 0x1f, 0x7e, 0x54, 0x65, 0x3f, 0x7e, 0x74, 0x6b, 0x10, 0x00, + 0x54, 0x63, 0x01, 0xfe, 0x40, 0x82, 0x00, 0x0c, 0x54, 0xcc, 0x00, 0x0c, 0x48, 0x00, 0x00, 0x08, + 0x7e, 0x0c, 0x83, 0x78, 0x2e, 0x05, 0x00, 0x00, 0x2c, 0x0a, 0x00, 0x01, 0x41, 0xa0, 0x00, 0x2c, + 0x41, 0xa2, 0x00, 0xe4, 0x2c, 0x0a, 0x00, 0x03, 0x41, 0xa0, 0x01, 0xac, 0x41, 0x82, 0x02, 0x50, + 0x2c, 0x0a, 0x00, 0x05, 0x41, 0x80, 0x02, 0xd4, 0x41, 0xa2, 0x04, 0xe0, 0x2c, 0x0a, 0x00, 0x07, + 0x41, 0xa0, 0x05, 0x0c, 0x48, 0x00, 0x05, 0xf0, 0x7d, 0x8c, 0x1a, 0x14, 0x2c, 0x05, 0x00, 0x03, + 0x41, 0x82, 0x00, 0x48, 0x41, 0x81, 0x00, 0x60, 0x40, 0xbe, 0xff, 0x84, 0x2e, 0x05, 0x00, 0x01, + 0x41, 0x91, 0x00, 0x2c, 0x54, 0x8a, 0x84, 0x3e, 0x41, 0x92, 0x00, 0x10, 0x7c, 0x89, 0x61, 0xae, + 0x39, 0x29, 0x00, 0x01, 0x48, 0x00, 0x00, 0x0c, 0x7c, 0x89, 0x63, 0x2e, 0x39, 0x29, 0x00, 0x02, + 0x35, 0x4a, 0xff, 0xff, 0x40, 0xa0, 0xff, 0xe4, 0x4b, 0xff, 0xff, 0x54, 0x55, 0x8c, 0x00, 0x3a, + 0x90, 0x8c, 0x00, 0x00, 0x4b, 0xff, 0xff, 0x48, 0x7c, 0x89, 0x23, 0x78, 0x40, 0x9e, 0x04, 0xc8, + 0x35, 0x29, 0xff, 0xff, 0x41, 0x80, 0x04, 0xc0, 0x7c, 0xa9, 0x78, 0xae, 0x7c, 0xa9, 0x61, 0xae, + 0x4b, 0xff, 0xff, 0xf0, 0x39, 0xef, 0x00, 0x08, 0x40, 0xbe, 0xff, 0x24, 0x80, 0xaf, 0xff, 0xf8, + 0x81, 0x6f, 0xff, 0xfc, 0x54, 0xb1, 0x04, 0x3e, 0x54, 0xaa, 0x85, 0x3e, 0x54, 0xa5, 0x27, 0x3e, + 0x2e, 0x85, 0x00, 0x01, 0x41, 0x96, 0x00, 0x10, 0x41, 0xb5, 0x00, 0x14, 0x7c, 0x89, 0x61, 0xae, + 0x48, 0x00, 0x00, 0x10, 0x7c, 0x89, 0x63, 0x2e, 0x48, 0x00, 0x00, 0x08, 0x7c, 0x89, 0x61, 0x2e, + 0x7c, 0x84, 0x5a, 0x14, 0x7d, 0x29, 0x8a, 0x14, 0x35, 0x4a, 0xff, 0xff, 0x40, 0x80, 0xff, 0xd4, + 0x4b, 0xff, 0xfe, 0xdc, 0x54, 0x69, 0x07, 0xff, 0x41, 0x82, 0x00, 0x10, 0x55, 0x08, 0xf8, 0x7e, + 0x71, 0x09, 0x00, 0x01, 0x2f, 0x89, 0x00, 0x00, 0x2e, 0x85, 0x00, 0x04, 0x2d, 0x8a, 0x00, 0x05, + 0x51, 0x08, 0x08, 0x3c, 0x40, 0x9e, 0x00, 0x78, 0x41, 0x8d, 0x04, 0xb8, 0x7d, 0x8c, 0x1a, 0x14, + 0x41, 0x8c, 0x00, 0x0c, 0x41, 0x94, 0x00, 0x30, 0x48, 0x00, 0x00, 0x1c, 0x40, 0x94, 0x00, 0x10, + 0x55, 0x8c, 0x00, 0x3a, 0x81, 0x6c, 0x00, 0x00, 0x48, 0x00, 0x00, 0x1c, 0x55, 0x8c, 0x00, 0x3c, + 0xa1, 0x6c, 0x00, 0x00, 0x7c, 0x89, 0x20, 0xf8, 0x55, 0x29, 0x84, 0x3e, 0x7d, 0x6b, 0x48, 0x38, + 0x54, 0x84, 0x04, 0x3e, 0x7f, 0x0b, 0x20, 0x40, 0x70, 0xa9, 0x00, 0x03, 0x41, 0x82, 0x00, 0x18, + 0x2c, 0x09, 0x00, 0x02, 0x41, 0x82, 0x00, 0x18, 0x41, 0x81, 0x00, 0x1c, 0x40, 0x9a, 0x00, 0x20, + 0x48, 0x00, 0x00, 0x18, 0x41, 0x9a, 0x00, 0x18, 0x48, 0x00, 0x00, 0x10, 0x41, 0x99, 0x00, 0x10, + 0x48, 0x00, 0x00, 0x08, 0x41, 0x98, 0x00, 0x08, 0x61, 0x08, 0x00, 0x01, 0x40, 0x8e, 0xfe, 0x40, + 0x41, 0x94, 0xfe, 0x3c, 0x81, 0x6f, 0xff, 0xf8, 0x40, 0x9e, 0x00, 0x20, 0x70, 0x6c, 0x00, 0x08, + 0x41, 0x82, 0x00, 0x0c, 0x71, 0x0c, 0x00, 0x01, 0x41, 0x82, 0x00, 0x10, 0x39, 0x8b, 0x00, 0x10, + 0x51, 0x8b, 0x03, 0x36, 0x48, 0x00, 0x00, 0x08, 0x55, 0x6b, 0x07, 0x16, 0x91, 0x6f, 0xff, 0xf8, + 0x4b, 0xff, 0xfe, 0x0c, 0x40, 0xbe, 0xfe, 0x08, 0x54, 0x69, 0x16, 0xba, 0x54, 0x6e, 0x87, 0xfe, + 0x2d, 0x8e, 0x00, 0x00, 0x2e, 0x05, 0x00, 0x04, 0x70, 0xae, 0x00, 0x03, 0x2e, 0x8e, 0x00, 0x02, + 0x41, 0x94, 0x00, 0x14, 0x41, 0x96, 0x00, 0x50, 0x7c, 0x64, 0x07, 0x34, 0x7c, 0x84, 0x7a, 0x14, + 0x48, 0x00, 0x00, 0x68, 0x54, 0x65, 0xa7, 0xff, 0x41, 0x82, 0x00, 0x0c, 0x7d, 0x27, 0x48, 0x2e, + 0x7c, 0x84, 0x4a, 0x14, 0x41, 0x8e, 0x00, 0x08, 0x7c, 0x8c, 0x22, 0x14, 0x2e, 0x8e, 0x00, 0x01, + 0x41, 0x96, 0x00, 0x08, 0x80, 0x84, 0x00, 0x00, 0x54, 0x63, 0x67, 0xff, 0x41, 0x82, 0x00, 0x3c, + 0x40, 0x90, 0x00, 0x0c, 0x7c, 0x84, 0x32, 0x14, 0x48, 0x00, 0x00, 0x30, 0x7c, 0x84, 0x82, 0x14, + 0x48, 0x00, 0x00, 0x28, 0x54, 0x65, 0xa7, 0xff, 0x41, 0x82, 0x00, 0x0c, 0x7d, 0x27, 0x48, 0x2e, + 0x7c, 0x84, 0x4a, 0x14, 0x40, 0x90, 0x00, 0x0c, 0x7c, 0xcc, 0x21, 0x2e, 0x4b, 0xff, 0xfd, 0x80, + 0x7e, 0x0c, 0x21, 0x2e, 0x4b, 0xff, 0xfd, 0x78, 0x40, 0x90, 0x00, 0x0c, 0x7c, 0x86, 0x23, 0x78, + 0x4b, 0xff, 0xfd, 0x6c, 0x7c, 0x90, 0x23, 0x78, 0x4b, 0xff, 0xfd, 0x64, 0x54, 0x89, 0x1e, 0x78, + 0x39, 0x29, 0x00, 0x40, 0x2c, 0x05, 0x00, 0x02, 0x41, 0x80, 0x00, 0x48, 0x54, 0x6b, 0x50, 0x03, + 0x41, 0x82, 0x00, 0x14, 0x41, 0x81, 0x00, 0x08, 0x48, 0x00, 0x00, 0x10, 0x41, 0xbe, 0xfd, 0x40, + 0x48, 0x00, 0x00, 0x08, 0x40, 0xbe, 0xfd, 0x38, 0x2c, 0x05, 0x00, 0x03, 0x41, 0x81, 0x00, 0x10, + 0x41, 0xa2, 0x00, 0x10, 0x7d, 0xe7, 0x48, 0x2e, 0x4b, 0xff, 0xfd, 0x24, 0x7d, 0xe7, 0x49, 0x2e, + 0x7c, 0x64, 0x07, 0x34, 0x54, 0x84, 0x1a, 0x78, 0x7d, 0xef, 0x22, 0x14, 0x4b, 0xff, 0xfd, 0x10, + 0x40, 0xbe, 0xfd, 0x0c, 0x7c, 0xa7, 0x4a, 0x14, 0x40, 0x92, 0x00, 0x14, 0x54, 0x64, 0x04, 0x3e, + 0x91, 0xe5, 0x00, 0x00, 0x90, 0x85, 0x00, 0x04, 0x4b, 0xff, 0xfc, 0xf4, 0x81, 0x25, 0x00, 0x04, + 0x2c, 0x09, 0x00, 0x00, 0x41, 0xa2, 0xfc, 0xe8, 0x39, 0x29, 0xff, 0xff, 0x91, 0x25, 0x00, 0x04, + 0x81, 0xe5, 0x00, 0x00, 0x4b, 0xff, 0xfc, 0xd8, 0x40, 0xbe, 0xfc, 0xd4, 0x54, 0x6b, 0x16, 0xba, + 0x7f, 0x47, 0x5a, 0x14, 0x81, 0x3a, 0x00, 0x00, 0x54, 0x6e, 0x67, 0xbe, 0x41, 0x92, 0x00, 0x84, + 0x2e, 0x05, 0x00, 0x05, 0x40, 0x90, 0x01, 0x74, 0x2e, 0x05, 0x00, 0x03, 0x40, 0x90, 0x00, 0x90, + 0x2e, 0x05, 0x00, 0x01, 0x54, 0x65, 0x87, 0xff, 0x41, 0x82, 0x00, 0x08, 0x7c, 0x8c, 0x22, 0x14, + 0x2f, 0x0e, 0x00, 0x01, 0x40, 0x92, 0x00, 0x24, 0x41, 0xb9, 0x00, 0x18, 0x41, 0x9a, 0x00, 0x0c, + 0x88, 0x84, 0x00, 0x00, 0x48, 0x00, 0x00, 0xf8, 0xa0, 0x84, 0x00, 0x00, 0x48, 0x00, 0x00, 0xf0, + 0x80, 0x84, 0x00, 0x00, 0x48, 0x00, 0x00, 0xe8, 0x54, 0x73, 0xe5, 0x3e, 0x41, 0xb9, 0x00, 0x20, + 0x41, 0x9a, 0x00, 0x10, 0x99, 0x24, 0x00, 0x00, 0x38, 0x84, 0x00, 0x01, 0x48, 0x00, 0x00, 0x18, + 0xb1, 0x24, 0x00, 0x00, 0x38, 0x84, 0x00, 0x02, 0x48, 0x00, 0x00, 0x0c, 0x91, 0x24, 0x00, 0x00, + 0x38, 0x84, 0x00, 0x04, 0x36, 0x73, 0xff, 0xff, 0x40, 0x80, 0xff, 0xd4, 0x4b, 0xff, 0xfc, 0x40, + 0x54, 0x65, 0x87, 0xff, 0x41, 0x82, 0x00, 0x08, 0x7c, 0x84, 0x62, 0x14, 0x71, 0xc5, 0x00, 0x01, + 0x41, 0x82, 0x00, 0x9c, 0x7c, 0x84, 0x4a, 0x14, 0x48, 0x00, 0x00, 0x94, 0x54, 0x6a, 0x87, 0xbe, + 0x54, 0x8e, 0x16, 0xba, 0x7e, 0x67, 0x72, 0x14, 0x40, 0x92, 0x00, 0x08, 0x3a, 0x6f, 0xff, 0xfc, + 0x80, 0x9a, 0x00, 0x00, 0x81, 0x33, 0x00, 0x00, 0x71, 0x4b, 0x00, 0x01, 0x41, 0x82, 0x00, 0x08, + 0x7c, 0x9a, 0x23, 0x78, 0x71, 0x4b, 0x00, 0x02, 0x41, 0x82, 0x00, 0x10, 0x7d, 0x33, 0x4b, 0x78, + 0x40, 0xb2, 0x00, 0x08, 0x7e, 0x6c, 0x9a, 0x14, 0x54, 0x65, 0x67, 0x3f, 0x2c, 0x05, 0x00, 0x09, + 0x40, 0x80, 0x00, 0x54, 0x48, 0x00, 0x00, 0x79, 0x7c, 0x89, 0x22, 0x14, 0x48, 0x00, 0x00, 0x40, + 0x7c, 0x89, 0x21, 0xd6, 0x48, 0x00, 0x00, 0x38, 0x7d, 0x24, 0x23, 0x78, 0x48, 0x00, 0x00, 0x30, + 0x7d, 0x24, 0x20, 0x38, 0x48, 0x00, 0x00, 0x28, 0x7d, 0x24, 0x22, 0x78, 0x48, 0x00, 0x00, 0x20, + 0x7d, 0x24, 0x20, 0x30, 0x48, 0x00, 0x00, 0x18, 0x7d, 0x24, 0x24, 0x30, 0x48, 0x00, 0x00, 0x10, + 0x5d, 0x24, 0x20, 0x3e, 0x48, 0x00, 0x00, 0x08, 0x7d, 0x24, 0x26, 0x30, 0x90, 0x9a, 0x00, 0x00, + 0x4b, 0xff, 0xfb, 0x8c, 0x2c, 0x05, 0x00, 0x0a, 0x41, 0x81, 0xfb, 0x84, 0xc0, 0x5a, 0x00, 0x00, + 0xc0, 0x73, 0x00, 0x00, 0x41, 0x82, 0x00, 0x0c, 0xec, 0x43, 0x10, 0x2a, 0x48, 0x00, 0x00, 0x08, + 0xec, 0x43, 0x00, 0xb2, 0xd0, 0x5a, 0x00, 0x00, 0x4b, 0xff, 0xfb, 0x64, 0x7d, 0x48, 0x02, 0xa6, + 0x54, 0xa5, 0x1e, 0x78, 0x7d, 0x4a, 0x2a, 0x14, 0x80, 0x9a, 0x00, 0x00, 0x81, 0x33, 0x00, 0x00, + 0x7d, 0x48, 0x03, 0xa6, 0x4e, 0x80, 0x00, 0x20, 0x40, 0xbe, 0xfb, 0x44, 0x54, 0x69, 0xc0, 0x3e, + 0x7d, 0x8e, 0x63, 0x78, 0x48, 0x00, 0x00, 0x35, 0x41, 0x92, 0x00, 0x0c, 0x7e, 0x31, 0x22, 0x14, + 0x48, 0x00, 0x00, 0x08, 0x7d, 0x29, 0x22, 0x14, 0x54, 0x64, 0xc4, 0x3f, 0x38, 0xa0, 0x00, 0x00, + 0x41, 0x82, 0xfb, 0x1c, 0x7d, 0x45, 0x88, 0xae, 0x7d, 0x45, 0x49, 0xae, 0x38, 0xa5, 0x00, 0x01, + 0x7c, 0x05, 0x20, 0x00, 0x4b, 0xff, 0xff, 0xec, 0x2e, 0x8a, 0x00, 0x04, 0x55, 0x31, 0x36, 0xba, + 0x2c, 0x11, 0x00, 0x3c, 0x7e, 0x27, 0x88, 0x2e, 0x40, 0x82, 0x00, 0x08, 0x7d, 0xd1, 0x73, 0x78, + 0x41, 0x96, 0x00, 0x08, 0xa2, 0x31, 0x00, 0x00, 0x55, 0x29, 0x56, 0xba, 0x2c, 0x09, 0x00, 0x3c, + 0x7d, 0x27, 0x48, 0x2e, 0x40, 0x82, 0x00, 0x08, 0x7d, 0xc9, 0x73, 0x78, 0x41, 0x96, 0x00, 0x08, + 0xa1, 0x29, 0x00, 0x00, 0x4e, 0x80, 0x00, 0x20, 0x2c, 0x05, 0x00, 0x04, 0x40, 0x80, 0x00, 0x28, + 0x7c, 0x89, 0x23, 0x78, 0x7d, 0xc3, 0x62, 0x14, 0x55, 0xce, 0x00, 0x3c, 0x4b, 0xff, 0xff, 0xad, + 0x7c, 0x84, 0x20, 0xf8, 0x54, 0x84, 0x04, 0x3e, 0x7d, 0x2b, 0x20, 0x38, 0x7e, 0x24, 0x20, 0x38, + 0x4b, 0xff, 0xfb, 0xc4, 0x54, 0x6b, 0xe4, 0x3e, 0x4b, 0xff, 0xfb, 0xbc, 0x7c, 0x9a, 0x23, 0x78, + 0x54, 0x84, 0x18, 0x38, 0x40, 0x92, 0x00, 0x20, 0x40, 0x9e, 0x00, 0x0c, 0x7d, 0xe8, 0x03, 0xa6, + 0x4e, 0x80, 0x00, 0x21, 0x7d, 0xe4, 0x7a, 0x14, 0x39, 0xef, 0x00, 0x07, 0x55, 0xef, 0x00, 0x38, + 0x4b, 0xff, 0xfa, 0x6c, 0x2e, 0x05, 0x00, 0x03, 0x41, 0x91, 0x00, 0x5c, 0x3c, 0xa0, 0x48, 0x00, + 0x7d, 0x83, 0x62, 0x14, 0x55, 0x8c, 0x00, 0x3a, 0x40, 0x92, 0x00, 0x20, 0x40, 0xbe, 0xfa, 0x50, + 0x57, 0x44, 0x00, 0x3a, 0x7c, 0x8c, 0x20, 0x50, 0x50, 0x85, 0x01, 0xba, 0x50, 0x65, 0x07, 0xfe, + 0x90, 0xac, 0x00, 0x00, 0x4b, 0xff, 0xfa, 0x38, 0x40, 0xbe, 0xff, 0xbc, 0x7d, 0x2c, 0x78, 0x50, + 0x51, 0x25, 0x01, 0xba, 0x90, 0xac, 0x00, 0x00, 0x39, 0x8c, 0x00, 0x04, 0x7d, 0x6f, 0x22, 0x14, + 0x39, 0x6b, 0xff, 0xfc, 0x7d, 0x2b, 0x60, 0x50, 0x51, 0x25, 0x01, 0xba, 0x90, 0xab, 0x00, 0x00, + 0x4b, 0xff, 0xff, 0x94, 0x2e, 0x05, 0x00, 0x06, 0x41, 0x92, 0x00, 0x28, 0x4b, 0xff, 0xfb, 0x28, + 0x55, 0x8c, 0x84, 0x3e, 0x57, 0x44, 0x84, 0x3e, 0x57, 0x5a, 0x04, 0x3e, 0x7c, 0x0c, 0x20, 0x00, + 0x41, 0x80, 0xfb, 0xa8, 0x7c, 0x0c, 0xd0, 0x00, 0x40, 0x80, 0xfb, 0xa0, 0x4b, 0xff, 0xf9, 0xe0, + 0x57, 0x45, 0xff, 0xfe, 0x68, 0xa5, 0x00, 0x01, 0x71, 0x03, 0x00, 0x01, 0x7c, 0x05, 0x18, 0x00, + 0x41, 0x82, 0x00, 0x1c, 0x51, 0x1a, 0x0f, 0xbc, 0x6b, 0x5a, 0x00, 0x02, 0x57, 0x45, 0xff, 0xff, + 0x41, 0x82, 0x00, 0x08, 0x6b, 0x5a, 0x00, 0x01, 0x93, 0x4f, 0xff, 0xfc, 0x53, 0x48, 0x07, 0xfe, + 0x4b, 0xff, 0xf9, 0xac, 0x2c, 0x0b, 0x00, 0x00, 0x41, 0x82, 0x01, 0x38, 0x2c, 0x05, 0x00, 0x01, + 0x41, 0x82, 0x00, 0x18, 0x2c, 0x05, 0x00, 0x02, 0x41, 0x82, 0x00, 0x14, 0x2c, 0x05, 0x00, 0x03, + 0x41, 0x82, 0x00, 0x70, 0x4b, 0xff, 0xf9, 0x40, 0x54, 0xcc, 0x00, 0x0c, 0x54, 0x97, 0x46, 0x3e, + 0x54, 0x98, 0xc4, 0x3e, 0x54, 0x84, 0x06, 0x3e, 0x40, 0x9e, 0x00, 0xfc, 0x56, 0xf9, 0x06, 0x31, + 0x7d, 0x9a, 0x63, 0x78, 0x7f, 0x43, 0xd2, 0x14, 0x57, 0x5a, 0x00, 0x3a, 0x41, 0x82, 0x00, 0x18, + 0x7e, 0xf7, 0x07, 0x74, 0x7e, 0xf7, 0x00, 0xd0, 0x1f, 0x37, 0x00, 0x02, 0x3b, 0x39, 0x00, 0x04, + 0x7f, 0x59, 0xd0, 0x50, 0x2c, 0x17, 0x00, 0x00, 0x41, 0x82, 0x00, 0x1c, 0x3b, 0x20, 0x00, 0x00, + 0x7e, 0xe9, 0x03, 0xa6, 0xa3, 0x7a, 0x00, 0x04, 0x7f, 0x79, 0xca, 0x78, 0x3b, 0x5a, 0x00, 0x02, + 0x42, 0x00, 0xff, 0xf4, 0x7c, 0x18, 0xc8, 0x00, 0x40, 0x82, 0x00, 0xac, 0x4b, 0xff, 0xfe, 0x90, + 0x51, 0x08, 0x08, 0x3c, 0x40, 0x9e, 0x00, 0x9c, 0x54, 0x77, 0xb0, 0x03, 0x41, 0x81, 0x00, 0x88, + 0x41, 0x80, 0x00, 0x8c, 0x54, 0x7e, 0x06, 0x3e, 0x1f, 0xde, 0x00, 0x02, 0x54, 0x97, 0x00, 0x1e, + 0x6e, 0xf8, 0x80, 0x00, 0x2c, 0x18, 0x00, 0x00, 0x40, 0x82, 0x00, 0x08, 0x62, 0xf7, 0x30, 0x00, + 0x54, 0x98, 0x80, 0x1e, 0x1f, 0x3e, 0x00, 0x04, 0x7f, 0x19, 0xc0, 0x50, 0x3b, 0x20, 0x00, 0x00, + 0x1f, 0x59, 0x00, 0x04, 0x7f, 0x6f, 0xd0, 0x2e, 0x7f, 0x57, 0xd0, 0x2e, 0x3b, 0x39, 0x00, 0x01, + 0x7c, 0x17, 0xc0, 0x40, 0x41, 0x81, 0x00, 0x34, 0x7c, 0x19, 0xf0, 0x00, 0x41, 0x81, 0x00, 0x14, + 0x7c, 0x1a, 0xd8, 0x00, 0x41, 0x82, 0xff, 0xdc, 0x3a, 0xf7, 0x00, 0x04, 0x4b, 0xff, 0xff, 0xd0, + 0x80, 0x6f, 0xff, 0xf8, 0x60, 0x63, 0x03, 0x00, 0x90, 0x6f, 0xff, 0xf8, 0x92, 0xef, 0xff, 0xfc, + 0x7e, 0xf0, 0xbb, 0x78, 0x48, 0x00, 0x00, 0x1c, 0x80, 0x6f, 0xff, 0xf8, 0x60, 0x63, 0x01, 0x00, + 0x90, 0x6f, 0xff, 0xf8, 0x61, 0x08, 0x00, 0x01, 0x48, 0x00, 0x00, 0x08, 0x7c, 0x90, 0x23, 0x78, + 0x54, 0x64, 0x06, 0x3e, 0x1c, 0x84, 0x00, 0x08, 0x7d, 0xe4, 0x7a, 0x14, 0x4b, 0xff, 0xf8, 0x70, + 0x40, 0x92, 0x00, 0x0c, 0x39, 0x00, 0x00, 0x00, 0x48, 0x00, 0x00, 0x14, 0x54, 0x69, 0x06, 0xff, + 0x54, 0x65, 0x67, 0xfe, 0x7d, 0x08, 0x4c, 0x30, 0x55, 0x17, 0xff, 0xff, 0x40, 0x82, 0x00, 0x08, + 0x7d, 0x08, 0x2a, 0x78, 0x54, 0x85, 0x00, 0x1f, 0x41, 0x82, 0x00, 0x08, 0x7c, 0xa6, 0x2b, 0x78, + 0x54, 0x85, 0x80, 0x1f, 0x41, 0x82, 0x00, 0x08, 0x7c, 0xb0, 0x2b, 0x78, 0x4b, 0xff, 0xf8, 0x30, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x60, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 + +}; +const int codehandleronly_size = sizeof(codehandleronly); diff --git a/source/loader/disc.c b/source/loader/disc.c new file mode 100644 index 00000000..8684f657 --- /dev/null +++ b/source/loader/disc.c @@ -0,0 +1,425 @@ +#include +#include +#include +#include +#include +#include +#include +#include + +#include "apploader.h" +#include "disc.h" +#include "wdvd.h" +#include "sys.h" + +#include "fst.h" +#include "videopatch.h" +#include "wbfs.h" +#include "patchcode.h" +#include "frag.h" +#include "usbstorage.h" +#include "wip.h" + +#include "gecko.h" + +#define ALIGNED(x) __attribute__((aligned(x))) + +/* Constants */ +#define PTABLE_OFFSET 0x40000 +#define WII_MAGIC 0x5D1C9EA3 +#define GC_MAGIC 0xC2339F3D + +//appentrypoint +u32 appentrypoint; + +/* Disc pointers */ +static u32 *buffer = (u32 *)0x93000000; +static u8 *diskid = (u8 *)0x80000000; + +GXRModeObj *disc_vmode = NULL; +GXRModeObj *vmode = NULL; +u32 vmode_reg = 0; + +extern void __exception_closeall(); + +static u8 Tmd_Buffer[0x49e4 + 0x1C] ALIGNED(32); + +void __Disc_SetLowMem() +{ + *(vu32 *)0x80000060 = 0x38A00040; // Dev Debugger Hook + *(vu32 *)0x800000E4 = 0x80431A80; + *(vu32 *)0x800000EC = 0x81800000; // Dev Debugger Monitor Address + *(vu32 *)0x800000F0 = 0x01800000; // Simulated Memory Size + *(vu32 *)0xCD00643C = 0x00000000; // 32Mhz on Bus + + *Sys_Magic = 0x0d15ea5e; + *Version = 1; + *Arena_L = 0x00000000; + *BI2 = 0x817E5480; + *Bus_Speed = 0x0E7BE2C0; + *CPU_Speed = 0x2B73A840; + + *(vu32 *)0x800030F0 = 0x0000001C; // Dol Args + *(vu32 *)0x8000318C = 0x00000000; // Launch Code + *(vu32 *)0x80003190 = 0x00000000; // Return Code + + *(vu32 *)0x80003140 = *(vu32 *)0x80003188; // IOS Version Check + *(vu32 *)0x80003180 = *(vu32 *)0x80000000; // Game ID Online Check + *(vu32 *)0x80003184 = 0x80000000; + + /* Flush cache */ + DCFlushRange((void *)0x80000000, 0x3F00); +} + +GXRModeObj * __Disc_SelectVMode(u8 videoselected, u64 chantitle) +{ + vmode = VIDEO_GetPreferredMode(0); + + /* Get video mode configuration */ + bool progressive = (CONF_GetProgressiveScan() > 0) && VIDEO_HaveComponentCable(); + + /* Select video mode register */ + switch (CONF_GetVideo()) + { + case CONF_VIDEO_PAL: + if (CONF_GetEuRGB60() > 0) + { + vmode_reg = VI_EURGB60; + vmode = progressive ? &TVNtsc480Prog : &TVEurgb60Hz480IntDf; + } + else + vmode_reg = VI_PAL; + break; + + case CONF_VIDEO_MPAL: + vmode_reg = VI_MPAL; + break; + + case CONF_VIDEO_NTSC: + vmode_reg = VI_NTSC; + break; + } + + char Region; + if(chantitle != 0) + Region = ((u32)(chantitle) & 0xFFFFFFFF) % 256; + else Region = diskid[3]; + + switch (videoselected) + { + case 0: // DEFAULT (DISC/GAME) + /* Select video mode */ + switch (Region) + { + case 'W': + break; // Don't overwrite wiiware video modes. + // PAL + case 'D': + case 'F': + case 'P': + case 'X': + case 'Y': + if (CONF_GetVideo() != CONF_VIDEO_PAL) + { + vmode_reg = VI_PAL; + vmode = progressive ? &TVNtsc480Prog : &TVNtsc480IntDf; + } + break; + // NTSC + case 'E': + case 'J': + default: + if (CONF_GetVideo() != CONF_VIDEO_NTSC) + { + vmode_reg = VI_NTSC; + vmode = progressive ? &TVNtsc480Prog : &TVEurgb60Hz480IntDf; + } + break; + } + break; + case 1: // PAL50 + vmode = &TVPal528IntDf; + vmode_reg = vmode->viTVMode >> 2; + break; + case 2: // PAL60 + vmode = progressive ? &TVNtsc480Prog : &TVEurgb60Hz480IntDf; + vmode_reg = progressive ? TVEurgb60Hz480Prog.viTVMode >> 2 : vmode->viTVMode >> 2; + break; + case 3: // NTSC + vmode = progressive ? &TVNtsc480Prog : &TVNtsc480IntDf; + vmode_reg = vmode->viTVMode >> 2; + break; + case 4: // AUTO PATCH TO SYSTEM + case 5: // SYSTEM + break; + case 6: // PROGRESSIVE 480P(NTSC + PATCH ALL) + vmode = &TVNtsc480Prog; + vmode_reg = vmode->viTVMode >> 2; + break; + default: + break; + } + disc_vmode = vmode; + + return vmode; +} + +void __Disc_SetVMode(void) +{ + // Stop wait message thread + extern void HideWaitMessage(); + HideWaitMessage(); + + /* Set video mode register */ + *(vu32 *)0x800000CC = vmode_reg; + + /* Set video mode */ + if (vmode != 0) VIDEO_Configure(vmode); + + /* Setup video */ + VIDEO_SetBlack(TRUE); + VIDEO_Flush(); + VIDEO_WaitVSync(); + if (vmode->viTVMode & VI_NON_INTERLACE) + VIDEO_WaitVSync(); + else while (VIDEO_GetNextField()) + VIDEO_WaitVSync(); +} + +void __Disc_SetTime(void) +{ + /* Set proper time */ + settime(secs_to_ticks(time(NULL) - 946684800)); +} + +s32 __Disc_FindPartition(u64 *outbuf) +{ + u64 offset = 0; + u32 cnt; + + /* Read partition info */ + s32 ret = WDVD_UnencryptedRead(buffer, 0x20, PTABLE_OFFSET); + if (ret < 0) return ret; + + /* Get data */ + u32 nb_partitions = buffer[0]; + u64 table_offset = buffer[1] << 2; + + if (nb_partitions > 8) return -1; + + /* Read partition table */ + ret = WDVD_UnencryptedRead(buffer, 0x20, table_offset); + if (ret < 0) return ret; + + /* Find game partition */ + for (cnt = 0; cnt < nb_partitions; cnt++) + { + u32 type = buffer[cnt * 2 + 1]; + + /* Game partition */ + if(!type) offset = buffer[cnt * 2] << 2; + } + + /* No game partition found */ + if (!offset) return -1; + + /* Set output buffer */ + *outbuf = offset; + + WDVD_Seek(offset); + + return 0; +} + + +s32 Disc_Init(void) +{ + /* Init DVD subsystem */ + return WDVD_Init(); +} + +s32 Disc_Open(void) +{ + /* Reset drive */ + s32 ret = WDVD_Reset(); + if (ret < 0) return ret; + + memset(diskid, 0, 32); + + /* Read disc ID */ + return WDVD_ReadDiskId(diskid); +} + +s32 Disc_Wait(void) +{ + u32 cover = 0; + int icounter = 0; + + /* Wait for disc */ + while (!(cover & 0x2)) + { + /* Get cover status */ + s32 ret = WDVD_GetCoverStatus(&cover); + if (ret < 0) return ret; + + // 10 tries to make sure it doesn´t "freeze" in Install dialog + // if no Game Disc is insert + icounter++; + sleep(1); + if(icounter > 10) + return -1; + } + + return 0; +} + +s32 Disc_SetUSB(const u8 *id) +{ + if (id) return set_frag_list((u8 *) id); + + return WDVD_SetUSBMode(wbfsDev, (u8 *) id, -1); +} + +s32 Disc_ReadHeader(void *outbuf) +{ + /* Read Wii disc header */ + return WDVD_UnencryptedRead(outbuf, sizeof(struct discHdr), 0); +} + +s32 Disc_ReadGCHeader(void *outbuf) +{ + /* Read GC disc header */ + return WDVD_UnencryptedRead(outbuf, sizeof(struct gc_discHdr), 0); +} + +s32 Disc_Type(bool gc) +{ + s32 ret; + u32 check; + u32 magic; + + if (!gc) + { + check = WII_MAGIC; + struct discHdr *header = (struct discHdr *)buffer; + ret = Disc_ReadHeader(header); + magic = header->magic; + } + else + { + check = GC_MAGIC; + struct gc_discHdr *header = (struct gc_discHdr *)buffer; + ret = Disc_ReadGCHeader(header); + magic = header->magic; + } + + if (ret < 0) return ret; + + /* Check magic word */ + if (magic != check) return -1; + + return 0; +} + +s32 Disc_IsWii(void) +{ + return Disc_Type(0); +} + +s32 Disc_IsGC(void) +{ + return Disc_Type(1); +} + +s32 Disc_BootPartition(u64 offset, u8 vidMode, bool vipatch, bool countryString, u8 patchVidMode) +{ + entry_point p_entry; + + s32 ret = WDVD_OpenPartition(offset, 0, 0, 0, Tmd_Buffer); + if (ret < 0) return ret; + + /* Select an appropriate video mode */ + __Disc_SelectVMode(vidMode, 0); + + /* Setup low memory */; + __Disc_SetLowMem(); + + /* Run apploader */ + ret = Apploader_Run(&p_entry, vidMode, vmode, vipatch, countryString, patchVidMode); + free_wip(); + if (ret < 0) return ret; + + if (hooktype != 0) + ocarina_do_code(); + + gprintf("\n\nEntry Point is: %0x8\n", p_entry); +// gprintf("Lowmem:\n\n"); +// ghexdump((void*)0x80000000, 0x3f00); + + /* Set time */ + __Disc_SetTime(); + + /* Set an appropriate video mode */ + __Disc_SetVMode(); + + u8 temp_data[4]; + + // fix for PeppaPig + memcpy((char *) &temp_data, (void*)0x800000F4,4); + + usleep(100 * 1000); + + /* Shutdown IOS subsystems */ + SYS_ResetSystem(SYS_SHUTDOWN, 0, 0); + + /* Originally from tueidj - taken from NeoGamme (thx) */ + *(vu32*)0xCC003024 = 1; + + // fix for PeppaPig + memcpy((void*)0x800000F4,(char *) &temp_data, 4); + + appentrypoint = (u32) p_entry; + + gprintf("Jumping to entrypoint\n"); + + if (hooktype != 0) + { + __asm__( + "lis %r3, appentrypoint@h\n" + "ori %r3, %r3, appentrypoint@l\n" + "lwz %r3, 0(%r3)\n" + "mtlr %r3\n" + "nop\n" + "lis %r3, 0x8000\n" + "nop\n" + "ori %r3, %r3, 0x18A8\n" + "nop\n" + "mtctr %r3\n" + "bctr\n" + ); + } + else + { + __asm__( + "lis %r3, appentrypoint@h\n" + "ori %r3, %r3, appentrypoint@l\n" + "lwz %r3, 0(%r3)\n" + "mtlr %r3\n" + "blr\n" + ); + } + + return 0; +} + +s32 Disc_WiiBoot(u8 vidMode, bool vipatch, bool countryString, u8 patchVidModes) +{ + u64 offset; + + /* Find game partition offset */ + s32 ret = __Disc_FindPartition(&offset); + if (ret < 0) return ret; + + /* Boot partition */ + return Disc_BootPartition(offset, vidMode, vipatch, countryString, patchVidModes); +} diff --git a/source/loader/disc.h b/source/loader/disc.h new file mode 100644 index 00000000..a9481317 --- /dev/null +++ b/source/loader/disc.h @@ -0,0 +1,113 @@ +#ifndef _DISC_H_ +#define _DISC_H_ + +#ifndef APPLOADER_START /* Also defined in mem2.hpp */ +#define APPLOADER_START (void *)0x81200000 +#endif +#ifndef APPLOADER_END /* Also defined in mem2.hpp */ +#define APPLOADER_END (void *)0x81700000 +#endif + +#define Sys_Magic ((vu32*)0x80000020) +#define Version ((vu32*)0x80000024) +#define Arena_L ((vu32*)0x80000030) +#define BI2 ((vu32*)0x800000F4) +#define Bus_Speed ((vu32*)0x800000F8) +#define CPU_Speed ((vu32*)0x800000Fc) + +/* Disc header structure */ +struct discHdr +{ + /* Game ID */ + u8 id[6]; + + /* Game version */ + u16 version; + + /* Audio streaming */ + u8 streaming; + u8 bufsize; + + /* Padding */ + u64 chantitle; // Used for channels + + /* Sorting */ + u16 index; + u8 esrb; + u8 controllers; + u8 players; + u8 wifi; + + /* Wii Magic word */ + u32 magic; + + /* GC Magic word */ + u32 gc_magic; + + /* Game title */ + char title[64]; + + /* Encryption/Hashing */ + u8 encryption; + u8 h3_verify; + + /* Padding */ + u32 casecolor; + u8 unused3[26]; +} ATTRIBUTE_PACKED; + +struct dir_discHdr +{ + struct discHdr hdr; + char path[256]; + wchar_t title[64]; +} ATTRIBUTE_PACKED; + +struct gc_discHdr +{ + /* Game ID */ + u8 id[6]; + + /* Game version */ + u16 version; + + /* Audio streaming */ + u8 streaming; + u8 bufsize; + + /* Padding */ + u8 unused1[18]; + + /* Magic word */ + u32 magic; + + /* Padding */ + u8 unused2[4]; + + /* Game title */ + char title[124]; +} ATTRIBUTE_PACKED; + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + + /* Prototypes */ + s32 Disc_Init(void); + s32 Disc_Open(void); + s32 Disc_Wait(void); + s32 Disc_SetUSB(const u8 *); + s32 Disc_ReadHeader(void *); + s32 Disc_ReadGCHeader(void *); + s32 Disc_Type(bool); + s32 Disc_IsWii(void); + s32 Disc_IsGC(void); + s32 Disc_BootPartition(u64, u8, bool, bool, u8); + s32 Disc_WiiBoot(u8, bool, bool, u8); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif + diff --git a/source/loader/frag.c b/source/loader/frag.c new file mode 100644 index 00000000..5beeac06 --- /dev/null +++ b/source/loader/frag.c @@ -0,0 +1,300 @@ +#include +#include +#include +#include +#include + +#include "ntfs.h" +#include "ntfsfile_frag.h" + +#include "libwbfs/libwbfs.h" +#include "wbfs.h" +#include "wbfs_ext.h" +#include "usbstorage.h" +#include "frag.h" +#include "utils.h" +#include "sys.h" +#include "wdvd.h" +#include "gecko.h" +#include "ext2_frag.h" +#include "fatfile_frag.h" + +FragList *frag_list = NULL; + +void frag_init(FragList *ff, int maxnum) +{ + memset(ff, 0, sizeof(Fragment) * (maxnum+1)); + ff->maxnum = maxnum; +} + +void frag_dump(FragList *ff) +{ + int i; + gprintf("frag list: %d %d 0x%x\n", ff->num, ff->size, ff->size); + for (i = 0; i < ff->num; i++) + { + if (i > 10) + { + gprintf("...\n"); + break; + } + gprintf(" %d : %8x %8x %8x\n", i, ff->frag[i].offset, ff->frag[i].count, ff->frag[i].sector); + } +} + +int frag_append(FragList *ff, u32 offset, u32 sector, u32 count) +{ + int n; + if (count) + { + n = ff->num - 1; + if (ff->num > 0 && ff->frag[n].offset + ff->frag[n].count == offset && ff->frag[n].sector + ff->frag[n].count == sector) + ff->frag[n].count += count; + else + { + if (ff->num >= ff->maxnum) return -500; // too many fragments + + n = ff->num; + ff->frag[n].offset = offset; + ff->frag[n].sector = sector; + ff->frag[n].count = count; + ff->num++; + } + } + ff->size = offset + count; + return 0; +} + +int _frag_append(void *ff, u32 offset, u32 sector, u32 count) +{ + return frag_append(ff, offset, sector, count); +} + +int frag_concat(FragList *ff, FragList *src) +{ + int i, ret; + u32 size = ff->size; + + for (i=0; inum; i++) + { + ret = frag_append(ff, size + src->frag[i].offset, + src->frag[i].sector, src->frag[i].count); + if (ret) return ret; + } + ff->size = size + src->size; + + return 0; +} + +// in case a sparse block is requested, +// the returned poffset might not be equal to requested offset +// the difference should be filled with 0 +int frag_get(FragList *ff, u32 offset, u32 count, u32 *poffset, u32 *psector, u32 *pcount) +{ + int i; + u32 delta; + for (i=0; inum; i++) + { + if (ff->frag[i].offset <= offset && ff->frag[i].offset + ff->frag[i].count > offset) + { + delta = offset - ff->frag[i].offset; + *poffset = offset; + *psector = ff->frag[i].sector + delta; + *pcount = ff->frag[i].count - delta; + if (*pcount > count) *pcount = count; + goto out; + } + if (ff->frag[i].offset > offset && ff->frag[i].offset < offset + count) + { + delta = ff->frag[i].offset - offset; + *poffset = ff->frag[i].offset; + *psector = ff->frag[i].sector; + *pcount = ff->frag[i].count; + count -= delta; + if (*pcount > count) *pcount = count; + goto out; + } + } + // not found + if (offset + count > ff->size) return -1; // error: out of range! + + // if inside range, then it must be just sparse, zero filled + // return empty block at the end of requested + *poffset = offset + count; + *psector = 0; + *pcount = 0; + out: + + return 0; +} + +int frag_remap(FragList *ff, FragList *log, FragList *phy) +{ + int i; + u32 offset; + u32 sector; + for (i=0; inum; i++) + { + u32 delta = 0; + u32 count = 0; + do + { + int ret = frag_get(phy, log->frag[i].sector + delta + count, + log->frag[i].count - delta - count, &offset, §or, &count); + if (ret) return ret; // error + + delta = offset - log->frag[i].sector; + ret = frag_append(ff, log->frag[i].offset + delta, sector, count); + if (ret) return ret; // error + + } + while (count + delta < log->frag[i].count); + } + return 0; +} + +int get_frag_list(u8 *id, char *path, const u32 hdd_sector_size) +{ + char fname[1024]; + bzero(fname, 1024); + u32 length = strlen(path); + strcpy(fname, path); + + if(fname[length-1] > '0' && fname[length-1] < '9') return 0; + bool isWBFS = wbfs_part_fs != PART_FS_WBFS && strcasestr(strrchr(fname,'.'), ".wbfs") != 0; + + struct stat st; + FragList *fs = malloc(sizeof(FragList)); + FragList *fa = malloc(sizeof(FragList)); + FragList *fw = malloc(sizeof(FragList)); + int ret, ret_val = -1, i, j; + + frag_init(fa, MAX_FRAG); + + for (i = 0; i < 10; i++) // .wbfs1 - .wbfsA, 10 possible splits? lol overkill? + { + frag_init(fs, MAX_FRAG); + if (i > 0) + { + fname[length-1] = '0' + i; + if (stat(fname, &st) == -1) break; + } + if (wbfs_part_fs == PART_FS_FAT) + { + ret = _FAT_get_fragments(fname, &_frag_append, fs); + if (ret) + { + ret_val = 0; + goto out; + } + } + else if (wbfs_part_fs == PART_FS_NTFS) + { + ret = _NTFS_get_fragments(fname, &_frag_append, fs); + if (ret) + { + ret_val = ret; + goto out; + } + } + else if (wbfs_part_fs == PART_FS_EXT) + { + ret = _EXT2_get_fragments(fname, &_frag_append, fs); + if (ret) + { + ret_val = ret; + goto out; + } + } + else if (wbfs_part_fs == PART_FS_WBFS) + { + // if wbfs file format, remap. + wbfs_disc_t *d = WBFS_OpenDisc(id, path); + if (!d) + { + ret_val = -4; + WBFS_CloseDisc(d); + goto out; + } + ret = wbfs_get_fragments(d, &_frag_append, fs, hdd_sector_size); + WBFS_CloseDisc(d); + if (ret) + { + ret_val = -5; + goto out; + } + } + if (wbfs_part_fs == PART_FS_NTFS || wbfs_part_fs == PART_FS_EXT) + { + gprintf("Shifting all frags by sector: %d\n", wbfs_part_lba); + // offset to start of partition + for (j = 0; j < fs->num; j++) fs->frag[j].sector += wbfs_part_lba; + } + + frag_concat(fa, fs); + } + + frag_list = MEM2_alloc((sizeof(FragList)+31)&(~31)); + frag_init(frag_list, MAX_FRAG); + if (isWBFS) // If this is a .wbfs file format, remap. + { + wbfs_disc_t *disc = WBFS_OpenDisc(id, path); + if (!disc) + { + ret_val = -4; + goto out; + } + frag_init(fw, MAX_FRAG); + ret = wbfs_get_fragments(disc, &_frag_append, fw, hdd_sector_size); + if (ret) + { + ret_val = -5; + goto out; + } + WBFS_CloseDisc(disc); // Close before jumping on fail. + if (frag_remap(frag_list, fw, fa)) + { + ret_val = -6; + goto out; + } + } + else memcpy(frag_list, fa, sizeof(FragList)); // .iso files do not need a remap, just copy + + ret_val = 0; + +out: + if (ret_val) SAFE_FREE(frag_list); + SAFE_FREE(fs); + SAFE_FREE(fa); + SAFE_FREE(fw); + + return ret_val; +} + +int set_frag_list(u8 *id) +{ + if (frag_list == NULL) return -2; + + // (+1 for header which is same size as fragment) + int size = sizeof(Fragment) * (frag_list->num + 1); + DCFlushRange(frag_list, size); + + gprintf("Calling WDVD_SetFragList, frag list size %d\n", size); +/* if (size > 400) ghexdump(frag_list, 400); + else ghexdump(frag_list, size); */ + + int ret = WDVD_SetFragList(wbfsDev, frag_list, size); + + free(frag_list); + frag_list = NULL; + + if (ret) return ret; + + // verify id matches + char discid[32] ATTRIBUTE_ALIGN(32); + memset(discid, 0, sizeof(discid)); + + ret = WDVD_UnencryptedRead(discid, 32, 0); + gprintf("Reading ID after setting fraglist: %s (expected: %s)\n", discid, id); + return (strncasecmp((char *) id, discid, 6) != 0) ? -3 : 0; +} diff --git a/source/loader/frag.h b/source/loader/frag.h new file mode 100644 index 00000000..f780d7ba --- /dev/null +++ b/source/loader/frag.h @@ -0,0 +1,51 @@ + +// worst case wbfs fragmentation scenario: +// 9GB (dual layer) / 2mb (wbfs sector size) = 4608 +#define MAX_FRAG 20000 +// max that ehcmodule_frag will allow at the moment is about: +// 40000/4/3-1 = 21844 + +#ifdef __cplusplus +extern "C" { +#endif + +#include "gctypes.h" + +typedef struct +{ + u32 offset; // file offset, in sectors unit + u32 sector; + u32 count; +} Fragment; + +typedef struct +{ + u32 size; // num sectors + u32 num; // num fragments + u32 maxnum; + Fragment frag[MAX_FRAG]; +} FragList; + +typedef int (*frag_append_t)(void *ff, u32 offset, u32 sector, u32 count); + +//int _FAT_get_fragments (const char *path, _frag_append_t append_fragment, void *callback_data); + +void frag_init(FragList *ff, int maxnum); +void frag_dump(FragList *ff); +int frag_append(FragList *ff, u32 offset, u32 sector, u32 count); +int _frag_append(void *ff, u32 offset, u32 sector, u32 count); +int frag_concat(FragList *ff, FragList *src); + +// in case a sparse block is requested, +// the returned poffset might not be equal to requested offset +// the difference should be filled with 0 +int frag_get(FragList *ff, u32 offset, u32 count, + u32 *poffset, u32 *psector, u32 *pcount); + +int frag_remap(FragList *ff, FragList *log, FragList *phy); +int get_frag_list(u8 *id, char *path, const u32 hdd_sector_size); +int set_frag_list(u8 *id); + +#ifdef __cplusplus +} +#endif diff --git a/source/loader/fs.c b/source/loader/fs.c new file mode 100644 index 00000000..e525fdbf --- /dev/null +++ b/source/loader/fs.c @@ -0,0 +1,45 @@ +#include +#include +#include +#include +#include "utils.h" +#include "mem2.hpp" +#include "fs.h" + +u8 *ISFS_GetFile(u8 *path, u32 *size, s32 length) +{ + *size = 0; + + s32 fd = ISFS_Open((const char *) path, ISFS_OPEN_READ); + u8 *buf = NULL; + static fstats stats ATTRIBUTE_ALIGN(32); + + if (fd >= 0) + { + if (ISFS_GetFileStats(fd, &stats) >= 0) + { + if (length <= 0) length = stats.file_length; + if (length > 0) + buf = (u8 *) MEM2_alloc(ALIGN32(length)); + + if (buf) + { + *size = stats.file_length; + if (ISFS_Read(fd, (char*)buf, length) != length) + { + *size = 0; + SAFE_FREE(buf); + } + } + } + ISFS_Close(fd); + } + + if (*size > 0) + { + DCFlushRange(buf, *size); + ICInvalidateRange(buf, *size); + } + + return buf; +} \ No newline at end of file diff --git a/source/loader/fs.h b/source/loader/fs.h new file mode 100644 index 00000000..619057dd --- /dev/null +++ b/source/loader/fs.h @@ -0,0 +1,15 @@ +#ifndef _FS_H_ +#define _FS_H_ + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + +u8 *ISFS_GetFile(u8 *path, u32 *size, s32 length); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif + diff --git a/source/loader/fst.c b/source/loader/fst.c new file mode 100644 index 00000000..77d717cb --- /dev/null +++ b/source/loader/fst.c @@ -0,0 +1,648 @@ +/* + * Copyright (C) 2008 Nuke (wiinuke@gmail.com) + * + * this file is part of GeckoOS for USB Gecko + * http://www.usbgecko.com + * + * This program 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 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; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + + +#include +#include +#include +#include +#include +#include +#include +#include "fst.h" + +#include "gecko.h" +#include "sys.h" + +#include "patchcode.h" + +#include "codehandler.h" +#include "codehandleronly.h" +#include "multidol.h" + +#define FSTDIRTYPE 1 +#define FSTFILETYPE 0 +#define ENTRYSIZE 0xC + +#define MAX_FILENAME_LEN 128 + +static u8 *codelistend; +void *codelist; + +u32 gameconfsize = 0; +u32 *gameconf = NULL; + +u8 debuggerselect = 0; + +extern const u32 viwiihooks[4]; +extern const u32 kpadhooks[4]; +extern const u32 joypadhooks[4]; +extern const u32 gxdrawhooks[4]; +extern const u32 gxflushhooks[4]; +extern const u32 ossleepthreadhooks[4]; +extern const u32 axnextframehooks[4]; +extern const u32 wpadbuttonsdownhooks[4]; +extern const u32 wpadbuttonsdown2hooks[4]; + +int app_gameconfig_load(u8 *discid, const u8 *gameconfig, u32 tempgameconfsize) +{ + gameconfsize = 0; + + if (gameconf == NULL) + { + gameconf = malloc(65536); + if (gameconf == NULL) + return -1; + } + + if (gameconfig == NULL || tempgameconfsize == 0) + return -2; + + u8 *tempgameconf = (u8 *) gameconfig; + + u32 ret; + s32 gameidmatch, maxgameidmatch = -1, maxgameidmatch2 = -1; + u32 i, numnonascii, parsebufpos; + u32 codeaddr, codeval, codeaddr2, codeval2, codeoffset; + u32 temp, tempoffset = 0; + char parsebuffer[18]; + // Remove non-ASCII characters + numnonascii = 0; + for (i = 0; i < tempgameconfsize; i++) + { + if (tempgameconf[i] < 9 || tempgameconf[i] > 126) + numnonascii++; + else + tempgameconf[i-numnonascii] = tempgameconf[i]; + } + tempgameconfsize -= numnonascii; + + *(tempgameconf + tempgameconfsize) = 0; + //gameconf = (tempgameconf + tempgameconfsize) + (4 - (((u32) (tempgameconf + tempgameconfsize)) % 4)); + + for (maxgameidmatch = 0; maxgameidmatch <= 6; maxgameidmatch++) + { + i = 0; + while (i < tempgameconfsize) + { + maxgameidmatch2 = -1; + while (maxgameidmatch != maxgameidmatch2) + { + while (i != tempgameconfsize && tempgameconf[i] != ':') i++; + if (i == tempgameconfsize) break; + while ((tempgameconf[i] != 10 && tempgameconf[i] != 13) && (i != 0)) i--; + if (i != 0) i++; + parsebufpos = 0; + gameidmatch = 0; + while (tempgameconf[i] != ':') + { + if (tempgameconf[i] == '?') + { + parsebuffer[parsebufpos] = discid[parsebufpos]; + parsebufpos++; + gameidmatch--; + i++; + } + else if (tempgameconf[i] != 0 && tempgameconf[i] != ' ') + parsebuffer[parsebufpos++] = tempgameconf[i++]; + else if (tempgameconf[i] == ' ') + break; + else + i++; + if (parsebufpos == 8) break; + } + parsebuffer[parsebufpos] = 0; + if (strncasecmp("DEFAULT", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 7) + { + gameidmatch = 0; + goto idmatch; + } + if (strncmp((char *) discid, parsebuffer, strlen(parsebuffer)) == 0) + { + gameidmatch += strlen(parsebuffer); + idmatch: + if (gameidmatch > maxgameidmatch2) + maxgameidmatch2 = gameidmatch; + } + while ((i != tempgameconfsize) && (tempgameconf[i] != 10 && tempgameconf[i] != 13)) i++; + } + while (i != tempgameconfsize && tempgameconf[i] != ':') + { + parsebufpos = 0; + while ((i != tempgameconfsize) && (tempgameconf[i] != 10 && tempgameconf[i] != 13)) + { + if (tempgameconf[i] != 0 && tempgameconf[i] != ' ' && tempgameconf[i] != '(' && tempgameconf[i] != ':') + parsebuffer[parsebufpos++] = tempgameconf[i++]; + else if (tempgameconf[i] == ' ' || tempgameconf[i] == '(' || tempgameconf[i] == ':') + break; + else + i++; + if (parsebufpos == 17) break; + } + parsebuffer[parsebufpos] = 0; + //if (!autobootcheck) + { + //if (strncasecmp("addtocodelist(", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 14) + //{ + // ret = sscanf(tempgameconf + i, "%x %x", &codeaddr, &codeval); + // if (ret == 2) + // addtocodelist(codeaddr, codeval); + //} + if (strncasecmp("codeliststart", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 13) + { + sscanf((char *)(tempgameconf + i), " = %x", (unsigned int *)&codelist); + } + if (strncasecmp("codelistend", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 11) + { + sscanf((char *)(tempgameconf + i), " = %x", (unsigned int *)&codelistend); + } + /* + if (strncasecmp("hooktype", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 8) + { + if (hookset == 1) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 7) + config_bytes[2] = temp; + } + } + */ + if (strncasecmp("poke", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 4) + { + ret = sscanf((char *)tempgameconf + i, "( %x , %x", &codeaddr, &codeval); + if (ret == 2) + { + *(gameconf + (gameconfsize / 4)) = 0; + gameconfsize += 4; + *(gameconf + (gameconfsize / 4)) = 0; + gameconfsize += 8; + *(gameconf + (gameconfsize / 4)) = codeaddr; + gameconfsize += 4; + *(gameconf + (gameconfsize / 4)) = codeval; + gameconfsize += 4; + DCFlushRange((void *) (gameconf + (gameconfsize / 4) - 5), 20); + } + } + if (strncasecmp("pokeifequal", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 11) + { + ret = sscanf((char *)(tempgameconf + i), "( %x , %x , %x , %x", &codeaddr, &codeval, &codeaddr2, &codeval2); + if (ret == 4) + { + *(gameconf + (gameconfsize / 4)) = 0; + gameconfsize += 4; + *(gameconf + (gameconfsize / 4)) = codeaddr; + gameconfsize += 4; + *(gameconf + (gameconfsize / 4)) = codeval; + gameconfsize += 4; + *(gameconf + (gameconfsize / 4)) = codeaddr2; + gameconfsize += 4; + *(gameconf + (gameconfsize / 4)) = codeval2; + gameconfsize += 4; + DCFlushRange((void *) (gameconf + (gameconfsize / 4) - 5), 20); + } + } + if (strncasecmp("searchandpoke", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 13) + { + ret = sscanf((char *)(tempgameconf + i), "( %x%n", &codeval, &tempoffset); + if (ret == 1) + { + gameconfsize += 4; + temp = 0; + while (ret == 1) + { + *(gameconf + (gameconfsize / 4)) = codeval; + gameconfsize += 4; + temp++; + i += tempoffset; + ret = sscanf((char *)(tempgameconf + i), " %x%n", &codeval, &tempoffset); + } + *(gameconf + (gameconfsize / 4) - temp - 1) = temp; + ret = sscanf((char *)(tempgameconf + i), " , %x , %x , %x , %x", &codeaddr, &codeaddr2, &codeoffset, &codeval2); + if (ret == 4) + { + *(gameconf + (gameconfsize / 4)) = codeaddr; + gameconfsize += 4; + *(gameconf + (gameconfsize / 4)) = codeaddr2; + gameconfsize += 4; + *(gameconf + (gameconfsize / 4)) = codeoffset; + gameconfsize += 4; + *(gameconf + (gameconfsize / 4)) = codeval2; + gameconfsize += 4; + DCFlushRange((void *) (gameconf + (gameconfsize / 4) - temp - 5), temp * 4 + 20); + } + else + gameconfsize -= temp * 4 + 4; + } + + } + /* + if (strncasecmp("hook", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 4) + { + ret = sscanf(tempgameconf + i, "( %x %x %x %x %x %x %x %x", customhook, customhook + 1, customhook + 2, customhook + 3, customhook + 4, customhook + 5, customhook + 6, customhook + 7); + if (ret >= 3) + { + if (hookset != 1) + configwarn |= 4; + config_bytes[2] = 0x08; + customhooksize = ret * 4; + } + } + if (strncasecmp("002fix", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 6) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 0x1) + fakeiosversion = temp; + } + if (strncasecmp("switchios", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 9) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 1) + willswitchios = temp; + } + if (strncasecmp("videomode", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 9) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + { + if (temp == 0) + { + if (config_bytes[1] != 0x00) + configwarn |= 1; + config_bytes[1] = 0x00; + } + else if (temp == 1) + { + if (config_bytes[1] != 0x03) + configwarn |= 1; + config_bytes[1] = 0x03; + } + else if (temp == 2) + { + if (config_bytes[1] != 0x01) + configwarn |= 1; + config_bytes[1] = 0x01; + } + else if (temp == 3) + { + if (config_bytes[1] != 0x02) + configwarn |= 1; + config_bytes[1] = 0x02; + } + } + } + if (strncasecmp("language", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 8) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + { + if (temp == 0) + { + if (config_bytes[0] != 0xCD) + configwarn |= 2; + config_bytes[0] = 0xCD; + } + else if (temp > 0 && temp <= 10) + { + if (config_bytes[0] != temp-1) + configwarn |= 2; + config_bytes[0] = temp-1; + } + } + } + if (strncasecmp("diagnostic", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 10) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + { + if (temp == 0 || temp == 1) + diagcreate = temp; + } + } + if (strncasecmp("vidtv", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 5) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 1) + vipatchon = temp; + } + if (strncasecmp("fwritepatch", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 11) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 1) + applyfwritepatch = temp; + } + if (strncasecmp("dumpmaindol", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 11) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 1) + dumpmaindol = temp; + } + */ + } + /*else + { + + if (strncasecmp("autoboot", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 8) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 1) + autoboot = temp; + } + if (strncasecmp("autobootwait", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 12) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 255) + autobootwait = temp; + } + if (strncasecmp("autoboothbc", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 11) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 1) + autoboothbc = temp; + } + if (strncasecmp("autobootocarina", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 15) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 1) + config_bytes[4] = temp; + } + if (strncasecmp("autobootdebugger", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 16) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 1) + config_bytes[7] = temp; + } + if (strncasecmp("rebootermenuitem", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 16) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 1) + rebooterasmenuitem = temp; + } + if (strncasecmp("startupios", parsebuffer, strlen(parsebuffer)) == 0 && strlen(parsebuffer) == 10) + { + ret = sscanf(tempgameconf + i, " = %u", &temp); + if (ret == 1) + if (temp >= 0 && temp <= 255) + { + sdio_Shutdown(); + IOS_ReloadIOS(temp); + detectIOScapabilities(); + sd_init(); + startupiosloaded = 1; + } + } + + }*/ + if (tempgameconf[i] != ':') + { + while ((i != tempgameconfsize) && (tempgameconf[i] != 10 && tempgameconf[i] != 13)) i++; + if (i != tempgameconfsize) i++; + } + } + if (i != tempgameconfsize) while ((tempgameconf[i] != 10 && tempgameconf[i] != 13) && (i != 0)) i--; + } + } + return 0; + //tempcodelist = ((u8 *) gameconf) + gameconfsize; +} + +u8 *code_buf = NULL; +int code_size = 0; + +int ocarina_load_code(u8 *id, const u8 *cheat, u32 cheatSize) +{ + if (debuggerselect == 0x00) + codelist = (u8 *) 0x800022A8; + else + codelist = (u8 *) 0x800028B8; + codelistend = (u8 *) 0x80003000; + +// app_loadgameconfig((char *)id); + + code_buf = (u8 *)cheat; + code_size = cheatSize; + + if(code_size <= 0) + { + gprintf("Ocarina: No codes found\n"); + code_buf = NULL; + code_size = 0; + return 0; + } + + if (code_size > (u32)codelistend - (u32)codelist) + { + gprintf("Ocarina: Too many codes found\n"); + code_buf = NULL; + code_size = 0; + return 0; + } + + gprintf("Ocarina: Codes found.\n"); + + return code_size; +} + +void app_pokevalues() +{ + u32 i, *codeaddr, *codeaddr2, *addrfound = NULL; + + if (gameconfsize != 0) + { + for (i = 0; i < gameconfsize/4; i++) + { + if (*(gameconf + i) == 0) + { + if (((u32 *) (*(gameconf + i + 1))) == NULL || + *((u32 *) (*(gameconf + i + 1))) == *(gameconf + i + 2)) + { + *((u32 *) (*(gameconf + i + 3))) = *(gameconf + i + 4); + DCFlushRange((void *) *(gameconf + i + 3), 4); + } + i += 4; + } + else + { + codeaddr = (u32 *)*(gameconf + i + *(gameconf + i) + 1); + codeaddr2 = (u32 *)*(gameconf + i + *(gameconf + i) + 2); + if (codeaddr == 0 && addrfound != NULL) + codeaddr = addrfound; + else if (codeaddr == 0 && codeaddr2 != 0) + codeaddr = (u32 *) ((((u32) codeaddr2) >> 28) << 28); + else if (codeaddr == 0 && codeaddr2 == 0) + { + i += *(gameconf + i) + 4; + continue; + } + if (codeaddr2 == 0) + codeaddr2 = codeaddr + *(gameconf + i); + addrfound = NULL; + while (codeaddr <= (codeaddr2 - *(gameconf + i))) + { + if (memcmp(codeaddr, gameconf + i + 1, (*(gameconf + i)) * 4) == 0) + { + *(codeaddr + ((*(gameconf + i + *(gameconf + i) + 3)) / 4)) = *(gameconf + i + *(gameconf + i) + 4); + if (addrfound == NULL) addrfound = codeaddr; + } + codeaddr++; + } + i += *(gameconf + i) + 4; + } + } + } +} + +void load_handler() +{ + if (hooktype != 0x00) + { + if (debuggerselect == 0x01) + { + gprintf("Debbugger selected is gecko\n"); + memset((void*)0x80001800,0,codehandler_size); + memcpy((void*)0x80001800,codehandler,codehandler_size); + //if (pausedstartoption == 0x01) + // *(u32*)0x80002798 = 1; + memcpy((void*)0x80001CDE, &codelist, 2); + memcpy((void*)0x80001CE2, ((u8*) &codelist) + 2, 2); + memcpy((void*)0x80001F5A, &codelist, 2); + memcpy((void*)0x80001F5E, ((u8*) &codelist) + 2, 2); + DCFlushRange((void*)0x80001800,codehandler_size); + } + else + { + gprintf("Debbugger selected is not gecko\n"); + memset((void*)0x80001800,0,codehandleronly_size); + memcpy((void*)0x80001800,codehandleronly,codehandleronly_size); + memcpy((void*)0x80001906, &codelist, 2); + memcpy((void*)0x8000190A, ((u8*) &codelist) + 2, 2); + DCFlushRange((void*)0x80001800,codehandleronly_size); + } + + // Load multidol handler + memset((void*)0x80001000,0,multidol_size); + memcpy((void*)0x80001000,multidol,multidol_size); + DCFlushRange((void*)0x80001000,multidol_size); + switch(hooktype) + { + case 0x01: + memcpy((void*)0x8000119C,viwiihooks,12); + memcpy((void*)0x80001198,viwiihooks+3,4); + break; + case 0x02: + memcpy((void*)0x8000119C,kpadhooks,12); + memcpy((void*)0x80001198,kpadhooks+3,4); + break; + case 0x03: + memcpy((void*)0x8000119C,joypadhooks,12); + memcpy((void*)0x80001198,joypadhooks+3,4); + break; + case 0x04: + memcpy((void*)0x8000119C,gxdrawhooks,12); + memcpy((void*)0x80001198,gxdrawhooks+3,4); + break; + case 0x05: + memcpy((void*)0x8000119C,gxflushhooks,12); + memcpy((void*)0x80001198,gxflushhooks+3,4); + break; + case 0x06: + memcpy((void*)0x8000119C,ossleepthreadhooks,12); + memcpy((void*)0x80001198,ossleepthreadhooks+3,4); + break; + case 0x07: + memcpy((void*)0x8000119C,axnextframehooks,12); + memcpy((void*)0x80001198,axnextframehooks+3,4); + break; + case 0x08: + //if (customhooksize == 16) + //{ + // memcpy((void*)0x8000119C,customhook,12); + // memcpy((void*)0x80001198,customhook+3,4); + //} + break; + case 0x09: + //memcpy((void*)0x8000119C,wpadbuttonsdownhooks,12); + //memcpy((void*)0x80001198,wpadbuttonsdownhooks+3,4); + break; + case 0x0A: + //memcpy((void*)0x8000119C,wpadbuttonsdown2hooks,12); + //memcpy((void*)0x80001198,wpadbuttonsdown2hooks+3,4); + break; + } + DCFlushRange((void*)0x80001198,16); + } + memcpy((void *)0x80001800, (void*)0x80000000, 6); +} + +int ocarina_do_code(u64 chantitle) +{ + //if (!code_buf) return 0; // Need the handler loaded for hooking other than cheats! + + memset((void *)0x80001800, 0, 0x1800); + + char gameidbuffer[8]; + if(chantitle != 0) + { + memset(gameidbuffer, 0, 8); + gameidbuffer[0] = (chantitle & 0xff000000) >> 24; + gameidbuffer[1] = (chantitle & 0x00ff0000) >> 16; + gameidbuffer[2] = (chantitle & 0x0000ff00) >> 8; + gameidbuffer[3] = chantitle & 0x000000ff; + } + load_handler(); + + if(chantitle != 0) + { + memcpy((void *)0x80001800, gameidbuffer, 8); + DCFlushRange((void *)0x80001800, 8); + } + + if(codelist) + memset(codelist, 0, (u32)codelistend - (u32)codelist); + + //Copy the codes + if (code_size > 0 && code_buf) + { + memcpy(codelist, code_buf, code_size); + DCFlushRange(codelist, (u32)codelistend - (u32)codelist); + SAFE_FREE(code_buf); + } + + // TODO What's this??? + // enable flag + //*(vu8*)0x80001807 = 0x01; + + //This needs to be done after loading the .dol into memory + app_pokevalues(); + + return 1; +} diff --git a/source/loader/fst.h b/source/loader/fst.h new file mode 100644 index 00000000..cdeef853 --- /dev/null +++ b/source/loader/fst.h @@ -0,0 +1,41 @@ +/* + * Copyright (C) 2008 Nuke (wiinuke@gmail.com) + * + * this file is part of GeckoOS for USB Gecko + * http://www.usbgecko.com + * + * This program 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 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; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef __FST_H__ +#define __FST_H__ + +#ifdef __cplusplus +extern "C" { +#endif + +extern u8 debuggerselect; + +#define MAX_GCT_SIZE 2056 + +int app_gameconfig_load(u8 *id, const u8 *gameconfig, u32 gameconfigsize); +int ocarina_load_code(u8 *id, const u8 *cheat, u32 cheatSize); +int ocarina_do_code(); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/source/loader/multidol.c b/source/loader/multidol.c new file mode 100644 index 00000000..eada5c26 --- /dev/null +++ b/source/loader/multidol.c @@ -0,0 +1,36 @@ +/* + This file was autogenerated by raw2c. +Visit http://www.devkitpro.org +*/ + +const unsigned char multidol[] = { + 0x7f, 0xe8, 0x03, 0xa6, 0x7c, 0x08, 0x02, 0xa6, 0x90, 0x01, 0x00, 0xac, 0x7c, 0x00, 0x00, 0x26, + 0x90, 0x01, 0x00, 0x0c, 0x7c, 0x09, 0x02, 0xa6, 0x90, 0x01, 0x00, 0x10, 0x7c, 0x01, 0x02, 0xa6, + 0x90, 0x01, 0x00, 0x14, 0xbc, 0x61, 0x00, 0x18, 0x3c, 0x60, 0x80, 0x00, 0x60, 0x63, 0x18, 0xa8, + 0x3c, 0xe0, 0x80, 0x00, 0x60, 0xe7, 0x11, 0x98, 0x3e, 0x60, 0x80, 0x00, 0x62, 0x73, 0x11, 0x88, + 0x3e, 0x40, 0x4e, 0x80, 0x62, 0x52, 0x00, 0x20, 0x81, 0xc7, 0x00, 0x04, 0x81, 0xe7, 0x00, 0x08, + 0x82, 0x07, 0x00, 0x0c, 0x82, 0x27, 0x00, 0x00, 0x3c, 0x80, 0x80, 0x00, 0x3c, 0xa0, 0x81, 0x33, + 0x38, 0x84, 0xff, 0xfc, 0x84, 0xc4, 0x00, 0x04, 0x7c, 0x04, 0x28, 0x00, 0x40, 0x80, 0x00, 0x4c, + 0x7c, 0x06, 0x70, 0x00, 0x40, 0x82, 0xff, 0xf0, 0x84, 0xc4, 0x00, 0x04, 0x7c, 0x06, 0x78, 0x00, + 0x40, 0x82, 0xff, 0xe0, 0x84, 0xc4, 0x00, 0x04, 0x7c, 0x06, 0x80, 0x00, 0x40, 0x82, 0xff, 0xd4, + 0x84, 0xc4, 0x00, 0x04, 0x7c, 0x06, 0x88, 0x00, 0x40, 0x82, 0xff, 0xc8, 0x84, 0xc4, 0x00, 0x04, + 0x7c, 0x04, 0x28, 0x00, 0x40, 0x80, 0x00, 0x14, 0x7c, 0x06, 0x90, 0x00, 0x40, 0x82, 0xff, 0xf0, + 0x48, 0x00, 0x00, 0xad, 0x4b, 0xff, 0xff, 0xb0, 0x3c, 0x60, 0x80, 0x00, 0x60, 0x63, 0x10, 0x00, + 0x3e, 0x60, 0x80, 0x00, 0x62, 0x73, 0x11, 0x90, 0x3c, 0xe0, 0x80, 0x00, 0x60, 0xe7, 0x11, 0xa8, + 0x81, 0xc7, 0x00, 0x04, 0x81, 0xe7, 0x00, 0x08, 0x82, 0x07, 0x00, 0x0c, 0x82, 0x27, 0x00, 0x00, + 0x3c, 0x80, 0x80, 0x00, 0x3c, 0xa0, 0x81, 0x40, 0x38, 0x84, 0xff, 0xfc, 0x84, 0xc4, 0x00, 0x04, + 0x7c, 0x04, 0x28, 0x00, 0x40, 0x80, 0x00, 0x38, 0x7c, 0x06, 0x70, 0x00, 0x40, 0x82, 0xff, 0xf0, + 0x84, 0xc4, 0x00, 0x04, 0x7c, 0x06, 0x78, 0x00, 0x40, 0x82, 0xff, 0xe0, 0x84, 0xc4, 0x00, 0x04, + 0x7c, 0x06, 0x80, 0x00, 0x40, 0x82, 0xff, 0xd4, 0x84, 0xc4, 0x00, 0x04, 0x7c, 0x06, 0x88, 0x00, + 0x40, 0x82, 0xff, 0xc8, 0x48, 0x00, 0x00, 0x39, 0x4b, 0xff, 0xff, 0xc4, 0x80, 0x01, 0x00, 0xac, + 0x7c, 0x08, 0x03, 0xa6, 0x80, 0x01, 0x00, 0x0c, 0x7c, 0x0f, 0xf1, 0x20, 0x80, 0x01, 0x00, 0x10, + 0x7c, 0x09, 0x03, 0xa6, 0x80, 0x01, 0x00, 0x14, 0x7c, 0x01, 0x03, 0xa6, 0xb8, 0x61, 0x00, 0x18, + 0x80, 0x01, 0x00, 0x08, 0x38, 0x21, 0x00, 0xa8, 0x48, 0x00, 0x07, 0x50, 0x7e, 0x44, 0x18, 0x50, + 0x3c, 0xc0, 0x48, 0x00, 0x52, 0x46, 0x01, 0xba, 0x90, 0xc4, 0x00, 0x00, 0x90, 0xd3, 0x00, 0x00, + 0x90, 0x93, 0x00, 0x04, 0x7c, 0x00, 0x20, 0xac, 0x7c, 0x00, 0x04, 0xac, 0x7c, 0x00, 0x27, 0xac, + 0x4c, 0x00, 0x01, 0x2c, 0x4e, 0x80, 0x00, 0x20, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, + 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x38, 0xc7, 0x00, 0x4c, 0x7c, 0xe3, 0x3b, 0x78, + 0x38, 0x87, 0x00, 0x34, 0x38, 0xa7, 0x00, 0x38, 0x4e, 0x80, 0x04, 0x20, 0x7c, 0x00, 0x04, 0xac, + 0x4c, 0x00, 0x01, 0x2c, 0x7f, 0xe9, 0x03, 0xa6 +}; +const int multidol_size = sizeof(multidol); diff --git a/source/loader/multidol.h b/source/loader/multidol.h new file mode 100644 index 00000000..6984bc32 --- /dev/null +++ b/source/loader/multidol.h @@ -0,0 +1,14 @@ +/* + This file was autogenerated by raw2c. +Visit http://www.devkitpro.org +*/ + +//--------------------------------------------------------------------------------- +#ifndef _multidol_h_ +#define _multidol_h_ +//--------------------------------------------------------------------------------- +extern const unsigned char multidol[]; +extern const int multidol_size; +//--------------------------------------------------------------------------------- +#endif //_multidol_h_ +//--------------------------------------------------------------------------------- diff --git a/source/loader/patchcode.c b/source/loader/patchcode.c new file mode 100644 index 00000000..16fb3859 --- /dev/null +++ b/source/loader/patchcode.c @@ -0,0 +1,277 @@ +/* + * Copyright (C) 2008 Nuke (wiinuke@gmail.com) + * + * this file is part of GeckoOS for USB Gecko + * http://www.usbgecko.com + * + * This program 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 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; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ +#include +#include +#include +#include +#include + +#include "apploader.h" +#include "patchcode.h" +#include "gecko.h" + +extern void patchhook(u32 address, u32 len); +extern void patchhook2(u32 address, u32 len); +extern void patchhook3(u32 address, u32 len); + +extern void multidolpatchone(u32 address, u32 len); +extern void multidolpatchtwo(u32 address, u32 len); + +extern void regionfreejap(u32 address, u32 len); +extern void regionfreeusa(u32 address, u32 len); +extern void regionfreepal(u32 address, u32 len); + +extern void removehealthcheck(u32 address, u32 len); + +extern void copyflagcheck1(u32 address, u32 len); +extern void copyflagcheck2(u32 address, u32 len); +extern void copyflagcheck3(u32 address, u32 len); +extern void copyflagcheck4(u32 address, u32 len); +extern void copyflagcheck5(u32 address, u32 len); + +extern void patchupdatecheck(u32 address, u32 len); + +extern void movedvdhooks(u32 address, u32 len); + +extern void multidolhook(u32 address); +extern void langvipatch(u32 address, u32 len, u8 langbyte); +extern void vipatch(u32 address, u32 len); + +static const u32 multidolpatch1[2] = {0x3C03FFB4,0x28004F43}; +static const u32 multidolpatch2[2] = {0x3F608000, 0x807B0018}; + +static const u32 healthcheckhook[2] = {0x41810010,0x881D007D}; +static const u32 updatecheckhook[3] = {0x80650050,0x80850054,0xA0A50058}; + +static const u32 recoveryhooks[3] = {0xA00100AC,0x5400073E,0x2C00000F}; + +static const u32 nocopyflag1[3] = {0x540007FF, 0x4182001C, 0x80630068}; +static const u32 nocopyflag2[3] = {0x540007FF, 0x41820024, 0x387E12E2}; +// this one is for the GH3 and VC saves +//static const u32 nocopyflag3[5] = {0x2C030000, 0x40820010, 0x88010020, 0x28000002, 0x41820234}; +static const u32 nocopyflag3[5] = {0x2C030000, 0x41820200,0x48000058,0x38610100}; +// this removes the display warning for no copy VC and GH3 saves +static const u32 nocopyflag4[4] = {0x80010008, 0x2C000000, 0x4182000C, 0x3BE00001}; +static const u32 nocopyflag5[3] = {0x801D0024,0x540007FF,0x41820024}; + +static const u32 movedvdpatch[3] = {0x2C040000, 0x41820120, 0x3C608109}; +static const u32 regionfreehooks[5] = {0x7C600774, 0x2C000001, 0x41820030,0x40800010,0x2C000000}; +static const u32 cIOScode[16] = {0x7f06c378, 0x7f25cb78, 0x387e02c0, 0x4cc63182}; +static const u32 cIOSblock[16] = {0x2C1800F9, 0x40820008, 0x3B000024}; +static const u32 fwritepatch[8] = {0x9421FFD0,0x7C0802A6,0x90010034,0xBF210014,0x7C9B2378,0x7CDC3378,0x7C7A1B78,0x7CB92B78}; // bushing fwrite +static const u32 vipatchcode[3] = {0x4182000C,0x4180001C,0x48000018}; + +const u32 viwiihooks[4] = {0x7CE33B78,0x38870034,0x38A70038,0x38C7004C}; +const u32 kpadhooks[4] = {0x9A3F005E,0x38AE0080,0x389FFFFC,0x7E0903A6}; +const u32 kpadoldhooks[6] = {0x801D0060, 0x901E0060, 0x801D0064, 0x901E0064, 0x801D0068, 0x901E0068}; +const u32 joypadhooks[4] = {0x3AB50001, 0x3A73000C, 0x2C150004, 0x3B18000C}; +const u32 gxdrawhooks[4] = {0x3CA0CC01, 0x38000061, 0x3C804500, 0x98058000}; +const u32 gxflushhooks[4] = {0x90010014, 0x800305FC, 0x2C000000, 0x41820008}; +const u32 ossleepthreadhooks[4] = {0x90A402E0, 0x806502E4, 0x908502E4, 0x2C030000}; +const u32 axnextframehooks[4] = {0x3800000E, 0x7FE3FB78, 0xB0050000, 0x38800080}; +const u32 wpadbuttonsdownhooks[4] = {0x7D6B4A14, 0x816B0010, 0x7D635B78, 0x4E800020}; +const u32 wpadbuttonsdown2hooks[4] = {0x7D6B4A14, 0x800B0010, 0x7C030378, 0x4E800020}; + +const u32 multidolhooks[4] = {0x7C0004AC, 0x4C00012C, 0x7FE903A6, 0x4E800420}; +const u32 multidolchanhooks[4] = {0x4200FFF4, 0x48000004, 0x38800000, 0x4E800020}; + +const u32 langpatch[3] = {0x7C600775, 0x40820010, 0x38000000}; + +static const u32 oldpatch002[3] = {0x2C000000, 0x40820214, 0x3C608000}; +static const u32 newpatch002[3] = {0x2C000000, 0x48000214, 0x3C608000}; + +bool dogamehooks(void *addr, u32 len, bool channel) +{ + /* + 0 No Hook + 1 VBI + 2 KPAD read + 3 Joypad Hook + 4 GXDraw Hook + 5 GXFlush Hook + 6 OSSleepThread Hook + 7 AXNextFrame Hook + */ + + void *addr_start = addr; + void *addr_end = addr+len; + bool hookpatched = false; + + while(addr_start < addr_end) + { + switch(hooktype) + { + case 0x00: + hookpatched = true; + break; + + case 0x01: + if(memcmp(addr_start, viwiihooks, sizeof(viwiihooks))==0) + { + patchhook((u32)addr_start, len); + hookpatched = true; + } + break; + + case 0x02: + if(memcmp(addr_start, kpadhooks, sizeof(kpadhooks))==0) + { + patchhook((u32)addr_start, len); + hookpatched = true; + } + + if(memcmp(addr_start, kpadoldhooks, sizeof(kpadoldhooks))==0) + { + patchhook((u32)addr_start, len); + hookpatched = true; + } + break; + + case 0x03: + if(memcmp(addr_start, joypadhooks, sizeof(joypadhooks))==0) + { + patchhook((u32)addr_start, len); + hookpatched = true; + } + break; + + case 0x04: + if(memcmp(addr_start, gxdrawhooks, sizeof(gxdrawhooks))==0) + { + patchhook((u32)addr_start, len); + hookpatched = true; + } + break; + + case 0x05: + if(memcmp(addr_start, gxflushhooks, sizeof(gxflushhooks))==0) + { + patchhook((u32)addr_start, len); + hookpatched = true; + } + break; + + case 0x06: + if(memcmp(addr_start, ossleepthreadhooks, sizeof(ossleepthreadhooks))==0) + { + patchhook((u32)addr_start, len); + hookpatched = true; + } + break; + + case 0x07: + if(memcmp(addr_start, axnextframehooks, sizeof(axnextframehooks))==0) + { + patchhook((u32)addr_start, len); + hookpatched = true; + } + break; + + case 0x08: + /* if(memcmp(addr_start, customhook, customhooksize)==0) + { + patchhook((u32)addr_start, len); + hookpatched = true; + } */ + break; + } + if (hooktype != 0) + { + if(channel && memcmp(addr_start, multidolchanhooks, sizeof(multidolchanhooks))==0) + { + *(((u32*)addr_start)+1) = 0x7FE802A6; + DCFlushRange(((u32*)addr_start)+1, 4); + + multidolhook((u32)addr_start+sizeof(multidolchanhooks)-4); + hookpatched = true; + } + else if(!channel && memcmp(addr_start, multidolhooks, sizeof(multidolhooks))==0) + { + multidolhook((u32)addr_start+sizeof(multidolhooks)-4); + hookpatched = true; + } + } + addr_start += 4; + } + return hookpatched; +} + +void langpatcher(void *addr, u32 len) +{ + + void *addr_start = addr; + void *addr_end = addr+len; + + while(addr_start < addr_end) + { + + if(memcmp(addr_start, langpatch, sizeof(langpatch))==0) + if(configbytes[0] != 0xCD) + langvipatch((u32)addr_start, len, configbytes[0]); + + addr_start += 4; + } +} + +void vidolpatcher(void *addr, u32 len) +{ + + void *addr_start = addr; + void *addr_end = addr+len; + + while(addr_start < addr_end) + { + if(memcmp(addr_start, vipatchcode, sizeof(vipatchcode))==0) + vipatch((u32)addr_start, len); + + addr_start += 4; + } +} + +s32 IOSReloadBlock(u8 reqios) +{ + s32 ESHandle = IOS_Open("/dev/es", 0); + + if (ESHandle < 0) + { + gprintf("Reload IOS Block failed, cannot open /dev/es\n"); + return ESHandle; + } + + static ioctlv vector[2] ATTRIBUTE_ALIGN(32); + static u32 mode[8] ATTRIBUTE_ALIGN(32); + static u32 ios[8] ATTRIBUTE_ALIGN(32); + + mode[0] = 2; + vector[0].data = mode; + vector[0].len = 4; + + ios[0] = reqios; + vector[1].data = ios; + vector[1].len = 4; + + s32 r = IOS_Ioctlv(ESHandle, 0xA0, 2, 0, vector); + gprintf("Enable/Disable Block IOS Reload for cIOS%uv%u %s\n", IOS_GetVersion(), IOS_GetRevision() % 100, r < 0 ? "FAILED!" : "SUCCEEDED!"); + + IOS_Close(ESHandle); + + return r; +} \ No newline at end of file diff --git a/source/loader/patchcode.h b/source/loader/patchcode.h new file mode 100644 index 00000000..0131889b --- /dev/null +++ b/source/loader/patchcode.h @@ -0,0 +1,42 @@ +/* + * Copyright (C) 2008 Nuke (wiinuke@gmail.com) + * + * this file is part of GeckoOS for USB Gecko + * http://www.usbgecko.com + * + * This program 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 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; if not, write to the Free Software + * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + */ + +#ifndef __PATCHCODE_H__ +#define __PATCHCODE_H__ + +#ifdef __cplusplus +extern "C" { +#endif +// Globals +u32 hooktype; +u8 configbytes[2]; + +// Function prototypes +bool dogamehooks(void *addr, u32 len, bool channel); +void langpatcher(void *addr, u32 len); +void vidolpatcher(void *addr, u32 len); +s32 IOSReloadBlock(u8 reqios); + +#ifdef __cplusplus +} +#endif + +#endif // __PATCHCODE_H__ diff --git a/source/loader/patchhook.S b/source/loader/patchhook.S new file mode 100644 index 00000000..abdc4af4 --- /dev/null +++ b/source/loader/patchhook.S @@ -0,0 +1,505 @@ +.text +.set r0,0; .set sp,1; .set r2,2; .set r3,3; .set r4,4 +.set r5,5; .set r6,6; .set r7,7; .set r8,8; .set r9,9 +.set r10,10; .set r11,11; .set r12,12; .set r13,13; .set r14,14 +.set r15,15; .set r16,16; .set r17,17; .set r18,18; .set r19,19 +.set r20,20; .set r21,21; .set r22,22; .set r23,23; .set r24,24 +.set r25,25; .set r26,26; .set r27,27; .set r28,28; .set r29,29 +.set r30,30; .set r31,31 + + +.globl patchhook # r3 address +patchhook: + mtctr r4 + lis r6, 0x4E80 + ori r6, r6, 0x0020 # blr +findblr: + lwz r5, 0(r3) + cmpw r6, r5 + beq writebranch + addi r3, r3, 4 # next word + bdnz findblr # loop length + b exit # stop unhooked game hanging + +writebranch: + lis r4, 0x8000 # 800018A0 hook location (source) + ori r4, r4, 0x18A8 + subf r4, r3, r4 # subtract r3 from r4 and place in r4 + lis r5, 0x3FF + ori r5, r5, 0xFFFF # 0x3FFFFFF + and r4, r4, r5 + lis r5, 0x4800 # 0x48000000 + or r4, r4, r5 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exit: + blr # return + + .globl patchhook2 # r3 address +patchhook2: + mtctr r4 + lis r6, 0x4E80 + ori r6, r6, 0x0020 # blr +findblr2: + lwz r5, 0(r3) + cmpw r6, r5 + beq writebranch2 + addi r3, r3, 4 # next word + bdnz findblr2 # loop length + b exit2 # stop unhooked game hanging + +writebranch2: + lis r4, 0x8000 # 81700000 our temp patcher + ori r4, r4, 0x18a8 + subf r4, r3, r4 # subtract r3 from r4 and place in r4 + lis r5, 0x3FF + ori r5, r5, 0xFFFF # 0x3FFFFFF + and r4, r4, r5 + lis r5, 0x4800 # 0x48000000 + or r4, r4, r5 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exit2: + blr # return + +.globl patchhook3 # r3 address +patchhook3: + mtctr r4 + lis r6, 0x4BFF + ori r6, r6, 0xE955 # blr +findbne: + lwz r5, 0(r3) + cmpw r6, r5 + beq writebl + addi r3, r3, 4 # next word + bdnz findbne # loop length + b exit3 # stop unhooked game hanging + +writebl: + lis r4, 0x4BFF # 81700000 our temp patcher + ori r4, r4, 0xEA91 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exit3: + blr # return + +.globl multidolpatchone # r3 address +multidolpatchone: + mtctr r4 + lis r6, 0x3800 + ori r6, r6, 0x0001 # (li r0,1) +findmulti: + lwz r5, 0(r3) + cmpw r6, r5 + beq writemulti + subi r3, r3, 4 # go back + bdnz findmulti # loop length + b exit5 # stop unhooked game hanging + +writemulti: + lis r4, 0x8170 # 81700000 + ori r4, r4, 0x0020 + subf r18, r3, r4 # subf r18,(source),(dest) + lis r6, 0x4800 + ori r6,r6,1 + rlwimi r6,r18,0,6,29 + stw r6,0(r3) + stw r6,0(r19) + stw r3,4(r19) + dcbf r0, r3 + sync + icbi r0, r3 + isync +exit5: + blr # return + +.globl multidolpatchtwo # r3 address +multidolpatchtwo: + mtctr r4 + lis r6, 0x3F60 + ori r6, r6, 0x8000 # (lis r27,-32768) +findmulti2: + lwz r5, 0(r3) + cmpw r6, r5 + beq writemulti2 + addi r3, r3, 4 # go forward + bdnz findmulti2 # loop length + b exit6 # stop unhooked game hanging + +writemulti2: + lis r4, 0x8170 # 81700020 + ori r4, r4, 0x0000 + subf r18, r3, r4 # subf r18,(source),(dest) + lis r6, 0x4800 + ori r6,r6,1 + rlwimi r6,r18,0,6,29 + stw r6,0(r3) + stw r6,0(r19) + stw r3,4(r19) + dcbf r0, r3 + sync + icbi r0, r3 + isync +exit6: + blr # return + +.globl multidolhook # r3 address +multidolhook: + lis r4, 0x8000 # 80001000 hook location (source) + ori r4, r4, 0x1000 + subf r4, r3, r4 # subtract r3 from r4 and place in r4 + lis r5, 0x3FF + ori r5, r5, 0xFFFF # 0x3FFFFFF + and r4, r4, r5 + lis r5, 0x4800 # 0x48000000 + or r4, r4, r5 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 + blr # return + + +.globl langvipatch # r3 address, r4 len, r5 lang byte +langvipatch: + mtctr r4 + lis r6, 0x8861 + ori r6, r6, 0x0008 # lbz r3, 8(sp) +findlang: + lwz r7, 0(r3) + cmpw r6, r7 + beq patchlang + addi r3, r3, 4 # next word + bdnz findlang # loop length + b exitlang # stop unhooked game hanging + +patchlang: + + lis r4, 0x3860 # 0x38600001 li %r3, 1 # eng + add r4, r4, r5 +gofinal: + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exitlang: + blr # return + +.globl vipatch # r3 address +vipatch: + mtctr r4 + lis r6, 0x5400 + ori r6, r6, 0xFFFE +findvi: + lwz r5, 0(r3) + cmpw r6, r5 + beq patchvi + addi r3, r3, 4 # next word + bdnz findvi # loop length + b exitvi # stop unhooked game hanging + +patchvi: + lis r4, 0x8000 + ori r4, r4, 0x0003 + lbz r5, 0(r4) + cmpwi r5, 0x45 # USA + beq patchusa + cmpwi r5, 0x4A + beq patchjap2 # JAP + b exitvi +patchjap2: + lis r4, 0x3800 + ori r4, r4, 0x0001 + b gofinal2 +patchusa: + lis r4, 0x3800 + ori r4, r4, 0x0000 +gofinal2: + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exitvi: + blr # return + +.globl regionfreejap # r3 address +regionfreejap: + mtctr r4 + lis r6, 0x2C1B + ori r6, r6, 0x0000 # blr +findjap: + lwz r5, 0(r3) + cmpw r6, r5 + beq writenop + addi r3, r3, 4 # next word + bdnz findjap # loop length + b exitjap # stop unhooked game hanging + +writenop: + addi r3, r3, 4 # next word + lis r4, 0x6000 # nop + ori r4, r4, 0x0000 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exitjap: + blr # return + +.globl regionfreeusa # r3 address +regionfreeusa: + mtctr r4 + lis r6, 0x281B + ori r6, r6, 0x0001 # blr +findusa: + lwz r5, 0(r3) + cmpw r6, r5 + beq writenop1 + addi r3, r3, 4 # next word + bdnz findusa # loop length + b exitusa # stop unhooked game hanging + +writenop1: + addi r3, r3, 4 # next word + lis r4, 0x6000 # nop + ori r4, r4, 0x0000 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exitusa: + blr # return + +.globl regionfreepal # r3 address +regionfreepal: + mtctr r4 + lis r6, 0x281B + ori r6, r6, 0x0002 # blr +findpal: + lwz r5, 0(r3) + cmpw r6, r5 + beq writenop2 + addi r3, r3, 4 # next word + bdnz findpal # loop length + b exitpal # stop unhooked game hanging + +writenop2: + addi r3, r3, 4 # next word + lis r4, 0x6000 # nop + ori r4, r4, 0x0000 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 + + lis r6, 0x4082 + ori r6, r6, 0x001C # bne loc_81377A2C +findextra: #this is just the bne to b patch + lwz r5, 0(r3) + cmpw r6, r5 + beq writeb + addi r3, r3, 4 # next word + bdnz findextra # loop length + b exitpal # stop unhooked game hanging + +writeb: + addi r3, r3, 4 # next word + lis r4, 0x4800 + ori r4, r4, 0x001c # b loc_81377A2C + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exitpal: + blr # return + +.globl removehealthcheck # r3 address +removehealthcheck: + mtctr r4 + lis r6, 0x4182 + ori r6, r6, 0x004C # blr +findhe: + lwz r5, 0(r3) + cmpw r6, r5 + beq writebhe + addi r3, r3, 4 # next word + bdnz findhe # loop length + b exithe # stop unhooked game hanging + +writebhe: + lis r4, 0x6000 + ori r4, r4, 0x0000 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exithe: + blr # return + + + +.globl patchupdatecheck # r3 address +patchupdatecheck: + mtctr r4 + lis r6, 0x4082 + ori r6, r6, 0x0020 # blr +finduc: + lwz r5, 0(r3) + cmpw r6, r5 + beq writenopuc + addi r3, r3, 4 # next word + bdnz finduc # loop length + b exituc # stop unhooked game hanging + +writenopuc: + lis r4, 0x6000 + ori r4, r4, 0x0000 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exituc: + blr # return + + + + +.globl copyflagcheck1 # r3 address +copyflagcheck1: + mtctr r4 + lis r6, 0x5400 + ori r6, r6, 0x07FF +findncf1: + lwz r5, 0(r3) + cmpw r6, r5 + beq writencf1 + subi r3, r3, 4 # next word + bdnz findncf1 # loop length + b exitncf1 # stop unhooked game hanging + +writencf1: + lis r4, 0x7C00 + ori r4, r4, 0x0000 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exitncf1: + blr # return + +.globl copyflagcheck2 # r3 address +copyflagcheck2: + mtctr r4 + lis r6, 0x5400 + ori r6, r6, 0x07FF +findncf2: + lwz r5, 0(r3) + cmpw r6, r5 + beq writencf2 + subi r3, r3, 4 # next word + bdnz findncf2 # loop length + b exitncf2 # stop unhooked game hanging + +writencf2: + lis r4, 0x7C00 + ori r4, r4, 0x0000 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exitncf2: + blr # return + + +.globl copyflagcheck3 # r3 address +copyflagcheck3: +findncf3: + addi r3, r3, 20 # go back one dword (4 bytes) + lwz r5, 0(r3) +writencf3: + lis r4, 0x3860 + ori r4, r4, 0x0001 # li r3,1 + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exitncf3: + blr # return + + +.globl copyflagcheck4 # r3 address +copyflagcheck4: + mtctr r4 + lis r6, 0x3BE0 + ori r6, r6, 0x0001 # li r31,1 +findncf4: + lwz r5, 0(r3) + cmpw r6, r5 + beq writencf4 + addi r3, r3, 4 # next word + bdnz findncf4 # loop length + b exitncf4 # stop unhooked game hanging + +writencf4: + lis r4, 0x3BE0 + ori r4, r4, 0x0000 # change this to 3BE00000 (li r31,0) + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exitncf4: + blr # return + +.globl copyflagcheck5 # r3 address +copyflagcheck5: + mtctr r4 + lis r6, 0x4182 + ori r6, r6, 0x0024 # beq loc_8134AA60 +findncf5: + lwz r5, 0(r3) + cmpw r6, r5 + beq writencf5 + addi r3, r3, 4 # next word + bdnz findncf5 # loop length + b exitncf5 # stop unhooked game hanging + +writencf5: + #addi r3, r3, 8 # skip 2 + + lis r4, 0x801D + ori r4, r4, 0x0024 # change to 801D0024 (lwz r0,36(r29)) + stw r4, 0(r3) + dcbf r0, r3 + icbi r0, r3 + + addi r3, r3, 4 # next word + + lis r4, 0x5400 + ori r4, r4, 0x003C # change to 5400003C (rlwinm r0,r0,0,0,30) + stw r4, 0(r3) + dcbf r0, r3 + icbi r0, r3 + + addi r3, r3, 4 # next word + + lis r4, 0x901D + ori r4, r4, 0x0024 # change to 901D0024 (stw r0,36(r29)) + stw r4, 0(r3) + dcbf r0, r3 + icbi r0, r3 + + addi r3, r3, 4 # next word + + lis r4, 0x4800 + ori r4, r4, 0x0018 # change to 48000018 (b 0x8134aa60) + stw r4, 0(r3) + dcbf r0, r3 + icbi r0, r3 +exitncf5: + blr # return + +.globl movedvdhooks # r3 address +movedvdhooks: + lis r6, 0x4182 + ori r6, r6, 0x0120 # beq loc_813A7938 +findmd1: + addi r3, r3, 4 # next word + lwz r5, 0(r3) +writemd1: + lis r4, 0x6000 + ori r4, r4, 0x0000 # nop + stw r4, 0(r3) # result in r3 + dcbf r0, r3 # data cache block flush + icbi r0, r3 +exitmd1: + blr # return diff --git a/source/loader/playlog.c b/source/loader/playlog.c new file mode 100644 index 00000000..c1563f99 --- /dev/null +++ b/source/loader/playlog.c @@ -0,0 +1,129 @@ +/* + PLAYLOG.C + This code allows to modify play_rec.dat in order to store the + game time in Wii's log correctly. + + by Marc + Thanks to tueidj for giving me some hints on how to do it :) + Most of the code was taken from here: + http://forum.wiibrew.org/read.php?27,22130 +*/ + +#include +#include +#include +#include "gecko.h" + +#define PLAYRECPATH "/title/00000001/00000002/data/play_rec.dat" +#define SECONDS_TO_2000 946684800LL +#define TICKS_PER_SECOND 60750000LL + +typedef struct +{ + u32 checksum; + union + { + u32 data[31]; + struct + { + u8 name[84]; + u64 ticks_boot; + u64 ticks_last; + char title_id[6]; + char unknown[18]; + } ATTRIBUTE_PACKED; + }; +} playrec_struct; + +playrec_struct playrec_buf; + +// Thanks to Dr. Clipper +u64 getWiiTime(void) +{ + time_t uTime = time(NULL); + return TICKS_PER_SECOND * (uTime - SECONDS_TO_2000); +} + +int Playlog_Update(const char ID[6], const u8 title[84]) +{ + u32 sum = 0; + u8 i; + + //Open play_rec.dat + s32 playrec_fd = IOS_Open(PLAYRECPATH, IPC_OPEN_RW); + if(playrec_fd == -106) + { + gprintf("IOS_Open error ret: %i\n",playrec_fd); + IOS_Close(playrec_fd); + + //In case the play_rec.dat wasn´t found create one and try again + if(ISFS_CreateFile(PLAYRECPATH,0,3,3,3) < 0 ) + goto error_2; + + playrec_fd = IOS_Open(PLAYRECPATH, IPC_OPEN_RW); + if(playrec_fd < 0) + goto error_2; + } + else if(playrec_fd < 0) + goto error_2; + + u64 stime = getWiiTime(); + playrec_buf.ticks_boot = stime; + playrec_buf.ticks_last = stime; + + //Update channel name and ID + memcpy(playrec_buf.name, title, 84); + memcpy(playrec_buf.title_id, ID, 6); + + memset(playrec_buf.unknown, 0, 18); + + //Calculate and update checksum + for(i=0; i<31; i++) + sum += playrec_buf.data[i]; + playrec_buf.checksum=sum; + + //Write play_rec.dat + if(IOS_Write(playrec_fd, &playrec_buf, sizeof(playrec_buf)) != sizeof(playrec_buf)) + goto error_1; + + IOS_Close(playrec_fd); + return 0; + +error_1: + gprintf("error_1\n"); + IOS_Close(playrec_fd); + +error_2: + gprintf("error_2\n"); + return -1; +} + +int Playlog_Delete(void) //Make Wiiflow not show in playlog +{ + //Open play_rec.dat + s32 playrec_fd = IOS_Open(PLAYRECPATH, IPC_OPEN_RW); + if(playrec_fd < 0) + goto error_2; + + //Read play_rec.dat + if(IOS_Read(playrec_fd, &playrec_buf, sizeof(playrec_buf)) != sizeof(playrec_buf)) + goto error_1; + + if(IOS_Seek(playrec_fd, 0, 0) < 0) + goto error_1; + + // invalidate checksum + playrec_buf.checksum=0; + + if(IOS_Write(playrec_fd, &playrec_buf, sizeof(playrec_buf)) != sizeof(playrec_buf)) + goto error_1; + + IOS_Close(playrec_fd); + return 0; + +error_1: + IOS_Close(playrec_fd); + +error_2: + return -1; +} diff --git a/source/loader/playlog.h b/source/loader/playlog.h new file mode 100644 index 00000000..462686c4 --- /dev/null +++ b/source/loader/playlog.h @@ -0,0 +1,18 @@ +#ifndef _PLAYLOG_H_ +#define _PLAYLOG_H_ + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + +/* Prototypes */ +u64 getWiiTime(void); +int Playlog_Update(const char ID[6], const u8 title[84]); +int Playlog_Delete(void); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif + diff --git a/source/loader/ppc.h b/source/loader/ppc.h new file mode 100644 index 00000000..ae90eb10 --- /dev/null +++ b/source/loader/ppc.h @@ -0,0 +1,83 @@ + + +/* Condition Register Bit Fields */ + +#define cr0 0 +#define cr1 1 +#define cr2 2 +#define cr3 3 +#define cr4 4 +#define cr5 5 +#define cr6 6 +#define cr7 7 + + +/* General Purpose Registers */ + +#define r0 0 +#define r1 1 +#define r2 2 +#define r3 3 +#define r4 4 +#define r5 5 +#define r6 6 +#define r7 7 +#define r8 8 +#define r9 9 +#define r10 10 +#define r11 11 +#define r12 12 +#define r13 13 +#define r14 14 +#define r15 15 +#define r16 16 +#define r17 17 +#define r18 18 +#define r19 19 +#define r20 20 +#define r21 21 +#define r22 22 +#define r23 23 +#define r24 24 +#define r25 25 +#define r26 26 +#define r27 27 +#define r28 28 +#define r29 29 +#define r30 30 +#define r31 31 + +/* Define Floating Point Registers */ + +#define f0 0 +#define f1 1 +#define f2 2 +#define f3 3 +#define f4 4 +#define f5 5 +#define f6 6 +#define f7 7 +#define f8 8 +#define f9 9 +#define f10 10 +#define f11 11 +#define f12 12 +#define f13 13 +#define f14 14 +#define f15 15 +#define f16 16 +#define f17 17 +#define f18 18 +#define f19 19 +#define f20 20 +#define f21 21 +#define f22 22 +#define f23 23 +#define f24 24 +#define f25 25 +#define f26 26 +#define f27 27 +#define f28 28 +#define f29 29 +#define f30 30 +#define f31 31 diff --git a/source/loader/savefile.c b/source/loader/savefile.c new file mode 100644 index 00000000..82fc744f --- /dev/null +++ b/source/loader/savefile.c @@ -0,0 +1,113 @@ +/**************************************************************************** + * Copyright (C) 2011 + * by Dimok + * heavily modified by Miigotu + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + ***************************************************************************/ + +#include +#include +#include +#include +#include + +#include "wbfs.h" +#include "utils.h" +#include "gecko.h" +#include "savefile.h" + +static void CreateNandPath(const char *path, ...) +{ + char *tmp = NULL; + va_list va; + va_start(va, path); + if((vasprintf(&tmp, path, va) >= 0) && tmp) + { + gprintf("Creating Nand Path: %s\n", tmp); + makedir(tmp); + } + va_end(va); + SAFE_FREE(tmp); +} + +void CreateTitleTMD(const char *path, struct dir_discHdr *hdr) +{ + struct stat filestat; + if (stat(path, &filestat) == 0) + { + gprintf("%s Exists!\n", path); + return; + } + gprintf("Creating Game TMD: %s\n", path); + + wbfs_disc_t *disc = WBFS_OpenDisc((u8 *) &hdr->hdr.id, (char *) hdr->path); + if (!disc) return; + + u8 *titleTMD = NULL; + u32 tmd_size = wbfs_extract_file(disc, (char *) "TMD", (void **)&titleTMD); + WBFS_CloseDisc(disc); + + if(!titleTMD) return; + + FILE *file = fopen(path, "wb"); + if(file) + { + fwrite(titleTMD, 1, tmd_size, file); + gprintf("Written Game TMD to: %s\n", path); + fclose(file); + } + else gprintf("Openning %s failed returning %i\n", path, file); + + + SAFE_FREE(titleTMD); +} + +void CreateSavePath(const char *basepath, struct dir_discHdr *hdr) +{ + CreateNandPath("%s/import", basepath); + CreateNandPath("%s/meta", basepath); + CreateNandPath("%s/shared1", basepath); + CreateNandPath("%s/shared2", basepath); + CreateNandPath("%s/sys", basepath); + CreateNandPath("%s/ticket", basepath); + CreateNandPath("%s/tmp", basepath); + CreateNandPath("%s/title", basepath); + + const char *titlePath = "/title/00010000"; + + if( memcmp(hdr->hdr.id, "RGW", 3) == 0) + titlePath = "/title/00010004"; + + char fullpath[ISFS_MAXPATH] ATTRIBUTE_ALIGN(32); + + snprintf(fullpath, sizeof(fullpath), "%s%s", basepath, titlePath); + CreateNandPath(fullpath); + + char nandPath[ISFS_MAXPATH] ATTRIBUTE_ALIGN(32); + snprintf(nandPath, sizeof(nandPath), "%s/%02x%02x%02x%02x", fullpath, hdr->hdr.id[0], hdr->hdr.id[1], hdr->hdr.id[2], hdr->hdr.id[3]); + CreateNandPath(nandPath); + + CreateNandPath("%s/data", nandPath); + CreateNandPath("%s/content", nandPath); + + strcat(nandPath, "/content/title.tmd"); + CreateTitleTMD(nandPath, hdr); +} \ No newline at end of file diff --git a/source/loader/savefile.h b/source/loader/savefile.h new file mode 100644 index 00000000..5eabb7de --- /dev/null +++ b/source/loader/savefile.h @@ -0,0 +1,17 @@ +#ifndef SAVEPATH_H_ +#define SAVEPATH_H_ + +#include "disc.h" + +#ifdef __cplusplus + extern "C" { +#endif /* __cplusplus */ + +void CreateSavePath(const char *basepath, struct dir_discHdr *hdr); +void CreateTitleTMD(const char *path, struct dir_discHdr *hdr); + +#ifdef __cplusplus + } +#endif /* __cplusplus */ + +#endif \ No newline at end of file diff --git a/source/loader/sha1.c b/source/loader/sha1.c new file mode 100644 index 00000000..410715a1 --- /dev/null +++ b/source/loader/sha1.c @@ -0,0 +1,172 @@ +/* +SHA-1 in C +By Steve Reid +100% Public Domain + +Test Vectors (from FIPS PUB 180-1) +"abc" + A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D +"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" + 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1 +A million repetitions of "a" + 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F +*/ + +/* #define LITTLE_ENDIAN * This should be #define'd if true. */ +#define SHA1HANDSOFF + +#include +#include +#include "sha1.h" + +#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) + +/* blk0() and blk() perform the initial expand. */ +/* I got the idea of expanding during the round function from SSLeay */ +#ifdef LITTLE_ENDIAN +#define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ + |(rol(block->l[i],8)&0x00FF00FF)) +#else +#define blk0(i) block->l[i] +#endif +#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \ + ^block->l[(i+2)&15]^block->l[i&15],1)) + +/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ +#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); +#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30); +#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); +#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); +#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30); + + +/* Hash a single 512-bit block. This is the core of the algorithm. */ + +void SHA1Transform(unsigned long state[5], unsigned char buffer[64]) +{ +unsigned long a, b, c, d, e; +typedef union { + unsigned char c[64]; + unsigned long l[16]; +} CHAR64LONG16; +CHAR64LONG16* block; +#ifdef SHA1HANDSOFF +static unsigned char workspace[64]; + block = (CHAR64LONG16*)workspace; + memcpy(block, buffer, 64); +#else + block = (CHAR64LONG16*)buffer; +#endif + /* Copy context->state[] to working vars */ + a = state[0]; + b = state[1]; + c = state[2]; + d = state[3]; + e = state[4]; + /* 4 rounds of 20 operations each. Loop unrolled. */ + R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3); + R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7); + R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11); + R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15); + R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19); + R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23); + R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27); + R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31); + R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35); + R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39); + R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43); + R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47); + R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51); + R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55); + R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59); + R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63); + R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67); + R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71); + R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75); + R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79); + /* Add the working vars back into context.state[] */ + state[0] += a; + state[1] += b; + state[2] += c; + state[3] += d; + state[4] += e; + /* Wipe variables */ + a = b = c = d = e = 0; +} + + +/* SHA1Init - Initialize new context */ + +void SHA1Init(SHA1_CTX* context) +{ + /* SHA1 initialization constants */ + context->state[0] = 0x67452301; + context->state[1] = 0xEFCDAB89; + context->state[2] = 0x98BADCFE; + context->state[3] = 0x10325476; + context->state[4] = 0xC3D2E1F0; + context->count[0] = context->count[1] = 0; +} + + +/* Run your data through this. */ + +void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int len) +{ +unsigned int i, j; + + j = (context->count[0] >> 3) & 63; + if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++; + context->count[1] += (len >> 29); + if ((j + len) > 63) { + memcpy(&context->buffer[j], data, (i = 64-j)); + SHA1Transform(context->state, context->buffer); + for ( ; i + 63 < len; i += 64) { + SHA1Transform(context->state, &data[i]); + } + j = 0; + } + else i = 0; + memcpy(&context->buffer[j], &data[i], len - i); +} + + +/* Add padding and return the message digest. */ + +void SHA1Final(unsigned char digest[20], SHA1_CTX* context) +{ +unsigned long i, j; +unsigned char finalcount[8]; + + for (i = 0; i < 8; i++) { + finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)] + >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ + } + SHA1Update(context, (unsigned char *)"\200", 1); + while ((context->count[0] & 504) != 448) { + SHA1Update(context, (unsigned char *)"\0", 1); + } + SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */ + for (i = 0; i < 20; i++) { + digest[i] = (unsigned char) + ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); + } + /* Wipe variables */ + i = j = 0; + memset(context->buffer, 0, 64); + memset(context->state, 0, 20); + memset(context->count, 0, 8); + memset(&finalcount, 0, 8); +#ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */ + SHA1Transform(context->state, context->buffer); +#endif +} + +void SHA1(unsigned char *ptr, unsigned int size, unsigned char *outbuf) { + SHA1_CTX ctx; + + SHA1Init(&ctx); + SHA1Update(&ctx, ptr, size); + SHA1Final(outbuf, &ctx); +} + diff --git a/source/loader/sha1.h b/source/loader/sha1.h new file mode 100644 index 00000000..253d4695 --- /dev/null +++ b/source/loader/sha1.h @@ -0,0 +1,12 @@ +typedef struct { + unsigned long state[5]; + unsigned long count[2]; + unsigned char buffer[64]; +} SHA1_CTX; + +void SHA1Transform(unsigned long state[5], unsigned char buffer[64]); +void SHA1Init(SHA1_CTX* context); +void SHA1Update(SHA1_CTX* context, unsigned char* data, unsigned int len); +void SHA1Final(unsigned char digest[20], SHA1_CTX* context); + +void SHA1(unsigned char *ptr, unsigned int size, unsigned char *outbuf); diff --git a/source/loader/splits.c b/source/loader/splits.c new file mode 100644 index 00000000..ff186213 --- /dev/null +++ b/source/loader/splits.c @@ -0,0 +1,319 @@ + +// by oggzee + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include "splits.h" +#include "gecko.h" + +#define off64_t off_t +#define FMT_llu "%llu" +#define FMT_lld "%lld" + +#define split_error(x) do { printf("\nsplit error: %s\n\n",x); } while(0) + +// 1 cluster less than 4gb +u64 OPT_split_size = (u64)4LL * 1024 * 1024 * 1024 - 32 * 1024; +// 1 cluster less than 2gb +//u64 OPT_split_size = (u64)2LL * 1024 * 1024 * 1024 - 32 * 1024; + +//split_info_t split; + +void split_get_fname(split_info_t *s, int idx, char *fname) +{ + strcpy(fname, s->fname); + if (idx == 0 && s->create_mode) { +// strcat(fname, ".tmp"); + } else if (idx > 0) { + char *c = fname + strlen(fname) - 1; + *c = '0' + idx; + } +} + +int split_open_file(split_info_t *s, int idx) +{ + int fd = s->fd[idx]; + if (fd>=0) return fd; + char fname[1024]; + split_get_fname(s, idx, fname); + //char *mode = s->create_mode ? "wb+" : "rb+"; + int mode = s->create_mode ? (O_CREAT | O_RDWR) : O_RDWR ; + //gprintf("SPLIT OPEN %s %s %d\n", fname, mode, idx); //Wpad_WaitButtons(); + //f = fopen(fname, mode); + fd = open(fname, mode); + if (fd<0) return -1; + if (idx > 0 && s->create_mode) { +// gprintf("%s Split: %d %s \n", +// s->create_mode ? "Create" : "Read", +// idx, fname); + } + s->fd[idx] = fd; + return fd; +} + +// faster as it uses larger chunks than ftruncate internally +int write_zero(int fd, off_t size) +{ + int buf[0x4000]; //64kb + int chunk; + int ret; + memset(buf, 0, sizeof(buf)); + while (size) { + chunk = size; + if (chunk > sizeof(buf)) chunk = sizeof(buf); + ret = write(fd, buf, chunk); +// gprintf("WZ %d %d / %lld \n", ret, chunk, size); + size -= chunk; + if (ret < 0) return ret; + } + return 0; +} + +int split_fill(split_info_t *s, int idx, u64 size) +{ + int fd = split_open_file(s, idx); + + off64_t fsize = lseek(fd, 0, SEEK_END); + if (fsize < size) { +// gprintf("TRUNC %d "FMT_lld" "FMT_lld"\n", idx, size, fsize); // Wpad_WaitButtons(); + ftruncate(fd, size); +// write_zero(fd, size - fsize); + return 1; + } + return 0; +} + +int split_get_file(split_info_t *s, u32 lba, u32 *sec_count, int fill) +{ + int fd; + if (lba >= s->total_sec) { + fprintf(stderr, "SPLIT: invalid sector %u / %u\n", lba, (u32)s->total_sec); + return -1; + } + int idx; + idx = lba / s->split_sec; + if (idx >= s->max_split) { + fprintf(stderr, "SPLIT: invalid split %d / %d\n", idx, s->max_split - 1); + return -1; + } + fd = s->fd[idx]; + if (fd<0) { + // opening new, make sure all previous are full + int i; + for (i=0; isplit_size)) { + printf("FILL %d\n", i); + } + } + fd = split_open_file(s, idx); + } + if (fd<0) { + fprintf(stderr, "SPLIT %d: no file\n", idx); + return -1; + } + u32 sec = lba % s->split_sec; // inside file + off64_t off = (off64_t)sec * 512; + // num sectors till end of file + u32 to_end = s->split_sec - sec; + if (*sec_count > to_end) *sec_count = to_end; + if (s->create_mode) { + if (fill) { + // extend, so that read will be succesfull + split_fill(s, idx, off + 512 * (*sec_count)); + } else { + // fill up so that write continues from end of file + // shouldn't be necessary, but libfat looks buggy + // and this is faster + split_fill(s, idx, off); + } + } + lseek(fd, off, SEEK_SET); + return fd; +} + +int split_read_sector(void *_fp,u32 lba,u32 count,void*buf) +{ + split_info_t *s = _fp; + int fd; + u64 off = lba; + off *= 512ULL; + int i; + u32 chunk; + size_t ret; + //fprintf(stderr,"READ %d %d\n", lba, count); + for (i=0; i<(int)count; i+=chunk) { + chunk = count - i; + fd = split_get_file(s, lba+i, &chunk, 1); + if (fd<0) { + fprintf(stderr,"\n\n"FMT_lld" %d %p\n",off,count,_fp); + split_error("error seeking in disc partition"); + return 1; + } + //ret = fread(buf+i*512, 512ULL, chunk, f); + ret = read(fd, buf+i*512, chunk * 512); + if (ret != chunk * 512) { + fprintf(stderr, "error reading %u %u [%u] %u = %u\n", + lba, count, i, chunk, ret); + split_error("error reading disc"); + return 1; + } + } + return 0; +} + +int split_write_sector(void *_fp,u32 lba,u32 count,void*buf) +{ + split_info_t *s = _fp; + int fd; + u64 off = lba; + off*=512ULL; + int i; + u32 chunk; + size_t ret; +// gprintf("WRITE %d %d %p \n", lba, count, buf); + for (i=0; i<(int)count; i+=chunk) { + chunk = count - i; + fd = split_get_file(s, lba+i, &chunk, 0); +// gprintf("WRITE Got file: %d\n", fd); + //if (chunk != count) + // fprintf(stderr, "WRITE CHUNK %d %d/%d\n", lba+i, chunk, count); + if (fd<0 || !chunk) { + fprintf(stderr,"\n\n"FMT_lld" %d %p\n",off,count,_fp); + split_error("error seeking in disc partition"); + return 1; + } + //if (fwrite(buf+i*512, 512ULL, chunk, f) != chunk) { +// gprintf("write %d %p %d \n", fd, buf+i*512, chunk * 512); + ret = write(fd, buf+i*512, chunk * 512); +// gprintf("write ret = %d \n", ret); + if (ret != chunk * 512) { + split_error("error writing disc"); + return 1; + } + } + return 0; +} + +void split_init(split_info_t *s, char *fname) +{ + int i; + char *p; + //fprintf(stderr, "SPLIT_INIT %s\n", fname); + memset(s, 0, sizeof(*s)); + for (i=0; ifd[i] = -1; + } + strcpy(s->fname, fname); + s->max_split = 1; + p = strrchr(fname, '.'); + if (p && (strcasecmp(p, ".wbfs") == 0)) { + s->max_split = MAX_SPLIT; + } +} + +void split_set_size(split_info_t *s, u64 split_size, u64 total_size) +{ + s->total_size = total_size; + s->split_size = split_size; + s->total_sec = total_size / 512; + s->split_sec = split_size / 512; +} + +void split_close(split_info_t *s) +{ + int i; +// char fname[1024]; +// char tmpname[1024]; + for (i=0; imax_split; i++) { + if (s->fd[i] >= 0) { + close(s->fd[i]); + } + } +// if (s->create_mode) { +// split_get_fname(s, -1, fname); +// split_get_fname(s, 0, tmpname); +// rename(tmpname, fname); +// } + memset(s, 0, sizeof(*s)); +} + +int split_create(split_info_t *s, char *fname, + u64 split_size, u64 total_size, bool overwrite) +{ + int i; + int fd; + char sname[1024]; + int error = 0; + split_init(s, fname); + s->create_mode = 1; + // check if any file already exists + for (i=-1; imax_split; i++) { + split_get_fname(s, i, sname); + if (overwrite) { + remove(sname); + } else { + fd = open(sname, O_RDONLY); + if (fd >= 0) { + fprintf(stderr, "Error: file already exists: %s\n", sname); + close(fd); + error = 1; + } + } + } + if (error) { + split_init(s, ""); + return -1; + } + split_set_size(s, split_size, total_size); + return 0; +} + +int split_open(split_info_t *s, char *fname) +{ + int i; + u64 size = 0; + u64 total_size = 0; + u64 split_size = 0; + int fd; + split_init(s, fname); + for (i=0; imax_split; i++) { + fd = split_open_file(s, i); + if (fd<0) { + if (i==0) goto err; + break; + } + // check previous size - all splits except last must be same size + if (i > 0 && size != split_size) { + fprintf(stderr, "split %d: invalid size "FMT_lld"", i, size); + goto err; + } + // get size + //fseeko(f, 0, SEEK_END); + //size = ftello(f); + size = lseek(fd, 0, SEEK_END); + // check sector alignment + if (size % 512) { + fprintf(stderr, "split %d: size ("FMT_lld") not sector (512) aligned!", + i, size); + } + // first sets split size + if (i==0) { + split_size = size; + } + total_size += size; + } + split_set_size(s, split_size, total_size); + return 0; +err: + split_close(s); + return -1; +} + diff --git a/source/loader/splits.h b/source/loader/splits.h new file mode 100644 index 00000000..bef8af14 --- /dev/null +++ b/source/loader/splits.h @@ -0,0 +1,42 @@ + +#define MAX_SPLIT 10 + +#ifdef __cplusplus +extern "C" { +#endif + +typedef struct split_info +{ + char fname[1024]; + //FILE *f[MAX_SPLIT]; + int fd[MAX_SPLIT]; + //u64 fsize[MAX_SPLIT]; + u32 split_sec; + u32 total_sec; + u64 split_size; + u64 total_size; + int create_mode; + int max_split; +} split_info_t; + +// 1 sector less than 4gb +extern u64 OPT_split_size; + +void split_get_fname(split_info_t *s, int idx, char *fname); +//FILE *split_open_file(split_info_t *s, int idx); +//FILE *split_get_file(split_info_t *s, u32 lba, u32 *sec_count, int fill); +int split_open_file(split_info_t *s, int idx); +int split_get_file(split_info_t *s, u32 lba, u32 *sec_count, int fill); +int split_fill(split_info_t *s, int idx, u64 size); +int split_read_sector(void *_fp,u32 lba,u32 count,void*buf); +int split_write_sector(void *_fp,u32 lba,u32 count,void*buf); +void split_init(split_info_t *s, char *fname); +void split_set_size(split_info_t *s, u64 split_size, u64 total_size); +void split_close(split_info_t *s); +int split_open(split_info_t *s, char *fname); +int split_create(split_info_t *s, char *fname, + u64 split_size, u64 total_size, bool overwrite); + +#ifdef __cplusplus +} +#endif diff --git a/source/loader/sys.c b/source/loader/sys.c new file mode 100644 index 00000000..571f0809 --- /dev/null +++ b/source/loader/sys.c @@ -0,0 +1,115 @@ +#include +#include +#include +#include +#include "mem2.hpp" +#include +#include "sys.h" +#include "gecko.h" + +#include +#include "sha1.h" +#include "fs.h" +#include "mem2.hpp" + +/* Variables */ +static bool reset = false; +static bool shutdown = false; +bool exiting = false; + +static bool return_to_hbc = false; +static bool return_to_menu = false; +static bool return_to_priiloader = false; +static bool return_to_disable = false; +static bool return_to_bootmii = false; + +void Open_Inputs(void) +{ + if(WPAD_GetStatus() != WPAD_STATE_ENABLED && WPAD_GetStatus() != WPAD_STATE_ENABLING) + { + WPAD_Init(); + PAD_Init(); + WPAD_SetDataFormat(WPAD_CHAN_ALL, WPAD_FMT_BTNS_ACC_IR); + } +} + +void Close_Inputs(void) +{ + while(WPAD_GetStatus() == WPAD_STATE_ENABLING); //Possible freeze if i keep this here? + if(WPAD_GetStatus() == WPAD_STATE_ENABLED) + { + WPAD_Flush(WPAD_CHAN_ALL); + WPAD_Shutdown(); + } +} + +bool Sys_Exiting(void) +{ + return reset || shutdown || exiting; +} + +void Sys_Test(void) +{ + if(reset || shutdown) Close_Inputs(); + + if (reset) SYS_ResetSystem(SYS_RESTART, 0, 0); + else if (shutdown) SYS_ResetSystem(SYS_POWEROFF, 0, 0); +} + +void Sys_ExitTo(int option) +{ + return_to_hbc = option == EXIT_TO_HBC; + return_to_menu = option == EXIT_TO_MENU; + return_to_priiloader = option == EXIT_TO_PRIILOADER; + return_to_disable = option == EXIT_TO_DISABLE; + return_to_bootmii = option == EXIT_TO_BOOTMII; + + //magic word to force wii menu in priiloader. + if(return_to_menu) + { + Write32(0x8132fffb, 0x50756e65); + } + else if(return_to_priiloader) + { + Write32(0x8132fffb,0x4461636f); + } +} + +void Sys_Exit(void) +{ + if(return_to_disable) return; + + /* Shutdown Inputs */ + Close_Inputs(); + + if (return_to_menu || return_to_priiloader) Sys_LoadMenu(); + else if(return_to_bootmii) IOS_ReloadIOS(254); + if(WII_LaunchTitle(HBC_108)<0) + if(WII_LaunchTitle(HBC_HAXX)<0) + if(WII_LaunchTitle(HBC_JODI)<0) + SYS_ResetSystem(SYS_RETURNTOMENU, 0, 0); +} + +void __Sys_ResetCallback(void) +{ + reset = true; +} + +void __Sys_PowerCallback(void) +{ + shutdown = true; +} + + +void Sys_Init(void) +{ + /* Set RESET/POWER button callback */ + SYS_SetResetCallback(__Sys_ResetCallback); + SYS_SetPowerCallback(__Sys_PowerCallback); +} + +void Sys_LoadMenu(void) +{ + /* Return to the Wii system menu */ + SYS_ResetSystem(SYS_RETURNTOMENU, 0, 0); +} \ No newline at end of file diff --git a/source/loader/sys.h b/source/loader/sys.h new file mode 100644 index 00000000..d761e97f --- /dev/null +++ b/source/loader/sys.h @@ -0,0 +1,36 @@ +#ifndef _SYS_H_ +#define _SYS_H_ + +#include "utils.h" + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + +#define HBC_108 0x00010001af1bf516ULL +#define HBC_JODI 0x0001000148415858ULL +#define HBC_HAXX 0x000100014a4f4449ULL + +#define EXIT_TO_MENU 0 +#define EXIT_TO_HBC 1 +#define EXIT_TO_PRIILOADER 2 +#define EXIT_TO_DISABLE 3 +#define EXIT_TO_BOOTMII 4 +#define EXIT_TO_WIIFLOW 5 + + /* Prototypes */ + void Sys_Init(void); + void Sys_LoadMenu(void); + bool Sys_Exiting(void); + void Sys_Test(void); + void Sys_Exit(void); + void Sys_ExitTo(int); + + void Open_Inputs(void); + void Close_Inputs(void); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif diff --git a/source/loader/utils.c b/source/loader/utils.c new file mode 100644 index 00000000..d5d30dfe --- /dev/null +++ b/source/loader/utils.c @@ -0,0 +1,61 @@ +#include +#include +#include + +#include "gecko.h" + +#define MAX_BLOCKSIZE 0x10000 + +u64 le64(u64 x) +{ + return + ((x & 0xFF00000000000000) >> 56) | + ((x & 0x00FF000000000000) >> 40) | + ((x & 0x0000FF0000000000) >> 24) | + ((x & 0x000000FF00000000) >> 8 ) | + ((x & 0x00000000FF000000) << 8 ) | + ((x & 0x0000000000FF0000) << 24) | + ((x & 0x000000000000FF00) << 40) | + ((x & 0x00000000000000FF) << 56); +} + +u32 le32(u32 x) +{ + return + ((x & 0x000000FF) << 24) | + ((x & 0x0000FF00) << 8) | + ((x & 0x00FF0000) >> 8) | + ((x & 0xFF000000) >> 24); +} + +u16 le16(u16 x) +{ + return + ((x & 0x00FF) << 8) | + ((x & 0xFF00) >> 8); +} + +bool str_replace(char *str, const char *olds, const char *news, int size) +{ + char *p = strstr(str, olds); + if (!p) return false; + // new len + int len = strlen(str) - strlen(olds) + strlen(news); + if (len >= size) return false; + // move remainder to fit (and nul) + memmove(p+strlen(news), p+strlen(olds), strlen(p)-strlen(olds)+1); + // copy new in place + memcpy(p, news, strlen(news)); + // terminate + str[len] = 0; + return true; +} + +bool str_replace_all(char *str, const char *olds, const char *news, int size) +{ + int cnt = -1; + while (str_replace(str, olds, news, size)) + cnt++; + + return (cnt > 0); +} diff --git a/source/loader/utils.h b/source/loader/utils.h new file mode 100644 index 00000000..661b4969 --- /dev/null +++ b/source/loader/utils.h @@ -0,0 +1,49 @@ +#ifndef _UTILS_H_ +#define _UTILS_H_ + +#include +/* Constants */ +#define KB_SIZE 1024.0 +#define MB_SIZE 1048576.0 +#define GB_SIZE 1073741824.0 + +/* Macros */ +#define round_up(x,n) (-(-(x) & -(n))) + +#define ALIGN(x) (((x) + 3) & ~3) +#define ALIGN32(x) (((x) + 31) & ~31) + +#define SMART_FREE(P) {if(!!P)P.release();} +#define SAFE_FREE(P) {if(P != NULL){free(P);P = NULL;}} +#define MEM2_SAFE_FREE(P) {if(P){MEM2_free(P);P = NULL;}} +#define SAFE_DELETE(P) {if(P != NULL){delete P;P = NULL;}} +#define SAFE_CLOSE(P) {if(P != NULL){fclose(P);P = NULL; }} + +#define TITLE_ID(x,y) (((u64)(x) << 32) | (y)) +#define TITLE_UPPER(x) ((u32)((x) >> 32)) +#define TITLE_LOWER(x) ((u32)(x) & 0xFFFFFFFF) + +/* Macros */ +#define Write8(addr, val) *(u8 *)addr = val; DCFlushRange((void *)addr, sizeof(u8)); +#define Write16(addr, val) *(u16 *)addr = val; DCFlushRange((void *)addr, sizeof(u16)); +#define Write32(addr, val) *(u32 *)addr = val; DCFlushRange((void *)addr, sizeof(u32)); + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + +/* Prototypes */ +u64 le64(u64); +u32 le32(u32); +u16 le16(u16); +int makedir(char *newdir); + +bool str_replace(char *str, const char *olds, const char *news, int size); +bool str_replace_all(char *str, const char *olds, const char *news, int size); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif + diff --git a/source/loader/videopatch.c b/source/loader/videopatch.c new file mode 100644 index 00000000..e2a24781 --- /dev/null +++ b/source/loader/videopatch.c @@ -0,0 +1,327 @@ +// Inspired by WiiPower's "video toy", but simpler + +#include "videopatch.h" + +#include + +#define ARRAY_SIZE(a) (sizeof a / sizeof a[0]) + +extern GXRModeObj TVNtsc480Int; + +GXRModeObj TVPal528Prog = +{ + 6, // viDisplayMode + 640, // fbWidth + 528, // efbHeight + 528, // xfbHeight + (VI_MAX_WIDTH_PAL - 640)/2, // viXOrigin + (VI_MAX_HEIGHT_PAL - 528)/2, // viYOrigin + 640, // viWidth + 528, // viHeight + VI_XFBMODE_SF, // xFBmode + GX_FALSE, // field_rendering + GX_FALSE, // aa + + // sample points arranged in increasing Y order + { + {6,6},{6,6},{6,6}, // pix 0, 3 sample points, 1/12 units, 4 bits each + {6,6},{6,6},{6,6}, // pix 1 + {6,6},{6,6},{6,6}, // pix 2 + {6,6},{6,6},{6,6} // pix 3 + }, + + // vertical filter[7], 1/64 units, 6 bits each + { + 0, // line n-1 + 0, // line n-1 + 21, // line n + 22, // line n + 21, // line n + 0, // line n+1 + 0 // line n+1 + } + +}; + +GXRModeObj TVPal528ProgSoft = +{ + 6, // viDisplayMode + 640, // fbWidth + 528, // efbHeight + 528, // xfbHeight + (VI_MAX_WIDTH_PAL - 640)/2, // viXOrigin + (VI_MAX_HEIGHT_PAL - 528)/2, // viYOrigin + 640, // viWidth + 528, // viHeight + VI_XFBMODE_SF, // xFBmode + GX_FALSE, // field_rendering + GX_FALSE, // aa + + // sample points arranged in increasing Y order + { + {6,6},{6,6},{6,6}, // pix 0, 3 sample points, 1/12 units, 4 bits each + {6,6},{6,6},{6,6}, // pix 1 + {6,6},{6,6},{6,6}, // pix 2 + {6,6},{6,6},{6,6} // pix 3 + }, + + // vertical filter[7], 1/64 units, 6 bits each + { + 8, // line n-1 + 8, // line n-1 + 10, // line n + 12, // line n + 10, // line n + 8, // line n+1 + 8 // line n+1 + } + +}; + +GXRModeObj TVPal528ProgUnknown = +{ + 6, // viDisplayMode + 640, // fbWidth + 264, // efbHeight + 524, // xfbHeight + (VI_MAX_WIDTH_PAL - 640)/2, // viXOrigin + (VI_MAX_HEIGHT_PAL - 528)/2, // viYOrigin + 640, // viWidth + 524, // viHeight + VI_XFBMODE_SF, // xFBmode + GX_FALSE, // field_rendering + GX_TRUE, // aa + + // sample points arranged in increasing Y order + { + {3,2},{9,6},{3,10}, // pix 0, 3 sample points, 1/12 units, 4 bits each + {3,2},{9,6},{3,10}, // pix 1 + {9,2},{3,6},{9,10}, // pix 2 + {9,2},{3,6},{9,10} // pix 3 + }, + + // vertical filter[7], 1/64 units, 6 bits each + { + 4, // line n-1 + 8, // line n-1 + 12, // line n + 16, // line n + 12, // line n + 8, // line n+1 + 4 // line n+1 + } + +}; + +GXRModeObj TVMpal480Prog = +{ + 10, // viDisplayMode + 640, // fbWidth + 480, // efbHeight + 480, // xfbHeight + (VI_MAX_WIDTH_NTSC - 640)/2, // viXOrigin + (VI_MAX_HEIGHT_NTSC - 480)/2, // viYOrigin + 640, // viWidth + 480, // viHeight + VI_XFBMODE_SF, // xFBmode + GX_FALSE, // field_rendering + GX_FALSE, // aa + + // sample points arranged in increasing Y order + { + {6,6},{6,6},{6,6}, // pix 0, 3 sample points, 1/12 units, 4 bits each + {6,6},{6,6},{6,6}, // pix 1 + {6,6},{6,6},{6,6}, // pix 2 + {6,6},{6,6},{6,6} // pix 3 + }, + + // vertical filter[7], 1/64 units, 6 bits each + { + 0, // line n-1 + 0, // line n-1 + 21, // line n + 22, // line n + 21, // line n + 0, // line n+1 + 0 // line n+1 + } +}; + +static const GXRModeObj *g_vidmodes[] = { + &TVNtsc480Int, + &TVNtsc480IntDf, + &TVNtsc480Prog, + + &TVPal528Int, + &TVPal528IntDf, + &TVPal528Prog, + &TVPal528ProgSoft, + &TVPal528ProgUnknown, + + &TVMpal480IntDf, + &TVMpal480Prog, + + &TVEurgb60Hz480Int, + &TVEurgb60Hz480IntDf, + &TVEurgb60Hz480Prog +}; + +// Level : +// 0 : If same number of lines and same mode type (interlaced, progressive) +// 1 : If same mode type +// 2 : Always +static void applyVideoPatch(void *dst, u32 len, GXRModeObj *rmode, int level) +{ + u32 i; + u32 *bufEnd = (u32 *)((u8 *)dst + (len - sizeof *rmode)); + u32 *p = (u32 *)dst; + while (p <= bufEnd) + { + for (i = 0; i < ARRAY_SIZE(g_vidmodes); ++i) + if (memcmp(p, g_vidmodes[i], sizeof *rmode) == 0) + { + // Video mode description found, replace it + GXRModeObj *m = (GXRModeObj *)p; + if (level == 2 + || (((m->viTVMode & 3) == VI_PROGRESSIVE) == ((rmode->viTVMode & 3) == VI_PROGRESSIVE) + && (level == 1 || m->viHeight == rmode->viHeight))) + memcpy(p, rmode, sizeof *rmode); + p = (u32 *)(m + 1); + break; + } + if (i == ARRAY_SIZE(g_vidmodes)) + p++; + } +} + +static bool compare_videomodes(GXRModeObj* mode1, GXRModeObj* mode2) +{ + return memcmp(mode1, mode2, sizeof *mode1) == 0; // padding seems to always be 0 +} + +static void patch_videomode(GXRModeObj* mode1, GXRModeObj* mode2) +{ + memcpy(mode1, mode2, sizeof *mode1); +} + +static GXRModeObj* PAL2NTSC[]={ + &TVMpal480IntDf, &TVNtsc480IntDf, + &TVPal264Ds, &TVNtsc240Ds, + &TVPal264DsAa, &TVNtsc240DsAa, + &TVPal264Int, &TVNtsc240Int, + &TVPal264IntAa, &TVNtsc240IntAa, + &TVPal524IntAa, &TVNtsc480IntAa, + &TVPal528Int, &TVNtsc480IntAa, + &TVPal528IntDf, &TVNtsc480IntDf, + &TVPal574IntDfScale, &TVNtsc480IntDf, + &TVEurgb60Hz240Ds, &TVNtsc240Ds, + &TVEurgb60Hz240DsAa, &TVNtsc240DsAa, + &TVEurgb60Hz240Int, &TVNtsc240Int, + &TVEurgb60Hz240IntAa, &TVNtsc240IntAa, + &TVEurgb60Hz480Int, &TVNtsc480IntAa, + &TVEurgb60Hz480IntDf, &TVNtsc480IntDf, + &TVEurgb60Hz480IntAa, &TVNtsc480IntAa, + &TVEurgb60Hz480Prog, &TVNtsc480Prog, + &TVEurgb60Hz480ProgSoft,&TVNtsc480Prog, + &TVEurgb60Hz480ProgAa, &TVNtsc480Prog, + 0,0 +}; + +static GXRModeObj* NTSC2PAL[]={ + &TVNtsc240Ds, &TVPal264Ds, + &TVNtsc240DsAa, &TVPal264DsAa, + &TVNtsc240Int, &TVPal264Int, + &TVNtsc240IntAa, &TVPal264IntAa, + &TVNtsc480IntDf, &TVPal528IntDf, + &TVNtsc480IntAa, &TVPal524IntAa, + &TVNtsc480Prog, &TVPal528IntDf, + 0,0 +}; + +static GXRModeObj* NTSC2PAL60[]={ + &TVNtsc240Ds, &TVEurgb60Hz240Ds, + &TVNtsc240DsAa, &TVEurgb60Hz240DsAa, + &TVNtsc240Int, &TVEurgb60Hz240Int, + &TVNtsc240IntAa, &TVEurgb60Hz240IntAa, + &TVNtsc480IntDf, &TVEurgb60Hz480IntDf, + &TVNtsc480IntAa, &TVEurgb60Hz480IntAa, + &TVNtsc480Prog, &TVEurgb60Hz480Prog, + 0,0 +}; + +static bool Search_and_patch_Video_Modes(void *Address, u32 Size, GXRModeObj* Table[]) +{ + u8 *Addr = (u8 *)Address; + bool found = 0; + u32 i; + + while(Size >= sizeof(GXRModeObj)) + { + for(i = 0; Table[i]; i+=2) + { + if(compare_videomodes(Table[i], (GXRModeObj*)Addr)) + { + found = 1; + patch_videomode((GXRModeObj*)Addr, Table[i+1]); + Addr += (sizeof(GXRModeObj)-4); + Size -= (sizeof(GXRModeObj)-4); + break; + } + } + Addr += 4; + Size -= 4; + } + return found; +} + +void patchVideoModes(void *dst, u32 len, int vidMode, GXRModeObj *vmode, int patchVidModes) +{ + GXRModeObj **table = 0; + + if (vidMode == 5) // system + { + return; + } + if (vidMode == 6) // progressive 480P(NTSC + patch all) + { + applyVideoPatch(dst, len, vmode, 2); + } + else if (patchVidModes > 0 && vmode != 0) + { + applyVideoPatch(dst, len, vmode, patchVidModes - 1); + } + else + { + switch(vidMode) + { + case 0: // default / disc / game + break; + case 1: // PAL50 + Search_and_patch_Video_Modes(dst, len, NTSC2PAL); + break; + case 2: // PAL60 + Search_and_patch_Video_Modes(dst, len, NTSC2PAL60); + break; + case 3: // NTSC + Search_and_patch_Video_Modes(dst, len, PAL2NTSC); + break; + case 4: // auto patch / system + switch (CONF_GetVideo()) + { + case CONF_VIDEO_PAL: + table = CONF_GetEuRGB60() > 0 ? NTSC2PAL60 : NTSC2PAL; + break; + case CONF_VIDEO_MPAL: + table = NTSC2PAL; + break; + default: + table = PAL2NTSC; + break; + } + Search_and_patch_Video_Modes(dst, len, table); + break; + default: + break; + } + } +} diff --git a/source/loader/videopatch.h b/source/loader/videopatch.h new file mode 100644 index 00000000..bc9e53b4 --- /dev/null +++ b/source/loader/videopatch.h @@ -0,0 +1,9 @@ +#ifndef _VIDEOPATCH_H_ +#define _VIDEOPATCH_H_ + +#include + +void patchVideoModes(void *dst, u32 len, int vidMode, GXRModeObj *vmode, int patchVidModes); + + +#endif // !defined(_VIDEOPATCH_H_) diff --git a/source/loader/wbfs.c b/source/loader/wbfs.c new file mode 100644 index 00000000..ba17ea42 --- /dev/null +++ b/source/loader/wbfs.c @@ -0,0 +1,369 @@ + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include "libwbfs/libwbfs.h" +#include "sdhc.h" +#include "usbstorage.h" +#include "utils.h" +#include "wbfs.h" +#include "wdvd.h" +#include "splits.h" + +#include "wbfs_ext.h" +#include "sys.h" +#include "disc.h" +#include "gecko.h" +#include "mem2.hpp" + +/* Constants */ +#define MAX_NB_SECTORS 32 + +/* WBFS device */ +s32 wbfsDev = WBFS_MIN_DEVICE; + +extern u32 sector_size; + +// partition +int wbfs_part_fs = PART_FS_WBFS; +u32 wbfs_part_lba = 0; +u8 wbfs_mounted = 0; + +u8 currentPartition = 1; + +/* WBFS HDD */ +wbfs_t *hdd = NULL; + +/* WBFS callbacks */ +static rw_sector_callback_t readCallback = NULL; +static rw_sector_callback_t writeCallback = NULL; + +s32 __WBFS_ReadDVD(void *fp, u32 lba, u32 len, void *iobuf) +{ + void *buffer = NULL; + s32 ret; + + /* Calculate offset */ + u64 offset = ((u64)lba) << 2; + + /* Calcualte sizes */ + u32 mod = len % 32; + u32 size = len - mod; + + /* Read aligned data */ + if (size) + { + ret = WDVD_UnencryptedRead(iobuf, size, offset); + if (ret < 0) goto out; + } + + /* Read non-aligned data */ + if (mod) + { + /* Allocate memory */ + buffer = MEM2_alloc(0x20); + if (!buffer) return -1; + + /* Read data */ + ret = WDVD_UnencryptedRead(buffer, 0x20, offset + size); + if (ret < 0) goto out; + + /* Copy data */ + memcpy(iobuf + size, buffer, mod); + } + + /* Success */ + ret = 0; + +out: + /* Free memory */ + SAFE_FREE(buffer); + + return ret; +} + +s32 __WBFS_ReadUSB(void *fp, u32 lba, u32 count, void *iobuf) +{ + u32 cnt = 0; + + /* Do reads */ + while (cnt < count) + { + void *ptr = ((u8 *)iobuf) + (cnt * sector_size); + u32 sectors = (count - cnt); + + /* Read sectors is too big */ + if (sectors > MAX_NB_SECTORS) + sectors = MAX_NB_SECTORS; + + /* USB read */ + s32 ret = USBStorage_ReadSectors(lba + cnt, sectors, ptr); + if (ret < 0) return ret; + + /* Increment counter */ + cnt += sectors; + } + + return 0; +} + +s32 __WBFS_WriteUSB(void *fp, u32 lba, u32 count, void *iobuf) +{ + u32 cnt = 0; + + /* Do writes */ + while (cnt < count) + { + void *ptr = ((u8 *)iobuf) + (cnt * sector_size); + u32 sectors = (count - cnt); + + /* Write sectors is too big */ + if (sectors > MAX_NB_SECTORS) + sectors = MAX_NB_SECTORS; + + /* USB write */ + s32 ret = USBStorage_WriteSectors(lba + cnt, sectors, ptr); + if (ret < 0) return ret; + + /* Increment counter */ + cnt += sectors; + } + + return 0; +} + +s32 __WBFS_ReadSDHC(void *fp, u32 lba, u32 count, void *iobuf) +{ + u32 cnt = 0; + + /* Do reads */ + while (cnt < count) + { + void *ptr = ((u8 *)iobuf) + (cnt * sector_size); + u32 sectors = (count - cnt); + + /* Read sectors is too big */ + if (sectors > MAX_NB_SECTORS) + sectors = MAX_NB_SECTORS; + + /* SDHC read */ + s32 ret = SDHC_ReadSectors(lba + cnt, sectors, ptr); + if (!ret) return -1; + + /* Increment counter */ + cnt += sectors; + } + + return 0; +} + +s32 __WBFS_WriteSDHC(void *fp, u32 lba, u32 count, void *iobuf) +{ + u32 cnt = 0; + s32 ret; + + /* Do writes */ + while (cnt < count) + { + void *ptr = ((u8 *)iobuf) + (cnt * sector_size); + u32 sectors = (count - cnt); + + /* Write sectors is too big */ + if (sectors > MAX_NB_SECTORS) + sectors = MAX_NB_SECTORS; + + /* SDHC write */ + ret = SDHC_WriteSectors(lba + cnt, sectors, ptr); + if (!ret) return -1; + + /* Increment counter */ + cnt += sectors; + } + + return 0; +} + +bool WBFS_Close() +{ + wbfs_part_fs = 0; + wbfs_part_lba = 0; + strcpy(wbfs_fs_drive, ""); + wbfs_mounted = 0; + + return 0; +} + +bool WBFS_Mounted() +{ + return wbfs_mounted != 0; +} + +s32 WBFS_Init(wbfs_t * handle, u32 part_fs, u32 part_lba, char *partition, u8 current) +{ + WBFS_Close(); + + hdd = handle; + wbfsDev = strncasecmp(partition, "sd", 2) == 0 ? WBFS_DEVICE_SDHC : WBFS_DEVICE_USB; + strcpy(wbfs_fs_drive, partition); + strcat(wbfs_fs_drive, ":"); + + wbfs_part_fs = part_fs; + wbfs_part_lba = part_lba; + + currentPartition = current; + + wbfs_mounted = 1; + + return 0; +} + +s32 WBFS_Format(u32 lba, u32 size) +{ + u32 wbfs_sector_size = sector_size; + u32 partition_num_sec = size; + + //! If size is over 500GB in sectors and sector size is 512 + //! set 2048 as hdd sector size + if(size > 1048576000 && sector_size == 512) + { + wbfs_sector_size = 2048; + partition_num_sec = size/(2048/sector_size); + } + + /* Reset partition */ + wbfs_t *partition = wbfs_open_partition(readCallback, writeCallback, NULL, wbfs_sector_size, partition_num_sec, lba, 1); + if (!partition) return -1; + + /* Free memory */ + wbfs_close(partition); + + return 0; +} + +s32 WBFS_CheckGame(u8 *discid, char *path) +{ + /* Try to open game disc */ + wbfs_disc_t *disc = WBFS_OpenDisc(discid, path); + if (disc) WBFS_CloseDisc(disc); + + return !!disc; +} + +s32 WBFS_AddGame(progress_callback_t spinner, void *spinner_data) +{ + if (wbfs_part_fs) return WBFS_Ext_AddGame(spinner, spinner_data); + + /* No device open */ + if (!hdd) return -1; + + /* Add game to device */ + partition_selector_t part_sel = ONLY_GAME_PARTITION; + int copy_1_1 = 0; + + s32 ret = wbfs_add_disc(hdd, __WBFS_ReadDVD, NULL, spinner, spinner_data, part_sel, copy_1_1); + + return ret < 0 ? ret : 0; +} + +s32 WBFS_RemoveGame(u8 *discid, char *path) +{ + if (wbfs_part_fs) return WBFS_Ext_RemoveGame(discid, path); + + /* No device open */ + if (!hdd) return -1; + + /* Remove game from device */ + s32 ret = wbfs_rm_disc(hdd, discid); + + return ret < 0 ? ret : 0; +} + +s32 WBFS_GameSize(u8 *discid, char *path, f32 *size) +{ + /* Open disc */ + wbfs_disc_t *disc = WBFS_OpenDisc(discid, path); + if (!disc) return -2; + + /* Get game size in sectors */ + u32 sectors = wbfs_disc_sector_used(disc, NULL); + + /* Copy value */ + *size = (disc->p->wbfs_sec_sz / GB_SIZE) * sectors; + + /* Close disc */ + WBFS_CloseDisc(disc); + + return 0; +} + +s32 WBFS_DVD_Size(u64 *comp_size, u64 *real_size) +{ + if (wbfs_part_fs) return WBFS_Ext_DVD_Size(comp_size, real_size); + + u32 comp_sec = 0, last_sec = 0; + + /* No device open */ + if (!hdd) return -1; + + /* Add game to device */ + partition_selector_t part_sel = ONLY_GAME_PARTITION; + + s32 ret = wbfs_size_disc(hdd, __WBFS_ReadDVD, NULL, part_sel, &comp_sec, &last_sec); + if (ret < 0) return ret; + + *comp_size = ((u64)hdd->wii_sec_sz) * comp_sec; + *real_size = ((u64)hdd->wii_sec_sz) * (last_sec+1); + + return 0; +} + + +s32 WBFS_DiskSpace(f32 *used, f32 *free) +{ + if (wbfs_part_fs) return WBFS_Ext_DiskSpace(used, free); + + /* No device open */ + if (!hdd) return -1; + + /* Count used blocks */ + u32 cnt = wbfs_count_usedblocks(hdd); + + /* Sector size in GB */ + f32 ssize = hdd->wbfs_sec_sz / GB_SIZE; + + /* Copy values */ + *free = ssize * cnt; + *used = ssize * (hdd->n_wbfs_sec - cnt); + + return 0; +} + +wbfs_disc_t* WBFS_OpenDisc(u8 *discid, char *path) +{ + if (wbfs_part_fs) return WBFS_Ext_OpenDisc(discid, path); + + /* No device open */ + if (!hdd) return NULL; + + /* Open disc */ + return wbfs_open_disc(hdd, discid); +} + +void WBFS_CloseDisc(wbfs_disc_t *disc) +{ + if (wbfs_part_fs)return WBFS_Ext_CloseDisc(disc); + + /* No device open */ + if (!hdd || !disc) return; + + /* Close disc */ + wbfs_close_disc(disc); +} \ No newline at end of file diff --git a/source/loader/wbfs.h b/source/loader/wbfs.h new file mode 100644 index 00000000..3bb23522 --- /dev/null +++ b/source/loader/wbfs.h @@ -0,0 +1,51 @@ +#ifndef _WBFS_H_ +#define _WBFS_H_ + +#include "libwbfs/libwbfs.h" +#include "utils.h" + +#ifdef __cplusplus +extern "C" { +#endif + +/* Macros */ +#define WBFS_MIN_DEVICE 1 +#define WBFS_MAX_DEVICE 2 + +//also menu.hpp +#define PART_FS_WBFS 0 +#define PART_FS_FAT 1 +#define PART_FS_NTFS 2 +#define PART_FS_EXT 3 + +extern s32 wbfsDev; +extern int wbfs_part_fs; +extern u32 wbfs_part_lba; +extern char wbfs_fs_drive[16]; + +/* Prototypes */ +s32 WBFS_Format(u32, u32); +s32 WBFS_Init(wbfs_t *handle, u32 part_fs, u32 part_lba, char *partition, u8 current); +s32 WBFS_CheckGame(u8 *, char *); +s32 WBFS_AddGame(progress_callback_t spinner, void *spinner_data); +s32 WBFS_RemoveGame(u8 *, char *); +s32 WBFS_GameSize(u8 *, char *, f32 *); +s32 WBFS_DVD_Size(u64 *comp_size, u64 *real_size); +s32 WBFS_DiskSpace(f32 *, f32 *); + +wbfs_disc_t* WBFS_OpenDisc(u8 *discid, char *path); +void WBFS_CloseDisc(wbfs_disc_t *disc); +bool WBFS_Close(); +bool WBFS_Mounted(); + +s32 __WBFS_ReadSDHC(void *fp, u32 lba, u32 count, void *iobuf); +s32 __WBFS_WriteSDHC(void *fp, u32 lba, u32 count, void *iobuf); +s32 __WBFS_ReadUSB(void *fp, u32 lba, u32 count, void *iobuf); +s32 __WBFS_WriteUSB(void *fp, u32 lba, u32 count, void *iobuf); +s32 __WBFS_ReadDVD(void *fp, u32 lba, u32 count, void *iobuf); + +#ifdef __cplusplus +} +#endif + +#endif diff --git a/source/loader/wbfs_ext.c b/source/loader/wbfs_ext.c new file mode 100644 index 00000000..e7560f6f --- /dev/null +++ b/source/loader/wbfs_ext.c @@ -0,0 +1,251 @@ + +// WBFS FAT by oggzee + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include "libwbfs/libwbfs.h" +#include "sdhc.h" +#include "usbstorage.h" +#include "wbfs.h" +#include "wdvd.h" +#include "splits.h" +#include "wbfs_ext.h" +#include "utils.h" +#include "disc.h" +#include "gecko.h" + +#define MAX_FAT_PATH 1024 +#define TITLE_LEN 64 + +extern u32 sector_size; + +char wbfs_fs_drive[16]; +char wbfs_ext_dir[16] = "/wbfs"; +char invalid_path[] = "/\\:|<>?*\"'"; + +split_info_t split; + +struct statvfs wbfs_ext_vfs; + +s32 __WBFS_ReadDVD(void *fp, u32 lba, u32 len, void *iobuf); + +#define STRCOPY(DEST,SRC) strcopy(DEST,SRC,sizeof(DEST)) +char* strcopy(char *dest, const char *src, int size) +{ + strncpy(dest,src,size); + dest[size-1] = 0; + return dest; +} + +wbfs_disc_t* WBFS_Ext_OpenDisc(u8 *discid, char *fname) +{ + if (strcasecmp(strrchr(fname,'.'), ".iso") == 0) + { + // .iso file + // create a fake wbfs_disc + int fd = open(fname, O_RDONLY); + if (fd == -1) return NULL; + + wbfs_disc_t *iso_file = calloc(sizeof(wbfs_disc_t),1); + if (iso_file == NULL) return NULL; + + // mark with a special wbfs_part + wbfs_iso_file.wbfs_sec_sz = 512; + iso_file->p = &wbfs_iso_file; + iso_file->header = (void*)fd; + return iso_file; + } + + wbfs_t *part = WBFS_Ext_OpenPart(fname); + if (!part)return NULL; + + return wbfs_open_disc(part, discid); +} + +void WBFS_Ext_CloseDisc(wbfs_disc_t* disc) +{ + if (!disc) return; + wbfs_t *part = disc->p; + + // is this really a .iso file? + if (part == &wbfs_iso_file) + { + close((int)disc->header); + SAFE_FREE(disc); + return; + } + + wbfs_close_disc(disc); + WBFS_Ext_ClosePart(part); +} + +s32 WBFS_Ext_DiskSpace(f32 *used, f32 *free) +{ + *used = 0; + *free = 0; + + static int wbfs_ext_vfs_have = 0, wbfs_ext_vfs_lba = 0, wbfs_ext_vfs_dev = 0; + + // statvfs is slow, so cache values + if (!wbfs_ext_vfs_have || wbfs_ext_vfs_lba != wbfs_part_lba || wbfs_ext_vfs_dev != wbfsDev ) + { + if(statvfs(wbfs_fs_drive, &wbfs_ext_vfs)) + return 0; + + wbfs_ext_vfs_have = 1; + wbfs_ext_vfs_lba = wbfs_part_lba; + wbfs_ext_vfs_dev = wbfsDev; + } + + /* FS size in GB */ + f32 size = (f32)wbfs_ext_vfs.f_frsize * (f32)wbfs_ext_vfs.f_blocks / GB_SIZE; + *free = (f32)wbfs_ext_vfs.f_frsize * (f32)wbfs_ext_vfs.f_bfree / GB_SIZE; + *used = size - *free; + + return 0; +} + +static int nop_read_sector(void *_fp,u32 lba,u32 count,void*buf) +{ + return 0; +} + +static int nop_write_sector(void *_fp,u32 lba,u32 count,void*buf) +{ + return 0; +} + +wbfs_t* WBFS_Ext_OpenPart(char *fname) +{ + if(split_open(&split, fname) < 0) + return NULL; + + wbfs_t *part = wbfs_open_partition( + split_read_sector, nop_write_sector, //readonly //split_write_sector, + &split, sector_size, split.total_sec, 0, 0); + + if (!part) split_close(&split); + + return part; +} + +void WBFS_Ext_ClosePart(wbfs_t* part) +{ + if (!part) return; + split_info_t *s = (split_info_t*)part->callback_data; + wbfs_close(part); + if (s) split_close(s); +} + +s32 WBFS_Ext_RemoveGame(u8 *discid, char *gamepath) +{ + //split_create(&split, gamepath, 0, 0, true); + //split_close(&split); + + DIR *dir_iter; + struct dirent *ent; + char file[MAX_FAT_PATH]; + + char folder[MAX_FAT_PATH]; + STRCOPY(folder, gamepath); + char *p = strrchr(folder, '/'); + if (p) *p = 0; + + dir_iter = opendir(folder); + if (!dir_iter) return 0; + while ((ent = readdir(dir_iter)) != NULL) + { + if (ent->d_name[0] == '.') continue; + + snprintf(file, sizeof(file), "%s/%s", folder, ent->d_name); + remove(file); + break; + } + closedir(dir_iter); + unlink(folder); + return 0; +} + +s32 WBFS_Ext_AddGame(progress_callback_t spinner, void *spinner_data) +{ + struct discHdr header ATTRIBUTE_ALIGN(32); + + char folder[MAX_FAT_PATH]; + bzero(folder, MAX_FAT_PATH); + + char gamepath[MAX_FAT_PATH]; + bzero(gamepath, MAX_FAT_PATH); + + Disc_ReadHeader(&header); + snprintf(folder, sizeof(folder), "%s%s/%s [%s]", wbfs_fs_drive, wbfs_ext_dir, header.title, header.id); + makedir((char *)folder); + snprintf(gamepath, sizeof(gamepath), "%s/%s.wbfs", folder, header.id); + + u64 size = (u64)143432*2*0x8000ULL; + u32 n_sector = size / 512; + + if(split_create(&split, gamepath, OPT_split_size, size, true)) + return -1; + + //force create first file + u32 scnt = 0; + if (split_get_file(&split, 0, &scnt, 0) < 0) + { + split_close(&split); + return -1; + } + + wbfs_t *part = wbfs_open_partition(split_read_sector, split_write_sector, + &split, sector_size, n_sector, 0, 1); + if (!part) + { + split_close(&split); + return -1; + } + + extern wbfs_t *hdd; + wbfs_t *old_hdd = hdd; + hdd = part; // used by spinner + s32 ret = wbfs_add_disc(part, __WBFS_ReadDVD, NULL, spinner, spinner_data, ONLY_GAME_PARTITION, 0); + hdd = old_hdd; + + if(ret == 0) wbfs_trim(part); + + WBFS_Ext_ClosePart(part); + + if(ret < 0) WBFS_Ext_RemoveGame(NULL, gamepath); + + return ret < 0 ? ret : 0; +} + +s32 WBFS_Ext_DVD_Size(u64 *comp_size, u64 *real_size) +{ + u64 size = (u64)143432*2*0x8000ULL; + u32 n_sector = size / 512; + + // init a temporary dummy part + // as a placeholder for wbfs_size_disc + wbfs_t *part = wbfs_open_partition( + nop_read_sector, nop_write_sector, + NULL, sector_size, n_sector, 0, 1); + if (!part) return -1; + + u32 comp_sec = 0, last_sec = 0; + s32 ret = wbfs_size_disc(part, __WBFS_ReadDVD, NULL, ONLY_GAME_PARTITION, &comp_sec, &last_sec); + wbfs_close(part); + if (ret < 0) return ret; + + *comp_size = (u64)(part->wii_sec_sz) * comp_sec; + *real_size = (u64)(part->wii_sec_sz) * last_sec; + + return 0; +} \ No newline at end of file diff --git a/source/loader/wbfs_ext.h b/source/loader/wbfs_ext.h new file mode 100644 index 00000000..9eb12905 --- /dev/null +++ b/source/loader/wbfs_ext.h @@ -0,0 +1,27 @@ +// by oggzee + +#ifndef _WBFS_Ext_H +#define _WBFS_Ext_H + +#include "libwbfs/libwbfs.h" + +#ifdef __cplusplus +extern "C" { +#endif + +wbfs_t* WBFS_Ext_OpenPart(char *fname); +void WBFS_Ext_ClosePart(wbfs_t* part); +wbfs_disc_t* WBFS_Ext_OpenDisc(u8 *discid, char *fname); +void WBFS_Ext_CloseDisc(wbfs_disc_t* disc); +s32 WBFS_Ext_DiskSpace(f32 *used, f32 *free); +s32 WBFS_Ext_RemoveGame(u8 *discid, char *path); +s32 WBFS_Ext_AddGame(progress_callback_t spinner, void *spinner_data); +s32 WBFS_Ext_DVD_Size(u64 *comp_size, u64 *real_size); +int WBFS_Ext_find_fname(u8 *id, char *path, char *fname, int len); + +char* strcopy(char *dest, const char *src, int size); +#ifdef __cplusplus +} +#endif + +#endif diff --git a/source/loader/wdvd.c b/source/loader/wdvd.c new file mode 100644 index 00000000..258660fd --- /dev/null +++ b/source/loader/wdvd.c @@ -0,0 +1,348 @@ +#include +#include +#include +#include +#include "gecko.h" + +/* Constants */ +#define IOCTL_DI_READID 0x70 +#define IOCTL_DI_READ 0x71 +#define IOCTL_DI_WAITCVRCLOSE 0x79 +#define IOCTL_DI_GETCOVER 0x88 +#define IOCTL_DI_RESET 0x8A +#define IOCTL_DI_OPENPART 0x8B +#define IOCTL_DI_CLOSEPART 0x8C +#define IOCTL_DI_UNENCREAD 0x8D +#define IOCTL_DI_SEEK 0xAB +#define IOCTL_DI_STOPLASER 0xD2 +#define IOCTL_DI_OFFSET 0xD9 +#define IOCTL_DI_DISC_BCA 0xDA +#define IOCTL_DI_STOPMOTOR 0xE3 +#define IOCTL_DI_SETWBFSMODE 0xF4 + +#define IOCTL_DI_SETFRAG 0xF9 +#define IOCTL_DI_GETMODE 0xFA +#define IOCTL_DI_HELLO 0xFB + +/* Variables */ +static u32 inbuf[8] ATTRIBUTE_ALIGN(32); +static u32 outbuf[8] ATTRIBUTE_ALIGN(32); + +static const char di_fs[] ATTRIBUTE_ALIGN(32) = "/dev/di"; +static s32 di_fd = -1; + + +s32 WDVD_Init(void) +{ + /* Open "/dev/di" */ + if (di_fd < 0) { + di_fd = IOS_Open(di_fs, 0); + if (di_fd < 0) + return di_fd; + } + + return 0; +} + +s32 WDVD_Close(void) +{ + /* Close "/dev/di" */ + if (di_fd >= 0) { + IOS_Close(di_fd); + di_fd = -1; + } + + return 0; +} + +s32 WDVD_GetHandle(void) +{ + /* Return di handle */ + return di_fd; +} + +s32 WDVD_Reset(void) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Reset drive */ + inbuf[0] = IOCTL_DI_RESET << 24; + inbuf[1] = 1; + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_RESET, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_ReadDiskId(void *id) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Read disc ID */ + inbuf[0] = IOCTL_DI_READID << 24; + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_READID, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + if (ret == 1) + { + memcpy(id, outbuf, sizeof(dvddiskid)); + return 0; + } + + return -ret; +} + +s32 WDVD_Seek(u64 offset) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Drive seek */ + inbuf[0] = IOCTL_DI_SEEK << 24; + inbuf[1] = (u32)(offset >> 2); + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_SEEK, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_Offset(u64 offset) +{ + //u32 *off = (u32 *)((void *)&offset); + union { u64 off64; u32 off32[2]; } off; + off.off64 = offset; + + memset(inbuf, 0, sizeof(inbuf)); + + /* Set offset */ + inbuf[0] = IOCTL_DI_OFFSET << 24; + inbuf[1] = (off.off32[0]) ? 1: 0; + inbuf[2] = (off.off32[1] >> 2); + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_OFFSET, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_StopLaser(void) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Stop laser */ + inbuf[0] = IOCTL_DI_STOPLASER << 24; + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_STOPLASER, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_StopMotor(void) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Stop motor */ + inbuf[0] = IOCTL_DI_STOPMOTOR << 24; + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_STOPMOTOR, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_Eject(void) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Stop motor */ + inbuf[0] = IOCTL_DI_STOPMOTOR << 24; + /* Eject DVD */ + inbuf[1] = 1; + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_STOPMOTOR, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_OpenPartition(u64 offset, void* Ticket, void* Certificate, unsigned int Cert_Len, void* Out) +{ + static ioctlv Vectors[5] ATTRIBUTE_ALIGN(32); + + memset(inbuf, 0, sizeof inbuf); + memset(outbuf, 0, sizeof outbuf); + + inbuf[0] = IOCTL_DI_OPENPART << 24; + inbuf[1] = offset >> 2; + + Vectors[0].data = inbuf; + Vectors[0].len = 0x20; + Vectors[1].data = (Ticket == NULL) ? 0 : Ticket; + Vectors[1].len = (Ticket == NULL) ? 0 : 0x2a4; + Vectors[2].data = (Certificate == NULL) ? 0 : Certificate; + Vectors[2].len = (Certificate == NULL) ? 0 : Cert_Len; + Vectors[3].data = Out; + Vectors[3].len = 0x49e4; + Vectors[4].data = outbuf; + Vectors[4].len = 0x20; + + s32 ret = IOS_Ioctlv(di_fd, IOCTL_DI_OPENPART, 3, 2, Vectors); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_ClosePartition(void) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Close partition */ + inbuf[0] = IOCTL_DI_CLOSEPART << 24; + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_CLOSEPART, inbuf, sizeof(inbuf), NULL, 0); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_UnencryptedRead(void *buf, u32 len, u64 offset) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Unencrypted read */ + inbuf[0] = IOCTL_DI_UNENCREAD << 24; + inbuf[1] = len; + inbuf[2] = (u32)(offset >> 2); + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_UNENCREAD, inbuf, sizeof(inbuf), buf, len); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_Read(void *buf, u32 len, u64 offset) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Disc read */ + inbuf[0] = IOCTL_DI_READ << 24; + inbuf[1] = len; + inbuf[2] = (u32)(offset >> 2); + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_READ, inbuf, sizeof(inbuf), buf, len); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_WaitForDisc(void) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Wait for disc */ + inbuf[0] = IOCTL_DI_WAITCVRCLOSE << 24; + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_WAITCVRCLOSE, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_GetCoverStatus(u32 *status) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Get cover status */ + inbuf[0] = IOCTL_DI_GETCOVER << 24; + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_GETCOVER, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + if (ret == 1) { + /* Copy cover status */ + memcpy(status, outbuf, sizeof(u32)); + + return 0; + } + + return -ret; +} + +s32 WDVD_SetUSBMode(u32 mode, const u8 *id, s32 partition) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Set USB mode */ + inbuf[0] = IOCTL_DI_SETWBFSMODE << 24; + inbuf[1] = (id) ? mode : 0; + + /* Copy ID */ + if (id) + { + memcpy(&inbuf[2], id, 6); + if(partition >= 0) inbuf[5] = partition; + } + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_SETWBFSMODE, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + + if (ret < 0) return ret; + return (ret == 1) ? 0 : -ret; +} + +s32 WDVD_Read_Disc_BCA(void *buf) +{ + memset(inbuf, 0, sizeof(inbuf)); + + /* Disc read */ + inbuf[0] = IOCTL_DI_DISC_BCA << 24; + //inbuf[1] = 64; + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_DISC_BCA, inbuf, sizeof(inbuf), buf, 64); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +// frag + +s32 WDVD_SetFragList(int device, void *fraglist, int size) +{ + memset(inbuf, 0, sizeof(inbuf)); + memset(outbuf, 0, sizeof(outbuf)); + + /* Set FRAG mode */ + inbuf[0] = IOCTL_DI_SETFRAG << 24; + inbuf[1] = device; + inbuf[2] = (u32)fraglist; + inbuf[3] = size; + + DCFlushRange(fraglist, size); + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_SETFRAG, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + return (ret == 1) ? 0 : -ret; +} + +#define IOCTL_DI_HELLO 0xFB + +s32 WDVD_hello(u32 *status) +{ + memset(inbuf, 0, sizeof(inbuf)); + + inbuf[0] = IOCTL_DI_HELLO << 24; + + s32 ret = IOS_Ioctl(di_fd, IOCTL_DI_HELLO, inbuf, sizeof(inbuf), outbuf, sizeof(outbuf)); + if (ret < 0) return ret; + + if (ret == 1) + { + if (status) memcpy(status, outbuf, sizeof(u32)); + ghexdump(outbuf, 12); + return 0; + } + + return -ret; +} diff --git a/source/loader/wdvd.h b/source/loader/wdvd.h new file mode 100644 index 00000000..e08de9f5 --- /dev/null +++ b/source/loader/wdvd.h @@ -0,0 +1,34 @@ +#ifndef _WDVD_H_ +#define _WDVD_H_ + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + +/* Prototypes */ +s32 WDVD_Init(void); +s32 WDVD_Close(void); +s32 WDVD_GetHandle(void); +s32 WDVD_Reset(void); +s32 WDVD_ReadDiskId(void *); +s32 WDVD_Seek(u64); +s32 WDVD_Offset(u64); +s32 WDVD_StopLaser(void); +s32 WDVD_StopMotor(void); +s32 WDVD_OpenPartition(u64 offset, void* Ticket, void* Certificate, unsigned int Cert_Len, void* Out); +s32 WDVD_ClosePartition(void); +s32 WDVD_UnencryptedRead(void *, u32, u64); +s32 WDVD_Read(void *, u32, u64); +s32 WDVD_WaitForDisc(void); +s32 WDVD_GetCoverStatus(u32 *); +s32 WDVD_SetUSBMode(u32, const u8 *, s32); +s32 WDVD_Eject(void); +s32 WDVD_Read_Disc_BCA(void *); +s32 WDVD_SetFragList(int device, void *fraglist, int size); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif + diff --git a/source/loader/wip.c b/source/loader/wip.c new file mode 100644 index 00000000..4d62659e --- /dev/null +++ b/source/loader/wip.c @@ -0,0 +1,130 @@ +#include +#include +#include +#include +#include "utils.h" //SAFE_CLOSE +#include "gecko.h" + +typedef struct +{ + u32 offset; + u32 srcaddress; + u32 dstaddress; +} WIP_Code; + +static WIP_Code * CodeList = NULL; +static u32 CodesCount = 0; +static u32 ProcessedLength = 0; +static u32 Counter = 0; + +void do_wip_code(u8 * dst, u32 len) +{ + if(!CodeList) + return; + + if(Counter < 3) + { + Counter++; + return; + } + + int i = 0; + int n = 0; + int offset = 0; + + for(i = 0; i < CodesCount; i++) + { + for(n = 0; n < 4; n++) + { + offset = CodeList[i].offset+n-ProcessedLength; + + if(offset < 0 || offset >= len) + continue; + + if(dst[offset] == ((u8 *)&CodeList[i].srcaddress)[n]) + { + dst[offset] = ((u8 *)&CodeList[i].dstaddress)[n]; + gprintf("WIP: %08X Address Patched.\n", CodeList[i].offset+n); + } + else + { + gprintf("WIP: %08X Address does not match with WIP entrie.\n", CodeList[i].offset+n); + gprintf("Destination: %02X | Should be: %02X.\n", dst[offset], ((u8 *)&CodeList[i].srcaddress)[n]); + } + } + } + ProcessedLength += len; + Counter++; +} + +void wip_reset_counter() +{ + ProcessedLength = 0; + //alternative dols don't need a skip. only main.dol. + Counter = 3; +} + +void free_wip() +{ + if(CodeList) + SAFE_FREE(CodeList); + + CodesCount = 0; + ProcessedLength = 0; +} + +int load_wip_patches(u8 *dir, u8 *gameid) +{ + char filepath[150]; + char GameID[8]; + memset(GameID, 0, sizeof(GameID)); + memcpy(GameID, gameid, 6); + snprintf(filepath, sizeof(filepath), "%s/%s.wip", dir, GameID); + + FILE * fp = fopen(filepath, "rb"); + if (!fp) + { + memset(GameID, 0, sizeof(GameID)); + memcpy(GameID, gameid, 3); + snprintf(filepath, sizeof(filepath), "%s/%s.wip", dir, GameID); + fp = fopen(filepath, "rb"); + } + + if (!fp) + return -1; + + char line[255]; + gprintf("\nLoading WIP code from %s.\n", filepath); + + while (fgets(line, sizeof(line), fp)) + { + if (line[0] == '#') continue; + + if(strlen(line) < 26) continue; + + u32 offset = (u32) strtoul(line, NULL, 16); + u32 srcaddress = (u32) strtoul(line+9, NULL, 16); + u32 dstaddress = (u32) strtoul(line+18, NULL, 16); + + if(!CodeList) CodeList = malloc(sizeof(WIP_Code)); + + WIP_Code * tmp = realloc(CodeList, (CodesCount+1)*sizeof(WIP_Code)); + if(!tmp) + { + SAFE_FREE(CodeList); + SAFE_CLOSE(fp); + return -1; + } + + CodeList = tmp; + + CodeList[CodesCount].offset = offset; + CodeList[CodesCount].srcaddress = srcaddress; + CodeList[CodesCount].dstaddress = dstaddress; + CodesCount++; + } + SAFE_CLOSE(fp); + gprintf("\n"); + + return 0; +} diff --git a/source/loader/wip.h b/source/loader/wip.h new file mode 100644 index 00000000..b49ac3fa --- /dev/null +++ b/source/loader/wip.h @@ -0,0 +1,17 @@ +#ifndef __WIP_H__ +#define __WIP_H__ + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + +void wip_reset_counter(); +void free_wip(); +void do_wip_code(u8 * dst, u32 len); +void load_wip_patches(u8 *wippath, u8 *discid); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif //__WIP_H__ diff --git a/source/lockMutex.hpp b/source/lockMutex.hpp new file mode 100644 index 00000000..cf19d5bc --- /dev/null +++ b/source/lockMutex.hpp @@ -0,0 +1,12 @@ +#ifndef __LOCKMUTEX_HPP +#define __LOCKMUTEX_HPP + +class LockMutex +{ + mutex_t &m_mutex; +public: + LockMutex(mutex_t &m) : m_mutex(m) { LWP_MutexLock(m_mutex); } + ~LockMutex(void) { LWP_MutexUnlock(m_mutex); } +}; + +#endif // !defined(__LOCKMUTEX_HPP) diff --git a/source/main.cpp b/source/main.cpp new file mode 100644 index 00000000..62b96954 --- /dev/null +++ b/source/main.cpp @@ -0,0 +1,132 @@ +#include "video.hpp" +#include "menu/menu.hpp" +#include "loader/disc.h" + +#include "loader/alt_ios.h" +#include "loader/sys.h" +#include "loader/wbfs.h" +#include "text.hpp" +#include +#include +#include +#include "DeviceHandler.hpp" +#include "homebrew.h" +#include "gecko.h" +#include "wifi_gecko.h" +#include "cios.hpp" +#include "nand.hpp" + +extern "C" { extern void __exception_setreload(int t);} + +CMenu *mainMenu; +extern "C" void ShowError(const wstringEx &error){mainMenu->error(error); } +extern "C" void HideWaitMessage() {mainMenu->_hideWaitMessage(true); } + +int main(int argc, char **argv) +{ + geckoinit = InitGecko(); + __exception_setreload(5); + + SYS_SetArena1Hi(APPLOADER_START); + CVideo vid; + + char *gameid = NULL; + + for (int i = 0; i < argc; i++) + { + if (argv[i] != NULL && strcasestr(argv[i], "ios=") != NULL && strlen(argv[i]) > 4) + { + while(argv[i][0] && !isdigit(argv[i][0])) argv[i]++; + if (atoi(argv[i]) < 254 && atoi(argv[i]) > 0) + mainIOS = atoi(argv[i]); + } + else if (strlen(argv[i]) == 6) + { + gameid = argv[i]; + for (int i=0; i < 5; i++) + if (!isalnum(gameid[i])) + gameid = NULL; + } + } + gprintf("Loading cIOS: %d\n", mainIOS); + + + ISFS_Initialize(); + + // Load Custom IOS + bool iosOK = loadIOS(mainIOS, false); + MEM2_init(52); + + u8 mainIOSBase = 0; + iosOK = iosOK && cIOSInfo::D2X(mainIOS, &mainIOSBase); + gprintf("Loaded cIOS: %u has base %u\n", mainIOS, mainIOSBase); + + // Init video + vid.init(); + WIILIGHT_Init(); + + vid.waitMessage(0.2f); + + // Init + Sys_Init(); + Sys_ExitTo(EXIT_TO_HBC); + + int ret = 0; + + do + { + Open_Inputs(); + + bool deviceAvailable = false; + + u8 timeout = 0; + while(!deviceAvailable && timeout++ != 20) + { + DeviceHandler::Instance()->MountAll(); + sleep(1); + + for(u8 device = SD; device <= USB8; device++) + if(DeviceHandler::Instance()->IsInserted(device)) + deviceAvailable = true; + } + if(!deviceAvailable) Sys_Exit(); + + bool dipOK = Disc_Init() >= 0; + + CMenu menu(vid); + menu.init(); + mainMenu = &menu; + if (!iosOK) + { + menu.error(sfmt("d2x cIOS %i rev6 or later is required", mainIOS)); + break; + } + else if (!dipOK) + { + menu.error(L"Could not initialize the DIP module!"); + break; + } + else + { + if (gameid != NULL && strlen(gameid) == 6) + menu._directlaunch(gameid); + else + ret = menu.main(); + } + vid.cleanup(); + if (bootHB) + { + IOS_ReloadIOS(58); + BootHomebrew(); + } + + } while (ret == 1); + + WifiGecko_Close(); + + Nand::Instance()->Disable_Emu(); + Nand::DestroyInstance(); + + Sys_Exit(); + return 0; +}; \ No newline at end of file diff --git a/source/memory/mem2.cpp b/source/memory/mem2.cpp new file mode 100644 index 00000000..a1e883dc --- /dev/null +++ b/source/memory/mem2.cpp @@ -0,0 +1,245 @@ + +#include "mem2.hpp" +#include "mem2alloc.hpp" +#include "gecko.h" + +#include +#include +#include + +#ifndef APPLOADER_START /* Also defined in disc.h */ +#define APPLOADER_START (void *)0x81200000 +#endif +#ifndef APPLOADER_END /* Also defined in disc.h */ +#define APPLOADER_END (void *)0x81700000 +#endif + +#define MAX_MEM1_ARENA_LO ((void *) (((u32)APPLOADER_START)-size)) +#define MEM2_PRIORITY_SIZE 0x1000 + +// Forbid the use of MEM2 through malloc +u32 MALLOC_MEM2 = 0; + +static CMEM2Alloc g_mem2gp; +static CMEM2Alloc g_mem1Lgp; +static CMEM2Alloc g_mem1Ugp; + +extern int __init_start; +extern int _end; + +extern "C" +{ + void MEM2_init(unsigned int mem2Size) + { + if(&_end + 0x100 > APPLOADER_START) gprintf("ZOMG MOVE THE ENTRYPOINT DOWN!"); + + g_mem2gp.init(mem2Size); + g_mem2gp.clear(); + + /* If these are used, they must be cleared before running the apploader */ + + /* Below executable */ + g_mem1Lgp.init((void *)0x80004000, &__init_start - 0x100); + g_mem1Lgp.clear(); + + /* Above Executable */ + g_mem1Ugp.init(APPLOADER_START, APPLOADER_END); + g_mem1Ugp.clear(); + + /* Protect space reserved for apploader */ + SYS_SetArena1Hi(APPLOADER_START); + } + + void MEM2_cleanup(void) + { + g_mem2gp.cleanup(); + } + + void MEM2_clear(void) + { + g_mem2gp.clear(); + } + + void MEM1_cleanup(void) + { + g_mem1Lgp.cleanup(); + g_mem1Ugp.cleanup(); + } + + void MEM1_clear(void) + { + g_mem1Lgp.clear(); + g_mem1Ugp.clear(); + } + + void *MEM2_alloc(unsigned int s) + { + return g_mem2gp.allocate(s); + } + + void *MEM1_alloc(unsigned int s) + { + if(g_mem1Lgp.FreeSize() >= s) + return g_mem1Lgp.allocate(s); + if(g_mem1Ugp.FreeSize() >= s) + return g_mem1Ugp.allocate(s); + + return NULL; + } + + void MEM2_free(void *p) + { + g_mem2gp.release(p); + } + + void MEM1_free(void *p) + { + if((u32)p < (u32)&__init_start - 0x100 && (u32)p >= 0x80004000) + g_mem1Lgp.release(p); + else if((u32)p > (u32)APPLOADER_START && (u32)p < (u32)APPLOADER_END) + g_mem1Ugp.release(p); + } + + void *MEM2_realloc(void *p, unsigned int s) + { + return g_mem2gp.reallocate(p, s); + } + + void *MEM1_realloc(void *p, unsigned int s) + { + if((u32)p < (u32)&__init_start - 0x100 && (u32)p >= 0x80004000) + return g_mem1Lgp.reallocate(p, s); + else if((u32)p > (u32)APPLOADER_START && (u32)p < (u32)APPLOADER_END) + return g_mem1Ugp.reallocate(p, s); + + return NULL; + } + + unsigned int MEM2_usableSize(void *p) + { + return CMEM2Alloc::usableSize(p); + } + + unsigned int MEM2_freesize() + { + return g_mem2gp.FreeSize(); + } + + unsigned int MEM1_freesize() + { + return g_mem1Lgp.FreeSize() + g_mem1Ugp.FreeSize(); + } + + extern __typeof(malloc) __real_malloc; + extern __typeof(calloc) __real_calloc; + extern __typeof(realloc) __real_realloc; + extern __typeof(memalign) __real_memalign; + extern __typeof(free) __real_free; + extern __typeof(malloc_usable_size) __real_malloc_usable_size; + + void *__wrap_malloc(size_t size) + { + void *p; + if ((SYS_GetArena1Lo() >= MAX_MEM1_ARENA_LO) || size >= MEM2_PRIORITY_SIZE) + { + p = MEM2_alloc(size); + return p != 0 ? p : __real_malloc(size); + } + p = __real_malloc(size); + return p != 0 ? p : MEM2_alloc(size); + } + + void *__wrap_calloc(size_t n, size_t size) + { + void *p; + if ((SYS_GetArena1Lo() >= MAX_MEM1_ARENA_LO) || (n * size) >= MEM2_PRIORITY_SIZE) + { + p = MEM2_alloc(n * size); + if (p != 0) + { + memset(p, 0, n * size); + return p; + } + return __real_calloc(n, size); + } + + p = __real_calloc(n, size); + if (p != 0) return p; + + p = MEM2_alloc(n * size); + if (p != 0) memset(p, 0, n * size); + return p; + } + + void *__wrap_memalign(size_t a, size_t size) + { + void *p; + if ((SYS_GetArena1Lo() >= MAX_MEM1_ARENA_LO) || size >= MEM2_PRIORITY_SIZE) + { + if (a <= 32 && 32 % a == 0) + { + p = MEM2_alloc(size); + if (p != 0) return p; + } + return __real_memalign(a, size); + } + p = __real_memalign(a, size); + return p != 0 ? p : MEM2_alloc(size); + } + + void __wrap_free(void *p) + { + if(!p) + return; + if(((u32)p < (u32)&__init_start - 0x100 && (u32)p >= (u32)0x80004000) || ((u32)p > (u32)APPLOADER_START && (u32)p < (u32)APPLOADER_END)) + MEM1_free(p); + else if((u32)p & 0x10000000) + MEM2_free(p); + else + __real_free(p); + } + + void *__wrap_realloc(void *p, size_t size) + { + void *n; + // ptr from mem2 + if (((u32)p & 0x10000000) != 0 || (p == 0 && size > MEM2_PRIORITY_SIZE)) + { + n = MEM2_realloc(p, size); + if (n != 0) { + return n; + } + n = __real_malloc(size); + if (n == 0) { + return 0; + } + if (p != 0) + { + memcpy(n, p, MEM2_usableSize(p) < size ? MEM2_usableSize(p) : size); + MEM2_free(p); + } + return n; + } + // ptr from malloc + n = __real_realloc(p, size); + if (n != 0) { + return n; + } + n = MEM2_alloc(size); + if (n == 0) { + return 0; + } + if (p != 0) + { + memcpy(n, p, __real_malloc_usable_size(p) < size ? __real_malloc_usable_size(p) : size); + __real_free(p); + } + return n; + } + + size_t __wrap_malloc_usable_size(void *p) + { + return ((u32)p & 0x10000000) != 0 ? MEM2_usableSize(p) : __real_malloc_usable_size(p); + } + +} ///extern "C" \ No newline at end of file diff --git a/source/memory/mem2.hpp b/source/memory/mem2.hpp new file mode 100644 index 00000000..0841b9c6 --- /dev/null +++ b/source/memory/mem2.hpp @@ -0,0 +1,34 @@ +// 1 MEM2 allocator, one for general purpose +// Aligned and padded to 32 bytes, as required by many functions + +#ifndef __MEM2_HPP +#define __MEM2_HPP + +#ifdef __cplusplus +extern "C" +{ +#endif + +void MEM2_init(unsigned int mem2Size); +void MEM2_cleanup(void); +void MEM2_clear(void); +void MEM1_cleanup(void); +void MEM1_clear(void); +void *MEM2_alloc(unsigned int s); +void *MEM1_alloc(unsigned int s); +void *MEM2_realloc(void *p, unsigned int s); +void *MEM1_realloc(void *p, unsigned int s); +void MEM2_free(void *p); +void MEM1_free(void *p); +unsigned int MEM2_usableSize(void *p); +unsigned int MEM2_freesize(); +unsigned int MEM1_freesize(); + +#ifdef __cplusplus +} +#endif + + +enum Alloc { ALLOC_MALLOC, ALLOC_MEM2 }; + +#endif // !defined(__MEM2_HPP) \ No newline at end of file diff --git a/source/memory/mem2alloc.cpp b/source/memory/mem2alloc.cpp new file mode 100644 index 00000000..e9bf2da7 --- /dev/null +++ b/source/memory/mem2alloc.cpp @@ -0,0 +1,232 @@ + +#include "mem2alloc.hpp" + +#include +#include +#include + +#include "lockMutex.hpp" + +void CMEM2Alloc::init(unsigned int size) +{ + m_baseAddress = (SBlock *)(((u32)SYS_GetArena2Lo() + 31) & ~31); + m_endAddress = (SBlock *)((char *)m_baseAddress + std::min(size * 0x100000, (SYS_GetArena2Size() - 0x20 - 31) & ~31)); // Round down - an extra 32 for wdvd_unencrypted read + if (m_endAddress > (SBlock *)0x93000000) + m_endAddress = (SBlock *)0x93000000; + SYS_SetArena2Lo(m_endAddress + 0x20); + LWP_MutexInit(&m_mutex, 0); +} + +void CMEM2Alloc::init(void *addr, void *end) +{ + m_baseAddress = (SBlock *)(((u32)addr + 31) & ~31); + m_endAddress = (SBlock *)((u32)end & ~31); + LWP_MutexInit(&m_mutex, 0); +} + +void CMEM2Alloc::cleanup(void) +{ + LWP_MutexDestroy(m_mutex); + m_mutex = 0; + m_first = 0; + // Try to release the range we took through SYS functions + if (SYS_GetArena2Lo() == m_endAddress) + SYS_SetArena2Lo(m_baseAddress); + m_baseAddress = 0; + m_endAddress = 0; +} + +void CMEM2Alloc::clear(void) +{ + m_first = 0; + memset(m_baseAddress, 0, (u8 *)m_endAddress - (u8 *)m_endAddress); +} + +unsigned int CMEM2Alloc::usableSize(void *p) +{ + return p == 0 ? 0 : ((SBlock *)p - 1)->s * sizeof (SBlock); +} + +void *CMEM2Alloc::allocate(unsigned int s) +{ + if (s == 0) + s = 1; + // + LockMutex lock(m_mutex); + // + s = (s - 1) / sizeof (SBlock) + 1; + // First block + if (m_first == 0) + { + if (m_baseAddress + s + 1 >= m_endAddress) + return 0; + m_first = m_baseAddress; + m_first->next = 0; + m_first->prev = 0; + m_first->s = s; + m_first->f = false; + return (void *)(m_first + 1); + } + // Search for a free block + SBlock *i; + SBlock *j; + for (i = m_first; i != 0; i = i->next) + { + if (i->f && i->s >= s) + break; + j = i; + } + // Create a new block + if (i == 0) + { + i = j + j->s + 1; + if (i + s + 1 >= m_endAddress) + return 0; + j->next = i; + i->prev = j; + i->next = 0; + i->s = s; + i->f = false; + return (void *)(i + 1); + } + // Reuse a free block + i->f = false; + // Split it + if (i->s > s + 1) + { + j = i + s + 1; + j->f = true; + j->s = i->s - s - 1; + i->s = s; + j->next = i->next; + j->prev = i; + i->next = j; + if (j->next != 0) + j->next->prev = j; + } + return (void *)(i + 1); +} + +void CMEM2Alloc::release(void *p) +{ + if (p == 0) + return; + + LockMutex lock(m_mutex); + SBlock *i = (SBlock *)p - 1; + i->f = true; + + // If there are no other blocks following yet, + // set the remaining size to free size. - Dimok + if(i->next == 0) + i->s = m_endAddress - i - 1; + + // Merge with previous block + if (i->prev != 0 && i->prev->f) + { + i = i->prev; + i->s += i->next->s + 1; + i->next = i->next->next; + if (i->next != 0) + i->next->prev = i; + } + // Merge with next block + if (i->next != 0 && i->next->f) + { + i->s += i->next->s + 1; + i->next = i->next->next; + if (i->next != 0) + i->next->prev = i; + } +} + +void *CMEM2Alloc::reallocate(void *p, unsigned int s) +{ + SBlock *i; + SBlock *j; + void *n; + + if (s == 0) + s = 1; + + if (p == 0) + return allocate(s); + + i = (SBlock *)p - 1; + s = (s - 1) / sizeof (SBlock) + 1; + { + LockMutex lock(m_mutex); + + // Check for out of memory (dimok) + if (i + s + 1 >= m_endAddress) + { + return 0; + } + + // Last block + if (i->next == 0 && i + s + 1 < m_endAddress) + { + i->s = s; + return p; + } + // Size <= current size + next block + if (i->next != 0 && i->s < s && i->next->f && i->s + i->next->s + 1 >= s) + { + // Merge + i->s += i->next->s + 1; + i->next = i->next->next; + if (i->next != 0) + i->next->prev = i; + } + // Size <= current size + if (i->s >= s) + { + // Split + if (i->s > s + 1) + { + j = i + s + 1; + j->f = true; + j->s = i->s - s - 1; + i->s = s; + j->next = i->next; + j->prev = i; + i->next = j; + if (j->next != 0) + j->next->prev = j; + } + return p; + } + } + // Size > current size + n = allocate(s * sizeof (SBlock)); + if (n == 0) + return 0; + memcpy(n, p, i->s * sizeof (SBlock)); + release(p); + return n; +} + +unsigned int CMEM2Alloc::FreeSize() +{ + LockMutex lock(m_mutex); + + if (m_first == 0) + return (const char *) m_endAddress - (const char *) m_baseAddress; + + SBlock *i; + unsigned int size = 0; + + for(i = m_first; i != 0; i = i->next) + { + if(i->f && i->next != 0) + size += i->s; + + else if(i->f && i->next == 0) + size += m_endAddress - i - 1; + + else if(!i->f && i->next == 0) + size += m_endAddress - i - i->s - 1; + } + + return size*sizeof(SBlock); +} diff --git a/source/memory/mem2alloc.hpp b/source/memory/mem2alloc.hpp new file mode 100644 index 00000000..69a99cc2 --- /dev/null +++ b/source/memory/mem2alloc.hpp @@ -0,0 +1,42 @@ +// MEM2 allocator +// Made as a class so i can have 2 sections, one being dedicated to the covers + +#ifndef __MEM2ALLOC_HPP +#define __MEM2ALLOC_HPP + +#include + +class CMEM2Alloc +{ +public: + void *allocate(unsigned int s); + void release(void *p); + void *reallocate(void *p, unsigned int s); + void init(unsigned int size); + void init(void *addr, void *end); + void cleanup(void); + void clear(void); + static unsigned int usableSize(void *p); + void forceEndAddress(void *newAddr) { m_endAddress = (SBlock *)newAddr; } + void *getEndAddress(void) const { return m_endAddress; } + void info(void *&address, unsigned int &size) const { address = m_baseAddress; size = (const char *)m_endAddress - (const char *)m_baseAddress; } + unsigned int FreeSize(); + // + CMEM2Alloc(void) : m_baseAddress(0), m_endAddress(0), m_first(0), m_mutex(0) { } +private: + struct SBlock + { + unsigned int s; + SBlock *next; + SBlock *prev; + bool f; + } __attribute__((aligned(32))); + SBlock *m_baseAddress; + SBlock *m_endAddress; + SBlock *m_first; + mutex_t m_mutex; +private: + CMEM2Alloc(const CMEM2Alloc &); +}; + +#endif // !defined(__MEM2ALLOC_HPP) diff --git a/source/memory/smartalloc.cpp b/source/memory/smartalloc.cpp new file mode 100644 index 00000000..783dc867 --- /dev/null +++ b/source/memory/smartalloc.cpp @@ -0,0 +1,27 @@ +#include "smartptr.hpp" + +SmartBuf smartMalloc(unsigned int size) +{ + return SmartBuf((unsigned char *)malloc(size), SmartBuf::SRCALL_MALLOC); +} + +SmartBuf smartMemAlign32(unsigned int size) +{ + return smartAnyAlloc(size); +} + +SmartBuf smartMem2Alloc(unsigned int size) +{ + return SmartBuf((unsigned char *)MEM2_alloc(size), SmartBuf::SRCALL_MEM2); +} + +SmartBuf smartMem1Alloc(unsigned int size) +{ + return SmartBuf((unsigned char *)MEM1_alloc(size), SmartBuf::SRCALL_MEM1); +} + +SmartBuf smartAnyAlloc(unsigned int size) +{ + SmartBuf p(smartMem2Alloc(size)); + return !!p ? p : smartMem1Alloc(size); +} diff --git a/source/memory/smartptr.hpp b/source/memory/smartptr.hpp new file mode 100644 index 00000000..a8184f2d --- /dev/null +++ b/source/memory/smartptr.hpp @@ -0,0 +1,76 @@ +// A simple smart pointer class i made a long time ago, quickly adpated to the multiple alloc functions +// Not thread-safe (on copy & on destruction) + +#ifndef __SMARTPTR_HPP +#define __SMARTPTR_HPP + +#include +#include + +#include "utils.h" +#include "mem2.hpp" +#include "gui_sound.h" + +template class SmartPtr +{ +public: + enum SrcAlloc { SRCALL_MALLOC, SRCALL_MEM2, SRCALL_MEM1, SRCALL_NEW }; + T &operator*(void) const { return *m_p; } + T *operator->(void) const { return m_p; } + bool operator!(void) const { return m_p == NULL; } + T *get(void) const { return m_p; } + virtual void release(void) + { + if (m_refcount != NULL && --*m_refcount == 0) + { + switch (m_srcAlloc) + { + case SRCALL_NEW: + SAFE_DELETE(m_p); + break; + default: + SAFE_FREE(m_p); + break; + } + SAFE_DELETE(m_refcount); + } + + m_p = NULL; + m_refcount = NULL; + } + SmartPtr &operator=(const SmartPtr &sp) + { + SmartPtr temp(sp); + _swap(temp); + return *this; + } + explicit SmartPtr(T *p = NULL, SrcAlloc t = SRCALL_NEW) : m_p(p), m_refcount(p != NULL ? new int(1) : NULL), m_srcAlloc(t) { } + SmartPtr(const SmartPtr &sp) : m_p(sp.m_p), m_refcount(sp.m_refcount), m_srcAlloc(sp.m_srcAlloc) + { + if (m_refcount != NULL) + ++*m_refcount; + } + virtual ~SmartPtr(void) { release(); } +protected: + T *m_p; + int *m_refcount; + SrcAlloc m_srcAlloc; +protected: + void _swap(SmartPtr &sp) throw() + { + std::swap(m_p, sp.m_p); + std::swap(m_refcount, sp.m_refcount); + std::swap(m_srcAlloc, sp.m_srcAlloc); + } +}; + +typedef SmartPtr SmartBuf; +typedef SmartPtr SmartGuiSound; + +SmartBuf smartMalloc(unsigned int size); +SmartBuf smartMemAlign32(unsigned int size); +SmartBuf smartMem2Alloc(unsigned int size); +SmartBuf smartAnyAlloc(unsigned int size); + +SmartBuf smartMem1Alloc(unsigned int size); +#endif // !defined(__SMARTPTR_HPP) diff --git a/source/menu/menu.cpp b/source/menu/menu.cpp new file mode 100644 index 00000000..7957f261 --- /dev/null +++ b/source/menu/menu.cpp @@ -0,0 +1,1774 @@ +#include "menu.hpp" +#include "loader/sys.h" +#include "loader/wbfs.h" +#include "loader/alt_ios.h" + +#include "network/gcard.h" + +#include +#include +#include +#include +#include + +#include "gecko.h" +#include "defines.h" +#include "fonts.h" +#include "music/SoundHandler.hpp" +#include "fs.h" +#include "U8Archive.h" +#include "nand.hpp" +#include "cios.hpp" +#include "loader/playlog.h" + +// Sounds +extern const u8 click_wav[]; +extern const u32 click_wav_size; +extern const u8 hover_wav[]; +extern const u32 hover_wav_size; +extern const u8 camera_wav[]; +extern const u32 camera_wav_size; +// Pics +extern const u8 wait_png[]; +extern const u8 btnplus_png[]; +extern const u8 btnpluss_png[]; +extern const u8 btnminus_png[]; +extern const u8 btnminuss_png[]; +extern const u8 background_png[]; +extern const u8 butleft_png[]; +extern const u8 butcenter_png[]; +extern const u8 butright_png[]; +extern const u8 butsleft_png[]; +extern const u8 butscenter_png[]; +extern const u8 butsright_png[]; +extern const u8 pbarleft_png[]; +extern const u8 pbarcenter_png[]; +extern const u8 pbarright_png[]; +extern const u8 pbarlefts_png[]; +extern const u8 pbarcenters_png[]; +extern const u8 pbarrights_png[]; + +using namespace std; + +CMenu::CMenu(CVideo &vid) : + m_vid(vid) +{ + m_aa = 0; + m_thrdWorking = false; + m_thrdStop = false; + m_thrdProgress = 0.f; + m_thrdStep = 0.f; + m_thrdStepLen = 0.f; + m_locked = false; + m_favorites = false; + m_category = 0; + m_networkInit = false; + m_thrdNetwork = false; + m_mutex = 0; + m_showtimer = 0; + m_gameSoundThread = LWP_THREAD_NULL; + m_gameSoundHdr = NULL; + m_numCFVersions = 0; + m_bgCrossFade = 0; + m_bnrSndVol = 0; + m_gameSettingsPage = 0; + m_directLaunch = false; + m_exit = false; + m_initialCoverStatusComplete = false; + m_reload = false; + bootHB = false; + m_gamesound_changed = false; + m_base_font_size = 0; + m_current_view = COVERFLOW_USB; +} + +extern "C" { int makedir(char *newdir); } + +void CMenu::init(void) +{ + const char *drive = "empty"; + const char *check = "empty"; + struct stat dummy; + + /* Clear Playlog */ + Playlog_Delete(); + + for(int i = SD; i <= USB8; i++) //Find the first partition with a wiiflow.ini + if (DeviceHandler::Instance()->IsInserted(i) && DeviceHandler::Instance()->GetFSType(i) != PART_FS_WBFS && stat(sfmt("%s:/%s/" CFG_FILENAME, DeviceName[i], APPDATA_DIR2).c_str(), &dummy) == 0) + { + drive = DeviceName[i]; + break; + } + + if(drive == check) //No wiiflow.ini found + for(int i = SD; i <= USB8; i++) //Find the first partition with a boot.dol + if (DeviceHandler::Instance()->IsInserted(i) && DeviceHandler::Instance()->GetFSType(i) != PART_FS_WBFS && stat(sfmt("%s:/%s/boot.dol", DeviceName[i], APPDATA_DIR2).c_str(), &dummy) == 0) + { + drive = DeviceName[i]; + break; + } + + if(drive == check) //No boot.dol found + for(int i = SD; i <= USB8; i++) //Find the first partition with apps/wiiflow folder + if (DeviceHandler::Instance()->IsInserted(i) && DeviceHandler::Instance()->GetFSType(i) != PART_FS_WBFS && stat(sfmt("%s:/%s", DeviceName[i], APPDATA_DIR2).c_str(), &dummy) == 0) + { + drive = DeviceName[i]; + break; + } + + if(drive == check) //No apps/wiiflow folder found + for(int i = SD; i <= USB8; i++) // Find the first writable partition + if (DeviceHandler::Instance()->IsInserted(i) && DeviceHandler::Instance()->GetFSType(i) != PART_FS_WBFS) + { + drive = DeviceName[i]; + makedir((char *)sfmt("%s:/%s", DeviceName[i], APPDATA_DIR2).c_str()); //Make the apps dir, so saving wiiflow.ini does not fail. + break; + } + + _loadDefaultFont(CONF_GetLanguage() == CONF_LANG_KOREAN); + + if(drive == check) // Should not happen + { + _buildMenus(); + error(L"No available partitions found!"); + m_exit = true; + return; + } + + m_appDir = sfmt("%s:/%s", drive, APPDATA_DIR2); + gprintf("Wiiflow boot.dol Location: %s\n", m_appDir.c_str()); + + m_cfg.load(sfmt("%s/" CFG_FILENAME, m_appDir.c_str()).c_str()); + + bool onUSB = m_cfg.getBool("GENERAL", "data_on_usb", strncmp(drive, "usb", 3) == 0); + + drive = check; //reset the drive variable for the check + + if (onUSB) + { + for(int i = USB1; i <= USB8; i++) //Look for first partition with a wiiflow folder in root + if (DeviceHandler::Instance()->IsInserted(i) && DeviceHandler::Instance()->GetFSType(i) != PART_FS_WBFS && stat(sfmt("%s:/%s", DeviceName[i], APPDATA_DIR).c_str(), &dummy) == 0) + { + drive = DeviceName[i]; + break; + } + } + else if(DeviceHandler::Instance()->IsInserted(SD)) drive = DeviceName[SD]; + + if(drive == check && onUSB) //No wiiflow folder found in root of any usb partition, and data_on_usb=yes + for(int i = USB1; i <= USB8; i++) // Try first USB partition with wbfs folder. + if (DeviceHandler::Instance()->IsInserted(i) && DeviceHandler::Instance()->GetFSType(i) != PART_FS_WBFS && stat(sfmt(GAMES_DIR, DeviceName[i]).c_str(), &dummy) == 0) + { + drive = DeviceName[i]; + break; + } + + if(drive == check && onUSB) // No wbfs folder found and data_on_usb=yes + for(int i = USB1; i <= USB8; i++) // Try first available USB partition. + if (DeviceHandler::Instance()->IsInserted(i) && DeviceHandler::Instance()->GetFSType(i) != PART_FS_WBFS) + { + drive = DeviceName[i]; + break; + } + + if(drive == check) + { + _buildMenus(); + if(DeviceHandler::Instance()->IsInserted(SD)) + { + error(L"data_on_usb=yes and No available usb partitions for data!\nUsing SD."); + drive = DeviceName[SD]; + } + else + { + error(L"No available usb partitions for data and no SD inserted!\nExitting."); + m_exit = true; + return; + } + } + Nand::Instance()->Init(m_cfg.getString("NAND", "path", "").c_str(), + m_cfg.getInt("NAND", "partition", -1), + m_cfg.getBool("NAND", "disable", true) + ); + + _load_installed_cioses(); + + m_dataDir = sfmt("%s:/%s", drive, APPDATA_DIR); + gprintf("Data Directory: %s\n", m_dataDir.c_str()); + + m_dol = sfmt("%s/boot.dol", m_appDir.c_str()); + m_ver = sfmt("%s/versions", m_appDir.c_str()); + m_app_update_zip = sfmt("%s/update.zip", m_appDir.c_str()); + m_data_update_zip = sfmt("%s/update.zip", m_dataDir.c_str()); + // + m_cacheDir = m_cfg.getString("GENERAL", "dir_cache", sfmt("%s/cache", m_dataDir.c_str())); + m_settingsDir = m_cfg.getString("GENERAL", "dir_settings", sfmt("%s/settings", m_dataDir.c_str())); + m_languagesDir = m_cfg.getString("GENERAL", "dir_languages", sfmt("%s/languages", m_dataDir.c_str())); + m_boxPicDir = m_cfg.getString("GENERAL", "dir_box_covers", sfmt("%s/boxcovers", m_dataDir.c_str())); + m_picDir = m_cfg.getString("GENERAL", "dir_flat_covers", sfmt("%s/covers", m_dataDir.c_str())); + m_themeDir = m_cfg.getString("GENERAL", "dir_themes", sfmt("%s/themes", m_dataDir.c_str())); + m_musicDir = m_cfg.getString("GENERAL", "dir_music", sfmt("%s/music", m_dataDir.c_str())); + m_videoDir = m_cfg.getString("GENERAL", "dir_trailers", sfmt("%s/trailers", m_dataDir.c_str())); + m_fanartDir = m_cfg.getString("GENERAL", "dir_fanart", sfmt("%s/fanart", m_dataDir.c_str())); + m_screenshotDir = m_cfg.getString("GENERAL", "dir_screenshot", sfmt("%s/screenshots", m_dataDir.c_str())); + m_txtCheatDir = m_cfg.getString("GENERAL", "dir_txtcheat", sfmt("%s/codes", m_dataDir.c_str())); + m_cheatDir = m_cfg.getString("GENERAL", "dir_cheat", sfmt("%s/gct", m_txtCheatDir.c_str())); + m_wipDir = m_cfg.getString("GENERAL", "dir_wip", sfmt("%s/wip", m_txtCheatDir.c_str())); + m_listCacheDir = m_cfg.getString("GENERAL", "dir_list_cache", sfmt("%s/lists", m_cacheDir.c_str())); + // + + DeviceHandler::SetWatchdog(m_cfg.getUInt("GENERAL", "watchdog_timeout", 10)); + + const char *domain = _domainFromView(); + const char *checkDir = m_current_view == COVERFLOW_HOMEBREW ? HOMEBREW_DIR : GAMES_DIR; + + u8 partition = m_cfg.getInt(domain, "partition", -1); //Auto find a valid partition and fix old ini partition settings. + if(m_current_view != COVERFLOW_CHANNEL && (partition > USB8 || !DeviceHandler::Instance()->IsInserted(partition))) + { + m_cfg.remove(domain, "partition"); + for(int i = SD; i <= USB8+1; i++) // Find a usb partition with the wbfs folder or wbfs file system, else leave it blank (defaults to 1 later) + { + if(i > USB8) + { + m_current_view = COVERFLOW_CHANNEL; + break; + } + if (DeviceHandler::Instance()->IsInserted(i) + && ((m_current_view == COVERFLOW_USB && DeviceHandler::Instance()->GetFSType(i) == PART_FS_WBFS) + || stat(sfmt(checkDir, DeviceName[i]).c_str(), &dummy) == 0)) + { + m_cfg.setInt(domain, "partition", i); + break; + } + } + } + + m_cf.init(m_base_font, m_base_font_size); + + //Make important folders first. + makedir((char *)m_cacheDir.c_str()); + makedir((char *)m_settingsDir.c_str()); + makedir((char *)m_languagesDir.c_str()); + makedir((char *)m_boxPicDir.c_str()); + makedir((char *)m_picDir.c_str()); + makedir((char *)m_themeDir.c_str()); + makedir((char *)m_musicDir.c_str()); + makedir((char *)m_videoDir.c_str()); + makedir((char *)m_fanartDir.c_str()); + makedir((char *)m_screenshotDir.c_str()); + makedir((char *)m_txtCheatDir.c_str()); + makedir((char *)m_cheatDir.c_str()); + makedir((char *)m_wipDir.c_str()); + makedir((char *)m_listCacheDir.c_str()); + + m_gameList.Init(m_listCacheDir, m_settingsDir, m_loc.getString(m_curLanguage, "gametdb_code", "EN")); + + // INI files + m_cat.load(sfmt("%s/" CAT_FILENAME, m_settingsDir.c_str()).c_str()); + string themeName = m_cfg.getString("GENERAL", "theme", "DEFAULT"); + m_themeDataDir = sfmt("%s/%s", m_themeDir.c_str(), themeName.c_str()); + m_theme.load(sfmt("%s.ini", m_themeDataDir.c_str()).c_str()); + + u8 defaultMenuLanguage = 7; //English + switch (CONF_GetLanguage()) + { + case CONF_LANG_JAPANESE: + defaultMenuLanguage = 14; //Japanese + break; + case CONF_LANG_GERMAN: + defaultMenuLanguage = 11; //German + break; + case CONF_LANG_FRENCH: + defaultMenuLanguage = 9; //French + break; + case CONF_LANG_SPANISH: + defaultMenuLanguage = 19; //Spanish + break; + case CONF_LANG_ITALIAN: + defaultMenuLanguage = 13; //Italian + break; + case CONF_LANG_DUTCH: + defaultMenuLanguage = 6; //Dutch + break; + case CONF_LANG_SIMP_CHINESE: + defaultMenuLanguage = 3; //Chinese_S + break; + case CONF_LANG_TRAD_CHINESE: + defaultMenuLanguage = 4; //Chinese_T + break; + case CONF_LANG_KOREAN: + defaultMenuLanguage = 7; // No Korean translation has been done for wiiflow, so the menu will use english in this case. + break; + } + if (CONF_GetArea() == CONF_AREA_BRA) + defaultMenuLanguage = 2; //Brazilian + + m_curLanguage = CMenu::_translations[m_cfg.getInt("GENERAL", "language", defaultMenuLanguage)]; + if (!m_loc.load(sfmt("%s/%s.ini", m_languagesDir.c_str(), m_curLanguage.c_str()).c_str())) + { + m_cfg.setInt("GENERAL", "language", 0); + m_curLanguage = CMenu::_translations[0]; + m_loc.load(sfmt("%s/%s.ini", m_languagesDir.c_str(), m_curLanguage.c_str()).c_str()); + } + + m_aa = 3; + + CColor pShadowColor = m_theme.getColor("GENERAL", "pointer_shadow_color", CColor(0x3F000000)); + float pShadowX = m_theme.getFloat("GENERAL", "pointer_shadow_x", 3.f); + float pShadowY = m_theme.getFloat("GENERAL", "pointer_shadow_y", 3.f); + bool pShadowBlur = m_theme.getBool("GENERAL", "pointer_shadow_blur", false); + + for(int chan = WPAD_MAX_WIIMOTES-2; chan >= 0; chan--) + { + m_cursor[chan].init(sfmt("%s/%s", m_themeDataDir.c_str(), m_theme.getString("GENERAL", sfmt("pointer%i", chan+1).c_str()).c_str()).c_str(), + m_vid.wide(), pShadowColor, pShadowX, pShadowY, pShadowBlur, chan); + WPAD_SetVRes(chan, m_vid.width() + m_cursor[chan].width(), m_vid.height() + m_cursor[chan].height()); + } + + m_btnMgr.init(m_vid); + MusicPlayer::Instance()->Init(m_cfg, m_musicDir, sfmt("%s/music", m_themeDataDir.c_str())); + + _buildMenus(); + + m_locked = m_cfg.getString("GENERAL", "parent_code", "").size() >= 4; + m_btnMgr.setRumble(CONF_GetPadMotorMode() != 0); + + int exit_to = m_cfg.getInt("GENERAL", "exit_to", 0); + m_disable_exit = exit_to == EXIT_TO_DISABLE; + + if(exit_to == EXIT_TO_BOOTMII && (!DeviceHandler::Instance()->IsInserted(SD) || + stat(sfmt("%s:/bootmii/armboot.bin",DeviceName[SD]).c_str(), &dummy) != 0 || + stat(sfmt("%s:/bootmii/ppcboot.elf", DeviceName[SD]).c_str(), &dummy) != 0)) + exit_to = EXIT_TO_HBC; + Sys_ExitTo(exit_to); + + LWP_MutexInit(&m_mutex, 0); + + m_cf.setSoundVolume(m_cfg.getInt("GENERAL", "sound_volume_coverflow", 255)); + m_btnMgr.setSoundVolume(m_cfg.getInt("GENERAL", "sound_volume_gui", 255)); + m_bnrSndVol = m_cfg.getInt("GENERAL", "sound_volume_bnr", 255); + + if (m_cfg.getBool("GENERAL", "favorites_on_startup", false)) + m_favorites = m_cfg.getBool(domain, "favorites", false); + m_category = m_cat.getInt(domain, "category", 0); + m_max_categories = m_cat.getInt(domain, "numcategories", 12); + + + safe_vector gamercards = stringToVector(m_cfg.getString("GAMERCARD", "gamercards"), '|'); + if (gamercards.size() == 0 && m_cfg.getBool("GAMERCARD", "wiinnertag_enable", false)) + { + gamercards.push_back("wiinnertag"); + m_cfg.setString("GAMERCARD", "gamercards", "wiinnertag"); + m_cfg.remove("GAMERCARD", "wiinnertag_enable"); + } + + for (safe_vector::iterator itr = gamercards.begin(); itr != gamercards.end(); itr++) + { + register_card_provider( + m_cfg.getString("GAMERCARD", sfmt("%s_url", (*itr).c_str())).c_str(), + m_cfg.getString("GAMERCARD", sfmt("%s_key", (*itr).c_str())).c_str() + ); + } +} + +void CMenu::cleanup(bool ios_reload) +{ + m_cf.stopCoverLoader(); + + CheckGameSoundThread(true); + + _stopSounds(); + + if (!ios_reload) + { + SMART_FREE(m_cameraSound); + } + + MusicPlayer::DestroyInstance(); + SoundHandler::DestroyInstance(); + soundDeinit(); + if (!ios_reload) + { + LWP_MutexDestroy(m_mutex); + m_mutex = 0; + } + + DeviceHandler::DestroyInstance(); + + if (!ios_reload) + { + _cleanupDefaultFont(); + } + _deinitNetwork(); +} + +void CMenu::_setAA(int aa) +{ + switch (aa) + { + case 2: + case 3: + case 4: + case 5: + case 6: + case 8: + m_aa = aa; + break; + case 7: + m_aa = 6; + break; + default: + m_aa = 0; + } +} + +void CMenu::_loadCFCfg(SThemeData &theme) +{ + const char *domain = "_COVERFLOW"; + + //gprintf("Preparing to load sounds from %s\n", m_themeDataDir.c_str()); + m_cf.setCachePath(m_cacheDir.c_str(), !m_cfg.getBool("GENERAL", "keep_png", true), m_cfg.getBool("GENERAL", "compress_cache", false)); + m_cf.setBufferSize(m_cfg.getInt("GENERAL", "cover_buffer", 120)); + // Coverflow Sounds + m_cf.setSounds( + SmartGuiSound(new GuiSound(sfmt("%s/%s", m_themeDataDir.c_str(), m_theme.getString(domain, "sound_flip").c_str()))), + _sound(theme.soundSet, domain, "sound_hover", hover_wav, hover_wav_size, string("default_btn_hover"), false), + _sound(theme.soundSet, domain, "sound_select", click_wav, click_wav_size, string("default_btn_click"), false), + SmartGuiSound(new GuiSound(sfmt("%s/%s", m_themeDataDir.c_str(), m_theme.getString(domain, "sound_cancel").c_str()))) + ); + // Textures + string texLoading = sfmt("%s/%s", m_themeDataDir.c_str(), m_theme.getString(domain, "loading_cover_box").c_str()); + string texNoCover = sfmt("%s/%s", m_themeDataDir.c_str(), m_theme.getString(domain, "missing_cover_box").c_str()); + string texLoadingFlat = sfmt("%s/%s", m_themeDataDir.c_str(), m_theme.getString(domain, "loading_cover_flat").c_str()); + string texNoCoverFlat = sfmt("%s/%s", m_themeDataDir.c_str(), m_theme.getString(domain, "missing_cover_flat").c_str()); + m_cf.setTextures(texLoading, texLoadingFlat, texNoCover, texNoCoverFlat); + // Font + m_cf.setFont(_font(theme.fontSet, domain, "font", TITLEFONT), m_theme.getColor(domain, "font_color", CColor(0xFFFFFFFF))); + // + m_numCFVersions = min(max(2, m_theme.getInt("_COVERFLOW", "number_of_modes", 2)), 8); + for (u32 i = 1; i <= m_numCFVersions; ++i) + _loadCFLayout(i); + + _loadCFLayout((m_cfg.getInt(_domainFromView(), "last_cf_mode" , 1) + (int)m_numCFVersions) % (int)m_numCFVersions); +} + +Vector3D CMenu::_getCFV3D(const string &domain, const string &key, const Vector3D &def, bool otherScrnFmt) +{ + string key169(key); + string key43(key); + + key43 += "_4_3"; + if (m_vid.wide() == otherScrnFmt) + swap(key169, key43); + if (m_theme.has(domain, key169)) + { + Vector3D v(m_theme.getVector3D(domain, key169)); + m_theme.getVector3D(domain, key43, v); + return v; + } + return m_theme.getVector3D(domain, key169, m_theme.getVector3D(domain, key43, def)); +} + +int CMenu::_getCFInt(const string &domain, const string &key, int def, bool otherScrnFmt) +{ + string key169(key); + string key43(key); + + key43 += "_4_3"; + if (m_vid.wide() == otherScrnFmt) + swap(key169, key43); + if (m_theme.has(domain, key169)) + { + int v = m_theme.getInt(domain, key169); + m_theme.getInt(domain, key43, v); + return v; + } + return m_theme.getInt(domain, key169, m_theme.getInt(domain, key43, def)); +} + +float CMenu::_getCFFloat(const string &domain, const string &key, float def, bool otherScrnFmt) +{ + string key169(key); + string key43(key); + + key43 += "_4_3"; + if (m_vid.wide() == otherScrnFmt) + swap(key169, key43); + if (m_theme.has(domain, key169)) + { + float v = m_theme.getFloat(domain, key169); + m_theme.getFloat(domain, key43, v); + return v; + } + return m_theme.getFloat(domain, key169, m_theme.getFloat(domain, key43, def)); +} + +void CMenu::_loadCFLayout(int version, bool forceAA, bool otherScrnFmt) +{ + string domain(sfmt("_COVERFLOW_%i", version).c_str()); + string domainSel(sfmt("_COVERFLOW_%i_S", version).c_str()); + bool sf = otherScrnFmt; + + if (forceAA) + _setAA(m_theme.getInt(domain, "max_fsaa", 3)); + else + _setAA(min(m_theme.getInt(domain, "max_fsaa", 3), m_cfg.getInt("GENERAL", "max_fsaa", 3))); + + m_cf.setTextureQuality(m_theme.getFloat(domain, "tex_lod_bias", -3.f), + m_theme.getInt(domain, "tex_aniso", 2), + m_theme.getBool(domain, "tex_edge_lod", true)); + + m_cf.setRange(_getCFInt(domain, "rows", 1, sf), _getCFInt(domain, "columns", 9, sf)); + + m_cf.setCameraPos(false, + _getCFV3D(domain, "camera_pos", Vector3D(0.f, 1.5f, 5.f), sf), + _getCFV3D(domain, "camera_aim", Vector3D(0.f, 0.f, -1.f), sf)); + + m_cf.setCameraPos(true, + _getCFV3D(domainSel, "camera_pos", Vector3D(0.f, 1.5f, 5.f), sf), + _getCFV3D(domainSel, "camera_aim", Vector3D(0.f, 0.f, -1.f), sf)); + + m_cf.setCameraOsc(false, + _getCFV3D(domain, "camera_osc_speed", Vector3D(2.f, 1.1f, 1.3f), sf), + _getCFV3D(domain, "camera_osc_amp", Vector3D(0.1f, 0.2f, 0.1f), sf)); + + m_cf.setCameraOsc(true, + _getCFV3D(domainSel, "camera_osc_speed", Vector3D(0.f, 0.f, 0.f), sf), + _getCFV3D(domainSel, "camera_osc_amp", Vector3D(0.f, 0.f, 0.f), sf)); + + m_cf.setCoverPos(false, + _getCFV3D(domain, "left_pos", Vector3D(-1.6f, 0.f, 0.f), sf), + _getCFV3D(domain, "right_pos", Vector3D(1.6f, 0.f, 0.f), sf), + _getCFV3D(domain, "center_pos", Vector3D(0.f, 0.f, 1.f), sf), + _getCFV3D(domain, "row_center_pos", Vector3D(0.f, 0.f, 0.f), sf)); + + m_cf.setCoverPos(true, + _getCFV3D(domainSel, "left_pos", Vector3D(-4.6f, 2.f, 0.f), sf), + _getCFV3D(domainSel, "right_pos", Vector3D(4.6f, 2.f, 0.f), sf), + _getCFV3D(domainSel, "center_pos", Vector3D(-0.6f, 0.f, 2.6f), sf), + _getCFV3D(domainSel, "row_center_pos", Vector3D(0.f, 2.f, 0.f), sf)); + + m_cf.setCoverAngleOsc(false, + m_theme.getVector3D(domain, "cover_osc_speed", Vector3D(2.f, 2.f, 0.f)), + m_theme.getVector3D(domain, "cover_osc_amp", Vector3D(5.f, 10.f, 0.f))); + + m_cf.setCoverAngleOsc(true, + m_theme.getVector3D(domainSel, "cover_osc_speed", Vector3D(2.1f, 2.1f, 0.f)), + m_theme.getVector3D(domainSel, "cover_osc_amp", Vector3D(2.f, 5.f, 0.f))); + + m_cf.setCoverPosOsc(false, + m_theme.getVector3D(domain, "cover_pos_osc_speed", Vector3D(0.f, 0.f, 0.f)), + m_theme.getVector3D(domain, "cover_pos_osc_amp", Vector3D(0.f, 0.f, 0.f))); + + m_cf.setCoverPosOsc(true, + m_theme.getVector3D(domainSel, "cover_pos_osc_speed", Vector3D(0.f, 0.f, 0.f)), + m_theme.getVector3D(domainSel, "cover_pos_osc_amp", Vector3D(0.f, 0.f, 0.f))); + + m_cf.setSpacers(false, + m_theme.getVector3D(domain, "left_spacer", Vector3D(-0.35f, 0.f, 0.f)), + m_theme.getVector3D(domain, "right_spacer", Vector3D(0.35f, 0.f, 0.f))); + + m_cf.setSpacers(true, + m_theme.getVector3D(domainSel, "left_spacer", Vector3D(-0.35f, 0.f, 0.f)), + m_theme.getVector3D(domainSel, "right_spacer", Vector3D(0.35f, 0.f, 0.f))); + + m_cf.setDeltaAngles(false, + m_theme.getVector3D(domain, "left_delta_angle", Vector3D(0.f, 0.f, 0.f)), + m_theme.getVector3D(domain, "right_delta_angle", Vector3D(0.f, 0.f, 0.f))); + + m_cf.setDeltaAngles(true, + m_theme.getVector3D(domainSel, "left_delta_angle", Vector3D(0.f, 0.f, 0.f)), + m_theme.getVector3D(domainSel, "right_delta_angle", Vector3D(0.f, 0.f, 0.f))); + + m_cf.setAngles(false, + m_theme.getVector3D(domain, "left_angle", Vector3D(0.f, 70.f, 0.f)), + m_theme.getVector3D(domain, "right_angle", Vector3D(0.f, -70.f, 0.f)), + m_theme.getVector3D(domain, "center_angle", Vector3D(0.f, 0.f, 0.f)), + m_theme.getVector3D(domain, "row_center_angle", Vector3D(0.f, 0.f, 0.f))); + + m_cf.setAngles(true, + m_theme.getVector3D(domainSel, "left_angle", Vector3D(-45.f, 90.f, 0.f)), + m_theme.getVector3D(domainSel, "right_angle", Vector3D(-45.f, -90.f, 0.f)), + m_theme.getVector3D(domainSel, "center_angle", Vector3D(0.f, 380.f, 0.f)), + m_theme.getVector3D(domainSel, "row_center_angle", Vector3D(0.f, 0.f, 0.f))); + + m_cf.setTitleAngles(false, + _getCFFloat(domain, "text_left_angle", -55.f, sf), + _getCFFloat(domain, "text_right_angle", 55.f, sf), + _getCFFloat(domain, "text_center_angle", 0.f, sf)); + + m_cf.setTitleAngles(true, + _getCFFloat(domainSel, "text_left_angle", -55.f, sf), + _getCFFloat(domainSel, "text_right_angle", 55.f, sf), + _getCFFloat(domainSel, "text_center_angle", 0.f, sf)); + + m_cf.setTitlePos(false, + _getCFV3D(domain, "text_left_pos", Vector3D(-4.f, 0.f, 1.3f), sf), + _getCFV3D(domain, "text_right_pos", Vector3D(4.f, 0.f, 1.3f), sf), + _getCFV3D(domain, "text_center_pos", Vector3D(0.f, 0.f, 2.6f), sf)); + + m_cf.setTitlePos(true, + _getCFV3D(domainSel, "text_left_pos", Vector3D(-4.f, 0.f, 1.3f), sf), + _getCFV3D(domainSel, "text_right_pos", Vector3D(4.f, 0.f, 1.3f), sf), + _getCFV3D(domainSel, "text_center_pos", Vector3D(1.7f, 1.8f, 1.6f), sf)); + + m_cf.setTitleWidth(false, + _getCFFloat(domain, "text_side_wrap_width", 500.f, sf), + _getCFFloat(domain, "text_center_wrap_width", 500.f, sf)); + + m_cf.setTitleWidth(true, + _getCFFloat(domainSel, "text_side_wrap_width", 500.f, sf), + _getCFFloat(domainSel, "text_center_wrap_width", 310.f, sf)); + + m_cf.setTitleStyle(false, + _textStyle(domain.c_str(), "text_side_style", FTGX_ALIGN_BOTTOM | FTGX_JUSTIFY_CENTER), + _textStyle(domain.c_str(), "text_center_style", FTGX_ALIGN_BOTTOM | FTGX_JUSTIFY_CENTER)); + + m_cf.setTitleStyle(true, + _textStyle(domainSel.c_str(), "text_side_style", FTGX_ALIGN_BOTTOM | FTGX_JUSTIFY_CENTER), + _textStyle(domainSel.c_str(), "text_center_style", FTGX_ALIGN_TOP | FTGX_JUSTIFY_RIGHT)); + + m_cf.setColors(false, + m_theme.getColor(domain, "color_beg", 0xCFFFFFFF), + m_theme.getColor(domain, "color_end", 0x3FFFFFFF), + m_theme.getColor(domain, "color_off", 0x7FFFFFFF)); + + m_cf.setColors(true, + m_theme.getColor(domainSel, "color_beg", 0x7FFFFFFF), + m_theme.getColor(domainSel, "color_end", 0x1FFFFFFF), + m_theme.getColor(domain, "color_off", 0x7FFFFFFF)); // Mouse not used once a selection has been made + + m_cf.setMirrorAlpha(m_theme.getFloat(domain, "mirror_alpha", 0.25f), m_theme.getFloat(domain, "title_mirror_alpha", 0.2f)); // Doesn't depend on selection + + m_cf.setMirrorBlur(m_theme.getBool(domain, "mirror_blur", true)); // Doesn't depend on selection + + m_cf.setShadowColors(false, + m_theme.getColor(domain, "color_shadow_center", 0x00000000), + m_theme.getColor(domain, "color_shadow_beg", 0x00000000), + m_theme.getColor(domain, "color_shadow_end", 0x00000000), + m_theme.getColor(domain, "color_shadow_off", 0x00000000)); + + m_cf.setShadowColors(true, + m_theme.getColor(domainSel, "color_shadow_center", 0x0000007F), + m_theme.getColor(domainSel, "color_shadow_beg", 0x0000007F), + m_theme.getColor(domainSel, "color_shadow_end", 0x0000007F), + m_theme.getColor(domainSel, "color_shadow_off", 0x0000007F)); + + m_cf.setShadowPos(m_theme.getFloat(domain, "shadow_scale", 1.1f), + m_theme.getFloat(domain, "shadow_x", 0.f), + m_theme.getFloat(domain, "shadow_y", 0.f)); + + m_cf.setRowSpacers(false, + m_theme.getVector3D(domain, "top_spacer", Vector3D(0.f, 2.f, 0.f)), + m_theme.getVector3D(domain, "bottom_spacer", Vector3D(0.f, -2.f, 0.f))); + + m_cf.setRowSpacers(true, + m_theme.getVector3D(domainSel, "top_spacer", Vector3D(0.f, 2.f, 0.f)), + m_theme.getVector3D(domainSel, "bottom_spacer", Vector3D(0.f, -2.f, 0.f))); + + m_cf.setRowDeltaAngles(false, + m_theme.getVector3D(domain, "top_delta_angle", Vector3D(0.f, 0.f, 0.f)), + m_theme.getVector3D(domain, "bottom_delta_angle", Vector3D(0.f, 0.f, 0.f))); + + m_cf.setRowDeltaAngles(true, + m_theme.getVector3D(domainSel, "top_delta_angle", Vector3D(0.f, 0.f, 0.f)), + m_theme.getVector3D(domainSel, "bottom_delta_angle", Vector3D(0.f, 0.f, 0.f))); + + m_cf.setRowAngles(false, + m_theme.getVector3D(domain, "top_angle", Vector3D(0.f, 0.f, 0.f)), + m_theme.getVector3D(domain, "bottom_angle", Vector3D(0.f, 0.f, 0.f))); + + m_cf.setRowAngles(true, + m_theme.getVector3D(domainSel, "top_angle", Vector3D(0.f, 0.f, 0.f)), + m_theme.getVector3D(domainSel, "bottom_angle", Vector3D(0.f, 0.f, 0.f))); + + m_cf.setCoverScale(false, + m_theme.getVector3D(domain, "left_scale", Vector3D(1.f, 1.f, 1.f)), + m_theme.getVector3D(domain, "right_scale", Vector3D(1.f, 1.f, 1.f)), + m_theme.getVector3D(domain, "center_scale", Vector3D(1.f, 1.f, 1.f)), + m_theme.getVector3D(domain, "row_center_scale", Vector3D(1.f, 1.f, 1.f))); + + m_cf.setCoverScale(true, + m_theme.getVector3D(domainSel, "left_scale", Vector3D(1.f, 1.f, 1.f)), + m_theme.getVector3D(domainSel, "right_scale", Vector3D(1.f, 1.f, 1.f)), + m_theme.getVector3D(domainSel, "center_scale", Vector3D(1.f, 1.f, 1.f)), + m_theme.getVector3D(domainSel, "row_center_scale", Vector3D(1.f, 1.f, 1.f))); + + m_cf.setCoverFlipping( + _getCFV3D(domainSel, "flip_pos", Vector3D(0.f, 0.f, 0.f), sf), + _getCFV3D(domainSel, "flip_angle", Vector3D(0.f, 180.f, 0.f), sf), + _getCFV3D(domainSel, "flip_scale", Vector3D(1.f, 1.f, 1.f), sf)); + + m_cf.setBlur( + m_theme.getInt(domain, "blur_resolution", 1), + m_theme.getInt(domain, "blur_radius", 2), + m_theme.getFloat(domain, "blur_factor", 1.f)); +} + +void CMenu::_buildMenus(void) +{ + SThemeData theme; + + if(!m_base_font.get()) _loadDefaultFont(CONF_GetLanguage() == CONF_LANG_KOREAN); + + // Default fonts + theme.btnFont = _font(theme.fontSet, "GENERAL", "button_font", BUTTONFONT); + theme.btnFontColor = m_theme.getColor("GENERAL", "button_font_color", 0xD0BFDFFF); + + theme.lblFont = _font(theme.fontSet, "GENERAL", "label_font", LABELFONT); + theme.lblFontColor = m_theme.getColor("GENERAL", "label_font_color", 0xD0BFDFFF); + + theme.titleFont = _font(theme.fontSet, "GENERAL", "title_font", TITLEFONT); + theme.titleFontColor = m_theme.getColor("GENERAL", "title_font_color", 0xD0BFDFFF); + + theme.txtFont = _font(theme.fontSet, "GENERAL", "text_font", TEXTFONT); + theme.txtFontColor = m_theme.getColor("GENERAL", "text_font_color", 0xFFFFFFFF); + + // Default Sounds + theme.clickSound = _sound(theme.soundSet, "GENERAL", "click_sound", click_wav, click_wav_size, string("default_btn_click"), false); + theme.hoverSound = _sound(theme.soundSet, "GENERAL", "hover_sound", hover_wav, hover_wav_size, string("default_btn_hover"), false); + theme.cameraSound = _sound(theme.soundSet, "GENERAL", "camera_sound", camera_wav, camera_wav_size, string("default_camera"), false); + m_cameraSound = theme.cameraSound; + // Default textures + theme.btnTexL.fromPNG(butleft_png); + theme.btnTexL = _texture(theme.texSet, "GENERAL", "button_texture_left", theme.btnTexL); + theme.btnTexR.fromPNG(butright_png); + theme.btnTexR = _texture(theme.texSet, "GENERAL", "button_texture_right", theme.btnTexR); + theme.btnTexC.fromPNG(butcenter_png); + theme.btnTexC = _texture(theme.texSet, "GENERAL", "button_texture_center", theme.btnTexC); + theme.btnTexLS.fromPNG(butsleft_png); + theme.btnTexLS = _texture(theme.texSet, "GENERAL", "button_texture_left_selected", theme.btnTexLS); + theme.btnTexRS.fromPNG(butsright_png); + theme.btnTexRS = _texture(theme.texSet, "GENERAL", "button_texture_right_selected", theme.btnTexRS); + theme.btnTexCS.fromPNG(butscenter_png); + theme.btnTexCS = _texture(theme.texSet, "GENERAL", "button_texture_center_selected", theme.btnTexCS); + theme.pbarTexL.fromPNG(pbarleft_png); + theme.pbarTexL = _texture(theme.texSet, "GENERAL", "progressbar_texture_left", theme.pbarTexL); + theme.pbarTexR.fromPNG(pbarright_png); + theme.pbarTexR = _texture(theme.texSet, "GENERAL", "progressbar_texture_right", theme.pbarTexR); + theme.pbarTexC.fromPNG(pbarcenter_png); + theme.pbarTexC = _texture(theme.texSet, "GENERAL", "progressbar_texture_center", theme.pbarTexC); + theme.pbarTexLS.fromPNG(pbarlefts_png); + theme.pbarTexLS = _texture(theme.texSet, "GENERAL", "progressbar_texture_left_selected", theme.pbarTexLS); + theme.pbarTexRS.fromPNG(pbarrights_png); + theme.pbarTexRS = _texture(theme.texSet, "GENERAL", "progressbar_texture_right_selected", theme.pbarTexRS); + theme.pbarTexCS.fromPNG(pbarcenters_png); + theme.pbarTexCS = _texture(theme.texSet, "GENERAL", "progressbar_texture_center_selected", theme.pbarTexCS); + theme.btnTexPlus.fromPNG(btnplus_png); + theme.btnTexPlus = _texture(theme.texSet, "GENERAL", "plus_button_texture", theme.btnTexPlus); + theme.btnTexPlusS.fromPNG(btnpluss_png); + theme.btnTexPlusS = _texture(theme.texSet, "GENERAL", "plus_button_texture_selected", theme.btnTexPlusS); + theme.btnTexMinus.fromPNG(btnminus_png); + theme.btnTexMinus = _texture(theme.texSet, "GENERAL", "minus_button_texture", theme.btnTexMinus); + theme.btnTexMinusS.fromPNG(btnminuss_png); + theme.btnTexMinusS = _texture(theme.texSet, "GENERAL", "minus_button_texture_selected", theme.btnTexMinusS); + // Default background + theme.bg.fromPNG(background_png, GX_TF_RGBA8, ALLOC_MEM2); + m_mainBgLQ.fromPNG(background_png, GX_TF_CMPR, ALLOC_MEM2, 64, 64); + m_gameBgLQ = m_mainBgLQ; + + // Build menus + _initMainMenu(theme); + _initErrorMenu(theme); + _initConfigAdvMenu(theme); + _initConfigSndMenu(theme); + _initConfig4Menu(theme); + _initConfigScreenMenu(theme); + _initConfig3Menu(theme); + _initConfigMenu(theme); + _initGameMenu(theme); + _initDownloadMenu(theme); + _initCodeMenu(theme); + _initAboutMenu(theme); + _initWBFSMenu(theme); + _initCFThemeMenu(theme); + _initGameSettingsMenu(theme); + _initCheatSettingsMenu(theme); + _initCategorySettingsMenu(theme); + _initSystemMenu(theme); + _initGameInfoMenu(theme); + + _loadCFCfg(theme); +} + +typedef struct +{ + string ext; + u32 min; + u32 max; + u32 def; + u32 res; +} FontHolder; + +SFont CMenu::_font(CMenu::FontSet &fontSet, const char *domain, const char *key, u32 fontSize, u32 lineSpacing, u32 weight, u32 index, const char *genKey) +{ + string filename = ""; + bool general = strncmp(domain, "GENERAL", 7) == 0; + FontHolder fonts[3] = {{ "_size", 6u, 300u, fontSize, 0 }, { "_line_height", 6u, 300u, lineSpacing, 0 }, { "_weight", 1u, 32u, weight, 0 }}; + + if(!general) + filename = m_theme.getString(domain, key); + if(filename.empty()) + filename = m_theme.getString("GENERAL", genKey, genKey); + bool useDefault = filename == genKey; + + + for(u32 i = 0; i < 3; i++) + { + string defValue = genKey; + defValue += fonts[i].ext; + string value = key; + value += fonts[i].ext; + + if(!general) + fonts[i].res = (u32)m_theme.getInt(domain, value); + if(fonts[i].res <= 0) + fonts[i].res = (u32)m_theme.getInt("GENERAL", defValue); + + fonts[i].res = min(max(fonts[i].min, fonts[i].res <= 0 ? fonts[i].def : fonts[i].res), fonts[i].max); + } + + // Try to find the same font with the same size + CMenu::FontSet::iterator i = fontSet.find(CMenu::FontDesc(upperCase(filename.c_str()), fonts[0].res)); + if (i != fontSet.end()) return i->second; + + // TTF not found in memory, load it to create a new font + SFont retFont; + if (!useDefault && retFont.fromFile(sfmt("%s/%s", m_themeDataDir.c_str(), filename.c_str()).c_str(), fonts[0].res, fonts[1].res, fonts[2].res, index)) + { + // Theme Font + fontSet[CMenu::FontDesc(upperCase(filename.c_str()), fonts[0].res)] = retFont; + return retFont; + } + if(!m_base_font) _loadDefaultFont(CONF_GetLanguage() == CONF_LANG_KOREAN); + if(retFont.fromBuffer(m_base_font, m_base_font_size, fonts[0].res, fonts[1].res, fonts[2].res, index)) + { + // Default font + fontSet[CMenu::FontDesc(upperCase(filename.c_str()), fonts[0].res)] = retFont; + return retFont; + } + return retFont; +} + +safe_vector CMenu::_textures(TexSet &texSet, const char *domain, const char *key) +{ + safe_vector textures; + + if (m_theme.loaded()) + { + safe_vector filenames = m_theme.getStrings(domain, key); + if (filenames.size() > 0) + { + for (safe_vector::iterator itr = filenames.begin(); itr != filenames.end(); itr++) + { + string filename = *itr; + + CMenu::TexSet::iterator i = texSet.find(filename); + if (i != texSet.end()) + { + textures.push_back(i->second); + } + STexture tex; + if (STexture::TE_OK == tex.fromPNGFile(sfmt("%s/%s", m_themeDataDir.c_str(), filename.c_str()).c_str(), GX_TF_RGBA8, ALLOC_MEM2)) + { + texSet[filename] = tex; + textures.push_back(tex); + } + } + } + } + return textures; +} + +STexture CMenu::_texture(CMenu::TexSet &texSet, const char *domain, const char *key, STexture def) +{ + string filename; + + if (m_theme.loaded()) + { + filename = m_theme.getString(domain, key); + if (!filename.empty()) + { + CMenu::TexSet::iterator i = texSet.find(filename); + if (i != texSet.end()) + return i->second; + + STexture tex; + if (STexture::TE_OK == tex.fromPNGFile(sfmt("%s/%s", m_themeDataDir.c_str(), filename.c_str()).c_str(), GX_TF_RGBA8, ALLOC_MEM2)) + { + texSet[filename] = tex; + return tex; + } + } + } + texSet[filename] = def; + return def; +} + +// Only for loading defaults and GENERAL domains!! +SmartGuiSound CMenu::_sound(CMenu::SoundSet &soundSet, const char *domain, const char *key, const u8 * snd, u32 len, string name, bool isAllocated) +{ + string filename = m_theme.getString(domain, key, ""); + if (filename.empty()) filename = name; + + CMenu::SoundSet::iterator i = soundSet.find(upperCase(filename.c_str())); + if (i == soundSet.end()) + { + if(strncmp(filename.c_str(), name.c_str(), name.size()) != 0) + soundSet[upperCase(filename.c_str())] = SmartGuiSound(new GuiSound(sfmt("%s/%s", m_themeDataDir.c_str(), filename.c_str()).c_str())); + else + soundSet[upperCase(filename.c_str())] = SmartGuiSound(new GuiSound(snd, len, filename, isAllocated)); + + return soundSet[upperCase(filename.c_str())]; + } + return i->second; +} + +//For buttons and labels only!! +SmartGuiSound CMenu::_sound(CMenu::SoundSet &soundSet, const char *domain, const char *key, string name) +{ + string filename = m_theme.getString(domain, key); + if (filename.empty()) + { + if(name.find_last_of('/') != string::npos) + name = name.substr(name.find_last_of('/')+1); + return soundSet[upperCase(name.c_str())]; // General/Default are already cached! + } + + CMenu::SoundSet::iterator i = soundSet.find(upperCase(filename.c_str())); + if (i == soundSet.end()) + { + soundSet[upperCase(filename.c_str())] = SmartGuiSound(new GuiSound(sfmt("%s/%s", m_themeDataDir.c_str(), filename.c_str()).c_str())); + return soundSet[upperCase(filename.c_str())]; + } + return i->second; +} + +u16 CMenu::_textStyle(const char *domain, const char *key, u16 def) +{ + u16 textStyle = 0; + string style(m_theme.getString(domain, key)); + if (style.empty()) return def; + + if (style.find_first_of("Cc") != string::npos) + textStyle |= FTGX_JUSTIFY_CENTER; + else if (style.find_first_of("Rr") != string::npos) + textStyle |= FTGX_JUSTIFY_RIGHT; + else + textStyle |= FTGX_JUSTIFY_LEFT; + if (style.find_first_of("Mm") != string::npos) + textStyle |= FTGX_ALIGN_MIDDLE; + else if (style.find_first_of("Bb") != string::npos) + textStyle |= FTGX_ALIGN_BOTTOM; + else + textStyle |= FTGX_ALIGN_TOP; + return textStyle; +} + +u32 CMenu::_addButton(CMenu::SThemeData &theme, const char *domain, SFont font, const wstringEx &text, int x, int y, u32 width, u32 height, const CColor &color) +{ + SButtonTextureSet btnTexSet; + CColor c(color); + + c = m_theme.getColor(domain, "color", c); + x = m_theme.getInt(domain, "x", x); + y = m_theme.getInt(domain, "y", y); + width = m_theme.getInt(domain, "width", width); + height = m_theme.getInt(domain, "height", height); + btnTexSet.left = _texture(theme.texSet, domain, "texture_left", theme.btnTexL); + btnTexSet.right = _texture(theme.texSet, domain, "texture_right", theme.btnTexR); + btnTexSet.center = _texture(theme.texSet, domain, "texture_center", theme.btnTexC); + btnTexSet.leftSel = _texture(theme.texSet, domain, "texture_left_selected", theme.btnTexLS); + btnTexSet.rightSel = _texture(theme.texSet, domain, "texture_right_selected", theme.btnTexRS); + btnTexSet.centerSel = _texture(theme.texSet, domain, "texture_center_selected", theme.btnTexCS); + + font = _font(theme.fontSet, domain, "font", BUTTONFONT); + + SmartGuiSound clickSound = _sound(theme.soundSet, domain, "click_sound", theme.clickSound->GetName()); + SmartGuiSound hoverSound = _sound(theme.soundSet, domain, "hover_sound", theme.hoverSound->GetName()); + + u16 btnPos = _textStyle(domain, "elmstyle", FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + if (btnPos & FTGX_JUSTIFY_RIGHT) + x = m_vid.width() - x - width; + if (btnPos & FTGX_ALIGN_BOTTOM) + y = m_vid.height() - y - height; + + return m_btnMgr.addButton(font, text, x, y, width, height, c, btnTexSet, clickSound, hoverSound); +} + +u32 CMenu::_addPicButton(CMenu::SThemeData &theme, const char *domain, STexture &texNormal, STexture &texSelected, int x, int y, u32 width, u32 height) +{ + x = m_theme.getInt(domain, "x", x); + y = m_theme.getInt(domain, "y", y); + width = m_theme.getInt(domain, "width", width); + height = m_theme.getInt(domain, "height", height); + STexture tex1 = _texture(theme.texSet, domain, "texture_normal", texNormal); + STexture tex2 = _texture(theme.texSet, domain, "texture_selected", texSelected); + SmartGuiSound clickSound = _sound(theme.soundSet, domain, "click_sound", theme.clickSound->GetName()); + SmartGuiSound hoverSound = _sound(theme.soundSet, domain, "hover_sound", theme.hoverSound->GetName()); + + u16 btnPos = _textStyle(domain, "elmstyle", FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + if (btnPos & FTGX_JUSTIFY_RIGHT) + x = m_vid.width() - x - width; + if (btnPos & FTGX_ALIGN_BOTTOM) + y = m_vid.height() - y - height; + + return m_btnMgr.addPicButton(tex1, tex2, x, y, width, height, clickSound, hoverSound); +} + +u32 CMenu::_addLabel(CMenu::SThemeData &theme, const char *domain, SFont font, const wstringEx &text, int x, int y, u32 width, u32 height, const CColor &color, u16 style) +{ + CColor c(color); + + c = m_theme.getColor(domain, "color", c); + x = m_theme.getInt(domain, "x", x); + y = m_theme.getInt(domain, "y", y); + width = m_theme.getInt(domain, "width", width); + height = m_theme.getInt(domain, "height", height); + font = _font(theme.fontSet, domain, "font", LABELFONT); + style = _textStyle(domain, "style", style); + + u16 btnPos = _textStyle(domain, "elmstyle", FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + if (btnPos & FTGX_JUSTIFY_RIGHT) + x = m_vid.width() - x - width; + if (btnPos & FTGX_ALIGN_BOTTOM) + y = m_vid.height() - y - height; + + return m_btnMgr.addLabel(font, text, x, y, width, height, c, style); +} + +u32 CMenu::_addLabel(CMenu::SThemeData &theme, const char *domain, SFont font, const wstringEx &text, int x, int y, u32 width, u32 height, const CColor &color, u16 style, STexture &bg) +{ + CColor c(color); + + c = m_theme.getColor(domain, "color", c); + x = m_theme.getInt(domain, "x", x); + y = m_theme.getInt(domain, "y", y); + width = m_theme.getInt(domain, "width", width); + height = m_theme.getInt(domain, "height", height); + font = _font(theme.fontSet, domain, "font", LABELFONT); + STexture texBg = _texture(theme.texSet, domain, "background_texture", bg); + style = _textStyle(domain, "style", style); + + u16 btnPos = _textStyle(domain, "elmstyle", FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + if (btnPos & FTGX_JUSTIFY_RIGHT) + x = m_vid.width() - x - width; + if (btnPos & FTGX_ALIGN_BOTTOM) + y = m_vid.height() - y - height; + + return m_btnMgr.addLabel(font, text, x, y, width, height, c, style, texBg); +} + +u32 CMenu::_addProgressBar(CMenu::SThemeData &theme, const char *domain, int x, int y, u32 width, u32 height) +{ + SButtonTextureSet btnTexSet; + + x = m_theme.getInt(domain, "x", x); + y = m_theme.getInt(domain, "y", y); + width = m_theme.getInt(domain, "width", width); + height = m_theme.getInt(domain, "height", height); + btnTexSet.left = _texture(theme.texSet, domain, "texture_left", theme.pbarTexL); + btnTexSet.right = _texture(theme.texSet, domain, "texture_right", theme.pbarTexR); + btnTexSet.center = _texture(theme.texSet, domain, "texture_center", theme.pbarTexC); + btnTexSet.leftSel = _texture(theme.texSet, domain, "texture_left_selected", theme.pbarTexLS); + btnTexSet.rightSel = _texture(theme.texSet, domain, "texture_right_selected", theme.pbarTexRS); + btnTexSet.centerSel = _texture(theme.texSet, domain, "texture_center_selected", theme.pbarTexCS); + + u16 btnPos = _textStyle(domain, "elmstyle", FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + if (btnPos & FTGX_JUSTIFY_RIGHT) + x = m_vid.width() - x - width; + if (btnPos & FTGX_ALIGN_BOTTOM) + y = m_vid.height() - y - height; + + return m_btnMgr.addProgressBar(x, y, width, height, btnTexSet); +} + +void CMenu::_setHideAnim(u32 id, const char *domain, int dx, int dy, float scaleX, float scaleY) +{ + dx = m_theme.getInt(domain, "effect_x", dx); + dy = m_theme.getInt(domain, "effect_y", dy); + scaleX = m_theme.getFloat(domain, "effect_scale_x", scaleX); + scaleY = m_theme.getFloat(domain, "effect_scale_y", scaleY); + + int x, y; + u32 width, height; + m_btnMgr.getDimensions(id, x, y, width, height); + + u16 btnPos = _textStyle(domain, "elmstyle", FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + if (btnPos & FTGX_JUSTIFY_RIGHT) + { + dx = m_vid.width() - dx - width; + scaleX = m_vid.width() - scaleX - width; + } + if (btnPos & FTGX_ALIGN_BOTTOM) + { + dy = m_vid.height() - dy - height; + scaleY = m_vid.height() - scaleY - height; + } + + m_btnMgr.hide(id, dx, dy, scaleX, scaleY, true); +} + +void CMenu::_addUserLabels(CMenu::SThemeData &theme, u32 *ids, u32 size, const char *domain) +{ + _addUserLabels(theme, ids, 0, size, domain); +} + +void CMenu::_addUserLabels(CMenu::SThemeData &theme, u32 *ids, u32 start, u32 size, const char *domain) +{ + + for (u32 i = start; i < start + size; ++i) + { + string dom(sfmt("%s/USER%i", domain, i + 1)); + if (m_theme.hasDomain(dom)) + { + STexture emptyTex; + ids[i] = _addLabel(theme, dom.c_str(), theme.lblFont, L"", 40, 200, 64, 64, CColor(0xFFFFFFFF), 0, emptyTex); + _setHideAnim(ids[i], dom.c_str(), -50, 0, 0.f, 0.f); + } + else + ids[i] = -1u; + } +} + +void CMenu::_initCF(void) +{ + Config m_dump; + const char *domain = _domainFromView(); + + m_cf.clear(); + m_cf.reserve(m_gameList.size()); + + m_gamelistdump = m_cfg.getBool(domain, "dump_list", true); + if(m_gamelistdump) m_dump.load(sfmt("%s/titlesdump.ini", m_settingsDir.c_str()).c_str()); + + m_gcfg1.load(sfmt("%s/gameconfig1.ini", m_settingsDir.c_str()).c_str()); + for (u32 i = 0; i < m_gameList.size(); ++i) + { + u64 chantitle = m_gameList[i].hdr.chantitle; + if (m_current_view == COVERFLOW_CHANNEL && chantitle == HBC_108) + strncpy((char *) m_gameList[i].hdr.id, "JODI", 6); + + string id = string((const char *)m_gameList[i].hdr.id, m_current_view == COVERFLOW_CHANNEL ? 4 : 6); + + if ((!m_favorites || m_gcfg1.getBool("FAVORITES", id, false)) && (!m_locked || !m_gcfg1.getBool("ADULTONLY", id, false)) && !m_gcfg1.getBool("HIDDEN", id, false)) + { + if (m_category != 0) + { + const char *categories = m_cat.getString("CATEGORIES", id, "").c_str(); + if (strlen(categories) != 12 || categories[m_category] == '0') + continue; + } + + int playcount = m_gcfg1.getInt("PLAYCOUNT", id, 0); + unsigned int lastPlayed = m_gcfg1.getUInt("LASTPLAYED", id, 0); + + if(m_gamelistdump) + m_dump.setWString(domain, id, m_gameList[i].title); + + m_cf.addItem(&m_gameList[i], sfmt("%s/%s.png", m_picDir.c_str(), id.c_str()).c_str(), sfmt("%s/%s.png", m_boxPicDir.c_str(), id.c_str()).c_str(), playcount, lastPlayed); + } + } + m_gcfg1.unload(); + if (m_gamelistdump) + { + m_dump.save(true); + m_cfg.setBool(domain, "dump_list", false); + } + m_cf.setBoxMode(m_cfg.getBool("GENERAL", "box_mode", true)); + m_cf.setCompression(m_cfg.getBool("GENERAL", "allow_texture_compression", true)); + m_cf.setBufferSize(m_cfg.getInt("GENERAL", "cover_buffer", 120)); + m_cf.setSorting((Sorting)m_cfg.getInt(domain, "sort", 0)); + if (m_curGameId.empty() || !m_cf.findId(m_curGameId.c_str(), true)) + m_cf.findId(m_cfg.getString(domain, "current_item").c_str(), true); + m_cf.startCoverLoader(); +} + +void CMenu::_mainLoopCommon(bool withCF, bool blockReboot, bool adjusting) +{ + if (withCF) m_cf.tick(); + m_btnMgr.tick(); + m_fa.tick(); + m_cf.setFanartPlaying(m_fa.isLoaded()); + m_cf.setFanartTextColor(m_fa.getTextColor(m_theme.getColor("_COVERFLOW", "font_color", CColor(0xFFFFFFFF)))); + + _updateBg(); + + m_fa.hideCover() ? m_cf.hideCover() : m_cf.showCover(); + + if (withCF) m_cf.makeEffectTexture(m_vid, m_lqBg); + if (withCF && m_aa > 0) + { + m_vid.setAA(m_aa, true); + for (int i = 0; i < m_aa; ++i) + { + m_vid.prepareAAPass(i); + m_vid.setup2DProjection(false, true); + _drawBg(); + m_fa.draw(false); + m_cf.draw(); + m_vid.setup2DProjection(false, true); + m_cf.drawEffect(); + m_cf.drawText(adjusting); + m_vid.renderAAPass(i); + } + m_vid.setup2DProjection(); + m_vid.drawAAScene(); + } + else + { + m_vid.prepare(); + m_vid.setup2DProjection(); + _drawBg(); + m_fa.draw(false); + if (withCF) + { + m_cf.draw(); + m_vid.setup2DProjection(); + m_cf.drawEffect(); + m_cf.drawText(adjusting); + } + } + + m_fa.draw(); + + m_btnMgr.draw(); + ScanInput(); + + m_vid.setup2DProjection(); + m_vid.render(); + if (!blockReboot) + { + if (withCF && Sys_Exiting()) + m_cf.clear(); + if (Sys_Exiting()) + { + m_cat.save(); + m_cfg.save(); + } + Sys_Test(); + } + + if (withCF && m_gameSelected && m_gamesound_changed && (m_gameSoundHdr == NULL) && !m_gameSound.IsPlaying() && MusicPlayer::Instance()->GetVolume() == 0) + { + m_gameSound.Play(m_bnrSndVol); + m_gamesound_changed = false; + } + else if (!m_gameSelected) + m_gameSound.Stop(); + + CheckThreads(); + + if (withCF && m_gameSoundThread == LWP_THREAD_NULL) + m_cf.startCoverLoader(); + + MusicPlayer::Instance()->Tick(m_video_playing || (m_gameSelected && + m_gameSound.IsLoaded()) || m_gameSound.IsPlaying()); + + //Take Screenshot + if (gc_btnsPressed & PAD_TRIGGER_Z) + { + time_t rawtime; + struct tm * timeinfo; + char buffer[80]; + + time(&rawtime); + timeinfo = localtime(&rawtime); + strftime(buffer,80,"%b-%d-20%y-%Hh%Mm%Ss.png",timeinfo); + gprintf("Screenshot taken and saved to: %s/%s\n", m_screenshotDir.c_str(), buffer); + m_vid.TakeScreenshot(sfmt("%s/%s", m_screenshotDir.c_str(), buffer).c_str()); + if (!!m_cameraSound) + m_cameraSound->Play(255); + } + #ifdef SHOWMEM + m_btnMgr.setText(m_mem2FreeSize, wfmt(L"Mem2 Free:%u, Mem1 Free:%u", MEM2_freesize(), SYS_GetArena1Size()), true); + #endif +} + +void CMenu::_setBg(const STexture &tex, const STexture &lqTex) +{ + m_lqBg = lqTex; + if (tex.data.get() == m_nextBg.data.get()) return; + m_prevBg = m_curBg; + m_nextBg = tex; + m_bgCrossFade = 0xFF; +} + +void CMenu::_updateBg(void) +{ + Mtx modelViewMtx; + GXTexObj texObj; + GXTexObj texObj2; + Mtx44 projMtx; + + if (m_bgCrossFade == 0) return; + m_bgCrossFade = max(0, (int)m_bgCrossFade - 14); + if (m_bgCrossFade == 0) + { + m_curBg = m_nextBg; + return; + } + if (m_curBg.data.get() == m_prevBg.data.get()) + SMART_FREE(m_curBg.data); + m_vid.prepare(); + GX_SetViewport(0.f, 0.f, 640.f, 480.f, 0.f, 1.f); + guOrtho(projMtx, 0.f, 480.f, 0.f, 640.f, 0.f, 1000.0f); + GX_LoadProjectionMtx(projMtx, GX_ORTHOGRAPHIC); + GX_ClearVtxDesc(); + GX_SetNumTevStages(!m_prevBg.data ? 1 : 2); + GX_SetNumChans(0); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetNumTexGens(!m_prevBg.data ? 1 : 2); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetTexCoordGen(GX_TEXCOORD1, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetTevKColor(GX_KCOLOR0, CColor(m_bgCrossFade, 0xFF - m_bgCrossFade, 0, 0)); + GX_SetTevKColorSel(GX_TEVSTAGE0, GX_TEV_KCSEL_K0_R); + GX_SetTevColorIn(GX_TEVSTAGE0, GX_CC_TEXC, GX_CC_ZERO, GX_CC_KONST, GX_CC_ZERO); + GX_SetTevAlphaIn(GX_TEVSTAGE0, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO); + GX_SetTevColorOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLORNULL); + GX_SetTevKColorSel(GX_TEVSTAGE1, GX_TEV_KCSEL_K0_G); + GX_SetTevColorIn(GX_TEVSTAGE1, GX_CC_TEXC, GX_CC_ZERO, GX_CC_KONST, GX_CC_CPREV); + GX_SetTevAlphaIn(GX_TEVSTAGE1, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO); + GX_SetTevColorOp(GX_TEVSTAGE1, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE1, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevOrder(GX_TEVSTAGE1, GX_TEXCOORD1, GX_TEXMAP1, GX_COLORNULL); + GX_SetBlendMode(GX_BM_NONE, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + GX_SetAlphaUpdate(GX_FALSE); + GX_SetCullMode(GX_CULL_NONE); + GX_SetZMode(GX_DISABLE, GX_ALWAYS, GX_FALSE); + guMtxIdentity(modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + GX_InitTexObj(&texObj, m_nextBg.data.get(), m_nextBg.width, m_nextBg.height, m_nextBg.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + if (!!m_prevBg.data) + { + GX_InitTexObj(&texObj2, m_prevBg.data.get(), m_prevBg.width, m_prevBg.height, m_prevBg.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj2, GX_TEXMAP1); + } + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(0.f, 0.f, 0.f); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(640.f, 0.f, 0.f); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(640.f, 480.f, 0.f); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(0.f, 480.f, 0.f); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); + GX_SetNumTevStages(1); + m_curBg.width = 640; + m_curBg.height = 480; + m_curBg.format = GX_TF_RGBA8; + m_curBg.maxLOD = 0; + m_vid.renderToTexture(m_curBg, true); + if (!m_curBg.data) + { + m_curBg = m_nextBg; + m_bgCrossFade = 0; + } +} + +void CMenu::_drawBg(void) +{ + Mtx modelViewMtx; + GXTexObj texObj; + + GX_ClearVtxDesc(); + GX_SetNumTevStages(1); + GX_SetNumChans(0); + GX_SetVtxDesc(GX_VA_POS, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_POS, GX_POS_XYZ, GX_F32, 0); + GX_SetVtxDesc(GX_VA_TEX0, GX_DIRECT); + GX_SetVtxAttrFmt(GX_VTXFMT0, GX_VA_TEX0, GX_TEX_ST, GX_F32, 0); + GX_SetNumTexGens(1); + GX_SetTevColorIn(GX_TEVSTAGE0, GX_CC_ZERO, GX_CC_ZERO, GX_CC_ZERO, GX_CC_TEXC); + GX_SetTevAlphaIn(GX_TEVSTAGE0, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO, GX_CA_ZERO); + GX_SetTevColorOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTevAlphaOp(GX_TEVSTAGE0, GX_TEV_ADD, GX_TB_ZERO, GX_CS_SCALE_1, GX_TRUE, GX_TEVPREV); + GX_SetTexCoordGen(GX_TEXCOORD0, GX_TG_MTX2x4, GX_TG_TEX0, GX_IDENTITY); + GX_SetTevOrder(GX_TEVSTAGE0, GX_TEXCOORD0, GX_TEXMAP0, GX_COLORNULL); + GX_SetBlendMode(GX_BM_NONE, GX_BL_SRCALPHA, GX_BL_INVSRCALPHA, GX_LO_CLEAR); + GX_SetAlphaUpdate(GX_FALSE); + GX_SetCullMode(GX_CULL_NONE); + GX_SetZMode(GX_DISABLE, GX_ALWAYS, GX_FALSE); + guMtxIdentity(modelViewMtx); + GX_LoadPosMtxImm(modelViewMtx, GX_PNMTX0); + GX_InitTexObj(&texObj, m_curBg.data.get(), m_curBg.width, m_curBg.height, m_curBg.format, GX_CLAMP, GX_CLAMP, GX_FALSE); + GX_LoadTexObj(&texObj, GX_TEXMAP0); + GX_Begin(GX_QUADS, GX_VTXFMT0, 4); + GX_Position3f32(0.f, 0.f, 0.f); + GX_TexCoord2f32(0.f, 0.f); + GX_Position3f32(640.f, 0.f, 0.f); + GX_TexCoord2f32(1.f, 0.f); + GX_Position3f32(640.f, 480.f, 0.f); + GX_TexCoord2f32(1.f, 1.f); + GX_Position3f32(0.f, 480.f, 0.f); + GX_TexCoord2f32(0.f, 1.f); + GX_End(); +} + +void CMenu::_updateText(void) +{ + _textMain(); + _textError(); + _textConfig(); + _textConfig3(); + _textConfigScreen(); + _textConfig4(); + _textConfigSnd(); + _textConfigAdv(); + _textDownload(); + _textGame(); + _textCode(); + _textWBFS(); + _textGameSettings(); + _textCategorySettings(); + _textSystem(); +} + +const wstringEx CMenu::_fmt(const char *key, const wchar_t *def) +{ + wstringEx ws = m_loc.getWString(m_curLanguage, key, def); + if (checkFmt(def, ws)) return ws; + return def; +} + +bool CMenu::_loadChannelList(void) +{ + currentPartition = m_cfg.getInt("NAND", "partition", -1); + static u8 lastPartition = currentPartition; + + bool disable_emu = m_cfg.getBool("NAND", "disable", true); + static bool last_emu_state = disable_emu; + + if(!disable_emu && !DeviceHandler::Instance()->IsInserted(currentPartition)) + return false; + + static bool first = true; + static bool failed = false; + + bool changed = lastPartition != currentPartition || last_emu_state != disable_emu || first || failed; + + gprintf("%s, which is %s\n", disable_emu ? "NAND" : DeviceName[currentPartition], changed ? "refreshing." : "cached."); + + string path = m_cfg.getString("NAND", "path", ""); + + if(first && !disable_emu) + { + char filepath[ISFS_MAXPATH] ATTRIBUTE_ALIGN(32); + + u32 sysconf_size, meez_size; + + sprintf(filepath, "/shared2/sys/SYSCONF"); + u8 *sysconf = ISFS_GetFile((u8 *) &filepath, &sysconf_size, -1); + + if(sysconf != NULL && sysconf_size > 0) + { + sprintf(filepath, "%s:%sshared2/sys/SYSCONF", DeviceName[currentPartition], path.c_str()); + FILE *file = fopen(filepath, "wb"); + if(file) + { + fwrite(sysconf, 1, sysconf_size, file); + gprintf("Written SYSCONF to: %s\n", filepath); + fclose(file); + } + else gprintf("Openning %s failed returning %i\n", filepath, file); + SAFE_FREE(sysconf); + } + + sprintf(filepath, "/shared2/menu/FaceLib/RFL_DB.dat"); + u8 *meez = ISFS_GetFile((u8 *) &filepath, &meez_size, -1); + + if(meez != NULL && meez_size > 0) + { + sprintf(filepath, "%s:%sshared2/menu/FaceLib/RFL_DB.dat", DeviceName[currentPartition], path.c_str()); + FILE *file = fopen(filepath, "wb"); + if(file) + { + fwrite(meez, 1, meez_size, file); + gprintf("Written Mii's to: %s\n", filepath); + fclose(file); + } + else gprintf("Openning %s failed returning %i\n", filepath, file); + SAFE_FREE(meez); + } + first = false; + } + + if(changed) + { + Nand::Instance()->Disable_Emu(); + if(!DeviceHandler::Instance()->IsInserted(lastPartition)) + DeviceHandler::Instance()->Mount(lastPartition); + + DeviceHandler::Instance()->UnMount(currentPartition); + + Nand::Instance()->Init(path.c_str(), currentPartition, disable_emu); + if(Nand::Instance()->Enable_Emu() < 0) + { + Nand::Instance()->Disable_Emu(); + failed = true; + } + else failed = false; + } + + if(!DeviceHandler::Instance()->IsInserted(currentPartition)) + DeviceHandler::Instance()->Mount(currentPartition); + + string nandpath = sfmt("%s:%s", DeviceName[currentPartition], path.empty() ? "/" : path.c_str()); + gprintf("nandpath = %s\n", nandpath.c_str()); + + if(!failed) m_gameList.LoadChannels(disable_emu ? "" : nandpath, 0); + + lastPartition = currentPartition; + last_emu_state = disable_emu; + + return m_gameList.size() > 0 ? true : false; +} + +bool CMenu::_loadList(void) +{ + m_cf.clear(); + m_gameList.clear(); + + gprintf("Loading items of "); + + if(m_cfg.getBool(_domainFromView(), "update_cache")) m_gameList.Update(m_current_view); + + bool retval; + switch(m_current_view) + { + case COVERFLOW_CHANNEL: + gprintf("channel view from "); + retval = _loadChannelList(); + break; + case COVERFLOW_HOMEBREW: + gprintf("homebrew view from "); + retval = _loadHomebrewList(); + break; + default: + gprintf("usb view from "); + retval = _loadGameList(); + break; + } + + m_cfg.remove(_domainFromView(), "update_cache"); + + return retval; +} + +bool CMenu::_loadGameList(void) +{ + currentPartition = m_cfg.getInt("GAMES", "partition", 1); + if(!DeviceHandler::Instance()->IsInserted(currentPartition)) + return false; + + gprintf("%s\n", DeviceName[currentPartition]); + DeviceHandler::Instance()->Open_WBFS(currentPartition); + m_gameList.Load(sfmt(GAMES_DIR, DeviceName[currentPartition]), ".wbfs|.iso"); + return m_gameList.size() > 0 ? true : false; +} + +bool CMenu::_loadHomebrewList() +{ + currentPartition = m_cfg.getInt("HOMEBREW", "partition", DeviceHandler::Instance()->PathToDriveType(m_appDir.c_str())); + if(!DeviceHandler::Instance()->IsInserted(currentPartition)) + return false; + + gprintf("%s\n", DeviceName[currentPartition]); + DeviceHandler::Instance()->Open_WBFS(currentPartition); + + m_gameList.Load(sfmt(HOMEBREW_DIR, DeviceName[currentPartition]), ".dol|.elf"); + return m_gameList.size() > 0 ? true : false; +} + +void CMenu::_stopSounds(void) +{ + // Fade out sounds + int fade_rate = m_cfg.getInt("GENERAL", "music_fade_rate", 8); + + if (!MusicPlayer::Instance()->IsStopped()) + { + while (MusicPlayer::Instance()->GetVolume() > 0 || m_gameSound.GetVolume() > 0) + { + MusicPlayer::Instance()->Tick(true); + + if (m_gameSound.GetVolume() > 0) + m_gameSound.SetVolume(m_gameSound.GetVolume() < fade_rate ? 0 : m_gameSound.GetVolume() - fade_rate); + + VIDEO_WaitVSync(); + } + } + + m_btnMgr.stopSounds(); + m_cf.stopSound(); + + MusicPlayer::Instance()->Stop(); + m_gameSound.Stop(); +} + +bool CMenu::_loadFile(SmartBuf &buffer, u32 &size, const char *path, const char *file) +{ + SMART_FREE(buffer); + size = 0; + FILE *fp = fopen(file == NULL ? path : fmt("%s/%s", path, file), "rb"); + + if (fp == 0) return false; + + fseek(fp, 0, SEEK_END); + u32 fileSize = ftell(fp); + fseek(fp, 0, SEEK_SET); + SmartBuf fileBuf = smartAnyAlloc(fileSize); + if (!fileBuf) + { + SAFE_CLOSE(fp); + return false; + } + if (fread(fileBuf.get(), 1, fileSize, fp) != fileSize) + { + SAFE_CLOSE(fp); + return false; + } + SAFE_CLOSE(fp); + buffer = fileBuf; + size = fileSize; + return true; +} + +void CMenu::_load_installed_cioses() +{ + if (_installed_cios.size() > 0) return; + gprintf("Loading cIOS map\n"); + + _installed_cios[0] = 1; + u8 base = 0; + + for (u8 slot = 100; slot < 254; slot++) + if(cIOSInfo::D2X(slot, &base)) + { + gprintf("Found base %u in slot %u\n", base, slot); + _installed_cios[slot] = base; + } +} + +void CMenu::_hideWaitMessage(bool force) +{ + m_vid.hideWaitMessage(force); +} + +void CMenu::_showWaitMessage() +{ + TexSet texSet; + m_vid.waitMessage( + _textures(texSet, "GENERAL", "waitmessage"), + m_theme.getFloat("GENERAL", "waitmessage_delay", 0.f), + m_theme.getBool("GENERAL", "waitmessage_wiilight", m_cfg.getBool("GENERAL", "waitmessage_wiilight", true)) + ); +} + +typedef struct map_entry +{ + char filename[8]; + u8 sha1[20]; +} __attribute((packed)) map_entry_t; + +void CMenu::_loadDefaultFont(bool korean) +{ + u32 size; + bool retry = false; + + // Read content.map from ISFS + u8 *content = ISFS_GetFile((u8 *) "/shared1/content.map", &size, 0); + int items = size / sizeof(map_entry_t); + + //gprintf("Open content.map, size %d, items %d\n", size, items); + +retry: + bool kor_font = (korean && !retry) || (!korean && retry); + map_entry_t *cm = (map_entry_t *) content; + for (int i = 0; i < items; i++) + { + if (memcmp(cm[i].sha1, kor_font ? WIIFONT_HASH_KOR : WIIFONT_HASH, 20) == 0) + { + // Name found, load it and unpack it + char u8_font_filename[22] = {0}; + strcpy(u8_font_filename, "/shared1/XXXXXXXX.app"); // Faster than sprintf + memcpy(u8_font_filename+9, cm[i].filename, 8); + + u8 *u8_font_archive = ISFS_GetFile((u8 *) u8_font_filename, &size, 0); + + //gprintf("Opened fontfile: %s: %d bytes\n", u8_font_filename, size); + + if (u8_font_archive != NULL) + { + const u8 *font_file = u8_get_file_by_index(u8_font_archive, 1, &size); // There is only one file in that app + + //gprintf("Extracted font: %d\n", size); + + m_base_font = smartMem2Alloc(size); + memcpy(m_base_font.get(), font_file, size); + if(!!m_base_font) + m_base_font_size = size; + } + SAFE_FREE(u8_font_archive); + break; + } + } + + if (!retry) + { + retry = true; + goto retry; + } + + SAFE_FREE(content); +} + +void CMenu::_cleanupDefaultFont() +{ + SMART_FREE(m_base_font); + m_base_font_size = 0; +} + +const char *CMenu::_domainFromView() +{ + switch(m_current_view) + { + case COVERFLOW_CHANNEL: + return "NAND"; + case COVERFLOW_HOMEBREW: + return "HOMEBREW"; + default: + return "GAMES"; + } + return "NULL"; +} + +void CMenu::UpdateCache(u32 view) +{ + if(view == COVERFLOW_MAX) + { + UpdateCache(COVERFLOW_USB); + UpdateCache(COVERFLOW_HOMEBREW); + UpdateCache(COVERFLOW_CHANNEL); + return; + } + + const char *domain; + switch(view) + { + case COVERFLOW_CHANNEL: + domain = "NAND"; + case COVERFLOW_HOMEBREW: + domain = "HOMEBREW"; + default: + domain = "GAMES"; + } + + m_cfg.setBool(domain, "update_cache", true); +} \ No newline at end of file diff --git a/source/menu/menu.hpp b/source/menu/menu.hpp new file mode 100644 index 00000000..d79e527f --- /dev/null +++ b/source/menu/menu.hpp @@ -0,0 +1,775 @@ +#ifndef __MENU_HPP +#define __MENU_HPP +//#define SHOWMEM 1 +#include +#include + +#include "safe_vector.hpp" +#include "cachedlist.hpp" + +#include +#include "gui_sound.h" +#include "cursor.hpp" +#include "gui.hpp" +#include "coverflow.hpp" +#include "fanart.hpp" +#include "loader/disc.h" +#include "btnmap.h" +#include "banner.h" +#include "channels.h" +#include "gct.h" +#include "DeviceHandler.hpp" +#include "musicplayer.h" + +//Also in wbfs.h +#define PART_FS_WBFS 0 +#define PART_FS_FAT 1 +#define PART_FS_NTFS 2 +#define PART_FS_EXT 3 + +extern "C" {extern u8 currentPartition;} +extern bool bootHB; + +class CMenu +{ +public: + CMenu(CVideo &vid); + ~CMenu(void) {cleanup();} + void init(void); + void error(const wstringEx &msg); + int main(void); + void cleanup(bool ios_reload = false); + u32 m_current_view; +private: + struct SZone + { + int x; + int y; + int w; + int h; + bool hide; + }; + CVideo &m_vid; + CCursor m_cursor[WPAD_MAX_WIIMOTES]; + CButtonsMgr m_btnMgr; + + CCoverFlow m_cf; + CFanart m_fa; + CachedList m_gameList; + Config m_cfg; + Config m_loc; + Config m_cat; + Config m_gcfg1; + Config m_gcfg2; + Config m_theme; + Config m_titles; + Config m_version; + Channels m_channels; + safe_vector m_homebrewArgs; + SmartBuf m_base_font; + u32 m_base_font_size; + u8 m_aa; + bool m_directLaunch; + bool m_gamelistdump; + bool m_locked; + bool m_favorites; + s16 m_showtimer; + std::string m_curLanguage; + std::string m_curGameId; + std::string m_curChanId; + + u8 m_numCFVersions; + // + std::string m_themeDataDir; + std::string m_appDir; + std::string m_dataDir; + std::string m_picDir; + std::string m_boxPicDir; + std::string m_cacheDir; + std::string m_themeDir; + std::string m_musicDir; + std::string m_txtCheatDir; + std::string m_cheatDir; + std::string m_wipDir; + std::string m_videoDir; + std::string m_fanartDir; + std::string m_screenshotDir; + std::string m_settingsDir; + std::string m_languagesDir; + std::string m_listCacheDir; + /* Updates */ + const char* m_app_update_url; + const char* m_data_update_url; + std::string m_dol; + std::string m_app_update_zip; + u32 m_app_update_size; + std::string m_data_update_zip; + u32 m_data_update_size; + std::string m_ver; + /* End Updates */ + // + STexture m_prevBg; + STexture m_nextBg; + STexture m_curBg; + STexture m_lqBg; + u8 m_bgCrossFade; + // + STexture m_errorBg; + STexture m_mainBg; + STexture m_configBg; + STexture m_config3Bg; + STexture m_configScreenBg; + STexture m_config4Bg; + STexture m_configAdvBg; + STexture m_configSndBg; + STexture m_downloadBg; + STexture m_gameBg; + STexture m_codeBg; + STexture m_aboutBg; + STexture m_systemBg; + STexture m_wbfsBg; + STexture m_gameSettingsBg; + STexture m_gameBgLQ; + STexture m_mainBgLQ; + STexture m_categoryBg; + // + u32 m_errorLblMessage; + u32 m_errorLblIcon; + u32 m_errorLblUser[4]; +//Main Coverflow + u32 m_mainBtnConfig; + u32 m_mainBtnInfo; + u32 m_mainBtnFavoritesOn; + u32 m_mainBtnFavoritesOff; + u32 m_mainLblLetter; +#ifdef SHOWMEM + u32 m_mem2FreeSize; +#endif + u32 m_mainLblNotice; + u32 m_mainBtnNext; + u32 m_mainBtnPrev; + u32 m_mainBtnQuit; + u32 m_mainBtnDVD; + u32 m_mainBtnUsb; + u32 m_mainBtnChannel; + u32 m_mainBtnHomebrew; + u32 m_mainBtnInit; + u32 m_mainBtnInit2; + u32 m_mainLblInit; + u32 m_mainLblUser[6]; +//Main Config menus + u32 m_configLblPage; + u32 m_configBtnPageM; + u32 m_configBtnPageP; + u32 m_configBtnBack; + u32 m_configLblTitle; + u32 m_configLblDownload; + u32 m_configBtnDownload; + u32 m_configLblParental; + u32 m_configBtnUnlock; + u32 m_configBtnSetCode; + u32 m_configLblPartitionName; + u32 m_configLblPartition; + u32 m_configBtnPartitionP; + u32 m_configBtnPartitionM; + u32 m_configBtnEmulation; + u32 m_configLblEmulation; + u32 m_configLblUser[4]; + u32 m_configAdvLblTheme; + u32 m_configAdvLblCurTheme; + u32 m_configAdvBtnCurThemeM; + u32 m_configAdvBtnCurThemeP; + u32 m_configAdvLblLanguage; + u32 m_configAdvLblCurLanguage; + u32 m_configAdvBtnCurLanguageM; + u32 m_configAdvBtnCurLanguageP; + u32 m_configAdvLblCFTheme; + u32 m_configAdvBtnCFTheme; + u32 m_configAdvLblInstall; + u32 m_configAdvBtnInstall; + u32 m_configAdvLblUser[4]; + u32 m_config3LblGameLanguage; + u32 m_config3LblLanguage; + u32 m_config3BtnLanguageP; + u32 m_config3BtnLanguageM; + u32 m_config3LblGameVideo; + u32 m_config3LblVideo; + u32 m_config3BtnVideoP; + u32 m_config3BtnVideoM; + u32 m_config3LblOcarina; + u32 m_config3BtnOcarina; + u32 m_config3LblAsyncNet; + u32 m_config3BtnAsyncNet; + u32 m_config3LblUser[4]; + u32 m_config4LblReturnTo; + u32 m_config4LblReturnToVal; + u32 m_config4BtnReturnToM; + u32 m_config4BtnReturnToP; + u32 m_config4LblHome; + u32 m_config4BtnHome; + u32 m_config4LblSaveFavMode; + u32 m_config4BtnSaveFavMode; + u32 m_config4LblCategoryOnBoot; + u32 m_config4BtnCategoryOnBoot; + u32 m_config4LblUser[4]; + u32 m_configSndLblBnrVol; + u32 m_configSndLblBnrVolVal; + u32 m_configSndBtnBnrVolP; + u32 m_configSndBtnBnrVolM; + u32 m_configSndLblMusicVol; + u32 m_configSndLblMusicVolVal; + u32 m_configSndBtnMusicVolP; + u32 m_configSndBtnMusicVolM; + u32 m_configSndLblGuiVol; + u32 m_configSndLblGuiVolVal; + u32 m_configSndBtnGuiVolP; + u32 m_configSndBtnGuiVolM; + u32 m_configSndLblCFVol; + u32 m_configSndLblCFVolVal; + u32 m_configSndBtnCFVolP; + u32 m_configSndBtnCFVolM; + u32 m_configSndLblUser[4]; + u32 m_configScreenLblTVHeight; + u32 m_configScreenLblTVHeightVal; + u32 m_configScreenBtnTVHeightP; + u32 m_configScreenBtnTVHeightM; + u32 m_configScreenLblTVWidth; + u32 m_configScreenLblTVWidthVal; + u32 m_configScreenBtnTVWidthP; + u32 m_configScreenBtnTVWidthM; + u32 m_configScreenLblTVX; + u32 m_configScreenLblTVXVal; + u32 m_configScreenBtnTVXM; + u32 m_configScreenBtnTVXP; + u32 m_configScreenLblTVY; + u32 m_configScreenLblTVYVal; + u32 m_configScreenBtnTVYM; + u32 m_configScreenBtnTVYP; + u32 m_configScreenLblUser[4]; +//Download menu + u32 m_downloadLblTitle; + u32 m_downloadPBar; + u32 m_downloadBtnCancel; + u32 m_downloadBtnAll; + u32 m_downloadBtnMissing; + u32 m_downloadBtnGameTDBDownload; + u32 m_downloadLblGameTDBDownload; + u32 m_downloadLblMessage[2]; + u32 m_downloadLblCovers; + u32 m_downloadLblGameTDB; + u32 m_downloadLblUser[4]; + u32 m_downloadBtnVersion; + static s8 _versionDownloaderInit(CMenu *m); + static s8 _versionTxtDownloaderInit(CMenu *m); + s8 _versionDownloader(); + s8 _versionTxtDownloader(); +//Game menu + u32 m_gameLblInfo; + u32 m_gameBtnFavoriteOn; + u32 m_gameBtnFavoriteOff; + u32 m_gameBtnAdultOn; + u32 m_gameBtnAdultOff; + u32 m_gameBtnPlay; + u32 m_gameBtnDelete; + u32 m_gameBtnSettings; + u32 m_gameBtnBack; + u32 m_gameLblUser[4]; +// Parental code menu + u32 m_codeLblTitle; + u32 m_codeBtnKey[10]; + u32 m_codeBtnBack; + u32 m_codeBtnErase; + u32 m_codeLblUser[4]; +//About menu + u32 m_aboutLblTitle; + u32 m_aboutLblInfo; + u32 m_aboutLblUser[4]; + u32 m_aboutLblIOS; + u32 m_aboutBtnSystem; +//menu_wbfs + u32 m_wbfsLblTitle; + u32 m_wbfsPBar; + u32 m_wbfsBtnBack; + u32 m_wbfsBtnGo; + u32 m_wbfsLblDialog; + u32 m_wbfsLblMessage; + u32 m_wbfsLblUser[4]; +//Theme Adjust menus + u32 m_cfThemeBtnAlt; + u32 m_cfThemeBtnSelect; + u32 m_cfThemeBtnWide; + u32 m_cfThemeLblParam; + u32 m_cfThemeBtnParamM; + u32 m_cfThemeBtnParamP; + u32 m_cfThemeBtnCopy; + u32 m_cfThemeBtnPaste; + u32 m_cfThemeBtnSave; + u32 m_cfThemeBtnCancel; + u32 m_cfThemeLblVal[4 * 4]; + u32 m_cfThemeBtnValM[4 * 4]; + u32 m_cfThemeBtnValP[4 * 4]; + u32 m_cfThemeLblValTxt[4]; +//Game Settings menus + u32 m_gameSettingsLblPage; + u32 m_gameSettingsBtnPageM; + u32 m_gameSettingsBtnPageP; + u32 m_gameSettingsBtnBack; + u32 m_gameSettingsLblTitle; + u32 m_gameSettingsLblGameLanguage; + u32 m_gameSettingsLblLanguage; + u32 m_gameSettingsBtnLanguageP; + u32 m_gameSettingsBtnLanguageM; + u32 m_gameSettingsLblGameVideo; + u32 m_gameSettingsLblVideo; + u32 m_gameSettingsBtnVideoP; + u32 m_gameSettingsBtnVideoM; + u32 m_gameSettingsLblOcarina; + u32 m_gameSettingsBtnOcarina; + u32 m_gameSettingsLblVipatch; + u32 m_gameSettingsBtnVipatch; + u32 m_gameSettingsLblCountryPatch; + u32 m_gameSettingsBtnCountryPatch; + u32 m_gameSettingsLblCover; + u32 m_gameSettingsBtnCover; + u32 m_gameSettingsLblPatchVidModes; + u32 m_gameSettingsLblPatchVidModesVal; + u32 m_gameSettingsBtnPatchVidModesM; + u32 m_gameSettingsBtnPatchVidModesP; + u32 m_gameSettingsLblUser[3 * 2]; + u32 m_gameSettingsLblHooktype; + u32 m_gameSettingsLblHooktypeVal; + u32 m_gameSettingsBtnHooktypeM; + u32 m_gameSettingsBtnHooktypeP; + u32 m_gameSettingsBtnEmulation; + u32 m_gameSettingsLblEmulation; + u32 m_gameSettingsLblDebugger; + u32 m_gameSettingsLblDebuggerV; + u32 m_gameSettingsBtnDebuggerP; + u32 m_gameSettingsBtnDebuggerM; + u32 m_gameSettingsLblCheat; + u32 m_gameSettingsBtnCheat; + u32 m_gameSettingsLblCategoryMain; + u32 m_gameSettingsBtnCategoryMain; + u32 m_gameSettingsLblCategory[12]; + u32 m_gameSettingsBtnCategory[12]; + u32 m_gameCategoryPage; + u32 m_gameSettingsPage; +// System Menu + u32 m_systemBtnBack; + u32 m_systemLblTitle; + u32 m_systemLblVersionTxt; + u32 m_systemLblVersion; + u32 m_systemLblVersionRev; + u32 m_systemLblUser[4]; + u32 m_systemBtnDownload; + u32 m_systemLblInfo; + u32 m_systemLblVerSelectVal; + u32 m_systemBtnVerSelectM; + u32 m_systemBtnVerSelectP; +//Cheat menu + u32 m_cheatBtnBack; + u32 m_cheatBtnApply; + u32 m_cheatBtnDownload; + u32 m_cheatLblTitle; + u32 m_cheatLblPage; + u32 m_cheatBtnPageM; + u32 m_cheatBtnPageP; + u32 m_cheatLblItem[4]; + u32 m_cheatBtnItem[4]; + u32 m_cheatSettingsPage; + u32 m_cheatLblUser[4]; + STexture m_cheatBg; + GCTCheats m_cheatfile; +// Gameinfo menu + u32 m_gameinfoLblTitle; + u32 m_gameinfoLblID; + u32 m_gameinfoLblSynopsis; + u32 m_gameinfoLblDev; + u32 m_gameinfoLblRegion; + u32 m_gameinfoLblPublisher; + u32 m_gameinfoLblRlsdate; + u32 m_gameinfoLblGenre; + u32 m_gameinfoLblRating; + u32 m_gameinfoLblWifiplayers; + u32 m_gameinfoLblUser[5]; + u32 m_gameinfoLblControlsReq[4]; + u32 m_gameinfoLblControls[4]; + STexture m_gameinfoBg; + STexture m_rating; + STexture m_wifi; + STexture m_controlsreq[4]; + STexture m_controls[4]; +// Category menu + u32 m_categoryBtn[12]; + u32 m_categoryBtnBack; + u32 m_categoryLblUser[4]; + u8 m_max_categories; + u8 m_category; +// Zones + SZone m_mainPrevZone; + SZone m_mainNextZone; + SZone m_mainButtonsZone; + SZone m_mainButtonsZone2; + SZone m_mainButtonsZone3; + SZone m_gameButtonsZone; + bool m_reload; + bool m_initialCoverStatusComplete; + + WPADData *wd[WPAD_MAX_WIIMOTES]; + void LeftStick(); + u8 pointerhidedelay[WPAD_MAX_WIIMOTES]; + u16 stickPointer_x[WPAD_MAX_WIIMOTES]; + u16 stickPointer_y[WPAD_MAX_WIIMOTES]; + + u8 m_wpadLeftDelay; + u8 m_wpadDownDelay; + u8 m_wpadRightDelay; + u8 m_wpadUpDelay; + u8 m_wpadADelay; + //u8 m_wpadBDelay; + + u8 m_padLeftDelay; + u8 m_padDownDelay; + u8 m_padRightDelay; + u8 m_padUpDelay; + u8 m_padADelay; + //u8 m_padBDelay; + + u32 wii_btnsPressed; + u32 wii_btnsHeld; + u32 gc_btnsPressed; + u32 gc_btnsHeld; + + bool m_show_pointer[WPAD_MAX_WIIMOTES]; + float left_stick_angle[WPAD_MAX_WIIMOTES]; + float left_stick_mag[WPAD_MAX_WIIMOTES]; + float right_stick_angle[WPAD_MAX_WIIMOTES]; + float right_stick_mag[WPAD_MAX_WIIMOTES]; + float wmote_roll[WPAD_MAX_WIIMOTES]; + s32 right_stick_skip[WPAD_MAX_WIIMOTES]; + s32 wmote_roll_skip[WPAD_MAX_WIIMOTES]; + bool enable_wmote_roll; + + void SetupInput(void); + void ScanInput(void); + + void ButtonsPressed(void); + void ButtonsHeld(void); + + bool lStick_Up(void); + bool lStick_Right(void); + bool lStick_Down(void); + bool lStick_Left(void); + + bool rStick_Up(void); + bool rStick_Right(void); + bool rStick_Down(void); + bool rStick_Left(void); + + bool wRoll_Left(void); + bool wRoll_Right(void); + + bool wii_btnRepeat(s64 btn); + bool gc_btnRepeat(s64 btn); + + bool WPadIR_Valid(int chan); + bool WPadIR_ANY(void); + + void ShowZone(SZone zone, bool &showZone); + void ShowMainZone(void); + void ShowMainZone2(void); + void ShowMainZone3(void); + void ShowPrevZone(void); + void ShowNextZone(void); + void ShowGameZone(void); + bool m_show_zone_main; + bool m_show_zone_main2; + bool m_show_zone_main3; + bool m_show_zone_prev; + bool m_show_zone_next; + bool m_show_zone_game; + + volatile bool m_exit; + volatile bool m_disable_exit; + + volatile bool m_networkInit; + volatile bool m_thrdStop; + volatile bool m_thrdWorking; + volatile bool m_thrdNetwork; + float m_thrdStep; + float m_thrdStepLen; + std::string m_coverDLGameId; + mutex_t m_mutex; + wstringEx m_thrdMessage; + volatile float m_thrdProgress; + volatile bool m_thrdMessageAdded; + volatile bool m_gameSelected; + GuiSound m_gameSound; + SmartGuiSound m_cameraSound; + dir_discHdr *m_gameSoundHdr; + lwp_t m_gameSoundThread; + bool m_gamesound_changed; + u8 m_bnrSndVol; + + bool m_video_playing; + +private: + enum WBFS_OP { WO_ADD_GAME, WO_REMOVE_GAME, WO_FORMAT }; + typedef std::pair FontDesc; + typedef std::map FontSet; + typedef std::map TexSet; + typedef std::map SoundSet; + struct SThemeData + { + TexSet texSet; + FontSet fontSet; + SoundSet soundSet; + SFont btnFont; + SFont lblFont; + SFont titleFont; + SFont txtFont; + CColor btnFontColor; + CColor lblFontColor; + CColor txtFontColor; + CColor titleFontColor; + STexture bg; + STexture btnTexL; + STexture btnTexR; + STexture btnTexC; + STexture btnTexLS; + STexture btnTexRS; + STexture btnTexCS; + STexture pbarTexL; + STexture pbarTexR; + STexture pbarTexC; + STexture pbarTexLS; + STexture pbarTexRS; + STexture pbarTexCS; + STexture btnTexPlus; + STexture btnTexPlusS; + STexture btnTexMinus; + STexture btnTexMinusS; + SmartGuiSound clickSound; + SmartGuiSound hoverSound; + SmartGuiSound cameraSound; + }; + struct SCFParamDesc + { + enum { PDT_EMPTY, PDT_FLOAT, PDT_V3D, PDT_COLOR, PDT_BOOL, PDT_INT, PDT_TXTSTYLE } paramType[4]; + enum { PDD_BOTH, PDD_NORMAL, PDD_SELECTED } domain; + bool scrnFmt; + const char name[32]; + const char valName[4][64]; + const char key[4][48]; + float step[4]; + float minMaxVal[4][2]; + }; + // + bool _loadChannelList(void); + bool _loadList(void); + bool _loadHomebrewList(void); + bool _loadGameList(void); + void _initCF(void); + // + void _initMainMenu(SThemeData &theme); + void _initErrorMenu(SThemeData &theme); + void _initConfigMenu(SThemeData &theme); + void _initConfigAdvMenu(SThemeData &theme); + void _initConfig3Menu(SThemeData &theme); + void _initConfig4Menu(SThemeData &theme); + void _initConfigSndMenu(SThemeData &theme); + void _initConfigScreenMenu(SThemeData &theme); + void _initGameMenu(SThemeData &theme); + void _initDownloadMenu(SThemeData &theme); + void _initCodeMenu(SThemeData &theme); + void _initAboutMenu(SThemeData &theme); + void _initWBFSMenu(SThemeData &theme); + void _initCFThemeMenu(SThemeData &theme); + void _initGameSettingsMenu(SThemeData &theme); + void _initCheatSettingsMenu(SThemeData &theme); + void _initCheatButtons(); + void _initCategorySettingsMenu(SThemeData &theme); + void _initSystemMenu(SThemeData &theme); + void _initGameInfoMenu(SThemeData &theme); + // + void _textCategorySettings(void); + void _textCheatSettings(void); + void _textSystem(void); + void _textMain(void); + void _textError(void); + void _textYesNo(void); + void _textConfig(void); + void _textConfig3(void); + void _textConfigScreen(void); + void _textConfig4(void); + void _textConfigAdv(void); + void _textConfigSnd(void); + void _textGame(void); + void _textDownload(void); + void _textCode(void); + void _textAbout(void); + void _textWBFS(void); + void _textGameSettings(void); + void _textGameInfo(void); + // + void _hideCheatSettings(bool instant = false); + void _hideError(bool instant = false); + void _hideMain(bool instant = false); + void _hideConfig(bool instant = false); + void _hideConfig3(bool instant = false); + void _hideConfigScreen(bool instant = false); + void _hideConfig4(bool instant = false); + void _hideConfigAdv(bool instant = false); + void _hideConfigSnd(bool instant = false); + void _hideGame(bool instant = false); + void _hideDownload(bool instant = false); + void _hideCode(bool instant = false); + void _hideAbout(bool instant = false); + void _hideWBFS(bool instant = false); + void _hideCFTheme(bool instant = false); + void _hideGameSettings(bool instant = false); + void _hideCategorySettings(bool instant = false); + void _hideSystem(bool instant = false); + void _hideGameInfo(bool instant = false); + void _hideCheatDownload(bool instant = false); + // + void _showError(void); + void _showMain(void); + void _showConfig(void); + void _showConfig3(void); + void _showConfigScreen(void); + void _showConfig4(void); + void _showConfigAdv(void); + void _showConfigSnd(void); + void _showGame(void); + void _showDownload(void); + void _showCode(void); + void _showAbout(void); + void _showCategorySettings(void); + void _showCheatSettings(void); + void _showSystem(void); + void _showGameInfo(void); + void _showWBFS(WBFS_OP op); + void _showCFTheme(u32 curParam, int version, bool wide); + void _showGameSettings(void); + void _showCheatDownload(void); + void _setBg(const STexture &tex, const STexture &lqTex); + void _updateBg(void); + void _drawBg(void); + void _updateText(void); + // + void _config(int page); + int _config1(void); + int _config3(void); + int _configScreen(void); + int _config4(void); + int _configAdv(void); + int _configSnd(void); + void _game(bool launch = false); + void _download(std::string gameId = std::string()); + bool _code(char code[4], bool erase = false); + void _about(void); + bool _wbfsOp(WBFS_OP op); + void _cfTheme(void); + void _system(void); + void _gameinfo(void); + void _gameSettings(void); + void _CheatSettings(); + void _CategorySettings(); + // + void _mainLoopCommon(bool withCF = false, bool blockReboot = false, bool adjusting = false); + // + safe_vector _searchGamesByID(const char *gameId); +/* safe_vector _searchGamesByTitle(wchar_t letter); + safe_vector _searchGamesByType(const char type); + safe_vector _searchGamesByRegion(const char region); */ +public: + void _directlaunch(const std::string &id); +private: + bool _loadFile(SmartBuf &buffer, u32 &size, const char *path, const char *file); + void _launch(dir_discHdr *hdr); + void _launchGame(dir_discHdr *hdr, bool dvd); + void _launchChannel(dir_discHdr *hdr); + void _launchHomebrew(const char *filepath, safe_vector arguments); + void _setAA(int aa); + void _loadCFCfg(SThemeData &theme); + void _loadCFLayout(int version, bool forceAA = false, bool otherScrnFmt = false); + Vector3D _getCFV3D(const std::string &domain, const std::string &key, const Vector3D &def, bool otherScrnFmt = false); + int _getCFInt(const std::string &domain, const std::string &key, int def, bool otherScrnFmt = false); + float _getCFFloat(const std::string &domain, const std::string &key, float def, bool otherScrnFmt = false); + void _cfParam(bool inc, int i, const SCFParamDesc &p, int cfVersion, bool wide); + void _buildMenus(void); + void _loadDefaultFont(bool korean); + void _cleanupDefaultFont(); + const char *_domainFromView(void); + void UpdateCache(u32 view = COVERFLOW_MAX); + SFont _font(CMenu::FontSet &fontSet, const char *domain, const char *key, u32 fontSize, u32 lineSpacing, u32 weight, u32 index, const char *genKey); + STexture _texture(TexSet &texSet, const char *domain, const char *key, STexture def); + safe_vector _textures(TexSet &texSet, const char *domain, const char *key); + void _showWaitMessage(); +public: + void _hideWaitMessage(bool force = false); +private: + SmartGuiSound _sound(CMenu::SoundSet &soundSet, const char *domain, const char *key, const u8 * snd, u32 len, string name, bool isAllocated); + SmartGuiSound _sound(CMenu::SoundSet &soundSet, const char *domain, const char *key, string name); + u16 _textStyle(const char *domain, const char *key, u16 def); + u32 _addButton(SThemeData &theme, const char *domain, SFont font, const wstringEx &text, int x, int y, u32 width, u32 height, const CColor &color); + u32 _addPicButton(SThemeData &theme, const char *domain, STexture &texNormal, STexture &texSelected, int x, int y, u32 width, u32 height); + u32 _addLabel(SThemeData &theme, const char *domain, SFont font, const wstringEx &text, int x, int y, u32 width, u32 height, const CColor &color, u16 style); + u32 _addLabel(SThemeData &theme, const char *domain, SFont font, const wstringEx &text, int x, int y, u32 width, u32 height, const CColor &color, u16 style, STexture &bg); + u32 _addProgressBar(SThemeData &theme, const char *domain, int x, int y, u32 width, u32 height); + void _setHideAnim(u32 id, const char *domain, int dx, int dy, float scaleX, float scaleY); + void _addUserLabels(CMenu::SThemeData &theme, u32 *ids, u32 size, const char *domain); + void _addUserLabels(CMenu::SThemeData &theme, u32 *ids, u32 start, u32 size, const char *domain); + // + const wstringEx _t(const char *key, const wchar_t *def = L"") { return m_loc.getWString(m_curLanguage, key, def); } + const wstringEx _fmt(const char *key, const wchar_t *def); + wstringEx _getNoticeTranslation(int sorting, wstringEx curLetter); + // + void _setThrdMsg(const wstringEx &msg, float progress); + int _coverDownloader(bool missingOnly); + static int _coverDownloaderAll(CMenu *m); + static int _coverDownloaderMissing(CMenu *m); + static bool _downloadProgress(void *obj, int size, int position); + static int _gametdbDownloader(CMenu *m); + int _gametdbDownloaderAsync(); + + static s32 _networkComplete(s32 result, void *usrData); + void _initAsyncNetwork(); + bool _isNetworkAvailable(); + int _initNetwork(); + void _deinitNetwork(); + static int GetCoverStatusAsync(CMenu *m); + void LoadView(void); + void _getGrabStatus(void); + static void _addDiscProgress(int status, int total, void *user_data); + static int _gameInstaller(void *obj); + wstringEx _optBoolToString(int b); + void _stopSounds(void); + // + static u32 _downloadCheatFileAsync(void *obj); + // + void _playGameSound(void); + void CheckGameSoundThread(bool force = false); + void CheckThreads(bool force = false); + static void _gameSoundThread(CMenu *m); + // + static void _load_installed_cioses(); + // + struct SOption { const char id[10]; const wchar_t text[16]; }; + static const string _translations[23]; + static const SOption _languages[11]; + static const SOption _videoModes[7]; + static const SOption _vidModePatch[4]; + static const SOption _hooktype[8]; + static const SOption _exitTo[5]; + static std::map _installed_cios; + typedef std::map::iterator CIOSItr; + static int _version[9]; + static const SCFParamDesc _cfParams[]; + static const int _nbCfgPages; +}; + +#define ARRAY_SIZE(a) (sizeof a / sizeof a[0]) + +#endif // !defined(__MENU_HPP) diff --git a/source/menu/menu_about.cpp b/source/menu/menu_about.cpp new file mode 100644 index 00000000..76dc946d --- /dev/null +++ b/source/menu/menu_about.cpp @@ -0,0 +1,159 @@ + +#include "menu.hpp" +#include "nand.hpp" +#include "svnrev.h" + +#include "sys.h" +#include "alt_ios.h" +#include "defines.h" +#include "cios.hpp" + +const int pixels_to_skip = 10; + +void CMenu::_about(void) +{ + int amount_of_skips = 0; + int thanks_x = 0, thanks_y = 0; + u32 thanks_w = 0, thanks_h = 0; + bool first = true; + + m_btnMgr.reset(m_aboutLblInfo, true); + + SetupInput(); + _showAbout(); + + do + { + _mainLoopCommon(); + + if (amount_of_skips == 0) + { + // Check dimensions in the loop, because the animation can have an effect + m_btnMgr.getDimensions(m_aboutLblInfo, thanks_x, thanks_y, thanks_w, thanks_h); // Get original dimensions + } + if(first) + { + m_btnMgr.moveBy(m_aboutLblInfo, 0, -(pixels_to_skip * 10)); + amount_of_skips++; + first = false; + } + + if ((BTN_DOWN_PRESSED || BTN_DOWN_HELD) && !(m_thrdWorking && m_thrdStop)) + { + if (thanks_h - (amount_of_skips * pixels_to_skip) > (m_vid.height2D() - (35 + thanks_y))) + { + m_btnMgr.moveBy(m_aboutLblInfo, 0, -pixels_to_skip); + amount_of_skips++; + } + } + else if ((BTN_UP_PRESSED || BTN_UP_HELD) && !(m_thrdWorking && m_thrdStop)) + { + if (amount_of_skips > 1) + { + m_btnMgr.moveBy(m_aboutLblInfo, 0, pixels_to_skip); + amount_of_skips--; + } + } + else if (BTN_HOME_PRESSED || BTN_B_PRESSED) + break; + else if (BTN_A_PRESSED && !(m_thrdWorking && m_thrdStop)) + { + if (!m_locked && m_btnMgr.selected(m_aboutBtnSystem)) + { + // show system menu + m_cf.stopCoverLoader(true); + _hideAbout(false); + _system(); + remove(m_ver.c_str()); + if(m_exit) + { + _launchHomebrew(m_dol.c_str(), m_homebrewArgs); + break; + } + _showAbout(); + m_cf.startCoverLoader(); + } + } + } while (true); + _hideAbout(false); +} + +void CMenu::_hideAbout(bool instant) +{ + m_btnMgr.hide(m_aboutLblTitle, instant); + m_btnMgr.hide(m_aboutLblIOS, instant); + m_btnMgr.hide(m_aboutLblInfo, instant); + m_btnMgr.hide(m_aboutBtnSystem, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_aboutLblUser); ++i) + if (m_aboutLblUser[i] != -1u) + m_btnMgr.hide(m_aboutLblUser[i], instant); +} + +void CMenu::_showAbout(void) +{ + _setBg(m_aboutBg, m_aboutBg); + m_btnMgr.show(m_aboutLblTitle); + m_btnMgr.show(m_aboutLblIOS); + m_btnMgr.show(m_aboutLblInfo); + m_btnMgr.show(m_aboutBtnSystem); + for (u32 i = 0; i < ARRAY_SIZE(m_aboutLblUser); ++i) + if (m_aboutLblUser[i] != -1u) + m_btnMgr.show(m_aboutLblUser[i]); +} + +void CMenu::_initAboutMenu(CMenu::SThemeData &theme) +{ + STexture emptyTex; + _addUserLabels(theme, m_aboutLblUser, ARRAY_SIZE(m_aboutLblUser), "ABOUT"); + m_aboutBg = _texture(theme.texSet, "ABOUT/BG", "texture", theme.bg); + m_aboutLblTitle = _addLabel(theme, "ABOUT/TITLE", theme.titleFont, L"", 170, 25, 300, 75, theme.titleFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, emptyTex); + m_aboutLblInfo = _addLabel(theme, "ABOUT/INFO", theme.txtFont, L"", 40, 220, 560, 260, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP, emptyTex); + m_aboutBtnSystem = _addButton(theme, "ABOUT/SYSTEM_BTN", theme.btnFont, L"", 20, 410, 200, 56, theme.btnFontColor); + m_aboutLblIOS = _addLabel(theme, "ABOUT/IOS", theme.txtFont, L"", 240, 400, 360, 56, theme.txtFontColor, FTGX_JUSTIFY_RIGHT | FTGX_ALIGN_MIDDLE); + // + _setHideAnim(m_aboutLblTitle, "ABOUT/TITLE", 0, 100, 0.f, 0.f); + _setHideAnim(m_aboutLblInfo, "ABOUT/INFO", 0, -100, 0.f, 0.f); + _setHideAnim(m_aboutBtnSystem, "ABOUT/SYSTEM_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_aboutLblIOS, "ABOUT/IOS", 0, 100, 0.f, 0.f); + // + _hideAbout(true); + _textAbout(); +} + +void CMenu::_textAbout(void) +{ + m_btnMgr.setText(m_aboutBtnSystem, _t("sys4", L"Update")); + m_btnMgr.setText(m_aboutLblTitle, wfmt(_fmt("appname", L"%s v%s r%s"), APP_NAME, APP_VERSION, SVN_REV), false); + + wstringEx developers(wfmt(_fmt("about6", L"Current Developers:\n%s"), DEVELOPERS)); + wstringEx pDevelopers(wfmt(_fmt("about7", L"Past Developers:\n%s"), PAST_DEVELOPERS)); + + wstringEx origLoader(wfmt(_fmt("about1", L"Original Loader By:\n%s"), LOADER_AUTHOR)); + wstringEx origGUI(wfmt(_fmt("about2", L"Original GUI By:\n%s"), GUI_AUTHOR)); + + wstringEx codethx(wfmt(_fmt("about8", L"Bits of Code Obtained From:\n%s"), THANKS_CODE)); + wstringEx sites(wfmt(_fmt("about9", L"Supporting Websites:\n%s"), THANKS_SITES)); + + wstringEx translator(wfmt(L", %s", m_loc.getWString(m_curLanguage, "translation_author").toUTF8().c_str())); + wstringEx thanks(wfmt(_fmt("about4", L"Thanks To:\n%s"), THANKS)); + if(translator.size() > 3) thanks.append(translator); + + m_btnMgr.setText(m_aboutLblInfo, + wfmt(_fmt("about5", L"%s\n\n%s\n\n%s\n\n%s\n\n%s\n\n%s\n\n%s"), + developers.toUTF8().c_str(), + pDevelopers.toUTF8().c_str(), + origLoader.toUTF8().c_str(), + origGUI.toUTF8().c_str(), + codethx.toUTF8().c_str(), + sites.toUTF8().c_str(), + thanks.toUTF8().c_str()), + false + ); + + Nand::Instance()->Disable_Emu(); + iosinfo_t * iosInfo = cIOSInfo::GetInfo(mainIOS); + if(iosInfo != NULL) + m_btnMgr.setText(m_aboutLblIOS, wfmt(_fmt("ios", L"IOS%i base %i v%i"), mainIOS, iosInfo->baseios, iosInfo->version), true); + SAFE_FREE(iosInfo); + Nand::Instance()->Enable_Emu(); +} diff --git a/source/menu/menu_categories.cpp b/source/menu/menu_categories.cpp new file mode 100644 index 00000000..ad18b719 --- /dev/null +++ b/source/menu/menu_categories.cpp @@ -0,0 +1,101 @@ +#include "menu.hpp" + +#include +#include + +void CMenu::_CategorySettings() +{ + SetupInput(); + bool exitloop = false; + _showCategorySettings(); + while (true) + { + _mainLoopCommon(); + if (BTN_HOME_PRESSED || BTN_B_PRESSED) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_categoryBtnBack)) + break; + for (int i = 0; i < 12; ++i) + { + if (m_btnMgr.selected(m_categoryBtn[i])) + { + // handling code for clicked favorite + m_category = i; + m_cat.setInt("GENERAL", "category", i); + exitloop = true; + break; + } + } + } + if (exitloop == true) + break; + } + _hideCategorySettings(); +} + +void CMenu::_hideCategorySettings(bool instant) +{ + m_btnMgr.hide(m_categoryBtnBack,instant); + for (int i = 0; i < 12; ++i) + m_btnMgr.hide(m_categoryBtn[i],instant); + + for (u32 i = 0; i < ARRAY_SIZE(m_categoryLblUser); ++i) + if (m_categoryLblUser[i] != -1u) + m_btnMgr.hide(m_categoryLblUser[i], instant); +} + +void CMenu::_showCategorySettings(void) +{ + _setBg(m_categoryBg, m_categoryBg); + + m_btnMgr.show(m_categoryBtnBack); + for (int i = 0; i < m_max_categories+1; ++i) + m_btnMgr.show(m_categoryBtn[i]); + + for (u32 i = 0; i < ARRAY_SIZE(m_categoryLblUser); ++i) + if (m_categoryLblUser[i] != -1u) + m_btnMgr.show(m_categoryLblUser[i]); +} + + +void CMenu::_initCategorySettingsMenu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_categoryLblUser, ARRAY_SIZE(m_categoryLblUser), "CATEGORY"); + m_categoryBg = _texture(theme.texSet, "CATEGORY/BG", "texture", theme.bg); + m_categoryBtnBack = _addButton(theme, "CATEGORY/BACK_BTN", theme.btnFont, L"", 420, 410, 200, 56, theme.btnFontColor); + m_categoryBtn[0] = _addButton(theme, "CATEGORY/ALL_BTN", theme.btnFont, L"", 60, 40, 200, 50, theme.btnFontColor); + m_categoryBtn[1] = _addButton(theme, "CATEGORY/1_BTN", theme.btnFont, L"", 340, 40, 200, 50, theme.btnFontColor); + m_categoryBtn[2] = _addButton(theme, "CATEGORY/2_BTN", theme.btnFont, L"", 60, 100, 200, 50, theme.btnFontColor); + m_categoryBtn[3] = _addButton(theme, "CATEGORY/3_BTN", theme.btnFont, L"", 340, 100, 200, 50, theme.btnFontColor); + m_categoryBtn[4] = _addButton(theme, "CATEGORY/4_BTN", theme.btnFont, L"", 60, 160, 200, 50, theme.btnFontColor); + m_categoryBtn[5] = _addButton(theme, "CATEGORY/5_BTN", theme.btnFont, L"", 340, 160, 200, 50, theme.btnFontColor); + m_categoryBtn[6] = _addButton(theme, "CATEGORY/6_BTN", theme.btnFont, L"", 60, 220, 200, 50, theme.btnFontColor); + m_categoryBtn[7] = _addButton(theme, "CATEGORY/7_BTN", theme.btnFont, L"", 340, 220, 200, 50, theme.btnFontColor); + m_categoryBtn[8] = _addButton(theme, "CATEGORY/8_BTN", theme.btnFont, L"", 60, 280, 200, 50, theme.btnFontColor); + m_categoryBtn[9] = _addButton(theme, "CATEGORY/9_BTN", theme.btnFont, L"", 340, 280, 200, 50, theme.btnFontColor); + m_categoryBtn[10] = _addButton(theme, "CATEGORY/10_BTN", theme.btnFont, L"", 60, 340, 200, 50, theme.btnFontColor); + m_categoryBtn[11] = _addButton(theme, "CATEGORY/11_BTN", theme.btnFont, L"",340, 340, 200, 50, theme.btnFontColor); + + _setHideAnim(m_categoryBtnBack, "CATEGORY/BACK_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_categoryBtn[0], "CATEGORY/ALL_BTN", 0, 0, 0.f, 0.f); + for (int i = 1; i < 12; ++i) + _setHideAnim(m_categoryBtn[i], sfmt("CATEGORY/%i_BTN", i).c_str(), 0, 0, 0.f, 0.f); + + _hideCategorySettings(true); + _textCategorySettings(); +} + +void CMenu::_textCategorySettings(void) +{ + m_btnMgr.setText(m_categoryBtnBack, _t("cd1", L"Back")); + m_btnMgr.setText(m_categoryBtn[0], _t("dl3", L"All")); + for (int i = 1; i < 12; i++) + m_btnMgr.setText(m_categoryBtn[i], m_cat.getWString("GENERAL", sfmt("cat%d",i).c_str(), wfmt(L"Category %i",i).c_str())); +} + diff --git a/source/menu/menu_cftheme.cpp b/source/menu/menu_cftheme.cpp new file mode 100644 index 00000000..328342de --- /dev/null +++ b/source/menu/menu_cftheme.cpp @@ -0,0 +1,584 @@ + +#include "menu.hpp" + + +using namespace std; + +const CMenu::SCFParamDesc CMenu::_cfParams[] = { + { { CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D }, + CMenu::SCFParamDesc::PDD_BOTH, true, "Camera", { "Position", "Aim", "Oscillation speed", "Oscillation scale" }, + { "camera_pos", "camera_aim", "camera_osc_speed", "camera_osc_amp" }, + { 0.05f, 0.05f, 0.05f, 0.05f }, + { { -15.f, 15.f }, { -15.f, 15.f }, { -15.f, 15.f }, { -15.f, 15.f } } }, + { { CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D }, + CMenu::SCFParamDesc::PDD_BOTH, true, "Cover Position", { "Left", "Center", "Right", "Row Center" }, + { "left_pos", "center_pos", "right_pos", "row_center_pos" }, + { 0.05f, 0.05f, 0.05f, 0.05f }, + { { -15.f, 15.f }, { -15.f, 15.f }, { -15.f, 15.f }, { -15.f, 15.f } } }, + { { CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D }, + CMenu::SCFParamDesc::PDD_BOTH, false, "Cover Angle", { "Left", "Center", "Right", "Row Center" }, + { "left_angle", "center_angle", "right_angle", "row_center_angle" }, + { 1.f, 1.f, 1.f, 1.f }, + { { -1080.f, 1080.f }, { -1080.f, 1080.f }, { -1080.f, 1080.f }, { -1080.f, 1080.f } } }, + { { CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D }, + CMenu::SCFParamDesc::PDD_BOTH, false, "Cover Spacer", { "Left", "Right", "Left Relative Angle", "Right Relative Angle" }, + { "left_spacer", "right_spacer", "left_delta_angle", "right_delta_angle" }, + { 0.05f, 0.05f, 1.f, 1.f }, + { { -10.f, 10.f }, { -10.f, 10.f }, { -1080.f, 1080.f }, { -1080.f, 1080.f } } }, + { { CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D }, + CMenu::SCFParamDesc::PDD_BOTH, false, "Cover Oscillation", { "Speed", "Angle", "Speed", "Scale" }, + { "cover_osc_speed", "cover_osc_amp", "cover_pos_osc_speed", "cover_pos_osc_amp" }, + { 0.25f, 0.25f, 0.05f, 0.05f }, + { { 0.f, 50.f }, { -90.f, 90.f }, { 0.f, 50.f }, { -4.f, 4.f } } }, + { { CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_EMPTY }, + CMenu::SCFParamDesc::PDD_BOTH, true, "Title Position", { "Left", "Center", "Right", "" }, + { "text_left_pos", "text_center_pos", "text_right_pos", "" }, + { 0.05f, 0.05f, 0.05f, 0.f }, + { { -15.f, 15.f }, { -15.f, 15.f }, { -15.f, 15.f }, { 0.f, 0.f } } }, + { { CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_EMPTY }, + CMenu::SCFParamDesc::PDD_BOTH, true, "Title Angle", { "Left", "Center", "Right", "" }, + { "text_left_angle", "text_center_angle", "text_right_angle", "" }, + { 1.f, 1.f, 1.f, 0.f }, + { { -1080.f, 1080.f }, { -1080.f, 1080.f }, { -1080.f, 1080.f }, { 0.f, 0.f } } }, + { { CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_TXTSTYLE, CMenu::SCFParamDesc::PDT_TXTSTYLE }, + CMenu::SCFParamDesc::PDD_BOTH, true, "Title Width", { "Center", "Side", "Center Style", "Side Style" }, + { "text_center_wrap_width", "text_side_wrap_width", "text_center_style", "text_side_style" }, + { 1.f, 1.f, 1.f, 1.f }, + { { 50.f, 3000.f }, { 50.f, 3000.f }, { 0.f, 8.f }, { 0.f, 8.f } } }, + { { CMenu::SCFParamDesc::PDT_INT, CMenu::SCFParamDesc::PDT_INT, CMenu::SCFParamDesc::PDT_EMPTY, CMenu::SCFParamDesc::PDT_EMPTY }, + CMenu::SCFParamDesc::PDD_NORMAL, true, "Dimensions", { "Rows", "Columns", "", "" }, + { "rows", "columns", "", "" }, + { 2.f, 2.f, 0.f, 0.f }, + { { 1.f, 9.f }, { 3.f, 21.f }, { 0.f, 0.f }, { 0.f, 0.f } } }, + { { CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_EMPTY, CMenu::SCFParamDesc::PDT_EMPTY }, + CMenu::SCFParamDesc::PDD_BOTH, false, "Row Angle", { "Top", "Bottom", "", "" }, + { "top_angle", "bottom_angle", "", "" }, + { 1.f, 1.f, 0.f, 0.f }, + { { -1080.f, 1080.f }, { -1080.f, 1080.f }, { 0.f, 0.f }, { 0.f, 0.f } } }, + { { CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D }, + CMenu::SCFParamDesc::PDD_BOTH, false, "Row Spacer", { "Top", "Bottom", "Top Relative Angle", "Bottom Relative Angle" }, + { "top_spacer", "bottom_spacer", "top_delta_angle", "bottom_delta_angle" }, + { 0.05f, 0.05f, 1.f, 1.f }, + { { -15.f, 15.f }, { -15.f, 15.f }, { -1080.f, 1080.f }, { -1080.f, 1080.f } } }, + { { CMenu::SCFParamDesc::PDT_COLOR, CMenu::SCFParamDesc::PDT_COLOR, CMenu::SCFParamDesc::PDT_COLOR, CMenu::SCFParamDesc::PDT_EMPTY }, + CMenu::SCFParamDesc::PDD_BOTH, false, "Colors", { "Inner", "Outer", "Pointer", "" }, + { "color_beg", "color_end", "color_off", "" }, + { 1.f, 1.f, 1.f, 0.f }, + { { 0.f, 255.f }, { 0.f, 255.f }, { 0.f, 255.f }, { 0.f, 0.f } } }, + { { CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_BOOL, CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_EMPTY }, + CMenu::SCFParamDesc::PDD_NORMAL, false, "Mirror Effect", { "Intensity", "Blur", "Title Intensity", "" }, + { "mirror_alpha", "mirror_blur", "title_mirror_alpha", "" }, + { 0.01f, 1.f, 0.01f, 0.f }, + { { 0.f, 1.f }, { 0.f, 1.f }, { 0.f, 1.f }, { 0.f, 0.f } } }, + { { CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_EMPTY }, + CMenu::SCFParamDesc::PDD_NORMAL, false, "Shadow", { "Scale", "X offset", "Y offset", "" }, + { "shadow_scale", "shadow_x" , "shadow_y", "" }, + { 0.01f, 0.125f, 0.125f, 0.f }, + { { 0.5f, 1.5f }, { -5.f, 5.f }, { -5.f, 5.f }, { 0.f, 0.f } } }, + { { CMenu::SCFParamDesc::PDT_COLOR, CMenu::SCFParamDesc::PDT_COLOR, CMenu::SCFParamDesc::PDT_COLOR, CMenu::SCFParamDesc::PDT_COLOR }, + CMenu::SCFParamDesc::PDD_BOTH, false, "Shadow Colors", { "Center", "Inner", "Outer", "Pointer" }, + { "color_shadow_center", "color_shadow_beg" , "color_shadow_end", "color_shadow_off" }, + { 1.f, 1.f, 1.f, 1.f }, + { { 0.f, 255.f }, { 0.f, 255.f }, { 0.f, 255.f }, { 0.f, 255.f } } }, + { { CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D }, + CMenu::SCFParamDesc::PDD_BOTH, false, "Cover Scale", { "Left", "Center", "Right", "Row Center" }, + { "left_scale", "center_scale" , "right_scale", "row_center_scale" }, + { 0.01f, 0.01f, 0.01f, 0.01f }, + { { 0.1f, 4.f }, { 0.1f, 4.f }, { 0.1f, 4.f }, { 0.1f, 4.f } } }, + { { CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_V3D, CMenu::SCFParamDesc::PDT_EMPTY }, + CMenu::SCFParamDesc::PDD_SELECTED, true, "Flipped Cover", { "Position", "Angle", "Scale", "" }, + { "flip_pos", "flip_angle" , "flip_scale", "" }, + { 0.05f, 1.f, 0.01f, 0.f }, + { { -15.f, 15.f }, { -1080.f, 1080.f }, { 0.1f, 4.f }, { 0.f, 0.f } } }, + { { CMenu::SCFParamDesc::PDT_INT, CMenu::SCFParamDesc::PDT_INT, CMenu::SCFParamDesc::PDT_INT, CMenu::SCFParamDesc::PDT_FLOAT }, + CMenu::SCFParamDesc::PDD_NORMAL, false, "Tweaks", { "Max FSAA", "Blur resolution", "Blur radius", "Blur factor" }, + { "max_fsaa", "blur_resolution" , "blur_radius", "blur_factor" }, + { 1.f, 1.f, 1.f, 0.1f }, + { { 2.f, 8.f }, { 0.f, 3.f }, { 1.f, 3.f }, { 1.f, 2.f } } }, + { { CMenu::SCFParamDesc::PDT_FLOAT, CMenu::SCFParamDesc::PDT_INT, CMenu::SCFParamDesc::PDT_BOOL, CMenu::SCFParamDesc::PDT_EMPTY }, + CMenu::SCFParamDesc::PDD_NORMAL, false, "Textures", { "LOD bias", "Anisotropy", "Edge LOD", "" }, + { "tex_lod_bias", "tex_aniso" , "tex_edge_lod", "" }, + { 0.1f, 1.f, 1.f, 0.f }, + { { -3.f, 0.5f }, { 0.f, 2.f }, { 0.f, 1.f }, { 0.f, 0.f } } } +}; + +static inline int loopNum(int i, int s) +{ + return i < 0 ? (s - (-i % s)) % s : i % s; +} + +static const u16 g_txtStyles[9] = { + FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP, + FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE, + FTGX_JUSTIFY_LEFT | FTGX_ALIGN_BOTTOM, + FTGX_JUSTIFY_CENTER | FTGX_ALIGN_TOP, + FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, + FTGX_JUSTIFY_CENTER | FTGX_ALIGN_BOTTOM, + FTGX_JUSTIFY_RIGHT | FTGX_ALIGN_TOP, + FTGX_JUSTIFY_RIGHT | FTGX_ALIGN_MIDDLE, + FTGX_JUSTIFY_RIGHT | FTGX_ALIGN_BOTTOM +}; + +static int styleToIdx(u16 s) +{ + for (int i = 0; i < 9; ++i) + if (g_txtStyles[i] == s) + return i; + return 0; +} + +static string styleToTxt(u16 s) +{ + string ts; + if ((s & FTGX_JUSTIFY_CENTER) != 0) + ts += 'C'; + else if ((s & FTGX_JUSTIFY_RIGHT) != 0) + ts += 'R'; + else + ts += 'L'; + if ((s & FTGX_ALIGN_MIDDLE) != 0) + ts += 'M'; + else if ((s & FTGX_ALIGN_BOTTOM) != 0) + ts += 'B'; + else + ts += 'T'; + return ts; +} + +template static inline T loopNum(T i, T s) +{ + return (i + s) % s; +} + +void CMenu::_hideCFTheme(bool instant) +{ + m_btnMgr.hide(m_cfThemeBtnAlt, instant); + m_btnMgr.hide(m_cfThemeBtnSelect, instant); + m_btnMgr.hide(m_cfThemeBtnWide, instant); + m_btnMgr.hide(m_cfThemeLblParam, instant); + m_btnMgr.hide(m_cfThemeBtnParamM, instant); + m_btnMgr.hide(m_cfThemeBtnParamP, instant); + m_btnMgr.hide(m_cfThemeBtnSave, instant); + m_btnMgr.hide(m_cfThemeBtnCancel, instant); + // + for (int i = 0; i < 16; ++i) + { + m_btnMgr.hide(m_cfThemeLblVal[i], instant); + m_btnMgr.hide(m_cfThemeBtnValM[i], instant); + m_btnMgr.hide(m_cfThemeBtnValP[i], instant); + } + for (int i = 0; i < 4; ++i) + m_btnMgr.hide(m_cfThemeLblValTxt[i], instant); +} + +void CMenu::_showCFTheme(u32 curParam, int version, bool wide) +{ + const CMenu::SCFParamDesc &p = CMenu::_cfParams[curParam]; + bool selected = m_cf.selected(); + string domUnsel(sfmt("_COVERFLOW_%i", version).c_str()); + string domSel(sfmt("_COVERFLOW_%i_S", version).c_str()); + + m_cf.simulateOtherScreenFormat(p.scrnFmt && wide != m_vid.wide()); + _setBg(m_mainBg, m_mainBgLQ); + m_btnMgr.show(m_cfThemeBtnSave); + m_btnMgr.show(m_cfThemeBtnCancel); + m_btnMgr.show(m_cfThemeBtnAlt); + m_btnMgr.setText(m_cfThemeBtnAlt, wstringEx(sfmt("%i", version))); +// if (p.domain == CMenu::SCFParamDesc::PDD_BOTH) + m_btnMgr.show(m_cfThemeBtnSelect); +// else +// m_btnMgr.hide(m_cfThemeBtnSelect); + m_btnMgr.setText(m_cfThemeBtnSelect, selected ? L"X" : L""); + if (p.scrnFmt) + m_btnMgr.show(m_cfThemeBtnWide); + else + m_btnMgr.hide(m_cfThemeBtnWide); + m_btnMgr.setText(m_cfThemeBtnWide, wide ? L"16:9" : L"4:3"); + m_btnMgr.show(m_cfThemeLblParam); + m_btnMgr.show(m_cfThemeBtnParamM); + m_btnMgr.show(m_cfThemeBtnParamP); + m_btnMgr.setText(m_cfThemeLblParam, string(p.name)); + // + for (int i = 0; i < 4; ++i) + { + string domain = (p.domain != CMenu::SCFParamDesc::PDD_NORMAL && selected) || p.domain == CMenu::SCFParamDesc::PDD_SELECTED + ? domSel : domUnsel; + int k = i * 4; + string key(p.key[i]); + if (!wide && p.scrnFmt && (p.paramType[i] == CMenu::SCFParamDesc::PDT_V3D || p.paramType[i] == CMenu::SCFParamDesc::PDT_FLOAT || p.paramType[i] == CMenu::SCFParamDesc::PDT_INT)) + key += "_4_3"; + if (p.paramType[i] != CMenu::SCFParamDesc::PDT_EMPTY) + { + m_btnMgr.show(m_cfThemeLblValTxt[i]); + m_btnMgr.setText(m_cfThemeLblValTxt[i], string(p.valName[i])); + } + else + m_btnMgr.hide(m_cfThemeLblValTxt[i]); + switch (p.paramType[i]) + { + case CMenu::SCFParamDesc::PDT_EMPTY: + for (int j = 0; j < 4; ++j) + { + m_btnMgr.hide(m_cfThemeLblVal[k + j]); + m_btnMgr.hide(m_cfThemeBtnValM[k + j]); + m_btnMgr.hide(m_cfThemeBtnValP[k + j]); + } + break; + case CMenu::SCFParamDesc::PDT_FLOAT: + m_btnMgr.setText(m_cfThemeLblVal[k], sfmt("%.2f", m_theme.getFloat(domain, key))); + for (int j = 1; j < 4; ++j) + { + m_btnMgr.hide(m_cfThemeLblVal[k + j]); + m_btnMgr.hide(m_cfThemeBtnValM[k + j]); + m_btnMgr.hide(m_cfThemeBtnValP[k + j]); + } + m_btnMgr.show(m_cfThemeLblVal[k]); + m_btnMgr.show(m_cfThemeBtnValM[k]); + m_btnMgr.show(m_cfThemeBtnValP[k]); + break; + case CMenu::SCFParamDesc::PDT_V3D: + { + Vector3D v(m_theme.getVector3D(domain, key)); + m_btnMgr.setText(m_cfThemeLblVal[k + 0], sfmt("%.2f", v.x)); + m_btnMgr.setText(m_cfThemeLblVal[k + 1], sfmt("%.2f", v.y)); + m_btnMgr.setText(m_cfThemeLblVal[k + 2], sfmt("%.2f", v.z)); + for (int j = 0; j < 3; ++j) + { + m_btnMgr.show(m_cfThemeLblVal[k + j]); + m_btnMgr.show(m_cfThemeBtnValM[k + j]); + m_btnMgr.show(m_cfThemeBtnValP[k + j]); + } + m_btnMgr.hide(m_cfThemeLblVal[k + 3]); + m_btnMgr.hide(m_cfThemeBtnValM[k + 3]); + m_btnMgr.hide(m_cfThemeBtnValP[k + 3]); + break; + } + case CMenu::SCFParamDesc::PDT_COLOR: + { + CColor color(m_theme.getColor(domain, key)); + m_btnMgr.setText(m_cfThemeLblVal[k + 0], sfmt("%02X", color.r)); + m_btnMgr.setText(m_cfThemeLblVal[k + 1], sfmt("%02X", color.g)); + m_btnMgr.setText(m_cfThemeLblVal[k + 2], sfmt("%02X", color.b)); + m_btnMgr.setText(m_cfThemeLblVal[k + 3], sfmt("%02X", color.a)); + for (int j = 0; j < 4; ++j) + { + m_btnMgr.show(m_cfThemeLblVal[k + j]); + m_btnMgr.show(m_cfThemeBtnValM[k + j]); + m_btnMgr.show(m_cfThemeBtnValP[k + j]); + } + break; + } + case CMenu::SCFParamDesc::PDT_BOOL: + m_btnMgr.setText(m_cfThemeLblVal[k], m_theme.getBool(domain, key) ? L"On" : L"Off"); + for (int j = 1; j < 4; ++j) + { + m_btnMgr.hide(m_cfThemeLblVal[k + j]); + m_btnMgr.hide(m_cfThemeBtnValM[k + j]); + m_btnMgr.hide(m_cfThemeBtnValP[k + j]); + } + m_btnMgr.show(m_cfThemeLblVal[k]); + m_btnMgr.show(m_cfThemeBtnValM[k]); + m_btnMgr.show(m_cfThemeBtnValP[k]); + break; + case CMenu::SCFParamDesc::PDT_INT: + m_btnMgr.setText(m_cfThemeLblVal[k], sfmt("%i", m_theme.getInt(domain, key))); + for (int j = 1; j < 4; ++j) + { + m_btnMgr.hide(m_cfThemeLblVal[k + j]); + m_btnMgr.hide(m_cfThemeBtnValM[k + j]); + m_btnMgr.hide(m_cfThemeBtnValP[k + j]); + } + m_btnMgr.show(m_cfThemeLblVal[k]); + m_btnMgr.show(m_cfThemeBtnValM[k]); + m_btnMgr.show(m_cfThemeBtnValP[k]); + break; + case CMenu::SCFParamDesc::PDT_TXTSTYLE: + m_btnMgr.setText(m_cfThemeLblVal[k], styleToTxt(_textStyle(domain.c_str(), key.c_str(), m_cf.selected() ? FTGX_JUSTIFY_RIGHT | FTGX_ALIGN_TOP : FTGX_JUSTIFY_CENTER | FTGX_ALIGN_BOTTOM))); + for (int j = 1; j < 4; ++j) + { + m_btnMgr.hide(m_cfThemeLblVal[k + j]); + m_btnMgr.hide(m_cfThemeBtnValM[k + j]); + m_btnMgr.hide(m_cfThemeBtnValP[k + j]); + } + m_btnMgr.show(m_cfThemeLblVal[k]); + m_btnMgr.show(m_cfThemeBtnValM[k]); + m_btnMgr.show(m_cfThemeBtnValP[k]); + break; + } + } +} + +void CMenu::_cfTheme(void) +{ + u32 curParam = 0; + int cfVersion = 1; + bool wide = m_vid.wide(); + int copyVersion = 0; + bool copySelected = false; + bool copyWide = wide; + + SetupInput(); + _initCF(); + _showCFTheme(curParam, cfVersion, wide); + _loadCFLayout(cfVersion, true, wide != m_vid.wide()); + m_cf.applySettings(); + while (true) + { + _mainLoopCommon(true, false, curParam == 5 || curParam == 6 || curParam == 7); + if (BTN_HOME_PRESSED) + { + m_theme.clear(); + m_theme.unload(); + m_theme.load(sfmt("%s/%s.ini", m_themeDir.c_str(), m_cfg.getString("GENERAL", "theme", "defaut").c_str()).c_str()); + break; + } + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if (BTN_B_HELD && BTN_1_PRESSED) + { + copyVersion = cfVersion; + copySelected = m_cf.selected(); + copyWide = wide; + } + else if (copyVersion > 0 && BTN_B_HELD && BTN_2_PRESSED) + { + string domSrc(sfmt(copySelected ? "_COVERFLOW_%i_S" : "_COVERFLOW_%i", copyVersion)); + string domDst(sfmt(m_cf.selected() ? "_COVERFLOW_%i_S" : "_COVERFLOW_%i", cfVersion)); + if (copyVersion != cfVersion || copySelected != m_cf.selected()) + m_theme.copyDomain(domDst, domSrc); + else if (copyWide != wide) + for (u32 i = 0; i < ARRAY_SIZE(CMenu::_cfParams); ++i) + { + const CMenu::SCFParamDesc &p = CMenu::_cfParams[i]; + if (p.scrnFmt) + for (int k = 0; k < 4; ++k) + { + string keySrc(p.key[k]); + string keyDst(p.key[k]); + if (wide) + keySrc += "_4_3"; + else + keyDst += "_4_3"; + if (p.paramType[k] == CMenu::SCFParamDesc::PDT_FLOAT) + m_theme.setFloat(domDst, keyDst, m_theme.getFloat(domSrc, keySrc)); + else if (p.paramType[k] == CMenu::SCFParamDesc::PDT_V3D) + m_theme.setVector3D(domDst, keyDst, m_theme.getVector3D(domSrc, keySrc)); + else if (p.paramType[k] == CMenu::SCFParamDesc::PDT_INT) + m_theme.setInt(domDst, keyDst, m_theme.getInt(domSrc, keySrc)); + } + } + _showCFTheme(curParam, cfVersion, wide); + _loadCFLayout(cfVersion, true, wide != m_vid.wide()); + m_cf.applySettings(); + } + bool sel = m_cf.selected(); + if (BTN_B_HELD) + { + if (BTN_PLUS_PRESSED || BTN_MINUS_PRESSED) + { + s8 direction = BTN_PLUS_PRESSED ? 1 : -1; + curParam = loopNum(curParam + direction, ARRAY_SIZE(CMenu::_cfParams)); + if (CMenu::_cfParams[curParam].domain == CMenu::SCFParamDesc::PDD_SELECTED) + m_cf.select(); + _showCFTheme(curParam, cfVersion, wide); + } + } + else if (!sel) + { + if (BTN_PLUS_PRESSED) + m_cf.pageDown(); + else if (BTN_MINUS_PRESSED) + m_cf.pageUp(); + } + if (BTN_LEFT_REPEAT) + m_cf.left(); + else if (BTN_RIGHT_REPEAT) + m_cf.right(); + if (sel && !m_cf.selected()) + m_cf.select(); + if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_cfThemeBtnSave)) + { + m_cf.stopCoverLoader(); + m_theme.save(); + break; + } + else if (m_btnMgr.selected(m_cfThemeBtnCancel)) + { + m_theme.clear(); + m_theme.unload(); + m_theme.load(sfmt("%s/%s.ini", m_themeDir.c_str(), m_cfg.getString("GENERAL", "theme", "defaut").c_str()).c_str()); + break; + } + else if (m_btnMgr.selected(m_cfThemeBtnAlt)) + { + cfVersion = 1 + loopNum(cfVersion, m_numCFVersions); + _showCFTheme(curParam, cfVersion, wide); + _loadCFLayout(cfVersion, true, wide != m_vid.wide()); + m_cf.applySettings(); + } + else if (m_btnMgr.selected(m_cfThemeBtnSelect)) + { + if (m_cf.selected()) + m_cf.cancel(); + else + m_cf.select(); + _showCFTheme(curParam, cfVersion, wide); + _loadCFLayout(cfVersion, true, wide != m_vid.wide()); + m_cf.applySettings(); + } + else if (m_btnMgr.selected(m_cfThemeBtnWide)) + { + wide = !wide; + _showCFTheme(curParam, cfVersion, wide); + _loadCFLayout(cfVersion, true, wide != m_vid.wide()); + m_cf.applySettings(); + } + else if (m_btnMgr.selected(m_cfThemeBtnParamP) || m_btnMgr.selected(m_cfThemeBtnParamM)) + { + s8 direction = m_btnMgr.selected(m_cfThemeBtnParamP) ? 1 : -1; + curParam = loopNum(curParam + direction, ARRAY_SIZE(CMenu::_cfParams)); + if (CMenu::_cfParams[curParam].domain == CMenu::SCFParamDesc::PDD_SELECTED) + m_cf.select(); + _showCFTheme(curParam, cfVersion, wide); + } + } + if (BTN_A_REPEAT || BTN_A_PRESSED) + { + for (int i = 0; i < 16; ++i) + if (m_btnMgr.selected(m_cfThemeBtnValM[i]) || m_btnMgr.selected(m_cfThemeBtnValP[i])) + { + _cfParam(m_btnMgr.selected(m_cfThemeBtnValP[i]), i, CMenu::_cfParams[curParam], cfVersion, wide); + _showCFTheme(curParam, cfVersion, wide); + _loadCFLayout(cfVersion, true, wide != m_vid.wide()); + m_cf.applySettings(); + break; + } + } + if (WPadIR_Valid(0) || WPadIR_Valid(1) || WPadIR_Valid(2) || WPadIR_Valid(3)) + _showCFTheme(curParam, cfVersion, wide); + else + _hideCFTheme(); + m_cf.flip(true, curParam == 16); + } + _hideCFTheme(); + _loadCFLayout(1); + m_cf.clear(); + m_cf.simulateOtherScreenFormat(false); +} + +void CMenu::_cfParam(bool inc, int i, const CMenu::SCFParamDesc &p, int cfVersion, bool wide) +{ + int k = i / 4; + string key(p.key[k]); + const char *d = (p.domain != CMenu::SCFParamDesc::PDD_NORMAL && m_cf.selected()) || p.domain == CMenu::SCFParamDesc::PDD_SELECTED + ? "_COVERFLOW_%i_S" : "_COVERFLOW_%i"; + string domain(sfmt(d, cfVersion)); + float step = p.step[k]; + if (!wide && p.scrnFmt && (p.paramType[k] == CMenu::SCFParamDesc::PDT_V3D || p.paramType[k] == CMenu::SCFParamDesc::PDT_FLOAT || p.paramType[k] == CMenu::SCFParamDesc::PDT_INT)) + key += "_4_3"; + if (!inc) + step = -step; + switch (p.paramType[k]) + { + case CMenu::SCFParamDesc::PDT_EMPTY: + break; + case CMenu::SCFParamDesc::PDT_FLOAT: + { + float val = m_theme.getFloat(domain, key); + m_theme.setFloat(domain, key, min(max(p.minMaxVal[k][0], val + step), p.minMaxVal[k][1])); + break; + } + case CMenu::SCFParamDesc::PDT_V3D: + { + Vector3D v(m_theme.getVector3D(domain, key)); + switch (i % 4) + { + case 0: + v.x = min(max(p.minMaxVal[k][0], v.x + step), p.minMaxVal[k][1]); + break; + case 1: + v.y = min(max(p.minMaxVal[k][0], v.y + step), p.minMaxVal[k][1]); + break; + case 2: + v.z = min(max(p.minMaxVal[k][0], v.z + step), p.minMaxVal[k][1]); + break; + } + m_theme.setVector3D(domain, key, v); + break; + } + case CMenu::SCFParamDesc::PDT_COLOR: + { + CColor color(m_theme.getColor(domain, key)); + switch (i % 4) + { + case 0: + color.r = min(max(0, color.r + (int)step), 0xFF); + break; + case 1: + color.g = min(max(0, color.g + (int)step), 0xFF); + break; + case 2: + color.b = min(max(0, color.b + (int)step), 0xFF); + break; + case 3: + color.a = min(max(0, color.a + (int)step), 0xFF); + break; + } + m_theme.setColor(domain, key, color); + break; + } + case CMenu::SCFParamDesc::PDT_BOOL: + { + m_theme.setBool(domain, key, !m_theme.getBool(domain, key)); + break; + } + case CMenu::SCFParamDesc::PDT_INT: + { + int val = m_theme.getInt(domain, key); + m_theme.setInt(domain, key, min(max((int)p.minMaxVal[k][0], val + (int)step), (int)p.minMaxVal[k][1])); + break; + } + case CMenu::SCFParamDesc::PDT_TXTSTYLE: + { + int i = styleToIdx(_textStyle(domain.c_str(), key.c_str(), m_cf.selected() ? FTGX_JUSTIFY_RIGHT | FTGX_ALIGN_TOP : FTGX_JUSTIFY_CENTER | FTGX_ALIGN_BOTTOM)); + i = loopNum(i + (int)step, 9); + m_theme.setString(domain, key, styleToTxt(g_txtStyles[i])); + break; + } + } +} + +void CMenu::_initCFThemeMenu(CMenu::SThemeData &theme) +{ + STexture emptyTex; + string domain; + int x; + int y; + + m_cfThemeBtnAlt = _addButton(theme, "CFTHEME/ALT_BTN", theme.btnFont, L"", 20, 20, 60, 30, theme.btnFontColor); + m_cfThemeBtnSelect = _addButton(theme, "CFTHEME/SELECT_BTN", theme.btnFont, L"", 80, 20, 60, 30, theme.btnFontColor); + m_cfThemeBtnWide = _addButton(theme, "CFTHEME/WIDE_BTN", theme.btnFont, L"", 20, 60, 60, 30, theme.btnFontColor); + m_cfThemeLblParam = _addLabel(theme, "CFTHEME/PARAM_BTN", theme.btnFont, L"", 176, 20, 300, 36, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_cfThemeBtnParamM = _addPicButton(theme, "CFTHEME/PARAM_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 140, 20, 36, 36); + m_cfThemeBtnParamP = _addPicButton(theme, "CFTHEME/PARAM_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 476, 20, 36, 36); + m_cfThemeBtnSave = _addButton(theme, "CFTHEME/SAVE_BTN", theme.btnFont, L"Save", 530, 20, 80, 40, theme.btnFontColor); + m_cfThemeBtnCancel = _addButton(theme, "CFTHEME/CANCEL_BTN", theme.btnFont, L"Cancel", 530, 70, 80, 40, theme.btnFontColor); + // + for (int i = 0; i < 16; ++i) + { + domain = sfmt("CFTHEME/VAL%i%c_%%s", i / 3 + 1, (char)(i % 3) + 'A'); + x = 20 + (i / 4) * 150; + y = 340 + (i % 4) * 32; + m_cfThemeLblVal[i] = _addLabel(theme, sfmt(domain.c_str(), "BTN").c_str(), theme.btnFont, L"", x + 32, y, 86, 32, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_cfThemeBtnValM[i] = _addPicButton(theme, sfmt(domain.c_str(), "MINUS").c_str(), theme.btnTexMinus, theme.btnTexMinusS, x, y, 32, 32); + m_cfThemeBtnValP[i] = _addPicButton(theme, sfmt(domain.c_str(), "PLUS").c_str(), theme.btnTexPlus, theme.btnTexPlusS, x + 118, y, 32, 32); + } + for (int i = 0; i < 4; ++i) + m_cfThemeLblValTxt[i] = _addLabel(theme, sfmt("CFTHEME/VAL%i_LBL", i + 1).c_str(), theme.lblFont, L"", 20 + i * 150, 100, 150, 240, theme.lblFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_BOTTOM, emptyTex); + _hideCFTheme(true); +} + diff --git a/source/menu/menu_cheat.cpp b/source/menu/menu_cheat.cpp new file mode 100644 index 00000000..5ef3232c --- /dev/null +++ b/source/menu/menu_cheat.cpp @@ -0,0 +1,373 @@ +#include +#include + +#include "text.hpp" +#include "lockMutex.hpp" + +#include "menu.hpp" +#include "http.h" +#include "sys.h" + +#define GECKOURL "http://geckocodes.org/codes/%c/%s.txt" +#define CHEATSPERPAGE 4 + +void CMenu::_hideCheatDownload(bool instant) +{ + m_btnMgr.hide(m_downloadBtnCancel, instant); + m_btnMgr.hide(m_downloadPBar, instant); + m_btnMgr.hide(m_downloadLblMessage[0], 0, 0, -2.f, 0.f, instant); + m_btnMgr.hide(m_downloadLblMessage[1], 0, 0, -2.f, 0.f, instant); +} + +void CMenu::_showCheatDownload(void) +{ + _setBg(m_downloadBg, m_downloadBg); + m_btnMgr.show(m_downloadBtnCancel); + m_btnMgr.show(m_downloadPBar); +} + +u32 CMenu::_downloadCheatFileAsync(void *obj) +{ + CMenu *m = (CMenu *)obj; + if (!m->m_thrdWorking) return 0; + + m->m_thrdStop = false; + + LWP_MutexLock(m->m_mutex); + m->_setThrdMsg(m->_t("cfgg23", L"Downloading cheat file..."), 0); + LWP_MutexUnlock(m->m_mutex); + + if (m->_initNetwork() < 0) + { + m->m_thrdWorking = false; + return -1; + } + + u32 bufferSize = 0x080000; // Maximum download size 512kb + SmartBuf buffer = smartAnyAlloc(bufferSize); + if (!buffer) + { + m->m_thrdWorking = false; + return -2; + } + + string id = m->m_cf.getId(); + char type = id[0] == 'S' ? 'R' : id[0]; + + block cheatfile = downloadfile(buffer.get(), bufferSize, sfmt(GECKOURL, type, id.c_str()).c_str(),CMenu::_downloadProgress, m); + + if (cheatfile.data != NULL && cheatfile.size > 65 && cheatfile.data[0] != '<') + { + FILE *file = fopen(fmt("%s/%s.txt", m->m_txtCheatDir.c_str(), id.c_str()), "wb"); + + if (file != NULL) + { + fwrite(cheatfile.data, 1, cheatfile.size, file); + SAFE_CLOSE(file); + m->m_thrdWorking = false; + return 0; + } + } + + m->m_thrdWorking = false; + return -3; +} + +void CMenu::_CheatSettings() +{ + SetupInput(); + + m_cheatSettingsPage = 1; + int txtavailable = m_cheatfile.openTxtfile(fmt("%s/%s.txt", m_txtCheatDir.c_str(), m_cf.getId().c_str())); + + _showCheatSettings(); + _textCheatSettings(); + + if (txtavailable) + m_btnMgr.setText(m_cheatLblTitle,wfmt(L"%s",m_cheatfile.getGameName().c_str())); + else + m_btnMgr.setText(m_cheatLblTitle,L""); + + while (true) + { + _mainLoopCommon(); + if (BTN_HOME_PRESSED || BTN_B_PRESSED) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + else if (txtavailable && (BTN_MINUS_PRESSED || BTN_LEFT_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_cheatBtnPageM)))) + { + _hideCheatSettings(); + if (m_cheatSettingsPage == 1) + m_cheatSettingsPage = (m_cheatfile.getCnt()+CHEATSPERPAGE-1)/CHEATSPERPAGE; + else if (m_cheatSettingsPage > 1) + --m_cheatSettingsPage; + if(BTN_LEFT_PRESSED || BTN_MINUS_PRESSED) m_btnMgr.click(m_cheatBtnPageM); + _showCheatSettings(); + } + else if (txtavailable && (BTN_PLUS_PRESSED || BTN_RIGHT_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_cheatBtnPageP)))) + { + _hideCheatSettings(); + if (m_cheatSettingsPage == (m_cheatfile.getCnt()+CHEATSPERPAGE-1)/CHEATSPERPAGE) + m_cheatSettingsPage = 1; + else if (m_cheatSettingsPage < (m_cheatfile.getCnt()+CHEATSPERPAGE-1)/CHEATSPERPAGE) + ++m_cheatSettingsPage; + if(BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED) m_btnMgr.click(m_cheatBtnPageP); + _showCheatSettings(); + } + else if ((WBTN_2_HELD && WBTN_1_PRESSED) || (WBTN_1_HELD && WBTN_2_PRESSED)) + { + remove(fmt("%s/%s.gct", m_cheatDir.c_str(), m_cf.getId().c_str())); + remove(fmt("%s/%s.txt", m_txtCheatDir.c_str(), m_cf.getId().c_str())); + m_gcfg2.remove(m_cf.getId(), "cheat"); + m_gcfg2.remove(m_cf.getId(), "hooktype"); + break; + } + else if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_cheatBtnBack)) + break; + for (int i = 0; i < CHEATSPERPAGE; ++i) + if (m_btnMgr.selected(m_cheatBtnItem[i])) + { + // handling code for clicked cheat + m_cheatfile.sCheatSelected[(m_cheatSettingsPage-1)*CHEATSPERPAGE + i] = !m_cheatfile.sCheatSelected[(m_cheatSettingsPage-1)*CHEATSPERPAGE + i]; + _showCheatSettings(); + } + + if (m_btnMgr.selected(m_cheatBtnApply)) + { + bool selected = false; + //checks if at least one cheat is selected + for (unsigned int i=0; i < m_cheatfile.getCnt(); ++i) + { + if (m_cheatfile.sCheatSelected[i] == true) + { + selected = true; + break; + } + } + + if (selected) + { + m_cheatfile.createGCT(fmt("%s/%s.gct", m_cheatDir.c_str(), m_cf.getId().c_str())); + m_gcfg2.setOptBool(m_cf.getId(), "cheat", 1); + m_gcfg2.setInt(m_cf.getId(), "hooktype", m_gcfg2.getInt(m_cf.getId(), "hooktype", 1)); + } + else + { + remove(fmt("%s/%s.gct", m_cheatDir.c_str(), m_cf.getId().c_str())); + m_gcfg2.remove(m_cf.getId(), "cheat"); + m_gcfg2.remove(m_cf.getId(), "hooktype"); + } + m_cheatfile.createTXT(fmt("%s/%s.txt", m_txtCheatDir.c_str(), m_cf.getId().c_str())); + break; + } + else if (m_btnMgr.selected(m_cheatBtnDownload)) + { + int msg = 0; + wstringEx prevMsg; + + // Download cheat code + m_btnMgr.setProgress(m_downloadPBar, 0.f); + _hideCheatSettings(); + _showCheatDownload(); + m_btnMgr.setText(m_downloadBtnCancel, _t("dl1", L"Cancel")); + m_thrdStop = false; + m_thrdMessageAdded = false; + + m_thrdWorking = true; + lwp_t thread = LWP_THREAD_NULL; + LWP_CreateThread(&thread, (void *(*)(void *))CMenu::_downloadCheatFileAsync, (void *)this, 0, 8192, 40); + while (m_thrdWorking) + { + _mainLoopCommon(false, m_thrdWorking); + if ((BTN_HOME_PRESSED || BTN_B_PRESSED) && !m_thrdWorking) + break; + if (BTN_A_PRESSED && !(m_thrdWorking && m_thrdStop)) + { + if (m_btnMgr.selected(m_downloadBtnCancel)) + { + LockMutex lock(m_mutex); + m_thrdStop = true; + m_thrdMessageAdded = true; + m_thrdMessage = _t("dlmsg6", L"Canceling..."); + } + } + if (Sys_Exiting()) + { + LockMutex lock(m_mutex); + m_thrdStop = true; + m_thrdMessageAdded = true; + m_thrdMessage = _t("dlmsg6", L"Canceling..."); + m_thrdWorking = false; + } + + if (m_thrdMessageAdded) + { + LockMutex lock(m_mutex); + m_thrdMessageAdded = false; + m_btnMgr.setProgress(m_downloadPBar, m_thrdProgress); + if (m_thrdProgress >= 1.f) { + // m_btnMgr.setText(m_downloadBtnCancel, _t("dl2", L"Back")); + break; + } + if (prevMsg != m_thrdMessage) + { + prevMsg = m_thrdMessage; + m_btnMgr.setText(m_downloadLblMessage[msg], m_thrdMessage, false); + m_btnMgr.hide(m_downloadLblMessage[msg], 0, 0, -1.f, -1.f, true); + m_btnMgr.show(m_downloadLblMessage[msg]); + msg ^= 1; + m_btnMgr.hide(m_downloadLblMessage[msg], 0, 0, -1.f, -1.f); + } + } + if (m_thrdStop && !m_thrdWorking) + break; + } + if (thread != LWP_THREAD_NULL) + { + LWP_JoinThread(thread, NULL); + thread = LWP_THREAD_NULL; + } + _hideCheatDownload(); + + txtavailable = m_cheatfile.openTxtfile(fmt("%s/%s.txt", m_txtCheatDir.c_str(), m_cf.getId().c_str())); + _showCheatSettings(); + + if (txtavailable) + m_btnMgr.setText(m_cheatLblTitle,wfmt(L"%s",m_cheatfile.getGameName().c_str())); + else + m_btnMgr.setText(m_cheatLblTitle,L""); + + if (m_cheatfile.getCnt() == 0) + { + // cheat code not found, show result + m_btnMgr.setText(m_cheatLblItem[0], _t("cheat4", L"Download not found.")); + m_btnMgr.setText(m_cheatLblItem[1], sfmt(GECKOURL, m_cf.getId().c_str())); + m_btnMgr.show(m_cheatLblItem[1]); + } + } + } + } + _hideCheatSettings(); +} + +void CMenu::_hideCheatSettings(bool instant) +{ + m_btnMgr.hide(m_cheatBtnBack, instant); + m_btnMgr.hide(m_cheatBtnApply, instant); + m_btnMgr.hide(m_cheatBtnDownload, instant); + m_btnMgr.hide(m_cheatLblTitle, instant); + + m_btnMgr.hide(m_cheatLblPage, instant); + m_btnMgr.hide(m_cheatBtnPageM, instant); + m_btnMgr.hide(m_cheatBtnPageP, instant); + + for (int i=0;i 0) + { + // cheat found, show apply + m_btnMgr.show(m_cheatBtnApply); + m_btnMgr.show(m_cheatLblPage); + m_btnMgr.show(m_cheatBtnPageM); + m_btnMgr.show(m_cheatBtnPageP); + m_btnMgr.setText(m_cheatLblPage, wfmt(L"%i / %i", m_cheatSettingsPage, (m_cheatfile.getCnt()+CHEATSPERPAGE-1)/CHEATSPERPAGE)); + + // Show cheats if available, else hide + for (u32 i=0; i < CHEATSPERPAGE; ++i) + { + // cheat in range? + if (((m_cheatSettingsPage-1)*CHEATSPERPAGE + i + 1) <= m_cheatfile.getCnt()) + { + m_btnMgr.setText(m_cheatLblItem[i], wfmt(L"%s", m_cheatfile.getCheatName((m_cheatSettingsPage-1)*CHEATSPERPAGE + i).c_str())); + m_btnMgr.setText(m_cheatBtnItem[i], _optBoolToString(m_cheatfile.sCheatSelected[(m_cheatSettingsPage-1)*CHEATSPERPAGE + i])); + + m_btnMgr.show(m_cheatLblItem[i], true); + m_btnMgr.show(m_cheatBtnItem[i], true); + } + else + { + // cheat out of range, hide elements + m_btnMgr.hide(m_cheatLblItem[i], true); + m_btnMgr.hide(m_cheatBtnItem[i], true); + } + } + } + else + { + // no cheat found, allow downloading + m_btnMgr.show(m_cheatBtnDownload); + m_btnMgr.setText(m_cheatLblItem[0], _t("cheat3", L"Cheat file for game not found.")); + m_btnMgr.show(m_cheatLblItem[0]); + + } +} + + +void CMenu::_initCheatSettingsMenu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_cheatLblUser, ARRAY_SIZE(m_cheatLblUser), "CHEAT"); + m_cheatBg = _texture(theme.texSet, "CHEAT/BG", "texture", theme.bg); + m_cheatLblTitle = _addLabel(theme, "CHEAT/TITLE", theme.titleFont, L"Cheats", 20, 30, 600, 60, theme.titleFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE); + m_cheatBtnBack = _addButton(theme, "CHEAT/BACK_BTN", theme.btnFont, L"", 460, 410, 150, 56, theme.btnFontColor); + m_cheatBtnApply = _addButton(theme, "CHEAT/APPLY_BTN", theme.btnFont, L"", 240, 410, 150, 56, theme.btnFontColor); + m_cheatBtnDownload = _addButton(theme, "CHEAT/DOWNLOAD_BTN", theme.btnFont, L"", 240, 410, 200, 56, theme.btnFontColor); + + m_cheatLblPage = _addLabel(theme, "CHEAT/PAGE_BTN", theme.btnFont, L"", 76, 410, 80, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_cheatBtnPageM = _addPicButton(theme, "CHEAT/PAGE_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 20, 410, 56, 56); + m_cheatBtnPageP = _addPicButton(theme, "CHEAT/PAGE_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 156, 410, 56, 56); + + m_cheatLblItem[0] = _addLabel(theme, "CHEAT/ITEM_0", theme.lblFont, L"", 40, 100, 460, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_cheatBtnItem[0] = _addButton(theme, "CHEAT/ITEM_0_BTN", theme.btnFont, L"", 500, 100, 120, 56, theme.btnFontColor); + m_cheatLblItem[1] = _addLabel(theme, "CHEAT/ITEM_1", theme.lblFont, L"", 40, 160, 460, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_cheatBtnItem[1] = _addButton(theme, "CHEAT/ITEM_1_BTN", theme.btnFont, L"", 500, 160, 120, 56, theme.btnFontColor); + m_cheatLblItem[2] = _addLabel(theme, "CHEAT/ITEM_2", theme.lblFont, L"", 40, 220, 460, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_cheatBtnItem[2] = _addButton(theme, "CHEAT/ITEM_2_BTN", theme.btnFont, L"", 500, 220, 120, 56, theme.btnFontColor); + m_cheatLblItem[3] = _addLabel(theme, "CHEAT/ITEM_3", theme.lblFont, L"", 40, 280, 460, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_cheatBtnItem[3] = _addButton(theme, "CHEAT/ITEM_3_BTN", theme.btnFont, L"", 500, 280, 120, 56, theme.btnFontColor); + + _setHideAnim(m_systemLblTitle, "CHEAT/TITLE", 0, 100, 0.f, 0.f); + _setHideAnim(m_cheatBtnApply, "CHEAT/APPLY_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_cheatBtnBack, "CHEAT/BACK_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_cheatBtnDownload, "CHEAT/DOWNLOAD_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_cheatLblPage, "CHEAT/PAGE_BTN", 0, 200, 1.f, 0.f); + _setHideAnim(m_cheatBtnPageM, "CHEAT/PAGE_MINUS", 0, 200, 1.f, 0.f); + _setHideAnim(m_cheatBtnPageP, "CHEAT/PAGE_PLUS", 0, 200, 1.f, 0.f); + + for (int i=0;i= sizeof code) + break; + } + _hideCode(); + return n == sizeof code; +} + +void CMenu::_initCodeMenu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_codeLblUser, ARRAY_SIZE(m_codeLblUser), "CODE"); + m_codeBg = _texture(theme.texSet, "CODE/BG", "texture", theme.bg); + m_codeLblTitle = _addLabel(theme, "CODE/CODE", theme.titleFont, L"_ _ _ _", 20, 30, 600, 60, theme.titleFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE); + m_codeBtnKey[7] = _addButton(theme, "CODE/7_BTN", theme.btnFont, L"7", 160, 100, 100, 50, theme.btnFontColor); + m_codeBtnKey[8] = _addButton(theme, "CODE/8_BTN", theme.btnFont, L"8", 270, 100, 100, 50, theme.btnFontColor); + m_codeBtnKey[9] = _addButton(theme, "CODE/9_BTN", theme.btnFont, L"9", 380, 100, 100, 50, theme.btnFontColor); + m_codeBtnKey[4] = _addButton(theme, "CODE/4_BTN", theme.btnFont, L"4", 160, 180, 100, 50, theme.btnFontColor); + m_codeBtnKey[5] = _addButton(theme, "CODE/5_BTN", theme.btnFont, L"5", 270, 180, 100, 50, theme.btnFontColor); + m_codeBtnKey[6] = _addButton(theme, "CODE/6_BTN", theme.btnFont, L"6", 380, 180, 100, 50, theme.btnFontColor); + m_codeBtnKey[1] = _addButton(theme, "CODE/1_BTN", theme.btnFont, L"1", 160, 260, 100, 50, theme.btnFontColor); + m_codeBtnKey[2] = _addButton(theme, "CODE/2_BTN", theme.btnFont, L"2", 270, 260, 100, 50, theme.btnFontColor); + m_codeBtnKey[3] = _addButton(theme, "CODE/3_BTN", theme.btnFont, L"3", 380, 260, 100, 50, theme.btnFontColor); + m_codeBtnKey[0] = _addButton(theme, "CODE/0_BTN", theme.btnFont, L"0", 270, 340, 210, 50, theme.btnFontColor); + m_codeBtnErase = _addButton(theme, "CODE/ERASE_BTN", theme.btnFont, L"", 20, 410, 200, 56, theme.btnFontColor); + m_codeBtnBack = _addButton(theme, "CODE/BACK_BTN", theme.btnFont, L"", 420, 410, 200, 56, theme.btnFontColor); + // + for (int i = 0; i < 10; ++i) + _setHideAnim(m_codeBtnKey[i], sfmt("CODE/%i_BTN", i).c_str(), 0, 0, 0.f, 0.f); + _setHideAnim(m_codeBtnErase, "CODE/ERASE_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_codeBtnBack, "CODE/BACK_BTN", 0, 0, -2.f, 0.f); + // + _hideCode(true); + _textCode(); +} + +void CMenu::_textCode(void) +{ + m_btnMgr.setText(m_codeBtnBack, _t("cd1", L"Back")); + m_btnMgr.setText(m_codeBtnErase, _t("cd2", L"Erase")); + m_btnMgr.setText(m_codeLblTitle, L"_ _ _ _"); +} diff --git a/source/menu/menu_config.cpp b/source/menu/menu_config.cpp new file mode 100644 index 00000000..f1ad938c --- /dev/null +++ b/source/menu/menu_config.cpp @@ -0,0 +1,293 @@ + +#include "menu.hpp" +#include "sys.h" + + +using namespace std; + +static inline int loopNum(int i, int s) +{ + return i < 0 ? (s - (-i % s)) % s : i % s; +} + +const int CMenu::_nbCfgPages = 6; +static const int g_curPage = 1; + +void CMenu::_hideConfig(bool instant) +{ + m_btnMgr.hide(m_configLblTitle, instant); + m_btnMgr.hide(m_configBtnBack, instant); + m_btnMgr.hide(m_configLblPage, instant); + m_btnMgr.hide(m_configBtnPageM, instant); + m_btnMgr.hide(m_configBtnPageP, instant); + m_btnMgr.hide(m_configBtnBack, instant); + m_btnMgr.hide(m_configLblPartitionName, instant); + m_btnMgr.hide(m_configLblPartition, instant); + m_btnMgr.hide(m_configBtnPartitionP, instant); + m_btnMgr.hide(m_configBtnPartitionM, instant); + m_btnMgr.hide(m_configLblDownload, instant); + m_btnMgr.hide(m_configBtnDownload, instant); + m_btnMgr.hide(m_configLblParental, instant); + m_btnMgr.hide(m_configBtnUnlock, instant); + m_btnMgr.hide(m_configBtnSetCode, instant); + m_btnMgr.hide(m_configBtnEmulation, instant); + m_btnMgr.hide(m_configLblEmulation, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_configLblUser); ++i) + if (m_configLblUser[i] != -1u) + m_btnMgr.hide(m_configLblUser[i], instant); +} + +void CMenu::_showConfig(void) +{ + _setBg(m_configBg, m_configBg); + m_btnMgr.show(m_configLblTitle); + m_btnMgr.show(m_configBtnBack); + m_btnMgr.show(m_configLblPartitionName); + m_btnMgr.show(m_configLblPartition); + m_btnMgr.show(m_configBtnPartitionP); + m_btnMgr.show(m_configBtnPartitionM); + m_btnMgr.show(m_configLblDownload); + m_btnMgr.show(m_configBtnDownload); + m_btnMgr.show(m_configLblParental); + m_btnMgr.show(m_configLblPage); + m_btnMgr.show(m_configBtnPageM); + m_btnMgr.show(m_configBtnPageP); + + if(m_current_view != COVERFLOW_HOMEBREW) + { + m_btnMgr.show(m_configBtnEmulation); + m_btnMgr.show(m_configLblEmulation); + } + + m_btnMgr.show(m_locked ? m_configBtnUnlock : m_configBtnSetCode); + + bool disable = m_current_view == COVERFLOW_CHANNEL && m_cfg.getBool("NAND", "disable", true); + char *partitionname = disable ? (char *)"NAND" : (char *)DeviceName[m_cfg.getInt(_domainFromView(), "partition", -1)]; + + for(u8 i = 0; strncmp((const char *)&partitionname[i], "\0", 1) != 0; i++) + partitionname[i] = toupper(partitionname[i]); + + + for (u32 i = 0; i < ARRAY_SIZE(m_configLblUser); ++i) + if (m_configLblUser[i] != -1u) + m_btnMgr.show(m_configLblUser[i]); + + m_btnMgr.setText(m_configLblPartition, (string)partitionname); + m_btnMgr.setText(m_configLblPage, wfmt(L"%i / %i", g_curPage, m_locked ? g_curPage + 1 : CMenu::_nbCfgPages)); + + bool isON = false; + switch(m_current_view) + { + case COVERFLOW_CHANNEL: + m_btnMgr.setText(m_configLblEmulation, _t("cfg12", L"NAND Emulation")); + isON = m_cfg.getBool("NAND", "disable", true); + break; + case COVERFLOW_USB: + m_btnMgr.setText(m_configLblEmulation, _t("cfg11", L"USB Saves Emulation")); + isON = !m_cfg.getBool("GAMES", "save_emulation", false); + break; + } + m_btnMgr.setText(m_configBtnEmulation, isON ? _t("off", L"Off") : _t("on", L"On")); +} + +void CMenu::_config(int page) +{ + m_curGameId = m_cf.getId(); + m_cf.clear(); + while (page > 0 && page <= CMenu::_nbCfgPages) + switch (page) + { + case 1: + page = _config1(); + break; + case 2: + page = _configAdv(); + break; + case 3: + page = _config3(); + break; + case 4: + page = _config4(); + break; + case 5: + page = _configSnd(); + break; + case 6: + page = _configScreen(); + break; + } + m_cfg.save(); + m_cf.setBoxMode(m_cfg.getBool("GENERAL", "box_mode")); + _initCF(); +} + +int CMenu::_config1(void) +{ + int nextPage = 0; + SetupInput(); + + s32 bCurrentPartition = currentPartition; + + gprintf("Current Partition: %d\n", currentPartition); + + _showConfig(); + while (true) + { + _mainLoopCommon(); + if (BTN_HOME_PRESSED || BTN_B_PRESSED) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if (BTN_LEFT_PRESSED || BTN_MINUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageM))) + { + nextPage = g_curPage == 1 && !m_locked ? CMenu::_nbCfgPages : max(1, m_locked ? 1 : g_curPage - 1); + if(BTN_LEFT_PRESSED || BTN_MINUS_PRESSED) m_btnMgr.click(m_configBtnPageM); + break; + } + if (BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageP))) + { + nextPage = (g_curPage == CMenu::_nbCfgPages) ? 1 : min(g_curPage + 1, CMenu::_nbCfgPages); + if(BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED) m_btnMgr.click(m_configBtnPageP); + break; + } + if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_configBtnBack)) + break; + else if (m_btnMgr.selected(m_configBtnDownload)) + { + m_cf.stopCoverLoader(true); + _hideConfig(); + _download(); + _showConfig(); + m_cf.startCoverLoader(); + } + else if (m_btnMgr.selected(m_configBtnUnlock)) + { + char code[4]; + _hideConfig(); + if (_code(code) && memcmp(code, m_cfg.getString("GENERAL", "parent_code", "").c_str(), 4) == 0) + m_locked = false; + _showConfig(); + } + else if (m_btnMgr.selected(m_configBtnSetCode)) + { + char code[4]; + _hideConfig(); + if (_code(code, true)) + { + m_cfg.setString("GENERAL", "parent_code", string(code, 4).c_str()); + m_locked = true; + } + _showConfig(); + } + else if (!m_locked && (m_btnMgr.selected(m_configBtnPartitionP) || m_btnMgr.selected(m_configBtnPartitionM))) + { + bool disable = m_current_view == COVERFLOW_CHANNEL && m_cfg.getBool("NAND", "disable", true); + if(!disable) + { + bool isD2Xv7 = IOS_GetRevision() % 100 == 7; + u8 limiter = 0; + s8 direction = m_btnMgr.selected(m_configBtnPartitionP) ? 1 : -1; + currentPartition = loopNum(currentPartition + direction, (int)USB8); + while(!DeviceHandler::Instance()->IsInserted(currentPartition) || + (m_current_view == COVERFLOW_CHANNEL && (DeviceHandler::Instance()->GetFSType(currentPartition) != PART_FS_FAT || + (!isD2Xv7 && DeviceHandler::Instance()->PathToDriveType(m_appDir.c_str()) == currentPartition) || + (!isD2Xv7 && DeviceHandler::Instance()->PathToDriveType(m_dataDir.c_str()) == currentPartition))) || + (m_current_view == COVERFLOW_HOMEBREW && DeviceHandler::Instance()->GetFSType(currentPartition) == PART_FS_WBFS)) + { + currentPartition = loopNum(currentPartition + direction, (int)USB8); + if (limiter > 10) break; + limiter++; + } + + gprintf("Next item: %s\n", DeviceName[currentPartition]); + m_cfg.setInt(_domainFromView(), "partition", currentPartition); + } + _showConfig(); + } + else if (!m_locked && m_btnMgr.selected(m_configBtnEmulation)) + { + m_cfg.setBool("GAMES", "save_emulation", !m_cfg.getBool("GAMES", "save_emulation", false)); + _showConfig(); + } + } + } + if (currentPartition != bCurrentPartition) + { + bool disable = m_current_view == COVERFLOW_CHANNEL && m_cfg.getBool("NAND", "disable", true); + if(!disable) + { + char *newpartition = disable ? (char *)"NAND" : (char *)DeviceName[m_cfg.getInt(_domainFromView(), "partition", currentPartition)]; + + for(u8 i = 0; strncmp((const char *)&newpartition[i], "\0", 1) != 0; i++) + newpartition[i] = toupper(newpartition[i]); + + gprintf("Switching partition to %s\n", newpartition); + _showWaitMessage(); + _loadList(); + _hideWaitMessage(); + } + } + + _hideConfig(); + + return nextPage; +} + +void CMenu::_initConfigMenu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_configLblUser, ARRAY_SIZE(m_configLblUser), "CONFIG"); + m_configBg = _texture(theme.texSet, "CONFIG/BG", "texture", theme.bg); + m_configLblTitle = _addLabel(theme, "CONFIG/TITLE", theme.titleFont, L"", 20, 30, 600, 60, theme.titleFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE); + m_configLblDownload = _addLabel(theme, "CONFIG/DOWNLOAD", theme.lblFont, L"", 40, 130, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configBtnDownload = _addButton(theme, "CONFIG/DOWNLOAD_BTN", theme.btnFont, L"", 400, 130, 200, 56, theme.btnFontColor); + m_configLblParental = _addLabel(theme, "CONFIG/PARENTAL", theme.lblFont, L"", 40, 190, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configBtnUnlock = _addButton(theme, "CONFIG/UNLOCK_BTN", theme.btnFont, L"", 400, 190, 200, 56, theme.btnFontColor); + m_configBtnSetCode = _addButton(theme, "CONFIG/SETCODE_BTN", theme.btnFont, L"", 400, 190, 200, 56, theme.btnFontColor); + m_configLblPartitionName = _addLabel(theme, "CONFIG/PARTITION", theme.lblFont, L"", 40, 250, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configLblPartition = _addLabel(theme, "CONFIG/PARTITION_BTN", theme.btnFont, L"", 456, 250, 88, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configBtnPartitionM = _addPicButton(theme, "CONFIG/PARTITION_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 400, 250, 56, 56); + m_configBtnPartitionP = _addPicButton(theme, "CONFIG/PARTITION_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 250, 56, 56); + m_configLblEmulation = _addLabel(theme, "CONFIG/EMU_SAVE", theme.lblFont, L"", 40, 310, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configBtnEmulation = _addButton(theme, "CONFIG/EMU_SAVE_BTN", theme.btnFont, L"", 400, 310, 200, 56, theme.btnFontColor); + m_configLblPage = _addLabel(theme, "CONFIG/PAGE_BTN", theme.btnFont, L"", 76, 410, 80, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configBtnPageM = _addPicButton(theme, "CONFIG/PAGE_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 20, 410, 56, 56); + m_configBtnPageP = _addPicButton(theme, "CONFIG/PAGE_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 156, 410, 56, 56); + m_configBtnBack = _addButton(theme, "CONFIG/BACK_BTN", theme.btnFont, L"", 420, 410, 200, 56, theme.btnFontColor); + // + _setHideAnim(m_configLblTitle, "CONFIG/TITLE", 0, 0, -2.f, 0.f); + + _setHideAnim(m_configLblDownload, "CONFIG/DOWNLOAD", 100, 0, -2.f, 0.f); + _setHideAnim(m_configBtnDownload, "CONFIG/DOWNLOAD_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_configLblParental, "CONFIG/PARENTAL", 100, 0, -2.f, 0.f); + _setHideAnim(m_configBtnUnlock, "CONFIG/UNLOCK_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_configBtnSetCode, "CONFIG/SETCODE_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_configLblPartitionName, "CONFIG/PARTITION", 100, 0, -2.f, 0.f); + _setHideAnim(m_configLblPartition, "CONFIG/PARTITION_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configBtnPartitionM, "CONFIG/PARTITION_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configBtnPartitionP, "CONFIG/PARTITION_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configLblEmulation, "CONFIG/EMU_SAVE", 100, 0, -2.f, 0.f); + _setHideAnim(m_configBtnEmulation, "CONFIG/EMU_SAVE_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_configBtnBack, "CONFIG/BACK_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_configLblPage, "CONFIG/PAGE_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configBtnPageM, "CONFIG/PAGE_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configBtnPageP, "CONFIG/PAGE_PLUS", 0, 0, 1.f, -1.f); + _hideConfig(true); + _textConfig(); +} + +void CMenu::_textConfig(void) +{ + m_btnMgr.setText(m_configLblTitle, _t("cfg1", L"Settings")); + m_btnMgr.setText(m_configLblDownload, _t("cfg3", L"Download covers & titles")); + m_btnMgr.setText(m_configBtnDownload, _t("cfg4", L"Download")); + m_btnMgr.setText(m_configLblParental, _t("cfg5", L"Parental control")); + m_btnMgr.setText(m_configBtnUnlock, _t("cfg6", L"Unlock")); + m_btnMgr.setText(m_configBtnSetCode, _t("cfg7", L"Set code")); + + m_btnMgr.setText(m_configLblPartitionName, _t("cfgp1", L"Game Partition")); + m_btnMgr.setText(m_configBtnBack, _t("cfg10", L"Back")); +} diff --git a/source/menu/menu_config3.cpp b/source/menu/menu_config3.cpp new file mode 100644 index 00000000..9ff614c2 --- /dev/null +++ b/source/menu/menu_config3.cpp @@ -0,0 +1,177 @@ + +#include "menu.hpp" + + +#define ARRAY_SIZE(a) (sizeof a / sizeof a[0]) + +using namespace std; + +static const int g_curPage = 3; + +template static inline T loopNum(T i, T s) +{ + return (i + s) % s; +} + +void CMenu::_hideConfig3(bool instant) +{ + m_btnMgr.hide(m_configLblTitle, instant); + m_btnMgr.hide(m_configBtnBack, instant); + m_btnMgr.hide(m_configLblPage, instant); + m_btnMgr.hide(m_configBtnPageM, instant); + m_btnMgr.hide(m_configBtnPageP, instant); + // + m_btnMgr.hide(m_config3LblGameLanguage, instant); + m_btnMgr.hide(m_config3LblLanguage, instant); + m_btnMgr.hide(m_config3BtnLanguageP, instant); + m_btnMgr.hide(m_config3BtnLanguageM, instant); + m_btnMgr.hide(m_config3LblGameVideo, instant); + m_btnMgr.hide(m_config3LblVideo, instant); + m_btnMgr.hide(m_config3BtnVideoP, instant); + m_btnMgr.hide(m_config3BtnVideoM, instant); + m_btnMgr.hide(m_config3LblAsyncNet, instant); + m_btnMgr.hide(m_config3BtnAsyncNet, instant); + m_btnMgr.hide(m_config3LblOcarina, instant); + m_btnMgr.hide(m_config3BtnOcarina, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_config3LblUser); ++i) + if (m_config3LblUser[i] != -1u) + m_btnMgr.hide(m_config3LblUser[i], instant); +} + +void CMenu::_showConfig3(void) +{ + _setBg(m_config3Bg, m_config3Bg); + m_btnMgr.show(m_configLblTitle); + m_btnMgr.show(m_configBtnBack); + m_btnMgr.show(m_configLblPage); + m_btnMgr.show(m_configBtnPageM); + m_btnMgr.show(m_configBtnPageP); + // + m_btnMgr.show(m_config3LblGameLanguage); + m_btnMgr.show(m_config3LblLanguage); + m_btnMgr.show(m_config3BtnLanguageP); + m_btnMgr.show(m_config3BtnLanguageM); + m_btnMgr.show(m_config3LblGameVideo); + m_btnMgr.show(m_config3LblVideo); + m_btnMgr.show(m_config3BtnVideoP); + m_btnMgr.show(m_config3BtnVideoM); + m_btnMgr.show(m_config3LblAsyncNet); + m_btnMgr.show(m_config3BtnAsyncNet); + m_btnMgr.show(m_config3LblOcarina); + m_btnMgr.show(m_config3BtnOcarina); + + for (u32 i = 0; i < ARRAY_SIZE(m_config3LblUser); ++i) + if (m_config3LblUser[i] != -1u) + m_btnMgr.show(m_config3LblUser[i]); + // + m_btnMgr.setText(m_configLblPage, wfmt(L"%i / %i", g_curPage, m_locked ? g_curPage : CMenu::_nbCfgPages)); + int i = min(max(0, m_cfg.getInt("GENERAL", "video_mode", 0)), (int)ARRAY_SIZE(CMenu::_videoModes) - 1); + + m_btnMgr.setText(m_config3LblVideo, _t(CMenu::_videoModes[i].id, CMenu::_videoModes[i].text)); + i = min(max(0, m_cfg.getInt("GENERAL", "game_language", 0)), (int)ARRAY_SIZE(CMenu::_languages) - 1); + + m_btnMgr.setText(m_config3LblLanguage, _t(CMenu::_languages[i].id, CMenu::_languages[i].text)); + + m_btnMgr.setText(m_config3BtnAsyncNet, m_cfg.getBool("GENERAL", "async_network", false) ? _t("on", L"On") : _t("off", L"Off")); + + m_btnMgr.setText(m_config3BtnOcarina, m_cfg.getBool(_domainFromView(), "cheat", false) ? _t("on", L"On") : _t("off", L"Off")); +} + +int CMenu::_config3(void) +{ + int nextPage = 0; + + _showConfig3(); + while (true) + { + _mainLoopCommon(); + if (BTN_HOME_PRESSED || BTN_B_PRESSED) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if (BTN_LEFT_PRESSED || BTN_MINUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageM))) + { + nextPage = max(1, m_locked ? 1 : g_curPage - 1); + if(BTN_LEFT_PRESSED || BTN_MINUS_PRESSED) m_btnMgr.click(m_configBtnPageM); + break; + } + if (!m_locked && (BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageP)))) + { + nextPage = min(g_curPage + 1, CMenu::_nbCfgPages); + if(BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED) m_btnMgr.click(m_configBtnPageP); + break; + } + if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_configBtnBack)) + break; + else if (m_btnMgr.selected(m_config3BtnLanguageP) || m_btnMgr.selected(m_config3BtnLanguageM)) + { + s8 direction = m_btnMgr.selected(m_config3BtnLanguageP) ? 1 : -1; + m_cfg.setInt("GENERAL", "game_language", (int)loopNum((u32)m_cfg.getInt("GENERAL", "game_language", 0) + direction, ARRAY_SIZE(CMenu::_languages))); + _showConfig3(); + } + else if (m_btnMgr.selected(m_config3BtnVideoP) || m_btnMgr.selected(m_config3BtnVideoM)) + { + s8 direction = m_btnMgr.selected(m_config3BtnVideoP) ? 1 : -1; + m_cfg.setInt("GENERAL", "video_mode", (int)loopNum((u32)m_cfg.getInt("GENERAL", "video_mode", 0) + direction, ARRAY_SIZE(CMenu::_videoModes))); + _showConfig3(); + } + else if (m_btnMgr.selected(m_config3BtnAsyncNet)) + { + m_cfg.setBool("GENERAL", "async_network", !m_cfg.getBool("GENERAL", "async_network", false)); + _showConfig3(); + } + else if (m_btnMgr.selected(m_config3BtnOcarina)) + { + m_cfg.setBool(_domainFromView(), "cheat", !m_cfg.getBool(_domainFromView(), "cheat", false)); + _showConfig3(); + } + } + } + _hideConfig3(); + return nextPage; +} + +void CMenu::_initConfig3Menu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_config3LblUser, ARRAY_SIZE(m_config3LblUser), "CONFIG3"); + m_config3Bg = _texture(theme.texSet, "CONFIG3/BG", "texture", theme.bg); + m_config3LblGameVideo = _addLabel(theme, "CONFIG3/VIDEO", theme.lblFont, L"", 40, 130, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_config3LblVideo = _addLabel(theme, "CONFIG3/VIDEO_BTN", theme.btnFont, L"", 386, 130, 158, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_config3BtnVideoM = _addPicButton(theme, "CONFIG3/VIDEO_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 330, 130, 56, 56); + m_config3BtnVideoP = _addPicButton(theme, "CONFIG3/VIDEO_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 130, 56, 56); + m_config3LblGameLanguage = _addLabel(theme, "CONFIG3/GAME_LANG", theme.lblFont, L"", 40, 190, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_config3LblLanguage = _addLabel(theme, "CONFIG3/GAME_LANG_BTN", theme.btnFont, L"", 386, 190, 158, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_config3BtnLanguageM = _addPicButton(theme, "CONFIG3/GAME_LANG_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 330, 190, 56, 56); + m_config3BtnLanguageP = _addPicButton(theme, "CONFIG3/GAME_LANG_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 190, 56, 56); + m_config3LblAsyncNet = _addLabel(theme, "CONFIG3/ASYNCNET", theme.lblFont, L"", 40, 250, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_config3BtnAsyncNet = _addButton(theme, "CONFIG3/ASYNCNET_BTN", theme.btnFont, L"", 330, 250, 270, 56, theme.btnFontColor); + m_config3LblOcarina = _addLabel(theme, "CONFIG3/OCARINA", theme.lblFont, L"", 40, 310, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_config3BtnOcarina = _addButton(theme, "CONFIG3/OCARINA_BTN", theme.btnFont, L"", 330, 310, 270, 56, theme.btnFontColor); + // + _setHideAnim(m_config3LblGameVideo, "CONFIG3/VIDEO", 100, 0, -2.f, 0.f); + _setHideAnim(m_config3LblVideo, "CONFIG3/VIDEO_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_config3BtnVideoM, "CONFIG3/VIDEO_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_config3BtnVideoP, "CONFIG3/VIDEO_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_config3LblGameLanguage, "CONFIG3/GAME_LANG", 100, 0, -2.f, 0.f); + _setHideAnim(m_config3LblLanguage, "CONFIG3/GAME_LANG_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_config3BtnLanguageM, "CONFIG3/GAME_LANG_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_config3BtnLanguageP, "CONFIG3/GAME_LANG_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_config3LblAsyncNet, "CONFIG3/ASYNCNET", 100, 0, -2.f, 0.f); + _setHideAnim(m_config3BtnAsyncNet, "CONFIG3/ASYNCNET_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_config3LblOcarina, "CONFIG3/OCARINA", 100, 0, -2.f, 0.f); + _setHideAnim(m_config3BtnOcarina, "CONFIG3/OCARINA_BTN", 0, 0, 1.f, -1.f); + _hideConfig3(true); + _textConfig3(); +} + +void CMenu::_textConfig3(void) +{ + m_btnMgr.setText(m_config3LblGameVideo, _t("cfgb3", L"Default video mode")); + m_btnMgr.setText(m_config3LblGameLanguage, _t("cfgb4", L"Default game language")); + m_btnMgr.setText(m_config3LblAsyncNet, _t("cfgp3", L"Init network on boot")); + m_btnMgr.setText(m_config3LblOcarina, _t("cfgb1", L"Ocarina")); +} diff --git a/source/menu/menu_config4.cpp b/source/menu/menu_config4.cpp new file mode 100644 index 00000000..9684ad4c --- /dev/null +++ b/source/menu/menu_config4.cpp @@ -0,0 +1,222 @@ + +#include "menu.hpp" +#include "loader/sys.h" +#include "channels.h" +#include "gecko.h" +#include "defines.h" +#include "nand.hpp" + +using namespace std; + +static const int g_curPage = 4; + +static inline int loopNum(int i, int s) +{ + return i < 0 ? (s - (-i % s)) % s : i % s; +} + +int currentChannelIndex = -1; +int amountOfChannels = -1; + +const CMenu::SOption CMenu::_exitTo[5] = { + { "menu", L"Menu" }, + { "hbc", L"HBC" }, + { "prii", L"Prii" }, + { "disabled", L"Disabled" }, + { "bootmii", L"BootMii" } +}; + +void CMenu::_hideConfig4(bool instant) +{ + m_btnMgr.hide(m_configLblTitle, instant); + m_btnMgr.hide(m_configBtnBack, instant); + m_btnMgr.hide(m_configLblPage, instant); + m_btnMgr.hide(m_configBtnPageM, instant); + m_btnMgr.hide(m_configBtnPageP, instant); + // + m_btnMgr.hide(m_config4LblHome, instant); + m_btnMgr.hide(m_config4BtnHome, instant); + m_btnMgr.hide(m_config4LblSaveFavMode, instant); + m_btnMgr.hide(m_config4BtnSaveFavMode, instant); + m_btnMgr.hide(m_config4LblCategoryOnBoot, instant); + m_btnMgr.hide(m_config4BtnCategoryOnBoot, instant); + m_btnMgr.hide(m_config4LblReturnTo, instant); + m_btnMgr.hide(m_config4LblReturnToVal, instant); + m_btnMgr.hide(m_config4BtnReturnToM, instant); + m_btnMgr.hide(m_config4BtnReturnToP, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_config4LblUser); ++i) + if (m_config4LblUser[i] != -1u) + m_btnMgr.hide(m_config4LblUser[i], instant); +} + +void CMenu::_showConfig4(void) +{ + _setBg(m_config4Bg, m_config4Bg); + m_btnMgr.show(m_configLblTitle); + m_btnMgr.show(m_configBtnBack); + m_btnMgr.show(m_configLblPage); + m_btnMgr.show(m_configBtnPageM); + m_btnMgr.show(m_configBtnPageP); + // + m_btnMgr.show(m_config4LblHome); + m_btnMgr.show(m_config4BtnHome); + m_btnMgr.show(m_config4LblSaveFavMode); + m_btnMgr.show(m_config4BtnSaveFavMode); + m_btnMgr.show(m_config4LblCategoryOnBoot); + m_btnMgr.show(m_config4BtnCategoryOnBoot); + m_btnMgr.show(m_config4LblReturnTo); + m_btnMgr.show(m_config4LblReturnToVal); + m_btnMgr.show(m_config4BtnReturnToM); + m_btnMgr.show(m_config4BtnReturnToP); + + for (u32 i = 0; i < ARRAY_SIZE(m_config4LblUser); ++i) + if (m_config4LblUser[i] != -1u) + m_btnMgr.show(m_config4LblUser[i]); + + m_btnMgr.setText(m_configLblPage, wfmt(L"%i / %i", g_curPage, m_locked ? g_curPage : CMenu::_nbCfgPages)); + int i; + i = min(max(0, m_cfg.getInt("GENERAL", "exit_to", 0)), (int)ARRAY_SIZE(CMenu::_exitTo) - 1); + m_btnMgr.setText(m_config4BtnHome, _t(CMenu::_exitTo[i].id, CMenu::_exitTo[i].text)); + m_btnMgr.setText(m_config4BtnSaveFavMode, m_cfg.getBool("GENERAL", "favorites_on_startup") ? _t("on", L"On") : _t("off", L"Off")); + m_btnMgr.setText(m_config4BtnCategoryOnBoot, m_cat.getBool("GENERAL", "category_on_start") ? _t("on", L"On") : _t("off", L"Off")); + + Config titles, custom_titles; + titles.load(sfmt("%s/" TITLES_FILENAME, m_settingsDir.c_str()).c_str()); + custom_titles.load(sfmt("%s/" CTITLES_FILENAME, m_settingsDir.c_str()).c_str()); + + wstringEx channelName = m_loc.getWString(m_curLanguage, "disabled", L"Disabled"); + + string langCode = m_loc.getString(m_curLanguage, "gametdb_code", "EN"); + + Nand::Instance()->Disable_Emu(); + + m_channels.Init(0x00010001, langCode, true); + amountOfChannels = m_channels.Count(); + + string currentChanId = m_cfg.getString("GENERAL", "returnto" ); + if (currentChanId.size() > 0) + { + for (int i = 0; i < amountOfChannels; i++) + { + if (currentChanId == m_channels.GetId(i)) + { + channelName = custom_titles.getWString("TITLES", currentChanId, titles.getWString("TITLES", currentChanId, m_channels.GetName(i))); + break; + } + } + } + + Nand::Instance()->Enable_Emu(); + + m_btnMgr.setText(m_config4LblReturnToVal, channelName); +} + +int CMenu::_config4(void) +{ + int nextPage = 0; + + _showConfig4(); + while (true) + { + _mainLoopCommon(); + if (BTN_HOME_PRESSED || BTN_B_PRESSED) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if (BTN_LEFT_PRESSED || BTN_MINUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageM))) + { + nextPage = max(1, m_locked ? 1 : g_curPage - 1); + if(BTN_LEFT_PRESSED || BTN_MINUS_PRESSED) m_btnMgr.click(m_configBtnPageM); + break; + } + if (!m_locked && (BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageP)))) + { + nextPage = min(g_curPage + 1, CMenu::_nbCfgPages); + if(BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED) m_btnMgr.click(m_configBtnPageP); + break; + } + if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_configBtnBack)) + break; + else if (m_btnMgr.selected(m_config4BtnHome)) + { + int exit_to = (int)loopNum((u32)m_cfg.getInt("GENERAL", "exit_to", 0) + 1, ARRAY_SIZE(CMenu::_exitTo)); + m_cfg.setInt("GENERAL", "exit_to", exit_to); + Sys_ExitTo(exit_to); + m_disable_exit = exit_to == 3; + _showConfig4(); + } + else if (m_btnMgr.selected(m_config4BtnSaveFavMode)) + { + m_cfg.setBool("GENERAL", "favorites_on_startup", !m_cfg.getBool("GENERAL", "favorites_on_startup")); + _showConfig4(); + } + else if (m_btnMgr.selected(m_config4BtnCategoryOnBoot)) + { + m_cat.setBool("GENERAL", "category_on_start", !m_cat.getBool("GENERAL", "category_on_start", false)); + _showConfig4(); + } + else if (m_btnMgr.selected(m_config4BtnReturnToP)) + { + currentChannelIndex = (currentChannelIndex >= amountOfChannels - 1) ? -1 : currentChannelIndex + 1; + if (currentChannelIndex == -1) + m_cfg.remove("GENERAL", "returnto"); + else + m_cfg.setString("GENERAL", "returnto", m_channels.GetId(currentChannelIndex)); + _showConfig4(); + } + else if (m_btnMgr.selected(m_config4BtnReturnToM)) + { + if (currentChannelIndex == -1) currentChannelIndex = amountOfChannels; + currentChannelIndex--; + if (currentChannelIndex == -1) + m_cfg.remove("GENERAL", "returnto"); + else + m_cfg.setString("GENERAL", "returnto", m_channels.GetId(currentChannelIndex)); + _showConfig4(); + } + } + } + _hideConfig4(); + return nextPage; +} + +void CMenu::_initConfig4Menu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_config4LblUser, ARRAY_SIZE(m_config4LblUser), "CONFIG4"); + m_config4Bg = _texture(theme.texSet, "CONFIG4/BG", "texture", theme.bg); + m_config4LblHome = _addLabel(theme, "CONFIG4/WIIMENU", theme.lblFont, L"", 40, 130, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_config4BtnHome = _addButton(theme, "CONFIG4/WIIMENU_BTN", theme.btnFont, L"", 400, 130, 200, 56, theme.btnFontColor); + m_config4LblSaveFavMode = _addLabel(theme, "CONFIG4/SAVE_FAVMODE", theme.lblFont, L"", 40, 190, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_config4BtnSaveFavMode = _addButton(theme, "CONFIG4/SAVE_FAVMODE_BTN", theme.btnFont, L"", 400, 190, 200, 56, theme.btnFontColor); + m_config4LblCategoryOnBoot = _addLabel(theme, "CONFIG4/CAT_ON_START", theme.lblFont, L"", 40, 250, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_config4BtnCategoryOnBoot = _addButton(theme, "CONFIG4/CAT_ON_START_BTN", theme.btnFont, L"", 400, 250, 200, 56, theme.btnFontColor); + m_config4LblReturnTo = _addLabel(theme, "CONFIG4/RETURN_TO", theme.lblFont, L"", 40, 310, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_config4LblReturnToVal = _addLabel(theme, "CONFIG4/RETURN_TO_BTN", theme.btnFont, L"", 426, 310, 118, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_config4BtnReturnToM = _addPicButton(theme, "CONFIG4/RETURN_TO_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 370, 310, 56, 56); + m_config4BtnReturnToP = _addPicButton(theme, "CONFIG4/RETURN_TO_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 310, 56, 56); +// + _setHideAnim(m_config4LblHome, "CONFIG4/WIIMENU", 100, 0, -2.f, 0.f); + _setHideAnim(m_config4BtnHome, "CONFIG4/WIIMENU_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_config4LblSaveFavMode, "CONFIG4/SAVE_FAVMODE", 100, 0, -2.f, 0.f); + _setHideAnim(m_config4BtnSaveFavMode, "CONFIG4/SAVE_FAVMODE_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_config4LblCategoryOnBoot, "CONFIG4/CAT_ON_START", 100, 0, -2.f, 0.f); + _setHideAnim(m_config4BtnCategoryOnBoot, "CONFIG4/CAT_ON_START_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_config4LblReturnTo, "CONFIG4/RETURN_TO", 100, 0, -2.f, 0.f); + _setHideAnim(m_config4LblReturnToVal, "CONFIG4/RETURN_TO_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_config4BtnReturnToM, "CONFIG4/RETURN_TO_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_config4BtnReturnToP, "CONFIG4/RETURN_TO_PLUS", 0, 0, 1.f, -1.f); + _hideConfig4(true); + _textConfig4(); +} + +void CMenu::_textConfig4(void) +{ + m_btnMgr.setText(m_config4LblHome, _t("cfgc1", L"Exit To")); + m_btnMgr.setText(m_config4LblSaveFavMode, _t("cfgd5", L"Save favorite mode state")); + m_btnMgr.setText(m_config4LblCategoryOnBoot, _t("cfgd7", L"Show categories on boot")); + m_btnMgr.setText(m_config4LblReturnTo, _t("cfgg21", L"Return To Channel")); +} diff --git a/source/menu/menu_config_adv.cpp b/source/menu/menu_config_adv.cpp new file mode 100644 index 00000000..ff2448ee --- /dev/null +++ b/source/menu/menu_config_adv.cpp @@ -0,0 +1,251 @@ + +#include "menu.hpp" +#include "wbfs.h" + +#include +#include +#include +#include +#include + +using namespace std; + +static const int g_curPage = 2; + +template static inline T loopNum(T i, T s) +{ + return (i + s) % s; +} + +void CMenu::_hideConfigAdv(bool instant) +{ + m_btnMgr.hide(m_configLblTitle, instant); + m_btnMgr.hide(m_configBtnBack, instant); + m_btnMgr.hide(m_configLblPage, instant); + m_btnMgr.hide(m_configBtnPageM, instant); + m_btnMgr.hide(m_configBtnPageP, instant); + // + m_btnMgr.hide(m_configAdvLblInstall, instant); + m_btnMgr.hide(m_configAdvBtnInstall, instant); + m_btnMgr.hide(m_configAdvLblTheme, instant); + m_btnMgr.hide(m_configAdvLblCurTheme, instant); + m_btnMgr.hide(m_configAdvBtnCurThemeM, instant); + m_btnMgr.hide(m_configAdvBtnCurThemeP, instant); + m_btnMgr.hide(m_configAdvLblLanguage, instant); + m_btnMgr.hide(m_configAdvLblCurLanguage, instant); + m_btnMgr.hide(m_configAdvBtnCurLanguageM, instant); + m_btnMgr.hide(m_configAdvBtnCurLanguageP, instant); + m_btnMgr.hide(m_configAdvLblCFTheme, instant); + m_btnMgr.hide(m_configAdvBtnCFTheme, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_configAdvLblUser); ++i) + if (m_configAdvLblUser[i] != -1u) + m_btnMgr.hide(m_configAdvLblUser[i], instant); +} + +void CMenu::_showConfigAdv(void) +{ + _setBg(m_configAdvBg, m_configAdvBg); + m_btnMgr.show(m_configLblTitle); + m_btnMgr.show(m_configBtnBack); + m_btnMgr.show(m_configLblPage); + m_btnMgr.show(m_configBtnPageM); + m_btnMgr.show(m_configBtnPageP); + // + m_btnMgr.show(m_configAdvLblCurTheme); + m_btnMgr.show(m_configAdvBtnCurThemeM); + m_btnMgr.show(m_configAdvBtnCurThemeP); + m_btnMgr.show(m_configAdvLblTheme); + if( !m_locked ) + { + m_btnMgr.show(m_configAdvLblInstall); + m_btnMgr.show(m_configAdvBtnInstall); + m_btnMgr.show(m_configAdvLblLanguage); + m_btnMgr.show(m_configAdvLblCurLanguage); + m_btnMgr.show(m_configAdvBtnCurLanguageM); + m_btnMgr.show(m_configAdvBtnCurLanguageP); + m_btnMgr.show(m_configAdvLblCFTheme); + m_btnMgr.show(m_configAdvBtnCFTheme); + } + for (u32 i = 0; i < ARRAY_SIZE(m_configAdvLblUser); ++i) + if (m_configAdvLblUser[i] != -1u) + m_btnMgr.show(m_configAdvLblUser[i]); + // + m_btnMgr.setText(m_configLblPage, wfmt(L"%i / %i", g_curPage, m_locked ? g_curPage : CMenu::_nbCfgPages)); + m_btnMgr.setText(m_configAdvLblCurLanguage, m_curLanguage); + m_btnMgr.setText(m_configAdvLblCurTheme, m_cfg.getString("GENERAL", "theme")); +} + +static void listThemes(const char * path, safe_vector &themes) +{ + DIR *d; + struct dirent *dir; + bool def = false; + + themes.clear(); + d = opendir(path); + if (d != 0) + { + dir = readdir(d); + while (dir != 0) + { + string fileName = upperCase(dir->d_name); + def = def || fileName == "DEFAULT.INI"; + if (fileName.size() > 4 && fileName.substr(fileName.size() - 4, 4) == ".INI") + themes.push_back(fileName.substr(0, fileName.size() - 4)); + dir = readdir(d); + } + closedir(d); + } + if (!def) + themes.push_back("DEFAULT"); + sort(themes.begin(), themes.end()); +} + +int CMenu::_configAdv(void) +{ + int nextPage = 0; + safe_vector themes; + string prevTheme = m_cfg.getString("GENERAL", "theme"); + + bool lang_changed = false; + + listThemes(m_themeDir.c_str(), themes); + int curTheme = 0; + for (u32 i = 0; i < themes.size(); ++i) + if (themes[i] == prevTheme) + { + curTheme = i; + break; + } + _showConfigAdv(); + while (true) + { + _mainLoopCommon(); + if (BTN_HOME_PRESSED || BTN_B_PRESSED) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if (BTN_LEFT_PRESSED || BTN_MINUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageM))) + { + nextPage = max(1, m_locked ? 1 : g_curPage - 1); + if(BTN_LEFT_PRESSED || BTN_MINUS_PRESSED) m_btnMgr.click(m_configBtnPageM); + break; + } + if (!m_locked && (BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageP)))) + { + nextPage = min(g_curPage + 1, CMenu::_nbCfgPages); + if(BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED) m_btnMgr.click(m_configBtnPageP); + break; + } + if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_configBtnBack)) + break; + else if (m_btnMgr.selected(m_configAdvBtnInstall)) + { + if (!m_locked) + { + _hideConfigAdv(); + _wbfsOp(CMenu::WO_ADD_GAME); + _showConfigAdv(); + } + } + else if (m_btnMgr.selected(m_configAdvBtnCurThemeP) || m_btnMgr.selected(m_configAdvBtnCurThemeM)) + { + s8 direction = m_btnMgr.selected(m_configAdvBtnCurThemeP) ? 1 : -1; + curTheme = loopNum(curTheme + direction, (int)themes.size()); + m_cfg.setString("GENERAL", "theme", themes[curTheme]); + _showConfigAdv(); + } + else if (m_btnMgr.selected(m_configAdvBtnCurLanguageP) || m_btnMgr.selected(m_configAdvBtnCurLanguageM)) + { + s8 direction = m_btnMgr.selected(m_configAdvBtnCurLanguageP) ? 1 : -1; + int lang = (int)loopNum((u32)m_cfg.getInt("GENERAL", "language", 0) + direction, ARRAY_SIZE(CMenu::_translations)); + m_curLanguage = CMenu::_translations[lang]; + if (m_loc.load(sfmt("%s/%s.ini", m_languagesDir.c_str(), m_curLanguage.c_str()).c_str())) + { + m_cfg.setInt("GENERAL", "language", lang); + lang_changed = true; + } + else + { + while (lang !=0) + { + lang = (int)loopNum((u32)lang + direction, ARRAY_SIZE(CMenu::_translations)); + m_curLanguage = CMenu::_translations[lang]; + struct stat langs; + if (stat(sfmt("%s/%s.ini", m_languagesDir.c_str(), m_curLanguage.c_str()).c_str(), &langs) == 0) + break; + } + m_cfg.setInt("GENERAL", "language", lang); + lang_changed = true; + m_curLanguage = CMenu::_translations[lang]; + m_loc.load(sfmt("%s/%s.ini", m_languagesDir.c_str(), m_curLanguage.c_str()).c_str()); + } + _updateText(); + _showConfigAdv(); + } + else if (m_btnMgr.selected(m_configAdvBtnCFTheme)) + { + _hideConfigAdv(); + _cfTheme(); + _showConfigAdv(); + } + } + } + _hideConfigAdv(); + if (m_gameList.empty() || lang_changed) + { + if(lang_changed) + m_gameList.SetLanguage(m_loc.getString(m_curLanguage, "gametdb_code", "EN").c_str()); + _loadList(); + } + lang_changed = false; + + return nextPage; +} + +void CMenu::_initConfigAdvMenu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_configAdvLblUser, ARRAY_SIZE(m_configAdvLblUser), "CONFIG_ADV"); + m_configAdvBg = _texture(theme.texSet, "CONFIG_ADV/BG", "texture", theme.bg); + m_configAdvLblTheme = _addLabel(theme, "CONFIG_ADV/THEME", theme.lblFont, L"", 40, 130, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configAdvLblCurTheme = _addLabel(theme, "CONFIG_ADV/THEME_BTN", theme.btnFont, L"", 386, 130, 158, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configAdvBtnCurThemeM = _addPicButton(theme, "CONFIG_ADV/THEME_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 330, 130, 56, 56); + m_configAdvBtnCurThemeP = _addPicButton(theme, "CONFIG_ADV/THEME_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 130, 56, 56); + m_configAdvLblLanguage = _addLabel(theme, "CONFIG_ADV/LANGUAGE", theme.lblFont, L"", 40, 190, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configAdvLblCurLanguage = _addLabel(theme, "CONFIG_ADV/LANGUAGE_BTN", theme.btnFont, L"", 386, 190, 158, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configAdvBtnCurLanguageM = _addPicButton(theme, "CONFIG_ADV/LANGUAGE_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 330, 190, 56, 56); + m_configAdvBtnCurLanguageP = _addPicButton(theme, "CONFIG_ADV/LANGUAGE_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 190, 56, 56); + m_configAdvLblCFTheme = _addLabel(theme, "CONFIG_ADV/CUSTOMIZE_CF", theme.lblFont, L"", 40, 250, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configAdvBtnCFTheme = _addButton(theme, "CONFIG_ADV/CUSTOMIZE_CF_BTN", theme.btnFont, L"", 330, 250, 270, 56, theme.btnFontColor); + m_configAdvLblInstall = _addLabel(theme, "CONFIG_ADV/INSTALL", theme.lblFont, L"", 40, 310, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configAdvBtnInstall = _addButton(theme, "CONFIG_ADV/INSTALL_BTN", theme.btnFont, L"", 330, 310, 270, 56, theme.btnFontColor); + // + _setHideAnim(m_configAdvLblTheme, "CONFIG_ADV/THEME", 100, 0, -2.f, 0.f); + _setHideAnim(m_configAdvLblCurTheme, "CONFIG_ADV/THEME_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configAdvBtnCurThemeM, "CONFIG_ADV/THEME_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configAdvBtnCurThemeP, "CONFIG_ADV/THEME_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configAdvLblLanguage, "CONFIG_ADV/LANGUAGE", 100, 0, -2.f, 0.f); + _setHideAnim(m_configAdvLblCurLanguage, "CONFIG_ADV/LANGUAGE_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configAdvBtnCurLanguageM, "CONFIG_ADV/LANGUAGE_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configAdvBtnCurLanguageP, "CONFIG_ADV/LANGUAGE_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configAdvLblCFTheme, "CONFIG_ADV/CUSTOMIZE_CF", 100, 0, -2.f, 0.f); + _setHideAnim(m_configAdvBtnCFTheme, "CONFIG_ADV/CUSTOMIZE_CF_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configAdvLblInstall, "CONFIG_ADV/INSTALL", 100, 0, -2.f, 0.f); + _setHideAnim(m_configAdvBtnInstall, "CONFIG_ADV/INSTALL_BTN", 0, 0, 1.f, -1.f); + _hideConfigAdv(true); + _textConfigAdv(); +} + +void CMenu::_textConfigAdv(void) +{ + m_btnMgr.setText(m_configAdvLblTheme, _t("cfga7", L"Theme")); + m_btnMgr.setText(m_configAdvLblLanguage, _t("cfga6", L"Language")); + m_btnMgr.setText(m_configAdvLblCFTheme, _t("cfgc4", L"Adjust Coverflow")); + m_btnMgr.setText(m_configAdvBtnCFTheme, _t("cfgc5", L"Go")); + m_btnMgr.setText(m_configAdvLblInstall, _t("cfga2", L"Install game")); + m_btnMgr.setText(m_configAdvBtnInstall, _t("cfga3", L"Install")); +} diff --git a/source/menu/menu_config_game.cpp b/source/menu/menu_config_game.cpp new file mode 100644 index 00000000..44504b44 --- /dev/null +++ b/source/menu/menu_config_game.cpp @@ -0,0 +1,617 @@ +#include "loader/wbfs.h" +#include "libwbfs/wiidisc.h" +#include "menu.hpp" + +#include "loader/sys.h" +#include "gecko.h" + +#define ARRAY_SIZE(a) (sizeof a / sizeof a[0]) + +using namespace std; + +static inline int loopNum(int i, int s) +{ + return i < 0 ? (s - (-i % s)) % s : i % s; +} + +u8 m_gameSettingCategories[12]; +u32 g_numGCfPages = 3; + +void CMenu::_hideGameSettings(bool instant) +{ + m_btnMgr.hide(m_gameSettingsLblPage, instant); + m_btnMgr.hide(m_gameSettingsBtnPageM, instant); + m_btnMgr.hide(m_gameSettingsBtnPageP, instant); + m_btnMgr.hide(m_gameSettingsBtnBack, instant); + m_btnMgr.hide(m_gameSettingsLblTitle, instant); + m_btnMgr.hide(m_gameSettingsLblGameLanguage, instant); + m_btnMgr.hide(m_gameSettingsLblLanguage, instant); + m_btnMgr.hide(m_gameSettingsBtnLanguageP, instant); + m_btnMgr.hide(m_gameSettingsBtnLanguageM, instant); + m_btnMgr.hide(m_gameSettingsLblGameVideo, instant); + m_btnMgr.hide(m_gameSettingsLblVideo, instant); + m_btnMgr.hide(m_gameSettingsBtnVideoP, instant); + m_btnMgr.hide(m_gameSettingsBtnVideoM, instant); + m_btnMgr.hide(m_gameSettingsLblOcarina, instant); + m_btnMgr.hide(m_gameSettingsBtnOcarina, instant); + m_btnMgr.hide(m_gameSettingsLblCheat, instant); + m_btnMgr.hide(m_gameSettingsBtnCheat, instant); + m_btnMgr.hide(m_gameSettingsLblVipatch, instant); + m_btnMgr.hide(m_gameSettingsBtnVipatch, instant); + m_btnMgr.hide(m_gameSettingsLblCountryPatch, instant); + m_btnMgr.hide(m_gameSettingsBtnCountryPatch, instant); + m_btnMgr.hide(m_gameSettingsLblCover, instant); + m_btnMgr.hide(m_gameSettingsBtnCover, instant); + m_btnMgr.hide(m_gameSettingsLblPatchVidModes, instant); + m_btnMgr.hide(m_gameSettingsLblPatchVidModesVal, instant); + m_btnMgr.hide(m_gameSettingsBtnPatchVidModesM, instant); + m_btnMgr.hide(m_gameSettingsBtnPatchVidModesP, instant); + m_btnMgr.hide(m_gameSettingsLblHooktype, instant); + m_btnMgr.hide(m_gameSettingsLblHooktypeVal, instant); + m_btnMgr.hide(m_gameSettingsBtnHooktypeM, instant); + m_btnMgr.hide(m_gameSettingsBtnHooktypeP, instant); + m_btnMgr.hide(m_gameSettingsBtnCategoryMain, instant); + m_btnMgr.hide(m_gameSettingsLblCategoryMain, instant); + m_btnMgr.hide(m_gameSettingsBtnEmulation, instant); + m_btnMgr.hide(m_gameSettingsLblEmulation, instant); + m_btnMgr.hide(m_gameSettingsLblDebugger, instant); + m_btnMgr.hide(m_gameSettingsLblDebuggerV, instant); + m_btnMgr.hide(m_gameSettingsBtnDebuggerP, instant); + m_btnMgr.hide(m_gameSettingsBtnDebuggerM, instant); + + for (int i = 0; i < 12; ++i) { + m_btnMgr.hide(m_gameSettingsBtnCategory[i], instant); + m_btnMgr.hide(m_gameSettingsLblCategory[i], instant); + } + for (u32 i = 0; i < ARRAY_SIZE(m_gameSettingsLblUser); ++i) + if (m_gameSettingsLblUser[i] != -1u) + m_btnMgr.hide(m_gameSettingsLblUser[i], instant); +} + +wstringEx CMenu::_optBoolToString(int i) +{ + switch (i) + { + case 0: + return _t("off", L"Off"); + case 1: + return _t("on", L"On"); + default: + return _t("def", L"Default"); + } +} + +void CMenu::_showGameSettings(void) +{ + wstringEx title(_t("cfgg1", L"Settings")); + title += L" ["; + title += wstringEx(m_cf.getId()); + title += L"]"; + m_btnMgr.setText(m_gameSettingsLblTitle, title); + _setBg(m_gameSettingsBg, m_gameSettingsBg); + m_btnMgr.show(m_gameSettingsLblPage); + m_btnMgr.show(m_gameSettingsBtnPageM); + m_btnMgr.show(m_gameSettingsBtnPageP); + m_btnMgr.show(m_gameSettingsBtnBack); + m_btnMgr.show(m_gameSettingsLblTitle); + if (m_gameSettingsPage == 1) + { + m_btnMgr.show(m_gameSettingsLblCover); + m_btnMgr.show(m_gameSettingsBtnCover); + + m_btnMgr.show(m_gameSettingsBtnCategoryMain); + m_btnMgr.show(m_gameSettingsLblCategoryMain); + + m_btnMgr.show(m_gameSettingsLblGameLanguage); + m_btnMgr.show(m_gameSettingsLblLanguage); + m_btnMgr.show(m_gameSettingsBtnLanguageP); + m_btnMgr.show(m_gameSettingsBtnLanguageM); + + m_btnMgr.show(m_gameSettingsLblGameVideo); + m_btnMgr.show(m_gameSettingsLblVideo); + m_btnMgr.show(m_gameSettingsBtnVideoP); + m_btnMgr.show(m_gameSettingsBtnVideoM); + + } + else + { + m_btnMgr.hide(m_gameSettingsLblCover); + m_btnMgr.hide(m_gameSettingsBtnCover); + + m_btnMgr.hide(m_gameSettingsBtnCategoryMain); + m_btnMgr.hide(m_gameSettingsLblCategoryMain); + + m_btnMgr.hide(m_gameSettingsLblGameLanguage); + m_btnMgr.hide(m_gameSettingsLblLanguage); + m_btnMgr.hide(m_gameSettingsBtnLanguageP); + m_btnMgr.hide(m_gameSettingsBtnLanguageM); + + m_btnMgr.hide(m_gameSettingsLblGameVideo); + m_btnMgr.hide(m_gameSettingsLblVideo); + m_btnMgr.hide(m_gameSettingsBtnVideoP); + m_btnMgr.hide(m_gameSettingsBtnVideoM); + + } + if (m_gameSettingsPage == 2) + { + m_btnMgr.show(m_gameSettingsLblDebugger); + m_btnMgr.show(m_gameSettingsLblDebuggerV); + m_btnMgr.show(m_gameSettingsBtnDebuggerP); + m_btnMgr.show(m_gameSettingsBtnDebuggerM); + + m_btnMgr.show(m_gameSettingsLblHooktype); + m_btnMgr.show(m_gameSettingsLblHooktypeVal); + m_btnMgr.show(m_gameSettingsBtnHooktypeM); + m_btnMgr.show(m_gameSettingsBtnHooktypeP); + + m_btnMgr.show(m_gameSettingsLblOcarina); + m_btnMgr.show(m_gameSettingsBtnOcarina); + + m_btnMgr.show(m_gameSettingsLblCheat); + m_btnMgr.show(m_gameSettingsBtnCheat); + } + else + { + m_btnMgr.hide(m_gameSettingsLblDebugger); + m_btnMgr.hide(m_gameSettingsLblDebuggerV); + m_btnMgr.hide(m_gameSettingsBtnDebuggerP); + m_btnMgr.hide(m_gameSettingsBtnDebuggerM); + + m_btnMgr.hide(m_gameSettingsLblHooktype); + m_btnMgr.hide(m_gameSettingsLblHooktypeVal); + m_btnMgr.hide(m_gameSettingsBtnHooktypeM); + m_btnMgr.hide(m_gameSettingsBtnHooktypeP); + + m_btnMgr.hide(m_gameSettingsLblOcarina); + m_btnMgr.hide(m_gameSettingsBtnOcarina); + + m_btnMgr.hide(m_gameSettingsLblCheat); + m_btnMgr.hide(m_gameSettingsBtnCheat); + } + if (m_gameSettingsPage == 3) + { + + m_btnMgr.show(m_gameSettingsLblPatchVidModes); + m_btnMgr.show(m_gameSettingsLblPatchVidModesVal); + m_btnMgr.show(m_gameSettingsBtnPatchVidModesM); + m_btnMgr.show(m_gameSettingsBtnPatchVidModesP); + + m_btnMgr.show(m_gameSettingsLblVipatch); + m_btnMgr.show(m_gameSettingsBtnVipatch); + + m_btnMgr.show(m_gameSettingsLblCountryPatch); + m_btnMgr.show(m_gameSettingsBtnCountryPatch); + + if(!m_cfg.getBool("NAND", "disable", true) && m_current_view == COVERFLOW_USB) + { + m_btnMgr.show(m_gameSettingsBtnEmulation); + m_btnMgr.show(m_gameSettingsLblEmulation); + } + } + else + { + m_btnMgr.hide(m_gameSettingsLblPatchVidModes); + m_btnMgr.hide(m_gameSettingsLblPatchVidModesVal); + m_btnMgr.hide(m_gameSettingsBtnPatchVidModesM); + m_btnMgr.hide(m_gameSettingsBtnPatchVidModesP); + + m_btnMgr.hide(m_gameSettingsLblVipatch); + m_btnMgr.hide(m_gameSettingsBtnVipatch); + + m_btnMgr.hide(m_gameSettingsLblCountryPatch); + m_btnMgr.hide(m_gameSettingsBtnCountryPatch); + + + m_btnMgr.hide(m_gameSettingsBtnEmulation); + m_btnMgr.hide(m_gameSettingsLblEmulation); + } + + u32 i = 0; + + //Categories Pages + if (m_gameSettingsPage == 51) + { + for (i = 1; i < (u32)min(m_max_categories+1, 5); ++i) + { + m_btnMgr.show(m_gameSettingsBtnCategory[i]); + m_btnMgr.show(m_gameSettingsLblCategory[i]); + } + } + else + { + for (i = 1; i < 5; ++i) + { + m_btnMgr.hide(m_gameSettingsBtnCategory[i]); + m_btnMgr.hide(m_gameSettingsLblCategory[i]); + } + } + if (m_gameSettingsPage == 52) + { + for (i = 5; i < (u32)min(m_max_categories+1, 9); ++i) + { + m_btnMgr.show(m_gameSettingsBtnCategory[i]); + m_btnMgr.show(m_gameSettingsLblCategory[i]); + } + } + else + { + for (i = 5; i < 9; ++i) + { + m_btnMgr.hide(m_gameSettingsBtnCategory[i]); + m_btnMgr.hide(m_gameSettingsLblCategory[i]); + } + } + if (m_gameSettingsPage == 53) + { + for (i = 9; i < (u32)min(m_max_categories+1, 12);++i) + { + m_btnMgr.show(m_gameSettingsBtnCategory[i]); + m_btnMgr.show(m_gameSettingsLblCategory[i]); + } + } + else + { + for (i = 9; i < 12; ++i) + { + m_btnMgr.hide(m_gameSettingsBtnCategory[i]); + m_btnMgr.hide(m_gameSettingsLblCategory[i]); + } + } + + for (i = 0; i < ARRAY_SIZE(m_gameSettingsLblUser); ++i) + if (m_gameSettingsLblUser[i] != -1u) + m_btnMgr.show(m_gameSettingsLblUser[i]); + + string id(m_cf.getId()); + int page = m_gameSettingsPage; + + u32 maxpage = 3; + if (m_gameSettingsPage > maxpage) + page = m_gameSettingsPage-50; + + m_btnMgr.setText(m_gameSettingsLblPage, wfmt(L"%i / %i", page, maxpage)); + m_btnMgr.setText(m_gameSettingsBtnOcarina, _optBoolToString(m_gcfg2.getOptBool(id, "cheat"))); + m_btnMgr.setText(m_gameSettingsBtnVipatch, _optBoolToString(m_gcfg2.getOptBool(id, "vipatch", 0))); + m_btnMgr.setText(m_gameSettingsBtnCountryPatch, _optBoolToString(m_gcfg2.getOptBool(id, "country_patch", 0))); + i = min((u32)m_gcfg2.getInt(id, "video_mode", 0), ARRAY_SIZE(CMenu::_videoModes) - 1u); + m_btnMgr.setText(m_gameSettingsLblVideo, _t(CMenu::_videoModes[i].id, CMenu::_videoModes[i].text)); + i = min((u32)m_gcfg2.getInt(id, "language", 0), ARRAY_SIZE(CMenu::_languages) - 1u); + m_btnMgr.setText(m_gameSettingsLblLanguage, _t(CMenu::_languages[i].id, CMenu::_languages[i].text)); + + i = min((u32)m_gcfg2.getInt(id, "patch_video_modes", 0), ARRAY_SIZE(CMenu::_vidModePatch) - 1u); + m_btnMgr.setText(m_gameSettingsLblPatchVidModesVal, _t(CMenu::_vidModePatch[i].id, CMenu::_vidModePatch[i].text)); + + i = min((u32)m_gcfg2.getInt(id, "hooktype", 1), ARRAY_SIZE(CMenu::_hooktype) - 1u); + m_btnMgr.setText(m_gameSettingsLblHooktypeVal, _t(CMenu::_hooktype[i].id, CMenu::_hooktype[i].text)); + + m_btnMgr.setText(m_gameSettingsBtnCategoryMain, _fmt("cfgg16", wfmt(L"Select",i).c_str() )); + + char *categories = (char *) m_cat.getString("CATEGORIES", id, "").c_str(); + memset(&m_gameSettingCategories, '0', sizeof(m_gameSettingCategories)); + if (strlen(categories) == sizeof(m_gameSettingCategories)) + memcpy(&m_gameSettingCategories, categories, sizeof(m_gameSettingCategories)); + for (int i=0; i<12; ++i) + m_btnMgr.setText(m_gameSettingsBtnCategory[i], _optBoolToString(m_gameSettingCategories[i] == '1')); + + m_btnMgr.setText(m_gameSettingsBtnEmulation, _optBoolToString(m_gcfg2.getBool(id, "emulate_save"))); + m_btnMgr.setText(m_gameSettingsLblDebuggerV, m_gcfg2.getBool(id, "debugger", false) ? _t("gecko", L"Gecko") : _t("def", L"Default")); +} + +void CMenu::_gameSettings(void) +{ + m_gcfg2.load(sfmt("%s/gameconfig2.ini", m_settingsDir.c_str()).c_str()); + string id(m_cf.getId()); + + m_gameSettingsPage = 1; + _showGameSettings(); + while (true) + { + _mainLoopCommon(); + if (BTN_HOME_PRESSED || BTN_B_PRESSED) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if ((BTN_MINUS_PRESSED || BTN_LEFT_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_gameSettingsBtnPageM))) && !m_locked) + { + if (m_gameSettingsPage == 1) + m_gameSettingsPage = g_numGCfPages; + else if (m_gameSettingsPage == 51) + m_gameSettingsPage = 53; + else if ((m_gameSettingsPage > 1 && m_gameSettingsPage <= g_numGCfPages) || m_gameSettingsPage > 51) + --m_gameSettingsPage; + if(BTN_LEFT_PRESSED || BTN_MINUS_PRESSED) m_btnMgr.click(m_gameSettingsBtnPageM); + _showGameSettings(); + } + else if ((BTN_PLUS_PRESSED || BTN_RIGHT_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_gameSettingsBtnPageP))) && !m_locked) + { + if (m_gameSettingsPage == g_numGCfPages) + m_gameSettingsPage = 1; + else if (m_gameSettingsPage == 53) + m_gameSettingsPage = 51; + else if (m_gameSettingsPage < g_numGCfPages || (m_gameSettingsPage > g_numGCfPages && m_gameSettingsPage < 53 && m_max_categories > 8) + || (m_gameSettingsPage > g_numGCfPages && m_gameSettingsPage < 52 && m_max_categories > 3)) + ++m_gameSettingsPage; + if(BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED) m_btnMgr.click(m_gameSettingsBtnPageP); + _showGameSettings(); + } + else if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_gameSettingsBtnBack)) + break; + else if (m_btnMgr.selected(m_gameSettingsBtnOcarina)) + { + int intoption = loopNum(m_gcfg2.getBool(id, "cheat") + 1, 3); + if (intoption > 1) + m_gcfg2.remove(id, "cheat"); + else + m_gcfg2.setOptBool(id, "cheat", intoption); + _showGameSettings(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnVipatch)) + { + bool booloption = m_gcfg2.getBool(id, "vipatch"); + if (booloption != false) + m_gcfg2.remove(id, "vipatch"); + else + m_gcfg2.setBool(id, "vipatch", true); + _showGameSettings(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnCountryPatch)) + { + bool booloption = m_gcfg2.getBool(id, "country_patch"); + if (booloption != false) + m_gcfg2.remove(id, "country_patch"); + else + m_gcfg2.setBool(id, "country_patch", true); + _showGameSettings(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnLanguageP) || m_btnMgr.selected(m_gameSettingsBtnLanguageM)) + { + s8 direction = m_btnMgr.selected(m_gameSettingsBtnLanguageP) ? 1 : -1; + m_gcfg2.setInt(id, "language", (int)loopNum((u32)m_gcfg2.getInt(id, "language", 0) + direction, ARRAY_SIZE(CMenu::_languages))); + _showGameSettings(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnVideoP) || m_btnMgr.selected(m_gameSettingsBtnVideoM)) + { + s8 direction = m_btnMgr.selected(m_gameSettingsBtnVideoP) ? 1 : -1; + m_gcfg2.setInt(id, "video_mode", (int)loopNum((u32)m_gcfg2.getInt(id, "video_mode", 0) + direction, ARRAY_SIZE(CMenu::_videoModes))); + _showGameSettings(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnPatchVidModesP) || m_btnMgr.selected(m_gameSettingsBtnPatchVidModesM)) + { + s8 direction = m_btnMgr.selected(m_gameSettingsBtnPatchVidModesP) ? 1 : -1; + m_gcfg2.setInt(id, "patch_video_modes", (int)loopNum((u32)m_gcfg2.getInt(id, "patch_video_modes", 0) + direction, ARRAY_SIZE(CMenu::_vidModePatch))); + _showGameSettings(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnCover)) + { + m_cf.stopCoverLoader(true); + _hideGameSettings(); + _download(id); + _showGameSettings(); + m_cf.startCoverLoader(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnCheat)) + { + _hideGameSettings(); + _CheatSettings(); + _showGameSettings(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnHooktypeP) || m_btnMgr.selected(m_gameSettingsBtnHooktypeM)) + { + s8 direction = m_btnMgr.selected(m_gameSettingsBtnHooktypeP) ? 1 : -1; + m_gcfg2.setInt(id, "hooktype", (int)loopNum((u32)m_gcfg2.getInt(id, "hooktype", 1) + direction, ARRAY_SIZE(CMenu::_hooktype))); + _showGameSettings(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnEmulation)) + { + _hideGameSettings(); + int intoption = loopNum(m_gcfg2.getOptBool(id, "emulate_save") + 1, 3); + if (intoption > 1) + m_gcfg2.remove(id, "emulate_save"); + else + m_gcfg2.setOptBool(id, "emulate_save", intoption); + _showGameSettings(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnDebuggerP) || m_btnMgr.selected(m_gameSettingsBtnDebuggerM)) + { + bool booloption = m_gcfg2.getBool(id, "debugger"); + if (booloption != false) + m_gcfg2.remove(id, "debugger"); + else + m_gcfg2.setBool(id, "debugger", true); + _showGameSettings(); + } + else if (m_btnMgr.selected(m_gameSettingsBtnCategoryMain)) + { + _hideGameSettings(); + m_gameSettingsPage = 51; + _showGameSettings(); + } + for (int i = 0; i < 12; ++i) + if (m_btnMgr.selected(m_gameSettingsBtnCategory[i])) + { + m_gameSettingCategories[i] = m_gameSettingCategories[i] == '1' ? '0' : '1'; + char categories[13]; + memset(&categories, 0, sizeof(categories)); + memcpy(&categories, &m_gameSettingCategories, sizeof(m_gameSettingCategories)); + m_cat.setString("CATEGORIES", id, categories); + _showGameSettings(); + break; + } + } + else if ((WBTN_2_HELD && WBTN_1_PRESSED) || (WBTN_1_HELD && WBTN_2_PRESSED)) + { + if (m_btnMgr.selected(m_gameSettingsBtnCover)) + { + m_cf.stopCoverLoader(true); // Empty cover cache + remove(fmt("%s/%s.png", m_picDir.c_str(), m_cf.getId().c_str())); + remove(fmt("%s/%s.png", m_boxPicDir.c_str(), m_cf.getId().c_str())); + remove(fmt("%s/%s.wfc", m_cacheDir.c_str(), m_cf.getId().c_str())); + m_cf.startCoverLoader(); + } + } + + } + m_gcfg2.save(true); + _hideGameSettings(); +} + +void CMenu::_initGameSettingsMenu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_gameSettingsLblUser, ARRAY_SIZE(m_gameSettingsLblUser), "GAME_SETTINGS"); + m_gameSettingsBg = _texture(theme.texSet, "GAME_SETTINGS/BG", "texture", theme.bg); + m_gameSettingsLblTitle = _addLabel(theme, "GAME_SETTINGS/TITLE", theme.titleFont, L"", 20, 30, 600, 60, theme.titleFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE); + // Page 1 + m_gameSettingsLblCover = _addLabel(theme, "GAME_SETTINGS/COVER", theme.lblFont, L"", 40, 130, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCover = _addButton(theme, "GAME_SETTINGS/COVER_BTN", theme.btnFont, L"", 330, 130, 270, 56, theme.btnFontColor); + m_gameSettingsLblCategoryMain = _addLabel(theme, "GAME_SETTINGS/CAT_MAIN", theme.lblFont, L"", 40, 190, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategoryMain = _addButton(theme, "GAME_SETTINGS/CAT_MAIN_BTN", theme.btnFont, L"", 330, 190, 270, 56, theme.btnFontColor); + + m_gameSettingsLblGameLanguage = _addLabel(theme, "GAME_SETTINGS/GAME_LANG", theme.lblFont, L"", 40, 250, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsLblLanguage = _addLabel(theme, "GAME_SETTINGS/GAME_LANG_BTN", theme.btnFont, L"", 386, 250, 158, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_gameSettingsBtnLanguageM = _addPicButton(theme, "GAME_SETTINGS/GAME_LANG_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 330, 250, 56, 56); + m_gameSettingsBtnLanguageP = _addPicButton(theme, "GAME_SETTINGS/GAME_LANG_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 250, 56, 56); + + m_gameSettingsLblGameVideo = _addLabel(theme, "GAME_SETTINGS/VIDEO", theme.lblFont, L"", 40, 310, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsLblVideo = _addLabel(theme, "GAME_SETTINGS/VIDEO_BTN", theme.btnFont, L"", 386, 310, 158, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_gameSettingsBtnVideoM = _addPicButton(theme, "GAME_SETTINGS/VIDEO_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 330, 310, 56, 56); + m_gameSettingsBtnVideoP = _addPicButton(theme, "GAME_SETTINGS/VIDEO_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 310, 56, 56); + + // Page 2 + m_gameSettingsLblDebugger = _addLabel(theme, "GAME_SETTINGS/GAME_DEBUGGER", theme.lblFont, L"", 40, 130, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsLblDebuggerV = _addLabel(theme, "GAME_SETTINGS/GAME_DEBUGGER_BTN", theme.btnFont, L"", 386, 130, 158, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_gameSettingsBtnDebuggerM = _addPicButton(theme, "GAME_SETTINGS/GAME_DEBUGGER_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 330, 130, 56, 56); + m_gameSettingsBtnDebuggerP = _addPicButton(theme, "GAME_SETTINGS/GAME_DEBUGGER_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 130, 56, 56); + m_gameSettingsLblHooktype = _addLabel(theme, "GAME_SETTINGS/HOOKTYPE", theme.lblFont, L"", 40, 190, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsLblHooktypeVal = _addLabel(theme, "GAME_SETTINGS/HOOKTYPE_BTN", theme.btnFont, L"", 386, 190, 158, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_gameSettingsBtnHooktypeM = _addPicButton(theme, "GAME_SETTINGS/HOOKTYPE_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 330, 190, 56, 56); + m_gameSettingsBtnHooktypeP = _addPicButton(theme, "GAME_SETTINGS/HOOKTYPE_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 190, 56, 56); + m_gameSettingsLblOcarina = _addLabel(theme, "GAME_SETTINGS/OCARINA", theme.lblFont, L"", 40, 250, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnOcarina = _addButton(theme, "GAME_SETTINGS/OCARINA_BTN", theme.btnFont, L"", 330, 250, 270, 56, theme.btnFontColor); + m_gameSettingsLblCheat = _addLabel(theme, "GAME_SETTINGS/CHEAT", theme.lblFont, L"", 40, 310, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCheat = _addButton(theme, "GAME_SETTINGS/CHEAT_BTN", theme.btnFont, L"", 330, 310, 270, 56, theme.btnFontColor); + // Page 3 + m_gameSettingsLblCountryPatch = _addLabel(theme, "GAME_SETTINGS/COUNTRY_PATCH", theme.lblFont, L"", 40, 130, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCountryPatch = _addButton(theme, "GAME_SETTINGS/COUNTRY_PATCH_BTN", theme.btnFont, L"", 380, 130, 220, 56, theme.btnFontColor); + m_gameSettingsLblVipatch = _addLabel(theme, "GAME_SETTINGS/VIPATCH", theme.lblFont, L"", 40, 190, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnVipatch = _addButton(theme, "GAME_SETTINGS/VIPATCH_BTN", theme.btnFont, L"", 380, 190, 220, 56, theme.btnFontColor); + m_gameSettingsLblPatchVidModes = _addLabel(theme, "GAME_SETTINGS/PATCH_VIDEO_MODE", theme.lblFont, L"", 40, 250, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsLblPatchVidModesVal = _addLabel(theme, "GAME_SETTINGS/PATCH_VIDEO_MODE_BTN", theme.btnFont, L"", 386, 250, 158, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_gameSettingsBtnPatchVidModesM = _addPicButton(theme, "GAME_SETTINGS/PATCH_VIDEO_MODE_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 330, 250, 56, 56); + m_gameSettingsBtnPatchVidModesP = _addPicButton(theme, "GAME_SETTINGS/PATCH_VIDEO_MODE_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 250, 56, 56); + m_gameSettingsLblEmulation = _addLabel(theme, "GAME_SETTINGS/EMU_SAVE", theme.lblFont, L"", 40, 310, 270, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnEmulation = _addButton(theme, "GAME_SETTINGS/EMU_SAVE_BTN", theme.btnFont, L"", 330, 310, 270, 56, theme.btnFontColor); + + //Categories Page 1 + //m_gameSettingsLblCategory[0] = _addLabel(theme, "GAME_SETTINGS/CAT_ALL", theme.lblFont, L"All", 40, 130, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + //m_gameSettingsBtnCategory[0] = _addButton(theme, "GAME_SETTINGS/CAT_ALL_BTN", theme.btnFont, L"", 330, 130, 270, 56, theme.btnFontColor); + + m_gameSettingsLblCategory[1] = _addLabel(theme, "GAME_SETTINGS/CAT_1", theme.lblFont, L"", 40, 130, 190, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[1] = _addButton(theme, "GAME_SETTINGS/CAT_1_BTN", theme.btnFont, L"", 330, 130, 270, 56, theme.btnFontColor); + m_gameSettingsLblCategory[2] = _addLabel(theme, "GAME_SETTINGS/CAT_2", theme.lblFont, L"", 40, 190, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[2] = _addButton(theme, "GAME_SETTINGS/CAT_2_BTN", theme.btnFont, L"", 330, 190, 270, 56, theme.btnFontColor); + m_gameSettingsLblCategory[3] = _addLabel(theme, "GAME_SETTINGS/CAT_3", theme.lblFont, L"", 40, 250, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[3] = _addButton(theme, "GAME_SETTINGS/CAT_3_BTN", theme.btnFont, L"", 330, 250, 270, 56, theme.btnFontColor); + m_gameSettingsLblCategory[4] = _addLabel(theme, "GAME_SETTINGS/CAT_4", theme.lblFont, L"", 40, 310, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[4] = _addButton(theme, "GAME_SETTINGS/CAT_4_BTN", theme.btnFont, L"", 330, 310, 270, 56, theme.btnFontColor); + + //Categories Page 2 + m_gameSettingsLblCategory[5] = _addLabel(theme, "GAME_SETTINGS/CAT_5", theme.lblFont, L"", 40, 130, 190, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[5] = _addButton(theme, "GAME_SETTINGS/CAT_5_BTN", theme.btnFont, L"", 330, 130, 270, 56, theme.btnFontColor); + m_gameSettingsLblCategory[6] = _addLabel(theme, "GAME_SETTINGS/CAT_6", theme.lblFont, L"", 40, 190, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[6] = _addButton(theme, "GAME_SETTINGS/CAT_6_BTN", theme.btnFont, L"", 330, 190, 270, 56, theme.btnFontColor); + m_gameSettingsLblCategory[7] = _addLabel(theme, "GAME_SETTINGS/CAT_7", theme.lblFont, L"", 40, 250, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[7] = _addButton(theme, "GAME_SETTINGS/CAT_7_BTN", theme.btnFont, L"", 330, 250, 270, 56, theme.btnFontColor); + m_gameSettingsLblCategory[8] = _addLabel(theme, "GAME_SETTINGS/CAT_8", theme.lblFont, L"", 40, 310, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[8] = _addButton(theme, "GAME_SETTINGS/CAT_8_BTN", theme.btnFont, L"", 330, 310, 270, 56, theme.btnFontColor); + + //Categories Page 3 + m_gameSettingsLblCategory[9] = _addLabel(theme, "GAME_SETTINGS/CAT_9", theme.lblFont, L"", 40, 130, 190, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[9] = _addButton(theme, "GAME_SETTINGS/CAT_9_BTN", theme.btnFont, L"", 330, 130, 270, 56, theme.btnFontColor); + m_gameSettingsLblCategory[10] = _addLabel(theme, "GAME_SETTINGS/CAT_10", theme.lblFont, L"", 40, 190, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[10] = _addButton(theme, "GAME_SETTINGS/CAT_10_BTN", theme.btnFont, L"", 330, 190, 270, 56, theme.btnFontColor); + m_gameSettingsLblCategory[11] = _addLabel(theme, "GAME_SETTINGS/CAT_11", theme.lblFont, L"", 40, 250, 290, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_gameSettingsBtnCategory[11] = _addButton(theme, "GAME_SETTINGS/CAT_11_BTN", theme.btnFont, L"", 330, 250, 270, 56, theme.btnFontColor); + + // + m_gameSettingsLblPage = _addLabel(theme, "GAME_SETTINGS/PAGE_BTN", theme.btnFont, L"", 76, 410, 80, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_gameSettingsBtnPageM = _addPicButton(theme, "GAME_SETTINGS/PAGE_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 20, 410, 56, 56); + m_gameSettingsBtnPageP = _addPicButton(theme, "GAME_SETTINGS/PAGE_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 156, 410, 56, 56); + m_gameSettingsBtnBack = _addButton(theme, "GAME_SETTINGS/BACK_BTN", theme.btnFont, L"", 420, 410, 200, 56, theme.btnFontColor); + // + _setHideAnim(m_gameSettingsLblTitle, "GAME_SETTINGS/TITLE", 0, -200, 0.f, 1.f); + _setHideAnim(m_gameSettingsLblGameVideo, "GAME_SETTINGS/VIDEO", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblVideo, "GAME_SETTINGS/VIDEO_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnVideoM, "GAME_SETTINGS/VIDEO_MINUS", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnVideoP, "GAME_SETTINGS/VIDEO_PLUS", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblGameLanguage, "GAME_SETTINGS/GAME_LANG", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblLanguage, "GAME_SETTINGS/GAME_LANG_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnLanguageM, "GAME_SETTINGS/GAME_LANG_MINUS", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnLanguageP, "GAME_SETTINGS/GAME_LANG_PLUS", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblOcarina, "GAME_SETTINGS/OCARINA", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnOcarina, "GAME_SETTINGS/OCARINA_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblCheat, "GAME_SETTINGS/CHEAT", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnCheat, "GAME_SETTINGS/CHEAT_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblCountryPatch, "GAME_SETTINGS/COUNTRY_PATCH", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnCountryPatch, "GAME_SETTINGS/COUNTRY_PATCH_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblVipatch, "GAME_SETTINGS/VIPATCH", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnVipatch, "GAME_SETTINGS/VIPATCH_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblCover, "GAME_SETTINGS/COVER", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnCover, "GAME_SETTINGS/COVER_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblPage, "GAME_SETTINGS/PAGE_BTN", 0, 200, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnPageM, "GAME_SETTINGS/PAGE_MINUS", 0, 200, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnPageP, "GAME_SETTINGS/PAGE_PLUS", 0, 200, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnBack, "GAME_SETTINGS/BACK_BTN", 0, 200, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblPatchVidModes, "GAME_SETTINGS/PATCH_VIDEO_MODE", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblPatchVidModesVal, "GAME_SETTINGS/PATCH_VIDEO_MODE_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnPatchVidModesM, "GAME_SETTINGS/PATCH_VIDEO_MODE_MINUS", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnPatchVidModesP, "GAME_SETTINGS/PATCH_VIDEO_MODE_PLUS", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblHooktype, "GAME_SETTINGS/HOOKTYPE", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblHooktypeVal, "GAME_SETTINGS/HOOKTYPE_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnHooktypeM, "GAME_SETTINGS/HOOKTYPE_MINUS", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnHooktypeP, "GAME_SETTINGS/HOOKTYPE_PLUS", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblEmulation, "GAME_SETTINGS/EMU_SAVE", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnEmulation, "GAME_SETTINGS/EMU_SAVE_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblDebugger, "GAME_SETTINGS/GAME_DEBUGGER", -200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblDebuggerV, "GAME_SETTINGS/GAME_DEBUGGER_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnDebuggerM, "GAME_SETTINGS/GAME_DEBUGGER_MINUS", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsBtnDebuggerP, "GAME_SETTINGS/GAME_DEBUGGER_PLUS", 200, 0, 1.f, 0.f); + //Categories + _setHideAnim(m_gameSettingsBtnCategoryMain, "GAME_SETTINGS/CAT_MAIN_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblCategoryMain, "GAME_SETTINGS/CAT_MAIN", -200, 0, 1.f, 0.f); + //_setHideAnim(m_gameSettingsBtnCategory[0], "GAME_SETTINGS/CAT_ALL_BTN", 200, 0, 1.f, 0.f); + //_setHideAnim(m_gameSettingsLblCategory[0], "GAME_SETTINGS/CAT_ALL", -200, 0, 1.f, 0.f); + for (int i = 1; i < 12; ++i) { + _setHideAnim(m_gameSettingsBtnCategory[i], sfmt("GAME_SETTINGS/CAT_%i_BTN", i).c_str(), 200, 0, 1.f, 0.f); + _setHideAnim(m_gameSettingsLblCategory[i], sfmt("GAME_SETTINGS/CAT_%i", i).c_str(), -200, 0, 1.f, 0.f); + } + + _hideGameSettings(true); + _textGameSettings(); +} + +void CMenu::_textGameSettings(void) +{ + m_btnMgr.setText(m_gameSettingsLblTitle, _t("cfgg1", L"Settings")); + m_btnMgr.setText(m_gameSettingsLblGameVideo, _t("cfgg2", L"Video mode")); + m_btnMgr.setText(m_gameSettingsLblGameLanguage, _t("cfgg3", L"Language")); + m_btnMgr.setText(m_gameSettingsLblCountryPatch, _t("cfgg4", L"Patch country strings")); + m_btnMgr.setText(m_gameSettingsLblOcarina, _t("cfgg5", L"Ocarina")); + m_btnMgr.setText(m_gameSettingsLblVipatch, _t("cfgg7", L"Vipatch")); + m_btnMgr.setText(m_gameSettingsBtnBack, _t("cfgg8", L"Back")); + m_btnMgr.setText(m_gameSettingsLblCover, _t("cfgg12", L"Download cover")); + m_btnMgr.setText(m_gameSettingsBtnCover, _t("cfgg13", L"Download")); + m_btnMgr.setText(m_gameSettingsLblPatchVidModes, _t("cfgg14", L"Patch video modes")); + m_btnMgr.setText(m_gameSettingsLblCheat, _t("cfgg15", L"Cheat Codes")); + m_btnMgr.setText(m_gameSettingsBtnCheat, _t("cfgg16", L"Select")); + m_btnMgr.setText(m_gameSettingsLblCategoryMain, _t("cfgg17", L"Categories")); + m_btnMgr.setText(m_gameSettingsBtnCategoryMain, _t("cfgg16", L"Select")); + m_btnMgr.setText(m_gameSettingsLblHooktype, _t("cfgg18", L"Hook Type")); + m_btnMgr.setText(m_gameSettingsLblEmulation, _t("cfgg24", L"Savegame Emulation")); + m_btnMgr.setText(m_gameSettingsLblDebugger, _t("cfgg22", L"Debugger")); + for (int i = 1; i < 12; ++i) + m_btnMgr.setText(m_gameSettingsLblCategory[i], m_cat.getWString("GENERAL", fmt("cat%d",i), wfmt(L"Category %i",i).c_str())); +} \ No newline at end of file diff --git a/source/menu/menu_config_screen.cpp b/source/menu/menu_config_screen.cpp new file mode 100644 index 00000000..0cbfff27 --- /dev/null +++ b/source/menu/menu_config_screen.cpp @@ -0,0 +1,186 @@ + +#include "menu.hpp" + + +using namespace std; + +static const int g_curPage = 6; + +void CMenu::_hideConfigScreen(bool instant) +{ + m_btnMgr.hide(m_configLblTitle, instant); + m_btnMgr.hide(m_configBtnBack, instant); + m_btnMgr.hide(m_configLblPage, instant); + m_btnMgr.hide(m_configBtnPageM, instant); + m_btnMgr.hide(m_configBtnPageP, instant); + // + m_btnMgr.hide(m_configScreenLblTVHeight, instant); + m_btnMgr.hide(m_configScreenLblTVHeightVal, instant); + m_btnMgr.hide(m_configScreenBtnTVHeightP, instant); + m_btnMgr.hide(m_configScreenBtnTVHeightM, instant); + m_btnMgr.hide(m_configScreenLblTVWidth, instant); + m_btnMgr.hide(m_configScreenLblTVWidthVal, instant); + m_btnMgr.hide(m_configScreenBtnTVWidthP, instant); + m_btnMgr.hide(m_configScreenBtnTVWidthM, instant); + m_btnMgr.hide(m_configScreenLblTVX, instant); + m_btnMgr.hide(m_configScreenLblTVXVal, instant); + m_btnMgr.hide(m_configScreenBtnTVXM, instant); + m_btnMgr.hide(m_configScreenBtnTVXP, instant); + m_btnMgr.hide(m_configScreenLblTVY, instant); + m_btnMgr.hide(m_configScreenLblTVYVal, instant); + m_btnMgr.hide(m_configScreenBtnTVYM, instant); + m_btnMgr.hide(m_configScreenBtnTVYP, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_configScreenLblUser); ++i) + if (m_configScreenLblUser[i] != -1u) + m_btnMgr.hide(m_configScreenLblUser[i], instant); +} + +void CMenu::_showConfigScreen(void) +{ + _setBg(m_configScreenBg, m_configScreenBg); + m_btnMgr.show(m_configLblTitle); + m_btnMgr.show(m_configBtnBack); + m_btnMgr.show(m_configLblPage); + m_btnMgr.show(m_configBtnPageM); + m_btnMgr.show(m_configBtnPageP); + // + m_btnMgr.show(m_configScreenLblTVHeight); + m_btnMgr.show(m_configScreenLblTVHeightVal); + m_btnMgr.show(m_configScreenBtnTVHeightP); + m_btnMgr.show(m_configScreenBtnTVHeightM); + m_btnMgr.show(m_configScreenLblTVWidth); + m_btnMgr.show(m_configScreenLblTVWidthVal); + m_btnMgr.show(m_configScreenBtnTVWidthP); + m_btnMgr.show(m_configScreenBtnTVWidthM); + m_btnMgr.show(m_configScreenLblTVX); + m_btnMgr.show(m_configScreenLblTVXVal); + m_btnMgr.show(m_configScreenBtnTVXM); + m_btnMgr.show(m_configScreenBtnTVXP); + m_btnMgr.show(m_configScreenLblTVY); + m_btnMgr.show(m_configScreenLblTVYVal); + m_btnMgr.show(m_configScreenBtnTVYM); + m_btnMgr.show(m_configScreenBtnTVYP); + for (u32 i = 0; i < ARRAY_SIZE(m_configScreenLblUser); ++i) + if (m_configScreenLblUser[i] != -1u) + m_btnMgr.show(m_configScreenLblUser[i]); + // + m_btnMgr.setText(m_configLblPage, wfmt(L"%i / %i", g_curPage, m_locked ? g_curPage : CMenu::_nbCfgPages)); + m_btnMgr.setText(m_configScreenLblTVWidthVal, wfmt(L"%i", 640 * 640 / max(1, m_cfg.getInt("GENERAL", "tv_width", 640)))); + m_btnMgr.setText(m_configScreenLblTVHeightVal, wfmt(L"%i", 480 * 480 / max(1, m_cfg.getInt("GENERAL", "tv_height", 480)))); + m_btnMgr.setText(m_configScreenLblTVXVal, wfmt(L"%i", -m_cfg.getInt("GENERAL", "tv_x", 0))); + m_btnMgr.setText(m_configScreenLblTVYVal, wfmt(L"%i", m_cfg.getInt("GENERAL", "tv_y", 0))); +} + +int CMenu::_configScreen(void) +{ + int nextPage = 0; + SetupInput(); + + _showConfigScreen(); + while (true) + { + _mainLoopCommon(); + if (BTN_HOME_PRESSED || BTN_B_PRESSED) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if (BTN_LEFT_PRESSED || BTN_MINUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageM))) + { + nextPage = g_curPage == 1 && !m_locked ? CMenu::_nbCfgPages : max(1, m_locked ? 1 : g_curPage - 1); + if(BTN_LEFT_PRESSED || BTN_MINUS_PRESSED) m_btnMgr.click(m_configBtnPageM); + break; + } + if (BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageP))) + { + nextPage = (g_curPage == CMenu::_nbCfgPages) ? 1 : min(g_curPage + 1, CMenu::_nbCfgPages); + if(BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED) m_btnMgr.click(m_configBtnPageP); + break; + } + if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_configBtnBack)) + break; + } + if (BTN_A_REPEAT) + { + if (m_btnMgr.selected(m_configScreenBtnTVWidthP) || m_btnMgr.selected(m_configScreenBtnTVWidthM) + || m_btnMgr.selected(m_configScreenBtnTVHeightP) || m_btnMgr.selected(m_configScreenBtnTVHeightM) + || m_btnMgr.selected(m_configScreenBtnTVXP) || m_btnMgr.selected(m_configScreenBtnTVXM) + || m_btnMgr.selected(m_configScreenBtnTVYP) || m_btnMgr.selected(m_configScreenBtnTVYM)) + { + int step = 0; + if (m_btnMgr.selected(m_configScreenBtnTVWidthM) || m_btnMgr.selected(m_configScreenBtnTVHeightM)) + step = 2; + else if (m_btnMgr.selected(m_configScreenBtnTVWidthP) || m_btnMgr.selected(m_configScreenBtnTVHeightP)) + step = -2; + else if (m_btnMgr.selected(m_configScreenBtnTVXP) || m_btnMgr.selected(m_configScreenBtnTVYM)) + step = -1; + else if (m_btnMgr.selected(m_configScreenBtnTVXM) || m_btnMgr.selected(m_configScreenBtnTVYP)) + step = 1; + if (m_btnMgr.selected(m_configScreenBtnTVWidthM) || m_btnMgr.selected(m_configScreenBtnTVWidthP)) + m_cfg.setInt("GENERAL", "tv_width", min(max(512, m_cfg.getInt("GENERAL", "tv_width", 640) + step), 800)); + else if (m_btnMgr.selected(m_configScreenBtnTVHeightM) || m_btnMgr.selected(m_configScreenBtnTVHeightP)) + m_cfg.setInt("GENERAL", "tv_height", min(max(384, m_cfg.getInt("GENERAL", "tv_height", 480) + step), 600)); + else if (m_btnMgr.selected(m_configScreenBtnTVXP) || m_btnMgr.selected(m_configScreenBtnTVXM)) + m_cfg.setInt("GENERAL", "tv_x", min(max(-50, m_cfg.getInt("GENERAL", "tv_x", 0) + step), 50)); + else if (m_btnMgr.selected(m_configScreenBtnTVYP) || m_btnMgr.selected(m_configScreenBtnTVYM)) + m_cfg.setInt("GENERAL", "tv_y", min(max(-30, m_cfg.getInt("GENERAL", "tv_y", 0) + step), 30)); + _showConfigScreen(); + m_vid.set2DViewport(m_cfg.getInt("GENERAL", "tv_width", 640), m_cfg.getInt("GENERAL", "tv_height", 480), m_cfg.getInt("GENERAL", "tv_x", 0), m_cfg.getInt("GENERAL", "tv_y", 0)); + } + } + } + _hideConfigScreen(); + return nextPage; +} + +void CMenu::_initConfigScreenMenu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_configScreenLblUser, ARRAY_SIZE(m_configScreenLblUser), "SCREEN"); + m_configScreenBg = _texture(theme.texSet, "SCREEN/BG", "texture", theme.bg); + m_configScreenLblTVWidth = _addLabel(theme, "SCREEN/TVWIDTH", theme.lblFont, L"", 40, 130, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configScreenLblTVWidthVal = _addLabel(theme, "SCREEN/TVWIDTH_BTN", theme.btnFont, L"", 426, 130, 118, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configScreenBtnTVWidthM = _addPicButton(theme, "SCREEN/TVWIDTH_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 370, 130, 56, 56); + m_configScreenBtnTVWidthP = _addPicButton(theme, "SCREEN/TVWIDTH_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 130, 56, 56); + m_configScreenLblTVHeight = _addLabel(theme, "SCREEN/TVHEIGHT", theme.lblFont, L"", 40, 190, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configScreenLblTVHeightVal = _addLabel(theme, "SCREEN/TVHEIGHT_BTN", theme.btnFont, L"", 426, 190, 118, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configScreenBtnTVHeightM = _addPicButton(theme, "SCREEN/TVHEIGHT_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 370, 190, 56, 56); + m_configScreenBtnTVHeightP = _addPicButton(theme, "SCREEN/TVHEIGHT_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 190, 56, 56); + m_configScreenLblTVX = _addLabel(theme, "SCREEN/TVX", theme.lblFont, L"", 40, 250, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configScreenLblTVXVal = _addLabel(theme, "SCREEN/TVX_BTN", theme.btnFont, L"", 426, 250, 118, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configScreenBtnTVXM = _addPicButton(theme, "SCREEN/TVX_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 370, 250, 56, 56); + m_configScreenBtnTVXP = _addPicButton(theme, "SCREEN/TVX_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 250, 56, 56); + m_configScreenLblTVY = _addLabel(theme, "SCREEN/TVY", theme.lblFont, L"", 40, 310, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configScreenLblTVYVal = _addLabel(theme, "SCREEN/TVY_BTN", theme.btnFont, L"", 426, 310, 118, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configScreenBtnTVYM = _addPicButton(theme, "SCREEN/TVY_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 370, 310, 56, 56); + m_configScreenBtnTVYP = _addPicButton(theme, "SCREEN/TVY_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 310, 56, 56); + // + _setHideAnim(m_configScreenLblTVWidth, "SCREEN/TVWIDTH", 100, 0, -2.f, 0.f); + _setHideAnim(m_configScreenLblTVWidthVal, "SCREEN/TVWIDTH_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenBtnTVWidthM, "SCREEN/TVWIDTH_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenBtnTVWidthP, "SCREEN/TVWIDTH_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenLblTVHeight, "SCREEN/TVHEIGHT", 100, 0, -2.f, 0.f); + _setHideAnim(m_configScreenLblTVHeightVal, "SCREEN/TVHEIGHT_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenBtnTVHeightM, "SCREEN/TVHEIGHT_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenBtnTVHeightP, "SCREEN/TVHEIGHT_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenLblTVX, "SCREEN/TVX", 100, 0, -2.f, 0.f); + _setHideAnim(m_configScreenLblTVXVal, "SCREEN/TVX_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenBtnTVXM, "SCREEN/TVX_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenBtnTVXP, "SCREEN/TVX_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenLblTVY, "SCREEN/TVY", 100, 0, -2.f, 0.f); + _setHideAnim(m_configScreenLblTVYVal, "SCREEN/TVY_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenBtnTVYM, "SCREEN/TVY_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configScreenBtnTVYP, "SCREEN/TVY_PLUS", 0, 0, 1.f, -1.f); + _hideConfigScreen(true); + _textConfigScreen(); +} + +void CMenu::_textConfigScreen(void) +{ + m_btnMgr.setText(m_configScreenLblTVWidth, _t("cfgc2", L"Adjust TV width")); + m_btnMgr.setText(m_configScreenLblTVHeight, _t("cfgc3", L"Adjust TV height")); + m_btnMgr.setText(m_configScreenLblTVX, _t("cfgc6", L"Horizontal offset")); + m_btnMgr.setText(m_configScreenLblTVY, _t("cfgc7", L"Vertical offset")); +} diff --git a/source/menu/menu_configsnd.cpp b/source/menu/menu_configsnd.cpp new file mode 100644 index 00000000..94667aed --- /dev/null +++ b/source/menu/menu_configsnd.cpp @@ -0,0 +1,211 @@ + +#include "menu.hpp" + +using namespace std; + +static const int g_curPage = 5; + +void CMenu::_hideConfigSnd(bool instant) +{ + m_btnMgr.hide(m_configLblTitle, instant); + m_btnMgr.hide(m_configBtnBack, instant); + m_btnMgr.hide(m_configLblPage, instant); + m_btnMgr.hide(m_configBtnPageM, instant); + m_btnMgr.hide(m_configBtnPageP, instant); + // + m_btnMgr.hide(m_configSndLblBnrVol, instant); + m_btnMgr.hide(m_configSndLblBnrVolVal, instant); + m_btnMgr.hide(m_configSndBtnBnrVolP, instant); + m_btnMgr.hide(m_configSndBtnBnrVolM, instant); + m_btnMgr.hide(m_configSndLblMusicVol, instant); + m_btnMgr.hide(m_configSndLblMusicVolVal, instant); + m_btnMgr.hide(m_configSndBtnMusicVolP, instant); + m_btnMgr.hide(m_configSndBtnMusicVolM, instant); + m_btnMgr.hide(m_configSndLblGuiVol, instant); + m_btnMgr.hide(m_configSndLblGuiVolVal, instant); + m_btnMgr.hide(m_configSndBtnGuiVolP, instant); + m_btnMgr.hide(m_configSndBtnGuiVolM, instant); + m_btnMgr.hide(m_configSndLblCFVol, instant); + m_btnMgr.hide(m_configSndLblCFVolVal, instant); + m_btnMgr.hide(m_configSndBtnCFVolP, instant); + m_btnMgr.hide(m_configSndBtnCFVolM, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_configSndLblUser); ++i) + if (m_configSndLblUser[i] != -1u) + m_btnMgr.hide(m_configSndLblUser[i], instant); +} + +void CMenu::_showConfigSnd(void) +{ + _setBg(m_configSndBg, m_configSndBg); + m_btnMgr.show(m_configLblTitle); + m_btnMgr.show(m_configBtnBack); + m_btnMgr.show(m_configLblPage); + m_btnMgr.show(m_configBtnPageM); + m_btnMgr.show(m_configBtnPageP); + // + m_btnMgr.show(m_configSndLblBnrVol); + m_btnMgr.show(m_configSndLblBnrVolVal); + m_btnMgr.show(m_configSndBtnBnrVolP); + m_btnMgr.show(m_configSndBtnBnrVolM); + m_btnMgr.show(m_configSndLblMusicVol); + m_btnMgr.show(m_configSndLblMusicVolVal); + m_btnMgr.show(m_configSndBtnMusicVolP); + m_btnMgr.show(m_configSndBtnMusicVolM); + m_btnMgr.show(m_configSndLblGuiVol); + m_btnMgr.show(m_configSndLblGuiVolVal); + m_btnMgr.show(m_configSndBtnGuiVolP); + m_btnMgr.show(m_configSndBtnGuiVolM); + m_btnMgr.show(m_configSndLblCFVol); + m_btnMgr.show(m_configSndLblCFVolVal); + m_btnMgr.show(m_configSndBtnCFVolP); + m_btnMgr.show(m_configSndBtnCFVolM); + for (u32 i = 0; i < ARRAY_SIZE(m_configSndLblUser); ++i) + if (m_configSndLblUser[i] != -1u) + m_btnMgr.show(m_configSndLblUser[i]); + // + m_btnMgr.setText(m_configLblPage, wfmt(L"%i / %i", g_curPage, m_locked ? g_curPage : CMenu::_nbCfgPages)); + m_btnMgr.setText(m_configSndLblGuiVolVal, wfmt(L"%i", m_cfg.getInt("GENERAL", "sound_volume_gui", 255))); + m_btnMgr.setText(m_configSndLblCFVolVal, wfmt(L"%i", m_cfg.getInt("GENERAL", "sound_volume_coverflow", 255))); + m_btnMgr.setText(m_configSndLblMusicVolVal, wfmt(L"%i", m_cfg.getInt("GENERAL", "sound_volume_music", 255))); + m_btnMgr.setText(m_configSndLblBnrVolVal, wfmt(L"%i", m_cfg.getInt("GENERAL", "sound_volume_bnr", 255))); +} + +int CMenu::_configSnd(void) +{ + int nextPage = 0; + SetupInput(); + int step = 1; + + _showConfigSnd(); + while (true) + { + _mainLoopCommon(); + if (BTN_HOME_PRESSED || BTN_B_PRESSED) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if (BTN_LEFT_PRESSED || BTN_MINUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageM))) + { + nextPage = max(1, m_locked ? 1 : g_curPage - 1); + if(BTN_LEFT_PRESSED || BTN_MINUS_PRESSED) m_btnMgr.click(m_configBtnPageM); + break; + } + if (!m_locked && (BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED || (BTN_A_PRESSED && m_btnMgr.selected(m_configBtnPageP)))) + { + nextPage = min(g_curPage + 1, CMenu::_nbCfgPages); + if(BTN_RIGHT_PRESSED || BTN_PLUS_PRESSED) m_btnMgr.click(m_configBtnPageP); + break; + } + if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_configBtnBack)) + break; + } + if (BTN_A_REPEAT) + { + if (m_btnMgr.selected(m_configSndBtnBnrVolP)) + { + m_cfg.setInt("GENERAL", "sound_volume_bnr", min(m_cfg.getInt("GENERAL", "sound_volume_bnr", 255) + step, 255)); + _showConfigSnd(); + m_bnrSndVol = m_cfg.getInt("GENERAL", "sound_volume_bnr", 255); + } + else if (m_btnMgr.selected(m_configSndBtnBnrVolM)) + { + m_cfg.setInt("GENERAL", "sound_volume_bnr", max(m_cfg.getInt("GENERAL", "sound_volume_bnr", 255) - step, 0)); + _showConfigSnd(); + m_bnrSndVol = m_cfg.getInt("GENERAL", "sound_volume_bnr", 255); + } + else if (m_btnMgr.selected(m_configSndBtnGuiVolP)) + { + m_cfg.setInt("GENERAL", "sound_volume_gui", min(m_cfg.getInt("GENERAL", "sound_volume_gui", 255) + step, 255)); + _showConfigSnd(); + m_btnMgr.setSoundVolume(m_cfg.getInt("GENERAL", "sound_volume_gui", 255)); + } + else if (m_btnMgr.selected(m_configSndBtnGuiVolM)) + { + m_cfg.setInt("GENERAL", "sound_volume_gui", max(m_cfg.getInt("GENERAL", "sound_volume_gui", 255) - step, 0)); + _showConfigSnd(); + m_btnMgr.setSoundVolume(m_cfg.getInt("GENERAL", "sound_volume_gui", 255)); + } + else if (m_btnMgr.selected(m_configSndBtnMusicVolP)) + { + int musicVol = min(m_cfg.getInt("GENERAL", "sound_volume_music", 255) + step, 255); + m_cfg.setInt("GENERAL", "sound_volume_music", musicVol); + _showConfigSnd(); + MusicPlayer::Instance()->SetVolume(MusicPlayer::Instance()->GetVolume(), musicVol); + } + else if (m_btnMgr.selected(m_configSndBtnMusicVolM)) + { + int musicVol = max(m_cfg.getInt("GENERAL", "sound_volume_music", 255) - step, 0); + m_cfg.setInt("GENERAL", "sound_volume_music", musicVol); + _showConfigSnd(); + MusicPlayer::Instance()->SetVolume(MusicPlayer::Instance()->GetVolume(), musicVol); + } + else if (m_btnMgr.selected(m_configSndBtnCFVolP)) + { + m_cfg.setInt("GENERAL", "sound_volume_coverflow", min(m_cfg.getInt("GENERAL", "sound_volume_coverflow", 255) + step, 255)); + _showConfigSnd(); + m_cf.setSoundVolume(m_cfg.getInt("GENERAL", "sound_volume_coverflow", 255)); + } + else if (m_btnMgr.selected(m_configSndBtnCFVolM)) + { + m_cfg.setInt("GENERAL", "sound_volume_coverflow", max(m_cfg.getInt("GENERAL", "sound_volume_coverflow", 255) - step, 0)); + _showConfigSnd(); + m_cf.setSoundVolume(m_cfg.getInt("GENERAL", "sound_volume_coverflow", 255)); + } + } + } + _hideConfigSnd(); + return nextPage; +} + +void CMenu::_initConfigSndMenu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_configSndLblUser, ARRAY_SIZE(m_configSndLblUser), "CONFIGSND"); + m_configSndBg = _texture(theme.texSet, "CONFIGSND/BG", "texture", theme.bg); + m_configSndLblMusicVol = _addLabel(theme, "CONFIGSND/MUSIC_VOL", theme.lblFont, L"", 40, 130, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configSndLblMusicVolVal = _addLabel(theme, "CONFIGSND/MUSIC_VOL_BTN", theme.btnFont, L"", 426, 130, 118, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configSndBtnMusicVolM = _addPicButton(theme, "CONFIGSND/MUSIC_VOL_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 370, 130, 56, 56); + m_configSndBtnMusicVolP = _addPicButton(theme, "CONFIGSND/MUSIC_VOL_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 130, 56, 56); + m_configSndLblGuiVol = _addLabel(theme, "CONFIGSND/GUI_VOL", theme.lblFont, L"", 40, 190, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configSndLblGuiVolVal = _addLabel(theme, "CONFIGSND/GUI_VOL_BTN", theme.btnFont, L"", 426, 190, 118, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configSndBtnGuiVolM = _addPicButton(theme, "CONFIGSND/GUI_VOL_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 370, 190, 56, 56); + m_configSndBtnGuiVolP = _addPicButton(theme, "CONFIGSND/GUI_VOL_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 190, 56, 56); + m_configSndLblCFVol = _addLabel(theme, "CONFIGSND/CF_VOL", theme.lblFont, L"", 40, 250, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configSndLblCFVolVal = _addLabel(theme, "CONFIGSND/CF_VOL_BTN", theme.btnFont, L"", 426, 250, 118, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configSndBtnCFVolM = _addPicButton(theme, "CONFIGSND/CF_VOL_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 370, 250, 56, 56); + m_configSndBtnCFVolP = _addPicButton(theme, "CONFIGSND/CF_VOL_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 250, 56, 56); + m_configSndLblBnrVol = _addLabel(theme, "CONFIGSND/BNR_VOL", theme.lblFont, L"", 40, 310, 340, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_configSndLblBnrVolVal = _addLabel(theme, "CONFIGSND/BNR_VOL_BTN", theme.btnFont, L"", 426, 310, 118, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_configSndBtnBnrVolM = _addPicButton(theme, "CONFIGSND/BNR_VOL_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 370, 310, 56, 56); + m_configSndBtnBnrVolP = _addPicButton(theme, "CONFIGSND/BNR_VOL_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 310, 56, 56); + // + _setHideAnim(m_configSndLblMusicVol, "CONFIGSND/MUSIC_VOL", 100, 0, -2.f, 0.f); + _setHideAnim(m_configSndLblMusicVolVal, "CONFIGSND/MUSIC_VOL_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndBtnMusicVolM, "CONFIGSND/MUSIC_VOL_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndBtnMusicVolP, "CONFIGSND/MUSIC_VOL_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndLblGuiVol, "CONFIGSND/GUI_VOL", 100, 0, -2.f, 0.f); + _setHideAnim(m_configSndLblGuiVolVal, "CONFIGSND/GUI_VOL_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndBtnGuiVolM, "CONFIGSND/GUI_VOL_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndBtnGuiVolP, "CONFIGSND/GUI_VOL_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndLblCFVol, "CONFIGSND/CF_VOL", 100, 0, -2.f, 0.f); + _setHideAnim(m_configSndLblCFVolVal, "CONFIGSND/CF_VOL_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndBtnCFVolM, "CONFIGSND/CF_VOL_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndBtnCFVolP, "CONFIGSND/CF_VOL_PLUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndLblBnrVol, "CONFIGSND/BNR_VOL", 100, 0, -2.f, 0.f); + _setHideAnim(m_configSndLblBnrVolVal, "CONFIGSND/BNR_VOL_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndBtnBnrVolM, "CONFIGSND/BNR_VOL_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_configSndBtnBnrVolP, "CONFIGSND/BNR_VOL_PLUS", 0, 0, 1.f, -1.f); + _hideConfigSnd(true); + _textConfigSnd(); +} + +void CMenu::_textConfigSnd(void) +{ + m_btnMgr.setText(m_configSndLblMusicVol, _t("cfgs1", L"Music volume")); + m_btnMgr.setText(m_configSndLblGuiVol, _t("cfgs2", L"GUI sound volume")); + m_btnMgr.setText(m_configSndLblCFVol, _t("cfgs3", L"Coverflow sound volume")); + m_btnMgr.setText(m_configSndLblBnrVol, _t("cfgs4", L"Game sound volume")); +} diff --git a/source/menu/menu_download.cpp b/source/menu/menu_download.cpp new file mode 100644 index 00000000..5fc3952d --- /dev/null +++ b/source/menu/menu_download.cpp @@ -0,0 +1,1018 @@ +#include "menu.hpp" +#include "svnrev.h" +#include "loader/sys.h" +#include "loader/wbfs.h" +#include "http.h" +#include "pngu.h" +#include "defines.h" + +#include "loader/fs.h" +#include "loader/wdvd.h" +#include "usbstorage.h" +#include "unzip/ZipFile.h" + +#include + +#include "gecko.h" +#include "wifi_gecko.h" +#include +#include "lockMutex.hpp" + +#include +#include + +#define TAG_GAME_ID "{gameid}" +#define TAG_LOC "{loc}" +#define TITLES_URL "http://www.gametdb.com/titles.txt?LANG=%s" +#define GAMETDB_URL "http://www.gametdb.com/wiitdb.zip?LANG=%s&FALLBACK=TRUE&WIIWARE=TRUE" +#define UPDATE_URL_VERSION "http://update.wiiflow.org/txt/versions.txt" + +using namespace std; + +static const char FMT_BPIC_URL[] = "http://art.gametdb.com/wii/coverfullHQ/{loc}/{gameid}.png"\ +"|http://art.gametdb.com/wii/coverfull/{loc}/{gameid}.png"; +static const char FMT_PIC_URL[] = "http://art.gametdb.com/wii/cover/{loc}/{gameid}.png"; + +static block download = { 0, 0 }; +static string countryCode(const string &gameId) +{ + switch (gameId[3]) + { + case 'E': + return "US"; + case 'J': + return "JA"; + case 'W': + return "ZH"; + case 'K': + return "KO"; + case 'R': + return "RU"; + case 'P': + case 'D': + case 'F': + case 'I': + case 'S': + case 'H': + case 'X': + case 'Y': + case 'Z': + switch (CONF_GetArea()) + { + case CONF_AREA_BRA: + return "PT"; + case CONF_AREA_AUS: + return "AU"; + } + switch (CONF_GetLanguage()) + { + case CONF_LANG_ENGLISH: + return "EN"; + case CONF_LANG_GERMAN: + return "DE"; + case CONF_LANG_FRENCH: + return "FR"; + case CONF_LANG_SPANISH: + return "ES"; + case CONF_LANG_ITALIAN: + return "IT"; + case CONF_LANG_DUTCH: + return "NL"; + } + case 'A': + switch (CONF_GetArea()) + { + case CONF_AREA_USA: + return "US"; + case CONF_AREA_JPN: + return "JA"; + case CONF_AREA_CHN: + case CONF_AREA_HKG: + case CONF_AREA_TWN: + return "ZH"; + case CONF_AREA_KOR: + return "KO"; + case CONF_AREA_BRA: + return "PT"; + case CONF_AREA_AUS: + return "AU"; + } + switch (CONF_GetLanguage()) + { + case CONF_LANG_ENGLISH: + return "EN"; + case CONF_LANG_GERMAN: + return "DE"; + case CONF_LANG_FRENCH: + return "FR"; + case CONF_LANG_SPANISH: + return "ES"; + case CONF_LANG_ITALIAN: + return "IT"; + case CONF_LANG_DUTCH: + return "NL"; + } + } + return "other"; +} + +static string makeURL(const string format, const string gameId, const string country) +{ + string url = format; + url.replace(url.find(TAG_LOC), strlen(TAG_LOC), country.c_str()); + url.replace(url.find(TAG_GAME_ID), strlen(TAG_GAME_ID), gameId.c_str()); + + return url; +} + +void CMenu::_hideDownload(bool instant) +{ + m_btnMgr.hide(m_downloadLblTitle, instant); + m_btnMgr.hide(m_downloadBtnCancel, instant); + m_btnMgr.hide(m_downloadBtnAll, instant); + m_btnMgr.hide(m_downloadBtnMissing, instant); + m_btnMgr.hide(m_downloadBtnGameTDBDownload, instant); + m_btnMgr.hide(m_downloadPBar, instant); + m_btnMgr.hide(m_downloadLblMessage[0], 0, 0, -2.f, 0.f, instant); + m_btnMgr.hide(m_downloadLblMessage[1], 0, 0, -2.f, 0.f, instant); + m_btnMgr.hide(m_downloadLblCovers, instant); + m_btnMgr.hide(m_downloadLblGameTDBDownload, instant); + m_btnMgr.hide(m_downloadLblGameTDB, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_downloadLblUser); ++i) + if (m_downloadLblUser[i] != -1u) + m_btnMgr.hide(m_downloadLblUser[i], instant); +} + +void CMenu::_showDownload(void) +{ + _setBg(m_downloadBg, m_downloadBg); + m_btnMgr.show(m_downloadLblGameTDB); + m_btnMgr.show(m_downloadLblTitle); + m_btnMgr.show(m_downloadBtnCancel); + m_btnMgr.show(m_downloadBtnAll); + m_btnMgr.show(m_downloadBtnMissing); + m_btnMgr.show(m_downloadLblCovers); + if (!m_locked) + { + m_btnMgr.show(m_downloadLblGameTDBDownload); + m_btnMgr.show(m_downloadBtnGameTDBDownload); + } + for (u32 i = 0; i < ARRAY_SIZE(m_downloadLblUser); ++i) + if (m_downloadLblUser[i] != -1u) + m_btnMgr.show(m_downloadLblUser[i]); +} + +void CMenu::_setThrdMsg(const wstringEx &msg, float progress) +{ + if (m_thrdStop) return; + if (msg != L"...") m_thrdMessage = msg; + m_thrdMessageAdded = true; + m_thrdProgress = progress; +} + +bool CMenu::_downloadProgress(void *obj, int size, int position) +{ + CMenu *m = (CMenu *)obj; + LWP_MutexLock(m->m_mutex); + m->_setThrdMsg(L"...", m->m_thrdStep + m->m_thrdStepLen * ((float)position / (float)size)); + LWP_MutexUnlock(m->m_mutex); + return !m->m_thrdStop; +} + +int CMenu::_coverDownloaderAll(CMenu *m) +{ + if (!m->m_thrdWorking) return 0; + m->_coverDownloader(false); + m->m_thrdWorking = false; + return 0; +} + +int CMenu::_coverDownloaderMissing(CMenu *m) +{ + if (!m->m_thrdWorking) return 0; + m->_coverDownloader(true); + m->m_thrdWorking = false; + return 0; +} + +static bool checkPNGBuf(u8 *data) +{ + PNGUPROP imgProp; + + IMGCTX ctx = PNGU_SelectImageFromBuffer(data); + if (ctx == NULL) + return false; + int ret = PNGU_GetImageProperties(ctx, &imgProp); + PNGU_ReleaseImageContext(ctx); + return ret == PNGU_OK; +} + +static bool checkPNGFile(const char *filename) +{ + SmartBuf buffer; + FILE *file = fopen(filename, "rb"); + if (file == NULL) return false; + fseek(file, 0, SEEK_END); + long fileSize = ftell(file); + fseek(file, 0, SEEK_SET); + if (fileSize > 0) + { + buffer = smartAnyAlloc(fileSize); + if (!!buffer) fread(buffer.get(), 1, fileSize, file); + } + SAFE_CLOSE(file); + return !buffer ? false : checkPNGBuf(buffer.get()); +} + +void CMenu::_initAsyncNetwork() +{ + if (!_isNetworkAvailable()) return; + m_thrdNetwork = true; + net_init_async(_networkComplete, this); +} + +bool CMenu::_isNetworkAvailable() +{ + bool retval = false; + u32 size; + u8 *buf = ISFS_GetFile((u8 *) "/shared2/sys/net/02/config.dat", &size, -1); + if (buf && size > 4) + { + retval = buf[4] > 0; // There is a valid connection defined. + SAFE_FREE(buf); + } + return retval; +} + +s32 CMenu::_networkComplete(s32 ok, void *usrData) +{ + CMenu *m = (CMenu *) usrData; + + m->m_networkInit = ok == 0; + m->m_thrdNetwork = false; + + bool wifigecko = m->m_cfg.getBool("GENERAL", "wifi_gecko", false); + gprintf("NET: Network init complete, enabled wifi_gecko: %s\n", wifigecko ? "yes" : "no"); + + if (wifigecko) + { + // Get ip + std::string ip = m->m_cfg.getString("GENERAL", "wifi_gecko_ip"); + u16 port = m->m_cfg.getInt("GENERAL", "wifi_gecko_port"); + + if (ip.size() > 0 && port != 0) + { + gprintf("NET: WIFI Gecko to %s:%d\n", ip.c_str(), port); + WifiGecko_Init(ip.c_str(), port); + } + } + + return 0; +} + +int CMenu::_initNetwork() +{ + while (net_get_status() == -EBUSY || m_thrdNetwork) {}; // Async initialization may be busy, wait to see if it succeeds. + if (m_networkInit) return 0; + if (!_isNetworkAvailable()) return -2; + + char ip[16]; + int val = if_config(ip, NULL, NULL, true); + + m_networkInit = !val; + return val; +} + +#define STACK_ALIGN(type, name, cnt, alignment) \ + u8 _al__##name[((sizeof(type)*(cnt)) + (alignment) + \ + (((sizeof(type)*(cnt))%(alignment)) > 0 ? ((alignment) - \ + ((sizeof(type)*(cnt))%(alignment))) : 0))]; \ + type *name = (type*)(((u32)(_al__##name)) + ((alignment) - (( \ + (u32)(_al__##name))&((alignment)-1)))) + +void CMenu::_deinitNetwork() +{ + net_wc24cleanup(); + net_deinit(); + m_networkInit = false; +} + +int CMenu::_coverDownloader(bool missingOnly) +{ + string path; + safe_vector coverList; + int count = 0, countFlat = 0; + float listWeight = missingOnly ? 0.125f : 0.f; // 1/8 of the progress bar for testing the PNGs we already have + float dlWeight = 1.f - listWeight; + + u32 bufferSize = 0x280000; // Maximum download size 2 MB + SmartBuf buffer = smartAnyAlloc(bufferSize); + if (!buffer) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(L"Not enough memory!", 1.f); + LWP_MutexUnlock(m_mutex); + m_thrdWorking = false; + return 0; + } + bool savePNG = m_cfg.getBool("GENERAL", "keep_png", true); + + safe_vector fmtURLBox = stringToVector(m_cfg.getString("GENERAL", "url_full_covers", FMT_BPIC_URL), '|'); + safe_vector fmtURLFlat = stringToVector(m_cfg.getString("GENERAL", "url_flat_covers", FMT_PIC_URL), '|'); + + u32 nbSteps = m_gameList.size(); + u32 step = 0; + if (m_coverDLGameId.empty()) + { + coverList.reserve(m_gameList.size()); + for (u32 i = 0; i < m_gameList.size() && !m_thrdStop; ++i) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg7", L"Listing covers to download..."), listWeight * (float)step / (float)nbSteps); + LWP_MutexUnlock(m_mutex); + ++step; + string id((const char *)m_gameList[i].hdr.id, sizeof m_gameList[i].hdr.id); + path = sfmt("%s/%s.png", m_boxPicDir.c_str(), id.c_str()); + if (!missingOnly || (!m_cf.fullCoverCached(id.c_str()) && !checkPNGFile(path.c_str()))) + coverList.push_back(id); + } + } + else + coverList.push_back(m_coverDLGameId); + + u32 n = coverList.size(); + if (n > 0 && !m_thrdStop) + { + step = 0; + nbSteps = 1 + n * 2; + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg1", L"Initializing network..."), listWeight + dlWeight * (float)step / (float)nbSteps); + LWP_MutexUnlock(m_mutex); + if (_initNetwork() < 0) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg2", L"Network initialization failed!"), 1.f); + LWP_MutexUnlock(m_mutex); + m_thrdWorking = false; + return 0; + } + m_thrdStepLen = dlWeight / (float)nbSteps; + + Config m_newID; + m_newID.load(sfmt("%s/newid.ini", m_settingsDir.c_str()).c_str()); + m_newID.setString("CHANNELS", "WFSF", "DWFA"); + + for (u32 i = 0; i < coverList.size() && !m_thrdStop; ++i) + { + // Try to get the full cover + string url; + const char *domain = _domainFromView(); + bool success = false; + FILE *file = NULL; + + string newID = m_newID.getString(domain, coverList[i], coverList[i]); + + if(!newID.empty() && strncasecmp(newID.c_str(), coverList[i].c_str(), m_current_view != COVERFLOW_USB ? 4 : 6) == 0) + m_newID.remove(domain, coverList[i]); + else if(!newID.empty()) + { + gprintf("old id = %s\nnew id = %s\n", coverList[i].c_str(), newID.c_str()); + } + + for (u32 j = 0; !success && j < fmtURLBox.size() && !m_thrdStop; ++j) + { + + url = makeURL(fmtURLBox[j], newID, countryCode(newID)); + if (j == 0) ++step; + m_thrdStep = listWeight + dlWeight * (float)step / (float)nbSteps; + LWP_MutexLock(m_mutex); + _setThrdMsg(wfmt(_fmt("dlmsg3", L"Downloading from %s"), url.c_str()), m_thrdStep); + LWP_MutexUnlock(m_mutex); + download = downloadfile(buffer.get(), bufferSize, url.c_str(), CMenu::_downloadProgress, this); + + if (download.data == NULL && newID[3] != 'E') + { + url = makeURL(fmtURLBox[j], newID, "US"); + LWP_MutexLock(m_mutex); + _setThrdMsg(wfmt(_fmt("dlmsg3", L"Downloading from %s"), url.c_str()), m_thrdStep); + LWP_MutexUnlock(m_mutex); + download = downloadfile(buffer.get(), bufferSize, url.c_str(), CMenu::_downloadProgress, this); + } + + if (download.data != NULL) + { + if (savePNG) + { + path = sfmt("%s/%s.png", m_boxPicDir.c_str(), coverList[i].c_str()); + LWP_MutexLock(m_mutex); + _setThrdMsg(wfmt(_fmt("dlmsg4", L"Saving %s"), path.c_str()), listWeight + dlWeight * (float)(step + 1) / (float)nbSteps); + LWP_MutexUnlock(m_mutex); + file = fopen(path.c_str(), "wb"); + if (file != NULL) + { + fwrite(download.data, download.size, 1, file); + SAFE_CLOSE(file); + } + } + + LWP_MutexLock(m_mutex); + _setThrdMsg(wfmt(_fmt("dlmsg10", L"Making %s"), sfmt("%s.wfc", coverList[i].c_str()).c_str()), listWeight + dlWeight * (float)(step + 1) / (float)nbSteps); + LWP_MutexUnlock(m_mutex); + if (m_cf.preCacheCover(coverList[i].c_str(), download.data, true)) + { + ++count; + success = true; + } + } + } + if (!success && !m_thrdStop) + { + path = sfmt("%s/%s.png", m_picDir.c_str(), coverList[i].c_str()); + if (!checkPNGFile(path.c_str())) + { + // Try to get the front cover + if (m_thrdStop) break; + for (u32 j = 0; !success && j < fmtURLFlat.size() && !m_thrdStop; ++j) + { + url = makeURL(fmtURLFlat[j], newID, countryCode(newID)); + LWP_MutexLock(m_mutex); + _setThrdMsg(wfmt(_fmt("dlmsg8", L"Full cover not found. Downloading from %s"), url.c_str()), listWeight + dlWeight * (float)step / (float)nbSteps); + LWP_MutexUnlock(m_mutex); + download = downloadfile(buffer.get(), bufferSize, url.c_str(), CMenu::_downloadProgress, this); + if (download.data == NULL && newID[3] != 'E') + { + url = makeURL(fmtURLFlat[j], newID, "EN"); + LWP_MutexLock(m_mutex); + _setThrdMsg(wfmt(_fmt("dlmsg3", L"Downloading from %s"), url.c_str()), m_thrdStep); + LWP_MutexUnlock(m_mutex); + download = downloadfile(buffer.get(), bufferSize, url.c_str(), CMenu::_downloadProgress, this); + } + if (download.data != NULL) + { + if (savePNG) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(wfmt(_fmt("dlmsg4", L"Saving %s"), path.c_str()), listWeight + dlWeight * (float)(step + 1) / (float)nbSteps); + LWP_MutexUnlock(m_mutex); + file = fopen(path.c_str(), "wb"); + if (file != NULL) + { + fwrite(download.data, download.size, 1, file); + SAFE_CLOSE(file); + } + } + + LWP_MutexLock(m_mutex); + _setThrdMsg(wfmt(_fmt("dlmsg10", L"Making %s"), sfmt("%s.wfc", coverList[i].c_str()).c_str()), listWeight + dlWeight * (float)(step + 1) / (float)nbSteps); + LWP_MutexUnlock(m_mutex); + if (m_cf.preCacheCover(coverList[i].c_str(), download.data, false)) + { + ++countFlat; + success = true; + } + } + } + } + } + newID.clear(); + ++step; + } + coverList.clear(); + m_newID.unload(); + } + LWP_MutexLock(m_mutex); + if (countFlat == 0) + _setThrdMsg(wfmt(_fmt("dlmsg5", L"%i/%i files downloaded."), count, n), 1.f); + else + _setThrdMsg(wfmt(_fmt("dlmsg9", L"%i/%i files downloaded. %i are front covers only."), count + countFlat, n, countFlat), 1.f); + LWP_MutexUnlock(m_mutex); + m_thrdWorking = false; + return 0; +} + +void CMenu::_download(string gameId) +{ + lwp_t thread = LWP_THREAD_NULL; + int msg = 0; + wstringEx prevMsg; + + bool _updateGametdb = false; + + SetupInput(); + _showDownload(); + m_btnMgr.setText(m_downloadBtnCancel, _t("dl1", L"Cancel")); + m_thrdStop = false; + m_thrdMessageAdded = false; + m_coverDLGameId = gameId; + while (true) + { + _mainLoopCommon(false, m_thrdWorking); + if ((BTN_HOME_PRESSED || BTN_B_PRESSED) && !m_thrdWorking) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if ((BTN_A_PRESSED || !gameId.empty()) && !(m_thrdWorking && m_thrdStop)) + { + if ((m_btnMgr.selected(m_downloadBtnAll) || m_btnMgr.selected(m_downloadBtnMissing) || !gameId.empty()) && !m_thrdWorking) + { + bool dlAll = m_btnMgr.selected(m_downloadBtnAll); + m_btnMgr.show(m_downloadPBar); + m_btnMgr.setProgress(m_downloadPBar, 0.f); + m_btnMgr.hide(m_downloadBtnAll); + m_btnMgr.hide(m_downloadBtnMissing); + m_btnMgr.hide(m_downloadBtnGameTDBDownload); + m_btnMgr.hide(m_downloadLblCovers); + m_btnMgr.hide(m_downloadLblGameTDBDownload); + m_thrdStop = false; + m_thrdWorking = true; + gameId.clear(); + if (dlAll) + LWP_CreateThread(&thread, (void *(*)(void *))CMenu::_coverDownloaderAll, (void *)this, 0, 8192, 40); + else + LWP_CreateThread(&thread, (void *(*)(void *))CMenu::_coverDownloaderMissing, (void *)this, 0, 8192, 40); + } + else if (m_btnMgr.selected(m_downloadBtnGameTDBDownload) && !m_thrdWorking) + { +// bool dlAll = m_btnMgr.selected(m_downloadBtnAllTitles); + m_btnMgr.show(m_downloadPBar); + m_btnMgr.setProgress(m_downloadPBar, 0.f); + m_btnMgr.hide(m_downloadBtnAll); + m_btnMgr.hide(m_downloadBtnMissing); + m_btnMgr.hide(m_downloadBtnGameTDBDownload); + m_btnMgr.hide(m_downloadLblCovers); + m_btnMgr.hide(m_downloadLblGameTDBDownload); + m_thrdStop = false; + m_thrdWorking = true; + + _updateGametdb = true; + + LWP_CreateThread(&thread, (void *(*)(void *))CMenu::_gametdbDownloader, (void *)this, 0, 8192, 40); + } + else if (m_btnMgr.selected(m_downloadBtnCancel)) + { + LockMutex lock(m_mutex); + m_thrdStop = true; + m_thrdMessageAdded = true; + m_thrdMessage = _t("dlmsg6", L"Canceling..."); + } + } + if (Sys_Exiting()) + { + LockMutex lock(m_mutex); + m_thrdStop = true; + m_thrdMessageAdded = true; + m_thrdMessage = _t("dlmsg6", L"Canceling..."); + m_thrdWorking = false; + } + // + if (m_thrdMessageAdded) + { + LockMutex lock(m_mutex); + m_thrdMessageAdded = false; + m_btnMgr.setProgress(m_downloadPBar, m_thrdProgress); + if (m_thrdProgress == 1.f) + { + if (_updateGametdb) + break; + m_btnMgr.setText(m_downloadBtnCancel, _t("dl2", L"Back")); + } + if (prevMsg != m_thrdMessage) + { + prevMsg = m_thrdMessage; + m_btnMgr.setText(m_downloadLblMessage[msg], m_thrdMessage, false); + m_btnMgr.hide(m_downloadLblMessage[msg], 0, 0, -1.f, -1.f, true); + m_btnMgr.show(m_downloadLblMessage[msg]); + msg ^= 1; + m_btnMgr.hide(m_downloadLblMessage[msg], 0, 0, -1.f, -1.f); + } + } + if (m_thrdStop && !m_thrdWorking) + break; + } + if (thread != LWP_THREAD_NULL) + { + LWP_JoinThread(thread, NULL); + thread = LWP_THREAD_NULL; + } + _hideDownload(); +} + +void CMenu::_initDownloadMenu(CMenu::SThemeData &theme) +{ + _addUserLabels(theme, m_downloadLblUser, ARRAY_SIZE(m_downloadLblUser), "DOWNLOAD"); + m_downloadBg = _texture(theme.texSet, "DOWNLOAD/BG", "texture", theme.bg); + m_downloadLblTitle = _addLabel(theme, "DOWNLOAD/TITLE", theme.titleFont, L"", 20, 30, 600, 60, theme.titleFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE); + m_downloadPBar = _addProgressBar(theme, "DOWNLOAD/PROGRESS_BAR", 40, 200, 560, 20); + m_downloadBtnCancel = _addButton(theme, "DOWNLOAD/CANCEL_BTN", theme.btnFont, L"", 420, 410, 200, 56, theme.btnFontColor); + m_downloadLblCovers = _addLabel(theme, "DOWNLOAD/COVERS", theme.btnFont, L"", 40, 150, 320, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_downloadBtnAll = _addButton(theme, "DOWNLOAD/ALL_BTN", theme.btnFont, L"", 370, 150, 230, 56, theme.btnFontColor); + m_downloadBtnMissing = _addButton(theme, "DOWNLOAD/MISSING_BTN", theme.btnFont, L"", 370, 210, 230, 56, theme.btnFontColor); + m_downloadLblGameTDBDownload = _addLabel(theme, "DOWNLOAD/GAMETDB_DOWNLOAD", theme.btnFont, L"", 40, 270, 320, 56, theme.lblFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_downloadBtnGameTDBDownload = _addButton(theme, "DOWNLOAD/GAMETDB_DOWNLOAD_BTN", theme.btnFont, L"", 370, 270, 230, 56, theme.btnFontColor); + m_downloadLblGameTDB = _addLabel(theme, "DOWNLOAD/GAMETDB", theme.btnFont, L"", 40, 400, 370, 60, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_downloadLblMessage[0] = _addLabel(theme, "DOWNLOAD/MESSAGE1", theme.lblFont, L"", 40, 228, 560, 100, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + m_downloadLblMessage[1] = _addLabel(theme, "DOWNLOAD/MESSAGE2", theme.lblFont, L"", 40, 228, 560, 100, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + // + _setHideAnim(m_downloadLblTitle, "DOWNLOAD/TITLE", 0, 0, -2.f, 0.f); + _setHideAnim(m_downloadPBar, "DOWNLOAD/PROGRESS_BAR", 0, 0, -2.f, 0.f); + _setHideAnim(m_downloadLblCovers, "DOWNLOAD/COVERS", 0, 0, -2.f, 0.f); + _setHideAnim(m_downloadBtnCancel, "DOWNLOAD/CANCEL_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_downloadBtnAll, "DOWNLOAD/ALL_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_downloadBtnMissing, "DOWNLOAD/MISSING_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_downloadLblGameTDBDownload, "DOWNLOAD/GAMETDB_DOWNLOAD", 0, 0, -2.f, 0.f); + _setHideAnim(m_downloadBtnGameTDBDownload, "DOWNLOAD/GAMETDB_DOWNLOAD_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_downloadLblGameTDB, "DOWNLOAD/GAMETDB", 0, 0, -2.f, 0.f); + _hideDownload(true); + _textDownload(); +} + +void CMenu::_textDownload(void) +{ + m_btnMgr.setText(m_downloadBtnCancel, _t("dl1", L"Cancel")); + m_btnMgr.setText(m_downloadBtnAll, _t("dl3", L"All")); + m_btnMgr.setText(m_downloadBtnMissing, _t("dl4", L"Missing")); + m_btnMgr.setText(m_downloadLblTitle, _t("dl5", L"Download")); + m_btnMgr.setText(m_downloadBtnGameTDBDownload, _t("dl6", L"Download")); + m_btnMgr.setText(m_downloadLblCovers, _t("dl8", L"Covers")); + m_btnMgr.setText(m_downloadLblGameTDBDownload, _t("dl12", L"GameTDB")); + m_btnMgr.setText(m_downloadLblGameTDB, _t("dl10", L"Please donate\nto GameTDB.com")); +} + +s8 CMenu::_versionTxtDownloaderInit(CMenu *m) //Handler to download versions txt file +{ + if (!m->m_thrdWorking) return 0; + return m->_versionTxtDownloader(); +} + +s8 CMenu::_versionTxtDownloader() // code to download new version txt file +{ + u32 bufferSize = 0x001000; // Maximum download size 4kb + SmartBuf buffer = smartAnyAlloc(bufferSize); + if (!buffer) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(L"Not enough memory", 1.f); + LWP_MutexUnlock(m_mutex); + m_thrdWorking = false; + return 0; + } + + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg1", L"Initializing network..."), 0.f); + LWP_MutexUnlock(m_mutex); + + if (_initNetwork() < 0) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg2", L"Network initialization failed!"), 1.f); + LWP_MutexUnlock(m_mutex); + } + else + { + // DLoad txt file + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg11", L"Downloading..."), 0.2f); + LWP_MutexUnlock(m_mutex); + + m_thrdStep = 0.2f; + m_thrdStepLen = 0.9f - 0.2f; + gprintf("TXT update URL: %s\n\n", m_cfg.getString("GENERAL", "updatetxturl", UPDATE_URL_VERSION).c_str()); + download = downloadfile(buffer.get(), bufferSize, m_cfg.getString("GENERAL", "updatetxturl", UPDATE_URL_VERSION).c_str(),CMenu::_downloadProgress, this); + if (download.data == 0 || download.size < 19) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg20", L"No version information found."), 1.f); // TODO: Check for 16 + LWP_MutexUnlock(m_mutex); + } + else + { + // txt download finished, now save file + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg13", L"Saving..."), 0.9f); + LWP_MutexUnlock(m_mutex); + + FILE *file = fopen(m_ver.c_str(), "wb"); + if (file != NULL) + { + fwrite(download.data, 1, download.size, file); + SAFE_CLOSE(file); + + // version file valid, check for version with SVN_REV + int svnrev = atoi(SVN_REV); + gprintf("Installed Version: %d\n", svnrev); + m_version.load(m_ver.c_str()); + int rev = m_version.getInt("GENERAL", "version", 0); + gprintf("Latest available Version: %d\n", rev); + if (svnrev < rev) + { + // new version available + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg19", L"New update available!"), 1.f); + LWP_MutexUnlock(m_mutex); + } + else + { + // no new version available + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg17", L"No new updates found."), 1.f); + LWP_MutexUnlock(m_mutex); + } + } + else + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg15", L"Saving failed!"), 1.f); + LWP_MutexUnlock(m_mutex); + } + + } + } + m_thrdWorking = false; + return 0; +} + +s8 CMenu::_versionDownloaderInit(CMenu *m) //Handler to download new dol +{ + if (!m->m_thrdWorking) return 0; + return m->_versionDownloader(); +} + +s8 CMenu::_versionDownloader() // code to download new version +{ + char dol_backup[33]; + strcpy(dol_backup, m_dol.c_str()); + strcat(dol_backup, ".backup"); + + if (m_app_update_size == 0) m_app_update_size = 0x400000; + if (m_data_update_size == 0) m_data_update_size = 0x400000; + + // check for existing dol + ifstream filestr; + gprintf("DOL Path: %s\n", m_dol.c_str()); + filestr.open(m_dol.c_str()); + if (filestr.fail()) + { + filestr.close(); + rename(dol_backup, m_dol.c_str()); + filestr.open(m_dol.c_str()); + if (filestr.fail()) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg18", L"boot.dol not found at default path!"), 1.f); + LWP_MutexUnlock(m_mutex); + } + filestr.close(); + sleep(3); + m_thrdWorking = false; + return 0; + } + filestr.close(); + + u32 bufferSize = max(m_app_update_size, m_data_update_size); // Buffer for size of the biggest file. + SmartBuf buffer = smartAnyAlloc(bufferSize); + if (!buffer) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(L"Not enough memory!", 1.f); + LWP_MutexUnlock(m_mutex); + sleep(3); + m_thrdWorking = false; + return 0; + } + + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg1", L"Initializing network..."), 0.f); + LWP_MutexUnlock(m_mutex); + + if (_initNetwork() < 0) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg2", L"Network initialization failed!"), 1.f); + LWP_MutexUnlock(m_mutex); + sleep(3); + m_thrdWorking = false; + return 0; + } + + // Load actual file + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg22", L"Updating application directory..."), 0.2f); + LWP_MutexUnlock(m_mutex); + + m_thrdStep = 0.2f; + m_thrdStepLen = 0.9f - 0.2f; + gprintf("App Update URL: %s\n", m_app_update_url); + gprintf("Data Update URL: %s\n", m_app_update_url); + + download = downloadfile(buffer.get(), bufferSize, m_app_update_url, CMenu::_downloadProgress, this); + if (download.data == 0 || download.size < m_app_update_size) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg12", L"Download failed!"), 1.f); + LWP_MutexUnlock(m_mutex); + sleep(3); + m_thrdWorking = false; + return 0; + } + + // download finished, backup boot.dol and write new files. + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg13", L"Saving..."), 0.8f); + LWP_MutexUnlock(m_mutex); + + remove(dol_backup); + rename(m_dol.c_str(), dol_backup); + + remove(m_app_update_zip.c_str()); + + FILE *file = fopen(m_app_update_zip.c_str(), "wb"); + if (file != NULL) + { + fwrite(download.data, 1, download.size, file); + SAFE_CLOSE(file); + + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg24", L"Extracting..."), 0.8f); + LWP_MutexUnlock(m_mutex); + + ZipFile zFile(m_app_update_zip.c_str()); + bool result = zFile.ExtractAll(m_appDir.c_str()); + remove(m_app_update_zip.c_str()); + + if (!result) goto fail; + + //Update apps dir succeeded, try to update the data dir. + download.data = NULL; + download.size = 0; + + //memset(&buffer, 0, bufferSize); should we be clearing the buffer of any possible data before downloading? + + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg23", L"Updating data directory..."), 0.2f); + LWP_MutexUnlock(m_mutex); + + download = downloadfile(buffer.get(), bufferSize, m_data_update_url, CMenu::_downloadProgress, this); + if (download.data == 0 || download.size < m_data_update_size) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg12", L"Download failed!"), 1.f); + LWP_MutexUnlock(m_mutex); + goto success; + } + + // download finished, write new files. + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg13", L"Saving..."), 0.9f); + LWP_MutexUnlock(m_mutex); + + remove(m_data_update_zip.c_str()); + + file = fopen(m_data_update_zip.c_str(), "wb"); + if (file != NULL) + { + fwrite(download.data, 1, download.size, file); + SAFE_CLOSE(file); + + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg24", L"Extracting..."), 0.8f); + LWP_MutexUnlock(m_mutex); + + ZipFile zDataFile(m_data_update_zip.c_str()); + result = zDataFile.ExtractAll(m_dataDir.c_str()); + remove(m_data_update_zip.c_str()); + + if (!result) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg15", L"Saving failed!"), 1.f); + LWP_MutexUnlock(m_mutex); + } + } + + } + else + goto fail; + +success: + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg21", L"WiiFlow will now exit to allow the update to take effect."), 1.f); + LWP_MutexUnlock(m_mutex); + + filestr.open(m_dol.c_str()); + if (filestr.fail()) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg25", L"Extraction must have failed! Renaming the backup to boot.dol"), 1.f); + LWP_MutexUnlock(m_mutex); + rename(dol_backup, m_dol.c_str()); + } + filestr.close(); + + m_exit = true; + goto out; + +fail: + rename(dol_backup, m_dol.c_str()); + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg15", L"Saving failed!"), 1.f); + LWP_MutexUnlock(m_mutex); +out: + sleep(3); + m_thrdWorking = false; + return 0; +} + +int CMenu::_gametdbDownloader(CMenu *m) +{ + if (!m->m_thrdWorking) return 0; + return m->_gametdbDownloaderAsync(); +} + +int CMenu::_gametdbDownloaderAsync() +{ + string langCode; + + u32 bufferSize = 0x800000; // 8 MB + SmartBuf buffer = smartAnyAlloc(bufferSize); + if (!buffer) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(L"Not enough memory", 1.f); + LWP_MutexUnlock(m_mutex); + return 0; + } + langCode = m_loc.getString(m_curLanguage, "gametdb_code", "EN"); + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg1", L"Initializing network..."), 0.f); + LWP_MutexUnlock(m_mutex); + if (_initNetwork() < 0) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg2", L"Network initialization failed!"), 1.f); + LWP_MutexUnlock(m_mutex); + } + else + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg11", L"Downloading..."), 0.0f); + LWP_MutexUnlock(m_mutex); + m_thrdStep = 0.0f; + m_thrdStepLen = 1.0f; + download = downloadfile(buffer.get(), bufferSize, sfmt(GAMETDB_URL, langCode.c_str()).c_str(), CMenu::_downloadProgress, this); + if (download.data == 0) + { + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg12", L"Download failed!"), 1.f); + LWP_MutexUnlock(m_mutex); + } + else + { + string zippath = sfmt("%s/wiitdb.zip", m_settingsDir.c_str()); + + gprintf("Downloading file to '%s'\n", zippath.c_str()); + + remove(zippath.c_str()); + + _setThrdMsg(wfmt(_fmt("dlmsg4", L"Saving %s"), "wiitdb.zip"), 1.f); + FILE *file = fopen(zippath.c_str(), "wb"); + if (file == NULL) + { + gprintf("Can't save zip file\n"); + + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg15", L"Couldn't save ZIP file"), 1.f); + LWP_MutexUnlock(m_mutex); + } + else + { + fwrite(download.data, download.size, 1, file); + SAFE_CLOSE(file); + + gprintf("Extracting zip file: "); + + ZipFile zFile(zippath.c_str()); + bool zres = zFile.ExtractAll(m_settingsDir.c_str()); + + gprintf(zres ? "success\n" : "failed\n"); + + // We don't need the zipfile anymore + remove(zippath.c_str()); + + // Update cache + m_gameList.SetLanguage(m_loc.getString(m_curLanguage, "gametdb_code", "EN").c_str()); + UpdateCache(); + + LWP_MutexLock(m_mutex); + _setThrdMsg(_t("dlmsg26", L"Updating cache..."), 0.f); + LWP_MutexUnlock(m_mutex); + + _loadList(); + _initCF(); + } + } + } + m_thrdWorking = false; + return 0; +} \ No newline at end of file diff --git a/source/menu/menu_error.cpp b/source/menu/menu_error.cpp new file mode 100644 index 00000000..2259a833 --- /dev/null +++ b/source/menu/menu_error.cpp @@ -0,0 +1,77 @@ + +#include "menu.hpp" +#include "gecko.h" + +extern const u8 error_png[]; + +void CMenu::error(const wstringEx &msg) +{ + SetupInput(); + _hideAbout(); + _hideCode(); + _hideConfig(); + _hideConfigAdv(); + _hideConfig3(); + _hideConfig4(); + _hideConfigScreen(); + _hideConfigSnd(); + _hideDownload(); + _hideGame(); + _hideMain(); + _hideWBFS(); + _hideCFTheme(); + _hideCategorySettings(); + _hideSystem(); + _hideGameInfo(); + _hideCheatDownload(); + _hideGameSettings(); + _hideWaitMessage(); + m_btnMgr.setText(m_errorLblMessage, msg, true); + _showError(); + do + { + gprintf(msg.toUTF8().c_str()); + _mainLoopCommon(); + } while (!BTN_B_PRESSED && !BTN_A_PRESSED && !BTN_HOME_PRESSED); + _hideError(false); +} + +void CMenu::_hideError(bool instant) +{ + m_btnMgr.hide(m_errorLblIcon, instant); + m_btnMgr.hide(m_errorLblMessage, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_errorLblUser); ++i) + if (m_errorLblUser[i] != -1u) + m_btnMgr.hide(m_errorLblUser[i], instant); +} + +void CMenu::_showError(void) +{ + _setBg(m_errorBg, m_errorBg); + m_btnMgr.show(m_errorLblMessage); + m_btnMgr.show(m_errorLblIcon); + for (u32 i = 0; i < ARRAY_SIZE(m_errorLblUser); ++i) + if (m_errorLblUser[i] != -1u) + m_btnMgr.show(m_errorLblUser[i]); +} + +void CMenu::_initErrorMenu(CMenu::SThemeData &theme) +{ + STexture texIcon; + + texIcon.fromPNG(error_png); + _addUserLabels(theme, m_errorLblUser, ARRAY_SIZE(m_errorLblUser), "ERROR"); + m_errorBg = _texture(theme.texSet, "ERROR/BG", "texture", theme.bg); + m_errorLblMessage = _addLabel(theme, "ERROR/MESSAGE", theme.lblFont, L"", 112, 20, 500, 440, CColor(0xFFFFFFFF), FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_errorLblIcon = _addLabel(theme, "ERROR/ICON", theme.lblFont, L"", 40, 200, 64, 64, CColor(0xFFFFFFFF), 0, texIcon); + // + _setHideAnim(m_errorLblMessage, "ERROR/MESSAGE", 0, 0, 0.f, 0.f); + _setHideAnim(m_errorLblIcon, "ERROR/ICON", -50, 0, 0.f, 0.f); + // + _hideError(true); + _textError(); +} + +void CMenu::_textError(void) +{ +} diff --git a/source/menu/menu_game.cpp b/source/menu/menu_game.cpp new file mode 100644 index 00000000..460e9a2b --- /dev/null +++ b/source/menu/menu_game.cpp @@ -0,0 +1,1147 @@ + +#include "menu.hpp" +#include "loader/patchcode.h" + +#include "loader/sys.h" +#include "loader/wdvd.h" +#include "loader/alt_ios.h" +#include "loader/playlog.h" +#include +#include +#include +#include "network/http.h" +#include "network/gcard.h" +#include "DeviceHandler.hpp" +#include "loader/wbfs.h" +#include "savefile.h" +#include "wip.h" +#include "channel_launcher.h" + +#include "loader/frag.h" +#include "loader/fst.h" + +#include "gui/WiiMovie.hpp" +#include "gui/GameTDB.hpp" +#include "channels.h" +#include "nand.hpp" +#include "alt_ios.h" +#include "gecko.h" +#include "homebrew.h" +#include "defines.h" + +using namespace std; + +extern const u8 btngamecfg_png[]; +extern const u8 btngamecfgs_png[]; +extern const u8 stopkidon_png[]; +extern const u8 stopkidons_png[]; +extern const u8 stopkidoff_png[]; +extern const u8 stopkidoffs_png[]; +extern const u8 favoriteson_png[]; +extern const u8 favoritesons_png[]; +extern const u8 favoritesoff_png[]; +extern const u8 favoritesoffs_png[]; +extern const u8 delete_png[]; +extern const u8 deletes_png[]; + +extern u32 sector_size; +extern int mainIOS; +static u64 sm_title_id[8] ATTRIBUTE_ALIGN(32); + +const string CMenu::_translations[23] = { + "Default", + "Arab", + "Brazilian", + "Chinese_S", + "Chinese_T", + "Danish", + "Dutch", + "English", + "Finnish", + "French", + "Gallego", + "German", + "Hungarian", + "Italian", + "Japanese", + "Norwegian", + "Polish", + "Portuguese", + "Russian", + "Spanish", + "Swedish", + "Tagalog", + "Turkish" +}; + +const CMenu::SOption CMenu::_languages[11] = { + { "lngdef", L"Default" }, + { "lngjap", L"Japanese" }, + { "lngeng", L"English" }, + { "lngger", L"German" }, + { "lngfre", L"French" }, + { "lngspa", L"Spanish" }, + { "lngita", L"Italian" }, + { "lngdut", L"Dutch" }, + { "lngsch", L"S. Chinese" }, + { "lngtch", L"T. Chinese" }, + { "lngkor", L"Korean" } +}; + +const CMenu::SOption CMenu::_videoModes[7] = { + { "viddef", L"Default" }, + { "vidp50", L"PAL 50Hz" }, + { "vidp60", L"PAL 60Hz" }, + { "vidntsc", L"NTSC" }, + { "vidpatch", L"Auto Patch" }, + { "vidsys", L"System" }, + { "vidprog", L"Progressive" } +}; + +const CMenu::SOption CMenu::_vidModePatch[4] = { + { "vmpnone", L"None" }, + { "vmpnormal", L"Normal" }, + { "vmpmore", L"More" }, + { "vmpall", L"All" } +}; + + +const CMenu::SOption CMenu::_hooktype[8] = { + { "disabled", L"Disabled" }, + { "hooktype1", L"VBI" }, + { "hooktype2", L"KPAD read" }, + { "hooktype3", L"Joypad" }, + { "hooktype4", L"GXDraw" }, + { "hooktype5", L"GXFlush" }, + { "hooktype6", L"OSSleepThread" }, + { "hooktype7", L"AXNextFrame" }, +}; +/* +0 No Hook +1 VBI +2 KPAD read +3 Joypad Hook +4 GXDraw Hook +5 GXFlush Hook +6 OSSleepThread Hook +7 AXNextFrame Hook +*/ + +std::map CMenu::_installed_cios; +u8 banner_title[84]; + +static inline int loopNum(int i, int s) +{ + return i < 0 ? (s - (-i % s)) % s : i % s; +} + +static void _extractBannerTitle(Banner *bnr, int language) +{ + if (bnr != NULL) + { + memset(banner_title, 0, 84); + bnr->GetName(banner_title, language); + } +} + +static Banner *_extractChannelBnr(const u64 chantitle) +{ + return Channels::GetBanner(chantitle); +} + +static Banner *_extractBnr(dir_discHdr *hdr) +{ + Banner *banner = NULL; + wbfs_disc_t *disc = WBFS_OpenDisc((u8 *) &hdr->hdr.id, (char *) hdr->path); + if (disc != NULL) + { + void *bnr = NULL; + if (wbfs_extract_file(disc, (char *) "opening.bnr", &bnr) > 0) + { + banner = new Banner((u8 *) bnr); + } + WBFS_CloseDisc(disc); + } + return banner; +} + +static int GetLanguage(const char *lang) +{ + if (strncmp(lang, "JP", 2) == 0) return CONF_LANG_JAPANESE; + else if (strncmp(lang, "EN", 2) == 0) return CONF_LANG_ENGLISH; + else if (strncmp(lang, "DE", 2) == 0) return CONF_LANG_GERMAN; + else if (strncmp(lang, "FR", 2) == 0) return CONF_LANG_FRENCH; + else if (strncmp(lang, "ES", 2) == 0) return CONF_LANG_SPANISH; + else if (strncmp(lang, "IT", 2) == 0) return CONF_LANG_ITALIAN; + else if (strncmp(lang, "NL", 2) == 0) return CONF_LANG_DUTCH; + else if (strncmp(lang, "ZHTW", 4) == 0) return CONF_LANG_TRAD_CHINESE; + else if (strncmp(lang, "ZH", 2) == 0) return CONF_LANG_SIMP_CHINESE; + else if (strncmp(lang, "KO", 2) == 0) return CONF_LANG_KOREAN; + + return CONF_LANG_ENGLISH; // Default to EN +} + +static u8 GetRequestedGameIOS(dir_discHdr *hdr) +{ + u8 IOS = 0; + + wbfs_disc_t *disc = WBFS_OpenDisc((u8 *) &hdr->hdr.id, (char *) hdr->path); + if (!disc) return IOS; + + u8 *titleTMD = NULL; + u32 tmd_size = wbfs_extract_file(disc, (char *) "TMD", (void **)&titleTMD); + WBFS_CloseDisc(disc); + + if(!titleTMD) return IOS; + + if(tmd_size > 0x18B) + IOS = titleTMD[0x18B]; + return IOS; +} + +void CMenu::_hideGame(bool instant) +{ + m_gameSelected = false; + m_fa.unload(); + m_cf.showCover(); + + m_btnMgr.hide(m_gameBtnPlay, instant); + m_btnMgr.hide(m_gameBtnDelete, instant); + m_btnMgr.hide(m_gameBtnSettings, instant); + m_btnMgr.hide(m_gameBtnBack, instant); + m_btnMgr.hide(m_gameBtnFavoriteOn, instant); + m_btnMgr.hide(m_gameBtnFavoriteOff, instant); + m_btnMgr.hide(m_gameBtnAdultOn, instant); + m_btnMgr.hide(m_gameBtnAdultOff, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_gameLblUser); ++i) + if (m_gameLblUser[i] != -1u) + m_btnMgr.hide(m_gameLblUser[i], instant); +} + +void CMenu::_showGame(void) +{ + m_cf.showCover(); + + if (m_fa.load(m_cfg, m_fanartDir.c_str(), m_cf.getId().c_str())) + { + STexture bg, bglq; + m_fa.getBackground(bg, bglq); + _setBg(bg, bglq); + + if (m_fa.hideCover()) + m_cf.hideCover(); + } + else + _setBg(m_mainBg, m_mainBgLQ); + + m_btnMgr.show(m_gameBtnPlay); + m_btnMgr.show(m_gameBtnBack); + for (u32 i = 0; i < ARRAY_SIZE(m_gameLblUser); ++i) + if (m_gameLblUser[i] != -1u) + m_btnMgr.show(m_gameLblUser[i]); +} + +static void setLanguage(int l) +{ + if (l > 0 && l <= 10) + configbytes[0] = l - 1; + else + configbytes[0] = 0xCD; +} + +void CMenu::_game(bool launch) +{ + m_gcfg1.load(sfmt("%s/gameconfig1.ini", m_settingsDir.c_str()).c_str()); + if (!launch) + { + SetupInput(); + _playGameSound(); + _showGame(); + m_gameSelected = true; + } + + s8 startGameSound = 1; + while (true) + { + if(startGameSound < 1) startGameSound++; + + string id(m_cf.getId()); + u64 chantitle = m_cf.getChanTitle(); + + if (startGameSound == -5) + { + _playGameSound(); + _showGame(); + } + _mainLoopCommon(true); + + if (startGameSound == 0) + { + m_gameSelected = true; + startGameSound = 1; + } + + if (BTN_HOME_PRESSED || BTN_B_PRESSED) + { + m_gameSound.Stop(); + break; + } + else if (BTN_PLUS_PRESSED) + { + _hideGame(); + m_gameSelected = true; + _gameinfo(); + _showGame(); + if (!m_gameSound.IsPlaying()) startGameSound = -6; + } + else if (BTN_MINUS_PRESSED) + { + string videoPath = sfmt("%s/%.3s.thp", m_videoDir.c_str(), id.c_str()); + + FILE *file = fopen(videoPath.c_str(), "rb"); + if (file) + { + SAFE_CLOSE(file); + + _hideGame(); + WiiMovie movie(videoPath.c_str()); + movie.SetScreenSize(m_cfg.getInt("GENERAL", "tv_width", 640), m_cfg.getInt("GENERAL", "tv_height", 480), m_cfg.getInt("GENERAL", "tv_x", 0), m_cfg.getInt("GENERAL", "tv_y", 0)); + movie.SetVolume(m_cfg.getInt("GENERAL", "sound_volume_bnr", 255)); + //_stopSounds(); + movie.Play(); + + m_video_playing = true; + + STexture videoBg; + while (!BTN_B_PRESSED && !BTN_A_PRESSED && !BTN_HOME_PRESSED && movie.GetNextFrame(&videoBg)) + { + _setBg(videoBg, videoBg); + m_bgCrossFade = 10; + _mainLoopCommon(); // Redraw the background every frame + } + movie.Stop(); + _showGame(); + m_video_playing = false; + //m_gameSound.play(m_bnrSndVol); + } + } + else if ((BTN_1_PRESSED) || (BTN_2_PRESSED)) + { + s8 direction = BTN_1_PRESSED ? 1 : -1; + const char *domain = _domainFromView(); + int cfVersion = loopNum(m_cfg.getInt(domain, "last_cf_mode" , 1) + direction, m_numCFVersions); + _loadCFLayout(cfVersion); + m_cf.applySettings(); + m_cfg.setInt(domain, "last_cf_mode" , cfVersion); + } + else if (launch || BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_mainBtnQuit)) + break; + else if (m_btnMgr.selected(m_gameBtnDelete)) + { + if (!m_locked) + { + _hideGame(); + CheckGameSoundThread(true); + if (_wbfsOp(CMenu::WO_REMOVE_GAME)) + { + m_gameSound.Stop(); + break; + } + _showGame(); + } + } + else if (m_btnMgr.selected(m_gameBtnFavoriteOn) || m_btnMgr.selected(m_gameBtnFavoriteOff)) + m_gcfg1.setBool("FAVORITES", id, !m_gcfg1.getBool("FAVORITES", id, false)); + else if (m_btnMgr.selected(m_gameBtnAdultOn) || m_btnMgr.selected(m_gameBtnAdultOff)) + m_gcfg1.setBool("ADULTONLY", id, !m_gcfg1.getBool("ADULTONLY", id, false)); + else if (m_btnMgr.selected(m_gameBtnBack)) + { + m_gameSound.Stop(); + break; + } + else if (m_btnMgr.selected(m_gameBtnSettings)) + { + _hideGame(); + m_gameSelected = true; + _gameSettings(); + _showGame(); + if (!m_gameSound.IsPlaying()) startGameSound = -6; + } + else if (launch || m_btnMgr.selected(m_gameBtnPlay) || (!WPadIR_Valid(0) && !WPadIR_Valid(1) && !WPadIR_Valid(2) && !WPadIR_Valid(3) && m_btnMgr.selected((u32)-1))) + { + _hideGame(); + dir_discHdr *hdr = m_cf.getHdr(); + + m_cf.clear(); + _showWaitMessage(); + + if (m_current_view != COVERFLOW_HOMEBREW) + { + // Get banner_title + Banner * banner = m_current_view == COVERFLOW_CHANNEL ? _extractChannelBnr(chantitle) : m_current_view == COVERFLOW_USB ? _extractBnr(hdr) : NULL; + if (banner != NULL) + { + if (banner->IsValid()) + _extractBannerTitle(banner, GetLanguage(m_loc.getString(m_curLanguage, "gametdb_code", "EN").c_str())); + delete banner; + } + banner = NULL; + + if (Playlog_Update(id.c_str(), banner_title) < 0) + Playlog_Delete(); + } + + gprintf("Launching game\n"); + _launch(hdr); + + if(m_exit || bootHB) break; + + _hideWaitMessage(); + launch = false; + + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + WPAD_SetVRes(chan, m_vid.width() + m_cursor[chan].width(), m_vid.height() + m_cursor[chan].height()); + + _showGame(); + _initCF(); + m_cf.select(); + } + else + { + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if (m_cf.mouseOver(m_vid, m_cursor[chan].x(), m_cursor[chan].y())) + m_cf.flip(); + } + } + if ((startGameSound == 1 || startGameSound < -8) && (BTN_UP_REPEAT || RIGHT_STICK_UP)) + { + m_cf.up(); + startGameSound = -10; + } + if ((startGameSound == 1 || startGameSound < -8) && (BTN_RIGHT_REPEAT || RIGHT_STICK_RIGHT)) + { + m_cf.right(); + startGameSound = -10; + } + if ((startGameSound == 1 || startGameSound < -8) && (BTN_DOWN_REPEAT || RIGHT_STICK_DOWN)) + { + m_cf.down(); + startGameSound = -10; + } + if ((startGameSound == 1 || startGameSound < -8) && (BTN_LEFT_REPEAT || RIGHT_STICK_LEFT)) + { + m_cf.left(); + startGameSound = -10; + } + if (startGameSound == -10) + { + m_gameSound.Stop(); + m_gameSelected = false; + m_fa.unload(); + _setBg(m_mainBg, m_mainBgLQ); + } + if (m_show_zone_game) + { + bool b = m_gcfg1.getBool("FAVORITES", id, false); + m_btnMgr.show(b ? m_gameBtnFavoriteOn : m_gameBtnFavoriteOff); + m_btnMgr.hide(b ? m_gameBtnFavoriteOff : m_gameBtnFavoriteOn); + m_btnMgr.show(m_gameBtnPlay); + m_btnMgr.show(m_gameBtnBack); + for (u32 i = 0; i < ARRAY_SIZE(m_gameLblUser); ++i) + if (m_gameLblUser[i] != -1u) + m_btnMgr.show(m_gameLblUser[i]); + + if (!m_locked) + { + b = m_gcfg1.getBool("ADULTONLY", id, false); + m_btnMgr.show(b ? m_gameBtnAdultOn : m_gameBtnAdultOff); + m_btnMgr.hide(b ? m_gameBtnAdultOff : m_gameBtnAdultOn); + m_btnMgr.show(m_gameBtnSettings); + } + + if (m_current_view == COVERFLOW_USB && !m_locked) + m_btnMgr.show(m_gameBtnDelete); + } + else + { + m_btnMgr.hide(m_gameBtnFavoriteOn); + m_btnMgr.hide(m_gameBtnFavoriteOff); + m_btnMgr.hide(m_gameBtnAdultOn); + m_btnMgr.hide(m_gameBtnAdultOff); + m_btnMgr.hide(m_gameBtnDelete); + m_btnMgr.hide(m_gameBtnSettings); + m_btnMgr.hide(m_gameBtnPlay); + m_btnMgr.hide(m_gameBtnBack); + for (u32 i = 0; i < ARRAY_SIZE(m_gameLblUser); ++i) + if (m_gameLblUser[i] != -1u) + m_btnMgr.hide(m_gameLblUser[i]); + } + } + m_gcfg1.save(true); + + _hideGame(); +} + +void CMenu::_directlaunch(const string &id) +{ + m_directLaunch = true; + + for (int i = USB1; i < USB8; i++) + { + if(!DeviceHandler::Instance()->IsInserted(i)) continue; + + DeviceHandler::Instance()->Open_WBFS(i); + CList list; + string path = sfmt(GAMES_DIR, DeviceName[i]); + safe_vector pathlist; + list.GetPaths(pathlist, id.c_str(), path, + strncasecmp(DeviceHandler::Instance()->PathToFSName(path.c_str()), "WBFS", 4) == 0); + + m_gameList.clear(); + list.GetHeaders(pathlist, m_gameList, m_settingsDir, m_curLanguage); + if(m_gameList.size() > 0) + { + gprintf("Game found on partition #%i\n", i); + _launch(&m_gameList[0]); // Launch will exit wiiflow + } + } + + error(sfmt("Cannot find the game with ID: %s", id.c_str())); +} + +void CMenu::_launch(dir_discHdr *hdr) +{ + m_gcfg2.load(sfmt("%s/gameconfig2.ini", m_settingsDir.c_str()).c_str()); + switch(m_current_view) + { + case COVERFLOW_HOMEBREW: + _launchHomebrew((char *)hdr->path, m_homebrewArgs); + break; + case COVERFLOW_CHANNEL: + _launchChannel(hdr); + break; + case COVERFLOW_USB: + default: + _launchGame(hdr, false); + break; + } +} + +extern "C" {extern void USBStorage_Deinit(void);} + +void CMenu::_launchHomebrew(const char *filepath, safe_vector arguments) +{ + if(LoadHomebrew(filepath)) + { + m_gcfg1.save(true); + m_gcfg2.save(true); + m_cat.save(true); + m_cfg.save(true); + + AddBootArgument(filepath); + for(u32 i = 0; i < arguments.size(); ++i) + AddBootArgument(arguments[i].c_str()); + + Playlog_Delete(); + + cleanup(); + Close_Inputs(); + USBStorage_Deinit(); + + Nand::Instance()->Disable_Emu(); + + bootHB = true; + } + m_exit = true; +} + +static const char systems[11] = { 'C', 'E', 'F', 'J', 'L', 'M', 'N', 'P', 'Q', 'W', 'H' }; + +void CMenu::_launchChannel(dir_discHdr *hdr) +{ + Channels channel; + u8 ios = channel.GetRequestedIOS(hdr->hdr.chantitle); + u8 *data = NULL; + + string id = string((const char *) hdr->hdr.id); + + bool forwarder = true; + for (u8 num = 0; num < ARRAY_SIZE(systems); num++) + { + if(id[0] == systems[num]) + { + forwarder = false; + break; + } + } + + forwarder = m_gcfg2.getBool(id, "custom", forwarder) || strncmp(id.c_str(), "WIMC", 4) == 0; + + if(!forwarder) + data = channel.Load(hdr->hdr.chantitle, (char *)id.c_str()); + + Nand::Instance()->Disable_Emu(); + + if(!forwarder && data == NULL) return; + + bool vipatch = m_gcfg2.testOptBool(id, "vipatch", m_cfg.getBool("GENERAL", "vipatch", false)); + bool cheat = m_gcfg2.testOptBool(id, "cheat", m_cfg.getBool("NAND", "cheat", false)); + bool countryPatch = m_gcfg2.testOptBool(id, "country_patch", m_cfg.getBool("GENERAL", "country_patch", false)); + u8 videoMode = (u8)min((u32)m_gcfg2.getInt(id, "video_mode", 0), ARRAY_SIZE(CMenu::_videoModes) - 1u); + int language = min((u32)m_gcfg2.getInt(id, "language", 0), ARRAY_SIZE(CMenu::_languages) - 1u); + const char *rtrn = m_gcfg2.getBool(id, "returnto", true) ? m_cfg.getString("GENERAL", "returnto").c_str() : NULL; + u8 patchVidMode = min((u32)m_gcfg2.getInt(id, "patch_video_modes", 0), ARRAY_SIZE(CMenu::_vidModePatch) - 1u); + + int gameIOS = 0; + + if(!forwarder) + { + int userIOS = 0; + if (m_gcfg2.getInt(id, "ios", &userIOS) && _installed_cios.size() > 0) + { + for(CIOSItr itr = _installed_cios.begin(); itr != _installed_cios.end(); itr++) + { + if(itr->second == userIOS || itr->first == userIOS) + { + gameIOS = itr->first; + break; + } + else gameIOS = 0; + } + } + + hooktype = (u32) m_gcfg2.getInt(id, "hooktype", 0); + debuggerselect = m_gcfg2.getBool(id, "debugger", false) ? 1 : 0; + + if ((debuggerselect || cheat) && hooktype == 0) hooktype = 1; + if (!debuggerselect && !cheat) hooktype = 0; + + if (videoMode == 0) videoMode = (u8)min((u32)m_cfg.getInt("GENERAL", "video_mode", 0), ARRAY_SIZE(CMenu::_videoModes) - 1); + if (language == 0) language = min((u32)m_cfg.getInt("GENERAL", "game_language", 0), ARRAY_SIZE(CMenu::_languages) - 1); + } + + m_cfg.setString("NAND", "current_item", id); + m_gcfg1.setInt("PLAYCOUNT", id, m_gcfg1.getInt("PLAYCOUNT", id, 0) + 1); + m_gcfg1.setUInt("LASTPLAYED", id, time(NULL)); + + if(!forwarder && has_enabled_providers() && _initNetwork() == 0) + add_game_to_card(id.c_str()); + + bool emu_disabled = m_cfg.getBool("NAND", "disable", true); + bool emulate_mode = m_gcfg2.testOptBool(id, "full_emulation", m_cfg.getBool("NAND", "full_emulation", true)); + + m_gcfg1.save(true); + m_gcfg2.save(true); + m_cat.save(true); + m_cfg.save(true); + + bool iosLoaded = false; + + if(!forwarder) + { + setLanguage(language); + + SmartBuf cheatFile; + u32 cheatSize = 0; + if (cheat) _loadFile(cheatFile, cheatSize, m_cheatDir.c_str(), fmt("%s.gct", hdr->hdr.id)); + ocarina_load_code((u8 *) &hdr->hdr.id, cheatFile.get(), cheatSize); + + + // Reload IOS, if requested + if (gameIOS != mainIOS) + { + if(gameIOS < 0x64) + { + if ( _installed_cios.size() <= 0) + { + error(sfmt("No cios found!")); + Sys_LoadMenu(); + } + u8 IOS[3]; + IOS[0] = gameIOS == 0 ? ios : gameIOS; + IOS[1] = 56; + IOS[2] = 57; + bool found = false; + for(u8 num = 0; !found && num < 4; num++) + { + if(IOS[num] == 0) num++; + for(CIOSItr itr = _installed_cios.begin(); !found && itr != _installed_cios.end(); itr++) + { + if(itr->second == IOS[num] || itr->first == IOS[num]) + { + gameIOS = itr->first; + found = true; + } + } + } + if(!found) + { + error(sfmt("Couldn't find a cIOS using base %i, or 56/57", IOS[0])); + return; + } + } + if (gameIOS != mainIOS) + { + gprintf("Reloading IOS into %d\n", gameIOS); + cleanup(true); + if(!loadIOS(gameIOS, true)) + { + error(sfmt("Couldn't load IOS %i", gameIOS)); + return; + } + iosLoaded = true; + } + } + + } + + if(!emu_disabled) + { + if(iosLoaded) ISFS_Deinitialize(); + ISFS_Initialize(); + + Nand::Instance()->Set_FullMode(emulate_mode); + if(Nand::Instance()->Enable_Emu() < 0) + { + Nand::Instance()->Disable_Emu(); + error(L"Enabling emu after reload failed!"); + if(iosLoaded) Sys_LoadMenu(); + return; + } + } + + if (rtrn != NULL && strlen(rtrn) == 4) + { + int rtrnID = rtrn[0] << 24 | rtrn[1] << 16 | rtrn[2] << 8 | rtrn[3]; + + static ioctlv vector[1] ATTRIBUTE_ALIGN(32); + sm_title_id[0] = (((u64)(0x00010001) << 32) | (rtrnID&0xFFFFFFFF)); + + vector[0].data = sm_title_id; + vector[0].len = 8; + + s32 ESHandle = IOS_Open("/dev/es", 0); + gprintf("Return to channel %s. Using new d2x way\n", IOS_Ioctlv(ESHandle, 0xA1, 1, 0, vector) != -101 ? "Succeeded" : "Failed!" ); + IOS_Close(ESHandle); + } + + CheckGameSoundThread(true); + cleanup(); + Close_Inputs(); + USBStorage_Deinit(); + + if(forwarder) + { + WII_Initialize(); + if (WII_LaunchTitle(hdr->hdr.chantitle) < 0) + Sys_LoadMenu(); + } + else if(!channel.Launch(data, hdr->hdr.chantitle, videoMode, vipatch, countryPatch, patchVidMode)) + Sys_LoadMenu(); +} + +void CMenu::_launchGame(dir_discHdr *hdr, bool dvd) +{ + string id = string((const char *) hdr->hdr.id); + Nand::Instance()->Disable_Emu(); + + bool gc = false; + if (dvd) + { + u32 cover = 0; + + Disc_SetUSB(NULL); + if (WDVD_GetCoverStatus(&cover) < 0) + { + error(L"WDVDGetCoverStatus Failed!"); + if (BTN_B_PRESSED) return; + } + if (!(cover & 0x2)) + { + error(L"Please insert a game disc."); + do { + WDVD_GetCoverStatus(&cover); + if (BTN_B_PRESSED) return; + } while(!(cover & 0x2)); + } + /* Open Disc */ + if (Disc_Open() < 0) + { + error(L"Cannot Read DVD."); + if (BTN_B_PRESSED) return; + } + /* Check disc */ + if (Disc_IsWii() < 0) + { + if (Disc_IsGC() < 0) + { + error(L"This is not a Wii or GC disc"); + if (BTN_B_PRESSED) return; + } + else + gc = true; + } + /* Read header */ + struct discHdr *header = (struct discHdr *)MEM2_alloc(sizeof(struct discHdr)); + Disc_ReadHeader(header); + for (int i = 0;i < 6; i++) + id[i] = header->id[i]; + SAFE_FREE(header); + } + bool vipatch = m_gcfg2.testOptBool(id, "vipatch", m_cfg.getBool("GENERAL", "vipatch", false)); + bool cheat = m_gcfg2.testOptBool(id, "cheat", m_cfg.getBool("GAMES", "cheat", false)); + bool countryPatch = m_gcfg2.testOptBool(id, "country_patch", m_cfg.getBool("GENERAL", "country_patch", false)); + u8 videoMode = (u8)min((u32)m_gcfg2.getInt(id, "video_mode", 0), ARRAY_SIZE(CMenu::_videoModes) - 1u); + int language = min((u32)m_gcfg2.getInt(id, "language", 0), ARRAY_SIZE(CMenu::_languages) - 1u); + const char *rtrn = m_gcfg2.getBool(id, "returnto", true) ? m_cfg.getString("GENERAL", "returnto").c_str() : NULL; + + int emuPartition = m_cfg.getInt("GAMES", "savepartition", -1); + if(emuPartition == -1) + emuPartition = m_cfg.getInt("NAND", "partition", -1); + + string emuPath = m_cfg.getString("GAMES", "savepath", m_cfg.getString("NAND", "path", "")); + + bool emulate_save = emuPartition != 255 && m_gcfg2.testOptBool(id, "emulate_save", m_cfg.getBool("GAMES", "save_emulation", false)); + bool emulate_mode = m_gcfg2.testOptBool(id, "full_emulation", m_cfg.getBool("GAMES", "full_emulation", false)); + + if (!dvd && get_frag_list((u8 *) hdr->hdr.id, (char *) hdr->path, currentPartition == 0 ? 0x200 : sector_size) < 0) + return; + + if(!dvd && emulate_save) + { + char basepath[64]; + snprintf(basepath, 64, "%s:%s", DeviceName[emuPartition], emuPath.c_str()); + CreateSavePath(basepath, hdr); + } + + int gameIOS = 0; + int userIOS = 0; + if (m_gcfg2.getInt(id, "ios", &userIOS) && _installed_cios.size() > 0) + { + for(CIOSItr itr = _installed_cios.begin(); itr != _installed_cios.end(); itr++) + { + if(itr->second == userIOS || itr->first == userIOS) + { + gameIOS = itr->first; + break; + } + else gameIOS = 0; + } + } + + u8 patchVidMode = min((u32)m_gcfg2.getInt(id, "patch_video_modes", 0), ARRAY_SIZE(CMenu::_vidModePatch) - 1u); + hooktype = (u32) m_gcfg2.getInt(id, "hooktype", 0); // hooktype is defined in patchcode.h + debuggerselect = m_gcfg2.getBool(id, "debugger", false) ? 1 : 0; // debuggerselect is defined in fst.h + + if ((debuggerselect || cheat) && hooktype == 0) hooktype = 1; + if (!debuggerselect && !cheat) hooktype = 0; + + if (id == "RPWE41" || id == "RPWZ41" || id == "SPXP41") // Prince of Persia, Rival Swords + debuggerselect = false; + + SmartBuf cheatFile, gameconfig; + u32 cheatSize = 0, gameconfigSize = 0; + bool iosLoaded = false; + + CheckGameSoundThread(true); + if (videoMode == 0) videoMode = (u8)min((u32)m_cfg.getInt("GENERAL", "video_mode", 0), ARRAY_SIZE(CMenu::_videoModes) - 1); + if (language == 0) language = min((u32)m_cfg.getInt("GENERAL", "game_language", 0), ARRAY_SIZE(CMenu::_languages) - 1); + m_cfg.setString("GAMES", "current_item", id); + m_gcfg1.setInt("PLAYCOUNT", id, m_gcfg1.getInt("PLAYCOUNT", id, 0) + 1); + m_gcfg1.setUInt("LASTPLAYED", id, time(NULL)); + + if (has_enabled_providers() && _initNetwork() == 0) + add_game_to_card(id.c_str()); + + m_gcfg1.save(true); + m_gcfg2.save(true); + m_cat.save(true); + m_cfg.save(true); + + setLanguage(language); + + if (cheat) _loadFile(cheatFile, cheatSize, m_cheatDir.c_str(), fmt("%s.gct", hdr->hdr.id)); + + _loadFile(gameconfig, gameconfigSize, m_txtCheatDir.c_str(), "gameconfig.txt"); + + load_wip_patches((u8 *) m_wipDir.c_str(), (u8 *) &hdr->hdr.id); + app_gameconfig_load((u8 *) &hdr->hdr.id, gameconfig.get(), gameconfigSize); + ocarina_load_code((u8 *) &hdr->hdr.id, cheatFile.get(), cheatSize); + + net_wc24cleanup(); + + // Reload IOS, if requested + if (!dvd && gameIOS != mainIOS) + { + if(gameIOS < 0x64) + { + if ( _installed_cios.size() <= 0) + { + error(sfmt("No cios found!")); + Sys_LoadMenu(); + } + u8 IOS[3]; + IOS[0] = gameIOS == 0 ? GetRequestedGameIOS(hdr) : gameIOS; + IOS[1] = 56; + IOS[2] = 57; + gprintf("Game requested IOS: %u\n", IOS[0]); + bool found = false; + for(u8 num = 0; !found && num < 4; num++) + { + if(IOS[num] == 0) num++; + for(CIOSItr itr = _installed_cios.begin(); !found && itr != _installed_cios.end(); itr++) + { + if(itr->second == IOS[num]) + { + gameIOS = itr->first; + found = true; + } + } + } + if(!found) + { + error(sfmt("Couldn't find a cIOS using base %i, or 56/57", IOS[0])); + return; + } + } + if (gameIOS != mainIOS) + { + gprintf("Reloading IOS into %d\n", gameIOS); + cleanup(true); + if(!loadIOS(gameIOS, true)) + { + error(sfmt("Couldn't load IOS %i", gameIOS)); + return; + } + iosLoaded = true; + } + } + + if(emulate_save) + { + if(iosLoaded) ISFS_Deinitialize(); + ISFS_Initialize(); + + Nand::Instance()->Init(emuPath.c_str(), emuPartition, false); + DeviceHandler::Instance()->UnMount(emuPartition); + + Nand::Instance()->Set_FullMode(emulate_mode); + + if(Nand::Instance()->Enable_Emu() < 0) + { + Nand::Instance()->Disable_Emu(); + error(L"Enabling emu after reload failed!"); + if (iosLoaded) Sys_LoadMenu(); + return; + } + if(!DeviceHandler::Instance()->IsInserted(currentPartition)) + DeviceHandler::Instance()->Mount(currentPartition); + DeviceHandler::Instance()->Mount(emuPartition); + + } + + if (!m_directLaunch) + { + if (rtrn != NULL && strlen(rtrn) == 4) + { + int rtrnID = rtrn[0] << 24 | rtrn[1] << 16 | rtrn[2] << 8 | rtrn[3]; + + static ioctlv vector[1] ATTRIBUTE_ALIGN(32); + + sm_title_id[0] = (((u64)(0x00010001) << 32) | (rtrnID&0xFFFFFFFF)); + + vector[0].data = sm_title_id; + vector[0].len = 8; + + s32 ESHandle = IOS_Open("/dev/es", 0); + gprintf("Return to channel %s. Using new d2x way\n", IOS_Ioctlv(ESHandle, 0xA1, 1, 0, vector) != -101 ? "succeeded" : "failed!"); + IOS_Close(ESHandle); + } + } + + if (!dvd) + { + s32 ret = Disc_SetUSB((u8 *) hdr->hdr.id); + if (ret < 0) + { + gprintf("Set USB failed: %d\n", ret); + error(wfmt(L"Set USB failed: %d\n", ret).c_str()); + if (iosLoaded) Sys_LoadMenu(); + return; + } + + + if (Disc_Open() < 0) + { + error(L"Disc_Open failed"); + if (iosLoaded) Sys_LoadMenu(); + return; + } + } + + cleanup(); + Close_Inputs(); + USBStorage_Deinit(); + if (gc) + { + WII_Initialize(); + if (WII_LaunchTitle(0x0000000100000100ULL)<0) + Sys_LoadMenu(); + } + else + { + gprintf("Booting game\n"); + if (Disc_WiiBoot(videoMode, vipatch, countryPatch, patchVidMode) < 0) + Sys_LoadMenu(); + } +} + +void CMenu::_initGameMenu(CMenu::SThemeData &theme) +{ + CColor fontColor(0xD0BFDFFF); + STexture texFavOn; + STexture texFavOnSel; + STexture texFavOff; + STexture texFavOffSel; + STexture texAdultOn; + STexture texAdultOnSel; + STexture texAdultOff; + STexture texAdultOffSel; + STexture texDelete; + STexture texDeleteSel; + STexture texSettings; + STexture texSettingsSel; + STexture bgLQ; + + texFavOn.fromPNG(favoriteson_png); + texFavOnSel.fromPNG(favoritesons_png); + texFavOff.fromPNG(favoritesoff_png); + texFavOffSel.fromPNG(favoritesoffs_png); + texAdultOn.fromPNG(stopkidon_png); + texAdultOnSel.fromPNG(stopkidons_png); + texAdultOff.fromPNG(stopkidoff_png); + texAdultOffSel.fromPNG(stopkidoffs_png); + texDelete.fromPNG(delete_png); + texDeleteSel.fromPNG(deletes_png); + texSettings.fromPNG(btngamecfg_png); + texSettingsSel.fromPNG(btngamecfgs_png); + _addUserLabels(theme, m_gameLblUser, ARRAY_SIZE(m_gameLblUser), "GAME"); + m_gameBg = _texture(theme.texSet, "GAME/BG", "texture", theme.bg); + if (m_theme.loaded() && STexture::TE_OK == bgLQ.fromPNGFile(sfmt("%s/%s", m_themeDataDir.c_str(), m_theme.getString("GAME/BG", "texture").c_str()).c_str(), GX_TF_CMPR, ALLOC_MEM2, 64, 64)) + m_gameBgLQ = bgLQ; + + m_gameBtnPlay = _addButton(theme, "GAME/PLAY_BTN", theme.btnFont, L"", 420, 354, 200, 56, fontColor); + m_gameBtnBack = _addButton(theme, "GAME/BACK_BTN", theme.btnFont, L"", 420, 410, 200, 56, fontColor); + m_gameBtnFavoriteOn = _addPicButton(theme, "GAME/FAVORITE_ON", texFavOn, texFavOnSel, 460, 170, 48, 48); + m_gameBtnFavoriteOff = _addPicButton(theme, "GAME/FAVORITE_OFF", texFavOff, texFavOffSel, 460, 170, 48, 48); + m_gameBtnAdultOn = _addPicButton(theme, "GAME/ADULTONLY_ON", texAdultOn, texAdultOnSel, 532, 170, 48, 48); + m_gameBtnAdultOff = _addPicButton(theme, "GAME/ADULTONLY_OFF", texAdultOff, texAdultOffSel, 532, 170, 48, 48); + m_gameBtnSettings = _addPicButton(theme, "GAME/SETTINGS_BTN", texSettings, texSettingsSel, 460, 242, 48, 48); + m_gameBtnDelete = _addPicButton(theme, "GAME/DELETE_BTN", texDelete, texDeleteSel, 532, 242, 48, 48); + + m_gameButtonsZone.x = m_theme.getInt("GAME/ZONES", "buttons_x", 0); + m_gameButtonsZone.y = m_theme.getInt("GAME/ZONES", "buttons_y", 0); + m_gameButtonsZone.w = m_theme.getInt("GAME/ZONES", "buttons_w", 640); + m_gameButtonsZone.h = m_theme.getInt("GAME/ZONES", "buttons_h", 480); + m_gameButtonsZone.hide = m_theme.getBool("GAME/ZONES", "buttons_hide", true); + + // + _setHideAnim(m_gameBtnPlay, "GAME/PLAY_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameBtnBack, "GAME/BACK_BTN", 200, 0, 1.f, 0.f); + _setHideAnim(m_gameBtnFavoriteOn, "GAME/FAVORITE_ON", 0, 0, -1.5f, -1.5f); + _setHideAnim(m_gameBtnFavoriteOff, "GAME/FAVORITE_OFF", 0, 0, -1.5f, -1.5f); + _setHideAnim(m_gameBtnAdultOn, "GAME/ADULTONLY_ON", 0, 0, -1.5f, -1.5f); + _setHideAnim(m_gameBtnAdultOff, "GAME/ADULTONLY_OFF", 0, 0, -1.5f, -1.5f); + _setHideAnim(m_gameBtnSettings, "GAME/SETTINGS_BTN", 0, 0, -1.5f, -1.5f); + _setHideAnim(m_gameBtnDelete, "GAME/DELETE_BTN", 0, 0, -1.5f, -1.5f); + _hideGame(true); + _textGame(); +} + +void CMenu::_textGame(void) +{ + m_btnMgr.setText(m_gameBtnPlay, _t("gm1", L"Play")); + m_btnMgr.setText(m_gameBtnBack, _t("gm2", L"Back")); +} + +// + +struct IMD5Header +{ + u32 fcc; + u32 filesize; + u8 zeroes[8]; + u8 crypto[16]; +} __attribute__((packed)); + +SmartBuf gameSoundThreadStack; + +void CMenu::_gameSoundThread(CMenu *m) +{ + m->m_gamesound_changed = false; + u32 sndSize = 0; + m->m_gameSoundHdr = m->m_cf.getHdr(); + + Banner *banner = m->m_current_view == COVERFLOW_USB ? + _extractBnr(m->m_gameSoundHdr) : m->m_current_view == COVERFLOW_CHANNEL ? + _extractChannelBnr(m->m_gameSoundHdr->hdr.chantitle) : NULL; + + if (banner == NULL || !banner->IsValid()) + { + gprintf("no valid banner found\n"); + SAFE_DELETE(banner); + m->m_gameSoundHdr = NULL; + return; + } + _extractBannerTitle(banner, GetLanguage(m->m_loc.getString(m->m_curLanguage, "gametdb_code", "EN").c_str())); + + const u8 *soundBin = banner->GetFile((char *) "sound.bin", &sndSize); + + if (soundBin == NULL || (((IMD5Header *)soundBin)->fcc != 'IMD5' && ((IMD5Header *)soundBin)->fcc != 'RIFF')) + { + gprintf("Failed to load banner sound!\n\n"); + SAFE_DELETE(banner); + m->m_gameSoundHdr = NULL; + return; + } + + m->m_gameSound.Load(soundBin, sndSize, false); + SAFE_DELETE(banner); + m->m_gamesound_changed = true; + m->m_gameSoundHdr = NULL; +} + +void CMenu::_playGameSound(void) +{ + m_gamesound_changed = false; + if (m_bnrSndVol == 0 || m_gameSoundHdr != NULL || m_gameSoundThread != LWP_THREAD_NULL) return; + + m_cf.stopCoverLoader(); + + unsigned int stack_size = (unsigned int)32768; + SMART_FREE(gameSoundThreadStack); + gameSoundThreadStack = smartMem2Alloc(stack_size); + LWP_CreateThread(&m_gameSoundThread, (void *(*)(void *))CMenu::_gameSoundThread, (void *)this, gameSoundThreadStack.get(), stack_size, 40); +} + +void CMenu::CheckGameSoundThread(bool force) +{ + if (force || (m_gameSoundHdr == NULL && m_gameSoundThread != LWP_THREAD_NULL)) + { + if(LWP_ThreadIsSuspended(m_gameSoundThread)) + LWP_ResumeThread(m_gameSoundThread); + + LWP_JoinThread(m_gameSoundThread, NULL); + + SMART_FREE(gameSoundThreadStack); + m_gameSoundThread = LWP_THREAD_NULL; + } +} + +void CMenu::CheckThreads(bool force) +{ + CheckGameSoundThread(force); + m_vid.CheckWaitThread(force); +} diff --git a/source/menu/menu_gameinfo.cpp b/source/menu/menu_gameinfo.cpp new file mode 100644 index 00000000..a688a011 --- /dev/null +++ b/source/menu/menu_gameinfo.cpp @@ -0,0 +1,617 @@ +#include "menu.hpp" + +#include + +#include "GameTDB.hpp" +#include "alt_ios.h" +#include "gecko.h" +#include "sys.h" + +extern const u8 wifi1_png[]; +extern const u8 wifi2_png[]; +extern const u8 wifi4_png[]; +extern const u8 wifi8_png[]; +extern const u8 wifi12_png[]; +extern const u8 wifi16_png[]; +extern const u8 wifi32_png[]; + +extern const u8 wiimote1_png[]; +extern const u8 wiimote2_png[]; +extern const u8 wiimote3_png[]; +extern const u8 wiimote4_png[]; +extern const u8 wiimote8_png[]; + +extern const u8 guitar_png[]; +extern const u8 guitarR_png[]; +extern const u8 microphone_png[]; +extern const u8 gcncontroller_png[]; +extern const u8 classiccontroller_png[]; +extern const u8 nunchuk_png[]; +extern const u8 nunchukR_png[]; +extern const u8 dancepad_png[]; +extern const u8 dancepadR_png[]; +extern const u8 balanceboard_png[]; +extern const u8 balanceboardR_png[]; +extern const u8 drums_png[]; +extern const u8 drumsR_png[]; +extern const u8 motionplus_png[]; +extern const u8 motionplusR_png[]; +extern const u8 wheel_png[]; +extern const u8 zapper_png[]; +extern const u8 wiispeak_png[]; + +//Ratings +extern const u8 norating_png[]; + +extern const u8 esrb_ec_png[]; +extern const u8 esrb_e_png[]; +extern const u8 esrb_eten_png[]; +extern const u8 esrb_t_png[]; +extern const u8 esrb_m_png[]; +extern const u8 esrb_ao_png[]; + +extern const u8 cero_a_png[]; +extern const u8 cero_b_png[]; +extern const u8 cero_c_png[]; +extern const u8 cero_d_png[]; +extern const u8 cero_z_png[]; + +extern const u8 pegi_3_png[]; +extern const u8 pegi_7_png[]; +extern const u8 pegi_12_png[]; +extern const u8 pegi_16_png[]; +extern const u8 pegi_18_png[]; + +GameXMLInfo gameinfo; + +static bool titlecheck = false; +u8 cnt_controlsreq = 0, cnt_controls = 0; +const int pixels_to_skip = 10; + +void CMenu::_gameinfo(void) +{ + bool first = true; + SetupInput(); + _showGameInfo(); + + u8 page = 0; + + int amount_of_skips = 0; + + int synopsis_x = 0, synopsis_y = 0; + u32 synopsis_w = 0, synopsis_h = 0; + + do + { + _mainLoopCommon(); + + if (amount_of_skips == 0) + { + // Check dimensions in the loop, because the animation can have an effect + m_btnMgr.getDimensions(m_gameinfoLblSynopsis, synopsis_x, synopsis_y, synopsis_w, synopsis_h); // Get original dimensions + } + if(first && page == 1) + { + m_btnMgr.moveBy(m_gameinfoLblSynopsis, 0, -(pixels_to_skip * 10)); + amount_of_skips++; + first = false; + } + + if ((BTN_DOWN_PRESSED || BTN_DOWN_HELD) && !(m_thrdWorking && m_thrdStop) && page == 1) + { + if (synopsis_h - (amount_of_skips * pixels_to_skip) > (m_vid.height2D() - (35 + synopsis_y))) + { + m_btnMgr.moveBy(m_gameinfoLblSynopsis, 0, -pixels_to_skip); + amount_of_skips++; + } + } + else if ((BTN_UP_PRESSED || BTN_UP_HELD) && !(m_thrdWorking && m_thrdStop) && page == 1) + { + if (amount_of_skips > 1) + { + m_btnMgr.moveBy(m_gameinfoLblSynopsis, 0, pixels_to_skip); + amount_of_skips--; + } + } + else if (BTN_RIGHT_PRESSED && !(m_thrdWorking && m_thrdStop) && page == 0 && gameinfo.Synopsis.size() > 0) + { + page = 1; + amount_of_skips = 0; + + m_btnMgr.reset(m_gameinfoLblSynopsis); + m_btnMgr.setText(m_gameinfoLblSynopsis, wfmt(L"%s", gameinfo.Synopsis.c_str()), true); //, line, false); + + m_btnMgr.hide(m_gameinfoLblDev, true); + m_btnMgr.hide(m_gameinfoLblRegion, true); + m_btnMgr.hide(m_gameinfoLblPublisher, true); + m_btnMgr.hide(m_gameinfoLblRlsdate, true); + m_btnMgr.hide(m_gameinfoLblGenre, true); + m_btnMgr.hide(m_gameinfoLblRating, true); + m_btnMgr.hide(m_gameinfoLblWifiplayers, true); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblControlsReq); ++i) + if (m_gameinfoLblControlsReq[i] != -1u) + m_btnMgr.hide(m_gameinfoLblControlsReq[i], true); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblControls); ++i) + if (m_gameinfoLblControls[i] != -1u) + m_btnMgr.hide(m_gameinfoLblControls[i], true); + + // When showing synopsis, only show user labels 2 and 3 + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblUser); ++i) + if (i < ARRAY_SIZE(m_gameinfoLblUser) / 2) + m_btnMgr.hide(m_gameinfoLblUser[i], true); + else + m_btnMgr.show(m_gameinfoLblUser[i]); + + m_btnMgr.show(m_gameinfoLblID); + m_btnMgr.show(m_gameinfoLblSynopsis); + } + else if (BTN_LEFT_PRESSED && !(m_thrdWorking && m_thrdStop)) + { + page = 0; + m_btnMgr.show(m_gameinfoLblID); + m_btnMgr.show(m_gameinfoLblDev); + m_btnMgr.show(m_gameinfoLblRegion); + m_btnMgr.show(m_gameinfoLblPublisher); + m_btnMgr.show(m_gameinfoLblRlsdate); + m_btnMgr.show(m_gameinfoLblGenre); + m_btnMgr.show(m_gameinfoLblRating); + m_btnMgr.show(m_gameinfoLblWifiplayers); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblControlsReq); ++i) + if (m_gameinfoLblControlsReq[i] != -1u && i < cnt_controlsreq) + m_btnMgr.show(m_gameinfoLblControlsReq[i]); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblControls); ++i) + if (m_gameinfoLblControls[i] != -1u && i < cnt_controls) + m_btnMgr.show(m_gameinfoLblControls[i]); + + // When showing synopsis, only show user labels 2 and 3 + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblUser); ++i) + if (i < ARRAY_SIZE(m_gameinfoLblUser) / 2) + m_btnMgr.show(m_gameinfoLblUser[i]); + else + m_btnMgr.hide(m_gameinfoLblUser[i], true); + + m_btnMgr.hide(m_gameinfoLblSynopsis,true); + } + + } while (!BTN_HOME_PRESSED && !BTN_B_PRESSED); + + _hideGameInfo(false); +} + +void CMenu::_hideGameInfo(bool instant) +{ + m_btnMgr.hide(m_gameinfoLblID, instant); + m_btnMgr.hide(m_gameinfoLblTitle, instant); + m_btnMgr.hide(m_gameinfoLblSynopsis, instant); + m_btnMgr.hide(m_gameinfoLblDev, instant); + m_btnMgr.hide(m_gameinfoLblRegion, instant); + m_btnMgr.hide(m_gameinfoLblPublisher, instant); + m_btnMgr.hide(m_gameinfoLblRlsdate, instant); + m_btnMgr.hide(m_gameinfoLblGenre, instant); + m_btnMgr.hide(m_gameinfoLblRating, instant); + m_btnMgr.hide(m_gameinfoLblWifiplayers, instant); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblControlsReq); ++i) + if (m_gameinfoLblControlsReq[i] != -1u) + m_btnMgr.hide(m_gameinfoLblControlsReq[i], instant); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblUser); ++i) + m_btnMgr.hide(m_gameinfoLblUser[i], instant); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblControls); ++i) + if (m_gameinfoLblControls[i] != -1u) + m_btnMgr.hide(m_gameinfoLblControls[i], instant); +} + +void CMenu::_showGameInfo(void) +{ + _setBg(m_gameinfoBg, m_gameinfoBg); + + _textGameInfo(); + + if(titlecheck) + { + m_btnMgr.show(m_gameinfoLblID); + m_btnMgr.show(m_gameinfoLblTitle); + m_btnMgr.show(m_gameinfoLblRating); + m_btnMgr.show(m_gameinfoLblRegion); + m_btnMgr.show(m_gameinfoLblDev); + m_btnMgr.show(m_gameinfoLblPublisher); + m_btnMgr.show(m_gameinfoLblRlsdate); + m_btnMgr.show(m_gameinfoLblGenre); + m_btnMgr.show(m_gameinfoLblWifiplayers); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblUser); ++i) + if (i < ARRAY_SIZE(m_gameinfoLblUser) / 2) + m_btnMgr.show(m_gameinfoLblUser[i]); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblControlsReq); ++i) + if (m_gameinfoLblControlsReq[i] != -1u && i < cnt_controlsreq) + m_btnMgr.show(m_gameinfoLblControlsReq[i]); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblControls); ++i) + if (m_gameinfoLblControls[i] != -1u && i < cnt_controls) + m_btnMgr.show(m_gameinfoLblControls[i]); + } +} + +void CMenu::_initGameInfoMenu(CMenu::SThemeData &theme) +{ + STexture emptyTex; + _addUserLabels(theme, m_gameinfoLblUser, 0, 1, "GAMEINFO"); + _addUserLabels(theme, m_gameinfoLblUser, 2, 1, "GAMEINFO"); + + m_gameinfoBg = _texture(theme.texSet, "GAMEINFO/BG", "texture", theme.bg); + m_gameinfoLblID = _addLabel(theme, "GAMEINFO/GAMEID", theme.btnFont, L"", 125, 10, 420, 75, theme.titleFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE); + m_gameinfoLblGenre = _addLabel(theme, "GAMEINFO/GENRE", theme.txtFont, L"", 40, 140, 460, 56, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + m_gameinfoLblDev = _addLabel(theme, "GAMEINFO/DEVELOPER", theme.txtFont, L"", 40, 170, 460, 56, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + m_gameinfoLblPublisher = _addLabel(theme, "GAMEINFO/PUBLISHER", theme.txtFont, L"", 40, 200, 460, 56, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + m_gameinfoLblRlsdate = _addLabel(theme, "GAMEINFO/RLSDATE", theme.txtFont, L"", 40, 230, 460, 56, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + m_gameinfoLblRegion = _addLabel(theme, "GAMEINFO/REGION", theme.txtFont, L"", 40, 260, 460, 56, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + m_gameinfoLblRating = _addLabel(theme, "GAMEINFO/RATING", theme.titleFont, L"", 550, 380, 48, 60, theme.titleFontColor, 0, m_rating); + m_gameinfoLblSynopsis = _addLabel(theme, "GAMEINFO/SYNOPSIS", theme.txtFont, L"", 40, 220, 560, 260, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP, emptyTex); + m_gameinfoLblWifiplayers = _addLabel(theme, "GAMEINFO/WIFIPLAYERS", theme.txtFont, L"", 550, 110, 68, 60, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP,m_wifi); + + _addUserLabels(theme, m_gameinfoLblUser, 1, 1, "GAMEINFO"); + _addUserLabels(theme, m_gameinfoLblUser, 3, 2, "GAMEINFO"); + + m_gameinfoLblTitle = _addLabel(theme, "GAMEINFO/TITLE", theme.titleFont, L"", 125, 37, 440, 75, theme.titleFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE); + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblControlsReq); ++i) + { + string dom(sfmt("GAMEINFO/CONTROLSREQ%i", i + 1)); + m_gameinfoLblControlsReq[i] = _addLabel(theme, dom.c_str(), theme.txtFont, L"", 40 + (i*60), 310, 60, 40, theme.txtFontColor, 0, emptyTex); + _setHideAnim(m_gameinfoLblControlsReq[i], dom.c_str(), 0, -100, 0.f, 0.f); + } + + for (u8 i = 0; i < ARRAY_SIZE(m_gameinfoLblControls); ++i) + { + string dom(sfmt("GAMEINFO/CONTROLS%i", i + 1)); + m_gameinfoLblControls[i] = _addLabel(theme, dom.c_str(), theme.txtFont, L"", 40 + (i*60), 380, 60, 40, theme.txtFontColor, 0, emptyTex); + _setHideAnim(m_gameinfoLblControls[i], dom.c_str(), 0, -100, 0.f, 0.f); + } + // + _setHideAnim(m_gameinfoLblID, "GAMEINFO/GAMEID",0, 100, 0.f, 0.f); + _setHideAnim(m_gameinfoLblTitle, "GAMEINFO/TITLE", 0, 100, 0.f, 0.f); + _setHideAnim(m_gameinfoLblRating, "GAMEINFO/RATING", 100, 0, 0.f, 0.f); + _setHideAnim(m_gameinfoLblSynopsis, "GAMEINFO/SYNOPSIS", 0, 700, 1.f, 1.f); + _setHideAnim(m_gameinfoLblRegion, "GAMEINFO/REGION", 0, -100, 0.f, 0.f); + _setHideAnim(m_gameinfoLblDev, "GAMEINFO/DEVELOPER", 0, -100, 0.f, 0.f); + _setHideAnim(m_gameinfoLblPublisher, "GAMEINFO/PUBLISHER", 0, -100, 0.f, 0.f); + _setHideAnim(m_gameinfoLblRlsdate, "GAMEINFO/RLSDATE", 0, -100, 0.f, 0.f); + _setHideAnim(m_gameinfoLblGenre, "GAMEINFO/GENRE", 0, -100, 0.f, 0.f); + _setHideAnim(m_gameinfoLblWifiplayers, "GAMEINFO/WIFIPLAYERS", 0, -100, 0.f, 0.f); + // + _hideGameInfo(true); +} + +void CMenu::_textGameInfo(void) +{ + cnt_controlsreq = 0; + cnt_controls = 0; + + GameTDB m_gametdb; + m_gametdb.OpenFile(sfmt("%s/wiitdb.xml", m_settingsDir.c_str()).c_str()); + m_gametdb.SetLanguageCode(m_loc.getString(m_curLanguage, "gametdb_code", "EN").c_str()); + + titlecheck = m_gametdb.IsLoaded() && m_gametdb.GetGameXMLInfo(m_cf.getId().c_str(), &gameinfo); + if(titlecheck) + { + gprintf("ID: %s\nTitle: %s\n", gameinfo.GameID.c_str(), gameinfo.Title.c_str()); + m_btnMgr.setText(m_gameinfoLblID, wfmt(L"%s", gameinfo.GameID.c_str()), true); + m_btnMgr.setText(m_gameinfoLblTitle, wfmt(L"%s", gameinfo.Title.c_str()), true); + m_btnMgr.setText(m_gameinfoLblSynopsis, wfmt(L"%s", gameinfo.Synopsis.c_str()), false); + m_btnMgr.setText(m_gameinfoLblDev, wfmt(_fmt("gameinfo1",L"Developer: %s"), gameinfo.Developer.c_str()), true); + m_btnMgr.setText(m_gameinfoLblPublisher, wfmt(_fmt("gameinfo2",L"Publisher: %s"), gameinfo.Publisher.c_str()), true); + m_btnMgr.setText(m_gameinfoLblRegion, wfmt(_fmt("gameinfo3",L"Region: %s"), gameinfo.Region.c_str()), true); + + string wGenres = vectorToString(gameinfo.Genres, ", "); + m_btnMgr.setText(m_gameinfoLblGenre, wfmt(_fmt("gameinfo5",L"Genre: %s"), wGenres.c_str()), true); + + int year = gameinfo.PublishDate >> 16; + int day = gameinfo.PublishDate & 0xFF; + int month = (gameinfo.PublishDate >> 8) & 0xFF; + + switch(CONF_GetRegion()) + { + case 0: + case 4: + case 5: + m_btnMgr.setText(m_gameinfoLblRlsdate, wfmt(_fmt("gameinfo4",L"Release Date: %i-%i-%i"), year, month, day), true); + break; + case 1: + m_btnMgr.setText(m_gameinfoLblRlsdate, wfmt(_fmt("gameinfo4",L"Release Date: %i-%i-%i"), month, day, year), true); + break; + case 2: + m_btnMgr.setText(m_gameinfoLblRlsdate, wfmt(_fmt("gameinfo4",L"Release Date: %i-%i-%i"), day, month, year), true); + break; + } + + //Ratings + switch(gameinfo.RatingType) + { + case 0: + //CERO + if (gameinfo.RatingValue == "A") + m_rating.fromPNG(cero_a_png); + else if (gameinfo.RatingValue == "B") + m_rating.fromPNG(cero_b_png); + else if (gameinfo.RatingValue == "D") + m_rating.fromPNG(cero_d_png); + else if (gameinfo.RatingValue == "C") + m_rating.fromPNG(cero_c_png); + else if (gameinfo.RatingValue == "Z") + m_rating.fromPNG(cero_z_png); + else + m_rating.fromPNG(norating_png); + break; + case 1: + //ESRB + if (gameinfo.RatingValue == "AO") + m_rating.fromPNG(esrb_ao_png); + else if (gameinfo.RatingValue == "E") + m_rating.fromPNG(esrb_e_png); + else if (gameinfo.RatingValue == "EC") + m_rating.fromPNG(esrb_ec_png); + else if (gameinfo.RatingValue == "E10+") + m_rating.fromPNG(esrb_eten_png); + else if (gameinfo.RatingValue == "T") + m_rating.fromPNG(esrb_t_png); + else if (gameinfo.RatingValue == "M") + m_rating.fromPNG(esrb_m_png); + else + m_rating.fromPNG(norating_png); + break; + case 2: + //PEGI + if (gameinfo.RatingValue == "3") + m_rating.fromPNG(pegi_3_png); + else if (gameinfo.RatingValue == "7") + m_rating.fromPNG(pegi_7_png); + else if (gameinfo.RatingValue == "12") + m_rating.fromPNG(pegi_12_png); + else if (gameinfo.RatingValue == "16") + m_rating.fromPNG(pegi_16_png); + else if (gameinfo.RatingValue == "18") + m_rating.fromPNG(pegi_18_png); + else + m_rating.fromPNG(norating_png); + break; + default: + break; + } + + m_btnMgr.setTexture(m_gameinfoLblRating, m_rating); + + //Wifi players + STexture emptyTex; + if (gameinfo.WifiPlayers == 1) + m_wifi.fromPNG(wifi1_png); + else if (gameinfo.WifiPlayers == 2) + m_wifi.fromPNG(wifi2_png); + else if (gameinfo.WifiPlayers == 4) + m_wifi.fromPNG(wifi4_png); + else if (gameinfo.WifiPlayers == 8) + m_wifi.fromPNG(wifi8_png); + else if (gameinfo.WifiPlayers == 12) + m_wifi.fromPNG(wifi12_png); + else if (gameinfo.WifiPlayers == 16) + m_wifi.fromPNG(wifi16_png); + else if (gameinfo.WifiPlayers == 32) + m_wifi.fromPNG(wifi32_png); + + if(gameinfo.WifiPlayers > 0) + m_btnMgr.setTexture(m_gameinfoLblWifiplayers, m_wifi); + else + m_btnMgr.setTexture(m_gameinfoLblWifiplayers, emptyTex); + + u8 wiimote=0, + nunchuk=0, + classiccontroller=0, + balanceboard=0, + dancepad=0, + guitar=0, + gamecube=0, + motionplus=0, + drums=0, + microphone=0, + wheel=0; + + //check required controlls + for (safe_vector::iterator acc_itr = gameinfo.Accessories.begin(); acc_itr != gameinfo.Accessories.end(); acc_itr++) + { + if (!acc_itr->Required) continue; + + if (strcmp((acc_itr->Name).c_str(), "wiimote") == 0) + wiimote=1; + else if (strcmp((acc_itr->Name).c_str(), "nunchuk") == 0) + nunchuk=1; + else if (strcmp((acc_itr->Name).c_str(), "guitar") == 0) + guitar=1; + else if (strcmp((acc_itr->Name).c_str(), "drums") == 0) + drums=1; + else if (strcmp((acc_itr->Name).c_str(), "dancepad") == 0) + dancepad=1; + else if (strcmp((acc_itr->Name).c_str(), "motionplus") == 0) + motionplus=1; + else if (strcmp((acc_itr->Name).c_str(), "balanceboard") == 0) + balanceboard=1; + } + + u8 x = 0; + u8 max_controlsReq = ARRAY_SIZE(m_gameinfoLblControlsReq); + + if(wiimote && x < max_controlsReq) + { + u8 players = gameinfo.Players; + if (gameinfo.Players >= 10) + players = players/10; + + if (players == 1) + m_controlsreq[x].fromPNG(wiimote1_png); + else if (players == 2) + m_controlsreq[x].fromPNG(wiimote2_png); + else if (players == 3) + m_controlsreq[x].fromPNG(wiimote3_png); + else if (players == 4) + m_controlsreq[x].fromPNG(wiimote4_png); + else if (players == 8) + m_controlsreq[x].fromPNG(wiimote8_png); + + m_btnMgr.setTexture(m_gameinfoLblControlsReq[x] ,m_controlsreq[x], 20, 60); + x++; + } + if(nunchuk && x < max_controlsReq) + { + m_controlsreq[x].fromPNG(nunchukR_png); + m_btnMgr.setTexture(m_gameinfoLblControlsReq[x] ,m_controlsreq[x], 52, 60); + x++; + } + if(guitar && x < max_controlsReq) + { + m_controlsreq[x].fromPNG(guitarR_png); + m_btnMgr.setTexture(m_gameinfoLblControlsReq[x] ,m_controlsreq[x], 60, 60); + x++; + } + if(drums && x < max_controlsReq) + { + m_controlsreq[x].fromPNG(drumsR_png); + m_btnMgr.setTexture(m_gameinfoLblControlsReq[x] ,m_controlsreq[x], 60, 60); + x++; + } + if(motionplus && x < max_controlsReq) + { + m_controlsreq[x].fromPNG(motionplusR_png); + m_btnMgr.setTexture(m_gameinfoLblControlsReq[x] ,m_controlsreq[x], 20, 60); + x++; + } + if(dancepad && x < max_controlsReq) + { + m_controlsreq[x].fromPNG(dancepadR_png); + m_btnMgr.setTexture(m_gameinfoLblControlsReq[x] ,m_controlsreq[x], 60, 60); + x++; + } + if(balanceboard && x < max_controlsReq) + { + m_controlsreq[x].fromPNG(balanceboardR_png); + m_btnMgr.setTexture(m_gameinfoLblControlsReq[x] ,m_controlsreq[x], 60, 60); + x++; + } + + cnt_controlsreq = x; + + //for(unsigned int i = 0;i::iterator acc_itr = gameinfo.Accessories.begin(); acc_itr != gameinfo.Accessories.end(); acc_itr++) + { + if (acc_itr->Required) continue; + + if (strcmp((acc_itr->Name).c_str(), "classiccontroller") == 0) + classiccontroller=1; + else if (strcmp((acc_itr->Name).c_str(), "nunchuk") == 0) + nunchuk=1; + else if (strcmp((acc_itr->Name).c_str(), "guitar") == 0) + guitar=1; + else if (strcmp((acc_itr->Name).c_str(), "drums") == 0) + drums=1; + else if (strcmp((acc_itr->Name).c_str(), "dancepad") == 0) + dancepad=1; + else if (strcmp((acc_itr->Name).c_str(), "motionplus") == 0) + motionplus=1; + else if (strcmp((acc_itr->Name).c_str(), "balanceboard") == 0) + balanceboard=1; + else if (strcmp((acc_itr->Name).c_str(), "microphone") == 0) + microphone=1; + else if (strcmp((acc_itr->Name).c_str(), "gamecube") == 0) + gamecube=1; + else if (strcmp((acc_itr->Name).c_str(), "wheel") == 0) + wheel=1; + } + + x = 0; + u8 max_controls = ARRAY_SIZE(m_gameinfoLblControls); + + if(classiccontroller && x < max_controls) + { + m_controls[x].fromPNG(classiccontroller_png); + m_btnMgr.setTexture(m_gameinfoLblControls[x] ,m_controls[x], 60, 60); + x++; + } + if(nunchuk && x < max_controls) + { + m_controls[x].fromPNG(nunchuk_png); + m_btnMgr.setTexture(m_gameinfoLblControls[x] ,m_controls[x], 52, 60); + x++; + } + if(guitar && x < max_controls) + { + m_controls[x].fromPNG(guitarR_png); + m_btnMgr.setTexture(m_gameinfoLblControls[x] ,m_controls[x], 60, 60); + x++; + } + if(drums && x < max_controls) + { + m_controls[x].fromPNG(drums_png); + x++; + } + if(dancepad && x < max_controls) + { + m_controls[x].fromPNG(dancepad_png); + x++; + } + if(motionplus && x < max_controls) + { + m_controls[x].fromPNG(motionplus_png); + m_btnMgr.setTexture(m_gameinfoLblControls[x] ,m_controls[x], 20, 60); + x++; + } + if(balanceboard && x < max_controls) + { + m_controls[x].fromPNG(balanceboard_png); + x++; + } + if(microphone && x < max_controls) + { + m_controls[x].fromPNG(microphone_png); + m_btnMgr.setTexture(m_gameinfoLblControls[x] ,m_controls[x], 48, 60); + x++; + } + if(gamecube && x < max_controls) + { + m_controls[x].fromPNG(gcncontroller_png); + x++; + } + if(wheel && x < max_controls) + { + m_controls[x].fromPNG(wheel_png); + x++; + } + + cnt_controls = x; + //for(unsigned int i = 0;i + +using namespace std; + + +static const u32 g_repeatDelay = 25; + +void CMenu::SetupInput() +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + stickPointer_x[chan] = (m_vid.width() + m_cursor[chan].width())/2; + stickPointer_y[chan] = (m_vid.height() + m_cursor[chan].height())/2; + left_stick_angle[chan] = 0; + left_stick_mag[chan] = 0; + right_stick_angle[chan] = 0; + right_stick_mag[chan] = 0; + pointerhidedelay[chan] = 0; + right_stick_skip[chan] = 0; + wmote_roll[chan] = 0; + wmote_roll_skip[chan] = 0; + } + + enable_wmote_roll = m_cfg.getBool("GENERAL", "wiimote_gestures", false); +} + +static int CalculateRepeatSpeed(float magnitude, int current_value) +{ + if (magnitude < 0) magnitude *= -1; + + // Calculate frameskips based on magnitude + // Max frameskips is 50 (1 sec, or slightly less) + if (magnitude < 0.15f) + { + return -1; // Force a direct start + } + else if (current_value > 0) + { + return current_value - 1; // Wait another frame + } + else if (current_value == -1) + { + return 0; // Process the input + } + else + { + s32 frames = 50 - ((u32) (50.f * magnitude)); // Calculate the amount of frames to wait + return (frames < 0) ? 0 : frames; + } +} + +void CMenu::ScanInput() +{ + m_show_zone_main = false; + m_show_zone_main2 = false; + m_show_zone_main3 = false; + m_show_zone_prev = false; + m_show_zone_next = false; + + WPAD_ScanPads(); + PAD_ScanPads(); + + ButtonsPressed(); + ButtonsHeld(); + LeftStick(); + + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + wd[chan] = WPAD_Data(chan); + left_stick_angle[chan] = 0; + left_stick_mag[chan] = 0; + right_stick_angle[chan] = 0; + right_stick_mag[chan] = 0; + switch (wd[chan]->exp.type) + { + case WPAD_EXP_NUNCHUK: + right_stick_mag[chan] = wd[chan]->exp.nunchuk.js.mag; + right_stick_angle[chan] = wd[chan]->exp.nunchuk.js.ang; + break; + case WPAD_EXP_GUITARHERO3: + left_stick_mag[chan] = wd[chan]->exp.nunchuk.js.mag; + left_stick_angle[chan] = wd[chan]->exp.nunchuk.js.ang; + break; + case WPAD_EXP_CLASSIC: + left_stick_mag[chan] = wd[chan]->exp.classic.ljs.mag; + left_stick_angle[chan] = wd[chan]->exp.classic.ljs.ang; + right_stick_mag[chan] = wd[chan]->exp.classic.rjs.mag; + right_stick_angle[chan] = wd[chan]->exp.classic.rjs.ang; + break; + default: + break; + } + if (enable_wmote_roll) + { + wmote_roll[chan] = wd[chan]->orient.roll; // Use wd[chan]->ir.angle if you only want this to work when pointing at the screen + wmote_roll_skip[chan] = CalculateRepeatSpeed(wmote_roll[chan] / 45.f, wmote_roll_skip[chan]); + } + right_stick_skip[chan] = CalculateRepeatSpeed(right_stick_mag[chan], right_stick_skip[chan]); + } + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + m_btnMgr.setRumble(chan, WPadIR_Valid(chan), PAD_StickX(chan) < -20 || PAD_StickX(chan) > 20 || PAD_StickY(chan) < -20 || PAD_StickY(chan) > 20); + + if (WPadIR_Valid(chan)) + { + m_cursor[chan].draw(wd[chan]->ir.x, wd[chan]->ir.y, wd[chan]->ir.angle); + m_btnMgr.mouse(chan, wd[chan]->ir.x - m_cursor[chan].width() / 2, wd[chan]->ir.y - m_cursor[chan].height() / 2); + } + else if (m_show_pointer[chan]) + { + m_cursor[chan].draw(stickPointer_x[chan], stickPointer_y[chan], 0); + m_btnMgr.mouse(chan, stickPointer_x[chan] - m_cursor[chan].width() / 2, stickPointer_y[chan] - m_cursor[chan].height() / 2); + } + } + ShowMainZone(); + ShowMainZone2(); + ShowMainZone3(); + ShowPrevZone(); + ShowNextZone(); + ShowGameZone(); +} + +void CMenu::ButtonsPressed() +{ + wii_btnsPressed = 0; + gc_btnsPressed = 0; + + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + wii_btnsPressed |= WPAD_ButtonsDown(chan); + gc_btnsPressed |= PAD_ButtonsDown(chan); + } +} + +void CMenu::ButtonsHeld() +{ + wii_btnsHeld = 0; + gc_btnsHeld = 0; + + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + wii_btnsHeld |= WPAD_ButtonsHeld(chan); + gc_btnsHeld |= PAD_ButtonsHeld(chan); + } +} + +void CMenu::LeftStick() +{ + u8 speed = 0,pSpeed = 0; + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + + if (left_stick_mag[chan] > 0.15 || abs(PAD_StickX(chan)) > 20 || abs(PAD_StickY(chan)) > 20) + { + m_show_pointer[chan] = true; + if (LEFT_STICK_LEFT) + { + speed = (u8)(left_stick_mag[chan] * 10.00); + pSpeed = (u8)abs(PAD_StickX(chan))/10; + if (stickPointer_x[chan] > m_cursor[chan].width()/2) stickPointer_x[chan] = stickPointer_x[chan]-speed-pSpeed; + pointerhidedelay[chan] = 150; + } + if (LEFT_STICK_DOWN) + { + speed = (u8)(left_stick_mag[chan] * 10.00); + pSpeed = (u8)abs(PAD_StickY(chan))/10; + if (stickPointer_y[chan] < (m_vid.height() + (m_cursor[chan].height()/2))) stickPointer_y[chan] = stickPointer_y[chan]+speed+pSpeed; + pointerhidedelay[chan] = 150; + } + if (LEFT_STICK_RIGHT) + { + speed = (u8)(left_stick_mag[chan] * 10.00); + pSpeed = (u8)abs(PAD_StickX(chan))/10; + if (stickPointer_x[chan] < (m_vid.width() + (m_cursor[chan].width()/2))) stickPointer_x[chan] = stickPointer_x[chan]+speed+pSpeed; + pointerhidedelay[chan] = 150; + } + if (LEFT_STICK_UP) + { + speed = (u8)(left_stick_mag[chan] * 10.00); + pSpeed = (u8)abs(PAD_StickY(chan))/10; + if (stickPointer_y[chan] > m_cursor[chan].height()/2) stickPointer_y[chan] = stickPointer_y[chan]-speed-pSpeed; + pointerhidedelay[chan] = 150; + } + } + else + { + if(pointerhidedelay[chan] > 0 && !wii_btnsHeld && !wii_btnsPressed && !gc_btnsHeld && !gc_btnsPressed) + pointerhidedelay[chan]--; + else + { + if (!wii_btnsHeld && !wii_btnsPressed) + { + pointerhidedelay[chan] = 0; + stickPointer_x[chan] = (m_vid.width() + m_cursor[chan].width())/2; + stickPointer_y[chan] = (m_vid.height() + m_cursor[chan].height())/2; + } + else if (pointerhidedelay[chan] > 0) + pointerhidedelay[chan] = 150; + } + } + if (pointerhidedelay[chan] == 0) + m_show_pointer[chan] = false; + } +} + +bool CMenu::WPadIR_Valid(int chan) +{ + wd[chan] = WPAD_Data(chan); + if (wd[chan]->ir.valid) + return true; + return false; +} + +bool CMenu::WPadIR_ANY(void) +{ + return (wd[0]->ir.valid || wd[1]->ir.valid || wd[2]->ir.valid || wd[3]->ir.valid); +} + +bool CMenu::wii_btnRepeat(s64 btn) +{ + bool b = false; + + if (btn == WBTN_UP) + { + if(wii_btnsHeld & WBTN_UP) + { + if (m_wpadUpDelay == 0 || m_wpadUpDelay >= g_repeatDelay) + b = true; + if (m_wpadUpDelay < g_repeatDelay) + ++m_wpadUpDelay; + } + else + m_wpadUpDelay = 0; + } + else if (btn == WBTN_RIGHT) + { + if(wii_btnsHeld & WBTN_RIGHT) + { + if (m_wpadRightDelay == 0 || m_wpadRightDelay >= g_repeatDelay) + b = true; + if (m_wpadRightDelay < g_repeatDelay) + ++m_wpadRightDelay; + } + else + m_wpadRightDelay = 0; + } + else if (btn == WBTN_DOWN) + { + if(wii_btnsHeld & WBTN_DOWN) + { + if (m_wpadDownDelay == 0 || m_wpadDownDelay >= g_repeatDelay) + b = true; + if (m_wpadDownDelay < g_repeatDelay) + ++m_wpadDownDelay; + } + else + m_wpadDownDelay = 0; + } + else if (btn == WBTN_LEFT) + { + if(wii_btnsHeld & WBTN_LEFT) + { + if (m_wpadLeftDelay == 0 || m_wpadLeftDelay >= g_repeatDelay) + b = true; + if (m_wpadLeftDelay < g_repeatDelay) + ++m_wpadLeftDelay; + } + else + m_wpadLeftDelay = 0; + } + else if (btn == WBTN_A) + { + if(wii_btnsHeld & WBTN_A) + { + m_btnMgr.noClick(true); + if (m_wpadADelay == 0 || m_wpadADelay >= g_repeatDelay) + b = true; + if (m_wpadADelay < g_repeatDelay) + ++m_wpadADelay; + } + else + { + m_wpadADelay = 0; + m_btnMgr.noClick(); + } + } +/* else if (btn == WBTN_B) + { + if(wii_btnsHeld & WBTN_B) + { + m_btnMgr.noClick(true); + if (m_wpadBDelay == 0 || m_wpadBDelay >= g_repeatDelay) + b = true; + if (m_wpadBDelay < g_repeatDelay) + ++m_wpadBDelay; + } + else + { + m_wpadBDelay = 0; + m_btnMgr.noClick(); + } + } */ + return b; +} + +bool CMenu::gc_btnRepeat(s64 btn) +{ + bool b = false; + if (btn == GBTN_UP) + { + if(gc_btnsHeld & GBTN_UP) + { + if (m_padUpDelay == 0 || m_padUpDelay >= g_repeatDelay) + b = true; + if (m_padUpDelay < g_repeatDelay) + ++m_padUpDelay; + } + else + m_padUpDelay = 0; + } + else if (btn == GBTN_RIGHT) + { + if(gc_btnsHeld & GBTN_RIGHT) + { + if (m_padRightDelay == 0 || m_padRightDelay >= g_repeatDelay) + b = true; + if (m_padRightDelay < g_repeatDelay) + ++m_padRightDelay; + } + else + m_padRightDelay = 0; + } + else if (btn == GBTN_DOWN) + { + if(gc_btnsHeld & GBTN_DOWN) + { + if (m_padDownDelay == 0 || m_padDownDelay >= g_repeatDelay) + b = true; + if (m_padDownDelay < g_repeatDelay) + ++m_padDownDelay; + } + else + m_padDownDelay = 0; + } + else if (btn == GBTN_LEFT) + { + if(gc_btnsHeld & GBTN_LEFT) + { + + if (m_padLeftDelay == 0 || m_padLeftDelay >= g_repeatDelay) + b = true; + if (m_padLeftDelay < g_repeatDelay) + ++m_padLeftDelay; + } + else + m_padLeftDelay = 0; + } + else if (btn == GBTN_A) + { + if(gc_btnsHeld & GBTN_A) + { + m_btnMgr.noClick(true); + if (m_padADelay == 0 || m_padADelay >= g_repeatDelay) + b = true; + if (m_padADelay < g_repeatDelay) + ++m_padADelay; + } + else + { + m_padADelay = 0; + m_btnMgr.noClick(); + } + } +/* else if (btn == GBTN_B) + { + if(gc_btnsHeld & GBTN_B) + { + m_btnMgr.noClick(true); + if (m_padBDelay == 0 || m_padBDelay >= g_repeatDelay) + b = true; + if (m_padBDelay < g_repeatDelay) + ++m_padBDelay; + } + else + { + m_padBDelay = 0; + m_btnMgr.noClick(); + } + } */ + return b; +} +bool CMenu::lStick_Up(void) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if ((LEFT_STICK_ANG_UP && left_stick_mag[chan] > 0.15) || PAD_StickY(chan) > 20) + return true; + return false; +} +bool CMenu::lStick_Right(void) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if ((LEFT_STICK_ANG_RIGHT && left_stick_mag[chan] > 0.15) || PAD_StickX(chan) > 20) + return true; + return false; +} +bool CMenu::lStick_Down(void) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if ((LEFT_STICK_ANG_DOWN && left_stick_mag[chan] > 0.15) || PAD_StickY(chan) < -20) + return true; + return false; +} +bool CMenu::lStick_Left(void) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if ((LEFT_STICK_ANG_LEFT && left_stick_mag[chan] > 0.15) || PAD_StickX(chan) < -20) + return true; + return false; +} +bool CMenu::rStick_Up(void) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if ((RIGHT_STICK_ANG_UP && right_stick_mag[chan] > 0.15 && right_stick_skip[chan] == 0) || PAD_SubStickY(chan) > 20) + return true; + return false; +} +bool CMenu::rStick_Right(void) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if ((RIGHT_STICK_ANG_RIGHT && right_stick_mag[chan] > 0.15 && right_stick_skip[chan] == 0) || PAD_SubStickX(chan) > 20) + return true; + return false; +} +bool CMenu::rStick_Down(void) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if ((RIGHT_STICK_ANG_DOWN && right_stick_mag[chan] > 0.15 && right_stick_skip[chan] == 0) || PAD_SubStickY(chan) < -20) + return true; + return false; +} +bool CMenu::rStick_Left(void) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if ((RIGHT_STICK_ANG_LEFT && right_stick_mag[chan] > 0.15 && right_stick_skip[chan] == 0) || PAD_SubStickX(chan) < -20) + return true; + return false; +} + +bool CMenu::wRoll_Left(void) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if (WBTN_B_HELD && (wmote_roll[chan] < -5) && wmote_roll_skip[chan] == 0) + return true; + return false; +} + +bool CMenu::wRoll_Right(void) +{ + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if (WBTN_B_HELD && (wmote_roll[chan] > 5) && wmote_roll_skip[chan] == 0) + return true; + return false; +} + +void CMenu::_getGrabStatus(void) +{ + static bool wGrabStatus[WPAD_MAX_WIIMOTES] = {0}; + static float wX[WPAD_MAX_WIIMOTES] = {0}; + static float wY[WPAD_MAX_WIIMOTES] = {0}; + + static bool gGrabStatus[WPAD_MAX_WIIMOTES] = {0}; + static float gX[WPAD_MAX_WIIMOTES] = {0}; + static float gY[WPAD_MAX_WIIMOTES] = {0}; + + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + { + wGrabStatus[chan] = WBTN_B & WPAD_ButtonsHeld(chan); + gGrabStatus[chan] = GBTN_B & PAD_ButtonsHeld(chan); + + if((wGrabStatus[chan] && wX[chan] > 0 && wd[chan]->ir.x < wX[chan] - 30) + || (gGrabStatus[chan] && gX[chan] > 0 && stickPointer_x[chan] < gX[chan])) + { + //for(int i = 0; i != (wX[chan] - wd[chan]->ir.x)/30 && i != (gX[chan] - stickPointer_x[chan])/30; i++) + m_cf.left(); + } + if((wGrabStatus[chan] && wX[chan] > 0 && wd[chan]->ir.x > wX[chan] + 30) + || (gGrabStatus[chan] && gX[chan] > 0 && stickPointer_x[chan] > gX[chan])) + { + //for(int i = 0; i != (wd[chan]->ir.x - wX[chan])/30 && i != (gX[chan] - stickPointer_x[chan])/30; i++) + m_cf.right(); + } + if((wGrabStatus[chan] && wY[chan] > 0 && wd[chan]->ir.y < wY[chan] - 30) + || (gGrabStatus[chan] && gY[chan] > 0 && stickPointer_y[chan] < gY[chan])) + { + //for(int i = 0; i != (wY[chan] - wd[chan]->ir.y)/30 && i != (gY[chan] - stickPointer_y[chan])/30; i++) + m_cf.up(); + } + if((wGrabStatus[chan] && wY[chan] > 0 && wd[chan]->ir.y > wY[chan] + 30) + || (gGrabStatus[chan] && gY[chan] > 0 && stickPointer_y[chan] > gY[chan])) + { + //for(int i = 0; i != (wd[chan]->ir.y - wY[chan])/30 && i != (stickPointer_y[chan] - gY[chan])/30; i++) + m_cf.down(); + } + + if (wGrabStatus[chan]) + { + wX[chan] = wd[chan]->ir.x; + wY[chan] = wd[chan]->ir.y; + } + else + { + wX[chan] = 0; + wY[chan] = 0; + } + + if(gGrabStatus[chan]) + { + gX[chan] = stickPointer_x[chan]; + gY[chan] = stickPointer_y[chan]; + } + else + { + gX[chan] = 0; + gY[chan] = 0; + } + } +} + +void CMenu::ShowZone(SZone zone, bool &showZone) +{ + if (zone.hide) + { + showZone = false; + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if ((WPadIR_Valid(chan) || m_show_pointer[chan]) && m_cursor[chan].x() >= zone.x && m_cursor[chan].y() >= zone.y + && m_cursor[chan].x() < zone.x + zone.w && m_cursor[chan].y() < zone.y + zone.h) + showZone = true; + } + else + showZone = true; +} + +void CMenu::ShowMainZone() +{ + ShowZone(m_mainButtonsZone, m_show_zone_main); +} + +void CMenu::ShowMainZone2() +{ + ShowZone(m_mainButtonsZone2, m_show_zone_main2); +} + +void CMenu::ShowMainZone3() +{ + ShowZone(m_mainButtonsZone3, m_show_zone_main3); +} + +void CMenu::ShowPrevZone() +{ + ShowZone(m_mainPrevZone, m_show_zone_prev); +} + +void CMenu::ShowNextZone() +{ + ShowZone(m_mainNextZone, m_show_zone_next); +} + +void CMenu::ShowGameZone() +{ + ShowZone(m_gameButtonsZone, m_show_zone_game); +} \ No newline at end of file diff --git a/source/menu/menu_main.cpp b/source/menu/menu_main.cpp new file mode 100644 index 00000000..d44cf137 --- /dev/null +++ b/source/menu/menu_main.cpp @@ -0,0 +1,860 @@ + +#include "menu.hpp" +#include "loader/wdvd.h" +#include "network/gcard.h" +#include "DeviceHandler.hpp" +#include +#include +#include + +#include "wbfs.h" +#include "gecko.h" +#include "sys.h" +#include "disc.h" + +using namespace std; + +extern const u8 btnconfig_png[]; +extern const u8 btnconfigs_png[]; +extern const u8 btninfo_png[]; +extern const u8 btninfos_png[]; +extern const u8 btnquit_png[]; +extern const u8 btnquits_png[]; +extern const u8 btnnext_png[]; +extern const u8 btnnexts_png[]; +extern const u8 btnprev_png[]; +extern const u8 btnprevs_png[]; +extern const u8 btnchannel_png[]; +extern const u8 btnchannels_png[]; +extern const u8 btnusb_png[]; +extern const u8 btnusbs_png[]; +extern const u8 btndvd_png[]; +extern const u8 btndvds_png[]; +extern const u8 favoriteson_png[]; +extern const u8 favoritesons_png[]; +extern const u8 favoritesoff_png[]; +extern const u8 favoritesoffs_png[]; + +extern const u8 btnhomebrew_png[]; + +static inline int loopNum(int i, int s) +{ + return i < 0 ? (s - (-i % s)) % s : i % s; +} + +void CMenu::_hideMain(bool instant) +{ + m_btnMgr.hide(m_mainBtnNext, instant); + m_btnMgr.hide(m_mainBtnPrev, instant); + m_btnMgr.hide(m_mainBtnConfig, instant); + m_btnMgr.hide(m_mainBtnInfo, instant); + m_btnMgr.hide(m_mainBtnQuit, instant); + m_btnMgr.hide(m_mainBtnHomebrew, instant); + m_btnMgr.hide(m_mainBtnChannel, instant); + m_btnMgr.hide(m_mainBtnUsb, instant); + m_btnMgr.hide(m_mainBtnDVD, instant); + m_btnMgr.hide(m_mainBtnInit, instant); + m_btnMgr.hide(m_mainBtnInit2, instant); + m_btnMgr.hide(m_mainLblInit, instant); + m_btnMgr.hide(m_mainBtnFavoritesOn, instant); + m_btnMgr.hide(m_mainBtnFavoritesOff, instant); + m_btnMgr.hide(m_mainLblLetter, instant); + m_btnMgr.hide(m_mainLblNotice, instant); + for (u32 i = 0; i < ARRAY_SIZE(m_mainLblUser); ++i) + if (m_mainLblUser[i] != -1u) + m_btnMgr.hide(m_mainLblUser[i], instant); +} + +static bool show_homebrew = true; + +void CMenu::_showMain(void) +{ + _hideWaitMessage(); +#ifdef SHOWMEM + m_btnMgr.show(m_mem2FreeSize); +#endif + m_vid.set2DViewport(m_cfg.getInt("GENERAL", "tv_width", 640), m_cfg.getInt("GENERAL", "tv_height", 480), + m_cfg.getInt("GENERAL", "tv_x", 0), m_cfg.getInt("GENERAL", "tv_y", 0)); + _setBg(m_gameBg, m_gameBgLQ); + m_btnMgr.show(m_mainBtnInfo); + m_btnMgr.show(m_mainBtnConfig); + m_btnMgr.show(m_mainBtnQuit); + + switch(m_current_view) + { + case COVERFLOW_HOMEBREW: + m_btnMgr.show(m_mainBtnUsb); + break; + case COVERFLOW_CHANNEL: + if(!m_locked && show_homebrew) + m_btnMgr.show(m_mainBtnHomebrew); + else + m_btnMgr.show(m_mainBtnUsb); + break; + default: + m_btnMgr.show(m_mainBtnChannel); + break; + } + + for (u32 i = 1; i < ARRAY_SIZE(m_mainLblUser); ++i) + if (m_mainLblUser[i] != -1u) + m_btnMgr.show(m_mainLblUser[i]); + + if (m_gameList.empty()) + { + m_btnMgr.show(m_mainBtnInit); + m_btnMgr.show(m_mainBtnInit2); + m_btnMgr.show(m_mainLblInit); + } +} + +int CMenu::GetCoverStatusAsync(CMenu *m) +{ + u32 disc_check = 0; + WDVD_GetCoverStatus(&disc_check); + m->m_initialCoverStatusComplete = true; + return 0; +} + +void CMenu::LoadView(void) +{ + _showWaitMessage(); + _hideMain(); + + m_curGameId = m_cf.getId(); + + _loadList(); + _showMain(); + _initCF(); + + _loadCFLayout(m_cfg.getInt(_domainFromView(), "last_cf_mode", 1)); + m_cf.applySettings(); + + char *mode = (m_current_view == COVERFLOW_CHANNEL && m_cfg.getBool("NAND", "disable", true)) ? (char *)"NAND" : (char *)DeviceName[currentPartition]; + + for(u8 i = 0; strncmp((const char *)&mode[i], "\0", 1) != 0; i++) + mode[i] = toupper(mode[i]); + + m_showtimer=60; + m_btnMgr.setText(m_mainLblNotice, (string)mode); + m_btnMgr.show(m_mainLblNotice); +} + +int CMenu::main(void) +{ + wstringEx curLetter; + string prevTheme = m_cfg.getString("GENERAL", "theme", "default"); + bool use_grab = m_cfg.getBool("GENERAL", "use_grab", false); + show_homebrew = !m_cfg.getBool("HOMEBREW", "disable", false); + + m_reload = false; + static u32 disc_check = 0; + int done = 0; + + if (m_cfg.getBool("GENERAL", "async_network", false) || has_enabled_providers()) + _initAsyncNetwork(); + + SetupInput(); + MusicPlayer::Instance()->Play(); + _loadList(); + _showMain(); + m_curGameId.clear(); + _initCF(); + + lwp_t coverStatus = LWP_THREAD_NULL; + unsigned int stack_size = (unsigned int)32768; + SmartBuf coverstatus_stack = smartMem2Alloc(stack_size); + LWP_CreateThread(&coverStatus, (void *(*)(void *))CMenu::GetCoverStatusAsync, (void *)this, coverstatus_stack.get(), stack_size, 40); + while (true) + { + _mainLoopCommon(true); + + if (m_initialCoverStatusComplete) + { + LWP_JoinThread(coverStatus, NULL); + coverStatus = LWP_THREAD_NULL; + SMART_FREE(coverstatus_stack); + WDVD_GetCoverStatus(&disc_check); + } + + //Check for exit or reload request + if (BTN_HOME_PRESSED) + { + gprintf("Home pressed, quit\n"); + bool exitSet = false; + if(!m_locked && !m_disable_exit) + { + exitSet = true; + + if(BTN_PLUS_HELD) Sys_ExitTo(EXIT_TO_HBC); + else if(BTN_MINUS_HELD) Sys_ExitTo(EXIT_TO_MENU); + else if(BTN_1_HELD) Sys_ExitTo(EXIT_TO_PRIILOADER); + else if(BTN_2_HELD) //Check that the files are there, or ios will hang. + { + struct stat dummy; + if(DeviceHandler::Instance()->IsInserted(SD) && + stat(sfmt("%s:/bootmii/armboot.bin", DeviceName[SD]).c_str(), &dummy) == 0 && + stat(sfmt("%s:/bootmii/ppcboot.elf", DeviceName[SD]).c_str(), &dummy) == 0) + Sys_ExitTo(EXIT_TO_BOOTMII); + else Sys_ExitTo(EXIT_TO_HBC); + } + else + exitSet = false; + } + m_reload = (BTN_B_HELD || m_disable_exit); + if (!exitSet && !m_reload) + { + // Mark exiting to prevent soundhandler from restarting + extern bool exiting; + exiting = true; + } + break; + } + m_btnMgr.noClick(true); + if (!m_btnMgr.selected(m_mainBtnQuit) && !BTN_B_HELD && (BTN_UP_REPEAT || RIGHT_STICK_UP)) + m_cf.up(); + if (!m_btnMgr.selected(m_mainBtnQuit) && ((!BTN_B_HELD && (BTN_RIGHT_REPEAT || RIGHT_STICK_RIGHT)) || WROLL_RIGHT)) + m_cf.right(); + if (!m_btnMgr.selected(m_mainBtnQuit) && !BTN_B_HELD && (BTN_DOWN_REPEAT || RIGHT_STICK_DOWN)) + m_cf.down(); + if (!m_btnMgr.selected(m_mainBtnQuit) && ((!BTN_B_HELD && (BTN_LEFT_REPEAT || RIGHT_STICK_LEFT)) || WROLL_LEFT)) + m_cf.left(); + m_btnMgr.noClick(false); + //CF Layout select + if (!BTN_B_HELD && (BTN_1_PRESSED || BTN_2_PRESSED)) + { + m_btnMgr.noClick(true); + if (!m_btnMgr.selected(m_mainBtnQuit)) + { + const char *domain = _domainFromView(); + s8 direction = BTN_1_PRESSED ? 1 : -1; + int cfVersion = loopNum(m_cfg.getInt(domain, "last_cf_mode", 1) + direction, m_numCFVersions); + _loadCFLayout(cfVersion); + m_cf.applySettings(); + m_cfg.setInt(domain, "last_cf_mode", cfVersion); + } + m_btnMgr.noClick(false); + } + //Search by pages + else if (!BTN_B_HELD && BTN_MINUS_PRESSED) + m_cf.pageUp(); + else if (!BTN_B_HELD && BTN_PLUS_PRESSED) + m_cf.pageDown(); + else if (BTN_B_HELD) + { + const char *domain = _domainFromView(); + + //Search by Alphabet + if (BTN_DOWN_PRESSED || BTN_UP_PRESSED) + { + int sorting = m_cfg.getInt(domain, "sort", SORT_ALPHA); + if (sorting != SORT_ALPHA && sorting != SORT_PLAYERS && sorting != SORT_WIFIPLAYERS && sorting != SORT_GAMEID) + { + m_cf.setSorting((Sorting)SORT_ALPHA); + m_cfg.setInt(domain, "sort", SORT_ALPHA); + } + wchar_t c[2] = {0, 0}; + BTN_UP_PRESSED ? m_cf.prevLetter(c) : m_cf.nextLetter(c); + + curLetter.clear(); + curLetter = wstringEx(c); + + m_showtimer = 60; + if(sorting == SORT_ALPHA) + { + m_btnMgr.setText(m_mainLblLetter, curLetter); + m_btnMgr.show(m_mainLblLetter); + } + else + { + curLetter = _getNoticeTranslation(sorting, curLetter); + + m_btnMgr.setText(m_mainLblNotice, curLetter); + m_btnMgr.show(m_mainLblNotice); + } + } + //Change songs + else if (BTN_LEFT_PRESSED) + MusicPlayer::Instance()->Previous(); + else if (BTN_RIGHT_PRESSED) + MusicPlayer::Instance()->Next(); + //Sorting Selection + else if (BTN_PLUS_PRESSED && !m_locked) + { + u32 sort = 0; + sort = loopNum((m_cfg.getInt(domain, "sort", 0)) + 1, SORT_MAX - 1); + m_cf.setSorting((Sorting)sort); + m_cfg.setInt(domain, "sort", sort); + wstringEx curSort ; + if (sort == SORT_ALPHA) + curSort = m_loc.getWString(m_curLanguage, "alphabetically", L"Alphabetically"); + else if (sort == SORT_PLAYCOUNT) + curSort = m_loc.getWString(m_curLanguage, "byplaycount", L"By Play Count"); + else if (sort == SORT_LASTPLAYED) + curSort = m_loc.getWString(m_curLanguage, "bylastplayed", L"By Last Played"); + else if (sort == SORT_GAMEID) + curSort = m_loc.getWString(m_curLanguage, "bygameid", L"By Game I.D."); + else if (sort == SORT_ESRB) + curSort = m_loc.getWString(m_curLanguage, "byesrb", L"By ESRB"); + else if (sort == SORT_WIFIPLAYERS) + curSort = m_loc.getWString(m_curLanguage, "bywifiplayers", L"By Wifi Players"); + else if (sort == SORT_PLAYERS) + curSort = m_loc.getWString(m_curLanguage, "byplayers", L"By Players"); + else if (sort == SORT_CONTROLLERS) + curSort = m_loc.getWString(m_curLanguage, "bycontrollers", L"By Controllers"); + + m_showtimer=60; + m_btnMgr.setText(m_mainLblNotice, curSort); + m_btnMgr.show(m_mainLblNotice); + } + //Partition Selection + else if (BTN_MINUS_PRESSED && !m_locked) + { + bool block = m_current_view == COVERFLOW_CHANNEL && m_cfg.getBool("NAND", "disable", true); + char *partition; + if(!block) + { + _showWaitMessage(); + _hideMain(); + + bool isD2Xv7 = IOS_GetRevision() % 100 == 7; + u8 limiter = 0; + currentPartition = loopNum(currentPartition + 1, (int)USB8); + while(!DeviceHandler::Instance()->IsInserted(currentPartition) || + (m_current_view == COVERFLOW_CHANNEL && (DeviceHandler::Instance()->GetFSType(currentPartition) != PART_FS_FAT || + (!isD2Xv7 && DeviceHandler::Instance()->PathToDriveType(m_appDir.c_str()) == currentPartition) || + (!isD2Xv7 && DeviceHandler::Instance()->PathToDriveType(m_dataDir.c_str()) == currentPartition))) || + (m_current_view == COVERFLOW_HOMEBREW && DeviceHandler::Instance()->GetFSType(currentPartition) == PART_FS_WBFS)) + { + currentPartition = loopNum(currentPartition + 1, (int)USB8); + if(limiter > 10) break; + limiter++; + } + + partition = (char *)DeviceName[currentPartition]; + m_cfg.setInt(_domainFromView(), "partition", currentPartition); + + } + else partition = (char *)"NAND"; + + for(u8 i = 0; strncmp((const char *)&partition[i], "\0", 1) != 0; i++) + partition[i] = toupper(partition[i]); + + gprintf("Next item: %s\n", partition); + + m_showtimer=60; + m_btnMgr.setText(m_mainLblNotice, (string)partition); + m_btnMgr.show(m_mainLblNotice); + + if(!block) + { + _loadList(); + _showMain(); + _initCF(); + } + } + } + if (BTN_B_PRESSED) + { + //Events to Show Categories + if (m_btnMgr.selected(m_mainBtnFavoritesOn) || m_btnMgr.selected(m_mainBtnFavoritesOff)) + { + // Event handler to show categories for selection + _hideMain(); + _CategorySettings(); + _showMain(); + _initCF(); + } + //Events to Switch off/on nand emu + else if (m_btnMgr.selected(m_mainBtnChannel) || m_btnMgr.selected(m_mainBtnUsb) || m_btnMgr.selected(m_mainBtnHomebrew)) + { + m_cfg.setBool("NAND", "disable", !m_cfg.getBool("NAND", "disable", true)); + gprintf("EmuNand is %s\n", m_cfg.getBool("NAND", "disable", true) ? "Disabled" : "Enabled"); + + m_category = m_cat.getInt("NAND", "category", 0); + m_current_view = COVERFLOW_CHANNEL; + + LoadView(); + } + else if (m_btnMgr.selected(m_mainBtnNext) || m_btnMgr.selected(m_mainBtnPrev)) + { + const char *domain = _domainFromView(); + int sorting = m_cfg.getInt(domain, "sort", SORT_ALPHA); + if (sorting != SORT_ALPHA && sorting != SORT_PLAYERS && sorting != SORT_WIFIPLAYERS && sorting != SORT_GAMEID) + { + m_cf.setSorting((Sorting)SORT_ALPHA); + m_cfg.setInt(domain, "sort", SORT_ALPHA); + } + wchar_t c[2] = {0, 0}; + m_btnMgr.selected(m_mainBtnPrev) ? m_cf.prevLetter(c) : m_cf.nextLetter(c); + m_showtimer = 60; + + curLetter.clear(); + curLetter = wstringEx(c); + + if(sorting == SORT_ALPHA) + { + m_btnMgr.setText(m_mainLblLetter, curLetter); + m_btnMgr.show(m_mainLblLetter); + } + else + { + curLetter = _getNoticeTranslation(sorting, curLetter); + + m_btnMgr.setText(m_mainLblNotice, curLetter); + m_btnMgr.show(m_mainLblNotice); + } + } + } + else if (done==0 && m_cat.getBool("GENERAL", "category_on_start", false)) + { + done = 1; //set done so it doesnt keep doing it + // show categories menu + _hideMain(); + _CategorySettings(); + _showMain(); + m_curGameId = m_cf.getId(); + _initCF(); + } + //Handling input when other gui buttons are selected + else if (BTN_A_PRESSED) + { + if (m_btnMgr.selected(m_mainBtnPrev)) + m_cf.pageUp(); + else if (m_btnMgr.selected(m_mainBtnNext)) + m_cf.pageDown(); + else if (m_btnMgr.selected(m_mainBtnQuit)) + { + if(!m_locked && !m_disable_exit) + { + struct stat dummy; + if(BTN_PLUS_HELD) Sys_ExitTo(EXIT_TO_HBC); + else if(BTN_MINUS_HELD) Sys_ExitTo(EXIT_TO_MENU); + else if(BTN_1_HELD) Sys_ExitTo(EXIT_TO_PRIILOADER); + else if(BTN_2_HELD) //Check that the files are there, or ios will hang. + { + if(DeviceHandler::Instance()->IsInserted(SD) && + stat(sfmt("%s:/bootmii/armboot.bin", DeviceName[SD]).c_str(), &dummy) == 0 && + stat(sfmt("%s:/bootmii/ppcboot.elf", DeviceName[SD]).c_str(), &dummy) == 0) + Sys_ExitTo(EXIT_TO_BOOTMII); + else Sys_ExitTo(EXIT_TO_HBC); + } + } + m_reload = (BTN_B_HELD || m_disable_exit); + break; + } + else if (m_btnMgr.selected(m_mainBtnChannel) || m_btnMgr.selected(m_mainBtnUsb) || m_btnMgr.selected(m_mainBtnHomebrew)) + { + if (m_current_view == COVERFLOW_USB) + m_current_view = COVERFLOW_CHANNEL; + else if (m_current_view == COVERFLOW_CHANNEL) + m_current_view = (!m_locked && show_homebrew) ? COVERFLOW_HOMEBREW : COVERFLOW_USB; + else if (m_current_view == COVERFLOW_HOMEBREW) + m_current_view = COVERFLOW_USB; + + m_category = m_cat.getInt(_domainFromView(), "category", 0); + LoadView(); + } + else if (m_btnMgr.selected(m_mainBtnInit)) + { + if (!m_locked) + { + _hideMain(); + _wbfsOp(CMenu::WO_ADD_GAME); + if (prevTheme != m_cfg.getString("GENERAL", "theme")) + { + m_reload = true; + break; + } + _showMain(); + } + } + else if (m_btnMgr.selected(m_mainBtnInit2)) + { + _hideMain(); + _config(1); + if (prevTheme != m_cfg.getString("GENERAL", "theme")) + { + m_reload = true; + break; + } + _showMain(); + } + else if (m_btnMgr.selected(m_mainBtnConfig)) + { + _hideMain(); + _config(1); + if (prevTheme != m_cfg.getString("GENERAL", "theme") || m_reload == true) + { + m_reload = true; + break; + } + _showMain(); + } + else if (m_btnMgr.selected(m_mainBtnInfo)) + { + _hideMain(); + _about(); + if(m_exit)break; + _showMain(); + } + else if (m_btnMgr.selected(m_mainBtnDVD)) + { + _showWaitMessage(); + _hideMain(true); + dir_discHdr hdr; + memset(&hdr, 0, sizeof(dir_discHdr)); + memcpy(&hdr.hdr.id, "dvddvd", 6); + _launchGame(&hdr, true); + _showMain(); + } + else if (m_btnMgr.selected(m_mainBtnFavoritesOn) || m_btnMgr.selected(m_mainBtnFavoritesOff)) + { + m_favorites = !m_favorites; + m_cfg.setInt("GENERAL", "favorites", m_favorites); + m_curGameId = m_cf.getId(); + _initCF(); + } + else if (!m_cf.empty()) + { + if (m_cf.select()) + { + _hideMain(); + _game(BTN_B_HELD); + if(m_exit) break; + m_cf.cancel(); + _showMain(); + } + } + } + if(use_grab) _getGrabStatus(); + + if (m_showtimer > 0) + if (--m_showtimer == 0) + { + m_btnMgr.hide(m_mainLblLetter); + m_btnMgr.hide(m_mainLblNotice); + } + //zones, showing and hiding buttons + if (!m_gameList.empty() && m_show_zone_prev) + m_btnMgr.show(m_mainBtnPrev); + else + m_btnMgr.hide(m_mainBtnPrev); + if (!m_gameList.empty() && m_show_zone_next) + m_btnMgr.show(m_mainBtnNext); + else + m_btnMgr.hide(m_mainBtnNext); + if (!m_gameList.empty() && m_show_zone_main) + { + m_btnMgr.show(m_mainLblUser[0]); + m_btnMgr.show(m_mainLblUser[1]); + m_btnMgr.show(m_mainBtnInfo); + m_btnMgr.show(m_mainBtnConfig); + m_btnMgr.show(m_mainBtnQuit); + static bool change = m_favorites; + m_btnMgr.show(m_favorites ? m_mainBtnFavoritesOn : m_mainBtnFavoritesOff, change != m_favorites); + m_btnMgr.hide(m_favorites ? m_mainBtnFavoritesOff : m_mainBtnFavoritesOn, change != m_favorites); + change = m_favorites; + } + else + { + m_btnMgr.hide(m_mainLblUser[0]); + m_btnMgr.hide(m_mainLblUser[1]); + m_btnMgr.hide(m_mainBtnConfig); + m_btnMgr.hide(m_mainBtnInfo); + m_btnMgr.hide(m_mainBtnQuit); + m_btnMgr.hide(m_mainBtnFavoritesOn); + m_btnMgr.hide(m_mainBtnFavoritesOff); + } + if (!m_cfg.getBool("GENERAL", "hideviews", false) && (m_gameList.empty() || m_show_zone_main2)) + { + switch(m_current_view) + { + case COVERFLOW_HOMEBREW: + m_btnMgr.show(m_mainBtnUsb); + break; + case COVERFLOW_CHANNEL: + if(!m_locked && show_homebrew) + m_btnMgr.show(m_mainBtnHomebrew); + else + m_btnMgr.show(m_mainBtnUsb); + break; + default: + m_btnMgr.show(m_mainBtnChannel); + break; + } + m_btnMgr.show(m_mainLblUser[2]); + m_btnMgr.show(m_mainLblUser[3]); + } + else + { + m_btnMgr.hide(m_mainBtnHomebrew); + m_btnMgr.hide(m_mainBtnChannel); + m_btnMgr.hide(m_mainBtnUsb); + m_btnMgr.hide(m_mainLblUser[2]); + m_btnMgr.hide(m_mainLblUser[3]); + } + if ((disc_check & 0x2) && (m_gameList.empty() || m_show_zone_main3)) + { + m_btnMgr.show(m_mainBtnDVD); + m_btnMgr.show(m_mainLblUser[4]); + m_btnMgr.show(m_mainLblUser[5]); + } + else + { + m_btnMgr.hide(m_mainBtnDVD); + m_btnMgr.hide(m_mainLblUser[4]); + m_btnMgr.hide(m_mainLblUser[5]); + } + // + for(int chan = WPAD_MAX_WIIMOTES-1; chan >= 0; chan--) + if (WPadIR_Valid(chan) || (m_show_pointer[chan] && !WPadIR_Valid(chan))) + m_cf.mouse(m_vid, chan, m_cursor[chan].x(), m_cursor[chan].y()); + else + m_cf.mouse(m_vid, chan, -1, -1); + } + _showWaitMessage(); + // + gprintf("Invalidate GX\n"); + + GX_InvVtxCache(); + GX_InvalidateTexAll(); + gprintf("Clear coverflow\n"); + m_cf.clear(); + gprintf("Saving configuration files\n"); + m_cfg.save(); + m_cat.save(); +// m_loc.save(); + gprintf("Wait for dvd\n"); + LWP_JoinThread(coverStatus, NULL); + coverStatus = LWP_THREAD_NULL; + SMART_FREE(coverstatus_stack); + gprintf("Done with main\n"); + return m_reload ? 1 : 0; +} + +void CMenu::_initMainMenu(CMenu::SThemeData &theme) +{ + STexture texQuit; + STexture texQuitS; + STexture texInfo; + STexture texInfoS; + STexture texConfig; + STexture texConfigS; + STexture texDVD; + STexture texDVDs; + STexture texUsb; + STexture texUsbs; + STexture texChannel; + STexture texChannels; + STexture texHomebrew; + STexture texHomebrews; + STexture texPrev; + STexture texPrevS; + STexture texNext; + STexture texNextS; + STexture texFavOn; + STexture texFavOnS; + STexture texFavOff; + STexture texFavOffS; + STexture bgLQ; + STexture emptyTex; + + m_mainBg = _texture(theme.texSet, "MAIN/BG", "texture", theme.bg); + if (m_theme.loaded() && STexture::TE_OK == bgLQ.fromPNGFile(sfmt("%s/%s", m_themeDataDir.c_str(), m_theme.getString("MAIN/BG", "texture").c_str()).c_str(), GX_TF_CMPR, ALLOC_MEM2, 64, 64)) + m_mainBgLQ = bgLQ; + + texQuit.fromPNG(btnquit_png); + texQuitS.fromPNG(btnquits_png); + texInfo.fromPNG(btninfo_png); + texInfoS.fromPNG(btninfos_png); + texConfig.fromPNG(btnconfig_png); + texConfigS.fromPNG(btnconfigs_png); + texDVD.fromPNG(btndvd_png); + texDVDs.fromPNG(btndvds_png); + texUsb.fromPNG(btnusb_png); + texUsbs.fromPNG(btnusbs_png); + texChannel.fromPNG(btnchannel_png); + texChannels.fromPNG(btnchannels_png); + texHomebrew.fromPNG(btnhomebrew_png); + texHomebrews.fromPNG(btnhomebrew_png); + texPrev.fromPNG(btnprev_png); + texPrevS.fromPNG(btnprevs_png); + texNext.fromPNG(btnnext_png); + texNextS.fromPNG(btnnexts_png); + texFavOn.fromPNG(favoriteson_png); + texFavOnS.fromPNG(favoritesons_png); + texFavOff.fromPNG(favoritesoff_png); + texFavOffS.fromPNG(favoritesoffs_png); + + _addUserLabels(theme, m_mainLblUser, ARRAY_SIZE(m_mainLblUser), "MAIN"); + + m_mainBtnInfo = _addPicButton(theme, "MAIN/INFO_BTN", texInfo, texInfoS, 20, 412, 48, 48); + m_mainBtnConfig = _addPicButton(theme, "MAIN/CONFIG_BTN", texConfig, texConfigS, 70, 412, 48, 48); + m_mainBtnQuit = _addPicButton(theme, "MAIN/QUIT_BTN", texQuit, texQuitS, 570, 412, 48, 48); + m_mainBtnChannel = _addPicButton(theme, "MAIN/CHANNEL_BTN", texChannel, texChannels, 520, 412, 48, 48); + m_mainBtnHomebrew = _addPicButton(theme, "MAIN/HOMEBREW_BTN", texHomebrew, texHomebrews, 520, 412, 48, 48); + m_mainBtnUsb = _addPicButton(theme, "MAIN/USB_BTN", texUsb, texUsbs, 520, 412, 48, 48); + m_mainBtnDVD = _addPicButton(theme, "MAIN/DVD_BTN", texDVD, texDVDs, 470, 412, 48, 48); + m_mainBtnNext = _addPicButton(theme, "MAIN/NEXT_BTN", texNext, texNextS, 540, 146, 80, 80); + m_mainBtnPrev = _addPicButton(theme, "MAIN/PREV_BTN", texPrev, texPrevS, 20, 146, 80, 80); + m_mainBtnInit = _addButton(theme, "MAIN/BIG_SETTINGS_BTN", theme.titleFont, L"", 72, 180, 496, 96, CColor(0xFFFFFFFF)); + m_mainBtnInit2 = _addButton(theme, "MAIN/BIG_SETTINGS_BTN2", theme.titleFont, L"", 72, 290, 496, 96, CColor(0xFFFFFFFF)); + m_mainLblInit = _addLabel(theme, "MAIN/MESSAGE", theme.lblFont, L"", 40, 40, 560, 140, CColor(0xFFFFFFFF), FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_mainBtnFavoritesOn = _addPicButton(theme, "MAIN/FAVORITES_ON", texFavOn, texFavOnS, 300, 412, 56, 56); + m_mainBtnFavoritesOff = _addPicButton(theme, "MAIN/FAVORITES_OFF", texFavOff, texFavOffS, 300, 412, 56, 56); + m_mainLblLetter = _addLabel(theme, "MAIN/LETTER", theme.titleFont, L"", 540, 40, 80, 80, CColor(0xFFFFFFFF), FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, emptyTex); + m_mainLblNotice = _addLabel(theme, "MAIN/NOTICE", theme.titleFont, L"", 340, 40, 280, 80, CColor(0xFFFFFFFF), FTGX_JUSTIFY_RIGHT | FTGX_ALIGN_MIDDLE, emptyTex); +#ifdef SHOWMEM + m_mem2FreeSize = _addLabel(theme, "MEM2", theme.titleFont, L"", 40, 300, 480, 80, CColor(0xFFFFFFFF), FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, emptyTex); +#endif + // + m_mainPrevZone.x = m_theme.getInt("MAIN/ZONES", "prev_x", -32); + m_mainPrevZone.y = m_theme.getInt("MAIN/ZONES", "prev_y", -32); + m_mainPrevZone.w = m_theme.getInt("MAIN/ZONES", "prev_w", 182); + m_mainPrevZone.h = m_theme.getInt("MAIN/ZONES", "prev_h", 382); + m_mainPrevZone.hide = m_theme.getBool("MAIN/ZONES", "prev_hide", true); + + m_mainNextZone.x = m_theme.getInt("MAIN/ZONES", "next_x", 490); + m_mainNextZone.y = m_theme.getInt("MAIN/ZONES", "next_y", -32); + m_mainNextZone.w = m_theme.getInt("MAIN/ZONES", "next_w", 182); + m_mainNextZone.h = m_theme.getInt("MAIN/ZONES", "next_h", 382); + m_mainNextZone.hide = m_theme.getBool("MAIN/ZONES", "next_hide", true); + + m_mainButtonsZone.x = m_theme.getInt("MAIN/ZONES", "buttons_x", -32); + m_mainButtonsZone.y = m_theme.getInt("MAIN/ZONES", "buttons_y", 350); + m_mainButtonsZone.w = m_theme.getInt("MAIN/ZONES", "buttons_w", 704); + m_mainButtonsZone.h = m_theme.getInt("MAIN/ZONES", "buttons_h", 162); + m_mainButtonsZone.hide = m_theme.getBool("MAIN/ZONES", "buttons_hide", true); + + m_mainButtonsZone2.x = m_theme.getInt("MAIN/ZONES", "buttons2_x", -32); + m_mainButtonsZone2.y = m_theme.getInt("MAIN/ZONES", "buttons2_y", 350); + m_mainButtonsZone2.w = m_theme.getInt("MAIN/ZONES", "buttons2_w", 704); + m_mainButtonsZone2.h = m_theme.getInt("MAIN/ZONES", "buttons2_h", 162); + m_mainButtonsZone2.hide = m_theme.getBool("MAIN/ZONES", "buttons2_hide", true); + + m_mainButtonsZone3.x = m_theme.getInt("MAIN/ZONES", "buttons3_x", -32); + m_mainButtonsZone3.y = m_theme.getInt("MAIN/ZONES", "buttons3_y", 350); + m_mainButtonsZone3.w = m_theme.getInt("MAIN/ZONES", "buttons3_w", 704); + m_mainButtonsZone3.h = m_theme.getInt("MAIN/ZONES", "buttons3_h", 162); + m_mainButtonsZone3.hide = m_theme.getBool("MAIN/ZONES", "buttons3_hide", true); + // + _setHideAnim(m_mainBtnNext, "MAIN/NEXT_BTN", 0, 0, 0.f, 0.f); + _setHideAnim(m_mainBtnPrev, "MAIN/PREV_BTN", 0, 0, 0.f, 0.f); + _setHideAnim(m_mainBtnConfig, "MAIN/CONFIG_BTN", 0, 40, 0.f, 0.f); + _setHideAnim(m_mainBtnInfo, "MAIN/INFO_BTN", 0, 40, 0.f, 0.f); + _setHideAnim(m_mainBtnQuit, "MAIN/QUIT_BTN", 0, 40, 0.f, 0.f); + _setHideAnim(m_mainBtnChannel, "MAIN/CHANNEL_BTN", 0, 40, 0.f, 0.f); + _setHideAnim(m_mainBtnHomebrew, "MAIN/HOMEBREW_BTN", 0, 40, 0.f, 0.f); + _setHideAnim(m_mainBtnUsb, "MAIN/USB_BTN", 0, 40, 0.f, 0.f); + _setHideAnim(m_mainBtnDVD, "MAIN/DVD_BTN", 0, 40, 0.f, 0.f); + _setHideAnim(m_mainBtnFavoritesOn, "MAIN/FAVORITES_ON", 0, 40, 0.f, 0.f); + _setHideAnim(m_mainBtnFavoritesOff, "MAIN/FAVORITES_OFF", 0, 40, 0.f, 0.f); + _setHideAnim(m_mainBtnInit, "MAIN/BIG_SETTINGS_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_mainBtnInit2, "MAIN/BIG_SETTINGS_BTN2", 0, 0, -2.f, 0.f); + _setHideAnim(m_mainLblInit, "MAIN/MESSAGE", 0, 0, 0.f, 0.f); + _setHideAnim(m_mainLblLetter, "MAIN/LETTER", 0, 0, 0.f, 0.f); + _setHideAnim(m_mainLblNotice, "MAIN/NOTICE", 0, 0, 0.f, 0.f); +#ifdef SHOWMEM + _setHideAnim(m_mem2FreeSize, "MEM2", 0, 0, 0.f, 0.f); +#endif + _hideMain(true); + _textMain(); +} + +void CMenu::_textMain(void) +{ + m_btnMgr.setText(m_mainBtnInit, _t("main1", L"Install Game")); + m_btnMgr.setText(m_mainBtnInit2, _t("main3", L"Select Partition")); + m_btnMgr.setText(m_mainLblInit, _t("main2", L"Welcome to WiiFlow. I have not found any games. Click Install to install games, or Select partition to select your partition type."), true); +} + +wstringEx CMenu::_getNoticeTranslation(int sorting, wstringEx curLetter) +{ + if(sorting == SORT_PLAYERS) + curLetter += m_loc.getWString(m_curLanguage, "players", L" Players"); + else if(sorting == SORT_WIFIPLAYERS) + curLetter += m_loc.getWString(m_curLanguage, "wifiplayers", L" Wifi Players"); + else if(sorting == SORT_GAMEID) + { + switch(curLetter[0]) + { + case L'C': + { + if(m_current_view != COVERFLOW_CHANNEL) + curLetter = m_loc.getWString(m_curLanguage, "custom", L"Custom"); + else + curLetter = m_loc.getWString(m_curLanguage, "commodore", L"Commodore 64"); + break; + } + case L'E': + { + curLetter = m_loc.getWString(m_curLanguage, "neogeo", L"Neo-Geo"); + break; + } + case L'F': + { + curLetter = m_loc.getWString(m_curLanguage, "nes", L"Nintendo"); + break; + } + case L'J': + { + curLetter = m_loc.getWString(m_curLanguage, "snes", L"Super Nintendo"); + break; + } + case L'L': + { + curLetter = m_loc.getWString(m_curLanguage, "mastersystem", L"Sega Master System"); + break; + } + case L'M': + { + curLetter = m_loc.getWString(m_curLanguage, "genesis", L"Sega Genesis"); + break; + } + case L'N': + { + curLetter = m_loc.getWString(m_curLanguage, "nintendo64", L"Nintendo64"); + break; + } + case L'P': + { + curLetter = m_loc.getWString(m_curLanguage, "turbografx16", L"TurboGrafx-16"); + break; + } + case L'Q': + { + curLetter = m_loc.getWString(m_curLanguage, "turbografxcd", L"TurboGrafx-CD"); + break; + } + case L'W': + { + curLetter = m_loc.getWString(m_curLanguage, "wiiware", L"WiiWare"); + break; + } + case L'H': + { + curLetter = m_loc.getWString(m_curLanguage, "wiichannels", L"Offical Wii Channels"); + break; + } + case L'R': + case L'S': + { + curLetter = m_loc.getWString(m_curLanguage, "wii", L"Wii"); + break; + } + case L'D': + { + curLetter = m_loc.getWString(m_curLanguage, "homebrew", L"Homebrew"); + break; + } + default: + { + curLetter = m_loc.getWString(m_curLanguage, "unknown", L"Unknown"); + break; + } + } + } + + return curLetter; +} diff --git a/source/menu/menu_search.cpp b/source/menu/menu_search.cpp new file mode 100644 index 00000000..b6f82308 --- /dev/null +++ b/source/menu/menu_search.cpp @@ -0,0 +1,46 @@ +#include "menu.hpp" +#include "gecko.h" +#include + +// Returns a list of games which starts with the specified (partial) gameId +// We can enhance the code in this file later on to support more search features +// Using a search class as argument or something like that +safe_vector CMenu::_searchGamesByID(const char *gameId) +{ + safe_vector retval; + for (safe_vector::iterator itr = m_gameList.begin(); itr != m_gameList.end(); itr++) + if (strncmp((const char *) (*itr).hdr.id, gameId, strlen(gameId)) == 0) + retval.push_back(*itr); + + return retval; +} +/* +safe_vector CMenu::_searchGamesByTitle(wchar_t letter) +{ + safe_vector retval; + for (safe_vector::iterator itr = m_gameList.begin(); itr != m_gameList.end(); itr++) + if ((*itr).title[0] == letter) + retval.push_back(*itr); + + return retval; +} + +safe_vector CMenu::_searchGamesByType(const char type) +{ + safe_vector retval; + for (safe_vector::iterator itr = m_gameList.begin(); itr != m_gameList.end(); itr++) + if ((*itr).id[0] == type) + retval.push_back(*itr); + + return retval; +} + +safe_vector CMenu::_searchGamesByRegion(const char region) +{ + safe_vector retval; + for (safe_vector::iterator itr = m_gameList.begin(); itr != m_gameList.end(); itr++) + if ((*itr).id[3] == region) + retval.push_back(*itr); + + return retval; +} */ \ No newline at end of file diff --git a/source/menu/menu_system.cpp b/source/menu/menu_system.cpp new file mode 100644 index 00000000..17b414a5 --- /dev/null +++ b/source/menu/menu_system.cpp @@ -0,0 +1,271 @@ +#include "svnrev.h" +#include "menu.hpp" + +#include "loader/sys.h" +#include "loader/wbfs.h" +#include "gecko.h" +#include "lockMutex.hpp" +#include "defines.h" + +#define newIOS 249 + +extern int mainIOS; + +int version_num = 0, num_versions = 0, i; +int CMenu::_version[9] = {0, atoi(SVN_REV), atoi(SVN_REV), atoi(SVN_REV), atoi(SVN_REV), atoi(SVN_REV), atoi(SVN_REV), atoi(SVN_REV), atoi(SVN_REV)}; + +void CMenu::_system() +{ + int msg = 0, newVer = atoi(SVN_REV); + lwp_t thread = LWP_THREAD_NULL; + wstringEx prevMsg; + + SetupInput(); + m_btnMgr.setText(m_systemBtnBack, _t("dl1", L"Cancel")); + m_thrdStop = false; + m_thrdMessageAdded = false; + m_showtimer = -1; + while (true) + { + _mainLoopCommon(false, m_thrdWorking); + if (m_showtimer == -1) + { + m_showtimer = 120; + m_btnMgr.show(m_downloadPBar); + m_btnMgr.setProgress(m_downloadPBar, 0.f); + m_thrdStop = false; + m_thrdWorking = true; + LWP_CreateThread(&thread, (void *(*)(void *))CMenu::_versionTxtDownloaderInit, (void *)this, 0, 8192, 40); + } + if (m_showtimer > 0 && !m_thrdWorking) + { + if (thread != LWP_THREAD_NULL) + { + LWP_JoinThread(thread, NULL); + thread = LWP_THREAD_NULL; + } + if (--m_showtimer == 0) + { + m_btnMgr.hide(m_downloadPBar); + m_btnMgr.hide(m_downloadLblMessage[0], 0, 0, -2.f, 0.f); + m_btnMgr.hide(m_downloadLblMessage[1], 0, 0, -2.f, 0.f); + CMenu::_version[1] = m_version.getInt("GENERAL", "version", atoi(SVN_REV)); + num_versions = m_version.getInt("GENERAL", "num_versions", 1); + for (i = 2; i < num_versions; i++) + { + CMenu::_version[i] = m_version.getInt(fmt("VERSION%i", i-1u), "version", atoi(SVN_REV)); + //add the changelog info here + } + if (num_versions > 1 && version_num == 0) version_num = 1; + i = min((u32)version_num, ARRAY_SIZE(CMenu::_version) -1u); + newVer = CMenu::_version[i]; + _showSystem(); + } + } + if ((BTN_HOME_PRESSED || BTN_B_PRESSED || m_exit) && !m_thrdWorking) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if ((BTN_A_PRESSED) && !(m_thrdWorking && m_thrdStop)) + { + if ((m_btnMgr.selected(m_systemBtnDownload)) && !m_thrdWorking) + { + // Download selected version + _hideSystem(); + m_btnMgr.show(m_downloadPBar); + m_btnMgr.setProgress(m_downloadPBar, 0.f); + m_thrdStop = false; + m_thrdWorking = true; + gprintf("\nVersion to DL: %i\n", newIOS); + + m_app_update_size = m_version.getInt("GENERAL", "app_zip_size", 0); + m_data_update_size = m_version.getInt("GENERAL", "data_zip_size", 0); + + m_app_update_url = fmt("%s/r%i/%i.zip", m_version.getString("GENERAL", "update_url", "http://update.wiiflow.org").c_str(), newVer, newIOS); + m_data_update_url = fmt("%s/r%i/data.zip", m_version.getString("GENERAL", "update_url", "http://update.wiiflow.org").c_str(), newVer); + + m_showtimer = 120; + LWP_CreateThread(&thread, (void *(*)(void *))CMenu::_versionDownloaderInit, (void *)this, 0, 8192, 40); + if (m_exit && !m_thrdWorking) + { + m_thrdStop = true; + break; + } + } + else if (m_btnMgr.selected(m_systemBtnBack)) + { + LockMutex lock(m_mutex); + m_thrdStop = true; + m_thrdMessageAdded = true; + m_thrdMessage = _t("dlmsg6", L"Canceling..."); + } + else if (m_btnMgr.selected(m_systemBtnVerSelectM)) + { + if (version_num > 1) + --version_num; + else + version_num = num_versions; + i = min((u32)version_num, ARRAY_SIZE(CMenu::_version) -1u); + { + m_btnMgr.setText(m_systemLblVerSelectVal, wstringEx(sfmt("%i", CMenu::_version[i]))); + newVer = CMenu::_version[i]; + if (i > 1 && i != num_versions) + m_btnMgr.setText(m_systemLblInfo, m_version.getWString(sfmt("VERSION%i", i - 1u), "changes")); + else + if (i == num_versions) + m_btnMgr.setText(m_systemLblInfo, _t("sys7", L"Installed Version.")); + else + m_btnMgr.setText(m_systemLblInfo, m_version.getWString("GENERAL", "changes")); + } + } + else if (m_btnMgr.selected(m_systemBtnVerSelectP)) + { + if (version_num < num_versions) + ++version_num; + else + version_num = 1; + i = min((u32)version_num, ARRAY_SIZE(CMenu::_version) -1u); + { + m_btnMgr.setText(m_systemLblVerSelectVal, wstringEx(sfmt("%i", CMenu::_version[i]))); + newVer = CMenu::_version[i]; + if (i > 1 && i != num_versions) + m_btnMgr.setText(m_systemLblInfo, m_version.getWString(sfmt("VERSION%i", i - 1u), "changes")); + else + if (i == num_versions) + m_btnMgr.setText(m_systemLblInfo, _t("sys7", L"Installed Version.")); + else + m_btnMgr.setText(m_systemLblInfo, m_version.getWString("GENERAL", "changes")); + } + } + } + if (Sys_Exiting()) + { + LockMutex lock(m_mutex); + m_thrdStop = true; + m_thrdMessageAdded = true; + m_thrdMessage = _t("dlmsg6", L"Canceling..."); + } + // + if (m_thrdMessageAdded) + { + LockMutex lock(m_mutex); + m_thrdMessageAdded = false; + m_btnMgr.setProgress(m_downloadPBar, m_thrdProgress); + if (m_thrdProgress == 1.f) + m_btnMgr.setText(m_systemBtnBack, _t("dl2", L"Back")); + if (prevMsg != m_thrdMessage) + { + prevMsg = m_thrdMessage; + m_btnMgr.setText(m_downloadLblMessage[msg], m_thrdMessage, false); + m_btnMgr.hide(m_downloadLblMessage[msg], -200, 0, 1.f, 0.5f, true); + m_btnMgr.show(m_downloadLblMessage[msg]); + msg ^= 1; + m_btnMgr.hide(m_downloadLblMessage[msg], +400, 0, 1.f, 1.f); + } + } + if (m_thrdStop && !m_thrdWorking) + break; + } + if (thread != LWP_THREAD_NULL) + { + LWP_JoinThread(thread, NULL); + thread = LWP_THREAD_NULL; + } + _hideSystem(); +} + +void CMenu::_hideSystem(bool instant) +{ + m_btnMgr.hide(m_systemLblTitle, instant); + m_btnMgr.hide(m_systemLblVersionTxt, instant); + m_btnMgr.hide(m_systemLblVersion, instant); + m_btnMgr.hide(m_systemBtnBack, instant); + m_btnMgr.hide(m_systemBtnDownload, instant); + m_btnMgr.hide(m_downloadPBar, instant); + m_btnMgr.hide(m_downloadLblMessage[0], 0, 0, -2.f, 0.f, instant); + m_btnMgr.hide(m_downloadLblMessage[1], 0, 0, -2.f, 0.f, instant); + m_btnMgr.hide(m_systemLblInfo); + m_btnMgr.hide(m_systemLblVerSelectVal); + m_btnMgr.hide(m_systemBtnVerSelectM); + m_btnMgr.hide(m_systemBtnVerSelectP); + for (u32 i = 0; i < ARRAY_SIZE(m_systemLblUser); ++i) + if (m_systemLblUser[i] != -1u) + m_btnMgr.hide(m_systemLblUser[i], instant); +} + +void CMenu::_showSystem(void) +{ + _setBg(m_systemBg, m_systemBg); + m_btnMgr.show(m_systemLblTitle); + m_btnMgr.show(m_systemLblVersionTxt); + m_btnMgr.show(m_systemLblVersion); + m_btnMgr.show(m_systemBtnBack); + m_btnMgr.show(m_systemLblInfo); + m_btnMgr.show(m_systemLblVerSelectVal); + m_btnMgr.show(m_systemBtnVerSelectM); + m_btnMgr.show(m_systemBtnVerSelectP); + m_btnMgr.show(m_systemBtnDownload); + for (u32 i = 0; i < ARRAY_SIZE(m_systemLblUser); ++i) + if (m_systemLblUser[i] != -1u) + m_btnMgr.show(m_systemLblUser[i]); + _textSystem(); +} + +void CMenu::_initSystemMenu(CMenu::SThemeData &theme) +{ + STexture emptyTex; + + _addUserLabels(theme, m_systemLblUser, ARRAY_SIZE(m_systemLblUser), "SYSTEM"); + m_systemBg = _texture(theme.texSet, "SYSTEM/BG", "texture", theme.bg); + m_systemLblTitle = _addLabel(theme, "SYSTEM/TITLE", theme.titleFont, L"", 20, 30, 600, 60, theme.titleFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE); + m_systemLblVersionTxt = _addLabel(theme, "SYSTEM/VERSION_TXT", theme.lblFont, L"", 40, 80, 220, 56, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_systemLblVersion = _addLabel(theme, "SYSTEM/VERSION", theme.lblFont, L"", 260, 80, 200, 56, theme.titleFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_systemBtnDownload = _addButton(theme, "SYSTEM/DOWNLOAD_BTN", theme.btnFont, L"", 20, 410, 200, 56, theme.btnFontColor); + m_systemBtnBack = _addButton(theme, "SYSTEM/BACK_BTN", theme.btnFont, L"", 420, 410, 200, 56, theme.btnFontColor); + + m_systemLblInfo = _addLabel(theme, "SYSTEM/INFO", theme.lblFont, L"", 40, 210, 560, 180, theme.txtFontColor, FTGX_JUSTIFY_LEFT | FTGX_ALIGN_TOP); + m_systemLblVerSelectVal = _addLabel(theme, "SYSTEM/VER_SELECT_BTN", theme.btnFont, L"", 494, 80, 50, 56, theme.btnFontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE, theme.btnTexC); + m_systemBtnVerSelectM = _addPicButton(theme, "SYSTEM/VER_SELECT_MINUS", theme.btnTexMinus, theme.btnTexMinusS, 438, 80, 56, 56); + m_systemBtnVerSelectP = _addPicButton(theme, "SYSTEM/VER_SELECT_PLUS", theme.btnTexPlus, theme.btnTexPlusS, 544, 80, 56, 56); + // + _setHideAnim(m_systemLblTitle, "SYSTEM/TITLE", 0, 100, 0.f, 0.f); + _setHideAnim(m_systemBtnDownload, "SYSTEM/DOWNLOAD_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_systemBtnBack, "SYSTEM/BACK_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_systemLblVersionTxt, "SYSTEM/VERSION_TXT", -100, 0, 0.f, 0.f); + _setHideAnim(m_systemLblVersion, "SYSTEM/VERSION", 200, 0, 0.f, 0.f); + + _setHideAnim(m_systemLblInfo, "SYSTEM/INFO", 0, -180, 1.f, -1.f); + _setHideAnim(m_systemLblVerSelectVal, "SYSTEM/VER_SELECT_BTN", 0, 0, 1.f, -1.f); + _setHideAnim(m_systemBtnVerSelectM, "SYSTEM/VER_SELECT_MINUS", 0, 0, 1.f, -1.f); + _setHideAnim(m_systemBtnVerSelectP, "SYSTEM/VER_SELECT_PLUS", 0, 0, 1.f, -1.f); + // + _hideSystem(true); + _textSystem(); +} + +void CMenu::_textSystem(void) +{ + m_btnMgr.setText(m_systemLblTitle, _t("sys1", L"System")); + m_btnMgr.setText(m_systemLblVersionTxt, _t("sys2", L"WiiFlow Version:")); + m_btnMgr.setText(m_systemLblVersion, wfmt(L"v%s r%s", APP_VERSION, SVN_REV).c_str()); + m_btnMgr.setText(m_systemBtnBack, _t("sys3", L"Cancel")); + m_btnMgr.setText(m_systemBtnDownload, _t("sys4", L"Upgrade")); + i = min((u32)version_num, ARRAY_SIZE(CMenu::_version) -1u); + if (i == 0) + { + m_btnMgr.setText(m_systemLblVerSelectVal, wfmt(L"%i", atoi(SVN_REV)).c_str()); + } + else + { + m_btnMgr.setText(m_systemLblVerSelectVal, wstringEx(sfmt("%i", CMenu::_version[i]))); + if (i > 1 && i != num_versions) + m_btnMgr.setText(m_systemLblInfo, m_version.getWString(sfmt("VERSION%i", i - 1u), "changes")); + else + if (i == num_versions) + m_btnMgr.setText(m_systemLblInfo, _t("sys7", L"Installed Version.")); + else + m_btnMgr.setText(m_systemLblInfo, m_version.getWString("GENERAL", "changes")); + } +} \ No newline at end of file diff --git a/source/menu/menu_wbfs.cpp b/source/menu/menu_wbfs.cpp new file mode 100644 index 00000000..1785d926 --- /dev/null +++ b/source/menu/menu_wbfs.cpp @@ -0,0 +1,263 @@ + +#include "menu.hpp" +#include "loader/wbfs.h" +#include "lockMutex.hpp" + +using namespace std; + +void CMenu::_hideWBFS(bool instant) +{ + m_btnMgr.hide(m_wbfsLblTitle, instant); + m_btnMgr.hide(m_wbfsPBar, instant); + m_btnMgr.hide(m_wbfsBtnBack, instant); + m_btnMgr.hide(m_wbfsBtnGo, instant); + m_btnMgr.hide(m_wbfsLblDialog); + m_btnMgr.hide(m_wbfsLblMessage); + for (u32 i = 0; i < ARRAY_SIZE(m_wbfsLblUser); ++i) + if (m_wbfsLblUser[i] != -1u) + m_btnMgr.hide(m_wbfsLblUser[i], instant); +} + +void CMenu::_showWBFS(CMenu::WBFS_OP op) +{ + _setBg(m_wbfsBg, m_wbfsBg); + switch (op) + { + case CMenu::WO_ADD_GAME: + m_btnMgr.setText(m_wbfsLblTitle, _t("wbfsop1", L"Install Game")); + break; + case CMenu::WO_REMOVE_GAME: + m_btnMgr.setText(m_wbfsLblTitle, _t("wbfsop2", L"Delete Game")); + break; + case CMenu::WO_FORMAT: +// m_btnMgr.setText(m_wbfsLblTitle, _t("wbfsop3", L"Format")); + break; + }; + m_btnMgr.show(m_wbfsLblTitle); + m_btnMgr.show(m_wbfsBtnBack); + m_btnMgr.show(m_wbfsBtnGo); + m_btnMgr.show(m_wbfsLblDialog); + for (u32 i = 0; i < ARRAY_SIZE(m_wbfsLblUser); ++i) + if (m_wbfsLblUser[i] != -1u) + m_btnMgr.show(m_wbfsLblUser[i]); +} + +static void slotLight(bool state) +{ + if (state) + *(u32 *)0xCD0000C0 |= 0x20; + else + *(u32 *)0xCD0000C0 &= ~0x20; +} + +void CMenu::_addDiscProgress(int status, int total, void *user_data) +{ + CMenu &m = *(CMenu *)user_data; + float progress = total == 0 ? 0.f : (float)status / (float)total; + // Don't synchronize too often + if (progress - m.m_thrdProgress >= 0.01f) + { + LWP_MutexLock(m.m_mutex); + m._setThrdMsg(L"", progress); + LWP_MutexUnlock(m.m_mutex); + } +} + +int CMenu::_gameInstaller(void *obj) +{ + CMenu &m = *(CMenu *)obj; + int ret; + + if (!WBFS_Mounted()) + { + m.m_thrdWorking = false; + return -1; + } + + u64 comp_size = 0, real_size = 0; + f32 free, used; + WBFS_DiskSpace(&used, &free); + WBFS_DVD_Size(&comp_size, &real_size); + + if ((f32)comp_size + (f32)128*1024 >= free * GB_SIZE) + { + LWP_MutexLock(m.m_mutex); + m._setThrdMsg(wfmt(m._fmt("wbfsop10", L"Not enough space : %lld blocks needed, %i available"), comp_size, free), 0.f); + LWP_MutexUnlock(m.m_mutex); + ret = -1; + } + else + { + LWP_MutexLock(m.m_mutex); + m._setThrdMsg(L"", 0); + LWP_MutexUnlock(m.m_mutex); + + ret = WBFS_AddGame(CMenu::_addDiscProgress, obj); + LWP_MutexLock(m.m_mutex); + if (ret == 0) + m._setThrdMsg(m._t("wbfsop8", L"Game installed"), 1.f); + else + m._setThrdMsg(m._t("wbfsop9", L"An error has occurred"), 1.f); + LWP_MutexUnlock(m.m_mutex); + slotLight(true); + } + m.m_thrdWorking = false; + return ret; +} + +bool CMenu::_wbfsOp(CMenu::WBFS_OP op) +{ + lwp_t thread = 0; + static discHdr header ATTRIBUTE_ALIGN(32); + bool done = false; + bool out = false; + struct AutoLight { AutoLight(void) { } ~AutoLight(void) { slotLight(false); } } aw; + string cfPos = m_cf.getNextId(); + + SetupInput(); + + _showWBFS(op); + switch (op) + { + case CMenu::WO_ADD_GAME: + m_btnMgr.setText(m_wbfsLblDialog, _t("wbfsadddlg", L"Please insert the disc you want to copy, then click on Go.")); + break; + case CMenu::WO_REMOVE_GAME: + m_btnMgr.setText(m_wbfsLblDialog, wfmt(_fmt("wbfsremdlg", L"To permanently remove the game : %s, click on Go."), m_cf.getTitle().c_str())); + break; + case CMenu::WO_FORMAT: + break; + } + m_thrdStop = false; + m_thrdMessageAdded = false; + while (true) + { + _mainLoopCommon(false, m_thrdWorking); + if ((BTN_HOME_PRESSED || BTN_B_PRESSED) && !m_thrdWorking) + break; + else if (BTN_UP_PRESSED) + m_btnMgr.up(); + else if (BTN_DOWN_PRESSED) + m_btnMgr.down(); + if (BTN_A_PRESSED && !m_thrdWorking) + { + if (m_btnMgr.selected(m_wbfsBtnBack)) + break; + else if (m_btnMgr.selected(m_wbfsBtnGo)) + { + switch (op) + { + case CMenu::WO_ADD_GAME: + m_btnMgr.show(m_wbfsPBar); + m_btnMgr.setProgress(m_wbfsPBar, 0.f); + m_btnMgr.hide(m_wbfsBtnGo); + m_btnMgr.hide(m_wbfsBtnBack); + m_btnMgr.show(m_wbfsLblMessage); + m_btnMgr.setText(m_wbfsLblMessage, L""); + Disc_SetUSB(NULL); + if (Disc_Wait() < 0) + { + error(_t("wbfsoperr1", L"Disc_Wait failed")); + out = true; + break; + } + if (Disc_Open() < 0) + { + error(_t("wbfsoperr2", L"Disc_Open failed")); + out = true; + break; + } + if (Disc_IsWii() < 0) + { + error(_t("wbfsoperr3", L"This is not a Wii disc!")); + out = true; + break; + } + Disc_ReadHeader(&header); + + if (_searchGamesByID((const char *) header.id).size() != 0) + { + error(_t("wbfsoperr4", L"Game already installed")); + out = true; + break; + } + cfPos = string((char *) header.id); + m_btnMgr.setText(m_wbfsLblDialog, wfmt(_fmt("wbfsop6", L"Installing [%s] %s..."), string((const char *)header.id, sizeof header.id).c_str(), string((const char *)header.title, sizeof header.title).c_str())); + done = true; + m_thrdWorking = true; + m_thrdProgress = 0.f; + m_thrdMessageAdded = false; + LWP_CreateThread(&thread, (void *(*)(void *))CMenu::_gameInstaller, (void *)this, 0, 8 * 1024, 64); + break; + case CMenu::WO_REMOVE_GAME: + WBFS_RemoveGame((u8 *)m_cf.getId().c_str(), (char *) m_cf.getHdr()->path); + m_btnMgr.show(m_wbfsPBar); + m_btnMgr.setProgress(m_wbfsPBar, 0.f, true); + m_btnMgr.setProgress(m_wbfsPBar, 1.f); + m_btnMgr.hide(m_wbfsLblDialog); + m_btnMgr.hide(m_wbfsBtnGo); + m_btnMgr.show(m_wbfsLblMessage); + m_btnMgr.setText(m_wbfsLblMessage, _t("wbfsop7", L"Game deleted")); + done = true; + break; + case CMenu::WO_FORMAT: + break; + } + if (out) + break; + } + } + // + if (m_thrdMessageAdded) + { + LockMutex lock(m_mutex); + m_thrdMessageAdded = false; + if (!m_thrdMessage.empty()) + m_btnMgr.setText(m_wbfsLblDialog, m_thrdMessage); + m_btnMgr.setProgress(m_wbfsPBar, m_thrdProgress); + m_btnMgr.setText(m_wbfsLblMessage, wfmt(_fmt("wbfsprogress", L"%i%%"), (int)(m_thrdProgress * 100.f))); + if (!m_thrdWorking) + m_btnMgr.show(m_wbfsBtnBack); + } + } + _hideWBFS(); + if (done && (op == CMenu::WO_REMOVE_GAME || op == CMenu::WO_ADD_GAME)) + { + m_gameList.SetLanguage(m_loc.getString(m_curLanguage, "gametdb_code", "EN").c_str()); + UpdateCache(COVERFLOW_USB); + + _loadList(); + _initCF(); + m_cf.findId(cfPos.c_str(), true); + } + return done; +} + +void CMenu::_initWBFSMenu(CMenu::SThemeData &theme) +{ + CColor fontColor(0xD0BFDFFF); + + _addUserLabels(theme, m_wbfsLblUser, ARRAY_SIZE(m_wbfsLblUser), "WBFS"); + m_wbfsBg = _texture(theme.texSet, "WBFS/BG", "texture", theme.bg); + m_wbfsLblTitle = _addLabel(theme, "WBFS/TITLE", theme.titleFont, L"", 20, 30, 600, 60, fontColor, FTGX_JUSTIFY_CENTER | FTGX_ALIGN_MIDDLE); + m_wbfsLblDialog = _addLabel(theme, "WBFS/DIALOG", theme.lblFont, L"", 40, 90, 560, 200, CColor(0xFFDFDFDF), FTGX_JUSTIFY_LEFT | FTGX_ALIGN_MIDDLE); + m_wbfsLblMessage = _addLabel(theme, "WBFS/MESSAGE", theme.lblFont, L"", 40, 300, 560, 100, CColor(0xFFDFDFDF), FTGX_JUSTIFY_CENTER | FTGX_ALIGN_TOP); + m_wbfsPBar = _addProgressBar(theme, "WBFS/PROGRESS_BAR", 40, 270, 560, 20); + m_wbfsBtnBack = _addButton(theme, "WBFS/BACK_BTN", theme.btnFont, L"", 420, 410, 200, 56, fontColor); + m_wbfsBtnGo = _addButton(theme, "WBFS/GO_BTN", theme.btnFont, L"", 245, 260, 150, 56, fontColor); + // + _setHideAnim(m_wbfsLblTitle, "WBFS/TITLE", 0, 0, -2.f, 0.f); + _setHideAnim(m_wbfsLblDialog, "WBFS/DIALOG", 0, 0, -2.f, 0.f); + _setHideAnim(m_wbfsLblMessage, "WBFS/MESSAGE", 0, 0, -2.f, 0.f); + _setHideAnim(m_wbfsPBar, "WBFS/PROGRESS_BAR", 0, 0, -2.f, 0.f); + _setHideAnim(m_wbfsBtnBack, "WBFS/BACK_BTN", 0, 0, -2.f, 0.f); + _setHideAnim(m_wbfsBtnGo, "WBFS/GO_BTN", 0, 0, -2.f, 0.f); + _hideWBFS(true); + _textWBFS(); +} + +void CMenu::_textWBFS(void) +{ + m_btnMgr.setText(m_wbfsBtnBack, _t("wbfsop4", L"Back")); + m_btnMgr.setText(m_wbfsBtnGo, _t("wbfsop5", L"Go")); +} diff --git a/source/music/AifDecoder.cpp b/source/music/AifDecoder.cpp new file mode 100644 index 00000000..0d7926be --- /dev/null +++ b/source/music/AifDecoder.cpp @@ -0,0 +1,214 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include +#include "AifDecoder.hpp" + +typedef struct +{ + u32 fccCOMM; + u32 size; + u16 channels; + u8 frames[4]; + u16 bps; + u8 freq[10]; +} SAIFFCommChunk; + +typedef struct +{ + u32 fccSSND; + u32 size; + u32 offset; + u32 blockSize; +} SAIFFSSndChunk; + +// ------ +// Copyright (C) 1988-1991 Apple Computer, Inc. +#ifndef HUGE_VAL +# define HUGE_VAL HUGE +#endif + +# define UnsignedToFloat(u) (((double)((long)(u - 2147483647L - 1))) + 2147483648.0) + +static double ConvertFromIeeeExtended(const unsigned char* bytes) +{ + double f; + int expon; + unsigned long hiMant, loMant; + + expon = ((bytes[0] & 0x7F) << 8) | (bytes[1] & 0xFF); + hiMant = ((unsigned long)(bytes[2] & 0xFF) << 24) + | ((unsigned long)(bytes[3] & 0xFF) << 16) + | ((unsigned long)(bytes[4] & 0xFF) << 8) + | ((unsigned long)(bytes[5] & 0xFF)); + loMant = ((unsigned long)(bytes[6] & 0xFF) << 24) + | ((unsigned long)(bytes[7] & 0xFF) << 16) + | ((unsigned long)(bytes[8] & 0xFF) << 8) + | ((unsigned long)(bytes[9] & 0xFF)); + + if (expon == 0 && hiMant == 0 && loMant == 0) { + f = 0; + } + else { + if (expon == 0x7FFF) { + f = HUGE_VAL; + } + else { + expon -= 16383; + f = ldexp(UnsignedToFloat(hiMant), expon-=31); + f += ldexp(UnsignedToFloat(loMant), expon-=32); + } + } + + if (bytes[0] & 0x80) + return -f; + else + return f; +} + +AifDecoder::AifDecoder(const char * filepath) + : SoundDecoder(filepath) +{ + SoundType = SOUND_AIF; + + if(!file_fd) + return; + + OpenFile(); +} + +AifDecoder::AifDecoder(const u8 * snd, int len) + : SoundDecoder(snd, len) +{ + SoundType = SOUND_AIF; + + if(!file_fd) + return; + + OpenFile(); +} + +AifDecoder::~AifDecoder() +{ +} + +void AifDecoder::OpenFile() +{ + SWaveHdr Header; + file_fd->read((u8 *) &Header, sizeof(SWaveHdr)); + + if (Header.magicRIFF != 'FORM') + { + CloseFile(); + return; + } + else if(Header.magicWAVE != 'AIFF') + { + CloseFile(); + return; + } + + SWaveChunk WaveChunk; + do + { + int ret = file_fd->read((u8 *) &WaveChunk, sizeof(SWaveChunk)); + if(ret <= 0) + { + CloseFile(); + return; + } + } + while(WaveChunk.magicDATA != 'COMM'); + + DataOffset = file_fd->tell()+WaveChunk.size; + + SAIFFCommChunk CommHdr; + file_fd->seek(file_fd->tell()-sizeof(SWaveChunk), SEEK_SET); + file_fd->read((u8 *) &CommHdr, sizeof(SAIFFCommChunk)); + + if(CommHdr.fccCOMM != 'COMM') + { + CloseFile(); + return; + } + + file_fd->seek(DataOffset, SEEK_SET); + + SAIFFSSndChunk SSndChunk; + file_fd->read((u8 *) &SSndChunk, sizeof(SAIFFSSndChunk)); + + if(SSndChunk.fccSSND != 'SSND') + { + CloseFile(); + return; + } + + DataOffset += sizeof(SAIFFSSndChunk); + DataSize = SSndChunk.size-8; + SampleRate = (u32) ConvertFromIeeeExtended(CommHdr.freq); + Format = VOICE_STEREO_16BIT; + + if(CommHdr.channels == 1 && CommHdr.bps == 8) + Format = VOICE_MONO_8BIT; + else if (CommHdr.channels == 1 && CommHdr.bps == 16) + Format = VOICE_MONO_16BIT; + else if (CommHdr.channels == 2 && CommHdr.bps == 8) + Format = VOICE_STEREO_8BIT; + else if (CommHdr.channels == 2 && CommHdr.bps == 16) + Format = VOICE_STEREO_16BIT; + + Decode(); +} + +void AifDecoder::CloseFile() +{ + if(file_fd) + delete file_fd; + + file_fd = NULL; +} + +int AifDecoder::Read(u8 * buffer, int buffer_size, int) +{ + if(!file_fd) + return -1; + + if(CurPos >= (int) DataSize) + return 0; + + file_fd->seek(DataOffset+CurPos, SEEK_SET); + + if(buffer_size > (int) DataSize-CurPos) + buffer_size = DataSize-CurPos; + + int read = file_fd->read(buffer, buffer_size); + if(read > 0) + { + CurPos += read; + } + + return read; +} diff --git a/source/music/AifDecoder.hpp b/source/music/AifDecoder.hpp new file mode 100644 index 00000000..f9c6fd91 --- /dev/null +++ b/source/music/AifDecoder.hpp @@ -0,0 +1,50 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#ifndef AIFDECODER_HPP_ +#define AIFDECODER_HPP_ + +#include "SoundDecoder.hpp" +#include "WavDecoder.hpp" + +class AifDecoder : public SoundDecoder +{ + public: + AifDecoder(const char * filepath); + AifDecoder(const u8 * snd, int len); + ~AifDecoder(); + int GetFormat() { return Format; }; + int GetSampleRate() { return SampleRate; }; + int Read(u8 * buffer, int buffer_size, int pos); + protected: + void OpenFile(); + void CloseFile(); + u32 DataOffset; + u32 DataSize; + u32 SampleRate; + u8 Format; +}; + +#endif diff --git a/source/music/BNSDecoder.cpp b/source/music/BNSDecoder.cpp new file mode 100644 index 00000000..a6030c24 --- /dev/null +++ b/source/music/BNSDecoder.cpp @@ -0,0 +1,360 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include +#include +#include +#include "BNSDecoder.hpp" + +BNSDecoder::BNSDecoder(const char * filepath) + : SoundDecoder(filepath) +{ + SoundType = SOUND_BNS; + memset(&SoundData, 0, sizeof(SoundBlock)); + + if(!file_fd) + return; + + OpenFile(); +} + +BNSDecoder::BNSDecoder(const u8 * snd, int len) + : SoundDecoder(snd, len) +{ + SoundType = SOUND_BNS; + memset(&SoundData, 0, sizeof(SoundBlock)); + + if(!file_fd) + return; + + OpenFile(); +} + +BNSDecoder::~BNSDecoder() +{ + ExitRequested = true; + while(Decoding) + usleep(100); + + SAFE_FREE(SoundData.buffer); +} + +void BNSDecoder::OpenFile() +{ + u8 * tempbuff = new (std::nothrow) u8[file_fd->size()]; + if(!tempbuff) + { + CloseFile(); + return; + } + + int done = 0; + + while(done < file_fd->size()) + { + int read = file_fd->read(tempbuff, file_fd->size()); + if(read > 0) + done += read; + else + { + CloseFile(); + return; + } + } + + SoundData = DecodefromBNS(tempbuff, done); + if(SoundData.buffer == NULL) + { + CloseFile(); + return; + } + + delete [] tempbuff; + tempbuff = NULL; + + Decode(); +} + +void BNSDecoder::CloseFile() +{ + if(file_fd) + delete file_fd; + + file_fd = NULL; +} + +int BNSDecoder::Read(u8 * buffer, int buffer_size, int) +{ + if(!SoundData.buffer) + return -1; + + if(SoundData.loopFlag) + { + int factor = SoundData.format == VOICE_STEREO_16BIT ? 4 : 2; + if(CurPos >= (int) SoundData.loopEnd*factor) + CurPos = SoundData.loopStart*factor; + + if(buffer_size > (int) SoundData.loopEnd*factor-CurPos) + buffer_size = SoundData.loopEnd*factor-CurPos; + } + else + { + if(CurPos >= (int) SoundData.size) + return 0; + + if(buffer_size > (int) SoundData.size-CurPos) + buffer_size = SoundData.size-CurPos; + } + + memcpy(buffer, SoundData.buffer+CurPos, buffer_size); + CurPos += buffer_size; + + return buffer_size; +} + +struct BNSHeader +{ + u32 fccBNS; + u32 magic; + u32 size; + u16 unk1; + u16 unk2; + u32 infoOffset; + u32 infoSize; + u32 dataOffset; + u32 dataSize; +} __attribute__((packed)); + +struct BNSInfo +{ + u32 fccINFO; + u32 size; + u8 codecNum; + u8 loopFlag; + u8 chanCount; + u8 zero; + u16 freq; + u8 pad1[2]; + u32 loopStart; + u32 loopEnd; + u32 offsetToChanStarts; + u8 pad2[4]; + u32 chan1StartOffset; + u32 chan2StartOffset; + u32 chan1Start; + u32 coeff1Offset; + u8 pad3[4]; + u32 chan2Start; + u32 coeff2Offset; + u8 pad4[4]; + s16 coefficients1[8][2]; + u16 chan1Gain; + u16 chan1PredictiveScale; + s16 chan1PrevSamples[2]; + u16 chan1LoopPredictiveScale; + s16 chan1LoopPrevSamples[2]; + u16 chan1LoopPadding; + s16 coefficients2[8][2]; + u16 chan2Gain; + u16 chan2PredictiveScale; + s16 chan2PrevSamples[2]; + u16 chan2LoopPredictiveScale; + s16 chan2LoopPrevSamples[2]; + u16 chan2LoopPadding; +} __attribute__((packed)); + +struct BNSData +{ + u32 fccDATA; + u32 size; + u8 data; +} __attribute__((packed)); + +struct ADPCMByte +{ + s8 sample1 : 4; + s8 sample2 : 4; +} __attribute__((packed)); + +struct BNSADPCMBlock +{ + u8 pad : 1; + u8 coeffIndex : 3; + u8 lshift : 4; + ADPCMByte samples[7]; +} __attribute__((packed)); + +struct BNSDecObj +{ + s16 prevSamples[2]; + s16 coeff[8][2]; +}; + +static void loadBNSInfo(BNSInfo &bnsInfo, const u8 *buffer) +{ + const u8 *ptr = buffer + 8; + bnsInfo = *(const BNSInfo *)buffer; + if (bnsInfo.offsetToChanStarts == 0x18 && bnsInfo.chan1StartOffset == 0x20 && bnsInfo.chan2StartOffset == 0x2C + && bnsInfo.coeff1Offset == 0x38 && bnsInfo.coeff2Offset == 0x68) + return; + bnsInfo.chan1StartOffset = *(const u32 *)(ptr + bnsInfo.offsetToChanStarts); + bnsInfo.chan1Start = *(const u32 *)(ptr + bnsInfo.chan1StartOffset); + bnsInfo.coeff1Offset = *(const u32 *)(ptr + bnsInfo.chan1StartOffset + 4); + if ((u8 *)bnsInfo.coefficients1 != ptr + bnsInfo.coeff1Offset) + memcpy(bnsInfo.coefficients1, ptr + bnsInfo.coeff1Offset, (u8 *)bnsInfo.coefficients2 - (u8 *)&bnsInfo.coefficients1); + if (bnsInfo.chanCount == 2) + { + bnsInfo.chan2StartOffset = *(const u32 *)(ptr + bnsInfo.offsetToChanStarts + 4); + bnsInfo.chan2Start = *(const u32 *)(ptr + bnsInfo.chan2StartOffset); + bnsInfo.coeff2Offset = *(const u32 *)(ptr + bnsInfo.chan2StartOffset + 4); + if ((u8 *)bnsInfo.coefficients2 != ptr + bnsInfo.coeff2Offset) + memcpy(bnsInfo.coefficients2, ptr + bnsInfo.coeff2Offset, (u8 *)bnsInfo.coefficients2 - (u8 *)&bnsInfo.coefficients1); + } +} + +static void decodeADPCMBlock(s16 *buffer, const BNSADPCMBlock &block, BNSDecObj &bnsDec) +{ + int h1 = bnsDec.prevSamples[0]; + int h2 = bnsDec.prevSamples[1]; + int c1 = bnsDec.coeff[block.coeffIndex][0]; + int c2 = bnsDec.coeff[block.coeffIndex][1]; + for (int i = 0; i < 14; ++i) + { + int nibSample = ((i & 1) == 0) ? block.samples[i / 2].sample1 : block.samples[i / 2].sample2; + int sampleDeltaHP = (nibSample << block.lshift) << 11; + int predictedSampleHP = c1 * h1 + c2 * h2; + int sampleHP = predictedSampleHP + sampleDeltaHP; + buffer[i] = std::min(std::max(-32768, (sampleHP + 1024) >> 11), 32767); + h2 = h1; + h1 = buffer[i]; + } + bnsDec.prevSamples[0] = h1; + bnsDec.prevSamples[1] = h2; +} + +static u8 * decodeBNS(u32 &size, const BNSInfo &bnsInfo, const BNSData &bnsData) +{ + static s16 smplBlock[14]; + BNSDecObj decObj; + int numBlocks = (bnsData.size - 8) / 8; + int numSamples = numBlocks * 14; + const BNSADPCMBlock *inputBuf = (const BNSADPCMBlock *)&bnsData.data; + u8 * buffer = (u8 *) malloc(numSamples * sizeof (s16)); + s16 *outputBuf; + + if (!buffer) + return buffer; + memcpy(decObj.coeff, bnsInfo.coefficients1, sizeof decObj.coeff); + memcpy(decObj.prevSamples, bnsInfo.chan1PrevSamples, sizeof decObj.prevSamples); + outputBuf = (s16 *)buffer; + if (bnsInfo.chanCount == 1) + for (int i = 0; i < numBlocks; ++i) + { + decodeADPCMBlock(smplBlock, inputBuf[i], decObj); + memcpy(outputBuf, smplBlock, sizeof smplBlock); + outputBuf += 14; + } + else + { + numBlocks /= 2; + for (int i = 0; i < numBlocks; ++i) + { + decodeADPCMBlock(smplBlock, inputBuf[i], decObj); + for (int j = 0; j < 14; ++j) + outputBuf[j * 2] = smplBlock[j]; + outputBuf += 2 * 14; + } + outputBuf = (s16 *)buffer + 1; + memcpy(decObj.coeff, bnsInfo.coefficients2, sizeof decObj.coeff); + memcpy(decObj.prevSamples, bnsInfo.chan2PrevSamples, sizeof decObj.prevSamples); + for (int i = 0; i < numBlocks; ++i) + { + decodeADPCMBlock(smplBlock, inputBuf[numBlocks + i], decObj); + for (int j = 0; j < 14; ++j) + outputBuf[j * 2] = smplBlock[j]; + outputBuf += 2 * 14; + } + } + size = numSamples * sizeof (s16); + return buffer; +} + +SoundBlock DecodefromBNS(const u8 *buffer, u32 size) +{ + SoundBlock OutBlock; + memset(&OutBlock, 0, sizeof(SoundBlock)); + + const BNSHeader &hdr = *(BNSHeader *)buffer; + if (size < sizeof hdr) + return OutBlock; + if (hdr.fccBNS != 'BNS ') + return OutBlock; + // Find info and data + BNSInfo infoChunk; + loadBNSInfo(infoChunk, buffer + hdr.infoOffset); + const BNSData &dataChunk = *(const BNSData *)(buffer + hdr.dataOffset); + // Check sizes + if (size < hdr.size || size < hdr.infoOffset + hdr.infoSize || size < hdr.dataOffset + hdr.dataSize + || hdr.infoSize < 0x60 || hdr.dataSize < sizeof dataChunk + || infoChunk.size != hdr.infoSize || dataChunk.size != hdr.dataSize) + return OutBlock; + // Check format + if (infoChunk.codecNum != 0) // Only codec i've found : 0 = ADPCM. Maybe there's also 1 and 2 for PCM 8 or 16 bits ? + return OutBlock; + u8 format = (u8)-1; + if (infoChunk.chanCount == 1 && infoChunk.codecNum == 0) + format = VOICE_MONO_16BIT; + else if (infoChunk.chanCount == 2 && infoChunk.codecNum == 0) + format = VOICE_STEREO_16BIT; + if (format == (u8)-1) + return OutBlock; + u32 freq = (u32) infoChunk.freq; + u32 length = 0; + // Copy data + if (infoChunk.codecNum == 0) + { + OutBlock.buffer = decodeBNS(length, infoChunk, dataChunk); + if (!OutBlock.buffer) + return OutBlock; + } + else + { + OutBlock.buffer = (u8*) malloc(dataChunk.size); + if (!OutBlock.buffer) + return OutBlock; + memcpy(OutBlock.buffer, &dataChunk.data, dataChunk.size); + length = dataChunk.size; + } + + OutBlock.frequency = freq; + OutBlock.format = format; + OutBlock.size = length; + OutBlock.loopStart = infoChunk.loopStart; + OutBlock.loopEnd = infoChunk.loopEnd; + OutBlock.loopFlag = infoChunk.loopFlag; + + return OutBlock; +} diff --git a/source/music/BNSDecoder.hpp b/source/music/BNSDecoder.hpp new file mode 100644 index 00000000..4c9d76c3 --- /dev/null +++ b/source/music/BNSDecoder.hpp @@ -0,0 +1,59 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#ifndef BNSDECODER_HPP_ +#define BNSDECODER_HPP_ + +#include "SoundDecoder.hpp" + +typedef struct _SoundBlock +{ + u8 * buffer; + u32 size; + u8 format; + u32 frequency; + u32 loopStart; + u32 loopEnd; + u8 loopFlag; +} SoundBlock; + +class BNSDecoder : public SoundDecoder +{ + public: + BNSDecoder(const char * filepath); + BNSDecoder(const u8 * snd, int len); + ~BNSDecoder(); + int GetFormat() { return SoundData.format; }; + int GetSampleRate() { return SoundData.frequency; }; + int Read(u8 * buffer, int buffer_size, int pos); + protected: + void OpenFile(); + void CloseFile(); + SoundBlock SoundData; +}; + +SoundBlock DecodefromBNS(const u8 *buffer, u32 size); + +#endif diff --git a/source/music/BufferCircle.cpp b/source/music/BufferCircle.cpp new file mode 100644 index 00000000..caf20053 --- /dev/null +++ b/source/music/BufferCircle.cpp @@ -0,0 +1,138 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include "BufferCircle.hpp" +#include "utils.h" + +BufferCircle::BufferCircle() +{ + which = 0; + BufferBlockSize = 0; +} + +BufferCircle::~BufferCircle() +{ + FreeBuffer(); + SoundBuffer.clear(); + BufferSize.clear(); + BufferReady.clear(); +} + +void BufferCircle::SetBufferBlockSize(int size) +{ + if(size < 0) + return; + + BufferBlockSize = size; + + for(int i = 0; i < Size(); i++) + { + SAFE_FREE(SoundBuffer[i]); + + SoundBuffer[i] = (u8 *) memalign(32, ALIGN32(BufferBlockSize)); + BufferSize[i] = 0; + BufferReady[i] = false; + } +} + +void BufferCircle::Resize(int size) +{ + while(size < Size()) + RemoveBuffer(Size()-1); + + int oldSize = Size(); + + SoundBuffer.resize(size); + BufferSize.resize(size); + BufferReady.resize(size); + + for(int i = oldSize; i < Size(); i++) + { + if(BufferBlockSize > 0) + SoundBuffer[i] = (u8 *) memalign(32, ALIGN32(BufferBlockSize)); + else + SoundBuffer[i] = NULL; + BufferSize[i] = 0; + BufferReady[i] = false; + } +} + +void BufferCircle::RemoveBuffer(int pos) +{ + if(!Valid(pos)) + return; + + SAFE_FREE(SoundBuffer[pos]); + + SoundBuffer.erase(SoundBuffer.begin()+pos); + BufferSize.erase(BufferSize.begin()+pos); + BufferReady.erase(BufferReady.begin()+pos); +} + +void BufferCircle::ClearBuffer() +{ + for(int i = 0; i < Size(); i++) + { + BufferSize[i] = 0; + BufferReady[i] = false; + } + which = 0; +} + +void BufferCircle::FreeBuffer() +{ + for(int i = 0; i < Size(); i++) + { + SAFE_FREE(SoundBuffer[i]); + BufferSize[i] = 0; + BufferReady[i] = false; + } +} + +void BufferCircle::LoadNext() +{ + int pos = (which+Size()-1) % Size(); + BufferReady[pos] = false; + BufferSize[pos] = 0; + + which = (which+1) % Size(); +} + +void BufferCircle::SetBufferReady(int pos, bool state) +{ + if(!Valid(pos)) + return; + + BufferReady[pos] = state; +} + +void BufferCircle::SetBufferSize(int pos, int size) +{ + if(!Valid(pos)) + return; + + BufferSize[pos] = size; +} diff --git a/source/music/BufferCircle.hpp b/source/music/BufferCircle.hpp new file mode 100644 index 00000000..fcb9d6e4 --- /dev/null +++ b/source/music/BufferCircle.hpp @@ -0,0 +1,92 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#ifndef BUFFER_CIRCLE_HPP_ +#define BUFFER_CIRCLE_HPP_ + +#include +#include + +class BufferCircle +{ + public: + //!> Constructor + BufferCircle(); + //!> Destructor + ~BufferCircle(); + //!> Set circle size + void Resize(int size); + //!> Get the circle size + int Size() { return SoundBuffer.size(); }; + //!> Set/resize the buffer size + void SetBufferBlockSize(int size); + //!> Remove a buffer + void RemoveBuffer(int pos); + //!> Set all buffers clear + void ClearBuffer(); + //!> Free all buffers + void FreeBuffer(); + //!> Switch to next buffer + void LoadNext(); + //!> Get the current buffer + u8 * GetBuffer() { if(!Valid(which)) return 0; return SoundBuffer[which]; }; + //!> Get a buffer at a position + u8 * GetBuffer(int pos) { if(!Valid(pos)) return NULL; else return SoundBuffer[pos]; }; + //!> Get next buffer + u8 * GetNextBuffer() { if(Size() <= 0) return 0; else return SoundBuffer[(which+1) % Size()]; }; + //!> Get previous buffer + u8 * GetLastBuffer() { if(Size() <= 0) return 0; else return SoundBuffer[(which+Size()-1) % Size()]; }; + //!> Get current buffer size + u32 GetBufferSize() { if(!Valid(which)) return 0; else return BufferSize[which]; }; + //!> Get buffer size at position + u32 GetBufferSize(int pos) { if(!Valid(pos)) return 0; else return BufferSize[pos]; }; + //!> Get previous buffer size + u32 GetLastBufferSize() { if(Size() <= 0) return 0; else return BufferSize[(which+Size()-1) % Size()]; }; + //!> Is current buffer ready + bool IsBufferReady() { if(!Valid(which)) return false; else return BufferReady[which]; }; + //!> Is a buffer at a position ready + bool IsBufferReady(int pos) { if(!Valid(pos)) return false; else return BufferReady[pos]; }; + //!> Is next buffer ready + bool IsNextBufferReady() { if(Size() <= 0) return false; else return BufferReady[(which+1) % Size()]; }; + //!> Is last buffer ready + bool IsLastBufferReady() { if(Size() <= 0) return false; else return BufferReady[(which+Size()-1) % Size()]; }; + //!> Set a buffer at a position to a ready state + void SetBufferReady(int pos, bool st); + //!> Set the buffersize at a position + void SetBufferSize(int pos, int size); + //!> Get the current position in the circle + u16 Which() { return which; }; + protected: + //!> Check if the position is a valid position in the vector + bool Valid(int pos) { return !(pos < 0 || pos >= Size()); }; + + u16 which; + u32 BufferBlockSize; + std::vector SoundBuffer; + std::vector BufferSize; + std::vector BufferReady; +}; + +#endif diff --git a/source/music/File.cpp b/source/music/File.cpp new file mode 100644 index 00000000..a2dd043d --- /dev/null +++ b/source/music/File.cpp @@ -0,0 +1,146 @@ +#include +#include "File.hpp" + +CFile::CFile() +{ + file_fd = NULL; + mem_file = NULL; + filesize = 0; + Pos = 0; +} + +CFile::CFile(const char * filepath, const char * mode) +{ + file_fd = NULL; + open(filepath, mode); +} + +CFile::CFile(const u8 * mem, int size) +{ + file_fd = NULL; + open(mem, size); +} + +CFile::~CFile() +{ + close(); +} + +int CFile::open(const char * filepath, const char * mode) +{ + close(); + + file_fd = fopen(filepath, mode); + if(!file_fd) + return -1; + + fseek(file_fd, 0, SEEK_END); + filesize = ftell(file_fd); + rewind(); + + return 0; +} + +int CFile::open(const u8 * mem, int size) +{ + close(); + + mem_file = mem; + filesize = size; + + return 0; +} + +void CFile::close() +{ + if(file_fd) + fclose(file_fd); + + file_fd = NULL; + mem_file = NULL; + filesize = 0; + Pos = 0; +} + +int CFile::read(u8 * ptr, size_t size) +{ + if(file_fd) + { + int ret = fread(ptr, 1, size, file_fd); + if(ret > 0) + Pos += ret; + return ret; + } + + int readsize = size; + + if(readsize > (long int) filesize-Pos) + readsize = filesize-Pos; + + if(readsize <= 0) + return readsize; + + if(mem_file != NULL) + { + memcpy(ptr, mem_file+Pos, readsize); + Pos += readsize; + return readsize; + } + + return -1; +} + +int CFile::write(const u8 * ptr, size_t size) +{ +/* + if(size < 0) + return size; +*/ + if(file_fd) + { + int ret = fwrite(ptr, 1, size, file_fd); + if(ret > 0) + Pos += ret; + return ret; + } + + return -1; +} + +int CFile::seek(long int offset, int origin) +{ + int ret = 0; + + if(origin == SEEK_SET) + { + Pos = offset; + } + else if(origin == SEEK_CUR) + { + Pos += offset; + } + else if(origin == SEEK_END) + { + Pos = filesize+offset; + } + if(Pos < 0) + { + Pos = 0; + return -1; + } + + if(file_fd) + ret = fseek(file_fd, Pos, SEEK_SET); + + if(mem_file != NULL) + { + if(Pos > (long int) filesize) + { + Pos = filesize; + return -1; + } + } + + return ret; +} + diff --git a/source/music/File.hpp b/source/music/File.hpp new file mode 100644 index 00000000..b5e1af75 --- /dev/null +++ b/source/music/File.hpp @@ -0,0 +1,30 @@ +#ifndef FILE_HPP_ +#define FILE_HPP_ + +#include +#include + +class CFile +{ + public: + CFile(); + CFile(const char * filepath, const char * mode); + CFile(const u8 * memory, int memsize); + ~CFile(); + int open(const char * filepath, const char * mode); + int open(const u8 * memory, int memsize); + void close(); + int read(u8 * ptr, size_t size); + int write(const u8 * ptr, size_t size); + int seek(long int offset, int origin); + long int tell() { return Pos; }; + long int size() { return filesize; }; + void rewind() { seek(0, SEEK_SET); }; + protected: + FILE * file_fd; + const u8 * mem_file; + u64 filesize; + long int Pos; +}; + +#endif diff --git a/source/music/Mp3Decoder.cpp b/source/music/Mp3Decoder.cpp new file mode 100644 index 00000000..03a8d0a6 --- /dev/null +++ b/source/music/Mp3Decoder.cpp @@ -0,0 +1,214 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include +#include +#include +#include +#include +#include "Mp3Decoder.hpp" + +Mp3Decoder::Mp3Decoder(const char * filepath) + : SoundDecoder(filepath) +{ + SoundType = SOUND_MP3; + ReadBuffer = NULL; + mad_timer_reset(&Timer); + mad_stream_init(&Stream); + mad_frame_init(&Frame); + mad_synth_init(&Synth); + + if(!file_fd) + return; + + OpenFile(); +} + +Mp3Decoder::Mp3Decoder(const u8 * snd, int len) + : SoundDecoder(snd, len) +{ + SoundType = SOUND_MP3; + ReadBuffer = NULL; + mad_timer_reset(&Timer); + mad_stream_init(&Stream); + mad_frame_init(&Frame); + mad_synth_init(&Synth); + + if(!file_fd) + return; + + OpenFile(); +} + +Mp3Decoder::~Mp3Decoder() +{ + ExitRequested = true; + while(Decoding) + usleep(100); + + mad_synth_finish(&Synth); + mad_frame_finish(&Frame); + mad_stream_finish(&Stream); + + SAFE_FREE(ReadBuffer); +} + +void Mp3Decoder::OpenFile() +{ + GuardPtr = NULL; + ReadBuffer = (u8 *) memalign(32, SoundBlockSize*SoundBlocks); + if(!ReadBuffer) + { + if(file_fd) + delete file_fd; + file_fd = NULL; + return; + } + + u8 dummybuff[4096]; + int ret = Read((u8 *) &dummybuff, 4096, 0); + if(ret <= 0) + { + if(file_fd) + delete file_fd; + file_fd = NULL; + return; + } + + SampleRate = (u32) Frame.header.samplerate; + Format = ((MAD_NCHANNELS(&Frame.header) == 2) ? VOICE_STEREO_16BIT : VOICE_MONO_16BIT); + Rewind(); + Decode(); +} + +int Mp3Decoder::Rewind() +{ + mad_synth_finish(&Synth); + mad_frame_finish(&Frame); + mad_stream_finish(&Stream); + mad_timer_reset(&Timer); + mad_stream_init(&Stream); + mad_frame_init(&Frame); + mad_synth_init(&Synth); + SynthPos = 0; + GuardPtr = NULL; + + if(!file_fd) + return -1; + + return SoundDecoder::Rewind(); +} + +static inline s16 FixedToShort(mad_fixed_t Fixed) +{ + /* Clipping */ + if(Fixed>=MAD_F_ONE) + return(SHRT_MAX); + if(Fixed<=-MAD_F_ONE) + return(-SHRT_MAX); + + Fixed=Fixed>>(MAD_F_FRACBITS-15); + return((s16)Fixed); +} + +int Mp3Decoder::Read(u8 * buffer, int buffer_size, int) +{ + if(!file_fd) + return -1; + + if(Format == VOICE_STEREO_16BIT) + buffer_size &= ~0x0003; + else + buffer_size &= ~0x0001; + + u8 * write_pos = buffer; + u8 * write_end = buffer+buffer_size; + + while(1) + { + while(SynthPos < Synth.pcm.length) + { + if(write_pos >= write_end) + return write_pos-buffer; + + *((s16 *) write_pos) = FixedToShort(Synth.pcm.samples[0][SynthPos]); + write_pos += 2; + + if(MAD_NCHANNELS(&Frame.header) == 2) + { + *((s16 *) write_pos) = FixedToShort(Synth.pcm.samples[1][SynthPos]); + write_pos += 2; + } + SynthPos++; + } + + if(Stream.buffer == NULL || Stream.error == MAD_ERROR_BUFLEN) + { + u8 * ReadStart = ReadBuffer; + int ReadSize = SoundBlockSize*SoundBlocks; + int Remaining = 0; + + if(Stream.next_frame != NULL) + { + Remaining = Stream.bufend - Stream.next_frame; + memmove(ReadBuffer, Stream.next_frame, Remaining); + ReadStart += Remaining; + ReadSize -= Remaining; + } + + ReadSize = file_fd->read(ReadStart, ReadSize); + if(ReadSize <= 0) + { + GuardPtr = ReadStart; + memset(GuardPtr, 0, MAD_BUFFER_GUARD); + ReadSize = MAD_BUFFER_GUARD; + } + + CurPos += ReadSize; + mad_stream_buffer(&Stream, ReadBuffer, Remaining+ReadSize); + } + + if(mad_frame_decode(&Frame,&Stream)) + { + if(MAD_RECOVERABLE(Stream.error)) + { + if(Stream.error != MAD_ERROR_LOSTSYNC || !GuardPtr) + continue; + } + else + { + if(Stream.error != MAD_ERROR_BUFLEN) + return -1; + else if(Stream.error == MAD_ERROR_BUFLEN && GuardPtr) + return -1; + } + } + + mad_timer_add(&Timer,Frame.header.duration); + mad_synth_frame(&Synth,&Frame); + SynthPos = 0; + } +} diff --git a/source/music/Mp3Decoder.hpp b/source/music/Mp3Decoder.hpp new file mode 100644 index 00000000..a622f1f3 --- /dev/null +++ b/source/music/Mp3Decoder.hpp @@ -0,0 +1,51 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include + +#include "SoundDecoder.hpp" + +class Mp3Decoder : public SoundDecoder +{ + public: + Mp3Decoder(const char * filepath); + Mp3Decoder(const u8 * sound, int len); + ~Mp3Decoder(); + int GetFormat() { return Format; }; + int GetSampleRate() { return SampleRate; }; + int Rewind(); + int Read(u8 * buffer, int buffer_size, int pos); + protected: + void OpenFile(); + struct mad_stream Stream; + struct mad_frame Frame; + struct mad_synth Synth; + mad_timer_t Timer; + u8 * GuardPtr; + u8 * ReadBuffer; + u8 Format; + u32 SampleRate; + u32 SynthPos; +}; diff --git a/source/music/OggDecoder.cpp b/source/music/OggDecoder.cpp new file mode 100644 index 00000000..d0ae1abe --- /dev/null +++ b/source/music/OggDecoder.cpp @@ -0,0 +1,144 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include +#include "OggDecoder.hpp" + +extern "C" int ogg_read(void * punt, int bytes, int blocks, int *f) +{ + return ((CFile *) f)->read((u8 *) punt, bytes*blocks); +} + +extern "C" int ogg_seek(int *f, ogg_int64_t offset, int mode) +{ + return ((CFile *) f)->seek((u64) offset, mode); +} + +extern "C" int ogg_close(int *f) +{ + ((CFile *) f)->close(); + return 0; +} + +extern "C" long ogg_tell(int *f) +{ + return (long) ((CFile *) f)->tell(); +} + +static ov_callbacks callbacks = { + (size_t (*)(void *, size_t, size_t, void *)) ogg_read, + (int (*)(void *, ogg_int64_t, int)) ogg_seek, + (int (*)(void *)) ogg_close, + (long (*)(void *)) ogg_tell +}; + +OggDecoder::OggDecoder(const char * filepath) + : SoundDecoder(filepath) +{ + SoundType = SOUND_OGG; + + if(!file_fd) + return; + + OpenFile(); +} + +OggDecoder::OggDecoder(const u8 * snd, int len) + : SoundDecoder(snd, len) +{ + SoundType = SOUND_OGG; + + if(!file_fd) + return; + + OpenFile(); +} + +OggDecoder::~OggDecoder() +{ + ExitRequested = true; + while(Decoding) + usleep(100); + + if(file_fd) + ov_clear(&ogg_file); +} + +void OggDecoder::OpenFile() +{ + if (ov_open_callbacks(file_fd, &ogg_file, NULL, 0, callbacks) < 0) + { + delete file_fd; + file_fd = NULL; + return; + } + + ogg_info = ov_info(&ogg_file, -1); + Decode(); +} + +int OggDecoder::GetFormat() +{ + if(!file_fd) + return VOICE_STEREO_16BIT; + + return ((ogg_info->channels == 2) ? VOICE_STEREO_16BIT : VOICE_MONO_16BIT); +} + +int OggDecoder::GetSampleRate() +{ + if(!file_fd) + return 0; + + return (int) ogg_info->rate; +} + +int OggDecoder::Rewind() +{ + if(!file_fd) + return -1; + + int ret = ov_time_seek(&ogg_file, 0); + CurPos = 0; + EndOfFile = false; + + return ret; +} + +int OggDecoder::Read(u8 * buffer, int buffer_size, int) +{ + if(!file_fd) + return -1; + + int bitstream = 0; + + int read = ov_read(&ogg_file, (char *) buffer, buffer_size, &bitstream); + + if(read > 0) + CurPos += read; + + return read; +} diff --git a/source/music/OggDecoder.hpp b/source/music/OggDecoder.hpp new file mode 100644 index 00000000..49de225e --- /dev/null +++ b/source/music/OggDecoder.hpp @@ -0,0 +1,45 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include + +#include "SoundDecoder.hpp" + +class OggDecoder : public SoundDecoder +{ + public: + OggDecoder(const char * filepath); + OggDecoder(const u8 * snd, int len); + ~OggDecoder(); + int GetFormat(); + int GetSampleRate(); + int Rewind(); + int Read(u8 * buffer, int buffer_size, int pos); + protected: + void OpenFile(); + OggVorbis_File ogg_file; + vorbis_info *ogg_info; +}; diff --git a/source/music/SoundDecoder.cpp b/source/music/SoundDecoder.cpp new file mode 100644 index 00000000..ccb53a07 --- /dev/null +++ b/source/music/SoundDecoder.cpp @@ -0,0 +1,155 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * 3Band resampling thanks to libmad + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include +#include +#include +#include "SoundDecoder.hpp" + +SoundDecoder::SoundDecoder() +{ + file_fd = NULL; + Init(); +} + +SoundDecoder::SoundDecoder(const char * filepath) +{ + file_fd = new CFile(filepath, "rb"); + Init(); +} + +SoundDecoder::SoundDecoder(const u8 * buffer, int size) +{ + file_fd = new CFile(buffer, size); + Init(); +} + +SoundDecoder::~SoundDecoder() +{ + ExitRequested = true; + while(Decoding) + usleep(100); + + if(file_fd) + delete file_fd; + file_fd = NULL; +} + +void SoundDecoder::Init() +{ + SoundType = SOUND_RAW; + SoundBlocks = 8; //Settings.SoundblockCount; + SoundBlockSize = 8092; //Settings.SoundblockSize; + CurPos = 0; + Loop = false; + EndOfFile = false; + Decoding = false; + ExitRequested = false; + SoundBuffer.SetBufferBlockSize(SoundBlockSize); + SoundBuffer.Resize(SoundBlocks); +} + +int SoundDecoder::Rewind() +{ + CurPos = 0; + EndOfFile = false; + file_fd->rewind(); + + return 0; +} + +int SoundDecoder::Read(u8 * buffer, int buffer_size, int) +{ + int ret = file_fd->read(buffer, buffer_size); + CurPos += ret; + + return ret; +} + +void SoundDecoder::Decode() +{ + if(!file_fd || ExitRequested || EndOfFile) + return; + + u16 newWhich = SoundBuffer.Which(); + u16 i = 0; + for (i = 0; i < SoundBuffer.Size()-2; i++) + { + if(!SoundBuffer.IsBufferReady(newWhich)) + break; + + newWhich = (newWhich+1) % SoundBuffer.Size(); + } + + if(i == SoundBuffer.Size()-2) + return; + + Decoding = true; + + int done = 0; + u8 * write_buf = SoundBuffer.GetBuffer(newWhich); + if(!write_buf) + { + ExitRequested = true; + Decoding = false; + return; + } + + while(done < SoundBlockSize) + { + int ret = Read(&write_buf[done], SoundBlockSize-done, Tell()); + + if(ret <= 0) + { + if(Loop) + { + Rewind(); + continue; + } + else + { + EndOfFile = true; + break; + } + } + + done += ret; + } + + if(done > 0) + { + SoundBuffer.SetBufferSize(newWhich, done); + SoundBuffer.SetBufferReady(newWhich, true); + } + + if(!SoundBuffer.IsBufferReady((newWhich+1) % SoundBuffer.Size())) + Decode(); + + Decoding = false; +} + diff --git a/source/music/SoundDecoder.hpp b/source/music/SoundDecoder.hpp new file mode 100644 index 00000000..b1c7e588 --- /dev/null +++ b/source/music/SoundDecoder.hpp @@ -0,0 +1,90 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#ifndef SOUND_DECODER_HPP +#define SOUND_DECODER_HPP + +#include +#include +#include +//#include "Tools/timer.h" +#include "File.hpp" +#include "BufferCircle.hpp" +#include "utils.h" + +enum +{ + SOUND_RAW = 0, + SOUND_MP3, + SOUND_OGG, + SOUND_WAV, + SOUND_BNS, + SOUND_AIF +}; + +class SoundDecoder +{ + public: + SoundDecoder(); + SoundDecoder(const char * filepath); + SoundDecoder(const u8 * buffer, int size); + ~SoundDecoder(); + virtual int Read(u8 * buffer, int buffer_size, int pos); + virtual int Tell() { return CurPos; }; + virtual int Seek(int pos) { CurPos = pos; return file_fd->seek(CurPos, SEEK_SET); }; + virtual int Rewind(); + virtual int GetFormat() { return VOICE_STEREO_16BIT; }; + virtual int GetSampleRate() { return 48000; }; + virtual void Decode(); + virtual u32 GetBufferSize() { return SoundBuffer.GetBufferSize(); }; + virtual u8 * GetBuffer() { return SoundBuffer.GetBuffer(); }; + virtual u8 * GetNextBuffer() { return SoundBuffer.GetNextBuffer(); }; + virtual u8 * GetLastBuffer() { return SoundBuffer.GetLastBuffer(); }; + virtual void LoadNext() { SoundBuffer.LoadNext(); }; + virtual bool IsBufferReady() { return SoundBuffer.IsBufferReady(); }; + virtual bool IsNextBufferReady() { return SoundBuffer.IsNextBufferReady(); }; + virtual bool IsLastBufferReady() { return SoundBuffer.IsLastBufferReady(); }; + virtual bool IsEOF() { return EndOfFile; }; + virtual void SetLoop(bool l) { Loop = l; }; + virtual u8 GetSoundType() { return SoundType; }; + virtual void ClearBuffer() { SoundBuffer.ClearBuffer(); }; + virtual bool IsStereo() { return (GetFormat() == VOICE_STEREO_16BIT || GetFormat() == VOICE_STEREO_8BIT); }; + virtual bool Is16Bit() { return (GetFormat() == VOICE_STEREO_16BIT || GetFormat() == VOICE_MONO_16BIT); }; + protected: + void Init(); + + CFile * file_fd; + BufferCircle SoundBuffer; + u8 SoundType; + u16 SoundBlocks; + int SoundBlockSize; + int CurPos; + bool Loop; + bool EndOfFile; + bool Decoding; + bool ExitRequested; +}; + +#endif diff --git a/source/music/SoundHandler.cpp b/source/music/SoundHandler.cpp new file mode 100644 index 00000000..3531a201 --- /dev/null +++ b/source/music/SoundHandler.cpp @@ -0,0 +1,282 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include +#include "SoundHandler.hpp" +#include "Mp3Decoder.hpp" +#include "OggDecoder.hpp" +#include "WavDecoder.hpp" +#include "AifDecoder.hpp" +#include "BNSDecoder.hpp" + +#include "gecko/gecko.h" + +SoundHandler * SoundHandler::instance = NULL; + +SoundHandler::SoundHandler() +{ + Decoding = false; + ExitRequested = false; + for(u32 i = 0; i < MAX_DECODERS; ++i) + DecoderList[i] = NULL; + + ThreadStack = (u8 *) memalign(32, 32768); + if(!ThreadStack) + return; + + LWP_CreateThread(&SoundThread, UpdateThread, this, ThreadStack, 32768, 80); + //gprintf("SHND: Running sound thread\n"); +} + +SoundHandler::~SoundHandler() +{ + gprintf("SHND: Stopping sound thread\n"); + + ExitRequested = true; + ThreadSignal(); + LWP_JoinThread(SoundThread, NULL); + SoundThread = LWP_THREAD_NULL; + SAFE_FREE(ThreadStack); + + ClearDecoderList(); + gprintf("SHND: Stopped sound thread\n"); +} + +SoundHandler * SoundHandler::Instance() +{ + if (instance == NULL) + { + instance = new SoundHandler(); + } + return instance; +} + +void SoundHandler::DestroyInstance() +{ + if(instance) + { + delete instance; + } + instance = NULL; +} + +void SoundHandler::AddDecoder(int voice, const char * filepath) +{ + if(voice < 0 || voice >= MAX_DECODERS) + return; + + if(DecoderList[voice] != NULL) + RemoveDecoder(voice); + + DecoderList[voice] = GetSoundDecoder(filepath); +} + +void SoundHandler::AddDecoder(int voice, const u8 * snd, int len) +{ + if(voice < 0 || voice >= MAX_DECODERS) + return; + + if (snd == NULL || len == 0) + return; + + if(DecoderList[voice] != NULL) + RemoveDecoder(voice); + + DecoderList[voice] = GetSoundDecoder(snd, len); +} + +void SoundHandler::RemoveDecoder(int voice) +{ + if(voice < 0 || voice >= MAX_DECODERS) + return; + + if(DecoderList[voice] != NULL) + { + if(DecoderList[voice]->GetSoundType() == SOUND_OGG) delete ((OggDecoder *) DecoderList[voice]); + else if(DecoderList[voice]->GetSoundType() == SOUND_MP3) delete ((Mp3Decoder *) DecoderList[voice]); + else if(DecoderList[voice]->GetSoundType() == SOUND_WAV) delete ((WavDecoder *) DecoderList[voice]); + else if(DecoderList[voice]->GetSoundType() == SOUND_AIF) delete ((AifDecoder *) DecoderList[voice]); + else if(DecoderList[voice]->GetSoundType() == SOUND_BNS) delete ((BNSDecoder *) DecoderList[voice]); + else delete DecoderList[voice]; + } + + DecoderList[voice] = NULL; +} + +void SoundHandler::ClearDecoderList() +{ + for(u32 i = 0; i < MAX_DECODERS; ++i) + RemoveDecoder(i); +} + +static inline bool CheckMP3Signature(const u8 * buffer) +{ + const char MP3_Magic[][3] = + { + {'I', 'D', '3'}, //'ID3' + {0xff, 0xfe}, //'MPEG ADTS, layer III, v1.0 [protected]', 'mp3', 'audio/mpeg'), + {0xff, 0xff}, //'MPEG ADTS, layer III, v1.0', 'mp3', 'audio/mpeg'), + {0xff, 0xfa}, //'MPEG ADTS, layer III, v1.0 [protected]', 'mp3', 'audio/mpeg'), + {0xff, 0xfb}, //'MPEG ADTS, layer III, v1.0', 'mp3', 'audio/mpeg'), + {0xff, 0xf2}, //'MPEG ADTS, layer III, v2.0 [protected]', 'mp3', 'audio/mpeg'), + {0xff, 0xf3}, //'MPEG ADTS, layer III, v2.0', 'mp3', 'audio/mpeg'), + {0xff, 0xf4}, //'MPEG ADTS, layer III, v2.0 [protected]', 'mp3', 'audio/mpeg'), + {0xff, 0xf5}, //'MPEG ADTS, layer III, v2.0', 'mp3', 'audio/mpeg'), + {0xff, 0xf6}, //'MPEG ADTS, layer III, v2.0 [protected]', 'mp3', 'audio/mpeg'), + {0xff, 0xf7}, //'MPEG ADTS, layer III, v2.0', 'mp3', 'audio/mpeg'), + {0xff, 0xe2}, //'MPEG ADTS, layer III, v2.5 [protected]', 'mp3', 'audio/mpeg'), + {0xff, 0xe3}, //'MPEG ADTS, layer III, v2.5', 'mp3', 'audio/mpeg'), + }; + + if(buffer[0] == MP3_Magic[0][0] && buffer[1] == MP3_Magic[0][1] && + buffer[2] == MP3_Magic[0][2]) + { + return true; + } + + for(int i = 1; i < 13; i++) + { + if(buffer[0] == MP3_Magic[i][0] && buffer[1] == MP3_Magic[i][1]) + return true; + } + + return false; +} + +SoundDecoder * SoundHandler::GetSoundDecoder(const char * filepath) +{ + u32 magic; + CFile f(filepath, "rb"); + if(f.size() == 0) + return NULL; + + do + { + f.read((u8 *) &magic, 1); + } + while(((u8 *) &magic)[0] == 0 && f.tell() < f.size()); + + if(f.tell() == f.size()) + return NULL; + + f.seek(f.tell()-1, SEEK_SET); + f.read((u8 *) &magic, 4); + f.close(); + +/* gprintf("SHND: Searching decoder for magic\n"); + ghexdump((u8 *) &magic, 4); */ + + if(magic == 'OggS') + { + return new OggDecoder(filepath); + } + else if(magic == 'RIFF') + { + return new WavDecoder(filepath); + } + else if(magic == 'BNS ') + { + return new BNSDecoder(filepath); + } + else if(magic == 'FORM') + { + return new AifDecoder(filepath); + } + else if(CheckMP3Signature((u8 *) &magic) == true) + { + return new Mp3Decoder(filepath); + } + + return new SoundDecoder(filepath); +} + +SoundDecoder * SoundHandler::GetSoundDecoder(const u8 * sound, int length) +{ + const u8 * check = sound; + int counter = 0; + + while(check[0] == 0 && counter < length) + { + check++; + counter++; + } + + if(counter >= length) + return NULL; + + u32 * magic = (u32 *) check; + + if(magic[0] == 'OggS') + { + return new OggDecoder(sound, length); + } + else if(magic[0] == 'RIFF') + { + return new WavDecoder(sound, length); + } + else if(magic[0] == 'BNS ') + { + return new BNSDecoder(sound, length); + } + else if(magic[0] == 'FORM') + { + return new AifDecoder(sound, length); + } + else if(CheckMP3Signature(check) == true) + { + return new Mp3Decoder(sound, length); + } + + return new SoundDecoder(sound, length); +} + +void * SoundHandler::UpdateThread(void *arg) +{ + ((SoundHandler *) arg)->InternalSoundUpdates(); + return NULL; +} + +void SoundHandler::InternalSoundUpdates() +{ + u16 i = 0; + LWP_InitQueue(&ThreadQueue); + while (!ExitRequested) + { + LWP_ThreadSleep(ThreadQueue); + + for(i = 0; i < MAX_DECODERS; ++i) + { + if(DecoderList[i] == NULL) + continue; + + Decoding = true; + DecoderList[i]->Decode(); + } + Decoding = false; + } + LWP_CloseQueue(ThreadQueue); + ThreadQueue = LWP_TQUEUE_NULL; +} diff --git a/source/music/SoundHandler.hpp b/source/music/SoundHandler.hpp new file mode 100644 index 00000000..b10953ec --- /dev/null +++ b/source/music/SoundHandler.hpp @@ -0,0 +1,68 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#ifndef SOUNDHANDLER_H_ +#define SOUNDHANDLER_H_ + +#include +#include +#include "SoundDecoder.hpp" + +#define MAX_DECODERS 16 + +class SoundHandler +{ + public: + static SoundHandler * Instance(); + static void DestroyInstance(); + + void AddDecoder(int voice, const char * filepath); + void AddDecoder(int voice, const u8 * snd, int len); + void RemoveDecoder(int voice); + void DestroyDecoder(SoundDecoder * decoder); + + SoundDecoder * Decoder(int i) { return ((i < 0 || i >= MAX_DECODERS) ? NULL : DecoderList[i]); }; + void ThreadSignal() { LWP_ThreadSignal(ThreadQueue); }; + bool IsDecoding() { return Decoding; }; + protected: + SoundHandler(); + ~SoundHandler(); + static void * UpdateThread(void *arg); + void InternalSoundUpdates(); + void ClearDecoderList(); + SoundDecoder * GetSoundDecoder(const char * filepath); + SoundDecoder * GetSoundDecoder(const u8 * sound, int length); + + static SoundHandler * instance; + u8 * ThreadStack; + lwp_t SoundThread; + lwpq_t ThreadQueue; + bool Decoding; + bool ExitRequested; + + SoundDecoder * DecoderList[MAX_DECODERS]; +}; + +#endif diff --git a/source/music/WavDecoder.cpp b/source/music/WavDecoder.cpp new file mode 100644 index 00000000..f086580d --- /dev/null +++ b/source/music/WavDecoder.cpp @@ -0,0 +1,154 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include "WavDecoder.hpp" + +WavDecoder::WavDecoder(const char * filepath) + : SoundDecoder(filepath) +{ + SoundType = SOUND_WAV; + SampleRate = 48000; + Format = VOICE_STEREO_16BIT; + + if(!file_fd) + return; + + OpenFile(); +} + +WavDecoder::WavDecoder(const u8 * snd, int len) + : SoundDecoder(snd, len) +{ + SoundType = SOUND_WAV; + SampleRate = 48000; + Format = VOICE_STEREO_16BIT; + + if(!file_fd) + return; + + OpenFile(); +} + +WavDecoder::~WavDecoder() +{ +} + +void WavDecoder::OpenFile() +{ + SWaveHdr Header; + SWaveFmtChunk FmtChunk; + memset(&Header, 0, sizeof(SWaveHdr)); + memset(&FmtChunk, 0, sizeof(SWaveFmtChunk)); + + file_fd->read((u8 *) &Header, sizeof(SWaveHdr)); + file_fd->read((u8 *) &FmtChunk, sizeof(SWaveFmtChunk)); + + if (Header.magicRIFF != 'RIFF') + { + CloseFile(); + return; + } + else if(Header.magicWAVE != 'WAVE') + { + CloseFile(); + return; + } + else if(FmtChunk.magicFMT != 'fmt ') + { + CloseFile(); + return; + } + + DataOffset = sizeof(SWaveHdr)+le32(FmtChunk.size)+8; + file_fd->seek(DataOffset, SEEK_SET); + SWaveChunk DataChunk; + file_fd->read((u8 *) &DataChunk, sizeof(SWaveChunk)); + + if(DataChunk.magicDATA == 'fact') + { + DataOffset += 8+le32(DataChunk.size); + file_fd->seek(DataOffset, SEEK_SET); + file_fd->read((u8 *) &DataChunk, sizeof(SWaveChunk)); + } + if(DataChunk.magicDATA != 'data') + { + CloseFile(); + return; + } + + DataOffset += 8; + DataSize = le32(DataChunk.size); + Is16Bit = (le16(FmtChunk.bps) == 16); + SampleRate = le32(FmtChunk.freq); + + if (le16(FmtChunk.channels) == 1 && le16(FmtChunk.bps) == 8 && le16(FmtChunk.alignment) <= 1) + Format = VOICE_MONO_8BIT; + else if (le16(FmtChunk.channels) == 1 && le16(FmtChunk.bps) == 16 && le16(FmtChunk.alignment) <= 2) + Format = VOICE_MONO_16BIT; + else if (le16(FmtChunk.channels) == 2 && le16(FmtChunk.bps) == 8 && le16(FmtChunk.alignment) <= 2) + Format = VOICE_STEREO_8BIT; + else if (le16(FmtChunk.channels) == 2 && le16(FmtChunk.bps) == 16 && le16(FmtChunk.alignment) <= 4) + Format = VOICE_STEREO_16BIT; + + Decode(); +} + +void WavDecoder::CloseFile() +{ + if(file_fd) + delete file_fd; + + file_fd = NULL; +} + +int WavDecoder::Read(u8 * buffer, int buffer_size, int) +{ + if(!file_fd) + return -1; + + if(CurPos >= (int) DataSize) + return 0; + + file_fd->seek(DataOffset+CurPos, SEEK_SET); + + if(buffer_size > (int) DataSize-CurPos) + buffer_size = DataSize-CurPos; + + int read = file_fd->read(buffer, buffer_size); + if(read > 0) + { + if (Is16Bit) + { + read &= ~0x0001; + + for (u32 i = 0; i < (u32) (read / sizeof (u16)); ++i) + ((u16 *) buffer)[i] = le16(((u16 *) buffer)[i]); + } + CurPos += read; + } + + return read; +} diff --git a/source/music/WavDecoder.hpp b/source/music/WavDecoder.hpp new file mode 100644 index 00000000..4681bf2b --- /dev/null +++ b/source/music/WavDecoder.hpp @@ -0,0 +1,75 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#ifndef WAVDECODER_HPP_ +#define WAVDECODER_HPP_ + +#include "SoundDecoder.hpp" + +typedef struct +{ + u32 magicRIFF; + u32 size; + u32 magicWAVE; +} SWaveHdr; + +typedef struct +{ + u32 magicFMT; + u32 size; + u16 format; + u16 channels; + u32 freq; + u32 avgBps; + u16 alignment; + u16 bps; +} SWaveFmtChunk; + +typedef struct +{ + u32 magicDATA; + u32 size; +} SWaveChunk; + +class WavDecoder : public SoundDecoder +{ + public: + WavDecoder(const char * filepath); + WavDecoder(const u8 * snd, int len); + ~WavDecoder(); + int GetFormat() { return Format; }; + int GetSampleRate() { return SampleRate; }; + int Read(u8 * buffer, int buffer_size, int pos); + protected: + void OpenFile(); + void CloseFile(); + u32 DataOffset; + u32 DataSize; + u32 SampleRate; + u8 Format; + bool Is16Bit; +}; + +#endif diff --git a/source/music/gui_sound.cpp b/source/music/gui_sound.cpp new file mode 100644 index 00000000..d813ad46 --- /dev/null +++ b/source/music/gui_sound.cpp @@ -0,0 +1,509 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#include +#include +#include "SoundHandler.hpp" +#include "gui_sound.h" +#include "musicplayer.h" +#include "WavDecoder.hpp" +#include "loader/sys.h" + +#define MAX_SND_VOICES 16 + +using namespace std; + +static bool VoiceUsed[MAX_SND_VOICES] = +{ + true, false, false, false, false, false, + false, false, false, false, false, false, + false, false, false, false +}; + +static inline int GetFirstUnusedVoice() +{ + for(int i = 1; i < MAX_SND_VOICES; i++) + { + if(VoiceUsed[i] == false) + return i; + } + gprintf("ALL VOICES USED UP!!\n"); + return -1; +} + +extern "C" void SoundCallback(s32 voice) +{ + SoundDecoder * decoder = SoundHandler::Instance()->Decoder(voice); + if(!decoder) return; + + if(decoder->IsBufferReady()) + { + if(ASND_AddVoice(voice, decoder->GetBuffer(), decoder->GetBufferSize()) == SND_OK) + { + decoder->LoadNext(); + SoundHandler::Instance()->ThreadSignal(); + } + } + else if(decoder->IsEOF()) + ASND_StopVoice(voice); + else + SoundHandler::Instance()->ThreadSignal(); +} + +GuiSound::GuiSound() +{ + voice = -1; + Init(); +} + +GuiSound::GuiSound(string filepath, int v) +{ + voice = v; + Init(); + Load(filepath.c_str()); +} + +GuiSound::GuiSound(const u8 * snd, u32 len, string name, bool isallocated, int v) +{ + voice = v; + Init(); + Load(snd, len, isallocated); + this->filepath = name; +} + +GuiSound::GuiSound(GuiSound *g) +{ + voice = -1; + + Init(); + if (g == NULL) return; + + if (g->sound != NULL) + { + u8 * snd = (u8 *) malloc(g->length); + memcpy(snd, g->sound, length); + Load(snd, g->length, true); + } + else + Load(g->filepath.c_str()); +} + +GuiSound::~GuiSound() +{ + FreeMemory(); + VoiceUsed[voice] = false; +} + +void GuiSound::Init() +{ + sound = NULL; + length = 0; + + if (voice == -1) + voice = GetFirstUnusedVoice(); + if(voice > 0) + VoiceUsed[voice] = true; + + volume = 255; + SoundEffectLength = 0; + loop = false; + allocated = false; +} + +void GuiSound::FreeMemory() +{ + Stop(); + + // Prevent reinitialization of SoundHandler since we're exiting + if (!Sys_Exiting()) + SoundHandler::Instance()->RemoveDecoder(voice); + + if(allocated) + { + SAFE_FREE(sound); + allocated = false; + } + filepath = ""; + + SoundEffectLength = 0; +} + +bool GuiSound::Load(const char * filepath) +{ + FreeMemory(); + + if(!filepath || filepath[strlen(filepath)-1] == '/' || strlen(filepath) < 4) + return false; + + FILE * f = fopen(filepath, "rb"); + if(!f) + { gprintf("Failed to load file %s!!\n", filepath); + return false; + } + + u32 magic; + fread(&magic, 1, 4, f); + fclose(f); + + SoundHandler::Instance()->AddDecoder(voice, filepath); + gprintf("Loading %s using voice %d\n", filepath, voice); + SoundDecoder * decoder = SoundHandler::Instance()->Decoder(voice); + if(!decoder) + { gprintf("No Decoder!!!\n"); + return false; + } + + if(!decoder->IsBufferReady()) + { gprintf("Buffer not ready!!n"); + SoundHandler::Instance()->RemoveDecoder(voice); + return false; + } + + this->filepath = filepath; + SetLoop(loop); + + return true; +} + +bool GuiSound::Load(const u8 * snd, u32 len, bool isallocated) +{ + FreeMemory(); + this->voice = voice; + + if(!snd) + { + return false; + } + + if(!isallocated && *((u32 *) snd) == 'RIFF') + { + return LoadSoundEffect(snd, len); + } + + if(*((u32 *) snd) == 'IMD5') + { + UncompressSoundbin(snd, len, isallocated); + } + else + { + sound = (u8 *) snd; + length = len; + allocated = isallocated; + } + + SoundHandler::Instance()->AddDecoder(this->voice, sound, length); + + SoundDecoder * decoder = SoundHandler::Instance()->Decoder(voice); + if(!decoder) + { + return false; + } + + if(!decoder->IsBufferReady()) + { + SoundHandler::Instance()->RemoveDecoder(voice); + return false; + } + + SetLoop(loop); + + return true; +} + +bool GuiSound::LoadSoundEffect(const u8 * snd, u32 len) +{ + FreeMemory(); + + WavDecoder decoder(snd, len); + decoder.Rewind(); + + u32 done = 0; + sound = (u8 *) malloc(4096); + memset(sound, 0, 4096); + + while(1) + { + u8 * tmpsnd = (u8 *) realloc(sound, done+4096); + if(!tmpsnd) + { + SAFE_FREE(sound); + return false; + } + + sound = tmpsnd; + + int read = decoder.Read(sound+done, 4096, done); + if(read <= 0) + break; + + done += read; + } + + sound = (u8 *) realloc(sound, done); + SoundEffectLength = done; + allocated = true; + + return true; +} + +void GuiSound::Play(int vol, bool restart) +{ + if(SoundEffectLength > 0) + { + ASND_StopVoice(voice); + ASND_SetVoice(voice, VOICE_STEREO_16BIT, 32000, 0, sound, SoundEffectLength, vol, vol, NULL); + return; + } + + if(IsPlaying() && !restart) + { + return; + } + + if(voice < 0 || voice >= 16) + { + return; + } + + SoundDecoder * decoder = SoundHandler::Instance()->Decoder(voice); + if(!decoder) + { + return; + } + + ASND_StopVoice(voice); + if(decoder->IsEOF()) + { + decoder->ClearBuffer(); + decoder->Rewind(); + decoder->Decode(); + } + + u8 * curbuffer = decoder->GetBuffer(); + int bufsize = decoder->GetBufferSize(); + decoder->LoadNext(); + SoundHandler::Instance()->ThreadSignal(); + + ASND_SetVoice(voice, decoder->GetFormat(), decoder->GetSampleRate(), 0, curbuffer, bufsize, vol, vol, SoundCallback); +} + +void GuiSound::Play() +{ + Play(volume); +} + +void GuiSound::Stop() +{ + if (!IsPlaying()) return; + + if(voice < 0 || voice >= 16) + return; + + ASND_StopVoice(voice); + + SoundDecoder * decoder = SoundHandler::Instance()->Decoder(voice); + if(!decoder) + { + return; + } + + decoder->ClearBuffer(); + Rewind(); + + SoundHandler::Instance()->ThreadSignal(); +} + +void GuiSound::Pause() +{ + if(voice < 0 || voice >= 16) + return; + + ASND_StopVoice(voice); +} + +void GuiSound::Resume() +{ + Play(); +} + +bool GuiSound::IsPlaying() +{ + if(voice < 0 || voice >= 16) + return false; + + int result = ASND_StatusVoice(voice); + + if(result == SND_WORKING || result == SND_WAITING) + return true; + + return false; +} + +int GuiSound::GetVolume() +{ + return volume; +} + +void GuiSound::SetVolume(int vol) +{ + if(voice < 0 || voice >= 16) + return; + + if(vol < 0) + return; + + volume = vol; + ASND_ChangeVolumeVoice(voice, volume, volume); +} + +void GuiSound::SetLoop(u8 l) +{ + loop = l; + + SoundDecoder * decoder = SoundHandler::Instance()->Decoder(voice); + if(!decoder) + return; + + decoder->SetLoop(l == 1); +} + +void GuiSound::Rewind() +{ + SoundDecoder * decoder = SoundHandler::Instance()->Decoder(voice); + if(!decoder) + return; + + decoder->Rewind(); +} + +struct _LZ77Info +{ + u16 length : 4; + u16 offset : 12; +} __attribute__((packed)); + +typedef struct _LZ77Info LZ77Info; + +u8 * uncompressLZ77(const u8 *inBuf, u32 inLength, u32 * size) +{ + u8 *buffer = NULL; + if (inLength <= 0x8 || *((const u32 *)inBuf) != 0x4C5A3737 /*"LZ77"*/ || inBuf[4] != 0x10) + return NULL; + + u32 uncSize = le32(((const u32 *)inBuf)[1] << 8); + if(uncSize <= 0) return 0; + + const u8 *inBufEnd = inBuf + inLength; + inBuf += 8; + + buffer = (u8 *) malloc(uncSize); + + if (!buffer) + return buffer; + + u8 *bufCur = buffer; + u8 *bufEnd = buffer + uncSize; + + while (bufCur < bufEnd && inBuf < inBufEnd) + { + u8 flags = *inBuf; + ++inBuf; + int i = 0; + for (i = 0; i < 8 && bufCur < bufEnd && inBuf < inBufEnd; ++i) + { + if ((flags & 0x80) != 0) + { + const LZ77Info * info = (const LZ77Info *)inBuf; + inBuf += sizeof (LZ77Info); + int length = info->length + 3; + if (bufCur - info->offset - 1 < buffer || bufCur + length > bufEnd) + return buffer; + memcpy(bufCur, bufCur - info->offset - 1, length); + bufCur += length; + } + else + { + *bufCur = *inBuf; + ++inBuf; + ++bufCur; + } + flags <<= 1; + } + } + + *size = uncSize; + + return buffer; +} + +void GuiSound::UncompressSoundbin(const u8 * snd, u32 len, bool isallocated) +{ + const u8 * file = snd+32; + + length = len-32; + if (length <= 0) return; + + if(*((u32 *) file) == 'LZ77') + { + u32 size = 0; + sound = uncompressLZ77(file, length, &size); + if (!sound) + { + length = 0; + return; + } + length = size; + } + else + { + sound = (u8 *) malloc(length); + if (!sound) + { + length = 0; + return; + } + memcpy(sound, file, length); + } + + if(isallocated) + { + void *p = (void *) snd; + SAFE_FREE(p); + } + + allocated = true; +} + +void soundInit(void) +{ + ASND_Init(); + ASND_Pause(0); +} + +void soundDeinit(void) +{ + ASND_Pause(1); + ASND_End(); +} diff --git a/source/music/gui_sound.h b/source/music/gui_sound.h new file mode 100644 index 00000000..67a0a2c4 --- /dev/null +++ b/source/music/gui_sound.h @@ -0,0 +1,105 @@ +/*************************************************************************** + * Copyright (C) 2010 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * for WiiXplorer 2010 + ***************************************************************************/ +#ifndef GUI_SOUND_H_ +#define GUI_SOUND_H_ + +#include +#include + +//!Sound conversion and playback. A wrapper for other sound libraries - ASND, libmad, ltremor, etc +class GuiSound +{ + public: + //!Constructor + GuiSound(); + //!Copy Constructor + GuiSound(GuiSound *g); + //!Constructor + //!\param sound Pointer to the sound data + //!\param filesize Length of sound data + GuiSound(std::string filepath, int voice = -1); + GuiSound(const u8 * snd, u32 len, std::string name, bool allocated = false, int voice = -1); + + //!Destructor + ~GuiSound(); + //!Load a file and replace the old one + bool Load(const char * filepath); + //!Load a file and replace the old one + bool Load(const u8 * snd, u32 len, bool allocated = true); + //!For quick playback of the internal soundeffects + bool LoadSoundEffect(const u8 * snd, u32 len); + //!Start sound playback + void Play(); + //!Start sound playback + void Play(int vol, bool restart = false); + //!Stop sound playback + void Stop(); + //!Pause sound playback + void Pause(); + //!Resume sound playback + void Resume(); + //!Checks if a sound is currently loaded + //!\return true if sound is loaded, false otherwise + bool IsLoaded() { return sound != NULL; }; + //!Get the filepath for finding sounds which already have an instance. + //!\return the current instance's filepath + std::string GetName() { return filepath; }; + //!Checks if the sound is currently playing + //!\return true if sound is playing, false otherwise + bool IsPlaying(); + //!Rewind the music + void Rewind(); + //!Get sound volume + //!\returns the current sound volume + int GetVolume(); + //!Set sound volume + //!\param v Sound volume (0-100) + void SetVolume(int v); + //!\param l Loop (true to loop) + void SetLoop(u8 l); + private: + //!Initializes the GuiSound object by setting the default values + void Init(); + //!Special sound case for sound.bin + void UncompressSoundbin(const u8 * snd, u32 len, bool isallocated); + protected: + //!Stops sound and frees all memory/closes files + void FreeMemory(); + + std::string filepath; + u8 * sound; //!< Pointer to the sound data + u32 length; //!< Length of sound data + s32 voice; //!< Currently assigned ASND voice channel + int volume; //!< Sound volume (0-100) + u8 loop; //!< Loop sound playback + u32 SoundEffectLength; //!< Check if it is an app soundeffect for faster playback + bool allocated; //!< Is the file allocated or not +}; + +void soundInit(void); +void soundDeinit(void); + +#endif diff --git a/source/music/musicplayer.cpp b/source/music/musicplayer.cpp new file mode 100644 index 00000000..37dbc9bd --- /dev/null +++ b/source/music/musicplayer.cpp @@ -0,0 +1,167 @@ +#include "musicplayer.h" + +using namespace std; + +MusicPlayer *MusicPlayer::instance = NULL; + +MusicPlayer *MusicPlayer::Instance() +{ + if (instance == NULL) + instance = new MusicPlayer(); + + return instance; +} + +void MusicPlayer::DestroyInstance() +{ + if (instance != NULL) + delete instance; + + instance = NULL; +} + +void MusicPlayer::Init(Config &cfg, string musicDir, string themeMusicDir) +{ + m_music = NULL; + m_manual_stop = true; + m_stopped = true; + m_fade_rate = cfg.getInt("GENERAL", "music_fade_rate", 8); + m_music_volume = cfg.getInt("GENERAL", "sound_volume_music", 255); + + SetVolume(0); // Fades in with tick() + + MusicDirectory dir = (MusicDirectory) cfg.getInt("GENERAL", "music_directories", NORMAL_MUSIC | THEME_MUSIC); + m_music_files.Init(cfg.getString("GENERAL", "dir_list_cache"), std::string(), std::string()); + + if (dir & THEME_MUSIC) + m_music_files.Load(themeMusicDir, ".ogg|.mp3"); //|.mod|.xm|.s3m|.wav|.aiff"); + + if (dir & NORMAL_MUSIC) + m_music_files.Load(musicDir, ".ogg|.mp3"); //|.mod|.xm|.s3m|.wav|.aiff"); + + if (cfg.getBool("GENERAL", "randomize_music", false) && m_music_files.size() > 0) + { + srand(unsigned(time(NULL))); + random_shuffle(m_music_files.begin(), m_music_files.end()); + } + + m_current_music = m_music_files.begin(); +} + +MusicPlayer::~MusicPlayer() +{ + if (m_music != NULL) + { + m_music->Stop(); + delete m_music; + } +} + +void MusicPlayer::SetVolume(int volume) +{ + m_music_current_volume = volume > m_music_volume ? m_music_volume : volume; + if (m_music != NULL) + m_music->SetVolume(m_music_current_volume); +} + +void MusicPlayer::SetVolume(int volume, int max_volume) +{ + m_music_volume = max_volume; + SetVolume(volume); +} + +void MusicPlayer::Previous() +{ + if (m_music_files.empty()) return; + + if (m_current_music == m_music_files.begin()) + m_current_music = m_music_files.end(); + + m_current_music--; + + LoadCurrentFile(); +} + +void MusicPlayer::Next() +{ + if (m_music_files.empty()) return; + + m_current_music++; + if (m_current_music == m_music_files.end()) + m_current_music = m_music_files.begin(); + + LoadCurrentFile(); +} + +void MusicPlayer::Pause() +{ + if (m_music != NULL) + m_music->Pause(); + + m_paused = true; +} + +void MusicPlayer::Play() +{ + m_manual_stop = m_paused = false; // Next tick will start the music + if (m_music != NULL) + m_music->SetVolume(m_music_current_volume); +} + +void MusicPlayer::Stop() +{ + m_manual_stop = true; + if (m_music != NULL) + { + m_music->Pause(); + m_music->Stop(); + delete m_music; + m_music = NULL; + } + m_stopped = true; +} + +void MusicPlayer::Tick(bool attenuate) +{ + if (m_music_files.empty()) return; + if (m_music_current_volume == 0 && attenuate) return; + + if (m_music != NULL) + { + if (!attenuate && m_music_current_volume < m_music_volume) + { + int volume = m_music_current_volume + m_fade_rate > m_music_volume ? + m_music_volume : m_music_current_volume + m_fade_rate; + SetVolume(volume); + } + else if (attenuate && m_music_current_volume > 0) + { + int volume = m_music_current_volume - m_fade_rate < 0 ? + 0 : m_music_current_volume - m_fade_rate; + SetVolume(volume); + } + } + + if (!attenuate && !m_manual_stop && (m_music == NULL || m_stopped || !m_music->IsPlaying())) + Next(); +} + +void MusicPlayer::LoadCurrentFile() +{ + if (m_music_files.empty()) return; + + if (m_music != NULL) + m_music->Stop(); + + if (m_music == NULL) + m_music = new GuiSound((*m_current_music).c_str(), ASND_MUSIC_VOICE); + else + m_music->Load((*m_current_music).c_str()); + + if (m_music != NULL && !m_manual_stop) + { + m_music->SetVolume(m_music_current_volume); + m_music->Play(); + m_stopped = false; + } +} diff --git a/source/music/musicplayer.h b/source/music/musicplayer.h new file mode 100644 index 00000000..7e15ad37 --- /dev/null +++ b/source/music/musicplayer.h @@ -0,0 +1,63 @@ +#ifndef _MUSICPLAYER_H +#define _MUSICPLAYER_H + +#include +#include "config/config.hpp" + +#include "cachedlist.hpp" +#include "gui_sound.h" + +enum MusicDirectory +{ + NORMAL_MUSIC = 1, + THEME_MUSIC = 2 +}; + +#define ASND_MUSIC_VOICE 0 + +class MusicPlayer +{ +public: + static MusicPlayer *Instance(); + static void DestroyInstance(); + + void Init(Config &cfg, std::string musicDir, std::string themeMusicDir); + void Tick(bool attenuate); + + void SetVolume(int volume); + void SetVolume(int volume, int max_volume); + int GetVolume() { return m_music != NULL ? m_music_current_volume : 0; }; + int GetMaxVolume() { return m_music_volume; }; + + void Previous(); + void Next(); + void Pause(); + void Play(); + void Stop(); + + bool IsStopped() { return m_stopped; }; +private: + ~MusicPlayer(); + + static MusicPlayer *instance; + + void LoadCurrentFile(); + + CachedList m_music_files; + safe_vector::iterator m_current_music; + + int m_fade_rate; + + int m_music_volume; + int m_music_current_volume; + bool m_manual_stop; + + bool m_paused; + bool m_stopped; + bool m_playbackFinished; + + GuiSound *m_music; + u32 *m_songCount; +}; + +#endif \ No newline at end of file diff --git a/source/network/dns.c b/source/network/dns.c new file mode 100644 index 00000000..8e10c584 --- /dev/null +++ b/source/network/dns.c @@ -0,0 +1,119 @@ +#include "dns.h" +#include "utils.h" + +/** + * Resolves a domainname to an ip address + * It makes use of net_gethostbyname from libogc, which in turn makes use of a Wii BIOS function + * Just like the net_gethostbyname function this function is NOT threadsafe! + * + * @param char* The domain name to resolve + * @return u32 The ipaddress represented by four bytes inside an u32 (in network order) + */ +u32 getipbyname(char *domain) +{ + //Care should be taken when using net_gethostbyname, + //it returns a static buffer which makes it not threadsafe + //TODO: implement some locking mechanism to make below code atomic + struct hostent *host = net_gethostbyname(domain); + + if(host == NULL) return 0; + + u32 *ip = (u32*)host->h_addr_list[0]; + return *ip; +} + + + +//Defines how many DNS entries should be cached by getipbynamecached() +#define MAX_DNS_CACHE_ENTRIES 20 + +//The cache is defined as a linked list, +//The last resolved domain name will always be at the front +//This will allow heavily used domainnames to always stay cached +struct dnsentry { + char *domain; + u32 ip; + struct dnsentry *nextnode; +} ; + +static struct dnsentry *firstdnsentry = NULL; +static int dnsentrycount = 0; + +/** + * Performs the same function as getipbyname(), + * except that it will prevent extremely expensive net_gethostbyname() calls by caching the result + */ +u32 getipbynamecached(char *domain) +{ + //Search if this domainname is already cached + struct dnsentry *node = firstdnsentry; + struct dnsentry *previousnode = NULL; + + while(node != NULL) + { + if(strcmp(node->domain, domain) == 0) + { + //DNS node found in the cache, move it to the front of the list + if(previousnode != NULL) + previousnode->nextnode = node->nextnode; + + if(node != firstdnsentry) + node->nextnode = firstdnsentry; + firstdnsentry = node; + + return node->ip; + } + //Go to the next element in the list + previousnode = node; + node = node->nextnode; + } + u32 ip = getipbyname(domain); + + //No cache of this domain could be found, create a cache node and add it to the front of the cache + struct dnsentry *newnode = malloc(sizeof(struct dnsentry)); + if(newnode == NULL) return ip; + + newnode->ip = ip; + newnode->domain = malloc(strlen(domain)+1); + if(newnode->domain == NULL) + { + SAFE_FREE(newnode); + return ip; + } + strcpy(newnode->domain, domain); + + newnode->nextnode = firstdnsentry; + firstdnsentry = newnode; + dnsentrycount++; + + //If the cache grows too big delete the last (and probably least important) node of the list + if(dnsentrycount > MAX_DNS_CACHE_ENTRIES) + { + struct dnsentry *node = firstdnsentry; + struct dnsentry *previousnode = NULL; + + //Fetch the last two elements of the list + while(node->nextnode != NULL) + { + previousnode = node; + node = node->nextnode; + } + + if(node == NULL) + { + printf("Configuration error, MAX_DNS_ENTRIES reached while the list is empty\n"); + exit(1); + } else if(previousnode == NULL) + { + firstdnsentry = NULL; + } else { + previousnode->nextnode = NULL; + } + + SAFE_FREE(node->domain); + SAFE_FREE(node); + dnsentrycount--; + } + + return newnode->ip; +} diff --git a/source/network/dns.h b/source/network/dns.h new file mode 100644 index 00000000..9dc7679f --- /dev/null +++ b/source/network/dns.h @@ -0,0 +1,14 @@ +#ifndef _DNS_H_ +#define _DNS_H_ + +#include +#include +#include +#include + +#include //usleep + +u32 getipbyname(char *domain); +u32 getipbynamecached(char *domain); + +#endif /* _DNS_H_ */ diff --git a/source/network/gcard.c b/source/network/gcard.c new file mode 100644 index 00000000..2dabb2c1 --- /dev/null +++ b/source/network/gcard.c @@ -0,0 +1,66 @@ +#include "gcard.h" +#include "http.h" +#include "utils.h" + +#include +#include + +#define MAX_URL_SIZE 178 // 128 + 48 + 6 + +struct provider +{ + char url[128]; + char key[48]; +}; + +struct provider *providers = NULL; +int amount_of_providers = 0; + +u8 register_card_provider(const char *url, const char *key) +{ + struct provider *new_providers = (struct provider *) realloc(providers, (amount_of_providers + 1) * sizeof(struct provider)); + if (new_providers != NULL) + { + providers = new_providers; + memset(&providers[amount_of_providers], 0, sizeof(struct provider)); + strncpy((char *) providers[amount_of_providers].url, url, 128); + strncpy((char *) providers[amount_of_providers].key, key, 48); + amount_of_providers++; + return 0; + } + return -1; +} + +u8 has_enabled_providers() +{ + int i; + for (i = 0; i < amount_of_providers && providers != NULL; i++) + { + if (strlen(providers[i].url) > 0 && strlen(providers[i].key) > 0) + { + return 1; + } + } + return 0; +} + +void add_game_to_card(const char *gameid) +{ + int i; + + char *url = (char *) malloc(MAX_URL_SIZE); // Too much memory, but only like 10 bytes + memset(url, 0, sizeof(url)); + + for (i = 0; i < amount_of_providers && providers != NULL; i++) + { + if (strlen(providers[i].url) > 0 && strlen(providers[i].key) > 0) + { + strcpy(url, (char *) providers[i].url); + str_replace(url, (char *) "{KEY}", (char *) providers[i].key, MAX_URL_SIZE); + str_replace(url, (char *) "{ID6}", (char *) gameid, MAX_URL_SIZE); + + downloadfile(NULL, 0, (char *) url, NULL, NULL); + } + } + SAFE_FREE(url); +} \ No newline at end of file diff --git a/source/network/gcard.h b/source/network/gcard.h new file mode 100644 index 00000000..bd1e4d36 --- /dev/null +++ b/source/network/gcard.h @@ -0,0 +1,18 @@ +#ifndef _GCARD_H_ +#define _GCARD_H_ + +#include + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + +u8 register_card_provider(const char *url, const char *key); +u8 has_enabled_providers(); +void add_game_to_card(const char *gameid); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif //_GCARD_H_ \ No newline at end of file diff --git a/source/network/http.c b/source/network/http.c new file mode 100644 index 00000000..a9c765a4 --- /dev/null +++ b/source/network/http.c @@ -0,0 +1,225 @@ +#include "http.h" +#include "gecko.h" +#include +#include +#include +#include +/** + * Emptyblock is a statically defined variable for functions to return if they are unable + * to complete a request + */ +const struct block emptyblock = {0, NULL}; +#define NET_BUFFER_SIZE 1024 //The maximum amount of bytes to send per net_write() call +#define TCP_TIMEOUT 4000 // 4 secs to receive + +// Write our message to the server +static s32 send_message(s32 server, char *msg) +{ + s32 bytes_transferred = 0, remaining = strlen(msg); + s64 t = gettime(); + while (remaining) + { + if((bytes_transferred = net_write(server, msg, remaining > NET_BUFFER_SIZE ? NET_BUFFER_SIZE : remaining)) > 0) + { + remaining -= bytes_transferred; + usleep (20 * 1000); + t = gettime(); + } + else if(bytes_transferred < 0) return bytes_transferred; + + if(ticks_to_millisecs(diff_ticks(t, gettime())) > TCP_TIMEOUT) + break; + } + return 0; +} + +/** + * Connect to a remote server via TCP on a specified port + * + * @param u32 ip address of the server to connect to + * @param u32 the port to connect to on the server + * @return s32 The connection to the server (negative number if connection could not be established) + */ +static s32 server_connect(u32 ipaddress, u32 socket_port) +{ + //Initialize socket + s32 connection = net_socket(AF_INET, SOCK_STREAM, IPPROTO_IP); + if(connection < 0) return connection; + + //Set the connection parameters for the socket + struct sockaddr_in connect_addr; + memset(&connect_addr, 0, sizeof(connect_addr)); + connect_addr.sin_family = AF_INET; + connect_addr.sin_port = socket_port; + connect_addr.sin_addr.s_addr= ipaddress; + + //Attemt to open a connection on the socket + if(net_connect(connection, (struct sockaddr*)&connect_addr, sizeof(connect_addr)) < 0) + net_close(connection); + + return connection; +} + +//The amount of memory in bytes reserved initially to store the HTTP response in +//Be careful in increasing this number, reading from a socket on the Wii +#define HTTP_BUFFER_GROWTH 1024 * 5 + +/** + * This function reads all the data from a connection into a buffer which it returns. + * It will return an empty buffer if something doesn't go as planned + * + * @param s32 connection The connection identifier to suck the response out of + * @return block A 'block' struct (see http.h) in which the buffer is located + */ +static struct block read_message(s32 connection, struct block buffer, bool (*f)(void *, int, int), void *ud) +{ + static char tmpHdr[512]; + bool hdr = false, fail = true; + u32 fileSize = 0, step = 0, offset = 0; + s64 t = gettime(); + + //The offset variable always points to the first byte of memory that is free in the buffer + while (true) + { + if(ticks_to_millisecs(diff_ticks(t, gettime())) > TCP_TIMEOUT || buffer.size <= offset) + break; + + //Fill the buffer with a new batch of bytes from the connection, + //starting from where we left of in the buffer till the end of the buffer + u32 len = buffer.size - offset; + s32 bytes_read = net_read(connection, buffer.data + offset, len > HTTP_BUFFER_GROWTH ? HTTP_BUFFER_GROWTH : len); + //Anything below 0 is an error in the connection + if(bytes_read > 0) + { + t = gettime (); + + offset += bytes_read; + // Not enough memory + if(buffer.size <= offset) return emptyblock; + if(!hdr && offset >= sizeof tmpHdr) + { + hdr = true; + memcpy(tmpHdr, buffer.data, sizeof tmpHdr - 1); + tmpHdr[sizeof tmpHdr - 1] = 0; + const char *p = strstr(tmpHdr, "Content-Length:"); + if(p != 0) + { + p += sizeof "Content-Length:"; + fileSize = strtol(p, 0, 10); + } + } + if(step * HTTP_BUFFER_GROWTH < offset) + { + ++step; + if(f != 0) + { + if((fileSize != 0 && !f(ud, fileSize, offset <= fileSize ? offset : fileSize)) || + (fileSize == 0 && !f(ud, buffer.size, offset))) + return emptyblock; + } + } + fail = false; + } + else + { + if(bytes_read < 0) fail = true; + break; // Need to translate the error messages here instead of just breaking. + } + } + if(fail) return emptyblock; + //At the end of above loop offset should be precisely the amount of bytes that were read from the connection + buffer.size = offset; + return buffer; +} + +/* Downloads the contents of a URL to memory + * This method is not threadsafe (because networking is not threadsafe on the Wii) */ +struct block downloadfile(u8 *buffer, u32 bufferSize, const char *url, bool (*f)(void *, int, int), void *ud) +{ + //Check if the url starts with "http://", if not it is not considered a valid url + if(strncmp(url, "http://", strlen("http://")) != 0) return emptyblock; + + //Locate the path part of the url by searching for '/' past "http://" + char *path = strchr(url + strlen("http://"), '/'); + if(path == NULL) return emptyblock; + + //Extract the domain part out of the url + int domainlength = path - url - strlen("http://"); + if(domainlength == 0) return emptyblock; + + char domain[domainlength + 1]; + strncpy(domain, url + strlen("http://"), domainlength); + domain[domainlength] = '\0'; + + //Parsing of the URL is done, start making an actual connection + u32 ipaddress = getipbynamecached(domain); + if(ipaddress == 0) return emptyblock; + + s32 connection = server_connect(ipaddress, 80); + if(connection < 0) return emptyblock; + + //Form a nice request header to send to the webserver + char* headerformat = "GET %s HTTP/1.0\r\nHost: %s\r\nUser-Agent: WiiFlow 2.1\r\n\r\n";; + char header[strlen(headerformat) + strlen(domain) + strlen(path)]; + sprintf(header, headerformat, path, domain); + + //Do the request and get the response + send_message(connection, header); + if (bufferSize == 0) return emptyblock; + struct block buf; + buf.data = buffer; + buf.size = bufferSize; + struct block response = read_message(connection, buf, f, ud); + net_close(connection); + + //Search for the 4-character sequence \r\n\r\n in the response which signals the start of the http payload (file) + unsigned char *filestart = NULL; + u32 filesize = 0; + u32 i; + for(i = 3; i < response.size; i++) + { + if(response.data[i] == '\n' && + response.data[i-1] == '\r' && + response.data[i-2] == '\n' && + response.data[i-3] == '\r') + { + filestart = response.data + i + 1; + filesize = response.size - i - 1; + break; + } + } + + if(response.size == 0 || response.data == NULL) return emptyblock; + + // Check for the headers + char httpCode[3]; + memcpy(httpCode, &response.data[9], 3); + int retCode = atoi(httpCode); + + switch(retCode) + { + case 301: + case 302: + case 307: // Moved +/* + { + char redirectedTo[255]; + if(findHeader((char *) response.data, (filestart - response.data), "Location", redirectedTo, 255) == 0) { + return downloadfile(buffer, bufferSize, (char *) redirectedTo, f, ud); + } + return emptyblock; + break; + } +*/ + case 404: // Error, file not found! + return emptyblock; + } + + if(filestart == NULL) return emptyblock; + + //Copy the file part of the response into a new memoryblock to return + struct block file; + file.data = filestart; + file.size = filesize; + return file; +} diff --git a/source/network/http.h b/source/network/http.h new file mode 100644 index 00000000..c81a7b63 --- /dev/null +++ b/source/network/http.h @@ -0,0 +1,33 @@ +#ifndef _HTTP_H_ +#define _HTTP_H_ + +#include +#include +#include +#include + +#include "dns.h" + +#ifdef __cplusplus +extern "C" { +#endif /* __cplusplus */ + + +/** + * A simple structure to keep track of the size of a malloc()ated block of memory + */ +struct block +{ + u32 size; + unsigned char *data; +}; + +extern const struct block emptyblock; + +struct block downloadfile(u8 *buffer, u32 bufferSize, const char *url, bool (*f)(void *, int, int), void *ud); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif /* _HTTP_H_ */ diff --git a/source/safe_vector.hpp b/source/safe_vector.hpp new file mode 100644 index 00000000..a220793e --- /dev/null +++ b/source/safe_vector.hpp @@ -0,0 +1,96 @@ +/*****************************************| +|-----vector class wrapper by Miigotu-----| +|---Thx to dimok and r-win for guidance---| +|*****************************************/ + +#ifndef SAFE_VECTOR +#define SAFE_VECTOR + +#include +#include + +template +class safe_vector +{ + public: + typedef size_t size_type; + typedef typename std::vector::iterator iterator; + typedef typename std::vector::const_iterator const_iterator; + typedef typename std::vector::reference reference; + typedef typename std::vector::const_reference const_reference; + + safe_vector(){}; + safe_vector(size_type n){thevector.resize(n);} + ~safe_vector(){clear();}; + + void clear() + { + thevector.clear(); + std::vector().swap(thevector); + } + + void push_back(const T& x) + { + if(thevector.size() * sizeof(T) == thevector.capacity() && thevector.capacity() < thevector.max_size() - 20) + thevector.reserve(thevector.size() + 20); + thevector.push_back(x); + } + + void resize(size_type sz, T c = T()) + { + thevector.resize(sz, c); + realloc(sz); + } + + size_type size() const { return thevector.size(); } + + void reserve(size_type n) {thevector.reserve(n);} + + size_type capacity() const {return thevector.capacity();} + + bool empty() const {return thevector.empty();} + + reference operator[](size_type n) {return thevector[n];} + const_reference operator[](size_type n) const {return thevector[n];} + + iterator erase(iterator position) {return thevector.erase(position);} + iterator erase(iterator first, iterator last) {return thevector.erase(first, last);} + + iterator begin() {return thevector.begin();} + const_iterator begin() const {return thevector.begin();} + + iterator end() {return thevector.end();} + const_iterator end() const {return thevector.end();} + + const_reference at (size_type n) const {return thevector.at(n);} + reference at (size_type n) {return thevector.at(n);} + + reference back() {return thevector.back();} + const_reference back() const {return thevector.back();} + + void realloc(size_type sz) + { + if(thevector.size() * sizeof(T) < thevector.capacity() || sz * sizeof(T) < thevector.capacity() || sz < thevector.size()) + { + iterator itr; + + std::vector newvector; + newvector.reserve(sz); + for (itr = thevector.begin(); newvector.size() < sz && itr < thevector.end(); itr++) + newvector.push_back(*itr); + + clear(); + + thevector.reserve(sz); + for (itr = newvector.begin(); thevector.size() < sz && itr < newvector.end(); itr++) + thevector.push_back(*itr); + + newvector.clear(); + std::vector().swap(newvector); + } + } + private: + std::vector thevector; +}; + +#endif /*- SAFE_VECTOR -*/ \ No newline at end of file diff --git a/source/svnrev.h b/source/svnrev.h new file mode 100644 index 00000000..a812cc05 --- /dev/null +++ b/source/svnrev.h @@ -0,0 +1 @@ +#define SVN_REV "417" diff --git a/source/unzip/U8Archive.c b/source/unzip/U8Archive.c new file mode 100644 index 00000000..36a7932c --- /dev/null +++ b/source/unzip/U8Archive.c @@ -0,0 +1,75 @@ +/*************************************************************************** + * Copyright (C) 2011 + * by r-win + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * U8Archive.c + * + * for Wiiflow 2011 + ***************************************************************************/ + +#include +#include "U8Archive.h" + +static char *u8Filename(const struct U8Entry *fst, int i) +{ + return (char *)(fst + fst[0].numEntries) + fst[i].nameOffset; +} + +static struct U8Header *open_u8_archive(const u8 *u8_archive) +{ + struct U8Header *arcHdr = (struct U8Header *)u8_archive; + if (arcHdr->fcc != 0x55AA382D) + { + return NULL; + } + return arcHdr; +} + +const u8 *u8_get_file_by_index(const u8 *archive, u32 index, u32 *size) +{ + struct U8Header *arcHdr = open_u8_archive(archive); + if (arcHdr == NULL) return NULL; + + const struct U8Entry *fst = (const struct U8Entry *)(archive + arcHdr->rootNodeOffset); + if (index < 1 || index >= fst[0].numEntries) return NULL; + if (fst[index].fileType != 0) return NULL; // Not a file, but a directory entry + + *size = fst[index].fileLength; + return archive + fst[index].fileOffset; +} + +const u8 *u8_get_file(const u8 *archive, const char *filename, u32 *size) +{ + u32 i = 0; + struct U8Header *arcHdr = open_u8_archive(archive); + if (arcHdr == NULL) return NULL; + + const struct U8Entry *fst = (const struct U8Entry *)(archive + arcHdr->rootNodeOffset); + for (i = 1; i < fst[0].numEntries; ++i) + if (fst[i].fileType == 0 && strcasecmp(u8Filename(fst, i), filename) == 0) + break; + if (i >= fst[0].numEntries) + return NULL; + + *size = fst[i].fileLength; + return archive + fst[i].fileOffset; +} \ No newline at end of file diff --git a/source/unzip/U8Archive.h b/source/unzip/U8Archive.h new file mode 100644 index 00000000..58c9a604 --- /dev/null +++ b/source/unzip/U8Archive.h @@ -0,0 +1,69 @@ +/*************************************************************************** + * Copyright (C) 2011 + * by r-win + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * U8Archive.c + * + * for Wiiflow 2011 + ***************************************************************************/ + +#ifndef _U8ARCHIVE_H_ +#define _U8ARCHIVE_H_ + +#include + +struct U8Header +{ + u32 fcc; + u32 rootNodeOffset; + u32 headerSize; + u32 dataOffset; + u8 zeroes[16]; +} __attribute__((packed)); + +struct U8Entry +{ + struct + { + u32 fileType : 8; + u32 nameOffset : 24; + }; + u32 fileOffset; + union + { + u32 fileLength; + u32 numEntries; + }; +} __attribute__((packed)); + +#ifdef __cplusplus +extern "C" { +#endif + +const u8 *u8_get_file_by_index(const u8 *archive, u32 index, u32 *size); +const u8 *u8_get_file(const u8 *archive, const char *filename, u32 *size); + +#ifdef __cplusplus +} +#endif + +#endif \ No newline at end of file diff --git a/source/unzip/ZipFile.cpp b/source/unzip/ZipFile.cpp new file mode 100644 index 00000000..9c8abc55 --- /dev/null +++ b/source/unzip/ZipFile.cpp @@ -0,0 +1,178 @@ +/**************************************************************************** + * Copyright (C) 2009 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * ZipFile.cpp + * + * ZipFile Class + * for Wii-FileXplorer 2009 + * + * STILL UNCOMPLETE AND UNDER CONSTRUCTION + ***************************************************************************/ +#include +#include +#include +#include +#include + +#include "ZipFile.h" +#include "miniunz.h" + +ZipFile::ZipFile(const char *filepath) +{ + File = unzOpen(filepath); + if (File) this->LoadList(); +} + +ZipFile::~ZipFile() +{ + unzClose(File); +} + +bool ZipFile::LoadList() +{ + return true; +} +/* +bool ZipFile::FindFile(const char *file) +{ + if (!File) return false; + + char filename[MAXPATHLEN]; + + int ret = unzGoToFirstFile(File); + if (ret != UNZ_OK) return false; + + do + { + if(unzGetCurrentFileInfo(File, &cur_file_info, filename, sizeof(filename), NULL, 0, NULL, 0) != UNZ_OK) + continue; + + const char *realfilename = strrchr(filename, '/'); + if(!realfilename || strlen(realfilename) == 0) + realfilename = filename; + + if(strcasecmp(realfilename, file) == 0) + return true; + } + while(unzGoToNextFile(File) == UNZ_OK); + + return false; +} + +bool ZipFile::FindFilePart(const char *partfilename, std::string &realname) +{ + if (!File) return false; + + char filename[MAXPATHLEN]; + + int ret = unzGoToFirstFile(File); + if (ret != UNZ_OK) return false; + + do + { + if(unzGetCurrentFileInfo(File, &cur_file_info, filename, sizeof(filename), NULL, 0, NULL, 0) != UNZ_OK) + continue; + + if(strcasestr(filename, partfilename) != 0) + { + realname = filename; + return true; + } + } + while(unzGoToNextFile(File) == UNZ_OK); + + return false; +} +*/ +bool ZipFile::ExtractAll(const char *dest) +{ + if (!File) return false; + + bool Stop = false; + + u32 blocksize = 1024 * 50; + u8 *buffer = new u8[blocksize]; + + if (!buffer) return false; + + char writepath[MAXPATHLEN]; + char filename[MAXPATHLEN]; + memset(filename, 0, sizeof(filename)); + + int ret = unzGoToFirstFile(File); + if (ret != UNZ_OK) Stop = true; + + while (!Stop) + { + if (unzGetCurrentFileInfo(File, &cur_file_info, filename, sizeof(filename), NULL, 0, NULL, 0) != UNZ_OK) + Stop = true; + + if (!Stop && filename[strlen(filename) - 1] != '/') + { + u32 uncompressed_size = cur_file_info.uncompressed_size; + + u32 done = 0; + char *pointer = NULL; + + ret = unzOpenCurrentFile(File); + + snprintf(writepath, sizeof(writepath), "%s/%s", dest, filename); + + pointer = strrchr(writepath, '/'); + int position = pointer - writepath + 2; + + char temppath[strlen(writepath)]; + snprintf(temppath, position, "%s", writepath); + + makedir(temppath); + + if (ret == UNZ_OK) + { + FILE *pfile = fopen(writepath, "wb"); + + do + { + if (uncompressed_size - done < blocksize) blocksize = uncompressed_size - done; + + ret = unzReadCurrentFile(File, buffer, blocksize); + + if (ret == 0) break; + + fwrite(buffer, 1, blocksize, pfile); + + done += ret; + + } while (done < uncompressed_size); + + fclose(pfile); + unzCloseCurrentFile(File); + } + } + if (unzGoToNextFile(File) != UNZ_OK) Stop = true; + } + + delete[] buffer; + buffer = NULL; + + return true; +} diff --git a/source/unzip/ZipFile.h b/source/unzip/ZipFile.h new file mode 100644 index 00000000..3c89da8c --- /dev/null +++ b/source/unzip/ZipFile.h @@ -0,0 +1,58 @@ +/*************************************************************************** + * Copyright (C) 2009 + * by Dimok + * + * This software is provided 'as-is', without any express or implied + * warranty. In no event will the authors be held liable for any + * damages arising from the use of this software. + * + * Permission is granted to anyone to use this software for any + * purpose, including commercial applications, and to alter it and + * redistribute it freely, subject to the following restrictions: + * + * 1. The origin of this software must not be misrepresented; you + * must not claim that you wrote the original software. If you use + * this software in a product, an acknowledgment in the product + * documentation would be appreciated but is not required. + * + * 2. Altered source versions must be plainly marked as such, and + * must not be misrepresented as being the original software. + * + * 3. This notice may not be removed or altered from any source + * distribution. + * + * ZipFile.cpp + * + * for Wii-FileXplorer 2009 + ***************************************************************************/ +#ifndef _ZIPFILE_H_ +#define _ZIPFILE_H_ + +#include "unzip.h" + +typedef struct +{ + u64 offset; // ZipFile offset + u64 length; // uncompressed file length in 64 bytes for sizes higher than 4GB + bool isdir; // 0 - file, 1 - directory + char filename[256]; // full filename +} FileStructure; + +class ZipFile +{ + public: + //!Constructor + ZipFile(const char *filepath); + //!Destructor + ~ZipFile(); + //!Extract all files from a zip file to a directory + //!\param dest Destination path to where to extract + bool ExtractAll(const char *dest); + protected: + bool LoadList(); + unzFile File; + unz_file_info cur_file_info; + FileStructure *FileList; +}; + +#endif diff --git a/source/unzip/crypt.h b/source/unzip/crypt.h new file mode 100644 index 00000000..4c6f4429 --- /dev/null +++ b/source/unzip/crypt.h @@ -0,0 +1,126 @@ +/* crypt.h -- base code for crypt/uncrypt ZIPfile + + + Version 1.01e, February 12th, 2005 + + Copyright (C) 1998-2005 Gilles Vollant + + This code is a modified version of crypting code in Infozip distribution + + The encryption/decryption parts of this source code (as opposed to the + non-echoing password parts) were originally written in Europe. The + whole source package can be freely distributed, including from the USA. + (Prior to January 2000, re-export from the US was a violation of US law.) + + This encryption code is a direct transcription of the algorithm from + Roger Schlafly, described by Phil Katz in the file appnote.txt. This + file (appnote.txt) is distributed with the PKZIP program (even in the + version without encryption capabilities). + + If you don't need crypting in your application, just define symbols + NOCRYPT and NOUNCRYPT. + + This code support the "Traditional PKWARE Encryption". + + The new AES encryption added on Zip format by Winzip (see the page + http://www.winzip.com/aes_info.htm ) and PKWare PKZip 5.x Strong + Encryption is not supported. +*/ + +#define CRC32(c, b) ((*(pcrc_32_tab+(((int)(c) ^ (b)) & 0xff))) ^ ((c) >> 8)) + +/*********************************************************************** + * Return the next byte in the pseudo-random sequence + */ +static int decrypt_byte(unsigned long* pkeys, const unsigned long* pcrc_32_tab) { + unsigned temp; /* POTENTIAL BUG: temp*(temp^1) may overflow in an + * unpredictable manner on 16-bit systems; not a problem + * with any known compiler so far, though */ + + temp = ((unsigned)(*(pkeys+2)) & 0xffff) | 2; + return (int)(((temp * (temp ^ 1)) >> 8) & 0xff); +} + +/*********************************************************************** + * Update the encryption keys with the next byte of plain text + */ +static int update_keys(unsigned long* pkeys,const unsigned long* pcrc_32_tab,int c) { + (*(pkeys+0)) = CRC32((*(pkeys+0)), c); + (*(pkeys+1)) += (*(pkeys+0)) & 0xff; + (*(pkeys+1)) = (*(pkeys+1)) * 134775813L + 1; + { + register int keyshift = (int)((*(pkeys+1)) >> 24); + (*(pkeys+2)) = CRC32((*(pkeys+2)), keyshift); + } + return c; +} + + +/*********************************************************************** + * Initialize the encryption keys and the random header according to + * the given password. + */ +static void init_keys(const char* passwd,unsigned long* pkeys,const unsigned long* pcrc_32_tab) { + *(pkeys+0) = 305419896L; + *(pkeys+1) = 591751049L; + *(pkeys+2) = 878082192L; + while (*passwd != '\0') { + update_keys(pkeys,pcrc_32_tab,(int)*passwd); + passwd++; + } +} + +#define zdecode(pkeys,pcrc_32_tab,c) \ + (update_keys(pkeys,pcrc_32_tab,c ^= decrypt_byte(pkeys,pcrc_32_tab))) + +#define zencode(pkeys,pcrc_32_tab,c,t) \ + (t=decrypt_byte(pkeys,pcrc_32_tab), update_keys(pkeys,pcrc_32_tab,c), t^(c)) + +#ifdef INCLUDECRYPTINGCODE_IFCRYPTALLOWED + +#define RAND_HEAD_LEN 12 +/* "last resort" source for second part of crypt seed pattern */ +# ifndef ZCR_SEED2 +# define ZCR_SEED2 3141592654UL /* use PI as default pattern */ +# endif + +static int crypthead(passwd, buf, bufSize, pkeys, pcrc_32_tab, crcForCrypting) +const char *passwd; /* password string */ +unsigned char *buf; /* where to write header */ +int bufSize; +unsigned long* pkeys; +const unsigned long* pcrc_32_tab; +unsigned long crcForCrypting; +{ + int n; /* index in random header */ + int t; /* temporary */ + int c; /* random byte */ + unsigned char header[RAND_HEAD_LEN-2]; /* random header */ + static unsigned calls = 0; /* ensure different random header each time */ + + if (bufSize> 7) & 0xff; + header[n] = (unsigned char)zencode(pkeys, pcrc_32_tab, c, t); + } + /* Encrypt random header (last two bytes is high word of crc) */ + init_keys(passwd, pkeys, pcrc_32_tab); + for (n = 0; n < RAND_HEAD_LEN-2; n++) { + buf[n] = (unsigned char)zencode(pkeys, pcrc_32_tab, header[n], t); + } + buf[n++] = zencode(pkeys, pcrc_32_tab, (int)(crcForCrypting >> 16) & 0xff, t); + buf[n++] = zencode(pkeys, pcrc_32_tab, (int)(crcForCrypting >> 24) & 0xff, t); + return n; +} + +#endif diff --git a/source/unzip/inflate.c b/source/unzip/inflate.c new file mode 100644 index 00000000..1d2365a8 --- /dev/null +++ b/source/unzip/inflate.c @@ -0,0 +1,62 @@ + +#include "inflate.h" + +#define CHUNK 1024 + +int inflateFile(FILE *source, FILE *dest) +{ + int ret; + unsigned have; + z_stream strm; + unsigned char in[CHUNK]; + unsigned char out[CHUNK]; + + /* allocate inflate state */ + strm.zalloc = Z_NULL; + strm.zfree = Z_NULL; + strm.opaque = Z_NULL; + strm.avail_in = 0; + strm.next_in = Z_NULL; + ret = inflateInit(&strm); + if (ret != Z_OK) + return ret; + + /* decompress until deflate stream ends or end of file */ + do { + strm.avail_in = fread(in, 1, CHUNK, source); + if (ferror(source)) { + (void)inflateEnd(&strm); + return Z_ERRNO; + } + if (strm.avail_in == 0) + break; + strm.next_in = in; + + /* run inflate() on input until output buffer not full */ + do { + strm.avail_out = CHUNK; + strm.next_out = out; + ret = inflate(&strm, Z_NO_FLUSH); + switch (ret) { + case Z_NEED_DICT: + (void)inflateEnd(&strm); + return -20; + case Z_DATA_ERROR: + (void)inflateEnd(&strm); + return -21; + case Z_MEM_ERROR: + (void)inflateEnd(&strm); + return -22; + } + have = CHUNK - strm.avail_out; + if (fwrite(out, 1, have, dest) != have || ferror(dest)) { + (void)inflateEnd(&strm); + return Z_ERRNO; + } + } while (strm.avail_out == 0); + /* done when inflate() says it's done */ + } while (ret != Z_STREAM_END); + /* clean up and return */ + (void)inflateEnd(&strm); + return ret == Z_STREAM_END ? Z_OK : Z_DATA_ERROR; +} diff --git a/source/unzip/inflate.h b/source/unzip/inflate.h new file mode 100644 index 00000000..170c93b0 --- /dev/null +++ b/source/unzip/inflate.h @@ -0,0 +1,18 @@ + +#ifndef _INFLATE_H +#define _INFLATE_H + +#include +#include + +#ifdef __cplusplus +extern "C" { +#endif + +int inflateFile(FILE *source, FILE *dest); + +#ifdef __cplusplus +} +#endif + +#endif //_INFLATE_H diff --git a/source/unzip/ioapi.c b/source/unzip/ioapi.c new file mode 100644 index 00000000..c9e6b051 --- /dev/null +++ b/source/unzip/ioapi.c @@ -0,0 +1,177 @@ +/* ioapi.c -- IO base function header for compress/uncompress .zip + files using zlib + zip or unzip API + + Version 1.01e, February 12th, 2005 + + Copyright (C) 1998-2005 Gilles Vollant +*/ + +#include +#include +#include + +#include "zlib.h" +#include "ioapi.h" + + + +/* I've found an old Unix (a SunOS 4.1.3_U1) without all SEEK_* defined.... */ + +#ifndef SEEK_CUR +#define SEEK_CUR 1 +#endif + +#ifndef SEEK_END +#define SEEK_END 2 +#endif + +#ifndef SEEK_SET +#define SEEK_SET 0 +#endif + +voidpf ZCALLBACK fopen_file_func OF(( + voidpf opaque, + const char* filename, + int mode)); + +uLong ZCALLBACK fread_file_func OF(( + voidpf opaque, + voidpf stream, + void* buf, + uLong size)); + +uLong ZCALLBACK fwrite_file_func OF(( + voidpf opaque, + voidpf stream, + const void* buf, + uLong size)); + +long ZCALLBACK ftell_file_func OF(( + voidpf opaque, + voidpf stream)); + +long ZCALLBACK fseek_file_func OF(( + voidpf opaque, + voidpf stream, + uLong offset, + int origin)); + +int ZCALLBACK fclose_file_func OF(( + voidpf opaque, + voidpf stream)); + +int ZCALLBACK ferror_file_func OF(( + voidpf opaque, + voidpf stream)); + + +voidpf ZCALLBACK fopen_file_func (opaque, filename, mode) +voidpf opaque; +const char* filename; +int mode; +{ + FILE* file = NULL; + const char* mode_fopen = NULL; + if ((mode & ZLIB_FILEFUNC_MODE_READWRITEFILTER)==ZLIB_FILEFUNC_MODE_READ) + mode_fopen = "rb"; + else + if (mode & ZLIB_FILEFUNC_MODE_EXISTING) + mode_fopen = "r+b"; + else + if (mode & ZLIB_FILEFUNC_MODE_CREATE) + mode_fopen = "wb"; + + if ((filename!=NULL) && (mode_fopen != NULL)) + file = fopen(filename, mode_fopen); + return file; +} + + +uLong ZCALLBACK fread_file_func (opaque, stream, buf, size) +voidpf opaque; +voidpf stream; +void* buf; +uLong size; +{ + uLong ret; + ret = (uLong)fread(buf, 1, (size_t)size, (FILE *)stream); + return ret; +} + + +uLong ZCALLBACK fwrite_file_func (opaque, stream, buf, size) +voidpf opaque; +voidpf stream; +const void* buf; +uLong size; +{ + uLong ret; + ret = (uLong)fwrite(buf, 1, (size_t)size, (FILE *)stream); + return ret; +} + +long ZCALLBACK ftell_file_func (opaque, stream) +voidpf opaque; +voidpf stream; +{ + long ret; + ret = ftell((FILE *)stream); + return ret; +} + +long ZCALLBACK fseek_file_func (opaque, stream, offset, origin) +voidpf opaque; +voidpf stream; +uLong offset; +int origin; +{ + int fseek_origin=0; + long ret; + switch (origin) { + case ZLIB_FILEFUNC_SEEK_CUR : + fseek_origin = SEEK_CUR; + break; + case ZLIB_FILEFUNC_SEEK_END : + fseek_origin = SEEK_END; + break; + case ZLIB_FILEFUNC_SEEK_SET : + fseek_origin = SEEK_SET; + break; + default: + return -1; + } + ret = 0; + fseek((FILE *)stream, offset, fseek_origin); + return ret; +} + +int ZCALLBACK fclose_file_func (opaque, stream) +voidpf opaque; +voidpf stream; +{ + int ret; + ret = fclose((FILE *)stream); + return ret; +} + +int ZCALLBACK ferror_file_func (opaque, stream) +voidpf opaque; +voidpf stream; +{ + int ret; + ret = ferror((FILE *)stream); + return ret; +} + +void fill_fopen_filefunc (pzlib_filefunc_def) +zlib_filefunc_def* pzlib_filefunc_def; +{ + pzlib_filefunc_def->zopen_file = fopen_file_func; + pzlib_filefunc_def->zread_file = fread_file_func; + pzlib_filefunc_def->zwrite_file = fwrite_file_func; + pzlib_filefunc_def->ztell_file = ftell_file_func; + pzlib_filefunc_def->zseek_file = fseek_file_func; + pzlib_filefunc_def->zclose_file = fclose_file_func; + pzlib_filefunc_def->zerror_file = ferror_file_func; + pzlib_filefunc_def->opaque = NULL; +} diff --git a/source/unzip/ioapi.h b/source/unzip/ioapi.h new file mode 100644 index 00000000..c09ca70e --- /dev/null +++ b/source/unzip/ioapi.h @@ -0,0 +1,74 @@ +/* ioapi.h -- IO base function header for compress/uncompress .zip + files using zlib + zip or unzip API + + Version 1.01e, February 12th, 2005 + + Copyright (C) 1998-2005 Gilles Vollant +*/ + +#ifndef _ZLIBIOAPI_H +#define _ZLIBIOAPI_H + + +#define ZLIB_FILEFUNC_SEEK_CUR (1) +#define ZLIB_FILEFUNC_SEEK_END (2) +#define ZLIB_FILEFUNC_SEEK_SET (0) + +#define ZLIB_FILEFUNC_MODE_READ (1) +#define ZLIB_FILEFUNC_MODE_WRITE (2) +#define ZLIB_FILEFUNC_MODE_READWRITEFILTER (3) + +#define ZLIB_FILEFUNC_MODE_EXISTING (4) +#define ZLIB_FILEFUNC_MODE_CREATE (8) + + +#ifndef ZCALLBACK + +#if (defined(WIN32) || defined (WINDOWS) || defined (_WINDOWS)) && defined(CALLBACK) && defined (USEWINDOWS_CALLBACK) +#define ZCALLBACK CALLBACK +#else +#define ZCALLBACK +#endif +#endif + +#ifdef __cplusplus +extern "C" { +#endif + + typedef voidpf (ZCALLBACK *open_file_func) OF((voidpf opaque, const char* filename, int mode)); + typedef uLong (ZCALLBACK *read_file_func) OF((voidpf opaque, voidpf stream, void* buf, uLong size)); + typedef uLong (ZCALLBACK *write_file_func) OF((voidpf opaque, voidpf stream, const void* buf, uLong size)); + typedef long (ZCALLBACK *tell_file_func) OF((voidpf opaque, voidpf stream)); + typedef long (ZCALLBACK *seek_file_func) OF((voidpf opaque, voidpf stream, uLong offset, int origin)); + typedef int (ZCALLBACK *close_file_func) OF((voidpf opaque, voidpf stream)); + typedef int (ZCALLBACK *testerror_file_func) OF((voidpf opaque, voidpf stream)); + + typedef struct zlib_filefunc_def_s { + open_file_func zopen_file; + read_file_func zread_file; + write_file_func zwrite_file; + tell_file_func ztell_file; + seek_file_func zseek_file; + close_file_func zclose_file; + testerror_file_func zerror_file; + voidpf opaque; + } zlib_filefunc_def; + + + + void fill_fopen_filefunc OF((zlib_filefunc_def* pzlib_filefunc_def)); + +#define ZREAD(filefunc,filestream,buf,size) ((*((filefunc).zread_file))((filefunc).opaque,filestream,buf,size)) +#define ZWRITE(filefunc,filestream,buf,size) ((*((filefunc).zwrite_file))((filefunc).opaque,filestream,buf,size)) +#define ZTELL(filefunc,filestream) ((*((filefunc).ztell_file))((filefunc).opaque,filestream)) +#define ZSEEK(filefunc,filestream,pos,mode) ((*((filefunc).zseek_file))((filefunc).opaque,filestream,pos,mode)) +#define ZCLOSE(filefunc,filestream) ((*((filefunc).zclose_file))((filefunc).opaque,filestream)) +#define ZERROR(filefunc,filestream) ((*((filefunc).zerror_file))((filefunc).opaque,filestream)) + + +#ifdef __cplusplus +} +#endif + +#endif + diff --git a/source/unzip/miniunz.c b/source/unzip/miniunz.c new file mode 100644 index 00000000..66ea766b --- /dev/null +++ b/source/unzip/miniunz.c @@ -0,0 +1,280 @@ +/* + miniunz.c + Version 1.01e, February 12th, 2005 + + Copyright (C) 1998-2005 Gilles Vollant +*/ + + +#include +#include +#include +#include +#include +#include +# include +# include + +#include "unzip.h" + +#define CASESENSITIVITY (0) +#define WRITEBUFFERSIZE (8192) +#define MAXFILENAME (256) + +struct stat exists; + +static int mymkdir(const char* dirname) +{ + if (stat(dirname, &exists) == 0) + return 0; + return mkdir(dirname,0777); +} + +int makedir (char *newdir) +{ + if (stat(newdir, &exists) == 0) + return 0; + + char *buffer ; + char *p; + int len = (int)strlen(newdir); + + if (len <= 0) + return 0; + + buffer = (char*)malloc(len+1); + strcpy(buffer,newdir); + + if (buffer[len-1] == '/') { + buffer[len-1] = '\0'; + } + if (mymkdir(buffer) == 0) { + SAFE_FREE(buffer); + return 1; + } + + p = buffer+1; + while (1) { + char hold; + + while (*p && *p != '\\' && *p != '/') + p++; + hold = *p; + *p = 0; + if ((mymkdir(buffer) == -1) && (errno == ENOENT)) { +// printf("couldn't create directory %s\n",buffer); + SAFE_FREE(buffer); + return 0; + } + if (hold == 0) + break; + *p++ = hold; + } + SAFE_FREE(buffer); + return 1; +} + +static char *fullfilename(const char *basedir, char *filename) { + char *file = (char *) malloc(strlen(basedir) + strlen(filename) + 1); + if (basedir == NULL) { + strcpy(file, filename); + } else { + if (basedir[strlen(basedir) - 1] == '/') { + sprintf(file, "%s%s", basedir, filename); + } else { + sprintf(file, "%s/%s", basedir, filename); + } + } + return file; +} + +static int do_extract_currentfile(unzFile uf,const int* popt_extract_without_path,int* popt_overwrite,const char* password, const char *basedir) { + char filename_inzip[256]; + char* filename_withoutpath; + char* filename_withpath; + char* p; + int err=UNZ_OK; + FILE *fout=NULL; + void* buf; + uInt size_buf; + + unz_file_info file_info; + err = unzGetCurrentFileInfo(uf,&file_info,filename_inzip,sizeof(filename_inzip),NULL,0,NULL,0); + + if (err!=UNZ_OK) { +// printf("error %d with zipfile in unzGetCurrentFileInfo\n",err); + return err; + } + + size_buf = WRITEBUFFERSIZE; + buf = (void*)malloc(size_buf); + if (buf==NULL) { +// printf("Error allocating memory\n"); + return UNZ_INTERNALERROR; + } + + p = filename_withoutpath = filename_inzip; + filename_withpath = fullfilename(basedir, filename_inzip); + while ((*p) != '\0') { + if (((*p)=='/') || ((*p)=='\\')) + filename_withoutpath = p+1; + p++; + } + + if ((*filename_withoutpath)=='\0') { + if ((*popt_extract_without_path)==0) { + + // Fix the path, this will fail if the directoryname is the same as the first filename in the zip + char *path = (char *) malloc(strlen(filename_withpath)); + strcpy(path, filename_withpath); + char *ptr = strstr(path, filename_withoutpath); + *ptr = '\0'; + +// printf("creating directory: %s\n",path); + mymkdir(path); + + SAFE_FREE(path); + } + } else { + char* write_filename; + int skip=0; + + if ((*popt_extract_without_path)==0) + write_filename = filename_withpath; + else + write_filename = filename_withoutpath; + + err = unzOpenCurrentFilePassword(uf,password); + if (err!=UNZ_OK) { +// printf("error %d with zipfile in unzOpenCurrentFilePassword\n",err); + } + + if (((*popt_overwrite)==0) && (err==UNZ_OK)) { + char rep=0; + FILE* ftestexist; + ftestexist = fopen(write_filename,"rb"); + if (ftestexist!=NULL) { + fclose(ftestexist); + do { + char answer[128]; + int ret; + +// printf("The file %s exists. Overwrite ? [y]es, [n]o, [A]ll: ",write_filename); + ret = scanf("%1s",answer); + if (ret != 1) { + exit(EXIT_FAILURE); + } + rep = answer[0] ; + if ((rep>='a') && (rep<='z')) + rep -= 0x20; + } while ((rep!='Y') && (rep!='N') && (rep!='A')); + } + + if (rep == 'N') + skip = 1; + + if (rep == 'A') + *popt_overwrite=1; + } + + if ((skip==0) && (err==UNZ_OK)) { + fout=fopen(write_filename,"wb"); + + /* some zipfile don't contain directory alone before file */ + if ((fout==NULL) && ((*popt_extract_without_path)==0) && + (filename_withoutpath!=(char*)filename_inzip)) { + char c=*(filename_withoutpath-1); + *(filename_withoutpath-1)='\0'; + + // Fix the path, this will fail if the directoryname is the same as the first filename in the zip + char *path = (char *) malloc(strlen(write_filename)); + strcpy(path, write_filename); + char *ptr = strstr(path, filename_withoutpath); + *ptr = '\0'; + makedir(path); + SAFE_FREE(path); + + *(filename_withoutpath-1)=c; + fout=fopen(write_filename,"wb"); + } + + if (fout==NULL) { +// printf("error opening %s\n",write_filename); + } + } + + if (fout!=NULL) { +// printf(" extracting: %s\n",write_filename); + + do { + err = unzReadCurrentFile(uf,buf,size_buf); + if (err<0) { +// printf("error %d with zipfile in unzReadCurrentFile\n",err); + break; + } + if (err>0) + if (fwrite(buf,err,1,fout)!=1) { +// printf("error in writing extracted file\n"); + err=UNZ_ERRNO; + break; + } + } while (err>0); + if (fout) + fclose(fout); + + } + + if (err==UNZ_OK) { + err = unzCloseCurrentFile (uf); + if (err!=UNZ_OK) { +// printf("error %d with zipfile in unzCloseCurrentFile\n",err); + } + } else + unzCloseCurrentFile(uf); /* don't lose the error */ + } + SAFE_FREE(filename_withpath); + SAFE_FREE(buf); + return err; +} + + +int extractZip(unzFile uf,int opt_extract_without_path,int opt_overwrite,const char* password, const char *basedir) { + uLong i; + unz_global_info gi; + int err; + + err = unzGetGlobalInfo (uf,&gi); + if (err!=UNZ_OK) +// printf("error %d with zipfile in unzGetGlobalInfo \n",err); + + for (i=0;i +#include +#include +#include "zlib.h" +#include "unzip.h" + +#define READ_8(adr) ((unsigned char)*(adr)) +#define READ_16(adr) ( READ_8(adr) | (READ_8(adr+1) << 8) ) +#define READ_32(adr) ( READ_16(adr) | (READ_16((adr)+2) << 16) ) + +#define WRITE_8(buff, n) do { \ + *((unsigned char*)(buff)) = (unsigned char) ((n) & 0xff); \ +} while(0) +#define WRITE_16(buff, n) do { \ + WRITE_8((unsigned char*)(buff), n); \ + WRITE_8(((unsigned char*)(buff)) + 1, (n) >> 8); \ +} while(0) +#define WRITE_32(buff, n) do { \ + WRITE_16((unsigned char*)(buff), (n) & 0xffff); \ + WRITE_16((unsigned char*)(buff) + 2, (n) >> 16); \ +} while(0) + +extern int ZEXPORT unzRepair(file, fileOut, fileOutTmp, nRecovered, bytesRecovered) + const char* file; +const char* fileOut; +const char* fileOutTmp; +uLong* nRecovered; +uLong* bytesRecovered; +{ + int err = Z_OK; + FILE* fpZip = fopen(file, "rb"); + FILE* fpOut = fopen(fileOut, "wb"); + FILE* fpOutCD = fopen(fileOutTmp, "wb"); + if (fpZip != NULL && fpOut != NULL) { + int entries = 0; + uLong totalBytes = 0; + char header[30]; + char filename[256]; + char extra[1024]; + int offset = 0; + int offsetCD = 0; + while ( fread(header, 1, 30, fpZip) == 30 ) { + int currentOffset = offset; + + /* File entry */ + if (READ_32(header) == 0x04034b50) { + unsigned int version = READ_16(header + 4); + unsigned int gpflag = READ_16(header + 6); + unsigned int method = READ_16(header + 8); + unsigned int filetime = READ_16(header + 10); + unsigned int filedate = READ_16(header + 12); + unsigned int crc = READ_32(header + 14); /* crc */ + unsigned int cpsize = READ_32(header + 18); /* compressed size */ + unsigned int uncpsize = READ_32(header + 22); /* uncompressed sz */ + unsigned int fnsize = READ_16(header + 26); /* file name length */ + unsigned int extsize = READ_16(header + 28); /* extra field length */ + filename[0] = extra[0] = '\0'; + + /* Header */ + if (fwrite(header, 1, 30, fpOut) == 30) { + offset += 30; + } else { + err = Z_ERRNO; + break; + } + + /* Filename */ + if (fnsize > 0) { + if (fread(filename, 1, fnsize, fpZip) == fnsize) { + if (fwrite(filename, 1, fnsize, fpOut) == fnsize) { + offset += fnsize; + } else { + err = Z_ERRNO; + break; + } + } else { + err = Z_ERRNO; + break; + } + } else { + err = Z_STREAM_ERROR; + break; + } + + /* Extra field */ + if (extsize > 0) { + if (fread(extra, 1, extsize, fpZip) == extsize) { + if (fwrite(extra, 1, extsize, fpOut) == extsize) { + offset += extsize; + } else { + err = Z_ERRNO; + break; + } + } else { + err = Z_ERRNO; + break; + } + } + + /* Data */ + { + int dataSize = cpsize; + if (dataSize == 0) { + dataSize = uncpsize; + } + if (dataSize > 0) { + char* data = malloc(dataSize); + if (data != NULL) { + if ((int)fread(data, 1, dataSize, fpZip) == dataSize) { + if ((int)fwrite(data, 1, dataSize, fpOut) == dataSize) { + offset += dataSize; + totalBytes += dataSize; + } else { + err = Z_ERRNO; + } + } else { + err = Z_ERRNO; + } + SAFE_FREE(data); + if (err != Z_OK) { + break; + } + } else { + err = Z_MEM_ERROR; + break; + } + } + } + + /* Central directory entry */ + { + char header[46]; + char* comment = ""; + int comsize = (int) strlen(comment); + WRITE_32(header, 0x02014b50); + WRITE_16(header + 4, version); + WRITE_16(header + 6, version); + WRITE_16(header + 8, gpflag); + WRITE_16(header + 10, method); + WRITE_16(header + 12, filetime); + WRITE_16(header + 14, filedate); + WRITE_32(header + 16, crc); + WRITE_32(header + 20, cpsize); + WRITE_32(header + 24, uncpsize); + WRITE_16(header + 28, fnsize); + WRITE_16(header + 30, extsize); + WRITE_16(header + 32, comsize); + WRITE_16(header + 34, 0); /* disk # */ + WRITE_16(header + 36, 0); /* int attrb */ + WRITE_32(header + 38, 0); /* ext attrb */ + WRITE_32(header + 42, currentOffset); + /* Header */ + if (fwrite(header, 1, 46, fpOutCD) == 46) { + offsetCD += 46; + + /* Filename */ + if (fnsize > 0) { + if (fwrite(filename, 1, fnsize, fpOutCD) == fnsize) { + offsetCD += fnsize; + } else { + err = Z_ERRNO; + break; + } + } else { + err = Z_STREAM_ERROR; + break; + } + + /* Extra field */ + if (extsize > 0) { + if (fwrite(extra, 1, extsize, fpOutCD) == extsize) { + offsetCD += extsize; + } else { + err = Z_ERRNO; + break; + } + } + + /* Comment field */ + if (comsize > 0) { + if ((int)fwrite(comment, 1, comsize, fpOutCD) == comsize) { + offsetCD += comsize; + } else { + err = Z_ERRNO; + break; + } + } + + + } else { + err = Z_ERRNO; + break; + } + } + + /* Success */ + entries++; + + } else { + break; + } + } + + /* Final central directory */ + { + int entriesZip = entries; + char header[22]; + char* comment = ""; // "ZIP File recovered by zlib/minizip/mztools"; + int comsize = (int) strlen(comment); + if (entriesZip > 0xffff) { + entriesZip = 0xffff; + } + WRITE_32(header, 0x06054b50); + WRITE_16(header + 4, 0); /* disk # */ + WRITE_16(header + 6, 0); /* disk # */ + WRITE_16(header + 8, entriesZip); /* hack */ + WRITE_16(header + 10, entriesZip); /* hack */ + WRITE_32(header + 12, offsetCD); /* size of CD */ + WRITE_32(header + 16, offset); /* offset to CD */ + WRITE_16(header + 20, comsize); /* comment */ + + /* Header */ + if (fwrite(header, 1, 22, fpOutCD) == 22) { + + /* Comment field */ + if (comsize > 0) { + if ((int)fwrite(comment, 1, comsize, fpOutCD) != comsize) { + err = Z_ERRNO; + } + } + + } else { + err = Z_ERRNO; + } + } + + /* Final merge (file + central directory) */ + fclose(fpOutCD); + if (err == Z_OK) { + fpOutCD = fopen(fileOutTmp, "rb"); + if (fpOutCD != NULL) { + int nRead; + char buffer[8192]; + while ( (nRead = (int)fread(buffer, 1, sizeof(buffer), fpOutCD)) > 0) { + if ((int)fwrite(buffer, 1, nRead, fpOut) != nRead) { + err = Z_ERRNO; + break; + } + } + fclose(fpOutCD); + } + } + + /* Close */ + fclose(fpZip); + fclose(fpOut); + + /* Wipe temporary file */ + (void)remove(fileOutTmp); + + /* Number of recovered entries */ + if (err == Z_OK) { + if (nRecovered != NULL) { + *nRecovered = entries; + } + if (bytesRecovered != NULL) { + *bytesRecovered = totalBytes; + } + } + } else { + err = Z_STREAM_ERROR; + } + return err; +} diff --git a/source/unzip/mztools.h b/source/unzip/mztools.h new file mode 100644 index 00000000..461ee558 --- /dev/null +++ b/source/unzip/mztools.h @@ -0,0 +1,31 @@ +/* + Additional tools for Minizip + Code: Xavier Roche '2004 + License: Same as ZLIB (www.gzip.org) +*/ + +#ifndef _zip_tools_H +#define _zip_tools_H + +#ifdef __cplusplus +extern "C" { +#endif + +#ifndef _ZLIB_H +#include "zlib.h" +#endif + +#include "unzip.h" + + /* Repair a ZIP file (missing central directory) + file: file to recover + fileOut: output file after recovery + fileOutTmp: temporary file name used for recovery + */ + extern int ZEXPORT unzRepair(const char* file, + const char* fileOut, + const char* fileOutTmp, + uLong* nRecovered, + uLong* bytesRecovered); + +#endif diff --git a/source/unzip/unzip.c b/source/unzip/unzip.c new file mode 100644 index 00000000..2c85ff19 --- /dev/null +++ b/source/unzip/unzip.c @@ -0,0 +1,1574 @@ +/* unzip.c -- IO for uncompress .zip files using zlib + Version 1.01e, February 12th, 2005 + + Copyright (C) 1998-2005 Gilles Vollant + + Read unzip.h for more info +*/ + +/* Decryption code comes from crypt.c by Info-ZIP but has been greatly reduced in terms of +compatibility with older software. The following is from the original crypt.c. Code +woven in by Terry Thorsen 1/2003. +*/ +/* + Copyright (c) 1990-2000 Info-ZIP. All rights reserved. + + See the accompanying file LICENSE, version 2000-Apr-09 or later + (the contents of which are also included in zip.h) for terms of use. + If, for some reason, all these files are missing, the Info-ZIP license + also may be found at: ftp://ftp.info-zip.org/pub/infozip/license.html +*/ +/* + crypt.c (full version) by Info-ZIP. Last revised: [see crypt.h] + + The encryption/decryption parts of this source code (as opposed to the + non-echoing password parts) were originally written in Europe. The + whole source package can be freely distributed, including from the USA. + (Prior to January 2000, re-export from the US was a violation of US law.) + */ + +/* + This encryption code is a direct transcription of the algorithm from + Roger Schlafly, described by Phil Katz in the file appnote.txt. This + file (appnote.txt) is distributed with the PKZIP program (even in the + version without encryption capabilities). + */ + + +#include +#include +#include +#include "zlib.h" +#include "unzip.h" + +#ifdef STDC +# include +# include +# include +#endif +#ifdef NO_ERRNO_H +extern int errno; +#else +# include +#endif + + +#ifndef local +# define local static +#endif +/* compile with -Dlocal if your debugger can't find static symbols */ + + +#ifndef CASESENSITIVITYDEFAULT_NO +# if !defined(unix) && !defined(CASESENSITIVITYDEFAULT_YES) +# define CASESENSITIVITYDEFAULT_NO +# endif +#endif + + +#ifndef UNZ_BUFSIZE +#define UNZ_BUFSIZE (16384) +#endif + +#ifndef UNZ_MAXFILENAMEINZIP +#define UNZ_MAXFILENAMEINZIP (256) +#endif + +#ifndef ALLOC +# define ALLOC(size) (malloc(size)) +#endif +#ifndef TRYFREE +# define TRYFREE(p) if(p) {free(p); p = NULL;} +#endif + +#define SIZECENTRALDIRITEM (0x2e) +#define SIZEZIPLOCALHEADER (0x1e) + + + + +const char unz_copyright[] = + " unzip 1.01 Copyright 1998-2004 Gilles Vollant - http://www.winimage.com/zLibDll"; + +/* unz_file_info_interntal contain internal info about a file in zipfile*/ +typedef struct unz_file_info_internal_s { + uLong offset_curfile;/* relative offset of local header 4 bytes */ +} unz_file_info_internal; + + +/* file_in_zip_read_info_s contain internal information about a file in zipfile, + when reading and decompress it */ +typedef struct { + char *read_buffer; /* internal buffer for compressed data */ + z_stream stream; /* zLib stream structure for inflate */ + + uLong pos_in_zipfile; /* position in byte on the zipfile, for fseek*/ + uLong stream_initialised; /* flag set if stream structure is initialised*/ + + uLong offset_local_extrafield;/* offset of the local extra field */ + uInt size_local_extrafield;/* size of the local extra field */ + uLong pos_local_extrafield; /* position in the local extra field in read*/ + + uLong crc32; /* crc32 of all data uncompressed */ + uLong crc32_wait; /* crc32 we must obtain after decompress all */ + uLong rest_read_compressed; /* number of byte to be decompressed */ + uLong rest_read_uncompressed;/*number of byte to be obtained after decomp*/ + zlib_filefunc_def z_filefunc; + voidpf filestream; /* io structore of the zipfile */ + uLong compression_method; /* compression method (0==store) */ + uLong byte_before_the_zipfile;/* byte before the zipfile, (>0 for sfx)*/ + int raw; +} file_in_zip_read_info_s; + + +/* unz_s contain internal information about the zipfile +*/ +typedef struct { + zlib_filefunc_def z_filefunc; + voidpf filestream; /* io structore of the zipfile */ + unz_global_info gi; /* public global information */ + uLong byte_before_the_zipfile;/* byte before the zipfile, (>0 for sfx)*/ + uLong num_file; /* number of the current file in the zipfile*/ + uLong pos_in_central_dir; /* pos of the current file in the central dir*/ + uLong current_file_ok; /* flag about the usability of the current file*/ + uLong central_pos; /* position of the beginning of the central dir*/ + + uLong size_central_dir; /* size of the central directory */ + uLong offset_central_dir; /* offset of start of central directory with + respect to the starting disk number */ + + unz_file_info cur_file_info; /* public info about the current file in zip*/ + unz_file_info_internal cur_file_info_internal; /* private info about it*/ + file_in_zip_read_info_s* pfile_in_zip_read; /* structure about the current + file if we are decompressing it */ + int encrypted; +# ifndef NOUNCRYPT + unsigned long keys[3]; /* keys defining the pseudo-random sequence */ + const unsigned long* pcrc_32_tab; +# endif +} unz_s; + + +#ifndef NOUNCRYPT +#include "crypt.h" +#endif + +/* =========================================================================== + Read a byte from a gz_stream; update next_in and avail_in. Return EOF + for end of file. + IN assertion: the stream s has been sucessfully opened for reading. +*/ + + +local int unzlocal_getByte OF(( + const zlib_filefunc_def* pzlib_filefunc_def, + voidpf filestream, + int *pi)); + +local int unzlocal_getByte(pzlib_filefunc_def,filestream,pi) +const zlib_filefunc_def* pzlib_filefunc_def; +voidpf filestream; +int *pi; +{ + unsigned char c; + int err = (int)ZREAD(*pzlib_filefunc_def,filestream,&c,1); + if (err==1) { + *pi = (int)c; + return UNZ_OK; + } else { + if (ZERROR(*pzlib_filefunc_def,filestream)) + return UNZ_ERRNO; + else + return UNZ_EOF; + } +} + + +/* =========================================================================== + Reads a long in LSB order from the given gz_stream. Sets +*/ +local int unzlocal_getShort OF(( + const zlib_filefunc_def* pzlib_filefunc_def, + voidpf filestream, + uLong *pX)); + +local int unzlocal_getShort (pzlib_filefunc_def,filestream,pX) +const zlib_filefunc_def* pzlib_filefunc_def; +voidpf filestream; +uLong *pX; +{ + uLong x ; + int i = 0; + int err; + + err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i); + x = (uLong)i; + + if (err==UNZ_OK) + err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i); + x += ((uLong)i)<<8; + + if (err==UNZ_OK) + *pX = x; + else + *pX = 0; + return err; +} + +local int unzlocal_getLong OF(( + const zlib_filefunc_def* pzlib_filefunc_def, + voidpf filestream, + uLong *pX)); + +local int unzlocal_getLong (pzlib_filefunc_def,filestream,pX) +const zlib_filefunc_def* pzlib_filefunc_def; +voidpf filestream; +uLong *pX; +{ + uLong x ; + int i = 0; + int err; + + err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i); + x = (uLong)i; + + if (err==UNZ_OK) + err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i); + x += ((uLong)i)<<8; + + if (err==UNZ_OK) + err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i); + x += ((uLong)i)<<16; + + if (err==UNZ_OK) + err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i); + x += ((uLong)i)<<24; + + if (err==UNZ_OK) + *pX = x; + else + *pX = 0; + return err; +} + + +/* My own strcmpi / strcasecmp */ +local int strcmpcasenosensitive_internal (fileName1,fileName2) +const char* fileName1; +const char* fileName2; +{ + for (;;) { + char c1=*(fileName1++); + char c2=*(fileName2++); + if ((c1>='a') && (c1<='z')) + c1 -= 0x20; + if ((c2>='a') && (c2<='z')) + c2 -= 0x20; + if (c1=='\0') + return ((c2=='\0') ? 0 : -1); + if (c2=='\0') + return 1; + if (c1c2) + return 1; + } +} + + +#ifdef CASESENSITIVITYDEFAULT_NO +#define CASESENSITIVITYDEFAULTVALUE 2 +#else +#define CASESENSITIVITYDEFAULTVALUE 1 +#endif + +#ifndef STRCMPCASENOSENTIVEFUNCTION +#define STRCMPCASENOSENTIVEFUNCTION strcmpcasenosensitive_internal +#endif + +/* + Compare two filename (fileName1,fileName2). + If iCaseSenisivity = 1, comparision is case sensitivity (like strcmp) + If iCaseSenisivity = 2, comparision is not case sensitivity (like strcmpi + or strcasecmp) + If iCaseSenisivity = 0, case sensitivity is defaut of your operating system + (like 1 on Unix, 2 on Windows) + +*/ +extern int ZEXPORT unzStringFileNameCompare (fileName1,fileName2,iCaseSensitivity) + const char* fileName1; +const char* fileName2; +int iCaseSensitivity; +{ + if (iCaseSensitivity==0) + iCaseSensitivity=CASESENSITIVITYDEFAULTVALUE; + + if (iCaseSensitivity==1) + return strcmp(fileName1,fileName2); + + return STRCMPCASENOSENTIVEFUNCTION(fileName1,fileName2); +} + +#ifndef BUFREADCOMMENT +#define BUFREADCOMMENT (0x400) +#endif + +/* + Locate the Central directory of a zipfile (at the end, just before + the global comment) +*/ +local uLong unzlocal_SearchCentralDir OF(( + const zlib_filefunc_def* pzlib_filefunc_def, + voidpf filestream)); + +local uLong unzlocal_SearchCentralDir(pzlib_filefunc_def,filestream) +const zlib_filefunc_def* pzlib_filefunc_def; +voidpf filestream; +{ + unsigned char* buf; + uLong uSizeFile; + uLong uBackRead; + uLong uMaxBack=0xffff; /* maximum size of global comment */ + uLong uPosFound=0; + + if (ZSEEK(*pzlib_filefunc_def,filestream,0,ZLIB_FILEFUNC_SEEK_END) != 0) + return 0; + + + uSizeFile = ZTELL(*pzlib_filefunc_def,filestream); + + if (uMaxBack>uSizeFile) + uMaxBack = uSizeFile; + + buf = (unsigned char*)ALLOC(BUFREADCOMMENT+4); + if (buf==NULL) + return 0; + + uBackRead = 4; + while (uBackReaduMaxBack) + uBackRead = uMaxBack; + else + uBackRead+=BUFREADCOMMENT; + uReadPos = uSizeFile-uBackRead ; + + uReadSize = ((BUFREADCOMMENT+4) < (uSizeFile-uReadPos)) ? + (BUFREADCOMMENT+4) : (uSizeFile-uReadPos); + if (ZSEEK(*pzlib_filefunc_def,filestream,uReadPos,ZLIB_FILEFUNC_SEEK_SET)!=0) + break; + + if (ZREAD(*pzlib_filefunc_def,filestream,buf,uReadSize)!=uReadSize) + break; + + for (i=(int)uReadSize-3; (i--)>0;) + if (((*(buf+i))==0x50) && ((*(buf+i+1))==0x4b) && + ((*(buf+i+2))==0x05) && ((*(buf+i+3))==0x06)) { + uPosFound = uReadPos+i; + break; + } + + if (uPosFound!=0) + break; + } + TRYFREE(buf); + return uPosFound; +} + +/* + Open a Zip file. path contain the full pathname (by example, + on a Windows NT computer "c:\\test\\zlib114.zip" or on an Unix computer + "zlib/zlib114.zip". + If the zipfile cannot be opened (file doesn't exist or in not valid), the + return value is NULL. + Else, the return value is a unzFile Handle, usable with other function + of this unzip package. +*/ +extern unzFile ZEXPORT unzOpen2 (path, pzlib_filefunc_def) + const char *path; +zlib_filefunc_def* pzlib_filefunc_def; +{ + unz_s us; + unz_s *s; + uLong central_pos,uL; + + uLong number_disk; /* number of the current dist, used for + spaning ZIP, unsupported, always 0*/ + uLong number_disk_with_CD; /* number the the disk with central dir, used + for spaning ZIP, unsupported, always 0*/ + uLong number_entry_CD; /* total number of entries in + the central dir + (same than number_entry on nospan) */ + + int err=UNZ_OK; + + if (unz_copyright[0]!=' ') + return NULL; + + if (pzlib_filefunc_def==NULL) + fill_fopen_filefunc(&us.z_filefunc); + else + us.z_filefunc = *pzlib_filefunc_def; + + us.filestream= (*(us.z_filefunc.zopen_file))(us.z_filefunc.opaque, + path, + ZLIB_FILEFUNC_MODE_READ | + ZLIB_FILEFUNC_MODE_EXISTING); + if (us.filestream==NULL) + return NULL; + + central_pos = unzlocal_SearchCentralDir(&us.z_filefunc,us.filestream); + if (central_pos==0) + err=UNZ_ERRNO; + + if (ZSEEK(us.z_filefunc, us.filestream, + central_pos,ZLIB_FILEFUNC_SEEK_SET)!=0) + err=UNZ_ERRNO; + + /* the signature, already checked */ + if (unzlocal_getLong(&us.z_filefunc, us.filestream,&uL)!=UNZ_OK) + err=UNZ_ERRNO; + + /* number of this disk */ + if (unzlocal_getShort(&us.z_filefunc, us.filestream,&number_disk)!=UNZ_OK) + err=UNZ_ERRNO; + + /* number of the disk with the start of the central directory */ + if (unzlocal_getShort(&us.z_filefunc, us.filestream,&number_disk_with_CD)!=UNZ_OK) + err=UNZ_ERRNO; + + /* total number of entries in the central dir on this disk */ + if (unzlocal_getShort(&us.z_filefunc, us.filestream,&us.gi.number_entry)!=UNZ_OK) + err=UNZ_ERRNO; + + /* total number of entries in the central dir */ + if (unzlocal_getShort(&us.z_filefunc, us.filestream,&number_entry_CD)!=UNZ_OK) + err=UNZ_ERRNO; + + if ((number_entry_CD!=us.gi.number_entry) || + (number_disk_with_CD!=0) || + (number_disk!=0)) + err=UNZ_BADZIPFILE; + + /* size of the central directory */ + if (unzlocal_getLong(&us.z_filefunc, us.filestream,&us.size_central_dir)!=UNZ_OK) + err=UNZ_ERRNO; + + /* offset of start of central directory with respect to the + starting disk number */ + if (unzlocal_getLong(&us.z_filefunc, us.filestream,&us.offset_central_dir)!=UNZ_OK) + err=UNZ_ERRNO; + + /* zipfile comment length */ + if (unzlocal_getShort(&us.z_filefunc, us.filestream,&us.gi.size_comment)!=UNZ_OK) + err=UNZ_ERRNO; + + if ((central_pospfile_in_zip_read!=NULL) + unzCloseCurrentFile(file); + + ZCLOSE(s->z_filefunc, s->filestream); + TRYFREE(s); + return UNZ_OK; +} + + +/* + Write info about the ZipFile in the *pglobal_info structure. + No preparation of the structure is needed + return UNZ_OK if there is no problem. */ +extern int ZEXPORT unzGetGlobalInfo (file,pglobal_info) + unzFile file; +unz_global_info *pglobal_info; +{ + unz_s* s; + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + *pglobal_info=s->gi; + return UNZ_OK; +} + + +/* + Translate date/time from Dos format to tm_unz (readable more easilty) +*/ +local void unzlocal_DosDateToTmuDate (ulDosDate, ptm) +uLong ulDosDate; +tm_unz* ptm; +{ + uLong uDate; + uDate = (uLong)(ulDosDate>>16); + ptm->tm_mday = (uInt)(uDate&0x1f) ; + ptm->tm_mon = (uInt)((((uDate)&0x1E0)/0x20)-1) ; + ptm->tm_year = (uInt)(((uDate&0x0FE00)/0x0200)+1980) ; + + ptm->tm_hour = (uInt) ((ulDosDate &0xF800)/0x800); + ptm->tm_min = (uInt) ((ulDosDate&0x7E0)/0x20) ; + ptm->tm_sec = (uInt) (2*(ulDosDate&0x1f)) ; +} + +/* + Get Info about the current file in the zipfile, with internal only info +*/ +local int unzlocal_GetCurrentFileInfoInternal OF((unzFile file, + unz_file_info *pfile_info, + unz_file_info_internal + *pfile_info_internal, + char *szFileName, + uLong fileNameBufferSize, + void *extraField, + uLong extraFieldBufferSize, + char *szComment, + uLong commentBufferSize)); + +local int unzlocal_GetCurrentFileInfoInternal (file, + pfile_info, + pfile_info_internal, + szFileName, fileNameBufferSize, + extraField, extraFieldBufferSize, + szComment, commentBufferSize) +unzFile file; +unz_file_info *pfile_info; +unz_file_info_internal *pfile_info_internal; +char *szFileName; +uLong fileNameBufferSize; +void *extraField; +uLong extraFieldBufferSize; +char *szComment; +uLong commentBufferSize; +{ + unz_s* s; + unz_file_info file_info; + unz_file_info_internal file_info_internal; + int err=UNZ_OK; + uLong uMagic; + long lSeek=0; + + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + if (ZSEEK(s->z_filefunc, s->filestream, + s->pos_in_central_dir+s->byte_before_the_zipfile, + ZLIB_FILEFUNC_SEEK_SET)!=0) + err=UNZ_ERRNO; + + + /* we check the magic */ + if (err==UNZ_OK) { + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uMagic) != UNZ_OK) + err=UNZ_ERRNO; + else if (uMagic!=0x02014b50) + err=UNZ_BADZIPFILE; + } + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.version) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.version_needed) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.flag) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.compression_method) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info.dosDate) != UNZ_OK) + err=UNZ_ERRNO; + + unzlocal_DosDateToTmuDate(file_info.dosDate,&file_info.tmu_date); + + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info.crc) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info.compressed_size) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info.uncompressed_size) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.size_filename) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.size_file_extra) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.size_file_comment) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.disk_num_start) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.internal_fa) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info.external_fa) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info_internal.offset_curfile) != UNZ_OK) + err=UNZ_ERRNO; + + lSeek+=file_info.size_filename; + if ((err==UNZ_OK) && (szFileName!=NULL)) { + uLong uSizeRead ; + if (file_info.size_filename0) && (fileNameBufferSize>0)) + if (ZREAD(s->z_filefunc, s->filestream,szFileName,uSizeRead)!=uSizeRead) + err=UNZ_ERRNO; + lSeek -= uSizeRead; + } + + + if ((err==UNZ_OK) && (extraField!=NULL)) { + uLong uSizeRead ; + if (file_info.size_file_extraz_filefunc, s->filestream,lSeek,ZLIB_FILEFUNC_SEEK_CUR)==0) + lSeek=0; + else + err=UNZ_ERRNO; + } + + if ((file_info.size_file_extra>0) && (extraFieldBufferSize>0)) + if (ZREAD(s->z_filefunc, s->filestream,extraField,uSizeRead)!=uSizeRead) + err=UNZ_ERRNO; + lSeek += file_info.size_file_extra - uSizeRead; + } else + lSeek+=file_info.size_file_extra; + + + if ((err==UNZ_OK) && (szComment!=NULL)) { + uLong uSizeRead ; + if (file_info.size_file_commentz_filefunc, s->filestream,lSeek,ZLIB_FILEFUNC_SEEK_CUR)==0) + lSeek=0; + else + err=UNZ_ERRNO; + } + + if ((file_info.size_file_comment>0) && (commentBufferSize>0)) + if (ZREAD(s->z_filefunc, s->filestream,szComment,uSizeRead)!=uSizeRead) + err=UNZ_ERRNO; + lSeek+=file_info.size_file_comment - uSizeRead; + } else + lSeek+=file_info.size_file_comment; + + if ((err==UNZ_OK) && (pfile_info!=NULL)) + *pfile_info=file_info; + + if ((err==UNZ_OK) && (pfile_info_internal!=NULL)) + *pfile_info_internal=file_info_internal; + + return err; +} + + + +/* + Write info about the ZipFile in the *pglobal_info structure. + No preparation of the structure is needed + return UNZ_OK if there is no problem. +*/ +extern int ZEXPORT unzGetCurrentFileInfo (file, + pfile_info, + szFileName, fileNameBufferSize, + extraField, extraFieldBufferSize, + szComment, commentBufferSize) + unzFile file; +unz_file_info *pfile_info; +char *szFileName; +uLong fileNameBufferSize; +void *extraField; +uLong extraFieldBufferSize; +char *szComment; +uLong commentBufferSize; +{ + return unzlocal_GetCurrentFileInfoInternal(file,pfile_info,NULL, + szFileName,fileNameBufferSize, + extraField,extraFieldBufferSize, + szComment,commentBufferSize); +} + +/* + Set the current file of the zipfile to the first file. + return UNZ_OK if there is no problem +*/ +extern int ZEXPORT unzGoToFirstFile (file) + unzFile file; +{ + int err=UNZ_OK; + unz_s* s; + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + s->pos_in_central_dir=s->offset_central_dir; + s->num_file=0; + err=unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info, + &s->cur_file_info_internal, + NULL,0,NULL,0,NULL,0); + s->current_file_ok = (err == UNZ_OK); + return err; +} + +/* + Set the current file of the zipfile to the next file. + return UNZ_OK if there is no problem + return UNZ_END_OF_LIST_OF_FILE if the actual file was the latest. +*/ +extern int ZEXPORT unzGoToNextFile (file) + unzFile file; +{ + unz_s* s; + int err; + + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + if (!s->current_file_ok) + return UNZ_END_OF_LIST_OF_FILE; + if (s->gi.number_entry != 0xffff) /* 2^16 files overflow hack */ + if (s->num_file+1==s->gi.number_entry) + return UNZ_END_OF_LIST_OF_FILE; + + s->pos_in_central_dir += SIZECENTRALDIRITEM + s->cur_file_info.size_filename + + s->cur_file_info.size_file_extra + s->cur_file_info.size_file_comment ; + s->num_file++; + err = unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info, + &s->cur_file_info_internal, + NULL,0,NULL,0,NULL,0); + s->current_file_ok = (err == UNZ_OK); + return err; +} + + +/* + Try locate the file szFileName in the zipfile. + For the iCaseSensitivity signification, see unzipStringFileNameCompare + + return value : + UNZ_OK if the file is found. It becomes the current file. + UNZ_END_OF_LIST_OF_FILE if the file is not found +*/ +extern int ZEXPORT unzLocateFile (file, szFileName, iCaseSensitivity) + unzFile file; +const char *szFileName; +int iCaseSensitivity; +{ + unz_s* s; + int err; + + /* We remember the 'current' position in the file so that we can jump + * back there if we fail. + */ + unz_file_info cur_file_infoSaved; + unz_file_info_internal cur_file_info_internalSaved; + uLong num_fileSaved; + uLong pos_in_central_dirSaved; + + + if (file==NULL) + return UNZ_PARAMERROR; + + if (strlen(szFileName)>=UNZ_MAXFILENAMEINZIP) + return UNZ_PARAMERROR; + + s=(unz_s*)file; + if (!s->current_file_ok) + return UNZ_END_OF_LIST_OF_FILE; + + /* Save the current state */ + num_fileSaved = s->num_file; + pos_in_central_dirSaved = s->pos_in_central_dir; + cur_file_infoSaved = s->cur_file_info; + cur_file_info_internalSaved = s->cur_file_info_internal; + + err = unzGoToFirstFile(file); + + while (err == UNZ_OK) { + char szCurrentFileName[UNZ_MAXFILENAMEINZIP+1]; + err = unzGetCurrentFileInfo(file,NULL, + szCurrentFileName,sizeof(szCurrentFileName)-1, + NULL,0,NULL,0); + if (err == UNZ_OK) { + if (unzStringFileNameCompare(szCurrentFileName, + szFileName,iCaseSensitivity)==0) + return UNZ_OK; + err = unzGoToNextFile(file); + } + } + + /* We failed, so restore the state of the 'current file' to where we + * were. + */ + s->num_file = num_fileSaved ; + s->pos_in_central_dir = pos_in_central_dirSaved ; + s->cur_file_info = cur_file_infoSaved; + s->cur_file_info_internal = cur_file_info_internalSaved; + return err; +} + + +/* +/////////////////////////////////////////// +// Contributed by Ryan Haksi (mailto://cryogen@infoserve.net) +// I need random access +// +// Further optimization could be realized by adding an ability +// to cache the directory in memory. The goal being a single +// comprehensive file read to put the file I need in a memory. +*/ + +/* +typedef struct unz_file_pos_s +{ + uLong pos_in_zip_directory; // offset in file + uLong num_of_file; // # of file +} unz_file_pos; +*/ + +extern int ZEXPORT unzGetFilePos(file, file_pos) + unzFile file; +unz_file_pos* file_pos; +{ + unz_s* s; + + if (file==NULL || file_pos==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + if (!s->current_file_ok) + return UNZ_END_OF_LIST_OF_FILE; + + file_pos->pos_in_zip_directory = s->pos_in_central_dir; + file_pos->num_of_file = s->num_file; + + return UNZ_OK; +} + +extern int ZEXPORT unzGoToFilePos(file, file_pos) + unzFile file; +unz_file_pos* file_pos; +{ + unz_s* s; + int err; + + if (file==NULL || file_pos==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + + /* jump to the right spot */ + s->pos_in_central_dir = file_pos->pos_in_zip_directory; + s->num_file = file_pos->num_of_file; + + /* set the current file */ + err = unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info, + &s->cur_file_info_internal, + NULL,0,NULL,0,NULL,0); + /* return results */ + s->current_file_ok = (err == UNZ_OK); + return err; +} + +/* +// Unzip Helper Functions - should be here? +/////////////////////////////////////////// +*/ + +/* + Read the local header of the current zipfile + Check the coherency of the local header and info in the end of central + directory about this file + store in *piSizeVar the size of extra info in local header + (filename and size of extra field data) +*/ +local int unzlocal_CheckCurrentFileCoherencyHeader (s,piSizeVar, + poffset_local_extrafield, + psize_local_extrafield) +unz_s* s; +uInt* piSizeVar; +uLong *poffset_local_extrafield; +uInt *psize_local_extrafield; +{ + uLong uMagic,uData,uFlags; + uLong size_filename; + uLong size_extra_field; + int err=UNZ_OK; + + *piSizeVar = 0; + *poffset_local_extrafield = 0; + *psize_local_extrafield = 0; + + if (ZSEEK(s->z_filefunc, s->filestream,s->cur_file_info_internal.offset_curfile + + s->byte_before_the_zipfile,ZLIB_FILEFUNC_SEEK_SET)!=0) + return UNZ_ERRNO; + + + if (err==UNZ_OK) { + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uMagic) != UNZ_OK) + err=UNZ_ERRNO; + else if (uMagic!=0x04034b50) + err=UNZ_BADZIPFILE; + } + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&uData) != UNZ_OK) + err=UNZ_ERRNO; + /* + else if ((err==UNZ_OK) && (uData!=s->cur_file_info.wVersion)) + err=UNZ_BADZIPFILE; + */ + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&uFlags) != UNZ_OK) + err=UNZ_ERRNO; + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&uData) != UNZ_OK) + err=UNZ_ERRNO; + else if ((err==UNZ_OK) && (uData!=s->cur_file_info.compression_method)) + err=UNZ_BADZIPFILE; + + if ((err==UNZ_OK) && (s->cur_file_info.compression_method!=0) && + (s->cur_file_info.compression_method!=Z_DEFLATED)) + err=UNZ_BADZIPFILE; + + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uData) != UNZ_OK) /* date/time */ + err=UNZ_ERRNO; + + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uData) != UNZ_OK) /* crc */ + err=UNZ_ERRNO; + else if ((err==UNZ_OK) && (uData!=s->cur_file_info.crc) && + ((uFlags & 8)==0)) + err=UNZ_BADZIPFILE; + + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uData) != UNZ_OK) /* size compr */ + err=UNZ_ERRNO; + else if ((err==UNZ_OK) && (uData!=s->cur_file_info.compressed_size) && + ((uFlags & 8)==0)) + err=UNZ_BADZIPFILE; + + if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uData) != UNZ_OK) /* size uncompr */ + err=UNZ_ERRNO; + else if ((err==UNZ_OK) && (uData!=s->cur_file_info.uncompressed_size) && + ((uFlags & 8)==0)) + err=UNZ_BADZIPFILE; + + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&size_filename) != UNZ_OK) + err=UNZ_ERRNO; + else if ((err==UNZ_OK) && (size_filename!=s->cur_file_info.size_filename)) + err=UNZ_BADZIPFILE; + + *piSizeVar += (uInt)size_filename; + + if (unzlocal_getShort(&s->z_filefunc, s->filestream,&size_extra_field) != UNZ_OK) + err=UNZ_ERRNO; + *poffset_local_extrafield= s->cur_file_info_internal.offset_curfile + + SIZEZIPLOCALHEADER + size_filename; + *psize_local_extrafield = (uInt)size_extra_field; + + *piSizeVar += (uInt)size_extra_field; + + return err; +} + +/* + Open for reading data the current file in the zipfile. + If there is no error and the file is opened, the return value is UNZ_OK. +*/ +extern int ZEXPORT unzOpenCurrentFile3 (file, method, level, raw, password) + unzFile file; +int* method; +int* level; +int raw; +const char* password; +{ + int err=UNZ_OK; + uInt iSizeVar; + unz_s* s; + file_in_zip_read_info_s* pfile_in_zip_read_info; + uLong offset_local_extrafield; /* offset of the local extra field */ + uInt size_local_extrafield; /* size of the local extra field */ +# ifndef NOUNCRYPT + char source[12]; +# else + if (password != NULL) + return UNZ_PARAMERROR; +# endif + + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + if (!s->current_file_ok) + return UNZ_PARAMERROR; + + if (s->pfile_in_zip_read != NULL) + unzCloseCurrentFile(file); + + if (unzlocal_CheckCurrentFileCoherencyHeader(s,&iSizeVar, + &offset_local_extrafield,&size_local_extrafield)!=UNZ_OK) + return UNZ_BADZIPFILE; + + pfile_in_zip_read_info = (file_in_zip_read_info_s*) + ALLOC(sizeof(file_in_zip_read_info_s)); + if (pfile_in_zip_read_info==NULL) + return UNZ_INTERNALERROR; + + pfile_in_zip_read_info->read_buffer=(char*)ALLOC(UNZ_BUFSIZE); + pfile_in_zip_read_info->offset_local_extrafield = offset_local_extrafield; + pfile_in_zip_read_info->size_local_extrafield = size_local_extrafield; + pfile_in_zip_read_info->pos_local_extrafield=0; + pfile_in_zip_read_info->raw=raw; + + if (pfile_in_zip_read_info->read_buffer==NULL) { + TRYFREE(pfile_in_zip_read_info); + return UNZ_INTERNALERROR; + } + + pfile_in_zip_read_info->stream_initialised=0; + + if (method!=NULL) + *method = (int)s->cur_file_info.compression_method; + + if (level!=NULL) { + *level = 6; + switch (s->cur_file_info.flag & 0x06) { + case 6 : + *level = 1; + break; + case 4 : + *level = 2; + break; + case 2 : + *level = 9; + break; + } + } + + if ((s->cur_file_info.compression_method!=0) && + (s->cur_file_info.compression_method!=Z_DEFLATED)) + err=UNZ_BADZIPFILE; + + pfile_in_zip_read_info->crc32_wait=s->cur_file_info.crc; + pfile_in_zip_read_info->crc32=0; + pfile_in_zip_read_info->compression_method = + s->cur_file_info.compression_method; + pfile_in_zip_read_info->filestream=s->filestream; + pfile_in_zip_read_info->z_filefunc=s->z_filefunc; + pfile_in_zip_read_info->byte_before_the_zipfile=s->byte_before_the_zipfile; + + pfile_in_zip_read_info->stream.total_out = 0; + + if ((s->cur_file_info.compression_method==Z_DEFLATED) && + (!raw)) { + pfile_in_zip_read_info->stream.zalloc = (alloc_func)0; + pfile_in_zip_read_info->stream.zfree = (free_func)0; + pfile_in_zip_read_info->stream.opaque = (voidpf)0; + pfile_in_zip_read_info->stream.next_in = (voidpf)0; + pfile_in_zip_read_info->stream.avail_in = 0; + + err=inflateInit2(&pfile_in_zip_read_info->stream, -MAX_WBITS); + if (err == Z_OK) + pfile_in_zip_read_info->stream_initialised=1; + else { + TRYFREE(pfile_in_zip_read_info); + return err; + } + /* windowBits is passed < 0 to tell that there is no zlib header. + * Note that in this case inflate *requires* an extra "dummy" byte + * after the compressed stream in order to complete decompression and + * return Z_STREAM_END. + * In unzip, i don't wait absolutely Z_STREAM_END because I known the + * size of both compressed and uncompressed data + */ + } + pfile_in_zip_read_info->rest_read_compressed = + s->cur_file_info.compressed_size ; + pfile_in_zip_read_info->rest_read_uncompressed = + s->cur_file_info.uncompressed_size ; + + + pfile_in_zip_read_info->pos_in_zipfile = + s->cur_file_info_internal.offset_curfile + SIZEZIPLOCALHEADER + + iSizeVar; + + pfile_in_zip_read_info->stream.avail_in = (uInt)0; + + s->pfile_in_zip_read = pfile_in_zip_read_info; + +# ifndef NOUNCRYPT + if (password != NULL) { + int i; + s->pcrc_32_tab = get_crc_table(); + init_keys(password,s->keys,s->pcrc_32_tab); + if (ZSEEK(s->z_filefunc, s->filestream, + s->pfile_in_zip_read->pos_in_zipfile + + s->pfile_in_zip_read->byte_before_the_zipfile, + SEEK_SET)!=0) + return UNZ_INTERNALERROR; + if (ZREAD(s->z_filefunc, s->filestream,source, 12)<12) + return UNZ_INTERNALERROR; + + for (i = 0; i<12; i++) + zdecode(s->keys,s->pcrc_32_tab,source[i]); + + s->pfile_in_zip_read->pos_in_zipfile+=12; + s->encrypted=1; + } +# endif + + + return UNZ_OK; +} + +extern int ZEXPORT unzOpenCurrentFile (file) + unzFile file; +{ + return unzOpenCurrentFile3(file, NULL, NULL, 0, NULL); +} + +extern int ZEXPORT unzOpenCurrentFilePassword (file, password) + unzFile file; +const char* password; +{ + return unzOpenCurrentFile3(file, NULL, NULL, 0, password); +} + +extern int ZEXPORT unzOpenCurrentFile2 (file,method,level,raw) + unzFile file; +int* method; +int* level; +int raw; +{ + return unzOpenCurrentFile3(file, method, level, raw, NULL); +} + +/* + Read bytes from the current file. + buf contain buffer where data must be copied + len the size of buf. + + return the number of byte copied if somes bytes are copied + return 0 if the end of file was reached + return <0 with error code if there is an error + (UNZ_ERRNO for IO error, or zLib error for uncompress error) +*/ +extern int ZEXPORT unzReadCurrentFile (file, buf, len) + unzFile file; +voidp buf; +unsigned len; +{ + int err=UNZ_OK; + uInt iRead = 0; + unz_s* s; + file_in_zip_read_info_s* pfile_in_zip_read_info; + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + pfile_in_zip_read_info=s->pfile_in_zip_read; + + if (pfile_in_zip_read_info==NULL) + return UNZ_PARAMERROR; + + + if ((pfile_in_zip_read_info->read_buffer == NULL)) + return UNZ_END_OF_LIST_OF_FILE; + if (len==0) + return 0; + + pfile_in_zip_read_info->stream.next_out = (Bytef*)buf; + + pfile_in_zip_read_info->stream.avail_out = (uInt)len; + + if ((len>pfile_in_zip_read_info->rest_read_uncompressed) && + (!(pfile_in_zip_read_info->raw))) + pfile_in_zip_read_info->stream.avail_out = + (uInt)pfile_in_zip_read_info->rest_read_uncompressed; + + if ((len>pfile_in_zip_read_info->rest_read_compressed+ + pfile_in_zip_read_info->stream.avail_in) && + (pfile_in_zip_read_info->raw)) + pfile_in_zip_read_info->stream.avail_out = + (uInt)pfile_in_zip_read_info->rest_read_compressed+ + pfile_in_zip_read_info->stream.avail_in; + + while (pfile_in_zip_read_info->stream.avail_out>0) { + if ((pfile_in_zip_read_info->stream.avail_in==0) && + (pfile_in_zip_read_info->rest_read_compressed>0)) { + uInt uReadThis = UNZ_BUFSIZE; + if (pfile_in_zip_read_info->rest_read_compressedrest_read_compressed; + if (uReadThis == 0) + return UNZ_EOF; + if (ZSEEK(pfile_in_zip_read_info->z_filefunc, + pfile_in_zip_read_info->filestream, + pfile_in_zip_read_info->pos_in_zipfile + + pfile_in_zip_read_info->byte_before_the_zipfile, + ZLIB_FILEFUNC_SEEK_SET)!=0) + return UNZ_ERRNO; + if (ZREAD(pfile_in_zip_read_info->z_filefunc, + pfile_in_zip_read_info->filestream, + pfile_in_zip_read_info->read_buffer, + uReadThis)!=uReadThis) + return UNZ_ERRNO; + + +# ifndef NOUNCRYPT + if (s->encrypted) { + uInt i; + for (i=0;iread_buffer[i] = + zdecode(s->keys,s->pcrc_32_tab, + pfile_in_zip_read_info->read_buffer[i]); + } +# endif + + + pfile_in_zip_read_info->pos_in_zipfile += uReadThis; + + pfile_in_zip_read_info->rest_read_compressed-=uReadThis; + + pfile_in_zip_read_info->stream.next_in = + (Bytef*)pfile_in_zip_read_info->read_buffer; + pfile_in_zip_read_info->stream.avail_in = (uInt)uReadThis; + } + + if ((pfile_in_zip_read_info->compression_method==0) || (pfile_in_zip_read_info->raw)) { + uInt uDoCopy,i ; + + if ((pfile_in_zip_read_info->stream.avail_in == 0) && + (pfile_in_zip_read_info->rest_read_compressed == 0)) + return (iRead==0) ? UNZ_EOF : iRead; + + if (pfile_in_zip_read_info->stream.avail_out < + pfile_in_zip_read_info->stream.avail_in) + uDoCopy = pfile_in_zip_read_info->stream.avail_out ; + else + uDoCopy = pfile_in_zip_read_info->stream.avail_in ; + + for (i=0;istream.next_out+i) = + *(pfile_in_zip_read_info->stream.next_in+i); + + pfile_in_zip_read_info->crc32 = crc32(pfile_in_zip_read_info->crc32, + pfile_in_zip_read_info->stream.next_out, + uDoCopy); + pfile_in_zip_read_info->rest_read_uncompressed-=uDoCopy; + pfile_in_zip_read_info->stream.avail_in -= uDoCopy; + pfile_in_zip_read_info->stream.avail_out -= uDoCopy; + pfile_in_zip_read_info->stream.next_out += uDoCopy; + pfile_in_zip_read_info->stream.next_in += uDoCopy; + pfile_in_zip_read_info->stream.total_out += uDoCopy; + iRead += uDoCopy; + } else { + uLong uTotalOutBefore,uTotalOutAfter; + const Bytef *bufBefore; + uLong uOutThis; + int flush=Z_SYNC_FLUSH; + + uTotalOutBefore = pfile_in_zip_read_info->stream.total_out; + bufBefore = pfile_in_zip_read_info->stream.next_out; + + /* + if ((pfile_in_zip_read_info->rest_read_uncompressed == + pfile_in_zip_read_info->stream.avail_out) && + (pfile_in_zip_read_info->rest_read_compressed == 0)) + flush = Z_FINISH; + */ + err=inflate(&pfile_in_zip_read_info->stream,flush); + + if ((err>=0) && (pfile_in_zip_read_info->stream.msg!=NULL)) + err = Z_DATA_ERROR; + + uTotalOutAfter = pfile_in_zip_read_info->stream.total_out; + uOutThis = uTotalOutAfter-uTotalOutBefore; + + pfile_in_zip_read_info->crc32 = + crc32(pfile_in_zip_read_info->crc32,bufBefore, + (uInt)(uOutThis)); + + pfile_in_zip_read_info->rest_read_uncompressed -= + uOutThis; + + iRead += (uInt)(uTotalOutAfter - uTotalOutBefore); + + if (err==Z_STREAM_END) + return (iRead==0) ? UNZ_EOF : iRead; + if (err!=Z_OK) + break; + } + } + + if (err==Z_OK) + return iRead; + return err; +} + + +/* + Give the current position in uncompressed data +*/ +extern z_off_t ZEXPORT unztell (file) + unzFile file; +{ + unz_s* s; + file_in_zip_read_info_s* pfile_in_zip_read_info; + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + pfile_in_zip_read_info=s->pfile_in_zip_read; + + if (pfile_in_zip_read_info==NULL) + return UNZ_PARAMERROR; + + return (z_off_t)pfile_in_zip_read_info->stream.total_out; +} + + +/* + return 1 if the end of file was reached, 0 elsewhere +*/ +extern int ZEXPORT unzeof (file) + unzFile file; +{ + unz_s* s; + file_in_zip_read_info_s* pfile_in_zip_read_info; + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + pfile_in_zip_read_info=s->pfile_in_zip_read; + + if (pfile_in_zip_read_info==NULL) + return UNZ_PARAMERROR; + + if (pfile_in_zip_read_info->rest_read_uncompressed == 0) + return 1; + else + return 0; +} + + + +/* + Read extra field from the current file (opened by unzOpenCurrentFile) + This is the local-header version of the extra field (sometimes, there is + more info in the local-header version than in the central-header) + + if buf==NULL, it return the size of the local extra field that can be read + + if buf!=NULL, len is the size of the buffer, the extra header is copied in + buf. + the return value is the number of bytes copied in buf, or (if <0) + the error code +*/ +extern int ZEXPORT unzGetLocalExtrafield (file,buf,len) + unzFile file; +voidp buf; +unsigned len; +{ + unz_s* s; + file_in_zip_read_info_s* pfile_in_zip_read_info; + uInt read_now; + uLong size_to_read; + + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + pfile_in_zip_read_info=s->pfile_in_zip_read; + + if (pfile_in_zip_read_info==NULL) + return UNZ_PARAMERROR; + + size_to_read = (pfile_in_zip_read_info->size_local_extrafield - + pfile_in_zip_read_info->pos_local_extrafield); + + if (buf==NULL) + return (int)size_to_read; + + if (len>size_to_read) + read_now = (uInt)size_to_read; + else + read_now = (uInt)len ; + + if (read_now==0) + return 0; + + if (ZSEEK(pfile_in_zip_read_info->z_filefunc, + pfile_in_zip_read_info->filestream, + pfile_in_zip_read_info->offset_local_extrafield + + pfile_in_zip_read_info->pos_local_extrafield, + ZLIB_FILEFUNC_SEEK_SET)!=0) + return UNZ_ERRNO; + + if (ZREAD(pfile_in_zip_read_info->z_filefunc, + pfile_in_zip_read_info->filestream, + buf,read_now)!=read_now) + return UNZ_ERRNO; + + return (int)read_now; +} + +/* + Close the file in zip opened with unzipOpenCurrentFile + Return UNZ_CRCERROR if all the file was read but the CRC is not good +*/ +extern int ZEXPORT unzCloseCurrentFile (file) + unzFile file; +{ + int err=UNZ_OK; + + unz_s* s; + file_in_zip_read_info_s* pfile_in_zip_read_info; + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + pfile_in_zip_read_info=s->pfile_in_zip_read; + + if (pfile_in_zip_read_info==NULL) + return UNZ_PARAMERROR; + + + if ((pfile_in_zip_read_info->rest_read_uncompressed == 0) && + (!pfile_in_zip_read_info->raw)) { + if (pfile_in_zip_read_info->crc32 != pfile_in_zip_read_info->crc32_wait) + err=UNZ_CRCERROR; + } + + + TRYFREE(pfile_in_zip_read_info->read_buffer); + pfile_in_zip_read_info->read_buffer = NULL; + if (pfile_in_zip_read_info->stream_initialised) + inflateEnd(&pfile_in_zip_read_info->stream); + + pfile_in_zip_read_info->stream_initialised = 0; + TRYFREE(pfile_in_zip_read_info); + + s->pfile_in_zip_read=NULL; + + return err; +} + + +/* + Get the global comment string of the ZipFile, in the szComment buffer. + uSizeBuf is the size of the szComment buffer. + return the number of byte copied or an error code <0 +*/ +extern int ZEXPORT unzGetGlobalComment (file, szComment, uSizeBuf) + unzFile file; +char *szComment; +uLong uSizeBuf; +{ + unz_s* s; + uLong uReadThis ; + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + + uReadThis = uSizeBuf; + if (uReadThis>s->gi.size_comment) + uReadThis = s->gi.size_comment; + + if (ZSEEK(s->z_filefunc,s->filestream,s->central_pos+22,ZLIB_FILEFUNC_SEEK_SET)!=0) + return UNZ_ERRNO; + + if (uReadThis>0) { + *szComment='\0'; + if (ZREAD(s->z_filefunc,s->filestream,szComment,uReadThis)!=uReadThis) + return UNZ_ERRNO; + } + + if ((szComment != NULL) && (uSizeBuf > s->gi.size_comment)) + *(szComment+s->gi.size_comment)='\0'; + return (int)uReadThis; +} + +/* Additions by RX '2004 */ +extern uLong ZEXPORT unzGetOffset (file) + unzFile file; +{ + unz_s* s; + + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + if (!s->current_file_ok) + return 0; + if (s->gi.number_entry != 0 && s->gi.number_entry != 0xffff) + if (s->num_file==s->gi.number_entry) + return 0; + return s->pos_in_central_dir; +} + +extern int ZEXPORT unzSetOffset (file, pos) + unzFile file; +uLong pos; +{ + unz_s* s; + int err; + + if (file==NULL) + return UNZ_PARAMERROR; + s=(unz_s*)file; + + s->pos_in_central_dir = pos; + s->num_file = s->gi.number_entry; /* hack */ + err = unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info, + &s->cur_file_info_internal, + NULL,0,NULL,0,NULL,0); + s->current_file_ok = (err == UNZ_OK); + return err; +} diff --git a/source/unzip/unzip.h b/source/unzip/unzip.h new file mode 100644 index 00000000..a331fdfc --- /dev/null +++ b/source/unzip/unzip.h @@ -0,0 +1,354 @@ +/* unzip.h -- IO for uncompress .zip files using zlib + Version 1.01e, February 12th, 2005 + + Copyright (C) 1998-2005 Gilles Vollant + + This unzip package allow extract file from .ZIP file, compatible with PKZip 2.04g + WinZip, InfoZip tools and compatible. + + Multi volume ZipFile (span) are not supported. + Encryption compatible with pkzip 2.04g only supported + Old compressions used by old PKZip 1.x are not supported + + + I WAIT FEEDBACK at mail info@winimage.com + Visit also http://www.winimage.com/zLibDll/unzip.htm for evolution + + Condition of use and distribution are the same than zlib : + + This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. + + +*/ + +/* for more info about .ZIP format, see + http://www.info-zip.org/pub/infozip/doc/appnote-981119-iz.zip + http://www.info-zip.org/pub/infozip/doc/ + PkWare has also a specification at : + ftp://ftp.pkware.com/probdesc.zip +*/ + +#ifndef _unz_H +#define _unz_H + +#ifdef __cplusplus +extern "C" { +#endif + +#include "utils.h" + +#ifndef _ZLIB_H +#include "zlib.h" +#endif + +#ifndef _ZLIBIOAPI_H +#include "ioapi.h" +#endif + +#if defined(STRICTUNZIP) || defined(STRICTZIPUNZIP) + /* like the STRICT of WIN32, we define a pointer that cannot be converted + from (void*) without cast */ + typedef struct TagunzFile__ { + int unused; + } unzFile__; + typedef unzFile__ *unzFile; +#else + typedef voidp unzFile; +#endif + + +#define UNZ_OK (0) +#define UNZ_END_OF_LIST_OF_FILE (-100) +#define UNZ_ERRNO (Z_ERRNO) +#define UNZ_EOF (0) +#define UNZ_PARAMERROR (-102) +#define UNZ_BADZIPFILE (-103) +#define UNZ_INTERNALERROR (-104) +#define UNZ_CRCERROR (-105) + + /* tm_unz contain date/time info */ + typedef struct tm_unz_s { + uInt tm_sec; /* seconds after the minute - [0,59] */ + uInt tm_min; /* minutes after the hour - [0,59] */ + uInt tm_hour; /* hours since midnight - [0,23] */ + uInt tm_mday; /* day of the month - [1,31] */ + uInt tm_mon; /* months since January - [0,11] */ + uInt tm_year; /* years - [1980..2044] */ + } tm_unz; + + /* unz_global_info structure contain global data about the ZIPfile + These data comes from the end of central dir */ + typedef struct unz_global_info_s { + uLong number_entry; /* total number of entries in + the central dir on this disk */ + uLong size_comment; /* size of the global comment of the zipfile */ + } unz_global_info; + + + /* unz_file_info contain information about a file in the zipfile */ + typedef struct unz_file_info_s { + uLong version; /* version made by 2 bytes */ + uLong version_needed; /* version needed to extract 2 bytes */ + uLong flag; /* general purpose bit flag 2 bytes */ + uLong compression_method; /* compression method 2 bytes */ + uLong dosDate; /* last mod file date in Dos fmt 4 bytes */ + uLong crc; /* crc-32 4 bytes */ + uLong compressed_size; /* compressed size 4 bytes */ + uLong uncompressed_size; /* uncompressed size 4 bytes */ + uLong size_filename; /* filename length 2 bytes */ + uLong size_file_extra; /* extra field length 2 bytes */ + uLong size_file_comment; /* file comment length 2 bytes */ + + uLong disk_num_start; /* disk number start 2 bytes */ + uLong internal_fa; /* internal file attributes 2 bytes */ + uLong external_fa; /* external file attributes 4 bytes */ + + tm_unz tmu_date; + } unz_file_info; + + extern int ZEXPORT unzStringFileNameCompare OF ((const char* fileName1, + const char* fileName2, + int iCaseSensitivity)); + /* + Compare two filename (fileName1,fileName2). + If iCaseSenisivity = 1, comparision is case sensitivity (like strcmp) + If iCaseSenisivity = 2, comparision is not case sensitivity (like strcmpi + or strcasecmp) + If iCaseSenisivity = 0, case sensitivity is defaut of your operating system + (like 1 on Unix, 2 on Windows) + */ + + + extern unzFile ZEXPORT unzOpen OF((const char *path)); + /* + Open a Zip file. path contain the full pathname (by example, + on a Windows XP computer "c:\\zlib\\zlib113.zip" or on an Unix computer + "zlib/zlib113.zip". + If the zipfile cannot be opened (file don't exist or in not valid), the + return value is NULL. + Else, the return value is a unzFile Handle, usable with other function + of this unzip package. + */ + + extern unzFile ZEXPORT unzOpen2 OF((const char *path, + zlib_filefunc_def* pzlib_filefunc_def)); + /* + Open a Zip file, like unzOpen, but provide a set of file low level API + for read/write the zip file (see ioapi.h) + */ + + extern int ZEXPORT unzClose OF((unzFile file)); + /* + Close a ZipFile opened with unzipOpen. + If there is files inside the .Zip opened with unzOpenCurrentFile (see later), + these files MUST be closed with unzipCloseCurrentFile before call unzipClose. + return UNZ_OK if there is no problem. */ + + extern int ZEXPORT unzGetGlobalInfo OF((unzFile file, + unz_global_info *pglobal_info)); + /* + Write info about the ZipFile in the *pglobal_info structure. + No preparation of the structure is needed + return UNZ_OK if there is no problem. */ + + + extern int ZEXPORT unzGetGlobalComment OF((unzFile file, + char *szComment, + uLong uSizeBuf)); + /* + Get the global comment string of the ZipFile, in the szComment buffer. + uSizeBuf is the size of the szComment buffer. + return the number of byte copied or an error code <0 + */ + + + /***************************************************************************/ + /* Unzip package allow you browse the directory of the zipfile */ + + extern int ZEXPORT unzGoToFirstFile OF((unzFile file)); + /* + Set the current file of the zipfile to the first file. + return UNZ_OK if there is no problem + */ + + extern int ZEXPORT unzGoToNextFile OF((unzFile file)); + /* + Set the current file of the zipfile to the next file. + return UNZ_OK if there is no problem + return UNZ_END_OF_LIST_OF_FILE if the actual file was the latest. + */ + + extern int ZEXPORT unzLocateFile OF((unzFile file, + const char *szFileName, + int iCaseSensitivity)); + /* + Try locate the file szFileName in the zipfile. + For the iCaseSensitivity signification, see unzStringFileNameCompare + + return value : + UNZ_OK if the file is found. It becomes the current file. + UNZ_END_OF_LIST_OF_FILE if the file is not found + */ + + + /* ****************************************** */ + /* Ryan supplied functions */ + /* unz_file_info contain information about a file in the zipfile */ + typedef struct unz_file_pos_s { + uLong pos_in_zip_directory; /* offset in zip file directory */ + uLong num_of_file; /* # of file */ + } unz_file_pos; + + extern int ZEXPORT unzGetFilePos( + unzFile file, + unz_file_pos* file_pos); + + extern int ZEXPORT unzGoToFilePos( + unzFile file, + unz_file_pos* file_pos); + + /* ****************************************** */ + + extern int ZEXPORT unzGetCurrentFileInfo OF((unzFile file, + unz_file_info *pfile_info, + char *szFileName, + uLong fileNameBufferSize, + void *extraField, + uLong extraFieldBufferSize, + char *szComment, + uLong commentBufferSize)); + /* + Get Info about the current file + if pfile_info!=NULL, the *pfile_info structure will contain somes info about + the current file + if szFileName!=NULL, the filemane string will be copied in szFileName + (fileNameBufferSize is the size of the buffer) + if extraField!=NULL, the extra field information will be copied in extraField + (extraFieldBufferSize is the size of the buffer). + This is the Central-header version of the extra field + if szComment!=NULL, the comment string of the file will be copied in szComment + (commentBufferSize is the size of the buffer) + */ + + /***************************************************************************/ + /* for reading the content of the current zipfile, you can open it, read data + from it, and close it (you can close it before reading all the file) + */ + + extern int ZEXPORT unzOpenCurrentFile OF((unzFile file)); + /* + Open for reading data the current file in the zipfile. + If there is no error, the return value is UNZ_OK. + */ + + extern int ZEXPORT unzOpenCurrentFilePassword OF((unzFile file, + const char* password)); + /* + Open for reading data the current file in the zipfile. + password is a crypting password + If there is no error, the return value is UNZ_OK. + */ + + extern int ZEXPORT unzOpenCurrentFile2 OF((unzFile file, + int* method, + int* level, + int raw)); + /* + Same than unzOpenCurrentFile, but open for read raw the file (not uncompress) + if raw==1 + *method will receive method of compression, *level will receive level of + compression + note : you can set level parameter as NULL (if you did not want known level, + but you CANNOT set method parameter as NULL + */ + + extern int ZEXPORT unzOpenCurrentFile3 OF((unzFile file, + int* method, + int* level, + int raw, + const char* password)); + /* + Same than unzOpenCurrentFile, but open for read raw the file (not uncompress) + if raw==1 + *method will receive method of compression, *level will receive level of + compression + note : you can set level parameter as NULL (if you did not want known level, + but you CANNOT set method parameter as NULL + */ + + + extern int ZEXPORT unzCloseCurrentFile OF((unzFile file)); + /* + Close the file in zip opened with unzOpenCurrentFile + Return UNZ_CRCERROR if all the file was read but the CRC is not good + */ + + extern int ZEXPORT unzReadCurrentFile OF((unzFile file, + voidp buf, + unsigned len)); + /* + Read bytes from the current file (opened by unzOpenCurrentFile) + buf contain buffer where data must be copied + len the size of buf. + + return the number of byte copied if somes bytes are copied + return 0 if the end of file was reached + return <0 with error code if there is an error + (UNZ_ERRNO for IO error, or zLib error for uncompress error) + */ + + extern z_off_t ZEXPORT unztell OF((unzFile file)); + /* + Give the current position in uncompressed data + */ + + extern int ZEXPORT unzeof OF((unzFile file)); + /* + return 1 if the end of file was reached, 0 elsewhere + */ + + extern int ZEXPORT unzGetLocalExtrafield OF((unzFile file, + voidp buf, + unsigned len)); + /* + Read extra field from the current file (opened by unzOpenCurrentFile) + This is the local-header version of the extra field (sometimes, there is + more info in the local-header version than in the central-header) + + if buf==NULL, it return the size of the local extra field + + if buf!=NULL, len is the size of the buffer, the extra header is copied in + buf. + the return value is the number of bytes copied in buf, or (if <0) + the error code + */ + + /***************************************************************************/ + + /* Get the current file offset */ + extern uLong ZEXPORT unzGetOffset (unzFile file); + + /* Set the current file offset */ + extern int ZEXPORT unzSetOffset (unzFile file, uLong pos); + + + +#ifdef __cplusplus +} +#endif + +#endif /* _unz_H */ diff --git a/source/wstringEx/wstringEx.cpp b/source/wstringEx/wstringEx.cpp new file mode 100644 index 00000000..b63bf639 --- /dev/null +++ b/source/wstringEx/wstringEx.cpp @@ -0,0 +1,152 @@ + +#include "wstringEx.hpp" + +using namespace std; + +wstringEx::wstringEx(const wchar_t *s) : + std::basic_string, std::allocator >(s) +{ +} + +wstringEx::wstringEx(const basic_string, allocator > &ws) : + basic_string, allocator >(ws) +{ +} + +wstringEx::wstringEx(const string &s) +{ + std::string::size_type size; + + size = s.size(); + resize(size); + for (std::string::size_type i = 0; i < size; ++i) + (*this)[i] = (unsigned char)s[i]; +} + +wstringEx &wstringEx::operator=(const string &s) +{ + std::string::size_type size; + + size = s.size(); + this->resize(size); + for (std::string::size_type i = 0; i < size; ++i) + (*this)[i] = (unsigned char)s[i]; + return *this; +} + +static size_t utf8Len(const char *s) +{ + size_t len = 0; + + for (int i = 0; s[i] != 0; ) + { + if ((s[i] & 0xF8) == 0xF0) + { + if (((s[i + 1] & 0xC0) != 0x80) || ((s[i + 2] & 0xC0) != 0x80) || ((s[i + 3] & 0xC0) != 0x80)) + return 0; + ++len; + i += 4; + } + else if ((s[i] & 0xF0) == 0xE0) + { + if (((s[i + 1] & 0xC0) != 0x80) || ((s[i + 2] & 0xC0) != 0x80)) + return 0; + ++len; + i += 3; + } + else if ((s[i] & 0xE0) == 0xC0) + { + if (((s[i + 1] & 0xC0) != 0x80)) + return 0; + ++len; + i += 2; + } + else if ((s[i] & 0x80) == 0x00) + { + ++len; + ++i; + } + else + return 0; + } + return len; +} + +void wstringEx::fromUTF8(const char *s) +{ + size_t len = utf8Len(s); + + clear(); + if (len == 0) + return; + reserve(len); + for (int i = 0; s[i] != 0; ) + { + if ((s[i] & 0xF8) == 0xF0) + { + push_back(((wchar_t)(s[i] & 0x07) << 18) | ((wchar_t)(s[i + 1] & 0x3F) << 12) | ((wchar_t)(s[i + 2] & 0x3F) << 6) | (wchar_t)(s[i + 3] & 0x3F)); + i += 4; + } + else if ((s[i] & 0xF0) == 0xE0) + { + push_back(((wchar_t)(s[i] & 0x0F) << 12) | ((wchar_t)(s[i + 1] & 0x3F) << 6) | (wchar_t)(s[i + 2] & 0x3F)); + i += 3; + } + else if ((s[i] & 0xE0) == 0xC0) + { + push_back(((wchar_t)(s[i] & 0x1F) << 6) | (wchar_t)(s[i + 1] & 0x3F)); + i += 2; + } + else + { + push_back((wchar_t)s[i]); + ++i; + } + } +} + +string wstringEx::toUTF8(void) const +{ + string s; + size_t len = 0; + wchar_t wc; + + for (size_t i = 0; i < size(); ++i) + { + wc = operator[](i); + if (wc < 0x80) + ++len; + else if (wc < 0x800) + len += 2; + else if (wc < 0x10000) + len += 3; + else + len += 4; + } + s.reserve(len); + for (size_t i = 0; i < size(); ++i) + { + wc = operator[](i); + if (wc < 0x80) + s.push_back((char)wc); + else if (wc < 0x800) + { + s.push_back((char)((wc >> 6) | 0xC0)); + s.push_back((char)((wc & 0x3F) | 0x80)); + } + else if (wc < 0x10000) + { + s.push_back((char)((wc >> 12) | 0xE0)); + s.push_back((char)(((wc >> 6) & 0x3F) | 0x80)); + s.push_back((char)((wc & 0x3F) | 0x80)); + } + else + { + s.push_back((char)(((wc >> 18) & 0x07) | 0xF0)); + s.push_back((char)(((wc >> 12) & 0x3F) | 0x80)); + s.push_back((char)(((wc >> 6) & 0x3F) | 0x80)); + s.push_back((char)((wc & 0x3F) | 0x80)); + } + } + return s; +} diff --git a/source/wstringEx/wstringEx.hpp b/source/wstringEx/wstringEx.hpp new file mode 100644 index 00000000..7ad95975 --- /dev/null +++ b/source/wstringEx/wstringEx.hpp @@ -0,0 +1,21 @@ + +#ifndef __WSTRINGEX_HPP +#define __WSTRINGEX_HPP + +#include + +class wstringEx : public std::basic_string, std::allocator > +{ +public: + wstringEx(void) { } + wstringEx(const wchar_t *s); + wstringEx(const std::basic_string, std::allocator > &ws); + wstringEx(const std::string &s); + wstringEx &operator=(const std::string &s); + void fromUTF8(const char *s); + std::string toUTF8(void) const; +}; + + +#endif // !defined(__WSTRINGEX_HPP) + diff --git a/wii/apps/wiiflow/icon.png b/wii/apps/wiiflow/icon.png new file mode 100644 index 0000000000000000000000000000000000000000..cadd7d90d6f99f7de875a8af518722dc4ffe792e GIT binary patch literal 19236 zcmeHPc{r5o`+x0aONg{tB4n6-H73Il$M*2)=JS4lB1HP>~+dg zrzqk`*;=$X*(yT%y`xQ?^F6=sT-W*jH}7>l_q=mIpZk8E=W~DV*Za?ix3StNCB8x& z001d-GYS>_i~BLwC2( zi2y*j#ISQ@J6dig(3pODu3U^>h+hC04FJRqApx#5A39sbjqb_tH&7d?u2)lGxErWB zpe~01TcXgo$aa;;^*rhNC+`do6k!C@40TM zn#w$c?PH+!c~g#-HY&zU7F`9U2iK*+kQfydMh}6-U=c8giY3!u#gy)*0>`T$U@)u- z0zrTy2`Hq>mrIQ#4&D)2?j8gx#q`UX;5P#`FE%@X0EGqz2kQkR^_VPAC>)Q+LtzLg z0-*~cbOS^E*{&hF{();hC;6I(LJy>|7y)bsxHLDfs~acfat#RZWzbx?C5LkS-M)*e;%j7}U1$IuN~H%fgIF~1S?2M*d%yIUr6s5)7K1}~H)S#X=2a8m z$_k`&0}a%^MlS43Zs7dV1crYg+tr^&H>Z$-f*9@ugsCZ>g29Q$gd^*&Vcz(2f-Pk$wnp=vI!Oq=dMV`;!I7*csK=yCZpg;GXRt}2)aEzyll$i=EAUtx zI)&j$4+LY-7zhH51qTiscnByu2m*@&2k670AZR2E9B}X+^y82a1ReuH!r%}j90v|O z1dRX(5&`FRhciV`&?vMK#)NE4hGS4L7z&2N zqQOVf{KkLS*_UnqYdWBZF#dxMxHEs%0oO~gVT90q9Vra3GXuG`g(Gl8=-}Qrm*>RdkXrD82b)3w%Grf8Y#>!C_Dk6bz4n&0DZeSUBRdMa+9X zTO{a5!#`tC5N;H9-hwp+>jip13wlsEG;H32^#t$1YJwK5KNbn9gKI%NXz^T&1CgNR zu7w1(!nNF0kf4UR7K{b$d@QIS6dVQ4axJ)9(0=w{=kIY`iwE}!+Ib8f4c=oBTt606 z8)!jIqTqNiC)aXg@i=ZQ9>>Mtaa;@@Kaat~=kK}M@blU5ch8k2Ew@bPJk#*$6ZFeKc_2#ZG{O)z*P?!#cdm_JnPA65QY``}9}_|gph_SU@M zNe({D|5w*{o&B#?0Q2$};fY*6U3|KDVt^+wUtN5;CbS@c}= zK8mW5pN7{mqxco^n>4(2*2g8;l`-tMEZr7gVdPgxp&S!+tE8SkBP%Vk-pqov+jo(< zoc>rgbL2g3+9TLw^fr^9#urh%!A_?JV(5VxoUWs3Sf>9QX~Ucd9J0 zx_xwHXQ6f>&1R%uz7r#eeqCNWYq%dREh%|1;zSN-EW&9nOIA&D-MTf^smBYS3%VXy z($JJ(bNb9o-PlUY46DKsqt!zb?xzcih@7daYrT)(9Y#86CCe4$V>^MUvztk~_PoC; z{wmb6zB-2#zFQXvnpArRkK2$~Cvmfs6q_?U(?5YXxt@9dbXwC~S5LWacTGjX`Hx+| z{w5`voHqinr^2=PrMsp-JUCaq&dRbc=+z^Lw*0Sa+iI4)@>wOLVW0oR2JyCg89Hg8 zzweWhiTD06q{I9DPh;{QSSaeM3t3dR>`HPsZ{Y;=aSDAOE3c^uzt{gV>yZgZz?68l zEDu#n&6zDT{c!q^>xXYhbrq}Vh=qwIS$>?!n$&C^24J(2W_^<{Y@n~-jIP%i3XFSD zaCfKU-moyv%*(*bBGQ7Q`xSGnE|D~vG%n}wm{{)nB59LyM|Irb9>rkw40idkvkCfU zo_k7({!U{_Mjv0LeY8;6aW7curI(NDh1qA>36fFicj5HOBR-tBj>I*6Z$CY~xWmv; zI(1osCLnCla)@rBQ2XIc{GaWLT6DXm_=d^!*V%UB%nT$7RQIlutOg zb(hi=nP;nx1qWO{J)T-WLhcJ^PQeG(9r`f!Yi(`q677?Fa!5;pM6XI+kWaX2y-(x{ z%+utJnfRx3>=sjOWt8@*w1=6Dk{farfZaf_!PU@XSs@!Y_`3`J5h9^cKNza_DV{?e74=wm#r&emuuB!I#z5? z+b9_IdjC`VX9eRS59UsZ9DMw~19j-SXY<^~s@OG^q~z!NrK_%uM5@QWI3Pb!C$YZw zF?OugxX|yw*!%WZHcNDO)vXeXCdcod=Sm=N<|9qTBnT_ zeKe2&3K}G-Zi-HyD2Imoo+~#UHvFKLqfe3iMN-C?8nJHh3i(XxHe2V#Lc-@8VueYYFWpD@0z(s-pbq5a~kS)%`8Ekw0TSJF|Tp2p@Ecgu`!JExq$ z?AkrqdF}q$OR@}hANTxd&~q(SU{rynk*4`%zv!s}0hh)-b?luS$4_>Y zPve=-JcG4M?{Aile1DN+_3YBXQ0ppYm3Ioczzcs*!O(cghzqvtm-A!IKBmUwMPs(~ z8t+I`YeUpIL6^+bO_FX~>M%E7cKM_tsJGoAI`TEX2BG75L!VR?aOznuA?f!w2<`3a z7wzx90nO|f6TY?YSkt0CqRpF31YANw9Lv`zl{VDtLc0Cmz8WvAxuqbjUAEpjZU_$G zgGP}x`-cF%hDS5yknSscME}e|!7UZe=B2KzN(NL&J1PL^2AC+zTQKU4mnR}?#R?yX zhaQw&>P*v#%u2i4qT#eQ>@wk+2$$D)XkK1s*!R2Dq*Y5+|GKp37l(l6!AhTFRVYX3 z2KxxFX-)As!RquBp=)pw3jK9g*8awL@YsGS zkhfFhu9%^HV{?q*bK13*qG~!tuz@+!auoVecBVsDHSqQAa}2%X%Nr)%5st4DT{OM* znCFLyO~2q1b@bHM-Xt9o!EuHi8zWbSXhVRH?vB8x&0DAf7d6TxhN)YfHp`aEaLzRz z?EE!h>$yk`LfQEO@t~bf8Zw7V!yYJB>(N;v)QsP&JMJhi6`EQz7lD=;78hvHE_#j_ z*2#8Dbjb_4ms+7GRjXsvx&63)jLS|rIk~LpXaVYOtLT{3?=ZKk7boN$&_lTmQ;mC* z-)RMqW-nb41h5ony%f8+kmjs#FFt+lR=QH}P`yADYSm2djY+`JdSi1D8=q#f_kNo7 z(&LY5s21^a9s+KQ-&cjttt0lT3zaBDNCMdsfJ}x!e|qCuARwmw^3tRh6{QSuz=?h! z|2*-!keL4DpE9NTsFm!noVn58S_B7(z8XkPi|zQ{Sn1~-GvDKgx?=oQtpoQ z2)w-%CX^ed+tAU`K_fDA^DCp3!$$=;OZ2C@Wti)hvuf#yLhX2^@YAbz95<-CVQb6KtKR2Pzu#(woo5)UKcY7ZUs%TJE>Txp zeIU~56w(6X&U}AFhs{YChr~)0C~tjnK^FhXa&*I?hjS;*LXvbAQXG-nq)u1a<4|l1|)I~(E9k!a9L{RD%zZi-lwY*d)5b?RTVfTr%jNk6I*m*(r zge)TYKXqw&?dEPpyUGeS{4}I;U2$Vdxy^+qt<4i7lHrl#C1MW6S5l@zC1UQn`?^#r z3+DK>JWoHtbnK2%o|@jUu6biS{&`1srt7NOz>px5XSHL!>iF@w18#3T({6XSDUn8vef`W!CpXpG$TYjSWo0Ho?n zozzO{lWK4bAG{HN`H{}E6N-?d!lSd28GD}07Bf~RA4wO6x(NftDNmk6BDKh0#cTFO;A+?c8W?| z<3L_Yffyo}DHY$bao?;{lAn-dyP~JR-{k`0xyzR5PR{JqSokC5%~k_vA3Zqv?#(f+ z>?bYh(Y{TQ%EODIo`wSy0jfxpA3pkbvo*z#w>1E86%oZo5Je_9VpBJl#|9leW>kIb zj#sdSrp@(fwq{RSHdSv|cMs*gffxC-mSWViZQxsm_ldQ=Qv#NyK=JB_0eurLy-o6p zyYb=S(uubR!~Z;vj~~;_wO%s~IhYx&bI4+X7>&%-?@KP}GaD+>2q^-zx~(GCnCC7B z>`%w180}cjER4i!zwOjK79Jp&f+46b-^uc{5QNI_nTav}gYyC@wHIQ4i2#&URO|;- zQZ__yy@BeK_PfHgvXmF8YH5-u#!i%LwO*U>-dXPbz)0BJHmf~Gr9xCfCRzT~XwcS| zc8{}&+Nb~l1+AkK`#9BZ@io>xK~hS9^pmc!^bd^DY^SKU<*qwTuitJ>Q2OH!EEvVB0TBNdXi|m;;SknCNV1=CN70dw#f1DJ8N~kWt4l$RHUEUwB|u*6E!MNutDb57Tu`kZlP_-w{x7Y7E4X) z7Dcu$Vk;VCh#w{Ei~1d@R)AXz0At0M9|^J#g(e<3vd+9+F>3~$wr>-2Qdkdw00k?T zzS)2M2==H*K!dtOR$9!qRe@%Dz|&#N z=f`r{9)0)?#4Nc8+I0Pvu@GjnL_k?QW}%l3iabGBjd8HEm;xW#{YvajirwQ{~WszQB_Q>~IFc zh!E*B%l9QtG2WWTh$;Y$=kG>q#!W9iC9j)q@jkLW`bs}>Tbl<38%lj4i8!{evU{ll zP#LWsc#hRQcqZ?TEZL!hs4YLK8(&8c+4Bm9u3NLA>m+yyxwu$Fe>hZAVIgplsV%Y8 zJeRmg-6PRFmjlzyI6h$}F69hV`xdR$PIZckA!)x&&)#hlA2+?7`0{cg#2XGfOWHx& z-dB2A>7lRvrDj24y(rCqevG2VzEoIBsGC?i!$f^wA#iX4o)DVl+__3HQ+2Absp-zZ zz(A&&rl^&S8{nPp>p=R&)=fpi3DOeUH=r-jEf_UN%)0l{-pOv8HD?hVZJtZOr#^Ym zp&7UB2!U}-bMH2@msH|!FHN2;OFKwSSOLhRHl}1+4D}I>f{b5-5(^T7(K3ejsi_!4imo5DxEAsI9IHEwux`FyV!Ks)-fJz%9mMYb;Ur6bIHFX#g zs~NZT77A`Qbz!Y;ub#*7nY?zj^dx72d@+SH!5CV2$EAGXgpJGMmdiHm=sD;ZQ5Sob zc2c6=!dcZ$j_4g@ybLI@DctfKJtYB%9TeRpC!WqERB~aY!%AdQzD5~3%jWwH=bvcD_>+V;_aM2KHg|zUa&Q8XmOZKth(E=REV=J zm9s=*_V9T4IeVIwOShm*rCqFuR%`1}6Oglrz4WzFG6_W!cErph($ literal 0 HcmV?d00001 diff --git a/wii/apps/wiiflow/meta.xml b/wii/apps/wiiflow/meta.xml new file mode 100644 index 00000000..1fba551a --- /dev/null +++ b/wii/apps/wiiflow/meta.xml @@ -0,0 +1,50 @@ + + + WiiFlow + r-win, Miigotu + r416 + TBD + USB Loader / Nand Emulator + WiiFlow is a Wii Game, Channel, Wiiware, Virtual Console, and Savegame Emulator intended for use with legal backups. +Controls : +- Main menu (coverflow) : +-- Up / Down Previous / next game (vertical) +-- Left / Right Previous / next game (horizontal) +-- A Select game +-- B+A Launch game immediately +-- B+Home Reload Wiiflow +-- Home Exit +-- 1 / 2 Previous / next coverflow mode +-- B+Left / B+Right Change Song +-- B+UP / B+DOWN Alphabetic search +-- B+Minus Switch Partition +-- B+Plus Sort Games +-- Minus+Home Exit to Homebrew Channel +-- Plus+Home Exit to System Menu +-- 1+Home Exit to Priiloader +-- 2+Home Exit to BootMii + +-- Minus+A on Exit Icon Exit to Homebrew Channel +-- Plus+A on Exit Icon Exit to System Menu +-- 1+A on Exit Icon Exit to Priiloader +-- 2+A on Exit Icon Exit to BootMii +-- B on View Icon Enable/Disable Nand emulator + +- Game : +-- A on box Show the backside +-- A out of screen Launch game +-- B Back to coverflow +-- Minus / Plus Previous / next game (vertical) +-- Left / Right Previous / next game (horizontal) + +- Settings menus : +-- Minus / Plus Previous / next page +-- Left / Right Previous / next page + +- Coverflow settings : +-- B+Minus / B+Plus Previous / next page +-- B Faster adjustement (B+A instead of just A to click a button) +-- B+1 Copy whole coverflow +-- B+2 Paste coverflow + + \ No newline at end of file diff --git a/wii/apps/wiiflow/wiiflow.ini b/wii/apps/wiiflow/wiiflow.ini new file mode 100644 index 00000000..a0c9ab3e --- /dev/null +++ b/wii/apps/wiiflow/wiiflow.ini @@ -0,0 +1,121 @@ +[GAMERCARD] +#Boolean: Enable the gamercards notification code - Defaults to false +wiinnertag_enable= +#Vectored String: URL's of the gamercard services, seperated by | +gamercards= + +[GAMES] +#Integer: The currently selected partition for Wii Games, defaults to the first partition with a WBFS folder, or the apps/wiiflow dir otherwise. +partition= +#Boolean: Whether to redirect Wii Saves to USB, Nand emulation must be enabled - Defaults to false +save_emulation= +#Boolean: Whether to use full emulation or partial for savegame emulation - Defaults to false +full_emulation= +#Boolean: Enable or disable cheating/ocarina globally - Defaults to false +cheat= +#Boolean: Whether the favorites view is currently selected or not - Defaults to false +favorites= +#Boolean: Whether to dump the game list to wiiflow/settings/titlesdump.ini - True until the list is dumped, then is false +dump_list= +#Integer: The currently selected coverflow layout - Defaults to 1 +last_cf_mode= +#Integer: The currently selected sorting method - Defaults to 0 (Alphabetical) +sort= + +[GENERAL] +#Boolean: Hide the coverflow icons to switch modes - Defaults to false +hideviews= +#Boolean: Whether to favorites view is selected on boot - Defaults to false +favorites_on_startup= +#Boolean: To configure watchdog for the ehci Module in d2xv7, not in use until v7 ehci is stable, ehci v6 has time hardcoded to 10s - Defaults to 10 +watchdog_timeout= +#String: Name of the currently selected theme - Defaults to DEFAULT +theme= +#Integer: Sets where wiiflow exits to. 0 = system Menu, 1 = HBC, 2 = Priiloader, 3 = Disable Exitting, 4 = BootMii - Defaults to 0 +exit_to=0 +#Integer: The coverflow sounds volume - Defaults to 255 +sound_volume_coverflow= +#Integer: The change the button sounds volume - Defaults to 255 +sound_volume_gui= +#Integer: The banner sound volume - Defaults to 255 +sound_volume_bnr= +#Integer: The music volume - Defaults to 255 +sound_volume_music= +#Boolean: Compresses the png cache files to save space - Defaults to false +compress_cache= +#Integer: Max anti aliasing - Defaults to 3 +max_fsaa= +#Boolean: When enabled, coverflow can be scrolled by tilting the wiimote while holding B - Defaults to false +wiimote_gestures= +#Boolean: Whether to use 3D boxcovers - Defaults to true +box_mode= +#Boolean: Compresses the covers png files to save space - Defaults to true +allow_texture_compression= +#Integer: The maximum rendered boxcovers on screen - Defaults to 120 +cover_buffer= +#Integer: How fast music and banners fade in and out - Defaults to 8 +music_fade_rate= +#Boolean: Whether to use the disc drive light during the wait screen animation - Defaults to true +waitmessage_wiilight= +#Integer: Global setting of video mode for all games, overridden by game specific setting if set - Defaults to 0 (Default) +video_mode= +#Integer: Global setting of video mode for all games, overridden by game specific setting if set - Defaults to 0 (Default) +game_language= +#Boolean: Initialize the network on startup - Defaults to false +async_network= +#Boolean: The translation to be used inside wiiflow, Defaults to 0 (English) +language= +#Integer: the width wiiflow is drawn on screen - Defaults to 640 +tv_width= +#Integer: The height wiiflow is drawn on screen - Defaults to 480 +tv_height= +#Integer: X offset from the left side of the screen where wiiflow should be drawn - Defaults to 0 +tv_x=0 +#Integer: Y offset from the top of the screen where wiiflow should be drawn - Defaults to 0 +tv_y=0 +#Boolean: Enable the wifi gecko - Defaults to false +wifi_gecko= +#Integer: The IP of the machine to send wifi gecko output to - Blank by default +wifi_gecko_ip= +#Integer: The port the machine is listenning on for gecko output - Blank by default +wifi_gecko_port= +#Boolean: Keep covers after they are cached - Defaults to true +keep_png= +#Boolean: Patch video modes for games - Defaults to false +vipatch= +#Boolean: Patch country strings for games - Defaults to false +country_patch= +#Boolean: The Channel ID you want to return to when exitting games - Default is Blank +returnto= +#Boolean: Enable grabbing with B and dragging coverflow - Default is false +use_grab=false + +[HOMEBREW] +#Boolean: Whether to hide the homebrew mode icon - Defaults to false +disable=false +#Boolean: Whether the favorites view is currently selected or not - Defaults to false +favorites= +#Boolean: Whether to dump the game list to wiiflow/settings/titlesdump.ini - True until the list is dumped, then is false +dump_list= +#Integer: The currently selected coverflow layout - Defaults to 1 +last_cf_mode= +#Integer: The currently selected sorting method - Defaults to 0 (Alphabetical) +sort=0 + +[NAND] +#Boolean: Whether to disable the emulation - Defaults to true +disable=true +#Boolean: Whether to use full emulation or partial for nand emulation - Defaults to true +full_emulation= +#String: Path to your emulated nand +path= +#Boolean: Enable or disable cheating/ocarina globally - Defaults to false +cheat= +#Boolean: Whether the favorites view is currently selected or not - Defaults to false +favorites= +#Boolean: Whether to dump the game list to wiiflow/settings/titlesdump.ini - True until the list is dumped, then is false +dump_list= +#Integer: The currently selected coverflow layout - Defaults to 1 +last_cf_mode= +#Integer: The currently selected sorting method - Defaults to 0 (Alphabetical) +sort= \ No newline at end of file diff --git a/wii/docs/Controls.txt b/wii/docs/Controls.txt new file mode 100644 index 00000000..c76c407a --- /dev/null +++ b/wii/docs/Controls.txt @@ -0,0 +1,40 @@ +Controls : +- Main menu (coverflow) : +-- Up / Down Previous / next game (vertical) +-- Left / Right Previous / next game (horizontal) +-- A Select game +-- B+A Launch game immediately +-- B+Home Reload Wiiflow +-- Home Exit +-- 1 / 2 Previous / next coverflow mode +-- B+Left / B+Right Change Song +-- B+UP / B+DOWN Alphabetic search +-- B+Minus Switch Partition +-- B+Plus Sort Games +-- Minus+Home Exit to Homebrew Channel +-- Plus+Home Exit to System Menu +-- 1+Home Exit to Priiloader +-- 2+Home Exit to BootMii + +-- Minus+A on Exit Icon Exit to Homebrew Channel +-- Plus+A on Exit Icon Exit to System Menu +-- 1+A on Exit Icon Exit to Priiloader +-- 2+A on Exit Icon Exit to BootMii +-- B on View Icon Enable/Disable Nand emulator + +- Game : +-- A on box Show the backside +-- A out of screen Launch game +-- B Back to coverflow +-- Minus / Plus Previous / next game (vertical) +-- Left / Right Previous / next game (horizontal) + +- Settings menus : +-- Minus / Plus Previous / next page +-- Left / Right Previous / next page + +- Coverflow settings : +-- B+Minus / B+Plus Previous / next page +-- B Faster adjustement (B+A instead of just A to click a button) +-- B+1 Copy whole coverflow +-- B+2 Paste coverflow \ No newline at end of file diff --git a/wii/docs/FAQ.txt b/wii/docs/FAQ.txt new file mode 100644 index 00000000..e6244b6c --- /dev/null +++ b/wii/docs/FAQ.txt @@ -0,0 +1,73 @@ +Content: +- I can't select a theme, i can't select my language. +- Can it play background music? +- It crashed when i tried to download covers. +- When i launch 2 games in a row it freezes. +- The Wii freezes when i leave a game. +- The theme Nihonflow doesn't display accents correcty. +- How do i disable sounds? +- How can i download covers in my language? +- How do video modes work? +- What's the red hand? +- How does the parental control work? +- I've found a bug. + +------- + +Q. Can it play background music? +A. Put your OGG/MP3 files in /wiiflow/music/ + + +Q. The theme Nihonflow doesn't display accents correcty. +A. It's a theme made for Japanese people, with a font that supports their alphabet. +But it's good in English too, and you can replace the font in /wiiflow/themes/nihonflow/ + + +Q. How do i disable sounds? +A. In the settings menu, there's a page with sound volume adjustments. +If you set a volume to 0, the sounds won't be loaded/played. + + +Q. How can i download covers in my language? +A. If you are Portuguese or if your Wii is not set to use your language, you need to modify wiiflow.ini +In the URL, replace {loc} by your country code (see wiitdb.com for country codes) + + +Q. How do video modes work? +A. There are 2 ways of forcing a video mode : the "normal" way and the patch. +If the normal way doesn't work, use the patch, but it might cause wrong screen coordinates in games. +To force a video mode the normal way, set : +- Video Mode : PAL 60 or PAL 50 or NTSC +- Video Mode Patch : None +To force a video mode through a patch, set : +- Video Mode : PAL 60 or PAL 50 or NTSC +- Video Modes Patch : Normal or More or All +"Normal" means it will only patch video modes that have the same resolution as the one you've selected. +"More" means it will patch every video mode as long as its mode (interlaced or progressive) is the same. +"All" means it replaces any mode it finds. +There is another way to use the video modes patch. Set : +- Video Mode : Auto Patch +- Video Modes Patch : None (ignored anyway) +This time it tries to patch video modes the best way for you. + + +Q. What's the red hand? +A. See "How does the parental control work?" + + +Q. How does the parental control work? +A. The parental control is disabled by default. +Go to the settings menu and click on "Set Code". +Enter a 4 digits code. +Now that there is a code, WiiFlow will switch to child mode on next start. +To immediately enable it, go back to the coverflow and press B+Home. +With child mode enabled, many functions become invisible. +If you want to enable these functions again, go to the settings menu, click "Unlock", and type the same code. +Now, you can go to game selection, and click on the red hand to select which games should be invisible in child mode. +If you launch a game or restart WiiFlow, it will automatically switch back to child mode. +To remove the child mode persitently, go to the settings menu, click "Unlock", type your code, then click "Set code", then "Erase". + + +Q. I've found a bug. +A. come to #wiiflow on irc.abjects.net, or goto the url http://tinyurl.com/wiiflowirc and report it there. + diff --git a/wii/docs/Readme.txt b/wii/docs/Readme.txt new file mode 100644 index 00000000..67376415 --- /dev/null +++ b/wii/docs/Readme.txt @@ -0,0 +1,97 @@ +NOTE: Also see http://www.wiiflowiki.com + + WiiFlow Manual + + + Content + ========= + +1.1) About the Installation from WiiFlow +1.2) Installation of WiiFlow +1.3) Starting WiiFlow + +2.1) Installing themes +2.2) Playing background music + + 1.1 About the Installation of WiiFlow + ------------------------------- +You can either install WiiFlow to a SD-Card or on your Harddisk. Both types has +advantages and disadvantages: If you install on a SD-Card you will need the +SD-Card to operate with WiiFlow. With this setup, you must always let the SD-Card inside +your Wii and with write-protect off. Otherwise WiiFlow will not work properly. +Also, with covers and settings and fanart/trailers/etc an SD will become full very fast. + +It is better to install WiiFlow on your Harddisk but you will need a FAT32, NTFS, or EXT2/3/4 +partition for it. Since HBC does not support ntfs, a forwarder is required to boot a dol which +is placed on an NTFS partition. + +If you have a WBFS only hard disk, you would need to repartition it, which will delete all +of your Wii-Games on it. If you do this we suggest you backup as many of your games as you can. + + 1.2 Installation of WiiFlow: + ------------------------------------------ +NOTE: DO NOT boot wiiflow until the entire installation is completed. +If you have a previous installation, it is recommended to back up your covers and delete +all wiiflow folders before you continue. + +Copy the content of the archive to the Root of the device you wish to use to boot wiiflow. +You should get the following Path: + +device:\apps\wiiflow\wiiflow.ini + +WiiFlow will save all settings and files into the data directory by default, which is: device:\wiiflow\. + +If you want the data on a different device than where you have the apps folder, +open the included device:/apps/wiiflow/wiiflow.ini and change the "data_on_usb=" option. + +If you set "data_on_usb=yes", move the device:/wiiflow folder along with its contents to USB. +If you set "data_on_usb=no", move the device:/wiiflow folder along with its contents to SD. + +You may now boot wiiflow. + +The initial boot time of wiiflow may seem slow as it creates files and folders for the installation, this is normal. +Once you get into the coverflow, you may either exit and add in your covers back to the device (If you have them), or +click the settings icon (The icon with the little gear on it in the bottom left corner of the screen) and +select from the menu that pops up "Download covers and titles". This will bring up yet another menu where you must select "WiiTDB". +Wait for it to complete, press B to go back or click A on the back button, and then select the option "Missing" and wait for that to also complete. +Wiiflow is now set up for basic use. + + 1.3 Starting WiiFlow + ---------------------- +1.3.1) Starting WiiFlow via Homebrew-Channel +You need to save the file "boot.dol" into a FAT partition in the directory device:\apps\wiiflow\ +so that the Homebrew-Channel can find it. The files meta.xml and icon.png belongs in +that directory too, but they are not necessary for the execution. + +1.3.2) Starting WiiFlow through a Forwarder-Channel +A forwarder is a channel which executes a specific file in a specific directory. +So you may need to rename the boot.dol and place it on that directory where the +forwarder can find it. Ask the author of the forwarder which file it will start. + +1.3.3) Starting WiiFlow with help of Preloader +You may use a forwarder designed for priiloader, or you may install the boot.dol directly as +an autoboot file. +To use the boot.dol itself: +Rename boot.dol to WiiFlow.dol and save it inside the root of your SD-Card. Now +start Preloader and select "Load/Install File" and then the "WiiFlow.dol". +After a short time the file is installed and you can automatically start +WiiFlow by powering on your Wii if you set this in the settings of Preloader. + + + 2.1 Installing Themes + --------------------------- +You can change the look of WiiFlow by installing an additional theme. You can +either download a theme or create one by yourself. To install a theme just copy +it inside the directory datadevice:\wiiflow\themes\. Themes consist of a ini-file and a +belonging directory, which contains the graphics and fonts. You only have to +check if both has the same name (e.g. to the file "\wiiflow\themes\pear.ini" +belongs the directory "\wiiflow\themes\pear\" and all files inside of it). +After you have copied both things, you can choose this theme in the settings. + + 2.2 Playing background-music + ------------------------------ +If you want to have some music in WiiFlow, you can save one or more audio +files inside of \wiiflow\music\. WiiFlow will randomly play one of these +files each time you start it. If the file is played to the end of it, it +will start a new one. WiiFlow will only play +OGG-files and MP3's. \ No newline at end of file diff --git a/wii/wiiflow/Languages/arab.ini b/wii/wiiflow/Languages/arab.ini new file mode 100644 index 00000000..39fc1360 --- /dev/null +++ b/wii/wiiflow/Languages/arab.ini @@ -0,0 +1,177 @@ + +[ARAB] +about1=المحمل الاصلي من طر٠:\n%s +about2=الواجهة الاصلية من طر٠:\n%s +about4=شكرا إلى :\n%s +about6=المصمم الحالي :\n%s +about7=المصمم السابق :\n%s +about8=قطعة من التعليمات البرمجية تم الحصول عليها من :\n%s +about9=مواقع الانتيرنية المؤيدة :\n%s +alphabetically=أبجدي +appname=%s v%s +bycontrollers=لوحة التحكم +byesrb=ب وج ÙŠ +bygameid=اللعبةID +bylastplayed=اخر مقطع +byplaycount=شعبية +byplayers=لاعبين +bywifiplayers=لاعبين الواي Ùاي +cd1=رجوع +cd2=محو +cfg1=إعدادات +cfg10=رجوع +cfg11=مضاهاة التسجيل عبر اليوأسبي +cfg12=مضاهاة NAND +cfg3=تحميل العناوين Ùˆ الغلاÙات +cfg4=تحميل +cfg5=الرقابة الأبوية +cfg6=Ùتح +cfg7=تشÙير +cfga2=تسجيل لعبة +cfga3=تسجيل +cfga6=لغة +cfga7=تشخيص +cfgb1=Ù…Ùاتيح الغش +cfgb3=وضع الÙيديو Ø¥Ùتراضي +cfgb4=لغة اللعبة +cfgc1=خروج إلى +cfgc2=ضبط عرض التلÙزيون +cfgc3=ضبط ارتÙاع التلÙزيون +cfgc4=ضبط كوÙرÙلؤ +cfgc5=تعديل +cfgc6=تعديل Ø£Ùقي +cfgc7=تعديل عمودي +cfgd5=الاحتÙاظ بالشكل المÙضل +cfgd7=مشاهدة الÙئات عند بدء التشغيل +cfgg1=إعدادات +cfgg12=تحميل الغلاÙات +cfgg13=تحميل +cfgg14=تصحيح أوضاع الÙيديو +cfgg15=Ù…Ùاتيح الغش +cfgg16=حدد +cfgg17=الÙئات +cfgg18=نوع الهوك +cfgg21=العودة الى القناة +cfgg22=المصحح +cfgg23=تحميل Ù…Ùاتيح الغش +cfgg24=مضاهاة التسجيل +cfgg2=وضع الÙيديو +cfgg3=لغة +cfgg4=تتعديل Ø´Ùرات البلدان +cfgg5=Ù…Ùاتيح الغش +cfgg7=Ùيباتش +cfgg8=رجوع +cfgp1=وحدة الالعاب +cfgp3=تشغيل الشبكة عند البداية +cfgs1=إرتÙاع الموسيقى +cfgs2=إرتÙاع صوت أزرار +cfgs3=إرتÙاع صوت كوÙرÙلؤ +cfgs4=إرتÙاع صوت اللعبة +cheat1=رجوع +cheat2=تطبيق +cheat3=غير موجود +cheat4=لم يتم العثور على التحميل +def=Ø¥Ùتراضي +disabled=ايقا٠+dl1=إلغاء +dl10=WiiTDB.com الرجاء التبرع إلى +dl12=WiiTDB +dl2=رجوع +dl3=كلّ +dl4=Ù…Ùقودة +dl5=Ù…Ùقودة +dl6=كلّ +dl8=الغلاÙات +dlmsg1=...تهيئة الشبكة +dlmsg10=%s عمل +dlmsg11=...تنزيل +dlmsg12=Ùشل التنزيل +dlmsg13=...تسجيل +dlmsg14=.إنتهى +dlmsg15=لا يمكن Ø­Ùظ مل٠مضغوط +dlmsg16=لا يمكن قراءة المل٠+dlmsg17=لم يعثر على أي تحديثات جديدة +dlmsg18=لم يتم العثور على Boot.dol المل٠ÙÙŠ المسار الاÙتراضي +dlmsg19=عملية تحديث جديدة متوÙرة +dlmsg20=لم تتوÙر معلومات عن هذا الإصدار +dlmsg21=ايقا٠للتحديث +dlmsg22=تحديث دليل التطبيق +dlmsg23=تحديث بيانات الدليل +dlmsg24=استخلاص... +dlmsg25=boot.dol Ùشل ÙÙŠ الاستخراج ! إعادة تسمية النسخة +dlmsg26=تحديث ذاكرة التخزين المؤقت... +dlmsg2=Ùشل تهيئة الشبكة +dlmsg3=%s تتحميل من +dlmsg4=%s تسجيل +dlmsg5=%i/%i الملÙات التي تم تحميلها +dlmsg6=...إلغاء +dlmsg7=...قائمة الغلاÙات +dlmsg8=%s لم يتم العثور على الغلاÙات كاملة. تنزيل من +dlmsg9=%i سوى وجه الغلا٠.%i/%i الملÙات التي تم تنزيله +gameinfo1=%s المطور +gameinfo2=%s الناشر +gameinfo3=%s المنطقة +gameinfo4=%s تاريخ الإصدار +gameinfo5=%s النوع +gm1=إلعب +gm2=رجوع +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +ios=IOS%i قاعدة %s +lngdef=اÙتراضي +lngdut=هولندي +lngeng=إنكليزي +lngfre=Ùرنسي +lngger=ألماني +lngita=أسباني +lngjap=يابانية +lngkor=كوري +lngsch=س. صينية +lngspa=أسباني +lngtch=ت. صينية +main1=إعدادات +main2=على إعدادات لتحديد Ùˆ / أو تثبيت الألعاب إضغط .لم أجد أي لعبة .WiiFlow مرحبا بكم ÙÙŠ +main3=اختيار القسم +off=إغلق +on=Ø¥Ùتح +players= لاعبين +sys1=نظام +sys2=WiiFlow الإصدار +sys3=إلغاء +sys4=تحديث +sys7=تثبيت الإصدار +translation_author=Spayrosam, Salahpayne +viddef=اÙتراضي +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=تصحيح تلقائي +vidprog=تقدمية +vidsys=نظام +vmpall=جميع +vmpmore=أكثر +vmpnone=بلا +vmpnormal=عادي +wbfsadddlg=الرجاء إدخال القرص الذي تريد نسخه ØŒ ثم إضغط على انطلق +wbfsop1=تثبيت لعبة +wbfsop10=لا توجد مساحة كاÙية : %i المساحة المطلوبة, %i متوÙر +wbfsop2=حذ٠لعبة +wbfsop4=رجوع +wbfsop5=انطلق +wbfsop6=[%s] %s تثبيت +wbfsop7=لعبة حذÙت +wbfsop8=لعبة ثبّتت +wbfsop9=حدث خطأ +wbfsoperr1=القرص انتظار Ùشل +wbfsoperr2=القرص Ùتح Ùشل +wbfsoperr3=وي هذا ليس قرص +wbfsoperr4=لعبة مثبتة مسبقا +wbfsprogress=%i%% +wbfsremdlg=لإزالة اللعبة بشكل دائم : %s, إضغط إنطلق +wifiplayers= لاعبين ويÙÙŠ +wiitdb_code=FR \ No newline at end of file diff --git a/wii/wiiflow/Languages/brazilian.ini b/wii/wiiflow/Languages/brazilian.ini new file mode 100644 index 00000000..017dafc6 --- /dev/null +++ b/wii/wiiflow/Languages/brazilian.ini @@ -0,0 +1,177 @@ + +[BRAZILIAN] +about1=Loader Original Por:\n%s +about2=GUI Original Por:\n%s +about4=Agradecimentos:\n%s +about6=Desenvolvedores Atuais:\n%s +about7=Desenvolvedores Antigos:\n%s +about8=Trechos de Código Obtidos De:\n%s +about9=Sites Apoiadores:\n%s +alphabetically=Alfabeticamente +appname=%s v%s +bycontrollers=Por nº de controles +byesrb=Por ESRB +bygameid=Pela I.D. do Jogo +bylastplayed=Por Ultimo Jogado +byplaycount=Por Vezes Jogado +bywifiplayers=Por nº de jogadores wifi +byplayers=Por nº de jogadores +cd1=Retornar +cd2=Apagar +cfg1=Configurações +cfg10=Retornar +cfg11=USB Saves Emulation +cfg12=NAND Emulation +cfg3=Baixar capas e títulos +cfg4=Baixar +cfg5=Controle dos pais +cfg6=Desbloquear +cfg7=Definir código +cfga2=Instalar jogo +cfga3=Instalar +cfga6=Idioma +cfga7=Tema +cfgb1=Ocarina +cfgb3=Modo de vídeo padrão +cfgb4=Idioma de jogo padrão +cfgc1=Sair para o Wii Menu +cfgc2=Ajustar largura da TV +cfgc3=Ajustar altura da TV +cfgc4=Ajustar Coverflow +cfgc5=Ir +cfgc6=Offset horizontal +cfgc7=Offset vertical +cfgd5=Gravar modo de favoritos +cfgd7=Mostrar categorias no boot +cfgg1=Configurações +cfgg12=Baixar capa +cfgg13=Baixar +cfgg14=Patchear modos de vídeo +cfgg15=Códigos de trapaças +cfgg16=Selecionar +cfgg17=Categorias +cfgg18=Tipo de Hook +cfgg21=Retornar Para o Canal +cfgg22=Debugger +cfgg23=Baixando arquivo de trapaças.... +cfgg24=Savegame Emulation +cfgg2=Modo de vídeo +cfgg3=Idioma +cfgg4=Patch de códigos de países +cfgg5=Ocarina +cfgg7=Vipatch +cfgg8=Retornar +cfgp1=Partição de Jogos +cfgp3=Iniciar rede no boot +cfgs1=Volume da Música +cfgs2=Volume da Interface +cfgs3=Volume do Coverflow +cfgs4=Volume do Jogo +cheat1=Retornar +cheat2=Aplicar +cheat3=Arquivo de trapaça não encontrado. +cheat4=Download não encontrado. +def=Padrão +disabled=Desabilitado +dl1=Cancelar +dl10=Por favor doar\npara WiiTDB.com +dl12=WiiTDB +dl2=Retornar +dl3=Todas +dl4=Faltando +dl5=Baixar +dl6=Baixar +dl8=Capas +dlmsg1=Inicializando rede... +dlmsg10=Fazendo %s +dlmsg11=Baixando... +dlmsg12=Download falhou +dlmsg13=Salvando... +dlmsg14=Feito. +dlmsg15=Não é possível salvar arquivo ZIP +dlmsg16=Não é possível ler o arquivo +dlmsg17=Nenhuma atualização encontrada. +dlmsg18=boot.dol não encontrado no caminho padrão. +dlmsg19=Nova atualização disponível! +dlmsg20=Informação de versão não encontrada. +dlmsg21=Wiiflow agora sairá para que a atualização tenha efeito. +dlmsg22=Atualizando diretório de aplicação... +dlmsg23=Atualizando diretório de dados... +dlmsg24=Extracting... +dlmsg25=Extraction must have failed! Renaming the backup to boot.dol +dlmsg26=Updating cache... +dlmsg2=Inicialização de rede falhou +dlmsg3=Baixando de %s +dlmsg4=Salvando %s +dlmsg5=%i/%i arquivos baixados +dlmsg6=Cancelando... +dlmsg7=Listando capas para baixar... +dlmsg8=Capa completa não encontrada. Baixando de %s +dlmsg9=%i/%i arquivos baixados. %i São apenas capas frontais. +gameinfo1=Desenvolvedor: %s +gameinfo2=Publicador: %s +gameinfo3=Região: %s +gameinfo4=Data de Lançamento: %i.%i.%i +gameinfo5=Tipo: %s +gm1=Jogar +gm2=Retornar +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +ios=IOS%i base %s +lngdef=Padrão +lngdut=Holandês +lngeng=Inglês +lngfre=Francês +lngger=Alemão +lngita=Italiano +lngjap=Japonês +lngkor=Coreano +lngsch=Chinês S. +lngspa=Espanhol +lngtch=Chinês T. +main1=Instalar Jogo +main2=Bem-vindo ao WiiFlow.\nNenhum jogo foi encontrado.\nClique em Instalar para instalar jogos, ou Selecionar partição para selecionar o tipo de partição. +main3=Selecionar Partição +off=Desligado +on=Ligado +players= Players +sys1=Sistema +sys2=Versão do WiiFlow: +sys3=Cancelar +sys4=Atualizar +sys7=Versão Instalada. +translation_author=hugo.wii, Yuan +viddef=Padrão +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Auto Patch +vidsys=Sistema +vidprog=Progressivo +vmpall=Todas +vmpmore=Mais +vmpnone=Nenhuma +vmpnormal=Normal +wbfsadddlg=Por favor, insira o disco que deseja copiar e clique em Ir. +wbfsop1=Instalar Jogo +wbfsop10=Sem espaço suficiente : %i blocos necessários, %i disponíveis +wbfsop2=Apagar Jogo +wbfsop4=Retornar +wbfsop5=Ir +wbfsop6=Instalando [%s] %s... +wbfsop7=Jogo apagado +wbfsop8=Jogo instalado +wbfsop9=Ocorreu um erro +wbfsoperr1=Disc_Wait falhou +wbfsoperr2=Disc_Open falhou +wbfsoperr3=Este não é um disco de Wii! +wbfsoperr4=Jogo já instalado +wbfsprogress=%i%% +wbfsremdlg=Para remover permanentemente o jogo : %s, clique em Ir. +wifiplayers= Wifi Players +wiitdb_code=PT \ No newline at end of file diff --git a/wii/wiiflow/Languages/chinese_s.ini b/wii/wiiflow/Languages/chinese_s.ini new file mode 100644 index 00000000..a2d6bed8 --- /dev/null +++ b/wii/wiiflow/Languages/chinese_s.ini @@ -0,0 +1,184 @@ + +[CHINESE_S] +about1=程åºè®¾è®¡: %s +about2=图形设计: %s +about3=æ„Ÿè°¢ :\n\n%s%s%s\n\n%s\n%s +alphabetically=按字æ¯æŽ’åº +appname=%s v%s +byplaycount=è¿è¡Œæ¸¸æˆæ¬¡åº +bylastplayed=最åŽæ¸¸æˆè¿è¡Œ +bygameid=游æˆID +cd1=返回 +cd2=清除 +cfg1=设置 +cfg10=返回 +cfg11=振动 +cfg2=3D å°é¢ +cfg3=下载å°é¢å’Œæ¸¸æˆæ ‡é¢˜æ–‡ä»¶ +cfg4=下载 +cfg5=亲å­æŽ§åˆ¶ +cfg6=è§£é” +cfg7=è®¾ç½®ä»£ç  +cfga2=å®‰è£…æ¸¸æˆ +cfga3=安装 +cfga6=语言 +cfga7=主题 +cfgb1=金手指 +cfgb2=Vipatch +cfgb3=缺çœè§†é¢‘æ¨¡å¼ +cfgb4=缺çœæ¸¸æˆè¯­è¨€ +cfgc1=退到Wiièœå• +cfgc2=调整宽度 +cfgc3=调整高度 +cfgc4=调整Coverflow +cfgc5=进入 +cfgc6=åž‚ç›´å移 +cfgc7=æ°´å¹³å移 +cfgd1=国家代ç ä¿®å¤ +cfgd2=002 é”™è¯¯ä¿®å¤ +cfgd3=ä¿ç•™PNG文件 +cfgd4=压缩文本 +cfgd5=收è—模å¼ä¿å­˜çŠ¶æ€ +cfgd6=缺çœæœç´¢æ¨¡å¼ +cfgd7=显示目录 +cfgg1=设置 +cfgg10=IOS +cfgg11=IOSé‡åŠ è½½ +cfgg12=下载å°é¢ +cfgg13=下载 +cfgg14=视频模å¼ä¿®æ­£ +cfgg15=ä½œå¼Šç  +cfgg16=选择 +cfgg17=ç§ç±» +cfgg18=é’©å­ç±»åž‹ +cfgg19=ç¦ç”¨ DVD å…‰ç›˜è¡¥ä¸ +cfgg20=ç¦ç”¨è¿”回功能 +cfgg21=è¿”å›žé¢‘é“ +cfgg22=调试器 +cfgg2=è§†é¢‘æ¨¡å¼ +cfgg3=语言 +cfgg4=国家代ç ä¿®å¤ +cfgg5=金手指 +cfgg6=002é”™è¯¯ä¿®å¤ +cfgg7=Vipatch +cfgg8=返回 +cfgg9=选择DOL +cfgp1=游æˆåˆ†åŒº +cfgp2=安装到目录 +cfgp3=åˆå§‹åŒ–网络 +cfgs1=音ä¹éŸ³é‡ +cfgs2=图形模å¼éŸ³é‡ +cfgs3=CoverflowéŸ³é‡ +cfgs4=游æˆéŸ³é‡ +cheat1=返回 +cheat2=应用 +cheat3=无法找到此游æˆçš„作弊ç æ–‡ä»¶ã€‚ +cheat4=无法找到å¯ä¸‹è½½æ–‡ä»¶ã€‚ +def=ç¼ºçœ +disabled=ç¦ç”¨ +dl1=å–消 +dl10=请æèµ \n ç»™WiiTDB.com +dl11=å‡çº§ç‰ˆæœ¬ +dl12=WiiTDB +dl2=返回 +dl3=全部 +dl4=缺失å°é¢ +dl5=下载 +dl6=全部 +dl7=缺失游æˆåå• +dl8=å°é¢ +dl9=游æˆæ ‡é¢˜ +dlmsg1=åˆå§‹åŒ–网络... +dlmsg10=制作中 %s +dlmsg11=下载中... +dlmsg12=下载失败 +dlmsg13=ä¿å­˜ä¸­... +dlmsg14=完æˆã€‚ +dlmsg15=无法ä¿å­˜Zip文件 +dlmsg16=无法读å–文件 +dlmsg17=当å‰ç‰ˆæœ¬ä¸æ˜¯æœ€æ–°ç‰ˆæœ¬ +dlmsg18=缺çœä½ç½®æ²¡æœ‰æ‰¾åˆ°boot.dol文件 +dlmsg20=没有找到版本信æ¯ã€‚ +dlmsg21=Wiiflow更新将在下次é‡æ–°å¯åŠ¨ç”Ÿæ•ˆã€‚ +dlmsg19=程åºæœ‰æ›´æ–°å¯ä¸‹è½½ï¼ +dlmsg2=网络åˆå§‹åŒ–失败 +dlmsg3=下载æ¥è‡ª %s +dlmsg4=ä¿å­˜ %s +dlmsg5=%i/%i 文件已下载 +dlmsg6=å–消... +dlmsg7=列出需è¦ä¸‹è½½çš„å°é¢... +dlmsg8=没找到全å°é¢ã€‚ 下载æ¥è‡ª %s +dlmsg9=%i/%i 文件已下载. %i 是2Då°é¢ç±»åž‹ã€‚ +gameinfo1=å¼€å‘者: %s +gameinfo2=å‘布者: %s +gameinfo3=区域: %s +gameinfo4=å‘布日期: %i.%i.%i +gameinfo5=类型: %s +gm1=开始 +gm2=返回 +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +lngdef=ç¼ºçœ +lngdut=è·å…°è¯­ +lngeng=英语 +lngfre=法语 +lngger=德语 +lngita=æ„大利语 +lngjap=日语 +lngkor=æœé²œè¯­ +lngsch=简体汉语 +lngspa=西ç­ç‰™è¯­ +lngtch=ç¹ä½“汉语 +main1=å®‰è£…æ¸¸æˆ +main2=欢迎使用Wiiflow。没有找到游æˆã€‚点击安装按钮æ¥å®‰è£…游æˆæˆ–者选择你的设备的分区类型。 +main3=选择分区 +off=关闭 +on=å¼€å¯ +smalpha=字符 +smpage=é¡µç  +sys1=系统 +sys2=WiiFlow版本: +sys3=å–消 +sys4=å‡çº§ +sys5=剩余空间: +sys6=IOS版本: +sys7=已安装版本。 +translation_author=Kavid +viddef=ç¼ºçœ +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=自动修正 +vidsys=系统 +vidprog=å‘å‰ +vmpall=全部 +vmpmore=更多 +vmpnone=æ—  +vmpnormal=正常 +wbfs2=WBFS_Open 失败 : %i +wbfs3=WBFS_GetCount 失败 : %i +wbfs4=WBFS_GetHeaders 失败 : %i +wbfsadddlg=æ’入需è¦å¤åˆ¶åˆ°å…‰ç›˜ï¼Œç„¶åŽç‚¹å‡»å¼€å§‹. +wbfsop1=å®‰è£…æ¸¸æˆ +wbfsop10=空间ä¸è¶³: %i 需è¦ç©ºé—´, %i å¯ç”¨ +wbfsop11=当å‰ä½¿ç”¨çš„文件系统åªèƒ½å…·æœ‰åªè¯»æƒé™ã€‚无法删除或者安装游æˆã€‚ +wbfsop2=åˆ é™¤æ¸¸æˆ +wbfsop4=返回 +wbfsop5=开始 +wbfsop6=安装中 [%s] %s... +wbfsop7=游æˆå·²åˆ é™¤ +wbfsop8=游æˆå·²å®‰è£… +wbfsop9=出现一个错误 +wbfsoperr1=Disc_Wait 失败 +wbfsoperr2=Disc_Open 失败 +wbfsoperr3=è¿™ä¸æ˜¯Wii光盘 +wbfsoperr4=游æˆå·²å®‰è£… +wbfsprogress=%i%% +wbfsremdlg=æ°¸ä¹…åˆ é™¤æ¸¸æˆ : %s, 点击确定. +wiitdb_code=ZH +wtmsg1=正在创建WiiTDBæ•°æ®åº“... \ No newline at end of file diff --git a/wii/wiiflow/Languages/chinese_t.ini b/wii/wiiflow/Languages/chinese_t.ini new file mode 100644 index 00000000..b485a156 --- /dev/null +++ b/wii/wiiflow/Languages/chinese_t.ini @@ -0,0 +1,132 @@ + +[CHINESE_T] +about1=程å¼è¨­è¨ˆ: %s +about2=圖形介é¢è¨­è¨ˆ: %s +about3=æ„Ÿè¬ :\n\n%s%s%s\n\n%s\n%s +appname=%s v%s +cd1=返回 +cd2=清除 +cfg1=設置 +cfg10=返回 +cfg11=振動 +cfg2=3D å°é¢ +cfg3=下載å°é¢åŠtitle檔 +cfg4=下載 +cfg5=家長控制 +cfg6=解鎖 +cfg7=設置代碼 +cfga2=安è£éŠæˆ² +cfga3=å®‰è£ +cfga6=語言 +cfga7=主題 +cfgb1=金手指 +cfgb2=Vipatch +cfgb3=é è¨­è¦–è¨Šæ ¼å¼ +cfgb4=é è¨­éŠæˆ²èªžè¨€ +cfgc1=返回Wiié¸å–® +cfgc2=調整TV寬度 +cfgc3=調整TV高度 +cfgc4=調整Coverflow +cfgc5=進入 +cfgc6=åž‚ç›´å移 +cfgc7=æ°´å¹³å移 +cfgd1=修改國別設定 +cfgd2=修正002錯誤 +cfgd3=ä¿ç•™PNG檔案 +cfgd4=壓縮文本 +cfgd5=儲存我的最愛模å¼ç‹€æ…‹ +cfgd6=é è¨­æœå°‹æ¨¡å¼ +cfgg1=設置 +cfgg10=IOS +cfgg11=阻止IOSé‡æ–°è¼‰å…¥ +cfgg12=下載å°é¢ +cfgg13=下載 +cfgg14=ä¿®æ”¹è¦–è¨Šæ ¼å¼ +cfgg2=è¦–è¨Šæ ¼å¼ +cfgg3=語言 +cfgg4=修改國別設定 +cfgg5=金手指 +cfgg6=修正002錯誤 +cfgg7=Vipatch +cfgg8=返回 +cfgg9=DOL +cfgs1=éŸ³æ¨‚éŸ³é‡ +cfgs2=圖形介é¢è²éŸ³éŸ³é‡ +cfgs3=Coverflowè²éŸ³éŸ³é‡ +cfgs4=éŠæˆ²è²éŸ³éŸ³é‡ +def=é è¨­ +dl1=å–消 +dl10=è«‹æè´ˆ\nto WiiTDB.com +dl2=返回 +dl3=全部 +dl4=ç„¡å°é¢ +dl5=下載 +dl6=全部 +dl7=ç„¡å°é¢ +dl8=å°é¢ +dl9=éŠæˆ²æ¨™é¡Œ +dlmsg1=正在啟動網路... +dlmsg10=製作中 %s +dlmsg11=下載中... +dlmsg12=下載失敗 +dlmsg13=儲存中... +dlmsg14=完æˆã€‚ +dlmsg15=ä¸èƒ½å„²å­˜æˆZip檔 +dlmsg16=ä¸èƒ½è®€å–檔案 +dlmsg2=網路啟動失敗 +dlmsg3=正在下載來自 %s +dlmsg4=正在儲存 %s +dlmsg5=%i/%i 檔案已下載 +dlmsg6=å–消中... +dlmsg7=正在列出需è¦ä¸‹è¼‰çš„å°é¢... +dlmsg8=Full cover 沒發ç¾. 正在下載來自 %s +dlmsg9=%i/%i 檔案已下載. %i 是2Då°é¢é¡žåž‹ã€‚ +gm1=開始 +gm2=返回 +lngdef=é è¨­ +lngdut=è·è˜­èªž +lngeng=英語 +lngfre=法語 +lngger=德語 +lngita=æ„大利語 +lngjap=日語 +lngkor=韓語 +lngsch=簡體中文 +lngspa=西ç­ç‰™èªž +lngtch=ç¹é«”中文 +main1=設置 +main2=歡迎使用Wiiflow. 沒有找到éŠæˆ².點é¸è¨­ç½®ä¾†å®‰è£éŠæˆ². +off=關閉 +on=é–‹å•Ÿ +smalpha=字符 +smpage=é ç¢¼ +translation_author=Jane.H +viddef=é è¨­ +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=自動修改 +vmpall=全部 +vmpmore=更多 +vmpnone=ç„¡ +vmpnormal=正常 +wbfs2=WBFS_Open 失敗 : %i +wbfs3=WBFS_GetCount 失敗 : %i +wbfs4=WBFS_GetHeaders 失敗 : %i +wbfsadddlg=è«‹æ’入你è¦è¤‡è£½çš„光碟，然後點é¸é–‹å§‹. +wbfsop1=安è£éŠæˆ² +wbfsop10=空間ä¸è¶³: %i 需è¦ç©ºé–“, %i å¯ç”¨ +wbfsop2=刪除éŠæˆ² +wbfsop4=返回 +wbfsop5=開始 +wbfsop6=正在安è£ä¸­ [%s] %s... +wbfsop7=éŠæˆ²å·²åˆªé™¤ +wbfsop8=éŠæˆ²å·²å®‰è£ +wbfsop9=出ç¾ä¸€å€‹éŒ¯èª¤ +wbfsoperr1=等待光碟失敗 +wbfsoperr2=開啟光碟失敗 +wbfsoperr3=這ä¸æ˜¯Wiiå…‰ç¢Ÿï¼ +wbfsoperr4=éŠæˆ²å·²å®‰è£ +wbfsprogress=%i%% +wbfsremdlg=永久刪除éŠæˆ² : %s, click on Go. +wiitdb_code=ZHTW \ No newline at end of file diff --git a/wii/wiiflow/Languages/danish.ini b/wii/wiiflow/Languages/danish.ini new file mode 100644 index 00000000..a93b4f60 --- /dev/null +++ b/wii/wiiflow/Languages/danish.ini @@ -0,0 +1,196 @@ + +[DANISH] +about1=Loader af %s +about2=GUI af %s +about3= +about4=Tak Til:\n%s +about5= +about6=Nuværende udvikler:\n%s +about7=Tidliger udvikler:\n%s +about8=Dele af koder er taget fra:\n%s +about9=websider:\n%s +alphabetically=Alfabetisk +appname=%s v%s +byplaycount=Antal spillet spil +bylastplayed=Sidst Spillet +bygameid=Spil ID +byesrb=Klassificering +bywifiplayers=Antal Wifi spillere +byplayers=Antal Spillere +cd1=Tilbage +cd2=Slet +cfg1=Indstillinger +cfg10=Tilbage +cfg11=Rumble +cfg2=3D Covers +cfg3=Download Covers & Titler +cfg4=Download +cfg5=Forældrekontrol +cfg6=LÃ¥s op +cfg7=Sæt kode +cfga2=Installer spil +cfga3=Installer +cfga6=Sprog +cfga7=Tema +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Video tilstand +cfgb4=Sæt sprog i spil +cfgc1=Retur til wii menu +cfgc2=Tilret TV bredde +cfgc3=Tilret TV højde +cfgc4=Tilret Coverflow +cfgc5=Start +cfgc6=Vandret offset +cfgc7=Lodret offset +cfgd1=Patch lande string +cfgd2=Error 002 fix +cfgd3=Behold PNG filer +cfgd4=Komprimere teksturer +cfgd5=Gem foretrukne tilstand +cfgd6=Standard søgetilstand +cfgd7=Vis kategorier ved opstart +cfgg1=Indstillinger +cfgg10=IOS +cfgg11=Bloker IOS genstart +cfgg12=Download cover +cfgg13=Download +cfgg14=Patch videotilstand +cfgg2=Videotilstand +cfgg3=Sprog +cfgg4=Patch lande string +cfgg5=Ocarina +cfgg6=Error 002 fix +cfgg7=Vipatch +cfgg8=Tilbage +cfgg9=DOL +cfgg15=Snyde koder +cfgg16=Vælg +cfgg17=Kategori +cfgg18=Hook Type +cfgg19=Deaktiver DVD Patch +cfgg20=Deaktiver Retur til +cfgg21=Retur til kanal +cfgg22=Debugger +cfgg23=Downloader cheat fil... +cfgp1=Vælg Partition +cfgp2=Installer til egen mappe +cfgp3=Init netværk ved opstart +cfgs1=Musik lydstyrke +cfgs2=GUI lydstyrke +cfgs3=Coverflow lydstyrke +cfgs4=Spil lydstyrke +cheat1=Tilbage +cheat2=Godkend +cheat3=Cheat fil ikke fundet +cheat4=Download ikke fundet +def=Standard +disabled=Deaktiveret +dl1=Annuller +dl10=Doner venligst\ntil WiiTDB.com +dl2=Tilbage +dl3=Alle +dl4=Mangler +dl5=Download +dl6=Alle +dl7=Mangler +dl8=Covers +dl9=Spil titler +dl11=Opdaterings version +dl12=WiiTDB +dlmsg1=Initialiserer netværk... +dlmsg10=Opretter %s +dlmsg11=Downloader... +dlmsg12=Download fejlede +dlmsg13=Gemmer... +dlmsg14=Færdig. +dlmsg15=Kan ikke gemme ZIP fil +dlmsg16=Kan ikke læse ZIP fil +dlmsg17=Ingen nye opdateringer fundet. +dlmsg18=boot.dol ikke fundet i standard sti. +dlmsg19=Ny opdatering tilgængelig +dlmsg20=Ingen information om version fundet. +dlmsg21=WiiFlow vil nu lukke ned, sÃ¥ opdateringen kan tage effekt. +dlmsg22=Opdatere applikations mappe... +dlmsg23=Opdatere data mappe... +dlmsg2=Netværks initalisering fejlet +dlmsg3=Downloader fra %s +dlmsg4=Gemmer %s +dlmsg5=%i/%i filer downloaded +dlmsg6=Annullere... +dlmsg7=Lister covers til download... +dlmsg8=Full cover ikke fundet. Downloader fra %s +dlmsg9=%i/%i filer downloaded. %i er kun front cover. +gameinfo1=Udvikler: %s +gameinfo2=Udgiver: %s +gameinfo3=Region: %s +gameinfo4=Frigivelses dato: %i.%i.%i +gameinfo5=Genre: %s +gm1=Afspil +gm2=Tilbage +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +lngdef=Standard +lngdut=Tysk +lngeng=Engelsk +lngfre=Fransk +lngger=Tysk +lngita=Italiensk +lngjap=Japansk +lngkor=Korea +lngsch=S. Kinesisk +lngspa=Spansk +lngtch=T. Kinesisk +main1=Indstillinger +main2=Velkommen til WiiFlow. Ingen spil er fundet. Tryk pÃ¥ indstillinger for at installere spil. +main3=Vælg Partition +off=Fra +on=Til +smalpha=Alfabetisk +smpage=Sider +sys1=System +sys2=WiiFlow Version: +sys3=Annuller +sys4=Opdater +sys5=Fri plads: +sys6=IOS Version: +sys7=Installeret Version. +translation_author=Fox888, Maisto +viddef=Standard +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Auto Patch +vidsys=System +vidprog=Progressive +vmpall=Alle +vmpmore=Mere +vmpnone=Ingen +vmpnormal=Normal +wbfs2=WBFS_Open mislykkedes : %i +wbfs3=WBFS_GetCount mislykkedes : %i +wbfs4=WBFS_GetHeaders mislykkedes : %i +wbfsadddlg=Venligst indsæt det spil du gerne vil installere og tryk pÃ¥ start. +wbfsop1=Installer Spil +wbfsop10=Ikke nok disk plads : %i blokke behøves, %i tilrÃ¥dighed +wbfsop2=Slet spil +wbfsop4=Tilbage +wbfsop5=Start +wbfsop6=Installere [%s] %s... +wbfsop7=Spil slettet +wbfsop8=Spil installeret +wbfsop9=En fejl er opstÃ¥et +wbfsoperr1=Disc_Wait fejlede +wbfsoperr2=Disc_Open fejlede +wbfsoperr3=Dette er ikke et Wii spil +wbfsoperr4=Dette spil er allerede installeret +wbfsop11=Det valgte Fil system er read-only. Du kan ikke installere eller slette spil. +wbfsprogress=%i%% +wbfsremdlg=For permanent at slette dette spil : %s, Tryk pÃ¥ start. +wiitdb_code=EN +wtmsg1=Laver WiiTDB database... \ No newline at end of file diff --git a/wii/wiiflow/Languages/dutch.ini b/wii/wiiflow/Languages/dutch.ini new file mode 100644 index 00000000..d42beda7 --- /dev/null +++ b/wii/wiiflow/Languages/dutch.ini @@ -0,0 +1,177 @@ + +[DUTCH] +about1=Originele Lader door %s +about2=Originele Interface door %s +about4=Met dank aan:\n%s +about6=Huidige ontwikkelaars:\n%s +about7=Eerdere ontwikkelaars:\n%s +about8=Gedeeltes Code Verkregen van:\n%s +about9=Ondersteunende Websites:\n%s +alphabetically=alphabetisch +appname=%s v%s +bycontrollers=Door besturing +byesrb=Door PEGI +bygameid=Door Spel I.D. +bylastplayed=Door Laatst Gespeeld +byplaycount=Door Spel Telling +byplayers=Door Spelers +bywifiplayers=Door Wifi Spelers +cd1=Terug +cd2=Wissen +cfg1=Instellingen +cfg10=Terug +cfg11=USB Opslag Emulatie +cfg12=NAND Emulatie +cfg3=Download hoesjes & titels +cfg4=Downloaden +cfg5=Ouderlijk toezicht +cfg6=Ontgrendelen +cfg7=Voer code in +cfga2=Installeer spel +cfga3=Installeren +cfga6=Taal +cfga7=Thema +cfgb1=Ocarina +cfgb3=Standaard video modus +cfgb4=Standaard spel taal +cfgc1=Terugkeren naar +cfgc2=Pas TV breedte aan +cfgc3=Pas TV hoogte aan +cfgc4=Pas Coverflow aan +cfgc5=Start +cfgc6=Horizontale verschuiving +cfgc7=Verticale verschuiving +cfgd5=Bewaar voorkeursinstellingen +cfgd7=Laat categoriën zien bij opstarten +cfgg1=Instellingen +cfgg12=Download hoesje +cfgg13=Downloaden +cfgg14=Patch video modus +cfgg15=Cheat Codes +cfgg16=Selecteer +cfgg17=Categoriën +cfgg18=Hook Type +cfgg21=Terugkeren naar kanaal +cfgg22=Fouten opsporing +cfgg23=Cheat bestand aan het downloaden.... +cfgg24=Spelopslag Emulatie +cfgg2=Video modus +cfgg3=Taal +cfgg4=Land code Patch +cfgg5=Ocarina +cfgg7=Vipatch +cfgg8=Terug +cfgp1=Spel Partitie +cfgp3=Initialiseer netwerk bij opstarten +cfgs1=Muziek volume +cfgs2=GUI geluid volume +cfgs3=Coverflow geluid volume +cfgs4=Spel geluid volume +cheat1=Terug +cheat2=Toepassen +cheat3=Cheat bestand van het spel niet gevonden. +cheat4=Download niet gevonden. +def=Standaard +disabled=Uit +dl1=Annuleren +dl10=Doneer. Doe een gift\naan WiiTDB.com +dl12=WiiTDB +dl2=Terug +dl3=Alles +dl4=Ontbrekende +dl5=Downloaden +dl6=Downloaden +dl8=Hoesjes +dlmsg1=Bezig met initialiseren netwerk... +dlmsg10=Maken van %s +dlmsg11=Bezig met downloaden... +dlmsg12=Downloaden mislukt +dlmsg13=Bezig met opslaan... +dlmsg14=Voltooid. +dlmsg15=Opslaan mislukt! +dlmsg16=bestand kon niet gelezen worden +dlmsg17=Geen nieuwe versies gevonden. +dlmsg18=boot.dol niet in standaard pad gevonden +dlmsg19=Nieuwe Versie beschikbaar! +dlmsg20=Geen versie informatie gevonden. +dlmsg21=WiiFlow zal nu afsluiten om de nieuwe versie te activeren. +dlmsg22=Bijwerken applicatie map... +dlmsg23=Bijwerken data map... +dlmsg24=Aan het uitpakken... +dlmsg25=Uitpakken niet gelukt! De backup wordt hernoemd naar boot.dol +dlmsg26=Cache aan het bijwerken... +dlmsg2=Initialiseren van netwerk mislukt +dlmsg3=Downloaden van %s +dlmsg4=Opslaan in %s +dlmsg5=%i/%i bestanden gedownload +dlmsg6=Annuleren... +dlmsg7=Genereren van lijst te downloaden hoesjes... +dlmsg8=Volledige hoesje niet gevonden. Downloaden van %s +dlmsg9=%i/%i bestanden gedownload. %i bevatten alleen de voorkant van het hoesje. +gameinfo1=Ontwikkelaar: %s +gameinfo2=Uitgever: %s +gameinfo3=Regio: %s +gameinfo4=Release Datum: %i.%i.%i +gameinfo5=Genre: %s +gm1=Spelen +gm2=Terug +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +ios=IOS%i basis %s +lngdef=Standaard +lngdut=Nederlands +lngeng=Engels +lngfre=Frans +lngger=Duits +lngita=Italiaans +lngjap=Japans +lngkor=Koreaans +lngsch=S. Chinees +lngspa=Spaans +lngtch=T. Chinees +main1=Spel Installeren +main2=Welkom bij WiiFlow.\nI heeft geen spellen gevonden.\nKlik op Spel installeren, of Selecteer partitie om de juiste partitiesoort te kiezen. +main3=Selecteer Partitie +off=Uit +on=Aan +players= Spelers +sys1=Systeem +sys2=WiiFlow Versie: +sys3=Stoppen +sys4=Bijwerken +sys7=Geinstalleerde Versie. +translation_author=Cozmo, Etheboss +viddef=Standaard +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Auto Patch +vidsys=Systeem +vidprog=Progressief +vmpall=Alles +vmpmore=Meer +vmpnone=Geen +vmpnormal=Normaal +wbfsadddlg=Plaats het spel dat u wenst te installeren in de disk sleuf, klik vervolgens op Start. +wbfsop1=Installeer Spel +wbfsop10=Niet genoeg ruimte: %i blokken benodigd, %i beschikbaar +wbfsop2=Verwijder Spel +wbfsop4=Terug +wbfsop5=Start +wbfsop6=Bezig met installeren van [%s] %s... +wbfsop7=Spel verwijderd +wbfsop8=Spel geïnstalleerd +wbfsop9=Er is een fout opgetreden +wbfsoperr1=Disc_Wait mislukt +wbfsoperr2=Disc_Open muslukt +wbfsoperr3=Dit is geen Wii disc! +wbfsoperr4=Dit spel is al geïnstalleerd +wbfsprogress=%i%% +wbfsremdlg=Om het spel: "%s" permanent te verwijderen, klik op Start. +wifiplayers= Wifi Spelers +wiitdb_code=NL \ No newline at end of file diff --git a/wii/wiiflow/Languages/english.ini b/wii/wiiflow/Languages/english.ini new file mode 100644 index 00000000..11d81ffb --- /dev/null +++ b/wii/wiiflow/Languages/english.ini @@ -0,0 +1,177 @@ + +[ENGLISH] +about1=Original Loader By:\n%s +about2=Original GUI By:\n%s +about4=Thanks To:\n%s +about6=Current Developers:\n%s +about7=Past Developers:\n%s +about8=Bits of Code Obtained From:\n%s +about9=Supporting Websites:\n%s +alphabetically=aphabetically +appname=%s v%s +bycontrollers=By Controllers +byesrb=By ESRB +bygameid=By Game I.D. +bylastplayed=By Last Played +byplaycount=By Play Count +byplayers=By Players +bywifiplayers=By Wifi Players +cd1=Back +cd2=Erase +cfg1=Settings +cfg10=Back +cfg11=USB Saves Emulation +cfg12=NAND Emulation +cfg3=Download covers & titles +cfg4=Download +cfg5=Parental control +cfg6=Unlock +cfg7=Set code +cfga2=Install game +cfga3=Install +cfga6=Language +cfga7=Theme +cfgb1=Ocarina +cfgb3=Default video mode +cfgb4=Default game language +cfgc1=Exit to +cfgc2=Adjust TV width +cfgc3=Adjust TV height +cfgc4=Adjust Coverflow +cfgc5=Go +cfgc6=Horizontal offset +cfgc7=Vertical offset +cfgd5=Save favorite mode state +cfgd7=Show categories on boot +cfgg1=Settings +cfgg12=Download cover +cfgg13=Download +cfgg14=Patch video modes +cfgg15=Cheat Codes +cfgg16=Select +cfgg17=Categories +cfgg18=Hook Type +cfgg21=Return To Channel +cfgg22=Debugger +cfgg23=Downloading cheat file.... +cfgg24=Savegame Emulation +cfgg2=Video mode +cfgg3=Language +cfgg4=Patch country strings +cfgg5=Ocarina +cfgg7=Vipatch +cfgg8=Back +cfgp1=Game Partition +cfgp3=Init network on boot +cfgs1=Music volume +cfgs2=GUI sound volume +cfgs3=Coverflow sound volume +cfgs4=Game sound volume +cheat1=Back +cheat2=Apply +cheat3=Cheat file for game not found. +cheat4=Download not found. +def=Default +disabled=Disabled +dl1=Cancel +dl10=Please donate\nto WiiTDB.com +dl12=WiiTDB +dl2=Back +dl3=All +dl4=Missing +dl5=Download +dl6=Download +dl8=Covers +dlmsg1=Initializing network... +dlmsg10=Making %s +dlmsg11=Downloading... +dlmsg12=Download failed +dlmsg13=Saving... +dlmsg14=Done. +dlmsg15=Saving failed! +dlmsg16=Couldn't read file +dlmsg17=No new updates found. +dlmsg18=boot.dol not found at default path +dlmsg19=New Update available! +dlmsg20=No version information found. +dlmsg21=WiiFlow will now exit to allow the update to take effect. +dlmsg22=Updating application directory... +dlmsg23=Updating data directory... +dlmsg24=Extracting... +dlmsg25=Extraction must have failed! Renaming the backup to boot.dol +dlmsg26=Updating cache... +dlmsg2=Network initialization failed +dlmsg3=Downloading from %s +dlmsg4=Saving %s +dlmsg5=%i/%i files downloaded +dlmsg6=Canceling... +dlmsg7=Listing covers to download... +dlmsg8=Full cover not found. Downloading from %s +dlmsg9=%i/%i files downloaded. %i are front covers only. +gameinfo1=Developer: %s +gameinfo2=Publisher: %s +gameinfo3=Region: %s +gameinfo4=Release Date: %i.%i.%i +gameinfo5=Genre: %s +gm1=Play +gm2=Back +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +ios=IOS%i base %s +lngdef=Default +lngdut=Dutch +lngeng=English +lngfre=French +lngger=German +lngita=Italian +lngjap=Japanese +lngkor=Korean +lngsch=S. Chinese +lngspa=Spanish +lngtch=T. Chinese +main1=Install Game +main2=Welcome to WiiFlow.\nI have not found any games.\nClick Install to install games, or Select partition to select your partition type. +main3=Select Partition +off=Off +on=On +players= Players +sys1=System +sys2=WiiFlow Version: +sys3=Cancel +sys4=Upgrade +sys7=Installed Version. +translation_author= +viddef=Default +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Auto Patch +vidsys=System +vidprog=Progressive +vmpall=All +vmpmore=More +vmpnone=None +vmpnormal=Normal +wbfsadddlg=Please insert the disc you want to copy, then click on Go. +wbfsop1=Install Game +wbfsop10=Not enough space : %i blocks needed, %i available +wbfsop2=Delete Game +wbfsop4=Back +wbfsop5=Go +wbfsop6=Installing [%s] %s... +wbfsop7=Game deleted +wbfsop8=Game installed +wbfsop9=An error has occurred +wbfsoperr1=Disc_Wait failed +wbfsoperr2=Disc_Open failed +wbfsoperr3=This is not a Wii disc! +wbfsoperr4=Game already installed +wbfsprogress=%i%% +wbfsremdlg=To permanently remove the game : %s, click on Go. +wifiplayers= Wifi Players +wiitdb_code=EN \ No newline at end of file diff --git a/wii/wiiflow/Languages/finnish.ini b/wii/wiiflow/Languages/finnish.ini new file mode 100644 index 00000000..0d98e1ba --- /dev/null +++ b/wii/wiiflow/Languages/finnish.ini @@ -0,0 +1,132 @@ + +[FINNISH] +about1=Alkuperäinen ohjelma %s +about2=Käyttöliittymä %s +about3=Kiitokset :\n\n%s%s%s\n\n%s\n%s +appname=%s v%s +cd1=Takaisin +cd2=Poista +cfg1=Asetukset +cfg10=Takaisin +cfg11=Tärinä +cfg2=3D kotelot +cfg3=Hae kotelokuvat & nimekkeet +cfg4=Hae +cfg5=Lapsilukko +cfg6=Avaa lukitus +cfg7=Aseta koodi +cfga2=Asenna peli +cfga3=Asenna +cfga6=Kieli +cfga7=Teema +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Oletus kuvasignaali +cfgb4=Pelin oletus kieli +cfgc1=Poistu Wii Menuun +cfgc2=Säädä TV:n leveyttä +cfgc3=Säädä TV:n korkeutta +cfgc4=Säädä coverflow'ta +cfgc5=Valitse +cfgc6=Poikkisuuntainen etäisyys +cfgc7=Pystysuuntainen etäisyys +cfgd1=Pakota maa-asetus +cfgd2=Virhe 002 korjaus +cfgd3=Säilytä PNG tiedostot +cfgd4=Pakkaa tekstuurit +cfgd5=Tallenna suosikin tila +cfgd6=Oletus hakutila +cfgg1=Asetukset +cfgg10=IOS +cfgg11=Estä IOS:n vaihto +cfgg12=Hae kotelot +cfgg13=Hae +cfgg14=Pakota videoasetus +cfgg2=Kuvasignaali +cfgg3=Kieli +cfgg4=Pakota maa-asetus +cfgg5=Ocarina +cfgg6=Virhe 002 korjaus +cfgg7=Vipatch +cfgg8=Takaisin +cfgg9=DOL +cfgs1=Musiikin voimakkuus +cfgs2=Käyttöliittymän äänenvoimakkuus +cfgs3=Coverflow'n äänenvoimakkuus +cfgs4=Pelien äänenvoimakkuus +def=Oletus +dl1=Peruuta +dl10=Kansikuvat tarjoaa WiiTDB.com +dl2=Takaisin +dl3=Kaikki +dl4=Puuttuvat +dl5=Hae +dl6=Kaikki +dl7=Puuttuvat +dl8=Kansikuvat +dl9=Pelien nimikkeet +dlmsg1=Etsitään verkkoa... +dlmsg10=Luodaan %s +dlmsg11=Ladataan... +dlmsg12=Lataus epäonnistui +dlmsg13=Tallennetaan... +dlmsg14=Valmis. +dlmsg15=ZIP tiedoston tallennus epäonnistui +dlmsg16=Tiedoston luku epäonnistui +dlmsg2=Verkkoyhteyttä ei löytynyt +dlmsg3=Haetaan %s +dlmsg4=Tallennetaan %s +dlmsg5=%i/%i tiedostoa ladattu +dlmsg6=Peruutetaan... +dlmsg7=Luetteloidaan ladattavia kansikuvia... +dlmsg8=Kokonaista kotelokuvaa ei löytynyt. Ladataan %s +dlmsg9=%i/%i tiedostoa ladattu. %i vain etukuori(a). +gm1=Käynnistä +gm2=Takaisin +lngdef=Oletus +lngdut=Hollanti +lngeng=Englanti +lngfre=Ranska +lngger=Saksa +lngita=Italia +lngjap=Japani +lngkor=Korea +lngsch=Y. Kiina +lngspa=Espanja +lngtch=P. Kiina +main1=Asetukset +main2=Tervetuloa Wiiflow-ohjelmaan. Yhtään asennettua peliä ei löytynyt, voit asentaa pelejä valitsemalla asenna peli asetus valikosta. +off=Pois +on=Päällä +smalpha=Aakkosittain +smpage=Sivua +translation_author=Roku93 +viddef=Oletus +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Automaattinen +vmpall=Täydet +vmpmore=Enemmän +vmpnone=Ei mitään +vmpnormal=Normaali +wbfs2=WBFS_Open epäonnistui : %i +wbfs3=WBFS_GetCount epäonnistui : %i +wbfs4=WBFS_GetHeaders epäonnistui : %i +wbfsadddlg=Aseta asennettava peli levyasemaan ja valitse seuraava. +wbfsop1=Asenna peli +wbfsop10=Ei riittävästi tilaa : %i lohkoa vaaditaan, vain %i saatavilla +wbfsop2=Poista peli +wbfsop4=Takaisin +wbfsop5=Seuraava +wbfsop6=Asennetaan [%s] %s... +wbfsop7=Peli poistettu +wbfsop8=Peli asennettu +wbfsop9=Virhe tapahtui +wbfsoperr1=Disc_Wait epäonnistui +wbfsoperr2=Disc_Open epäonnistui +wbfsoperr3=Asetettu levy ei ole Wii-levy! +wbfsoperr4=Asetettu peli on jo asennettu. +wbfsprogress=%i%% +wbfsremdlg=Poistaaksesi pysyvästi pelin %s, valitse seuraava. +wiitdb_code=EN \ No newline at end of file diff --git a/wii/wiiflow/Languages/french.ini b/wii/wiiflow/Languages/french.ini new file mode 100644 index 00000000..24a88b9d --- /dev/null +++ b/wii/wiiflow/Languages/french.ini @@ -0,0 +1,177 @@ + +[FRENCH] +about1=Lanceur original par :\n%s +about2=Interface originale par :\n%s +about4=Merci à :\n%s +about6=Développeurs actuels :\n%s +about7=Anciens développeurs :\n%s +about8=Morceaux de code obtenu à partir de :\n%s +about9=Sites internet soutenus :\n%s +alphabetically=Alphabétique +appname=%s v%s +bycontrollers=Manettes +byesrb=PEGI +bygameid=Game ID +bylastplayed=Dernier joué +byplaycount=Popularité +byplayers=Joueurs +bywifiplayers=Joueurs wifi +cd1=Retour +cd2=Effacer +cfg1=Paramètres +cfg10=Retour +cfg11=Emulation Sauvegarde USB +cfg12=Emulation NAND +cfg3=Téléchargement jaquettes & titres +cfg4=Télécharger +cfg5=Contrôle parental +cfg6=Débloquer +cfg7=Définir code +cfga2=Installation d'un jeu +cfga3=Installer +cfga6=Langue +cfga7=Thème +cfgb1=Ocarina (triche) +cfgb3=Mode vidéo par défaut +cfgb4=Langue des jeux +cfgc1=Sortir vers +cfgc2=Ajustement TV largeur +cfgc3=Ajustement TV hauteur +cfgc4=Ajustement Coverflow +cfgc5=Ajuster +cfgc6=Décalage horizontal +cfgc7=Décalage vertical +cfgd5=Mémoriser le mode favoris +cfgd7=Voir les catégories au démarrage +cfgg1=Paramètres +cfgg12=Télécharger la jaquette +cfgg13=Télécharger +cfgg14=Patch des modes vidéo +cfgg15=Cheat Codes +cfgg16=Sélectionner +cfgg17=Catégories +cfgg18=Hook Type +cfgg21=Retour vers la chaîne +cfgg22=Debugger +cfgg23=Téléchargement des codes de triche... +cfgg24=Emulation sauvegarde +cfgg2=Video mode +cfgg3=Langue +cfgg4=Patch des codes pays +cfgg5=Ocarina +cfgg7=Vipatch +cfgg8=Retour +cfgp1=Partition de jeu +cfgp3=Init réseau au démarrage +cfgs1=Volume musique +cfgs2=Volume boutons +cfgs3=Volume Coverflow +cfgs4=Volume sélection d'un jeu +cheat1=Retour +cheat2=Appliquer +cheat3=Le fichier de cheat codes pour ce jeu est introuvable. +cheat4=Le téléchargement est introuvable. +def=Défaut +disabled=Désactivé +dl1=Annuler +dl10=Faites un don\npour WiiTDB.com +dl12=WiiTDB +dl2=Retour +dl3=Toutes +dl4=Manquantes +dl5=Téléchargements +dl6=Télécharger +dl8=Jaquettes +dlmsg1=Initialisation réseau... +dlmsg10=Création de %s +dlmsg11=Téléchargement en cours... +dlmsg12=Echec du téléchargement +dlmsg13=Enregistrement... +dlmsg14=Terminé. +dlmsg15=Echec de l'enregistrement du fichier ZIP. +dlmsg16=Erreur lors de la lecture du fichier. +dlmsg17=Aucune nouvelle mise à jour n'a été trouvée. +dlmsg18=Le fichier boot.dol n'a pas été trouvé dans le chemin par défaut. +dlmsg19=Une nouvelle mise à jour est disponible ! +dlmsg2=L'initialisation réseau a échoué. +dlmsg20=Aucune information n'est disponible pour cette version. +dlmsg21=WiiFlow va maintenant s'arrêter pour que la mise à jour prenne effet. +dlmsg22=Mise à jour du répertoire de l'application... +dlmsg23=Mise à jour du répertoire des données... +dlmsg24=Extraction... +dlmsg25=L'extraction doit avoir échoué ! Renomme la copie en boot.dol. +dlmsg26=Mise à jour du cache ... +dlmsg3=Téléchargement de %s +dlmsg4=Enregistrement dans %s +dlmsg5=%i/%i fichiers téléchargés +dlmsg6=Annulation en cours... +dlmsg7=Planification des téléchargements... +dlmsg8=La jaquette complète n'a pas été trouvée.\nTéléchargement de %s. +dlmsg9=%i/%i fichiers téléchargés.\n%i ont seulement la face avant de la boîte. +gameinfo1=Développeur : %s +gameinfo2=Editeur : %s +gameinfo3=Région : %s +gameinfo4=Date de sortie : %i/%i/%i +gameinfo5=Genre : %s +gm1=Jouer +gm2=Retour +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +ios=IOS%i base %s +lngdef=Défaut +lngdut=Néerlandais +lngeng=Anglais +lngfre=Français +lngger=Allemand +lngita=Italien +lngjap=Japonais +lngkor=Coréen +lngsch=Chinois S. +lngspa=Espagnol +lngtch=Chinois T. +main1=Installer un jeu +main2=Bienvenue dans WiiFlow.\nJe n'ai pas trouvé de jeux.\nCliquez sur Installer pour installer des jeux, ou Choisir une partition pour sélectionner votre type de partition. +main3=Choisir une partition +off=Non +on=Oui +players= Joueurs +sys1=Système +sys2=Version de WiiFlow +sys3=Annuler +sys4=Mise à jour +sys7=Version installée. +translation_author= +viddef=Défaut +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Patch auto +vidprog=Progressif +vidsys=Système +vmpall=Tous +vmpmore=Plus +vmpnone=Aucun +vmpnormal=Normal +wbfsadddlg=Veuillez insérer le disque à copier puis cliquez sur OK. +wbfsop1=Installation d'un jeu +wbfsop10=Il n'y a pas assez de place : %i blocs requis, %i disponibles. +wbfsop2=Suppression du jeu +wbfsop4=Retour +wbfsop5=OK +wbfsop6=Installation de [%s] %s... +wbfsop7=Le jeu a été supprimé. +wbfsop8=Le jeu a été installé. +wbfsop9=Une erreur s'est produite. +wbfsoperr1=Disc_Wait a échoué. +wbfsoperr2=Disc_Open a échoué. +wbfsoperr3=Ce n'est pas un disque Wii ! +wbfsoperr4=Ce jeu semble être déjà installé. +wbfsprogress=%i%% +wbfsremdlg=Cliquez sur OK pour supprimer le jeu suivant :\n %s. +wifiplayers= Joueurs en Wifi +wiitdb_code=FR \ No newline at end of file diff --git a/wii/wiiflow/Languages/gallego.ini b/wii/wiiflow/Languages/gallego.ini new file mode 100644 index 00000000..51542059 --- /dev/null +++ b/wii/wiiflow/Languages/gallego.ini @@ -0,0 +1,133 @@ + +[GALLEGO] +about1=Loader feito por %s +about2=GUI feito por %s +about3=Grazas a:\n\n%s%s%s\n\n%s\n%s +appname=%s v%s +cd1=Voltar +Cd2=Borrar +cfg1=Opcions +cfg10=Atras +cfg11=Vibracion +cfg1=Opcions +cfg2=Caixas 3D +cfg3=Descargar Titulos e Caixas +cfg4=Descargar +cfg5=Control parental +cfg6=Desbloquear +cfg7=Introducir clave +cfga2=Instalar un xogo +cfga3=Instalar +cfga6=Idioma +cfga7=Tema +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Modo de video +cfgb4=Idioma do xogo +cfgc1=Sair o menu da Wii +cfgc2=Axustar ancho da TV +cfgc3=Axustar alto da TV +cfgc4=Axustar Coverflow +cfgc5=Axustar +cfgc6=Horizontal offset +cfgc7=Vertical offset +cfgd1=Parchar configuracion da cidade +cfgd2=Arreglar Error 002 +cfgd3=Manter caratulas PNG +cfgd4=Comprimir texturas +cfgd5=Gardar favoritos +cfgd6=Default search mode +cfgg1=Opcions +cfgg10=IOS +cfgg11=Bloquear recarga do IOS +cfgg12=Descargar caratula +cfgg13=Descargar +cfgg14=Parchear modo do video +cfgg2=Modo de video +cfgg3=Idioma +cfgg4=Forzar rexion +cfgg5=Ocarina +cfgg6=Error 002 fix +cfgg7=Vipatch +cfgg8=voltar +cfgg9=DOL +cfgs1=Volumen da musica +cfgs2=Volumen da GUI +cfgs3=Volumen do Coverflow +cfgs4=Volumen da intro do xogo +def=Por defecto +dl1=Cancelar +dl10=Agradecese unha doazon\nto WiiTDB.com +dl2=voltar +dl3=Todas +dl4=Faltantes +dl5=Descargar +dl6=Todos +dl7=Faltantes +dl8=Caratulas +dl9=Nomes dos xogos +dlmsg1=Iniciando REDE... +dlmsg10=Feito %s +dlmsg11=Descargando... +dlmsg12=Eror na descarga +dlmsg13=Gardando... +dlmsg14=Rematado. +dlmsg15=Non se pode gardar arquivo ZIP +dlmsg16=Non se pode leer arquivo +dlmsg2=Non se puido iniciar REDE +dlmsg3=Descargando dende %s +dlmsg4=Gardando %s +dlmsg5=%i/%i arquivos descargados +dlmsg6=Cancelando... +dlmsg7=Revisando que caratula falta... +dlmsg8=Non se encontrou caratula completa. Descargando dende %s +dlmsg9=%i/%i arquivos descargados. %i son so caratulas frontais. +gm1=Xogar +gm2=voltar +lngdef=Por defecto +lngdut=Holandes +lngeng=Ingles +lngfre=Frances +lngger=Aleman +lngita=Italiano +lngjap=Xapones +lngkor=Coreano +lngsch=Chino simple +lngspa=Castelan +lngtch=Chino tradicional +main1=Opcions +main2=Benvido a WiiFlow. Non encontrei ningun xogo. Fai click en opcions para instalar un. +off=Non +on=Si +smalpha=Alfabeticamente +smpage=Paxinas +translation_author=Atanes +vidntsc=NTSC +viddef=Por defecto +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Auto Parchar +vmpall=Todo +vmpmore=MAIS +vmpnone=Ningun +vmpnormal=Normal +wbfs2=Non se pode abrir a unidade WBFS : %i +wbfs3=WBFS_GetCount failed : %i +wbfs4=WBFS_GetHeaders failed : %i +wbfsadddlg=Inserta o disco a copiar, e despois fai click en Ir +wbfsop1=Instalar xogo +wbfsop10=Non hay suficiente espazo : %i bloques necesarios, %i disponibles +wbfsop2=Eliminar xogo +wbfsop4=Voltar +wbfsop5=Ir +wbfsop6=Instalando [%s] %s... +wbfsop7=Xogo eliminado +wbfsop8=Xogo instalado +wbfsop9=Ocurriu un error +wbfsoperr1=Non se encontra un disco valido +wbfsoperr2=Non se pode cargar o disco +wbfsoperr3=Non e un xogo de Wii! +wbfsoperr4=O xogo xa esta instalado +wbfsprogress=%i%% +wbfsremdlg=Para eliminar permanentemente: %s, fai click en Ir. +wiitdb_code=ES \ No newline at end of file diff --git a/wii/wiiflow/Languages/german.ini b/wii/wiiflow/Languages/german.ini new file mode 100644 index 00000000..93f43bbd --- /dev/null +++ b/wii/wiiflow/Languages/german.ini @@ -0,0 +1,177 @@ + +[GERMAN] +about1=Originaler Loader von:\n%s +about2=Originales GUI von:\n%s +about4=Danke an:\n%s +about6=Aktuelle Entwickler:\n%s +about7=Vorherige Entwickler:\n%s +about8=Einige Codes erhalten von:\n%s +about9=Unterstützte Websites:\n%s +alphabetically=Alphabetisch sortiert +appname=%s %s +bycontrollers=Nach Controller +byesrb=Nach ESRB +bygameid=Nach 'Spiel ID' sortiert +bylastplayed=Nach 'Zuletzt gespielt' sortiert +byplaycount=Nach 'Wie oft gespielt' sortiert +bywifiplayers=Nach Wifi Spielern +byplayers=Nach Spielern +cd1=Zurück +cd2=Löschen +cfg1=Einstellungen +cfg10=Zurück +cfg11=USB Saves Emulation +cfg12=NAND Emulation +cfg3=Hüllen & Namen +cfg4=Herunterladen +cfg5=Altersbeschränkungen +cfg6=Entsperren +cfg7=Code eingeben +cfga2=Spiel installieren +cfga3=Installieren +cfga6=Sprache +cfga7=Thema +cfgb1=Ocarina +cfgb3=Standard Videomodus +cfgb4=Standard Sprache für Spiele +cfgc1=Zurück zu... +cfgc2=TV-Breite anpassen +cfgc3=TV-Höhe anpassen +cfgc4=Coverflow anpassen +cfgc5=Start +cfgc6=Horizontaler Bildversatz +cfgc7=Vertikaler Bildversatz +cfgd5=Favoritenmodus merken +cfgd7=Kategorien beim Start anzeigen +cfgg1=Einstellungen +cfgg12=Hülle aktualisieren +cfgg13=Herunterladen +cfgg14=Videomodi patchen +cfgg15=Cheatcodes +cfgg16=Auswählen +cfgg17=Kategorien +cfgg18=Hook-Typ +cfgg21=Zu Kanal zurückkehren +cfgg22=Debugger +cfgg23=Cheatdatei wird heruntergeladen... +cfgg24=Savegame Emulation +cfgg2=Videomodus +cfgg3=Sprache +cfgg4=Länder-Strings patchen +cfgg5=Ocarina +cfgg7=Video patchen +cfgg8=Zurück +cfgp1=Spielpartition +cfgp3=Netzwerk beim Start initialisieren +cfgs1=Lautstärke Hintergrundmusik +cfgs2=Lautstärke Tasten +cfgs3=Lautstärke Coverflow +cfgs4=Lautstärke Spiel-Melodie +cheat1=Zurück +cheat2=Ãœbernehmen +cheat3=Es wurde keine Cheatdatei für dieses Spiel gefunden. +cheat4=Datei nicht gefunden: +def=Standard +disabled=Deaktiviert +dl1=Abbrechen +dl10=Bitte spendet\nan WiiTDB.com +dl12=WiiTDB +dl2=Zurück +dl3=Alle +dl4=Fehlende +dl5=Download +dl6=Download +dl8=Hüllen herunterladen +dlmsg1=Netzwerk wird initialisiert... +dlmsg10=%s wird erstellt... +dlmsg11=Daten werden heruntergeladen... +dlmsg12=Das Herunterladen ist fehlgeschlagen. +dlmsg13=Daten werden gespeichert... +dlmsg14=Fertig +dlmsg15=ZIP-Datei konnte nicht speichern werden. +dlmsg16=Datei konnte nicht lesen werdem. +dlmsg17=Es ist keine neuere Version verfügbar. +dlmsg18=Es wurde keine boot.dol im Standardpfad gefunden. +dlmsg19=Neue Version verfügbar! +dlmsg20=Keine Informationen über diese Version gefunden. +dlmsg21=WiiFlow wird sich jetzt beenden, damit die Änderungen Wirkung zeigen. +dlmsg22=Aktualisiere Anwendungsverzeichnis... +dlmsg23=Aktualisiere Datenverzeichnis... +dlmsg24=Extracting... +dlmsg25=Extraction must have failed! Renaming the backup to boot.dol +dlmsg26=Updating cache... +dlmsg2=Netzwerkinitialisierung fehlgeschlagen. +dlmsg3=Lade von %s herunter +dlmsg4=Speichere %s +dlmsg5=%i/%i Dateien heruntergeladen +dlmsg6=Vorgang wird abgebrochen... +dlmsg7=Erstelle Liste der zu ladenden Hüllen... +dlmsg8=Vollständige Hülle nicht gefunden. Lade von %s +dlmsg9=%i/%i Hüllen wurden heruntergeladen. Von %i nur die Vorderseite. +gameinfo1=Entwickler: %s +gameinfo2=Verleger: %s +gameinfo3=Region: %s +gameinfo4=Erscheinungstermin: %i.%i.%i +gameinfo5=Genre: %s +gm1=Spielen +gm2=Zurück +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +ios=IOS%i Basis %s +lngdef=Standard +lngdut=Holländisch +lngeng=Englisch +lngfre=Französisch +lngger=Deutsch +lngita=Italienisch +lngjap=Japanisch +lngkor=Koreanisch +lngsch=Chinesisch (einfach) +lngspa=Spanisch +lngtch=Chinesisch (traditionell) +main1=Installieren +main2=Willkommen zu WiiFlow.\n\nEs wurde kein Spiel gefunden.\nKlicke Installieren um Spiele zu installieren oder Partition um deinen Partitionstyp zu ändern. +main3=Partition +off=Aus +on=An +players= Players +sys1=Update Informationen +sys2=WiiFlow Version: +sys3=Abbrechen +sys4=Updaten +sys7=Derzeit installierte Version. +translation_author=Domi78, PizzaPino, ZEN.13, FIX94 +viddef=Standard +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Auto Patch +vidsys=System +vidprog=Progressive +vmpall=Alle +vmpmore=Mehr +vmpnone=Keinen +vmpnormal=Normal +wbfsadddlg=Bitte das Spiel, das installiert werden soll, einlegen und Start klicken. +wbfsop1=Spiel installieren +wbfsop10=Nicht genügend Speicherplatz: %i Blöcke sind nötig, aber nur %i verfügbar. +wbfsop2=Spiel löschen +wbfsop4=Zurück +wbfsop5=Start +wbfsop6=Installiere [%s] %s... +wbfsop7=Das Spiel wurde erfolgreich gelöscht. +wbfsop8=Das Spiel wurde erfolgreich installiert. +wbfsop9=Ein Fehler ist aufgetreten. +wbfsoperr1=Disc_Wait fehlgeschlagen +wbfsoperr2=Disc_Open fehlgeschlagen +wbfsoperr3=Das ist keine Wii Disc! +wbfsoperr4=Dieses Spiel ist bereits installiert. +wbfsprogress=%i%% +wbfsremdlg=Um das Spiel "%s" dauerhaft zu löschen, auf Start klicken. +wifiplayers= Wifi Players +wiitdb_code=DE \ No newline at end of file diff --git a/wii/wiiflow/Languages/hungarian.ini b/wii/wiiflow/Languages/hungarian.ini new file mode 100644 index 00000000..6a3057b5 --- /dev/null +++ b/wii/wiiflow/Languages/hungarian.ini @@ -0,0 +1,132 @@ + +[HUNGARIAN] +about1=Loader-t készített %s +about2=GUI-t készítette %s +about3=Köszönet :\n\n%s%s%s\n\n%s\n%s +appname=%s v%s +cd1=Vissza +cd2=Törlés +cfg1=Beállítások +cfg10=Vissza +cfg11=Rezgés +cfg2=3D hatás +cfg3=Borítók és címek +cfg4=Letöltés +cfg5=Gyerekzár +cfg6=Feloldás +cfg7=Kód megadás +cfga2=Játék telepítés lemezrÅ‘l +cfga3=Indítás +cfga6=Nyelv +cfga7=Téma +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Alapértelmezett videó mód +cfgb4=Alapértelmezett játék nyelv +cfgc1=Kilépés a Wii Menu-be +cfgc2=TV szélesség beállítása +cfgc3=TV magasság beállítása +cfgc4=Coverflow +cfgc5=Testre szabás +cfgc6=Vízszintes eltolás +cfgc7=FüggÅ‘leges eltolás +cfgd1=Patch Ország kód +cfgd2=Error 002 fix +cfgd3=PNG állományok megtartása +cfgd4=Struktúra tömörítése +cfgd5=Kedvencek megjegyzése +cfgd6=-/+ lapozási mód +cfgg1=Beállítások +cfgg10=IOS +cfgg11=IOS újratöltésének blokkolása +cfgg12=Borító letöltés +cfgg13=Indítás +cfgg14=Patch videó mód +cfgg2=Videó mód +cfgg3=Nyelv +cfgg4=Patch Ország kód +cfgg5=Ocarina +cfgg6=Error 002 fix +cfgg7=Vipatch +cfgg8=Vissza +cfgg9=DOL +cfgs1=Zene hangereje +cfgs2=GUI hangok +cfgs3=Coverflow hangok +cfgs4=Játék hangok +def=Alapértelmezett +dl1=Vissza +dl10=Támogasd\na WiiTDB.com-t +dl2=Vissza +dl3=Összes +dl4=Hiányzók +dl5=Letöltés +dl6=Összes +dl7=Hiányzók +dl8=Borítók +dl9=Játék címek +dlmsg1=Hálózati kapcsolat létrehozása... +dlmsg10=%s létrehozása +dlmsg11=Letöltés... +dlmsg12=Letöltés sikertelen +dlmsg13=Mentés... +dlmsg14=Befejezve. +dlmsg15=ZIP állomány mentése sikertelen +dlmsg16=Ãllomány nem olvasható +dlmsg2=Hálózati kapcsolat nem jött létre +dlmsg3=Letöltés: %s +dlmsg4=Mentés: %s +dlmsg5=%i/%i állomány letöltve +dlmsg6=Megszakítás... +dlmsg7=LetöltendÅ‘ borítók listázása... +dlmsg8=A teljes borító nem található. Letöltés: %s +dlmsg9=%i/%i állomány letöltve, de %i borító csak egy oldalas. +gm1=Indítás +gm2=Vissza +lngdef=Alapértelmezett +lnghun=Magyar +lngeng=Angol +lngfre=Francia +lngger=Német +lngita=Olasz +lngjap=Japán +lngkor=Korea +lngsch=S. Kínai +lngspa=Spanyol +lngtch=T. Kínai +main1=Beállítások +main2=Ãœdvözöl a WiiFlow. Egyetlen játékot sem találtam. Játék telepítéséhez kattints a beállításokra. +off=Ki +on=Be +smalpha=Betünként +smpage=Oldalanként +translation_author=L@zy +viddef=Alapértelmezett +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Auto Patch +vmpall=Mindig +vmpmore=Ha azonos +vmpnone=Soha +vmpnormal=Normál +wbfs2=WBFS_Open híba : %i +wbfs3=WBFS_GetCount híba : %i +wbfs4=WBFS_GetHeaders híba : %i +wbfsadddlg=Helyezze be a telepíteni kívánt lemezt, majd kattintson az OK gombra. +wbfsop1=Játék telepítése +wbfsop10=Nincs elég hely : %i blokk szűkséges, %i áll rendelkezésre +wbfsop2=Játék törlése +wbfsop4=Vissza +wbfsop5=Ok +wbfsop6=Telepítés [%s] %s... +wbfsop7=Játék törölve +wbfsop8=Játék sikeresen telepítve +wbfsop9=Híba történt +wbfsoperr1=Disc_Wait híba +wbfsoperr2=Disc_Open híba +wbfsoperr3=Ez nem egy Wii lemez! +wbfsoperr4=Ezt a játék már telepítve van +wbfsprogress=%i%% +wbfsremdlg=%s játék végleges törléséhez, kattintson az OK gombra. +wiitdb_code=EN \ No newline at end of file diff --git a/wii/wiiflow/Languages/italian.ini b/wii/wiiflow/Languages/italian.ini new file mode 100644 index 00000000..0c6c251a --- /dev/null +++ b/wii/wiiflow/Languages/italian.ini @@ -0,0 +1,177 @@ + +[ITALIAN] +about1=Loader Originale Di:\n%s +about2=GUI Originale Di:\n%s +about4=Grazie A:\n%s +about6=Programmatori Attuali:\n%s +about7=Programmatori Passati:\n%s +about8=Pezzi Di Codice Ottenuti Da:\n%s +about9=Siti Che Supportano Il Progetto:\n%S +alphabeticaly=Alfabeticamente +appname=%s v%s +bycontrollers=Numero di Telecomandi +byesrb=Classificazione ESRB +bygameid=Game I.D. +bylastplayed=Ultimo Giocato +byplaycount=Più Giocato +byplayers=Numero di Giocatori +bywifiplayers=Numero di Giocatori Wifi +cd1=Indietro +cd2=Cancella +cfg1=Impostazioni +cfg10=Indietro +cfg11=USB Saves Emulation +cfg12=NAND Emulation +cfg3=Scarica copertine e titoli +cfg4=Scarica +cfg5=Controllo genitori +cfg6=Sblocca +cfg7=Imposta codice +cfga2=Installa gioco +cfga3=Installa +cfga6=Lingua +cfga7=Tema +cfgb1=Ocarina +cfgb3=Modalità video predefin. +cfgb4=Lingua gioco predefinita +cfgc1=Uscita al +cfgc2=Impostazione larghezza TV +cfgc3=Impostazione altezza TV +cfgc4=Impostazione coverflow +cfgc5=Procedi +cfgc6=Spostamento orizzontale +cfgc7=Spostamento verticale +cfgd5=Salvataggio modalità preferita +cfgd7=Mostra le categorie all'accensione +cfgg1=Impostazioni +cfgg12=Scarica la copertina +cfgg13=Scarica +cfgg14=Modifica modalità video +cfgg15=Codici +cfgg16=Seleziona +cfgg17=Categorie +cfgg18=Hook Type +cfgg21=Ritorno al Canale +cfgg22=Debugger +cfgg23=Scaricamento Codici... +cfgg24=Savegame Emulation +cfgg2=Modalità video +cfgg3=Lingua +cfgg4=Correzione codici regione +cfgg5=Ocarina +cfgg7=Vipatch +cfgg8=Indietro +cfgp1=Partizione di gioco +cfgp3=inizia network all'avvio +cfgs1=Volume musica +cfgs2=Volume suono GUI +cfgs3=Volume suono coverflow +cfgs4=Volume suono gioco +cheat1=Indietro +cheat2=Applica +cheat3=Codici per il gioco non trovati. +cheat4=Download non trovato. +def=Predefinito +disabled=Disabilita +dl1=Annulla +dl10=Si invita a fare una\ndonazione a WiiTDB.com +dl12=WiiTDB +dl2=Indietro +dl3=Tutte +dl4=Mancanti +dl5=Scaricamento +dl6=Scaricamento +dl8=Copertine +dlmsg1=Inizializzazione rete... +dlmsg10=Sto creando %s +dlmsg11=Sto scaricando... +dlmsg12=Impossibile scaricare +dlmsg13=Sto salvando... +dlmsg14=Completato. +dlmsg15=Impossibile salvare il file ZIP +dlmsg16=Impossibile leggere il file +dlmsg17=Nessun Aggiornamento trovato +dlmsg18=boot.dol non trovato nella cartella di default +dlmsg19=Nuovo aggiornamento disponibile! +dllmsg20=Informazioni versione non trovate +dlmsg21=Wiiflow uscirà in modo che l'aggiornamento abbia effetto +dlmsg22=Aggiornamento cartelle applicazione... +dlmsg23=Aggiornamento dati directory... +dlmsg24=Extracting... +dlmsg25=Extraction must have failed! Renaming the backup to boot.dol +dlmsg26=Updating cache... +dlmsg2=inizzializazione rete fallita +dlmsg3=Sto scaricando da %s +dlmsg4=Sto salvando %s +dlmsg5=%i/%i file scaricati +dlmsg6=Sto annullando... +dlmsg7=Sto elencando le copertine da scaricare... +dlmsg8=Copertine complete non trovate. Sto scaricando da %s +dlmsg9=%i/%i file scaricati. %i sono copertine solo anteriori. +gameinfo1=Sviluppatore : %s +gameinfo2=Editore : %s +gameinfo3=Regione : %s +gameinfo4=Data di rilascio : %i/%i/%i +gameinfo5=Genere : %s +gm1=Gioca +gm2=Indietro +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +ios=IOS%i base %s +lngdef=Predefinita +lngdut=Olandese +lngeng=Inglese +lngfre=Francese +lngger=Tedesco +lngita=Italiano +lngjap=Giapponese +lngkor=Coreano +lngsch=Cinese Semp. +lngspa=Spagnolo +lngtch=Cinese Trad. +main1=Installa Gioco +main2=Benvenuto su WiiFlow.\nnon ho trovato nessun gioco.\nPremi Installa per installare i giochi, o Seleziona partizione per selezionare il tuo tipo di partizione +main3=Seleziona la partizione +off=Disattivata +on=Attivata +players= Players +sys1=Sistema +sys2=Versione Wiiflow: +sys3=Annulla +sys4=Aggiorna +sys7=Versione Installata. +translation_author=Cambo, Divi, XFede +viddef=Predefinita +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Automatica +vidsys=Sistema +vidprog=Progressivo +vmpall=Tutte +vmpmore=Altre +vmpnone=Nessuna +vmpnormal=Normale +wbfsadddlg=Si prega di inserire il disco da copiare, poi premere su Procedi. +wbfsop1=Installazione Gioco +wbfsop10=Spazio insufficiente : %i blocchi necessari, %i disponibili +wbfsop2=Rimozione Gioco +wbfsop4=Indietro +wbfsop5=Procedi +wbfsop6=Sto installando [%s] %s... +wbfsop7=Gioco eliminato +wbfsop8=Gioco installato +wbfsop9=E' avvenuto un errore +wbfsoperr1=Disc_Wait fallito +wbfsoperr2=Disc_Open fallito +wbfsoperr3=Questo non è un disco Wii! +wbfsoperr4=Gioco già installato +wbfsprogress=%i%% +wbfsremdlg=Per rimuovere definitivamente il gioco : %s, premi su Procedi. +wifiplayers= Wifi Players +wiitdb_code=IT \ No newline at end of file diff --git a/wii/wiiflow/Languages/japanese.ini b/wii/wiiflow/Languages/japanese.ini new file mode 100644 index 00000000..90a18180 --- /dev/null +++ b/wii/wiiflow/Languages/japanese.ini @@ -0,0 +1,197 @@ + +[JAPANESE] +about1=ローダー… %s +about2=GUI… %s +about3=å”力 :\n\n%s%s%s\n\n%s\n%s +alphabetically=アルファベット順 +appname=%s v%s r%s +byplaycount=プレイ回数 +bylastplayed=最近éŠã‚“ã ã‚²ãƒ¼ãƒ  +bygameid=ゲームID +cd1=ã‚‚ã©ã‚‹ +cd2=消去 +cfg1=設　定 +cfg2=３Ｄカãƒãƒ¼ +cfg3=ã‚«ãƒãƒ¼ç­‰ã®ãƒ€ã‚¦ãƒ³ãƒ­ãƒ¼ãƒ‰ +cfg4=é¸æŠžã«é€²ã‚€ +cfg5=使用制é™ã®è¨­å®š +cfg6=解除 +cfg7=設定 +cfg10=ã‚‚ã©ã‚‹ +cfg11=リモコンã®æŒ¯å‹• +cfga2=ゲームã®è¿½åŠ  +cfga3=実行 +cfga6=表示言語 +cfga7=テーマ +cfgb1=ãƒãƒ¼ãƒˆæ©Ÿèƒ½ +cfgb2=ä¿¡å·ãƒ‘ッム+cfgb3=ãƒ“ãƒ‡ã‚ªå½¢å¼ +cfgb4=ゲームã®è¨€èªž +cfgc1=終了後ã®æˆ»ã‚Šå…ˆ +cfgc2=ç”»é¢è¡¨ç¤ºå¹… +cfgc3=ç”»é¢è¡¨ç¤ºé«˜ +cfgc4=ç”»é¢è¡¨ç¤ºã®è¨­å®š +cfgc5=ã¯ã˜ã‚ã‚‹ +cfgc6=水平オフセット +cfgc7=垂直オフセット +cfgd1=日本文パッム+cfgd2=Error002対策 +cfgd3=ã‚«ãƒãƒ¼ç”»åƒã®ä¿æŒ +cfgd4=テクスãƒãƒ£ã®åœ§ç¸® +cfgd5=起動時ã®ãŠæ°—ã«å…¥ã‚Šè¡¨ç¤º +cfgd6=検索方法 +cfgd7=起動時ã®ã‚«ãƒ†ã‚´ãƒªè¡¨ç¤º +cfgg1=設　定 +cfgg10=IOS +cfgg11=IOSå†èª­ã¿è¾¼ã¿ã®ç¦æ­¢ +cfgg12=ã‚«ãƒãƒ¼ã®ãƒ€ã‚¦ãƒ³ãƒ­ãƒ¼ãƒ‰ +cfgg13=実行 +cfgg14=ビデオ形å¼ã®ãƒ‘ッム+cfgg15=ãƒãƒ¼ãƒˆã‚³ãƒ¼ãƒ‰ +cfgg16=詳細 +cfgg17=カテゴリ +cfgg18=ãƒ•ãƒƒã‚¯æ–¹å¼ +cfgg19=DVDパッãƒã®ç„¡åŠ¹åŒ– +cfgg2=ãƒ“ãƒ‡ã‚ªå½¢å¼ +cfgg20=ãƒãƒ£ãƒ³ãƒãƒ«å¾©å¸°ã®ç„¡åŠ¹åŒ– +cfgg21=ãƒãƒ£ãƒ³ãƒãƒ«å¾©å¸° +cfgg22=デãƒãƒƒã‚¬ +cfgg23=ãƒãƒ¼ãƒˆã‚’ダウンロード中ã§ã™â€¦ +cfgg3=言語 +cfgg4=日本文パッム+cfgg5=ãƒãƒ¼ãƒˆæ©Ÿèƒ½ +cfgg6=Error002対策 +cfgg7=ä¿¡å·ãƒ‘ッム+cfgg8=ã‚‚ã©ã‚‹ +cfgg9=DOL +cfgp1=使用ã™ã‚‹é ˜åŸŸ +cfgp2=フォルダã®ä½¿ç”¨ +cfgp3=起動時ã®ãƒãƒƒãƒˆæŽ¥ç¶š +cfgs1=BGMã®éŸ³é‡ +cfgs2=効果音ã®éŸ³é‡ +cfgs3=ã‚«ãƒãƒ¼è¡¨ç¤ºã®éŸ³é‡ +cfgs4=ãƒãƒŠãƒ¼éŸ³ã®éŸ³é‡ +cheat1=ã‚‚ã©ã‚‹ +cheat2=é©ç”¨ +cheat3=ãƒãƒ¼ãƒˆãƒ•ã‚¡ã‚¤ãƒ«ãŒè¦‹ã¤ã‹ã‚Šã¾ã›ã‚“ +cheat4=ダウンロードã§ãã¾ã›ã‚“ +cheat5=é¸æŠž +def=デフォルト +disabled=無効 +dl1=ã‚„ã‚ã‚‹ +dl10=ã©ã†ãžWiiTDB.comã¸\n寄付ã—ã¦ãã ã•ã„ +dl11=更新版 +dl2=ã‚‚ã©ã‚‹ +dl3=ã™ã¹ã¦ +dl4=ä¸è¶³åˆ†ã®ã¿ +dl5=ダウンロード +dl6=ã™ã¹ã¦ +dl7=ä¸è¶³åˆ†ã®ã¿ +dl8=ã‚«ãƒãƒ¼ç”»åƒ +dl9=ゲームåã®ãƒªã‚¹ãƒˆ +dlmsg1=接続中ã§ã™... +dlmsg10=%sを作æˆã—ã¾ã—㟠+dlmsg11=ダウンロード中ã§ã™... +dlmsg12=ダウンロードã«å¤±æ•—ã—ã¾ã—㟠+dlmsg13=ä¿å­˜ä¸­ã§ã™... +dlmsg14=終了ã—ã¾ã—㟠+dlmsg15=ZIPファイルをä¿å­˜ã§ãã¾ã›ã‚“ +dlmsg16=ファイルãŒèª­ã‚ã¾ã›ã‚“ +dlmsg17=最新版を使用中ã§ã™ +dlmsg18=boot.dolãŒæ¨™æº–フォルダã«ã‚ã‚Šã¾ã›ã‚“ +dlmsg19=æ›´æ–°ãŒã‚ã‚Šã¾ã™! +dlmsg20=ãƒãƒ¼ã‚¸ãƒ§ãƒ³æƒ…å ±ãŒè¦‹ã¤ã‹ã‚Šã¾ã›ã‚“ +dlmsg21=更新を完了ã™ã‚‹ãŸã‚å†èµ·å‹•ã—ã¾ã™ +dlmsg22=アプリフォルダを更新中ã§ã™... +dlmsg23=データフォルダを更新中ã§ã™... +dlmsg2=ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«æŽ¥ç¶šã§ãã¾ã›ã‚“ +dlmsg3=%s\nダウンロード中ã§ã™ +dlmsg4=%s\nã«ä¿å­˜ä¸­ã§ã™ +dlmsg5=%i個(%i個中)ã®ãƒ•ã‚¡ã‚¤ãƒ«ãŒãƒ€ã‚¦ãƒ³ãƒ­ãƒ¼ãƒ‰ã•ã‚Œã¾ã—㟠+dlmsg6=中止ã—ã¦ã„ã¾ã™... +dlmsg7=ã‚«ãƒãƒ¼ã‚’æ•´ç†ä¸­ã§ã™... +dlmsg8=フルカãƒãƒ¼ã‚’%s\nã‹ã‚‰ãƒ€ã‚¦ãƒ³ãƒ­ãƒ¼ãƒ‰ã—ã¾ã™ +dlmsg9=%i個(%i個中)ã®ãƒ•ã‚¡ã‚¤ãƒ«\n(%i個ã¯å‰é¢ã‚«ãƒãƒ¼ã®ã¿)をダウンロードã—ã¾ã—㟠+gameinfo1=開発元: %s +gameinfo2=発売元: %s +gameinfo3=リージョン: %s +gameinfo4=発売日: %iå¹´%i月%iæ—¥ +gameinfo5=ジャンル: %s +gm1=ã¯ã˜ã‚ã‚‹ +gm2=ã‚‚ã©ã‚‹ +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +ios=IOS%i rev%i(IOS%iベース) +lngdef=デフォルト +lngdut=オランダ語 +lngeng=英語 +lngfre=フランス語 +lngger=ドイツ語 +lngita=イタリア語 +lngjap=日本語 +lngkor=韓国語 +lngsch=簡体字中国語 +lngspa=スペイン語 +lngtch=ç¹ä½“字中国語 +main1=設　定 +main2=Wiiflowã¸ã‚ˆã†ã“ã\nゲームを追加ã™ã‚‹ã‹åˆ¥ã®é ˜åŸŸã‚’é¸ã‚“ã§ãã ã•ã„ +main3=領域ã®é¸æŠž +menu=メニュー +off=使ã‚ãªã„ +on=使ㆠ+smalpha=ｱﾙﾌｧï¾ï¾žï½¯ï¾„é † +smpage=ページ +sys1=æ›´æ–° +sys2=ãƒãƒ¼ã‚¸ãƒ§ãƒ³: +sys3=ã‚„ã‚ã‚‹ +sys4=更　新 +sys5=空ã容é‡: +sys6=IOS: +sys7=ç¾åœ¨ã®ï¾Šï¾žï½°ï½¼ï¾žï½®ï¾ +translation_author=K-M +viddef=デフォルト +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=自動パッム+vidsys=ｼｽﾃﾑã®æ¨™æº– +vidprog=ﾌﾟﾛｸﾞﾚｯｼﾌﾞ +vmpall=全㦠+vmpmore=ã‚‚ã£ã¨ +vmpnone=ãªã— +vmpnormal=普通 +wbfs2=WBFSã‚’é–‹ã‘ã¾ã›ã‚“ : %i +wbfs3=WBFSã‚’èªè­˜ã§ãã¾ã›ã‚“ : %i +wbfs4=WBFSã®ãƒ˜ãƒƒãƒ€ã‚’å–å¾—ã§ãã¾ã›ã‚“ : %i +wbfsadddlg=ディスクを挿入ã—\n[次ã«é€²ã‚€]ボタンを押ã—ã¦ãã ã•ã„ +wbfsop1=ｹﾞｰﾑã®è¿½åŠ  +wbfsop10=空ã容é‡ãŒä¸è¶³ã—ã¦ã„ã¾ã™: %iブロック必è¦ï½¤%iブロック使用å¯èƒ½ +wbfsop11=ã“ã®ãƒ‡ãƒã‚¤ã‚¹ã¯èª­ã¿å–り専用ã§ã™\nゲームã®è¿½åŠ ã‚„削除ã¯ã§ãã¾ã›ã‚“ +wbfsop2=ゲームã®å‰Šé™¤ +wbfsop4=戻る +wbfsop5=次ã«é€²ã‚€ +wbfsop6=追加中 [%s] %s... +wbfsop7=ゲームを削除ã—ã¾ã—㟠+wbfsop8=ゲームを追加ã—ã¾ã—㟠+wbfsop9=エラーãŒç™ºç”Ÿã—ã¾ã—㟠+wbfsoperr1=ドライブã«ãƒ‡ã‚£ã‚¹ã‚¯ãŒã‚ã‚Šã¾ã›ã‚“ +wbfsoperr2=ディスクã®å±•é–‹ã«å¤±æ•—ã—ã¾ã—㟠+wbfsoperr3=Wiiディスクã§ã¯ã‚ã‚Šã¾ã›ã‚“! +wbfsoperr4=追加済ã§ã™ +wbfsprogress=%i%% +wbfsremdlg=%s\nを削除ã™ã‚‹ã«ã¯[次ã«é€²ã‚€]を押ã—ã¦ãã ã•ã„ +wtmsg1=WiiTDBデータベースを作æˆä¸­... +action=アクション +adventure=アドベンãƒãƒ£ãƒ¼ +fighting=格闘 +minigames=ミニゲーム +party=パーティ +puzzle=パズル +simulation=シミュレーション +sport=スãƒãƒ¼ãƒ„ +wiitdb_code=JA \ No newline at end of file diff --git a/wii/wiiflow/Languages/norwegian.ini b/wii/wiiflow/Languages/norwegian.ini new file mode 100644 index 00000000..607c0402 --- /dev/null +++ b/wii/wiiflow/Languages/norwegian.ini @@ -0,0 +1,186 @@ + +[NORWEGIAN] +about1=Loader av %s +about2=GUI av %s +about3=Takk til :\n\n%s%s%s\n\n%s\n%s +alphabetically=Alfabetisk +appname=%s v%s +byplaycount=Ganger spilt +bylastplayed=Sist spilt +bygameid=Spill ID +cd1=Tilbake +cd2=Slett +cfg1=Innstillinger +cfg10=Tilbake +cfg11=Vibrasjon +cfg2=3D Cover +cfg3=Last ned cover & titler +cfg4=Last ned +cfg5=Foreldrekontroll +cfg6=LÃ¥s opp +cfg7=PIN +cfga2=Installer spill +cfga3=Installer +cfga6=SprÃ¥k +cfga7=Tema +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Video modus +cfgb4=Velg sprÃ¥k i spill +cfgc1=Avslutt til +cfgc2=Tilpass TV bredde +cfgc3=Tilpass TV høyde +cfgc4=Tilpass Coverflow +cfgc5=Start +cfgc6=Vannrett offset +cfgc7=Loddrett offset +cfgd1=Patch land strenger +cfgd2=Error 002 fiks +cfgd3=Behold PNG filer +cfgd4=Komprimer teksturer +cfgd5=Lagre favoritt modus +cfgd6=Standard søkemetode +cfgd7=Vis kategorier ved oppstart +cfgg1=Innstillinger +cfgg10=IOS +cfgg11=Blokker IOS restart +cfgg12=Last ned cover +cfgg13=Last ned +cfgg14=Patch video modus +cfgg15=Juksekoder +cfgg16=Velg +cfgg17=Kategorier +cfgg18=Hook Type +cfgg19=Deaktiver DVD Patch +cfgg20=Deaktiver Tilbake til +cfgg21=Tilbake til Channel +cfgg22=Debugger +cfgg23=Laster ned juksefil... +cfgg2=Video modus +cfgg3=SprÃ¥k +cfgg4=Patch land strenger +cfgg5=Ocarina +cfgg6=Error 002 fiks +cfgg7=Vipatch +cfgg8=Tilbake +cfgg9=DOL +cfgp1=Spill partisjon +cfgp2=Installer til mappe +cfgp3=Initialiser nettverk ved oppstart +cfgs1=Musikk volum +cfgs2=GUI volum +cfgs3=Coverflow volum +cfgs4=Spill volum +cheat1=Tilbake +cheat2=Aktiver +cheat3=Juksekoder for spill ikke funnet. +cheat4=Nedlasting ikke funnet. +def=Standard +disabled=Deaktivert +dl1=Avbryt +dl10=Vennligst doner\ntil WiiTDB.com +dl11=Oppdater versjon +dl2=Tilbake +dl3=Alle +dl4=Mangler +dl5=Last ned +dl6=Alle +dl7=Mangler +dl8=Cover +dl9=Spill titler +dlmsg1=Initialiserer nettverk... +dlmsg10=Oppretter %s +dlmsg11=Laster ned... +dlmsg12=Nedlasting feilet +dlmsg13=Lagrer... +dlmsg14=Ferdig. +dlmsg15=Kan ikke lagre ZIP fil +dlmsg16=Kan ikke lese ZIP fil +dlmsg17=Ingen nye oppdateringer funnet. +dlmsg18=boot.dol ikke funnet i standard mappe +dlmsg19=Ny oppdatering tilgjengelig! +dlmsg20=Ingen versjonsinformasjon funnet. +dlmsg21=WiiFlow vil nÃ¥ avslutte for Ã¥ ta i bruk oppdateringen. +dlmsg22=Oppdaterer programmappe... +dlmsg23=Oppdaterer datamappe... +dlmsg2=Initialisering av nettverk feilet +dlmsg3=Laster ned fra %s +dlmsg4=Lagrer %s +dlmsg5=%i/%i filer lastet ned +dlmsg6=Avbryter... +dlmsg7=Lister cover til nedlasting... +dlmsg8=Full cover ikke funnet. Laster ned fra %s +dlmsg9=%i/%i filer lastet ned. %i er kun front cover. +gameinfo1=Utvikler: %s +gameinfo2=Utgiver: %s +gameinfo3=Region: %s +gameinfo4=Utgivelsesdato: %i.%i.%i +gameinfo5=Sjanger: %s +gm1=Spill +gm2=Tilbake +hooktype1=VBI +hooktype2=KPAD les +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +lngdef=Standard +lngdut=Nederlandsk +lngeng=Engelsk +lngfre=Fransk +lngger=Tysk +lngita=Italiensk +lngjap=Japansk +lngkor=Korea +lngsch=S. Kinesisk +lngspa=Spansk +lngtch=T. Kinesisk +main1=Installer spill +main2=Velkommen til WiiFlow.\nIngen spill funnet.\nKlikk pÃ¥ Installer spill for Ã¥ installere spill, eller Velg partisjon for Ã¥ velge partisjon. +main3=Velg partisjon +off=Av +on=PÃ¥ +smalpha=Alfabetisk +smpage=Sider +sys1=System +sys2=WiiFlow versjon: +sys3=Avbryt +sys4=Oppdater +sys5=Ledig plass: +sys6=IOS versjon: +sys7=Installert versjon. +translation_author=raschi +viddef=Standard +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Auto Patch +vidprog=Progressiv +vidsys=System +vmpall=Alle +vmpmore=Flere +vmpnone=Ingen +vmpnormal=Normal +wbfs2=WBFS_Open feilet : %i +wbfs3=WBFS_GetCount feilet : %i +wbfs4=WBFS_GetHeaders feilet : %i +wbfsadddlg=Vennligst sett inn det spillet du vil installere\nog klikk pÃ¥ OK. +wbfsop1=Installer spill +wbfsop10=Ikke nok diskplass : %i blokker trengs, %i tilgjengelig +wbfsop11=Filsystemet du har valgt er skrivebeskyttet. Du kan ikke installere eller fjerne spill. +wbfsop2=Slett spill +wbfsop4=Tilbake +wbfsop5=OK +wbfsop6=Installere [%s] %s... +wbfsop7=Spill slettet +wbfsop8=Spill installert +wbfsop9=En feil har oppstÃ¥tt +wbfsoperr1=Disc_Wait feilet +wbfsoperr2=Disc_Open feilet +wbfsoperr3=Dette er ikke et Wii spill +wbfsoperr4=Dette spillet er allerede installert +wbfsprogress=%i%% +wbfsremdlg=For Ã¥ slette dette spillet : %s,\nKlikk pÃ¥ OK. +wiitdb_code=EN +wtmsg1=Oppretter WiiTDB database... \ No newline at end of file diff --git a/wii/wiiflow/Languages/polish.ini b/wii/wiiflow/Languages/polish.ini new file mode 100644 index 00000000..7f4d9439 --- /dev/null +++ b/wii/wiiflow/Languages/polish.ini @@ -0,0 +1,132 @@ + +[POLISH] +about1=Loader przez %s +about2=GUI przez %s +about3=PodziÄ™kowania Dla :\n\n%s%s%s\n\n%s\n%s +appname=%s v%s +cd1=Wstecz +cd2=UsuÅ„ +cfg1=Ustawienia +cfg10=Wstecz +cfg11=Wibracje +cfg2=OkÅ‚adki 3D +cfg3=Pobierz okÅ‚adki i tytuÅ‚y +cfg4=Pobierz +cfg5=Kontrola rodzicielska +cfg6=Odblokuj +cfg7=Ustaw szyfr +cfga2=Instaluj grÄ™ +cfga3=Instaluj +cfga6=JÄ™zyk +cfga7=UkÅ‚ad +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Tryb wideo +cfgb4=JÄ™zyk gry +cfgc1=Wyjscie do menu Wii +cfgc2=Ustaw szerokość obrazu +cfgc3=Ustaw wysokość obrazu +cfgc4=Ustawienia Coverflow +cfgc5=Ustaw +cfgc6=Offset Poziomy +cfgc7=Offset Pionowy +cfgd1=ZaÅ‚atać kod krajowy +cfgd2=Naprawić bÅ‚Ä…d 002 +cfgd3=Przechować pliki PNG +cfgd4=Kompresować okÅ‚adki +cfgd5=Zapisz ulubiony stan ukÅ‚adu +cfgd6=Tryb wyszukiwania +cfgg1=Ustawienia +cfgg10=IOS +cfgg11=Zablokować przeÅ‚adowanie IOS +cfgg12=Pobierz okÅ‚adki +cfgg13=Pobierz +cfgg14=ZaÅ‚atać tryby wideo +cfgg2=Tryb wideo +cfgg3=JÄ™zyk +cfgg4=ZaÅ‚atać kod krajowy +cfgg5=Ocarina +cfgg6=Naprawić bÅ‚Ä…d 002 +cfgg7=Vipatch +cfgg8=Wstecz +cfgg9=DOL +cfgs1=GÅ‚oÅ›ność muzyki +cfgs2=GÅ‚oÅ›ność dźwiÄ™ku GUI +cfgs3=GÅ‚oÅ›ność dźwiÄ™ku Coverflow +cfgs4=GÅ‚oÅ›ność dźwiÄ™ku gry +def=DomyÅ›lny +dl1=Anuluj +dl10=Prosimy o dotacje\ndla WiiTDB.com +dl2=Wstecz +dl3=Wszystkje +dl4=BrakujÄ…ce +dl5=Pobierz +dl6=Wszystkje +dl7=BrakujÄ…ce +dl8=OkÅ‚adki +dl9=TytuÅ‚y gjer +dlmsg1=Inicjalizacja sieci... +dlmsg10=Budowanie %s +dlmsg11=Pobieranie... +dlmsg12=Pobieranie nie powiodÅ‚o siÄ™ +dlmsg13=Zapisuje... +dlmsg14=Zrobione. +dlmsg15=Nie daÅ‚o siÄ™ zapisać plik ZIP +dlmsg16=Nie daÅ‚o siÄ™ odczytać pliku +dlmsg2=Inicjalizacja sieci nie udana +dlmsg3=Pobieranie z %s +dlmsg4=Zapisuje %s +dlmsg5=%i/%i Pliki pobrane +dlmsg6=Anulowanie... +dlmsg7=Budójemy listÄ™ okÅ‚adek do pobrania... +dlmsg8=PeÅ‚ne okÅ‚adki nie znaleźono. Pobieranie z %s +dlmsg9=%i/%i pliki pobierane. %i to tylko przedniej okÅ‚adki. +gm1=Graj +gm2=Wstecz +lngdef=DomyÅ›lny +lngdut=Niderlandzki +lngeng=Angielski +lngfre=Francuski +lngger=Niemiecki +lngita=WÅ‚oski +lngjap=JapoÅ„ski +lngkor=KoreaÅ„ski +lngsch=S. ChiÅ„ski +lngspa=HiszpaÅ„ski +lngtch=T. ChiÅ„ski +main1=Ustawienia +main2=Witamy w WiiFlow. Nie znaleziono żadnych gier. Kliknij przycisk Ustawienia, aby zainstalować gry. +off=Nie +on=Tak +smalpha=Alfabetyczne +smpage=Strony +translation_author=Pro2oman +viddef=DomyÅ›lny +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Automatyczne +vmpall=Wszystkie +vmpmore=WiÄ™cej +vmpnone=Å»adene +vmpnormal=Normalne +wbfs2=WBFS_Open nieudane : %i +wbfs3=WBFS_GetCount nieudane : %i +wbfs4=WBFS_GetHeaders nieudane : %i +wbfsadddlg=ProszÄ™ wÅ‚ożyć dysk, który chcesz skopiować, a nastÄ™pnie kliknij przycisk Ok. +wbfsop1=Instalacja gjer +wbfsop10=Za maÅ‚o miejsca : %i blokuw potrzeba, %i blokuw dostÄ™pnych +wbfsop2=UsuÅ„ grÄ™ +wbfsop4=Wstecz +wbfsop5=Ok +wbfsop6=Instaluje siÄ™ [%s] %s... +wbfsop7=Gra UsuÅ„Ä™ta +wbfsop8=Gra zainstalowana +wbfsop9=WystÄ…piÅ‚ bÅ‚Ä…d +wbfsoperr1=Disc_Wait nieudane +wbfsoperr2=Disc_Open nieudane +wbfsoperr3=To nie jest pÅ‚yta Wii! +wbfsoperr4=Gra już jest zainstalowana +wbfsprogress=%i%% +wbfsremdlg=Aby na staÅ‚e usunąć gry : %s, kliknij Ok. +wiitdb_code= \ No newline at end of file diff --git a/wii/wiiflow/Languages/portuguese.ini b/wii/wiiflow/Languages/portuguese.ini new file mode 100644 index 00000000..a47445a4 --- /dev/null +++ b/wii/wiiflow/Languages/portuguese.ini @@ -0,0 +1,181 @@ + +[PORTUGUESE] +about1=Loader por %s +about2=GUI por %s +about3=Agradecimentos a :\n\n%s%s%s\n\n%s\n%s +alphabetically=Alfabéticamente +appname=%s v%s +byplaycount=Por jogos feitos +bylastplayed=Por últimos jogados +bygameid=Por ID de jogo +cd1=Voltar +cd2=Apagar +cfg1=Definições +cfg10=Voltar +cfg11=Vibração +cfg2=Caixas 3D +cfg3=Descarregar de Capas & Títulos +cfg4=Descarregar +cfg5=Controlos Parentais +cfg6=Desbloquear +cfg7=Definir Código +cfga2=Instalar jogo +cfga3=Instalar +cfga6=Idioma +cfga7=Tema +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Modo de Video predefinido +cfgb4=Idioma predefinido +cfgc1=Sair para o menu wii +cfgc2=Ajustar horizontal TV +cfgc3=Ajustar vertical TV +cfgc4=Ajustar Coverflow +cfgc5=OK +cfgc6=Deslocamento Horizontal +cfgc7=Deslocamento Vertical +cfgd1=Patch "country strings" +cfgd2=Corrigir Error 002 +cfgd3=Manter ficheiros PNG +cfgd4=Comprimir texturas +cfgd5=Gravar modo preferido. +cfgd6=Modo de pesquisa Default. +cfgd7=Mostrar Categorias ao iniciar. +cfgg1=Definições +cfgg10=IOS +cfgg11=Impedir recarregamento IOS +cfgg12=Descarregar Capas +cfgg13=Descarregar +cfgg14=Patch Modo Vídeo +cfgg15=Códigos Cheat +cfgg16=Seleccionar +cfgg17=Categorias +cfgg18=Hook Type +cfgg19=Desactivar Patch DVD +cfgg20=Desactivar Retorno a +cfgg21=Retornar a Canal +cfgg2=Modo vídeo +cfgg3=Idioma +cfgg4=Patch "country strings" +cfgg5=Ocarina +cfgg6=Corrigir Error 002 +cfgg7=Vipatch +cfgg8=Voltar +cfgg9=DOL +cfgp1=Partição de Jogo +cfgp2=Instalar para directorio. +cfgp3=Iniciar rede no boot. +cfgs1=Volume Música +cfgs2=Volume som GUI +cfgs3=Volume som Coverflow +cfgs4=Volume som Jogo +cheat1=Voltar +cheat2=Aplicar +cheat3=Código Cheat para jogo n/encontrado. +cheat4=Download n/encontrado. +def=Predefinição +disabled=Desactivado +dl1=Cancelar +dl10=Por favor, considere uma doação a WiiTDB.com +dl11=Actualizar versão +dl12=WiiTDB +dl2=Voltar +dl3=Todos +dl4=Em falta +dl5=Descarregar +dl6=Todos +dl7=Em falta +dl8=Capas +dl9=Nomes Jogos +dlmsg1=Inicializar rede... +dlmsg10=Fazendo %s +dlmsg11=Descarga... +dlmsg12=Erro Descarga +dlmsg13=A salvar... +dlmsg14=OK. +dlmsg15=Erro a salvar ficheiro ZIP +dlmsg16=Erro a ler ficheiro +dlmsg17=Sem updates disponiveis +dlmsg18=boot.dol n/encontrado na pasta Default +dlmsg19=Novo update disponivel +dlmsg2=Erro a inicializar rede +dlmsg20=Sem informação de versão disponivel +dlmsg21=Wiiflow vai reiniciar para o update ter efeito. +dlmsg3=Descarregar de %s +dlmsg4=Gravar %s +dlmsg5=%i/%i ficheiros descarregados +dlmsg6=Cancelar... +dlmsg7=Listas capas a descarregar... +dlmsg8=Capa completa não encontrada. Descarregar de %s +dlmsg9=%i/%i ficheiros descarregados. %i são apenas capas frontais. +gm1=Jogar +gm2=Voltar +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +lngdef=Predefinido +lngdut=Holandês +lngeng=Inglês +lngfre=Francês +lngger=Alemão +lngita=Italiano +lngjap=Japonês +lngkor=Coreano +lngsch=Chinês S. +lngspa=Espanhol +lngtch=Chinês T. +main1=Instalar Jogo +main2=Benvindo ao WiiFlow.\nNão encontrei qualquer jogo.\nSeleccionar Install para instalar jogo, ou Seleccionar Partição para escolher tipo de partição. +main3=Seleccionar Partição +off=Desligado +on=Ligado +smalpha=Alfabético +smpage=Páginas +sys1=Sistema +sys2=Versão Wiiflow: +sys3=Cancelar +sys4=Actualizar +sys5=Espaço Livre: +sys6=Versão IOS: +sys7=Versão Instalada. +translation_author=Pakatus +viddef=Predefinido +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Patch automático +vmpall=All +vmpmore=Mais +vmpnone=Nenhum +vmpnormal=Normal +wbfs2=WBFS_Open Falhou : %i +wbfs3=WBFS_GetCount Falhou : %i +wbfs4=WBFS_GetHeaders Falhou : %i +wbfsadddlg=Por favor, insira um disco e carregue em OK. +wbfsop1=Instalar Jogo +wbfsop10=Sem espaço necessário : %i blocos necessários, %i disponíveis +wbfsop11=O filesystem seleccionado esta read-only. Não se podem instalar ou remover jogos. +wbfsop2=Apagar Jogo +wbfsop4=Voltar +wbfsop5=OK +wbfsop6=Instalar [%s] %s... +wbfsop7=Jogo apagado +wbfsop8=Jogo instalado +wbfsop9=Um Erro ocorreu +wbfsoperr1=Disc_Wait falhou +wbfsoperr2=Disc_Open falhou +wbfsoperr3=Não é um disco Wii! +wbfsoperr4=Jogo já instalado +wbfsprogress=%i%% +wbfsremdlg=Para apagar o jogo : %s, carregue em OK. +wiitdb_code=PT +gameinfo1=Desenvolvimento: %s +gameinfo2=Editor: %s +gameinfo3=Região: %s +gameinfo4=Data de release: %i.%i.%i +gameinfo5=Tipo: %s +wtmsg1=A criar Base de dados WiiTDB... \ No newline at end of file diff --git a/wii/wiiflow/Languages/russian.ini b/wii/wiiflow/Languages/russian.ini new file mode 100644 index 00000000..4ceccfc4 --- /dev/null +++ b/wii/wiiflow/Languages/russian.ini @@ -0,0 +1,132 @@ + +[RUSSIAN] +about1=Загрузчик от %s +about2=GUI от %s +about3=Мы благодарим :\n\n%s%s%s\n\n%s\n%s +appname=%s v%s +cd1=Ðазад +cd2=Стереть +cfg1=ÐаÑтройки +cfg10=Ðазад +cfg11=Rumble +cfg2=3D вид +cfg3=Загрузка обложек и названий +cfg4=Загрузка +cfg5=РодительÑкий контроль +cfg6=Открыть +cfg7=УÑтановить код +cfga2=УÑтановить игру +cfga3=УÑтановить +cfga6=Язык +cfga7=Тема +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Видео режим по умолчанию +cfgb4=Язык игры по умолчанию +cfgc1=Выход в меню Wii +cfgc2=ÐаÑтроить ширину TV +cfgc3=ÐаÑтроить быÑоту TV +cfgc4=ÐаÑтроить каруÑель +cfgc5=Старт +cfgc6=Горизонтальное Ñмещение +cfgc7=Вертикальное Ñмещение +cfgd1=�зменить Ñтроки Ñтраны +cfgd2=Error 002 Ñ„Ð¸ÐºÑ +cfgd3=ОÑтавить PNG файлы +cfgd4=Сжать текÑтуры +cfgd5=Сохранить ÑоÑтоÑние режима фаворитов +cfgd6=Режим поиÑка по умолчанию +cfgg1=ÐаÑтройки +cfgg10=IOS +cfgg11=Блокировать перезагрузку IOS +cfgg12=Загрузить обложку +cfgg13=Загрузка +cfgg14=�зменÑÑ‚ÑŒ видео режим +cfgg2=Видео режим +cfgg3=Язык +cfgg4=�зменить Ñтроки Ñтраны +cfgg5=Ocarina +cfgg6=Error 002 Ñ„Ð¸ÐºÑ +cfgg7=Vipatch +cfgg8=Ðазад +cfgg9=DOL +cfgs1=ГромкоÑÑ‚ÑŒ музыки +cfgs2=ГромкоÑÑ‚ÑŒ звуков в GUI +cfgs3=ГромкоÑÑ‚ÑŒ звуков в каруÑели +cfgs4=ГромкоÑÑ‚ÑŒ звуков в игре +def=По умолчанию +dl1=Отмена +dl10=Мы нуждаемÑÑ Ð² ваших\nпожертвованиÑÑ… WiiTDB.com +dl2=Ðазад +dl3=Ð’Ñе +dl4=ОтÑутÑвует +dl5=Загрузка +dl6=Ð’Ñе +dl7=ОтÑутÑвует +dl8=Обложки +dl9=ÐÐ°Ð·Ð²Ð°Ð½Ð¸Ñ Ð¸Ð³Ñ€ +dlmsg1=ï¿½Ð½Ð¸Ñ†Ð¸Ð°Ð»Ð¸Ð·Ð°Ñ†Ð¸Ñ Ñети... +dlmsg10=Создание %s +dlmsg11=Загрузка... +dlmsg12=Загрузка не удалаÑÑŒ +dlmsg13=Сохранение... +dlmsg14=Готово. +dlmsg15=Ðе могу Ñохранить ZIP файл +dlmsg16=Ðе могу прочитать файл +dlmsg2=�нициализировать Ñеть не удалоÑÑŒ +dlmsg3=Загрузка Ñ %s +dlmsg4=Сохранение %s +dlmsg5=%i/%i файлов загружено +dlmsg6=Отмена... +dlmsg7=Считывание обложек Ð´Ð»Ñ Ð·Ð°Ð³Ñ€ÑƒÐ·ÐºÐ¸... +dlmsg8=ÐŸÐ¾Ð»Ð½Ð°Ñ Ð¾Ð±Ð»Ð¾Ð¶ÐºÐ° не найдена. Загрузка Ñ %s +dlmsg9=%i/%i файлов загружено. %i только верхних обложек. +gm1=�грать +gm2=Ðазад +lngdef=По умолчанию +lngdut=ÐидерландÑкий +lngeng=ÐнглийÑкий +lngfre=ФранцузÑкий +lngger=Ðемецкий +lngita=�тальÑнÑкий +lngjap=ЯпонÑкий +lngkor=КорейÑкий +lngsch=S. КитайÑкий +lngspa=�ÑпанÑкий +lngtch=T. КитайÑкий +main1=ÐаÑтройки +main2=Добро пожаловать в WiiFlow. Ðе найдена ни одна игра. Ð’ "ÐаÑтройках" вы можете уÑтановить игры. +off=Выкл. +on=Вкл. +smalpha=По алфавиту +smpage=Страницы +translation_author=re-flex +viddef=По умолчанию +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Ðвт. иÑправление +vmpall=Ð’Ñе +vmpmore=Больше +vmpnone=Ðи одного +vmpnormal=Ðормальный +wbfs2=Ошибка Ð²Ñ‹Ð¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ WBFS_Open : %i +wbfs3=Ошибка Ð²Ñ‹Ð¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ WBFS_GetCount : %i +wbfs4=Ошибка Ð²Ñ‹Ð¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ WBFS_GetHeaders : %i +wbfsadddlg=Ð”Ð»Ñ ÐºÐ¾Ð¿Ð¸Ñ€Ð¾Ð²Ð°Ð½Ð¸Ñ Ð²Ñтавьте пожалуйÑта диÑк Ñ Ð¸Ð³Ñ€Ð¾Ð¹ и нажмите Старт. +wbfsop1=УÑтановить игру +wbfsop10=Ðе хватает памÑти : %i блоков необходимо, %i Ñвободно +wbfsop2=Удалить игру +wbfsop4=Ðазад +wbfsop5=Старт +wbfsop6=УÑтановка [%s] %s... +wbfsop7=�гра удалена +wbfsop8=�гра уÑтановлена +wbfsop9=Произошла ошибка +wbfsoperr1=Ошибка Ð²Ñ‹Ð¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ Disc_Wait +wbfsoperr2=Ошибка Ð²Ñ‹Ð¿Ð¾Ð»Ð½ÐµÐ½Ð¸Ñ Disc_Open +wbfsoperr3=Это не Wii диÑк! +wbfsoperr4=�гра уже уÑтановлена +wbfsprogress=%i%% +wbfsremdlg=Ð”Ð»Ñ Ð±ÐµÐ·Ð²Ð¾Ð·Ð²Ñ€Ð°Ñ‚Ð½Ð¾Ð³Ð¾ ÑƒÐ´Ð°Ð»ÐµÐ½Ð¸Ñ Ð¸Ð³Ñ€Ñ‹ : %s, нажмите Старт. +wiitdb_code= \ No newline at end of file diff --git a/wii/wiiflow/Languages/spanish.ini b/wii/wiiflow/Languages/spanish.ini new file mode 100644 index 00000000..00484793 --- /dev/null +++ b/wii/wiiflow/Languages/spanish.ini @@ -0,0 +1,177 @@ + +[SPANISH] +about1=Loader Original Por:\n%s +about2=GUI Original Por:\n%s +about4=Gracias A:\n%s +about6=Desarrolladores Actuales:\n%s +about7=Desarrolladores Pasados:\n%s +about8=Pedazos De Código Obtenidos Desde:\n%s +about9=Sitios Que Apoyan El Proyecto:\n%S +alphabetically=alfabéticamente +appname=%s v%s +bycontrollers=Numero de Mandos +byesrb=Clasificación ESRB +bygameid=Según el ID del juego +bylastplayed=Según el último jugado +byplaycount=Según cantidad de partidas +byplayers=Numero de Jugadores +bywifiplayers=Numero de Jugadores Wifi +cd1=Atrás +cd2=Eliminar +cfg1=Configuraciones +cfg10=Atrás +cfg11=USB Saves Emulation +cfg12=NAND Emulation +cfg3=Descargar carátulas y títulos +cfg4=Descargar +cfg5=Control parental +cfg6=Desbloquear +cfg7=Poner clave +cfga2=Instalar juego +cfga3=Instalar +cfga6=Idioma +cfga7=Tema +cfgb1=Ocarina +cfgb3=Modo de video +cfgb4=Idioma del juego +cfgc1=Salir a +cfgc2=Ajustar ancho +cfgc3=Ajustar altura +cfgc4=Ajustar Coverflow +cfgc5=Ajustar +cfgc6=Ajuste horizontal +cfgc7=Ajuste vertical +cfgd5=Guardar el modo favorito +cfgd7=Mostrar categorías al iniciar +cfgg1=Configuraciones +cfgg12=Descargar carátula +cfgg13=Descargar +cfgg14=Parchear modo de video +cfgg15=Trucos +cfgg16=Seleccionar +cfgg17=Categorias +cfgg18=Hook Type +cfgg21=Volver al canal +cfgg22=Debugger +cfgg23=Descargando trucos... +cfgg24=Savegame Emulation +cfgg2=Modo de video +cfgg3=Idioma +cfgg4=Parchear frases de país +cfgg5=Ocarina +cfgg7=Vipatch +cfgg8=Atrás +cfgp1=Partición de juegos +cfgp3=Iniciar RED junto a WiiFlow +cfgs1=Volumen de la música +cfgs2=Volumen de la GUI +cfgs3=Volumen del coverflow +cfgs4=Volumen del juego +cheat1=Volver +cheat2=Aplicar +cheat3=No hay trucos para el juego +cheat4=Descarga no encontrada +def=Por defecto +disabled=Desactivado +dl1=Cancelar +dl10=Por favor dona \na WiiTDB.com +dl12=WiiTDB +dl2=Atrás +dl3=Todas +dl4=Restantes +dl5=Descargar +dl6=Descargar +dl8=Caratulas +dlmsg1=Iniciando RED... +dlmsg10=Creando %s +dlmsg11=Descargando... +dlmsg12=Descarga fallida +dlmsg13=Guardando... +dlmsg14=Terminado. +dlmsg15=No se puede guardar el archivo ZIP +dlmsg16=No se puede leer el archivo +dlmsg17=No hay nuevas versiones +dlmsg18=Boot.dol no encontrado en la carpeta por defecto +dlmsg19=Hay una actualización disponible +dlmsg20=WiiFlow se cerrará para aplicar los cambios +dlmsg21=WiiFlow se cerrará para que los cambios tengan efecto. +dlmsg22=Actualizando directorio de la aplicación... +dlmsg23=Actualizando directorio de datos +dlmsg24=Extracting... +dlmsg25=Extraction must have failed! Renaming the backup to boot.dol +dlmsg26=Updating cache... +dlmsg2=No se pudo conectar a la RED +dlmsg3=Descargando desde %s +dlmsg4=Guardando %s +dlmsg5=%i/%i imágenes descargadas +dlmsg6=Cancelando... +dlmsg7=Revisando que carátula descargar... +dlmsg8=No hay carátula completa, descargando desde %s +dlmsg9=%i/%i archivos descargados. %i son sólo carátulas frontales. +gameinfo1=Desarrollador: %s +gameinfo2=Publicador: %s +gameinfo3=Región: %s +gameinfo4=Fecha lanzamiento: %i.%i.%i +gameinfo5=Género: %s +gm1=Jugar +gm2=Atrás +hooktype1=VBI +hooktype2=KPAD Read +hooktype3=Joypad +hooktype4=GXDraw +hooktype5=GXFlush +hooktype6=OSSleepThread +hooktype7=AXNextFrame +ios=IOS%i base %s +lngdef=Por defecto +lngdut=Neerlandés +lngeng=Inglés +lngfre=Francés +lngger=Alemán +lngita=Italiano +lngjap=Japonés +lngkor=Coreano +lngsch=Chino simple +lngspa=Español +lngtch=Chino tradicional +main1=Instalar juego +main2=Bienvenido a WiiFlow.\nNo encontre ningún juego.\nHaz clic en instalar juegos, o Seleccionar partición para elegir el tipo de partición. +main3=Seleccionar partición +off=No +on=Si +players= Players +sys1=Sistema +sys2=WiiFlow versión: +sys3=Cancelar +sys4=Actualizar +sys7=Versión instalada +translation_author=RAVMN, XFede +viddef=Por defecto +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Auto parchear +vidsys=Sistema +vidprog=Progresivo +vmpall=Todos +vmpmore=Más +vmpnone=Ninguno +vmpnormal=Normal +wbfsadddlg=Inserta el disco a copiar, y después has clic en Ir +wbfsop1=Instalar juego +wbfsop10=No hay suficiente espacio : %i bloques necesarios, %i disponibles +wbfsop2=Eliminar juego +wbfsop4=Atrás +wbfsop5=Ir +wbfsop6=Instalando [%s] %s... +wbfsop7=Juego eliminado +wbfsop8=Juego instalado +wbfsop9=Ha ocurrido un error +wbfsoperr1=Disc_Wait failed +wbfsoperr2=No se pudo abrir el juego +wbfsoperr3=Este no es un juego de Wii! +wbfsoperr4=El juego ya esta instalado! +wbfsprogress=%i%% +wbfsremdlg=Para eliminar permanentemente %s, haz click en Ir. +wifiplayers= Wifi Players +wiitdb_code=ES \ No newline at end of file diff --git a/wii/wiiflow/Languages/swedish.ini b/wii/wiiflow/Languages/swedish.ini new file mode 100644 index 00000000..8547458c --- /dev/null +++ b/wii/wiiflow/Languages/swedish.ini @@ -0,0 +1,132 @@ + +[SWEDISH] +about1=Loader av %s +about2=GUI av %s +about3=Tack till :\n\n%s%s%s\n\n%s\n%s +appname=%s v%s +cd1=Tillbaka +cd2=Radera +cfg1=Inställningar +cfg10=Tillbaka +cfg11=Rumble +cfg2=3D-omslag +cfg3=Hämta omslag & titlar +cfg4=Hämta +cfg5=Föräldrakontroll +cfg6=LÃ¥s upp +cfg7=Sätt kod +cfga2=Installera spel +cfga3=Installera +cfga6=SprÃ¥k +cfga7=Teman +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Standard videoläge +cfgb4=Standard spel sprÃ¥k +cfgc1=Avsluta till Wii Menu +cfgc2=Justera TV bredd +cfgc3=Justera TV höjd +cfgc4=Justera Coverflow +cfgc5=Kör +cfgc6=Horisontell offset +cfgc7=Vertikal offset +cfgd1=Patch'a landssträngar +cfgd2=Fel 002 fix +cfgd3=BehÃ¥ll PNG filer +cfgd4=Packa texturer +cfgd5=Spara favorit läge +cfgd6=Standard sök läge +cfgg1=Inställningar +cfgg10=IOS +cfgg11=Blokera IOS omladdning +cfgg12=Hämta omslag +cfgg13=Hämta +cfgg14=Patch'a videoläge +cfgg2=Videoläge +cfgg3=SprÃ¥k +cfgg4=Patch'a landssträngar +cfgg5=Ocarina +cfgg6=Fel 002 fix +cfgg7=Vipatch +cfgg8=Tillbaka +cfgg9=DOL +cfgs1=Musikvolym +cfgs2=GUI ljudvolym +cfgs3=Coverflow ljudvolym +cfgs4=Spel ljudvolym +def=Standard +dl1=Avbryt +dl10=Donera\ntill WiiTDB.com +dl2=Tillbaka +dl3=Alla +dl4=Saknade +dl5=Hämta +dl6=Alla +dl7=Saknade +dl8=Omslag +dl9=Speltitlar +dlmsg1=Initierar nätverket... +dlmsg10=Skapar %s +dlmsg11=Hämtar... +dlmsg12=Hämtningen misslyckades +dlmsg13=Sparar... +dlmsg14=Klar. +dlmsg15=Kunde inte spara ZIP fil +dlmsg16=Kunde inte läsa fil +dlmsg2=Nätverksinitiering misslyckades +dlmsg3=Hämtar frÃ¥n %s +dlmsg4=Sparar %s +dlmsg5=%i/%i filer hämtade +dlmsg6=Avbryter... +dlmsg7=Listar omslag att hämta... +dlmsg8=Helt omslag hittades inte. Hämtar frÃ¥n %s +dlmsg9=%i/%i filer hämtade. %i är endast framsideomslag. +gm1=Spela +gm2=Tillbaka +lngdef=Standard +lngdut=Nederländska +lngeng=Engelska +lngfre=Franska +lngger=Tyska +lngita=Italienska +lngjap=Japanska +lngkor=Koreanska +lngsch=S. Kinesiska +lngspa=Spanska +lngtch=T. Kinesiska +main1=Inställningar +main2=Välkommen till WiiFlow. Hittade inga spel. Klicka pÃ¥ inställningar för att installera spel. +off=Av +on=PÃ¥ +smalpha=Alfabetisk +smpage=Sidor +translation_author=Patts +viddef=Standard +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Auto Patch +vmpall=Alla +vmpmore=Mer +vmpnone=Inga +vmpnormal=Normal +wbfs2=WBFS_Open misslyckades : %i +wbfs3=WBFS_GetCount misslyckades : %i +wbfs4=WBFS_GetHeaders misslyckades : %i +wbfsadddlg=Sätt in skivan du vill kopiera och klicka pÃ¥ kör. +wbfsop1=Installera spel +wbfsop10=Inte tillräckligt med utrymme : %i blocks behövs, %i tillgängliga +wbfsop2=Radera spel +wbfsop4=Tillbaka +wbfsop5=Kör +wbfsop6=Installerar [%s] %s... +wbfsop7=Spel raderat +wbfsop8=Spel installerat +wbfsop9=Ett fel har uppstÃ¥tt +wbfsoperr1=Disc_Wait misslyckades +wbfsoperr2=Disc_Open misslyckades +wbfsoperr3=Det här är ingen Wii skiva! +wbfsoperr4=Spel redan installerat +wbfsprogress=%i%% +wbfsremdlg=För att permanent radera spelet : %s, klicka pÃ¥ kör. +wiitdb_code=EN \ No newline at end of file diff --git a/wii/wiiflow/Languages/tagalog.ini b/wii/wiiflow/Languages/tagalog.ini new file mode 100644 index 00000000..6eccaaab --- /dev/null +++ b/wii/wiiflow/Languages/tagalog.ini @@ -0,0 +1,132 @@ + +[TAGALOG] +about1=Loader ginawa ni %s +about2=GUI ginawa ni %s +about3=Salamat kay :\n\n%s%s%s\n\n%s\n%s +appname=%s v%s +cd1=Bumalik +cd2=Burahin +cfg1=Pagsasa-ayos +cfg10=Bumalik +cfg11=Pag-alog ng kontroller +cfg2=Mga cover na 3D +cfg3=Magdownload ng cover at pangalan ng game +cfg4=Download +cfg5=Patnubay ng magulang +cfg6=Buksan +cfg7=Iset ang code +cfga2=Mag-install ng game +cfga3=Install +cfga6=Wika +cfga7=Tema +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Tipo ng video +cfgb4=Wika ng game +cfgc1=Diretso sa Wii Menu pag-exit +cfgc2=Lapad ng TV screen +cfgc3=Haba ng TV screen +cfgc4=Ayusin ang Coverflow +cfgc5=Go +cfgc6=Posisyon mula sa kaliwa +cfgc7=Posisyon mula sa taas +cfgd1=I-patch ang 'country strings' +cfgd2=Tanggalin ang 'Error 002' +cfgd3=Huwag burahin ang mga PNG files +cfgd4=Paliitin ang mga imahe +cfgd5=Tandaan ang 'favorite mode state' +cfgd6=Paraan ng pagpili ng game +cfgg1=Pagsasa-ayos +cfgg10=IOS +cfgg11=Harangin ang 'IOS reload' +cfgg12=Idownload ang cover +cfgg13=Download +cfgg14=Ipatch ang tipo ng video +cfgg2=Tipo ng video +cfgg3=Wika +cfgg4=Ipatch ang 'country strings' +cfgg5=Ocarina +cfgg6=Tanggalin ang 'Error 002' +cfgg7=Vipatch +cfgg8=Bumalik +cfgg9=DOL +cfgs1=Lakas ng musika +cfgs2=Lakas ng tunog ng GUI +cfgs3=Lakas ng tunog ng Coverflow +cfgs4=Lakas ng tunog ng Game +def=Orihinal +dl1=Kansela +dl10=Mangyaring mag-ambag\nsa WiiTDB.com +dl2=Bumalik +dl3=Lahat +dl4=Nawawala lang +dl5=Idownload +dl6=Lahat +dl7=Nawawala lang +dl8=Mga cover +dl9=Mga pamagat +dlmsg1=Sinisimulang kumunekta sa network... +dlmsg10=Ginagawa ang %s +dlmsg11=Nagda-download... +dlmsg12=Hindi na-download +dlmsg13=Nagse-save... +dlmsg14=Tapos na. +dlmsg15=Hindi mai-save ang ZIP file +dlmsg16=Hindi mabasa ang file +dlmsg2=Hindi maka konekta sa network +dlmsg3=Nagda-download sa %s +dlmsg4=Nagse-save %s +dlmsg5=%i/%i files ang na-download +dlmsg6=Hinihinto... +dlmsg7=Nililista ang mga cover na kailangan i-download... +dlmsg8=Walang nakitang 'full cover'. Idina-download sa %s +dlmsg9=%i/%i files na-download. %i ay harap na cover lang. +gm1=Laruin +gm2=Bumalik +lngdef=Orihinal +lngdut=Olandes +lngeng=Ingles +lngfre=Franses +lngger=Aleman +lngita=Italiano +lngjap=Hapones +lngkor=Koreano +lngsch=S. Intsik +lngspa=Español +lngtch=T. Intsik +main1=Pagsasa-ayos +main2=Ito ang WiiFlow. Walang game na nakita. Pindutin ang 'Pagsasa-ayos' para mag-install ng mga laro. +off=Off +on=On +smalpha=Ayon sa titik +smpage=Isa-isa +translation_author=LAJD +viddef=Orihinal +vidntsc=NTSC +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidpatch=Awtomatiko +vmpall=Lahat +vmpmore=Mas marami +vmpnone=Wala +vmpnormal=Normal +wbfs2=WBFS_Open di nagawa : %i +wbfs3=WBFS_GetCount di nagawa : %i +wbfs4=WBFS_GetHeaders di nagawa : %i +wbfsadddlg=Ipasok ang disc na gustong kopyahin, at pindutin ang Go. +wbfsop1=Pag-install ng Game +wbfsop10=Kulang ang espasyo : %i blocks ang kailangan, %i ang natitira +wbfsop2=Burahin ang Game +wbfsop4=Bumalik +wbfsop5=Go +wbfsop6=Ini-install [%s] %s... +wbfsop7=Ang game ay nabura na +wbfsop8=Ang game ay na-install na +wbfsop9=Nagkaroon ng aberya +wbfsoperr1=Disc_Wait di nagawa +wbfsoperr2=Disc_Open di nagawa +wbfsoperr3=Hindi ito Wii disc! +wbfsoperr4=Ang Game ay naka-install na +wbfsprogress=%i%% +wbfsremdlg=Para tuluyang burahin ang game : %s, pindutin ang Go. +wiitdb_code= \ No newline at end of file diff --git a/wii/wiiflow/Languages/turkish.ini b/wii/wiiflow/Languages/turkish.ini new file mode 100644 index 00000000..aa94c462 --- /dev/null +++ b/wii/wiiflow/Languages/turkish.ini @@ -0,0 +1,132 @@ + +[TURKISH] +about1=Loaderyı yapan : %s +about2=GUÄ°yi yapan : %s +about3=Bu kiÅŸilere teÅŸekkürler :\n\n%s%s%s\n\n%s\n%s +appname=%s v%s +cd1=Geri +cd2=Sil +cfg1=Ayarlar +cfg10=Geri +cfg11=TitreÅŸim +cfg2=3D kapaklar +cfg3=Kapakları ve baÅŸlıkları indir +cfg4=Ä°ndir +cfg5=Çocuk kilidi +cfg6=Kilidi aç +cfg7=Kilidi ayarla +cfga2=Oyun yükle +cfga3=Yükle +cfga6=Language +cfga7=Tema +cfgb1=Ocarina +cfgb2=Vipatch +cfgb3=Standart video modu +cfgb4=Standart oyun lisanı +cfgc1=Wii menüye çıkış +cfgc2=TV geniÅŸliÄŸi ayarla +cfgc3=TV yüksekliÄŸi ayarla +cfgc4=Coverflowu ayarla +cfgc5=BaÅŸlat +cfgc6=Yatay ofset +cfgc7=Dikey ofset +cfgd1=Patch country strings +cfgd2=002 hatayı engelle +cfgd3=PNG dosyaları sakla +cfgd4=Tekstürleri sıkıştır +cfgd5=Favori mod ayarını kaydet +cfgd6=Standart arama modu +cfgg1=Ayarlar +cfgg10=Ä°OS +cfgg11=Ä°OSin yeniden yüklenmesini engelle +cfgg12=Kapağı indir +cfgg13=Ä°ndir +cfgg14=Video modlarını yamala +cfgg2=Video modu +cfgg3=Lisan +cfgg4=Patch country strings +cfgg5=Ocarina +cfgg6=002 hatayı engelle +cfgg7=Vipatch +cfgg8=Geri +cfgg9=DOL +cfgs1=Müzik sesi +cfgs2=GUÄ° sesi +cfgs3=Coverflow sesi +cfgs4=Oyun sesi +def=Standart +dl1=Ä°ptal +dl10=Lütfen WiiTDB.com`a\nbağ��s yapın +dl2=Geri +dl3=Hepsini +dl4=Eksikleri +dl5=Ä°ndir +dl6=Hepsini +dl7=Eksikleri +dl8=Kapaklar +dl9=Oyun baÅŸlıkları +dlmsg1=AÄŸ baÄŸlantısı baÅŸlatılıyor... +dlmsg10=%s hazırlanılıyor +dlmsg11=Ä°ndiriliyor... +dlmsg12=Ä°ndirmede hata oluÅŸtu +dlmsg13=Kaydediliyor... +dlmsg14=Tamam. +dlmsg15=ZIP dosyası kaydedilemedi +dlmsg16=Dosya okunamadı +dlmsg2=AÄŸ baÄŸlantı baÅŸlatmasında hata oluÅŸtu +dlmsg3=%s den indiriliyor +dlmsg4=%s kaydediliyor +dlmsg5=%i/%i dosya kaydedildi +dlmsg6=Ä°ptal... +dlmsg7=Ä°ndirilecek kapaklar hazırlanılıyor... +dlmsg8=Full kapak bulunamadı. %s den indiriliyor... +dlmsg9=%i/%i dosya indirildi. %i tanesi sadece ön kapak. +gm1=Oynat +gm2=Geri +lngdef=Standart +lngjap=Japonca +lngeng=Ä°ngilizce +lngger=Almanca +lngfre=Fransızca +lngspa=Ä°spanyolca +lngita=Ä°talyanca +lngdut=Hollandaca +lngsch=S. Çince +lngtch=T. Çince +lngkor=Korece +main1=Ayarlar +main2=WiiFlowa hoÅŸgeldiniz. Hiç bir oyun bulunamadı. Oyun yüklemek için ayarlara giriniz. +off=Kapalı +on=Açık +smalpha=Alfabetik +smpage=Sayfalar +translation_author=elmurato +viddef=Standart +vidp50=PAL 50Hz +vidp60=PAL 60Hz +vidntsc=NTSC +vidpatch=Auto Patch +vmpall=Hepsini +vmpmore=Daha fazla +vmpnone=Hiç +vmpnormal=Normal +wbfs2=WBFS_Open failed : %i +wbfs3=WBFS_GetCount failed : %i +wbfs4=WBFS_GetHeaders failed : %i +wbfsadddlg=Lütfen yüklenecek olan diski koyduktan sonra "BaÅŸlat"a basınız. +wbfsop10=Yeterli hafıza yok : %i blok gerek, %i mevcut +wbfsop1=Oyun yükle +wbfsop2=Oyun sil +wbfsop4=Geri +wbfsop5=BaÅŸlat +wbfsop6=Yükleniyor [%s] %s... +wbfsop7=Oyun silindi +wbfsop8=Oyun yüklendi +wbfsop9=Bir hata oluÅŸtu +wbfsoperr1=Disc_Wait hatası +wbfsoperr2=Disc_Open hatası +wbfsoperr3=Bu bir Wii diski deÄŸil! +wbfsoperr4=Oyun önceden yüklendi +wbfsprogress=%i%% +wbfsremdlg=%s oyunu kalıcı olarak silmek için "BaÅŸlat"a basınız. +wiitdb_code=EN \ No newline at end of file diff --git a/wii/wiiflow/boxcovers/JODI.png b/wii/wiiflow/boxcovers/JODI.png new file mode 100644 index 0000000000000000000000000000000000000000..926fa929357c4efe8cef46df57825535e7064d05 GIT binary patch literal 410197 zcmb4qWmp^07Hx1X5UjWax8fAnAVrE4x8P8mqQ#xy4h4#rQrz90;_g-`?(Xo?d*A*4 zUcL!QCL`gTnZ4IuYwd8AkFsyjNzefRz?%>sVM;fVb}mb6zus7+bKXC0Py(=0PIHs0K(e<0P%>kaELo>TQo;G z9cKUltNY&*j(}0#|KCbCM+wXSoe2;;;FSyj_yazGCDc8Zj@sN?X|-J0T5kk2$WMpx0d`ASaDCB>)c?b`t{BmES-GI=fx7E0mQ95c&E?{fN3W#}6o*-ok|?elU-E%Pdfa3IwweqAg^q7>a!XM$cnVTyIq=JmZby97m(E9w}@A<{S-P$Jq&hi}}mE8Y7X9I%3uoZ^j z|JTn>Wa7p^$NwCI_J8|035(}GQ~o;;1BxUH)xQHulA#3e`2A-y*8gqx|9h(c*X%~grx0zd(Pcr|&Jf}{xWiZ%~nvZ}m3BL)D+~qVM3BS6<CB?FkM+a==OLkALmn`vlNGp8vQ6dzjKsLjrP z{KkoTUJ?@0D(ik7ttD$f*roccEzk7Eoky0bb20(|!Ubk84#ra&2%cgjEXcCpCbGAF z;)smj^^Ac{H}1$LC#j()`s_t4S3q7&akOl4zWvJVtg4ns3w8?-Ul{8nLqPlqj>(BL zgYTJ1VTwt=`3=sium73bUS5@(+uqKnVL%=Z z{&?jr73`s@J?J&I{@)mg$%2mTc|1zi+oykhOc#_O*F)7VECGww^j^ z&K^hwkJNg&(p*yiBWslhDW|$B+wy)1?=r~rUaYy6lfv&@2HnThO{{I+=_))+4vHfi zefzTZs_Xpt=KUJadoeL?p_W&1N?=pD&2zxRL-WtjP}pDfVnM>_tiAm(RHqq_^B2t! z*xiSO3jF;@f11%3*x+vcXTVEF)bX6j(shRNn17o1bxvfzuhoh79)4X;5f61AwEmUq znU&mMIyPJQ+uE82f%A3G*8TYU`)4`7lcn;(p8UnjmV_k@_|gx^o@V^+j{zYe@Q{Y4 zozj!uaKodms4Ejs&dfPM7l7o`fl-L*zu9H`G3|Vb;q#0zM+qI+s^cvReQ56QhyC8> zbaiIJ$jm*RFpn-{YirN-_UBL2(=l7M4R!V_jnwfTJK6q0C}9r|54*d&i5eOPndFCa z*A%jRx_f|saU~@3x66xz@A(1*Qu92MvXn14QP~)gm+q~ij7XYJ;~sP0yJ;OEG#*jF zt#1ZaN8Rad85J=MeQr z;gdGYU3U96k;GBlMNiJp*4EzJuI%fT#?QG}OoWkQPk-2Ag&!Js?|-0zBCMVtt}A@6 zU9YcQ2h25d5pZCk>MhTgtouzLuh$cTUGSBv^DQwHuiQFZ-^b8({TRcvh63?naq^0i zc<}GV3mZx#2F5fu)4bl<`d4d{in)%JWNI4aC_=+8OVk6(V0GCcU>B$UFa~AJ+?zM9 zBi?xoxS-z4;Mo^(z6=9>MQlt8b@{%nbJ$GW+|yF~VFw);GW$;xo2DQa*n&Mh@NZG~DL?VXH`j2sOP{xZB)dIyUOX3r0< z+ly;0moKO5Px*4RxD|45l$6I`ZeP8(jyvvC%FD-i2RiO|C|6%QrOrKCx&C&zueZP6 zFTMBOZScEnG)wz$q-J+HO4IkSvU&*2`k5~P4c_>AaWXoYdiskiFjimfd0uGx^7;Pj z=>nTN@ay)@fk4XTuFs6X?a|Q7!`#Aj@bZnBX@s|gZ+mP{K-_y zQWmz@DIJ6`SzZM8wcW1W4${Q-X)f;FOa8eSe)qL+xI*M2H&j-}_biB#T$mpb2WZ=0 zT~o8AQQ<8uEBhE9>%9Jq{dAGqP{!Ab5z?)*JigNC6!grUI=t#U-WIb}z9Az6vggZa z*@|gdyGVgRL_8pnSDIK+ir4`yt3}u(<>vlDq43^Ih-CM?DIpOAz)~ka+S%aVh^in! z5`I3{A=dNdIZa`#>|sPIZIMaYMwrxz8pPGf#Cx(vvMZ!)0a+(bix6ly8KTDz$N_9+ zbTs)~JWN{~Hno*Y;zI#Xt?ZW#4IgK~1mclMHC68}BBrfBUNuwT_J7;oPit>~VbkNA zpQD%*4ripO&Xx*h{NpqKYJY!iDf-%X9}*(+cr##9wez$8qt@IN}LXu z^xTh^j+iT=4{|tvm zm6126AEqpD(lM*UtMV+4JvIiPoKTu$fbka#4qQ=%2=8l?(9cMja=9X_%**H1kVbT7 z-^hrm&(rZ=PWa=#Zl~2HOSGQ{-k(fkXp~o<$aZV2dwHL9mwOl-gcL9|Ha7Beae3xc z_&IKD^vT?YPlD)84JUy$t^&ws*lJVKDv?JDJGt6zr)2m0&Ft1C13p73E3 z%I;dAct*lV7R?V#ys!u^#J#*Q<3YQ%;`_)Q=ldh6nz+VJ=CD^Q1f5A1*Xm~~p=JAAjJV$2L8V^25#Z&0KaZ{8s9 zQH|(DVnemqc~%FTUtkVanFA21@)&l|U)^3yD{F;n%icdgo{`KklLbi_;|+A~N9}&Q z)=geW+?2JaZI;J-52*rB9eG3qRrxs#gm;lP03KOlqM~!_Vhds%ut7-wSeUlxL{^~A zN}_?kLq z))W9N+PYbJ+{uyoH#Oa_DxZeS%)bmp%g}h;9A%`ZTibf?Y$SZ}HP(|!G+z^bkU7r|gPxzP`@ z^b@eDn>iit@sjuwBI#snd(;`w9uN>@YHGS~O9+bD;*Y`V8M`Z9^+kBSJ& z%N=$gLOcg~C940HD#oN)WPziK2o|_2p!Jvg79!1r)I$Z5?uN&~M?>^CRt4ZQ(IDbh zmFic!W93N;GvWfdHk%aXNd}qzVwiGshe+4gxREi$m&$7n(89wZ_U4J3oU#Bp8NU@8 ztNjSxAe|!d=g5f27#q1^SfSYaX2dm;mjr@xB&wO1rh-_q47^kkIZ&35v9^y3YEV@x z?G3}*^$q(kvT>+s=I(He5jeyV;nBdv)wdE%eItqzrs{bcS*qe+7%LcudLlXE;i*gj za7hM^f9SY)fxWDL3Hab|^4N;LUpA87`)xD|*HIe=tGLu|W+DdWSK7qi#y%RbooroN zSPePzG!5t?Jk>le>SxhJ)Vs=@rg5m5eL)qUlvA#I8Az?G=jrvA-yG-CUr4;`a=2ad zc*T6Y$ig7aYFKE7j*O08V`H8yyBm3UnA!WT-3k}fZteBBaF|=H-$rwi(Zfjwdl;(h zqhVrF98vOXL$q344|hH_*kV1R)z;O|%>1yh+|{}wnb#d3XIC5_sjaUk+d1x#a3P1A!`D>V0f`jBBbae& z5sNrXEi~drxIi3YW7N_R8zn<5!(UT~-a-U@xVMVI@f5@meeKeBoAuRVsQSKKak$VC~52mRz%ne6yj)ZZIu;3#R%7&QK&3 zt4eUfS0hY4Ed+%vfBY&3e>&5Z78OrLkeA$MaHe2rI$BI;a-g>Yr%$k}w+kEEeH>nyM zizzDFC%^&#w=eDk0=jyH0C;$bmzS4e%FWhgmKGLap`q{X_5HrB_V*9Kz?3y}Jg2Xo zo{caC#79n;qGK~+_+8Uop1x>donhH&6McF{y5V#2A$mxl$g0yRO;sp@iWxW(M0;bY zC=S9zvt3D`W(R2!NZGoqwGT^NY4-xq;em!<07F%WIl+rD0JyHuM!QyR{NUqQE2D&j zRWuy9@MsZkC|G=sGJZ5Y^;oGpWRd%~CAW!=A$d2)zmm!!B0oO6tC zN%K%jwde{|S`mFE#A$H|(FhIh(HRAp=f)cB0}-1r#RH-jgprpomzLF4L*KDV<4X5p zg1ANy)g&eI0yRD-*p?AnFw-$6wec8(Ksy`A94t7&1*OFps7ZvzxN$g$Yc+@M_@G|Z z04UT5QP-H!;pR5uTi~4f6`f@a-H+!h7blN7nvD@pcgL>E0mq{OL=CLWIg+0EWJXkA zjB4l}W2O6PJLG9|ZnDa0{Wf_nW-ct^bMoaRz@$ps%S%tz%S%~V3sybY*^N#<8vKK+ z_8zY->u4J_*{_>Dv7+rZw^`S1B9^v7Wyh5%ClwscEiDwjf2(Gf(TK>&g`TP&Zzy4C zDU3l7H~#by1sjWe4Q}t0lz&F=aK1ulBp~Kcy=7L`Yj!+jpK`?Vn*RKc0vrI^MWP}p z(^<)r;s4qL$_obvBgp!PzH2fAOUG zY;gX$RqN>TYeA)n_;H%3*^!6(I|m!`6nnWs}_lYaH);Ll0(|qQdIuTy9NNL zDFBKa2V#??GC7a7)LJet3>EK<+oK}&SF=Fw#$@E`_taAmbqzlRgG~_OHFU|MRTimw zFHyAOLGp}W^qKE|#eP~!{YJl@Yl_j1ZP^;gaE(=Puo{5ywV~IWM?5o6W*)g9>#LRL z2{Es-Xw#uz`^y_+Fz6(m$-(C8v0t2)FtV<;7FLztT)DWr)Q5HdrIu`+FnUB=aokdB zxj9;G>8L0yaehoIba!?8zV}sReWB9Vz*VDKMVkq^nB3CHkt21ujM%4v-@|cFu6;3S z3Lz*cY_aS1`TRV57Cr}L;*8JW86N|0^Tb!_VW!O#=TD3u{N=b?XACVM`ORAv)O)_} zV*nMhs*y7+i~1KuX$K7v1C%%(9)PDV>8U9PC8Lo%sl;YDCX zGaeT4BzSF7@^Arp8(ASNMI3xu3qIRC!Jj^C@Y20!Z$1M+SkPWM@wG5Q>7}=QGE8jU zIOpUhR8*5eIr!SzME<6>NBa0SL`h`M85f@zXsHOPP16JsX@+#yKwzA>O89tGgug`9iRxwsaA@#Piv6DM{&A*wFvO|K z6c04>5$_VAGuBI!0MpXN#6f{oTY3$n4GqJZkqb32#?^N4(Zcn9-k1t;{Ot7VU_a$f z`BeG!UOHS^So5w9IkU(eMRxQLmi`ti{6x1&z?*rkrfKQlJBm$DsXE0anP#)`=*&76iF*3)0I+i1)KtpyUvUe2$eNn=0P82wU|2Rha2shA zHn)$D4=}Ln)!Z_+<}0)7RE#3RqymAgPfS!UCC$q(a`}(N)E%F~ApH3`ulD0M*BBR> ztg@ow*f=|xytT87ne7*A>+82aPaj1@R@vBOXUi@SP0J|RjHwBNW5N+>=Ym-{)u8f6 zF3?IGCeqag5w4*1u_>`RQ=EmFfHLO#500quxoVnSm7wa52t-Gfc?CX>cLZVsKcEW8 zu1$GVXYv3>FL;jlIn`sLb#^Z9a5se@FHx54Xi`o@WFGMeT~q+6DlOhpUC8srXGmP91lN;Cn{4ee-P;t*}d zbkq{c53v9Mm>hEP)uHVcYH$o;fXaH?cNsE3wh2j49{!?@7P#HmTtw(FB-#7jqY9(6 zZQx^{tq37?H61ZNP5?YtA}9_u99l2@PVfMC42PQ8SUajy;G$3t%+%~NgwJ(Pw&mr8 z5yESre(<|XDNDrK%8JIX592pt04mhyl zNsuqlP0#T1Y+hPkCM7wTx8)}O$02dSzu&-kJr#fL?A%asP@Z309^bQa5SqO7%&N3E zaPWKGh^Tl6f^l!p&j?{(0QB?>TxlZ*4z1d(nyiE@4U7d-`&TfwdfED;p7XCi@$n{; zdZWL1`d!>=E7A}@7IN>qc)Gq42h7aPQADh9i-;Jo;%mK9098#tZ8@PWmi_^Ng(pR8 z>Vq9@rkQ}h{6kG6RYO=CWNl;oC8*Sx8Oh64YI1RBDRJaf@JWMHey5-T03X7Musb7s zF+NMP{?Jy8!>J@jBE4il97*$cADcU|K*Ci}0v*ek9&JBKuHkGhX%;;oNmp6*&H{0> z!8v3Insd^sGC25s@McB`%MzkF;GX#E(s&gdCrjf3e0fC*Jy{!vbL*-FwKr9P->CG| zevWBd$}E1Wtc)XM?HlWZyl`;ntosAv;!GG1E#VYF^6Eti8Hj4~dZ^rZRUD|8?^ekJ zbsrMNS@~#krD=cdQPJV3rFdvu_y&H8GkBv{iIYSv6}6y`q|Qi(yQw42%w#L;0^s@c z=d06OVcBW+uvTcE?8PAAz4>8`+KV&C@B%V(!PG1Bjg?cT|O{wKdg=)(i@ zKfJ>myVP*n8FA7C+TlCY zw#-9`fbf~qC9$ZLl7*I?B{>8OyC58&Afiu>ha|c=9d+U>jbwM8d_mtp4DXH#;iSIJ zg}KNmFA5WPPS*KUN>Rv?Cq|Voc53!TCxNj}l}lKadd%h=1|Aa=XUv>%!Wft$Jrft7|iE2(l*p>SP(CsDrQ$7%! zlCopQl{UORbZ?)byxQXMy5{p(Qe3R7n?8Sidk z=H^a@b3NY6%>}OCYJCcg=-ce={d=GbZ&42^vl-JVHSceIU?f}GOTg8%6Sj|R(tP7z zrej{G-dY0I#>`0I=*X1SA}lAC;6lNDB z0t=Tkaf=FRW|wP)OLI_(wY>TCx;>hU5X)(8^a@SR3yNQQ0X-(mE&F+7a7fP3DRMZl zzM$EhZB|O~qs;?D*H~8|;_VnA-0~gWGKzVbZ2c825*lSoZ;1%3HjN>3!SC_|sDQ%~ zmW1m+cA`mR#cx@!vlo~vGnm%^)m`s6$*{r2fhRt!$%9^q#lVZ4i=h?rQ1 z*DZ|PhXsw=x`wjT<2rKyH4P&eng}#kQ-Qp0oSp5ZEq`2gy1Chvd%qJ*0|Om(^&dZe zEOP`Tslm|y*49=@&sic&A(-aYW#@MHS$D9pDXXY(u($vIOo{#4)>+f$Lh(D=RzC#s-cd>0`l0;+w|(XHyKmW+J$r;WpF z);#5j`{dsCT?*K?kf&6)F~_S@O|`%JlA?@;3527OfLDDx3~A~)$ltR{6#zrG0;NPZ zWRD|slY>yD395B3UcPuiR6hCOf6v=(Mh0{ir0U~G%AB@do}?}6WMs_gE<4bc!4QCr zudlJE=g#>+7E~tx`ucj+fP8h;07ezUq=VcCOPIj!`0GZ<3rl;metEDLhxj$Wuk8sy(9C8xnL= z9k#SjR5{ZKkcef2!^f-&)fg5|k7qG`l{FDe#mJ9!{A;<8o7Waswn>-tH@4Re{gbQ* z=P(|Vq6>Zjt=fTy{|1_l>DdJxrQIMO7}~R8#UxI^)G(DY)zAfFE={6{B!I+*nvtdW ze6!@zNBURJdI&~NCr!KGeIJT^e4b&20uc#GR#y7hTXgV{Qwo`XH8&L~F)=Ye-}H9% z)kv7a!QT47V7{ijp`ozw@GP2J3dWNK296?oKRCa7!X!zZj`G{UOE(@~zVCY<$Sqx5 zUHiA3#xFHhobZbfP#)fOJWUZi-dcavhu zqVv`ytY}rD*S1kVVk_|NOu5e=B!CI!O#F^$wEcLM2+R@GarA|qdHDE9>V#0`zX17O zEqLho-=sGPKDhy{5L- zV0kv;x$PmN7SHYHMGl}&J$6w7q)S5Sl50Rb2Vkn5R6p8po4TEI3=g&ys;}dhWX5^b zF}YYk#z>(uTUda%hwFVgL`fvn(<=M%Ls{P69}_@Gs1(uk1K*64Pho;UATAg;SNytl z1&$32HSJdw5eIFDt`@Kryi(MSi2(iQNZu2F(h22Ma|39{sn2-vVEJ$6Q)7x?^lqJh zQWn{s`J~L*PMrOXh=}Oukdlak;zQwdKT%no8=1zGo-^6N(nI?xHrAW#H<&BsCr1Yd z-q$6DlT#Oe>@6)zh>5QOI>*aoI1q*oTDVKu<6I5d~Q*BEVWi zM5Ly%QTs#R@7+t7exP~g_pPbDyu7^~OZ?L(Q$4-I&Q2pblqsk0Rg+cTqL3#0OXo`| zsh$#3P`g9=aykjgM^V{B{)y_vZ{Cx`yO-_fNm4(^O?z29#_zn?HWDO%YP9MwM}MLk zjX;d4G^xjxpas+t;rEGAXd92F3fvCVY-}!$9;^6KXmP|W@S|z?ND623r;K~{ zaZ=>t^sa`FR@MIarOf=km@Dg71h!GUx#`fp9Y1Zu@kwSfE?tof|j))_a}ZuY|DxR8AV(2Lt$!*UtCt_n8D-U;kC$OlMuU zFIk-4uR+*;&wA^mL}Y@K(*jw0dsgpD{*KjZM($soomp-7hll?T3F#x~mS}hI^lY(v zNrW~F3Ta0DOiEA7B&VP#THzPqO&+z-3ge3ABz<2lwy#^nxZGxg^i3!E!0MP#50ffv zFvF`a&q`xfy`ru@e$%^r<5Bt?jpgl+k<$j{*Z?}K#=xzAGRKSnNcdzKHwJZ(Zy$0Nj4{~#yX1hTk`mj3!^9)4N9y5MLorbc=J z5h&Zb}3@n_K`R{6Frm|g$U)Q(*HlQ>`+m%M& zt^Vr~VQy|A9^sXBF%B-S=EiR~!VZ07uxMaw+gjmgG`yq4U_bP4kYyGKyR%zWyi1SmJmnC?h8QS%(t-20h8L^Cq+gG`pCOgthd ziE(s^+DU7m>_c$r8ITm`v&j_B!0^D6q?*&ntw}%Q7V&wMhfEjaUBtIuV|I&+W2e=; z$-M7L#@lc8P37dGplA;O?esS_OxF}xFLfCTv}8FyVs$yj;}qotQn*rjLsd`lwbY ztzOi~Xt2Q|xTWP#B2bKu^mA7Tp^`pHEjs$m^0@F;UB%Z~8_4C*w6aivqD^TqD%U>D zC1DFA7h}jNJ;qz)CWBxAH`>9^&+4oCBdxTJf-`fnE?a3)-I8BU#h1r3=DBvxpRflk zA+#2h)zuXZ)c zrpx`))x`oMf*O79FR-+f&^K|+p-&tune z8+g5<8TF_#M8{Bw!^{5$kEZ$vtM(j?BxrMw5zKtgJ(7DdiBt( z?CW~Hb%xxX-1;>>kJ#-V^FRJbd5-QgSzXP<787m@^vJKvO3O;ihWsiiL5llWC@UkY zbz~a#+1|cbo_<)bxTM6hxrNf}Dcsy7M^{<#c7s%_QN_>fAF)Sdd(BDV=L z>pk9h{rHmQrh-doWmkkLPIaz>%U&&jQ^Ibx8>Vy>$-Lam9WpA&Nr$6z`0?gYU(Vj}Geq^jxQ&9XHJ_!#8G;{#Bi=svv< z+r5VgXb1=>u#_YtBQw3v!);SWKA=-mr^J^ba$Ng~MaukN4EcKgc=|PU7LA;Yqe-^Wo*>q&$q$*QHOUK%G8=oP?qttMl#-OrL0QzD*Cx;Iq>fS%T5&s!h^1B4QmJ z9%maxg<0@M-rmA6_HCcnjvvgj{#JC(1)!bcKCf$su7{FS`+-RdGZNPcz^E2ONEoow ziNpRXsJ5NWdc-USN0p)XE&KG4@`y4UuIS+*^yI{?%8Az;n$z`0_3eJ&Bc-3G^}B5L zGc&hW85-W`>*As;glIBWg31KYGD68rxhw{z!nSMfRX2V6d}HVKNVd5`?aW40*;4Fr zTwN<03Q^||qr!=#J_I688zx>6=;Mb)cS;J!R=!m8 zUDQwGVZS~9JH42i31N$%QW;2s1H=W%V-(~2JQeR`?P&kL6=|N#dL{8sOIw7QjczFU zIfR7;xw#L&O8;}=l`M9GOrol;9nU?Ux-rK5_7xzw2ks#-nKg)tz_I6T`*T~yIIL)a zQ7rt{8nthc`AQ)W4Gj%Oe9gMMWEj@AE6heV8qe~{+SMQgKw*X$9i_$7{r#8$Qm#%{Sg9&QRlK=kKu+Rh?wd3YPj=I`SAH43&(0O#EL>l!=#PYah% z4v(Q8)y=w0L)(P6Z?JEE7AGB|Cokh-7zynS<>EevQ6HC{AE+Mdz$SW*Vw!HNzAzl3dJihl! zRZDAmW?@3igQHp!b7m4oWsQ_3k&seW;G3ZsMSX?^r_c6=oVun`K6Xl@e`jVQPWBNH zf^M!C78b0Pe_uYkiiohWvB(PPR9Y|?E!6c;KN^1M>rlv`Ma87N&{EYdm0)bwZt_^? z4zaD@sEN?fC@9`6Vg>~|ik?1>jO5ipE6+!|;(>*Nvs1HWn@iz>=wuZ!ks!W2eNr6A zVU+p%pC%ZZi|5;7*rt&cze;^lG#|O+B5k)S%S5)#5Gsq=adW@XpB=d z(Y1VSEmIvMr1`+KaQvVEi*B4ic>VP}*6(3LDi$AIx-5B%pQYIdo+C8+JZ;f+C4DKq zel7)86vKka&!7F3_gYY#j*CioiR_1?-H!9)Q^?mvy2JTQZ^aJRLr?6hYtygVYm=Uy zo)-4@Yp$8+=V${uJAk`>SPftP65*`x{v7IRy0yguQ{B@RLqept9!tXDJ4Z4z$r(I} zW5{g;0W8U8%nb`T}ySdwPXOnW$ zXhzPItpsa1f(z+Tc6c@ILCazrQk!~Pxq{*k2xj=7`P2R+q);A->Cn!b!rWe>xz6&&lk(UuNbihonZiT`ps&Q)N29WKve#zL9GsBJ>v zVOAgjNh^pixG$kY$>C8JGWLQ1!WJ2(K(;iu+xhb!AF1LPlecZ)#lafLcjiSODn-T+ z6*+<8A;N(;;|$OZMn$d{O9#>2VUrSPr|6f-a#pw<9iGi&yO<-2agmJhD&)uUdfoH{yG03U%k(K=KXdcFV{PI zzSUbt$Nv)XU)-A0gA*4rOKIU$D0)aY463tIKt`A5I=R5SedlycpqRPC`P-~LbAC5r=O2YrxYA7h9mxDRVF7iGxrp9(;P*jMmY9#s z6anziWCZap@z2y;RD^NBi*Ga<;o6`bMyVe;Nt&C)s&S@jD8g<~4sy=a)dzt2nlO3& z)a_TmV(A#?nUgK?#h;>K+OSn>Gq?~BP5veC3{+cvP#)9Hgh=E?r$Hnqm6YREm6IV_ zr_OaeC95ZQP2WSaY3;XY_Hm|dHpV@?xMC^5e{AvpIL%b23(lcHlIe?T}un5Tg=Q{ML^r3N9*gm&12~1 z$`&8#aqaBNY+~jnC*$P{xYCXy%8g;AoXx>^4re8$(OelJrpi!+4VFetZ5b$%CY}rc zHNK!A=?VgF#5ck6wO-(m{}Eq6Nl7qqp#U^@RPi}2Wcw|x<>-i@4g93IZAqnD^7hk%HzokTskogpVtxnzw3 zv|`eLD?V~!(e%jfM15z74@7!hvM~jTFWA5DV&bP7K^zi+2azT)=%tA(;xHa|tEVWS zLI=x*RPS30>hz5f7fmb{zGH@0a-mbvX{LS%Uc~x1p_u&KkB`vZu0}!^;>+|F4T9Wl4LuctCqM zFoU)r+E+LyeMn-m?&JO9{!WN+%@VHKng8kMr7^pB0Ke-iP#E)oFG7sLFkTg=r{GICyD!segb$lOGVXg-IbSmqV}& zn4Kk4b!>{u14yMFq#)!hwOMw2XcyxM{tJX=b=e(UAcf)}31A5|TSV3frBs2)BJ z!OcQjU?;F()XTjaf|%!WsRj>Hh^wgm0VJ8;V3t>WlqpFN`S89t3NPGxc`=ng!wN61 zQPtG@O@WQ|7mZ2i&x6JieFofVv`il4G}~iVqa1#f2i2ilB+Wl4Kx4S5zyOYovk1QT zL%Q`pl9J>*`ug|NbilwxKZ$O-G;+c!EXhtTTs%i#aFQBa&|oE$u?!(o$sa-Q8yL(~ z{RSMa!YshhXA&Yjd{O)ZpHz&|zA_wMjYStDQakdye4e-r6ipWly{gtlqAu)Rs-nTC zMv>{i$V#Pq^Ck5Gnv5@wVDVO5W!M@==Ie#8#%ZK*OzT=fTDCi5pm-2k3mhJp=J`Z6O#dBTgQ z$QQ+_)JQ(zFf4H%5{)04g?%u?zk5zaM|pX9O@3QRNli&fetrE7Edk))&E_p@s-7HQHg!PBl*fQQ9FE{x0 zsc_fSfNKTqCBbbX43Ixyy1AbKG<=P8dlis^eohbSQ7M@v!GO!&`KcYbwqzkusF@#zzz_P`=b|y_N;xCv?z*A{>9s<~idcG|U}HBe*ZHJQ5bB-7=_%*jw$kTP=JvC-nMMM}z#`77*5yvN z+01bh&`E++#2tM8E=IN1^*;}2)xXXMIYU|^(k^Xz{A&Zy59cKVs3C^>BdKo&;=q66r}|Q9ob=(iUb0rr zgt9ATR-=Bq0brGIomplu`}<)tDwMDSm5#~{)rTh562tfOq0FBU2MsMeCWo>8UBbD+ zI16sPN!(!zSYnWbgTn}Dn)h*L8WA|kk@kHm-4rPCVNNFCH?&$S7aT;4Zg%(<70it4 zz@i5FnO9TEQ8See{ic&Mcq3H9LXAo9PXv$LgNR&(3&?}&B!M_EbCONHJ9=|WkovkK z08{Nmpg#ZP_jS|?fd7HP;^+$+C{1%82RHgB#K9rv9`5;31w)~pK(DzuY zxsKB z4C_AimAS)|ER3;br@X>TOjyxvXJZ3v(|SE9r)PmdTU%QzYe6#CnzFLGf`YGRW+SfI zxuSFLf5L9%_LsjW3BJD~Yt>IIJDHV;bbx4t+h8J+m5B8y_CVKn{0tT{6nmqav$P=UkFybh)oZV`VW@#%t*7krE)H<&^PjCY5w zPCiZ!7lXHACWw^L3DpE_>$Z@0+bY?wQQBHsyRQ$B4%g*l_mgEmBPZjk6*wblZ3QNC z0xp<(*V)+x^S8I0wl^@R*}{yjC;JC5CD6uBsh~Lf7S>Ax+yrmJ%5oTyy|IKCxDDZV`5+1ublN} ztyXw$*)){{sorfLhF_~i>T)8JIjzRN{0>`xY`=Y79T0n&vZ=`Y{{3iwpPWRr@$**7 z&CS^45Vu#oHE!|>$)Yu1|wxJ6lauETl)TTGx`+9L0HlM1)_-|EuCnA`Sfj^6=OrH{LWHP_NSnHp9-Kk3*9b1P=U7|JGPDKcy zcoP1!grK4?eAjER{&Ie&{WG7y(jiSr`NiA5+=7oL>5?Wqoh;#TpoOsQmuDYc2-zt) zd7I_Dlvb9Xxs=k@*ud#Ae*sH|g5Or^I%Qf$>r-jX;mg*?I!nJAm1nPY*R{U4s~4|6 zNBGL2tJ&`Q`I~K-HStz6;=TA?>2Tse&Or|0t@*h*-vbA+H5I+v;Y*bxHceu7UDoJT1WlxW zOAWrM)4WkGXuJX~PklzT@%P#_)@@m)CN5*4UDjy}h-)JqZPc z4)r|*%@o!|F$$aCY^PdSkCQrc^2b8#{FI$XUzkhLQuZ;t{mL?umm2`K5SY)fl3rgK zdTXw5Zk4gMv{7#?MiJZpDdc8J(rbD4zB}pn3i)|IdD{YsR@tPa;lu6N)LPh0uh)3{ z<0M3Jl%W68Fm$wBq{VvcH`w4}ZS^)<5tID8z#d7O$3{Sm>}@$jd$3o1xOvTrb&WsU zKzTBx$%TiQp(h^n_ya>1kJMD$UuMF5xROzJ7bC>Z(k?qKGc79}UGAnA=fkXe#{+N0 z)5H6YqFOyIt%i<&L)5Wb`*5L#!x=d%RM&NtGkl^(4`u>ZIw*K|k+B-xBOzS}_jbz+ z^&poNCne+*r6ez4F5Dy!zXPQ(sV`EF$p3jqDjST{o+KR>vtig35uJXa1esnIUF0^Q zHXOX$eyJ+qs|!(H;Ounz9uso|TNK_kSvfg5d6?Cnio>L(jhPu2(QF3Lfa`U!?)w7u z-soVFC)mtP{%2;Uvmd+N?c296BH0CxXV_qf#73OS71j|1YoMU$hdUE?fE5wH|8jFn z!fYBJ7n|?PTipA%!khuH_aPr^gO^4|6#ZWP0d;kC?Yq}EHy&BT4= zVB0?x+SVV$;~~I1$mlhs>s4pE!`(sv~vG>%0YcMF4VJ%e~ z!R-yU%l9vQseifPjH~DXaPtGj@yv*w0zqf3Cm!

Fp1HL!K` zeX)(M>F~pThTP12ZMORuh0M-=+faC;G@c!lz;b6rze{5zg0k)PkBOVA?7_#jGvRFQ zT4szT_4)U$oAbURy2*l%-H}Uk4tuMu1@%pJZTThTKVJwcUh4|8JTKA@%k}10XX}hj zX*Ik~?%&>nbbC2cuS9?Rz>4^?@31I}MHVFAF-Y_)r%=0SIgpX@Chh9N+)Ug2H3$D& zh^-K>MPMMvI6n#ffrtnJAg^;zDUOCAw4K#ESAu782IK+b0xk6N0T!wXSmQ%2`Y+C( z!_2)xvBaU4k$x?Hr=g+6W9hqjwYSnJWg0MRJWSiZ-_6eWZ80D-fJL@3ui3pO#iq-pZ=++&zU1?a!-dJ=y-(o@ZXuWaXk0>t-6Y z`*ptcs(5GTCk$9#^~V5IO%I{^flZbQudl+sn~!u1xZ!JS_FIo-Wo$~( z(KPv{5x+`mditGW%z~u|;1nj_XeIYrq{J&`-J|5ArNInpK_z*PPo~nlsk;_kx?fts5`v z-CYD|*TAU^ahw$ThZyb?YR_c(oU2>$MoXg zOcRmzK~?3$k&ZM7p3@6cyvnhlqsv6&w~jY(vK>NC!dU}^-pK?zp~@?VL@4KEqDz~V zAZdm^Nnud;UIrB@{=pOTdm4vSmzD5c!No8ng!jU7+I!poL(^FXwe`JS`vfoUP`tQH zai=8|iaQi9P~4?B2{qh`yStTQ#nTpP(IUkm6btSy$&=rI-ZwM(l6*On$vJ!Pb+2_T z)A12>oD%cl{T<0U5fRDwsKBv^gf=nyB;P=+{^q-6_?axccXw#GQ&v{{JTASctqtMs z`4G>%6grGf?c%9dbLkry`5&~HSbHIZRK*wC5&3Maydn3=gf&9I#6 zJlwv8-1Jy;Z;H9TEmzQ3V!IH%h_q7{r*c!x$9Em;^HHr zABX|VfT?j~Hy3qgFKt;8VX!ceEJ%N7+SHc8Ivm<&CaM37vysuOMF5Y3-0Uq&V{iQv zBg8j7#e%FkxZKH&Msb_+-Bf#Zan6T9?^#7%U-zP$w%Ex~ldU38`G=ppl2xI<9jN!p z+iS|?5tAum^YfGY4qC5G;Ctb6f$r9?i<`8sY7+(2?Z@9QYzIzQ#szM?$V-Iyl|K=m zn63=HRxd0zzGO;bMR2}|%yBgz;8I0eNiySE4;dZR8n{lNe@y>4dcf{uXi-(!8=p|QSC;aMk|yRRxVl# z5~!1JKMmMUXs~}~Q&yg+25Z@!eQ%7m{Am~7Y{o0|crgbv=_DgsmWNg1xqU1r#>HeI z*;kP_H!QsFj+X#{99PB%A<-(WI+HBi*I1;>9hVR< zDK5eAC;)BKA{F}2K4tyK%-Rpx?&z+#4jzBQfzBwl-0g&gTv5d;pijzexj_T1+1c54 z^zPx|$i~5Z21fcfZ1sC?3*TPv@tEf~{)4&1#lkJv%&ZqY)=nPh3oc=J_!Eco_THji#>y6&F2FFgVyp>x2H;(Vq#Q;=%OiO`<>YJxheVoanr>=lPVCJTO^Br5l1%Y-PF#{Lw-Q4qj|uX!~deX z7E{+dfOs9?R{BuNF4NqKS@>=Q6W}1!|3xVGU%okkO+w7jx~IqA+}z#OUoJScd74Ho z1E2cUE~RmHlKuuS{@%`imbxE(j*2K1_*I+RO5hC#4F`GA)5YKThoQC@{*5~t{)9qY*oZv+9YX)urC=r|EVT!O z|C#nGa`OA$P_ON+Y%jGNlpuU>%bAFAk&syz>%wB@H`BK9DH0K&us_XlYr(F)qo$C# zx4nJYlu%;ybl09GXswc_a)T5`DrvU)*q(Z-T=$pgPcM^@y`>Gq8PRAkYeS=yNIgTO zUG#H>in$yn`lo%t=JLBn9{sOIsJ(#i%VsaS@iCDbU9JBEyb(K``K?fAbFEG%MLd5$zb? zkgJvelEjCqmB|-G8L|(tn(Z_nVS2^Uauugt_GhjV*L|zQvT;9qPiue2B+9cGT(>ql zN$_SEeaHp)=5U``d8H{o(RSG{uv${=u8h(bk=%0X=B2mkEg*iQmXTx5f8^76nJyk# zwWy=B8!UBw|6axT6Hm^@-`3&FtBq`b^MuLKK;lWXL4s`f8WhA%+iP! zNrDEqV6Ox`9AR7|#>2yXd~Sz^g${P*cCbaPb4`DOY|{0yh2Kw~wgpO~7WMDNpJlZ2 zu#$6=5eM6)#Xz$tu~;nxAF=2w&?_6-7_(1o5j~DEQT0vErCjs(#co)gzTuRVl9Lga zrTIJ2XVKVN-)PLWSZ#h8cksrRJFj4?+SGk0o`V2W)T4R0Vrfce6PK%V%lFRQHpKq~ zgDd;AIbi^iO8Gl*pP-TJMWfxtMazuMC3?ttZqggL-YTknL{EE;-;O#ON3D4x|9KjS zx0v*tZ=Ud8_4XV$WqSG!j=JXRLz@gmdXg~hOx2RPN3D@p zLRMZUREy(^a8R^xtY-YVq<_6AnF&}8tGtquM>Pl=ju$FYD)xvark_pUxRDvUhQHM< z{LbgKU1l`Q4Gd$zyX9YIdCFg`WZXVQOL6V$X8K|Ndf+O)!A<^?yA;Dd44{aZ7T6t8x_%H^?iTg7Dzs0WHPrq27z5<*O|?^5CTEcLQW=sv&U7+@tfXRZ}Lf`lV&?&St=h zcg{L^<$((#eZ=b23%rpHPNNS8k%|DRlVzVRO}9SdQM`mXR622zPP?Ep_5RVb2t30-9j+HlZ*C^u)Il)AxKb}(8@+t^%|wPz@aaE3kB!sqssKsYdG^7w zs_~TtHziZhM&t9MzzzNUkz#Snz<)P0pt+_1_^2f6mp4P5KWEAvI-gP1PyFW`!K4!t5wfcXc?8k1G4(MsH zY9xKLfsyqQ&D!Kd$V`U-P4bC~U!xkSLxPIYT|c5ryDxK;2@#W0;dyt(#dN;)6sKc7 zuBm2Bw#FAKQ}^Xsp8Dt|4VTEPK7D+!c|?j~P}S7sauyx!nhdHq=IZ@5ul&1Ql}TYf#lu zZh{&xFITx|Rp%{KNRD4m;ib~^(uIC!Eq1f~WI0`CV%*!S$w?fAH_Y4G;?4u8d{UVs zeT0Z3VO@WO2WEFmuN<^h&;P(1a;YJi`iNx|iS2{nSxZslX ziMD!N#aTh;-A-b!Tc8=9`SmOTWDB#~-Ei(RyTRI4*{^OBKO>qmz94{RfszE!Tb6i_BMq z&aB(j!THvu_Vu({+L~jkM&jIGzhvrlXgkvk8Igh-ql7UxWQZ9A{tW%y0P7mbCRZz5 zj2z5ckO?s6m&EiqE38ik%88ip>;HECS6Jl1qxggsp{%HbZxYtE4tB5O^0+LChlO2lB^heS#aD``_~k-ERNF{7@7 zXi|XkIDra=p(31~%n^Z5VKI~e!dH*E>z@2zCA9_<`#Ne=y?+BSe*2DsTK_u$W`AM4 zf63p7VurVcTpbQ^HQmeDF7kUV!6b(;NsAm3x%eDCm-QW-4shHH-uoM*{UxYhzjQQQ!2E_|O;YFC&8>5h!PSo`~l5=cxXa9S_< zIsi8TzA~|%s5}=3(s284|6O2^{?_XQS%m1JS$~ok0Q_bw!0K*cHheQy5_H`H4~sOg ziE#qDptiQ`@7@CVu{||;DmYM=_*|~!lBk(EYyz-bEDlz*X+i-=7m8^^Hk}y>e*ck< zk?~-A8-U6w+{02MU4XTi6anDa5+^Cqds#Ex;3d#=WJs_1f&lo%CsX(?2TQ4ZJLft3 zXN*;0F`n^j3~ZL?x$kH9XMtbbU(A%`a9HFe>1RF0UIN?P8v{~Qbx#4xy;#S9o~?y5 zK#APz6C9h)B_4Ya@FyPq#e!U5lG%Og1Jvez_+y8DxCMysN z=BW7K*l-VNYp_Cb4LBUp=XO-K-OPtqCICGMqwtxi%I%x+pF!xor1$6lFCoqzp|;Z* z(FcsH+$OhcmOcUo*JXAL(P;c&ZIRe`cE;G3s?XNVUl)n1pZD2CT@TSFil-JEy85$z z)WqdTxmb>&;i_p!xZVh&jNShHFgy^&TC>IMx+7QD_&dHsFqxzd-@*HB zQFUXOU>;vo49-^7!Fvvt2DeqSlJ;NMKNC^!J-bLkcVl}H?I(SF;hvZgabBu}9q^w0 zGB>FjSm7}InA5hvwAf!f+EngGkLQRi5?R1l2M-)8tAFcr!|-TrL4J?Q(@=dg3?2_& zISDARPrk|xNapD0t27`=O`tZV#4RIheeuI5T&}f@5_(Xk#O~I$NnmRAI`vw@P~v;E z>9^X0b@e1t;ejYTif4US?_%Dy@P%u1=umC27EMCmBqjhn(es~+zq&u1?Xf69a%W_BzYLs>)u>VaK{O^<4^XA%U|hooGKRR444D9=Bkm zAY?`us(4@5WC?H40on+J}tF_miUQ$~Q_+4?xE?c;!GX`NycI-z{0N3&{>GCUI9CVgWjYZJ1G&l`ypZ z{>KL^CslbUe@dmATn;9XL1a>8K@8QNwr`T2ZRC2#tRe0d%8K^JRLADS`PrNSfjUcy z`JErdBsQhg7Mam%_#nOdr4h}{uRS?*( zv9qqkbWLgNspzP=4Dn$e#%ig>$TDQ6W9hwt3FdKJeqH#@f!!TQ$?+`Z#=e#bHlS@_ zvgaYYP6@QZ(Yj&e+mL;b?$C+6O4K5@JmsOhEv{1Ljav47n(mMY4j+2ZfAi;OBE~aC zMtJ7op>Q<~+5`6UALdaI0!{eyJ9;1?W@6|#Un5vVn}5&ap37m*3;_VC<(vmcn=CO`U~9WX6&Du){5AksmksDVF@2JOTWAoi$!SoNuvYDklDd;o=46V`>E{Q^ zQWFL~7d$uu1W6m&pS|qy^RM+l!nV2u7+>mJsbP<`JRU~YG(Umd-0Eif`DFoN=4h#t z-QWVyh@iH#_~->0E^NEc&pZS-)S7A%*vh&hj_(dN=YvX&-`^`izP@3EHr^KtQZ{&~ z1C={?GN~>Ks7$zBcO{OI`AMQ&3Y^Gyl) ze_?bkx27+skpJhDmhoLoXc|YOL@DH}NF)2`h@m32&)C%gR(c)fq*<0S#x(||7fK&;zq#dX$QUIrfFtU*34cN9coX!4&uo{N66TGzp*3n6;Ot z?Y+QKcg9_q1>@VNQd@)VpA=k{{8_m89eK?{8tQFijBobq4J}`^XDGRSGmbJ3QN(pA za7v^^oI1f-c$dn0SXQf%^nu3!%4?KK{E_@b9gozm)_>16(ug$Ik-Bbre*}#%vhQkr zX~gb0R8fg{zeqh$=JqJfkxnV+&8@4U;qhOm@)V*UdCO&sicx6BUb7Z&3oWp`5KkjNdhQY_(fkGMWK?UTm z982JUUg7MkN%P8eRvYM71p>J4udK;CU6`qo0!Z(U8S#JzNYC}gxQD{Quq0?3xr|j9 z{}gC$C<4i3zpG>Ew`-V*G&xTrfK3PzdYA_&K!=%;6SmdW>J1$eFXZ%_r7%~Q&9}7O z=P*`>CE*yW@VA0;VdE(os4-b!|88Eu8o7Fe+=g*OkL15b*3b*ilj3?IKbnW5hGnh8 zy(OWdg07+K*5T<4l230ap@|R6iVxix9S21Pn3<1_8=N;HE~TJBj6urPhb!MzLHo%0 zX>&9gYP<{|cqCe?i9;dGj=@4_@Cxqf=7u3GB90zy!f$UB0M6$Y!(qHch0-ehRYj$b zzsyobYicQqd~0v2(Plc9S`pEuW!SCwnJ-VC`m?UVpmX+5^!o^vjBV(Iy_vJ!u0WYbY7qhcj;_vrI4PS|^qs;oKmOpgqUTMhj3yQqB(6AixI z`x5mULw7ALUkc3U&$ujq)yVgN>PdYpjmg6-^`^g59x;+!uyA&7JAtXof30yF3^16Er$_H*q%Y+93D5#LUolrWJ;?|= zUIxOii*&m7FBwZSM=vZ_t`vdrz?B+n?{N~W znp--bz7#jr4?r%w@nT)}3Ukh+g;+^TW3hFr{zD3eZm-8)phfPk1JJ0QrXyBP5C&La zww#RI+=u{=!SsSi0gAd^bw$vsY=FGDq;=@>JPqdc8>7(&+{0}NaUfT7Ykz9F)gS$# ztGN7AD|=y}>HZ0OlDm%g2?v7fC`4`30iZ12?-&{$2mPWxbKIX(xQ1Z?5O24*IDc=4b@b9L{Z7V54`-pXT`_yay;zD6It?BV1SVmh>LMpd)OY%Zh zw}13?7&TZioNarbihkJzOXw(RhaqGf(C$7{Nh7govR1Lovh6??HS39Fo0p%XqUQOz zrbMft$zR11S)S=Ng1nT5&^vnUL2rF|Mvp!Y6WRI_Kc#DyvhSo0%(ihSL?Hvify7X7 zb$Le}QHRxJt;7Z6Pck=jf4z~ zu_oZuvNfR=4_!Pb7JTF8isvNLv=khm)%jt>sXJ@Vd0W{kt0wr<`-EO_Ur)n(eD8v0 zC>uFpaiw3R2^Mm=X5`e(2-^HLKuF!9vIYc2ops97xJmcdG~gbm=;Vi7S}!pRxB%=v zdk3gcWSKbd;wpTZUPmDAX!wW^qtXYbraWBgxE(6DE|xocw_7mk1Vl+CKmXoD;N)sP z`++=b{05k8XXRV7Wm5A0D)aO3cuo%5d)En(x%#2uft*+dd=y&U6wXRe*9AbfSxENo zI)$<_Kuxo$gSs_;%y!STH8g%8JlE1yl=;k_i=^4j_e1qpqS8xDKB! zM*?C?w-mm=r4y|}nV_Sdfp_@@4_^kxfy$dRlEd3&66?_6j2%8j9Ix?p9SNS^pfE1z zPL%A`nYG8=dqqrL2qNRO-S?^+f}^yYwWr#H8XYqae`NDB%Tm|%4HdgJJL-U*2wEKb zJ{AKO+X5U@&6PCTf}jmc)N60YKvJE&%N7S#mdlTzej+*RpEf9=rL*VR1{a%_=iiT> zLMs<@Tw;5_b^@!CGgOz8o09i_fRfDoS$SgU##rJ56|}*c@h&A~@+=o1r64!Ld-~bt z(&CNf5!mAnBG-lLUBNGG6O#RH#kz)3`B2hOdK4}Ye$NfPjcxURxCo$ztZRm7=^P>i z;E#=t6fu?DO-3Id-8;ZNd#e8>2w_SEDBO0#7rMq0G3Jmdm{<4zcp9#+837N}>Z>WE z^6ODqASrsb`(Mm?A3M~gI(p`Y6cg}KTU>VBD*0E9PFAt@J?g_+eIC*pUS6NRH+Fn=}iN`=iRauUchoAoPPpw(o(8&QrgY_W-(*`x3 z#(}lDjLtB)!W(uf(lmk_yZWm#5uJOgO0zgz5#tYI#=xGWYG*^Z5hpJ|-Vn&A;L}Tv zX|q0HFeWY3AsoU5wg2FVdsp&DGW=8ofZWjJ$vj_~t7SA0T0)MQv>_i72LM`gxHEHw zvNeNrgj*69sd2I?6)-+%IDkGHK!}x|&gk0=MstAJ!DTem4eeWLz+v}QPc=By%@2UN zT7@07%W5C(cz|bcSM^3IO~gEGy!OaS&|P&wW7I8w4%s(u}vJ5CUl1tDEY2 z-(M;au}mnU(H)rZdy%$IU}=}pC}4T7pyjdBKdv^1TP9!adBVcw^`Jhkfxv>gn-0x2yFJHPWM`uO+vV~*fzvFff!JRSur!Tv--JQ#g{7R z_)6f^1Bt@<^x-nv{WPv02@tC?iyO-gLfo9u%NieAvDEZca`p1DdUNj|90RSL-S~mstSq zp#Bg?bHl&(^3dNimzLIHM@-aJ) zu2dEyPw2)hg~v}~0CILj!d;fHC*PlB#vcgysPNJybkHer3PDaMbX<&ZS+XmGe&*D_ zbR-1Q@nZU!ksCC?TtV2pQAW?EKm&Fm`yNe93R_c93g+teZgbmfmvsrCu^rof@r@-R zRC3Lt@noi^p#l525tXMS-dT~WhiikVlLf(Y0@jRxP|mVKOPKLgXX8v8iW(XTzt3@e z*q#aXWrH#n-1nu>^ip>`g1W#{<6CJKbUa+?Kg6Iu>43)WBQ~SF4L+If#6u0+m8Dm%Q2Rjs#Bo0v>+xVB+ zVErZgO_?Wz9yW+vy``=L?OTrkzxw>+c*r?`*nZaLslbJ|fI!D$VzUDqE+Cxh*tZ)l zsC)hcexD+=6zqCdW)847txplO@AAP(Y#x|HZx$i9xA1S3n6P!pqxmjx<^6{OEUy(f za?z3*nKyn&4kWO$aUk9Ud;)-&M6>*aURw4T$aFSC(x^|G1ZLMQvRkl$UKT`C!ogat z{j=E2z<`tYZt=+@z`tbI_3uqbBu;-chMFF$h}ExyWn7!Cv9#j&1GcOaQN06aAoF@Z z!1}TdWl5U{(#29u@gBbdZ9CdrqfO=LT-&FsSCXq|)@aw&V8Fo&8c*YR_qd|1RgSrM z;0ZCBWDL9}lfdA>cl&uw`JvKe|5FPXo?$9M#h+LBNs?~2lROnp|JZPZG zQ4q+Kjxr+=EtB%l(hyUWeV7QaAX@cAtw-QLD^L!WDzzNPgIcV__8Fv1i2_LE6l!L% z$=gSc0L^GW`t@fTZARmPLT>gUhwwA|@tG;W%>puD4!_TS9*zUe(3qW`enTyn#{#@q zihR2=r3)vtagf3>s`v%^G6%Wp4c#kS?tTeCE;8CSeSDVr(09zONjC#bndI>Npqdw> z$x|rC$g0XzLl)?{0^Z6uudf#X!q&543zCZO^F08^u)T6y#MWh77a2^`$RDv&F+#Hi z^yLoN{_GF7*~--z!xdgk?{eBx9ItQy{H$+X`p&avHG#^6dr)YmAqBK4{J?+L@<`#h z9fIX`iK}R1OalPI;bT&`T%thKS%vqp1-L(!3;q!6aJpR1nf{` z_P;^D98Q69&Zk62;jai(L6wB$OfmHYg_}Yva;~H`v6yqTH4CRCvm_O)-&0c51@eQ{ z$235hj9z<4G)?m(9ww~TL@mEj;i3(WAxtf5HL%yZ-?F_g@#9ZU2*~fj|20A~JhyYp z4fvgHC;@M%5r;ni_k{<_21Nv+!3cw-0?zL4(cpJA=BB1|?Po}I^#HmkJ?@B_Y9o$n=sZ`5wZi4X9 z)v);_`RQv_4!NPPrT=Vqz%{ZY47(PrwQA2uqgBKWrz7o8C)8SOvA&0aU|3rASXf_% zhsGV!W`6JTa*?%derYy**IE9p$FNd`S1Ao?2unupW`yBr%#iF~D6jD0h{2u_uV)s1 z>&sj%jHI*qXq#bZTfm%JpUh~qJ}UW(3tH%F|x7ykU*+=`Kqo)3}#P(dx`aSw>4HrG+s8(iFsdsl?7usvPaCM>-~-#AUSi{ zhzc_psIGO$ySeG#t(F1Kb~bt+?nX}n8I-DvIIS3~YA!(*zN6R_6l^qZ2Y|5Tt0hIb z?N*PV-Dm~iN-h*p(iXm<*b~eQRYax?;#awT-jRdOS_iJ8?$3KsHvzo>i%ITO{q3+~ z&tn+EBbWes1=$`=amHEw5gFK;6X6t%zX}HBinbz70(uM%Z#kg1@p(aczYNQOzNz+p zC(RKC;LAvGttJSjkU>wN$Hi1|CI|dwk~hP>B!Z?pdltU(|3a|JLciJMZ3$dRr-@n} zbt>RN;kOGfw4KL(%*E6O2#2ND)9NY*W<(9j?x!mj_VN ztw)TW$auwG1P_p9Q7$ukxfN>x6v%!%^6W7Xm@o#M`^h*LKQq`D`V9cE(SQR;$a)Im zAczj;9;{HHE_Z&+0>wR){qnGsa2ZOibSK-3+U^`jd5GXmaDA2+|ElZjEC~&%C}(CC za+CY=O+g=PHK)BV2-5vm55Vz2ZJ^~qLLz{5M>^noktTs2P<*H$unv0Iwo7Tli0ZyU zX5>qrw1l)_9NR@|g80oRmF-@?{-=SuF&aNhP{*N!b*|hbw6+=pv9Yn%x8n_jM2S)h zA_MTw0Qe$g&)w*EQWrg1baf=q!0$j87hN76$^KECn_BkXYMqjmUGUF*2wiDx#bhZv zT`6ffGHxcQEWNhVdcQ*cPeY}P>gy%ohKvBIfM?PLYF0?yoW15h;mlvZmgXj6B}UeL zNvv9f$Gn2_^C*zVQ;W`5n?7e*qo?{?=##=lMoY%mOx%z;ju2(x9@LA`>~H3Cx_&dK zZo#mC-;kS$Z#qfknT}ifhRsB`I?BH8*)VJUB?POHPq1ui;wy*sTfX7>oK58(7Smth z5g^L2v1)z}LTJT{OY6#3862QXGr9X+n4ybn-fUNohfgc%1Tmoa{*IaZeq%*XR(t9) zKM-q}zE)lo4_}Eh1x*3e5|aS7SHA6J^xpT+2snZ&tLq;#F}B{+2lOKH1hg851$$|s z$tpg!I%q7!pGAH6Qf===3iIJ%4mQA*{oBUxmIpAgnnKns4ocSm76Dr=)(a1cbaVh= z+!HT+SU~R?0l+BVupae(waRR-hdp-`b?rC>m!(j;g;_~jMnz#Hd9Y3H>9u~xix!1>?KgC>U;cfe^*31e2MT>{APeIy;5e=H7^ojiU(ulFqxRL;*F zME**e;w0|q?j(>1`rEf5aJ>`B081c}2PCY$c6%(_s3k2Pt^P*cjzzLH-I$6)L%*VP z!r@yqi5NDJ*R~IDPyq-lK=h`)ye~-9z)t+E6BN2WWu51`a-0WwAchVLg*@~=Y~mtn5oMW0X<@?A8>ELS_;PLi*ct6MI-(w3nDFryf-DlB1wv2xxfaw>- z7t&zrSYYg+>dtDG0)f<_Q(9{g{r$_r=u8gEj_|_cmU+&VPdPyrOrSAnxF3$fBq1V6 zOyx&ze=quXcLX^e;uDmu9!Ixfp&Li=-$?#f#bV=CS=1B$(2-BHH!ChN&8$3JMLPJY zg97x_v=XWS7{Ei#z~APaGG_|9sS5xAqpg$+Re`jUMa89 zauN}}lfWN{!f14CR{q40{7#UU!t0v~rFWH49iCFp^UczrD&KV5#&^ZK^_OyqEe$PC zIT7krSs*YOOdStjb0n*OKC}lGkOz%j`3?sv`k~DO|R~swFzy}0N|3~z%fWDA`H-W z*0Owi(oXMEVlXNI%ngT~nOie6>3{;q@9^7JPM9aEn1I=btqbcrT}y{8w09~$j*BkL z5cB$ER2Jmd01vpS(ZvfYe#^mwDN|l)cg{hM1%UuKQny@ca_$>QDTL&F zCV&4g1P6NGOnGtNp#kb62v(2`9w@&Z3ulH&%G6i;py^bdp#331&g^kRO+XHwxBPb0 zNtp@ur+DHd-fAMJjt9EfU25=+gAAzI#CFqT^kFMHO``p;@xR*IG`-6ii)Yl(wcOj@G07 zv--T~ljxFb=>HlC$qM&zG_`cltS*J~Uv>hcTJ(~&d%OFUbyd=*3=UCtKcB=x>$;h{ z6vRw$BkM*j&5g?Y!c2}W*Z*>?o0~0Inv!e3yvO~dRLY%1)xv=n^WkL#yOW9vhBr8F zlC>Dj;s#)2keTFmXu=v&G4v@b&$(G8Y-K@w>9$3Mp%l?l_4M8rk$CFSWD~joS?m)w z6~!t2LE!yTpoNlx+qk8jN(5n(F+2MYmZX;SSC6Cc%>**yN^MjEiBK{84OP?8@oLd{ z^ET)Pl~)s=>GbvOq&U~bI;YM3G*?N>@OP;JT#Zi8Unr7K#PCAI)>EAMJ_ay#2y?^KEj3yD`J?1gH?2O zjXTzHT0^+1MO$kT8SE!!iosc%Re12M^Ji=?w7>2C92Y(pID-x7Z=HCe&NP_jZYTiW zFvKkC`YQi^0tI3rep6;9+YLR~h01zD><7ioLF~MrEz&l{I;6T$LJC$P^D@B6wevKc z;g9@JBd7hPUwTEojZ*u?M!G~qZnpY#o+|b5~!+@i2XB?0aIw+Zori1URLF`pTMN`0o)7|B6 z{ZtJQx)l+*(>xW7&A`UeFj#JT$dko}o;3`3LXDT*mK$JQ7 zA+F=?b#nx(&!qujbWny6*36fNDJ&^^Kgsjgd&@ZFC2pwaF)S$xWJ8!@oIid7CWm@% zjjCFeARIxZ$n9R2n0jx}s!~zM%|e@ryfnU2TUpOTOGrcTls|Adzqj0SoKEd12`%>h z#p>suD)At~W@PzhWKxVUXLq{Eo&P@=52@>q4$%M37)8kw=t{2%r_!GK*6zBxnx^jd zb{?`s#ZJ)=ru44Tz~-N27vd1?6h{>%o0oY_=Z7&58H}u~V7IQB>b{QjthaK}FZ2dim4LYN{fy@8IZvM%qek1i8LcKpRL=-%F zJztWHO%VVBr^I^!`1e5`gKD5DR`Yt`aFDsDT?-OsZ1-jWVc78R<&$`#b3Y4jot zO4FXQnpN7Ic9IY~ZcSP^u!v9?wgVp$e5a9ttQ-o^ps}tk<=!-rGoU*3H#MSWPYlXV z_w{4)0uBu<)W~mb^|`+$pCtb37PIyU)t_z=JOQ_^ZyYmBC%N0n1sz2_Cop@E(s#a| ziv!OPuUQHpKin;#y1q5U5*Ml_mNhCww+@N|m*DR^2(NeF@AcMCfZuMA zZ!64zyxX#xvB7KhAxbuVM%fv_RJ?aXSl^GCqQ!v)dk%RC*(nU0w;mQ-FSs+XSG7n~ zG@pc={VaJz#BzE)l>ymsSG=py!93h?nxa$?SliIHY9=j!>cloIMDAQhc3GbzV0;8h1M0@@aIJU z%ho8*8(Upqt#PaW!u;rQ*t9hkbRnN$$<*!HBdGMa#%=w$AmG3oXvItgOuNDb#H(s7 z7;xmgLi%vgEtZFMI_z5^IiNlOo{;UsnKf z7484*;dQ%_{ieb1w>_zJ0p5kO0jnbijtbX**gii0?#(cMwf-LpJ>PqSISIWF`yhp5 z7>uz_ky2u}PNH~g`V@^&sC0FAc1FM5oWA@RMT0G7T(Abp#&lTln)pko`47G<^$6u4 zHv@)MvGt#GjE0vrhn0QLSumG1_}jST7QtYoPwhkb_>;bUJYCHzyC}vYDGj}!*SU_Q zz9VW&_H;4CghElwXUi%)8y&l+_OyRksFgW-f1G5faD+{e;_!e%C0K~Op02$kiFa!!zcrR2b(rw$xgp>d7HpWj$V-Km!%C;qi%w4hwf~x-W&IYB zJgsXWx4!~GapoUR3=?*sNO>RqgCDvNZWA&{!h?R25N*uSujcl^gvuvUmSbCA>;HKq zwJax=!7DMS16n2hZZvR30zodVU3+yf0TGC&XLkjm46smz*|+M0r5U)Z_5^5EU;%Xe zi=tCCvfQ?j7P_0g%l}#2NDr{_-+V=H^%nWUeB=vcWA#)1R{p{wuykAJDXvK^GbTj? zTSQ(f_g?o83?q*vLAe1dTZaeT8NL7T0p^F}0?c2MedV$EN*VMYW1QXq{DCe$;eq4l zR=}*gLc>9QgTPmuKX(E6FrHo{aR`;AEVH*iH4NJ;lv~vYP?{KMu$Vjyl5pi@_T@-v zKktzQqQ=N)b+2+10hR=d@?YNLAl-*cMYMRo$mN@ctI%*wB1F-Y_??Ww9`4Makg+5K*U%XW~g1Kw$RC2#}5AEP~?}hHZl^Da#3l8`z zO~bYLCXf`?o+BB*pVfI8B#WF{vwR{J2Pxy&IsLytvgx-YYS#z zei2-mI8L96xpM$ELMvXrQKi<#O{)4ePzOwqNpD1h*M|6nL_bkgvGK2eg^O+?zcU`V zdj_55gd=0kX{f0Us&+HFHewQVtJwZyanTIr1JH5wcMq65J;-Neeor4a)YQ3GHlSaw zl?^p7%g{B>rlMXWQhvJP1Dmq^YVZuD*II%)zcq0)C zK2j$^oWc|hMo{KK$iE+bIj$e zeQxdzbmX$Gx|+t8_4s+mh0q}uc0!nvB z_XuW-Ky45#LKRmK32Wbp1_Az4x!fa5_oE^JP460ii%>?QFpz)VDLKuUTW=kp2ZBX< zC@M~N^q9&!M8>HY5TR!@h_nKrFxRwE7mv4|BH{b5zq+0VtjE?_Wt|O*MtbAp<9Z-8q#F zg9A+Y94qBJZJawS(}wAbn-_-L$a@i5w>XhZ8#gi)O1GA)W;x&;LpECOe4ZoKl}H%g34k0cuZCP% zA`wCli{H0cNN*C2vR&?17NG~YSBe)9n`TWgQPGs z&0FQ3-kdZ5qI^bADh3q8h=l$2CwB@~SV7ed>SQrg7pac<4rQhpXBXVN<#UNlMh+26zqgVvi+k_JndWxS3Mcu-~L$^-NS~o zP2xU!re&ngEsL^kM@%`j+D!QijgIi*@8RTLqob)n4*u-IJL4 z2WQF$8Rqi(-auz$d`Z>%dUgXKN5iO#kFkQ`;bj%7Jc6j*jM;jN&hVd~8t$(klGT4l z2N@;JYdB`=Em}JCd6`!rtJyUTVGBVBqu@I+7YB#(WhYGr1vy#yajfwsmRg(h{Kr?Y)wf(e5Mm z)Lxu@3vx4^o6g}wOyun*V)jU3ABXZ!cD{N-+=}nw>(zFl;i`Q7GhN1CS3xc5kiQC7 zyIvwmB9HJqpV?GDy7W{SPkEvjumAE@w0Tc9xYsUU?Al~Oz9@lUT7zTSuFsR*TE{QKVt zTmyDOrP=gAu(q|rqIq?qAa(+S^jG@>PPi*&x-oRCIiT|K=9w~V)mNz1{8H$Mr*ukpqll!W)G*}G0|+y83@RWX z4BaK&J#>8B_ul9E&X4ow{5!SxUTf{O2HT4|Z*&e-QZymY|X-*;z zW*>*{`TI9JrWSeHch{f!O>%IMp3ke`g83r~aVb&uMs?jMn9=pnD=8Ub`P0thyS|L| zcp{`97nWtFZZ-K8Su&$TfmWMNPe-MZ;`P3fmmcLE+U0-#5pl65?}!Yxo=|y@#`lYX zlYCi8b>r2KMnsm{kJ2og!HTMOj;^|Od}4H~fnL_rt)|-4NfVA{ESj~26xm1mf$p{I z16Iz;;e{7%?>M8g@`Z76zI|K>lh5G|JEWI+7aDZZ6Zv3wAWWMv9OpJ$XZ1ofa#>v^ z;74ATHZ|#YG|O~`-(UH=%>*fD%IQ=T1mBTM-_!Gk-VPtPZKPD~&cMz~^*rZS~=TD|()GHNJm; z0VT=!F)r_5oKVAKnZ<>vBc#dwwKBSqSPTQjJI<^JM zJkNW^KNbr`PP*!NK2T?>8Z{mCk}0hwp(dPQ8!q&D*3;xo;=w3G7uXi+IwLJDzx#*aKQS6fc3 zux|%0f-7^a=V%O;d31m}QZCde-=puEKF7N*E;OkL{=S^8T7-6(F38V!X~Qg)l?ML8 zn(KNX{8y8}=ezT3Bfu4jO~88Zk0X7MZCokwTsd$=rn4F)sG|mPL9Ktj-9~!V~nDv?q$~7JGm6d?!I?|)!*{M{zWGpdc z1!8D!h)M}L4h5rsskfPE6~8%p<9+I^YBof#T1QHUv$aPwcr4q(g3jJ+N1kjGr}P{( zn{#z_RTKvI&+^J5{g9q3mN?0X=k#JXpl|wtk&F7T zIrg({(0L4;cYxte$+PS);;pK_ldED>`FXczb^W<>k|2#ee(+&BX7nVtYCabT z1Zq?+qby*f@Jcu(jyNmLlnWn=DvRbzb{@chn4ZJhEz#TU#ZY7Vwgx_&Ddid33UUPZ zAo6qAILobO$BY+#QAM&p-sF!6R0zLsEWOy^+Q*E1|X!8+3xD4(-B_D^igqOi9GiNkZJ0n(0@6LetBu%yWFJZ`Wt!A+B-f zvP(l->W=gK)3B*u9j=vA!Lq9w@1~8H=ADuL3WsFK=bVgmxA~pzchJvS=eVHq>p?cm zf|H96qGA?^zvCSPB`IH(X4Qu+h!uA2hr*~b7G)R_RZOyP-hNTGoO(v`3R^YN_Fnz< z5slzv2U7I#FrfGkkYA9yXZd4&cFFLij~nlMRx+8B9P5Mk5ep+Heos>45v|xZ{tP0{ z<~6YbCIb6h3i>8f+JrW4ofpN1OV1ldSAB4GGn=JYW?TqM{hK4f{+wFaX4s>}(CH!d z$H#lTZ?rjD#2}hBzB$O=Z+oARVawT;WYx?}J&8)xLP>6?EHHJ(-F(a)fO&oVVzBbm z7tdBL9{P#`TpKzxSvVaPLeleZIWpkrTenD~{cYZs8$5jF-{SEqbi)hb?-?>{qKV+P z;uU@|iw+)oSxpc7<^8(bqXHg!#&z88HZrI!RulP4b$V~UPo2EygY$R-X-$_!-4U8w zmZn#U)UOyGSCCMQPhC?wuQRx*7R_sv(ylSkjEilZ2#o1a$P^Lfi$4?79 zxxgOVWJJw0f8ISaBR+1TYIndafXym!J@WnL8&9-M^_j8aNLw>U#@RC2Boh0A}yIw2Y``eyiYhof@3Z3w`rrce^CF zV5*=|^`7ejcn<;*d2{7n*hI)rSEr_&t}BYluve;Pj-8erQb33V7dcY)Z^!zLFeE&@Tzao%9@?MGnbXU1x1ECrvHXrKF(%`7z6TF zUIQ-Tcq7(&JRind=+F*_?cmtIQN5I%Q1wW@{e6(*n0z1ou-5q6|5IiNay*uh(2TVh z@>hD5UY|CaB1yYmhitGezd&v$$y$zXB?(M;IW0Y>OCoBf%UV)-e6kiP`*~9Rd9yHJ ziV6RH`rJjQ)~cs%Sm)odUxBQ;%q~XPHRzjB%#%%EWBgn9umQ}d^P|ve&xni7W?I;S z<0GwS_~Kl4B-UGNL(yPMPyIgFR*Q#b#N~3&!!Kj}B+fP3+3@oOw`)i?5Q(OOE#kRM ztqAQEbSJ;JJP3CGaWT-z{B{Nvpw3U%z5#S(Uy=SnMv+eYIa~7af#9b3?T?M7ri{2K zpsn_|JzX#rpV*38rq47xbyr+9=7q}%?DT_;E33z%k0ye7@K=;JR0n?li7+)%wmbNi zJJ=HK@<+{qd0_e#>HHEWJ2-b(b*H{?|l@mPX9oPFXVZ8JHXI&H>4vb_lUt$+f9gHk z6#>wAcW~G8M9BcRzOYb%6z{Vp3JT;OEsvUMZ}Md``b}O79dgyI zAh97adO!Jl;kP4ax+%tKQ}%P=AMAC0@#1d+QI=yyr}@e@cCzT=YM&zSRjF@!kB$}& zFT-NX*qqF%)?|rw7sRu@QEfn=;@yn1PEZRKkt z!Z#0~oeS{Pg`=prwt23aN&$~edR+01vgu`&7&e-(Of(|4*P=bcu!9zwtRpwAWuAI_ zLhw!j$!tq4*DI@H4x~EVM;(ui`PIc3R?>gAdxC%clUf|0Yk;X+BL+4KA3I*sl%sbn zAzE8*P({?VGgN~mag?xK7X{BQQz=neR5RKUGul@^S3cO19ts;=8LM}P*>GgNLLZR! zH|*5?vk-~5QU;jHSfm`)Axs6-T^6-&Jw4~turC|e^z)~a4lPUf-FIEEuBWV4Cb^GP z@4w@RYVDkN!Mdwly(?utwnRgk-)SLQsCG~XRv-WT8A8=>^0ygN?%6IaPNt)yq>^|i zEiF90IC8jS?EiWZa;iyHDaFN6b4K$U~ysx?x0OHrQYdk z!hGwYdZTTQHCgbj1#bX6j!5DlT~yOYpG?9=;B*9ylSQ@Yv=aL>I-k?f@ zA=flLQG~|D^LHz6#4%?WI%$CI(nY%YP&tj|+s2&mTP*qfL6$*t!`(oWfIU%Vsj|>*Hl4??V+(f^S4g6nU+c|EfWEyPr^M z%2C10z3VWF4WD5DwYfMZv$&8N3dvfBR(8s$%Wlv{pEu4XcALCd)g_B8xN==j>!*Cc z!Z%6+Sdc9*DGGv{lp*rk_|ulgbZEBKwRRK|IYRP=-Qdwch=5);np>S?{U+Dy)@A*eDjp@&Az_*>&4U6QOKqna(BHZ$mq$e1;F z=H>F`6b@3|#H3x4h>%bXRLet9RFGsKp1zEDlDL?j?EdZmufnfdPc~lp&~97kfQd}0 zLPXS8c_b_$iztI(p(&bJaelz>v&6K^tAhK@*`q#F6E)XnDcA)R>fz1LKtblG*lMA= z@Y*Kki(BGaMZ3bowc+}x=Xv{El-+kc6^@MQSEtxgvilaS!g+>BjVWu2A_Z(S>^4T4 z6=LPoxHinQ&vOI95E#xiqCU^-c;|15Ay7RdWC5jn+?ZNwha)bf3(fhstvLX$JMI&aNq*_(jpY{#R#pjmcTpJf>$(o<>4nz- zK%RhMbtsnwcbS3R8`oBd@>OK5uHD-+RD9YM>t&-HG_0+EOuwA2h8WlMUo;(aE4hI^ zkJnKldik}NJ&*r5)_SS+>@dLUNZ=HrSu`4}?Y1;X=lyYD`H2c_z$#MHezH1J@-+Gz z_s8r}*XbHr=HhDYhvj_uFovQCYlW+-OE$iZBYo}O_CkgeYasFgms3|jD`Lz5Ei5$B zI!}9%3`XMH*Xy&gjdb@31ln9PKne4>i=o%#4eT0f7#Nu0 zU~_aC!)nRS_qBMx*YX85mG6}cL^1{k+u{3_4w$3RL-RWGWuEW z?jDnXd-Uw$r!>0JNS`-K2|9TD^OU~4juuDn#JJZZ_ew2xsjI_zRL1Y?_r#bunTg3p zzTIC*&_a%?{b9haz|b}e{TM+_B#^1NI2BYvF(tk#S2P}qEP5@*0?%f5MFRG?hct!{ z<8DZ5$u^bl<-T72IudZ-EFgSI3Q0DXjV)b|XG{+P=M5u&a=FZcRB?*QP6)~@h3<|O zM`)vNVA4G_C0ZF8Pez^i2q?j!i?Yz%&92MbodOJvZ?*IOW!?wPQnH6!MFnaRy*c)_ zMe)Ag>jU1%eE;%{sd8w-@bK-9>2= z_<=;`hi)SH!pEUwP5RLv%~khrfv#rS8Sk;pa700n_uI0a4HBlAKJ(__WM4)t$#3w; zheG_51uLUVZcD^a-~%r_d#=fw$nw76q~LL?0v88IP>NhJVD*^Rg~W3KQspw)Od3x- zzT}JeR{wA;!W+IC7b9;K9FfjU!895Itb#ITKAnm5n4M2euRf3dNe5+jUV>gy*jtuE zhE*#7!U6)J$4YSZ34{A?B5tfPT`qYSBFwM;W*juWjm34PwZ}9={z=i$Q43N?V((W{ zH1|A?uO%1CGcdfYSk z1@Fv~h!*$cf!Gi-R-2v}s_dU|!7#9X&%H`^#6OuQ(x4S=D`EZo%qgV6W&fQ6tLN$$ zun2E1Y-w{@ScjQxy6Y$D7(h#HjPCFDHkrnpv$rBkE@zj%agu~oM!Pk3Dp0LEM+XWt$ zb>9%k#(UOsAZp!Lf4+dB;@eXLyw=ZN+z?5B7(`d;4 zN>^yS0vLx+n)3NJlt*)tgo1{KhLUo=*@L>lc4Q%-#@lAqs;ItRvVFhRSo(w#=C8sU z^=aV}o$CGm>$%#}sYFbs0(k!GB8N^vuXt`0p2D!L1Y?MKT=cBe^F4ETl_3&Bb+Tze z9VJShyDC(*j-wn6vLJ4pRAz_*Nr@3$V#P-h7{KSLdmDN!B8>qET?+p9ON3{92PME& za*y(EfA*Ph*V=zWUHEBuiK#$Pvyus!XxVI02CdWPf@tmMd093PG1e|;Q@iZ5rT3$U zzVZ?wvY=Xj6_uvP*SLQ9?ddV@W%sJTUv5LG-Nb?)jYiC8cfs5<^zmZl6~t`3tL4Q$ zsqltI$I^eOyF1yX4vTWGZv`(exghbBNhcS7}J`0*CFXwM6~qV_F!*z=OQ<35$NEa0~0RK@} zk95Ju$CmC53G0V%>Jd9c`iJ2*2j6SDFX?B{wY%0jYn~1+@GTG-ngbr)$6xZ5jq9Zk z08R3s$QxLA;8O5_dc-v@6W46n`p3IHZHo>ue`h$jWhLZZQ>4IWp{k+~k*OVdPRvv@ z)4BiRPH^-M?CN@M0 zUjbega_R3^Po95f_h5BiIn>WzK3(@5kDQ=siJv{Rbng){qtLB{ez~+HFM=dm> z4fvu#Uh_vStL-6(eW;r-5|>f!T$`^G0oB@Q$H&mg{1v}@+7=}BY@V*$a_V<7<@d*( zh$I2tpwp|xsHdz0vU?LUT4Xe-gfoxsd3INm$xqoy?n?UlIXyX#3zN zqjz@fs5Ob6UH8@bC6m190Ua;AE!p!aW^$T8i_P4!@i#=fAsdRs5WG((DK2XM9?GFj z;`ANmWz(Y2>a;KSr{EYxPYJJ?|7cY``f;a!rcWnSZREhG&5t&S z$!t1nXHRh#A+My@#Q)w4U{HaT=i%`c(KRxWi1ps&gP8)1hfUwYXY1z!?b6mNKa^Ti z{;)xEnXArWPvr7nKiB#L-O+6%zsp+~1{4FckoxyZp?I3-cn1p@=dh#J&4u-quly@qYN--I zZvK+!w3MDz6TU{|v$`yGWExct37FC&y@P3GTxlws$4J4@ok-xVd;L-f@uK##$p4OT zJ>d@+VMss?ZbBWiL6r1CiwxKcVR!Jm-9T)XALgH{Qv|%A{bfc7euo!HR8gHw>XJud zH<8AdV!#QW`Z{6jVG~nwo>=AVmZevqv31sd?-vpy5$OV*V7JYt*n(yVs(Jk4SWY_W zM9e(dKCRpbt_C5Xpy(%T;PsOK!Ho6Aq+4P5S)a>7ou;;?rWW8HQgMZk$LazIadaM^ z=wtd7dUe#XQzrp@I&`wS_;iAgd#NTr@9!L_KcXInEfByzni&r)h||*sjW5*pa>^T5Ivl zs0_F`bjjGFDU8-DQUD_)F)RH9)yz~;Y%leM)+`hK+=@Vjwsobo87E}#~ zv!Snt=y?)Jf+cSUthiJKpGn)>8 z=98}nwLcT_yrb|MJzWzk%`Y7kZz$7NNp_r=#SQ{$frrJz?mWULz9SP~B8fmaTarbd zPs{qE!1QWk!=du9tIhQ`#{>NE)5olCQ1Of`z&-SyI&c{yIjmQ5Kg777`St!Ka5jMDZd)ySbkH*gZc8|Jw6C0^5?rnLJ;<4#dj zU)Dl)i1_GxwR|+-{&C5hxE%K{`}Y+@M|h1&;Q}$T6Z-JbxNp8UZEC>3>b`;5MM4`e z$wTKj6+0pqCgb(*9C=#y8jy!Dzy4+0J=aqL0_D20QMf&}DaPP&fPOs> zs^My3uPH(Z9h6GJKBEgp)dtJ@Ea24Sd~I5(tIMaf@!_6_*e_57^Xt%1<2s4$f0!+z z6~cvHL!>XOr3xK*k{h?Yr=ghcJbzT*1Tf-FYlVR`NH*fS6cWvh0Pm}u*j*Mi*#IHC zf96_xo}lc=q;m!!Er8*xbRka8tTlu33*MNayBsC1o!|Q^5|P|x9}`70g-ty_>AhOF z1&sjwo&m)Ata?>?4e{!L<5$xDG_)j~)YPB?QSf_JVEEm3Rw4$bLd=vfKtNfnRylWS zEgh7#rbI4%G(_zwVd2(nFv>~q9j$(Z;%$P=(sQ}sNHZ{>yc@hyZCKNNCR2#a6Eu_f zQVTPCpFY@3S7$i^f+spw!#Pd|JR|O}yYIu{#xU9ztLyfb&g%zkII417c0tIUsoB^I{-#6wlDMkpF)<%WT}ET1 z(2xg5VtBAyhF_rVDl-`tOWvHRm!*b2X4dnfJ5^6ddldt_iJqY)Du9k-N}nRzyyR5g zo^N%(_zo5I^gJhfhS^C}Bfk{Nh8gMWHaN!1k>2|Fy`>X{Ty~;6)v^o+5Ak?UP)8~Q ze+MhO%1%&V4?77xrkLpKl1l1Er7?4}z(vE+8xZFzT3l^My@EO}&qnsX9WT)QOP^}{ z23U!*Mv@YX2E5&kd^25ffjRwJnImqJ0`e+dx!CEGEH}?JgGaWSkfU${alR-@3ej&; zQ7+*hR1m_0MG65YUPdH5{y?oHU*!XU)+2M8pQMoxx2nRwPd=QktUsI+TWecW z*`+)i7QIn06l;=}j~i=b(O5Xqb!`g_+vN32GtC1R;$f$eYc@;YBPg|&r1$t8;%?h~VIffu z*$GR@vikC^wH4y=&&6WDajfm(Z8{uETf$8CZa+yuF!zD;&rdAaxX_3@U9D&=nZ>po z*J#4K3+{yy9a{;YZ9=I9gE&#mj6<;)`<7SkuD;{_48OmEJltAB+~5k&f`29%r8RC)Zcz4BI4sbn)+}7 zGwOIIkd$tJNvfb?t?tl=T3_JzDOZn7y_pgS8GvP+B6-KXI`b`%c<$AZy-#Wz;)Xyy*>|2c)U4$@@FXS0vy#Ey55C@Q?C&CoRS=HvN;U zC{xsFkR~sSs3xt-QQC5dwOmf_|nSMD;?vv>!K% z8|a-!KaSwmv$uuAqH~wdhK=39Qm<+oG3%=6B9GhY)?mkRqY;l__3xX=Wm1=IgWnO+ zMAHM>muW$-{_F{Qi15W8Qu_B3!%>a);)i)DKlV|z))+2Gh)Gy|qoc`35BO%B|724h zo5!r$>nSteWk2zbZ)<{=&UcMv#{)c}auJX?h6jj3c%{Z#PbixLQLeYiM({KM`tkTYxo9ZLnC9>VVr;ZY zXbU(}n?wnzBwXfjiJ~un-^0@2Bl7K0=<^5HebbeQwd@|umgpxicl5!JMRpsp1TJv)zxNnAD|L|6GcXW(Gf#jdKlF9L|p-5O%_kv>d zl({@~wK6}tDsq&1Yk|xN;)t2no!SAyq@@zIc~ewi##+N%!|XCDNpz#qOhPpLtbL8X z0b4~5fU*N&n-)nx^nR6Y5mcE2qBj$*r?nx@-D&1R^AafFlqE$iC6}p>kwGZ8{rCm> zw<9R^?YAFaQ17obHMB?*rA8e}dx~PoS#(}q?r$Y>BJ(6PjJhWK=r@gE($5i+efhT9 zsavAx7DoYAG^Hls-8-4*H&VFA>ylN+LOyug!z>BU?-|*CQIPU?0V6#$wrlO7GnDhJ z7n#HFMZZPs4Vm4uD~-4P9b=J3Q?@Nyejinf+AEe%TXGSVT8}0@=BLG#1&@OvHfChP z80K>^_`&5O>bZq$zPl z?a#GBYGQvfFdUkThiLfPl6`e6&R$$uyuWO1!#4R@91vV2>4uy?Tj$g;L&U(oCx5cu z+DyAkX|-%b46elF8#E~nH0)i*-wjgf-DFYsgt*4Ln&Jxjt!}V^Hb;=m0OV!LEcX3N z{i2{K%gJrr)df%AE|@`$U*E+0t#5hLbH2)={F5CbsXg!4J`Dg?t#)|8SGrV6Dvw@rkf1(Q4Sqp_^qamO zi&N{h>>latbt2TN9?G=>{r28DGs^A*>Vxsl4w=p>>zTeo(ZVGJV2JQ2=Z_KsML{*i zdHI>E{jU-;J-)%{A=2x{j5oBz4WoJ2CfU6NGP;=U~0Zm%230nth#+))(MX|B-Q{)1Bz>~kGwP4g0Pht2CMJqG7VY1?`h zBj)n1Yg(y?VqEVY?WpX%?&ma@4-h_k6inISFt!&<9PfsXKLGQa-^K-^c8P)1q{>av zl@%p5DKKR9(_>%DnriI$m-to=7$B*A*a7n^w-Gq=nBQj^O9zHApq=vuE&o6*Egwgs zg2n^RENd`6_YZ4@ItJjp3M;ty+q^7;vEPw$aFXmwe2*j`JZIM4-RjBPaNkRROc~}X z>MaySwLryVC{d4kb(MrievF0r9Tk!L$#~8w-_m**;f`UZKDyfTc;5BN3AwM8ud-#9 z8l8a?5OmXhKk>k7rzv`wIIXy!8%cIl z)#+=|V=alIEy0Bwo|sy0C8rv^=o|?rg?@aLuYDBYRL63B2YvlvL9_5xe5WDp0A53X z;y*%p0j888(F}S&(j@$`mfrU6HxJ4XAu)A)dtVw*IfW53J$*X2@DBwRO+UjL2zB-0 zTP)V9Y%Qj*LPQA%F3w-lyCtrYh(ynKTSUAC3$Y?uBCM_;o&%g1zd59`k;yWZr@ILs zIK0#!4=+;8p(mq@$Q(}?pDF+Q*WX=t+91EPV=`T=RM=y?*(h)szTCnheMxYk(yqam zY`lieT>_Ugblqvt$2mzw#1@}c{Ab^qcRKg&lL~mRhxUu_1Q%PMP3FFKB4DXfkN#VX zC07jaRqJC<#LlAFaCfyR`K`KAti!=G#WO?UBvoSv-p>tVHKN`U|ALwe*#_VvX<@Hl z(r{URKp!`IookuiG}@xZAw!5lsB0^LOUSaoGN+?n-o|L6T|=VyK8sPw9F)XfAjO-O4OP(D_2vBQS|Y2iP}tf_uS2H#)Z<0RU4xvRD_bfG1hW)iRO2bF zTL46bBh_l>!y<3^88&t-peb!F6E`V74kK=g={|?e_%S5tB7YT7wI{KYsW&ek(i~BE ztK|%y6db9PR!zT&5T!3qlx#*8yuY)U4Z$>XbCb9P!g!k(1b`f<{fSBjc}Nr+#p$;T zKPPO%EIv@dgs7T`r69;hf(sbJNbXa>3M38?V3r?GUoF`8FX$F`U2CId!iJvWY#ul=qU4~#r^pF~^T9rHx(sv$8v%2E@UbM_9c_OTV_vYGU> z7v&>1ys6rV;-8HlEHTRO!bRq5d1+DnoKwoq&et)DYMCtg=DF86g8$iYLy-w~X}=Zj zGTwZx6!uNnr9wFRopU-H!n7b+L%e9B2`hXi1}xb>Q*&Y z2DA4DwYKKqc_2iP(rdnDpCkOlQtJ`rE|C*&DqN1ldwjy3CYDt)Nushoxy(t1y(E%G z=c)ad4KGPteFyxC@>z6ClF%Vb=`x0|?iXz#+cT11o}VwX%T!*@>wc$d3H(`BM>8Xr z0s-Zkq%59wMA&Ec+UD{H9#ZNy?O9lLC`XpQE z*<$3eW7KpoMA$xO_;Yup;EV#6l8Yy;BvjB&_|zbxi~nY@7lN!@g49&jqz*6nLe+vXw+T^ zQ_`Wf+t-6(?czS=AEWzI-ex|IpQ2486UMQN@S<|QJDJYPBK_SKw(F)ln)h8)YL@bt zqy+pEVh8oOkKW??PM)A#_1oCne(<)RKw{_f*q%z2Qq_yt?@H<m*VC-Yo@BJul53N6MQE_gofLUY%#y;ejOWmd*nf zPeF~e4tiA|yp@PFK`w@$h${J;m{=9ZnVUc!^}XfzB!Yn(*#o|{o?@X@awY{yw97~N zV3zvO+87)KQ6%`FP;>+mJ5a)4a8KJL5W>5;OhEWcqNciucAyoYsMJ1ddx{r2BQc0R zpAi@AljwZyXYp;a(`mn0hz^)%Qseyk(@#whuSv&JP0D4NL*jFGhz?6W!Sj7ea*y>EdN+UBKfh!Sz=PMlh9yLDqCk&l`O&aE} zFpfuIGyVNt$>(EAxzE&~+vt+9SG?YWgZgcW5>1Ix?M$9~{%AsjZ5{8GuH26UK+68* zKmxH_K~s^S7GM;R1t42~L&hzcTss02%Ty+at88mE8#l!yo#nq_JW$iQ_{FX!32PI3 zMs-u<0vN4xu!7poPdmq9)ARAV3ALk0vfadERgLuwyKhga#d%NZebJs@ zr`##-WX#iDBgsjJz6(VXh~!v#XffDm(z|-Ul zEGVeQD8_3fHpbz;F%`Wg#aD15IG^9b^-pnRC`|s~xN(5YL`A`HU8cYG5=u-W*$YRE z`~ET)^-;dSP9G7EJN@$$(Z-QaJw%Xmaxtb7SS93KkjpK3r=x_WBidd+8nq=pN&I&t zE7$^FHz@qtCkiWC@{QciPgJa)KU@D%y#1&BtpCKOiUd%A5EG8P1V5o*^mSJ7&bR+C z+J-%S^6prkX&c&|2m{rI^JWio;Om&V5wbC|?vSqQsyNm4s# zshp1&@=7L;eo=F(79X8&dyxAl8D~hF5~R%jj*{Q0_}5vd(%BN;4h^cHFXQ)%@!Eqa zDnjPFCx4FNr0BbTWNVq|P7q~48D44A_t)GFuq8jO z5A=WxbWI!@%L_7~{VtvF)BG0wbpMMzuemNw$CPNCb1W%|8k>AVBct*`bXsxN%SNn4 z*IOT#a={fF{OAs(pKcG&w&ItneCkHUkpvS6p zTVVMVpC_F)DI0-OlS((xrPprh-R4Xq94BKzKSuP_34t zZv)lYRCe*Xum6<%*+OxhIX>g}r<778t>~;;U%3)USIE)XFD3==ydvEaG?#&R;w(e4 zh$FJ7|B==I8L1;KZl+1t#Fvxp<-in98SE*Y46_oVCbb4h^*ZbKH#Y?!ubp?}w5802 z!)_pP45NZAAB6pny^J@Lv*f)F66q<4ISQG|E-ZN7W{Q~t_EcfJvBghz;*=4{e_gH~ z{(6vMT&D|hvDY(g!N;p(|7>v4mAnTu0r{!Pldnh;r{{C$bF0r|%E=8E(-Sn$c8GJ@ zP=1aJgf>(QZ3F|IP-KYD$CPgua?n7T6XHyzyJFB_ zP*U@{BqGQE(RzEgpxYAUR{_=!bmmiYapI=+Nj7VZSdGu$kuj5vd2Yi5oUG}WNc5v< z3$m(Q3mXgMIPpozq1(_6A*b&R?VKxYS?$=)x+@A8Zsl5Nvk+xB+X2yf*3O?d>Mxy~ z+!6WJDgBM#(ds1f zgF=I^mg2V3-G(S$48y(c6)Bl$tW;fcs{l%FH0-p70~7YP0F4MKlI^H>??}gh_e5WXKTS3*1et z?2?$+7=ihLA2^oUT?y6Sya>arg{7T|AoI_+9@I+1G0`*jDcRpYlPET2-#DyIPzx& zMJ}asrcz7BoF^;oP!}4^=yBkL*{ywq#C)Me1w*zC^$#-UOZ`%Am)?ffmglKybrizo zy_BuW@f^K%zyvKVH3(||-Ov;b?4`ABj1Z7d-+vf^FZDF~`^OTqX!-3c{vAIu{H{!q z>F=C{p1sboMS}MiAn;=pCw^xkKtigKGvjdA?@UcORRwacNZ`$G*O%~hrkwbkfzcMC z{ChoN{|~i8 zrYKm$gr{CQ;BjJ$Yq6wOGfVINHqBuP^GdMu+qbwT<0Yvn7sflSMl#Xdv+({nnTLPs zJZ&$Wj*Yav_KP}RB00J0r-A4bqExZnR3e z%@=~2QgAn@nQXDn`*i!Qp{)7uvr7?h5znR9mk5##@8v@D5C~->*9dJ)KNtKB zKeS7B*(lm*@Jfi=Yi43CmfZU07T+2Ra<%l2RC5A|VRVhhUchXK{?>d7n+Hm0<6-c2 zOBH)Q%N1rbM-&Pyh$aqkK)k| zoQ1{g2U`g@MZbITMsf;-wc81QTyFRO=k7QuxY}HnX$EoDE&mM-ovr)!aDx9hnrQt> zl&}B(s^^iqft_&Ts<|J{%QO5W$xZM9EhiyAo0;Jl%-hWo_%T3qT;e4M?cF`x8aKZV~ z67T(S_YW%1~S968o^cko-&G*PzC}skX}xtUr=1+s{|j;97}=GB+J8 zRZ?Y+1Av@EF~pfA0cKW%%eZC=k`??x1j#UvmyMPalk;PX;*0UGnhFK`78mAVeUD|1tkBTfcQQ!iokCJianh_brEWWm7B`We#|`k;9jU5;+%e*b zM(~R4^%k~TF+>#8R*5QNMZK$YbSWFEr==$kB8-~>in7^e4VDFEjx%Z*%)F`9$w3D% zuB+;ahHpGBUR$*|s8kn@NvnMr{QRdl z{2g_vs%hsNO@gSqyStfMQ&eVEM#fw`ZL$W(5&$;1d)wnvZWAWZx=nl1&nmD`#rzYx z9Kp*+;lPvKG~*~U;!}LPWn%ZY6H7;l{O>7N5nbXwea;{)3WmR@K-%9UQErLVw1Yi# zMuj}BzK^foyVo4Xk4P}MWTq!%qv?lRA;0o*{mvYRDY!8;9GA?D?yjNVwo-!sJDFJq zQa$}OI%W`6RZm0;UG_m-xJpYTS}JgLV~c%D$ZI{9c;wGsEw!U#+Ro%^2Bs?_-U8t3 zf_++x2#;jPi&nP1xNWG&!4EN)C4naCvU)}p*?=`O$%s`=gx$4M~| z?x05$N!mC;RSuXta3y(n7XBYkXBib$*mwOiv^1iCv~+j3fOH5*r*ukp4I(Iwgh-ck zcMgmoAl)59ch}IobKlSNJ|AbTbJjW^=3LkR>}&7e=BE%gYwk<(LxK+af_2Xy#uhuh zNfo~SC~)}PdKK>YGt)i6BbwxadiS@N#!LAhXJYAvfYP*+h=c?#HXa_8m<#oN<`(*& zfKQC7lY0h%er}kjNotd7%iS04C~q*apmtm4%k-%wU4=2-PLsv_gsT`85gyjV3Ex6; ziVP^fUyIi=-uq3>1wAaN#?*tNiQybd+C2WF3Kke#18sq&Cq9&Djd2t##GItZ?4VJf z-j+eXWux2eV(^Eb%`0w$><>dGx0UZ*{?|3cEJlE;fKPCMQt?sVanWkf4(n=)7s-$D zJe(Ta;-FmUrTl8W1~th$S-UXlC|;#6Q1=D(cg&$tk+~Yb)fQjT|8l(2Pa@cfA9^uM zBj<849rP}QU}sFO`UQr8%XgypzjCG=@(6{Vhg*8G)NVGHt_yrlw!nYKzO!YHq zA7x*4jJv*6CZhUXA|SVYXIkg?WkN)i9k*hK>AgNSXI_JvMu}>@bhVO$EIC^BcaL8( znOq;EvUCsotSmNrO6u&=M2f`K?Lupra7f3$*No^V4J&9XMab#1t69~`(O_b$MGO{` zsEKHU4@oXmv6X-`X?A*8A|KH+H;n=Y#ak_c*L{uijyqjaWaFvCZt{#uwKJ>buRKwe&vx6$TJDA0PbU8N98~6=`~)urCf98@qUyD_)R&S=RSaD!$oQ38y4@nSb#o z+cByitD$a{J_tMZ5}8$plhj1w11Tkv{T}jdR_@QSV@Kk4VRQg=p+HO=q7K)6ZVInfr5KK_duM8*npdT;rZbr@;o`QNX@vuAX%Tx?qe2Tz`U zQ<(HpazMvUEqf*6CanD$vT*Zp1<&Y}L;ghp7Zwmuz{f=K6*;g$hmWv`!mHAK-N@c) zl9|xKL!Q|bd%;f1E=+rXDTByWDTEqxT&+NVj&nq2Es2o8A=(WWCPX_jJGIbYBth(8 zM@GS{U9DPMsn1%Pe^i3+Y7k+|DAzr=77BaZp3U|fnG|%Ki!Ytx4M*81!JY1TJ8~JlqL7=FRp!#^TtcBCj{M ztmFsP6bq!5rA(-0AXyokS4fpd7e(uY$FdY7WnvE4Nq+WzK<6Qt!EKTszT&e~L%}s0 z0dhAaa(KhF1zIL(Z0J4LxA`>Vq-_TBl>V|5#Au1t2HN1GDgTTPzoj-*YgDVBkW12J ziCBhs!wQmkZrvQ~tewC4=;xgsNHJ@(Bm)*Ijgfc=N{n>w*y1AA)PZM(r>QCILAUmX zSuvrbqr)0W?bn{X8(agbrz8Wh^(fcYVA-%Du40 z%DZ9d09iR4)3uCp)(|SYu=MrY?AeN%wvQPDTH(Q-$_4&dTM?#;nw(;iq}MXb>Yj}n z%_?*5)C;PlV!c8m%OFcy+Bx|7c|Kx11G*XmZEe&h$qs%aS;vI&(-4fy5! z+cRg{UU(;gufLEVE%PG8K3BU;aV|d!1=+ixGa`-bPs0_M+M^i~Rq2 zp%ABiuhp;n9@`1hzro_Cn>uk-tNW&ZQ4Dw9V4zEDLPamW?|YinKR6tH3b zXU*5Zf%b#*O#O8|H?B>E6JNf0jb4>*rfSF4a8>6`0q081MlO}n+48bz6Q@b-W=2uQ zZ2@P%^;DhO0oAT*Pdr5o8|4R`BsA0#ru-yEfq|EVKh$h1EjeoCGYFIFN++hvHk^!eT*b%@{xyCy^Z17kd-N}0caNFml`}Q4D<5A=e z)i~M7$wJ@~7kj7O$Z$4f>2$S&c0+l@?@e_%-^9*n+V;rQ5lE~vc(}i4`Ej*dYVT{5 zSA%NX3exqFxVcIa!WZ|$+-(Cn@v#v&%;4g0YJO#ylRGUk`i%vA#C}T<0hD0%#!ZD- zcZ06xuYdY`iQo5(B8`Y!Ezcbv!I!21hDAll_&)Ovm`QDCPfwy%fIq)MX9P4e+&4*A zxxBb2DlU#Av?DgEY)BA~*S#<`bf-!NM)rsMDxqiL(P@yAR!Q7&aoy#Kc6%t&aE~3R zlx31Hr6Vcp{-Nj|PC8cBwIjmf zM?o&ud^r=N3?6rnjWGJfugJRdMQX7a$CguQf0%KBX{T-Iee(gz(tpJ!#Cg1WJRpQv z-3?gDOVVl8ZOR7KccEMVnz?e6Adii&WB5yhv~F9fm(t;4k}0ezv!z$XEp0Q61`#jn zNn9~0=psJ%{BRv%Ru?`fmm3?2z)(t>9AVCHcq#kdtmlm*U_vw*sSq-AEZ?{kcz|Pg z((dVIzCH?j4*5p4;JFo7c>@c+PpNwBi>owjIzEv+6-2-`L}6D=!5esNJTt~mVd{tr zhBewCZp++Nx07(&%vrf2y%_1uDc;f6onz4j#iKvpPW6&^@3-4skmh*EyZwszBSBRZdt-wQy5IjLaj{B;z z;JZn|j@vkin~+Y!7Qd}*$UViNPITi2lTsps5bJ`iRJoR18}1w9Np1$Ml4&`Iis&;B zX_f?jaYI)j*^J2KWBim@H7T2wZKPviqz(_uA3UafFrSH3S({85`jTd*)Fwbeq{6PR z$?=Iw?REg3PJp-c{9TD~$1&|MjV&ivudO5oE3#{01vNZY^z#B1*C zH<>PR8TTw?n2GR>qcg;k2la`rxK3;9T7A=N^E%2B_fM-JI$hckE7K`6_E`&qTBR6Y zpCj5sY6m%x5!(v!OWuWDp^s8El+n96#$-q{*Rj`G@GjBLD_pa_%!5m zYCxdR`I?XU-Wlnds=cVFobezE{0GyfG9f@6Nrf>`xUA+iqAur;vN}8(kh|BnVmK)I zo_Kw^IfX#a0V<=7#GEFJwksGP8S?^ujh1pm$*06dM?22fqAEBh@ZZR3plrIe&?(j? zKMBQZ*A#?}` z<;}i!9SUa_X&?iB((vk#F~kry-y)nIhaKJ5AfrmnXhWR6ESh@x&`;G)CdAnEEdNx> zL=I{+(v@^LoRQuIDSz|RWg}&KjRifYbsNl8hE2vyO9G$r93S>_#lcyaN=xWK6Thc~BUu$!#!Hyn6+{pUFB zdD-Q$W5TMBW%VGRtdt(FF!Qr4|Kon?UN(mT>Fy%2EoRu=OjB)4lhdLXLU*#>blxE! zQB_kz+Su3#KHnA$J~WkBLvWOy?_t5C;&24T*LkqRa}p6#^IEXem)}Ex6%khVMyEwI zqkyxXk(RZ!Pf`v?_fHS2o0&yez`Gz9!}^PiSqKKS@yk`;Tsx3&h$r!oZ90@Kgz*n~ zaX@$J#|VpAxlna``NIIfMEST{-3-X(cLS5ocomZ@gFoYA9kzdVg^ zXCX^1%#vjUIBu|-g1iJ5zyfwN$?4)B>ZVcVF2+K*iiqHFz#UnC zLPEwv(cPs^psNv&Q5`oiWFb~InK}+?oQC_z^`1-i8q7$=mL7^6#H3KBs*hRf2T1r6hy&8`!9jY(?6!Xc zqSk%a$u12S7x(%Sjs)3K5=aNsk}&Cx(WRerZdlG)pd+EklapKBlQzg3IL>EdS~`@) z$ivbd#uATzmSC3m&P|1B=PlC(^5BPo3Dlj8hn2z4qGfKpF0Ln8yp!J;$&ehE#akf{ zefq6#JKgu;-@et2MD{>#33YHCO(w8jNuw$_5dAA-tN=W;!T%>W_J0J&M-M*o2G(vH zB5miZXb91>U^jflQEo^rF4U$*$@`!O#n4M9Fr-PY&pav0^H^NfCnb$y*H0m_f*M3% zuh%Ek?=qMFH4w%gDKv=itlYlsliadPoNhIx^t~;E-Gl_+989W7>Jv7QI$14^okA-! z{bME9nngdiuPx=$HyQhHO{_g>=86ebHybhMM>xLxPVj!w04K#b=yv2AmCr$TyOWQ{ zh@4RP@OOx>pd96jnJN zT2yw-tqg67t#QV7^;ciM4=BlZb}jGSBRm|7pPMo_=0}4Bs;vfpBC7J9r?k{jNn_+B zvY)e`@2VW{;q5!(*|$SB;FONbEz{cpT^`SW&H)=_j2SLnVxkZERQGeNre~4rf%{tX zx^nXJaiYgUgeXwqoecM@Y2Dz54Jz~ucZ49Zkr*8vJtPQXElBef*HZ(}OkLj3YFl?* zL4RTe*<5tU>xez$NL@znZz-zN^d<(z>3bQ~}uRCSjdHx=X}Tzw;Rk|yDE-%(bHGy^&85$BZ1_dU6i@_0OodfuM6 z4mLp}pSz;Q|G?ML&p>76KNt$V)6zxls9OiKJT^U^u9O?NT~8W?O1EhPkp&-q6YWZv zJ(gMwhIN#9y&lVLC~z_Kyw3fG4lW*Uwau{^zW^UCp7>wTcfxr2P&SdLn{3Zgo-e3E z2G);S=8;GJhaEyb!h^Pzvjc*hD9kR7f4QSdqA5WB{4tRvOviNUSVH#+BDfhM?l_-m zf;gPHQo1al?i|6|F4nvQUluPvk3m<>Q#{|#lHPkC?Qz0^*jUncz5fgl^9CYJnuU6) zn6L>!1ZQ3`y~4zke5j`K66vzBwoWPvSr|H$eiKT*r#Fe*;c>xQ4u4fZ1Y&U%a%PyF zMe~D5L*C+vUs8`5cDmLrxyt$T+_%O~fNS)RK*@0r-Tso^?iPccl4U3FplW-6vU>M* zpV(dQ^f}3t9BlERUuOH&T}t>{LOsF3_s0TQPf49nY!7xT8 zKm?ndk`OeIPf@YCd)|d1kacj%93K!4ZT^@JxDLeYy(@!`Tx+*astIrBqMwLAGw)#IVKXtML@F_l zVx70NpZIn^%HTZZ9}Per6y}~IiWi=qJmSQ zxAxcAWxS^^%WYwIcXu$Q+@)l?Lu29VyVEp5NP(Ep=^-(s{sWs(naNeSq>@vlW^%~e zvZ3tudq{y>%a3N*V}8>srT0~OetQl& z(6Vd-I8WR88gc?gf6o-!+4EL`7~lMnV4buySH&`@rzd3CKjhu}ji$u>p+sl>ugC%Z z&QjOblP|pT7Q$ZsqB*whjas>;$qrA3wx60a(|yfAUa-bMjl!DANB`ZNfX{FkhIf$a>1(Zs{ zN_iUh+^o<^g3TSh8%`prkdFl0E&CQ>GwwqyP_dnsbi=3CbSf0wrR#s(rjLz&k6}^| zne2q7_f7n!_e9mf_3b`^uFcP1t&Py`eu+0bd#_=^&>B|)w$|UwdLOocr%PbEoI`)1 zl@+FOFt_6K1zq5WCzR=jElz!=+F2ok15_NYlkK;kFh&VF_AkCE-9a!X@Nkg_zkM0E z5Qu33G;61$QZBeTOJMUvh11H%stgZ}sHs~{z6$?DsvRPvdM8JGve<-onq;zzZ&N{@ z)e7tyHfY#|sQ~NIk;--B1UWOUH6MP7?^58YaQfdv>O|%4@NDj3^=|Vg9lKwD?}KQ+ zc|G5(UAFQsb{RiHr}jp_dl}98Z^(nYQaQWR6X%Wf(0H>#tmwhsCLUiPn_ry+uX%2U zcXz!0*VQxH%ULRPR-EJV?oyKK&RYb&K%H(U5sMH4W`Le`(0 zk^w&DSfT|ghk0+yy z8topp``;*oYzHk_2qvp?t-z?Cjek?ktK4$N4Vn__ z#p;`X{5ENkB+}^U$Jpf#l>t`lEOXu2Mtd*Gs37^jDE(q|iLtMvOC-W~W?ctT3_qMUE6}fl=Z7 zLjRT{!`GABfrXED`A}g8ExekN@9ColK|lPZGHA5e-l4EFQ)6PCyCXfAh9U8tpd9+H zEW)0ysh(CbSCh2Vgndp|#U?j?C#nr>xj{=1@9fj;t^i|5S*`Yj8cXr$?VWRu*^;9_Duh;R4TNq+KpRur0A>#GQdfIvat^%Dh)xB~PcFgOGi+MLXB#o`Mm@*`WNygG$KO z<)k|Lh&X(SsloKQS1_ch^YI8l_nOBtIYp8hOEC?)Jv?;$nFZM!cJ6p^FcsfQ(yHBK zy}C3Be!POx#);9;K*YtN`s(8MjI+yQ+&{jr`%(e2(cB@XKs^3gbPCduk60vG%^@mg z4<9xi#x+PI^GW({KshTb(0_Q{ZG9r!1fgy-m9V{746-*yAbTHfIhQ`KBl{nN1RiPZ zoEiG|>80}8upa*>IruPh_VqRJf#OT+-YJ-904zfAH)6m~!gyQB)8pG0gx9AhGNr;c z;@>!CQQG0{o>KPl=iEvTOQv_?c67HJoCvpg~ya_bff6Iy*5O>i*9 z6)P5IXNh}iinQ~&OJrY1LCnj$waccdu@i-k*k4hW0QugXqyB}?Bniu(%j?%Do9XZP6uw0Hb*`jnwInGsYxu)KG38ptSBkwBRxWMp~76HQJro?lq0^laJQx&W&uZjzn;4XX$rWi1B*_%uRCP< zJ{ueU#}U19z93lcH_r<8G=2E<@7t4K84Qc}!(aFtVFtR|$_Ow(teTNM|oA*B14^zst zr2X+nKe8w;l8w{QES`TKhv|#@k|{@SwiqOa2>+;0qZ99;Yj&B%e>Y`vQe_8rGl(s9 z4N5+m+)bpc1ny8sA@Y=+!JY2RTtPl3bF!k@2k3f@Zbzs#aJCMhdEbA) zX;(jYQj0QLh!y&VSvmc}Tw_{Hldh;tf@fD_es9RxaJ!zVXLeo>wAg9x><^MG&cCrPXVS?`w$=01_4w^V;me*`*MG^J(b|p5KiIKsRbbptew~9*CMJ-EbilM1d zQyf4dR3u}Sp^O>Er8vpOM(Tw5X@pse?FvN%(Z0x}T4N;rm*sqc@a?YO8I5 zW~vR-)%Ep=E_MJ+J%LG?QuenV8&TBOq5LNj`-&ZYabBt#wKCUS#0^9(-CRaONU4BE zcru4aM3~BW@9iW`PV;56T)xf#9>BYA_9_whGrNg%^#m9C=uLpl0M}^EIfBTu$WPidK1gQMB zfYx^WX+8p+KuCt@;gOmpAJgibR-0o6amg(wT_IAUl{k3V(M=5CT1FGLnk$foxRUaW zg9b;6Va3mJ6Nm{qkM7qf&JL2Beceubm7Uq1H5m(<+v&0yK%v8VYugE(F(h@~K3`y* zvI^*U)AgkiS%cTKioeNm9`n!u@)zYjv=o2$=#AfM<-MG426p@Qbmz0~Ng!O&un{0b zj1YHY-Klup2qk;lz1knqnDxsd))%pc`97TWA;-w&8?JLF^&=_o}ysS+NW|1E<+&Dh-FGxw~Hm)~HT+*%%Z8@kU ztfITa1g;b!lL3W7IC`1*8R=engOf8?J&c$X6Hwt zTG9*)WINKi(Y_8bxSg-RE;D!~>zn)ARdmJeWVt9aD7+y;r*vA)+J^D|8&QuAt=dHI zAH;`h%h9!a*4fY!^n)_9X$h@=BP?hVr$BRbn=sD#{dglf6{6#5Bafdfdh3oXc+S2N z;kw{0-=!m?WEC{M8n$=3Zt1*Wsrgd0Z$T*8?lss$EZMnGEbqEt+bj1bRIP`FkV$pZ z(Z4XvjtIG;J>z}RcOMbgN;6M;dhU{Lrt0qkUkGawFxE5N3}mA;g@_rOQP=JtP}rjr zV;h4W%0&w{Y)*^QZPZ>SnKlHwW>sd^obtxaIR<-;JQDv?ph#7FXfI0O5m6(A!XLcI zZ-eGq$Tae*-9<|6%tNXF{f)0J8+i#N+tCj%7h{cE3A2^KA1cYcSdeSV~hJ)bgVwv1L zz!3T%`pQ+MH--0MAywcB=Bm?)PumQIa0#Nc)1l({#$UL=h;`)!HoGErn2LdtzT~CY zfi^hM!vC6Le(j1Zr-H2)Cdr?fsYrIQEH8ZpeY+Z$#jRbw*6wYvPZutA>xcjUS%@jQdIB)y&~2$!pJ{9N#F=O^S1JG_5hLc85SUA3 z{FI87<^I>zC$X7daN(0;q)Gb zy(}t7 GfChPma!SDC@UtP5p*h?E)!`RgRO;<5?tNbM*5=69z_L1%X`KxM+s%UvQ~r8f}vuG;&aHXqUD zLmQ>IOd)6@C@Su|f~p=RYe->V@wb(%@^1X5BXHE`DT)n^yG|Y#fgWMy5PNQK9=Gp{ zaAVd>5!tdEjjy*z|NAL^@#$Z8PkX2NbQ)7Kb#~S4q6vpex`tznE|05Y;$O6$fLBfB zs$Dq=BI5({8PrN-HZ@{QY80c*v@SPn-D`LfsFV>&9h?W80^!?CzWHI=~`y{$|JPK+uB;lXj zI=nyQQm7X%z^FW1oz-7)wLfK5%_4i>d1Zgt`IxyVS`P8jEq7J*_8zq15J7=fRrzv} zL~;tTOc)5Set$H=fjP191jX((i?$)e9_~jP+1_{Kg!ichv5k6w0G9{ z=}*=2Rp0%QA_w^S_5g3veI*rxA1qBn&B=FFCG&qxZD>yyqEna1v{St0o4k2b@7XjS{7trZL%3Q zQ_3GnS%IIHy@Nd`;Y5^3W=ut-k0IuT$Wl?)NNWz?KrVU)uxam^MPg(U#EPGdECJ;B z4+3Dw&qMcvM3_GeeH8sPhO@(croORU3HdZYo0)|`dMHD9lC4L2+yWy!{wJ~&uhU%h zr=efmKxB`3KUSmT5fb(9qu!Tgg3d@|{6ce6+%sh4UDt{#G@7zMwNT8^?bzo99#Mqm z1jgD*+=T(bPhmAkuU~+z{BMJnI<1rEA(K=j?<{`s0+qL`ju_lLx3)=c0KW2@VSRv_ z(M$n%IBZk@*I>e_k(WFGz#i^rRJ%)cM*ygReQ|C$seSPpEXH^c>_$=x{N_qa-u9p5 z%SSaU4;C+#x6@XUi~V~jj~B-B?rwa8m+;3}7ghkQ$Mo2b!(yv{!m~fM(gJo~m%{VL zc*wK2f;sNdF0`?I#A?~-yJsx+jf7tlPT6q5Y;9(bG|A1T^{>^ds?FSvLmg4c#s-UO zZ)KJ&lKqn((h6_mL>|V_kNtC26sd=f+TcUFI_(l%LgY8(Q8w)#2XH`1sAj@F)>mM0oVAgfxe*?#MLXNfx}O|q70 zcYdvPp^xZCoy|4}g?fQ?i(Fm@y{Zl-fqR3nr%%Aj!`(qkhm+wGWZ%W>*tepags9bLkn&eICF3%xULYdkE7^q<@FwgnO>RR( znEXkK{!`(LkP=L;pPhVuIYwS+zxX{0g2@x-&tj5EbwkZ~Ux79IQ$#%bDuU5-R@D#* zOkRIBz_|2&i@#|xf)KZQJ$fwTZkI0- zLD-kua%fFzB!UD`=jVq|$o2_uhOxM}A0{+1CHwKF=YHAa;tH@H(Tis#N=W4cudS`c zkO`(q@3)^6uDs7c&*3$6s1(j#lF9ihBKXnz(a4i(9o2!bfTNVO=PP5n%vkSufZ=nnBQ1d!sP z9NlsY$CFD#xuL2~bq{p^SgHG3g$}dSz-`Ts5 z){(-xqN+1N-Znda0QVu@=Kca>SL9K9H0nE&7Ly8dnmiQ!>bkFOrW7dggVyYauZiNtZx&+DLrO&XJ~-4Go^D)t9skyrQiecDrvY(7e!@fXy( zs;T&*(WiY1>_s;u82TIoWBh{6m%f1lz?NANW=+H-WyJ@o#ZV>16k#aAP@s7$gv##I-s#154b);YfkgspTs9Ym+{68voaeD~{ZB4#^ph+$mM`=w_%O> z_DR6M%`TLi-u-#)WRWK5JhvqI>q;E;-*&8Pn306SUvpLV{#b5W{4;z!aTn8_{n>Dl z*=|Ku)9NbXSG-rAXO?#e!vd#mr+8wl!)p|iRpMozydX#U(L0=uqWi`x!a;;ps%6AD zxTA#j&B@X6?PJ3%rO%wk)0l$!`dnp4NNfae$Hi4u?|Q#GXGe2qRVRm*U~qQe;m5$d zT>i|G6DmqdUOVe&mt4D{zp9ymabl;`9@I&ao@?u&>VEKP(|sDG5V?GH9dwC$&W`z29Z-Xgg?y_sD)Es6_-iw1*Sj(eO*40d zK~sA_4`#4_%tkL~);6aKGD!$0Q)>e$2(V)|YzEs|s&=HHf56V5CL**D1Ths`_I=$e z)9u8TI=Chr`H4;yL=CPo_R(ca&8lw#Rvj;Qn(C{EkZ*=WQ`#Q_M*sL*VY~(R$n!By zwwqf~f;IOGQcQRxdJ)v$^P7!0GVOwcs?Mh_EKZ}QPsji+M6-i);(%`MWpD6gm))An z<3J1$-Vkigg1TBGPle>N^rEjmHvQ_yC=6I#4aF;W?jK5R1HehOG$NOX-!Ffhac2eH z?fv=lr>v^uE;0Lo&g;(}u};hVNvr1puE;Jmpe}K{nMaTQ#xKt7>!&FKbqs%+ATE1* zswp;Iz~LgY!Gb|OzUFTRg!mE%hk*wtmx`}GM)cvvn@(#lJvgv?3PQAvyxbCGHF%@= zo;j^>II@S3M?>-+EHhJO@`D|PC+qMR4?B^1kG$Lj&M?AT^+GDKXjHEuK>y%tKhON` z_ujFTIy@1}Ne9jFVK2H)5enJa{osCx`RY|xLmr>s)=p{jc{ zgg?MDT=hAT9a;sEGIlR5`HVGUdq_c=7nP|$iy?11?FM^)=6z&Cimz$CKfb-MIaxu6 z{`8#JzeuADI`st{bUqt!J(nMkm;xW(`ZZp4JV@h#yKyC5a-1j4I+3_0sGj>@!__m= z=c?^+z{kV4qZ!`Qdo~@z8F~2?f%}^g^p>D#D#^lK@7UB2=&Sy^Pqqv7%;OgXj(v%d z!aT2*fq*hW4dTQu)UnB?@dVc@TTu0HtN9v_1W-~qrubsx2njEi6f9CLu43w!7Z5h_ zJ$gPYKv6Xo`McmvO@mv1hA?m(xV?8}IMYx>4jeqJWNC*5vIDzAp4OU9Av~r0+kY;@ z_`*gOF0GNrmQyG;?n^vKrNlO>^j09Y+3x|$PKp>_ogEoGuv5&Law)zK@TyPHk?HzM zABYWnj!#!c9b8TthsU?u=$2!zw$WlWR+Idia-frsr{!~8Z)v(v- zl-_#u2!}lmx-ko)#?u3CZ z-U^-)ci)Yjjyh=3&kcBb*e5Ep80hsh1XMCsxHZoyW|8pG_+RHB#%{#c`*d_8&mu)? zH2tR^<=(p(Z6(*tV|1Te)FlL|qI@jnH#Ev~qH;0kn0xRL*y&LFOfaJUu&pl?B<8~~Pz2>?jIxDcBVT3Jjbb4ky_m%cwTr^d zgxq|%PGFJIeGi7{-3Mi66NGT6xB&}WHG2+0j?SI}r5 z2a%>_viGWD5jhQN5@x;7^%7Q0kRrFP5A1yk>8F`~bc%`wqyugmf!|Z>O`SHKP1#Z^ zCjU;_ZVt#%R5DP1#HamIsAJGP}+dr7Y2(yJ;1-F-z?d1pr3}g6Cc%$=E7mY zc;LZ~i$C2f{CGMynViems}U(dOVdqjgF8!~)VS>)+$(Uj3Nq17yQv=Sr?(ya+xWr0 z?u8vYw93-B0Nv7do@6N!on>XQGQh*W;qSM6X3+=IYn<>lvU7x)SMP<$2hU2*;hA*? z#)*E0(dsxG;Q@s2qhuljfyVEPEGGYMb%R&a0f}HZeI|tirCu6{%jtNti@B(PkQw0Y zcyKw9s1r3YLSIcysagykk6_1f2VO;?Kx2C7SOFCkHY5eWiCsa)IjEKZ>QLnYfgcV{ z#+9Rw%`GIc@?E8b1Ge-Vu1�ATuucOtS8)DjX!CQ<5V0z(s{z|K)*~;MN&Mgh~=9 zLkS4N+UyQ~%8H%7BUK%KHT1VYI0O1ob*97;G|e8)pVO+^3y6o`z7dh}dQ4L0rna#wUKd_$UlD zt3o5wx~9grg!Ra%Ohi$s@IV-`Gk2oPR3zqVFR;SQRU#(W!%mm@<@=d^F|B4=u8 zXW@|gg_-4t`UVdpkIh*izCLiZ-GK`214d7w6DlKx2DlZy4i38*I2Rp7=SqrNOse}> zLWc$XE*E@?2pL|Ie+f+q_ICa>kiZ`53*0x2D%{C9X)OXMLCln8aAkU+(RdK}?`Ao5 z>fBdJ0cc?iOm`m3p(Uk;#ZT9)iJSG&0Z=m>c0K18stS`wXk50L|-p zWg{Xd@ivruXs4^0f<``1P<7P?N7k-`v1g=z(P&gp%Bfw>IKIa}|OPu62V=VpFzIU7>E2RN&mvv$sF zZL&~KFCn8wleMEajb6anw4ynu;W_BlYo4ki0iM-t z>RdwzeV7~x*cYrCx;-QSvTjd_1=#}{gS+j4D4T2`C!R`ekPiHrqlWqo>9?6&KkqSP z^i_xr$K0j;Q%xravdh!6$HR8yY!Rmf3iMl*?EoB&_K_KonNR){?|SeC`mk7ONqmv310?ARozU7y-2CeXkR&JPr>%ZF5RDo(`vu~5qvXVM zG(_pO2aFPpL`^pc0@bFRN;tp#Dk0&0T=(ElcXrM0k)By5LqLyQpQ3^>_ls~ih_!1YzS{0v*p*$xuPF@UuOkY-f9VIV(BlE#++kz%gRQr|$rh3z zZJSoV$7It-iVt}i-<$G@h|*RHj7VCDSx9`WeD+dabcPs+n0IoNHK{YovNSg+}3-2 zp+|93RowQu2}nwn?e*xV8X*b<4qK3K zmzL9=fp|*gApxu~5brq6Wl2oeJiO{MzU*H3W)BQ~HZ9yN7+{2e~kSRf1#5;ZLQ9zlqW{20Le#_7x|H;16zU0Vg=5;T0Ue9({CG;&s| zJX~m1Cw#8l)xStn6%g=n_B`AiAWlK5F1RWf4cuFB2tqZxi=KydJd{4S>|+9i3+dOc zHZxdwP=SFLofyV8S-U<9ag4pldM>M*?rM?*Qikq;nPF7}>{H+8#d=aH5_4N2*w`2V zy%1Y$RPBE!FTa@Sz4De0bn~zy8GL`#Bzd=+pP88n{D-v^c#SAB495Cmh6n&69AHhu ze4d`3fd_^#B(6_gUq=JiCbq-TfRc|aKNMu?r!pouh2UJo(g;V|?Q(qYsRoJzCW*E9tQo6fKU?ilK?k;I0l^(iN8YPq#knZjV z=?0~{yS{ne_j%X)=GUzGb=H~toW1w8uUJ0nHMfu@f%%NvY5P2fC#-S+S%%0*M~)<{ zqT85Gpie`kBlX!7dP~}1u6kAPNCGyXv3zcfc&ee+2w^}pU+^LAf9sV>cV@4n25jE? z4o3&vgYtR(`q2L02{lGb*d~mKsCxhC0R3&CH2n{9ExDTQ0nOh2KI>V%sG>tRji#)0 zTCJu*EbDRxHq;9w)XqSiU;{8WZ+IROsuoxpL++@W4yhAw@l}sf4^;QxI~==hxsea7 zsAwb^kPf_3XQgG5a_fNO(6iH$NXSE*ZZ0+To*s>w(JV+ms}^EI`jB&lOs8_n4s?;dx5S4v-H=k zoh%;+l>5)_q1aS-=>T!)qon^lf{BY64?h>`#LfZU;lTc z!ZCr?m}DejhHs@(j3~0qP{$FxO~B+Tkli&#Pm|Z&M1&WPJ}lS#js*{Ax-sa_B|iOyLKc)dNE( zgws=Yi4PuP{GUg_0KGpe4E5>(TNMOt=inxcX~ZDCNL@20EcI%Tl^* zesaWz38Tk89w)DPKkp%fYWQQEL1+XpOU{-rJ#WJdoqGv^Nsp5DU-iyP7%*v*WJ5O_ zbmshcZor%|+J7(C2sn9T>ks(f9iY4JoVX7baspgjTm(^!%2mDYD`-bM4{*T~0`{Br zWCdWh+)&i-@fMz+vMJgqYp z1XF!~ub-mXYS3zrvL4=hVohZ3`XmFS!1qBdG_b1$wY7CQ!znhvk7?F%ImxZcs$cS^ zK)%e0GX?`t84@aKen;%Z;5xa#tEFE?wvQC=L~f^OdXDF0_u+6Z@y@QZ6pqgS-y$P= zWd`7qE%^B_a$a$(`l$Ht($bB=RkZ>0$j=wvY8*=`N+2jWm_Sdi+>HRCraXKk=|k_9 zdD;zPxAZJ4qq$WQD|JK%8(p$ygwh;kXDL4&FZVzZc><6iQ<}>TtF^-U`l$ne;Bz}O zsgQ6|-E>c9pAP!NfzU<5!s&!WF&RpLZxI3k3b_iHE*8XYMQ-G)jUyL`M# zUeaV8eyUnx4ck%`J1d87lh$%f{*-$bW$bN0)jy?)i40V#UMlGjQj{nD|t4b0c8BctDqbFQMV|C7p+XVCaK&H%i6-hT^7 ztxUCD9jSx3&_RXmTo_by6aux^d#n9Gw7t*co%>f5cfd=;IK4i{@D39o;>=>=++gM<58@SIFG8BN;K%%v8{)5krd}-4BpLjSbP(r=!NcoX-luW@Ej8^d#4j zr4$UTEr8tPRuwXQNjGLyy;SGmefu{I?rSp30vh;6;DuI@inIH0^~zXbkWk)w^cW8q`An0a5cLo0l4bX*~Y1e~$d&PxAa z7bb(jQ@!LZVra=BAY9aQ;PEh*UE*<)`Q!5=B2XE6DSk8smnf1}V~lz4tac;l*M0)% zbW#J4h~)VvOOee{fkFH0qm8muuP{*Qk#aO{h{p`J$;%#Qt6!=M3Y5oZDo*~tIAV+L zp$LMCsUO)CuBgskGYweN1q`t&i^;_{boho4sMKrQ%kdG$k4PnTTl}6o&4191aJ|ai zARlVH_g?YOnXDKgtrhl9WtMPYHgNPEYR-=;Y#4uVO8lTSb#}FbEY0hBL)pa* z5z_tThAkn^GNY9l(Rg&_4NI;l)hcn^n!E3fY+W{VzVj-{Kqw7fUNS@nU94nn99Euo z{&R|;*r%%o1W=*Sg-cN!={nCUy+z^;qV6avdZ(Eo*Mds-)rR(YK&3}7gc?RQ&~L_V z@ec?+X^fgJUpok81zIj6)cqeamrfps6@mSOb$3G#=AO1r38Vz*1I&uadg2*<+8p zz93+o?Q1Zc#?6ETXq9_u%Doo?auf~I-TtP3JO<*G1ZFHV{5)6Ufbiu{pWBA}qyd(9 zS(H3BKnj6xt1fFY`1CLDdwsrUL|CRAFfg6}-tPu=(*kgFcc)iNe>iT&hBI(}sTU_X z1912}2hO9x|L_JEDkaqoH)rS{c^9`EjQ@VV%5&phO7{L=!NW`~JrBeBA%p z6{uhF&@X6PAb!f)fjdXeTkF|T2h&ahcv>{$-K9g=w87@gK=+~t{C)vRb?Rq2vQ3?A zK~k@drRYo>0W?}+q2{A?#ik^7VL*B?dvbC_{#D0NYUn=cWrDXdB>n~oKVZvS2FR_| zXHoq>oc-5noCfR}H~cgEN!w1>ge@_;fxQ#CTJ5n}@^9+s5vDr-kJH9X_4MUlA0Jd> zhSEr<(&{9>&#JxzQrs*ud$meE9gIDzT-qd8OT+V>Ua0^H465e{)D~~j-E?i|Nyk*m z8}fe@;;>Lwe&>`J`laz?>-FgmRwgbVFL&OTi-fz9rFL_da9UnD6h$cq{}?Adw1JDr z(CeQuip+>We}ukd%k|F_K*xXd$lG^I?VzX^7&ESOJo^z9D{LkXYo_!jl&Hn?Rt74} zK5cL>j(V)|FbIQSOnr*ul)S&5+*~8)1h!w*DmQ%G8wLzODWb-h>YCHF^dch4KTnTTkUR^3{BcxquwnrW8HLwF( zV@}N*<@bex6aW>uE~?4u^jy}`GV(g?T3-x`NCb-!(=Vu1M!zS9RmteEBweDwI(wA- z?^lBY(5aGgx9Gy(0d$WsjqNWh=t|$?NL}W(v8`FbVLgjY|PFQNBt zuQ-6<8=+=X_je-9R8B)@`P2@G30dt!y>PdIzy9~}e#9nYLs8}&?Dlr8kxutyrb4U5 zVcMzK2*d+RQw8IV8(GMphBKk+eM)9v*WXhZUAE5v7}hFBJ}flSK>{jLIP|IW-Butl zv+%kz^<+0tsX=vUIvFV`D4Ig_dS=e}^OQ31&z*f(tL61LyyQ;CCm5ADqXwGbK(p7_ zyNg;$dHc;O?U_JA-$b5vSO+2yP9q7%v3>5P&_{W6-b{_f63DEBCL|Rdv<=X$-qV?H zTbmMZPuX}|0MLYR#5bK)Q^v>N7 zE8&7i(kC5s*VX-Es=)H))^oVeHDu@`6;6VHSev!RNyM+B_ufdnQuusOaGvsWh@PO;_ zI2`k{)7}&R&cg`vo94gG{&(iH%E0ME=t|!gqdOq* zXlq`XQa1>elj2>H|LbjV){&JIL?OrGNYq2)*iK)4)kE#tO39s_PmB@!3; zB(l6f9l^BP2y*U8b&g0tO*bA&5DlQ8c!GFWik(wzbcuZ}vQY@$)kNh~p(6maQ|!wK z`ayicrYBI2RU%}Z4>L3MO2MB5+gcXbz6KML88l;b%>NAkSGgVQ0YrEDtg=YVO;1nv z9Arb{DF(4_Zuse?fT~JES2+tcB$4zIMo}!7@amEv#6nNbG2Bi^K92(2{BDmVgM0D^;+;WigM1ev8>&M zAw7&HDCVoF!#^~bIi1J#qy_fGSU?TGh+S68%W@ory@$cmy#iy(m<102SEP4C1^M{W zaut~2=2N2yq9P(%MCa^t7;&A-y-qd}AOSi@Ab2(Uu|3B)as4rba7!}#rPxEdK^ByEDXmC3 zwUylB?uq;Cpf7*VKEkDda^bbWs^4@Q_FB6hA}s(GW+RQFmHNQD2&%yk-KZ+BlPaUXPiX_03z5(D%hL>XsWT6QM_g(=>ls(Hn zuCCPeGbJ=KG>^f97}|W~Fzu^&{Xhjf&i!i^A5CBO`CBUl zIvyI+`YWZ789hgS6D^k!0vj`8tQ0rYn6Q=@F-+&OvIN^Jyy3mk1^FG~$IL znRa`h!mh70!wKXksSOo{Ute9(f0eH`c{8qGWij}5TN-zt`ukFUo1&yQC|UqG-V zp3G5~G31F9-{a(V32xucHvl`gt%76Ax!vas3OJ=foARNDk+bDg60n;s^}Nfsgsb_- z1_n@I@TAm@4?@SwuH%SYzW0}nt~=LolZ%GC?abz;CI+Q6U_D+6ifknS_wn>2-fXJ6`Aec_0U#qTQKs7!!}#6h*3zPK2hI z1@1z?=p4v@V#Fwt8%b-&s}P`&e12TjULs10rC9c|a9M;^B@?-7n=1j$*OHq#r?IIf z&(wxCI$8_yC?g4TD)dOUZR_qbGKI^vN!B$Rq?K^T)3ihgrqn7ny90A^IKNCWs@hUI zMw5>|%V1JTr5Yg#3ZOd}ydmT$Qa=2-_{Wj@-o1)gV>6HPyXN0dq9|yM24fKCsl6Ih z)XXJt*+K)p-|iP$O!g}vG-&o!mhnxj6eIY{`I#twWkne+Vh&XkrM`P1rILg~I~MGG zxb!(?`BTk2n=wCwIhj`-Q1oHC({zf2y7uWRjkr3%L06Iq5JNb?-?%>d!3LY(ye+ji zJulS-rd#6#`x(oL$sss;doa^RcyqF3WXM1Ld8k<&F^9V?&-=?vK^CLRCD5}x@9O$J z;)585iOHFtMC-d2NPphSRkCN@l}%-6=His z#E$WpdGaDjl$?pip*b4CBm@;EtiBCr^)mDv6(+tAaRAg1$i@mX$&rXsxPT-g(Dvr~ z06Ep(MgC0aIc;sY@T7s5n3z6WW4Ncma-*wunJ%V@wY8jrjgCm)J3$=DU{g8i8JhqS zUMt|sS??=-J-z7Sqb5i3><@)gfc=s{MsBloZ@0aTP2=PFFo@i3;%#?#cXsopBB1qr zU3emV*~)6<4}xlYtg{+FJ~r-Tee_T&JYac#XK45x=ZBh+{iLk_!_pe?AG^24(=PN6 z67UA~C;Swj&iwWx?2u>t&gZz?U>+w%)R9)X@tHBh0M3N@4`TX)by$K83q^WsL!(BX zSP*GL?4X)3$7igq`fE<1CcC6-7xxN6RhCXgT!5m3z;yZXLCfiVlUqj%YAHKSZ)wam zt&;Wfd}(r^7Su+W=HFe8h?^mak&Jjz%f_yiy_>|3>mP}l))?;8opdORIM^uC()NBC z!+cK=rGMg8@jsii%VLTWP`~r0K}htC;{hpN^dD7*VF~Uqk+kScM1eN^8j~0p6b4gWo!;UXcQ>UJJ`~W;elvly2+Jgex(nJsQS8qG z%J%2a5Nlod16;Tg!q>hq=(foH0)9U0voS*RL z?jY?I-=#MIuhBz{kyni7BDe!vq4EBCj2e+DrHB&MtK4r_4K5`S@o0s!hOwhJu$F;CiaL7;kv#BsxY`IRQagX{Ax9h|qJp zat(+&hH85`A20LM>_DHsecF!h<5nhxwI41R44#mTfOpA;?gMP?!V%K=f6;y~_uqn} zL`KH7wI8X7iCF~r8G)phK+A}xCK14U&HW=ahUmjR;D*Hq$#p8|b9bQO2mx^Rb&58p zQ*fXcx6$;3^Zbf?`v)(2Mw<4e7K@XpR2VfU52lb4**k$IM1Q`0;?0y5B^RyKiKqFJdfOp~bs<)^17^@8`n1n*(C>nyY2N)KSS zUifyR%z&Q^h^NvAG%QP*G+%W%bw$4HsDmX@x)Z2qXvcK!iasm=iR={W5~ zv7Vx^3>Pq`8?fx_X9N?c+D82fea=a$*+D=d@$mbirYH@{h_}_CMYNFz%DOlpLti1V z&Dgkiy@HAmYYcqAfG@W61PeJ7bm;vrQDQCEB_s$`vtMpz!$jx`>S0^Dso9uD7>G@3 z!7H5P2I}agjPnxDuDXALMwB_mZniaD0V?_~=(?gXY|Ml{Pgw7c;hG~R!hSqp3mZpZ@XS)`9FICac|BC;ALj6O#h<`R{g4%9S%e> zg$?v+&G!cGsN)w#?t%h)IB8#tUl>7A{sRVhr-ulirpA^3+r2y@9M+*Um>styaMG=o z)fWD;lmT_B>azm_*lzxprRvw;d7lKejkPC9XeLW(RH=EeVAN;$Oq1BXyRSB_ogI=P zPuFiRDf)V<&Y3}y1QMQ|VKwJ+Nabksgg7#zv<|8uvq5P{;H+Le7dTZCD$9>u%8&jP zH6a5^T|#D#%8;2KnHPrAlVZgljDx|D9XyN6`0+CFhf)}khByxJHe<*SOO}8Ug@!mx z9#%^ekH{P{oFP>PFyls+{KF)&bbb#{7adjjc7ILFSQpoPt}U4B+br5^IYi)*#WY*8_JFlKG=zBzF?GNANp*&^f%j?MU(-u|dzLtE~?^1w4 zzw`VrUOc{y6Oyck@t_aJm^rui&VGJ&Q3$|-nfxaMZ!nDA{49DC3aVf(=*p?&xEtln z!d~w?NEMgx=w4Dl2i}xuKb9VVUe1JIQ*C~KbjI|_S`D&i2yA-43)6d*X@Cr<;vl{KNdZ3nhL;=)Pk-ZL zWzNr4?KO)q9u4n{)Zkz)&uDmJ0Oj*(*tU?AlvL~n9L)p?-7LHQ zZul2@cd>&&EaCU~!SDQQoX;k$)#o{PO0Qk&i+ecy4_6aBR4p8yo^rw9yELDt17pF< z*W(xP@B#C&^GVXfpQe~ctv9Ri3#$G&Er$=<+Jt{LpOD}MbW`>G`$*U*Kcu&Y~-6i{)VR zwu^GG->jUV3)=@Q#8*;4Q^H+zDa`arUK=g?twyml*XKc&Irb%0MUKmB$A??b9f8@o z8*D7Yt0&5sY`%y*jG0|NR8{d(1~XN>$scA6Br04T3U*fbh?L*UTsVF%WBn+(;tV2T zqZ8VPXq4Dwlk*a~ln@axJx9;N$3hK_4p_y2T^-aPwdPo=spA8)lbnbFCvnk90GEcb zKLIV}(&FYkH-|MK(=MxEqYH+SRev4KNWZIAgm*2RpfEy^Gj+?JHb!(o{qs- zZZRAZJ15Z!K zDH>ZFn?HJFAAt@KGPz0YxAC2iBWb4O#N!ui!x`|tGIsJIm??P9s)bVUpW6= z>>3BuPavCU8+Me4FI|jTqKR{N{K1wXx2Eo_B7d*7#J%y$tUq+RtsC^qpPvQ_Q*By~ zVAfbEP0^9E)p^&N=*ATMCwf?iuw(duMKK@d@O0UUjW@pAW=OZLVJYX)d z?If)C@ZO!w?Cc9eG7CYJDX~C(jgA@;(X5lM|E8*}avGQEXdi#Mx;7gTqY`nu&nVh( z)yL5^;cw#(3stqXwfwrNOrI%D-cD>Y@}htzRKOMuAHaDFa+Gg_LM8yo$dX9Z6q%7y zt#acT5x)_}v6o9Hzn2H?xl$Vv2~~wMMEtkap)h3{h5mS}idnRYtsf>{)gZ4vtVD4L zQG$eu;pFLfI_p;kWv|TySwJVn5~E;9)=DHvEyb;<2gv*P1Eq`)uz2U9I}|?+n0)2% zZ2O7Ff(RW{ky{!{?e0MR%*4izOayB|7@gGd19j~u;QU!yy%qpWiDOCpds2=;fNwNi z1j8Db%33LYH#iw-y*s!M1l!;?eoz3QD41Kl@O4hNDGF-7;*RgWH89>*bFb)acqM7*#3DaVc{7MhJ4~_zt|)5jEB13F?suVnDFTnq$48_fhzx~p&AovIF*Zanic1V z3;mbGD?32L3Q;+ik2lvbOtFYh34M)(X>AFAuRChyp7d4$k{@)EKIM_!dP-NinlS;f z6lg>u76AR8Z5dp@$1Fn}+GGNXPc)aDGbaNiFpAva!ivg}|8RCx^Pph`MI9JJeURYOB_Ba}X)>W?z6EReLD zRc|LiO@UfD$ib2TkR6KOTxT z6cltx{PPM$!XDntY+27!h+<$(rkPL#ClvBszpE8aXVOSs;Kkah}aAsyDm5_ zT~`?;+^w40+Fb2+WXJDzZ`yBK>nS`2eEpkm^1iNa5I!wAw%YyciHLiC`h%T)7eMBC zd-XSrvY^u#uJ3Q$4C}4%wyRgXX711C^X#j+7!%!@+Q}BSn;n7okcK{I^r?P#ih~-q zpG?;4{Tmt^YiUVqr1Jvus3EG2+@J)UNGd7~i%}G-#GaX{0(KPTp2olbjCglOz6m^6 z1YP_8z59qIap-WUpF+U&Sy!N+FY4|5_J%9~Knb{r*{y-22|6UAgGlWRYya zf9;6~0EiwbS27JdiH|xG!YI%D#ge{5fj`du?FTPjmNy}S z#%6~jWgU-XGb^cp#8&LKpCzwfA1^hYY1;b)TfrPME@1lQ!Xvc2=fUML;ReK$KhtXHEOZuVJs%rD4`~Z zm>|sA35A3BWF$MTpqVj>@XBsBrhNASHU|<&042nk@i^7TR5zZ$Hb0_veF#KSs%(kG zhtEqOCu=LQwGo#>CmWsMA`h6nVHP+dFF6+*Y5Mk|h?FI!j=CsWU{bf<8M?1b!Mrrsp1No5@fTRr*u}F6)lvc0Uo{ThSmjYPG#u ziF+fjg&YtBk9uM{ie^a71q~K3a&y~hp8F105ihBB3nHTx6n`g0xhEuhzQuIouysc$A{al8SI(v^txze`@49g(#^&U9L)qVDIqd}bYvKFf zcGl#geqDaZuV=+QCJ$SQ^3{rGubpuui{);lTy-ZQRPj6%4G^-b_Zrc5j?J&x$E>VC zgL%0N?%&KRHN-y9S8fgGy(q|B6@8}i z$T%J{kR2uQ$huLG%=wQ_`+u~WxuGvehg~2Q1>CPTd%tL1CIP+6TffB$~uN8ZH{EtYxAV* z)p|TFVv^OONt_kOt$J-Zk@tV+a<^R%Sy@?uuR`^kz1(l=RzJV?H}Ll#U!(LFu_&u$ zzzh~aA&Jg(d}4LIO>JN8&xn&a;~U1)W7ZNn?)e&i*%?N0w|dit-DO%4Ph?l-PQ^}g z+nLJIYQTKUa=T{t8#}OLYQG$rGQdg##j)ki1D|`2`q`&{WqT2RkgaIcvwjhxGk0+% zNlKDL5}?cLAxr9H3}dQ9SQLdM>B)LQ1F-VgYtVT2E+xLK zzrPpx>MVG?7`^2S+fe-}Sx^|H2ue zVd_-kYlZ7+cd%*y5^egl_AoRl)HGbN2g3;|q1J!)2fGROaTZFMC(ba`|k| zlTwZJUiKqLb5CrjEU@^&YsSr{4i9Out7BR6_zaLVx47ih>}5XKQ|Dl) zUZAwMIxA*nuypT!kZ*aHC1H7<#C0m#Tn~clbSNd{?PMhFS8E16?Ate$vv@40`mU~G zFyRh~>}6%9ICXWk*KRj*)Ok4YUzFL|+ji>f>fPNP=&|4uN=(;}V{Bge8U?0#Ts)qW zw<&!o2r1+hn>q9!#O^k)+MloPuMXh-?~bSGo7ejFR#I%=$p!uFJ%7kn8eVXgl!htP zSE=G@UzHb7FOK0GBqM)eh1=7Fu!=>sKN`?UCBFNy*iV9KDbz{rh7{d z#xrzNS6ZaQjHpWQ{*YqY6HN|_3MljiPju5pZ!u7o0nPN?dqE8-T@!gTQ zeigA1<&6q~APVVP0HBo0O%qAy#f-;%ABMt=M0KfHoc1-m8PEyKRYQRG+-w~Uy&ZPDI2!SdM3a77 z+6mtW=uLA?2lP$8GTz-MFZ%7&b})u~|KO#kFZwOb!qj1rXL@2-+S%9x$D?D)p@-rmd?xyk!+nym zZL|e@Eytx4?4;{QGhj5)gjuVi)ES>aUa>BY3|)5KF%)(kfgjY7>NrA!rYU6g2yy*9 z5L+Kh@k+7h=*x1Ixg*=Vlo37wG-mei@2B~D$meDv*?#5Mz71kjB4=bYMh)TKeyUHMR8%b>{u}Sd}(Td{$jLE{1cFl>|p$ z`@ULw#%G~L=vLck7Nny}zvE%v&&1(wGa-jM*m5b6AX4!u{pJDjl=X#64QsQB-U|MX8SE1_k+RMb%DL zP&}%v#=TXNB5g^n@)}r4bSd3D!=eBA4*U64$A!Ottcfu9E7(r*yL#!0pr0In(?GXv zPNKn8otPaLH+;I2{|q=jPTwdGvrl?hW<(zyBIaisJ#5TYvI9PAFP&HIQ4kK{s=3j| zXatiH-wh3owN|+`b=H1oxPQWWd}+$9h1FG`lKZd+NREOdOLXH@3JZw}HD&8@Uv>`A zdH9Evuefw_R*-t2A4!vrRP{GDYt?5cWFL4GTz^5l!4z$&4# zROil!C%>kRBWVXspERS0>P=sWL|>|_2}KL~LUYW746{nnn%0}S>`=(x=ijrK)HJnb zG%t03!x2)Gr=@0Rr9(BUCql%n%dN=lu|b3|=!OJS)8j_nqf@U-VBr@?*wP`1f;7?_ zzokl0D2gYavphn_!6%;!sX(<~Qj(TrMQU_xQDI_Fm+)WN*L)XYfIFzlC-GTzcvoT#zLj)vS^(B+Gtlotpfuil?Fp}Q5GA-48wywOHHSzQW)ceVgP%hoC zLAz^e7L=7bxJ)0)8-pjxE_){Q6m3XyweutE9Kv$3p~Y%%Uf=i{i+H2`@|H<>FNk@0 z54;)wY^Z(kxLZ4qk+Zvl?>Ln9XR(qf+bv_38u+yAel(OD2t}ptDp`(o&;^pzBvGhQ zV1>Sl-GoH2ibIz)*M&Mm-<_KZ$p#@vj_{tn;k7}IGAU%D=4dMhK*~CH(Xekm+LPD; zn2rf8Vn+6n;|X4pq;&qf5OsnyKU7h7&;-u5G~X^-R~Sp@x7wqH)k~mx?DJSA`OsL( zztua?5E&$WD`YSF$($oX$j*=@rADpSN3QEi@l;V52@~To2+=OS0!D{>b+eVuZvB_A z79LoQCtt?J^NrC(10}Fq4;ynkoX$=W@sRMs-pj5MK5pPkp;*CA+K%ehmOrf|B49`N zno&O7_RsyN?9Io&pW8tXX?qr@x&ODraX0($Ze@NN zqK_7S)BX^Acd^aSU)TOnqwYf(Y&yTXC@z#pNOwS%3HfvH{wwoB<=M(c7Bn$%l&fx1squLnJR}+cNf5L*G3wQ&BdO z(Iipu|Ey6Mgn`>Fuq^evSP2c5I<1kQ2r6ozE&c?D84Eiaw4s*Dr3^03dEfMN-?ONh%#`kle0L z_zN#eWF->YD_GUbUiS>VyM?!2-4b2pOi%^qjzF5X0}3T8KEXVN?UR+0yBhCK!l;w& z!i6sZ&?Qgm; z%sHMe@v+x#c+GiPG#@9W%-{EkUrkSKG49Rf#C#p9ljwfYO_q-W4L*K~PK(K(D9%=c zff%2SNk#L@`TJVCG2xSzY{RFir|YGYV#e40edg#k0Xh55K9*Mn~A{KDM+lYskHr-5jZ|QTYHU zpn0J64ryN6VkyB!3ptnr6duBYq1a|K$tGE>+-`-z8c9n<0i=mpb_FMN{wi<6>nL<; zJxU1pM;j-O22~(9r)S*u5&$uUl&lW9?KFe(ELjL$i9x`#?6EEi5)J~yMqU80UaIpY z_LGS5Qm&(|nPqr$f|&1l@yhR#^B2hH*xGq(ZE8)V30R*LH9N_8m<%?lROuC4!DQ|H zW_bh%Jxravujk|R{YwZaQW|e#Tc^qS=b+O6paUG7X*3$$fR4&@Dc)CLxdk!c5_9|^ zHEX$~A2@aLcH2#FUs$`vfIU}>H;pHnH)Bf>bgUmBxQE3>Ald-2I?DBB=lykG%8{x5 zyz<}7%~ncp5d`Lnv)fJrOb6LC&>jOny(_a3wE%di=h5vkfm}=68ahlUD`g6sjx#`R zg-`G$2}~89zF7R2sWkFC-rF)tT|<_k_HXh$S^&9NJOeHKSTc6q)mxllIRQ8(ZV{=AkX1(LW^6cu^NNcNawbkf-2lCkN(E9&&68dl%GhzDaXxdY$$y~pf0+dqvP zzaXvm``@mN3O@bqM5csP*lrz=X-oJ|r18Pr3ffedFg{)!DN_LZeICo_n;S=ibU?+= zTB1Y`LG+m-w}Emf3N=*(9iU3zLjM*Aw^{~@mmpC?0Nsrl-I=@VBmf%!rn--P)D9QJ zQ_ZU&j7q~t=Hd}@+2wZfUrMA0+D`9NA1=CuC7OhjkIZqn!$?CAbG+Nlv7EvYc2WNU zSqt}vek)I9-w%M6`Fh)~)V6QLEZ}glN>jqu-vkN>q5HDgRk$AXY=G@2pAz3DCsRod z;M3L#+!8_Z4EJ5k_HAp5;UDchv= zXA@JgYL_rN6owiP3#Hzx0!BU;E^sfGk#+FwI}&L!KuUig)#)J+?WugfgS%|s!kzWV z1z*Q;8Z=ZCHa~O(VGEz;1o^vm|CaFolRA(HzJ^NyJJ$?u9(->WUdlyZydK#7g^x;I zOTVbSwXSOO+0$-+3>lxvKe$=+_Tx#|P2;+o_!--_w=MB>Dy#k5sM+*)NR+PGREqLi z>;4d2Ypk;F>oHev{Bb5C7X(%<3*1*!Adj!vX}hZ=jfo$GC44D zt1k%&ou-T*b(XY+vD*@P`)Tak6@|n2K7Ebh+YW!wqlz#d4Eyeb2=JEp>;pvi?Q}Zk zq>Ch0>oN+gedV#)$>@5fvke58XY4;;7D}Wmtd;54d-?r6i4#MDbCbruJmsf;Ph$;} z1>T(3H(!fy7rmOZhu|p4)Zu&4Q<+^If($hEOr!k*i^4ZG@GDX1ba_w#$>2n`Q8K`K zCAWu2W(u%&1I5Hz(q7)Uscm<_i3I3Sp7fTZ6#bLt4OQUB?yZz$9*u97DkW^ND&$}b zG>v)VI3@?|G63#(iB%MiRiK{!S;U30KywhxN9#(za_m!ot!=4^Z@}Cy^cv9K zN+Jxi0`zFuxd*rb7HQyzg4$L#Z?Amiv{pkka+^1PyVb+o|Fi_Bzq>dzVKpepui00& z&<6W;Ubg4<1yP|zOlr}%KV^BuAY7zGNF92~TS4>Mrwi0(n22~dExuE_R_qb)K8%^r zINak&6UIp5?kTvt^cwL;MEw~BK6RJ`B7$H92e2e;20~jHUvNiY5cV7UyXMG+$7o&N z8$FkGvA8#hHV4+3Z_a45Th?Pmk1HI!+v_QO=AHX738G}Pza;9fHF!Mr$%K(_TK!YF zfM;+yJ$jNR zU@q|WJwqY80dYJQ;)(yRs$-MziTUKWMu1Sa{id`!rLCgI=CR?6?@FgE`Q6aDHsgo1 zQnq4u0E$mwha*3?N4DGk6#IZJvR)xSRVZgga!(&c>^8Ud+GL=W=;(mghk{4xz=SIY zF=T>@OofUmaRR=?AuCiof&x-}^vU`Ztu_oXF+3{0H8fJj)Ye?pRJofk%*_k#c}!qA zH_ROKLkZVBg>iEvJBs3o;F2U1my4Ydq|=oX-=~Rg?8dX3c0{gnb0uHjR%c?r=Zox{ zomRW@Mx>5yc71G#{e~sS=A#JN*AOoM#TNG8?R6I0tH5ic%E^l|Hx>{T6QcL)=mlRf7l)LN&%&^;aboP6#>SI<)8#x42z!yxq)?C!bMuYAII@XBw*jy*SN6F}NgVD{ z;na{|wn+fwj5)MCIoZeo$D!riF%gGi*x)Z#3z7KZpYFN3<|vyfIx;%77p12TEBgT^ zEZwhg3%>Lj31lw2<8Oso_uXgxz6CrGW_Ey%dYDcIblr)QFrk8F+kpV%j-~B}l@SBi z=Ol04E0F*{0T>P;GSta_2NC94@=a@J+x79qu5_QV{xGr_v} zx-%jd5E(j*?%tl9#;$i%ywWs@CR{#P2)TsaMX_A?3p~EZh_7rawDfe&U5y`7s3tS? z`p3StuE$ehgb$=#>+TqjtmD5I=S2})N-@m=-LI$b@Z1J|Fs6~S&KLLJ^T|d)5H;2KN3<|{`0o71`*Q?`!FdwO`yzUoqE8dKvemNzaY0z(=j&3jR-e{? zw&h;A8n-E-;0EXY0*8fKynOxj`{i+mv+>|0F8g93%Etxl0RiKFxe>qLEiTL!_uSvq zsQN=^Ta!3Ko@jh|*>M^lKU3DGG}GttCOgumsylOQFWjdq{P2G_p8q>7_zQY$0bEkD zjV|Q_*SwjeMpg_unzm$1xCgp+i}J^nO(_JL9u_oH=clye_6rji<)2&dwF1J^R0U30 zxvgkQrU_3v*cf3EY(G?K302;Cx0z+eW|UdT$!1WcQ_Fj7g`&ovl60xi^4a0hSkObI z^=#;s2r`qYz;Z#dqO@P=K{*5~yf{L5JEs5S*j^cHSayy5ou?7is@ zk?scRZUm%5LQ1;3J2y%Q(v5V7bT?ZhlT>G2XoCe&pdam^;xT!8h;EJ zzX?RATVtA=I?k951Ho^GJ}w08#)WBB>Nxfj)teB6CX(Tulsi0pY>5)ugp)?z6}m(C zMx!o}r!)4#;X98@;JrutTIKjIRJ9*w3nV7Sg?7*|hSL&2ZNp7(1e~USvZdXqhfjT6 zWrv#lis|2|(MA&&&0ekcneM4M0xDmoMMxsbnCB#T>f4An}b^KIfE&CtCNHdhKA}^44hDgb+Vv zcHrH-XV>b}okbcL+Sgd5maSrEjEE9TfqGbA57c~N`_2oz=s$pWyY`Z|P5#u0X1j>h+1_tchV|`50-}OB-C1?tr|~kvoclp?`qnPCn45lv#pWSe)&HC2spv z&+^;0cq9!zr>mITdWc(R8c8X2sGu~Ck>06}cQhq=@9^Vz!J5Z&kj#JK3oLAj6fGsM#0=+D08*ut~qg5q+0IpeK5^`IU3oY24boNrTuLCdk^DUy(NP(CNCSn z-Ur@8=MU4+6=nmreo4Q2ZexFZ(moz)SbPu{EqDurwo6PT53|StXUE4^KMm4bXN7@< zjn}sJxLB+U1NJ?=Y5%!XPQ4gte$}2~%sH+uzMRtoPx|_X_Y;LzS67Bl13N(bMKdnK zfl!2GI?z0SE4!M!&EflMko=rG^)m^Goqhjxk)RvGo|ugS8!<~l!E#ppgM>(HF8?tn zPj`A>F)o%0sRa&pHNm)er3?mk974Z#ImU;k0Qjr+WldS{)#&2A zNaw-dN9}?;(iqp~*l|Y)kP9BUyk#wcqbRCKDu=uW-ZiGpRiFCz*nJ|&djmy8grv#6 z?4EQ%s%@_B$pc<2{{|qiU%kR>pGQ2GoqJz?q*pudoqN_d-FQ(0WM6AbMc-8a0RzLP zuDx-IaAUTV38?R|0G0xBPn1qX@otCB=X_2uteL_$yWdvnEqD19=s#i8YBb-Axq73r z%xY;~WrPc2jmYo0DrKg54p&V^!?{%AsR8ap7RMYJrAM1qfq^1dbA~>TDtXQvCaDhU z&!hkr05$^kE`YzmX@^-HqS&FCX)Iw);I_e%5Q+Dp6w8$|Z|HptihVdY?t96p*Fgy`tl? z1&<_w`W;fAv7py)F$J{r&|`XF5a3gw^cMC6^hJ|uU0$pam*B)B9~+nVa~l#sUIJoCXy-cMF%7L)Jq!z-sS&)c0Oz6|KuBzZq z!>$7Tk3&*09RvZ`d-WS@R?0v8Kx6y!z^H@YV=5$l_(SGX`0pm+tMBR1%G5 zG+O8cJcagVc>zio$gCdY-&L;~wz%N-?o#z2n$f$RRULd{btW*Du~+=Y3f+0h|Nqg7 zeQA1Q&k2{#$2Q!V9~l`Ot32TTFHJkG(6E#ePnEbEcz-i;kIR81>nNUm&hBU^?ne(Wx$B7wz~a4)$THQ5d(lE-o{?_22WJ znwcLBv@8=pAXdbSw)v05r`euB**u%Xw~T^SJ3n;T1O8Ckc6fHfwRCTTR>w&K1m15e z4IAJing6pD`HKuoA*ZwyS-b{oC{qw!KOGQm^4Y@dx~sS%)`Vc~-JauB`9IV;g1wCA zYYW+gUH1x8zyySZa=j#cZxNkdky7qgH-lb}h+VB1P-YzRCCA4Q%S?2m#Xp>xGP48I z00zHBpT4KC=b{txGFqc7?1nJAfB|py3eYkCLU)>4^RwQ z_PxD00&*J2tiRCO0Z%M8-I4V^GnBvW7SU6au#!*U0cGK{0?4W;sx#1hsJ^;bZ_|OI zYb0eqXa#K;-g;#(V#3n0l;?581v7!zQ(+G4_&OU#sAe%O|5m}~Qx$l3QTRMUQzpwt z5Ng@!x0PrcnA~sxDoChlsk=TtSZ=qta0Pzoa+(Uo4;pxp!TvohfODm7Cqs}vVFT($ z$hB~wYFcC}r-Jztoc&(_3A6U>toMx8{|raayE?a-wKDj3oB+WSM2^{`zo0)&y_3HU zmItCNR;R1lYkkgcholjzZN&`4a`sLW`=X6S80woYH=G@;Nlty)=<; zaN?@b8Oaxx)FYAFoN;cY) zJb<{s2jFR4vm$d>r(6?+GjO_BcJvb4O;8vmJDc&8Q6x~s>JBn;LSpM}?qY*GRU|>o zm^u#=3gf);MUhfq)SGRrAb^s;>=qC5kyJa|(?e5_ouo!^LBOxPb}LY*z3axn7Jx%+ zn%+kTqOnj0V_|+NbriF?`bZDmF+2!-7(ekn&(H!$TxQbtwl!uP!0i5B{xWMAZ~_1l z#n=0d7(rWhUtws_x_w~F0lhs7DPRz2{(1xTv7-%Fyp?$KofWF%%R_HB`%dSx8lJu( z>bFP+&~EiZ`BPD-IvjLS`DvUH7n3>i7I?LQFdFWbrvTSC4;T*4ykV-2LD=*n9y&Ev zJb+h7MkF66ZYJvNk@~TEk4x#=PbJ2fwhZ?r1~Prt?AM%BiKzCNbcZCLzXW@0D`W5 z*sH)l0Nf4z#7(`eiy$)yBJ{Ij=mLa-HitSyzCQw$^jl^tyP5pd$@W1QA*>*VCScrS zIrxwpXnDMssWq|QVFJ`q)rtF->+OC=nqK>}K|u{Hbo2|tXwa!$5Nd!XN`L*>eP2`O zbIL=Y=VMz8;^_r*AU0-2Y6)V_t5_`B?_Ru+wAgR~n8+kvcyZ%`w$$x_ngeDG=x3Xh zg>G;FzmeXd^W6 zs-H_$Ha-F9=oMAbm%5ujR2zJ3TwD(ZavgxrpZu6jYnN{o<-sM)yIc{=$8#0{ABN+r z$3Sq|9yl#H&c2z=MjIl)%u%Js+J%9jC(rx$-}}g|)KqHt^p*e59qUNc<^iCs7m_^i zov@FW#1D>mSY8SF6l+)AX?&sLcyY0XlIHFC@=ILRcnG_MxT~9Ao>1bedKceMZFSUR zpMZ=~#h|P*J%i`@deaL=ua~PXQUp=Pr_6XBtrR+~c(mp%#iL6g&0`orm0T(txzLE` zDxXT%%XoQ%V&GWx5vaaQFtqk_xymd(G)bS}JwAnNzBUTuyiER3KPCvV3mC zO=^&GYHFOjyYB!ppDjGVV3)B_f(#+2e#5(0Zw1lm=!8w|Vv79nESVf=-n$OFW@oZH zVK_bH zdVzsBD=y0m#W{>y$-SdO&Y>)5rk02Sxd~8*H{1Vw&58NN<{j~G3ss>fYi~8ajs|L9 zXs^;#6z#z|S{{fkuHwMYVR>Fdd=3=xSt2N0>gl6FeMfW(!zYOqz%U*9OqUfzG47Yd zCP+yPUo=wMR$EPrc8sFEag?{fgQrwJ3BxSBXh`U1efhFiChOoHGvta7aXoOgfh8GvE*?~qVv z$U12wV&Dl|LN>l$ok~~Jr+4f zV7|Cg27Eq{W@tx90PmALX*5#n^|b^6hvy@fe)6XkwU6Lay%XDziumBJ4Ko3b-e00( z&)Cq)X||ZlP0-XVJ*dEveC&{MmFm@7>X8;SuG?>VeN0zOspE)3K-3o$npw&7YO7p& zhN;J}%;v%w>3H2GZTTMY5JM?c$LV=)98AYS><-UCugf`4%Z{Trfc|2m!}Zr-MSy?F zqty4{@put%>uUbj;aUV&^Q}M<#@2P4854N+9TA@9byVyT z){2&7uAfdX(%XQ;i>^`q(D0&m;OT09~oTzdvCp z5V&Dexi(Yyf!$P*T<|cNaQ(uUQShJAN$~MI?anjd*9Su$XeP3((8h~X@XH;sn*ZlH z*>5=5$c0y3x2%WK@2;{5A3vK0g1kzqEWvL8`99^l=bIT)pDB?$dtk-;xg~S8i!R|} z$YOp>;d5FA8gSG$D#YR1Lu}0Y)>y+(0Y1jWBZvUT5+mX^K`)vXQ3&WgZDhaf;&;h% za|2$xEtWU7)&~nq$ZMl9PfyeCnR~CnXdkM2pr>v||2icY3cH~|k4dRSuGX9YK+K00 zlSu=wGfn+V83Q&lcV{r&b~LZCJ}oc`%)MG}tM{870oY@sf0&z34^$ikFHcB8Rm`+)!!PE-$Qm%qye?J+Fhv+Wb>;QsgyMV4l6X3J3!;Wqb-BD84lS<@$-R5roQG41vJQxpGsfl4oLm}K-%e; zMFVZram7j?%aclmct7)XT0MW^^!qu+cU61S(n1A&PTV?NHhFFxfG(|PZO|)$V*iAZ z&jpU>jdqfYKee}%c#7UO{s!qCvwX8ONj8N*?_&_|g~GmXe^|kMZlV5PmC5M~j>i!Y z{3Tq+hJesf<19Qpx5={fc!|~Ka`qfSuh)6iy$?23VPpT#RS(apux!Spt)z1~3H=RT zMKbl05W63iHR30A|2*aiU0jY2_)0@qa1kgu)EFP9&gZ0xl8Tsqf8$}U$XmDmHULf2 z`5OL_HJdipg4d36QfMeLF718%`!PH`jrVaxj7&*gcvkw>o)p|%U&EW~F!G-fbU&BV z$JpB1l)Lip9`D1MQJBD2ar4J(jSYeAzQS__NBl7)A{qAAfp_nJ&?D0@56zQCXV8kR zw*DtxF5q|3`JN#3J=P)nh9g$j<78&`(;r5Fb#+3ZQG03P;r{(#6WFTZtD0~JOQePH zmf888pCl5{S+@uV7|lPB%Jxwtg4e#Z$49ih&ieW;F#~;ufAy1~uZ?jjKRi)mCL95C zwS@=4Dp{UaJX(-l+1ap45~eNC+yvEd?v6q($V;%EWRXVD;B%w-ed1Fq?<#zbXUR@8 zZj9JgVgg9`{&87InEzEaQFb8c(MZ))&~*OkoUWK$T;JHG+EQ7rEA^YqR^-C9O1TtM(3Q6Z zw(k}kY@l%*$HJIIdk)A^W4=X7kvalBa@i^;qav?p# zq?$Tc$GT&IYSMEcSg3lsMrPGCrk_LOR{mg^Z~3e1&XJNNP~l#vmz3sSfKFFqer zVimf7eq{XCasPYgKS6@JQXIyrvQ`9aIOF}EWF1^xiLT2{bvB0s;_i+FdGMG?BE?@7{$I{R_9{qJC^|JaIAt5eDEcBx*)M$PJ@nxQ_ zgZ77!c@Nj3OaQH1M?o1heofEQC@G+Y8YGAwD++hF(g z_v+m{EO!$=UDXRxOr;8JyPqbm^hSa0R0*FCufX<0e5SC&{0g2IYpSuu=|qjm_vii` z0B=x5;XP6tfD+bscJsEM9AGKbKo;?A!)dH_NO~Rc#mCc4?wcZSdIKpjG!l{QChij8 zZt63qEWT1kktlyZLLm+GXcTp}po{M~@j(OBtdAJ&^D`{w&Ec`RZmzCg2~Z9z>*}k6 zDG`)F%7=rwWFOCW(3v8$olpZxJOE3cHoIJ(4xwQiOFXjU3|&bL30Mx1m}nG<0opyY zfB!;Ceyzeo91W8bJ+xjW7Z(?=FsE)xnZK#%Yp?O=<5~tfUn!oaevU$JyFCL>Z_6dq zF;fvK;CSq9TMG;EVLdRS+as>Oag@NnbR=~zD=!Gtn^SzH$sG+Q=J+-HCZ(8QDU*fq z3G+Gr@RZ+MzU!bBk(s=qU}Lu91QzJS|G#UIM?MpL3?S*#5w)>ASY1HS@`p+it?w>* zjhc7NR=1FCcqjH@t<^30v5CYpLBn%X6Wz_+qfMCZy8bJ!r%tJ50BXVhsb=@@lDTwJ zIabom+{*sSRxDB++)gFWm%MB+V9U;DF+ma>5*L^IOYcu3?T1`#CisBbPD&yLnu*py zo$}7C67dXzA5=OMyAxKv_{9_3k-siA12V<^eRYdGwPwy`zn$x?6PW|VIkJ<`lfn?zkhL2{G7Mj# zlm06&fBbK(p-sY!zIC;Mg;k50Z%uvqe_fzxjaXGzV^6#S41P{yl%O14q)9 zYI7SnU+SCkfp0UlP7fzz&f)=sv?m=N$JP9sJ1js3f%f2cNgIi{@X>d5Vz$oHSVQtG zIQC}eNpteQG|{g-8=Y#e$>P8_eHNf^-(#EK)ae0}{iAKSU#cSfM4)i-$;t?Sl6E>C z*O2Cq&{J`~!_Gp5z600#?8LBht?V>WW8D&Yz{J@$r;0hwhFj|wrI0f@5cYR4ATaqG zGq6!QtvRVIbd{0w25_p7`t#f`79jB2E$&{Be#g0aS_c8&Eyxq2g;tyQ@zk*ug!OQ1Qq;y&BmKU|K_+;9hNQ%5KIv=IP-&`{J4DVk3aBViZPs4*~ zsbYPI%ZY#QVi7)AE0F0&=TTO+N-o0XJ91nL()@KGe6O=Tbm{g<%TuLm-8*~Mb-CVz zze9?&y`v5T#^RZE_r&~sP$vcv6?A{kQ+8WS3V-;};`ynDyz`tMmdoZn{;xPC@O+MI z(lJ})CiSB7q0$|_db@__xw1E&n{CxM(5Uxc|BTmp93mO~iua{LB`b>vDIx=lzPGG# z#L-2Ni?GK;G@@VUj;v8bR~6flS0xJZwif-OJF8X8PsPHBYe_bEZJzndQ0GwO~o{#A!qTC%ReO-N2Axc-?sTtqciAU-R z`AmLjp88Bb7j?&TXci1vAWO_4bVf(p$aK7Y!Nz7$a`8PFm5Vb!>weN9Xuvmb^d-gkh+wYV^BD;bwcpXQ-7gqA zLI{ZcC)4^@d~Qr~YF)M>N?yt(@1a5n(gP~1B33M?U1H70XI#+&n{h$vq2%zQcY|G7 z&rQW0<)n`dKt*6hWA$Z6l6+yvO#)njaOVf2=9VywOWJu&t##&27! z^LCFMWLk*LQo;E)mB;@Vr~3|N{}H6z$3)5VrCsQx1CL)wl)if=Uoe(K&g}A@CaH*v z0aSB|80a!g$ft+)PT-MLU&nL2)g0D9pBXTj*_7qqGZ^Ify!LOfs`EO*&}LVr<8VnG zCxtKL)MqV^IiQP)G0#xCazaePA2lb&u$Cy@;;ehTeGd<$4HpBAZ?3dCG|h!5$G4Xh93Py8kjMVNBNK?7?gU69 z&I+u!^t%?iaE7$Is6W?9mN}Jbe8plT(n}bY`PcNFbLiVFvMNGj9Hwn=9iv$Ya;cqSp_>k(d3B zykFs!JD)cu%cb;Qw>XGyu&XKLi| zN;aNu_tRq{9)fZ^AB$PruEuYUQ6m)>9|{dyO9B^2)*cfu_-`V7UvB5z))G?=&rA8( zZr86off#(>m#o*8G&AOTzp*Wd?eRD+gj~egYgtyXXAj@te(`>s@6nR4y5BRa^?|zT zX_f5-;m_#t<1X_}^JY*IO!k1w{rNcU6MR8iur3y-sd-O~ti2>aK;` z>x#*D7nDX1E2AO_e<-H<_%GRA&+MXeT}bkA#RImY_sbb=ldAn4*d>()TD$utQ~R(C zlhLz-r7)LFAV{e^+yza5Z0w~*%+I?jGgM^>(aB>#ziO#c8{Efb+!F730o%eiY_K}Q z73(++gbH-r#mS`nyRjEeupuepi`o!+s%r(U%fQN}2ix1pk&*S>hqsowD)4YhqGwni z7DrWl#?yna)%VT?!))`#MO;2~*01Gs3LSS~&-piX?8|M^VK_~MJ3c-;k}dfwBgi6r z(Jd6Uz1CP8rzg)6^h~Me_|iz1mUC?W25%l2PVnZ>EUVzrlp%2E+u3p57P$11G7Is& z|Cdqu^c7JHEM&bi_PPSuy~&)obs2hna7_bUFiF#SJR@R2-3x4)j0_Zw@VFrs>@I#xG`o7IW{#fWyJx@Hq-^w^ zCXaW)DnE+%`9lpdB1LJRj~915LW#CG5fLp^+Nk_ZHxgx1q8ejxVoSz>U;rz9VUKgc zfnYSaG;zWrPti}FTD}ETq-r28DJV@4Y-NF0Jux>WA1VzGjtX{9$e*D3DcjaLMNq9v zO>C$@j9ld?9I0q)W9_6Vl`znAFWo<5Vn301!>4U;_v0SRLhYBcV2K?MPpaPhyI^){ z1-pgs)7n8ved9Af>T#<%q*08CXh+oQx7o_EBx4(VecyNFd zZMi7NEWZ|X4jP!lZ5RS85NcmdEnj$~-8_>a>lu&+mT$H$3jvY*7AGxrWV*sk5=KXB z5j9B)Jm{@~Ri6nyH`wTpVWK7HCw)CogPaXt_}u)NqgX^oV{EF!X!1^hW>Dz@ z0sAgyIv4G_b6|}QM59$rIItNdmmhT8XGQKncx5Bf4i^eqe^Zf{yj}VfBRumkrA9I5 zJLAUYh=aanr6os7Y-Cn_**hBGp2LZ-Dd)dOBNsUi+nvLz_K0Fh z8RT3Az0 zcIZaOes1lY@%tB-9lPJ2Rst+ay`^|&GhS9OyI!JRkcC@MpGU^hbatcdkxQBz^MAZ* zML~iJXmB-uZh#<$v83lBVcV&MBfVbYJ^RW<>(^tm zV6|Zg{>%dT@naDjj>XGUs+3^`mq!La=koQ;gs8^uyM~&)3evinA7f$S#NT^0fdS`4 zH8uHlOZ6;y8#q&Yb$BFZY^3ziwDh;}*h&hXCR#-ngSBp4llNZK6D=87QBAnt3DxSd zr4d;vLpZf<3vHT_B*r2q9SKJ98+&0v$To6}Pokvn3zQ?oiCVHK%&=sQ(ImdGC+s#; zsYxSE;4IcRXxe_Ph=fIGJQmMePsdMuB-)Fv$4`}_nz&Irkr9$-EEVSFrBMDir){c8 z(zD?%en1mWZCeqIn;!+!HZ5=Hj*mbs#6FlZuI)piobb_{e}^-tR_~OqPS`g({}I$V zRkix-W#6B0&9v!N)wvPl-qnFMCt&!pci`E%*2D+AuwV{Vb#4tLctS#-y>{l6?RN;( zp%(^mzT=hw0UL7k$3}Iqz>de$ubuZPcdkAYlm>M-xn~pO{+%Akr)Q>^VmAt_&JBo5 z&TV*z9xBYsh;AvEs2X$f4-C^zK(K9;QZ)yAt=asu@6lP3;}fQnl%t5uvgVu9VxiYb zbq++T5|S$F`M$G_i$o7ukoY+`qblR>tQ%@#W?ZO{Gv2Ix7mcAL#) zPW#9w{O?bkhlExUm;A0a^vmuuvjbUY(|9k=Pgtwxz{q114YoKOgX{)}hVYN*TX^542#oQ%6~{_+4E1b-G^45tOHW#YRO{cf z9NY(1C>=fb@fJ<{4g9z|zdN{LKTG5P^{)w9qqr>F+qN7_+w`5LwrK^2pfVS}DgjYuPhOENN`8ZKB(FrQl&ZUM z4r9wCleqGzo$fVDu$6$~@VV(PxbeW6PZ%&>NxJt9y6_%pBEOr)1;P&DBFl$Kt9K$% z5%9qx9r|2#%j5!gA7I@wS+Nf!9L$D@g39wJl?@6zBN-TfO3M6w)meNjO+e=%*(5c- z6qFyoxIO?XPuc9LT)_yp^9C5ai%1`2a%ZSDv z`26?*b2Vky47%4*Mz&{XNydNsp?}qNkhD!H6QoFp8KM!h97tY0h%IyF;Su%8W06l5D8rHNC>_%67 zs@}MPB%>{pCiW+b*1Sn=JJFN*5F^@x)_f7SxbhO`c}FVhw1Xa_l0K7?8LA{NZa*Y& zTZq^q_AC&4;+#@xz-b;s3Zkr+4|XG2OC~;Mnw4HX%jE;PdS-BR>N%<@az<=$pR!RA z_M@=7qgoLTWr_Su5rDl$dhzq~I>F+6!RnTmf4_7bC;tp8)xV=v&~$SfhC@Ke+Y@?g zqx$9n`?N`j&G+xRV|X{#?%rOw{TLcSs-I{!%Vy9A6_JL?XWusKuPhbxyj@NoA#mcB zjB|_EOXJ8+2MH=GH_M+cGMP^Q&1N1dGtvZs$aGpZi?d&BobEFBJjFT|on?qtk(ptS z(SDY+-%92B!O=-UL!v~QP+f+k_`RwGYze-QiY%sthVEHW_TdU!TUZ&OIfJ3_} zziRrOr+-m0_S?)X^W@?%M`bae@1Ewbt@~^L{(@M|h({6LYhpL~#lUgb{?tpSDr)W! zNFpjnpVa$S?_JU$ty?Z$sFA=QE{+tJIFa>!M%y;FK5s*ffI059;V+Dxzy_C+^t;A_ zX$xO3A;zRwHQBU)K~)TJDI8KFEVdx2cK8}>@#R@X_e+MdGKz5$`;0szZim64--adx zohdGHreKLKawb6}`0DdOA}bqgzutmqQ4zTS)x4aiFVFhh0r#$o#JBnqRh>v)qe9-{ zMo2jKg0`tirZQW&scnt)0e@p3()aNNf^?$KrINpW(5WCZTHT+bUCekB`qjv)3Ja`i zI`^S{6N+mBJc`fUDdR2*KQN5zMt>I!n*JV$vOj^WVNd75IhpIwj$}MLDRE@JrsjtHuSien@G zm}wkC%%R)bG2m=|{bqIW4OBRs?DGOM4b~tH8Xdg+=cn)nYcoUnhW$(H$yeZugHgXJ z##Bw6S2OtWc|j_9 zDoRItb9h+i>$4d?r&VmNc&Q@3yvw~bazLpBMTFHrmqV*C_raz-n#Up1>Gq58L1e;6 z+nJ*$C}s7k8mLmck zi{26B3W|b8eqbOBrd;z0L3I3l7yo+&?X?UH$gpDMBp#9cD~}_O3+WtZ^Sw(CIyi0z z|8bvDd>v~nR)T6xLO5Nf0vp4N^W;etcaD*hip6iWokO8B-Ou{QZQqN7F|~_)3+v4sfAwk(zAK0RTC^3 zHu{hnr{qofq%*8J|NTVz{j0u?*ohn>^mM}M881wU^iN z$+7vQVzvH%>azT(KxaEs1ZXn%5KY0CoIO)_ljl|CIjCk^Nm0ezkRoatiaZJtX-)lm z+4=_F@fn-Et9&HmbX8VLS_y_(_+YC|)ZhbIM!C<}0w}Tag?LSBt$E0%71&fPIf}~! zl!Xpzck~FS*i^#`V~-`%`gTvexI_UwMK+50gbDhi+%^NaJT1}^M41KfaOgHJ@dX8e zxb)rH6IRCZorvYrbl7s>8SbYy389}W?6(PedaT9sDX21w>%ryq5=iTEnD+S$V|zA^ z|H{L|!%=m?g~XWw%+IQgUmF@ptYCu-`5P2G{q`D-oIEHwWa;sMRj~ zu05~AXun~@AnJ#ro6&iWiEtE2iYdD2je%x}6(xp%NeZ5V43vS4&Ejp(xYC}@r3y>A z9zMA6j9{0+E*DNrF8+CbdGABq@WWu1LHlfUKR}?DwC7R`a0ztl?mACef<-$pRM1=V>lXl%rXffJd91S2x_^`D}56!O9iL<`OS;UPpXDWD2Yun{Q~ZBz`D$%n;Jbx1*iV!lQBMBjX0*)`$6$|GhI z*qGaCUi`0BKQUIvfcXr1_!}SIe{)o5Dnh0Vu2%|?Z_9eSx}c!DWn--tVnanb>_4OZ{mq0?NHvbBQ$<6!RXRnmyih!-kqjc8qn7Ou3Xjef#ZVPw(K6k;!R`DvH{yKjr#W(HMuyu3V_g-+$` z7IlcZNZ}&4j|6wJn)dRkOE8x9I73|k-B-7-sHV2DR{0%ZtPdN!if+>2aBNArQnpf1 z{uae)t2$-Ag!F9pj|ya?kTzD2)`^6ouM7tfWyM$g(CkEn4!y!9_Kowqyx8N^Z_sMa zV+F!qyqtgDHFE9jVCknnm9`OdXV%xEcHfVbn1S?b_(heb#ui;ep2VeFT0x7*X!_c_Qk*XmfBvlHjI2z$v z=yHwo;QW`ynh5!G%=iahM?uSzHBdi^^DVK#Mc-Ki>so}Ld42iAKJ)+&hxF6y5B8+3 z^3w2P!89nw|8g*MBvR>o?m!g@c};LyZ5sZ(g%G9?BXEJA{XA6v+ySN6s=S}#6Mb>B zhX42n?o?2U*NoQMBSA89aJjyL1w2C%*letu|M<7 zufh5t3+XdZ?#DE}dwsS9cgkom#qK3O{Cs*|oO>VQBgG`GbnD<`P_EsVnX)(vytzJo zi$6g##%LNOI#^|7zI!3n6-{!e_?aG4Qu3GwbzYz0X|p9kF8|d)YICn#)*nG;@91db zxP2geLpIj-2Nm3394qWY^XQLC&HqUbcG?m3dH9#;*j?txhYM0w@H?m~7ATSDpyOpA zq=km^*oR>C6^+g(cZe8E5KqgP}aVD zH|$3o`^KR7^}=+M!aDMY7fnNQ8-5QmM}%N(EFmVELw=P#W5hQrUHzhH>jDJ%AVn5U zC+FYnb}g1RUt~6!!ZiBT>20$N;!9N!-=?3NrYtAE)WKix;*xu9c#E~(60KP_tzLIz z`(J!u^JZk%jB&lotDKckyUR4uD|_BSTt)PII7ngfbFo`DRe;LkbCKpoZi5Jy4T(!5 zHD&;hcW{q;4jT5G{js&<*Y@4hUAzP<{@G~**wBiF(Z|u0QU0qAVB-A@wJLb!bi}kU zLF085*!NjQ?C9gpJM~wpH6SPTUZb9`!?4}k$R4lxVf%sg@rrHLYjYl|Ay>p)Re(BI z@MG9)FbK2#en{)kee7_(!QJS3N?>c<2sc{x9YkL)eJQjib?TTm-G5T6v%DVOCFF6! zg)t9f%Dj2?7hA{1$STP72Fv%@Rd&W5IzF*KcldO!)pc@A%nFaO*rAOq6vYbaRa}*A zY%HqB&_2H{%PQsKYC8cX7Lvt$O^n{9J?3UK*JTR^h`n);-cNlk&jv};5VBB$ZCJ%Q zM!*|XuB6us$o(lP3$Y*vqO!M7%*-oDvvw^u-F`fnxoUFqo`D(dH|=NWb)zB?UiMOF=_ zbqMi~&GZkFi2YRWFuIKju`%Wl7Okka!{-)69Bs;nm26F7rv<^YXA{MC1;g6{1dH%5 zyOfDMxEs;D4M`JkySh<~(;NQGP?X0SsgcfD;I3Wy_x}(nXu_mth{%&K?3Oaz_5R{A zyUIAjyPc2<_nn={DRW3}C$q`x%w(-#!{Bia;yLw2aINbWFS}(wxw7LLZsp<^<}8D?}%yQRAwC&#GWef(GTw#5x?Odo4)* z#;4JD&mJw?T*UIw0 z<^Kne4;@%_BW!t#}tdq|Y=viqUGkCPhy8b4f!Qs8BsCY=RE zD2FB}EurH&?#r4xL~%-3g0iEu9Kns+vRrpfCc@wN{vZqE;vgN2)A1#L5zF*{oH;D` zuZqPJmi$vp`Mt%Oke~S-foWs{FFaSc6&*USR}s_C`UWDB!gAhkni%gJy6+ityBDI4 zQl$-WG1|6b{`GlI5e zDU2rwYEYB4ug5CzdC!8`V=~YC(;wnKDNXBq!8ZS6#s^^}RHiOuT^B*gbe`UhmE~=I zp&~Id7DaH<1PXHvO)XO)b1Y7&>WtK`Hi~ITit=xQio{u~4-~=nN!Z`zaDCqzL~_to z#QCp~LeW`^uSiqUdB_%iP_PRfHlwb|Opl+{=-4$=_O}I5r4>;3&JGa$_ z(_4`kHoyIQe@`JWLsg}r_vosn$0&rgYj>c*HbpsIl(=~tv+0P#SB!86D)zh`S|k6Y zqEH$B0ga?>vVAbnbvlnn1-#rcba}k2WHYF{*Q{KC3;WbLeIB;@1Rp#6MnX(EPicsT zqh`KDyf7p&hrG8Y{Vaq!h@uRc^3P^aW{l8z=~?dlg$GccT`{$XEu-lkLpjtw{vjGG8<$hm-lGX+M=MB(d#hqKYg^CGF3&`n(1YM?;-pI@v4}de zpmACBp=-XttTfs;B>J?iU0l=65s1 zc7y!na5QEHus&w_-j=d81b_%iGz8BLIyB|<@JrGdvN{zstzmR$WNoAd9PSkHRJLxB zz(4*GBs@ZNeobOtQW?zhVN}GDQYq%Rbc(7UQrJF@Z(@ zYrX8dFWUXT$OA6&i}6L`RL@p?kN9{Ep0i)>`ZDeiH`|K*whr(Wvqdf9-3e{sMPjzFHb_K3x9LZ7$21gri+}72yxbV#Jky38!4*ZRj%^YE10K zVoBaZ1@b{+ervXis9J*=iV5B9N=mtM!7MYRGKLIcpCV(!Q~66T2bD^U3~fsk-pZ*& z4p$f$*vAqHHbG_+b~Sjl4RoWCxr$*eF2Xz8SKTmpTYr^Kw^in8 zh|1N0Z&1)Pr+logE^>0M6%4#+Zct$PMCkHoaPx5qNC}u7)=Az^4?{s{75xF9$k8C^C zh@*Ka;Lej~C}@NW8HI?J4eQag%sCe*Xjm{mzFTSL4_S0a!JGH#)Qc$#D$k z!w0{7^(8rE8H+6BdJywHY$~vED_UxZeZe+bPNZ1M{LOmIx6OLeK-``L@nGT_b@nDY z0P=Z^0Dz}|PWt~+mdwR%S&c1`d~o1e&v2H8*tr0Y7^i&j>6khEIODV~t-E0* zzSP?rOisn2tL)*E{syg4=wVmEb|U*S5iiic6fy~X4jS8VZvQ=h3^ezjQQ`p&oZKwx zcc0ICY&=0~b)$dsn6Hb0b}^2-;R8H=r@8GD0T){e+--;PE@IcKD=zK3kamP9yg{eB z<6m3O_2PLA%D>>dXwoWj2zE5zrJ+u=7SXjLOaDd7D3^CEZfvXJj_m_0=0Rf}N5YJ! zw+~)y%>8II%t#?vLs)P6Qd3C`%wx`;dN0QJQA1II70k>Up{^?2FoRn@U)x0~4a{NT zc9Mmap5{2|k1ySDIyVk{M(d*pog=9_Vkg0B{W_w0d$HSHyTaXmT!-jIJa38}cLfx{ z?Fc)aFHgV==9kAl-Mffu&cJ&N$*jxAslb;m)ddWJ1CBzC?XudJ6xtNX*wrjjOCEX5 z*55I-ocY7d%w?oTSpEs7r<7aDj;4V`NUo3w6O+#FkAuCZ)Dh>YKT`w|E_I;B@*2Td z1@V{eSo)Oo`zRPFn3!g?Ak_)zyxPK3d7;#=YHFjAJ9huo`zbrL>k@zP=krr_Rvr}& zPdc07j|X*;l>T2dhngFTd@){Q0JKri(AS8#|GtpZ;eNTfDpEfs3d3pMaC@1k7H?Zv zzo))Vdh_HtkoS|*P!A`D1R~(AtnrS2U^)}6ebRlpI`FiBd{DIRcr0Gb@-`XheT3LQ zs)Z2f_Ka0H!~_6h(eMeo74Rc+hN-THi5eOUBVB}w4Qj+JqpR<@%0 z{kX9=-A@`nz9J-D)-57ve4mRr!cRzfOy6l!Xm%-v5zqK*bD4DrWBpZT>iU}re_JHV z*D4J8#9;&USln)n?^1ftVVNg{@%eAvP@H2*M}WF@0|T|R|CFM}a>s{jDnm6ILf%2) zt~A^oQAq7XV7RZd+)vx^hV6O5_ntVPO)#jO1U9pFhbEhpUSm#`j4Ttz%9AF{;52`@ za}@i{k4z+guG)uf9J`TsSqNS|^XhJ)pM&Eq89Y5eo8~nBe+br%E%*^>d3fBRlOaq~ z+n}ftR@69b5*K*g^oqPV%<3+4mvCw@SyK#55AbD1R_jI|O#d9~2N)BhO zbOBu?PJxc#vtJN5ccj!JE|U%AkH=$XSGlI%8~3o??hWwz->j1(#NC5)0FN+YwK;H8 zmiB1x;C6dxa^txNErL2|b2D?NdE@L_Kj-W_!?hS);=d%RXZs_A$4eI4?kUND!OLl7 z`$MQ0qV>6UC+~S%;b8t$>IK-iZ<`nJ;=$8`YryZ1m47 z3Wg&M!P?%QVgN|Tdqe%kQ`UYaR_!^mO*Z+Cy14gjgvI?EW?K%Yh_zEu{MYcni1P#e zTw&h8S8;JMhK=eSPvi0bqHh(q-@-R8H(?UDam}6Z-*{4;E$zIQB`mqVebX3EXDkq2 zBTNfHa`)U-Wr2R<5^rZ72!)-xL<;L=^-O#K{swgEH4LtB(I=8mk+~4WJD=42?*W zXJtw2jYVeYx(G+$#>4<&%1oT<+8%%36-4v(;>ZBs2)H~wnEpest=$=j8|b9IJf`Y> z@g=1Lv5s+PdrX(0{$pl__41zbDQMs68l&W_I_Rb|8}6mHe^Q?VE3(=0jpw1ggCE8J z^kVk3wmbs+tb$g4tNa9;T*p1*v(WhU>`LB`V9@xvU$1$S8a>~R!cY9CYtt@GnP~k_ zrWseZzWg0{S;mXRA)oB-%{ig2ih$7=DU-W<));XiAA~HPxyKP$3{iWH1N$@ESskxH5hNs|+kd85wjDdQIVvQ`B&?Oh-{kIjZUq|9? z@sFb6WE%W$MeJW2Kw0geDMjE%K_6)-U{q0d{s33H1$W}@t*u*2a*9x%6Z&{900OrM zr_KteDn~&Mg4GOMt6A-j?=ww12iYL!Xht5m7>Aj>npxg$Q<|GHbG zj>f{=N9WeA#gQPktBrtAO>%nhN7f(T+K81}DGKT=?5Yy_L`jI-=5ksN2DAuct0=t$ zO7pxe^);q$q|3#fQ`p+HnVh*v31whwftC&@>fv z-~Ercn$wdw=&`cfpa5TQu_ai!8SeL?T)c55r+fFo*rn^J>zZhz~;_n^R=9ooKAdMV+WXA(p=FtNtERk z6CIWWN1eLA+=CS#!1A0{RNB&Nip^5@P7gSp8(z?1dU&YDx2JuLFhuwj>O4}l`f=g$ z&v!oV_N4O7!RrBcx5xjR!Ji(K!pSNIlze@^591a1&fKtGr)dA@>RNx@bFY>qCieBJ z$A%TU*Tls2TDR+f^!{~e-s8`9L=fE%cGzWG@9Q)NY+7@)rIt+bi;EKpAD*h9XZ>o) z^65NrMSWF zn@8e+<2L@^)4%b!?|U_#t`B{>eD?nq)V7hE2tCwJfdZZ%uf*+ok1ZNA`%g`qS8ZNg zaDoC%gJ7oLMBkvd5wR6fMdMbU>UW*~_So>(Ga&EWfrJAiMk8HGUxW&~IhE>Sk7_P~ zaIxUvfmHt8L*FTo1_c8UW`$Qhk}gKVWo+oZHVVG>_gT9;5t{_9eEt10UpWedbUx-z z9`DbWaTlWkW6|HaNuU`df0vleTvrk;@CI$XGlF*{qFKcJ32C52M>|3t_=B@y-_a@g z^r*TUBvbUR04!(72(2hG5A5SU-?epgAGg2|i39Dz%^7myRuCONJ7-=n2H70bS)Vmn z2zId7>16vj$bU)tYsFxbIMGr+StSdB88aT&gdn8>BIvsPKgQ05tLLnChFvf=y&&dM zvsrTt|B%~^Cg@unAAPMf#dI29V_S+gCE4Q}58U$Cc5OBK<{+;&5Yfjj#B5am^Xyie zv*=3E3zW!K>QVU5yjw|KPG}rb`QP1^XEn?7rn;Z9A@29_ONc0Pv7;A5Arel5go!V= zyA&;yQ-;9DrKzB+{x=$^d>Jt?VX2o+Q;1B#2`A^xQ7Y1jIFC}27aWR&@Lyxtp zN<9^}fL|AQRc1Ef*~=TrQ$LK#1}h47e^|a_sns%|rJ^{_5@f)I&D{8IZ~tJ=$!UGc zg%~x~Ip@D+x(yV}yN*B~bieIr^zZnj_DS9%JVEf)m+`#?QSR8Zub5U&l4&@VFwo

lJNXm-`GE8=P4bjRP9un{Zt+ODLAQJQEmu!Rb z2dsq&B~#wXm^_5{wXxQNaGcIJVJG_RJHV17lx((cF81BLL!*Ie$sJ_?N7|S)ciOB` zDTxDfvb~6w8fBd*uOm-t9{A4n zpuDu{;Wv25dy9Fx!-S{vLVHuq#ea5$)U0`Aq7HHwTrFws@UFcRx}9RaZlJ+z+I%Fs z`M=BMjU#{P2h4`~mv`R=kz2N7FkQfGHmOI(tJK4ruN^hANtADCWPK%LHG<6m-+8wq ztV=0%F*l>^#~E|3En1N|tm^VM$?G>UoJ63Cn$xiPbCrn%p}@HKn+WZ=)B~sy8*zoz zrL>_Ub{tl!X3l(_p|~I};X-`u>&g*3iKeC^JwfEytXin$AE?0=4=t8wAvH&pd#vER zT)rr}{9CISCLMB8ZNnnI#Gixd{zOLfubW8hD@FD36yzO%9S3${0tPOi*#;+*;aAVj z=*AUvYs099Q}*lr(Q*c1J#@w2pm0krmm5IG1EAi z88BhTHk84zC^~wRg;*F@F|g?$)PI7 zO3_zY;gGOZ%`4|SCN;>|{(PV07~WG`>wvX{$!W(FSd|Ke9`vOLGN<(t$9-dYV}WBp zWnXKA|6R8n)wi$3$bo~}DLg?rzoxAh{7xp{vefxwvgHdQS{M4k04V(_tfo)7Aw`j^ z3ZNkU>AZ*40<1?!z!K8fMu5?5kgSL*j}82Q1?>4D|Jy85@I420mPEUp?CuvGm5#2; zG=r%Tf~?ei7mC+eHBZfC)4|MVQ-f3mdJ~n5ZegxeB?Nkk$#U|TRW;@5?Mf7bNgs@= z6g^0_u?lqB3=U9UF~zJ)$70qDzUPT?>Jl}!fX&^gn+x5DL$Iyu!rj0O4${ROd0v<+b;)l&n+;kpt(NN3@tVGm$o>RTAUUS1{WklTPt4 zaz>nqW@WK=1wtw2rH?Xi$5xlBO?m|&p1U9$d3&{2D`$VwfX)po?iCQmo$x|^>ig=ALYFr3 zQ(k$g<4sB0X9SsERi)wQ3i65AH|f-X?iNm8Cy|-{$Th!f^?`hZDKN8ZkQfD2>*}*ji^mebjXQ`U$O_o^o zc;!P%=%-nGeihB~YBJg98Chg@{xB+O*L$z(%VESUQEaj1X`751SVfGp98;rIzc&4A z`O(>SE$%4(eXi;7m(&#H1TrAOj*%mnxNkHC$Ay{;+$%Uj-S-xp&__Yf)#Mi>C^lN3 zWtPMU25?OzI1zo+A}T>zrkgRkS_M55_IO=7pZ|*aiBsb^kUp)XJeEO`{?s)N!h^W+ z_5@*n3Fq^82Ek|OpAiwK|iep-Xs9%AVnCE#qSkF0zr3LSWOPpAHNXeyl* z=|I$Vl^}^qbDT6p7+0uvvK&x__JcqBcIO;oDn#3I(YXN{3l6^O@CZT)+)1l`fs3b( zK`)RMym_84>!@ufUxnO_u7i9)+li&6(e6mXyD{**K-bbNs2B3k;pOK2RrmcKZ7^Z_ z&g-CyV%n)23-ols`rS|-uC?nNnDn;Y8v#lOm+rkfSI_q})B$ruA(hWsxYE&5Kf6v= z-@0xSyy(??)++p1E&9c##DqYgX5$HV!Zt@IRO$>G&2Y^Hcu4J93{h z{p%J1y)?BoS}X8eoQjV^0SCg^(Y_Epq{FjH+gMnMxvbgm}Bx^S$4#pT^$gkqX* zX%05?9Ek?|Ctk}e5$NE{IJ8ExMP3_H7a|~6A3~Y`N8nn(HqdzkB@UI38UBUeyn9oj z$Lu~EUm?|#nWg)00$$F2_%~dsT5(AL6=;|so-6n-X?HgRwdLTUU$Eb^ZP#UMb8$cu z^q19b*M|E`@9Rq3(;X~~Dxbbw>6i;=10fO~(be3M) z{t7<#=teX17)=y1?{@WlaAUd;APw2QEyO`jZ^u5wl^2y zMt(*-KW;Ub<|I!ogc6j(2Kb?CHO~LC*Bg7{t3@8d(D1_WsBj+qKHo9Gv7{s)(|SaL z{clUT0}uyOj~F!%1;?!}WW^9bcZ%0XCN9H`I9zGFubgYM{%IwoTUX0R=&q(h5|{hY zCQuA2dbLjtDWQ%mzJain=Pc*vSeIwBciE@ZpKt4QdnB$`uiF;7=^y9Z?1;raaYRd< zZsgffsc1Si*akf<u7p_D&(*Z+cXrEtF)s8&{A0O}eP*%3Qpg|Yfj$OCShv$bT_x?+L zDXf%(9iNWfZQ9`Hg&xwb2ZDTq;dtE_7pg;fxrUhWj6a~;ueu@d3Sm9dS3RqcfqMU6 zX5FILj30{EzG7AM%w=4Qn11v29qhu8Kr#tNn6-JUn8``&J3BtNGAyihW8~|%1WcMR z_`C`wZ~yoAV{R@9Aj8pdzuEiqOkgg5vD{ntB|ylkch|6B`1G`v#rp&UhIi(-Bt2R~ zh|94&sfXvM(p+cQD;~FxL`)$tU#Of>@|1rFR5Yex7n4ri5r6Qu1LISrR-+!|q0(WWt3yA_&qs8N_^97k2-GBcxyRFTP6Ko_D_rq!yb zNHKM0F>iOrz9v1_je^qP*|La~(&ZdEl)!VxV?buz$Hv~b!whdoyxM+CG#5cx zH8A=!WFN{J<*Z*UPL+w%ZS=1tWoCjTglX(2X}bpshdxRGqJ3d8>Z6qz&0dD{Usf@X z3iP-o+vS|=QaA7;J!>w6rM$qxY8;# zo|YwE?DWg?^Jr87qm-oF-JcHlc-aqjJI@qS&vc}N5e?RKt^3QRAwnIui`Uubzn{8H zL#EGQWBO7ze`Yw6hmljQCyvD~ANHH3knSfyV;bFli0AvOsSsn5VBM@lMDV5Frbc(* z35NO2{g{R*L3*$zI$54kKsCARo2{m zeIrlhz^OElYIux9pyRuhx=3>%na$UdDODW_5Mt;`RMWN}#Miuk& zJ3X||zDwk`IhXM*hPeX8cE->Dlb3iedJ>!zODVDOa*63J+TxC`=-D4`UuWe-G20AV zg3+zs*It>J8xRbAvGbK?(Zdc+Nl>1BUw*5~R|#J9{P_WMDbPiQd7lxMpQ@~AFH@yq zgIQlLo7*Cqypdj0G?I}xV)?=QjdL%5>QR%NT#U4;-fVN$aOiuhMNB~^okd=2@Psfs zuEYGPYhXu3{p+1DGtZ4k(yUs7gTVU3(|RzInt_>V}4ZFc3q6BvxAhfKZxSS|Z2s!sfOp1Pg&yA+mLTT{U@3f&w%#+@!j{g1} zTHh7Ckj|@h*p`CJOnFTFF*qh-wsaEh%Oq9H&EM$YprzeVUNZDBOcrm>b+Qaczbo9~ zab;;n&np8f9Scncn_FpffcEb7TCi7va|pHfu)!{u7emWgL@C$W< zzl@|BCNK}^puElWN2Ja=9#`PkcFLQ!8> zR}LOmT!;cXxLVYj9`#`BM{$iB&J9h#VeN(IRG!rH%EptoAV+A8Uj5g+=PKNXlL+yf zKcnZF%1sJX?~cA=e~W{>+k8=v$!WM*TfdLSz=#)>-(!ql@wB#o>Os5GLdwr=%4vL#$Gz-q0vx zKu^ikl(lxw|0kxuzT{eUHF<4s!*gucBh6Czy*R?tbgzX?uig8^sAR-h5%+r_QE(-KyGt!8BL^ zUtf%LU8=)#UwboR<7s7~>oWIz@{z)Iht?&pIbgR^Lu9e#U4q>4NOhjaYGee8i`XOZ z1v2QpVWrS>vX`<>UEO}Ax5>mK5mY6pxkrsg<-@EQjm`+y6<~n^el*Nu8C=jaZ*HTkF{~VwcT#CQG7CUtjlQAVE{LGXJ%FhYE}TEzG!tqj z=g>YKmIxXpJ3l`)n_ulpJsjPnA&J+C`t1T0Tv{2-eJZ3O$p@?ucL0VyW+AKkf*f1; z14i95kJ$Ml6h0f|l`JU8$1LdmjXO|TxqA)0>c7Ywwn6sd(h;MsN~k8d` z&!t7v$m2Jr^ahy*d-l=G6`|Wl5}@U`%c{6AX~ptJbtM$S=y!Ss{PaOgRrp!c>&&2}(PV%nya)yVeyu6Up9!^IceZDMo?gFTTcFjBwed5(bq3JqL#D1Cie$j!s^^DF(e^(Ksem(<*0-r8e zEBuc|^49Nr413bLJg%5X&F^8@)qt+&+2>K~?B~uC!OgO@?i7Tp)cMYNs7ug(-<0{u zAnPP@P%V0YsF%>M1%sG(`=+1eMiL<#niFcp@vo4yZ7an8ArC-qU<~J7C;d;-weMHk zuZBy0x0e!E@wY=E51R_*^E1HAuzn}Kjc+dH2-F7tpmV11V-bq7 z*n_gncKB9FPf}x!{!?ujOUSb@tH`D_Fljnt)}trpDZ}Gm?3{v1k5Koz&yiJ*vn^^% zWMs;!VBVZEJ>zG>PK4yWLLw66er$&&=WN*|9f?HBbEpF?;7jI^!--{oC*CnKr?GEu z)YkLp7m}bmen14xNAb2H7O6Wj*XQ5tf3yVQD2@In;XHx#on`C3cOonPVvZ8(oqL0t z#!k8KkP2hV$wTy?4*fME1)od99a6SCN%i~&v1#YaPFL2=+DJK#cJ1KPl3C9z(`|$f zS{;#ZIyR|kgSu=N^`!6=puhR&xA$J&QY)fY42At}Q@wqw z<*`R||5biM-j_l(&v*x2PCH&vW!cVAYo`fvYHkz@X=d2vp&h{TGGc%_jvD1{?fHp; z?RuQ=Ta+@R5UkO6A=HR6yw;4I@1c`bFG{zi2jNSkTx|b(`jhTpn%G|54jXHxor-fx|JTl zTL&}8IJg6N)<48%>?fM8&MV~nq)(kyM0Ka|j8C%WS`>z_1D_-Eo{t91ANQxYpKpeO zUX$5Z->+DunTb)~^s_)8&J^Yj?9upXZ-*7uZw7@V+jW;m1teeeS@2V+Hxe%tJrZ=p z<9zdI=tK)xmY=GZ379s!vCAuZu_w{*%RF5catSO0sWqJTeN5YpRiLMnuY7CkG=U7u zo&E-l)j^u{yZqoH;TOCy0SIM?P|;Yuc+^132ox90|IL;I7}eVV6r-m6=plGB}DWfNB4W}Ka zbh$kA$5Rb1AZHx2MRam5*kMr~^xiEtluPtnm>$e{Gu9EZ;C|*6qjn9`L;>{0#mDWq zBm0g3ugW7n2v8tjNlwPnM|}^eIz;j$Q&S}wnLEHHfU1E%mc+gnBtDcl`YBSnlXSZb z$Yl>>=XaGQHfSz(nTD)&QKE$R9_AlS`4$y9Rc0l0v#Ubgj84O zNPJq~3UIk)!XIdX@QwI?(_zM;*0knib)JZXlO9L!|+IGT=TS zHNkBLjd403(`L?--Q>(jAHEC-ZabXhc)D>9UACQi3`xuJv}+9eoh4sX%M6X(f>t6nG+(BH4zW-*H-8`r1ox#%jP!8pPhIemYP9r z`a+izSaS3}*HJ@@p22r_7Ot3Nn|nkxxZN-ZIV}B^T|Y7UJg8zW3jWjmOAjr`V*w3g zT<+Rhd=Hga>th?rYsnf#(xp_Ta)ya4MsDAylvq{O z*q=%W#Zy16+)0;;QQjuQi6~1E?VwxGGrGPtwQXM;>7;t8JXm<4LO8l*Uko; z1)fwp(cCy4-Oxz1U+m>d<6q?$xp+R2oJ9Q2H@SE?eFdzIl%F$>FEqx8p-UNr|tfs zx>h?zL|5fz`NfWA(T+w=OY=KlzQ(Wv+~jwhJ6Rrj#Y%Am-_F|T9;M)5NQViwU6+?f zZ~$#W}H8JNoc}Ss!u6B=QLu?(%rG0a@t6erV+5D?UVH=_a7V6qE{$ zr4G61-oFQ~+6-r;7C3KC&GNP5kgKA;Zcl}gtPGWsZFWewECK(akV=T&ua6%0NH<@@ zbpvi@(L?bKtG!S^u!IQh*@}~g0V3ZgDS5p;6A=Lj?xPpiD1Rgeh7yQ;ui0`XS0oe= zWv>*dX4pm65!Z_PCf_Sd<)k+B-6<=kaWIn(Go+w^p6Qd$9_LY73k_rs!k_um;PbhN z<2xZ-s;il9sNVCit5`z6Q30UmFD>ZdTEWGnVN`dwzKjWX*56$ZX#$vO$l%hIFvdIN8H?xqxfrxfIcsn zrHTdatOo#K2oW~Q7PDV&J1i9*`x-%JtJktUlTw{qOQ*1Msuc7^oRVAl=uUVd)h%|^=(UJ;PGJ*Sm=DAY&FaeqV=#P`a%5pBH5 zqQ##56h02MMX!TI>u&zcHd%lN-%fELC9w@j*~LFp=ON8*`zl44i{9*O-=LnH?+iUL zw>#TxB6nfR+0BT03msn;4iBI>60VG=$8O8d`u>DkXB($MED6~nF{}^glv^ed{5_eB z^^Tq`xSGh8Y*dDxe?rcziCm=K2olfn=|#yi-KFZA*;l=r$i&ufS%x6`^cIS658Fw5 zl&Wj1{m&aHU4kfX=ENSX%$`tq;K|QzYh0wIsc^Qggsk?_s)jmXD_5(x7V*%O?Fh8xlW9&EGox9i=@PFE|{(*1kCXG<7VqDmvN;j zc}&QZvc2_2hvoSEuOFp1)H^}jow?=GHm4O1<^J~w2r91B)q}1O_d#X`Mg{ykR!PfK zVQ0wcWYFn>zD>Ym>Vg#di}o|W0*L6oo%Hl;W}m7goKR3prm;HybJ_zoBOb{ zAtCth665|>7$trc$K^V-w=or&NTBr6R`?3f>g$J_lA z2a2@)nr!=ZcCz@R%IDp6YJ}h4T7{pIXq;_`T1cR+j{?hQ_HV}Bo@!(6Ujy};ir*&s z`t^{PuZu9KmmhWJR+OKBDz8x_mrv)MGd2}Cd~U{O7(yd3eDb=+`ecG%VZ!F2LW+1l zlBIv}CJ}53FIs~tqtqrWRub@jAkgh-fM`F&w)xFje#i2P5*+q z-_w0?J{Uu|b+hLYZ_;{Kb@jR4tSmOsk*E(b-qP(qJKe((?ETn(9eg@i6r#h^R!ag0 zuY)L`xefFoX}?>9c71l6J}NcGk^*8HtuF1ve+(ULB_)nVogPF@FMk#&8)~CqY7|bC zX;EgSH`aRkl&?uC_6Y}rJ+#)q@y_ZmM}}7_qAa_zE|(vikYhBiI%509YX>_w*&jQH z9N{Ov?vPT&wGdO=d8?{%@4ki^9iiMT-uN#nTtzQVj}MZZvl`m<|8MM%cHzgafJC_x zvE0Q*TjrC!1FzHHX*duwtV7|>;GKh#`#iU|_z;un+5jKW2w=0r&g_rjxV~vV11(PA z@%@f|4j()j19=@Z&ocfOEr2>5m!Qg+TAk~-BakaWDlmR4BG-UOFBEd0wivUEi-VFL z)mYE`1#tN5Lf80*J~+ksJ>nw|ilVy?SzS=+NusGZ#(w%1X@r9am( zJtL=m<2A%~x&at^m*yRDKBi|V`HLbpr=(p5rme^)(MuDru~@eN%8Hgl%&!tycNmo_ zHYkm!6xG%M-~u7(t_H@^v`mi8|Nl%TE~tXJOLJXuxRMyGJ?w5dSHkFRo(*-ZtL z4HQyB`rYKx^$Sp|1X>LaUJ+Nsc_S_Khw|h!5c(LuRq)bvqG1dp{IhiCEA8b(P4;?T zhe0GdrjA$|i>i_nR}Hl8^wD1?nK81E4%XiDGU){;x6RHSKrTSbA!B$!=WRvsdrxo% zS7adnkwe}<7C%W3STS9S@2vMe$|FU>pbGqR-Tl0!5p*`&bBnkSMWuh+GgmXi&j%>v zr6DKhA`wNJGTs>P701AhUwh$QH9qCNdJYp0PPcOcH-;$@_KT{<>?*!$6lOznOW)(2 zW@!9eM##9#&W6=xd_v7sOys%CfBwt!>L1@q*5dr&KiB)D#*LP(f>ZxR^YNoUrWdBE z=h^nut*sIRYo*?7Y}9Px3VuhvC+D#SS&A>eRI7P`ojd7PN$q&$5ARKIh7P6;@a?13 z#2OdnITlPDo+FjeKH|)~h7wW=J~#YS%%Xc|bvfKu*qh|!N!ZZE(9UOO3(ZQJ^0ev5 zFl{XlAJ2w7q{s~FkNT7>uIGdjT745%iZK+>1KC{;ADlXf{LqWj)sNM0tksELqV~rc zh>-#_w6Dw^ul@2=W(zFgJ0=mEex~hL|JzYL9R^W=DwbKtsn;I_8HBrp}8UNQNwCn8i*rS3C&EWkN001Eynw? zKz6+e!^k!33f4xI_s*8UN3a(Trt)|Mb!Z^^^0D{yP2pz#b!ig-n`u+=!;`a7z#by| zpWiw(!v5P<-8eCyM=27M)Zt0z4#!YvOcefFZd7R1MQyI9?3xz(q3=f7m#9djtuoee zVMAKig95B@R>v_=n_H>#ivKjxVZ-NEXO>qT&tJ-QVQEId9L87LSZ{k?46t-~E&+x2 zY|{tt?x%L50{T7Xg;M&L8=+W`A+zKKp1ssGuROcE(r}85 zS{*`8L)jQABc^dASYub6C`!9*WT`w{anX;e`n)g;&ylwEW=1tyY)Ddc!!QV!VRD0 zQf{G$@kg=&rIRW?ygxG=-lmN1rXAndq(@1~)b>GxP$t9?5|UIXl(*z^mGWqN{qoIa zubHws9*{!^uVlECAt1|vDd*t8d~Kg%6TbIP+dXBCifngh8FWyYP0@8%rnXPx#AOT1Jub+j_^>tBe9y_nS685ZL%`*}w@* zB=f4Ec<;oN0tBl0Ts1%FV1+|w)iB_Ap}2BGDvSBzv#b_q$7S_FTsxiwC$&aco1Kk{ zEl~fGl#gGu&Z8ZB&9IvXalOMgE9TK^Yx9GL7R*V`9Xns7jW5yQ;CpLV@(J&^oWe5W zvH_5qiJC3+!krkCDZDhL(t1!=N9@caAgcY!=ZndF;^{A&E6wW$GFBSqP((jp7!Cfa_kh=BT|3Bj|iSn96&*~)?{i6$EvbIbf@~1qEL|h~2b8FJK(erC{(E-~ z37YQhKlnH6v|a88Nf<$a)5KD@^Dh$0hkiAb&(Ic`J^3AU)DH=9zP)Iq4-dQDE$4CV zNc4pCa?AS1tO`Wfv{?vY(7T2Krbp2Xd4C$E zaMG|#i5Mu48zK2kjkKyy`(StR*E0yUb9BQ~;wEF#^e7sR|ME`D&gYXbU9uXscw3)- zws$HgVH{BuAS)05P!-#lo1`4oK$}pxjV{8L#?Oc91Z_CWX)_$E3U>qoEDz=pVSLeJ`1y2zLh8!2nkKz?=p(hqu z{$A8~YkV!Yv%Flm2QmDt6|v8$HEJ7rFr2Qlhz?{}E_mJ!PlGGuA?H59FJ;w_JAAqc z$;K{eg8p)!iz|%#z{I4S=l&=(s>RUI4@R{gyMO}XK-jB|iwx-UPhRgI&Xs#Tlv^3r<4w4haw8^VGs) ziBT{k?foOs&4@UOF|<)oi2@E?S~6r$4Z#EL$=c>ULQhZKdd~T@N9T}yxyb?VL{MsO z-<40R^ap7GUa11%~;}-j{V1Z|dO5TPv@&8e0Dw zGufvOqJB9(smXoXv85mHKW`l*ZmhQNAylC9k>2zE4lT8cy@!xO{3`DGPaL?Maz*0Z zwHaUqC4rbr1K4%MpvG6%)bV>~pUJ%G#4Mxn+qi>a|HpyDD#*iRC$+XRlWR)KGh~+= z%KYw&DHB;0Dp2{d*MXNt?pvxW=MQ-Y3$`CRI^vflCHRn}IHI_eAP4_hBLuilE=?MX z9u@a(V+I#l)w|-{5JBckoWp(|=g8S)Gg@T&RJ)IrF^wg>G}v!}M-1>m01#X`m(sD3 zHg!SDC!$Yo^%E!U=j+(`g`ygA45cCMmkXz$z!VU;j10~F8H=YDFgg^`++>?mbwjlA2-~NQS`|zEv(kNjAFgT_o%PY3J*fg z77_ zv&gUyHbamgI;FSeC!L%%j!ShQ+i{N6p^(W*^?J+jG_MdlmZQ)_ZKu3}jlyqG47YYfJ(OSd%z4?`?vmKT z+ng&%%ZsTXBFB>fNNX-DU`^IJ2Z7I}xw%FqqE$m7ziqoAdX)pj9DLtul@V5F~+c0F=w`BMej;06J2Rjc7iYdhIoIJ@4J=G2gJX zC=b{xfnju8y9UQ8hFU3C;7Wyek%e7Q7N-W)hwem{2S-L&s7Em zeOqVss57MjLYE`Kn9NFg5*$C|qn#6CIeT3N$jasrCUts>ONnmx(Mw%{-g-V33r~~O z{!t$7(M#U5v*6!5sfW$?G$yEKZ-*85VVz{%p@LW^X|ABbGk} zsvZAV8J~-sV&TO;IfV$4lFI;6XpLj{b#{^DuWYZ;(Wp&$Q46wtSv}6~wwlrtz<(fp z3Hk=V*%gz-&iz(S=cER|Ug#4jS$5@mZIw*+#y**>h|Av2{1rV5MJ9>WtH#Lp`8r)) zrPiZYi4(?-Szoy+9XSb<1sOv*?Lnl2%l$@9Gen^R#tKxK4aT*v&=bRZ9a@@97N8VX zND5dAqDvjg0)u2$;KspXDQ0LodhBJZNR;-EIiIzDZ3E*9g`&ojkL`RSHQ3QtK#sl2C@R9#t5idG(luI!delWS43 zXsEQNT)%Pg+NXxf<3X&g$vCRTn^Fi*$>Cab>4QsMC4(>u!cc4NDd{Mgd$zxL?H|fE zUbs+7wR-MaYn99aJ>Ap8z@{CP!XV1$is`SP?`1dIa=z%^VqBH(nXp zX@~uR(Xq9@mk(-<`)bCtUDvK#;kg;W8d1o1tX;bn=7RPtTV_kCb=bhNv>yIQTLL~x~4tyYWU7|7@IuIr|oMNw3% z)%yDSfLc8)l}hOlQ55k^QFgnYeIqQi=s6~|=!Rmy=?H_I3;}9YTg~S-I4Xk+P_OP9 z)?YsUByg3xTPeso*)otgk&L6po^%|BN)`P={d zzrQZ#rUKPkD1}L)W(zsT!AXK3O0PYUWKkoI%mcBhdR`%pDuB`WF8l4j2k@CseeH=S zAN18Mz!DfMGk!M^MWt3t>F1I;+4|?B-V|?YyU6_Q*jo$}6KNgBI@TtAz^Bnfnz791 z;t~i@Qm96^Im$siUXPxzV}KN*BjfGV+p){k&RzSv_n6w%o6qDt=ifHKycs;cZtSW@ zmfpH}?LfJvq?l;>1IF5nqvrG!v#we^REo8Ec55hF@!$z85v+~1i4p_xu&pl{8ozVt z+BDegDw%Vgg6~c(W_?HbuG5wEr*>rL_H^vrSCm4yO8Jh=dF~6A09KE6Jx*$IQVEk~ zqm_Y5uzI{UR0~T%T#J)(7+1n1HpY=siqtr6+zgJAo4WxgFTb_K*2Y?k#!hghbd^}Y zL;GwBwI-$rXqE*#2pq7OhI@~(w#6N?mI;k#wwxts9gQP}BR6#trF5DU(g6bLrF4|=94R&>oslk@wdAvYKI?0( zbsTH0tufEeJKE3zxbkf;-e6reejrU;@hv{CQXM@ZgyT3;N-3pM%5j|Z9nbU9chVO^ zh+Hn0{+Y|=eBYN+x~>a2j+4IcI8OS-bcg8>>6B8I_C!I(baWt_%_^lP(zshkkmHsn_cpT;;ZT1GHd_Ns=Tr8p1G4 zzZl1HY8L`g6zL=mYC$~+qI#gUj*{4DZH$hSL?=2)p>=atS{rMuiQ>2s!`o&J2Kwv?!50f%Z5wkAl{CPw*C}v#P4hO0|3e7jNSXDV&WzWa&rI*k_2zufaSFcEmGh@}Y0|YWvJDn1Sr=dZEdP^V61&=sFd@ZjN{Ps%LGD5p_D?1 z*osIS1Fn=?$#iNRoN}BrHku@fj^lJOw&~cPO$K0NqhBeN&1N&1Oh-qD=Xu3qapugK zJv}|Wy}fhh%<1gx%x1IGrcLvGKbOmOc6NH62c)LBBQ(lgIxr#1P$Jc{ezyiJux{gb-Tmbcs?=qqSM;o2Pe(FgCG9qh*9_M1}MY1!1k( zq|^B9kmw+j@ql_gF628ex%e7j)#~N%ecySX_~{)Z~z5muT-f}Xq@c!{) zv3T>%Hv>EEv{P4iAzuX8dEU$|`hHOqb#--}fByNv4m-?#>s#OYhs%BseCIpg3B&ND zlTHG@_O-9oYqjH#I}Z5b7r%JkdFNeq)m5V-Bf$IK_r4$h_{ZP*&Ub)?3l}b3x->nf z3l=PxK7IP_x8DxT*&^{IYexRWlBVx-^weK+2*G9Pj~|Xa_TCebPv_+;kCe zkd!`t+M&P$tCj<$5j_-?rq=^twG1x&4AWmU2t-*aO7V9;oB@9N8lTbXpD!%{(_S%9 zbvlHJ$`ycbeqhG0Pk8z_pF9kB+h^~syP2a883&F&xcHslbJ@Vtz{lUy?>{;ancSw% zo76f6qPVJ)$g$Iaj4ub)tvvp?lYv*i>a=PlDircSVuxKZHHsUV1nJaWzfdlPfaBF& zIVG_}R%d`rJ{cb~()IvTrm0$~Tq=zLM*DrenevzmxH66d>G~NUiiTR}Ol*-Nzgb8j z%(J@tGLF3DjANh07dJplDJq34g{z#jTriE9wW<%}Bo#5#DHB>7n`o1m2H#-fGBitw zx3CBe9mA9Hd| zKR>)|=}4&_YbAxhk*a~QRthn-BR92}RZ^}Ts|?q|f2PYM1VRXja5iNjTc}5IHH=n_ zmhWBOP`q)ZNXbiC&+(M>U8f`C_2n}=bQgE+?-W9Kj>>sXN5<>Pd3o>Is7M8|E`@O^ zh{l3=Jc!nmYAI`fpc2$$ohs6ViH?ntLZmHqH%_Yj0~c+=Yh!JwEgFdy&Bc)dC$+QI z*JwOTZ2VmzaMOB(mf}#VJqp@1vVYcMu*TZPQ)0tgdyAvm$s-D-)I^i76&AHE`p^WV z_Tttaoka>|0F;UV}A; zP@7QeMBA-Qp-fyEA%yFBuH$H}lQ>S@qOG)eoh|Ku!vo)W=beu^=9pb}+2x#b&S{;7 zG=A^8?$#@%{3Gx$WaV%DQEcYV^crfddCCjlGB)GJN{%|}Xf})pfxsA(#IZJ7$2#pF z9@J~4(bC61@rkFGE_vk9N5U{f2-t4cKj6AK|Nk@5?VD z4s+(rpFjV?3oisda{l>+Y;MU@i-G_5t#6NyjQ--npPg~W8Nl^_yRNsZ`|-yg2X4Ia z#`nDEJ=JOz`2P2Qc+4?Jz4Dc>1p1~-O@kjaZ_JcmwEkReoUAjA@G78nInhN|D!>Sh zNY;)Q05x;Wx;{*D08C*efXU|<*n!(h0J{d+YEpN)0aLFE65jto}Y=HSdjp`^>A-BQO0VafTXszD7ok6 zML?3(ZXwd915kJwZ+s-m1DF0qDyNrt6BHmJWK(?8-hAWVjyv`hz;7?UxNk~F5@vyV zG_dd9hum`OW55Y7+y4hY{LNWszdrr$Lkn+RwOk#3_|d?ffB$`0&mD2(VYl9TE6~?7 zbFV%34udtojW^#WwAyFC-GPCD)wkR_ocgr+j{N9IIek1Gc<=$nm@VEoTXSEzN`}qi zgNdQg#&hf$kaN{`vHod9Cn*_Gd+r#P>#bDvp#yG-dU`mX#x znj9Fa1b=^e?R8JCcwohlu{NceY<#H3*sQ0fcjh~@p0KPf)dtG-7ZiJ{Sq&m4%H5(R22%1||2U8;@Nqf!`G!nhp9r67*ANyEV{YI~Zw@*L%FkGTGJStXj8oKV{^F^zjc z2uFz)_2^mCgf_+o;$124OM$yybO?iO`u`0EQQDoL_4_cfapl%ra}$3p8;Jrb8wT|R z?ocCL&~gmY*;s3vRy)n1rNj}^cVwz7Dkk_dTea*0V~Dh_$2u`--v!cGwiH4+j!`NU zj&fYzQ4@o8>36e^^c@)+6D1~2<7wOK2?(JaM>&o)CYAFx#;_%7(6(g&rcImnwzs|Q zh$D{Z?d?r@$!+|f!bT2yD}N`Y^fHrcS-QKX^!A@~?l~(~uKdI0mtS+u)yA0ZD-kcH zNbR$r9{65CiiSu_5Y}Qn4pi%Q?SQ|0`EsCtTA^=B&d(*l_{!BMpY*C*Z@C+|{`wpD zJ-Bc6GCMH18d$Y*a7yp&zP_Gxh*D+ni6xar0lXUv!Z?7Z{NuY29=y1To9Lk>A)N>A_A zS6>Z$^{Zc9wQAM$>C@l*<~IZHeeZvsb=FzMVi5?#_;a88TsqumKJ%Hkzy0lh{p(+W zEB<^{6h*04eVXW~*Xt8q?uox|wwbgQHl<6m?*ZQZ4}|C(pc6;Ou8I4AH}zzHIphnc zI`MEi2X+O&QFIj5s&cdOM$_2zl~6=Z zEmnZQ08F2n%|_W>`kw->9q0_4N;Q)J#eB9r9wgQSutT4IOYf0q8{naf=j?IL@{IE8 zIR~f(^%ot+3C9P(*KW=#YwP3Vz_iZZooAY8l>{DMU90+~9Gl1h2+^3Q6x+-C2Wn9)nuUoCQ)AN9 zH=!t=UMY?ej#5mrVA2=XT9WnofkwKZ!9q4B{WP^D8q6X{OAcC&hm-<@0tre<2_w~@ z97InKjo-6;U|MHxR%d>0Z^!h`e9?Cc8MiCrzmQDdXNh~35B~k>wYNRJW^Jjajd7K7 zHg!;G;D1Un+h5H3jwNa7`#_`%xRj(a^RM=ifC6$y) zN~NTul&h3d(n6dTyf(^S0a|2z&r$!hxc>HA9Du~y#M;mx&{E(?nKFgaj(e?z+l~+K z4ZH%`ijYqp$k^0XGiIWbV653-KN}p>GmhHyBbwYHG2uyMC;0=`T7xx$#%j1qstN4z zt+o3bM`43lr_};9wU4DzQYj^+N+YvESZk|M5^Ixnl_SK&5mGzLm(ug3wl+*mY)ngq zX`AjtA*G{~epyfHSKoN zU;ofU6x+D<7E17+#TBz2a--dB;0#QL<2xt5?8G1l@`b|v_ujX5aIJmLjhQAQiIs8; z;QD&?%F#RSxC?mEi(Yia!Dw zS5J$f(W0eI$l~F;?k|7&%Uf=_1(>(<4(FeL{_eZ)4s>*MJofmLKmN&uKo}*9mo5MG zC6@wcoc-2H5dP-}KKO?#{tS$kD}TP`FK52#4L~vHKfUP5bb5yza>S8G9{K;-d+&J5 zva-zo`>wV3KKZ7)w{lhIoSWD*(1a!pSwKJ$!H7EIjA?X?qrcIaanuYdGRaXu-pSbs4>;3()_Br?5P@$_MOug{wI`^C%)?Pck;d!6u{qKE0 zaOB95dc7VnKLaOwxDslK0H0%3qQLj>^Bh9D?_bXQ)aOPw{?b>s0lVvaM$7r8kr3W= zM@FZTOE+8KjCC`WR(B?zDrFNuGU7jU^ZYyBc?qyVzS>GR`%w=Z$jZ0xtmI{YA9{A} zeP3u0&8~HcW$GdzPWGc`|LSkN2XF~4-K_Rj;5YuqPt@GQQ&DLOh$q_3ymH{-y8vfvuXt(i$_+HTA)CYQ|!;8SIzrRq)?9U zlPVV69buUxi=9IY?OXRAEyuPTML{!Y(`ap7tvpdJ)k<;r@R-ll<7CZVcKiP6kKVrX zmOV!nds$L=x@&l@VQ%WBctfMwD8~Zcb6}x;c(E z!4M?)elB2H&oL`~ot2H1%ajpCL}F`gzm611QNRK9&KHbCefV_9q%l-0SiPg%`(Ez4 zne&R60^1Y*8zPV}jHUlV&-u*zvbCki*i~TwU`1+)^=h5h)VV$?@{!a8R0-X!rBV?I zWSR3`S49FR8vs1>+0Xi!pZ=Lwy!_?0TJ6M3dpIRNiQxqF>dWPE47~^Li&^&Fsgq)? zxpHwx4h7TC$N5$76|-z{?SJ8mNpM5UJ*E$-Wdja-iHZ>{CFRywuUsm>^{sC{W81dh z`t9Gk;f5QsEbBLJE!{q+>b>~j+&3E4+Ya6R^ru||96mJbax*$I1w8oRgUx0)ysDo0 z%%?l2M-I;d-o>WWOGJSk4?S2aJ?EagAA0`tUIH9Bys&NCwm|g*bUQjbbKrHaeKT;| zH}8m}>iVfIK&N}}mTl{Uw_Pq*P6(}4+t>rPKk-*($= zfBn~gO}}U3v!DGeaLX;Xq-pxIKl`)4`@6pjyz`y!{H@>mtK{7<{MZlGf#+Rg-|&j*&2Os!BkHdCZ+pJ)`3>Mx_q5;s%Cmp)*Y5;OWAV+u zJg(!5z)$}7#{2&3*5Cgty>Z_zz_&JS+Z=u8yS@s%^jT+r{K3|*{C)?x=f2*Xo;w<8 z27K>3p$^BKm5)=`?F60;>PmM{HH#7C-COCU-BdG=F4Ah14(_a zz_0!MM}h0E-?MpB{I*wq4fyMii*+iD#U#;f(S6Q`RxgoWK9b{Ffg(c>BJi_aB~X_A+Zt zHD3D_A99P8I9gw?j8$VJ2FRV?H{YIVcc1Fs|4^crp%2pUDh%#^KLU^eO~?@W`?Af^ zj|~4Gu|Z|P4;qLE{8|AlWW<_c)*eH!(3-ZAdZ?c@Sk`UaccgvaFZTnuS3e{eAOlyY zNJC&_`#>){h;t}53m9XE5kvze%VmG|-*e7u>I+r_jEPFophI<859C@e!O$4q&Rx&> za%4)8HLKv6sz_*{GLb^4d}dzrL4);4#sjLMWg?0q@4a`p zmpbHS=$jP-(PF2v>cGQKs}Do~UDN9xo~V8@Z_uN^vX-~Jm@%}bmo+K}x_Z(FF5dAb zKCJzm=RW66yWe=nop zpz3w&Cid??v}yY|P%dwpote*b4?O<`SLS*8*0;YPIL%3t96562!pklQyGW8`baeEA z2krx&{+vy)DT)km@#X8fy=G7w=yuX_>BJAfAN|oE4IK-eZu+{{zae<%Ns>6H!J99Y zO5JYv$AA3Cfh@~ft=8=9>^t7^4!}8=rs)e_e0})bYPA9lsCu#1UVQ1LKvFKXTCKrm zS>E=&?4^G``rs3`u&~f0`+_$ZPoH#HCoJotHu_S z+~IOy!6h=2wnhQsCiEfZf%Sdab-WB|xzcjY=Asz*wLi>&{DIp){^hNi%Ykxj?5?}^ zKhT{AreogsckTU+29UI-I`xN=)(G(7FZX``GqdH&SVvuUP}${HEuhwfWia`S6#3 zYhQ4!P5kHo?Q3Dha$LUU-+E_F>;qh;fBGkXGm&in<3D{LFgKU}_51$pp#;?5!m^s=R(10GN-TdUc*`7p`l_;MzFh8q~ zs<3_v4%{jqZB5Ys@<+^IPo__y9s&kg`XEuD`4a}@prP(B{UC&*Qc?UA8?hp@?e6Cu z*muYN=}R_FoVjjfU9DUz#a3{N6={@{Cy|vhb^gI4b9d~Yxq0{D`wz{{wz~+CG09qB zl|g#78b=eg(s;EL8KbB`JInXZwHABX$*V~`zBaf7mbbDD^7^Yk53emDx4N7h=CrN0 z;aSVQ=34Zj7V$u+42T55f#Z5*kEQ7`{x$_I)H46{veA`->1 zjUr8w5D9qa)(QZYZ{tNTebEp6!1sUWo4(7ep6q^hdgT$D@P!|EvHk5T*yUoPGW35; z5&A44#6XaIu(Du7L^tG3uO9Wl&t41NHgNHm4S0>kr0>;u2LI}C9imV<@`@QcP>&ig z$ncIrKv!(ts~Jj+ugZ^0VB8g79C9BuC%Cn$AgV=iU=_R$z=hfCmn6c}6{Q0memRFo zMhE9K46%PZtaV|mw(t7x?|SoF-*V-ZS3UUPj&8TD6v<(X!Jl-K=#Z5w$^6_R;JvAo z&D_G_Fv?CZMGdfi{rZLGTs0a2_8qw2tHe~s$Xm)geFxRmC; z$Vp}$ot}NTT#bRn=HZdi`eLgEByl4y<#Tg$VX=NM@-Z#2sRl%T=6q7F1W!H7vOLYg z_s+ResT4%PRCQuvVsUXX;E1Z#YPZ|XU8vke6YHkJ9@Qu!CbB^2xgUPYMzi72=>F34H*|n^e$O8?QkVBO0>p<) z9u`Z0m~{E>mS>2TCl6MR&2PyTcL26p2OgSXN8TN+Yyf8UzR`ARzPte-nVXg@?Jfe1 zii)99N`Sf6NIsUdGc)c-fNTPrRnl$_WKm^A z%1HLA*KY>?{O@+p&FzIn;61;0!`97PzWDhj@S4|NYVAMYe@`>4*zLtX_6zZsKK2Em zw-~irZnBoU)BuO(+JEz*-_79kKSQz_VBI)K)IZs zOcU_Rx&5}Yp;+M<75C%XARCjb47fH(*>y09Y&njMNbZ~w(y=Go)or8o$$F&{+c>hxV0ew$oy57!6_BKUfpM_uQ@PrTVuETbbzSj^HKnMpfw1Nw0|l>|4NhVxdgNZi`=h`^ z>d=wO(vAkh3^YVGj@A3MD*$Q>clXMtUHQj<^2gh@Y*XAC&i-0i?{H8a48A{!MXDvV zN<%*ID>XQ#8biV6EXu$imqMs{cqhS;br1~-%(84OORFy>`(>>e?S~Z0UM+(RlOOz( zhnImbVhi-9+`f^z)bmH_yNe?{>SD zN+qO_gCkz_24L`-r&*Y~VIN&p2e_SXw>$VL%d$Z`ulK&&?GDr34sib~*kA{06~-9n zoV9a66veo195B$!!!8TqjxR&mLBj!b@VF0d{06{A;0CVguh4}q#0P;!FJvux;R;@5 zOV>+U&VaPHezI~Pl}W%lmn2Eh!7$~$fj`u{4EW%!RcOObphA*XNjL-~Ik}-i707cB z)hwj&lXf))=mjzcYb!hJ&{OJc)PE5|8hxw!T0^GNQ zKmEYc7Wg5uA}r|+DgaM$@WlzuSc~_=LL$e((LPQ#97wR@@pbGW3{Xn}2pq-^^l}z^ zS!_+Cl#Ev5Y7#r2chaImPthaI&O=A%M5G)=^-^3-Y@?h^)vJ@Way5yqk#c0lYvu7u zsT5oDC{FOc`PR+54nJ^Y?xCX#JEs>~z04~{LZxC2!k$6C--uKaJ5o*>rMQ+v;R&Xw z80lv2;6i)0oeGaHgZ>(qL7`f;Je@yi-yA@w`|Gc7{?q&V7hQku_H#W$LT|(I$%=yPkQqdlud`DOG(htHY~dXmLNcCKnMkuWpr%IGVMcUihhpYI*b!MWYFq*?{nw8NfK+V zHB=%Z=$E)rHHHYVX!yE7<`<=m5V)A7J;}0TJk_gQpZSbu9656IZ$9|fiwn*EB%k6# zpwVc2>|-AT#>U37EDIjeun(uIwOTC@`W3?6F)fFDxv)>s{}nj|dEV-?eL3nx@A=<2(UYs34b0&wAFg%;<%{ z2flDcsW)a#2~d+g%I%+mr3es}*ImD5Vr&8+_x}0Me|`wSvg}D1(!f-8%a$!mi4bcy zY}f!i_~3(2B871jMb5c!5uU(5e9DIhrE+-yoDBj!OG-U`7LH{P*QbohF+PRAa;G!x z?rf)*SQ9+yY7z~2zQYxjIyc>NM_a0jFe81J$cR*uXsn!6OHpj?NIBU&S{p4VfDvMA z+gU!}NuAe_RShMza%3m#<=EP0FMa6f!tMK~?>;blV4GFseIUmJf6neQ&owr63 zYl52Fu_A%hUlt*OUD9M&wwM+X!f>_b7)`(~bWWI`eD_aMILAe<+7=$<@uqUvP1mJf zRfFOnC-#sj?M!Co=NDS-W-mLkxad?cX5C1=Y;3(!-Zb8*my<{+X^|xz&YcW4I^-k| ze$4tcthm5-pqY5W|Em4G3Ko`b2!D zSi0c6lR@wz{ono26(Im^uiZ>{9y+pnX8yp;Y&%U4AD+ow-tG1zimK&m*_z3T#>7ZN z)B)$8v8`IEjMvH|C0jxiD&qQ~L=Ikx*uyaV-_RZa1oqfdDq@c|MqcykSAOzSum8aN z{}SmJQ%>n#|K(r)<$+r^0N8}|Rk#*H{(e|NDLCT8&RmvdA<;gFALt{$fhdadJP%p< z)hc?!s|>a*A{SqLF;FU%2Kr5pR3-YcvcZuWV_x(6Uj{HgR&wiHAn7+x#;D>&z>}3~ zThsx>ar}{wd?d{Iuu%6CX$9TqDy@t_!&)kpPRPRfxQ?w{E(hg@6R-e%i?~E9nYp3Q ztudhDE24rW*}9>wk*8o8MEdEI)cM1UoukceDYDfhYLw$@ViRkv5u-tcZK!6gC^+?t z-E_Xw8+0-RmJsJvQRj88lOAn$ySeMPP^&`;1IU!Q&t zw6!L&rkX_6BrZiJwkEbFaGL~;He)1rey-D-Zg$&QJ|M+;q_!-hKd4s*-+tJ?AGrC$ zow%n#JKq+z0y0zx{NaMAOkdV*KsQwI0*7LizyQd#9BRMj$5S2Nia&;=%8CJdpD(GE zQSb@NkbC*WK8nIrIInHzjB!>Zu_m_0o}6^Un)s+eVp)O=%g`Z3$J&ZOz0nw7H!-M& z4h147o)X_**!PLZ6}+(MSm>mkPPdo)*=Bp+;pzFs#bz&?ZZ?B@!uZ%|*)US8p1E;q zqERhbJ6W#*Q52PvsMb$!+rD?&cl3rXAsu`-RLNcQjnaP{Ew3T0Knx9`aAaspA_clh z)CXXY;QF&1EyJ>|j6C|9mSOigI6cJ(REGZy>H7T(o$2}Jtq<&e;Ly>-)6=~)?{+&1 zY35Wlws9oXYxR1gCgi}OR$8mpHcX73yJ>Q)R!L$3V^Bd1Sd3lf-OEz5u?*E8hEM#7 zY!DnNTCX;q^PJ~?;Lrbpf&Abp*{~lUMbR+#<-j!$h#>kdc=$ZgA*A;-pz8&`b)WWBwH_gfktHe8pzge-RCp|Whe!Flt z&%1d()9yw_YDrQ{Y_$|s;>a#}y36`lhXFRKnyUsM$QmZ=<@NQlhrEzK^SSq#)6Dxk z_puRMii5Wl^bPs|0SWAlQDh<`kuixiNo0q0zEstDmEeA(sq=Hqbf(?wWH~3q{4Cc? z8l1#6+Hi-UJ3})SUL`Bf;A#6dwiWGys+zL~`d)^jg8s!>U@ZomO#=YODInAO1U`eD zcaeV>C%Z~q zrE&zWXr~S6e31a)amzQSL;vq8bIo+I+v{|@`)B8-7v{U&?#@FqX)kMbvvx1d)p@MP zctxTJYg{48Bg`EX@u=sPJB@RoRciqgnTky&$3`Z`$JULGZk-yNsFhhHnVUCUdgj)tTB#O*OlW{4 z4L##SHi>0bh!drV2D5AsK@@)E2Y>Jv|MSn!Oiw?Wdtl()hxES;ao!L7fI*NTtKL$> zn_A)A5Ax8%!NZy*>EZxY2cbo;*9-l`YmVm$wq?iV0209q5qqrh;wdOR$}eNo~-dbwzgWY+6**R!|yuyXIU^X_`m>T^h9?T z4BNmj@ydL+H{Zn?iHxbnQLPkLVw()L0xum>IOL(zEJKtGNo0c5)PRU@;J&OLfb?Z( z!*gpeZMx*R7b)1xYp0jab+d(TFU>uxovP(=+Op(*zYBNh2Zl)Wk6oC0YTWYQigpau zrf*3*)^Vtk4`}-PsYY3`mMr`Fgq5m+3Xu+NcBz|3hqrmWu|0KcFv8UPH0Zb)iA5r7 zqQJ}a=z1-V0Rd9#jr!GBT_NOsH(Clu5gSt9ZfKX8l4Y*z^G=@U&d+x8JqPBe7Zw(p z&4Y7u%}ytCZXt7^nKv4hd;#*uXU>Q*YBZo9`v^rvB`W2yil-^XgKaT&M-I(I)3fz* zvSD;=YP4P|l`qY<*UQmZ9Mwy4*+!8yb!*I0+d*(+-7-3&fcYRtyb%H~RCQ)HrIby2YWL++>f39Ydr-Vg0x0Tob> z?Lnsc@N8?>p`){To*Cn!$g3Dp6A1D(@B-znX@(q zM1}z*%luuDWn#T6;))abo&Fe~`(ODbNwVVH8Ec^MJe~}=O>qU82qo=yfl{fgJ^%p2 zsXXrLtB%qS9mNt~*Kl&RZ$pVs23U-u%A5k2$e7p!4k!hS3COP1(4Z&S2660hnn}LR z{izjBZa+0Rz!4RT3>@MR6sQJu8{dZ*4R7fQix7f8?Ugk5y}UQm?pY(H$d)2oiESm0 zN|7x{6^#@i+_jwgB|@!bHRxlGUk4osL$^bySv#-J`JVIhonEt-ce6Yw{+d4OVhOaf z0-8Tmt68dWvW7$d6p8A;%}j*INdA~gYCbh>t*)EGhM_Eji`$)OO62%IJ@x(llQ=Z* zwTqH_BLuogX0@Dx zvDPZK>s;2#7Mq86?AfQPU;W0dagvNwD;w5Lt{WSxmP+SuohZkpv60$HC290oS)|V{ zGz@_1&y}b|!Pj?!ViYy~ZsOo2C=!bwjvLj`Q`$ZD&d%MnZ~9Aj+%-GD&~yII-TSJg z_^OL8xc-u}H;z`S61aSpb|(cgR1p`5C!~MK4iV@Xz;t1EhkJJJx#=6CP1&(NwWub?cMp%L*tFc_RSlfb=f7`H%>Jw zmGzBsx!*Ps8&N2rIm7|`z5x|?;t zA0;av7SexzX}`^3wH?P>_L{0m02`S!&6A`M#E9cTfoIvRbS!`4ICTluY9v^m!e3*6 z;rCD~F`=5_98Vt9o`Kh;n&){bD2J#jnJpSEPS`EIQV+}eA?%RJ`W{_~dCW4EDH)W5 z!YK&-Ckl{Qz-3;%L^cLca+eR-TAxIO(r_GjoD+94j_lh%_{COs!WZSEvTAG-Yu@{v z*FK>Wv@{C?sjs!u&%R$M7*q+0>H&pf@bG2_+k8xhStQ*l>gAm*?_~L0r%2V8B3q7a zDYE6r23&7cFsrYzdmZw9bous&{~Cx!4jyj3%yrVdo4ZctI+@Fh`lN~Ccu-CXN0?QU;jVG%eoKi_P3I$7RJovK$w z*d~>Fm-MM@JJ^K&tn{VYFFE;CCi@o$4_w5+1Bo}U7zjd^> zu2f_fgMT66xQhx(aQ%IMy9P*&b;`k>`}(fwTW-Jq!TmFxG}pK+M%1Yk?D`mAG+6g* z8>;FQ8SuU#B1ADZCIWmUViGl`(^}{*bmr52&CH#>b<5P)_{C>zn5vcQrAo;ViCK1) z=tvBKYnYm zss?v45S4}vwmMyFZJ{dlWW2wFvQlWzs3&naG1f%=V>!W)2H=FD2^>D=qMI=|bE+;% zh6*ghr7Sdb<0GhQXo}FtxNcsy#S&2z1y-T~q3V-j-g|3p5QwN&tH)dPxP$!u4}EE- zlkzxQn!B;eliV-Cv3=7ONUC8#QTX6jwHz$f4VKz!`_~?)7#_%~8^4>mPL`_{dAsoc z*h*q;5}DZA#16O=#h4;&7{=-pLTPrM6=NDSe9bQ;$b<SOJh>O%w;{ zjN*)XRd1KD__pY-7DvBp7Q)7YTNcJ;j1R<85*afP4i>%ZycP)EW~RHcw2IOQosNbz3)Vtk&Yh%4j)pxW&{xv}^yNqlczji@@Q- zb9w5$8i7)!)TlSc#%mL!^>UJ&d)AgDGN>Fm)H-_f=>9`TW@Z zH`hx)bkjFV8uO8Q004jhNklMS85NS$wX zIergh*8b_ag@r{CQ85ygaDr1K@lgFj1yQf6B6*09axo#iqExOK5o_aE zLK}h-#ks0=#u}SDZHnHuckcE*)8G=QSi635VxrM_*)>letJ$eaWnH}-144X401&XW zi~$!;@ppaKTmHvy{r8!p^QU}$fBp;q_s4(Y9e}ajUe7Nl)L$c!Y=_v#@ynl{Vg|*L zoMiajJjl5o=k;eyBXH_Fz{?xH<4wRnfBMsduuw#XRQXo8?I-(cSxcW8LBa^FjaRot zDqUb~Z0zXKqv3}g5A8bl+;gM21oZMJgL6{~BH#P&zwgQ`F9*bEr92h{7F^yv{@S|w za*G_{UI+3T)?y-wN`SRiZM2lyv`Y=X5c>1`6pd*Yh+`6oX55#XAqUk3cjulx$| z-~ao6e-fP^Yi+q)zU;EgfE#bT@szjIb59WIQ!{-sxm-`iR-Vnl4KHF%@hDh&4-P5@ zL*SyK*T4@5&~?dgUK_o$7EFIRpL9_iP<5d>61o|X4KgIw1iBBgws>coJ|-trK3qS! z6Ncry`u>k1CXhfM3(fZbj(fk_WJp3$RlRcqmWZG-HmHiMuF^hXv4MzW&d;`cjZ!?_ z>3utO0-Uxdzy=SskRWhM7J#=pXt^!|1A`cmf+v2}W+H5I@5B4w_cxzdG;xmP#;91u zc!Lp@f+9v0yi)?ELPWjCIVm1op5ld1kqyxS!K8+VRRD~K8&VX(BUUgfs-V#_6|8{Z zQFWm~K)ne_d}FK_0Taij$fz1rMM@>`IOlWCgSGh6_%_h*ByA2#~3iYXk3d@J7+027~aLUK+MB!*vX6?Xt4Qs)TJ=Hv?*rKKlR3VsQdF^ z6r2pPet;mZz>*5AWOI9TQ=*|P`K0qKJ%%@(u-_Uh#co zg<`}M6-!mY(Z7jM4W7Svj|usF-{;a%j|Pt&FCLMgv)gyWTtT|I)W{X$1q)(Ce818W zq`VZw4-z_HkjQ()s~V#=QoIw}(PH^ltE&d@mAI z@M=|@7-Ow5gjU=jOzfNpY71FlYbZsL!>Zz~?Pb}acIVa|JAose?xv}!T3MQ1-|6J{ z?%3VzcIFlq<~qH0*2Sw*Mi8HZSLcFWqlgxq`cl9{!!yf^FQ|nqHi{w}St~#!65v42 zhS%Sjqy0tO?SKWviWYe<(p@27~Q^gt8ChMc5TF1BSuzV zTsrh2?{{4)B6y1#UpG-Ke@Y%h&72{!0}v-h>qrLR9epV-TyAk$w*@$tm8TD8M-~99 zVB-?)&f>nKz|A**!lTc6_G{T( z12#9t52f?dx6A=s$495mthPHfU?$r);rZ~5{|vnP<*#+toEwh-pZNIS0t;Cy&to8o z5^Jp+MB~;JLeVET?ZdRH#kAPMEzZ5m)dOD4q_b&~1GAcMiW<#s7tq)y-Cm_!2llvT z((J_b2H;&TQ9uJ>oKia5RLg++<{(H5=LQjM6_83jDpgInh&R0_vI$Ts*OGcwk_hlx zFaUcZK*fgMe*p1gi%au^sj z>4S67+7FD6jnB@`N?*KUg`ctZX*!jA=(IgTJ5iooM6i7Tq6|CdC%J)RZM467e=ASS zv4#eTUIQHAfI-&29Q7dWf6O~;`S-(B*5S35 zRv%(Q8X~b=`iGS(tOBGR|G-WbczfDT+aoYp_D^AJ1_0g~Q>%@rF_AGY(DOJzBQHX5 zphFfKBY|yDipWA8f>%WP3J`-zYmmb#oY`>GiuZ^yqQR{dANsVy8+-}1u>|Z!rSD&c zem|pv8&q+f$Efeq!x+K)qFfWvTT zE}d?ssIk@>YtV?qI>f6pL`KA$kXo=&D6^=wCN@S@B`K@-E=>>2EC7dQ7ZS6>d!OaG zb8ey4>v`v#!^GM@-~jYjFIFrCI}%0DfbY+?A`&{IRU(OO6erf0$o3!7>hbDb?o#ia z_q}dUFtOJtPK}9@BoQ&rJMW!y>I0L8h?)e|#a?>Pg9jdXXkV@T(B~#cF4?-hF;cta z{4+O9j5UUEDi&e_`>G0ATr@TqFa`tWj5E%HfAgpQJX?fCiXIZhbpX_<_qN*uur}{D zV{HNP^j?l`WZm&m9F=n*U+MLe-+5NW??~1pqFZNI^OS!~?2dGVniL}q* zy=)*R8m>l3h_WIhE?=0L0h+rG-!OOU;z$h;ac4}8z4c|U0(Ref*XJMV-MaHmfGExz zS#@53cVGKTiToekbkFFzD)5c0vmr@(J_62558z6lzT+S;H8JwlxtX_r&s%|i{rFcq ze)jrnUIHw3764z4LrlaeVLyhO5C$Zt!CGk>sFo{{v7`iS%uEBHg1eXwHn~E>TsPU>@J#^0^)MrDe8-Kekn?d z0AQqMOwj=@xe0V+{luPjI_m&BbE5Gx9vasYzO?8E&ly`THn0a0}r$HgWokf*KLKxZ@rh7o@u^5 z2M`OT)Rr51WPb+Sd9e4gtExK=w}DOD@~`%qqrF|gv)A*hw{m3Iarw4GWw<;SV`Qn7 z`BbC-ZwY&>JmSagIv7A-`up+fb%hGs%7KI!+7-3?em~i8UYtIG`>}S)>L>nMBu|fE z0+ygzgT;f_-*4kUkGGLi%iOPEY&*%Z$_kz(mc)lDitwK0JQ|PpDNZy7{RGZ;NmgG zPEL{(>GF=z46{L%IUwMzML+B$3V`YoelQ==n5 zy;MpHz2$IzoFP@bXsj5K2q-E5r)sJTUgiL>LXI{8e6D%cu_+K`E@`&g_Z|eQ(b&iL zU9tD3d7#z3d;i|uyO;VnyG}e`Xmp4W}(aZD0bHFBDTxZtXI)L$6C8=$_e=pF`k#1vd z%*_Lo1?Z-E5c-OvNFKSTHRyrUenq99_%q?~ds$i%TZv0R`Tc*+n59<+ZmML@Jn!6v z8$Jy9dR*#NF8g2q4d@+Q+!Li^lvnS|*2hh?4!Cq-C5j2OIs&*jc2314gd<5xHmLxq z?`bdhxdUPi_pft41Dwm#tQ}ZcL2F5^QXc`tTD2x%2$NFcWAU~MXs_9A^*ZecK;z*V zGm_^r3Z%2Gxq0Sm>w*9HiM!65`+PJwh+XkFB^Z`guq6qOR+OfTAO+K=<(uSA9&D*}-f6@#J4TnZb8k8#!Hu2G|S3LO4YgY{EpV5e=htz7{qPmG*> z?pCQybfY-;&U?wScAk5e)6FvV;=H16iD^6dniTB;;kuW8cdtqxzZ0NH9v_H+j1`E) z5c+$);?+h0u%T*=-Qe2R#u&+@dNlNZGrjD+^(qHYp+9ZXRZ z!6IVRL{@Ql#>?d}s8E^+d3aT?x%9dnUnJ19(6~^wef{h>Nkjs{X~^n$59Au)4ZSQ6 z4^5+3#ERHTEu0_cGUsqv9>;MMS;2}?HP)l*z3bt3QhNHOmyT4Eb+yuDqcK)as!?QZ1UNM%;mYT|II8@gynBMa&tsX=Lvz63 zAVPZp>Vz!nHi1NyBL}iJKzC%r-G^q=#TKyRuDiX-gH!9h@AUGsYK<)yTn2pUi~pMB z6IYBDL(+u@m^l<;Gxc>5*AHQr^#iEn1Ke}&iww7_=4qCtDX_U3ZOLY>{Xk{0JUyRvW}CoRty1Z&)gCHH;G+VQ#03N>h_8jHqhJVC5zVET zUW4~}7sxyF+RJ>F1DbZhBi^|bP?sVRJ_Yc8UKdPj0g$*{YK+t;l5kVUr6jc}5GTG= zm88;F6d!UbHboqo_kefUobhH3{MMT`eew3zEpts^u2Xr=`jOf8Tv-0Wr1zy=Tzc*( zuxoby`=7V@f$0Npy0Q-3eW>|wUpajBR)A}-9%FR!BlqtD>gR4aBOAZqoO6MNXyoG` z|M+9;`r9Y!MQh{)4t)qI^E_WdQ5QXyeZF~?;P0oCnkQu|n-i9%&3oU^fcquY)1q-X zyp&Jmj-SNdSA3xZIfLPE^SGb3WG9WI2Nwx_18O&E}rN^u;kv6X7oxm=OV z8J}tHu)Q>Rg_+B|s&k%D_EkTS@EM{*2`_a!C?2Y+SFs|-h_R6oiHud%JWCZt0v=I; zP+(x`Vig4MgS$V}wBuAo#P%8gitxh^zSk^czag>}8E_yXF52k};n7A>Zt{QyX;h$0>}eTf$bf(;3jkh~1Ril};} z;45?C2_GRUf~pOETY-HN#7h7n`K9!O7-RZRe=&lJQ1q%wpDWbs5FhuYvX4G zI*?EAyN%6PR>l;lb{6VYmzEvSkkX=y{&deCz-_9I);CO)b_3(t2B2r=U%F`uXqzq$ z=?kg`_-pu_Wm%FWz|?r-hky7-e(k^h22ie4@4N55U;d?E1P&iQ{Dm)kq0{LAzxf;g z^~M`-{P+L<-@o9x7XyF(q4)j8-+bm(hj#__ys<-A_+kjua;d3J5GY@#%dHn~cEk$#=7;+zt9BBa+ z$DiJNAWPNI1Y%3u7x&j6J>0(XYTF*a47l-@xgY-Fw+5omU;EYn@|gR+NfgC4&)f-> z79N#}$V8=dl1nlKs`hT_hap_a8m*Qqw(?Y_5&7@GoP!QMTS2XQTT5T!v^`aAtpGrMDK6zoyVpxfNx<1#VjEFPOrtRp{9K=B>b=VYVBh2}@1>c` zR8@VRXMVtKuVP|>+!TJZF(!)RNTMjR)*4Z-&ZlYDJD=sQ(`l)CbzZzN#)>roZ;cUk zE;I%kG*dAms5(oa96~S{ZxEb-H@SF0&_LKABB~Z!E?26xs)_8;!-rh%ymL{KgwzQI zfnmQ1$9h0~Kl9sfkW?{Z0*{jM1^Tc+Av*89F}4qoa^iw?aKPHwq5vXd)EMIg1d(Oo zec{7-#8N7kLNtNLhuVPek7mFkU&PhmubGcjkL2J3k$dG`)1j=B(fHhM3E6w zO`?Y%crbG^XdipTCJrgE-+|Z)5IpMY%`)J29aSK z-@hNY^S0Zpwd3QX!2kN)-$nIp-~E>9g%t6OVKkB`x-XO@`fUPDZh>UZp-8PU^&{PZh zS=XGIK5ASFM2YQn+T>jzOM6nY>atjKAoJKviyi=*Cgq&G1>jPpmCh{y``dFq&5hXy z_$)0)llhT(pw!r+cG+nTrHTFf_qSTD3opD7*tl`y-o1N=CpYdtGOHCfSMo-q24tDp zwqeshe|>jb%0Ma!x)2u2^L)dG4WIhdr+`Q$=x(T{!}dYo$wa= z<2O9}WVSP~U;XqqzrJ@3t?rA~kN(!Hp8kk7^~kKqR4;d`hCH}oP9D=2bsGjk44jNL zy`LxF2IE`}2pP)YQ{Zcs2u7EAqH7(Lo>)8lRBVvRdZH0Ex;!_({Md%Q`KA9XYq(wG z!dP=ZOIOP(e%KY?EbB5DB8S!GXNsYS>?sICdhAUL?@b0i|4>Em+yC&tP3;&;z>)R2 zOEt^e9T6*H)H@@_*eDjG#-Y}Ts1aL=0b>&9owd#<>eZ|BPQ3>SaCV7QH7~F?#)w2w z6k$Wht*Z066Ty2Qd!MCUft-L02rmNwR53oED@qN+70%O{5|LwOYD2jJpL<84v z6vvfXwNx&7=hS;Kh!@o$6kI%r3h&>qB-I<#0S4DSx|HIQpm%1ZkJ%aM8+f&Wq{t0a z&II+|JEMqLvvdjyP^EhH%0RPS39*feN@$b@7%3BxfyV!2Q|m{QMC)X9F4Y%|2$Bu z*WdD%w;VY-OYDG8{_UsB_4G%cTLtPL(Yt=@H@AH8*MRa1YRtF(^nwv!?~nZNt-aba zuDb>pFqW<~kMS;257e`EAyOs)zN5V~wS@eEK(U+&*-^8X(BRtPLcpbp5wndq$^=a_a0ezf<`cWm#x_r zJp?6Qazy) zNju@xo!T|<7}_vWfBEqjAB(eOmLc~BSId(!=F|2V+M3Rp)J7+Ixoc@xTV8|Tt{99F z<0Vy`qE;gM31^o(5LJt@fOpOtk)RS_io~AY~6N3wR7x;sSs;l=M;c!J8VUe;!oRi${#prS|DC!pInrLgch4 zx_hUEtb!{-8)L+%we+c&j8PBj)%n~(WWyQtCN7#3qbMo@1QVp?`pq1nQyM|kMAqfC zIL3Pyq9+$c?apFtYD0B=vfW)&e=3fSO22tP18OSxj6HnM&+Gw2I(P20LBY39x-M>w zm*;@`WUE~I+Uz&K4$L3gx#2DEXeGwkLqJlQcG015z zEtO4Uq6Uo4+nEO*n2a4zs+-bSd2`hQH8(dECEbz$NwX6*#!V6fHd0{Jn$6_|Xvb0R zx>i;SHdt$uBpDs810y3NS(b&AbDrm|R{IsNcm?naKlgL@-FM%sUiB*A1Mh$THP>8Y zj4795;NNb%NpiFE>ES? z19bLqHgqxM&iS-w>NP;Jp7$Q@0LHl(!jk1ul;a{j_HQ5~apf z@>bD4-t8PvSBiWN)U=zmyO*53)zl{eW1#qhe(LtyZwEGR+<4!8_Z>KJAl#vG z91q%5PUd!aJbZ-7O0s8F0HCVx{>QKW-s_(AIPCBd+6sQm<&c=Lz@yy$+TTA`&dsrL zBabIcVu_t{;N}l|Z)@SK`fsi$-l;1Re8*el$?p;wR4N!;GfS2A;|zXTB(S=BV|l4( zDPS1hqOP_1lb?{KBFT!cM24fCwe%>CKOs-l)StG;(bf(Cs*SoABbY$R?*Ug3>x$Ui zJN0-A>YZ1>^+h(k@2RTKeJ<+MM{$H|knfc|G>%Erdz=?kj9|nfQ52PuNQ^~fVzgnb zv5}O@)pE6}s-1QZaL%P^nx>go=Uko^O@vFYa}9*~>cy)OvBp{}rMQ%oOE!utrIJ(a zb=r&b&D`he)kZM^VI!jIO_3(|UJz@X_Y!)8v%G-m6j}pVX9O>bHwLd7D1y9t?**fH z?+Lu>##j)%6OlnmIj~aZVo(oWobR_yYr#L`2_Kwy6hupE)gU-keDH%+A{*4=QFUn1 z58wxF7)4#OAT=_^Dn5Ab>bw}7HxZ$4JH+>@D&m7midds6;m_Q=(8nwUVpmz}?$M$o z;?)@=x$ohXC{~e7C`HD)C{E%cE;{1*1M;rAo|&BkW{uo)w_b7OC~)yh z-+XRwM=b*A=H1dW+FJrJruzl{@{@NRjIVypyMPf-QXg&X`+C^J!OoE#2WFaQ15{m$ zNC-5PW?5UUmvrzrH2ubOD<+PjB#MD zPQ3<%-slVKV;gM_+}P<<#jbX}t+kCt{gO*A2RfZj0Qv*fYW02Zd*8c$_y@zEciwsD zh7B9S3a@_ktG)Nt(kSqWFaP6DJ+HcOT?YJgehssK(tK_Wxay~LrU?3o6lQfX~p*5iAba~&Xa<-pWgT&t>->gS)o1$f}@JF@2DB`)R^kzDg z8bG^yl=4X6B_xW)i_6l>UVI&J_l;labdFN40;Q2nR(h?(0^80xXJqph)jE)?9r3eA zKL26h=+REKv^nUnk}Z4wc^~viu-1C-zx?Gd1Kn=-%rnpY%2&S%V6w>Dtz*SBPfbNv zZqP=(3Y4XEWHF8E+;H1nz>Kdsr>#~iO!W`{$h+>l?>-<&66f44x7-qTcPi=s$J%R* zk0BK|(~pp!y7rh%#pCVAJa&UrmM5o&cqEr4W|!1jmN}{?@S%0+zfZ7zt9z2i9sion z^a=Z+R|Ei$jjh!z{O!aps;bWAp>5KLwbq;lCY{jMhG&%GGGI*Pyr@z2pyGWl7$XK1 z#e463KL_1c`qEGe@ObZ)0j?&z=|uvkjnAA{9~?}Dz%lCbJOFh%iM2M4tc{{LiVTP} zV!-D3}{)T?J85)a714ym+8ccr7A*p9if`d_N@ULs~<>fEZDAU;<)}-wmhJj3#AUuUCO2KjLg@bi59brjymVPHuooqtsq# zhM6l>l4=sgiJM!T1xja>H;g8=(mXIeIogZ0C~K@A**?{%X4Am-4eNIvJd)I_K&?^& zHja)ZejaFbyLeWMf@WFvna_OoInQ|x@R1MyZE$VF$iMcrul?{3{UA`T)&A#vP$;ima!oor?lwLG{>7{2?x9tJC>r=*?M>ki2og=QXi|_cse-D&a+7brmo@J-rmt7}RTMq5#f5V^fmuo?e^<4$RQ; zGS%FF##jtAQg`1`7gns*YI&Y7EG$qUui`M(U;FCK*4lod?xbZL9_#n?u>ydF?n$*J zoVHW8HP9EpaxY&7h-;SqU6H#z;U)2H;M;wh*-5o-5B>2Zj^ta#)cd7QD#ekjn&_0s z@&2E(wUvNvQqH`pmE3EgDdh@$i&yVZuj28(-^-;1^N#l*)(0rM2wnqHLJ&;oKsBI7 zU0*9m2<$c?8EA6XY;}!Eqd4+ng0ht{F<>I2Se3HNoi!pR(Alf^h47~sixE|4jEPF| zXr&gFB9Vd`r_*euy*y2O&Lcsn468$tws!-mE%mA{4>bYrDCjYb81J1?@ljA0_L|rN zBL}@!-a}t7$Ai^@kV0|C_lpw77)6ZthzZ&Prcgr& zYRuq}70#dWLr}`_4HOhX(noF$^7yJAuLkQS{N$0;tyPSP2=4fEOiq_s+O>W@az&(id&rvPmv^#uV_C2bynt z_1PIIP`m7si$DL3JMTLRu;mqVdi0&!@9((;c>eX*J^PY-@7vJX) zwSYtO?wX6wx%s{S9Y`9JrL&%Q=EajhwXO??=PR8SPd~%zIe2B|5yI+>#qfl z-gTdQ+be$IBVPuVgjb(D`>Bt8?O2(9|Lx)#JXLIYK7LpqN(en$W|^12))vQ4Xx=`t+fWty1h=Xo29)xr`zhN1l+%Mnb*L0snYMYa#)cpu^Mnb`wlWxe!SPXj)G^F0?`ab`OSG4gzOF&~?Zff+M@ zPC4F`2rzFmV7JVP7ht?TuDIa8Mp4vmw?{`ufj7M2b-i9bJv|M){AJfWPq&)_-|_m_ zwAzK|cf}Q#A38kq(iguL@HxBF8_s=E6j~r+>2&7kES?GI`mq=M!0hyw-w2$0?zz_5 z(9AkII(p>DkypLy)j+M9wAyKRmFz=qsjS;tE5|^sLf1vW^nnH7oabH7#tqxjOMy<* z=yc{Qt^>r~!_`Y)FnYn$fX-a%jIVCk0&G0*`B_?z)H**0bV}7oOeaf$D=)n0n@5`s zn*a+73kMH$vf9PKx@}w6tshOsMuA@5o=>}rz7$4fk9}nZ&`zh**}i>yE%X=|ude&m z+rJSOxPM3GJKyoT>G>A$)dzRqTPa=c*s=d%V8iCh?){xqYQWVsxo`K^fAb#}fcL)U zx&M5$IWc#~Dc=vrx9|V(O>>~Q zvS;D+$vSPPZ7mB4M{BIH7FA=63wccMPX_?Ux3vNQF-g7FYWLa(7pW=&anQ1Lo(N~H zQzK>x$g5%mF(wEGBVGd%(JRh5F-AQ;xVR1?Ma7G#)4;}~iW4b3yl(22I4&I&8eBmH zpj<9R)+&NEMr=S01qgeVrmCv=+~s+m=UJ}aix`(XuTrj5jIpZTJ7-PF7?bt=@gPbT z{9RYz$0W9~ccFe^Rn({&Etvj=LUX{YS3!t8S#XiPQJfF)48idZ8GIXw77YDG^;S`G zRW;TWI$mInQ4yn0LSK2{$}0t|TUU%ijpG=VpK#zE&@dUH-bwhk?KOUpH17 zCDVbsZ`1`2h1;Y zd%d2uE4@#FwAbz`K(H1I&wJX>*3sU&jl717DOb~49Hw|=H?M2Mc~wKHb1`O zz~=HK5WV&XrkV%0?0D#J|K*Q>)OTKZ_Q>5k+rX}7{sS+4+sAMJYv3LKy#5!if7*|K z$6J7Z`fq=7O1H%E?-%XmA$>2Xf2aBFE%zsUm&(n6= zPTMJ15IFMA1sR+tdpO@RwssS+v9b4f)m*WW;*7J#c=h6qM2f2T;Rl%WPE@S5c$|20 zY;3&Xa_>R1TrsFe5U-jGY7pnWhW=S`p&vkjoPs#b7!yb=1EsxJZ`3%9_rd+lg*>PV zgkU4jU9L_bSML;)M1m2Fi4~7T7B$uwF=Ew-ktmA28KBtRi!OU?lL94AloT z!2Ml-qI)sYR~QJ6s`q`2zX^0k2FJ1lXLwb4=lfCvUd?b3U_b*AB#$i?9C%d3S-{~# zoFH}>mT0_c5&k*j6$};-#hExq0!HH0kc_fy3NrdHWWwmZ5Ss}%|z#=HhuibjVYpw-)b4TxZ=s-5(fOsLE-g(3}y1=C`-_&W|Qg2j&@dKd?L9J6EkNnq9!*9xu9l;tRO~oruZ%Uz?o^P_C4l&1Tp|SUp5Ud7hU_r95AW zDzP5lnGKAtN4gW+&e#fE_v%*xM=ZDg+h;Di?t6hdKL7EvufDLc>3rbq7ruG6(``rx zn4La2I=O!0jB|lq(w+arM>>n$O)vXVAT8U;xH=r z`8A+EwJ|O|-I^xgQdh=Tj0a-6O6^$JUTBzJTwFB9WTrqYj@D`woi8qeZu)_b-0&+u z_>;h$^PNNA_{!_fIQ#r_&jRk9y~EG+&e>E3zPPvfre}@+-E9{DZV7Ld&OazPa_=2W-$|B9_y0U(azJaf6pU4&1qkQ;}nMMZL-+rGLM1IZE*BQEy= zE2GXkZxEBa%;&kYk=W4kimI9-10Enf7^hCX!59&YNlIl^HP*&)WXuvKGJv|k6i;E7 z0jN>bJGGICN{I>Dq6K;)c(a*WmKL7?r zSx2fO)+3C9RAtMiCl!6)lzu(~3b5)5o0(coo4Lk1xWCLfEWd zdr*uRyoh-5f;#V?I?<7EzpZy((BXQd&Qf~3t)YA>9z7blz`el9{QP| z{ppSCD!@5s)StQ8mn#N{64z(_j*TxC^BMA z;5b@N5RYj~zCO$i;Hx$Q>Pei~yi&;lSCdg2B^OQtvk%Ta^r6pAA6NwL+c{f3qx!eM z_piW#_Rg_=qaWD+bYSmU)r-#DbZfi!`Ct4v@Z9HK*w{1otg}i$nstxtW_tEv;A^)% zkc?J$-f;lfe5GuhNL@YxG$jX;B%V(dcu?bKQdzoIM1uHNN#b6d*-E&!B~G=|X#&$x zYfId)Re)@++f10~9s=Gx`j&Vcmv&Mkz|Vd1JAdFTa+A?|Z(Q34*_b_nxU;M%3>wdJ;8v|z2 zqtW^^vdQlUvQB4e;|6={r-19PebL@%OSirs7~ixh%Bwc606CT8l!p%;I0!6s+s(9F z!UN}T8L8*<^RB1`*-|CWJOA*FPXpukd}H>|p*MW&Z=9w;CALv5%QXj{v!!(F^z6@n z=Zk?4eD;>V{K_54_yi!54Qq~`oT}>y%sh6<@p62MrE?hwm>l!>$83-Tdt9^Wr~UrZ zcG{lGCL-3_Q1o8@<>>(61h#e$fRAl1dmv5@Qft7D#tY0NjX(%e}FM0~g*W zxneOs6dA;b;8oSBHD(Bn3D!7#0j3FRSp6d|z%n*88U%uHN2ojig6pg9dO<~0D4J4@ zh{Of#CiLoh#UR!qVyuRZD};=@1pfcNi?8Ah>T+)eeY}BPb9urqz$&y4rt$quzn4%G z>7NLoAN30KdmP2##YoW64d&?UMhV6ZhEt%Au&7^J*q~vvA~;+j0|3UMAl9I!FVp5Q zec@N1_MA#wg;RY!J40SHCur`y6dlu|#6AXGu9P|NvKV+_v-^eLo7>&-z`+^ryZJy; z5+F`AOF7`^%>&e``L$2y8P92iJ)Ct`Nh^nomX#duRQmKr!vh%vZ3<9Of0iR#O>Be$ z^>SH8DiH!4y6fSG?>l_x@B(nw6<1A-9MVbySU)yiHKl`11KhA@?-vj4{iV0PDtcfY zaN8&Dd--e6PkS>!CGAuzBNLS>Fjr4nJ0Ci*vkPpzTsLf5*KIBU>U%&rDIaWlV1BVp zmao=an=iY{gZn4)3{X#U?q=?L7)X4tS}ivgBA|KEIj*H2SpR8YpPP4Llf*GI0W4l@ zclrYf9pKm3{pY!!U*F4s)+5w*Q&Pbk-oFF5?mzraHA;bc`v`E?NB{ms&-?DrzW4Wm zEnCm5N75~76ms9^|M?ludnJ%1QLS2;5~c4^e@1f&v?C7sxI?D zwPfR7DeZQEO06c&FJuvL_Ej(1bK60m=0J>1l2W+U>~Sy23of_-m}xGQOYz1!z-Xe@ zyWSEhkd5QY&OLj9ed(?n_fBt|Od91Hko9^a7^eNF!Eo{vSfY>Nb5tTj@ zji`6InAnP-Dq@{?A?Xs_P{ax97lD=y>9^0;uL{WKI7>Lm&bOIW#H;*fMIzt2$Z^ zaGa6!VEgu)zXsfX=iJk-xcrLCOF(K5oV$7J9m#rNZsz`@_3Zrl`+;Bj(eJqDo_jv} zzE8gQt>*(!nDw>;ljlVb?%2Ix-I_AKzm%Fnf<`8_5E>W}a|dY_FnqI>t;0^IP1mwdu@fo^LK zIP2oe9^7%m6w(uS|dhKRh0tBqF_Y45i5Pb`f?lUj#&%pe8l zRgE_Ip+{!k zk_R#(BsUBM*^s`hvS=17ieq>^-i z#z-=8*2o{c=N4clo!yvh)JcF&sd?_Eb(=f2$%PE4#AJEYTh{;t)C2xqDPt;FuT}oQv(jP=N;az0*-CU%l><>Z~yuYKz(82+}n;cpLQ`& z{pvoV8hI1g{Qie#eoM>k3xIC5JX|ZjSgaQ3b$1GLra` zDJMz(oU1PbT6^x>d#DSXf8m8dZ(%-b@4c;42EOBGo*yCie(*PexqtiH%bxb!?)(lQ zI(u?-d@PPiz>d2=yx?coiQP7S4scoW&`jg9*7O3<*2MSh)VdL1c6w%H-DL96SAavi z=97zF>$4^hn>eb+YC;a;c!>GUn>Pc^_IzZehXK6vktOOY#HmxKS(KE3j?3cIS@9++ z`r}ih6C)$Q{NaUCx#4;ppc+>;Z`)FeO2EUr7f_Jo@dNw$pan zPTLb~r(OR?WNQTgDj*@BUqH#NF^Y%@8FJ$Tb4~%5C-`SxBv4WY|H&4l2_m|>DSPQ8 z1rUl6?UUDp{s8X-=tfml`dzdZQ6s@ie!|Xjfw&)*(F=-8PD7&H4W6cX?{Ja**C%)?eACsp=65c2VY5E+9jYQVxJ_Yg!Tb|!|X%0+W$xC{m31Fn| zT-*9yJLv%n(YR4x>Bl6JX0GQ5{5jnW3FVEI$zj{C$0$VPlT{0xyS_G_q+8Ek58Uy& zTW0_Df$LuTI-s8Hwj+y4B?3xO5AYa_03x_W{Gymvc z-344TeZj_S4o{r>pMcS`-WYXS%sdEWH~m67n{D6J20r&!_gwwz>ldR8_}I=pz@pTI z1)wx`b|u5Df^Cb~hfC4f@A;pAd*|n`Xw83Ub{6=~+KaQc4>$k6ORN9sH9zM+c`Y#N zqmB2^e&*$8++4X8sP$eqQeyIk!+^bxe0FoW@*sd&|A@|`%cGaS^4Yil^%sF?+jUPj zOSCG7@NC$0`MIwH7H#K_zx#n2KG%()fW$MKP%`mc*dt(mIG6f86RovINAcH%A3lr=S$mwk&)3#HL9-<-97F& zx6a|ihk?b`+~IYNPAdmS%N21Qb-l1aWbJ6Zw9v_bZc=Ocyrfc70~qJCE@QO_XqVzI z9X&Wws{>nHe&FHV)#~GfuAv+~TF$$%N-|Q4fA4kAdYndh+D_YPJ8h@!DPn6wfC>RZ zgNRk{Q3Mey0Rqzp$^_kA1;iO|)c7Lj?Nv>ov>V9umw+{@YGepyAqBF$z{uzz5b*dS z-#dV}s|1zYQ`VI|Ws`!~b7;3dkYD!m^uDNMm_c^DKkA~%_xK^pFj>ZOy6F=Pi<6v- z{&sZLmnY}?qaIa1ES=UDK@MOdyz^MGLH7-#sDP@sHbzeIe8nc7OH-geS52%*T@$D# zXUsc4>RUih$-S*c23U0MMpQPPBfxA_S3{@S1U8PPCOf~C+*|7ia9BIzqjsU&3cHAG z;(Thl5n#o)qDrG&1v+!>(MHW!2XtL0%f`d4Vw6mxNz(+*N?J*+zP;H5cHS}j@;AJ= zTiOLAQzOKZc6&f?p>y74le3@M2mI{|pZVJN|I<}d$)w^ z|9E1BrvdGfHw$~e^2)aZQOmg6Ld1H&J0nIzA3~)vo~wM~7bV~mLG-1ixv6h|+7{@Gimwuj40UiQkM8SFxNkE9*@+-NaBlKVWWsG^S8VqHg*~wj&Z-V@2wvXrhw*_N$-q zD93QxPTOfaZKv&9!qx}?jEFT+pyg3599%70F=Yupf?|rsR<&XfZ?Wpt<4{Z=LT>y3 z(;@>p%RXLz09lZsG`Uc)4E4toXn#bk(Evd=1>*b(v4WDvc)Tn*%?5gXv9KWa6}nCo zLDWTR)mn$z!ey3Y4Oj{+QK)K&7akAgibBo-hB}5%er4~pFj3RT8HC`+6eR({Bas&y zCy_yhdD=e&B$t-wg7*V!~xjrRb}@q@R{{g1o9_^bEb)&{P5#p|c)AFZYZ03)t0j%ys3 z9k6w>bpHdsnHZpyHmH^_-ox-)`1^mo;bqVKosWM4m>t>D)%czd-t^7-e&E*MeAV_J zxG^IK%HMJ3+rR%xYo~y*(MzVTdB=fy1B{*Vr!U`rUX)A$`HTa0x8`@wDscA5R+2Sh z!B&(tn#tj)1sr&1eDC`94_IhVSM9m5uwobnneWZn zBnG0;C)4+R!(}x(xfzI(N|xsbNP(X7Th6*@-IndZ{-cL)+p{N-naW%{&7D&*HUd1d zZr#LqBLT)I>l+)D#pxcfI5#^ny>m-;1n?uZ%H}gBrpACV>t+|a>w6AJtkq+O&qp-| z-u+!KTett=1Lto7zWm#N`F(Hsu{ZwJd&2@gcy#a03ffnZ)n7hRQfHAq$S1h)DnvL{tdMJeXsGvM z)H@#)Rd^KzgD76D5J2TcqF;x6a4`n;>QzNGSAhXLk=ix76wPs|ZAGMzW?R0BfO?0l zts2~yT|@hU8885D84;s+uTH&+!xvK*1fB~jSTUtiY!WGzl2SRsAZ?STZDT~NMa-$i zYk4pCX%EP|b;_>S8U?E3n-A@MP-ia%?w=ho)fKLPuD`ZEJ_S4=VQrusDAPU-szI)HnY27duu7shuwAozPux0dyPks^j z?(cfzFa4)C|M-u-2e|6WvG05PE3#}=2t;YH_X`W%OPm5$v~=ueKzr*ppf$O^b$IW>-b27u>(2b^5B$S*PkUxqptbX1 zB0Jafz;uhrb?fKzX0_e`biO6Fvu&yZq`k#7&BJXwHa50t)24d84(#8*|5R>?M-si? zwtpt`x_7Si(Cp%3H*0qDR+bN@y`IEl)nuYtx@_ZEIgXybb=|3q=d_)+({|cU+qb5z zEd&-oAM`2ywdjCV4Sf0ibTCD#zQB;rOlX_Qw zafz((q5@Gqf)%pVMdQ5Y^@t+-Va6bmSJ@ z?}K?)DQeiQRP&FPpCiP!lQ>?y}3=)xii)E1)2*?Pi? z$1oHW60H+-nEQN9vW$JU^1`r`N4McdJ$aqC`_IZiy!n!rYojnV4t!Xpf+Rvs9SC=P z>~*^F8fEV4y6|{>F2R+dZX%&h{ZAZoe0E(-%;;ayza9MJs)J=9+R`Pd9O;BXi&I$Zgdx~7V86leDK zGrG@h#hs^w+I=rf5rANdRA`u_thSB(lTVDID!3+c7hASRI zs?-;Ulv@^Z){n^W6XfT+Ef@a9QOd^b7h%kRu~4w9xIT^>{3aB+GJ+i9QHQiJt>b_$ zy!wGw-g9e?=O4Wd@@UT}@>;;4)f-5wwwFhTGf|#R+|mca#xYkc^Zaz3dpbO_W)-hS=39TkUM7bpJU zNF$wUV{Luf@o>uEODqO>rx&BG;Id? zZ<$^HBw_BL{etKk*(vLQS;eY1uZhDWsFP{S-nPMvs(||DID;Qzl;3h45Luef(?ZY6 zJ`$2^@@WDtMivAKEw-3_)}bwim$Xw>6@t{>m;L2_b=sFz7>6FOYfYpz`&f6=GN;2{ zGQgN)DjSUX#+A?ff<_!?-Le??;`2KMdD8QZF=Wu%lcZu^YrO>FF#Sa-g_q=geAc54 z(-2ZTT259*{hSV4P%vIa*@spyPC6_l3Ax@32Zx|HF5lIK4CjgvtZM z_hC^mF)oFZ6$nSDH8uI3XW-zNdex$h@G>c^f*}H=0i1M)WQ%C$-XhT>=JB<_Kj2f4 zMDEiVYy^3=^h9hpALxqr7s_^HiMc=G<1}v>v>WKMh|c@OQ@p7x%kQxdXt|+s3)zTf zJX*+wB0lDA=a60hQ&#{cFm}9;Tk(V?$l3;x=n$uN2eQ|c9S$=84eAlnSRP+o+=`mF!`2Lp)X!TjbN@|!iZ{&_hty_}*KN?Q7F-+c%lSv%rqC&ogPK!@cq z;Q#`sZ9yQge;c|O$a(8*I(|aqf5Yg~QS42yjz_a3u1!s&6xyz##!jb$$GG3v3Ykog zU~&Uhrpcn5em82 z+Qm)+yA5(n6O;1(w9TTuXMp`v>-8&F_>)QdIV(-&1J#STefYu|z2v@rbu^5)X-2lZ zVMxKVzIFi_cN?xVP#Xw`hxDNDlH#7YG!y}2Q<7rl=3maF;|a%%H7VQAhF#auxkpx@ zfk4lAwBQek+b%q$Hg8zt9JSC_l-tKWiCnA2+@~Hn;HbRQqnUwZnlso25qy+xCSNe$GO7`eY<+q4pBe3Y}M4|BP*y;Wss--RJV?W497<^w4inw;?m}bUehywt2I`hp0e0@*@)L zxjU+v2P#)+?C0bBJV=7S#n(|`OKnN8fH*n zy?<&GDg33`0;mz!Xj|(ukB)N$Z1*70eIDRXd&5-$JwM*SP&pJ>>k6q4$^v6^!ElGV zSoF~T+wc7gf~uACp$uM^kv6Bd^PT8r^4msp4gv>9TqtT_yHDz+bBFYjrF6cL+TPqQ zG$>{C`E@&Qyw~t}$;gcSO@8T0GJf?fP^$(^Eq40kwJ)FyiYNu(%>&OEE$znqz|gj} zC+GF!y73#Rcbn1rMkGzpd8|pm>afWpq7J_6mSSYpf`A)2;Mr7_mbdwxDhvPSiTw5r zC6Q~;RShjcjX)ZO0JTa&^_PEjjNdg2U3h*;R3052#)ok;j87Qpd&)M4z9oklAkUFfg!WglHc7t5%)buZHh2 z5|!`pd_S?FEAbYT^6o3P0nK_^SUz4rF=J)WUg{oOhX(-$`hDJa>0yslW$KSL2ca!P zJxK^o7_}*gBplA67?hfWo*#o%nq79TPu^h6!231MPm_DHXLY=0(49{PTUvY9`-En~ z6JoBSEU@}e?SRx^y;O$t=6;OYbhLFEO^`QmOWD+MRyAkmQv(wh*xy=-PbAT1`e85h zP}6v*o}2=+t;7mh=S}pS_@N%;DiBd^lzu!aBl)SAj_ivXkSe0Na2eK>rhpoi0a{IZ zD2985@)hTNNKr9q_5(EUO*}H$oo45vF%96kR1)TlVUyn&4rU#Q;IYFXkA)>gcHLVf>PBpM`@ z4Qt0^ocVV?4X-`#zLBv(Q{5|*hxICVjV|@$ID}}I&knbRxOj(#qn~C%J3H-(On*l-N%+8l!U_~}XWT~(lhWGB@>FPeuvoBiF zPvr14Mi)sFDH~2CG)AZ7O zivL&4ASY zIzDMJxi39ehAZSXmnvI%Sk?ey>XUkzrcoh>2YMaB(FVJwWz%S0#@?%;8+^%=4G_7Q zp@EYuO6u{D3KA3FJ*T7yq;u1PTAQ2su__?qHsQe-k=uz{xtYSCM`>=#sCGPP6 zw!^HCvglC3%R6*%=Sip@Mb^`-VQTQjE7A2dUurPR+ss@fmUnMzeM>8!C_4U$#?+Ul z;z(MoL+n+Sf0@MImHVhU=2clwx)&jJ-Y1i^-G06;bU2c~_i>>C07WK4Do#m6FhpUP zUw`sUpH{v+*`B9#Ce&V3w`8=I>a)h1*U?G3dwVxXk#H~T{$+O}5nzm4;Ai7+> zko2CsUz=>#(#(rGO4`qN8SWSIx&0Bmm4#*X;1YD1srKT^U-gtEmhrziUIg0+gv?n? zR4~lNRuWfX^kGo?nuyx+8xhOo0j~YPt1p!h6ik_Cc1j6j!pzFE`uer`4l<+kP#ko2 z65tK*U9T-UPQVtdfXQ}lis;)$=ghQ_Re=`G3d`x0b}Cc1^L$4brP zbi4dr#F)p*qfFYYwF(xyxx@sTU=wE5bWE7}f0SpN*NsUrLHWuv8B^00#0_kbnP7tR z+NbXe&7-Ci?UdqjryhV-| zDJjFl9f-k;e9Izx7R7Bf{i)kF@*qCEN8O8PB(ujZs_fESQAma^RO*Ur4-`Kj+j9Q> zlmcQCS;jHl^4jfjl{b@Stj1~4XP%^jsV0r}0QzN;Lm2}nu)qtN&FWVUaI|6LAW zMCjjrQO1lDi_6q_-(*G!2>;T?RWx2MANM_LjWWCQq>Sj8PgKS^VTp-WnPsz`laThZ zOs06B6cUzOE})o*$+e$!(*gCU7I^WCu(7e-ernqE3*qi}P;p?VRX&Osny$d|Af3u5 z^0Wrf4Y9a+I|pGhTWX;UpERW;X5}+?8?-z++~pXE%682}6i*^^?7jVPp3h8ed%+ls znF!Z7vu~iVm6C``e%gpQy&XynPO+Gu>6TB5diluyrw))H6qI-Fe>sLUA*n&lWK2@$ z92flMPY0b0;@&p1U?M$3>0FFCh>y0rcmk{dBsY`i62(N@oT({(e*+ ziDti1J=P-7aSnnw7++@4V4@RSfPDV{UL2y&EewTLfsmwpt|XbcMm{UXTyYcZ z$LVWqsfSmcENkzWH^;>zW^^mnSAt~?tnwI8k8hpgYf z))uopp8@nb>vB_!w!b&we2z(eJMj0C1|M-%rZ>pl&G6h_CJrN2Y_~##zoJa`-06Wy z{Be=<>Y|&WKkrbjxZ|pZuts^tuU+_WU>Lr=)V5jIZ&_lOlw`Gr@c_8s^}yhpSN$=t zabb*2Ehl`L#5~`Hc~14davl6ExHucWt=6zhZ%_2<`R-G;T17_`F=+Uj579;^u& z>C1B2P9n3&D<*#9MuveK-0*i^9FU<0SGi%3y8Dmz2%w%@n0M6W{o`e$=+Ovh0339% zJ1K%YZrJEKYGM>PkL(^Ybb}Y0TL0h6!+KjCMWhy@Foh@E8wJY$tVthz?$e7=weP#P zHMqp^feC3h?ziekg$tj*LsBx~n@R-x+#4!>*bR)#GH6wCu+Htuh6X>eam9o^Mm6Iv z`3ek#%YTZU9AvVq^J~4?uBY;NB3wRN3qH)Ce-r!54`>{y!>`Vv5+Dqdy!Fi`vMt zu~bp?;Vhef#tT1|m)?|jinHL+o?9Or%BZDDqB*wm8c}O=8!HhGT=}vEl4Kyhq2vYl ze@jnrt)KI1Tb%$3ZVa~hVVTCw69q6tjQ{!|iuD^7LirypbL&muBgqZGhi8$9io}l~adSzr0O_T2xQ4>t; zRORG9P0)XTz-wgh4gs1P)iIwL<)>f9u=4qTNM@tr$dj!4uIdlGglBo9S>;P4sFaItdc0WGEYN- zJW-OC`uxf7(_ru}BOm375bt>t&9iisE-U}I#q}qyeSebT&np^3*)MS*;vb~duzk37 z`TCjEkP^I6RhvgPw8YY5Fp92#mw~b!wn77WWlW7;Ei~unuS28cRBb-tfF*<}I}Sea z)0@*dv`aAE!#@JgCBC)SFyw7Fxb`Lbl!5Zar%h1X{jMoq_h$SY1SZS!{77OuBK0K@ zB)6LTLw$gS_nx}O&Eso>zvt`<(jV2I;`yGJjGf=lG;N-I?R{Ob>LW40F<+&4V{2px zijh1f7navC6%%Q2oK$`m3j($rywCx#7UP9rb z_#)23eDc*!@izYV?jOyQ0JA;?DI16jl)=eVs@HlPT9Ncy^53bm%_qioV$|Hzi8hQ# zkE^Vns@Qz4A}Sf(ywxZNBjOU`C&q`WCAI_8_x9)F=y44l!K9n)>;9N&pU?MSOF9CW2lHf*OAH*am(OVK|PugqTfC``KZ83F)a1 zqXs@_f66DY)otC?i7_czd^f%y<-h^*O|*2`??!_$iO95n^mF)@pAb*(AqATfRt&p+ z(oYKIQ{DkL#DaQ%vx(8py2>>YUNM&e(_e4T_t;L4+ z%HB^*9QG`}1opXgDp!~Fr}>=%s}JdhPUt&S?Zk0(Q^ny82$Qoz;ji1D>lTl%{Q$

z=hH-mr2~)dsE9HJ<8NQ=;|}y*k^Npi;itgy%n4#4Y(76Ji{|-Ew|*^gp5OZ8o4`h! z#Chd+WnY}I;1u7d0%cG14P_axyzp9m@3 z7VfbUUGwS$0-S;9YjcJy#+F&pLz0>%3NOc2A9m?>auOptSGLzsg|%^VLFF5sv&`<) zAbEoiP;~Rh51mM`$6A*Q^=wTXw3%2ox2QPRd_O2&6VF8aw=dLq`p!mD_}?fjX3Dwy z;bMV>uwc_TKJ%Fv?nYM`!gsQ90xZfXAA8Bqsk;V;(1<#p`rz!2_CUK+zvx@Juct+V z8GxwI+Lomh5SHvKf`LW1x4~Bx0)T`lqy3ZnEpMbu5Y3!1;k%F_n$wzy!3O4-pMaTm zqzGFM3W*EfALnI&$mykNlZWpy7-x-5;FBEx(^rWfLJquZvN$GxDqvUmVsp7$Hnlol zFP%U_!5XqmtZsFmDJ8ed6=wNmLv%Ws?$#qCt-aPTf3BfKps_Q(mp=Zw8N*41KX9JH zZU8<1;SGqnOLeGz-0vy}g8cQ0v0iBGu5YlXhU;9ds1&S2c$NIY#!+NuHlnFGo*}^YNN(>WrwQTNVvr6d>LVMq1gt;7AwP>PcAu8fKb~ZDzQVR7JO!Q^N z35-`N(nksCbQW&v4!B6N305wukk<5ib=3A~q5@gV-^-|u_Mgm=(*zHw83m}p3N6!x zI)368ELG#4mS)ch;%LBYA{Cw4E3Pl{w0$BTq1Cfc{w?QaY^yaD13K2!ZWg@^ zeY4%3@)X)(Sae?qkxp)(&$Q#zHYa-L)-bgfWcz*yc9B1SQbkS0bxTfHqR+#>GPRWF zt_;Q+**8`r=1{S3_*SA%`CozfE*xaJ^I%+Ep~uEpXn|cm5>DbV)&C;=#|?NF(ksg-Y_+DWwe zKXlb^Gz4}&@1t3QucNx63C;)AZkHnSlE5)BBGg$)!;;MPu)HQxO@7miNVKlT>)yGTi<2H;if3y-yb{>D7f6 zqXg^c4ru8TS$t@rgJNv6zZieZAN0f$QkQoh(8B=VW~;Nu9e!1&hoj@2E;m)PNpN~Y zc+3Vx!lsxXV)hWCXVA{4BM`Df&RKgZvPY_Ae=L(r)H@?*CvQF-yZsZ*SYxXtl@=pK2OH4t7BH?6-hs(ReBj z)U=EY3Mwkcre(>>mX`!^QDu7#lV;h<6mLICMrG>@V{*Q#S$lB)Dl2B5{u}jKZL<)z z;dZz_B@#;m9ZP-kY>3v3R(l_E_?`s+jX1uKy}V-rhtSWc$^kcec9$v=i&X3}nclgw zP{iz!mq^_UQNWWY1f(eC!zj&xF1L9UscER$m4QpOZVXeWfhsBnI&t>uk4@uznM-O z*t8?*Rquge9%OZ*8d|Vy9S1IBDG>~uKirQWCX401*B^Z)krGA++f~#0+XTjhK0`TGTF#=WSW;_DXeV)g`dGf!0yq_@SS;{1PuiguM z$@NjI0Fjr>JX+*5`@);xz=TTT4h)Yp=9sTGDe=CU9ms=fGQ&|AN+5Jzo`Uf5(DYI} z)2;pQFE7@8&DnH%iM_Nyy%ZQZ^4q#jDBzIGb^k|prhp5sjmPzE;I*vP=GpDS1jb+A z=^_J{7O=VY?Kcwck+n_7ppw&?CJ zv(tb3jK5(tYFV_v66pj^Or`TNt5xT@16>)#s@oAOy%b9!Fm`)XwA7~+4PkQ%oYoK2 zF6|+gW%i&~bl!Ay{rfeZLlX+`#jvk51#JpZbh1eNDzNt1q-Bx-Yh+P{s6zu!;o)Dz?oIqLq>M5nE4_?w8?PM#H_4Sjej)J2r$}n z%+BgRI~Kl)T9;o$q2HHLUrJ{*=8kw%0Z87JB(t-_-X5CFbht29bdaT*hyvgCJyp&^ zRBhCH9f|?!J(>xIcVT2XzK7Z&(8uGp=bQ6r^Z+U>Z7e+7gxzSr1Eg8g)+XMJH_j!R zz@ue~axZMIBv5~*e%+-z1A@X!W>?w>ivmCNAva%p`f36aYpO&`ZJ9gt4 zblfM&@1C z=8W>aVOQWsB}Hc@*94{97e5h}MiLyrrOeHjOipyD-*_id=k+le_>mqay!VSIl+2~g zXL8St0!VK&huAI%hJW+40d!vQNIaiBIMb8~gjTQCT?TUACzr!oF7xHGU$vio3O?&7 z1~a+d!{3NYoR#Pj&t`#ncy^#CIhwMQaEctz$c~s?jA9;TyX% zRFu)u>|4-vl*T`J7u6G`R-izD0rz>K!lzj2Pg%`SRsJjp{Lz-6ZrAZAr$pmD>t4UZ zDb+9$05)3=uMG}p)RQ;(#1~;G#M|`Kj(7evqWe#m4oC?^tdJuTADcvO=~!Y6`m;Q& zVkFVns;6Yuv8tzg{4LLG^h}cFgSwKOL1kc_MxkSDQwiElV5ubeu~K+<(eBMuN1S|4u$;>r4zDA?)wCMdwJm#^yxEb&+n$>(T5I2fktyiDD z9fMzW9Zc|+b>-?fOVZdUo_mg^-&cmw#|(9gnP_mLAEShfa`D6A6|vqzM2O&ZKD0D$ zd^}*=eND0QE<06Xx~Ho2Ao%upzP4F8N8&P(2a|Vzbns0i=?fpo-OI~*xmBw;x6x_K z)X8%8b6twZ@}-R>dS|3XFyTc?rz%>fDO9KE*^k_--by{~iC zWqOYGY3(&Oemk7S%-A4XBjGbQoy^b)`WaM*l_b8EPGV_6O|4xx;j52_6ULRS=oU_rEE*QDu1yJITie?X@@xRbu>W4qwa6Yq~71Q`5 z0{wqrSHEV*R0jH6pF6M)Z@j=;QIOna!c)0j+3eu4Y0`~kq^MU zH4c6MZanp{H`J1|5o-Yx^4ccH+mai6T~!{U_=Iu(y)Ov6PoynKh=QBMj8iiQ8xc!}^ zs^kqpNqTKy&#UF6UOgj+7OMQG!P?@h88vx@79QN%3%2~S@I!TMXz=Qb^@N0Z1J3$ZCEq;AqU>+p{gUsws^>!vVcXR-Q_Z{{w?*o=&sa1Fo_L!2tjrSEa()vHq`p zNqT<*d4X~2zx$An;8&+ctqk(p?4(D5c^q$^zTcbyD)Z0{Ptb9%)vIn?PuJYS2j6{T z<6#xFt{V<8@7q5QmCG$ySqr_%#$`a6`-sJijfgq;!gR+)Yi7h1cDCbqJM^1Qp1lef zF{-ZEag4ubK&tD=35B^)#;xDYGP&-D3<~P5Lf0dUiRmuHpZBb3)RLG z<^Lpt&bQ1&=8v1t4~N9c$CfY^brS83d9#46$sW=9m1WYy-&?r(l|oCjc@kr*0dv%h z#xyn75c?(pJnRa6g#Uc-LAW=oCvcV^lwma)}8I_<%tKhTX z@2p25FEWIk^5;#?42?_3-K^y(L{;DjsIPVJ(NI{yiT!iA4_mQ14aniUV&xLJmx`;x z8zS(uBBWyycx|^#gBozQ`{1>5vDiQ+PIYFgb|}bOa1f0v@dbe4*d37E5d-N(8S-09~GY zI`8TPI?rr^HuxavD!~f$)enCjLf+x97Nu*4_72*31>ouO@M5>ak8+nj{I#F7hDaDa z6h_3nM9?$H(}Dh_I^S`eC1+N@spQ=QAAE)H#St4M3B-UAKZYoZRAQuhf=>L_}DETDq&h07~m9A_(ElwWf$_zpXp zj@nT=gvS;Mqxq<0L$PRry>y?0MK`9#U!ag1?8I{C1JBncN7sJE(?I(MeTO_@K}}@n zlU%3wk$1;)8fy-Kt<~J;PXpH)Fn=)Q`|;%W1ZG%hRHS2S;LClApp+GE$<$r(wLB-l zYXyw*K1cKL8@Id7%2%}gZ-+wA{faQ8S-n)tUPc`?)!VO!QSYV7SX*XA`)O3(C^b}u!WkNFvTDiy?kEnqWy)!-h+*{axGFObUc>Rxt@C#|vp zU57eQbcAz+v^K4mt_2Cc>Oa3&?9BVu@2_$B{9`_kd4SL|?YDGYm>ReGuPux`aTY^h znYm`R97=<(^z~cDJ*{h$Jij#BmPXe;;r4p(~_Fy~1MNDT%e zm?_CWL}ndYTt9ULkwAo8WEf)9ij_&WX4&;JUORM&xIs}kZin)m6GQ89o0*lclGwih zWG_*gW%dqVsG9=0`oIe;=-mk3qgRR7e6*iBLj&nw&&z$Iws^fg z*0OI`-}oU%W6$>fviM!9N&AC;_)DJ1MDzu7j1=bYGB>uuLoj1xi8gY+wnm(WQs|C? z+^n&<`kSY{)iq#M$Ih0EN#L{h@!PzFdeVHUO%&ITg=(RH;u4qA(j{!10pX>Wx#p zd#qDR(a#>9NG5YR`%%{?|5c8OA5>he*2y3LtOD~x|9w{gC;8{;BwV|92pA&gSHZ|% zSS@+tYXLKF+4D=%+#u{j8`I;9OG-FDOY4}@LKAeCotCbdP=zz-tE`VCXZs_(leLk5 z=*%dQP0uY-hBgISjjtbS*_ERn3kzDTwkovYP&J>Ir9L0KcitY1f8VM0xkzf0sZRU@ zsd_jKzDUXq80DK6g%<~5o{hG zER5!>x#s_xu2Fu-$Ju^;s8)^!GN_AK1P0cxlO%Nvpy>db|Al{sE ziy`H6zq$^q$ecvhy znCn$RlB(zlaA=eks}DC`Ho$Z{bPaBGFf-gk4`g2p4Z$jZ$g4R7(ziPL-IV-O-CqSn zss9>9six?~2fy=~K>He|X47NZ^jXk4JgOlddX0Jh5l_53;(KV5>b8s}s4yz-VvyuC zbj9-e4;n+n5yNvvd=RRx2>06S*GoraA$`l`qe2MT2s6sFED5=C&sXO&nuPvLUMvH`(0HLkrlpncX&eXJP7E#pib8 zzSKV@E`3dc5V;cm;>f~%bf$j`OH|s5)pbdMN%I*;qh|*WAqaTGnB)qGzmw{A+U4S( zci!O!yNl?2n9p`vZ#;BI8*mZdJKzK=uX@!CGxfZV_M6N@ zkENX}!XZMQyVGxtqbCNkk>hD@#?ap{<#v)apULagb1bCnIhm&Y`$atJ_h$X{sXBOw zMo|$a?m0{T*LpR>paZ_ThPaVHq8wioHu5GGq8*#<8>0;2GqTgU(Cj86hhxwF0TM&m z?R@oE)udc;ogK;5131a@NDHlX1v076zElVI74AtW+%pkIyyel8#(caqK@1tJUFUS( zJ;WOYJugB8Is%h;G3Y+KWjHRj?}A|nz*(6NxVB{no3bigYmaf{p16d}#>uu+Z2w(< zkK-RPzg4b@GKTr%oMvlSLb@{lT*YCy%QS_Xab+5-vJtpQP0Zy4^C9@Z>%r%TE$I(= zU104`*qnzmSWtfpK^?!Cxtk058FrW9M^&?^qVDDj1K;F868WRRo(jU&W5M(B)^@F zpbeSLzU)SI=mjEsN%a8a1} z%o}B@+CD${z2!71Kp4cWraE+`%Nl8kCa9Uq1pCQ`bQ8Am?@<3?f(_Dpn~JzHF@EZ3 z0=h##3-G9+)l+=3o9_#Z|FcfgbZq~oU}QfFtMF)AS;VPb&%^(U$2{hMyj)PrM3v-@p4sb4ONjCm>?}Pan#GaM2|Y>TqZ;BkaJ$|n@4Vv^@4;t z899;kTpo@ z_1+F*dvS82;&~o z%A;4m-PVU;Ps?N-a6I%f_PqU_g7iLF$)<_Y#g>=H*!?9?Hu$Q5Qxsn1g47gnbkkKQ z@Pgi=6_6RQ0hM5C5)DlF4YS&N zJyD%CxU2=<^r<*kzFBnbF9=;^uJ(#G^%RwmSUa&aGs%5gDGq+t89#}To_ceQ!HGH* zrf?RngH4^Fu-`|iqh;}s2BH_~->X{ow_I~v7F&0R#QaGRb8uX*;QM4}nd7A;p|9AGt-l&pEV|2O8zmC%h+;-4{~|P?IRLmY=*7G@?KzSL2+!!uk6W zj;Gp7o1^}5ro`4HTox&^*S|Ba^R&;$GpfXoQx;sNaWHTNMJG|BiN1PL);d!L#k`8B zdUh*4(AfnanxD=_u{VVCW{o*EF~`uQWt6gk0Jk5+Z=%@ahyC$gqS{S+w-3L3Vv9qc zgz5ALN4Z=_k_pfVu$y+k2;Z6+Kz;u{wJqQ!wnyD2?o_kw=yfRy87jx6b+@n$Zw<<7 zE9#lCzsUyMzqi`H{=*XzBmeJ(-_C!rYNzzIiqjl#`%d|)zpr5B=`g|8CFpP#Gvh% zxAXp|(EBv3swIKzUwp4rJ){6WGnQrTn@>V0dGo_~DpZU5<-kI$>J0T$2@nobK5oE8 zxPXAR+iu^hGl{j^Td*9{Q4h{~{l8wwW7WL)B^yLw*TJs#a)QFtCs`SKTiQB?wDveP zTWt6kY=gJU@)*YlJF_u(E;amgK_ImP6#Vy-7tb<*^;t+D~sNzf)9- zg{ZZU3nh%}$JzaPg-`O%XR}}gx#gZYp+OCk>h_Vc$ejFdDGmRtPbYb7>WUTyC>t5uW;hVMrXTa!o3Uv1 z9j7=M;p}y@GMz0mhAOeBHBq8H#|cKBf1Eq-Vo`lv_hobG8Xd54DLWqRLv?(}U(= z4mGBUgZEqzNX{p@=k03f{BMPBFr4?8X_#hngB6*w>jhsaR+am9=130kfJt9W7}VpGFZ@ zUOIolpKM?{Y<6oYe>aLsbJhv0+_N@GQ8wB%@jYfYJS1pLUvrtgn`6$eZRhwFm z2-Po4OvhCPIWZLF0zynTG5*TubEF8OWr5ZLcGe#6Td_hn*QHa+n!372GW?R9fwzCm zjV6alLmFq_lTdM$5C4|`VAP`VP5$Vox z=cox9@Bn^)ma?Ye7{#w-o)yce;0wc`q>12*_ns>2)HtI zp81k_LNCV!R+?-COxx#JN4pXT^1Myei=VBE>M#Pf&W3kM|n;M+y6kTkfc&( zlg2Wc^H}r@LZ&l2tRpx~f@GlugN@Xh&lGbEYcJaN$Yxpz2wx;l90i_8X#U7y`}Xnu~=8NQjciZ)t3otjuBu!fjP ztEmKVnWH-#x?bOiF%$*>8=;qPZMw9)W){D$T?<}yaVm2{588M`V<5rxfd2}jj!qjx zw`X|UGHLswA^GXYA5brfercLS9970=6EgwS{d8#r;&EQlRmP`bOjyQI664ndJ_>F$QnAT1>f z7$G$nqet`Y{oddEPn`3d=Un%7|Ii9(W3Q!kK#{X#C@R4_ZXCq9)3>=fu=yOo0{iOa!c^~Uo0ZyP;Tw}WRQmnt|SOB2uAc> zZlvt_inb5?Zv_L1*pH&EVg|w3tI_+{Z2DGE2a*_7;?$l;u~1Ym)~_DZeeP`Lt$dG9 zgOs8B9iZpOGQ=}HKQ!2?0DY`dCAurODGF0G*IyFJ1Tr#V#Ieg2FR;|tv_AQoU3OBA zxS{uohp17=F(si8rpG5TqHJRdd5twv1UbF}8MHX!!8`HE$!TJ~{}%Iwy~Ke-dX7@# zk@bRAAvp3-yT0SEL|4Dpyt@oRn0==$)U-mP`aHf}>lF-54LSv;RYBK8wD;rteSmt) z#UCm>N6K^xud)*GQJsde;PWU#@0W!;5UZcrFV7|JmvZa+juU8uw4P)2u^#{b@6_fS z_W?A?T+iOquQS~dtl`sJAAYyat5LqD+29o{tAutZT1k5N$q^jAG&T9*9B@@RUBSH} z%CP;r?n5-|hQn(%@|Ki<>hcTIGZ{krJ=I`gVzMEjw+SRSPl#qZ^TJf=DaV>q&c>k( zp&O#ApPm4EO*QW##UT3~ zBcY5IU2jG*6iDJxNe_)U`9`RduFD!J6=~(P4BzNti>;zB+SVQxPUc8V-L*C%ANf0` zPuEECx`hcP=2bwFBib(}sEu%-ZJ2f5bR}v01%UQ(+kwk(WF3Cb>OS$b-gIJr*~ho` z`IybZmuaH$Jy4xkhFFG>(A?ANmvQyv_CQV*zojyPoBv)H`$qJF zRNc|W>#)SI7hvAjBJSDBWv9icntu*Rzl>(T{QE>x*5_y|qd#LN`o@!u>{R{*T{=*H zvc0azu!Jh0Lygti*54_VKz>?##>MNG_3D&)xnRse&<17cN$i<#CBKE( z(&r#l0QpHx7v9UwI#@7oB8WVP0QixD7=k;8KTldnuS3DG!WMm`ci?6^H7{y3hFvQgS0 zoz`2^LY}zrG$Hqdq0ifScbL8$Hxk9Q)(e=d2_3-T@cvfB3~lvf!y8+iQC3OB69~Un zw$R2MZKfU&3$2&B>(%;r(Q};A(@#SMtG?+MZ2Z4PEmu5I5Mh8*SBEFe^&}C24khF= zuDBG@AZDv+`??OiW4P{= zHlV?C0`?_`gmkvudu*+aa2Eb$<~#U`_7-Va3^|q`iM|V_W&66Rhd!1XtUFfl zbN$8KCezYP2@P7~q<=xqS3mOEoshXd?aM5en5OsOt6pYp#$THKc(2{XiL3(xDi5C{ zy!`8^=-W_=dP#%G=z?5#l)W^;b{4w&)UgGvsHnI)T9(RSYq0Snqu^PJq6@U}Xkd<` z!|HV0(N}CV#6%f#p#QVna`}n-FIrsx8%WhcF!~L0Eqk@(`*@hEg+LkfXaXNPSGR^8 zZVV{f__1bV2x(LwLkvm3XSH0b#T;_dMsf?Maj*qdrcp#UWBU!A41mN&VYUOFuX)eJOtuC zOK#uBx!4%shPf8utRh$eTCbKptLLNYfEr#A#@8D`ubB6ee)$__P-PG*bX#L~g06f+ z&uh839tLK5u*qF&YIUNjC-D@p$3CS>kI3NB4Mbev5wPK1!$bjmYOkmH7!Z=bINM4; zqG!aMJDTOPk|x-zpEQ#*uwqG$9)c!Me4p3v!~1{FdWnO}Yw$+9%VB(M-8HC=q72nX zE|BNxP;#_5zmcJ%K!1FB%lV3-t65Rw4}5Q>?p^O`)TzPZ``hK3==5end{npi+gXpn z_rU*~he*(n0}%n%KN1~A<*m3%UrvSjL?eN?mXUI{&rUTLP!p6G7Lv0!($zK<)C45_ z!A!B-+qwMCYxO?s>bxVAddg~CYaREJqQ2!s334ot#eBbTKSs%QGaOjk=T}+1wNLVs zuMzV+`Uy%G<`E__cu7v^T`8M`pfG;%;`c|{xy;GBI2q~I{8ooW=v7ZQU^^g7dwlEn z5j-O!M@L6}M+sS@CAd^TUu?6xCd$?Ox6xq-+K-aGFP^?Ke2t9A_vsUFp@o578P<+? zY6saG)F5s|=k{|XyinbbZFkYY{zCdi{aloIx&|XDFPcCRl{kUyWzF#e6gA70lmf0f z|r*N3C}40~&n@Wr)K;RymieNb0NU z+433wIDQYm|Mv)Txre*O(bCdF>MekeB2KA{N`d2z>=Qg7VX{#Va;Mj?Usvc>_13Xe zjB`J^TD%adT?){hBhFA-?-CqNN4gld4a>H_qhr%mEET!ZIALpF3~Zk-04e|Iwq+-e zwA6PkR_Sr=GA^x_FiEzh@B5oF0mLixD8qkS?qC-<(!=oII+=ZxP1;NNs_Jj>0@1MX z*l>}TGa$0LqUI0HUpv*Sg7%@kXsHX?1&5pFl~y2n!LU7l)R%Y(#^*OMy#D)Vgh%?oDINKv{ABcFVe;p z-@?30!wuW^yAT0(;Tx8wCK)lw$7m;yAWDiWXeBQf!1OY1x%)~Co|}Wie;-Y9RVR)3 zAHznf`U5c3GLT}&iT0gyX3o;tc}lJCUs+|#ud-uEmyoD%5|^@>J<)#QuT_9~j|g`y zI||0WJ}7V}c(9$e?_W2}3h2$it?V1$)(g+K3l!7QKE)U&x00#mLi1ohTa3i5r$^WA zzJMB^UF9P3T70I|Yx0DUQ0JlwZD!(-?Bd-*P@8%}qIB@+ZPIeAkJ<-nw}8~%3#52! zVX-*5>n1`gJ253LMG^a7ZJW>$Y5bbXjEt$L7W8u!J+hJ&`Awcs$gJHx3@&DCx@oy5H}?cTktF}oRhCl&W=L+Y1! zMocDBSxld{z=Y<_G(%wq^s!^1#!ZF2T5j1c(F6F`>2+N`T&q3eo>t}eeTJk2;$4x3 zb>7U$_JCoWlvQF;R$9a|b;~$yAo6+Fws0gr1(v@T_obko`bw2?>O{O#6P2;F3xCQq z3;m5S#p-@*2qU|=Ee9-FM^*ZCW8x{fi2*rlfgDEOP$MSnuBN4^o3xNq3R_#G>f#SU zy~eyfA0H2(A8*nqzL2XP9BpQqP$7~=?`Ji2D+PJn`}en!BWw~bY*lW!U<88BH3SD< zV^qb|b6F{uyaN8GQaT*yG&(YkX%8_y-hg?LA6%cCo_ruA09TgPirW*tmY@7%!7lUn z6JsgGyD%2j*+Oh4OUup zj!sqwD+dia>IC9QW`A@^XqrWlFWC`57-CO$EU^3Z1uv3?i@NnOz&jl|P|k;=huaL^ zwAB4K5f-8^q=D=jhvy9GcOwKEVPA*ixjO6%(!6+5r7uiJZF>HQuu1P%n*aJ2^@7!s zxTVmrQufqzp*V(_Gyaq%i=L%9S4pOtyCWbi)xJ)tnKU-3!aaKDVkBm2yx|&3jZo!m zZgcrd?(H4YFmHN%EZpq7c>HOVe5C_kFW8W%rA15)Q<>y24xIVOvR1hA)qiy1a$w<; zo9<40t6N=(gXPQjyrRP5ykhBgJ2EM93KjdwGA0KsUl=79;}NFD!h4(N^1&~$3Z$WD zVqEBq<oh01PwxvmfK$AZW+O6vrAv zfS|GOdRlhidMC)Rc`oIDRL++Vft2CFb2zNo6%D(O2Vs0%J)uKQ*;>G;5Pe?$bC z*inT8cFsJxh_Tbt)w(Z`>p9d-)O=q=?ix4~dUE8WN*kc9LG{6p;BTW%yr-*$1&SiD zg6H)M^bo5s>22P&d>sdJbB%~@S7&52@sHxHJ-Q-mh<%T})a!yYxt2{J4TLtw-<}_(9nhC5GZl^ByhWF1~qBTjH6Zj5t_{ue(wYKG356l zcn@XQV3z`T>3Dkc0yHIYSVTEeGIUEYq;Ij9C2ebiHUo3&j?M&P;K<)fmYb9+oN4sLHIxQXY`+jxSOqL>ZS_ zT2~=NiARUumW3vbB9N?;2STSWbd@WVo1I{J(#|Y+&#mWzHmu7rz4!5Q1Y&l7nD4(e zgHrc2fQZ6_g)UFzp?|Qc7vOY$d^7Vib*X#-c(wP)Ut$o6|+ z&n?wdAtir7pHi6&dtB}guCHD}Xc;^M{Eq~ax5hns1V*Oe?*2)pJ8w%9XA$J5 zk7mi?;?{Tswb$G@?7pqgx@nJj^kiu#<9pXyxlye_80mgmM`p*@+gnG)wgSTjwV?B_ zZIGb*waJ%X^~Q5!yia~r;B*{RHsf8MjvOh`+%J?!;QmE1w_jgU+qmnU>qe1&Mu<9z z-!VCHe7kOZ#L+mqMA`hI;2?b7zjYR?P{14qYA^`lR~F8v2!xN0CIhO}z^Oi6sV_FG zFBnVwzGsPS;J1cNOY*voT68W@=9hi3Z!=634}>KOZg_E=_L*MCha%lgqJSBp=K)oE z!DBF%v+%_wd?QG%Wv+FdDkCdz>f!@ccg9#C?W!$3Q-(AOtU{{B+o_Wi_$o0xE0JtG z%oIkK0#|a6`iP1-wCZH%|Dl=Url(E3Fb~eMtrd!>%dZ}>4?d&=5_^MQ_1sRTMvQDK>?#xTCNynB7~N0wY_(NcJ? z1DCpsN*T~fJaUuQVuxE4&1)Bpho9_uD#W~D*;J$bmrDaiW7DiXXZ4EPJNA|qwVyHEVNRS+%Wk2*p~2LP z3}K6Jg4~?E(EKLdg6@HRhy^Dfd|fBMn#? z>JJ-hmbB1M%Fy6hkU$AVn@8NB2)BUxWY2K15SmIZ5r1h+wrUp+H5}*c zRlI`pa6sLwUD6#wmY^*{tHtt*f2^U_PyH`tvpZZJz< zRGRWBqjGUT`p&mLp~mG2y)-+g51y5i)=@dsjLRs-EGY1Um3>MnNw;FqO|CuRY`tJl z-uX58LQMb|!x*Rh(y#lg<{3sd`F+3 z)Q!#KMO`?bO1f6q&tDQ3AKco&T3T8ljKIz|oA52KD0Vq5 z9?P{xKjRMiF*(TJchw?oNwX>KS4&1aT6y;LD9$~rF1}t@%$sDDlNa6jItA<3G9o;} z44})1><==1=QB8VBij4o0R{=F&eJvC z1LXTg8CEr&G_w(B z+`pjXQl@WK>Qp6FsDh$KI%!d7=GO51@)Z8&WizKcaH~3bzkuWa|cSj)2mpz#K zdUdV=Z{+?MGQ`fa`+nqm_01fvb>~$mi$-`B{?XLXz=0g|)N#RIXD+ppYFi7gkvv*X z#J{P-P<>VOQGTQ_1+gTmuHi8~S{gxOr);gs@3>9=a;fs4Ww&{b9=xZ0fLvqPT=_?5 zL4V{oJDP<}!Zb~kq4<_1{f5dE^%s?owHOvcF?Y*)88_o~P!T zk&=2F960~xR)O`+CW|+7HG1+vmq7>WB>jieeG?ug47~$g500^=I@;F z@sVPM3sCm+!HmTDN?+ggatQ61V}r)+9kn78QCF*u3o^Zo(zX%cR5ov*`6yWW zt0f_+mL;wz2h)8+H`RRn+tMq5ne4OH!h|+D9}&O?S_xq z@~%_KNI{s-{2?1kdCw{MLFDDjM+QGDD(&TEoQYQkyu*?B`osy98MqsS5(2)oXo3a$ zs-UJP*W4YeEV>z+p$FtH@#gWKEyT|NPS!;`J$B4vI)`6bWTjCM_^L^EzxKrXHe;Q( zHMh1b38znd0(f>D^ey4uoJE)`+B_d8IM+1lb!tu0d-q4Nbhe`hw%FJeCbke`tO z_)p*!cNsJMhknseB_@xPbO}XC*fM+A0K&vB7R*eT1$j~#Tag!r(7 z1%BS17M)pjr*IDm0Q;A5Zq(TUBz#mKac4pojGk`X!UL}V@QrublB%mTLq0uPl%Tk^ zZ%@iKKLplpoUMo=XrCvU%aU7Z4om;1zcCd0h-yCO2_sI8IHSMX`$h*3y1&oAY<`y; z*q^CkEjubJH?nln5nAUf{^QeI={oT*QP5n&$Wcl{9eyU|ehO*Aog7(>FF!5ck|V)@ z)jX}bW3Asws9e(bsHh3HlN4DKa6EkvkUzir9V$ji4Q79EIRi+ZM zG>{k9zU!5*Ase|b z?^|~l(8O=AsX-!xy>DryqAAvZa*T-NXNsklJX;!U^w@8a4&!WvJcsw?{|*2dvf^Z| zNTw%S5sC`)qEqGMI68xWmO9KLnwNB|-f_Bfa{9y-y=eU4LF~W(iBL~xaWyrF$xo+< zJSO#T*M}DioXL*g8BZpsw2xH6YVTL_Lw8_;Yrtlr*VO{x4S?2nIpek-pQ}CD8dPo8 zv=*o3krIQ&IXuwA!?tE$5jZn>zA_bMgPd+=afHwYa}#Z=+TNwNODG)|Nc+6)yuSfn z+k721sk7Fjmw*4y43okv7CWqxlafWOdLXmiHp>dDLlXAfW{IzkZHsS1o2{3Y&ZMdj9Gmj|!H8Ha2&Khll^t z@!_p*(e#t7Ay1RG1c^(&Z{ssI`V2Sy#KHWW0jpwzJRObYj@3HkZRA6Ju zI$@tyQMEH@Q+YSQC}7AxYcJr4>?y)ip~=k2nKLGgkD;*QtIMKqoO5u}m9ufPVYu1BmwQK<8FP)CohB}dz>Q_vT zz9PA%q@yVPQ0R{lS9z-DxsCL>+z8D{@A2*+4p^ML0Pd*$9kO< z(|y$fCapSvDms;60M`Lt) zjp7U&;BSb-G*IID2iq#|ilGtkL=Z>C44?nrwM?|r)?1DjlyR^iC#E=zUV%J@f07xu zB=3aKIN(lAPe;|fwmL76S0Xp!_Be&qXea)t$Y-Db!EU@jS*zF{V&GLiwsDyxfzE26 z%2>(|sHQeDnVb^8%fX@G0DkdUEHEJod10VSHR_)iyd~S-%^Zn)3{Le4iw1MMBXMX( zh3%d?{#TnMb$;V6qP3h4AKV9XcOt8z-7+9}$A_)~UQW}rE9gO9%b8WKeI-5jGyup= zQyVq8xD)SbW4eoB`*Tv6nO}gPmOf*wrG6H+IL4dtcmNg|p()8cAnilnCIqG{d!{fW2aAMFAi7XYg;fq_*+8Z){x zg1mB4NHp?#o;+*nJojHL6+oSgjIA_k(7M_)J!v_ENHh z%AD_}w-0HG*Nb}#_5ZT;b$+Q9nUYD*ZFKO|taz!dqL!JF_c;5m&uc;~&{**I4o`C> z_~B5`*yrSWJ_<9t##X1`^mw%izWMLi*RB0TH@ztYAVyp5_bbQ zOSL9VAyZkDZk>-+kcXe1PYJxLeK!$Jdi+QGb<_e8f(bLk(RQ|YYRVx8JNc(00@;aX zerKLX|5|4s=V5B0cTM-UwqdeP){jwFGybb2PRgz2A-(fY#eH`#Qm&?TtS+q7+Aq&t zD8oJ|CQtf6ZVT0j!|~YViP1Uq>cWqSeyl6GnKyj=Aq(JcXc17Q-=DfnxvdMmb^1;e zeU#Waid7UdD)kK|ct}$gMP}=W30H#cH&1@?#cIEQ9HR>AJFA4Bi7s>(YXQqA1H&Ib zX-hB2$||L5A>SA_LBa6HZA*hsy(dwWBDtzJ1|lLE%|A)wQ|Mn}OR;}lsFK_$52VD5 zH2RrR!C zj~ex1()oT|jZXnLCNe-d)o&TizV%XCQK@HSp}vVWXvPVkwXl4fxU(}4T7LHU=k#nW z_BeV3f`NVE`3`joyqk$`H&Z=3zSYzsU3cX$(CE{))m3?8fHlT}i~k@z_-=Lx))kH} zD114D1jm)F2(2J|6z~sgaEsborgoQ(4yC!6rciE%qg47$4p5 zUC((A!)qLzGN4(;$x5b2jSJ?}DY%DkgC4R9Y+p`Y@mXa47H_)|NCfN<+4tCxJZ-*7 z9y~0r!DIq}a(9}Z3rGK}Q(?PF9>&rMi@?=Ct=D8A9jcZlE6yn>UAm@4Izn>sB z(xzGRl1ybY(LMurDI|6wo)yX`{oNdBA$u9&k}c>0Uac;{cy&OYB~>$;)4Th$j!C*l z_Qwx!nw8u_k)GERJOM3~XT-Jk8XOz(ZbFJI)=zo^eSAet;E&h*Qi(%&EUdq>N3&KQ z{@z`cX%onsmpjU}x$39u3yO)i+OErh)z*z}R#7(8Usk4VsU)euE|P7<6I3;laNk-n(!<3c9ZANQ_E<9QbDWZ~a}|C5!4LH4 zHjEhhM(MbcSd)^O0@Y(Xo3t$3s{%(sap$yG-tz@bNLqakz>b+Uv~EpWSXT5V43J^q z{9FxWl~pwo4Ol&>j~>YC#2UmcL{V4lmx6c~cDGbknl6_22a>s#BTRc(*OS0)p^$}t zDMAVn>rF8vkvHm_>@~TnsJhCp52Fl^5xgRaceXv><&we>y?{S_{82+p;k!KC+}yl^ z)Sn!YPa4;d5b1My?VDE-KABCNp1W`M(Nq`M`4i=+$)q!K#Z~=jq zGD>i;mM84cnZ~|VU}naPZR#S-r;VecW!{@E_jAqaZDM~N3gY-Lcm2t+b@fw6a>y&c z)z&~&iK^Z`4RF|5vv|m_;L};ES%pB_zVp2NP#6g)<>cyXHWfMASX}JDO1~G4e%l*| zrP1Hqv?Nx_V^iBiw1-k}qQ0&Ob5L#8sHIBlu%%&t+xIV92RB$@zUSrTa`V zd9+khrOT=$IMLqt5=Hve=MK#2dD=88wwIEX248ZI1(4@tO-scgqOnrJn^gt4Gi{#w z+gNiU$0MxfR#g;h?R{OU&pVe5jMbzyL$18We%nuhT0MSqyMYpKp2QMBKB|+sr&qze zFuC@U|1H>FseS_xclgrOQ8+pmiSx%w%f@Qo{6iYe?=tOh@o-tD4Ji+bYrPU!Bjux8 zDobpC;l~LQLrG$(bv>s#qq07}q_N@@gFn37F7VyKVbkP)__xE!o)ZMma(V}*HU}50 z-tXoI+^s5FTEsS1syEpd=o%nyaJ0DcZywS-<9p`*{*sNN+T>bk-A#2d(lNemfjOHz z*mHl z^GsG+b3~N^r|^A(81i%uzs-E?dR(~qx75ObmBeVM6KiX-^|hvIIS)DgIPi~7gKqw5 zYkVm;2`j2wHNZ}YBX=@>v%x?=T}=PDAlZZPg|{O{;Oq7G8-c7>aq_b-TgBjOT|6zaQm#I}AMc_h1P{8GUF@Wh==U4ge22=4&}Bi0dawD)6wv*s>lBxwJ( z!hQr4dkidg^|-#RvG&JUD86j(ej zH#W2{adF7p0NR_%o)N!4Mn*+oHzaFwwlZ}GDWw9(V{GQxQ>p31a#S4|(;rcoR1YFl6@?t8(r*cxzeirvu&KC+|qe1gjlPJOp4 z@l0O-=1!|?@J0Fk`Pk#WQ_ps1VK2DyEfY zDITkbvZ0rdi-RT0D7$8}Xo&soBca^|Z5OTp-;>4giE7I! z5=A6>YS~{KTp9acaGm(wF#yeuIue-(g68@P#3j5~8d7L; zN=VjJr2P~^V0s}pQ8LirZF2Zb7F$i>*lfr_Rsvd@I&yMgf8@!4$47E<=L=Sw%scae z*H8ZN{NcLkc&eMQxGNHUe5AR8s1%i_GDf)Sx7EHH-9*o+jLcgeGJk6746QlDM#v-7Q+ZxDDz%s)a-NHjJjr?m6V zsFUx}vgY@oB4Fre+NqAzV7l3LyAn+x;WrzDRK^J-o$0QfAiw~A8lw(eDhEoN(DW;e zg#RaH{ibbT|?-TVCY$iS}>*Gr50Dv zxeZzH4KP1s#jTs#Z_({(wRN70q8Bc^8JYh)YxXpV*>@WoiV_tApm@afr?UGBGTo3Ew zcVX#C`W;{Y3-*7`8sD^`m`h6ZhNJwYKWzb@P&b=UW43==mi6ezh6@=TWCm5d)!}A> zU%7ej6_0_@AbCLJUb?h}E4T6rwW%wr*?74Gk9#{Gl+u>*;_wX8Kj71f1KJ#RL@;k; zTky^`Qm^~r&jd0J{(-!DOomcU^|dR_V-bmM*Gl?{NQT6@a>#$;bfGLrs7k%%)$cRa z23_KharB5d5j}^63spBr-g-@8e`BvwjHgmX(3Mh}BD1bwYKCU6ubmUO+#L?;X^ z(Aw3s+guvPjZQqP)imp>x80ukm+^~h9NB061261F+Y&=TZaTln3Pavi`Oc<*aeuHC z;c&nf7@@WiX#P;!gAhMFBg^aYfEB!n7#k~Yb9s;zgH?H_5|SNk9jSa+BO(BQTaDw!U)1~4SC|fP83}p$J3bb(+kOM#faae!IfvGb)i@J z{&yr(V?*Cc#}CU~)*HQdYJA~q??0!+T-965|1GVd45OCAo8k2Fq0O9B15+8YWiKbH zK$_U#t!>qmE{q=E7CP)8;YM&U!@n5Zmy}$O{8dJFnp# zyB89^zlTBZPTKd5IgH%ae7U|6-zkwvxV`ZKaeVg;c7wx?=KJ|-0ZtTBdK9$Nij6b8SJ@tk*Fho`@y#y{Q&1@ig)m;28GeK+W zR^X8)`6|fGB?L$&AV`&GMlcor6-gT1XV=}GEZ3rD-M@>@^Ly$HCp1UM_0`{&%xs*6 z&j7)pcXnapmDJd(UR$IMUJylMkKs15jr(*sy2$+fGn}@2JoClPrksT5!PrpX(nh zRI_eb;EkOKsovZsG)h;0wU?%3b z4#U~Gh{vf5JoXIl>)reACXUF=&+escKbqZ8v2wEI1DZBJ4TN^?RO(4Uu|Rew9UEF)O>pnXl|~PFc1tWWc{MpH_YW5cwe!10Vy1LP;`~A4SGb|1!nn z4MP4L(O`ONy8R`25FG5(h1rm~g2@w3?~Nx?&4%=dvbT=7FV^nl~Sk`t<(cmWR!}mQ7qA9b@~!xd}zDk zoC4_!M2yXzI#^jLjp%>9t3`BO(?UsZ4~+zt*_6^heN1RsS`F`~c(m%V8ch;~gFR=$ zO&DrcS16Y`clm3=bz4&ZaCx$M1>WMeZFtQ0U{+31kmdI|PIS_h5-r*DK^v=Itir7` z-c!NSVl!`%I6{gJgA&F>+?v->4N|JeloYakmh6BhfP#~#xIjTJ^ntsjIbA)Y)mgMNiiBvAUGsbSRCQDaMk2j z(4>^vxCcFB6{G%$_;~vM_fP!r*E_{uQQIM^d5Cr;aX*A_xWxUnooUDh5#+oi6qS@> zF5T?%Xa3_~qj1{LNt-^TP3RPJ#*gK+6&`%ONLKX@V^Gxgb_?2-aH;XS@D&q_x6IN>6zYM>pgMNeQxY_gyQRArmS^S+CNNt+9LPSNp2w&f8C*XTzzLMHL^HDM}nqZ7j91#fpfy3e%X@y zbXv$$RyyieK!UY`1@_M)z3Y+>gN26ssf+=;br1Bj6sDp+BUZ{HfDcy+Gp8HLF0KHz z(7B2H;NfH)Ln%<*^R>|knH};wPc5ld9EaSVsu!9q7jA?0d-4 zTk`?C=oyCyyRYnUu6J0Cigh7SfgZ%8BUeh1O2w1xY!5Rl4^S~*pj*Ise3)S9*5jFU zpcV%T=lx{<(?s&~Ic@MQ1ISATa{Ei~p>L*}mb{XWR~a7|wE5%&Is27gqxtwfTLL$S zwMC+HkGJo7Xdk!?2?0y2xlbM1<)Tm-hCcbiyJ5q2#&{1f-`>mPQ3?Mm=%RbVm`lBw zY<#ht(Gy^kA6>gEldC9^8YDENS0e%KAkCDyA~e^!|7#ZVc(~-;JP5i3y@TH7$F_z` zi&7i73Co|(#S2uu26Rp(5_c@4x=;I=rG|zOr~&RDqpWGf4IM5c-K^0ipz`!qiD+Jh}|de^})gJ((88u|NC!&R8Usv5?#}d0RKjm4+H6 zswyq!W$LhUpU+ehm}x&igysHP{HloedoR}V*qCIG0q&7)1gMATg7$fh49_ke)0W9- zYR@U}Vy$U8QCD)47t(1vdLq?@Pi4#;XD9wxA>q;QQ{bSuQ6EsV{<=VZ0x z`Sgui$f%2;su(ObZH$i^o1w;#jl1C||HI29uf{r4UocF|rFvZyB78)aSNGSE1#NKb z)I3$+PSH{`8|{E(c;jq55HT|~Ic?UngOTts=^1L=K!bK*@Dc`4K0=;q4x~i~o6ps-Z>I-u<=#b3H(lD8r@)lt0nzS&k}SRcq0t5ugleBJ2I~_>Y!> zGNU>%RawoB9H3WSnXV-oaW8T^EWj0uTP>~VYb)X(df)dr+LMz!`;8KPH*G99?~{hv`=GM86aL-`il;nO6_5yld=V~LbqE=JI9 zyq;@TuISaak{o6fAV;>$t=vokO?k3Sux|aI9q%S+zprJ_gA9Uvj)PdzB|Mhb&B~Yo zls^u;DBcnVi!1@Rn%HX?k>nXA-5|`~`pE6+Fgk3Jvh`TZ@1U8N`m|B72SJ&Clj^k> zZiIj%ow@agxA42sDijF0_-2O_)GLOnXT(ui0^8C|UVppBP23*tqCpypnB( z(r0taGqb2Ri55bRm;Z3-*jjx8%ml6h1ox5c?J?*X{QJr`ZPq!sUdkr%1B7VG-%F~e zo|nyat7*%h?Pv$EpDqd~G8&W!P9-F>I+3BE&Au1N9gQDxLZydc44I6M3EgsB41?cx zT!XkD^wR+ayWqFRlFDvR*@P?*^;u;RG*_$eAC%QAr!Npv7;8!+qmaUT^hn2O4w6kR z^*e(`hdS4V5!Lt5UuJc3`q{2x0_m%jN;L7XgEP zt?wqii!F2!lt^9L@)H(q87#u-q!T{ApO2@Vz=1VviDAUBDAY*sDhhJ5vLCPz-%v{) z8zUzFhCWSEvnI3hhFPBc4QuH;4^@6CxcK`9_1~N6axJ!t^42xx$`WtYZ`!y*VOD0n zww#p#Y|}HzNlAG4c#9r{oC9ooCTjbF)Nj9?(8&UwANOMwC=J{GvF zDIMmp_wS2(=9k>WLw82B2VtAlDo11!w)xN`W@`b8Ox^gMLgctXp7G!ss8`8g10?ViW%{KtDgRb7D zKixowu}{C|-v=Mv&Z<4r(hURh1J2;6vHO{nT)8DU504{FqLz;2n=|>(cdT;~-J2@Z z#P+EVk4n#KOQtWokRCkZJQxNu{nTmS`LBEo;^1vA3Bw2;tF7W+m*k{`EIe8Y06PaF ziM=*cd{EKqh)v%!9$i%?N9avge0Z;#*PU5+;N*y8)%?1p%y(43Kgkjkc({QIs{ZQ} zgB^G^wJ&=PeZwNUL9L%sBxbsvB?9-UnZ|W;A0ZuWl_IKnQ^L&qXsO=_ViLYsTNmLn zMJ9rnguaQt96|dY=@LO8O9x_#OOVG#+wJ~StDAkHns;cdgUEv?Lo;&|4bdacx|8#C z)O<^7D^J9?#Nd?U+;$&cf1_wp6G3SS^F?L!AGd3pZGLljD08C8y>DDaPEJQ|Y~q&I zDXNMg(xny(b~1H8KWjtDZ|{EJcOSGI04PsP;DBZ5)#w_2MCD_Z6Mx>`H+{;?M;T7y zeLnL~?t3tS1F}Mv*O<$3T~I`d=<;!#thi_06$;IRy5-#Lppc5*q4u%p{JYNuKY>Ee z55;nY-18s$TqW6RytV@ODOJUVBJmF$BC~S@h)8I4EUD zCXw_!_cN#X4HWNUG7iz;zoQ^It|0!r!w4HKDfW?!Y9Ikxcqd;|uR24RC)TF2b&HSD zsShXscYX-tJ62fxdzhqbc)cefy!uId>tlO5n((Aqo7Snw7W^+etN*3#X&)gb?4os|ePt}i z*0wK7?2~upcS1U?$h_5)VzoKB1j1a~2Yz8@aOpwYEeB0nt7W(9)5Gi272uA)n>>1k$g=x*<33|Zf+uR3BxQn4TI zEw;MoOzEbA*4y@R6U8SjGkcZ*-&t*Ynl1+f9HxV84O*DtYN8mX(qetLJ}Qg($075JO639c4DgFiEngq;ML zapb%JR8sRe4K01Am>om!aR^y<4*Mf*OiT5$meHxfhnx* zYoY_Sd+Xm{g`6mg7J{2vZq>k6H^>I*I_mz~4`2NrQ+|3__~oDD_fUif&0qKBySn4v z^Y&1Q*W@*_U86qW-@##j{mh#wWMA=#gloQk`p#x;y+~1@x+_ObdDte|nHFHomG)b* z#_+5ngS_B`A~r?^eB$7cWm{3qZR_mp3|noHRClOhvuWxewSRj?&*6NIONXVBaYLsA zBK_=;W4+g(D4&Rhjf*ZDY3-vdU2G*-=y4Dz6ASiO7dE^Rs~j zc34NIcy5pXkz4VIYZA-Q!{CKAMs1}vw#l|hBCLjr1L*}*oI=Gj(kO^E6DyK?!?UL4_xF$IOB&~IRF*A!%Z zg1#$rAX(T%OPv@WfjKKk`p75bjWo7r^e^^VG~7knx& zDHunp=nBgb3XUHnUdnc6p)JhTgq~!IsgHJV-G6I7|MPvNXxUSc`FVe< z!-R9@wI4Xr?cCy%bR(LiPIki)>=;nnbrfaHi6|fhmpUX10*;U*_3oH;rPJkyb8}W0k^{YT7p%Nlg1gaBIrEv#Npll4<$j`zViSi z0G?RCW6DHgU(@Qt(Zig;m|g58zq!{R`t58QDW-kg9yNGDJZ7TWa*7W` zOqN4X^Ncjo9Rq_HQ>j+!aRT|NlQw_e+*y6S?b9M;eT-5eTD*Ai)V_yCN4#&Ff63%j zYx{!h`(YnzeIi@H;Q4~G< z+0Xt%AI`p*;*Kv{wrtt5Wz&y2!~Qg^J=5L%&iN&eee7e;JoC&y^hw$aaU3&A2YTTP zU-$^O_E7KhLulGw@r7SJykm$08(Nb%f51)eb9@JL=f3|S)?okZ@G$Mi|3uN1k6wG$ zFZ2t*<|18LL8;?ZEwlBBBMn=GVp zm@J6ZtOFn-W-2(fV7(-%B!)o62z!1qCwVTZo0REJLE)Eo-qT2&%M}Q6N$Lfk&skve z)~#dpcH_eBp+zOovcwUt2!<3gnhCMPq1nP_@+>&fICb6%NZ`CAsdJiQ90s)M_1ib! z;heStYi(e_DAmM`HClIW+1?CgwAtKQYaZF#ArRq!ZiR`6ptXHIck)|ww+q^9!lO7N4b2CZkQV}sC9`#-&<1G0-QbI;`Dhv8U-{+4M zNs>%eh^@6*w4J7DMnw5zfH7wJoaUDlD9dh(AM4|*-%^!Q`n^iYcTpZxXepRV1p&y!onYw!Ez z-ETYp#6R@geWch!SN%gD$sYr(k$s~78O&e?|HpCQ4uDs$-mCLian7rfdQjB5G*#`9w8KhOuU^``_;v(rNt|zaFY3L^0`|5>et=k^?mbY1 zlmMh$EFQgh!KN(_w5k)uQYo9zb>LuVtTtY0nKr#%6pX=$iu1-fz&URw6A4AUNa}r@ zCeAsXEPQAGHj-p~bhMQukoS0n+wWVoanshZL}C|u1&MR{z}f(ZPtpWjCYyvBja@uy zk`{5}nB$Kq<3b$R%;|I6uHDsYz2)NU?F%LWwVI|$Dv22JF^xujXr!{RRLIKxYWT(v zev~-Zk|2&wBBngNCHQX(t}71T9##e#@O})|`C8vBxi7 zScrmSRxVLbY#6N7HV*Fa`7m{;Nv%T_wTRoJcw-QCim34@l6nOd-yWx&JdG+qiW*d% z7>}52M!+kA8uem=hxa4=N1})VgkhLPkZGDu3ED(aq^cR8WDkMl_lv1`dTM4Po4CzR z-Jy@lxpt(^0b=@nqs_y~CH6U_>5BVd7-osV9}3w~dGCWDm`YKma=9=JAI8mg_({?J zn7+HiT=!8AWCJ5v$6%l5?;jX{w0HFf!%Xx)gBi?V1_#7}5&-YLciwwd=e>y2y+nW= zezGQSrhWoV+i6p#Tx`^1j5@ChHj4sO0PobQPO1la!5O?Kb!s!6nY|B2R0k(2K%r3V zuo6NcGEY12aT9Uf=JK=Wv^lg{-(X;HXmo6>6%!WPPg)R9CP9SJjH@y^tZJO|ShdF3 z>4V1L!B{&!J~0u;Q`5^AJ@c9CwrpLsVSBxa_vDIZ?)=$a{hhbnJvy*EoGg!9=qTh* zIq~>txHhl1>q(C}ZLNw+)Y3Ltq0N*q~J2HZU+aIH(?ntXsdX;r%oraLJmx>$Y#Y`S#l-${)9QA(Q7E z7^+n2jfS@+mt9JOr0s$1>6btRbv|1rJ4jKc4K`1Wa;y5xUCklhJ0ljCVy5P<9~Q&p z4^=JRA5#_Lj6pt~$o_|I0!#_o$fS6yF=ndtJ{|i9xYN^vy-EL%r~|P7uCpCYiEsV^ zPgi?>eX6Z-{lY7L5t8n50MBW+T+Dj4;Mc#nvRi1%Uy5%ms?c;}6^sDfAL+k|rx zkDC$+QWSDfnB?LMY#$r}IyyS~JBpdA{j$F9=bm@A*q~f2<|ik2n=m+9sniT?p-t9sv9IT+%+nlQSKS1ocb7SXFizI*--$&CX>U2BbBBaquQPg&^=~b znaaLTjY*x~F*NKZ=YS)4)``cAEnc*Hd^`wEzEB9lXnUn{%RTkVwhc|XRMT3;HxkX| zOy(yV0f>WbqvON%=FZWvbaGTWE8CBZRh$!NQOO8f7}J&}(#f*^)D7VUr0v^0IUT;| zRRl!6VAM_SfhnmdZBGtA94uS5Y}2Mq>@97XRdAyy4`i`;76b=D;Qb!i8RuNFSOgl4 z24JntBKYjjsc6r8A4O3{2cM38;#5`5ma*3EuGN-)=r$l1R7$=#v2~!P0M+O=zdl`B^UL6Du3EXK{wiM3XxnZ_Yt^8+{D@)Pa9 z3~;Stt+vbg5|GOWPA4Q?EKwDx)hE2hxx4}5G~Z}6vTUbb>nN7;wfYDUgrcfmn}GN( z@4`yl0Bq`C@YtXB_sjys^3gB6Et&sIK-#UZHupFT3PRA`F&k*LhC`W?G3%08Q%4kr zv~$lWv;rit%TCVJEg>c`Q4Sa#9oJ~6J;N(LNs`oMG{qoJ$738|;;3o{auNW4d(Mx$ zIu>X7?)Ohx)RRPEp$JGArQYRBy+B+F2`t4jV4XH1DdzI+uTGDIL7I&UMM1F{0ogs~ zoSTU1d1rvoThnMX8a2SDvAQ(7jl*VIcZnt`kc^L##3o4qm!!P=iUWQeeiy~;6@4B1 zCjh{zU1Pt4z0Kf{4l^B+8O-4SEDq!Ypz77DQ|~<%58{PjA1Ajk;uSs-90#o{wzOPLn>d!IUW*Ijol5WB}MJ@v%4u3i)zyJX2e z;+yL>?pnQO?L?nuDj0iU%qoVPXT&Q~QgIqq1o44I@_g`M{q=J!bhIvVU*V6v3lm$~`zH{T=!QDG=Y1A~= zAxf=LZ8V#mxsuy6!)z4RuG=tCtv;|}eS5{s(9P?8tJmVZc#IXVD(PfjL{b1B>>2Nv z8WNbC6K3+9XaDm|HhkLBKwgY#3xH0J0zW+T_4V!AwTsEBb{OS>v9U2RK~_!$(a)`pENH;w`yNR(w0`KZ_EPQ2)j!LI^IQk}h^gzo_+CTiWKrMY5r!c_q(QMDSIr~?pW!QwgfdL3xxHc76~ z)m;V}HRIDTS1tneX3c4%%UeL3>LqTsy&NWJ7JEm4)GfDR4B#yg`VJe$QN9DPX-+gU zK_2L|-dIV}G7yG&OEZuVNE33ooQSkqt?bQKla^2g=JXXB&3UR05K-rx*8w~yl0FpwmC@8n`Z6ftJNvDaj zG$t37B43?4?LiQgeNUP;0b|9Em~y!Yq|F9tk|o-eWTL++-I@nlA+8nsW)nzT``&oJ zQ*0Wo9`O0y)!*x3%wPsHn86Hw&p1E=V4T5Qqaw~=#E7&fd)p+C$zpltMI@8OyiA2B zqqO)yvgjL6dmOPXM-h|MivaL*ptY3pi`wAQ6*b9JZMxk+Cf?EpXUOdPp#MV@+r# z`8iC+yDeum?6~^c8;)MS^eLwt5m}qhq>Mb0Iv|W}9lWPA3IfB%9lLrumk82fz`bKC#Kx0j0}h%RsnY$}X-! z;ej2MJMLaB5*ja)le+CV-FpEqlHl9pn^QMNTMp5*b>qA;Mc5LIS8tq((QK1morvKP zm;eAtl1v5ns@h5&@V5W=&Pt{7?;rmdP%IWtKKbO`yLSVlqoc3?+rRtlXFm(%a=CZD z^PSgRa}DsFZ-4t)7hPnG`TqC65B%rnF1!E!`#Fc}bqKmTNzE~{Q>-Eon z_On2#xR+>VnzjqK)>>D<74pEi)N)Z!(*{tWs1k%;0B5}m8r}v#A?=ThRgD3!9dWYT z=K6p}G1p3(efhAW1}JE&YCFRqYh@4wZ4OVutdegO!~=n~iL2qU3URnw{7a`nD@HZzX}L~QZedGodFgvpZA|1{B_*e4lFssKI5X^ zS3KvsxwB6Jq9}jT+35w(J{I`o$G#PY;r#jYf%RL{Tyf}G&*=wBrP|=GiOu&4aOA0- zx$@3rtN{3oe3$XREQqzH8%SK7j~YNAWguwwbd{4@9iSsOH_DHC9|Dmt1xY?GW{rhv zIa-GEfVcJRR_*HQ14N`%8MH|U5H#oJ^P_Rx1iVkxXzCIm9~BZAPc#P@QfsXQ77!cY zlO&e|CJNf?!$MjBD#fnR(AI-N;D}bS)!!jG4|M0kUD_;4`@84J(yU5rAXn@Hyv-+? zHx-*(AS~y6vzf*TFt6F2i(I2Q0o0v%Y5Q+@^N5B?K6?Fq z_2jT*-AC&2Sfe#iZ5{B{Ml$0M^(TcmJ%F68^BNqQ`SuWNH$8>0x0st#&MS;JlUgg; zJXU{bo0x_r-6fCC?`+Fi3(`o^@n*7VwDx;He>0fDpCAtOV`CJ_0yja7_uAHoSJZiY z;In2rcro~lX&|VfUF-*w`nHz5FpXu~4oQMiY@*bf6b#giZ8=e_7g1p(4a$%MfiW?= z)c9Nps3!8Od+tB$@#icqitN$ICxLO5Ygaw6b)uE#%RUYVoaqfnK%pW*#n=`;u_Qu8 zs7^VLLTo(@Xpb7>p&1q%VNNkWyY23tIeiNj%wA{##1KW+Kn=EStwwQg(RDBz<5Z6+c%8fzik)LlAsaDm;@Eb1bG}(HB3$5)gd6E zm@p0O9rtZqv}DB-PhM1p*g)GL*=9VYRlAyN25KW|NKQqp3xbUUBg4~t3_NU@s8>vo z%a@Ya)h3Jg3L7UXqb-jK5Cc}cGiJ)u4H3L=I~N-x``jJs9mckAfIZ>8Lw(!TO^s78 zMraR-Jp3l}lxGt##cQurDl1m3m@>U;wOY+)yIOhbsi#)P#()ac>-Af1xdkYeN_~BO zn>TOvNdj!zv}roMr`c@Ya?34GfBMq_RlWD#dvopPfZOLtrbcXYHKK+9#V`n6kaz)l z+;9*CyE+A!mn3uQ%~})y+d6`I<1Mu@pmE$QyOT;CaOJK>tKO%sLK)~`$OpZ}TocG@ z_Sr#>bU_uJ#akb^3po3j zPi@?|@oS&>7I4bBr{A{b2Ty&*7|_$X?86_szHCkfN_pv8+{#4}Z9-eS9i>95X+GmR zwTh+{0>e82esJXt#~rh9s4@y{UN`)ny5=_ zl32heDQem_ZkVx>8xap&wQJ4omEq;{OTcRuF8aZ)O^;nLADEMm-hbV93)-dtJ?W^^ zo^;}h!7u>c_FtclJ33meR+dSYN~PzWdgkN%7Xp4Pe#KQk2(yn$y%~843_xnfI}7%& z799^9fjHlGcRs`@@`EzzK6?Fqzg)NTVSn6a@F#}ZrTm4*EnL)Dbe_N-;PzSGTYml7 zN4L^FEKPyL>y29mezkERJse*-)p9;u++8|hZqHduX7v?w)|hNx&Z{c5R&w*!!C$W1 zwRx;|SQ~^{rQBIdW}UL2@90@w9u3W&I+OQ!)q0$)8>-yBYwU*210(g;A9k#01~d5I zivuM98EqqzhET8S+iIGMimEy>wq4>?#}qj`TWk`O{1641K4~Y$j8!T>{`vKH_xE)c z@_}QdS{)i6aflUh$W=f5MNc^&7^CX84i63u4tg;_>iqrd9{9*7{^Pjgk6to&&cfMq zTlGeoy5HP#^RB_+^;>rMT!-Xy*2-7E^S!>lzChE!As;|6|XgQ zZg6bOA>P_Fak~cwulV+_fF47NaY3-={s)?gi}K-3x8AbpzPtMRdtdyVi$fcf@`a$; zs?{gf4vgG!?|mcVNQRM&Yipd>x*Cf&B8eg=FNN3 znP&$xU*s#uFn=R+O zyX=3iFNJ~NeIV;MZ>%+1YIEL8dyHf9q6yw-{4SMg9IHK|dLr#a!c2|}d$L@|D{2&n zM@8EP(t9}yKU5eSA{IzpCOH}dmtXejdcAI~0phs1ZQGWN)?X+T-ue%3Lfe(gkACp| zh5q-eU@6>!aw&1)DV0T|- z>|^DBxo`v+cHO|T(%nh27{IgzK(o_E+nS9i3h%k+-d(!}fa-*P<})A71n=whdOn|b zs=yVWzV9pldH-L%?9YI&Tye|m-teN+UUt+Io^m`;D5ux`c*|eB@cF=pu73Ibcf>bb zb1U%I&wJ;a|K$fc769-3>sxR9X(bz>_^TIOa^c&T)RG3^r5TWG-&-DWktR7HDA|Hm zfFN89tp54B6|<{b){O!iZypW{oz|3qP4^Gp`O9@d0#L3kYgB*w=_}p{cq5*UH1)&V z#(`&?{n{7*#YOkrxC?NDJAbzOLnC8b0gO-8haCV{eekZqO=-uX>_}`e${7;?B28>} zM(FWTsFCfV0Nk3yzi#@8;RMJZogdq#vbYae*t_`q+lRU)r$wH8`V->LrB8bITY)tn z{E(-Sc|-t1LqjM3zjrU6wGg=ajc>kn)93Da`@aG`jUhi?3!4I{8~^Ffktf~y3t+>k zXQnDyLro9f0eH|)QKc0>*djCdKZGZ)oO{XfOAfI>ITxP1uy6n8kC@fDW1?{|M+kvt z>VT!)Y3baK z!XXyx%!hM3i{~t#^VB2f|Kfoi*KF8TZOt^SW-xKfC z=bTT80JUODJsZX<+i$tMR4&f$>=UQz+_qgiTdA)EWwk}rikLgrZVAJk>bb@m2?Fwd?L)1w=`lBt8g(p(OTE-bqNgZ&-A6Jih!V z*GEwpSSzV(Hfp1_My=ZNURzRhHY8UVOw4#I`OdFyHP#dgQK`FEf*|#N_wJ#3v(ZS@ zTMKw=oyg9i@yf(Kfo6uvQm@vW*sRR#3`S82T0%?Z&fODh##(DfYu4Jx*tFHE)|zpg z3^&sh>w;3?#FC1kk|wvWT4f{z5-)gHt&G)Gtf+?@?!7w~21ZS+X(MgbgUBHUZ@j7) z)ik@j+4MFd7?-iM_rUlpMiKAWdl*0kuZRj>#n_DhFUDt@vX7(*FdemO75L9je|q7< zg&C3hs;jR0{O3Rap$~ls_=kV^2k-q!C!GWwd+f1OCSv7s`O-@-eeZkU`@Z+R4>KmYuB^X37SN~KUJ{LlaV4{+6YzkjGhnS4Vk*o+#~7j~OM zTLE`YE3YBTEwE(U4!3x2G2I2Md-DAB=WARal~t0 z^P2B|_q*9Uectn)7ez&&)pXu-_v)*Gb?Z00{;%J+ZOeFPZxcWg&&0p}>%Rh@``)!e z`1vnf25j59yQ7@{w|8C(#Er$k?YG|ry!53n8}R>pz$2N;rqU!NC<3*53`BWjjPYp- z1VPY>Yc|ROJv}{9p_t{EzqhMKEP zG&A8Y#m6oksyBc$&pqyEH~#wUMe{hQ<|!iLqcDxLxr@jcN39eZ{?Th9&EP??xV!Z5R?Gz^9~{(GT12{X;h!D1_?gEn znBQ4EoDFv5!oN6WSuwI-yk(s`$gjbia{i@ftUO~;{~>n04_5YfEa^Gom^s~7+`4{u zwedSWnKPKdpB@g}0YDY+RZy?{>jC03eHxgI0w*O1r?hk|`!uqRWb?vmv0+$iHJdGO zy|X^E77Lsh#VLMtd^B#hT+%Woz=|$Tx(Xf3LhdOgK>HR^>_ zL}g;4VvKk&Dyws`YwZTTK;ps@MR712x8{exgzXq9jSvRE+geV8g&EVoc(k zCT{DF9oAZF#5fnnNu1)v3gQS|rhuCI)GL*y7%DZ9Y7JwZ*G4mO&Sn0=fcJQ8948aa zrco8Ih;iO~G&`q)y0$Tw_edJ2Ns?~f8VeE{QRmXsJ4i9!7{t0HPF)(<#No#$#(WwA zNjC7CrW#oFsz{|;tt)~iq7J;ZUcGp6MzwwIvguMk-5b_VU1Q_%ngtkMW$zmzV-BG* zwXSIoOfY50{Ak>)VF(;|+;QLg-uE7J`WZm0)mpP=O%}4Bd+xcLH*dc4&O3n*eBc8s zR;<{uV+U~Y#TS3$8{fF_!V91Fw5I{5oN~(NKKHr5{L8;&^449raAB669&^kwmtTJQ zH@@)=AR9P7AUtN$9@~54I^q;)jD6Oi``Sg7E z%_h(|Rm*R0=JQonmVuE<(pA~YSPJa?k3!!kY~?$>K>0a?)nez*Ub+N$?8`RKy`Vnl zllK85C(Qy#7Ge+evuCZn{`%`zu3X9FILDv;*`ERLfB*YG{_&5W`}|H|=Z=vuu&11{ z5P0L;p7fr#ee0NGSAOwR>i{)PL$r8t2{`we^FR2V;&(qc7x?%0UUmBo&25_%IQy)} zBmTN;e*^sav!1qbuwwED&_$g}03r&7dRAX+>-j?<#Hhk(mny_?2|`sU36 z{_Y)b8SCgx({##y!Ku&GkmxL6Gz<)2kSfwr4@7A$SlHpM1H=Yl-lS<}!Tv`Pc`xpH zn6cvw{sf?hbZ`%?`RlWfwj!Z@2=}UpTzuT(RXay-+B&@dtDU*<4d)(n!o1#xdZ?i_ zk6%8guatZ5&+nROCBJh^^BK(GPY4H60rDAtS2J09F{)lYPF2)nGNUf>Ss6G(yF;+& zPlw`-BQxYu5wBT!$|-82Rw4+22@DR0(?l?t_wcxDB7xeXwV}x-httUjG%%^;RJ5VK zp8CLvAc;mQqSoS_c&upC1nLp5sA+Q|oLVaw>pV3T8=@#0dT%t1je@At6nMf@&g;mR zl4j#4zrCTErry|=GaiEtz4Ja*FQg{G1_nYG2#DaELDeBfd=)DS4p;Yy5%mNn3~VU0 zS>?v!eIrRk6|1?pYthMLY%rl3=lTD=^5kBZeZReIa=dVjDgCnN7O!j ze|SkRkRP*!6I-=AI!h=+8>AL9T5@l<+x7XWtCQj$^X7SN;# zi)wh@u>D@%bMIY;NedV@@5| zJ^uG^`D>um>Bh&le)Y<)13}0sr=0YY+z_yPa8q0h?zrdIz>1a2oNM#)J3D&nn``C# zfsGNe1i(l=c6p#{Ru>SviRMI*nNwIX;&ZMc!1(z1cx@=#Y`vC#>ObG#x1b1^G$JS% zo8*iG&N=bfems)M0#O#IO|2NKNaiL^h0jbmWSg2K15iefx z-emm(^$w4y2F8n|qUxMXGRXn(Ud4MrEFMj>=7cfUq3RRFSOmpNpsLPfmbTujT5oY) zof=ZH#yLg3ao$LXBfuGL<)sO{=&7f7=W;&PJ8%EZu8|2B7kr88afR|LP)il97R8VnVL`95<6E7+t zYMf$0NpfE`uqEjJo3nF`GpG?zU*Z$JLjBp-tmri0B4ZgxMy@YVO-fzez(^DU6Tz6#L)nmt$cI1t;VhkNG#Wd0>{z^b z@zkryXabpEpZn~WUJv}_d#juqyL;75+Vf=~%@_Ogj~y5o0M^`EJ+l0<5B+lyIO(_( zCq|PO|Mk;=Mr+*Kyx1ntsJk%d4|XKkVH9kByjBNh&*}mG`pr-HulN68$uYBm#zga1 zzqt1+pZ^Z9e*MTlzvopQ-5o#>1eMBYADuwco3y1O(jo!|N2FPg^PL7rYR#X2{oYnO z28eO>R?|ibeCFeqU;g7a3@1APYt>pyrsSi0bpTu>^{5HFrrNC40acAm>6jX@c^WIAs0Pc^#{rZ?W-7_v=e*(CD`|!ET=T52@a6rMI z)E^*C7^%0$8wotLq;n71Q?Lga%$?U+I(}}?Ez_F-swd9tdFqi14!C^keIrh{jn{!< zXcu;uMY8_#zBp&;oZl=R`1Pj2Kg_wF!3_Qv;$TC-WSs8lX0I~k0HuO3ISabSp{b4R zMJBo7dy<67&3nX5GDB1qF&PWisA@K4DuSr08U!QKo-);}m@FcQ$*cxIjF}9ny=JTx z?=t(TNt#mTv1KJ|USQB9n_Bkbk*rtH&MorB42zV5qIV`saa`BldS6gNkr>b~7 z>f5~)FpvvO1TIb5QvaEwfK&0#(;nHth&Zz84pkMCxx3+gmby%XnVJBe(hb_{{*b9N zFztI-rrzBicQcQucpj|;APjQAy{lGFJu^5oGWB?PWGqe7tV=LBG_rli^_l*Cv)Qyk zblV-b=L&h?-qrVcw}%DpoV#!J{aHg`IyHQ{_1He>iEFLQ{nt*wtd$dY0P(s~^?qbw z1*ofEpGq?VGaO>$W19q<;TKLY&__B_bKN$iRv~K>( z^4BH?7XXj@$&R5`SX<+Oiwo;+Cf zgP^VAx^CUN>`7~a#fukbNl_A0CO$c9YbSQ?e8TCcoeNy`?eCs&;^MK&24LyZr7&^IvZn*L-ua!vUK1VO$o$V_118MAlb1pgYNzZ+3Pv;yUX=*-SzTnws0<(Jis}qf8wFbQP zlb5z?Y1|Yb%!MJEiTnU}ZvK8gpU2dJk+H4yl+;ZtwLFXFduaQNP7O#MQdLB8X)N`B;``M)C0Wk>F0-0zFKIH8xDo~ob%6n z?$e$I)UZ)#B*2;Wt3Usj55%?w#G35<*n1j20-E)-vr&^)6R3KB$&o9h)c~5q<39D| zv(cJ^CIAomDGKCKpbs5AyK7~!12;mUW$sh?;iTSqGo3{`ecG(0-HoIh=0-}1iBXg`inF$!jt@_RoM zKJTPu2aM@g4~+ld-Ys`*AI(H*ML1$s=dzyi^G;sYySGd;ARt#d>cN zRmBUbQL!Rc#G6(#W>VS4tEQSbXC09(6pLLQHZT*r$I>+QP6Abjcj8q7L{uLu|h;*DtAHCYt3#v12SMV)5i{9-aQwCuzxPF-jsjEGCrs7DQwxWH>( zC03j>afC5m0@0uycb zFkdo@B~ftzBAHhJpz1}l^Vd!QvJ|S#2YLivU=Iml7*6>^eeZiecZvz^;Yo+_<1q(f}>gw6w{?ZHYo81lE zefD4X4?ZAE0>GRQs1GI*fc|2~Z%cj; z@tL2T_y4{!0eoxic_04C()WC~4|v0Wp7zn7o;p4@43v7yxiB*RP%{7`#z+8U1HMKA z5fe9Kpb!<3R;}E91aQx)>Z@P+Prv-t<$%QD!r2RMx#14r%U}L%wOY;Rqu2lKrNFXf z3x_Mawrw2*KK%aw`H#!qxMk;EfXxwwxr}JwJ;nr*d76s|He>&b?4dDOYkgn|Eg*p< zv?GN8P_H>PV?_td&3FIHZ-2I9?bd9S54`40v28}h4q(%+-Cz3Nw>ECraN=>t1CM#k zW1eu_DaqIn;9_~!zkmJnZ~i-=x4I+Fg_X=Mv09I!oJ-pF(gfBe1~B&FkSj7ofeo!m z9(n*IV2mv4DxEaHXQuZ5r-a*fjAjqQ15tV^&1B9DN|Z*)Jd1dF37J_wuPw?%h3p z@9yzUqt!Q^cl_+~zGGS|`pU=7>AGX`Eze*EGdMI3*a1lKiSZ7P1yL_}RVQjeGRFL# zLU^_YlOJe6Xfwq9)Qfw;sG~hUkPQo-5a1f#gDdMs^gVIzo=>CMD(n}p%x z6htr5nVQH0^W7iDy~*n;KWmp-aW8Ab`daddDF-Flb0R=G-?y-XZ6j> z0k%*aZB!0c!k$b3Y`eeJj=znFSd#;i*yN+qsyj9S|9$1pt#%}J1BAKor$4&(BOm+} z@aLC2r@NGwXc1xG_U-tYkmN1d|>FtU)_1iW0wLGwILTLZPBWIm4Dj# zo=lqo5D|>DS@_nd2tf#lF(!x-9{@W?$G?8$5HO(S7iy#~=Hq#~=HMK0-726Gd0yz+Az6Xb+VD90;l;-e0$V=g-#e+%k6H{Gl4B z-(S7;v_-wM%KHj>F77Hv)@F73z{oR?UbO$}6V2p`+tv-&4=iiDYS-A;@7nmD&m6aRjI<~$j{pFG07*naRFNr_8O_EGvIADHnlXv+5Ey|>8q{l= zB9hfaocF0$>)WQGQ^%oRMaBEHRj;=i`7j85>e`a_>TF;{r5$A}7*g+y8t}$gQB{{Z z^#+4_V~nWBwbLF2r>QZKs#n#-c|&B4QSU73Q^h)`>WxvO?LCSoBhzbucg`o^Y|ct5 z`#A0H{e38imrSxI^Ki)Y{ipav*=gNpjrK(M0lz`_n)8r$_RwaDO)AA^{$YC-Zo5SP zUhvbO{`CCwpOEdeUXLGm-~r&7&wS>*dGoHl_L|kJ?*;z--#_zrfA{*SVtJ#{D3wZW zjoS3Eeh8fefu>B(koGeU%-#~6@Yt_bI?e#P8H|hLU6g<%D)~kuh+?3rt|BsP%T}P; zzj#q9%?($FM_mB8AndJn6?1i9A~!k_NUgjP=$a^Beb(o1D3pO$eBrF8KEB4LD}mzC zPXb2E6HuNyuqh(bx4!kwXFl@+;Di%ScC!ZH#)5YfX&W!)(0@gh}ims z115&K`NrRT^1WXI;+Eog_4EH8_|>m}GB7*6>H52YG|3`!-tiCb1%B{@@9n&K?SKB; zWx(j5eaZ9R`u-2U132Tc$B#EQ_ACeibza0y)%zzYgzXHZ%?mUpwI(yUR%>iv6R$ui zUu?mTZnzit$8UeRHQHK}wi#&8+48`yU;g?tU-~j|)onLr-$WPw#ft$^RzGmhyWjaQ zz(+su!CmX_d-EsO0UMru$t#}ulwBi3z>-qAH9ne6VEe#&Ys4DB972BaVSOkryJ_w2 zYBOKy zkrl*?m|R|JF7>LY35=>5YYL$leA-H^5o=5oS;^EtystJ=9~xX@0ttN@+N_@M@`1%- zb5W9{6LE@h0!~0RQfH0L<#S@fI7yP!p(x_T?{Qs2_xnbc$?G}k?Xd6cZkE639;#2< z_F>w+0Q=PMW%`XUeNQSz@h01rsQS!P0{uOaGS5H%3C<~Ct-R}9@5%%{ckSFcFfefO z#TWnW-~KJ|_P4)%_UzeH#r}bT0b@)?9I_9CeIXLzf!lw3bmfV2OX*L5M)T-mUFN0T zz(A>$k4)+tKu0dvD5Hy4-3z40yON4-`>k30G@#MpT2aI7+5pU+b9`9u+*ve0Y`T4U zYv0%+;EwbD>AWw#a86tSTJshFL2h8WYJ4{HAR;&2bjvGW`AQ&)qEk;jHR}fK+O^~6 zn{R&E%U=SVaKdpvzWS;;k2S!8`Lkbj=^2|gq`>CQn_uyo^M)qwEcTBB7d~&Cgl-t=am3TV(7v{T3G=H37Cxyvs5 z+E;*Azw4dek@YRJx3}Wx8h0PCuyvKlSS*vTs>=KRnnEne4T`?EjK5HQ_sbqb95W zdjV1Wl*osuiaLx0xQ?8hc-(38=FL0d*ris8VZ7Sdx?{(x+ismY9U?lnvv}0vg-0KK z?2=^*yrmWEM=$?Ut(7_`N5Kgv9DnkX1q)~Oh%u41Vr0u`ylL~ms!f~LZr*4`maSa= zwDZoa4-Nh5+H03DSvqHS|H@@cY-oUHvwrJstFOP~&U`VLzj)CT&p2*kc=YDq+;Hm2 zCmws`5gnx>ga;MK4BySvx!zWv6lvn>Qc zqu zm(Aaq-H;>IO<(%_1HfzF{J839hx%e*DnKb(T4`+bb|;`d+P-7+thpiZov&{zb|xx4 zK$Bf+3fqUPKu326zLfZ^%q)m)H-ro#Y9se13F%{No@0IPmUwzxzkuyKXGr z2Ap;F6Tk7TZw9^&h_p(_bVdVp;D_J)#wiyaX?+J!2}XRZW$6H7TStol2Jn%^rv?i& zON9%rL*^WvZs(MgaI7Zoj-#a{2xc~ zpi5{LRg210X+E3QZNHpJjP0cY^n0M-9fDGxah2LkqDdY~yB*;Dl7$P;KI5c0v*w(* zs250~=GZxBR(Dsj_6&?CraERa)t+?pcpN{iNd- zFPv2l3}ntjOJf%I_ZQ01#&xT$k%j%eXP&UKIoLnEVf|xHKY8}7{)O}Uv!Zh=PJ@)& z?!3!{!IHUi&O7?tdkE-w_V6Kah(w)xxdxKEu6L`so;{HZ7Obd~#Z z1Q0{5!A&>(X8n$VdaDHwT3?@RmmK;f-LLsFxrFZ9l#v50rJ~a^x9lrk6;)|7gnsuJ z8mfH!WB&nk&0h4~AAI|?lTQMSVa}}nYp(mn-(323VB^MtxaEW?LWogyLA$JbSal;e z`8JJ`8fpPRnhzE=!Nl#SbdLrp?=L`|a4G<+fJo2EP84HPs>e z@po?re(~L;Z|+fHUV-a>Hu(6bEcn2?t_Ds#ZP9n`+R(dPfRRc?3HQ1!_9`X-xMJwC zd4CN6iHd=3jdz!T;_gA6AK1VHPdxwZi!Odfy

H&E_}1`OVC`?RBqv-A6zA(eHil zdznA+yWjop`STab#0c=7_x!BAx*9})jn=vqx1I*x2L3)s%rl~u*D;MqmX&kIJ z$D0WchQ@(r4+^0T?aTzg3}$dxIG_=jSG=H8mNZk$5oz=9b(*;6zO<4@F8CscvjN$c zi!`mxZ+x3{oRz-CWWu7}^_B{6ecj7v74rs?(ONTUy2MAt!lH6do`2(Tc^3=Pd0ydFg4t z`1aQtwc7G7yUbFY+kM8X|FQv%RGZaGcUK1xUlN&U`k+g+C`JQ)yd0Ox*@D zITrl;K`tscV+XwURj=JP)F^Km0v65hFGj)lfBfrvS8oFfg}w#z7v6tQTS3A*0z28j zI=mxwve)A{04OwiD#3`!3(yR@O`HUoQjn32m0exe{}A}MSDt_I#g}Z^z5@t)JM7x~ zHf_E?EY1h|<`r(e;r5Q_oC9ENk~9nX0#FTd9hS0$K)GheO`>^#R#*U*k44){%{^Co zS_06%E~<0q&dnYNQDxS=IoIF+w?MHtp)ygKCuN-}qh+jMX>3h(Rv#UNDRna?`2?(5sr37{(t|NQ^GC4S|Tfzs!0 z@A%H`&wa{iWY%_5N3!=3CSlkN6_}Np8}GTjylWG1QQCR)rcEDv?dyQo{Lkede9PNg zjdp+@b{2<*hFqEg&1Unrzy0m*-Mg>6@=9RCh7BDZ9dQx^r<`)i%HCNGtpXqar#E(` zHD3yVQ^(vHQSY}t_A%f&fBu(YE=p>3zy=2`$~dnNYVGvJTi0E)e%Hf@{xb~MTEE>q z=)Au6?4uvv7G^MmDLm*v`<#x#{>#iR=U?%dm17T<11#_9*#F6{LX;04ysSBc8O(qK zCjhBeRj*`|sgkMF@1X#(cc8TY57HybzeNsfeFvfkHqD%pFwOLCR1o!=CaQYmvLj{{ z^8v)lM?U*sL!-mqAW`1tqS1jZz@IW+!lec}3&o^9AwIU?(82Ng53l?6&Y_XP zq3stu`H8^UC!Z1-vwXq)_3Q30_%{1~aJ==+pa1;+?b}_FzWa5rEaf5t^ZL3rY}Rwm zIOdci7Y|ixci(&ew|?@yR<(ZeQ71g+wfNX$k7_g;Opa|F5R<~3`{w|D zD!Efb=4dvRFid&5WK-AE(+G2@@AYg1TPC-U5hK5s@;}f_>p>I%sc%(v{tfpG0XN^V z<)i=ho}SJg9|SNc!7-L-00*na{XD?RU7E+0&kkHWpXoTCJvh(KMgPVYf zS;y?|n4_gxfD0GR?>;sE!c&31dG(3$YE=`U7zB&v%uB+cIWPbe66qhhfn84qlKvBo z2~D#B6brt0$9-8?E19t zyc^K^cquBzVG1N2L*5rnek(9O?puwCV!lsvJAhVgepKGAjio?P-X1rOZpd$eD0lRZ z;oVWr1NHHR<5C@~)d0<{F9!?vIg))))mF7!050FY2H5%JQ{}`3x~&4dymtFbF2C#V z|K>G7qfs;Jg&a^Q6yEvHcfS4YZwJmh@4S3IU#(WNT6>zNs;-#t119Rj{iWX5yyriF zAJo>%i_Zy$hk@2B&i{qUKW|?xpnc(*>Bx8m_|9*CePm~UxtanKOq`rbf7A_Bw3-_g zpKlA07rHu)FIsT22RtrcUb%jJtk(mn zVIuJ7x?bSkd+$Ad#mc1708Dt$@WtysetiePhLLKu_0U9J_Q7ziHF$X3p&88J5u$jY zyS*zPow~69;cZY3BkP#K3}%qwphLjz0Ti@bEorPSO zv))KEO}FjZB`%I#3-w~O(X8$o7+tY&sRs#jPHd{7LL*LYx$lAB-nC}9QmNKQ=dE1_ zoN(d^T_%bOg}~ZCOrkj9#=Gvl@$UP#kBy^l*F+RaHqg@KsNxQK9PRQhi-Tz8WEu-ue{!dS?vL?VjD;ylU zH|?YC`1X525Cmz`1Z-d`O?54RP^BLGs1e`2>K@>Ni=Gul`KftdRdvo~PQaQT)^VC? zVn_xuV<_u~FFtABk5{b$cJ8>>b(P}cEMPQccdmEN&^o|%`O)ryMC(92QOipq%=ZrI z7|=)?wJ4V#8vsn70jZ9S1O1XeXXR{@b^|}U^1p+(zAK0eK&OlWea*^Heoq3hf4H47 zUa~hE`)K>%Z^GUfC>FF;4bs9G5Sad`Fur@h0iB&4h0bc4?x>H>1`0h};>MhyFb1^J zo-jW~^(dek$6d1|j$1&IR>k;2XAFd;j`0zbvxn*c6tJ2afbk|k-I7K^}hpZnY-NwRJL;G7ErJ2YMc(nNlI#|_udi-3;s z_}c32ZpmDrG12J6(^2M-D0X&z{_EccPAT^3NVS=?fMz!ZO_R6)$h_{xE_Gr1edUcy z(^S0&KJ=jvopjPkNs>$rm#bI|tz>>Jxv${QmuzuaTAtG0Z zypc2jv=}N-69iJ{fBfs~whz@?gnujn&VqP{PD(# zM%Cs8vwF)e6NZbr%R!#ro{qW2Vjk{UyXmg`*H8Fj7>4V2j}+H!c3_~dw{z#Nos%ct zD+lo0YE$#~D&p^dLd}$xtDqP&UAaf(!K*5Y_a4E^}Qc_$Q7zGrO-3IAi_yo^k%m@02Fc{PkUh-~PP*_?G~hT7cZ5=|jL% z6d)0k@&1i5<#IlbQ{d;T&d>D*T`mudvpeaq#a1sc7FNr{wL;kfV-;7%PUNfQ+;$+X zb{B1-ne`$}vmRSD4iMkbswb843J`YqS{mhY07*@AYMfd?TpmfoxUr7^QJYx{1wZ}K@@8RSigRKnx=1f!yB?IUa!}~FpT3Eh~v0i zE)&)P;&@=^U^+Mm#7Fe|T~+Ga0O`vQFX)>Z+nD@9Yirp~-AI*@-Iu=TCBWrZUb!UK zRcu+H>ZMglqM!(rhnh}uJ*{>JKpV!nR8t3B`r5w>qrI%71sg^dxZ|$d(m%V zB=4eSLkf)M>_pBUZM%Vak3AwPM3TlpaBvyW2aT0R>T&vLL_e|fheN`i!3_S`ux-3P zbL-Av28W3QBmmQ8HM35DOxpJCA&vZTL&%)6+Uyt2jIM-2J^&m{RI5Q-t;mR1vBr?; zz-Z=Qtcf6`c+u4P*sHT()Q32mw8|ajCA0e$%%6)&;DSOj@5tHx`OHvLRB#zD->Yk- z&SRYz)Fx?LG0A{M1t;pgYNFCi8mWjEW6-$OP@f8jxG<2=SPPwz%(qWcR4jqBF{eZKpEHZuh!y3uROc;z8BqRK2TYz+`EAc2-da_8%n6_5}5ClOS zc76W4w*rh0{PUY%xcPxKK>zGHK2El*<|VIq7huBT>^Uw!X(B1(SP61A0224`#p8C5 z4qkulwcaa`HtV@YHQu!rC>?XGQ8f0z<_EUuym;%@tw0>dg+ifRE)NV00IgPQaB$Fu zivaPI!dxbkw|4vH%fEa@_69q1vS!sC$DMfz(2)md`qpHKeUP(66)h8bps&|g8e>;} z|7k$2_-FH1^#A2?&jL=F-|^iwzwC5x1UmDkHr~78`s3E_j({hg`+{>H_tYQ<@Z(j_ zHt8)vPzG-JUh|flWyPtl0G{(_PkYX3XI$~4PXhFQOFDN`JJhWf_)@J=0nVN?3z+}Q zHNjBp+HM1U_AxJ5`Ph>?odT{hULhn-fcx&hedFeJOP8($LTgH;LYl@wV1Unm{)^9l z(enq#Mt~q^F1Y0Ei$_lfT*E#76K^XYy$CQry#2V9qy7c+neJh?A4)x4m9Yun%`bb+ zs3c$g#dm?@*QaY%EPv^%E(Ow-Cat>ZY`0um^@$UYJo2h4OUjUE$MD0FDT|BTO?%0q-6@f#-mt zD^rk%@*&(ZT7B4uF@qUALd4Fc{-K2$S;g<`cW&HOY5buNe+D!7-+=?o08EKKsyFy) z(OVY%KYXY9-xnnFFfh}&E9#uFHi|-^+Vn$%!=a{1=#bcp7_n-BAhR1&5fh0tjjG2Z z5=KD)Ipb|(?72^S=0z7gd441rVcdX)9Jq}9ZXEc`=}eIn=S`>*ibvA6)?@&oI>BWf z{Y2Cm=dJN7BBCx9?*tH^&*uucTmUaP@5~pUcV+?}vJ@o-0q14%i9^BjAk3^umcLP9 zx((amM+`hQXE}8XQbg2c&6QPqcg1JfN1QVa`ez0rh%o ze0+SY6~R!J$8njwIF{U9$li&0@K1Hf-w!hJzLN?Wioc?JD4DFF5~cN1XrLjlDpvIV6QS zPd)n$Pf851ZQHhAee>HFU33Z1s;ww?tafP(l;n?pA@Z~G7_|^};`q?W#2sG1LT&>pB0a0iEtruSMi8Xft zXPX9XI)T}X4V2)IA=lHtcRfm zHs#58Mt^n6+549fiZwPI4R;mA>eZ2nD`?ptH=|d6}@v1}h)}4C(}?ySF$NKgowO6m zIQ`klZ`5jItyU{_n!PuXswXyfy89VBmhAq`;=3O?02Qt>S^%v%;2fg<>8U9jxwHxBkQvPXtCrMvO6A zwrp`?fJUQ{B+0xJP6p}{N{uMr1uR;=^uGI6_jYyxyNAX)7h5$sK-+@|(V?YFg|6$@ zJmca&KLK!st*R%w?%BW{n}&LNdbYY@Ao|gjn{)H(XRZYDn+>x=y(;j~o;7&PS z#r)#uKLa*zIpUZz&lbHNm~-soldjuLz6eySkNMZHe7*ZJ0Zuxn=eVbJHV-MnT}aa5 z#sCmR5ir)+PAT`fxBU|^67Ncj<*rnKsFZW0zR>{Q_@+z0`sM$L!V=KkQFzs>UUk`J zmn~nh9C+drpZM+%{{2L{4ZtLk=1Il@OYQMTEPc|llYp;$;p64j?#86=_#PkeeGaVY zn>`^=sHd&Sn|vqm)>psj&Mh070#K@}x5=m<&z6tM#WRjP=88{$4tV3c|G8_{tQ&8< z@e`l;1aR`nCoh>Z`#V>B36SBTbac?xT0pbe%$uM(G6B5gq8BY&x@h~Boj@V=R@&18 zN%HUs49(;KH-mx4E}8Z6#~ks2U*5CNOC$Bx-<^AGKD6JzZ(sA~#*CHH{|WrA>oR)i zClB~?HBNrLd0=>v*Qn5xXSRxTC zpkCrQb!qCzedp%eSFKvLd#I91=){}Ac<)uBvC*+(RxZtGI|iRo@TVg^jOc&QsmszO z?R^ft);8pCB6!{oTBsY~Kb^G?*&rtBCh% zj5b~3ArIwJUd4OwRYdT3pH)(2@*S&3y_&Y*Wsr&Gr>e$E5C#IHqa*8vDqb}Sgt$JU zzLCuUsN&nng+npo+qMalWF*9a4@5;V2#Ck1F;yFP6w1LI>->I@65=70V6>p&P`5kFbqG!l5#L^BUvZ;Z(_a}GfY z5}#c+45F&p<9g4L;~TCCsR0xHr%oL6)PNFDbHhoP3-YsoaA>qVzjxd40MMv;pQJ*b z<`|G9-snhf@rl5M#p7UGwB=!e0}~=M~|+)y8xKZq0#Z&wni^-^B3;?@cE?9 z0~S?d+8sBC*EH28&y32h*qM0#h8pqfm3G;xu>U%%%uEAYf zfybTwgb#o0eJ7rB#J_&vpMYw$k_NRxSO5~2j8&R0NC11)>^Gx)C^ix z;9uVTwwJ!}FQ5DP^N*d?2YmbT&%XDa@2u|H0rdKyp15Y}fQYCyQOijlIAP@y-)h7* z1ybKq^=X;{VR%?tw1T7$v5$|81npMir=_qU&t3UJ&&tL{K zcnCPaZ-ezl)p{cagRu&DQDZVG7^m(*!^uNW2?%Doh>*x$R<@qD$ohjo5Wlw%fGS4u zlc|az-e$%>#;I5fx^3HVw(QYI9n)=GViKnig!z2rYxQg!?XH3KUYvTdnhMTq>LKx7 z4TyNC)*2m+Y7j=&cN;Wqf4|jB(dh_M~3Y`5nZ;x7Y$Lk5OZs}PoPrE3o4g-aJR~Uxbq2_Wqpc%J_ zqCE$Z&H=1xHj`x2;8nnIbydDxKkAr8Kr7reG`2;P(}1t}`%IzG=qv%lf(+2JxEmO6 zE$R$QyC>Y}zz!f?P#XK$HDf=%1~~mg|M9B_`Z^aa21a9d);Xtbxo0(y)MFJJ<`baY zIX5tO9q7VM-DnVy_$ClY1SIiT6y(I@fL1H91WD8Y)JqTqiK_x>EE_i8zH?+9@X=4d z|A-@34Ar+i;Tewu5MODG8S8;str0}d_z;NWW*j$~z7B+uSnHfRK-H=`ZBM&rIsYUz z$a|az)Okd*YPzd7Ob#0)KvYjO^|Sli3gv_2<4R;jfpj?j&_BJUdsbg#U>C43U-( z379{qZ2so4npd@Z|MnEZAP~c&S~i-&3}&!D4v+vivfoF+d)gzRGWAh>P(sMVDJD(Z zq#QO~{D3B4AmCB)g4xpnz=Szb|G6CpS> z!skrJ81@ht2^@HAE48g8HP)^;@`x8-@C^0ZH+TN=M=V}ByH_EECqM3SYx{b;!!Q6< zytg8XcmQJoMN@D#OnuO5N(<3QyhIq2Y&MU4@SpPsm-zG# zzTzI`_e@7rQIBbNdQ|n`~1VO!CZ%4+>W^Z@CR@(-A zG6%xX{r6(zLZG$IT0u0GIo1J8Jn;O9614xW%a* zS-Tamy>(M~U|acdAN=&!fE6oGJn>bpd(6Lm7^u0?`ouQd+yQ7Z+}qP}#L8Y^)5f)x z@gWmG79g>{dEh&3O022TYFI)bDrO?BrWkdoW^=<$)w+=dK#&Wn)$y*b9w3Se)%rlb zPy!aM=uf3qkL%4woZSqmYi4s0BDT>O3v2;!i7gd6l6ng$X;0Sk|c@p#Z~}N3L=}&rE#01UvScFHNr*+ltlWME~&?jv{nJiHcH}F zHs0OQQPPP=3PuYt?Lznz~F;RMLl^0OYJ`BoBeRfB)db1H%&soE#{I zGj^(f`sgp^A9W@E!@<-(w~p8AaoSag_F3RBPFZ&Aw&7$((SHUr_+8?FDnN>47GQsX z1pGl6M0+i{7j)`h1rby<^QFzodkU5DiQ#&EL9v*^Nh_8&V~>?I2yIT*&6`JCofD%P zC3aR2fC@H8#u__1_QX55Bz7-!fZR=YLZMKtjTiDIpwVbmt7$Hu&w{XKvzg1~rWiiPn5h&3NYnJ;B>+AQ zk%oi`Q1BXJRI=^(QqvF5$^oPFw@y56ifB%hANV`~9( z%YOT2_B6CqF0=}6a*&U}o298|09Q=Lv z-k)8F}M)op{D`j>Q)d1a{XpVMmFutKwQYrRREF<`pN>vwMJ>pvFQvSr(N z8lQN=$?ZD_d*7xFVVDC>Iq{USkV4!}XDaE%3We4h*t(X#9*tv-Wv@SzpIroU-hS+t&Y~&(I8J@TZIesQ`I3V#JVj z0DceHOVLGD+J3gG2E6*r+DcIsQs-3}Pu3{Y_1mM62n-FW*9Y_iCUv->eeR4 zrcm*@W>Egk-S=7|!`;R|1Qc*hnvXF_dAIlDPEmy1JyLRwwdH}~YR1`t30t?8(A1Pvevea)NoP3v#` zA~65Fmz0C*K(h(VcV?htsFd#jeA74~X(d1|lE4OW>exd8N^Gz2>qS9hNQ zG*>J-YH437C<7nF@=tc#8TdA{Da@VsB#+7Fz5{IkwJ=P9lHTA-`@`dk0H>XD zUcTs`c-{rTKfLKu!G810SH0rpe+_)*)1Q0CM_%>DH~s_g!ykR4tF!mKbN&K&()nkf zdd889mM;YU<_-V)rLVnxDBd!8oBGKPfSZ1J>U~DPF{xMM0}t?{-(1^&bMLDEx$%x&wIk-ue|a~;EQkhCmSc)Y5|#ppH3zN5Bmes5rwooOVy?%G~wm;h0X;pPz?Ov=|tdZBBd+gO~ zwyho*_mkpSs`Qnj{$lPYYj^&xGl10lZ{EFm{{#Sd?nz4vp}lUy?#-jsR_c*GKO;sY zFk+2Z5o^R61JvWRk)(e(){u7PqjQ(ewnlOX^73mW=`|a6S6dHXXl@2Gc+_#gKJTPw z>>f49-z}!c|01Gt7<=9Si)m7^QdD$ua#>MPQSljnM2%g&dd)5K7tWd0edMgJPy-_} zG(I-esBhZ39k_4fmd;`^`zmopGC|HtwZ3h~&ikTx!?wW|+_vhzp1B>%yLv*A)VbZm zBdgXtaOdjPa~3aIwrFk`u>$mJ~be49Fj5VDb z7#&-?WpJor8)@Q=$(UE0w``9j9q7o9OjNwFl}5aM*T8Let?TYA^>-8l8?@5YCCROu zciwydhK5U9wfbH6uF0FDOb~1z8=I)t0WuDy8ca5I{Ch_>+aZsr3*cSSwp8;j%H`Z7 zZzoBTjH$n5$&wpyyfITwjG}1n+_{r?lrlNUd&()N3=Itx3mw^$^XARD;)`Dx8E#L5 z1lF3#gPcEq{!|ZP|L)h+Gvk6c4v6tab|owZtQqw_Fs1YUH~;_erxAYUVvyK z2#P_anF5h1HpKZ{b?##>0wkVDh{}NnYJqge1sglS1U`b$8Xy-GEhaPuu&O|0tPMR7 z;bS#Bwu}J_j_Y=*At?hsOyf8y20g%lY8ua;KfDomY;SY>=36$EF97V$dY8Q}KYtu> z-m70QyZ?c+&prlNb?@gXo^Wft1vurH-#BghC^HT&vKLpWj(p0BqUvo$vqn3+vac2Tnfr zgx9?K_0Rva=K`&GtW@qF9NGaKeawnRz4h2LPusL6D)D&D=5pJ1>;QVoT}PaC($0w?U{*)>l4T2y4!VKo zz5dkCT>pcLNr5O%f;7#P0n#)jbvE_DBaot{rx-E3?~|>E&M7M8f?V*&@AvY1#oTiK z4d)(v^z80~eUS;Yyk33(4)=#3)jTK??{`%i3%d4g?DQ3Le{t%H1Fo{LyL{yx>mNx( z{op4;WT@WSFkD&Q*RlVL7aqIlNk`0EJ2<{>xRN@*ZM?CltJp|gDGK^axvqTFU(9tD zqON=dT)$!0$F9FG`2%HOp*1f%W99iP=XpI?(4;H-J3oEH{mniClaIULxzVDdYe9z*HR=$-OFCIP5Pgu_SHT|gGw2?)x_>zJV#%UB1DOhrOkZ8w zX29YyKU#z0L=dOy<7`4T3UW48#59vsLYo>7gx2`fDUx7qXq|VGwv3Y~jFPxzjg>G+ ze5y#^1V*e^O%s<`C)S9^Cuz>)ymL5*(L!e-c1f%@bsi$7Jo67^F0ix=y z7bB7!7LDhy;U~-c)31iXs&Sd95h9tCk%$(3YtuEq9KP>27hLv}hq|NfpZfdNt5*X- z5U6Ta>2I}KB9diOQ4~$F`Ll38BlDBQlab$psOMU8#5-4eV zu_($(3kZ!3ZIG=VTCr9#n}Uv@!wNxYfXo^Ud_7+VUU6J-T4(E{pZQzhsV}-`qB5M+ z<^WQda88pLz=ge5RfvJuO*o<qd3)t)>^#K5rQ;0Wj8bK9@5-1&mYg#cK^{wt9>~ zO#-xB#RRnC01z7lK@caq0aGo#{H&kOD;)ti!>6u%bI(b)0L{j{Eb1-hia;*RM>g=j z6DSwTL5OC4c{Wg$_DL{#RVn0)K$14o)CV@K)fzyl)X}Jo*q}Yb-PA^Q(Tk=0(9nPv z1)`j(rMu#q1riwxY|Gbjz*CO8Vo_H|BXq#nlb?`AIg^h7TPP3&VZH~bmx2y&E4^Jn zM^{(VC53X^30RGwQC8Yd(==Z$HJi=sPit*p+P7lTie0nn;{?!pE2%XCF@QEFNRrIx zAek6;jfQVF0oRJ({IU-p@Z(Sj?Z5xoW9M`nm|+Ec^4F_>x^~AtPX<=5ddc~~zyAEL z8@CJ{&gbqKM=iMYaYsMYPb;u#r26`+Zu(=4e;+YUU)cBdC!H7`Ql9dT?ZY3r?%uKH z!*_D{-JuxTx1N9EDGPcJf0eZZ`ZdHkJ?vmMWJny*hkx75HQuo5ITo=1P%-vTE?FTP7ZE0`EA(q)S zQUBnz_pTk9_=6nb3}&!D4om?;$!73985RCfZUY?3l6Km^hungy5tALHXVUOD6VFtc zwv&u=@71FcpvD*z7_y-N1$BsswI&-86`v}qUTmO>dNtM<6|dgfz=)*I5g3akt;AYY zRWUXQOzOP^CKTgiuOdMdDK3uVwy04%N3nq5g1{mY<#Q?~<0R(_d1nJv4`QuV)EbLs zCR$!IF(dE2_g=jb3nq;6il(WGSR1Ofioq&rMvKo*1paVZqM5t!^nV}h}`r6k~HLwEEQHtX@*Wb$|Wj_lO|37>09cbBAmW@B}TDzQn z&h2I9PA{37o{)r8x}k+o6j70%B49y96!k+vEGY6(EZ_$!B8VW0lmrL~1k!sZ$z*z; zxxJmf+gk7MkG0Ra=ia$(CLtis`^U_==j^)nUVFdgd7noqrL|5blK_0*Z!!XzpM(&x zYnV!b$P^IFW*x_gdjOa%%QA}zF>4q|%*>QyfxWst4ZwxxI~hkX0HKv-H62!02+<@e zbzIBPT)5KGqyw!0WXO_aDL=@Niv|Iaf&CDXBw=6%B&9T}5I`zjBO=4jA{&Fh)`|e+ zbOK0O=ml{1t%ph4ekBJ0t{;Y>>m&h0ffumQumIR9Cq-wI#xfmeFNti2cE?I-PX~Oe7&#Rg%Tk!{_6!B$s zE#K1sqA2i`hadtVQ$BMPc@+TH4-BJ_O|Ss)4O@~D!uTXnB!s5Q1OTU!u%+}WbpURv z2r0YT1P@Hb<2VSo3j3rYqpa+dp+bvP0)SR$ z-+i03r6t51zJG2=a9Cnl4%Uv|wja+N_K((VDVF1*{@9LOJ&bPMbMlM=fR41gsy)rm z;FOlrNy3b~j*eWoqT@xI`=7}PT0+=T1kYI0{j5zc^{VA&?(CeMvmXze=Ve2x0g2T@ z3N+NQo+BebFXKHWS&A7(BIC6-`GZXHI;JZXF%(4-pd|=00*F`%OIngy!x35t(@e?4 zY$+yYl7g9pO$kQ0C?FM&?R2=uZWdMl2l=L5G3sI*rwJ{3tP9_#BUVsCClz0U$_1)k!A-yyctU zWW=d`10ryuc>9os9TZ9_tEEAl7)oMBE`^({SB=|D0e~$b1ArTUG=5M{i#w@X`gAn@ ziA&mXUN zotfo!ci2*|!c{-D@p0}#|tPw|2(5gau&*+aVzrL&yIp_bM zvmYm$FWY2Z@^ih$AGFOG+IhceH46P715;R}A z1O@~_8&NNU)Jzn6XGA7duSpOX1ZDz32t&wkxbfqr!#Em=rKk+_goVj+avc0H1PNy5 z*e7pr@dySBgTf*Lvx+r?VN&m!HAonro1nSbO|e7~hnnYj`Uswx85d|qc`Odi&KmXT z$8IKrAf)Ziy8Mj|lfhJIXgPB~I0?&m)Y2kALC^TY7A&+PtsCzg>DmffI2HgkyAUFM zrCk9)0qj_o^Z{^EDD9iOM2VSWn>&0hLoZ{*5YRZB(-T(Q@@1 zA0X$d;|KXik3u%!IR~ z6iS)e1#D<`&HR@Q?|)_}T4E>TIZH7Y7B5?7${frXGt0(YhC{Q&Q5=amVku&Q&!^oO zOU})89a+shQuT7Ky}l#cmUNmu04ZC}`@l42OL5hj?vyRhdH+ADc3`aZAG;2}^@=TX zT7eg`V^ie=xKgtzZzLUb4+|sEf5&daHbR_DFCdY z2oPF=wE4+mR?u1yGYB9i3(~-$Bm)cy!NS1Yqlj#+wU8Pbf}o9#k7zs@wG>(tNEm;e z8_*=MGMu1F00_+nSwlz(1sywAtihxNSZHQ~Q~-n$QYZpT$%us3f=NdZLTW?5BLE<- zfhrI|X%Is&F)gRA@(fIXNNdTYj0;0TfQg9!!CIYV067!EFj$ccT6Q?kt!ru3^pHZ? z^mI+XY(4&o86rJX66n^-I~8Y-GNC?ev9D93!KF-Hny_GVk22XT^a{$d+s(MzEl`up@++Q}yD7o%?yepOX{)VNfV9XN$k_{4ERp^o}dfEBWC= zCno%8ChByg=t#RO^Qrz^>X$Fy^sFEA|2F%v%agU3V%)lKD4TFzvUz1LVb9y=tuzNp z6}_P27(sZ8mgloZSoq@`vi(*`X#RB@t|8z=;V$&NFWX!te4 z2n7(B0Rf>YPNsrlDo+Anny?iVOEy@-$kMC{LRf&{1_lb43Dp=N1-8wQih0M>;38<= zug}CZNJElVL~((F1puvBNU%Ozb~bKF=!)5gHSZyk-MsY8{l)IDj&F5dSQ9y#RTr2w zH4?rshd*D|Z)Pesi(<1> zdt3L;^RF0hT*SzG(_;<5vaDvaH8tV^0Q266y5&ISX(!qWoE4{G$|5L=t7J6i$uT=} zPyl3n!E|GcV%;|)QnS&+t?|HexcTQijh0-cb@^w){eMRGp6hpf`N?A`JDvcc;#X}O zcy4xm&VC$>fq&n1?5-nY7q4hvQAlMRyEE-ZipOi7YssNf-H+5{&3k&JSPj)wJpk|z z4;lHHmsupf^T?>uoN}yYWUd&yN2V9*lV;$l(b7|+Pi^YV4HQx<^XdLv zQVPl?9HT1}M0%p;xl#_5>tmJrWGy&8RT-+(`G=X5JZIP|XAfcfbygu^}?2^LH%QT9y zI1L1~!2*#vHD-;o>jQ2MF#)W(#Z8<3 z87d9|Si*|HkyZebKcf6kB$5CmKvIT*Q3n%f)Pbbc`l7WL*-n!JJT8-*22E-moYMzC zcJztnR8iZ0%eLjZDBa@XQla;gH*ImcP&SI_o<0ZqElX9d0 zB^t#FrMVh}mXx(w>K5m`|8sWE&c@~o02=*;=3x-?*fdON1;LB>b3ChwaXu4z(RUdM zwRAF-7hFUL-Rz|_$1^AQ8CNg}N(&-ZB%q;U|9}%6GKhPU48ar^ z1PoiMAR$x(sml_Qn=wEWfx{p&B^1Gc60twuJbOUL4?AIoQUfCH7!U$b22BJZ$xyX` zn28J-D&%Q#4=b^7RG^zcsaaPLV$S6ii&HBYmq2m-MCVL*+tBn%HCuV8aP(+Z=|*xwjIDW;k*9@ZlygRD2Yz{k{ua z&_%A!k{7PknnKiz+j6E5gZGXWm$S9AHm&(&=^WVlC&4_Wy?O)8^JA%DRtpq>N-%4J z1kXe)qjq3DeBfr}G?idjiO z-MaoVY>q6z!oC@*} zpCLbtCIM`+h(`MzbqWBDZ%I~81+_8&^4PE0b|oDis{(*$k5&76j>jVN)x20Wq^F|} z0QQNf8YXPF4M5dS`gUsbSSNt7bgIg2h3St1s0&K6^{apLZ2-x2m)l`EB?&-9&49=w zIg@J_LJ%scOaTDb>l8{hC>8=UYv#ab0B$B}g|#}zs{kJk!y2>?K#*_Sf}{sPXj5$g*}n`q0Z>c{2bj=_)k?Al6!Fb`@34>?1gKWa=1>*4o^?Y;G}y0il$M-3pCZD(Jz%mL6Cj=VgCZ#yXf zl}eOwX8Ir48MD+H08;vvt)L_TO-|CWLW3()AyiN}SrnyHr zyP=f`WKi=9^|>+trG+F-3>HKL1xr{;OCc>*I`Ge~2S5{4001IHN!6z!4WJ;b0Im=< z08^D(BxHLb17LETGIUDS03ZnW)G6&n2>@1@_I)2EH!FMqiVBWDZm)~Q=V^?O$)c<( z0A40?N}={^0MeA6^vlOmDFEXXcIz1wESOEUSon300^1S*0+D9LCY77DXB=E20!i{2 zKonXb$L%N#D6rDXPFVoTwPGQaOt1sM_kE=lM-c!m2#82U0HT-}N&v7e8-Q(DLEz!E zJDzl0qf^Yn0t*HpC25Wf@2C+^h>1;w0%G+8-)EvA2qHsUX$z1|3JgHhf+(m$2LN0v z(4l6k0f?e745RV!aRB97z3%%aqzQeWS-0lS&1YtoGL}97Ajq!Oyn@vZ)27UVlRf~g zBinJ5GPt|6l+v+M0J?f|#c)`FlWqz?GNITBr^`hEZ3U`K2Qm3CMAEiM*#IC&3R@V3 zI1xAe0+@}xLl}ujRRAcC7!V`@ggoihJkN^&FhW)FbGd?9eq?kim&lAyodA%^XhCC% zlv}J$0g#p`)uLtqAVZO~JpdEagGo0bMH&Fxp{_yYT>x3(RKmc7E>bRt)LJq_`@!!% zS^1InL7ua7cFxY(Is2bt^Fe?}3ri5IBh8|jN2dlC z2{QzPm=*&7ETVfr0JBoFnz~SLTPlUhn@^uda_<^@| zTX&*6mjckSX7d02-PRR7R{|&wdT#VzuUYR^Y94@G*>6k9mp>4<7ysq|`>*=@UvkAz z6@XW@ifQ`Zf#U!!8@}_OuX@$*kCg#*ja79aoWamjM2G-bK++Zo%dj~`Q52<;HUQtF zW-lxe0kxmn+y&sW)B!sn6W=PvWg@Ux05W>mj%v^$fMgPujaq#YKtgI&t@{&Y z0DetZ$~7;X06@Y~-UP__qf!WApg}1&sZ|j`ML!p;BdHy#H7 zB?So;h5!F2Wme(QZ#f9t>0 zJKy%NX8F1*{o`j}b;C8i0M@Pk%FVCq{px?;ZRza*JXO`GHn*HWa7@*dAWo|6G%i9bCht)#up6$gh}-iYfTNnKh0W; zOoqLMD3KO}6`4a|gI=OIE+LBbzZNT(pRQ&wEM0X_R^Q(|4~=xEfOL1a0@5KM-Q6JF zJR%Juozf*pcY^|78l+3QrMuyMelzd=|IVE|bMHBOcK5TZ7<24MNcuZSu1;aj(_Ij`P940YE&0nemdDuh98Gu~U?1RY zS*htsv?8JmT19@&FM&;;08HQ6jt1_^F1T*yCJw*n*~phbI7u&hjeb_B_ZL$mv^SIc zywLhGWhEuzl&6SE3{pev5BWxaSLTq`=B1Dk8De_V5|!kbLg~b2Fmu1}33+a%3Ep8t zS5{W+8tklc8l0f*xpDhQRFP5y@iM@DfODfiCHnm~vr5eYtn{w?95P=TBUR&{x;wWx zh1lN!(fnzI?Y&q954BjT5pG)q(&BP9rs@0ya-|KYI7;x<(lYaq0|1TnH(fAt#D{L` zkRyf&LkDhHsb}d!t4LRZE+|aF+oDECeF5mv5)#-VC(+tQtKtCINrIludy9MkN5+&m zomZl;?C!(tC7ohwONPo$^d=oxeZH@FIlC)aJ+GSsr^U(1Yzy>%wi(gw7GRaQ5-8s- z=r3t_q|ufS-)%YF-MKn#^ZX>>=)tOO5fVt1o$~PvX#2BfrsK zUy4*8&ln(oGyQ&Txr@8@Lz;!3zEM6;-8|*2BEyOq4ciX(dx(r(ABeiH;eqkva?|tB zm|>OA%+C>aqtjO7hmr8r1n(zj_=usFjTPjT$NnI&RtDq#eohJKGl4`i?xIC&IsO2} zxhe3S>g~j3)yh1?L}t89xF~U(3+OIk%6xSslPqQDzV_KRLFm3GGj^=e{_qAG=i$}a zgK;NuoB>XM1uZh3x4)j|E**{--63+x`EP|18ot5b-Z~p(-dt)@qpihO zNuaOI!fQl{!gzEa$=}_pPpFkxKmS0m1x4O@4zExFL!A!cPcFFv7$!0=x7Du4ttTiz zWbVUH6_jIujU=_4)p8aYA6bT+TfuNJq~}Kn9^(>B#q62D;suL&PZ}{CcHBwmOw2N5 zZ9nhJpu4uFfPnMXY!s`3+kq_ssu_r{H98N@0`323p-Vw7{wHcKGX!M7|KPf2^q{Wo z#9sukxePbK0uRW#m7RUoH*Zu8T>AJyAk)Fldrt}4_Y9a2@8<^nz=Io#d?gIn$~aaQ z^mzFBB*BZkLCKG#5M?H;b#OF zbnyMqx#QsXu?pOpu)x=e|DgIP2ASOi(vxT~eNW)qXA8Mn?bbG;egv4v->NpfTE9O)MWHpjwwRoMVv9K{$Ol>D*=u7jAMK0((Xaoi{5ZrNgp7)W4~94N>I>0+b+N z@F&O1LP59~=sMq#Xnq)z4Lq*sx@S3gWCPA^hwbji*{JMF| zD2KZ`B4|7kJzcKqdfw$gK3#WSnIWWJn8I9}%sK#v6*I*hv;cOv<|PsB;k;Bn)k`NG zTnsR3fXj7$ydL{VW*?pnP6ck3mzI_~eEMg=;)5?17U6L6Cy@NlLRD44P3>nY#6oO; zkuM%VrQf%DTp!SZ%9Ja;&}1Yk*7=l=*~}1V@y2x0kp-}+XozjeF*_v30k*ndr0_s) z87P|(X3=YLC4l}}eab(mf~7c8fa=W+<#f&QuApr#pxx=9+$rYuP_YW(6fz9Bv!5$p zspg4i1B|oR$PHW}xZRdSMxS<%rWPtip$s`{s>h^=zP2)R4=vAuY`PA`r{0DGN zkjZOyUC1c-z#6zsQttPDHr_So?*0F;^s1F&n<{Jr5DVuw2D$hw6?6l*f8rs-BY#51 zO(VXmPPc8p5K4-E9*Oq)0EddCh)CTq&%RM80jc>>r5oE4Kd>v~{f`~5DSJF={J(5vok-Vn83Zb!5QM2+A;qtQC&yqHgMD8^EDzs*C zIP!I$7eaFW<~nD&;Yjw5R5;Ba3I^}6iqGk3qNTmXuH%m5d6fEEttts#DXA@@$j8l+ zXIWxE2P^28Al1fmt2w@B9iKTDh&hrnlCQ^ zMWDl>b%pl69AK z`CGg^PcTjcR-$1`v65bX7)ySP$)z z`m3+b0a)EbogYbR!*3`drzhWHilkjHAFv?ar%zpwwaKgWepOV^kZ;LXKM-6k$|q)v zMg~1nRu!7)y+s98Mm}ceXKk~UhFEJG(d-ATTb`7@2;HaCdB@Klc$=yqErZy2VYn!g z#z+}H;yuGc*_|W!(?pkArmfhM2>$i7it{HZ=>Ug0I;N~zq(9kXDoS^GC-4#PMvKGe z{_avK%7I49m$k|caNa@-wdqfr!&QI9Q24H{QyN!_rsp?YPM5zC!d5)Thwt|zr&mM^Pv%`o65kRaR)?~%hSCkXED}j zxNaFDpQF{Ml`lDuub@}jMoGfF*AWzmF6-AbQ#V=Il#e8U$gsYkJn2*v$bY)-^x&lw z`UViMZ=TmACqPXKRwJi?)xl|*6$RuNt_QUj^9(gG^MkZ(%4oV4Q%6i$`0|V zyKC@uk%olR4_(E{{#@Z%LDkwx3|O!bU$-z6S)%?cqF(7|%By!}_gS3ZFaXI<5T3@w zT((#s)t${2S0lrxT2n&Y@F&u+GLoesi}~vDkQ_r3u~0C{(Omo6cXzr zX5F$hf^muyndYha>8}L3TH@FK?kejJUmyOpV!m%q{L*z>mG#9b`KTnXJmDhT(eJFS zsF8S4?auZxiNbc^{B_(C&xK|gjG8||8zK}1gF%IL6B?dQCWtSJD=tmWh^}N!fidwwj?|bFI-7fY9v~8}yT5S%SNP4C-;&p6@$?Ne;p> zC5_hu*P~y++Hz35e?J-0>e;@%pEd?a6TDth6?fUiczSI`B#U`8nK)KY2iZD5 zR9C0-2dGOdlv|384#i)UvlUgRfOg=G%_c|w zsGyY0*Yw*Pu&50ngDU9s{_$p(0`r;ZKk*Ke%LkBh%RCzG@*FkCLyTX`>%V~}XgATe zRl-Zs9zt{Lk*VT`OeUkrTw{233P|Pf?T-~E!x*O9uhdI5i3ij@NTHT89t28r1W+1= zZ&k)k8?8hY@TVmwT}@uw-Nnix5GA5;N>~tU7Lh{)fj=UVaP%ENjGSXw}wgL2547^{k&J(?csDhdl*>5qhHKpohTD4EUfEYZ_x9(2wf%dMz^72>)|+VK+e1UJa+NI*xT}8^ z#SXdsGFM(1^uW%b4#I9Id|hQSIt38cPUG=rIojQi!d?Su=89a5dt;8$q|WNl3#M0! zOwaxwCMvZ9ciQfGF};n?N{k=c>%{l^=SN}YC7q*&?5=SZ7>%}XvMtt456yLi{~59*O`qKD}S>RY1L!5b$%zS^WRE6!d~HulRDo#F&R1b+sY@GLJGF8 z2g8E1nH;)ZoiqX`Rc{NA#rW^PiZQ5Cx@t#db=>`&y*8@O&w|Krg-+zGob{gVBlcj) z{>ivLc4yo6G?`MV^$?O;xu&5@5- zs1Fx&-XvBw@x#Aky!CHIX8$cLJhlpz^QFn_NYkgjW)bV7%BCNa=Ixki+2or_mcxKR zdY$(76Vj*ONy-1`=J0goj_@@PFNO};d-mpQLFWD|eoDeu!Vx3aWU?{{X58rxQ!Zq( zoT6Uaf>Ab_awFIuhDrFLa&@HMyBj$>YiVW+e8xIzyi&ZYsFv1x^$W0PT7!! z(@>|9J~BOkUUy}UnV((|Nw}(x=culyA$E{uxD>*Sh6%hkO4qJ@kU06AB)Eir4`PCE z;$<(7Plhii&Yj36;~LLhf%g*(IrC__bsf7q0u`x~&%MS+kkc^Zd7srMjhiD<$l74+ zQdi5v$^#7dX=od_)(Tujs;*$&maH^|bZ^B3f%dtvq4;($@v&lK2$Z(etj{p^WpX(#!a%H0TZv2sPMU+4=NcoZd>Y zfX6e+$Ia-fMc<_<9I)7Qu$S`n$=RO(dYxIR_*JP``v$K0No<~GG~oy`hfwHF0GF;ADi+fl8RhW+fmBh--9vO`9{7Q_>(ZM~ zYJj`DyxAvnL#CT^KEtZ{+FFU6|9;DJxY>d&Tudk*>{i@t;_tU}vfs$bImXG%Ii?m9 zj`i7BN7_wBHuP|zEi8-b$A~NGP7g+OoJZy4t%{X8^%2q{$_PJqQQ=8l@39J#RTK}QynPFC^&R5(^rf={GJj+ zc2n!aj@kAYyws`$x3GHpgMS@ehquPdf0g8fjfzOEa21^$LARGVxQ+gsq4pfc%N>7O zGuzHBIUWzqWmDQEtGZ0CSQ;ygEchLd2ZLTtPj&coTs2-a9E=Ea)#Rcqeau>&a4yWa z@%5-q5eUBATd#k~O0a$aDE%9>ST@0*? zj>$w<`HpS$8kSMpu0lIDgZVzsRZr zwaDwj*Tsg&l2Ib8a}*S$aM;({>}~fMC0JN+dq;X)f96;eOgY66yFVpYyB5rFLnHIa zUvmsIBAV2Si+&KgpF9{t{!`~Ub9<{ptOXbik+Bi3d`*%PBFV%6!eGWoQrT_bf1inv zKvI>HpT%n5J`Ok->niUdjgD%AX#vTHx*xwYLTtvH>hfb8A39B^kmYe^MM1-)yAD(1 z2TbTdF>lh59-!{GLYT>gTiYAN3%%yoLYL(C4bnTdzYsO02`x51G>DUDIBq?V2U(30 z-&1}&!Mhx~OsJ&f_%|bU*WMv}iCf^OI^T^y(K#Cz9!SZ)0*kG|`}Y>M^%&g&SpIEB zEbV93&TuZvJ6CTV&ue#&fTUwdW47__zbpn&=$6hHwd29Az~?-APXH*q3-6In?o){5 zz^*Yrr*E)x=l&fCQ`o!-6u>8!a(CD&j+S)}?C}8NH-qrF*O{xnPfN#Lcu*QYqw9ZP zZ&uv!C0|CJ58GS}J!;W&xpfR#+J3`W;2gi1arD?^VRtgH{))hk1(Mdk3FpbL@nb!i z-Ri>eMps(=@uVinvBN^+rH@6V=@MUW>NJ`RXHnxglVf>LX9MjUrT!Rm)l$np88Yol z*x@~>rZRhHL(D<>Kv6>DRdMv3QFFeV6;U)L zIBlOs-I}LLz9Q z_4U({wWt{a5P1-JR`t7%-`u2Z@f+t+dSS0KGfnw7NFVf^@Rg{1@Ai-;{5qEX$62ad zYB$EK{4sYpMz{gN*}H(yxvVZvL)q)g`43!P);p_<`s{`;8_Fy(`dyFK@h#ghL?{uo z|DU3^N5H4K_;6K~Ms{pQbV7TPhb5wY47%SR?R|GJ09;WH@%L6=!;|1$b{j)&c60q? z8Qlc8%78%Qr48*89jw5F_Mj0mF#VGtY&MDj9~HO zT6a$@nNhhs(S7sV7S3~PfU0-@L-FN$EmC@5+ zE7CGP*^+3~-k&_VMck4c>e3GK!}5ZSNAruD>6dru>G;_LaM0da4YJtc5(B`XZe&{T z6sz^hhg2uD$vV#^n20@VdTc{$2h9*#mVAQN)kmy-Ree z2CjShhlHk(kM{`#=3T#`B=CPkMeU8tbf<5r9ffdyNYE^pw>ZhH>bW%N-Vz2aDFglu{;zic@pRVMZzBBpvg_saTP3{7U?W!0EgF^>c~=Ly zi0)N~@pIoU{QOJrv2R7KXVHay*CeuuYx_#pH%tm24yZXp_Nx*sLf0oyT;{KkgrTot zr)Z4J?IH?dkK&TvVngDrQEYW4f6E0OR+g;#T+R9fJ)PcogqJClUc=?kO%8 z_2$d<0c))oPs86lGa9K=edhS|UrsZ>F|T2WXm^>I2Q8(0r7$=i5V0@2xa7N=m~qYD zH)cPc7?raZwAa!cjc^DuMhZ{5!FL_UTqveGb-Fs3t6ZM?(}Jh?y0Y4&>Y!Wwnm zrW6-?&R1q(ZJ95q;z<2BOdF=cLS^$`q*(=_baY7UfpD$82)8PxDo5?p>yFUuLtLDz zFa5Gb-Kq)b_x|rp^lPHjE{Gu=5Lb@v|K$uUQG+9r~&C?Sy zXreKgyF`s zUm~1t;oDI{c!(8!#YR8^y_vd|OdjHga=yRwmYdyVGq`RWXD|1>W}~`aY)Lcwl&pe~ zYNr02%(V6`FiiO@iOMGSXDRazv5iOH(e`cRIi-+qsKwZ>>?-lVnY^7gu{N7m7p}CI zPcNiJ)w4>zuBVajyHj+P*A6&>k5j|^wT=LC;B6?wsq;;qU;PXt=+WviLt#j_5#RRAjVCdMw$3iU0 z>G=aS=_9$!2OEX=d_lhBAB@tSkXh!GJN6hRT9}uOq`+_%6|iLp2Fw6c3wqg@i{Lc?6Ugpf9>? zhC0@!(w9?2m41g?y?KK}?>1j%hxuViO;GQY%CWG@M?d4{&8Jl#vpnJMjoBQWSVI@9J{j7-Zt1geD+2ax1(AO0WG7+TXh2PCP4l<6G ze3!D5@#Gh;VNC_Ni~%tBy)9FZ`8%%MncwJ`bB z_Csvn(;7FpT27B9#~ppo{+Fp~r^m^fYQoL8J3r7~Ye+iS!emt;XhBaOU5}6`W3k{$ zC|;7T`|SncGi~o7b(>Q!ddLDsCx}SXvwJ0t@b+Dl;KB%1?dREDW=J*8;w!Gj5Pa0P zg-WJxaD9()Mgy7A*dT8rXeB?nE+=rAl*k(ok+)q3D>-$cCYfLSCd3%{Mo(Qz6NWny zAA>W_#evxmMIL!I6`9UQ9D|Kf**n|g7#nJp=aCo_u8bT;kMvd%I|Ao3Vsu1W12vpI zs^o!HCU>|V7iV4S?7G!tZZV$3RP*bXA#$n49osK!f;v;cHXj9-RvzUIapCK9&wM#) zi-Wk|q!$aENqCE!6qs6i2o5rUxr`!ATm=SlOR`@WjwqK`JSd>cD>dV~IWRZl)Sbcej%>RKpy4YUYfjdAc`iKoBYbs)9z>I4k>h@cC%5XRf{@05D z#aJHPeHrO~rr|)~p0Qkt2Xu4sK=$mO^1+N~foAeF#bPj{)o z8Xq);ubdt3c_VgPKi{o>qZIeu9=ie*?I*KYOI{WhzlX3O^X|_Iwx2v)NhR3~ilQWKD3JG2aRhHa?$BWu01n4{dA6mk%9ObtmKW2V1 zF{~!K0l~r{l^l(7xIdW8mBbaW0JnFtas#dVRcBxH8sdiGp=nQ-1yOID&h0-bwS?;r7S@N6p8OhY6DkUO#!=kQnJ9?T%*Hr z*)OM=vU~BO(NcrO|H}Yw;|D!kl?H1HBwAM8^lz?Sg$9&Ay|J>$y$b8;Z0U3$v6BIG`4w;M)2o^QZboyM9m zYPRj;Ssl3Uj7`3~T&eNF=7ztUK3T1PS~!3HTH!SOcy5{byy2%R-p^P2`Q1J21aWt2 z=r`tcmFi&BlE>53oak6Ck)yJpRr+i0@<7`$u(3VJTs^|esAF5R)VFZrR;AmVq2H+4 z$0WWXq0y2DBb9bk^4-?Pg8L{N4te!BN1)p;3E z4JWt0db!K%S1=@nGS1w`incl)^jTpclR&t zdOx3?-mDsCmLaGhP%&=I{|d18qXqf>AL;S|u*16=`}{>!TL5lAXWRcx(BN1!mS!>d ze*VMWMK5rse=HI(%Kgs_*kF z#2h9QKdKac$@$Bpi^$0yOC-#49#~vycDF7`a_sx{am4YG_@IlS19{&yfqb>NX zSfp1NEDYpL^>M|R;7k}0wnbWpY(amla`m?65Cjl}zQs;!MW}bWa(l{fWdDIc_m}r4 zH&FdrjB7YE_!jiP4==nfpc?DOImrGUmT>~FmN02sqR#f&A0%q@5DK0 z-#37h{A5?lAx5QRj>$LAZQY}ewq;PVG5!)ZH9{Z(m!kN4PtP@7F}u!sj-6z0q}g*K zlV!iUuFB=&&OXQRWOcr=vr*g8@GjJ_|2f=OKwjUdrtD(Pn<*mzt`gt5#X{MmzNb zJoG@Mx`$)s7bsm(NIk0}aD9I@7x#>U&10)c}$;7Mw=2-FF+S8jUGZrki*rw87bD>4VrQt9Z z)h7VWLK5^it0R`aKdq?3>O8g*UlweytQ(@R?W1a}_(k|%?3Y7uxj==-Bi$P_by|{l zOfrS(^9k=5=_mC<^|Fe@<5OfdDu50l3AHUYS^raz+q1>!&L}7!96aefflpxr2DMj{ z6HgC3pFte@7pdPynPZT&WA`ZG`|YvRz^j!9h(+y~Sb<-wR)3rgiEdwMR5fw8L~@ny zgG{QYrZ}RcE%FSR#vB&ccmn^2IR}Tqu<2E=pSQvgPcGrUk~SGrxm`=R}8g-n<9$4Yc|Egr!|RCZV) zQ0}$PLryasGt~_{kPlvi{PWU`ib*4s++$C8l=t+ps$m98th}g8X%qMeQI_=d>9G$W-T>BNn3=(=!S!0+xm*W1PKh2%39%Ay)x%a=3>B3s z=j@&lzFQlvJ6q4vRde;zJUpkS$IC>is#Yza&A%dYe||c7#D|`3UQ-6C*D=GHY%?;I z*je^$nLnVow;-WGXVvB3`=CQT6P{5@a={kf(F6U$*CBw=ladlcc4qhLN^gppTzOe)3E`3uS9bAUXXPf;Rr3utXoI+Ydi|=$&XcmFe zT(RTavF!8@>{5z0^Z6Ee?oV`6hQ#0JCFjggHj(Fh?(ZSyNR|75QH<23Wc5Z`8HeAr0Vz88* zWkBT_Rd3W@BtCtgx4F5ZN(^jPKyF){&&krt;au6ECO1kF9W71>22%*sC6pgmbFo2^ z>$O6RDno6AJPKMP6|OqU+c5lyhye%LFVbj|5je=NzDfq`c{G`ktdoS#v*vDI>*Iw+ zG&ca!-+!=Lz#yW+QZIhVFLVNIdAytuT7WVY?~oDxiz;P^KQ=gCR~^XVpv2`jaA_k4 zQ@u@5$Kl1Z#i6;LaoFIbS66^I#P`*#aW+}p>}-6FQQ#UsP5SL}q6q)*gWg*vgkI&d zx~Y5j(WbB1g$={=A)kcRYj^=o2oiA=o$L^bw{1mwnyx+PTMZ=vCrr6;9G!kDsiJqY z3Nj;V3aHg5p?p=>qu)x4O67L=Qg#Su;!J*)4+A6Jj_2UditmRQK$0r?(oMt5zdi9ZsK5YbE@;@9Z`fyMUPtveuOhfRV0#v{)H7to}!C_y~VEJ#NNqsQ~u{nPah-4H0 zL-g_&NdJn91O0=VWwG4s0wZ-A>@>5OuO0rPn2ejNdd-){1%M{8gvSv9cM>|Fbzbw4 zWmdH2ffI_*5Wf8Z4Ng)B1tRKk`)3N)($s8_D7}-ykk1$uBQ-dZVwpa!S7QJ9JQ*o& zI!+y>5aNFz;?;S(YxLg&GYGQaEn(@|Uazr3fr?fRo<}L+O19>P&Q6*GEpF!rRE}vN znDw`9cTckhj%pG;f-wsGNa;?2#PN55eG0vYuu`?pn%IAmIs81mF4=E z7V03pJtwBG6YB^sw|$P&Q;mQ!OiE0=cljYq!QC_#4bBp;ew2Vw^>I~T^@D7{KWp2c zi`=&Tb}&E7oib5{v5G7b{M$km6>Z2?f~U4{%cXF4S>s6K%I~c3_t~2~0V|7@OIVms zYJAHHjUz3X-9%M;I;-h0Zau@N(4Y#z^mnaqEvhX0&%oRN(B>qB1uaqf-?OaTU}8RP zSVkj)mXNweHa_*r@ufExr)OuQhM_WAUA7P1k9~OmrBwdi2;l4UbvbWIw(@gw$OhfG zIwF5gJ`P7(P@~}6)BmE?!G&08^j4>N5cf>-LDNn%sZ0wYtZ7>ksBu;()Q;pD>pJej zc;e$fKH#to$Sx?E_LsKlte1WE3=iX{)=!}_<2qoI!#Gx)3^R!!-9}jMehim99Kwya zSTJdiOrygYiT=oqS|BMo1kQDB27`0E^?2}Qt)>Va2zyCgJ>x^(D!d|Yf$(CvS&>wb z#Uy^>g3HLu{F1M0FV#^c52cgGD44WVz>m4xyebZ>a%!0feLF8#R8K;n6P6m0rdwTF zWJBPk&G|Vuy(P~E?8w>A>Y?Z$NHS{Kpb+W2o3+0(D`G{+dflERgggcpmL%;=(T>nf zdDDLMx!{YZ2Le?8n?f*uP8UJDTkhs~P(>UnGy_;XAp!TogS{tz|S zg#twz-W@KDvD7VjehZACtmwM8PM?UO}~Epn)Z@$6AuOFdyX z!Q6KNJ|niRttRy1y7J(Vaa}|c&B#OE zoN9_8N)p+toh3WNE)q#A{vtA)WYePGjBsmyq}@Yb9Ra_C4xh*E%H`}Pn6xi@l1f+T zteeY*Q>%&;>)W%Lg?EV`VUY219GZS=l_F5GrIbv&3|9%2DzF5}QS5}#osKmsb5;avc=F0#Kdf*uD^y0gPil&@%u6)~Yo zdh$!PtT;bVB!7SMFB;nBhB8KZdM=7-Aw%P7XsTKQw;Mf30D=9sh`4JIHth&TRYNw> zkbDxR4|aF&4?ESU=a064riZ~f@acde;5HD*exn%Oy(mtEKxc(fl8Lk+mpiW_$F2=J z*|LV=T@1BbBhixJsEXLwhA;eKerbhaE(}^GB9o|KX277UGwZHn_gTVkL8j}j0U1l& zJZt*h=I{bgfLaGeg84+*@*pzQ7K|73DMhjMa>1{-VVCB?CWE^nFs zjrB&hKA4hCA;BlaL2Zc>U0;b@M)*E&*5Vci5k_ot->E*-mL{?7x}%A=rFfP%CZYXN z7SZNtsirIyxz1^QxxMYIskK6Si~IBlD3orM>3N!oLg;f4<*7AR#wD-N{VbVc zIdC3I&mnYPa~2)7F$k-*S81SgJ*$ zL1c!VEvb##^!V~|%q_?Gy*lZMUd=vku@y33ywKZ;W@&n9li9LC94FF*UmpzKMvziF zDoIB%PJdW?7>BBJ_Q^r0Fw=iue7OSj|IsJC*78T~cI6qPOa1#W00G7UmtXpq)CCND z37{L1zlQLT{TzuT$B04=#`#QLZD1zdT#l|PbrJ8Nl|z&BuINPb?XlQlh+qe9pSjTz z2SjpzRWO({e-c4o7$cC8Iw4@$2V~hlB<=bBTjPYvT09TrmF5KYYy((Ml|EyYiYtQ2 z!?==C#Lu<|Ux;QD-TlMc6d%xX&ADCJbvIqf;B|tmHc;^++*Gp+UJ%xFS@pa){L_O{ zvJ~Ha+wk=?Bxd%N5%12TBXD{dGXz?ml_#~l(4K863x-^Lr~x}s*rx=MbQPHoniX0Q zB~?{>^$co|!3!<@_X>C&$xllJJ{|?>Aer0{yjm0sI=FwjS;1O6&6A&PRsRS)bL#6i zG&a#q9;e?>=TCtZW5CcU?PJ2;T1{uz%3`Vpvd=a z3BU6KSX+zC+f3}kWI+Xy_ho!fvc*!sY4<<>x5?23AgV9QaVe!xa}p7|CboWP#|@Ss z=4)nVHo9{Gx%KcrUK#9vo;nrRl_z`?3TPveqx74s70+D?lUN|4t>Z$~53t##1rHFW zlGVC5$#Q+TVmW5x;=-Bp?Sy>wh9l^?p?Fv**-^2iE-odG5cCPZYKY?pwry{95>wz| zbKN=Hxy&fHjP?Mj@SJ!bUSBkfxCj@J@S7Fn|#jYhu`Mf z-~C>gPF|W=&DMGE7CO5~IE_y}6UAXbp*m(>Lhs~rztuUh@A`v!^nYnG4(G6-F%G?n z8Ve0sV{wn8)@=P7w$akAh%DyW;)71BOAFlP;nS|&h6#m$@(tVfenYzP#>W+DpL#9O zf^F@cml8@0%I|`%zAU#PmFRV~pWM!O^uK?3F5azh8fWcuP7e3w8)CjFwzqa>SGD}7Vs#vNog?T{$CUE~?3^u9YqXtUq!6bjUzM-LM zVF)YW;02OSuoCK(Mnn+zN@Kr^<8;VCz{N)RRULuQcVCYY0=NX7RPngxZ17N3D`Z?D z)cH2g`&Qnf^8fDkEEX6w-%?i!{Xi;2sV(vvAn#ZZfiFblP3N(OU`$#h?7xFA$42JK z$V(@C^+5@NQEvHnP$3x|CS5(#YZM)xvLUuz!EncZ2eIEVLc4wC-Iw(EzVQ_G@aP*IE$td1I1%qyL;NUtgNhCXsk3hMz<^82tJeJjwx}NMIV(kfpmE?YFkmgw7GxUsP6Zp5uI*v z@6En0uVI>ShT*F^h3!`+imK}d_b=tjJXooAUau(v?F!xf%hWG>ik*|($`5959!F#j zYL9W5?qc1k&7+wlI)jNS9Nfz3obZu4J8rhDDTNHqt#KzAq8k$X7V&zfoLk(VR2_Bm zd$?^gkrH`S*jPphBp#ph@=E#@`Wb%CaKgEEgOUT|K_f<1;r>S?ViUz=N-&mIUVT-i`)2(kHAeC z2^y3-A2YGKE}x@Xd%T%x|5M?4wdiC&;Tal2r`=R^A}-9oi`11HWV_HQf+aDhQ?>iw z4j$YE+^n7g6P?V5=`@+?HBlVa(#UD9W1$+zI-cU&cTflVS!q%PYCdfJG;mSZSp7D)u|k z@1Il|CvHe?F*lJMN`)CrK@+!}Uf5Q?KrdS(0VS9>qJg>^T2D({PP6)hh10!vMA;A? z&~7^NXqZn!B<(BaZE%Qhkx_Bg@3X7M8{w#uVl0rL=<+RNYxCGpLz-GEkL31Opv39H zaoMrd6SO*Kl_?q49&v*Qry%mFZ3AZkXd4>p%et6$MOW)f83urjF>8z9rc2Rq_422> z)OgL^Cu)G$xeMgJor!gMAnc5aX!?r!9ij?fKLS;CcT8Sl4@e52PV%{MI{r62D}3Ix z;))E#dfu;Ut+Y?FPZug;Eg--S%bV={6?fYSE23=Z{DVEwTxqYXHK+lcg4UiZJD;D& zoB+bT1uR=}atn(RBO|~LDE-jWz zNTJ=z-!Nj|q4+#QSi5K|838dAo5tmI%>r@3xR8^{`VP+Dn@WtHc~0;vu@~4i!?qL zqxu`APYs{97?$KM>nhDaXTDY46ic$*lb=9go{Y7=9scS3Lx!vX| zVTpu&&Uw}Ayfl8lqo6L$pZ?#kNV9E=iHHB==$zszd*3#`vR#uWo0E;5IoX=*smb2I zY}>Xq)x>GCZM&u>8}I(V`)KW>b?|)FbL+al*Bk!d=G0M|FqRiG`eOLiR8~@7hlde3 z{{r=r)xN9QM21VHoOT%my0j;69LY%hajH12x38j3+x>OS%(_&18>wDency*hooa+R zBTv`DW{>8_;R-oXwaA!6!PWPaxnU9B+xlKjI#duzitLqx6uTQCeIn_!4k1Zh3h;M$1=5l_3w z1(pv4@xDQE2IxZz%|YzhfK2JYbSnhFnV+IN4EFDw*;Ph&PzH-_|MQfJ^cG9 zSCx!*T9c6m45lPUW6OWMUX0aY;-pw$aA3?DuTq>6K)@J-KWXf?)@OM1?-ye4P7>W3 zwi=f?R&pcy%Sk~6GFVO_m|yN06WHNks26`1l(Y@a9+|5*KqAjli2lTsQ4Eu>Ms)Vi zfwT6W^lP+DO;)Twt#SF%UbIw=mTvnG8nE|9RG~a$%IdO(m}?=V5k_|ov^@q+n5oY> z@Z$p-l#IHEdV-(Td48Im3jhchpJC(24jLKIfDKaXW=oyag~i2G`4Zsv_O=2ZGEbO7 zYOGmiLc@{!r56D-dz2-0F`XSy0m;?og`LFwG+5B}2^eQ8+-TtDd4cjpVZbcuj(s{s z9tr#}Oupf2o32d0HR+m)3~<>GBLYE(Bj#eyaUh#H9B+M!cEX( z3w7)ML!<-32*AE}jSOz71zK-|nM^XWkIyft@`yt1D;*heNp@Tly)0T23Q5cgxdGs_ zD4*giw=@23ckW|9h*uwXAj7}Ltw1F`mISDZNY-xO4Pk?uURgQeQ{IU45^Y{AT(PB= ztQthc8rby%I2XFS*A*!phLi^1R@9^;i-yOwybt{Ys{Aeoqo7`Qc*$x)XJp%r?utT6 z^8tGWSBpfrB_6w+rlwY^q=SECglL~8Jk~v2_XlfWqRJQ@7?6>y>i4!oo$ZQD0HZ>wyM04LFvgTJ$r{4l1W`ZIlV{4x@xprkMikP z=MGq^h@g2AAZ1v?zMm(&|IAf$8s;M%g)pQbQ(7rQCto(Y*%`%>fvYW#k!l;29CeS1 zZ`>X;Q25*}+`fMby6%9yRWyB&;3H(^YgGrP+-o+YNMEO8BLVA!Cg<1cl@ZPAK=_L#~&YflL}y ziv|r?@dl0WE^ehymSv8bcWSV5iNQ9f)4^&ryDxnjU0T`MqZV@;hK8wl$Th$@CM*-4 z^p|(0!wjgPWJ}X;jPPiyb9|;;B3CPf6bQvw4?Z{6+IYPMSse(Dq&f88lIwNi8%upQX!eN`r9}y4>wyOPlmoySV%D>j!N9_YLW<#Ul|zoQbKYdStX7(6Z91 z0j*6v=idMgmA@zHY?0(8_M1(Fx_$>GOi=cl4cM(&vho1yin_Y`h&eGh8nuv~mD?*< zwnT2Un()ik*Zmt-uq`+CZwt#FZ0LFi!EY&p@@_y#@kZ__lP1hIZP5FK9E>xR+!nqX zI@Iy9JrrV~jg26{NH=P|&u*}ECp6XTe}BG~Hd2i2U<1UeJ8e)qBlb38r-tMo1LaZ7 zcg;&la6rurO9;&DYyg|iL#C1^d{2!|*wJY%CS*?KUX{A=B&LRLm`D+)lTBR4l3dFW{ ze>|~4mZ*E+*fVk%Q{?-p$^h9lq(JhWWmJ41samt@OF&PuJ2dq#02fcca?@Am%D(Lb z6-8yNTE0Z>&`49>EBEKYsW$XwXr2~TnO4mvs+d^FLgqp~j#GB>^r$v6Sc-DKX>-U3 zGrg9G@}#)2R1;wK6`fCj->w47A~phT7frfQ)~neD?>>%R#ZRB2bbf)dZyxgulO)x` z2e?0@D``oT)RdItW&NuSF0LKNR=k(L88LO6soB{qDpG(49OQV?_}}|GyKH?dB@A} zu|?G{{H;>V`4pihNIyaL45n!AfrQY{-rBa~bMhw#9C=;Sky4idA-xKHls{bK>9sys zH@n*`3Tk$B^_Xop+tW-x*%o~}Inpj5@>a$gXOw?`?ap*;GXZOb4xWg`i@Jr7@zd6U zOyN;~Py5PeoD~2J=M5}_`IyBIH*8EULh+1cvFJYf)Z!U7tid6|suih~3$8rB3Igs% z@3Th&b;Aum4mb&-o_bwt$OUmoF(-T_#`1^Lb%_9oUX|0%Py(ybR_aJ+MbPzeImst) zv&~zIF~gMJ0h8^|rzF~7f%*SZkq|)7id1GvICBHFx!t}ZXUoUn zd93y5Lg}^oIB5FrHO7`f@;W5?ewFvpp7->6B#N=UsQ-P!@+RO(I{rNZ}@g`v+r_V)Iuy^q6}S(~?| zQ@)3skj;~jsVu>ucJyt8Sv&GE71lI5TH5gy8tjNYI&_3@guNyBMn12{R|^pB0Uy8f zUJTnyS->+k*uL#O*C#aK=4Sv_Z;kO|Xl&=}>B+M?6c|Reg>&KMxWF0soe05!T=g5j ze+ItF6w$?X?jF=Z$DjS}Jj(T@c?<{r0>VcxhqrfT|DywBH7Ay7zU9HH)RdIKO+bNd+p}eD9y>_e07FQVv&QhK=~G_2I;^J?tg1HRTGr0btMh;ZrC$g1`-_K|Ijs33)*#03kapaA&Xo4C_JfFN^wCm0d$)Uw2 zTQ*7@%YvJ|8yQgXCi3L>1QEiFyB!t^%|%91o?PvKc$ae~Z4b62i?ipuE(ihHPW3Nv zn5Zmc+c3OSQ4n!e`7@j4<7>0mcPdLQHDtm)Mtj?YAz&11Tk3-bD}Kf2iFHz zcXxN(MnVeeUer1MsEp7p3t?mHoqtFs*iD$iViI`0z6OKndaH<*Y@e%;W#uTdG~T*? zVf-b{NWVBuY^8$Zf?ccDZ2&v9gv-*i47-(?Xdw+A-7=;;zEK1!dOY-_)#(~DTCa; zY=tIRhdG8D2XTDbKA*2TT0?J7D&s_<Qx3qH$c+e!{|&=h7N4nAfhMK;%1_B>Lmz8;=NmYs}a%UY)FZ!EagDz zUkT)UNF1$_eyC+B!iZ%SlUvwoc6=U;*@?%(WsnBMbPQ@1yYFK30dtOwfS2{7xe;7& zz|**u|ND`@`%x4B1+d`Y4l1Usb}X`~|RZMtlb`Qy&V&;bc}Y9>H_oo0nv_7l=+ zQk@_CK_w4OpBhOyA``_5p3v8(`=yngnGM8`{nY1p`lJ2=bY3sib=<8z6esb3hcP1Z zQBSH8w$0#rLnh^?8xWurbA@y(G=Sw+H1fQuwC-mO&mZ`JO<0I8WkMBmRdpTSM|Vq(JXPi{%6_ivH)8-cPe?11!_xL!vKseS zf)>lEn|1iVGKdsJaIhosCUQhzOs$*pPpYu`KOB1=*5XL>YL%Dzt*|B7r*qu3_tpRT zT)|D5a30zF>o?|j#J12GdQ@lz$_jT`0|0rNQ=lwMF8);eWa4~`D60NzjFP1A3g=~0 zNd8Sn8Y{kQDGsl_K|}O8i)AcL1mbJ;j>PC)Z`3>lhmQ4pQ(;I|V(}eMlFOi$RrJ@k zUTVvHW8m>DSs;%T!ATKLidzoK>@_v1odw0yWktrCrJKH`l8n1o)=&tOV5TQBR5fcc zHp-Gfy0dkm_o8(bSwI#(^dD7RhLVH7*XdY*B`qcnPEZ6F3Yu6$`TQxCi?N4?K#rU| zgOcM~{({Leq)BBW2Hebjf)?t zNgu9wle9Tf7&&ZtX+g{9taO!p10U7{K5R^|c-++WMo2_XvhB*v4_fL8b&bP};oaz| zHaF&&j0xh+B!Ze`x0>$S`yUN<-nJY`%JSlY#k0s9rT!ci_$-RVz!ySStR{BqdV9pB zes-ZViDnZV65tOKB4*Z-*f1hf1}fOFz`N7x0gv|=P@VI(DEdM-KnocF~P{v zW~UiH%!V0XCO|!e0Lt$RmDlEQLqmIb?+vZl5%()NEZWN3lCk{tiMrhNR*m;9g9KQ3*66?@vq!b7~HP+wA{G9LHs zzVCkM;PbeQvPk|F{u1Y1Bbe0L8dOdcynAp0W*Ma{7|Uh^Rge68vxxa81Sqo zY8vd!Lr*XLt#ZioX~DL|WNj{`L;GRk6XhTMCI@}4VvLEf#VN}S3oRfuTf$~7)03xI zE^PE}bG=DM$$K*QKbE6Uw9|>NZ+G;Wl`l~~vyxU?;9aZBQ?JDuFX~uazbRYO_x5IQ z0;#d>aTTk{Drf1yZrvp#?2>!?m26_idV^mt!^4zN060q9{e64*Sds-0+um;+U?nQp*aW;KAAOTjDeR>T3%(HixF*t9I6_w*pw6r ziG_<9C>tDXZq5z38pt_GUMZJ^B^WTOFyR)zhczO(!!8@QB9b{2hhfOR;A8vD#oSr+ zNHs->j8YGFA6jkqx+zdE8MrmJm{>Sc3lG+R$*@B{`+AKcI=H%3Iax$`&vc!UEx_^iav;U_|Uj zbReZOH23wQDiKIWuXz{SMf=4HIQ{+p@ab&t$pBqUSo3Rj(*xi3ZWmy575NZwqHe5l zwwP{c{cX*kWhVtHI{EXNlH^k%Ne+nDV+KF=XUFHvu?y9SDw? z&${xUP;@^Iun~18U4<&u=5UwKgch0T_qi7OBZC`5*t=R0$FKBR8)^YQZ_fbMwatws zq~6Br%}t}G704G0Dlq9FGP(@J?>u+-EfRq9GKwA&`kuKObZ`}0^Z1uYJ6D0AP*1KvoNw4B>GTk+Qn+!CbJ>P`Ox1E zmBQ(&bpXXIuoLsjA()nXYNLx?Ts?U=Pt`|Jb-CPlW$e##QeE#DO$U75px#tU4eu+o zw@1D+Q4Oj>PL`(Z7O#X|E4DWbF_EOFkH5MiPb6>vYOWF)+(df$Q;U?dN><0U(oY5p zeaL3_VYK^mq0$>I5YEN6sn20_MaIYfP7>W8H+o2HD&3`~&@NYli$Vd11UC8Oh}9r9 z9$C-=*LX?+1Y@1AcT?pluPW90=_n0p59)`&kFEF^0PBU8A0kUHIa9=?aNCMw4PKj> zr5NJaReJ3`O=X-}WP~J;X}HUeif~_SYHlA@pwP6$`|t7pJ&a7;TtIhyXd}9Lfe_GNuba zC8?QMr+!IDAP-C?8Z{4yC^xDrNC`QKj%B2*VFm(8bw1G}fp@U53-Ew?3A_&F(o|SX zBoRHo*Y0y&Ag#+!%vVlQ6ONpe_TTd?Ox=el+mQ|0cEvvtyhIC4R7sSGU<2ofrGOIx zFk5%oVuDW6h5#}-al)t3FK=s~)?)3A3J-C%Ja<9^X)_cV@zgnKl1A83vqU;DO?`by z!~}BucO&Q^=M1x5`|Dy>?_*=@ZDXnD-3<`OM8&`$P96)vH`1wFQu-9|DWzLY+OXhB z30GLQ*--Pm15hE*T<{aSoEgX1S*->&%%0)DT+cWbxUV%0p69U zV7{}8muMp-PMAppq`r{zTM}Q&13>ol_M(ie{-y`j#Iw@fx4PMROsi@1Da|rTEz=!k z2pjs7YIQ*Qmm(Q6As^clvGj+VM)V&QPmRTYC$G=L79*S{{eS-*qN}z}nD(tjKV3F| zTG?1IpSUTsVu=>@@u`Jp55GNOxJOWq?lN8LrL6TDZGgXyh{&}19GTT|W7RyjX^>5D zI@Mug)o?KngEQd$n3Rp2(Sy*70!?XZO$pCjf)`G_s}tTwCz-jkBn(L|^=a{ZG|*I_ zEj1CRxY7-9p>OTi0(k|YOm^w1rMoU@Z13pvnkm_vw{_~<3|MHAhXTF{9?K0wrd`sPgrCNp@P zK5P+&X%PWn;+ieK7Atpo4C8bGB&ut^azB4s{9KV*_7OTJ%-*F2=lv>aeW*>?j?#u{ zyEqJMp+yPpO5lhHHRpus&GFboGBGtRtZ1)l;kgxrXmc7J)_mO!(=yoF_pyP4AMILI zHTpl%#R38Xw6&M$M4v{|x^GK>!NI{m^5te5959>zRg~H&?XV1kMdxd2JuA_qDNeNO z?eWZ!=*QC`-Jath3TJV0y8*VCkB?7@+Lz6C3*B~ui@ksw4**`PhTrva|6k9`Kj5~y z)^B&u!*NAdr@a;Ez3CisKVPZ0zylY_$OtrsO!@6>0o6JUzaQQt!qA~)%jO_$RbGf# zI3aoV!4F`Zr3`250+th3e*k>d)$nHaLWP-BG!uMZm1AI4QOz?mGdcd7n4h2j4+f#M ztPBdbY%q?5f3{k5xwWQ+M;Q3V2Q@l48w^W1Q`~K63D--K_|)qTn=hOs=zgrWP(QrXkjgkWMd%~tAEKrgpB z#IS^H>}I<}xvbevDDv_CI9Lb0%x&K#V6IR1<}gJ?d47|MVGTO`kM}*16NMKhV&FG? zRXcf$J&G8jnA5S>H(aesZaCN0BPe&0F${@MTE(}=`+s^PMShKRvSrDHhptbrpGq>h z%qa4X+DMBPYhuEVNER}@yLnS+3+>&C21}W!BYnA*MNS0N>O-2rpzaAbwWNU)jqe_~ zq2}A{)h(FQ_LO8SFg4McfqxM;=jZ?ElHr$e%VUFOy(DXE5&@k@B2}#xsBN*7 zL`uS70JoCo2-T%5*p1p{U-p?DI2zbb{F~9bCJEaswe3bG%j1ZOZyjVp3eYQ+X`RcK zy8nezX(T}~_vT^=#oS;50n^aXx5isO*u5}xAr=r60}%gDUbOj0hnfWVePg(^AOJl* zGm|TCf#&aLYdiV_!NXAyLyVPSW4CSp&v2hJBxiQ-AjnN;geqT(+QUf+&Vr5~8UE33 z-}z+D8Uru+M-u=1{JiwV{qzr?Yl_(y|E@o=*#n`~0bHITIW0Z~rS@L!>@cJ?>mIl(aX!%dEZDXV}&-mYBdn zeC-ltBf=Hw>e#Cj^qRny69TaD_Nl5wnMNqWF|Pf>+N!RXmkCN)Jkoli4QE%Rg6TUixCX;F1b@+i!&4q1=5;{(%yD zK|D-PKavRwQ`JkTFILgR26t#U;PZaP-IT5hh5Ho|a*MQUhxI%6wPDs-n_8aM!DMo3a^2@F6ECI9SQ?|fwt zUy#vc!6k3r%U&&o&=0eH2>CuJtrc~f;O?5i?z#G_oYp$^yWIxgJrL;_~^|2 zD`w0FR-C1jT#%ocgZ|%rUAy-684J9VP{ENGp9+(2XW^mU&w#77`zHdYA?R2duw`th z`3VEo&x201jH}R)XRts<9Bi^b=W_6uE-J>9N?3IHE)it>gQQH(LHD6|e8e1E>^HV5 zZiZsd6?ozzdbQc%7r;E!8aV7ErrXLA9B$)V?bV?mbvEWR!|&ql+;g{$f0e6=3*}_L zR=4Eh-~hk|&#pecxvXDhoWi;^ahQ-hOc*x5yFUBtbH2Gi12Vez=$2>2G4#(si{4o}I`HwX!ghGCf(lPdd?D)kQQ@3IRQ6Axd zsPn#vQ&(YnW<{w?w{y)W4PgzdnM;-sovqw6`Di!uPgz(PpNaj@DM!d^CddF1e&5H! z8#en(8|#{MBy3pA3FdH}Dp@a-nj~@z;3?@B94lad6i7XFiVQnI^`hn0~>2muud<*TZ6}^z^A&6quOQkVCNrT{8LRpCBc=%5?zQbM^Rc2 zCH(M9OW>tGBS3OI{U9+Es-*@t6jZHwqB2vjdJ%v@i>e@kJ+KwdbFdq;kPJHHw4J@- z<@ps~DsERlBao$ui-pB>cWC^4u=RevHHnYxbAN#jk_y~>>3(=S{Qhcb{5_BCac;nr zCrOSr=}sOkShmXJWAayB=jmu#=i>nI?CryCLcQFK^<-Pvpqy2QszW~4ECvKgkivG) zMj|pd&jWHpajxwe6FQ?Dd4|C!i&rpxO!>eX!9Pbk4=?0x|XSOtwj zYXku4oDr%8-)ni=wd|0h>rie)5?Ck1&zB!f51Y=3BnMBA>Y6#U-<5y<`k9u*${<6H zn;-`L4FwC0l0ec42>Q}f_hoRD=$2oK&W+`SxC( zv9i*oltxW)_*8wHaduK$QG1c=)qf+xM$OgRNH`*o0X8q5Olqc=QRqdwLxeLy&cXyy z!}a!2%f^<=00KGMo!^S7yK|u9iB4-BtTne1PCV5flCb9BFu73WeaTpXiPjBO;tX+M zeE-`-vJo`UqzIv=ZQbwzh61HhFQGC};p4LLtLtM>1OkcdN}OcbrIz01`h?+?m%TH0 zBAjUC!UD(?6@vg@Y?5-B0uJ0jb}#H~J0q@E2^@}=QCG=lfjiyYu@KBioj>gw0rY>y z43}j3K1~rnBW9GIJc$5GOAxK)!msxEFXc-U@Fky`(x1bOv7vfB43^w)M{R*wcOCZp zPjq#!>Za>AzrQk5P#Z5Am|o#OjEs?BaqJXDJq7RX5c~raF?F)?TZI@bV`;O6S}Xb0 z$x1kkNKviqt!Rr3ikc~~Wl_IADKVAogT|NFxX+*4Mg0+a_e@Pz@6D0lM%Mcw-e+}- zZ}S-;N)6l5^3`gEqWm{VxriLGM^m>Bze{|dRklp-Jz-@L`%wFkBf{K0x{q!{)Vu2J zZpTwklh2h_2_W^FWB?2Z1NzZmITt~Sfz}*UQ+tHMfM_oMWQ43Y+#2Mxmk?0R<_O*@y9vyq^qDI+r!nZo2pfvdgg>^sK=DzJ8N*eF%fKWrUeYjbWo zyD{g0i}wi#*jk*>x3#lNW7S_=S`%c41oM;ga|q?guln0$HeIggZih#wq1yHQ+}9kx zd;ZdIU`%+eSGkg4@p3WI1t$l4#gKsI(gmo~m(|7}YhmS!Gu2D$3x5FTXK@ zgU{&^h~{p68Cn@wUIjk_8CYZ)9G1Qb=y&+8T&FO>%Y^cFUyn9TiD(a)L#e{n28jZ%FGGQWX4}(Uaw(8v2nTZ%4F0?gW*k`ncFkT@-n}Fo z@YN&GCP|$)APB^++vz5yiaAo|m7+_@ztG%SCxKY(suTVU{vi?}q3{D&abI6^nG%Eo zt-*g6C{{=Mimapt^gJ)rDb6t? zr=))7=zC^1xvm;XMa=3KDrZde2gpN*r>92PTr$@>E7u+@kmg8%V<@4lV&q=Ygl zWqUUp;+vgH4nko7R0hfW4Do>(SB4USD02?}zBV?!^8pgX*v3gKLLug7c=hwV3CpkY z5ZfZ-mcyo=t$0^Utr{M##ia2^88;J$NO;88xV`R z(%yJTV(XDlz$-d{e|3qeJiK(k^?U{l%pDx4BfKR zD|YYczh$N9`l!}D&3_x4;_x3s<{z8nT8B#c_DzkNGouRv-)E;Sd^SVjlV5iUy?6?l zcNL`IZgbY7uD+T8MTmupc_SkmRb&oWZpSe`8#7hg7k@jm)(m7V53VZy4_ECl;3+sc z5tq_dF_44O!cA!cQcBV$Ra94##0-VWgt@fav*tL6`nDA|o^JOAooGa2tDS~FcN=SJ z3i5F!j}*^kC^BnNl#q}TuJm|p?G8j?kO;L|JzVT0Bv2U|R%z8#*41q_eK&THkdUz| zi%&#!b$6@L=>}Dm17ZwJmb7iS!P8fC;)sNt)=0hO(iMk3Mt#8vB1gGLoP#Q$XlDas z#GM;x{k=YFxT>DZfED% z8TlOIO4h$0(KD;_-xq&&io(-%q!5f>t+dEuZJ!q`RA2ycR9s)|Pek~*35}O55)1|N zvx6h(xcG($vVBQkqIWmSzbW3%342d=a6ui<#7lE8xdFlb-==PoRZc2kvZ`;X^X}Bn z#AK-xfAVu}Fe87;38Z{4vScS5JXGjaMDg177ZEbn#mX=-Ib!?y425YwdsRYmQ$bA{ z;2AN)Mi&K>oVYu`G%mNZ;eXW8WZ8ZsD%5P_^Y1t~MtEeM(53SIsj`JmB#A>ASuK}f zbXlq4#1lPwrZS(uyX%Dy6M6tI`?K8ISobOXm0Vn@0_aB*;$OCks%gS34VcRofdsI$ zHm}y?`b?_HJmCk9OJf;tdh2u>ZwuL{Hrac> zJX}#rbBgz*C*;QArEN^~8V?q86D0bFz8XE6_3aOot+;kSD(imiZKVz;`O&}@XcTEM zwIiy@KIUQuy7aYU2CEDZ?W$FZGUT6i4C+`&4GbS!bEH((Rw$RuQT0=;*e~Av{jaaj zQ%HoJeR~z1Mv|X`v2VM>$k5P1C^wvLxBH*=lEzE+!~FwBTy(bcAYt-M?M3ZOLV~Bz z=Hg2PB^IAE_ZCSx4JM+eQasgHT8eRGwl_rW~6KwqC(`a?MWAAY6n6se#P@XP@R@2(GnZqtw__w(pC9a;Fk|7E z295O%jO9~~!)AjfipKtPeKx^<*h*jRbk z`z{e2j>6V)T!28<42K`z9p6zK7AP+5mZvZ^m47@dx$izWl!^PUeED9Tmh_AJ)xoh8Rh?0`hQMQXRW6J6A@#7t7 zj}wV#%4jGRUYeoT!HHGw0$-WMdmv5KQZ9P$9h?~v#kQ|$zz~uaH$^ZQ*@=>d%`?~l zv9EoKCXGB=jw0kAPM*Rfw@M#B0HWXVnsB3_Ml4Pa#GO)rb|T?TlFRd~yB#5!(I%Eh z9cpBzbd?i!o1vd;uZLpCW>i**j$=#!z3L!O7xmQ3SG)Raq=paAvLyMgRKQz+ticK> zBn5J$Wraxom8$mN1_}0_^eqgsYP7A0a8zC?7!IWoDd<)Ff`h4s{0J-e>jh*LozG5a zL@QT=_r*p`alXi1$0Tne)eT@wKtku!WL}L+oLbyf2!R0MdGHt?R`RCO3qm3jab@XN zPYt8*&U%Lo#;uo(F3T77U(R>yCwG&0-ib{}IdMa0v(iMeRx&Qi^O-xzb$YXnMWPMu zR<7ay6i|t+EO2Xo7+Ww4)Q(Z4<$OJ)pVCI zGKT(|buNENuNO`mBlU|I`!vC?l{1~ZS1Y*efjoKa7B(V>?SbRLXzP9={%kK@Sl70o;2Eu=eBkPM-~2H9!Xb?s?;_`cudwLnAl*Pjv-b;i7B zZMu#m(u_%mhLQR0JI4@$Fy}Z7(-6kRm~n{-NN8b&h2JDwwh}c6fo`_>xK3lla7O(k zg^`G_VnXN`$vB57c`w;tVq^=k7)z!JsFF*PR*6ypjfREcU(Yu5=fAf#cH$$1&Kc-&>b&S9N3wT=!7}&ca z{@(e`)0{d*8AinmTV9tZiFLW+Kakh%I7=@I>U$tAJ-|MY5XeSOf(YHmrIeH?3!-Pb zcPAzea-t|mF1T(G3B;<8 zJiern@;5zzk*%s^s3cuDK+jh)Pu|gS8=bkTYL%acj20gu+M^f?H$x}v*T(<|YTkGR zy#0f8AOU63H`lF)xKemk@<R?d_^Iu#F z@vF@4+8Gz#>JX@QGNx%)>{0`+x=kn`C`baCZY>VX+ zSGVg*rE$*>Yd@cW(R<$lkdK*_3hhv6*9;UN9KNZ<(YDkLaoJWFra@OVjeY$c!pl8s zsSt$*eLWu&D4e64kRlmdet3OUg(InnhA>+y`I~~VDY?azpfm#cfv4az4r?0Fv0Jed zZHSLVGKWZ|TgGNaHb)UqoW2g_^n-uu1};s5ZPYa1DNPO<6BAjU;mQvKe1tS+Zq_AA zBZh=X6UTO?k+MHzcJsU zygo!pb_`Djz44$--S|HF2OLa?I0=C{IDR=lTcJA*b|Cj0X65v3? zQWHhEySsiCSx3*Wtb_-SP9vv5rV=^-iVt!J7UF}k?~aiJeT@P!RW5y7th*U&rqReT zICyZeKu#1~rB5P9ua9UVYpsx^NA-BZb@t!;NM+n@lvIo-UJpMT$Kxsba64^1-`u$R7pNJRlND8(hBf|nGfDs;f5h)Jqv2J8n!e)$qH@oXCe`;{?4>k;$t5x zA8{J=Z@BS%#IBR@1X&tv;hTCZ`9Z_Fo=Y6DzBetnc-#(QpwTqd8l!$v$Y&)%B+_$O zu0+;DO8^gQ^nYFNY1*SBM!z(BeXfp!eZNSYGZ)VvylPLj4u_{I6(JsQf}=P%+zER!SQVwz5OnQ2&Kh!^Wt??#r@+J#uA()sAZC4m?FTv5WK`WQI zL`YJSAbkqBnRlVaJIYc(k|X4HW65y=%;#(-@w)1%?%GfTLm60Cl7|?I_0gk zj>_u&cT2{iR>~0M52cCQ-QD+&VQN1I%AL&Niq+HdLW_*GhU=&&%_T?eQ7 z{?AD&^vypOZ2P$g=1Oo4PRcPUWh<79XG;`Rl!GyU-vs}Qa^*SmR+eg(c48GaRwHB| zx29jslP%-mk0DUQjzP@9l<%b{CnOu%GI_cm)-X}@5682GibytqPW(L$siGpN|M^e- z%JX|ZQOYu+2=;v}#rRTb=y$hfWZbbzNB{BfXbq=x$-B5EcJ;L+to? zZrHPNdCde&3f+(Z(c+g8=u^1Px297X1IqA-#ldV+lTG{~=6~+j)3FZK7?DVKP$(^I zNX<`VWGT|c=T2N%dE2M|*<+%I_3!xN4mp#|A%hkiKkc5y?qPzGm25Igas5?~y6I=q zCoEG=Dgt+Nj|e|sO_-us%DW2hc>#IZxs zkGl^b7@ZLO1j$}@0C9}UU&D+WD8EFUyGH+%k~?0}CU|7v#a;5nKTZcgEFP$~=RpC- z!zaaBCj(CB!LXXqCaRrga`50Oq>^=x8#tg8Pos%@JQ2a*y0nyb;VW;}1TsbPlBMpa zqwEe;u~~Uds|iUr?i*>KtrfqNVr~IyS#PoIDR~i9RFvcE3xk890WNLgZ|za25lN5( zFUy#VA<*$nOg{eg8JAEJh(rseGv^t!jY9D*eZt|5w&x*cX90rMhFZ~>0`hCm7!}~f z%;1YLOf;g}gevrM_|`EH0&{C3ueqUEcF~{+Oj}CR7?elmpj#8v?I?O-lUV~Hd`#4h z5o%H(IRh#;IT^|+oK{vmn~|52x}b8XNn_$B*}k{x=y;GhN70!ZVJ-k0s$LWsF@o;i z&DdjgedRC7bc<9AUX(3U?43G~I~uyBm8IWn!*+q6a2i`KPL`f*HzKqo%;A&6-O$3ACE@8Qg`D?>MvP%T4d$zqxrFI=Q){?xa zd(lmkt_D2~6%{Qd3s*nZZwSq>by{63U@PtHv}z0p5#i5HPoXWvRA+}WgXO`>o8usP zN{jB!g&PBkU>j?-AJ9k?gbRurm;4^WbV)(q*g+M_;Tl{4UaohkYPci#pVSePd9czX zx#?7X@6?{>1Z+ORI{i>)CtyeIzxlIE6Qy1;pID**4-c=XjshPPhEC>~JGVMLzyI_O z5wG}oKbtln1E3!}D5YnSg`zpcY?>99kJaI`jwvA76Z}8WaIhB5lHJq+8dvBeA72}C z2&jVh?e!1BV~H!xlfGza^h*{DuDw7F53M&|P7M}PsEs$8P@NeD7a73W!Dmd5=k>WowF@D(w zooGxBK0ef5XOcmk7)xOI3pPgE@2Le^E`Wbb_P4?eDj4$%LHOv=G|o0U=oFryB|v2p`cNCBrdl_Wy1-*PQm#Ay)%L&+JObu%{j zUsQrg2_}h{hFNQl`a{9z2t>L3RqnR#WVHd5$Ex9~$7TK~vduNlit*QI#%+sE+spR0 zfQJMHeD09A98_TiNYR{|BV%-iBb;%pu(I|d&6>^YqIB+@FJP@IP?Y>O5|(^@Sk}axUXh=NtPcw8_(>YEcKW&&m^3BB9j1U3>rb@4^s7d?&HZ z7Gsp|(WrOZMN?jn_R+y-UczsFC~3^N5YCkfC|IK>pQvc`l@eS)+y@{`L$n7bayAXv``4Q5gnwpxtxph!PGwJt{*#UvM!>RAi zhD!~kgNguAi9vjcLK-l8x4xL#4jNUV|Jzo3cC*;-az>mfR*uUkq(}if)9iI~$fR%u zNoJLhxKSq>HiQtg>Aj<=gOw3GDgwN+eMF`#augSxg_hhp#prbmb>%{;I6;1LNHM{` zJ49CJ<_z`qzh{(I*!@AZhNaxHvd10@+z&aV&?L;)FrcYm=0sZN*M}~(SXfvz@;Psb zJ|!y3XjUSusjlw0u4LjaWihB9z9W?%E|iK2p{_kcq4+&B{PMB;)?KH^CqBnu_Qx4^ zpZZ5@rKOmXZ2W9Jm1?Ny(eJxggUS2gw1y1`fCyd2%@Dy^b3bUL6GaR_7ynBn@}X9>;Y_>Y%32M zxue?L*|eCbQK4pqP|e4syei*j)lTl0eumFBo6fa%%U!n0=|Z$vN#&6-gqjv&|j zi#2?2-+!#MUdyw9XCijo5z8G;{+0bo<3W}28zb^U@6QeQwJnG*^tw|&8gS9J7YjLk z|BHX!02q^lo&ECTed`0pWX&BSs9Ng2=Wcm>y_x#Bs|$E5oXmE=}7?t^xi8CBuD9$jz8uW%G(Mo z5J-p&?6{mfivV)V5MqV@raP5WmlQ@UG-S44PF19_~ z!1(`~-=;4nMU9)bHJ1GhMzy9EzCg}W}q$9+|ClsNhja`rA*sO74MRyI4Uz)VGT;y*(k%N&aZ|<6V z?m2t!PyG>}yA&SwX7=JLN_v+2EogwO>Rj3xb~lVQh8Yv49nE+YfFyykG6vn~!C+kR zecdt%xRnPqQZihZG`krDM04axg5-9(mPpukG7)uT98#O>p^dS)a&N!4DG83lb}#h) zk;D{dPwr-NqkC=gyvTLmV4{$$H&xGC@0|q>3X;c@GyZ)LWL=JA42yFnH}ZMn;$o5N zZCD0&2+R?k6`2(MTs4vqL9}v>t%GteFXDL_hTN2xQV0>P0QcymqmRP7%;rm=wkRf0FimtE=-TeznL6m$z`4?i)&XmpMLJI9!w02 zo;E22GX0l?(X6rcEgP|vi9RS-FFWeavGPVd={4qVWnbAFtzU6DN$q;mE*dz=! zB}Iqso6--}$5TwB)WEa|Vo)zRhQo*gPB-SmE zpOc9#=hcozWzG}3Nd2|irN3Tfs)`QHs3*4$B6D^vNbkjPbVw0a%5u#xUO=5bizQX&YQ^Z3Ta630gj z*B!xO#=WF3KR}S(K4Pt!VvU9Ix3;!uonYvDSS>W5hREnB_BXgF;4>r9KFTVj#>zAA zc^Uf^BI9OfXP+Kcp3vR*ic+02w*P%#C4sE^nZLJ`Cwu0>P3Lu}7i24fxMlby^;;t= z&kvB%wDvN8KOhQ8d&chd6YeC9#8DNQ;oxQck*VQqgpPPEJFaEIgeo&t8#cHtqMnsT zie*r)*{Sed-HPZ^YvuY<5v6ly?6ahVx&d}>(d|1v27=ipfMgSi1%$s*hJH38BSZ6( zkdRQHs(5n_=$%YEvfRxJzYohp^<`8K4rw3rqL3LBXu1g7S?ev70#zs1ds@LXGCn?{ zz<@^zk5R4r8VnF!2|NdRt41Sn7uVM-z8hbFcg>5sS}*J0&hY`}P6VGKR62a}*#lnbJT7#@R*h*RDQS zHemqRBK^&F$WS2D)OgN2UtU=@j7WV3$c)D8B+Op<`u=CCL`0?|Z7Yt9`T_6Sr)zc3YY2uGZ}YCK1$ zGS(U?ijj5z7-K(P1VDAB5@Fk439*><${-(i?u7Xz2hmgg;P{M@I67*Oy`8?nA~GVP zsB&g;LwFVtmSl+n>~LWa9(7$eA7EQ_l6PM{WW?DzM!Sy{vci>#h*ZL+(@n*iVW68>~R`J8NCaw%inZHzS%B@|U1&V-IGRzy=ugzl1W z^(>5YCch>e4Nk(`#HbgYn86Q4;S-KZfWx-2rFySF5p`d$`AO|~T68zij|CMIXJL1X zhat3+XyXFCBjbn?aL3X%=>&sg-7R`IxKIW3%hvD)x86B5fOQMVDC{mad;z>}eSZkD zt@8K9RxT@j>VN$ByVPo!H8(XbRgxLv{6aGL@xJdfC93auz_RCQA7x`>W5>?RV~G3R zUdgzNW9!bGPigD~w;TmI{gXEbVmc%E=iWC@mv1--=-1m6i>P*9po#bmo4712vZW52 zJZW1Sz1J!1{qBi1P#$p=xMh*8-;N2qB+^S_)tDl)Hye}+9ukPw z7QnUKLm8)?Z}wla1saZS&8$Ip&(C-=4}I2~3_6yL)hm>RBc zhgCB`WE1Hb{erroZ36J>>%^-vUjK4c;AVG_fVloFL21B)7k9$@XG4R5nJzFRA_CSX zmCRnx`;AQo3VmBzTBfBJ{`^T8Dm3mP2mRO zg%b?|1Y$R9Cr&x{ltEPWa3e*kj;FszSMe9^dDd#}_;#6HJ*dGsL2S8oRi@3` zXq6{90-6R3-=O__D%S~LSF^zx~`Ug=d?AIaC@N0+KNxLR%O^TaV#l* zIO#UWF>Pp4kuGDec-2lYymjAv6%tlovqA5MA?00t&B4zg#w2~{OBmGrc2iQzwRJC( z?ece`3N9XvvE}==`}oYppQ7#gHBSA{hG<*E{Sy;?$$E_JJ+CLC2@pyD3B^$j|MXB@ zv+o7_m?W{l>ZP%5o?l7(*@;MPTRL1A=-A$^!yEx{<#+iCCQ{MA5HXt)ws3f5FHzJ| z{9Lv00x}UONvGL~#RMmV4JZYPohg=U^CY+J+MEWVU}347iFCF+!q zhWQ52sEmUIa`gYiBa(=6V|K(Vb58$yy`UUt4eX+jdt0hPn!c^Q03(#h9~uJ?TYB* z`Tu!2=bvf}_7+pYaS$X}K<{}GQTL_I*mii8m3Bk*sHXqg zN?Ikf{`>3cVtm2pFUm>8KZd~dq01o~IJr>p`nDGK{)bDU6`hTe{J(1Y1vJ6vouS8k zD)Xs8Fm~tdyv1aD5c%!oYkD?t6kN+hjmlWWolZge1|&~Y&`Go%$^vW3`a3Z_DdH$H zzecQ`kJ3{ua1sBEV*jP9W5@{8=+7*R4`5WkU8s!td8q%}2>?U8et3}*KLhNiWrS(V z-62>;OgKSh$*J5bk7MLEfd^$ChN9!7Lf>=8BMP~Y6L@{CsBx-A;K@ib3drDObD;RY zm?!-Xac^j}P3_no=@LVX^P1i#uCbu11Ft6+_r=CmR~dnY1`&-qb={zpVP5r*Z>s_# zhGAs)S}p#gd;2&qgvZ1;M(Xrkk``N+T%a{_+LdS2`reo)o1>_KO{ z@;2kDCN@a@@I0llt7W<2NR;?qXzRf(3~vG?71mS2?3 zZ1&-WrEcum%J}h~X5mV+llhj4YBm-$ws)$?Brrtj>Z&43_h)U{{w6#mkm+b)`LQ)i ziA4AMMYcxHH|p;@WsI`f$29xD#By4F6+9Jg3I(!QCvt}IM_XRGA6qW&OimR4bGC?F zdhl=)to_)t_1IN-fNTASU>H7(I`D7wRw-(T9)JzD{|sn!{o_A7Z(n{RSwv(?0%K*7 zCz63S=FA@ywgi-an+d`+|$z~G+Q>Mh{{lu#j(39q*7X7 zc$+WD{#Ji_8F~ai8P_hgPs6c^8rQXkdax*Cuk0AjY1$_=n}R`bTqF~n=-w{Ofy`_y z*6Y&w+EbnAGDVwQT`+1}tqO~k-}9c#J|&aBkWQ+9$4`%LwqlP*J{@XBa0PP4nfGAt z911rki};OyaJAruN%ToxPblQ+CiV#+!a@^dH7VFJJbuD81l9V(*c^HeIx- z68;wc-c(n4uwQQ#rg8VcnC!&?VgYQXD7Z2?gCspFteybX)XUh=Cg7b>idWIr7DK-B zj~7`%pX}kFU(2J95_8`8{fS|V0A%s$1oimo%+Mc05QrSmH^4#9gNx)Kb^=$+KMVgt zIoXn&w>$b?(wcL z#1`A}U;9`wOE9TEo0y0clcJsA8C90X2Vc8Ju0xH{_bi(}lCc$%!Y5_tDI-;%W*G{& z?*H3!kFPcx*y>oBfBdiO(@WBXm}~HUeg?`erGNLvealQ^{YFkQemj|ZZsE_%vy=Ah z?=M-Vs?MXo$zh$|oC+nO4Ti*DNWW~kY)dHz?`&oIwR>?TnJ!bjr)PFYp69O50^xv* zTgvjvcDAp*RDHEw3)-*8uHL#V-TmuhYUOB~!*B=p3}XMpdHX*rjNb+9K0&MUH=5|_ zv+T3I?M^Y+k;>4p5lkjFa?T%BjBo+%scE|Lo%U2u5g40@EV+gv6ot6_NS7HJuh6ar zsdc!iwOSWoXyA8=RaL#d)>&s&uNqQQ#dm;0;7;P?)_ZN*Nq_ybHzcy{BVYy!tW*NR zOB-ala3B=HMX5|)`xcIo_6#=+t)8^u@ZB11Miy^PKZmIO~^2)Rj1oi)&)W_vTQzL~nW72g_)8Hv zKB;0AK)kB1rE>OiI<^#B<-De=W6MM(n@OlsUZj9_b@ePksBPNCJ%R3tW7NJw9#cl%U%VAGaqmjO60%wjvwfw{by zlYuFn?`_8zJTXLsn8kdu=n#$O9!4%2O|3hYJ75r*&#Uua+%GyLXJ;`0NL^Z}_H|u` z{=|=W?-j4v5U(dj#0i-AfE@acz7z1E`nf3LwHQHJ6U^zo{;{oVf?VtAL%_eY}iOt$m@r z>1}|$n(g35g2wyq_P7AdbtOA1GwHTQNxS_wx;YoAQ6eFooMiE{{FkVa6X9Tul$rX57(s?{A%BFK&DtXX30L6I><)n_I6x3Kx!)0qI3Sk z9QJB(_R>S8$hlPtQ%o%v7L((^Py2u!;a8eI!_6)mA>UF*(l1^WB3WIo8y5)vxpf++ z?Fo>hE8o2e-Y+Yu4BnCCd(zT7sA4- zpjZyea&hfMlMzYLtr7}64lncvy7A=iPSD@zAwW)hb0}H4VhE}_WrYM8UKq^WqQlxg zVhTEhLL(AI900@F3QADdT1?T+#6?A8tLR;X08Gh{G%eu7NEta)_Cgiqrkytoar{=@ zAiTnILa=avH6jUqlZ23o5fMv-QS9wzVs**NViA*szma;n|9p!p?;eX9dq^P>TC4A2e^8;C^sF zU<9Z;oW@Xdv@%cuBxOwzMXnKW;vEN<{7STG;;Q1HS8n8Crnnf5i})R1fvbN7qos*bwI!RS3Kypn!cYxFgAZc-=3H=YC`)VikhJr_m_q7pmg{w&` zfDkU@@1{L&|F%MhhIso{`mR%{{ln1?BrQR(Kg!9h@6jt;(NvX}1+)sH#y(J2^8|Q= zxAsSG@cc{*?VT#cX?s173>j98DNwi+x=({!3%Hv~QZ?;lu%K+pi`hmhy2^|7KQ}(1 z2I($+C3$D_o@cYCARW9o2rm`ze@fW!RS<9pHitV@v)hmd%UxZ?hV#_D%>LE1>@Z7R zZ~x1Ug5>&m@59|mryhw!U8cRopU3_d`nW{t&tPi8PODH^B^{M!@Kf_kjH1NH77r$u zG5dnWgv*;X`J)r=2rk~26aqBNAw+U6gXMTeq*rvxTZ**}TD!`#YLezsJN_`6pYy70 z^mHl=bSlyd;$$z@1YBX;FkQvkv|o=LsVwQBh`rJp_43YkVOX3`O`AStXKXkwu@4Gb5l9;g zI5;>U4HYU@gMOY?WJ2;o2sDg--wM2hps~o?vonnVqu4iaRcO$P?iXAA!q=zrz(m3? zWt@&_xT@x$ufb~5FNL#NLV7hS8HyL0m*@g(`7t^Ug_{89n^nKBnaZW_O_?+ZzZwf$ zrms%#BoUSGdttA!G9Y=?jYwoZA`#frip)k+wDpHcTBf!qJ7I#K&*QBAEI99*VlZuN zWDT15(pd|aTEF;_JRnnqOwxn;lk7_1rt?_QU=)n($lq`^R2fr{6=@bGA>p}$fAY(x zzY^JaUhNJJI-e~~<@#0#=8*-M&s|O`S}M$976~T~k?Fg7eWYk?t)#_5i&D>v4&gug zg)8=YY&CUR%2!Mll6z-jr3J?@h7e`v$``1k48D8CcgpYh#;Rzt27*E%paF;v5XgJM z)B#f*(WMnoNMqUSll1rsvA^%6F{M5=^7Z3lj%1a{PiqcfydHZf;8Q~)Hb&2U1wPPK z@HTBXni{drn@2-PX>^%UT$T-l$aH#SPA)Mr;p{(OJfC?OuHdXE{a_ibsoRDY{-$*6 zB*0w5+-h;mC2a@BA@9~91n9inU8RT1rj>zBL)V=_i z5-Q7#1OFL*Kv_L@y%V#pKvt)A6xC&0hj;hv;UScT@f5jxbO12ry`B1JSt2`eT4sIG zO$lm*T0~B?Ez>3|jg5Hhj?{8ajSqe)(aqoxjZrA8X1KJtTCkmeq2>>RH*|_FZqrwP zl(d@Tg8ys*{C8%z*|hXM98Vvm9-aPF8EM(PY^`#idpZB%Yt9HVpeXed5lC{qDmlg+!R@(Fv!32 zUk3ycLw;tpo{ioC%gRftkcmv_^W>qSBP~ZsN=OjnGVU&lLpP9S#j-_%4Muwv6`rse zrYa~Oop~@h=xD!2ImJS^%^*SvUG|=H3s*|$R9~#vlTDj6_~qj!aOOe7^d|ic5Mv+F z{byB%q|=Ym{5c&1C?W+yyK)tRY*$+ao4 zF%bsJfiCey;elYm)-_qTk;|yufY*Bx@?TYPCJyhXEwj zOpdSSbW0)Hn#KG-RD@8YL*v?ZOWwUGRfOmn7&v954BG)%15DW^XJYK7yiJxPFR*}& zI7c;PE(A-gaIPjDk21UBIWJVzQNx870ctq5q}5}s(yRPOsRB;AFd>V6J6TZ5T8BAKo0!pN0)5#1bq|8DhnR*F z!HToQ&+M_;3^pJCujo*-nUw zWiQk5zy(glMal0&Gb{uye1VZgvi75{LkdRR;HpA`h8V`zWjTR$z;hEQU6R znX#|kAZjS?cy9EJB?*yY$B4t*jI%8`^mPn~mxmM0SNB{_es53(zb5&^N`6q=SfNrvcr&9>b<78CV zAmWb@MpTf`4+ze_!Ia^oP%W7n4mHGR{E{n)yt>F**{M{x8?kc z9Uk3R`d^aY?&uxvem<6pVsQQ!{BHgP1k($mrJ?GF0FlgkSxI*DgQ1V9?^@V*Pg=IH zar&&Z+mued8auKaB_KDHXc#*(DFLC(%*4sa)XXDXkZ)75Q^{F~P8RjX06V2hoJdIn zD-KB-{V=IJjFwfr;<8M_S4?=0Ny3cV)zQXN_J_wedy16`l_^sOt^&b|6_4tWZ$=b$ zb1-Jq#)=RqTUbXCuj%B`I6*(rLC>?A(8j;AB&2567xwv^D>Hx2q{e0*M4odbU>W_# zDLr)aiBT}7q^lyY^Inl*RkXQ)!yn9kk zbOR$RsHX+a8cH-=LQ3HNVrpFa{NlXiqJM^$6fwS)F*QC6_3(!_x-Aq(o2{HrR!$4k zcXm#=b7iqke(tjZVDY8ybqa4N=DeFvgqP5Ao!)$o-z$@rvbg!`wy4MnFcs~bhJ+9U z8eUzIFXPm00BzL*@AJ0?Rp=8PE~HZxMcf9E$bPHnn&0w)*W8lRGp0ZN>-BZs80!-?xT5wKAykJ z)*R6p;<1MCr~vcwslTkEXy`=vVS3*cPSd$2L+lby(k(wf?F2uToQ>xHc5p1iuvRxi z|5d9uAPSuNN~Nolz>=2VNZ_!vUUDV!OKdz}kfi^q4tAfD=sSLQ&KiyKAN6NFfoPUMRNDV;HuuxgqeptSUb^KeJBeqGamd8nns$ABf z3!g47VYDGpK!>x6#bK{KzzFh^*o7+@c$KknF-VKU1E2E^E%Yl027N-&IqlW|XJu^M zW8xdDtUL(&9jZ-Ud7DTP$CHCW9HxlQDG=6l^pXQwynOi)m6R{Yzn z^}Wk-n|Pu}6y>>|jH3od=x^r?%x)&2W_TCfKBv`f=DP;y8tXL>_rz%(ks;fk~yz;7Qe2GjLg?;#DI%t3f3>!4KfR&W#4bst|>h-sP@4(2>WlZV_ zPKMR~S$s~^qr*@1)c{nd!YaGE98D|9(5Tc?qCiw(QOy?E{kqtIJqX%hl$_HSvDxcc(Gc4LCks3M2i#X0^ldV_Y z2FDziimb(1$v#gGi{r)dk6>e3&d1{n8(dgP`ndBwIA?1nhLw>KJuit=fVqsDNd&5& zXv4RvyZ7y9BwC`pwlu{+>we3&5RujM((*Nz|5y(a6p&IkRq1^5ff|jb_BH16t?-0U<&UE%AvIt-;s%ZUo z9Po7eac#|a$o8d3E}D!d`1#ds!-bw(Q~o};#OH8W9|(_#c$s)8T}>&&{M>2b{X`U* z3C^Z-Yhen_o;qJ*Jw$kVmL@ze0|O6VgSX_hjV7_dv{@0E9t&!^4zTR4wrv>ZWe6z4 z|8;+U>%feOs6!B+PB{`H$Z>Akk3Eauk|8#Fz0Ei#Q7m;x@}G@gpt`3R7S=~qW)lGZ zqp;`gL79^US;WI|P$&zoCDnr#z8xv2G+^8GlHG5M?a?IyPzKd}U3i;pZ~G3LuhtkL z+EYIYXNndMS#H1nSOr=B!M`iBh!vjam*jk)>12tOf*TrMuMq}Q$$(77aD3Y7YOeb# zI>2m>^b>MJ4BTk-7WBuu&Ot&ddEPG%x;bxsr_kpqzqYnVzheH++EcfPJ!(ZWD+{ES zyHZIYbX@V9?IhG7z1SR@5|Uy#K%44Wq2VCge^Q1cI?*vPiXUq}%I&cgpa8)&58s{w z7y2KvfMt915r+Z^+X0WL(eGh{|MCI4@oV{zgdGi|;uoJ6hiwRlr_Dn3-1LHLi{8}j z@#=xaWs*)m18=cAfFtY+g#KE~>s4}Vx#gWRy=*wBG#79qexvv922O&dZ~H4O4h0Qf zbHx@y6skRj4h%=~A#;&soN4_1SW<2Bv*B@V`IyueY!y6b%z2rD%wlMxUyr?bEHw+$ zb^-VAgI+s>bq-PMvZ1Q*K|!+E{My{N{E#6wEW`3}fAf>liBS-sCgEe{XxEBljfP`Y z(vaY+=YGJ4TD%0!C#Q~Z0nwg)?uZ2~4x6(yw| zIneI0^C6afofCO%Kvp>sT`_tV8 z$h&iQDLva@@RbIGiuZNr%r6^8B^yEF0|{XL_jV`ecz+*m4T5EBz6OkdW$)F`Xcjiq ziN(dmsVQBu^fk65hwl4GYRKyCv)}kcguq5`q~g>kR=|tkuY=E7QRM}Zy!QP=mYqxuGJCjgBj3x_{0)0Y(~nbxb>hxB!;ZH{XBCobuMZK*rPM zXY;DM_ndg0>I_48^roa=AOhTcrhcDjr%8brsfVe*M@m!72&mN6r|aq@pOqj{#PNsg zR$zNPrvnT@FmY{0N3R?Mc_{#B!`fe4q4dlTt#j2fn2|`k@X3^~#GmRL9-{I9J{%GP z0b({v?dH#rfx6uX*uyeJl)cV8ik=ew)bJ#vKi3;<6@@1-w0EvDr{ z!;arRPVv-US65eHGHePRV=ImZP-Px?K+t_#Ptn}#c-8LR6R+ZBjrZaknJ(C9WjJ7c z6|KlLp%&Krkfk%3I`ZIZzoXs2V|=L;E8<=Anev4^?@xy?FSc4Ax8q@74qc!;8m_(% z#MKZKpu4KFyHo|d3knKyku%d}rTHJmgUwdXO~n)~2iJx{AyR8Ghf5New%{k)Ty@aP0Np`7T8N=1r}U!W;vqSt>W0TEnx$Yl!OuMIk6!t# zl1w^thpsB4{PX{~0cOUs{2R*h7&cZm`M!;FcyYeAD>sBaj{gH^(#f_~NAI=)^A~vN zWSjSQ0)CnU^jkQYKj{}qTO$$zc61#6yg1mXAvr59nTm!W|6^4K11=WR+4sN67R6wQ zl?OPulh4yjL&=SXVPQj&)%5mL#iIvvFB2o}ad0E4KRd>f4>LKrx{lg;ay@Ia8_j4v zZa0|^-SfIDSL2t?q(-Yg9RMVP$Z&pw{6iqycMpAZ!fXH{ka?Nh{Zh|+?;cdn>a_2Ic@`ND!?Q95p2{9)tF=tFk8oXv_V5 z5f#=ahzCw1Ys*H_qf_kZje;vmEy$w$?suF9TQ)c^nlpdt^>6#{oN`*7bD6q$@|GG}`RceMVi z&;CP8kthMM6$cN6$9MH=eeha1S_&AK_!r&Ma%ZcS>eymOg8@2ZQO(Fuvq&)IhI*{w zVzCjheqsc8^*XQ-g0L;I0|vG(H{08HV8{1BqDb_S^#|iu-ATr15-56sUbN^(-@LBx zisy&H5S2m<2;$W0$;7BMp4X9zC+viL=#w0riwRe;o_WdF|HBnh0bcfL)YCT=d9SH0`CKEXx{?#D%i$JiCVYR*s{uba+|> zKXu~rw_Sjp;hnk4S{Ib@>82g%EKM0>1r2flVNp>fl&<2seMnoahjoC`fJx;~n$FCI zS#oYeLPA2+|7u+hj$Q_of8z#CESLdM5k`9p7>t`Lim<3*lzsP!z(m8962+9~xQKo$ zq;ifux)?%TabMA(kqdH@Eij4@#80Pich=fea2lXPU_)7;9Q;PxnY7_~pfW5YU(+s5 z(F$l&uYCFJ=894R^50P2=Vd8TBQsotv$TAmN$t(Or4WMr>wCh-$HpV>Lty{asYmlo zMSPb5psC8yJ_n-%l&)O9G5T#~VE^oA4-*`Pn7VhN15Qp(?I&UU73SbSaJ1BliHVt< zOH`ycB|JmAI+2Gey6n3Fo;H%;Sjc1SGw+u$qLxZ-w>WtD!QJ2>79u1hgyCUVNuf2E zYrIelgx2(k-9?1(WLQ4LCgRVa0fh>)gw?QSNpduCQ8z1oqxXN*zBaxmWCKhCms+JC z_d4*WM?XmdmKoJAk)g6c%b2mTag-l6X!~<+m$5xK7@6?g_7$qHIeMh}?dHghGCID? zCMO}|;WI7wAA**213I=z9;#g&x+z~x$crN|?WV9QqUVHS+7U2Sre98IB}77v9(-X3 zcjGV5yC)`2GK<6G$ng}qyWFv4IEe%_J_{@fBsrE*t&!crb=a6ylH*uAISYov87zc3 zp=a?fD9r!$N({6St7}gXCvcI)hUS?~xAW-CLZfV*tjVhsmUSG?rrYe7JeSb54i2~1Vr3#oL$ifZU3=qfYkBechZP-jonw0{=x z_fz)r^2^riY^MVTu*Mfcg!lIc|LgB~I^20hm|I-D-CUA=1;PWWgHcnOv??4BuR~BR zBsMt*0{&*l!ET-li`UD(J%;UP_&%nn)9XO;BnpYmp?x|_yb+TQQIlS zFI#<3B9T3yX(qaB7*TCut4mFm!QRssOPO(x99-aK&)JUjPbKm?^Pr_asSNvPH=Ky^ z;9IA?c)5Tn;KNhvKvT8b-G2+g{}u)ySdEYOY8lUd2D1RLG+U$jXneq6fBhF<@aAt0 z;C@tkc~CruQL9ir7&@1+Ygs(rGpELky3-_`PIcMQA&im{=y%=)5DLz zox8vGA8HEkjR)XQ$Ia!Pk2z!Tg%J=@=0*dtAAKt)e)*66wfj;}FSLvi_9 zu9pKOB_#9|B3fk1F&N2k>Khxmtsm4Z?j|1}{&idw@k4yC=I!+-Ehld|=}pY$tX*IA zv6{LWO)ZX^(F19A(@2yuZ6X<|MOSVcYVx2N2f=hWPN-?yS@_ydQ?>&2$$ldDXq_A)7Bk5CmiJb zWW0qZLtQ03SoR{N=LvixM#NrV0*Hf~fA1N@ymDF6M-24zre|kS9Gsma`?yf@w5KxJ z70YbX^4zsWg@;QOc#HRY8iLs&~{c66-2Q6bw28?0AvB- zVDqAR!6 zGK}u6)LIlqu;VVu+Ha%^mb4HjZHdaiNpfj`i9@l~} z@Le@#XIt~^@DzpcoCy$_;_}naf-!AU&q|<5s1pgQdQy*z zU9C@mC8hJqb@Ke7&RZS*r962|uzS{jbfVcLWkIJ3e?!$DbiIVR3RX|Qe}Zp9AGsk= z?P4|_Du%$75~5!%|SA~5QLXePQC!Q%9A;!pC?GM$zqf}`4; zHm_644vKB5!)2-PjVbcv!5~lS@I0LiHw<|!TXpMbn((o-;yoHRG{%fP9T?RVRS_~o z6_(bYMwXB?W<2+!=CP}MhHof>2}-}=tE)N_Zk0v5qB#PO<=`x%9we?O_k}X~RPeV_$a?vEHdfr6Z2(rn)VZH?&<*eGA zCVq$xLph)HtLvx%0|7naPjveS7`X@j66tg|cXJRP^J@3`1clRhGz5#8(w*YJq_LN4 zkNSpYzgxV9S}>ns#6@!)1zgRBsTr0(UwJpAZ*KMQFhm0wPslU8%LFD$NMlmbtK9#x z@(P(!zg@0z5k+h|fIh)~BXp3}|2+D=hU5UOsX*!o3kbq&bhi`gMCsCV0ENG_c2n=?x+_SbClXQjsxf4eR1*aqd~(eY={_F-ktcB z=nKdyGq2Qba)uuuyzZV(QTWF_0=N(O<{zmC&(~|22Il99NlZ@FRjLP11l|}94 z2E03n1Fj(`pe`gh$x~6M(&p=kf{eJdowFdcoVx<6?9jVmE+Dk?O2L?o2Fp9aaTEt~ zg5*|cHw5m>{$-5+h=yd*^X~4EVNBa`{I%YzU?NEy&Hn%J<^Ab;njlcCEyk@T&!#3K zc1|3`gjAhKwQ^wf=E)I3#gPz-N|obeODfM$&!-91bij4WU@zEkLSp}(W{h_Habi%T z6I*!@y_cbgln)t+J+;S$Thhm<;U!h3vchq4{=qj#9XJa#u=tQkFjb>zp=88r=C^KL zsBN}i0_7jQ0ae>bxosg-xK6a@dW&Yqw(fpnKC&9As|YEN4hOW0zw{=y4*|&Tyz<;+ zPiH_2bcmYD^yjcg_5Gh7;sSTPzWxVFX>`AN;L+_Re|xp1CO6`%Ym4LDY?giqhRF8Q z{d!IE+LcSkJvZ=+@5$$js%|lWg;tUsImi(m$$3`M9n$=C`ek9gpa)p?+`yN97#c@c zL2cTcoN9CpehhA>MLQ`Qzek@^IJn0EI$F*R6EOd5S3aX#!dm^9({y?y`9cl}(N2K~ zccB8N!37eEfc2fBU;uE>+F4nicJ6A$7deZPOTRq+RAhf}7mO;d-CnXQnotI(L;+|{Srd)P0Zj-O zENuTZGjWP}4Q;lDx2i@mgb|5l;X{mGeRJ_G@|dfbA}ne0w+zI6RFrD91W+!<`N*ld z7pU~6zhvKfhv!3kkfneSAAJcW#)bXqYp0}2$BMh))YSi#ARu<`=C1AqEZ%9ZHo=pVwP5b&@#AJSU9 z|2M!8d>20enHCjsm1?>soeMJfLjBq*r=j5>+

(b(O!7u)_BQ=B?eoup!i4S3^Ii z8c_fv7S8P|e81*Z0K3koyT+&5Z}ymE^X#NeyS3zil|J#_0AGvE)_iI`%I=}}n7=Nm z5`~PMXQYF==u05@arxX#tIBx-xLHI+qkINr^SAQ)n+|#47Cw{kWqoU3esBOx z8;W+#1r}Cs1bY1vO79D`gX3e??=&4`!Q`aWYEsD=LKidyKew%B8p5* zYr^x-Hh^*tYBzV}IZaCX)y29PM2zbQKzL>g+_&*m?d-->$^%kE&C_X>pgUN@@xQ3Z zL8_fl-|{|MJ6B^Ve1jJTmD2x})Fw$3$Yy2DYL_iXjj;YDt-sjvCbvE4_#dpYp#>Q* zMb!omPV!I)sf+}%RuQ~K38HN_rOu*Fj2hSADfdae-viQX6%SfQy!tny3vi~Iyl@>< z_1{jnM|s`gJfAGW#Isb=AL!V79})Y+NQ(_A)$~SM)qiq82eJlAGBJtKapGjUOsz{J z`~J?pVB42gE~WjVhf-PwddK*(QGijOzd8kMU%W+q?QIvf!<;?uf>925F*v$anEYPy zCPKKBYzvQb2mo|W$EMXyen$z6h_%1Dl|mLbK-0)UVmXW&%GR~%NZq%E688?y!h)J1 z3<a|e8=M$1WTJXJAeMnaL-^P=A;I4_%j zc-;-1r)v6&Iy*Vqljyj7{5`d!M+_UDeiAfa;e7i5LKiA>^AOIBSd7Y&=?f@h*cb%M zeZ}MNqg1Q&P-vJcy5Ot-_}Sv8(TK3n!`DxTG{|ARr(p-5@F5 zohnM#0i;1hKtw>gLy&HePU#NmzLWpG@4G&nhofxw-fR74jWOn&7?f8R2bbM$0umbyp&{)YuR!*hlz{94gYz z-Ku}vkHjypuM!Nr7y}e_e71_l7*?(tZx$6Y&T8F7_V?HjnJ-ysu$7RJmTZ*w_9D~B zs%>}!a`;47_c48z`VqAM!CYaQ8PP0+*a7C))tI~AB4k(>Cr9@sHT;d)5vu5jJs+w> z*aVz0kYr((yaFRlh!As^EBv@2zX=-l?n7gut#`ZdY-Y!1>H+XC%NF7nNgLtEFv;>7 z7FTbtuOm6kxQ<5;%{7yCV%>|&27?UG~8b9Selm;(gS@mW(V9a;{Q;SgLNC`3KfB*dc&IIg|1-&toS zo%0+f>PB4J&3zJXIBN7i&g@4LxaqQ|s&&qy%-a}kBoPa+$aod<{J%5zGJ>7-b@8->)?8VEuExjqOd!41UHPNs+j}o)F zZANrjuph`=wAvKN`F zh|9GHC)i!~J}2IwG#qQ`uRFzh+WH|O6=S}C)_->pHSD3?!(sVq8P-Hf${f_&S(sZS$3-%UBx~6+U-#biy1UMAQW~OEY zi0bki2+n>BxEWQ;pL9zmSfHExI?V7=lIXngtk>SI{%G`e6zl!lRjYKdo!e8Dch|PJ zM|dJEa|e)KieymVWP^o+Dq`fj`bIdp=Tgi;zc_^i2O)Gud{31)!dAWT-w!i96tRDI z`R!d`T>1k_!m^=AydU9+aW1RIlZ@-i7Dt3BO8vU9xbBJg4a$5;iujs3AHP8?|F6p5 zu6A0&L0pKw`kfp*`lAqCiUFF3O`5Yep6Lo0E3^R#i`P*GYx8<{v<~0)H;#`9?>Zaa zANWFqHH&F@$q?{fdjmBi<*|gDl``8mYh+=n2cLr}L>k)(oOE~BB--%r>zCI2zRwEI1CHVh@6{KblK8N!^ems|k)%?xs54t3hj8^>hztI9j6Pc3Ki$|_jH-mqv zB2+jYwd2^lY~#Cs4_o>rBEewTqg9u{tmHYEYH09==`_;b+myn6{gcZurMnIzt_QZd z2WJcc>^I$pD%`AB4wEE^=nhv_t;xh#U&Nhry}U|8M_-ZviD$G4KZ@&V5D)o?sUun@ z9wK`GA;x#!7?7ipCO#Dx!wg z=;ZZ)6y_5g)MuHm!+j64DAboL8ZVdGedjbAq>GED^Q0`fw=P@F6nmGZ=0M8~RMWz} zI66kON3A1Np))+9{s!{W(#WV70Xn0>${Vi8ls5NN_j{gXoTDLDxML{SC9ydQP&8;u ziI5QwhV0a$#?#Ai1rgf9v3yxb*@2(Bcb-f;-9ykM@yLxUqaz-?NIou?=RgRWhCF`} zg+LK{+s8;JSj6-rZCpjXEO+YoO!dJ-9luizW}pL;$3 zusRthhmb^*NlGnd_6S*4*&0I+P}#`+mRTmut1oZywb6P@wJkE;$>-HiI>A-)ZOwWr zMVbfwuVH?a!v~2WBgFg!b`zf>f}h!6u2gu{G8^k+=&K0-4* zSnnm~62i1pt>h^(8YK;-blZ?GV)_UPs}rRJ5%>wYf9m%=NhjHfUy_lm!G_cvMQaym z$vLQ0f3CZ79(=~Rv+h!(MVCKXs#VZUsCw}&Q!eBpQ|IV8BT=VnHcCvO#NOhTV?G*E zTU#!|Nc%fg!so}&R)eB_(BxiJA2PUFqwH{_E#Zp2Lqn5#5KTr#?t)g~N`3b+8hvz} zN>@0s^X2wn`c~|{m*~ds-TT=zN<#6CSHV3hxeiocJ1W^+Y$=+eT@Z3a(Mp;1JSju3 zsvQij_F3nT8(w8}x1XGll0JWq8e2U1^U0G)TCUDTlHzbKB|=v0mH{pG0Tx?hIaEsu zr4OtJd#^+ba({j8@0kt-oa6=G(`>C-(PYktS=^2fTRs^ZJfnlSyi)KZpH~HuN0PM+xE;@be%KAkTrXSYoNTXP& zOfh%MSL#D-J}p+Yvn;A*-Nw-KX9@~o3pvbT&Y#jc%zvw?XAXxOs!bC}u6^C_%dovm z8C_zl`AXp%N3IBda>*H@>$%-R&?k}isd;WX4fix>F`mi2L(jgHs$bZAcTP`WdQakh zl0srp^D&G+hZcsFNwY}=+o}VHgK9_;lZ~c7)n{YGySNojsf8pii2bYfLqMn^IJk!J|nr%xJ$$cJyH@)Z!TP$?>C{nppZ_7f2Tt1N!7l1RP%JZhP7u zsZ-%1vRvwrltub@rK`!@#E=WBvZ%}a1NcWFWL7tU?YZvg?XdX6f^dz3S*l z_H&$x7c=iSF)@|i{C*YsEzkEf{QhfIO)<pGELAx3YEBdbmQZAEBY!=+dJYX zLfIutR_A)>D#zhD8Pjw1CY0cjqqtGj+VYSX(Qgv|r&mue{w(w_Dxv5*s&?swr}yr+ z?pBG(S<&e68H(K(%jV8%jD$}TSgp?U(Id6*fAgiiO7b>j8rzQNWL#;xv#U2zQBhsP z^rr9nTil{(aqgz(ln__?X&A5boa=crs_>=x@LNN>Z64m5A8c;RUp}h8;KjE7_=$i- z_<`SbSEf`}ER$WQS^1!QL3(3N-jKlYP|n}*tKSXj4^Bvlx?bQM`)w|KOkvmKe7#uX zJ9Bfk#fC9Sh?=TF;XUoG{W0=7!$x2{Ep;cK=5sNBf4=YPhUcR}O7pkJf0sR8PFPBG&@)=I5q%UvU+J1l*EaZ~P0Zo^ow{=*>y(DHYlqj^50_J#vD+!5g76`zCKoeZaXpcUJ{j+H zrA@Bh#`pn0ktf$Rl*+8SZ_5=8CYFC-kllw;o;QH~YqW|5kIkEde3}GS8RiypsPdk-$VBy0yuT!}HeZ z|YW%~@K&pKBACJ`PJuv?u=OPO^HOcaMV)@5$AsTYXPI;^b;riA+)e_1Bz z5l{c`E4PkSqtkM-zmJQv8~)=gE+yVF`}(6Et)_VsiB~AGY<+R`&C4z>rzUA9oZIZ} z?8{$uBkeC$g_;M2J0@lrOhaYSRYd|zr-M!W$(2kQa}0GAYgyXQwPhP!4{xHx+=eVW zI@#JCjm{M~dP|g@B4|l7ro_gG3LX;1BfTe8`1pS; zdi+RD>tkMNqS>F1J(#J*^X2K@MD|+KKdtPn%{;!lS2GM+Gky#uy*lD=!_WfL$Jbp!3}uXJSaJ?4HnqTiZU1J~RHV0;9g6OZ%{1mvLPHc26Ek zkYbu*4)ar#Lj75K4hSxk}Xy8=VC^JRa40f*`_KP+wVLdv6JoiS6FMMzacCO$Ca!`{`^1S zDk7@pXZcS$_+D(^L+p0RcnPoeCc+FhpU3Yb%eppId3kn!wKvl%;!pR@b2i#-S~KcG zHnJ?^#2+QhLx0emGpk3$$NQ*Bs#Yj2qR%2zb2OpHT+iS7WN-G`WAxzryV1!{$*@6S zE!J_f-#Y)IWp*c(-)=lz`h1RJPKB%ld8qoAOCOSgaJrK!9qmI@D(e+BgNmQ~?>cF{ zlv7lF{j1Q9#>@+KPw;1dBb7+LUPVf#SokC$ixZpUqy;rU7<$> zd(3|JHm_#8 zdTREF>Ey|TjBC9i%;b1O&c)P)%tU$at&-oksB5nIua}{M$a-VAJQ)hw}daW4^cZg^Ih^pZ7B>d4-^x(F#!cNPno8ZzPimU`Eq6FbuQ68hucA88wUx+qA|VhxmIrdK1H`uWI7`-Et; zg*VT0+Ez3^cDpv2rBX6HH4|{)Y57gCuu6g{;`e#CN+t~@DvVY3W4iEkW1hVWt#CE( z<>BAAypQxX*-|?6IeD0rs_Mi0TWv`&FS~V>#@a~M;s&f@d)E*sjJ8ol;sX~=vpX^2 zX+qzH-2NP=ZxZU1R&H)AJHs>qvCqrTTyu}qUpRAnvgPgO zQfT)>>!mK|U)EUcFnQgjAit@SPg!Z-T3R|Y>_s?6Cbr4s=W6~oX%^}T|K+0$)T{h) z=H0(5{Hv9HQTnCZ|BZyRC_i~dRj{W;Ii$Sj-j<0*S0M4o+);mekh1A!Dk8ppIuoKe zd4#kU&e!+#v4IQ`_ZMDc)#VWnK=|9`Oa;VV{bOUDf{y)!i1vHXI>L9=RhLwv94$#Ge;9wJ-^2L?r} ztDBGw#`;YYdi`s%j+0))on#N*{yF68g^h<=U)8>njo|bLVC0*qMW8 z&2G6ABI~Ey`-f*B&c;GT{uiC{Q{Ix6Yn2jQpC#Z6Zv=TiS!?scWbafUzfHV zBQq1zCl*2S$m@v$UW>|6n;mkZzVWGZ8TTXl^T>K!2O_i7$31xuDfDYLPV1a$U7f^( zRfMvV8@Dfr+;JXA^nKxQmyv7A_#vU)W9%T0LX%j0q%?T|>q4@~0*KT}UE9n}vLEHz zwi65sARgiUT6?vVO23quxfK4sR_r8jpk4F*AKAMH`OO!yU1o?PqR3$+2hx*t@0*{F zEi!W_U1AbM!&36k8B?Z4D_r)!OmqkUK%BwCklkr&Wol|V_~pLK=v5<~(RL~m0=Dxl zhb2$S4%J>PUIeL{DSr;vBxFDafut@vYgA}H7?woJe7uA(;l2a^9vjZljh)ES#m{L&CJ63nZT6Clb z$auwzZ zqpYf2qsQyvuXZ8uVf`ZFB2LOn8W0Gz zGUL!8D+!2A#b7cy7BGL%RFPKe=iQ(4qUg75(AT)|_+alpT4K z8}htJdtgAxzEHFQiIIwq*#cppK$>!vUb67*DR9NTjHPp*Vvvh*z($!*ccsPjdos_-I6{PJ(zK_BcAU3^BM zucoby3Z0kkZf<=U;&Ubc>PEl{Dk>|BbjqQNsG_mae|NTCA%U$RKOcr{rSREW+1TjS zc{n;=@!QY-sQ9Xq2V}cvdZov{@i5QH&djDj-@E(hAUr{!Q1RK%Dl+Pqn!m8O--YoQ zFwgbJ4;x!sQJ+%>fB&1VcxI{0mzuZN80hDXi^uoVmno3=$cc8In?fmi0;Q-$OmarR z_s`k{d`v9X_>VqxGnfb|;_bcWR^KG=r%#h}vAirs3hg&2JKU-`UnJc=#a}i}TS1kX zSaKl=QsN65AmCb#>%L>CK-!X(*u4z?ZYBl2_~tgQhES&T&U)|GM=rieMy8CHN2P*K z3@u_szH_jcRi$e|cSC}48T4hlRf`x$8cgy3-5;;$6;#e0{ysl`Q0F4V-b@+zk|aCs z7FEWejP0zlGq~I5m};C<3yK|FPLy%T~k7)*9E%m7XM%sftAb_i0C2>X@p3UCbGN z=awxTc2$2rZftA>k$ZhBER0lv0sdK*$yf`;?d0BP%L%uvh^jnDBl&E`B~Y|W%_BBz zVEgy(?WkEGXx72Zz2V6ancU8Shqt^X%xovi7*l!+^{Pv1Yip~ktMl`%m%HMDL7OW! zX*Y=yT@mO@nLW$_g#+RN2C2v8etYS}R`UmRkUALp?6*!%P6D4SdOH6eNN{`asi_^% zq=69Gh~qRS%4Z3lwXn-twCxm31-jTOjS@Rwo3O~Zs;I1g1hau|k=={)^I1@rFb$ub zZx-2GS)IdC73bpOa^IN-@0XmM49nE8o8a26oFhm3Aa?o-b7#ERxUUT6D4LRbN>F;)|()K%H9;pR;za2I8XP#K4XXenn8>CRN1US_}(XQDrbvL zf_5)%S%RzjUEf_e{u?_x4QDGU6kcnYGqvvQdR16WykmN*hK4twp)0Md9CJ(sKbBuu z!$ch6=H>=6PCXbTGBPq^HLjkokp>?I?xzJ)e9h@XSOUA@b=t0v#o52*sY-i$YwOyD zP-eg5(u@M#%0f{7e}tVrvnLJw930^BPITt3bMI;Q&v8d5F85)p+J_^v$`~VMQQ<5} z#(CdO*l!Px?O+wH&-?f9No=m-aAd;4nq5o`3#pp8mdxe zxy{QTR^L#FW!D4cJ&ia#`;Q~v({%2{ajzF2Fumu8v8$dYM~vw|Q!N+6g%!oCQvYd5 zT2aRyZg0FW_ure|srlJz@rU!7BP~iu;ozT!7@LW6e_PJdyV0HI{?4m2x|O!9x;L?s zM552EwURnEG9*#j61no|wfY&xdqWuwM5N`{VbK_&iu~M3*5DhVH1qJhET6gDIGs=N zO1UFqt(M*N6oyf(l z>pKw9A48>T*d@qnEPYEI?XyHfQEclC(b?A4cB2lI(&|0JX-YwoR4{k|sc_T4xtF)` zYTN#n%}jM2)&6BP;5s8gIWRifMp$a=4N(kU2WAOgEHK(bge@CRsXnB0%F6w)HCw&6 zDM;)v6B0zsDAD7@!cECwSiLs-=Z`dX3=GcK`Q&gt|sO*n&i&Z%##$gt7p>|dI&JDYCB*5R=7&0v%t4-7+3Pfyok$$2*%Hw3|gpO+65fUgEtfl7US19-xF9dj($<#ug{uCQ8j~x; z8|XP^GOni{&Q};78d3q(-w;iFe0=&UCv1mk^;S>&;PlqZ+ne8J946dZCL5kM6ZpX- ztSnyd@V6N}$LrZT&rfEs$mi5ZrAv$D zQ?EIm?Rw(Q5I+uej^BP=O>23v=SWO0=8^wi&;6pK@GcLUmV|L(fe^{Mr+Lq+SPk7r zGRmno4_C5SJxEFAeU3tGv#Qs}H?-Ti=hi|$#U}enhSuNBO7ZSC|4Z@2{FJrFl*|2k zWe2+X=oV;HwQpn(KGM&~)-&+>)7Oa!(dkRCr)QJoT4*XKZVzUjJkQOv)XBr<7JdAD zu^F8m&Xd1KFYnmacyU%i!K2$&C-K8fOjtT`WvHr(n_X5|Xa~%EU^Muw@`?)Z4@)p+ zPg(42={6`#L4tZ?vHN{7tES`zVyIYbNG%B`t%O6+!jPmT`ZM_%Tlc9Qx7r!E@`}ca zTG!kvJoicjYM{ilK7CU7MIAWhkCp)vmI_nxXMU%F{3kQ+bMYtUebuX}yRYw9dwQP1 z!4-%UhO;(Wpeq=uTjv4eUl%bc#OmC(bs`rNAGE&56ibYY`|XoMz-}O7)D+Oy*9U6Z zKW}(KrN2C&@WE<=l$R76d%x)}CQS1`fmfsBv&cPveg-R6&HK~SqN86L8a9Gv5YkbG z_^zR$p%*E9xBV?JPZYW&)1cym5jdbJy@Do~oUdPdAhU+7EIT_JF*H0(ub6ndc@wq* z5a8o~N=Q&n6>x;*J`m&#%idu3A3!)g`hZT*z-?MVpD2M(PR@oOCVqWtQaMFNLgIb6 z_Uf4B2^}3dIM~h60x>Z$Fn;0)85Vp3JiJ%(uGl6%cp6tYIFvc7!rNVm{!j2i+oeu}l_=I!B8C6k5v@S$3s8edB9x(nTtC%im7 z;e?!$O!3KzIby!&&=GBZb$;Yjt%r3lw)3~7TuXEF4-MwcpEGv5TU(GrXRE*~IF!Be z)VyF^1*b_{u=JOXj*iRA%g$JOe@G8dQBnC)3aYEmAS_=%u)llf&VT>?_d~RRT;des;^Ha2ZDpSa243b4 zSHl55K0XczK!DckbqjLkRPVuMGOsl;uF3#=Mmns+=8|%FBhcTghq|$z_xw*Nh@p{sT;~|;Q|2z0l%Xfcb?e6G6>_M84 z)Vl(a{`2S0P>Jglj6$5et=AxLf{YtnH;qgJ3*(P{BgtGRwIY#;`p9@TW;X$?DjrT$BEIQ z`xN%fz^o}O1yk}euKp*Y^S4h`R9)NrY4(Nt6QAWFIq{K^D_v@6^lPD2{{b!}t6U_0c2s z{1NJy;B6xBiX>6*&Oog6)d_Vd{Fj}Io#@=Sk;WFEJC)OP;k^nMJ-X*++fQCnzmZ;P z{=jA|6}#i7lUvu~)zHL*wyG*bR(LMb)MrYS_)oF!+_`fO*&qZEI6N>Fr41QUC1L^s zegGQY|H8t-aoU^z1*Z#~GR#%$OXSS@_H7NyS*!9Iy3|em*rd6^3`iqqi_M#gdF96*R7d-$%i~ z04w9j=Aop7hJ)kvVHjw23zqaGaw=je%E`TX^G3j9?{h|mp^wicWJu#_NR%GlW0_>a}mbhR^l z8+!aO5@KSRNK$Prtu+@Ra3|w5x1bUJQ(>q`;jN(5g7<_P)D8H*voly6o1_S!h#Hf+ zxw*N6gM*XPzZOh!Qha4cre25?-T^xX0iYNp{~ov3X+h;IF+M(@MPKUIuU`SEDF5VaFvmzk13&h9f))0n zxCo`S{3QhVCsQiuBSb9tWRd^7e*9p;WW_<>2o4QR7IOXGYMjJp3+=tc0f1Pb=k-2EsTUT|@qAc}VkQ`2mv|b)<)he|=TR z&ssf8X$+;vmA zS3PM{0jVD3d8xwgk)DfsjbgaW+}zwrlP#CFiPy2IsXclE^78VDR8G~cAeq(3N2Ri>6lP@1gPfKHKlkfb=v9YV<_wQRk?tZR2G(5yv2us=RPxlA z@P=Xje+>(M*oc*xpDZ})!o0kRDo2`jN2~J5v9XiiA-L=7>pk(3Sod#cc~43F&KgcCnC6Q34ee)myS~a?xZm zj!IYnOu)s z4<8=7Af7&bx#-Xa>FpJ+fDQYaFv!r1I-;pWcRMybnutvciUTxP$avli zP%6(MdNRZ_$R3i55K6!?3uy4YfLoRj4@S?TR~1dhohb-CFX{&;Cl+ZZ4>Mdt((VIz zDtfR;wRW$`ar*1?*l|Z28=L;8p5{@koXm$thiilB>X2N(weRwu?bOMSi31vRdGp~C zqhIgRb0OA)z}Bt5Jp`BDD^eEH2jkx;ZX%`~Sp9)Fm6FZQPMr2m)8C@Xhgm)1kn(~t zPh#qS9;8b4JjgeVicq}DmR)T17ZK`p3u|#Lzk{_v(-<>dFV4*HDE5T9rEIMiUVc$X zshJ>QPf4@u&*!31+q!-jZ%BvTDg8wvduz^)x4w$=un<8QkyF0O_ZT04%~j`+?rO@W zVrgj!jNJPkHUcB){TY)UHpzx#qy@$rxw4BBYI=lE6rz`SOFP#>&?^x|#QQS+Sk&z! zv)62F!i@8Lb*iUM>9{nVJ7jDA|2pX*z?0)27*L@|+S##9sfv64``RA$4OSuL4o47i zuPk-OlD~VrLf`w_I-wg1W#}*BGwp~5P|iE&-Pv;Oj2)j$LU*=G-Z)Q5X7!96WG!{l zckbTB#l`JU6_jG!9?p%D$=cuFf3BclZEIVu#X=Wr3GU9!%nbg}xHysMfuxjFlEO)e zS@-1B6hK`LfLL-C;jLUeWqgE*d2(>j4HwK5c=+%~QISO{l;;yRc9xbzoW_9$MHaSP zOv*V%dm{d-9lKEYh3$qpN2C>BGvx)_|MB0Iu&C|UpE5IV&!ZBfNMkzCxm$M{^JXk1 z!YwF6aynPIVOpy*>xNHEYVLm*Zguj}cj&WnR7K3k%dO<=HntB0#pC`n(MQkX+>qHa0d0 z+{S^+^-KuSG#@V^l%vb;iX?A!gh-^&!?`@f&+dtOkpw*jBqN~^HKs>sX!6gW6N&kF z0N9Wr=6eek-dr@^fVW7HFFLbxCe0mu1H(*IR8=R)v=`lKuX>WWwY9Ys<;{nR+h-h=8u41fXp*aKD&GQdqDvipjm*TpC7Kb)HT7gbp{vp z`}gm{!a|sV2V=$C`}?CJ>dVRw0njDlG7VPB4TCE<7(&1g;A$i#C11RV$i2Y{p#{$c zERk_>RdMm)wi}cTob2pToc2~c$?%WmyCRC^{!ETGSf9*pwugHBZM_jdp`weOV6Eyr z=}$Q92#!t^Ou&#i$&Mj7R_Nd9y~<0>cmoIjs1Ab z#cww*KGN3veeF0B&3JJx+TEy`qOLPMVj(qxR(s)vu`_6;Eg8`N<#=>9O8ObS@YFU`iDB45y`KOSnR|K+pQy91CrP@_9gQ&)6y;hs&=|*cw@ztV#kl6rO6G6hyreEXoZ>bZo+nqmo zs*p2G&(8XlH_*OhikFjo_kPCCzAT!+Ko6I+{W&ep`(Jx4KQ=@yMH@Tvq29@k4i-4>2@`0> zrd|+;qw=V{PD1KVVK_7V6PR&|S+^bO;Rg zXm%#`w|t7UW{WZQ$VPFGbe&*DGmF=n#jR3;Y|fv(C2aFOp$!Jby4ixqt5==iM!pQY z8f=gDS1|(q`h2Cg&aC?rgw|5SA5c`m)D1>kJ3Dim__(2_CW&$#RuoB?_L0p)MfH>x z$Fh79YJ$xN;at6MRl26l{VoNP%pe)jg0^HAA(^Qm>lejZHpN<`80}@2!@!alNOr*4 zoAtlBN)PQd#NUiGqmpRQ#^~; zFROAG!_j`EHYM zETrIR9X(U}FuU_dn-o8{wAXY@r=jKO-D=0zrQlo{-(8LXor3jFR*SmEAp?(jdb-^n zGNP{=Gqp0G%jC22ce%$*Ta*d1Rlk*BTY2xh^pvR@KFa5~;^RvEKWyTf zz8@rRj<={ff7KI`^U_(z%h;C)E00<_rPR!~_O|f83n+?t*=ARXNhTEc{H8sM!m!a# z6gMneWgYN*ay-0N$7uko#tQYBR zsJ;U^1Jsf%EQ;_{d3gbkzw%hXNa)7H$3GrYV29)v%3#1~AK-*6ZEyl93Ef3zkeIiVZ(R# zr%pl7b|_Z!%76_YNrX(>oPFh#V5Es;WA0tM%Gxhq-bIAH+SO&jH>Y>3oxuo_qQwDE z8o8*)mH>HpTM*R#_!&(eeA*YYKG+5x`}TK~L+6$)@)yYZ+)8_m-Pdg+=~|Q(?H5{a zL|l|=sEhth6#IIMc4PlXx{yJ-;D064{DogRe$ zFi>_3Jd8luBEddQi+C7`CZsi?=fP-`s$J@KixQJqZ3uX&POB)-O{H@JR5>nEw-Q9j1 zg%5#&w}9O6+g$n|k>K8RU=r&~Bcsp2Ep#tKy~7kAYW5Tj1?45f<3KF%n}mc6_+d%) z)J#mFdCpAnUG42b+Jq2JB{TO}shQ>quLRPlj zoi1)0lF6rlkA7TMIqf?a&6Ug_5h4{Y=>IsiZGLSzhaR5Mb(A&aIm=T9@|dzRy-gcn zHi7&oZ<{^HYWZuluYiE#Xt9!}w2GHMaKOU7Q=H>P?rrxg*m#0bImc94Q21KV;$QlY z-|aFv4P1iUyuaOzOy?6%qZ=~)Vj48h*={O_lRWlIscSWyzkEMyFZ=u{MD^Vtgr9^& zcSKgphJeb57i*F42kFP37P9L01KbwVYvz*MTwfC2QCS6wD8eBeE0z9$qv*wjg5_iZ|a&Eb{zx&76(%G zRpcTdZdGR8_?1(lCT-yWmY}`+>2*13q-{Qe96u280sPrg80KDJ>H$W0RhK<^4TQ(b|RktmTnU&EUbaa$#Y;T z#SRCg!pHo9<%e`Dw$t<-WykVAU{8g3c+`r<8V~w}^YZc(KCwUsO5uOG4|oG0UY4a3 zAcM$)%noRrTLBFyMiK#K17PfSF*T&)hBxP903bm%;|KlCfC>uwobKJyc(;NLfW!br z1{Pu4MF^H%w{yjzzMEfNJ;^t`vVso+wFeqHx^BJK5j=u3;JP8B^8t1U`jYFbbygCEkElIZzyjFQ4Dy zn2d}e`&Wh$KvnbtW(p}VP-f&9z3Jek;g?AHY_y=L2djZH1*mZ4G@;gx=SA;Xbt`Ux zi{db$v_42Tm6Eug0c@F@Yv@ns&jD);0Rs1%^F8sbvfFm^e)VcF0O@Wacc)C&Ev3;f zesk&0HqjpdX)^F6AYRKFD}`I_ER;r$uZ9dT_u4=vfH$Cr3EqAQQ?=|S%TSx({lQIv z!iPJkrPyU%MO?fQ^dDg52Y~e%ZIuCE2f{V#z-eIKjf*{iVnzT~MovIb350jC7L;i7 zppClo?fdu15;ODwI7GK&AVj@2umYj>f~3vwXhaj38sKz-!@_QP2wvh|C=0!Za<3n* zS>pbzoen_~6H1v`b0{aW#ScwP=khkMR?Z@kj8GbrX@qmHF7XfgEJG?niMbe&;0!P z7JI>^Qyecb3k&-9q4loF)!{H#(hv9x;Fh4!N#}U|uI29=JG)4L1H;3=#;vTb-m)%0 zKH-P8!YdID8-MbEF}aV7EOxoq0&EQIv4(^b3Krm1L9hrCQ!h{mT^z2P@DOV^(6{+H zFLlJg{$`HCp^M!{aVDnk7N$&7r>`*bm!Sjh54SXm2zPpPlhXThKIyVwSi z#qb-R%4w%=c-Bi!XHd9@g@%^tY$q7{C8eg;y&3#+eC!s*_aUIxr}Bsc@8$sv>$ zjoq%*0j~sTFB1!kjlI1g$j)F`3|ovGe7%;I7QoB86P0&sHret=&R0_GZ$*Cq1DpNA z0m3e!dzm_>V{ELlpkNyq2tc9PSXo)w*p36)ez&#BNJ|5)1XrnEH4zaJUkdA!C(8g1 zjrpgJe_R9G-CNJiSXo{MHVFFr|#)*lElao4 zh#=#$NgS~%`0)b@b`1>;?Kub`3xMydsyZBuO*5V#16Z7^E3X2> z=*S2jHuft+!~UT!z4($dnhu@wS9oRvibKXY;x!_U>#o?yy= ztpv;g-u9ClEJObXfkh^3u=J?G|He;dvDSUp z0Dl07jI16kJ~|o@Y(bmxpP)igQE?SBYNtx zvFk8)Je&dRp6y4LWFl0W=!akI$XmO+9%1|qD;;t5+9XTb_j6i5(N{v_aU;?#`odJm ztA!aisw^K-t?_=AJv$|Gx1DFzQ2-9amUiFJ=AC&@KM*kk)B-qNL}a8n8x{=1WuT*@ z6B4@R3In6p*4BRh{0Wp$fDL4L^#&R7@kgK#kjqwCIfRgI%$H&a+72+P7&(`2)=I!@}AmO8+Q4LJ?!4f@-jBy<-o`!DS7W+Ww9 z0{ab}rfPANC_xxxLf*#!=-SK4p&XzYk;_Ycd>9fD(c9e(?hZ6=-JP9`3=BXS7r>xE z8=HrinBore0rVs===5NJ|Mk-*cj-wz3*YHJm&@atXv1C zvurz6UtV3wMi94tDF$x?@Fn~&4GoQ}P}<;|o}Qj1&xZW`?)G+iI=U602XmFutSl`< zf`g4XAA*wuKKRjuc`2~jJw_Z5Zhr0DrM7_6`k|38pREJ3*AXk27pm{-dIX{(h|PUz!XS#(_@VWy?&o+j-s8ul;(mHr zgErGu*b=W_|BWOQrlz6E&(E*4nfNkdrCFe(uBBCF+!_ibA!wQj9zQm- znfVke5EL44+Tm}x6H4que3U)v=rz5fC9tn!#m`jEy;ywsXycU^VOiN?L@{ z?BIkzip{L?1Ex)YEsn0cKw_PpZ3ep!z;u~43(Is0xRSt}ZxzhtA<>V??AsMKK3#7YcLGiHEh8fG%WZWd$s946Z+ae&|*IN0jBZH6D|Y zaB?d*0`?hRe=8IOx)JntF|o0w5EO68HBoQSJCxHar9y&$9`-P=px_G70b*vmM85tSqO?b0BzW?}fd3n$eUUBpXQ1Ys!a03?>jB|%4 zhK5S4M!x^|A5H~2#ymJ9kc1Ua*nrMO6g~q`R|*OWFx|E0*2GBoL6YVSCa3t)yxR*x zEZj;Unvzl<|C~?D&>qCNIRNBDGx~w# zt*odZ7x$|JGl#bZ_UqbK|Bt=1x9pvrY}qqA3E4Z@WMz+# zorJ7pXGhsHGh`)%>^+i^&F}L0{+>U2$qUbU&biNZzpwYWPVV)sl)haD;Tf%;w`!%u z2lSFIr>~ySl;2AFTx2{U`PAuGsqk^B+4BYuvKLi9-IzSio{PDsw~to4R?iyD=1d%S zPuqH8O{>1UYPs$x?>HlC?lOCBWP6VzUnu2?c~PprOV0P#Pf0V*KzyGrWebLv1)I~h2#E^8*NS9ZDiz}__{T8(9~|G56uwW^@)<^ zzQ&;ofyHy>c={!{i;~~I1!SX=#9C!6W@BY$mL)a7%P1yxmi*X+5H;8*`}ohC6f~qh zV`4OMFhM3IC52AX_sz}{D;O^n6+d}=1f&LQ5%jrIbudg&Q}=&4JoIg*$F!+7sF*0x z{Rpde=XZ1C=g;F`i8ueottYo-)k^^FAt)&5cd`%xcMd3tOCsHCC_z5N{QQ|~r$FNr z>%L1&%o(>&)8{3Nb`(kniWd_TCOXN>!>@rK>ZbbwKt5CF3OBK(lPv5F`1eodLA^KT znEPbon?lOj=J(MoY%ga0D&Jc}i z_9_GJ0uY=5A?fIhLNRoCTALM40?PTS$B)rb0rQS9KoiX-QZ@sr!1;l>>GbUEo7Jbi zy*(&Jq#uq{eF)XrK;B}6m3z(dm;sE;3f`9rCn7Xrs9H|=RIg^Eig{wKN zB{ktWPqDFZ{=mNk+k%4!=##_mWuQ~`0XH76NmFWKqV~gwOK$bhnC>9Wfu(TA78?*nc zt*s6F)+LlDIayh#^^moItIG@A_zl^_820Av+sz|ic$2ITCIIvR{}+zigT(-dA~4Y~ zGBUzpfJm;230pW8Ha0Xz0Gh49xiM%1B@is(;MD}x4M6~=s;dhhXgHyr>h9?&8Q;9P z@PqAqp(A{K-45OW5I!;t7hLwqVj&_!Ww?L;>ff~UHP~Avhcu<7+n}-nhYL=f_EBA7 zK|w%#se^EaS3v`U9UuTiBVa!O$;&AWUQ-NR?Iv z>Aw$9Irk@c@Ts=D#2YT1S&>Woe3PBvRV5sEHj9G`hITb_Zf zr%ApfN$pnj^pPAR3K5FG#RUm#y4--fQ!r=V2cc@9+sbzYlAj-bsPfXMan5Fs(pAAw zjPQ2AG^{Qgw;OaE4M`Y_6U6DhOBlGUvnlZ z1FHm(e=vi8(x7l`gYZlet7DQQZYfWPgO~>iI<781o)qJp!=Iekp+zHUaO;!Z_LXd>uvl*a}AprB8 z+xbo{_&xa^Z-b!<4h_1`uC6ZNc}fZjx;H!wx!xWg9)c~bsYybW!`%tkH9kb5at*kR zA#+y-aER+lzgQQ*w@Bu9xbq-q0uFLPA)#+8`_Kb|MMzj!80>dow}k&{=PL3abb*UU zzZ@Qn!wa_81)|_l5MZnX3?4k_2QmtjX25tDsVQhEm!W^o%VVxL0^W%& zrQg!R0$c{=xd=Yr4}h`Zy`gP@dmp+1;L?|tz;X-1zJUd*3_+?u_n}~#T7ecjl%#J> zc0gFbsgVLo5g;%p$*X|@wJQCYpFdYU8(D~=0PQ>7oF;c@syXt39{>geK4Dk_(C-EL z;Ov9l1Vp8p;^HXD;Fx(k;6hwoT|q)DO<1Y}Oa;Pc;aDGgR;mjf>~Jv>uw{j(qwrD1 z+Ek~lodQ4yA1$~Rs;8hz0-*?30=`J4r2sDqIXQSIK<|Wbjz)$E15p$im;N5)glNP( zBDJ}zB1wSNCnrxyPF`^lxkY#X0w#Y|iQ?kmfQk19&}qVszYd{20+GOJvT_0XDM;tE zf$jC7jt(HqyI>Q9ZK*&O_T{D5cKw33;2d+)c(H5@O1hgiu*b0!{2@Bu1Z@?q`~7x6 zxi{hwroaWI3#2axp}Qg%WM1VKoE@(NGpE6A@TA=@sqbq>}ku9@B$pkhktzkN&T z#S8J=eB_(75!BW%a?YO(fsBSfrp9X7LlzzWv>uT2;nC4xU!VCL5mZXpAOUaQIIzLi zvE>>|43D_1(l67Cr@Hq_a;Q$;cH6C9Kcs1;Kc%|p5>_yvL-+vcYOJQFbFiVp1F+wk zhdSPY4QY3-^%}BIi#{z)O-77~VG$AF&mRBr1B!W3Q4ttUVP!%W0Q(DUH(>Y6lJIeZ z*dX9{Gj3E=R9LP8?}DK{1)dhVd@`&9;();y3tg@Fm`?@8sRwWOY>9W$xYo~nc#y@$ z6RgVoVN3p71FCOB)xjp2^WJwn-v?ju*!sRZj;;zlC1w1+>hhO{kexKzJN;bT0S~>g z-^?r7!-PrgE&ZC(-lWHrQO~B}M6sDiU4`kw8T%i>6t8!!e;)0yzG&2wF~RT>)HARRcw5?xL-naOHf&47R_u#4YNU)kBM z{^y?cMlAp>p^t&%h0g$1EwEaH@fIEo^`8&()+$CTEGBphz)tX!pKEFeWLY&bC}7J+ z9R@`LOa!2AK!8dJSiIWWcv!@aC?K0eckKgfPl@{y_${D-!2SbTEp!#svEA@)P)vUN zZk2&$Sn9<;2N*@Bm@DeKC?62eVp0LQHu$i3I5_7}OlO?Dz{W?c0;Z**Y$;PCBO@>~ z>FDS@d9vkJuUBq#ngXFr2wTwV6+H`%N_9{L22&}X)*nJAlL9Oylv(HE}|&dB?~P1B3^tM21N$g zD}gk%GQGyxUEl@oB!2^p49N$GG<-Icgf==dG7^|*Fa|-e52_F_xgd8yvSiakELrt4 zaE3N#P~ka~?ZG8<i>3x9?9wHt$;!t(h*^iJ@p4lDs2J~P)-Afn)@;EzrDpTVP<&K9G2VSC_*dJd~%a#9~?a+u>! z2Yf1&c_1#W1o;0gLq85OH*hN8dGdt=0euLFl%<~d>%VF}Anns(6iRdSh{{Y#eRI8b zk`N_Jp?Aq3?o_Y)^XBThXMvyyC$E2Z^jC&q`q*NDl=Rv0;#%iDqG131Vv~snAGtu( z1ug<6ePgu290Fh?KI#;wzP~u1yS~rL+HECp32Gp4`(9$1aB~JMMzKwXLudo$i;Ue+ z{VDwbhHui)K*8Oeh=WI(ncncSxVRT!zaXKZnVFh8O`p540bo9GI}nb$KZO@U_S0bh zw&0@xY>kqp_74DewETyggf!T&U{tXw*n=H}rs=NsB7k)U)$cwqfe7$j9Ke~AgzRdr zVk~k(W+udS(k$D+ntBaWtnsLYwnvocz;X|IW0et4E7-ck#Kj@GANXn30AW+@1C3+6 z)RjmO#7NzM!KL*tV4Fned~nhQHVJRRr6YK@aH1QsOTAH+zZN7|Jj6(`!`WiVr>kwL zf2%cEJFPpQjPH0>mm&|?hH6s~%EFf84)Ega%-7S@M%g@5CSJFv^zOh&$HT!Ts!m;| zaM^Yu+Uk$eRxz#_$(=L(pQlUGh}Q7ER|e^)VXH+R)%{XxwcG_QlA{C zB}*2FvMX$p4Md-%rQM!<*z<2+atJ@25wOI?qC`DCIJ>C@9`Lk#Jbud=$3H6IMXqT( z>E2-{{9m@BddeY$9_ZV6xp%WpkBfDImjqtV>}@PWia_*|*zaWm%N1jyNTvp~!vE+g zILg}1z*v#rW=Uc~6xEremax)jmLZijzMb|fK7ZHddjxc|D{lN>0q#Lx3|@v()@Xz| zuSj(;fo!VMhjueFkLIi=6u9W!DJuXZ1n&Qg1bi{&04-=3fsI6ci0E+v8}j+oygKSC z#2CH*W{3PKL{yp{!`IMk{$6moG4)JMO~vR*L8av58@3VvPMTk)XUFp{Cw}d;KeVsu zgF?XN0;&Kh8hUC#9(M~aAnf?|2`7ZO85ut`H%mgb0i!)+QMkw+0|WB-F-}NAM#hbF z3RNUZ9%4E5pdy0`Ri&Q+nh6;hXzq~D0>%RXDYV$2vnwc|Eur)c3_yhWy)Gw&QLOWh z;0!{@jVA?0?A&k`uyckb0Dys-ePil;VNmuHq9Ks?_5x-D3VcP={;P5OoulK_zFgYk z$o!5KpRB0w18CV%TxvX4w|cgj#8=Xuu;$(+%>LXb_O)r+KnzXuEeflbK-Am5_3ct6 zeN3;S7ak$NX9Lf=RRxfe)ZW6)kl$4$~cfi0gwgCbySYA`#gTyrS&j3xv%%=s|7CwvvudTn>2BHM_Emy63vH!p-9$Sdf=bRRw9A6!`T>21OeA~%^4ae9lqxBvSX!6JoCp(d7~_1+aq>H^5ajBnrkj9|A50R- z)7bzGG$Ad`=i=lqEV7dEZ$hbQE4LBVCwEgwZHjF_-M>r7*Oyf<=*@{@1}By>hVf;+ zkGIf>YhUimVuCCo*C^}A4ct13i?)N%%@J%!H1;@b88aq!_VfVovVi?-;L;KZ8Q7@T zDNSaGJsbVOi~(C5I5mM~J_k7$9{wiE(Zy*K6pAoyLEy36#dEMQ-|+1{Wofq-X@jiB>yiA3eRiLE8D-s|Yx zfMsx#Si-`A>uBk>H&&ny6HVMjXuuirZDWYBH1 z{hQ8Q`z9U}N4-S)yl!^o_Dikgi}1{~CNa1jZY=k=0_cyzV9$maoPt6ZpnyX4^a8yS z2)V*5U}Is11~VifC8ZYH1|W(xsU}L=Yoeh#Lc{+ysuTnvSg+vuf#nm|WdXb<$QELm za7Pc=34%3TC4Us?2?+WY>wc>nHTcJ46KUt@cw=uv6$kp#z1|22X|c@mf&!cN5H#ot zz)zLfWdTZu7Jx`FwP{u`7g!(t@B|&|1Ri92lk5k-(Lg>Y3rjwT)nC2{fja?qceU!X zw1PJ}X=>jv6QLwVZv`!hhS1sVo?PxWah7eM=Lh2dQq%jLelY>na&IvZODf|BeGu$O>N{{p?=1P9zcaJg&2^8x$< z%xL+3(m!|eR6$zr_f1V1iD@V2=g?@r>RQAiW`*VgC>Zz-ggimMg4M#r!eR{zhMdQU zAi4`|FI)zrFnnu&?<+nuITtXZ1M1=pnuR(DbAF=0Bd+??(C`-o!iTG=X?m&-yRpMV zClz{!tI{Xe&~1OVm2rKAHAtu7}x5*~uz``1D%2i3SG=H}7TxLIE-MRdO= zQg_n9*yn5akkcRjYt(=Jr>#2GW5zdM6z9@1mYVunTs6P16)%(O?fvOc3HR_H-ZAvc zQKtWPq`k$pws^+uRS^x=B;Y?lT7?9GC0EArD=}KltUEK$%Zoy3HN+*;Y$f*CakEm9 z;$LVE;UZ}7t9mNoqb-oC8_(hugz=@NuKB#pJXEx4v#I7t{stHa$PQZ@8{n#9sDc#P^Qfi{NCCpXs;+-s~!#WgiQHz?h! zz~@(^7f9*7ZNak(sZfy3PQQcIRdfGaddN-T5*8lHlAM0H=-J3k)_+7wS~zwJ$Q?pE zY%qw1_4_!qiEvWl;Eis+Cn$J`&YSn992zLNI`Dd&@ojMMdA$+jyUpm}90KhK#}5Jl zDRvk1(eNq27`U;t!n32%=yfHd0g2Qk^_!08u`K^7gdb~2b#t$~4BTEoEN0aAx|fqWw1g+QT)Pomp@ zJ*#KqUr*h3gu-zhu97 zZEqT!^}$oKACWZjqHON2GkIuF7g|c;Wy4v4B+FGvexTmEiu&f$w9nm)*3N#miBECt zKcB${2bRo%2skSqAo>F507f%dS4wd-eSLk9VcS?=7YV$Q$k&A!#GOuP-yy~ZKzPum zq`dqVF76Eu-54vpaqL`P0%@E(wgD0PRP!(vG)vK-t<6md9r2+90FYo;0HgzN0n7$? zjzNx6%;g7B1`Ysf|D$4EI1I9AYq*ernR!x5fHQQet==}4Iuhc{f3tMDoVR>x#x6>I2pla`pYcAO_J3(ko1d z`#7-$RyFv+?^%*hU=w@vs4J_FI?$Ah?16!Sf{o4fpAw;q056lIg-`N@7FpCZq{D2= zmqXJpxqD-5ugPq>C!VLVNK9BiKP=t$7;6+*3K&Q)uNL!65xPtz`~UvJ$K`HqfU{9t z6XUZ#v4Thb)UDqiJtn!L_?u$fPXva}msm3cLO|%90}((dOObeEXUqqc#u|=qlm8w9 zHZQ2u*B5J2l-b3zPIEO+iH8orCA8z|Jll}Gvi!P#1t2BHuzSz1u?XPIDxE--3qBRe zyzl=m8Jsg2l-Q{szrYDiR0jI3!;So6e&JfVl8}Ss74TtDieP7eDh53vov51?5Eh1I zLa=V(3-Bh7+J6S0sI|AZ$aE(Vu9hApH|`Op$IV;ijo=r1o0evvt4jh8_CA_0#Xv)Y zfPvt>d!RQ50QiO78_GH0YjhX*V>2@|&{TlI=Y>Zv?6^Q}*;-pibu9vQ3uGEMgp;S( zfj@z58K@~>v~B{@|4n~@(G2hc5D42KL!z>N`3ey40Jcn;y!oN+1Xm3R_>74_6@v5# z*6sOi0uh8zk(bfc$uJo~(u~n8e`Lhrg7JitV2;6I1Y z3eX&S8mQ-YZ3cj=5e2aTI>4JzDE|I1Tnx6Io8V=c-t@0u*zfD=U=M>ph&!kwaM~Ug zsENX;$`QLm_&EPL;p=w3OhZ5+je8fm8Ynv;;N17xrQ!Lj$A3F$sqSV}1S=~jFQ7-L zGQWmBrS|jZS+J9nMXx}60W}sVWw?=XdFro4Y2siZLq7qH+m}!9Zt&VRffEXN9H=Zn zA3%G7d^n)o!G#Oyw`M)Y#G;m#EAaiP=0nY-758)i5&=K}9OhFerz-%?s4}Sn)~|qC zf|dgg6WFyun`&@%gP~1Ji@<#t+SotSwY>cogC>vuKLrYSfKn$QKv}`BVpQtuAJ%`- zTBdJ*T?7VMjsNckaPlTa@CHy;-u?-qH^B5(5Ek83$$&&{Hh5$Nej%Xes^Sv<$1;Ozxfn>4VT2KpItz z^1w>ZCV-X8Y&OX#jo^b$F}S1kxlBG;MZv6&FOKQ-m|QDp&kXW)`c^=H>k<@1|6si2L34iRfC_z|AaX>p2BwFz=_EK zkN_4gToCY=!WTez!WVGg0m=p}36uf{2M6FgXz6I@sFPJ!fFn>L8SH$Rrq;b^l}f^c z8KTccd)Ef{A=SA3XJ|rc#o_XCRnsyJtcU=%K!HRfd~TT2I_m_#;yIJ4QTX4(C*cpm z4`x*cz_12gPS}GVv@E!8qQIP;FRn|9Z)Kklph8v-$a=k!G~7XpaKNh)-!CPGpw!>& zyOv(~zo`pGC~?ta6@lDH12fF5TR%5!&bCgEp^;}MLc_qI#zlYo5+)Qwy8$L_uuDRF zE^_Z)@=_gx+)K4A3DCIT4X#2l1;~OOG7J-Be*6GN61a5W&S0D-R28tGk55fOr0^R% z1}wfV3z*`?90p!Spj%=4F>tt|0awuY7~~E0E{Ac+v5@K7z2GrUuA$ zV7L9C3E;HY%^0(R8SpuR7Xvyr08w^!?EUXcL8;J(JcUE;G}z}2LZQ`%DHUMz0fY;C zI}Bxl3k9g_CO&|$33v)>ZJX?UeOnL&0gXc1V-*Bm5Iey{2G*h1;r6{NZYATs@Brxa zLDrOh*wHmI#gbD})>JG8o9gv>L|GLf{vmwtUYS8PIt(Lv1!B{BZai$iHxb4UAN9Fz zVPk`pWMC*v=iBHr@6olY!_fiXhbAVwIioPk2sX9tk08@R777xRwa%uEvtZUB2c`Dl zB7s2;0pMC27QeH_3hpC=dVxiM|AUSgU3 zDAI<*f#nVh9Xjuup%=iL!J+_E2#!O3NSMKifx8Dhu+Y?lXXO&u7`QjU3If3pkOBfA z1_AGc*y(vk-0{K=WFF-APmi3a`cx zrZK%6w`U0hALai9a3~_+K@<>3ZTK*;WiV6SX9fN_80F$Xa?{~_CpSbCR1vMcq6iQ03b2X5!h^j7HaeK84F5ub2222d2bLUs zK8?a80}AMrp(_Q&9;^Y-C86U|ydSZH7%bQYs8e)`54n^;zD-{S&s4q+47@;YgGM;t z;lHq$MFYk|=Se?kSM_L#iD6>0DGcLm4Ggs5_z1S5m>3w02yY4}0I*1@Kb)I!dnmC} zxS&YiSgf36pljQd8yJ?owO&IE1FD8WrD}puo*`feQ`x}#V3BnRTmY2E zLl`+U_~|=vHXu*|EC5IiStBHvf&gSBd@hF|aD+f@y*%@8jrCMl>iJS8p2Gda?_Tk* zqrXGMEa%_SCF$}R1I9-GP846y#8tEG_zo$>nN2q*LDOYYa!;~;C1xV2_hxY}&e55m zwMA#sz)%?=JQONU+OgX(rt%wo6ZRr~oDL+3%O74(If|0ro7tgm zBg+@hTZio}vdR#ka%y=$6!KZ<(u{(%?=Hu)eXWbe@INj{4YE2ZQLWi6z^mU7DuFz{ z+6Z>`q3ArF@Chih>PSE~DD3RqJ|*W7xORXe`taC=25fj}oELmAd6MO=D!p1QI=mda zObMCh@3cPM*!%xxQCNu=J7{b}4PFl(?5LF95cfntWR!ooO4)@syLb{x_()szZzxI7 ziS$vp4Y&AeO9@(9Hf{?@VV~+h02(9kFvWQ>m+^$nT zqnXxO2@g_GNalU_w6u^BVIgZsziwwKVnr5`YWC-y3m{`6{=P}rB|?Nyd%nQmdFkO5 zKf3EV`REOzrm;ja!hPfAtnmlQZaMb#{Dt}b5^0&K*!BDuiM#xxw7K*t=s4J;)f`5i zUP3jrNxP@l)8gkvgfx3Q;l^V6J5mGBPo&6@x!yV#=D#q(igbC(J$Z5Dr}v`tPwm6! zPkkkaHm&j7R|+Lcx}9X!^N(0&k3TfeEq$Xt@_l=6%g15T{u7aw7Ip_x5WO^`l0187 ziivq9tq?V4yO&n$g`LOoPB&-cY^8A(ssB;Ji|>zkP3b0z0`U@lzdiXR+S(vg-W24o z?n;xlxOSfq14 znQYGM5S>(-dCaf}tk}Pnc#|qQkns7k#N+-rWuu_px+VU`?P3G#H3?eb?RlQ(p(xKE z5_ANl`w%`4B@n(tkNQTZL+q=Bv+)}pRqyyZIT?{kQ%_mmrFFAcuaqv$m`G7or5hr; z4=J@U!;X~R&m)lQ!krkxp32YeMfXw)zEMG)Nxy2CeFN^td z6?vs6x!;=Pe)$0pc) z^8D3OBYD>jD-A{+MnIh%^_It*$_i5Q)RyJ|dUKB1I)2 zF!@nduKkmRIx>}rA64AdpjcUrnRC-an)&54RxJtvCT~s{3d_6?qsYdo!2WS9A@x;K zll1@YRBu;NCut-XQL`V&ulgTkM!xE3Lv@fspV8gLy!6`H^T)`br}0^PBvDs1F_u?r z={C+`l#4o7=q@}tkN3r;>vQL@vU>nV;rXB z#l24|EUrqQscTozPu#By`21}A^gFh&iEPUd$L40()G|j7)m<867mDPfUgWske-Gmijl7i_tP}g;_tqs^Xi`p!1Y@_8)OV|L)%H zf2hcDTTk!T`ElFD(;8{>AZA#i^U{M*yhj~>YyDpL53^}s=&|}rUCfZ)($qPUW&;9S1c6tr5J;?rSD)_68rmJ15LuYp?0-j8O%bAltB zw$z0-(kG!E`OnSWe;>4=>+^8GLaRjV()MVy`8<8T9fW0OgF$VEJ`;pfiTL>-KFs#^ z)Xq#wwsrbX&o;bC#8!UcA{78m9S(!PBdv{xymeZJxNDlpYM~x4vX4_!@0b(P8q4x# z73hev#zZ#!`7#RaWkgAwEw@$rtP5!WwJ}x&q*p|_@4b$74V{ciML6%x-1Z*9`Q=a z2o+sPmbs%-tw^*}-eQ;H3HQ<)&y*K5 zL^H@n9oD4!wi4mOw2!8Y8*87HJG9F%E%jC7oAnE`m$J0JINN`Kdh*d_nnM0my1Z>* z0rRa4<5zBj$iuGAoYX*^GX;i8I(Mh`oreUBN>-Sw8toZ<6v?k@L~#G0=qDz=iXb<4 zp)vb9x!`@m!;H!(L2|d-a@7vCpPvuyYZ4O1#ds<|vbky)y7@ov0oqu4QS>}BEmX{| zy?{u(?laI}Nq1`& zS;9pOQx0iDB1AZh1z1PP#|^eu_HGNVk;mOc$wCN)omslj_0CF?T$RWm?#eRte$?c% zLNwKB6V&}}Zb1%^2oSHzRy`|gRz{TGa$Z%sffmu%q_EP4ldD4YaBs6VxRW(|qx-)m zq=}i6h!m$qF-qX*d*M7R)f$rH-j^ZRaHzRFHoSMnEk*hMwRq;;Otl7#nm9f2zFC9Ak=jb@+XhF3v%bL>0Z6xB@czCc-c3{5RDF6W z*ISP0ee@kyV-Jo~U_JD_ThbbaH1@ALaliE7Q6=;9-& z0>@-$?MhZtmPOwcJ`=hZ3=c`QIeM92tFDJCzoar0Ex^xDua$Ww`w*qCw=+b%a?Rbh zj%Fz$w~VR_Z(WM$N~4a%&YAu}R_E!U#}N|lZ6s6iI1+lH+Yd3!XMH1)N-&2m$Rb)4 zd)Wneg0Gg;Yp8m6@TK*XCTPN(>34ln33#R)21W)H5a(-EagaWqNQfuVz zkWWk=2mBXT74rEX?)+vpq>I5SjJ}rr!mX6>&dC>pI=Am#{6dY++}eUNqjPJ>7oD>c zIq&&<07@tskr7T?bmAI7^>u-^W zOd+pqGUeU|zcjKw0g2j|vd+kMM5QIl?59w*EEQ1NHvJI2fZtcS;k zoxdcC?|$&*R@sz$Tp=ruTYpW+Zatwtx8+Rnq!&e#f$=qKe)|wz5}Wxx#kQ31)1w__ zWk%7tVPbLDEgY*$&W1qos|F;cl%*Z~zr(rSe_0|s`rg$pZ06N+1rbC_W+(O%G+5&8 zUNDsk1tC6_Tx_dHs?ay;G3DaFE7>@wW8{fC)C^%pML8ek-s-Cn*Lp##h;)m1);~!8 zrA{=SXKBt zBDaVSg%Ag8Z0AT>O%Y{)eXposZPEghUCP@$>-Mtn5gBe)A}Z;48k9ojF&jqZ*qyoe zAINIwVkax_{C?&lCGc+}g1-B)!A$wFpM&sJfV}1ZAkYQd!nq-Wou08ZfCizhnm~jU zG;^PvSP5CkW8-};#XU@aaMnq8 z;&k!r+>9_~(u5KQGGdvR#bXInc$__xiOX@6hwVMUA>yvg+HTSNz z!c?vin|GdSa}+zaUE-Tbqd$7JzWQ9h8oAIbcTgkXh`_iNU0f)q6xn5A#-}dm3#*|K zQeA?7h}~zAFLdHUa?`<~FSHC^jh*)PEBwTq5ko;p22!Y?@cGm5WVFvr_0EP#o@+f0 zJrH#XeVZj`WXfd_+2MdohvH6~6-cxxzrPp_&kX&@>vF=ZvJ+hpq%56%xPAS0CStyGgg8x}82 zJpbK&XizCQ%5S;X?HQ)|WBM25Gk0*sq`EIT;p+ z`CJK5v2Lv_w#>=RY1rNmXBhi?F&m`B$Pk3q&R})0@3b-Jm^bG@&wGjIHP~5C%=as5 zQYP-U(hJFE?~s5?+T9n(Ic55dS$cXQ$d2kBJ*qlJ3cs%jQ0@*tlEdF&xjv?)l#0As z!kh7-d+Bmm9j~Q>%%)(;qRKP+%l@qMpTXvUm! zYh#&=KkwnoKjALb_+*EDIbpid7iw4b9yo+u7I0r$+(SPb4!lZxn~}SsU}uL)!#>a@ z7f&w}@=Aa!Re3JpmD4Zzt9{m&d9TNmv<;>G{Q4eh%DE1%zuQucz9rAP7FGAYbbu)ajv%Of#+30nhsn4q;a5*16NQO{ONFXh=`Jo=6NO6^ zGD3N>&)wk3#yRvFr_k;@gMcj=kp+X@Mxwt}H%;faDra%^k?1&{LgxN6_ z6-n4g)MPz6zkS0g-q~~^zZFHANP>-X;YxCyOGe89XPG0ibgN$qCegcv2Xj6ch*uiJ zp-M;?{{m1VLU{r+1OD+N^4JzTZ59jLMs}F%dCwG=nx&Td@!0#?iMU6i zsNqRzNr<4xJ{(PiK%4SVO2WcYWUoTM{rZo-B2GCi3S^(N)5prHit+@wWc%|;se%aV z_=mM5irkbUFQLc|YBUxL`Phk@rI?+ePC6)S%Guu85J-BSy>Jy(In{pZ@h}G^h?s~r zyG4O^cj1_qNQS4t21l=~VC9k3HuI0Q5nrYbzr_2vuAu~Z((1%-bb_S0(2$b*6Pn{& z{=E>i&v~k#%xTg2=0y9qOl`TG6^-AI$!2OccO>c3j*;AD-TQfNG-B!^reS9xYxIPn z1neXt>FROWVY*RGIKx^4nXfvS*!dP(B6`p83GZR&aQaqZrsb;qvic~P`;|VUF-Vmf zy>O=OwU6>T2dbN+=y15HR0w?_!fIK0R0<7Ipw_+f5DAAq=;Sp6)?t$7Q*Ug>HzKbi z0yeBh&3w;De#OW$v(Yt&Pe**UQuLrQx#X5~r@<(Z$#fAxh6}+abE>*O>C`>ub-$aT`ov45$`s&vK zNqlYuuXrq$co_Hcz7Y1((Qb1cOS~B5`7ZjMRTr16JQjJ+ct_l zT;BbZ=aO+pL77#Tvo{YxpX3oyR`e)AU;Ed~umEOG+L1m%E}GcEnz~y*6o}3&7UYWV z<0GnyBQ>PGNuZ%1-2bLsDC5h8eLT#{lz0EV1b1=h6jB_=m!c|m6Wk)0N$FHz;Lj|&9I+2-kNd%H=>JA&i#|zOO&U$UGwF1wVAIK&3l54;z&(q;+IU!n3Pp~)H(NLDwjH+_LA0l z-y+}S^FYnGwfCN$AbMVKB=fwlh+nJs{kRNEp(7sOtG;#qUeU-x(~u+ej{-h27cX)vWD!nHvx7! z;jxtBu0LsObIR2b7De)Ub{L^0QV?-Np~gHzVuwzsr#P#6LoiF@n^(as_n1;L>rwBZ z<1_T{Zt~m{Gy8Mp%GT;nyd~C=yS^6(q(+l+7;(AGq!stk_+|W&jQ=6? zY)0wGYh$JjZNV1&7ik{G`GTM_+M$QY99e4Z8t(FX*Eh+_iF z{L!)9)nol?yoA?Mf%3|v{+H^UDYEZf>KXKcA{j90E$TS@bSWewQNtJ{Vq$3INeJJ^ z4pZ=ZA}PmV6! zX%VBQSVt9-*_ppEmC_gO{9y<6^5lVX@{bKgE6mZw3MLXAU&kd)UsfMG*JHNa+g~1( zTz4dCogizpMc{5|`sME(uvua($=}j#uX87h%aDygW6bK!J6W&LzaZcL-dOjXAjXsP zF@lkuq!KB;^+Vvr8jCX{G6i9}v}eW6?{i!IJ?faK&V$zA@KD{+OwQ;vh9K1L*R9QR z@qP-&G%w{ddgaqDtope}AAKYvdA zN8~di_-ly9U7vsPx}1d}jpxk-^7CTSF$C>pNm73D3d!C}jxMScpV=MdT_ku` zz3^2T(b>=lWe{zlBIY9@2wxc?vFcxEk%{&h&|)`?>_u zvt|aeT*e6;2&`oR%*VT*uP?aL|IqT5uk&4P*Zx0^J%=p3h`byXSd*CV^*SoIA)5L@ z<@58}G#%5cd-4qI?BU89RGTgZ6!h$6j7y3i6k{nW(er2P9uGLtVhee&0({@H;ir*FV`80MF z4f?H zcZW2Zw5-V$-twp2ZxNpJ7Ajtur3~IySZ1B6=DOR=(;7J=LG{Eg3tY+~9mp>G$lipB zC-cXe^Ba@|2g9EiXNUTlrU{8ucbrr+5okli(YM_T&6Z3Fse|@4B>wUp|Nh$fSawsb zb5|bJh0Eqt3XE^LpD+z^cvcBb6n)xOWOZnM2Oxj_&>m%{PCDyLz!(^bswLg|)#+nGFK2~;)qp`eGH}N6pcuk$n#gsRvnW_)o48A^o-_L%gThTn&GN#zhWoT)fLr0 zyuC$pUm?1Lp=$Wy=g5BP2PpH3P7I?j+tiiAG8`_@pB-DQb8AJrEQ)+jVPr>0XugaK zcc%X#6B!j@#!yYpz)f*}3)!NGXd_E~xSxJf1}RI)mfX`ZR4zD=&w@Yr)jTn3DB)!_ zpAEB!>WM7yFX14YAiuiS3d4GN&;waW?ld(>1 zICb6)nNbUa^O>C`FZm5w*aK1vK*N>@Q(>6jrk;c{^Q2yRo<|Q|{ zv@9we)E5#GjWF|)AwbZM{gL+*P*W7J=J{rC=Fzc(OxiA^{hW}8l=3cmeZ5^tkb$(z z@T0j-VcYZT;Ml@dKi56QtDOqF`VC5y|0i8Fk**t4uINdP6?I2vW-J8X={)4U%$WFT zacbCxCIZfhL}k|&go5?D8|uH)dlCH(-iZybEAiQB z;mM(#Ahp(`=nNc@wCJR8zI7KdI#SZfCb~>xkpN`0l{&4U8Cegoz21K_&LE7Tgukdv zODRD$h<7-M|NdTZ(t@s#2>;a)mCth4uExKFP^@iCEH-`yWmR*v)37=fGrlu?jEQjK z!afxIq~h8S)g-6Z%Q;GfRH{XIS69re=sd*8m%Sko`~iYoVgfEAub2AfxkSXY{E_s6 ztq#LGgMV49@2sb*65W0O21T)xg;6@@wFMC|RyvZSqw)h5tUgRE*`=qY`WmA>ucvAW z9*`5A69<|y7koG+al6yIG?YM3E2Gkj88I$H)H;T<{(3szI6f4k_l+ol>FDB5N0}*w zAZbp8>z2G0topS?Q(PZD8c!qkf;FCm4s4ydpqXkdjKz5*zYAJys+?+cK}9gB*jRnQ!eUp;XBK*aG?+cbV{PBuNL)OC4} z|LoiO@OorB-tDf$G4|rG3lHnGV#aJo%-f^JitJF5+hkq0QJ)Sop3}r-Dk$OH$_yJp zS7(dMeA$WNDE7ukUY};Fg~;Ht!q*K;vW2veC*hoyMH?yd!Asd&Qc{O1va4F7!g%5n ziOURi&lni}tIY46#nHR7CLWn~aIwToqDQ4WT@kV1Emzt0rE)dc-u@fQ7JpxZ@p7a4 z5wifP*ASc2o!4hF%dABFuXSW@N2;+>Mxin;GO?|>F)Y5#dg(tnS@KAA1o)27*#JUEO&xS<+1cPy#~X79dcFr2r)sE0xKikiq7FR0fw5go9KB zs~sE%L4ZgC!3j#h6Syg)B3P^tOF#gZ0I>*mJ7h9A?4Sg48SHlOgn&{Pz!TV=kcu&H zI=S=qtA=xPnKWp3uFoIY2mopakw9>Rh(InSB_#j^Q0|ibf+K{vHuZW(;ZoAjOT#oY z(dYg^-u?uNZYn1__g>^*M1UGj0X7>50R#vXlmpKJ6oMNrHzX3sWw2P`65ykR#R4~h zLIRToA~6&axLvT?;G$6ZfVyCFKrVyH45beQJM1nfPDDkL z58wQsCY0Rw4F-)zP(UxIK6nkO<1n#1c@v%g5H@XrN(D+`wL+laNq6pB!3{z{I0#OF z11|?$5S$Pz;IsiQ@JhHXpl%QaKtRoa6gpao}vJO%L*a} zF9HCk6%GfKzE_P)z;pNFo(5&%s{$F{9Imn~b&^WTR<7635oi-SMxK?4x(BmeY{ z8_FYgE!1jFPi{HmO&aWl7hZVr?~fax0kv7lvyb74hi<&lpD32?2AaLOcP2NZJpuqk z1_0mg=aEY?2iJYRyZk!8_uN%&iU=pUY%eb&i2UC-h>wEX1rTstx8&z`LnQ8&kf
pd*j?SZ5ja3f z;3RMfKo5!5Er6nXy~G^cZUEppxCori?xh4k2q*;=5D|%>z-#o6K&-g3%p>vh(yJbJ z&v(&vw!M3MK|BII2)N!zlRPPt$>q-y;i0%%7Qgf^N)+g=tsdIK<%xwatKTC@u&4)T zu~-hVy!U3mXDX1J4ylOinHIncFTC)=i~nxiz&E}C3Q_lOoy`iV3~ndf6jBLnHt;;0 zF39C@JK=J{Zim%@pdfG*P8Xyy*sKssK;3YNLO=kQ8-g1KBh-G7iqNHl-HDJu=(G@c1P20u-2$xv!66WF&~*Vk z{M6k;&~|``p_IXF0i_U&AeV#ZV0VD$VKf39d{ofup-@2~gW!VG38@?o2Ot0h5(ykm zaDYG|k-*`ASOT3EE)M=GfPm-Va6%%1(*cnf)C~a;ivbF|4MrP$)!+ex5iS9N{&2fM zc<>yY4s_}ul|sbB?e6Xy0opsD_JdpurxRic1UD#w+X1ZsfdLSUz=FaJV27dO5y<5Lfk*+KgUyP%7Q{tEO5kuqCW6xmsR&vfY+8hef+H{)(cFooSb)Oq zhFA={9a1Sk(a{Bw1b!+|3at((OOKTm;D_KP-H=Io^!$>beud!OOX_n6#3JxNAZ_B+-4H;? zmBZ`~k^aTtCzk{(rEkv}`s17O!V53F@ZvuLH=qCz0>1mViGJ`AS-2EcN9ctvvTzK& z`)NG-5KbH*zk7`y`WojNiC#svAY78GAVhn_5$M-LoDdLqsoAx1GKOha4()K+@%95J@jx<*K4 z_-0oRR+RPcWEBXe#DTq5pax5*L~OFh*wK=r+1(2Sj3| zrs3QPNJFX8NX9NB;}YpRpCcm)-)zTiw?m}Fk?jOhJo_RfUG&2>rx6p6AVMT*m_300{UiM9F+BPp?tPW`R?$;B^7JDV zcD()qy4(njMp^{69l($*+_M1BJ&w%9y+M5QvcY2h0PwH+fCpe+yC`A|oY z$CuFO{y?7lJJp;eIx(#~kJe7ixSLEE4PFF^?8-E4o=<0X)4zUBUVDzN+(ce`i+=t# z3eJHBk?}(zrgZ-ysN%?5f1@A0hPrm}Qu5oE=$o&AC}?XF2@9nE{4-hlEIpr3^i>#~ z1-F?#_XzxgF))cVI`Qn&^zE0)qF;k+!-~!L-OKcocS&df{pKL~YB@gp2NL?wH5<@> zAi3`m_^a{KqtrhWqx|vam&h6iZ7mx0tHEpjT z2@{c_#+f227|F!Dps&E$N-Ua37cM66d`6ot;9nn-uyEY>2zIWgN->V)V|ZU!2>HXS zSn)o>>M# z+E(1Q3`#eB`6Y-rOr8ptgrp_VH~tQni~ROAA?dSHIbwx z(JwzI(ea24!hngit_0h+kv>E4&>i%Re~^cNO;7J3;qf@Oml{mu&b#S>-DqzkkGy~| zAN>9A6qLmHB4z|)g6N7b!SUdv2v(p`gTPSo#IJGs06lz>y!0y+<<0+ z(OgISk0&V+bp1vW5Qh66!RdYQ^QT8olgFPy&Q8P+rS^8RW-nfP4m;P-i^U{i5c)@< z!-2$T`uT^D$jRd`;LIU<^dK2G6_X|d=s|7#qmUlr+oZR+DZN6Cal0@3rl6E^9FdB6 zsfbfc#a_|h3opFz;(rY{pa5|2$d#nM6Kxu_)ItwhUWcw0RMo+0pe2RK%OiXk4U8sF zJOz;im1fj7!)ZiA9ZY&!QI4(#)HK54#B8+u)%DB)J|I3sY_2Ddjcyz#p&}%ABe}FChOPIw6WyzdjQbA-$3Ig z@4ZQ%{1rJQM_f8dmC$d#AtSS}ZXLPzw~%zv75mX|APLPNjmJ@0g$yOBZh)VX_8(2= z&c})k^tMIx$OargLnik@V=DlvX@!W#(f!yn4Mq)gK!+6oG;OHKN8$|f)V*}&?`emQ zz=gJUl$1c*fWmy**NxU@u+7A_PWs66`1=2FvJROe$s>=TIhQt6LRCNy=uv0JXK%x4 z#Q*&c$z!SR9LYO^fkl~`0ooMPH|NI;h=EcEL!jr3(ih*9t zhr5L~YhkEEO%3W>AQh8QbGmalR2GrAp#X^0h{u1A+~xFN{{r0P;pY$^4hS%Ip{W)P zHLyuw7QmZfbK%LCp*euuYyd>Bg^PkS)6Px;kgg8+N|3XM9y~%UI<&Wuv;p|_^8jGd z(AGM%x$x|}NZm{pKaSE3w8%w+B+%8M<{~}rKqs(b1s=MGigmD1fTB}F+cjj!XgvA^ z0PI{3ry5`Ujz0D@af~2#5g?$g6#__CJ53yb$8Vv(e+R=dG5i*K|5Nzg?PT7s$mCG~ zNP7eAKM^B2y73eE1d!jq4h4sAK7hUgHFb35m*oE6AgeFB8u5ScV$OWJVl`R&8R7@y z-b}psJ{>h0J2qk7XsT^OSw5Mw1k=U=fW8wN4Z51?+7;xR(TjyJHxn0dYC8gx@yf5T?{k!Q(Gxpx`+e}Op;J~AW& z_5j3i=y0H~g1+@9IL+iQ?_lk_^zA>Rs+PR*9+Vsal;)Gg_tL{#vF1F9OTw>y1(zAe zw?mnZTQYIrFnR6&U}&I!dW}5$65;~s2d~2}L0%5|``_{MZ*U|82R9?KA2Al9t(7*^ z;?+0l-cQlxB7c4jE*{z%T2X) zvnh-i!^52YcmGl{2vf6yzs&cFa9%eBil}dc&fP_^u52+6+1vgq`DEePJyO{ z#Kq$94(KTzHvxG$^zDDZY=e&qMLG2OXHnfw+p0kQ$n;6{Y#t;$2}vYFhM=k(P~z5G z=o_!m`bKcTNB_db5)u#!;-dRclAp!AQg(heuG(s1l3{q+CYJL@pH z%Iooe&b?#nF4@gycjNBvK!8ASf=ek@oKh%-QrbeHNEI#a?h*na?(VknWRsQbX0txC zBln))A2YMrP$bB=lwarb?6c3vl~?DU^S(!(&^}#d+j3?v0w~{4UNJ@r`8n$Kv1FdU zI9-lA4w?u$=}<_w0TLIF5l>dOrnT1(-q3p<)E3di1ZIDxpH9JP@WjJxJ1E2Z6R^bL z1V~F!amuNKnLm{V#dN6QR3I2);%RK2s-G_=E)jL<+ zPvVN`-;o)g==&e)sx^!}jg)2RwzK^JlO_Qe zPHY%5nu9y2tLC2%uw@Gv;)-YcMkyYwJ+s-c1&@b=`}y;oY}-d-JfMaXwZVzu1QgMO zbxaz=^w-oM(1duMH&Y*f7-0JbI*lPej*UBUdLp?C+$L*Ra?H8fR4Hp#(xW@1(J`0O zZNzy%a5zbb*BPJc3(o?SSJANxix|8ghwCaP7u#O13a)JW0yT8Fc6-`9)ZY z>BQl{Erdc0AH~+$e6p0Z94hzWYoUK1={!st>u@;f;b7Km(o=9dc@RFF5**2Pm=+?*k480I39iiBMA_f zhqpeITALpEx?~Zrz0Sr}^cq2tN2krDOD__W2>MA*qgz+p8IqXBj@6QsMtmB*`><*i zLwoA_8G5im6XK=5j>le;u7j!A$jsF^Oq?#7o8-}FFgt3llLG;U4pB#Ck~bgXD(mBG&eO2g_|Y(!;eZ_l3aTo1Ny4N#qtF>QW)3=Uo%0AK!8w46B4CU4(B}5mn2RX#q9|OHDm)EXfnJ3?LCe>W%e38F0ldv;;oayaXj>A-u??~O0i58 zLHv|#k{uOnDB(a|Gz`B@dB7QA&dMso3pDr$>ANL(D= z20-hZiT9Aup0T~;t11rG# z4XoeJl66|MSE_0N>Mc67r=8(3SaD>hPbkdsg4>SOq925t``5>#xJVA%9KgujL2u5#y1FQkt>T>WcR06g*dniPnOSDzQq<`ytWY0s#k`rdnzUO>kJed`tJ z*;fgniseUbOb2#|^q%ssM|k&P=B^|y70aSUR6;mSvEw-N5}o-DRn3UOBf+w!Q4yNGJ$IJcXhbPq;mi2^+H1G|2Bw=PW*7fQoi(FJ~P` z-=pRJ`}F<4vtkoY2g!+?JceW^m3~?dpwZ}DxM|ud4!5SnvvCKtmabVY1W*WsuuaWK zVat5F45uhpQGy{tD5Cy=^gfy#w@#f&btRj&; zezNihDL{-EF=E8{N$|}IfEb7oH34!Ml3PfJj?~xSN|RsTBpuV#HmGf;Q$Jij*}7Ig z_=M&Fh9${K&1UwB$~>?b>2eGNK&4%>EM zhV-qssM^o``J_4YjTiOVm$kSPVsqAcgeuv&pIzISHj~Bkb?R(!C!orhqqSnSKJX_R zEc$n)pc`ZQ=$o&DM~3&%rytVCACvyQNlyb+g5uyxspqqAIor$Gx=R;KW92S6?|cTe!=1#wrTWbC`q>o4LT&Z? zDeO&J1CKn#{Pm0*MqMovPA0*nyEf>1Z_{AXY6or{zWy(futmCLzKj?rcifItOS>*q zR!O&h>IgDpCez;MgU_UTKg*T^1Y7jwr}U%w{QPnn8kstkC;p)iKFIz9RPE>L>*dOe zb<<*S(NHH(y+|$i%X$1UZ7^t`OMaoYROv(iq|uTtoe8;^d=~yDlCyQ~T0WkNuTeLb zaOE{}!5OSy2?p2*_?oB-$**r?bT3>P8raIOZeUIcJqJ*^oqs;8W~#KyV(BuSKAjMH z%n7n%9(Vs6VDk(O_ZCiz}rAkjz0Miuf4&Zy+{aE_1l~>NvFN0cRfg#k&+!x zatB4amhGLLM;S?;%#8i1lkvAO(SBFo`-SsrhRyKn}{CP`(XwRW#4*Ud5gs*B$@iwhw|BUIc5U&^>Wk%{6Xqf`t@PX3i=Eq zD_uXIqElu`@18XI_{&h* zx%3!BO9k^5>*_5sawzp)Iqnqp*I+9RK8R<-N-6`AQ$S5MhR_^PD}!ktNOmtdVF1s* zhH0o35^uenezB&8c>HO4_FzCy>bxpGW-Vg+Z0SD?caq+C1Iy;Hw}!G(UVU8#k03c& zLO%S+q*K|nR~OHcoJ@ufrEC*r6>|A?>|Vjf-CEd5bCdYw6K2ezS9jKz(Q!DXJAlJo zlD`*~jlMw0{;F?n*i+a1!0h$mw|}0wZhb}FuG*%9zQES1`qs~5#E20i#{c&mK_aj% zCEDnh!TkY>^2o^{HCeh8%TdSBwXgK*Aq7Qp+|e?8n5L#k`%Danv@awhi;l%)WJys0 zeFwN8C%toQ0z0^18DQ8LhToT(!pJKc==bkT}iX|so2J|I6RdVy` z)tg`=IYn~(F=VEbmn(%Gq_~*W3@Pj&z4}OcJnlH@*NcKe`u8Ixh4egnccigJPB~Nh z_mqNm(y<>S2TJeJ(z}SVYRUD+e^pp7l#cxv*Pq?HrPmMWfKNzbEmp|~vRIh>J0sI27TD8v`izk5WDWSF zpisJYWx!B6c9AZ{GH?WW`DEov=T0(k2;F)~*RIm7zf3$%3}oC`={Z;i_0R)#^7E@G z>Ohi1LP3fDGzz z3OWBu($ge4O^Q28-+_{sC%t=1(?RLflgZ~$(4CI?GT}`8RpLxw@K6dnNPeNT&!^v5 z$u_VPuddrOxhDeg$BTe=UH$>&H;7Db(C;`;ERi!VkRgL5Nu<6;28`6SIDB3i zFCm3lv5?%MYmznyNE8`DC#WTiy1gVdi7<)JW0&qlFKB?)P1|fY3ruNGI%^E zok&u;OgxnhGsH-dYi=Z7=+IUA_moaW(xa>F+>8csG_iSyTzL~|snV&KUF*o~B&VH* z%OySgN!ePd@^bwxBss{ACL702-tdGC4cH%iVqllkwluU@XYk)#B1h3Gw0 z@>3+IJ=!E2*3hY^TyiztJ4;5c3>&B)z9AiYaK=gc`CAe+WN?3a4wF8e^n+LBgtHhu zLLAV4tQ4fm(2)chWX(!aojQLiSzYAJGcXN&Rcu-(em`ek%)tKC?bnW-CBKl2c#8W< z$2_X{%M~}u;Nf^|nQ)TMdRsC(a^AUEJ{f#8o)!wau%|@wJ9EK>qCPqlk(EW?5#%|^ zN|zJQmEjX`wMcd*BPU6kNm7P%?o1 zu#Y$GowlX?>w}4gZ1p(I)0;szR%+%mIy3Hj2JO~DjY!~ zu#euQtd6TM`>~4}<8Zun+cwSTBEBQgF<(8vBP-N$oG zBy*GA`e*so6_GHYF@9pG-g2q@{0@43uS8&Ptl9O-s-53>SgObM%K2k}zs}vbcz3nm zidY}zrNljTW-Jj{j2JOu{7-NMLZK-?OaSZ{-;B2T-};FiO%inYgVhRXsO2!T0p-h` zg6sD)<(=#3iSPnK+X=z}?W^xPYTukFZ8e7QAp=>Xid3fvDu$lHnq{d?jnQ83XMO~BP5RV6! zP+CUU9%N@?1zEQiM;yJov2U+dR!d<=vNHj!AUn3<4brU}RtpCkaa&Z@VMruhmq{dZ zR(>{hbp#CU-dU>3$;`)Biz5Mlqn7NTeFrIwSX{7YJA13?+m}EcCA;a-mqekemiBp6 zRgjj&_7c2GQ7#S-smbi$kHf@t(Og4q3j#$QNreLGpUl7T}omBL~UR(9N5o>&9v`G=ML=MP02PocO%ioyhRKjNq#OBdr8S8*n&SqW*QayF@EIL$o%IPFyAo(*Uo`^<5NKrmW-_wqRLHE^6cp39CqT(2c9wDMG1OM# zP9iCeiv8s0(^Sv;&1AKsb0Pc7DcMP87R7nYo=?ZF^yo}Y72Y5P`FI;C-%sbx?A*@I za)$P2%QjSSDg}i&O*WR0nL}0z%U05VAUT-;Ygg0ILhtSfq^7aIf}D0#?`P#Y1`one zOeb+}YU{|!VdHw5ZF+QI%PvfzpaWKb$*s|nb|$CHu9>UH$%M^<{Y zlUwAALnTU}1%HU7M1bZ-;t~k>F&sDyd@Up-ux~H>57N5_b+t74=+K_MyYX4{?1qN$ z2P2uAT}~S6X!c_|P#dR%`X=&nXl%eT$<3gt8Mhm!gBCBCh*DpNxUd2w#M973ViIl_ zE*EOkSWi$<#p5OrL?JVs?K|+qQ_v2ese#f;x^#}jcdD-9Km%Pn;`7qbOm-%Ah+TUr zD8OmpbP^0=nlyW9Y9=iWLvT3>1#vj>``KGTejY9}l5iRWhe1;l)io5fr&S=XK7cns zVIK8$)HTteJ!+$18dw&lN#%Y_7a6Ib7)B)Hn?Q3jhDj)d$4yf+i3zw|K;$fxX#07L7%^hR`2U+D zQ2UcRCiffMvhZI&y_#ku1jX{uh+T!V%fe!HBKf^)CHgM*B5yGDek_5 z{EqbOEqnKI(%GcM@#!4)uh*hJ{Phue=~<>vrF$Qp{V9na+IN)B#k%HGrj^J&f6|BU z=Hx5*?0rdaYu8@*8fcD_tIpt0zt^I6%v`BQ4Uz48>D80CII=T&7zXy(ugJbkB0`dyMWKso2PZWwcM_t#>*9C~ka!H=gFz zCu!e_73&$=hvik`>B`SfyEKxD8I{5B|3c4E-25v^h|~M7r=_zzdLQr=62Mn% zzlfmHRy)wv^SuZ3fj={-BcFUIm!8K*)A`vIY+I%GJjl2~%-hELee$=*nemP;+$`5! zr7!=TO_tnyHP5}t(Zl$7hKwAppT8;f4t{wfFFr=^5jtfK7o5T8&oXrdKRbsP=27XT zcUKt2ntA%jvlJvt&E@*uBhr%1Q}^n9chk36roP96f7AC~VCh=oEjj-;%y>Z_N&JtTBXv4K_%R&V2lmzPCy~dW{cX)aPc&(|^)G+)HsXi)IlY zV#!uHwja|?Qa!q8zMOTkzFI=OQ{vs^jAPCe{qS>obd)X2)txC9oy%YE=JH?i_&>EE zPmG}M+ad>@oH|n9pC-qR*GC>F9rAlg)lS`9&b`0m)?4MWI~b9#=Up#vzokz;KxPIX z&*8+0vTq;hX}Aos#zp#H?SBge8s(Kon6;i)UINue|16i?#^=vzYCjoT%*$_c!U_ES zA?@6rk|oTV&%oZa%VptmGE=1eZ)x14pUf8g>H6yPVkt{^>2ZTuwqAPoXLwJ2 z=}nv}CtSdkHyLm&m!GGPL?jx;!bkoZTRZ-!9Nr9k=a#lzK-%8`nSJHN*WW7)py?{GhZ&aP@j34 zgL^3|6iMU8U+Jq)5TC(~u`t&1m_RsXmhp4ZhOAnd?a^vmXd7Wkt zlAA8!ulH%FQO>`bo;?6o&eP{#BF!xm&(ZmFq^Xv{$C0Y~=?eMNb^7EBGGLIt`669A zlaeHzM$$1+-D`K+pf<|kKr9^v(z5p~uNc;oaxyFqmA` zd8@=_JfRG*AM2Zn3MvVUz zj>NV{4@sHXNiu2_wT(=g%w6}$*0od|6t!vJNsc`MwWY-m$c{av8f+?|B`7CdAg7*5 zb2IzO*}F%ps@1Z@wnZCw`#lX=x}}7oo^tE&Iq?L5kWJ(<=3v7{{4Rd`Cz*V%Ae8N6 z_jc-ooO%}dSsZ<=hAh4C8U_ufrAC*pksI&i=a(^i7Isk1{TaSmE!_tY3QA_4oO*`T zSL*Ic%vwqA#)RV;GERQ>b7@~J$DKw_Cz*VKWM-4qRgW9b#!WbdnNz3_&{V|J=`~({`FqSdBvXFE1{*5>2qfChpD{CER& zpG5C2GX7La%h2ZC1OjL!2YuhZ?+zFL!+}J@SV0mq_~ku#s`b-pQqZ2Gj%MCxbRNXz zzh=@25{|%VS<+(wU3!VfBWvccVY`}!e)<7tT)=5(Nv~d1R#IQ1O+FRX>>@^wgAKZIouoPS-8UJ09C!bTnjH)o!_a{ocZ#<733xf}3LQ6& z(rt3ZZy7TV(CO3VXIIIUztnk`2h-Ff}gU_bpikFivq+d@NHC7K+bKP$lJFZQC%VDu2wbh11 zb>ChM?q|<_5bEo(RlSWg`%p`p8}!v@IC-+%`bX*Aot#3hy^X38={{6$|1&9x1bj5s zVF&p9eM&Zy+JUprrE4ddcp_Qtxak&>T(s-O*(d2oZ)-!9E?$K9AnTTL@BsTOWa5Ps zWpeIC8fVCrzm`FxwQ{Gv{|*)VWbjEcvcHTwj`n#vYyxLr&cY8l_Y%4BHh^jGk(e#_ zJrW z0^8PEA4#LdgHLhtG3?nz#a`WCO4$ZoyHx9%kPlY2;0Q69-K{XAq37BMNLXxJX(9ncCo;6GL(Z6eBgF2niqI(ZAb`0Aq z3*!BxRXitkd{IqK$Bl@`4t7-q+b^R zms@vi(Pv(uOObe$KAm*w5_NbG5K|2s(?RKWeew~iDrDI#{`nS@&!DJK@`J2gN7s>D zG0Fbj)vR70S!AzkAU6-7uAbZu09jd7?B}?V>{v#{K_*{{vxL7sf#p(%69f}Xi3aL) z5O%!Vv4M=fbV$>ZZQs7{M86<0Xd9~oLK1S4o=0P~?%1F&KB{}SlU)Fy4#LZRPM0p2 z#)<_br0Izxb;d`k0eqoI)m$Fkx<%i3ksZ|}B*>06JpUMeQ`gPonP>R<^}6E&ef(K~ z#3bf@BHNnjl1D-Z3e(xKPkjfu<`yPi04RpG_@!MJtY(_)c;jJ84#*`Z>#r}-ZKdHc zh9ah+hG2-G;&3y#fKT58o9^iZEYuWVJx@N!y3N=vTzw-Wj-f*q@4v{$GvtOV^x+$s zIv2p#OhyiPa2r~+1BV0CjJQCXN{f%|Vr-xKn)&!`nYm1E{Ea^LJ7z5gFx~V>#f(YXFph2L2}yxVj5xq1|iX^&2;Ig zbKlbk{)RJ&e(iMn$LcVoAwWht$=R5eG&Ez{Y*=ZJniTMsvA2>F#_7gcG}IzOFi25P zP8g{-T*aP>Zyp!5doi;a)}IY)05Ke(qE0akOeb|!9N0%uM}YW5)-2?%-!kR|UHvZ4 zyb2%=!6YtK$8^-W^TZQ}IMguk#It^#{`D`~VzYKGe}A1bPoYzW#5eKjG&<&zuVt64E0EJPrr(iEP=Zk3UXLgPbsiSsxSf%gzez+yhMF zGbO>p){S%@OQuLtF6~9{`+G!h^4H?^Q`}8(P+L!7C(Lw7OJUz$8QF;$(@>KWj$-c1 z%w0u7A|eeL}MzV&TYqwm#k@(KP58?qQNV#J8?|2apH2+S1B)<=V-n3CdT_ipgx zRn1Jn=VRCy`Q`1zdB9-bF4nGN(`uHlq02zI;COxES)B25#r1OKb&{S!(83B((48@Z zblyf1CsQF z|0V4Uv}aGcWTK{6PDT%9<`TT79CNjtKT;q1haCzjNU~B|3XqXP`EG#9CQ=f~>`7J} z)7MI7XSwSMshq>|68r%)h~JMGktH_EA4!R|aRXbnv1Kb8w|P!Y*`0Lb5kVkXu!v$vl%>E>uP1}Y3$xCdzwghv3VPSw~1lHUg3Z42$SesDJXEraDA_3^#!207>b)FwCM9dwAJ7z``Tz}$ z1cdkmf_~YwS=R4zuH4AZ-O^(W`PnSkOo9is@mq4*HJmeEpMSbdA0M6#xOE`xD`oX^ zHtoj4bGFxBlQ;3pKolSEQF71aPOEessVAAV1daXkE_E_|Lf+lh0lq3RFHac8rB z6_w2xie=$zk^Y0^mS2;Urd_*GkV0MuJgKzL(bwN%;Bd79n1W#ta$s5Nj+0w{%kUv$ z#ml&(`S=rXVmPoZT0)$20heCDsGsq`?|ABNLXeh1)j@#f0I3NOCl5ZYr3>}Nw-`KJ zetClw=dr&^0jCgXj11rwFP(eHHP_&A(q}XrWZ@dkNzj@a00$TjwrphEcGhlVOPSpA zPaJ!B`vU-X90>JZ1>%I-T0p%)+#Wst0^Pcb4O{4cIuG5=YxlErKY0Be2Fi0*>x{D2`{X zFR;Jy>$VmjUAQ^W#_m71{vRVoj2QnreDhOBfT(S#cw8DE$1x}Cz5itKCk*H(87Vl0 z^i)7nlX(9F76dqcBBzh$zQ5>we<0wOj-APlCoL5tS+lp((1^!He1e=hNniVfuHB_- zm;Uj7G@dx8q@+-~i76jwUS}EDSF5)0;3JrEnvo!u3rQs_8;41DD&8s{ewLE096cF4 zGJXtC{*}5WPClMhbLHp>`t+leR?;CCL&;4eH&jB#Ez%~u6V@9J$KS;JSQB*r#ErWJ#yY;mifEYGix{{M1z5D6LWpdhCdhegOVY&1fPeCRo7^b=%I7H%-&?X*z zRLc)Y_r8EknxN19U6v0e)zEqKB+Y@gFzF2a$Dg^c7Be1CNZJ+avB$_hAD5i2_x+2{ z;^c&LG$+K`O)AK}e`d3~GliN`42Q-ii6TcIrGL0rpH(!G{yo^b zl65=9ir36U7H#C?Y4jPv2Q&HSBhoorjS$bh$nI(;pT;xKF>?V;`*9{Q@pwLeP{tp{ zJ@@nUb9jPk``EBr&b?d@tk-v+L|O>OQ&+*v&p2ixWBT&UBMk3PZZ{Tvs$D{sMIUY+%N~N}%ghZO^NKB=48zBeXdLV)wWb-)2Q4-qnE5q9C0MZ zQCo$$NX^Dujp3qlFHJ&vK%aeC?sy27P_c>KRrDQ7u$m3q=rfc!XlN!qlj?oA9Bke~ zUMGr**|(8hRXSj}IGWkH9V4EM6cV$EbF+W9W)zA9sj48i_=tr78w?sN_{|;s^-1ER z-FN35TzeC_nE*BAv;@d2LTsw`((I?86D>9D*hRN~_-d)CBQ+Io1BRQ744fVa(b7U< z8l{`HDJY#fV_C!}(Oiowp6W8Ze%j@8u#%unX1ea&DMdX=O~&6u$RZ(`x++p~z~W#9 z4mT-T)b1xG8-D})_K=ZJdIpWvl$DW^fxm%<7WxhXXgok^DOvdh8`!s>A*1lsVtNSq zaK+Q&#S}1UX{Nl4j2sd@BxQ225(D<{CoUO>#jd>!97%i}KDlJ+v{};XoCLz*uELlL1qRyg&f?+>Q(d`fy>63gzcrV zk=$ZkJ5QQ~QDgAd(&R;joIILpsV*lqhqP46c9K&}O&J;OShE+bzB z{up*{qM?Pt9M-I%+YtKpr=^jD2T+UTZ0vgK{p4h6**+=k%+lG^)YGRgafzhFvttJd ziKJ(1ZH=TR)6fJqSsmC{LSZj4hbn_#Ib5K z<4&M+XMoM~bnzNaI#05*sIOqkJLGibnDNY?#(_GHJ)OFpI&Hcfdo~^)AAG>DGsw(h{SpR@XX_GXE@15OI9u>~={pX8E$f!DZ=WW%BN>*imtWq7?bE5R z(O}3K=dpUamh6?u7vrtMOd#IDmTe?CbmmMMc>;a8rejy#v{>?bkebNHuc*(EGcTZYJ=tBT-Hq3#YoC9g(t7))a{g`f z>B{%W0}$rZlCsAam$cgRr^UH~w(T^GT3?{`n6x-|(6*ZVhdBvk#JgWScl7spoW$|~ z#E20i#!rPKQvmkXa@Eg&?4te`;BTPWOM32q>VDcbv}c>Q3I>hk+;%5_d7@PT&^vx7 z*Zq=qnLl{u>lahVkEud#{TH+(85Bol~h$#Rxy<>DF zZPzv&+qP{R6Wg}!Of<1=bUd+bP3(znCllNL`nj+7`%`Om*XmkT)hG7e2loH+8#PkE z-ucF^;#Y6_*Y_57y~cx6+V|h;p~!#h z;6GgT`=7MH3=%9>ryD6Hf3cPm6mqd|`gEq0AvLaWR`k}SLFDPcDT(!51Bwx0R~65j zHUcv|z{a;QmQcx5fL^QKkD6Rcgk4TEDNDu$v`RB2Y3d}2&!_aoo{DI=l+&KMsGUBn zqtlvn+=lIoM%4e`FjLf_prXbat}w(d~3Ho{=NsWG9<2y8@Zb8zIWYNP1_33x779 z!}Tz+mHu-iop4!__@%JVir}r-HNpQT3B%Lu184geG<*C{YIaXPiS9_Pvp+n0gS4?k zF`*~iv3?uYNGK1gi&1Or705P@g^S!(7PF*jTWO{vE^oN%j?^cmYC?9)doHu4^HoK) zJ2WBT^>$TPG%2uBDn?UQr*%sR~j z^=z`{n%soTjTb?h>vJDN@f{^QyI;qvd9MW;(P0zvG;^65|Wfd;orgnD=O zic|Z|A7=1=KE~}QiK74oj$fzC2_Y64Ouli4ZhaPwHiEZN=B4L_!^wcrlY)zlf`!uY z1}k*9n|~X{|5$7WxE1Awe`P?o*Cbhd1*X^VpKQYed0t5aik-%I8?6WT4Ho2v7ONx- z%+TlKPBVWx7P(k&d1SfjyJCwHNNJIbuN7mx?$}m)LZ-JWs!HvN<3z+|6!I$pn*w)D z?*Hsh7vl`K$}3FoJ=Wdx)qI{V%sp`-A>A0j%B%Z0>Pe|1?${b#E2>Oh;k+M4cOi>aH;_?KE9PJ#w4Z(Y5gNSU+$ zjYN8v(Vn!GwvCqi$Q&@6!Ut1phWdG zcXk|g~y_C+0k{uDMeRQNpCCOvPoTGtqbKR|mu zxaiZ}A14BUU5nyI`#)xeQwr;Pe%JyivO3*)?={QIem@`23MmR@Df}#9(v_d9s&eiXBPQynnvf4o2&3>GJCGt%Phkk`wc_Riq5M;+%Kz zdW|q4<<@;M4Nh0eA9gAcr14LQQNR@V{AvlfVXcba-JTe5`ErK5n!|R!72l9ZSBmO- zNF;%76RLX)ZNydzEr+~rXI5-K@%+4#7~d`?TrX(leH5@6%%&J{y}>N1+@4HNQ)_-= z|COPZ@s56}{PhIM)Glq+L#uawl2Vr-Ec<9k!KOai5=D&Rc2_IvxN>dcmMa(kqv92IKKgeDA$MQwqZUoJb#*c{) zWagjq(t{NrPDD-F`a(SS73aB)(!UHITG}X({xO(LO8f0P+BnWCm9p3fRAJQ{^Kw>| z%$F*8V)>4IDmmZbQc&MKgj}o*{;f#fmND{IPeB`F^}4bEG6+LMoi~+!ztQ(#`5kb+ zd75pg>hy%6`aRBg{>%?0eAf|(6B<0~F0+oJR<2MI9{P7#p8ooCtwq1meybrBN>37b zekBh(uhFKKsJ__q*(sxo9!uJiba)OJupEy^icnCh8WdXP&`agTS1Bgs$*TzE`7?w_ zRdU?Uj9Sx}+(OByeOhNNrm=e#ShlbAh?GtRhsf*o%^iR`c4o9-#-7)fDF7O%&o)=q zT4R)UN_qSKD(ST8bsnAnRGQyMM|L}#K36(fq^-`R%p8834^byb8~|HC0)0Ca)^5vT z%r-xv`J5o8;8e@=(+7*=Sek39`?|ATzD_iQI&<=u+49ga9M~n=bT5+^(8&Ab&+Adh zH3Ccn3A~?fbX(pxeZ;WK(jrs|!r^s>Wxgb%@}`6G+wbaHOi7?cI!^$9t^~>jUS;Yq z$UpaVdffYh(uVw>6X0GG8NKrR3VuhJIa8{e;0f=eU#L*CI%>r;G_LcYbt_#K6RlsL z?|36^YKpRzXIklmAFXX3{F9D4v};kn=Z1NAo;I14kKuiFRiB9MTmLJ767mK^$CgXG zDXkGwml+fny`TDA+s%@%Y?B>?pP$$5-j59nA20s27`UD9YQvFvz-LVVl*O-fvkEJ= zNJ*BDLGC*ka5m#}=8H<8CPgiiYr3PPRcyUT{24GkjNN3337UqqC3915VK#!=2%=8O zn3p49ixio`LukJyt-@-NZ81wC;1ITcU33}GCufjA@ z^9FmDxR{%#Sm|7~rTfL+K`H5%tepSSBH#?fU*@v)&io+?%GCCN_m^{p<=f209&mxwE^pAAc^}X}cbt+*^@Y-b+qutP z;W%&v1$2Xmzf?LkWMnd4Lvug^O5${M@Qjos7{j9YjvOALPuL=fAlZy@NPa`$1|CPM0)#avvxjc5bxT zvSU6jUaBem;X_i@k@JNo?v1HLAef01a@`zH-Y^VTGM*)&-Jm^CJZ@J5eO&&zALcr4 z^R^sg{I>#|&DgnEK+)PJ3PB^i;J!>oQi%Ht@PA1_m9Egmr@DI5eEb6QvLJrs3>kI2 zMpf|~b%^Bd<330Gn+L7|jZ=@JH-OsI>!_m`^l6FEoIPs?+_64m(WpYd% zztz(nH~&s~{@gz5w5Fr&a2?!wnRx8RmUg7ZHk6XR``$}9ZyOB0HtoFUr0B}MRNKE# zKKS}%rXE*IMB8Dfw$P54L=DqHR>Z^5`%3s<0fM$?4MJK&g`dtE2EeGZX6wMdp9~uJ z)8w6!H}i(AISfj)8AAFm6na}=f3!|@WO`X1nDuRg5BhJ0$DyWPRqpD+MjD+Nj^0W= z0hi>A;y}i?Az_Obm-V8+l9=*3aAzL(1GWpYX?_`_JUT_Ol{(6%jK-~93i4dggE487 zd#1)a%KF?HD^}-XiZU~(_Iqx=S8v{5D0P05Wj+=sbGkdlj&0H~0>wPAt=31nnpnHY zva)FVBNhu6gV*HrDLTw2Wj-g_5{AUGZ4EBSe%=jcL6Jt#ZUd?gl_t{|RJmj=%%=`* zAD=NT^u+3)3>0f1ut0#-A6Tm=T}A@fcaef4 zepsj_&y3@9sFd$SF+Om7Ls*JC$DKDQ>sHW2LWFj19j!E*Pz+BPRGIjzI_(@~VY(K` zr=XJ7jDg67eskK$J1-=dqb;lQA)=s!ijp8j|CF2s9!$!!nd)FN?#6oHJ_3wg|HAi@ zE#~vnpR!AHSEogdlE{)s+xBoVk3Kct5Z*B#mc~3NX^o|MvQ`R{ga-{OT>4}EiJ=Z9 zN0Prlk>M@hp9VQuld=+&Qwv5QE_#2G^rmLbcD@w~h&iNl@rnGI42XK`S)=ADuDSh1 zY7YkSLoU%UcePV_VjpLTIIPi6;2SyoX^@2^DOH}1&e}%gqqqbd4@O#+k4HwPba>|X zBgO-&7UMZLi%0dceerbh@f@1^MPes`ydO~hU=Ui)x)pNLS0**Qw_LkkTtmd;xf{ zw1-EsGQ2dTC$lPAlldKnh5?3ZAI%fcV`BiIH{&e{mv*Fa2G8bV`YAi|Tvg)clX~?L zFe^b$6c+ekCo`iy{ipNsXyVwh_x(ZrH1;B*Ki#IeLfw%Y_jNOa)bQMRUIj>k|*wfK8x}A8U$QMDPpC*QI%2WB|-{VeovLgm{9Y5!WnRolFY|b)i|1bC`rK7@~-L1l(0GdjeNXhEJb*4+H zdpdEVkG(YEH0hCDX7R5EWNyT0I6pk0=fq8tnqQ!N9woK0pK;nyNW|H)tF18?0=Jyw zFDa|7Y29fQ4~z87vn^Hip;=T&1gWv|V5A?Q7m40}%`YeGX|U9dZt)a{DmlozQR(Y^ zm3AhMuCnc!|6^31h|*B9q2-)vwCFm-WIg`L#@}ei4t=(!R-SHB5qoYrkfcIDZ4gBNgOAP`cMd)gYu!(N9D^29%ul z5v--#^$vHQI{njKw=+f1ho;7K0c*gfSCkaMP}U9&ORMivg>XV^p!jbf<>7M$G}zza z)&z3we5`~!Fz?_650>rsiZVD4%3aXv;vlsmC$~hCY~b7ll@c_ zNG|eQQeSLzfWBIE!hq>L0YRH$Qy8N+fNpf6w|koHVn%E^#C9318=oE#)w8WAPnq6| zoEgH{>Ov-&mKhehamkO`L|CpfS%5NVGibX?jlGH`>OWU=p)N-Rn6A0*aU$S|mYICq zdh#79fVk}5om@FkSfQs6J+`q~J8N^NBvM92d1Zq{2>IzXM$51)Ar+89Z0X8MfqO01IE{c*! zn}MjzHyw5wO(cS*UKfZlbK>1{s8u0Bq>^;b^IaMm=PKBD4_(1F1tT%Pr z@5uFTciNKXDV3Qid1JDfg{!M40_bil9?oc8g#5lBxf~CY?<<7IPRwlR(nA?ECyN?I zp%D77kACDnoQK(redzFcav3H;e~I>};n|}l{+S+%Sza=GJ33hq4=!#=L52MD0mZ2h zi^muS>FSJM;MH+Lw$>Q*hd`6T_*GUhM?QX-y2-+*C7!r{@;S3B^gyXVNh#Vj^HJ!Y z%k0&eV(j|5XmqlH%I~YIVK!vgC(T z+B&)B7vAmhr|4L3E3oh?0~L*_cqN;!QZ|!%pyYS}&hkG!)bDlFIzHgG+GN6WNnAk3r%k^wUVX##U*Jy@2h@~oW8|2+!~ru4Ix#Z0(yBmY_DqVn z-W{5fzId)~qgAH2e_lvS*jK@lAvtB5f|tf7_vE*nLN|dAfd&6K6N**f+^7h;fj4Ua zRJLbQ_H@qLMP*X9e-U)+Z9m2>zUw~EZ||HqehTXBX8XmNmy};LB4{8Wfgm#CBI-7q z3M#@boMs(Ir8~+!zXz@^wwTbVY)&;hZl52flPK>wnsRfzsW!C6SJ7#9$OwIsa%t(Y zPpWzMn-1UXbOa(Q*kvX#s${R*)!3qsI_#ZyOE6x zTIw}g-rUpF;U2uKzqDu6y`37%QYMSm} z>T_}wNjZ9mlK;$roUk~wHsDWqE}d9yxY(k?-Vt|hQ|FlPhSp0@nH8amPfDw5vBKW= z%0|>XtUO=T8i#j+LBd^^%kvFp^s(62)?_I0{I1LF>@+Pf_sDM-JN$fjWiv&QfnB^R zDos*PD8`f(AsAn)*6aU^HZEtSl)I|YA6g*rjBws6J0qGa9AX21!l^8Y zv_$JPfe5VQ5@y^sm>*B99RpK%);;wnC%}^+Z+)5#e3)eJE$n@|T!d*jQjt00b->V* zpX-u)bq?hO_r7A^T>kTpoJ5VjKP9}7#j@)ky55d3T&H?BbZ9yl@1xpYSr@D(;gm&& zOt(V+yB-1`vT>I`UzIsOYgRdd7*mk0P_~psh`vvl?-LTG1&~s|0XQ4rTqG>+NwtwP z-)u;}Sa~jMYzS?dF&P%s=?%L83qE3VM@r*#J!RH@VU=4+PNaKr~?cX z62E)mSpJdQnL9MU6Z8cM)Y81PhXt|)gn>!watpz@QGO4l^3viy%Tasn>rNROD{Ew-l$Uws$dBXNEaCjDm1wLhux~Of~X7M z3y{`*mfJUJ>B5qzQmT2j{?dwg6bedGC`Im7g7P6$DO)^7h4%gWk5wR|H%7$>AEXRY z2HmG6WyTIPo1rj+hJh4eG04{@T^zxUARK6P_9J#a78#2{tn~^OLV%ufUxli` z4FysvQB~PoZG-|>$jS`NPq%h{Jc`V-vqC6=;SFtsvLlJ1qSFWR+;Hzbrld+6Fv_g8 z+k<%w!D1pIufAS~e|vKRr6|RyZcpf^u?Aw~~+;HwAC#H(Zf!9*xFkOJeJ!UAPsqt!uC;f0GtIW?} zVj$ihY6T&1tOiKi42#Sr@PoG8__(w?x5K`YWe&(Ahl|u_jz}i6yYRqps2R!W!$rxc zUrUMQC4lbdP#~5KxQiiN6yr%Q{nE z)RUWd+9QVabpTPG zj(aF58>|G=pikD3(}x=+9`F_F0S-Pmzc{>ffX38hK&hk=?EBMv5B@7}ryIZ=W3B{< z$u)W-lE)9?ny-Puc_*J043o8i3-h&o=iECLDRK805e42G=3*anRAu$JGvsd;^F)v; zDy$u z=~v}8Z%EHh=>*3puUhh;{~_y$@g&HBJhQtA2Gidn7uHY9H$tIwl7|-Nb$wALt#Jf} z07j3KQ6`VrZw#b_W(5f2P_yZg7aLQm50WiUFa1C#_kYN#asLxAntovLB-8xZeI6k~ z{C1gSHvdZF+6w{^Z$LiBLPbB&W5ykMi6X;s@Qk8Zi{f8?7uGq9hyuksW@|*>>`N~T zTef}yO)C9S&WobMEPcz9{n1|-TTI-A`5(JCAd-9)RQiU+v*(`>IV~<-q%8-Cg`KrB zXuY~b5i+3|riz9NEOCBxbU3+Tu=R@=s9^K7pY(JK`D>$mzb2+QC0ZN}!Rb7T1SJ8| zC``zzLT^IvnVJhqKbru2E`v0iFQ%s2?IG-+*l{9!D$dc;LdaS8%GL0{kI z$vrL#yd-H22?!D8Iq8G-UDth<8)%SCA}~@7IeGLpJQux6i5PC~20~#o8@Oljn6m0$&LoAD;2rMdk6xL?JCc)*HLzfu%h!8F~rZ~3X zkq+eL3#4!&a)hNBRHX15BPJx0L--;RabqY$nk-~NSp-NJV5ATPRIPC)fkEq`gT=ad zHW~{g=4RsWD{!ON*!II5>L{oTdJcL7!8l0@#H{u9lhz(qaq`*HLz)TMz`{*=e#>)( zlliSI+!>5cgzq#mP{J{-nJv8_!vUpnSQ%VSgqMJJYOOI8IY~%zk!ib;A)5WthYGx~ za$GDxY_1A|To)s0Y|N%xj)$8%G=r2^|?-O*j)CDxWw) zJtf&TE*e%)10n+d+XXhOI0*iQGa`b0lsIUDY9pPOTPHv4M1q z!uf26kVyl%KQwXvf5*g=*dRv8VC|ogJfQnQLB62QcJLq;0;Sy zsB#))l$!YD4B^^1WHsKAHicZ_lEF|Fl$TAfOPo9g5#DEK6RRDB3!wQ_wh$nM2(Y7+aNKw%tkbHXoDlG=4UC)!{XZZXG=^A|`3v{LAa9p%>P;ij7=LNUva1Zk z1XY6Di~ng?K*bkDiFJ!xz*6f=xWtSocQB^MQyomaxnUX5Edg(kVB}QC0F!LD%?OsT z6OI<0jgQ=-3mtGRpl!94#>7YA-*=6Lvo#Ce5oZMHMLm@Qedw+2WG5YOK?qt1bSRIhGu_P8S|jxQeDpw;1_UR1hvQhK1fTs6d(|NzK(;6h{mGZ0xwVAnS&}cfzq<{V_+00+zdiNio??c zA-n6@pbSqD@}p(=0`~ILiaYTLl@e+#FRtF!+S&xWaIzhjwg2UPx=bJLE;z98pZA4Q z*8eS+idLIZMzOqKPRu=Dm%Z1L0iRJu!$|~G5yY>L5@`YNhtgMfoJ+5*t*Upq({HYC z2n92Vb<86x9PdfKkA#0|r9PI@wFn zJ5#s|+|B!&9o%D5-zh9yjs@WMXqfc)=llC*6Yr(+ipCe~1?YFlrrQ9S8Ut`3z$h{~ zkKnrqK=Xf-%Jk#-W!a_l|J`&h@DZjWpPPGXY;7wZA^k5zhyUBAP*@@Vw?%$oM|oz_ z{ubj3ePsOqztVa^LnnzCRM9jP3g|CXromEU172Ae3C^)>K@$-wgiN@$doloNkOdD9 z&wk@eN#ix~xWQqR>}3>q?U8RdqbqRZ4LrCo26`+_f&cvyDZ=bAt0gKbN7K^-uW_#((jz(ViSepfZj6tk8G)ty#cDBk+a~0dDw8a43O;7bX{dc)3k^enq9-b5mmYC|NmZ%X{y-wA5$K7*|TMz6;UR^^Luspe-&z+Z&LqA!a&@n)pkT+ z^{D|u1z`vc0Uv(S`c9WWM{BGP#wr;t*7;w7bFKbjK_~(PW_k^Pl#Zv6me*le*}flS zuusxK4lSo$U-vpCu*8xlA~~p}ygbAij|?Hsyf&_w5xsu|j+#<~6Oul;K+Qg`7`p{h zjJ43l(ILuwmkj}>+WF3qLf@Z0CzT@$jXqgBO&V@>8Dki4T7+`%;z#g4h~A>Ai!={4 zj#Zwb z#N8i=#SUfCJX%@6$%%j_xQ>HjL{exVxsbJ&=&V@7>;|{z>&&%hu8v27Vg0iwl$6~SJFL7qIP0)8SomIM4kOlF@f{jrUuU05oP zukjVd(K*g`WiGy|=IE2w>(dr)?>F1PT3AsT&fL&^WfI3~jm=xz#{LJ(^4R)b-J1?91kS zJNNz=Afcv7b6N1FjxpSEZIS~dWa+RKMsPQxKax&!k`|e0uSS_9{*ziG-*)G9G540N zY>SwQJ@^edX_Mpf6m_T+=^^grWTL>ugzg3^t6TpJ1SMt3ml)iMCf+Ou_s!qGDJRut zTrGqp3TFBcO2b-I9~?nd>QnUv+f~llMW*h;+{Xa_6AkNP9E839BQEWbjs(UWkaJC_vC~cVssqrtTZ_Pt!e6lqQEmo9q(@YiSTRgisd7 z{wC09IH;2ZM1)oU%nkLfVApjwvWzx=J~qpE?+JxPBfE&K7(RGU5qmQl|Btbl01QV6 z_~slaO61=KmuO-HXSf0}9d+`k078`|_D#b*e+0SFW`}QQdRj?0ly#E|&HBQ9hm1s1 zm{K$}gp&BG07|J!5EKW#Y-xBgvm(Qv_)fkkm&#R~gd9nkXn+$vi~Hqm*cl`(H?&s_ zZWuHWWZNI`0R3mfyBqwUOMWtC>l3@LT``935`_}Bt`dDTq6z!QE8Cu(W zSLfwz9q*KE1e?Fmf68VwMH(5Bo^!F>da+QDsu=mE3-Mk!{yUmUZ6AcgsxYA8%NWGx zE)?gezG+X6?8L0qcxj={@RmlQ{sUf|ghW<}%?s>E$3E=1biVG!y0~z#l2!cMgEjS;*V+d5%l9&>bsfSKn6Uo_H0#L)v8dKLW=a zF*X}7=mG^L++E(_@Hm%ZbLwHj^{(jIx2t;dzojV0ZjsX7f9S_AV`aYox7P>{KP!X$ z_KCv3D&PhB122trTCQ3`m1UH!=WCiXDqoaGqr@_yN25WYA}rn9HBsh|m+Jp2sjVv| zbnQ>GrlU_ELtL3FNa*2=QxW97_g!m=NtvECKtEcJ!S(69+MXN?usY)M_DCEDG8Do- z%#yzj4B46v56#>*utfb83C47K6Okq!Pd!gFnXwIvTK@i%a9ulky9r@)VUd-cxG4E65#$KB}`_3^f%yF9kO z=GqS&wv#etiJ8%-sZGonMNZM#3(?Q4de<{Ky;<YTMJ>yL2Np0a@g$ zgN6uge+Dt{zqH4V7Tp5gz##@gxGuM|*Xe<{K9DKp^3P&_9O&*~u8iIBg14nh8xJ+z zrETOdI}%UTm6%YfnmWL_GR{xmY>rML3d5?*Z;FE50Hww<PR^BV$%M3A|&jA`d&-9=)1@GY3)zRCfddXJBKU76NhO)egty4L zZkhF=vX~2v$N<+GR3x~)_p|W_OXFQ1Kv`K3Y1w`jpE;fPp2wSqeB_jv=&+^C;v6j3 zmu}nPV!ec0pNidbY&-vJpKqBlZR2W=_x|@WE3OUN%Sq}wm{eYkC;+6s>@iDYqV<<&i3mViVQYtd95JL5lfr=srz zttOoA<2ax1m+^y^%T^MQxr9J3U1>t!2!p1hgRR@8AWu*kq$!74NTo4nfT6M&NrPi6 zUVK9yooFr2xpyNJ=v)t=cU*k7B)<*Cgk9&TBg6_4!*YBVKHWt4*W|9^ceCr#oeJL z^e~4bF;fb0!tp%RE1fPG_yyebeBcJ+2%?Fw4kGrfoS4cV-+C=M_vBPi#Ma9w1pMFX ziMycwZ^c7B5bpO>1tId2bn*kq11sE1yQtTxCwzPqYly6VY2yP4wP>j?_^B75psN5m zKrI={i7Fo=sOS9J@kK{BF^-BEf<+AOJ$}xtrZak#J4D^&#}EC{X;+4E*yIjB4Eg7k z=snBr&D0fLWXU->Q#8R);DOn(J-BCU(Ka>Q)kW8PQu~oBBj6_!iV4}nP(O#@Bt`>8 z%voBl6r1A_F&)^MTkFWF6>I;*&Jz~5sX^qW%M_XKHrcPqxO0|f8~BvlFW+^m&JtAx z2l;s&87yC!&hd?4gg#@@Oc&-CZF}~9Tyb?`Rxzq-QDsK)xz=;}^doe6R@oTSW$e#d zbLwe557th!meWNOMtil0Gae1xzuiz_+NjlC-`-37`t^E{AbfTII{bnz(2|qQgc_L`!$1!v??tHe+reG{KE8H{2vtv;ZsbI+lG# z;Hnpx?;JmLCKj~?XhM(yMFx;)Z^3}8#sc}U>#{u34O zMQSTgHpc?=M7M3Rj3PpbDlD=^MfDa(g=H?tqIyTRedXf4MBDZTpeqePu->+w=;hsC z9dlf&Vq+X8haR>rtnt?~@_H%%eXf|1u%Qjh1%cIB@9I9pIvI*G$7X5g-oS49&R6s? zs(oiHv7j@lkayv)us^IgUTqYMB;N<1aFIlXrp-n6gNw_{4+NQU*rxAC{@o8;>qPz` z&Va^yC>=+_W*p-g`^Oux8t-qLov&9Ui%rW~8N?%^iGSsm5Uk2Zi7D_*nOTOd#_ z`A&wB7BWcGyk~$%zpsgJ=#2$a0RL}%sg3mjJ*Rvjb}Sfv<(%;Qut}-?iXi%~A29Ib zT@PEQ6)e)~Sl}6;Svz`)Mp9f%Et~FG9L6z43oE1$KPbB6B>{|qi|sY&8~yfKU^=`` z!MO-v_&>-^;46*e(%}DbA?O?3NRARc7q*D5JiYk0AvX z_?pE&)N2z6R=V~Y{$g*!+KW!fHw|5EEXoRBT34HE31GMVBwnUqMBErAbbY~MQ5Q$( z7bie^O0DubI$`%ZkWu^{3mPut*Cg~UheWtH^YL7xkZ6U7yX)-n)T+3d?4zgvm6GdY zCUR9j>~V4#6qofb$$3MT;xHZ6T}k*b;VYMxnYs6Q+eeT{$=~0f1_L;f5g@?!>Y}6J z@_g^c8TDF0$dXf1QZh2MwX{5U`+{;VE`TGu*09@lWjgmb*VE9!phmj*KvhjuRaLFq zu+Cuv7B)&jAPjw z?h`ymrUqT2R7xXkQ9so*r!Sw)cwKZDbcTo>_p4bCpLP#+e!2y5wcON29A&1vFDm=K z_lbkY;)i-41}Z%hC#s0Gcr(`W2))Ek1O!nF*|M2QlJ&byu0XUIM-m zr-|6si`%l5UT@^8UTq(Dd0%owYAb9ONQ=skUM7AvuPcR002dht%EV0+Qf$6l2hL2d zHGc%L7&I7UaT=1)@QWWuK9j1qM^5+`0DWc`IYH%GO-X>cnO@cVe3XIr0of)N%}$ZGnOpOePf*H7t@Sl%6Jwd7+~r{jq+i0}Amdz~SS{Uz!3_ zcKPmkN97mjG=os~)Z?g~1|zc&Lx7KL*HeB8r2Hg_R9wL@0IzqMFtvf){hmP{`Pz4E zrf&2!DpZY40b$r?mexqHwj4GwRN<41)t8)Hzpzqn$h}}nH?TSL9qo~mn-_!Nq01Nt z%K3H}Tln=brSEF1%jwVUNP^HCj5Dvno)f?O*~29JOe`+@2*(s~UR(n|aLA)8TP&Wa zYGM8>lID}0QmMY%&r1pb-Mpuw(a1td+4|0BnW)Wem)EDdUW|Q3Zcr#DRjN;$N0M}X_V!8td~w@U%%hy zF?V0w-Q6`VDDpe3OdBxwe#{R=p|4cyeCFDH28hf5KV~XnPaN3It{Jd}7->piAs`DS zd0G220s)gONrS=`nQ>3TIxZujS+cLWi1e9qABjGkFD$UXKi{7t&f&e8ief}S$VlvO zZ$^hM^dBV&&WX0l0Ipi|57EAvmgoDG9T^es&qqNvpUl>uYz}x$T(^H?%*z_Rt9rgk z(=?ik&&8Bn7l_+WtO)}I-tivqajPq4feve3@Sr8d^1?a6%s+By0dfvyM3t#=d#bF% zcXs&qI1s}ah|u||n(3pnks_{B>Kz`Ok@HFDc_yWo`}IKUZf@H7c%W0g8Bd?- zDLhy8CH-3tSU)mU6aI+30&jrZ0Ytp$SxvK6_?l*aW5DY>B;A@NNH8AMs8Wo8(c1Z*C(0R z?s3bLcXsT9GfO{?9CJg)0AB0k_xp9~;*<9lVWVYC?V0En!K*oD(N3WOmCy6p`?cDR zw84+-fXJ?^msQz-J4oSa>+{ zi)f>sMhy*fU3vB7-@mr$+2@bmTD7{}rbjKOr>A1!NP_p1?A<~}Wr~FCY;3JgJGUS3 z%$k~-JS33d!i{o1F4`rlzJQw5r=LpLXJL*@2GCDaZN& zgCPO06En=+52t0n4SRft13^Eje>?9_04GKOg(JTLxwW5E?-@_o>y~2d|8cf)gn8pH zPODCwuJ)J{_MMHhR|~9J2*7`cOAN>37>k>YFDS zBpCW~J5u|Husecb%eD3CCH76g|FR(6-@T;d$^CdT3dJD*jSRT&Cqv){)KKd~Qf17d z#odz6qO~MOy(LsiPTA|mX6_*1s;ej^>zCp&=%aNd?^iB8!=Ns8?QWf2#7aH^GRy zuV!`ul=$lM4A3!7eS6Uv0gK`7caCx2(2V{F(Ajvr=UO;STQ_`;FdZFtA`%ek{@#S` zy!rB9nBg%AfPLpi2kN@1ARdV6c2t)_rtXXF6Ay8()zB$_U9G?5kBAYA0?m&YbG#*- zLQ428qZEfrV*cfGZ|e>M;e$naKR6<1S4e_GwtOB3=yiJHd5{%^s!0F}JO^472U*dQ z9zh(1W+;!7NC{Z@U@8u?k&YM;{rQVCxZHu``x?=~YQj4(j#!%rL|-3RwJ2u;tv__? zqi(S)CKTji_yh%>D(*nhBtjprcz1{ixPfa#&LfzGJ-=r?C3X^)Ye|D+tvAf z+>UZPF?GDxb{YCyy6@Hsf1$#JiGJ+NQnFXjq9EwbDU=M_TtX$#9>p_v(g733aiMJw6CSy4tFzC-NrTqtl8*%5GTb=K z!ivx$hNjx$KtLtVzET+kLkf@SBA#4B7mZ``Zox3Dsvl`lZeg;Tfz%*zi4x8jZk&y0 z2teEjhZqPKZp8^-kJPr+Gv#UMZzTgzn@ZhN@uJF+F;z#?0ip}alXIVr;;!LOc8K!> z_;LMUO;H}IEQ~A5P3cV|#bDNw&O@;iE=d4kq_#0Q09{hn92!#{y3$ZFdA#s-fH7Gs zTn1IC8bf{XS-ph(qB;t^d+4R+=Kc?fVHS?^3^G96Mp%hygt7*zJZc}DX_hVizLvZk zAyv5StfcY+E#82tC>D~MI0s&?w6ihv5}Hfs;OlC6B`Q}ESPNzOnL5jW2%Fx$Or%9b z`Xi>8dQ#%LF;BfcM;5!tfDmeUBrL$xEQ<_DwAB`c+LV8wr>C%743@+sg<5^7xI|_I z`Qx9BYrP?{cc7W~&%Z1xFpy+|n71gXtP*0alF7&sX8&kFB`&Oyww#q2#O(FLoX<=} zqsfR?3VzL<1;g*V+0uw_{4&|71Z0##i8JUC?y}S~HfYGBqqZ=@+P0$(B&D!maH7KK zkeI?%CK(r_J&iTM1kowRS%PUUqRF?|vyhcq?d@knm8K+ynUGpih@%+OA`QGHF+pWzWoLI!{ZRB!G*x9&R#vvgL4$z; z3j#4BrBV94SOEQefA`&H)N4}^_-Zdo5Rx2fe_Uz%`k0ry{#p=hb;$cQa!Q@&dWNjG z#(c9|+%M&II7Q67qq>#Vm!xZS6ZW%5qq6HielhyLF^oV$y+dNp`Ns*1eDbxw%T90N zJx`Y_#8gtiiDMXT*6uYJlwAp=;jeDz-{Q920csc9D5w@3DsnxUFXtl|x z?0g&Zb>OrOY;!-?B%!6HWhDh&?F|Sp69ZT7v}$vx+Bov)&^M9Gs>fBL!LhGdZ*MT$ z@qWKlDh2Md-Ve(T8^FL8y>HJs$N%lLZ&w5y8i{ZI==B>UAd81&_<(N_tiG=Q-3*)V z|G`Z>WRO1!vCaS%X#jxZMr%#U5k0wNdU|@BdjdT@y&dA@O7zUJoxME-5JgvSDJdx_ zEiJ9Btpy$*cR$~suQxjuS`!uvrW&g&D=VD@dVuE&3P5k(KX<%*t4>`tG&B?xrrKlli;tBcVt34cCX}$(r0eWqF;tVk*{HkqEz@#9AxgM>_M2wqt8)f2{zp;y zW?8q7pr@0PMR1{XzIm@q0DX6?lpZS`A)|Z*hvdGeJ#wVqV<1M1nUcq?Zed?NqnK+~ zR=2J3E*J?0HJ?uUkq=cg*9waDcP!nHIzOYGN&WAX26uhN?oCJj5*2OjzJ;;&LdyYh zqfall>ib>l>#h6u_E(sS^qiq7@yq!g1-n<-v$xLK#Garip=>6RhT73zHr7-9y^&f$ z^TS;Bt1k9hwgtn7daU)ObKYN8HfP=UkkxsbsjGiHZ**fwHiI=N?&7Ya1`_{X;x!Kcm58>78*9$AINeWSt>MVi+ANF}lW|q!f6^`1h z_gJrATwEL+9K`(Q=jYef)|w0MCkzb@0fx4BviqY$1iXOi6>)$)e*?sl(JS0B~9J)Z$wEH36ZgX?9>6GXA+wAJ4>e}*! zFW2^Hb3``jlsaa!de`b_kH&boH~wh~A^5Z>DJChWczSx`8{LZb-@kuXR#vXekFKq* zl8{)K|DBkcVrF1qU}i4gOz-IE@T29n=s!f^U9q(>oz!ls9_q0W&vKTFOUL$OvF+%M z$nVeNH~=dTH4pX{+e-YcqLh)5(V4E+&+ckhl+af5b`*7An&__Pr8sav+cp8z#FHma zJSFyAavb!e}GlW6I4W_qpI0b87`f@fAZ>s>;qmtG}MKIz`6b zv9Yn49vkDBiSMfqWRAa>A8oO;9>rI@6crSrg{&p1o(7*%{CPwhkxHJpcwlD5wPKc` zLdo&DdgzhegF`G^e-omk&$yH>dEKC%oOSHw3e!p2?z=5^?WdTv$!Nt(9kaOgbSJ;D7RK#QIk4uu2>Dif^ zn>wXbYtH)UZsqH)bm-RRcA2Z@HmK;RstQ>i8~)Mf={Cu4W2tGD z@rxhH%gdiqc-?B2kD}aCNlA%Fqp7C$(KvVi{{1hmd>FGMd(7I%OXd;At=pe_H?U`N zb2iXJOG``i!i9#Mi9Uw`F@F9$R2mM`{dlv>$74Ik5Bprce}8gzsDAqWI9HScEjfu| zwCLEZqy6M}{K*m0-I)B~CSzJ!T1sY7H7%{r)~^SqTa0rN6*bcB-P|_jh8wxUQuFc_ zz9d}pjbjwHGchoTFD`a6H~&1o7%kyZUQiHfr2blsE6io8cyz+Pq*nhZ*5+um%a^f* zzkh|w@A1=XYG|yku968VE(^`O7;a9^KT}f{mX?Z1?S~H^?kTt*%w}q8dYX!qO7h#cZ$D=pZ{9pC ztrUC1#Mqeq#g#YTe=M&dX?A@1g8er%Thw59HL0ECNtFrzs;hWJV!p-SJCZolJZiM`I4L5m$e7@l8sKk5M^wY?8nK|fy#LD=ecteB zm#GWBam;QDZBhR*%od%?wv*&y#PviUpMBmnSi&b> zJR@R#d>fj5bvykE?EVoElE=WGBx|1cs$X&J`L_9t9r_q9FD*mdi^>rBSV2b_;1O*+-}Y@XYji}?<0 zgpk_tuER{5tFx<1?f8oyPSJ^D+1c6t{{D!9{r&y#-f;#u@QaF?7xr8T*!6I1%=8i! zrq6wIJ_d^oK}AQ2I=5R?LSo?icj5ErWl52ulP~M*lP`+V&{>QuSoVRZc?d|b|LW}{(lI+29F)iNJ%O5^G z)yeD}U*wn1B}O(F;#7L0iUElW7o5QRBjpabE%zDcs>iqebrruv^|*>vT8XjVh&Oy? zWrfo9$1Z;Pc7A`q(xRfjZGrADsgzY!3yO+fU1x9n^hr78Yi^5p_LBY2>Jmh#$P<-JpyWdj)!U^jfW3ajDK2f>)(~lbwBqSt+(&KLpwY1)=o0gWA zyy2pDzo{}HE9|p3SacLMFfhO$ndJi^Mhib6OZqeG2zE*+K*V{0<6Rmek6@&HW+yk1 zXvNt1?OS4-34ZG;KJfW7BE|bS4luax?wfouE1zj36rPsbWYT$6?H%d98xz82>h4}% zR_5mD=!mJPVcEw~g6xojp4|zk)22kZ|((m+suVEe*k^ZmX)w z$jYXxp84a=6?V_s+S<|a71d9hVqA7)WCULk7OJav*6>VDP9p2wzkeUg7te^V;xU0n z>Rx)gFFDRNoZ9g)am;qK8JK$C;~AhX`XhWv?cJ@dJc5GuBcG3!^oa`#YbY!8ii=zD z(0w+Z@9OG$aY7cOu)4N}b@}1LWn0@^R#Gf?WIE&A;-aFW!osk)%A`*?%WzyABJ3i&~X5XVFnD=~J{d6WN+G9|fIPN2SNG45* zI-$*k!#C*29@45Lg;1l?bbfiixGSVpE%X{(bY6Pu$gk2$mz7kgrIidP7V51TYj~3H z4CT$QtTV|5l;-OWe`FDFXJ{fLJ4U^S`UZWdafYqb!JQZ6ny)GIZqe`gL3?`evNT@9 zBj!!JSR3iiur=nik9{@EXRMzUZQ=QhLWP~3-B8_F9Wc41Z)$khNQK}SJ?eyg63_Oc z!H`YP%*+e|FX2wUMoWyuR+m9w*-Z8RBS(&Kg`J`CJ4gN`!b>NUa`#St`MbH@KY!{+ zHr4Tb{`m13hcAV9d}*nxl~vZ;w{J5uF@ftx1?l~Xjdeq_NPyBx$|)-9>ft?;ODnF+ zy|yjjJCV>dbafR;Q$Qh2Oqg3*Qj$E8l9KYd49rTnh+Tf{!}M}4@r>M|mU(QH6qT!~ z9W?qXIo)YJlY-&bbBMQZ-NLe%71c$y_Loum@RF@z*d`<_46%WS99U<5#nsKNtj$DA zU46&H>+DZPwy?1>ILCcY}|`Ij$W5DE+O@({ZZO8WZwDgCPbk%6KJGd5pJ zYy<#}y}?0EhT+Q0$Z!^AmVCxay0$dwClmklzo4L?oSYoM**iSH?SxPJN*Yn#9`Zj% zMm79L{={#8b#3kRw6xF0xv@9EyL`^E5{@D^0;qWW*u~1mDLde)mOzA>l68Xs(~I~De%bC5OW! z`8`RcBTTH@qE$HGUDW5~Bv07n+Dxb=E?Egkw&-Vz{{8U;g~qQxe-MSvNh{4dmd3|# zuR$lLqaC&0Ebd)*cu>W$Qu*1_epnWDedUzh`>aJk;efzbMVBg0N8?QZ+ zRHByWBU2Jm*k!rPukGvo^E(Y*EnmJ9^bZz@RDKJ3IC!;$Ga^xdz9~by1UH4W&lgTk zU#6TwUBiPQiDiI}fZyGPJ(GZA96DBvw>35Wj&Z1_9w7iY=w!+sYZ;oQBPR(MYNg&w zz}a$RfBrZFwin#*G0xZE)-4z1<;`(fw#b``Y%)fW_KjmDE0yn~?{hpef z8|M=f>+9*!ym?cKbk@1dzC>Gz`sLfBUe-d4IYiBLRcR$W z-pv$hVKED5bdByP(c-GWr_23W1VCN|j!+{CUbx`1LdT(U+V}CPoNjXg0Rap^zDByq zkC$vIcYMA=dyiMj>@3X7BRq`bpq385&R)_N(9wEQ?#uY1Xv?WX`+^&uervC)y5xrn zT&=FI?ptRkc4^fe6La&+CxKBuH#d9L=)F9BMB1l*$b{?cmFyrk)F4Ggzvox5&{;{* zOJQNb#Yh1p^?6l*j@-S1HX~=JQ%YR?#<21vokhM%*o*mYdje& zm)hZ5p!51+t^Vn=XYX5D%JNwq>j)Xe$Li+Tjv@mH&>x_;4sI~y4EgEQZ!U<65$v4J z`E-v5XMdUXa1jWkyLX~=5vsxZTV7rUn$vO;r6r)!AbWhLuxE5+1P>z5epvXHxgdkW z7mLEe{Cp*9&%KGtrvvLT>?o9XU-~^ZR<(EE3FVm!*OS^)Q&Y3mCIF6+CRSW^sHN3I z7oEj~8EuMR>tvp%Bi~EOY*(x$7h>OQZWcU$-av&}T1hpv!=iAyzl`BYibAxg zPn~(XYDrPivqH7ZP89L`A6Hs49=l8}?WLEek={ApSK=@|SmTZLaQE(A0eX41Loe7; z($WCh($dn%LpmZ2y)9qVdaeXSiKKF#xh6XG?$f8O%~KwX`@E+sru*?PUouN|(}uPa zvOGI}=x!}02?%tkMy4kx|Mpm4iLq3uSm}~w5y|q$FHZ%v;z3Oi&tKXWmqmfvBL3t);{pbD`2Khvmjd@DEsr%ev%i_YEoKItR+q}iI z%f}tR@_{N*8ca`4!@}q)cXPRU)7I#gkx%`6x~2P&yw2Kz;`?JPgzIp8PonhU%%&gn*4S477;+ z`tIE){p?o$Nh_hN*RJ6TU>&y4!CvmyL`Klj$!H(Lt+i%o>FD4yZBf|WzIoGtpB@nC z+}9*z3j|Z3pycFaRDDV9AW8)V1$SPww$ARE?9Vok1(bDia*~pI(q}PHaG$~X7!T+7 z@kL?AfTg9S@82~_`ugz|oP~x4pg&@V*QM#M>|G~61_d1w^{W|7PDznVYHu){3lNzy zF*OBW1Y~Gm(r3c|?d#Vftqf!q{AGNbnzpvKj!uB_4=Hbo*~ql#ok1TjwwV6u-%C(? znSlx?yVsHJ5a`lSqoV>WS~`eRg*~X@@7)_;Sjelo1G||?H#Q=_JTL{2NK!k<4)ny% z&DqGw`PAwkdrIezjb0ZXel)lHx%IqI2d-M!qphLw$4(f8@O05o0P-BrJ^(wwAgb^A z6+i(c50Dt|K-|20Cz${WL@IO`n>nyPzI_Z?^Z<#JcuY)WWKELiP!Se+OH)($^~9wm zdw-dms;XY64(*ODE9;xIS5#Ci>9YV4pm#yE#V@X_we^QhF+cr*mU+Nk=dyB4!P~b_ z6HP(nA&#l0_DnJ}GXpPqo~7{Kb>t%|V!$&iq31Fu#E+@jC1+$oJfYwzjsWrYQ}Es3%d;jZaSxpj?g?b3r>7 zMhM>=^0`c;aY1!*A%HLZItpm4tGKvob3sjFsGTq-X41X{!@y53Z)!RQ_y!o&XHj2& z=tMrak$d-2YxPm6fi|gWIn6B2$JhS#>(_7J1Vu$Z=a^%iDt^ZGJK&D^0 z$eIOC2nk-R-1R8o6SlXnFVAW+*a@(&NlD&u9GRV(y1E{N)t=kY`I~A)qIJ{(k{XZ> zxPzIQES=1OGMDq>{h+9_vz0=J5hr(ER8o4OlgWMdY*~Y^f_w{|zgJG@K>hUc)=JEl zldbK1%*M*rvwDNA<(`3*%yg$sPg>jJ-mvn8+t^Ei9@8$_CV2&kBjsyTshO!;B^4W* zQ3}f;9_zBX4URu5L&|S^%%At*JAZyF#(hfyv7PXD!s9Qcgv(DKZns%Kj|EweukG#g z=^m>|iXN-yon5#$K4q@|5nJxvK(NSt`}SAQz>0#KHfDDN?A=@yr8u11Q{dczgw_W< zRzpGSjTDxLv=~i${MbQAPJ2hR5!xJ1+FA{7aUIz!@%PcCOpm#SB=I$on2mUeRm;~S zbqc_-d;$Ww2K7rlACGJ{R8~)J9J)ccWj`dgc(Twz=ujgWw?al)_(7HJSO3xE%L+wx zGwnS+h2`b5A5XAwm>=_)8%S34pr*I4=;z2G8vJVLIadp)s7#&jv9+1b^0?sxu_T|6 zR7m|LC!o##Us+iTbpZ^1??IS*JHSEcx)LF+|L-4a|=04y(Tu+2QazpZT4&v zDzv87@)!EfIm9iy8i73DE(OZ0>Z`$>)iOCF0#cICK>}*|PA_`3qIa31_maxZW2f9zlZmri~ zg>EeeZoMrT|Jm=h29|(J`OSrdga8vbUyL zHU}xU8a^dU$u;u zbR5<*t2)rL^I6=pl}~XT`d!Ni9|#wgTkkA9n|5+|`5*c7rGGtHGgRxeZ|g5FsryD2 zL2TN&&UB}2=WYAV*xX{3<&SBY&)Z)Q;`$qJkwfYkS9rd6Z((mUeZR1C)YO{9-`E`}X)WBQIv z3H;iJg26+UX1R-=!H?0SKZg-k$s&qUp znHkBG9r8Y&59cJ`-Qx_&(MYFz56ENv)R5OyF!B^TJ4#(tBy|x6Gv~i)S2=DxzVTR} zDsitN@6j@yK&N2exL-CG$2`&6qB62>yi?Wrmeo*N=wS`GUxw>czJBM#|ZFlwR zz+>tof%Ur{UDVcQ+B`~5!ma)O*Q{fn###AxHC-FNS80$0o_p9kI53ct#I!8mt5~{M zxWKmJT0S_a2Ub#3Q}fw)<@c9rzfJA!3oavLNcR2v)kS7X;_U|uzuTHLkph7?1gAqAhe2au zWM*5UqnXu13zKbkR!&T$wVAw*j;>=g3N;cD7A8|~ruR=wPrrX==z~70t88TY9T&x8 zbai#>OJAhVk8JF^!X8&WCsu4rC)+Q~tY9!WcJT@}7hM@`ddaQ12X|=K#s+W&vl$6g%Z2e5t-S`t${x=~h z#%UFQ(KoQsJ36CAsMM)m(V`&agp(5tGscUSRcBjRB-RD}xA$t?oZp9U)P!N*GO}x# zqKjW|0^ZU18JU=TG|NXp5k1=S`U0PbNKb2PWzNL!-yET({B-1jqH|Y{zi?a~OUlk$ zudIBinrftOZ)z$RIt*Y%q^khW*fM(U+O^9#9vBFV_9Pg5opCyg~ z@Lp%XsibsHTwF&<>Cxf~EiPL65Y!~>!I$#iqM$%e!+S)`qh9C2uZLeJ$=ylk6&@W; z;avkxvg(c%c<@Pk1JgF}mEXUEBzSR!4fnd??!gttNAEvBKM#Bk9i~`os);tH_}uQ~ zREkhTUZ+1_QvfWnLU4TqlUuhI+haBtFhu}dk1qabjgE2D$*0s$u(*CsnLwomF>c8cxN0@S+3uf6VGw)(=%BEdyjY#;m{0Wwz$o z5oweM;Iy+GE(=Ei^J=K8A7x?TK7Bg7+x(UAXP(ax!^Ia<6jxlu)kDYs{4q8*&eHh? zjJ7?~o%MK=^R$~D*Iw^>%0alHp=>kLdaO67W%!w-P(ZE-qeHLt+qAsAq@>a5%}u0n zhM3ioiY@Q0`C;yBLA~YilOCJ3y3{0kbb`!^6aBe+38-h>*W+2F|937e7 znzCewjDT*(rBgIBoas8;sJr6ZU}DuZ>G>{v%x?8ZY|YkC%hrU))^x@C=CTKYAn$)5 zW~-)Us08Ww7uZ=j!r!^u<#RPG>pbCCcUIDt&+PH5om<;lq3jPGo#71Bjo4>2m;IcT zlPs1%4Q^(~&fRnoytDMVp?qdt1HCtw3lyaO(W+t}L#YX59K=0ra>{aY4Q&W5EE3Tz zqkg`=D4}?UA%-tK+RH5T;16|ZE%++6UFU)u?hJ>byr3W_|7BCG!ikxIu*MsH9sjW% zdd!NRn6>GOEjT7%KB4rKgp`0CT2oWwb2%1_UwpbG~dX*Yq0Z7?r?E& zp;+jL{{*-g+yOWDs8F+UZj^+Fc=+|Wp4j;KT_r0hXO`FUHO?M;TTlS9cWq-6HyaQb zh}8vhfG9EW^=n>s_M_@#HaW0nP&x<7-9~}e?I+Z9bq7Qe2sggoQhzce6lw$>IM6MO zhL$#v@d7VGSx?XS@>-O_==bjtjlG5fPDd){lpZAp9Ggc!%wQ)!gE~l$))VR#@0+$ct^jMeomi!R8kT z3YN_o@A$UgSbwmnbB0v+ELZR624z~2n%X#MWs?6LNv^O*zJ1}>FGKd=*|m*8u_ZOI z4P0T6(q|k+VQ;8dcBwee#|I35m!BRRLgBRv;zO5M@*8k4x zuI1}SMn@NDq@Or(0(=(2bDK#X+DP=X?`)9~gb<9o&5hNe3*rC07Q`>h3;bxv3yua4)R5B)eoaGzQx4jFSOBxw`@FoDSJ=My^khqQ4>xYtx)e&( z@N}+#kG^AL6QoBM*;If!3Q=jUk=r0OA3+LSFDO)<%qC+778WFp!@Knm0NvdB#_SZX zU&mZVB%;_Ki62lV4ybaRJ%c(Trfb3#GY_-LvbCFI`jWTAdMpRo)BmQ$H_K4M@YS3+ zaWXmxc7gi5l-wS$IJ$aChSExT8k3v5_6m!LaO)J&`AhdWin9I5d9j4tpVe%g0aSUJTufr9E#qRz2ms5;uo7y$UVGw+S51 zX@P=oq}NrGQ};BV6C_D@pz%upVlg%*spY*yHRIV~CZC`z7)8FI%270<&17!HRWP!4Ntn*-n&nP{T4=4+!H7hNmx7T->Pw)oH@aKgjRhl} zqNf1@PM@w~GKr|ucq$|YqGWy@*~`Uc?b9c+rQbUUX=^@yxtJ-Dlu=H87Fn+yIj^96Fjo*kzyhbrZP_^JE5 zh;$4r0Q$&4@te7zpXWpDK+}l2(7R)H-%a?T!0BJpSRl0WYinvk%OukHH5gVqN02grI8YV~u7FoPAkHu%d7c}vXw9yv>_7n}JZhyHI%6()`YDMkF zxwr^qg~jia_AY{vO!V~Cul|E65G-9;VNk;_#MyIsh!6?NDWLDnPhh#;P^hI2K+d-k z0zAm7O{*CMYuOdI!@s+Wi!Aai$WRqdPqOPuN(a9^cu=erv|YNPRZ&HRTdRnQoTSfU z8EQ84bbwV+W^lkD?1R{zR8`KGs;1U{-d!3Bi$I~c{A&X;hfmYX2F%xDFYNlG(p61< z##n^KWk!Al8du5ut=Xp=a^kG;m#DZrLWKg{YmCmzKrET z-Z~weXgZPdG~B+yFlf~2GdZpS3A>Hn)=XMyy^7L(rd5j4sZ8hPh|@Ylq-KA#ND@;_K_ZF$T6&-n4i|9l_U?zjlB zP+KeQSNnLwqOBCF;vf5xwvwQ$2{*K%5yJup7XmzBd3j$a?e{;X^10mFzVmkKuI@?u zr1s*htUJ8nKWB^D$3Aq_5vBm{`RgEFfdU`^prCjILIYGYHAUO0LEaG(CxiH1gjbP~ ze)U68S|L%{+keB2-K;WRHoiLMEf}YgF!Z`)G+52xh&5O={IE=a* z$l&PFquto_%IY13dn6y;uuRlX{q!K2tTLT>O}1rO;qT$dLX~dvTAB1vqh_w%R*lVv zB14Tr4~KWC8P7+rl{QP1xU79^c_8*~=bLSI!hKNNB;-byJ}20UEzyR484} zmCGWxJ7kB`hcZg0s&Rn-_wRrH6rRhT^RLvpPwn2{*000K`LWO?k+1q5y)0v@b)mEQ z^0%<{A9F-`C9-3L8^b&v#txH}8ipofb00pYUV83RI%A>x=pWZ6@`1akYL3Yw_uX8x zL2fq>+5X({fyuEO?-nxWEV5J6IL?-8{4B`$m>2)S-O_Czp*6C6UpChbmlU_V;qh%N z?;KP@3%|cs`d4yoH2aGYOgO6TemPA^?nu{i3bN3E`8xW_%b+;8Tc<+R$R zP*3^#&{q!}I-D$Ww(JAbzsALo>+CxkG*Gbl;s0=+#T$YNe?&t=%CtDMQZ0MPvWRaS z)lTyH{ZnJBo=@YF4SDn57YK@dlzMY4DHwdZiFnK6K#nZ7maB$o-SEto{)YsxA|C)E=_dFLh%<<*{?f1 zjw9x$Xbj2{33xZ!zV;DEgq&oM(A8{Wt! zi+(!4+6=IjtkbPv2z7Yw75F@71eUmGN2r;|II}7(30WrO(m$-5=(H zl~slFL252|p6=t6{Gq}JTnAgytcIprriNQ@#y56e+2V@-cK>Tx&+YAnA2&yleQVDT zY<`r1ozEKgkRID}=_mn3_uadvWTwhvO`eH>63@usdKtOnB6Tf9$vDjL6 zuh?3Rg<-8Q`Q81*++02yza8710H|iqR|trSF_C#f+JkK`%3>4MD%6aK3~Y`(`8YDVWx z^S|$9ait=lE{0J6ex<3t+pDjzivYL1nVnIiVBwkYJOBFl0yB?CdQz2zG>9b}YV?0a zO?S6Ceh51$*Z>`!{&NSu7)tLNl(>ap4p&@JjUgjj6t00*z}B7_tcl}TT3A4SB_?x|?!3wgo(f1C zf|NUKUnsF|-8xdk6UL=Y<|zrxfCNu~a~=-ZpFfYc%!BE8N) zN$w~e31btAZ{et^T`YeIjX6b|e+{EWoow(+oy^-9TO6MB!YEvi4t+u7B%nqYy|xY0 zU~WO%R=BR@w3#r{)35%PmAKlT7sv7Rzv_7j2?-W5PZZqtO@koGQS^c*$Ku2jp=ZeR zPSDLH1%LR{k-Y^5m zA0*}wW5nH7r%I;bUp!wigSSJ4F3aM!5HaZ}8^9s~XT=|z;%E>xj-oo6nl8V=rs}~v zYi#T_x`OIVE&W^5-e_?*=Pi65^q~MMo1Y(iN~X(u2CcMg$zI?8S4iSEJ9{a@8i!}K zG|%4*dJ8K9t^+{$=+PtSC&8ea046I|Q!9K$e$B5G7hgzM#cBzNdBb3XA{GWkpuzL5 zJpJSeG-Uw>IdS9!lFg1x2QrS~#j_MWz2C?pXC)@mJv2uX{{`B9y;L%Sw33^f8yGZ0 z!)-G;D!NH~ZqSq>_Qa5@{zx70TGRX2jlm{QK~GK+J^DZUI%3vBF%rTb;(A$c&EcEq{Q;~xDf`J!9h|$M% zksmm);~|?I))`Ff9Gsq#vEV#6C+?4v{(5Wt6YLj=3w(uZ7*?pES@^Tzh6110$}a}Hv0x;Oj!RR0 z*V_4gvvP>=My>s72$opuZeezvL2t-=IJqI-KHiB|o=?~L#2u=;D%T-(gZfFDs5GN=;RHOmt7Mx+(m>wJJhOi4^4(ABb(_^E6&V-I&vLnHi zURoHvAH2L@5G<6GK&4`#k{*M{1au^}Fyh_ur|_NH+u0Ghxp!4|b^+Iy$GjhR~k@OHvQ^bbI?@GEWX)=rI># zCqWNj$BUvTp#W)g=Eo(%4eEq<@66DHI+hdzMwH&)81V@1A&|JJc$KJ?s6Egy0Gkiu z@=$%?yeP;aZJ&R7cbxh2U}LJe-47QLQ-%8$To2&Y(dE@f{~L` zQxv;*ZbwF)OgR22MQ19Jo7hjCij0g@d@TfT@DXWrx9;1$)8sM=ZE9)o6!4deK@!}~ zFpxZtzevu^tS@09CpmTM6cm@%n;>(MW-&iN&1g7;Ms>_Lu2%oxZn&FJVLh<7hZ+Xi z30X)*1sumr`_p?Ia@+kx_9>EkN*3*r{cOnA>8dWP3uC$~A-YxG;d-x-aDp3Dw6uD=yH7XTpfeVJ9gsVp z7Ql54T6LM_LvcXLQBY8@2q0lZZNtPQuuWr>gKi6JL|_1?ivAA)0my)WtuUSP!%g)4 z`>MUfpkUOA~EXW;L~BfRAxtG7lJ>~=%bwtEJW#O|Ft zq?OQf#o;R?<{QT&#D)O-{CO5JmBY8{4p!Lm+6F)eTB{6s_dK}-2il>*%F2sG8u$t0 zIOaqHJ7MDm?6lyg7h_fgDo9YaC@jgz`7&rl`uLwm&7Z?pBfTItb`X<~C4<~YSH9iW zMY@~L>)`I#($doMa*#rosGcH-VIIkCSf9Sxd&ka>`oI_1$dZ#u4OFn8F`Y9HM41P= zy8dH3jcx<242av8sIIdIv&s2fJ|2GkySX4fVD|lc^Z>+c8`z5AK(1AQEuD8sL41l| zJ|1!tuQHqu{xYaXklNVfAdvxKV|yWh0GN16VgGHbQan7B)>@*>%g$wh;ou&P)UmAc z@>I}jGQR@CN(nPc;q4}_%XSFf^)k4cW+E0^K@dkjh2Rn^cWJ$ z#j_gmZC#W0pS#u2IS2N)x3?DuAa$Du$i!nn!B`Cy0aT!oDz#&EBDV$7+V~>UfvI^i z^j7#6fvppiVG>PBlHG1!L_=o=QZl4{P@>>Z5Y@n|!Bhzw9o`2&{MUVgSxe^8fCby{@H5)Pvb*Mk25IaXUseb=Zk{<46#jTo9u65$UQTb}zllN}?W{u2@_| z8jvdhk-l*NHx6&2$E4(qC zUokRBZKEZxq4SrCZ1PftU}u9)(a!N5tcQHwwwneF>1V$}LzD?WwKN*>K(yxtTnqX- zFhEIoN)@GWmxm5LY;hbi@h|k~0*2H=JIwM44`(G7Zt_(!dW>Tn=qGx#$(T=P zKc^_i^&8ZlLx?v}38P1qZlGC$IZ!sWL!at#<1i`;m(7(?CW?COrR^?mGEjDcKD+84gtpPW(_Q*Hj@P~O4QPOcJ7Es#4WXqqFcPqMNcsD zv@g1N80%waJB$%bwj0Wzw$9F4M0{sbLZn>f?=*Y{xn|$ z2L9^7ESdNn1SRVK`T4Qzk0kq+8(gVDZ>g8*@OmE z(v_nBC`rF4~y72JW!XuE}zsnnr73+}Jl1gj@_KdypaeOiEvvgabN#Ui_d>Wy}Zy`J16;5DiX1V&EZ z#}xs>F#fhPiMw_U+n|FR?7Mf(pnVB6<9ci3T&Mf@59F?z3-$o7y;i_Ui~ZqO*ihhS z8`KkN8e^rr%>^U7%}2H+HFUWDv;8O$yUJYPtbyMllnpY}zb4jSRzlT-Je%(A{3t0L z>W8e?+s*P(wgkr|BL)@r93VKCZ8nQcZwr7XCTR2*Z3znvjT37z%YUzxA^B_S(XPF4 zRo9(oLA|i}2s+jwNeZw5Rzeg^!VtaQb&hX$+FV7|t`>?G5y1cL8g_YlAhW~FGy?as z-PDOa(t2pZrWi$H0m|)f-$Jh@z!?pm0@Xi4FwzAc_4DWJ|Ek~vGO=&|LyL6|&gMX} zc>TO)@Q2fOJN@X2A+OJVI0y8y)gmGymZk?-{AwY=cbGjW>4S+I1++#w+#B&F#^B#! zWI($covo)eEB*x(Uozh;a+YR40W8;D^o$$wV(^9N{n5-7Jqj?h4Ls~&BcMBWQ%lPg z`?a`lN@Th;IF180MBX#bf(QwyK+rR}Z3POAT@c(B-n)L=6hkN>2`x1+B_KY77{Jvq zmX1r^cj3s!Bg19{#|ywX`gVY;&{TZ<#YY@p0R?5+PFU$3b~JO~DMpIS%uI=y%3Y4< zp~K?wkmt}<2`dvkaZeluEDF!~+RXk$A00vhj@oQ8jyI)`$y4FHrL2t4rkh5~{Z#Kh z0=iP76b$lwpm-J0FQ6aoJzzS7LBtgF^N?@16TeGK`w(JoVF96-BPcFKC%z56amxz} zD&TcGI?$R5*AwdDMQ5d#Ks@Zh`vepNhQPML4UXl9M2WK#Ai&qvkr28jmtgWJ>Ej}O z++o&-wc6Xu=&pxoFk;9R_GvN4-TrIMsx<3L|%dD%W+0L&QT^6!PB zwW$&~g^wOR-E|P=I1B)qucDznx_*^sZ-)$x)*&Qm9oJdu;0EwtFBOu`UDHFVfq770 zf2So?#L9&Lv~;8GGO|hkCyB)mbc}VQ>2dx#CN$6;hc|q#w4{{5CXMZe;3hO=L_?SAPBYT(g_#4-_$tpNRU|#D)dw9~0cT}K3$1G^xFigFzUO(qXPD2(rs-<> zvX~2cO@ky2H9O$kRBT;)|HYZ z9}jRJm7nme6n*`9gf@p5fA`JI&xlK8?OYFURgi5SxJ1?3;zj$Ioy6|tzQ+%_c8bQc zl4_(cp(8$yqyIstcBaD6SL)d{Ye=V>U^hWO`KH76}{~lYx z>8urjrLZiGbkB!*)lNHDL#|?@Aig8HJ25#vg5_nN^{*ph=k_T|SqBfRvf zR1dg(oL`<+OcZf-%q1S}} z3%~!IwO*m5vlzjgBKq{R@7N}heoN-%Or6hdYx2uR(ixZ^1ant5u{7MfzD8G_7w&NV zK@7zQm)j>S-CsAc?U`+&+)h7nbJ0IZ$UyXsGceGWI9sUYuhQb=1rx%GeTh#>X_%h6 zy@f@2X~)!Ug4ERZ6$IWQ9h}#@HW-cCwl<^ zDC&l+iNaqyIu@aJQxP!BJfSGF#_fbZN4?=7ySWGEuh~O0JCza+O5>^hP{zB~{EY2v z@9O$%A)!BgHb60xTc#ajJANawDs|fs5@&salCUR;4UyG>C@?QpyIAqSuwC=lBIU8$ z4sUc^zK&0>3(BuW?9b5s+8yJ8xYiSv9 z8jS)MKrM}W7*z(cUv4+5@Eg1&gy>P22+-P_rg{%&Xn{;2JqFU2fr%-E4gHENznt97 z&54W@;FJ%LlS3bX;0!E`dJAV_VDVT9y}rVRA`>wIOc_ERj6^6~;HpPO0LuwN?v35` z$FCu_fzX2g6=<|=gOqTvK`3pJ zmDVRg70Y+QqQ}cn^*hWJ-U3Kt0kUs4!7< zxq}=)XFb}G#as#iH!+jW&Kgutk@UxQ6B|M2>kIOc3>akY@~*Ll722Dqr1_p9|g1Umj+CH2>&qdg1r11@5`HZKZGB#%9-^ zi-%5HI(7FsFqJH}LDSQ;qL+`o#`P^5^c0N0GV#`+_Ru4pYmSOhp8X~VHF!BSSQnFRi$9BuM{29Q+Ij6jQw`IE5I#D|D#heZo1nE!1cw zGX=>-c&LyBvwBo?bU*Iq&!2ZP@i@^Nk_3na^uS>stV!OW?!ZZQ|4qXcjsgaW4unbj z7=L2Qok+tpt|R0m(n|2ygXKm@{k_~eW=HoJvzRpl)ys7(A*@w?aM2kI93`XB!w`Nn zXL0zVYl!DSS}xF|R4fEaX#tW(vi*;FL_}QNL<$&e7{07?7c6*)u}7Z~G#gkKA~|s8 z%(O%M|FrIVU1mq#=t_R0Sq87x~neu;z}0r4C&6$$9n3J74$hMNGR0PxBJ-B z4nf{?c6QF`CWan{k&WcZu|qx>_`)7HgamZRze+T%7=R;{ePriFjBt87lr32C92117 z38xqFQgt+N%&ET0ioU|O-3u(20j!Fnsy4go#o+|X zx~yzuwB5=e#8_u`8-ND3TH1GUar(~A^!r18lEo|IfT64e87Zln4n+t|D z9wqkzFULV9DCAOO^+u9psboX6yzq_b)%voCW)<_VQ>j+&uCg7Gbjts7C2g?g4MM+c zMUmy8%6{JA-@i@J@ps_J!+USH#!v0CG;|~K?|0F3s*&WkENT%bxo;GenbKsFs--J7 zvU-HeWT$7YRwe`M|KsU9z^QKkxPQma3LUGIk#dYmk|bFnq>ReSV-$rXl$khY8I`Qc zUQtO#1F4XNBqT*BTP4{m>;0Vm@B4OL&-FalQ#t3{=l*@~@BLX{GwRd)e2$|>iged) zb-YzwBzJJdW1RO|+g#oZcZGV+qTzhs@<~`i( zfm_7okG+^Wq8o#YB%q%I2k434=*WTQq91ff-J!n%>Cu6}BwGRC7Eto=;dS-!VFw1X zTO7J@6X0Wq4;FnoYAl{mJbmS!qp#&1oMj5ZKtP_BpEDtaX7d>w$6Z~hn#KRj0@zC^ zX*kJH4uMH>3ahXaDAoTHh`tFC>t8qd)2+|IN88{ zHxzHb#g=#aWpC_~|H5`(2}h64uU*gL+j(#CH+_WSgLY=SANZEe?hpv-122v@(n&cO z+c2njz0=ZB0MX$Imv0Ba022cf|clvnFZi^#m1DF9(pk(r{x=mt0(fO_!RKw9k9o2DSx4Mn=Xa{Q`C!k~lUxnvrY3l%QqDVe~C~ zJxv*{ylHKYK*P7 z(6^;Cb57-gLF%}Xk=x~}SUO-z0_->y_&-}4#er^td}$`i0MSCKsueT~T36Koie)@j_V z0Eo)nfyW(U-Yz4G#@%t-8&9@aEk*pi|sbN1dAxv;bhUc@(soopH!>}C=E;O z{+^zm`T2SL96uGan*W>#f=cLWsvi@6mh#c*DYSi&_s={wm;djS#IYAvGN0~Iz<}Qr z|2eF>xhP%|&|iF!TLjoqsz1@VB+^SOsF{KL;&GHccPzm^uMJXIsDJrB0E6d?MD$$Lld2hP zX-HfMtLzn z3Vub4tj}yFfIE$RPCa`7rVOcejOvOPhS*u}$B5(YUQ|Lzg*W!{F{yaHyBM}i-U5#U zKR?8-ppcD?!R?@j2R5OQwBL97Uc=x?fw2Bk_%6Wv(%cglWd)oa9B#vk&^ZeJ_VVTZ z|2GVy7ws!Hw>lRj){sjm%F83i3&0GH$gQym$pAABtP29de3jdA;#_D48tEVOc93G)?@BvX!IcagF~VG)vHaBH2@Sq;vs+R#EH&- zDP(ZVZ(6^el_^+wq3&Se=1DyGiZq)$nnv(BV9sS4Eb>2tmP9<7dl?fmGg>R>M{?JlTL3SHNFNYtn{J%(@j-wX6of3* zMgV*ujvvID%ka! zlR~v18X_`LkC&ES9LXK|@uSqWm#%3FmX`MM@o|VjP`?WcqaX}ru#}Kz*kr`{|aj^2KiH2f~C-nfMh*> zoLeKPDm|0p(5UsL3U~RgcXQX&wDP+ZKj%ud$IxV(OJ&Lr=6f_-q6Aq3;C)BjV6nB@IuX$d(t zj@58YI)W0xim@)PW?UfhO{l;WCII>S;FX#AHXEqyB$xSL_Co%`cHv8I0=1ut`>YYvHq_6VLxZ{_RHa2*jeBGU&Vcm^_>+fE&jaCnyQOxq3o z>(Qf=p@LC*NZHJ!{9X1(ZW)pdu!lX%vE`a?28Atwxd-Tm#@Ny_S$``a{7eekVVXZr zACWc>&6;G{r2=6|!A|#3c;SV!gn(w4rY4tFCZN?v*+0Rc&ZT9<6@vF6BOUHG{txhk z-OMJg1^W?k4E1&&9ptg2PdF=k9YzR#=lR9{X}-^QJNgVybR3Rf`QGs2@FOX3nUEkR z6&`0q;2O#jC?Yzb(}(UFqi%5p6>&i+JT})*?EJXHa=R%A=&yCWS}-nC(g8{U8AqQH zb|JwYU_e+G7y>f0z4_aAfrv~^qbThx*S3)Gj|vUNIJN){qv8Y8)DnKm7G)|Lq7xI> zGz{7^H%_Cru?FTb8qT}PZpKrP64cSEtje+OEp!Pkp$p_dPdhJ+I!_DzV$HB>Y(u~t;3<-E>%!YWOg~9RlkEJQ%myuExQ0SjpXm+{g`4`d>bi-k`eG`gr z-=fI<76`TC53>ac0E9A}TLlY;swcq0KtO5S@wgUD>j8SU*ET{e2;qEo?sZKr<=wxu zukQ}>nGzxWisWUT|PkpZ+CuZL(MEhED{;Cs)XJ6FRMa7{Z{I=#gK8Ly{GI*Z15o%G;Gy_FFf zs!xvl9Y1&3>xyYv%zF+(j>^uUCaOkg61~4vLkUtSRm0U_>HFerSl+KYxN%0j+t*}r zfcnB}N3|@TeDs5`sQzfl!YvxC{euUrTlUI36c>9r#&A9PW9WHg3G@_#AsK zsSzAPQey%vXd5;ZNwFyjMFaCX|NRvXw}wHy3Q%n%umCQ2|30eQr650F>t>6MESv#p zO}Q-&cnvVc_+ye0O1{$$+i%emH)>nEyRUJEfHuXq_yTFnFj%6khDHc4fvf~51@YY> zKQST`Fpw?N1tj5uh=bS&&w2lZqDd6?6Yll`x)4ef7Zye%lru3ASNy%#;onOTuOFGg zk3is5ZtGs$lx!uGQa;eaayY^I=-tJF0v#X6wug@VtcwdLQ!olXZfUq3LnZ1`(m66S zJ2#hgr0v@`6~MAEy7U7Dm)0L==*HH+nF4u< zBNBIK&@ub8w~uy}?cxcCOcgvoJggt(ySuvdSS6aGNEhtOsAqybz6+JzyPp;p zgN!Pg+va)u7amLm=SoVJ^~NUG+3k)xt&m7Zz3U(r_s;BTBA=<-@gfo-5K6Gx#W94? z5hC)$mexvYvE%K0rw`}XXp+)-$?o>)6dOTZJIchLf;4*ST6tc!IzJfmHz`tf7KQ1 ztKIDKJQ#U&Y9DhFsqz6yMA?XXGERCuBO{@ukjoWe66aL;toFh9hNLi!|7{# z6Gxu!Exphi(Y$LMs0-vlHVpjRS$y~QI1LD-vV7P0qG?v@);G^|yB`n)@YraQ|9WmiS~L7M31I+rb8Gd;-Y;%$ssX5 zFg>0`h(~-FC{8Cb9(~R{P6-tyYZYn6IdTwn43r+tolULTEw*&j(M^{wT|TbFyZX88 zXVEo#qDO!ui)d_-=i=MAh8!GmL*tQhubvfmoJ_S;+ave#>r7PD=K&>~u3F``AQ5~G zK`|uAA_bpci?JHYbG1)%5CnrAqd3#b;^X~|;?NS7tLi(HxQ^us!yWblk%)4y1Im0!anO8H?`c(QEBvHNpTO zws9x+IfU_OnHUjjc9KN8b^ori-Q;ugnr5sa z4nMwkFKZ<_R#P`7JI~XTb#%7i5&coangYs(m~@>OFY$lQUSuf~Y$xSNo%I_-H@H%w1B6{@AKG?uF!CukmrW8eH; z#P=AA=!u23RCKl;E!$Wqvo?q01-b{y6WrYqi>$V|+q8KkXeA9!M%>M(=)LmWI1-fg$TZQl4!HVcs+ z@A5cnjyJqaL}^{neKL_g_=Hd^B4-t9zck5lurMY>vIa~)`beph(|z8(K@h1x=G8bg z$tM~ubd7Yx3}48AG@(Y3$|bhE>&WZaOcoWYbu>%Nab%)Ynx&3h(vX&8RI_&bW*P2w zQZV78dz|~0siaKGolNVQZ4`G=j}Y)EHcx%=7t#gjSnpQ0B^sGc@J+31>FTj%%19>H z-`lL;s~a0QU>{>JNKj8nvh6raC|+-wSa10=DjLiQDQM~@mEt5v{a-6l!@D|%)is{1M+1MY?x<>o7t6d- zs9)4`PFni4TZ)~LRa7&5�P_ni09FIdmJl)_JAP8G;r$4sl~7k(=utT@SeXG?^|W zlSPZVb-K-tE?x0DBSClj4nel8e^8oeDJm(R+_+AIrN*#SB_jKa!^Pw`@#b1Se3n4XJNtBYUdn=KoPZoI_D)ZzDO_Z911E4vE{ z?sV?nXBiOTmHH)Vbf40d!-2n(OxGM;S5U?{cCcK0d$CDFn#yGp@|&~Y;@4z2tXDX0 z^Tz2ARb4&A`NO+(ie7^Kdwr3~Mmv)=4vECOP#LO@j@Sz5tt?AYr8GId0C z*TBXPmj3$%?!Kra5ofEKPwbbgGyOt5_Kwe!+F(^KhRpuEai+o!tl6*6zWB*b3C#_9 zDK$rbvml$B-jMY$LDnm~R+Fu6G~RFU*wIKlhUH!lG0tAy`hfHQ`hMK9nn`pr)esf8 zIl*;yA08^R>+9Z}<_RIEDneK^COHYJIWUL?rb?3#=(e`66Sk8D~i#pQ6K$R^R z_Nffqv!CzX?i(!E^(9?TJowZ$zgEs5xK>urgQJGWm?z$o5fuD^B{@ceoW3e!*y)Sy?Tc%_Lm)JVT$9jfb<>wVg zM{y{;N{V0yO3IyyVQcx!TbKdyN)4T$G(R*=?> zslRyF(@r5N-oC>@9x6}7JA3HhdH`XHtG=_P&EpP*FB30B+anrmWGx@>=LyFpA*;nZ zFAsnnBuPzE^SL4{Ab!S^yQGrZWXUrM_5oITssEi?cvW9mFnoYAupvFw&xbB=qly`Y_x>4`?%V_R*ImBFk}INftXmMgDNj z9;KsOzN(XKTwPr~Ja{o;8>U`)H~7JZrlACkN`W4lE2{ZG3)yybIjH zJi*$#m(kh4BppA$y!_I+bK3;iU-jxkS&M5PDZQd1U`i3Xj8)o@1On>Tc?>(DBj6JA z^?lA|CdTr5U|_%`@i&Ctr>uuxTWph&foT9R6zJNnUn#6tU=gZL>XboH2FQ*R8<|^v zdHB9et%#V_hLmT-dP=$A(nfd{tO{zo6)L{HV65%+0bpozSBIQ+Ucmh*l_{MigXA)K zBZKnyS8CEK@3ZgY--m|Bw>Eej;O*l;Qdj;;ts!}()9+;{TiI!j^NS7YTnueHa%sH7 zWJ4uz^oUG(1qF;+#3U2AQE;ca)c}YaDmM~HwWrT$tKIUuM)w1s)-uXwwfUcQdTvkZpC~rTxR?>(J z{uwY0#Ij5N0U}(A$nOHVS}hwR?j~evZoU^->WnX(Xn+VIq^_$1= zZ7|0wX$2sRfx3gigCxcxKOyHQUKhWR)PR5_aOuHSp!%DpaE(QPItCpdye@=$U$yq@ zO*e*-CqnSmf1(FuF@?BP$?sD94rg770cB!g-KTkek3cHh9Y#Fd+1E!U6)f6B7XoNJVXqI0@CSI1fO=81X^(GQ^cZ zSNZ%ooIwyhImkov7O#gvK=n>feP4b9&HxJ#WOj%vXJJ5NG5)G2gk*zN!IA@0#84qz zhOthd@7JzfTwZ}t8Xpd^b{ch{(SQhm6oDWB+HU}xY4ln~Sg%cjf)Jr22*p`p(eD+$ zbwFjY_4xVlVZeWo*ff0f{wILA&-&JX)srYc>s_5vB6j&f%;2T8ph(^SJ=6S2`M!9D zX;z|t@w@;x?CjnQPc1C3;A7%l08X-zz4uQ+0H#_agNxM@OgeCdAQ4&i#|YoWyD~QJ z^DKuYZhYL;*0sF*L-B9mxQAQkO^zOI{rlG!(^r6S)trRZ0C)wBLFiBuab1`k)Zcmm z5|g5$ozN6h0ifWQ)=nS{+xa4)8pK$r5AWYY|Bk&)<1{Gp`}VOBc=1vRCrSJ(NCdGj zmX`V~m@a}?bf|y?eEQ}VL5t(p8d1QExcNiUBgDB*1Nc8|Hpur7=Yf5LkqXV*ClVGI zwpb|2U1}?D{7V~@i0Ff36{`)BO`EC{a}ih+#IF$AC@NmfV>YFib=lO5g#9(50;b5) z#j}MJa@=n)AqFrAk`3)>lI(7vw+03`5aQvj93+Bn9Yq2%^Vf>N>}3)l_>0KI4gh8k z9gR|o_KhkGor==#$Ck!ll)D2e1L0ec+m`z+xFb|s@e%5mjZNj)Ty>j;5^bu1dBRKl z7KEC}@51-|eGFa^gmS>U3^NU+4shu0zx4U^V=b|p*g?~=KnI)UUxGhFc`Yra=o$wE zs1k6Po-9P}-X~NC$X6f}?{EeWiQJ@$q43Kks+Q2D{QEVg1=5BRfu!|65CoowX^k(^ zh`dEN=F12zbq8LCkr@H~KKS0k!muKY>X--x3yzKX=U!JEk#g;<3`ZbQN&TgmPG)*} z4o?+X%S{L*`BpYQUS8bUOV>|EW_%RbyNyLdg*Mg*(hh*V;06doD=P#mTqsNK91Y8R zdQj5{Q6>Q2e4s-F=H4&}gjul(tfUvHYX^s`{ffU&VFJe1*fQ@4F}|a@j$a4ek#~~p zClxOiQri6olY*}I<1IqfE(!!wxw(HLE+K&qX^t4!1dIrrgR=rojDEVlxMot2?HsU6 zjPf#;il@yh688O(0pS&l$N=+DzIZ<>ZP9&ArO+~xguV{B>0e}nkjy**fExj)Ik0jJ z;n0nN<;(XaB@rs$)L{tTP-W18fXKQq^nS=`!aEXjQm8l2DI}TXAyNoFjzM?e+?c3D z;E80f28Uem1u;MnW#U+CDE>EDqTTr!o=be3cJlOYMaA2VryUcAXyNPq+kne~@X*fM zx#CX=j?Up>ReNvRA{PfxH?8?}9Ip#h8JmG0J#Q z+Xrr4zTB2?-_W5T&0b15BpTkkr_Y|b3n8J9fe=u!I)2>a?=*~1kP3q$g5Ms;Iwl7d6cq(IUL zo-)f{g%JaSD10N`D`t>lS@te`f4;#w-S%#@W_FuX zOG4oHd&M$S%GM4l)v}n>SE_2Vl}iie6Y~VN@Sf0L2Hs=~d05^51>FRR^q}CqD~|du zkz`Oc^@0)s8}l_$ITNwl>P&O;vf$StK!Vj`$)+&A=`U+wDr37+}dXuPsNj0>jrhPog5Sgn-pCu zPZq)JgCvxv7HdS;Ukl?x^xq|%J1{HDryP-vz!(KP^C86}Txjf~kK}?CMom>nf{o@L z6D{DCen&7sZl{y)u8nv;`s;$x<-h(#1%`HxsgoZvG92ZwOZBexn)@4Y^?xD5A&)6)-4O&5er!K{aCj_Wn0?DK-M z9+gr?KI9gZjj(!uAA=FeI@C6hq`nfhIkbwX4r@W8CCWsVJ?W`YM1k{pPh3zRF&Y%!5u`4GBEWVxG8Unpi zZ2ga!zaWA!Lye-RkmRA1g4I6#xc6hmRo6#T8YtMb)vgt+SlG#M1WHt1fO&G+rGQ&E{e|qZ@-2$0J&EQvG`lyk+N^~3Xf8;x&yzzVSF-459k$BA$5WUZ>P?;G?^E%>cK z?uzu#T0Uw2M-cPR%ydHqBk*vt0S52;$9^3)vDfmX2ROzcbC z^MFHSLW9iFD<{)+g`o0 zkD+R|c7}05Z-QlcvYO*wa}nuvBdPkCju8}s(9EDjkP^AXvbgTok+~9I483;SC_d=a z79hq?*Oa>0xQ|55G>;b9GN}4D>#dsq0)NCW}Ex41Y+Lm{yf zgB*RvUe3L4GwE8L+_5_OBa5c4b?$t&ZT&UAcO0r1#f3;=7R!9+Lq@oa3_vTeg8Y%` z8>{m-;AA`88ZaplFnKFr;TG7rU>x4y_j6-}dK( z@l%!VJiXb{Gb_AWKG(W*tve1g=`pc7WID(6*lUb`-@U7fizA&(ByuHkttTgPX?#DH z{&KWDY}e|?%e&8MT|B|vs8iDA(6>#r>CBX00&fR<-U8>Y)LXNdKT~O|OW&8fzxUSR zCK52gAE0jZNqD(MctSYVr zYp3Ef5#|Q+HlyeK{+GXe`S4!Inw^fYbu|CH^U3>q-~tc3TyrwLr4nY~rQFMgkXLX6KBY@$nC$Pd`Jj!QFLkm%u^d?Rt4L|N-MTpD(KlhWm3+9DMZ(=-f?(>ep?iHxPy%)mlp~sk;@4xX_ zrW`Yc!faJAD^?YGV(`#N-NFdW27q(bSJs}|bw^``*W>{g1L-LDw|tXkT6a1ICInYl zi&QT~p)YX|IQj%s6+>wuKH&L@XVb;KQjEk!E8m4(b6hsOz zyS2tyLZpDip=J@bcK?b-`3Yvi+I#*UAA_!~IqQcHxuhPpGu!XD*csbVCw>SRiW4Fs zOxgz|T}!K$q}3&erN#N_o2+ZOnsqKBgVIJa@$+p5F6+OIn{Oz83qR0I<|y7o(Isso z9MtL3*Bt8p&xJ0UP!me0AhQmYSNF zy9q(m4Te{XwMGo3skna${;tG9%$2n97z(`p7~>zDL#Xwc5esL9RVRyT4H`0;h*#sy zoEqv@8D?Qkx^!T~__F6sRXyK~6z*(yyIq(*U~O?#&wX}Xc?rGR%g(6oLUXz~|2ZGR z#=P~LR8yL8UUXnhlG;sWEw>x~CAr3FtE-##vk;L*es{y`iRp3h=%XM=Dg1MXVR$6_GDo?sKzEcgONVw=;>MBzh~wie{A zn{1N!*(VqJ_$!cF$z;k)9GihJSah#?{0cy6f5FnKwed3bF1OCkJxUpy?E;}DbGz;G z2Iirk%6DA}LS``|;Lp;}^BWi6F5JN_iKLcu?`YbKD;e%-E5k1PGYF9?>0A|`_m!0a zDy5^r*Q|&-y1jq%RZL>zcDdg@|+xw(ZA zb>jJZVqD_xLGN^;=fl_wo1VRdtkbmW!W(r)s;!9bf08WH)c37jmv2;LZk8eJC_m?O z$KnH*r*AY}i5DWqGcQ_SSQzGfX2>d_xRLlRy^U!-nb0%x_cGW_5F9ex_F*xB_V%oV z9iIT5q|s8{-1VbTg2c*H;IAvc4z1btr6Xlm?~nLwx`>shX~{?Q$kID~v>B-UDjpJC zBJze})n^?E*-65O;G~GPICBy!e`>y|`lr*gh(_O6_)1XYwbFOXP&_w3&3i*4@?BnP zv@=%(yn8PjlSv}(oV1?rxl`!ny!ECHX6B2Ps@pcm%S$5(Qh&Vd#>Tn^!SLNSL)6>3s`FD9;wTp^eui5I za1rvX^m}hQJYALJU7oFMAk^f?a~Hp^ZQ~ctn^{ryI!8~4^xZt4N;2_kuU{EkJ4#PY z^Bekb>D8sBZvXM`C!GIyH@bCItS(jnVe?a2?L@hPQVl>VMhTcHAv~1xL_^l2%vD(5TY|_N^AAa>!-#5u;%Pm7sJm;ZoJy!Zy^KU-F_e1=_6rCa0fHBl=W(ql zcmPvVgpo;s@o(MDGzP@K*J#`Eius+6S&e>6u$m-_zz_1|M~SuB3o_NN z8YT?Xh89YbQ`|^(HbvJ?K2D4vm_xP@WJA{)MJYBhuDYWg#v9WTJP4Z@W3rKe4N0wv z;RK^R`vFSmT|uo35_L0KR-Q3hBINDXwK5XM3@ik3my6KJ-o+Yk%e(x=H_Z1855YCW zd(Hz{9F*b=>0qhRZ<^;!gB(ZfO#w7W@4ZzL+~-9+SXGU^4sxJ^&o3`z@_ zr0mG8&5RI-kXzm)v5!PHA2K(mg9R+zQ0(BkJGXY;J_s=lxtZOF62?qu#TcK|X0UPO z%*v(?q^{;~7HK7-^$+2RuVoRci_j!naFK}HUfbG!?Pq*99V7m<1i{l22<<~88z=$) zg$8Tnc4t!je;g40`rF5Uy5%79T97hIcK^I(&9=FK8PfnQ7C;!d-UGR23>RK29%3`a zx3q4Gx$w=MObSjtU>41V%C{OYf64mIep)Q+VGf#TV!4Y!FH6_D*smrHmBsjOZb&vO8oL|GVayIp~=9oMTgAApDAyFCR>E#*wT3e+YUF95{2m&yhr+L-w7&luM%ahpPHNSdA3!eD?iBGBYC~X8w2G zs{7>pSl78v8|<_RLJt?#H}PUxrcQhP4r}ELvvZy%bd@e83C8KS*V&5VbvQ)HS!6fP++48W&5%9mrK6r|ARy9^NfEY&&eG4fZ*?N?inc7;LPk}vWodPuA|9JC)MpQz<*mk&sKDN3E* zRs?mXtn9e&7%h2CI`>!r=Olph~K1$ zII4X#tR&r3V|x8DZKYS5_K#b_K8v#pSJwVs7`Za%e-Zn@>sZ{l=^OjRzNse)24@{@ z)aVQyG-@sgrSv;kd?ZLBa$5q~li7t1Trjw{s7R;X{GX)c0W#~yk?^H})t_5ZvwdQ6 z;$*f+$BBK!G-8?jLb-Tma~p;`r~AkUj%85!5)6u=n{8q!iHtTR0WA>=pDhR16xT^v5Np)v?!=4cZF!>O z#>U^T7 zgdB>Wypd(+il&%n4sejHlDlmP|M`~9`x>M@6HNVP@5i3i^W)UXS>{EA{y#jt#b&owAnD^TFTQvCEbAqU-XB(~FS-@{=&bJ5IH1~`y zA*(>+Dtu4LI@E%qWK7j6mKk>63-zV8uwMq{9j#}#lhb`l2NDJZz0Q z*$_9^-Q0}I21xCn^w?K9^`CsdBO^ofVW+ITJfJQ7B2kBZ)VW~I61%AbFUD+SyuA-b z`GIYLb2P6Fj3Rg)O|hH6uTzcyv;5NB3{nHhL$7;X&z_aGaGP9Mf-~k%cRAoD_-lc1 zVjOBBG?{ocSU&W*vnWpBLGS2;awR}~+|hq)BMYPt64#-j(?a+?{k%4yV$8wnxvhe% zq0L2VEa1%`y-)t9+{d58u@5c^|ACegJSAMpPoH`K{YD<&zd=3yePB$W=9QQK1cpUN z912*Nk&yz4QAgb_x5OPWBpP8DkliD?eQXZ?rK~-Euyzu#y8;Z)Y;nLRH<`thDrAO8 z;NyWKh35khBbY5Ww+Z|hBwfL$U}Xg`4DfjAGpQt>T~#_?D!B%WYR?;TC!aB^loepy zwDRpvdX$74XhMX~WMJ_*X9pQ_Emg=qA#);msiXpYcKw-}ttA&?@9$leJ+(lPe zt@^^SJuK`3=k(gu9w8_UB}E7k*}m4J(gp?@j>7*53>aWZr`T4jYQn!qZ@sZm~bRnWET8?7;{ zN3#N0JA=DIc&e+SvXT-KeHsPNy5hVM%3mr5%h6LQD)$iXtt{gOS8QbM? z)_3e>G?z#SkMEck`B-7*RWa6I$JGmZj?4UbO7j73qpJFd58&!i;8 z$0I1kjD}phVgMULxDXOZixETaCvhZ2sm9F`xunMT+1c4;Bqb-t$0?X^@8b__tfbp> z!!KQ7MO<@=A3p|KmV()-_V37kx~INdM`R*L25$$m6hJzF+g``RBm1^#%1>K6%p?zN z17<&!-wb{u8&z|%9#ZQ&`e>fPW?(K`XJ>g~p=%|TgsZyKQ$8{oBo!hHfr+bg`Of?T z0e=h0U*~Dzhl}&`NWJWat)771tkw-d5Y7sa2VBD6-k{*j!pRBk1%mZdFoWpNMHuQ4 zgUHCp=+*6U>!C%r%D~j-18*A%j4_}~zxN!*iiB+^fM!{Ya<+KA=j}0(X~^7t!=xNs z=A+2=^`^RF|pUx)l-v`uF}{0gMx!E`}v_> zz`t!(kV|<0=`%=A@HOz5LLq_5ge?r>7|ur>ajj5h`FB~FndAFy<6 z^rzzb4{u;SoAFI*%=t0`W7)wdfg+!&q2%Obe2<6@KtL0CjJw&{m{PxXaNK43srZ2~ zcESAM;f2?)UyB|H^Y-?(iQI1I%o=2fWFPd`EJ21xk7gO)2eOU=iLc_{G#5B55f~&? zyYTm~$?@Zo@$c{=%VPnn2bih$9mos{K$6jX^V`dp@oy4|v{^d}lVdmRJgEs8K|?Vx z+(O*jC=u3v6O5;Gcge|V8u=lttUl}>%f&2%cy>WKyCvRIOJ-0-^NWjVN*)g|-4UHT zQ&I2!sq|;piv_frKDDTZCHclNN{f_4STUPA3J1Kq&l(MNago4Lu@WcVFLLJuDgl$a<7882&98xFmszz z&6NS92K}R|Pd{#h^x%`_F}fqI)38j{%0_8qfbcGzLvCls>Bk64kH}2e{@**h_}T7qFJ>yLBQhU-y}gm>5gHQWDs(F;DesunK965Wcqg-J zVO}*Jt8SO3`g&Ae9X&lIM6+RnpuWDojZF`nInl+!_<~*-^E`&tN`k_p9iWZ2M31= z|K$~+sHjaB|8$w>wIQcsFZ>oRC9(VAiH0dKm44Y4*m(C?Ec-%lLnDh$c|y>gvYFA9MMa^JT}Z78X^p<6gj%$?Riy z`0MAgS#TOX`Q(#YVv%3xFaFV>{r;_f#ccKo$B)_1=11fY*S>jU`SUh6H@9ZmutmD@ z{jEomuf95%S0IcBxnf8L0z=xtXga`H?;7N~kXeGw{)1xUv%Ojtw0Hjq3i~DOBfw4R zclX_7X|5J-%WA5{fC?7k<}AyU|nM!po}M^c_qkWGJkmnK;9t zywpyiFW%Za#e!hO@@NIZQ{bA6`s36moUTL%^55TmuE0liVSExp>hW3mU6%ZoSK5BB zonXM(W_hTgC@izcMqW6XFj0b#ZNydP{0PvWBkm8<;_sx%5qODh7$gfFoPeF^*_Z>b z28uT4>Nu62vJ{>ReUky51o9U0tzP=}zrCg-|J;sU%fj0=%OHtXy)CVu^buy~KKJyb z-`pH_(?VJ>VBffMn!i;4>(GduSqHxrS8Q&Yf~XMYX?o__vGG{y+c&vsmtiHlxUl}A zcC2H2b4H0lVo1z@oSh=o_I6_8*8^8>ELGb*EG+i?bk9hrcH4<(zY$Qr*{Q|U=$Bfn z{8na`G-k92OV9AO()9}{5U#t-t;gIHg>@;8}b#2OcAHu>xG5KHtgRc_=Um1 zVC{d8|M0DD{Lk_~frK)DiNI5W<&E#;Zf$tT>uhq(VsOx-o2}M<>2g&eJL77y$dhR` z1?Tq4Vws2?H`ecVLJwiOe+ZT1n|J>;VgGs3*XtcwL56yI?~n|W zD^{_X9d*9yoCXW^seL}qyiuY7nFFoY>;3PB_&+=zeVL%0vi%cl@9&EJ_XGB9D{Q)T zagF<2XTcmT?(f0#6h$|>TQ(9ql}pT7@z{ZyM@Zm)iHxCa+Dtrl0lCE8g>6JJjKRJ2m>LRU=gN216Bcs`k z39I+8dJqiO)#<=IZf(7TCFsVDwM|nnm*Rv$X$EpbRLbh(bocjHafwe$J1@T;O_zhi zy(78RD+L6Mtsl}<5eKwhP!RD=XuU}ynDKy#Jz`>XTB5j*BJBr#6l~_^39$9PJpdsO zLjQ1AfXhEfey_$D#)0~u>m)6?v%tj}9izvi=uk0W6UAy9I6pode%q0ywW$bOk{_IDrc`;V+; zdslr?b2DufOWRx-o8F)~VPxY&?2Zu`!gHr>r(Va|n-z{tztyY$top`7V%C! z_*UZjTUqv6HymM|2PT!VO!&Q+9Y$mhCi+?TVMWfv%&<1M$~R55H*B2g#{|KbHbPf( z93S%1hp))5)Vm2CZdKemsh4q=vhMiZBGVU7PKZCz%+@ixdNJuBw~{i$$M2~Zv)-ii zJyX%-FK0QI`FWsg%V*`F!<{{b89DEx>GvzH`Vxp4h zF!4?qX6M^GPoc4R?%W|qaA{3oKpzBM7B~UV7QDngC~oJew?yR)EXh#Pd6lX6yP(#? zxertiJmnC8erw;KcX0_SfSj_nb{LOLnrgrbvOi58niV;=<{-p?HAwc%2O-=P(5mhS ziHU3$|ACta9TFjAh0MWVVhU~P_|jC<@W6l}c?JQ0$nlJ_?*Mj@n1h*+dp&-ALZ+iX z`c$-?NT@NP{F{3@Qc$siu?r`?Mlt&RVozlt)bUGrm+0_QFVC7QKY`k>uR`PBI(-yqPrz58s!k=)3rD9fUg zHJ#@xmhn1ap`qK%i|yXUN#fA|gTVm%kp`9(@Zj$rxsb_$R%)8fQ20Hu|KVcX83q zLy#WhHg5>D<B{G_bFco+oVp5@($HOp*A)^&Tk1HwP}*nAg%j6)o031MhIwXX4> zB(q1!Bro1p;9`qWCp+)Q>p~H~7&GN{9f&cC+^sbD42g7U&BMxO4I=2^!N=OXjLJQTWaKO?8 zE$$zpYTekaBsDC!w)WeYEr+%qPNYehv6X;9LG#Iu4jltrv4XIXOH(L{aGGmqyhZ~B zn93?(*@O5&(`5RuWNJkcJ(#Zb?)`gZz%6JM`DM%q0woW(a)g{Mk5{iHrQ^zoD-*^E zP?M56amT#i?#{}_hM=hg8FTk6gZnr#7#;d~PTaYD^ur3FE7t3dQztR}_OlpHokWW5 z2R*&qx7``1sAqWs$;nI;qi$xCykCC^NEUXE&hs82<}_O6i$2sR-+iWHTSq5K~L(n^XJ@f$~9HE{We){wezXhwuVl&|@#JQIVU-gJdLb3!gSu5EaE2 zcq0GvA>*aNvufCoB`nyGBFTK$`!zH)J~_=mZbW>6G_KWsLg|9>6|pEDSmjTz_zLQ&CZ&CAeVWV27cNcEH2P5+n;Cg%H^7bWBaHl7^vlbzuqm zMn+ID#sElG%zix!;VvS0#KqrqcVjYTJ$iU-X9xtlyHo5tu3lw%YVi`{VvY?8$(XXD zoo0*{a&z*&H9DjImKvo#c8u~*H)eKw?>m*eDgR7}c2=+Ab#X3N3Kq1;%!qt5{)&S9 zgwWN!N4nNdRv`Uzd|a*E`azM7G3g_HU_#-3f9=R?&SD-~vY#Vo_kW!z^@_ed6JmL= zJ^bVDHRjygpDo!*kMAH>u5R47)rj$_nT%BYFPJ2%nktqi*|dyqwQ}?%j3#ZTb?Y3a z2`g{CB*M%PFoHnS7E~|Vu89<3L9Q|*6ccS}?K{-kYu$K2s>P2| zZgIiKoF2kvHqG`n60(%%dxG6(P2Q>saJET)9Gnky*sS!%M0YpF!O97+zj>w|`(IW| z&*j5nKYU+q8k3PPZZXmRur~4Qn-kPX`*n8*rR{b@)4(@}+4Di7J}-{ndl*hy$NsLyfMnsM(f6DVf7Xr2hMn0OJPQ1 zq^9}*T|>|&?f`q~AEv^t4@8GVSk}Uh)qfqF5r8D1XZ$KT6L(-#*srXtePa`7%lYW& z=na?k?7KdS6rJITii^>I#65a2XQML7aZqV}d5A!8#sFgpaQ(6hv zOXR#8?Xd2#3}67=Om_a0ZnB>j`#6p`yD__~{_PAo9P*66Wlpm-Ic}B5W$oK}-QR>T zo4E51d#;-uCl!TngxX1@Ywg<9Euhg;^*gY`S$j8~4BKgQzU9E2oUO@gL>0N2iM9Fk z-Ma)wE6b|4A8xG<<0yYVW$?5IO@X%iYLwuvPfkyh84_r%a>E;5MdBlia6>WdO9mNxLh$1rnn7(OHgEf!@Q@5+1U&nSApH(0mPv&^RtziK(O{R z=MFjoo-WK93g+vt6g6ijDC~1s$4fpwwpBZsSOmjhpYjDidHO?g_<{P;z{1;!lem}l6sbYZreS0XTX4%NE_ae&UVAuQmW#ZuT$n$~s%osE>hCJsoh_VQ!}KwV)Z2H+@sJsz7Qw7GsS_A^ zUo+%hFl(7>ky>?gv>|A(o!j;cES;)M^LBEq2?=}u`Rl@O$*Lj@^GNh#?N zq>=6xkZu7SXj?Nv=#E%Z0+iQ$QT+ zY$7|WxB>laI(dT=(mEU@AcGu)Z{x$sQk1?Fc>e(BF-T_aR+*>7-k9`MhSG~nb&vmx z4GQ4K3JF75&mpvCUvGjCB!jqy++kdR$g`5kO^BU~t$^V5I+xYY*Q=Rf)-b2uySJjw zdFsXK0+zVar_cn7hJY2ctN(?zHZj7yit%+8_{4mAVD|+?g$#+rr<0~O6q@tQs(Sa% z7=G=K%zWJ-P7Iz+NA9qSYBH@L94VULmKxgLB!d@f&l?nNjLO0 zC56D!cA3GW248M>x;p5W*aD|ng&y4Og>X2)W+if(c&W|MK-o6mzB_bdez<~t1U(0l zQ}gR2H*=o9ZR-`yeBpCHGQ_?>gTvXzjYv(>wJgatUv>mSW5`YM$G7vBJ0c_N1&%K$ zuYM18LTnRI>}+h|7H@$gh~ZXoz7toNe8Vs5Z+lP+!PxwZ0jivk=hgb78lh2+5HqD* z!JWL2P!ay-)tYGTS^jFYQ5+8a5nY0tRub(Y54D17A(o=R&0%Fs<5y0Rf7micLKA(N z)L!RM1)1RST-gu)(q}_PQV3ctJiOihm?nVciD(RXp^lXpaE-IVrU0J?0m1*bvtt=s z5>v|(o?l$>yZA#49r%|30D)g|a7YNaQ}Qt0c&?>BgQ}$Nnr+Z7J{F?PEu4+DAcuu` zdtd3XThk|4Nc5^quK^plmcWX$wz6{F8J?>Fp@sz^a7ap?{>mSfTdDuC19k#wmlX)N zf_6GOsBDdvF2B+U&l@UxCMK-me;S?C%X(0AGj*sBkGZzxxK*(7$G{xbPgr-UtMY9A zPJhU@L{)vtHP$h@hoBN)XLy1k*}Npd9r!g*(^K(HK($LdUp;vd0Zk;Sf{V3t>s zkawoMLTk9oKE6ox+`Cj!T`x8!w6)J!N#&J2gm;nPhUk=KKP6YXvVZ1>T{njP+7rsV zG0?i1EML9s;W1ZONld)89P@`lPHvzk>55FI?AywM^O#VDR_P4u&jn^&#Pw1Q+3S0T zs1Z~FmuPE*;V0WLKXYAz%3e4Cr2;q(Qx-qdq3 z1jes88maw(+ptP1Lur-0JuG#KzP{~pxt=iMf&m@H98PptaYeo90VF?I8#>tAlU3=2 z{lM{%{h~OKXnU>V?uQ(WW)HRYuObC_h$QD<&!Ct_!=g~CI_>%7;|9KW9~~NB zVKefH8H7QXY57e3-EV1YE0f;uuEl;M;tl-tOb)YX zbo0N0+RKO)z?X8p4;RSY8X_ntGdnxc;%vK^q<*|P;Knf7$TXo6eqt@3|G9V~r1K-f z+NKH;Qqqpz@^nfN*hr4wvFQ2y%wXzqHEdEJq%?`+TlmKrpM)jg#Jih}%ik{YfuC5b zRN)}T(g3dPn6zJEk8cZFTM)+)ST;qu2QNzWJWF5*(fOr({RnXx)b!-qx9esArLyjY ze8r3hofPb(W&nyopQQ#ET=^2aS$4j}3MGFSd!~9lkyP?lenIJcWFsRZ1IP_{^CD!` z-}0dVMRWl;7)2=jt@wzyLuWR2^#?d81QJI7XWgD-IP%JIb=A4VW$5z zMUY;|r>Ek+r!RnR0$=KN7;F!ac~(}aoh6$2=+}Xn58T}wV8w!eh2_HI@3sL^2Q~j= z^mvs$--mKf9AcOze2ZY*OXHV$r(J(^)ubJhFuEbERf1$hY#?%4%xjWAiUj$dsYsD#~S$BS=zj{pG&{zoS}zsdkgrWP3X!D4 zT|O?OE1H-F^$nN;?!pN+Sl3L0DQg)H6dBBZu2nw0dVY~Pn zLT2g-GZ1^^DQwMI|=;vP!Gwz#uo0h(MCx7^29T5AXjVnZF|p5PwyXc@hQ zdTF#=_>JL1OD9Ih*rW(ioH{njI3@G~xTi z)A4V@Q%NEd$Vr`ys!A^F%Bq^T6-UBJ@CUzq!ShDI^sK(FiQgTjhF+ADtK)XhgcPg= zMHk?0gM))19U3NTODii(OiUJL=4*bo^^3H^&YO7-Jf%}^L=N%Rdlvq$5gB&_OP1va zpDXdGj*A4GG)^nvJMur)yd~x?aKq){t*_KPddMV~$bv*#8)sB6q|$GJ8U`(4jmi7= zam>sFVoC#wurBwQpeRpdf6-1xxxk~>jd5{D1CfMF>eOB7WU-j?vNFSF7{rn|VZq_> zolup1=ihXKF&1OTTI>slt@GBxXKKU-mW@nY;&-uk8-$g_=($ZzCntN$TT>N-0|WZ7 zG61bOA>=`z74JmD6Q{QyXF=nMIy@%5A@_J5wn%dw;;O!rn6751(!84Y~AgDWv7;a4-+qcqZNV^huNxzQs1h3iSy(`r2QxxJyXt1x-7jw8BUYdLRX zR7Nw8Ex`N^ReIXy=W^9U(%QHpgZlC}#b(Bv17hv>r42MaCAX$q+TLAwn+OhZxCnR% zPp0TSLJA4%Y^86t`=CB)d5w8OB?=MG_9D^uAVJE<#|QFJ?#JO87P1gu#rnv|b?E5C zDS1V5Z>Fwr3Pl0VPN~(z&2T_yhKj{>^kJZ_U;o|2Xuo>9R^P3(%K=m3>x#{AZUNa* zMkzjElrL+Wej`3UoSAYEnHjM>h== z^Ojd9uA743nhMV=ff6=vDdTtUlT)-5pCc_$WpG`aUSk|$&TX*i&E6#DgHZXAw7J% z@rj5i(+z65;vM^~oH)5J`CAtP`PRu+NuUIH+M=OrfGRVVNKP3yZ8spF>l{=;dJz(M z+byY?y2|AM7cX+N-1*?iv??pJLYITUgvhrP9nxa5r&pEEdwAj7Qs=`W-Zwd=TkQU& z9^NhcjK{%???rmbYRas))-C z52IJp5N*|ZTFjAzYxk0`_C7&$9ij68bAx~Jl}Tk|2OiJ*n0Kl%7d6&AOG<47TO`2Z zy^$o>Qig869l<^FP+6_-(b5(G1;skgIb#sW7?}tbwm~Z;E-vo%LU}#(o&8;1S*atw zlmzI^!2yOjF3cUCuSzbJ1c_RaxzQ<&2Ost9NM=}f>cqPn7{dw7Ooml^88k;ZdXh0q zoGyltxR(Wq*r?ANjb>-tPNOqYN4L~#t2bt=vtOTz|L#=J^qwu$XuY~xQD8p^CQ^Kb ziijjtM4>oGLUmomxOaKo&kqcr0*AC7B^kLmq)gfpL~e?_*e_RZ|2a*z;Hl=V*uj@5*z=ZrKQM$U1i&ua~!s}`em zi2Q5m@p}o=@fNJ?k?9E?Ga}?9>m9a;(^`fAY#E9pH`Zexn_9{Qtl<)lA&t^G%B|1F za~D2xTAqb?ieqHB1YQ_Se^egj(69H5}CRAn9OcoGl_~$7z6?GvRQ1A(@&jYb-9)@fUfpz$k?zKsI60IB3EMe zC|H)b+W4d8!PDn99sHIIsR(V1Rj|_lUjbAcA~rp}6%L%e<$g$i69;*&IUhcykP@;N zrbQs>ZqiB5n)5-IurGW*M-t$OK*B*H?{32nhl9U=?;Svm6Nr91fIU-+aBui+bi=y- z=+wDHIkrf+fXQ(qo`4sPO(Hw_rFRv5xO*4J^pI}hI=LQ$zFIrh!!41&&3!X@Pb8%G zZm4hGF=tU!HI}^<5LnAPCD1m-%6IvTjxPNHCfOs$%u04~3v+olKbxPj9@%`F@Ap2( z=hdD``sCYkx}fEss(4g5AN-zJ-VIF)%pmUY#^^bw%jG-_E70}?t5FEXuk;;9^L^l(YBi}fKL!70F8A3O66$!?JOtU)N(Y~BtZ)R zG)JzwNt*IlYxjl$0rz+q2Cutq!U0v|fo%cAdnWf++i)OnSRY2ruaAECeb$nZ6giEim! z)SCE}{q8(EA$l&{ETe|eQ}qD_&-NNkTiv-^N>f&rO@8;kyJi??@tbNG&Dm|TEZ#y7 zFXvn~h%(>2p%Z`c3#3%uhrbq=mxF|YRHYMX0_Vq932td@)Ec$az%F#hUSC}uFczpE zrR0Ac3}tR0Cu2ii7u@!NuFs(ATSCo8hq)FSF&8Fg=2d_o$OWD%K}U4IGsrHX+rb*% zAB_%k?}PWItDk_zDH2|0HMO}8|Bl|r%}$FSLB|C_7gJSc(3uLK{tNhv|1tALswq6s zgPH73Xy?{|PLLIFNS=A4)K0yd&=pw|<7#x+#@9v1%yUR}9G10bcd?jcT zie=p{_~=E-7^}O#sezAB?s{Tq*?}#YSwe0^9-BwiXj%M=&{atv#v`@KJGEUy5^|;E zqjf>&jHM4OpCmZ)N;gXQ{;qLAqoZ;?_MfUa5edj#Ln35ejW(}87jiW@dRT>%$M$z~ zvK%Tl!8VbY2+F+X>gqixrl!%tl<BARtTU(xRXfV2;(9jj!OVe8VE4vP5Xr);*9| zFveT=R_}z>LGgu~a-MvekNl<7@a(J2oz8Ep#N9WUFl5`z9w;nmXu0`kMCiC6I~aA* zMWt$}du0keVz+UOADR0VRbUe!fF;gFYfaNYl2A~Hf#wvH3_x0I$@+czF)BvJeLdt| zDH*F_21s^6;~_|gf13?2kI&7u!>a<#GjMO3!%hUE`F~|Js53m=5Ur?` zG5rVfNa&UatP8*-Fe3qrZqC)pYFPB4Y*Z!?O_{#Lkd}ao8?tdbs_T8^9gLaAdH6q7zly` zZMvi+^&?Z*{opH`d95Z{4km|$hKehNYZ2Wd*&up`)|(qzgI0y9zDi3ySy7W0Yw4BV zOE_2RG0#7eyjCduErsRiWl6~1d`sraBGsJ#N7OC{T^nE2k1r9UmlkvEIo8Q|(K{pT zb@<&82vTk0;!%W#5ENmNQHs1RVmRn*%si8xcIUNC#X6M_hu-R%t z#cG(1;m2TNDgXhuS%)8#)&oKM?3r1-k5B4yqkl($LQXPQ9OdaaqoK}v0o!N$I})M^ z`h%Rz2j)&RhAYyAlh_0|&@(PTcB=BVPA*qwSEF3eBNoNY8anz=+hz*wR2)&{T;r{n z270K)G2@NKz$COfWQ^**u%S22-tqG9D=&26g{0D8-NfHg>ORfucxOd z=0V2%jf%d3!Xre_t_Q)n1Q(g2W~okSSQxkpav;G-SlDf@#qHz+41unwAS|*6)obVt zsy{a-${$q$7itNr132P9F^}K9vbGi)9E?xSXAa*r0R1Y30-T(XcS”KAi9*5Z` zXOO9byb8LILETL*;coxr$ucbXkm5C11BqE6xK5LFHW#Ts*mYJ4GJeyjqhP#Q+D(Pt zRpjhU#dm4otF36c7g32uYg2vsBS>yFhR*sPgGr^!-o=3uN+M;|U@D|+cku_^80tV~ z{mcIm5Ekh|kU1hokVj4{(bLOG{iykSaKPx4F`Sc{#a#;`{mwMw&&#;=^o>IH3A)tR zL#Y(V@0aQjiK)vaF>n%BN>*3k9A$57ey)z&-^a1U=DY!-Ecf{Yt!0gRZQJa)2N-@B zWJZo9zj)P@;tBe-iil~8#;lntqY^{IP;9KL2`r5r>weqe1m@_KL&!f!!g$Tf!;FK0 z`UHi?eX#od5ok^R5xws9AG{Bi1;CH_Ivy@PcW(ur8y{8&Uo3iX`@zP~?4S04g=zK* z9xZr~x!KwO!D9tL|5rcE&hKftJfwT}Q6xKj5I08!=Q{*I>2gd0UkGA|XEw$vwuuYa z5G)9Kk9ohdod6UxIG^>Cb=i=fn6ZulT^upXIvkT|Hzf&?NJvr(eTPYn@(2>h;M*wF zvJpyy`}qk;&4E45YYr#IbD1AZvE`Uz`X;{4et#=7UYp=|8*%qJlzxS==Wg_#8O-%T0WK6iaABsw94KWJPBS6TErQ~%!Ueb|>s}zG|m(g0}b$Q5- zfBR@ioJsL^K6l;K(>_%@(0tJO{6R5pK)z{hJp(0|5ZHRoiPii|F(-8Y?24bG{7*5( zT6r&3;gk@hVcU>bH8K1dh*-$#BDi_;E>O9E{~quB@YtMS-+1W@6E4ua1+EOdeohT% zx%G`o<#*~5X@cp%N&&KS(2mQ=fn4!Tok6@-DTs%Sn_VnH_HvC`Lm5b)^x1ap!TQL3 z=Wc-VU^WIh&jrZ+p?CHQWHC?^ciB(p58+Z*Fr$Fhg6Z)l*C0fzI?guni-s5^x4#(dQD|*HH(^RS{kY{=H!I%Zio(EJ%WD8Mc|xYacg$k->jGxHKd zHMr?RjJS6YV-B^MBR~Bg&zH#(XGL#GM_8S74orL${IRUHiyOV0?6Icw^ZWAp2+hI% zjp*$OUZxfg8GQk9RuQy6#S|bP(bSClZhx&qsXpH6i>8uLz`&m2ewb*=O>h<;+6PIQ z_H<0BaiJe{RPS>$W;_(Y1Zwneoz4awXYSq-lgXKK|&Tr%(m<;^Lg^?P|M`(E~tRPRRpg!wOl|&jd71EyPr5O>wHl`!O6dWD4ihY(o9+fl?4tU3wU@y z_t-c%K-#TYqXQhorghf0h)CEXTb5%aV1)!-FUmp$Yt}F5Y7GnPhfRy_<#sg+8YZ}Z zKss>-IzmaW{S}ZLcpvXZV-CSgIBEpk0%#TChpNiXo`;N=xYX2t6WR~|L8AwyiuF)g zeg^XH;*v-4i$&p%@{+Xu+6^o}?Gh<{Q#6EL6a!OPRUdZ~-^=?-+w=&;*oWsws(ouS zHV^#4loGL1~(r;8H#Vk%)5h77&;P}5T(1Le6WVHER zoL+#M5mr*-YkRiw*#dp_0?mvzVa<(yUl}5mUq7)C)G6%>UUUj0@6a*FiuOClopXy> zMwji(dZ(`>Gw~{%kT4HI^nU!HGE~7E$mDUOqGk$ka)4jSIJ*TU${a~4ogDSej~FQ~ z7ZH63@jF^{h$v!*LtR(Z1($P9M@Pp37n7R0jmCMubaA&$-H~98u?!q@g{{B$vibf~ z;eKcmAfdORzO{qq==dA@4jYych)&>{e*A0r@WBt(T_|@|^rdAGYa^%ZPS z3k&A|dGA6Je$RJw&|?GR{nYoP9wRj-cnv^qwD=0tE=q*KaM33wB8`h-P6?!kST^`r zA~MEmO^?VE1worjB_@=o0sa)L|KvGMzI<1P;BgT3ME%97KcnTqm$LngcL}Yc@Jb>v za`{W$%Vm*WlbqCu{aSY&WMh$l)OH=NFpP3WK zepLbLd2ISa-lnCKB8l09)4RJQ(9Syq#k^&p~(O3C;0BG zMs4-0RUQ0trA=4I=emoFG-jbafAg*ThFJ58Bstk?iVe4{s^7Aw-P-y4zNGT@Z__XA z#*Q4Mg!fL1AEX9aDZq!Z@hs$?iWl5^EAL!^_U{JIhnd1w`Il);SXw^`;x1%|@!8XQ zBoXXZPH%B2GLTryS6W98OBq5cF&KKqupD}$j+8$!L0O%vaR7u1|eq6P=-|=eKuI!}Hh>czHXc4aY|rImUUl`02ifPoMLk~f=@984__ z?Nj3ZeSdkVMnd^brsAcNuWqH8wTQ>V`N(~_NFpDfpuPvbYFo6ytocFea{cts4=gS| z}7kusTA8ciEm_YO!6 z4kWJ4ugnKV<&%$BXqjv!>6@D~exn*wnA~#Ne)=)^N?z$)i(Au%4h`MLbK6JY2QJ+J zGYU=AU}G6CD*`HY%gW37^Eu}*Oxv0K@wjh359)dkdj$N+Eu#ut{|AnXqQXMu`_RT# zgGPTXdqjB@d+9Jafd~LW5lFo4QWXph4FQ-cFVZp^d2BO8XE05QH_$cURC$BmzdYEVV5@?S1 zW@~wAEz^17zG-fKnwwa$2gM8FkadDTxN4s}&jjB*Z@^pFpjuobN&I_Ov(%P=-)+Vw z>Yn?@T64H7n6|OiGqkYy;>F3ELQ7_^xzmS_?4&;LzuB2PS614ViR%4u(AbOUbWzbn zV!T_P@E$iuF-LMd>~eTwU48Y-fY#5MduYIc)cl1P4C%15|GUOlb{gj|fzvyK0RV(` z#{}Eox!UmubQ#(u`7XKJ)2XLr$3tHzWZd7>QW18=uDWNdMZD+_I{)eOd--D!idk-` z@(YCCEa-A|y>U4Y&!2@+B7kNldo^aA=slsMIwFv_p)Q@zDiax0`2D6!RqhjdsZ{)K zCFTetsS$xo6=RkQhzJ9biPATwM}hKAD?ry>yMgt}+d&r!@~Ye1Z>sgVfGJ8aCF;5H zp9;=j5){5p<}`$y42+C<53{9rcJiZFpb`v>b2p_=7C?mh3j~(7TpDFx(Bi{dg(xHK z8je!iE(?=ilq)t?41aCLmbHx%&7cd@T5}(@-L9QP4@YxT@TSd>U^BtnEW^Xt8`$IK^VsNq(As!wuQ}{hd{6 zv4wwlRn4>O_Y=kWgRC>dOW>{*-B|dc03vNl@0eKX%@6iywd`LwcRJYS#_iA%@t)eb&zjsP5vWZ#t%v$#{oq4o1 zv-kj!V7nkQh;e(zlcRk`*^axZsVr>z;W+;%+tKlrw-acD!#61(Sl1-HEf*35w^8zJ zEMHqK4@d6qLiUQ0+BQT@DrU2%eP8oM&(Ee z>eIqytecbu>0wDH?3i`L_;Xib^FWUU8?~a-g2QV+lp^1so7o_ zJuNTqm(`gXid^A^+~+RpYfAitn>5(7@qwel|M>Elwcx=Yyj^O_AKxC^r~O$t`yh)` z{V9PX>J9602P=J^$M=6h_m6!fJU@0^rxvwNLJJpS`neVKyYPr?(YIT5m6S$_75-4u zg+T@?EWUo#zE;b&Y&|`dA3Ty_+#{IkK*PcM&AxI+DXD4{``()nTN}i7#_H_`={?87 zWA@T~X5EhQOcgH=1+oF#`p36T8A(?%P^8ErIy=iVs!0Ro@!*XohX#f&Xl@#Sba(;Al!O0&|+5wuU5p@di3|f(UUhfdO z5)wYQiKkKa--V!BV1+Q5nz`f4&wPzKmnK?_VxL_~x{u1F$h zw5;_P)?upw1qZ016J+5oO-x8QfcY-rZHau5T-s3VIA6|l?p=Zz^j}u zHy&fe71`V)M34Fo%+2m1%};$-+T$(`OXjG z)$A{us3gkYc2a0GP^C8xs5cnB(uUSRZpy&PS&nx0K$CkX+enRA`EFER_?UMMx`|nn zK7IHt`-?8a1@zcgr{6lR z)38;=5u{Nemfu0U&B4U90th|a6Z234tW$z(NLw*H@&HxN#g!an)c?QqoghGPBZOXB z`U7kgFnZfPI{;N;rBUNB!x6}BuVGREbisG@5-uXxaL-2kFPGnIpD$21JD)UEv|Lwr z1AByuQ2Pp*)mF7)%*-K0Hc`FTI_Kzn@Q@RckU+BeH#kgSo(%{HxOTlqM#jbxLSVa# z3s{@w&dRqQ?fb6F64bZwd@6b|=fffnqN|KmYliA24%6uQ|Y$ zus1?-OJyajPsaxb;DG^0wmrZiN=izg1Jlz>hK3Y5IaL0=AGV>0_}~C}#*d4c9whJ6 zDE~h9t}4wnEZl>xK=PT#HG0Twf|y;qQDJzpLv<11S$@?XQkO>?@^>}3 zga-(o9+08nvc*}7MHXeUo%&N+Kqdgb#;@CBO=1|x05()l&#>7$7eP5C6Uk~NeKT^r zS0{ZfOGT%)h)~qeJo@Bm4R4R`nGC5xoIY|AM6>po9`GoEYmJtjjYjyxG^4M)`+6Gz ze@LN`GL2FxTEHXZz16W9mOa0=6{Q6_F*&gIQ}DA3CtFd47ZoS2ck|(E1q{3m?hd-K zA1)U+;UmREAbh$|Uz4V{*qBx(EzkH~MVb+fndyN!qKEw3e!j?tX12t!}4$JkB)0PaX2 zC@3fZ0E8frKzd{76^15dI4|Zq{QdRxNH=K*Z3tSdsA$x^U!lc=-zoDRXp z%iBNv4(LBXp+PCvv(y^}XNy1Rga6xdpgm+01Q73x8sUBC;Mlg;2NtJm7uCz%=Hi?j z`rEhj;VlT+5xpYwKKUAKrT{ZTf&mO12QU&@kz0Y37QPJ#lDUL;I}rQ3a9F}_bzN5u z69;e-z&h_tMe7HQRg;Nx}&r093w^#Q^sKqU38^pRH|K_pMvI z!L?Uk7oS?{EehCfrWX^OzxDD-|NeA=#5U3b&z0baTwJyEZwb%f;Z0SP9E3vBRO`1t z-`hi@@vsu{d9c#*1Gn3% zqbrJO(hdVPT>Z`kWW3GAo>^q*T~L0~-28pVJ!>6860zATLl@oik|LNGpQ8OJC`+h+hBu>Ad5_H%!=F9S zIWaWQVH$w*7lbQB;$K{@i70thMJ!0os4}eIgt6}}7^?uKDteH*55y%ccrW#@5Kh1s zLl5XPIZ4q^c7enP{T2*Sjr|&OM17Y=7h=M7Arae zIn;14fnTods)%8?$mGvr*JR$3DwH(Yv`Ep(OKcC@K~H=|y% z=!a+8B1#XH-G#)tt+mX9bhuFKY(R$xQt)|TlI}%QPQF4>Txk?7SkB<=Eu^W+V2z+t z!eFwQ-;zOzCtZ_^>Ov<%Z9g!H2$fzV2DW0~?`g!4)$O?unpqR$E{0V_Y$Yho&JC5f z_=wU=SLl8Jsmk!C%rL83pIeB0skhMxd@5aAj zosNi{+W%*Lck5636wuHu4M86+l{s#m;3EUy-3Jm*JtPuY*AfUZ5$!KU>a1`jRCh(+ zEf}-lAz)m@4MDZJ0E_ScLWTf>x$clMtXT7szI*pB8(T?1K@Y_HG&KALOpJ|(M_pYV zGXMsW&dyG77r^TUPY43^{@3zcZ|_q;!yd3`ySfUxV-F7vL2?OF(FER;U<|l>*MF%e z0_Y$}Aeo#LhNTy3rU0dZ69zF_s7huW4;@9$OFdaq&Ru8n2!u?6vVyG6OYv;1XD=%& zzCG(V;LG#SSf5xF6pO*Q^~LI7uYJC}PFf}Unes5LG0H+s+4BSS=aTPjoZY;VmkG9~ zYVYf%;@?Pl8^+eKg2|R&S=7SCDQThLa9R{OPMy4}I7Ul8m89L&nO(fpN9ClIolvv^ zCG9Xq!t?}#9W?i}n>zB5i$A^pSas0I#Y>6Xt%mZ}4nre;H=kCKghA@M7uK7!_!ko& zhYH=>>Tts+48$ksh)oGY|BaoHGIh#^#}wD`-Lv&v#3haDT^t>)zNI+!xSDW_?$bpH zj=Yb}$1@L7qF4g9GlV|{&xUhcs54x@mw4}-mL60Z)<<$Be!BagZe)~yOdE+p4TLZA zqt+D-uoZ-ZL6yg%K}DD2zK!q$&!K?7`^g( zIE~@qLueQpMhc?^(gOhvFU+fHEr{Z{=AW$u*fmgV%K+r zmBC*?8i-jQ1Vq^h(Qq-W*Y40)OglRZ;36VjV!|1Bqfq01Hm)wOwJZf^X}hYwn-tMS zXr$P;7wWuxu_IB@BH3?mE&Ac?;Pdz)@yic<8yq}HYO&P6#8solq0L9@i_hpTe|C#} z=A^gyeR`#rL?*z+8_77dAL7-|)i*;Rz8Qnn?;II5rulhk=k4VKRqA(?sDr3a96K*iX7O;%=C;!|Q6*+t`Ag3j>y^t^} z1WvDr#s#NHKFxr8v|=}#T4T7!lE(;mK3&Bv!9lsp#+mV2{_|Z0O`Y;d7;9jzgP^&T zl!xheZbacyJ5c|(#bGUPsu7o#Mn3!t_8~B#78Dno%>_WF9!yZ+sZ{(BjYh5Vvg?xw zy_s_K1`IYzVs~H)>Z|fQ-|L4N9FiS_gVA|;s{jSPNh6LF>40pu(f8yqoxxBSfsU)F z30O8BDHr4uKvX0gxX9jT*}hY)PAbDvoJ$1WzmecJ>&WxHn?jYq9fWFq}C2Q=yXOGMB@b0=LB z2U-8eS&X9;Y@%bwas22Zx*cjw6A5xIC~fp`X% z8~ko~@RC#}M@JFdt8D{+a%~KYzZz8N)wOTCL)jsCj?e=@U0_rE6EaL>2@_SAM-B`t z^l~+F3_dw$K>pdid|73UnB^~4kWhe$fJUV)INYiWZv?VM!rE%*J0R5y9>>31-*};=D1VHQ;ci&F*=4pz2QvW+`&6zNPn;D;IRFYP%j+2e1Xm znI!sqcYBPyZvUM*>`OZ!-8Rl!pz8FcGiqdAu?^q}-4dz9vc6zh55osTAupz;-;Z84_|Jg}}$put>s-THGUe*dk+t|GHH2Gh@r9+AKydwweP){CAGjxlul{Re3W>+0_= zHup3=Id<=NLdCJ-4? zsua`M=z&!>Br2NyH21)gzWq(Xgun*(JxLVf@aXgK}ED+ft8X{dDUzx-koLgN+24>80DwfG;1sy;$tEEKP zTKGvnReK<1RqvfOG2V~T_{j6mM?TKLdXM5yi(=4aX>nEyoMf;v;UXXn%tcFTc*Nqr z6SH^;*VJ!3MV!aEA>ifVuQ(8`WoFK8VnbR8Txx$7xC=%)7 z!G1lkw;7)|JDDvd?s=YZlK3NiQw6uCVP7RBXW)b38}khxl#&KJ*NFDr_ox^^yyn*Y zQF8l7Q56teiDotRXtmO$J%|1nebA0AXWN~sYH$BfwA;@=MW|`L+C>i_C9qbXi#!^V z_J#%rw@UC4IGz&0=b0A|ULPm8$+-B&58m4p6T}Z9C2HpFA?4OwVtBHh@j%A=cWnBj znOpdVJer5hN_1v6Z}rM-RcLujeydw45kw17ce>)m3!r^0x?THG2-WahM->Zkc#rR9 z0I}T`%jTbg=+}c-ESY@rZpt}lVY&-O4fa6aqnF7sMBzK9D)6>RIvkGuN1~a%;{&4#&u-&TvK#)SZ8wL_7Gh8#4%M75N0BiSQiQklo0Us% z%$22tGf~?xw;#$e_YrFO#y)r>>ml^+)9DIo_rE8(1w&R($nO<@W%%*awtgw|I)i|M zx%$1cyZ}X^R)kbDwkEEJY|9JT!J#Nw%_Ri6`PX20V6iu#PZ^SGfEvkU{`xOLJ z;g=?f>cTDqBZ2_?3lFZ!U;Gdw3v<@rogZPBMiS=aeNP2$022%g=*q24;{m_a&Zzgx zv}OMp7!LB#s1aCb9st+Cq+Q4c^RO+*bpe=BQ&tAu!N+)s#}swKa^)5-pG#9>4`!8= z#+w64c}Ub!#Bm4|a`faYD%7Vf2*y9vsXUCQrLQ}ybjk5ZTfj%=nNidLfq=M zko*|@!Hu*WvD)VSER{9t>*;cZ)pGc9prpKlOWg18FWX2f6RALxHaTIQ4{hTic|Tez z70L}91tzvAd4(oPL4}W-)at18ZF=PgdOG|1%4z;fzY?yIbtGl-qZuwtO=#M|Xq|jo z(y>V6&x>;&0qK#$HTFRAxx2eVrt=IV4Y?kZU(E}gRD_bG@&>oOHJ{cqnX+wVTgJG& zpsnS)2o5%b`{k2Ft=UL5#)PofZ*HqbdHoTLxmOlFhSL?=rIo5F=aN8sn?l=u4E3Yl zV?=--216h*m3o>^4}RziHkENQgFd(3qA$ zXX!&yWzVNtkwO&u}!b=%Y~?Hx5|dUC1&yn z--!s!%=1c$&o@XK;z89AQX4a`hLXytBuuJqJE6)CmljgS?Q-mqHt(eUU-TD08*luk zLyFS7uTnujZDP`PitnpZTwY$qQ(EzPUBAykSa4R2dpfYb7@mD)HMLAWi;pxOvyhGH z3^RO9jetw$3+xPDjA<8EI6LuvF zUql`waG<&GVhhZk4W+@MTV4;?aocj?iup5^H;H~SsGf!uq&q-|0zUY~N-&a2g_F`5 zojsj`X+MpijxjcoFHl?THiHPUI%>pgl^fpA)Z->{7*tpk3@~Q?Drek8&pS>M0>|tNbT_AAQQc6UB4ztEdc5QAQA{=$bKOTW^^)?abnvQv6UuNyo+MsfvvL zw}AJ^9CAX8@=5dBU-qQ6lU8VmP%F`_Ct|{bpwvP`q&GL8e*8ZBx}w+XKBtQ7kvGlY zK7KhSLK8iGlA17$JVmmyMMz30ueQ}6s-dWUuH>+B+`W4Rid@*(q^11;XyxrVcY(zY zN&h04Xzwf57gb%E4I{B)wA88Tax4mPr%8Y9npH!%h;kWu8FP^jW=d|aU(rU#h z?lS|R_{W8!m$sVjYyArfQoR{=!Z6Ng{!~{C-Fplda>O9cr|~1RweymCTv_lthKWsPt=DQQ-O(#YGF&bztRQe)`UtxvgrCG=W*49ndfeB! zt>k&rgS$eH=_q`39248{V|FlYz&Tdz38q$HjnER$5r4s$w$LdgfJMBB7a`rF##WWx zRE@2DCH%Ze%%DG4jVP;nbF(9yVq|}&^LNQj|{n7P|FV&+=#jX)C#CCb2tTosj-!M&ZVO zaI(U<5ED{IJ-b-0S7i%PXI4XLKmqMbKGbvKJN#rhr8(C+D%(C*tO5^{z$LEn4U7^{ z&X=|Nnh1lA4L&ZHGJmo`Zu8a)@$1YM)<8m(l7;Zy{=b(`(f;h?MD9w83UPS#JN_0H znh?Mr?qJN4&P)9;W zV(Ht9`p)Ji#TJh;#dJCzmU(%*Bs6*(c?Oal26gs`d5Pj)8KPWPO|K7SWND34=3Wv&`Q6l^(ol+R~LSNFSPMW0>bI09q_eDnIsl{2y%m{?@*v? z?XY0gd6$vk_JV*2(FrOGyUtgNUQ&Ly#jceq_^5^EQ4S>p9A9+r2+#d$Hpb1fepJd4 z)a`m6NF}zqYVRyealNjA8Oly54Ki#zy}emjSR8(~i9rrBuyVP%79cCb!NGxZ7QzZ3 zB92Y^A#hgFaqasZGj#8|W4 z(K0loq^929*eIQ}wMml(!pzU_15j?Zwj7F@tm+vh@7@9A0Lf?o#{yPxZ!sJe*>=<4 zOG}K{a^Tej+yl2f<5gY7s@UJi9Ui5s3=&6qH`R3>lRE$LG2^ojj4K z;i!uI2=m%Bt<$-riDPMbZAF8wYF7#gd#lW_hXr#EXpyAot&cPsseCbc$fk9VJ71x} z_YUwqvx^W-6CT#>pUp~hvNsZZ@YH+b$X|QpG%81X#x`B_R#vK4=xHM%qa;a%*_5b+FyscaSJwT;)a53qrh%~_;S&>fU{n;|U>SBfX*zhs)E1C@;l(L zKYwX6gW!qk<~?K>GK04LN&84M_1I(7&<{Ah{k*6c=8f7y6QOx*2 ziDeGc-|vnq$gd~@9Vj>f*LQa2O0`+Re*k*Jh&*8KKHj>0?{NEj!g3Q}l>YD*yAJg7 zIf#bc6G{*oz#U}Xg<7cf?=xrBYjXZPc&lBfWtLZcNXyFdgTKU03kbRcFc6aChr$3X)C{o;=U|72*5otb zU|{Q#2E-i>^&6P-U^%HX+=0YHP{$uYv@c*=iR=HTuI~=Vvj6|SN}(bR$&8{>DSJlt zh$Jc%lD$W=x2Wt9p~%ckvI?OjSxHt`lrk$JD?97=I{W^<&+$BeJdXRgZ?~?Coag6! z&(~N21j-#fHkzXFDKV>YdJ$?G?P3v#A9CNkIEHse~CTnoRUW8SaoAE&h$Vbz502K06zCL^qI7= zgi(eVZIGe=O~Xl(GW&#VBr(-+eqTq%a{^=vTH^_{SvUfUror!nQ4oxC!5rw=xk*l0hIh-$jsBgBs zFq26;hiQ`5A+;P=uImxjs-DjK<0GeL3pexr6^E+atwgG5vyEcZM+H@d{aGLHZPf0N z*fere<#a#?>*jsbBNxNY*A?EkW@?#*&``S5uZP+UHYE3IFPEDf1rvv;J$B(4y4Ji@UVf}YXwm5 z7=yG6NkMHD+P2thjl=RagZnZ50F__9HYUSI=n2`|{?K)-y4a+BRxlj-GcyD1CZGc^ zU%pg7)QPt|#LUla+9)ivvb-GnF@s62y;u`pBBdfwS(txy>9NJs#q(EMpk4LqJS6_1 zEQgUdE31u2;_~cB2{dD|7M5E29>eDI2X-64L6rhUgSE8R{AcsXQ-5JI0ja+c7@SXy zWT!;1OM_KpLVkP^N4u%DwV~`I2n_6Q{Wq~pynt{t$}`_cZg?_<97 zONJDooUS(ImjMzKeou4%HYSr<3!dLkhKw2H2%+ft z@gZ=(4J?~T;9OW)ThmeoR9E{dD&Ce4t|FvlWUtdp&NqCy)iS0iDq837o)E~MzGvk* z-Ex&j} z&!aaTBjM16kpIpf(;el^W zD`L-<-G^vc#m+ry2aN=Tu71oNC$X#3(_?L&K~GAs4EYRX2(0>PDeRDu=n1YkzKK23 zKIos|uK&XRO;M-@{Sj=0k7{{fAy|Tn#-jvV}#vpnR1jRuX3Kb)A*Nh zd49HUw!=cT>+-BC=dL>&Uia0#v!`MVgv|mjCv0M_p(4h959GsgJem=s6f&n}Tt*AG zHy7tbahnS6?tJj;=mA&}_42r}4~#bvW;py0z*ALcylZP=@j5lP-2!?O<;67yGL~!s zHGZ(Q91Q@7DvxXhw<_3}8r3u*23I|w^N{*fX7C~7#S5lfg$&pGO(t*l;KV=MMJax> zJRVAxUn@DNvDNf=nVio3QeUH@P*_AnPEFY)T?WQEr?Lvg?tkwy(X)S_BE62~-&H6F zVj(RS(cIGVt&5&+G-)m0cFU=;S`T6Hg(>p8bG@7Y?LbavwfH>~Mvg zo833m(Pj9ZK`)9~8HFYi0unG!r2b^jiKfQJsf7jeD=y7(#}PnL0Ad8K2OlhiU2N3= zmBuv-viCxa#byY0?ts`}-vdeATY-U*OoIO_d-_!+EVpsw*?@W5W8oB^Uw;;j>6qGIG_-j5_N^PznyqrJZ348Utt}%A^ z?{{&5fKgp1k2s->;D7d!*~rsHv*XE5Qb%VeVtSDW-6N=%U(MIH2h0INLfHM%)Pga< zk$>%IRxgZgqND$SOb0AU$gn%GK14C{=GGSGaHYpT31Ro*VyNsLX9)dfH|)Mv)UXdL z7tq<)CFTzw!M?ws06Z*E-h)FzR5dgr!MKcw_|Vu${ZEWu5`{75f3Q%y>vT6c`2$~= zPCj5}m-5I!Hje=@vJ z;){|F&ph}+Ft^yWd9(UMu_DX>!3D$hp4IVOS%ix^1)~bGGLfD4~TvEk3=%yGl*-=&7o)Nt)2t&M}Vf#E07?r z>oA<;3K=2Dib5}i{u@_97A^oZm8eNreZ$Y_pz=;;W(mX+I=V<8L0HCI#Um2M9E?;| zRb^yk(DhGNPM(t8v5|s8m{}d54ZW`$)OD6ag;1Xa_p5m{#SbZg;x&qj%W>hM zp*<)8aDu>H4jb5S;m!$=frU^4r1mql++nstv!#ef_tK^8t}$zC>ka+za%p=rbs8!6 zmDdtTbUf5=IyI!#J7*zp3~ggu*uotp^L`gD!SLWh4w_SC^2I%XCg zW8PyEw(ne}FK}^*`C8`|WQ#{chHLYBD6Y4?KatpVc%Ch`&Ps=E6ewOT^6=&@fn9v@( zN?V{xk(5BH1a1q!yID{jiK?!u3TNY(uy>Bn4RkT9;oHRvH_X& z%m|7C=nUhMS;xn6aWR<}F^{bO%2BKIyL(jknRojK21SQYPp)(q%hT84+@1gD4lr~G z)a@;wz1q_i7x$k!wbri8ez2K}miZR@snyx@0{q2)P{pWxdfQ}hzZ#ESiuXLzQy}lB zU=1)hj8pfJ_0ay2f!W41NXjxjs$O4e^=<4Yh^IaHj&zN^U$0VVgpqgSWoEi3tF^spd$vs))xZEN{a0f!_eYg^i5B_~S}hJx|E8#PNkLHk=lo>!2uw6Uy+&h$SB*xStq^ zwXJeo*h&*ZTv_O?sX~kcyKCT50bM?KE{bfG$*l_bPpqofUF76PXA}$#A%{vu^td)O zA8+oZ%@PBK3G1G{J9pkqNr`0gBXoHn0FT+$HGrqV4u#q~{4!xR610<(lv-5e0G9`3 zG2k@_rCuYW10(~p*YFOs5dl6U#`KCNJ%$r6Xzl=eqlc@53=3?IL(;@eYYJ!DzP0e1 zpPC>__pmmQE%W?|Z<@L?%9?5CRM;q^rbbS00D&@`gBk+@tvk{G>@tDml8s|NlAfQF z)9>Ef)1zBafW!yL8Z^)K9)z9K*MCa3f^dA(CY9N%9t3tG=c~UOYTtIP2DvkFrYP** zn>k{Q)4S|anKUGZ{jmT%N?*1BO*g&YbEjevOd1XN6qJ;X#;RHl^LA9ipVx)yiVU0Y zk;d!(kV%`K7WY~#Je$1?aKzMsCwY0bd<_@`Y2Muuoca#|PqojDL=uYtaFm*wx)DaF zhh=s81mOOJvMM+|C?UrbZp=>CAYzJg+}znjVVq15TCW$O3xLI>LegX3Kii%D7KA;J4<*%o#(zJ^`<`kv5~yHLp-rDkMc z5CQCf5C>vE<%P7%cm;h*#-RdS2rOseD@p11<%ycYI@`A?qA{`vDp zTN`2;TI15;N`g?WM=FUJLYRgh*>jzI?vRd4m^Gqk$T=3BkWc~j$LwSeE8zYhLLqO- zrUz+;xO?|frMzKa0oLC4!)T5&s9ibECQDihJV4op+yFm3P$A&ZLyS(~OfWk;i)t3& z92|L6y7>2z^I0ZlX33!ELdTQvF=?H_xR! zT>CplcqyWE2@Av5M74y!^O4o5sUE16Z@+1BM7U18sNdj+n0?TC_21Dv3=?Ih9|Bbf zgdxRiOv2$E;eW3R@Np;f%k+xELPAwAkbqD}rey`n2SNg0pwkBpi~Xx5N_8Yn-&goD z6tnj1A;w>5NJJ8Ckxwy*I5_;a=F1ue14PRO@(A?(V%(?+jbaSl+J=swIFSs}!%(EO zzMkGnJ&V18Xb~g<2u&WCiHN-c@Hxf(=K}zzdGxCo7mP#_2{Q~^xFKqR#LrzXsxCFV=@jZ)3k9GmL@$+9_kbPRO-Wk@X7uQ*RACq2Z z6WpWOJ~mg8JtY;cQoUC zqt2RVqdT|u&O~NfDj_}|);FhckBBJ{=JBxN(U6+^2$&pfTCgreqX83Rg0Fy@0y1Ev z*I>)wFk_E0_u=FuQu}X|o4BxqkTeYPaFF2$_&M(qFMJ};oja$io7XvlR!1A_IIl+XN|<8ev<^?iKowfyQlU*KA%94dq38xZ>UbPXh(d$Cj3Hs230} zeSL02v?RBg7Ez$DS3zrCM@#5E{=5q^H6S2%!5<( zsR>YC(841cI{tir<(Wl029RM#V;Dax-X%Gy6sCTDF_Q;tUKmf#&(AL`#J}igyNwcX z1-M!|T3RXhKPDh4fjLRGf*}~(31F3}0>%6<3jvh0k8^X808w?LS;PAF$dTNtDlf!P z3?Nt=z{EsY*+5#m4hJ+kVF#h}@x{D-UQ;#5 z%q5?zT*h@Cb|BF^NnAys#3!&{!c6}!h+@rzd0?3UPx1suca6dI6*>AEtM*sLsjn6| zRd-N)0-0o{hX3U%CP* zN!RQPdv0Fp?%2L%@4F*(bRm~Wq#r*{w?A`lcDWcz!Erx~gL-3ER+2CD3&~cBqu(J{ zRf_rFg()HrG#5)G*`Yzt(BxLsB>1m)ohb+e7)F~NR?l+|c4TX?e_TP)y=Gk2gUXDK zX1xlSJnj~L2>GEUVuII*7ur5!u^GU&4_76rgJRKB+G6z_P@5L0C`L)cNFv=YUPeiZj_}e`Jtkm+cdnuiMC#nbz<@_2g_R)E zU=Rzj;|&IQ_>qf>dd9*0hH{vs^mgK5+1cLFSE0=IW%w6h?~(U>-u*k55wh*gBnH7s-&Ifk^8dnx83XMAK$H;4_uSnsHmB$1?Kk*P#v4^ zU9gTwm#INvI6g8kKYl4y`*U%z;>%>Uaa%D*28C35$vOv;%&}OR^BmpW??r+RP#++j z^IsgcbJwo04@sBV!5w$dIWBJKaE%!@dG=!l1w0h}1Ui@X@g}3sCn%YT>#}-E^F5XL zSb6?8J5ffO%fCbKvcMr$uBlF0{8`&QP1()6Ypk9#H%Y^tEhu-ly8Qb|PQ`sJmT4b@ zD=SZm#BL%1OJnK_j7xCZ;)mXxt3&MVyR`22oy601SfN_Spm>OQbc{2Er>ES}2Vt6L33-WeKumI1vBX z2-LUZC=yOCsF5(3KoK|aZ5q3j10()zaUc$C$CKUuVzQ%peRUEHAWSOcx7EPC9O8)7 zkubtZ4hjj`rMQ!xhn2lC7cX zi@9HrqB7h)!As{8=2^&OR!R7u|T zRptd&vpLf7%rvQ;!6Gaq?m*h2v&`melgk_-21Oz1)E-hoV=_BrAjxW`*~OJ`oJ4X- z?EbikGKM?Epv3c2osh?xtPc_%MFuH%D+pahMkca1%YynxJQ1zCt-sf{O6sD(Sbq)6$|1vxo&uR5+ zCCRm)rCmqcuII(J%OcWgYPwXO5LH%C*mTD*qs1cA)-I{;w94{+s@Pq{5%RtV{yg|N zb2|Q{(}Yu$T)b9#aG(qaTfTh9-~5RmycAm>N9$+9=dDXJBdnShvH{`|+h}NJr>0UZ zE3&ebMoHLbVgU~Y3<|##{^R{^q)?|NZ}iDf+(O;{2joO4=xSje1GO~NM6jZo1C0UO zQE8Ok*xVp|2GmTw*~UxAzTo8fpcvVETxS-=2*qolrBLrc39|w*5<>%&AZ3>|!tAPQ zzXfixTM1*w8ZbE~CcsGHyXNcS-$dciIf9cm1(gm@>;|{bwQRzg3ui;;l^0wJU`>us z#7PGGD0G;G`wuPFyb$ZDtINa$thBTgW?N?Kt{kwf&e)~Z9Vh#D2?He#CmvAE!A{7$ z#;Aiy-59p#<1UqW%-2p}1HhS56uYUEK}i%AFj2Am>CbF?L~@mtD@xDPlfQmlL16%2 zl1oqXqxTQRDQ?JMAp~T@SK{I~MyRX|wueVR|ZWR%E!SYDE(q}nyIv~=f z;p|pt=l4-QQ6GbYgA6Wzu$^1D!yB*bI$4&TVy5MpC+(pjZb2dik^U~kzh3gMKf9%2 zRX&Y2aRGzRIMV=se|Wxe;*r=MS||5*D_e#$H7kvEU@NMoTk2ii-9c;em{c46R?`2BO~HaQ9~2wgCK>e4-SoY z|4k|^S-v6|p(0?Dbh{1)p>0cpiNMaT&EbVW?Z6iHI0pxb>x9&(5d`zeyCIsQ2010Dlu!E_O+v#GYBp7%;yHi+HlwI0KFYTNY z=6A51dnAasvWkdPILD&$%xObENK|Ogfw}Zl$Fv-^^Nz$Vji>xj_VIk8WnwQgr}A7> znfaZq7w6N6aenpswUMn)%F2chvqwuyom%qqa?xG+vR=Tz*gxOfv-n`!R_$=cv#+$~ zPhXrry}4$)jBK;~X{j5xJib#GNBr!~y*_ziB(2)k{3_#d>o&av(NE;?KnQGX6qguKb6?N|7#phm2f3QsfN0L++ET*F6 zOPcCiUn|2>KY;F(-!ZDz8B`wEo?GqN+Pq>~JtDo2dtfVx@s00nyK-i`tDKPuqY}O1 z_wiqI9v$~LlCCGAzwp0sQC2OQi78nppAgY*i;e)O(&OdYqsUVS_Lz1!36V0MJsX02 z&Sl0a)KthU?Ck7M>R|d@e>})><9cn(%%rDhTDhIKvFy#!+`~&X6qa-vsg^qwQ%_8o zeH=C4<&gdG)7`bxnxq39bM1z#7Ph-X{I$36F!GdqeruL=aP{6ur|Gz*`>FQ5a`pnny!-^NBdYU;~qaZpoB^E~lI ze5|dl-C%%G0%2R1X#eU+$RHXdEcJGhf+8b*2X600<}Wd993t?s6rl72R^1^106i@83)49(+5cp9;#eUC+g^@Anpw!#PaL-lK z*YAaWs*2~$V|6gVBACyxW915OR7l;v!B8!IZI|lxbp7K4rm|{OCt{kuPfVP09=%|) z*o`G_%N?&|*q+T#eCrtycs*Stw5={nWpWz{Bi)RtOBKK|s~a0XLj4#RNcHzH9vE+M zH*uou|M_j#hrd1B+V*qF{%hHw;KF;Gp|C6Uex#{|Y`5)pW>>{z>8-6(Gw693Dhv9u zD)(L9+gG_dqNRQ)G;}b1R|o3w`1ot(bm|CXRZPr~Uegx_8p>MGva;X_5WbAT8&JI2WGgoK7?svkcA#1E>X>;UQ_Qp53>%r4-)h&Y2R+SsR!>O+Mds6XSW(BGvlB{QN$wzZx8b)CnONdPR^lvGq(}+(Z&hS%!F`TBukM17bLlGq)@$^?}M!-owzS}1(KN&YoKBxa{ ztRck2w(Z$uVqzl3(SKHg$NT)5;&(=7`MwmUd^ZilRAa*{zIF%`^07nqcdWTG^+tZ$3X9l1uUh<5$x&AF z^M^h8Q<;GM@XuS?c_=tDLMUvVgvy&S@mc4jmc!Q5(XoWsaO>x58?%ch4}+V4C|P<& zHZ?E!2&bh3b?%nwg#~4+9i^dnnHMfwLdjM(+W&H)K~4Cn(**K5nB&|%{j^QD|0ro> z47G<)aQJikvu<2kmfy7Gx+&Q1w==W;JN9y}bK(n1DfCRDqHDpf6Zl0jVbCv7KB@nB zL-=>rOs%G3p5AjG$OEhmcTe$YaomJz1Mp?WG`)5iwSG#E_A{?{+seeP#1j>4ur@2{ zww%L+-iNZjr#o)>eo_1NX@k0Ei^t14qow)8J#X@@96E%)b${gQzWw;!N9F%{gRQ-ZrJ4Kx{|#%NgR^)8>9pcmg{N``{{I6> Cpwbfn literal 0 HcmV?d00001 diff --git a/wii/wiiflow/fanart/GAMEID.ini b/wii/wiiflow/fanart/GAMEID.ini new file mode 100644 index 00000000..30302ecc --- /dev/null +++ b/wii/wiiflow/fanart/GAMEID.ini @@ -0,0 +1,34 @@ +[general] +# Uncomment the following line to hide the cover in coverflow mode +# hidecover=true + +# Uncomment the following line to show the cover after animation is done. hidecover must be false. +#show_cover_after_animation=true + +# Uncomment the following line to change the color of the game title +# The color is in ARGB format +# textcolor=0xFFFFFFFF + +# Specify artwork specific sections as follows. +# You can have 5 different artwork sections, as you can have up to 5 artworks. +[artwork1] +#Use the following line to specify if artwork should be drawn under or over the cover +#show_on_top=yes + +# Use the following line to specify an x position (x = amount of pixels from the left) +x=10 + +# Use the following line to specify an y position (y = amount of pixels from the top) +y=20 + +# Uncomment the following line to specify an alternate width +# width=100 + +# Uncomment the following line to specify an alternate height +# height=60 + +# Uncomment the following line to specify a delay before showing the image (decimals allowed, so enter 0.5 for half a second) +# delay=0.5 + +# Uncomment the following line to specify an alpha value (higher is less transparent, max is 255, min is 0 (invisible)). +# alpha=255 \ No newline at end of file diff --git a/wii/wiiflow/settings/gameconfig1.ini b/wii/wiiflow/settings/gameconfig1.ini new file mode 100644 index 00000000..a59baf0c --- /dev/null +++ b/wii/wiiflow/settings/gameconfig1.ini @@ -0,0 +1,19 @@ +[ADULTONLY] +#Boolean: Locks the selected title when parental control is enabled - Defaults to false +gameid= + +[FAVORITES] +#Boolean: Sets whether the selected title is on the favorites list - Defaults to false +gameid= + +[HIDDEN] +#Boolean: Sets the selected title to be not visible - Defaults to false +gameid= + +[LASTPLAYED] +#Integer: Shows when the game has been launched from the last time - Defaults to 0 +gameid= + +[PLAYCOUNT] +#Integer: Shows how many times you have launched the selected title - Defaults to 0 +gameid= diff --git a/wii/wiiflow/settings/gameconfig2.ini b/wii/wiiflow/settings/gameconfig2.ini new file mode 100644 index 00000000..23a25334 --- /dev/null +++ b/wii/wiiflow/settings/gameconfig2.ini @@ -0,0 +1,20 @@ +#Each game will have its own section in this file, with the following possible settings +[GAMEID] +#Boolean: Sets whether to use Ocarina for the selected title - Defaults to false +cheat= +#Boolean: Sets the support for Japanese titles to work under NTSC or PAL - Defaults to 0 +country_patch= +#Boolean: Sets whether to use Gecko for debugging for the selected title - Defaults to false +debugger= +#Boolean: Configures the selected title to use emulated saves from USB - Defaults to false +emulate_save= +#Integer: Sets which hook type the debugging and cheats are going to use for the selected title - Defaults to 1 +hooktype= +#Integer: Sets the language for the selected title - Defaults to 0 +language= +#Integer: Configures the selected title to use a certain type of video mode - Defaults to 0 +patch_video_modes= +#Integer: Sets which video mode the selected title should use - Defaults to 0 +video_mode= +#Boolean: Sets whether to use video patch for the selected title - Defaults to false +vipatch= \ No newline at end of file diff --git a/wii/wiiflow/themes/default.ini b/wii/wiiflow/themes/default.ini new file mode 100644 index 00000000..cd8b5fae --- /dev/null +++ b/wii/wiiflow/themes/default.ini @@ -0,0 +1,1239 @@ + +[_COVERFLOW] +font= +font_color=#FFFFFFFF +loading_cover_box= +loading_cover_flat= +missing_cover_box= +missing_cover_flat= +number_of_modes=7 +sound_cancel= +sound_flip= +sound_hover= +sound_select= + +[_COVERFLOW_1] +blur_factor=1.200000048 +blur_radius=2 +blur_resolution=2 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_delta_scale=1, 1, 1 +bottom_spacer=0, -2, 0 +camera_aim=0, 0, -1 +camera_aim_4_3=0, 0, -1 +camera_osc_amp=0.1000000015, 0.200000003, 0.1000000015 +camera_osc_amp_4_3=0.1000000015, 0.200000003, 0.1000000015 +camera_osc_speed=2, 1.100000024, 1.299999952 +camera_osc_speed_4_3=2, 1.100000024, 1.299999952 +camera_pos=0, 1.5, 5.850003242 +camera_pos_4_3=0, 1.5, 5.850003242 +center_angle=0, 0, 0 +center_pos=0, 0, 1 +center_pos_4_3=0, 0, 1 +center_scale=1, 1, 1 +color_beg=#CFCFCFFF +color_end=#3F3F3FFF +color_off=#7F7F7FFF +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=15 +columns_4_3=9 +cover_osc_amp=5, 10, 0 +cover_osc_speed=2, 2, 0 +cover_pos_osc_amp=0, 0, 0 +cover_pos_osc_speed=0, 0, 0 +flip_angle=0, 0, 0 +flip_pos=0, 0, 0 +flip_scale=0, 0, 0 +left_angle=0, 70, 0 +left_delta_angle=0, 0, 0 +left_delta_scale=1, 1, 1 +left_pos=-1.600000024, 0, 0 +left_pos_4_3=-1.600000024, 0, 0 +left_scale=1, 1, 1 +left_spacer=-0.349999994, 0, 0 +max_fsaa=5 +mirror_alpha=0.2500007153 +mirror_blur=no +right_angle=0, -70, 0 +right_delta_angle=0, 0, 0 +right_delta_scale=1, 1, 1 +right_pos=1.600000024, 0, 0 +right_pos_4_3=1.600000024, 0, 0 +right_scale=1, 1, 1 +right_spacer=0.349999994, 0, 0 +row_center_angle=0, 0, 0 +row_center_pos=0, 0, 0 +row_center_pos_4_3=0, 0, 0 +row_center_scale=1, 1, 1 +rows=1 +rows_4_3=1 +shadow_scale=1.100000024 +shadow_x=0 +shadow_y=0 +tex_aniso=0 +tex_edge_lod=no +tex_lod_bias=-0.3000000119 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=0, 0, 2.599999905 +text_center_pos_4_3=0, 0, 2.599999905 +text_center_style= +text_center_wrap_width=675 +text_center_wrap_width_4_3=500 +text_left_angle=-55 +text_left_angle_4_3=-55 +text_left_pos=-4, 0, 1.299999952 +text_left_pos_4_3=-4, 0, 1.299999952 +text_right_angle=55 +text_right_angle_4_3=55 +text_right_pos=4, 0, 1.299999952 +text_right_pos_4_3=4, 0, 1.299999952 +text_side_style= +text_side_wrap_width=500 +text_side_wrap_width_4_3=500 +title_mirror_alpha=0 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_delta_scale=1, 1, 1 +top_spacer=0, 2, 0 + +[_COVERFLOW_1_S] +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_delta_scale=1, 1, 1 +bottom_spacer=0, -2, 0 +camera_aim=0, 0.3000000119, -1 +camera_aim_4_3=0, 0.25, -0.9999999404 +camera_osc_amp=0, 0, 0 +camera_osc_amp_4_3=0, 0, 0 +camera_osc_speed=0, 0, 0 +camera_osc_speed_4_3=0, 0, 0 +camera_pos=0, 1.5, 5 +camera_pos_4_3=0, 1.5, 5.150000572 +center_angle=0, 380, 0 +center_pos=-0.9000000954, 0, 2.599999905 +center_pos_4_3=-0.6000000238, 0, 2.599999905 +center_scale=1, 1, 1 +color_beg=#FFFFFF7F +color_end=#FFFFFF1F +color_off=#000000FF +color_shadow_beg=#00007F00 +color_shadow_center=#00007F00 +color_shadow_end=#00007F00 +color_shadow_off=#00007F00 +cover_osc_amp=2, 5, 0 +cover_osc_speed=2.099999905, 2.099999905, 0 +cover_pos_osc_amp=0, 0, 0 +cover_pos_osc_speed=0, 0, 0 +flip_angle=7, 166, 0 +flip_angle_4_3=6, 166, 0 +flip_pos=0.6500000954, -0.150000006, 0.9000000954 +flip_pos_4_3=0.4500000477, -0.1000000089, 1.050000072 +flip_scale=1.089999914, 1, 1 +flip_scale_4_3=1, 1, 1 +left_angle=-45, 90, 0 +left_delta_angle=0, 0, 0 +left_delta_scale=1, 1, 1 +left_pos=-4.599999905, 2, 0 +left_pos_4_3=-4.599999905, 2, 0 +left_scale=1, 1, 1 +left_spacer=-0.349999994, 0, 0 +right_angle=-45, -90, 0 +right_delta_angle=0, 0, 0 +right_delta_scale=1, 1, 1 +right_pos=4.599999905, 2, 0 +right_pos_4_3=4.599999905, 2, 0 +right_scale=1, 1, 1 +right_spacer=0.349999994, 0, 0 +row_center_angle=0, 0, 0 +row_center_pos=0, 2, 0 +row_center_pos_4_3=0, 2, 0 +row_center_scale=1, 1, 1 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=1.050000668, 1.999999762, 1.600000024 +text_center_pos_4_3=0.9000006914, 1.999999762, 1.600000024 +text_center_style=CT +text_center_wrap_width=419 +text_center_wrap_width_4_3=310 +text_left_angle=-55 +text_left_angle_4_3=-55 +text_left_pos=-4, 0, 1.299999952 +text_left_pos_4_3=-3.800000191, 0, 1.299999952 +text_right_angle=55 +text_right_angle_4_3=55 +text_right_pos=4, 0, 1.299999952 +text_right_pos_4_3=4, 0, 1.299999952 +text_side_style= +text_side_wrap_width=500 +text_side_wrap_width_4_3=500 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_delta_scale=1, 1, 1 +top_spacer=0, 2, 0 + +[_COVERFLOW_2] +blur_factor=1 +blur_radius=3 +blur_resolution=2 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_delta_scale=1, 1, 1 +bottom_spacer=0, -2, 0 +camera_aim=0, 1.89999938, 2.160668373e-07 +camera_aim_4_3=0, 1.89999938, 2.160668373e-07 +camera_osc_amp=0.3000000119, 0.1000000089, 0.1000000089 +camera_osc_amp_4_3=0.3000000119, 0.1000000089, 0.1000000089 +camera_osc_speed=1.500000477, 1.499999642, 1.499999762 +camera_osc_speed_4_3=1.500000477, 1.499999642, 1.499999762 +camera_pos=0, 3.149998426, 12.49999046 +camera_pos_4_3=0, 3.149998426, 12.49999046 +center_angle=0, 0, 0 +center_pos=0, 2.049999237, 6.000004768 +center_pos_4_3=0, 2.049999237, 6.000004768 +center_scale=1, 1, 1 +color_beg=#9F9F9FFF +color_end=#9F9F9FFF +color_off=#9F9F9FFF +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=13 +columns_4_3=13 +cover_osc_amp=5, 10, 0 +cover_osc_speed=2, 2, 0 +cover_pos_osc_amp=0, 0, 0 +cover_pos_osc_speed=0, 0, 0 +flip_angle=0, 0, 0 +flip_angle_4_3=0, 0, 0 +flip_pos=0, 0, 0 +flip_pos_4_3=0, 0, 0 +flip_scale=0, 0, 0 +flip_scale_4_3=0, 0, 0 +left_angle=0, 10, 0 +left_delta_angle=0, 16, 0 +left_delta_scale=1, 1, 1 +left_pos=-1.400000215, 1.999999285, 0.3000000119 +left_pos_4_3=-1.400000215, 1.999999285, 0.3000000119 +left_scale=1, 1, 1 +left_spacer=-1.399999738, 0, 0.3000000119 +max_fsaa=5 +mirror_alpha=0 +mirror_blur=no +right_angle=0, -10, 0 +right_delta_angle=0, -16, 0 +right_delta_scale=1, 1, 1 +right_pos=1.400000215, 1.999999166, 0.3000000119 +right_pos_4_3=1.400000215, 1.999999166, 0.3000000119 +right_scale=1, 1, 1 +right_spacer=1.399999738, 0, 0.3000000119 +row_center_angle=0, 0, 0 +row_center_pos=0, 1.999999285, 0.25 +row_center_pos_4_3=0, 1.999999285, 0.25 +row_center_scale=1, 1, 1 +rows=3 +rows_4_3=3 +shadow_scale=1.100000024 +shadow_x=0 +shadow_y=0 +tex_aniso=0 +tex_edge_lod=no +tex_lod_bias=-0.2999999821 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=0, 1.999999046, 9.300018311 +text_center_pos_4_3=0, 1.999999046, 9.300018311 +text_center_style=CM +text_center_wrap_width=640 +text_center_wrap_width_4_3=570 +text_left_angle=0 +text_left_angle_4_3=0 +text_left_pos=-2.689659595e-06, 1.999999046, 9.300017357 +text_left_pos_4_3=-2.689659595e-06, 1.999999046, 9.300017357 +text_right_angle=0 +text_right_angle_4_3=0 +text_right_pos=2.719461918e-06, 1.999999046, 9.300017357 +text_right_pos_4_3=2.719461918e-06, 1.999999046, 9.300017357 +text_side_style=CM +text_side_wrap_width=640 +text_side_wrap_width_4_3=640 +title_mirror_alpha=0 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_delta_scale=1, 1, 1 +top_spacer=0, 2, 0 + +[_COVERFLOW_2_S] +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_delta_scale=1, 1, 1 +bottom_spacer=6.705522537e-08, -2, 0 +camera_aim=0, 1.89999938, 1.564621925e-07 +camera_aim_4_3=0, 1.89999938, 1.564621925e-07 +camera_osc_amp=0, 0, 0 +camera_osc_amp_4_3=0, 0, 0 +camera_osc_speed=0, 0, 0 +camera_osc_speed_4_3=0, 0, 0 +camera_pos=0, 3.149998426, 12.49999046 +camera_pos_4_3=0, 3.149998426, 12.49999046 +center_angle=-10, -340, 0 +center_pos=-0.9000000954, 1.89999938, 10.00002098 +center_pos_4_3=-0.8000000715, 1.89999938, 9.700019836 +center_scale=1, 1, 1 +color_beg=#1F1F1FFF +color_end=#1F1F1FFF +color_off=#000000FF +color_shadow_beg=#00007F00 +color_shadow_center=#00007F00 +color_shadow_end=#00007F00 +color_shadow_off=#00007F00 +columns=0 +columns_4_3=0 +cover_osc_amp=2, 10, 0 +cover_osc_speed=2.099999905, 2.099999905, 0 +cover_pos_osc_amp=0, 0, 0 +cover_pos_osc_speed=0, 0, 0 +flip_angle=10, 180, 0 +flip_angle_4_3=10, 180, 0 +flip_pos=0, 0, 0 +flip_pos_4_3=0, 0, 0 +flip_scale=1, 1, 1 +flip_scale_4_3=1, 1, 1 +left_angle=0, 10, 0 +left_delta_angle=0, 16, 0 +left_delta_scale=1, 1, 1 +left_pos=-1.400000334, 2, -1.649999499 +left_pos_4_3=-1.400000334, 2, -1.649999499 +left_scale=1, 1, 1 +left_spacer=-1.399999738, 6.705522537e-08, 0.3000000119 +right_angle=0, -10, 0 +right_delta_angle=0, -16, 0 +right_delta_scale=1, 1, 1 +right_pos=1.400000334, 2, -1.649999499 +right_pos_4_3=1.400000334, 2, -1.649999499 +right_scale=1, 1, 1 +right_spacer=1.399999857, -6.705522537e-08, 0.3000000119 +row_center_angle=0, 0, 0 +row_center_pos=0, 2, -1.649999499 +row_center_pos_4_3=0, 2, -1.649999499 +row_center_scale=1, 1, 1 +rows=0 +rows_4_3=0 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=1.500000238, 3.949997902, 9.700018883 +text_center_pos_4_3=1.400000334, 3.89999795, 9.700018883 +text_center_style= +text_center_wrap_width=350 +text_center_wrap_width_4_3=304 +text_left_angle=-55 +text_left_angle_4_3=-55 +text_left_pos=-4, 3.999997377, 6.600007057 +text_left_pos_4_3=-4, 3.999997377, 6.600007057 +text_right_angle=55 +text_right_angle_4_3=55 +text_right_pos=5.500005722, 3.999997377, 6.600007057 +text_right_pos_4_3=5.500005722, 3.999997377, 6.600007057 +text_side_style= +text_side_wrap_width=500 +text_side_wrap_width_4_3=500 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_delta_scale=1, 1, 1 +top_spacer=-6.705522537e-08, 2, 0 + +[_COVERFLOW_3] +blur_factor=1 +blur_radius=1 +blur_resolution=1 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_delta_scale=0.7600002289, 0.7599999905, 0.7599999905 +bottom_spacer=0, 1.699998736, -2.449998856 +camera_aim=0, 1.399999738, -0.2999997735 +camera_aim_4_3=0, 1.399999738, -0.2999997735 +camera_osc_amp=0.1000000015, 0.1000000089, 0.1000000015 +camera_osc_amp_4_3=0.1000000015, 0.1000000089, 0.1000000015 +camera_osc_speed=2, 1.100000024, 1.299999952 +camera_osc_speed_4_3=2, 1.100000024, 1.299999952 +camera_pos=0, 3.399998426, 5.250000954 +camera_pos_4_3=0, 3.399998426, 7.000007629 +center_angle=0, 0, 0 +center_pos=0, 0.150000006, 1.249999762 +center_pos_4_3=0, 0.150000006, 1.249999762 +center_scale=1, 1, 1 +color_beg=#FFFFFFEF +color_end=#FFFFFF5F +color_off=#FFFFFF9F +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=15 +columns_4_3=15 +cover_osc_amp=5, 10, 0 +cover_osc_speed=2, 2, 0 +cover_pos_osc_amp=0, 0, 0 +cover_pos_osc_speed=0, 0, 0 +flip_angle=0, 0, 0 +flip_angle_4_3=0, 0, 0 +flip_pos=0, 0, 0 +flip_pos_4_3=0, 0, 0 +flip_scale=0, 0, 0 +flip_scale_4_3=0, 0, 0 +left_angle=0, 0, 0 +left_delta_angle=0, -18, 0 +left_delta_scale=1, 1, 1 +left_pos=-1.200000405, 0, 0 +left_pos_4_3=-1.200000405, 0, 0 +left_scale=0.8400001526, 0.8400001526, 0.8400001526 +left_spacer=-1.199999928, -7.450580597e-09, 0 +max_fsaa=3 +mirror_alpha=0.25 +mirror_blur=no +right_angle=0, 0, 0 +right_delta_angle=0, 18, 0 +right_delta_scale=1, 1, 1 +right_pos=1.200000405, 0, 0 +right_pos_4_3=1.200000405, 0, 0 +right_scale=0.8400001526, 0.8400001526, 0.8400001526 +right_spacer=1.199999928, -7.450580597e-09, 0 +row_center_angle=0, 0, 0 +row_center_pos=0, 0, 0 +row_center_pos_4_3=0, 0, 0 +row_center_scale=0.8400001526, 0.8400001526, 0.8400001526 +rows=3 +rows_4_3=3 +shadow_scale=1.100000024 +shadow_x=0 +shadow_y=0 +tex_aniso=0 +tex_edge_lod=yes +tex_lod_bias=-0.2999999821 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=0.5500001311, 1.299999952, 2.599999905 +text_center_pos_4_3=0.5500001311, 1.299999952, 2.599999905 +text_center_style=LB +text_center_wrap_width=325 +text_center_wrap_width_4_3=325 +text_left_angle=-55 +text_left_angle_4_3=-55 +text_left_pos=-4, 1.999999285, 2.299998999 +text_left_pos_4_3=-4, 1.999999285, 2.299998999 +text_right_angle=55 +text_right_angle_4_3=55 +text_right_pos=4, 1.999999285, 1.299999952 +text_right_pos_4_3=4, 1.999999285, 1.299999952 +text_side_style=LB +text_side_wrap_width=325 +text_side_wrap_width_4_3=325 +title_mirror_alpha=0 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_delta_scale=0.8400001526, 0.8400001526, 0.8400001526 +top_spacer=0, 0.8500009179, -1.000000119 + +[_COVERFLOW_3_S] +blur_factor=1 +blur_radius=2 +blur_resolution=1 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_delta_scale=0.7600002289, 0.7599999905, 0.7599999905 +bottom_spacer=0, 1.699998736, -2.449998856 +camera_aim=0, 1.399999738, -0.2999997735 +camera_aim_4_3=0, 1.399999738, -0.2999997735 +camera_osc_amp=0.1000000015, 0.1000000089, 0.1000000015 +camera_osc_amp_4_3=0.1000000015, 0.1000000089, 0.1000000015 +camera_osc_speed=2, 1.100000024, 1.299999952 +camera_osc_speed_4_3=2, 1.100000024, 1.299999952 +camera_pos=0, 3.399998426, 5.250000954 +camera_pos_4_3=0, 3.849997997, 5.850003242 +center_angle=-10, -340, 0 +center_pos=-0.8500000834, 1.549999595, 2.849998236 +center_pos_4_3=-0.8500000834, 1.549999595, 2.849998236 +center_scale=1, 1, 1 +color_beg=#1F1F1FFF +color_end=#1F1F1FFF +color_off=#000000FF +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=15 +columns_4_3=15 +cover_osc_amp=5, 10, 0 +cover_osc_speed=2, 2, 0 +cover_pos_osc_amp=0, 0, 0 +cover_pos_osc_speed=0, 0, 0 +flip_angle=20, -180, 0 +flip_angle_4_3=20, -180, 0 +flip_pos=0, 0, -3.725290298e-08 +flip_pos_4_3=0, 0, -3.725290298e-08 +flip_scale=0.9999993443, 0.9999993443, 0.9999993443 +flip_scale_4_3=0.9999993443, 0.9999993443, 0.9999993443 +left_angle=0, 0, 0 +left_delta_angle=0, -18, 0 +left_delta_scale=1, 1, 1 +left_pos=-1.200000405, 0, -1.649999619 +left_pos_4_3=-1.200000405, 0, -1.649999619 +left_scale=0.8400001526, 0.8400001526, 0.8400001526 +left_spacer=-1.199999928, -7.450580597e-09, 0 +max_fsaa=8 +mirror_alpha=0.25 +mirror_blur=no +right_angle=0, 0, 0 +right_delta_angle=0, 18, 0 +right_delta_scale=1, 1, 1 +right_pos=1.200000405, 0, -1.649999619 +right_pos_4_3=1.200000405, 0, -1.649999619 +right_scale=0.8400001526, 0.8400001526, 0.8400001526 +right_spacer=1.199999928, -7.450580597e-09, 0 +row_center_angle=0, 0, 0 +row_center_pos=0, 0, -1.649999619 +row_center_pos_4_3=0, 0, -1.649999619 +row_center_scale=0.8400001526, 0.8400001526, 0.8400001526 +rows=3 +rows_4_3=3 +shadow_scale=1.100000024 +shadow_x=0 +shadow_y=0 +tex_aniso=2 +tex_edge_lod=yes +tex_lod_bias=-3 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=0.650000155, 1.999999285, 2.599999905 +text_center_pos_4_3=0.650000155, 1.999999285, 2.599999905 +text_center_style=CM +text_center_wrap_width=325 +text_center_wrap_width_4_3=325 +text_left_angle=-55 +text_left_angle_4_3=-55 +text_left_pos=-4, 2.299998999, 2.299998999 +text_left_pos_4_3=-4, 2.299998999, 2.299998999 +text_right_angle=55 +text_right_angle_4_3=55 +text_right_pos=4, 1.999999285, 1.299999952 +text_right_pos_4_3=4, 1.999999285, 1.299999952 +text_side_style=CM +text_side_wrap_width=325 +text_side_wrap_width_4_3=325 +title_mirror_alpha=0.200000003 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_delta_scale=0.8400001526, 0.8400001526, 0.8400001526 +top_spacer=0, 0.8500009179, -1.000000119 + +[_COVERFLOW_4] +blur_factor=1 +blur_radius=1 +blur_resolution=0 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_delta_scale=0.7600002289, 0.7599999905, 0.7599999905 +bottom_spacer=0, 1.699998736, -2.449998856 +camera_aim=-0.5000000596, 1.549999595, 0.4500002265 +camera_aim_4_3=-0.5000000596, 1.549999595, 0.4500002265 +camera_osc_amp=0.1000000015, 0.1000000089, 0.1000000015 +camera_osc_amp_4_3=0.1000000015, 0.1000000089, 0.1000000015 +camera_osc_speed=2, 1.100000024, 1.299999952 +camera_osc_speed_4_3=2, 1.100000024, 1.299999952 +camera_pos=-2.849998474, 2.999998808, 5.400001526 +camera_pos_4_3=-2.849998474, 2.999998808, 5.400001526 +center_angle=0, 0, 0 +center_pos=-0.3000000119, 0.150000006, 1.099999905 +center_pos_4_3=-0.3000000119, 0.150000006, 1.099999905 +center_scale=1, 1, 1 +color_beg=#AFAFAFFF +color_end=#AFAFAFFF +color_off=#AFAFAFFF +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=19 +columns_4_3=19 +cover_osc_amp=0.5, 0.5, 0.5 +cover_osc_speed=2, 2, 2 +cover_pos_osc_amp=0, 0, 0 +cover_pos_osc_speed=0, 0, 0 +flip_angle=0, 0, 0 +flip_angle_4_3=0, 0, 0 +flip_pos=0, 0, 0 +flip_pos_4_3=0, 0, 0 +flip_scale=0, 0, 0 +flip_scale_4_3=0, 0, 0 +left_angle=0, 0, 0 +left_delta_angle=0, 0, 0 +left_delta_scale=1, 1, 1 +left_pos=-1.350000262, 0, 0 +left_pos_4_3=-1.350000262, 0, 0 +left_scale=0.8400001526, 0.8400001526, 0.8400001526 +left_spacer=-1.299999833, -7.450580597e-09, 0 +max_fsaa=2 +mirror_alpha=0.3199999332 +mirror_blur=no +right_angle=0, 0, 0 +right_delta_angle=0, 0, 0 +right_delta_scale=1, 1, 1 +right_pos=1.350000262, 0, 0 +right_pos_4_3=1.350000262, 0, 0 +right_scale=0.8400001526, 0.8400001526, 0.8400001526 +right_spacer=1.349999785, -7.450580597e-09, 0 +row_center_angle=0, 0, 0 +row_center_pos=0, 0, 0 +row_center_pos_4_3=0, 0, 0 +row_center_scale=0.8400001526, 0.8400001526, 0.8400001526 +rows=3 +rows_4_3=3 +shadow_scale=1.100000024 +shadow_x=0 +shadow_y=0 +tex_aniso=0 +tex_edge_lod=no +tex_lod_bias=-0.2999999821 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=-2.29999876, 1.499999762, 3.299999237 +text_center_pos_4_3=-2.149998903, 1.499999762, 3.299999237 +text_center_style=LM +text_center_wrap_width=610 +text_center_wrap_width_4_3=420 +text_left_angle=0 +text_left_angle_4_3=0 +text_left_pos=-4, 1.449999809, 3.299998045 +text_left_pos_4_3=-4, 1.449999809, 3.299998045 +text_right_angle=0 +text_right_angle_4_3=0 +text_right_pos=4, 1.449999809, 3.299998045 +text_right_pos_4_3=4, 1.449999809, 3.299998045 +text_side_style=LM +text_side_wrap_width=610 +text_side_wrap_width_4_3=610 +title_mirror_alpha=0 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_delta_scale=0.8400001526, 0.8400001526, 0.8400001526 +top_spacer=0, 0.8500009179, -1.000000119 + +[_COVERFLOW_4_S] +blur_factor=1 +blur_radius=2 +blur_resolution=3 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_delta_scale=0.7600002289, 0.7599999905, 0.7599999905 +bottom_spacer=0, 1.699998736, -2.449998856 +camera_aim=2.049998999, 1.25, -4.799999714 +camera_aim_4_3=1.599999428, 0.9000002146, -3.54999733 +camera_osc_amp=0.05000000075, 0.0500000082, 0.1000000015 +camera_osc_amp_4_3=0.05000000075, 0.0500000082, 0.1000000015 +camera_osc_speed=2, 1.100000024, 1.299999952 +camera_osc_speed_4_3=2, 1.100000024, 1.299999952 +camera_pos=-2.849998474, 2.999998808, 5.400001526 +camera_pos_4_3=-3.099998236, 3.199998617, 6.000003815 +center_angle=-10, -354, 0 +center_pos=-2.499998808, 1.399999738, 3.199997902 +center_pos_4_3=-2.499998808, 1.399999738, 3.199997902 +center_scale=1, 1, 1 +color_beg=#1F1F1FFF +color_end=#1F1F1FFF +color_off=#000000FF +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=19 +columns_4_3=19 +cover_osc_amp=0.5, 0.5, 0.5 +cover_osc_speed=2, 2, 2 +cover_pos_osc_amp=0, 0, 0 +cover_pos_osc_speed=0, 0, 0 +flip_angle=17, 147, 0 +flip_angle_4_3=17, 147, 0 +flip_pos=0.1000000089, -7.450580597e-09, 0.8500001431 +flip_pos_4_3=-0.1000000089, 0.150000006, 1.349999785 +flip_scale=0.999999404, 0.999999404, 0.9999995232 +flip_scale_4_3=0.999999404, 0.999999404, 0.9999995232 +left_angle=0, 0, 0 +left_delta_angle=0, 0, 0 +left_delta_scale=1, 1, 1 +left_pos=-1.350000262, 0, -1.649999499 +left_pos_4_3=-1.350000262, 0, -1.649999499 +left_scale=0.8400001526, 0.8400001526, 0.8400001526 +left_spacer=-1.299999833, -7.450580597e-09, 0 +max_fsaa=8 +mirror_alpha=0.3199999332 +mirror_blur=no +right_angle=0, 0, 0 +right_delta_angle=0, 0, 0 +right_delta_scale=1, 1, 1 +right_pos=1.350000262, 0, -1.649999499 +right_pos_4_3=1.350000262, 0, -1.649999499 +right_scale=0.8400001526, 0.8400001526, 0.8400001526 +right_spacer=1.349999785, -7.450580597e-09, 0 +row_center_angle=0, 0, 0 +row_center_pos=0, 0, -1.649999499 +row_center_pos_4_3=0, 0, -1.649999499 +row_center_scale=0.8400001526, 0.8400001526, 0.8400001526 +rows=3 +rows_4_3=3 +shadow_scale=1.100000024 +shadow_x=0 +shadow_y=0 +tex_aniso=2 +tex_edge_lod=yes +tex_lod_bias=-3 +text_center_angle=-29 +text_center_angle_4_3=-49 +text_center_pos=-0.4499998093, 3.299998045, 2.799999952 +text_center_pos_4_3=-0.599999845, 3.299998045, 2.649999857 +text_center_style=CT +text_center_wrap_width=400 +text_center_wrap_width_4_3=395 +text_left_angle=0 +text_left_angle_4_3=0 +text_left_pos=-4, 1.649999619, 3.299998045 +text_left_pos_4_3=-4, 1.599999666, 3.299998045 +text_right_angle=0 +text_right_angle_4_3=0 +text_right_pos=4, 1.599999666, 3.299998045 +text_right_pos_4_3=4, 1.599999666, 3.299998045 +text_side_style=CM +text_side_wrap_width=400 +text_side_wrap_width_4_3=400 +title_mirror_alpha=0.3499999344 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_delta_scale=0.8400001526, 0.8400001526, 0.8400001526 +top_spacer=0, 0.8500009179, -1.000000119 + +[_COVERFLOW_5] +blur_factor=1 +blur_radius=2 +blur_resolution=0 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_spacer=0, -2, -0.05000000075 +camera_aim=0, 0.9500002265, -1.100000143 +camera_aim_4_3=0, 0.9500002265, -1.100000143 +camera_osc_amp=7.450580597e-09, 7.450580597e-09, 7.450580597e-09 +camera_osc_amp_4_3=7.450580597e-09, 7.450580597e-09, 7.450580597e-09 +camera_osc_speed=1.000000954, 1.000000119, 0.9500002265 +camera_osc_speed_4_3=1.000000954, 1.000000119, 0.9500002265 +camera_pos=0.200000003, 1.150000334, 11.75002575 +camera_pos_4_3=0.200000003, 1.150000334, 11.75002575 +center_angle=0, 0, 0 +center_pos=0, 0.1000000015, 5.850004196 +center_pos_4_3=0, 0.1000000015, 5.850004196 +center_scale=1, 1, 1 +color_beg=#6F6F6FFF +color_end=#6F6F6FFF +color_off=#4F4F4FFF +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=15 +columns_4_3=13 +cover_osc_amp=0.5, 0.5, 0.5 +cover_osc_speed=0.5, 0.5, 0 +cover_pos_osc_amp=0.1000000089, 0.1000000089, 0.1000000089 +cover_pos_osc_speed=0.3000000119, 0.3000000119, 0.3000000119 +flip_angle=0, 0, 0 +flip_angle_4_3=0, 0, 0 +flip_pos=0, 0, 0 +flip_pos_4_3=0, 0, 0 +flip_scale=0, 0, 0 +flip_scale_4_3=0, 0, 0 +left_angle=0, 0, 0 +left_delta_angle=0, 0, 0 +left_pos=-1.450000167, 0, 0 +left_pos_4_3=-1.450000167, 0, 0 +left_scale=1, 1, 1 +left_spacer=-1.44999969, 0, 0.05000000075 +max_fsaa=2 +mirror_alpha=0 +mirror_blur=no +right_angle=0, 0, 0 +right_delta_angle=0, 0, 0 +right_pos=1.450000167, 0, 0 +right_pos_4_3=1.450000167, 0, 0 +right_scale=1, 1, 1 +right_spacer=1.44999969, 0, 0.05000000075 +row_center_angle=0, 0, 0 +row_center_pos=0, 0, 0 +row_center_pos_4_3=0, 0, 0 +row_center_scale=1, 1, 1 +rows=5 +rows_4_3=5 +shadow_scale=1.100000024 +shadow_x=0 +shadow_y=0 +tex_aniso=0 +tex_edge_lod=no +tex_lod_bias=-0.3000000119 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=10.00002003, -9.685754776e-08, 1.020729542e-06 +text_center_pos_4_3=10.00002003, -9.685754776e-08, 1.020729542e-06 +text_center_style= +text_center_wrap_width=500 +text_center_wrap_width_4_3=500 +text_left_angle=-55 +text_left_angle_4_3=-55 +text_left_pos=10.00001717, 7.450580597e-09, 6.705522537e-08 +text_left_pos_4_3=10.00001717, 7.450580597e-09, 6.705522537e-08 +text_right_angle=55 +text_right_angle_4_3=55 +text_right_pos=10.00002289, 7.450580597e-09, 6.705522537e-08 +text_right_pos_4_3=10.00002289, 7.450580597e-09, 6.705522537e-08 +text_side_style= +text_side_wrap_width=500 +text_side_wrap_width_4_3=500 +title_mirror_alpha=0 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_spacer=0, 2, 0.05000000075 + +[_COVERFLOW_5_S] +blur_factor=1 +blur_radius=2 +blur_resolution=0 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_spacer=0, -2, 0 +camera_aim=0, 0.9500002265, -1.100000143 +camera_aim_4_3=0, 0.9500002265, -1.100000143 +camera_osc_amp=7.450580597e-09, 7.450580597e-09, 7.450580597e-09 +camera_osc_amp_4_3=7.450580597e-09, 7.450580597e-09, 7.450580597e-09 +camera_osc_speed=1.000000954, 1.000000119, 0.9500002265 +camera_osc_speed_4_3=1.000000954, 1.000000119, 0.9500002265 +camera_pos=0.200000003, 1.150000334, 11.75002575 +camera_pos_4_3=0.200000003, 1.150000334, 11.75002575 +center_angle=-10, -340, 0 +center_pos=-0.6000000834, 0.200000003, 9.250017166 +center_pos_4_3=-0.6000000834, 0.200000003, 9.250017166 +center_scale=1, 1, 1 +color_beg=#1F1F1FFF +color_end=#1F1F1FFF +color_off=#000000FF +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=13 +columns_4_3=13 +cover_osc_amp=0.5, 0.5, 0.5 +cover_osc_speed=0.5, 0.5, 0 +cover_pos_osc_amp=0.1000000089, 0.1000000089, 0.1000000089 +cover_pos_osc_speed=0.3000000119, 0.3000000119, 0.3000000119 +flip_angle=10, 180, 0 +flip_angle_4_3=10, 180, 0 +flip_pos=0, 0, 0 +flip_pos_4_3=0, 0, 0 +flip_scale=1, 1, 1 +flip_scale_4_3=1, 1, 1 +left_angle=0, 0, 0 +left_delta_angle=0, 0, 0 +left_pos=-1.450000167, 0, -1.649999499 +left_pos_4_3=-1.450000167, 0, -1.649999499 +left_scale=1, 1, 1 +left_spacer=-1.44999969, 0, 0 +max_fsaa=2 +mirror_alpha=0.25 +mirror_blur=no +right_angle=0, 0, 0 +right_delta_angle=0, 0, 0 +right_pos=1.450000167, 0, -1.649999499 +right_pos_4_3=1.450000167, 0, -1.649999499 +right_scale=1, 1, 1 +right_spacer=1.44999969, 0, 0 +row_center_angle=0, 0, 0 +row_center_pos=0, 0, -1.649999499 +row_center_pos_4_3=0, 0, -1.649999499 +row_center_scale=1, 1, 1 +rows=5 +rows_4_3=5 +shadow_scale=1.100000024 +shadow_x=0 +shadow_y=0 +tex_aniso=0 +tex_edge_lod=no +tex_lod_bias=-0.3000000119 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=1.150000095, 1.499999523, 8.650015831 +text_center_pos_4_3=0.8000001907, 1.499999523, 8.650015831 +text_center_style=CM +text_center_wrap_width=360 +text_center_wrap_width_4_3=327 +text_left_angle=-55 +text_left_angle_4_3=-55 +text_left_pos=10.00001717, 1.599999547, 9.350017548 +text_left_pos_4_3=10.00001717, 1.599999547, 9.350017548 +text_right_angle=55 +text_right_angle_4_3=55 +text_right_pos=1.20000267, 1.599999547, 9.350017548 +text_right_pos_4_3=1.20000267, 1.599999547, 9.350017548 +text_side_style=CM +text_side_wrap_width=360 +text_side_wrap_width_4_3=360 +title_mirror_alpha=0.200000003 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_spacer=0, 2, 0 + +[_COVERFLOW_6] +blur_factor=1 +blur_radius=1 +blur_resolution=0 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_spacer=0, -2, 0.05000000075 +camera_aim=0.7500001788, 1.699999571, -0.3000000715 +camera_aim_4_3=0.7500001788, 1.699999571, -0.3000000715 +camera_osc_amp=7.450580597e-09, 7.450580597e-09, 7.450580597e-09 +camera_osc_amp_4_3=7.450580597e-09, 7.450580597e-09, 7.450580597e-09 +camera_osc_speed=1.000000954, 1.000000119, 0.9500002265 +camera_osc_speed_4_3=1.000000954, 1.000000119, 0.9500002265 +camera_pos=3.049998283, 1.699999809, 4.34999752 +camera_pos_4_3=3.049998283, 1.699999809, 4.34999752 +center_angle=0, 49, 0 +center_pos=0.4999998212, 0.7500000596, 1.749999523 +center_pos_4_3=0.4999998212, 0.7500000596, 1.749999523 +center_scale=1, 1, 1 +color_beg=#6F6F6FFF +color_end=#5F5F5FFF +color_off=#4F4F4FFF +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=15 +columns_4_3=15 +cover_osc_amp=0.5, 0.5, 0.5 +cover_osc_speed=0.5, 0.5, 0 +cover_pos_osc_amp=0.1000000089, 0.1000000089, 0.1000000089 +cover_pos_osc_speed=0.3000000119, 0.3000000119, 0.3000000119 +flip_angle=0, 0, 0 +flip_angle_4_3=0, 0, 0 +flip_pos=0, 0, 0 +flip_pos_4_3=0, 0, 0 +flip_scale=0, 0, 0 +flip_scale_4_3=0, 0, 0 +left_angle=0, 0, 0 +left_delta_angle=0, 0, 0 +left_pos=-6.400006771, -7.450580597e-09, -2.849998474 +left_pos_4_3=-6.400006771, -7.450580597e-09, -2.849998474 +left_scale=1, 1, 1 +left_spacer=-1.749999404, 0, -0.05000000075 +max_fsaa=3 +mirror_alpha=0 +mirror_blur=no +right_angle=0, 0, 0 +right_delta_angle=0, 0, 0 +right_pos=-3.149997711, -7.450580597e-09, -2.849998474 +right_pos_4_3=-3.149997711, -7.450580597e-09, -2.849998474 +right_scale=1, 1, 1 +right_spacer=1.499999642, 0, -0.05000000075 +row_center_angle=0, 0, 0 +row_center_pos=-4.75, -7.450580597e-09, -2.849998474 +row_center_pos_4_3=-4.75, -7.450580597e-09, -2.849998474 +row_center_scale=1, 1, 1 +rows=7 +rows_4_3=9 +shadow_scale=1.100000024 +shadow_x=0 +shadow_y=0 +tex_aniso=0 +tex_edge_lod=no +tex_lod_bias=-0.3000000119 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=2.449998856, 1.64999938, 2.000000238 +text_center_pos_4_3=2.299998999, 1.64999938, 2.000000238 +text_center_style= +text_center_wrap_width=360 +text_center_wrap_width_4_3=290 +text_left_angle=0 +text_left_angle_4_3=0 +text_left_pos=-7.850015163, 1.649999619, 1.999999285 +text_left_pos_4_3=-7.850015163, 1.649999619, 1.999999285 +text_right_angle=0 +text_right_angle_4_3=0 +text_right_pos=7.850014687, 1.849999428, 1.999999285 +text_right_pos_4_3=7.850014687, 1.849999428, 1.999999285 +text_side_style= +text_side_wrap_width=360 +text_side_wrap_width_4_3=360 +title_mirror_alpha=0 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_spacer=0, 2, -0.05000000075 + +[_COVERFLOW_6_S] +blur_factor=1 +blur_radius=2 +blur_resolution=0 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_spacer=0, -2, 0 +camera_aim=0.7500001788, 1.799999475, -0.1000000685 +camera_aim_4_3=0.7500001788, 1.799999475, -0.1000000685 +camera_osc_amp=7.450580597e-09, 7.450580597e-09, 7.450580597e-09 +camera_osc_amp_4_3=7.450580597e-09, 7.450580597e-09, 7.450580597e-09 +camera_osc_speed=1.000000954, 1.000000119, 0.9500002265 +camera_osc_speed_4_3=1.000000954, 1.000000119, 0.9500002265 +camera_pos=3.549997807, 2.049999475, 4.34999752 +camera_pos_4_3=3.549997807, 2.049999475, 4.34999752 +center_angle=-6, -300, 0 +center_pos=1.949999094, 0.9500001073, 2.749998569 +center_pos_4_3=1.949999094, 0.9500001073, 2.749998569 +center_scale=1, 1, 1 +color_beg=#1F1F1FFF +color_end=#1F1F1FFF +color_off=#000000FF +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=21 +columns_4_3=21 +cover_osc_amp=0.5, 0.5, 0.5 +cover_osc_speed=0.5, 0.5, 0 +cover_pos_osc_amp=0.1000000089, 0.1000000089, 0.1000000089 +cover_pos_osc_speed=0.3000000119, 0.3000000119, 0.3000000119 +flip_angle=10, 180, 0 +flip_angle_4_3=10, 180, 0 +flip_pos=0, 0, 0 +flip_pos_4_3=0, 0, 0 +flip_scale=1, 1, 1 +flip_scale_4_3=1, 1, 1 +left_angle=0, 0, 0 +left_delta_angle=0, 0, 0 +left_pos=-7.250010014, -7.450580597e-09, -4.249998093 +left_pos_4_3=-7.250010014, -7.450580597e-09, -4.249998093 +left_scale=1, 1, 1 +left_spacer=-1.749999404, 0, 0 +max_fsaa=2 +mirror_alpha=0.25 +mirror_blur=no +right_angle=0, 0, 0 +right_delta_angle=0, 0, 0 +right_pos=-3.999996901, -7.450580597e-09, -4.249998093 +right_pos_4_3=-3.999996901, -7.450580597e-09, -4.249998093 +right_scale=1, 1, 1 +right_spacer=1.499999642, 0, 0 +row_center_angle=0, 0, 0 +row_center_pos=-5.600003242, -7.450580597e-09, -4.249998093 +row_center_pos_4_3=-5.600003242, -7.450580597e-09, -4.249998093 +row_center_scale=1, 1, 1 +rows=9 +rows_4_3=9 +shadow_scale=1.100000024 +shadow_x=0 +shadow_y=0 +tex_aniso=0 +tex_edge_lod=no +tex_lod_bias=-0.3000000119 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=1.849999428, 2.29999876, 0.8500011563 +text_center_pos_4_3=1.749999523, 2.29999876, 0.8500011563 +text_center_style=LM +text_center_wrap_width=360 +text_center_wrap_width_4_3=300 +text_left_angle=0 +text_left_angle_4_3=0 +text_left_pos=-7.850015163, 2.299998999, 0.8500002027 +text_left_pos_4_3=-7.850015163, 2.299998999, 0.8500002027 +text_right_angle=0 +text_right_angle_4_3=0 +text_right_pos=7.850014687, 2.299998999, 0.8500002027 +text_right_pos_4_3=7.850014687, 2.299998999, 0.8500002027 +text_side_style=LM +text_side_wrap_width=360 +text_side_wrap_width_4_3=360 +title_mirror_alpha=0.200000003 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_spacer=0, 2, 0 + +[_COVERFLOW_7] +blur_factor=1 +blur_radius=1 +blur_resolution=0 +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_delta_scale=1, 1, 1 +bottom_spacer=0, -2, 0 +camera_aim=0, 0, -1 +camera_aim_4_3=0, 0, -1 +camera_osc_amp=0.1000000015, 0.200000003, 0.3000000119 +camera_osc_amp_4_3=0.1000000015, 0.200000003, 0.3000000119 +camera_osc_speed=1.200000763, 1.100000024, 0.7000001669 +camera_osc_speed_4_3=1.200000763, 1.100000024, 0.7000001669 +camera_pos=0, 1.300000191, 4.749999046 +camera_pos_4_3=0, 1.649999857, 5.750002861 +center_angle=0, 0, 0 +center_pos=0, -7.450580597e-09, 1.599999428 +center_pos_4_3=0, -7.450580597e-09, 1.599999428 +center_scale=1, 1, 1 +color_beg=#EFEFEFFF +color_end=#5F5F5FFF +color_off=#9F9F9FFF +color_shadow_beg=#00000000 +color_shadow_center=#00000000 +color_shadow_end=#00000000 +color_shadow_off=#00000000 +columns=9 +columns_4_3=9 +cover_osc_amp=0, 5, 0 +cover_osc_speed=2, 2, 0 +cover_pos_osc_amp=7.450580597e-09, 0, 0 +cover_pos_osc_speed=7.450580597e-09, 7.450580597e-09, 7.450580597e-09 +flip_angle=0, 0, 0 +flip_angle_4_3=0, 0, 0 +flip_pos=0, 0, 0 +flip_pos_4_3=0, 0, 0 +flip_scale=0, 0, 0 +flip_scale_4_3=0, 0, 0 +left_angle=0, 70, 0 +left_delta_angle=0, 0, 0 +left_delta_scale=1, 1, 1 +left_pos=-1.500000119, 0, 0.5000000596 +left_pos_4_3=-1.500000119, 0, 0.5000000596 +left_scale=1, 1, 1 +left_spacer=-0.4499999881, 0, 0 +max_fsaa=5 +mirror_alpha=0 +mirror_blur=no +right_angle=0, -70, 0 +right_delta_angle=0, 0, 0 +right_delta_scale=1, 1, 1 +right_pos=1.500000119, 0, 0.5000000596 +right_pos_4_3=1.500000119, 0, 0.5000000596 +right_scale=1, 1, 1 +right_spacer=0.349999994, 0, 0 +row_center_angle=0, 0, 0 +row_center_pos=0, 0, 0 +row_center_pos_4_3=0, 0, 0 +row_center_scale=1, 1, 1 +rows=1 +rows_4_3=1 +shadow_scale=1.5 +shadow_x=0 +shadow_y=0 +tex_aniso=2 +tex_edge_lod=yes +tex_lod_bias=-0.2999999821 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=0, 0.200000003, 2.599999905 +text_center_pos_4_3=0, 0.200000003, 2.599999905 +text_center_style=CM +text_center_wrap_width=530 +text_center_wrap_width_4_3=530 +text_left_angle=-55 +text_left_angle_4_3=-55 +text_left_pos=-4, 0, 1.299999952 +text_left_pos_4_3=-4, 0, 1.299999952 +text_right_angle=55 +text_right_angle_4_3=55 +text_right_pos=4, 0, 1.299999952 +text_right_pos_4_3=4, 0, 1.299999952 +text_side_style=CM +text_side_wrap_width=530 +text_side_wrap_width_4_3=530 +title_mirror_alpha=0.200000003 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_delta_scale=1, 1, 1 +top_spacer=0, 2, 0 + +[_COVERFLOW_7_S] +bottom_angle=0, 0, 0 +bottom_delta_angle=0, 0, 0 +bottom_delta_scale=1, 1, 1 +bottom_spacer=0, -2, 0 +camera_aim=0, 0, -0.9999999404 +camera_aim_4_3=0, 0, -0.9999999404 +camera_osc_amp=0, 0, 0 +camera_osc_amp_4_3=0, 0, 0 +camera_osc_speed=0, 0, 0 +camera_osc_speed_4_3=0, 0, 0 +camera_pos=0, 1.5, 5 +camera_pos_4_3=0, 1.5, 5.850003242 +center_angle=-10, -340, 0 +center_pos=-0.2999999523, 0, 2.949999571 +center_pos_4_3=-0.6000000238, 0, 2.949999571 +center_scale=1, 1, 1 +color_beg=#1F1F1FFF +color_end=#1F1F1FFF +color_off=#000000FF +color_shadow_beg=#00007F00 +color_shadow_center=#00007F00 +color_shadow_end=#00007F00 +color_shadow_off=#00007F00 +columns=0 +columns_4_3=0 +cover_osc_amp=2, 5, 0 +cover_osc_speed=2.099999905, 2.099999905, 0 +cover_pos_osc_amp=0, 0, 0 +cover_pos_osc_speed=0, 0, 0 +flip_angle=15, 180, 0 +flip_angle_4_3=15, 180, 0 +flip_pos=0, -0.05000000075, 0.1000000015 +flip_pos_4_3=0, -0.05000000075, 0.1000000015 +flip_scale=1, 1, 1 +flip_scale_4_3=1, 1, 1 +left_angle=0, 70, 0 +left_delta_angle=0, 0, 0 +left_delta_scale=1, 1, 1 +left_pos=-3.499998331, 8.121132851e-07, -4.599999428 +left_pos_4_3=-3.499998331, 8.121132851e-07, -4.599999428 +left_scale=1, 1, 1 +left_spacer=-0.6500000358, 7.450580597e-09, 1.499999642 +right_angle=0, -70, 0 +right_delta_angle=0, 0, 0 +right_delta_scale=1, 1, 1 +right_pos=3.499998331, 7.823109627e-07, -4.599999428 +right_pos_4_3=3.499998331, 7.823109627e-07, -4.599999428 +right_scale=1, 1, 1 +right_spacer=0.6500000358, 0, 1.499999642 +row_center_angle=0, 0, 0 +row_center_pos=0, 0.2500007749, 0 +row_center_pos_4_3=0, 0.2500007749, 0 +row_center_scale=1, 1, 1 +rows=0 +rows_4_3=0 +text_center_angle=0 +text_center_angle_4_3=0 +text_center_pos=1.600000143, 0.4500005841, 1.600000024 +text_center_pos_4_3=1.200000525, 0.4500005841, 1.600000024 +text_center_style=CM +text_center_wrap_width=327 +text_center_wrap_width_4_3=327 +text_left_angle=-55 +text_left_angle_4_3=-55 +text_left_pos=-4, 0, 1.299999952 +text_left_pos_4_3=-4, 0, 1.299999952 +text_right_angle=55 +text_right_angle_4_3=55 +text_right_pos=4, 0, 1.299999952 +text_right_pos_4_3=4, 0, 1.299999952 +text_side_style=CM +text_side_wrap_width=500 +text_side_wrap_width_4_3=500 +top_angle=0, 0, 0 +top_delta_angle=0, 0, 0 +top_delta_scale=1, 1, 1 +top_spacer=0, 2, 0 diff --git a/wiiflow.pnproj b/wiiflow.pnproj new file mode 100644 index 00000000..1d2aa7cf --- /dev/null +++ b/wiiflow.pnproj @@ -0,0 +1 @@ + \ No newline at end of file diff --git a/wiiflow.pnps b/wiiflow.pnps new file mode 100644 index 00000000..994de9cb --- /dev/null +++ b/wiiflow.pnps @@ -0,0 +1 @@ + \ No newline at end of file