madman-0.93/0000755000175000001440000000000010053135242012447 5ustar akusers00000000000000madman-0.93/README0000644000175000001440000004103710053135241013333 0ustar akusers00000000000000------------------------------------------------------------------------------- madman administrates digital music archives neatly ------------------------------------------------------------------------------- QUICK BUILD INSTRUCTIONS (see below for potentially more detailed instructions) To build madman, just type ./scons.py at your shell prompt. To install, type ./scons.py prefix=/where/ever install ------------------------------------------------------------------------------- I. Welcome to madman. ------------------------------------------------------------------------------- madman is a music manager application that allows you to easily keep your music database organized and tidy, and it helps you listen to better music, be happier, brighten your teeth and quickly restore world peace. madman's killer features include - A builtin web server - Ratings just like iTunes - An icon in the system tray - Full mp3 and ogg tag support, both reading and writing. Convenient retagging with a spreadsheet-like interface - Fully drag and drop enabled: Drop a song onto a set, reorder your sets by drag and drop, reorder songs within a set - all it takes is one mouse drag. - Powerful expression syntax to quickly locate the music you're looking for. Examples: - pearl|creed|metallica to find something for your anger. - jetplane cher to find Cher's version of "Leaving on a jetplane." - "dog eat" to find "Dog eat dog", but not "Sound of dogs eating a human". - "Sets" which are somewhat like playlists, except they can be automatically keep track of songs matched by expressions. You can get in contact with the author by writing to . madman's homepage is at http://madman.sf.net. See the web page for an FAQ. ------------------------------------------------------------------------------- II. Compiling ------------------------------------------------------------------------------- To compile madman, you need - XMMS. [http://www.xmms.org] Version 1.2.6 and above. IMPORTANT: Version 1.2.9 causes random crashes. Do not use it. - Qt. [http://www.trolltech.com] Version 3.2.x tested, others might work, too. (patches welcome) - libid3tag [http://www.underbit.com/products/mad] Version 0.15.0b required. - Ogg Vorbis libraries [http://www.xiph.org] Any recent version should be fine. To build madman, just type ./scons.py at your shell prompt. Type ./scons.py -h for help on the supported build options and ./scons.py -H for scons's builtin options. For example, to specify the include directory for libid3tag, you would type ./scons.py libid3tag_include=/where/ever To install, type ./scons.py prefix=/where/ever install ------------------------------------------------------------------------------- III. Change log ------------------------------------------------------------------------------- far future -------------------------------------------------------------------- + Support audioscrobbler.sourceforge.net. + Maybe rethink the UI. + What do MoodLogic (moodlogic.com), iTunes (apple.com/itunes), MusicMatch (musicmatch.com) have that we don't? + Add more flexible tagging from file name. + Add on-disk reorganization, i.e. renaming according to tags. + Allow players to have their own customization UI, thus allow having a customizable player executable. + Add some sort of history display and evaluation. + Session management. * Don't put songs in playlist that are already in there (confusion-proof UI?) (Johan Forsberg) + One-time commit feature for tag writes. (Johan Forsberg) + HTTP access restrictions (Tim Dreessen) future ------------------------------------------------------------------------ + Support FLAC. + Support Musepack. http://www.personal.uni-jena.de/~pfk/mpp/index2.html + Maybe add little builtin player. + Splash screen. + Support musicbrainz. + Can we rip off Amazon's "other customers also bought" recommendations? MP3 Piranha, Amazon Web Services ... Should be possible to at least display album cover. + Maybe use MusicLink.com? + Add Plink. (playlist link) - Plink over Jabber. - Plink broadcast UDP discovery. - Plink clients for Winamp2 (3?), XMMS (write them using the tPlayer class?) + Integrate translations into build system. + BPM extraction. * Export M3U. * Automatically add .mad extension to filename entered in SaveAs dialog. (Jon Burgess) [is this really a good idea?] + Hierarchical sorting. (album, track number) (good UI?) + Added man page. * Try to identify current song through title if identifying through file name doesn't work. + Criteria wizard. + Allowed Player customization UI. * Ability to query whether criteria are time-dependent. (Automatic update of Last Few Songs) + IMMS-like ratings based on play history. + non-local criteria like - ~is_in_set(name) - ~playcount_percentile(...) - ~artist_rating(...) - ~auto_dj_score(...) phase out jammed-together criteria + modularized criterion parser with factories for various criteria. + Allowed file renames from tag interface. + Add a mechanism for debug messages to get through to user that is not STDOUT. * Sprinkled the singleton pattern all over the program, wherever it applies. + ~average_play_percentage() + Introduce smoothly-scaling criteria. ~usually_played_to_end, ... * use pimpl pattern in more places. * Song play detection in Non-GUI mode * ~play_count_within_n_days * ~manual_play_count, ~manual_play_immediately_count * ~new, halflife of about a week. * ~played_within_days(parameter), gradation * Portable player support: Copy files to directory without running out of space. (Clive Butler) * Add support for alsaplayer (Tim Sawchuck) * Continuous AutoDJ (Shawn, Adam Ward) * ID3 writing format switch: v1/v2 (Adam Ward) 0.93 -------------------------------------------------------------------------- * Fixed the scan failure problem. [done] * Fixed a link order problem. [done] * Removed 3.2 dependency of UI files. * Added flags that allow to add custom include and library paths. (Daryl Anderman) [done] * Playlists can't scroll past the end any more. [done] * Fixed a segfault in the auto tagger. [done] * Fixed configure to cope with non-case-sensitive bashes. [done] (Christian Hammers) * Fixed the expat load errors, hopefully for real this time. [done] * Fixed an exception while reading tags / adding songs. (Klaus S. Madsen) [done] 0.93rc2 ----------------------------------------------------------------------- + A my_cxx build option was added. [done] + Validated compilation with only a c++ compiler, especially for vcedit.c. [done] * Fixed README to state correct dependencies. [done] * Removed ctags from default build. [done] * About dialog shouldn't talk about Musepack/MPC when it's not actually there. [done] * Attempted to fix non-reproducible crasher within XMMS libraries through better error checking. [done] * Fix crasher when removing from empty directory list. (Tim Dreessen) [done] * Rescan no longer adds duplicate copies of songs. (Tim Dreessen) [done] * Plugins directory was missing from the release tarball. (Tim Dreessen) [done] 0.93rc1 ----------------------------------------------------------------------- MAJOR CHANGES: * Auto Tagger. [done] * Changed build system to SCons. [done] * Minimize to system tray. [done] + Add passive popup song announcements. [done] * Made search substantially faster. [done] - Removed fuzzy search misfeature. [done] + Visually indicate current song. [done] + Select visible columns per list view, not in preferences. [done] * Unify madmanweb through song field identifier methods. [done] * Rewrote AutoDJ. (Shawn Willden) [done] MINOR IMPROVEMENTS: * Made sure filenames are never converted from one encoding to the next. [done] + Integrate M3U export script from Adam Ward. [done] * Added Christian's madman art. [done] * Balance AutoDJ score min, max, offset, at least in default. [done] + Progress bar for repeat tagging. [done] * Busy progress bar for scanning. [done] * Display totals in a more appropriate way. [done] * 0.5 is now the default match threshold. [done] * Renamed tCriterion::operator() to matchDegree(). [done] * Improved startup performance by removing a stray stat(). [done] * Added a new about dialog. [done] * Greatly reduced memory footprint of madman's database. - Use static list for (repetitive) directory names. [done] - Eliminated key hack for ~any criterion. [done] + Remember sort field between runs. [done] * Deprecated multiword criteria without underscores. [done] + Added ~year,~track_number criteria. [done] + Added scripting for the playlist tree. [done] * Ensured uniqueness and validity of playlist names. Also made sure related exceptions are caught. [done] * Took care of UTF8->Unicode string conversion in remote. [done] * Drop down box for genre edit. [done] + Search for and play like songs through the context menu. [done] + Added Clear button for search box. [done] + Rate current from toolbar and tray icon. [done] + Hide main window while saving database. [done] * Smaller playlist buttons. [done] + Added ~full_play_count, ~partial_play_count criteria. [done] + Added ~lastplayed_n_days_ago criterion. [done] + Added a central facility to get a one-liner describing a song. [done] * "File exists since" now defaults to the file's ctime. [done] + Added an option to restrict webserver access to localhost. [done] * Modified plugin interface to use field identifiers. [done] BUGS/ANNOYANCES FIXED: * Fixed odd tag encoding bug. (reported by Adam Ward) Fixed by switching to libid3tag, which is much better in many regards. [done] + Don't stop rescan on broken files. (ogg, file not found) (Adam Ward) [done] * Fix right click in playlist pane crasher. (Adam Ward) [done] * Fixed a crasher in tSongListView::getSelection(tSongList &) [done] * Added k3b version detection to cd burning scripts. [done] * Made http server much more crash-resilient. [done] * Made madmancontrol quit actually work(tm) without a segfault. [done] * LastPlayed was not properly initialized. [done] * Only rescan after prefs if media directories have changed. [done] * Ogg tagging fixed - accidentally used Latin1 instead of UTF8. [done] * Fixed the case of moving to a new file type (the new file would be read using the old file type, no matter what) [done] * Focus AllSongsList on home. [done] * If we don't have read permission for a song, don't add it. [done] * Worked around a Qt3.2 bug that would not update the search line until the end of the search. [done] * Fixed a crasher in the web server. [done] 0.92rc1 ----------------------------------------------------------------------- MAJOR ADDITIONS: + Builtin web server for remote control, streaming/sharing, scripting. Made option for webserver to run standalone (no X). [done] + Added python script for remote control. [done] + Better auto DJ. (now uses Mersenne Twister random number generator, forbids replays, allows configuration) [done] + Bookmark button. [done] + Added Player controls. [done] MINOR IMPROVEMENTS: + Right click menu for Artist/Album list. (Jon Burgess, David O'Shaugnessy) [done] + Allow command line specification of the file that is to be opened. [done] * Add --help command line option. [done] * Add criteria examples to help. [done] * Make backups even if file does not have .mad extension. (Jon Burgess) [not reproducible, assumed fixed by previous changes] + Add file name and path to search index. (Johan Forsberg) [done] + Keep modification time stamps of songs, reread changed on rescan. [done] * Try and deal with oddball track numbers (like "04/18"). [done] * Added criterion ~unrated, to avoid depending on ~rating(=-1). [done] + Make a toolbar button to highlight currently playing song. (Fix F12 non-obviousness.) [done] * Changed tPlayer architecture from polling to signalling for song and state changes. (hide polling mechanism within tXmmsPlayer) [done] * Save whether toolbars are shown to config. [done] + Added rewrite tag function. [done] * Modified number after "By Artist" to state number of songs (UI non-obviousness reported by Edgar Seemann) [done] * Added button icons, thus friendlifying the whole UI a bit. [done] * Cleaned up notification-on-modification in tSong. [done] BUGS/ANNOYANCES FIXED: * Fixed bug about column ordering not being preserved in some cases. [done] * Workaround for id3lib's borked unicode tagging facility [done] UNICODE mp3 tagging is BROKEN by this. * Weed out invalid characters in tag data. [done] * Don't fail with only a console message if the web server couldn't be started. [done] * Update hash table when adding/removing songs to/from collection. (reported by Martin Sauter) [done] * Fixed Unicode ID3 tag reading/writing. [done] * Madman's database is now really stored in UTF8. [done] + Will ask to save before opening new database. [done] * Fixed a bug where hitting one of the numbers (for rating) wouldn't properly update the playlist window. [seems to have disappeared] * Fixed the fact that there are no result when searching for uppercase strings. [done] * Fixed several file descriptor leaks reported by Jon Burgess . [done] * Fixed segfault that occurred when reading Ogg tag from non-existent song. Reported by Jon Burgess . [done] * Added proper exception handling in many spots that were lacking it. [done] 0.91.1 ------------------------------------------------------------------------ + Fixed some compilation problem on SuSE gcc 3.2 prerelease compilers. 0.91 -------------------------------------------------------------------------- + Added much marketing hype to the website. [done] MAJOR ADDITIONS: + Added fuzzy match methods. [done] + Added plugin scripts. [done] Sample plugin scripts provided: Burn to CD, Move to Trash. + Made separate fields for Composer/Performer. [done] + Added play history collection. History records if a song is allowed to play to the end, to allow for statistical evaluation. Can be disabled. [done] + Rating feature, ~rating(...) criterion. [done] + Searches now work asynchronously, making them (seem) much faster. [done] + Added separate preferences dialog. [done] + More categories in overview tree (albums) [done] + In-Archive-Since, Last-Played and Play-Count are recorded for each song. Statistics are resettable per-song. [done] + Build process was autotoolsified. [done] + Make backups of databases. [done] + Added mass tagging. [done] * Improved startup performance. - Used expat instead of Qt for XML parsing. [done] - Centralize reading serialization code in tDatabase. [done] - Made overview tree generate itself on the fly when clicked. [done] + Can import M3U and player playlists. [done] + Added a real help browser. [done] MINOR IMPROVEMENTS: + Automatically show relevant page of preferences dialog if creating a new file. Greet new users. [done] * Display instead of the empty string in the overview. [done] + Remember main window geometry (may be turned off in preferences). [done] + Added possibility to add 20 random songs from command line. [done] * Moved duration column further to the front. [done] * Better keyboard bindings. [done] + Added "Highlight current song". [done] + Made tag display dynamic. [done] - Removed "search forward" feature because the improved "Restrict" works so much better. Avoids user confusion. [done] + Order of columns is preserved between runs. [done] * Achieved display speedup through not letting Qt do the sorting. [done] + Added ability to customize which columns are shown. [done] + Added a file size column. [done] + Show a summary on the status bar whenever the selection changes. [done] + Show counts in overview. [done] BUGS/ANNOYANCES FIXED: * Removed set control buttons -> more screen real estate for actual songs. [done] * Fixed bug in removing multiple songs from sets. [done] - Removed the empty "View" menu. [done] * Fixed auto_ptr+exception bug in expression compilation, fixed or precedence. [done] * Deferred retags until next main loop to avoid crashes when retag means removal from current set. [done] * Fix artist sorting in overview. * Flicker and slowness upon deleting multiple files was fixed. [done] * Fixed crashes: - Make new file, add set. [done] - Open another file, drag song to set. [done] - updateSongSetTree was trying to use pointers that had become invalid while [done] * Made fileOpen() exception-safe. [done] * Fixed expression parsing so parentheses would really work. [done] * Fixed error reporting for duration extraction from MP3s. [done] 0.90.1 - Feb 27, 2003 --------------------------------------------------------- - Fixed Compilation with Qt3.0. 0.90 - Feb 26, 2003 ----------------------------------------------------------- - Initial relase madman-0.93/CODING_STYLE0000644000175000001440000000413210053135241014314 0ustar akusers000000000000000. Example ------------------------------------------------------------------------------- class tMySomething : public tMySomethingElse { private: tObject *MyObject; public: void doThis( argument1, argument2 ); }; int doThat() { int my_local_variable; if ( something > 17 ) { doThis( argument ); doThat(); } else doThis( argument ); } int doThis( arg ) { // ... } I. Indentation ------------------------------------------------------------------------------- Basic offset is two spaces. Don't use tabs in source files. Braces are on a line by themselves at the level of the outer block. Use braces only if they contain more than one statement. Class access specifiers are indented one step from the class, members two steps (4 spaces). II. Naming ------------------------------------------------------------------------------- Macros are written MY_MACRO, i.e. all capitals, underscores to separate words. Types are written tMyType. Note: this applies to *all* type names, not just classes. Functions are named doThis(), i.e. they *have* to have to start with a verb in lower case, and then use run-together capitals for the rest of their name. Accessor functions are written myDataElement() and setMyDataElement(). Local variables are written my_local_variable, i.e. all-lowercase, words separated by underscores. Non-local variables (globals, members) are spelled MyGlobalVariable. pimpl is allowed as an exception to this rule. III. Spacing ------------------------------------------------------------------------------- Top-level constructs enclosed by braces (classes, functions) should be 4 lines apart each. There is a space inside each parenthesis (opening and closing) and around each infix operator (+,-,*,&& etc.) IV. Conventions ------------------------------------------------------------------------------- Use real declarator, not faux pointer type syntax. (YES: int *a NO: int* a) Header order should match implementation order. Headers are enclosed in #ifndef HEADER_SEEN_MYHEADER_H #define HEADER_SEEN_MYHEADER_H It's const int *, not int const *. madman-0.93/COPYING0000644000175000001440000004311010053135241013500 0ustar akusers00000000000000 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 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. Copyright (C) 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 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. , 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. madman-0.93/madman_de.ts0000644000175000001440000011640310053135241014730 0ustar akusers00000000000000 ErrorMessages deserializing to different filename Deserialisieren zu unterschiedlichem Dateinamen <Unkown, reread tags> <Unbekannt, Tags neu lesen> Trouble reading tags from %1 Problem beim Tag-Lesen aus %1 trouble writing retagged file Problem beim Schreiben der umgetaggten Datei Trouble writing retagged file Problem beim Schreiben der umgetaggten Datei Unknown file type: %1 Unbekannter Dateityp: %1 Invalid database structure Ungültige Datenbankstruktur Database file not accessible: %1 Datenbank nicht zugreifbar: %1 Database file not writable: %1 Datenbank nicht schreibbar: %1 Slashes may not occur in set names. Slashes dürfen in Mengennamen nicht vorkommen. Trouble reading from %1 Problem beim Lesen aus %1 Expected string expression, found: '%1'. String-Ausdruck erwartet, gefunden: '%1'. Unrecognized tokens at end of criterion Unbekanntes Token am Ende des Kriteriums Expected '%1', found '%2'. '%1' erwartet, '%2' gefunden. Expected number, found: %1 Zahl erwartet, %1 gefunden Slashes may not occur in playlist names. Slashes dürfen nicht in Playlistennamen vorkommen. FieldDescriptions Artist Künstler Performer Ausführender Title Titel Album Album Track Number Track-Nummer Duration Dauer Genre Genre Play Count (full) Male gespielt (ganz) Play Count (partial) Male gespielt (teilweise) Play Count Male gespielt Last Played Zuletzt gespielt Rating Bewertung Year Jahr File Datei Path Pfad Exists since Existiert seit Match Match <unknown> <unbekannt> File Size Dateigröße SongSetName Root Wurzel Root Playlist Wurzel Playlist Playlist 1 Playlist 1 Playlist 2 Playlist 2 Playlist 3 Playlist 3 Absolute favorites Absolute Favoriten Love songs Love songs Rock songs Rocksongs Never been listened Noch nie gehört Recent additions Kürzlich dazugefügt Often listened to the end Oft vollständig angehört Rarely listened to the end Selten vollständig angehört tAllSongsViewManager &Add to set Zu Menge &hinzufügen &Add to current playlist Zu gegenwärtiger Playlist &hinzufügen &Add to current playlist (Ins) Zu gegenwärtiger Playlist &hinzufügen (Einfg) tDirectoryListManager Add Directory Verzeichnis hinzufügen tEditableSongSetViewManager Remove from current set Aus gegenwärtiger Menge entfernen Sort by &Artist Nach &Künstler sortieren Sort by &Title Nach &Titel sortieren Sort by A&lbum Nach &Album sortieren Sort by &Track number Nach Track-&Nummer sortieren Sort by &Year Nach &Jahr sortieren Sort by &Genre Nach &Genre sortieren Jumble Durcheinanderwürfeln Reverse Umkehren &Reorder &Umordnen Export to player's current playlist In die Playliste des Players exportieren Import player's current playlist Aus der Playliste des Players übernehmen Import M3U M3U importieren Playlist (*.m3u) Playlist (*.m3u) Remove from playlist Aus gegenwärtiger Playlist entfernen Remo&ve from playlist (Del) Aus gegenwärtiger Playlist &entfernen (Entf) tHelpBrowser madman Help Browser madman Hilfebrowser &Close &Schließen tMainWindow Loading database... Lade Datenbank... No startup file found Keine Startdatei gefunden madman madman Couldn't restore previously opened file: %1 Creating a new file. Konnte zuvor geöffnete Datei nicht finden: %1 Erstelle neue Datei. Welcome to madman. Willkommen bei madman. Welcome to madman. We sincerely hope that you're about to discover a powerful new way to enjoy your music. madman is a powerful tool, we advise you to take your time to get familiar with its many features - the madman website at http://madman.sf.net has lots of useful hints. First, you might want to tell madman where you keep your music. Willkommen bei madman. Wir hoffen, dass Sie gerade eine sehr coole neue Art entdecken, ihre digitale Musik zu geniessen. madman ist ein leistungsfähiges Werkzeug. Bitte nehmen Sie sich Zeit, um mit madmans vielen Features vertraut zu werden. Darueber hinaus hat die madman Webseite (http://madman.sf.net) viele nützliche Tips. Zuerst sollten Sie madman aber sagen, wo Sie ihre Musik speichern. Failed to save your database. Do you still want to quit? Datenbank konnte nicht gespeichert werden. Wollen Sie das Programm trotzdem beenden? madman - %1 madman - %1 madman - <unnamed> madman - <unbenannt> Are you sure you want to start over from scratch? Sind Sie sicher, dass Sie von vorne anfangen wollen? Madman Database (*.mad) Madman-Datenbank (*.mad) Error opening the file '%1' Fehler beim Öffnen der Datei '%1' Saving database... Speichere Datenbank... Error saving file '%1' Fehler beim Speichern der Datei '%1' About madman Über madman About criteria in madman Über Kriterien in madman Criteria can be combined via parentheses, | (or), & (and), ! (not). The following criteria exist: ~all: selects all songs. ~none: selects no songs. ~any(...): selects all songs that contain ... in any field. ~artist(...): selects all songs that contain ... in the artist field. ~performer(...): selects all songs that contain ... in the performer field. ~album(...): selects all songs that contain ... in the album field. ~title(...): selects all songs that contain ... in the title field. ~genre(...): selects all songs that contain ... in the genre field. ~filename(...): selects all songs that contain ... in the filename field. ~rating(>|<|<=|=|>=...): selects all songs that have a a rating less/greater/.. than ... Plain text will be interpreted as ~any(...). Texts mentioned above as '...' can take several match modifiers: re:... for a regular expression complete:... for a complete match substring:... for a substring match fuzzy:... for a fuzzy match Substring matching is assumed if nothing is specified. Comments can be included if enclosed in { ... }. Kriterien können mit Klammern, | (oder), & (und), ! (nicht) kombiniert werden. Es gibt die folgenden Kriterien: ~all: wählt alle Songs. ~none: wählt keine Songs. ~any(...): wählt alle Songs, die ... in irgendeinem Feld enthalten. ~artist(...): wählt alle Songs, die ... im Künstler-Feld enthalten. ~performer(...): wählt alle Songs, die ... im Ausführenden-Feld enthalten. ~album(...): wählt alle Songs, die ... im Album-Feld enthalten. ~title(...): wählt alle Songs, die ... im Titel-Feld enthalten. ~genre(...): wählt alle Songs, die ... im Genre-Feld enthalten. ~filename(...): wählt alle Songs, die ... im Dateinamen-Feld enthalten. ~rating(>|<|<=|=|>=...): wählt alle Songs, die eine Bewertung kleiner/größer/... als ... haben. Einfacher Text wird als ~any(...) interpretiert. Text, die oben mit '...' angegeben sind, können die folgenden Modifzierer enthalten: re:... für einen regulären Ausdruck. complete:... für eine Suche nach einem genau passenden String. substring:... für eine Teilstring-Suche. fuzzy:... für eine unscharfe Suche. Teilstring bzw. Fuzzy-Suche wird angenommen, wenn nichts angegeben ist. Kommentare können in { ... } eingeschlossen werden. New Set Neue Menge Copy of %1 Kopie von %1 Warning Warnung This set has children. Do you still want to delete it? Diese Menge hat Kinder. Trotzdem löschen? Criterion for song set Kriterium für Songmenge Error in Criterion: %1 Fehler im Kriterium: %1 Error in expression: %1. Fehler in Ausdruck: %1. By Genre Nach Genre By Album Nach Album By Artist Nach Künstler All Alle <b>madman %1</b><p>madman administrates digital music archives nicely<br>Visit the madman homepage at <a href="http://madman.sf.net">http://madman.sf.net</a><p>Brought to you by<br><ul> <li>Andreas Kl&ouml;ckner <a href="mailto:inducer@users.sf.net">inducer@users.sf.net</a><p></ul>Some code borrowed from<br><ul> <li>XMMS &lt;http://www.xmms.org&gt; <li>Cedric Tefft &lt;cedric@earthling.net&gt; <li>Ricard Cerqueira &lt;rmc@rccn.net&gt; <li>Johannes Overmann &lt;overmann@iname.com&gt;</ul>(C)opyright 2002,2003. Proudly distributed under the GNU General Public License. <b>madman %1</b><p>madman administrates digital music archives nicely<br>Besuchen Sie die madman-Homepage unter <a href="http://madman.sf.net">http://madman.sf.net</a><p>madman wurde Ihnen geschenkt von<br><ul> <li>Andreas Kl&ouml;ckner <a href="mailto:inducer@users.sf.net">inducer@users.sf.net</a><p></ul>Einiger Code ist geborgt von<br><ul> <li>XMMS &lt;http://www.xmms.org&gt; <li>Cedric Tefft &lt;cedric@earthling.net&gt; <li>Ricard Cerqueira &lt;rmc@rccn.net&gt; <li>Johannes Overmann &lt;overmann@iname.com&gt;</ul>(C)opyright 2002,2003. madman ist gluecklich, unter der GNU General Public License verbreitet zu werden. madman Database (*.mad) madman-Datenbank (*.mad) New Playlist Neue Playlist This playlist has children. Do you still want to delete it? Diese Playlist hat Kinder. Trotzdem löschen? Criterion for dynamic playlist Kriterium für dynamische Playlist The file '%1' exists. Overwrite? Die Datei '%1' existiert. Überschreiben? <h2>Searching in madman</h2>Criteria can be combined via parentheses, <tt>|</tt> (or), <tt>&</tt> (and), <tt>!</tt> (not). Plain text will be interpreted as <tt>~any(...)</tt>. Unconnected criteria will automatically be connected by "and". Comments can be included if enclosed in <tt>{ ... }</tt>. <h3>Text criteria</h3>The following criteria exist:<p><ul><li><tt>~all</tt>: selects all songs.<li><tt>~none</tt>: selects no songs.<li><tt>~any(...)</tt>: selects all songs that contain ... in any field.<li><tt>~artist(...)</tt>: selects all songs that contain ... in the artist field.<li><tt>~performer(...)</tt>: selects all songs that contain ... in the performer field.<li><tt>~album(...)</tt>: selects all songs that contain ... in the album field.<li><tt>~title(...)</tt>: selects all songs that contain ... in the title field.<li><tt>~genre(...)</tt>: selects all songs that contain ... in the genre field.<li><tt>~filename(...)</tt>: selects all songs that contain ... in the filename field.</ul>Texts mentioned above as '...' can take several match modifiers:<p><ul><li><tt>re:...</tt> for a regular expression<li><tt>complete:...</tt> for a complete match<li><tt>substring:...</tt> for a substring match<li><tt>fuzzy:...</tt> for a fuzzy match</ul>Substring matching is assumed if nothing is specified.<p><h3>Numeric criteria</h3>The following criteria exist:<p><ul><li><tt>~rating(&lt;|&gt;|&lt;=|=|&gt;=...)</tt>: selects all songs that have a a rating less/greater/.. than ...<li><tt>~playcount(&lt;|&gt;|&lt;=|=|&gt;=...)</tt>: selects all songs that have a a play count less/greater/.. than ...<li><tt>~existedfordays(&lt;|&gt;|&lt;=|=|&gt;=...)</tt>: selects all songs that have been known to madman for less/greater/.. than ... days<li><tt>~fullplayratio(&lt;|&gt;|&lt;=|=|&gt;=...)</tt>: selects all songs that have a ratio of being played in full to the total play count less/greater/.. than ...</ul>Equal matching is assumed if nothing is specified.<p> <h2>Searching in madman</h2>Criteria can be combined via parentheses, <tt>|</tt> (or), <tt>&</tt> (and), <tt>!</tt> (not). Plain text will be interpreted as <tt>~any(...)</tt>. Unconnected criteria will automatically be connected by "and". Comments can be included if enclosed in <tt>{ ... }</tt>. <h3>Text criteria</h3>The following criteria exist:<p><ul><li><tt>~all</tt>: selects all songs.<li><tt>~none</tt>: selects no songs.<li><tt>~any(...)</tt>: selects all songs that contain ... in any field.<li><tt>~artist(...)</tt>: selects all songs that contain ... in the artist field.<li><tt>~performer(...)</tt>: selects all songs that contain ... in the performer field.<li><tt>~album(...)</tt>: selects all songs that contain ... in the album field.<li><tt>~title(...)</tt>: selects all songs that contain ... in the title field.<li><tt>~genre(...)</tt>: selects all songs that contain ... in the genre field.<li><tt>~filename(...)</tt>: selects all songs that contain ... in the filename field.</ul>Texts mentioned above as '...' can take several match modifiers:<p><ul><li><tt>re:...</tt> for a regular expression<li><tt>complete:...</tt> for a complete match<li><tt>substring:...</tt> for a substring match<li><tt>fuzzy:...</tt> for a fuzzy match</ul>Substring matching is assumed if nothing is specified.<p><h3>Numeric criteria</h3>The following criteria exist:<p><ul><li><tt>~rating(&lt;|&gt;|&lt;=|=|&gt;=...)</tt>: selects all songs that have a a rating less/greater/.. than ...<li><tt>~playcount(&lt;|&gt;|&lt;=|=|&gt;=...)</tt>: selects all songs that have a a play count less/greater/.. than ...<li><tt>~existedfordays(&lt;|&gt;|&lt;=|=|&gt;=...)</tt>: selects all songs that have been known to madman for less/greater/.. than ... days<li><tt>~fullplayratio(&lt;|&gt;|&lt;=|=|&gt;=...)</tt>: selects all songs that have a ratio of being played in full to the total play count less/greater/.. than ...</ul>Equal matching is assumed if nothing is specified.<p> tMainWindowBase Overview Übersicht madman madman &Songs &Songs ? ? New Neu Remove Entfernen Copy Kopieren &Criterion &Kriterium &Edit &Bearbeiten &Set &Setzen &New &Neu Ctrl+N Ctrl+N Open Öffnen &Open... &Öffnen... Ctrl+O Ctrl+O Save Speichern &Save &Speichern Ctrl+S Ctrl+S Save As Speichern Save &As... Speichern &unter... Exit Beenden E&xit &Beenden About Über &About... &Über... Rescan Erneut durchsuchen Reread tags Tags neu lesen Help on Criteria... Hilfe über Kriterien... Update overview Überblick aktualisieren Preferences... Einstellungen... Toolbar Toolbar &File &Datei &Help &Hilfe &Search &Suchen &Playlist Contents &Playlisten-Inhalt Help... Hilfe... &Help... &Hilfe... Show help browser Hilfebrowser zeigen tMultilineEditor Form1 Form1 TextLabel1 TextLabel1 &OK &OK &Cancel &Abbrechen tPlugin madman Plugin madman Plugin Plugin died because it caught SIGINT or SIGQUIT Plugin wurde wegen SIGINT oder SIGQUIT beendet Plugin execution resulted in non-zero return value Plugin-Ausführung resultierte in Fehler Plugin not yet configured Plugin noch nicht konfiguriert tPreferencesDialogBase Visible columns Sichtbare Spalten Preferences Einstellungen &Player &Player Number of Backups to keep of database files Anzahl der Backups der Datenbank &Remember main window geometry &Hauptfenstergeometrie beim Start wiederherstellen &Automatically scan for new songs at startup Beim Start &automatisch nach neuen Songs suchen This will automatically find newly added songs when madman starts. However, it slows startup by a few seconds. Dies bewirkt, dass beim Start atuomatisch alle neu hinzugefügten Songs gefunden werden. Es verlangsamt den Programmstart um einige Sekunden. Enable Play &History collection Abspiel&geschichte aufzeichnen This controls whether madman will remember all the songs you played, and when, and for how long. Diese Einstellung bestimmt, ob madman sämtliche gespielten Songs in der Abspielgeschichte aufzeichnet. Use &Fuzzy Search &Unscharfe Suche benutzen Fuzzy Search is only used for search strings of length 4 or above. This may be slow on older machines. Unscharfe Suche wird nur für Suchstrings mit 4 oder mehr Buchstaben benutzt. Diese Option ist auf älteren Computern langsam. &General &Allgemein &Add &Hinzufügen &Remove &Entfernen &Media Directories &Medienverzeichnisse Plugins found: Gefundene Plugins: Plugin Properties Plugin-Eigenschaften Name Name <none> <keine> Description Beschreibung Co&nfigure &Konfigurieren &Plugin Directories &Pluginverzeichnisse &OK &OK &Cancel &Abbrechen tSongCollection Reading tags... Lese Tags... Scanning for files... Scanne Dateibaum... Looking for unwanted songs... Suche nach nicht verlangten Songs... Looking for orphans... Suche nach verwaisten Songs... Updating existing tags... Lese existierende Tags... Reading tags of new songs... Lese Tags von neuen Songs... Detecting moves... Erkenne Dateiverschiebungen... Adding songs... Füge Songs hinzu... tSongListViewItem %1 MB %1 MB tSongSet Searching... Suche... Unable to add unknown file %1 Kann unbekannte Datei %1 nicht hinzufügen tSongSetViewManager &Play now (F9) &Jetzt abspielen (F9) Play &next (F10) Als &nächstes abspielen (F10) Play &evenutally (F11) &Später abspielen (F11) Play 20 random songs 20 zufällige Songs abspielen &Play &Abspielen From Filename: &Artist - Title Aus Dateiname: &Künstler - Titel From Filename: &Title - Artist Aus Dateiname: &Titel - Künstler Repeat last retag on selection Letztes Retag wiederholen R&eread tag &Tag neu lesen &Strip tag Tag &entfernen &Tag &Tag &No rating &Keine Bewertung &0: - &0: - &1: * &1: * &2: ** &2: ** &3: *** &3: *** &4: **** &4: **** &5: ***** &5: ***** &Rate &Bewerten &Delete from disk (Del) Von der Festplatte &löschen (Entf) R&eset play statistics Abspielstatistik &zurücksetzen &Highlight current song &Gegenwärtigen Song zeigen Displaying... Zeige an... File Deletion Datei löschen OK to physically delete %1 files? %1 Dateien wirklich löschen? madman madman OK to set the '%1' column of %2 songs to '%3'? Die '%1'-Spalte von %2 Songs wirklich auf '%3' setzen? There was no previous retag. Sorry. Es gab kein voriges Retag. Sorry. Run &Plugin &Plugin starten Are you sure you want to run plugin '%1' on '%2' songs? Sind sie sicher, dass Sie das Plugin '%1' auf '%2' Songs loslassen möchten? This plugin has mysteriously disappeared Dieses Plugin ist mysteriöserweise verschwunden Are you sure you want to run plugin '%1' on %2 songs? Sind sie sicher, dass Sie das Plugin '%1' auf %2 Songs loslassen möchten? &Delete from disk (Ctrl+Del) Von der Festplatte &löschen (Strg+Entf) %1 song(s) selected: duration %2, size %3 %1 Song(s) ausgewählt, Dauer %2, Größe %3 %1 MB %1 MB madman-0.93/expatconfig.h0000644000175000001440000001272210053135241015132 0ustar akusers00000000000000/* config.h. Generated by configure. */ /* config.h.in. Generated from configure.in by autoheader. */ /* Define to 1 if you have the `bcopy' function. */ #define HAVE_BCOPY 1 /* Define if you have the CoreAudio API */ /* #undef HAVE_COREAUDIO */ /* Define to 1 if you have the header file. */ /* #undef HAVE_CRT_EXTERNS_H */ /* Defines if your system has the crypt function */ #define HAVE_CRYPT 1 /* Define to 1 if you have the header file. */ #define HAVE_FCNTL_H 1 /* Define to 1 if you have the `getpagesize' function. */ #define HAVE_GETPAGESIZE 1 /* Define to 1 if you have the header file. */ #define HAVE_INTTYPES_H 1 /* Define if you have libjpeg */ #define HAVE_LIBJPEG 1 /* Define if you have libpng */ #define HAVE_LIBPNG 1 /* Define if you have a working libpthread (will enable threaded code) */ #define HAVE_LIBPTHREAD 1 /* Define if you have libz */ #define HAVE_LIBZ 1 /* Define to 1 if you have the `memmove' function. */ #define HAVE_MEMMOVE 1 /* Define to 1 if you have the header file. */ #define HAVE_MEMORY_H 1 /* Define to 1 if you have a working `mmap' system call. */ #define HAVE_MMAP 1 /* Define if your system needs _NSGetEnviron to set up the environment */ /* #undef HAVE_NSGETENVIRON */ /* Define to 1 if you have the header file. */ /* #undef HAVE_PTHREAD_LINUXTHREADS_PTHREAD_H */ /* Define if you have the res_init function */ #define HAVE_RES_INIT 1 /* Define to 1 if you have the `snprintf' function. */ #define HAVE_SNPRINTF 1 /* Define to 1 if you have the header file. */ #define HAVE_STDINT_H 1 /* Define to 1 if you have the header file. */ #define HAVE_STDLIB_H 1 /* Define to 1 if you have the header file. */ #define HAVE_STRINGS_H 1 /* Define to 1 if you have the header file. */ #define HAVE_STRING_H 1 /* Define if you have strlcat */ /* #undef HAVE_STRLCAT */ /* Define if you have the strlcat prototype */ /* #undef HAVE_STRLCAT_PROTO */ /* Define if you have strlcpy */ /* #undef HAVE_STRLCPY */ /* Define if you have the strlcpy prototype */ /* #undef HAVE_STRLCPY_PROTO */ /* Define to 1 if you have the header file. */ #define HAVE_SYS_STAT_H 1 /* Define to 1 if you have the header file. */ #define HAVE_SYS_TYPES_H 1 /* Define to 1 if you have the header file. */ #define HAVE_UNISTD_H 1 /* Define to 1 if you have the `vsnprintf' function. */ #define HAVE_VSNPRINTF 1 /* Suffix for lib directories */ #define KDELIBSUFF "" /* libid3 found? */ #define MADMAN_HAVE_LIBID3 /* Name of package */ #define PACKAGE "madman" /* Define to the address where bug reports for this package should be sent. */ #define PACKAGE_BUGREPORT "" /* Define to the full name of this package. */ #define PACKAGE_NAME "" /* Define to the full name and version of this package. */ #define PACKAGE_STRING "" /* Define to the one symbol short name of this package. */ #define PACKAGE_TARNAME "" /* Define to the version of this package. */ #define PACKAGE_VERSION "" /* The size of a `char *', as computed by sizeof. */ #define SIZEOF_CHAR_P 4 /* The size of a `int', as computed by sizeof. */ #define SIZEOF_INT 4 /* The size of a `long', as computed by sizeof. */ #define SIZEOF_LONG 4 /* The size of a `size_t', as computed by sizeof. */ #define SIZEOF_SIZE_T 4 /* The size of a `unsigned long', as computed by sizeof. */ #define SIZEOF_UNSIGNED_LONG 4 /* Define to 1 if you have the ANSI C header files. */ #define STDC_HEADERS 1 /* Version number of package */ #define VERSION "0.93beta1" /* Define to 1 if your processor stores words with the most significant byte first (like Motorola and SPARC, unlike Intel and VAX). */ /* #undef WORDS_BIGENDIAN */ /* Define to specify how much context to retain around the current parse point. */ #define XML_CONTEXT_BYTES 1024 /* Define to make parameter entity parsing functionality available. */ #define XML_DTD 0 /* Define to make XML Namespaces functionality available. */ #define XML_NS 0 /* * jpeg.h needs HAVE_BOOLEAN, when the system uses boolean in system * headers and I'm too lazy to write a configure test as long as only * unixware is related */ #ifdef _UNIXWARE #define HAVE_BOOLEAN #endif /* * AIX defines FD_SET in terms of bzero, but fails to include * that defines bzero. */ #if defined(_AIX) #include #endif #if !defined(HAVE_STRLCAT_PROTO) #ifdef __cplusplus extern "C" #endif unsigned long strlcat(char*, const char*, unsigned long); #endif #if !defined(HAVE_STRLCPY_PROTO) #ifdef __cplusplus extern "C" #endif unsigned long strlcpy(char*, const char*, unsigned long); #endif /* * On HP-UX, the declaration of vsnprintf() is needed every time ! */ #if !defined(HAVE_VSNPRINTF) || defined(hpux) #if __STDC__ #include #include #else #include #endif #ifdef __cplusplus extern "C" #endif int vsnprintf(char *str, size_t n, char const *fmt, va_list ap); #ifdef __cplusplus extern "C" #endif int snprintf(char *str, size_t n, char const *fmt, ...); #endif #if defined(__SVR4) && !defined(__svr4__) #define __svr4__ 1 #endif /* Define to empty if `const' does not conform to ANSI C. */ /* #undef const */ /* Compatibility define */ #define ksize_t socklen_t /* Define to `long' if does not define. */ /* #undef off_t */ /* Define to `unsigned' if does not define. */ /* #undef size_t */ /* Define the real type of socklen_t */ /* #undef socklen_t */ madman-0.93/configure0000755000175000001440000000327310053135241014362 0ustar akusers00000000000000#! /bin/sh set -e echo -------------------------------------------------------------------------- echo IMPORTANT BUILD INSTRUCTIONS echo -------------------------------------------------------------------------- echo "madman uses a new-ish build tool called \"SCons\"." echo "Please read the README for more information on building madman." echo echo "This script is supposed to help you get started with SCons." echo -------------------------------------------------------------------------- echo Hit Enter. read echo -------------------------------------------------------------------------- echo "If you don't have a copy of SCons already on your system, madman comes" echo "with one that you may use. Should I extract it now?" echo -------------------------------------------------------------------------- echo -n "yn? [y]" read ANSWER if ! test "x$ANSWER" = "xn"; then echo "Deleting a previous SCons version, if present..." rm -f scons.py scons-README scons-LICENSE DIR=`find -type d -name "scons-local-*"||true` if ! test "x$DIR" = "x"; then rm -Rf $DIR fi echo "Extracting..." tar xfz scons-local-*.tar.gz echo -------------------------------------------------------------------------- echo "Now just type ./scons.py to start building or ./scons.py --help to get" echo "some help." echo echo "Have fun with madman." echo -------------------------------------------------------------------------- else echo -------------------------------------------------------------------------- echo "Not extracting. You're on your own, I suppose you know what you're doing." echo "Have fun with madman." echo -------------------------------------------------------------------------- fi madman-0.93/current-version0000644000175000001440000000000510053135241015531 0ustar akusers000000000000000.93 madman-0.93/scons-local-0.95.tar.gz0000644000175000001440000052506110053135241016414 0ustar akusers00000000000000vL@\{sȖN*cIf+UK0I x2ܔ h,$]=L[w?Gd'3Uf*~$q ytރoiۧ'7~N?{n?{ngO7ɒTBJnR*1U*^LZS_w,ПS1N-t9s╗$8 QӍX2Hլ)R" w)j#'! `H.,SIz0{7[ $DaNm{4LIfԔ0H aX=|SOy0}o; $AY3@>bμ9hZQ6dtff)z.e $"&0Bo`%R7\%f^ &!|if1%2$UGkoPt)] (13"Si@n eG5d:/ͤIf(H0M\a2!KF-,>4V~SF!8A0:L K̜r fhQ a$\)w90HeȂ& ?,W6<S&^ajDb"@X2| -5!3Ӳ 4 =UF[\j0іT0i%"@9leP6 ʞnT!3P0+hyu:/۵60SMօׇ BFZOS,PC * 3-jy03<`0]Ky=wJv8:^+hNY5څu\Ky+v0^e2Kɯ{ [Oi  PyŒ"n0K .!T:h~7Ж!tr KV*uf\Pij`kegT| 42t-2Saڱ='jg6NT  ye $S"H%uEW)sҸ(QNh.tY+;ۃ.Pʎ%Iid,ƝO+6IQr8jQ+X\ w E,Z5Mb\:#@uuöf@@GmH&# fkЎNCM7JZAA$>ֈZ(c1mk*#.GA+ ԠyNKHPnsKqϦ5PYe;SMȢR!nA,ˬK+3jП` a~M@TU kc7-xzxmRXZ*?*r33|vEzyK9 %d?1nwci=%nŹv  ܈Q(e _j-7hdž>9cۧ'Ϟ1?9}܆OJ /{īۉM`kAt~|h?{~w_pRqZ)3$R~ /d_9GN\8dbJ&|G.ntt H>SxK<!vts*`+.$@ܸmƅLUps''ԛcs@GclY^d֕?Q) -A3)F>A7*N4TU-ڑxSo0eALWKM͘nZVej6r+0 MxoGsIg<{RLr --s4/"Y%Kjt̥Eȱ,B0[[[M(ÔB>!=:Bk#WhM F /(54\M臧]ktZ-G|5bE]:Z%at9~lb郍 `kGnO/7=xhpMKLn/u~,d:xnT nթ>b qx7k5v0Uwc$$ʀ r޵*N'_B2Z1tbţy ]JŒG }7 j*QZg+Dpq&SpXÜWۿk=o6w^c >_Z hڷ*dcچ9)$ij,BI #tj)\b D%gBɵ+s*aFP4xm%/WәWc}?$?`ad8 fxHqg5M޷?t;'tMPk Y\z?*n`Ɲ;|λUrd`m-~4ȒsDz_*g>#q5+HV!mׄ=R0K#Y5w} @jкy.*2m M KXYx8Igl.Gu ~ȮX A^S~?ua,v:/`7tSCkᅌ|#ccSK(IXgc'#.•V!Q#5?*/aTY;[~KZ7^4K:$zAv-@S~eԬMuGy (a̗N8xy5 `irmX"%1${1o-Zckil}4[\_?ߵ^R.|^A?" i5+KHxasX)UJ۠t mWD1窻KyO_Z**TS;RQe< ϣ*dM)jnzo"mM=xK3}v#8hS*tkT^t-ۆZM3n7bI<-*檏jܲ[\5qeꇽqs; Ƕil 5oz燕5dhuZ-ڴd$&٭֡A~,&husiU~c0"I-,۰8__^ϪRQx3K/;oUD$:0>m Kn'gën ?ls(~9h*mƱ %{j9ýT6Oҽ*Ԑn4WuiC wC\l! # 5@ekc=ꇷ?Hi2{?MewY{+{wՑԳo)olwI?LĞΦ $3 ӆC%'wb4%VB& ^%!R&ϐYxeXϽB}vwKlW'yĒl}DE>i>su_<ϗ+)t 2,nBw<$ifR*]p]n_ "yTo\$ }YFz(2Iv[n:4)7^u;؟q,7G~"7QrBl0.灦ڻMsNc͜ŏKi0Z3<[]#Y{ 3ZKR\_cڸEa|jOo;i/iz*@= 'JR71c0`P=47.8-S @68mU(nȉ.m tKBZQ)ZVZhB-$#ۢiO.{5.ǣvՈbG'94\ tG4ZS2un.#m*֣uk8e]*iiCJHH1sdK(7(.y٥H>.5YR\!{9g;!́U:wbkbs#Res~+ fI &Pw,|B8팰;%4dhv`6n)H&m 4$g19 + ?T%؊2QPeU4ue 'YڽшrVa-,*#ɉ*W8jI4>BJ'2gO1MJY(O Qaxن1y}jif$HX&q#iJc 2am)+ȎnjX@iHP53ʝ1x  n-k;vv3b粖$nŴ*vW( Pj,M΁71h>{~dkUp}|x5j5yB-Ө\qTRV_:XtEm!i`d|bp49G8BʹlOzkN>MiAh_ܐ31 O;Q2T½&'pqjWVPEniQF2 i[)ˀi&܀Lrŝc|"BfRpF{NtUOgo]ْ_s%`_[m-cq ~6 1nϪfr 츚 @Ϯo{Ar873b }2b]/iQ;3&T r$ͩtfFcC ]?9Iޑ3UlP#_!ǽv diL |- )FleGkς t&% Rjw tpX]~PuƮ`mzTEzAM֬ctBE-X( ? ȕV <3QAb³k/(ʇq:71 -$dNϴl8;5SS#]=n kQm4EGѻSڰXֆg_Ac݈`.KyKBޥ_zwQ:07ŌR8{a\!e5 <&нלky?%X_\{DԐ@ue0#*gk;ߕ/yl( w_1QV zp|#fkY^&-Nje;hMBgPH|-x6qɺ4k)Q=:3kzgjE a*/Bv4YpNjv,_E{x>|#eڎws|Oa6F<3/`E ٜѿ'(&]"*Ș -*NdyEVWMԹ!R!;#)j^@F(3 ,@+zMXg̑DV#5AdO1"eDJ:if UI{/V2q$/06V3H,tvq[zy9"[jv%>3UzI٨wlOHo9_CD$1]aխWSJq=Shwb8۳֢[4 u;bVJwͣP 㓣i(sj!eZy26pZcl*F6E+f7V M,!ҭ 4$|NbJ;3[g~%n'uE*` pL̂VBBNgzŝ]LPJI;߭Y dv&b&=PmǙ4ZEHypvr`% U+h\ץǀF崋9B~u0L^NǷK'ILHG(E!Y7 lo f Ә^eۓ(_~]MDv=Zhjj/yΚ~R uDzQlKWbA(-R0@aq;lezl=%A%sO`dEFUKIG}=MX~tm]! o܇'tJ~@!&~',A& eV.zFȴrGr;KK<7sB0+vx#Gwjց6\OO5 ּ\o˝$SAwu@xBu'?޵%D.%W~%bԁ?WvW8[*Zt5pߚm.Ζe0A<'s g#dH;5 `)j7aSc)s`>Q()*QR"hҀT$9shjYײgHK6FޑPDt;ˬZ΁PMxL #k-4'$fn38giM<7tsK־8i~0TrՈmmd3)CKJ~801;]8G]EoWG[Q6t لU^r B?Z| PJS.Regk#%W~,Ѿ'<8` zB? "oqmTdr -()bO8h:]B@I°8#ijQc2GMbRj/1 c֖Ɇ;Pw# pi )kM3u>pT+1y|}Sf=߻]"GxWR1vWx & P2' [o:moSwwٳ$Ͽχ$43"X: уL8$}$a .[-BP3kT&hVAMy]Ó:[`}hQ/ ~Nin)<䧨ϧzL]ZzqZK C㧺~<(wKX"GL= ~DXM5(@s>f(ĉ). QOSAϛv .{CI ۮaKwX#?Q3w]C+X GlS{hŨrbЛ|#^?>]s6!f{~ñ+R!G FZqX~A1)2zSXZC!Zk,cmU,sB2LAPf>p(N[o#5S&֮5u8ǷɯUw$NHDw k, -,T1cM~l`N4xG(rd4ԉ+LZ_F*HIoq嘍?Hq(SjX&SAKn(@/-3!S"$fk1LPy"C3o 6]W/7NFҨbsʇ&<`g(nPLfn-| +9!P_߿z|7{[ȋӭIlP(q/hSD<9x6Yz^}>z}wޭL)N=pzc%@ȧ3– b0DC褘%>0BӑC=sӼt-ʔ>1Y!# T<@e^>yǾ,L5]1i[J9M=XI^mgR^vQzQ>Ӡw31gĐ(z"L8i8 .i0I|MYBgoϊK ~"L^8 /;KF`cW# h<]`Z`\-2R 9 УzVj\ mT.WQ%Аue_4/-6 ͳ1sWuAeGMd0LMrΔƪi?1!f2htw a.hfbww6[A CCfxEd7x7ǝq~Ωs: HZ^- 7 l{S+1Ǔh[9`X/2w57D' q[8hn 悚s/9vc`^ʶԬC)6WLtFlU2:;]^x]UY,[X (Z~aV.Pݠ )@PbNz3gLub"bC7a|Im˟'@B^/G4&kek䟓-^(0n>b d#t @CT0j>G/,?{`Fb BVvy O8stbbT [Tڮz.7H9ŊmE9ƒ.sZ-7k D5|0!a˟)9TBpBrX9`h!tX-tjp5Nxe0>(by+/[(Wmbv•s9fK/o1+պMȇ H͋{Oph8#<6u7Y8"|oE#D.8Hk .'%Lq$<ح(8NZهmNN*|#s$+u'TVUڐʼn*q$x PRȮX8DLV6|V##pwAbPI+^gX<-Vso-ڛzRlji2oj*WeZ7 Ƌ,&Dt] Lm^@;84 ƯBwH;{a)ɑNpc"yL4"*!= S4hu i`ea4r`_-#tm.Qа 5i'D5SfJ N@,7?mC5H\$d1),;.w?"q(y $Vы,4Z~{YO"k}Ԁ􈷖黐JYqnCŔdp=''U6v Bؒ@'SթN5zIZDJ) #!b:U 3aV1OsȂޢdf $3-9!X#¾XG;,Jₓ dg! |rM4]6(_E>mJs =%PP׿a'񄳝 t[a)U6%#L-T`Q$McL4Ț=,mp#gbhwh]cPSo=2潱tw,d|^:[[˧>-f}'>̽e+ IJ'x謻Otp;MD2Η7UW<,pS;yqωl7BwU~[tt? NsU0/ 9\Tΰo.ToenنVTTƤs ]Ya2ޤJ!c#߳?^`/-e醺b嘨ߦ7no[l0NQ. yQڳ1CMK?#Qr"H G@|˜L#b# z=c=;,Cf`X>%@q6N[ۧ%] A?#@% HoMi;tQ$wztTؐ|uz>˵>+1@TU02eEEbukDH%DeD6H/K=Fd. BO".(9 p(3MvjŲPsji) $x!IvGw#Tnlф9!X6SI؏p63#y /, Y9m(=LX'LmqWە tS!I/4"T)! 1\/PAK^iPE2(AN fKVJ\R}TjT8q\0Ol C15-`s1&su 5£I[Edn-ԭGbk=J{ PZ3NHMQJ)nAYԏhz ,^ g4w:wGH'!AmmV2a0-ZdYwƅy^p/ !0gR& glUJǰTO(V@,@?vY M^v%ݴ0(>+.[,Cat( V 6:ra)\\rp?:<{ƤZkLv6#Ԇ!4P.@eʵDb OVT,ڡu")akk{Y |WG+CAh.&̲F _eySZ_Z7wA cc6q;z(m<ߏ?M $-eV-Ư5MIӹ2PimHYg#t2%tӲrI@  ?{g7X,yxڍ罤I,ݿSw*Ã}0pq7q$z#mD>wMnbO'B=\ ˆOEVv-t$,N.X! `Ds1Jo" knQ)Ĺ10FX9td282 77kQՎWWg(UʹmIL^TV!@C̳ 0>1Z r! uil^~JDq.{'4y3$.s OL9.j{R36+)ögrJL2Rk8wYv9UK(-ŮmmW6FP~D vBz~tZ>8l99t4I;[2Sf g3ݻ8P. %Ym}?p:im>!iXyET7_ov(~=v%ןV0V|cc9MS(!= !5ruw"1~^n![UqAÔ}2_Ab<QhF"<`$2SƠ_sL1/R}xa)^`F*y>M=A=t1o?HF?,Çɂ3+!۟?dO 19xG_m %qmab˳,g:nո="^l!haY[ӛ]Hdo3gA9\)hXal)9Gh(l>gƈi76j>#^AU軎f-\~[AF);WKXNM8H]5˸bzuٰXL+`.`ّ6{t[3YaSO:SO&"T $ G ޼>C1 )~.)HGp¢aqOXeDJĸv #;=C։-&&JT/QBɽ}2)-QkdǬNf|g6N+.y% Zp,޵Ԁ2R N Z -n.2P &*m?D%twx>fv]J{uO?> p ҹ,rKaK.\ WU#oY6޷f} Tn=(xٿࡑ'7_?޾|W|c͵ _2oi$$F!7Y{<-0kZe^L0FFPuSlq5zePI>Rȟ&qb.*/åܬh3qqt;n 9}^m{ kt9Aנ/l2*zI@2 ڝe+W-"9mm)Ū@"=/b?EoSzYW[v[Gm-{YP)k)5ϥ,Lړx_R/9 ^mR3"/f 9UfKd:@1h><d =ЖAɢN1twڟ9[ro_\cWx58aI{M=M-vdCPB)i$X{Z!`}u#' +9_fsCl22/ʇD@3'挫 buN1//-9|ɟNm#DLप D7zy$Iߐ/ZL2XeOdžd.v| w rW5Xo<^];SzWV;^Q|KE,R>ѝ/#XkӵϻxeqɩrDMѩ&J7=OvRϿ@012'Z~ĹE@xl]}Y O\قct0h $'ُİ1,kGo٫'O5۳˅GK (˕^y&=&F=;2Nj6ګ-)ee􂇁 i'7#ftaQcy$ED}\hx_%:J( x6x{x?>SVdϺl &!4S#E54{'yg$17LKqj#YY1m+3Gc\GwVZn'#r$a׾fL(Irm^yt@L%8+vtH(\ΘҖtHdlyɋf hzœf[IJf-wRJUDJ"Oȳ*dEMu1ty`g M瘈9dq%%RvV4ԩ,'&={-5u64;6bv9yqa/X\'h[Ki4ӵ,x:i.=CXI;/wg~ :ݗvދu?֨)ode nz臇~X/M &7scݩ+Qԑ:MEuXګ U2tymO}jO-y&'?;ŸDOk14;KQ"a _M(iF{k ?Q)з11{Kfuh70XX]EGtf,z7!qv #*q`Gux9CcRAe-pfg9\z9 Y3,ewe\.~zO$ƒIĵ4 L i}/"BjΦj>h츳UXAb(yAל#BQS!蹽ۆ uέnbʥp̩{| Ĥ5CȔ4hqXG8HfZ(8eO *E(R\%ijI&Drœ6A٥І p x7bok5 #жmwրm<`68x?}J[Y_wMhSF7d-@ 4BPO7V&mC3@1x0rC#%f5Z1y!G1"0#'//^|wC؂_%)X϶^ K>9~qѷ'/-3=; B :hwx}FRg}xa&#ϋTH{8WVQߪMG+q[tE#ixad82^B3)oy,nlta^ ^cSk㓽gXERʶTRc?!v wO~VN($yt=XjXKہH@"N⁄W{'x%GO|5_:|(h(Ǡ:p~ZpQyЏ'O?_9_/{<فn(O> M=zC?{c\oR{:WNMi ~XL&b ʻϧh m(U[{v{{ǜRh٦n @Q5 Df7777ږb;{Qgo,H$4@鈺};U]AE}ưݷ2$ًb՟0^Cv_'aɗ'$;c_cO^)u 5˜ rn {I/g8JaO ߽5ՌՍ1Wc=zF"G!#9>[+Zv*-9csʒ|sH$<3`=!1ĈަD,_576sMG3j&_7IY! kD1*ߥJgٿay%Z'dXc-3괟^ޝ~t 3dQ yN4xa`6#1 [Rg{~4+@Fz@)'ۑf 7]lY54quaE'ОXMqɚy8qO d<` uur W ß> Ά>"=J)b!AQEzBGF K,E2=/Vv(JCOhE ;IgJ/y'}UZW=Q4Sv(~?xp:J1$6szܡhDx{5X؅o=9+YCfvۆe 'c8ʘ(Zvi&p2^6QWvܜ|('ve݅K:n n;EΧtF/ٻl R.RS]͋%%u<$lo cYo2'ДAGLNArnU-G07a <6☤V`0LmΡ[Tj ?'7J+#'$*sRb #B}/(TuĖv}sJ&S tR,iW򄝔ڎ\Xu)pmyHZG W@3Y1⥉UH¤IOqCHNiTt6IA]ůة/9%3x-1ҜO6kpOR$i[ hTZ&INGIa%5fhP[VqmJ@^tP{U.X:VٰPM'-WX:yXLhЦ݆<|.{Y5U` ć#p j(Hc\!ˏz1S0)|)\$GQB/7(9fi[: -d0 Mwu+]] 6izw|{mp_`8֍MmxlS3:fxgb]/O:n&{$pܽ&#K"lDvkubGZƁe5k!NXV8AuI#m갂I%Շ,;2D֓/7m%\m3E(֌GYcpfYr`|T7|F \U>iEC߽λ#m7'3UgHx2s@0i↩MrLU(ӶXͶ w*|itgG@fdɋՊ崠Ba ؐm AnӲ-`d08>t3G 3QLYa>HB"Q˨޽9-V_T^wgbBe@ӈҗ\ Өw&32Eȝ[6,e;CL9M#.:_ ߮pŸ1OLR;5Z'Dg=m`-h)BuX=ǀU݆χY!ϒ dkLW>`ll!G</qqͷ(8g!g'|̌}JDfGw&n">{b@VUPDUƻdKĝ*8H*Dw*3˼MlݪhLP픍vzR9ſ ȺwhbF4G{E Ɲԣ~a^ޮWiӆM :M\70]BwKCWⓇ+Na2D n?KvZNl^}6ӗr)dۙwWg ղ(dYn63 bʡ; \/R֦YtA0s]$mKכ{]7(zq/tE Q"GQ7\^fh FI?Nl/./Rk+h@& D8Ù, FTg{No<H)&5I% >:NQQ27 "-O<Z ϭc$,slAnq˚. &BVq]ǨTzEjALQ\D&ïŻL`2^AiҷXpD71Gah7I˭kpcA'C :2;\ !EVcCDddNw(#>ZrJ d4V!3..zH݋lbjgV*#e-FoaN3cF BR7vF&g'p"fB/ݝ0Q#FO|>%sc.)yX's/^G41^;"s\EǗ3ANeq`*@]̂0!)2[&XivRM+վ79ASv]6h1m(ahnu&ˁ$)ɺ5aGX~!}EĮ Fg g雽K ZW$ePoh8DS[ͧ}31B+D?~ߴyo!٨B]q+3nC4Jhtgk 4!rV)wGΉ ċJemԨkgkl˞{#zW\^MC%(ҐD 5zM~CA.QL:T"B$cz'SՓu$2PKFv 3.a ;Ag8jbhr_qC*;+'Z4Mܠ# kMeh841~ԖS8*4QLE܅ [*zFhm%p e>;J5ϼ{51&U$=3R?t=1% 2a a( `Y BP8 V #jMJ3#/qxGРWYބ΂e鄥H-Z[CF~E=@݂k$dN!fuK0)1 ɿ?-> ۓx M(>%SeR] 8wjc#: 5]7!u.j0{ƫzwt: k^hAd]bWýPevd ǁo1h7r/E کGN8[?Ff,Ì+>kmm̨ *&ȨI"דXNLx&$^mae2R 0m]EP%!r4Uv"qz⾽<=j, ɎiUe%e!Qњg\:m-1ۘm~=LA0Jࣺnt@U= ru$بQ'z&E4IRU ϴgRms_,=O'$MĊ&y-!>#ކKxfi'wXRu |d`p|5C7!3_{6HlMwVevR36tT 'OhH+$"RY309"{w4NwIun2Z5kZDžl%&JFiVVUEq1ǁ3]sdOڒvVNRlwHڃ:=뗳qN3V(ն-sO&Gs6+l3 1,6̫y1Z`\Cֳm96\e.TSE0mf lf#"U;itLYbDM-J af0@#BlY"pm(@tT8$!o֍eAL-!leN<1D5vt"8M0$_.OAj&~7QHvzS&ɻ@#Gv{^2ۧTtԝ#̦(%5q8#0אr.!{X5*G9UO  21]T & H!8¢~T&TB Awb>Fq{T`sCk\.r ~rY]˛ Q>GJU&W*r4t;)\pD/Y76iK1zi-CX^G{ep8?wHՒ}NQ6~`Ս""MCwΣ(v~8*)PI{+KJ(~ҹ>S868L(:JȺ$p ʦq! $v/5B` n2U& SRuOv9nuJ{$$? .2E>56",[+%Ҿ)laQ6qռr={I?NmT˺ cٹ㰰Fdd?F#]qE}D0^\j5 ;X.+2sI9o+鸮/R8Q * Q&]C_ ]IFЭ!N2GGdceu;|0heƓrL%R/,{O}]qx)zD9oo4 e%@>@MRj8iYV%iOѱ n~:m+{!d7Ƣ} ]kv7[׃7\3@ Tfr%&I)\6*U\w oR]YRwU z {y[h h'iֱmv]SL0Skd#XYm"e?n}8?v ctz \y-ۮRK8}!G 7-7X+\H'pɫ6əƒaMSaAJe؎c Ǔ\W=pj/C2Zv93eJ D-xPGXS/r7j{K5ȳCӄNTVvrjZGrij :]EΌ$+Mp7,7j ZcX`ҋbTSQtX/*Mqt$I*_2-,ڤlAwoO1;9 &0\5ܙ\rJTfEfˆbg^. O;q' p*Ac2"ɠN#y͇7CD2z|̇}n : -(b*GQ :R iENz0a<,j5b,%LU ~;Itu9delZzm,ǜxN|9TbhDDzѹij#*eXd#ݘS?\W5O861rdWyZڣSX+(/o/nPAYkΠ?:`>'Π^BPxgK^e0:0!ØRs,_E*(J&$׭;|\\؀%<dDo;Éa1S#X)Z$f].vAYzUi l_ddy1=J&Y*qp΅vNOmh@!15N u M&ocs.݇%ꇇikV 1w\Àtږ*[j$Zm.M5I>- j{(n"KGƲ¨r/ԴRYue۠AjQrHb [Tp?M~a8dx&lxOa>Ol*1ͮt/D}YnLjaiẃJ .tTa, ̯\&cElX`s]Er ="I/7|2+敃H}zwvJi'٪O1C:IXEOō2 Lnc&Ol Itp|x"h:L` A1 >Y"ܔIl}~˘`ySeCxb`rfc]aN&\>Ő$Ggu n'M6{Wn9G&ؙ(o՚~fjhxN*hHpSz7lשpJfhTX$lM?`'}Q v|{uqGhVQM,f 8,{Hpqe}ԃ?jV[0 zPWFEqk!Gf)"BYH 8aIRڍM6xo,A{hMN$@ox =.8~KW1 *rl↉XL1r\_"7[̑. "p,Zo-ñL \tP*\5 Ɔk Ѝ?~1[$A/R=5ml?//?ǿǏE/>|?%U\T$XR,.~>M8lNu:nV>?H nb *O|tq F. /)'U`U! NEC\& b"xu,uZ]jh)D}eu[|:/F-0'hf-JJ5jߌ7CPFy).}28(J{Y>dQ7Wb dC| ͲbTQT(M;Dء *=/}Bw`PQ:&g,ʫ0lD g29'JyUϝ 9~Arx:zᓃ'Ik~zÓ^~@'H^>M^œ^r㫣QrճxvbO_||5_?<'/I,7OK@O^jpg{Gɫ^<>.<(/^8|Z:x~-óp{q~IKM<;7oKsDŤ;G `G'^wtx%4 5^@?OcTnlZ.@c&N)hM-34GT'Ač'7( `0]$Zd ˿瀠W@e`Ӈ|0^KF?H8#zk…S:\ڝPj,W(0ѵlZh&I%[t/ _/K=ʡ !?6㪘*ew[?w[4J^'ۣŔgL4A WҰ|0m^) vׇ[uiW-\toλd+M4U~x0Wܞ(IFۭbQ}~ȴ΂b/Os&O.]xh$B.xfNzBfYFa a5 (3q bp: +um&]6\TXXN?׏B_^Ѳ{HIO E,{(tH7XB27oU.{>ϸ3_8T֦?G/.U7..EO1醧C]%u'1tgUi,^|㮊^ffUEeK;iM ~l)sv~f85HfȠqK?UnfBF6cba: `Y7: V轢`,ݗ.6 l pbQp4e6DaCN t)oX?.Ջnڨ"wM7s f79b,ܾܤ~߲޶ @D"ȔTNwd[׵?svCn؏u({FcBeʘAj>D+!t%p(x4bln\D)U"ye:9(M}1tv;~(4TfXa' PdƠߌe"%|THӷ-ހ(6:-F፶whp71 zK%NaJj:.RhkNS8͡$φEL~G .Ҝ2T kVW446T #,P[}cCI.a$t)5NFj̛=)4!D4-02Y}R`>mC=y(x ~A4f 2mZh۪9T;D}%k!okMֻC MjF)`g[ 63f]ٛZkΕDvؽ(ee7@FNdoc.Ud {p @ nfl) _Ȍ<3b2P'+; kp8V^6|4yރsNxScEpg[ (fN}x'à訙۔kmȻoFo!fL! J%6䯿#m|wt gw\` EDI:~"ppSuKiTt{;;Tn[E}oq> 8HƟZ}_~~M>F +.YO%q6G 9҆ccEdQ%F2L6rQhDo ޒ*MK!gookS6ʪIr @{j^W-mV#JZ".Sء`Ӿ gP+ApJFlFg%bjRNa}klJ Re ‘^H#DD5hXNJNHsЧaR':Tc^:jXqU i057u&r~s#oVox-*)j,.A_Iyi )o-cw hg]L2CH'kiT- SW`;dZbDX=Z4¢SZ (g.;RޝY )F&dr꽖iUw ZT#4a'6l#r'L+ b^gNٰȶ$DeRk 8$d>ȯo_sp틀 GskcN[`][d Psʽؘ9Eɇ A!`Z'UtQbepQe?y % " %Ĩ (&HT12cBY-ФL/FӍ!sYϗD^6JU|R %{WQ5{pgVF c;څf #n\Bp,(; F mJ?8dPT!a.R"pU c/ ] Zgn6Np]Ƅ;S`ᒝ[X!sE}މ2zac9>W&ӂƒiC'=Qeh\ َV]' 5#$ BKx{ 'T2Vi:x׉uoH:zmf!v ^7fLs6p7 :Qq\!" Z>)D[7kj~ov)Ԍi-J:|&rzaS$[9{oɬDeF@GH{x2C7N1ɪ;VH')0PcyQz `6[d#$-4E=w1q__1'-Бd=6O wZIYb; ;jiQFJCzzKXb6ά?1`WsȠ ),jYL; 02 0L+3 v5TC.enK P30rcq''~ޓ@1Ƌ.d! &ItfуfS [:ˑ,U>ֱM%γlj*R`ʝpዢv ZdtVqrvy* +[bvcW@r3\qᝫrL:K-9|NbQ(`*LP/82Od7#RPOT^Y4;-#XWvAZ%ǰtG^&_!U[)ODD2}S>8LM,d?wc-Sk~ ^ojDa-cJ.h9Dcb$g~cw1uzb^9gZ`2[yC:m836TçnkZo!+N#Lis -"M>`+<%U`6 >Ϭ$Dh(/; ;C AuQMXVy]~VsIDb:0;60vd䚍mZYy#w8, f4N)?fScTEe0 5hI#J 9d'pBt62n)YeX9qpI-ĒŌů2 n\FigCdC-d.2.,E+wb$9¡acE53(ebӦfJ7 KI[{_h78~UbNR-^e LrVxٸ3aOYT|?[n%`LKvtP#~/и 32 SI%;bÝ$n1MMuq> ?gH@m?{[@2*F{' ?:aغD[WzϢ4%nr2e3Q y!0{(ggNSJ=Ak#$'4ÉcNA*Ff_hW1i) (8\, FkR\h՞zۆ68A;a#6~G5 ap>FZ:pDWS~|!S'Xt6(M1&GbBɣRõ8Ѭ$2v&>\0P S#S!V 0Y-hݴR3ϫOpN~]Yw/ߢRPmH+Rm(EaD6@u4!hDĊ|3c&L2ϡлCɀ !Rb|H/d֎D60(o>=c&}[@/b F \B :nG c:Io9TU0$xbqAKh}Y-ƚb88NSaDȎń.L$l{qq-7<4kNxzi"(=I1%tߒ,t!3n.pQޒEQ'Y+tVC]&wT(B%vuX^k.K5w pT-T_Ww{h ©&觋m$id ]*wpy;O+Z?Z޳փjb@[5Ӱ/F)ˎ\݆B.B Di' Ұp:Fm^cz> sŬRzݲh@?u%R%v D(~1/ ԝѳ^C8N~*v0Bz*gqLrLI5¾eNO bH:Pԩoc" 'IԙAcPh!Ev=d.dَ3^4c7H yf8Fj y NU g) 㷳 =^#dnDxI x?0iDZ <شImڎ+Ԑ?lrhgE=nݔKzc.!w?yxS:S$9P ]IDasXdsX$M<$٦#a%$$oƧw-ň4NyM=C$Kք+8P?%(V;%xCt$i8̷iQqBK(iEZ p qo{$5e4/|9t6@p08:ZVD6"h3ln Nn7@D (S@9=m۾-}7SL&dl _mnrBr8r 섂Srp4i C8vG W-yDY\I7igSݟKӖlx˘Gh^4"^eS(p;^ɋFF$r`lTBlc(^3b5c|=GIg;f?.eҰqtN;X sڠD؍W\Ԟ`! `!>-BQ @:%+?Qy?v0םA4noۥAt(2݈.H dEch;>kIC4Uvb%̿Y'?}{pK,9 r^G/"jk,2To@'YK0y;F砥<ek)+c"GF $9Q=& %phd O8kp?Ea'uq~h1iGKj~[(T uoٞ: ya{kAeyjS⥂>nD2^f=ɧ@J;4$`Sx8Z- H3t*2N>C"eKT,tǪ},Wle/ d2Zl$P%j%Y F&gENe\# ÛY=,(ףOu;Gr:[V"p/4^+4ZLfjPm:"]ǟIW%Rw4{/~cӅ^rCZ#gkXKҒCzQI*irR04]1t]&7FQ]K N7)YzL2wJ1+bO?NA{`"+I;jUkD?/Q}jEԿ. ez; %12(r`$^XHjmT^`_JT̘m:QfV:l-Liw/jD =hrۧ+(B̊Fftfܲd T40 }}-\w'틘n1EcD9D&5d3Ԏ jUx7 LXHh{+r++uHQ RhsFpnaZ[3Cgq8ˡ>*^^N)4Sft >Pibj&p9[-y-TZd;eNts9X bnLi,= ?|:y3}S}I˧e҅Zg]O%^ULz^^TpL&a%X#T޹=`%Fu(*Jl-=*5"C#G"*&io"eyH#|B#Q>`dp5OLicpTn?!D_qJ^/)sDhK{?#I1/lQxx8rܓChk05&NPSlӦP.QCV[%ʣi=GlM|R5'QN VG@#@dU\GvupFpԄ󘹼hI[: y&$Sd8s'?JA&QR%C V\L)KamW%5NlV of$'igJ<mw3%GfD{UM.Gq{7g<s4.dΠ*4[ToN69 6Tw{`pJExOgh;=Fbܠq'bԄ7x(;v)LCznxZPwtl>HI+d`.}tEq-Q 8u]v:ZȅoF哗;"AQ-g{jwV0yInsHQѩ- Ur>zv;r5ټQT-*~s,k:iR3g]1r5)iv/9= dLj~I oYtm:C"ȕx„bR^:Qozj>3Xt p2 /oe Z__.Pۿ0KbL)k7#p^lSr7p P"nE{t訨@ڻ]zE4$|@ ,ڴKlim$q]"UB%[ίG4rBW}x>G_8>o1d22A8>}ү_II뎙HUOM%kG>3DЩLQ $ŘMbc.ƶr&ǖa*=M ҙS4 'BN9uX؀3ҩ*S ! 0~95Xh% p^^+>#FEd)W.[4z"gg9i1y1 OC2x {@ӡ+s ͔t" s  N9 ֍;cMKaM H`b*9JY%9VeQn.lֈњu4%ИzQdrLf]/."µE 9'vw"=:C&pu0.a~%^3vgr.ŏ&UNK;\`%bөaAn_&M`)[|UTg' ($mz_1^ʁ<$Nb DӁRT)epZixz>;|=zN9­B@L0Vh"f0R){6sC%+Ob8t6Mo NH J*El^pJF̅Z(77X_mɋr=\ s՘m$IOG)<+LnPoDloWCB'ez^}@O̻ys2="(qŻb4{̃G_X{ө?π0XՁhs ?|`1g#sRg{rrLRwyjq ]o"𙑸qcNmbGdFtim8!R >h߫Asg<y tÕ @LdMB7bjQѝËt>P#d-5ܟ vw꥔&86IËRs RFJ@  1aẪP-م#[v (9v}+Px`Ǭ c3^K&^|܄gm~iVKS픈GU-Қ֚ëE$T ۴OpJ_Υ͏u4/fqX4m*'[y?Y}_𐻵yrBf), txLdL(wζ؏/$8i#NK T>טC 5twG1b @R Z t|rY=zg0c-IQv#e?l͐sFeB_1$n2$ÉvKm7mE%;J-ӱw3~>ֹ"Gym9rz%"i̛`k_| a#&wFnhCDNt\FkrmkRps ~`%VZ3;f6\mW;ǘmf!y_ﰈ44/jK$,ƚoҌ8P!X#ުr3/H]a.S]fEʓ |p11eȸF* f1lٖA\_ɘu>ŜȕJPh>H4MA"Qa)yÞ?ONω6|dfI$z3Hx<`UG|%TT$]"+i`ʛN04%S'O=qcL:8JVpE"55=a!") (32ȅ,0Hw]1%<ںn?Is&-e0,++hEE'ZiY]-o{9E`8"Zf~k<*$ )z oO%8S5n6.*>pe`{f#bk)j "!BaSM @s΀kn[Ҫ\  WdH:aFsso r!ABf _p+""~ˁae>bTw<8^SM{wǼ&0x u.u|pqSf`Ssr@G+=W~YM`(Zp&|LΓ"LƯ1( V™_Jb"g&Hyğ"^戠u=WƶCIbQh#,}Ԋ\XI̗#DFf.$SZihy?9W$#¥Rf,^;@/璾SЭI/fVWKՆ):2C/Xcn+JF͌|NPٗD0ir qt[%,S鯵&F8!7 h`cWbqy9/ٺ|'OvA"R!?n/HKQ P]qP(|:9WE% < 5A<~juEz 5]^"<)m+?(HP vP8Ѫ3#^6}ƒAG1Lb$#;jeCI;p0AoM~ Y[J 5}-/E2uc=aHmdI؛Ƚtll>ՈDuqL?,$J<}ْY޸:LM#6حDr8syw' uCZ=]LLnݺ E/$wB耇O,0@ [P|\5(ȁjc 9hb&S*Ac:Ո%'ǖr_#rOG:7C!f.A*ًi }(L*7U*aVrsz=$X}!KΚ3V6y)2Mu8c SC{z 1␉5#sJ&bx[4{ΧxXf>XY_~}_+C:đ@/QJ`ً>} @ [7EiQB9lȀZ>Կ?iLۉnźsBji{p,Id{y0fqxbvY>꺋X9&iRFY7qCJ;Ph,Qr_$n 8(zܙ+nKҧ|^S26 !G:MxN1QĢx[nc@ix_$GsOۧt_{[77}ndӷ擎[vBqhs v?1Z IcE0B4.* @('wfGݟ`km;)U(ڽo9#Yvܰ-2'(,a}\IJY7^x[|kDгeΣS  - ojg^Ah%3'J:O ^6 em85LF.hީI=IaBADL4H=|eOր.>JL!n M;̙hâ* @6U^ 0e1G`|HD^"tZ3 /PV g0y6,nj]bMy`<t86U+/G/qRɨһPn` 5s Eֲ>kXTQTHq;y kc6dIHXwJx2չpT]+WJ8EIL 4E sG5gIdV&پ2W%GrV6N9Bb.K8vā7A/I}@Va;Rszhe;)z1`zH2'`ӶÁ R77&AHfeRs9^>湌ֳ[Qp7;u=62 Ԛ)k:s|i*(3Bݛ@:s &۹[9zf;.,%DrgN`1;rb>d[76#It!YL|O1(o$fb`c\BuѴ7W6bon RT8Oo wvCfU2ϣL7r9ߤ豈~Yity~)-MI{-٘`\FϙP*B$̠*"8Rr`00StBSk$dPu8R^U%pF ܹ$Wۉx}bCa)&4o܅f8};S%-3S4ѐfs[)e6!<ɧt|$UR|۠^>H8:W`5/X%7Ap Q r5̩5jc<)C,lהϘ. s$E*3SNGTgB,Z_ (БZr.J&|n͟pbRpޔ1nr] yNK}vI}.I6ԢtOn2.[ձtb)r i+pjQگھTat,|Sof:>|о]kKs󟞥Ӈ 8&ϝ6}:Pb)8LG|\#N*5<9:u:ަNaeS>HeU>}W_;~?YU{+b[,êGOXK@&#D̅ u2#7c 9 1t= +(^%˖륣36dAŏjJyl0C@!R|&(kG7 ,l^!ij]U;;OG[jFN2]3G+N[kK禢L9Zu-3owi=ЩܲBʇZ4ą5!<<+zQٲh5;o30*DKSl9:r+G6R9hWxl@~exkN'm~?WB [n^oqPE;x3h:ol sc=Ce'כOכYzFvG;i2@MgMr6jjS6F ]dHdxܩp5gq>?E5-N8Ue*=!-vX38-9@tlћ)-Qa:XǚujAAPF;p#u`fzӥ777gO뗳~7V–{e5mjJR{pLFXrlCATC@c>oCJtϧ3f.$h[sYmvl00+Zj2N:УI :_o]2^= JnoWMDS:- ) ɦr~Ƥt%JOROyEeEbF[ 7ysvLX̡]w m"1GweaZs` b9St姀bMaxƎYL#Ul+W ubn[ަ-W(: CKf^ؕlK\=7bXU?gL q aze*i bƶ^MRXApʫIJw?$,I&;TPFRdQAWZ:34AtIH5 yZlE P:oT # i9MvNR,Rgh℞kSo\ܫIe@)j¶qY`0T{rZȸ$v2h>G[aĚ /U?AT1U`c#68^0$ٍS qofOdwl%r2q)%;Hq J &_ dOǷdKlohRXI8)Q0ZΉN3M MWt@>="Ґtzxn H{mINR r/kSz 16*.aZW =hhlc X '23  QG˨QG%8ZH%yc-+EF N Q|<։IBpwW/ ˨Z ֖] 4yAj w:*7՛7oxfA2V\!T6 +,]t5Q&&_zN]hΓ ?(*̲zR-o^qrы= x<0*!bOK]hP ţHq%4DqZJM1liMU1H Byٺ+ʲ)0q݌@Bwwa0)pt|k8JFhn89%gW{ gՈ^3 ka ˊ>'I^Z$Ԝe8V)pر &ﱈ1eg鳽oDo]jRڰeOr"r>݂aF K3~i'm'ga~i5l,pnBtFb8/mEb)Sw\N ޘ?M5MbŖK뷸u ~ ,t՜ L3{hMc>Yͯ;iȵ"#r?5.m.(ȳud#`6.el[gŊS6\Mq%iF*A5ϲμHë|<8bnm Ow%F?T:"X0qdPbe2M>8|yUtʳ{;|qPuャz;K[S`f͹PV þq^ZZEI\y#gT`h|mˢJ}4^׬8]$ n6/E$IC9h6^xbl=8ܔFɃx͟oE)RN0J4'#fW9kpN:9\:=ŎkL0pw_Kss;&OO^yEY\Tod3ϾgXvu6\t4g|vtzY夈;+2z_sbo& EAK[K9'P.)(oaQ' Է[I7m-wRtgfy|&1c[Y Ku*SL108Rٻ*La$yoڞÏ0Ȥ~/&+FU\iz?~&mM=ezAM A$FMx'p*^1H)ir 1F4(\(Ƽ?(&^#R2 (nGdOIg]*!rU-rp>)i/;irh%"e_ 6"_YB^Os%Edu(RH Judg;-14JZBD|l8TȜ6Vf3d Q]3xݐ g_dm>VξMQiZdPϼb4`}F8cIw}s* %lkq%u)3{x{yO־3(L Ȍ!`ɑv Bz,'1~-5 mZ87%G[T^T'n"m8UB@l$m>j:0=f{ǯ= ҋb%%auH2wݸaDClet~L5m446? hKDw LZg?hQdǑ muK uQ-s%*oQ.+J8h!i>dإ>P\#X s8GP1$̐3DO:=R=-=P{GmjC /]T,s"!({j,{eJp#+2WDKg{il"^5u8 l#Ŵ/6|d t.nVv4U#$,;흻ŷݵAdz\\\(cSJdf6sqb7xD++p>+G:I0l,okq}q:c꒱LZCG dC^D6B,PDB%R fǢѣTU| p PZE+ :́$+j"˫*e ]9#QKrN@oR 鎠ϝ Q8yu'O1nׇ'߽$G{/N|'WGˣg6jxy<;|~x`O^bPY#GϽo<=<>%{G81O^B8P%z/N:P|``@;na\ E#N66HXr}|X 1W.\@ml`rc)+=C=$-b95?,ÇɋW[7^ _*j"*txVy6D FGXagWzSWp֨x w|ܯr²-1ͶWWv2N ƞMD%"/ Q[/2 DocgS1^)$pЋ@~ %[îf Ƞ4YLFB;{K\y}_#ѾWm`P4a:(]{O}/t.Q8IxgZ \Yll8+15Vm|߶e5| LG`v]}[e]ԏdv&@li?}_)cu`roC?˯cHt\q$ϳ4NT枎L|RBepޖ=paP{F"tr1&}@tdYˑSY`]nVڃ'/1\n;\ mI7+ШfNhqҢǽ 7{I^&?)X<321w*8)2"UcKa$4@9E*doe8 kDt;;Lb{4-IKωݐ#NBOOpi,`a9uC&7xn s}Zu-oVpLn8x6.t&k%KsN$9y+e$J$_.K6WV^v/W~G$޺0#ͽA\7OťJc,db=9q~?@rCJ=N%ˢ5Xj":]>YL+iz (FC0am(($äDT R8|7#% %M2!$g[`Fl@m!&oh*eEſo,fP&K}q,Jr;D{YK $-')_%:F̋qi,PapqΆ-wR[JŔ ! vjsP'(:wx1[3/ɥs*d(W#sy'9%}1(ĕpsO:E`u9~JBx1j"oQ*5F\YL!2ǭc$ҵ(K7cۻ ` ;1"_ml׉/ //VM$un|E<%=φ) |W(:R[PmLܧǙ `<ˊBJЎ; $?! F"nbc\Źv$ 1* 7uj'@r"In( ^p8&"BiaTxt̷e?Qz$99 XH`E87NX!)z`N.?h|ꦶaV  GN.e Lg3tL Ҳ˔l12ђ]o$w҂d7\#0Űw}n|o4=dQgz4ڪ1:b\0M0v!g8 *6ˁ, 8^tiR EAA< r\0jq+6bwZ[g{t/et\\V^/wr_W(=I-/üH –WQhZFF*2L;r|dRX 1ٖQuR V\=,cpУtuIzpuj;D(J&q#UfC#oeqjJ}GΕRxMυ2җA'H&6 p ]Y9a$Xɤͅ& %>]LAN~Tʚ9'iŧȈez6̌?1Sg!̪㲵jRIct[3x'n>6H"7+/?ņ/(A*,TH@`+ hZ<7pӴpdXE{!WWCf^sǓY䀔^TܧaG I DGY!C{^旝K t(fE Ngבm&?#du(iQxr؄֝-* ~Q,Ud,׵heg RJ0S Ղ-C9;(2X-˦n[!)](a/}=`p5;-@ "S(XD:|إܡX1϶2d S1\(6(X"- >("֟<n2&F/iF˴%qamNmlIsǻtT4ֳH;w|=Js 'AzG7O̕v7Im)z*kƓrFXb<?HPx>en0fvT!%7zhvP䛢 H@.aOx|6...`dk=)%Tn"hV8(i9ǤN҇=c(iQCS= .{3N^Jq6 $Ki1W6/#E#+'%t9uE;7rfy*( 4p2Am?͹=vq B&sfkQ ^RzPhGM?5qhjP {xruEsHju}`<н ?- P^A0YqBPTڛSnD%ˤ^ee-VQBd(6>!juuUxqrSOnǁ/(lKpHCvxY^ALR.1Մfe&냷->g/(Lf5/μޜUfˠu!Mb\a)cah *LI|ӳ^pR\i/Zx*02#5$J YcfsWI횽7BSJo#qNN5b#a+;76K 9<+!Džs.e~={N]hG]C\Fű%&8bjq7$8޺{~VIx{yt&'Xi|nU:N^풄AMOr_[0Ԃo]Q8T&Ilʅ7)YyVԩeGO)S'>q@q:9ɻ4;OMi?,ӨF4g .k u eYeQmj& -t&Id1`PPN==|`LzF ytYOOdlK6'ˎ|QGK'H.EYI B|NqkFkJu>1OW6'㩣xM8,r ǯ ?IJ;:J$lyC.́1$1>J&/.S vhq&{h̨W(G](?@SªӍvi2έ3k<q 1E̥ީ)?vД%>k{T=|V:z^ pFE_"\Yn6*}LW |DC:SKs)^5GU$sqI5DA 7Gc EԦ 5dl>EzeJ#5ݍk819Dۡ R@](=gٴeNi͇L *H7_CeB͆X1}/ .&u(GOl#f::ȼӃ5$՗-aA "+jkb #y5,If~5~ql#v~ӷ t>pŹ(caLsifQčDZ91-ca%%6 AB3,*w]Q;X५^[ .NRV @Iv9%tiߘk$@ KHzMx{u%OJ~U?h3c2- \< Qq-J& :gsb3 Дf8(qHԠكoN5) HvHzUq"_)Ħ cgz٧D/ ߌA'TGΩ.mHa=Xq7\A?ȑ!ŀg\GF+]nN.M/qQ۰7D;_ӖΌ5(9;!1h,.1ppUXOm:F f~=<YV0:D[-?Qƻp7? Ïq5~7Qwb΍u[e#щmsՙmsfxf[Xy3#'K;"6s0U#I+ht1?~GIqPY 0~mpKh9˶ x"]DqWP֏Qq`9_+;"$niZ [P6hE/TdA2+Q:f˥i٦G1 Q+7M'KRqU$3:aȨ4[lgk9:vۖ#g/L?רQXM1L!pr;i6 s&{Onw*+ B)N IF2D'= kN(y3}S}* ?-{6X)4VfG/ݮCsմEc]Rm@VUXV4[c"PV{qVtZJs28c0=&SjzY6hc'۶V'd@`XYR2M8* BzrSjAaenrJ_ "1z Drޘ -m U k%sFڴՇLt3= 5TRĢ1JY]Y=_kFCIL7i^Is7.nr^^p,?F t{.ꈳكdj7!kh1Eehֆq)aDl-GLtK<}UFԼô cVsm$|N|ူAh) cr^KLRk6M1$FN INje2l&t~azhRmyb"ҿRt܂xD1 %sb7X&j_aGh"kKI9-@CHILA`60֕`)ʮæ? tKek ͷLh?FAD^l<9O]+ a\Yq6SUă706 (:"1 o`vz4EIl+L )QȎs2OPK :BDnkrAH7-d;f3kz($uXGjS;Ȟ%RB\ˢ<.ǵr&YCZ HC9o8S7! DQΟm*qJ^Pxl,:2؟(&~qIUjܰ}UAG|S갊٘=Is+027M8<%r" *¦ـ+7ZdfP9eWj7E0m ($ [E]eD&Ęza&xl״QYZb?-(oTx!aUȮ[. 1ne:{媺ḘƱu?lkl ZcW"aU^p<@rԹ` }C̣#dW\ >Lȟ(e'tI)/]C8h}x*fN#r4mP u8K(t!ªr* )d!gN0; YIS7 =6tE#B}Γ|,ӈ]kC lꇉNp&rqx;6l6.zHoÐ g{pDwj[`y V;3K/w@A0Ol1bʞQ؅R;u3Wc{?'xt.fӜME@gP&e6'<J]6F1/MoŞF@; A,cG]0#)\p\Xf !^it_>oyp۽3!4!Os 5 $A|x"F#!š#)Lh}pDuzDΖbO(p&GD8T'\`:"([=kNw̄ X(&(a3  d3-|/S\bd R&ƺo .70)-4P,;%vZ}G_߿ >N 9V՝ׂͯ /qq'N:df>}"Da]nl wvOr I"+Y6Kx-q$;ìpE"P#I2DN-1S|f"ve1aWtg/38@]ӧ:3q:Ƥ ~ǂz}?;bU tƬ[bWhL$ ]~|.[M~qvnM]|*0^r30.8^LFY^ )h X;樫X¹1,,[z:!:fpxO[)P>~+I_"dG75mnp=b#4kXb>φhF{)ǰ{#kf 6rkuHE R,h28]N(iàSOhCnw!:"2Ձ] HO9jb͂6hS&nhU838ne!v,"p?k:f?Ր Rnl8^āW{z?!oOIMՑdjtM#tZLs= E&YVp|zHfG^2i'^DXMJ#Z.ʖ0$N2Ad a)ihdߠN/'LL&+Ů ߋ=b{ǿ؃;<~S^Y^-Phf~czs2ҀK2:..Bc`OHe'9ԒAs})[DD²s:An[̤ jq3Utjj>,WA.W_pM1t?c^y;)\C_:jlK3"`'[34ARԶpTosrFcU~ xU@QIQ.fHł\\eN9s?)JP ]A:&/K5TlD)m0T p3 KdunOǚ~`*X h?>^w.(9| 6T/Uxp哃NY>&m >@cOKnrcKv*ml<7x gE.`RaŐ\wdx##])qSd1cln&OJqiM(.5Yv` S)A(4N 5`B7AƧv$^[$QԽ#KcL)V*dHYHIc+(J{m+j @5e3x'Dn9FL>Î)AR=O;} Vךm ڐnLX6CO5o@{;@; `s/ܬ`0հxt`uJ,ɽ.+GrSֺbT$b{ip#|*TC~^ko}YSy l#* w[`9,QqyEGX:G~". )4iA6* Pz9YZ ̙8xJ$0[Pѫzm*'.bF@g(oJ7 )Nq_gta>8Dtl|/TnŽM%$|[rWL<`0kG%8`fs.^/Nh |p (5)x4y lKOGB(t ăA:W;nΏήQdVnahLtqH:STÁTaJGm^l11 wEyGٕA@ܡIO>4I|Iԙ&|Qqb~yȈ9SMji|,XrN!9ˡp{NL QgU .2tBHX* jĞջ>4ΦN[^p8 wPwf -p:N:go|1$jV.LbXAtžs,ʡI:o5.'@ncRרH(i#2TUJr_ٓ_ JjnoðNV˹h gl+{_5R^fｹ1S+l9KĉjUs 0@eJd)n;"p@Əibi G 6vl}|Q8oI~d6 D[I5ql}8c=bw&+Z܊(-&yΌ<=*űLJlķ^W0UiV[:e\h{Ea(PeSDF;5Y_y}r&J Qp-XBZ(H5ܞ]?ӍAf7TՃ#ke%1yfV]&D\A[J5 ҨBܹd}+-?j4l{9ucL5ơmɇ3hhI1sVnQ=( }I%J+*! Tp,d OU2$O/twH}`syfyF#;#y;x4 [L;bbK¤{T\ 휮rzvd#p P;s2+cpU̽0#ۈ*_O" ?t4 f?ċ, xnw+Iźw\;=~XyP .و,PbUi{ ]0=ɫ[7ҳ |1fʘOJ ^=~Ɉ ;NǏ×-1__5Tpn"d@O-M?/m`^r{xT3,>b+yUrZXz`0BC`;f$a r,qz {A ͋ DL" <+gDްTlF4z9j]rO{h56B\k1k$Y.ٴ2Yw p% h^'C֫bi-heۙ^2,/g:,Q fFw"18MXB s˱6L%DdyM} E>cX,ux՝o1pLٗX5Vn&Vs[ԀUĎJ'߈g"h&!":09Ht:wY {c1(A^)t3GQ~0J$ג6mˆ,2KrJ:Y]gvskĆXԶS0 )jASCJH`MҕxpU_K)59 Q>UYHɕnʦ6{t (i+yQaEП4C}BCh nL_ 2_'iVAVy< !=aR2MpO nW=F/n&hNB$@ Y5pgc@_x;z"RC2y0حo$-CQ`7MǗM:D+*De;#cG;P=|]:I/_;HrMk玩scvd/9쬫7WɩRdi637EMaAQJʉȞ=whiv ?@O^ 1)Z5s<0F\3mBB<֜{L~23#B!酑 [`qq&>ʵlj1ўR~M{&k%'LAbY@kceFfi0,I1+IErQD5axZaDuqhdӰ6p7QA,E,=JHsb RO{6v6N#H[ESբ`Z:UOcRuhDp5 aG&HZ4c1q=iP6iqK-]i .E<O-kX bVW= LcT״Ѩ"zYU]Ͱ8]z/BW%( e)dEj.0|@U kJFEeŤaMy>w CЙz r0" 9p'?u !^WFLe0 I srV:M7 `$#_2D76eH$&ZH rxc/sΟܤ(6ɔM޵Si H617}sbq9ύ7(s;iR28$h{B%Rl($T`ca.\3ՌL^,!} f{Ԡh5YQQpS#k q$@fR|ƢG}ӰU(rMt5)goDs Y pj-׃ijw\? WZ )ð2\2mթ_}͢DϊL F1[ZoۄYR۔ ]e.WY?$֖eu(⦩߲HlVpS6pL%V˒K)Js|K xWnd,{KZCKNGv:=z>,E. !''oAϜ9A2}2 ,V_{ ͹n&}:.REtth5΀W~]D&38 UgHJeFV@aȂo V(#qկSvj{?V +D |@KK=O#e5:3 0EzXEB2S !QSAT\(X rڞ4 } k5G'a}&aW 0x-ˀŜb0۝$Dµ*HYǿ#< eRldCHe`!S5Oknb Mqm\(OF N#ݫu#l<6R{?. ZU֪\6}R%%6"L?3>g<IrѺa!n(Rd_oس:K*e:zod R5\Ma[h)^ '* ^CjyF49 KMmHX .@B¿/8@ ݳ(j;/SUQlb8 qz؂+4tDSPgbI t T e{!v 2Q? ju 펜0&] ;211R;[ {n2Wcp'6{w_ݰy(cΙMz%z7G1Z8]ٮ<߭‡X$ 835(;|}q7(gb ǖ+I@^`ZF-DA:EcwhY7KƒW;˾(19޼H P GN!~d&S5fv1yA;3MSIJh. # .ĻN5ĕ q ӊv bfE#l_{EQ<]O{[V%z-!|`"9\ I[2$ ӷr:V8_C`AQrg3pVEn#d!Y=A&~9gz?㪰YBu+qLٰAlbwV#Cm3pQ;V҈&pqEvٜ:g#6EՔrM0 %6- Y·(U%x^S{_kuW1AW Q@J-r-B>֚ YS{EjVNNW>L̛J]k  6#9)CSCY{eS !`R7wcynm1*C7 <Cp8!;?)J~iPpfـTI&7JV3.{ul .9#v6n1'y˘dH_lph603{l\aG׉5䓒qKNB4N@$CGfs1fG;3)6`Cp}/r+Qk\,65nhNN~\/Lz>Gq^F "G^|\(H[G9[2(Vc +g}twKoߨ^pV$Pb! ;ŭSM̞ h4<䩇𢼈Kp-]؊yc6fS>ȝ g;ێcC-JP]8Z1;EF%펽f&oz) #{^9/T'bYn&U&&XIĎfڞhctuq&b}󘘰rTca06 lF8:cHR lgW<I,I`C-”  qz}>J{3s00G٤𚤼*VM?& QTT:D||K;ЏJngCb0D|Q 'i3a4 GhgH5w ͡/HoonbJR&LOA#4a /ЕlS?}HCeQ ]oÏK36z4S ]Z,MSHtP т-187z^æ0/![?"2dy38F,`=.Ojtb'id~H9?revpnMF|;[v5$zV9j !2O?nX~IǡM= k^@9juFHʗNl?x?FP;Z8^LeL<3^SLݢZi}!to~}}>gza)}~l!$x*%?MTH15TXer@aZiaFckE5glqb|I= d1j̑H,1/%@M a7͌:ܣEZVrU'?vB>*4jxa;p.|XێJP:` ɈUd%i {Yl2?F/b-fa$S;̝J:+DӹT~^h*T[ԩ% m@l>څl5uC[K(RpEJ{,犫oF;:44/[.UFmm<|SX|1"bZqЫxarG]# + ֎Wђ<_֧=8|g)j0Em'@lK"3s6 MI^'e{ MII֊=sbr1z:!8SG9Vb=ǰDWc1,1.XYF%ѹ@3J8H~t(߷V @l!Ӳ[ ơe>sZ7+≰_&1>&JK.VF`fu[fp@9]ʮ|Pj N*s ߿QN<sSOTbU49[@a[1t鍵;ÚؘQ-aXo8"bM&s80-BgsTciHS3Y*dҚ ]N r(Gu(6 {&ӡ$%llBۀ܉uC ~1KB^^%nn4bp5- lਯ_n68-+\2> Sʑhz-يWHJsqMܹz1+6F".u\t^٢s<4s :]S3d 6(GRp 7y ``t0+zzM#9.I2ε>-.ItI"{sTcTj8%utdM3R@PAJ]NגD~LDZu̠tN8SEi07 UҶWa$!G?MoWkSDy(@?̫eH $=+RRzi+$6")$фYD[ b(E&F a;*?i{GO!w`x S֔LyMm?jii^Ő{ŘKʝa+!T;WFdjYfc'?RcnXS7vY1"E󧔤N˟JY3& fKl׺ 84]fFJ` kr@uD۴ c,'hVVX9 3fm4Igf}8m:Z2Ba5 -iagيn' I'qZ0^+XXnn$T/%8훡9OLM^*[>$c{GK{((LgVdؒݾ'^;R_bi}~M1OЯ +ﶡ/j-4XS~pli0-L(ox>&oVM>W5Y\-M&Csk@ :_dzJq: tf2ZCV9„c] ?rqKZen]J+lIyE ƼHO/'$rF`2sлI ӉfŘ cWJ1yJII +SMm׍K f#L-zs S_\՘fdYP1&'^E@2>Ό6GSVx\5;amd6شlZ 7h>Zۊ !yHܼ ^}P 2{u:,ѩ%K@{2 cYD=BjyؒBbN6m Ć[勇n]d?ӝ@{ҪGy֣Ü̊DVjq9v6m@'; \ARIݞ"G(#FUuz 0.GtfS܅zrCQ 2uu>iR`qҋ b~g^'Kaμ&,P9GIō\͇(ٿ#opy; s0Y溁 1弌a k `-jNep'h桊BiccnB0Y3qRry'[0~5+5qsq_Ա]軝XL"/חtfaIyvRFIgQ@db5׉Pho?j|EOҋY.C*ɫ9]i"ŒQ>D:J˓T\ЁH0$5BBAF0k8NZlx*w$~9}k<{IK܏yq%zr-Kjכ^k*]i+\ejfZH&W*,?>wADRb9co_ABdpbB?(!P=}+NCR!ygM'z$kw54C%}^"-xT:9qKKĨ,2@x'}5o3db~2gNژ:"A. _#}BpPԸyqP5;~S6L1͕$v]|-h\4cN\:iMy q*$%)/hIjYFAB6}Z3Q\ThwZes/C E+~cXw9JY ZmCB+ifD[N QU 8_OE!2{`$}8Q>? RUgwzb:k#Y㸵Y)mnK/.oF|l\{f!>8o\\DĬw0,$0dJ5< ʽ5^n aNqv쩃h8@Tk#jbwqT& f%-Zbٰ6|eAYrE4F5wM i%ear-q{xafVwui'uY>#YCeƞL\t˩W]".;,( J5G\t5 MRB[\Xk]FDXcՁ#?[ eIl^T%-XD6RS. ^Qw$KUH엮Ɉ: ?,l8씼XcMΧS` س͠<>Qȭȴ b")|5@/W tw"F a1b廉aA8@k#I .P#(nΙzճPAI]n PֿZ87d =!FÍ&tK|<$xm!TYFuZ~ʑdF<#ʥ}qXn\ mE=4]L%1 I'v]uJuEbSev6Axt5l`XN\Xҵ@1Z* wj >yC$chl2RlqLjJ! a|S4 AoaLk)1ɭ̪Uyv7+_ڧ WNrJ7e Ӟ/AsLGt0/GXoݠ7q@hVw"˼hd,~,<fuV{ J_C6'mlDŽ@#yvvULۏlcsks󛯾ַ<_?ſ'"On~䫧[Pۭo&$#\,'bA}8q4r2x/of@u}m=A6/fIgM:'SdF&X뼪 @_)0@\)^!Ӑ@VP8pQ蒇y7$glQ1_}./|:hY4NK a#uqW-tl:i4,`^rM1; n:?+PFyem!0TnKZ'K~<8i%wON'?C?^$GW/OGɋ`?~Ͻ!B}`wWǧ^=N^>~ut](GϏ}Lrx~$'?xA#} c8>>;z?&?ۇaw^~b;9ybe/}>;8TLzZ܅ ̳cxЃ?GN,8"0Pp_}۟qq0,)o=M=&$^7M;'>0Vu{-=|xߓo;%xnF3 |yz>Ftv;IhKT-_ kC`] GR;F2%bvFGT 66uK[(|o~$-2N[p ] sb.dO/KR~5¢:U/9y/^9?_[Lb ?OG '_ηo`__>)7Bh6ٗÍIŒ_ b|xi[1so"kK>|ma>^-5K:f9r%BpוkG^[.`s*6f$M9rc1ʆeZ f#~94[[.)^T樺W22enjv; u:34%VDΊC*/; Ofd;.IZbrIeK' k\ӷ[m^v3۸ "$,ԓS^sx#ʪh^J^B}aI||q_ᘣ :ʉϦ侩YIpl⃋iYv$7Bm|//R@;4xs+cS #Mwfdɷ>"s3r)7ע;^p\']xP[3=prV+VXUo%4,iZNy͋h!p&5>}Tט.N%QyַBSEL)度?߻4.nNP8ڡ޽Ls adSH.Drtk0p"n R吣0´Vg4)wʙ+_FFi n q4C %pbR[Eu87R2BewdAs ah~ˆ^w <+q[sAB6 ZJVcw$25=dllPHY3]b7j>-Iz"0Rn[b9;L/( S`g7`%Gd( Fbϳ2ʰTq$鹮|"+Zc0x?;L"|}3rqW-nÕ+4w42M4NLi$l&|~ϑP^~:GTIA8'9DcjsPaMGPch̅\_6ݬ|O37}!/Z\lʜWv r*z2ì߅x~ /vTXشv9&0y6K_+!YI1(tR6H~a0?kج+o,4+P"Vy ܎s9:*kv2^ThG#Мã  j0CLeoVꁍL) ap@DEZ3ZM5t6.2Qޏ! k3"[I{<LFKam[)1{6 ]^*su˙'-ܜUF3P]9rzJOX޴(z~`NEÀ-ۙ6%3xñ T(-<ܥЍ =$A9`5BdChH$ |(`eYP!"PM>,@7< K G tFR33&%&O\3s+Pʌ`?MA.ok`?%L|t]3mlęM:?ync\qq&)UŜM J{gF-ºaeS4zg<1ppJ'hr7{2SJW%‹EhAF(3V7k5X[=n[`G]2uI7EHKoOOa4]upy86⩛FF/ZO~'LHeW,ClӶ2OPeP@z=5#C[W(9gt>!Q)1̤`N᝭x)#EZazUJlGME5lZ"` [zw; pb%KR+Q}@x'2[l|+ Egz$EGhnl;sQgOCjI<,qյD1-ͪ&׆9“y5O2t7YUfU-vGrEk`dQzZDx>@AHq]%tv[ǭkD|XC$)]qիt{3Ϋt&bcXBIm0ډÑVDH޹a|юy}c!(*9L5gd$͘ݭ\zr'1V3qS@NmqӬ[ǝ λU cp;E1{B,ޝ]l0-O&J2 N:~&s 3q!05٬rԭ,"&ٍ I۳,tOKR(sl`c+bAB@β`* AbU@m6IkI5v17]-A!]y)mvZ0 \0 }E}4 MXZCy'C/FS/݋!Uީp!BV8DRM}r: W@"+_ʟO؎v)5 {<鳂@w/櫭olmn"Wzm wf9ئ :y}ne}+xK:bXC=cj\CXu^D1#p&ʛLIp,9kk^)\h}zG5?TPhv}( %qW݈KaS (Gׂ|]3G Eӱ6_b>6cﯩ48y>+љddJ>8h.#\jwJ/!\FogL 86[s4 r VS9p"k4kit eI#NE#F  -5:\19Uv&]bet%ݥ@&.fNlw0$thܵqgr@gƏ`Kq -" T"N5xȸE__C9SGnOc3 a3hgN :R 8VgR$4ҕ%y)B]p1g ,φA*/,z 8u)΃`Xv9{xZMiQ2rE@L.m]H|l'g .5x/g<.N\M5\xl|llM!FKM|4& hA^BɊwcT]𘙪Y/VGqΝ${ 3 ^7?8qrKKtNf(nMKpVZA1 Ӆv (b^r xyyFnm9ƂKϧ SUyq1<\e֬@AFɬ秪,Рuh0إM921ÄScx==>IIq6 @;8# zb[quKE1W7oID2m^D[F'CJDI\nLOuڽW(N zþ̉$/y/aօ6.rV<ۛ2^4`ŌqdAVos#|s@u5E zvSt|Bc m㽞Kp) W n5lesL^e#O7}rl L߉FKC=k;ߴN8Uz\ؙcMQe Pt !S4 kYxǰrj'Ä㱡>eǫXEDiUrkDXh"w8UzY"JwD)&F0Pu>P.oC QQ;oƸOt36z+a:რck<#Q9Z9K0J&X|6 ZkQ:Ck+N796bRwSu<}bjR2%NO~Lɹԍn mDہ`) N%'{?^Qmr9.Ρ ~ڲ. c}*C|w+lDq+d@FwA Ah ϒh5xXTDz<(ApO纒xl)aBHa2w 2rilNQlqYAXlƼFZSEyKËBcX"΃kX'yy\) Aoƍobة@.ta7;EE_n$~z8Ihd\o^2M,uphag}u Gyi`n^ zszKeԑzdYB_"`:D'˼6?PE7FUE =LveޘT1hƼCwib}1.-0֒9-3vlA1 XV:Œ(q mƎJ!b|f8@ 8A~#j0}lv=U^eѽg|4 09 tqXa\p.B.t>  *aNOj\{Oad_ Ba7Rlrc(F_<涗L)i# H 5׏&OL'ovv0|G~!7E]z%"5Zn]qQ`Xk(CCd,í[6z\V%8o )KXP@.DOlnV(aHV/:]Y#5f|#;pQ:I\. ,DUDBTJXG%F$8%B=ߎD-WNM@ B~ҿ!L:d#x{2v,Ȉq6f~]ZPU&2{Mu41 1jot?m[r16W@Qۤ2o|P-U(f3v^yV>&d@$Չi}2Cr|h\a3_MHXtVYI50DRwIK2zn<+'0Bx2,M+#nW"5ڶikr{דQ1iXrˁp6 7#$r{R|.!ȘH 4sh7NPlARD@^P`Sm}Nbw)6@ӝFHmFLI#XӠ:/Fk3dJ\%1T* '*&{t!&8QZN6x`!cU vY s(jccch9TpFwJdq:D6$#$ y*]h(W)g }uETIietֿObmwIl~ <i8v8B#@DƢㆶ#jsJgm^OYBBc&܅##f+${i=ɴ fG^)*ٜȁQu|9B1B9ݥ)Q0xqɭ|u6H+GЋV#p5RP׷}x1@ǂq N 10yāg|E)Őd5#FiNjdOYgc[1]:D Z6'0wѪKlF^ Ѫ_߆n MmȡpsAVhA`Ӹ7fສ6\x=r񖋱luΦ'lnPgiV!!-px<2jʓaOxWh(aYO~D^oGL&V ɅU3ؤAUfnbqB!`c r؄dKR]05p9vqULN]0彐ȱ oGNJqZҰM)i~noyEM w8FdGQ];*u _ >.o>8:$*J9X}ՂSku>⦇eԜri4gzk|3iWGt$%^7M>'!xYN }u)ZiBi*=Bp M/FK9bZoq JۚAҩE2{'O/YkYs{ĸQU((ro QBRSfSfphOvQ7&J!W[Oa"ɜi ` یu'{w͕3vZ$)/ˀGt &ѳ'UV:U:P-ɍ^MY`6q-^~bf_LBml*%'3+P\)Yp\~ &mun=0܋(َ%*Xdo0

Fҍ:D٦2Ge֜MH kl8sXM_\{o5i$ gfed = EF(x8 Ar"(^@Pnp nOA]óAɣk~55EIwmDe(SPPf?+ W;0fNH{KďBI%6"QGZdP! e17e>:_&y'/J`j{H}VEMq}d:bnwQ-l -\&ji8i^O>N6Kv~cuY(J;ЫDW!]8Fn?҅j̐rr @ )REN"u;H2 V|,¡A;0b/*ȽU+gk\WAf4;..l W;Kt2Hȁp@$MEm;zrxB,!Ooȋ{`< HrI1:W4 &{ݗC a X PLL2vJG(eb BWddTK'68'h=t)|#Fts`Vp$ &59JAV1;0?;ngm<, E1ܝ":LTPOۼa1KHZ,x i|k|I}GZI"P ]"#Xx'XD6]'ơT;Q?+uB0n_Mp3®1&)Ǣ_Ok'Iv6tnOpѴW! / @m;)H`M&/t%C]m1v-0@]^nh$m/ރvAфzOz8q%?/%:,NL;yX)q gsڠ{q)[VG]f4B)7p6$3/a!$he#\}@p:vMxH_;YY)w)s٨9(P[i6Ys6֎p/rǦf\M9G[EbBTR_L|gBۘ\7C 3}5kE3=ζ՛ x)&* wB♺JŢ(&d譧1x v#RiJkdм1T2_fxS'/mRƙõlMo02zt[ݛ ޻>`FIZ^d#1]QĢ8eו]X'3p@x28==<&)FfY5M {GH :og쨨FB`&\Qb@2Gc8Nἤ{:&.#̊lR>o3zׅ&H"ڤ: Jw}_AY,Jγo @J`XK])8+Zj8 wHLT>k-'cSvqL~ [pJ`:kD4HIoD.[9a>=6pV 0e(ZCs_\NIʌ_U!,Ľ,!}^?vj, M9=[(.6p}6HVZ7w$bb,5FPpk_? a\D]ς_Փo!}4Sͭo6M'i}x%믱u?JNtQWTP+oKfg6TSnWB|Ǝ'52]&bSQ1[V'v8&yY_U(,sem׹b8J=n3t~TU r=4q<1#:k%p@83,jJ&3 4[aTQ0!$E'SLĊAZ@Tf354;`Ra&Ny=EWU4 3\f0p3 )h s'~ON{$|vOw ^&PӟPO{d'Ҍ%GW/OGɋ`?~Ͻ!B}`wWǧ^=N^>~ut](GϏ}h%/^w_ώ^||G/w؝߽N=xKv_~O1>=wg1>&OAF{|j*xpKvNpbA8P@}߯Omw_t)q" \@7]VO~L G8wE1> 5O`ɵ9O~5W ӿ\U:|^f~a_|v5O~xT11 zBVbBNAS" XM3ji i?bF尡E'/{\$R(,tX[p r13k<$7O1#_"(l;F1zl1c{y5dġz\:.1b,얕;7*V"ߔ m}s-6h.qQhD`>/Ƴ'2!lS((08*  FǗ? hvL+ m8jЀu'mLQ[*2⒍@NMFٱTnSCgߩׂvzF-]5E$DءM:pܫFG:fًi:9j>SL?hjq)/R@W?:@OnN1Nn"b%mB4-@26 Վi3]*zs~) .zP[Йz{c4m;e;hڧ2pL:lZfCт5~H;bgI- ;ϐ7i M*!^i3`&?x0֞.~\$͛ aPojsZ e2462 j _ۡ} יHձ Nd\̈́tt44l'ާ83,?C'\hx %=\nM- lBNm0$e9o4Nnƃ 9R$KrNUM!d%d셛NG$LՋ1 G|8[iDirgMD jx߃ i9`j#5nKu3n<ΑRxcttbԈU t"ҤO{|7;SvKtO!fͤdՇ},+ꮓf5a0> :AZVt$fs|/Ҟh΄@}yyykϏYsD탽^ v::+m/؉d(~B\Oƅ|[ٷ%bA~h>O-ѓPbp\Tm[98t+p8Z7 `9E8{Ji=~fv*"vCPV2$T+ZVӸw~jfȧ>!l@pCζJ~Gcn{HP":i_dfo0SQ6<Ylϧ'|q/j<+Q—p6Oڙ θKJMF܊a?m'~bͯz3'?_`ӷ d $ 섰ؚwP <{LN#][{MK2 Dvm7:<hŏ7/0,&!B`ufqȽѽѽѽѿw%j{4;m )/ HBq7fԳ"[2ў @cIH.ԧ[%}6P'MDƕNo [㹈Sęٚk@q'0;!ZB+ze 2z̀wR)@GmE!uS = |yz~H|ܧ8}IOikDUgȾ(X(S:/"/^(Iw[iT): F۶@hvcEp8EL;l+厳^/ ϔš~E i\H!a&;hՂ•,r+`i$wIZҩ;$|D~w=|}l{D%pAe|W͡Z`2'CezQQV @fj[2i5yLX (K$j:賽"l͂ >k~ow 3DSL<8{xF|yIQWۢ^8 : Z͋4J`v+s!:"E]J /q#H%ɣ_lLFSF;z|Db KeiҴ{iڽ4_DSJ``۬6͔tS:ēlq 71eie E xB]Cɽ /HӰ 2p+}/"Qvkfy\կGb1 '90:` k]+63\fjbvCS?GU>죪?ǵ[Q;%:6=L1QKIvv;#8,{mQ:ʍmKbƦ#TOV lvEgG0>$,ЂQhrnSqK OkWD^4![yo\ P5ucN96D|QDIwVݹ "WcyzBiw׿bF܂3|ˁtiKT!NbbhO9pX򌎭+;jꍥ>YgUDĻ@F@T^ctPuTVWJ~"f_꿱MNJcPF8@0.Xw׮Dre^wCE6 n=^%>M?o?F(n-E b0ћla۪=&GG9pٚOYT$'Q 9~kkgR UVYJ:nU!aj/$ K\Fy~σWCiǩCnG SbnS'Wo|WL.h[ !Kn;^c+&ڒB"&[ ⟴J+ŠFtݶL8-~GHD$9 1*N "|HJv)]x/@d0& I܂.9!;/ı"B ~>ohW1V*OV4i i%zeJ$5BIJIԒ<xV<~P%dG>Rm1/E2Y*]}/_m=˷/iDŽ?^k,vAgnHCQ]dCU pwAXֱU)Ntۿ<6, q^gjS]J,^t/p8 eNa&ڑwy͝ "AP>gޛsa9,$Y2 + ha?Ig٬O=>_[cN~*~ΆNqQ}M>7iZ5p -3 kn4/*8ƾwCkE#l*?χɻ0~$7x:4(Asa]CKL1[y? M8)џ<e$tٳ4iJ˅f6 Iq^#Go\ 0Zzǣ 'eM6¦@n ҍn͍x6. L)8Y:~|s/ZRmm?zGhҵ^il|;ۖ/%d;_FֳȐ*nfc9$}ů,8` o_SyWQ{'I{3#DO܉Fb:fؚV{~S ~>sޟ;SٯKLe;?gIwаs'o ׯ)mۭy8[4>r>ߢX2o3oE>_\^mӀ4= xO~Pnc2>?F2W|E^O~=Yh?ig,|ӯ)OO_;:y'I{ _R~ 8a\uBk8ڐ';aG/׮"^[t (;((BI+]듯NbiW3* ؤݮAa[k6R*29o7C_Ss\k৤"ׇ?l6w{,' @@ IsJ3zֲ]:)@9$N|1үozk`:54FTGm~ 9pf:ĠS =Iڿ6~9i~^+EcK=.ѿ]3s RͰ g(l #.Qm V q]zXr913'2 vo0; Si7[AW.;:gN%govlYĿyv)S-B.?4 lfĢ]Y {dl-6՗D[ܢu1HG]-(?#c-nVHzpxM%;8f*T^;x'@^!s/:^rI5NO8̕чJp)YFqJaeÏ`c&<زarGE= +J"|Kx lEFHc,F~E >e3Q u`/fz~;uC8O]Oq,{CL y~oudЙ/~ އZKO<<'~#.ջfG铎t6r҅>DNaiN}{}^arފb1 ߆4zJ]MtW3-!<g`Dq[yq'ө}SܤLTjwςɈF:F)NCa%1(xNK hGnrM]{}>6Tu=sOH1-I&(?VX'0f@P(K262) G-Y]\Üg69zg8woDgJ4&}B%gIFh!8+ Y?KnPR :h+dߛ̥C+aE/^ SXOR;ݴη{&S25 _F)xLFJh $xcJLHOz>WU>qEY0pJz֍ uL@j4:mzu~{Ѽ:,ٹ6puMD+t&<ǎīK픜njf%,/Ѯ.<}įvfV-{4¯4tW+CᯗsO|U|*l%G,{Oݓ~=wO}OOeh |e !J%ZQ&M~$# :Ihwsu+52]Fƒj"2HO{F\-fxو&ϮMJfS&bL ÚWS:|&{v>yDX]R\n; q+/bJH!:1Z뷸;*8sC:fiIyI%^L8ʋI=TZ93oLN 6~V!8 l.9ZN8iyH %F U jsE> >&Z7Cʲ=ΩM/(LN (i]O@+jueݑ# ">;v=wggzR+F"f{Db?8a8@Ҟ*p#8i`VJz ,zr0ɿI'3 q6SyJh(4NR}DӻmnWx2ÔwF (9w~IbCB 5gTd:s욜>ŮQUB6hX5;' P:6(T"]bݵT/i%-İ_&np4zM&sP/) !sXx1'sh+l$D70T̔w.3D:I#$I9jP\]./ O lX}$< ]u\\~5P(69#\9S/L<- خmretPrJ&.l&6lN,lEа`n%av跮FBgdp$aC+QY U2 Anj`1X.UwWvP')5l\@Ǟ iyaPwcdq]ZEu/`gp!_42ɎF-%ј=.?줤82yT6vt^5v_P$`2 3^ڵ.`dϡiTx5:Zם#{ZB,Ẁ?NWl.GpMg5߬d>$Cgy!EMxz8+WxFJlu JU:R )6ܿpo13 f KAs5` mQҥ&b/!K~$ _͖̿UGVsC`+m>QG )63})SMf qބ*q'tcj|2rGq|mruM+khzFӅ10DRwWjZ"IzY>ΝUhfPySb]ëllȠnMٱ'$/醗gqy9FEmI'Z[G!Նړkў.iV33p>{vPq뾱v[9[2{Rx7zPD޾fSZ&8?kEp+?K|P, M2,ioׂӅxذ؛Lu<  .+\j+)z?8Qe+#a%,3@~QY,hoL7ZopAhZ%mV^w8+j|FpnwQ9*n*+"N/"' *95YnS`UĦ=˱%&JפNmu^#]'gFkA}f! ̰k&0E1|uńT1z6LQF'U%jYvmv2C O~>ftY`zǃýOl*^O֓yYaD-[%s~_O#s`ï'/ZЄy8-gGp|]!vp]?ig//wppk`:O[Uٿ2./ +n_idGUFL8BxFJ`"u;°ɖ٭ Nް3 qD{Xq:;ky{!j/uw?隘JG'oʨU=)zd?v?-T|_dݐKWܒ,s'X ٻ/ ѱ͝F@`M*=a4@FN40,`|L̆MUZ ,lSus:Sjiolh\.(qcmibl7Owq\ Y̮d{ #sU*_bەnϠv -Bh#t8?FCv$w# xN;30{.tOٴ5"1yZk\ Ӄ"x9#.rY{:8\ݷ@qJy34BT-|) @Ghd\o|G-r@24vV ecYDuѻ9s֔0aP2-Mc(&÷ b6 eVQi:Da]PLWSJR)6+Z* ~ Pt7Sؑtx'CĽ7J;'MP4gG/ivOrc(ܧg^A~>y\w!,2ǔlpno׾_$Zç4OWOQ7[@$_֗|-Y(O~ o?ʊg"?M/mJ*j=Gn_XF;zYY e'Ó2(C`$" }P,0`J TLq' .zr$l/p |2zήr)%t$<3ɮT_$zzu{K4x0?$y*xjp;Tˡ֎)@ʁ9$-1gn'@!:d*.X^~d2:q<ͧ#WCg!h?Յ@ h'\lda ZM)!o:Sď oqeLh܂K fV "+kmLu74!o:а#4f4Wt"ORoEޛS dH]y=0NJb݀?ACvUU44دFe ;7 NwqNng.$n۲E f\l]R.t9P6,X l'WMD1Q 2^(1Ehq:jEyvG+RVTc` -tͣ=w; ٙ< YڠdW\-ޒ'(SOQn׾tu6j4GvTw[ǣŀքĬ-|HY8{ HtdLB7:9D2P(p7.ʔI(>Cهo Qp,/ /:W-G zUn#anji惮DZx$t:K H7wo2v%jSUtV(Cg6ol>C,%:[W S{$3K̢i:Yl^:Ku 6hS~K@|?j@6Di&O*,03v_ $H~Q2{,yh (IL.kD Y4R_%cw=_suzW0jS *y$n9FrEC6FPB*' s@:8eքn[Z%cw2cKJ\ \ k:D8|"KM 5V[H )G`R0yHt!ެ}Ȟ `}ﰫVg뿽Wifi$oYdet06pH=;G?{a+t|۩^ =~ޚ+ԜCnH(k)i~{'fJ ANMK~TLGo ~Q$V :NJbARח/:%#JQ=z2P IHX͐5GRjԕqI("|-IV d9Q EZlxRMÇ۠T< o>RVY՚Ȳ,WM g^mT[Эyx]ΫYq _`>$ar>NQt1-9IR'Ǧ(/*(@bn[X{27k4bt{j M8a txre05 ,9[l.gd7VN2<>L:ˮ_T"#~k!wiIcV<7ԢڗjaW z- @Gk\Wd-8rV.o/8 j&٤&&@:~;H뗤iv#Jx*iBCԓn-0"*}9()&cVԤ#&MS=K/Ϝ*znh PE0Ic̈́~v 5o2ˮv ?8St6:.!-׼ji1UY'`Ͱٖݏ( FI7R_%t'‘􀖈j>l% 9eXdix4,bY LK6zEG'xVa|>5OObA|+r] gY5xʮOoEt+:q0`o8pINHfnܖ@k B<1nb ;mv fGhXy^eE1C:+6¹-1f*8/ST@RP5u6uX Bn  s MD)$ѵZ~~'"CYJtPI4(ZJYͦ5EՒxq[A<BVDIkI{MG~?5?Yb#SgYo 쿷f|B3iy1kty?{#hqo}o}o}o/cvߋՍIgsQIK 4F5D+#_Aj$e_d: 0(Ev`|t1 !jѿt=ÕA+*{%ЮժPS իU+PJ*@ŕLZL%<\??n oC]yvZou;UH+ VTK%|mE>5oom!@֧l׈r^ سb6y֨dm[wOӆ=m/C}(m葁{ A#.V;Uڭďg&`-<*i1ϽPJM/jĝNAHqoHi<Pv:VjtzMSRW䧗8c .G`23$`{"i"x!) DfՂP7 *A 9Ȯ0ʗ)?EZ4U0,ZA:^%E(Nv NYYc/' ڏlc1't:n󒖻ᎏŅ ,M"'$+. \k 3$wSIqf+՜;t9~]a1Ki6Xrw 9]/`4LOuΐlWkgLX4R6`r\9>yU^#߲1֩5:7A`/v6M'wh<&<O#_٧IvO_x}!b7[<:”P/qv}-5zYt}u|['&`ڽ^t/q8H߇|.Ǿ}ǁ5{, ;U+ vy)Y|Qzq9t{8&GGEeQiDz[ScV<5nyJ^BiZ{8/9\5F706'!O[ٗ-kP0gSfNhx|+8O(#`eHC f `Q<ةEJW",~}Ψpew5v@Ƌў`N0}wO?1\"{uqA/o{~,A­E)snX@VJԡ^\@~'14S8ԙ! \V^^rJĠd/i{ɖe.:K1yO`g Ùwl셨se"L{dQ5-` ܄̴t Y b|8) ODDXH[qexMWaf r8'E{Mv>,aB=_ ߔ5._V"|JoOH/SqmNSԑvjqL.aHELIH+t{&ˑ u#*ln51=396x{#RS t!B(ƣegŔ Ո_ڐ˷-O";{#w DLnY:re\F<fQ0\]IBz{'@l1  b}*N0FnyE`q簦V}+A(vRێ+\>,9AIS xsR ^'(,4n9!6Rw"I(jWV3w'=Xh)3)of=ZM5@dO; V}pFC ;Ё8]@e+$;*6H4)0l,Q*N0 =o&, `mLAy(iC8xWIVaKdN 4G)_ nRL&8Da#}` 6` azko{d4*e23}pcgT fP.g!\̾/.HyWEEH97O-_sZBSØ nNypwXlęeNF `0_PD*Mc}f4WenbBcF;ؓ7HAiF 11o)BݍgTm̧&Ԋ"7R| ⭑3*KejQfdY2%AL'& {wZ&8sNL; Sqdf d o^BxriǴZ BLm ĥH0:.3*"&NpZLB/zB]=ZvpH~bI[Q$R_ "^S qʮ3#."RpQFHNTIyq55| %(5fh0ρ oVtƘGXpx3YĎHʄWE'$`5Rٲb]u*IqIx 4)1M-XF"-t>08jh3g@I(GS܈QhrB <2r) q E$F?5>;"2/y ^#Jo0i>\o$d*%Y?u@,_t&ĦsmԕO s0UU9qCƇeJ3o]/KP.韀 2\";p%`o H;O0sluٸU *-B?n|ufjۿLژ3 Rʼnp ,($xz.%4Rͷ8Re`bo=Z\?y06N\vt-'h|ddOP&*$BoxfCo: KXOD^=Db^Ie"*3Lb XHV@Vs!8t?ۺlXL=ҥ@iIfRypIm#ݟ ʜ &Y Zmͫj(LX4yx5%!,cUN:G Ydhf("tBK)0F(ȇ9J/3$4꺿S1=V 'rL:5#zw8/ Ŵ8CY^R2bi9ˇ6MÛRѥF Pf$.T @Tdl)7醨=IuxLtuÆerC$l(|pj?.4+Nj wꐎ Q}6@5_PCvOϻ/OU.Z- C4gnڞҴS[9g- VtFmA}?EݍvyYyc17&O#^|?J{ՙ&1@q$nS13I;}6Էr[-Q"AV45͢9ppMJ%ڳt[ ŨH.M.|K瓭2aai٭h}7<;>:8JIf&Sˀ e` ԃ|O#3_fLYؕucBBHC 9d:ix)mb~$AqT9fٌŴ5J3"QzpQU_NH|=rEس`z$tSE$Τ5lzTd7)]? l"tKmvTӘqCGlf<"#C'{G|F堋BPtS*#?A;?7>y ʎP_X#I(7K(cP6A 8ok7P`1\'M,ϔ0<P(2sH骕<ָ Z&n-01B{ߑPxB_ A|W< %%wx+Ԇ2"T,L؇)[MdqBVpyzJS_DNSNGz nQ) S; WvqZ,3FW xlLClyWbfSFB͔lfw ,x];{F Q\-hş?k||ݡS81v1§7?9aW5pnp,LVwJpNh?k\McZ 8*Yv1c*)nˇY/ipqIF ڃm#$`@>G47&"-Uc`bb }.')ȐoD/!k\, ъ4#x{ܿ@zB5eˑ(XCf?"\cq2?5O??|_WZگRv)Ӌ|v_qfj {8ɌY33wWiCP~S;z5O>E@i"~.q֣$h|!Pg8Ţ$f ICЏ%( 9c<&4!TO6-.Cso3B&qiOGVs`dx* >^_cb,3VM[.lSkTdv"J =żm8tm1OpJo,l)l+U]K[̭+nj]}m8U0>SRy57ۗS 5נZq4Ad9gw.4{ԎOk!!y}bOm%uܳqSm;Fש؎M+ I%8%CN51v}ǝᲵxsQc{_/Y_[릥uhI'贈n蘒/HMWxd71VKzZ Wh/cqK?./[O0WO|OES#;UsqTF[g(܇yVƷlu~phJQZT}rk)X %@Ek' Y%hh HhNlUkO|1m 0eng:Hd0z('2`/gչϪsU>οLVcNY~a|r6L4 d`o ^Ґ_p/V/E57r@pxpIWbVj,d^yk!گEPAN2xɐ.VZWQˆkR{p6 '>د,ƈMXS(xzQ ^z3ќUt 6-emBE^Z@EOɻt5 `V 2b4Bu<-=ڈ&82Ǩ\r5C# OI'@" m^sp1B9bфB{ r6/r$5: ըq_r҆i Ԉ,IvփNOG"yd(pYvkfݚjW_QftpY`ZY*G0@Ov > lݵxaTC qw)Bryd-.]n>|TI(8!x0E T^U#qeĊ ݾ4B8vaKaq ܛKbԱlU2۩ִo'UИ^`H$NN֟7}%'Gf%h2 %@-EZГEg@HW§ {aGc {80q&Q1 DQ 5jbrZށB; Qj"PiMLD:"|Vc{lyd#X'@}qҀ=K[pA,Ifmh>QIEp~XI6ֶ,LfBL57q#$@IA&,ò"m >pM`=̠ĕ]#NܰˌhHgYG"  n1&@@wkgRߐmQԆ#ea g1|ݲ_ i8ch|]Hd|2Q=J1ftq8Wͱ= PY f >wJDPӵh>=:nd0[ĉvZoרp;^FͶ]HY%&s;1DdRg1vxÛ4 \Yp(خKRCyE^j oat0u8X=u,!xP >E@A#0P)#ju{ɦ4*}"=9ڴS# 1DݍD)gFqpɛ{7J ]sQ=~'M9 e]H)yV5x'k@J6.]-~Y&ʋWdەDv d+<\ύ_I$Q<(z^ch""eXɡ\=߆ᱏtTװ5[bd'QR6ڤOX,lgQ6MEŐQ/'N@|B9 ?:Buc u>@ _$(>|Dhz/awhg|Z/~yB]80^bq0%ǸqCXlR,Ͱ8قժ2e6k!n51 \R\cȕC]a':ZgMD$FUχIqIv)shq\z RI L}gLЛɱf%@ ,3D-IJJ#/|=n.fx6f#ea(KwΉhs5Ii|䆵MFcSGb|^*Ud*~,{*8폓1`odHV QRta:äLOKs8X{pSoYSpҺtE>5/)_ +!$2g^Yyg|AVBd"K!48ӏ0d\mV<"rNzN͘<%C0ˤ=*Z@j;~A9]p#xY-E|Q6BԤ,oUGS:H(i 1>W&4Ic`l /y4LQ =ArZ,GZO.INпC WRSIF}dc# V}L#ȶ^ͧ1F {EJ킑rnW{P&̋p:3HJU]ɤY"c+I`ph}ZD$ iYL%l’[3a/0agL(jLEOֽ'+cCE(3%5[H7J[*El)Oae;6 O;  ao2lBE"TUn4Xg8e&R`8U;A "@̤p2MÊ@+)@9qvH,&qG`30=2%g_s&A6l g杏AX(Ӌ$M nt BQ{_9 Ms],~"ŸMR_qD7 m=9N\D~>^vh,M: Ēh·uY(/q2vm! t ߊc`gYI .شWVr &D6 b1T<]9Mhm)U_N&ˊ* {dX;Iڭ R(_y)ŔVOϫhm ㎵~{܇POy`c!u2g@DS|K?#'8$^G=DR D-YZA1 24@wJa+g#,QDhJy 3ڪPimy9S dtzD`/P{o&`86_""Q~F#wj3n踮j-ܕc}M9]2\J>Im׷1AniG KkjlNF)PZXض{PURLьGi?ǁ˩>5TTi~z0bg Y ^|5PNhx4h$%{'9㇚}=vȑKjVde[K?Tpfhny &wwvl\\<5MٲRW&9$o~DϺ9r4(,?'-B4EIS~T,\NBJ"5 Dq%kѿbi ZDؘN9u (AGuU6&қpL!rICT_m;C)Ѣ|-x3YPʆMN|P+/3a'>F vwi;8^:gWP:9.0gbbI7*pC`<F|lMxTu` ۽l0;& EOWN~tyyYQ#7Gc{Ht X輗.A|\zQ/x#g̴.UQžz>]1F /w7K/dp]-  Q6y뭍B/hYW8Z#-g N=&V zd|L6(um. mwaAs.1je e?zx)\C[a QBaD+y ê:Ɛo>Bm(>Y:9]qDTYP@D18)8phkaBh2\v.[1^2mZ E[OKtlpŬM? z UDJb6!Xj%fkd'ͫlDdQnɂ%A3,+'VfV'-1d;ߌVeBށveLeljoE##ja~;m/tGs ʧ:A 14v`TM]GZu4prTKP,孬so";JQh̰aI~!f1/m^ۥ gps'G5L&<^ Mgy6j]Hޗ9?JQRhޱg)Y6F>H MRT+˥j25sZ6u\þcV]+K"S `͒,og@]*( s {|xpɫgKG_ʵ ;*lz29utrpzt3ND(+%r!'ن9fBm[S cx91x\{Fe'G3Aiow'P~>MI|2[Fi-iG{?~-Z#N#w#Yl^@Q"=S& $U5s;pf|qjzSPv4ozRŜ8$ JjٗZ_Af Sd]voVbG9evsd%y :Lyg?Lo-(iC3 %PPFV @aUr/,!?{$,O6b"b<44$1}094шCٴH`n?йO4pĖB)v|C(4{HNgJFs^AR{qq{^?Ci)O}W.a񚱾B8 5eeo$ )ǂz ;59[F ׳(`Pp -U'[ HJ)ȍ(bf3v SCd&݄tHƁyZLd"݄{6`w/#$nS,CP|9,rȤEgP\nߋU8=M'_g\ NI0UVD;Io,3Ri&7-EʈuRc텭04Z1l/L$|d"M5Xfee} ѷIV=OB`y3bbe0's5t 7e6?Χ`^{ݚqu ^ڭքuM񺭫:xę$W$W9^(ĎcJ ^b-$&[uvNb,ڷ}t :NnB:]F<%IHu'̦e8r6O3 A 2X"&fW ~>DC3+}ڱw:0QTTQl\ /*!*zP7!y|Ap w4G!^b$0LPYA4EP8 K>a=puNQZpOӪ%/*1~DDQ|?FayE/OSg(cJ4^cg'h L'eAx/y^~161%©f' xr;k?*oc?.M[^$Q3ݩ˜ MPˉ$d| ˠNyȰT&cDygHJDŽ{_] 1&m܍WŊԢhJF-QX*"Q7yKP-XiZ!r- с[ Pܢ o B8N6!@dQG*դ=I7 0bF9yJFZ›]LM8$7f NU;^oF.@ 7@fNTl7(pTk^Dg lID[=$nMHwNeR)7U쫆T>wI2$u ui9|{^wQ'(:,bkgW8ٞ?۫FSV#E'6s8ȥYڸӊ;Ӎ~P{dǨU*BpAmNC PE)!'PXM#0)]hNF) #vaZ H,ergk>&a!b|b F)(s|mFSU5Mzr&2;=I 7`v*:yD9~S )$hͅ*aI0ơz; ݧ9.xyEM!aGT-M ^#!cO#aw.r񔄵eɏYr꜂2A]B"L9DPT,m$0 `\T 0e#Irˌ)o&Vl$W$e!1Ni9"S_ ~n2ll PFC(ۤʼnU&.9>^fk5٣nI ^ϙ *ʹދ ٕ g9,54fli]?IJ0$?l:NtD-% xxK~x7?9JPU"e|zŐ1HD㐴zi4sG,pS#u5n3s;@+zOW"ZvkVqQwn/IP3YiA}UU[ʺ|SI';p)׼l&ùCDB)jon21F ̋v jyƽ) ĞYd}bF 0 t`VCW7OJ8Y68#Rkf'S8:N=e4d7,擗{ml}nhz0QM]wz^ﮝ\aBnăw;N^رm]#y߇ vp*F1V?=P `')-~֓pcfGtRXk4ʭТBveW2Ì`4 )tۏP\)3%6i חDLKivAwjζx!!^KZ*JWt`ny>o1Z>]4|c^$^t/Bb0ʚWJ@_`6hv4>Vdly@(l*;L:cPJx/`0.֤>_Ng0wƜtZngCSwGt%\^CL:=`sبu!js3BPL5vF0E"F+0GA )ymɬ'dq SL\dk,O]M]͠'ٶ-QzE-71:,};]Lֽe]1V|!6\XjZT/AuYZ72>?(UMb(VbA>KwQX}&>u7z&pn[=.ä?FH \Fg! WN(’:/)¡:qs0mV[m؝*L& O#+݅UA3qe+NR߯ƀ*~.KId6_W53,v`>(K6j L6oߣ$QK ZLӡ3u02 ZR# Cﶣ 8e# co.X/mf Tv/&'Ukg^ڢ %#\;öS($bĎڜt$<\ i8P=Ax>i6r6AAvyfo3tL$ԀR$?p IF1hQbsE -y9='8lx&:0,l:W.fuF%4ZTt9+?j*@$.4zmLx&̸LuXM:`@P5"ބys|h7HɳFy $OWOk7OO~~Oo6o?Y|x'bA9t%}f~ǵ W_5SS(d qZ-$E 0K$>| JSC:MG.2ݭTfm}m={D eU%BxoK`րJ%ʶ@}1 +{(O'4++]πEuTb1ʄ;; ؂brT V8fs$b֓։iuQנGWMd& 4-0ίsi̐aFr&/oFρꭡ3C%T4'lRqhQhiιJLqjg2Y͕)x(5}9f9Ĩ$& R e@x7QzfLYAdq5vUu癦,$$>q dVg9L?''GO=ONWG>KZ'K~<8i%wON'?C?(Krt|`>{z;yxt8xyp `OI,Og?^K"v7y{|zWG'Ѕ=rxtxpZxڇYgp5ppbo~yq݋}nً݃doTS1?#hq{iD xcxЃ?GN,8"0Pp_}۟qq2{s[p>M=&$^7p2 -z!~%xI^z'n?w/y\քʇoǙ,*M'njROTf$)ӄ @0f|!<uY{ Mi}V J|MO?|GzD%ө>>cma2 Qv/UUfMsc@a5ee,"yB&1MGV'VIIͬ \TGP^/ E)-H [ꊜ Pj|BN{nbd7Npb;33 4pblve̹]%Kevqs̯@A1oZBj0TZt&Ѯt/3f8ST`J~؍#1[.U,zcsa"͆H}xUrCh$&e 8{cޠNqAQ k8 j0m,tm랳Wb nSK!tm!̆"O,MCCOg;Lv&L%RA|x4kR56tMUF19lfC RHy\C|v}] JZf+vD<ŽrC9;gDxCf[Hıqe: 6WKgS<^eW*%@d"i.%nP^I l-<ԣL,Kc1$ٞ A H@`"O\B*o'CǨE! 9ֈeK{u(h+뱡//v}0 2JF6,b̈8gÛ7 ($'Pޕg ~PAAL=BG=BBhC;hG:f`kέ%PWgdd;YތޠtU]H'jz37h572783 mQ-T/0`;zTFǙadffXl֝/fvk;zE8)Sݖkqnm(IjUuYx`-T>xƕ%qͲUs)P=?8جwcmN˷=p y(d0Hb|&DN܉ww5t>#sN kBB2@n5|յmT I1gUFE^۪Ip뷂]S/' [VWAwJ PoⵌZctR edW`bAh%"w"9@.uCk2@4FJP+[#? $q1Eakm;GtZjA"-[ܨr[zCdң&[NR.0*JN>,tn+l~I\.#w}_=== kgVP3ЕlBQc'Z̠IE-ZiFAƮ&qLEst:ȼ$wLt[1nqdc\< pGQ$W,rn[tEN+0#'-̎Հw݀L0ͽ];RA$z>^r>FVH"R/5R<{+9Ghׂ F(QP!qC  $JU\=80&x~QH&x[74A G;P.ѵ1(\ N 9[S`Td % ͈tPAucz)XH FÒx*Q^%`KNZ腘8@7T:{. R"ag!f/ԋ/SN*>%'ڏ[֊ ƴ0?DB :kou##mVD+Q3-211V=2*B4k\K.W1}sa{Fv{"Vz [Oӊhb2sɕIhZ]@-Wüjq9v6D:mLO3B)h]Ln_4G5 +cn@,bʨE䎉ѨGzL1CV%1a]6C[0RN[X3QM!/ߍU煳&*0*H0Z@*<ۜK5a `LuuZX?hWY+w{#~!t^)k WI!EMdfP%$`> 9X)pbu5gz)=cZLdR,eR,eYP?JJbB-`JxhX5 #$Ȁ*KO,T33xfn%څq Bϲ n[w:rLJظe'"Ĵ CPR&/#3h䭙.aGc-׊`ᨵ`j騋QIZ EdFf[pAwf`F)U _Wûbe)=ţ?q&11|\s0K"K敤 X_1pK0s1֏3=ftD|&"v\vnRAi;"^_#j(с0p=>1D뽓ݚnYnm TP5[?; ncׂd9﷤Ͱljhh/9-:h*0G]ux%y[]ޥ]ޟ_N2w9ߊNU$@pxJL"5BRHU=8Ojo5fà 6p8v9v#T6%P"\P(ыjZ‡ O:="`891Iꬫ,Hdln)mΙȿ}'r~^U_[c85q֓Slb3f502Vĥ)|ܒ4`Hc^$5ٳqc![R 3'{Z Wur58U97WVYIA@dXdWPl`۩:;!e&m-@7d/\e, =mt+CDv)XcS~aMCU"&԰[H~.o"`쟜OapqOiѨo|؛~55 jap i'3܀zq ., Rţw׵o"Z۹:F'm Ԅ=4} ;h[&:=m EԛVRJ쩜RZ6֘FZDW f$pQn"6&]ӡTt |kYlGѼḧ́}5ȝq mFH0&,ލ346pêanXuaJx)"*Ƚeo^ B?oe2{66h"cŰRlGrOQ;g]vi#/\vTylI@{wHo0Y&_$; KVeudMv /Xq&O$ca@KhpfD"PDs[$i.ŽŦE~^r|wLl !!E}عcմpFFg,JiFu4R]` dFjߢ6hz-xNm?n8 Fq!݋җ#A57)X7T-`{e.=OE~"F=,^ |bDۗ/_R5?!wndQT~Oacy-{:$fmTH?+&U%9= ͓pHŢ4n\v]?jtxS6JRǣ ȜD,X,6lA\|E~e lZucq b işk$] FY̭c=Z0f] cj0  k؉0uҶNSkPxaρ7[uoћbĠ[@D;} {<GBG;qģN]d3%CM^M1S%W5BF?Gc<'p27alIIwUyYȧ WՖ ?{j1d0u#ZW󶙹,-toD*oݱ`PVT> ;+W\hch **NZyh%֓!(*bu rU1ބq^=cb>]2btKRQ"nMw[ |g|:Hk*vb+Ӟ_ד\!X r*aknKM.ZG8&Ҕ<,+9-,҇|ib1 'x%?|Yxrx*n: xݓzpT)`%r&*C81pR\<~Pc n˙rQ$<ֽ %%U`"A9XSm"V*}J_oWJE=(*F^+Ug S+*7{.`oZ:Ӻv P9nUv7rˤ}.-u;~Å!8nX("EQZl~8Ò[ œ7'F+GG.֬׵#W~́σ7gC |/C "ƋZIgoIVGh9A&֭e]+z>/Ic_R5Dz$Ծ#K ;C?Ϲ9oElrf"I91`T֌6uz[[Dc ׃!lo.0jN곋ձLͻ;ʖUkl ߛ^6. m Gkj &c8I=mw˨)܀[Ex(gh3ٚD{ 8o!?H7'5Sҿ0&0p[hUH;BL"Hr>"k _ /5b`M+801%8{tzBl ~8G btz<- >05@DYF*f}ysI7 >_:oS<+|{8KO)u<[x`8 }Rx$Qg!$d`޴LX3Yqdv]0ڞge|y +;{_=x&/?)EIf|8_P$2l+eR(eR(eG|>ahV]A\@Cb[&b n;YN $ YЍ,ߍ_3i^ipsr&5ШLJX@t2=V`I6v AɐqT&=WrJ>Z(, A I?\A8] S4Oc `Ov|ŠmNVFsBA&e 12Cx_ )k|I&$*܀-" --Ѥ~~wYloVesGc}qht ށgri)IQc kLK=%!/(L˒DQiKCW$sX_Ml`i>}T%\%mz{6cN?zkFCvH#[#+~,/`~F&Xg`H;.:PDsv\8>yk, M`<_qz:܉ =ZT3+l EyǨ.s8ϟec`!W=}h3/)C"@]Vڍ+~쪮Tsq9^7|~} jEk$>]ΘNq9'vkQAU߹JzN-vW[h料B;f}z8]nW~ h&ǻ;M+Z?i4Gfc.U] ;_0ܺ_O>XXYBP)q铵(A2+h%9>K~&j%n1XJ.ݶ1w]J]wyvyYjϕf&+W$KB+R+R+ 32WOw,< .G~\=O,$C>("MBD5ql|1oFr)^DA({wr+قQό[7t_P aλm^zXpP1(?paTjDO,{ 0a1RG GP2-k7cЧpz?@%q;Ŭ'EяZ62Qƕ]D_0J-uy P V^,} ZchĻ1CVSSb =Dz 8BX!oL'al9h30DimX|Mbc4d09W "Ƨ%rKZ\` y?,L`Đc^v(C`(b8LA[p OxI 0t/ ndb wv_xmI5x5,N`Wh e|1&Ԇ)z2{ k*H.ƴZ[TR}P?/NMAN)f _URkXjF\ qH?L&0~.; \RSjwJN&;D?80Qf$~>ϝl} e”z ulX ?ǹ_\c4bLKbn&VF8;(6 > Q0.%]հ;IM|݊sncp[+;һkV ͚u X5@eo dş& H W~Ӡ &fԦOE:>>׾č%6_h 5_ ?y.- &LIO?GL~~eI?ܾyO+I_ va6-ayKX%TGrӅoxG*_p}k$K4WU= >I2< %TsZ2s_ѓtM@'/_> ֞?/xxP4JdJdJ; $bIE܈nZo#d`EiW%+X%+8V}/mEt#8A7ϳswAlanP[~r?{z2 ` K yE.JnJnJnf wByg F2֞>I|L=nSAPW6]e.Q~{J2jI3^?I{KvdKvdKv:r2%ghטٚO= i@a1 [28ۄ֎E6iwb){'}s6U%W}%W}%X}SZ{Sp2 {H\E^Iq9h̑_" e W.d:KdJ̑QP-;֢/Y7D W<;n4!hA$x^/mXj>.{g~}wkj߆Gy`72dt8F=8߶2pd3,*8WnԼ+Qc Q"J"%0Qb8f_{9 1l#sǰbX>= ]"ezFߟN٭ו9#JӸFxZ"' gLIpd=+G/\8A|?Zk?mwB\Xkiw-Ԝu>l_oaaUQ[/`":Kszs Cc%$+@#KLgb<u=S<)0oLjS//o)09wE` _%e^p ,'U~O>7?דO$) KK aA'*XMugSvՆߒ3; ǖ}uB fh 6ΊힳS,ܭ=,Hz̴,Q_$6F D}O>Ek)I/Y/y/yo3vJM5Y~fȴA`z~T"5jHQ+iz ߞnn[9x'^=~҄۰/vu#b,Xm֧QIrRSkN!0 |e@z]3"1#lN Jf+ي8rjj,Lp:U!8ղ8x2mjdҿ| lM^bUmu/+f725(kچ6R8HDJ2jL`1` QFL [>,xgUPB C'.8 BȖ[H`R CXPD?s?ڸ [N]"{`9CQV6)W-9Z wv-5-v)5`r:`/YeX9wEqqx&[Oq ]+Yz-E6NO6KIQHfq|h]7s kQ0Π\37^԰ cxOƝ`guem#uRI` ipe:RTJPzG_$K* _fﾉD݃~ňz[ )#a7qM\N^ `l,SEINCja\J%s$]+N@jH]r2&ʰuJ)LCݴ<L/2D&Z#0uIRBq)?n F+4FCFeeDG+~%0m+ZW)aQSA#ja׈_Òb;!UMVۄ vE˵NZ.u~רyNGЙ\ m-==jdI&X5{*6{ lZ-Tڰ w7Dm\ ?{v+IJǽh]lOҡ9ȭa.O1RחMZJ\!ѦFy"plNM"v q,Uk3}AWw(ؐȉ/O\N.:ԉ;c=$2:Ȕ*աAig}Z| jI32aeuPcZ YO7aؼk *Xq /0mYV8 k!&ɘ? Ƕ%M9<4RQ1^yG  <"E k( 3pPaPbc%!>(VDXYȥ C]]f\i-.?%F7q_΁/C cvA/NY X\BitR7'OsSV6VW?xJSo_Gw4F{6Vv4 D$nwp0ra a+ `na ȮDh6<@ g:Yӛ_ H}ZE5 G~1Ep=Z&&.uiU|BC:Ÿڕ˿~;^_wӳ3mY+ϾT1f pi"9Z|y bպ.u|ACM F@R"AF lv_P]iNϳKpq%`f<"Fz:-\( caDJMD1>xj$GkH ?T9*+r7~IG^a=b}\{ò17~8$F?@ ⇻=a-ú2WMb2[ EBe"~d76ɛ`یbVihNзu-z/K}vƂ%4(_b[gG(o>(Fޑ4bسdLe;~]juJ.\Q؁CKWAw?vNzQ\g۽rm 1m<)ڊ>5 Nqt]}Ө'[|emÈq̔}+8u4Nh--iL▷ACM2Uc՘yVƻٺ}+uA[MݍբR%kP,hYNSk G ' Z#WFB(_K6Pή(L+4pғ%^sEBҿ$ipȗa0|125P  M-oG[5C Pfc%,XW Jj4-6}[vq!; 2ңT[T;XUPG X%ZXR?@xx 1uś+W q>~ GCҥ&%?vD-\TA8U=7u(ʅpdM݊MR_-~e܀k$ɼjGc [b^ygTdp'XDwkեVocNؤuo 4['9y4BU.XSdMU)&hKbqɸG3ad_F.&l:^6ώXF3/@(St#v dG?Whr&~R>Y$~<%4<ІyhX.r4A{Fs'qDd)tc(+jFC@zk$prB/w< 63FO$W!"ꭇ~sz,ŤG'oևdWH]5:9_1m :t |ߟ4Mv(I!"䀹7Ó,X ꭮]M6<۱.R{r?'?k)lO{: ӔRTjJ P P%p˙ <{ɴu'Kխy /E ZlŸůlёmT4j$?K d_uHGһN/ڃ)1Rҹ-/?W4?_Ƌ+`//%_E#VhƢG`4#|ܷ s7̹U P Bs&i/Nwx\r8ɒ',x{)˹Z(&} !wK3ٟ\&I_uQ%_%_~n^'2;.d9Mu|4]<%5Xu*nikrS Λnu/ cah[ ?^ָ矃fc9{^ߓ< ȎsWZ\a\aΈ+|2PR-LAK͊={|e7pQ P G= c_+2Lq06 M:H- RN{|Sg^G6EʂuZ;[bCX^a-RD3t+bW XiW5A2s{lz;!jx[bo2j͛fi&-Zٴİf&ΝU k٘c3oMlVȳYY*B}?:>bLN66bF0nמks񇝈SKZ,d0-27C;\_(NPp"W_Ks_$mr}m%i^O?q-)9<#8|w`4,w᷐Wx>#7GCWJXJXJ3l~t؇q,bb&mMD&+JŃNq[-*b|"ahn-#BRUBrUY}EϪҸ &Vz=椄jq芃Ϥ _߹tۿp+$;Cj}F gs.<Tրχդ,bJĶ_+F<ÄԂ2]>ȊC0Z= XU60QX} Q:Z-aM+H%߂: t\ &aF0 Li;-<\ p6F>୥1p4 o6+5pZC5wk#i*%IfҚId\v}YQ1ᴠ/!Wh>V3-(ˀjEJƦf[bbS,i2%r󋿝;H{sT3̚J 4ˇ׍fN3?)_ٱ|&*ZjAHn -HR*p M&OREu;*^VX*jEĈY]:k@_._wKz4|&2J@;(+%- 24xgb9ke2R$eQjqJ-N)8qZ:at/ӳ6KzY ߊ+}w f4j;wt[7L4u_wKM=20 Ux{*vGZv@(N_\tH> d!- Z8b2 I68MJ$\~dU=iG񣦁v8Y )l"/yrҮ. F,;!7 R?2س?Ф7R"BF)h |iާ|&n{/6^I0u0@XQ.ʴXPXP3 }ć b]}9%J >NLGB/IgG a .QwCߪ\|w0YfVr 6GVzךwůnnm"$G!t7SKL*̈NMU=s<{GG` _FnȿY2ХyxQ,q -VRǕ'ʀ_z&'@@@cww фMC;[B5pVo+ol'y?x(fUb `@~R@)R@)Rc>~?`M{Eva%if0G!Ppj qeHEN?)ey_VOWEa[ew+[08ݽe ݖ;to?sP~0AhMB87yW5S[9O8h.Xpe/"%e$g5֖" W4NC&'J!_ru[$@rv?fX),ș;lZ _޾4`a-_i/VE^+^R.:R_֝}N!r+/Г//o?{յ+ T)]z^]gr56ooo^)Ax\-R+R+J|N-q= 5(}" +W͹k %)%8J=6:uBDIu\S_d)gQEkiLvV  .CL\Zpb L՚0x%d! _ 7k)I<B2aȸW^[[Zeg~!+&OMŽoRSto=Bн.ux 5YOdxj6>@ݕ zbOH!CGCW "wf}_^&&`.K d^$:g +~nEni.4( '$;FXb`0uYCMjAV䶫ffT;w}x:։aPoK;[nvM lPvl#.'6E`x))iw-v+JfJih]Å,_ ծɃԶRc4:9&.9Rg^ZIͰA|)< s r0"'S6rh %*~ݞ_BUx0/aa6Cr~1&$?1[p}#ܓ%Z20N҉ >հdu32{|Owf8gʿ~n=0X{0f0I;Y"a"p5j/)f-BnH/Ha5 QYT"f[ l(./#vQ-:G6#Xms=gM )7Hrʞ]0A}[w68'vjh7,~ POF)\..0wF 6ڱ[ &@lKрui4n*oM$=wX2:`a͢@vb5՞*t~iI8ى:ʌo(n-ƣz;8"èWKxJJ?~,>.x#i`5AG R.*8v 㙾!n|LB̻7Ysk=/^/6JS< /"@Tc/Tm* :(o[`eD3sdY{ Xz<8"]נHe҄S% Q0ȕ^Qw fm"ǍZ~&d87E3`JTIZKn |hJ|Ñ6'#oE[1T|#) }>jvxOJQ"Ge@hrԱ)T݆ |n~VuL' />~ie[»(Z@6S~"*`]Jh0Ęݐ L-I%y0cq]Hy DxEQW{Y^;@lL[N,LflˤI3?eR+R+ }GBzVT $9h]7bw톔bAh.yj/Ç";I`zJ\:(}n/FAN ۘ4C:Yܙ `~wuӌR}M H)d7E4  3-LyaDBD'pekK~*%M 91ʧ 6 èV,XD~Hڗ\Ğ@լI#PMAbw\ROq<kU_0Pǿ: VlAR<f98ZL+dڅ7;Μٲ0,`< ]~" d ?&Pzgrd"ZarXO)?DnCJO}2Ѕ*{# m:+ cQvwupzCaQ,~ 1GTԯ|zLcj$5[SIG_M=)ub\\KQèAF=}fRѨ *1:W'!i+]^^$74~$ʘ 6eh)} fM"wPZMi[B >3I vpF*e0TYl>qiŎJUu@綪mU`Fa0dŘw4I da26 V5A?5<墛&^ ;RIॽ(juhyu}Vo5c)Ϩby8ʛ?ד5}TϗkS< )F|$Ze՗Ϟf@iPf6I~w3?*`)glvYƛI&tn _n?}J|oJ%o#DMrRYGXyh 5l.Q1:AߜUT(IK Ɉ 7u6ȮobLe!Ԭs n#F7u>o]Ѩ=EbVh Bz*FÏnwB۟vi?hž:.z!eK:zx31( sg[Φ}{75hhd6l!e_SFxm4lTȓ]Εei9cA"f2X>❖;qoaYPRM$Xj˸)i3y4 <O-d(dbG3N.?tm@ڦu=VG'ppkQtNyM: ޲1F xwdHld|ڨ'}Ў 4~j;G%ӆJ? b8HZuzF^=%#4g8b@;nӛS{<4$ ZIWFL[@W!DC*ZK{լ&ݘ0It![-kn) TQI S5vDMRM"!@c$Vs>h&KoZbLr^ݿP*b"U'ϦZ:uD¾ɿ߽K"xke,*Cfqr=Ɏl3ݪ§|9wܴp!_ʸ5w,3V /'`|IM0SSȘ(#1Dl N_VĬ9ļ ̉TZOY|iUS[늌8 =F x_B@xn)LdG0+s-o Դ RP\3#_bGox *ׇ`x/F^DXԕ Hv( G}g,nZX\ݼ$B m|AEZSZ`Bo~'K#*ciFtQeDC=B -JfWm.h w@k=w7X@B@Br,k_X' \O\_-tݐP,Ni~CUg .czc:d%eX|ѭ#KTųJ],y쿫gU;3Iz@2hzdB/[1eժaC҆'l E0ȳe .EZtF㒍ivKť[Za))ZV/5z/N_M,ţ5How?l:N)ߊ4"Tst  c!rE?aI T޲_َ#>Ip<2@܃A BTa59QCPẅ́S4RԃYU.JjWi&7 ߨ⯭-5Cm/*PJf^:+ʢ\nQ fo%6, ~xxڤ.D,Τ~ $>٪|U n :VZȑ!-M i`GOZ5bXwJ98A9V3Lp1 x$C!x,k^P)%y J(<|F%K fx&@/ G0DfFOqWZ4‹7?6mL2M¯"0E-hፆȆ"l_a& nCQuo\.D\B.ƒ8}lp Q4R5XJEe#KF7职\ @󓚅#aE1w=Gl1AI$eD ci f;M{Rmv}HĶG,u͢--k oN|0#X7gU ,qgk?ؚǸxuh_ ɵ;l%+!mw绽+5j &n WoT#.8ڗĮfa:C긶Em 5^k8:?$-k^'Ѓ'Jߟ9HK3pFd!F%?[NZV5nf/?Mb'K:'ӂEЏ|iIiԵc3Zp(mjbYj ,uɺ%} iO;?8 pI,fgW'ω<_Sƀn,b0)ݟeҍxJ!? ܀X)!!jAЪP<Ow@e^1~G%eo%kA"}b NZy,;A%K1%;!K&'$ԇ&S$3sr`[sAĎ@ʹf:W~*^qL ҿ--^yA״ 3׋ҨwCɗ/i^̈8K ZpG0۬AiF(kBHJr|Z>&; hq j_)E,@=[_畊xV5f;:Gm[%_f79կլ~i /;:v8ڜlu y lY.(H`$cSSՈ k}E|%3gh@Fy$@W~^W7~;ݳ)a#׽36+= M0*lM@$&s8ƝGa"pp4<^+!d9n CD1Ylt>O4G;oyã1 _ Rk 穙LlxE F 1QFX+i%O};QJ;&n66E@ Tp"{ha !rfj8`3ư>ʻSFdXH% Y>w `2VOUpZ@б \..~TdCS+Ԩwf~ќ.T ~Z^+| CVu5t76Q vpn}ƇPV@/N=^h ZW&[ZgBӇnsii4Y#*oHUXF]/qV{zp=gE9~!+OW%|Pq>f":!y 'b+;frscy2g}&>{յk_O d! :-*〕q8`e2ECWbLAǻ…EQ^(a5 kxag0@g` 3}`4Ae .PdQߋm.YO8Zi8xHq?ʿku.W3ū1:t<Q5Ma'#Pp>@rt֚oNsw}݃qE 8ZP9C8]PFWҷWJF 2*\a3#gJϥAyتx;jtgic^fӻ_#/R|ߩD>ߌݞfDh)Ȩ׻*aSB p,qdya^ܑձakEbvȺeC40dԎGiWok$l8PYœt70) #B[8KCgTuD1K+(|C#ǞJ p&JH\jmR8v~xZյՍ@FY`n]q_B] V݀i,61& P=bhh;~"OiR/\B?T'>YMrX_=)Au07h$Cg7%%K6 j:,77-H!lAy,˜w>DDosD7R+6=!cQtX] t'^3ha:X-&twyeG+P> }(kL@X]Y` EM 7]p^+;@|T)5zݘ˨\R5klXsA 32EV!/U_ L(Z0*`Ib/osُeʻXU,|v[>20G" d)<(xCеѧd) B)?ػJyi=b3F-h5hj.e6ljj*apțHOWѾ9펰e$oā`_=o٬s߮Yh i%-O6(F+vT6Q#kHs/"ؖrnb_PۉTXUw()\խ%$*jZx`_#>Kgr0]Q6کaҤT"|tj;; iV&%9 ԶT \*ɪt`#btI>C>r>kE&9H\Й%IWlFr;/gl& htrg(Oە4@#ٻ!{L V LF  .2niUEcU+~WB:ր"eEȆ^w1IX5bC:0F"?[I'R5Nd^MPBtIvT  n2ڲIR10גew • ļ IRX^_6jlB#-Ȏ ~hdClrc?{H $mˌ>‡N?.>;=.kT A89asNxW}'|XFP~mQ *Zk#)o/)"r`bXfL\u$F)yz2cFHi3/ L=|9 C_";͠$8D(gY T !|rHl8+;pԑI:ƿ5Tsu"F%O Li :rvb$a6^;$Hրnc*%눕-e? 'YaNլ= cܕ M|sHf;'?rK0UkW 'Y[Y]٘f0àrKnfWqwB6b4GI`#5t"<|Y;M"TyMlI>~ET'M)7Zzf 5J:B4yF@L^/{S,V`SW)_rgOZ:BI\*!.{}PG *AjxAMiF*n"*a@5%S|3[h9~}|_1nyй] C8xԫɀ%q`M'[ZJ4bLt8F JWs-4vA(t.igҪyUM!TP)~HQa#g1gZKmwu$uS1]2UeEVׂecmxjo4 >+$L\^G^2YZaXurxh/zQdDтOl8 6 -*ڜ8#2: urL~eGqdƳBG$$[drzw$%`%̂ k#waaj Ï9N  O#oiɢlݹsrb@@5 "]4*Y`1w6 \ߺ}M]Qw䶬M߽߽߻Z;_ñj@]AW{_T\OU5ֆ{ ~F%ZaN_3];-ؚIy0ZS?e{T)e,&wX~o0D`4“37Xo6q`}'>e8nW/eqEPp'1GD* l-LĖuS쉷ENa%-N-V)5% 7şiL,Eh LܥG4L_9V}ayT.(B$9` j0z  z Sڿd:oUGk)C73?E ,ΫoKjniY Ƥ6gܖ lKDA܂9he#)q&|Lo}7p[Q{a:c  +m!Jچj_aØI=/X*&ly5E X$k_ ^ _aTS\8=./*X6&^,t';mI䋤 +I—L>,z8dŒ ا uu!YoG㷜%~7? }a'(fQ |%KKrMqwWݫWUN ^]ޫ)4 W͸xz:^.zW%Z_aZ2?|ۯ.;W._ƫid.*gC_DFo KuR^KݗEOxF_>.E`QO P,cC3ܽ38MQe=m}"^yt ;زVЛg)oLZ./MKҤK_}4~./nb]8&ysn|, 8QvN̺bLkVCʾzHeIЃV<O}ѡK'/G_:π-3)Ʒ!e̓c\t9*a8^=W"GN*xu?,z}{iuuge針եWx%߼~ҬԌCjQcmp\;A4,`#B PjڻCB\_Bs;;Tf( \/HةAƈdRa~>eN}~M#!s8=ٵN7jmw- \yxGɰIl/gP[x~̠FY;L9h;М>Siɘob&]G_⬙xQyG:ϙHL4Ha;uJk%U*Y%<+Y-N |KfeF&i%sErxS`{8@ )7Pd8Rd,'L+Aٚ%>tqie)^Q2(%q )^ 5ADgiSnfjF`ucK6'=pL[ZC:n[ԀG;҇%#Sa,;/V+]a﫸v ,QQ:D8<4pj@<Y,`˫啶BDG\Z`s1zhl,PjAȜ?I2^vGa+N# FR>t@_|`Bq(==wE& z I,g =—L [Un䦙;HxF'͟U֝[M޼Z <q=''FHubY'&u KѶ"Uq+0켏 lZr/{H0f9>S3nw hv:#/Zwxi i\*aޕ/sE`xMCv9 g2yw*D, t6&MDԘ3t gVCg;iмbj5_Γ(N3B4bY@Sy0?7k]\OdL+= XdQ0 ΫSMH=@TQ8c2g6x$=)j@RwB>f:Bd8㜰Juˎk;i J1OL2`vJFH3e# 11sSWT%4Dcڪvų0_!Ɲ dL@EUr8i$ < ue I-YnJKJplL.hGjx!;K Y->ۀ9Ef5B;~wH;'v&ą >0%1,ࠅG7 *:g0CPt)=EJ>\i$3iCqž9]Y3{mu p̏#'{aF r*Kؒ]rl zn"`A %j,PΩ 24qLiE&tuӔ0..)uQ+)NB>{+PU./j$8[ׁ@V3q `k `_`VI;cݍמKg xd#qoF6cHph~6,{pNNͪME]=IֵFR@wI:?&U{aN9YwvbqZCjK8? JPX^QtpoXFs"d``_H*fζh_c"OvsSB,Cگe$"o)[KC47McnJLD4uJ~#b~Mݥ4ZqIiCd?"xO_#ʞ>o;pS޼SC-ycnw*"nSCu..-J*-hx[?i|d I{8]Z=w"/~)G$&XhG\,Xǁ_ѡ3HܣMq1\(&@*1J ˂6~lsUFtbGɁГ}rs1ԀnRcB6{fMh@Ch|[ -yH-#5]B4g|n3ƕS&\?6A6YJB̈ߊ+at~nl(#bX|~6T!Ӵyn,16W{Ec0!yD0\Dd۷vc vG6\EWE/za`gDMqd_7FbZ+lb̥х s29Fх5CN:HE@CVvAי h}mIDc* 4 e(-uH!|ZK H5+/|1*@NvA su evv R;C"G;xRo΍}n6ЛݓfZ,EbܴhY5E*~14I:07љd-gI#,hmĪg~L6?s-2j"iv}vA }=hfun3=Ħ/1bwieZ˸nsnceueec}VVVV_n/X/(| x_ 7 -S.TOѧ'|P99s(v< #tv0sW=[c:P!Jzi]p6iJN[O ;sC>GHv M++tV (sw9W9}k=܇+ ^ZeYׁFhǂT{H0/0Ӂ TUڡOwL{k݅p8.pab c( W*\dUCZ|jZKXxOev]5a,pħ¾p:mק FNtU(-dHUx}YƠ|>L#@`e٩8A ھj<6 ,/2&*fqհ[!!%wgO8j;/lA޵5݀5N0`_=k/P;5knk»;X&9`Oɹ n'Ԭun[G'ч.ta?|~Z}ā᝵~X40cc7oO$Y;ۯvXw5kg]wpow #s`0'=>Qo֬"f@BCJ8vsv؍}X]/;l>xI(˰e:b/\xW2*$1rz~LP("J+ϗW~V^n8UTho&"{df7Ⱥm7Ml> '5;vk(st(5wߓܑߌ0hƄkFbEnH ,)~?ed)F9:i .~!mm 9Wf%dMJ漯FjJujIa1F hmH]2[wzG7R`ಬ .R`-lDg-rё5bHՄ?wv_@,|/lI1CqWA9%hyX`<|QO2Z%_r%_r%8N_;m"?G;{)^b'g-EۤD`e^%q"ݖ]tv;XL VqfWaH.%I>o1Ebx%<z-23?r=ÿ%O/LxGpy\o[gXbcldgrώϬxxbm1?m 04yuPZ>搢%X2%X2%H&Q#S$8F7a~SY\M*s@ n{t - I0s9^?\ *i=0jGj>}TܧD-=j**=6 \K59e"@&h}nm7?dx Ǎ]`FW:ЮAx8#' ;ӳr{vcʎ)lx(ųۿD +xDU_Y_uI_/̠:0\3)F1)XIĕ.jJelKXG?Cr`e l|ϺKݶ*Ub:CL$fZBN\@6u@Zx̊* "r\A EIy >$FR6ƾRaլ`.fu8P e'R˕J|ume-!S< _qcAt>7LK0B7 ')?!$ @Y' rD!ǤABƺ33 4y.ER4/ER4FDI9|p0dpΐśЗq5BtXa-JQ=ă]s!XRbnE1=L8$5;1N#X˅LX8}ĴT;yݺ7qU~m3zld5,P I'}UeQ*Ehva-@D)E#_Xj%t)* uԿ(嶇> .Ej/[=KgDC܊}b|E ݆nBYJjAp<$U*l4e B>gccm sfS*׿=&:W#WcNI2>8'YTm{Gh5F +9:A'}-Ѥ1mS{װ+AØwno(U=lBJ('\U^]qV-U[k $MH^ :1#=l(X+ap. !KLԔ9eH,̋XlL'hiU!醍kKf)>cd l=DzWuwVRJ<^J{sAeU],Eje~z|ٚf}g?? jjiu 1E-vmt쌶lŮq:Cem\|]0O"9·C|)l]t `q(qE?٦ xXPBURO\L! b\T!Obb#*s>LNԤ[Zb tagRbO䣐0 D5~pܩdr+q_A*hL_Nyi`xD[ )m6[Z2bDcӽwZL"ZFP42 tс]DKeWP"Y^i"v[ jz-ֱJ+<@[kϖ6wY'8M1ܭUF c_PEߡy`$yBD4_cf@qQSN,\8-]&V|ұc_M&nguz:,jؚE$s^~bpo :ϠiK&4Ҙ9Qx5`\:jjP1*WUk70NV௦7KG @wFJuW̞YXi2|F )6֓u0am߯hߪ֏YIdl'FBVWy&L?'2Hv~8٘Q--< y%1W[)Ҽ㙉++ue&72qg j̸(%SIK.Q' yma'9l([I%F"edJ2"|ͺJ,DK孑vf L+cMV]ܑ ")G@~78ɻ)øRK ̗pE;=Ae{"7.w٫D , j*ARP誑oH|)Nh]DlJ_5٧6wuDy~x\&2UM$f$Y)Xd08GE"-y[Cq5h!♛W|sCm"(zC^ˇp 8kCuQ]@[ϰqYiE-Z6v_ЯP^28'|wfc "3`IJS8ɞ m`H Q붅IpEx4%=Rc>^clza8z yyFϴR&iMѡ+!/I 3bRwxOis/fq_ÜhRл= aQ_&p\x)jғ`v׽k_W%&B!;# K;Q@$E}n}MT&JSnRd7N R2{kq5:oߓD2vE˵ a뫉]DG]vI~p~d8׭Ⲗ?|k/1yL '~R}4/`K,mK2}P8~E??.xR9(2psY?$xB49( eN1YHjЋl;w/H}Vy ')>K%Az@h<_x]OxF__=̜@DG{&i;פ{.?7z[' 5.u?7un65aVX|TOh VKgbM$qICmՅ??nbk4; (#F*Y7yTVɓ}(s-҇Ԙ?:k Kb"ɧzZf0pjfaqcAʢ+Imt;i(T@YFED 1:T|kQAZh"Z@!tcs$U1~-`H#)t6=2B\N[?y!'8F9Δrr7U:U၈}>NXAd ]솚'kC) (@e6쌫BcvpeM!U޼Izw@ XKd}=+5Yѥdg_q7s۸Ph4Lg/LnLk%$O/ ?j €qx@{w{w{?SYL7"?͊ 5\~#@Ex`fX1ԴOL ź)8~f3&G~z1st6&&lфMX.] *?9$J{^~'q|__츿 ՞ vٍB fy*8y_WL.$o=[_-'yRx7!!'(.KnKnKnpVܠ8t? ;iZB6|Ṿ< 344]t.W/.Cʆld.7?ZJr}d@"fA?#{ȓUǘ>"*c9e *f*(5s%Y2%Y2)3~-??sI?W7'/KQ3XpbÓxj2C Tʑ]SۥAF%hw.1)2ķ;o0Ի)XUʕ͐ZbKOVhGIPGz4,jzKcZѮ~qDqUxh`3z0$ipחQZZ3UZq,G~IX<Lv3X 0UUuo-&@ ~I4KcLYx~|o-Wh^#݇8%{ kc*є[fK+v}m/`=bes+bu0L,3!& ًnKϾO{>?OįsLR,и=; g|Ub>3Ns'z 13O =.D H]){d|+k/K< ߿+JKK?T [cpD\ c^XX+A Y1'ZI #X+;dCܽ`#gΗm)pCpAUOv?O:_jvCi-P^D]Ly;mUBҋ“v ˒EOp';ם A\)q#fsFwϮ0=Z_ĨDK01%*]uD4Ι5rGvjWтjWcs 4$Y\ Hqo=<,* npQLxU"pr^ ǀz?tLJ0}V ] `5eM)Bd0ϰn qS@_1r|x1ϱ** xP"Ԭyh*Z-jrfBi|7^db{6Zfr\4_+fL9*>t~np4sU*gg7DNl؇$'pܼM##^!6:f8<hq3(Z![uuop^ Q`v;FAA BdF9PSUEj9xCMdΖ6SgHv}o\UKiǥR&KM=ei~VQZŴJ@J"g /Bsy ݮ%V~ foE @SZՓ!G8}\C,*~[.AP&C$·?9qtZk v{ѱȣ_^X1 |kN( ~kQ,T}CO۹xkey?O>JRV*J%7DAiX|m dU#Z!r¬d'e hYI%^vZ[B>/lOw$$FƋ{p \(oKd^Kd^ǼSv&_y^MlH:y -oUQf]cJӥiF8(h7F'qwk9Wj0 7nJPģX6H+ w{7C=* |<n|3"3`VSUXӝBi@'9.<8A\)$5k%ﶎ΀ 8M[Vzo1yc 'ҕcR0~[?AW_PnuI.h ALLTZVeuIՃKK#/ D+*S7"9-b;#~p>nMN$z# 3}`^7N`Inߨ"݆E&;Хh|iFCHKD χ}5 BV7-6}YT(+ 2+T> ""_zC!j @8mplET +E!oS-P1XEN9Џ VJ d֞ckU,;{uD9Px?Bʮ^ًoڝ0If*J%a/BOAǻFKE? q^[CgagnĜb[ ק+>D|e)KrBGb%. 23 Hf5c͊2sFk>|hnWeH^ǕNQAvUhM3G Z }W\szOī9jJ.v@~mk'T>}Ck4Psk\UP#U-9F2MpH92H\Mz]~^L}-ɂ# n[WZF1*pKݶ*UݥVMwȱ3_&2RkABR ƌ/ cj[ߟ7[K"e&Nt,PFyM,T g IϝSa(%qOdooyja^})*(F>81gV[&,̍Y2SZu9a =f7`U+x}VKT4k~=wP麽kmrtў@UU=ǿ"Ev![?DrAp˜jqk-eu8CȱW,~g$5^sBXevֹ|d'_ˤJ}R[d_>d*`iI:TR\Kup.:TR\3G{ zynU|[_VU8` VV$D+D?%7{2XQ^s' Őxu/#rA@ы] { э CMp>y<x|ӚϡVFg pc}L>:x#R@n9jbCܼǯ$WqX|Fz4Jmp'իԕV*(%"BQS=J9>>㦟%/SY)^H:$[w dgu樈[MU6ͥdV6vTL>8E8F6Ar [~ Ǯy۴h`8b2J2vW2D s:T3ÀZM^jGo`l;.[=wo1۳ :ĸkaL\¿v} Lr}h]s?Q.'YӲ`e̎寝(| LNsCj)Ne}ҮL}u`tŇ0Pj}xfٛvv$N}Dr/MƟN ]{~62nI8ǐڮP߯*hd/e5]GzF7!w:iXmrETfʦI3Ӣ-ى3蒬_`,܇xNvqnZĝe-]Ԭ"C"sxz4y(.y*Acc L k !>H+'ǿ`U:GgNENUxnroŘD>=C܏5nj#fXqP9MS( H(%KI~\a!0`!瘏`;1*j#/|w+qk7V.e! |9]<|P^klo^u|VƕJoO+ 1Ia5pr_9Jb%6!Dx0pāb|SHe;ָ LGPL-2.1 * $ArtId: apetaglib.h,v 1.30 2003/04/16 21:06:27 art Exp $ ********************************************************************/ /* * This program 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 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 Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser 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 _APETAGLIB_H #define _APETAGLIB_H /** \file \brief All function related to apetag */ #ifdef __WATCOMC__ //watcom don't like || in ifdef and use #if define() || define() #define USE_CHSIZE #define strcasecmp(a,b) stricmp(a,b) #define index(a,b) strchr(a,b) #endif #ifdef __WIN32__ #define USE_CHSIZE #define strcasecmp(a,b) stricmp(a,b) #define index(a,b) strchr(a,b) #define S_IRGRP S_IRUSR #define S_IWGRP S_IWUSR #endif /**\{*/ #ifdef APE_TAG_DEBUG #define PRINT_D(x) fprintf( stdout, x ) #define PRINT_D1(x,a) fprintf( stdout, x, a ) #define PRINT_D2(x,a,b) fprintf( stdout, x, a,b) #define PRINT_D3(x,a,b,c) fprintf( stdout, x, a,b,c) #define PRINT_D4(x,a,b,c,d) fprintf( stdout, x, a,b,c,d) #define PRINT_D5(x,a,b,c,d,e) fprintf( stdout, x, a,b,c,d,e) #define PRINT_D6(x,a,b,c,d,e,f) fprintf( stdout, x, a,b,c,d,e,f) #define PRINT_D7(x,a,b,c,d,e,f,g) fprintf( stdout, x, a,b,c,d,e,f,g) #define PRINT_D8(x,a,b,c,d,e,f,g,i) fprintf( stdout, x, a,b,c,d,e,f,g,i) #define PRINT_D9(x,a,b,c,d,e,f,g,i,j) fprintf( stdout, x ,a,b,c,d,e,f,g,i,j ) #else #define PRINT_D(x) #define PRINT_D1(x,a) #define PRINT_D2(x,a,b) #define PRINT_D3(x,a,b,c) #define PRINT_D4(x,a,b,c,d) #define PRINT_D5(x,a,b,c,d,e) #define PRINT_D6(x,a,b,c,d,e,f) #define PRINT_D7(x,a,b,c,d,e,f,g) #define PRINT_D8(x,a,b,c,d,e,f,g,i) #define PRINT_D9(x,a,b,c,d,e,f,g,i,j) #endif /*APE_TAG_DEBUG*/ #define PRINT_ERR(x) fprintf( stderr, x ) #define PRINT_ERR1(x, a) fprintf( stderr, x ,a) /**\}*/ /** version of apetaglib defined in one place */ #define APETAGLIB_VERSION "0.5pre1" /*from winamp mpc plugin*/ /** \name frame names */ /**\{*/ #define APE_TAG_FIELD_TITLE "Title" #define APE_TAG_FIELD_SUBTITLE "Subtitle" #define APE_TAG_FIELD_ARTIST "Artist" #define APE_TAG_FIELD_ALBUM "Album" #define APE_TAG_FIELD_DEBUTALBUM "Debut Album" #define APE_TAG_FIELD_PUBLISHER "Publisher" #define APE_TAG_FIELD_CONDUCTOR "Conductor" #define APE_TAG_FIELD_COMPOSER "Composer" #define APE_TAG_FIELD_COMMENT "Comment" #define APE_TAG_FIELD_YEAR "Year" #define APE_TAG_FIELD_RECORDDATE "Record Date" #define APE_TAG_FIELD_RECORDLOCATION "Record Location" #define APE_TAG_FIELD_TRACK "Track" #define APE_TAG_FIELD_GENRE "Genre" #define APE_TAG_FIELD_COVER_ART_FRONT "Cover Art (front)" #define APE_TAG_FIELD_NOTES "Notes" #define APE_TAG_FIELD_LYRICS "Lyrics" #define APE_TAG_FIELD_COPYRIGHT "Copyright" #define APE_TAG_FIELD_PUBLICATIONRIGHT "Publicationright" #define APE_TAG_FIELD_FILE "File" #define APE_TAG_FIELD_MEDIA "Media" #define APE_TAG_FIELD_EANUPC "EAN/UPC" #define APE_TAG_FIELD_ISRC "ISRC" #define APE_TAG_FIELD_RELATED_URL "Related" #define APE_TAG_FIELD_ABSTRACT_URL "Abstract" #define APE_TAG_FIELD_BIBLIOGRAPHY_URL "Bibliography" #define APE_TAG_FIELD_BUY_URL "Buy URL" #define APE_TAG_FIELD_ARTIST_URL "Artist URL" #define APE_TAG_FIELD_PUBLISHER_URL "Publisher URL" #define APE_TAG_FIELD_FILE_URL "File URL" #define APE_TAG_FIELD_COPYRIGHT_URL "Copyright URL" #define APE_TAG_FIELD_INDEX "Index" #define APE_TAG_FIELD_INTROPLAY "Introplay" #define APE_TAG_FIELD_MJ_METADATA "Media Jukebox Metadata" #define APE_TAG_FIELD_DUMMY "Dummy" /**\}*/ #define APE_TAG_LIB_FIRST "\02" /**< is using by #apefrm_get to get first frame */ #define APE_TAG_LIB_NEXT "\03" /**< is using by #apefrm_get to get next frame you may check all frames this way */ #define APE_TAG_LIB_DEL_ALL "\04" /**< is using by #apefrm_remove_real for removing all frames */ /** \name #apetag_save flags \note default is #APE_TAG_V2 + #SAVE_NEW_OLD_APE_TAG + #SAVE_REMOVE_ID3V1 */ /**\{*/ #define APE_TAG_V1 (1 << 1) #define APE_TAG_V2 (1 << 2) #define SAVE_NEW_APE_TAG (1 << 3) #define SAVE_NEW_OLD_APE_TAG (1 << 4) #define SAVE_REMOVE_ID3V1 (1 << 5) #define SAVE_CREATE_ID3V1_TAG (1 << 6) #define SAVE_FAKE_SAVE (1 << 7) /* apetag_read(_fp) flags - default read all (ape,id3v1,id3v2(if compiled)) */ #define DONT_READ_TAG_APE (1 << 8) #define DONT_READ_TAG_ID3V1 (1 << 9) #define DONT_READ_TAG_ID3V2 (1 << 10) /**\}*/ /** \name #atl_return \brief return codes from all functions \{ */ #define ATL_OK 0 /**< not using :) */ #define ATL_FOPEN 1 /**< can't open file */ #define ATL_FREAD 2 /**< can't read from file */ #define ATL_FWRITE 3 /**< can't write to file (written bytes != bytes to write) */ #define ATL_MALOC 4 /**< can't allocate memory */ #define ATL_BADARG 5 /**< bad function argument */ #define ATL_NOINIT 6 /**< not inited struct by apetag_init */ /** \} */ /** \struct tag \brief tag structure i you get this don't change anything. copy all values/strings */ struct tag { char *name; /**< name of tag */ char *value; /**< value of tag */ size_t sizeName; /**< size of name in tag */ size_t sizeValue; /**< size of value in tag */ unsigned long flags; /**< flags of tag */ }; /** object apetag used to store information about tag. main object store **#tag , number of frames, current position for APE_TAG_LIB_NEXT, etc \brief object apetag used to store information about tag **/ typedef struct _ape_mem_cnt apetag; /* * function: * apetag_*: for load/save/init file and structure * apefrm_*: for add del edit one (or more) * frame(, field, entry) in tag */ /* read file and add frames */ int apetag_read (apetag *mem_cnt, char *filename, int flag) ; /* read file and add frames */ int apetag_read_fp (apetag *mem_cnt, FILE * fp, char *filename, int flag) ; /* initialise new object #apetag and return */ apetag * apetag_init (void) ; /* free #apetag object */ void apetag_free (apetag *mem_cnt) ; /* save apetag to file */ int apetag_save (char *filename, apetag *mem_cnt, int flag) ; /* Add text frame */ int apefrm_add (apetag *mem_cnt, unsigned long flags, char *name, char *value) ; /* add binary frame */ int apefrm_add_bin (apetag *mem_cnt, unsigned long flags, long sizeName, char *name, long sizeValue, char *value); /* add frame if other (the same name) no exist */ int apefrm_add_noreplace (apetag *mem_cnt, unsigned long flags, char *name, char *value) ; /* search in apetag for name and return tag */ struct tag * apefrm_get (apetag *mem_cnt, char *name) ; /* search in apetag for name and return string */ char * apefrm_getstr (apetag *mem_cnt, char *name) ; /* remove frame from memory */ void apefrm_remove_real (apetag *mem_cnt, char *name) ; /** \def apefrm_fake_remove(mem_cnt,name) \brief set frame to remove \deprecated remove in 0.5 */ #define apefrm_fake_remove(mem_cnt,name) apefrm_remove(mem_cnt,name) /* set frame to remove */ void apefrm_remove (apetag *mem_cnt, char *name); /* read id3v1 and add frames */ int readtag_id3v1_fp (apetag *mem_cnt, FILE * fp) ; /** \name flags in frames and headers */ /**\{*/ //================================ #define HEADER_IS 0x80000000 #define HEADER_NOT 0x00000000 #define HEADER_THIS_IS 0x20000000 //================================ #define FOOTER_IS 0x00000000 #define FOOTER_NOT 0x40000000 #define FOOTER_THIS_IS 0x00000000 //================================ #define ITEM_TEXT 0x00000000 #define ITEM_BIN 0x00000002 #define ITEM_LINK 0x00000004 #define ITEM_URL 0x00000004 // for compability ITEM_LINK //================================ #define TAG_RW 0x00000000 #define TAG_RO 0x00000001 /**\}*/ /* debug function print all tags exclude bin (print only size for bin) */ void libapetag_print_mem_cnt (apetag *mem_cnt); #endif /* _APETAGLIB_H */ madman-0.93/libapetag/genres.h0000644000175000001440000000723210053135241016036 0ustar akusers00000000000000/* genres.h - EasyTAG - Jerome Couderc 2000/05/29 */ /* * EasyTAG - Tag editor for MP3 and Ogg Vorbis files * Copyright (C) 2000-2003 Jerome Couderc * * 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 __GENRES_H__ #define __GENRES_H__ /* GENRE_MAX is the last genre number that can be used */ #define GENRE_MAX ( sizeof(id3_genres)/sizeof(id3_genres[0]) - 1 ) #define ID3_INVALID_GENRE 255 /** \def genre_no(IndeX) \param IndeX number of genre using in id3v1 \return pointer to genre as string */ #define genre_no(IndeX) ( IndeX < (sizeof(id3_genres)/sizeof(*id3_genres) ) ? id3_genres[IndeX] : "Unknown" ) /* * Do not sort genres!! * Last Update: 2000/04/30 */ static char *id3_genres[] = { "Blues", /* 0 */ "Classic Rock", "Country", "Dance", "Disco", "Funk", /* 5 */ "Grunge", "Hip-Hop", "Jazz", "Metal", "New Age", /* 10 */ "Oldies", "Other", "Pop", "R&B", "Rap", /* 15 */ "Reggae", "Rock", "Techno", "Industrial", "Alternative", /* 20 */ "Ska", "Death Metal", "Pranks", "Soundtrack", "Euro-Techno", /* 25 */ "Ambient", "Trip-Hop", "Vocal", "Jazz+Funk", "Fusion", /* 30 */ "Trance", "Classical", "Instrumental", "Acid", "House", /* 35 */ "Game", "Sound Clip", "Gospel", "Noise", "Altern Rock", /* 40 */ "Bass", "Soul", "Punk", "Space", "Meditative", /* 45 */ "Instrumental Pop", "Instrumental Rock", "Ethnic", "Gothic", "Darkwave", /* 50 */ "Techno-Industrial", "Electronic", "Pop-Folk", "Eurodance", "Dream", /* 55 */ "Southern Rock", "Comedy", "Cult", "Gangsta", "Top 40", /* 60 */ "Christian Rap", "Pop/Funk", "Jungle", "Native American", "Cabaret", /* 65 */ "New Wave", "Psychadelic", "Rave", "Showtunes", "Trailer", /* 70 */ "Lo-Fi", "Tribal", "Acid Punk", "Acid Jazz", "Polka", /* 75 */ "Retro", "Musical", "Rock & Roll", "Hard Rock", "Folk", /* 80 */ "Folk/Rock", "National Folk", "Fast Fusion", "Swing", "Bebob", /* 85 */ "Latin", "Revival", "Celtic", "Bluegrass", "Avantgarde", /* 90 */ "Gothic Rock", "Progressive Rock", "Psychedelic Rock", "Symphonic Rock", "Slow Rock", /* 95 */ "Big Band", "Chorus", "Easy Listening", "Acoustic", "Humour", /* 100 */ "Speech", "Chanson", "Opera", "Chamber Music", "Sonata", /* 105 */ "Symphony", "Booty Bass", "Primus", "Porn Groove", "Satire", /* 110 */ "Slow Jam", "Club", "Tango", "Samba", "Folklore", /* 115 */ "Ballad", "Power Ballad", "Rhythmic Soul", "Freestyle", "Duet", /* 120 */ "Punk Rock", "Drum Solo", "A Capella", "Euro-House", "Dance Hall", /* 125 */ "Goa", "Drum & Bass", "Club-House", "Hardcore", "Terror", /* 130 */ "Indie", "BritPop", "Negerpunk", "Polsk Punk", "Beat", /* 135 */ "Christian Gangsta Rap", "Heavy Metal", "Black Metal", "Crossover", "Contemporary Christian",/* 140 */ "Christian Rock", "Merengue", "Salsa", "Thrash Metal", "Anime", /* 145 */ "JPop", "Synthpop" }; #endif /* __GENRES_H__ */ madman-0.93/libapetag/id3v2_read.h0000644000175000001440000000266510053135241016502 0ustar akusers00000000000000/******************************************************************** * * Copyright (c) 2002 Artur Polaczynski (Ar't) All rights reserved. * LGPL-2.1 * $ArtId: id3v2_read.h,v 1.6 2003/04/04 20:06:40 art Exp $ ********************************************************************/ /* * This program 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 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 Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser 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 _ID3V2_READ_H #define _ID3V2_READ_H /** \file id3v2_read.h \brief reading id3v2 tag to ape_cnt */ #ifdef ID3V2_READ /** reading id3v2 tag to #mem_cnt \param mem_cnt stucture ape_mem_cnt \param fileName file name (no file pointer becase libid3 using filename in c mode) */ int readtag_id3v2 ( apetag *mem_cnt, char* fileName ); #endif #endif /* _ID3V2_READ_H */ madman-0.93/libapetag/info_mac.h0000644000175000001440000000654710053135241016336 0ustar akusers00000000000000/******************************************************************** * * Copyright (c) 2002 Artur Polaczynski (Ar't) All rights reserved. * LGPL-2.1 * $ArtId: info_mac.h,v 1.6 2003/04/13 11:24:10 art Exp $ ********************************************************************/ /* * This program 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 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 Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser 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 INFO_MAC_H #define INFO_MAC_H /** \file info_mac.h \brief Get information from MonkeyAudio file. Usage: \code StreamInfoMac Info; if (info_mac_read(fn, &Info)) { printf("File \"%s\" not found or is read protected!\n", fn); return; } printf("%",Info.fields...); \endcode */ /** \name Compression level */ /*\{*/ #define COMPRESSION_LEVEL_FAST 1000 /**< fast */ #define COMPRESSION_LEVEL_NORMAL 2000 /**< optimal average time/compression ratio */ #define COMPRESSION_LEVEL_HIGH 3000 /**< higher compression ratio */ #define COMPRESSION_LEVEL_EXTRA_HIGH 4000 /**< very slowly */ #define COMPRESSION_LEVEL_INSANE 5000 /**< ??? */ /*\}*/ /** All information from mac file * \struct StreamInfoMac **/ typedef struct { unsigned int ByteLength; /**< file length - tags size */ unsigned int FileSize; /**< real file size */ int SampleFreq; /**< sample frequency */ unsigned int Channels; /**< number of chanels */ int Duration; /**< duratiom in ms */ unsigned int Version; /**< version of current file */ unsigned int Bitrate; /**< bitrate of current file (bps) */ unsigned int Compresion; /**< compresion profile */ unsigned int Flags; /**< flags */ unsigned int Frames; /**< number of frames */ unsigned int SamplesPerFrame; /**< samples per frame */ unsigned int Samples; /**< number of samples */ unsigned int BitsPerSample; /**< bits per sample */ unsigned int UncompresedSize; /**< uncomprese size of file */ float CompresionRatio; /**< compresion ratio */ unsigned int PeakLevel; /**< peak level */ float PeakRatio; /**< peak ratio */ const char *CompresionName; /**< compresion profile as string */ unsigned int EncoderVersion; /**< version of encoder used */ } StreamInfoMac; /** Read all mac info from filename \param fn File name \param Info StreamInfoMac Structure for all information \retval 0 ok \retval 1 file not found or write protected \retval 2 not monkey's audio file */ int info_mac_read(const char *fn, StreamInfoMac * Info); #endif /* INFO_MAC_H */ madman-0.93/libapetag/info_mpc.h0000644000175000001440000000702610053135241016346 0ustar akusers00000000000000/******************************************************************** * * Copyright (c) 2002 Artur Polaczynski (Ar't) All rights reserved. * LGPL-2.1 * $ArtId: info_mpc.h,v 1.8 2003/04/13 11:24:10 art Exp $ ********************************************************************/ /* * This program 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 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 Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser 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 INFO_MPC_H #define INFO_MPC_H /** \file info_mpc.h \brief Get information from MusePack file. Usage: \code StreamInfoMpc Info; if (info_mpc_read(fn, &Info)) { printf("File \"%s\" not found or is read protected!\n", fn); return; } printf("%",Info.fields); \endcode */ /** All information from mpc file * \struct StreamInfoMpc **/ typedef struct { unsigned int ByteLength; /**< file length - tags size */ unsigned int FileSize; /**< real file size */ int SampleFreq; /**< Sample frequency */ unsigned int Channels; /**< channels =2 */ int Duration; /**< duratiom in ms */ unsigned int StreamVersion; /**< Streamversion of current file */ unsigned int Bitrate; /**< bitrate of current file (bps) */ unsigned int Frames; /**< number of frames contained */ unsigned int MS; /**< Mid/Side Stereo (0: off, 1: on) */ unsigned int Profile; /**< quality profile */ unsigned int MaxBand; /**< maximum band-index used (0...31) */ unsigned int IS; /**< Intensity Stereo (0: off, 1: on) */ unsigned int BlockSize; /**< only needed for SV4...SV6 -> not supported */ const char *ProfileName; /**< Profile name */ unsigned int EncoderVersion; /**< version of encoder used */ char Encoder[256]; /**< Encoder Version in string */ // ReplayGain related data short GainTitle; /**< Gain Title */ short GainAlbum; /**< Gain Album */ unsigned short PeakAlbum; /**< Peak value of Album */ unsigned short PeakTitle; /**< Peak value of Title */ unsigned short EstPeakTitle; /**< Estimated Peak value of Title */ // true gapless stuff unsigned int IsTrueGapless; /**< is true gapless used? */ unsigned int LastFrameSamples; /**< number of valid samples within last frame */ } StreamInfoMpc; /** \def StreamInfo is only for compatible before 0.4alpha4 \deprecated removed in 0.5 */ #define StreamInfo StreamInfoMpc /** Read all mpc info from filename \param fn File name \param Info StreamInfoMpc Structure for all information \retval 0 ok \retval 1 file not found or write protected \retval 2 not musepack audio file */ int info_mpc_read(const char *fn, StreamInfoMpc *Info); #endif /* INFO_MPC_H */ madman-0.93/libapetag/is_tag.h0000644000175000001440000000252110053135241016015 0ustar akusers00000000000000/******************************************************************** * * Copyright (c) 2002 Artur Polaczynski (Ar't) All rights reserved. * LGPL-2.1 * $ArtId: is_tag.h,v 1.7 2003/04/13 11:24:10 art Exp $ ********************************************************************/ /* * This program 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 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 Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser 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 _IS_TAG_H #define _IS_TAG_H /** \file is_tag.h \brief Function for check if tag is avilable All is_* function restore file positon on return */ int is_id3v1 (FILE * fp); int is_id3v2 (FILE * fp); int is_ape (FILE * fp); int is_ape_ver (FILE * fp); #endif /* _IS_TAG_H */ madman-0.93/libapetag/apetaglib.c0000644000175000001440000007510510053135241016502 0ustar akusers00000000000000/******************************************************************** * * Copyright (c) 2002 Artur Polaczynski (Ar't) All rights reserved. * LGPL-2.1 * $ArtId: apetaglib.c,v 1.44 2003/04/16 21:06:27 art Exp $ ********************************************************************/ /* * This program 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 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 Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser 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 #include #ifndef __BORLANDC__ # include #endif #include "apetaglib.h" #include "genres.h" #include "is_tag.h" #ifdef ID3V2_READ # include "id3v2_read.h" #endif /* LOCAL STRUCTURES */ /** \struct _apetag_footer \brief structure of APETAGEXT footer or/and header tag */ struct _apetag_footer { unsigned char id[8]; /**< magic should equal 'APETAGEX' */ unsigned char version[4]; /**< version 1000 (v1.0) or 2000 (v 2.0) */ unsigned char length[4]; /**< the complete size of the tag, including footer, but no header for v2.0 */ unsigned char tagCount[4]; /**< the number of fields in the tag */ unsigned char flags[4]; /**< the tag flags (none currently defined for v 1.0) */ unsigned char reserved[8]; /**< reserved for later use */ }; /** \struct _ape_mem_cnt \brief internal structure for apetag */ struct _ape_mem_cnt { struct tag **tag; int countTag; int memTagAlloc; // for mem container; char *filename; // for info struct _apetag_footer ape_header; struct _apetag_footer ape_footer; int currentPosition; }; /* * \struct _id3v1Tag \brief for id3v1 tag */ struct _id3v1Tag { char magic[3]; // `TAG` char title[30]; char artist[30]; char album[30]; char year[4]; char comment[30]; // if ([28]==0 and [29]!=0) track = [29] unsigned char genre; }; /* LOCAL FUNCTION prototypes */ unsigned long ape2long (unsigned char *p); void long2ape (unsigned char *p, const unsigned long value); struct tag * libapetag_maloc_cont_int (apetag *mem_cnt, struct tag *mTag); int libapetag_maloc_cont_text (apetag *mem_cnt, unsigned long flags, long sizeName, char *name, long sizeValue, char *value); int libapetag_maloc_cont (apetag *mem_cnt, unsigned long flags, long sizeName, char *name, long sizeValue, char *value); static int libapetag_qsort (struct tag **a, struct tag **b); int make_id3v1_tag(apetag *mem_cnt, struct _id3v1Tag *m); unsigned long ape2long (unsigned char *p) { return (((unsigned long) p[0] << 0) | ((unsigned long) p[1] << 8) | ((unsigned long) p[2] << 16) | ((unsigned long) p[3] << 24) ); } void long2ape (unsigned char *p, const unsigned long value) { p[0] = (unsigned char) (value >> 0); p[1] = (unsigned char) (value >> 8); p[2] = (unsigned char) (value >> 16); p[3] = (unsigned char) (value >> 24); } /* PL: funkcja troszczaca sie o odpowiedni ilosc zalokowanej pamieci dla tablicy PL: %mTag% przy okazji alokuje z wyprzedzeniem troche wiecej pamieci [mniej %realoc%] PL: zwraca %mTag[]% :NON_USER:!!! */ #define LIBAPETAG_MEM_ALLOC_AHEAD 16 /* 15 it's good for normal #of tag, Aver 4-8 */ struct tag * libapetag_maloc_cont_int (apetag *mem_cnt, struct tag *mTag) { struct tag **tag_tmp = mem_cnt->tag; if (mem_cnt->memTagAlloc == 0) { /* init */ mem_cnt->tag = (struct tag **) malloc (((sizeof (struct tag **)) * (LIBAPETAG_MEM_ALLOC_AHEAD))); mem_cnt->memTagAlloc = LIBAPETAG_MEM_ALLOC_AHEAD; mem_cnt->countTag = 0; if (mem_cnt->tag == NULL) { mem_cnt->memTagAlloc = mem_cnt->countTag = 0; PRINT_ERR ( "ERROR->libapetag->libapetag_maloc_cont_int:malloc\n"); return NULL; } } if ((mem_cnt->memTagAlloc) <= (mem_cnt->countTag + 1)) { mem_cnt->tag = (struct tag **) realloc (mem_cnt->tag, ((sizeof (struct tag **)) * (mem_cnt->memTagAlloc + LIBAPETAG_MEM_ALLOC_AHEAD))); mem_cnt->memTagAlloc += LIBAPETAG_MEM_ALLOC_AHEAD; } if (mem_cnt->tag == NULL) { int n; PRINT_ERR ( "ERROR->libapetag->libapetag_maloc_cont_int:malloc\n"); /* free old all */ for (n = mem_cnt->countTag-1; n >= 0; n--) { free (tag_tmp[n]->value); free (tag_tmp[n]->name); free (tag_tmp[n]); } free (tag_tmp); mem_cnt->memTagAlloc = mem_cnt->countTag = 0; return NULL; } mem_cnt->tag[mem_cnt->countTag] = mTag; mem_cnt->countTag++; return mTag; } #undef LIBAPETAG_MEM_ALLOC_AHEAD /* PL: alocuje pamiec dla %mTag% przypisuje odpowiednio wartosci PL: dodaje %\0% do stringw [na wszelki wypadek] PL: nie dopisuje takich samych PL: wszystkie sizy maja byc bez \0 (jak bedzie to doliczy jeszcze jeden) :NON_USER:!!! */ int libapetag_maloc_cont (apetag *mem_cnt, unsigned long flags, long sizeName, char *name, long sizeValue, char *value) { struct tag *mTag; // TODO:: zadbac o to zeby tu czyscilo istniejace tagi jesli value=NULL if (!sizeName || !sizeValue) return ATL_BADARG; if (apefrm_getstr (mem_cnt, name) == NULL) { mTag = (struct tag *) malloc (sizeof (struct tag)); if (mTag == NULL) return ATL_MALOC; mTag->value = (char *) malloc (sizeValue + 1); if (mTag->value==NULL) { free (mTag); return ATL_MALOC; } mTag->name = (char *) malloc (sizeName + 1); if (mTag->name==NULL) { free (mTag->value); free (mTag); return ATL_MALOC; } memcpy (mTag->value, value, sizeValue); memcpy (mTag->name, name, sizeName); mTag->value[sizeValue] = '\0'; mTag->name[sizeName] = '\0'; mTag->sizeName = sizeName; mTag->sizeValue = sizeValue; mTag->flags = flags; if (libapetag_maloc_cont_int (mem_cnt, mTag)==NULL) { PRINT_ERR(">apetaglib>libapetag_maloc_cont>> int==NULL"); return ATL_MALOC; } } return 0; } /* PL: jezeli nie istnieje to dodaje taga, pomija ostatnie biale znaki PL: pomija jesli pusty PL: ! zmienia tekst wejciowy :NON_USER:!!! */ int libapetag_maloc_cont_text (apetag *mem_cnt, unsigned long flags, long sizeName, char *name, long sizeValue, char *value) { int n = sizeValue; if (value != NULL && value[0] != '\0' && apefrm_getstr (mem_cnt, name) == NULL) { while (value[--n] == ' ' || value[n] == '\0' || value[n] == '\n') { value[n] = '\0'; } return libapetag_maloc_cont (mem_cnt, flags, sizeName, name, n + 1, value); } return 0; } /* PL: dodaje taga do istniejeacych o ustawionych wartosciach %flag% %name% i %value% PL: wylicza odpowiednio rozmiary przy pomocy strlen!! PL: wraper na %libapetag_maloc_cont% PL: wszystko kopiuje sobie do pamieci PL: musi byc juz w UTF-8 dla v2 PL: Nadpisuje istniejace */ /** \brief Add text frame add text frame/field to object apetag (if exist then overwrite) \param mem_cnt object #apetag \param flags flags stored in frame \param name name of frame \param value value of frame \return 0 - OK else check #atl_return */ int apefrm_add (apetag *mem_cnt, unsigned long flags, char *name, char *value) { apefrm_remove_real (mem_cnt, name); return libapetag_maloc_cont (mem_cnt, flags, strlen (name), name, strlen (value), value); } /* PL: Prosty wraperek na maloc_cont - do zapisu binarnych */ /** \brief add binary frame add binary frame/field to object apetag (if exist then overwrite) \param mem_cnt object #apetag \param flags flags stored in frame \param sizeName size of name \param name name of frame \param sizeValue size of value \param value value of frame \return 0 - OK else check #atl_return */ int apefrm_add_bin (apetag *mem_cnt, unsigned long flags, long sizeName, char *name, long sizeValue, char *value) { apefrm_remove_real (mem_cnt, name); return libapetag_maloc_cont (mem_cnt, flags, sizeName, name, sizeValue, value); } /* PL: jak %apefrm_add ()% z tym ze nie nadpisuje istniejacych */ /** \brief add frame if other (the same name) no exist if exist "name" in ape_mem then do nothing else add frame/field to ape_mem \param mem_cnt object #apetag \param flags flags stored in frame \param name name of frame \param value value of frame \return 0 - OK else check #atl_return */ int apefrm_add_noreplace (apetag *mem_cnt, unsigned long flags, char *name, char *value) { if ( apefrm_getstr (mem_cnt, name) == NULL ) return apefrm_add (mem_cnt, flags, name, value); return 0; } /* PL: wyszukuje taga o nazwie %name% i zwraca structure %struct tag% PL: %APE_TAG_LIB_FIRST% i %APE_TAG_LIB_NEXT% to ulatwienie dla PL: przesukiwania wszystkich istniejacych tagw PL: %APE_TAG_LIB_FIRST% ustawia znacznik na pierwszy tag [0] i zwraca jego warto PL: %APE_TAG_LIB_NEXT% podaje nastepny tag i zwieksza znacznik, po ostatnim funkcja zwraca %NULL% PL: UWAGA!!! zwraca pointer do wewnetrznej struktury PL: niczego nie zmieniac i nie free()-jowac skopiowac i dopiero PL: zwraca teksty w UTF-8 */ /** \brief search in apetag for name and return tag 2 special names \a APE_TAG_LIB_FIRST and \a APE_TAG_LIB_NEXT. FIRST return first frame and set counter to 1 NEXT return ++counter frame \code for ((framka = apefrm_get(ape, APE_TAG_LIB_FIRST)); framka!=NULL;) { do_something(); framka = apefrm_get(ape, APE_TAG_LIB_NEXT); } \endcode return NULL if no more frame exist \param mem_cnt object #apetag \param name frame name for search \return pointer to struct tag if name exist or NULL if don't \warning don't change anything in this struct make copy and work */ struct tag * apefrm_get (apetag *mem_cnt, char *name) { int n; struct tag **mTag; mTag = (mem_cnt->tag); if (mem_cnt->countTag == 0) return NULL; if (strcmp (name, APE_TAG_LIB_FIRST) == 0) { mem_cnt->currentPosition = 0; return (mTag[mem_cnt->currentPosition++]); } if (strcmp (name, APE_TAG_LIB_NEXT) == 0) { if (mem_cnt->currentPosition >= mem_cnt->countTag) return NULL; return (mTag[mem_cnt->currentPosition++]); } for (n = 0; (mem_cnt->countTag) > n; n++) { if (strcasecmp (mTag[n]->name, name) == 0) { return (mTag[n]); } } return NULL; } /* PL:zwraca %mem_cnt->tag[x]->value% o ile znajdzie nazwe %name% taga PL: prosty wraper na %apefrm_get % PL: UWAGA zwraca pointer z wewnetrznych struktur niczego bezposrednio nie zmieniac PL: i nie free()-jowac bo sie rozsypie PL: zwraca tekst w UTF-8 */ /** \brief search in apetag for name and return string \param mem_cnt object #apetag \param name frame name for search \return pointer to value of frame if name exist or NULL if don't \warning don't change that string make copy before any action \todo check if frame type isn't binary */ char * apefrm_getstr (apetag *mem_cnt, char *name) { struct tag *mTag; mTag = apefrm_get (mem_cnt, name); if (mTag == NULL) return NULL; return (mTag->value); } /* PL: usuwanie taga o nazwie zdefiniowanej w %name% PL:lub wszystkich jezeli %name%=%APE_TAG_LIB_DEL_ALL% PL:UWAGA mozna to napisac inaczej (sprawdzanie czy %name% OR %%special%) ale to w v1.0 */ /** \brief remove frame from memory (real) remove frame from ape_mem. Check #apefrm_remove for more info \param mem_cnt object #apetag \param name frame name for search and remove */ void apefrm_remove_real (apetag *mem_cnt, char *name) { int n; struct tag **mTag; mTag = (mem_cnt->tag); /* Delete all */ if (strcmp (name, APE_TAG_LIB_DEL_ALL) == 0) { for (n = mem_cnt->countTag-1; n >= 0; n--) { free (mTag[n]->name); free (mTag[n]->value); free (mTag[n]); --mem_cnt->countTag; } return; } /* Delete only one */ for (n = mem_cnt->countTag-1; n >= 0; n--) { if (strcasecmp (mTag[n]->name, name) == 0) { free (mTag[n]->name); free (mTag[n]->value); free (mTag[n]); mTag[n] = mTag[mem_cnt->countTag]; --mem_cnt->countTag; /* !no return; search for all */ } } return; } /* PL: tak jakby frejuje framke oznacza do kasacji jednak tego nie robi PL: mechanizm ten gownie jest wykorzystywany do wczytania innych tagw PL: poza wczesniej zkasowanymi aby to usunc uzyj apefrm_remove_real */ /** \brief set frame to remove Create fake name and empty value (and set don't save flag). If you use apefrm_add_norepleace then you don't change this not_save_flag. Only apefrm_add overwrite this. [it's for id3v1 but you may using this for remove frames] \param mem_cnt object #apetag \param name frame name for search and remove */ void apefrm_remove (apetag *mem_cnt, char *name) { int n; struct tag **mTag; apefrm_add (mem_cnt, 0 , name, "delete me"); mTag = (mem_cnt->tag); for (n = 0; (mem_cnt->countTag) > n; n++) { if (strcasecmp (mTag[n]->name, name) == 0) { mTag[n]->sizeValue=0; return; } } return; } /* PL:Wypisuje na ekran wszystko to co potrzebne do debugu :NON_USER:!!! */ /** debug function print all tags exclude bin (print only size for bin) */ void libapetag_print_mem_cnt (apetag *mem_cnt) { int n; struct tag **mTag; mTag = (mem_cnt->tag); for (n = 0; (mem_cnt->countTag) > n; n++) { if ( (mTag[n]->flags & ~ITEM_TEXT) == 0 || (mTag[n]->flags & ~ITEM_LINK) == 0 ) { printf (">apetaglib>PRINT>>F=%li SN=%li SV=%li N[%s] V[%s]\n", mTag[n]->flags, (long) mTag[n]->sizeName, (long) mTag[n]->sizeValue, mTag[n]->name, mTag[n]->value); } else { printf (">apetaglib>PRINT>>F=%li SN=%li SV=%li N[%s] V=BINARY\n", mTag[n]->flags, (long) mTag[n]->sizeName, (long) mTag[n]->sizeValue, mTag[n]->name); } } return; } /* PL: alokuje pamiec dla glwnej struktury %struct ape_mem_cnt% PL: i zeruje wszystko co trzeba PL: z jakiegos powodu (mojej niewiedzy) memset nie dziala PL: a w sumie dziala czyszczac troche za duzo */ /** \brief initialise new object #apetag and return \return new initialised object #apetag */ apetag * apetag_init (void) { apetag * mem_cnt; mem_cnt = (apetag *) malloc (sizeof (apetag)); if (mem_cnt == NULL) { PRINT_ERR ("ERROR->libapetag->apetag_init:malloc\n"); return NULL; } mem_cnt->memTagAlloc = 0; mem_cnt->countTag = 0; mem_cnt->filename = NULL; mem_cnt->currentPosition = 0; mem_cnt->tag = NULL; return mem_cnt; } /* PL: Czysci z sila wodospadu wszystko co zostalo do czyszczenia PL: z %struct ape_mem_cnt% wlacznie, wczeniej to nie byo jasne */ /** \brief free all work \param mem_cnt object #apetag */ void apetag_free (apetag *mem_cnt) { int n; for (n = mem_cnt->countTag-1; n >= 0; n--) { free (mem_cnt->tag[n]->value); free (mem_cnt->tag[n]->name); free (mem_cnt->tag[n]); } free (mem_cnt->tag); free (mem_cnt); mem_cnt = NULL; return; } /** \brief read id3v1 and add frames read id3v1 and add frames to ape_mem. Using #apefrm_add_norepleace \param mem_cnt object #apetag \param fp file pointer \return 0 - OK else check #atl_return */ int readtag_id3v1_fp (apetag *mem_cnt, FILE * fp) { struct _id3v1Tag m; if (!is_id3v1(fp)) return 0; /* TODO:: 0 or no_id3v1*/ fseek(fp, -128, SEEK_END); if (sizeof (struct _id3v1Tag)!=fread(&m, 1, sizeof (struct _id3v1Tag), fp)){ PRINT_ERR( "ERROR->libapetag->readtag_id3v1_fp:fread\n"); return ATL_FREAD; } libapetag_maloc_cont_text(mem_cnt, 0, 5, "Title", 30, m.title); libapetag_maloc_cont_text(mem_cnt, 0, 6, "Artist", 30, m.artist); libapetag_maloc_cont_text(mem_cnt, 0, 5, "Album", 30, m.album); libapetag_maloc_cont_text(mem_cnt, 0, 4, "Year", 4, m.year); if (m.comment[28] == 0 && m.comment[29] != 0) { char track[20]; snprintf(track, 19, "%i", m.comment[29]); libapetag_maloc_cont_text(mem_cnt, 0, 5, "Track", strlen(track), track); libapetag_maloc_cont_text(mem_cnt, 0, 7, "Comment", 28, m.comment); } else { libapetag_maloc_cont_text(mem_cnt, 0, 7, "Comment", 30, m.comment); } libapetag_maloc_cont_text(mem_cnt, 0, 5, "Genre", strlen(genre_no(m.genre)), genre_no(m.genre)); return 0; } /* PL: wczytuje odpowiednie fra(mk)gi do pamieci w razie koniecznosci przyciecia PL: dodaje "..." na koniec PL: TODO genre PL: macro COMPUTE_ID3V1_TAG */ #define COMPUTE_ID3V1_TAG(FramkA, TagNamE, SizE, TagValuE) \ FramkA = apefrm_get(mem_cnt, TagNamE); \ if (FramkA != NULL) { \ memcpy (TagValuE, FramkA->value, \ ((FramkA->sizeValue) > SizE) ? SizE : FramkA->sizeValue ); \ if ((FramkA->sizeValue) > SizE) { \ TagValuE[SizE-1]='.'; TagValuE[SizE-2]='.'; TagValuE[SizE-3]='.'; \ } \ } int make_id3v1_tag(apetag *mem_cnt, struct _id3v1Tag *m) { struct tag * framka; if (m == NULL) return ATL_BADARG; memset(m, '\0', sizeof(struct _id3v1Tag)); memcpy (m->magic,"TAG",3); COMPUTE_ID3V1_TAG(framka, "Title", 30, m->title); COMPUTE_ID3V1_TAG(framka, "Artist", 30, m->artist); COMPUTE_ID3V1_TAG(framka, "Album", 30, m->album); COMPUTE_ID3V1_TAG(framka, "Year", 4, m->year); if ((framka=apefrm_get(mem_cnt, "Track"))!=NULL) { m->comment[29]=(unsigned char) atoi(framka->value); m->comment[28]='\0'; COMPUTE_ID3V1_TAG(framka, "Comment", 28, m->comment); } else { COMPUTE_ID3V1_TAG(framka, "Comment", 30, m->comment); } return 0; } /* PL: silnik tego liba PL: %filename% jest w tej chwili tylko dla id3v2 f..k PL: %ape_mem_cnt% moze byc nie zainicjalizowany ale wtedy musi byc = NULL */ /** \brief read file and add frames \param mem_cnt object #apetag \param filename \param fp \param flag \return 0 - OK else check #atl_return */ int apetag_read_fp(apetag *mem_cnt, FILE * fp, char *filename, int flag) { int id3v1 = 0; int apeTag2 = 0; unsigned char *buff; struct _apetag_footer ape_footer; size_t savedFilePosition, buffLength; unsigned char *end; unsigned long tagCount; unsigned char *p; savedFilePosition = ftell(fp); id3v1 = is_id3v1(fp); if (mem_cnt == NULL) { PRINT_ERR( ">apetaglib>READ_FP>FATAL>apetag_init()\n"); fseek(fp, savedFilePosition, SEEK_SET); return ATL_NOINIT; } fseek(fp, id3v1 ? -128 - sizeof (ape_footer) : -sizeof (ape_footer), SEEK_END); if (sizeof (ape_footer) != fread(&ape_footer, 1, sizeof (ape_footer), fp)){ PRINT_ERR( "ERROR->libapetag->apetag_read_fp:fread1\n"); fseek(fp, savedFilePosition, SEEK_SET); return ATL_FREAD; } if (!(flag & DONT_READ_TAG_APE) && (memcmp(ape_footer.id, "APETAGEX", sizeof (ape_footer.id)) == 0)) { PRINT_D9(">apetaglib>READ_FP>>%s: ver %li len %li # %li fl %lx v1=%i v2=%i ape=%i[v%i]\n", filename, ape2long(ape_footer.version), ape2long(ape_footer.length), ape2long(ape_footer.tagCount), ape2long(ape_footer.flags), is_id3v1 (fp), is_id3v2 (fp), is_ape (fp), is_ape_ver (fp)); apeTag2 = ape2long(ape_footer.version); buffLength = is_ape(fp) + 128; buff = (unsigned char *) malloc(buffLength); if (buff == NULL) { PRINT_ERR( "ERROR->libapetag->apetag_read_fp:malloc\n"); return ATL_MALOC; } fseek(fp, id3v1 ? -ape2long(ape_footer.length) - 128 : -ape2long(ape_footer.length), SEEK_END); memset(buff, 0, buffLength); if (ape2long(ape_footer.length) != fread(buff, 1, ape2long(ape_footer.length), fp)) { PRINT_ERR( "ERROR->libapetag->apetag_read_fp:fread2\n"); fseek(fp, savedFilePosition, SEEK_SET); free(buff); return ATL_FREAD; } tagCount = ape2long(ape_footer.tagCount); end = buff + ape2long(ape_footer.length) - sizeof (ape_footer); for (p = buff; p < end && tagCount--;) { /* 8 = sizeof( sizeValue+flags ) */ unsigned long flag = ape2long(p + 4); unsigned long sizeValue = ape2long(p); unsigned long sizeName; char *name = p + 8; char *value; sizeName = strlen(p + 8); value = p + sizeName + 8 + 1; if (apeTag2 == 1000 && value[sizeValue - 1] == '\0') { libapetag_maloc_cont(mem_cnt, flag, sizeName, name, sizeValue - 1, value); } else { libapetag_maloc_cont(mem_cnt, flag, sizeName, name, sizeValue, value); } p += (sizeName + sizeValue + 8 + 1); } free(buff); } else { /* if no ape tag */ PRINT_D5(">apetaglib>READ_FP>>%s: v1=%i v2=%i ape=%i[v%i]\n", filename, is_id3v1 (fp), is_id3v2 (fp), is_ape (fp), is_ape_ver (fp)); } #ifdef ID3V2_READ if (!(flag & DONT_READ_TAG_ID3V2) && filename!=NULL && is_id3v2(fp)!=0) { readtag_id3v2(mem_cnt, filename); } #endif if (!(flag & DONT_READ_TAG_ID3V1) && (id3v1)) { readtag_id3v1_fp(mem_cnt, fp); } fseek(fp, savedFilePosition, SEEK_SET); return 0; } /* PL: wraper na apetag_read_fp PL: otwiera plik wczytuje co trzeba i zamyka PL: dobre do wczytywania informacji ktore sa potrzebne pozniej bez fatygi otwierania pliku */ /** \brief read file and add frames \param mem_cnt object #apetag \param filename file name \param flag \return 0 - OK else check #atl_return */ int apetag_read (apetag *mem_cnt, char *filename,int flag) { FILE *fp; if (mem_cnt==NULL) { PRINT_ERR(">apetaglib>READ>FATAL>apetag_init()\n"); return ATL_NOINIT; } fp = fopen (filename, "rb"); if (fp == NULL) return ATL_FOPEN; apetag_read_fp (mem_cnt, fp, filename,flag); fclose (fp); return 0; } /* PL: Funkcja dla qsorta ze specjalnymi wyjatkami PL: uzywana w apetag_save :NON_USER:!!! */ static int libapetag_qsort (struct tag **a, struct tag **b) { char *sorting[] = { "Artist", "Year", "Album", "Track", "Title", "Genre", NULL, NULL }; int n, m; if (!a || !b || !*a || !*b) { PRINT_ERR ("ERROR->libapetag->apetag_qsort:*a ||*b = NULL : FATAL PLEASE REPORT!!!\n"); return 0; } for (n = 0; sorting[n] != NULL; n++) { if (strcasecmp ((*a)->name, sorting[n]) == 0) break; } if (sorting[n] == NULL) n += (*a)->sizeValue + 1; /* n = max entries of sorting + size of tag */ for (m = 0; sorting[m] != NULL; m++) { if (strcasecmp ((*b)->name, sorting[m]) == 0) break; } if (sorting[m] == NULL) m += (*b)->sizeValue + 1; /* m = max entries */ if (n == m) return 0; if (n > m) return 1; else return -1; } #ifdef USE_CHSIZE #include #include #include /* on winblows we don't have truncate (and ftruncate) but have chsize() */ void truncate (char *filename, size_t fileSize) { int handle; handle = open (filename, O_RDWR | O_CREAT, S_IRUSR | S_IWUSR | S_IRGRP | S_IWGRP); if (handle != -1) { if (chsize (handle, fileSize) != 0) { PRINT_ERR ("Error truncatng file\n"); } close (handle); } } #endif /* PL: domyslne %flag% = APE_TAG_V2 + SAVE_NEW_OLD_APE_TAG */ /** \brief save apetag to file \param filename file name \param mem_cnt object #apetag \param flag flags for read/save \return 0 - OK else check #atl_return \warning for ape tag v 1 you must add frames in iso-1 for v 2 this must be in utf-8 \todo PL: v9 sprawdzac flagi w footer i na tej podstawie zmieniac skipBytes bez domniemywania ze v2 ma zawsze oba */ int apetag_save (char *filename, apetag *mem_cnt, int flag) { FILE *fp; struct _id3v1Tag id3v1_tag; int id3v1; int apeTag, saveApe2; int tagCount = 0; struct _apetag_footer ape_footer; long skipBytes; unsigned char *buff, *p; struct tag **mTag; size_t tagSSize = 32; int n; char temp[4]; if (mem_cnt==NULL) { PRINT_ERR("ERROR->apetaglib>apetag_save::apetag_init()\n"); return ATL_NOINIT; } fp = fopen (filename, "rb+"); if (fp == NULL) { PRINT_ERR ( "ERROR->apetaglib->apetag_save::fopen (r+)\n"); return ATL_FOPEN; } skipBytes = 0; id3v1 = is_id3v1 (fp); apeTag = is_ape (fp); saveApe2 = !(flag & APE_TAG_V1); // (flag & APE_TAG_V2) ? 1 : (flag & APE_TAG_V1); if (id3v1) { fseek (fp, -128, SEEK_END); fread (&id3v1_tag, 1, sizeof (struct _id3v1Tag), fp); skipBytes += id3v1; } skipBytes += apeTag; if (!(flag & SAVE_NEW_APE_TAG)) { apetag_read_fp (mem_cnt, fp, filename, flag); } mTag = (mem_cnt->tag); qsort( mTag , mem_cnt->countTag , sizeof(struct tag *), (int (*)(const void *,const void *))libapetag_qsort); for (n = 0; (mem_cnt->countTag) > n; n++) { if (mTag[n]->sizeValue != 0) { tagSSize += ((long) mTag[n]->sizeName + (long) mTag[n]->sizeValue); tagSSize += 4 + 4 + 1 + (saveApe2 ? 0 : 1); // flag & sizeValue & \0 } } if (!!(flag & SAVE_CREATE_ID3V1_TAG )) { make_id3v1_tag(mem_cnt, &id3v1_tag); tagSSize += 128; } //PRINT_D4 (">apetaglib>SAVE>>: size %li %i %i %i\n", tagSSize, // mem_cnt->countTag, flag, saveApe2); buff = (unsigned char *) malloc (tagSSize + (saveApe2 ? 32 : 0)); p = buff; if (buff == NULL) { PRINT_ERR ("ERROR->libapetag->apetag_save::malloc"); return ATL_MALOC; } memset (ape_footer.id, 0, sizeof (ape_footer)); memcpy (ape_footer.id, "APETAGEX", sizeof (ape_footer.id)); long2ape (ape_footer.flags, 0l); if (!!(flag & SAVE_CREATE_ID3V1_TAG )) long2ape (ape_footer.length, tagSSize-128); else long2ape (ape_footer.length, tagSSize); long2ape (ape_footer.tagCount, mem_cnt->countTag); long2ape (ape_footer.version, (saveApe2 ? 2000 : 1000)); if (saveApe2) { long2ape (ape_footer.flags, HEADER_THIS_IS + HEADER_IS + FOOTER_IS); memcpy (p, ape_footer.id, sizeof (ape_footer)); p += sizeof (ape_footer); } mTag = (mem_cnt->tag); for (n = 0; (mem_cnt->countTag) > n; n++) { if (saveApe2) { long2ape (temp, mTag[n]->sizeValue); } else { /* TODO:convert UTF8 to ASCII mTag[n]->value */ long2ape (temp, (mTag[n]->sizeValue) + 1); } if (mTag[n]->sizeValue != 0) { memcpy (p, temp, 4); p += 4; long2ape (temp, (saveApe2!=0) ? mTag[n]->flags : 0l ); memcpy (p, temp, 4); p += 4; memcpy (p, mTag[n]->name, mTag[n]->sizeName); p += mTag[n]->sizeName; memcpy (p, "\0", 1); p++; memcpy (p, mTag[n]->value, mTag[n]->sizeValue); p += mTag[n]->sizeValue; if (!saveApe2) { memcpy (p, "\0", 1); p++; } tagCount++; } } /* for */ if (saveApe2) long2ape (ape_footer.flags, FOOTER_THIS_IS + FOOTER_IS + HEADER_IS); memcpy (p, ape_footer.id, sizeof (ape_footer)); p += sizeof (ape_footer); if (!!(flag & SAVE_CREATE_ID3V1_TAG )) { memcpy (p, &id3v1_tag , sizeof (struct _id3v1Tag)); } /* write tag to file and truncate */ if (!(flag & SAVE_FAKE_SAVE)) { size_t fileSize; size_t newFileSize; size_t writedBytes; fseek (fp, 0, SEEK_END); fileSize = ftell (fp); fseek (fp, fileSize - skipBytes, SEEK_SET); if (tagCount != 0) { newFileSize = (fileSize - skipBytes + tagSSize + (saveApe2 ? 32 : 0)); writedBytes = fwrite (buff, 1, tagSSize + (saveApe2 ? 32 : 0), fp); if (writedBytes != tagSSize + (saveApe2 ? 32 : 0)) { PRINT_ERR ("FATAL_ERROR->libapetag->apetag_save::fwrite [data lost]"); fclose (fp); free (buff); return ATL_FWRITE; } fseek (fp, newFileSize, SEEK_SET); PRINT_D4 (">apetaglib>SAVE>> write:%i == tag:%i file: %i->%i\n", writedBytes, tagSSize + (saveApe2 ? 32 : 0), fileSize, newFileSize); } else { newFileSize = (fileSize - skipBytes); } fflush (fp); fclose (fp); /* ftruncate don't work */ truncate (filename, newFileSize); } else { /* !!SAVE_FAKE_SAVE */ libapetag_print_mem_cnt (mem_cnt); } free (buff); return 0; } madman-0.93/libapetag/id3v2_read.c0000644000175000001440000003673410053135241016501 0ustar akusers00000000000000/******************************************************************** * * Copyright (c) 2002 Artur Polaczynski (Ar't) All rights reserved. * LGPL-2.1 * $ArtId: id3v2_read.c,v 1.16 2003/04/13 11:24:10 art Exp $ ********************************************************************/ /* * This program 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 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 Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser 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 ID3V2_READ #include #include #include #include #include #include #include #include #include #ifndef __BORLANDC__ # include #endif #include "apetaglib.h" #include struct id3vtwo2ape { ID3_FrameID frame; //ID3FID_ALBUM etc ID3_FieldID field_type; //ID3FN_TEXT etc const char *APEName; int special; // 0-no 1-??? }; #define APETAG_TYPE_COMMENT 1 #define APETAG_TYPE_USER 2 #define APETAG_TYPE_GENRE 3 struct id3vtwo2ape convert[] = { {ID3FID_ALBUM, ID3FN_TEXT,APE_TAG_FIELD_ALBUM,0}, {ID3FID_BAND, ID3FN_TEXT,"Band",0}, {ID3FID_BPM, ID3FN_TEXT,"BPM",0}, {ID3FID_COMPOSER, ID3FN_TEXT,APE_TAG_FIELD_COMPOSER,0}, {ID3FID_CONDUCTOR, ID3FN_TEXT,APE_TAG_FIELD_CONDUCTOR,0}, {ID3FID_CONTENTGROUP, ID3FN_TEXT,"Content Group",0}, {ID3FID_COPYRIGHT, ID3FN_TEXT,APE_TAG_FIELD_COPYRIGHT,0}, {ID3FID_DATE, ID3FN_TEXT,APE_TAG_FIELD_RECORDDATE,0}, {ID3FID_ENCODEDBY, ID3FN_TEXT,"Encoded By",0}, {ID3FID_ENCODERSETTINGS, ID3FN_TEXT,"Encoder",0}, {ID3FID_FILEOWNER, ID3FN_TEXT,"File Owner",0}, {ID3FID_FILETYPE, ID3FN_TEXT,"File Type",0}, {ID3FID_INITIALKEY, ID3FN_TEXT,"Initial Key",0}, {ID3FID_ISRC, ID3FN_TEXT,APE_TAG_FIELD_ISRC,0}, {ID3FID_LANGUAGE, ID3FN_TEXT,"Language",0}, {ID3FID_LEADARTIST, ID3FN_TEXT,APE_TAG_FIELD_ARTIST,0}, {ID3FID_LYRICIST, ID3FN_TEXT,"Lyricist",0}, {ID3FID_MEDIATYPE, ID3FN_TEXT,APE_TAG_FIELD_MEDIA,0}, {ID3FID_MIXARTIST, ID3FN_TEXT,"Mix Artist",0}, {ID3FID_NETRADIOOWNER, ID3FN_TEXT,"Internet Radio Owner",0}, {ID3FID_NETRADIOSTATION, ID3FN_TEXT,"Internet Radio Station",0}, {ID3FID_ORIGALBUM, ID3FN_TEXT,"Original Album",0}, {ID3FID_ORIGARTIST, ID3FN_TEXT,"Original Artist",0}, {ID3FID_ORIGFILENAME, ID3FN_TEXT,"Original Filename",0}, {ID3FID_ORIGLYRICIST, ID3FN_TEXT,"Original Lyricist",0}, {ID3FID_ORIGYEAR, ID3FN_TEXT,"Original Artist",0}, {ID3FID_PARTINSET, ID3FN_TEXT,"Part",0}, {ID3FID_PLAYLISTDELAY, ID3FN_TEXT,"Playlist Delay",0}, {ID3FID_PUBLISHER, ID3FN_TEXT,APE_TAG_FIELD_PUBLISHER,0}, {ID3FID_RECORDINGDATES, ID3FN_TEXT,APE_TAG_FIELD_RECORDDATE,0}, {ID3FID_SIZE, ID3FN_TEXT,"Size",0}, // {ID3FID_SONGLEN, ID3FN_TEXT,"Song Length",0}, // don't like this in apetag {ID3FID_SUBTITLE, ID3FN_TEXT,APE_TAG_FIELD_SUBTITLE,0}, {ID3FID_TIME, ID3FN_TEXT,"Time",0}, {ID3FID_TITLE, ID3FN_TEXT,APE_TAG_FIELD_TITLE,0}, {ID3FID_TRACKNUM, ID3FN_TEXT,APE_TAG_FIELD_TRACK,0}, {ID3FID_YEAR, ID3FN_TEXT,APE_TAG_FIELD_YEAR,0}, {ID3FID_WWWAUDIOFILE, ID3FN_URL ,APE_TAG_FIELD_FILE_URL,0}, {ID3FID_WWWARTIST, ID3FN_URL ,APE_TAG_FIELD_ARTIST_URL,0}, {ID3FID_WWWAUDIOSOURCE, ID3FN_URL ,"Source URL",0}, {ID3FID_WWWCOMMERCIALINFO, ID3FN_URL ,APE_TAG_FIELD_BUY_URL,0}, {ID3FID_WWWCOPYRIGHT, ID3FN_URL ,APE_TAG_FIELD_COPYRIGHT_URL,0}, {ID3FID_WWWPUBLISHER, ID3FN_URL ,APE_TAG_FIELD_PUBLISHER_URL,0}, {ID3FID_WWWPAYMENT, ID3FN_URL ,"Payment",0}, {ID3FID_WWWRADIOPAGE, ID3FN_URL ,"Web Radio URL",0}, {ID3FID_COMMENT, ID3FN_TEXT,APE_TAG_FIELD_COMMENT, APETAG_TYPE_COMMENT}, {ID3FID_UNSYNCEDLYRICS, ID3FN_TEXT,APE_TAG_FIELD_LYRICS, APETAG_TYPE_COMMENT}, {ID3FID_USERTEXT, ID3FN_TEXT,"dummy", APETAG_TYPE_USER}, {ID3FID_WWWUSER, ID3FN_URL ,APE_TAG_FIELD_RELATED_URL, APETAG_TYPE_USER}, {ID3FID_CONTENTTYPE, ID3FN_TEXT,APE_TAG_FIELD_GENRE, APETAG_TYPE_GENRE}, // {ID3FID_PICTURE, ID3FN_DATA,,0}, // {ID3FID_SYNCEDLYRICS, ID3FN_DATA,APE_TAG_FIELD_LYRICS,0}, // {ID3FID_INVOLVEDPEOPLE, ID3FN_DATA,"Involved People",0}, // type ? // {ID3FID_CDID, ID3FN_DATA,"CDID",0}, // ??? // {ID3FID_TERMSOFUSE, ID3FN_TEXT,"Terms Of Use",0}, // type ? }; int libapetag_convertID3v2toAPE(const ID3Frame * frame, char **item_, size_t *item_len, char **value_, size_t *value_len, unsigned long *flags); /* use ALOCATE to alocate dynamic memory for frame value this check size of frame and alocate mem and zeroed this mem */ #define ALOCATE(FielD,ValuE,SizeValuE) \ SizeValuE = ID3Field_Size(FielD); \ ValuE = (SizeValuE!=0) ? (char *) malloc((SizeValuE)+1) : NULL ; \ if ((SizeValuE)!=0) ValuE[0] = '\0'; /* ALOCATE_ITEM its the same ase ALOCATE but for frame name (Item) */ #define ALOCATE_ITEM(IteM, APENamE, ItemSizE) \ ItemSizE = strlen(APENamE) ; \ IteM = (ItemSizE!=0) ? (char *) malloc((ItemSizE)+1) : NULL ; \ if ((ItemSizE)!=0) IteM[0] = '\0'; int libapetag_convertID3v2toAPE (const ID3Frame * frame, char **item_, size_t * item_len, char **value_, size_t * value_len, unsigned long *flags) { ID3Field *text; ID3Field *desc; ID3Field *url; // ID3Field *bin; // will be implemented some day char *item = NULL; char *value = NULL; ID3_FrameID frameid = ID3Frame_GetID (frame); unsigned int i; *flags = ITEM_TEXT; for (i = 0; i < sizeof (convert) / sizeof (struct id3vtwo2ape); i++) if (frameid == convert[i].frame) break; if (convert[i].field_type == ID3FN_TEXT) { switch (convert[i].special) { case APETAG_TYPE_COMMENT: /* Comments and unsynced lyrics */ if ((text = ID3Frame_GetField(frame, ID3FN_TEXT)) != NULL) { ALOCATE(text, value, *value_len); ID3Field_GetASCII(text, value, *value_len); } ALOCATE_ITEM(item, convert[i].APEName, *item_len); strncpy(item, convert[i].APEName, *item_len); item[*item_len]='\0'; //break; if ((text = ID3Frame_GetField (frame, ID3FN_DESCRIPTION)) != NULL) { char *value_ds=NULL; int value_len2; if (ID3Field_Size(text) != 0) { ALOCATE(text, value_ds, value_len2); ID3Field_GetASCII(text, value_ds, value_len2); if ( strcmp(value_ds, STR_V1_COMMENT_DESC) == 0 ) { value_len2 = 0; value[0]='\0'; } else { item = (char *) realloc( item, (*item_len) + value_len2 + 3); item[(*item_len)++]='-'; item[(*item_len)]='\0'; strncpy(item + (*item_len),value_ds ,(value_len2 + 1)); (*item_len)+=value_len2; } free(value_ds); } } break; case APETAG_TYPE_USER: /* User texts */ if ((text = ID3Frame_GetField(frame, ID3FN_TEXT)) != NULL) { ALOCATE(text, value, *value_len); ID3Field_GetASCII(text, value, *value_len); } if ((desc = ID3Frame_GetField(frame, ID3FN_DESCRIPTION)) != NULL) { ALOCATE(desc, item, *item_len); ID3Field_GetASCII(desc, item, *item_len); } break; case APETAG_TYPE_GENRE: /* genre */ if ((text = ID3Frame_GetField(frame, ID3FN_TEXT)) != NULL) { char *p; int j; ALOCATE(text, value, *value_len); ID3Field_GetASCII(text, value, *value_len); ALOCATE_ITEM(item, convert[i].APEName, *item_len); strncpy(item, convert[i].APEName, *item_len); value[*value_len]='\0'; p = value; if (*p == '(') { p++; while (*p && (*p >= '0' && *p <= '9')) p++; if (*p && *p == ')') { p++; } else { p = value; } *value_len -= (p-value); // corect lenght of frame if (*p != '\0') { // copy in place for (j = 0; *p != '\0'; j++) { value[j] = *p; p++; } value[j] = '\0'; } } } break; default: /* normal text tags */ if ((text = ID3Frame_GetField(frame, ID3FN_TEXT)) != NULL) { ALOCATE(text, value, *value_len); ID3Field_GetASCII(text, value, *value_len); ALOCATE_ITEM(item, convert[i].APEName, *item_len); strncpy(item, convert[i].APEName, *item_len); } break; } /* <- switch( convert[i].special ) */ item[*item_len]='\0'; value[*value_len]='\0'; } else if (convert[i].field_type == ID3FN_URL) { *flags = ITEM_URL; /* TODO: set ape_tag_URL in flag */ /* user url */ if (convert[i].special == APETAG_TYPE_USER) { if ((url = ID3Frame_GetField(frame, ID3FN_URL)) != NULL) { ALOCATE(url, value, *value_len); ID3Field_GetASCII(url, value, *value_len); } if ((desc = ID3Frame_GetField(frame, ID3FN_DESCRIPTION)) != NULL) { ALOCATE(desc, item, *item_len); ID3Field_GetASCII(desc, item, *item_len); } /* normal url */ } else { if ((url = ID3Frame_GetField (frame, ID3FN_URL)) != NULL) { ALOCATE(url, value, *value_len); ID3Field_GetASCII(url, value, *value_len); ALOCATE_ITEM(item, convert[i].APEName, *item_len); strncpy(item, convert[i].APEName, *item_len); } } item[*item_len]='\0'; value[*value_len]='\0'; } else { //convert[i].field_type item = NULL; value = NULL; PRINT_D (">id3v2_read>other\n"); } *item_ = item; *value_ = value; if (!(value==NULL || (*value_len)==0) && value[(*value_len)-1]=='\0') (*value_len)--; return 0; } // Reads ID3v2.x tag // idea of this come from "tag" by Case int readtag_id3v2 ( apetag *mem_cnt, char* fileName ) { ID3Tag* tag; ID3Frame* frame; ID3TagIterator* iter; char* item = NULL; int itemSize; char* value = NULL; int valueSize; unsigned long flags; // first - check of id3tag v2 and init if ( (tag = ID3Tag_New ()) == NULL ) return 1; // on some casses its weerrryyy slooowwwwlyyy 65k file take 2-5 sec ID3Tag_LinkWithFlags ( tag, fileName, ID3TT_ID3V2 ); if ( tag == NULL ) { ID3Tag_Delete (tag); return 0; } if ( !ID3Tag_HasTagType ( tag, ID3TT_ID3V2 ) ) { ID3Tag_Delete (tag); return 0; } if ( (iter = ID3Tag_CreateIterator (tag)) == NULL ) { ID3Tag_Delete (tag); return 0; } while ( (frame = ID3TagIterator_GetNext (iter)) != NULL ) { libapetag_convertID3v2toAPE ( frame, &item, &itemSize, &value, &valueSize, &flags); if ( !item || !value || item[0] == '\0' || value[0] == '\0' ) continue; if ( !value || value[0] != '\0' ) { PRINT_D4(">id3v2_read>[i%i]%s: [v%i]'%s'\n",itemSize,item,valueSize,value); if ( apefrm_getstr (mem_cnt, item) == NULL ) /* noreplece !!! */ apefrm_add_bin (mem_cnt, flags, itemSize, item, valueSize ,value); } free ( value ); free ( item ); } ID3TagIterator_Delete (iter); ID3Tag_Delete (tag); return 0; } #endif // ID3V2_READ #if 0 static ID3_FrameDef ID3_FrameDefs[] = { /* frames to implement */ // short long // frame id id id field defs description {ID3FID_AUDIOCRYPTO, "CRA", "AENC",ID3FD_Unimplemented, "Audio encryption"}, {ID3FID_BUFFERSIZE, "BUF", "RBUF",ID3FD_Unimplemented, "Recommended buffer size"}, {ID3FID_CDID, "MCI", "MCDI",ID3FD_Unimplemented, "Music CD identifier"}, {ID3FID_COMMERCIAL, "" , "COMR",ID3FD_Unimplemented, "Commercial"}, {ID3FID_CRYPTOREG, "" , "ENCR",ID3FD_Registration, "Encryption method registration"}, {ID3FID_EQUALIZATION, "EQU", "EQUA",ID3FD_Unimplemented, "Equalization"}, {ID3FID_EVENTTIMING, "ETC", "ETCO",ID3FD_Unimplemented, "Event timing codes"}, {ID3FID_GENERALOBJECT, "GEO", "GEOB",ID3FD_GEO, "General encapsulated object"}, {ID3FID_GROUPINGREG, "" , "GRID",ID3FD_Registration, "Group identification registration"}, {ID3FID_INVOLVEDPEOPLE, "IPL", "IPLS",ID3FD_InvolvedPeople,"Involved people list"}, {ID3FID_LINKEDINFO, "LNK", "LINK",ID3FD_LinkedInfo, "Linked information"}, {ID3FID_METACOMPRESSION, "CDM", "" ,ID3FD_CDM, "Compressed data meta frame"}, {ID3FID_METACRYPTO, "CRM", "" ,ID3FD_Unimplemented, "Encrypted meta frame"}, {ID3FID_MPEGLOOKUP, "MLL", "MLLT",ID3FD_Unimplemented, "MPEG location lookup table"}, {ID3FID_OWNERSHIP, "" , "OWNE",ID3FD_Unimplemented, "Ownership frame"}, {ID3FID_PICTURE, "PIC", "APIC",ID3FD_Picture, "Attached picture"}, {ID3FID_PLAYCOUNTER, "CNT", "PCNT",ID3FD_PlayCounter, "Play counter"}, {ID3FID_POPULARIMETER, "POP", "POPM",ID3FD_Popularimeter, "Popularimeter"}, {ID3FID_POSITIONSYNC, "" , "POSS",ID3FD_Unimplemented, "Position synchronisation frame"}, {ID3FID_PRIVATE, "" , "PRIV",ID3FD_Private, "Private frame"}, {ID3FID_REVERB, "REV", "RVRB",ID3FD_Unimplemented, "Reverb"}, {ID3FID_SYNCEDLYRICS, "SLT", "SYLT",ID3FD_SyncLyrics, "Synchronized lyric/text"}, {ID3FID_SYNCEDTEMPO, "STC", "SYTC",ID3FD_Unimplemented, "Synchronized tempo codes"}, {ID3FID_TERMSOFUSE, "" , "USER",ID3FD_TermsOfUse, "Terms of use"}, {ID3FID_UNIQUEFILEID, "UFI", "UFID",ID3FD_UFI, "Unique file identifier"}, {ID3FID_VOLUMEADJ, "RVA", "RVAD",ID3FD_Unimplemented, "Relative volume adjustment"}, }; #endif // 0 madman-0.93/libapetag/info_mac.c0000644000175000001440000001320610053135241016317 0ustar akusers00000000000000/******************************************************************** * * Copyright (c) 2002 Artur Polaczynski (Ar't) All rights reserved. * LGPL-2.1 * $ArtId: info_mac.c,v 1.15 2003/04/13 11:24:10 art Exp $ ********************************************************************/ /* * This program 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 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 Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser 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 "info_mac.h" #include "is_tag.h" #define MAC_FORMAT_FLAG_8_BIT 1 // 8-bit wave #define MAC_FORMAT_FLAG_CRC 2 // new CRC32 error detection #define MAC_FORMAT_FLAG_HAS_PEAK_LEVEL 4 // u-long Peak_Level after the header #define MAC_FORMAT_FLAG_24_BIT 8 // 24-bit wave #define MAC_FORMAT_FLAG_HAS_SEEK_ELEMENTS 16 // number of seek elements after the peak level #define MAC_FORMAT_FLAG_CREATE_WAV_HEADER 32 // wave header not stored struct macHeader { char id[4]; // should equal 'MAC ' unsigned short ver; // version number * 1000 (3.81 = 3810) unsigned short compLevel; // the compression level unsigned short formatFlags; // any format flags (for future use) unsigned short channels; // the number of channels (1 or 2) unsigned long sampleRate; // the sample rate (typically 44100) unsigned long headerBytesWAV; // the bytes after the MAC header that compose the WAV header unsigned long terminatingBytesWAV; // the bytes after that raw data (for extended info) unsigned long totalFrames; // the number of frames in the file unsigned long finalFrameBlocks; // the number of samples in the final frame unsigned long peakLevel; unsigned short seekElements; }; // local prototypes static int monkey_samples_per_frame(unsigned int versionid, unsigned int compressionlevel); static const char * monkey_stringify(unsigned int profile); static const char * monkey_stringify(unsigned int profile) { static const char na[] = "unknown"; static const char *Names[] = { "Fast", "Normal", "High", "Extra-High", "Insane" }; unsigned int profile2 = profile/1000; return (profile2 >= sizeof (Names) / sizeof (*Names)) ? na : Names[(profile2-1)]; } static int monkey_samples_per_frame(unsigned int versionid, unsigned int compressionlevel) { if (versionid >= 3950) { return 294912; // 73728 * 4 } else if (versionid >= 3900) { return 73728; } else if ((versionid >= 3800) && (compressionlevel == COMPRESSION_LEVEL_EXTRA_HIGH)) { return 73728; } else { return 9216; } } /* return 0; Info has all info return 1; File not found return 2; no MAC file */ int info_mac_read(const char *fn, StreamInfoMac * Info) { unsigned int HeaderData[32]; FILE *tmpFile = NULL; long SkipSizeID3; struct macHeader * header; // load file tmpFile = fopen(fn, "rb"); if (tmpFile == NULL) return 1; // file not found or read-protected // skip id3v2 SkipSizeID3 = is_id3v2(tmpFile); fseek(tmpFile, SkipSizeID3, SEEK_SET); fread((void *) HeaderData, sizeof (int), 16, tmpFile); fseek(tmpFile, 0, SEEK_END); Info->FileSize = ftell(tmpFile); fclose(tmpFile); if (0 != memcmp(HeaderData, "MAC", 3)) return 2; // no monkeyAudio file header= (struct macHeader *) HeaderData; Info->Version = Info->EncoderVersion = header->ver; Info->Channels = header->channels; Info->SampleFreq = header->sampleRate; Info->Flags = header->formatFlags; Info->SamplesPerFrame = monkey_samples_per_frame(header->ver, header->compLevel); Info->BitsPerSample = (header->formatFlags & MAC_FORMAT_FLAG_8_BIT) ? 8 : ((header->formatFlags & MAC_FORMAT_FLAG_24_BIT) ? 24 : 16); Info->PeakLevel = header->peakLevel; // Info->PeakRatio = Info->PakLevel / pow(2, Info->bitsPerSample - 1); Info->Frames = header->totalFrames; Info->Samples = (Info->Frames - 1) * Info->SamplesPerFrame + header->finalFrameBlocks; Info->Duration = Info->SampleFreq > 0 ? ((float)Info->Samples / Info->SampleFreq)*1000 : 0; Info->Compresion = header->compLevel; Info->CompresionName = monkey_stringify(Info->Compresion); Info->UncompresedSize = Info->Samples * Info->Channels * (Info->BitsPerSample / 8); Info->CompresionRatio = (Info->UncompresedSize + header->headerBytesWAV) > 0 ? Info->FileSize / (float) (Info->UncompresedSize + header->headerBytesWAV) : 0. ; Info->Bitrate = Info->Duration > 0 ? (((Info->Samples * Info->Channels * Info->BitsPerSample) / (float) Info->Duration) * Info->CompresionRatio) * 1000 : 0; Info->PeakRatio=Info->ByteLength=0; return 0; } madman-0.93/libapetag/info_mpc.c0000644000175000001440000001534210053135241016341 0ustar akusers00000000000000/******************************************************************** * * Copyright (c) 2002 Artur Polaczynski (Ar't) All rights reserved. * LGPL-2.1 * $ArtId: info_mpc.c,v 1.12 2003/04/13 11:24:10 art Exp $ ********************************************************************/ /* * This program 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 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 Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser 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 */ /* Some portions of code or/and ideas come from winamp plugins, xmms plugins, mppdec decoder thanks: -Frank Klemm -Andree Buschmann -Thomas Juerges */ #include #include #include #include "info_mpc.h" #include "is_tag.h" /* *.MPC,*.MP+,*.MPP */ static const char * profile_stringify(unsigned int profile); // profile is 0...15, where 7...13 is used static const char * profile_stringify(unsigned int profile) // profile is 0...15, where 7...13 is used { static const char na[] = "n.a."; static const char *Names[] = { na, "Experimental", na, na, na, na, na, "Telephone", "Thumb", "Radio", "Standard", "Xtreme", "Insane", "BrainDead", "BrainDead+", "BrainDead++" }; return profile >= sizeof (Names) / sizeof (*Names) ? na : Names[profile]; } int read_file_header_fp(FILE *fp, StreamInfoMpc * Info) { return 0; } /* return 0; Info has all info return 1; File not found return 2; no Mpc file */ int info_mpc_read(const char *fn, StreamInfoMpc * Info) { unsigned int HeaderData[16]; FILE *tmpFile = NULL; long SkipSizeID3; // load file tmpFile = fopen(fn, "rb"); if (tmpFile == NULL) return 1; // file not found or read-protected // skip id3v2 SkipSizeID3=is_id3v2(tmpFile); fseek(tmpFile,SkipSizeID3 , SEEK_SET); fread((void *) HeaderData, sizeof (int), 16, tmpFile); fseek(tmpFile, 0, SEEK_END); Info->FileSize=ftell(tmpFile); // stream size Info->ByteLength = Info->FileSize-is_id3v1(tmpFile)-is_ape(tmpFile)-SkipSizeID3; fclose(tmpFile); if (0 != memcmp(HeaderData, "MP+", 3)) return 2; // no musepack file Info->StreamVersion = HeaderData[0] >> 24; if (Info->StreamVersion >= 7) { const long samplefreqs[4] = { 44100, 48000, 37800, 32000 }; // read the file-header (SV7 and above) Info->Bitrate = 0; Info->Frames = HeaderData[1]; Info->SampleFreq = samplefreqs[(HeaderData[2] >> 16) & 0x0003]; Info->MaxBand = (HeaderData[2] >> 24) & 0x003F; Info->MS = (HeaderData[2] >> 30) & 0x0001; Info->Profile = (HeaderData[2] << 8) >> 28; Info->IS = (HeaderData[2] >> 31) & 0x0001; Info->BlockSize = 1; Info->EncoderVersion = (HeaderData[6] >> 24) & 0x00FF; Info->Channels = 2; // gain Info->EstPeakTitle = HeaderData[2] & 0xFFFF; // read the ReplayGain data Info->GainTitle = (HeaderData[3] >> 16) & 0xFFFF; Info->PeakTitle = HeaderData[3] & 0xFFFF; Info->GainAlbum = (HeaderData[4] >> 16) & 0xFFFF; Info->PeakAlbum = HeaderData[4] & 0xFFFF; // gaples Info->IsTrueGapless = (HeaderData[5] >> 31) & 0x0001; // true gapless: used? Info->LastFrameSamples = (HeaderData[5] >> 20) & 0x07FF; // true gapless: valid samples for last frame if (Info->EncoderVersion == 0) { sprintf(Info->Encoder, "<= 1.05"); // Buschmann 1.7.x, Klemm <= 1.05 } else { switch (Info->EncoderVersion % 10) { case 0: sprintf(Info->Encoder, "%u.%u", Info->EncoderVersion / 100, Info->EncoderVersion / 10 % 10); break; case 2: case 4: case 6: case 8: sprintf(Info->Encoder, "%u.%02u Beta", Info->EncoderVersion / 100, Info->EncoderVersion % 100); break; default: sprintf(Info->Encoder, "%u.%02u Alpha", Info->EncoderVersion / 100, Info->EncoderVersion % 100); break; } } // estimation, exact value needs too much time Info->Bitrate = (long) (Info->ByteLength) * 8. * Info->SampleFreq / (1152 * Info->Frames - 576); } else { // read the file-header (SV6 and below) Info->Bitrate = ((HeaderData[0] >> 23) & 0x01FF) * 1000; // read the file-header (SV6 and below) Info->MS = (HeaderData[0] >> 21) & 0x0001; Info->IS = (HeaderData[0] >> 22) & 0x0001; Info->StreamVersion = (HeaderData[0] >> 11) & 0x03FF; Info->MaxBand = (HeaderData[0] >> 6) & 0x001F; Info->BlockSize = (HeaderData[0]) & 0x003F; Info->Profile = 0; //gain Info->GainTitle = 0; // not supported Info->PeakTitle = 0; Info->GainAlbum = 0; Info->PeakAlbum = 0; //gaples Info->LastFrameSamples = 0; Info->IsTrueGapless = 0; if (Info->StreamVersion >= 5) Info->Frames = HeaderData[1]; // 32 bit else Info->Frames = (HeaderData[1] >> 16); // 16 bit Info->EncoderVersion = 0; Info->Encoder[0] = '\0'; #if 0 if (Info->StreamVersion == 7) return ERROR_CODE_SV7BETA; // are there any unsupported parameters used? if (Info->Bitrate != 0) return ERROR_CODE_CBR; if (Info->IS != 0) return ERROR_CODE_IS; if (Info->BlockSize != 1) return ERROR_CODE_BLOCKSIZE; #endif if (Info->StreamVersion < 6) // Bugfix: last frame was invalid for up to SV5 Info->Frames -= 1; Info->SampleFreq = 44100; // AB: used by all files up to SV7 Info->Channels = 2; } Info->ProfileName=profile_stringify(Info->Profile); Info->Duration = (int) (Info->Frames * 1152 / (Info->SampleFreq/1000.0)); return 0; } madman-0.93/libapetag/is_tag.c0000644000175000001440000001137310053135241016015 0ustar akusers00000000000000/******************************************************************** * * Copyright (c) 2002 Artur Polaczynski (Ar't) All rights reserved. * LGPL-2.1 * $ArtId: is_tag.c,v 1.10 2003/04/16 21:06:27 art Exp $ ********************************************************************/ /* * This program 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 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 Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser 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 #include "is_tag.h" unsigned long is_tag_ape2long (unsigned char *p); /* PL: czy dany plik ma taga odpowiednio id3v1, id3v2 i ape ??? PL: nie zmienia pozycji w pliku !!! */ /** return size of all id3v1 tags (some bugy tagers add this again and again tag) 0 no tag at all \param fp File pointer \return Return size of id3v1 tag (in bytes) 0 no tag at all */ int is_id3v1 (FILE * fp) { int n=0; char buf[16]; size_t savedFilePosition; savedFilePosition = ftell (fp); fseek (fp, 0, SEEK_END); do { n++; memset (buf, 0, sizeof (buf)); fseek (fp, ((-128)*n) - 3 , SEEK_END); fread (&buf, 1, sizeof (buf), fp); if (memcmp (buf, "APETAGEX",8) == 0) /*APE.TAG.EX*/ break; } while (memcmp (buf+3, "TAG", 3) == 0); fseek (fp, savedFilePosition, SEEK_SET); return (n-1)*128; } /** return size of tag id3v2 on begining of file. check for buggy tagers (2 or more tags) \param fp File pointer \return Return size of id3v2 tag (in bytes) (some bugy tagers add this again and again ) 0 no tag at all */ int is_id3v2 (FILE * fp) { char buf[16]; size_t savedFilePosition; long id3v2size=0; savedFilePosition = ftell (fp); fseek (fp, 0, SEEK_SET); do { memset (buf, 0, sizeof (buf)); fseek (fp, id3v2size, SEEK_SET); fread (&buf, 1, sizeof (buf), fp); if (memcmp (buf, "ID3", 3) != 0) { break; } /* ID3v2 tag skipeer $49 44 33 yy yy xx zz zz zz zz [zz size + this 10 bytes] */ id3v2size += 10 + (((long) (buf[9])) | ((long) (buf[8]) << 7) | ((long) (buf[7]) << 14) | ((long) (buf[6]) << 21)); } while(memcmp (buf, "ID3", 3) == 0); fseek (fp, savedFilePosition, SEEK_SET); return (int) id3v2size; } /** return 0 or 1000 or 2000 this is version of ape tag 0 no tag \param fp File pointer \return Version of ape tag if any, else 0 */ int is_ape_ver (FILE * fp) { char unsigned buf[32]; size_t savedFilePosition; savedFilePosition = ftell (fp); memset (buf, 0, sizeof (buf)); fseek (fp, (is_id3v1 (fp) ? -32 - 128 : -32), SEEK_END); fread (&buf, 1, sizeof (buf), fp); if (memcmp (buf, "APETAGEX", 8) != 0) { fseek (fp, savedFilePosition, SEEK_SET); return 0; } fseek (fp, savedFilePosition, SEEK_SET); return (int) is_tag_ape2long (buf + 8); } #define IS_TAG_FOOTER_NOT 0x40000000 /** return size of ape tag id3v1 is not counting \param fp File pointer \return Size of ape tag if any, else 0 */ int is_ape (FILE * fp) { char unsigned buf[32]; size_t savedFilePosition; savedFilePosition = ftell (fp); memset (buf, 0, sizeof (buf)); fseek (fp, (is_id3v1 (fp) ? -32 - 128 : -32), SEEK_END); fread (&buf, 1, sizeof (buf), fp); if (memcmp (buf, "APETAGEX", 8) != 0) { fseek (fp, savedFilePosition, SEEK_SET); return 0; } fseek (fp, savedFilePosition, SEEK_SET); /* WARNING! macabra code */ return (int) (is_tag_ape2long (buf + 8 + 4) + ( ( (is_tag_ape2long (buf + 8) == 2000) && !(is_tag_ape2long (buf + 8 + 4 + 8) & IS_TAG_FOOTER_NOT) ) ? 32 : 0 ) /* footer size = 32 */ ); } unsigned long is_tag_ape2long (unsigned char *p) { return (((unsigned long) p[0] << 0) | ((unsigned long) p[1] << 8) | ((unsigned long) p[2] << 16) | ((unsigned long) p[3] << 24) ); } madman-0.93/libapetag/SConscript0000644000175000001440000000025510053135242016413 0ustar akusers00000000000000Import( "env" ) myenv = env.Copy() myenv.StaticLibrary( target = "madmanapetag", source = [ "apetaglib.c", "info_mac.c", "is_tag.c", "id3v2_read.c", "info_mpc.c" ] ) madman-0.93/expat/0000755000175000001440000000000010053135242013570 5ustar akusers00000000000000madman-0.93/expat/ascii.h0000644000175000001440000000342510053135241015034 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ #define ASCII_A 0x41 #define ASCII_B 0x42 #define ASCII_C 0x43 #define ASCII_D 0x44 #define ASCII_E 0x45 #define ASCII_F 0x46 #define ASCII_G 0x47 #define ASCII_H 0x48 #define ASCII_I 0x49 #define ASCII_J 0x4A #define ASCII_K 0x4B #define ASCII_L 0x4C #define ASCII_M 0x4D #define ASCII_N 0x4E #define ASCII_O 0x4F #define ASCII_P 0x50 #define ASCII_Q 0x51 #define ASCII_R 0x52 #define ASCII_S 0x53 #define ASCII_T 0x54 #define ASCII_U 0x55 #define ASCII_V 0x56 #define ASCII_W 0x57 #define ASCII_X 0x58 #define ASCII_Y 0x59 #define ASCII_Z 0x5A #define ASCII_a 0x61 #define ASCII_b 0x62 #define ASCII_c 0x63 #define ASCII_d 0x64 #define ASCII_e 0x65 #define ASCII_f 0x66 #define ASCII_g 0x67 #define ASCII_h 0x68 #define ASCII_i 0x69 #define ASCII_j 0x6A #define ASCII_k 0x6B #define ASCII_l 0x6C #define ASCII_m 0x6D #define ASCII_n 0x6E #define ASCII_o 0x6F #define ASCII_p 0x70 #define ASCII_q 0x71 #define ASCII_r 0x72 #define ASCII_s 0x73 #define ASCII_t 0x74 #define ASCII_u 0x75 #define ASCII_v 0x76 #define ASCII_w 0x77 #define ASCII_x 0x78 #define ASCII_y 0x79 #define ASCII_z 0x7A #define ASCII_0 0x30 #define ASCII_1 0x31 #define ASCII_2 0x32 #define ASCII_3 0x33 #define ASCII_4 0x34 #define ASCII_5 0x35 #define ASCII_6 0x36 #define ASCII_7 0x37 #define ASCII_8 0x38 #define ASCII_9 0x39 #define ASCII_TAB 0x09 #define ASCII_SPACE 0x20 #define ASCII_EXCL 0x21 #define ASCII_QUOT 0x22 #define ASCII_AMP 0x26 #define ASCII_APOS 0x27 #define ASCII_MINUS 0x2D #define ASCII_PERIOD 0x2E #define ASCII_COLON 0x3A #define ASCII_SEMI 0x3B #define ASCII_LT 0x3C #define ASCII_EQUALS 0x3D #define ASCII_GT 0x3E #define ASCII_LSQB 0x5B #define ASCII_RSQB 0x5D #define ASCII_UNDERSCORE 0x5F madman-0.93/expat/asciitab.h0000644000175000001440000000334010053135241015517 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ /* 0x00 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x04 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x08 */ BT_NONXML, BT_S, BT_LF, BT_NONXML, /* 0x0C */ BT_NONXML, BT_CR, BT_NONXML, BT_NONXML, /* 0x10 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x14 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x18 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x1C */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x20 */ BT_S, BT_EXCL, BT_QUOT, BT_NUM, /* 0x24 */ BT_OTHER, BT_PERCNT, BT_AMP, BT_APOS, /* 0x28 */ BT_LPAR, BT_RPAR, BT_AST, BT_PLUS, /* 0x2C */ BT_COMMA, BT_MINUS, BT_NAME, BT_SOL, /* 0x30 */ BT_DIGIT, BT_DIGIT, BT_DIGIT, BT_DIGIT, /* 0x34 */ BT_DIGIT, BT_DIGIT, BT_DIGIT, BT_DIGIT, /* 0x38 */ BT_DIGIT, BT_DIGIT, BT_COLON, BT_SEMI, /* 0x3C */ BT_LT, BT_EQUALS, BT_GT, BT_QUEST, /* 0x40 */ BT_OTHER, BT_HEX, BT_HEX, BT_HEX, /* 0x44 */ BT_HEX, BT_HEX, BT_HEX, BT_NMSTRT, /* 0x48 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x4C */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x50 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x54 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x58 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_LSQB, /* 0x5C */ BT_OTHER, BT_RSQB, BT_OTHER, BT_NMSTRT, /* 0x60 */ BT_OTHER, BT_HEX, BT_HEX, BT_HEX, /* 0x64 */ BT_HEX, BT_HEX, BT_HEX, BT_NMSTRT, /* 0x68 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x6C */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x70 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x74 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x78 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_OTHER, /* 0x7C */ BT_VERBAR, BT_OTHER, BT_OTHER, BT_OTHER, madman-0.93/expat/expat.h0000644000175000001440000010674510053135241015076 0ustar akusers00000000000000/* Copyright (c) 1998, 1999, 2000 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ #ifndef XmlParse_INCLUDED #define XmlParse_INCLUDED 1 #ifdef __VMS /* 0 1 2 3 0 1 2 3 1234567890123456789012345678901 1234567890123456789012345678901 */ #define XML_SetProcessingInstructionHandler XML_SetProcessingInstrHandler #define XML_SetUnparsedEntityDeclHandler XML_SetUnparsedEntDeclHandler #define XML_SetStartNamespaceDeclHandler XML_SetStartNamespcDeclHandler #define XML_SetExternalEntityRefHandlerArg XML_SetExternalEntRefHandlerArg #endif #include #ifndef XMLPARSEAPI #if defined(_MSC_EXTENSIONS) && !defined(__BEOS__) && !defined(__CYGWIN__) #ifdef XML_STATIC #define XMLPARSEAPI(type) type __cdecl #else #define XMLPARSEAPI(type) __declspec(dllimport) type __cdecl #endif #else #define XMLPARSEAPI(type) type #endif #endif /* not defined XMLPARSEAPI */ #ifdef __cplusplus extern "C" { #endif #ifdef XML_UNICODE_WCHAR_T #define XML_UNICODE #endif struct XML_ParserStruct; typedef struct XML_ParserStruct *XML_Parser; #ifdef XML_UNICODE /* Information is UTF-16 encoded. */ #ifdef XML_UNICODE_WCHAR_T typedef wchar_t XML_Char; typedef wchar_t XML_LChar; #else typedef unsigned short XML_Char; typedef char XML_LChar; #endif /* XML_UNICODE_WCHAR_T */ #else /* Information is UTF-8 encoded. */ typedef char XML_Char; typedef char XML_LChar; #endif /* XML_UNICODE */ /* Should this be defined using stdbool.h when C99 is available? */ typedef unsigned char XML_Bool; #define XML_TRUE ((XML_Bool) 1) #define XML_FALSE ((XML_Bool) 0) enum XML_Error { XML_ERROR_NONE, XML_ERROR_NO_MEMORY, XML_ERROR_SYNTAX, XML_ERROR_NO_ELEMENTS, XML_ERROR_INVALID_TOKEN, XML_ERROR_UNCLOSED_TOKEN, XML_ERROR_PARTIAL_CHAR, XML_ERROR_TAG_MISMATCH, XML_ERROR_DUPLICATE_ATTRIBUTE, XML_ERROR_JUNK_AFTER_DOC_ELEMENT, XML_ERROR_PARAM_ENTITY_REF, XML_ERROR_UNDEFINED_ENTITY, XML_ERROR_RECURSIVE_ENTITY_REF, XML_ERROR_ASYNC_ENTITY, XML_ERROR_BAD_CHAR_REF, XML_ERROR_BINARY_ENTITY_REF, XML_ERROR_ATTRIBUTE_EXTERNAL_ENTITY_REF, XML_ERROR_MISPLACED_XML_PI, XML_ERROR_UNKNOWN_ENCODING, XML_ERROR_INCORRECT_ENCODING, XML_ERROR_UNCLOSED_CDATA_SECTION, XML_ERROR_EXTERNAL_ENTITY_HANDLING, XML_ERROR_NOT_STANDALONE, XML_ERROR_UNEXPECTED_STATE, XML_ERROR_ENTITY_DECLARED_IN_PE, XML_ERROR_FEATURE_REQUIRES_XML_DTD, XML_ERROR_CANT_CHANGE_FEATURE_ONCE_PARSING }; /* Parses some input. Returns XML_STATUS_ERROR if a fatal error is detected. The last call to XML_Parse must have isFinal true; len may be zero for this call (or any other). The XML_Status enum gives the possible return values for the XML_Parse and XML_ParseBuffer functions. Though the return values for these functions has always been described as a Boolean value, the implementation, at least for the 1.95.x series, has always returned exactly one of these values. The preprocessor #defines are included so this stanza can be added to code that still needs to support older versions of Expat 1.95.x: #ifndef XML_STATUS_OK #define XML_STATUS_OK 1 #define XML_STATUS_ERROR 0 #endif Otherwise, the #define hackery is quite ugly and would have been dropped. */ enum XML_Status { XML_STATUS_ERROR = 0, #define XML_STATUS_ERROR XML_STATUS_ERROR XML_STATUS_OK = 1 #define XML_STATUS_OK XML_STATUS_OK }; enum XML_Content_Type { XML_CTYPE_EMPTY = 1, XML_CTYPE_ANY, XML_CTYPE_MIXED, XML_CTYPE_NAME, XML_CTYPE_CHOICE, XML_CTYPE_SEQ }; enum XML_Content_Quant { XML_CQUANT_NONE, XML_CQUANT_OPT, XML_CQUANT_REP, XML_CQUANT_PLUS }; /* If type == XML_CTYPE_EMPTY or XML_CTYPE_ANY, then quant will be XML_CQUANT_NONE, and the other fields will be zero or NULL. If type == XML_CTYPE_MIXED, then quant will be NONE or REP and numchildren will contain number of elements that may be mixed in and children point to an array of XML_Content cells that will be all of XML_CTYPE_NAME type with no quantification. If type == XML_CTYPE_NAME, then the name points to the name, and the numchildren field will be zero and children will be NULL. The quant fields indicates any quantifiers placed on the name. CHOICE and SEQ will have name NULL, the number of children in numchildren and children will point, recursively, to an array of XML_Content cells. The EMPTY, ANY, and MIXED types will only occur at top level. */ typedef struct XML_cp XML_Content; struct XML_cp { enum XML_Content_Type type; enum XML_Content_Quant quant; XML_Char * name; unsigned int numchildren; XML_Content * children; }; /* This is called for an element declaration. See above for description of the model argument. It's the caller's responsibility to free model when finished with it. */ typedef void (*XML_ElementDeclHandler) (void *userData, const XML_Char *name, XML_Content *model); XMLPARSEAPI(void) XML_SetElementDeclHandler(XML_Parser parser, XML_ElementDeclHandler eldecl); /* The Attlist declaration handler is called for *each* attribute. So a single Attlist declaration with multiple attributes declared will generate multiple calls to this handler. The "default" parameter may be NULL in the case of the "#IMPLIED" or "#REQUIRED" keyword. The "isrequired" parameter will be true and the default value will be NULL in the case of "#REQUIRED". If "isrequired" is true and default is non-NULL, then this is a "#FIXED" default. */ typedef void (*XML_AttlistDeclHandler) (void *userData, const XML_Char *elname, const XML_Char *attname, const XML_Char *att_type, const XML_Char *dflt, int isrequired); XMLPARSEAPI(void) XML_SetAttlistDeclHandler(XML_Parser parser, XML_AttlistDeclHandler attdecl); /* The XML declaration handler is called for *both* XML declarations and text declarations. The way to distinguish is that the version parameter will be NULL for text declarations. The encoding parameter may be NULL for XML declarations. The standalone parameter will be -1, 0, or 1 indicating respectively that there was no standalone parameter in the declaration, that it was given as no, or that it was given as yes. */ typedef void (*XML_XmlDeclHandler) (void *userData, const XML_Char *version, const XML_Char *encoding, int standalone); XMLPARSEAPI(void) XML_SetXmlDeclHandler(XML_Parser parser, XML_XmlDeclHandler xmldecl); typedef struct { void *(*malloc_fcn)(size_t size); void *(*realloc_fcn)(void *ptr, size_t size); void (*free_fcn)(void *ptr); } XML_Memory_Handling_Suite; /* Constructs a new parser; encoding is the encoding specified by the external protocol or NULL if there is none specified. */ XMLPARSEAPI(XML_Parser) XML_ParserCreate(const XML_Char *encoding); /* Constructs a new parser and namespace processor. Element type names and attribute names that belong to a namespace will be expanded; unprefixed attribute names are never expanded; unprefixed element type names are expanded only if there is a default namespace. The expanded name is the concatenation of the namespace URI, the namespace separator character, and the local part of the name. If the namespace separator is '\0' then the namespace URI and the local part will be concatenated without any separator. When a namespace is not declared, the name and prefix will be passed through without expansion. */ XMLPARSEAPI(XML_Parser) XML_ParserCreateNS(const XML_Char *encoding, XML_Char namespaceSeparator); /* Constructs a new parser using the memory management suite referred to by memsuite. If memsuite is NULL, then use the standard library memory suite. If namespaceSeparator is non-NULL it creates a parser with namespace processing as described above. The character pointed at will serve as the namespace separator. All further memory operations used for the created parser will come from the given suite. */ XMLPARSEAPI(XML_Parser) XML_ParserCreate_MM(const XML_Char *encoding, const XML_Memory_Handling_Suite *memsuite, const XML_Char *namespaceSeparator); /* Prepare a parser object to be re-used. This is particularly valuable when memory allocation overhead is disproportionatly high, such as when a large number of small documnents need to be parsed. All handlers are cleared from the parser, except for the unknownEncodingHandler. The parser's external state is re-initialized except for the values of ns and ns_triplets. Added in Expat 1.95.3. */ XMLPARSEAPI(XML_Bool) XML_ParserReset(XML_Parser parser, const XML_Char *encoding); /* atts is array of name/value pairs, terminated by 0; names and values are 0 terminated. */ typedef void (*XML_StartElementHandler)(void *userData, const XML_Char *name, const XML_Char **atts); typedef void (*XML_EndElementHandler)(void *userData, const XML_Char *name); /* s is not 0 terminated. */ typedef void (*XML_CharacterDataHandler)(void *userData, const XML_Char *s, int len); /* target and data are 0 terminated */ typedef void (*XML_ProcessingInstructionHandler)(void *userData, const XML_Char *target, const XML_Char *data); /* data is 0 terminated */ typedef void (*XML_CommentHandler)(void *userData, const XML_Char *data); typedef void (*XML_StartCdataSectionHandler)(void *userData); typedef void (*XML_EndCdataSectionHandler)(void *userData); /* This is called for any characters in the XML document for which there is no applicable handler. This includes both characters that are part of markup which is of a kind that is not reported (comments, markup declarations), or characters that are part of a construct which could be reported but for which no handler has been supplied. The characters are passed exactly as they were in the XML document except that they will be encoded in UTF-8 or UTF-16. Line boundaries are not normalized. Note that a byte order mark character is not passed to the default handler. There are no guarantees about how characters are divided between calls to the default handler: for example, a comment might be split between multiple calls. */ typedef void (*XML_DefaultHandler)(void *userData, const XML_Char *s, int len); /* This is called for the start of the DOCTYPE declaration, before any DTD or internal subset is parsed. */ typedef void (*XML_StartDoctypeDeclHandler)(void *userData, const XML_Char *doctypeName, const XML_Char *sysid, const XML_Char *pubid, int has_internal_subset); /* This is called for the start of the DOCTYPE declaration when the closing > is encountered, but after processing any external subset. */ typedef void (*XML_EndDoctypeDeclHandler)(void *userData); /* This is called for entity declarations. The is_parameter_entity argument will be non-zero if the entity is a parameter entity, zero otherwise. For internal entities (), value will be non-NULL and systemId, publicID, and notationName will be NULL. The value string is NOT nul-terminated; the length is provided in the value_length argument. Since it is legal to have zero-length values, do not use this argument to test for internal entities. For external entities, value will be NULL and systemId will be non-NULL. The publicId argument will be NULL unless a public identifier was provided. The notationName argument will have a non-NULL value only for unparsed entity declarations. Note that is_parameter_entity can't be changed to XML_Bool, since that would break binary compatibility. */ typedef void (*XML_EntityDeclHandler) (void *userData, const XML_Char *entityName, int is_parameter_entity, const XML_Char *value, int value_length, const XML_Char *base, const XML_Char *systemId, const XML_Char *publicId, const XML_Char *notationName); XMLPARSEAPI(void) XML_SetEntityDeclHandler(XML_Parser parser, XML_EntityDeclHandler handler); /* OBSOLETE -- OBSOLETE -- OBSOLETE This handler has been superceded by the EntityDeclHandler above. It is provided here for backward compatibility. This is called for a declaration of an unparsed (NDATA) entity. The base argument is whatever was set by XML_SetBase. The entityName, systemId and notationName arguments will never be NULL. The other arguments may be. */ typedef void (*XML_UnparsedEntityDeclHandler)(void *userData, const XML_Char *entityName, const XML_Char *base, const XML_Char *systemId, const XML_Char *publicId, const XML_Char *notationName); /* This is called for a declaration of notation. The base argument is whatever was set by XML_SetBase. The notationName will never be NULL. The other arguments can be. */ typedef void (*XML_NotationDeclHandler)(void *userData, const XML_Char *notationName, const XML_Char *base, const XML_Char *systemId, const XML_Char *publicId); /* When namespace processing is enabled, these are called once for each namespace declaration. The call to the start and end element handlers occur between the calls to the start and end namespace declaration handlers. For an xmlns attribute, prefix will be NULL. For an xmlns="" attribute, uri will be NULL. */ typedef void (*XML_StartNamespaceDeclHandler)(void *userData, const XML_Char *prefix, const XML_Char *uri); typedef void (*XML_EndNamespaceDeclHandler)(void *userData, const XML_Char *prefix); /* This is called if the document is not standalone, that is, it has an external subset or a reference to a parameter entity, but does not have standalone="yes". If this handler returns XML_STATUS_ERROR, then processing will not continue, and the parser will return a XML_ERROR_NOT_STANDALONE error. If parameter entity parsing is enabled, then in addition to the conditions above this handler will only be called if the referenced entity was actually read. */ typedef int (*XML_NotStandaloneHandler)(void *userData); /* This is called for a reference to an external parsed general entity. The referenced entity is not automatically parsed. The application can parse it immediately or later using XML_ExternalEntityParserCreate. The parser argument is the parser parsing the entity containing the reference; it can be passed as the parser argument to XML_ExternalEntityParserCreate. The systemId argument is the system identifier as specified in the entity declaration; it will not be NULL. The base argument is the system identifier that should be used as the base for resolving systemId if systemId was relative; this is set by XML_SetBase; it may be NULL. The publicId argument is the public identifier as specified in the entity declaration, or NULL if none was specified; the whitespace in the public identifier will have been normalized as required by the XML spec. The context argument specifies the parsing context in the format expected by the context argument to XML_ExternalEntityParserCreate; context is valid only until the handler returns, so if the referenced entity is to be parsed later, it must be copied. context is NULL only when the entity is a parameter entity. The handler should return XML_STATUS_ERROR if processing should not continue because of a fatal error in the handling of the external entity. In this case the calling parser will return an XML_ERROR_EXTERNAL_ENTITY_HANDLING error. Note that unlike other handlers the first argument is the parser, not userData. */ typedef int (*XML_ExternalEntityRefHandler)(XML_Parser parser, const XML_Char *context, const XML_Char *base, const XML_Char *systemId, const XML_Char *publicId); /* This is called in two situations: 1) An entity reference is encountered for which no declaration has been read *and* this is not an error. 2) An internal entity reference is read, but not expanded, because XML_SetDefaultHandler has been called. Note: skipped parameter entities in declarations and skipped general entities in attribute values cannot be reported, because the event would be out of sync with the reporting of the declarations or attribute values */ typedef void (*XML_SkippedEntityHandler)(void *userData, const XML_Char *entityName, int is_parameter_entity); /* This structure is filled in by the XML_UnknownEncodingHandler to provide information to the parser about encodings that are unknown to the parser. The map[b] member gives information about byte sequences whose first byte is b. If map[b] is c where c is >= 0, then b by itself encodes the Unicode scalar value c. If map[b] is -1, then the byte sequence is malformed. If map[b] is -n, where n >= 2, then b is the first byte of an n-byte sequence that encodes a single Unicode scalar value. The data member will be passed as the first argument to the convert function. The convert function is used to convert multibyte sequences; s will point to a n-byte sequence where map[(unsigned char)*s] == -n. The convert function must return the Unicode scalar value represented by this byte sequence or -1 if the byte sequence is malformed. The convert function may be NULL if the encoding is a single-byte encoding, that is if map[b] >= -1 for all bytes b. When the parser is finished with the encoding, then if release is not NULL, it will call release passing it the data member; once release has been called, the convert function will not be called again. Expat places certain restrictions on the encodings that are supported using this mechanism. 1. Every ASCII character that can appear in a well-formed XML document, other than the characters $@\^`{}~ must be represented by a single byte, and that byte must be the same byte that represents that character in ASCII. 2. No character may require more than 4 bytes to encode. 3. All characters encoded must have Unicode scalar values <= 0xFFFF, (i.e., characters that would be encoded by surrogates in UTF-16 are not allowed). Note that this restriction doesn't apply to the built-in support for UTF-8 and UTF-16. 4. No Unicode character may be encoded by more than one distinct sequence of bytes. */ typedef struct { int map[256]; void *data; int (*convert)(void *data, const char *s); void (*release)(void *data); } XML_Encoding; /* This is called for an encoding that is unknown to the parser. The encodingHandlerData argument is that which was passed as the second argument to XML_SetUnknownEncodingHandler. The name argument gives the name of the encoding as specified in the encoding declaration. If the callback can provide information about the encoding, it must fill in the XML_Encoding structure, and return XML_STATUS_OK. Otherwise it must return XML_STATUS_ERROR. If info does not describe a suitable encoding, then the parser will return an XML_UNKNOWN_ENCODING error. */ typedef int (*XML_UnknownEncodingHandler)(void *encodingHandlerData, const XML_Char *name, XML_Encoding *info); XMLPARSEAPI(void) XML_SetElementHandler(XML_Parser parser, XML_StartElementHandler start, XML_EndElementHandler end); XMLPARSEAPI(void) XML_SetStartElementHandler(XML_Parser, XML_StartElementHandler); XMLPARSEAPI(void) XML_SetEndElementHandler(XML_Parser, XML_EndElementHandler); XMLPARSEAPI(void) XML_SetCharacterDataHandler(XML_Parser parser, XML_CharacterDataHandler handler); XMLPARSEAPI(void) XML_SetProcessingInstructionHandler(XML_Parser parser, XML_ProcessingInstructionHandler handler); XMLPARSEAPI(void) XML_SetCommentHandler(XML_Parser parser, XML_CommentHandler handler); XMLPARSEAPI(void) XML_SetCdataSectionHandler(XML_Parser parser, XML_StartCdataSectionHandler start, XML_EndCdataSectionHandler end); XMLPARSEAPI(void) XML_SetStartCdataSectionHandler(XML_Parser parser, XML_StartCdataSectionHandler start); XMLPARSEAPI(void) XML_SetEndCdataSectionHandler(XML_Parser parser, XML_EndCdataSectionHandler end); /* This sets the default handler and also inhibits expansion of internal entities. These entity references will be passed to the default handler, or to the skipped entity handler, if one is set. */ XMLPARSEAPI(void) XML_SetDefaultHandler(XML_Parser parser, XML_DefaultHandler handler); /* This sets the default handler but does not inhibit expansion of internal entities. The entity reference will not be passed to the default handler. */ XMLPARSEAPI(void) XML_SetDefaultHandlerExpand(XML_Parser parser, XML_DefaultHandler handler); XMLPARSEAPI(void) XML_SetDoctypeDeclHandler(XML_Parser parser, XML_StartDoctypeDeclHandler start, XML_EndDoctypeDeclHandler end); XMLPARSEAPI(void) XML_SetStartDoctypeDeclHandler(XML_Parser parser, XML_StartDoctypeDeclHandler start); XMLPARSEAPI(void) XML_SetEndDoctypeDeclHandler(XML_Parser parser, XML_EndDoctypeDeclHandler end); XMLPARSEAPI(void) XML_SetUnparsedEntityDeclHandler(XML_Parser parser, XML_UnparsedEntityDeclHandler handler); XMLPARSEAPI(void) XML_SetNotationDeclHandler(XML_Parser parser, XML_NotationDeclHandler handler); XMLPARSEAPI(void) XML_SetNamespaceDeclHandler(XML_Parser parser, XML_StartNamespaceDeclHandler start, XML_EndNamespaceDeclHandler end); XMLPARSEAPI(void) XML_SetStartNamespaceDeclHandler(XML_Parser parser, XML_StartNamespaceDeclHandler start); XMLPARSEAPI(void) XML_SetEndNamespaceDeclHandler(XML_Parser parser, XML_EndNamespaceDeclHandler end); XMLPARSEAPI(void) XML_SetNotStandaloneHandler(XML_Parser parser, XML_NotStandaloneHandler handler); XMLPARSEAPI(void) XML_SetExternalEntityRefHandler(XML_Parser parser, XML_ExternalEntityRefHandler handler); /* If a non-NULL value for arg is specified here, then it will be passed as the first argument to the external entity ref handler instead of the parser object. */ XMLPARSEAPI(void) XML_SetExternalEntityRefHandlerArg(XML_Parser, void *arg); XMLPARSEAPI(void) XML_SetSkippedEntityHandler(XML_Parser parser, XML_SkippedEntityHandler handler); XMLPARSEAPI(void) XML_SetUnknownEncodingHandler(XML_Parser parser, XML_UnknownEncodingHandler handler, void *encodingHandlerData); /* This can be called within a handler for a start element, end element, processing instruction or character data. It causes the corresponding markup to be passed to the default handler. */ XMLPARSEAPI(void) XML_DefaultCurrent(XML_Parser parser); /* If do_nst is non-zero, and namespace processing is in effect, and a name has a prefix (i.e. an explicit namespace qualifier) then that name is returned as a triplet in a single string separated by the separator character specified when the parser was created: URI + sep + local_name + sep + prefix. If do_nst is zero, then namespace information is returned in the default manner (URI + sep + local_name) whether or not the name has a prefix. Note: Calling XML_SetReturnNSTriplet after XML_Parse or XML_ParseBuffer has no effect. */ XMLPARSEAPI(void) XML_SetReturnNSTriplet(XML_Parser parser, int do_nst); /* This value is passed as the userData argument to callbacks. */ XMLPARSEAPI(void) XML_SetUserData(XML_Parser parser, void *userData); /* Returns the last value set by XML_SetUserData or NULL. */ #define XML_GetUserData(parser) (*(void **)(parser)) /* This is equivalent to supplying an encoding argument to XML_ParserCreate. On success XML_SetEncoding returns non-zero, zero otherwise. Note: Calling XML_SetEncoding after XML_Parse or XML_ParseBuffer has no effect and returns XML_STATUS_ERROR. */ XMLPARSEAPI(enum XML_Status) XML_SetEncoding(XML_Parser parser, const XML_Char *encoding); /* If this function is called, then the parser will be passed as the first argument to callbacks instead of userData. The userData will still be accessible using XML_GetUserData. */ XMLPARSEAPI(void) XML_UseParserAsHandlerArg(XML_Parser parser); /* If useDTD == XML_TRUE is passed to this function, then the parser will assume that there is an external subset, even if none is specified in the document. In such a case the parser will call the externalEntityRefHandler with a value of NULL for the systemId argument (the publicId and context arguments will be NULL as well). Note: If this function is called, then this must be done before the first call to XML_Parse or XML_ParseBuffer, since it will have no effect after that. Returns XML_ERROR_CANT_CHANGE_FEATURE_ONCE_PARSING. Note: If the document does not have a DOCTYPE declaration at all, then startDoctypeDeclHandler and endDoctypeDeclHandler will not be called, despite an external subset being parsed. Note: If XML_DTD is not defined when Expat is compiled, returns XML_ERROR_FEATURE_REQUIRES_XML_DTD. */ XMLPARSEAPI(enum XML_Error) XML_UseForeignDTD(XML_Parser parser, XML_Bool useDTD); /* Sets the base to be used for resolving relative URIs in system identifiers in declarations. Resolving relative identifiers is left to the application: this value will be passed through as the base argument to the XML_ExternalEntityRefHandler, XML_NotationDeclHandler and XML_UnparsedEntityDeclHandler. The base argument will be copied. Returns XML_STATUS_ERROR if out of memory, XML_STATUS_OK otherwise. */ XMLPARSEAPI(enum XML_Status) XML_SetBase(XML_Parser parser, const XML_Char *base); XMLPARSEAPI(const XML_Char *) XML_GetBase(XML_Parser parser); /* Returns the number of the attribute/value pairs passed in last call to the XML_StartElementHandler that were specified in the start-tag rather than defaulted. Each attribute/value pair counts as 2; thus this correspondds to an index into the atts array passed to the XML_StartElementHandler. */ XMLPARSEAPI(int) XML_GetSpecifiedAttributeCount(XML_Parser parser); /* Returns the index of the ID attribute passed in the last call to XML_StartElementHandler, or -1 if there is no ID attribute. Each attribute/value pair counts as 2; thus this correspondds to an index into the atts array passed to the XML_StartElementHandler. */ XMLPARSEAPI(int) XML_GetIdAttributeIndex(XML_Parser parser); XMLPARSEAPI(enum XML_Status) XML_Parse(XML_Parser parser, const char *s, int len, int isFinal); XMLPARSEAPI(void *) XML_GetBuffer(XML_Parser parser, int len); XMLPARSEAPI(enum XML_Status) XML_ParseBuffer(XML_Parser parser, int len, int isFinal); /* Creates an XML_Parser object that can parse an external general entity; context is a '\0'-terminated string specifying the parse context; encoding is a '\0'-terminated string giving the name of the externally specified encoding, or NULL if there is no externally specified encoding. The context string consists of a sequence of tokens separated by formfeeds (\f); a token consisting of a name specifies that the general entity of the name is open; a token of the form prefix=uri specifies the namespace for a particular prefix; a token of the form =uri specifies the default namespace. This can be called at any point after the first call to an ExternalEntityRefHandler so longer as the parser has not yet been freed. The new parser is completely independent and may safely be used in a separate thread. The handlers and userData are initialized from the parser argument. Returns NULL if out of memory. Otherwise returns a new XML_Parser object. */ XMLPARSEAPI(XML_Parser) XML_ExternalEntityParserCreate(XML_Parser parser, const XML_Char *context, const XML_Char *encoding); enum XML_ParamEntityParsing { XML_PARAM_ENTITY_PARSING_NEVER, XML_PARAM_ENTITY_PARSING_UNLESS_STANDALONE, XML_PARAM_ENTITY_PARSING_ALWAYS }; /* Controls parsing of parameter entities (including the external DTD subset). If parsing of parameter entities is enabled, then references to external parameter entities (including the external DTD subset) will be passed to the handler set with XML_SetExternalEntityRefHandler. The context passed will be 0. Unlike external general entities, external parameter entities can only be parsed synchronously. If the external parameter entity is to be parsed, it must be parsed during the call to the external entity ref handler: the complete sequence of XML_ExternalEntityParserCreate, XML_Parse/XML_ParseBuffer and XML_ParserFree calls must be made during this call. After XML_ExternalEntityParserCreate has been called to create the parser for the external parameter entity (context must be 0 for this call), it is illegal to make any calls on the old parser until XML_ParserFree has been called on the newly created parser. If the library has been compiled without support for parameter entity parsing (ie without XML_DTD being defined), then XML_SetParamEntityParsing will return 0 if parsing of parameter entities is requested; otherwise it will return non-zero. Note: If XML_SetParamEntityParsing is called after XML_Parse or XML_ParseBuffer, then it has no effect and will always return 0. */ XMLPARSEAPI(int) XML_SetParamEntityParsing(XML_Parser parser, enum XML_ParamEntityParsing parsing); /* If XML_Parse or XML_ParseBuffer have returned XML_STATUS_ERROR, then XML_GetErrorCode returns information about the error. */ XMLPARSEAPI(enum XML_Error) XML_GetErrorCode(XML_Parser parser); /* These functions return information about the current parse location. They may be called from any callback called to report some parse event; in this case the location is the location of the first of the sequence of characters that generated the event. They may also be called after returning from a call to XML_Parse or XML_ParseBuffer. If the return value is XML_STATUS_ERROR then the location is the location of the character at which the error was detected; otherwise the location is the location of the last parse event, as described above. */ XMLPARSEAPI(int) XML_GetCurrentLineNumber(XML_Parser parser); XMLPARSEAPI(int) XML_GetCurrentColumnNumber(XML_Parser parser); XMLPARSEAPI(long) XML_GetCurrentByteIndex(XML_Parser parser); /* Return the number of bytes in the current event. Returns 0 if the event is in an internal entity. */ XMLPARSEAPI(int) XML_GetCurrentByteCount(XML_Parser parser); /* If XML_CONTEXT_BYTES is defined, returns the input buffer, sets the integer pointed to by offset to the offset within this buffer of the current parse position, and sets the integer pointed to by size to the size of this buffer (the number of input bytes). Otherwise returns a NULL pointer. Also returns a NULL pointer if a parse isn't active. NOTE: The character pointer returned should not be used outside the handler that makes the call. */ XMLPARSEAPI(const char *) XML_GetInputContext(XML_Parser parser, int *offset, int *size); /* For backwards compatibility with previous versions. */ #define XML_GetErrorLineNumber XML_GetCurrentLineNumber #define XML_GetErrorColumnNumber XML_GetCurrentColumnNumber #define XML_GetErrorByteIndex XML_GetCurrentByteIndex /* Frees the content model passed to the element declaration handler */ XMLPARSEAPI(void) XML_FreeContentModel(XML_Parser parser, XML_Content *model); /* Exposing the memory handling functions used in Expat */ XMLPARSEAPI(void *) XML_MemMalloc(XML_Parser parser, size_t size); XMLPARSEAPI(void *) XML_MemRealloc(XML_Parser parser, void *ptr, size_t size); XMLPARSEAPI(void) XML_MemFree(XML_Parser parser, void *ptr); /* Frees memory used by the parser. */ XMLPARSEAPI(void) XML_ParserFree(XML_Parser parser); /* Returns a string describing the error. */ XMLPARSEAPI(const XML_LChar *) XML_ErrorString(enum XML_Error code); /* Return a string containing the version number of this expat */ XMLPARSEAPI(const XML_LChar *) XML_ExpatVersion(void); typedef struct { int major; int minor; int micro; } XML_Expat_Version; /* Return an XML_Expat_Version structure containing numeric version number information for this version of expat. */ XMLPARSEAPI(XML_Expat_Version) XML_ExpatVersionInfo(void); /* Added in Expat 1.95.5. */ enum XML_FeatureEnum { XML_FEATURE_END = 0, XML_FEATURE_UNICODE, XML_FEATURE_UNICODE_WCHAR_T, XML_FEATURE_DTD, XML_FEATURE_CONTEXT_BYTES, XML_FEATURE_MIN_SIZE, XML_FEATURE_SIZEOF_XML_CHAR, XML_FEATURE_SIZEOF_XML_LCHAR /* Additional features must be added to the end of this enum. */ }; typedef struct { enum XML_FeatureEnum feature; const XML_LChar *name; long int value; } XML_Feature; XMLPARSEAPI(const XML_Feature *) XML_GetFeatureList(void); /* Expat follows the GNU/Linux convention of odd number minor version for beta/development releases and even number minor version for stable releases. Micro is bumped with each release, and set to 0 with each change to major or minor version. */ #define XML_MAJOR_VERSION 1 #define XML_MINOR_VERSION 95 #define XML_MICRO_VERSION 6 #ifdef __cplusplus } #endif #endif /* not XmlParse_INCLUDED */ madman-0.93/expat/iasciitab.h0000644000175000001440000000344610053135241015677 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ /* Like asciitab.h, except that 0xD has code BT_S rather than BT_CR */ /* 0x00 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x04 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x08 */ BT_NONXML, BT_S, BT_LF, BT_NONXML, /* 0x0C */ BT_NONXML, BT_S, BT_NONXML, BT_NONXML, /* 0x10 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x14 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x18 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x1C */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0x20 */ BT_S, BT_EXCL, BT_QUOT, BT_NUM, /* 0x24 */ BT_OTHER, BT_PERCNT, BT_AMP, BT_APOS, /* 0x28 */ BT_LPAR, BT_RPAR, BT_AST, BT_PLUS, /* 0x2C */ BT_COMMA, BT_MINUS, BT_NAME, BT_SOL, /* 0x30 */ BT_DIGIT, BT_DIGIT, BT_DIGIT, BT_DIGIT, /* 0x34 */ BT_DIGIT, BT_DIGIT, BT_DIGIT, BT_DIGIT, /* 0x38 */ BT_DIGIT, BT_DIGIT, BT_COLON, BT_SEMI, /* 0x3C */ BT_LT, BT_EQUALS, BT_GT, BT_QUEST, /* 0x40 */ BT_OTHER, BT_HEX, BT_HEX, BT_HEX, /* 0x44 */ BT_HEX, BT_HEX, BT_HEX, BT_NMSTRT, /* 0x48 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x4C */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x50 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x54 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x58 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_LSQB, /* 0x5C */ BT_OTHER, BT_RSQB, BT_OTHER, BT_NMSTRT, /* 0x60 */ BT_OTHER, BT_HEX, BT_HEX, BT_HEX, /* 0x64 */ BT_HEX, BT_HEX, BT_HEX, BT_NMSTRT, /* 0x68 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x6C */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x70 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x74 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0x78 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_OTHER, /* 0x7C */ BT_VERBAR, BT_OTHER, BT_OTHER, BT_OTHER, madman-0.93/expat/internal.h0000644000175000001440000000351610053135241015561 0ustar akusers00000000000000/* internal.h Internal definitions used by Expat. This is not needed to compile client code. The following calling convention macros are defined for frequently called functions: FASTCALL - Used for those internal functions that have a simple body and a low number of arguments and local variables. PTRCALL - Used for functions called though function pointers. PTRFASTCALL - Like PTRCALL, but for low number of arguments. inline - Used for selected internal functions for which inlining may improve performance on some platforms. Note: Use of these macros is based on judgement, not hard rules, and therefore subject to change. */ #if defined(__GNUC__) /* Instability reported with egcs on a RedHat Linux 7.3. Let's comment it out: #define FASTCALL __attribute__((stdcall, regparm(3))) and let's try this: */ #define FASTCALL __attribute__((regparm(3))) #define PTRCALL #define PTRFASTCALL __attribute__((regparm(3))) #elif defined(WIN32) /* Using __fastcall seems to have an unexpected negative effect under MS VC++, especially for function pointers, so we won't use it for now on that platform. It may be reconsidered for a future release if it can be made more effective. Likely reason: __fastcall on Windows is like stdcall, therefore the compiler cannot perform stack optimizations for call clusters. */ #define FASTCALL #define PTRCALL #define PTRFASTCALL #endif #ifndef FASTCALL #define FASTCALL #endif #ifndef PTRCALL #define PTRCALL #endif #ifndef PTRFASTCALL #define PTRFASTCALL #endif #ifndef XML_MIN_SIZE #if !defined(__cplusplus) && !defined(inline) #ifdef __GNUC__ #define inline __inline #endif /* __GNUC__ */ #endif #endif /* XML_MIN_SIZE */ #ifdef __cplusplus #define inline inline #else #ifndef inline #define inline #endif #endif madman-0.93/expat/latin1tab.h0000644000175000001440000000342510053135241015623 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ /* 0x80 */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0x84 */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0x88 */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0x8C */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0x90 */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0x94 */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0x98 */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0x9C */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0xA0 */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0xA4 */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0xA8 */ BT_OTHER, BT_OTHER, BT_NMSTRT, BT_OTHER, /* 0xAC */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0xB0 */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0xB4 */ BT_OTHER, BT_NMSTRT, BT_OTHER, BT_NAME, /* 0xB8 */ BT_OTHER, BT_OTHER, BT_NMSTRT, BT_OTHER, /* 0xBC */ BT_OTHER, BT_OTHER, BT_OTHER, BT_OTHER, /* 0xC0 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xC4 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xC8 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xCC */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xD0 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xD4 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_OTHER, /* 0xD8 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xDC */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xE0 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xE4 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xE8 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xEC */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xF0 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xF4 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_OTHER, /* 0xF8 */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, /* 0xFC */ BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, BT_NMSTRT, madman-0.93/expat/nametab.h0000644000175000001440000001561210053135241015354 0ustar akusers00000000000000static const unsigned namingBitmap[] = { 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0x00000000, 0x04000000, 0x87FFFFFE, 0x07FFFFFE, 0x00000000, 0x00000000, 0xFF7FFFFF, 0xFF7FFFFF, 0xFFFFFFFF, 0x7FF3FFFF, 0xFFFFFDFE, 0x7FFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFE00F, 0xFC31FFFF, 0x00FFFFFF, 0x00000000, 0xFFFF0000, 0xFFFFFFFF, 0xFFFFFFFF, 0xF80001FF, 0x00000003, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0xFFFFD740, 0xFFFFFFFB, 0x547F7FFF, 0x000FFFFD, 0xFFFFDFFE, 0xFFFFFFFF, 0xDFFEFFFF, 0xFFFFFFFF, 0xFFFF0003, 0xFFFFFFFF, 0xFFFF199F, 0x033FCFFF, 0x00000000, 0xFFFE0000, 0x027FFFFF, 0xFFFFFFFE, 0x0000007F, 0x00000000, 0xFFFF0000, 0x000707FF, 0x00000000, 0x07FFFFFE, 0x000007FE, 0xFFFE0000, 0xFFFFFFFF, 0x7CFFFFFF, 0x002F7FFF, 0x00000060, 0xFFFFFFE0, 0x23FFFFFF, 0xFF000000, 0x00000003, 0xFFF99FE0, 0x03C5FDFF, 0xB0000000, 0x00030003, 0xFFF987E0, 0x036DFDFF, 0x5E000000, 0x001C0000, 0xFFFBAFE0, 0x23EDFDFF, 0x00000000, 0x00000001, 0xFFF99FE0, 0x23CDFDFF, 0xB0000000, 0x00000003, 0xD63DC7E0, 0x03BFC718, 0x00000000, 0x00000000, 0xFFFDDFE0, 0x03EFFDFF, 0x00000000, 0x00000003, 0xFFFDDFE0, 0x03EFFDFF, 0x40000000, 0x00000003, 0xFFFDDFE0, 0x03FFFDFF, 0x00000000, 0x00000003, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0xFFFFFFFE, 0x000D7FFF, 0x0000003F, 0x00000000, 0xFEF02596, 0x200D6CAE, 0x0000001F, 0x00000000, 0x00000000, 0x00000000, 0xFFFFFEFF, 0x000003FF, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0xFFFFFFFF, 0xFFFF003F, 0x007FFFFF, 0x0007DAED, 0x50000000, 0x82315001, 0x002C62AB, 0x40000000, 0xF580C900, 0x00000007, 0x02010800, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0x0FFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0x03FFFFFF, 0x3F3FFFFF, 0xFFFFFFFF, 0xAAFF3F3F, 0x3FFFFFFF, 0xFFFFFFFF, 0x5FDFFFFF, 0x0FCF1FDC, 0x1FDC1FFF, 0x00000000, 0x00004C40, 0x00000000, 0x00000000, 0x00000007, 0x00000000, 0x00000000, 0x00000000, 0x00000080, 0x000003FE, 0xFFFFFFFE, 0xFFFFFFFF, 0x001FFFFF, 0xFFFFFFFE, 0xFFFFFFFF, 0x07FFFFFF, 0xFFFFFFE0, 0x00001FFF, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0x0000003F, 0x00000000, 0x00000000, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0xFFFFFFFF, 0x0000000F, 0x00000000, 0x00000000, 0x00000000, 0x07FF6000, 0x87FFFFFE, 0x07FFFFFE, 0x00000000, 0x00800000, 0xFF7FFFFF, 0xFF7FFFFF, 0x00FFFFFF, 0x00000000, 0xFFFF0000, 0xFFFFFFFF, 0xFFFFFFFF, 0xF80001FF, 0x00030003, 0x00000000, 0xFFFFFFFF, 0xFFFFFFFF, 0x0000003F, 0x00000003, 0xFFFFD7C0, 0xFFFFFFFB, 0x547F7FFF, 0x000FFFFD, 0xFFFFDFFE, 0xFFFFFFFF, 0xDFFEFFFF, 0xFFFFFFFF, 0xFFFF007B, 0xFFFFFFFF, 0xFFFF199F, 0x033FCFFF, 0x00000000, 0xFFFE0000, 0x027FFFFF, 0xFFFFFFFE, 0xFFFE007F, 0xBBFFFFFB, 0xFFFF0016, 0x000707FF, 0x00000000, 0x07FFFFFE, 0x0007FFFF, 0xFFFF03FF, 0xFFFFFFFF, 0x7CFFFFFF, 0xFFEF7FFF, 0x03FF3DFF, 0xFFFFFFEE, 0xF3FFFFFF, 0xFF1E3FFF, 0x0000FFCF, 0xFFF99FEE, 0xD3C5FDFF, 0xB080399F, 0x0003FFCF, 0xFFF987E4, 0xD36DFDFF, 0x5E003987, 0x001FFFC0, 0xFFFBAFEE, 0xF3EDFDFF, 0x00003BBF, 0x0000FFC1, 0xFFF99FEE, 0xF3CDFDFF, 0xB0C0398F, 0x0000FFC3, 0xD63DC7EC, 0xC3BFC718, 0x00803DC7, 0x0000FF80, 0xFFFDDFEE, 0xC3EFFDFF, 0x00603DDF, 0x0000FFC3, 0xFFFDDFEC, 0xC3EFFDFF, 0x40603DDF, 0x0000FFC3, 0xFFFDDFEC, 0xC3FFFDFF, 0x00803DCF, 0x0000FFC3, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0xFFFFFFFE, 0x07FF7FFF, 0x03FF7FFF, 0x00000000, 0xFEF02596, 0x3BFF6CAE, 0x03FF3F5F, 0x00000000, 0x03000000, 0xC2A003FF, 0xFFFFFEFF, 0xFFFE03FF, 0xFEBF0FDF, 0x02FE3FFF, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x1FFF0000, 0x00000002, 0x000000A0, 0x003EFFFE, 0xFFFFFFFE, 0xFFFFFFFF, 0x661FFFFF, 0xFFFFFFFE, 0xFFFFFFFF, 0x77FFFFFF, }; static const unsigned char nmstrtPages[] = { 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x00, 0x00, 0x09, 0x0A, 0x0B, 0x0C, 0x0D, 0x0E, 0x0F, 0x10, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x13, 0x00, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x15, 0x16, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x17, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x18, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }; static const unsigned char namePages[] = { 0x19, 0x03, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x00, 0x00, 0x1F, 0x20, 0x21, 0x22, 0x23, 0x24, 0x25, 0x10, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x13, 0x26, 0x14, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x27, 0x16, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x17, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x18, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, }; madman-0.93/expat/utf8tab.h0000644000175000001440000000334310053135241015320 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ /* 0x80 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0x84 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0x88 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0x8C */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0x90 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0x94 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0x98 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0x9C */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0xA0 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0xA4 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0xA8 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0xAC */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0xB0 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0xB4 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0xB8 */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0xBC */ BT_TRAIL, BT_TRAIL, BT_TRAIL, BT_TRAIL, /* 0xC0 */ BT_LEAD2, BT_LEAD2, BT_LEAD2, BT_LEAD2, /* 0xC4 */ BT_LEAD2, BT_LEAD2, BT_LEAD2, BT_LEAD2, /* 0xC8 */ BT_LEAD2, BT_LEAD2, BT_LEAD2, BT_LEAD2, /* 0xCC */ BT_LEAD2, BT_LEAD2, BT_LEAD2, BT_LEAD2, /* 0xD0 */ BT_LEAD2, BT_LEAD2, BT_LEAD2, BT_LEAD2, /* 0xD4 */ BT_LEAD2, BT_LEAD2, BT_LEAD2, BT_LEAD2, /* 0xD8 */ BT_LEAD2, BT_LEAD2, BT_LEAD2, BT_LEAD2, /* 0xDC */ BT_LEAD2, BT_LEAD2, BT_LEAD2, BT_LEAD2, /* 0xE0 */ BT_LEAD3, BT_LEAD3, BT_LEAD3, BT_LEAD3, /* 0xE4 */ BT_LEAD3, BT_LEAD3, BT_LEAD3, BT_LEAD3, /* 0xE8 */ BT_LEAD3, BT_LEAD3, BT_LEAD3, BT_LEAD3, /* 0xEC */ BT_LEAD3, BT_LEAD3, BT_LEAD3, BT_LEAD3, /* 0xF0 */ BT_LEAD4, BT_LEAD4, BT_LEAD4, BT_LEAD4, /* 0xF4 */ BT_LEAD4, BT_NONXML, BT_NONXML, BT_NONXML, /* 0xF8 */ BT_NONXML, BT_NONXML, BT_NONXML, BT_NONXML, /* 0xFC */ BT_NONXML, BT_NONXML, BT_MALFORM, BT_MALFORM, madman-0.93/expat/winconfig.h0000644000175000001440000000134310053135241015724 0ustar akusers00000000000000/*================================================================ ** Copyright 2000, Clark Cooper ** All rights reserved. ** ** This is free software. You are permitted to copy, distribute, or modify ** it under the terms of the MIT/X license (contained in the COPYING file ** with this distribution.) */ #ifndef WINCONFIG_H #define WINCONFIG_H #define WIN32_LEAN_AND_MEAN #include #undef WIN32_LEAN_AND_MEAN #include #include #define XML_NS 1 #define XML_DTD 1 #define XML_CONTEXT_BYTES 1024 /* we will assume all Windows platforms are little endian */ #define BYTEORDER 1234 /* Windows has memmove() available. */ #define HAVE_MEMMOVE #endif /* ndef WINCONFIG_H */ madman-0.93/expat/xmlrole.h0000644000175000001440000000571710053135241015434 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ #ifndef XmlRole_INCLUDED #define XmlRole_INCLUDED 1 #ifdef __VMS /* 0 1 2 3 0 1 2 3 1234567890123456789012345678901 1234567890123456789012345678901 */ #define XmlPrologStateInitExternalEntity XmlPrologStateInitExternalEnt #endif #include "xmltok.h" #ifdef __cplusplus extern "C" { #endif enum { XML_ROLE_ERROR = -1, XML_ROLE_NONE = 0, XML_ROLE_XML_DECL, XML_ROLE_INSTANCE_START, XML_ROLE_DOCTYPE_NONE, XML_ROLE_DOCTYPE_NAME, XML_ROLE_DOCTYPE_SYSTEM_ID, XML_ROLE_DOCTYPE_PUBLIC_ID, XML_ROLE_DOCTYPE_INTERNAL_SUBSET, XML_ROLE_DOCTYPE_CLOSE, XML_ROLE_GENERAL_ENTITY_NAME, XML_ROLE_PARAM_ENTITY_NAME, XML_ROLE_ENTITY_NONE, XML_ROLE_ENTITY_VALUE, XML_ROLE_ENTITY_SYSTEM_ID, XML_ROLE_ENTITY_PUBLIC_ID, XML_ROLE_ENTITY_COMPLETE, XML_ROLE_ENTITY_NOTATION_NAME, XML_ROLE_NOTATION_NONE, XML_ROLE_NOTATION_NAME, XML_ROLE_NOTATION_SYSTEM_ID, XML_ROLE_NOTATION_NO_SYSTEM_ID, XML_ROLE_NOTATION_PUBLIC_ID, XML_ROLE_ATTRIBUTE_NAME, XML_ROLE_ATTRIBUTE_TYPE_CDATA, XML_ROLE_ATTRIBUTE_TYPE_ID, XML_ROLE_ATTRIBUTE_TYPE_IDREF, XML_ROLE_ATTRIBUTE_TYPE_IDREFS, XML_ROLE_ATTRIBUTE_TYPE_ENTITY, XML_ROLE_ATTRIBUTE_TYPE_ENTITIES, XML_ROLE_ATTRIBUTE_TYPE_NMTOKEN, XML_ROLE_ATTRIBUTE_TYPE_NMTOKENS, XML_ROLE_ATTRIBUTE_ENUM_VALUE, XML_ROLE_ATTRIBUTE_NOTATION_VALUE, XML_ROLE_ATTLIST_NONE, XML_ROLE_ATTLIST_ELEMENT_NAME, XML_ROLE_IMPLIED_ATTRIBUTE_VALUE, XML_ROLE_REQUIRED_ATTRIBUTE_VALUE, XML_ROLE_DEFAULT_ATTRIBUTE_VALUE, XML_ROLE_FIXED_ATTRIBUTE_VALUE, XML_ROLE_ELEMENT_NONE, XML_ROLE_ELEMENT_NAME, XML_ROLE_CONTENT_ANY, XML_ROLE_CONTENT_EMPTY, XML_ROLE_CONTENT_PCDATA, XML_ROLE_GROUP_OPEN, XML_ROLE_GROUP_CLOSE, XML_ROLE_GROUP_CLOSE_REP, XML_ROLE_GROUP_CLOSE_OPT, XML_ROLE_GROUP_CLOSE_PLUS, XML_ROLE_GROUP_CHOICE, XML_ROLE_GROUP_SEQUENCE, XML_ROLE_CONTENT_ELEMENT, XML_ROLE_CONTENT_ELEMENT_REP, XML_ROLE_CONTENT_ELEMENT_OPT, XML_ROLE_CONTENT_ELEMENT_PLUS, XML_ROLE_PI, XML_ROLE_COMMENT, #ifdef XML_DTD XML_ROLE_TEXT_DECL, XML_ROLE_IGNORE_SECT, XML_ROLE_INNER_PARAM_ENTITY_REF, #endif /* XML_DTD */ XML_ROLE_PARAM_ENTITY_REF }; typedef struct prolog_state { int (PTRCALL *handler) (struct prolog_state *state, int tok, const char *ptr, const char *end, const ENCODING *enc); unsigned level; int role_none; #ifdef XML_DTD unsigned includeLevel; int documentEntity; int inEntityValue; #endif /* XML_DTD */ } PROLOG_STATE; void XmlPrologStateInit(PROLOG_STATE *); #ifdef XML_DTD void XmlPrologStateInitExternalEntity(PROLOG_STATE *); #endif /* XML_DTD */ #define XmlTokenRole(state, tok, ptr, end, enc) \ (((state)->handler)(state, tok, ptr, end, enc)) #ifdef __cplusplus } #endif #endif /* not XmlRole_INCLUDED */ madman-0.93/expat/xmltok.h0000644000175000001440000002566010053135241015267 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ #ifndef XmlTok_INCLUDED #define XmlTok_INCLUDED 1 #ifdef __cplusplus extern "C" { #endif /* The following token may be returned by XmlContentTok */ #define XML_TOK_TRAILING_RSQB -5 /* ] or ]] at the end of the scan; might be start of illegal ]]> sequence */ /* The following tokens may be returned by both XmlPrologTok and XmlContentTok. */ #define XML_TOK_NONE -4 /* The string to be scanned is empty */ #define XML_TOK_TRAILING_CR -3 /* A CR at the end of the scan; might be part of CRLF sequence */ #define XML_TOK_PARTIAL_CHAR -2 /* only part of a multibyte sequence */ #define XML_TOK_PARTIAL -1 /* only part of a token */ #define XML_TOK_INVALID 0 /* The following tokens are returned by XmlContentTok; some are also returned by XmlAttributeValueTok, XmlEntityTok, XmlCdataSectionTok. */ #define XML_TOK_START_TAG_WITH_ATTS 1 #define XML_TOK_START_TAG_NO_ATTS 2 #define XML_TOK_EMPTY_ELEMENT_WITH_ATTS 3 /* empty element tag */ #define XML_TOK_EMPTY_ELEMENT_NO_ATTS 4 #define XML_TOK_END_TAG 5 #define XML_TOK_DATA_CHARS 6 #define XML_TOK_DATA_NEWLINE 7 #define XML_TOK_CDATA_SECT_OPEN 8 #define XML_TOK_ENTITY_REF 9 #define XML_TOK_CHAR_REF 10 /* numeric character reference */ /* The following tokens may be returned by both XmlPrologTok and XmlContentTok. */ #define XML_TOK_PI 11 /* processing instruction */ #define XML_TOK_XML_DECL 12 /* XML decl or text decl */ #define XML_TOK_COMMENT 13 #define XML_TOK_BOM 14 /* Byte order mark */ /* The following tokens are returned only by XmlPrologTok */ #define XML_TOK_PROLOG_S 15 #define XML_TOK_DECL_OPEN 16 /* */ #define XML_TOK_NAME 18 #define XML_TOK_NMTOKEN 19 #define XML_TOK_POUND_NAME 20 /* #name */ #define XML_TOK_OR 21 /* | */ #define XML_TOK_PERCENT 22 #define XML_TOK_OPEN_PAREN 23 #define XML_TOK_CLOSE_PAREN 24 #define XML_TOK_OPEN_BRACKET 25 #define XML_TOK_CLOSE_BRACKET 26 #define XML_TOK_LITERAL 27 #define XML_TOK_PARAM_ENTITY_REF 28 #define XML_TOK_INSTANCE_START 29 /* The following occur only in element type declarations */ #define XML_TOK_NAME_QUESTION 30 /* name? */ #define XML_TOK_NAME_ASTERISK 31 /* name* */ #define XML_TOK_NAME_PLUS 32 /* name+ */ #define XML_TOK_COND_SECT_OPEN 33 /* */ #define XML_TOK_CLOSE_PAREN_QUESTION 35 /* )? */ #define XML_TOK_CLOSE_PAREN_ASTERISK 36 /* )* */ #define XML_TOK_CLOSE_PAREN_PLUS 37 /* )+ */ #define XML_TOK_COMMA 38 /* The following token is returned only by XmlAttributeValueTok */ #define XML_TOK_ATTRIBUTE_VALUE_S 39 /* The following token is returned only by XmlCdataSectionTok */ #define XML_TOK_CDATA_SECT_CLOSE 40 /* With namespace processing this is returned by XmlPrologTok for a name with a colon. */ #define XML_TOK_PREFIXED_NAME 41 #ifdef XML_DTD #define XML_TOK_IGNORE_SECT 42 #endif /* XML_DTD */ #ifdef XML_DTD #define XML_N_STATES 4 #else /* not XML_DTD */ #define XML_N_STATES 3 #endif /* not XML_DTD */ #define XML_PROLOG_STATE 0 #define XML_CONTENT_STATE 1 #define XML_CDATA_SECTION_STATE 2 #ifdef XML_DTD #define XML_IGNORE_SECTION_STATE 3 #endif /* XML_DTD */ #define XML_N_LITERAL_TYPES 2 #define XML_ATTRIBUTE_VALUE_LITERAL 0 #define XML_ENTITY_VALUE_LITERAL 1 /* The size of the buffer passed to XmlUtf8Encode must be at least this. */ #define XML_UTF8_ENCODE_MAX 4 /* The size of the buffer passed to XmlUtf16Encode must be at least this. */ #define XML_UTF16_ENCODE_MAX 2 typedef struct position { /* first line and first column are 0 not 1 */ unsigned long lineNumber; unsigned long columnNumber; } POSITION; typedef struct { const char *name; const char *valuePtr; const char *valueEnd; char normalized; } ATTRIBUTE; struct encoding; typedef struct encoding ENCODING; typedef int (PTRCALL *SCANNER)(const ENCODING *, const char *, const char *, const char **); struct encoding { SCANNER scanners[XML_N_STATES]; SCANNER literalScanners[XML_N_LITERAL_TYPES]; int (PTRCALL *sameName)(const ENCODING *, const char *, const char *); int (PTRCALL *nameMatchesAscii)(const ENCODING *, const char *, const char *, const char *); int (PTRFASTCALL *nameLength)(const ENCODING *, const char *); const char *(PTRFASTCALL *skipS)(const ENCODING *, const char *); int (PTRCALL *getAtts)(const ENCODING *enc, const char *ptr, int attsMax, ATTRIBUTE *atts); int (PTRFASTCALL *charRefNumber)(const ENCODING *enc, const char *ptr); int (PTRCALL *predefinedEntityName)(const ENCODING *, const char *, const char *); void (PTRCALL *updatePosition)(const ENCODING *, const char *ptr, const char *end, POSITION *); int (PTRCALL *isPublicId)(const ENCODING *enc, const char *ptr, const char *end, const char **badPtr); void (PTRCALL *utf8Convert)(const ENCODING *enc, const char **fromP, const char *fromLim, char **toP, const char *toLim); void (PTRCALL *utf16Convert)(const ENCODING *enc, const char **fromP, const char *fromLim, unsigned short **toP, const unsigned short *toLim); int minBytesPerChar; char isUtf8; char isUtf16; }; /* Scan the string starting at ptr until the end of the next complete token, but do not scan past eptr. Return an integer giving the type of token. Return XML_TOK_NONE when ptr == eptr; nextTokPtr will not be set. Return XML_TOK_PARTIAL when the string does not contain a complete token; nextTokPtr will not be set. Return XML_TOK_INVALID when the string does not start a valid token; nextTokPtr will be set to point to the character which made the token invalid. Otherwise the string starts with a valid token; nextTokPtr will be set to point to the character following the end of that token. Each data character counts as a single token, but adjacent data characters may be returned together. Similarly for characters in the prolog outside literals, comments and processing instructions. */ #define XmlTok(enc, state, ptr, end, nextTokPtr) \ (((enc)->scanners[state])(enc, ptr, end, nextTokPtr)) #define XmlPrologTok(enc, ptr, end, nextTokPtr) \ XmlTok(enc, XML_PROLOG_STATE, ptr, end, nextTokPtr) #define XmlContentTok(enc, ptr, end, nextTokPtr) \ XmlTok(enc, XML_CONTENT_STATE, ptr, end, nextTokPtr) #define XmlCdataSectionTok(enc, ptr, end, nextTokPtr) \ XmlTok(enc, XML_CDATA_SECTION_STATE, ptr, end, nextTokPtr) #ifdef XML_DTD #define XmlIgnoreSectionTok(enc, ptr, end, nextTokPtr) \ XmlTok(enc, XML_IGNORE_SECTION_STATE, ptr, end, nextTokPtr) #endif /* XML_DTD */ /* This is used for performing a 2nd-level tokenization on the content of a literal that has already been returned by XmlTok. */ #define XmlLiteralTok(enc, literalType, ptr, end, nextTokPtr) \ (((enc)->literalScanners[literalType])(enc, ptr, end, nextTokPtr)) #define XmlAttributeValueTok(enc, ptr, end, nextTokPtr) \ XmlLiteralTok(enc, XML_ATTRIBUTE_VALUE_LITERAL, ptr, end, nextTokPtr) #define XmlEntityValueTok(enc, ptr, end, nextTokPtr) \ XmlLiteralTok(enc, XML_ENTITY_VALUE_LITERAL, ptr, end, nextTokPtr) #define XmlSameName(enc, ptr1, ptr2) (((enc)->sameName)(enc, ptr1, ptr2)) #define XmlNameMatchesAscii(enc, ptr1, end1, ptr2) \ (((enc)->nameMatchesAscii)(enc, ptr1, end1, ptr2)) #define XmlNameLength(enc, ptr) \ (((enc)->nameLength)(enc, ptr)) #define XmlSkipS(enc, ptr) \ (((enc)->skipS)(enc, ptr)) #define XmlGetAttributes(enc, ptr, attsMax, atts) \ (((enc)->getAtts)(enc, ptr, attsMax, atts)) #define XmlCharRefNumber(enc, ptr) \ (((enc)->charRefNumber)(enc, ptr)) #define XmlPredefinedEntityName(enc, ptr, end) \ (((enc)->predefinedEntityName)(enc, ptr, end)) #define XmlUpdatePosition(enc, ptr, end, pos) \ (((enc)->updatePosition)(enc, ptr, end, pos)) #define XmlIsPublicId(enc, ptr, end, badPtr) \ (((enc)->isPublicId)(enc, ptr, end, badPtr)) #define XmlUtf8Convert(enc, fromP, fromLim, toP, toLim) \ (((enc)->utf8Convert)(enc, fromP, fromLim, toP, toLim)) #define XmlUtf16Convert(enc, fromP, fromLim, toP, toLim) \ (((enc)->utf16Convert)(enc, fromP, fromLim, toP, toLim)) typedef struct { ENCODING initEnc; const ENCODING **encPtr; } INIT_ENCODING; int XmlParseXmlDecl(int isGeneralTextEntity, const ENCODING *enc, const char *ptr, const char *end, const char **badPtr, const char **versionPtr, const char **versionEndPtr, const char **encodingNamePtr, const ENCODING **namedEncodingPtr, int *standalonePtr); int XmlInitEncoding(INIT_ENCODING *, const ENCODING **, const char *name); const ENCODING *XmlGetUtf8InternalEncoding(void); const ENCODING *XmlGetUtf16InternalEncoding(void); int FASTCALL XmlUtf8Encode(int charNumber, char *buf); int FASTCALL XmlUtf16Encode(int charNumber, unsigned short *buf); int XmlSizeOfUnknownEncoding(void); typedef int (*CONVERTER)(void *userData, const char *p); ENCODING * XmlInitUnknownEncoding(void *mem, int *table, CONVERTER convert, void *userData); int XmlParseXmlDeclNS(int isGeneralTextEntity, const ENCODING *enc, const char *ptr, const char *end, const char **badPtr, const char **versionPtr, const char **versionEndPtr, const char **encodingNamePtr, const ENCODING **namedEncodingPtr, int *standalonePtr); int XmlInitEncodingNS(INIT_ENCODING *, const ENCODING **, const char *name); const ENCODING *XmlGetUtf8InternalEncodingNS(void); const ENCODING *XmlGetUtf16InternalEncodingNS(void); ENCODING * XmlInitUnknownEncodingNS(void *mem, int *table, CONVERTER convert, void *userData); #ifdef __cplusplus } #endif #endif /* not XmlTok_INCLUDED */ madman-0.93/expat/xmltok_impl.h0000644000175000001440000000122510053135241016277 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ enum { BT_NONXML, BT_MALFORM, BT_LT, BT_AMP, BT_RSQB, BT_LEAD2, BT_LEAD3, BT_LEAD4, BT_TRAIL, BT_CR, BT_LF, BT_GT, BT_QUOT, BT_APOS, BT_EQUALS, BT_QUEST, BT_EXCL, BT_SOL, BT_SEMI, BT_NUM, BT_LSQB, BT_S, BT_NMSTRT, BT_COLON, BT_HEX, BT_DIGIT, BT_NAME, BT_MINUS, BT_OTHER, /* known not to be a name or name start character */ BT_NONASCII, /* might be a name or name start character */ BT_PERCNT, BT_LPAR, BT_RPAR, BT_AST, BT_PLUS, BT_COMMA, BT_VERBAR }; #include madman-0.93/expat/xmlparse.c0000644000175000001440000052231510053135241015576 0ustar akusers00000000000000/* Copyright (c) 1998, 1999, 2000 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ #include #include /* memset(), memcpy() */ #ifdef COMPILED_FROM_DSP #include "winconfig.h" #define XMLPARSEAPI(type) type __cdecl #include "expat.h" #undef XMLPARSEAPI #elif defined(MACOS_CLASSIC) #include "macconfig.h" #include "expat.h" #else #include "expatconfig.h" #ifdef __declspec #define XMLPARSEAPI(type) type __cdecl #endif #include "expat.h" #ifdef __declspec #undef XMLPARSEAPI #endif #endif /* ndef COMPILED_FROM_DSP */ #ifdef XML_UNICODE #define XML_ENCODE_MAX XML_UTF16_ENCODE_MAX #define XmlConvert XmlUtf16Convert #define XmlGetInternalEncoding XmlGetUtf16InternalEncoding #define XmlGetInternalEncodingNS XmlGetUtf16InternalEncodingNS #define XmlEncode XmlUtf16Encode #define MUST_CONVERT(enc, s) (!(enc)->isUtf16 || (((unsigned long)s) & 1)) typedef unsigned short ICHAR; #else #define XML_ENCODE_MAX XML_UTF8_ENCODE_MAX #define XmlConvert XmlUtf8Convert #define XmlGetInternalEncoding XmlGetUtf8InternalEncoding #define XmlGetInternalEncodingNS XmlGetUtf8InternalEncodingNS #define XmlEncode XmlUtf8Encode #define MUST_CONVERT(enc, s) (!(enc)->isUtf8) typedef char ICHAR; #endif #ifndef XML_NS #define XmlInitEncodingNS XmlInitEncoding #define XmlInitUnknownEncodingNS XmlInitUnknownEncoding #undef XmlGetInternalEncodingNS #define XmlGetInternalEncodingNS XmlGetInternalEncoding #define XmlParseXmlDeclNS XmlParseXmlDecl #endif #ifdef XML_UNICODE #ifdef XML_UNICODE_WCHAR_T #define XML_T(x) (const wchar_t)x #define XML_L(x) L ## x #else #define XML_T(x) (const unsigned short)x #define XML_L(x) x #endif #else #define XML_T(x) x #define XML_L(x) x #endif /* Round up n to be a multiple of sz, where sz is a power of 2. */ #define ROUND_UP(n, sz) (((n) + ((sz) - 1)) & ~((sz) - 1)) /* Handle the case where memmove() doesn't exist. */ #ifndef HAVE_MEMMOVE #ifdef HAVE_BCOPY #define memmove(d,s,l) bcopy((s),(d),(l)) #else #error memmove does not exist on this platform, nor is a substitute available #endif /* HAVE_BCOPY */ #endif /* HAVE_MEMMOVE */ #include "internal.h" #include "xmltok.h" #include "xmlrole.h" typedef const XML_Char *KEY; typedef struct { KEY name; } NAMED; typedef struct { NAMED **v; size_t size; size_t used; size_t usedLim; const XML_Memory_Handling_Suite *mem; } HASH_TABLE; typedef struct { NAMED **p; NAMED **end; } HASH_TABLE_ITER; #define INIT_TAG_BUF_SIZE 32 /* must be a multiple of sizeof(XML_Char) */ #define INIT_DATA_BUF_SIZE 1024 #define INIT_ATTS_SIZE 16 #define INIT_BLOCK_SIZE 1024 #define INIT_BUFFER_SIZE 1024 #define EXPAND_SPARE 24 typedef struct binding { struct prefix *prefix; struct binding *nextTagBinding; struct binding *prevPrefixBinding; const struct attribute_id *attId; XML_Char *uri; int uriLen; int uriAlloc; } BINDING; typedef struct prefix { const XML_Char *name; BINDING *binding; } PREFIX; typedef struct { const XML_Char *str; const XML_Char *localPart; const XML_Char *prefix; int strLen; int uriLen; int prefixLen; } TAG_NAME; /* TAG represents an open element. The name of the element is stored in both the document and API encodings. The memory buffer 'buf' is a separately-allocated memory area which stores the name. During the XML_Parse()/ XMLParseBuffer() when the element is open, the memory for the 'raw' version of the name (in the document encoding) is shared with the document buffer. If the element is open across calls to XML_Parse()/XML_ParseBuffer(), the buffer is re-allocated to contain the 'raw' name as well. A parser re-uses these structures, maintaining a list of allocated TAG objects in a free list. */ typedef struct tag { struct tag *parent; /* parent of this element */ const char *rawName; /* tagName in the original encoding */ int rawNameLength; TAG_NAME name; /* tagName in the API encoding */ char *buf; /* buffer for name components */ char *bufEnd; /* end of the buffer */ BINDING *bindings; } TAG; typedef struct { const XML_Char *name; const XML_Char *textPtr; int textLen; const XML_Char *systemId; const XML_Char *base; const XML_Char *publicId; const XML_Char *notation; XML_Bool open; XML_Bool is_param; XML_Bool is_internal; /* true if declared in internal subset outside PE */ } ENTITY; typedef struct { enum XML_Content_Type type; enum XML_Content_Quant quant; const XML_Char * name; int firstchild; int lastchild; int childcnt; int nextsib; } CONTENT_SCAFFOLD; #define INIT_SCAFFOLD_ELEMENTS 32 typedef struct block { struct block *next; int size; XML_Char s[1]; } BLOCK; typedef struct { BLOCK *blocks; BLOCK *freeBlocks; const XML_Char *end; XML_Char *ptr; XML_Char *start; const XML_Memory_Handling_Suite *mem; } STRING_POOL; /* The XML_Char before the name is used to determine whether an attribute has been specified. */ typedef struct attribute_id { XML_Char *name; PREFIX *prefix; XML_Bool maybeTokenized; XML_Bool xmlns; } ATTRIBUTE_ID; typedef struct { const ATTRIBUTE_ID *id; XML_Bool isCdata; const XML_Char *value; } DEFAULT_ATTRIBUTE; typedef struct { const XML_Char *name; PREFIX *prefix; const ATTRIBUTE_ID *idAtt; int nDefaultAtts; int allocDefaultAtts; DEFAULT_ATTRIBUTE *defaultAtts; } ELEMENT_TYPE; typedef struct { HASH_TABLE generalEntities; HASH_TABLE elementTypes; HASH_TABLE attributeIds; HASH_TABLE prefixes; STRING_POOL pool; STRING_POOL entityValuePool; /* false once a parameter entity reference has been skipped */ XML_Bool keepProcessing; /* true once an internal or external PE reference has been encountered; this includes the reference to an external subset */ XML_Bool hasParamEntityRefs; XML_Bool standalone; #ifdef XML_DTD /* indicates if external PE has been read */ XML_Bool paramEntityRead; HASH_TABLE paramEntities; #endif /* XML_DTD */ PREFIX defaultPrefix; /* === scaffolding for building content model === */ XML_Bool in_eldecl; CONTENT_SCAFFOLD *scaffold; unsigned contentStringLen; unsigned scaffSize; unsigned scaffCount; int scaffLevel; int *scaffIndex; } DTD; typedef struct open_internal_entity { const char *internalEventPtr; const char *internalEventEndPtr; struct open_internal_entity *next; ENTITY *entity; } OPEN_INTERNAL_ENTITY; typedef enum XML_Error PTRCALL Processor(XML_Parser parser, const char *start, const char *end, const char **endPtr); static Processor prologProcessor; static Processor prologInitProcessor; static Processor contentProcessor; static Processor cdataSectionProcessor; #ifdef XML_DTD static Processor ignoreSectionProcessor; static Processor externalParEntProcessor; static Processor externalParEntInitProcessor; static Processor entityValueProcessor; static Processor entityValueInitProcessor; #endif /* XML_DTD */ static Processor epilogProcessor; static Processor errorProcessor; static Processor externalEntityInitProcessor; static Processor externalEntityInitProcessor2; static Processor externalEntityInitProcessor3; static Processor externalEntityContentProcessor; static enum XML_Error handleUnknownEncoding(XML_Parser parser, const XML_Char *encodingName); static enum XML_Error processXmlDecl(XML_Parser parser, int isGeneralTextEntity, const char *, const char *); static enum XML_Error initializeEncoding(XML_Parser parser); static enum XML_Error doProlog(XML_Parser parser, const ENCODING *enc, const char *s, const char *end, int tok, const char *next, const char **nextPtr); static enum XML_Error processInternalParamEntity(XML_Parser parser, ENTITY *entity); static enum XML_Error doContent(XML_Parser parser, int startTagLevel, const ENCODING *enc, const char *start, const char *end, const char **endPtr); static enum XML_Error doCdataSection(XML_Parser parser, const ENCODING *, const char **startPtr, const char *end, const char **nextPtr); #ifdef XML_DTD static enum XML_Error doIgnoreSection(XML_Parser parser, const ENCODING *, const char **startPtr, const char *end, const char **nextPtr); #endif /* XML_DTD */ static enum XML_Error storeAtts(XML_Parser parser, const ENCODING *, const char *s, TAG_NAME *tagNamePtr, BINDING **bindingsPtr); static enum XML_Error addBinding(XML_Parser parser, PREFIX *prefix, const ATTRIBUTE_ID *attId, const XML_Char *uri, BINDING **bindingsPtr); static int defineAttribute(ELEMENT_TYPE *type, ATTRIBUTE_ID *, XML_Bool isCdata, XML_Bool isId, const XML_Char *dfltValue, XML_Parser parser); static enum XML_Error storeAttributeValue(XML_Parser parser, const ENCODING *, XML_Bool isCdata, const char *, const char *, STRING_POOL *); static enum XML_Error appendAttributeValue(XML_Parser parser, const ENCODING *, XML_Bool isCdata, const char *, const char *, STRING_POOL *); static ATTRIBUTE_ID * getAttributeId(XML_Parser parser, const ENCODING *enc, const char *start, const char *end); static int setElementTypePrefix(XML_Parser parser, ELEMENT_TYPE *); static enum XML_Error storeEntityValue(XML_Parser parser, const ENCODING *enc, const char *start, const char *end); static int reportProcessingInstruction(XML_Parser parser, const ENCODING *enc, const char *start, const char *end); static int reportComment(XML_Parser parser, const ENCODING *enc, const char *start, const char *end); static void reportDefault(XML_Parser parser, const ENCODING *enc, const char *start, const char *end); static const XML_Char * getContext(XML_Parser parser); static XML_Bool setContext(XML_Parser parser, const XML_Char *context); static void FASTCALL normalizePublicId(XML_Char *s); static DTD * dtdCreate(const XML_Memory_Handling_Suite *ms); /* do not call if parentParser != NULL */ static void dtdReset(DTD *p, const XML_Memory_Handling_Suite *ms); static void dtdDestroy(DTD *p, XML_Bool isDocEntity, const XML_Memory_Handling_Suite *ms); static int dtdCopy(DTD *newDtd, const DTD *oldDtd, const XML_Memory_Handling_Suite *ms); static int copyEntityTable(HASH_TABLE *, STRING_POOL *, const HASH_TABLE *); static NAMED * lookup(HASH_TABLE *table, KEY name, size_t createSize); static void FASTCALL hashTableInit(HASH_TABLE *, const XML_Memory_Handling_Suite *ms); static void FASTCALL hashTableClear(HASH_TABLE *); static void FASTCALL hashTableDestroy(HASH_TABLE *); static void FASTCALL hashTableIterInit(HASH_TABLE_ITER *, const HASH_TABLE *); static NAMED * FASTCALL hashTableIterNext(HASH_TABLE_ITER *); static void FASTCALL poolInit(STRING_POOL *, const XML_Memory_Handling_Suite *ms); static void FASTCALL poolClear(STRING_POOL *); static void FASTCALL poolDestroy(STRING_POOL *); static XML_Char * poolAppend(STRING_POOL *pool, const ENCODING *enc, const char *ptr, const char *end); static XML_Char * poolStoreString(STRING_POOL *pool, const ENCODING *enc, const char *ptr, const char *end); static XML_Bool FASTCALL poolGrow(STRING_POOL *pool); static const XML_Char * FASTCALL poolCopyString(STRING_POOL *pool, const XML_Char *s); static const XML_Char * poolCopyStringN(STRING_POOL *pool, const XML_Char *s, int n); static const XML_Char * FASTCALL poolAppendString(STRING_POOL *pool, const XML_Char *s); static int FASTCALL nextScaffoldPart(XML_Parser parser); static XML_Content * build_model(XML_Parser parser); static ELEMENT_TYPE * getElementType(XML_Parser parser, const ENCODING *enc, const char *ptr, const char *end); static XML_Parser parserCreate(const XML_Char *encodingName, const XML_Memory_Handling_Suite *memsuite, const XML_Char *nameSep, DTD *dtd); static void parserInit(XML_Parser parser, const XML_Char *encodingName); #define poolStart(pool) ((pool)->start) #define poolEnd(pool) ((pool)->ptr) #define poolLength(pool) ((pool)->ptr - (pool)->start) #define poolChop(pool) ((void)--(pool->ptr)) #define poolLastChar(pool) (((pool)->ptr)[-1]) #define poolDiscard(pool) ((pool)->ptr = (pool)->start) #define poolFinish(pool) ((pool)->start = (pool)->ptr) #define poolAppendChar(pool, c) \ (((pool)->ptr == (pool)->end && !poolGrow(pool)) \ ? 0 \ : ((*((pool)->ptr)++ = c), 1)) struct XML_ParserStruct { /* The first member must be userData so that the XML_GetUserData macro works. */ void *m_userData; void *m_handlerArg; char *m_buffer; const XML_Memory_Handling_Suite m_mem; /* first character to be parsed */ const char *m_bufferPtr; /* past last character to be parsed */ char *m_bufferEnd; /* allocated end of buffer */ const char *m_bufferLim; long m_parseEndByteIndex; const char *m_parseEndPtr; XML_Char *m_dataBuf; XML_Char *m_dataBufEnd; XML_StartElementHandler m_startElementHandler; XML_EndElementHandler m_endElementHandler; XML_CharacterDataHandler m_characterDataHandler; XML_ProcessingInstructionHandler m_processingInstructionHandler; XML_CommentHandler m_commentHandler; XML_StartCdataSectionHandler m_startCdataSectionHandler; XML_EndCdataSectionHandler m_endCdataSectionHandler; XML_DefaultHandler m_defaultHandler; XML_StartDoctypeDeclHandler m_startDoctypeDeclHandler; XML_EndDoctypeDeclHandler m_endDoctypeDeclHandler; XML_UnparsedEntityDeclHandler m_unparsedEntityDeclHandler; XML_NotationDeclHandler m_notationDeclHandler; XML_StartNamespaceDeclHandler m_startNamespaceDeclHandler; XML_EndNamespaceDeclHandler m_endNamespaceDeclHandler; XML_NotStandaloneHandler m_notStandaloneHandler; XML_ExternalEntityRefHandler m_externalEntityRefHandler; XML_Parser m_externalEntityRefHandlerArg; XML_SkippedEntityHandler m_skippedEntityHandler; XML_UnknownEncodingHandler m_unknownEncodingHandler; XML_ElementDeclHandler m_elementDeclHandler; XML_AttlistDeclHandler m_attlistDeclHandler; XML_EntityDeclHandler m_entityDeclHandler; XML_XmlDeclHandler m_xmlDeclHandler; const ENCODING *m_encoding; INIT_ENCODING m_initEncoding; const ENCODING *m_internalEncoding; const XML_Char *m_protocolEncodingName; XML_Bool m_ns; XML_Bool m_ns_triplets; void *m_unknownEncodingMem; void *m_unknownEncodingData; void *m_unknownEncodingHandlerData; void (*m_unknownEncodingRelease)(void *); PROLOG_STATE m_prologState; Processor *m_processor; enum XML_Error m_errorCode; const char *m_eventPtr; const char *m_eventEndPtr; const char *m_positionPtr; OPEN_INTERNAL_ENTITY *m_openInternalEntities; XML_Bool m_defaultExpandInternalEntities; int m_tagLevel; ENTITY *m_declEntity; const XML_Char *m_doctypeName; const XML_Char *m_doctypeSysid; const XML_Char *m_doctypePubid; const XML_Char *m_declAttributeType; const XML_Char *m_declNotationName; const XML_Char *m_declNotationPublicId; ELEMENT_TYPE *m_declElementType; ATTRIBUTE_ID *m_declAttributeId; XML_Bool m_declAttributeIsCdata; XML_Bool m_declAttributeIsId; DTD *m_dtd; const XML_Char *m_curBase; TAG *m_tagStack; TAG *m_freeTagList; BINDING *m_inheritedBindings; BINDING *m_freeBindingList; int m_attsSize; int m_nSpecifiedAtts; int m_idAttIndex; ATTRIBUTE *m_atts; POSITION m_position; STRING_POOL m_tempPool; STRING_POOL m_temp2Pool; char *m_groupConnector; unsigned m_groupSize; XML_Char m_namespaceSeparator; XML_Parser m_parentParser; #ifdef XML_DTD XML_Bool m_isParamEntity; XML_Bool m_useForeignDTD; enum XML_ParamEntityParsing m_paramEntityParsing; #endif }; #define MALLOC(s) (parser->m_mem.malloc_fcn((s))) #define REALLOC(p,s) (parser->m_mem.realloc_fcn((p),(s))) #define FREE(p) (parser->m_mem.free_fcn((p))) #define userData (parser->m_userData) #define handlerArg (parser->m_handlerArg) #define startElementHandler (parser->m_startElementHandler) #define endElementHandler (parser->m_endElementHandler) #define characterDataHandler (parser->m_characterDataHandler) #define processingInstructionHandler \ (parser->m_processingInstructionHandler) #define commentHandler (parser->m_commentHandler) #define startCdataSectionHandler \ (parser->m_startCdataSectionHandler) #define endCdataSectionHandler (parser->m_endCdataSectionHandler) #define defaultHandler (parser->m_defaultHandler) #define startDoctypeDeclHandler (parser->m_startDoctypeDeclHandler) #define endDoctypeDeclHandler (parser->m_endDoctypeDeclHandler) #define unparsedEntityDeclHandler \ (parser->m_unparsedEntityDeclHandler) #define notationDeclHandler (parser->m_notationDeclHandler) #define startNamespaceDeclHandler \ (parser->m_startNamespaceDeclHandler) #define endNamespaceDeclHandler (parser->m_endNamespaceDeclHandler) #define notStandaloneHandler (parser->m_notStandaloneHandler) #define externalEntityRefHandler \ (parser->m_externalEntityRefHandler) #define externalEntityRefHandlerArg \ (parser->m_externalEntityRefHandlerArg) #define internalEntityRefHandler \ (parser->m_internalEntityRefHandler) #define skippedEntityHandler (parser->m_skippedEntityHandler) #define unknownEncodingHandler (parser->m_unknownEncodingHandler) #define elementDeclHandler (parser->m_elementDeclHandler) #define attlistDeclHandler (parser->m_attlistDeclHandler) #define entityDeclHandler (parser->m_entityDeclHandler) #define xmlDeclHandler (parser->m_xmlDeclHandler) #define encoding (parser->m_encoding) #define initEncoding (parser->m_initEncoding) #define internalEncoding (parser->m_internalEncoding) #define unknownEncodingMem (parser->m_unknownEncodingMem) #define unknownEncodingData (parser->m_unknownEncodingData) #define unknownEncodingHandlerData \ (parser->m_unknownEncodingHandlerData) #define unknownEncodingRelease (parser->m_unknownEncodingRelease) #define protocolEncodingName (parser->m_protocolEncodingName) #define ns (parser->m_ns) #define ns_triplets (parser->m_ns_triplets) #define prologState (parser->m_prologState) #define processor (parser->m_processor) #define errorCode (parser->m_errorCode) #define eventPtr (parser->m_eventPtr) #define eventEndPtr (parser->m_eventEndPtr) #define positionPtr (parser->m_positionPtr) #define position (parser->m_position) #define openInternalEntities (parser->m_openInternalEntities) #define defaultExpandInternalEntities \ (parser->m_defaultExpandInternalEntities) #define tagLevel (parser->m_tagLevel) #define buffer (parser->m_buffer) #define bufferPtr (parser->m_bufferPtr) #define bufferEnd (parser->m_bufferEnd) #define parseEndByteIndex (parser->m_parseEndByteIndex) #define parseEndPtr (parser->m_parseEndPtr) #define bufferLim (parser->m_bufferLim) #define dataBuf (parser->m_dataBuf) #define dataBufEnd (parser->m_dataBufEnd) #define _dtd (parser->m_dtd) #define curBase (parser->m_curBase) #define declEntity (parser->m_declEntity) #define doctypeName (parser->m_doctypeName) #define doctypeSysid (parser->m_doctypeSysid) #define doctypePubid (parser->m_doctypePubid) #define declAttributeType (parser->m_declAttributeType) #define declNotationName (parser->m_declNotationName) #define declNotationPublicId (parser->m_declNotationPublicId) #define declElementType (parser->m_declElementType) #define declAttributeId (parser->m_declAttributeId) #define declAttributeIsCdata (parser->m_declAttributeIsCdata) #define declAttributeIsId (parser->m_declAttributeIsId) #define freeTagList (parser->m_freeTagList) #define freeBindingList (parser->m_freeBindingList) #define inheritedBindings (parser->m_inheritedBindings) #define tagStack (parser->m_tagStack) #define atts (parser->m_atts) #define attsSize (parser->m_attsSize) #define nSpecifiedAtts (parser->m_nSpecifiedAtts) #define idAttIndex (parser->m_idAttIndex) #define tempPool (parser->m_tempPool) #define temp2Pool (parser->m_temp2Pool) #define groupConnector (parser->m_groupConnector) #define groupSize (parser->m_groupSize) #define namespaceSeparator (parser->m_namespaceSeparator) #define parentParser (parser->m_parentParser) #ifdef XML_DTD #define isParamEntity (parser->m_isParamEntity) #define useForeignDTD (parser->m_useForeignDTD) #define paramEntityParsing (parser->m_paramEntityParsing) #endif /* XML_DTD */ #define parsing \ (parentParser \ ? \ (isParamEntity \ ? \ (processor != externalParEntInitProcessor) \ : \ (processor != externalEntityInitProcessor)) \ : \ (processor != prologInitProcessor)) XML_Parser XML_ParserCreate(const XML_Char *encodingName) { return XML_ParserCreate_MM(encodingName, NULL, NULL); } XML_Parser XML_ParserCreateNS(const XML_Char *encodingName, XML_Char nsSep) { XML_Char tmp[2]; *tmp = nsSep; return XML_ParserCreate_MM(encodingName, NULL, tmp); } static const XML_Char implicitContext[] = { 'x', 'm', 'l', '=', 'h', 't', 't', 'p', ':', '/', '/', 'w', 'w', 'w', '.', 'w', '3', '.', 'o', 'r', 'g', '/', 'X', 'M', 'L', '/', '1', '9', '9', '8', '/', 'n', 'a', 'm', 'e', 's', 'p', 'a', 'c', 'e', '\0' }; XML_Parser XML_ParserCreate_MM(const XML_Char *encodingName, const XML_Memory_Handling_Suite *memsuite, const XML_Char *nameSep) { XML_Parser parser = parserCreate(encodingName, memsuite, nameSep, NULL); if (parser != NULL && ns) { /* implicit context only set for root parser, since child parsers (i.e. external entity parsers) will inherit it */ if (!setContext(parser, implicitContext)) { XML_ParserFree(parser); return NULL; } } return parser; } static XML_Parser parserCreate(const XML_Char *encodingName, const XML_Memory_Handling_Suite *memsuite, const XML_Char *nameSep, DTD *dtd) { XML_Parser parser; if (memsuite) { XML_Memory_Handling_Suite *mtemp; parser = (XML_Parser) memsuite->malloc_fcn(sizeof(struct XML_ParserStruct)); if (parser != NULL) { mtemp = (XML_Memory_Handling_Suite *)&(parser->m_mem); mtemp->malloc_fcn = memsuite->malloc_fcn; mtemp->realloc_fcn = memsuite->realloc_fcn; mtemp->free_fcn = memsuite->free_fcn; } } else { XML_Memory_Handling_Suite *mtemp; parser = (XML_Parser)malloc(sizeof(struct XML_ParserStruct)); if (parser != NULL) { mtemp = (XML_Memory_Handling_Suite *)&(parser->m_mem); mtemp->malloc_fcn = malloc; mtemp->realloc_fcn = realloc; mtemp->free_fcn = free; } } if (!parser) return parser; buffer = NULL; bufferLim = NULL; attsSize = INIT_ATTS_SIZE; atts = (ATTRIBUTE *)MALLOC(attsSize * sizeof(ATTRIBUTE)); if (atts == NULL) { FREE(parser); return NULL; } dataBuf = (XML_Char *)MALLOC(INIT_DATA_BUF_SIZE * sizeof(XML_Char)); if (dataBuf == NULL) { FREE(atts); FREE(parser); return NULL; } dataBufEnd = dataBuf + INIT_DATA_BUF_SIZE; if (dtd) _dtd = dtd; else { _dtd = dtdCreate(&parser->m_mem); if (_dtd == NULL) { FREE(dataBuf); FREE(atts); FREE(parser); return NULL; } } freeBindingList = NULL; freeTagList = NULL; groupSize = 0; groupConnector = NULL; unknownEncodingHandler = NULL; unknownEncodingHandlerData = NULL; namespaceSeparator = '!'; ns = XML_FALSE; ns_triplets = XML_FALSE; poolInit(&tempPool, &(parser->m_mem)); poolInit(&temp2Pool, &(parser->m_mem)); parserInit(parser, encodingName); if (encodingName && !protocolEncodingName) { XML_ParserFree(parser); return NULL; } if (nameSep) { ns = XML_TRUE; internalEncoding = XmlGetInternalEncodingNS(); namespaceSeparator = *nameSep; } else { internalEncoding = XmlGetInternalEncoding(); } return parser; } static void parserInit(XML_Parser parser, const XML_Char *encodingName) { processor = prologInitProcessor; XmlPrologStateInit(&prologState); protocolEncodingName = (encodingName != NULL ? poolCopyString(&tempPool, encodingName) : NULL); curBase = NULL; XmlInitEncoding(&initEncoding, &encoding, 0); userData = NULL; handlerArg = NULL; startElementHandler = NULL; endElementHandler = NULL; characterDataHandler = NULL; processingInstructionHandler = NULL; commentHandler = NULL; startCdataSectionHandler = NULL; endCdataSectionHandler = NULL; defaultHandler = NULL; startDoctypeDeclHandler = NULL; endDoctypeDeclHandler = NULL; unparsedEntityDeclHandler = NULL; notationDeclHandler = NULL; startNamespaceDeclHandler = NULL; endNamespaceDeclHandler = NULL; notStandaloneHandler = NULL; externalEntityRefHandler = NULL; externalEntityRefHandlerArg = parser; skippedEntityHandler = NULL; elementDeclHandler = NULL; attlistDeclHandler = NULL; entityDeclHandler = NULL; xmlDeclHandler = NULL; bufferPtr = buffer; bufferEnd = buffer; parseEndByteIndex = 0; parseEndPtr = NULL; declElementType = NULL; declAttributeId = NULL; declEntity = NULL; doctypeName = NULL; doctypeSysid = NULL; doctypePubid = NULL; declAttributeType = NULL; declNotationName = NULL; declNotationPublicId = NULL; declAttributeIsCdata = XML_FALSE; declAttributeIsId = XML_FALSE; memset(&position, 0, sizeof(POSITION)); errorCode = XML_ERROR_NONE; eventPtr = NULL; eventEndPtr = NULL; positionPtr = NULL; openInternalEntities = 0; defaultExpandInternalEntities = XML_TRUE; tagLevel = 0; tagStack = NULL; inheritedBindings = NULL; nSpecifiedAtts = 0; unknownEncodingMem = NULL; unknownEncodingRelease = NULL; unknownEncodingData = NULL; parentParser = NULL; #ifdef XML_DTD isParamEntity = XML_FALSE; useForeignDTD = XML_FALSE; paramEntityParsing = XML_PARAM_ENTITY_PARSING_NEVER; #endif } /* moves list of bindings to freeBindingList */ static void FASTCALL moveToFreeBindingList(XML_Parser parser, BINDING *bindings) { while (bindings) { BINDING *b = bindings; bindings = bindings->nextTagBinding; b->nextTagBinding = freeBindingList; freeBindingList = b; } } XML_Bool XML_ParserReset(XML_Parser parser, const XML_Char *encodingName) { TAG *tStk; if (parentParser) return XML_FALSE; /* move tagStack to freeTagList */ tStk = tagStack; while (tStk) { TAG *tag = tStk; tStk = tStk->parent; tag->parent = freeTagList; moveToFreeBindingList(parser, tag->bindings); tag->bindings = NULL; freeTagList = tag; } moveToFreeBindingList(parser, inheritedBindings); if (unknownEncodingMem) FREE(unknownEncodingMem); if (unknownEncodingRelease) unknownEncodingRelease(unknownEncodingData); poolClear(&tempPool); poolClear(&temp2Pool); parserInit(parser, encodingName); dtdReset(_dtd, &parser->m_mem); return setContext(parser, implicitContext); } enum XML_Status XML_SetEncoding(XML_Parser parser, const XML_Char *encodingName) { /* Block after XML_Parse()/XML_ParseBuffer() has been called. XXX There's no way for the caller to determine which of the XXX possible error cases caused the XML_STATUS_ERROR return. */ if (parsing) return XML_STATUS_ERROR; if (encodingName == NULL) protocolEncodingName = NULL; else { protocolEncodingName = poolCopyString(&tempPool, encodingName); if (!protocolEncodingName) return XML_STATUS_ERROR; } return XML_STATUS_OK; } XML_Parser XML_ExternalEntityParserCreate(XML_Parser oldParser, const XML_Char *context, const XML_Char *encodingName) { XML_Parser parser = oldParser; DTD *newDtd = NULL; DTD *oldDtd = _dtd; XML_StartElementHandler oldStartElementHandler = startElementHandler; XML_EndElementHandler oldEndElementHandler = endElementHandler; XML_CharacterDataHandler oldCharacterDataHandler = characterDataHandler; XML_ProcessingInstructionHandler oldProcessingInstructionHandler = processingInstructionHandler; XML_CommentHandler oldCommentHandler = commentHandler; XML_StartCdataSectionHandler oldStartCdataSectionHandler = startCdataSectionHandler; XML_EndCdataSectionHandler oldEndCdataSectionHandler = endCdataSectionHandler; XML_DefaultHandler oldDefaultHandler = defaultHandler; XML_UnparsedEntityDeclHandler oldUnparsedEntityDeclHandler = unparsedEntityDeclHandler; XML_NotationDeclHandler oldNotationDeclHandler = notationDeclHandler; XML_StartNamespaceDeclHandler oldStartNamespaceDeclHandler = startNamespaceDeclHandler; XML_EndNamespaceDeclHandler oldEndNamespaceDeclHandler = endNamespaceDeclHandler; XML_NotStandaloneHandler oldNotStandaloneHandler = notStandaloneHandler; XML_ExternalEntityRefHandler oldExternalEntityRefHandler = externalEntityRefHandler; XML_SkippedEntityHandler oldSkippedEntityHandler = skippedEntityHandler; XML_UnknownEncodingHandler oldUnknownEncodingHandler = unknownEncodingHandler; XML_ElementDeclHandler oldElementDeclHandler = elementDeclHandler; XML_AttlistDeclHandler oldAttlistDeclHandler = attlistDeclHandler; XML_EntityDeclHandler oldEntityDeclHandler = entityDeclHandler; XML_XmlDeclHandler oldXmlDeclHandler = xmlDeclHandler; ELEMENT_TYPE * oldDeclElementType = declElementType; void *oldUserData = userData; void *oldHandlerArg = handlerArg; XML_Bool oldDefaultExpandInternalEntities = defaultExpandInternalEntities; XML_Parser oldExternalEntityRefHandlerArg = externalEntityRefHandlerArg; #ifdef XML_DTD enum XML_ParamEntityParsing oldParamEntityParsing = paramEntityParsing; int oldInEntityValue = prologState.inEntityValue; #endif XML_Bool oldns_triplets = ns_triplets; #ifdef XML_DTD if (!context) newDtd = oldDtd; #endif /* XML_DTD */ /* Note that the magical uses of the pre-processor to make field access look more like C++ require that `parser' be overwritten here. This makes this function more painful to follow than it would be otherwise. */ if (ns) { XML_Char tmp[2]; *tmp = namespaceSeparator; parser = parserCreate(encodingName, &parser->m_mem, tmp, newDtd); } else { parser = parserCreate(encodingName, &parser->m_mem, NULL, newDtd); } if (!parser) return NULL; startElementHandler = oldStartElementHandler; endElementHandler = oldEndElementHandler; characterDataHandler = oldCharacterDataHandler; processingInstructionHandler = oldProcessingInstructionHandler; commentHandler = oldCommentHandler; startCdataSectionHandler = oldStartCdataSectionHandler; endCdataSectionHandler = oldEndCdataSectionHandler; defaultHandler = oldDefaultHandler; unparsedEntityDeclHandler = oldUnparsedEntityDeclHandler; notationDeclHandler = oldNotationDeclHandler; startNamespaceDeclHandler = oldStartNamespaceDeclHandler; endNamespaceDeclHandler = oldEndNamespaceDeclHandler; notStandaloneHandler = oldNotStandaloneHandler; externalEntityRefHandler = oldExternalEntityRefHandler; skippedEntityHandler = oldSkippedEntityHandler; unknownEncodingHandler = oldUnknownEncodingHandler; elementDeclHandler = oldElementDeclHandler; attlistDeclHandler = oldAttlistDeclHandler; entityDeclHandler = oldEntityDeclHandler; xmlDeclHandler = oldXmlDeclHandler; declElementType = oldDeclElementType; userData = oldUserData; if (oldUserData == oldHandlerArg) handlerArg = userData; else handlerArg = parser; if (oldExternalEntityRefHandlerArg != oldParser) externalEntityRefHandlerArg = oldExternalEntityRefHandlerArg; defaultExpandInternalEntities = oldDefaultExpandInternalEntities; ns_triplets = oldns_triplets; parentParser = oldParser; #ifdef XML_DTD paramEntityParsing = oldParamEntityParsing; prologState.inEntityValue = oldInEntityValue; if (context) { #endif /* XML_DTD */ if (!dtdCopy(_dtd, oldDtd, &parser->m_mem) || !setContext(parser, context)) { XML_ParserFree(parser); return NULL; } processor = externalEntityInitProcessor; #ifdef XML_DTD } else { /* The DTD instance referenced by _dtd is shared between the document's root parser and external PE parsers, therefore one does not need to call setContext. In addition, one also *must* not call setContext, because this would overwrite existing prefix->binding pointers in _dtd with ones that get destroyed with the external PE parser. This would leave those prefixes with dangling pointers. */ isParamEntity = XML_TRUE; XmlPrologStateInitExternalEntity(&prologState); processor = externalParEntInitProcessor; } #endif /* XML_DTD */ return parser; } static void FASTCALL destroyBindings(BINDING *bindings, XML_Parser parser) { for (;;) { BINDING *b = bindings; if (!b) break; bindings = b->nextTagBinding; FREE(b->uri); FREE(b); } } void XML_ParserFree(XML_Parser parser) { for (;;) { TAG *p; if (tagStack == NULL) { if (freeTagList == NULL) break; tagStack = freeTagList; freeTagList = NULL; } p = tagStack; tagStack = tagStack->parent; FREE(p->buf); destroyBindings(p->bindings, parser); FREE(p); } destroyBindings(freeBindingList, parser); destroyBindings(inheritedBindings, parser); poolDestroy(&tempPool); poolDestroy(&temp2Pool); #ifdef XML_DTD /* external parameter entity parsers share the DTD structure parser->m_dtd with the root parser, so we must not destroy it */ if (!isParamEntity && _dtd) #else if (_dtd) #endif /* XML_DTD */ dtdDestroy(_dtd, (XML_Bool)!parentParser, &parser->m_mem); FREE((void *)atts); if (groupConnector) FREE(groupConnector); if (buffer) FREE(buffer); FREE(dataBuf); if (unknownEncodingMem) FREE(unknownEncodingMem); if (unknownEncodingRelease) unknownEncodingRelease(unknownEncodingData); FREE(parser); } void XML_UseParserAsHandlerArg(XML_Parser parser) { handlerArg = parser; } enum XML_Error XML_UseForeignDTD(XML_Parser parser, XML_Bool useDTD) { #ifdef XML_DTD /* block after XML_Parse()/XML_ParseBuffer() has been called */ if (parsing) return XML_ERROR_CANT_CHANGE_FEATURE_ONCE_PARSING; useForeignDTD = useDTD; return XML_ERROR_NONE; #else return XML_ERROR_FEATURE_REQUIRES_XML_DTD; #endif } void XML_SetReturnNSTriplet(XML_Parser parser, int do_nst) { /* block after XML_Parse()/XML_ParseBuffer() has been called */ if (parsing) return; ns_triplets = do_nst ? XML_TRUE : XML_FALSE; } void XML_SetUserData(XML_Parser parser, void *p) { if (handlerArg == userData) handlerArg = userData = p; else userData = p; } enum XML_Status XML_SetBase(XML_Parser parser, const XML_Char *p) { if (p) { p = poolCopyString(&_dtd->pool, p); if (!p) return XML_STATUS_ERROR; curBase = p; } else curBase = NULL; return XML_STATUS_OK; } const XML_Char * XML_GetBase(XML_Parser parser) { return curBase; } int XML_GetSpecifiedAttributeCount(XML_Parser parser) { return nSpecifiedAtts; } int XML_GetIdAttributeIndex(XML_Parser parser) { return idAttIndex; } void XML_SetElementHandler(XML_Parser parser, XML_StartElementHandler start, XML_EndElementHandler end) { startElementHandler = start; endElementHandler = end; } void XML_SetStartElementHandler(XML_Parser parser, XML_StartElementHandler start) { startElementHandler = start; } void XML_SetEndElementHandler(XML_Parser parser, XML_EndElementHandler end) { endElementHandler = end; } void XML_SetCharacterDataHandler(XML_Parser parser, XML_CharacterDataHandler handler) { characterDataHandler = handler; } void XML_SetProcessingInstructionHandler(XML_Parser parser, XML_ProcessingInstructionHandler handler) { processingInstructionHandler = handler; } void XML_SetCommentHandler(XML_Parser parser, XML_CommentHandler handler) { commentHandler = handler; } void XML_SetCdataSectionHandler(XML_Parser parser, XML_StartCdataSectionHandler start, XML_EndCdataSectionHandler end) { startCdataSectionHandler = start; endCdataSectionHandler = end; } void XML_SetStartCdataSectionHandler(XML_Parser parser, XML_StartCdataSectionHandler start) { startCdataSectionHandler = start; } void XML_SetEndCdataSectionHandler(XML_Parser parser, XML_EndCdataSectionHandler end) { endCdataSectionHandler = end; } void XML_SetDefaultHandler(XML_Parser parser, XML_DefaultHandler handler) { defaultHandler = handler; defaultExpandInternalEntities = XML_FALSE; } void XML_SetDefaultHandlerExpand(XML_Parser parser, XML_DefaultHandler handler) { defaultHandler = handler; defaultExpandInternalEntities = XML_TRUE; } void XML_SetDoctypeDeclHandler(XML_Parser parser, XML_StartDoctypeDeclHandler start, XML_EndDoctypeDeclHandler end) { startDoctypeDeclHandler = start; endDoctypeDeclHandler = end; } void XML_SetStartDoctypeDeclHandler(XML_Parser parser, XML_StartDoctypeDeclHandler start) { startDoctypeDeclHandler = start; } void XML_SetEndDoctypeDeclHandler(XML_Parser parser, XML_EndDoctypeDeclHandler end) { endDoctypeDeclHandler = end; } void XML_SetUnparsedEntityDeclHandler(XML_Parser parser, XML_UnparsedEntityDeclHandler handler) { unparsedEntityDeclHandler = handler; } void XML_SetNotationDeclHandler(XML_Parser parser, XML_NotationDeclHandler handler) { notationDeclHandler = handler; } void XML_SetNamespaceDeclHandler(XML_Parser parser, XML_StartNamespaceDeclHandler start, XML_EndNamespaceDeclHandler end) { startNamespaceDeclHandler = start; endNamespaceDeclHandler = end; } void XML_SetStartNamespaceDeclHandler(XML_Parser parser, XML_StartNamespaceDeclHandler start) { startNamespaceDeclHandler = start; } void XML_SetEndNamespaceDeclHandler(XML_Parser parser, XML_EndNamespaceDeclHandler end) { endNamespaceDeclHandler = end; } void XML_SetNotStandaloneHandler(XML_Parser parser, XML_NotStandaloneHandler handler) { notStandaloneHandler = handler; } void XML_SetExternalEntityRefHandler(XML_Parser parser, XML_ExternalEntityRefHandler handler) { externalEntityRefHandler = handler; } void XML_SetExternalEntityRefHandlerArg(XML_Parser parser, void *arg) { if (arg) externalEntityRefHandlerArg = (XML_Parser)arg; else externalEntityRefHandlerArg = parser; } void XML_SetSkippedEntityHandler(XML_Parser parser, XML_SkippedEntityHandler handler) { skippedEntityHandler = handler; } void XML_SetUnknownEncodingHandler(XML_Parser parser, XML_UnknownEncodingHandler handler, void *data) { unknownEncodingHandler = handler; unknownEncodingHandlerData = data; } void XML_SetElementDeclHandler(XML_Parser parser, XML_ElementDeclHandler eldecl) { elementDeclHandler = eldecl; } void XML_SetAttlistDeclHandler(XML_Parser parser, XML_AttlistDeclHandler attdecl) { attlistDeclHandler = attdecl; } void XML_SetEntityDeclHandler(XML_Parser parser, XML_EntityDeclHandler handler) { entityDeclHandler = handler; } void XML_SetXmlDeclHandler(XML_Parser parser, XML_XmlDeclHandler handler) { xmlDeclHandler = handler; } int XML_SetParamEntityParsing(XML_Parser parser, enum XML_ParamEntityParsing peParsing) { /* block after XML_Parse()/XML_ParseBuffer() has been called */ if (parsing) return 0; #ifdef XML_DTD paramEntityParsing = peParsing; return 1; #else return peParsing == XML_PARAM_ENTITY_PARSING_NEVER; #endif } enum XML_Status XML_Parse(XML_Parser parser, const char *s, int len, int isFinal) { if (len == 0) { if (!isFinal) return XML_STATUS_OK; positionPtr = bufferPtr; errorCode = processor(parser, bufferPtr, parseEndPtr = bufferEnd, 0); if (errorCode == XML_ERROR_NONE) return XML_STATUS_OK; eventEndPtr = eventPtr; processor = errorProcessor; return XML_STATUS_ERROR; } #ifndef XML_CONTEXT_BYTES else if (bufferPtr == bufferEnd) { const char *end; int nLeftOver; parseEndByteIndex += len; positionPtr = s; if (isFinal) { errorCode = processor(parser, s, parseEndPtr = s + len, 0); if (errorCode == XML_ERROR_NONE) return XML_STATUS_OK; eventEndPtr = eventPtr; processor = errorProcessor; return XML_STATUS_ERROR; } errorCode = processor(parser, s, parseEndPtr = s + len, &end); if (errorCode != XML_ERROR_NONE) { eventEndPtr = eventPtr; processor = errorProcessor; return XML_STATUS_ERROR; } XmlUpdatePosition(encoding, positionPtr, end, &position); positionPtr = end; nLeftOver = s + len - end; if (nLeftOver) { if (buffer == NULL || nLeftOver > bufferLim - buffer) { /* FIXME avoid integer overflow */ char *temp; temp = (buffer == NULL ? (char *)MALLOC(len * 2) : (char *)REALLOC(buffer, len * 2)); if (temp == NULL) { errorCode = XML_ERROR_NO_MEMORY; return XML_STATUS_ERROR; } buffer = temp; if (!buffer) { errorCode = XML_ERROR_NO_MEMORY; eventPtr = eventEndPtr = NULL; processor = errorProcessor; return XML_STATUS_ERROR; } bufferLim = buffer + len * 2; } memcpy(buffer, end, nLeftOver); bufferPtr = buffer; bufferEnd = buffer + nLeftOver; } return XML_STATUS_OK; } #endif /* not defined XML_CONTEXT_BYTES */ else { void *buff = XML_GetBuffer(parser, len); if (buff == NULL) return XML_STATUS_ERROR; else { memcpy(buff, s, len); return XML_ParseBuffer(parser, len, isFinal); } } } enum XML_Status XML_ParseBuffer(XML_Parser parser, int len, int isFinal) { const char *start = bufferPtr; positionPtr = start; bufferEnd += len; parseEndByteIndex += len; errorCode = processor(parser, start, parseEndPtr = bufferEnd, isFinal ? (const char **)NULL : &bufferPtr); if (errorCode == XML_ERROR_NONE) { if (!isFinal) { XmlUpdatePosition(encoding, positionPtr, bufferPtr, &position); positionPtr = bufferPtr; } return XML_STATUS_OK; } else { eventEndPtr = eventPtr; processor = errorProcessor; return XML_STATUS_ERROR; } } void * XML_GetBuffer(XML_Parser parser, int len) { if (len > bufferLim - bufferEnd) { /* FIXME avoid integer overflow */ int neededSize = len + (bufferEnd - bufferPtr); #ifdef XML_CONTEXT_BYTES int keep = bufferPtr - buffer; if (keep > XML_CONTEXT_BYTES) keep = XML_CONTEXT_BYTES; neededSize += keep; #endif /* defined XML_CONTEXT_BYTES */ if (neededSize <= bufferLim - buffer) { #ifdef XML_CONTEXT_BYTES if (keep < bufferPtr - buffer) { int offset = (bufferPtr - buffer) - keep; memmove(buffer, &buffer[offset], bufferEnd - bufferPtr + keep); bufferEnd -= offset; bufferPtr -= offset; } #else memmove(buffer, bufferPtr, bufferEnd - bufferPtr); bufferEnd = buffer + (bufferEnd - bufferPtr); bufferPtr = buffer; #endif /* not defined XML_CONTEXT_BYTES */ } else { char *newBuf; int bufferSize = bufferLim - bufferPtr; if (bufferSize == 0) bufferSize = INIT_BUFFER_SIZE; do { bufferSize *= 2; } while (bufferSize < neededSize); newBuf = (char *)MALLOC(bufferSize); if (newBuf == 0) { errorCode = XML_ERROR_NO_MEMORY; return NULL; } bufferLim = newBuf + bufferSize; #ifdef XML_CONTEXT_BYTES if (bufferPtr) { int keep = bufferPtr - buffer; if (keep > XML_CONTEXT_BYTES) keep = XML_CONTEXT_BYTES; memcpy(newBuf, &bufferPtr[-keep], bufferEnd - bufferPtr + keep); FREE(buffer); buffer = newBuf; bufferEnd = buffer + (bufferEnd - bufferPtr) + keep; bufferPtr = buffer + keep; } else { bufferEnd = newBuf + (bufferEnd - bufferPtr); bufferPtr = buffer = newBuf; } #else if (bufferPtr) { memcpy(newBuf, bufferPtr, bufferEnd - bufferPtr); FREE(buffer); } bufferEnd = newBuf + (bufferEnd - bufferPtr); bufferPtr = buffer = newBuf; #endif /* not defined XML_CONTEXT_BYTES */ } } return bufferEnd; } enum XML_Error XML_GetErrorCode(XML_Parser parser) { return errorCode; } long XML_GetCurrentByteIndex(XML_Parser parser) { if (eventPtr) return parseEndByteIndex - (parseEndPtr - eventPtr); return -1; } int XML_GetCurrentByteCount(XML_Parser parser) { if (eventEndPtr && eventPtr) return eventEndPtr - eventPtr; return 0; } const char * XML_GetInputContext(XML_Parser parser, int *offset, int *size) { #ifdef XML_CONTEXT_BYTES if (eventPtr && buffer) { *offset = eventPtr - buffer; *size = bufferEnd - buffer; return buffer; } #endif /* defined XML_CONTEXT_BYTES */ return (char *) 0; } int XML_GetCurrentLineNumber(XML_Parser parser) { if (eventPtr) { XmlUpdatePosition(encoding, positionPtr, eventPtr, &position); positionPtr = eventPtr; } return position.lineNumber + 1; } int XML_GetCurrentColumnNumber(XML_Parser parser) { if (eventPtr) { XmlUpdatePosition(encoding, positionPtr, eventPtr, &position); positionPtr = eventPtr; } return position.columnNumber; } void XML_FreeContentModel(XML_Parser parser, XML_Content *model) { FREE(model); } void * XML_MemMalloc(XML_Parser parser, size_t size) { return MALLOC(size); } void * XML_MemRealloc(XML_Parser parser, void *ptr, size_t size) { return REALLOC(ptr, size); } void XML_MemFree(XML_Parser parser, void *ptr) { FREE(ptr); } void XML_DefaultCurrent(XML_Parser parser) { if (defaultHandler) { if (openInternalEntities) reportDefault(parser, internalEncoding, openInternalEntities->internalEventPtr, openInternalEntities->internalEventEndPtr); else reportDefault(parser, encoding, eventPtr, eventEndPtr); } } const XML_LChar * XML_ErrorString(enum XML_Error code) { static const XML_LChar *message[] = { 0, XML_L("out of memory"), XML_L("syntax error"), XML_L("no element found"), XML_L("not well-formed (invalid token)"), XML_L("unclosed token"), XML_L("partial character"), XML_L("mismatched tag"), XML_L("duplicate attribute"), XML_L("junk after document element"), XML_L("illegal parameter entity reference"), XML_L("undefined entity"), XML_L("recursive entity reference"), XML_L("asynchronous entity"), XML_L("reference to invalid character number"), XML_L("reference to binary entity"), XML_L("reference to external entity in attribute"), XML_L("xml declaration not at start of external entity"), XML_L("unknown encoding"), XML_L("encoding specified in XML declaration is incorrect"), XML_L("unclosed CDATA section"), XML_L("error in processing external entity reference"), XML_L("document is not standalone"), XML_L("unexpected parser state - please send a bug report"), XML_L("entity declared in parameter entity"), XML_L("requested feature requires XML_DTD support in Expat"), XML_L("cannot change setting once parsing has begun") }; if (code > 0 && code < sizeof(message)/sizeof(message[0])) return message[code]; return NULL; } const XML_LChar * XML_ExpatVersion(void) { /* V1 is used to string-ize the version number. However, it would string-ize the actual version macro *names* unless we get them substituted before being passed to V1. CPP is defined to expand a macro, then rescan for more expansions. Thus, we use V2 to expand the version macros, then CPP will expand the resulting V1() macro with the correct numerals. */ /* ### I'm assuming cpp is portable in this respect... */ #define V1(a,b,c) XML_L(#a)XML_L(".")XML_L(#b)XML_L(".")XML_L(#c) #define V2(a,b,c) XML_L("expat_")V1(a,b,c) return V2(XML_MAJOR_VERSION, XML_MINOR_VERSION, XML_MICRO_VERSION); #undef V1 #undef V2 } XML_Expat_Version XML_ExpatVersionInfo(void) { XML_Expat_Version version; version.major = XML_MAJOR_VERSION; version.minor = XML_MINOR_VERSION; version.micro = XML_MICRO_VERSION; return version; } const XML_Feature * XML_GetFeatureList(void) { static XML_Feature features[] = { {XML_FEATURE_SIZEOF_XML_CHAR, XML_L("sizeof(XML_Char)")}, {XML_FEATURE_SIZEOF_XML_LCHAR, XML_L("sizeof(XML_LChar)")}, #ifdef XML_UNICODE {XML_FEATURE_UNICODE, XML_L("XML_UNICODE")}, #endif #ifdef XML_UNICODE_WCHAR_T {XML_FEATURE_UNICODE_WCHAR_T, XML_L("XML_UNICODE_WCHAR_T")}, #endif #ifdef XML_DTD {XML_FEATURE_DTD, XML_L("XML_DTD")}, #endif #ifdef XML_CONTEXT_BYTES {XML_FEATURE_CONTEXT_BYTES, XML_L("XML_CONTEXT_BYTES"), XML_CONTEXT_BYTES}, #endif #ifdef XML_MIN_SIZE {XML_FEATURE_MIN_SIZE, XML_L("XML_MIN_SIZE")}, #endif {XML_FEATURE_END, NULL} }; features[0].value = sizeof(XML_Char); features[1].value = sizeof(XML_LChar); return features; } /* Initially tag->rawName always points into the parse buffer; for those TAG instances opened while the current parse buffer was processed, and not yet closed, we need to store tag->rawName in a more permanent location, since the parse buffer is about to be discarded. */ static XML_Bool storeRawNames(XML_Parser parser) { TAG *tag = tagStack; while (tag) { int bufSize; int nameLen = sizeof(XML_Char) * (tag->name.strLen + 1); char *rawNameBuf = tag->buf + nameLen; /* Stop if already stored. Since tagStack is a stack, we can stop at the first entry that has already been copied; everything below it in the stack is already been accounted for in a previous call to this function. */ if (tag->rawName == rawNameBuf) break; /* For re-use purposes we need to ensure that the size of tag->buf is a multiple of sizeof(XML_Char). */ bufSize = nameLen + ROUND_UP(tag->rawNameLength, sizeof(XML_Char)); if (bufSize > tag->bufEnd - tag->buf) { char *temp = (char *)REALLOC(tag->buf, bufSize); if (temp == NULL) return XML_FALSE; /* if tag->name.str points to tag->buf (only when namespace processing is off) then we have to update it */ if (tag->name.str == (XML_Char *)tag->buf) tag->name.str = (XML_Char *)temp; /* if tag->name.localPart is set (when namespace processing is on) then update it as well, since it will always point into tag->buf */ if (tag->name.localPart) tag->name.localPart = (XML_Char *)temp + (tag->name.localPart - (XML_Char *)tag->buf); tag->buf = temp; tag->bufEnd = temp + bufSize; rawNameBuf = temp + nameLen; } memcpy(rawNameBuf, tag->rawName, tag->rawNameLength); tag->rawName = rawNameBuf; tag = tag->parent; } return XML_TRUE; } static enum XML_Error PTRCALL contentProcessor(XML_Parser parser, const char *start, const char *end, const char **endPtr) { enum XML_Error result = doContent(parser, 0, encoding, start, end, endPtr); if (result != XML_ERROR_NONE) return result; if (!storeRawNames(parser)) return XML_ERROR_NO_MEMORY; return result; } static enum XML_Error PTRCALL externalEntityInitProcessor(XML_Parser parser, const char *start, const char *end, const char **endPtr) { enum XML_Error result = initializeEncoding(parser); if (result != XML_ERROR_NONE) return result; processor = externalEntityInitProcessor2; return externalEntityInitProcessor2(parser, start, end, endPtr); } static enum XML_Error PTRCALL externalEntityInitProcessor2(XML_Parser parser, const char *start, const char *end, const char **endPtr) { const char *next = start; /* XmlContentTok doesn't always set the last arg */ int tok = XmlContentTok(encoding, start, end, &next); switch (tok) { case XML_TOK_BOM: /* If we are at the end of the buffer, this would cause the next stage, i.e. externalEntityInitProcessor3, to pass control directly to doContent (by detecting XML_TOK_NONE) without processing any xml text declaration - causing the error XML_ERROR_MISPLACED_XML_PI in doContent. */ if (next == end && endPtr) { *endPtr = next; return XML_ERROR_NONE; } start = next; break; case XML_TOK_PARTIAL: if (endPtr) { *endPtr = start; return XML_ERROR_NONE; } eventPtr = start; return XML_ERROR_UNCLOSED_TOKEN; case XML_TOK_PARTIAL_CHAR: if (endPtr) { *endPtr = start; return XML_ERROR_NONE; } eventPtr = start; return XML_ERROR_PARTIAL_CHAR; } processor = externalEntityInitProcessor3; return externalEntityInitProcessor3(parser, start, end, endPtr); } static enum XML_Error PTRCALL externalEntityInitProcessor3(XML_Parser parser, const char *start, const char *end, const char **endPtr) { const char *next = start; /* XmlContentTok doesn't always set the last arg */ int tok = XmlContentTok(encoding, start, end, &next); switch (tok) { case XML_TOK_XML_DECL: { enum XML_Error result = processXmlDecl(parser, 1, start, next); if (result != XML_ERROR_NONE) return result; start = next; } break; case XML_TOK_PARTIAL: if (endPtr) { *endPtr = start; return XML_ERROR_NONE; } eventPtr = start; return XML_ERROR_UNCLOSED_TOKEN; case XML_TOK_PARTIAL_CHAR: if (endPtr) { *endPtr = start; return XML_ERROR_NONE; } eventPtr = start; return XML_ERROR_PARTIAL_CHAR; } processor = externalEntityContentProcessor; tagLevel = 1; return externalEntityContentProcessor(parser, start, end, endPtr); } static enum XML_Error PTRCALL externalEntityContentProcessor(XML_Parser parser, const char *start, const char *end, const char **endPtr) { enum XML_Error result = doContent(parser, 1, encoding, start, end, endPtr); if (result != XML_ERROR_NONE) return result; if (!storeRawNames(parser)) return XML_ERROR_NO_MEMORY; return result; } static enum XML_Error doContent(XML_Parser parser, int startTagLevel, const ENCODING *enc, const char *s, const char *end, const char **nextPtr) { DTD * const dtd = _dtd; /* save one level of indirection */ const char **eventPP; const char **eventEndPP; if (enc == encoding) { eventPP = &eventPtr; eventEndPP = &eventEndPtr; } else { eventPP = &(openInternalEntities->internalEventPtr); eventEndPP = &(openInternalEntities->internalEventEndPtr); } *eventPP = s; for (;;) { const char *next = s; /* XmlContentTok doesn't always set the last arg */ int tok = XmlContentTok(enc, s, end, &next); *eventEndPP = next; switch (tok) { case XML_TOK_TRAILING_CR: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } *eventEndPP = end; if (characterDataHandler) { XML_Char c = 0xA; characterDataHandler(handlerArg, &c, 1); } else if (defaultHandler) reportDefault(parser, enc, s, end); if (startTagLevel == 0) return XML_ERROR_NO_ELEMENTS; if (tagLevel != startTagLevel) return XML_ERROR_ASYNC_ENTITY; return XML_ERROR_NONE; case XML_TOK_NONE: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } if (startTagLevel > 0) { if (tagLevel != startTagLevel) return XML_ERROR_ASYNC_ENTITY; return XML_ERROR_NONE; } return XML_ERROR_NO_ELEMENTS; case XML_TOK_INVALID: *eventPP = next; return XML_ERROR_INVALID_TOKEN; case XML_TOK_PARTIAL: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } return XML_ERROR_UNCLOSED_TOKEN; case XML_TOK_PARTIAL_CHAR: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } return XML_ERROR_PARTIAL_CHAR; case XML_TOK_ENTITY_REF: { const XML_Char *name; ENTITY *entity; XML_Char ch = (XML_Char) XmlPredefinedEntityName(enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar); if (ch) { if (characterDataHandler) characterDataHandler(handlerArg, &ch, 1); else if (defaultHandler) reportDefault(parser, enc, s, next); break; } name = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar); if (!name) return XML_ERROR_NO_MEMORY; entity = (ENTITY *)lookup(&dtd->generalEntities, name, 0); poolDiscard(&dtd->pool); /* First, determine if a check for an existing declaration is needed; if yes, check that the entity exists, and that it is internal, otherwise call the skipped entity or default handler. */ if (!dtd->hasParamEntityRefs || dtd->standalone) { if (!entity) return XML_ERROR_UNDEFINED_ENTITY; else if (!entity->is_internal) return XML_ERROR_ENTITY_DECLARED_IN_PE; } else if (!entity) { if (skippedEntityHandler) skippedEntityHandler(handlerArg, name, 0); else if (defaultHandler) reportDefault(parser, enc, s, next); break; } if (entity->open) return XML_ERROR_RECURSIVE_ENTITY_REF; if (entity->notation) return XML_ERROR_BINARY_ENTITY_REF; if (entity->textPtr) { enum XML_Error result; OPEN_INTERNAL_ENTITY openEntity; if (!defaultExpandInternalEntities) { if (skippedEntityHandler) skippedEntityHandler(handlerArg, entity->name, 0); else if (defaultHandler) reportDefault(parser, enc, s, next); break; } entity->open = XML_TRUE; openEntity.next = openInternalEntities; openInternalEntities = &openEntity; openEntity.entity = entity; openEntity.internalEventPtr = NULL; openEntity.internalEventEndPtr = NULL; result = doContent(parser, tagLevel, internalEncoding, (char *)entity->textPtr, (char *)(entity->textPtr + entity->textLen), 0); entity->open = XML_FALSE; openInternalEntities = openEntity.next; if (result) return result; } else if (externalEntityRefHandler) { const XML_Char *context; entity->open = XML_TRUE; context = getContext(parser); entity->open = XML_FALSE; if (!context) return XML_ERROR_NO_MEMORY; if (!externalEntityRefHandler((XML_Parser)externalEntityRefHandlerArg, context, entity->base, entity->systemId, entity->publicId)) return XML_ERROR_EXTERNAL_ENTITY_HANDLING; poolDiscard(&tempPool); } else if (defaultHandler) reportDefault(parser, enc, s, next); break; } case XML_TOK_START_TAG_NO_ATTS: /* fall through */ case XML_TOK_START_TAG_WITH_ATTS: { TAG *tag; enum XML_Error result; XML_Char *toPtr; if (freeTagList) { tag = freeTagList; freeTagList = freeTagList->parent; } else { tag = (TAG *)MALLOC(sizeof(TAG)); if (!tag) return XML_ERROR_NO_MEMORY; tag->buf = (char *)MALLOC(INIT_TAG_BUF_SIZE); if (!tag->buf) { FREE(tag); return XML_ERROR_NO_MEMORY; } tag->bufEnd = tag->buf + INIT_TAG_BUF_SIZE; } tag->bindings = NULL; tag->parent = tagStack; tagStack = tag; tag->name.localPart = NULL; tag->name.prefix = NULL; tag->rawName = s + enc->minBytesPerChar; tag->rawNameLength = XmlNameLength(enc, tag->rawName); ++tagLevel; { const char *rawNameEnd = tag->rawName + tag->rawNameLength; const char *fromPtr = tag->rawName; toPtr = (XML_Char *)tag->buf; for (;;) { int bufSize; int convLen; XmlConvert(enc, &fromPtr, rawNameEnd, (ICHAR **)&toPtr, (ICHAR *)tag->bufEnd - 1); convLen = toPtr - (XML_Char *)tag->buf; if (fromPtr == rawNameEnd) { tag->name.strLen = convLen; break; } bufSize = (tag->bufEnd - tag->buf) << 1; { char *temp = (char *)REALLOC(tag->buf, bufSize); if (temp == NULL) return XML_ERROR_NO_MEMORY; tag->buf = temp; tag->bufEnd = temp + bufSize; toPtr = (XML_Char *)temp + convLen; } } } tag->name.str = (XML_Char *)tag->buf; *toPtr = XML_T('\0'); result = storeAtts(parser, enc, s, &(tag->name), &(tag->bindings)); if (result) return result; if (startElementHandler) startElementHandler(handlerArg, tag->name.str, (const XML_Char **)atts); else if (defaultHandler) reportDefault(parser, enc, s, next); poolClear(&tempPool); break; } case XML_TOK_EMPTY_ELEMENT_NO_ATTS: /* fall through */ case XML_TOK_EMPTY_ELEMENT_WITH_ATTS: { const char *rawName = s + enc->minBytesPerChar; enum XML_Error result; BINDING *bindings = NULL; XML_Bool noElmHandlers = XML_TRUE; TAG_NAME name; name.str = poolStoreString(&tempPool, enc, rawName, rawName + XmlNameLength(enc, rawName)); if (!name.str) return XML_ERROR_NO_MEMORY; poolFinish(&tempPool); result = storeAtts(parser, enc, s, &name, &bindings); if (result) return result; poolFinish(&tempPool); if (startElementHandler) { startElementHandler(handlerArg, name.str, (const XML_Char **)atts); noElmHandlers = XML_FALSE; } if (endElementHandler) { if (startElementHandler) *eventPP = *eventEndPP; endElementHandler(handlerArg, name.str); noElmHandlers = XML_FALSE; } if (noElmHandlers && defaultHandler) reportDefault(parser, enc, s, next); poolClear(&tempPool); while (bindings) { BINDING *b = bindings; if (endNamespaceDeclHandler) endNamespaceDeclHandler(handlerArg, b->prefix->name); bindings = bindings->nextTagBinding; b->nextTagBinding = freeBindingList; freeBindingList = b; b->prefix->binding = b->prevPrefixBinding; } } if (tagLevel == 0) return epilogProcessor(parser, next, end, nextPtr); break; case XML_TOK_END_TAG: if (tagLevel == startTagLevel) return XML_ERROR_ASYNC_ENTITY; else { int len; const char *rawName; TAG *tag = tagStack; tagStack = tag->parent; tag->parent = freeTagList; freeTagList = tag; rawName = s + enc->minBytesPerChar*2; len = XmlNameLength(enc, rawName); if (len != tag->rawNameLength || memcmp(tag->rawName, rawName, len) != 0) { *eventPP = rawName; return XML_ERROR_TAG_MISMATCH; } --tagLevel; if (endElementHandler) { const XML_Char *localPart; const XML_Char *prefix; XML_Char *uri; localPart = tag->name.localPart; if (ns && localPart) { /* localPart and prefix may have been overwritten in tag->name.str, since this points to the binding->uri buffer which gets re-used; so we have to add them again */ uri = (XML_Char *)tag->name.str + tag->name.uriLen; /* don't need to check for space - already done in storeAtts() */ while (*localPart) *uri++ = *localPart++; prefix = (XML_Char *)tag->name.prefix; if (ns_triplets && prefix) { *uri++ = namespaceSeparator; while (*prefix) *uri++ = *prefix++; } *uri = XML_T('\0'); } endElementHandler(handlerArg, tag->name.str); } else if (defaultHandler) reportDefault(parser, enc, s, next); while (tag->bindings) { BINDING *b = tag->bindings; if (endNamespaceDeclHandler) endNamespaceDeclHandler(handlerArg, b->prefix->name); tag->bindings = tag->bindings->nextTagBinding; b->nextTagBinding = freeBindingList; freeBindingList = b; b->prefix->binding = b->prevPrefixBinding; } if (tagLevel == 0) return epilogProcessor(parser, next, end, nextPtr); } break; case XML_TOK_CHAR_REF: { int n = XmlCharRefNumber(enc, s); if (n < 0) return XML_ERROR_BAD_CHAR_REF; if (characterDataHandler) { XML_Char buf[XML_ENCODE_MAX]; characterDataHandler(handlerArg, buf, XmlEncode(n, (ICHAR *)buf)); } else if (defaultHandler) reportDefault(parser, enc, s, next); } break; case XML_TOK_XML_DECL: return XML_ERROR_MISPLACED_XML_PI; case XML_TOK_DATA_NEWLINE: if (characterDataHandler) { XML_Char c = 0xA; characterDataHandler(handlerArg, &c, 1); } else if (defaultHandler) reportDefault(parser, enc, s, next); break; case XML_TOK_CDATA_SECT_OPEN: { enum XML_Error result; if (startCdataSectionHandler) startCdataSectionHandler(handlerArg); #if 0 /* Suppose you doing a transformation on a document that involves changing only the character data. You set up a defaultHandler and a characterDataHandler. The defaultHandler simply copies characters through. The characterDataHandler does the transformation and writes the characters out escaping them as necessary. This case will fail to work if we leave out the following two lines (because & and < inside CDATA sections will be incorrectly escaped). However, now we have a start/endCdataSectionHandler, so it seems easier to let the user deal with this. */ else if (characterDataHandler) characterDataHandler(handlerArg, dataBuf, 0); #endif else if (defaultHandler) reportDefault(parser, enc, s, next); result = doCdataSection(parser, enc, &next, end, nextPtr); if (!next) { processor = cdataSectionProcessor; return result; } } break; case XML_TOK_TRAILING_RSQB: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } if (characterDataHandler) { if (MUST_CONVERT(enc, s)) { ICHAR *dataPtr = (ICHAR *)dataBuf; XmlConvert(enc, &s, end, &dataPtr, (ICHAR *)dataBufEnd); characterDataHandler(handlerArg, dataBuf, dataPtr - (ICHAR *)dataBuf); } else characterDataHandler(handlerArg, (XML_Char *)s, (XML_Char *)end - (XML_Char *)s); } else if (defaultHandler) reportDefault(parser, enc, s, end); if (startTagLevel == 0) { *eventPP = end; return XML_ERROR_NO_ELEMENTS; } if (tagLevel != startTagLevel) { *eventPP = end; return XML_ERROR_ASYNC_ENTITY; } return XML_ERROR_NONE; case XML_TOK_DATA_CHARS: if (characterDataHandler) { if (MUST_CONVERT(enc, s)) { for (;;) { ICHAR *dataPtr = (ICHAR *)dataBuf; XmlConvert(enc, &s, next, &dataPtr, (ICHAR *)dataBufEnd); *eventEndPP = s; characterDataHandler(handlerArg, dataBuf, dataPtr - (ICHAR *)dataBuf); if (s == next) break; *eventPP = s; } } else characterDataHandler(handlerArg, (XML_Char *)s, (XML_Char *)next - (XML_Char *)s); } else if (defaultHandler) reportDefault(parser, enc, s, next); break; case XML_TOK_PI: if (!reportProcessingInstruction(parser, enc, s, next)) return XML_ERROR_NO_MEMORY; break; case XML_TOK_COMMENT: if (!reportComment(parser, enc, s, next)) return XML_ERROR_NO_MEMORY; break; default: if (defaultHandler) reportDefault(parser, enc, s, next); break; } *eventPP = s = next; } /* not reached */ } /* Precondition: all arguments must be non-NULL; Purpose: - normalize attributes - check attributes for well-formedness - generate namespace aware attribute names (URI, prefix) - build list of attributes for startElementHandler - default attributes - process namespace declarations (check and report them) - generate namespace aware element name (URI, prefix) */ static enum XML_Error storeAtts(XML_Parser parser, const ENCODING *enc, const char *attStr, TAG_NAME *tagNamePtr, BINDING **bindingsPtr) { DTD * const dtd = _dtd; /* save one level of indirection */ ELEMENT_TYPE *elementType = NULL; int nDefaultAtts = 0; const XML_Char **appAtts; /* the attribute list for the application */ int attIndex = 0; int prefixLen; int i; int n; XML_Char *uri; int nPrefixes = 0; BINDING *binding; const XML_Char *localPart; /* lookup the element type name */ elementType = (ELEMENT_TYPE *)lookup(&dtd->elementTypes, tagNamePtr->str,0); if (!elementType) { const XML_Char *name = poolCopyString(&dtd->pool, tagNamePtr->str); if (!name) return XML_ERROR_NO_MEMORY; elementType = (ELEMENT_TYPE *)lookup(&dtd->elementTypes, name, sizeof(ELEMENT_TYPE)); if (!elementType) return XML_ERROR_NO_MEMORY; if (ns && !setElementTypePrefix(parser, elementType)) return XML_ERROR_NO_MEMORY; } nDefaultAtts = elementType->nDefaultAtts; /* get the attributes from the tokenizer */ n = XmlGetAttributes(enc, attStr, attsSize, atts); if (n + nDefaultAtts > attsSize) { int oldAttsSize = attsSize; ATTRIBUTE *temp; attsSize = n + nDefaultAtts + INIT_ATTS_SIZE; temp = (ATTRIBUTE *)REALLOC((void *)atts, attsSize * sizeof(ATTRIBUTE)); if (temp == NULL) return XML_ERROR_NO_MEMORY; atts = temp; if (n > oldAttsSize) XmlGetAttributes(enc, attStr, n, atts); } appAtts = (const XML_Char **)atts; for (i = 0; i < n; i++) { /* add the name and value to the attribute list */ ATTRIBUTE_ID *attId = getAttributeId(parser, enc, atts[i].name, atts[i].name + XmlNameLength(enc, atts[i].name)); if (!attId) return XML_ERROR_NO_MEMORY; /* detect duplicate attributes */ if ((attId->name)[-1]) { if (enc == encoding) eventPtr = atts[i].name; return XML_ERROR_DUPLICATE_ATTRIBUTE; } (attId->name)[-1] = 1; appAtts[attIndex++] = attId->name; if (!atts[i].normalized) { enum XML_Error result; XML_Bool isCdata = XML_TRUE; /* figure out whether declared as other than CDATA */ if (attId->maybeTokenized) { int j; for (j = 0; j < nDefaultAtts; j++) { if (attId == elementType->defaultAtts[j].id) { isCdata = elementType->defaultAtts[j].isCdata; break; } } } /* normalize the attribute value */ result = storeAttributeValue(parser, enc, isCdata, atts[i].valuePtr, atts[i].valueEnd, &tempPool); if (result) return result; appAtts[attIndex] = poolStart(&tempPool); poolFinish(&tempPool); } else { /* the value did not need normalizing */ appAtts[attIndex] = poolStoreString(&tempPool, enc, atts[i].valuePtr, atts[i].valueEnd); if (appAtts[attIndex] == 0) return XML_ERROR_NO_MEMORY; poolFinish(&tempPool); } /* handle prefixed attribute names */ if (attId->prefix) { if (attId->xmlns) { /* deal with namespace declarations here */ enum XML_Error result = addBinding(parser, attId->prefix, attId, appAtts[attIndex], bindingsPtr); if (result) return result; --attIndex; } else { /* deal with other prefixed names later */ attIndex++; nPrefixes++; (attId->name)[-1] = 2; } } else attIndex++; } /* set-up for XML_GetSpecifiedAttributeCount and XML_GetIdAttributeIndex */ nSpecifiedAtts = attIndex; if (elementType->idAtt && (elementType->idAtt->name)[-1]) { for (i = 0; i < attIndex; i += 2) if (appAtts[i] == elementType->idAtt->name) { idAttIndex = i; break; } } else idAttIndex = -1; /* do attribute defaulting */ for (i = 0; i < nDefaultAtts; i++) { const DEFAULT_ATTRIBUTE *da = elementType->defaultAtts + i; if (!(da->id->name)[-1] && da->value) { if (da->id->prefix) { if (da->id->xmlns) { enum XML_Error result = addBinding(parser, da->id->prefix, da->id, da->value, bindingsPtr); if (result) return result; } else { (da->id->name)[-1] = 2; nPrefixes++; appAtts[attIndex++] = da->id->name; appAtts[attIndex++] = da->value; } } else { (da->id->name)[-1] = 1; appAtts[attIndex++] = da->id->name; appAtts[attIndex++] = da->value; } } } appAtts[attIndex] = 0; i = 0; if (nPrefixes) { /* expand prefixed attribute names */ for (; i < attIndex; i += 2) { if (appAtts[i][-1] == 2) { ATTRIBUTE_ID *id; ((XML_Char *)(appAtts[i]))[-1] = 0; id = (ATTRIBUTE_ID *)lookup(&dtd->attributeIds, appAtts[i], 0); if (id->prefix->binding) { int j; const BINDING *b = id->prefix->binding; const XML_Char *s = appAtts[i]; for (j = 0; j < b->uriLen; j++) { if (!poolAppendChar(&tempPool, b->uri[j])) return XML_ERROR_NO_MEMORY; } while (*s++ != XML_T(':')) ; do { if (!poolAppendChar(&tempPool, *s)) return XML_ERROR_NO_MEMORY; } while (*s++); if (ns_triplets) { tempPool.ptr[-1] = namespaceSeparator; s = b->prefix->name; do { if (!poolAppendChar(&tempPool, *s)) return XML_ERROR_NO_MEMORY; } while (*s++); } appAtts[i] = poolStart(&tempPool); poolFinish(&tempPool); } if (!--nPrefixes) break; } else ((XML_Char *)(appAtts[i]))[-1] = 0; } } /* clear the flags that say whether attributes were specified */ for (; i < attIndex; i += 2) ((XML_Char *)(appAtts[i]))[-1] = 0; for (binding = *bindingsPtr; binding; binding = binding->nextTagBinding) binding->attId->name[-1] = 0; /* expand the element type name */ if (elementType->prefix) { binding = elementType->prefix->binding; if (!binding) return XML_ERROR_NONE; localPart = tagNamePtr->str; while (*localPart++ != XML_T(':')) ; } else if (dtd->defaultPrefix.binding) { binding = dtd->defaultPrefix.binding; localPart = tagNamePtr->str; } else return XML_ERROR_NONE; prefixLen = 0; if (ns && ns_triplets && binding->prefix->name) { for (; binding->prefix->name[prefixLen++];) ; } tagNamePtr->localPart = localPart; tagNamePtr->uriLen = binding->uriLen; tagNamePtr->prefix = binding->prefix->name; tagNamePtr->prefixLen = prefixLen; for (i = 0; localPart[i++];) ; n = i + binding->uriLen + prefixLen; if (n > binding->uriAlloc) { TAG *p; uri = (XML_Char *)MALLOC((n + EXPAND_SPARE) * sizeof(XML_Char)); if (!uri) return XML_ERROR_NO_MEMORY; binding->uriAlloc = n + EXPAND_SPARE; memcpy(uri, binding->uri, binding->uriLen * sizeof(XML_Char)); for (p = tagStack; p; p = p->parent) if (p->name.str == binding->uri) p->name.str = uri; FREE(binding->uri); binding->uri = uri; } uri = binding->uri + binding->uriLen; memcpy(uri, localPart, i * sizeof(XML_Char)); if (prefixLen) { uri = uri + (i - 1); if (namespaceSeparator) { *(uri) = namespaceSeparator; } memcpy(uri + 1, binding->prefix->name, prefixLen * sizeof(XML_Char)); } tagNamePtr->str = binding->uri; return XML_ERROR_NONE; } /* addBinding() overwrites the value of prefix->binding without checking. Therefore one must keep track of the old value outside of addBinding(). */ static enum XML_Error addBinding(XML_Parser parser, PREFIX *prefix, const ATTRIBUTE_ID *attId, const XML_Char *uri, BINDING **bindingsPtr) { BINDING *b; int len; /* empty string is only valid when there is no prefix per XML NS 1.0 */ if (*uri == XML_T('\0') && prefix->name) return XML_ERROR_SYNTAX; for (len = 0; uri[len]; len++) ; if (namespaceSeparator) len++; if (freeBindingList) { b = freeBindingList; if (len > b->uriAlloc) { XML_Char *temp = (XML_Char *)REALLOC(b->uri, sizeof(XML_Char) * (len + EXPAND_SPARE)); if (temp == NULL) return XML_ERROR_NO_MEMORY; b->uri = temp; b->uriAlloc = len + EXPAND_SPARE; } freeBindingList = b->nextTagBinding; } else { b = (BINDING *)MALLOC(sizeof(BINDING)); if (!b) return XML_ERROR_NO_MEMORY; b->uri = (XML_Char *)MALLOC(sizeof(XML_Char) * (len + EXPAND_SPARE)); if (!b->uri) { FREE(b); return XML_ERROR_NO_MEMORY; } b->uriAlloc = len + EXPAND_SPARE; } b->uriLen = len; memcpy(b->uri, uri, len * sizeof(XML_Char)); if (namespaceSeparator) b->uri[len - 1] = namespaceSeparator; b->prefix = prefix; b->attId = attId; b->prevPrefixBinding = prefix->binding; if (*uri == XML_T('\0') && prefix == &_dtd->defaultPrefix) prefix->binding = NULL; else prefix->binding = b; b->nextTagBinding = *bindingsPtr; *bindingsPtr = b; if (startNamespaceDeclHandler) startNamespaceDeclHandler(handlerArg, prefix->name, prefix->binding ? uri : 0); return XML_ERROR_NONE; } /* The idea here is to avoid using stack for each CDATA section when the whole file is parsed with one call. */ static enum XML_Error PTRCALL cdataSectionProcessor(XML_Parser parser, const char *start, const char *end, const char **endPtr) { enum XML_Error result = doCdataSection(parser, encoding, &start, end, endPtr); if (start) { if (parentParser) { /* we are parsing an external entity */ processor = externalEntityContentProcessor; return externalEntityContentProcessor(parser, start, end, endPtr); } else { processor = contentProcessor; return contentProcessor(parser, start, end, endPtr); } } return result; } /* startPtr gets set to non-null is the section is closed, and to null if the section is not yet closed. */ static enum XML_Error doCdataSection(XML_Parser parser, const ENCODING *enc, const char **startPtr, const char *end, const char **nextPtr) { const char *s = *startPtr; const char **eventPP; const char **eventEndPP; if (enc == encoding) { eventPP = &eventPtr; *eventPP = s; eventEndPP = &eventEndPtr; } else { eventPP = &(openInternalEntities->internalEventPtr); eventEndPP = &(openInternalEntities->internalEventEndPtr); } *eventPP = s; *startPtr = NULL; for (;;) { const char *next; int tok = XmlCdataSectionTok(enc, s, end, &next); *eventEndPP = next; switch (tok) { case XML_TOK_CDATA_SECT_CLOSE: if (endCdataSectionHandler) endCdataSectionHandler(handlerArg); #if 0 /* see comment under XML_TOK_CDATA_SECT_OPEN */ else if (characterDataHandler) characterDataHandler(handlerArg, dataBuf, 0); #endif else if (defaultHandler) reportDefault(parser, enc, s, next); *startPtr = next; return XML_ERROR_NONE; case XML_TOK_DATA_NEWLINE: if (characterDataHandler) { XML_Char c = 0xA; characterDataHandler(handlerArg, &c, 1); } else if (defaultHandler) reportDefault(parser, enc, s, next); break; case XML_TOK_DATA_CHARS: if (characterDataHandler) { if (MUST_CONVERT(enc, s)) { for (;;) { ICHAR *dataPtr = (ICHAR *)dataBuf; XmlConvert(enc, &s, next, &dataPtr, (ICHAR *)dataBufEnd); *eventEndPP = next; characterDataHandler(handlerArg, dataBuf, dataPtr - (ICHAR *)dataBuf); if (s == next) break; *eventPP = s; } } else characterDataHandler(handlerArg, (XML_Char *)s, (XML_Char *)next - (XML_Char *)s); } else if (defaultHandler) reportDefault(parser, enc, s, next); break; case XML_TOK_INVALID: *eventPP = next; return XML_ERROR_INVALID_TOKEN; case XML_TOK_PARTIAL_CHAR: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } return XML_ERROR_PARTIAL_CHAR; case XML_TOK_PARTIAL: case XML_TOK_NONE: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } return XML_ERROR_UNCLOSED_CDATA_SECTION; default: *eventPP = next; return XML_ERROR_UNEXPECTED_STATE; } *eventPP = s = next; } /* not reached */ } #ifdef XML_DTD /* The idea here is to avoid using stack for each IGNORE section when the whole file is parsed with one call. */ static enum XML_Error PTRCALL ignoreSectionProcessor(XML_Parser parser, const char *start, const char *end, const char **endPtr) { enum XML_Error result = doIgnoreSection(parser, encoding, &start, end, endPtr); if (start) { processor = prologProcessor; return prologProcessor(parser, start, end, endPtr); } return result; } /* startPtr gets set to non-null is the section is closed, and to null if the section is not yet closed. */ static enum XML_Error doIgnoreSection(XML_Parser parser, const ENCODING *enc, const char **startPtr, const char *end, const char **nextPtr) { const char *next; int tok; const char *s = *startPtr; const char **eventPP; const char **eventEndPP; if (enc == encoding) { eventPP = &eventPtr; *eventPP = s; eventEndPP = &eventEndPtr; } else { eventPP = &(openInternalEntities->internalEventPtr); eventEndPP = &(openInternalEntities->internalEventEndPtr); } *eventPP = s; *startPtr = NULL; tok = XmlIgnoreSectionTok(enc, s, end, &next); *eventEndPP = next; switch (tok) { case XML_TOK_IGNORE_SECT: if (defaultHandler) reportDefault(parser, enc, s, next); *startPtr = next; return XML_ERROR_NONE; case XML_TOK_INVALID: *eventPP = next; return XML_ERROR_INVALID_TOKEN; case XML_TOK_PARTIAL_CHAR: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } return XML_ERROR_PARTIAL_CHAR; case XML_TOK_PARTIAL: case XML_TOK_NONE: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } return XML_ERROR_SYNTAX; /* XML_ERROR_UNCLOSED_IGNORE_SECTION */ default: *eventPP = next; return XML_ERROR_UNEXPECTED_STATE; } /* not reached */ } #endif /* XML_DTD */ static enum XML_Error initializeEncoding(XML_Parser parser) { const char *s; #ifdef XML_UNICODE char encodingBuf[128]; if (!protocolEncodingName) s = NULL; else { int i; for (i = 0; protocolEncodingName[i]; i++) { if (i == sizeof(encodingBuf) - 1 || (protocolEncodingName[i] & ~0x7f) != 0) { encodingBuf[0] = '\0'; break; } encodingBuf[i] = (char)protocolEncodingName[i]; } encodingBuf[i] = '\0'; s = encodingBuf; } #else s = protocolEncodingName; #endif if ((ns ? XmlInitEncodingNS : XmlInitEncoding)(&initEncoding, &encoding, s)) return XML_ERROR_NONE; return handleUnknownEncoding(parser, protocolEncodingName); } static enum XML_Error processXmlDecl(XML_Parser parser, int isGeneralTextEntity, const char *s, const char *next) { const char *encodingName = NULL; const XML_Char *storedEncName = NULL; const ENCODING *newEncoding = NULL; const char *version = NULL; const char *versionend; const XML_Char *storedversion = NULL; int standalone = -1; if (!(ns ? XmlParseXmlDeclNS : XmlParseXmlDecl)(isGeneralTextEntity, encoding, s, next, &eventPtr, &version, &versionend, &encodingName, &newEncoding, &standalone)) return XML_ERROR_SYNTAX; if (!isGeneralTextEntity && standalone == 1) { _dtd->standalone = XML_TRUE; #ifdef XML_DTD if (paramEntityParsing == XML_PARAM_ENTITY_PARSING_UNLESS_STANDALONE) paramEntityParsing = XML_PARAM_ENTITY_PARSING_NEVER; #endif /* XML_DTD */ } if (xmlDeclHandler) { if (encodingName != NULL) { storedEncName = poolStoreString(&temp2Pool, encoding, encodingName, encodingName + XmlNameLength(encoding, encodingName)); if (!storedEncName) return XML_ERROR_NO_MEMORY; poolFinish(&temp2Pool); } if (version) { storedversion = poolStoreString(&temp2Pool, encoding, version, versionend - encoding->minBytesPerChar); if (!storedversion) return XML_ERROR_NO_MEMORY; } xmlDeclHandler(handlerArg, storedversion, storedEncName, standalone); } else if (defaultHandler) reportDefault(parser, encoding, s, next); if (protocolEncodingName == NULL) { if (newEncoding) { if (newEncoding->minBytesPerChar != encoding->minBytesPerChar) { eventPtr = encodingName; return XML_ERROR_INCORRECT_ENCODING; } encoding = newEncoding; } else if (encodingName) { enum XML_Error result; if (!storedEncName) { storedEncName = poolStoreString( &temp2Pool, encoding, encodingName, encodingName + XmlNameLength(encoding, encodingName)); if (!storedEncName) return XML_ERROR_NO_MEMORY; } result = handleUnknownEncoding(parser, storedEncName); poolClear(&temp2Pool); if (result == XML_ERROR_UNKNOWN_ENCODING) eventPtr = encodingName; return result; } } if (storedEncName || storedversion) poolClear(&temp2Pool); return XML_ERROR_NONE; } static enum XML_Error handleUnknownEncoding(XML_Parser parser, const XML_Char *encodingName) { if (unknownEncodingHandler) { XML_Encoding info; int i; for (i = 0; i < 256; i++) info.map[i] = -1; info.convert = NULL; info.data = NULL; info.release = NULL; if (unknownEncodingHandler(unknownEncodingHandlerData, encodingName, &info)) { ENCODING *enc; unknownEncodingMem = MALLOC(XmlSizeOfUnknownEncoding()); if (!unknownEncodingMem) { if (info.release) info.release(info.data); return XML_ERROR_NO_MEMORY; } enc = (ns ? XmlInitUnknownEncodingNS : XmlInitUnknownEncoding)(unknownEncodingMem, info.map, info.convert, info.data); if (enc) { unknownEncodingData = info.data; unknownEncodingRelease = info.release; encoding = enc; return XML_ERROR_NONE; } } if (info.release != NULL) info.release(info.data); } return XML_ERROR_UNKNOWN_ENCODING; } static enum XML_Error PTRCALL prologInitProcessor(XML_Parser parser, const char *s, const char *end, const char **nextPtr) { enum XML_Error result = initializeEncoding(parser); if (result != XML_ERROR_NONE) return result; processor = prologProcessor; return prologProcessor(parser, s, end, nextPtr); } #ifdef XML_DTD static enum XML_Error PTRCALL externalParEntInitProcessor(XML_Parser parser, const char *s, const char *end, const char **nextPtr) { enum XML_Error result = initializeEncoding(parser); if (result != XML_ERROR_NONE) return result; /* we know now that XML_Parse(Buffer) has been called, so we consider the external parameter entity read */ _dtd->paramEntityRead = XML_TRUE; if (prologState.inEntityValue) { processor = entityValueInitProcessor; return entityValueInitProcessor(parser, s, end, nextPtr); } else { processor = externalParEntProcessor; return externalParEntProcessor(parser, s, end, nextPtr); } } static enum XML_Error PTRCALL entityValueInitProcessor(XML_Parser parser, const char *s, const char *end, const char **nextPtr) { const char *start = s; const char *next = s; int tok; for (;;) { tok = XmlPrologTok(encoding, start, end, &next); if (tok <= 0) { if (nextPtr != 0 && tok != XML_TOK_INVALID) { *nextPtr = s; return XML_ERROR_NONE; } switch (tok) { case XML_TOK_INVALID: return XML_ERROR_INVALID_TOKEN; case XML_TOK_PARTIAL: return XML_ERROR_UNCLOSED_TOKEN; case XML_TOK_PARTIAL_CHAR: return XML_ERROR_PARTIAL_CHAR; case XML_TOK_NONE: /* start == end */ default: break; } return storeEntityValue(parser, encoding, s, end); } else if (tok == XML_TOK_XML_DECL) { enum XML_Error result = processXmlDecl(parser, 0, start, next); if (result != XML_ERROR_NONE) return result; if (nextPtr) *nextPtr = next; /* stop scanning for text declaration - we found one */ processor = entityValueProcessor; return entityValueProcessor(parser, next, end, nextPtr); } /* If we are at the end of the buffer, this would cause XmlPrologTok to return XML_TOK_NONE on the next call, which would then cause the function to exit with *nextPtr set to s - that is what we want for other tokens, but not for the BOM - we would rather like to skip it; then, when this routine is entered the next time, XmlPrologTok will return XML_TOK_INVALID, since the BOM is still in the buffer */ else if (tok == XML_TOK_BOM && next == end && nextPtr) { *nextPtr = next; return XML_ERROR_NONE; } start = next; } } static enum XML_Error PTRCALL externalParEntProcessor(XML_Parser parser, const char *s, const char *end, const char **nextPtr) { const char *start = s; const char *next = s; int tok; tok = XmlPrologTok(encoding, start, end, &next); if (tok <= 0) { if (nextPtr != 0 && tok != XML_TOK_INVALID) { *nextPtr = s; return XML_ERROR_NONE; } switch (tok) { case XML_TOK_INVALID: return XML_ERROR_INVALID_TOKEN; case XML_TOK_PARTIAL: return XML_ERROR_UNCLOSED_TOKEN; case XML_TOK_PARTIAL_CHAR: return XML_ERROR_PARTIAL_CHAR; case XML_TOK_NONE: /* start == end */ default: break; } } /* This would cause the next stage, i.e. doProlog to be passed XML_TOK_BOM. However, when parsing an external subset, doProlog will not accept a BOM as valid, and report a syntax error, so we have to skip the BOM */ else if (tok == XML_TOK_BOM) { s = next; tok = XmlPrologTok(encoding, s, end, &next); } processor = prologProcessor; return doProlog(parser, encoding, s, end, tok, next, nextPtr); } static enum XML_Error PTRCALL entityValueProcessor(XML_Parser parser, const char *s, const char *end, const char **nextPtr) { const char *start = s; const char *next = s; const ENCODING *enc = encoding; int tok; for (;;) { tok = XmlPrologTok(enc, start, end, &next); if (tok <= 0) { if (nextPtr != 0 && tok != XML_TOK_INVALID) { *nextPtr = s; return XML_ERROR_NONE; } switch (tok) { case XML_TOK_INVALID: return XML_ERROR_INVALID_TOKEN; case XML_TOK_PARTIAL: return XML_ERROR_UNCLOSED_TOKEN; case XML_TOK_PARTIAL_CHAR: return XML_ERROR_PARTIAL_CHAR; case XML_TOK_NONE: /* start == end */ default: break; } return storeEntityValue(parser, enc, s, end); } start = next; } } #endif /* XML_DTD */ static enum XML_Error PTRCALL prologProcessor(XML_Parser parser, const char *s, const char *end, const char **nextPtr) { const char *next = s; int tok = XmlPrologTok(encoding, s, end, &next); return doProlog(parser, encoding, s, end, tok, next, nextPtr); } static enum XML_Error doProlog(XML_Parser parser, const ENCODING *enc, const char *s, const char *end, int tok, const char *next, const char **nextPtr) { #ifdef XML_DTD static const XML_Char externalSubsetName[] = { '#' , '\0' }; #endif /* XML_DTD */ static const XML_Char atypeCDATA[] = { 'C', 'D', 'A', 'T', 'A', '\0' }; static const XML_Char atypeID[] = { 'I', 'D', '\0' }; static const XML_Char atypeIDREF[] = { 'I', 'D', 'R', 'E', 'F', '\0' }; static const XML_Char atypeIDREFS[] = { 'I', 'D', 'R', 'E', 'F', 'S', '\0' }; static const XML_Char atypeENTITY[] = { 'E', 'N', 'T', 'I', 'T', 'Y', '\0' }; static const XML_Char atypeENTITIES[] = { 'E', 'N', 'T', 'I', 'T', 'I', 'E', 'S', '\0' }; static const XML_Char atypeNMTOKEN[] = { 'N', 'M', 'T', 'O', 'K', 'E', 'N', '\0' }; static const XML_Char atypeNMTOKENS[] = { 'N', 'M', 'T', 'O', 'K', 'E', 'N', 'S', '\0' }; static const XML_Char notationPrefix[] = { 'N', 'O', 'T', 'A', 'T', 'I', 'O', 'N', '(', '\0' }; static const XML_Char enumValueSep[] = { '|', '\0' }; static const XML_Char enumValueStart[] = { '(', '\0' }; DTD * const dtd = _dtd; /* save one level of indirection */ const char **eventPP; const char **eventEndPP; enum XML_Content_Quant quant; if (enc == encoding) { eventPP = &eventPtr; eventEndPP = &eventEndPtr; } else { eventPP = &(openInternalEntities->internalEventPtr); eventEndPP = &(openInternalEntities->internalEventEndPtr); } for (;;) { int role; XML_Bool handleDefault = XML_TRUE; *eventPP = s; *eventEndPP = next; if (tok <= 0) { if (nextPtr != 0 && tok != XML_TOK_INVALID) { *nextPtr = s; return XML_ERROR_NONE; } switch (tok) { case XML_TOK_INVALID: *eventPP = next; return XML_ERROR_INVALID_TOKEN; case XML_TOK_PARTIAL: return XML_ERROR_UNCLOSED_TOKEN; case XML_TOK_PARTIAL_CHAR: return XML_ERROR_PARTIAL_CHAR; case XML_TOK_NONE: #ifdef XML_DTD if (enc != encoding) return XML_ERROR_NONE; if (isParamEntity) { if (XmlTokenRole(&prologState, XML_TOK_NONE, end, end, enc) == XML_ROLE_ERROR) return XML_ERROR_SYNTAX; return XML_ERROR_NONE; } #endif /* XML_DTD */ return XML_ERROR_NO_ELEMENTS; default: tok = -tok; next = end; break; } } role = XmlTokenRole(&prologState, tok, s, next, enc); switch (role) { case XML_ROLE_XML_DECL: { enum XML_Error result = processXmlDecl(parser, 0, s, next); if (result != XML_ERROR_NONE) return result; enc = encoding; handleDefault = XML_FALSE; } break; case XML_ROLE_DOCTYPE_NAME: if (startDoctypeDeclHandler) { doctypeName = poolStoreString(&tempPool, enc, s, next); if (!doctypeName) return XML_ERROR_NO_MEMORY; poolFinish(&tempPool); doctypePubid = NULL; handleDefault = XML_FALSE; } doctypeSysid = NULL; /* always initialize to NULL */ break; case XML_ROLE_DOCTYPE_INTERNAL_SUBSET: if (startDoctypeDeclHandler) { startDoctypeDeclHandler(handlerArg, doctypeName, doctypeSysid, doctypePubid, 1); doctypeName = NULL; poolClear(&tempPool); handleDefault = XML_FALSE; } break; #ifdef XML_DTD case XML_ROLE_TEXT_DECL: { enum XML_Error result = processXmlDecl(parser, 1, s, next); if (result != XML_ERROR_NONE) return result; enc = encoding; handleDefault = XML_FALSE; } break; #endif /* XML_DTD */ case XML_ROLE_DOCTYPE_PUBLIC_ID: #ifdef XML_DTD useForeignDTD = XML_FALSE; #endif /* XML_DTD */ dtd->hasParamEntityRefs = XML_TRUE; if (startDoctypeDeclHandler) { doctypePubid = poolStoreString(&tempPool, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar); if (!doctypePubid) return XML_ERROR_NO_MEMORY; poolFinish(&tempPool); handleDefault = XML_FALSE; } #ifdef XML_DTD declEntity = (ENTITY *)lookup(&dtd->paramEntities, externalSubsetName, sizeof(ENTITY)); if (!declEntity) return XML_ERROR_NO_MEMORY; #endif /* XML_DTD */ /* fall through */ case XML_ROLE_ENTITY_PUBLIC_ID: if (!XmlIsPublicId(enc, s, next, eventPP)) return XML_ERROR_SYNTAX; if (dtd->keepProcessing && declEntity) { XML_Char *tem = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar); if (!tem) return XML_ERROR_NO_MEMORY; normalizePublicId(tem); declEntity->publicId = tem; poolFinish(&dtd->pool); if (entityDeclHandler) handleDefault = XML_FALSE; } break; case XML_ROLE_DOCTYPE_CLOSE: if (doctypeName) { startDoctypeDeclHandler(handlerArg, doctypeName, doctypeSysid, doctypePubid, 0); poolClear(&tempPool); handleDefault = XML_FALSE; } /* doctypeSysid will be non-NULL in the case of a previous XML_ROLE_DOCTYPE_SYSTEM_ID, even if startDoctypeDeclHandler was not set, indicating an external subset */ #ifdef XML_DTD if (doctypeSysid || useForeignDTD) { dtd->hasParamEntityRefs = XML_TRUE; /* when docTypeSysid == NULL */ if (paramEntityParsing && externalEntityRefHandler) { ENTITY *entity = (ENTITY *)lookup(&dtd->paramEntities, externalSubsetName, sizeof(ENTITY)); if (!entity) return XML_ERROR_NO_MEMORY; if (useForeignDTD) entity->base = curBase; dtd->paramEntityRead = XML_FALSE; if (!externalEntityRefHandler(externalEntityRefHandlerArg, 0, entity->base, entity->systemId, entity->publicId)) return XML_ERROR_EXTERNAL_ENTITY_HANDLING; if (dtd->paramEntityRead && !dtd->standalone && notStandaloneHandler && !notStandaloneHandler(handlerArg)) return XML_ERROR_NOT_STANDALONE; /* end of DTD - no need to update dtd->keepProcessing */ } useForeignDTD = XML_FALSE; } #endif /* XML_DTD */ if (endDoctypeDeclHandler) { endDoctypeDeclHandler(handlerArg); handleDefault = XML_FALSE; } break; case XML_ROLE_INSTANCE_START: #ifdef XML_DTD /* if there is no DOCTYPE declaration then now is the last chance to read the foreign DTD */ if (useForeignDTD) { dtd->hasParamEntityRefs = XML_TRUE; if (paramEntityParsing && externalEntityRefHandler) { ENTITY *entity = (ENTITY *)lookup(&dtd->paramEntities, externalSubsetName, sizeof(ENTITY)); if (!entity) return XML_ERROR_NO_MEMORY; entity->base = curBase; dtd->paramEntityRead = XML_FALSE; if (!externalEntityRefHandler(externalEntityRefHandlerArg, 0, entity->base, entity->systemId, entity->publicId)) return XML_ERROR_EXTERNAL_ENTITY_HANDLING; if (dtd->paramEntityRead && !dtd->standalone && notStandaloneHandler && !notStandaloneHandler(handlerArg)) return XML_ERROR_NOT_STANDALONE; /* end of DTD - no need to update dtd->keepProcessing */ } } #endif /* XML_DTD */ processor = contentProcessor; return contentProcessor(parser, s, end, nextPtr); case XML_ROLE_ATTLIST_ELEMENT_NAME: declElementType = getElementType(parser, enc, s, next); if (!declElementType) return XML_ERROR_NO_MEMORY; goto checkAttListDeclHandler; case XML_ROLE_ATTRIBUTE_NAME: declAttributeId = getAttributeId(parser, enc, s, next); if (!declAttributeId) return XML_ERROR_NO_MEMORY; declAttributeIsCdata = XML_FALSE; declAttributeType = NULL; declAttributeIsId = XML_FALSE; goto checkAttListDeclHandler; case XML_ROLE_ATTRIBUTE_TYPE_CDATA: declAttributeIsCdata = XML_TRUE; declAttributeType = atypeCDATA; goto checkAttListDeclHandler; case XML_ROLE_ATTRIBUTE_TYPE_ID: declAttributeIsId = XML_TRUE; declAttributeType = atypeID; goto checkAttListDeclHandler; case XML_ROLE_ATTRIBUTE_TYPE_IDREF: declAttributeType = atypeIDREF; goto checkAttListDeclHandler; case XML_ROLE_ATTRIBUTE_TYPE_IDREFS: declAttributeType = atypeIDREFS; goto checkAttListDeclHandler; case XML_ROLE_ATTRIBUTE_TYPE_ENTITY: declAttributeType = atypeENTITY; goto checkAttListDeclHandler; case XML_ROLE_ATTRIBUTE_TYPE_ENTITIES: declAttributeType = atypeENTITIES; goto checkAttListDeclHandler; case XML_ROLE_ATTRIBUTE_TYPE_NMTOKEN: declAttributeType = atypeNMTOKEN; goto checkAttListDeclHandler; case XML_ROLE_ATTRIBUTE_TYPE_NMTOKENS: declAttributeType = atypeNMTOKENS; checkAttListDeclHandler: if (dtd->keepProcessing && attlistDeclHandler) handleDefault = XML_FALSE; break; case XML_ROLE_ATTRIBUTE_ENUM_VALUE: case XML_ROLE_ATTRIBUTE_NOTATION_VALUE: if (dtd->keepProcessing && attlistDeclHandler) { const XML_Char *prefix; if (declAttributeType) { prefix = enumValueSep; } else { prefix = (role == XML_ROLE_ATTRIBUTE_NOTATION_VALUE ? notationPrefix : enumValueStart); } if (!poolAppendString(&tempPool, prefix)) return XML_ERROR_NO_MEMORY; if (!poolAppend(&tempPool, enc, s, next)) return XML_ERROR_NO_MEMORY; declAttributeType = tempPool.start; handleDefault = XML_FALSE; } break; case XML_ROLE_IMPLIED_ATTRIBUTE_VALUE: case XML_ROLE_REQUIRED_ATTRIBUTE_VALUE: if (dtd->keepProcessing) { if (!defineAttribute(declElementType, declAttributeId, declAttributeIsCdata, declAttributeIsId, 0, parser)) return XML_ERROR_NO_MEMORY; if (attlistDeclHandler && declAttributeType) { if (*declAttributeType == XML_T('(') || (*declAttributeType == XML_T('N') && declAttributeType[1] == XML_T('O'))) { /* Enumerated or Notation type */ if (!poolAppendChar(&tempPool, XML_T(')')) || !poolAppendChar(&tempPool, XML_T('\0'))) return XML_ERROR_NO_MEMORY; declAttributeType = tempPool.start; poolFinish(&tempPool); } *eventEndPP = s; attlistDeclHandler(handlerArg, declElementType->name, declAttributeId->name, declAttributeType, 0, role == XML_ROLE_REQUIRED_ATTRIBUTE_VALUE); poolClear(&tempPool); handleDefault = XML_FALSE; } } break; case XML_ROLE_DEFAULT_ATTRIBUTE_VALUE: case XML_ROLE_FIXED_ATTRIBUTE_VALUE: if (dtd->keepProcessing) { const XML_Char *attVal; enum XML_Error result = storeAttributeValue(parser, enc, declAttributeIsCdata, s + enc->minBytesPerChar, next - enc->minBytesPerChar, &dtd->pool); if (result) return result; attVal = poolStart(&dtd->pool); poolFinish(&dtd->pool); /* ID attributes aren't allowed to have a default */ if (!defineAttribute(declElementType, declAttributeId, declAttributeIsCdata, XML_FALSE, attVal, parser)) return XML_ERROR_NO_MEMORY; if (attlistDeclHandler && declAttributeType) { if (*declAttributeType == XML_T('(') || (*declAttributeType == XML_T('N') && declAttributeType[1] == XML_T('O'))) { /* Enumerated or Notation type */ if (!poolAppendChar(&tempPool, XML_T(')')) || !poolAppendChar(&tempPool, XML_T('\0'))) return XML_ERROR_NO_MEMORY; declAttributeType = tempPool.start; poolFinish(&tempPool); } *eventEndPP = s; attlistDeclHandler(handlerArg, declElementType->name, declAttributeId->name, declAttributeType, attVal, role == XML_ROLE_FIXED_ATTRIBUTE_VALUE); poolClear(&tempPool); handleDefault = XML_FALSE; } } break; case XML_ROLE_ENTITY_VALUE: if (dtd->keepProcessing) { enum XML_Error result = storeEntityValue(parser, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar); if (declEntity) { declEntity->textPtr = poolStart(&dtd->entityValuePool); declEntity->textLen = poolLength(&dtd->entityValuePool); poolFinish(&dtd->entityValuePool); if (entityDeclHandler) { *eventEndPP = s; entityDeclHandler(handlerArg, declEntity->name, declEntity->is_param, declEntity->textPtr, declEntity->textLen, curBase, 0, 0, 0); handleDefault = XML_FALSE; } } else poolDiscard(&dtd->entityValuePool); if (result != XML_ERROR_NONE) return result; } break; case XML_ROLE_DOCTYPE_SYSTEM_ID: #ifdef XML_DTD useForeignDTD = XML_FALSE; #endif /* XML_DTD */ dtd->hasParamEntityRefs = XML_TRUE; if (startDoctypeDeclHandler) { doctypeSysid = poolStoreString(&tempPool, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar); if (doctypeSysid == NULL) return XML_ERROR_NO_MEMORY; poolFinish(&tempPool); handleDefault = XML_FALSE; } #ifdef XML_DTD else /* use externalSubsetName to make doctypeSysid non-NULL for the case where no startDoctypeDeclHandler is set */ doctypeSysid = externalSubsetName; #endif /* XML_DTD */ if (!dtd->standalone #ifdef XML_DTD && !paramEntityParsing #endif /* XML_DTD */ && notStandaloneHandler && !notStandaloneHandler(handlerArg)) return XML_ERROR_NOT_STANDALONE; #ifndef XML_DTD break; #else /* XML_DTD */ if (!declEntity) { declEntity = (ENTITY *)lookup(&dtd->paramEntities, externalSubsetName, sizeof(ENTITY)); if (!declEntity) return XML_ERROR_NO_MEMORY; declEntity->publicId = NULL; } /* fall through */ #endif /* XML_DTD */ case XML_ROLE_ENTITY_SYSTEM_ID: if (dtd->keepProcessing && declEntity) { declEntity->systemId = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar); if (!declEntity->systemId) return XML_ERROR_NO_MEMORY; declEntity->base = curBase; poolFinish(&dtd->pool); if (entityDeclHandler) handleDefault = XML_FALSE; } break; case XML_ROLE_ENTITY_COMPLETE: if (dtd->keepProcessing && declEntity && entityDeclHandler) { *eventEndPP = s; entityDeclHandler(handlerArg, declEntity->name, declEntity->is_param, 0,0, declEntity->base, declEntity->systemId, declEntity->publicId, 0); handleDefault = XML_FALSE; } break; case XML_ROLE_ENTITY_NOTATION_NAME: if (dtd->keepProcessing && declEntity) { declEntity->notation = poolStoreString(&dtd->pool, enc, s, next); if (!declEntity->notation) return XML_ERROR_NO_MEMORY; poolFinish(&dtd->pool); if (unparsedEntityDeclHandler) { *eventEndPP = s; unparsedEntityDeclHandler(handlerArg, declEntity->name, declEntity->base, declEntity->systemId, declEntity->publicId, declEntity->notation); handleDefault = XML_FALSE; } else if (entityDeclHandler) { *eventEndPP = s; entityDeclHandler(handlerArg, declEntity->name, 0,0,0, declEntity->base, declEntity->systemId, declEntity->publicId, declEntity->notation); handleDefault = XML_FALSE; } } break; case XML_ROLE_GENERAL_ENTITY_NAME: { if (XmlPredefinedEntityName(enc, s, next)) { declEntity = NULL; break; } if (dtd->keepProcessing) { const XML_Char *name = poolStoreString(&dtd->pool, enc, s, next); if (!name) return XML_ERROR_NO_MEMORY; declEntity = (ENTITY *)lookup(&dtd->generalEntities, name, sizeof(ENTITY)); if (!declEntity) return XML_ERROR_NO_MEMORY; if (declEntity->name != name) { poolDiscard(&dtd->pool); declEntity = NULL; } else { poolFinish(&dtd->pool); declEntity->publicId = NULL; declEntity->is_param = XML_FALSE; /* if we have a parent parser or are reading an internal parameter entity, then the entity declaration is not considered "internal" */ declEntity->is_internal = !(parentParser || openInternalEntities); if (entityDeclHandler) handleDefault = XML_FALSE; } } else { poolDiscard(&dtd->pool); declEntity = NULL; } } break; case XML_ROLE_PARAM_ENTITY_NAME: #ifdef XML_DTD if (dtd->keepProcessing) { const XML_Char *name = poolStoreString(&dtd->pool, enc, s, next); if (!name) return XML_ERROR_NO_MEMORY; declEntity = (ENTITY *)lookup(&dtd->paramEntities, name, sizeof(ENTITY)); if (!declEntity) return XML_ERROR_NO_MEMORY; if (declEntity->name != name) { poolDiscard(&dtd->pool); declEntity = NULL; } else { poolFinish(&dtd->pool); declEntity->publicId = NULL; declEntity->is_param = XML_TRUE; /* if we have a parent parser or are reading an internal parameter entity, then the entity declaration is not considered "internal" */ declEntity->is_internal = !(parentParser || openInternalEntities); if (entityDeclHandler) handleDefault = XML_FALSE; } } else { poolDiscard(&dtd->pool); declEntity = NULL; } #else /* not XML_DTD */ declEntity = NULL; #endif /* XML_DTD */ break; case XML_ROLE_NOTATION_NAME: declNotationPublicId = NULL; declNotationName = NULL; if (notationDeclHandler) { declNotationName = poolStoreString(&tempPool, enc, s, next); if (!declNotationName) return XML_ERROR_NO_MEMORY; poolFinish(&tempPool); handleDefault = XML_FALSE; } break; case XML_ROLE_NOTATION_PUBLIC_ID: if (!XmlIsPublicId(enc, s, next, eventPP)) return XML_ERROR_SYNTAX; if (declNotationName) { /* means notationDeclHandler != NULL */ XML_Char *tem = poolStoreString(&tempPool, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar); if (!tem) return XML_ERROR_NO_MEMORY; normalizePublicId(tem); declNotationPublicId = tem; poolFinish(&tempPool); handleDefault = XML_FALSE; } break; case XML_ROLE_NOTATION_SYSTEM_ID: if (declNotationName && notationDeclHandler) { const XML_Char *systemId = poolStoreString(&tempPool, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar); if (!systemId) return XML_ERROR_NO_MEMORY; *eventEndPP = s; notationDeclHandler(handlerArg, declNotationName, curBase, systemId, declNotationPublicId); handleDefault = XML_FALSE; } poolClear(&tempPool); break; case XML_ROLE_NOTATION_NO_SYSTEM_ID: if (declNotationPublicId && notationDeclHandler) { *eventEndPP = s; notationDeclHandler(handlerArg, declNotationName, curBase, 0, declNotationPublicId); handleDefault = XML_FALSE; } poolClear(&tempPool); break; case XML_ROLE_ERROR: switch (tok) { case XML_TOK_PARAM_ENTITY_REF: return XML_ERROR_PARAM_ENTITY_REF; case XML_TOK_XML_DECL: return XML_ERROR_MISPLACED_XML_PI; default: return XML_ERROR_SYNTAX; } #ifdef XML_DTD case XML_ROLE_IGNORE_SECT: { enum XML_Error result; if (defaultHandler) reportDefault(parser, enc, s, next); handleDefault = XML_FALSE; result = doIgnoreSection(parser, enc, &next, end, nextPtr); if (!next) { processor = ignoreSectionProcessor; return result; } } break; #endif /* XML_DTD */ case XML_ROLE_GROUP_OPEN: if (prologState.level >= groupSize) { if (groupSize) { char *temp = (char *)REALLOC(groupConnector, groupSize *= 2); if (temp == NULL) return XML_ERROR_NO_MEMORY; groupConnector = temp; if (dtd->scaffIndex) { int *temp = (int *)REALLOC(dtd->scaffIndex, groupSize * sizeof(int)); if (temp == NULL) return XML_ERROR_NO_MEMORY; dtd->scaffIndex = temp; } } else { groupConnector = (char *)MALLOC(groupSize = 32); if (!groupConnector) return XML_ERROR_NO_MEMORY; } } groupConnector[prologState.level] = 0; if (dtd->in_eldecl) { int myindex = nextScaffoldPart(parser); if (myindex < 0) return XML_ERROR_NO_MEMORY; dtd->scaffIndex[dtd->scaffLevel] = myindex; dtd->scaffLevel++; dtd->scaffold[myindex].type = XML_CTYPE_SEQ; if (elementDeclHandler) handleDefault = XML_FALSE; } break; case XML_ROLE_GROUP_SEQUENCE: if (groupConnector[prologState.level] == '|') return XML_ERROR_SYNTAX; groupConnector[prologState.level] = ','; if (dtd->in_eldecl && elementDeclHandler) handleDefault = XML_FALSE; break; case XML_ROLE_GROUP_CHOICE: if (groupConnector[prologState.level] == ',') return XML_ERROR_SYNTAX; if (dtd->in_eldecl && !groupConnector[prologState.level] && (dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type != XML_CTYPE_MIXED) ) { dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type = XML_CTYPE_CHOICE; if (elementDeclHandler) handleDefault = XML_FALSE; } groupConnector[prologState.level] = '|'; break; case XML_ROLE_PARAM_ENTITY_REF: #ifdef XML_DTD case XML_ROLE_INNER_PARAM_ENTITY_REF: /* PE references in internal subset are not allowed within declarations */ if (prologState.documentEntity && role == XML_ROLE_INNER_PARAM_ENTITY_REF) return XML_ERROR_PARAM_ENTITY_REF; dtd->hasParamEntityRefs = XML_TRUE; if (!paramEntityParsing) dtd->keepProcessing = dtd->standalone; else { const XML_Char *name; ENTITY *entity; name = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar); if (!name) return XML_ERROR_NO_MEMORY; entity = (ENTITY *)lookup(&dtd->paramEntities, name, 0); poolDiscard(&dtd->pool); /* first, determine if a check for an existing declaration is needed; if yes, check that the entity exists, and that it is internal, otherwise call the skipped entity handler */ if (prologState.documentEntity && (dtd->standalone ? !openInternalEntities : !dtd->hasParamEntityRefs)) { if (!entity) return XML_ERROR_UNDEFINED_ENTITY; else if (!entity->is_internal) return XML_ERROR_ENTITY_DECLARED_IN_PE; } else if (!entity) { dtd->keepProcessing = dtd->standalone; /* cannot report skipped entities in declarations */ if ((role == XML_ROLE_PARAM_ENTITY_REF) && skippedEntityHandler) { skippedEntityHandler(handlerArg, name, 1); handleDefault = XML_FALSE; } break; } if (entity->open) return XML_ERROR_RECURSIVE_ENTITY_REF; if (entity->textPtr) { enum XML_Error result; result = processInternalParamEntity(parser, entity); if (result != XML_ERROR_NONE) return result; handleDefault = XML_FALSE; break; } if (externalEntityRefHandler) { dtd->paramEntityRead = XML_FALSE; entity->open = XML_TRUE; if (!externalEntityRefHandler(externalEntityRefHandlerArg, 0, entity->base, entity->systemId, entity->publicId)) { entity->open = XML_FALSE; return XML_ERROR_EXTERNAL_ENTITY_HANDLING; } entity->open = XML_FALSE; handleDefault = XML_FALSE; if (!dtd->paramEntityRead) { dtd->keepProcessing = dtd->standalone; break; } } else { dtd->keepProcessing = dtd->standalone; break; } } #endif /* XML_DTD */ if (!dtd->standalone && notStandaloneHandler && !notStandaloneHandler(handlerArg)) return XML_ERROR_NOT_STANDALONE; break; /* Element declaration stuff */ case XML_ROLE_ELEMENT_NAME: if (elementDeclHandler) { declElementType = getElementType(parser, enc, s, next); if (!declElementType) return XML_ERROR_NO_MEMORY; dtd->scaffLevel = 0; dtd->scaffCount = 0; dtd->in_eldecl = XML_TRUE; handleDefault = XML_FALSE; } break; case XML_ROLE_CONTENT_ANY: case XML_ROLE_CONTENT_EMPTY: if (dtd->in_eldecl) { if (elementDeclHandler) { XML_Content * content = (XML_Content *) MALLOC(sizeof(XML_Content)); if (!content) return XML_ERROR_NO_MEMORY; content->quant = XML_CQUANT_NONE; content->name = NULL; content->numchildren = 0; content->children = NULL; content->type = ((role == XML_ROLE_CONTENT_ANY) ? XML_CTYPE_ANY : XML_CTYPE_EMPTY); *eventEndPP = s; elementDeclHandler(handlerArg, declElementType->name, content); handleDefault = XML_FALSE; } dtd->in_eldecl = XML_FALSE; } break; case XML_ROLE_CONTENT_PCDATA: if (dtd->in_eldecl) { dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type = XML_CTYPE_MIXED; if (elementDeclHandler) handleDefault = XML_FALSE; } break; case XML_ROLE_CONTENT_ELEMENT: quant = XML_CQUANT_NONE; goto elementContent; case XML_ROLE_CONTENT_ELEMENT_OPT: quant = XML_CQUANT_OPT; goto elementContent; case XML_ROLE_CONTENT_ELEMENT_REP: quant = XML_CQUANT_REP; goto elementContent; case XML_ROLE_CONTENT_ELEMENT_PLUS: quant = XML_CQUANT_PLUS; elementContent: if (dtd->in_eldecl) { ELEMENT_TYPE *el; const XML_Char *name; int nameLen; const char *nxt = (quant == XML_CQUANT_NONE ? next : next - enc->minBytesPerChar); int myindex = nextScaffoldPart(parser); if (myindex < 0) return XML_ERROR_NO_MEMORY; dtd->scaffold[myindex].type = XML_CTYPE_NAME; dtd->scaffold[myindex].quant = quant; el = getElementType(parser, enc, s, nxt); if (!el) return XML_ERROR_NO_MEMORY; name = el->name; dtd->scaffold[myindex].name = name; nameLen = 0; for (; name[nameLen++]; ); dtd->contentStringLen += nameLen; if (elementDeclHandler) handleDefault = XML_FALSE; } break; case XML_ROLE_GROUP_CLOSE: quant = XML_CQUANT_NONE; goto closeGroup; case XML_ROLE_GROUP_CLOSE_OPT: quant = XML_CQUANT_OPT; goto closeGroup; case XML_ROLE_GROUP_CLOSE_REP: quant = XML_CQUANT_REP; goto closeGroup; case XML_ROLE_GROUP_CLOSE_PLUS: quant = XML_CQUANT_PLUS; closeGroup: if (dtd->in_eldecl) { if (elementDeclHandler) handleDefault = XML_FALSE; dtd->scaffLevel--; dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel]].quant = quant; if (dtd->scaffLevel == 0) { if (!handleDefault) { XML_Content *model = build_model(parser); if (!model) return XML_ERROR_NO_MEMORY; *eventEndPP = s; elementDeclHandler(handlerArg, declElementType->name, model); } dtd->in_eldecl = XML_FALSE; dtd->contentStringLen = 0; } } break; /* End element declaration stuff */ case XML_ROLE_PI: if (!reportProcessingInstruction(parser, enc, s, next)) return XML_ERROR_NO_MEMORY; handleDefault = XML_FALSE; break; case XML_ROLE_COMMENT: if (!reportComment(parser, enc, s, next)) return XML_ERROR_NO_MEMORY; handleDefault = XML_FALSE; break; case XML_ROLE_NONE: switch (tok) { case XML_TOK_BOM: handleDefault = XML_FALSE; break; } break; case XML_ROLE_DOCTYPE_NONE: if (startDoctypeDeclHandler) handleDefault = XML_FALSE; break; case XML_ROLE_ENTITY_NONE: if (dtd->keepProcessing && entityDeclHandler) handleDefault = XML_FALSE; break; case XML_ROLE_NOTATION_NONE: if (notationDeclHandler) handleDefault = XML_FALSE; break; case XML_ROLE_ATTLIST_NONE: if (dtd->keepProcessing && attlistDeclHandler) handleDefault = XML_FALSE; break; case XML_ROLE_ELEMENT_NONE: if (elementDeclHandler) handleDefault = XML_FALSE; break; } /* end of big switch */ if (handleDefault && defaultHandler) reportDefault(parser, enc, s, next); s = next; tok = XmlPrologTok(enc, s, end, &next); } /* not reached */ } static enum XML_Error PTRCALL epilogProcessor(XML_Parser parser, const char *s, const char *end, const char **nextPtr) { processor = epilogProcessor; eventPtr = s; for (;;) { const char *next = NULL; int tok = XmlPrologTok(encoding, s, end, &next); eventEndPtr = next; switch (tok) { /* report partial linebreak - it might be the last token */ case -XML_TOK_PROLOG_S: if (defaultHandler) { eventEndPtr = next; reportDefault(parser, encoding, s, next); } if (nextPtr) *nextPtr = next; return XML_ERROR_NONE; case XML_TOK_NONE: if (nextPtr) *nextPtr = s; return XML_ERROR_NONE; case XML_TOK_PROLOG_S: if (defaultHandler) reportDefault(parser, encoding, s, next); break; case XML_TOK_PI: if (!reportProcessingInstruction(parser, encoding, s, next)) return XML_ERROR_NO_MEMORY; break; case XML_TOK_COMMENT: if (!reportComment(parser, encoding, s, next)) return XML_ERROR_NO_MEMORY; break; case XML_TOK_INVALID: eventPtr = next; return XML_ERROR_INVALID_TOKEN; case XML_TOK_PARTIAL: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } return XML_ERROR_UNCLOSED_TOKEN; case XML_TOK_PARTIAL_CHAR: if (nextPtr) { *nextPtr = s; return XML_ERROR_NONE; } return XML_ERROR_PARTIAL_CHAR; default: return XML_ERROR_JUNK_AFTER_DOC_ELEMENT; } eventPtr = s = next; } } #ifdef XML_DTD static enum XML_Error processInternalParamEntity(XML_Parser parser, ENTITY *entity) { const char *s, *end, *next; int tok; enum XML_Error result; OPEN_INTERNAL_ENTITY openEntity; entity->open = XML_TRUE; openEntity.next = openInternalEntities; openInternalEntities = &openEntity; openEntity.entity = entity; openEntity.internalEventPtr = NULL; openEntity.internalEventEndPtr = NULL; s = (char *)entity->textPtr; end = (char *)(entity->textPtr + entity->textLen); tok = XmlPrologTok(internalEncoding, s, end, &next); result = doProlog(parser, internalEncoding, s, end, tok, next, 0); entity->open = XML_FALSE; openInternalEntities = openEntity.next; return result; } #endif /* XML_DTD */ static enum XML_Error PTRCALL errorProcessor(XML_Parser parser, const char *s, const char *end, const char **nextPtr) { return errorCode; } static enum XML_Error storeAttributeValue(XML_Parser parser, const ENCODING *enc, XML_Bool isCdata, const char *ptr, const char *end, STRING_POOL *pool) { enum XML_Error result = appendAttributeValue(parser, enc, isCdata, ptr, end, pool); if (result) return result; if (!isCdata && poolLength(pool) && poolLastChar(pool) == 0x20) poolChop(pool); if (!poolAppendChar(pool, XML_T('\0'))) return XML_ERROR_NO_MEMORY; return XML_ERROR_NONE; } static enum XML_Error appendAttributeValue(XML_Parser parser, const ENCODING *enc, XML_Bool isCdata, const char *ptr, const char *end, STRING_POOL *pool) { DTD * const dtd = _dtd; /* save one level of indirection */ for (;;) { const char *next; int tok = XmlAttributeValueTok(enc, ptr, end, &next); switch (tok) { case XML_TOK_NONE: return XML_ERROR_NONE; case XML_TOK_INVALID: if (enc == encoding) eventPtr = next; return XML_ERROR_INVALID_TOKEN; case XML_TOK_PARTIAL: if (enc == encoding) eventPtr = ptr; return XML_ERROR_INVALID_TOKEN; case XML_TOK_CHAR_REF: { XML_Char buf[XML_ENCODE_MAX]; int i; int n = XmlCharRefNumber(enc, ptr); if (n < 0) { if (enc == encoding) eventPtr = ptr; return XML_ERROR_BAD_CHAR_REF; } if (!isCdata && n == 0x20 /* space */ && (poolLength(pool) == 0 || poolLastChar(pool) == 0x20)) break; n = XmlEncode(n, (ICHAR *)buf); if (!n) { if (enc == encoding) eventPtr = ptr; return XML_ERROR_BAD_CHAR_REF; } for (i = 0; i < n; i++) { if (!poolAppendChar(pool, buf[i])) return XML_ERROR_NO_MEMORY; } } break; case XML_TOK_DATA_CHARS: if (!poolAppend(pool, enc, ptr, next)) return XML_ERROR_NO_MEMORY; break; case XML_TOK_TRAILING_CR: next = ptr + enc->minBytesPerChar; /* fall through */ case XML_TOK_ATTRIBUTE_VALUE_S: case XML_TOK_DATA_NEWLINE: if (!isCdata && (poolLength(pool) == 0 || poolLastChar(pool) == 0x20)) break; if (!poolAppendChar(pool, 0x20)) return XML_ERROR_NO_MEMORY; break; case XML_TOK_ENTITY_REF: { const XML_Char *name; ENTITY *entity; char checkEntityDecl; XML_Char ch = (XML_Char) XmlPredefinedEntityName(enc, ptr + enc->minBytesPerChar, next - enc->minBytesPerChar); if (ch) { if (!poolAppendChar(pool, ch)) return XML_ERROR_NO_MEMORY; break; } name = poolStoreString(&temp2Pool, enc, ptr + enc->minBytesPerChar, next - enc->minBytesPerChar); if (!name) return XML_ERROR_NO_MEMORY; entity = (ENTITY *)lookup(&dtd->generalEntities, name, 0); poolDiscard(&temp2Pool); /* first, determine if a check for an existing declaration is needed; if yes, check that the entity exists, and that it is internal, otherwise call the default handler (if called from content) */ if (pool == &dtd->pool) /* are we called from prolog? */ checkEntityDecl = #ifdef XML_DTD prologState.documentEntity && #endif /* XML_DTD */ (dtd->standalone ? !openInternalEntities : !dtd->hasParamEntityRefs); else /* if (pool == &tempPool): we are called from content */ checkEntityDecl = !dtd->hasParamEntityRefs || dtd->standalone; if (checkEntityDecl) { if (!entity) return XML_ERROR_UNDEFINED_ENTITY; else if (!entity->is_internal) return XML_ERROR_ENTITY_DECLARED_IN_PE; } else if (!entity) { /* cannot report skipped entity here - see comments on skippedEntityHandler if (skippedEntityHandler) skippedEntityHandler(handlerArg, name, 0); */ if ((pool == &tempPool) && defaultHandler) reportDefault(parser, enc, ptr, next); break; } if (entity->open) { if (enc == encoding) eventPtr = ptr; return XML_ERROR_RECURSIVE_ENTITY_REF; } if (entity->notation) { if (enc == encoding) eventPtr = ptr; return XML_ERROR_BINARY_ENTITY_REF; } if (!entity->textPtr) { if (enc == encoding) eventPtr = ptr; return XML_ERROR_ATTRIBUTE_EXTERNAL_ENTITY_REF; } else { enum XML_Error result; const XML_Char *textEnd = entity->textPtr + entity->textLen; entity->open = XML_TRUE; result = appendAttributeValue(parser, internalEncoding, isCdata, (char *)entity->textPtr, (char *)textEnd, pool); entity->open = XML_FALSE; if (result) return result; } } break; default: if (enc == encoding) eventPtr = ptr; return XML_ERROR_UNEXPECTED_STATE; } ptr = next; } /* not reached */ } static enum XML_Error storeEntityValue(XML_Parser parser, const ENCODING *enc, const char *entityTextPtr, const char *entityTextEnd) { DTD * const dtd = _dtd; /* save one level of indirection */ STRING_POOL *pool = &(dtd->entityValuePool); enum XML_Error result = XML_ERROR_NONE; #ifdef XML_DTD int oldInEntityValue = prologState.inEntityValue; prologState.inEntityValue = 1; #endif /* XML_DTD */ /* never return Null for the value argument in EntityDeclHandler, since this would indicate an external entity; therefore we have to make sure that entityValuePool.start is not null */ if (!pool->blocks) { if (!poolGrow(pool)) return XML_ERROR_NO_MEMORY; } for (;;) { const char *next; int tok = XmlEntityValueTok(enc, entityTextPtr, entityTextEnd, &next); switch (tok) { case XML_TOK_PARAM_ENTITY_REF: #ifdef XML_DTD if (isParamEntity || enc != encoding) { const XML_Char *name; ENTITY *entity; name = poolStoreString(&tempPool, enc, entityTextPtr + enc->minBytesPerChar, next - enc->minBytesPerChar); if (!name) { result = XML_ERROR_NO_MEMORY; goto endEntityValue; } entity = (ENTITY *)lookup(&dtd->paramEntities, name, 0); poolDiscard(&tempPool); if (!entity) { /* not a well-formedness error - see XML 1.0: WFC Entity Declared */ /* cannot report skipped entity here - see comments on skippedEntityHandler if (skippedEntityHandler) skippedEntityHandler(handlerArg, name, 0); */ dtd->keepProcessing = dtd->standalone; goto endEntityValue; } if (entity->open) { if (enc == encoding) eventPtr = entityTextPtr; result = XML_ERROR_RECURSIVE_ENTITY_REF; goto endEntityValue; } if (entity->systemId) { if (externalEntityRefHandler) { dtd->paramEntityRead = XML_FALSE; entity->open = XML_TRUE; if (!externalEntityRefHandler(externalEntityRefHandlerArg, 0, entity->base, entity->systemId, entity->publicId)) { entity->open = XML_FALSE; result = XML_ERROR_EXTERNAL_ENTITY_HANDLING; goto endEntityValue; } entity->open = XML_FALSE; if (!dtd->paramEntityRead) dtd->keepProcessing = dtd->standalone; } else dtd->keepProcessing = dtd->standalone; } else { entity->open = XML_TRUE; result = storeEntityValue(parser, internalEncoding, (char *)entity->textPtr, (char *)(entity->textPtr + entity->textLen)); entity->open = XML_FALSE; if (result) goto endEntityValue; } break; } #endif /* XML_DTD */ /* in the internal subset, PE references are not legal within markup declarations, e.g entity values in this case */ eventPtr = entityTextPtr; result = XML_ERROR_PARAM_ENTITY_REF; goto endEntityValue; case XML_TOK_NONE: result = XML_ERROR_NONE; goto endEntityValue; case XML_TOK_ENTITY_REF: case XML_TOK_DATA_CHARS: if (!poolAppend(pool, enc, entityTextPtr, next)) { result = XML_ERROR_NO_MEMORY; goto endEntityValue; } break; case XML_TOK_TRAILING_CR: next = entityTextPtr + enc->minBytesPerChar; /* fall through */ case XML_TOK_DATA_NEWLINE: if (pool->end == pool->ptr && !poolGrow(pool)) { result = XML_ERROR_NO_MEMORY; goto endEntityValue; } *(pool->ptr)++ = 0xA; break; case XML_TOK_CHAR_REF: { XML_Char buf[XML_ENCODE_MAX]; int i; int n = XmlCharRefNumber(enc, entityTextPtr); if (n < 0) { if (enc == encoding) eventPtr = entityTextPtr; result = XML_ERROR_BAD_CHAR_REF; goto endEntityValue; } n = XmlEncode(n, (ICHAR *)buf); if (!n) { if (enc == encoding) eventPtr = entityTextPtr; result = XML_ERROR_BAD_CHAR_REF; goto endEntityValue; } for (i = 0; i < n; i++) { if (pool->end == pool->ptr && !poolGrow(pool)) { result = XML_ERROR_NO_MEMORY; goto endEntityValue; } *(pool->ptr)++ = buf[i]; } } break; case XML_TOK_PARTIAL: if (enc == encoding) eventPtr = entityTextPtr; result = XML_ERROR_INVALID_TOKEN; goto endEntityValue; case XML_TOK_INVALID: if (enc == encoding) eventPtr = next; result = XML_ERROR_INVALID_TOKEN; goto endEntityValue; default: if (enc == encoding) eventPtr = entityTextPtr; result = XML_ERROR_UNEXPECTED_STATE; goto endEntityValue; } entityTextPtr = next; } endEntityValue: #ifdef XML_DTD prologState.inEntityValue = oldInEntityValue; #endif /* XML_DTD */ return result; } static void FASTCALL normalizeLines(XML_Char *s) { XML_Char *p; for (;; s++) { if (*s == XML_T('\0')) return; if (*s == 0xD) break; } p = s; do { if (*s == 0xD) { *p++ = 0xA; if (*++s == 0xA) s++; } else *p++ = *s++; } while (*s); *p = XML_T('\0'); } static int reportProcessingInstruction(XML_Parser parser, const ENCODING *enc, const char *start, const char *end) { const XML_Char *target; XML_Char *data; const char *tem; if (!processingInstructionHandler) { if (defaultHandler) reportDefault(parser, enc, start, end); return 1; } start += enc->minBytesPerChar * 2; tem = start + XmlNameLength(enc, start); target = poolStoreString(&tempPool, enc, start, tem); if (!target) return 0; poolFinish(&tempPool); data = poolStoreString(&tempPool, enc, XmlSkipS(enc, tem), end - enc->minBytesPerChar*2); if (!data) return 0; normalizeLines(data); processingInstructionHandler(handlerArg, target, data); poolClear(&tempPool); return 1; } static int reportComment(XML_Parser parser, const ENCODING *enc, const char *start, const char *end) { XML_Char *data; if (!commentHandler) { if (defaultHandler) reportDefault(parser, enc, start, end); return 1; } data = poolStoreString(&tempPool, enc, start + enc->minBytesPerChar * 4, end - enc->minBytesPerChar * 3); if (!data) return 0; normalizeLines(data); commentHandler(handlerArg, data); poolClear(&tempPool); return 1; } static void reportDefault(XML_Parser parser, const ENCODING *enc, const char *s, const char *end) { if (MUST_CONVERT(enc, s)) { const char **eventPP; const char **eventEndPP; if (enc == encoding) { eventPP = &eventPtr; eventEndPP = &eventEndPtr; } else { eventPP = &(openInternalEntities->internalEventPtr); eventEndPP = &(openInternalEntities->internalEventEndPtr); } do { ICHAR *dataPtr = (ICHAR *)dataBuf; XmlConvert(enc, &s, end, &dataPtr, (ICHAR *)dataBufEnd); *eventEndPP = s; defaultHandler(handlerArg, dataBuf, dataPtr - (ICHAR *)dataBuf); *eventPP = s; } while (s != end); } else defaultHandler(handlerArg, (XML_Char *)s, (XML_Char *)end - (XML_Char *)s); } static int defineAttribute(ELEMENT_TYPE *type, ATTRIBUTE_ID *attId, XML_Bool isCdata, XML_Bool isId, const XML_Char *value, XML_Parser parser) { DEFAULT_ATTRIBUTE *att; if (value || isId) { /* The handling of default attributes gets messed up if we have a default which duplicates a non-default. */ int i; for (i = 0; i < type->nDefaultAtts; i++) if (attId == type->defaultAtts[i].id) return 1; if (isId && !type->idAtt && !attId->xmlns) type->idAtt = attId; } if (type->nDefaultAtts == type->allocDefaultAtts) { if (type->allocDefaultAtts == 0) { type->allocDefaultAtts = 8; type->defaultAtts = (DEFAULT_ATTRIBUTE *)MALLOC(type->allocDefaultAtts * sizeof(DEFAULT_ATTRIBUTE)); if (!type->defaultAtts) return 0; } else { DEFAULT_ATTRIBUTE *temp; int count = type->allocDefaultAtts * 2; temp = (DEFAULT_ATTRIBUTE *) REALLOC(type->defaultAtts, (count * sizeof(DEFAULT_ATTRIBUTE))); if (temp == NULL) return 0; type->allocDefaultAtts = count; type->defaultAtts = temp; } } att = type->defaultAtts + type->nDefaultAtts; att->id = attId; att->value = value; att->isCdata = isCdata; if (!isCdata) attId->maybeTokenized = XML_TRUE; type->nDefaultAtts += 1; return 1; } static int setElementTypePrefix(XML_Parser parser, ELEMENT_TYPE *elementType) { DTD * const dtd = _dtd; /* save one level of indirection */ const XML_Char *name; for (name = elementType->name; *name; name++) { if (*name == XML_T(':')) { PREFIX *prefix; const XML_Char *s; for (s = elementType->name; s != name; s++) { if (!poolAppendChar(&dtd->pool, *s)) return 0; } if (!poolAppendChar(&dtd->pool, XML_T('\0'))) return 0; prefix = (PREFIX *)lookup(&dtd->prefixes, poolStart(&dtd->pool), sizeof(PREFIX)); if (!prefix) return 0; if (prefix->name == poolStart(&dtd->pool)) poolFinish(&dtd->pool); else poolDiscard(&dtd->pool); elementType->prefix = prefix; } } return 1; } static ATTRIBUTE_ID * getAttributeId(XML_Parser parser, const ENCODING *enc, const char *start, const char *end) { DTD * const dtd = _dtd; /* save one level of indirection */ ATTRIBUTE_ID *id; const XML_Char *name; if (!poolAppendChar(&dtd->pool, XML_T('\0'))) return NULL; name = poolStoreString(&dtd->pool, enc, start, end); if (!name) return NULL; ++name; id = (ATTRIBUTE_ID *)lookup(&dtd->attributeIds, name, sizeof(ATTRIBUTE_ID)); if (!id) return NULL; if (id->name != name) poolDiscard(&dtd->pool); else { poolFinish(&dtd->pool); if (!ns) ; else if (name[0] == XML_T('x') && name[1] == XML_T('m') && name[2] == XML_T('l') && name[3] == XML_T('n') && name[4] == XML_T('s') && (name[5] == XML_T('\0') || name[5] == XML_T(':'))) { if (name[5] == XML_T('\0')) id->prefix = &dtd->defaultPrefix; else id->prefix = (PREFIX *)lookup(&dtd->prefixes, name + 6, sizeof(PREFIX)); id->xmlns = XML_TRUE; } else { int i; for (i = 0; name[i]; i++) { if (name[i] == XML_T(':')) { int j; for (j = 0; j < i; j++) { if (!poolAppendChar(&dtd->pool, name[j])) return NULL; } if (!poolAppendChar(&dtd->pool, XML_T('\0'))) return NULL; id->prefix = (PREFIX *)lookup(&dtd->prefixes, poolStart(&dtd->pool), sizeof(PREFIX)); if (id->prefix->name == poolStart(&dtd->pool)) poolFinish(&dtd->pool); else poolDiscard(&dtd->pool); break; } } } } return id; } #define CONTEXT_SEP XML_T('\f') static const XML_Char * getContext(XML_Parser parser) { DTD * const dtd = _dtd; /* save one level of indirection */ HASH_TABLE_ITER iter; XML_Bool needSep = XML_FALSE; if (dtd->defaultPrefix.binding) { int i; int len; if (!poolAppendChar(&tempPool, XML_T('='))) return NULL; len = dtd->defaultPrefix.binding->uriLen; if (namespaceSeparator != XML_T('\0')) len--; for (i = 0; i < len; i++) if (!poolAppendChar(&tempPool, dtd->defaultPrefix.binding->uri[i])) return NULL; needSep = XML_TRUE; } hashTableIterInit(&iter, &(dtd->prefixes)); for (;;) { int i; int len; const XML_Char *s; PREFIX *prefix = (PREFIX *)hashTableIterNext(&iter); if (!prefix) break; if (!prefix->binding) continue; if (needSep && !poolAppendChar(&tempPool, CONTEXT_SEP)) return NULL; for (s = prefix->name; *s; s++) if (!poolAppendChar(&tempPool, *s)) return NULL; if (!poolAppendChar(&tempPool, XML_T('='))) return NULL; len = prefix->binding->uriLen; if (namespaceSeparator != XML_T('\0')) len--; for (i = 0; i < len; i++) if (!poolAppendChar(&tempPool, prefix->binding->uri[i])) return NULL; needSep = XML_TRUE; } hashTableIterInit(&iter, &(dtd->generalEntities)); for (;;) { const XML_Char *s; ENTITY *e = (ENTITY *)hashTableIterNext(&iter); if (!e) break; if (!e->open) continue; if (needSep && !poolAppendChar(&tempPool, CONTEXT_SEP)) return NULL; for (s = e->name; *s; s++) if (!poolAppendChar(&tempPool, *s)) return 0; needSep = XML_TRUE; } if (!poolAppendChar(&tempPool, XML_T('\0'))) return NULL; return tempPool.start; } static XML_Bool setContext(XML_Parser parser, const XML_Char *context) { DTD * const dtd = _dtd; /* save one level of indirection */ const XML_Char *s = context; while (*context != XML_T('\0')) { if (*s == CONTEXT_SEP || *s == XML_T('\0')) { ENTITY *e; if (!poolAppendChar(&tempPool, XML_T('\0'))) return XML_FALSE; e = (ENTITY *)lookup(&dtd->generalEntities, poolStart(&tempPool), 0); if (e) e->open = XML_TRUE; if (*s != XML_T('\0')) s++; context = s; poolDiscard(&tempPool); } else if (*s == XML_T('=')) { PREFIX *prefix; if (poolLength(&tempPool) == 0) prefix = &dtd->defaultPrefix; else { if (!poolAppendChar(&tempPool, XML_T('\0'))) return XML_FALSE; prefix = (PREFIX *)lookup(&dtd->prefixes, poolStart(&tempPool), sizeof(PREFIX)); if (!prefix) return XML_FALSE; if (prefix->name == poolStart(&tempPool)) { prefix->name = poolCopyString(&dtd->pool, prefix->name); if (!prefix->name) return XML_FALSE; } poolDiscard(&tempPool); } for (context = s + 1; *context != CONTEXT_SEP && *context != XML_T('\0'); context++) if (!poolAppendChar(&tempPool, *context)) return XML_FALSE; if (!poolAppendChar(&tempPool, XML_T('\0'))) return XML_FALSE; if (addBinding(parser, prefix, 0, poolStart(&tempPool), &inheritedBindings) != XML_ERROR_NONE) return XML_FALSE; poolDiscard(&tempPool); if (*context != XML_T('\0')) ++context; s = context; } else { if (!poolAppendChar(&tempPool, *s)) return XML_FALSE; s++; } } return XML_TRUE; } static void FASTCALL normalizePublicId(XML_Char *publicId) { XML_Char *p = publicId; XML_Char *s; for (s = publicId; *s; s++) { switch (*s) { case 0x20: case 0xD: case 0xA: if (p != publicId && p[-1] != 0x20) *p++ = 0x20; break; default: *p++ = *s; } } if (p != publicId && p[-1] == 0x20) --p; *p = XML_T('\0'); } static DTD * dtdCreate(const XML_Memory_Handling_Suite *ms) { DTD *p = (DTD *)ms->malloc_fcn(sizeof(DTD)); if (p == NULL) return p; poolInit(&(p->pool), ms); #ifdef XML_DTD poolInit(&(p->entityValuePool), ms); #endif /* XML_DTD */ hashTableInit(&(p->generalEntities), ms); hashTableInit(&(p->elementTypes), ms); hashTableInit(&(p->attributeIds), ms); hashTableInit(&(p->prefixes), ms); #ifdef XML_DTD p->paramEntityRead = XML_FALSE; hashTableInit(&(p->paramEntities), ms); #endif /* XML_DTD */ p->defaultPrefix.name = NULL; p->defaultPrefix.binding = NULL; p->in_eldecl = XML_FALSE; p->scaffIndex = NULL; p->scaffold = NULL; p->scaffLevel = 0; p->scaffSize = 0; p->scaffCount = 0; p->contentStringLen = 0; p->keepProcessing = XML_TRUE; p->hasParamEntityRefs = XML_FALSE; p->standalone = XML_FALSE; return p; } static void dtdReset(DTD *p, const XML_Memory_Handling_Suite *ms) { HASH_TABLE_ITER iter; hashTableIterInit(&iter, &(p->elementTypes)); for (;;) { ELEMENT_TYPE *e = (ELEMENT_TYPE *)hashTableIterNext(&iter); if (!e) break; if (e->allocDefaultAtts != 0) ms->free_fcn(e->defaultAtts); } hashTableClear(&(p->generalEntities)); #ifdef XML_DTD p->paramEntityRead = XML_FALSE; hashTableClear(&(p->paramEntities)); #endif /* XML_DTD */ hashTableClear(&(p->elementTypes)); hashTableClear(&(p->attributeIds)); hashTableClear(&(p->prefixes)); poolClear(&(p->pool)); #ifdef XML_DTD poolClear(&(p->entityValuePool)); #endif /* XML_DTD */ p->defaultPrefix.name = NULL; p->defaultPrefix.binding = NULL; p->in_eldecl = XML_FALSE; if (p->scaffIndex) { ms->free_fcn(p->scaffIndex); p->scaffIndex = NULL; } if (p->scaffold) { ms->free_fcn(p->scaffold); p->scaffold = NULL; } p->scaffLevel = 0; p->scaffSize = 0; p->scaffCount = 0; p->contentStringLen = 0; p->keepProcessing = XML_TRUE; p->hasParamEntityRefs = XML_FALSE; p->standalone = XML_FALSE; } static void dtdDestroy(DTD *p, XML_Bool isDocEntity, const XML_Memory_Handling_Suite *ms) { HASH_TABLE_ITER iter; hashTableIterInit(&iter, &(p->elementTypes)); for (;;) { ELEMENT_TYPE *e = (ELEMENT_TYPE *)hashTableIterNext(&iter); if (!e) break; if (e->allocDefaultAtts != 0) ms->free_fcn(e->defaultAtts); } hashTableDestroy(&(p->generalEntities)); #ifdef XML_DTD hashTableDestroy(&(p->paramEntities)); #endif /* XML_DTD */ hashTableDestroy(&(p->elementTypes)); hashTableDestroy(&(p->attributeIds)); hashTableDestroy(&(p->prefixes)); poolDestroy(&(p->pool)); #ifdef XML_DTD poolDestroy(&(p->entityValuePool)); #endif /* XML_DTD */ if (isDocEntity) { if (p->scaffIndex) ms->free_fcn(p->scaffIndex); if (p->scaffold) ms->free_fcn(p->scaffold); } ms->free_fcn(p); } /* Do a deep copy of the DTD. Return 0 for out of memory, non-zero otherwise. The new DTD has already been initialized. */ static int dtdCopy(DTD *newDtd, const DTD *oldDtd, const XML_Memory_Handling_Suite *ms) { HASH_TABLE_ITER iter; /* Copy the prefix table. */ hashTableIterInit(&iter, &(oldDtd->prefixes)); for (;;) { const XML_Char *name; const PREFIX *oldP = (PREFIX *)hashTableIterNext(&iter); if (!oldP) break; name = poolCopyString(&(newDtd->pool), oldP->name); if (!name) return 0; if (!lookup(&(newDtd->prefixes), name, sizeof(PREFIX))) return 0; } hashTableIterInit(&iter, &(oldDtd->attributeIds)); /* Copy the attribute id table. */ for (;;) { ATTRIBUTE_ID *newA; const XML_Char *name; const ATTRIBUTE_ID *oldA = (ATTRIBUTE_ID *)hashTableIterNext(&iter); if (!oldA) break; /* Remember to allocate the scratch byte before the name. */ if (!poolAppendChar(&(newDtd->pool), XML_T('\0'))) return 0; name = poolCopyString(&(newDtd->pool), oldA->name); if (!name) return 0; ++name; newA = (ATTRIBUTE_ID *)lookup(&(newDtd->attributeIds), name, sizeof(ATTRIBUTE_ID)); if (!newA) return 0; newA->maybeTokenized = oldA->maybeTokenized; if (oldA->prefix) { newA->xmlns = oldA->xmlns; if (oldA->prefix == &oldDtd->defaultPrefix) newA->prefix = &newDtd->defaultPrefix; else newA->prefix = (PREFIX *)lookup(&(newDtd->prefixes), oldA->prefix->name, 0); } } /* Copy the element type table. */ hashTableIterInit(&iter, &(oldDtd->elementTypes)); for (;;) { int i; ELEMENT_TYPE *newE; const XML_Char *name; const ELEMENT_TYPE *oldE = (ELEMENT_TYPE *)hashTableIterNext(&iter); if (!oldE) break; name = poolCopyString(&(newDtd->pool), oldE->name); if (!name) return 0; newE = (ELEMENT_TYPE *)lookup(&(newDtd->elementTypes), name, sizeof(ELEMENT_TYPE)); if (!newE) return 0; if (oldE->nDefaultAtts) { newE->defaultAtts = (DEFAULT_ATTRIBUTE *) ms->malloc_fcn(oldE->nDefaultAtts * sizeof(DEFAULT_ATTRIBUTE)); if (!newE->defaultAtts) { ms->free_fcn(newE); return 0; } } if (oldE->idAtt) newE->idAtt = (ATTRIBUTE_ID *) lookup(&(newDtd->attributeIds), oldE->idAtt->name, 0); newE->allocDefaultAtts = newE->nDefaultAtts = oldE->nDefaultAtts; if (oldE->prefix) newE->prefix = (PREFIX *)lookup(&(newDtd->prefixes), oldE->prefix->name, 0); for (i = 0; i < newE->nDefaultAtts; i++) { newE->defaultAtts[i].id = (ATTRIBUTE_ID *) lookup(&(newDtd->attributeIds), oldE->defaultAtts[i].id->name, 0); newE->defaultAtts[i].isCdata = oldE->defaultAtts[i].isCdata; if (oldE->defaultAtts[i].value) { newE->defaultAtts[i].value = poolCopyString(&(newDtd->pool), oldE->defaultAtts[i].value); if (!newE->defaultAtts[i].value) return 0; } else newE->defaultAtts[i].value = NULL; } } /* Copy the entity tables. */ if (!copyEntityTable(&(newDtd->generalEntities), &(newDtd->pool), &(oldDtd->generalEntities))) return 0; #ifdef XML_DTD if (!copyEntityTable(&(newDtd->paramEntities), &(newDtd->pool), &(oldDtd->paramEntities))) return 0; newDtd->paramEntityRead = oldDtd->paramEntityRead; #endif /* XML_DTD */ newDtd->keepProcessing = oldDtd->keepProcessing; newDtd->hasParamEntityRefs = oldDtd->hasParamEntityRefs; newDtd->standalone = oldDtd->standalone; /* Don't want deep copying for scaffolding */ newDtd->in_eldecl = oldDtd->in_eldecl; newDtd->scaffold = oldDtd->scaffold; newDtd->contentStringLen = oldDtd->contentStringLen; newDtd->scaffSize = oldDtd->scaffSize; newDtd->scaffLevel = oldDtd->scaffLevel; newDtd->scaffIndex = oldDtd->scaffIndex; return 1; } /* End dtdCopy */ static int copyEntityTable(HASH_TABLE *newTable, STRING_POOL *newPool, const HASH_TABLE *oldTable) { HASH_TABLE_ITER iter; const XML_Char *cachedOldBase = NULL; const XML_Char *cachedNewBase = NULL; hashTableIterInit(&iter, oldTable); for (;;) { ENTITY *newE; const XML_Char *name; const ENTITY *oldE = (ENTITY *)hashTableIterNext(&iter); if (!oldE) break; name = poolCopyString(newPool, oldE->name); if (!name) return 0; newE = (ENTITY *)lookup(newTable, name, sizeof(ENTITY)); if (!newE) return 0; if (oldE->systemId) { const XML_Char *tem = poolCopyString(newPool, oldE->systemId); if (!tem) return 0; newE->systemId = tem; if (oldE->base) { if (oldE->base == cachedOldBase) newE->base = cachedNewBase; else { cachedOldBase = oldE->base; tem = poolCopyString(newPool, cachedOldBase); if (!tem) return 0; cachedNewBase = newE->base = tem; } } if (oldE->publicId) { tem = poolCopyString(newPool, oldE->publicId); if (!tem) return 0; newE->publicId = tem; } } else { const XML_Char *tem = poolCopyStringN(newPool, oldE->textPtr, oldE->textLen); if (!tem) return 0; newE->textPtr = tem; newE->textLen = oldE->textLen; } if (oldE->notation) { const XML_Char *tem = poolCopyString(newPool, oldE->notation); if (!tem) return 0; newE->notation = tem; } newE->is_param = oldE->is_param; newE->is_internal = oldE->is_internal; } return 1; } #define INIT_SIZE 64 static int FASTCALL keyeq(KEY s1, KEY s2) { for (; *s1 == *s2; s1++, s2++) if (*s1 == 0) return 1; return 0; } static unsigned long FASTCALL hash(KEY s) { unsigned long h = 0; while (*s) h = (h << 5) + h + (unsigned char)*s++; return h; } static NAMED * lookup(HASH_TABLE *table, KEY name, size_t createSize) { size_t i; if (table->size == 0) { size_t tsize; if (!createSize) return NULL; tsize = INIT_SIZE * sizeof(NAMED *); table->v = (NAMED **)table->mem->malloc_fcn(tsize); if (!table->v) return NULL; memset(table->v, 0, tsize); table->size = INIT_SIZE; table->usedLim = INIT_SIZE / 2; i = hash(name) & (table->size - 1); } else { unsigned long h = hash(name); for (i = h & (table->size - 1); table->v[i]; i == 0 ? i = table->size - 1 : --i) { if (keyeq(name, table->v[i]->name)) return table->v[i]; } if (!createSize) return NULL; if (table->used == table->usedLim) { /* check for overflow */ size_t newSize = table->size * 2; size_t tsize = newSize * sizeof(NAMED *); NAMED **newV = (NAMED **)table->mem->malloc_fcn(tsize); if (!newV) return NULL; memset(newV, 0, tsize); for (i = 0; i < table->size; i++) if (table->v[i]) { size_t j; for (j = hash(table->v[i]->name) & (newSize - 1); newV[j]; j == 0 ? j = newSize - 1 : --j) ; newV[j] = table->v[i]; } table->mem->free_fcn(table->v); table->v = newV; table->size = newSize; table->usedLim = newSize/2; for (i = h & (table->size - 1); table->v[i]; i == 0 ? i = table->size - 1 : --i) ; } } table->v[i] = (NAMED *)table->mem->malloc_fcn(createSize); if (!table->v[i]) return NULL; memset(table->v[i], 0, createSize); table->v[i]->name = name; (table->used)++; return table->v[i]; } static void FASTCALL hashTableClear(HASH_TABLE *table) { size_t i; for (i = 0; i < table->size; i++) { NAMED *p = table->v[i]; if (p) { table->mem->free_fcn(p); table->v[i] = NULL; } } table->usedLim = table->size / 2; table->used = 0; } static void FASTCALL hashTableDestroy(HASH_TABLE *table) { size_t i; for (i = 0; i < table->size; i++) { NAMED *p = table->v[i]; if (p) table->mem->free_fcn(p); } if (table->v) table->mem->free_fcn(table->v); } static void FASTCALL hashTableInit(HASH_TABLE *p, const XML_Memory_Handling_Suite *ms) { p->size = 0; p->usedLim = 0; p->used = 0; p->v = NULL; p->mem = ms; } static void FASTCALL hashTableIterInit(HASH_TABLE_ITER *iter, const HASH_TABLE *table) { iter->p = table->v; iter->end = iter->p + table->size; } static NAMED * FASTCALL hashTableIterNext(HASH_TABLE_ITER *iter) { while (iter->p != iter->end) { NAMED *tem = *(iter->p)++; if (tem) return tem; } return NULL; } static void FASTCALL poolInit(STRING_POOL *pool, const XML_Memory_Handling_Suite *ms) { pool->blocks = NULL; pool->freeBlocks = NULL; pool->start = NULL; pool->ptr = NULL; pool->end = NULL; pool->mem = ms; } static void FASTCALL poolClear(STRING_POOL *pool) { if (!pool->freeBlocks) pool->freeBlocks = pool->blocks; else { BLOCK *p = pool->blocks; while (p) { BLOCK *tem = p->next; p->next = pool->freeBlocks; pool->freeBlocks = p; p = tem; } } pool->blocks = NULL; pool->start = NULL; pool->ptr = NULL; pool->end = NULL; } static void FASTCALL poolDestroy(STRING_POOL *pool) { BLOCK *p = pool->blocks; while (p) { BLOCK *tem = p->next; pool->mem->free_fcn(p); p = tem; } p = pool->freeBlocks; while (p) { BLOCK *tem = p->next; pool->mem->free_fcn(p); p = tem; } } static XML_Char * poolAppend(STRING_POOL *pool, const ENCODING *enc, const char *ptr, const char *end) { if (!pool->ptr && !poolGrow(pool)) return NULL; for (;;) { XmlConvert(enc, &ptr, end, (ICHAR **)&(pool->ptr), (ICHAR *)pool->end); if (ptr == end) break; if (!poolGrow(pool)) return NULL; } return pool->start; } static const XML_Char * FASTCALL poolCopyString(STRING_POOL *pool, const XML_Char *s) { do { if (!poolAppendChar(pool, *s)) return NULL; } while (*s++); s = pool->start; poolFinish(pool); return s; } static const XML_Char * poolCopyStringN(STRING_POOL *pool, const XML_Char *s, int n) { if (!pool->ptr && !poolGrow(pool)) return NULL; for (; n > 0; --n, s++) { if (!poolAppendChar(pool, *s)) return NULL; } s = pool->start; poolFinish(pool); return s; } static const XML_Char * FASTCALL poolAppendString(STRING_POOL *pool, const XML_Char *s) { while (*s) { if (!poolAppendChar(pool, *s)) return NULL; s++; } return pool->start; } static XML_Char * poolStoreString(STRING_POOL *pool, const ENCODING *enc, const char *ptr, const char *end) { if (!poolAppend(pool, enc, ptr, end)) return NULL; if (pool->ptr == pool->end && !poolGrow(pool)) return NULL; *(pool->ptr)++ = 0; return pool->start; } static XML_Bool FASTCALL poolGrow(STRING_POOL *pool) { if (pool->freeBlocks) { if (pool->start == 0) { pool->blocks = pool->freeBlocks; pool->freeBlocks = pool->freeBlocks->next; pool->blocks->next = NULL; pool->start = pool->blocks->s; pool->end = pool->start + pool->blocks->size; pool->ptr = pool->start; return XML_TRUE; } if (pool->end - pool->start < pool->freeBlocks->size) { BLOCK *tem = pool->freeBlocks->next; pool->freeBlocks->next = pool->blocks; pool->blocks = pool->freeBlocks; pool->freeBlocks = tem; memcpy(pool->blocks->s, pool->start, (pool->end - pool->start) * sizeof(XML_Char)); pool->ptr = pool->blocks->s + (pool->ptr - pool->start); pool->start = pool->blocks->s; pool->end = pool->start + pool->blocks->size; return XML_TRUE; } } if (pool->blocks && pool->start == pool->blocks->s) { int blockSize = (pool->end - pool->start)*2; pool->blocks = (BLOCK *) pool->mem->realloc_fcn(pool->blocks, (offsetof(BLOCK, s) + blockSize * sizeof(XML_Char))); if (pool->blocks == NULL) return XML_FALSE; pool->blocks->size = blockSize; pool->ptr = pool->blocks->s + (pool->ptr - pool->start); pool->start = pool->blocks->s; pool->end = pool->start + blockSize; } else { BLOCK *tem; int blockSize = pool->end - pool->start; if (blockSize < INIT_BLOCK_SIZE) blockSize = INIT_BLOCK_SIZE; else blockSize *= 2; tem = (BLOCK *)pool->mem->malloc_fcn(offsetof(BLOCK, s) + blockSize * sizeof(XML_Char)); if (!tem) return XML_FALSE; tem->size = blockSize; tem->next = pool->blocks; pool->blocks = tem; if (pool->ptr != pool->start) memcpy(tem->s, pool->start, (pool->ptr - pool->start) * sizeof(XML_Char)); pool->ptr = tem->s + (pool->ptr - pool->start); pool->start = tem->s; pool->end = tem->s + blockSize; } return XML_TRUE; } static int FASTCALL nextScaffoldPart(XML_Parser parser) { DTD * const dtd = _dtd; /* save one level of indirection */ CONTENT_SCAFFOLD * me; int next; if (!dtd->scaffIndex) { dtd->scaffIndex = (int *)MALLOC(groupSize * sizeof(int)); if (!dtd->scaffIndex) return -1; dtd->scaffIndex[0] = 0; } if (dtd->scaffCount >= dtd->scaffSize) { CONTENT_SCAFFOLD *temp; if (dtd->scaffold) { temp = (CONTENT_SCAFFOLD *) REALLOC(dtd->scaffold, dtd->scaffSize * 2 * sizeof(CONTENT_SCAFFOLD)); if (temp == NULL) return -1; dtd->scaffSize *= 2; } else { temp = (CONTENT_SCAFFOLD *)MALLOC(INIT_SCAFFOLD_ELEMENTS * sizeof(CONTENT_SCAFFOLD)); if (temp == NULL) return -1; dtd->scaffSize = INIT_SCAFFOLD_ELEMENTS; } dtd->scaffold = temp; } next = dtd->scaffCount++; me = &dtd->scaffold[next]; if (dtd->scaffLevel) { CONTENT_SCAFFOLD *parent = &dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel-1]]; if (parent->lastchild) { dtd->scaffold[parent->lastchild].nextsib = next; } if (!parent->childcnt) parent->firstchild = next; parent->lastchild = next; parent->childcnt++; } me->firstchild = me->lastchild = me->childcnt = me->nextsib = 0; return next; } static void build_node(XML_Parser parser, int src_node, XML_Content *dest, XML_Content **contpos, XML_Char **strpos) { DTD * const dtd = _dtd; /* save one level of indirection */ dest->type = dtd->scaffold[src_node].type; dest->quant = dtd->scaffold[src_node].quant; if (dest->type == XML_CTYPE_NAME) { const XML_Char *src; dest->name = *strpos; src = dtd->scaffold[src_node].name; for (;;) { *(*strpos)++ = *src; if (!*src) break; src++; } dest->numchildren = 0; dest->children = NULL; } else { unsigned int i; int cn; dest->numchildren = dtd->scaffold[src_node].childcnt; dest->children = *contpos; *contpos += dest->numchildren; for (i = 0, cn = dtd->scaffold[src_node].firstchild; i < dest->numchildren; i++, cn = dtd->scaffold[cn].nextsib) { build_node(parser, cn, &(dest->children[i]), contpos, strpos); } dest->name = NULL; } } static XML_Content * build_model (XML_Parser parser) { DTD * const dtd = _dtd; /* save one level of indirection */ XML_Content *ret; XML_Content *cpos; XML_Char * str; int allocsize = (dtd->scaffCount * sizeof(XML_Content) + (dtd->contentStringLen * sizeof(XML_Char))); ret = (XML_Content *)MALLOC(allocsize); if (!ret) return NULL; str = (XML_Char *) (&ret[dtd->scaffCount]); cpos = &ret[1]; build_node(parser, 0, ret, &cpos, &str); return ret; } static ELEMENT_TYPE * getElementType(XML_Parser parser, const ENCODING *enc, const char *ptr, const char *end) { DTD * const dtd = _dtd; /* save one level of indirection */ const XML_Char *name = poolStoreString(&dtd->pool, enc, ptr, end); ELEMENT_TYPE *ret; if (!name) return NULL; ret = (ELEMENT_TYPE *) lookup(&dtd->elementTypes, name, sizeof(ELEMENT_TYPE)); if (!ret) return NULL; if (ret->name != name) poolDiscard(&dtd->pool); else { poolFinish(&dtd->pool); if (!setElementTypePrefix(parser, ret)) return NULL; } return ret; } madman-0.93/expat/xmlrole.c0000644000175000001440000007667410053135241015441 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ #ifdef COMPILED_FROM_DSP #include "winconfig.h" #elif defined(MACOS_CLASSIC) #include "macconfig.h" #else #include "expatconfig.h" #endif /* ndef COMPILED_FROM_DSP */ #include "internal.h" #include "xmlrole.h" #include "ascii.h" /* Doesn't check: that ,| are not mixed in a model group content of literals */ static const char KW_ANY[] = { ASCII_A, ASCII_N, ASCII_Y, '\0' }; static const char KW_ATTLIST[] = { ASCII_A, ASCII_T, ASCII_T, ASCII_L, ASCII_I, ASCII_S, ASCII_T, '\0' }; static const char KW_CDATA[] = { ASCII_C, ASCII_D, ASCII_A, ASCII_T, ASCII_A, '\0' }; static const char KW_DOCTYPE[] = { ASCII_D, ASCII_O, ASCII_C, ASCII_T, ASCII_Y, ASCII_P, ASCII_E, '\0' }; static const char KW_ELEMENT[] = { ASCII_E, ASCII_L, ASCII_E, ASCII_M, ASCII_E, ASCII_N, ASCII_T, '\0' }; static const char KW_EMPTY[] = { ASCII_E, ASCII_M, ASCII_P, ASCII_T, ASCII_Y, '\0' }; static const char KW_ENTITIES[] = { ASCII_E, ASCII_N, ASCII_T, ASCII_I, ASCII_T, ASCII_I, ASCII_E, ASCII_S, '\0' }; static const char KW_ENTITY[] = { ASCII_E, ASCII_N, ASCII_T, ASCII_I, ASCII_T, ASCII_Y, '\0' }; static const char KW_FIXED[] = { ASCII_F, ASCII_I, ASCII_X, ASCII_E, ASCII_D, '\0' }; static const char KW_ID[] = { ASCII_I, ASCII_D, '\0' }; static const char KW_IDREF[] = { ASCII_I, ASCII_D, ASCII_R, ASCII_E, ASCII_F, '\0' }; static const char KW_IDREFS[] = { ASCII_I, ASCII_D, ASCII_R, ASCII_E, ASCII_F, ASCII_S, '\0' }; static const char KW_IGNORE[] = { ASCII_I, ASCII_G, ASCII_N, ASCII_O, ASCII_R, ASCII_E, '\0' }; static const char KW_IMPLIED[] = { ASCII_I, ASCII_M, ASCII_P, ASCII_L, ASCII_I, ASCII_E, ASCII_D, '\0' }; static const char KW_INCLUDE[] = { ASCII_I, ASCII_N, ASCII_C, ASCII_L, ASCII_U, ASCII_D, ASCII_E, '\0' }; static const char KW_NDATA[] = { ASCII_N, ASCII_D, ASCII_A, ASCII_T, ASCII_A, '\0' }; static const char KW_NMTOKEN[] = { ASCII_N, ASCII_M, ASCII_T, ASCII_O, ASCII_K, ASCII_E, ASCII_N, '\0' }; static const char KW_NMTOKENS[] = { ASCII_N, ASCII_M, ASCII_T, ASCII_O, ASCII_K, ASCII_E, ASCII_N, ASCII_S, '\0' }; static const char KW_NOTATION[] = { ASCII_N, ASCII_O, ASCII_T, ASCII_A, ASCII_T, ASCII_I, ASCII_O, ASCII_N, '\0' }; static const char KW_PCDATA[] = { ASCII_P, ASCII_C, ASCII_D, ASCII_A, ASCII_T, ASCII_A, '\0' }; static const char KW_PUBLIC[] = { ASCII_P, ASCII_U, ASCII_B, ASCII_L, ASCII_I, ASCII_C, '\0' }; static const char KW_REQUIRED[] = { ASCII_R, ASCII_E, ASCII_Q, ASCII_U, ASCII_I, ASCII_R, ASCII_E, ASCII_D, '\0' }; static const char KW_SYSTEM[] = { ASCII_S, ASCII_Y, ASCII_S, ASCII_T, ASCII_E, ASCII_M, '\0' }; #ifndef MIN_BYTES_PER_CHAR #define MIN_BYTES_PER_CHAR(enc) ((enc)->minBytesPerChar) #endif #ifdef XML_DTD #define setTopLevel(state) \ ((state)->handler = ((state)->documentEntity \ ? internalSubset \ : externalSubset1)) #else /* not XML_DTD */ #define setTopLevel(state) ((state)->handler = internalSubset) #endif /* not XML_DTD */ typedef int PTRCALL PROLOG_HANDLER(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc); static PROLOG_HANDLER prolog0, prolog1, prolog2, doctype0, doctype1, doctype2, doctype3, doctype4, doctype5, internalSubset, entity0, entity1, entity2, entity3, entity4, entity5, entity6, entity7, entity8, entity9, entity10, notation0, notation1, notation2, notation3, notation4, attlist0, attlist1, attlist2, attlist3, attlist4, attlist5, attlist6, attlist7, attlist8, attlist9, element0, element1, element2, element3, element4, element5, element6, element7, #ifdef XML_DTD externalSubset0, externalSubset1, condSect0, condSect1, condSect2, #endif /* XML_DTD */ declClose, error; static int FASTCALL common(PROLOG_STATE *state, int tok); static int PTRCALL prolog0(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: state->handler = prolog1; return XML_ROLE_NONE; case XML_TOK_XML_DECL: state->handler = prolog1; return XML_ROLE_XML_DECL; case XML_TOK_PI: state->handler = prolog1; return XML_ROLE_PI; case XML_TOK_COMMENT: state->handler = prolog1; return XML_ROLE_COMMENT; case XML_TOK_BOM: return XML_ROLE_NONE; case XML_TOK_DECL_OPEN: if (!XmlNameMatchesAscii(enc, ptr + 2 * MIN_BYTES_PER_CHAR(enc), end, KW_DOCTYPE)) break; state->handler = doctype0; return XML_ROLE_DOCTYPE_NONE; case XML_TOK_INSTANCE_START: state->handler = error; return XML_ROLE_INSTANCE_START; } return common(state, tok); } static int PTRCALL prolog1(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NONE; case XML_TOK_PI: return XML_ROLE_PI; case XML_TOK_COMMENT: return XML_ROLE_COMMENT; case XML_TOK_BOM: return XML_ROLE_NONE; case XML_TOK_DECL_OPEN: if (!XmlNameMatchesAscii(enc, ptr + 2 * MIN_BYTES_PER_CHAR(enc), end, KW_DOCTYPE)) break; state->handler = doctype0; return XML_ROLE_DOCTYPE_NONE; case XML_TOK_INSTANCE_START: state->handler = error; return XML_ROLE_INSTANCE_START; } return common(state, tok); } static int PTRCALL prolog2(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NONE; case XML_TOK_PI: return XML_ROLE_PI; case XML_TOK_COMMENT: return XML_ROLE_COMMENT; case XML_TOK_INSTANCE_START: state->handler = error; return XML_ROLE_INSTANCE_START; } return common(state, tok); } static int PTRCALL doctype0(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_DOCTYPE_NONE; case XML_TOK_NAME: case XML_TOK_PREFIXED_NAME: state->handler = doctype1; return XML_ROLE_DOCTYPE_NAME; } return common(state, tok); } static int PTRCALL doctype1(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_DOCTYPE_NONE; case XML_TOK_OPEN_BRACKET: state->handler = internalSubset; return XML_ROLE_DOCTYPE_INTERNAL_SUBSET; case XML_TOK_DECL_CLOSE: state->handler = prolog2; return XML_ROLE_DOCTYPE_CLOSE; case XML_TOK_NAME: if (XmlNameMatchesAscii(enc, ptr, end, KW_SYSTEM)) { state->handler = doctype3; return XML_ROLE_DOCTYPE_NONE; } if (XmlNameMatchesAscii(enc, ptr, end, KW_PUBLIC)) { state->handler = doctype2; return XML_ROLE_DOCTYPE_NONE; } break; } return common(state, tok); } static int PTRCALL doctype2(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_DOCTYPE_NONE; case XML_TOK_LITERAL: state->handler = doctype3; return XML_ROLE_DOCTYPE_PUBLIC_ID; } return common(state, tok); } static int PTRCALL doctype3(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_DOCTYPE_NONE; case XML_TOK_LITERAL: state->handler = doctype4; return XML_ROLE_DOCTYPE_SYSTEM_ID; } return common(state, tok); } static int PTRCALL doctype4(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_DOCTYPE_NONE; case XML_TOK_OPEN_BRACKET: state->handler = internalSubset; return XML_ROLE_DOCTYPE_INTERNAL_SUBSET; case XML_TOK_DECL_CLOSE: state->handler = prolog2; return XML_ROLE_DOCTYPE_CLOSE; } return common(state, tok); } static int PTRCALL doctype5(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_DOCTYPE_NONE; case XML_TOK_DECL_CLOSE: state->handler = prolog2; return XML_ROLE_DOCTYPE_CLOSE; } return common(state, tok); } static int PTRCALL internalSubset(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NONE; case XML_TOK_DECL_OPEN: if (XmlNameMatchesAscii(enc, ptr + 2 * MIN_BYTES_PER_CHAR(enc), end, KW_ENTITY)) { state->handler = entity0; return XML_ROLE_ENTITY_NONE; } if (XmlNameMatchesAscii(enc, ptr + 2 * MIN_BYTES_PER_CHAR(enc), end, KW_ATTLIST)) { state->handler = attlist0; return XML_ROLE_ATTLIST_NONE; } if (XmlNameMatchesAscii(enc, ptr + 2 * MIN_BYTES_PER_CHAR(enc), end, KW_ELEMENT)) { state->handler = element0; return XML_ROLE_ELEMENT_NONE; } if (XmlNameMatchesAscii(enc, ptr + 2 * MIN_BYTES_PER_CHAR(enc), end, KW_NOTATION)) { state->handler = notation0; return XML_ROLE_NOTATION_NONE; } break; case XML_TOK_PI: return XML_ROLE_PI; case XML_TOK_COMMENT: return XML_ROLE_COMMENT; case XML_TOK_PARAM_ENTITY_REF: return XML_ROLE_PARAM_ENTITY_REF; case XML_TOK_CLOSE_BRACKET: state->handler = doctype5; return XML_ROLE_DOCTYPE_NONE; } return common(state, tok); } #ifdef XML_DTD static int PTRCALL externalSubset0(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { state->handler = externalSubset1; if (tok == XML_TOK_XML_DECL) return XML_ROLE_TEXT_DECL; return externalSubset1(state, tok, ptr, end, enc); } static int PTRCALL externalSubset1(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_COND_SECT_OPEN: state->handler = condSect0; return XML_ROLE_NONE; case XML_TOK_COND_SECT_CLOSE: if (state->includeLevel == 0) break; state->includeLevel -= 1; return XML_ROLE_NONE; case XML_TOK_PROLOG_S: return XML_ROLE_NONE; case XML_TOK_CLOSE_BRACKET: break; case XML_TOK_NONE: if (state->includeLevel) break; return XML_ROLE_NONE; default: return internalSubset(state, tok, ptr, end, enc); } return common(state, tok); } #endif /* XML_DTD */ static int PTRCALL entity0(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_PERCENT: state->handler = entity1; return XML_ROLE_ENTITY_NONE; case XML_TOK_NAME: state->handler = entity2; return XML_ROLE_GENERAL_ENTITY_NAME; } return common(state, tok); } static int PTRCALL entity1(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_NAME: state->handler = entity7; return XML_ROLE_PARAM_ENTITY_NAME; } return common(state, tok); } static int PTRCALL entity2(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_NAME: if (XmlNameMatchesAscii(enc, ptr, end, KW_SYSTEM)) { state->handler = entity4; return XML_ROLE_ENTITY_NONE; } if (XmlNameMatchesAscii(enc, ptr, end, KW_PUBLIC)) { state->handler = entity3; return XML_ROLE_ENTITY_NONE; } break; case XML_TOK_LITERAL: state->handler = declClose; state->role_none = XML_ROLE_ENTITY_NONE; return XML_ROLE_ENTITY_VALUE; } return common(state, tok); } static int PTRCALL entity3(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_LITERAL: state->handler = entity4; return XML_ROLE_ENTITY_PUBLIC_ID; } return common(state, tok); } static int PTRCALL entity4(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_LITERAL: state->handler = entity5; return XML_ROLE_ENTITY_SYSTEM_ID; } return common(state, tok); } static int PTRCALL entity5(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_DECL_CLOSE: setTopLevel(state); return XML_ROLE_ENTITY_COMPLETE; case XML_TOK_NAME: if (XmlNameMatchesAscii(enc, ptr, end, KW_NDATA)) { state->handler = entity6; return XML_ROLE_ENTITY_NONE; } break; } return common(state, tok); } static int PTRCALL entity6(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_NAME: state->handler = declClose; state->role_none = XML_ROLE_ENTITY_NONE; return XML_ROLE_ENTITY_NOTATION_NAME; } return common(state, tok); } static int PTRCALL entity7(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_NAME: if (XmlNameMatchesAscii(enc, ptr, end, KW_SYSTEM)) { state->handler = entity9; return XML_ROLE_ENTITY_NONE; } if (XmlNameMatchesAscii(enc, ptr, end, KW_PUBLIC)) { state->handler = entity8; return XML_ROLE_ENTITY_NONE; } break; case XML_TOK_LITERAL: state->handler = declClose; state->role_none = XML_ROLE_ENTITY_NONE; return XML_ROLE_ENTITY_VALUE; } return common(state, tok); } static int PTRCALL entity8(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_LITERAL: state->handler = entity9; return XML_ROLE_ENTITY_PUBLIC_ID; } return common(state, tok); } static int PTRCALL entity9(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_LITERAL: state->handler = entity10; return XML_ROLE_ENTITY_SYSTEM_ID; } return common(state, tok); } static int PTRCALL entity10(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ENTITY_NONE; case XML_TOK_DECL_CLOSE: setTopLevel(state); return XML_ROLE_ENTITY_COMPLETE; } return common(state, tok); } static int PTRCALL notation0(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NOTATION_NONE; case XML_TOK_NAME: state->handler = notation1; return XML_ROLE_NOTATION_NAME; } return common(state, tok); } static int PTRCALL notation1(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NOTATION_NONE; case XML_TOK_NAME: if (XmlNameMatchesAscii(enc, ptr, end, KW_SYSTEM)) { state->handler = notation3; return XML_ROLE_NOTATION_NONE; } if (XmlNameMatchesAscii(enc, ptr, end, KW_PUBLIC)) { state->handler = notation2; return XML_ROLE_NOTATION_NONE; } break; } return common(state, tok); } static int PTRCALL notation2(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NOTATION_NONE; case XML_TOK_LITERAL: state->handler = notation4; return XML_ROLE_NOTATION_PUBLIC_ID; } return common(state, tok); } static int PTRCALL notation3(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NOTATION_NONE; case XML_TOK_LITERAL: state->handler = declClose; state->role_none = XML_ROLE_NOTATION_NONE; return XML_ROLE_NOTATION_SYSTEM_ID; } return common(state, tok); } static int PTRCALL notation4(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NOTATION_NONE; case XML_TOK_LITERAL: state->handler = declClose; state->role_none = XML_ROLE_NOTATION_NONE; return XML_ROLE_NOTATION_SYSTEM_ID; case XML_TOK_DECL_CLOSE: setTopLevel(state); return XML_ROLE_NOTATION_NO_SYSTEM_ID; } return common(state, tok); } static int PTRCALL attlist0(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ATTLIST_NONE; case XML_TOK_NAME: case XML_TOK_PREFIXED_NAME: state->handler = attlist1; return XML_ROLE_ATTLIST_ELEMENT_NAME; } return common(state, tok); } static int PTRCALL attlist1(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ATTLIST_NONE; case XML_TOK_DECL_CLOSE: setTopLevel(state); return XML_ROLE_ATTLIST_NONE; case XML_TOK_NAME: case XML_TOK_PREFIXED_NAME: state->handler = attlist2; return XML_ROLE_ATTRIBUTE_NAME; } return common(state, tok); } static int PTRCALL attlist2(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ATTLIST_NONE; case XML_TOK_NAME: { static const char *types[] = { KW_CDATA, KW_ID, KW_IDREF, KW_IDREFS, KW_ENTITY, KW_ENTITIES, KW_NMTOKEN, KW_NMTOKENS, }; int i; for (i = 0; i < (int)(sizeof(types)/sizeof(types[0])); i++) if (XmlNameMatchesAscii(enc, ptr, end, types[i])) { state->handler = attlist8; return XML_ROLE_ATTRIBUTE_TYPE_CDATA + i; } } if (XmlNameMatchesAscii(enc, ptr, end, KW_NOTATION)) { state->handler = attlist5; return XML_ROLE_ATTLIST_NONE; } break; case XML_TOK_OPEN_PAREN: state->handler = attlist3; return XML_ROLE_ATTLIST_NONE; } return common(state, tok); } static int PTRCALL attlist3(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ATTLIST_NONE; case XML_TOK_NMTOKEN: case XML_TOK_NAME: case XML_TOK_PREFIXED_NAME: state->handler = attlist4; return XML_ROLE_ATTRIBUTE_ENUM_VALUE; } return common(state, tok); } static int PTRCALL attlist4(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ATTLIST_NONE; case XML_TOK_CLOSE_PAREN: state->handler = attlist8; return XML_ROLE_ATTLIST_NONE; case XML_TOK_OR: state->handler = attlist3; return XML_ROLE_ATTLIST_NONE; } return common(state, tok); } static int PTRCALL attlist5(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ATTLIST_NONE; case XML_TOK_OPEN_PAREN: state->handler = attlist6; return XML_ROLE_ATTLIST_NONE; } return common(state, tok); } static int PTRCALL attlist6(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ATTLIST_NONE; case XML_TOK_NAME: state->handler = attlist7; return XML_ROLE_ATTRIBUTE_NOTATION_VALUE; } return common(state, tok); } static int PTRCALL attlist7(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ATTLIST_NONE; case XML_TOK_CLOSE_PAREN: state->handler = attlist8; return XML_ROLE_ATTLIST_NONE; case XML_TOK_OR: state->handler = attlist6; return XML_ROLE_ATTLIST_NONE; } return common(state, tok); } /* default value */ static int PTRCALL attlist8(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ATTLIST_NONE; case XML_TOK_POUND_NAME: if (XmlNameMatchesAscii(enc, ptr + MIN_BYTES_PER_CHAR(enc), end, KW_IMPLIED)) { state->handler = attlist1; return XML_ROLE_IMPLIED_ATTRIBUTE_VALUE; } if (XmlNameMatchesAscii(enc, ptr + MIN_BYTES_PER_CHAR(enc), end, KW_REQUIRED)) { state->handler = attlist1; return XML_ROLE_REQUIRED_ATTRIBUTE_VALUE; } if (XmlNameMatchesAscii(enc, ptr + MIN_BYTES_PER_CHAR(enc), end, KW_FIXED)) { state->handler = attlist9; return XML_ROLE_ATTLIST_NONE; } break; case XML_TOK_LITERAL: state->handler = attlist1; return XML_ROLE_DEFAULT_ATTRIBUTE_VALUE; } return common(state, tok); } static int PTRCALL attlist9(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ATTLIST_NONE; case XML_TOK_LITERAL: state->handler = attlist1; return XML_ROLE_FIXED_ATTRIBUTE_VALUE; } return common(state, tok); } static int PTRCALL element0(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ELEMENT_NONE; case XML_TOK_NAME: case XML_TOK_PREFIXED_NAME: state->handler = element1; return XML_ROLE_ELEMENT_NAME; } return common(state, tok); } static int PTRCALL element1(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ELEMENT_NONE; case XML_TOK_NAME: if (XmlNameMatchesAscii(enc, ptr, end, KW_EMPTY)) { state->handler = declClose; state->role_none = XML_ROLE_ELEMENT_NONE; return XML_ROLE_CONTENT_EMPTY; } if (XmlNameMatchesAscii(enc, ptr, end, KW_ANY)) { state->handler = declClose; state->role_none = XML_ROLE_ELEMENT_NONE; return XML_ROLE_CONTENT_ANY; } break; case XML_TOK_OPEN_PAREN: state->handler = element2; state->level = 1; return XML_ROLE_GROUP_OPEN; } return common(state, tok); } static int PTRCALL element2(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ELEMENT_NONE; case XML_TOK_POUND_NAME: if (XmlNameMatchesAscii(enc, ptr + MIN_BYTES_PER_CHAR(enc), end, KW_PCDATA)) { state->handler = element3; return XML_ROLE_CONTENT_PCDATA; } break; case XML_TOK_OPEN_PAREN: state->level = 2; state->handler = element6; return XML_ROLE_GROUP_OPEN; case XML_TOK_NAME: case XML_TOK_PREFIXED_NAME: state->handler = element7; return XML_ROLE_CONTENT_ELEMENT; case XML_TOK_NAME_QUESTION: state->handler = element7; return XML_ROLE_CONTENT_ELEMENT_OPT; case XML_TOK_NAME_ASTERISK: state->handler = element7; return XML_ROLE_CONTENT_ELEMENT_REP; case XML_TOK_NAME_PLUS: state->handler = element7; return XML_ROLE_CONTENT_ELEMENT_PLUS; } return common(state, tok); } static int PTRCALL element3(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ELEMENT_NONE; case XML_TOK_CLOSE_PAREN: state->handler = declClose; state->role_none = XML_ROLE_ELEMENT_NONE; return XML_ROLE_GROUP_CLOSE; case XML_TOK_CLOSE_PAREN_ASTERISK: state->handler = declClose; state->role_none = XML_ROLE_ELEMENT_NONE; return XML_ROLE_GROUP_CLOSE_REP; case XML_TOK_OR: state->handler = element4; return XML_ROLE_ELEMENT_NONE; } return common(state, tok); } static int PTRCALL element4(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ELEMENT_NONE; case XML_TOK_NAME: case XML_TOK_PREFIXED_NAME: state->handler = element5; return XML_ROLE_CONTENT_ELEMENT; } return common(state, tok); } static int PTRCALL element5(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ELEMENT_NONE; case XML_TOK_CLOSE_PAREN_ASTERISK: state->handler = declClose; state->role_none = XML_ROLE_ELEMENT_NONE; return XML_ROLE_GROUP_CLOSE_REP; case XML_TOK_OR: state->handler = element4; return XML_ROLE_ELEMENT_NONE; } return common(state, tok); } static int PTRCALL element6(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ELEMENT_NONE; case XML_TOK_OPEN_PAREN: state->level += 1; return XML_ROLE_GROUP_OPEN; case XML_TOK_NAME: case XML_TOK_PREFIXED_NAME: state->handler = element7; return XML_ROLE_CONTENT_ELEMENT; case XML_TOK_NAME_QUESTION: state->handler = element7; return XML_ROLE_CONTENT_ELEMENT_OPT; case XML_TOK_NAME_ASTERISK: state->handler = element7; return XML_ROLE_CONTENT_ELEMENT_REP; case XML_TOK_NAME_PLUS: state->handler = element7; return XML_ROLE_CONTENT_ELEMENT_PLUS; } return common(state, tok); } static int PTRCALL element7(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_ELEMENT_NONE; case XML_TOK_CLOSE_PAREN: state->level -= 1; if (state->level == 0) { state->handler = declClose; state->role_none = XML_ROLE_ELEMENT_NONE; } return XML_ROLE_GROUP_CLOSE; case XML_TOK_CLOSE_PAREN_ASTERISK: state->level -= 1; if (state->level == 0) { state->handler = declClose; state->role_none = XML_ROLE_ELEMENT_NONE; } return XML_ROLE_GROUP_CLOSE_REP; case XML_TOK_CLOSE_PAREN_QUESTION: state->level -= 1; if (state->level == 0) { state->handler = declClose; state->role_none = XML_ROLE_ELEMENT_NONE; } return XML_ROLE_GROUP_CLOSE_OPT; case XML_TOK_CLOSE_PAREN_PLUS: state->level -= 1; if (state->level == 0) { state->handler = declClose; state->role_none = XML_ROLE_ELEMENT_NONE; } return XML_ROLE_GROUP_CLOSE_PLUS; case XML_TOK_COMMA: state->handler = element6; return XML_ROLE_GROUP_SEQUENCE; case XML_TOK_OR: state->handler = element6; return XML_ROLE_GROUP_CHOICE; } return common(state, tok); } #ifdef XML_DTD static int PTRCALL condSect0(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NONE; case XML_TOK_NAME: if (XmlNameMatchesAscii(enc, ptr, end, KW_INCLUDE)) { state->handler = condSect1; return XML_ROLE_NONE; } if (XmlNameMatchesAscii(enc, ptr, end, KW_IGNORE)) { state->handler = condSect2; return XML_ROLE_NONE; } break; } return common(state, tok); } static int PTRCALL condSect1(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NONE; case XML_TOK_OPEN_BRACKET: state->handler = externalSubset1; state->includeLevel += 1; return XML_ROLE_NONE; } return common(state, tok); } static int PTRCALL condSect2(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return XML_ROLE_NONE; case XML_TOK_OPEN_BRACKET: state->handler = externalSubset1; return XML_ROLE_IGNORE_SECT; } return common(state, tok); } #endif /* XML_DTD */ static int PTRCALL declClose(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { switch (tok) { case XML_TOK_PROLOG_S: return state->role_none; case XML_TOK_DECL_CLOSE: setTopLevel(state); return state->role_none; } return common(state, tok); } static int PTRCALL error(PROLOG_STATE *state, int tok, const char *ptr, const char *end, const ENCODING *enc) { return XML_ROLE_NONE; } static int FASTCALL common(PROLOG_STATE *state, int tok) { #ifdef XML_DTD if (!state->documentEntity && tok == XML_TOK_PARAM_ENTITY_REF) return XML_ROLE_INNER_PARAM_ENTITY_REF; #endif state->handler = error; return XML_ROLE_ERROR; } void XmlPrologStateInit(PROLOG_STATE *state) { state->handler = prolog0; #ifdef XML_DTD state->documentEntity = 1; state->includeLevel = 0; state->inEntityValue = 0; #endif /* XML_DTD */ } #ifdef XML_DTD void XmlPrologStateInitExternalEntity(PROLOG_STATE *state) { state->handler = externalSubset0; state->documentEntity = 0; state->includeLevel = 0; } #endif /* XML_DTD */ madman-0.93/expat/xmltok.c0000644000175000001440000012006710053135241015257 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ #ifdef COMPILED_FROM_DSP #include "winconfig.h" #elif defined(MACOS_CLASSIC) #include "macconfig.h" #else #include "expatconfig.h" #endif /* ndef COMPILED_FROM_DSP */ #include "internal.h" #include "xmltok.h" #include "nametab.h" #ifdef XML_DTD #define IGNORE_SECTION_TOK_VTABLE , PREFIX(ignoreSectionTok) #else #define IGNORE_SECTION_TOK_VTABLE /* as nothing */ #endif #define VTABLE1 \ { PREFIX(prologTok), PREFIX(contentTok), \ PREFIX(cdataSectionTok) IGNORE_SECTION_TOK_VTABLE }, \ { PREFIX(attributeValueTok), PREFIX(entityValueTok) }, \ PREFIX(sameName), \ PREFIX(nameMatchesAscii), \ PREFIX(nameLength), \ PREFIX(skipS), \ PREFIX(getAtts), \ PREFIX(charRefNumber), \ PREFIX(predefinedEntityName), \ PREFIX(updatePosition), \ PREFIX(isPublicId) #define VTABLE VTABLE1, PREFIX(toUtf8), PREFIX(toUtf16) #define UCS2_GET_NAMING(pages, hi, lo) \ (namingBitmap[(pages[hi] << 3) + ((lo) >> 5)] & (1 << ((lo) & 0x1F))) /* A 2 byte UTF-8 representation splits the characters 11 bits between the bottom 5 and 6 bits of the bytes. We need 8 bits to index into pages, 3 bits to add to that index and 5 bits to generate the mask. */ #define UTF8_GET_NAMING2(pages, byte) \ (namingBitmap[((pages)[(((byte)[0]) >> 2) & 7] << 3) \ + ((((byte)[0]) & 3) << 1) \ + ((((byte)[1]) >> 5) & 1)] \ & (1 << (((byte)[1]) & 0x1F))) /* A 3 byte UTF-8 representation splits the characters 16 bits between the bottom 4, 6 and 6 bits of the bytes. We need 8 bits to index into pages, 3 bits to add to that index and 5 bits to generate the mask. */ #define UTF8_GET_NAMING3(pages, byte) \ (namingBitmap[((pages)[((((byte)[0]) & 0xF) << 4) \ + ((((byte)[1]) >> 2) & 0xF)] \ << 3) \ + ((((byte)[1]) & 3) << 1) \ + ((((byte)[2]) >> 5) & 1)] \ & (1 << (((byte)[2]) & 0x1F))) #define UTF8_GET_NAMING(pages, p, n) \ ((n) == 2 \ ? UTF8_GET_NAMING2(pages, (const unsigned char *)(p)) \ : ((n) == 3 \ ? UTF8_GET_NAMING3(pages, (const unsigned char *)(p)) \ : 0)) /* Detection of invalid UTF-8 sequences is based on Table 3.1B of Unicode 3.2: http://www.unicode.org/unicode/reports/tr28/ with the additional restriction of not allowing the Unicode code points 0xFFFF and 0xFFFE (sequences EF,BF,BF and EF,BF,BE). Implementation details: (A & 0x80) == 0 means A < 0x80 and (A & 0xC0) == 0xC0 means A > 0xBF */ #define UTF8_INVALID2(p) \ ((*p) < 0xC2 || ((p)[1] & 0x80) == 0 || ((p)[1] & 0xC0) == 0xC0) #define UTF8_INVALID3(p) \ (((p)[2] & 0x80) == 0 \ || \ ((*p) == 0xEF && (p)[1] == 0xBF \ ? \ (p)[2] > 0xBD \ : \ ((p)[2] & 0xC0) == 0xC0) \ || \ ((*p) == 0xE0 \ ? \ (p)[1] < 0xA0 || ((p)[1] & 0xC0) == 0xC0 \ : \ ((p)[1] & 0x80) == 0 \ || \ ((*p) == 0xED ? (p)[1] > 0x9F : ((p)[1] & 0xC0) == 0xC0))) #define UTF8_INVALID4(p) \ (((p)[3] & 0x80) == 0 || ((p)[3] & 0xC0) == 0xC0 \ || \ ((p)[2] & 0x80) == 0 || ((p)[2] & 0xC0) == 0xC0 \ || \ ((*p) == 0xF0 \ ? \ (p)[1] < 0x90 || ((p)[1] & 0xC0) == 0xC0 \ : \ ((p)[1] & 0x80) == 0 \ || \ ((*p) == 0xF4 ? (p)[1] > 0x8F : ((p)[1] & 0xC0) == 0xC0))) static int PTRFASTCALL isNever(const ENCODING *enc, const char *p) { return 0; } static int PTRFASTCALL utf8_isName2(const ENCODING *enc, const char *p) { return UTF8_GET_NAMING2(namePages, (const unsigned char *)p); } static int PTRFASTCALL utf8_isName3(const ENCODING *enc, const char *p) { return UTF8_GET_NAMING3(namePages, (const unsigned char *)p); } #define utf8_isName4 isNever static int PTRFASTCALL utf8_isNmstrt2(const ENCODING *enc, const char *p) { return UTF8_GET_NAMING2(nmstrtPages, (const unsigned char *)p); } static int PTRFASTCALL utf8_isNmstrt3(const ENCODING *enc, const char *p) { return UTF8_GET_NAMING3(nmstrtPages, (const unsigned char *)p); } #define utf8_isNmstrt4 isNever static int PTRFASTCALL utf8_isInvalid2(const ENCODING *enc, const char *p) { return UTF8_INVALID2((const unsigned char *)p); } static int PTRFASTCALL utf8_isInvalid3(const ENCODING *enc, const char *p) { return UTF8_INVALID3((const unsigned char *)p); } static int PTRFASTCALL utf8_isInvalid4(const ENCODING *enc, const char *p) { return UTF8_INVALID4((const unsigned char *)p); } struct normal_encoding { ENCODING enc; unsigned char type[256]; #ifdef XML_MIN_SIZE int (PTRFASTCALL *byteType)(const ENCODING *, const char *); int (PTRFASTCALL *isNameMin)(const ENCODING *, const char *); int (PTRFASTCALL *isNmstrtMin)(const ENCODING *, const char *); int (PTRFASTCALL *byteToAscii)(const ENCODING *, const char *); int (PTRCALL *charMatches)(const ENCODING *, const char *, int); #endif /* XML_MIN_SIZE */ int (PTRFASTCALL *isName2)(const ENCODING *, const char *); int (PTRFASTCALL *isName3)(const ENCODING *, const char *); int (PTRFASTCALL *isName4)(const ENCODING *, const char *); int (PTRFASTCALL *isNmstrt2)(const ENCODING *, const char *); int (PTRFASTCALL *isNmstrt3)(const ENCODING *, const char *); int (PTRFASTCALL *isNmstrt4)(const ENCODING *, const char *); int (PTRFASTCALL *isInvalid2)(const ENCODING *, const char *); int (PTRFASTCALL *isInvalid3)(const ENCODING *, const char *); int (PTRFASTCALL *isInvalid4)(const ENCODING *, const char *); }; #define AS_NORMAL_ENCODING(enc) ((const struct normal_encoding *) (enc)) #ifdef XML_MIN_SIZE #define STANDARD_VTABLE(E) \ E ## byteType, \ E ## isNameMin, \ E ## isNmstrtMin, \ E ## byteToAscii, \ E ## charMatches, #else #define STANDARD_VTABLE(E) /* as nothing */ #endif #define NORMAL_VTABLE(E) \ E ## isName2, \ E ## isName3, \ E ## isName4, \ E ## isNmstrt2, \ E ## isNmstrt3, \ E ## isNmstrt4, \ E ## isInvalid2, \ E ## isInvalid3, \ E ## isInvalid4 static int FASTCALL checkCharRefNumber(int); #include "xmltok_impl.h" #include "ascii.h" #ifdef XML_MIN_SIZE #define sb_isNameMin isNever #define sb_isNmstrtMin isNever #endif #ifdef XML_MIN_SIZE #define MINBPC(enc) ((enc)->minBytesPerChar) #else /* minimum bytes per character */ #define MINBPC(enc) 1 #endif #define SB_BYTE_TYPE(enc, p) \ (((struct normal_encoding *)(enc))->type[(unsigned char)*(p)]) #ifdef XML_MIN_SIZE static int PTRFASTCALL sb_byteType(const ENCODING *enc, const char *p) { return SB_BYTE_TYPE(enc, p); } #define BYTE_TYPE(enc, p) \ (AS_NORMAL_ENCODING(enc)->byteType(enc, p)) #else #define BYTE_TYPE(enc, p) SB_BYTE_TYPE(enc, p) #endif #ifdef XML_MIN_SIZE #define BYTE_TO_ASCII(enc, p) \ (AS_NORMAL_ENCODING(enc)->byteToAscii(enc, p)) static int PTRFASTCALL sb_byteToAscii(const ENCODING *enc, const char *p) { return *p; } #else #define BYTE_TO_ASCII(enc, p) (*(p)) #endif #define IS_NAME_CHAR(enc, p, n) \ (AS_NORMAL_ENCODING(enc)->isName ## n(enc, p)) #define IS_NMSTRT_CHAR(enc, p, n) \ (AS_NORMAL_ENCODING(enc)->isNmstrt ## n(enc, p)) #define IS_INVALID_CHAR(enc, p, n) \ (AS_NORMAL_ENCODING(enc)->isInvalid ## n(enc, p)) #ifdef XML_MIN_SIZE #define IS_NAME_CHAR_MINBPC(enc, p) \ (AS_NORMAL_ENCODING(enc)->isNameMin(enc, p)) #define IS_NMSTRT_CHAR_MINBPC(enc, p) \ (AS_NORMAL_ENCODING(enc)->isNmstrtMin(enc, p)) #else #define IS_NAME_CHAR_MINBPC(enc, p) (0) #define IS_NMSTRT_CHAR_MINBPC(enc, p) (0) #endif #ifdef XML_MIN_SIZE #define CHAR_MATCHES(enc, p, c) \ (AS_NORMAL_ENCODING(enc)->charMatches(enc, p, c)) static int PTRCALL sb_charMatches(const ENCODING *enc, const char *p, int c) { return *p == c; } #else /* c is an ASCII character */ #define CHAR_MATCHES(enc, p, c) (*(p) == c) #endif #define PREFIX(ident) normal_ ## ident #include "xmltok_impl.c" #undef MINBPC #undef BYTE_TYPE #undef BYTE_TO_ASCII #undef CHAR_MATCHES #undef IS_NAME_CHAR #undef IS_NAME_CHAR_MINBPC #undef IS_NMSTRT_CHAR #undef IS_NMSTRT_CHAR_MINBPC #undef IS_INVALID_CHAR enum { /* UTF8_cvalN is value of masked first byte of N byte sequence */ UTF8_cval1 = 0x00, UTF8_cval2 = 0xc0, UTF8_cval3 = 0xe0, UTF8_cval4 = 0xf0 }; static void PTRCALL utf8_toUtf8(const ENCODING *enc, const char **fromP, const char *fromLim, char **toP, const char *toLim) { char *to; const char *from; if (fromLim - *fromP > toLim - *toP) { /* Avoid copying partial characters. */ for (fromLim = *fromP + (toLim - *toP); fromLim > *fromP; fromLim--) if (((unsigned char)fromLim[-1] & 0xc0) != 0x80) break; } for (to = *toP, from = *fromP; from != fromLim; from++, to++) *to = *from; *fromP = from; *toP = to; } static void PTRCALL utf8_toUtf16(const ENCODING *enc, const char **fromP, const char *fromLim, unsigned short **toP, const unsigned short *toLim) { unsigned short *to = *toP; const char *from = *fromP; while (from != fromLim && to != toLim) { switch (((struct normal_encoding *)enc)->type[(unsigned char)*from]) { case BT_LEAD2: *to++ = (unsigned short)(((from[0] & 0x1f) << 6) | (from[1] & 0x3f)); from += 2; break; case BT_LEAD3: *to++ = (unsigned short)(((from[0] & 0xf) << 12) | ((from[1] & 0x3f) << 6) | (from[2] & 0x3f)); from += 3; break; case BT_LEAD4: { unsigned long n; if (to + 1 == toLim) goto after; n = ((from[0] & 0x7) << 18) | ((from[1] & 0x3f) << 12) | ((from[2] & 0x3f) << 6) | (from[3] & 0x3f); n -= 0x10000; to[0] = (unsigned short)((n >> 10) | 0xD800); to[1] = (unsigned short)((n & 0x3FF) | 0xDC00); to += 2; from += 4; } break; default: *to++ = *from++; break; } } after: *fromP = from; *toP = to; } #ifdef XML_NS static const struct normal_encoding utf8_encoding_ns = { { VTABLE1, utf8_toUtf8, utf8_toUtf16, 1, 1, 0 }, { #include "asciitab.h" #include "utf8tab.h" }, STANDARD_VTABLE(sb_) NORMAL_VTABLE(utf8_) }; #endif static const struct normal_encoding utf8_encoding = { { VTABLE1, utf8_toUtf8, utf8_toUtf16, 1, 1, 0 }, { #define BT_COLON BT_NMSTRT #include "asciitab.h" #undef BT_COLON #include "utf8tab.h" }, STANDARD_VTABLE(sb_) NORMAL_VTABLE(utf8_) }; #ifdef XML_NS static const struct normal_encoding internal_utf8_encoding_ns = { { VTABLE1, utf8_toUtf8, utf8_toUtf16, 1, 1, 0 }, { #include "iasciitab.h" #include "utf8tab.h" }, STANDARD_VTABLE(sb_) NORMAL_VTABLE(utf8_) }; #endif static const struct normal_encoding internal_utf8_encoding = { { VTABLE1, utf8_toUtf8, utf8_toUtf16, 1, 1, 0 }, { #define BT_COLON BT_NMSTRT #include "iasciitab.h" #undef BT_COLON #include "utf8tab.h" }, STANDARD_VTABLE(sb_) NORMAL_VTABLE(utf8_) }; static void PTRCALL latin1_toUtf8(const ENCODING *enc, const char **fromP, const char *fromLim, char **toP, const char *toLim) { for (;;) { unsigned char c; if (*fromP == fromLim) break; c = (unsigned char)**fromP; if (c & 0x80) { if (toLim - *toP < 2) break; *(*toP)++ = (char)((c >> 6) | UTF8_cval2); *(*toP)++ = (char)((c & 0x3f) | 0x80); (*fromP)++; } else { if (*toP == toLim) break; *(*toP)++ = *(*fromP)++; } } } static void PTRCALL latin1_toUtf16(const ENCODING *enc, const char **fromP, const char *fromLim, unsigned short **toP, const unsigned short *toLim) { while (*fromP != fromLim && *toP != toLim) *(*toP)++ = (unsigned char)*(*fromP)++; } #ifdef XML_NS static const struct normal_encoding latin1_encoding_ns = { { VTABLE1, latin1_toUtf8, latin1_toUtf16, 1, 0, 0 }, { #include "asciitab.h" #include "latin1tab.h" }, STANDARD_VTABLE(sb_) }; #endif static const struct normal_encoding latin1_encoding = { { VTABLE1, latin1_toUtf8, latin1_toUtf16, 1, 0, 0 }, { #define BT_COLON BT_NMSTRT #include "asciitab.h" #undef BT_COLON #include "latin1tab.h" }, STANDARD_VTABLE(sb_) }; static void PTRCALL ascii_toUtf8(const ENCODING *enc, const char **fromP, const char *fromLim, char **toP, const char *toLim) { while (*fromP != fromLim && *toP != toLim) *(*toP)++ = *(*fromP)++; } #ifdef XML_NS static const struct normal_encoding ascii_encoding_ns = { { VTABLE1, ascii_toUtf8, latin1_toUtf16, 1, 1, 0 }, { #include "asciitab.h" /* BT_NONXML == 0 */ }, STANDARD_VTABLE(sb_) }; #endif static const struct normal_encoding ascii_encoding = { { VTABLE1, ascii_toUtf8, latin1_toUtf16, 1, 1, 0 }, { #define BT_COLON BT_NMSTRT #include "asciitab.h" #undef BT_COLON /* BT_NONXML == 0 */ }, STANDARD_VTABLE(sb_) }; static int PTRFASTCALL unicode_byte_type(char hi, char lo) { switch ((unsigned char)hi) { case 0xD8: case 0xD9: case 0xDA: case 0xDB: return BT_LEAD4; case 0xDC: case 0xDD: case 0xDE: case 0xDF: return BT_TRAIL; case 0xFF: switch ((unsigned char)lo) { case 0xFF: case 0xFE: return BT_NONXML; } break; } return BT_NONASCII; } #define DEFINE_UTF16_TO_UTF8(E) \ static void PTRCALL \ E ## toUtf8(const ENCODING *enc, \ const char **fromP, const char *fromLim, \ char **toP, const char *toLim) \ { \ const char *from; \ for (from = *fromP; from != fromLim; from += 2) { \ int plane; \ unsigned char lo2; \ unsigned char lo = GET_LO(from); \ unsigned char hi = GET_HI(from); \ switch (hi) { \ case 0: \ if (lo < 0x80) { \ if (*toP == toLim) { \ *fromP = from; \ return; \ } \ *(*toP)++ = lo; \ break; \ } \ /* fall through */ \ case 0x1: case 0x2: case 0x3: \ case 0x4: case 0x5: case 0x6: case 0x7: \ if (toLim - *toP < 2) { \ *fromP = from; \ return; \ } \ *(*toP)++ = ((lo >> 6) | (hi << 2) | UTF8_cval2); \ *(*toP)++ = ((lo & 0x3f) | 0x80); \ break; \ default: \ if (toLim - *toP < 3) { \ *fromP = from; \ return; \ } \ /* 16 bits divided 4, 6, 6 amongst 3 bytes */ \ *(*toP)++ = ((hi >> 4) | UTF8_cval3); \ *(*toP)++ = (((hi & 0xf) << 2) | (lo >> 6) | 0x80); \ *(*toP)++ = ((lo & 0x3f) | 0x80); \ break; \ case 0xD8: case 0xD9: case 0xDA: case 0xDB: \ if (toLim - *toP < 4) { \ *fromP = from; \ return; \ } \ plane = (((hi & 0x3) << 2) | ((lo >> 6) & 0x3)) + 1; \ *(*toP)++ = ((plane >> 2) | UTF8_cval4); \ *(*toP)++ = (((lo >> 2) & 0xF) | ((plane & 0x3) << 4) | 0x80); \ from += 2; \ lo2 = GET_LO(from); \ *(*toP)++ = (((lo & 0x3) << 4) \ | ((GET_HI(from) & 0x3) << 2) \ | (lo2 >> 6) \ | 0x80); \ *(*toP)++ = ((lo2 & 0x3f) | 0x80); \ break; \ } \ } \ *fromP = from; \ } #define DEFINE_UTF16_TO_UTF16(E) \ static void PTRCALL \ E ## toUtf16(const ENCODING *enc, \ const char **fromP, const char *fromLim, \ unsigned short **toP, const unsigned short *toLim) \ { \ /* Avoid copying first half only of surrogate */ \ if (fromLim - *fromP > ((toLim - *toP) << 1) \ && (GET_HI(fromLim - 2) & 0xF8) == 0xD8) \ fromLim -= 2; \ for (; *fromP != fromLim && *toP != toLim; *fromP += 2) \ *(*toP)++ = (GET_HI(*fromP) << 8) | GET_LO(*fromP); \ } #define SET2(ptr, ch) \ (((ptr)[0] = ((ch) & 0xff)), ((ptr)[1] = ((ch) >> 8))) #define GET_LO(ptr) ((unsigned char)(ptr)[0]) #define GET_HI(ptr) ((unsigned char)(ptr)[1]) DEFINE_UTF16_TO_UTF8(little2_) DEFINE_UTF16_TO_UTF16(little2_) #undef SET2 #undef GET_LO #undef GET_HI #define SET2(ptr, ch) \ (((ptr)[0] = ((ch) >> 8)), ((ptr)[1] = ((ch) & 0xFF))) #define GET_LO(ptr) ((unsigned char)(ptr)[1]) #define GET_HI(ptr) ((unsigned char)(ptr)[0]) DEFINE_UTF16_TO_UTF8(big2_) DEFINE_UTF16_TO_UTF16(big2_) #undef SET2 #undef GET_LO #undef GET_HI #define LITTLE2_BYTE_TYPE(enc, p) \ ((p)[1] == 0 \ ? ((struct normal_encoding *)(enc))->type[(unsigned char)*(p)] \ : unicode_byte_type((p)[1], (p)[0])) #define LITTLE2_BYTE_TO_ASCII(enc, p) ((p)[1] == 0 ? (p)[0] : -1) #define LITTLE2_CHAR_MATCHES(enc, p, c) ((p)[1] == 0 && (p)[0] == c) #define LITTLE2_IS_NAME_CHAR_MINBPC(enc, p) \ UCS2_GET_NAMING(namePages, (unsigned char)p[1], (unsigned char)p[0]) #define LITTLE2_IS_NMSTRT_CHAR_MINBPC(enc, p) \ UCS2_GET_NAMING(nmstrtPages, (unsigned char)p[1], (unsigned char)p[0]) #ifdef XML_MIN_SIZE static int PTRFASTCALL little2_byteType(const ENCODING *enc, const char *p) { return LITTLE2_BYTE_TYPE(enc, p); } static int PTRFASTCALL little2_byteToAscii(const ENCODING *enc, const char *p) { return LITTLE2_BYTE_TO_ASCII(enc, p); } static int PTRCALL little2_charMatches(const ENCODING *enc, const char *p, int c) { return LITTLE2_CHAR_MATCHES(enc, p, c); } static int PTRFASTCALL little2_isNameMin(const ENCODING *enc, const char *p) { return LITTLE2_IS_NAME_CHAR_MINBPC(enc, p); } static int PTRFASTCALL little2_isNmstrtMin(const ENCODING *enc, const char *p) { return LITTLE2_IS_NMSTRT_CHAR_MINBPC(enc, p); } #undef VTABLE #define VTABLE VTABLE1, little2_toUtf8, little2_toUtf16 #else /* not XML_MIN_SIZE */ #undef PREFIX #define PREFIX(ident) little2_ ## ident #define MINBPC(enc) 2 /* CHAR_MATCHES is guaranteed to have MINBPC bytes available. */ #define BYTE_TYPE(enc, p) LITTLE2_BYTE_TYPE(enc, p) #define BYTE_TO_ASCII(enc, p) LITTLE2_BYTE_TO_ASCII(enc, p) #define CHAR_MATCHES(enc, p, c) LITTLE2_CHAR_MATCHES(enc, p, c) #define IS_NAME_CHAR(enc, p, n) 0 #define IS_NAME_CHAR_MINBPC(enc, p) LITTLE2_IS_NAME_CHAR_MINBPC(enc, p) #define IS_NMSTRT_CHAR(enc, p, n) (0) #define IS_NMSTRT_CHAR_MINBPC(enc, p) LITTLE2_IS_NMSTRT_CHAR_MINBPC(enc, p) #include "xmltok_impl.c" #undef MINBPC #undef BYTE_TYPE #undef BYTE_TO_ASCII #undef CHAR_MATCHES #undef IS_NAME_CHAR #undef IS_NAME_CHAR_MINBPC #undef IS_NMSTRT_CHAR #undef IS_NMSTRT_CHAR_MINBPC #undef IS_INVALID_CHAR #endif /* not XML_MIN_SIZE */ #ifdef XML_NS static const struct normal_encoding little2_encoding_ns = { { VTABLE, 2, 0, #if BYTEORDER == 1234 1 #else 0 #endif }, { #include "asciitab.h" #include "latin1tab.h" }, STANDARD_VTABLE(little2_) }; #endif static const struct normal_encoding little2_encoding = { { VTABLE, 2, 0, #if BYTEORDER == 1234 1 #else 0 #endif }, { #define BT_COLON BT_NMSTRT #include "asciitab.h" #undef BT_COLON #include "latin1tab.h" }, STANDARD_VTABLE(little2_) }; #if BYTEORDER != 4321 #ifdef XML_NS static const struct normal_encoding internal_little2_encoding_ns = { { VTABLE, 2, 0, 1 }, { #include "iasciitab.h" #include "latin1tab.h" }, STANDARD_VTABLE(little2_) }; #endif static const struct normal_encoding internal_little2_encoding = { { VTABLE, 2, 0, 1 }, { #define BT_COLON BT_NMSTRT #include "iasciitab.h" #undef BT_COLON #include "latin1tab.h" }, STANDARD_VTABLE(little2_) }; #endif #define BIG2_BYTE_TYPE(enc, p) \ ((p)[0] == 0 \ ? ((struct normal_encoding *)(enc))->type[(unsigned char)(p)[1]] \ : unicode_byte_type((p)[0], (p)[1])) #define BIG2_BYTE_TO_ASCII(enc, p) ((p)[0] == 0 ? (p)[1] : -1) #define BIG2_CHAR_MATCHES(enc, p, c) ((p)[0] == 0 && (p)[1] == c) #define BIG2_IS_NAME_CHAR_MINBPC(enc, p) \ UCS2_GET_NAMING(namePages, (unsigned char)p[0], (unsigned char)p[1]) #define BIG2_IS_NMSTRT_CHAR_MINBPC(enc, p) \ UCS2_GET_NAMING(nmstrtPages, (unsigned char)p[0], (unsigned char)p[1]) #ifdef XML_MIN_SIZE static int PTRFASTCALL big2_byteType(const ENCODING *enc, const char *p) { return BIG2_BYTE_TYPE(enc, p); } static int PTRFASTCALL big2_byteToAscii(const ENCODING *enc, const char *p) { return BIG2_BYTE_TO_ASCII(enc, p); } static int PTRCALL big2_charMatches(const ENCODING *enc, const char *p, int c) { return BIG2_CHAR_MATCHES(enc, p, c); } static int PTRFASTCALL big2_isNameMin(const ENCODING *enc, const char *p) { return BIG2_IS_NAME_CHAR_MINBPC(enc, p); } static int PTRFASTCALL big2_isNmstrtMin(const ENCODING *enc, const char *p) { return BIG2_IS_NMSTRT_CHAR_MINBPC(enc, p); } #undef VTABLE #define VTABLE VTABLE1, big2_toUtf8, big2_toUtf16 #else /* not XML_MIN_SIZE */ #undef PREFIX #define PREFIX(ident) big2_ ## ident #define MINBPC(enc) 2 /* CHAR_MATCHES is guaranteed to have MINBPC bytes available. */ #define BYTE_TYPE(enc, p) BIG2_BYTE_TYPE(enc, p) #define BYTE_TO_ASCII(enc, p) BIG2_BYTE_TO_ASCII(enc, p) #define CHAR_MATCHES(enc, p, c) BIG2_CHAR_MATCHES(enc, p, c) #define IS_NAME_CHAR(enc, p, n) 0 #define IS_NAME_CHAR_MINBPC(enc, p) BIG2_IS_NAME_CHAR_MINBPC(enc, p) #define IS_NMSTRT_CHAR(enc, p, n) (0) #define IS_NMSTRT_CHAR_MINBPC(enc, p) BIG2_IS_NMSTRT_CHAR_MINBPC(enc, p) #include "xmltok_impl.c" #undef MINBPC #undef BYTE_TYPE #undef BYTE_TO_ASCII #undef CHAR_MATCHES #undef IS_NAME_CHAR #undef IS_NAME_CHAR_MINBPC #undef IS_NMSTRT_CHAR #undef IS_NMSTRT_CHAR_MINBPC #undef IS_INVALID_CHAR #endif /* not XML_MIN_SIZE */ #ifdef XML_NS static const struct normal_encoding big2_encoding_ns = { { VTABLE, 2, 0, #if BYTEORDER == 4321 1 #else 0 #endif }, { #include "asciitab.h" #include "latin1tab.h" }, STANDARD_VTABLE(big2_) }; #endif static const struct normal_encoding big2_encoding = { { VTABLE, 2, 0, #if BYTEORDER == 4321 1 #else 0 #endif }, { #define BT_COLON BT_NMSTRT #include "asciitab.h" #undef BT_COLON #include "latin1tab.h" }, STANDARD_VTABLE(big2_) }; #if BYTEORDER != 1234 #ifdef XML_NS static const struct normal_encoding internal_big2_encoding_ns = { { VTABLE, 2, 0, 1 }, { #include "iasciitab.h" #include "latin1tab.h" }, STANDARD_VTABLE(big2_) }; #endif static const struct normal_encoding internal_big2_encoding = { { VTABLE, 2, 0, 1 }, { #define BT_COLON BT_NMSTRT #include "iasciitab.h" #undef BT_COLON #include "latin1tab.h" }, STANDARD_VTABLE(big2_) }; #endif #undef PREFIX static int FASTCALL streqci(const char *s1, const char *s2) { for (;;) { char c1 = *s1++; char c2 = *s2++; if (ASCII_a <= c1 && c1 <= ASCII_z) c1 += ASCII_A - ASCII_a; if (ASCII_a <= c2 && c2 <= ASCII_z) c2 += ASCII_A - ASCII_a; if (c1 != c2) return 0; if (!c1) break; } return 1; } static void PTRCALL initUpdatePosition(const ENCODING *enc, const char *ptr, const char *end, POSITION *pos) { normal_updatePosition(&utf8_encoding.enc, ptr, end, pos); } static int toAscii(const ENCODING *enc, const char *ptr, const char *end) { char buf[1]; char *p = buf; XmlUtf8Convert(enc, &ptr, end, &p, p + 1); if (p == buf) return -1; else return buf[0]; } static int FASTCALL isSpace(int c) { switch (c) { case 0x20: case 0xD: case 0xA: case 0x9: return 1; } return 0; } /* Return 1 if there's just optional white space or there's an S followed by name=val. */ static int parsePseudoAttribute(const ENCODING *enc, const char *ptr, const char *end, const char **namePtr, const char **nameEndPtr, const char **valPtr, const char **nextTokPtr) { int c; char open; if (ptr == end) { *namePtr = NULL; return 1; } if (!isSpace(toAscii(enc, ptr, end))) { *nextTokPtr = ptr; return 0; } do { ptr += enc->minBytesPerChar; } while (isSpace(toAscii(enc, ptr, end))); if (ptr == end) { *namePtr = NULL; return 1; } *namePtr = ptr; for (;;) { c = toAscii(enc, ptr, end); if (c == -1) { *nextTokPtr = ptr; return 0; } if (c == ASCII_EQUALS) { *nameEndPtr = ptr; break; } if (isSpace(c)) { *nameEndPtr = ptr; do { ptr += enc->minBytesPerChar; } while (isSpace(c = toAscii(enc, ptr, end))); if (c != ASCII_EQUALS) { *nextTokPtr = ptr; return 0; } break; } ptr += enc->minBytesPerChar; } if (ptr == *namePtr) { *nextTokPtr = ptr; return 0; } ptr += enc->minBytesPerChar; c = toAscii(enc, ptr, end); while (isSpace(c)) { ptr += enc->minBytesPerChar; c = toAscii(enc, ptr, end); } if (c != ASCII_QUOT && c != ASCII_APOS) { *nextTokPtr = ptr; return 0; } open = (char)c; ptr += enc->minBytesPerChar; *valPtr = ptr; for (;; ptr += enc->minBytesPerChar) { c = toAscii(enc, ptr, end); if (c == open) break; if (!(ASCII_a <= c && c <= ASCII_z) && !(ASCII_A <= c && c <= ASCII_Z) && !(ASCII_0 <= c && c <= ASCII_9) && c != ASCII_PERIOD && c != ASCII_MINUS && c != ASCII_UNDERSCORE) { *nextTokPtr = ptr; return 0; } } *nextTokPtr = ptr + enc->minBytesPerChar; return 1; } static const char KW_version[] = { ASCII_v, ASCII_e, ASCII_r, ASCII_s, ASCII_i, ASCII_o, ASCII_n, '\0' }; static const char KW_encoding[] = { ASCII_e, ASCII_n, ASCII_c, ASCII_o, ASCII_d, ASCII_i, ASCII_n, ASCII_g, '\0' }; static const char KW_standalone[] = { ASCII_s, ASCII_t, ASCII_a, ASCII_n, ASCII_d, ASCII_a, ASCII_l, ASCII_o, ASCII_n, ASCII_e, '\0' }; static const char KW_yes[] = { ASCII_y, ASCII_e, ASCII_s, '\0' }; static const char KW_no[] = { ASCII_n, ASCII_o, '\0' }; static int doParseXmlDecl(const ENCODING *(*encodingFinder)(const ENCODING *, const char *, const char *), int isGeneralTextEntity, const ENCODING *enc, const char *ptr, const char *end, const char **badPtr, const char **versionPtr, const char **versionEndPtr, const char **encodingName, const ENCODING **encoding, int *standalone) { const char *val = NULL; const char *name = NULL; const char *nameEnd = NULL; ptr += 5 * enc->minBytesPerChar; end -= 2 * enc->minBytesPerChar; if (!parsePseudoAttribute(enc, ptr, end, &name, &nameEnd, &val, &ptr) || !name) { *badPtr = ptr; return 0; } if (!XmlNameMatchesAscii(enc, name, nameEnd, KW_version)) { if (!isGeneralTextEntity) { *badPtr = name; return 0; } } else { if (versionPtr) *versionPtr = val; if (versionEndPtr) *versionEndPtr = ptr; if (!parsePseudoAttribute(enc, ptr, end, &name, &nameEnd, &val, &ptr)) { *badPtr = ptr; return 0; } if (!name) { if (isGeneralTextEntity) { /* a TextDecl must have an EncodingDecl */ *badPtr = ptr; return 0; } return 1; } } if (XmlNameMatchesAscii(enc, name, nameEnd, KW_encoding)) { int c = toAscii(enc, val, end); if (!(ASCII_a <= c && c <= ASCII_z) && !(ASCII_A <= c && c <= ASCII_Z)) { *badPtr = val; return 0; } if (encodingName) *encodingName = val; if (encoding) *encoding = encodingFinder(enc, val, ptr - enc->minBytesPerChar); if (!parsePseudoAttribute(enc, ptr, end, &name, &nameEnd, &val, &ptr)) { *badPtr = ptr; return 0; } if (!name) return 1; } if (!XmlNameMatchesAscii(enc, name, nameEnd, KW_standalone) || isGeneralTextEntity) { *badPtr = name; return 0; } if (XmlNameMatchesAscii(enc, val, ptr - enc->minBytesPerChar, KW_yes)) { if (standalone) *standalone = 1; } else if (XmlNameMatchesAscii(enc, val, ptr - enc->minBytesPerChar, KW_no)) { if (standalone) *standalone = 0; } else { *badPtr = val; return 0; } while (isSpace(toAscii(enc, ptr, end))) ptr += enc->minBytesPerChar; if (ptr != end) { *badPtr = ptr; return 0; } return 1; } static int FASTCALL checkCharRefNumber(int result) { switch (result >> 8) { case 0xD8: case 0xD9: case 0xDA: case 0xDB: case 0xDC: case 0xDD: case 0xDE: case 0xDF: return -1; case 0: if (latin1_encoding.type[result] == BT_NONXML) return -1; break; case 0xFF: if (result == 0xFFFE || result == 0xFFFF) return -1; break; } return result; } int FASTCALL XmlUtf8Encode(int c, char *buf) { enum { /* minN is minimum legal resulting value for N byte sequence */ min2 = 0x80, min3 = 0x800, min4 = 0x10000 }; if (c < 0) return 0; if (c < min2) { buf[0] = (char)(c | UTF8_cval1); return 1; } if (c < min3) { buf[0] = (char)((c >> 6) | UTF8_cval2); buf[1] = (char)((c & 0x3f) | 0x80); return 2; } if (c < min4) { buf[0] = (char)((c >> 12) | UTF8_cval3); buf[1] = (char)(((c >> 6) & 0x3f) | 0x80); buf[2] = (char)((c & 0x3f) | 0x80); return 3; } if (c < 0x110000) { buf[0] = (char)((c >> 18) | UTF8_cval4); buf[1] = (char)(((c >> 12) & 0x3f) | 0x80); buf[2] = (char)(((c >> 6) & 0x3f) | 0x80); buf[3] = (char)((c & 0x3f) | 0x80); return 4; } return 0; } int FASTCALL XmlUtf16Encode(int charNum, unsigned short *buf) { if (charNum < 0) return 0; if (charNum < 0x10000) { buf[0] = (unsigned short)charNum; return 1; } if (charNum < 0x110000) { charNum -= 0x10000; buf[0] = (unsigned short)((charNum >> 10) + 0xD800); buf[1] = (unsigned short)((charNum & 0x3FF) + 0xDC00); return 2; } return 0; } struct unknown_encoding { struct normal_encoding normal; int (*convert)(void *userData, const char *p); void *userData; unsigned short utf16[256]; char utf8[256][4]; }; #define AS_UNKNOWN_ENCODING(enc) ((const struct unknown_encoding *) (enc)) int XmlSizeOfUnknownEncoding(void) { return sizeof(struct unknown_encoding); } static int PTRFASTCALL unknown_isName(const ENCODING *enc, const char *p) { const struct unknown_encoding *uenc = AS_UNKNOWN_ENCODING(enc); int c = uenc->convert(uenc->userData, p); if (c & ~0xFFFF) return 0; return UCS2_GET_NAMING(namePages, c >> 8, c & 0xFF); } static int PTRFASTCALL unknown_isNmstrt(const ENCODING *enc, const char *p) { const struct unknown_encoding *uenc = AS_UNKNOWN_ENCODING(enc); int c = uenc->convert(uenc->userData, p); if (c & ~0xFFFF) return 0; return UCS2_GET_NAMING(nmstrtPages, c >> 8, c & 0xFF); } static int PTRFASTCALL unknown_isInvalid(const ENCODING *enc, const char *p) { const struct unknown_encoding *uenc = AS_UNKNOWN_ENCODING(enc); int c = uenc->convert(uenc->userData, p); return (c & ~0xFFFF) || checkCharRefNumber(c) < 0; } static void PTRCALL unknown_toUtf8(const ENCODING *enc, const char **fromP, const char *fromLim, char **toP, const char *toLim) { const struct unknown_encoding *uenc = AS_UNKNOWN_ENCODING(enc); char buf[XML_UTF8_ENCODE_MAX]; for (;;) { const char *utf8; int n; if (*fromP == fromLim) break; utf8 = uenc->utf8[(unsigned char)**fromP]; n = *utf8++; if (n == 0) { int c = uenc->convert(uenc->userData, *fromP); n = XmlUtf8Encode(c, buf); if (n > toLim - *toP) break; utf8 = buf; *fromP += (AS_NORMAL_ENCODING(enc)->type[(unsigned char)**fromP] - (BT_LEAD2 - 2)); } else { if (n > toLim - *toP) break; (*fromP)++; } do { *(*toP)++ = *utf8++; } while (--n != 0); } } static void PTRCALL unknown_toUtf16(const ENCODING *enc, const char **fromP, const char *fromLim, unsigned short **toP, const unsigned short *toLim) { const struct unknown_encoding *uenc = AS_UNKNOWN_ENCODING(enc); while (*fromP != fromLim && *toP != toLim) { unsigned short c = uenc->utf16[(unsigned char)**fromP]; if (c == 0) { c = (unsigned short) uenc->convert(uenc->userData, *fromP); *fromP += (AS_NORMAL_ENCODING(enc)->type[(unsigned char)**fromP] - (BT_LEAD2 - 2)); } else (*fromP)++; *(*toP)++ = c; } } ENCODING * XmlInitUnknownEncoding(void *mem, int *table, CONVERTER convert, void *userData) { int i; struct unknown_encoding *e = (struct unknown_encoding *)mem; for (i = 0; i < (int)sizeof(struct normal_encoding); i++) ((char *)mem)[i] = ((char *)&latin1_encoding)[i]; for (i = 0; i < 128; i++) if (latin1_encoding.type[i] != BT_OTHER && latin1_encoding.type[i] != BT_NONXML && table[i] != i) return 0; for (i = 0; i < 256; i++) { int c = table[i]; if (c == -1) { e->normal.type[i] = BT_MALFORM; /* This shouldn't really get used. */ e->utf16[i] = 0xFFFF; e->utf8[i][0] = 1; e->utf8[i][1] = 0; } else if (c < 0) { if (c < -4) return 0; e->normal.type[i] = (unsigned char)(BT_LEAD2 - (c + 2)); e->utf8[i][0] = 0; e->utf16[i] = 0; } else if (c < 0x80) { if (latin1_encoding.type[c] != BT_OTHER && latin1_encoding.type[c] != BT_NONXML && c != i) return 0; e->normal.type[i] = latin1_encoding.type[c]; e->utf8[i][0] = 1; e->utf8[i][1] = (char)c; e->utf16[i] = (unsigned short)(c == 0 ? 0xFFFF : c); } else if (checkCharRefNumber(c) < 0) { e->normal.type[i] = BT_NONXML; /* This shouldn't really get used. */ e->utf16[i] = 0xFFFF; e->utf8[i][0] = 1; e->utf8[i][1] = 0; } else { if (c > 0xFFFF) return 0; if (UCS2_GET_NAMING(nmstrtPages, c >> 8, c & 0xff)) e->normal.type[i] = BT_NMSTRT; else if (UCS2_GET_NAMING(namePages, c >> 8, c & 0xff)) e->normal.type[i] = BT_NAME; else e->normal.type[i] = BT_OTHER; e->utf8[i][0] = (char)XmlUtf8Encode(c, e->utf8[i] + 1); e->utf16[i] = (unsigned short)c; } } e->userData = userData; e->convert = convert; if (convert) { e->normal.isName2 = unknown_isName; e->normal.isName3 = unknown_isName; e->normal.isName4 = unknown_isName; e->normal.isNmstrt2 = unknown_isNmstrt; e->normal.isNmstrt3 = unknown_isNmstrt; e->normal.isNmstrt4 = unknown_isNmstrt; e->normal.isInvalid2 = unknown_isInvalid; e->normal.isInvalid3 = unknown_isInvalid; e->normal.isInvalid4 = unknown_isInvalid; } e->normal.enc.utf8Convert = unknown_toUtf8; e->normal.enc.utf16Convert = unknown_toUtf16; return &(e->normal.enc); } /* If this enumeration is changed, getEncodingIndex and encodings must also be changed. */ enum { UNKNOWN_ENC = -1, ISO_8859_1_ENC = 0, US_ASCII_ENC, UTF_8_ENC, UTF_16_ENC, UTF_16BE_ENC, UTF_16LE_ENC, /* must match encodingNames up to here */ NO_ENC }; static const char KW_ISO_8859_1[] = { ASCII_I, ASCII_S, ASCII_O, ASCII_MINUS, ASCII_8, ASCII_8, ASCII_5, ASCII_9, ASCII_MINUS, ASCII_1, '\0' }; static const char KW_US_ASCII[] = { ASCII_U, ASCII_S, ASCII_MINUS, ASCII_A, ASCII_S, ASCII_C, ASCII_I, ASCII_I, '\0' }; static const char KW_UTF_8[] = { ASCII_U, ASCII_T, ASCII_F, ASCII_MINUS, ASCII_8, '\0' }; static const char KW_UTF_16[] = { ASCII_U, ASCII_T, ASCII_F, ASCII_MINUS, ASCII_1, ASCII_6, '\0' }; static const char KW_UTF_16BE[] = { ASCII_U, ASCII_T, ASCII_F, ASCII_MINUS, ASCII_1, ASCII_6, ASCII_B, ASCII_E, '\0' }; static const char KW_UTF_16LE[] = { ASCII_U, ASCII_T, ASCII_F, ASCII_MINUS, ASCII_1, ASCII_6, ASCII_L, ASCII_E, '\0' }; static int FASTCALL getEncodingIndex(const char *name) { static const char *encodingNames[] = { KW_ISO_8859_1, KW_US_ASCII, KW_UTF_8, KW_UTF_16, KW_UTF_16BE, KW_UTF_16LE, }; int i; if (name == NULL) return NO_ENC; for (i = 0; i < (int)(sizeof(encodingNames)/sizeof(encodingNames[0])); i++) if (streqci(name, encodingNames[i])) return i; return UNKNOWN_ENC; } /* For binary compatibility, we store the index of the encoding specified at initialization in the isUtf16 member. */ #define INIT_ENC_INDEX(enc) ((int)(enc)->initEnc.isUtf16) #define SET_INIT_ENC_INDEX(enc, i) ((enc)->initEnc.isUtf16 = (char)i) /* This is what detects the encoding. encodingTable maps from encoding indices to encodings; INIT_ENC_INDEX(enc) is the index of the external (protocol) specified encoding; state is XML_CONTENT_STATE if we're parsing an external text entity, and XML_PROLOG_STATE otherwise. */ static int initScan(const ENCODING **encodingTable, const INIT_ENCODING *enc, int state, const char *ptr, const char *end, const char **nextTokPtr) { const ENCODING **encPtr; if (ptr == end) return XML_TOK_NONE; encPtr = enc->encPtr; if (ptr + 1 == end) { /* only a single byte available for auto-detection */ #ifndef XML_DTD /* FIXME */ /* a well-formed document entity must have more than one byte */ if (state != XML_CONTENT_STATE) return XML_TOK_PARTIAL; #endif /* so we're parsing an external text entity... */ /* if UTF-16 was externally specified, then we need at least 2 bytes */ switch (INIT_ENC_INDEX(enc)) { case UTF_16_ENC: case UTF_16LE_ENC: case UTF_16BE_ENC: return XML_TOK_PARTIAL; } switch ((unsigned char)*ptr) { case 0xFE: case 0xFF: case 0xEF: /* possibly first byte of UTF-8 BOM */ if (INIT_ENC_INDEX(enc) == ISO_8859_1_ENC && state == XML_CONTENT_STATE) break; /* fall through */ case 0x00: case 0x3C: return XML_TOK_PARTIAL; } } else { switch (((unsigned char)ptr[0] << 8) | (unsigned char)ptr[1]) { case 0xFEFF: if (INIT_ENC_INDEX(enc) == ISO_8859_1_ENC && state == XML_CONTENT_STATE) break; *nextTokPtr = ptr + 2; *encPtr = encodingTable[UTF_16BE_ENC]; return XML_TOK_BOM; /* 00 3C is handled in the default case */ case 0x3C00: if ((INIT_ENC_INDEX(enc) == UTF_16BE_ENC || INIT_ENC_INDEX(enc) == UTF_16_ENC) && state == XML_CONTENT_STATE) break; *encPtr = encodingTable[UTF_16LE_ENC]; return XmlTok(*encPtr, state, ptr, end, nextTokPtr); case 0xFFFE: if (INIT_ENC_INDEX(enc) == ISO_8859_1_ENC && state == XML_CONTENT_STATE) break; *nextTokPtr = ptr + 2; *encPtr = encodingTable[UTF_16LE_ENC]; return XML_TOK_BOM; case 0xEFBB: /* Maybe a UTF-8 BOM (EF BB BF) */ /* If there's an explicitly specified (external) encoding of ISO-8859-1 or some flavour of UTF-16 and this is an external text entity, don't look for the BOM, because it might be a legal data. */ if (state == XML_CONTENT_STATE) { int e = INIT_ENC_INDEX(enc); if (e == ISO_8859_1_ENC || e == UTF_16BE_ENC || e == UTF_16LE_ENC || e == UTF_16_ENC) break; } if (ptr + 2 == end) return XML_TOK_PARTIAL; if ((unsigned char)ptr[2] == 0xBF) { *nextTokPtr = ptr + 3; *encPtr = encodingTable[UTF_8_ENC]; return XML_TOK_BOM; } break; default: if (ptr[0] == '\0') { /* 0 isn't a legal data character. Furthermore a document entity can only start with ASCII characters. So the only way this can fail to be big-endian UTF-16 if it it's an external parsed general entity that's labelled as UTF-16LE. */ if (state == XML_CONTENT_STATE && INIT_ENC_INDEX(enc) == UTF_16LE_ENC) break; *encPtr = encodingTable[UTF_16BE_ENC]; return XmlTok(*encPtr, state, ptr, end, nextTokPtr); } else if (ptr[1] == '\0') { /* We could recover here in the case: - parsing an external entity - second byte is 0 - no externally specified encoding - no encoding declaration by assuming UTF-16LE. But we don't, because this would mean when presented just with a single byte, we couldn't reliably determine whether we needed further bytes. */ if (state == XML_CONTENT_STATE) break; *encPtr = encodingTable[UTF_16LE_ENC]; return XmlTok(*encPtr, state, ptr, end, nextTokPtr); } break; } } *encPtr = encodingTable[INIT_ENC_INDEX(enc)]; return XmlTok(*encPtr, state, ptr, end, nextTokPtr); } #define NS(x) x #define ns(x) x #include "xmltok_ns.c" #undef NS #undef ns #ifdef XML_NS #define NS(x) x ## NS #define ns(x) x ## _ns #include "xmltok_ns.c" #undef NS #undef ns ENCODING * XmlInitUnknownEncodingNS(void *mem, int *table, CONVERTER convert, void *userData) { ENCODING *enc = XmlInitUnknownEncoding(mem, table, convert, userData); if (enc) ((struct normal_encoding *)enc)->type[ASCII_COLON] = BT_COLON; return enc; } #endif /* XML_NS */ madman-0.93/expat/xmltok_impl.c0000644000175000001440000012666410053135241016311 0ustar akusers00000000000000/* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd See the file COPYING for copying permission. */ #ifndef IS_INVALID_CHAR #define IS_INVALID_CHAR(enc, ptr, n) (0) #endif #define INVALID_LEAD_CASE(n, ptr, nextTokPtr) \ case BT_LEAD ## n: \ if (end - ptr < n) \ return XML_TOK_PARTIAL_CHAR; \ if (IS_INVALID_CHAR(enc, ptr, n)) { \ *(nextTokPtr) = (ptr); \ return XML_TOK_INVALID; \ } \ ptr += n; \ break; #define INVALID_CASES(ptr, nextTokPtr) \ INVALID_LEAD_CASE(2, ptr, nextTokPtr) \ INVALID_LEAD_CASE(3, ptr, nextTokPtr) \ INVALID_LEAD_CASE(4, ptr, nextTokPtr) \ case BT_NONXML: \ case BT_MALFORM: \ case BT_TRAIL: \ *(nextTokPtr) = (ptr); \ return XML_TOK_INVALID; #define CHECK_NAME_CASE(n, enc, ptr, end, nextTokPtr) \ case BT_LEAD ## n: \ if (end - ptr < n) \ return XML_TOK_PARTIAL_CHAR; \ if (!IS_NAME_CHAR(enc, ptr, n)) { \ *nextTokPtr = ptr; \ return XML_TOK_INVALID; \ } \ ptr += n; \ break; #define CHECK_NAME_CASES(enc, ptr, end, nextTokPtr) \ case BT_NONASCII: \ if (!IS_NAME_CHAR_MINBPC(enc, ptr)) { \ *nextTokPtr = ptr; \ return XML_TOK_INVALID; \ } \ case BT_NMSTRT: \ case BT_HEX: \ case BT_DIGIT: \ case BT_NAME: \ case BT_MINUS: \ ptr += MINBPC(enc); \ break; \ CHECK_NAME_CASE(2, enc, ptr, end, nextTokPtr) \ CHECK_NAME_CASE(3, enc, ptr, end, nextTokPtr) \ CHECK_NAME_CASE(4, enc, ptr, end, nextTokPtr) #define CHECK_NMSTRT_CASE(n, enc, ptr, end, nextTokPtr) \ case BT_LEAD ## n: \ if (end - ptr < n) \ return XML_TOK_PARTIAL_CHAR; \ if (!IS_NMSTRT_CHAR(enc, ptr, n)) { \ *nextTokPtr = ptr; \ return XML_TOK_INVALID; \ } \ ptr += n; \ break; #define CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr) \ case BT_NONASCII: \ if (!IS_NMSTRT_CHAR_MINBPC(enc, ptr)) { \ *nextTokPtr = ptr; \ return XML_TOK_INVALID; \ } \ case BT_NMSTRT: \ case BT_HEX: \ ptr += MINBPC(enc); \ break; \ CHECK_NMSTRT_CASE(2, enc, ptr, end, nextTokPtr) \ CHECK_NMSTRT_CASE(3, enc, ptr, end, nextTokPtr) \ CHECK_NMSTRT_CASE(4, enc, ptr, end, nextTokPtr) #ifndef PREFIX #define PREFIX(ident) ident #endif /* ptr points to character following " */ switch (BYTE_TYPE(enc, ptr + MINBPC(enc))) { case BT_S: case BT_CR: case BT_LF: case BT_PERCNT: *nextTokPtr = ptr; return XML_TOK_INVALID; } /* fall through */ case BT_S: case BT_CR: case BT_LF: *nextTokPtr = ptr; return XML_TOK_DECL_OPEN; case BT_NMSTRT: case BT_HEX: ptr += MINBPC(enc); break; default: *nextTokPtr = ptr; return XML_TOK_INVALID; } } return XML_TOK_PARTIAL; } static int PTRCALL PREFIX(checkPiTarget)(const ENCODING *enc, const char *ptr, const char *end, int *tokPtr) { int upper = 0; *tokPtr = XML_TOK_PI; if (end - ptr != MINBPC(enc)*3) return 1; switch (BYTE_TO_ASCII(enc, ptr)) { case ASCII_x: break; case ASCII_X: upper = 1; break; default: return 1; } ptr += MINBPC(enc); switch (BYTE_TO_ASCII(enc, ptr)) { case ASCII_m: break; case ASCII_M: upper = 1; break; default: return 1; } ptr += MINBPC(enc); switch (BYTE_TO_ASCII(enc, ptr)) { case ASCII_l: break; case ASCII_L: upper = 1; break; default: return 1; } if (upper) return 0; *tokPtr = XML_TOK_XML_DECL; return 1; } /* ptr points to character following " 1) { size_t n = end - ptr; if (n & (MINBPC(enc) - 1)) { n &= ~(MINBPC(enc) - 1); if (n == 0) return XML_TOK_PARTIAL; end = ptr + n; } } switch (BYTE_TYPE(enc, ptr)) { case BT_RSQB: ptr += MINBPC(enc); if (ptr == end) return XML_TOK_PARTIAL; if (!CHAR_MATCHES(enc, ptr, ASCII_RSQB)) break; ptr += MINBPC(enc); if (ptr == end) return XML_TOK_PARTIAL; if (!CHAR_MATCHES(enc, ptr, ASCII_GT)) { ptr -= MINBPC(enc); break; } *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_CDATA_SECT_CLOSE; case BT_CR: ptr += MINBPC(enc); if (ptr == end) return XML_TOK_PARTIAL; if (BYTE_TYPE(enc, ptr) == BT_LF) ptr += MINBPC(enc); *nextTokPtr = ptr; return XML_TOK_DATA_NEWLINE; case BT_LF: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_DATA_NEWLINE; INVALID_CASES(ptr, nextTokPtr) default: ptr += MINBPC(enc); break; } while (ptr != end) { switch (BYTE_TYPE(enc, ptr)) { #define LEAD_CASE(n) \ case BT_LEAD ## n: \ if (end - ptr < n || IS_INVALID_CHAR(enc, ptr, n)) { \ *nextTokPtr = ptr; \ return XML_TOK_DATA_CHARS; \ } \ ptr += n; \ break; LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4) #undef LEAD_CASE case BT_NONXML: case BT_MALFORM: case BT_TRAIL: case BT_CR: case BT_LF: case BT_RSQB: *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; default: ptr += MINBPC(enc); break; } } *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; } /* ptr points to character following " 1) { size_t n = end - ptr; if (n & (MINBPC(enc) - 1)) { n &= ~(MINBPC(enc) - 1); if (n == 0) return XML_TOK_PARTIAL; end = ptr + n; } } switch (BYTE_TYPE(enc, ptr)) { case BT_LT: return PREFIX(scanLt)(enc, ptr + MINBPC(enc), end, nextTokPtr); case BT_AMP: return PREFIX(scanRef)(enc, ptr + MINBPC(enc), end, nextTokPtr); case BT_CR: ptr += MINBPC(enc); if (ptr == end) return XML_TOK_TRAILING_CR; if (BYTE_TYPE(enc, ptr) == BT_LF) ptr += MINBPC(enc); *nextTokPtr = ptr; return XML_TOK_DATA_NEWLINE; case BT_LF: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_DATA_NEWLINE; case BT_RSQB: ptr += MINBPC(enc); if (ptr == end) return XML_TOK_TRAILING_RSQB; if (!CHAR_MATCHES(enc, ptr, ASCII_RSQB)) break; ptr += MINBPC(enc); if (ptr == end) return XML_TOK_TRAILING_RSQB; if (!CHAR_MATCHES(enc, ptr, ASCII_GT)) { ptr -= MINBPC(enc); break; } *nextTokPtr = ptr; return XML_TOK_INVALID; INVALID_CASES(ptr, nextTokPtr) default: ptr += MINBPC(enc); break; } while (ptr != end) { switch (BYTE_TYPE(enc, ptr)) { #define LEAD_CASE(n) \ case BT_LEAD ## n: \ if (end - ptr < n || IS_INVALID_CHAR(enc, ptr, n)) { \ *nextTokPtr = ptr; \ return XML_TOK_DATA_CHARS; \ } \ ptr += n; \ break; LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4) #undef LEAD_CASE case BT_RSQB: if (ptr + MINBPC(enc) != end) { if (!CHAR_MATCHES(enc, ptr + MINBPC(enc), ASCII_RSQB)) { ptr += MINBPC(enc); break; } if (ptr + 2*MINBPC(enc) != end) { if (!CHAR_MATCHES(enc, ptr + 2*MINBPC(enc), ASCII_GT)) { ptr += MINBPC(enc); break; } *nextTokPtr = ptr + 2*MINBPC(enc); return XML_TOK_INVALID; } } /* fall through */ case BT_AMP: case BT_LT: case BT_NONXML: case BT_MALFORM: case BT_TRAIL: case BT_CR: case BT_LF: *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; default: ptr += MINBPC(enc); break; } } *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; } /* ptr points to character following "%" */ static int PTRCALL PREFIX(scanPercent)(const ENCODING *enc, const char *ptr, const char *end, const char **nextTokPtr) { if (ptr == end) return XML_TOK_PARTIAL; switch (BYTE_TYPE(enc, ptr)) { CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr) case BT_S: case BT_LF: case BT_CR: case BT_PERCNT: *nextTokPtr = ptr; return XML_TOK_PERCENT; default: *nextTokPtr = ptr; return XML_TOK_INVALID; } while (ptr != end) { switch (BYTE_TYPE(enc, ptr)) { CHECK_NAME_CASES(enc, ptr, end, nextTokPtr) case BT_SEMI: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_PARAM_ENTITY_REF; default: *nextTokPtr = ptr; return XML_TOK_INVALID; } } return XML_TOK_PARTIAL; } static int PTRCALL PREFIX(scanPoundName)(const ENCODING *enc, const char *ptr, const char *end, const char **nextTokPtr) { if (ptr == end) return XML_TOK_PARTIAL; switch (BYTE_TYPE(enc, ptr)) { CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr) default: *nextTokPtr = ptr; return XML_TOK_INVALID; } while (ptr != end) { switch (BYTE_TYPE(enc, ptr)) { CHECK_NAME_CASES(enc, ptr, end, nextTokPtr) case BT_CR: case BT_LF: case BT_S: case BT_RPAR: case BT_GT: case BT_PERCNT: case BT_VERBAR: *nextTokPtr = ptr; return XML_TOK_POUND_NAME; default: *nextTokPtr = ptr; return XML_TOK_INVALID; } } return -XML_TOK_POUND_NAME; } static int PTRCALL PREFIX(scanLit)(int open, const ENCODING *enc, const char *ptr, const char *end, const char **nextTokPtr) { while (ptr != end) { int t = BYTE_TYPE(enc, ptr); switch (t) { INVALID_CASES(ptr, nextTokPtr) case BT_QUOT: case BT_APOS: ptr += MINBPC(enc); if (t != open) break; if (ptr == end) return -XML_TOK_LITERAL; *nextTokPtr = ptr; switch (BYTE_TYPE(enc, ptr)) { case BT_S: case BT_CR: case BT_LF: case BT_GT: case BT_PERCNT: case BT_LSQB: return XML_TOK_LITERAL; default: return XML_TOK_INVALID; } default: ptr += MINBPC(enc); break; } } return XML_TOK_PARTIAL; } static int PTRCALL PREFIX(prologTok)(const ENCODING *enc, const char *ptr, const char *end, const char **nextTokPtr) { int tok; if (ptr == end) return XML_TOK_NONE; if (MINBPC(enc) > 1) { size_t n = end - ptr; if (n & (MINBPC(enc) - 1)) { n &= ~(MINBPC(enc) - 1); if (n == 0) return XML_TOK_PARTIAL; end = ptr + n; } } switch (BYTE_TYPE(enc, ptr)) { case BT_QUOT: return PREFIX(scanLit)(BT_QUOT, enc, ptr + MINBPC(enc), end, nextTokPtr); case BT_APOS: return PREFIX(scanLit)(BT_APOS, enc, ptr + MINBPC(enc), end, nextTokPtr); case BT_LT: { ptr += MINBPC(enc); if (ptr == end) return XML_TOK_PARTIAL; switch (BYTE_TYPE(enc, ptr)) { case BT_EXCL: return PREFIX(scanDecl)(enc, ptr + MINBPC(enc), end, nextTokPtr); case BT_QUEST: return PREFIX(scanPi)(enc, ptr + MINBPC(enc), end, nextTokPtr); case BT_NMSTRT: case BT_HEX: case BT_NONASCII: case BT_LEAD2: case BT_LEAD3: case BT_LEAD4: *nextTokPtr = ptr - MINBPC(enc); return XML_TOK_INSTANCE_START; } *nextTokPtr = ptr; return XML_TOK_INVALID; } case BT_CR: if (ptr + MINBPC(enc) == end) { *nextTokPtr = end; /* indicate that this might be part of a CR/LF pair */ return -XML_TOK_PROLOG_S; } /* fall through */ case BT_S: case BT_LF: for (;;) { ptr += MINBPC(enc); if (ptr == end) break; switch (BYTE_TYPE(enc, ptr)) { case BT_S: case BT_LF: break; case BT_CR: /* don't split CR/LF pair */ if (ptr + MINBPC(enc) != end) break; /* fall through */ default: *nextTokPtr = ptr; return XML_TOK_PROLOG_S; } } *nextTokPtr = ptr; return XML_TOK_PROLOG_S; case BT_PERCNT: return PREFIX(scanPercent)(enc, ptr + MINBPC(enc), end, nextTokPtr); case BT_COMMA: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_COMMA; case BT_LSQB: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_OPEN_BRACKET; case BT_RSQB: ptr += MINBPC(enc); if (ptr == end) return -XML_TOK_CLOSE_BRACKET; if (CHAR_MATCHES(enc, ptr, ASCII_RSQB)) { if (ptr + MINBPC(enc) == end) return XML_TOK_PARTIAL; if (CHAR_MATCHES(enc, ptr + MINBPC(enc), ASCII_GT)) { *nextTokPtr = ptr + 2*MINBPC(enc); return XML_TOK_COND_SECT_CLOSE; } } *nextTokPtr = ptr; return XML_TOK_CLOSE_BRACKET; case BT_LPAR: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_OPEN_PAREN; case BT_RPAR: ptr += MINBPC(enc); if (ptr == end) return -XML_TOK_CLOSE_PAREN; switch (BYTE_TYPE(enc, ptr)) { case BT_AST: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_CLOSE_PAREN_ASTERISK; case BT_QUEST: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_CLOSE_PAREN_QUESTION; case BT_PLUS: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_CLOSE_PAREN_PLUS; case BT_CR: case BT_LF: case BT_S: case BT_GT: case BT_COMMA: case BT_VERBAR: case BT_RPAR: *nextTokPtr = ptr; return XML_TOK_CLOSE_PAREN; } *nextTokPtr = ptr; return XML_TOK_INVALID; case BT_VERBAR: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_OR; case BT_GT: *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_DECL_CLOSE; case BT_NUM: return PREFIX(scanPoundName)(enc, ptr + MINBPC(enc), end, nextTokPtr); #define LEAD_CASE(n) \ case BT_LEAD ## n: \ if (end - ptr < n) \ return XML_TOK_PARTIAL_CHAR; \ if (IS_NMSTRT_CHAR(enc, ptr, n)) { \ ptr += n; \ tok = XML_TOK_NAME; \ break; \ } \ if (IS_NAME_CHAR(enc, ptr, n)) { \ ptr += n; \ tok = XML_TOK_NMTOKEN; \ break; \ } \ *nextTokPtr = ptr; \ return XML_TOK_INVALID; LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4) #undef LEAD_CASE case BT_NMSTRT: case BT_HEX: tok = XML_TOK_NAME; ptr += MINBPC(enc); break; case BT_DIGIT: case BT_NAME: case BT_MINUS: #ifdef XML_NS case BT_COLON: #endif tok = XML_TOK_NMTOKEN; ptr += MINBPC(enc); break; case BT_NONASCII: if (IS_NMSTRT_CHAR_MINBPC(enc, ptr)) { ptr += MINBPC(enc); tok = XML_TOK_NAME; break; } if (IS_NAME_CHAR_MINBPC(enc, ptr)) { ptr += MINBPC(enc); tok = XML_TOK_NMTOKEN; break; } /* fall through */ default: *nextTokPtr = ptr; return XML_TOK_INVALID; } while (ptr != end) { switch (BYTE_TYPE(enc, ptr)) { CHECK_NAME_CASES(enc, ptr, end, nextTokPtr) case BT_GT: case BT_RPAR: case BT_COMMA: case BT_VERBAR: case BT_LSQB: case BT_PERCNT: case BT_S: case BT_CR: case BT_LF: *nextTokPtr = ptr; return tok; #ifdef XML_NS case BT_COLON: ptr += MINBPC(enc); switch (tok) { case XML_TOK_NAME: if (ptr == end) return XML_TOK_PARTIAL; tok = XML_TOK_PREFIXED_NAME; switch (BYTE_TYPE(enc, ptr)) { CHECK_NAME_CASES(enc, ptr, end, nextTokPtr) default: tok = XML_TOK_NMTOKEN; break; } break; case XML_TOK_PREFIXED_NAME: tok = XML_TOK_NMTOKEN; break; } break; #endif case BT_PLUS: if (tok == XML_TOK_NMTOKEN) { *nextTokPtr = ptr; return XML_TOK_INVALID; } *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_NAME_PLUS; case BT_AST: if (tok == XML_TOK_NMTOKEN) { *nextTokPtr = ptr; return XML_TOK_INVALID; } *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_NAME_ASTERISK; case BT_QUEST: if (tok == XML_TOK_NMTOKEN) { *nextTokPtr = ptr; return XML_TOK_INVALID; } *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_NAME_QUESTION; default: *nextTokPtr = ptr; return XML_TOK_INVALID; } } return -tok; } static int PTRCALL PREFIX(attributeValueTok)(const ENCODING *enc, const char *ptr, const char *end, const char **nextTokPtr) { const char *start; if (ptr == end) return XML_TOK_NONE; start = ptr; while (ptr != end) { switch (BYTE_TYPE(enc, ptr)) { #define LEAD_CASE(n) \ case BT_LEAD ## n: ptr += n; break; LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4) #undef LEAD_CASE case BT_AMP: if (ptr == start) return PREFIX(scanRef)(enc, ptr + MINBPC(enc), end, nextTokPtr); *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; case BT_LT: /* this is for inside entity references */ *nextTokPtr = ptr; return XML_TOK_INVALID; case BT_LF: if (ptr == start) { *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_DATA_NEWLINE; } *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; case BT_CR: if (ptr == start) { ptr += MINBPC(enc); if (ptr == end) return XML_TOK_TRAILING_CR; if (BYTE_TYPE(enc, ptr) == BT_LF) ptr += MINBPC(enc); *nextTokPtr = ptr; return XML_TOK_DATA_NEWLINE; } *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; case BT_S: if (ptr == start) { *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_ATTRIBUTE_VALUE_S; } *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; default: ptr += MINBPC(enc); break; } } *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; } static int PTRCALL PREFIX(entityValueTok)(const ENCODING *enc, const char *ptr, const char *end, const char **nextTokPtr) { const char *start; if (ptr == end) return XML_TOK_NONE; start = ptr; while (ptr != end) { switch (BYTE_TYPE(enc, ptr)) { #define LEAD_CASE(n) \ case BT_LEAD ## n: ptr += n; break; LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4) #undef LEAD_CASE case BT_AMP: if (ptr == start) return PREFIX(scanRef)(enc, ptr + MINBPC(enc), end, nextTokPtr); *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; case BT_PERCNT: if (ptr == start) { int tok = PREFIX(scanPercent)(enc, ptr + MINBPC(enc), end, nextTokPtr); return (tok == XML_TOK_PERCENT) ? XML_TOK_INVALID : tok; } *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; case BT_LF: if (ptr == start) { *nextTokPtr = ptr + MINBPC(enc); return XML_TOK_DATA_NEWLINE; } *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; case BT_CR: if (ptr == start) { ptr += MINBPC(enc); if (ptr == end) return XML_TOK_TRAILING_CR; if (BYTE_TYPE(enc, ptr) == BT_LF) ptr += MINBPC(enc); *nextTokPtr = ptr; return XML_TOK_DATA_NEWLINE; } *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; default: ptr += MINBPC(enc); break; } } *nextTokPtr = ptr; return XML_TOK_DATA_CHARS; } #ifdef XML_DTD static int PTRCALL PREFIX(ignoreSectionTok)(const ENCODING *enc, const char *ptr, const char *end, const char **nextTokPtr) { int level = 0; if (MINBPC(enc) > 1) { size_t n = end - ptr; if (n & (MINBPC(enc) - 1)) { n &= ~(MINBPC(enc) - 1); end = ptr + n; } } while (ptr != end) { switch (BYTE_TYPE(enc, ptr)) { INVALID_CASES(ptr, nextTokPtr) case BT_LT: if ((ptr += MINBPC(enc)) == end) return XML_TOK_PARTIAL; if (CHAR_MATCHES(enc, ptr, ASCII_EXCL)) { if ((ptr += MINBPC(enc)) == end) return XML_TOK_PARTIAL; if (CHAR_MATCHES(enc, ptr, ASCII_LSQB)) { ++level; ptr += MINBPC(enc); } } break; case BT_RSQB: if ((ptr += MINBPC(enc)) == end) return XML_TOK_PARTIAL; if (CHAR_MATCHES(enc, ptr, ASCII_RSQB)) { if ((ptr += MINBPC(enc)) == end) return XML_TOK_PARTIAL; if (CHAR_MATCHES(enc, ptr, ASCII_GT)) { ptr += MINBPC(enc); if (level == 0) { *nextTokPtr = ptr; return XML_TOK_IGNORE_SECT; } --level; } } break; default: ptr += MINBPC(enc); break; } } return XML_TOK_PARTIAL; } #endif /* XML_DTD */ static int PTRCALL PREFIX(isPublicId)(const ENCODING *enc, const char *ptr, const char *end, const char **badPtr) { ptr += MINBPC(enc); end -= MINBPC(enc); for (; ptr != end; ptr += MINBPC(enc)) { switch (BYTE_TYPE(enc, ptr)) { case BT_DIGIT: case BT_HEX: case BT_MINUS: case BT_APOS: case BT_LPAR: case BT_RPAR: case BT_PLUS: case BT_COMMA: case BT_SOL: case BT_EQUALS: case BT_QUEST: case BT_CR: case BT_LF: case BT_SEMI: case BT_EXCL: case BT_AST: case BT_PERCNT: case BT_NUM: #ifdef XML_NS case BT_COLON: #endif break; case BT_S: if (CHAR_MATCHES(enc, ptr, ASCII_TAB)) { *badPtr = ptr; return 0; } break; case BT_NAME: case BT_NMSTRT: if (!(BYTE_TO_ASCII(enc, ptr) & ~0x7f)) break; default: switch (BYTE_TO_ASCII(enc, ptr)) { case 0x24: /* $ */ case 0x40: /* @ */ break; default: *badPtr = ptr; return 0; } break; } } return 1; } /* This must only be called for a well-formed start-tag or empty element tag. Returns the number of attributes. Pointers to the first attsMax attributes are stored in atts. */ static int PTRCALL PREFIX(getAtts)(const ENCODING *enc, const char *ptr, int attsMax, ATTRIBUTE *atts) { enum { other, inName, inValue } state = inName; int nAtts = 0; int open = 0; /* defined when state == inValue; initialization just to shut up compilers */ for (ptr += MINBPC(enc);; ptr += MINBPC(enc)) { switch (BYTE_TYPE(enc, ptr)) { #define START_NAME \ if (state == other) { \ if (nAtts < attsMax) { \ atts[nAtts].name = ptr; \ atts[nAtts].normalized = 1; \ } \ state = inName; \ } #define LEAD_CASE(n) \ case BT_LEAD ## n: START_NAME ptr += (n - MINBPC(enc)); break; LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4) #undef LEAD_CASE case BT_NONASCII: case BT_NMSTRT: case BT_HEX: START_NAME break; #undef START_NAME case BT_QUOT: if (state != inValue) { if (nAtts < attsMax) atts[nAtts].valuePtr = ptr + MINBPC(enc); state = inValue; open = BT_QUOT; } else if (open == BT_QUOT) { state = other; if (nAtts < attsMax) atts[nAtts].valueEnd = ptr; nAtts++; } break; case BT_APOS: if (state != inValue) { if (nAtts < attsMax) atts[nAtts].valuePtr = ptr + MINBPC(enc); state = inValue; open = BT_APOS; } else if (open == BT_APOS) { state = other; if (nAtts < attsMax) atts[nAtts].valueEnd = ptr; nAtts++; } break; case BT_AMP: if (nAtts < attsMax) atts[nAtts].normalized = 0; break; case BT_S: if (state == inName) state = other; else if (state == inValue && nAtts < attsMax && atts[nAtts].normalized && (ptr == atts[nAtts].valuePtr || BYTE_TO_ASCII(enc, ptr) != ASCII_SPACE || BYTE_TO_ASCII(enc, ptr + MINBPC(enc)) == ASCII_SPACE || BYTE_TYPE(enc, ptr + MINBPC(enc)) == open)) atts[nAtts].normalized = 0; break; case BT_CR: case BT_LF: /* This case ensures that the first attribute name is counted Apart from that we could just change state on the quote. */ if (state == inName) state = other; else if (state == inValue && nAtts < attsMax) atts[nAtts].normalized = 0; break; case BT_GT: case BT_SOL: if (state != inValue) return nAtts; break; default: break; } } /* not reached */ } static int PTRFASTCALL PREFIX(charRefNumber)(const ENCODING *enc, const char *ptr) { int result = 0; /* skip &# */ ptr += 2*MINBPC(enc); if (CHAR_MATCHES(enc, ptr, ASCII_x)) { for (ptr += MINBPC(enc); !CHAR_MATCHES(enc, ptr, ASCII_SEMI); ptr += MINBPC(enc)) { int c = BYTE_TO_ASCII(enc, ptr); switch (c) { case ASCII_0: case ASCII_1: case ASCII_2: case ASCII_3: case ASCII_4: case ASCII_5: case ASCII_6: case ASCII_7: case ASCII_8: case ASCII_9: result <<= 4; result |= (c - ASCII_0); break; case ASCII_A: case ASCII_B: case ASCII_C: case ASCII_D: case ASCII_E: case ASCII_F: result <<= 4; result += 10 + (c - ASCII_A); break; case ASCII_a: case ASCII_b: case ASCII_c: case ASCII_d: case ASCII_e: case ASCII_f: result <<= 4; result += 10 + (c - ASCII_a); break; } if (result >= 0x110000) return -1; } } else { for (; !CHAR_MATCHES(enc, ptr, ASCII_SEMI); ptr += MINBPC(enc)) { int c = BYTE_TO_ASCII(enc, ptr); result *= 10; result += (c - ASCII_0); if (result >= 0x110000) return -1; } } return checkCharRefNumber(result); } static int PTRCALL PREFIX(predefinedEntityName)(const ENCODING *enc, const char *ptr, const char *end) { switch ((end - ptr)/MINBPC(enc)) { case 2: if (CHAR_MATCHES(enc, ptr + MINBPC(enc), ASCII_t)) { switch (BYTE_TO_ASCII(enc, ptr)) { case ASCII_l: return ASCII_LT; case ASCII_g: return ASCII_GT; } } break; case 3: if (CHAR_MATCHES(enc, ptr, ASCII_a)) { ptr += MINBPC(enc); if (CHAR_MATCHES(enc, ptr, ASCII_m)) { ptr += MINBPC(enc); if (CHAR_MATCHES(enc, ptr, ASCII_p)) return ASCII_AMP; } } break; case 4: switch (BYTE_TO_ASCII(enc, ptr)) { case ASCII_q: ptr += MINBPC(enc); if (CHAR_MATCHES(enc, ptr, ASCII_u)) { ptr += MINBPC(enc); if (CHAR_MATCHES(enc, ptr, ASCII_o)) { ptr += MINBPC(enc); if (CHAR_MATCHES(enc, ptr, ASCII_t)) return ASCII_QUOT; } } break; case ASCII_a: ptr += MINBPC(enc); if (CHAR_MATCHES(enc, ptr, ASCII_p)) { ptr += MINBPC(enc); if (CHAR_MATCHES(enc, ptr, ASCII_o)) { ptr += MINBPC(enc); if (CHAR_MATCHES(enc, ptr, ASCII_s)) return ASCII_APOS; } } break; } } return 0; } static int PTRCALL PREFIX(sameName)(const ENCODING *enc, const char *ptr1, const char *ptr2) { for (;;) { switch (BYTE_TYPE(enc, ptr1)) { #define LEAD_CASE(n) \ case BT_LEAD ## n: \ if (*ptr1++ != *ptr2++) \ return 0; LEAD_CASE(4) LEAD_CASE(3) LEAD_CASE(2) #undef LEAD_CASE /* fall through */ if (*ptr1++ != *ptr2++) return 0; break; case BT_NONASCII: case BT_NMSTRT: #ifdef XML_NS case BT_COLON: #endif case BT_HEX: case BT_DIGIT: case BT_NAME: case BT_MINUS: if (*ptr2++ != *ptr1++) return 0; if (MINBPC(enc) > 1) { if (*ptr2++ != *ptr1++) return 0; if (MINBPC(enc) > 2) { if (*ptr2++ != *ptr1++) return 0; if (MINBPC(enc) > 3) { if (*ptr2++ != *ptr1++) return 0; } } } break; default: if (MINBPC(enc) == 1 && *ptr1 == *ptr2) return 1; switch (BYTE_TYPE(enc, ptr2)) { case BT_LEAD2: case BT_LEAD3: case BT_LEAD4: case BT_NONASCII: case BT_NMSTRT: #ifdef XML_NS case BT_COLON: #endif case BT_HEX: case BT_DIGIT: case BT_NAME: case BT_MINUS: return 0; default: return 1; } } } /* not reached */ } static int PTRCALL PREFIX(nameMatchesAscii)(const ENCODING *enc, const char *ptr1, const char *end1, const char *ptr2) { for (; *ptr2; ptr1 += MINBPC(enc), ptr2++) { if (ptr1 == end1) return 0; if (!CHAR_MATCHES(enc, ptr1, *ptr2)) return 0; } return ptr1 == end1; } static int PTRFASTCALL PREFIX(nameLength)(const ENCODING *enc, const char *ptr) { const char *start = ptr; for (;;) { switch (BYTE_TYPE(enc, ptr)) { #define LEAD_CASE(n) \ case BT_LEAD ## n: ptr += n; break; LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4) #undef LEAD_CASE case BT_NONASCII: case BT_NMSTRT: #ifdef XML_NS case BT_COLON: #endif case BT_HEX: case BT_DIGIT: case BT_NAME: case BT_MINUS: ptr += MINBPC(enc); break; default: return ptr - start; } } } static const char * PTRFASTCALL PREFIX(skipS)(const ENCODING *enc, const char *ptr) { for (;;) { switch (BYTE_TYPE(enc, ptr)) { case BT_LF: case BT_CR: case BT_S: ptr += MINBPC(enc); break; default: return ptr; } } } static void PTRCALL PREFIX(updatePosition)(const ENCODING *enc, const char *ptr, const char *end, POSITION *pos) { while (ptr != end) { switch (BYTE_TYPE(enc, ptr)) { #define LEAD_CASE(n) \ case BT_LEAD ## n: \ ptr += n; \ break; LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4) #undef LEAD_CASE case BT_LF: pos->columnNumber = (unsigned)-1; pos->lineNumber++; ptr += MINBPC(enc); break; case BT_CR: pos->lineNumber++; ptr += MINBPC(enc); if (ptr != end && BYTE_TYPE(enc, ptr) == BT_LF) ptr += MINBPC(enc); pos->columnNumber = (unsigned)-1; break; default: ptr += MINBPC(enc); break; } pos->columnNumber++; } } #undef DO_LEAD_CASE #undef MULTIBYTE_CASES #undef INVALID_CASES #undef CHECK_NAME_CASE #undef CHECK_NAME_CASES #undef CHECK_NMSTRT_CASE #undef CHECK_NMSTRT_CASES madman-0.93/expat/xmltok_ns.c0000644000175000001440000000557710053135241015767 0ustar akusers00000000000000const ENCODING * NS(XmlGetUtf8InternalEncoding)(void) { return &ns(internal_utf8_encoding).enc; } const ENCODING * NS(XmlGetUtf16InternalEncoding)(void) { #if BYTEORDER == 1234 return &ns(internal_little2_encoding).enc; #elif BYTEORDER == 4321 return &ns(internal_big2_encoding).enc; #else const short n = 1; return (*(const char *)&n ? &ns(internal_little2_encoding).enc : &ns(internal_big2_encoding).enc); #endif } static const ENCODING *NS(encodings)[] = { &ns(latin1_encoding).enc, &ns(ascii_encoding).enc, &ns(utf8_encoding).enc, &ns(big2_encoding).enc, &ns(big2_encoding).enc, &ns(little2_encoding).enc, &ns(utf8_encoding).enc /* NO_ENC */ }; static int PTRCALL NS(initScanProlog)(const ENCODING *enc, const char *ptr, const char *end, const char **nextTokPtr) { return initScan(NS(encodings), (const INIT_ENCODING *)enc, XML_PROLOG_STATE, ptr, end, nextTokPtr); } static int PTRCALL NS(initScanContent)(const ENCODING *enc, const char *ptr, const char *end, const char **nextTokPtr) { return initScan(NS(encodings), (const INIT_ENCODING *)enc, XML_CONTENT_STATE, ptr, end, nextTokPtr); } int NS(XmlInitEncoding)(INIT_ENCODING *p, const ENCODING **encPtr, const char *name) { int i = getEncodingIndex(name); if (i == UNKNOWN_ENC) return 0; SET_INIT_ENC_INDEX(p, i); p->initEnc.scanners[XML_PROLOG_STATE] = NS(initScanProlog); p->initEnc.scanners[XML_CONTENT_STATE] = NS(initScanContent); p->initEnc.updatePosition = initUpdatePosition; p->encPtr = encPtr; *encPtr = &(p->initEnc); return 1; } static const ENCODING * NS(findEncoding)(const ENCODING *enc, const char *ptr, const char *end) { #define ENCODING_MAX 128 char buf[ENCODING_MAX]; char *p = buf; int i; XmlUtf8Convert(enc, &ptr, end, &p, p + ENCODING_MAX - 1); if (ptr != end) return 0; *p = 0; if (streqci(buf, KW_UTF_16) && enc->minBytesPerChar == 2) return enc; i = getEncodingIndex(buf); if (i == UNKNOWN_ENC) return 0; return NS(encodings)[i]; } int NS(XmlParseXmlDecl)(int isGeneralTextEntity, const ENCODING *enc, const char *ptr, const char *end, const char **badPtr, const char **versionPtr, const char **versionEndPtr, const char **encodingName, const ENCODING **encoding, int *standalone) { return doParseXmlDecl(NS(findEncoding), isGeneralTextEntity, enc, ptr, end, badPtr, versionPtr, versionEndPtr, encodingName, encoding, standalone); } madman-0.93/expat/SConscript0000644000175000001440000000025110053135242015600 0ustar akusers00000000000000Import( "env" ) myenv = env.Copy() myenv[ 'CPPPATH' ].append( '..' ) myenv.StaticLibrary( target = "madmanexpat", source = [ "xmlparse.c", "xmlrole.c", "xmltok.c" ] ) madman-0.93/utility/0000755000175000001440000000000010053135242014152 5ustar akusers00000000000000madman-0.93/utility/base.h0000644000175000001440000000674710053135241015252 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 BASE #define BASE #include #include #include #include #include #include #include #include #if __GNUC__ >= 3 #include #include #else #include #include #endif using namespace std; #if __GNUC__ >= 3 using __gnu_cxx::hash_map; using __gnu_cxx::hash_set; #endif class tSong; typedef int tUniqueId; typedef unsigned tIndex; typedef string tFilename; typedef vector tDirectoryList; typedef vector tSongList; typedef vector tConstSongList; typedef vector tUniqueIdList; typedef hash_set tUniqueIdSet; #define FOREACH(VAR,LIST,LISTTYPE) \ for (LISTTYPE::iterator VAR = (LIST).begin(),last = (LIST).end();VAR != last;VAR++) #define FOREACH_CONST(VAR,LIST,LISTTYPE) \ for (LISTTYPE::const_iterator VAR = (LIST).begin(),last = (LIST).end();VAR != last;VAR++) #define XSTRINGIFY(ARG) #ARG #define STRINGIFY(ARG) XSTRINGIFY(ARG) class tProgress; bool hasAttribute(const char *name, const char **attributes); const char *lookupAttributeUtf8(const char *name, const char **attributes); QString lookupAttribute(const char *name, const char **attributes); string QString2string(QString const &str); QString string2QString(string const &str); QString wstring2QString(const wchar_t *str); vector QStringList2QStringvector(const QStringList &strlist); QStringList QStringvector2QStringList(const vector &strlist); vector QStringList2stringvector(const QStringList &strlist); QStringList stringvector2QStringList(const vector &strlist); ostream &operator <<(ostream &ostr, QString const &str); QString quoteString(const QString &victim); void split(const QString &sep, const QString &str, vector &result); QString join(const vector &strlist, const QString &sep = QString(";")); void enumerateFiles(const string &directory, vector &result, tProgress *prog = NULL); size_t getMaxBase64DecodedSize(size_t encoded); size_t decodeBase64(unsigned char *data, string const &base64); void encodeBase64(string &base64, unsigned char const *data, size_t size); string encodeBase64(const string &src); string decodeBase64(const string &src); class tRuntimeError : public runtime_error { public: tRuntimeError(const QString &err) : runtime_error(string(err.utf8())) { } }; class hash_QString { public: unsigned long operator() (QString const &str) const; }; class hash_string { public: unsigned long operator() (string const &str) const; }; class tProfiler { QTime Time; QString Name; public: tProfiler(const QString &name = ""); ~tProfiler(); }; #endif madman-0.93/utility/mp3tech.h0000644000175000001440000000557710053135241015703 0ustar akusers00000000000000/* mp3tech.h - Headers for mp3tech.c Copyright (C) 2000-2001 Cedric Tefft 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., 675 Mass Ave, Cambridge, MA 02139, USA. *************************************************************************** This file is based in part on: * MP3Info 0.5 by Ricardo Cerqueira * MP3Stat 0.9 by Ed Sweetman and Johannes Overmann */ #ifdef __cplusplus extern "C" { #endif #include #include #include #include /* MIN_CONSEC_GOOD_FRAMES defines how many consecutive valid MP3 frames we need to see before we decide we are looking at a real MP3 file */ #define MIN_CONSEC_GOOD_FRAMES 4 #define FRAME_HEADER_SIZE 4 #define MIN_FRAME_SIZE 21 #define NUM_SAMPLES 4 #define TEXT_FIELD_LEN 30 #define INT_FIELD_LEN 4 enum VBR_REPORT { VBR_VARIABLE, VBR_AVERAGE, VBR_MEDIAN }; enum SCANTYPE { SCAN_NONE, SCAN_QUICK, SCAN_FULL }; typedef struct { unsigned long sync; unsigned int version; unsigned int layer; unsigned int crc; unsigned int bitrate; unsigned int freq; unsigned int padding; unsigned int extension; unsigned int mode; unsigned int mode_extension; unsigned int copyright; unsigned int original; unsigned int emphasis; } mp3header; typedef struct { char title[31]; char artist[31]; char album[31]; char year[5]; char comment[31]; unsigned char track[1]; unsigned char genre[1]; } id3tag; typedef struct { char *filename; FILE *file; off_t datasize; int header_isvalid; mp3header header; int id3_isvalid; id3tag id3; int vbr; float vbr_average; int seconds; int frames; int badframes; } mp3info; int get_header(FILE *file,mp3header *header); int frame_length(mp3header *header); int header_layer(mp3header *h); int header_bitrate(mp3header *h); int sameConstant(mp3header *h1, mp3header *h2); int get_mp3_info(mp3info *mp3,int scantype, int fullscan_vbr); int get_id3(mp3info *mp3); char *pad(char *string, int length); char *unpad(char *string); int write_tag(mp3info *mp3); int header_frequency(mp3header *h); char *header_emphasis(mp3header *h); char *header_mode(mp3header *h); int get_first_header(mp3info *mp3,long startpos); int get_next_header(mp3info *mp3); #ifdef __cplusplus } #endif madman-0.93/utility/mt_random.h0000644000175000001440000000536110053135241016307 0ustar akusers00000000000000/* A C++-program for MT19937: Real number version (1998/4/6) */ /* genrand() generates one pseudorandom real number (double) */ /* which is uniformly distributed on [0,1]-interval, for each */ /* call. sgenrand(seed) set initial values to the working area */ /* of 624 words. Before genrand(), sgenrand(seed) must be */ /* called once. (seed is any 32-bit integer except for 0). */ /* Integer generator is obtained by modifying two lines. */ /* Coded by Takuji Nishimura, considering the suggestions by */ /* Topher Cooper and Marc Rieffel in July-Aug. 1997. */ /* This library is free software; you can redistribute it and/or */ /* modify it under the terms of the GNU Library 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 Library General Public License for more details. */ /* You should have received a copy of the GNU Library General */ /* Public License along with this library; if not, write to the */ /* Free Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA */ /* 02111-1307 USA */ /* Copyright (C) 1997 Makoto Matsumoto and Takuji Nishimura. */ /* When you use this, send an email to: matumoto@math.keio.ac.jp */ /* with an appropriate reference to your work. */ /* REFERENCE */ /* M. Matsumoto and T. Nishimura, */ /* "Mersenne Twister: A 623-Dimensionally Equidistributed Uniform */ /* Pseudo-Random Number Generator", */ /* ACM Transactions on Modeling and Computer Simulation, */ /* Vol. 8, No. 1, January 1998, pp 3--30. */ /* Period parameters */ #ifndef mtRand_N #define mtRand_N 624 #ifndef mtRand_CC extern unsigned short mtRand_xsubi[3]; #endif class mtRand { /* initializing the array with a NONZERO seed */ public: void sgenrand(unsigned long seed); mtRand(unsigned long seed) { if (seed) { sgenrand(seed); } else { sgenrand((unsigned long)nrand48(mtRand_xsubi)); } } mtRand(void) { sgenrand((unsigned long)nrand48(mtRand_xsubi)); } double gendrand(); unsigned long genlrand(); protected: unsigned long mt[mtRand_N]; /* the array for the state vector */ int mti; /* mti==N+1 means mt[N] is not initialized */ }; #endif madman-0.93/utility/noncopyable.h0000644000175000001440000000226210053135241016635 0ustar akusers00000000000000/* -*- C++ -*- * * noncopyable.h Copyright 2002 Shawn Willden * * 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 Noncopyable_h #define Noncopyable_h /** * Derive your class from Noncopyable in order to make it noncopyable. */ class tNoncopyable { public: // Silence gcc warning. tNoncopyable() { } private: // These methods are private and unimplemented, to prevent copying tNoncopyable(const tNoncopyable&); void operator=(const tNoncopyable&); }; #endif // Noncopyable_h madman-0.93/utility/player.h0000644000175000001440000000532210053135241015620 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 HEADER_SEEN_PLAYER_H #define HEADER_SEEN_PLAYER_H #include "utility/base.h" class tPlayer : public QObject { Q_OBJECT public: virtual ~tPlayer(); public slots: virtual QString name() = 0; virtual void playNow(tSongList const &songlist) = 0; virtual void playNext(tSongList const &songlist) = 0; virtual void playEventually(tSongList const &songlist) = 0; virtual void setPlayList(tSongList const &songlist) = 0; virtual tFilename currentFilename() = 0; virtual QString currentTitle() = 0; virtual void getPlayList(vector &songs) = 0; virtual void clearPlaylist() = 0; virtual bool isPlaying() = 0; virtual bool isPaused() = 0; virtual float currentTime() = 0; virtual float totalTime() = 0; virtual void play() = 0; virtual void stop() = 0; virtual void pause() = 0; virtual void skipForward() = 0; virtual void skipBack() = 0; virtual void skipToSeconds(float seconds) = 0; void skipTo(float percentage); signals: void currentSongChanged(); void stateChanged(); }; class tPlayerFacade : public tPlayer { Q_OBJECT auto_ptr Backend; public slots: void setBackend(tPlayer *backend); QString name(); void playNow(tSongList const &songlist); void playNext(tSongList const &songlist); void playEventually(tSongList const &songlist); void setPlayList(tSongList const &songlist); tFilename currentFilename(); QString currentTitle(); void getPlayList(vector &songs); void clearPlaylist(); bool isPlaying(); bool isPaused(); float currentTime(); float totalTime(); void play(); void stop(); void pause(); void skipForward(); void skipBack(); void skipToSeconds(float seconds); protected slots: void slotCurrentSongChanged(); void slotStateChanged(); }; void listPlayers(vector &players); tPlayer *createPlayer(QString const &name); #endif madman-0.93/utility/player_xmms.h0000644000175000001440000000444210053135241016666 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 HEADER_SEEN_PLAYER_XMMS_H #define HEADER_SEEN_PLAYER_XMMS_H #include #include #include "utility/player.h" class tXMMSPlayer : public tPlayer { Q_OBJECT int Session; bool PreviousPaused,PreviousPlaying; bool CurrentSongValid; tFilename CurrentSongFilename; QTimer Timer; public: tXMMSPlayer(); void ensureRunning(); QString name() { return "XMMS"; } void playNow(tSongList const &songlist); void playNext(tSongList const &songlist); void playEventually(tSongList const &songlist); void setPlayList(tSongList const &songlist); void getPlayList(vector &songs); void clearPlaylist() { xmms_remote_playlist_clear(Session); } tFilename currentFilename(); QString currentTitle(); bool isPlaying() { return xmms_remote_is_playing(Session); } bool isPaused() { return xmms_remote_is_paused(Session); } float currentTime(); float totalTime(); void play() { xmms_remote_play(Session); timer(); } void stop() { xmms_remote_stop(Session); timer(); } void pause() { if (!isPaused()) { xmms_remote_pause(Session); timer(); } } void skipForward() { xmms_remote_playlist_next(Session); } void skipBack() { xmms_remote_playlist_prev(Session); } void skipToSeconds(float seconds); private slots: void timer(); bool haveValidPlaylistPosition(); }; #endif madman-0.93/utility/plugin.h0000644000175000001440000000250610053135241015623 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 HEADER_SEEN_PLUGIN_H #define HEADER_SEEN_PLUGIN_H #include "base.h" class QSettings; class tPlugin { public: QString Filename; QString Name,Description; QString Arguments; QString MenuString; QString KeyboardShortcut; bool Confirm; bool RescanAfter; tPlugin(); bool gatherInfo(); void configure (QSettings &settings); void run(QSettings &settings, const tSongList &songs); }; typedef vector tPluginList; void enumeratePlugins(const tDirectoryList &dir_list, tPluginList &plugin_list); #endif madman-0.93/utility/prefs.h0000644000175000001440000000376110053135241015450 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 HEADER_SEEN_PREFS_H #define HEADER_SEEN_PREFS_H #include #include "utility/base.h" #include "utility/player.h" class tMainWindow; class QSettings; struct tAutoDJScoringRule { QString Comment; QString Criterion; static const int ScorePlayNever = -10; static const int ScoreMinimum = -9; static const int ScoreMaximum = 30; int ScoreAdjustment; }; typedef vector tAutoDJScoringRuleList; struct tAutoDJPreferences { tAutoDJScoringRuleList ScoringRuleList; void resetToDefault(); }; struct tPreferences { bool RememberGeometry; bool ScanAtStartup; bool CollectHistory; bool EnableSystemTrayIcon; bool MinimizeToSystemTray; bool EnablePassivePopupSongAnnouncements; int BackupCount; tPlayerFacade Player; tDirectoryList PluginDirectories; bool HttpDaemonEnabled; int HttpDaemonPort; bool HttpDownloadsEnabled; bool HttpScriptingEnabled; bool HttpWriteScriptingEnabled; bool HttpLocalPlayEnabled; bool HttpBrowsingEnabled; bool HttpRestrictToLocalhost; QString TrayTooltipFormat, PassivePopupFormat; tAutoDJPreferences AutoDJPreferences; void save(QSettings &settings); void load(QSettings &settings); void setPlayer(tPlayer *newplayer); }; #endif madman-0.93/utility/progress.h0000644000175000001440000000233410053135241016170 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 PROGRESS_H_SEEN #define PROGRESS_H_SEEN #include "utility/base.h" class tProgress { public: virtual ~tProgress() { } virtual bool wasCancelled() { return false; } virtual void cancel() { } virtual void processEvents() { } virtual int progress() { return 0; } virtual void setProgress(int p) { } virtual void setTotalSteps(int p) { } virtual void setWhat(const QString &what) { } }; #endif madman-0.93/utility/refcnt_ptr.h0000644000175000001440000001454210053135241016476 0ustar akusers00000000000000/* -*- C++ -*- * * refcnt_ptr.h Copyright 2002 Shawn Willden * * 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 refcnt_ptr_h #define refcnt_ptr_h #include #include /** * refcnt_ptr implements a reference-counting smart pointer class. * * In general, refcnt_ptrs do the Right Thing. You can use them as * though they were pointers, copy them, assign them, whatever, and * the object they point to will continue to live as long as there is * at least one refcnt_ptr pointing at it. There are some caveats, * some obvious some less obvious. They are: * * 1. Don't create multiple refcnt_ptr objects from the same raw * pointer. Each one of them will delete it. The best usage is to * put the raw pointer into a refcnt_ptr as soon as you get it, and * then make copies of the refcnt_ptr as needed. * * 2. Don't create auto_ptrs from refcnt_ptrs, or do other things * that might cause the object to be deleted. Yes, this is obvious, * but it's worth hammering home anyway: The *only* safe way to delete * an object once you've pointed a refcnt_ptr at it is to destroy all * of the relevent refcnt_ptrs. There is no analog to * auto_ptr::release(). Be extremely careful with refcnt_ptr::get(). * * 3. Don't share refcnt_ptrs across threads, unless you know what * you're doing. If you do it, you will need to synchronize all * actions that might update the reference count, but be careful * because C++ sometimes creates temporary copies where you might not * expect, so knowing what needs to be synchronized requires good C++ * skillz. Oh, and you obviously need to synchronize uses of the * referenced object as well * * 4. refcnt_ptr supports copying and assignment across compatible * types. That is, if T1* is convertible to T2*, then you can copy or * assign a refcnt_ptr to a refcnt_ptr. This is very * convenient, particularly in cases where T2 is const T1, or where T1 * is derived from T2. Be careful, however about pointer upcasts to * types that don't have a virtual destructor. If you create a * Derived and make a refcnt_ptr point to it, it will get * destroyed as a Base, not as a Derived, unless Base has a virtual * dtor. IOW, don't slice pointers. * * 5. Keep in mind that reference counting does have run-time * overhead, and it can get to be significant if you use refcnt_ptr * mindlessly, because every copy, assignment and destruction of a * refcnt_ptr involves updating the reference count -- just a * dereference plus an increment or decrement but there are cases * where it matters. Space overhead may also be an issue if you have * lots and lots of pointers. n pointers to T consume * * (n * sizeof(T*)) bytes, * * whereas n refcnt_ptrs consume * * (n * sizeof(T*) + n * sizeof(int*) + sizeof(int)) bytes. * * Plus some structure padding, maybe, depending on the platform. In * general, just assume that a refcnt_ptr uses three times as much * space as a regular pointer. */ template class refcnt_ptr { public: explicit refcnt_ptr(T* obj = 0) throw() { object = obj; if (object) refCnt = new int(1); #ifndef NDEBUG else refCnt = 0; #endif // NDEBUG } // Copy ctor. refcnt_ptr(const refcnt_ptr& rhs) throw() { object = rhs.object; refCnt = rhs.refCnt; increaseCount(); } // Allow creation of a refcnt_ptr from a compatible but different // refcnt_ptr type. template refcnt_ptr(const refcnt_ptr& rhs) throw() { object = rhs.object; refcnt = rhs.refCnt; increaseCount(); } // Allow creation of a refcnt_ptr from a compatible but different // auto_ptr type. template refcnt_ptr(std::auto_ptr& rhs) throw () { object = rhs.release(); refCnt = new int(1); } // Dtor. May throw if the T dtor throws. ~refcnt_ptr() { reduceCount(); } // Assignment operator. May throw if the T dtor throws. refcnt_ptr& operator=(const refcnt_ptr& rhs) { reduceCount(); object = rhs.object; refCnt = rhs.refCnt; increaseCount(); return *this; } // Assignment operator for assigning from a compatible but // different refcnt_ptr type. May throw if the T dtor throws. template refcnt_ptr& operator=(const refcnt_ptr rhs) { reduceCount(); object = rhs.object; refCnt = rhs.refCnt; increaseCount(); return *this; } // Assignment operator for assigning from a compatible but // different auto_ptr type. May throw if the T dtor throws. template refcnt_ptr& operator=(std::auto_ptr rhs) { reduceCount(); object = rhs.release(); refCnt = new int(1); return *this; } // Pointer dereference. Don't do this if the refcnt_ptr is null // (i.e. 'object' is null). T* operator->() const throw() { return object; } // Pointer dereference. Don't do this if the refcnt_ptr is null // (i.e. 'object' is null). T& operator*() const throw() { return *object; } // Return the current reference count. int count() const throw() { if (!object) return 0; return *refCnt; } // Test the refcnt_ptr for validity. operator bool() { return object; } // Return the underlying pointer. This does not affect the // reference counting at all, which means that the returned naked // pointer may dangle if all of the relevant refcnt_ptr objects // are destroyed. T* get() const throw() { return object; } private: void reduceCount() { if (object) { assert(*refCnt > 0); if ((--*refCnt) == 0) { delete object; delete refCnt; } } } void increaseCount() { if (object) ++*refCnt; } T* object; int* refCnt; }; #endif // refcnt_ptr_h madman-0.93/utility/scanner.h0000644000175000001440000000265610053135241015764 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 _HEADER_SEEN_SCANNER_H #define _HEADER_SEEN_SCANNER_H #include #include struct tToken { int TokenType; unsigned Flags; QString Text; }; struct tTokenDescriptor { int TokenType; QRegExp RegExp; bool Ignore; unsigned Flags; }; typedef vector tTokenList; typedef vector tTokenList; typedef vector tTokenDescriptorList; class tScanner { tTokenDescriptorList TokenDescriptorList; public: void addTokenDescriptor(int type, const QString &pattern, bool minimal = false, bool ignore = false, unsigned flags = 0); void scan(const QString &victim, tTokenList &tokenlist); }; #endif madman-0.93/utility/singleton.h0000644000175000001440000000247510053135241016334 0ustar akusers00000000000000/* -*- C++ -*- * * singleton.h Copyright 2002 Shawn Willden * * 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 Singleton_h #define Singleton_h #include "utility/noncopyable.h" /** * Derive your class A from Singleton to make it a singleton. * Create a single instance and then the rest of the program can find * it with A::instance(). */ template class tSingleton : tNoncopyable { public: static T* instance() { return instance_m; } protected: tSingleton() { if (!instance_m) instance_m = (T*)instance; } ~tSingleton() { instance_m = 0; } private: static T* instance_m; }; #endif // Singleton_h madman-0.93/utility/vcedit.h0000644000175000001440000000260610053135241015604 0ustar akusers00000000000000/* This program is licensed under the GNU Library General Public License, version 2, * a copy of which is included with this program (with filename LICENSE.LGPL). * * (c) 2000-2001 Michael Smith * * VCEdit header. * */ #ifndef __VCEDIT_H #define __VCEDIT_H #ifdef __cplusplus extern "C" { #endif #include #include #include typedef size_t (*vcedit_read_func)(void *, size_t, size_t, void *); typedef size_t (*vcedit_write_func)(const void *, size_t, size_t, void *); typedef struct { ogg_sync_state *oy; ogg_stream_state *os; vorbis_comment *vc; vorbis_info vi; vcedit_read_func read; vcedit_write_func write; void *in; long serial; unsigned char *mainbuf; unsigned char *bookbuf; int mainlen; int booklen; char *lasterror; char *vendor; int prevW; int extrapage; int eosin; } vcedit_state; extern vcedit_state * vcedit_new_state(void); extern void vcedit_clear(vcedit_state *state); extern vorbis_comment * vcedit_comments(vcedit_state *state); extern int vcedit_open(vcedit_state *state, FILE *in); extern int vcedit_open_callbacks(vcedit_state *state, void *in, vcedit_read_func read_func, vcedit_write_func write_func); extern int vcedit_write(vcedit_state *state, void *out); extern char * vcedit_error(vcedit_state *state); #ifdef __cplusplus } #endif #endif /* __VCEDIT_H */ madman-0.93/utility/mp3tech.c0000644000175000001440000002463310053135241015670 0ustar akusers00000000000000/* mp3tech.c - Functions for handling MP3 files and most MP3 data structure manipulation. Copyright (C) 2000-2001 Cedric Tefft 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., 675 Mass Ave, Cambridge, MA 02139, USA. *************************************************************************** This file is based in part on: * MP3Info 0.5 by Ricardo Cerqueira * MP3Stat 0.9 by Ed Sweetman and Johannes Overmann */ #include #include #include "mp3tech.h" int layer_tab[4]= {0, 3, 2, 1}; int frequencies[3][4] = { {22050,24000,16000,50000}, /* MPEG 2.0 */ {44100,48000,32000,50000}, /* MPEG 1.0 */ {11025,12000,8000,50000} /* MPEG 2.5 */ }; int bitrate[2][3][14] = { { /* MPEG 2.0 */ {32,48,56,64,80,96,112,128,144,160,176,192,224,256}, /* layer 1 */ {8,16,24,32,40,48,56,64,80,96,112,128,144,160}, /* layer 2 */ {8,16,24,32,40,48,56,64,80,96,112,128,144,160} /* layer 3 */ }, { /* MPEG 1.0 */ {32,64,96,128,160,192,224,256,288,320,352,384,416,448}, /* layer 1 */ {32,48,56,64,80,96,112,128,160,192,224,256,320,384}, /* layer 2 */ {32,40,48,56,64,80,96,112,128,160,192,224,256,320} /* layer 3 */ } }; int frame_size_index[] = {24000, 72000, 72000}; char *mode_text[] = { "stereo", "joint stereo", "dual channel", "mono" }; char *emphasis_text[] = { "none", "50/15 microsecs", "reserved", "CCITT J 17" }; int get_mp3_info(mp3info *mp3,int scantype, int fullscan_vbr) { int had_error = 0; int frame_type[15]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}; float seconds=0,total_rate=0; int frames=0,frame_types=0,frames_so_far=0; int l,vbr_median=-1; int bitrate,lastrate; int counter=0; mp3header header; struct stat filestat; off_t sample_pos,data_start=0; stat(mp3->filename,&filestat); mp3->datasize=filestat.st_size; get_id3(mp3); if(scantype == SCAN_QUICK) { if(get_first_header(mp3,0L)) { data_start=ftell(mp3->file); lastrate=15-mp3->header.bitrate; while((counter < NUM_SAMPLES) && lastrate) { sample_pos=(counter*(mp3->datasize/NUM_SAMPLES+1))+data_start; if(get_first_header(mp3,sample_pos)) { bitrate=15-mp3->header.bitrate; } else { bitrate=-1; } if(bitrate != lastrate) { mp3->vbr=1; if(fullscan_vbr) { counter=NUM_SAMPLES; scantype=SCAN_FULL; } } lastrate=bitrate; counter++; } if( scantype != SCAN_FULL ) { mp3->frames=(mp3->datasize-data_start)/(l=frame_length(&mp3->header)); mp3->seconds = (int)((float)(frame_length(&mp3->header)*mp3->frames)/ (float)(header_bitrate(&mp3->header)*125)+0.5); mp3->vbr_average = (float)header_bitrate(&mp3->header); } } else had_error = 1; } if(scantype == SCAN_FULL) { if(get_first_header(mp3,0L)) { data_start=ftell(mp3->file); while((bitrate=get_next_header(mp3))) { frame_type[15-bitrate]++; frames++; } memcpy(&header,&(mp3->header),sizeof(mp3header)); for(counter=0;counter<15;counter++) { if(frame_type[counter]) { frame_types++; header.bitrate=counter; frames_so_far += frame_type[counter]; seconds += (float)(frame_length(&header)*frame_type[counter])/ (float)(header_bitrate(&header)*125); total_rate += (float)((header_bitrate(&header))*frame_type[counter]); if((vbr_median == -1) && (frames_so_far >= frames/2)) vbr_median=counter; } } mp3->seconds=(int)(seconds+0.5); mp3->header.bitrate=vbr_median; mp3->vbr_average=total_rate/(float)frames; mp3->frames=frames; if(frame_types > 1) { mp3->vbr=1; } } } return had_error; } int get_first_header(mp3info *mp3, long startpos) { int k, l=0,c; mp3header h, h2; long valid_start=0; fseek(mp3->file,startpos,SEEK_SET); while (1) { while((c=fgetc(mp3->file)) != 255 && (c != EOF)); if(c == 255) { ungetc(c,mp3->file); valid_start=ftell(mp3->file); if((l=get_header(mp3->file,&h))) { fseek(mp3->file,l-FRAME_HEADER_SIZE,SEEK_CUR); for(k=1; (k < MIN_CONSEC_GOOD_FRAMES) && (mp3->datasize-ftell(mp3->file) >= FRAME_HEADER_SIZE); k++) { if(!(l=get_header(mp3->file,&h2))) break; if(!sameConstant(&h,&h2)) break; fseek(mp3->file,l-FRAME_HEADER_SIZE,SEEK_CUR); } if(k == MIN_CONSEC_GOOD_FRAMES) { fseek(mp3->file,valid_start,SEEK_SET); memcpy(&(mp3->header),&h2,sizeof(mp3header)); mp3->header_isvalid=1; return 1; } } } else { return 0; } } return 0; } /* get_next_header() - read header at current position or look for the next valid header if there isn't one at the current position */ int get_next_header(mp3info *mp3) { int l=0,c,skip_bytes=0; mp3header h; while(1) { while((c=fgetc(mp3->file)) != 255 && (ftell(mp3->file) < mp3->datasize)) skip_bytes++; if(c == 255) { ungetc(c,mp3->file); if((l=get_header(mp3->file,&h))) { if(skip_bytes) mp3->badframes++; fseek(mp3->file,l-FRAME_HEADER_SIZE,SEEK_CUR); return 15-h.bitrate; } else { skip_bytes += FRAME_HEADER_SIZE; } } else { if(skip_bytes) mp3->badframes++; return 0; } } } /* Get next MP3 frame header. Return codes: positive value = Frame Length of this header 0 = No, we did not retrieve a valid frame header */ int get_header(FILE *file,mp3header *header) { unsigned char buffer[FRAME_HEADER_SIZE]; int fl; if(fread(&buffer,FRAME_HEADER_SIZE,1,file)<1) { header->sync=0; return 0; } header->sync=(((int)buffer[0]<<4) | ((int)(buffer[1]&0xE0)>>4)); if(buffer[1] & 0x10) header->version=(buffer[1] >> 3) & 1; else header->version=2; header->layer=(buffer[1] >> 1) & 3; if((header->sync != 0xFFE) || (header->layer != 1)) { header->sync=0; return 0; } header->crc=buffer[1] & 1; header->bitrate=(buffer[2] >> 4) & 0x0F; header->freq=(buffer[2] >> 2) & 0x3; header->padding=(buffer[2] >>1) & 0x1; header->extension=(buffer[2]) & 0x1; header->mode=(buffer[3] >> 6) & 0x3; header->mode_extension=(buffer[3] >> 4) & 0x3; header->copyright=(buffer[3] >> 3) & 0x1; header->original=(buffer[3] >> 2) & 0x1; header->emphasis=(buffer[3]) & 0x3; return ((fl=frame_length(header)) >= MIN_FRAME_SIZE ? fl : 0); } int frame_length(mp3header *header) { return header->sync == 0xFFE ? (frame_size_index[3-header->layer]*((header->version&1)+1)* header_bitrate(header)/header_frequency(header))+ header->padding : 1; } int header_layer(mp3header *h) {return layer_tab[h->layer];} int header_bitrate(mp3header *h) { return bitrate[h->version & 1][3-h->layer][h->bitrate-1]; } int header_frequency(mp3header *h) { return frequencies[h->version][h->freq]; } char *header_emphasis(mp3header *h) { return emphasis_text[h->emphasis]; } char *header_mode(mp3header *h) { return mode_text[h->mode]; } int sameConstant(mp3header *h1, mp3header *h2) { if((*(uint*)h1) == (*(uint*)h2)) return 1; if((h1->version == h2->version ) && (h1->layer == h2->layer ) && (h1->crc == h2->crc ) && (h1->freq == h2->freq ) && (h1->mode == h2->mode ) && (h1->copyright == h2->copyright ) && (h1->original == h2->original ) && (h1->emphasis == h2->emphasis )) return 1; else return 0; } int get_id3(mp3info *mp3) { int retcode=0; char fbuf[4]; if(mp3->datasize >= 128) { if(fseek(mp3->file, -128, SEEK_END )) { fprintf(stderr,"ERROR: Couldn't read last 128 bytes of %s!!\n",mp3->filename); retcode |= 4; } else { fread(fbuf,1,3,mp3->file); fbuf[3] = '\0'; mp3->id3.genre[0]=255; if (!strcmp((const char *)"TAG",(const char *)fbuf)) { mp3->id3_isvalid=1; mp3->datasize -= 128; fseek(mp3->file, -125, SEEK_END); fread(mp3->id3.title,1,30,mp3->file); mp3->id3.title[30] = '\0'; fread(mp3->id3.artist,1,30,mp3->file); mp3->id3.artist[30] = '\0'; fread(mp3->id3.album,1,30,mp3->file); mp3->id3.album[30] = '\0'; fread(mp3->id3.year,1,4,mp3->file); mp3->id3.year[4] = '\0'; fread(mp3->id3.comment,1,30,mp3->file); mp3->id3.comment[30] = '\0'; if(mp3->id3.comment[28] == '\0') { mp3->id3.track[0] = mp3->id3.comment[29]; } fread(mp3->id3.genre,1,1,mp3->file); unpad(mp3->id3.title); unpad(mp3->id3.artist); unpad(mp3->id3.album); unpad(mp3->id3.year); unpad(mp3->id3.comment); } } } return retcode; } char *pad(char *string, int length) { int l; l=strlen(string); while(lid3.title,TEXT_FIELD_LEN); strncat(buf,mp3->id3.title,TEXT_FIELD_LEN); pad(mp3->id3.artist,TEXT_FIELD_LEN); strncat(buf,mp3->id3.artist,TEXT_FIELD_LEN); pad(mp3->id3.album,TEXT_FIELD_LEN); strncat(buf,mp3->id3.album,TEXT_FIELD_LEN); pad(mp3->id3.year,INT_FIELD_LEN); strncat(buf,mp3->id3.year,INT_FIELD_LEN); pad(mp3->id3.comment,TEXT_FIELD_LEN); strncat(buf,mp3->id3.comment,TEXT_FIELD_LEN); strncat(buf,mp3->id3.genre,1); if (mp3->id3.track[0] != '\0') { buf[125]='\0'; buf[126]=mp3->id3.track[0]; } fseek(mp3->file,-128*mp3->id3_isvalid,SEEK_END); return (int)fwrite(buf,1,128,mp3->file); } madman-0.93/utility/vcedit.c0000644000175000001440000002472710053135241015607 0ustar akusers00000000000000/* This program is licensed under the GNU Library General Public License, version 2, * a copy of which is included with this program (LICENCE.LGPL). * * (c) 2000-2001 Michael Smith * * * Comment editing backend, suitable for use by nice frontend interfaces. * */ #include #include #include #include #include #include #include "vcedit.h" #define CHUNKSIZE 4096 vcedit_state *vcedit_new_state(void) { vcedit_state *state = g_malloc(sizeof(vcedit_state)); memset(state, 0, sizeof(vcedit_state)); return state; } char *vcedit_error(vcedit_state *state) { return state->lasterror; } vorbis_comment *vcedit_comments(vcedit_state *state) { return state->vc; } static void vcedit_clear_internals(vcedit_state *state) { if(state->vc) { vorbis_comment_clear(state->vc); g_free(state->vc); state->vc=NULL; } if(state->os) { ogg_stream_clear(state->os); g_free(state->os); state->os=NULL; } if(state->oy) { ogg_sync_clear(state->oy); g_free(state->oy); state->oy=NULL; } if(state->vendor) { g_free(state->vendor); state->vendor=NULL; } } void vcedit_clear(vcedit_state *state) { if(state) { vcedit_clear_internals(state); g_free(state); } } /* Next two functions pulled straight from libvorbis, apart from one change * - we don't want to overwrite the vendor string. */ static void _v_writestring(oggpack_buffer *o,char *s, int len) { while(len--) { oggpack_write(o,*s++,8); } } static int _commentheader_out(vorbis_comment *vc, char *vendor, ogg_packet *op) { oggpack_buffer opb; oggpack_writeinit(&opb); /* preamble */ oggpack_write(&opb,0x03,8); _v_writestring(&opb,"vorbis", 6); /* vendor */ oggpack_write(&opb,strlen(vendor),32); _v_writestring(&opb,vendor, strlen(vendor)); /* comments */ oggpack_write(&opb,vc->comments,32); if(vc->comments){ int i; for(i=0;icomments;i++){ if(vc->user_comments[i]){ oggpack_write(&opb,vc->comment_lengths[i],32); _v_writestring(&opb,vc->user_comments[i], vc->comment_lengths[i]); }else{ oggpack_write(&opb,0,32); } } } oggpack_write(&opb,1,1); op->packet = (unsigned char *) _ogg_malloc(oggpack_bytes(&opb)); memcpy(op->packet, opb.buffer, oggpack_bytes(&opb)); op->bytes=oggpack_bytes(&opb); op->b_o_s=0; op->e_o_s=0; op->granulepos=0; return 0; } static int _blocksize(vcedit_state *s, ogg_packet *p) { int this_ = vorbis_packet_blocksize(&s->vi, p); int ret = (this_ + s->prevW)/4; if(!s->prevW) { s->prevW = this_; return 0; } s->prevW = this_; return ret; } static int _fetch_next_packet(vcedit_state *s, ogg_packet *p, ogg_page *page) { int result; char *buffer; int bytes; result = ogg_stream_packetout(s->os, p); if(result > 0) return 1; else { if(s->eosin) return 0; while(ogg_sync_pageout(s->oy, page) <= 0) { buffer = ogg_sync_buffer(s->oy, CHUNKSIZE); bytes = s->read(buffer,1, CHUNKSIZE, s->in); ogg_sync_wrote(s->oy, bytes); if(bytes == 0) return 0; } if(ogg_page_eos(page)) s->eosin = 1; else if(ogg_page_serialno(page) != s->serial) { s->eosin = 1; s->extrapage = 1; return 0; } ogg_stream_pagein(s->os, page); return _fetch_next_packet(s, p, page); } } int vcedit_open(vcedit_state *state, FILE *in) { return vcedit_open_callbacks(state, (void *)in, (vcedit_read_func)fread, (vcedit_write_func)fwrite); } int vcedit_open_callbacks(vcedit_state *state, void *in, vcedit_read_func read_func, vcedit_write_func write_func) { char *buffer; int bytes,i; ogg_packet *header; ogg_packet header_main; ogg_packet header_comments; ogg_packet header_codebooks; ogg_page og; state->in = in; state->read = read_func; state->write = write_func; state->oy = (ogg_sync_state *) g_malloc(sizeof(ogg_sync_state)); ogg_sync_init(state->oy); buffer = ogg_sync_buffer(state->oy, CHUNKSIZE); bytes = state->read(buffer, 1, CHUNKSIZE, state->in); ogg_sync_wrote(state->oy, bytes); if(ogg_sync_pageout(state->oy, &og) != 1) { if(byteslasterror = "Input truncated or empty."; else state->lasterror = "Input is not an Ogg bitstream."; goto err; } state->serial = ogg_page_serialno(&og); state->os = (ogg_stream_state *) g_malloc(sizeof(ogg_stream_state)); ogg_stream_init(state->os, state->serial); vorbis_info_init(&state->vi); state->vc = (vorbis_comment *) g_malloc(sizeof(vorbis_comment)); vorbis_comment_init(state->vc); if(ogg_stream_pagein(state->os, &og) < 0) { state->lasterror = "Error reading first page of Ogg bitstream."; goto err; } if(ogg_stream_packetout(state->os, &header_main) != 1) { state->lasterror = "Error reading initial header packet."; goto err; } if(vorbis_synthesis_headerin(&state->vi, state->vc, &header_main) < 0) { state->lasterror = "Ogg bitstream does not contain vorbis data."; goto err; } state->mainlen = header_main.bytes; state->mainbuf = (unsigned char *) g_malloc(state->mainlen); memcpy(state->mainbuf, header_main.packet, header_main.bytes); i = 0; header = &header_comments; while(i<2) { while(i<2) { int result = ogg_sync_pageout(state->oy, &og); if(result == 0) break; /* Too little data so far */ else if(result == 1) { ogg_stream_pagein(state->os, &og); while(i<2) { result = ogg_stream_packetout(state->os, header); if(result == 0) break; if(result == -1) { state->lasterror = "Corrupt secondary header."; goto err; } vorbis_synthesis_headerin(&state->vi, state->vc, header); if(i==1) { state->booklen = header->bytes; state->bookbuf = (unsigned char *) g_malloc(state->booklen); memcpy(state->bookbuf, header->packet, header->bytes); } i++; header = &header_codebooks; } } } buffer = ogg_sync_buffer(state->oy, CHUNKSIZE); bytes = state->read(buffer, 1, CHUNKSIZE, state->in); if(bytes == 0 && i < 2) { state->lasterror = "EOF before end of vorbis headers."; goto err; } ogg_sync_wrote(state->oy, bytes); } /* Copy the vendor tag */ state->vendor = (char *) g_malloc(strlen(state->vc->vendor) +1); strcpy(state->vendor, state->vc->vendor); /* Headers are done! */ return 0; err: vcedit_clear_internals(state); return -1; } int vcedit_write(vcedit_state *state, void *out) { ogg_stream_state streamout; ogg_packet header_main; ogg_packet header_comments; ogg_packet header_codebooks; ogg_page ogout, ogin; ogg_packet op; ogg_int64_t granpos = 0; int result; char *buffer; int bytes; int needflush=0, needout=0; state->eosin = 0; state->extrapage = 0; header_main.bytes = state->mainlen; header_main.packet = state->mainbuf; header_main.b_o_s = 1; header_main.e_o_s = 0; header_main.granulepos = 0; header_codebooks.bytes = state->booklen; header_codebooks.packet = state->bookbuf; header_codebooks.b_o_s = 0; header_codebooks.e_o_s = 0; header_codebooks.granulepos = 0; ogg_stream_init(&streamout, state->serial); _commentheader_out(state->vc, state->vendor, &header_comments); ogg_stream_packetin(&streamout, &header_main); ogg_stream_packetin(&streamout, &header_comments); ogg_stream_packetin(&streamout, &header_codebooks); while((result = ogg_stream_flush(&streamout, &ogout))) { if(state->write(ogout.header,1,ogout.header_len, out) != (size_t) ogout.header_len) goto cleanup; if(state->write(ogout.body,1,ogout.body_len, out) != (size_t) ogout.body_len) goto cleanup; } while(_fetch_next_packet(state, &op, &ogin)) { int size; size = _blocksize(state, &op); granpos += size; if(needflush) { if(ogg_stream_flush(&streamout, &ogout)) { if(state->write(ogout.header,1,ogout.header_len, out) != (size_t) ogout.header_len) goto cleanup; if(state->write(ogout.body,1,ogout.body_len, out) != (size_t) ogout.body_len) goto cleanup; } } else if(needout) { if(ogg_stream_pageout(&streamout, &ogout)) { if(state->write(ogout.header,1,ogout.header_len, out) != (size_t) ogout.header_len) goto cleanup; if(state->write(ogout.body,1,ogout.body_len, out) != (size_t) ogout.body_len) goto cleanup; } } needflush=needout=0; if(op.granulepos == -1) { op.granulepos = granpos; ogg_stream_packetin(&streamout, &op); } else /* granulepos is set, validly. Use it, and force a flush to account for shortened blocks (vcut) when appropriate */ { if(granpos > op.granulepos) { granpos = op.granulepos; ogg_stream_packetin(&streamout, &op); needflush=1; } else { ogg_stream_packetin(&streamout, &op); needout=1; } } } streamout.e_o_s = 1; while(ogg_stream_flush(&streamout, &ogout)) { if(state->write(ogout.header,1,ogout.header_len, out) != (size_t) ogout.header_len) goto cleanup; if(state->write(ogout.body,1,ogout.body_len, out) != (size_t) ogout.body_len) goto cleanup; } /* FIXME: freeing this here probably leaks memory */ /* Done with this, now */ vorbis_info_clear(&state->vi); if (state->extrapage) { if(state->write(ogin.header,1,ogin.header_len, out) != (size_t) ogin.header_len) goto cleanup; if (state->write(ogin.body,1,ogin.body_len, out) != (size_t) ogin.body_len) goto cleanup; } state->eosin=0; /* clear it, because not all paths to here do */ while(!state->eosin) /* We reached eos, not eof */ { /* We copy the rest of the stream (other logical streams) * through, a page at a time. */ while(1) { result = ogg_sync_pageout(state->oy, &ogout); if(result==0) break; if(result<0) state->lasterror = "Corrupt or missing data, continuing..."; else { /* Don't bother going through the rest, we can just * write the page out now */ if(state->write(ogout.header,1,ogout.header_len, out) != (size_t) ogout.header_len) goto cleanup; if(state->write(ogout.body,1,ogout.body_len, out) != (size_t) ogout.body_len) goto cleanup; } } buffer = ogg_sync_buffer(state->oy, CHUNKSIZE); bytes = state->read(buffer,1, CHUNKSIZE, state->in); ogg_sync_wrote(state->oy, bytes); if(bytes == 0) { state->eosin = 1; break; } } cleanup: ogg_stream_clear(&streamout); ogg_packet_clear(&header_comments); g_free(state->mainbuf); g_free(state->bookbuf); vcedit_clear_internals(state); if(!state->eosin) { state->lasterror = "Error writing stream to output. " "Output stream may be corrupted or truncated."; return -1; } return 0; } madman-0.93/utility/base.cpp0000644000175000001440000002702610053135241015576 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "base.h" #include "database/song.h" #include #include #include #include #include "utility/progress.h" bool hasAttribute(const char *name, const char **attributes) { while (*attributes && strcmp(name, *attributes) != 0) attributes += 2; if (*attributes == 0) return false; return true; } const char *lookupAttributeUtf8(const char *name, const char **attributes) { while (*attributes && strcmp(name, *attributes) != 0) attributes += 2; if (*attributes == 0) throw runtime_error(QString2string("Attribute not found: " + QString::fromUtf8(name, strlen(name)))); return attributes[1]; } QString lookupAttribute(const char *name, const char **attributes) { return QString::fromUtf8(lookupAttributeUtf8(name, attributes)); } string QString2string(QString const &str) { if (str == QString::null) return ""; else return (const char *) str.utf8(); } QString string2QString(string const &str) { return QString::fromUtf8(str.c_str()); } // tIConv ---------------------------------------------------------------------- /* class tIConv { iconv_t ConversionHandle; public: tIConv(const string &to, const string &from); ~tIConv(); string convert(const char *data, size_t size); string convert(const string &str); void reset(); }; tIConv::tIConv(const string &to, const string &from) { ConversionHandle = iconv_open (to.c_str(), from.c_str()); if (ConversionHandle == (iconv_t) -1) { if (errno == EINVAL) throw runtime_error( "could not instantiate this specific iconv table" ); else throw runtime_error( "iconv_open error" ); } } tIConv::~tIConv() { if (iconv_close(ConversionHandle) != 0) perror ("iconv_close"); } string tIConv::convert(const char *data, size_t size) { char *inptr = data; size_t inlength = size; string result; do { char outbuffer[ 2048 ]; size_t outlength = sizeof(outbuffer); char *outptr = outbuffer; if (iconv(ConversionHandle, &inptr, &inlength, &outptr, &outlength) == (size_t) -1) throw runtime_error("Error during iconv conversion"); result += string(outbuffer, sizeof(outbuffer) - outlength); } while (inlength); return result; } string tIConv::convert(const string &str) { return convert(const_cast< char * >(str.c_str()), str.size()); } void tIConv::reset() { if (iconv(ConversionHandle, NULL, NULL, NULL, NULL) == (size_t) -1) throw runtime_error("Error during iconv reset"); } QString wstring2QString(const wchar_t *str) { char *inptr = const_cast< char * >(reinterpret_cast(str)); size_t inlength = wcslen(str); size_t inlength_bytes = inlength * sizeof(wchar_t); size_t destsize = inlength_bytes; char destbuffer[ destsize ]; char *destptr = destbuffer; if (iconv (WCharT2UCS2Iconv.cd, &inptr, &inlength_bytes, &destptr, &destsize) == (size_t) -1) { throw runtime_error("Error during wchar_t -> UCS2 conversion."); } unsigned short *ucs2 = (unsigned short *) destbuffer; ucs2[ inlength ] = 0; return QString::fromUcs2(ucs2); } */ // string conversion ---------------------------------------------------------- vector QStringList2QStringvector(const QStringList &strlist) { vector result; for (unsigned i = 0; i < strlist.size(); i++) result.push_back(strlist[ i ] ); return result; } QStringList QStringvector2QStringList(const vector &strlist) { QStringList result; for (unsigned i = 0; i < strlist.size(); i++) result.push_back(strlist[ i ] ); return result; } vector QStringList2stringvector(const QStringList &strlist) { vector result; for (unsigned i = 0; i < strlist.size(); i++) result.push_back((const char *) strlist[ i ].utf8()); return result; } QStringList stringvector2QStringList(const vector &strlist) { QStringList result; for (unsigned i = 0; i < strlist.size(); i++) result.push_back(QString::fromUtf8(strlist[ i ].c_str())); return result; } ostream &operator <<(ostream &ostr, QString const &str) { return (ostr << QString2string(str)); } QString quoteString(const QString &victim) { QString my_victim = victim; return "\"" + my_victim.replace(QRegExp("\\\""), "\\\"") + "\""; } void split(const QString &sep, const QString &str, vector &result) { QStringList temp = QStringList::split(sep, str); FOREACH_CONST(first, temp, QStringList) result.push_back(*first); } QString join(const vector &strlist, const QString &sep) { bool is_first = true; QString result; FOREACH_CONST(first, strlist, vector) { if (is_first) { result = *first; is_first = false; } else result += sep + *first; } return result; } void enumerateFiles(const string &directory, vector &result, tProgress *prog) { DIR *dir; dirent *entry; if (directory.size() == 0) throw runtime_error("passed zero-length directory to enumerateFiles"); string realdir; if (directory[directory.size()-1] == '/') realdir = directory.substr(0, directory.size()-1); else realdir = directory; dir = opendir(realdir.c_str()); if (dir == NULL) throw runtime_error(("could not open directory: "+directory).c_str()); try { while ((entry = readdir(dir))) { if (prog) prog->setProgress(prog->progress() + 1); if (strcmp(entry->d_name, ".") == 0) continue; if (strcmp(entry->d_name, "..") == 0) continue; string full_name = realdir + "/" + entry->d_name; struct stat my_statbuf; if (stat(full_name.c_str(), &my_statbuf) != 0) { cerr << "*** Failed to stat:" << endl << "*** " << full_name << endl; continue; } if (S_ISDIR(my_statbuf.st_mode)) enumerateFiles(full_name, result, prog); else if (S_ISREG(my_statbuf.st_mode)) result.push_back(full_name); } closedir(dir); } catch (...) { closedir(dir); throw; } } namespace { unsigned char const B64_INVALID = 0xff; unsigned char const B64_PAD = 0xfe; char const B64_PAD_CHAR = '='; char Base64EncodeTable[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; char Base64DecodeTable[] = { // based at 0 B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID, B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID, B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID, B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID, B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID, B64_INVALID,B64_INVALID,B64_INVALID,62,B64_INVALID,B64_INVALID,B64_INVALID,63,52,53,54, 55,56,57,58,59,60,61,B64_INVALID,B64_INVALID,B64_INVALID,B64_PAD,B64_INVALID, B64_INVALID,B64_INVALID,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18, 19,20,21,22,23,24,25,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID, B64_INVALID,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43, 44,45,46,47,48,49,50,51,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID,B64_INVALID, }; } size_t getMaxBase64DecodedSize(size_t encoded) { return ((encoded+3)/4)*3; } size_t decodeBase64(unsigned char *data, unsigned dest_size, string const &base64) { string::const_iterator first = base64.begin(),last = base64.end(); unsigned char *data_start = data; unsigned long block; unsigned char a,b,c,d; while (first != last && dest_size > 0) { a = Base64DecodeTable[(int) *(first++)]; b = Base64DecodeTable[(int) *(first++)]; c = Base64DecodeTable[(int) *(first++)]; d = Base64DecodeTable[(int) *(first++)]; if (c == B64_PAD) { block = a << 3*6 | b << 2*6; *data++ = (block >> 16) & 0xff; --dest_size; } else if (d == B64_PAD) { if (dest_size < 2) throw runtime_error("base64 buffer overflow"); block = a << 3*6 | b << 2*6 | c << 1*6; *data++ = (block >> 16) & 0xff; *data++ = (block >> 8) & 0xff; dest_size -= 2; } else { if (dest_size < 3) throw runtime_error("base64 buffer overflow"); block = a << 3*6 | b << 2*6 | c << 1*6 | d << 0*6; *data++ = (block >> 16) & 0xff; *data++ = (block >> 8) & 0xff; *data++ = (block >> 0) & 0xff; dest_size -= 3; } } return data-data_start; } void encodeBase64(string &base64, unsigned char const *data, size_t size) { base64.resize((size+2)/3*4); unsigned long block; unsigned char a,b,c,d; unsigned char const *end = data+size; string::iterator first = base64.begin(); while (data < end) if (data+1 == end) { block = data[0] << 16; a = (block >> 3*6) & 0x3f; b = (block >> 2*6) & 0x3f; *first++ = Base64EncodeTable[a]; *first++ = Base64EncodeTable[b]; *first++ = B64_PAD_CHAR; *first++ = B64_PAD_CHAR; data++; } else if (data+2 == end) { block = data[0] << 16 | data[1] << 8; a = (block >> 3*6) & 0x3f; b = (block >> 2*6) & 0x3f; c = (block >> 1*6) & 0x3f; *first++ = Base64EncodeTable[a]; *first++ = Base64EncodeTable[b]; *first++ = Base64EncodeTable[c]; *first++ = B64_PAD_CHAR; data += 2; } else { block = data[0] << 16 | data[1] << 8 | data[2]; a = (block >> 3*6) & 0x3f; b = (block >> 2*6) & 0x3f; c = (block >> 1*6) & 0x3f; d = (block >> 0*6) & 0x3f; *first++ = Base64EncodeTable[a]; *first++ = Base64EncodeTable[b]; *first++ = Base64EncodeTable[c]; *first++ = Base64EncodeTable[d]; data += 3; } } string encodeBase64(const string &src) { string base64; encodeBase64(base64, reinterpret_cast(src.data()), src.size()); return base64; } string decodeBase64(const string &src) { unsigned decoded_size = getMaxBase64DecodedSize(src.length()); char buffer[decoded_size]; unsigned size = decodeBase64(reinterpret_cast(buffer), decoded_size, src); return string(buffer, size); } unsigned long hash_QString::operator() (QString const &str) const { unsigned long h = 0; for (unsigned i = 0; i < str.length(); i++) h = 5 * h + str[ i ].unicode(); return h; } unsigned long hash_string::operator() (string const &str) const { unsigned long h = 0; for (unsigned i = 0; i < str.size(); i++) h = 5 * h + str[i]; return h; } // tProfiler ------------------------------------------------------------------ tProfiler::tProfiler(const QString &name) : Name(name) { Time.start(); } tProfiler::~tProfiler() { cerr << "[profiler] " << Name << " -> " << Time.elapsed() << " ms." << endl; } madman-0.93/utility/mt_random.cpp0000644000175000001440000001301510053135241016635 0ustar akusers00000000000000/* A C-program for MT19937: Real number version (1998/4/6) */ /* genrand() generates one pseudorandom real number (double) */ /* which is uniformly distributed on [0,1]-interval, for each */ /* call. sgenrand(seed) set initial values to the working area */ /* of 624 words. Before genrand(), sgenrand(seed) must be */ /* called once. (seed is any 32-bit integer except for 0). */ /* Integer generator is obtained by modifying two lines. */ /* Coded by Takuji Nishimura, considering the suggestions by */ /* Topher Cooper and Marc Rieffel in July-Aug. 1997. */ /* This library is free software; you can redistribute it and/or */ /* modify it under the terms of the GNU Library 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 Library General Public License for more details. */ /* You should have received a copy of the GNU Library General */ /* Public License along with this library; if not, write to the */ /* Free Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA */ /* 02111-1307 USA */ /* Copyright (C) 1997 Makoto Matsumoto and Takuji Nishimura. */ /* When you use this, send an email to: matumoto@math.keio.ac.jp */ /* with an appropriate reference to your work. */ /* REFERENCE */ /* M. Matsumoto and T. Nishimura, */ /* "Mersenne Twister: A 623-Dimensionally Equidistributed Uniform */ /* Pseudo-Random Number Generator", */ /* ACM Transactions on Modeling and Computer Simulation, */ /* Vol. 8, No. 1, January 1998, pp 3--30. */ #include #include unsigned short mtRand_xsubi[3] = {723, 32761, 44444}; #define mtRand_CC #include"mt_random.h" /* Period parameters */ #define M 397 #define MATRIX_A 0x9908b0df /* constant vector a */ #define UPPER_MASK 0x80000000 /* most significant w-r bits */ #define LOWER_MASK 0x7fffffff /* least significant r bits */ /* Tempering parameters */ #define TEMPERING_MASK_B 0x9d2c5680 #define TEMPERING_MASK_C 0xefc60000 #define TEMPERING_SHIFT_U(y) (y >> 11) #define TEMPERING_SHIFT_S(y) (y << 7) #define TEMPERING_SHIFT_T(y) (y << 15) #define TEMPERING_SHIFT_L(y) (y >> 18) /* initializing the array with a NONZERO seed */ void mtRand::sgenrand(unsigned long seed) { /* setting initial seeds to mt[N] using */ /* the generator Line 25 of Table 1 in */ /* [KNUTH 1981, The Art of Computer Programming */ /* Vol. 2 (2nd Ed.), pp102] */ mt[0]= seed & 0xffffffff; for (mti=1; mti> 9) ^ (s << 19); } } double mtRand:: gendrand() { unsigned long y; static unsigned long mag01[2]={0x0, MATRIX_A}; /* mag01[x] = x * MATRIX_A for x=0,1 */ if (mti >= mtRand_N) { /* generate mtRand_N words at one time */ int kk; for (kk=0;kk> 1) ^ mag01[y & 0x1]; } for (;kk> 1) ^ mag01[y & 0x1]; } y = (mt[mtRand_N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK); mt[mtRand_N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1]; mti = 0; } y = mt[mti++]; y ^= TEMPERING_SHIFT_U(y); y ^= TEMPERING_SHIFT_S(y) & TEMPERING_MASK_B; y ^= TEMPERING_SHIFT_T(y) & TEMPERING_MASK_C; y ^= TEMPERING_SHIFT_L(y); return ((double)y * 2.3283064370807974e-10); /* reals */ } unsigned long mtRand::genlrand() { unsigned long y; static unsigned long mag01[2]={0x0, MATRIX_A}; /* mag01[x] = x * MATRIX_A for x=0,1 */ if (mti >= mtRand_N) { /* generate mtRand_N words at one time */ int kk; for (kk=0;kk> 1) ^ mag01[y & 0x1]; } for (;kk> 1) ^ mag01[y & 0x1]; } y = (mt[mtRand_N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK); mt[mtRand_N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1]; mti = 0; } y = mt[mti++]; y ^= TEMPERING_SHIFT_U(y); y ^= TEMPERING_SHIFT_S(y) & TEMPERING_MASK_B; y ^= TEMPERING_SHIFT_T(y) & TEMPERING_MASK_C; y ^= TEMPERING_SHIFT_L(y); return y; } madman-0.93/utility/player.cpp0000644000175000001440000000760710053135241016163 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "utility/player_xmms.h" // tPlayer -------------------------------------------------------------------- tPlayer::~tPlayer() { } void tPlayer::skipTo(float percentage) { float total = totalTime(); if (total == 0) return; skipToSeconds(int(total * percentage / 100)); } // tPlayerFacade -------------------------------------------------------------- void tPlayerFacade::setBackend(tPlayer *backend) { if (Backend.get()) disconnect(Backend.get(), NULL, backend, NULL); auto_ptr be(backend); Backend = be; if (Backend.get()) { connect(Backend.get(), SIGNAL(currentSongChanged()), this, SLOT(slotCurrentSongChanged())); connect(Backend.get(), SIGNAL(stateChanged()), this, SLOT(slotStateChanged())); } } QString tPlayerFacade::name() { if (Backend.get()) return Backend->name(); else return QString(); } void tPlayerFacade::playNow(tSongList const &songlist) { if (Backend.get()) Backend->playNow(songlist); } void tPlayerFacade::playNext(tSongList const &songlist) { if (Backend.get()) Backend->playNext(songlist); } void tPlayerFacade::playEventually(tSongList const &songlist) { if (Backend.get()) Backend->playEventually(songlist); } void tPlayerFacade::setPlayList(tSongList const &songlist) { if (Backend.get()) Backend->setPlayList(songlist); } tFilename tPlayerFacade::currentFilename() { if (Backend.get()) return Backend->currentFilename(); else return ""; } QString tPlayerFacade::currentTitle() { if (Backend.get()) return Backend->currentTitle(); else return QString::null; } void tPlayerFacade::getPlayList(vector &songs) { if (Backend.get()) Backend->getPlayList(songs); else songs.clear(); } void tPlayerFacade::clearPlaylist() { if (Backend.get()) Backend->clearPlaylist(); } bool tPlayerFacade::isPlaying() { if (Backend.get()) return Backend->isPlaying(); else return false; } bool tPlayerFacade::isPaused() { if (Backend.get()) return Backend->isPaused(); else return false; } float tPlayerFacade::currentTime() { if (Backend.get()) return Backend->currentTime(); else return 0; } float tPlayerFacade::totalTime() { if (Backend.get()) return Backend->totalTime(); else return 0; } void tPlayerFacade::play() { if (Backend.get()) Backend->play(); } void tPlayerFacade::stop() { if (Backend.get()) Backend->stop(); } void tPlayerFacade::pause() { if (Backend.get()) Backend->pause(); } void tPlayerFacade::skipForward() { if (Backend.get()) Backend->skipForward(); } void tPlayerFacade::skipBack() { if (Backend.get()) Backend->skipBack(); } void tPlayerFacade::skipToSeconds(float seconds) { if (Backend.get()) Backend->skipToSeconds(seconds); } void tPlayerFacade::slotCurrentSongChanged() { emit currentSongChanged(); } void tPlayerFacade::slotStateChanged() { emit stateChanged(); } // factory interface ---------------------------------------------------------- void listPlayers(vector &players) { players.clear(); players.push_back("XMMS"); } tPlayer *createPlayer(QString const &name) { if (name == "XMMS") { return new tXMMSPlayer; } else return NULL; } madman-0.93/utility/player_xmms.cpp0000644000175000001440000001174310053135241017223 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "utility/base.h" #include "utility/player_xmms.h" #include "database/song.h" // tXMMSPlayer ---------------------------------------------------------------- tXMMSPlayer::tXMMSPlayer() { Session = 0; PreviousPaused = isPaused(); PreviousPlaying = isPlaying(); CurrentSongValid = false; Timer.start(500); connect(&Timer, SIGNAL(timeout()), this, SLOT(timer())); } void tXMMSPlayer::ensureRunning() { if (!xmms_remote_is_running(Session)) { system("xmms &"); unsigned tries = 5; while (tries-- && !xmms_remote_is_running(Session)) sleep(1); if (!xmms_remote_is_running(Session)) throw runtime_error("failed to start xmms."); } } void tXMMSPlayer::playNow(tSongList const &songlist) { ensureRunning(); if (songlist.size() == 0) return; gint start_playlist_pos = xmms_remote_get_playlist_length(Session); gint playlist_pos = start_playlist_pos; FOREACH_CONST(first, songlist, tSongList) { xmms_remote_playlist_ins_url_string(Session, const_cast((*first)->filename().c_str()), playlist_pos++); } xmms_remote_set_playlist_pos(Session, start_playlist_pos); if (!xmms_remote_is_playing(Session)) xmms_remote_play(Session); } void tXMMSPlayer::playNext(tSongList const &songlist) { ensureRunning(); if (songlist.size() == 0) return; gint playlist_pos = xmms_remote_get_playlist_pos(Session); if (xmms_remote_get_playlist_length(Session) == 0) playlist_pos = -1; FOREACH_CONST(first, songlist, tSongList) { xmms_remote_playlist_ins_url_string(Session, const_cast((*first)->filename().c_str()), ++playlist_pos); } } void tXMMSPlayer::playEventually(tSongList const &songlist) { ensureRunning(); if (songlist.size() == 0) return; gint playlist_pos = xmms_remote_get_playlist_length(Session); FOREACH_CONST(first, songlist, tSongList) { xmms_remote_playlist_ins_url_string(Session, const_cast((*first)->filename().c_str()), playlist_pos++); } } void tXMMSPlayer::setPlayList(tSongList const &songlist) { ensureRunning(); xmms_remote_playlist_clear(Session); gint playlist_pos = 0; FOREACH_CONST(first, songlist, tSongList) { xmms_remote_playlist_ins_url_string(Session, const_cast((*first)->filename().c_str()), playlist_pos++); } } void tXMMSPlayer::getPlayList(vector &songs) { ensureRunning(); songs.clear(); int length = xmms_remote_get_playlist_length(Session); for (int i = 0; i < length; i++) songs.push_back(xmms_remote_get_playlist_file(Session, i)); } tFilename tXMMSPlayer::currentFilename() { if (!haveValidPlaylistPosition()) return ""; const char *name = xmms_remote_get_playlist_file(Session, xmms_remote_get_playlist_pos(Session)); if (name == NULL) return ""; else return name; } QString tXMMSPlayer::currentTitle() { if (!haveValidPlaylistPosition()) return ""; const char *name = xmms_remote_get_playlist_title(Session, xmms_remote_get_playlist_pos(Session)); if (name == NULL) return ""; else return name; } float tXMMSPlayer::currentTime() { if (isPlaying() || isPaused()) return xmms_remote_get_output_time(Session) / 1000.; else return 0; } float tXMMSPlayer::totalTime() { if (!haveValidPlaylistPosition()) return 0; return xmms_remote_get_playlist_time(Session, xmms_remote_get_playlist_pos(Session)) / 1000.; } void tXMMSPlayer::skipToSeconds(float seconds) { xmms_remote_jump_to_time(Session, int(seconds * 1000)); } void tXMMSPlayer::timer() { bool state_changed = false; if (isPlaying() != PreviousPlaying) { PreviousPlaying = isPlaying(); state_changed = true; } if (isPaused() != PreviousPaused) { PreviousPaused = isPaused(); state_changed = true; } if (state_changed) emit stateChanged(); tFilename song_file = currentFilename(); if (song_file != CurrentSongFilename) { CurrentSongFilename = song_file; emit currentSongChanged(); } } bool tXMMSPlayer::haveValidPlaylistPosition() { int length = xmms_remote_get_playlist_length(Session); if (length == 0) return false; int pos = xmms_remote_get_playlist_pos(Session); return pos >= 0 && pos < length; } madman-0.93/utility/plugin.cpp0000644000175000001440000001642210053135241016160 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "utility/plugin.h" #include "database/song.h" #include #include #include #include #include #include #include #include #include #include // tPlugin -------------------------------------------------------------------- tPlugin::tPlugin() : Confirm(false), RescanAfter(false) { } bool tPlugin::gatherInfo() { Confirm = false; RescanAfter = false; QRegExp this_is_not_re("MADMAN-THIS-IS-NOT-A-PLUGIN"); QRegExp version_re("MADMAN-PLUGIN-VERSION:(.*)$"); QRegExp name_re("MADMAN-NAME:(.*)$"); QRegExp description_re("MADMAN-DESCRIPTION:(.*)$"); QRegExp arguments_re("MADMAN-ARGUMENTS:(.*)$"); QRegExp menustring_re("MADMAN-MENUSTRING:(.*)$"); QRegExp shortcut_re("MADMAN-KEYBOARDSHORTCUT:(.*)$"); QRegExp confirm_re("MADMAN-CONFIRM:(.*)$"); QRegExp rescanafter_re("MADMAN-RESCANAFTER:(.*)$"); QFile pluginfile(Filename); if (!pluginfile.open(IO_ReadOnly)) return false; bool isplugin = false; QTextStream stream(&pluginfile); while (!stream.eof()) { QString line = stream.readLine(); if (this_is_not_re.search(line) >= 0) return false; if (version_re.search(line) >= 0) { isplugin = version_re.cap(1).stripWhiteSpace() == "2"; if (!isplugin) return false; } if (name_re.search(line) >= 0) { Name = name_re.cap(1).stripWhiteSpace(); } else if (description_re.search(line) >= 0) { Description = description_re.cap(1).stripWhiteSpace(); } else if (arguments_re.search(line) >= 0) { Arguments = arguments_re.cap(1).stripWhiteSpace(); } else if (menustring_re.search(line) >= 0) { MenuString = menustring_re.cap(1).stripWhiteSpace(); } else if (shortcut_re.search(line) >= 0) { KeyboardShortcut = shortcut_re.cap(1).stripWhiteSpace(); } else if (confirm_re.search(line) >= 0) { bool ok; Confirm = confirm_re.cap(1).stripWhiteSpace().toInt(&ok) != 0; if (!ok) throw runtime_error("found invalid numeral in confirm line of "+QString2string(Filename)); } else if (rescanafter_re.search(line) >= 0) { bool ok; RescanAfter = rescanafter_re.cap(1).stripWhiteSpace().toInt(&ok) != 0; if (!ok) throw runtime_error("found invalid numeral in rescanafter line of "+QString2string(Filename)); } } if (MenuString.isNull()) MenuString = Name; return isplugin; } void tPlugin::configure (QSettings &settings) { QFileInfo info(Filename); QRegExp config_re("%config:(.*)%"); config_re.setMinimal(true); int where = 0; while ((where = config_re.search(Arguments, where + 1)) >= 0) { QString prompt = config_re.cap(1); QString key = QString("/madman/plugins/%1/%2").arg(info.fileName()).arg(prompt); QString value = settings.readEntry(key); bool ok; QString input = QInputDialog::getText(qApp->translate("tPlugin", "madman Plugin"), prompt, QLineEdit::Normal, value, &ok ); if (!ok) return; settings.writeEntry(key, input); } } namespace { QString expand(const QString &pluginname, QSettings &settings, const QString &victim, tSong *context) { QString result = victim; if (context) result = substituteSongFields(result, context, false, true); QRegExp ask_re("%ask:(.*)%"); ask_re.setMinimal(true); int where = 0; while ((where = ask_re.search(result)) >= 0) { QString prompt = ask_re.cap(1); bool ok; QString input = QInputDialog::getText(qApp->translate("tPlugin", "madman Plugin"), prompt, QLineEdit::Normal, QString::null, &ok ); result.replace(where, ask_re.matchedLength(), QString("\"%1\"").arg(input)); } QFileInfo info(pluginname); QRegExp config_re("%config:(.*)%"); config_re.setMinimal(true); while ((where = config_re.search(result)) >= 0) { bool ok; QString key = QString("/madman/plugins/%1/%2").arg(info.fileName()).arg(config_re.cap(1)); QString value = settings.readEntry(key, QString::null, &ok); if (!ok) throw tRuntimeError(qApp->translate("tPlugin", "Plugin not yet configured")); result.replace(where, config_re.matchedLength(), QString("\"%1\"").arg(value)); } return result; } void mySystem(const QString &command) { int ret = system(command.latin1()); /* * XXX FIXME portability problems to FreeBSD if (WIFSIGNALED(ret) && (WTERMSIG(ret) == SIGINT || WTERMSIG(ret) == SIGQUIT)) throw tRuntimeError(qApp->translate("tPlugin", "Plugin died because it caught SIGINT or SIGQUIT ")); */ if (ret) throw tRuntimeError(qApp->translate("tPlugin", "Plugin execution resulted in non-zero return value")); } } void tPlugin::run(QSettings &settings, const tSongList &songs) { QString myargs = Arguments; QRegExp repeat_re("%repeat%(.*)%endrepeat%"); bool hasrepeat = repeat_re.search(myargs) >= 0; if (hasrepeat) { QString repeat_section = repeat_re.cap(1); myargs = myargs.replace(repeat_re, "%REPEAT%"); myargs = expand(Filename, settings, myargs, NULL); if (myargs.isNull()) return; QString repeatargs; FOREACH_CONST(first, songs, tSongList) { QString expansion = expand(Filename, settings, repeat_section, *first); if (expansion.isNull()) return; repeatargs += " " + expansion; } myargs.replace("%REPEAT%", repeatargs); QString command = Filename + " " + myargs; mySystem(command); } else { FOREACH_CONST(first, songs, tSongList) { QString expansion = expand(Filename, settings, myargs, *first); if (expansion.isNull()) return; QString command = Filename + " " + expansion; mySystem(command); } } } // functions ------------------------------------------------------------------ void enumeratePlugins(const tDirectoryList &dir_list, tPluginList &plugin_list) { FOREACH_CONST(first, dir_list, tDirectoryList) { QDir directory(QString::fromUtf8(first->c_str())); if (!directory.exists()) { cerr << "[ERROR] nonexistent: " << *first << endl; continue; } QStringList strlist = directory.entryList(); for (unsigned i = 0; i < strlist.size(); i++) { QString name = strlist[ i ]; QString fullname = QString::fromUtf8(first->c_str()) + "/" + name; QFileInfo file(fullname); if (!file.isExecutable()) continue; tPlugin plugin; plugin.Filename = fullname; if (plugin.gatherInfo()) plugin_list.push_back(plugin); } } } madman-0.93/utility/prefs.cpp0000644000175000001440000002020410053135241015772 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "utility/player.h" #include "utility/plugin.h" #include "utility/prefs.h" #include "database/song.h" namespace { void addAutoDJScoringRule(const QString &comment, const QString &criterion, int score, tAutoDJPreferences &prefs) { tAutoDJScoringRule adj; adj.Comment = comment; adj.Criterion = criterion; adj.ScoreAdjustment = score; prefs.ScoringRuleList.push_back(adj); } } // tAutoDJPreferences --------------------------------------------------------- void tAutoDJPreferences::resetToDefault() { ScoringRuleList.clear(); addAutoDJScoringRule("Baseline score", "~all", 5, *this); addAutoDJScoringRule("Unrated", "~unrated", 5, *this); addAutoDJScoringRule("Rated '*****'", "~rating(5)", 15, *this); addAutoDJScoringRule("Rated '****'", "~rating(4)", 12, *this); addAutoDJScoringRule("Rated '***'", "~rating(3)", 8, *this); addAutoDJScoringRule("Rated '**'", "~rating(2)", 5, *this); addAutoDJScoringRule("Rated '*'", "~rating(1)", 3, *this); addAutoDJScoringRule("Rated '-'", "~rating(0)", -10, *this); addAutoDJScoringRule("Unplayed", "~play_count(0)", 4, *this); addAutoDJScoringRule("Played within an hour", "~last_played_n_days_ago(<=0.04166)", -10, *this); addAutoDJScoringRule("Played within 24 hours", "~last_played_n_days_ago(<=1)&~last_played_n_days_ago(>0.04166)", -5, *this); addAutoDJScoringRule("Played within 3 days", "~last_played_n_days_ago(<=3)&~last_played_n_days_ago(>1)", -3, *this); addAutoDJScoringRule("Played within a week", "~last_played_n_days_ago(<=7)&~last_played_n_days_ago(>3)", -1, *this); addAutoDJScoringRule("Not played for a month", "~last_played_n_days_ago(>=30)&~last_played_n_days_ago(<60)", 3, *this); addAutoDJScoringRule("Not played for two months", "!~last_played_n_days_ago(>60)", 6, *this); addAutoDJScoringRule("Often played to the end", "~play_count(>=4)&~full_play_ratio(>0.5)", 5, *this); addAutoDJScoringRule("Rarely played to the end", "~play_count(>=4)&~full_play_ratio(<0.3)", -5, *this); addAutoDJScoringRule("Played more than three times", "~play_count(>=3)", 3, *this); addAutoDJScoringRule("Less than a week old", "~existed_for_days(<= 7)", 10, *this); addAutoDJScoringRule("Less than two weeks old", "~existed_for_days(<= 14)", 5, *this); addAutoDJScoringRule("Less than three weeks old", "~existed_for_days(<= 21)", 3, *this); } // tPreferences --------------------------------------------------------------- void tPreferences::save(QSettings &settings) { settings.writeEntry("/madman/player", Player.name()); #define WRITE_BOOL(SETTING, VARIABLE) \ settings.writeEntry("/madman/" SETTING, VARIABLE ? 1 : 0); QStringList plugin_dirs = stringvector2QStringList(PluginDirectories); settings.writeEntry("/madman/plugin_directories", plugin_dirs); WRITE_BOOL("remember_geometry", RememberGeometry); WRITE_BOOL("scan_at_startup", ScanAtStartup); WRITE_BOOL("collect_history", CollectHistory); WRITE_BOOL("enable_tray_icon", EnableSystemTrayIcon); WRITE_BOOL("enable_system_tray_icon", EnableSystemTrayIcon); WRITE_BOOL("minimize_to_system_tray", MinimizeToSystemTray); WRITE_BOOL("enable_passive_popup_song_announcements", EnablePassivePopupSongAnnouncements); settings.writeEntry("/madman/number_of_backups_kept", BackupCount); WRITE_BOOL("http_daemon_enabled", HttpDaemonEnabled); settings.writeEntry("/madman/http_server_port", HttpDaemonPort); WRITE_BOOL("http_downloads_enabled", HttpDownloadsEnabled); WRITE_BOOL("http_scripting_enabled", HttpScriptingEnabled); WRITE_BOOL("http_write_scripting_enabled", HttpWriteScriptingEnabled); WRITE_BOOL("http_local_play_enabled", HttpLocalPlayEnabled); WRITE_BOOL("http_browsing_enabled", HttpBrowsingEnabled); WRITE_BOOL("http_restrict_to_localhost", HttpRestrictToLocalhost); settings.writeEntry("/madman/tray_tooltip_format", TrayTooltipFormat ); settings.writeEntry("/madman/passive_popup_format", PassivePopupFormat); unsigned i = 0; settings.writeEntry("/madman/auto_dj/score_adjustment_count", (int) AutoDJPreferences.ScoringRuleList.size()); FOREACH_CONST(first, AutoDJPreferences.ScoringRuleList, tAutoDJScoringRuleList) { const tAutoDJScoringRule &adj(*first); settings.writeEntry(QString("/madman/auto_dj/score_adjustment.%1.comment").arg(i), adj.Comment); settings.writeEntry(QString("/madman/auto_dj/score_adjustment.%1.criterion").arg(i), adj.Criterion); settings.writeEntry(QString("/madman/auto_dj/score_adjustment.%1.score").arg(i), adj.ScoreAdjustment); i++; } } void tPreferences::load(QSettings &settings) { QString player_name = settings.readEntry("/madman/player"); tPlayer * new_player = createPlayer(player_name); if (!new_player) { vector players; listPlayers(players); if (players.size()) new_player = createPlayer(players[0]); if (!new_player) throw runtime_error("can't instantiate any player, giving up."); } setPlayer(new_player); bool ok; PluginDirectories = QStringList2stringvector(settings.readListEntry("/madman/plugin_directories", &ok)); if (!ok) { PluginDirectories.clear(); PluginDirectories.push_back(STRINGIFY(MADMAN_LIBDIR) "/madman/plugins"); } #define READ_BOOL(SETTING, VARIABLE, DEFAULT) \ VARIABLE = settings.readNumEntry("/madman/" SETTING, DEFAULT); READ_BOOL("remember_geometry", RememberGeometry, 1); READ_BOOL("scan_at_startup", ScanAtStartup, 0); READ_BOOL("collect_history", CollectHistory, 1); READ_BOOL("enable_system_tray_icon", EnableSystemTrayIcon, 1); READ_BOOL("minimize_to_system_tray", MinimizeToSystemTray, 0); READ_BOOL("enable_passive_popup_song_announcements", EnablePassivePopupSongAnnouncements, 1); BackupCount = settings.readNumEntry("/madman/number_of_backups_kept", 4); READ_BOOL("http_daemon_enabled", HttpDaemonEnabled, 0); HttpDaemonPort = settings.readNumEntry("/madman/http_server_port", 51533); READ_BOOL("http_downloads_enabled", HttpDownloadsEnabled, 1); READ_BOOL("http_scripting_enabled", HttpScriptingEnabled, 1); READ_BOOL("http_write_scripting_enabled", HttpWriteScriptingEnabled, 1); READ_BOOL("http_local_play_enabled", HttpLocalPlayEnabled, 1); READ_BOOL("http_browsing_enabled", HttpBrowsingEnabled, 1); READ_BOOL("http_restrict_to_localhost", HttpRestrictToLocalhost, 1); TrayTooltipFormat = settings.readEntry("/madman/tray_tooltip_format", "madman: %artist% - %title%"); PassivePopupFormat = settings.readEntry("/madman/passive_popup_format", "%artist%%newline%%title%"); unsigned criteria_count = settings.readNumEntry("/madman/auto_dj/score_adjustment_count", 0); if (criteria_count == 0) AutoDJPreferences.resetToDefault(); else { for (unsigned i = 0; i < criteria_count; i++) { tAutoDJScoringRule adj; adj.Comment = settings.readEntry( QString("/madman/auto_dj/score_adjustment.%1.comment").arg(i), ""); adj.Criterion = settings.readEntry( QString("/madman/auto_dj/score_adjustment.%1.criterion").arg(i), ""); adj.ScoreAdjustment = settings.readNumEntry( QString("/madman/auto_dj/score_adjustment.%1.score").arg(i), 0); if (adj.ScoreAdjustment < adj.ScorePlayNever) adj.ScoreAdjustment = adj.ScorePlayNever; if (adj.ScoreAdjustment > adj.ScoreMaximum) adj.ScoreAdjustment = adj.ScoreMaximum; AutoDJPreferences.ScoringRuleList.push_back(adj); } } } void tPreferences::setPlayer(tPlayer *newplayer) { Player.setBackend(newplayer); } madman-0.93/utility/scanner.cpp0000644000175000001440000000363510053135241016315 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "base.h" #include "scanner.h" void tScanner::addTokenDescriptor( int type, const QString &pattern, bool minimal, bool ignore, unsigned flags ) { tTokenDescriptor d; d.TokenType = type; d.RegExp = "^"+pattern; d.RegExp.setMinimal( minimal ); d.Ignore = ignore; d.Flags = flags; TokenDescriptorList.push_back( d ); } void tScanner::scan( const QString &victim, tTokenList &tokenlist ) { int index = 0; tokenlist.clear(); while ( index < (int) victim.length() ) { bool found_a_token = false; FOREACH_CONST( first, TokenDescriptorList, tTokenDescriptorList ) { if ( first->RegExp.search( victim.mid( index ) ) != -1 ) { if ( !first->Ignore ) { tToken token; token.TokenType = first->TokenType; token.Flags = first->Flags; token.Text = victim.mid( index, first->RegExp.matchedLength() ); tokenlist.push_back( token ); } index += first->RegExp.matchedLength(); found_a_token = first->RegExp.matchedLength() > 0; if ( found_a_token ) break; } } if (!found_a_token) throw runtime_error( "invalid token at: " + QString2string( victim.mid( index, 20 ) ) ); } } madman-0.93/utility/SConscript0000644000175000001440000000070010053135242016161 0ustar akusers00000000000000Import( "env" ) myenv = env.Copy() myenv.Tool( "qt" ) myenv[ "CPPDEFINES" ].append( ( "MADMAN_LIBDIR", "$prefix/lib" ) ) myenv.Append( CPPPATH = "#" ) myenv.Append( CPPPATH = myenv[ 'QT_CPPPATH' ] ) myenv.Append( CPPPATH = myenv[ 'XMMS_CPPPATH' ] ) myenv.StaticLibrary( target = "madmanutility", source = [ "base.cpp", "mp3tech.c", "player.cpp", "player_xmms.cpp", "prefs.cpp", "plugin.cpp", "scanner.cpp", "vcedit.c", "mt_random.cpp" ] ) madman-0.93/database/0000755000175000001440000000000010053135242014213 5ustar akusers00000000000000madman-0.93/database/auto_dj.h0000644000175000001440000000370510053135241016015 0ustar akusers00000000000000/* * madman - a music manager * * auto_dj.h Copyright 2003 Shawn Willden * * 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 HEADER_SEEN_AUTODJ_H #define HEADER_SEEN_AUTODJ_H // Local includes #include "utility/base.h" // Forward declarations to avoid #includes class QString; class tAutoDJPreferences; class tSong; class tSongSet; class tAutoDJ { public: tAutoDJ(const tAutoDJPreferences& prefs, const tSongSet* song_set); ~tAutoDJ(); // Change the songs or preferences used by this DJ void setSongs(const tSongSet *song_set); void setPreferences(const tAutoDJPreferences& prefs); // Select one song, or a set of songs const tSong *selectSong(); void selectSongs(tSongList& result, unsigned count); private: void addCriterion(const QString& criterion, int weight); float score(const tSong *song) const; void clearCompiledScoringRules(); void clearScores(); void calculateScores(); void checkInvariant() const; struct tAutoDJImpl* const pimpl; }; #endif // AutoDJ_h // Stuff to tell EMACS how to format this file. // Local Variables: // mode: C++ // eval: (c-set-style "stroustrup") // eval: (c-set-offset 'access-label -2) // eval: (c-set-offset 'inline-open 0) // c-basic-offset: 4 // tab-width: 8 // End: madman-0.93/database/criterion.h0000644000175000001440000000433310053135241016364 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2004 Andreas Kloeckner 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 HEADER_SEEN_CRITERION_H #define HEADER_SEEN_CRITERION_H #include "utility/base.h" class tSong; class tSongSet; // tCriterion ----------------------------------------------------------------- class tCriterion { public: virtual ~tCriterion() { } virtual float matchDegree(const tSong *song) const = 0; }; class tInSetCriterion : public tCriterion { tSongSet *SongSet; public: tInSetCriterion(tSongSet *ss); float matchDegree(const tSong *song) const; }; class tOrCriterion : public tCriterion { auto_ptr Operand1,Operand2; public: tOrCriterion(tCriterion *op1, tCriterion *op2) : Operand1(op1), Operand2(op2) { } float matchDegree(const tSong *song) const { return max(Operand1->matchDegree(song), Operand2->matchDegree(song)); } }; class tAndCriterion : public tCriterion { auto_ptr Operand1,Operand2; public: tAndCriterion(tCriterion *op1, tCriterion *op2) : Operand1(op1), Operand2(op2) { } float matchDegree(const tSong *song) const { return min(Operand1->matchDegree(song), Operand2->matchDegree(song)); } }; class tNotCriterion : public tCriterion { auto_ptr Operand; public: tNotCriterion(tCriterion *op) : Operand(op) { } float matchDegree(const tSong *song) const { return 1 - Operand->matchDegree(song); } }; auto_ptr parseCriterion(QString criterion); #endif madman-0.93/database/database.h0000644000175000001440000000316110053135241016130 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 DATABASE_H_SEEN #define DATABASE_H_SEEN #include "utility/noncopyable.h" #include "database/song_collection.h" #include "database/song_set.h" #include "database/song_set_tree.h" #include "database/history.h" class tProgress; class tDatabase : public QObject, public tNoncopyable { Q_OBJECT auto_ptr PlaylistTree; public: tDirectoryList DirectoryList; tSongCollection SongCollection; tHistory History; tDatabase(); tPlaylistNode *playlistTree() { return PlaylistTree.get(); } void setPlaylistTree(tPlaylistNode *node); void clear(); void startNew(); void load(const QString &filename, tProgress *progress = NULL); void save(const QString &filename, tProgress *progress = NULL); void noticePlaylistTreeChanged(); signals: void notifyPlaylistTreeChanged(); }; #endif madman-0.93/database/history.h0000644000175000001440000000235310053135241016067 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 HEADER_SEEN_HISTORY_H #define HEADER_SEEN_HISTORY_H #include "utility/base.h" #include struct tHistoryEntry { tUniqueId UniqueId; time_t Time; double PlayDuration; }; class tHistory { private: typedef vector tHistoryList; tHistoryList HistoryList; public: void played(tUniqueId id, time_t when, double duration); void clear(); QDomNode serialize(QDomDocument &doc); void deserialize(QDomNode &tag); }; #endif madman-0.93/database/song.h0000644000175000001440000001153410053135241015335 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 SONG #define SONG #include #include #include #include "utility/base.h" #define SONG_UID_INVALID (-1) enum tSongField { FIELD_ARTIST = 0, FIELD_PERFORMER = 1, FIELD_TITLE = 2, FIELD_ALBUM = 3, FIELD_TRACKNUMBER = 4, FIELD_DURATION = 5, FIELD_GENRE = 6, FIELD_FULLPLAYCOUNT = 7, FIELD_PARTIALPLAYCOUNT = 8, FIELD_PLAYCOUNT = 9, FIELD_LASTPLAYED = 10, FIELD_RATING = 11, FIELD_YEAR = 12, FIELD_FILE = 13, FIELD_PATH = 14, FIELD_SIZE = 15, FIELD_EXISTSSINCE = 16, FIELD_LASTMODIFIED = 17, FIELD_MIMETYPE = 18, FIELD_UNIQUEID = 19, FIELD_REAL_COUNT = 20, FIELD_EXTRA_FIRST = (FIELD_REAL_COUNT), FIELD_COUNT = (FIELD_REAL_COUNT + 0) }; const int GENRE_COUNT = 126; QString genreIdToString(int genre); QString getFieldName(tSongField field); QString getFieldIdentifier(tSongField field); tSongField getFieldFromIdentifier(const QString &field); QString substituteSongFields(QString const &format, tSong *song, bool human_readable, bool shell_quote = false); class tSongCollection; class tSong { protected: typedef vector tDirectoryList; static tDirectoryList DirectoryList; tFilename FilenameOnly; unsigned IndexIntoDirectoryList; tUniqueId UniqueId; tSongCollection *SongCollection; QString Album, Artist, Performer, Title, Year, Genre, TrackNumber; float Duration; long int FileSize; time_t ExistsSince; time_t LastPlayed, LastModified; int FullPlayCount,PartialPlayCount; // -1 if unspecified int Rating; mutable bool CacheValid; public: tSong(); virtual ~tSong(); tFilename filename() const; tFilename pathname() const; tFilename filenameOnly() const; tUniqueId uniqueId() const; QString album() const; QString artist() const; QString performer() const; QString title() const; QString year() const; QString genre() const; QString trackNumber() const; float duration() const; time_t existsSince() const; time_t lastModified() const; time_t lastPlayed() const; int playCount() const; int fullPlayCount() const; int partialPlayCount() const; int rating() const; int fileSize() const; virtual QString mimeType() const = 0 ; virtual QDomNode serialize(QDomDocument &doc) const; virtual void deserialize(const char **attributes); void setUniqueId(tUniqueId id); void setFilename(tFilename const &filename); void invalidateCache(); virtual void setAlbum(QString const &value) = 0; virtual void setArtist(QString const &value) = 0; virtual void setPerformer(QString const &value) = 0; virtual void setTitle(QString const &value) = 0; virtual void setYear(QString const &value) = 0; virtual void setGenre(QString const &value) = 0; virtual void setTrackNumber(QString const &value) = 0; void setExistsSince(time_t value); void setLastModified(time_t value); void setLastPlayed(time_t value); void setFullPlayCount(unsigned value); void setPartialPlayCount(unsigned value); void setRating(int value); QString fieldText(tSongField field) const; QString humanReadableFieldText(tSongField field) const; void setFieldText(tSongField field, const QString &new_text); void stripTag(); void rewriteTag(); void ensureInfoIsThere() const; /* tSong::readInfo needs to be called *after* any information * has been read by the subclass. */ virtual void readInfo() const; void played(time_t when, bool full); void resetStatistics(); void setCollection(tSongCollection *collection); protected: virtual void stripTagInternal() = 0; }; // song factories ------------------------------------------------------------- tSong *makeSong(const tFilename &filename); tSong *deserializeSong(const char **attributes); #endif // Stuff to tell EMACS how to format this file. // Local Variables: // mode: C++ // eval: (c-set-style "stroustrup") // eval: (c-set-offset 'access-label -2) // eval: (c-set-offset 'inline-open 0) // c-basic-offset: 4 // tab-width: 8 // End: madman-0.93/database/song_collection.h0000644000175000001440000000611110053135241017543 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 SONG_COLLECTION #define SONG_COLLECTION #include #include #include "song.h" class tProgress; class tSongCollection : public QObject { Q_OBJECT typedef hash_map tUniqueIdMap; typedef hash_map tFilenameMap; tSongList SongList; tSongList Orphans; tSongList New; tUniqueIdMap UniqueIdMap; tFilenameMap FilenameMap; tUniqueId NextUniqueId; public: typedef tSongList::iterator iterator; typedef tSongList::const_iterator const_iterator; tSongCollection(); const_iterator begin() const { return SongList.begin(); } const_iterator end() const { return SongList.end(); } public slots: void readTags(tProgress *progress, const QString &progresstext = "Reading tags...", tSongList *list = NULL); void rereadTags(tProgress *progress); void scan(tDirectoryList const &dl, tProgress *progress); void insert(tSong *song, bool loaded); void remove(tSong *song); void clear(); void noticeSongModified(const tSong *song, tSongField field); void noticeSongFilenameAboutToChange(tSong *song, const tFilename &old, const tFilename ¤t); void beginBulkChange(); void endBulkChange(); public: QDomNode serialize(QDomDocument &doc) const; tSong *getByFilename(const tFilename &filename) const; tSong *getByUniqueId(tUniqueId uid) const; bool isValid(const tSong *song) const; signals: void notifyBeginBulkChange(); void notifyEndBulkChange(); void notifyAddition(const tSong *song); void notifyDeletion(const tSong *song); void notifyLoad(const tSong *song); void notifySongModified(const tSong *song, tSongField field); private: tUniqueId nextUniqueId(); void scanSingleDirectory(tFilename const &dir, tProgress *progress); // make this type noncopyable tSongCollection(const tSongCollection &src); tSongCollection &operator=(const tSongCollection &src); }; class tSongCollectionScopedBulkChange { tSongCollection &Collection; public: tSongCollectionScopedBulkChange(tSongCollection &collection) : Collection(collection) { Collection.beginBulkChange(); } ~tSongCollectionScopedBulkChange() { Collection.endBulkChange(); } }; #endif madman-0.93/database/song_list_tools.h0000644000175000001440000000254510053135241017612 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 HEADER_SEEN_DATABASE_SONG_LIST_TOOLS_H #define HEADER_SEEN_DATABASE_SONG_LIST_TOOLS_H #include "database/song.h" void sort(tSongList &list, tSongField field); struct tSongListSummary { double DurationTotal; unsigned DurationDays; unsigned DurationHours; unsigned DurationMinutes; unsigned DurationSeconds; /** Total size in megabytes. */ double SizeTotal; unsigned Count; QString FirstFilename; }; tSongListSummary getSongListSummary(tSongList &list); QString stringifySongListSummary(const tSongListSummary &sum); QString stringifySongListSummary(tSongList &list); #endif madman-0.93/database/song_set.h0000644000175000001440000001320710053135241016207 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 _HEADER_SEEN_SONGSET_H #define _HEADER_SEEN_SONGSET_H #include #include #include "song_collection.h" // tSongSet ------------------------------------------------------------------- class tProgress; class tCriterion; class tSongSet : public QObject { Q_OBJECT protected: tSongCollection *SongCollection; QString Criterion; auto_ptr ParsedCriterion; int BulkChangeLevel; bool SubstantialBulkChange; public: tSongSet(); virtual ~tSongSet(); /** This subroutine first clears the content of this song * set, then switches over to the new collection, then * reevaluates the criterion. */ void setSongCollection(tSongCollection *collection); virtual tSongSet &operator=(const tSongSet &src); virtual void render(tSongList &rendering, tProgress *progess = NULL ) const = 0; void render(tConstSongList &rendering, tProgress *progess = NULL ) const; void renderToUniqueIdList(tUniqueIdList &rendering, tProgress *progess = NULL ); virtual bool containsSong(tUniqueId uid) const = 0; virtual void clear(bool criterion); // criterion management --------------------------------------------------- QString const &criterion() const { return Criterion; } /// will free the criterion when destroyed void setCriterion(tCriterion *crit); void setCriterion(const QString &crit); virtual void reevaluateCriterion(tProgress *progess = NULL) = 0; signals: void notifyChange(bool substanial_change, tProgress *progress); void notifySongModified(const tSong *song, tSongField field); protected slots: virtual void noticeCollectionSwitched() = 0; virtual void noticeCollectionBeginBulkChange() = 0; virtual void noticeCollectionEndBulkChange() = 0; virtual void noticeCollectionAddition(const tSong *song) = 0; virtual void noticeCollectionDeletion(const tSong *song) = 0; virtual void noticeSongModified(const tSong *tSong, tSongField field) = 0; // change management -------------------------------------------------------- public: void beginBulkChange(); void endBulkChange(); protected: void hasChanged(bool substantial_change, tProgress *progress = NULL); private: // disabled tSongSet(const tSongSet &src); }; class tSearchSongSet : public tSongSet { bool DoSort; tSongField SortField; bool Ascending; tSongList Rendering; tSongList SortedAndUnrestricted; bool SAUDirty; int CollectionBulkChangeLevel; public: tSearchSongSet(); void reevaluateCriterion(tProgress *progess = NULL); void render(tSongList &rendering, tProgress *progess = NULL ) const; void setSort(bool do_sort, tSongField field = FIELD_ARTIST, bool ascending = true); void rebuildSortedAndUnrestricted(); bool containsSong(tUniqueId uid) const; protected: void noticeCollectionSwitched(); void noticeCollectionBeginBulkChange(); void noticeCollectionEndBulkChange(); void noticeCollectionAddition(const tSong *song); void noticeCollectionDeletion(const tSong *song); void noticeSongModified(const tSong *tSong, tSongField field); }; class tPlaylist : public tSongSet { Q_OBJECT; tSongList Rendering; tUniqueIdSet RenderingSet,PositiveSet,NegativeSet; public: tPlaylist &operator=(const tPlaylist &src); void sortBy(tSongField field, bool ascending = true); void jumble(); void reverse(); void clear(bool criterion); void reevaluateCriterion(tProgress *progess = NULL); void render(tSongList &rendering, tProgress *progess = NULL ) const; void add(tSong *song, int preferred_index = -1); void add(const tFilename &filename, int preferred_index = -1); void remove(int index); void remove(tSong *song); bool containsSong(tUniqueId uid) const { return RenderingSet.count(uid) != 0; } protected slots: void noticeCollectionSwitched(); void noticeCollectionBeginBulkChange(); void noticeCollectionEndBulkChange(); void noticeCollectionAddition(const tSong *song); void noticeCollectionDeletion(const tSong *song); void noticeSongModified(const tSong *tSong, tSongField field); public: QDomNode serialize(QDomDocument &doc); void setRendering(const tUniqueIdList &list); void setPositiveSet(const tUniqueIdList &list); void setNegativeSet(const tUniqueIdList &list); protected: void addToRendering(const tSong *song, int preferred_index = -1); void removeFromRendering(const tSong *song); void removeFromRendering(int index); }; void importM3UIntoPlaylist(tPlaylist *song_set, const QString &filename); #endif // Stuff to tell EMACS how to format this file. // Local Variables: // mode: C++ // eval: (c-set-style "stroustrup") // eval: (c-set-offset 'access-label -2) // eval: (c-set-offset 'inline-open 0) // c-basic-offset: 4 // tab-width: 8 // End: madman-0.93/database/song_set_tree.h0000644000175000001440000000364610053135241017234 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 SONG_SET_TREE #define SONG_SET_TREE #include "song_set.h" class tDatabase; class tPlaylistNode { QString Name; tPlaylistNode *Parent; typedef vector tChildrenList; tChildrenList ChildrenList; tPlaylist *Data; tDatabase *Database; public: typedef tChildrenList::iterator iterator; tPlaylistNode(tDatabase *db, tPlaylist *data); ~tPlaylistNode(); iterator begin() { return ChildrenList.begin(); } iterator end() { return ChildrenList.end(); } tPlaylistNode *parent(); void addChild(tPlaylistNode *node); void insertChild(tPlaylistNode *node, iterator it); void removeChild(tPlaylistNode *node); void clear(); QString qualifiedName(); tPlaylistNode *resolve(const QString &name); bool hasParent(tPlaylistNode *node); QString const &name(); void setName(QString const &name); tPlaylist *data(); void setData(tPlaylist *data); QDomNode serialize(QDomDocument &doc); private: // make this type noncopyable tPlaylistNode(const tPlaylistNode &src); tPlaylistNode &operator=(const tPlaylistNode &src); }; #endif madman-0.93/database/auto_dj.cpp0000644000175000001440000002530510053135241016350 0ustar akusers00000000000000/* * madman - a music manager * * auto_dj.cpp * Copyright 2003 Shawn Willden * Copyright 2003 Andreas Kloeckner * * 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 */ // Standard C includes #include #include #include #include #include #include // Standard C++ includes #include #include // Local includes #include "auto_dj.h" #include "database/criterion.h" #include "song_set.h" #include "utility/mt_random.h" #include "utility/prefs.h" #include "utility/refcnt_ptr.h" namespace // To make these types local to this file. { class tCompiledScoringRule { public: refcnt_ptr Criterion; int ScoreAdjustment; }; typedef std::vector tCompiledScoringRuleList; } // tAutoDJ -------------------------------------------------------------------- class tAutoDJImpl { public: tAutoDJImpl() : SongSet(NULL), TotalScoreSum(-1) { RNG.sgenrand(time(NULL)); } const tSongSet *SongSet; tCompiledScoringRuleList CompiledScoringRules; tConstSongList Songs; std::vector SongScores; /** ScoreSums[i] records the score sum through the i * IndexInterval'th * song. e.g., if IndexInterval is three: * * 

     *    5 ---> ScoreSums[ 0 ] == 5
     *    7
     *    3
     *    3 ---> ScoreSums[ 1 ] == 18
     *    2
     *    4
     *    6 ---> ScoreSums[ 2 ] == 30
     *
*/ std::vector ScoreSums; double TotalScoreSum; mutable mtRand RNG; }; tAutoDJ::tAutoDJ(const tAutoDJPreferences& prefs, const tSongSet *song_set) : pimpl(new tAutoDJImpl) { setPreferences(prefs); setSongs(song_set); } tAutoDJ::~tAutoDJ() { clearScores(); delete pimpl; } void tAutoDJ::setSongs(const tSongSet *song_set) { pimpl->SongSet = song_set; clearScores(); } void tAutoDJ::setPreferences(const tAutoDJPreferences& prefs) { clearCompiledScoringRules(); FOREACH_CONST(first, prefs.ScoringRuleList, tAutoDJScoringRuleList) addCriterion(first->Criterion, first->ScoreAdjustment); } void tAutoDJ::clearScores() { pimpl->TotalScoreSum = -1; pimpl->Songs.clear(); pimpl->SongScores.clear(); pimpl->ScoreSums.clear(); } void tAutoDJ::clearCompiledScoringRules() { pimpl->CompiledScoringRules.clear(); clearScores(); } void tAutoDJ::selectSongs(tSongList &result, unsigned count) { while (count-- > 0) { const tSong* song = selectSong(); if (!song) break; result.push_back(const_cast(song)); } } void tAutoDJ::addCriterion(const QString &criterion, int score_adj) { tCompiledScoringRule adj; adj.Criterion = parseCriterion(criterion); adj.ScoreAdjustment = score_adj; pimpl->CompiledScoringRules.push_back(adj); } float tAutoDJ::score(const tSong *song) const { float score = 0; FOREACH_CONST(iter, pimpl->CompiledScoringRules, tCompiledScoringRuleList) { float match_degree = iter->Criterion->matchDegree(song); if (match_degree >= .5 && iter->ScoreAdjustment == tAutoDJScoringRule::ScorePlayNever) return 0; score += match_degree * iter->ScoreAdjustment; } return score; } inline void tAutoDJ::checkInvariant() const { assert(pimpl->Songs.size() == pimpl->SongScores.size()); } // Index every IndexInterval'th song. The ideal value of // IndexInterval should be determined somehow, it's a tradeoff between // search efficiency (since to find any song not in the index we have // to search through at most IndexInterval songs) and update // efficiency (since when we change a song score we have to update // every succeeding indexed song). We'll use a power of two. #ifndef NDEBUG static const int IndexInterval = 5; #else static const int IndexInterval = 128; #endif void tAutoDJ::calculateScores() { checkInvariant(); // We have at least attempted to calculate some ratings. pimpl->TotalScoreSum = 0; if (pimpl->SongSet == 0 || pimpl->CompiledScoringRules.size() == 0) // We have no song map, or we have no adjustments. Give up. return; tConstSongList list; pimpl->SongSet->render(list); if (list.size() == 0) // No songs. Give up. return; // Iterate through all songs, calculating ratings for each. FOREACH(iter, list, tConstSongList) { const tSong *song = *iter; float song_score = score(song); // Ignore songs with a non-positive score. if (song_score > 0) { pimpl->Songs.push_back(song); pimpl->SongScores.push_back(song_score); pimpl->TotalScoreSum += song_score; int last_song_index = pimpl->Songs.size() - 1; // Note that the first time through the loop, last_song_index == 0 // so the score of the very first song in the list is always in // ScoreSums. if (last_song_index % IndexInterval == 0) pimpl->ScoreSums.push_back(pimpl->TotalScoreSum); } } #ifndef NDEBUG { // This is horribly inefficient, but it's just for debugging, so who cares. unsigned dropouts = list.size() - pimpl->Songs.size(); float max_score = - FLT_MAX; float min_score = FLT_MAX; FOREACH(first, pimpl->SongScores, vector) { if (max_score < *first) max_score = *first; if (min_score > *first) min_score = *first; } cout << "autodj score calculation statistics" << endl << "-----------------------------------" << endl << "songs eliminated from selection list: " << dropouts << " out of " << list.size() << endl << "maximum score: " << max_score << endl << "minimum score: " << min_score << endl << "average score: " << pimpl->TotalScoreSum / (list.size() - dropouts) << endl; int min_s_int = int(min_score), max_s_int = int(max_score); for (int score = min_s_int; score <= max_s_int; score++) { unsigned count = 0; tUniqueId example_id = 0; for (unsigned i = 0; i < pimpl->Songs.size(); i++) { if (int(pimpl->SongScores[ i ]) == score) { ++count; example_id = pimpl->Songs[ i ]->uniqueId(); } } double fraction = double(count) / (list.size() - dropouts); cout << "score " << setw(2) << score << ": " << setw(5) << count << " " << "(e.g. id " << setw(5) << example_id << ") " << string(int(fraction * 70), '*') << endl; } } #endif // not NDEBUG checkInvariant(); } const tSong* tAutoDJ::selectSong() { checkInvariant(); if (pimpl->TotalScoreSum == -1) calculateScores(); if (pimpl->TotalScoreSum == 0) throw tRuntimeError("AutoDJ: All songs have zero or negative score. " "Unable to perform song selection."); // Pick a random offset into the ratings double which = pimpl->RNG.gendrand() * pimpl->TotalScoreSum; // Figure out which song it corresponds to std::vector::iterator i; i = std::lower_bound(pimpl->ScoreSums.begin(), pimpl->ScoreSums.end(), which); /* lower_bound gives us an iterator to the position at which the * value "which" could be inserted without violating the sort order. * * If we end up at the end(), our song is in the last hunk and we * can just back up from the end of the list. * * If we end up somewhere else, "i" points to the first score sum * that was equal or larger to the "which" value, so we've run past * the goal at that song and need to back up. * * Note that the i'th entry of the ScoreSums vector indexes the * running score sums through element i*IndexInterval of the Songs * vector, so having found a spot in ScoreSums, we can easily find * the corresponding location in Songs and SongScores. */ unsigned search_pos; double search_score_sum; if (i == pimpl->ScoreSums.end()) { search_score_sum = pimpl->TotalScoreSum; search_pos = pimpl->Songs.size() - 1; } else { search_score_sum = *i; search_pos = (i - pimpl->ScoreSums.begin()) * IndexInterval; } assert( search_score_sum > which ); do search_score_sum -= pimpl->SongScores[search_pos]; while ( which <= search_score_sum && --search_pos >= 0); if (search_pos < 0) { // Didn't find anything? List must have been empty. assert(pimpl->Songs.size() == 0); return NULL; } assert(pimpl->SongScores[ search_pos ] != 0); #ifndef NDEBUG { /* Verify through direct calculation that this is the right song. * Check the ScoreSums on the way up. */ double current_score_sum = 0; for (unsigned index = 0; index < pimpl->SongScores.size(); index++) { double new_score_sum = current_score_sum + pimpl->SongScores[ index ]; if ( current_score_sum <= which && which < new_score_sum) { // cout << "expecting " << index << ", got " << search_pos << endl; // cout << "real score sum " << current_score_sum << ", guessed " << search_score_sum << endl; assert(index == search_pos); } if (index % IndexInterval == 0 ) { double recorded_score_sum = pimpl->ScoreSums[ index / IndexInterval ]; // cout << "recorded score sum at index " << index << ":" << recorded_score_sum // << " vs. real: " << new_score_sum << endl; assert(fabs(recorded_score_sum - new_score_sum) < 1e-10); } current_score_sum = new_score_sum; } } #endif // not NDEBUG /* Change this song's rating to 0 to prevent re-selection. To do * this we have to change the entry in SongScores to 0 and also * update the values in ScoreSums and TotalRatingSum. */ // Just in case searchPos moved back past the previous index point, // move i to the first index point at or after search_pos. i = ( pimpl->ScoreSums.begin() + ( search_pos + IndexInterval - 1 ) / IndexInterval ); float rating = pimpl->SongScores[ search_pos ]; while (i != pimpl->ScoreSums.end()) *i++ -= rating; pimpl->TotalScoreSum -= rating; pimpl->SongScores[ search_pos ] = 0; return pimpl->Songs[ search_pos ]; } // Stuff to tell EMACS how to format this file. // // Local Variables: // mode: C++ // eval: (c-set-style "stroustrup") // eval: (c-set-offset 'access-label -2) // eval: (c-set-offset 'inclass '++) // c-basic-offset: 2 // tab-width: 8 // End: madman-0.93/database/criterion.cpp0000644000175000001440000006010510053135241016716 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2004 Andreas Kloeckner 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 "database/criterion.h" #include "database/song_set.h" #include "database/song.h" #include "utility/scanner.h" namespace { const int TOKEN_FLAG_DEPRECATED = 1; const int TT_CRIT_PAREN_OPEN = 0; const int TT_CRIT_PAREN_CLOSE = 1; const int TT_CRIT_NOT = 2; const int TT_CRIT_AND = 3; const int TT_CRIT_OR = 4; const int TT_CRIT_ALBUM_CRIT = 100; const int TT_CRIT_ARTIST_CRIT = 101; const int TT_CRIT_PERFORMER_CRIT = 102; const int TT_CRIT_FILENAME_CRIT = 103; const int TT_CRIT_TITLE_CRIT = 104; const int TT_CRIT_GENRE_CRIT = 105; const int TT_CRIT_ANY_CRIT = 106; const int TT_CRIT_ALL_CRIT = 107; const int TT_CRIT_NONE_CRIT = 108; const int TT_CRIT_RATING_CRIT = 109; const int TT_CRIT_PLAYCOUNT_CRIT = 110; const int TT_CRIT_EXISTEDFORDAYS_CRIT = 111; const int TT_CRIT_FULLPLAYRATIO_CRIT = 112; const int TT_CRIT_UNIQUEID_CRIT = 113; const int TT_CRIT_UNRATED_CRIT = 114; const int TT_CRIT_FULLPLAYCOUNT_CRIT = 115; const int TT_CRIT_PARTIALPLAYCOUNT_CRIT = 116; const int TT_CRIT_LASTPLAYEDNDAYSAGO_CRIT = 117; const int TT_CRIT_YEAR_CRIT = 118; const int TT_CRIT_TRACKNUMBER_CRIT = 119; const int TT_CRIT_COMPLETE_MATCH = 200; const int TT_CRIT_SUBSTRING_MATCH = 201; const int TT_CRIT_RE_MATCH = 202; const int TT_CRIT_FUZZY_MATCH = 203; const int TT_CRIT_NUM_LESS_MATCH = 204; const int TT_CRIT_NUM_LESSEQUAL_MATCH = 205; const int TT_CRIT_NUM_EQUAL_MATCH = 206; const int TT_CRIT_NUM_GREATER_MATCH = 207; const int TT_CRIT_NUM_GREATEREQUAL_MATCH = 208; const int TT_CRIT_STRING = 300; const int TT_CRIT_QUOTED_STRING = 301; class tCriterionScanner : public tScanner { public: tCriterionScanner() { addTokenDescriptor(TT_CRIT_PAREN_OPEN, "\\("); addTokenDescriptor(TT_CRIT_PAREN_CLOSE, "\\)"); addTokenDescriptor(TT_CRIT_NOT, "\\!"); addTokenDescriptor(TT_CRIT_AND, "\\&"); addTokenDescriptor(TT_CRIT_OR, "\\|"); addTokenDescriptor(TT_CRIT_ALBUM_CRIT, "\\~album"); addTokenDescriptor(TT_CRIT_ARTIST_CRIT, "\\~artist"); addTokenDescriptor(TT_CRIT_PERFORMER_CRIT, "\\~performer"); addTokenDescriptor(TT_CRIT_FILENAME_CRIT, "\\~filename"); addTokenDescriptor(TT_CRIT_TITLE_CRIT, "\\~title"); addTokenDescriptor(TT_CRIT_GENRE_CRIT, "\\~genre"); addTokenDescriptor(TT_CRIT_ANY_CRIT, "\\~any"); addTokenDescriptor(TT_CRIT_RATING_CRIT, "\\~rating"); addTokenDescriptor(TT_CRIT_PLAYCOUNT_CRIT, "\\~play_count"); addTokenDescriptor(TT_CRIT_EXISTEDFORDAYS_CRIT, "\\~existed_for_days"); addTokenDescriptor(TT_CRIT_FULLPLAYRATIO_CRIT, "\\~full_play_ratio"); addTokenDescriptor(TT_CRIT_UNIQUEID_CRIT, "\\~uniqueid"); addTokenDescriptor(TT_CRIT_UNRATED_CRIT, "\\~unrated"); addTokenDescriptor(TT_CRIT_FULLPLAYCOUNT_CRIT, "\\~full_play_count"); addTokenDescriptor(TT_CRIT_PARTIALPLAYCOUNT_CRIT, "\\~partial_play_count"); addTokenDescriptor(TT_CRIT_LASTPLAYEDNDAYSAGO_CRIT, "\\~last_played_n_days_ago"); addTokenDescriptor(TT_CRIT_YEAR_CRIT, "\\~year"); addTokenDescriptor(TT_CRIT_TRACKNUMBER_CRIT, "\\~track_number"); // deprecated non-underscore criteria addTokenDescriptor(TT_CRIT_PLAYCOUNT_CRIT, "\\~playcount", false, false, TOKEN_FLAG_DEPRECATED); addTokenDescriptor(TT_CRIT_EXISTEDFORDAYS_CRIT, "\\~existedfordays", false, false, TOKEN_FLAG_DEPRECATED); addTokenDescriptor(TT_CRIT_FULLPLAYRATIO_CRIT, "\\~fullplayratio", false, false, TOKEN_FLAG_DEPRECATED); addTokenDescriptor(TT_CRIT_ALL_CRIT, "\\~all(\b|$)"); addTokenDescriptor(TT_CRIT_NONE_CRIT, "\\~none(\b|$)"); addTokenDescriptor(TT_CRIT_COMPLETE_MATCH, "complete\\:"); addTokenDescriptor(TT_CRIT_SUBSTRING_MATCH, "substring\\:"); addTokenDescriptor(TT_CRIT_RE_MATCH, "re\\:"); addTokenDescriptor(TT_CRIT_FUZZY_MATCH, "fuzzy\\:"); addTokenDescriptor(TT_CRIT_NUM_LESSEQUAL_MATCH, "\\<\\="); addTokenDescriptor(TT_CRIT_NUM_GREATEREQUAL_MATCH, "\\>\\="); addTokenDescriptor(TT_CRIT_NUM_LESS_MATCH, "\\<"); addTokenDescriptor(TT_CRIT_NUM_EQUAL_MATCH, "\\="); addTokenDescriptor(TT_CRIT_NUM_GREATER_MATCH, "\\>"); addTokenDescriptor(TT_CRIT_FUZZY_MATCH, "fuzzy\\:"); addTokenDescriptor(TT_CRIT_STRING, "(\\w|[-.,/\\\\])+"); addTokenDescriptor(TT_CRIT_QUOTED_STRING, "\\\"([^\"]|\\\\\")*\\\""); // // whitespace addTokenDescriptor(0, "[ \n\r\t]+", true, true); // comments addTokenDescriptor(0, "\\{[^}]*\\}", true, true); } } CriterionScanner; } // criteria ------------------------------------------------------------------- namespace { class tTextCriterion { public: virtual ~tTextCriterion() { } virtual float match(const QString &str) = 0; }; class tNumericCriterion { public: virtual ~tNumericCriterion() { } virtual float match(double x) = 0; }; // text criteria -------------------------------------------------------------- class tFuzzyCriterion : public tTextCriterion { typedef hash_map tnGramTable; tnGramTable SmallNGramTable; tnGramTable BigNGramTable; QString Pattern; int PatternLength; static int const SmallN = 3; static int const BigN = 5; public: tFuzzyCriterion(const QString &op); float match(const QString &str); }; // only for odd n #define FOREACH_N_GRAM(STRING, N, OPERATION) \ { \ int strlength = STRING.length(); \ int nhalf = (N) / 2; \ { \ QString ngram = " " + STRING.mid(0, N - 1); \ OPERATION; \ } \ int i = nhalf; \ while (i < strlength - nhalf) \ { \ QString ngram = STRING.mid(i - nhalf, N);\ OPERATION; \ if (STRING[ i + nhalf ].isSpace()) \ i += (N) - 1; \ else \ i++; \ } \ { \ QString ngram = STRING.mid(strlength - ((N) - 1), (N) - 1) + " "; \ OPERATION; \ } \ } tFuzzyCriterion::tFuzzyCriterion(const QString &op) { Pattern = op; PatternLength = op.length(); FOREACH_N_GRAM(op, SmallN, SmallNGramTable[ ngram ] = 1;); FOREACH_N_GRAM(op, BigN, BigNGramTable[ ngram ] = 1;); } float tFuzzyCriterion::match(const QString &str) { if ((int) str.length() < SmallN) return 0; int small_matches = 0, big_matches = 0; FOREACH_N_GRAM(str, SmallN, if (SmallNGramTable.find(ngram) != SmallNGramTable.end()) small_matches++; ); FOREACH_N_GRAM(str, BigN, if (BigNGramTable.find(ngram) != BigNGramTable.end()) big_matches++;); float result = float(small_matches * SmallN + big_matches * BigN)/ float(SmallNGramTable.size() * SmallN + BigNGramTable.size() * BigN); if (result > 1) return 1; else return result; } class tSubstringCriterion : public tTextCriterion { private: QString Operand; public: tSubstringCriterion(const QString &op) : Operand(op) { } float match(const QString &str) { return str.find(Operand, 0, /* case sensitive */ false) != -1 ? 1 : 0; } }; class tCompleteCriterion : public tTextCriterion { private: QString Operand; public: tCompleteCriterion(const QString &op) : Operand(op.lower()) { } float match(const QString &str) { return (str.lower().startsWith( Operand) && str.length() == Operand.length()) ? 1 : 0; } }; class tRegexCriterion : public tTextCriterion { private: QRegExp Operand; public: tRegexCriterion(const QString &op) : Operand(op) { Operand.setCaseSensitive(false); } float match(const QString &str) { return Operand.search(str) ? 1 : 0; } }; // numeric criteria ----------------------------------------------------------- class tRelationalNumericCriterion : public tNumericCriterion { private: float ReferenceNumber; int TokenType; public: tRelationalNumericCriterion(double reference, int token_type) : ReferenceNumber(reference), TokenType(token_type) { } float match(double x) { switch (TokenType) { case TT_CRIT_NUM_LESS_MATCH: return x < ReferenceNumber ? 1 : 0; case TT_CRIT_NUM_LESSEQUAL_MATCH: return x <= ReferenceNumber ? 1 : 0; case TT_CRIT_NUM_EQUAL_MATCH: return x == ReferenceNumber ? 1 : 0; case TT_CRIT_NUM_GREATER_MATCH: return x > ReferenceNumber ? 1 : 0; case TT_CRIT_NUM_GREATEREQUAL_MATCH: return x >= ReferenceNumber ? 1 : 0; default: return 0; } } }; // criteria ------------------------------------------------------------------- class tAnyCriterion : public tCriterion { auto_ptr TextCriterion; public: tAnyCriterion(tTextCriterion *tc) : TextCriterion(tc) { } float matchDegree(const tSong *song) const { return TextCriterion->match(song->artist()) || TextCriterion->match(song->performer()) || TextCriterion->match(song->title()) || TextCriterion->match(song->album()) || TextCriterion->match(QString::fromUtf8(song->filenameOnly().c_str())); } }; class tArtistCriterion : public tCriterion { auto_ptr TextCriterion; public: tArtistCriterion(tTextCriterion *tc) : TextCriterion(tc) { } float matchDegree(const tSong *song) const { return TextCriterion->match(song->artist()); } }; class tPerformerCriterion : public tCriterion { auto_ptr TextCriterion; public: tPerformerCriterion(tTextCriterion *tc) : TextCriterion(tc) { } float matchDegree(const tSong *song) const { return TextCriterion->match(song->performer()); } }; class tAlbumCriterion : public tCriterion { auto_ptr TextCriterion; public: tAlbumCriterion(tTextCriterion *tc) : TextCriterion(tc) { } float matchDegree(const tSong *song) const { return TextCriterion->match(song->album()); } }; class tTitleCriterion : public tCriterion { auto_ptr TextCriterion; public: tTitleCriterion(tTextCriterion *tc) : TextCriterion(tc) { } float matchDegree(const tSong *song) const { return TextCriterion->match(song->title()); } }; class tGenreCriterion : public tCriterion { auto_ptr TextCriterion; public: tGenreCriterion(tTextCriterion *tc) : TextCriterion(tc) { } float matchDegree(const tSong *song) const { return TextCriterion->match(song->genre()); } }; class tFilenameCriterion : public tCriterion { auto_ptr TextCriterion; public: tFilenameCriterion(tTextCriterion *tc) : TextCriterion(tc) { } float matchDegree(const tSong *song) const { return TextCriterion->match(QString::fromUtf8(song->filename().c_str())); } }; class tRatingCriterion : public tCriterion { auto_ptr NumericCriterion; public: tRatingCriterion(tNumericCriterion *nc) : NumericCriterion(nc) { } float matchDegree(const tSong *song) const { return NumericCriterion->match(song->rating()); } }; class tUnratedCriterion : public tCriterion { public: float matchDegree(const tSong *song) const { return song->rating() == -1; } }; class tPlayCountCriterion : public tCriterion { auto_ptr NumericCriterion; public: tPlayCountCriterion(tNumericCriterion *nc) : NumericCriterion(nc) { } float matchDegree(const tSong *song) const { return NumericCriterion->match(song->playCount()); } }; class tExistedForDaysCriterion : public tCriterion { auto_ptr NumericCriterion; public: tExistedForDaysCriterion(tNumericCriterion *nc) : NumericCriterion(nc) { } float matchDegree(const tSong *song) const { time_t now = time(NULL); time_t song_added = song->existsSince(); double diff_in_days = (double) (now - song_added) / (3600. * 24); return NumericCriterion->match(diff_in_days); } }; class tFullPlayRatioCriterion : public tCriterion { auto_ptr NumericCriterion; public: tFullPlayRatioCriterion(tNumericCriterion *nc) : NumericCriterion(nc) { } float matchDegree(const tSong *song) const { if (song->playCount() == 0) return NumericCriterion->match(0); double ratio = (double) song->fullPlayCount() / (double) song->playCount(); return NumericCriterion->match(ratio); } }; class tUniqueIdCriterion : public tCriterion { auto_ptr NumericCriterion; public: tUniqueIdCriterion(tNumericCriterion *nc) : NumericCriterion(nc) { } float matchDegree(const tSong *song) const { return NumericCriterion->match(song->uniqueId()); } }; class tFullPlayCountCriterion : public tCriterion { auto_ptr NumericCriterion; public: tFullPlayCountCriterion(tNumericCriterion *nc) : NumericCriterion(nc) { } float matchDegree(const tSong *song) const { return NumericCriterion->match(song->fullPlayCount()); } }; class tPartialPlayCountCriterion : public tCriterion { auto_ptr NumericCriterion; public: tPartialPlayCountCriterion(tNumericCriterion *nc) : NumericCriterion(nc) { } float matchDegree(const tSong *song) const { return NumericCriterion->match(song->partialPlayCount()); } }; class tLastPlayedNDaysAgoCriterion : public tCriterion { auto_ptr NumericCriterion; public: tLastPlayedNDaysAgoCriterion(tNumericCriterion *nc) : NumericCriterion(nc) { } float matchDegree(const tSong *song) const { time_t now = time(NULL); time_t song_last_played = song->lastPlayed(); double diff_in_days = (double) (now - song_last_played) / (3600. * 24); return NumericCriterion->match(diff_in_days); } }; class tYearCriterion : public tCriterion { auto_ptr NumericCriterion; public: tYearCriterion(tNumericCriterion *nc) : NumericCriterion(nc) { } float matchDegree(const tSong *song) const { QRegExp extract_numbers("^\\s*([0-9]+)"); if (extract_numbers.search(song->year()) != -1) { int my_year = extract_numbers.cap(1).toInt(); return NumericCriterion->match(my_year); } else return false; } }; class tTrackNumberCriterion : public tCriterion { auto_ptr NumericCriterion; public: tTrackNumberCriterion(tNumericCriterion *nc) : NumericCriterion(nc) { } float matchDegree(const tSong *song) const { QRegExp extract_numbers("^\\s*([0-9]+)"); if (extract_numbers.search(song->trackNumber()) != -1) { int my_track_number = extract_numbers.cap(1).toInt(); return NumericCriterion->match(my_track_number); } else return false; } }; class tTrueCriterion : public tCriterion { public: float matchDegree(const tSong * /*song*/) const { return 1; } }; class tFalseCriterion : public tCriterion { public: float matchDegree(const tSong * /*song*/) const { return false; } }; } // tInSetCriterion ------------------------------------------------------------ tInSetCriterion::tInSetCriterion(tSongSet *ss) : SongSet(ss) { } float tInSetCriterion::matchDegree(const tSong *song) const { return SongSet->containsSong(song->uniqueId()); } // parsing -------------------------------------------------------------------- namespace { #define ADVANCE \ first++; \ if (first == last) \ throw runtime_error("unexpected end of expression"); #define EXPECT(WHAT,STRINGIFIED) \ if (first == last) \ throw runtime_error("unexpected end of expression"); \ if (first->TokenType != WHAT) \ throw tRuntimeError(qApp->translate("ErrorMessages", "Expected '%1', found '%2'.").arg(STRINGIFIED).arg(first->Text)); QString getText(tTokenList::iterator &first, tTokenList::iterator /*last*/) { if (first->TokenType == TT_CRIT_STRING) return (first++)->Text; else if (first->TokenType == TT_CRIT_QUOTED_STRING) { QString result = (first++)->Text; result = result.mid(1, result.length() - 2); // unquote string result.replace(QRegExp("\\\\\\\""), "\""); return result; } else { throw tRuntimeError(qApp->translate("ErrorMessages", "Expected string expression, found: '%1'.").arg(first->Text)); } } tNumericCriterion *parseNumericCriterion(tTokenList::iterator &first, tTokenList::iterator last) { double ref = 0; int token_type = TT_CRIT_NUM_EQUAL_MATCH; switch (first->TokenType) { case TT_CRIT_NUM_LESS_MATCH: case TT_CRIT_NUM_LESSEQUAL_MATCH: case TT_CRIT_NUM_EQUAL_MATCH: case TT_CRIT_NUM_GREATER_MATCH: case TT_CRIT_NUM_GREATEREQUAL_MATCH: token_type = first->TokenType; ADVANCE; default: bool ok; QString ref_num_string = getText(first, last); ref = ref_num_string.toDouble(&ok); if (!ok) throw tRuntimeError(qApp->translate("ErrorMessages", "Expected number, found: %1") .arg(ref_num_string)); } return new tRelationalNumericCriterion(ref, token_type); } tTextCriterion *parseTextCriterion(tTokenList::iterator &first, tTokenList::iterator last) { if (first->TokenType == TT_CRIT_COMPLETE_MATCH) { ADVANCE; return new tCompleteCriterion(getText(first, last)); } if (first->TokenType == TT_CRIT_SUBSTRING_MATCH) { ADVANCE; return new tSubstringCriterion(getText(first, last)); } if (first->TokenType == TT_CRIT_RE_MATCH) { ADVANCE; return new tRegexCriterion(getText(first, last)); } if (first->TokenType == TT_CRIT_FUZZY_MATCH) { ADVANCE; return new tFuzzyCriterion(getText(first, last)); } QString pattern = getText(first, last); return new tSubstringCriterion(pattern); } tCriterion *parseAtomicCriterion(tTokenList::iterator &first, tTokenList::iterator last) { #define PARSE_PAREN_TEXT_CRITERION(TOKENTYPE, CLASSNAME)\ if (first->TokenType == TOKENTYPE) \ { \ if (first->Flags & TOKEN_FLAG_DEPRECATED) \ { \ cerr << "*** WARNING *** the criterion " << first->Text \ << " has been deprecated." << endl \ << "Please take a look at the online help to find the new syntax." << endl; \ } \ ADVANCE; \ EXPECT(TT_CRIT_PAREN_OPEN, "')'"); \ ADVANCE; \ auto_ptr result(new CLASSNAME(parseTextCriterion(first, last))); \ EXPECT(TT_CRIT_PAREN_CLOSE, "')'"); \ first++; \ return result.release(); \ } PARSE_PAREN_TEXT_CRITERION(TT_CRIT_ALBUM_CRIT, tAlbumCriterion); PARSE_PAREN_TEXT_CRITERION(TT_CRIT_ARTIST_CRIT, tArtistCriterion); PARSE_PAREN_TEXT_CRITERION(TT_CRIT_PERFORMER_CRIT, tPerformerCriterion); PARSE_PAREN_TEXT_CRITERION(TT_CRIT_FILENAME_CRIT, tFilenameCriterion); PARSE_PAREN_TEXT_CRITERION(TT_CRIT_TITLE_CRIT, tTitleCriterion); PARSE_PAREN_TEXT_CRITERION(TT_CRIT_GENRE_CRIT, tGenreCriterion); PARSE_PAREN_TEXT_CRITERION(TT_CRIT_ANY_CRIT, tAnyCriterion); #define PARSE_PAREN_NUM_CRITERION(TOKENTYPE, CLASSNAME)\ if (first->TokenType == TOKENTYPE) \ { \ if (first->Flags & TOKEN_FLAG_DEPRECATED) \ { \ cerr << "*** WARNING *** the criterion " << first->Text \ << " has been deprecated." << endl \ << "Please take a look at the online help to find the new syntax." << endl; \ } \ ADVANCE; \ EXPECT(TT_CRIT_PAREN_OPEN, "'('"); \ ADVANCE; \ auto_ptr result(new CLASSNAME(parseNumericCriterion(first, last))); \ EXPECT(TT_CRIT_PAREN_CLOSE, "')'"); \ first++; \ return result.release(); \ } PARSE_PAREN_NUM_CRITERION(TT_CRIT_RATING_CRIT, tRatingCriterion); PARSE_PAREN_NUM_CRITERION(TT_CRIT_PLAYCOUNT_CRIT, tPlayCountCriterion); PARSE_PAREN_NUM_CRITERION(TT_CRIT_EXISTEDFORDAYS_CRIT, tExistedForDaysCriterion); PARSE_PAREN_NUM_CRITERION(TT_CRIT_FULLPLAYRATIO_CRIT, tFullPlayRatioCriterion); PARSE_PAREN_NUM_CRITERION(TT_CRIT_UNIQUEID_CRIT, tUniqueIdCriterion); PARSE_PAREN_NUM_CRITERION(TT_CRIT_FULLPLAYCOUNT_CRIT, tFullPlayCountCriterion); PARSE_PAREN_NUM_CRITERION(TT_CRIT_PARTIALPLAYCOUNT_CRIT, tPartialPlayCountCriterion); PARSE_PAREN_NUM_CRITERION(TT_CRIT_LASTPLAYEDNDAYSAGO_CRIT, tLastPlayedNDaysAgoCriterion); PARSE_PAREN_NUM_CRITERION(TT_CRIT_YEAR_CRIT, tYearCriterion); PARSE_PAREN_NUM_CRITERION(TT_CRIT_TRACKNUMBER_CRIT, tTrackNumberCriterion); if (first->TokenType == TT_CRIT_ALL_CRIT) { first++; return new tTrueCriterion; } if (first->TokenType == TT_CRIT_NONE_CRIT) { first++; return new tFalseCriterion; } if (first->TokenType == TT_CRIT_UNRATED_CRIT) { first++; return new tUnratedCriterion; } return new tAnyCriterion(parseTextCriterion(first, last)); } const int PRECEDENCE_UNARY = 200; const int PRECEDENCE_AND = 150; const int PRECEDENCE_OR = 100; tCriterion *parseCriterion(tTokenList::iterator &first, tTokenList::iterator last, const int min_precedence = 0) { QString ft = first->Text; auto_ptr op1; if (first->TokenType == TT_CRIT_PAREN_OPEN) { ADVANCE; auto_ptr temp_result(parseCriterion(first, last)); op1 = temp_result; EXPECT(TT_CRIT_PAREN_CLOSE, "')'"); first++; } else if (first->TokenType == TT_CRIT_NOT && min_precedence <= PRECEDENCE_UNARY) { ADVANCE; auto_ptr op(parseCriterion(first, last, PRECEDENCE_UNARY)); auto_ptr temp_result(new tNotCriterion(op.get())); op.release(); op1 = temp_result; } else { auto_ptr temp_result(parseAtomicCriterion(first, last)); op1 = temp_result; } bool made_progress = true; while (first != last && made_progress) { made_progress = false; if (first-> TokenType == TT_CRIT_AND && min_precedence <= PRECEDENCE_AND) { ADVANCE; auto_ptr temp_result( new tAndCriterion(op1.get(), parseCriterion(first, last, PRECEDENCE_AND))); op1.release(); op1 = temp_result; made_progress = true; } else if (first-> TokenType == TT_CRIT_OR && min_precedence <= PRECEDENCE_OR) { ADVANCE; auto_ptr temp_result( new tOrCriterion(op1.get(), parseCriterion(first, last, PRECEDENCE_OR))); op1.release(); op1 = temp_result; made_progress = true; } else if (min_precedence <= PRECEDENCE_AND) { try { tTokenList::iterator myfirst = first; auto_ptr temp_result( new tAndCriterion(op1.get(), parseCriterion(myfirst, last, PRECEDENCE_AND))); op1.release(); op1 = temp_result; made_progress = true; first = myfirst; } catch (...) { } } } return op1.release(); } } auto_ptr parseCriterion(QString criterion) { tTokenList tokens; CriterionScanner.scan(criterion, tokens); tTokenList::iterator first = tokens.begin(), last = tokens.end(); if (first == last) return auto_ptr(new tTrueCriterion); auto_ptr result( parseCriterion(first, last)); if (first != last) throw tRuntimeError(qApp->translate("ErrorMessages", "Unrecognized tokens at end of criterion")); return result; } madman-0.93/database/database.cpp0000644000175000001440000003156210053135241016471 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "database/database.h" #include "utility/progress.h" #include "expat/expat.h" #include #include #include #include #include #include // tSAXDatabaseHandler -------------------------------------------------------- class tSAXDatabaseHandler { enum tMode { NONE, DIRECTORIES, HISTORY, SONGS, SONG_SET, SONG_SET_NODE, SONG_SET_RENDERING, SONG_SET_POSITIVE_SET, SONG_SET_NEGATIVE_SET } CurrentMode; tDatabase &Database; tProgress *Progress; XML_Parser Parser; typedef vector tPlaylistNodeStack; tPlaylistNodeStack PlaylistNodeStack; tUniqueIdList UniqueIdList; public: tSAXDatabaseHandler(tDatabase &database, tProgress *progress, XML_Parser parser); void startElement(const XML_Char *name, const XML_Char **attributes); void endElement(const XML_Char *name); }; tSAXDatabaseHandler::tSAXDatabaseHandler(tDatabase &database, tProgress *progress, XML_Parser parser) : CurrentMode(NONE), Database(database), Progress(progress), Parser(parser) { } void tSAXDatabaseHandler::startElement(const XML_Char *name, const XML_Char **attributes) { if (Progress) { int current_progress = XML_GetCurrentByteIndex(Parser); if (current_progress - Progress->progress() > 100000) Progress->setProgress(current_progress); } // items -------------------------------------------------------------------- if (strcmp(name, "song") == 0) { switch (CurrentMode) { case SONGS: Database.SongCollection.insert(deserializeSong(attributes), true); return; case SONG_SET_RENDERING: case SONG_SET_NEGATIVE_SET: case SONG_SET_POSITIVE_SET: UniqueIdList.push_back(lookupAttribute("unique_id", attributes).toUInt()); return; default: ; } } if (strcmp(name, "directory") == 0 && CurrentMode == DIRECTORIES) { string dir = lookupAttributeUtf8("name", attributes); if (dir.substr(0, 7) == "base64:") Database.DirectoryList.push_back(decodeBase64(dir.substr(7))); else Database.DirectoryList.push_back(dir.c_str()); return; } if (strcmp(name, "playedsong") == 0 && CurrentMode == HISTORY) { Database.History.played( lookupAttribute("uniqueid", attributes).toUInt(), lookupAttribute("time", attributes).toUInt(), lookupAttribute("playduration", attributes).toDouble() ); return; } // mode changes ------------------------------------------------------------- if (strcmp(name, "madmandb") == 0 && CurrentMode == NONE) return; if (strcmp(name, "songs") == 0 && CurrentMode == NONE) { CurrentMode = SONGS; return; } if (strcmp(name, "directories") == 0 && CurrentMode == NONE) { CurrentMode = DIRECTORIES; return; } if (strcmp(name, "history") == 0 && CurrentMode == NONE) { CurrentMode = HISTORY; return; } if (strcmp(name, "song_set_node") == 0 && (CurrentMode == NONE || CurrentMode == SONG_SET_NODE)) { CurrentMode = SONG_SET_NODE; tPlaylistNode *my_node = new tPlaylistNode(&Database, NULL); my_node->setName(lookupAttribute("name", attributes)); if (PlaylistNodeStack.size() == 0) Database.setPlaylistTree(my_node); else PlaylistNodeStack.back()->insertChild( my_node, PlaylistNodeStack.back()->end()); PlaylistNodeStack.push_back(my_node); return; } if (strcmp(name, "song_set") == 0 && (CurrentMode == SONG_SET_NODE)) { CurrentMode = SONG_SET; tPlaylist *my_set = new tPlaylist; my_set->setSongCollection(&Database.SongCollection); PlaylistNodeStack.back()->setData(my_set); QString criterion_string = lookupAttribute("criterion", attributes); try { my_set->setCriterion(criterion_string); } catch (...) { // If we can't compile the criterion, just comment it out cerr << "*** WARNING *** The criterion " << criterion_string << " failed to compile." << endl << "Commenting out." << endl; // First, remove all previous comments to prevent breakage. QRegExp comment_re("\\{[^}]*\\}"); while (comment_re.search(criterion_string) != -1) criterion_string = criterion_string.replace(comment_re, ""); // Then, set the new commented-out criterion. my_set->setCriterion(QString("{ COMPILE FAILURE ON LOAD, COMMENTED OUT: %1 }").arg(criterion_string)); } return; } if (strcmp(name, "rendering") == 0 && (CurrentMode == SONG_SET)) { CurrentMode = SONG_SET_RENDERING; UniqueIdList.clear(); return; } if (strcmp(name, "positiveset") == 0 && (CurrentMode == SONG_SET)) { CurrentMode = SONG_SET_POSITIVE_SET; UniqueIdList.clear(); return; } if (strcmp(name, "negativeset") == 0 && (CurrentMode == SONG_SET)) { CurrentMode = SONG_SET_NEGATIVE_SET; UniqueIdList.clear(); return; } // error condition ---------------------------------------------------------- cerr << "error: " << QString::fromUtf8(name, strlen(name)) << endl; throw tRuntimeError(qApp->translate("ErrorMessages", "Invalid database structure" )); } void tSAXDatabaseHandler::endElement(const XML_Char *name) { if (strcmp(name, "madmandb") == 0 && CurrentMode == NONE) return; if (strcmp(name, "songs") == 0 && CurrentMode == SONGS) { CurrentMode = NONE; return; } if (strcmp(name, "directories") == 0 && CurrentMode == DIRECTORIES) { CurrentMode = NONE; return; } if (strcmp(name, "history") == 0 && CurrentMode == HISTORY) { CurrentMode = NONE; return; } if (strcmp(name, "song_set_node") == 0 && CurrentMode == SONG_SET_NODE) { PlaylistNodeStack.pop_back(); if (PlaylistNodeStack.size() == 0) CurrentMode = NONE; else CurrentMode = SONG_SET_NODE; return; } if (strcmp(name, "song_set") == 0 && (CurrentMode == SONG_SET)) { CurrentMode = SONG_SET_NODE; return; } if (strcmp(name, "rendering") == 0 && (CurrentMode == SONG_SET_RENDERING)) { CurrentMode = SONG_SET; PlaylistNodeStack.back()->data()->setRendering(UniqueIdList); return; } if (strcmp(name, "positiveset") == 0 && (CurrentMode == SONG_SET_POSITIVE_SET)) { CurrentMode = SONG_SET; PlaylistNodeStack.back()->data()->setPositiveSet(UniqueIdList); return; } if (strcmp(name, "negativeset") == 0 && (CurrentMode == SONG_SET_NEGATIVE_SET)) { CurrentMode = SONG_SET; PlaylistNodeStack.back()->data()->setNegativeSet(UniqueIdList); return; } } // expat parsing code --------------------------------------------------------- void startExpatElement(void *data, const XML_Char *el, const XML_Char **attr) { reinterpret_cast(data)->startElement(el, attr); } void endExpatElement(void *data, const XML_Char *el) { reinterpret_cast(data)->endElement(el); } // tDatabase ------------------------------------------------------------------ tDatabase::tDatabase() { } void tDatabase::setPlaylistTree(tPlaylistNode *node) { auto_ptr my_node(node); PlaylistTree = my_node; noticePlaylistTreeChanged(); } void tDatabase::clear() { setPlaylistTree(NULL); SongCollection.clear(); DirectoryList.clear(); History.clear(); } void tDatabase::startNew() { clear(); setPlaylistTree(new tPlaylistNode(this, new tPlaylist)); PlaylistTree->data()->setSongCollection(&SongCollection); PlaylistTree->setName(qApp->translate("PlaylistName", "Root Playlist")); tPlaylistNode *node = new tPlaylistNode(this, new tPlaylist); node->data()->setSongCollection(&SongCollection); node->data()->setCriterion("~rating(>=4)"); node->data()->reevaluateCriterion(); node->setName(qApp->translate("PlaylistName", "Absolute favorites")); PlaylistTree->addChild(node); node = new tPlaylistNode(this, new tPlaylist); node->data()->setSongCollection(&SongCollection); node->data()->setCriterion("~album(love)|~title(love)"); node->data()->reevaluateCriterion(); node->setName(qApp->translate("PlaylistName", "Love songs")); PlaylistTree->addChild(node); node = new tPlaylistNode(this, new tPlaylist); node->data()->setSongCollection(&SongCollection); node->data()->setCriterion("~genre(rock)"); node->data()->reevaluateCriterion(); node->setName(qApp->translate("PlaylistName", "Rock songs")); PlaylistTree->addChild(node); node = new tPlaylistNode(this, new tPlaylist); node->data()->setSongCollection(&SongCollection); node->data()->setCriterion("~play_count(=0)"); node->data()->reevaluateCriterion(); node->setName(qApp->translate("PlaylistName", "Never been listened")); PlaylistTree->addChild(node); node = new tPlaylistNode(this, new tPlaylist); node->data()->setSongCollection(&SongCollection); node->data()->setCriterion("~existed_for_days(<30)"); node->data()->reevaluateCriterion(); node->setName(qApp->translate("PlaylistName", "Recent additions")); PlaylistTree->addChild(node); node = new tPlaylistNode(this, new tPlaylist); node->data()->setSongCollection(&SongCollection); node->data()->setCriterion("~full_play_ratio(>=0.5)"); node->data()->reevaluateCriterion(); node->setName(qApp->translate("PlaylistName", "Often listened to the end")); PlaylistTree->addChild(node); node = new tPlaylistNode(this, new tPlaylist); node->data()->setSongCollection(&SongCollection); node->data()->setCriterion("~full_play_ratio(<0.5)"); node->data()->reevaluateCriterion(); node->setName(qApp->translate("PlaylistName", "Rarely listened to the end")); PlaylistTree->addChild(node); } void tDatabase::load(const QString &filename, tProgress *progress) { clear(); QFile dbfile(filename); if (dbfile.open(IO_ReadOnly)) { if (progress) { progress->setTotalSteps(dbfile.size()); progress->setProgress(0); } tSongCollectionScopedBulkChange bulkchange(SongCollection); XML_Parser parser = XML_ParserCreate(NULL); if (parser == NULL) throw runtime_error("expat: unable to create parser"); tSAXDatabaseHandler handler(*this, progress, parser); XML_SetUserData(parser, &handler); XML_SetElementHandler(parser, startExpatElement, endExpatElement); char buffer[1<<8]; while (!dbfile.atEnd()) { Q_LONG read_bytes = dbfile.readBlock(buffer, sizeof(buffer)); if (XML_Parse(parser, buffer, read_bytes, dbfile.atEnd()) == 0) { throw tRuntimeError(QString("expat: %1").arg( QString::fromUtf8(XML_ErrorString(XML_GetErrorCode(parser))))); } } XML_ParserFree(parser); dbfile.close(); } else throw tRuntimeError(qApp->translate("ErrorMessages", "Database file not accessible: %1").arg(filename)); } void tDatabase::save(const QString &filename, tProgress *progress) { if (progress) { progress->setTotalSteps(5); progress->setProgress(0); } QDomDocument configxml; QDomElement doc_element = configxml.createElement("madmandb"); configxml.appendChild(doc_element); // save song collection doc_element.appendChild(SongCollection.serialize(configxml)); if (progress) progress->setProgress(1); // save directories QDomElement dirs_element = configxml.createElement("directories"); FOREACH(first_d, DirectoryList, tDirectoryList) { QDomElement dir_element = configxml.createElement("directory"); dir_element.setAttribute("name", string2QString("base64:" + encodeBase64(*first_d))); dirs_element.appendChild(dir_element); } doc_element.appendChild(dirs_element); if (progress) progress->setProgress(2); // order matters, song set tree needs to be serialized after songs if (playlistTree()) doc_element.appendChild(playlistTree()->serialize(configxml)); if (progress) progress->setProgress(3); doc_element.appendChild(History.serialize(configxml)); if (progress) progress->setProgress(4); QFile dbfile(filename); if (dbfile.open(IO_WriteOnly)) { QTextStream stream(&dbfile); stream.setEncoding(QTextStream::UnicodeUTF8); stream << configxml; } else throw tRuntimeError(qApp->translate("ErrorMessages", "Database file not writable: %1").arg(filename)); if (progress) progress->setProgress(5); } void tDatabase::noticePlaylistTreeChanged() { emit notifyPlaylistTreeChanged(); } madman-0.93/database/history.cpp0000644000175000001440000000275210053135241016425 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "history.h" #include "database/song.h" void tHistory::played(tUniqueId id, time_t when, double duration) { tHistoryEntry entry; entry.UniqueId = id; entry.Time = when; entry.PlayDuration = duration; HistoryList.push_back(entry); } void tHistory::clear() { HistoryList.clear(); } QDomNode tHistory::serialize(QDomDocument &doc) { QDomElement history = doc.createElement("history"); FOREACH_CONST(first, HistoryList, tHistoryList) { QDomElement entry = doc.createElement("playedsong"); entry.setAttribute("uniqueid", first->UniqueId); entry.setAttribute("time", (int) first->Time); entry.setAttribute("playduration", first->PlayDuration); history.appendChild(entry); } return history; } madman-0.93/database/song.cpp0000644000175000001440000011720510053135241015672 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 #include #include #include #include #include "utility/vcedit.h" #include "utility/mp3tech.h" #include "database/database.h" #include "song.h" #include // private helpers ------------------------------------------------------------ namespace { string sanitizeUtf8(string const &victim) { string result; string::const_iterator first = victim.begin(), last = victim.end(); while (first != last) { if (*first < 0x20) { result += "?"; first++; } else if (0x20 <= (unsigned char) *first <= 0x7f) { result += *first++; } else if (0x80 <= (unsigned char) *first <= 0xc1) { result += "?"; first++; } else if (0xc2 <= (unsigned char) *first <= 0xdf) { // two byte sequences if (0x80 <= (unsigned char) first[1] <= 0xbf) { result += *first++; result += *first++; } else { first += 2; result += "?"; } } else if (0xe0 <= (unsigned char) *first <= 0xef) { // three byte sequences bool valid = (0x80 <= (unsigned char) first[1] <= 0xbf) && (0x80 <= (unsigned char) first[2] <= 0xbf); if ((unsigned char) first[0] == 0xe0 && (unsigned char) first[1] < 0xa0) valid = false; if ((unsigned char) first[0] == 0xed && (unsigned char) first[1] > 0x9f) valid = false; if (valid) { result += *first++; result += *first++; result += *first++; } else { first += 3; result += "?"; } } else if (0xf0 <= (unsigned char) *first <= 0xf4) { // four byte sequences bool valid = (0x80 <= (unsigned char) first[1] <= 0xbf) && (0x80 <= (unsigned char) first[2] <= 0xbf) && (0x80 <= (unsigned char) first[3] <= 0xbf); if ((unsigned char) first[0] == 0xf0 && (unsigned char) first[1] < 0x90) valid = false; if ((unsigned char) first[0] == 0xf4 && (unsigned char) first[1] > 0x8f) valid = false; if (valid) { result += *first++; result += *first++; result += *first++; result += *first++; } else { first += 4; result += "?"; } } else { first += 1; result += "?"; } } return result; } string decodeFilename(const QString &str) { if (str.left(7) == "base64:") return decodeBase64(QString2string(str.mid(7))); else return QString2string(str); } template void assignAndCheckForModification(const tSong *song, tSongCollection *collection, T &value, const T2 &rvalue, tSongField field) { bool changed = value != rvalue; value = rvalue; if (changed && collection) collection->noticeSongModified(song, field); } } // public helpers ------------------------------------------------------------- QString genreIdToString(int genre) { switch (genre) { case 0: return "Blues"; case 1: return "Classic Rock"; case 2: return "Country"; case 3: return "Dance"; case 4: return "Disco"; case 5: return "Funk"; case 6: return "Grunge"; case 7: return "Hip-Hop"; case 8: return "Jazz"; case 9: return "Metal"; case 10: return "New Age"; case 11: return "Oldies"; case 12: return "Other"; case 13: return "Pop"; case 14: return "R&B"; case 15: return "Rap"; case 16: return "Reggae"; case 17: return "Rock"; case 18: return "Techno"; case 19: return "Industrial"; case 20: return "Alternative"; case 21: return "Ska"; case 22: return "Death Metal"; case 23: return "Pranks"; case 24: return "Soundtrack"; case 25: return "Euro-Techno"; case 26: return "Ambient"; case 27: return "Trip-Hop"; case 28: return "Vocal"; case 29: return "Jazz+Funk"; case 30: return "Fusion"; case 31: return "Trance"; case 32: return "Classical"; case 33: return "Instrumental"; case 34: return "Acid"; case 35: return "House"; case 36: return "Game"; case 37: return "Sound Clip"; case 38: return "Gospel"; case 39: return "Noise"; case 40: return "AlternRock"; case 41: return "Bass"; case 42: return "Soul"; case 43: return "Punk"; case 44: return "Space"; case 45: return "Meditative"; case 46: return "Instrumental Pop"; case 47: return "Instrumental Rock"; case 48: return "Ethnic"; case 49: return "Gothic"; case 50: return "Darkwave"; case 51: return "Techno-Industrial"; case 52: return "Electronic"; case 53: return "Pop-Folk"; case 54: return "Eurodance"; case 55: return "Dream"; case 56: return "Southern Rock"; case 57: return "Comedy"; case 58: return "Cult"; case 59: return "Gangsta"; case 60: return "Top 40"; case 61: return "Christian Rap"; case 62: return "Pop/Funk"; case 63: return "Jungle"; case 64: return "Native American"; case 65: return "Cabaret"; case 66: return "New Wave"; case 67: return "Psychadelic"; case 68: return "Rave"; case 69: return "Showtunes"; case 70: return "Trailer"; case 71: return "Lo-Fi"; case 72: return "Tribal"; case 73: return "Acid Punk"; case 74: return "Acid Jazz"; case 75: return "Polka"; case 76: return "Retro"; case 77: return "Musical"; case 78: return "Rock & Roll"; case 79: return "Hard Rock"; case 80: return "Folk"; case 81: return "Folk-Rock"; case 82: return "National Folk"; case 83: return "Swing"; case 84: return "Fast Fusion"; case 85: return "Bebob"; case 86: return "Latin"; case 87: return "Revival"; case 88: return "Celtic"; case 89: return "Bluegrass"; case 90: return "Avantgarde"; case 91: return "Gothic Rock"; case 92: return "Progressive Rock"; case 93: return "Psychedelic Rock"; case 94: return "Symphonic Rock"; case 95: return "Slow Rock"; case 96: return "Big Band"; case 97: return "Chorus"; case 98: return "Easy Listening"; case 99: return "Acoustic"; case 100: return "Humour"; case 101: return "Speech"; case 102: return "Chanson"; case 103: return "Opera"; case 104: return "Chamber Music"; case 105: return "Sonata"; case 106: return "Symphony"; case 107: return "Booty Bass"; case 108: return "Primus"; case 109: return "Porn Groove"; case 110: return "Satire"; case 111: return "Slow Jam"; case 112: return "Club"; case 113: return "Tango"; case 114: return "Samba"; case 115: return "Folklore"; case 116: return "Ballad"; case 117: return "Power Ballad"; case 118: return "Rhythmic Soul"; case 119: return "Freestyle"; case 120: return "Duet"; case 121: return "Punk Rock"; case 122: return "Drum Solo"; case 123: return "A capella"; case 124: return "Euro-House"; case 125: return "Dance Hall"; default: return "undefined"; } } QString getFieldName(tSongField field) { switch (field) { case FIELD_ARTIST: return qApp->translate("FieldDescriptions", "Artist"); case FIELD_PERFORMER: return qApp->translate("FieldDescriptions", "Performer"); case FIELD_TITLE: return qApp->translate("FieldDescriptions", "Title"); case FIELD_ALBUM: return qApp->translate("FieldDescriptions", "Album"); case FIELD_TRACKNUMBER: return qApp->translate("FieldDescriptions", "Track Number"); case FIELD_DURATION: return qApp->translate("FieldDescriptions", "Duration"); case FIELD_GENRE: return qApp->translate("FieldDescriptions", "Genre"); case FIELD_FULLPLAYCOUNT: return qApp->translate("FieldDescriptions", "Play Count (full)"); case FIELD_PARTIALPLAYCOUNT: return qApp->translate("FieldDescriptions", "Play Count (partial)"); case FIELD_PLAYCOUNT: return qApp->translate("FieldDescriptions", "Play Count"); case FIELD_LASTPLAYED: return qApp->translate("FieldDescriptions", "Last Played"); case FIELD_RATING: return qApp->translate("FieldDescriptions", "Rating"); case FIELD_YEAR: return qApp->translate("FieldDescriptions", "Year"); case FIELD_FILE: return qApp->translate("FieldDescriptions", "File"); case FIELD_PATH: return qApp->translate("FieldDescriptions", "Path"); case FIELD_SIZE: return qApp->translate("FieldDescriptions", "File Size"); case FIELD_EXISTSSINCE: return qApp->translate("FieldDescriptions", "Exists since"); case FIELD_LASTMODIFIED: return qApp->translate("FieldDescriptions", "Last modified"); case FIELD_MIMETYPE: return qApp->translate("FieldDescriptions", "MIME Type"); case FIELD_UNIQUEID: return qApp->translate("FieldDescriptions", "Unique ID"); default: return qApp->translate("FieldDescriptions", ""); } } QString getFieldIdentifier(tSongField field) { switch (field) { case FIELD_ARTIST: return "artist"; case FIELD_PERFORMER: return "performer"; case FIELD_TITLE: return "title"; case FIELD_ALBUM: return "album"; case FIELD_TRACKNUMBER: return "tracknumber"; case FIELD_DURATION: return "duration"; case FIELD_GENRE: return "genre"; case FIELD_FULLPLAYCOUNT: return "fullplaycount"; case FIELD_PARTIALPLAYCOUNT: return "partialplaycount"; case FIELD_PLAYCOUNT: return "playcount"; case FIELD_LASTPLAYED: return "lastplayed"; case FIELD_RATING: return "rating"; case FIELD_YEAR: return "year"; case FIELD_FILE: return "file"; case FIELD_PATH: return "path"; case FIELD_SIZE: return "size"; case FIELD_EXISTSSINCE: return "existssince"; case FIELD_LASTMODIFIED: return "lastmodified"; case FIELD_MIMETYPE: return "mimetype"; case FIELD_UNIQUEID: return "uniqueid"; default: throw tRuntimeError("Invalid field id in getFieldIdentifier"); } } tSongField getFieldFromIdentifier(const QString &field) { if (field == "artist") return FIELD_ARTIST; else if (field == "performer") return FIELD_PERFORMER; else if (field == "title") return FIELD_TITLE; else if (field == "album") return FIELD_ALBUM; else if (field == "tracknumber") return FIELD_TRACKNUMBER; else if (field == "duration") return FIELD_DURATION; else if (field == "genre") return FIELD_GENRE; else if (field == "fullplaycount") return FIELD_FULLPLAYCOUNT; else if (field == "partialplaycount") return FIELD_PARTIALPLAYCOUNT; else if (field == "playcount") return FIELD_PLAYCOUNT; else if (field == "lastplayed") return FIELD_LASTPLAYED; else if (field == "rating") return FIELD_RATING; else if (field == "year") return FIELD_YEAR; else if (field == "file") return FIELD_FILE; else if (field == "path") return FIELD_PATH; else if (field == "size") return FIELD_SIZE; else if (field == "existssince") return FIELD_EXISTSSINCE; else if (field == "lastmodified") return FIELD_LASTMODIFIED; else if (field == "mimetype") return FIELD_MIMETYPE; else if (field == "uniqueid") return FIELD_UNIQUEID; else { throw tRuntimeError("Invalid field id in getFieldFromIdentifier"); } } QString substituteSongFields(QString const &format, tSong *song, bool human_readable, bool shell_quote) { QString result = format; for (int i = 0; i < FIELD_COUNT; i++) { tSongField f = (tSongField) i; QString replacement; if (human_readable) replacement = song->humanReadableFieldText(f); else replacement = song->fieldText(f); if (shell_quote) replacement = quoteString(replacement); result.replace("%" + getFieldIdentifier(f) + "%", replacement); } result.replace("%newline%", "\n"); return result; } // tSong ---------------------------------------------------------------------- tSong::tDirectoryList tSong::DirectoryList; tSong::tSong() : UniqueId(SONG_UID_INVALID), SongCollection(NULL), Duration(0), FileSize(0), ExistsSince(0), LastPlayed(-1), LastModified(time(NULL)), FullPlayCount(0), PartialPlayCount(0), Rating(-1), CacheValid(false) { IndexIntoDirectoryList = 0; if (DirectoryList.size() == 0) DirectoryList.push_back(""); } tSong::~tSong() { } tFilename tSong::filename() const { return pathname() + "/" + filenameOnly(); } tFilename tSong::pathname() const { return DirectoryList[ IndexIntoDirectoryList ]; } tFilename tSong::filenameOnly() const { return FilenameOnly; } tUniqueId tSong::uniqueId() const { return UniqueId; } QString tSong::album() const { ensureInfoIsThere(); return Album; } QString tSong::artist() const { ensureInfoIsThere(); return Artist; } QString tSong::performer() const { ensureInfoIsThere(); return Performer; } QString tSong::title() const { ensureInfoIsThere(); return Title; } QString tSong::year() const { ensureInfoIsThere(); return Year; } QString tSong::genre() const { ensureInfoIsThere(); return Genre; } QString tSong::trackNumber() const { ensureInfoIsThere(); return TrackNumber; } float tSong::duration() const { ensureInfoIsThere(); return Duration; } time_t tSong::existsSince() const { return ExistsSince; } time_t tSong::lastModified() const { ensureInfoIsThere(); return LastModified; } time_t tSong::lastPlayed() const { return LastPlayed; } int tSong::playCount() const { return FullPlayCount+PartialPlayCount; } int tSong::fullPlayCount() const { return FullPlayCount; } int tSong::partialPlayCount() const { return PartialPlayCount; } int tSong::rating() const { return Rating; } int tSong::fileSize() const { ensureInfoIsThere(); return FileSize; } QDomNode tSong::serialize(QDomDocument &doc) const { ensureInfoIsThere(); QDomElement result = doc.createElement("song"); result.setAttribute("filename", QString("base64:")+encodeBase64(filename()).c_str()); result.setAttribute("uniqueid", UniqueId); result.setAttribute("album", Album); result.setAttribute("artist", Artist); result.setAttribute("performer", Performer); result.setAttribute("title", Title); result.setAttribute("year", Year); result.setAttribute("genre", Genre); result.setAttribute("tracknumber", TrackNumber); result.setAttribute("duration", Duration); result.setAttribute("existssince", (int) ExistsSince); result.setAttribute("lastplayed", (int) LastPlayed); result.setAttribute("lastmodified", (int) LastModified); result.setAttribute("fullplaycount", FullPlayCount); result.setAttribute("partialplaycount", PartialPlayCount); result.setAttribute("rating", Rating); result.setAttribute("filesize", (int) FileSize); return result; } void tSong::deserialize(const char **attributes) { tFilename fn; fn = decodeFilename(lookupAttribute("filename", attributes)); if (fn != filename()) { throw tRuntimeError(qApp->translate("ErrorMessages", "deserializing to different filename")); } UniqueId = lookupAttribute("uniqueid", attributes).toUInt(); Album = lookupAttribute("album", attributes); Artist = lookupAttribute("artist", attributes); try { Performer = lookupAttribute("performer", attributes); } catch (...) { Performer = qApp->translate("ErrorMessages", ""); } Title = lookupAttribute("title", attributes); Year = lookupAttribute("year", attributes); Genre = lookupAttribute("genre", attributes); TrackNumber = lookupAttribute("tracknumber", attributes); Duration = lookupAttribute("duration", attributes).toFloat(); if (hasAttribute("existssince", attributes)) ExistsSince = lookupAttribute("existssince", attributes).toUInt(); if (hasAttribute("fullplaycount", attributes)) { LastPlayed = lookupAttribute("lastplayed", attributes).toUInt(); FullPlayCount = lookupAttribute("fullplaycount", attributes).toUInt(); PartialPlayCount = lookupAttribute("partialplaycount", attributes).toUInt(); } else { FullPlayCount = 0; PartialPlayCount = 0; } if (hasAttribute("lastmodified", attributes)) LastModified = lookupAttribute("lastmodified", attributes).toUInt(); else { // we'll believe that our mtime is way back, so we'll // update our tags. LastModified = 0; } if (hasAttribute("rating", attributes)) Rating = lookupAttribute("rating", attributes).toInt(); else Rating = -1; if (hasAttribute("filesize", attributes)) FileSize = lookupAttribute("filesize", attributes).toInt(); else { string fn = filename(); struct stat statbuf; if (stat(fn.c_str(), &statbuf)) throw runtime_error(("Unable to stat file "+filename()).c_str()); FileSize = statbuf.st_size; } CacheValid = true; } void tSong::setUniqueId(tUniqueId id) { UniqueId = id; } void tSong::setFilename(tFilename const &new_filename) { if (SongCollection) SongCollection->noticeSongFilenameAboutToChange(this, filename(), new_filename); char *cstr_copy = strdup(new_filename.c_str()); FilenameOnly = basename(cstr_copy); free(cstr_copy); cstr_copy = strdup(new_filename.c_str()); tFilename pathname = dirname(cstr_copy); free(cstr_copy); bool found = false; IndexIntoDirectoryList = 0; FOREACH(first, DirectoryList, tDirectoryList) { if (pathname == *first) { found = true; break; } IndexIntoDirectoryList++; } if (!found) { IndexIntoDirectoryList = DirectoryList.size(); DirectoryList.push_back(pathname); } CacheValid = false; if (SongCollection) { SongCollection->noticeSongModified(this, FIELD_FILE); SongCollection->noticeSongModified(this, FIELD_PATH); } } void tSong::invalidateCache() { CacheValid = false; // Cache invalidation does not entail song modification, so // don't call noticeSongModified here. } void tSong::setExistsSince(time_t value) { LastModified = value; if (SongCollection) SongCollection->noticeSongModified(this, FIELD_EXISTSSINCE); } void tSong::setLastModified(time_t value) { LastModified = value; if (SongCollection) SongCollection->noticeSongModified(this, FIELD_LASTMODIFIED); } void tSong::setLastPlayed(time_t value) { LastPlayed = value; if (SongCollection) SongCollection->noticeSongModified(this, FIELD_LASTPLAYED); } void tSong::setFullPlayCount(unsigned value) { FullPlayCount = value; if (SongCollection) { SongCollection->noticeSongModified(this, FIELD_FULLPLAYCOUNT); SongCollection->noticeSongModified(this, FIELD_PLAYCOUNT); } } void tSong::setPartialPlayCount(unsigned value) { PartialPlayCount = value; if (SongCollection) { SongCollection->noticeSongModified(this, FIELD_PARTIALPLAYCOUNT); SongCollection->noticeSongModified(this, FIELD_PLAYCOUNT); } } void tSong::setRating(int value) { Rating = value; if (SongCollection) SongCollection->noticeSongModified(this, FIELD_RATING); } QString tSong::fieldText(tSongField field) const { try { switch (field) { case FIELD_ARTIST: return artist(); case FIELD_PERFORMER: return performer(); case FIELD_TITLE: return title(); case FIELD_ALBUM: return album(); case FIELD_TRACKNUMBER: return trackNumber(); case FIELD_DURATION: return QString::number(duration()); case FIELD_GENRE: return genre(); case FIELD_FULLPLAYCOUNT: return QString::number(fullPlayCount()); case FIELD_PARTIALPLAYCOUNT: return QString::number(partialPlayCount()); case FIELD_PLAYCOUNT: return QString::number(playCount()); case FIELD_LASTPLAYED: if (playCount()) return QString::number(lastPlayed()); else return ""; case FIELD_RATING: return QString::number(rating()); case FIELD_YEAR: return year(); case FIELD_FILE: return QString::fromUtf8(filenameOnly().c_str()); case FIELD_PATH: return QString::fromUtf8(pathname().c_str()); case FIELD_SIZE: return QString::number(fileSize()); case FIELD_EXISTSSINCE: return QString::number(existsSince()); case FIELD_LASTMODIFIED: return QString::number(lastModified()); case FIELD_MIMETYPE: return mimeType(); case FIELD_UNIQUEID: return QString::number(uniqueId()); default: throw tRuntimeError("Invalid field in fieldText"); } } catch (exception &ex) { return ""; } } QString tSong::humanReadableFieldText(tSongField field) const { switch (field) { case FIELD_DURATION: { int total_seconds = (int) duration(); int seconds = total_seconds % 60; int minutes = total_seconds / 60; QString duration; duration.sprintf("%d:%02d", minutes, seconds); return duration; } case FIELD_LASTPLAYED: { if (playCount()) { QDateTime datetime; datetime.setTime_t(lastPlayed()); return datetime.toString("MMM d h:mm"); } else return ""; } case FIELD_EXISTSSINCE: { QDateTime datetime; datetime.setTime_t(existsSince()); return datetime.toString("MMM d h:mm"); } case FIELD_LASTMODIFIED: { QDateTime datetime; datetime.setTime_t(lastModified()); return datetime.toString("MMM d h:mm"); } case FIELD_RATING: { if (rating() == 0) { return "-"; } else if (rating() > 0) { QString rating_str; rating_str.fill('*', rating()); return rating_str; } else return ""; } break; case FIELD_SIZE: return QString("%1 MB").arg(double(fileSize()) / (1024 * 1024), 0, 'f', 2); default: return fieldText(field); } } void tSong::setFieldText(tSongField field, const QString &new_text) { switch (field) { case FIELD_ARTIST: setArtist(new_text); break; case FIELD_PERFORMER: setPerformer(new_text); break; case FIELD_TITLE: setTitle(new_text); break; case FIELD_ALBUM: setAlbum(new_text); break; case FIELD_GENRE: setGenre(new_text); break; case FIELD_YEAR: setYear(new_text); break; case FIELD_TRACKNUMBER: setTrackNumber(new_text); break; case FIELD_RATING: { bool ok; int rating = new_text.toInt(&ok); if (!ok) throw tRuntimeError(QString("Invalid rating numeral '%1' in setFieldText").arg(new_text)); setRating(rating); break; } default: throw tRuntimeError(QString("Cannot set field %1").arg(getFieldName(field))); } } void tSong::stripTag() { stripTagInternal(); readInfo(); } void tSong::rewriteTag() { QString my_album = album(); QString my_artist = artist(); QString my_performer = performer(); QString my_title = title(); QString my_year = year(); QString my_genre = genre(); QString my_track_number = trackNumber(); stripTagInternal(); setAlbum(my_album); setArtist(my_artist); setPerformer(my_performer); setTitle(my_title); setYear(my_year); setGenre(my_genre); setTrackNumber(my_track_number); } void tSong::ensureInfoIsThere() const { if (!CacheValid) readInfo(); } void tSong::readInfo() const { struct stat statbuf; string fn = filename(); if (stat(fn.c_str(), &statbuf)) throw runtime_error(("Unable to stat file "+filename()).c_str()); const_cast(this)->FileSize = statbuf.st_size; const_cast(this)->LastModified = statbuf.st_mtime; if (ExistsSince == 0) const_cast(this)->ExistsSince = statbuf.st_ctime; } void tSong::played(time_t when, bool full) { if (full) setFullPlayCount(fullPlayCount() + 1); else setPartialPlayCount(fullPlayCount() + 1); setLastPlayed(when); } void tSong::resetStatistics() { setFullPlayCount(0); setPartialPlayCount(0); setLastPlayed(-1); } void tSong::setCollection(tSongCollection *collection) { SongCollection = collection; } // tMP3Song ------------------------------------------------------------------- class tMP3Song : public tSong { public: QString mimeType() const { return "audio/mpeg"; } void readInfo() const; void setAlbum(QString const &value); void setArtist(QString const &value); void setPerformer(QString const &value); void setTitle(QString const &value); void setYear(QString const &value); void setGenre(QString const &value); void setTrackNumber(QString const &value); void stripTagInternal(); }; static QString getID3FieldString(id3_tag *my_tag, const string &frame_id) { id3_frame *frame = id3_tag_findframe(my_tag, frame_id.c_str(), 0); if (frame == NULL) return ""; unsigned int index = 0; id3_field *field = id3_frame_field(frame, 0); while ((field = id3_frame_field(frame, index))) { if (field == NULL) return ""; if (id3_field_type(field) == ID3_FIELD_TYPE_STRING || id3_field_type(field) == ID3_FIELD_TYPE_STRINGLIST) break; index++; } const id3_ucs4_t *value; if (id3_field_type(field) == ID3_FIELD_TYPE_STRING) value = id3_field_getstring(field); else { if (id3_field_getnstrings(field) == 0) return ""; value = id3_field_getstrings(field, 0); } if (frame_id == "TCON") value = id3_genre_name(value); id3_utf8_t *utf8_value = id3_ucs4_utf8duplicate(value); string utf8_managed = reinterpret_cast(utf8_value); QString result = QString::fromUtf8(sanitizeUtf8(utf8_managed).c_str()); free(utf8_value); return result; } static void setID3FieldString(const tFilename &filename, const string &frame_id, QString const &value) { id3_file *my_file = id3_file_open(filename.c_str(), ID3_FILE_MODE_READWRITE); if (my_file == NULL) throw runtime_error("Failed to open MP3 file for writing"); id3_tag *my_tag = id3_file_tag(my_file); // doesn't fail. id3_frame *frame = NULL; while ((frame = id3_tag_findframe(my_tag, frame_id.c_str(), 0))) { if (id3_tag_detachframe(my_tag, frame)) { id3_file_close(my_file); throw runtime_error("Failed to detach frame from ID3 tag"); } id3_frame_delete(frame); } frame = id3_frame_new(frame_id.c_str()); if (frame == NULL) { id3_file_close(my_file); throw runtime_error("Failed to make new ID3 frame"); } unsigned int index = 0; id3_field *field; while ((field = id3_frame_field(frame, index))) { if (field == NULL) { id3_frame_delete(frame); id3_file_close(my_file); throw runtime_error("ID3 write: Failed to find settable field"); } if (id3_field_type(field) == ID3_FIELD_TYPE_STRING || id3_field_type(field) == ID3_FIELD_TYPE_STRINGLIST) break; index++; } if (field == NULL) { id3_frame_delete(frame); id3_file_close(my_file); throw runtime_error("ID3 write: Failed to find settable field"); } id3_ucs4_t *ucs4_value = id3_utf8_ucs4duplicate( reinterpret_cast((const char *)value.utf8())); if (id3_field_type(field) == ID3_FIELD_TYPE_STRINGLIST) { if (id3_field_setstrings(field, 1, &ucs4_value)) { free(ucs4_value); id3_frame_delete(frame); id3_file_close(my_file); throw runtime_error("Failed to set ID3 tag to new value"); } } else { if (id3_field_setstring(field, ucs4_value)) { free(ucs4_value); id3_frame_delete(frame); id3_file_close(my_file); throw runtime_error("Failed to set ID3 tag to new value"); } } free(ucs4_value); if (id3_tag_attachframe(my_tag, frame)) { id3_frame_delete(frame); id3_file_close(my_file); throw runtime_error("Failed to attach new frame to ID3 tag"); } if (id3_file_update(my_file)) { id3_file_close(my_file); throw runtime_error("Failed to update ID3 tag"); } id3_file_close(my_file); } void tMP3Song::readInfo() const { id3_file *my_file = id3_file_open(filename().c_str(), ID3_FILE_MODE_READONLY); if (my_file == NULL) throw runtime_error("Failed to open MP3 file for reading"); try { id3_tag *tag = id3_file_tag(my_file); // doesn't fail. CacheValid = true; assignAndCheckForModification(this, SongCollection, const_cast(this)->Album, getID3FieldString(tag, "TALB"), FIELD_ALBUM); assignAndCheckForModification(this, SongCollection, const_cast(this)->Artist, getID3FieldString(tag, "TPE1"), FIELD_ARTIST); assignAndCheckForModification(this, SongCollection, const_cast(this)->Performer, getID3FieldString(tag, "TPE4"), FIELD_PERFORMER); // FIXME assignAndCheckForModification(this, SongCollection, const_cast(this)->Title, getID3FieldString(tag, "TIT2"), FIELD_TITLE); assignAndCheckForModification(this, SongCollection, const_cast(this)->Year, getID3FieldString(tag, "TDRC"), FIELD_YEAR); assignAndCheckForModification(this, SongCollection, const_cast(this)->TrackNumber, getID3FieldString(tag, "TRCK"), FIELD_TRACKNUMBER); assignAndCheckForModification(this, SongCollection, const_cast(this)->Genre, getID3FieldString(tag, "TCON"), FIELD_GENRE); id3_file_close(my_file); mp3info info; info.filename = const_cast(filename().c_str()); info.file = fopen(info.filename, "r"); if (info.file) { if (get_mp3_info(&info, SCAN_QUICK, 0) && info.seconds > 0) assignAndCheckForModification(this, SongCollection, const_cast(this)->Duration, 0, FIELD_DURATION); else assignAndCheckForModification(this, SongCollection, const_cast(this)->Duration, info.seconds, FIELD_DURATION); fclose(info.file); } else assignAndCheckForModification(this, SongCollection, const_cast(this)->Duration, 0, FIELD_DURATION); tSong::readInfo(); } catch (...) { id3_file_close(my_file); throw; } } void tMP3Song::setAlbum(QString const &value) { setID3FieldString(filename(), "TALB", value); readInfo(); } void tMP3Song::setArtist(QString const &value) { setID3FieldString(filename(), "TPE1", value); readInfo(); } void tMP3Song::setPerformer(QString const &value) { setID3FieldString(filename(), "TPE4", value); readInfo(); } void tMP3Song::setTitle(QString const &value) { setID3FieldString(filename(), "TIT2", value); readInfo(); } void tMP3Song::setYear(QString const &value) { setID3FieldString(filename(), "TDRC", value); readInfo(); } void tMP3Song::setGenre(QString const &value) { setID3FieldString(filename(), "TCON", value); readInfo(); } void tMP3Song::setTrackNumber(QString const &value) { setID3FieldString(filename(), "TRCK", value); readInfo(); } void tMP3Song::stripTagInternal() { /* ID3_Tag tag(filename().latin1()); tag.Strip(); */ // FIXME: unimplemented } // tOggSong ------------------------------------------------------------------- class tOggSong : public tSong { public: QString mimeType() const { return "audio/x-ogg"; } void readInfo() const; void setAlbum(QString const &value); void setArtist(QString const &value); void setPerformer(QString const &value); void setTitle(QString const &value); void setYear(QString const &value); void setGenre(QString const &value); void setTrackNumber(QString const &value); void stripTagInternal(); }; static QString getOggFieldString(vorbis_comment *vc, const char *tag) { int count = vorbis_comment_query_count(vc, const_cast(tag)); if (count > 0) { string comment = vorbis_comment_query(vc, const_cast(tag), 0); QString result = QString::fromUtf8(sanitizeUtf8(comment).c_str()); return result; } else return ""; } // ---------------------------------------------------------------------------- // begin code shamelessly pulled from xmms, with minimal changes // ---------------------------------------------------------------------------- static char** get_comment_list(vorbis_comment *vc) { int i; char **strv; strv = g_new0(char*, vc->comments + 1); for (i = 0; i < vc->comments; i++) { strv[i] = g_strdup(vc->user_comments[i]); } return strv; } static char** add_tag(char **list, const char *label, const char *in_tag) { char **ptr = list, *reallabel = g_strconcat(label, "=", NULL); char *tag = g_strdup(in_tag); g_strstrip(tag); if (strlen(tag) == 0) tag = NULL; /* * There can be several tags with the same label. We clear * them all. */ while (*ptr != NULL) { if (!g_strncasecmp(reallabel, *ptr, strlen(reallabel))) { g_free(*ptr); if (tag != NULL) { *ptr = g_strconcat(reallabel, tag, NULL); g_free(tag); tag = NULL; ptr++; } else { char **str; for (str = ptr; *str; str++) *str = *(str + 1); } } else ptr++; } if (tag) { int i = 0; for (ptr = list; *ptr; ptr++) i++; list = g_renew(char*, list, i + 2); list[i] = g_strconcat(reallabel, tag, NULL); list[i + 1] = NULL; g_free(tag); } g_free(reallabel); return list; } static void add_list(vorbis_comment *vc, char **comments) { while (*comments) vorbis_comment_add(vc, *comments++); } // ---------------------------------------------------------------------------- // end code shamelessly pulled from xmms // ---------------------------------------------------------------------------- static void setOggFieldString(const tFilename &filename, QString const &key, QString const &value) { vcedit_state *state = vcedit_new_state(); FILE *ogg_song = fopen(filename.c_str(), "rb"); if (ogg_song == NULL) throw tRuntimeError( qApp->translate("ErrorMessages", "Trouble reading from %1"). arg(string2QString(filename))); if (vcedit_open(state, ogg_song)) { fclose(ogg_song); throw tRuntimeError( qApp->translate("ErrorMessages", "Trouble reading tags from %1") .arg(string2QString(filename))); } vorbis_comment *vc = vcedit_comments(state); char **comment_list = get_comment_list(vc); comment_list = add_tag(comment_list, key.utf8(), value.utf8()); vorbis_comment_clear(vc); add_list(vc, comment_list); tFilename new_ogg_filename = filename + ".madman_retag"; FILE *new_ogg_song = fopen(new_ogg_filename.c_str(), "wb"); if (new_ogg_song == NULL) { fclose(ogg_song); throw tRuntimeError(qApp->translate("ErrorMessages", "Trouble writing retagged file")); } if (vcedit_write(state, new_ogg_song)) { fclose(ogg_song); fclose(new_ogg_song); remove(new_ogg_filename.c_str()); throw tRuntimeError(qApp->translate("ErrorMessages", "Trouble writing retagged file")); } fclose(new_ogg_song); fclose(ogg_song); if (rename(new_ogg_filename.c_str(), filename.c_str())) remove(new_ogg_filename.c_str()); vcedit_clear(state); } void tOggSong::readInfo() const { tFilename fn = filename(); FILE *ogg_song = fopen(fn.c_str(), "rb"); if (ogg_song == NULL) { throw tRuntimeError( qApp->translate("ErrorMessages", "Trouble reading tags from %1") .arg(string2QString(filename()))); } OggVorbis_File vf; if (ov_open(ogg_song, &vf, NULL, 0)) { fclose(ogg_song); throw tRuntimeError( qApp->translate("ErrorMessages", "Trouble reading tags from %1") .arg(string2QString(filename()))); } // ov_open has taken possession of ogg_song, so no need to fclose // otherwise. vorbis_comment *vc = ov_comment(&vf, -1); CacheValid = true; assignAndCheckForModification(this, SongCollection, const_cast(this)->Album, getOggFieldString(vc, "ALBUM"), FIELD_ALBUM); assignAndCheckForModification(this, SongCollection, const_cast(this)->Artist, getOggFieldString(vc, "ARTIST"), FIELD_ARTIST); assignAndCheckForModification(this, SongCollection, const_cast(this)->Performer, getOggFieldString(vc, "PERFORMER"), FIELD_PERFORMER); assignAndCheckForModification(this, SongCollection, const_cast(this)->Title, getOggFieldString(vc, "TITLE"), FIELD_TITLE); assignAndCheckForModification(this, SongCollection, const_cast(this)->Year, getOggFieldString(vc, "YEAR"), FIELD_YEAR); assignAndCheckForModification(this, SongCollection, const_cast(this)->Genre, getOggFieldString(vc, "GENRE"), FIELD_GENRE); assignAndCheckForModification(this, SongCollection, const_cast(this)->TrackNumber, getOggFieldString(vc, "TRACKNUMBER"), FIELD_TRACKNUMBER); assignAndCheckForModification(this, SongCollection, const_cast(this)->Duration, ov_time_total(&vf, -1), FIELD_DURATION); ov_clear(&vf); tSong::readInfo(); } void tOggSong::setAlbum(QString const &value) { setOggFieldString(filename(), "ALBUM", value); readInfo(); } void tOggSong::setArtist(QString const &value) { setOggFieldString(filename(), "ARTIST", value); readInfo(); } void tOggSong::setPerformer(QString const &value) { setOggFieldString(filename(), "PERFORMER", value); readInfo(); } void tOggSong::setTitle(QString const &value) { setOggFieldString(filename(), "TITLE", value); readInfo(); } void tOggSong::setYear(QString const &value) { setOggFieldString(filename(), "YEAR", value); readInfo(); } void tOggSong::setGenre(QString const &value) { setOggFieldString(filename(), "GENRE", value); readInfo(); } void tOggSong::setTrackNumber(QString const &value) { setOggFieldString(filename(), "TRACKNUMBER", value); readInfo(); } void tOggSong::stripTagInternal() { // *** FIXME: NYI } // public --------------------------------------------------------------------- tSong *makeSong(tFilename const &filename) { if (filename.size() < 3) throw tRuntimeError( qApp->translate("ErrorMessages", "Unknown file type: %1") .arg(string2QString(filename))); tFilename ext = filename.substr(filename.size() - 3); if (string2QString(ext).lower() == "mp3") { tSong *song = new tMP3Song; song->setFilename(filename); return song; } if (string2QString(ext).lower() == "ogg") { tSong *song = new tOggSong; song->setFilename(filename); return song; } throw tRuntimeError( qApp->translate("ErrorMessages", "Unknown file type: %1") .arg(string2QString(filename))); } tSong *deserializeSong(const char **attributes) { tFilename filename; filename = decodeFilename(lookupAttribute("filename", attributes)); tSong *song = makeSong(filename); song->deserialize(attributes); return song; } // // Local Variables: // mode: C++ // eval: (c-set-style "stroustrup") // eval: (c-set-offset 'access-label -2) // eval: (c-set-offset 'inclass '++) // c-basic-offset: 2 // tab-width: 8 // End: madman-0.93/database/song_collection.cpp0000644000175000001440000002221510053135241020101 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "utility/progress.h" #include #include #include #include #include #include "song_collection.h" tSongCollection::tSongCollection() : NextUniqueId(0) {} void tSongCollection::readTags(tProgress *progress, const QString &progresstext, tSongList *list) { if (list == NULL) list = &SongList; progress->setWhat(progresstext); progress->setTotalSteps(list->size()); int index = 0; FOREACH(first, *list, tSongList) { cout << "read tag: " << (*first)->filename() << endl; try { (*first)->ensureInfoIsThere(); } catch (runtime_error &ex) { cerr << "*** error while reading tags from " << (*first)->filename() << ":"<< endl << " " << ex.what() << endl; } ++index; if (index % 10 == 0) { progress->setProgress(index); if (progress->wasCancelled()) break; } } } void tSongCollection::rereadTags(tProgress *progress) { progress->setWhat(tr("Reading tags...")); progress->setTotalSteps(SongList.size()); int index = 0; FOREACH(first, SongList, tSongList) { cout << "read tag: " << (*first)->filename() << endl; (*first)->invalidateCache(); (*first)->ensureInfoIsThere(); ++index; if (index % 10 == 0) { progress->setProgress(index); if (progress->wasCancelled()) break; } } } void tSongCollection::scan(tDirectoryList const &dl, tProgress *progress) { emit notifyBeginBulkChange(); // scan for new songs progress->setWhat(tr("Scanning for files...")); New.clear(); progress->setTotalSteps(0); FOREACH_CONST(first, dl, tDirectoryList) scanSingleDirectory(*first, progress); // look for removed songs progress->setWhat(tr("Looking for unwanted songs...")); progress->setTotalSteps(SongList.size()); int index = 0; tSongList unwanted_songs; FOREACH(first, SongList, tSongList) { bool found = false; FOREACH_CONST(first_d, dl, tDirectoryList) if ((*first)->filename().substr(0, first_d->length()) == *first_d) found = true; if (!found) unwanted_songs.push_back(*first); ++index; if (index % 10 == 0) { progress->setProgress(index); } } // remove unwanted songs FOREACH(first, unwanted_songs, tSongList) { cerr << "unwanted: " << (*first) ->filename() << endl; remove (*first); } // look for orphans progress->setWhat(tr("Looking for orphans...")); progress->setTotalSteps(SongList.size()); index = 0; Orphans.clear(); FOREACH(first, SongList, tSongList) { struct stat statbuf; if (stat((*first)->filename().c_str(), &statbuf)) Orphans.push_back(*first); ++index; if (index % 10 == 0) { progress->setProgress(index); } } // read tags now so move detection can use them. readTags(progress, tr("Updating existing tags...")); readTags(progress, tr("Reading tags of new songs..."), &New); // compare them to new songs to detect moves progress->setWhat(tr("Detecting moves...")); progress->setTotalSteps(Orphans.size()); index = 0; tSongList::iterator first_o = Orphans.begin(), last_o = Orphans.end(); while (first_o != last_o) { tSongList::iterator first_n = New.begin(), last_n = New.end(); while (first_n != last_n) { if ((*first_n)->album() == (*first_o)->album() && (*first_n)->artist() == (*first_o)->artist() && (*first_n)->title() == (*first_o)->title()) { cerr << "move: " << (*first_o)->filename() << " -> " << (*first_n)->filename() << endl; (*first_n)->setExistsSince((*first_o)->existsSince()); // lastModified kept from new song. (*first_n)->setLastPlayed((*first_o)->lastPlayed()); (*first_n)->setFullPlayCount((*first_o)->fullPlayCount()); (*first_n)->setPartialPlayCount((*first_o)->partialPlayCount()); (*first_n)->setRating((*first_o)->rating()); break; } else first_n++; } first_o++; progress->setProgress(++index); } // add new songs progress->setWhat(tr("Adding songs...")); progress->setTotalSteps(New.size()); index = 0; FOREACH(first, New, tSongList) { cerr << "add: " << (*first) ->filename() << endl; try { // this is needed for the sake of proper exception handling, // fix courtesy of Klaus S. Madsen (*first)->ensureInfoIsThere(); insert(*first, false); } catch (exception &ex) { cerr << "*** exception while adding" << endl << "*** " <<(*first)->filename() << ":" << endl << "*** " << ex.what() << endl; delete *first; } ++index; if (index % 10 == 0) { progress->setProgress(index); } } // remove orphaned songs FOREACH(first, Orphans, tSongList) { cerr << "delete: " << (*first) ->filename() << endl; remove(*first); } // reread tags of songs that were modified since last scan progress->setWhat(tr("Updating tags of changed songs...")); progress->setTotalSteps(SongList.size()); index = 0; FOREACH(first, SongList, tSongList) { struct stat statbuf; if (stat((*first)->filename().c_str(), &statbuf)) throw tRuntimeError(tr("File not present after orphan detection. Weird.")); if (statbuf.st_mtime > (*first)->lastModified()) { cerr << "changed: " << (*first) ->filename() << endl; (*first)->invalidateCache(); (*first)->ensureInfoIsThere(); } ++index; if (index % 10 == 0) { progress->setProgress(index); } } emit notifyEndBulkChange(); } void tSongCollection::insert(tSong *song, bool loaded) { if (song->uniqueId() == SONG_UID_INVALID) song->setUniqueId(nextUniqueId()); SongList.push_back(song); FilenameMap.insert(make_pair(song->filename(), song)); UniqueIdMap.insert(make_pair(song->uniqueId(), song)); if (loaded) emit notifyLoad(song); else emit notifyAddition(song); song->setCollection(this); } void tSongCollection::remove(tSong *song) { emit notifyDeletion(song); FilenameMap.erase(song->filename()); UniqueIdMap.erase(song->uniqueId()); FOREACH(first, SongList, tSongList) if (*first == song) { SongList.erase(first); break; } } void tSongCollection::clear() { emit notifyBeginBulkChange(); while (SongList.size() > 0) remove(SongList[ SongList.size() - 1 ]); emit notifyEndBulkChange(); } void tSongCollection::noticeSongModified(const tSong *song, tSongField field) { emit notifySongModified(song, field); } void tSongCollection::noticeSongFilenameAboutToChange(tSong *song, const tFilename &old, const tFilename ¤t) { FilenameMap.erase(string(old)); FilenameMap.insert(make_pair(current, song)); } void tSongCollection::beginBulkChange() { emit notifyBeginBulkChange(); } void tSongCollection::endBulkChange() { emit notifyEndBulkChange(); } QDomNode tSongCollection::serialize(QDomDocument &doc) const { QDomElement result = doc.createElement("songs"); FOREACH_CONST(first, SongList, tSongList) result.appendChild((*first)->serialize(doc)); return result; } tSong *tSongCollection::getByFilename(tFilename const &filename) const { tFilenameMap::const_iterator it = FilenameMap.find(filename); if (it == FilenameMap.end()) return NULL; else return it->second; } tSong *tSongCollection::getByUniqueId(tUniqueId uid) const { tUniqueIdMap::const_iterator it = UniqueIdMap.find(uid); if (it == UniqueIdMap.end()) return NULL; else return it->second; } bool tSongCollection::isValid(const tSong *song) const { FOREACH_CONST(first, SongList, tSongList) if ((*first) == song) return true; return false; } tUniqueId tSongCollection::nextUniqueId() { while (getByUniqueId(NextUniqueId)) NextUniqueId++; return NextUniqueId++; } void tSongCollection::scanSingleDirectory(tFilename const &dir, tProgress *progress) { vector files; enumerateFiles(dir, files, progress); FOREACH(first, files, vector) try { if (FilenameMap.find(*first) == FilenameMap.end()) { auto_ptr song(makeSong(*first)); New.push_back(song.get()); song.release(); } } catch (...) { } } // Stuff to tell EMACS how to format this file. // Local Variables: // mode: C++ // eval: (c-set-style "stroustrup") // eval: (c-set-offset 'inline-open 0) // eval: (c-set-offset 'access-label -1) // c-basic-offset: 2 // tab-width: 8 // End: madman-0.93/database/song_list_tools.cpp0000644000175000001440000001653210053135241020146 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "database/song_list_tools.h" // comparison helpers --------------------------------------------------------- #define MAKE_STRING_SONG_LESS(CLASSNAME, FIELD) \ struct CLASSNAME \ { \ bool operator()(tSong *song1, tSong *song2) \ { \ return song1->FIELD().lower().localeAwareCompare(song2->FIELD().lower()) < 0; \ } \ }; #define MAKE_CXX_STRING_SONG_LESS(CLASSNAME, FIELD) \ struct CLASSNAME \ { \ bool operator()(tSong *song1, tSong *song2) \ { \ return QString::fromUtf8(song1->FIELD().c_str()).lower().localeAwareCompare( \ QString::fromUtf8(song2->FIELD().c_str()).lower()) < 0; \ } \ }; #define MAKE_NUMERIC_SONG_LESS(CLASSNAME, FIELD) \ struct CLASSNAME \ { \ bool operator()(tSong *song1, tSong *song2) \ { \ return song1->FIELD() < song2->FIELD(); \ } \ }; namespace { MAKE_STRING_SONG_LESS(tArtistLess, artist); MAKE_STRING_SONG_LESS(tPerformerLess, performer); MAKE_STRING_SONG_LESS(tTitleLess, title); MAKE_STRING_SONG_LESS(tAlbumLess, album); MAKE_STRING_SONG_LESS(tGenreLess, genre); MAKE_CXX_STRING_SONG_LESS(tFilenameLess, filenameOnly); MAKE_CXX_STRING_SONG_LESS(tPathLess, pathname); MAKE_STRING_SONG_LESS(tMimeTypeLess, mimeType); MAKE_NUMERIC_SONG_LESS(tDurationLess, duration); MAKE_NUMERIC_SONG_LESS(tFullPlayCountLess, fullPlayCount); MAKE_NUMERIC_SONG_LESS(tPartialPlayCountLess, partialPlayCount); MAKE_NUMERIC_SONG_LESS(tPlayCountLess, playCount); MAKE_NUMERIC_SONG_LESS(tLastPlayedLess, lastPlayed); MAKE_NUMERIC_SONG_LESS(tRatingLess, rating); MAKE_NUMERIC_SONG_LESS(tYearLess, year().toInt); // HACKY-WHACKY :) MAKE_NUMERIC_SONG_LESS(tSizeLess, fileSize); MAKE_NUMERIC_SONG_LESS(tExistsSinceLess, existsSince); MAKE_NUMERIC_SONG_LESS(tLastModifiedLess, lastModified); MAKE_NUMERIC_SONG_LESS(tUniqueIdLess, uniqueId); struct tTrackNumberLess { bool operator()(tSong *song1, tSong *song2) { QRegExp extract_numbers("^\\s*([0-9]+)"); if (extract_numbers.search(song1->trackNumber()) != -1) { int my_track = extract_numbers.cap(1).toInt(); if (extract_numbers.search(song2->trackNumber()) != -1) { // both have track numbers, compare them int other_track = extract_numbers.cap(1).toInt(); return my_track < other_track; } else { // other is smaller since it has no track number return false; } } else { if (extract_numbers.search(song2->trackNumber()) != -1) return true; // "this" is smaller since it has no track number else return false; // neither has a track number } } }; } void sort(tSongList &list, tSongField field) { switch (field) { // FIXME switch back to sort when bug in gcc is gone case FIELD_ARTIST : stable_sort(list.begin(), list.end(), tArtistLess()); break; case FIELD_PERFORMER : stable_sort(list.begin(), list.end(), tPerformerLess()); break; case FIELD_TITLE : stable_sort(list.begin(), list.end(), tTitleLess()); break; case FIELD_ALBUM : stable_sort(list.begin(), list.end(), tAlbumLess()); break; case FIELD_TRACKNUMBER : stable_sort(list.begin(), list.end(), tTrackNumberLess()); break; case FIELD_DURATION : stable_sort(list.begin(), list.end(), tDurationLess()); break; case FIELD_GENRE : stable_sort(list.begin(), list.end(), tGenreLess()); break; case FIELD_FULLPLAYCOUNT : stable_sort(list.begin(), list.end(), tFullPlayCountLess()); break; case FIELD_PARTIALPLAYCOUNT : stable_sort(list.begin(), list.end(), tPartialPlayCountLess()); break; case FIELD_PLAYCOUNT : stable_sort(list.begin(), list.end(), tPlayCountLess()); break; case FIELD_LASTPLAYED : stable_sort(list.begin(), list.end(), tLastPlayedLess()); break; case FIELD_RATING : stable_sort(list.begin(), list.end(), tRatingLess()); break; case FIELD_YEAR : stable_sort(list.begin(), list.end(), tYearLess()); break; case FIELD_FILE : stable_sort(list.begin(), list.end(), tFilenameLess()); break; case FIELD_PATH : stable_sort(list.begin(), list.end(), tPathLess()); break; case FIELD_SIZE : stable_sort(list.begin(), list.end(), tSizeLess()); break; case FIELD_EXISTSSINCE : stable_sort(list.begin(), list.end(), tExistsSinceLess()); break; case FIELD_LASTMODIFIED : stable_sort(list.begin(), list.end(), tLastModifiedLess()); break; case FIELD_MIMETYPE: stable_sort(list.begin(), list.end(), tMimeTypeLess()); break; case FIELD_UNIQUEID: stable_sort(list.begin(), list.end(), tUniqueIdLess()); break; default: throw tRuntimeError("Invalid field id while sorting SongSetEntryList"); } } // song list summaries -------------------------------------------------------- tSongListSummary getSongListSummary(tSongList &list) { tSongListSummary result; result.DurationTotal = 0; result.SizeTotal = 0; result.Count = list.size(); FOREACH_CONST(first, list, tSongList) { result.DurationTotal += (*first)->duration(); result.SizeTotal += (*first)->fileSize() / (1024. * 1024); } double duration = result.DurationTotal; result.DurationDays = int(duration / 3600. / 24.); duration -= result.DurationDays * 3600 * 24; result.DurationHours = int(duration / 3600); duration -= result.DurationHours * 3600; result.DurationMinutes = int(duration / 60); duration -= result.DurationMinutes * 60; result.DurationSeconds = int(duration); if (list.size()) result.FirstFilename = QString::fromUtf8(list[0]->filename().c_str()); return result; } QString stringifySongListSummary(const tSongListSummary &sum) { QString duration_string; if (sum.DurationDays) duration_string.sprintf("%d days %d:%02d:%02d", sum.DurationDays, sum.DurationHours, sum.DurationMinutes, sum.DurationSeconds); else if (sum.DurationHours) duration_string.sprintf("%d:%02d:%02d", sum.DurationHours, sum.DurationMinutes, sum.DurationSeconds); else duration_string.sprintf("%2d:%02d", sum.DurationMinutes, sum.DurationSeconds); QString result; if (sum.Count == 0) { result = qApp->translate("StatusMessages", "0 songs"); } else if (sum.Count == 1) { result = qApp->translate("StatusMessages", "%1 - Duration %2, Size %3 ]") .arg(sum.FirstFilename) .arg(duration_string) .arg(qApp->translate("StatusMessages", "%1 MB").arg(sum.SizeTotal, 0, 'f', 2)); } else { result = qApp->translate("StatusMessages", "%1 songs - Duration %2 - Size %3") .arg(sum.Count) .arg(duration_string) .arg(qApp->translate("StatusMessages", "%1 MB").arg(sum.SizeTotal, 0, 'f', 2)); } return result; } QString stringifySongListSummary(tSongList &list) { return stringifySongListSummary(getSongListSummary(list)); } madman-0.93/database/song_set.cpp0000644000175000001440000003732610053135241016552 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "database/song_set.h" #include "database/criterion.h" #include "database/song_list_tools.h" #include "utility/progress.h" namespace { template QDomNode serializeUniqueIdContainer(QDomDocument &doc, QString const &name, T const &uid_list) { QDomElement result = doc.createElement(name); FOREACH_CONST(first, uid_list, typename T) { QDomElement song = doc.createElement("song"); result.appendChild(song); song.setAttribute("unique_id", *first); } return result; } } // tSongSet ------------------------------------------------------------------- tSongSet::tSongSet() : SongCollection(NULL), ParsedCriterion(NULL), BulkChangeLevel(0) { setCriterion("~none"); } tSongSet::~tSongSet() { } void tSongSet::setSongCollection(tSongCollection *collection) { if (SongCollection) disconnect(SongCollection, NULL, this, NULL); clear(false); SongCollection = collection; if (SongCollection) { connect(SongCollection, SIGNAL(notifyBeginBulkChange()), this, SLOT(noticeCollectionBeginBulkChange())); connect(SongCollection, SIGNAL(notifyEndBulkChange()), this, SLOT(noticeCollectionEndBulkChange())); connect(SongCollection, SIGNAL(notifyAddition(const tSong *)), this, SLOT(noticeCollectionAddition(const tSong *))); connect(SongCollection, SIGNAL(notifyDeletion(const tSong *)), this, SLOT(noticeCollectionDeletion(const tSong *))); connect(SongCollection, SIGNAL(notifySongModified(const tSong *, tSongField)), this, SLOT(noticeSongModified(const tSong *, tSongField))); reevaluateCriterion(); } noticeCollectionSwitched(); } tSongSet &tSongSet::operator=(const tSongSet &src) { SongCollection = src.SongCollection; setCriterion(src.Criterion); hasChanged(true); return *this; } void tSongSet::render(tConstSongList &rendering, tProgress *progress) const { tSongList pre_rendering; render(pre_rendering, progress); rendering.clear(); FOREACH(first, pre_rendering, tSongList) rendering.push_back(*first); } void tSongSet::renderToUniqueIdList(tUniqueIdList &uidlist, tProgress *progress) { tSongList rendering; render(rendering, progress); uidlist.clear(); FOREACH(first, rendering, tSongList) uidlist.push_back((*first)->uniqueId()); } void tSongSet::clear(bool criterion) { if (criterion) setCriterion("~none"); } void tSongSet::setCriterion(tCriterion *crit) { auto_ptr parsed_crit(crit); ParsedCriterion = parsed_crit; } void tSongSet::setCriterion(const QString &new_crit) { if (new_crit == Criterion) return; auto_ptr parsed_crit(parseCriterion(new_crit)); ParsedCriterion = parsed_crit; Criterion = new_crit; } void tSongSet::beginBulkChange() { BulkChangeLevel++; SubstantialBulkChange = false; } void tSongSet::endBulkChange() { /* The if is necessary since this happens during loading: * Newly loaded song sets catch the endBulkChange() after * loading finishes, but weren't loaded for the beginBulkChange() * when it started. */ if (BulkChangeLevel > 0) BulkChangeLevel--; hasChanged(SubstantialBulkChange); } void tSongSet::hasChanged(bool substantial_change, tProgress *progress) { if (BulkChangeLevel == 0) emit notifyChange(substantial_change, progress); else { if (substantial_change) SubstantialBulkChange = true; } } // tSearchSongSet ------------------------------------------------------------- tSearchSongSet::tSearchSongSet() { DoSort = false; SAUDirty = true; CollectionBulkChangeLevel = 0; } void tSearchSongSet::reevaluateCriterion(tProgress *progress) { if (SAUDirty) rebuildSortedAndUnrestricted(); Rendering.clear(); unsigned progress_index = 0; FOREACH_CONST(first, SortedAndUnrestricted, tSongList) { float match = ParsedCriterion->matchDegree(*first); if (match >= 0.5) Rendering.push_back(*first); if (progress_index % 100 == 0 && progress) { progress->processEvents(); if (progress->wasCancelled()) return; } progress_index++; } hasChanged(true, progress); } void tSearchSongSet::render(tSongList &rendering, tProgress * /*progress*/) const { rendering = Rendering; } void tSearchSongSet::setSort(bool do_sort, tSongField field, bool ascending) { DoSort = do_sort; SortField = field; Ascending = ascending; SAUDirty = true; reevaluateCriterion(); hasChanged(true); } void tSearchSongSet::rebuildSortedAndUnrestricted() { if (!SongCollection) throw tRuntimeError("rebuildSortedAndUnrestricted: No song collection available"); SortedAndUnrestricted.clear(); FOREACH_CONST(first, *SongCollection, tSongCollection) SortedAndUnrestricted.push_back(*first); if (DoSort) { sort(SortedAndUnrestricted, SortField); if (!Ascending) reverse(SortedAndUnrestricted.begin(), SortedAndUnrestricted.end()); } SAUDirty = false; } bool tSearchSongSet::containsSong(tUniqueId uid) const { tSong *song = SongCollection->getByUniqueId(uid); if (song) return ParsedCriterion->matchDegree(song) > 0.5; else { throw tRuntimeError("tSearchSongSet::containsSong: Song uniqueId nonexistant"); } } void tSearchSongSet::noticeCollectionSwitched() { SAUDirty = true; reevaluateCriterion(); hasChanged(false); } void tSearchSongSet::noticeCollectionBeginBulkChange() { beginBulkChange(); CollectionBulkChangeLevel++; } void tSearchSongSet::noticeCollectionEndBulkChange() { CollectionBulkChangeLevel--; if (CollectionBulkChangeLevel == 0) { SAUDirty = true; reevaluateCriterion(); endBulkChange(); } } void tSearchSongSet::noticeCollectionAddition(const tSong * /*song*/) { if (CollectionBulkChangeLevel == 0) { SAUDirty = true; reevaluateCriterion(); hasChanged(false); } } void tSearchSongSet::noticeCollectionDeletion(const tSong *song) { if (CollectionBulkChangeLevel == 0) { tSongList::iterator it = find(SortedAndUnrestricted.begin(), SortedAndUnrestricted.end(), song); if (it == SortedAndUnrestricted.end()) throw tRuntimeError("Song to be deleted was not in SAU."); SortedAndUnrestricted.erase(it); it = find(Rendering.begin(), Rendering.end(), song); if (it != Rendering.end()) Rendering.erase(it); hasChanged(false); } } void tSearchSongSet::noticeSongModified(const tSong *song, tSongField field) { if (CollectionBulkChangeLevel == 0) { if (field == SortField) { SAUDirty = true; reevaluateCriterion(); } else { tSongList::iterator it = find(Rendering.begin(), Rendering.end(), song); bool was_in = it != Rendering.end(); bool is_in = ParsedCriterion->matchDegree(song) > 0.5; if (was_in && !is_in) { Rendering.erase(it); hasChanged(false); } else if (is_in && !was_in) { // FIXME this could be optimized by inserting the song directly into SAU. SAUDirty = true; reevaluateCriterion(); hasChanged(false); } } } emit notifySongModified(song, field); } // tPlaylist ------------------------------------------------------------------ tPlaylist &tPlaylist::operator=(const tPlaylist &src) { Rendering = src.Rendering; RenderingSet = src.RenderingSet; PositiveSet = src.PositiveSet; NegativeSet = src.NegativeSet; hasChanged(true); tSongSet::operator=(src); return *this; } void tPlaylist::sortBy(tSongField field, bool ascending) { sort(Rendering, field); if (!ascending) ::reverse(Rendering.begin(), Rendering.end()); hasChanged(false); } void tPlaylist::jumble() { srand(time(NULL)); for (unsigned i = 0; i < Rendering.size(); i++) { int new_index = rand() % Rendering.size(); tSong *buffer_old = Rendering[ new_index ]; Rendering[ new_index ] = Rendering[ i ]; Rendering[ i ] = buffer_old; } hasChanged(false); } void tPlaylist::reverse() { std::reverse(Rendering.begin(), Rendering.end()); hasChanged(false); } void tPlaylist::add(tSong *song, int preferred_index) { float match = ParsedCriterion->matchDegree(song); addToRendering(song, preferred_index); if (match < 0.5) PositiveSet.insert(song->uniqueId()); NegativeSet.erase(song->uniqueId()); hasChanged(false); } void tPlaylist::add(const tFilename &filename, int preferred_index) { tSong *song = SongCollection->getByFilename(filename); if (song) add(song, preferred_index); else throw tRuntimeError(tr("Unable to add unknown file %1" ) .arg(QString::fromUtf8(filename.c_str()))); } void tPlaylist::remove(int index) { if (index >= (int) Rendering.size()) { qWarning("tried to remove song out of bounds"); return; } tSong *song = Rendering[ index ]; removeFromRendering(index); float match = ParsedCriterion->matchDegree(song); PositiveSet.erase(song->uniqueId()); if (match >= 0.5) NegativeSet.insert(song->uniqueId()); hasChanged(false); } void tPlaylist::remove(tSong *song) { removeFromRendering(song); PositiveSet.erase(song->uniqueId()); float match = ParsedCriterion->matchDegree(song); if (match >= 0.5) NegativeSet.insert(song->uniqueId()); hasChanged(false); } void tPlaylist::clear(bool criterion) { Rendering.clear(); RenderingSet.clear(); PositiveSet.clear(); NegativeSet.clear(); tSongSet::clear(criterion); } void tPlaylist::reevaluateCriterion(tProgress *progress) { if (progress) progress->setWhat(tr("Searching...")); unsigned progress_index = 0; // reevaluate current rendering unsigned index = 0; while (index < Rendering.size()) { tSong *song = Rendering[ index ]; float match = ParsedCriterion->matchDegree(song); if (match < 0.5 && PositiveSet.count(song->uniqueId()) == 0) removeFromRendering(index); else index++; if (progress_index % 100 == 0 && progress) { progress->processEvents(); if (progress->wasCancelled()) return; } progress_index++; } // reevaluate the whole collection FOREACH_CONST(first, *SongCollection, tSongCollection) { tUniqueId uid = (*first)->uniqueId(); float match = ParsedCriterion->matchDegree((*first)); if (match >= 0.5 && (NegativeSet.count(uid) == 0) && !containsSong(uid)) addToRendering(*first); if (progress_index % 100 == 0 && progress) { progress->processEvents(); if (progress->wasCancelled()) return; } progress_index++; } hasChanged(true, progress); } void tPlaylist::render(tSongList &rendering, tProgress * /*progress*/) const { rendering = Rendering; } void tPlaylist::noticeCollectionSwitched() { } void tPlaylist::noticeCollectionBeginBulkChange() { beginBulkChange(); } void tPlaylist::noticeCollectionEndBulkChange() { endBulkChange(); } void tPlaylist::noticeCollectionAddition(const tSong *song) { float match = ParsedCriterion->matchDegree(song); if (match >= 0.5 && NegativeSet.count(song->uniqueId()) == 0) addToRendering(song); hasChanged(false); } void tPlaylist::noticeCollectionDeletion(const tSong *song) { int index = 0; while (index < (int) Rendering.size()) { if (Rendering[index] == song) removeFromRendering(index); else index++; } NegativeSet.erase(song->uniqueId()); PositiveSet.erase(song->uniqueId()); hasChanged(false); } void tPlaylist::noticeSongModified(const tSong *song, tSongField field) { // matchesCriterion needs to be called first since it may actually recursively // end up calling this function! float match = ParsedCriterion->matchDegree(song); bool matches_criterion = match >= 0.5; bool in_rendering = containsSong(song->uniqueId()); if (in_rendering) { if (!matches_criterion && PositiveSet.count(song->uniqueId()) == 0) { removeFromRendering(song); hasChanged(false); } } else { if (matches_criterion && NegativeSet.count(song->uniqueId()) == 0) { addToRendering(song); hasChanged(false); } } emit notifySongModified(song, field); } QDomNode tPlaylist::serialize(QDomDocument &doc) { QDomElement result = doc.createElement("song_set"); result.setAttribute("criterion", Criterion); tUniqueIdList rendering; renderToUniqueIdList(rendering); result.appendChild(serializeUniqueIdContainer(doc, "rendering", rendering)); result.appendChild(serializeUniqueIdContainer(doc, "positiveset", PositiveSet)); result.appendChild(serializeUniqueIdContainer(doc, "negativeset", NegativeSet)); return result; } void tPlaylist::setRendering(const tUniqueIdList &list) { FOREACH_CONST(first, list, tUniqueIdList) { tSong *song = SongCollection->getByUniqueId(*first); if (song) { RenderingSet.insert(*first); Rendering.push_back(song); } } } void tPlaylist::setPositiveSet(const tUniqueIdList &list) { FOREACH_CONST(first, list, tUniqueIdList) { tSong *song = SongCollection->getByUniqueId(*first); if (song) PositiveSet.insert(*first); } } void tPlaylist::setNegativeSet(const tUniqueIdList &list) { FOREACH_CONST(first, list, tUniqueIdList) { tSong *song = SongCollection->getByUniqueId(*first); if (song) NegativeSet.insert(*first); } } void tPlaylist::addToRendering(const tSong *song, int preferred_index) { tUniqueId uid = song->uniqueId(); if (preferred_index == -1 || preferred_index > (int) Rendering.size()) Rendering.push_back(const_cast(song)); else Rendering.insert(Rendering.begin() + preferred_index, const_cast(song)); // multiple insertions don't hurt RenderingSet.insert(uid); } void tPlaylist::removeFromRendering(const tSong *song) { int index = 0; while (index < (int) Rendering.size()) { if (Rendering[index] == song) removeFromRendering(index); else index++; } } void tPlaylist::removeFromRendering(int index) { tSong *song = Rendering[ index ]; tUniqueId uid = song->uniqueId(); Rendering.erase(Rendering.begin() + index); // is there no other instance? FOREACH(first, Rendering, tSongList) { if (*first == song) return; } // then erase song from the rendering set RenderingSet.erase(uid); } void importM3UIntoPlaylist(tPlaylist *song_set, const QString &filename) { if (song_set == NULL) return; // FIXME encodings unclear QFile dbfile(filename); if (dbfile.open(IO_ReadOnly)) { QTextStream textstr(&dbfile); while (!textstr.atEnd()) { QString line = textstr.readLine(); if (line[ 0 ] == '#') continue; try { song_set->add(string(line.utf8())); } catch (...) { } } } else throw tRuntimeError(QString("Could not open M3U file '%1'").arg(filename)); } // Stuff to tell EMACS how to format this file. // Local Variables: // mode: C++ // eval: (c-set-style "stroustrup") // eval: (c-set-offset 'access-label -2) // eval: (c-set-offset 'inline-open 0) // c-basic-offset: 2 // tab-width: 8 // End: madman-0.93/database/song_set_tree.cpp0000644000175000001440000001005310053135241017555 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "song_set_tree.h" #include "database/database.h" tPlaylistNode::tPlaylistNode(tDatabase *db, tPlaylist *data) : Parent(NULL), Data(data), Database(db) { } tPlaylistNode::~tPlaylistNode() { clear(); delete Data; } tPlaylistNode *tPlaylistNode::parent() { return Parent; } void tPlaylistNode::addChild(tPlaylistNode *node) { if (resolve(node->name())) throw tRuntimeError( qApp->translate("ErrorMessages", "Playlist name '%1' is not unique, not added.") .arg(node->name()) ); node->Parent = this; ChildrenList.push_back(node); Database->noticePlaylistTreeChanged(); } void tPlaylistNode::insertChild(tPlaylistNode *node, iterator it) { if (resolve(node->name())) throw tRuntimeError( qApp->translate("ErrorMessages", "Playlist name '%1' is not unique, not added.") .arg(node->name()) ); node->Parent = this; ChildrenList.insert(it, node); Database->noticePlaylistTreeChanged(); } void tPlaylistNode::removeChild(tPlaylistNode *node) { node->Parent = NULL; FOREACH(first, ChildrenList, tChildrenList) if (node == *first) ChildrenList.erase(first); Database->noticePlaylistTreeChanged(); } void tPlaylistNode::clear() { FOREACH(first, ChildrenList, tChildrenList) delete * first; ChildrenList.clear(); } QString tPlaylistNode::qualifiedName() { if (Parent && Parent->Parent) return Parent->qualifiedName() + "/" + name(); else return name(); } tPlaylistNode *tPlaylistNode::resolve(const QString &path) { if (path == "") return this; int slash_index = path.find('/'); QString local_component,remainder; if (slash_index == -1) local_component = path; else { local_component = path.left(slash_index); remainder = path.mid(slash_index + 1); } FOREACH_CONST(first, ChildrenList, tChildrenList) { if (local_component == (*first)->name()) { if (slash_index == -1) return *first; else return (*first)->resolve(remainder); } } return NULL; } bool tPlaylistNode::hasParent(tPlaylistNode *node) { if (Parent == node) return true; if (Parent) return Parent->hasParent(node); else return false; } QString const &tPlaylistNode::name() { return Name; } void tPlaylistNode::setName(QString const &name) { if (Name == name) return; if (name.find('/') != -1) throw tRuntimeError(qApp->translate("ErrorMessages", "Slashes may not occur in playlist names.")); if (name == "") throw tRuntimeError(qApp->translate("ErrorMessages", "Playlist names may not be empty.")); if (Parent && Parent->resolve(name)) throw tRuntimeError( qApp->translate("ErrorMessages", "Playlist name '%1' is not unique, not set.") .arg(name) ); Name = name; Database->noticePlaylistTreeChanged(); } tPlaylist *tPlaylistNode::data() { return Data; } void tPlaylistNode::setData(tPlaylist *data) { if (data) delete Data; Data = data; Database->noticePlaylistTreeChanged(); } QDomNode tPlaylistNode::serialize(QDomDocument &doc) { QDomElement result = doc.createElement("song_set_node"); result.setAttribute("name", Name); if (Data) result.appendChild(Data->serialize(doc)); FOREACH(first, ChildrenList, tChildrenList) result.appendChild((*first) ->serialize(doc)); return result; } madman-0.93/database/SConscript0000644000175000001440000000101310053135242016220 0ustar akusers00000000000000Import( "env" ) myenv = env.Copy() myenv.Tool( "qt" ) myenv.Append( CPPPATH = "#" ) myenv.Append( CPPPATH = myenv[ 'QT_CPPPATH' ] ) myenv.Append( CPPPATH = myenv[ 'GLIB_CPPPATH' ] ) myenv.Append( CPPPATH = myenv[ 'LIBID3TAG_CPPPATH' ] ) myenv.Append( CPPPATH = myenv[ 'VORBIS_CPPPATH' ] ) myenv.StaticLibrary( target = "madmandatabase", source = [ "database.cpp", "history.cpp", "song.cpp", "song_collection.cpp", "song_set.cpp", "song_set_tree.cpp", "auto_dj.cpp", "song_list_tools.cpp", "criterion.cpp" ] ) madman-0.93/httpd/0000755000175000001440000000000010053135242013572 5ustar akusers00000000000000madman-0.93/httpd/httpd.h0000644000175000001440000000770010053135241015071 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 _HEADER_SEEN_HTTPD_H #define _HEADER_SEEN_HTTPD_H #include #include #include "utility/base.h" #include class QSocket; class QUrl; struct tHttpException : public runtime_error { int HttpStatusCode; tHttpException(int status_code, const QString &str) : runtime_error(str.latin1()), HttpStatusCode(status_code) { } }; class tHttpResponseHeader : public QHttpHeader { public: tHttpResponseHeader(); tHttpResponseHeader(const tHttpResponseHeader& header); tHttpResponseHeader(int code, const QString& text = QString::null, int majorVer = 1, int minorVer = 1); tHttpResponseHeader(const QString& str); void setStatusLine(int code, const QString& text = QString::null, int majorVer = 1, int minorVer = 1); int statusCode() const; QString reasonPhrase() const; int majorVersion() const; int minorVersion() const; bool parseLine(const QString& line, int number); QString toString() const; private: int statCode; QString reasonPhr; int majVer; int minVer; }; class tHttpResponder { public: virtual bool canHandle(const QUrl &url, QHttpRequestHeader &header) = 0; /** Handles the request and gives ownership of the socket to * a tHttpResponseSender, which will eventually destroy it. */ virtual void handle(const QUrl &url, const QHttpRequestHeader &header, QSocket *&socket) = 0; }; class tHttpResponseSender : public QObject { Q_OBJECT; protected: QSocket *Socket; private: QCString Header; unsigned SizeOfSentHeader; bool CurrentlySending; bool AlreadyClosing; public: tHttpResponseSender(); virtual ~tHttpResponseSender(); virtual void setHeader(tHttpResponseHeader &header); virtual void readyToSend() = 0; void kickOff(QSocket *&socket); public slots: void readyToSendInternal(int dummy); void connectionClosed(); }; class tHttpStringResponseSender : public tHttpResponseSender { QCString Document; unsigned SizeOfSentDocument; typedef tHttpResponseSender super; public: tHttpStringResponseSender(const QCString &document); void setHeader(tHttpResponseHeader &header); void readyToSend(); }; /** This class is for internal use only. */ class tHttpRequestReceiver : public QObject { Q_OBJECT; QSocket *Socket; QString HeadersSoFar; public: /** This class does not assume ownership of the QSocket. */ tHttpRequestReceiver(QSocket *socket); private slots: void dataReady(); void connectionClosed(); signals: void requestReceived(QSocket *socket, const QString &headers); }; class tHttpDaemon : public QServerSocket { Q_OBJECT; typedef vector tResponderList; tResponderList ResponderList; tHttpResponder *DefaultResponder; bool RestrictToLocalhost; public: tHttpDaemon(int port, bool restrict_to_localhost, QObject* parent=0); ~tHttpDaemon(); void newConnection(int socket); void addResponder(tHttpResponder *responder); void setDefaultResponder(tHttpResponder *responder); private slots: void requestReceived(QSocket *socket, const QString &headers); }; #endif madman-0.93/httpd/madmanweb.h0000644000175000001440000000751210053135241015702 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 _HEADER_SEEN_MADMANWEB_H #define _HEADER_SEEN_MADMANWEB_H #include #include #include "httpd.h" #include "ui/program_interface.h" #include "madmanweb_external.h" class tHttpResponderUsingData : public tHttpResponder, public tProgramInterface { tProgramInterface *Interface; public: tHttpResponderUsingData() : Interface(NULL) { } void setProgramInterface(tProgramInterface *interface) { Interface = interface; } protected: void setStatus(const QString &status) { if (Interface) Interface->setStatus(status); else throw tRuntimeError("Program interface unavailable"); } QSettings &settings() { if (Interface) return Interface->settings(); else throw tRuntimeError("Program interface unavailable"); } tDatabase &database() { if (Interface) return Interface->database(); else throw tRuntimeError("Program interface unavailable"); } tPreferences &preferences() { if (Interface) return Interface->preferences(); else throw tRuntimeError("Program interface unavailable"); } void quitApplication() { if (Interface) Interface->quitApplication(); else throw tRuntimeError("Program interface unavailable"); } }; class tHttpFileResponseSender : public tHttpResponseSender { auto_ptr File; unsigned SizeOfSentDocument, TotalSize; typedef tHttpResponseSender super; public: tHttpFileResponseSender(ifstream *file); void setHeader(tHttpResponseHeader &header); void readyToSend(); }; class tHttpBufferResponseSender : public tHttpResponseSender { const char *Buffer; unsigned BufferLength; unsigned SizeOfSentDocument; typedef tHttpResponseSender super; public: tHttpBufferResponseSender(const char *buffer, unsigned length); void setHeader(tHttpResponseHeader &header); void readyToSend(); }; class tStreamingHttpResponder : public tHttpResponderUsingData { public: bool canHandle(const QUrl &url, QHttpRequestHeader &header); void handle(const QUrl &url, const QHttpRequestHeader &header, QSocket *&socket); }; class tStaticDataHttpResponder : public tHttpResponder { public: bool canHandle(const QUrl &url, QHttpRequestHeader &header); void handle(const QUrl &url, const QHttpRequestHeader &header, QSocket *&socket); }; class tBrowseHttpResponder : public tHttpResponderUsingData { public: QString getTitleCell(const QUrl &url, const QString &human_readable, const QString &machine_readable); QString getTitleRow(const QUrl &url); QString getSongRow(tSong *song, bool bright); QString generateMenu(const QUrl &url); bool canHandle(const QUrl &url, QHttpRequestHeader &header); void handle(const QUrl &url, const QHttpRequestHeader &header, QSocket *&socket); }; class tScriptingHttpResponder : public tHttpResponderUsingData { public: bool canHandle(const QUrl &url, QHttpRequestHeader &header); void handle(const QUrl &url, const QHttpRequestHeader &header, QSocket *&socket); }; #endif madman-0.93/httpd/madmanweb_external.h0000644000175000001440000000172210053135241017601 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 _HEADER_SEEN_MADMANWEB_EXTERNAL_H #define _HEADER_SEEN_MADMANWEB_EXTERNAL_H class tHttpDaemon; class tProgramInterface; void addResponders(tHttpDaemon *httpd, tProgramInterface *iface); #endif madman-0.93/httpd/webdata.h0000644000175000001440000000167110053135241015356 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 _HEADER_SEEN_WEBDATA_H #define _HEADER_SEEN_WEBDATA_H const char *getFile(const char *name); const char *getFileType(const char *name); int getFileSize(const char *name); #endif madman-0.93/httpd/httpd.cpp0000644000175000001440000002650610053135241015431 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "httpd.h" // tool functions ------------------------------------------------------------- QString getHttpStatusCodeText(int code) { switch (code) { case 200: return "OK"; case 201: return "Created"; case 202: return "Accepted"; case 203: return "Non-Authoritative Information"; case 204: return "No Content"; case 205: return "Reset Content"; case 206: return "Partial Content"; case 300: return "Multiple Choices"; case 301: return "Moved Permanently"; case 302: return "Found"; case 303: return "See Other"; case 304: return "Not Modified"; case 305: return "Use Proxy"; case 306: return "(Unused)"; case 307: return "Temporary Redirect"; case 400: return "Bad Request"; case 401: return "Unauthorized"; case 402: return "Payment Required"; case 403: return "Forbidden"; case 404: return "Not Found"; case 405: return "Method Not Allowed"; case 406: return "Not Acceptable"; case 407: return "Proxy Authentication Required"; case 408: return "Request Timeout"; case 409: return "Conflict"; case 410: return "Gone"; case 411: return "Length Required"; case 412: return "Precondition Failed"; case 413: return "Request Entity Too Large"; case 414: return "Request-URI Too Long"; case 415: return "Unsupported Media Type"; case 416: return "Requested Range Not Satisfiable"; case 417: return "Expectation Failed"; case 500: return "Internal Server Error"; case 501: return "Not Implemented"; case 502: return "Bad Gateway"; case 503: return "Service Unavailable"; case 504: return "Gateway Timeout"; case 505: return "HTTP Version Not Supported"; default: return QString("").arg(code); } } // tHttpResponseHeader -------------------------------------------------------- tHttpResponseHeader::tHttpResponseHeader() { setValid(FALSE); } tHttpResponseHeader::tHttpResponseHeader(int code, const QString& text, int majorVer, int minorVer) : QHttpHeader(), statCode(code), reasonPhr(text), majVer(majorVer), minVer(minorVer) { } tHttpResponseHeader::tHttpResponseHeader(const tHttpResponseHeader& header) : QHttpHeader(header), statCode(header.statCode), reasonPhr(header.reasonPhr), majVer(header.majVer), minVer(header.minVer) { } tHttpResponseHeader::tHttpResponseHeader(const QString& str) : QHttpHeader() { parse(str); } void tHttpResponseHeader::setStatusLine(int code, const QString& text, int majorVer, int minorVer) { setValid(TRUE); statCode = code; reasonPhr = text; majVer = majorVer; minVer = minorVer; } int tHttpResponseHeader::statusCode() const { return statCode; } QString tHttpResponseHeader::reasonPhrase() const { return reasonPhr; } int tHttpResponseHeader::majorVersion() const { return majVer; } int tHttpResponseHeader::minorVersion() const { return minVer; } bool tHttpResponseHeader::parseLine(const QString& line, int number) { if (number != 0) return QHttpHeader::parseLine(line, number); QString l = line.simplifyWhiteSpace(); if (l.length() < 10) return FALSE; if (l.left(5) == "HTTP/" && l[5].isDigit() && l[6] == '.' && l[7].isDigit() && l[8] == ' ' && l[9].isDigit()) { majVer = l[5].latin1() - '0'; minVer = l[7].latin1() - '0'; int pos = l.find(' ', 9); if (pos != -1) { reasonPhr = l.mid(pos + 1); statCode = l.mid(9, pos - 9).toInt(); } else { statCode = l.mid(9).toInt(); reasonPhr = QString::null; } } else { return FALSE; } return TRUE; } QString tHttpResponseHeader::toString() const { QString ret("HTTP/%1.%2 %3 %4\r\n%5\r\n"); return ret.arg(majVer).arg (minVer).arg(statCode).arg(reasonPhr).arg(QHttpHeader::toString()); } // tHttpResponseSender -------------------------------------------------------- tHttpResponseSender::tHttpResponseSender() : Socket(NULL), SizeOfSentHeader(0), CurrentlySending(false), AlreadyClosing(false) { } tHttpResponseSender::~tHttpResponseSender() { if (Socket) delete Socket; } void tHttpResponseSender::setHeader(tHttpResponseHeader &header) { Header = header.toString().utf8(); } void tHttpResponseSender::kickOff(QSocket *&socket) { if (!socket) throw runtime_error("Attempted to kickOff tHttpResponseSender on NULL socket"); Socket = socket; socket = NULL; connect(Socket, SIGNAL(delayedCloseFinished()), this, SLOT(connectionClosed())); connect(Socket, SIGNAL(connectionClosed()), this, SLOT(connectionClosed())); connect(Socket, SIGNAL(bytesWritten(int)), this, SLOT(readyToSendInternal(int))); readyToSendInternal(0); } void tHttpResponseSender::readyToSendInternal(int dummy) { if (CurrentlySending) return; CurrentlySending = true; while (Socket->bytesToWrite() == 0 && Socket->state() == QSocket::Connected) { unsigned header_length = Header.length(); while (SizeOfSentHeader < header_length) { int written_bytes = Socket->writeBlock(Header.data() + SizeOfSentHeader, header_length - SizeOfSentHeader); if (written_bytes == 0) return; SizeOfSentHeader += written_bytes; } readyToSend(); } CurrentlySending = false; } void tHttpResponseSender::connectionClosed() { if (!AlreadyClosing) { AlreadyClosing = true; deleteLater(); } } // tHttpStringResponseSender -------------------------------------------------- tHttpStringResponseSender::tHttpStringResponseSender(const QCString &document) : Document(document), SizeOfSentDocument(0) { } void tHttpStringResponseSender::setHeader(tHttpResponseHeader &header) { header.setValue("Content-Length", QString::number(Document.length())); super::setHeader(header); } void tHttpStringResponseSender::readyToSend() { unsigned document_length = Document.length(); while (SizeOfSentDocument < document_length) { int written_bytes = Socket->writeBlock( Document.data() + SizeOfSentDocument, document_length - SizeOfSentDocument); if (written_bytes == 0) return; SizeOfSentDocument += written_bytes; } Socket->close(); } // tHttpRequestReceiver ------------------------------------------------------- tHttpRequestReceiver::tHttpRequestReceiver(QSocket *socket) : Socket(socket) { connect(Socket, SIGNAL(readyRead()), this, SLOT(dataReady())); } void tHttpRequestReceiver::dataReady() { char buffer[ 1024 ]; Q_LONG read_bytes; do { read_bytes = Socket->readBlock(buffer, sizeof(buffer)); HeadersSoFar += QString::fromAscii(buffer,read_bytes); } while (read_bytes != 0); // check for reception of complete request header QTextStream stream(&HeadersSoFar, IO_ReadOnly); QString line; do { line = stream.readLine(); if (line == "") { emit requestReceived(Socket, HeadersSoFar); delete this; break; } } while (!line.isNull()); } void tHttpRequestReceiver::connectionClosed() { delete Socket; delete this; } // tHttpDaemon ---------------------------------------------------------------- tHttpDaemon::tHttpDaemon(int port, bool restrict_to_localhost, QObject* parent) : QServerSocket(port, 1, parent), DefaultResponder(NULL), RestrictToLocalhost(restrict_to_localhost) { // QSocket gives us a SIGPIPE when we write to someone who's already disconnected. // FIXME Need to investigage. // FIXME It's not good manners for a "library" function to mess with global // resources like signals. signal(SIGPIPE, SIG_IGN); if (!ok()) throw tRuntimeError(tr("Couldn't bind to port %1").arg(port)); // close server socket on exec fcntl(socket(), F_SETFD, FD_CLOEXEC); } tHttpDaemon::~tHttpDaemon() { FOREACH(first, ResponderList, tResponderList) delete *first; if (DefaultResponder) delete DefaultResponder; } void tHttpDaemon::newConnection(int socket) { QSocket *s = new QSocket(this); s->setSocket(socket); tHttpRequestReceiver *rec = new tHttpRequestReceiver(s); connect(rec, SIGNAL(requestReceived(QSocket*, const QString&)), this, SLOT(requestReceived(QSocket*, const QString&))); } void tHttpDaemon::addResponder(tHttpResponder *responder) { ResponderList.push_back(responder); } void tHttpDaemon::setDefaultResponder(tHttpResponder *responder) { if (DefaultResponder) delete DefaultResponder; DefaultResponder = responder; } void tHttpDaemon::requestReceived(QSocket *socket, const QString &headers) { try { if (!socket->address().isIp4Addr()) throw tHttpException(403, "Non-IP4 connections are currently not allowed."); if (socket->address().ip4Addr() != 0x7f000001 && RestrictToLocalhost) throw tHttpException(403, "Remote connections have been disallowed."); QHttpRequestHeader request(headers); QUrl url; url.setEncodedPathAndQuery(request.path()); bool handled = false; FOREACH(first, ResponderList, tResponderList) if ((*first)->canHandle(url, request)) { (*first)->handle(url, request, socket); handled = true; break; } if (!handled) { if (DefaultResponder) DefaultResponder->handle(url, request, socket); else throw tRuntimeError("No default responder found"); } } catch (tHttpException &ex) { // socket has already been taken by a responder. if (!socket) { cerr << "*** unhandlable http exception in http server:" << endl << ex.what() << endl; return; } tHttpResponseHeader header(ex.HttpStatusCode, getHttpStatusCodeText(ex.HttpStatusCode), 1, 1); header.setContentType("text/html; charset=UTF-8"); tHttpResponseSender *sender = new tHttpStringResponseSender( QString("

%1 %2

" "%3" "
madman %4 web services") .arg(ex.HttpStatusCode) .arg(getHttpStatusCodeText(ex.HttpStatusCode)) .arg(ex.what()) .arg(STRINGIFY(MADMAN_VERSION)) .utf8() ); sender->setHeader(header); sender->kickOff(socket); } catch (exception &ex) { // socket has already been taken by a responder. if (!socket) { cerr << "*** unhandlable http exception in http server:" << endl << ex.what() << endl; return; } tHttpResponseHeader header(500, "Internal Server Error", 1, 1); header.setContentType("text/html; charset=UTF-8"); tHttpResponseSender *sender = new tHttpStringResponseSender( QString("

500 Internal Server Error

" "Sorry, I caught an exception while I was handling your request:
" "%1" "
madman %2 web services") .arg(ex.what()).arg(STRINGIFY(MADMAN_VERSION)).utf8() ); sender->setHeader(header); sender->kickOff(socket); } } madman-0.93/httpd/madmanweb.cpp0000644000175000001440000010571510053135241016241 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "utility/player.h" #include "database/database.h" #include "database/auto_dj.h" #include "utility/prefs.h" #include "madmanweb.h" #include "webdata.h" namespace { QString decodeUrlString(QString const &url_string) { QString copy = url_string; copy.replace("+", " "); QUrl::decode(copy); return copy; } } // tool functions ------------------------------------------------------------- QString replaceQueryValue(const QUrl &url, const QString &sought_key, const QString &new_value) { QStringList fields = QStringList::split("&", url.query()); QRegExp key_value_re("^([^=]+)\\=(.*)$"); bool found = false; FOREACH(first, fields, QStringList) { if (!key_value_re.exactMatch(*first)) throw tRuntimeError("Trouble extracting query field"); QString key = key_value_re.cap(1); QString value = key_value_re.cap(2); QString decoded_key = decodeUrlString(key); if (decoded_key == sought_key) { QString encoded_value = new_value; QUrl::encode(encoded_value); *first = QString("%1=%2").arg(key).arg(encoded_value); found = true; } } if (!found) { QString encoded_key = sought_key; QUrl::encode(encoded_key); QString encoded_value = new_value; QUrl::encode(encoded_value); fields.push_back(QString("%1=%2").arg(encoded_key).arg(encoded_value)); } QUrl url_copy = url; url_copy.setQuery(fields.join("&")); return url_copy.encodedPathAndQuery(); } QString getQueryValue(const QUrl &url, const QString &sought_key) { QStringList fields = QStringList::split("&", url.query()); QRegExp key_value_re("^([^=]+)\\=(.*)$"); FOREACH(first, fields, QStringList) { if (!key_value_re.exactMatch(*first)) throw tRuntimeError("Trouble extracting query field"); QString key = key_value_re.cap(1); QString value = key_value_re.cap(2); key = decodeUrlString(key); value = decodeUrlString(value); if (key == sought_key) return value; } throw tHttpException(400, QString("Required key %1 not in query"). arg(sought_key)); } int getQueryInteger(const QUrl &url, const QString &sought_key) { bool my_ok; int result = getQueryValue(url, sought_key).toInt(&my_ok); if (!my_ok) throw tHttpException(400, QString("Invalid numeral '%1'"). arg(getQueryValue(url, sought_key))); return result; } QString getOptionalQueryValue(const QUrl &url, const QString &sought_key) { try { return getQueryValue(url, sought_key); } catch (...) { return QString::null; } } int getOptionalQueryInteger(const QUrl &url, const QString &sought_key, int default_value, bool *ok = NULL) { try { bool my_ok; int result = getQueryValue(url, sought_key).toInt(&my_ok); if (!my_ok) { if (ok) *ok = false; return default_value; } if (ok) *ok = true; return result; } catch (...) { if (ok) *ok = false; return default_value; } } bool getAscending(const QUrl &url) { QString sort_ascending_str = getOptionalQueryValue(url, "sort_ascending"); return sort_ascending_str == "1" || sort_ascending_str.isNull(); } void plaintextResponse(QSocket *&socket, const QString &str) { tHttpResponseHeader header(200, "OK", 1, 1); header.setContentType("text/plain; charset=UTF-8"); header.setValue("Cache-Control", "no-cache"); tHttpResponseSender *sender = new tHttpStringResponseSender(str.utf8()); sender->setHeader(header); sender->kickOff(socket); } void htmlResponse(QSocket *&socket, const QString &str) { tHttpResponseHeader header(200, "OK", 1, 1); header.setContentType("text/html; charset=UTF-8"); header.setValue("Cache-Control", "no-cache"); tHttpResponseSender *sender = new tHttpStringResponseSender(str.utf8()); sender->setHeader(header); sender->kickOff(socket); } void getSongSelection(const QUrl &url, tProgramInterface &iface, tSongList &list) { list.clear(); QString type = getQueryValue(url, "selection_type"); if (type == "criterion") { tPlaylist set; set.setSongCollection(&iface.database().SongCollection); set.setCriterion(getQueryValue(url, "criterion")); set.reevaluateCriterion(); QString sort_by = getOptionalQueryValue(url, "sort_by"); bool ascending = getAscending(url); try { set.sortBy(getFieldFromIdentifier(sort_by), ascending); } catch (...) { } set.render(list); } else if (type == "current_playlist") { tPlayer &player = iface.preferences().Player; vector songs; player.getPlayList(songs); FOREACH_CONST(first, songs, vector) { tSong *song = iface.database().SongCollection.getByFilename(*first); if (song) list.push_back(song); } } else if (type == "playlist") { if (iface.database().playlistTree()) { tPlaylistNode *node = iface.database().playlistTree()->resolve( getQueryValue(url, "playlist_name")); if (node) node->data()->render(list); else throw tHttpException(404, QString("Playlist '%1' not found"). arg(type)); } } else if (type == "current") { tPlayer &player = iface.preferences().Player; tSong *song = iface.database().SongCollection.getByFilename( player.currentFilename()); if (song) list.push_back(song); else throw tHttpException(406, QString("No current song at this point"). arg(type)); } else if (type == "autodj") { tSearchSongSet set; set.setSongCollection(&iface.database().SongCollection); set.setCriterion("~all"); set.reevaluateCriterion(); tAutoDJ dj(iface.preferences().AutoDJPreferences, &set); dj.selectSongs(list, getOptionalQueryInteger(url, "song_count", 20)); } else throw tHttpException(400, QString("Invalid selection type '%1'"). arg(type)); } // tHttpFileResponseSender ---------------------------------------------------- tHttpFileResponseSender::tHttpFileResponseSender(ifstream *file) : File(file), SizeOfSentDocument(0) { File->seekg(0, ios_base::end); TotalSize = File->tellg(); File->seekg(0, ios_base::beg); } void tHttpFileResponseSender::setHeader(tHttpResponseHeader &header) { header.setValue("Content-Length", QString::number(TotalSize)); super::setHeader(header); } void tHttpFileResponseSender::readyToSend() { while (SizeOfSentDocument < TotalSize) { char buffer[ 1024 * 256 ]; File->seekg(SizeOfSentDocument, ios_base::beg); int read_bytes = File->readsome(buffer, sizeof(buffer)); int written_bytes = Socket->writeBlock(buffer, read_bytes); SizeOfSentDocument += written_bytes; if (Socket->bytesToWrite() != 0) { // We've saturated the buffer for now, QSocket will call back. // We do this to keep from shoving the whole multi-megabyte // song onto the heap (through QSocket's buffer) return; } if (written_bytes == 0) { // We've saturated the buffer for now, QSocket can't take any more. return; } } Socket->close(); } // tHttpBufferResponseSender -------------------------------------------------- tHttpBufferResponseSender::tHttpBufferResponseSender(char const *buffer, unsigned length) : Buffer(buffer), BufferLength(length), SizeOfSentDocument(0) { } void tHttpBufferResponseSender::setHeader(tHttpResponseHeader &header) { header.setValue("Content-Length", QString::number(BufferLength)); super::setHeader(header); } void tHttpBufferResponseSender::readyToSend() { while (SizeOfSentDocument < BufferLength) { int bytes_to_be_written = min(BufferLength - SizeOfSentDocument, 16u*1024u); int written_bytes = Socket->writeBlock( Buffer + SizeOfSentDocument, bytes_to_be_written); SizeOfSentDocument += written_bytes; if (Socket->bytesToWrite() != 0) { // we've saturated the buffer for now, QSocket will call back // we do this to keep from shoving the whole multi-megabyte // song onto the heap (through QSocket's buffer) return; } if (written_bytes == 0) { // we've saturated the buffer for now, QSocket can't take any more return; } } Socket->close(); } // tStreamingHttpResponder ---------------------------------------------------- bool tStreamingHttpResponder::canHandle(const QUrl &url, QHttpRequestHeader &header) { if (url.path() == "/madman/download") return true; if (url.path() == "/madman/streaming") return true; return false; } void tStreamingHttpResponder::handle(const QUrl &url, const QHttpRequestHeader &header, QSocket *&socket) { bool download = url.path() == "/madman/download"; int unique_id = getQueryInteger(url, "uniqueid"); tSong *song = database().SongCollection.getByUniqueId(unique_id); if (!song) throw tHttpException(404, QString("Unique ID %1 not found in database"). arg(unique_id)); tHttpResponseHeader response_header(200, "OK", 1, 1); if (download) { response_header.setContentType("application/octet-stream"); response_header.setValue("Content-Disposition", QString("attachment; filename=\"%1\""). arg(QString::fromUtf8(song->filenameOnly().c_str()))); } else response_header.setContentType(song->mimeType()); ifstream *file = new ifstream(song->filename().c_str(), ios_base::in); if (file->bad()) { delete file; throw tHttpException(404, QString("File '%1' not found"). arg( QString::fromUtf8(song->filename().c_str()))); } tHttpResponseSender *sender = new tHttpFileResponseSender(file); sender->setHeader(response_header); sender->kickOff(socket); } // tStaticDataHttpResponder --------------------------------------------------- bool tStaticDataHttpResponder::canHandle(const QUrl &url, QHttpRequestHeader &header) { const QString prefix = "/madman/static/"; return url.path().left(prefix.length()) == prefix; } void tStaticDataHttpResponder::handle(const QUrl &url, const QHttpRequestHeader &header, QSocket *&socket) { const QString prefix = "/madman/static/"; QString filename = url.path().mid(prefix.length()); if (filename.isNull()) throw tHttpException(403, QString("The contents of this virtual directory cannot be listed")); const char *content = getFile(filename.latin1()) ; if (content == NULL) throw tHttpException(404, QString("File '%1' not found"). arg(filename)); unsigned size = getFileSize(filename.latin1()); const char *mime_type = getFileType(filename.latin1()); tHttpResponseHeader response_header(200, "OK", 1, 1); response_header.setContentType(mime_type); response_header.setValue("Content-Length", QString::number(size)); tHttpResponseSender *sender = new tHttpBufferResponseSender(content, size); sender->setHeader(response_header); sender->kickOff(socket); } // tBrowseHttpResponder ------------------------------------------------------- bool tBrowseHttpResponder::canHandle(const QUrl &url, QHttpRequestHeader &header) { if (url.path() == "/" || url.path() == "") return true; const QString prefix = "/madman/browse/"; return url.path().left(prefix.length()) == prefix; } namespace { QString generateNavigation(const QUrl &url, int start, int count, int total_count) { QString result = ""; if (start == 0) result += QString(""); else { result += QString("") .arg(replaceQueryValue(url, "start", QString::number(max(0, start - count)))); } if(start + count >= total_count) result += QString(""); else { result += QString("") .arg(replaceQueryValue(url, "start", QString::number(start + count))); } int pages = 0; int start_page_index = max(0, start - 10 * count); int page_number = start_page_index / count + 1; if (start_page_index != 0) { result += QString("%1 \n") .arg(1) .arg(replaceQueryValue(url, "start", QString::number(0))); result += " ... "; } while (pages < 20 && start_page_index < total_count) { if (start_page_index == start) result += QString("%1 ").arg(page_number); else result += QString("%1 \n") .arg(page_number) .arg(replaceQueryValue(url, "start", QString::number(start_page_index))); start_page_index += count; pages++; page_number++; } if (start_page_index < total_count) { result +=" ... "; start_page_index = total_count - total_count % count; page_number = start_page_index / count + 1; if (start_page_index == total_count && total_count > count) start_page_index -= count; result += QString("%1 \n") .arg(page_number) .arg(replaceQueryValue(url, "start", QString::number(start_page_index))); } return result; } } QString tBrowseHttpResponder::getTitleCell(const QUrl &url, const QString &human_readable, const QString &machine_readable) { QString arrow = ""; QString begin_link = ""; QString end_link = ""; if (getOptionalQueryValue(url, "sort_by") == machine_readable) { bool ascending = getAscending(url); begin_link = QString("") .arg(replaceQueryValue(url, "sort_ascending", !ascending ? "1" : "0")); end_link = ""; arrow = QString(" ") .arg(ascending ? "down" : "up"); } else { begin_link = QString("") .arg(replaceQueryValue(url, "sort_by", machine_readable)); end_link = ""; } return QString("%1%4%2%3") .arg(arrow) .arg(human_readable) .arg(end_link) // begin_link contains a URL (which may contain %x sequences) // and hence must be inserted last .arg(begin_link); } QString tBrowseHttpResponder::getTitleRow(const QUrl &url) { QString result; result += QString(""); result += getTitleCell(url, "Artist", "artist"); result += getTitleCell(url, "Title", "title"); result += getTitleCell(url, "Album", "album"); result += getTitleCell(url, "Genre", "genre"); return QString("%1").arg(result); } QString tBrowseHttpResponder::getSongRow(tSong *song, bool bright) { QString columns; QString special_functions; if (preferences().HttpDownloadsEnabled) { special_functions += QString("" "" "").arg(song->uniqueId()); special_functions += QString("" "" "").arg(song->uniqueId()); } if (preferences().HttpLocalPlayEnabled) { special_functions += QString("" "" "").arg(song->uniqueId()); special_functions += QString("" "" "").arg(song->uniqueId()); special_functions += QString("" "" "").arg(song->uniqueId()); } special_functions += QString("" "" "").arg(song->uniqueId()); columns += QString("%1").arg(special_functions); columns += QString("%1").arg(song->artist()); columns += QString("%1").arg(song->title()); columns += QString("%1").arg(song->album()); columns += QString("%1").arg(song->genre()); return QString("%1\n") .arg(columns) .arg(bright ? QString("brightline") : QString("darkline")); } QString tBrowseHttpResponder::generateMenu(const QUrl &url) { QString result; result += "Search " "Playlist "; if (preferences().HttpLocalPlayEnabled) { result += "Server: " "Play " "Pause " "Stop " "Next " "Previous ·" "AutoDJ " "
"; } if (preferences().HttpDownloadsEnabled) { result += "Streaming: " "AutoDJ"; } return result; } void tBrowseHttpResponder::handle(const QUrl &url, const QHttpRequestHeader &header, QSocket *&socket) { if (url.path() == "/" || url.path() == "") { // redirect to browser tHttpResponseHeader response_header(307, "Temporary Redirect", 1, 1); response_header.setContentType("text/html; charset=UTF-8"); response_header.setValue("Location", "/madman/browse/list?selection_type=criterion&criterion=%7eall&start=0&count=50&sort_by=artist"); tHttpResponseSender *sender = new tHttpStringResponseSender("Redirecting..."); sender->setHeader(response_header); sender->kickOff(socket); return; } if (!preferences().HttpBrowsingEnabled) throw tHttpException(403, QString("Browsing is forbidden in this madman instance.")); QString body; if (url.path() == "/madman/browse/list") { tSongList list; getSongSelection(url, *this, list); // pick up and verify start and count tSongList::iterator first = list.begin(), last = list.end(); unsigned start_int = 0, count_int = list.size(); QString start = getOptionalQueryValue(url, "start"); if (!start.isNull()) { bool ok; start_int = start.toUInt(&ok); if (!ok) throw tHttpException(400, QString("Invalid numeral %1 in query string"). arg(start)); if (start_int > list.size()) start_int = list.size(); first = list.begin() + start_int; QString count = getOptionalQueryValue(url, "count"); if (!count.isNull()) { bool ok; count_int = count.toUInt(&ok); if (!ok) throw tHttpException(400, QString("Invalid numeral %1 in query string"). arg(count)); if (start_int + count_int > list.size()) last = list.end(); else last = first + count_int; } else count_int = list.size() - start_int; } // generate table QString table_contents; bool bright = false; while (first != last) { table_contents += getSongRow(*first, bright); first++; bright = !bright; } // make body if (getQueryValue(url, "selection_type") == "criterion") { body += QString( "
\n" " \n" " \n" " \n" " \n" " Search for:" " \n" " per page\n" "

\n" "

\n") .arg(getQueryValue(url, "criterion").replace("\"", """)) .arg(getQueryValue(url, "sort_by")) .arg(getQueryValue(url, "count")) .arg(getAscending(url) ? 1 : 0); } body += generateNavigation(url, start_int, count_int, list.size()) + "

"; body += "" + getTitleRow(url) + table_contents + "
"; } else if (url.path() == "/madman/browse/info") { bool darkline = false; QString info; tUniqueId unique_id = getQueryInteger(url, "uniqueid"); tSong *song = database().SongCollection.getByUniqueId(unique_id); if (!song) throw tHttpException(404, QString("Invalid unique id %1 in query string"). arg(unique_id)); #define GENERATE_INFO_ROW(NAME, VALUE) \ info += QString("" NAME "   %1") \ .arg((VALUE)) \ .arg(darkline ? "darkline" : "brightline"); \ darkline = !darkline; GENERATE_INFO_ROW("Artist", song->artist()); GENERATE_INFO_ROW("Performer", song->performer()); GENERATE_INFO_ROW("Title", song->title()); GENERATE_INFO_ROW("Year", song->year()); GENERATE_INFO_ROW("Genre", song->genre()); GENERATE_INFO_ROW("Track number", song->trackNumber()); int total_seconds = (int) song->duration(); int seconds = total_seconds % 60; int minutes = total_seconds / 60; QString duration; duration.sprintf("%d:%02d", minutes, seconds); GENERATE_INFO_ROW("Duration", duration); QString rating; if (song->rating() == 0) { rating = "-"; } else if (song->rating() > 0) { rating.fill('*', song->rating()); } GENERATE_INFO_ROW("Rating", rating); GENERATE_INFO_ROW("Play Count", song->playCount()); GENERATE_INFO_ROW("File size", QString("%1 MB").arg(float(song->fileSize()) / (1024 * 1024), 0, 'f', 2)); body += "" + info + "
"; } else throw tHttpException(404, QString("This browsing subsection is undefined.")); QString outer = getFile("outer.html"); QString document = outer.arg("madman").arg(generateMenu(url)).arg(body); tHttpResponseHeader response_header(200, "OK", 1, 1); response_header.setContentType("text/html; charset=UTF-8"); response_header.setValue("Cache-Control", "no-cache"); tHttpResponseSender *sender = new tHttpStringResponseSender(document.utf8()); sender->setHeader(response_header); sender->kickOff(socket); } // tScriptingHttpResponder ---------------------------------------------------- bool tScriptingHttpResponder::canHandle(const QUrl &url, QHttpRequestHeader &header) { const QString prefix = "/madman/scripting/"; return url.path().left(prefix.length()) == prefix; } namespace { void enumeratePlaylistTree(tPlaylistNode *root, QDomDocument &doc, QDomElement &parent, int recurse_depth = -1) { QDomElement node_el = doc.createElement("node"); node_el.setAttribute("name", root->name()); node_el.setAttribute("criterion", root->data()->criterion()); parent.appendChild(node_el); if (recurse_depth == 0) return; if (recurse_depth > 0) recurse_depth--; FOREACH(first, *root, tPlaylistNode) enumeratePlaylistTree(*first, doc, node_el, recurse_depth); } } void tScriptingHttpResponder::handle(const QUrl &url, const QHttpRequestHeader &header, QSocket *&socket) { if (!preferences().HttpScriptingEnabled) throw tHttpException(403, QString("Scripting access has been forbidden")); #define CHECK_FOR_LOCAL_PLAYER_PERMISSION \ if (!preferences().HttpLocalPlayEnabled) \ throw tHttpException(403, QString("Local player control has been forbidden")); #define CHECK_FOR_WRITE_PERMISSION \ if (!preferences().HttpWriteScriptingEnabled) \ throw tHttpException(403, QString("Write scripting access has been forbidden")); if (url.path() == "/madman/scripting/get_version") { plaintextResponse(socket, STRINGIFY(MADMAN_VERSION)); } else if (url.path() == "/madman/scripting/get_complete_record") { if (!preferences().HttpScriptingEnabled) throw tHttpException(403, QString("Scripting access has been forbidden")); tSongList list; getSongSelection(url, *this, list); QString result; FOREACH_CONST(first, list, tSongList) { for (int i = 0; i < FIELD_COUNT; i++) { tSongField field = (tSongField) i; result += getFieldIdentifier(field) + "=" + (*first)->fieldText(field) + "\n"; } result += "END_SONG\n"; } plaintextResponse(socket, result); } else if (url.path() == "/madman/scripting/set_field") { CHECK_FOR_WRITE_PERMISSION; int unique_id = getQueryInteger(url, "uniqueid"); tSong *song = database().SongCollection.getByUniqueId(unique_id); if (!song) throw tHttpException(404, QString("Unique ID %1 not found in database"). arg(unique_id)); song->setFieldText( getFieldFromIdentifier(getQueryValue(url, "field")), getQueryValue(url, "value")); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/quit") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; if (!preferences().HttpWriteScriptingEnabled) throw tHttpException(403, QString("Write scripting access has been forbidden")); QSocket *copy_of_socket_pointer = socket; plaintextResponse(socket, "OK"); copy_of_socket_pointer->flush(); quitApplication(); } else if (url.path() == "/madman/scripting/get_as_playlist") { tSongList list; getSongSelection(url, *this, list); QString result = "#EXTM3U\n"; FOREACH_CONST(first, list, tSongList) { result += QString("#EXTINF:%1,%2 - %3\n") .arg(int((*first)->duration())) .arg((*first)->artist()) .arg((*first)->title()); result += QString("http://%1/madman/streaming?uniqueid=%2\n") .arg(header.value("Host")) .arg((*first)->uniqueId()); } tHttpResponseHeader response_header(200, "OK", 1, 1); response_header.setContentType("application/x-m3u; charset=UTF-8"); response_header.setValue("Cache-Control", "no-cache"); response_header.setValue("Content-Disposition", "attachment; filename=playlist.m3u"); tHttpResponseSender *sender = new tHttpStringResponseSender(result.utf8()); sender->setHeader(response_header); sender->kickOff(socket); } else if (url.path() == "/madman/scripting/play_now") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; tSongList list; getSongSelection(url, *this, list); preferences().Player.playNow(list); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/play_next") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; tSongList list; getSongSelection(url, *this, list); preferences().Player.playNext(list); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/play_eventually") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; tSongList list; getSongSelection(url, *this, list); preferences().Player.playEventually(list); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/play") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; preferences().Player.play(); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/stop") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; preferences().Player.stop(); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/pause") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; preferences().Player.pause(); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/next") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; preferences().Player.skipForward(); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/previous") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; preferences().Player.skipBack(); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/skip_to") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; bool ok; double seconds = getQueryValue(url, "seconds").toDouble(&ok); if (!ok) throw tHttpException(400, QString("Invalid seconds numeral")); preferences().Player.skipToSeconds(seconds); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/total_time") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; plaintextResponse(socket, QString::number(preferences().Player.totalTime())); } else if (url.path() == "/madman/scripting/current_time") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; plaintextResponse(socket, QString::number(preferences().Player.currentTime())); } else if (url.path() == "/madman/scripting/is_playing") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; plaintextResponse(socket, QString::number(preferences().Player.isPlaying() ? 1 : 0)); } else if (url.path() == "/madman/scripting/is_paused") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; plaintextResponse(socket, QString::number(preferences().Player.isPaused() ? 1 : 0)); } else if (url.path() == "/madman/scripting/clear_playlist") { CHECK_FOR_LOCAL_PLAYER_PERMISSION; preferences().Player.clearPlaylist(); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/playlist_tree/get_playlist_tree") { QDomDocument pltreexml; QDomElement doc_element = pltreexml.createElement("playlisttree"); pltreexml.appendChild(doc_element); int recursion_depth = getOptionalQueryInteger(url, "depth", -1); tPlaylistNode *root_node = NULL; QString root_path = getOptionalQueryValue(url, "root"); if (root_path.isNull()) root_node = database().playlistTree(); else root_node = database().playlistTree()->resolve(root_path); if (root_node == NULL) throw tHttpException(404, QString("A playlist by the name of '%1' was not found.").arg(root_path)); enumeratePlaylistTree(root_node, pltreexml, doc_element, recursion_depth); plaintextResponse(socket, pltreexml.toString()); } else if (url.path() == "/madman/scripting/playlist_tree/set_playlist_name") { CHECK_FOR_WRITE_PERMISSION; QString qualified_name = getQueryValue(url, "qualifiedname"); QString new_name = getQueryValue(url, "newname"); tPlaylistNode *node = database().playlistTree(); if (node) node = node->resolve(qualified_name); if (node == NULL) throw tHttpException(404, QString("A playlist by the name of '%1' was not found.").arg(qualified_name)); node->setName(new_name); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/playlist_tree/set_playlist_criterion") { CHECK_FOR_WRITE_PERMISSION; QString qualified_name = getQueryValue(url, "qualifiedname"); QString criterion_text = getQueryValue(url, "criterion"); tPlaylistNode *node = database().playlistTree(); if (node) node = node->resolve(qualified_name); if (node == NULL) throw tHttpException(404, QString("A playlist by the name of '%1' was not found.").arg(qualified_name)); node->data()->setCriterion(criterion_text); node->data()->reevaluateCriterion(); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/playlist_tree/create_playlist") { CHECK_FOR_WRITE_PERMISSION; QString qualified_name = getQueryValue(url, "qualifiedparent"); QString new_name = getQueryValue(url, "newname"); tPlaylistNode *node = database().playlistTree(); if (node) node = node->resolve(qualified_name); auto_ptr new_node(new tPlaylistNode(&database(), new tPlaylist())); new_node->data()->setSongCollection(&database().SongCollection); new_node->setName(new_name); if (node == NULL) { if (database().playlistTree() == NULL) { database().setPlaylistTree(new_node.get()); new_node.release(); } else throw tHttpException(404, QString("A playlist by the name of '%1' was not found.").arg(qualified_name)); } else { node->addChild(new_node.get()); new_node.release(); } plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/playlist_tree/delete_playlist") { CHECK_FOR_WRITE_PERMISSION; QString qualified_name = getQueryValue(url, "qualifiedname"); tPlaylistNode *node = database().playlistTree(); if (node) node = node->resolve(qualified_name); if (node == NULL) throw tHttpException(404, QString("A playlist by the name of '%1' was not found.").arg(qualified_name)); tPlaylistNode *parent = node->parent(); if (parent) { parent->removeChild(node); delete node; } else { database().setPlaylistTree(NULL); delete node; } plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/playlist_tree/add_song_to_playlist") { CHECK_FOR_WRITE_PERMISSION; QString qualified_name = getQueryValue(url, "qualifiedname"); tPlaylistNode *node = database().playlistTree(); if (node) node = node->resolve(qualified_name); if (node == NULL) throw tHttpException(404, QString("A playlist by the name of '%1' was not found.").arg(qualified_name)); tUniqueId unique_id = getQueryInteger(url, "uniqueid"); tSong *song = database().SongCollection.getByUniqueId(unique_id); if (!song) throw tHttpException(400, QString("Invalid unique id %1 in query string"). arg(unique_id)); node->data()->add(song); plaintextResponse(socket, "OK"); } else if (url.path() == "/madman/scripting/playlist_tree/remove_song_from_playlist") { CHECK_FOR_WRITE_PERMISSION; QString qualified_name = getQueryValue(url, "qualifiedname"); tPlaylistNode *node = database().playlistTree(); if (node) node = node->resolve(qualified_name); if (node == NULL) throw tHttpException(404, QString("A playlist by the name of '%1' was not found.").arg(qualified_name)); tUniqueId unique_id = getQueryInteger(url, "uniqueid"); tSong *song = database().SongCollection.getByUniqueId(unique_id); if (!song) throw tHttpException(400, QString("Invalid unique id %1 in query string"). arg(unique_id)); node->data()->remove(song); plaintextResponse(socket, "OK"); } else throw tHttpException(404, QString("This scripting command is undefined")); } // add functions -------------------------------------------------------------- void addResponders(tHttpDaemon *httpd, tProgramInterface *iface) { // downloads tHttpResponderUsingData *responder; httpd->addResponder(responder = new tStreamingHttpResponder); responder->setProgramInterface(iface); // browsing httpd->addResponder(new tStaticDataHttpResponder); httpd->addResponder(responder = new tBrowseHttpResponder); responder->setProgramInterface(iface); // scripting httpd->addResponder(responder = new tScriptingHttpResponder); responder->setProgramInterface(iface); } // Stuff to tell EMACS how to format this file. // Local Variables: // mode: C++ // eval: (c-set-style "stroustrup") // eval: (c-set-offset 'access-label -2) // eval: (c-set-offset 'inline-open 0) // c-basic-offset: 2 // tab-width: 8 // End: madman-0.93/httpd/webdata.cpp0000644000175000001440000040416210053135241015713 0ustar akusers00000000000000#include static char back_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x04, 0x03, 0x00, 0x00, 0x00, 0xed, 0xdd, 0xe2, 0x52, 0x00, 0x00, 0x00, 0x18, 0x50, 0x4c, 0x54, 0x45, 0xff, 0xff, 0xff, 0xcc, 0xcc, 0xff, 0x99, 0x99, 0xcc, 0x00, 0x00, 0x00, 0xc0, 0xc0, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x69, 0xf7, 0xe8, 0x60, 0x00, 0x00, 0x00, 0x05, 0x74, 0x52, 0x4e, 0x53, 0xff, 0xff, 0xff, 0xff, 0x00, 0xfb, 0xb6, 0x0e, 0x53, 0x00, 0x00, 0x00, 0x01, 0x62, 0x4b, 0x47, 0x44, 0x03, 0x11, 0x0c, 0x4c, 0xf2, 0x00, 0x00, 0x00, 0x46, 0x49, 0x44, 0x41, 0x54, 0x78, 0xda, 0x63, 0x70, 0x81, 0x02, 0x06, 0x10, 0xe1, 0x0c, 0x63, 0x18, 0x9a, 0x40, 0x18, 0xce, 0x42, 0xca, 0x10, 0x86, 0xa1, 0x92, 0x01, 0x98, 0x01, 0x14, 0x60, 0x01, 0x33, 0xc0, 0x02, 0x40, 0x06, 0x44, 0x00, 0x24, 0x62, 0xa4, 0x64, 0x02, 0x61, 0x38, 0x2b, 0x29, 0x43, 0xcd, 0x01, 0x0b, 0x81, 0xcd, 0x51, 0x82, 0x9a, 0xe3, 0x62, 0x64, 0x00, 0xb3, 0x8b, 0x05, 0xca, 0x80, 0xdb, 0x0e, 0x02, 0x00, 0x7f, 0xc4, 0x1e, 0x58, 0xf3, 0xf9, 0x54, 0x0d, 0x00, 0x00, 0x00, 0x57, 0x74, 0x45, 0x58, 0x74, 0x63, 0x6f, 0x6d, 0x6d, 0x65, 0x6e, 0x74, 0x00, 0x43, 0x6f, 0x70, 0x79, 0x72, 0x69, 0x67, 0x68, 0x74, 0x20, 0x32, 0x30, 0x30, 0x30, 0x20, 0x62, 0x79, 0x20, 0x53, 0x75, 0x6e, 0x20, 0x4d, 0x69, 0x63, 0x72, 0x6f, 0x73, 0x79, 0x73, 0x74, 0x65, 0x6d, 0x73, 0x2c, 0x20, 0x49, 0x6e, 0x63, 0x2e, 0x20, 0x41, 0x6c, 0x6c, 0x20, 0x52, 0x69, 0x67, 0x68, 0x74, 0x73, 0x20, 0x52, 0x65, 0x73, 0x65, 0x72, 0x76, 0x65, 0x64, 0x2e, 0x0d, 0x0a, 0x4a, 0x4c, 0x46, 0x20, 0x47, 0x52, 0x20, 0x56, 0x65, 0x72, 0x20, 0x31, 0x2e, 0x30, 0x0d, 0x0a, 0x06, 0x02, 0x1e, 0xdf, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char back_gray_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x08, 0x04, 0x00, 0x00, 0x00, 0xb5, 0xfa, 0x37, 0xea, 0x00, 0x00, 0x00, 0x02, 0x62, 0x4b, 0x47, 0x44, 0x00, 0xff, 0x87, 0x8f, 0xcc, 0xbf, 0x00, 0x00, 0x00, 0x09, 0x70, 0x48, 0x59, 0x73, 0x00, 0x00, 0x0b, 0x12, 0x00, 0x00, 0x0b, 0x12, 0x01, 0xd2, 0xdd, 0x7e, 0xfc, 0x00, 0x00, 0x00, 0x07, 0x74, 0x49, 0x4d, 0x45, 0x07, 0xd3, 0x07, 0x14, 0x0d, 0x30, 0x0c, 0xeb, 0x0d, 0x31, 0x72, 0x00, 0x00, 0x00, 0x6c, 0x49, 0x44, 0x41, 0x54, 0x78, 0x9c, 0x7d, 0x91, 0xc1, 0x11, 0xc0, 0x20, 0x08, 0x04, 0x17, 0x1b, 0xb4, 0x05, 0xbf, 0xe9, 0x22, 0xa5, 0xd8, 0x82, 0x15, 0x99, 0x57, 0xda, 0x30, 0x8f, 0xcc, 0x38, 0x20, 0xe8, 0x3d, 0xb9, 0x1d, 0xe0, 0x40, 0x3a, 0x67, 0x25, 0x5f, 0xaa, 0xe3, 0x08, 0xd4, 0x71, 0x19, 0x24, 0x79, 0xfb, 0x25, 0x2b, 0x24, 0x79, 0x1b, 0x1a, 0x77, 0xd4, 0x41, 0xdb, 0x8f, 0x38, 0x20, 0xb6, 0x27, 0xb0, 0xb3, 0x41, 0xfa, 0xec, 0x90, 0x01, 0x68, 0x14, 0x03, 0xcc, 0x11, 0x45, 0x1a, 0x80, 0x49, 0xb0, 0x2c, 0x19, 0x23, 0x26, 0x66, 0x84, 0x2c, 0x87, 0xfa, 0x11, 0x7d, 0x07, 0xf1, 0xcf, 0xaa, 0x43, 0x27, 0x09, 0x00, 0xab, 0xe0, 0x9b, 0x56, 0x1f, 0x45, 0x6c, 0x32, 0x1d, 0x0f, 0xc8, 0xdc, 0x88, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char down_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x0e, 0x00, 0x00, 0x00, 0x0a, 0x04, 0x03, 0x00, 0x00, 0x00, 0x76, 0xf7, 0x72, 0xf4, 0x00, 0x00, 0x00, 0x30, 0x50, 0x4c, 0x54, 0x45, 0x00, 0x00, 0x00, 0x66, 0x44, 0x33, 0x99, 0x55, 0x22, 0x44, 0x44, 0x44, 0xbb, 0x66, 0x44, 0xbb, 0x88, 0x66, 0xaa, 0x88, 0x88, 0xcc, 0xbb, 0x88, 0xbb, 0xcc, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xbb, 0x99, 0xff, 0xdd, 0xbb, 0xff, 0xff, 0xdd, 0xdd, 0xee, 0xff, 0x99, 0x99, 0x99, 0xff, 0xff, 0xff, 0xf9, 0x0b, 0xd2, 0xbd, 0x00, 0x00, 0x00, 0x0d, 0x74, 0x52, 0x4e, 0x53, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00, 0x3d, 0xe8, 0x22, 0x86, 0x00, 0x00, 0x00, 0x01, 0x62, 0x4b, 0x47, 0x44, 0x00, 0x88, 0x05, 0x1d, 0x48, 0x00, 0x00, 0x00, 0x21, 0x49, 0x44, 0x41, 0x54, 0x78, 0xda, 0x63, 0x38, 0x73, 0xe6, 0x0c, 0x03, 0x51, 0x98, 0x01, 0x04, 0x80, 0xf4, 0x01, 0x20, 0xc5, 0x03, 0x12, 0x03, 0x71, 0x41, 0xf4, 0x01, 0x20, 0x17, 0xae, 0x0e, 0x00, 0x9c, 0x26, 0x27, 0xd9, 0x2f, 0x24, 0x5f, 0x7e, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char format_css[] = { 0x69, 0x6d, 0x67, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x62, 0x6f, 0x72, 0x64, 0x65, 0x72, 0x3a, 0x6e, 0x6f, 0x6e, 0x65, 0x3b, 0x0a, 0x7d, 0x0a, 0x0a, 0x23, 0x4d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x4c, 0x6f, 0x67, 0x6f, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x69, 0x6f, 0x6e, 0x3a, 0x61, 0x62, 0x73, 0x6f, 0x6c, 0x75, 0x74, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x74, 0x6f, 0x70, 0x3a, 0x31, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x20, 0x20, 0x6c, 0x65, 0x66, 0x74, 0x3a, 0x32, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x7d, 0x0a, 0x23, 0x4d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x4c, 0x65, 0x74, 0x74, 0x65, 0x72, 0x69, 0x6e, 0x67, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x69, 0x6f, 0x6e, 0x3a, 0x61, 0x62, 0x73, 0x6f, 0x6c, 0x75, 0x74, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x74, 0x6f, 0x70, 0x3a, 0x31, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x20, 0x20, 0x6c, 0x65, 0x66, 0x74, 0x3a, 0x31, 0x30, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x7d, 0x0a, 0x0a, 0x23, 0x4d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x4d, 0x65, 0x6e, 0x75, 0x20, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x69, 0x6f, 0x6e, 0x3a, 0x20, 0x61, 0x62, 0x73, 0x6f, 0x6c, 0x75, 0x74, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x74, 0x6f, 0x70, 0x3a, 0x34, 0x37, 0x70, 0x78, 0x3b, 0x0a, 0x20, 0x20, 0x6c, 0x65, 0x66, 0x74, 0x3a, 0x33, 0x30, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x20, 0x20, 0x72, 0x69, 0x67, 0x68, 0x74, 0x3a, 0x32, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x20, 0x20, 0x74, 0x65, 0x78, 0x74, 0x2d, 0x61, 0x6c, 0x69, 0x67, 0x6e, 0x3a, 0x72, 0x69, 0x67, 0x68, 0x74, 0x3b, 0x0a, 0x20, 0x20, 0x66, 0x6f, 0x6e, 0x74, 0x2d, 0x73, 0x69, 0x7a, 0x65, 0x3a, 0x73, 0x6d, 0x61, 0x6c, 0x6c, 0x3b, 0x0a, 0x7d, 0x0a, 0x0a, 0x23, 0x4d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x4d, 0x65, 0x6e, 0x75, 0x20, 0x61, 0x20, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x63, 0x6f, 0x6c, 0x6f, 0x72, 0x3a, 0x62, 0x6c, 0x61, 0x63, 0x6b, 0x3b, 0x0a, 0x7d, 0x0a, 0x0a, 0x23, 0x4d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x42, 0x6f, 0x64, 0x79, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x69, 0x6f, 0x6e, 0x3a, 0x20, 0x61, 0x62, 0x73, 0x6f, 0x6c, 0x75, 0x74, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x74, 0x6f, 0x70, 0x3a, 0x31, 0x30, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x20, 0x20, 0x6c, 0x65, 0x66, 0x74, 0x3a, 0x32, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x20, 0x20, 0x72, 0x69, 0x67, 0x68, 0x74, 0x3a, 0x32, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x20, 0x20, 0x68, 0x65, 0x69, 0x67, 0x68, 0x74, 0x3a, 0x61, 0x75, 0x74, 0x6f, 0x3b, 0x0a, 0x7d, 0x0a, 0x0a, 0x23, 0x4d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x4d, 0x65, 0x6e, 0x75, 0x20, 0x61, 0x20, 0x69, 0x6d, 0x67, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x62, 0x6f, 0x72, 0x64, 0x65, 0x72, 0x3a, 0x20, 0x6e, 0x6f, 0x6e, 0x65, 0x0a, 0x7d, 0x0a, 0x0a, 0x74, 0x72, 0x2e, 0x64, 0x61, 0x72, 0x6b, 0x6c, 0x69, 0x6e, 0x65, 0x20, 0x74, 0x64, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x62, 0x61, 0x63, 0x6b, 0x67, 0x72, 0x6f, 0x75, 0x6e, 0x64, 0x2d, 0x63, 0x6f, 0x6c, 0x6f, 0x72, 0x3a, 0x23, 0x65, 0x30, 0x65, 0x30, 0x65, 0x30, 0x3b, 0x0a, 0x7d, 0x0a, 0x74, 0x72, 0x2e, 0x62, 0x72, 0x69, 0x67, 0x68, 0x74, 0x6c, 0x69, 0x6e, 0x65, 0x20, 0x74, 0x64, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x62, 0x61, 0x63, 0x6b, 0x67, 0x72, 0x6f, 0x75, 0x6e, 0x64, 0x2d, 0x63, 0x6f, 0x6c, 0x6f, 0x72, 0x3a, 0x23, 0x66, 0x30, 0x66, 0x30, 0x66, 0x30, 0x3b, 0x0a, 0x7d, 0x0a, 0x0a, 0x74, 0x61, 0x62, 0x6c, 0x65, 0x2e, 0x73, 0x6f, 0x6e, 0x67, 0x74, 0x61, 0x62, 0x6c, 0x65, 0x20, 0x74, 0x72, 0x20, 0x74, 0x68, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x74, 0x65, 0x78, 0x74, 0x2d, 0x61, 0x6c, 0x69, 0x67, 0x6e, 0x3a, 0x20, 0x6c, 0x65, 0x66, 0x74, 0x3b, 0x0a, 0x20, 0x20, 0x62, 0x61, 0x63, 0x6b, 0x67, 0x72, 0x6f, 0x75, 0x6e, 0x64, 0x2d, 0x63, 0x6f, 0x6c, 0x6f, 0x72, 0x3a, 0x23, 0x63, 0x30, 0x63, 0x30, 0x63, 0x30, 0x3b, 0x0a, 0x7d, 0x0a, 0x0a, 0x74, 0x61, 0x62, 0x6c, 0x65, 0x2e, 0x73, 0x6f, 0x6e, 0x67, 0x74, 0x61, 0x62, 0x6c, 0x65, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x77, 0x69, 0x64, 0x74, 0x68, 0x3a, 0x31, 0x30, 0x30, 0x25, 0x3b, 0x0a, 0x20, 0x20, 0x62, 0x6f, 0x72, 0x64, 0x65, 0x72, 0x2d, 0x73, 0x70, 0x61, 0x63, 0x69, 0x6e, 0x67, 0x3a, 0x20, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x7d, 0x0a, 0x0a, 0x74, 0x61, 0x62, 0x6c, 0x65, 0x2e, 0x69, 0x6e, 0x66, 0x6f, 0x74, 0x61, 0x62, 0x6c, 0x65, 0x0a, 0x7b, 0x0a, 0x20, 0x20, 0x62, 0x6f, 0x72, 0x64, 0x65, 0x72, 0x2d, 0x73, 0x70, 0x61, 0x63, 0x69, 0x6e, 0x67, 0x3a, 0x20, 0x30, 0x70, 0x78, 0x3b, 0x0a, 0x7d, 0x0a, 0x0a, 0x0a, }; static char forward_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x04, 0x03, 0x00, 0x00, 0x00, 0xed, 0xdd, 0xe2, 0x52, 0x00, 0x00, 0x00, 0x18, 0x50, 0x4c, 0x54, 0x45, 0xff, 0xff, 0xff, 0xcc, 0xcc, 0xff, 0x99, 0x99, 0xcc, 0x00, 0x00, 0x00, 0xc0, 0xc0, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x69, 0xf7, 0xe8, 0x60, 0x00, 0x00, 0x00, 0x05, 0x74, 0x52, 0x4e, 0x53, 0xff, 0xff, 0xff, 0xff, 0x00, 0xfb, 0xb6, 0x0e, 0x53, 0x00, 0x00, 0x00, 0x01, 0x62, 0x4b, 0x47, 0x44, 0x03, 0x11, 0x0c, 0x4c, 0xf2, 0x00, 0x00, 0x00, 0x44, 0x49, 0x44, 0x41, 0x54, 0x78, 0xda, 0x63, 0x70, 0x81, 0x02, 0x06, 0x20, 0x36, 0x81, 0x32, 0x9c, 0x85, 0xa1, 0x0c, 0x43, 0x25, 0x13, 0xa8, 0x88, 0x92, 0x32, 0x54, 0x8d, 0x11, 0x48, 0x08, 0xc4, 0x00, 0x0b, 0x81, 0x18, 0x60, 0x21, 0xb0, 0x88, 0x90, 0x32, 0x0b, 0x98, 0x61, 0xa8, 0x64, 0x00, 0xd1, 0x05, 0x12, 0x80, 0x98, 0x63, 0x00, 0x35, 0x07, 0x24, 0x00, 0x56, 0x63, 0x00, 0xb3, 0xd4, 0x05, 0x85, 0x01, 0x00, 0x87, 0x45, 0x1e, 0x3a, 0x28, 0xce, 0xc4, 0x1c, 0x00, 0x00, 0x00, 0x57, 0x74, 0x45, 0x58, 0x74, 0x63, 0x6f, 0x6d, 0x6d, 0x65, 0x6e, 0x74, 0x00, 0x43, 0x6f, 0x70, 0x79, 0x72, 0x69, 0x67, 0x68, 0x74, 0x20, 0x32, 0x30, 0x30, 0x30, 0x20, 0x62, 0x79, 0x20, 0x53, 0x75, 0x6e, 0x20, 0x4d, 0x69, 0x63, 0x72, 0x6f, 0x73, 0x79, 0x73, 0x74, 0x65, 0x6d, 0x73, 0x2c, 0x20, 0x49, 0x6e, 0x63, 0x2e, 0x20, 0x41, 0x6c, 0x6c, 0x20, 0x52, 0x69, 0x67, 0x68, 0x74, 0x73, 0x20, 0x52, 0x65, 0x73, 0x65, 0x72, 0x76, 0x65, 0x64, 0x2e, 0x0d, 0x0a, 0x4a, 0x4c, 0x46, 0x20, 0x47, 0x52, 0x20, 0x56, 0x65, 0x72, 0x20, 0x31, 0x2e, 0x30, 0x0d, 0x0a, 0x06, 0x02, 0x1e, 0xdf, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char forward_gray_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x08, 0x04, 0x00, 0x00, 0x00, 0xb5, 0xfa, 0x37, 0xea, 0x00, 0x00, 0x00, 0x02, 0x62, 0x4b, 0x47, 0x44, 0x00, 0xff, 0x87, 0x8f, 0xcc, 0xbf, 0x00, 0x00, 0x00, 0x09, 0x70, 0x48, 0x59, 0x73, 0x00, 0x00, 0x0b, 0x12, 0x00, 0x00, 0x0b, 0x12, 0x01, 0xd2, 0xdd, 0x7e, 0xfc, 0x00, 0x00, 0x00, 0x07, 0x74, 0x49, 0x4d, 0x45, 0x07, 0xd3, 0x07, 0x14, 0x0d, 0x30, 0x2a, 0x39, 0x00, 0xb4, 0x8f, 0x00, 0x00, 0x00, 0x6b, 0x49, 0x44, 0x41, 0x54, 0x78, 0x9c, 0x85, 0xd1, 0xcd, 0x0d, 0x80, 0x20, 0x0c, 0x40, 0xe1, 0x57, 0x16, 0x74, 0x05, 0xae, 0x6e, 0xe1, 0x16, 0x5e, 0xbb, 0x02, 0x13, 0xe9, 0xc9, 0x35, 0xf0, 0x40, 0x62, 0x4a, 0xdb, 0x20, 0x37, 0xf2, 0xbe, 0xf0, 0x2b, 0x17, 0xeb, 0x51, 0xec, 0x44, 0xfb, 0x12, 0x68, 0xdf, 0x13, 0x52, 0x6c, 0x7e, 0xd8, 0x02, 0xf9, 0x40, 0x95, 0x13, 0x20, 0x10, 0xb3, 0x45, 0x95, 0x96, 0x90, 0xe9, 0x90, 0x19, 0x99, 0x40, 0x46, 0x1c, 0xd0, 0xbe, 0x03, 0xd0, 0x38, 0xb2, 0x15, 0xc6, 0x4d, 0x46, 0xbe, 0x25, 0x80, 0x2c, 0x87, 0x77, 0xf0, 0x39, 0xbc, 0x83, 0xcf, 0x20, 0xf6, 0xb3, 0xb4, 0xfb, 0xec, 0x40, 0x36, 0xca, 0x4f, 0xe7, 0x05, 0x22, 0xe2, 0x31, 0x06, 0x75, 0x5b, 0x83, 0x6d, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char info_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x08, 0x03, 0x00, 0x00, 0x00, 0x28, 0x2d, 0x0f, 0x53, 0x00, 0x00, 0x00, 0xc0, 0x50, 0x4c, 0x54, 0x45, 0xff, 0xff, 0xff, 0xc0, 0xc0, 0xc0, 0xf7, 0xf1, 0xff, 0xa8, 0xa0, 0xb9, 0xdb, 0xd4, 0xe9, 0x94, 0x8d, 0xa5, 0x97, 0x90, 0xa8, 0xb6, 0xae, 0xc9, 0xa1, 0x9a, 0xb2, 0xa1, 0x9a, 0xb1, 0xda, 0xd3, 0xea, 0xec, 0xe5, 0xfd, 0xdf, 0xd8, 0xef, 0x63, 0x5d, 0x73, 0x8c, 0x86, 0x9c, 0xb6, 0xae, 0xca, 0xc8, 0xc0, 0xde, 0xa6, 0x9f, 0xb8, 0xb6, 0xaf, 0xc9, 0xb3, 0xac, 0xc6, 0xb3, 0xac, 0xc5, 0x9e, 0x98, 0xae, 0xc0, 0xba, 0xd0, 0xc4, 0xbe, 0xd4, 0xeb, 0xe4, 0xfd, 0x95, 0x92, 0x9d, 0x9c, 0x96, 0xae, 0x9a, 0x94, 0xab, 0xba, 0xb3, 0xce, 0xc6, 0xbf, 0xdb, 0xc5, 0xbe, 0xda, 0xad, 0xa7, 0xbf, 0xac, 0xa6, 0xbe, 0xa7, 0xa1, 0xb8, 0xdf, 0xd9, 0xf0, 0xe5, 0xdf, 0xf6, 0xa3, 0xa0, 0xac, 0x6f, 0x6b, 0x7d, 0xc8, 0xc1, 0xde, 0xc5, 0xbe, 0xdb, 0xad, 0xa7, 0xc0, 0xac, 0xa6, 0xbf, 0xc0, 0xba, 0xd5, 0xd9, 0xd2, 0xef, 0xbe, 0xb8, 0xd2, 0xac, 0xa7, 0xc0, 0xc5, 0xbf, 0xdb, 0x76, 0x73, 0x86, 0xb7, 0xb7, 0xb7, 0x53, 0x53, 0x53, 0x0d, 0x0d, 0x0d, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xcc, 0x8f, 0xe0, 0xfd, 0x00, 0x00, 0x00, 0x02, 0x74, 0x52, 0x4e, 0x53, 0xff, 0x00, 0xe5, 0xb7, 0x30, 0x4a, 0x00, 0x00, 0x00, 0x01, 0x62, 0x4b, 0x47, 0x44, 0x33, 0x37, 0xd5, 0x7c, 0x5e, 0x00, 0x00, 0x00, 0x9f, 0x49, 0x44, 0x41, 0x54, 0x78, 0xda, 0x5d, 0xcf, 0xc9, 0x16, 0x82, 0x30, 0x0c, 0x05, 0xd0, 0x54, 0x40, 0x04, 0x8d, 0x8a, 0xa8, 0x88, 0x14, 0x27, 0x10, 0xa1, 0x54, 0x84, 0xfc, 0xff, 0xc7, 0xd9, 0xc1, 0x83, 0x1e, 0xdf, 0x22, 0x8b, 0xbb, 0x48, 0xf2, 0x80, 0xfd, 0x05, 0xcc, 0x24, 0x9d, 0x2f, 0x10, 0x25, 0xb7, 0x62, 0xee, 0x12, 0x81, 0x05, 0xda, 0x87, 0xd9, 0x12, 0xbd, 0x98, 0x0b, 0x2d, 0x1a, 0xc2, 0x2c, 0x40, 0x40, 0x2e, 0x72, 0xea, 0x41, 0x01, 0x25, 0x59, 0x70, 0xf5, 0xf0, 0x28, 0xba, 0xaa, 0x1c, 0x0c, 0x2c, 0x66, 0xce, 0xe5, 0x3e, 0x7d, 0x75, 0xeb, 0x93, 0x24, 0x03, 0x85, 0xd3, 0xc4, 0x38, 0xc1, 0xea, 0x21, 0x7d, 0x0b, 0x87, 0x66, 0xcb, 0x15, 0xe4, 0xd2, 0xaf, 0x2d, 0xb8, 0x31, 0x47, 0x05, 0xb8, 0x39, 0xa7, 0x66, 0x07, 0x23, 0x2e, 0xb0, 0x6d, 0x5b, 0xac, 0x23, 0x7b, 0x85, 0x91, 0xc8, 0x51, 0x27, 0xda, 0x7d, 0xfe, 0x00, 0xa2, 0x52, 0xae, 0x9e, 0xe9, 0xf8, 0x29, 0x83, 0x7e, 0x50, 0x55, 0x86, 0x1e, 0xc6, 0x72, 0x60, 0xf3, 0xd3, 0xf6, 0x27, 0x6f, 0x8c, 0x1b, 0x11, 0x53, 0x22, 0xfd, 0xa1, 0xe7, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char madman_lettering_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0xc1, 0x00, 0x00, 0x00, 0x2e, 0x08, 0x02, 0x00, 0x00, 0x00, 0x1e, 0x32, 0xea, 0x9c, 0x00, 0x00, 0x00, 0x06, 0x62, 0x4b, 0x47, 0x44, 0x00, 0xff, 0x00, 0xff, 0x00, 0xff, 0xa0, 0xbd, 0xa7, 0x93, 0x00, 0x00, 0x00, 0x09, 0x70, 0x48, 0x59, 0x73, 0x00, 0x00, 0x0b, 0x10, 0x00, 0x00, 0x0b, 0x10, 0x01, 0xad, 0x23, 0xbd, 0x75, 0x00, 0x00, 0x00, 0x07, 0x74, 0x49, 0x4d, 0x45, 0x07, 0xd3, 0x0c, 0x1b, 0x0e, 0x32, 0x1f, 0x70, 0x70, 0x8d, 0x30, 0x00, 0x00, 0x06, 0x94, 0x49, 0x44, 0x41, 0x54, 0x78, 0x9c, 0xed, 0x9b, 0x4f, 0x48, 0x14, 0x6d, 0x1c, 0xc7, 0x67, 0xb7, 0xd5, 0xcd, 0x76, 0x5b, 0x57, 0x4d, 0x2b, 0xc1, 0x92, 0x32, 0x32, 0x95, 0x42, 0x83, 0x88, 0x82, 0x4d, 0xf1, 0x4f, 0xd1, 0xa5, 0x53, 0x18, 0xca, 0xa2, 0x88, 0xd4, 0x9a, 0x22, 0x9d, 0x3a, 0x78, 0x50, 0x31, 0x10, 0x14, 0x0a, 0xa3, 0x0e, 0xd2, 0x21, 0x0f, 0x56, 0x08, 0x16, 0x1b, 0x2a, 0x88, 0xa8, 0x85, 0x07, 0xdd, 0x68, 0x15, 0x15, 0xd4, 0x22, 0xc4, 0xc4, 0x3c, 0xac, 0x7b, 0xd0, 0xd5, 0x86, 0xd9, 0x49, 0x76, 0xf7, 0x79, 0x0f, 0xdb, 0xeb, 0xeb, 0x3b, 0xcf, 0x1f, 0x9f, 0x71, 0xb6, 0xc6, 0x91, 0xe7, 0x73, 0x92, 0x67, 0xbf, 0x7e, 0x9f, 0xdf, 0xf3, 0xf3, 0x3b, 0xb3, 0x33, 0xcf, 0x8c, 0x3a, 0x00, 0x00, 0xc7, 0x60, 0x28, 0x40, 0xaf, 0x76, 0x01, 0x0c, 0xcd, 0xc3, 0x32, 0xc4, 0x50, 0x0a, 0xcb, 0x10, 0x43, 0x29, 0x2c, 0x43, 0x0c, 0xa5, 0xb0, 0x0c, 0x31, 0x94, 0xc2, 0x32, 0xc4, 0x50, 0x0a, 0xcb, 0x10, 0x43, 0x29, 0x2c, 0x43, 0x0c, 0xa5, 0x18, 0xd4, 0x2e, 0x40, 0x7d, 0x74, 0x3a, 0x1d, 0x3c, 0xc8, 0xb6, 0x5e, 0xe9, 0x61, 0xe7, 0x21, 0x86, 0x52, 0x58, 0x86, 0x18, 0x4a, 0x61, 0x19, 0x62, 0x28, 0x85, 0x65, 0x88, 0xa1, 0x14, 0x96, 0x21, 0x86, 0x52, 0x58, 0x86, 0x18, 0x4a, 0xa1, 0xca, 0xd0, 0xe0, 0xe0, 0xe0, 0xed, 0xdb, 0xb7, 0x93, 0x93, 0x93, 0xa3, 0xa2, 0xa2, 0xe2, 0xe2, 0xe2, 0x6c, 0x36, 0xdb, 0xf3, 0xe7, 0xcf, 0x45, 0x51, 0x94, 0xc8, 0xd6, 0xd7, 0xd7, 0x5b, 0x5b, 0x5b, 0xaf, 0x5e, 0xbd, 0x6a, 0xb5, 0x5a, 0x8d, 0x46, 0x63, 0x72, 0x72, 0x72, 0x7e, 0x7e, 0x7e, 0x5b, 0x5b, 0x9b, 0x20, 0x08, 0x94, 0xd5, 0x04, 0x83, 0x41, 0x97, 0xcb, 0xf5, 0xe8, 0xd1, 0xa3, 0x5b, 0xb7, 0x6e, 0xa5, 0xa7, 0xa7, 0x5b, 0xad, 0x56, 0x83, 0xc1, 0x10, 0x15, 0x15, 0x15, 0x1b, 0x1b, 0x7b, 0xfa, 0xf4, 0xe9, 0xc2, 0xc2, 0xc2, 0x87, 0x0f, 0x1f, 0x0e, 0x0e, 0x0e, 0x06, 0x83, 0x41, 0xfa, 0x15, 0x8e, 0x8f, 0x8f, 0xd7, 0xd4, 0xd4, 0x64, 0x64, 0x64, 0x58, 0x2c, 0x16, 0xab, 0xd5, 0x7a, 0xfe, 0xfc, 0xf9, 0xea, 0xea, 0xea, 0xe9, 0xe9, 0x69, 0x7a, 0x07, 0x4a, 0x34, 0xdd, 0x25, 0x98, 0xa5, 0xa5, 0xa5, 0xba, 0xba, 0xba, 0x8b, 0x17, 0x2f, 0x1e, 0x3e, 0x7c, 0xd8, 0x60, 0x30, 0x24, 0x26, 0x26, 0xe6, 0xe6, 0xe6, 0x3e, 0x79, 0xf2, 0x64, 0x63, 0x63, 0x43, 0x2a, 0x05, 0x00, 0xe0, 0xf6, 0x42, 0x00, 0x00, 0x7e, 0xbf, 0xdf, 0x6e, 0xb7, 0x23, 0x3f, 0x3d, 0x73, 0xe6, 0xcc, 0xfc, 0xfc, 0x3c, 0xf8, 0x97, 0xe1, 0xe1, 0xe1, 0xc4, 0xc4, 0x44, 0xa4, 0xf2, 0xf8, 0xf1, 0xe3, 0x63, 0x63, 0x63, 0x80, 0xc8, 0xc4, 0xc4, 0x44, 0x55, 0x55, 0x55, 0x5c, 0x5c, 0x1c, 0xcd, 0xf2, 0x52, 0x52, 0x52, 0x5e, 0xbe, 0x7c, 0x49, 0x36, 0x04, 0x00, 0xf0, 0x3c, 0xef, 0x70, 0x38, 0x90, 0xdb, 0x3f, 0x1c, 0xc7, 0x55, 0x54, 0x54, 0xf8, 0xfd, 0x7e, 0xc2, 0xda, 0x61, 0x70, 0x4a, 0x8d, 0x76, 0x09, 0xb7, 0x9c, 0x50, 0x28, 0xd4, 0xdc, 0xdc, 0x6c, 0x34, 0x1a, 0x91, 0x82, 0x63, 0xc7, 0x8e, 0x8d, 0x8c, 0x8c, 0xfc, 0xcf, 0x87, 0x60, 0x27, 0x8a, 0xe2, 0x95, 0x2b, 0x57, 0x08, 0x55, 0x26, 0x25, 0x25, 0x85, 0x1b, 0xd4, 0xd1, 0xd1, 0x71, 0xe0, 0xc0, 0x01, 0x82, 0xd2, 0x64, 0x32, 0x4d, 0x4f, 0x4f, 0xcb, 0x5d, 0x0f, 0x19, 0xbb, 0xdd, 0x1e, 0x0c, 0x06, 0x71, 0x86, 0x82, 0x20, 0xe4, 0xe5, 0xe5, 0x91, 0x1d, 0xf2, 0xf2, 0xf2, 0xe0, 0xf3, 0x44, 0x18, 0xfa, 0x22, 0xb5, 0xdb, 0x25, 0xa4, 0x3e, 0x10, 0x08, 0x94, 0x94, 0x94, 0x90, 0x3d, 0x63, 0x62, 0x62, 0xc6, 0xc7, 0xc7, 0xa9, 0x32, 0x54, 0x59, 0x59, 0xb9, 0x63, 0x89, 0x45, 0x45, 0x45, 0x2e, 0x97, 0x2b, 0x3a, 0x3a, 0x7a, 0x47, 0x65, 0x4e, 0x4e, 0x4e, 0x64, 0xbb, 0xc3, 0x71, 0x5c, 0x53, 0x53, 0x13, 0xce, 0xb0, 0xb4, 0xb4, 0x94, 0xc6, 0xa1, 0xbc, 0xbc, 0x1c, 0x39, 0x4e, 0x5f, 0xa4, 0x76, 0xbb, 0x84, 0x14, 0xdf, 0xbf, 0x7f, 0x9f, 0xc6, 0xf3, 0xc2, 0x85, 0x0b, 0xa1, 0x50, 0x68, 0xe7, 0x0c, 0x51, 0x62, 0x36, 0x9b, 0x29, 0x95, 0x1f, 0x3f, 0x7e, 0x8c, 0x6c, 0x77, 0x0e, 0x1e, 0x3c, 0xe8, 0xf1, 0x78, 0x60, 0xb7, 0xbe, 0xbe, 0xbe, 0xdd, 0x19, 0x6e, 0x11, 0xc1, 0x22, 0xc3, 0xec, 0xc1, 0x2e, 0xed, 0xce, 0x6d, 0x8b, 0xfe, 0xfe, 0xfe, 0xb0, 0xcf, 0x0e, 0xd7, 0xd4, 0x26, 0x93, 0xe9, 0xd9, 0xb3, 0x67, 0x5e, 0xaf, 0x57, 0x10, 0x84, 0xf7, 0xef, 0xdf, 0xc7, 0xc6, 0xc6, 0xc2, 0x1a, 0x9e, 0xe7, 0x39, 0x8e, 0x3b, 0x74, 0xe8, 0xd0, 0xd3, 0xa7, 0x4f, 0x57, 0x56, 0x56, 0x04, 0x41, 0xe8, 0xee, 0xee, 0x46, 0xb6, 0xec, 0xed, 0xdb, 0xb7, 0xe4, 0xe9, 0xb2, 0xb2, 0xb2, 0xea, 0xea, 0xea, 0xfa, 0xfa, 0xfa, 0xe6, 0xe7, 0xe7, 0x79, 0x9e, 0x0f, 0x06, 0x83, 0xa2, 0x28, 0x2e, 0x2f, 0x2f, 0x0f, 0x0d, 0x0d, 0x39, 0x1c, 0x0e, 0x83, 0x41, 0xfa, 0x74, 0x4f, 0x14, 0xc5, 0xd7, 0xaf, 0x5f, 0xc3, 0x3e, 0xf5, 0xf5, 0xf5, 0xf0, 0xa0, 0xd1, 0x68, 0x6c, 0x6c, 0x6c, 0x5c, 0x58, 0x58, 0x10, 0x45, 0x71, 0x61, 0x61, 0xa1, 0xa1, 0xa1, 0x81, 0xe6, 0xc4, 0x40, 0x83, 0x46, 0xbb, 0x44, 0xa0, 0xac, 0xac, 0x6c, 0x72, 0x72, 0xd2, 0xef, 0xf7, 0x2f, 0x2e, 0x2e, 0x3e, 0x78, 0xf0, 0x00, 0xa9, 0x71, 0x3a, 0x9d, 0xbf, 0x7f, 0x22, 0x47, 0x72, 0x60, 0x60, 0x60, 0x7b, 0x72, 0x9b, 0x9b, 0x9b, 0x71, 0xca, 0x9e, 0x9e, 0x9e, 0xed, 0xca, 0xd6, 0xd6, 0x56, 0x58, 0x73, 0xe9, 0xd2, 0x25, 0xdc, 0x11, 0x76, 0xfd, 0xfa, 0x75, 0x97, 0xcb, 0x85, 0xfb, 0x34, 0x4c, 0x47, 0x47, 0x07, 0xec, 0x79, 0xf3, 0xe6, 0x4d, 0x89, 0xcc, 0xed, 0x76, 0x23, 0x2b, 0x7c, 0xf7, 0xee, 0x9d, 0x44, 0xd9, 0xd5, 0xd5, 0x85, 0x5b, 0x0e, 0xb2, 0x80, 0xfd, 0xd4, 0x25, 0xc2, 0x72, 0xea, 0xeb, 0xeb, 0x25, 0x4a, 0xe4, 0x37, 0xfe, 0xd6, 0xd7, 0x2e, 0x29, 0x43, 0xf0, 0xc4, 0xa3, 0xa3, 0xa3, 0x48, 0x65, 0x7e, 0x7e, 0xbe, 0x44, 0xf9, 0xed, 0xdb, 0x37, 0x58, 0x76, 0xf4, 0xe8, 0x51, 0xf2, 0xfa, 0xc9, 0xf8, 0xfd, 0x7e, 0xd8, 0xf3, 0xe4, 0xc9, 0x93, 0x12, 0x59, 0x43, 0x43, 0x03, 0x2c, 0xbb, 0x71, 0xe3, 0x06, 0xd2, 0xb3, 0xa0, 0xa0, 0x00, 0xb9, 0x22, 0xa4, 0x78, 0x3f, 0x75, 0x09, 0xb7, 0x9c, 0x73, 0xe7, 0xce, 0x05, 0x02, 0x01, 0x89, 0xf2, 0xc3, 0x87, 0x0f, 0xb0, 0x32, 0x3e, 0x3e, 0x3e, 0xfc, 0x29, 0xe9, 0xdd, 0x8f, 0xe2, 0xe2, 0x62, 0xb8, 0x14, 0xa4, 0xf2, 0xce, 0x9d, 0x3b, 0x92, 0x91, 0x53, 0xa7, 0x4e, 0xe9, 0x74, 0x3a, 0x49, 0xa1, 0x3e, 0x9f, 0x8f, 0x30, 0x1d, 0xc7, 0x71, 0x1e, 0x8f, 0xa7, 0xb7, 0xb7, 0x77, 0x6c, 0x6c, 0xec, 0xcb, 0x97, 0x2f, 0x3f, 0x7e, 0xfc, 0xf0, 0xf9, 0x7c, 0xa2, 0x28, 0x86, 0x42, 0x21, 0xc2, 0xaf, 0x78, 0xbd, 0x5e, 0xc9, 0xc8, 0xa7, 0x4f, 0x9f, 0x60, 0x19, 0xee, 0x12, 0xdb, 0x6e, 0xb7, 0x0f, 0x0d, 0x0d, 0x91, 0xab, 0x22, 0xa3, 0xd1, 0x2e, 0xe1, 0xa8, 0xac, 0xac, 0x84, 0x6f, 0x1e, 0xd3, 0xd2, 0xd2, 0x60, 0xe5, 0xfa, 0xfa, 0xfa, 0xef, 0x9f, 0x08, 0x91, 0x9c, 0x9d, 0x9d, 0x95, 0xe4, 0x11, 0xb7, 0x0f, 0x36, 0x35, 0x35, 0x05, 0xc7, 0x3c, 0x26, 0x26, 0x06, 0x56, 0xe2, 0x8e, 0x9e, 0xe5, 0xe5, 0xe5, 0x92, 0x92, 0x12, 0xf2, 0xad, 0x2f, 0x92, 0xf0, 0xdf, 0x60, 0x3b, 0xa9, 0xa9, 0xa9, 0xb0, 0xec, 0xeb, 0xd7, 0xaf, 0xc8, 0x79, 0xe7, 0xe6, 0xe6, 0x90, 0xb6, 0x48, 0x31, 0x52, 0xa9, 0xd1, 0x2e, 0xe1, 0x96, 0xe3, 0x76, 0xbb, 0x61, 0x25, 0x62, 0x5f, 0x71, 0x5b, 0x9d, 0xa4, 0x0c, 0x6d, 0x6c, 0x6c, 0x48, 0xbc, 0x02, 0x81, 0x00, 0x52, 0xb9, 0xb6, 0xb6, 0x06, 0x4f, 0x8c, 0xbc, 0x62, 0x45, 0xb6, 0x66, 0x72, 0x72, 0xf2, 0xc8, 0x91, 0x23, 0x74, 0xdd, 0xc0, 0xae, 0x64, 0x0b, 0xe4, 0x25, 0xed, 0xcf, 0x9f, 0x3f, 0x91, 0x53, 0x93, 0xbb, 0x43, 0xd3, 0x74, 0x8d, 0x76, 0x09, 0xb7, 0x1c, 0x64, 0x91, 0x9b, 0x9b, 0x9b, 0x04, 0x4f, 0x52, 0x86, 0x90, 0x7b, 0x53, 0x48, 0x25, 0xfc, 0x0d, 0x8a, 0x53, 0xc2, 0x32, 0x9e, 0xe7, 0x4f, 0x9c, 0x38, 0x41, 0xd1, 0x04, 0x2c, 0x12, 0x43, 0xe4, 0x61, 0x8a, 0xac, 0x10, 0xe0, 0xff, 0xde, 0x48, 0x31, 0x52, 0xa9, 0xd1, 0x2e, 0xc9, 0x2a, 0x12, 0xf7, 0xd8, 0x24, 0xfc, 0x29, 0xe9, 0xde, 0x5e, 0xaf, 0xa7, 0x7d, 0x22, 0xbb, 0x8b, 0xb3, 0xeb, 0x16, 0x2f, 0x5e, 0xbc, 0x58, 0x5a, 0x5a, 0x82, 0xa7, 0xae, 0xad, 0xad, 0xfd, 0xfc, 0xf9, 0xb3, 0xe4, 0x28, 0xa7, 0x31, 0x44, 0xde, 0x30, 0x23, 0xaf, 0x34, 0x39, 0x8e, 0xa3, 0x7f, 0x4a, 0x85, 0x43, 0xa3, 0x5d, 0x92, 0x55, 0xe4, 0x0e, 0x6b, 0x94, 0x75, 0x34, 0xfc, 0x09, 0xa5, 0xcd, 0x66, 0x83, 0x65, 0x8f, 0x1f, 0x3f, 0x86, 0x95, 0xff, 0x5d, 0xc4, 0x11, 0x3d, 0xff, 0xf2, 0xf5, 0x90, 0x46, 0xbb, 0x24, 0xab, 0x48, 0xb2, 0x58, 0xfd, 0x77, 0x3f, 0x66, 0x66, 0x66, 0xe0, 0xc1, 0x8a, 0x8a, 0x0a, 0x78, 0x70, 0x6a, 0x6a, 0x8a, 0xc6, 0xf0, 0xec, 0xd9, 0xb3, 0xf0, 0x20, 0x6e, 0xd3, 0x08, 0x37, 0xbe, 0xd7, 0x88, 0x78, 0x97, 0x22, 0x88, 0xfa, 0x19, 0x42, 0xde, 0xca, 0xc2, 0x9b, 0xad, 0x1c, 0xc7, 0xb5, 0xb7, 0xb7, 0xd3, 0x18, 0x5e, 0xbe, 0x7c, 0x19, 0x1e, 0x7c, 0xf3, 0xe6, 0x0d, 0x52, 0xfc, 0xea, 0xd5, 0x2b, 0x1a, 0x4f, 0xd5, 0x89, 0x78, 0x97, 0x22, 0x89, 0xea, 0x67, 0x69, 0x93, 0xc9, 0x04, 0xcb, 0x3a, 0x3b, 0x3b, 0x25, 0xb2, 0xce, 0xce, 0x4e, 0xf2, 0x12, 0xb6, 0xc0, 0x9d, 0x5a, 0x9c, 0x4e, 0xa7, 0x44, 0xd9, 0xdd, 0xdd, 0x4d, 0xe9, 0xb9, 0xff, 0xba, 0x24, 0xab, 0x48, 0xb2, 0x58, 0xfd, 0x0c, 0xe5, 0xe4, 0xe4, 0xc0, 0x32, 0xb3, 0xd9, 0xdc, 0xde, 0xde, 0xee, 0xf5, 0x7a, 0x37, 0x37, 0x37, 0xe7, 0xe6, 0xe6, 0x6a, 0x6b, 0x6b, 0x09, 0x97, 0x75, 0xb0, 0x67, 0x76, 0x76, 0x36, 0x2c, 0x33, 0x1a, 0x8d, 0x4d, 0x4d, 0x4d, 0x8b, 0x8b, 0x8b, 0xbf, 0x7e, 0xfd, 0xfa, 0xfe, 0xfd, 0x7b, 0x63, 0x63, 0x23, 0xe1, 0x79, 0xd9, 0xdf, 0x59, 0xbb, 0xba, 0x5d, 0xa2, 0x2f, 0x92, 0x2c, 0x56, 0x3f, 0x43, 0xc8, 0x47, 0x13, 0xb2, 0x80, 0x3d, 0xff, 0xe6, 0x73, 0x7b, 0xed, 0x76, 0x89, 0xbe, 0x48, 0xb2, 0x58, 0xfd, 0x0c, 0xad, 0xac, 0xac, 0x20, 0x77, 0x05, 0x61, 0xca, 0xca, 0xca, 0xe8, 0x67, 0xa7, 0x7c, 0x7f, 0x48, 0x96, 0xa7, 0x8a, 0xca, 0x3f, 0xd1, 0x25, 0xfa, 0x22, 0xc9, 0x62, 0xf5, 0x33, 0x04, 0x00, 0x70, 0x3a, 0x9d, 0x3b, 0xee, 0x9d, 0x5c, 0xbb, 0x76, 0x0d, 0xb7, 0xc7, 0x83, 0xf4, 0xa4, 0x79, 0x8f, 0xd1, 0x66, 0xb3, 0xc9, 0xf2, 0x54, 0x57, 0x19, 0xf1, 0x2e, 0xd1, 0x4f, 0x4d, 0x16, 0xef, 0x89, 0x0c, 0x01, 0x00, 0x7a, 0x7b, 0x7b, 0x13, 0x12, 0x12, 0x90, 0xbf, 0xc2, 0xed, 0xea, 0xdd, 0x67, 0x00, 0x00, 0xcf, 0xf3, 0x77, 0xef, 0xde, 0xc5, 0x79, 0x96, 0x96, 0x96, 0x0a, 0x82, 0xa0, 0xfa, 0xda, 0x65, 0xad, 0x28, 0xb2, 0x5d, 0x92, 0x35, 0x35, 0x41, 0xbc, 0x57, 0x32, 0x04, 0x00, 0x58, 0x5d, 0x5d, 0x6d, 0x69, 0x69, 0x09, 0xff, 0xc3, 0x83, 0x5e, 0xaf, 0x37, 0x99, 0x4c, 0x99, 0x99, 0x99, 0x0e, 0x87, 0x63, 0xfb, 0x53, 0x40, 0xb9, 0x9e, 0x00, 0x00, 0xb7, 0xdb, 0x5d, 0x55, 0x55, 0x95, 0x9e, 0x9e, 0x6e, 0x36, 0x9b, 0x2d, 0x16, 0x4b, 0x66, 0x66, 0xe6, 0xbd, 0x7b, 0xf7, 0x76, 0xe7, 0xb9, 0xcf, 0xba, 0x24, 0x6b, 0x6a, 0x82, 0x58, 0xfa, 0xe2, 0x01, 0x83, 0x21, 0x17, 0xf5, 0xf7, 0x18, 0x19, 0x5a, 0x87, 0x65, 0x88, 0xa1, 0x14, 0x96, 0x21, 0x86, 0x52, 0x58, 0x86, 0x18, 0x4a, 0x61, 0x19, 0x62, 0x28, 0x85, 0x65, 0x88, 0xa1, 0x94, 0x7f, 0x00, 0x0f, 0x5f, 0x76, 0x97, 0xc5, 0x52, 0x53, 0xd5, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char madman_logo_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x5b, 0x00, 0x00, 0x00, 0x49, 0x08, 0x06, 0x00, 0x00, 0x00, 0x52, 0x28, 0x5a, 0x09, 0x00, 0x00, 0x00, 0x06, 0x62, 0x4b, 0x47, 0x44, 0x00, 0xff, 0x00, 0xff, 0x00, 0xff, 0xa0, 0xbd, 0xa7, 0x93, 0x00, 0x00, 0x00, 0x09, 0x70, 0x48, 0x59, 0x73, 0x00, 0x00, 0x0b, 0x12, 0x00, 0x00, 0x0b, 0x12, 0x01, 0xd2, 0xdd, 0x7e, 0xfc, 0x00, 0x00, 0x00, 0x07, 0x74, 0x49, 0x4d, 0x45, 0x07, 0xd3, 0x0c, 0x1b, 0x0e, 0x34, 0x2e, 0x77, 0xf4, 0x2a, 0x8c, 0x00, 0x00, 0x20, 0x00, 0x49, 0x44, 0x41, 0x54, 0x78, 0x9c, 0xb5, 0x9d, 0x77, 0x9c, 0x15, 0xd5, 0xf9, 0xff, 0xdf, 0x67, 0xca, 0xed, 0x65, 0xfb, 0x2e, 0xdb, 0x97, 0x05, 0x96, 0xde, 0x04, 0x11, 0x50, 0x04, 0x51, 0x21, 0xa0, 0x62, 0x8d, 0x2d, 0xf6, 0xc4, 0x44, 0x13, 0x8d, 0x29, 0x26, 0xa6, 0x98, 0xf6, 0x35, 0xea, 0x37, 0x31, 0xc6, 0xd8, 0xe3, 0x57, 0x8d, 0xc6, 0x6e, 0x62, 0xd7, 0x88, 0xb1, 0xa1, 0x22, 0x4d, 0x8a, 0xf4, 0xbe, 0xb0, 0x6c, 0x2f, 0x77, 0xf7, 0xee, 0xed, 0xf7, 0x4e, 0x39, 0xbf, 0x3f, 0xee, 0x65, 0x01, 0xc1, 0xb2, 0x24, 0xbf, 0x87, 0xd7, 0x5d, 0xd8, 0x99, 0xb9, 0x33, 0xe7, 0x7c, 0xe6, 0x39, 0x9f, 0xa7, 0xce, 0x20, 0x38, 0x20, 0x3a, 0x30, 0x0e, 0x18, 0x03, 0x78, 0x81, 0x02, 0x40, 0x02, 0x16, 0xd0, 0x06, 0xb4, 0x79, 0x3c, 0x9e, 0x84, 0xc3, 0xe1, 0x50, 0x53, 0xa9, 0x54, 0xbf, 0x65, 0x59, 0x09, 0xcb, 0xb2, 0x0c, 0xdb, 0xb6, 0x6b, 0x15, 0x45, 0x99, 0x02, 0x6c, 0x76, 0xb9, 0x5c, 0x2b, 0x4d, 0xd3, 0x3c, 0x3e, 0x93, 0xc9, 0x1c, 0x0f, 0x28, 0x40, 0x21, 0xe0, 0xc8, 0xfd, 0x3b, 0x9d, 0xbb, 0x4e, 0x58, 0x51, 0x94, 0x5d, 0x40, 0x9f, 0xaa, 0xaa, 0x05, 0x80, 0x34, 0x4d, 0xb3, 0x5d, 0x08, 0xd1, 0x6b, 0xdb, 0xb6, 0x5b, 0x08, 0xb1, 0xab, 0xac, 0xb4, 0xb4, 0xe9, 0x27, 0x3f, 0xfd, 0xa9, 0x79, 0xcf, 0x3d, 0xf7, 0xb0, 0x67, 0xcf, 0x1e, 0x8f, 0xae, 0xeb, 0x64, 0x32, 0x99, 0x2a, 0x21, 0xc4, 0x30, 0x20, 0x5f, 0x51, 0x94, 0x12, 0xdb, 0xb6, 0x5d, 0xb9, 0xf3, 0x25, 0x80, 0x84, 0x94, 0xb2, 0x0c, 0xb0, 0x73, 0x1f, 0xa9, 0x28, 0xca, 0x9b, 0xe5, 0xe5, 0xe5, 0xeb, 0x5b, 0x5a, 0x5a, 0x24, 0xc0, 0x83, 0x0f, 0x3e, 0x88, 0xcf, 0xe7, 0xe3, 0x1b, 0xdf, 0xf8, 0x06, 0xd5, 0xd5, 0xd5, 0x4a, 0x4b, 0x4b, 0xcb, 0x58, 0x29, 0xe5, 0x54, 0x29, 0xe5, 0xb4, 0xdc, 0xdc, 0x2d, 0x60, 0x8b, 0xa2, 0x28, 0x6f, 0xd5, 0xd6, 0xd6, 0x6e, 0x69, 0x6c, 0x6c, 0x94, 0xaa, 0xaa, 0xd6, 0x59, 0x96, 0x75, 0x89, 0x10, 0xa2, 0x18, 0x58, 0x09, 0x78, 0xa4, 0x94, 0x53, 0x80, 0xea, 0xdc, 0x7c, 0x7c, 0x40, 0x0c, 0xf0, 0x00, 0xe5, 0xb9, 0x79, 0x02, 0xf4, 0xe4, 0xc6, 0xb5, 0x01, 0x78, 0x1b, 0x78, 0x1f, 0x30, 0x44, 0x6e, 0xe7, 0xcd, 0xc0, 0xf7, 0x0a, 0xf3, 0xfc, 0xc5, 0x93, 0x46, 0xd5, 0xe2, 0xf5, 0xb8, 0x44, 0x49, 0x41, 0x10, 0x89, 0xb4, 0x0d, 0xc3, 0x14, 0xed, 0xdd, 0x61, 0xd1, 0x19, 0xea, 0x47, 0x4a, 0x89, 0x10, 0xa0, 0x28, 0x0a, 0x3b, 0xf7, 0xb6, 0x13, 0x4b, 0xa4, 0xd0, 0x75, 0x8d, 0xba, 0xca, 0x12, 0xf6, 0xb5, 0x75, 0xcb, 0x54, 0xda, 0xb0, 0x84, 0x10, 0x9a, 0x94, 0x12, 0x3f, 0x30, 0x34, 0x37, 0x83, 0x48, 0x6e, 0x36, 0xd5, 0x40, 0x00, 0x70, 0x01, 0x19, 0xa0, 0x17, 0xd8, 0x9e, 0x1b, 0x99, 0x79, 0xe0, 0xa6, 0x4b, 0x20, 0x0e, 0xb4, 0x0a, 0x21, 0x3c, 0x7e, 0xbf, 0xbf, 0xbc, 0xbc, 0xbc, 0x5c, 0x96, 0x96, 0x96, 0x6a, 0xa5, 0xa5, 0xa5, 0x04, 0x83, 0x41, 0xba, 0x7b, 0xba, 0xd1, 0x34, 0x1d, 0x01, 0x14, 0x14, 0x14, 0x50, 0x58, 0x58, 0x88, 0xdf, 0xef, 0x27, 0x16, 0x8b, 0x11, 0x0a, 0x85, 0x08, 0x87, 0xc3, 0x74, 0x75, 0x75, 0xc9, 0x4f, 0x3f, 0xfd, 0xb4, 0x27, 0x1c, 0x0e, 0xf7, 0x48, 0x29, 0x6d, 0x29, 0xa5, 0x4f, 0x08, 0x81, 0x94, 0xb2, 0x57, 0x08, 0x91, 0xef, 0x92, 0xb2, 0xd6, 0x9d, 0x1b, 0xc3, 0x67, 0x44, 0x02, 0x7d, 0x42, 0x88, 0x8c, 0x94, 0x32, 0xaf, 0xae, 0xb2, 0xc4, 0xb9, 0x68, 0xee, 0xb1, 0x62, 0xe5, 0x86, 0x9d, 0xac, 0x5c, 0xbf, 0x03, 0xbf, 0xd7, 0xcd, 0xd9, 0xa7, 0x4c, 0xa3, 0xa6, 0xa2, 0x18, 0x81, 0x40, 0x28, 0x82, 0x92, 0x82, 0x00, 0x25, 0x85, 0x41, 0x34, 0x45, 0x41, 0x02, 0x5d, 0xa1, 0x7e, 0x62, 0x89, 0x14, 0x6b, 0x36, 0x37, 0xf2, 0xc1, 0xaa, 0xcd, 0x34, 0x77, 0x84, 0x96, 0x03, 0xb3, 0x04, 0x30, 0x2d, 0x3f, 0xe8, 0x5b, 0xf1, 0xd2, 0xbd, 0x37, 0x72, 0xfc, 0xe4, 0x91, 0xa8, 0xaa, 0x72, 0xf8, 0xe5, 0x01, 0x29, 0x25, 0x19, 0xc3, 0xe4, 0xa9, 0xd7, 0x3e, 0xe2, 0x81, 0x67, 0xfe, 0xcd, 0xd6, 0xdd, 0x2d, 0x5c, 0x77, 0xc9, 0xd7, 0xb8, 0xf6, 0xc2, 0x79, 0x14, 0xe5, 0x07, 0xf8, 0x78, 0xdd, 0x76, 0x7e, 0x70, 0xdb, 0x63, 0xf6, 0xa6, 0x1d, 0xfb, 0x14, 0x4d, 0x08, 0xa6, 0x03, 0x05, 0x52, 0x92, 0x06, 0xf6, 0xe5, 0xd4, 0x6d, 0x14, 0x30, 0x04, 0x28, 0x01, 0x9a, 0x81, 0xcb, 0x80, 0x99, 0x40, 0x27, 0x70, 0x29, 0xf0, 0x4e, 0xee, 0x5a, 0x79, 0x79, 0x79, 0x9c, 0x76, 0xda, 0x69, 0xcc, 0x9b, 0x37, 0x8f, 0xd2, 0xd2, 0x52, 0x56, 0xad, 0x5a, 0xc5, 0xfa, 0xf5, 0xeb, 0x69, 0x6e, 0x6e, 0xa6, 0xb3, 0xb3, 0x93, 0xce, 0xce, 0x4e, 0x7c, 0x3e, 0x1f, 0x6e, 0xb7, 0x9b, 0x82, 0x82, 0x02, 0xf2, 0xf3, 0xf3, 0x71, 0xb9, 0x5c, 0xe4, 0xe5, 0xe5, 0x51, 0x51, 0x51, 0x41, 0x65, 0x65, 0x25, 0x95, 0x95, 0x95, 0xb8, 0xdd, 0x6e, 0x3e, 0xf8, 0xe0, 0x03, 0x9e, 0x79, 0xe6, 0x19, 0xf6, 0xed, 0xdb, 0x07, 0x40, 0x03, 0xf0, 0x7b, 0xe0, 0x6b, 0xb9, 0x1b, 0xfe, 0x12, 0xb0, 0x1a, 0xd8, 0x05, 0xb4, 0x02, 0x7b, 0x85, 0x20, 0x2e, 0x25, 0x00, 0xf3, 0x4f, 0x98, 0xc8, 0x9f, 0x7e, 0x7a, 0x99, 0x2c, 0x2d, 0x0a, 0x0a, 0x45, 0x51, 0x58, 0xbb, 0xb9, 0x91, 0xbb, 0x9f, 0xf8, 0x17, 0x6f, 0x2d, 0x5d, 0xcf, 0x09, 0x53, 0x46, 0x71, 0xdb, 0x0f, 0x2f, 0x62, 0x7c, 0x43, 0x0d, 0x42, 0x08, 0x14, 0x45, 0xa0, 0x08, 0x91, 0xc3, 0x0a, 0x32, 0x86, 0x49, 0x4f, 0x5f, 0x84, 0x78, 0x32, 0xcd, 0x9c, 0xcb, 0x7e, 0x43, 0x7b, 0x57, 0xdf, 0x6c, 0x0d, 0x68, 0x28, 0x2f, 0xc9, 0xa7, 0xbe, 0xaa, 0x94, 0x78, 0x32, 0x8d, 0xa2, 0x08, 0x54, 0x45, 0x41, 0x51, 0xb2, 0x5f, 0xb4, 0x6c, 0x1b, 0xd3, 0xb4, 0xe9, 0xe8, 0xe9, 0xe3, 0xc2, 0x1f, 0xfd, 0x85, 0x78, 0x22, 0xc5, 0x8d, 0x57, 0x2d, 0xe2, 0xbc, 0xf9, 0xd3, 0xf1, 0x7a, 0x9c, 0xa4, 0x52, 0x19, 0x9c, 0x0e, 0x8d, 0x13, 0x8e, 0x19, 0xc9, 0x73, 0x7f, 0xfe, 0x81, 0x72, 0xff, 0x53, 0x6f, 0x91, 0x31, 0x4d, 0xa2, 0xf1, 0x24, 0x79, 0x7e, 0x2f, 0xaf, 0xbe, 0xb7, 0x9a, 0xb6, 0xae, 0x5e, 0xb4, 0x1c, 0x90, 0x0e, 0xe0, 0x04, 0xe0, 0x5b, 0x64, 0xd7, 0x60, 0x73, 0x4e, 0xbb, 0xce, 0xcb, 0x81, 0x7d, 0xca, 0x29, 0xa7, 0x70, 0xcb, 0x2d, 0xb7, 0xd0, 0xdb, 0xdb, 0xcb, 0xb3, 0xcf, 0x3e, 0xcb, 0x6b, 0xaf, 0xbd, 0x46, 0x6f, 0x6f, 0x56, 0xff, 0x9c, 0xc0, 0xd7, 0x85, 0x40, 0x93, 0x12, 0x67, 0x22, 0x41, 0x05, 0xa0, 0x36, 0x35, 0xb1, 0x89, 0xec, 0xfa, 0xed, 0xca, 0x81, 0xb6, 0x15, 0x88, 0x02, 0x75, 0x75, 0x75, 0x5c, 0x75, 0xd5, 0x55, 0xdc, 0x7f, 0xff, 0xfd, 0x2c, 0x5b, 0xb6, 0x8c, 0x37, 0x5e, 0x7f, 0x9d, 0xcb, 0x37, 0x6d, 0xe2, 0x6c, 0xdb, 0xe6, 0x0f, 0x40, 0x08, 0xd0, 0x80, 0x52, 0xe0, 0x55, 0xa0, 0x25, 0x87, 0x54, 0xc3, 0xd0, 0x0a, 0x66, 0x4d, 0x19, 0xc5, 0x84, 0x86, 0x1a, 0xea, 0xaa, 0x4a, 0x84, 0xa6, 0xaa, 0x00, 0xcc, 0x9c, 0x3c, 0x92, 0x29, 0xe3, 0xea, 0xe9, 0xec, 0x0e, 0xf3, 0x97, 0xbf, 0xff, 0x8b, 0x53, 0xaf, 0xba, 0x85, 0x27, 0xfe, 0x70, 0x1d, 0x13, 0x47, 0xd6, 0x66, 0xc7, 0xe7, 0xd0, 0xd1, 0x35, 0x15, 0xdb, 0x96, 0x24, 0xd3, 0x69, 0x92, 0xe9, 0x0c, 0xef, 0x2e, 0xdf, 0x48, 0x3c, 0x91, 0x92, 0x40, 0x42, 0x90, 0x5d, 0xd9, 0x6f, 0x54, 0x94, 0x16, 0x1c, 0x7f, 0xca, 0x8c, 0xf1, 0x94, 0x16, 0xe5, 0x31, 0x71, 0x64, 0x2d, 0x05, 0x79, 0x3e, 0xd2, 0x19, 0x83, 0x70, 0x24, 0xc1, 0xf6, 0x3d, 0x6d, 0xbc, 0xfa, 0xde, 0x27, 0x54, 0x96, 0x15, 0xf2, 0xd2, 0xbd, 0x37, 0xa2, 0x69, 0x2a, 0x6b, 0x36, 0xed, 0xa6, 0xb6, 0xa2, 0x04, 0xc3, 0xb4, 0xf0, 0x79, 0x5c, 0x78, 0xdd, 0x4e, 0xa4, 0x94, 0xf4, 0x45, 0xe2, 0x24, 0xd3, 0x19, 0x4c, 0xcb, 0xe6, 0x93, 0x0d, 0xbb, 0xf8, 0xc6, 0x8d, 0x77, 0x63, 0xd9, 0x36, 0x93, 0x80, 0xb9, 0xc0, 0xf4, 0x1c, 0xd8, 0x02, 0x78, 0x81, 0x2c, 0xa1, 0x35, 0x01, 0x6b, 0x80, 0x05, 0x0b, 0x17, 0xf2, 0xeb, 0x5f, 0xff, 0x9a, 0x87, 0x1e, 0x7a, 0x88, 0xc5, 0xff, 0x7a, 0x9d, 0xaf, 0x1d, 0x3f, 0x96, 0x51, 0xf5, 0x95, 0xdc, 0xff, 0xf4, 0x62, 0x76, 0x35, 0x75, 0x50, 0x51, 0x10, 0x60, 0xe2, 0xc8, 0x5a, 0x22, 0x19, 0x93, 0x15, 0xeb, 0xb6, 0x53, 0x57, 0x59, 0x42, 0x7f, 0x67, 0x2f, 0x79, 0x4e, 0x07, 0x1e, 0xcb, 0x84, 0x58, 0x12, 0x80, 0x46, 0x4d, 0xa5, 0xc4, 0x96, 0x9c, 0x63, 0xdb, 0x3c, 0x0e, 0x28, 0x15, 0x15, 0x5c, 0x73, 0xcd, 0x35, 0x8c, 0x19, 0x33, 0x86, 0xc7, 0x1e, 0x7e, 0x98, 0x6b, 0xdf, 0x7c, 0x93, 0x53, 0x6d, 0x9b, 0x38, 0xb0, 0x1b, 0xf8, 0x98, 0x2c, 0x95, 0x7d, 0x08, 0x6c, 0x54, 0x04, 0x25, 0xc3, 0xaa, 0x78, 0xf0, 0xb7, 0xdf, 0xa6, 0xa1, 0x6e, 0x08, 0x01, 0x9f, 0x07, 0x4d, 0x55, 0x10, 0x42, 0xb0, 0x65, 0x77, 0x0b, 0x7f, 0x7f, 0x69, 0x09, 0xbf, 0xfe, 0xde, 0xd7, 0x89, 0xc6, 0x93, 0xfc, 0xe4, 0x8e, 0x27, 0x79, 0xea, 0xd5, 0x8f, 0x18, 0x56, 0x53, 0x46, 0x5d, 0x65, 0x09, 0xf9, 0x01, 0x2f, 0x0e, 0x5d, 0xa7, 0xa7, 0x2f, 0xc2, 0xe6, 0x5d, 0xcd, 0xf4, 0xf4, 0x45, 0x89, 0xc6, 0x93, 0xed, 0xc0, 0x8f, 0x81, 0xa7, 0x35, 0xb2, 0x94, 0x7a, 0x52, 0x6b, 0x67, 0xef, 0x96, 0xcd, 0xbb, 0x9a, 0x87, 0x35, 0x77, 0x84, 0x78, 0xe5, 0xdd, 0x4f, 0x88, 0xc4, 0x92, 0x38, 0x74, 0x8d, 0x92, 0xc2, 0x00, 0xe5, 0x25, 0x05, 0x18, 0xa6, 0xc5, 0x9c, 0x69, 0x63, 0xd1, 0x35, 0x8d, 0xbe, 0x48, 0x8c, 0x9f, 0xff, 0xf9, 0x19, 0x8a, 0xf2, 0x03, 0xdc, 0xf1, 0x93, 0x4b, 0xf8, 0xe7, 0x5b, 0x2b, 0x38, 0xf5, 0xf8, 0x09, 0x54, 0x95, 0x15, 0x52, 0x94, 0x1f, 0x20, 0x91, 0x4a, 0xd3, 0xd1, 0xd3, 0xcf, 0x9f, 0x1f, 0x7b, 0x1d, 0xb7, 0x6d, 0x73, 0x29, 0x70, 0x0e, 0xa0, 0xe6, 0x40, 0xee, 0xcd, 0x81, 0xbb, 0x0e, 0x98, 0x24, 0x04, 0x6b, 0xa4, 0x64, 0x48, 0x79, 0x39, 0xb3, 0x66, 0xcd, 0xe2, 0xac, 0xb3, 0xce, 0x62, 0x6c, 0x5d, 0x31, 0x8f, 0xdc, 0xf2, 0x2d, 0x2a, 0x4a, 0x0a, 0x28, 0xca, 0xf3, 0x31, 0x79, 0x54, 0x1d, 0x3e, 0xaf, 0x9b, 0x8a, 0xd2, 0x7c, 0x02, 0x3e, 0x37, 0x86, 0x61, 0xb1, 0x6a, 0xc3, 0x2e, 0x86, 0xd5, 0x94, 0xa1, 0xaa, 0x0a, 0xd2, 0x96, 0x34, 0x77, 0x84, 0xd8, 0xb4, 0xb9, 0x91, 0x17, 0x1e, 0x7d, 0x8d, 0xba, 0xb1, 0x43, 0xb9, 0xee, 0xc2, 0x79, 0x3c, 0xf9, 0xea, 0x87, 0x74, 0xbc, 0xf2, 0x01, 0xdf, 0x3b, 0x69, 0x3c, 0xff, 0x78, 0xf2, 0xff, 0x78, 0xa7, 0xac, 0x8e, 0xab, 0xaf, 0xbe, 0x9a, 0xdb, 0xb7, 0x6f, 0x67, 0xe2, 0xae, 0x5d, 0x3c, 0x02, 0xf4, 0x91, 0xf5, 0x04, 0xee, 0xcb, 0xd1, 0x19, 0xb6, 0x84, 0xde, 0x08, 0xdf, 0xba, 0xf9, 0x01, 0x5e, 0x7b, 0xe0, 0x26, 0x5e, 0x7b, 0x7f, 0x0d, 0xcf, 0xbf, 0xb9, 0x8c, 0xdf, 0x5e, 0xf7, 0x75, 0xce, 0xb8, 0xf6, 0x7f, 0xb9, 0xf6, 0xc2, 0x79, 0xb8, 0x9c, 0x3a, 0xc9, 0x74, 0x06, 0x21, 0x04, 0xe7, 0xcc, 0x3b, 0x8e, 0x93, 0xa6, 0x8d, 0xa5, 0xad, 0xbb, 0x97, 0xee, 0xde, 0x08, 0xa6, 0x65, 0x33, 0x72, 0x68, 0x05, 0xb3, 0xa6, 0x8e, 0x66, 0x5f, 0x5b, 0x37, 0xf7, 0x3e, 0xb5, 0xd8, 0xce, 0xe9, 0x15, 0xfb, 0x0d, 0xe4, 0x58, 0xbf, 0xd7, 0xb5, 0x61, 0xfb, 0xe2, 0xbb, 0x45, 0x59, 0x51, 0x5e, 0x96, 0x77, 0x00, 0xcb, 0xb2, 0x49, 0xa7, 0x0d, 0x22, 0xf1, 0x24, 0xdf, 0xff, 0xfd, 0xa3, 0x14, 0xe5, 0xfb, 0x79, 0xe0, 0x37, 0x57, 0x13, 0x4f, 0xa6, 0x69, 0x6e, 0xef, 0x61, 0xfe, 0x37, 0x7f, 0x4f, 0x71, 0x41, 0x80, 0x50, 0x38, 0xca, 0xb6, 0x37, 0xff, 0x82, 0x43, 0xd7, 0x06, 0x38, 0xeb, 0x81, 0x67, 0xde, 0xe2, 0x96, 0x3f, 0xfc, 0x9d, 0xa9, 0xa9, 0x0c, 0x7b, 0x80, 0xcd, 0x39, 0x8d, 0xfe, 0x2e, 0xb0, 0x47, 0x08, 0x96, 0x57, 0x54, 0x60, 0x8f, 0x19, 0x83, 0xaf, 0xb0, 0x90, 0xf5, 0xeb, 0xd7, 0xb3, 0x79, 0xf3, 0x66, 0x00, 0x2e, 0x3f, 0x7b, 0x0e, 0x37, 0x5c, 0xba, 0x90, 0x8a, 0xd2, 0x02, 0x0a, 0xf2, 0x7c, 0x03, 0x3c, 0xf8, 0x59, 0xc9, 0x1a, 0xeb, 0x43, 0xf7, 0x19, 0xa6, 0x45, 0x4b, 0x47, 0x88, 0x57, 0xdf, 0x5b, 0xcd, 0x35, 0x17, 0x9e, 0x4a, 0x38, 0x12, 0xe7, 0x99, 0x37, 0x3e, 0x66, 0xea, 0xb8, 0x7a, 0xa4, 0x94, 0x2c, 0xb8, 0xfa, 0x36, 0x6a, 0x87, 0x0e, 0x63, 0xd6, 0xac, 0x59, 0x7c, 0x74, 0xef, 0xbd, 0xdc, 0x42, 0xd6, 0x70, 0x2f, 0xce, 0x81, 0xad, 0x38, 0x74, 0x3c, 0x2e, 0x07, 0x8f, 0xdd, 0xfe, 0x3d, 0x46, 0xd4, 0x0e, 0x21, 0x2f, 0xe0, 0xa5, 0x28, 0x3f, 0xc0, 0xe9, 0xdf, 0xb9, 0x8d, 0xb7, 0x97, 0x6d, 0xe0, 0xaa, 0x73, 0xe7, 0x72, 0xcf, 0x2f, 0xaf, 0x24, 0x99, 0xce, 0x10, 0x8d, 0xa5, 0x38, 0xe7, 0xba, 0x3f, 0x22, 0x14, 0xc1, 0xaf, 0xbe, 0x7b, 0x1e, 0x13, 0x1a, 0x6a, 0x08, 0xfa, 0x3d, 0x00, 0x08, 0x21, 0xb0, 0x6d, 0x9b, 0xf5, 0xdb, 0x9a, 0xc2, 0x27, 0x5e, 0xf2, 0xab, 0x80, 0x6d, 0xcb, 0x2a, 0xa0, 0x6d, 0xff, 0x68, 0x0b, 0x84, 0x60, 0xc7, 0x79, 0xf3, 0x67, 0x14, 0x9c, 0x7d, 0xca, 0x34, 0x51, 0x57, 0x59, 0x62, 0xb7, 0x76, 0xf5, 0x2a, 0x5b, 0x76, 0x35, 0xf3, 0xc1, 0xaa, 0x2d, 0x6c, 0xdc, 0xb1, 0x0f, 0xdb, 0xb6, 0x51, 0x55, 0x95, 0xed, 0x8b, 0xff, 0x82, 0xcb, 0xe9, 0x20, 0x14, 0x8e, 0xf2, 0xd1, 0xea, 0xad, 0x7c, 0xfd, 0x86, 0x3b, 0xb9, 0xf4, 0xcc, 0x13, 0xb9, 0xec, 0xcc, 0xd9, 0x9c, 0x74, 0xdc, 0x58, 0x00, 0x5e, 0x7d, 0x6f, 0x35, 0x67, 0x7d, 0xf7, 0x0f, 0xd8, 0x39, 0xef, 0x25, 0x67, 0x6f, 0x50, 0xc9, 0x72, 0xeb, 0xc2, 0x33, 0xcf, 0xe4, 0xfa, 0xeb, 0xaf, 0xa7, 0xb8, 0xb8, 0x98, 0xfe, 0xfe, 0x7e, 0x5e, 0x7b, 0xed, 0x35, 0x1e, 0x7f, 0xfc, 0x71, 0x42, 0xa1, 0x1e, 0xfe, 0xf5, 0xd0, 0xcf, 0x99, 0x39, 0xb9, 0x01, 0xb7, 0xd3, 0x71, 0x44, 0x90, 0x07, 0x2b, 0x91, 0x58, 0x92, 0xdd, 0xcd, 0x9d, 0xd8, 0xb6, 0xcd, 0x0d, 0xb7, 0xfe, 0x8d, 0x65, 0xeb, 0x76, 0x30, 0x6b, 0xd6, 0x2c, 0x8e, 0x3d, 0xf6, 0x58, 0x36, 0xac, 0x59, 0x43, 0xc9, 0x92, 0x25, 0xcc, 0xb1, 0x2c, 0xfe, 0x07, 0x48, 0x96, 0x14, 0x70, 0xf6, 0x29, 0xc7, 0xf2, 0xb3, 0xab, 0xcf, 0xa2, 0xa2, 0xb4, 0x80, 0xf6, 0xee, 0x3e, 0x7e, 0x78, 0xfb, 0xe3, 0xac, 0xf8, 0x74, 0x07, 0xcd, 0xed, 0x21, 0x76, 0xbd, 0x7d, 0x2f, 0x05, 0x41, 0x1f, 0xc9, 0x54, 0x9a, 0x37, 0x3f, 0xfa, 0x94, 0xef, 0xfc, 0xfa, 0x21, 0xce, 0x9d, 0x77, 0x1c, 0xef, 0xad, 0xdc, 0x44, 0xa8, 0x2f, 0xca, 0xa4, 0xd1, 0x75, 0x8c, 0x1a, 0x5a, 0x41, 0x49, 0x61, 0x90, 0xcd, 0x3b, 0x9b, 0x79, 0x7f, 0xe5, 0x66, 0x12, 0xa9, 0xf4, 0xb3, 0xc0, 0x45, 0x80, 0x3c, 0x58, 0x35, 0xc6, 0x00, 0xdf, 0x06, 0x4e, 0x23, 0x6b, 0x33, 0xda, 0x81, 0x48, 0x61, 0x9e, 0x6f, 0xd2, 0x1d, 0x3f, 0xb9, 0x94, 0x93, 0xa6, 0x8f, 0xe3, 0xf2, 0x9b, 0xee, 0xa3, 0x37, 0x1c, 0xe5, 0xce, 0x9f, 0x5d, 0xce, 0x98, 0xe1, 0x55, 0xa4, 0xd2, 0x19, 0x46, 0xcc, 0xbb, 0x9e, 0x73, 0xe7, 0x4d, 0xe7, 0xa3, 0xd5, 0x5b, 0xf8, 0xc9, 0xb7, 0xce, 0xe4, 0x7b, 0x17, 0xcf, 0x67, 0xeb, 0xee, 0x56, 0xd6, 0x6d, 0xdd, 0x83, 0xcb, 0xa1, 0xb3, 0xfc, 0xd3, 0x1d, 0xdc, 0xf5, 0xf8, 0x1b, 0x28, 0x96, 0x05, 0xc0, 0x88, 0xb1, 0x63, 0xf9, 0xcb, 0x5f, 0xfe, 0x42, 0x55, 0x55, 0x15, 0x99, 0x4c, 0x86, 0x5d, 0xbb, 0x76, 0x71, 0xf3, 0xcd, 0x37, 0x33, 0x74, 0xe8, 0x50, 0x36, 0xaf, 0x5b, 0xc9, 0xe2, 0x47, 0x7e, 0x49, 0x7d, 0x55, 0xe9, 0x7f, 0x04, 0x70, 0xc6, 0x30, 0x49, 0xa5, 0x0d, 0xbc, 0x6e, 0x27, 0xaa, 0xaa, 0xb0, 0xb7, 0xb5, 0x9b, 0xde, 0xfe, 0x28, 0xdf, 0xfa, 0xf5, 0xa3, 0xf4, 0xc5, 0x32, 0xfc, 0xf2, 0x97, 0xbf, 0x64, 0xd6, 0xac, 0x59, 0x24, 0x93, 0x49, 0xde, 0x78, 0xe3, 0x0d, 0x5e, 0xb9, 0xf5, 0xf7, 0x6c, 0x8c, 0xc6, 0x88, 0x03, 0x42, 0xc0, 0x4d, 0xdf, 0x3a, 0x8b, 0x5f, 0x7f, 0xef, 0x3c, 0xce, 0xfb, 0xfe, 0x9f, 0x28, 0x2e, 0x08, 0x32, 0x6b, 0xca, 0x28, 0x6e, 0xfc, 0xe3, 0x13, 0x6c, 0x5f, 0x7c, 0x37, 0xd1, 0x78, 0x92, 0x1f, 0xdd, 0xfe, 0x38, 0x2f, 0xfc, 0x7b, 0x25, 0xdf, 0x38, 0xe3, 0x04, 0xce, 0x9d, 0x37, 0x9d, 0x75, 0x5b, 0xf7, 0x98, 0xb7, 0x3f, 0xf4, 0x92, 0x4c, 0xa5, 0x8d, 0x5f, 0x01, 0xfe, 0x1c, 0x7e, 0x4d, 0x64, 0xed, 0xee, 0x06, 0xb2, 0x44, 0x31, 0xe0, 0x24, 0x40, 0x76, 0xa5, 0x5f, 0x9f, 0xfb, 0xa8, 0x64, 0x5d, 0xe4, 0x60, 0x28, 0x1c, 0x7b, 0xe2, 0xda, 0xdf, 0x3e, 0x7c, 0xda, 0x90, 0x92, 0x7c, 0x11, 0x8e, 0xc4, 0xf1, 0xb8, 0x9d, 0xcc, 0xff, 0xe6, 0x2d, 0xfc, 0xe8, 0xca, 0xd3, 0x39, 0x65, 0xc6, 0x04, 0x00, 0x6e, 0xfc, 0xe6, 0x19, 0x4c, 0x1e, 0x53, 0xc7, 0x2b, 0xef, 0xac, 0xe2, 0x7b, 0x17, 0xcf, 0x67, 0x58, 0x4d, 0x19, 0xb5, 0x15, 0xc5, 0x38, 0x1c, 0x1a, 0x13, 0x46, 0xd6, 0x72, 0xff, 0x33, 0x6f, 0x51, 0x90, 0xb4, 0x08, 0x0b, 0xc1, 0x25, 0x97, 0x5c, 0x42, 0x24, 0x12, 0xe1, 0xae, 0xbb, 0xee, 0x22, 0x14, 0x0a, 0x61, 0x59, 0x16, 0x5d, 0x5d, 0x5d, 0x4c, 0x9e, 0x3c, 0x99, 0xc2, 0x7c, 0xff, 0x00, 0x15, 0x01, 0xa4, 0xd2, 0x19, 0x56, 0xac, 0xdf, 0x49, 0x38, 0x12, 0x27, 0x95, 0x31, 0xe8, 0x0d, 0xc7, 0x68, 0xe9, 0x08, 0x21, 0x84, 0xc0, 0xed, 0x72, 0x70, 0xc1, 0x82, 0x99, 0xd4, 0x57, 0x97, 0xf1, 0xfb, 0x07, 0x5f, 0xe0, 0xe9, 0xd7, 0x97, 0x52, 0x3d, 0xa4, 0x88, 0x9d, 0x4d, 0xed, 0xb4, 0x75, 0xf5, 0x51, 0x5b, 0x51, 0x4c, 0xd5, 0x90, 0x42, 0x52, 0x69, 0x83, 0xdf, 0xff, 0xe0, 0x42, 0x90, 0x50, 0x3f, 0x72, 0x1c, 0x99, 0x8c, 0x41, 0x55, 0x55, 0x15, 0x96, 0x65, 0xe1, 0x76, 0xbb, 0x99, 0x39, 0x73, 0x26, 0xfc, 0xfc, 0x17, 0xac, 0xfd, 0xd5, 0xaf, 0xb8, 0xe2, 0xf4, 0xe3, 0x39, 0x77, 0xde, 0x71, 0xe4, 0x07, 0x7d, 0x08, 0x21, 0x08, 0x85, 0x63, 0x8c, 0xa8, 0x2b, 0x67, 0xea, 0xb8, 0x61, 0x58, 0x96, 0xcd, 0x1d, 0x8f, 0xbc, 0xca, 0xb3, 0xff, 0xfa, 0x98, 0x44, 0x32, 0xcd, 0xb5, 0x17, 0xcd, 0xe3, 0x8d, 0x25, 0x6b, 0x79, 0xfa, 0xb5, 0xa5, 0x58, 0xb6, 0xfd, 0x29, 0xf0, 0x6b, 0xe0, 0x5f, 0x5f, 0xa4, 0x04, 0xda, 0xe7, 0x6c, 0xb7, 0x72, 0x7f, 0xf7, 0x03, 0x67, 0x24, 0xd3, 0x99, 0x0b, 0x7b, 0xc3, 0xb1, 0xa7, 0x9f, 0xff, 0xcb, 0x0f, 0x99, 0x35, 0x65, 0x14, 0xb7, 0x3c, 0xf0, 0x02, 0xb7, 0x3e, 0xf8, 0x22, 0x7f, 0x7c, 0xf8, 0x55, 0x46, 0x0f, 0xab, 0xe4, 0xd7, 0x77, 0x3f, 0xcf, 0x92, 0x55, 0x9b, 0xb9, 0xe3, 0x27, 0x97, 0x00, 0xa0, 0x6b, 0x2a, 0xba, 0xa6, 0x92, 0xca, 0x18, 0xdc, 0xfa, 0xd7, 0x17, 0x99, 0x39, 0xa9, 0x81, 0x65, 0x6b, 0xb6, 0x61, 0x2b, 0x59, 0x17, 0xea, 0xee, 0xbb, 0xef, 0x66, 0xce, 0x9c, 0x39, 0xe8, 0xba, 0x4e, 0x4f, 0x4f, 0x0f, 0x6e, 0xb7, 0x9b, 0x74, 0x3a, 0x8d, 0xdf, 0xe7, 0x45, 0xcb, 0xf9, 0xf9, 0x7b, 0x5a, 0xba, 0xf8, 0xcd, 0xbd, 0xcf, 0x33, 0x73, 0x52, 0x03, 0xe5, 0xa5, 0x05, 0x7c, 0xf8, 0xf1, 0x7a, 0x96, 0xac, 0xdc, 0x8c, 0x61, 0x59, 0xec, 0x6a, 0xea, 0xa0, 0x30, 0xcf, 0x47, 0x7d, 0x75, 0x29, 0x77, 0x3f, 0xf1, 0x2f, 0xee, 0x79, 0xf2, 0x4d, 0x00, 0x62, 0x89, 0x14, 0x97, 0x9e, 0x79, 0x22, 0x4e, 0x5d, 0x67, 0x68, 0x55, 0x09, 0x17, 0x9f, 0x7e, 0x02, 0x52, 0x4a, 0x92, 0xa9, 0x0c, 0x2f, 0xbf, 0xfb, 0x09, 0xc3, 0x87, 0x8f, 0x60, 0xcb, 0x96, 0x2d, 0x34, 0x37, 0x37, 0xf3, 0x8f, 0x7f, 0xfc, 0x83, 0x74, 0x3a, 0x4d, 0x7e, 0x7e, 0x3e, 0x33, 0x67, 0xce, 0x64, 0xc8, 0x90, 0x32, 0xbe, 0x71, 0xc6, 0x09, 0x4c, 0x18, 0x59, 0x4b, 0x61, 0x9e, 0x1f, 0x80, 0x3b, 0x6f, 0xba, 0x8c, 0xeb, 0x6e, 0x79, 0x84, 0x87, 0xff, 0xf1, 0x2e, 0x4e, 0x87, 0xce, 0xad, 0x7f, 0x7d, 0x91, 0x9a, 0xf2, 0x62, 0x5e, 0xb8, 0xe7, 0xc7, 0x54, 0x0f, 0x29, 0xe6, 0x82, 0x85, 0x33, 0x99, 0x7b, 0xd9, 0x6f, 0x4d, 0xcb, 0xb6, 0xcf, 0x22, 0xe7, 0x39, 0x7e, 0x91, 0xa8, 0x5f, 0x76, 0x40, 0x4e, 0xb6, 0xa7, 0x32, 0xc6, 0x05, 0x25, 0x85, 0xc1, 0xc2, 0x71, 0xc3, 0x6b, 0x28, 0xc8, 0xf3, 0xb3, 0x64, 0xd5, 0x66, 0x7a, 0xfb, 0x63, 0x14, 0x04, 0x7d, 0x1c, 0x37, 0x61, 0x38, 0x37, 0x5d, 0x7d, 0x26, 0x27, 0x4f, 0x1f, 0x8f, 0xdb, 0x75, 0x80, 0x6b, 0x3f, 0xdd, 0xba, 0x97, 0xc9, 0xa3, 0xeb, 0x88, 0xf4, 0x84, 0xd9, 0xbb, 0x6e, 0x3b, 0x3d, 0xa6, 0x49, 0x3c, 0x1e, 0xa7, 0xa4, 0xa4, 0x04, 0xcb, 0xb2, 0x58, 0xb8, 0x70, 0x21, 0x13, 0x27, 0x4e, 0x64, 0xfd, 0xfa, 0xf5, 0x94, 0x94, 0x94, 0x90, 0xe8, 0xef, 0xe6, 0x9c, 0x53, 0xa7, 0xe1, 0x75, 0x3b, 0xc9, 0x0f, 0x78, 0x39, 0xeb, 0xe4, 0x63, 0x39, 0x66, 0x6c, 0x3d, 0xcb, 0xd6, 0xed, 0x60, 0xcc, 0xb0, 0x2a, 0xae, 0xbf, 0x74, 0x01, 0x4b, 0xd7, 0x6c, 0xe3, 0xc7, 0x57, 0x9e, 0xc1, 0x23, 0xb7, 0x5e, 0xcb, 0xe8, 0xfa, 0x4a, 0x26, 0x8c, 0xac, 0x65, 0xca, 0xd8, 0x7a, 0x2e, 0x3d, 0xf3, 0x44, 0xc6, 0x8f, 0xa8, 0xe6, 0x9d, 0x65, 0x1b, 0x70, 0x39, 0x75, 0xce, 0x9d, 0x3f, 0x9d, 0x82, 0x9c, 0x86, 0x26, 0x52, 0x19, 0xd6, 0x6c, 0xde, 0x8d, 0xa7, 0xb8, 0x9e, 0x4d, 0x9b, 0x36, 0x65, 0x57, 0x86, 0xdb, 0x3d, 0x10, 0xfc, 0x3c, 0xfe, 0xf8, 0xe3, 0x6c, 0xd9, 0xba, 0x95, 0x79, 0xc7, 0x4f, 0x60, 0x54, 0x7d, 0xe5, 0xc0, 0xea, 0x72, 0xbb, 0x1c, 0x9c, 0x75, 0xf2, 0x34, 0x4e, 0x3f, 0x69, 0x0a, 0x1d, 0xdd, 0x61, 0xb6, 0xec, 0x6a, 0xb1, 0x35, 0x55, 0xc5, 0xe5, 0x74, 0x88, 0xfe, 0x68, 0x9c, 0x9f, 0xfe, 0xf1, 0x49, 0xba, 0x7a, 0x23, 0xf7, 0x01, 0xcf, 0x7d, 0x15, 0x10, 0x3f, 0x4f, 0xb3, 0x3f, 0x2b, 0x06, 0x30, 0xff, 0x4f, 0x8f, 0xbe, 0x76, 0xdb, 0xdf, 0x5f, 0xfe, 0x60, 0x7e, 0xa8, 0x2f, 0x1a, 0x15, 0x8a, 0xf2, 0xa0, 0x10, 0x62, 0xfe, 0xbc, 0xe3, 0x27, 0xce, 0xbc, 0x64, 0xd1, 0x89, 0x48, 0x69, 0x1f, 0x02, 0x34, 0xc0, 0x94, 0xb1, 0xf5, 0xfc, 0xfb, 0xe3, 0xf5, 0xdc, 0xf7, 0xcc, 0x5b, 0xe4, 0x09, 0xf0, 0xfb, 0xfc, 0x4c, 0x98, 0x30, 0x01, 0xdb, 0xb6, 0xb9, 0xf1, 0xc6, 0x1b, 0x01, 0x68, 0x6c, 0x6c, 0xc4, 0xe1, 0x70, 0x60, 0xdb, 0x36, 0x9a, 0xaa, 0x1c, 0x31, 0x82, 0xbd, 0xfc, 0xac, 0xd9, 0x48, 0xe0, 0x7f, 0x1f, 0x7a, 0x99, 0x17, 0xee, 0xfe, 0x31, 0xaa, 0xaa, 0x30, 0x6a, 0xc1, 0x0d, 0x54, 0x94, 0x14, 0x30, 0x6d, 0xc2, 0x30, 0x2c, 0x5b, 0xf2, 0xc3, 0xcb, 0x4f, 0xe3, 0x8c, 0x93, 0xa6, 0x70, 0xed, 0x45, 0xf3, 0x78, 0xf9, 0x9d, 0x4f, 0x38, 0xff, 0x86, 0x3f, 0x73, 0xee, 0xfc, 0xe3, 0xf8, 0xd9, 0xd5, 0x67, 0x91, 0xce, 0x18, 0xe8, 0xba, 0x4e, 0xc2, 0x30, 0x08, 0x04, 0x02, 0xcc, 0x9b, 0x37, 0x0f, 0x9f, 0xcf, 0xc7, 0xf2, 0xe5, 0xcb, 0xf9, 0xf0, 0xc3, 0x0f, 0x71, 0xbb, 0xdd, 0x98, 0x86, 0x41, 0x69, 0x61, 0xf0, 0x10, 0x1a, 0x83, 0x2c, 0xff, 0x17, 0xe6, 0xf9, 0x69, 0x6e, 0xef, 0x41, 0x51, 0x94, 0x5f, 0x85, 0xa3, 0x89, 0xc5, 0x77, 0x3c, 0xfa, 0xea, 0x0d, 0x40, 0xb9, 0x10, 0xe2, 0x39, 0xe0, 0x91, 0xaf, 0x88, 0xe1, 0x57, 0x06, 0x1b, 0xa0, 0x71, 0xe8, 0xd0, 0xa1, 0xe7, 0x37, 0x35, 0x35, 0x15, 0x22, 0x44, 0xcc, 0xb2, 0xac, 0xb4, 0xae, 0xeb, 0xaf, 0x3e, 0xfa, 0xc2, 0x7b, 0x2b, 0x4e, 0x9f, 0x73, 0x8c, 0x3b, 0xcb, 0x73, 0x87, 0x7f, 0x69, 0xd5, 0xc6, 0xdd, 0x8c, 0x1f, 0x3f, 0x9c, 0xe2, 0x82, 0x20, 0x51, 0xe9, 0xe3, 0x93, 0x4f, 0x3e, 0xe1, 0xce, 0x3b, 0xef, 0x04, 0xc0, 0xb2, 0x2c, 0xd2, 0xe9, 0x34, 0xd1, 0x68, 0x94, 0x68, 0x34, 0x8a, 0x65, 0x99, 0x47, 0x70, 0xf5, 0x44, 0xee, 0xa7, 0xe4, 0xa6, 0xab, 0xcf, 0x44, 0x4a, 0xc9, 0xc5, 0x37, 0xde, 0xcd, 0xc4, 0x91, 0xb5, 0xbc, 0x78, 0xef, 0x8d, 0x68, 0xaa, 0x42, 0x24, 0x9e, 0x24, 0x9d, 0x36, 0xf8, 0xdd, 0x7d, 0xff, 0xe4, 0xc6, 0x6f, 0x9e, 0xc1, 0x59, 0xa7, 0x1c, 0xcb, 0x99, 0xa7, 0x1c, 0x3b, 0xe0, 0xd7, 0x0a, 0x21, 0x88, 0xc4, 0x92, 0xc4, 0xed, 0x04, 0x05, 0x05, 0x05, 0xd4, 0xd7, 0x67, 0x5d, 0xc1, 0x71, 0xe3, 0xc6, 0x51, 0x53, 0x53, 0xc3, 0xd5, 0x57, 0x5f, 0xcd, 0x88, 0xba, 0x72, 0x2a, 0x4b, 0x0b, 0xd1, 0xb5, 0xec, 0x62, 0x4f, 0xa6, 0x32, 0x84, 0xc2, 0x31, 0x32, 0x86, 0xc9, 0xfb, 0x2b, 0x37, 0xb1, 0x72, 0xc3, 0xce, 0x15, 0x42, 0x28, 0x7f, 0xb4, 0x2c, 0x2b, 0x03, 0x5c, 0x02, 0x59, 0xf7, 0x73, 0x30, 0x72, 0xe4, 0x44, 0xc8, 0xe7, 0x48, 0x63, 0x63, 0x23, 0x96, 0x65, 0x85, 0x6c, 0xdb, 0x4e, 0x03, 0x9c, 0x75, 0xf6, 0xd9, 0x1b, 0x12, 0xa9, 0xcc, 0x9d, 0x7f, 0xfa, 0xdb, 0x6b, 0x48, 0x29, 0x89, 0xc6, 0x53, 0x87, 0x7d, 0xe7, 0x7b, 0x17, 0xcf, 0xe7, 0xf9, 0xbb, 0x7e, 0x48, 0x7b, 0x77, 0x2f, 0x4b, 0x97, 0x2e, 0x65, 0xf4, 0xe8, 0xd1, 0xd8, 0xb6, 0x8d, 0x94, 0x12, 0xcb, 0xb2, 0xb0, 0x6d, 0x9b, 0xfc, 0xfc, 0x7c, 0x74, 0x5d, 0xcf, 0x21, 0xa3, 0x70, 0xc0, 0xfd, 0x17, 0x24, 0xd3, 0x19, 0x52, 0xe9, 0xcc, 0xc0, 0xf9, 0xde, 0xf8, 0x60, 0x2d, 0xcf, 0xbc, 0xbe, 0x94, 0x2b, 0xcf, 0x99, 0x43, 0x2a, 0x6d, 0xd0, 0xdb, 0x1f, 0x63, 0xe3, 0xf6, 0x7d, 0x9c, 0x7c, 0xc5, 0xef, 0x78, 0xe8, 0xf9, 0x77, 0x58, 0xbd, 0xb1, 0x91, 0xbd, 0x6d, 0x21, 0x5a, 0x3b, 0x7a, 0x07, 0xc0, 0x50, 0x14, 0x41, 0x38, 0x96, 0x42, 0x11, 0x82, 0xfe, 0xfe, 0x7e, 0x3a, 0x3b, 0x3b, 0x69, 0x6d, 0x6d, 0x25, 0x99, 0x4c, 0xf2, 0xf8, 0xe3, 0x8f, 0x13, 0xee, 0xeb, 0xa3, 0xae, 0xbc, 0x08, 0xbf, 0xcf, 0x8d, 0x10, 0x02, 0xcb, 0xb2, 0x69, 0xeb, 0xea, 0x25, 0x9e, 0x4c, 0x11, 0x89, 0xc6, 0xf9, 0xdf, 0xff, 0x7b, 0x59, 0xaa, 0x8a, 0x7a, 0x9d, 0x6d, 0xdb, 0x19, 0xfe, 0x03, 0x19, 0x14, 0xd8, 0x9f, 0x95, 0xe7, 0x9f, 0x7b, 0x8e, 0xd2, 0xd2, 0xd2, 0x5b, 0xff, 0xfd, 0xf1, 0x86, 0x25, 0xef, 0xaf, 0xdc, 0x4c, 0x67, 0xa8, 0x9f, 0x44, 0xea, 0xd0, 0xf1, 0xe4, 0xf9, 0x3d, 0x14, 0xe6, 0xf9, 0xb9, 0xe3, 0xa7, 0x97, 0xe2, 0xd4, 0x55, 0x76, 0xee, 0xdc, 0x49, 0x7f, 0x7f, 0x3f, 0xa1, 0x50, 0x88, 0x48, 0x24, 0x82, 0x94, 0x92, 0x60, 0x30, 0x88, 0xa6, 0x69, 0x84, 0x23, 0xf1, 0xac, 0x8f, 0x94, 0xfb, 0x99, 0x4a, 0xa7, 0xf9, 0xdd, 0x7d, 0xff, 0xe0, 0x7f, 0xee, 0xff, 0xe7, 0xc0, 0xf9, 0x62, 0x89, 0xec, 0x0d, 0xbd, 0xf3, 0xb1, 0xd7, 0xf9, 0xfd, 0x83, 0x2f, 0x70, 0xc9, 0x4f, 0xee, 0x61, 0xd1, 0xb5, 0xff, 0xcb, 0xac, 0x29, 0xa3, 0xf9, 0xdd, 0xf5, 0xe7, 0x33, 0x7d, 0xe2, 0x70, 0xba, 0x43, 0x61, 0x4e, 0xb8, 0xf8, 0x66, 0x1e, 0x7d, 0xe1, 0x3d, 0x3a, 0x7b, 0xc2, 0x18, 0x86, 0x45, 0x24, 0x9e, 0x22, 0x91, 0x48, 0xd0, 0xd9, 0xd9, 0x49, 0x4f, 0x4f, 0x0f, 0xe1, 0x70, 0x98, 0x0f, 0x3e, 0xf8, 0x80, 0xd7, 0x5f, 0x7f, 0x1d, 0x27, 0xd9, 0x1c, 0x69, 0x61, 0x9e, 0x0f, 0x29, 0x21, 0xd4, 0x1f, 0xa3, 0x3f, 0x96, 0xc4, 0xb6, 0x25, 0xb7, 0x3c, 0xf8, 0x22, 0x6d, 0x5d, 0x7d, 0x8f, 0x8e, 0x1d, 0x37, 0x6e, 0xf5, 0x7f, 0x82, 0x15, 0x0c, 0x8e, 0x46, 0x8e, 0x28, 0x6d, 0x6d, 0x6d, 0x09, 0x9f, 0xcf, 0xf7, 0xa3, 0xff, 0xb9, 0xff, 0x9f, 0xcb, 0xca, 0x4b, 0xf2, 0x9d, 0x4e, 0x87, 0x4e, 0x5d, 0x45, 0x31, 0x9a, 0x76, 0xc0, 0xf6, 0x3a, 0x1d, 0x1a, 0x5b, 0x76, 0xb5, 0x10, 0x8d, 0x27, 0x59, 0xb5, 0x6a, 0x15, 0x1f, 0x7f, 0xfc, 0x31, 0x33, 0x66, 0xcc, 0x18, 0xd8, 0xaf, 0xeb, 0x3a, 0x85, 0x85, 0x85, 0xac, 0x8d, 0xc4, 0xb1, 0xcc, 0x6c, 0xb2, 0xf5, 0x8d, 0x25, 0x6b, 0x68, 0xee, 0xe8, 0xe5, 0xae, 0xc7, 0x5e, 0xe7, 0x8a, 0x73, 0xe6, 0x60, 0x98, 0x36, 0xba, 0xa6, 0x72, 0xc1, 0x82, 0x99, 0xd8, 0xb6, 0xe4, 0xc5, 0x7f, 0xaf, 0xa4, 0xbd, 0x3b, 0xcc, 0xa2, 0xb9, 0x53, 0xf9, 0xdb, 0x6d, 0xdf, 0xa5, 0x28, 0x3f, 0x40, 0x73, 0x47, 0x2f, 0x77, 0xfc, 0xed, 0x75, 0xee, 0x7f, 0x7a, 0x31, 0x2d, 0x1d, 0x21, 0x9e, 0x7a, 0x6d, 0x29, 0xab, 0x37, 0x35, 0xf2, 0xf3, 0x6f, 0x9f, 0x4d, 0x67, 0x77, 0x08, 0x2b, 0xb6, 0x8b, 0x2d, 0x5b, 0xb6, 0x60, 0x9a, 0x26, 0x1b, 0x37, 0x6e, 0xe4, 0x9e, 0x7b, 0xee, 0x61, 0x48, 0x71, 0x3e, 0xdf, 0xbf, 0x74, 0x01, 0xd7, 0x5d, 0xf2, 0x35, 0x34, 0x55, 0x25, 0x91, 0x4c, 0xd3, 0xd9, 0x13, 0x46, 0x4a, 0xc9, 0x9b, 0x1f, 0xae, 0xe3, 0xcd, 0x0f, 0xd7, 0xad, 0x03, 0xbe, 0xff, 0xe9, 0xa7, 0x9f, 0xfe, 0xa7, 0x50, 0xfd, 0xe7, 0x60, 0x03, 0x4c, 0x9f, 0x3e, 0x7d, 0xed, 0x3b, 0xef, 0xbc, 0x73, 0xcf, 0xcf, 0xfe, 0xf4, 0xd4, 0x8f, 0x9f, 0xfc, 0xe3, 0xf5, 0xb8, 0x9d, 0x3a, 0xe5, 0x25, 0x05, 0x03, 0x99, 0x43, 0x80, 0x15, 0x9f, 0xee, 0x60, 0xec, 0xf0, 0x2a, 0x74, 0x5d, 0xe3, 0xcf, 0x77, 0xde, 0xc9, 0x86, 0x0d, 0x1b, 0xb8, 0xf2, 0xca, 0x2b, 0xd1, 0x75, 0x9d, 0x58, 0x2c, 0x46, 0x3a, 0x9d, 0xa6, 0xb1, 0xa5, 0x93, 0x54, 0x26, 0xbb, 0x32, 0xc6, 0x0c, 0xaf, 0x66, 0xd9, 0xba, 0x1d, 0xa4, 0x32, 0x06, 0x0f, 0x3c, 0xf3, 0x6f, 0xde, 0x5a, 0xbe, 0x9d, 0x63, 0x26, 0x8c, 0x22, 0x19, 0x0b, 0x53, 0x10, 0xf0, 0x12, 0x08, 0xf8, 0x91, 0x12, 0xfb, 0x9d, 0x15, 0x5b, 0xc4, 0xdf, 0x5e, 0xfa, 0x50, 0x74, 0xf5, 0xc5, 0x19, 0x36, 0x62, 0x24, 0xa5, 0xa5, 0xa5, 0xb4, 0x74, 0x84, 0x50, 0x15, 0x85, 0xe7, 0xfe, 0xfc, 0x03, 0xf2, 0x03, 0x5e, 0x76, 0x37, 0x77, 0x52, 0x94, 0xe7, 0xe5, 0xd1, 0x17, 0xdf, 0x20, 0x1e, 0x8f, 0x73, 0xd1, 0x45, 0x17, 0x61, 0x65, 0x32, 0xcc, 0x96, 0x92, 0x4f, 0x0d, 0x93, 0x0b, 0x16, 0xce, 0xc4, 0xe3, 0x72, 0x62, 0x5a, 0x16, 0x6d, 0xdd, 0x7d, 0x64, 0x0c, 0x93, 0xa6, 0xd6, 0x6e, 0xee, 0xfc, 0xdb, 0xeb, 0xfb, 0x74, 0x5d, 0x9f, 0x61, 0x18, 0xc6, 0xe1, 0xfc, 0x78, 0x14, 0xf2, 0x5f, 0x01, 0xfb, 0xed, 0xb7, 0xdf, 0xc6, 0xef, 0xf7, 0xdf, 0xbe, 0xaf, 0xbd, 0xe7, 0xbc, 0x3f, 0x3f, 0xfe, 0x7a, 0xcd, 0xcd, 0xd7, 0x9c, 0x8b, 0xc3, 0xa1, 0x53, 0x9c, 0x1f, 0x18, 0x30, 0x9a, 0x0b, 0x67, 0x4f, 0xe6, 0x86, 0xcb, 0x16, 0xf2, 0xa3, 0xff, 0xfd, 0x3b, 0xa3, 0x4d, 0x93, 0xc5, 0x8b, 0x17, 0xd3, 0xb6, 0x74, 0x29, 0xc9, 0xc2, 0x42, 0xaa, 0xea, 0xeb, 0xe9, 0xe8, 0xe8, 0x40, 0x11, 0x62, 0x20, 0xb4, 0xaf, 0x29, 0x2f, 0xe6, 0xfc, 0x05, 0x33, 0xf8, 0xd3, 0xdf, 0x5e, 0x25, 0x9d, 0x31, 0xd1, 0x9d, 0x2e, 0xfe, 0x7c, 0xdf, 0xc3, 0x98, 0xa6, 0x49, 0x2c, 0x16, 0x23, 0x93, 0xc9, 0x20, 0x14, 0x45, 0xe9, 0xea, 0xec, 0x24, 0x1a, 0x8d, 0xa2, 0xaa, 0x2a, 0xa1, 0x50, 0x88, 0x5b, 0x6e, 0xb9, 0x05, 0x80, 0xca, 0xb2, 0x42, 0x0a, 0xf3, 0xfc, 0x74, 0xf5, 0xf6, 0x93, 0x48, 0xa6, 0xc9, 0xf3, 0x7b, 0x88, 0xc7, 0xe3, 0x04, 0x80, 0x58, 0x3a, 0x8d, 0x50, 0x14, 0xca, 0x17, 0x9d, 0xc8, 0x8f, 0x4f, 0x3b, 0x9e, 0x9a, 0xf2, 0x62, 0xa4, 0x94, 0x74, 0xf7, 0x46, 0x89, 0xc4, 0x92, 0xf4, 0xf4, 0x45, 0xb8, 0xf6, 0x77, 0x0f, 0x27, 0xe2, 0xa9, 0xcc, 0x05, 0xff, 0x2d, 0xa0, 0xe1, 0xbf, 0x04, 0x36, 0x40, 0x34, 0x1a, 0x0d, 0x09, 0x21, 0xce, 0x7f, 0xed, 0xbd, 0xd5, 0x1f, 0x4f, 0x1c, 0x55, 0xa7, 0x2e, 0x3a, 0x69, 0x0a, 0x9a, 0xa6, 0x92, 0xef, 0xf7, 0x22, 0x04, 0x9c, 0x75, 0xf2, 0xb1, 0xb4, 0x75, 0xf5, 0xb1, 0x71, 0xdd, 0x76, 0xba, 0x72, 0x09, 0x93, 0x7b, 0x62, 0x31, 0x96, 0xc4, 0x62, 0x3c, 0xdc, 0xd4, 0x44, 0x87, 0xae, 0x33, 0x72, 0x68, 0x39, 0x8e, 0x1c, 0xfd, 0x08, 0x01, 0xc5, 0xf9, 0x01, 0x66, 0x4d, 0x19, 0xcd, 0xdb, 0xcb, 0x36, 0xb0, 0x7d, 0xfb, 0x76, 0x96, 0x2f, 0x5f, 0xce, 0xc8, 0x91, 0x23, 0x79, 0xe5, 0x95, 0x57, 0xf8, 0xe8, 0xa3, 0x8f, 0x58, 0xb5, 0x6a, 0x15, 0x7d, 0x7d, 0x7d, 0x47, 0x1c, 0xcf, 0x94, 0xb1, 0xf5, 0x74, 0xf7, 0x45, 0xe8, 0xe8, 0x09, 0x23, 0xc9, 0xe6, 0x67, 0x3c, 0xc0, 0x22, 0xb2, 0x95, 0xa2, 0xa7, 0xc8, 0x6e, 0x3c, 0x71, 0xea, 0x28, 0x00, 0xfa, 0xa3, 0x09, 0xba, 0x42, 0x61, 0x4c, 0xd3, 0xe2, 0x96, 0x07, 0x5e, 0xb0, 0x7a, 0xfa, 0xa2, 0x57, 0x5a, 0x96, 0xb5, 0xfc, 0xbf, 0x85, 0x0f, 0xfc, 0x17, 0xc1, 0x06, 0x50, 0x14, 0x25, 0x64, 0x5a, 0x96, 0x79, 0xfb, 0x43, 0x2f, 0xa9, 0x95, 0x65, 0x85, 0x08, 0x21, 0x10, 0x64, 0x8d, 0xa4, 0xa2, 0x28, 0xbc, 0xb5, 0x74, 0x3d, 0x17, 0x9e, 0x37, 0x97, 0xa9, 0xe3, 0x87, 0x73, 0xc3, 0xef, 0x1f, 0xe5, 0xf5, 0x70, 0x8c, 0xd7, 0xa5, 0x24, 0x06, 0x18, 0x86, 0xc1, 0xa8, 0xfa, 0x8a, 0x43, 0xfc, 0xdc, 0x60, 0xc0, 0xc3, 0x69, 0x73, 0x8e, 0xe1, 0xed, 0x65, 0x1b, 0x00, 0xf8, 0xf6, 0xb7, 0xbf, 0x4d, 0x34, 0x1a, 0xc5, 0x30, 0x8c, 0x2f, 0x1d, 0xcb, 0xa9, 0xc7, 0x4f, 0x60, 0x5f, 0x7b, 0x0f, 0xdd, 0xa1, 0x7e, 0x96, 0xae, 0xd9, 0xc6, 0x2b, 0x4f, 0xbf, 0xc5, 0x3d, 0xc0, 0x8f, 0x80, 0xa8, 0xa2, 0xf0, 0xf2, 0x7d, 0x3f, 0xa1, 0xbe, 0xba, 0x0c, 0x87, 0x43, 0x27, 0x9e, 0x4c, 0xd3, 0xd2, 0x19, 0xc2, 0xb4, 0x2c, 0x9e, 0x5f, 0xbc, 0x8c, 0xe5, 0x9f, 0xee, 0xfc, 0xbf, 0x47, 0x1f, 0x79, 0xe4, 0xb9, 0xcb, 0x2e, 0xbf, 0xfc, 0xbf, 0x09, 0xcf, 0x57, 0x8e, 0x20, 0x07, 0xe4, 0xa6, 0x9f, 0xfe, 0x94, 0xe5, 0x2b, 0x56, 0xf8, 0xdd, 0x6e, 0x77, 0x81, 0x69, 0x9a, 0x15, 0x42, 0x88, 0x51, 0x42, 0x88, 0xe3, 0x84, 0x10, 0x57, 0x49, 0x29, 0xef, 0x04, 0xf2, 0x4c, 0xd3, 0xe2, 0x83, 0x55, 0x9b, 0x99, 0x38, 0xb2, 0x16, 0x8f, 0xdb, 0x89, 0xa6, 0xaa, 0xb8, 0x5c, 0x0e, 0x26, 0x8c, 0xac, 0xe1, 0xd4, 0x99, 0x13, 0x70, 0xbb, 0x9c, 0x3c, 0xf8, 0xec, 0xdb, 0x7c, 0x6c, 0x5a, 0x24, 0x84, 0x40, 0x91, 0x92, 0xb4, 0x10, 0xf4, 0x45, 0xe2, 0x7c, 0xf3, 0xbc, 0x93, 0x71, 0x39, 0x74, 0x4c, 0xcb, 0xc6, 0xa1, 0xeb, 0x14, 0xe4, 0xf9, 0x78, 0xf5, 0xdd, 0xd5, 0xf4, 0xc7, 0x12, 0x24, 0x93, 0x49, 0x6c, 0xdb, 0xfe, 0xd2, 0x31, 0x3a, 0x74, 0x8d, 0x5b, 0xbe, 0x7f, 0x01, 0xbf, 0x7f, 0xf0, 0x45, 0x7e, 0x79, 0xd7, 0xb3, 0xc4, 0xd7, 0x6e, 0xa7, 0x5c, 0x75, 0xf0, 0x9e, 0x65, 0x12, 0x2e, 0xa9, 0x24, 0xaf, 0xac, 0x06, 0xd5, 0x8c, 0x71, 0xc1, 0x82, 0x99, 0x58, 0x96, 0x4d, 0x53, 0x6b, 0x37, 0xa9, 0xb4, 0x21, 0x9b, 0xdb, 0x43, 0xe2, 0x97, 0x77, 0x3d, 0x9b, 0x36, 0x2d, 0xfb, 0xac, 0xf6, 0x8e, 0x8e, 0x58, 0x6b, 0x4b, 0x4b, 0x1d, 0xd9, 0x8a, 0xdd, 0x19, 0x42, 0x88, 0x99, 0x42, 0x88, 0xd9, 0xc0, 0x19, 0xc0, 0xc9, 0x0d, 0x0d, 0x0d, 0x4b, 0x42, 0xa1, 0xd0, 0x97, 0x0f, 0xe6, 0x3f, 0x01, 0x7b, 0xd9, 0xf2, 0xe5, 0xc3, 0x6d, 0xdb, 0xde, 0x6c, 0x18, 0xc6, 0x4f, 0x81, 0xeb, 0x80, 0xab, 0xdc, 0x4e, 0xfd, 0xbc, 0x09, 0x23, 0xaa, 0xa6, 0x8f, 0xaa, 0x1b, 0xe2, 0xf3, 0xb8, 0x1c, 0xa4, 0x32, 0x06, 0x91, 0x58, 0x92, 0xe5, 0xeb, 0x77, 0x30, 0x63, 0x52, 0x03, 0xaa, 0xa2, 0x60, 0xdb, 0x12, 0xaf, 0xdb, 0x85, 0xae, 0xa9, 0xbc, 0xb7, 0x62, 0x13, 0x4f, 0xbf, 0xf1, 0x31, 0x73, 0xae, 0xb8, 0x99, 0xa2, 0x61, 0xe3, 0x51, 0x02, 0x85, 0x94, 0xd6, 0x8d, 0x61, 0xf7, 0x96, 0x75, 0x58, 0x52, 0xa2, 0xaa, 0x0a, 0x1b, 0xb7, 0xef, 0xa3, 0x61, 0x68, 0x39, 0x9a, 0xaa, 0xd2, 0x19, 0xea, 0x67, 0xe5, 0xfa, 0x9d, 0x5f, 0x79, 0x8c, 0xe7, 0xce, 0x9f, 0xce, 0xa2, 0xb9, 0x53, 0x89, 0x27, 0xd2, 0x2c, 0xfe, 0xe8, 0x53, 0x3a, 0x80, 0x7e, 0x8f, 0x0f, 0x75, 0xdc, 0x0c, 0x46, 0x1e, 0x37, 0x9f, 0x63, 0xcf, 0xb8, 0x8a, 0x77, 0xdf, 0x7d, 0x9f, 0x7d, 0x7b, 0x76, 0x50, 0x5a, 0x18, 0xc4, 0xb4, 0x6c, 0x24, 0x88, 0x3f, 0x3c, 0xfc, 0x32, 0x5b, 0x1b, 0x5b, 0xe3, 0x42, 0x88, 0xde, 0xe6, 0xe6, 0xe6, 0xbf, 0x06, 0xbc, 0xae, 0x5b, 0x66, 0x8c, 0xaf, 0x5f, 0x30, 0x71, 0x44, 0xd5, 0x09, 0xe5, 0xc5, 0x79, 0x73, 0x9a, 0xda, 0x43, 0x73, 0xa4, 0x64, 0x3a, 0x30, 0x23, 0x12, 0x89, 0x3c, 0x61, 0xdb, 0xf6, 0x11, 0xea, 0xc5, 0x9f, 0x2f, 0x47, 0x43, 0x23, 0xc2, 0xa9, 0x6b, 0xc1, 0xaa, 0xb2, 0x02, 0x65, 0x57, 0x73, 0x17, 0x95, 0x25, 0xf9, 0x9c, 0x3d, 0x77, 0x32, 0x45, 0x79, 0x3e, 0x54, 0x55, 0xc1, 0xb2, 0x2c, 0x12, 0x29, 0x83, 0x2d, 0x8d, 0x6d, 0xbc, 0xb3, 0x72, 0x2b, 0xdf, 0xf9, 0xcd, 0xff, 0xf1, 0xd0, 0xff, 0x7c, 0x1b, 0x5b, 0xda, 0x24, 0x92, 0x69, 0x8a, 0xf2, 0xfd, 0x3c, 0xf3, 0xc6, 0xc7, 0xcc, 0xba, 0xe0, 0x87, 0x8c, 0x9b, 0x7d, 0x16, 0x9a, 0xee, 0x20, 0x11, 0xe9, 0x25, 0x11, 0xe9, 0xc3, 0xe9, 0xf5, 0xf3, 0xcc, 0x07, 0x6b, 0xf9, 0xf3, 0xdf, 0x5e, 0xa3, 0xac, 0x38, 0x8f, 0xd9, 0xd3, 0xc6, 0x90, 0xe7, 0xf7, 0x72, 0xde, 0xfc, 0xe9, 0xdc, 0xff, 0xf4, 0x5b, 0x18, 0xa6, 0xf5, 0xe5, 0xa3, 0x03, 0x2e, 0x3a, 0xed, 0x78, 0x12, 0xa9, 0x34, 0x9f, 0x6c, 0xdc, 0x45, 0x81, 0x10, 0x24, 0x85, 0x42, 0xf9, 0xe4, 0xd9, 0x94, 0x37, 0x1c, 0xc3, 0x84, 0xb9, 0xe7, 0x21, 0x2d, 0x8b, 0xb9, 0x57, 0xdc, 0xcc, 0x86, 0x4f, 0xde, 0xe1, 0xa5, 0x9f, 0xfd, 0x9d, 0x52, 0xb7, 0x81, 0xcf, 0xe3, 0xe2, 0xa3, 0xd5, 0x5b, 0x91, 0x52, 0x06, 0xa5, 0xb4, 0xff, 0x74, 0xc2, 0xa4, 0x61, 0xcc, 0x3d, 0x76, 0x14, 0x3e, 0x8f, 0x13, 0x45, 0x28, 0x44, 0x13, 0x29, 0x5a, 0xba, 0xfa, 0xa8, 0x2a, 0x2d, 0xe0, 0x83, 0x35, 0xdb, 0x85, 0x94, 0x72, 0xd0, 0x31, 0xca, 0xa0, 0x35, 0x5b, 0x55, 0x55, 0x6f, 0x75, 0x59, 0xfe, 0xf7, 0xe7, 0xcf, 0x18, 0xab, 0xac, 0xd9, 0xd2, 0xc4, 0x99, 0x27, 0x4d, 0x62, 0x78, 0x55, 0x09, 0x1e, 0x97, 0x03, 0x87, 0xa6, 0xe2, 0xcc, 0x55, 0x3b, 0xfc, 0x5e, 0x37, 0x7e, 0xaf, 0x8b, 0xb5, 0x5b, 0x9b, 0x58, 0xb9, 0x7e, 0x27, 0xd3, 0xc6, 0x0f, 0x47, 0x28, 0x82, 0x1b, 0x6e, 0x7d, 0x8c, 0x6d, 0xd1, 0x00, 0x27, 0x5e, 0xf8, 0x03, 0x5c, 0xbe, 0x00, 0x8a, 0xaa, 0xe1, 0x74, 0xfb, 0xf0, 0xe5, 0x15, 0x33, 0x74, 0xe2, 0x09, 0x74, 0xee, 0xd9, 0x8a, 0x91, 0x4e, 0xd0, 0xdb, 0xdd, 0xc9, 0xc2, 0x13, 0x27, 0xdb, 0xd5, 0xe5, 0xc5, 0x22, 0x3f, 0xe0, 0x63, 0xfd, 0xf6, 0x26, 0x76, 0xec, 0x6d, 0xff, 0xd2, 0xf1, 0xd5, 0x94, 0x17, 0xf3, 0x87, 0x1b, 0x2f, 0xa1, 0xa7, 0x2f, 0xca, 0x3d, 0x4f, 0xfc, 0x8b, 0x06, 0xe9, 0x64, 0xd2, 0x35, 0xb7, 0x32, 0x6a, 0xf6, 0xd9, 0x54, 0x8f, 0x99, 0x86, 0xa2, 0x6a, 0xd9, 0x6b, 0x7a, 0xfc, 0xf8, 0xf2, 0x4b, 0xa8, 0x1e, 0x77, 0x3c, 0xee, 0x8a, 0x71, 0x2c, 0xff, 0xf0, 0x3d, 0x12, 0xd1, 0xac, 0xb1, 0x5d, 0x74, 0xe2, 0x44, 0xe6, 0xcf, 0x18, 0x8b, 0xcb, 0xa9, 0xa3, 0x08, 0x91, 0xf5, 0xa8, 0x04, 0x6c, 0xd9, 0xdd, 0x46, 0x43, 0x6d, 0x19, 0xeb, 0xb6, 0xed, 0xc3, 0xe1, 0x70, 0xfc, 0xc9, 0x34, 0xcd, 0xfe, 0xc1, 0x60, 0x37, 0xe8, 0xbb, 0x23, 0xa5, 0x74, 0xaa, 0xaa, 0x22, 0x34, 0x4d, 0xc5, 0xeb, 0x76, 0x32, 0x7a, 0xe8, 0x90, 0x81, 0x7c, 0xc2, 0xc0, 0x49, 0x15, 0x81, 0xd7, 0xed, 0xa0, 0xae, 0xbc, 0x08, 0x4d, 0x55, 0xd9, 0xdb, 0xd2, 0xc5, 0xd5, 0xbf, 0xfa, 0x2b, 0x97, 0xff, 0xfc, 0x01, 0xa2, 0xa5, 0xc7, 0xb3, 0xe0, 0x9a, 0xdb, 0x70, 0xf9, 0xf3, 0x18, 0x70, 0x13, 0x84, 0x00, 0x21, 0x10, 0xaa, 0xc6, 0xa9, 0xdf, 0xfc, 0x35, 0xe7, 0xfd, 0xfc, 0x61, 0x6c, 0x5b, 0xf2, 0xe8, 0x8b, 0xef, 0x93, 0x4c, 0x67, 0xf0, 0x79, 0x5d, 0xdc, 0x78, 0xd5, 0xa2, 0xcf, 0x2d, 0x91, 0x09, 0x40, 0xcd, 0xed, 0xfb, 0xd1, 0x95, 0x67, 0x60, 0x4b, 0x9b, 0xc6, 0xe6, 0x4e, 0xf6, 0xec, 0x69, 0x63, 0xe7, 0x90, 0x5a, 0x4a, 0xc7, 0x1e, 0x47, 0xa0, 0xa8, 0x1c, 0x45, 0x39, 0x30, 0x4e, 0x21, 0x04, 0x9a, 0xc3, 0x89, 0xa2, 0xaa, 0xec, 0x5a, 0xbb, 0x84, 0xbe, 0x8e, 0x26, 0x00, 0xca, 0x8b, 0xf3, 0x98, 0x3e, 0xa1, 0xfe, 0xb0, 0x92, 0x9b, 0x22, 0x04, 0x01, 0x9f, 0x9b, 0xbe, 0x48, 0x02, 0x97, 0x43, 0x97, 0x2e, 0x97, 0xcb, 0x64, 0x90, 0x72, 0x34, 0x60, 0x4b, 0x5d, 0x53, 0x31, 0x0c, 0x93, 0xa2, 0x3c, 0x1f, 0x4e, 0xfd, 0x70, 0x26, 0x92, 0x64, 0x5b, 0x20, 0x54, 0x55, 0xc1, 0xeb, 0x76, 0x64, 0xbb, 0x5e, 0x22, 0x09, 0xf2, 0x1b, 0xe6, 0x30, 0x6e, 0xce, 0x39, 0x59, 0xa0, 0x11, 0x03, 0x20, 0x1f, 0x32, 0x20, 0x4d, 0xa7, 0x71, 0xdd, 0x07, 0x48, 0x29, 0x79, 0xf2, 0xd5, 0x0f, 0x95, 0x8f, 0x56, 0x6f, 0x05, 0x09, 0x33, 0x27, 0x35, 0xb0, 0x68, 0xee, 0xd4, 0x43, 0x8e, 0xad, 0xf0, 0xf9, 0x70, 0xaa, 0x2a, 0x0f, 0xcc, 0x99, 0xc3, 0xfd, 0xb3, 0x67, 0xf3, 0xb5, 0x31, 0x0d, 0x5c, 0x7e, 0xd6, 0x6c, 0xa2, 0xf1, 0x14, 0xef, 0x2c, 0xdf, 0x48, 0xf1, 0xb0, 0xf1, 0xcc, 0xbd, 0xf2, 0x97, 0xb8, 0xbd, 0x81, 0xc3, 0xc6, 0x98, 0x49, 0xc6, 0x49, 0x46, 0x42, 0x58, 0x99, 0x14, 0xcd, 0x5b, 0x3f, 0x19, 0xd8, 0x3e, 0x71, 0x44, 0xd5, 0x80, 0xfb, 0xf9, 0x99, 0x79, 0xe3, 0x73, 0x3b, 0xf1, 0xb8, 0x1c, 0xd8, 0xd2, 0x26, 0x1a, 0x8d, 0x1e, 0xf9, 0xce, 0x7f, 0x81, 0x0c, 0x1a, 0x6c, 0xdb, 0xb6, 0x93, 0x19, 0xc3, 0xc2, 0xb4, 0x0f, 0x4f, 0xa9, 0x0e, 0x0c, 0xcc, 0x96, 0xa4, 0xd2, 0x59, 0xf7, 0x4c, 0xd7, 0x54, 0x84, 0x10, 0x9c, 0xf4, 0x8d, 0x9f, 0x32, 0xe6, 0xa4, 0xf3, 0x48, 0x27, 0xa2, 0x98, 0x46, 0xfa, 0x40, 0x61, 0xf2, 0x08, 0x12, 0x0f, 0x87, 0xa8, 0x1d, 0x3f, 0x83, 0x60, 0x49, 0x0d, 0x37, 0xdc, 0xf6, 0x18, 0x3d, 0xe1, 0x08, 0x8a, 0xaa, 0x70, 0xff, 0x6f, 0xbe, 0xc5, 0xfe, 0x82, 0xf4, 0xd7, 0x87, 0x0f, 0xe7, 0xbb, 0xe3, 0xc6, 0x71, 0x5a, 0x6d, 0x2d, 0x35, 0x7e, 0x3f, 0xa1, 0x74, 0x9a, 0x99, 0xa7, 0x1c, 0x83, 0xd3, 0xa1, 0xd1, 0x1f, 0x8d, 0xf3, 0xd2, 0xdb, 0x2b, 0x19, 0x3a, 0xf5, 0x64, 0xbc, 0x79, 0xc5, 0x28, 0x9a, 0x7e, 0xc8, 0xf9, 0x33, 0xc9, 0x38, 0xb1, 0x70, 0x37, 0x52, 0x42, 0xd7, 0xbe, 0x1d, 0xf4, 0xb6, 0xed, 0x01, 0xb2, 0xf7, 0x7d, 0x44, 0x6d, 0xe9, 0x61, 0x5a, 0x0d, 0x60, 0x4b, 0x89, 0x43, 0xd7, 0x90, 0x48, 0x4c, 0xd3, 0xb6, 0x35, 0x5d, 0x4b, 0x0c, 0x16, 0xbb, 0x41, 0x83, 0xed, 0xf5, 0xf9, 0xfa, 0x34, 0x55, 0xc9, 0x36, 0x9c, 0x78, 0x5d, 0x47, 0x3c, 0xc6, 0x30, 0xad, 0x01, 0x63, 0x96, 0x48, 0x65, 0xf0, 0x17, 0x0e, 0xa1, 0x72, 0xcc, 0xb1, 0x03, 0xfb, 0xe3, 0x7d, 0xdd, 0x98, 0xf1, 0x08, 0xd2, 0xb6, 0x91, 0xb6, 0x8d, 0x99, 0x49, 0x63, 0x19, 0x07, 0x12, 0x58, 0xb3, 0x2e, 0xfc, 0x01, 0x5f, 0xff, 0xf9, 0x23, 0xd4, 0x8c, 0x9f, 0x81, 0x19, 0x1c, 0xc6, 0x2f, 0xef, 0x7a, 0x96, 0x44, 0x32, 0x4d, 0x59, 0x51, 0x1e, 0x4f, 0xfc, 0xf1, 0x7a, 0xaa, 0x82, 0x01, 0xbe, 0x35, 0x66, 0x0c, 0xba, 0xa2, 0xf0, 0xb5, 0x9a, 0x1a, 0x22, 0x99, 0x0c, 0x2b, 0x13, 0x61, 0xbe, 0x7b, 0xf1, 0x3c, 0x7a, 0xfb, 0x63, 0xbc, 0xb7, 0x72, 0x33, 0x6a, 0xf1, 0x08, 0xfc, 0x85, 0x65, 0x38, 0xdc, 0xbe, 0x43, 0xc7, 0x96, 0x4e, 0x12, 0xeb, 0xeb, 0xc2, 0x4c, 0x67, 0x03, 0xc3, 0x15, 0x2f, 0x3f, 0x34, 0xb0, 0x2f, 0xe8, 0xf3, 0x90, 0x9f, 0xab, 0x90, 0x7f, 0x56, 0x04, 0x02, 0xaf, 0xdb, 0x49, 0x3c, 0x99, 0x41, 0x82, 0x69, 0x64, 0x8c, 0x41, 0x83, 0x3d, 0x68, 0x03, 0x39, 0x66, 0xf4, 0x68, 0x33, 0x1e, 0x0d, 0x7f, 0x73, 0x44, 0x4d, 0x59, 0x7e, 0x34, 0x91, 0x62, 0x44, 0xcd, 0xa1, 0xc5, 0x59, 0x29, 0x25, 0xf1, 0x54, 0x86, 0x54, 0xc6, 0xa4, 0x2f, 0x92, 0x60, 0xd5, 0xe6, 0x3d, 0x64, 0x92, 0x31, 0xe2, 0xfd, 0xbd, 0xa8, 0xaa, 0x86, 0xee, 0xf2, 0x20, 0x84, 0x20, 0x95, 0x4e, 0x60, 0xa6, 0x93, 0xa4, 0xe2, 0x11, 0x12, 0xe1, 0x1e, 0x8c, 0x4c, 0x1a, 0x97, 0xd7, 0x3f, 0xa0, 0x55, 0x8a, 0xaa, 0x52, 0x5c, 0x3d, 0x82, 0x9a, 0xb1, 0xd3, 0x58, 0xb7, 0x65, 0x2f, 0xbd, 0xcd, 0xdb, 0x39, 0x7e, 0x72, 0x03, 0xc3, 0xaa, 0xcb, 0x28, 0x29, 0x2b, 0x60, 0xf1, 0x87, 0xeb, 0x98, 0x5a, 0x52, 0x8a, 0xd7, 0xe1, 0xe0, 0xd9, 0xbd, 0xbb, 0xf9, 0xe6, 0xf7, 0xce, 0xa2, 0xb6, 0xa2, 0x98, 0xc6, 0xe6, 0x2e, 0x7e, 0xfb, 0xd8, 0x47, 0xcc, 0xbc, 0xe8, 0x67, 0x94, 0xd4, 0x8c, 0xc0, 0xed, 0xcf, 0x1b, 0x38, 0xa7, 0xb4, 0x2d, 0xc2, 0x5d, 0x2d, 0x18, 0xa9, 0x2c, 0x4e, 0xdb, 0x57, 0xbe, 0xc5, 0xae, 0xd5, 0xef, 0x0e, 0x8c, 0xbd, 0x30, 0xcf, 0xc7, 0xb1, 0x63, 0xeb, 0x0e, 0x2b, 0x20, 0x00, 0xd8, 0xb6, 0x24, 0x12, 0x4f, 0x12, 0x4b, 0xa4, 0x69, 0xed, 0xea, 0x4f, 0x59, 0xb6, 0x7d, 0x87, 0x94, 0x72, 0x50, 0xbc, 0x3d, 0x68, 0xb0, 0x2d, 0xcb, 0x52, 0x7a, 0x7a, 0xc3, 0x3f, 0x6f, 0xa8, 0x29, 0xf3, 0x26, 0x92, 0x19, 0x86, 0x57, 0x97, 0x1c, 0xb2, 0xdf, 0xb4, 0x6c, 0x22, 0xf1, 0x14, 0xb6, 0x2d, 0xd9, 0xbc, 0xbb, 0x8d, 0xa6, 0xf6, 0x10, 0x00, 0xa1, 0xd6, 0xdd, 0xec, 0x5e, 0xf7, 0x01, 0xe9, 0x44, 0x94, 0xea, 0x31, 0xd3, 0x90, 0xb6, 0x4d, 0x26, 0x15, 0xc3, 0x36, 0x4d, 0xa4, 0x6d, 0xe3, 0xf6, 0x05, 0x70, 0xba, 0x7d, 0x87, 0x70, 0xb8, 0xcb, 0xe3, 0x47, 0x77, 0x79, 0x29, 0xa8, 0xa8, 0x67, 0xc5, 0xa6, 0x26, 0x62, 0x9d, 0xbb, 0x99, 0x3a, 0xb6, 0x8e, 0x09, 0x23, 0x6b, 0xc8, 0xaf, 0x2f, 0xe3, 0x91, 0xf5, 0x1b, 0x79, 0xaf, 0xab, 0x9d, 0x9f, 0xfd, 0xe4, 0x62, 0x66, 0x4c, 0x6e, 0xa0, 0xb5, 0xb3, 0x8f, 0xbf, 0x3e, 0xff, 0x0e, 0xa2, 0xe1, 0x74, 0x82, 0x25, 0x15, 0xf8, 0x0b, 0x87, 0xa0, 0xa8, 0x59, 0xe0, 0x6c, 0xd3, 0x20, 0xde, 0x1f, 0x22, 0x93, 0x8a, 0x23, 0x6d, 0x9b, 0x64, 0xa4, 0x8f, 0x37, 0xff, 0xfa, 0x8b, 0x43, 0xc6, 0x2e, 0x84, 0xe0, 0x84, 0x49, 0xc3, 0x0f, 0x33, 0xf8, 0x00, 0x12, 0x49, 0x24, 0x9e, 0xa2, 0xbd, 0x3b, 0x8c, 0xc7, 0xed, 0x50, 0x92, 0x06, 0xf7, 0xa5, 0x52, 0xa9, 0xf8, 0x60, 0xb0, 0x1b, 0x34, 0x8d, 0xa4, 0xd3, 0x69, 0xb7, 0x94, 0x04, 0x4d, 0xcb, 0x26, 0xef, 0x33, 0x4b, 0x4e, 0x4a, 0x49, 0x32, 0x6d, 0x60, 0x9a, 0x16, 0x52, 0x4a, 0x36, 0xef, 0x6e, 0x3d, 0xec, 0xfb, 0xbb, 0xd7, 0xbe, 0xcf, 0x9a, 0xc5, 0x4f, 0x60, 0x9b, 0x06, 0x1b, 0x97, 0xbc, 0xc4, 0xb2, 0x17, 0xee, 0x43, 0x73, 0xba, 0xf0, 0x04, 0x0b, 0x0f, 0x33, 0x96, 0x08, 0x81, 0xee, 0x70, 0x91, 0x57, 0x52, 0xc9, 0xd8, 0x39, 0xe7, 0xf0, 0xd4, 0xea, 0x18, 0xaf, 0x7d, 0xb8, 0x01, 0xc3, 0x30, 0xa9, 0x29, 0x0c, 0xf2, 0xf3, 0x4b, 0x16, 0x30, 0x6b, 0xe2, 0x08, 0xa6, 0x0f, 0xaf, 0x66, 0xf7, 0xde, 0x0e, 0xb6, 0xec, 0x6e, 0x61, 0x55, 0x97, 0x8f, 0xd2, 0xba, 0xd1, 0xf8, 0x0b, 0x4a, 0x51, 0x73, 0x5c, 0x6d, 0x19, 0x19, 0xfa, 0x3a, 0xf6, 0x11, 0x0f, 0xf7, 0x60, 0xe7, 0x52, 0xb8, 0x1b, 0x96, 0xbc, 0x70, 0xd8, 0xd8, 0x62, 0xf1, 0x14, 0xf1, 0xd4, 0xe7, 0xd5, 0x07, 0x04, 0xaa, 0x22, 0xc8, 0x64, 0xe9, 0x51, 0x8b, 0xc5, 0x62, 0xa3, 0x06, 0x8b, 0xdd, 0xa0, 0x83, 0x9a, 0x54, 0x2a, 0x15, 0x74, 0x39, 0x34, 0x5d, 0x11, 0xe0, 0x72, 0x7c, 0xa6, 0x5e, 0x67, 0x5a, 0xc4, 0x93, 0x69, 0x24, 0xb0, 0x75, 0x4f, 0x07, 0x3d, 0xe1, 0xd8, 0x61, 0xdf, 0xb7, 0x2d, 0x8b, 0x0d, 0xef, 0xfd, 0x93, 0xa6, 0x8d, 0xcb, 0xc9, 0xa4, 0xe2, 0x4c, 0x5f, 0xf4, 0x2d, 0xdc, 0xde, 0xe0, 0x21, 0x6e, 0xd9, 0x21, 0x22, 0x04, 0xaa, 0xee, 0xc0, 0x5f, 0x50, 0xc6, 0xc4, 0x79, 0x97, 0x70, 0xd3, 0xc3, 0xb7, 0xf3, 0xe8, 0xdf, 0x5f, 0xe5, 0xd6, 0x59, 0xd3, 0x78, 0xe4, 0xc3, 0xd5, 0xbc, 0xb4, 0x66, 0x33, 0xf3, 0xfd, 0x41, 0xce, 0x7d, 0xec, 0x25, 0x8a, 0x86, 0x8e, 0x64, 0xf2, 0xf9, 0xbf, 0x20, 0x50, 0x5c, 0x8e, 0xc3, 0xed, 0x3d, 0x70, 0x0a, 0x45, 0x41, 0xa8, 0x2a, 0xdd, 0x4d, 0xdb, 0x48, 0xc5, 0x23, 0x64, 0x12, 0x31, 0xb6, 0x2d, 0x7f, 0xf3, 0xf0, 0xb1, 0x49, 0x49, 0x73, 0x47, 0x2f, 0xc5, 0x79, 0xbe, 0xc3, 0xf6, 0x99, 0x96, 0x85, 0xa2, 0x28, 0x64, 0x0c, 0x8b, 0x8c, 0x61, 0xe1, 0x76, 0xbb, 0xfb, 0xa3, 0xd1, 0xe8, 0xa0, 0xb0, 0x3b, 0x1a, 0x6f, 0xc4, 0x6b, 0xd9, 0xb6, 0x70, 0xe8, 0xd9, 0xfc, 0x45, 0x76, 0x36, 0x02, 0xc3, 0xb4, 0x88, 0xc6, 0x53, 0x98, 0x96, 0x8d, 0x69, 0x59, 0x7c, 0xb4, 0x6e, 0xc7, 0x17, 0x9e, 0xa7, 0xbf, 0xbb, 0x15, 0x29, 0x25, 0x4d, 0x9b, 0x57, 0xb1, 0x6f, 0xf3, 0x4a, 0x2c, 0xf3, 0x8b, 0x93, 0x4b, 0x9a, 0xee, 0xc0, 0xed, 0xcf, 0xc7, 0x5b, 0x58, 0x81, 0xb1, 0xb3, 0x95, 0xb2, 0xf5, 0x8d, 0xbc, 0xb1, 0x76, 0x0b, 0x46, 0x3a, 0xc3, 0x93, 0x2f, 0xbd, 0x47, 0x75, 0x24, 0x8e, 0x0c, 0x56, 0xe3, 0x09, 0x16, 0xe2, 0x74, 0x7b, 0x81, 0x6c, 0x66, 0xd1, 0xb6, 0x4c, 0x32, 0xa9, 0x04, 0x02, 0x41, 0x5e, 0x49, 0x15, 0xa1, 0xe6, 0x9d, 0x7c, 0xf8, 0xdc, 0x5d, 0xd8, 0xd6, 0x91, 0xe9, 0x76, 0xe7, 0xbe, 0x2e, 0xac, 0x23, 0xe4, 0x5f, 0x52, 0x69, 0x03, 0x4d, 0xcd, 0x76, 0xf7, 0x4a, 0x29, 0x31, 0x4d, 0xf3, 0xc8, 0x96, 0xf4, 0x8b, 0xe6, 0x30, 0xd8, 0x2f, 0x48, 0x29, 0x55, 0xcb, 0x92, 0x68, 0x9a, 0x82, 0x91, 0xc8, 0x7a, 0x1c, 0xa6, 0x69, 0x12, 0x89, 0xa7, 0x06, 0xdc, 0xbd, 0xf7, 0x3f, 0xd9, 0x4e, 0x2c, 0x91, 0xfe, 0xa2, 0xd3, 0x50, 0x36, 0x74, 0x0c, 0xa7, 0x5c, 0xf9, 0x2b, 0x5c, 0xfe, 0x3c, 0xdc, 0xbe, 0x20, 0xaa, 0x10, 0xd8, 0x46, 0x06, 0x5b, 0xda, 0x68, 0xba, 0xf3, 0x88, 0x94, 0x12, 0x0f, 0x77, 0x13, 0x6a, 0xdd, 0x4d, 0xb2, 0xa7, 0x97, 0x07, 0x17, 0xbf, 0xc7, 0xf1, 0x52, 0xf2, 0x6f, 0x60, 0x4e, 0x53, 0x0b, 0x1d, 0x52, 0xb2, 0x4b, 0x28, 0x38, 0x3d, 0x3e, 0x40, 0x20, 0x6d, 0x8b, 0x78, 0xb8, 0x87, 0x54, 0x3c, 0x82, 0x65, 0x64, 0x90, 0x52, 0xd2, 0xd3, 0xb2, 0x8b, 0x7d, 0x5b, 0xbf, 0xb8, 0xba, 0xf5, 0xe9, 0xf6, 0x66, 0x66, 0x1f, 0x33, 0x82, 0xd2, 0xc2, 0x43, 0x7d, 0x73, 0x21, 0x04, 0x42, 0x64, 0xdb, 0xa9, 0xd3, 0x19, 0x13, 0xa0, 0x62, 0x10, 0xb0, 0x01, 0x47, 0x17, 0xd4, 0x04, 0x14, 0x45, 0xe0, 0xd0, 0x54, 0xa4, 0x94, 0x59, 0xef, 0x23, 0x99, 0x21, 0x99, 0xce, 0x20, 0x81, 0x2d, 0x8d, 0xed, 0x6c, 0xdc, 0x75, 0x38, 0x57, 0x7f, 0x56, 0x12, 0xfd, 0x21, 0x96, 0xbf, 0xf4, 0x20, 0xcd, 0x5b, 0x56, 0xa1, 0x39, 0x5c, 0xc4, 0xe3, 0xfd, 0xf4, 0xb6, 0x37, 0x11, 0xee, 0x6c, 0xc6, 0xfa, 0x1c, 0xad, 0x2b, 0xae, 0x69, 0xa0, 0x66, 0xec, 0x74, 0xb6, 0x4b, 0x49, 0x87, 0x94, 0x3c, 0x00, 0xbc, 0x0b, 0xbc, 0x23, 0x25, 0x2b, 0x1a, 0x26, 0x53, 0x3f, 0x79, 0x36, 0x0e, 0x57, 0x96, 0x3e, 0xcc, 0x4c, 0x9a, 0x78, 0x7f, 0x08, 0x33, 0x9d, 0xa2, 0x7d, 0xf7, 0x46, 0x56, 0xbc, 0xfc, 0x10, 0x91, 0x50, 0x07, 0x13, 0xe6, 0x9e, 0xc7, 0x31, 0xf3, 0xbf, 0x41, 0x71, 0x79, 0xdd, 0x11, 0xaf, 0x91, 0x4c, 0x67, 0x78, 0xf1, 0xbd, 0xb5, 0x44, 0x13, 0x87, 0xd6, 0x0c, 0x1c, 0x7a, 0x96, 0xe6, 0xd2, 0x19, 0x83, 0xb4, 0x61, 0x60, 0x59, 0xd6, 0x17, 0x6b, 0xd3, 0x11, 0xe4, 0x68, 0x12, 0x51, 0x85, 0x2e, 0xa7, 0x8e, 0x94, 0x10, 0x4b, 0x64, 0xf9, 0x39, 0x63, 0x98, 0x24, 0x53, 0x06, 0x2b, 0x37, 0x35, 0xb2, 0x66, 0xeb, 0xbe, 0x2f, 0x2d, 0xf1, 0x0f, 0xa9, 0x1f, 0xc7, 0x09, 0x17, 0xdc, 0x80, 0x27, 0x50, 0x88, 0x69, 0xa4, 0x08, 0x77, 0xec, 0xc3, 0x32, 0x0d, 0x36, 0x7e, 0xf0, 0x12, 0x53, 0x17, 0x5e, 0x8e, 0x50, 0x8e, 0xac, 0x03, 0x42, 0x64, 0xb9, 0xd7, 0x5f, 0x52, 0xc9, 0x33, 0x5d, 0x2d, 0x7c, 0x44, 0xf6, 0x69, 0x81, 0x62, 0x4d, 0x63, 0xea, 0xc2, 0xcb, 0x69, 0x38, 0xf6, 0x14, 0x84, 0xb4, 0x31, 0x4d, 0x13, 0xcb, 0x32, 0x11, 0x42, 0xd0, 0xde, 0xb8, 0x19, 0xcd, 0xe1, 0xe4, 0xb8, 0x33, 0xaf, 0x1e, 0x38, 0x8f, 0x6d, 0x59, 0x94, 0xd5, 0x8c, 0xe4, 0xcd, 0x87, 0x7e, 0x85, 0x2d, 0x0f, 0xa7, 0x8c, 0xed, 0x4d, 0x9d, 0xfc, 0xe1, 0xf1, 0xb7, 0x98, 0x31, 0xbe, 0x9e, 0x63, 0x46, 0xd5, 0xd0, 0x11, 0xea, 0x67, 0x54, 0xdd, 0x10, 0x20, 0xeb, 0x04, 0x98, 0x96, 0x8d, 0x10, 0xe2, 0xcb, 0x13, 0x35, 0x9f, 0x91, 0x41, 0x83, 0x2d, 0x84, 0xb0, 0xdd, 0x4e, 0x07, 0x4e, 0x87, 0x86, 0x6d, 0x4b, 0x04, 0x82, 0x65, 0xeb, 0x77, 0xf3, 0xc1, 0xda, 0x1d, 0x94, 0x17, 0xe7, 0x51, 0x94, 0xe7, 0xa3, 0xbb, 0x2f, 0x6b, 0x38, 0x84, 0xa2, 0x10, 0x28, 0xab, 0x43, 0xd1, 0x74, 0xfa, 0xf6, 0x6d, 0x23, 0x58, 0x5e, 0x8f, 0xcb, 0x9f, 0x4f, 0xbc, 0xbf, 0x87, 0x57, 0xef, 0xfa, 0x21, 0x25, 0xd5, 0x23, 0x08, 0x96, 0x56, 0xe1, 0xf4, 0x06, 0x10, 0x42, 0xb0, 0xf3, 0x93, 0x77, 0xe8, 0x6e, 0xda, 0x8e, 0x3b, 0x90, 0xcf, 0x29, 0x57, 0xdc, 0x4c, 0xa0, 0xb8, 0xfc, 0xb0, 0xeb, 0xcf, 0x38, 0xfb, 0x3b, 0x74, 0xed, 0xdd, 0x4a, 0x97, 0xee, 0xa4, 0xcb, 0xe9, 0x22, 0xd4, 0xb8, 0x19, 0xe7, 0xd0, 0xb1, 0x68, 0x4e, 0x17, 0x08, 0x41, 0x2c, 0x12, 0x26, 0xde, 0x7f, 0xc0, 0xeb, 0x28, 0xab, 0x1f, 0x4b, 0x34, 0xd4, 0xc1, 0xe6, 0x8f, 0x5e, 0x25, 0xd1, 0x1f, 0x22, 0xda, 0xdb, 0x41, 0xd7, 0xde, 0x6d, 0xd8, 0xb6, 0x45, 0x69, 0xfd, 0x78, 0x2c, 0x69, 0x93, 0x8a, 0x84, 0x88, 0x74, 0xb7, 0x52, 0x3d, 0xe5, 0x14, 0x22, 0xcd, 0xdb, 0xe9, 0xef, 0xda, 0xc7, 0x84, 0xe1, 0x95, 0x94, 0x97, 0xe4, 0xf1, 0xd6, 0xf2, 0xcd, 0xa4, 0x33, 0x26, 0x63, 0xea, 0xcb, 0xb1, 0x6c, 0x1b, 0x87, 0x43, 0x43, 0x11, 0x02, 0xcb, 0xb2, 0x06, 0xdd, 0xfd, 0x79, 0x34, 0x9a, 0xed, 0xcc, 0x18, 0x26, 0x96, 0x6d, 0x23, 0xc9, 0x52, 0xab, 0xd3, 0xa1, 0x33, 0xb6, 0xbe, 0x82, 0x74, 0xc6, 0xa0, 0xbd, 0xe7, 0x40, 0x22, 0xac, 0x7c, 0xdc, 0xf1, 0x0c, 0x9f, 0x7d, 0x1e, 0xc9, 0x48, 0x88, 0xed, 0x6f, 0x3f, 0xc5, 0xe4, 0xaf, 0xff, 0x10, 0x45, 0xd3, 0x31, 0x92, 0x71, 0xcc, 0x4c, 0x0a, 0x21, 0x25, 0xe9, 0x44, 0x04, 0x4d, 0x73, 0x10, 0xeb, 0x6e, 0x21, 0x1e, 0xee, 0x21, 0x11, 0xe9, 0xe5, 0xa4, 0x4b, 0x6f, 0x02, 0x20, 0x1d, 0x8f, 0xa0, 0xbb, 0x3c, 0x59, 0x4f, 0x25, 0x47, 0xe1, 0x52, 0xc2, 0xa2, 0x1f, 0xfc, 0x05, 0x80, 0x48, 0x4f, 0x1b, 0x3b, 0x56, 0xbe, 0xc5, 0xd0, 0x89, 0x27, 0x52, 0x58, 0x59, 0x8f, 0x94, 0x36, 0x5d, 0x4d, 0xdb, 0xf8, 0xf8, 0x9f, 0xf7, 0x22, 0x6d, 0x89, 0x65, 0x66, 0xdd, 0xb8, 0x68, 0x4f, 0x3b, 0xe9, 0x64, 0x0c, 0xcb, 0x34, 0x18, 0x32, 0x66, 0x3a, 0x43, 0x67, 0x9d, 0x4d, 0xd1, 0xd0, 0x71, 0x28, 0xba, 0x13, 0x55, 0x77, 0x92, 0x0c, 0x77, 0xb3, 0xfe, 0xe5, 0xfb, 0xa8, 0x3a, 0x66, 0x2e, 0x9f, 0x6c, 0x5d, 0x89, 0xc7, 0xe5, 0x20, 0x96, 0x4c, 0xd3, 0xdc, 0xd1, 0x8b, 0xcb, 0xa9, 0x53, 0x51, 0x92, 0x87, 0x40, 0x60, 0xdb, 0x12, 0x45, 0x08, 0x54, 0x55, 0xc1, 0x34, 0xcd, 0x41, 0xf7, 0x34, 0x0f, 0x3a, 0xa8, 0x51, 0x14, 0xe5, 0x18, 0xa4, 0x3c, 0x67, 0xfc, 0x88, 0x2a, 0x12, 0xa9, 0x0c, 0x75, 0xe5, 0x45, 0x34, 0xb6, 0xf6, 0xb0, 0x72, 0xd3, 0x1e, 0x02, 0x3e, 0x37, 0xbd, 0xfd, 0x07, 0xfc, 0x7c, 0x5f, 0x71, 0x05, 0x95, 0x93, 0xe6, 0x10, 0xeb, 0x6a, 0x41, 0xd5, 0x1d, 0x14, 0x0f, 0x9f, 0x84, 0xea, 0x70, 0xa1, 0xbb, 0x7d, 0x38, 0x7d, 0x41, 0x9c, 0xfe, 0x3c, 0xdc, 0x79, 0xc5, 0x38, 0xbc, 0x01, 0x9c, 0xde, 0x00, 0x52, 0xda, 0x84, 0x5b, 0x76, 0x11, 0xeb, 0xeb, 0xa2, 0xbb, 0x79, 0x47, 0x36, 0x1d, 0xaa, 0xe9, 0x58, 0x46, 0x06, 0x33, 0x93, 0xc6, 0x48, 0x25, 0x48, 0x27, 0xa3, 0x64, 0x92, 0x71, 0x84, 0x10, 0x78, 0xfc, 0xf9, 0x54, 0x34, 0x1c, 0x83, 0x27, 0x50, 0x80, 0x65, 0x1a, 0xa4, 0x13, 0x51, 0x1c, 0x4e, 0x0f, 0x0d, 0xd3, 0xe6, 0xe1, 0x70, 0x7b, 0x49, 0x27, 0x62, 0xe8, 0x0e, 0x37, 0x13, 0x4f, 0xb9, 0x80, 0xee, 0xe6, 0x1d, 0x0c, 0x3f, 0xf9, 0x22, 0x2a, 0x26, 0xce, 0xa6, 0xb0, 0x6e, 0x2c, 0x0e, 0x4f, 0x00, 0xcd, 0xe9, 0x41, 0xd5, 0x1d, 0xf4, 0xb7, 0x37, 0xe2, 0x2b, 0x2c, 0x47, 0x4a, 0x9b, 0x96, 0x75, 0x4b, 0xb0, 0x2c, 0x9b, 0xca, 0xd2, 0x7c, 0x4e, 0x3d, 0x6e, 0x34, 0x52, 0x4a, 0x2a, 0x4b, 0xf2, 0xf1, 0x79, 0x9c, 0x34, 0x77, 0xf4, 0x92, 0x48, 0x67, 0xe8, 0x08, 0x45, 0x48, 0xa6, 0x8d, 0xf7, 0xa5, 0x94, 0x83, 0xea, 0x25, 0x19, 0x34, 0xd8, 0x42, 0x88, 0x29, 0x12, 0x16, 0x0d, 0xad, 0x28, 0x22, 0xe8, 0xf7, 0x50, 0x52, 0xe0, 0x27, 0x91, 0xca, 0x50, 0x56, 0x14, 0x64, 0x4f, 0x6b, 0x0f, 0xa5, 0x45, 0x41, 0xfa, 0x22, 0x59, 0xc0, 0x15, 0xa1, 0x50, 0x39, 0xf9, 0x24, 0x92, 0xe1, 0x4e, 0xcc, 0x54, 0x82, 0x60, 0xc5, 0x30, 0xc4, 0x80, 0x3f, 0x9d, 0x4d, 0x12, 0x2b, 0x08, 0x14, 0x55, 0x45, 0x73, 0xb8, 0xf0, 0x15, 0x57, 0x13, 0x28, 0xab, 0x21, 0xd5, 0xdb, 0xce, 0xd4, 0x05, 0x97, 0xd1, 0xd7, 0xd1, 0xc4, 0xde, 0x0d, 0x4b, 0x09, 0xb5, 0xee, 0x21, 0x1e, 0xee, 0x41, 0xd5, 0x1d, 0x68, 0xba, 0x03, 0x55, 0xd3, 0x71, 0xb8, 0x7d, 0x03, 0xd1, 0x61, 0x36, 0xa9, 0x25, 0xd1, 0x9d, 0x6e, 0x14, 0x45, 0x63, 0xf5, 0xbf, 0x1e, 0x27, 0x58, 0x5c, 0x81, 0xe6, 0x70, 0xd1, 0xba, 0x7d, 0x0d, 0xaa, 0xaa, 0xe1, 0x28, 0xaa, 0xa6, 0x64, 0xc4, 0x64, 0xdc, 0xc1, 0x42, 0x84, 0x38, 0xc8, 0x26, 0x48, 0xc9, 0x9e, 0x65, 0xaf, 0x52, 0x32, 0x72, 0x0a, 0xe9, 0x68, 0x98, 0x29, 0xe5, 0x0a, 0x41, 0xaf, 0xce, 0x84, 0x11, 0x55, 0x34, 0xb6, 0xf4, 0xd0, 0xd8, 0xda, 0xc3, 0x09, 0x93, 0x86, 0x67, 0x3b, 0xb8, 0x6c, 0x89, 0xdf, 0xe3, 0x66, 0xfd, 0x43, 0x66, 0xf8, 0x16, 0x00, 0x00, 0x14, 0x57, 0x49, 0x44, 0x41, 0x54, 0x8e, 0x66, 0xd2, 0x86, 0xf5, 0x82, 0x94, 0x72, 0x50, 0xcd, 0x24, 0x47, 0xe3, 0x8d, 0x98, 0x96, 0x65, 0x93, 0x1f, 0xf0, 0x52, 0x5e, 0x1c, 0x04, 0x60, 0xdc, 0xb0, 0x0a, 0x9a, 0xda, 0x42, 0x1c, 0x3f, 0x69, 0x38, 0x15, 0xc5, 0x79, 0x5c, 0x71, 0xce, 0x49, 0xdc, 0x70, 0xd9, 0x42, 0xca, 0xbd, 0x26, 0xcd, 0xab, 0xdf, 0xc6, 0x5f, 0x5a, 0x4b, 0xb8, 0x6d, 0x37, 0xb6, 0x75, 0xb8, 0x2f, 0x2d, 0x73, 0x99, 0x79, 0x4d, 0x51, 0x71, 0x07, 0xf2, 0x29, 0x1c, 0x3a, 0x8e, 0xc2, 0x91, 0xd3, 0x58, 0xfa, 0x8f, 0x7b, 0x10, 0x8a, 0xca, 0xd8, 0x13, 0xcf, 0xa6, 0xac, 0x7e, 0x2c, 0x99, 0x64, 0x9c, 0xce, 0x3d, 0x5b, 0x50, 0x54, 0x2d, 0x0b, 0xaa, 0x50, 0xb0, 0x8c, 0x0c, 0xe9, 0x44, 0x94, 0x44, 0xa4, 0x37, 0x1b, 0xac, 0x24, 0x13, 0xec, 0xdd, 0xb4, 0x9c, 0xf1, 0x27, 0x9d, 0x8b, 0xc3, 0xed, 0x65, 0xc3, 0xfb, 0xff, 0xa4, 0x66, 0xcc, 0x71, 0xb4, 0x35, 0xed, 0xa0, 0x74, 0xd4, 0xb1, 0xb8, 0xfc, 0x05, 0x1c, 0x68, 0x6d, 0xcb, 0x8a, 0x6d, 0x99, 0x84, 0xdb, 0x1a, 0x09, 0x0c, 0x19, 0x4a, 0xba, 0xa7, 0x89, 0xeb, 0x2e, 0xfd, 0x1a, 0x15, 0xa5, 0x45, 0x94, 0x15, 0x06, 0x18, 0x59, 0x5b, 0xc6, 0xc8, 0xda, 0xac, 0x61, 0xd4, 0x54, 0x15, 0x97, 0x43, 0xc7, 0xe5, 0xd4, 0x89, 0x25, 0x33, 0x68, 0xba, 0x3e, 0xa8, 0x92, 0x18, 0x1c, 0x05, 0x67, 0x2b, 0x8a, 0xd2, 0x66, 0x59, 0x16, 0x3d, 0xe1, 0x18, 0x3e, 0x8f, 0x73, 0x20, 0xf7, 0x7f, 0xe9, 0xe9, 0xd3, 0xe9, 0xe9, 0x8b, 0xb1, 0x69, 0x77, 0x2b, 0x8f, 0xde, 0x7e, 0x36, 0x75, 0x95, 0xc5, 0x98, 0xa6, 0xc5, 0x5b, 0x6d, 0x09, 0x2c, 0x23, 0x45, 0x70, 0x48, 0xdd, 0xa1, 0x1a, 0xf5, 0x19, 0xc0, 0x4d, 0xa1, 0x20, 0xa4, 0xc0, 0xe9, 0x0d, 0x52, 0x50, 0x33, 0x0a, 0x90, 0x2c, 0x7f, 0xf1, 0x7e, 0xca, 0x87, 0x4f, 0x64, 0xe4, 0x8c, 0x05, 0x54, 0x8d, 0x9a, 0x82, 0xaa, 0x3b, 0xb0, 0x8c, 0x0c, 0xa9, 0x58, 0x84, 0x54, 0xac, 0x1f, 0xdb, 0xca, 0xe6, 0x55, 0x84, 0x10, 0xa8, 0x0e, 0x27, 0x6e, 0x5f, 0x90, 0xf2, 0xe1, 0x13, 0x69, 0xde, 0xb2, 0x8a, 0x8f, 0xff, 0x71, 0x2f, 0x27, 0x9c, 0x77, 0x3d, 0x1f, 0xfd, 0xe3, 0x5e, 0x1a, 0xe6, 0x5d, 0x8a, 0x2b, 0x70, 0x84, 0x74, 0x00, 0x60, 0x66, 0x52, 0x38, 0x7d, 0x79, 0x84, 0x5b, 0x76, 0xe0, 0x8d, 0xee, 0x26, 0xdf, 0x3b, 0x93, 0x8a, 0xb2, 0x42, 0xd2, 0x19, 0x93, 0x8a, 0x92, 0xbc, 0x01, 0x7f, 0x5b, 0x4a, 0x49, 0x67, 0x6f, 0x84, 0xc5, 0xcb, 0x36, 0x61, 0x9a, 0x16, 0x6e, 0xdd, 0x31, 0xe8, 0x7e, 0x92, 0x41, 0x6b, 0xb6, 0xa2, 0x28, 0xad, 0x00, 0x8b, 0x97, 0x6d, 0x22, 0x1c, 0x4d, 0x0c, 0x8c, 0xdf, 0x30, 0x2c, 0x92, 0x69, 0x83, 0xb2, 0xe2, 0x02, 0x86, 0x94, 0xe4, 0x67, 0x7d, 0xee, 0xdd, 0xad, 0x14, 0xd4, 0x8e, 0xc6, 0x15, 0x28, 0x22, 0x11, 0xee, 0xfe, 0x12, 0x97, 0x50, 0x20, 0x85, 0x82, 0x50, 0x54, 0x5c, 0xc1, 0x22, 0x4a, 0x47, 0x4d, 0xa3, 0xe1, 0xe4, 0x8b, 0x01, 0xd8, 0xb2, 0xf4, 0x35, 0x5e, 0xbf, 0xf7, 0x27, 0xec, 0x58, 0xf5, 0x36, 0xa1, 0xb6, 0x3d, 0x24, 0xa3, 0x7d, 0x24, 0x63, 0xfd, 0xa4, 0x13, 0x31, 0xac, 0x78, 0x84, 0xde, 0x3d, 0x9b, 0x51, 0x85, 0x42, 0xb8, 0xb3, 0x99, 0xd5, 0xff, 0x7a, 0x9c, 0x77, 0x1e, 0xbb, 0x85, 0x13, 0xce, 0xff, 0x3e, 0xad, 0xdb, 0x56, 0x53, 0xd4, 0x30, 0x05, 0x77, 0xc1, 0x81, 0x84, 0xd4, 0x67, 0x25, 0x13, 0xef, 0x47, 0x51, 0x55, 0xac, 0x4c, 0x8a, 0xaa, 0xe2, 0x00, 0x8a, 0x02, 0xaa, 0xa2, 0x20, 0xf9, 0xec, 0x58, 0x05, 0xfd, 0xd1, 0x24, 0x8a, 0xa2, 0x30, 0xb6, 0xbe, 0x82, 0x54, 0x2a, 0x35, 0x73, 0xb0, 0xd8, 0x1d, 0x8d, 0x37, 0x62, 0x00, 0x4c, 0x1d, 0x53, 0x4b, 0x61, 0x2e, 0x87, 0x60, 0xe5, 0x32, 0x7d, 0x5d, 0xbd, 0x51, 0x8a, 0x0b, 0x02, 0xd9, 0xc1, 0x4a, 0x28, 0xca, 0xf7, 0x63, 0x07, 0x0a, 0x73, 0x75, 0x3f, 0xf5, 0x20, 0xbe, 0xfe, 0x62, 0x51, 0x15, 0x05, 0xd5, 0xe9, 0xa1, 0xa8, 0x61, 0x0a, 0x42, 0x08, 0xa2, 0x7b, 0x37, 0x72, 0xf2, 0x15, 0xbf, 0x20, 0x11, 0x0e, 0xd1, 0xb6, 0xe3, 0x53, 0xd2, 0x89, 0x68, 0xb6, 0x8c, 0x06, 0x24, 0xfa, 0x7b, 0x09, 0x96, 0x56, 0x62, 0x2a, 0x1a, 0x6b, 0x16, 0x3f, 0x81, 0xee, 0xf4, 0x70, 0xc6, 0xf5, 0x77, 0x12, 0x6e, 0xdb, 0x43, 0x5b, 0xeb, 0x5e, 0xea, 0x66, 0x9e, 0x71, 0x58, 0x4e, 0xfb, 0x60, 0x49, 0x86, 0xbb, 0xc9, 0xab, 0x18, 0x8e, 0xc3, 0x13, 0x60, 0xc3, 0xb6, 0x3d, 0x08, 0x04, 0x1d, 0x3d, 0x7d, 0x8c, 0xaa, 0x2e, 0x3a, 0xe4, 0x38, 0x21, 0xc0, 0xb0, 0x2c, 0x2a, 0x4b, 0xf2, 0xf0, 0x79, 0x5c, 0x6c, 0x6b, 0xea, 0x54, 0x4d, 0x73, 0x70, 0x95, 0xb1, 0x41, 0x83, 0x6d, 0x18, 0x86, 0x0f, 0x40, 0x53, 0x15, 0x3e, 0x5c, 0xb3, 0x83, 0x73, 0xe6, 0x4e, 0xc6, 0xb0, 0x2c, 0x4c, 0xd3, 0xa2, 0x3f, 0x96, 0x40, 0x73, 0xb8, 0x06, 0xf2, 0x07, 0xb1, 0x64, 0x06, 0xd5, 0xe1, 0xc6, 0x48, 0xc6, 0xb0, 0x8c, 0x34, 0x42, 0xf9, 0x6a, 0x95, 0x24, 0x29, 0x14, 0x14, 0xdb, 0x46, 0xd3, 0x1c, 0x14, 0x0c, 0x9b, 0x48, 0x57, 0xe3, 0x26, 0x96, 0x3c, 0xf1, 0x07, 0xe6, 0x5c, 0x7a, 0x13, 0x05, 0x15, 0x43, 0xf7, 0x1f, 0x45, 0x24, 0xd4, 0x41, 0xeb, 0xb6, 0x35, 0x74, 0x34, 0x6e, 0xa2, 0x7b, 0xdf, 0x0e, 0xa6, 0x2c, 0xb8, 0x0c, 0x80, 0xe5, 0x2f, 0x3e, 0x80, 0xa9, 0x3a, 0xa8, 0x3f, 0xe1, 0x2c, 0x3c, 0x85, 0xe5, 0x47, 0xa4, 0x8f, 0xfd, 0xd2, 0xbe, 0x79, 0x39, 0xc3, 0x67, 0x9f, 0x47, 0xe7, 0xd6, 0x95, 0x5c, 0x7c, 0xfa, 0x2c, 0x00, 0x62, 0xf1, 0xe4, 0x61, 0x69, 0x56, 0x5b, 0x4a, 0x5a, 0x3a, 0xfb, 0xa8, 0xab, 0x28, 0x62, 0x47, 0x53, 0x27, 0x64, 0x1f, 0xe3, 0x1c, 0x94, 0x0c, 0x1a, 0x6c, 0x87, 0xc3, 0x71, 0x8e, 0x65, 0x9a, 0x04, 0xbc, 0x6e, 0x36, 0xed, 0x6a, 0x03, 0xb2, 0xa5, 0x2f, 0x55, 0xcd, 0x3e, 0x24, 0xaf, 0x2a, 0x0a, 0x22, 0x37, 0xb8, 0x7e, 0x43, 0xc3, 0xab, 0x67, 0xdd, 0x51, 0x45, 0x73, 0x60, 0x5b, 0x16, 0x8a, 0xaa, 0x7f, 0xfe, 0xc9, 0x0f, 0x12, 0x5b, 0x51, 0x10, 0x52, 0xa2, 0x39, 0x3d, 0x8c, 0x3c, 0xf5, 0x1b, 0xf4, 0xed, 0xd9, 0xc4, 0xbb, 0x4f, 0xfc, 0x01, 0x6c, 0x13, 0x69, 0x99, 0xe4, 0x0f, 0xa9, 0xc3, 0xe1, 0xf6, 0x51, 0x58, 0x39, 0x94, 0xe3, 0x4e, 0xbf, 0x8a, 0x48, 0xa8, 0x83, 0xb5, 0x6f, 0x3f, 0x4b, 0x3c, 0x11, 0xa3, 0xb0, 0x6e, 0x1c, 0x05, 0x35, 0x23, 0x71, 0xf8, 0x0e, 0x14, 0x0e, 0x3e, 0x4f, 0x74, 0x97, 0x87, 0x78, 0xa8, 0x8d, 0xb6, 0x8d, 0x4b, 0x39, 0xf9, 0xb2, 0x2b, 0xb3, 0xd7, 0x96, 0x12, 0xcf, 0x41, 0x25, 0x3f, 0xd3, 0xb2, 0xd9, 0xb4, 0xbb, 0x95, 0xcd, 0xbb, 0xdb, 0x38, 0x66, 0x74, 0x0d, 0xfd, 0xf1, 0x24, 0x45, 0x45, 0x45, 0x5b, 0x3b, 0x3a, 0x3a, 0x06, 0x85, 0xdd, 0xd1, 0x68, 0xb6, 0xe2, 0xf7, 0xb8, 0xc8, 0x18, 0x26, 0xed, 0x3d, 0x61, 0xee, 0x7b, 0xee, 0x7d, 0xe6, 0xcd, 0x18, 0x43, 0x7e, 0xc0, 0x8b, 0xa6, 0x28, 0xec, 0x6e, 0xee, 0xc0, 0xb2, 0x6d, 0x62, 0x89, 0x14, 0xbd, 0xe1, 0x08, 0x5a, 0xb4, 0x0f, 0x29, 0x6d, 0xac, 0x4c, 0x1a, 0xdb, 0x48, 0x83, 0xe3, 0x40, 0x29, 0x4d, 0x4a, 0x89, 0x91, 0x88, 0xa0, 0x3a, 0x5c, 0xd9, 0x1b, 0x64, 0x5b, 0x18, 0xa9, 0x38, 0x0e, 0x6f, 0x10, 0x69, 0x59, 0x48, 0xdb, 0x42, 0x77, 0xfb, 0xd0, 0x9c, 0x6e, 0x7c, 0x65, 0x75, 0xd4, 0xcf, 0xbd, 0x90, 0xee, 0x1d, 0x6b, 0x69, 0xdf, 0xb8, 0x14, 0x63, 0xdf, 0x0e, 0x1c, 0x6e, 0x2f, 0xed, 0x7b, 0xb7, 0xb0, 0x7d, 0xf5, 0x12, 0x82, 0xd5, 0x0d, 0x94, 0x1d, 0x73, 0xea, 0x40, 0xa8, 0xaf, 0xea, 0x4e, 0x34, 0xa7, 0xfb, 0x88, 0x73, 0xb0, 0x2d, 0x13, 0x45, 0x51, 0x40, 0x08, 0x0a, 0xaa, 0x47, 0x12, 0xef, 0xed, 0xc0, 0xe9, 0xcb, 0xcb, 0xe6, 0xe0, 0x77, 0xee, 0x23, 0x95, 0x4c, 0x0d, 0x54, 0xf2, 0xa3, 0x89, 0x34, 0xf7, 0x3c, 0xf3, 0x2e, 0x69, 0xc3, 0xc4, 0xb4, 0x6c, 0xbc, 0x2e, 0x07, 0xa1, 0x70, 0xdc, 0x34, 0x2c, 0xb9, 0x6f, 0xb0, 0xd8, 0x1d, 0x8d, 0x37, 0xd2, 0xec, 0x74, 0x68, 0xf4, 0x45, 0x13, 0x38, 0x74, 0x8d, 0x11, 0x35, 0xa5, 0x3c, 0xf5, 0xe6, 0x4a, 0xae, 0x39, 0x6f, 0x36, 0x42, 0x08, 0x76, 0xed, 0xeb, 0x60, 0xf5, 0xa6, 0x46, 0xbc, 0x1e, 0x27, 0x43, 0xf2, 0x3d, 0xa4, 0xd2, 0xd9, 0x12, 0x54, 0x3c, 0xd4, 0x86, 0x91, 0x8c, 0x61, 0xa4, 0xe2, 0x03, 0x40, 0x98, 0xa9, 0x04, 0xe9, 0x44, 0x24, 0xeb, 0xa5, 0x48, 0x89, 0x90, 0x12, 0x5b, 0x80, 0x99, 0x4e, 0xa1, 0x39, 0x9c, 0x18, 0xa9, 0x38, 0x46, 0x2a, 0x1b, 0xc0, 0x58, 0x46, 0x36, 0xef, 0x53, 0x3c, 0x62, 0x32, 0xc5, 0x23, 0x26, 0x7f, 0xe9, 0x38, 0x75, 0x97, 0x17, 0x33, 0x95, 0xc0, 0x4c, 0x46, 0x41, 0xd1, 0x10, 0x8a, 0x92, 0x4d, 0x9c, 0x59, 0x26, 0x66, 0x26, 0x85, 0xa2, 0xe9, 0x28, 0x8a, 0x82, 0x33, 0x50, 0x80, 0x69, 0x66, 0x70, 0x06, 0x0a, 0xf9, 0x78, 0xcd, 0x56, 0x9e, 0x78, 0x79, 0x09, 0xe7, 0x9c, 0x34, 0x29, 0x7b, 0x12, 0x21, 0x78, 0xed, 0xc3, 0xf5, 0x4c, 0x1e, 0x55, 0x43, 0x4d, 0x79, 0x21, 0x2f, 0xbe, 0xbb, 0x16, 0x5b, 0x42, 0x2a, 0x6d, 0xa4, 0xad, 0xa3, 0x78, 0x0a, 0xe1, 0x68, 0x9e, 0x3c, 0x48, 0xf8, 0xdc, 0x4e, 0x3a, 0x43, 0x11, 0x4a, 0x0b, 0x02, 0x9c, 0x72, 0xdc, 0x68, 0xc6, 0x0d, 0xab, 0x64, 0xd7, 0xbe, 0x2e, 0x14, 0x45, 0x90, 0x4c, 0x65, 0xd8, 0xda, 0xd8, 0x82, 0x65, 0xd9, 0x74, 0x74, 0x76, 0x43, 0x2e, 0x37, 0x5c, 0x31, 0xf1, 0x44, 0xac, 0x4c, 0x0a, 0x33, 0x93, 0x22, 0x1d, 0xef, 0x27, 0xde, 0xdb, 0x41, 0x3a, 0x11, 0x01, 0x40, 0x4a, 0x1b, 0x99, 0xfb, 0x23, 0xa4, 0xc4, 0xb6, 0x0c, 0x52, 0xb1, 0x30, 0xdd, 0x3b, 0xd7, 0x61, 0xa4, 0xe2, 0x64, 0x72, 0xa1, 0xf6, 0x67, 0xa5, 0xb7, 0x69, 0x2b, 0xc9, 0xfe, 0x9e, 0x03, 0x1b, 0xa4, 0xa4, 0x67, 0x77, 0xb6, 0x09, 0x53, 0x28, 0x2a, 0xe9, 0x58, 0x1f, 0x99, 0x74, 0x92, 0x4c, 0x32, 0x4a, 0x3a, 0xde, 0x4f, 0x26, 0x11, 0xc1, 0x48, 0x27, 0xb2, 0x2b, 0xcd, 0x48, 0x63, 0xa4, 0x93, 0x08, 0x55, 0xc3, 0x57, 0x5c, 0x89, 0xaf, 0x68, 0x08, 0xbf, 0xfa, 0xcb, 0x73, 0x4c, 0x1f, 0x37, 0x14, 0x9f, 0xc7, 0x45, 0x3c, 0x95, 0x61, 0xed, 0xd6, 0x6c, 0x2f, 0xc9, 0xac, 0xc9, 0xc3, 0xf1, 0x38, 0x75, 0xfc, 0x5e, 0x17, 0xa6, 0x65, 0x61, 0x4b, 0x69, 0x79, 0xbd, 0xde, 0x41, 0xf5, 0xf9, 0xc1, 0x51, 0x80, 0x2d, 0x84, 0xe8, 0x76, 0xbb, 0x74, 0x32, 0x86, 0x49, 0x7e, 0x30, 0x9b, 0x3f, 0x9f, 0x33, 0xb5, 0x81, 0x8f, 0xd7, 0xef, 0x62, 0xe9, 0xba, 0x6c, 0x3f, 0xde, 0xe2, 0x8f, 0xb2, 0x81, 0x95, 0xd7, 0xa5, 0x0f, 0x80, 0x11, 0x2c, 0xaf, 0xcf, 0x05, 0x30, 0x07, 0x61, 0x63, 0x1f, 0xda, 0x4e, 0x26, 0x85, 0x18, 0x38, 0x46, 0x51, 0x35, 0x84, 0xaa, 0xd1, 0xbe, 0x69, 0x19, 0xe1, 0xe6, 0x1d, 0x58, 0x46, 0x86, 0x78, 0x4f, 0x2b, 0x89, 0xde, 0x2c, 0x4f, 0x1a, 0xa9, 0x38, 0xbb, 0x3e, 0xf8, 0x27, 0x4e, 0x6f, 0x36, 0xb0, 0xb2, 0x2d, 0x93, 0xc6, 0x8f, 0x5f, 0x25, 0x93, 0x88, 0x10, 0x0f, 0xb5, 0x91, 0x8c, 0xf4, 0x7c, 0x69, 0x41, 0xe2, 0x60, 0x71, 0xe7, 0x95, 0xe0, 0x72, 0xea, 0xac, 0xda, 0xbc, 0x87, 0x7f, 0x2f, 0xdf, 0xcc, 0xaa, 0x4d, 0x7b, 0xc8, 0xf3, 0xb9, 0xb9, 0xe0, 0xd4, 0xa9, 0xa4, 0x32, 0x26, 0x90, 0x7d, 0xd6, 0xc6, 0xa9, 0x6b, 0xa8, 0x8a, 0x48, 0x98, 0xa6, 0x39, 0x68, 0xb0, 0x8f, 0xa6, 0x78, 0xb0, 0xab, 0xbd, 0xbb, 0x9f, 0x54, 0xc6, 0xa4, 0xa4, 0xc0, 0x8f, 0x69, 0xd9, 0xb8, 0x1c, 0x3a, 0x97, 0x2c, 0x9c, 0x4e, 0x4f, 0x38, 0xc6, 0xd2, 0x75, 0x3b, 0xd9, 0xb6, 0x3b, 0x5b, 0x85, 0x99, 0x36, 0x7e, 0x18, 0xaf, 0x6d, 0xdf, 0x48, 0x9e, 0x3d, 0x3a, 0x9b, 0x50, 0x52, 0x35, 0xec, 0x4c, 0x9a, 0xd0, 0x9e, 0x4d, 0x38, 0xfc, 0x05, 0x64, 0x12, 0xfd, 0xa8, 0x8a, 0x46, 0xc9, 0xc8, 0x29, 0xa0, 0xa8, 0x08, 0x29, 0x11, 0xd9, 0xf4, 0x16, 0x12, 0x41, 0x51, 0x55, 0x03, 0xf1, 0x48, 0x2f, 0xa1, 0x3d, 0x9b, 0xd8, 0xf6, 0xf6, 0x93, 0x08, 0xa1, 0x60, 0x9b, 0x06, 0xc1, 0x8a, 0x7a, 0x74, 0xb7, 0x0f, 0x2b, 0x9d, 0x22, 0xd2, 0xbc, 0x1d, 0xd3, 0x34, 0x69, 0x5e, 0xf7, 0x3e, 0xfe, 0xd2, 0x2a, 0x32, 0xb1, 0x30, 0x42, 0x28, 0xc8, 0xcf, 0x54, 0x5b, 0xcc, 0x54, 0x82, 0xe6, 0xb5, 0xef, 0x52, 0x37, 0xe3, 0xf4, 0x23, 0xce, 0xcb, 0xe9, 0xcf, 0xa7, 0xb4, 0xa4, 0x88, 0xf9, 0x33, 0xc6, 0x10, 0xf0, 0xba, 0xf0, 0xb8, 0x1c, 0x08, 0x21, 0x88, 0xa7, 0xd2, 0x24, 0x52, 0x69, 0xb6, 0x34, 0xb6, 0xd1, 0x17, 0xc9, 0xe5, 0x64, 0xdc, 0x4e, 0x4b, 0xd5, 0x5d, 0xa4, 0x52, 0x83, 0x8b, 0x6b, 0x06, 0xdf, 0xd5, 0xa3, 0x28, 0x53, 0x6d, 0xdb, 0x5e, 0x05, 0xe0, 0x75, 0x3b, 0x58, 0x30, 0x73, 0x3c, 0xd5, 0x43, 0x0a, 0x68, 0xeb, 0x0e, 0x93, 0xca, 0x98, 0xec, 0x6d, 0xed, 0x61, 0xfd, 0x8e, 0x66, 0xc6, 0x35, 0x54, 0xb3, 0xad, 0xb1, 0x8d, 0x74, 0xe6, 0xf3, 0xb5, 0x4b, 0xd1, 0x1c, 0x48, 0xdb, 0xc4, 0xe9, 0xcb, 0xc3, 0x15, 0x28, 0x44, 0x00, 0xc9, 0x48, 0x2f, 0xba, 0xdb, 0x8b, 0x6d, 0x9a, 0x24, 0xfa, 0x3a, 0x0f, 0xd3, 0xfe, 0x2f, 0x93, 0xfd, 0xd9, 0x3c, 0x97, 0x2f, 0x8f, 0xbe, 0xe6, 0xed, 0xd8, 0xb6, 0x45, 0x51, 0xed, 0x18, 0x7a, 0xf7, 0x6d, 0x23, 0xd6, 0xd3, 0x8a, 0xaf, 0xb8, 0x12, 0x69, 0x99, 0x08, 0x55, 0xc7, 0x5b, 0x58, 0x86, 0x3b, 0x58, 0x4c, 0x7f, 0x7b, 0x23, 0xc9, 0xbe, 0x2e, 0xd2, 0x91, 0x10, 0xc3, 0xab, 0x4b, 0x49, 0xa6, 0x33, 0xb8, 0x5d, 0x0e, 0x74, 0x55, 0xc5, 0xb4, 0x2d, 0xa2, 0xf1, 0x34, 0xed, 0xdd, 0xd9, 0xe7, 0x6c, 0x46, 0x0d, 0x1d, 0xc2, 0x8e, 0x7d, 0x5d, 0xa6, 0x94, 0x54, 0x5b, 0x96, 0x35, 0xe8, 0x9c, 0xf6, 0xa0, 0x44, 0xd3, 0x34, 0xa7, 0x10, 0x62, 0x05, 0xb9, 0x4e, 0x3d, 0x21, 0x84, 0xd4, 0x35, 0x55, 0xee, 0xff, 0xfd, 0xe0, 0x8f, 0x43, 0x51, 0x64, 0x99, 0xd3, 0x29, 0xf3, 0x74, 0xfd, 0x88, 0xfb, 0xc9, 0xbe, 0xa9, 0xe0, 0x73, 0xf7, 0x7d, 0x95, 0x4f, 0x91, 0xc3, 0x21, 0x67, 0x17, 0x15, 0xca, 0x09, 0x81, 0xc0, 0x57, 0x3a, 0x5e, 0x11, 0x42, 0xea, 0x8a, 0x22, 0x95, 0xff, 0xec, 0xba, 0xfd, 0x5e, 0xef, 0xe7, 0x74, 0x28, 0x7d, 0x11, 0x76, 0x83, 0xfd, 0x82, 0x69, 0x9a, 0x69, 0x45, 0x51, 0x6e, 0x90, 0x52, 0x2e, 0xaf, 0xf5, 0xb8, 0x99, 0x51, 0x50, 0x40, 0xb9, 0xcb, 0x45, 0x47, 0x3a, 0xcd, 0x53, 0xcd, 0x2d, 0x59, 0x5f, 0x5b, 0x08, 0x7e, 0x36, 0x7c, 0x18, 0xa7, 0x96, 0x14, 0x53, 0xe9, 0x76, 0xb1, 0x23, 0x16, 0xe7, 0xf4, 0x15, 0xab, 0x30, 0x72, 0xe1, 0x7a, 0x99, 0xd3, 0xc9, 0x2f, 0x1a, 0x86, 0x53, 0xeb, 0x71, 0xe3, 0x52, 0x54, 0xde, 0xee, 0xea, 0xe6, 0x8e, 0xdd, 0x8d, 0xd8, 0xb9, 0xfd, 0xd3, 0xf2, 0xf3, 0xb8, 0xa2, 0xba, 0x8a, 0xa8, 0x69, 0x12, 0x35, 0x2d, 0xf6, 0x26, 0x12, 0x6c, 0x8f, 0xc5, 0xd9, 0x10, 0x89, 0x90, 0xb4, 0x0e, 0x68, 0xfa, 0x77, 0x6a, 0x6b, 0xb8, 0x7e, 0x68, 0x1d, 0x45, 0x0e, 0x07, 0x4d, 0xc9, 0x24, 0x97, 0xae, 0x5d, 0xc7, 0xb6, 0x68, 0x8c, 0x9b, 0x1b, 0x46, 0x30, 0xca, 0xef, 0x23, 0x63, 0xdb, 0x3c, 0xdb, 0xda, 0xc6, 0x9b, 0x9d, 0x5d, 0x08, 0xe0, 0xe2, 0xca, 0x0a, 0x2e, 0xad, 0xae, 0xa2, 0xd8, 0xe1, 0x20, 0x6e, 0x99, 0xec, 0x8e, 0x27, 0xd8, 0x13, 0x4f, 0xf0, 0x5c, 0x5b, 0x1b, 0x5b, 0xa3, 0x31, 0x04, 0xb0, 0x68, 0x48, 0x19, 0x45, 0x0e, 0x07, 0x69, 0xdb, 0xa6, 0x23, 0x95, 0x66, 0x55, 0xb8, 0x8f, 0x7e, 0xc3, 0xc4, 0xa1, 0x28, 0x5c, 0x58, 0x51, 0xce, 0xea, 0x70, 0x3f, 0x9b, 0xa3, 0x51, 0x4f, 0x51, 0x51, 0x91, 0x2f, 0x1e, 0x3f, 0xc2, 0x83, 0x9f, 0xff, 0x4d, 0xb0, 0xa7, 0x4d, 0x3b, 0x56, 0xac, 0x5c, 0xb9, 0xea, 0xe6, 0x69, 0xf9, 0x79, 0x3c, 0x79, 0xcc, 0x24, 0x86, 0xb8, 0x5c, 0x28, 0x40, 0x73, 0x32, 0xc5, 0xfa, 0xfe, 0x7e, 0x36, 0x46, 0xa2, 0x54, 0xb9, 0xdd, 0x9c, 0x5f, 0x51, 0xce, 0x70, 0x9f, 0x17, 0x45, 0x08, 0xc2, 0x86, 0x41, 0x91, 0xd3, 0x49, 0x7b, 0x2a, 0xeb, 0xbf, 0xfe, 0x76, 0x64, 0x03, 0x5f, 0xaf, 0x18, 0x42, 0x50, 0xd7, 0xb1, 0xa5, 0xa4, 0xd6, 0xe3, 0x66, 0x4b, 0x2c, 0xc6, 0xeb, 0x1d, 0x9d, 0x00, 0xfc, 0x78, 0x58, 0x3d, 0x0b, 0x4a, 0x4b, 0x70, 0xe6, 0x7c, 0xe6, 0x8c, 0x6d, 0x93, 0xb0, 0x2c, 0x76, 0xc4, 0xe2, 0xdc, 0xb5, 0x7b, 0x0f, 0xcf, 0xb7, 0xb5, 0xd1, 0xe0, 0xf3, 0x71, 0x6d, 0x5d, 0x2d, 0x43, 0xbd, 0x1e, 0x1c, 0x8a, 0x42, 0xcc, 0x32, 0xb9, 0xb8, 0xb2, 0x92, 0x27, 0x9a, 0x9b, 0xf9, 0x7e, 0x7d, 0x1d, 0x7e, 0x55, 0x63, 0x4f, 0x22, 0xc1, 0xee, 0x78, 0x82, 0x37, 0x3b, 0xbb, 0x38, 0xad, 0xac, 0x94, 0x9b, 0x1b, 0x46, 0x50, 0xeb, 0x71, 0xe3, 0xc8, 0xbd, 0xa5, 0xec, 0xb8, 0xfc, 0x7c, 0x22, 0xa6, 0xc9, 0xfc, 0xd2, 0x12, 0x2e, 0x5a, 0xbd, 0x16, 0xbf, 0xa6, 0x71, 0xf7, 0xb8, 0x31, 0x94, 0x3a, 0x9d, 0x48, 0x20, 0x69, 0x59, 0x7c, 0xda, 0x1f, 0x61, 0xd1, 0xca, 0x4f, 0x98, 0x14, 0x0c, 0x72, 0xe3, 0xf0, 0x7a, 0x9a, 0x12, 0x49, 0xce, 0x5a, 0xb5, 0x5a, 0x6b, 0x69, 0x69, 0x39, 0x1d, 0xf8, 0xdb, 0x60, 0xb0, 0x1b, 0xb4, 0x37, 0xf2, 0xc9, 0x27, 0xab, 0x6b, 0x81, 0xf9, 0x3f, 0x1e, 0x56, 0x4f, 0x9d, 0xc7, 0x83, 0x57, 0x55, 0x71, 0xab, 0x2a, 0x6e, 0x55, 0xe1, 0x82, 0x8a, 0x6c, 0xc1, 0xf9, 0xb2, 0xaa, 0x4a, 0x2a, 0xdd, 0x2e, 0x9c, 0x8a, 0x82, 0x0a, 0xe8, 0x42, 0xc1, 0x9f, 0x0b, 0x7f, 0x4f, 0x29, 0x2e, 0xe2, 0x9c, 0xf2, 0x32, 0xf2, 0x74, 0x7d, 0xa0, 0xd5, 0xb7, 0xd4, 0xe9, 0xe4, 0xba, 0xba, 0x5a, 0x9c, 0x8a, 0x42, 0x91, 0xc3, 0xc1, 0x8c, 0x82, 0x7c, 0x3c, 0xaa, 0x8a, 0x2a, 0x04, 0xaa, 0x10, 0xb8, 0x55, 0x95, 0x42, 0x87, 0x83, 0x11, 0x3e, 0x2f, 0x37, 0x0e, 0x1f, 0x4a, 0x89, 0xd3, 0xc9, 0xb9, 0xe5, 0x43, 0x28, 0x75, 0x3a, 0x70, 0xe6, 0x22, 0x56, 0xa7, 0xa2, 0x30, 0xcc, 0xeb, 0xe1, 0xcc, 0x21, 0x65, 0xe4, 0x69, 0x1a, 0x9a, 0x22, 0xd0, 0x14, 0x41, 0x91, 0xc3, 0x41, 0xbd, 0xd7, 0xc3, 0xaf, 0x0e, 0x02, 0x3a, 0x6e, 0x59, 0x24, 0x2d, 0x0b, 0x55, 0x08, 0x02, 0x9a, 0x86, 0x5f, 0x53, 0xf9, 0x66, 0x4d, 0x35, 0xa3, 0xfd, 0x3e, 0x82, 0xba, 0x8e, 0x43, 0x51, 0x70, 0x2a, 0x0a, 0x79, 0xba, 0xce, 0x30, 0xaf, 0x97, 0x6b, 0xeb, 0x6a, 0x71, 0xa9, 0xd9, 0xdf, 0x47, 0xfa, 0x7d, 0x8c, 0xf6, 0xfb, 0xb0, 0x6d, 0xfb, 0xfc, 0x1b, 0x6e, 0xb8, 0x61, 0x50, 0xd8, 0x1d, 0x8d, 0xeb, 0x37, 0x29, 0xa8, 0x6b, 0xca, 0xd8, 0x80, 0x7f, 0xa0, 0x27, 0x1a, 0xb2, 0x44, 0x36, 0x29, 0x18, 0x60, 0x62, 0x30, 0xc0, 0xe5, 0xd5, 0x55, 0x04, 0x73, 0x8f, 0x47, 0x0b, 0x91, 0x9d, 0xb4, 0x4b, 0x51, 0xd1, 0x84, 0xe0, 0xfa, 0xa1, 0x75, 0xe4, 0xe7, 0xf6, 0xf5, 0x1a, 0x06, 0x2d, 0xc9, 0x14, 0x6e, 0x55, 0xa5, 0xc6, 0xe3, 0xe6, 0xcc, 0x21, 0x65, 0x94, 0x3a, 0x9d, 0x78, 0xd4, 0x23, 0x27, 0xac, 0x7c, 0x9a, 0x86, 0x2e, 0x14, 0x86, 0x7a, 0x3c, 0x9c, 0x58, 0x54, 0x40, 0x81, 0xe3, 0xf0, 0xca, 0xd4, 0xc2, 0xd2, 0xd2, 0x81, 0xe8, 0x4f, 0x41, 0xb0, 0x3d, 0x16, 0xe3, 0x86, 0xa1, 0x43, 0x69, 0xf0, 0x79, 0x71, 0x28, 0x0a, 0x69, 0xdb, 0x66, 0x45, 0x6f, 0x1f, 0xdd, 0xb9, 0x47, 0xb4, 0x15, 0x21, 0xd0, 0x84, 0xc2, 0xe4, 0xbc, 0x20, 0x7e, 0x5d, 0x47, 0xff, 0x8c, 0x7b, 0xea, 0x52, 0x15, 0xce, 0x1e, 0x52, 0x46, 0xc6, 0xb6, 0x49, 0xdb, 0x36, 0x0e, 0xa1, 0x30, 0xa3, 0xa0, 0x00, 0x29, 0xe5, 0xec, 0x07, 0x1e, 0x78, 0x20, 0x7f, 0x30, 0xd8, 0x1d, 0x4d, 0xf1, 0xa0, 0x22, 0xa8, 0xe9, 0x03, 0x80, 0xc1, 0xfe, 0x87, 0x9f, 0xa1, 0xc8, 0xe9, 0xe4, 0xee, 0x71, 0x63, 0xa9, 0x72, 0xbb, 0x0e, 0x7a, 0xfa, 0x3c, 0xab, 0xbd, 0x5e, 0x55, 0x65, 0x46, 0x41, 0x3e, 0xc7, 0xe4, 0x05, 0x51, 0x84, 0xc0, 0x96, 0x92, 0x5d, 0xb1, 0x38, 0x1f, 0x85, 0x42, 0xd8, 0x52, 0xa2, 0x2b, 0x0a, 0xa7, 0x14, 0x17, 0xd3, 0x6f, 0x1a, 0x9f, 0xdb, 0xf4, 0xae, 0x09, 0x81, 0x53, 0x55, 0x18, 0xe1, 0xf3, 0x52, 0xef, 0xf1, 0xa2, 0x1d, 0x74, 0x9c, 0x5f, 0xd3, 0xa8, 0x70, 0xb9, 0x98, 0x10, 0x0c, 0x1c, 0x74, 0x5d, 0x88, 0x5b, 0x16, 0x27, 0x16, 0x15, 0xe2, 0xd3, 0xb2, 0x8c, 0x19, 0xb7, 0x2c, 0xfe, 0xdd, 0xd5, 0xcd, 0xda, 0xfe, 0x03, 0xb5, 0x52, 0x55, 0x64, 0x57, 0x40, 0x9e, 0xa6, 0x1d, 0xa2, 0x40, 0x00, 0x6e, 0x55, 0x45, 0x55, 0x04, 0x63, 0x03, 0x7e, 0x12, 0xa6, 0x85, 0x29, 0x25, 0xa5, 0xd9, 0x57, 0x2a, 0x39, 0x6d, 0xdb, 0x1e, 0x54, 0x0b, 0xda, 0xd1, 0x54, 0xd7, 0x4b, 0x81, 0x01, 0x3e, 0xdd, 0x3f, 0xb1, 0x52, 0xa7, 0x13, 0x81, 0xa0, 0xcc, 0xe9, 0x38, 0x6c, 0xc0, 0x48, 0xd0, 0x15, 0xc1, 0xfc, 0xd2, 0x92, 0x81, 0x49, 0x9b, 0x52, 0xb2, 0xa4, 0x27, 0x44, 0x46, 0xda, 0xc4, 0x2d, 0x0b, 0x15, 0xc1, 0x84, 0x60, 0x00, 0x87, 0xa2, 0xa0, 0x0b, 0x81, 0x21, 0x25, 0xcd, 0x89, 0x24, 0x6e, 0x55, 0x25, 0xdf, 0xa1, 0xe3, 0xca, 0x5d, 0x4f, 0x00, 0xe5, 0x2e, 0x17, 0xd6, 0x67, 0xf2, 0xcd, 0x7e, 0x4d, 0x63, 0x7c, 0x30, 0x80, 0x5f, 0x3b, 0x30, 0x25, 0x4d, 0x28, 0x18, 0xb6, 0x8d, 0x4b, 0xcd, 0x52, 0x8d, 0x04, 0x62, 0xa6, 0xc9, 0xea, 0x70, 0x3f, 0x2d, 0xa9, 0x14, 0x0b, 0x4b, 0x4b, 0xd0, 0x73, 0x34, 0xb4, 0xff, 0xe4, 0x9f, 0xbd, 0xd1, 0xae, 0x1c, 0xa5, 0x94, 0xbb, 0x5c, 0x24, 0x6d, 0x0b, 0x2f, 0x2a, 0xae, 0xdc, 0xca, 0x93, 0x52, 0x1e, 0x5e, 0xfe, 0xff, 0x02, 0x39, 0x9a, 0xf6, 0x33, 0x87, 0x4b, 0x55, 0x70, 0x7c, 0xa6, 0xb7, 0xc3, 0xa9, 0x28, 0x54, 0xb9, 0x5d, 0xe8, 0x47, 0xea, 0xf9, 0x10, 0xe0, 0x50, 0x14, 0xe6, 0x16, 0x15, 0xe1, 0xce, 0xed, 0x4f, 0xd9, 0x36, 0x4f, 0xb6, 0xb4, 0xb0, 0x25, 0x12, 0x23, 0x91, 0xe3, 0x4f, 0x01, 0x94, 0x3b, 0x5d, 0xd8, 0x40, 0xda, 0xb2, 0xd8, 0x14, 0x8d, 0xf2, 0x51, 0x28, 0xc4, 0xce, 0x58, 0x9c, 0x8c, 0x6d, 0x0f, 0x80, 0x12, 0xd0, 0x34, 0x8c, 0x83, 0x82, 0x96, 0xfd, 0x5e, 0x4c, 0x40, 0xd3, 0x0e, 0x09, 0x1c, 0x14, 0x91, 0x1d, 0xd7, 0x7e, 0x38, 0x4d, 0x5b, 0xd2, 0x95, 0x4e, 0xb3, 0xb4, 0xb7, 0x97, 0xe7, 0x5b, 0xdb, 0x58, 0x13, 0xce, 0x6a, 0xf7, 0xfe, 0x42, 0x41, 0xef, 0x11, 0x62, 0x02, 0x55, 0x08, 0xf2, 0x74, 0x9d, 0x39, 0x45, 0x45, 0xf8, 0x54, 0x2d, 0x17, 0x72, 0xe5, 0xa6, 0x25, 0xc4, 0x57, 0x4b, 0x61, 0xee, 0x1f, 0xcf, 0x60, 0x0e, 0xce, 0x49, 0xbf, 0xff, 0x08, 0xcb, 0xcd, 0x3c, 0xa8, 0x0a, 0x63, 0x48, 0xc9, 0xde, 0x44, 0x92, 0xee, 0x5c, 0x97, 0x94, 0x2d, 0xb3, 0xcb, 0xb7, 0xca, 0xed, 0x1e, 0xd0, 0x9c, 0xb7, 0xbb, 0xba, 0xd9, 0x14, 0x89, 0xb2, 0x29, 0x1a, 0xc9, 0x02, 0x99, 0x3b, 0x5d, 0x99, 0xcb, 0x89, 0x25, 0x25, 0x36, 0xf0, 0x76, 0x77, 0x37, 0xe7, 0xaf, 0x5e, 0xcb, 0x82, 0x15, 0x2b, 0xe9, 0x48, 0xa7, 0x73, 0x03, 0x16, 0x64, 0xa4, 0x8d, 0x95, 0xbb, 0x9c, 0x04, 0xd6, 0x47, 0xa2, 0xb4, 0x24, 0x53, 0x48, 0x20, 0x6a, 0x9a, 0xec, 0x4b, 0x26, 0x49, 0x58, 0x56, 0x96, 0xae, 0x60, 0x80, 0x6e, 0xe2, 0x96, 0xc9, 0x3f, 0xda, 0xda, 0xc9, 0xd8, 0x36, 0xa6, 0x94, 0x3c, 0xdb, 0xda, 0x86, 0x94, 0x12, 0x5b, 0x66, 0xcf, 0x73, 0xf0, 0xaa, 0x38, 0x58, 0x4a, 0x1c, 0x4e, 0x0a, 0x1c, 0x3a, 0x45, 0x4e, 0x47, 0x2e, 0x7d, 0x9c, 0xdd, 0xee, 0x70, 0x38, 0x06, 0x95, 0xf9, 0x3b, 0x9a, 0x4a, 0x4d, 0xca, 0x92, 0xf2, 0x10, 0x0d, 0x32, 0x6c, 0x9b, 0xed, 0xb1, 0x38, 0xb5, 0x1e, 0x37, 0x1e, 0x55, 0x65, 0x5f, 0x22, 0x41, 0x53, 0x22, 0xc9, 0x28, 0xbf, 0x2f, 0x5b, 0x95, 0x96, 0x36, 0x49, 0xcb, 0x42, 0xdf, 0xff, 0xca, 0x51, 0x29, 0x79, 0xa6, 0x35, 0x9b, 0x0b, 0xdf, 0x97, 0x4c, 0x91, 0xb6, 0xed, 0x01, 0x40, 0xb2, 0x9a, 0x98, 0x35, 0xac, 0x6a, 0xee, 0x2a, 0xad, 0xc9, 0x14, 0x7b, 0x12, 0x09, 0xaa, 0xdc, 0x6e, 0x84, 0x80, 0x7e, 0xe3, 0x40, 0x85, 0xc4, 0x92, 0x92, 0xf7, 0x7b, 0x7a, 0x10, 0xc0, 0x65, 0x55, 0x55, 0x03, 0xbe, 0xf8, 0xec, 0xa2, 0x42, 0x20, 0xeb, 0xbe, 0x39, 0x73, 0x6f, 0xe7, 0x31, 0xa4, 0xa4, 0x3b, 0x9d, 0x19, 0xf0, 0xcd, 0xc7, 0x05, 0xb2, 0xef, 0x82, 0xb2, 0x91, 0x98, 0xb6, 0xc4, 0xa3, 0xaa, 0x03, 0xe4, 0xb4, 0x5f, 0x79, 0x34, 0x21, 0xd0, 0x15, 0x41, 0xbd, 0xd7, 0x0b, 0x12, 0x22, 0x86, 0x49, 0x24, 0x97, 0x73, 0x91, 0x52, 0x1e, 0x94, 0x05, 0xfb, 0x72, 0x39, 0x1a, 0xb0, 0x23, 0x69, 0xdb, 0xe6, 0xe0, 0xcc, 0x43, 0xcc, 0xb2, 0x58, 0xda, 0xdb, 0x4b, 0x4b, 0xca, 0xc3, 0x28, 0x9f, 0x8f, 0x37, 0x3a, 0xbb, 0xf8, 0xcd, 0xb6, 0x1d, 0x6c, 0x3f, 0x79, 0x0e, 0x36, 0x60, 0xd8, 0x92, 0x21, 0x4e, 0xd7, 0xc0, 0x6a, 0x48, 0xd9, 0x36, 0xa7, 0x97, 0x95, 0x72, 0x5d, 0x5d, 0x2d, 0x16, 0x92, 0x80, 0xa6, 0x0d, 0x4c, 0xce, 0xa1, 0x28, 0x03, 0xda, 0xaf, 0xe5, 0x6e, 0x8e, 0x53, 0x55, 0xa8, 0x70, 0xb9, 0x72, 0x37, 0x4e, 0x62, 0x4b, 0x39, 0xc0, 0xe1, 0xfb, 0x79, 0xf8, 0xb9, 0xd6, 0x76, 0x66, 0x16, 0x14, 0x70, 0xd3, 0x96, 0xad, 0x7c, 0x6f, 0x68, 0x1d, 0x4e, 0x45, 0x21, 0x66, 0x5a, 0x48, 0xc9, 0xc0, 0x4d, 0x0b, 0xe4, 0xfc, 0x68, 0x97, 0x9a, 0xdd, 0x92, 0x7d, 0x31, 0x81, 0x44, 0xca, 0xac, 0xd6, 0x1f, 0x6c, 0x70, 0xdb, 0x52, 0x29, 0x6c, 0x29, 0xa9, 0xf1, 0x78, 0xb2, 0xc7, 0x92, 0xbb, 0x29, 0xd2, 0xa6, 0x2f, 0xfb, 0x38, 0xb7, 0xf4, 0xf9, 0x7c, 0xa9, 0x44, 0xe2, 0xab, 0x3f, 0xed, 0x71, 0x34, 0x06, 0x32, 0x14, 0x31, 0x0e, 0xad, 0xbd, 0xd9, 0x52, 0xd2, 0x9e, 0x4a, 0x73, 0xc7, 0xae, 0xdd, 0x2c, 0x2a, 0x2b, 0xe3, 0xc1, 0xbd, 0x4d, 0x8c, 0xf4, 0xf9, 0xf0, 0xaa, 0x2a, 0x86, 0x6d, 0x63, 0x23, 0x29, 0x71, 0x3a, 0x06, 0x26, 0xa3, 0x09, 0xc1, 0xe9, 0x65, 0xa5, 0x59, 0x17, 0x4f, 0x42, 0xcc, 0x32, 0xf7, 0x37, 0x99, 0xe3, 0x51, 0x55, 0x14, 0x04, 0x36, 0x92, 0xa2, 0x9c, 0x6b, 0x77, 0x6c, 0x5e, 0x3e, 0xc5, 0x8e, 0xec, 0x53, 0x67, 0x96, 0xcc, 0x6a, 0x68, 0x2a, 0xc7, 0xd9, 0x52, 0x4a, 0xbc, 0xaa, 0xc6, 0x96, 0x68, 0x94, 0x05, 0x2b, 0x56, 0x61, 0x49, 0xc9, 0xb4, 0xfc, 0x3c, 0x14, 0x21, 0x30, 0xa5, 0x64, 0x7f, 0xf2, 0xd6, 0x94, 0x92, 0xd5, 0xe1, 0x7e, 0x1c, 0x8a, 0x20, 0x3f, 0xe7, 0x4b, 0x97, 0x38, 0x9c, 0x38, 0x14, 0x31, 0x10, 0xc0, 0xec, 0xbf, 0xe1, 0xd9, 0x2a, 0x93, 0xc9, 0xbb, 0xdd, 0x3d, 0x7c, 0xbb, 0xb6, 0x1a, 0x77, 0xce, 0x20, 0x5a, 0x40, 0xc6, 0x96, 0x74, 0xa5, 0x33, 0x28, 0x8a, 0x92, 0xa8, 0xac, 0xac, 0xec, 0xea, 0xea, 0xea, 0xfa, 0xca, 0xd8, 0x1d, 0x8d, 0x9f, 0xdd, 0x1b, 0x31, 0x4d, 0x32, 0x07, 0x19, 0x28, 0x4d, 0xc9, 0x6a, 0xde, 0xee, 0x78, 0x82, 0x3b, 0x77, 0x37, 0x92, 0xb0, 0x2c, 0x46, 0xf8, 0xbc, 0xe8, 0x42, 0x90, 0xb1, 0xb3, 0x9c, 0xe8, 0x3c, 0x48, 0x63, 0xfb, 0x0d, 0x83, 0xf3, 0x3f, 0x59, 0xc3, 0xc4, 0xf7, 0x3f, 0x64, 0xda, 0x87, 0x4b, 0x79, 0xa4, 0x69, 0xdf, 0x80, 0x91, 0x53, 0x44, 0xee, 0x83, 0x20, 0x65, 0xd9, 0x38, 0x15, 0x85, 0x9f, 0x8d, 0xa8, 0xc7, 0xab, 0x69, 0x39, 0xfe, 0x97, 0xa8, 0x42, 0xe0, 0xca, 0x51, 0x83, 0x22, 0x04, 0x93, 0xf3, 0x82, 0x08, 0x20, 0x94, 0xc9, 0x30, 0xbb, 0xa8, 0x90, 0xa0, 0xa6, 0x0f, 0x00, 0x58, 0xe4, 0x70, 0x64, 0x57, 0x0b, 0x90, 0xb2, 0x2c, 0x4e, 0x5d, 0xb6, 0x92, 0x0b, 0x57, 0xaf, 0xe3, 0xa1, 0xbd, 0xfb, 0x88, 0x5b, 0x66, 0x2e, 0xd9, 0x21, 0x09, 0x1b, 0x26, 0x51, 0xd3, 0xcc, 0x72, 0x38, 0x59, 0x23, 0xf8, 0xef, 0xee, 0x6e, 0x22, 0x07, 0x15, 0x75, 0xb3, 0x5c, 0x9f, 0x8d, 0x66, 0x81, 0xbd, 0x95, 0x55, 0x55, 0x83, 0x0a, 0xd7, 0x8f, 0xc6, 0x40, 0xb6, 0x45, 0x4d, 0x53, 0xee, 0x8a, 0x1d, 0x68, 0x33, 0xf3, 0xaa, 0x2a, 0x53, 0xf2, 0x82, 0x87, 0x04, 0x04, 0xe7, 0x94, 0x0f, 0x41, 0x57, 0x14, 0xd2, 0xb9, 0xac, 0x9d, 0x0d, 0x03, 0xfb, 0x5d, 0xaa, 0xca, 0xbc, 0x92, 0x62, 0xb6, 0xc7, 0x62, 0x6c, 0x8c, 0x44, 0x98, 0x5d, 0x54, 0x84, 0x4d, 0x96, 0x22, 0x32, 0xb9, 0x7e, 0x3a, 0x5d, 0x11, 0xe4, 0x3b, 0x74, 0x7e, 0x3f, 0x6a, 0x24, 0xb3, 0x0a, 0x0b, 0xd1, 0x84, 0x20, 0x6d, 0xd9, 0x18, 0xd2, 0x26, 0x6a, 0x9a, 0x03, 0x34, 0xa2, 0x08, 0x41, 0x81, 0x43, 0x67, 0x88, 0x2b, 0x9b, 0x17, 0x9a, 0x5d, 0x58, 0x88, 0x4b, 0x55, 0xc8, 0xd8, 0x59, 0x97, 0x32, 0x6d, 0xdb, 0x08, 0xb2, 0xef, 0xb6, 0x6e, 0xf0, 0xfb, 0x18, 0xee, 0xf5, 0xb2, 0x3a, 0x1c, 0xa6, 0xdc, 0xe5, 0xc4, 0x9f, 0xbb, 0x81, 0x96, 0xcc, 0x02, 0xde, 0x6b, 0x64, 0x06, 0x80, 0x16, 0x02, 0x12, 0xa6, 0x45, 0xc2, 0x3a, 0xe0, 0x64, 0xc6, 0x4d, 0x13, 0x3b, 0xc7, 0xdb, 0xc0, 0xf2, 0x57, 0x5f, 0x79, 0xe5, 0x8b, 0xdb, 0x75, 0xff, 0x53, 0xb0, 0xa5, 0x94, 0x4d, 0x40, 0xcf, 0x92, 0x50, 0x68, 0x60, 0x9b, 0x26, 0x04, 0x85, 0x0e, 0x07, 0x25, 0x4e, 0x27, 0x00, 0xc5, 0x4e, 0x07, 0x73, 0x8b, 0xb3, 0xad, 0x00, 0x09, 0x2b, 0x1b, 0x79, 0xe5, 0xeb, 0xfa, 0x80, 0x66, 0x7b, 0x55, 0x95, 0xaf, 0x95, 0x96, 0x50, 0xea, 0x74, 0x12, 0xd4, 0x75, 0x6a, 0xdc, 0x6e, 0x4c, 0x29, 0xb3, 0x1e, 0x04, 0x07, 0xb4, 0xf7, 0x3b, 0xb5, 0x35, 0xfc, 0xa0, 0xbe, 0x6e, 0xc0, 0x70, 0x45, 0x4c, 0x03, 0x5b, 0xc2, 0x86, 0xfe, 0x08, 0x1d, 0xa9, 0x34, 0xb6, 0x94, 0x28, 0x40, 0x50, 0xd3, 0x59, 0x54, 0x56, 0x8a, 0x26, 0x04, 0x13, 0xf3, 0x02, 0x38, 0x15, 0x05, 0x2b, 0xc7, 0xef, 0xd6, 0x41, 0x5e, 0x92, 0x2e, 0x04, 0xa7, 0x96, 0x14, 0xa3, 0x0a, 0xc1, 0xd4, 0xfc, 0x3c, 0x34, 0x21, 0x06, 0x8e, 0xe9, 0x33, 0x8c, 0x81, 0x73, 0xee, 0x7f, 0xf0, 0x38, 0xdf, 0xa1, 0x93, 0xb4, 0x6c, 0x4c, 0xdb, 0x1e, 0xa0, 0x16, 0x80, 0xae, 0x74, 0x1a, 0x5d, 0xd7, 0x97, 0x0e, 0x16, 0xbb, 0x41, 0x83, 0x7d, 0xf1, 0xc5, 0x17, 0xa7, 0x81, 0x95, 0x8b, 0x3b, 0xbb, 0x07, 0x2e, 0x2e, 0x81, 0x94, 0x6d, 0x51, 0x9e, 0xd3, 0xae, 0xd3, 0x4a, 0x4b, 0x09, 0xe6, 0x8c, 0x5e, 0xc4, 0x34, 0xd8, 0x16, 0x8d, 0xe5, 0x5e, 0x80, 0x9b, 0x9d, 0xb8, 0x00, 0x5c, 0x8a, 0xca, 0xb9, 0xe5, 0x43, 0x18, 0x1f, 0x08, 0x80, 0xc8, 0x1a, 0xd1, 0x96, 0x64, 0x8a, 0x84, 0x6d, 0x0d, 0x00, 0xb4, 0x9f, 0x7a, 0xf6, 0x1b, 0xc1, 0x9e, 0x8c, 0x41, 0x63, 0x22, 0xc1, 0xa6, 0x68, 0x94, 0x95, 0x7d, 0xe1, 0x01, 0xde, 0xf6, 0x69, 0x2a, 0x23, 0x7c, 0x3e, 0x26, 0x06, 0x83, 0x94, 0xe6, 0x6e, 0x78, 0xbf, 0x61, 0x92, 0xb6, 0x6d, 0xfc, 0x9a, 0x36, 0xe0, 0x56, 0xea, 0x42, 0xe1, 0xc4, 0xa2, 0x42, 0x8a, 0x1c, 0x0e, 0x02, 0x39, 0xad, 0x4e, 0x59, 0x59, 0x20, 0x9b, 0x93, 0x29, 0x3a, 0xd3, 0x69, 0x0c, 0xdb, 0xc6, 0xb0, 0x6d, 0x2c, 0x29, 0x49, 0xdb, 0x36, 0xef, 0xf7, 0xf4, 0xb0, 0x27, 0x91, 0xa4, 0x2d, 0x95, 0x1e, 0xc8, 0xa9, 0xb4, 0xa4, 0x52, 0xb1, 0x60, 0x30, 0xf8, 0xd2, 0x60, 0xb1, 0x1b, 0xb4, 0x81, 0x7c, 0xe2, 0x89, 0x27, 0x50, 0x14, 0xf5, 0xae, 0x25, 0xa1, 0xd0, 0x82, 0xd7, 0x3a, 0x3a, 0x95, 0xb9, 0xc5, 0x45, 0xc4, 0x2d, 0x93, 0xb0, 0x61, 0x0e, 0x58, 0xf4, 0x0b, 0x2a, 0xca, 0x49, 0xd9, 0x36, 0xdd, 0xe9, 0x0c, 0xa6, 0x2d, 0x79, 0xa3, 0xb3, 0x93, 0x4a, 0xb7, 0x9b, 0x84, 0x65, 0xa3, 0x49, 0x49, 0xbf, 0x61, 0x10, 0xb3, 0x4c, 0xf2, 0x75, 0x9d, 0x09, 0xc1, 0x00, 0x7d, 0x19, 0x03, 0xc3, 0xb6, 0xd9, 0x16, 0x8b, 0xd1, 0x18, 0x4f, 0xd0, 0x95, 0xce, 0xe0, 0x56, 0x15, 0x34, 0x91, 0xed, 0x4c, 0x4a, 0x58, 0x16, 0x7d, 0x86, 0x41, 0xd2, 0xb2, 0xb9, 0xb7, 0x71, 0x0f, 0x19, 0xdb, 0xe6, 0x8d, 0xce, 0x4e, 0xce, 0x18, 0x52, 0x4a, 0x7e, 0x2e, 0xa1, 0x55, 0xee, 0x72, 0x72, 0x5c, 0x7e, 0x1e, 0x29, 0xcb, 0x66, 0x5b, 0x34, 0x86, 0x21, 0x25, 0x7f, 0x6f, 0x6e, 0x61, 0x88, 0xcb, 0x89, 0x69, 0x4b, 0x92, 0x96, 0x45, 0xaf, 0x91, 0xa1, 0x40, 0xd7, 0xa9, 0x72, 0xbb, 0x49, 0x5a, 0x36, 0xbb, 0xe2, 0x71, 0x0c, 0x3b, 0xab, 0xc9, 0x6b, 0xc3, 0xfd, 0xa8, 0x42, 0xd0, 0x95, 0xc9, 0x60, 0xd9, 0x92, 0x50, 0x26, 0xc3, 0xba, 0x70, 0x3f, 0xeb, 0xfb, 0x23, 0x68, 0x42, 0x30, 0x29, 0x18, 0xc4, 0x94, 0x92, 0xb7, 0xba, 0xba, 0x31, 0x84, 0x78, 0xb5, 0xa8, 0xa8, 0x28, 0x32, 0x18, 0xe3, 0x78, 0x54, 0x60, 0x03, 0x2c, 0x58, 0x30, 0xff, 0xdd, 0xd7, 0x5f, 0x7f, 0xe3, 0xba, 0x1f, 0x6f, 0xde, 0x72, 0xef, 0xcc, 0x82, 0x02, 0x91, 0xb6, 0x2d, 0xd6, 0xf5, 0x47, 0x68, 0x4b, 0xa5, 0x18, 0x1b, 0xf0, 0x93, 0xb2, 0x6d, 0x3e, 0xe9, 0x0b, 0xb3, 0x37, 0x91, 0x64, 0x75, 0x38, 0xcc, 0x9b, 0x5d, 0xdd, 0xd4, 0x7a, 0xdc, 0x9c, 0x3d, 0xa4, 0x8c, 0x80, 0xae, 0x11, 0xb7, 0x2c, 0xd6, 0x85, 0x23, 0x3c, 0xba, 0xaf, 0x99, 0x99, 0x05, 0x05, 0x6c, 0x8a, 0x46, 0x69, 0x49, 0x26, 0x79, 0x60, 0xef, 0x5e, 0x12, 0x96, 0x4d, 0x63, 0x22, 0x31, 0x10, 0x0d, 0x4a, 0xb2, 0x01, 0xd1, 0x27, 0x7d, 0x61, 0x1e, 0xd9, 0xb7, 0x8f, 0x6d, 0xb1, 0x78, 0x8b, 0x10, 0xa2, 0xe7, 0xed, 0xee, 0x9e, 0x09, 0xcf, 0xb4, 0xb4, 0x89, 0x6a, 0x8f, 0x9b, 0x9e, 0x74, 0x86, 0x27, 0x5a, 0x5a, 0x68, 0x4a, 0x24, 0x50, 0x85, 0x40, 0x57, 0x14, 0xde, 0xef, 0xe9, 0x61, 0x4d, 0xb8, 0x9f, 0x0b, 0x2b, 0x2b, 0x78, 0xbb, 0xbb, 0x9b, 0x72, 0x97, 0x8b, 0x2d, 0xd1, 0x28, 0x2f, 0xb5, 0x77, 0xb0, 0x33, 0x1e, 0x63, 0x77, 0x3c, 0x8e, 0x2a, 0x04, 0xa1, 0x8c, 0xc1, 0x92, 0x50, 0x88, 0xe5, 0x7d, 0x7d, 0x52, 0x22, 0xc5, 0x1d, 0x3b, 0x77, 0xe3, 0x50, 0x14, 0x5e, 0xe9, 0xe8, 0xa4, 0x33, 0x93, 0x49, 0x4a, 0x29, 0x1d, 0xd7, 0xac, 0xdf, 0xa8, 0xba, 0x55, 0x75, 0xbf, 0xb6, 0xf7, 0x3b, 0x9d, 0xce, 0xbb, 0xb6, 0x6c, 0xd9, 0x32, 0x68, 0xdc, 0x06, 0x5d, 0x16, 0xdb, 0x2f, 0x1e, 0x8f, 0x47, 0x24, 0x93, 0xc9, 0x9f, 0x2a, 0x8a, 0x32, 0x59, 0x08, 0x91, 0xb4, 0x2c, 0x6b, 0x85, 0x10, 0xc2, 0x29, 0xa5, 0x3c, 0x01, 0x98, 0xaa, 0x80, 0xd3, 0x92, 0x52, 0x17, 0x42, 0x6c, 0x01, 0xde, 0x12, 0x42, 0xf8, 0x75, 0x21, 0xae, 0xf0, 0xab, 0x6a, 0x51, 0xc4, 0x34, 0x8d, 0x8c, 0x6d, 0xef, 0x21, 0xfb, 0x1f, 0x7c, 0xb8, 0x84, 0x10, 0x51, 0x45, 0x51, 0xde, 0xb5, 0x6d, 0xdb, 0x29, 0xa5, 0x9c, 0x3b, 0xca, 0xef, 0x73, 0x54, 0xb8, 0x5c, 0xec, 0x4d, 0x24, 0xe9, 0x35, 0x32, 0x59, 0xba, 0x52, 0x94, 0x36, 0x29, 0xe5, 0x6d, 0x3e, 0x9f, 0xef, 0xff, 0x4e, 0x3f, 0xfd, 0xf4, 0xcc, 0xd3, 0x4f, 0x3f, 0x7d, 0x85, 0x94, 0xf2, 0x36, 0x20, 0xa1, 0x28, 0x4a, 0x8f, 0x94, 0x72, 0x1d, 0x30, 0x55, 0x4a, 0x59, 0x22, 0x84, 0x58, 0x27, 0x84, 0x58, 0x2c, 0xb3, 0x32, 0x53, 0xc0, 0x28, 0x21, 0x84, 0xcb, 0x96, 0x72, 0xa9, 0xa6, 0x69, 0xcd, 0x40, 0x81, 0x6d, 0x59, 0x33, 0x80, 0x72, 0xa1, 0x28, 0x3b, 0x84, 0x10, 0x2f, 0xb9, 0xdd, 0xee, 0x17, 0x62, 0xb1, 0xd8, 0xb1, 0x52, 0xca, 0x63, 0x84, 0x10, 0x5e, 0x21, 0x44, 0x93, 0xd3, 0xe9, 0x7c, 0xce, 0x30, 0x0c, 0x9f, 0x94, 0xf2, 0x6c, 0x45, 0x51, 0xaa, 0xa4, 0x94, 0x5d, 0x9a, 0xa6, 0x3d, 0x71, 0xdb, 0x6d, 0xb7, 0xee, 0xfd, 0xc1, 0x0f, 0x7e, 0x78, 0xb4, 0xd0, 0xfd, 0x77, 0x65, 0xee, 0xdc, 0xb9, 0x78, 0x3c, 0x1e, 0xe1, 0x76, 0xbb, 0xd5, 0xfb, 0xef, 0xbf, 0x1f, 0x80, 0x3b, 0xee, 0xb8, 0x83, 0xa2, 0xa2, 0x22, 0xdd, 0xe5, 0x72, 0x8f, 0xf2, 0x7a, 0xbd, 0x85, 0xb3, 0xe7, 0xcc, 0x41, 0x08, 0x51, 0xaa, 0x28, 0xca, 0xb1, 0xd5, 0xd5, 0xd5, 0x5e, 0x80, 0xdb, 0x6f, 0xbf, 0x1d, 0x21, 0xc4, 0x50, 0x21, 0xc4, 0x65, 0x9a, 0xa6, 0x5d, 0xe3, 0xf7, 0xfb, 0xbf, 0xe9, 0xf3, 0xf9, 0x4e, 0xac, 0xaa, 0xaa, 0xaa, 0x5b, 0xb0, 0x70, 0xe1, 0x21, 0xab, 0xf0, 0x47, 0x3f, 0xfa, 0x31, 0x5e, 0xaf, 0x57, 0x2b, 0x2f, 0xaf, 0x10, 0x2f, 0xbf, 0xfc, 0x0a, 0x00, 0x37, 0xde, 0x78, 0x23, 0x0b, 0x17, 0x2e, 0x3c, 0x4c, 0x81, 0xae, 0xb9, 0xf6, 0x5a, 0x16, 0x2d, 0x5a, 0x74, 0xc8, 0xb6, 0x5f, 0xfc, 0xe2, 0x17, 0x5c, 0x72, 0xc9, 0x25, 0xe2, 0xc5, 0x17, 0x5f, 0xfc, 0xff, 0x84, 0xc2, 0xe1, 0xf2, 0xff, 0x00, 0x0f, 0x49, 0x4b, 0xe7, 0xc0, 0xa8, 0x40, 0x10, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char outer_html[] = { 0x3c, 0x21, 0x44, 0x4f, 0x43, 0x54, 0x59, 0x50, 0x45, 0x20, 0x48, 0x54, 0x4d, 0x4c, 0x20, 0x50, 0x55, 0x42, 0x4c, 0x49, 0x43, 0x20, 0x22, 0x2d, 0x2f, 0x2f, 0x57, 0x33, 0x43, 0x2f, 0x2f, 0x44, 0x54, 0x44, 0x20, 0x48, 0x54, 0x4d, 0x4c, 0x20, 0x34, 0x2e, 0x30, 0x31, 0x20, 0x54, 0x72, 0x61, 0x6e, 0x73, 0x69, 0x74, 0x69, 0x6f, 0x6e, 0x61, 0x6c, 0x2f, 0x2f, 0x45, 0x4e, 0x22, 0x20, 0x22, 0x68, 0x74, 0x74, 0x70, 0x3a, 0x2f, 0x2f, 0x77, 0x77, 0x77, 0x2e, 0x77, 0x33, 0x2e, 0x6f, 0x72, 0x67, 0x2f, 0x54, 0x52, 0x2f, 0x68, 0x74, 0x6d, 0x6c, 0x34, 0x2f, 0x6c, 0x6f, 0x6f, 0x73, 0x65, 0x2e, 0x64, 0x74, 0x64, 0x22, 0x3e, 0x0a, 0x3c, 0x68, 0x74, 0x6d, 0x6c, 0x3e, 0x0a, 0x20, 0x20, 0x3c, 0x68, 0x65, 0x61, 0x64, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x74, 0x69, 0x74, 0x6c, 0x65, 0x3e, 0x25, 0x31, 0x3c, 0x2f, 0x74, 0x69, 0x74, 0x6c, 0x65, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x6c, 0x69, 0x6e, 0x6b, 0x20, 0x72, 0x65, 0x6c, 0x3d, 0x22, 0x73, 0x74, 0x79, 0x6c, 0x65, 0x73, 0x68, 0x65, 0x65, 0x74, 0x22, 0x20, 0x74, 0x79, 0x70, 0x65, 0x3d, 0x22, 0x74, 0x65, 0x78, 0x74, 0x2f, 0x63, 0x73, 0x73, 0x22, 0x20, 0x68, 0x72, 0x65, 0x66, 0x3d, 0x22, 0x2f, 0x6d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x2f, 0x73, 0x74, 0x61, 0x74, 0x69, 0x63, 0x2f, 0x66, 0x6f, 0x72, 0x6d, 0x61, 0x74, 0x2e, 0x63, 0x73, 0x73, 0x22, 0x3e, 0x0a, 0x20, 0x20, 0x3c, 0x2f, 0x68, 0x65, 0x61, 0x64, 0x3e, 0x0a, 0x20, 0x20, 0x3c, 0x62, 0x6f, 0x64, 0x79, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x64, 0x69, 0x76, 0x20, 0x69, 0x64, 0x3d, 0x22, 0x4d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x4c, 0x6f, 0x67, 0x6f, 0x22, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x61, 0x20, 0x68, 0x72, 0x65, 0x66, 0x3d, 0x22, 0x2f, 0x22, 0x3e, 0x3c, 0x69, 0x6d, 0x67, 0x20, 0x73, 0x72, 0x63, 0x3d, 0x22, 0x2f, 0x6d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x2f, 0x73, 0x74, 0x61, 0x74, 0x69, 0x63, 0x2f, 0x6d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x5f, 0x6c, 0x6f, 0x67, 0x6f, 0x2e, 0x70, 0x6e, 0x67, 0x22, 0x20, 0x61, 0x6c, 0x74, 0x3d, 0x22, 0x52, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x48, 0x6f, 0x6d, 0x65, 0x22, 0x3e, 0x3c, 0x2f, 0x61, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x64, 0x69, 0x76, 0x20, 0x69, 0x64, 0x3d, 0x22, 0x4d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x4c, 0x65, 0x74, 0x74, 0x65, 0x72, 0x69, 0x6e, 0x67, 0x22, 0x3e, 0x0a, 0x09, 0x3c, 0x61, 0x20, 0x68, 0x72, 0x65, 0x66, 0x3d, 0x22, 0x68, 0x74, 0x74, 0x70, 0x3a, 0x2f, 0x2f, 0x6d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x2e, 0x73, 0x66, 0x2e, 0x6e, 0x65, 0x74, 0x22, 0x3e, 0x3c, 0x69, 0x6d, 0x67, 0x20, 0x73, 0x72, 0x63, 0x3d, 0x22, 0x2f, 0x6d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x2f, 0x73, 0x74, 0x61, 0x74, 0x69, 0x63, 0x2f, 0x6d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x5f, 0x6c, 0x65, 0x74, 0x74, 0x65, 0x72, 0x69, 0x6e, 0x67, 0x2e, 0x70, 0x6e, 0x67, 0x22, 0x20, 0x61, 0x6c, 0x74, 0x3d, 0x22, 0x47, 0x6f, 0x20, 0x74, 0x6f, 0x20, 0x74, 0x68, 0x65, 0x20, 0x6d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x20, 0x68, 0x6f, 0x6d, 0x65, 0x70, 0x61, 0x67, 0x65, 0x22, 0x3e, 0x3c, 0x2f, 0x61, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x2f, 0x64, 0x69, 0x76, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x2f, 0x64, 0x69, 0x76, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x64, 0x69, 0x76, 0x20, 0x69, 0x64, 0x3d, 0x22, 0x4d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x4d, 0x65, 0x6e, 0x75, 0x22, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x25, 0x32, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x2f, 0x64, 0x69, 0x76, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x64, 0x69, 0x76, 0x20, 0x69, 0x64, 0x3d, 0x22, 0x4d, 0x61, 0x64, 0x6d, 0x61, 0x6e, 0x42, 0x6f, 0x64, 0x79, 0x22, 0x3e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x25, 0x33, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x3c, 0x2f, 0x64, 0x69, 0x76, 0x3e, 0x0a, 0x20, 0x20, 0x3c, 0x2f, 0x62, 0x6f, 0x64, 0x79, 0x3e, 0x0a, 0x3c, 0x2f, 0x68, 0x74, 0x6d, 0x6c, 0x3e, 0x0a, }; static char play_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x04, 0x03, 0x00, 0x00, 0x00, 0xed, 0xdd, 0xe2, 0x52, 0x00, 0x00, 0x00, 0x18, 0x50, 0x4c, 0x54, 0x45, 0xff, 0xff, 0xff, 0x99, 0x99, 0xcc, 0x66, 0x66, 0x99, 0x33, 0x33, 0x66, 0x00, 0x00, 0x00, 0xc0, 0xc0, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x2b, 0x86, 0x5b, 0x2f, 0x00, 0x00, 0x00, 0x06, 0x74, 0x52, 0x4e, 0x53, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00, 0xb3, 0xbf, 0xa4, 0xbf, 0x00, 0x00, 0x00, 0x01, 0x62, 0x4b, 0x47, 0x44, 0x04, 0x8f, 0x68, 0xd9, 0x51, 0x00, 0x00, 0x00, 0x3d, 0x49, 0x44, 0x41, 0x54, 0x78, 0xda, 0x63, 0x08, 0x85, 0x02, 0x86, 0xd0, 0xd0, 0x60, 0x38, 0x43, 0x15, 0xc6, 0x10, 0x86, 0x31, 0x84, 0x4c, 0x61, 0x0c, 0x65, 0x18, 0x43, 0xc9, 0x14, 0xc6, 0x50, 0x86, 0x31, 0x0c, 0x58, 0xa1, 0x6a, 0x18, 0xa0, 0x22, 0x40, 0x01, 0x88, 0x39, 0x0c, 0x50, 0x5d, 0x20, 0x01, 0x30, 0x83, 0x01, 0x6a, 0x72, 0x28, 0x2b, 0x8c, 0x01, 0x06, 0x00, 0x41, 0xfc, 0x23, 0xc1, 0x92, 0x07, 0x24, 0xc7, 0x00, 0x00, 0x00, 0x57, 0x74, 0x45, 0x58, 0x74, 0x63, 0x6f, 0x6d, 0x6d, 0x65, 0x6e, 0x74, 0x00, 0x43, 0x6f, 0x70, 0x79, 0x72, 0x69, 0x67, 0x68, 0x74, 0x20, 0x32, 0x30, 0x30, 0x30, 0x20, 0x62, 0x79, 0x20, 0x53, 0x75, 0x6e, 0x20, 0x4d, 0x69, 0x63, 0x72, 0x6f, 0x73, 0x79, 0x73, 0x74, 0x65, 0x6d, 0x73, 0x2c, 0x20, 0x49, 0x6e, 0x63, 0x2e, 0x20, 0x41, 0x6c, 0x6c, 0x20, 0x52, 0x69, 0x67, 0x68, 0x74, 0x73, 0x20, 0x52, 0x65, 0x73, 0x65, 0x72, 0x76, 0x65, 0x64, 0x2e, 0x0d, 0x0a, 0x4a, 0x4c, 0x46, 0x20, 0x47, 0x52, 0x20, 0x56, 0x65, 0x72, 0x20, 0x31, 0x2e, 0x30, 0x0d, 0x0a, 0x06, 0x02, 0x1e, 0xdf, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char play_eventually_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x04, 0x03, 0x00, 0x00, 0x00, 0xed, 0xdd, 0xe2, 0x52, 0x00, 0x00, 0x00, 0x18, 0x50, 0x4c, 0x54, 0x45, 0x00, 0x00, 0x00, 0x99, 0x99, 0xcc, 0x66, 0x66, 0x99, 0x33, 0x33, 0x66, 0xff, 0xff, 0xff, 0xc0, 0xc0, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xec, 0xb6, 0x33, 0x63, 0x00, 0x00, 0x00, 0x01, 0x74, 0x52, 0x4e, 0x53, 0x00, 0x40, 0xe6, 0xd8, 0x66, 0x00, 0x00, 0x00, 0x01, 0x62, 0x4b, 0x47, 0x44, 0x00, 0x88, 0x05, 0x1d, 0x48, 0x00, 0x00, 0x00, 0x09, 0x70, 0x48, 0x59, 0x73, 0x00, 0x00, 0x0b, 0x12, 0x00, 0x00, 0x0b, 0x12, 0x01, 0xd2, 0xdd, 0x7e, 0xfc, 0x00, 0x00, 0x00, 0x07, 0x74, 0x49, 0x4d, 0x45, 0x07, 0xd3, 0x08, 0x01, 0x13, 0x13, 0x33, 0x10, 0xed, 0xd5, 0x28, 0x00, 0x00, 0x00, 0x4f, 0x49, 0x44, 0x41, 0x54, 0x78, 0x9c, 0x55, 0x8c, 0xb1, 0x0d, 0xc0, 0x30, 0x08, 0x04, 0x91, 0x9c, 0x05, 0x50, 0x26, 0x08, 0x2c, 0x80, 0x8d, 0x07, 0x70, 0xc1, 0xfe, 0x33, 0xf9, 0x41, 0xa2, 0xc8, 0x89, 0xe2, 0x8e, 0xe2, 0x89, 0x1a, 0x6b, 0x59, 0x2d, 0xb3, 0x5f, 0x53, 0x5b, 0xc4, 0x41, 0xc9, 0xc7, 0xcc, 0x96, 0x92, 0xfc, 0xc5, 0x7d, 0x95, 0x68, 0x38, 0xc2, 0x68, 0xee, 0x33, 0x58, 0xde, 0x20, 0x0f, 0xac, 0xcb, 0x3e, 0x84, 0xa3, 0xa1, 0xa8, 0x27, 0x57, 0xb3, 0x0a, 0xd4, 0x05, 0xd0, 0x32, 0x0b, 0xad, 0x4c, 0x39, 0x4e, 0x40, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char play_next_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x04, 0x03, 0x00, 0x00, 0x00, 0xed, 0xdd, 0xe2, 0x52, 0x00, 0x00, 0x00, 0x18, 0x50, 0x4c, 0x54, 0x45, 0x00, 0x00, 0x00, 0x99, 0x99, 0xcc, 0x66, 0x66, 0x99, 0x33, 0x33, 0x66, 0xff, 0xff, 0xff, 0xc0, 0xc0, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xec, 0xb6, 0x33, 0x63, 0x00, 0x00, 0x00, 0x01, 0x74, 0x52, 0x4e, 0x53, 0x00, 0x40, 0xe6, 0xd8, 0x66, 0x00, 0x00, 0x00, 0x01, 0x62, 0x4b, 0x47, 0x44, 0x00, 0x88, 0x05, 0x1d, 0x48, 0x00, 0x00, 0x00, 0x09, 0x70, 0x48, 0x59, 0x73, 0x00, 0x00, 0x0b, 0x12, 0x00, 0x00, 0x0b, 0x12, 0x01, 0xd2, 0xdd, 0x7e, 0xfc, 0x00, 0x00, 0x00, 0x07, 0x74, 0x49, 0x4d, 0x45, 0x07, 0xd3, 0x08, 0x01, 0x13, 0x0b, 0x2e, 0xf1, 0xf0, 0x21, 0xa8, 0x00, 0x00, 0x00, 0x4a, 0x49, 0x44, 0x41, 0x54, 0x78, 0x9c, 0x63, 0x60, 0x80, 0x01, 0x03, 0x18, 0xc3, 0x08, 0xc6, 0x31, 0x34, 0x80, 0x70, 0x18, 0x0c, 0x95, 0x21, 0x1c, 0x06, 0x43, 0x25, 0x63, 0x63, 0x10, 0x07, 0xc8, 0x50, 0x14, 0x14, 0x54, 0x32, 0x00, 0x31, 0x40, 0x40, 0x19, 0xc6, 0x30, 0x71, 0x80, 0xaa, 0x71, 0x01, 0xe9, 0x72, 0x71, 0x31, 0x04, 0x0a, 0x30, 0x80, 0x08, 0x63, 0xa0, 0x00, 0x98, 0x00, 0x09, 0x80, 0x09, 0x16, 0x90, 0xc9, 0x2c, 0x0c, 0x68, 0x00, 0x00, 0x1b, 0xac, 0x0b, 0x72, 0xa4, 0xd1, 0x07, 0x5f, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char play_next_xcf[] = { 0x67, 0x69, 0x6d, 0x70, 0x20, 0x78, 0x63, 0x66, 0x20, 0x76, 0x30, 0x30, 0x31, 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x0c, 0x00, 0x00, 0x00, 0x08, 0xff, 0xff, 0xff, 0x99, 0x99, 0xcc, 0x66, 0x66, 0x99, 0x33, 0x33, 0x66, 0x00, 0x00, 0x00, 0xc0, 0xc0, 0xc0, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x11, 0x00, 0x00, 0x00, 0x01, 0x01, 0x00, 0x00, 0x00, 0x13, 0x00, 0x00, 0x00, 0x08, 0x42, 0x90, 0x00, 0x00, 0x42, 0x90, 0x00, 0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x1d, 0x00, 0x00, 0x00, 0x16, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x8f, 0x00, 0x00, 0x02, 0x22, 0x00, 0x00, 0x03, 0xad, 0x00, 0x00, 0x05, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x05, 0x00, 0x00, 0x00, 0x06, 0x4e, 0x65, 0x78, 0x74, 0x32, 0x00, 0x00, 0x00, 0x00, 0x06, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x08, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x09, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0a, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0b, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0c, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0d, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x00, 0x00, 0x08, 0xff, 0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x07, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x31, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x01, 0x45, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x01, 0x55, 0x00, 0x00, 0x00, 0x00, 0x0e, 0x04, 0xfe, 0x00, 0x04, 0x0d, 0x04, 0xfe, 0x00, 0x04, 0x07, 0x04, 0xfe, 0x03, 0x04, 0x03, 0x04, 0xfe, 0x00, 0x04, 0x07, 0x04, 0xfd, 0x03, 0x02, 0x04, 0x02, 0x04, 0xfe, 0x00, 0x04, 0x07, 0x04, 0xfc, 0x03, 0x01, 0x03, 0x04, 0x01, 0x04, 0xfe, 0x00, 0x04, 0x04, 0x04, 0x03, 0x03, 0xf9, 0x01, 0x02, 0x03, 0x04, 0x04, 0x00, 0x04, 0x04, 0x04, 0x04, 0x01, 0x01, 0x02, 0xfc, 0x03, 0x04, 0x00, 0x04, 0x04, 0x04, 0x07, 0x02, 0xfd, 0x03, 0x00, 0x04, 0x04, 0x04, 0xfd, 0x02, 0x03, 0x02, 0x03, 0x02, 0xfc, 0x03, 0x00, 0x00, 0x04, 0x03, 0x04, 0x04, 0x03, 0xfc, 0x01, 0x02, 0x03, 0x00, 0x01, 0x00, 0x05, 0x04, 0x02, 0x00, 0xf8, 0x03, 0x01, 0x03, 0x00, 0x00, 0x04, 0x00, 0x04, 0x07, 0x04, 0x01, 0x03, 0x01, 0x00, 0x01, 0x04, 0xfe, 0x00, 0x04, 0x07, 0x04, 0xfc, 0x03, 0x00, 0x00, 0x04, 0x01, 0x04, 0xfe, 0x00, 0x04, 0x08, 0x04, 0xfe, 0x00, 0x04, 0x02, 0x04, 0xfe, 0x00, 0x04, 0x0d, 0x04, 0xfe, 0x00, 0x04, 0x0d, 0x04, 0x00, 0x00, 0x28, 0x00, 0xfe, 0xff, 0x00, 0x0d, 0x00, 0x01, 0xff, 0x0d, 0x00, 0x02, 0xff, 0x09, 0x00, 0x06, 0xff, 0x08, 0x00, 0x07, 0xff, 0x07, 0x00, 0x08, 0xff, 0x06, 0x00, 0x09, 0xff, 0x04, 0x00, 0x09, 0xff, 0x06, 0x00, 0x07, 0xff, 0x0a, 0x00, 0x03, 0xff, 0x0b, 0x00, 0x02, 0xff, 0x0d, 0x00, 0xfe, 0xff, 0x00, 0x23, 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x05, 0x00, 0x00, 0x00, 0x0b, 0x45, 0x76, 0x65, 0x6e, 0x74, 0x75, 0x61, 0x6c, 0x6c, 0x79, 0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x06, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0xff, 0x00, 0x00, 0x00, 0x08, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x09, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0a, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0b, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0c, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0d, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x00, 0x00, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x07, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x15, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xd1, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x02, 0xe5, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x02, 0xf5, 0x00, 0x00, 0x00, 0x00, 0x0d, 0x04, 0x01, 0x00, 0x0d, 0x04, 0x01, 0x00, 0x0d, 0x04, 0x01, 0x00, 0x0d, 0x04, 0x01, 0x00, 0x0d, 0x04, 0x01, 0x00, 0x03, 0x04, 0x07, 0x03, 0x01, 0x04, 0x01, 0x00, 0x03, 0x04, 0x07, 0x01, 0xfb, 0x03, 0x04, 0x00, 0x00, 0x04, 0x02, 0x04, 0x07, 0x02, 0xfb, 0x03, 0x04, 0x00, 0x00, 0x04, 0x02, 0x04, 0x07, 0x02, 0xfb, 0x03, 0x04, 0x00, 0x00, 0x04, 0x01, 0x04, 0x05, 0x03, 0x02, 0x02, 0xfb, 0x03, 0x04, 0x00, 0x00, 0x04, 0x04, 0x04, 0x02, 0x03, 0xfc, 0x01, 0x02, 0x02, 0x03, 0x01, 0x03, 0xfe, 0x00, 0x04, 0x05, 0x04, 0xf6, 0x03, 0x01, 0x01, 0x02, 0x02, 0x01, 0x03, 0x00, 0x00, 0x04, 0x06, 0x04, 0xfe, 0x03, 0x02, 0x01, 0x02, 0xfe, 0x03, 0x00, 0x01, 0x00, 0x08, 0x04, 0xfc, 0x03, 0x02, 0x03, 0x00, 0x02, 0x00, 0x09, 0x04, 0xf9, 0x03, 0x00, 0x00, 0x04, 0x00, 0x00, 0x04, 0x09, 0x04, 0xfc, 0x00, 0x04, 0x04, 0x00, 0x00, 0x00, 0x53, 0x00, 0x07, 0xff, 0x08, 0x00, 0x07, 0xff, 0x06, 0x00, 0x08, 0xff, 0x06, 0x00, 0x08, 0xff, 0x06, 0x00, 0x08, 0xff, 0x08, 0x00, 0x08, 0xff, 0x07, 0x00, 0x08, 0xff, 0x07, 0x00, 0x06, 0xff, 0x09, 0x00, 0x04, 0xff, 0x0b, 0x00, 0x02, 0xff, 0x0d, 0x00, 0xfe, 0xff, 0x00, 0x02, 0x00, 0x00, 0x00, 0x00, 0x0a, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x00, 0x00, 0x05, 0x00, 0x00, 0x00, 0x06, 0x41, 0x72, 0x72, 0x6f, 0x77, 0x00, 0x00, 0x00, 0x00, 0x06, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0xff, 0x00, 0x00, 0x00, 0x08, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x09, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0a, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x0b, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0c, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0d, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x00, 0x00, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x07, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x4f, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0a, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x04, 0x63, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0a, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x00, 0x04, 0x73, 0x00, 0x00, 0x00, 0x00, 0xfe, 0x03, 0x05, 0x07, 0x05, 0xfd, 0x03, 0x02, 0x05, 0x06, 0x05, 0xfc, 0x03, 0x01, 0x03, 0x05, 0x05, 0x05, 0xfb, 0x03, 0x01, 0x02, 0x03, 0x05, 0x04, 0x05, 0xfa, 0x03, 0x01, 0x02, 0x02, 0x03, 0x05, 0x03, 0x05, 0xfd, 0x03, 0x01, 0x02, 0x01, 0x02, 0xfe, 0x03, 0x05, 0x02, 0x05, 0xfd, 0x03, 0x01, 0x02, 0x02, 0x02, 0xfe, 0x03, 0x05, 0x01, 0x05, 0xfd, 0x03, 0x01, 0x02, 0x01, 0x02, 0xf3, 0x03, 0x00, 0x00, 0x05, 0x05, 0x03, 0x01, 0x02, 0x02, 0x03, 0x00, 0x00, 0x05, 0x01, 0x05, 0xfb, 0x03, 0x01, 0x02, 0x03, 0x00, 0x01, 0x00, 0x02, 0x05, 0xfa, 0x03, 0x01, 0x03, 0x00, 0x00, 0x05, 0x03, 0x05, 0x01, 0x03, 0x01, 0x00, 0x05, 0x05, 0xfc, 0x03, 0x00, 0x00, 0x05, 0x06, 0x05, 0xfe, 0x00, 0x05, 0x10, 0x05, 0xfe, 0xff, 0x00, 0x07, 0x00, 0x01, 0xff, 0x07, 0x00, 0x02, 0xff, 0x06, 0x00, 0x03, 0xff, 0x05, 0x00, 0x04, 0xff, 0x04, 0x00, 0x05, 0xff, 0x03, 0x00, 0x06, 0xff, 0x02, 0x00, 0x07, 0xff, 0x01, 0x00, 0x06, 0xff, 0x02, 0x00, 0x05, 0xff, 0x03, 0x00, 0x04, 0xff, 0x04, 0x00, 0x03, 0xff, 0x05, 0x00, 0x02, 0xff, 0x07, 0x00, 0xfe, 0xff, 0x00, 0x10, 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x05, 0x00, 0x00, 0x00, 0x0b, 0x42, 0x61, 0x63, 0x6b, 0x67, 0x72, 0x6f, 0x75, 0x6e, 0x64, 0x00, 0x00, 0x00, 0x00, 0x06, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0xff, 0x00, 0x00, 0x00, 0x08, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x09, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0a, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0b, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0c, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0d, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0f, 0x00, 0x00, 0x00, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x07, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x14, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x05, 0xc8, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x05, 0xdc, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x05, 0xec, 0x00, 0x00, 0x00, 0x00, 0x14, 0x05, 0xfe, 0x03, 0x05, 0x0d, 0x05, 0xfd, 0x03, 0x02, 0x05, 0x0c, 0x05, 0xfc, 0x03, 0x01, 0x03, 0x05, 0x0b, 0x05, 0xfb, 0x03, 0x01, 0x02, 0x03, 0x05, 0x0a, 0x05, 0xfa, 0x03, 0x01, 0x02, 0x02, 0x03, 0x05, 0x09, 0x05, 0xfd, 0x03, 0x01, 0x02, 0x01, 0x02, 0xfe, 0x03, 0x05, 0x08, 0x05, 0xfd, 0x03, 0x01, 0x02, 0x02, 0x02, 0xfe, 0x03, 0x05, 0x07, 0x05, 0xfd, 0x03, 0x01, 0x02, 0x01, 0x02, 0xfc, 0x03, 0x00, 0x00, 0x05, 0x06, 0x05, 0xf8, 0x03, 0x01, 0x02, 0x02, 0x03, 0x00, 0x00, 0x05, 0x07, 0x05, 0xf9, 0x03, 0x01, 0x02, 0x03, 0x00, 0x00, 0x05, 0x08, 0x05, 0xfa, 0x03, 0x01, 0x03, 0x00, 0x00, 0x05, 0x09, 0x05, 0x01, 0x03, 0x01, 0x00, 0x0b, 0x05, 0xfc, 0x03, 0x00, 0x00, 0x05, 0x0c, 0x05, 0xfe, 0x00, 0x05, 0x17, 0x05, 0x7f, 0x01, 0x00, 0x00, }; static char save_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x08, 0x04, 0x00, 0x00, 0x00, 0xb5, 0xfa, 0x37, 0xea, 0x00, 0x00, 0x00, 0x02, 0x62, 0x4b, 0x47, 0x44, 0x00, 0x00, 0xaa, 0x8d, 0x23, 0x32, 0x00, 0x00, 0x00, 0x76, 0x49, 0x44, 0x41, 0x54, 0x78, 0xda, 0x95, 0x90, 0x41, 0x0e, 0x85, 0x20, 0x10, 0x43, 0xdf, 0x18, 0x6f, 0xe4, 0xdf, 0xeb, 0x69, 0xf0, 0x4c, 0x7a, 0x1a, 0xdc, 0xcb, 0x99, 0xea, 0x42, 0x30, 0x04, 0xf0, 0xab, 0x65, 0x41, 0x26, 0xed, 0xb4, 0xcd, 0x98, 0xe7, 0x3f, 0xba, 0x07, 0x9e, 0xfe, 0xfc, 0x26, 0xd5, 0x94, 0xb7, 0xcb, 0x61, 0x92, 0x70, 0x08, 0x91, 0x74, 0x42, 0x71, 0x29, 0x8b, 0x08, 0x04, 0x02, 0xb0, 0xc7, 0x09, 0x46, 0xbd, 0xe8, 0xd0, 0x10, 0xfc, 0x5a, 0x25, 0xc1, 0x31, 0xc4, 0x74, 0xda, 0x82, 0xb5, 0x20, 0x5c, 0x29, 0x80, 0x25, 0xa3, 0xe7, 0xda, 0x21, 0x35, 0x07, 0x62, 0xd8, 0xb7, 0x4b, 0xd6, 0x9b, 0x09, 0xe6, 0x6f, 0x4f, 0x2d, 0x36, 0xbb, 0x22, 0xbc, 0x89, 0xf2, 0x6d, 0x96, 0x39, 0xdc, 0xe3, 0x00, 0x31, 0x81, 0x24, 0xff, 0x4d, 0xc4, 0xb2, 0xd8, 0x00, 0x00, 0x00, 0x57, 0x74, 0x45, 0x58, 0x74, 0x63, 0x6f, 0x6d, 0x6d, 0x65, 0x6e, 0x74, 0x00, 0x43, 0x6f, 0x70, 0x79, 0x72, 0x69, 0x67, 0x68, 0x74, 0x20, 0x32, 0x30, 0x30, 0x30, 0x20, 0x62, 0x79, 0x20, 0x53, 0x75, 0x6e, 0x20, 0x4d, 0x69, 0x63, 0x72, 0x6f, 0x73, 0x79, 0x73, 0x74, 0x65, 0x6d, 0x73, 0x2c, 0x20, 0x49, 0x6e, 0x63, 0x2e, 0x20, 0x41, 0x6c, 0x6c, 0x20, 0x52, 0x69, 0x67, 0x68, 0x74, 0x73, 0x20, 0x52, 0x65, 0x73, 0x65, 0x72, 0x76, 0x65, 0x64, 0x2e, 0x0d, 0x0a, 0x4a, 0x4c, 0x46, 0x20, 0x47, 0x52, 0x20, 0x56, 0x65, 0x72, 0x20, 0x31, 0x2e, 0x30, 0x0d, 0x0a, 0x06, 0x02, 0x1e, 0xdf, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char stream_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x10, 0x00, 0x00, 0x00, 0x10, 0x04, 0x03, 0x00, 0x00, 0x00, 0xed, 0xdd, 0xe2, 0x52, 0x00, 0x00, 0x00, 0x30, 0x50, 0x4c, 0x54, 0x45, 0x00, 0x00, 0x00, 0xff, 0xff, 0xff, 0xc0, 0xc0, 0xc0, 0x30, 0x30, 0x61, 0x3d, 0x3d, 0x6e, 0x65, 0x65, 0x96, 0x6e, 0x6e, 0x9e, 0x79, 0x79, 0xaa, 0x91, 0x91, 0xc2, 0x9e, 0x9e, 0xcf, 0xc2, 0xc2, 0xf2, 0xcf, 0xcf, 0xff, 0xf2, 0xf2, 0xf2, 0x3d, 0x3d, 0x3d, 0x30, 0x30, 0x30, 0x00, 0x00, 0x00, 0xeb, 0xd2, 0x8e, 0x7e, 0x00, 0x00, 0x00, 0x03, 0x74, 0x52, 0x4e, 0x53, 0xff, 0xff, 0x00, 0xd7, 0xca, 0x0d, 0x41, 0x00, 0x00, 0x00, 0x01, 0x62, 0x4b, 0x47, 0x44, 0x00, 0x88, 0x05, 0x1d, 0x48, 0x00, 0x00, 0x00, 0x69, 0x49, 0x44, 0x41, 0x54, 0x78, 0xda, 0x63, 0x50, 0x82, 0x02, 0x06, 0x20, 0x56, 0x86, 0x31, 0xac, 0x8d, 0x94, 0x8c, 0x40, 0x0c, 0xe5, 0x5d, 0x3e, 0x4e, 0x3e, 0x20, 0x86, 0xf5, 0x6a, 0x43, 0xc3, 0x96, 0x43, 0x0c, 0x7a, 0xf7, 0x76, 0xcd, 0xf0, 0x99, 0x2e, 0x2c, 0xc4, 0xa0, 0xbb, 0x76, 0xe5, 0x4a, 0x43, 0xd5, 0x23, 0x40, 0x91, 0x79, 0x33, 0x66, 0xf8, 0x28, 0x83, 0x44, 0x7a, 0x3b, 0x3b, 0x21, 0x22, 0xf7, 0x32, 0x32, 0xc0, 0x6a, 0x94, 0x0e, 0xb2, 0xb5, 0x81, 0x75, 0x29, 0x29, 0x29, 0x64, 0xf8, 0xf8, 0x80, 0xcd, 0x51, 0x62, 0x33, 0x3c, 0x64, 0x08, 0x66, 0x28, 0xc8, 0x28, 0x09, 0x81, 0x19, 0x4a, 0x87, 0xa0, 0x96, 0x82, 0x01, 0x00, 0x12, 0xe9, 0x23, 0x37, 0x16, 0xd6, 0x6d, 0x1e, 0x00, 0x00, 0x00, 0x57, 0x74, 0x45, 0x58, 0x74, 0x63, 0x6f, 0x6d, 0x6d, 0x65, 0x6e, 0x74, 0x00, 0x43, 0x6f, 0x70, 0x79, 0x72, 0x69, 0x67, 0x68, 0x74, 0x20, 0x32, 0x30, 0x30, 0x30, 0x20, 0x62, 0x79, 0x20, 0x53, 0x75, 0x6e, 0x20, 0x4d, 0x69, 0x63, 0x72, 0x6f, 0x73, 0x79, 0x73, 0x74, 0x65, 0x6d, 0x73, 0x2c, 0x20, 0x49, 0x6e, 0x63, 0x2e, 0x20, 0x41, 0x6c, 0x6c, 0x20, 0x52, 0x69, 0x67, 0x68, 0x74, 0x73, 0x20, 0x52, 0x65, 0x73, 0x65, 0x72, 0x76, 0x65, 0x64, 0x2e, 0x0d, 0x0a, 0x4a, 0x4c, 0x46, 0x20, 0x47, 0x52, 0x20, 0x56, 0x65, 0x72, 0x20, 0x31, 0x2e, 0x30, 0x0d, 0x0a, 0x06, 0x02, 0x1e, 0xdf, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; static char up_png[] = { 0x89, 0x50, 0x4e, 0x47, 0x0d, 0x0a, 0x1a, 0x0a, 0x00, 0x00, 0x00, 0x0d, 0x49, 0x48, 0x44, 0x52, 0x00, 0x00, 0x00, 0x0e, 0x00, 0x00, 0x00, 0x0a, 0x04, 0x03, 0x00, 0x00, 0x00, 0x76, 0xf7, 0x72, 0xf4, 0x00, 0x00, 0x00, 0x30, 0x50, 0x4c, 0x54, 0x45, 0x00, 0x00, 0x00, 0x66, 0x44, 0x33, 0x99, 0x55, 0x22, 0x44, 0x44, 0x44, 0xbb, 0x66, 0x44, 0xbb, 0x88, 0x66, 0xaa, 0x88, 0x88, 0xcc, 0xbb, 0x88, 0xbb, 0xcc, 0xdd, 0xdd, 0xdd, 0xdd, 0xdd, 0xbb, 0x99, 0xff, 0xdd, 0xbb, 0xff, 0xff, 0xdd, 0xdd, 0xee, 0xff, 0x99, 0x99, 0x99, 0xff, 0xff, 0xff, 0xf9, 0x0b, 0xd2, 0xbd, 0x00, 0x00, 0x00, 0x0d, 0x74, 0x52, 0x4e, 0x53, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00, 0x3d, 0xe8, 0x22, 0x86, 0x00, 0x00, 0x00, 0x01, 0x62, 0x4b, 0x47, 0x44, 0x00, 0x88, 0x05, 0x1d, 0x48, 0x00, 0x00, 0x00, 0x25, 0x49, 0x44, 0x41, 0x54, 0x78, 0xda, 0x63, 0x38, 0x73, 0xe6, 0x0c, 0x03, 0x04, 0x1f, 0x60, 0xe0, 0x01, 0xd3, 0x0c, 0x0c, 0x20, 0x02, 0xc8, 0x65, 0x00, 0x0a, 0x30, 0x80, 0xb8, 0x40, 0x01, 0x06, 0x84, 0x3a, 0xbc, 0x18, 0x00, 0xdc, 0xd7, 0x27, 0xd9, 0x4a, 0xd1, 0xdf, 0x5c, 0x00, 0x00, 0x00, 0x00, 0x49, 0x45, 0x4e, 0x44, 0xae, 0x42, 0x60, 0x82, }; const char *getFile( const char *name ) { if ( strcmp( name, "back.png" ) == 0 ) return back_png; if ( strcmp( name, "back_gray.png" ) == 0 ) return back_gray_png; if ( strcmp( name, "down.png" ) == 0 ) return down_png; if ( strcmp( name, "format.css" ) == 0 ) return format_css; if ( strcmp( name, "forward.png" ) == 0 ) return forward_png; if ( strcmp( name, "forward_gray.png" ) == 0 ) return forward_gray_png; if ( strcmp( name, "info.png" ) == 0 ) return info_png; if ( strcmp( name, "madman_lettering.png" ) == 0 ) return madman_lettering_png; if ( strcmp( name, "madman_logo.png" ) == 0 ) return madman_logo_png; if ( strcmp( name, "outer.html" ) == 0 ) return outer_html; if ( strcmp( name, "play.png" ) == 0 ) return play_png; if ( strcmp( name, "play_eventually.png" ) == 0 ) return play_eventually_png; if ( strcmp( name, "play_next.png" ) == 0 ) return play_next_png; if ( strcmp( name, "play_next.xcf" ) == 0 ) return play_next_xcf; if ( strcmp( name, "save.png" ) == 0 ) return save_png; if ( strcmp( name, "stream.png" ) == 0 ) return stream_png; if ( strcmp( name, "up.png" ) == 0 ) return up_png; return NULL; } const char *getFileType( const char *name ) { if ( strcmp( name, "back.png" ) == 0 ) return "image/png"; if ( strcmp( name, "back_gray.png" ) == 0 ) return "image/png"; if ( strcmp( name, "down.png" ) == 0 ) return "image/png"; if ( strcmp( name, "format.css" ) == 0 ) return "text/css"; if ( strcmp( name, "forward.png" ) == 0 ) return "image/png"; if ( strcmp( name, "forward_gray.png" ) == 0 ) return "image/png"; if ( strcmp( name, "info.png" ) == 0 ) return "image/png"; if ( strcmp( name, "madman_lettering.png" ) == 0 ) return "image/png"; if ( strcmp( name, "madman_logo.png" ) == 0 ) return "image/png"; if ( strcmp( name, "outer.html" ) == 0 ) return "text/html"; if ( strcmp( name, "play.png" ) == 0 ) return "image/png"; if ( strcmp( name, "play_eventually.png" ) == 0 ) return "image/png"; if ( strcmp( name, "play_next.png" ) == 0 ) return "image/png"; if ( strcmp( name, "play_next.xcf" ) == 0 ) return "application/octet-stream"; if ( strcmp( name, "save.png" ) == 0 ) return "image/png"; if ( strcmp( name, "stream.png" ) == 0 ) return "image/png"; if ( strcmp( name, "up.png" ) == 0 ) return "image/png"; return NULL; } int getFileSize( const char *name ) { if ( strcmp( name, "back.png" ) == 0 ) return 292; if ( strcmp( name, "back_gray.png" ) == 0 ) return 219; if ( strcmp( name, "down.png" ) == 0 ) return 188; if ( strcmp( name, "format.css" ) == 0 ) return 716; if ( strcmp( name, "forward.png" ) == 0 ) return 290; if ( strcmp( name, "forward_gray.png" ) == 0 ) return 218; if ( strcmp( name, "info.png" ) == 0 ) return 447; if ( strcmp( name, "madman_lettering.png" ) == 0 ) return 1799; if ( strcmp( name, "madman_logo.png" ) == 0 ) return 13526; if ( strcmp( name, "outer.html" ) == 0 ) return 629; if ( strcmp( name, "play.png" ) == 0 ) return 284; if ( strcmp( name, "play_eventually.png" ) == 0 ) return 238; if ( strcmp( name, "play_next.png" ) == 0 ) return 233; if ( strcmp( name, "play_next.xcf" ) == 0 ) return 1640; if ( strcmp( name, "save.png" ) == 0 ) return 288; if ( strcmp( name, "stream.png" ) == 0 ) return 349; if ( strcmp( name, "up.png" ) == 0 ) return 192; return -1; } madman-0.93/httpd/SConscript0000644000175000001440000000100210053135242015575 0ustar akusers00000000000000import glob import os Import( "env" ) webdata_builder = Builder( action = "%s/make_webdata $SOURCES > $TARGET" % os.getcwd(), suffix = "$CXXSUFFIX" ) myenv = env.Copy() myenv.Tool( "qt" ) myenv.Append( BUILDERS = { "WebData": webdata_builder } ) myenv.Append( CPPPATH = "#" ) myenv.Append( CPPPATH = myenv[ 'QT_CPPPATH' ] ) files = glob.glob( "webdata/*.*" ) myenv.WebData( "webdata.cpp", files ) myenv.StaticLibrary( target = "madmanhttpd", source = [ "httpd.cpp", "madmanweb.cpp", "webdata.cpp" ] ) madman-0.93/httpd/make_webdata0000755000175000001440000000353210053135242016127 0ustar akusers00000000000000#! /usr/bin/env python import os import os.path import stat import re import sys print "#include " def print_array( filename, basename ): myfile = file( filename, "r" ) data = myfile.read() print "static char %s[] = {" % basename counter = 0 for byte in data: print "0x%02x," % ord(byte), counter = counter + 1 if counter == 12: counter = 0 print print "};" class tFileDescription: pass filelist = []; for real_filename in sys.argv[1:]: filename = os.path.basename( real_filename ) statbuf = os.stat( real_filename ) if stat.S_ISREG( statbuf.st_mode ): c_name = filename.replace( ".", "_" ) print_array( real_filename, c_name ) if re.search( "\\.css$", filename ) is not None: mime_type = "text/css" else: mime_type = os.popen( "file -i %s" % real_filename, "r" ).read() mime_type = mime_type[ mime_type.find( ": " ) + 2: ].strip() mime_type = re.sub( "charset=.+$", "charset=UTF-8", mime_type ) description = tFileDescription() description.c_name = c_name description.filename = filename description.mime_type = mime_type description.size = statbuf.st_size filelist.append( description ) print "const char *getFile( const char *name )\n{" for description in filelist: print " if ( strcmp( name, \"%s\" ) == 0 ) return %s;" % ( description.filename, description.c_name ); print " return NULL;" print "}" print "const char *getFileType( const char *name )\n{" for description in filelist: print " if ( strcmp( name, \"%s\" ) == 0 ) return \"%s\";" % ( description.filename, description.mime_type ); print " return NULL;" print "}" print "int getFileSize( const char *name )\n{" for description in filelist: print " if ( strcmp( name, \"%s\" ) == 0 ) return %d;" % ( description.filename, description.size ); print " return -1;" print "}" madman-0.93/httpd/webdata/0000755000175000001440000000000010053135242015201 5ustar akusers00000000000000madman-0.93/httpd/webdata/back.png0000644000175000001440000000044410053135242016611 0ustar akusers00000000000000PNG  IHDRRPLTEi`tRNSSbKGD LFIDATxcp c@B`3@D$bda8+)C QbdʀXT WtEXtcommentCopyright 2000 by Sun Microsystems, Inc. All Rights Reserved. JLF GR Ver 1.0 IENDB`madman-0.93/httpd/webdata/back_gray.png0000644000175000001440000000033310053135242017630 0ustar akusers00000000000000PNG  IHDR7bKGD̿ pHYs  ~tIME 0 1rlIDATx} "؂W08 =@:g%_q$y%+$ywAۏ8 'AhEI,#&f,}ϪC' VEl2܈IENDB`madman-0.93/httpd/webdata/down.png0000644000175000001440000000027410053135242016661 0ustar akusers00000000000000PNG  IHDR vr0PLTEfD3U"DDDfDf̻ݻݻ ҽ tRNS="bKGDH!IDATxc8s Q qA &'/$_~IENDB`madman-0.93/httpd/webdata/format.css0000644000175000001440000000131410053135242017202 0ustar akusers00000000000000img { border:none; } #MadmanLogo { position:absolute; top:10px; left:20px; } #MadmanLettering { position:absolute; top:10px; left:100px; } #MadmanMenu { position: absolute; top:47px; left:300px; right:20px; text-align:right; font-size:small; } #MadmanMenu a { color:black; } #MadmanBody { position: absolute; top:100px; left:20px; right:20px; height:auto; } #MadmanMenu a img { border: none } tr.darkline td { background-color:#e0e0e0; } tr.brightline td { background-color:#f0f0f0; } table.songtable tr th { text-align: left; background-color:#c0c0c0; } table.songtable { width:100%; border-spacing: 0px; } table.infotable { border-spacing: 0px; } madman-0.93/httpd/webdata/forward.png0000644000175000001440000000044210053135242017353 0ustar akusers00000000000000PNG  IHDRRPLTEi`tRNSSbKGD LDIDATxcp 62 C%2TH `!2 adc5$VcE:(WtEXtcommentCopyright 2000 by Sun Microsystems, Inc. All Rights Reserved. JLF GR Ver 1.0 IENDB`madman-0.93/httpd/webdata/forward_gray.png0000644000175000001440000000033210053135242020373 0ustar akusers00000000000000PNG  IHDR7bKGD̿ pHYs  ~tIME 0*9kIDATx @Wtn^5@bJ 7+QDhRl~@ E@Fо8MF%,w9 @6O"1u[mIENDB`madman-0.93/httpd/webdata/info.png0000644000175000001440000000067710053135242016654 0ustar akusers00000000000000PNG  IHDR(-SPLTE锍ɡc]sަɳƳŞľƿžڭok}žۭﾸҬſvsSSS ̏tRNS0JbKGD37|^IDATx]0 T@'T"H$/%bڇ -,@@.rA%Yp( ,f>}u$8!} fү-1G9f#.m[#{Q'}R)~PUr`'oS"IENDB`madman-0.93/httpd/webdata/madman_lettering.png0000644000175000001440000000340710053135242021225 0ustar akusers00000000000000PNG  IHDR.2bKGD pHYs  #utIME 2pp0IDATxOHmgv[WM+22BMOѥSʢԚ":xP1 !V*h"<{ՆIvy;qƑsg~;3ό:`(@v 2P C),C 12P C),C .@}t:<ȶ^a!RXJab(e!RXJ۷l6EQ[[[^jZFcrrr~~~[[ Aѣ[n[V{‡AdddX,zizJ4%/>|`0$&&>ydccC*B~n#?=s=cbbǩ2TYYcEEE.+::zGeNNNdq\SSΰơ9N_v߿… Ph Qb6)?~lwhlll\XXEqaa@FDlrr/..>xq:"Gr```{rqʞVXs%vu˅4LGGyMv#+|DՅ[%r%J7.)CģHe~~D7XvQ~ɓYCC,qҳ"x?u sÇ2>>>)ݏbΝ;SNt:I>0qwll˗/?~|(B!¯x^ȧO`n ".ᨬo`655<&&V⎞咒/`;ׯy搶H1R.va%b_q[ mllHRObEfrrȑ#td %ϟ?SCtv dOR{SH% S2O8A,CaH1R.*$)^}"/^XZZ(1D0#49JC]Uku4 fe?]=F$HXw?fff xpjjٳ n7׈x"B›ǵ^|| R+OՉx"gi:;;%NZNDM$HX 2z777jkk ugvv6,3MMM~{cc#yY]/,V?CG=s{vHX wag|H?%"b3p:;\v ǃyfTW.OM z{{gwy e(]55AW2X]]mii Ã^7LcS@]UUn6-Kff{vϺ$kjX!Ze!RXJab(e_vRSIENDB`madman-0.93/httpd/webdata/madman_logo.png0000644000175000001440000003232610053135242020172 0ustar akusers00000000000000PNG  IHDR[IR(Z bKGD pHYs  ~tIME 4.w* IDATxwge.ۗPQ!b-D)&571Wnb׈"Ml/wN9?e$]ؙ3|9 8 :0x@y(@!;NXQ]@4M]k۶['?y=gd2*!0 _Q۶]% s(ʛ[ZZ$>JKKX)T)-`(onillYuX xS||@ yƵxx0Dn œFDIA aGJ( ;KuuTڰ?047Hn6@p؞yK  !<~\jA{4PXX' tuuO?'H)m)OW֝gD}B2Ĺhb冝\٧L@(%A4EA]~bk674w0-?[ҽ7r䑨r)%>g-\w׸yxv~pcMRm0(ˀ@'p)NZyyyvi̛7RVZinnN|>nq\QQQAee%n>y@{k{ .%Oȟ~z,- EQXo-] SFq/b|C BE 2IO_x2͜~C{Wl h(/ɧx2TEAQ_lӴx"ōW-zRsrSo1M$y~/^[d`sNˁ})p-˳>kFooVׅ@g"A65ʁuuu\uU,[7^7ml@ЀRU%T fMńJ̜<)S'pGf5ۖ$i .H<@B]oTʌ1qd-y>p$=m'Tҽ7i*k6ôy\xNE$L ƍwc6x,5k _zz?Qbv5uPQ`Z"SWYBg/yN˄XFMĖc<(\s53~k|Sm8,}lT%êxߦnMUBew i ׉Ɠ'yՏVSF]e /]/]EƓ5zRkgͻ5wxOĒ8t%Ŝic5HK[+8 TR Jϟ{ms)p@́$kdHy9f⬳bl]1-*J (1yT>|>7aj.Ք Җ4wش}Cy X׵aEYQ^w˲I "$y7WOina7OqAP8ʶ7C8g? {9.GWT`׳yf.?{7\ |fz,6jc֬Y|tBp/΁8t<.=F!/(?߹msr/$8?"{j=!mۚ'^m*mh `yg}4QWYbv*[v5-lܱ۶QU |;ٜtX^}o5g}9%goPr3믧~^{5qBϙ9qD+X͝ض ev0k,=X6YCɒ%̱,Hp)Ϣ>~xt!v}/AT7?!ΝwD/ʤuZAIa;yfE|ڐ|-9enLS+{gXM8Fr3oQ %\B$ᮻ" aY]]]L<|VI8'1 h!rpW_חR=MuQ[QLՐBRiBP?rAUUev9s&կ9wq}!c+gaXʳD2͵%kyX)k__lrg$ә {ñ5e<>"|UFw?ϒU'k*9eka+YfΜ9NOOnt:E{Zͽ3sR|z܌aYj0G}u)w?/yMby"N]ghU ~RJ / Ç`˖-477t:M~~>3gdȐ2q LYKa;ony.Nέ}b^T)悅3{oM˶"9~_v@N2%qk(dfzc}7a87]}&'Ouk?ݺɣٻn;=I<˲Xp!'NdSu;x9c9fl=`̰*tKlW#^J&ez.=DƏep9uΝ?&RlލM6eW={+Ns;si݌? QO>;,4hh4eGpD䦫DJ7đxhB$$6}oY˙; !Ēg]qQSSW_͈r*K ѵbO212+7rB(,+\Ys0rDHcc#elNu̝kH)S}{~H{w/K.eض˲m|t]!p$R`-ϼ+ϙC*mc}|xwXm!Z;zPA8B~:;;imm%L룮ύ˲i%L{Yzm؟{[%LgD=㧗UvI?PH$`0i#񬏔J}b /pOaѵˬ)3}pCaNf}=:{E$"HIOOp>_'ia)!?Ķ%<"m]}7n F(mmm KNN]E1v:[v'Yj13fد:ıl%kh^s`6rض;̢Smߥ(?@sG/wuz1-!zm)75oMgw+-[`&7n{aHq>߿t]54U%LFJɛ׭駟P`L>};sԏ:%C`*t]wɆ +uX,F:T&2 fٺ2TU,)-mr+|[$i<̺} %k^8Ɛr[.:x4lE$Bٔ7Ä!-W̆OᥟR[Rt¤a=v>E(D)Z*-5ۅr1ʠ5[UUouYę'MbxU U;^7~[X~'G(n}m'^\t3t tيN'"?c&vmՔ//=Od52jTjkzKw"HC.dr4`K]S1 <Np&d[ TUvd^" 0n9Y 2 MqH)yVo 3'5hCp*̙g1 \~l,H̽򗸽ƘIIFBX[?>qDՀys;& l۶´O ̖YLT2H'F@a?`I 7=poׇqZm-5~?tӡ+:dy(~38p7RB׾}DmaZ `KCאHLӶ5]K A4U6x]G<0cHeṟ}ݘҶIcX._#Ԍ/zD2MYQOz5f " +a{t% Yl "#md7C.I3I$;PR`4iM&3KNJI2m`RJ6n=׾ϚO`IJCs 3pWR9}0) K0kfnaUҺ JQs\m:`Rpb"dQbݠT*t94]r|^gZēi$uO=a߷- ɤL_-!n!"_Pyp÷_Yxռf3A}%d P\=p EA*MH#d1-IIsG/y(d av蠰;okٶpEv6ôSiY|n)%MWoJ,K[Xv F:Ó/Gu$ V t{lfѶL2A^I|]֑v.#_RiMvJ)1MȖ0/H)U˒hziܽ?N,P6t \+\<ܾ F[hwjMRo`NS RK(8=>@ mxTLx3}FVP1AqyLgxD za`YkhQ.Kd9c$S+75f/- ܀'Piw2 6~S^PBd_R3]-|DibMci81M2B޸38mYՌ͇~-M1cFgT 5A-NNmKewQ磻/k8(Ctm#X^˟OW!%#VBwnڎ;)WL8;tJ"ԸбhNA,&(K4^%"AmضEix,itR="DŽᕔͤ3&c˱lCC˲y4&m#Rӡ3tƠ@"| }Ho?E1qL !%DMsn!!Ko 7|_qjAp}8}Ag+fY=>s 鋱iw+~6uŘ[m ,#EpHݡM RP3 ,~ʇOdT; XTU'n_i޲q/'w=^]+pt`fR8}y[v&;B[JIgo6an1~Ak(m"M 0,ig}ݭԎ("P PT\"JGMز5^'X6=$}$c1x=QBzw>VS0wg%GQUL X$0T*5s7bLSKa.`2}]Q J(c su? bQ顨a B{7r ѶS҉h${ Vb*k?pwnC[^fqXN`Iɫ`ö==}.:8!,*Ky\lkTMspAm@S>\sNư,LӢ?@sdHư4Bj$)F HW&<\zCE$A5t4n{, />:?,$* "7~CëgQEs`[[QR9=<ĻOliQX9NHo?K<n5#q>OtxK9+זA%?Ӳٴͻ8ft $EEE[;::h&=a{}C~(nmbZ)mLH@)MJ:\d[8oiYHBwМn|euϽki߸cn/{} s@N4s-EQ@ Gw#L T4<.iĴl.p4,o7thE8t5'No6-Ə_%|iA`qrڼ/̪M{ԩ2&}ƩkH9hxTƤiٸ:,NO8u;ٶ;[6~mH=:PR5LОM8dF))AQUH/=`zt+"Ҽ4i^>*20B(T[TR7#ϧ3!$Ri4dNK]Rkգ(Sm^u;X0s/7JɹC(u:p"V0!ei"AAï:nY$- U_SfM5>CQp* y0kjqG}mnaP7)k؀'D6)`b0UsG KQфu-nU!e:x#'|.zQ]8BR+ o SURt_Өp t]['Ӳ,RUdW@@nUEUc~)%W*9mT TK>?R8lHҒIR'DF- ` !%͉$nU%ߡ]O.g~Mc|0_;0%M(KRbp?- KKs4䟽Ѯ\$m /*ʓR^93KUp|é(T]GPO6O%#O;]@ڲQ(Xm4^L@ ~8M[ҕN[XjBAbUt9EET-r%WKa`I< cHD\-˷М);]ˉ%%6vw7^˂+HsdG$SH jK&IXV`n?6<چ[fs8XJN :ENG.}p8;JMʒ 2l87Ue_"AS"(/[6IBQ)y5 ߗL@5j*{ n~@Ē{zeUUB 9so1;ģ_y4!A "I$sRr9#iC̲XKK(7:Ͷl?y6`ؒ!NjH6r]]- LΡ(گnSUpr7NbK9yvfpӖ|ohNE!fZHM hݒ}1DʬlpR)l)xǒ)Ҧ/8|D?q421RҞJsǮ,*+M*mc#)q:& eYOB27QU6kwl^>ŎSgjh*RJƖh+VaIɴ<!0d֔~ ?K881*ɻ=|w Z@Ɩt3(1M2(Mjx;w7,FB&nxam6VBĢB9NYY ):i ưm,)I6'-ȩR`0`|'P%Ђ::E-aX *I6 -yJeIIaLu }öOЕV4LJX}AҲqNRJ~.Urr\~)f[4!%onaˉiKE@שrIZ6q ;kBЕ`ْP&úp?#hB0)Ĕ1x(2xT`,X0_or̂-GhKm> 7du8̛]zܜ=,օ#<lFiI&y`^Mc"1 J'}aٷmx ϴjt'ZZhJ$P@WaM ++xr-(/w3cw<*P}}R";wP^3IJ)׬ߨUu;λl2h]/G$ɟ*2Y,k)<ӒRBlBu!jQ4m!|QEQ޵m);sT\M$52YR6)m>N?O?}6 (Jr0UJY"X'X,2S(!˖ri@mY3r(;/bرRc^!D|0 lEQ]=qm~xweܹx<v;"rzAQ(ʱ^o!P!e]N[p!G?1^W+// 7x# . %1

%2
%3
madman-0.93/httpd/webdata/play.png0000644000175000001440000000043410053135242016655 0ustar akusers00000000000000PNG  IHDRRPLTEff33f+[/tRNSbKGDhQ=IDATxc`8C1La eCP1 Xj"@9 P] 0jr(+A#$WtEXtcommentCopyright 2000 by Sun Microsystems, Inc. All Rights Reserved. JLF GR Ver 1.0 IENDB`madman-0.93/httpd/webdata/play_eventually.png0000644000175000001440000000035610053135242021130 0ustar akusers00000000000000PNG  IHDRRPLTEff33f3ctRNS@fbKGDH pHYs  ~tIME3(OIDATxU 0P&,p3AȉkY-_S[A̖}h8h3X >'W 2 L9N@IENDB`madman-0.93/httpd/webdata/play_next.png0000644000175000001440000000035110053135242017711 0ustar akusers00000000000000PNG  IHDRRPLTEff33f3ctRNS@fbKGDH pHYs  ~tIME .!JIDATxc`14p !C%ccPT21@@0qqrq1 0c , h r_IENDB`madman-0.93/httpd/webdata/play_next.xcf0000644000175000001440000000315010053135242017705 0ustar akusers00000000000000gimp xcf v001 ff33fBB"!Next2     1EU   (        # Eventually            S    Arrow     O c s Background             madman-0.93/httpd/webdata/save.png0000644000175000001440000000044010053135242016643 0ustar akusers00000000000000PNG  IHDR7bKGD#2vIDATxڕA CoiLz˙B0eA&͘?&ՔaptBq) FZ%1tڂ \)%!5bطK֛ oO-6"m91$MIJWtEXtcommentCopyright 2000 by Sun Microsystems, Inc. All Rights Reserved. JLF GR Ver 1.0 IENDB`madman-0.93/httpd/webdata/stream.png0000644000175000001440000000053510053135242017205 0ustar akusers00000000000000PNG  IHDRR0PLTE00a==neennyyž===000Ҏ~tRNS AbKGDHiIDATxcP V1@ ]>N> jCÖC zv.,ĠvJC#@y3f(Dz;;!"22ju)))dQb3 tKeysList; tKeysList KeysList; public: tAcceleratorListView(QWidget *parent = 0, const char *name = "", WFlags f = 0 ); ~tAcceleratorListView(); void addShortCut(tKeyboardShortCut *sc); void keyPressEvent (QKeyEvent * e); }; class tAcceleratorTable : public QTable { typedef QTable super; typedef vector tKeysList; tKeysList KeysList; public: tAcceleratorTable(QWidget *parent = 0, const char *name = ""); ~tAcceleratorTable(); void addShortCut(tKeyboardShortCut *sc); void keyPressEvent (QKeyEvent * e); }; #endif madman-0.93/ui/auto_tag.h0000644000175000001440000000173110053135241015041 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2004 Andreas Kloeckner 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 HEADER_SEEN_AUTO_TAG_H #define HEADER_SEEN_AUTO_TAG_H #include "utility/base.h" class tDatabase; class QWidget; void showAutoTagger(QWidget *parent, const tSongList &songs, tDatabase &db); #endif madman-0.93/ui/dirlist.h0000644000175000001440000000265010053135241014711 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 HEADER_SEEN_DIRLIST_H #define HEADER_SEEN_DIRLIST_H #include #include "utility/base.h" class QWidget; class QListBox; class QPushButton; class tDirectoryListManager : public QObject { Q_OBJECT; QWidget *Parent; tDirectoryList &DirectoryList; QListBox *ListBox; QPushButton *AddButton; QPushButton *RemoveButton; public: tDirectoryListManager(QWidget *parent, tDirectoryList &dir_list, QListBox *lstbox, QPushButton *add_button, QPushButton *remove_button); tDirectoryList &directoryList(); public slots: void add(); void remove(); void update(); signals: void changed(); }; #endif madman-0.93/ui/mainwin.h0000644000175000001440000001211310053135241014674 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 MAINWIN #define MAINWIN #include #include #include #include #include "designer/mainwin.h" #include "database/database.h" #include "httpd/httpd.h" #include "httpd/madmanweb_external.h" #include "utility/prefs.h" #include "ui/prefs_dialog.h" #include "ui/song_set_view.h" #include "ui/overview.h" #include "ui/program_interface.h" class tPlaylistNodeListViewItem; class tProgress; class TrayIcon; class tMainWindow : public tMainWindowBase, public tProgramInterface { Q_OBJECT; auto_ptr Database; tSearchSongSet SearchSongSet; tSearchViewManager SearchViewManager; tPlaylistViewManager PlaylistEditor; auto_ptr SearchCriterion; QSettings Settings; tPreferences Preferences; QString CurrentFilename; bool FilenameValid; tFilename CurrentSongFilename; double AccumulatedPlayTime; time_t PlayStartTime; bool WasPlaying; QTimer UpdateTimer; tProgress *CurrentSearchProgress; tHttpDaemon *HttpDaemon; TrayIcon *SystemTrayIcon; tOverviewManager OverviewManager; public: tMainWindow(const QString &filename_to_open); virtual ~tMainWindow(); void setDatabase(tDatabase *db); void closeEvent(QCloseEvent *event); void updateWindowCaption(); void updateAll(); void realizeSystemTrayIconSettings(); void realizeHttpdSettings(); tDatabase &database() { return *Database; } tPreferences &preferences() { return Preferences; } QSettings &settings() { return Settings; } void quitApplication(); void setStatus(const QString &status); public slots: void rescan(); void rescan(tDatabase *db); void rereadTags(); void startNewDatabase(); void fileNew(); void fileOpen(); void saveDatabase(const QString &name); void fileSave(); bool fileSaveWithResult(); void fileSaveAs(); bool fileSaveAsWithResult(); void showPreferences(tDatabase *db, int tab); void filePreferences(); void helpAbout(); void help(); void rateCurrentSong(int rating); void rateNone() { rateCurrentSong(-1); } void rate0() { rateCurrentSong(0); } void rate1() { rateCurrentSong(1); } void rate2() { rateCurrentSong(2); } void rate3() { rateCurrentSong(3); } void rate4() { rateCurrentSong(4); } void rate5() { rateCurrentSong(5); } void addPlaylist(tPlaylistNode *node, tPlaylistNode *parent); void addPlaylist(); void bookmarkCurrentSearch(); void importPlaylist(); void duplicatePlaylist(); void removePlaylist(); void editMultilinePlaylistCriterion(); void slotDropPlaylistNode(const QString &node, tPlaylistNode *onto); void renamePlaylist(QListViewItem *item, int col, const QString &text); void songSetSelectionChanged(); void songSetCriterionChanged(); void noticeSongSetChanged(); void add(tSongList const &songlist); void searchChanged(); void searchChanged(const QString &text) { searchChanged(); } void buildOverviewTree(); void overviewSelectionChanged(QListViewItem *item); void highlightCurrentSong(); void play(); void pause(); void stop(); void skipForward(); void skipBack(); void skipTo(int value); void skipToWrapper(); void updatePlayerStatus(); void songOrStateChanged(); void trayIconClicked(const QPoint&, int); private slots: void updatePlaylistTree(); private: void updatePlaylistTree(bool keep_selection, bool keep_scroll); tPlaylistNode *nodeFromItem(QListViewItem *item); tPlaylistNode *currentNode(); tPlaylist *currentPlaylist(); void insertAtPosition(QListViewItem *parent, QListViewItem *item, tIndex pos); QListViewItem *createPlaylistNodeItem(tPlaylistNode *node, QListViewItem *parent, tPlaylistNode *selected_node, tPlaylistNodeListViewItem *&selected_item); void loadSplitterAppearance(QSplitter *splitter, QSettings &settings, QString const &where); void saveSplitterAppearance(QSplitter *splitter, QSettings &settings, QString const &where); void showEvent(QShowEvent *e); void hideEvent(QHideEvent *e); void updateTrayIconStatus(); void updateRatingButtons(); private slots: void noticeSongModified(const tSong *song, tSongField field); }; #endif madman-0.93/ui/multiline.h0000644000175000001440000000173710053135241015246 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 _HEADER_SEEN_MULTILINE_H #define _HEADER_SEEN_MULTILINE_H #include #include bool multilineEdit(const QString &caption, const QString &label, QString &value, QWidget *parent); #endif madman-0.93/ui/overview.h0000644000175000001440000000637410053135241015114 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 HEADER_SEEN_OVERVIEW_H #define HEADER_SEEN_OVERVIEW_H #include "utility/base.h" #include class tDatabase; class tMainWindow; class QPopupMenu; class tOverviewItem : public QListViewItem { QString Criterion; public: tOverviewItem(QListView *view, QListViewItem *after, const QString &label, const QString &criterion); tOverviewItem(QListViewItem *parent, QListViewItem *after, const QString &label, const QString &criterion); const QString &criterion() const { return Criterion; } }; class tExpandableOverviewItem : public tOverviewItem { bool HasExpanded; public: tExpandableOverviewItem(QListView *view, QListViewItem *after, const QString &label, const QString &criterion); tExpandableOverviewItem(QListViewItem *parent, QListViewItem *after, const QString &label, const QString &criterion); void setOpen(bool o); virtual void addExpansion(); }; class tArtistsOverviewItem : public tExpandableOverviewItem { tDatabase &Database; public: tArtistsOverviewItem(tDatabase &database, QListView *view, QListViewItem *after, const QString &label, const QString &criterion); tArtistsOverviewItem(tDatabase &database, QListViewItem *parent, QListViewItem *after, const QString &label, const QString &criterion); void addExpansion(); }; class tAlbumOverviewItem : public tExpandableOverviewItem { tDatabase &Database; public: tAlbumOverviewItem(tDatabase &database, QListView *view, QListViewItem *after, const QString &label, const QString &criterion); tAlbumOverviewItem(tDatabase &database, QListViewItem *parent, QListViewItem *after, const QString &label, const QString &criterion); void addExpansion(); }; class tGenreOverviewItem : public tExpandableOverviewItem { tDatabase &Database; public: tGenreOverviewItem(tDatabase &database, QListView *view, QListViewItem *after, const QString &label, const QString &criterion); tGenreOverviewItem(tDatabase &database, QListViewItem *parent, QListViewItem *after, const QString &label, const QString &criterion); void addExpansion(); }; class tOverviewManager : public QObject { Q_OBJECT; QListView &ListView; tMainWindow *MainWindow; QPopupMenu *Menu; public: tOverviewManager(QListView &listview, tMainWindow *mw); QPopupMenu *buildPopupMenu(); public slots: void contextMenuRequested (QListViewItem * item, const QPoint & pos, int col); void slotPlayNow(); void slotPlayNext(); void slotPlayEventually(); }; #endif madman-0.93/ui/passive_popup.h0000644000175000001440000000251710053135241016136 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 _HEADER_SEEN_PASSIVE_POPUP #define _HEADER_SEEN_PASSIVE_POPUP #include #include class tPassivePopup : public QObject { Q_OBJECT static tPassivePopup *CurrentPopup; int ShownMilliseconds; enum tState { APPEARING, SHOWING, DISAPPEARING } State; QTimer MyTimer; int StateMilliseconds; int TotalStateMilliseconds; QWidget *Widget; public: tPassivePopup(const QString &text, unsigned msec); ~tPassivePopup(); public slots: void timer(); }; #endif madman-0.93/ui/prefs_dialog.h0000644000175000001440000000210610053135241015671 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 HEADER_SEEN_PREFS_DIALOG_H #define HEADER_SEEN_PREFS_DIALOG_H #include "ui/dirlist.h" class tMainWindow; class QSettings; class tPreferences; pair editPreferences(tMainWindow *mainwin, tPreferences &prefs, tDirectoryList &media_dir_list, QSettings &settings, int starting_tab = 0); #endif madman-0.93/ui/program_interface.h0000644000175000001440000000230310053135241016721 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 _HEADER_SEEN_PROGRAM_INTERFACE_H #define _HEADER_SEEN_PROGRAM_INTERFACE_H class tDatabase; class tPreferences; class QSettings; class tProgramInterface { public: virtual ~tProgramInterface() { } virtual void setStatus(const QString &status) = 0; virtual QSettings &settings() = 0; virtual tDatabase &database() = 0; virtual tPreferences &preferences() = 0; virtual void quitApplication() = 0; }; #endif madman-0.93/ui/progress_impl.h0000644000175000001440000000473510053135241016132 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2004 Andreas Kloeckner 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 HEADER_SEEN_PROGRESS_IMPL #define HEADER_SEEN_PROGRESS_IMPL #include #include #include "utility/progress.h" class tCancellableSimpleProgress : public tProgress { bool Cancelled; int Counter; public: tCancellableSimpleProgress() : Cancelled(false), Counter(0) { } void processEvents() { if (++Counter == 10) { Counter = 0; qApp->processEvents(); } } bool wasCancelled() { return Cancelled; } void cancel() { Cancelled = true; } }; class tCancellableStatusBarProgress : public tCancellableSimpleProgress { QStatusBar *StatusBar; public: tCancellableStatusBarProgress(QStatusBar *bar) : StatusBar(bar) { } ~tCancellableStatusBarProgress() { StatusBar->clear(); } void setWhat(const QString &what) { StatusBar->message(what); } }; class tProgressDialog : public tProgress { auto_ptr Progress; public: tProgressDialog(QWidget *widget, bool cancellable) : Progress(new QProgressDialog(widget, "progress", true)) { if (!cancellable) Progress->setCancelButtonText(QString::null); Progress->setAutoReset(false); Progress->setAutoClose(false); Progress->setMinimumDuration(0); Progress->setProgress(0); } bool wasCancelled() { return Progress->wasCancelled(); } void processEvents() { qApp->processEvents(); } int progress() { return Progress->progress(); } void setProgress(int p) { Progress->setProgress(p); } void setTotalSteps(int p) { Progress->setTotalSteps(p); } void setWhat(const QString &what) { Progress->setLabelText(what); } }; #endif madman-0.93/ui/set_list_view.h0000644000175000001440000000302410053135241016113 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 _HEADER_SEEN_SET_LIST_VIEW_H #define _HEADER_SEEN_SET_LIST_VIEW_H #include class tPlaylistNode; class tPlaylistNodeListViewItem : public QObject, public QListViewItem { Q_OBJECT tPlaylistNode *Node; public: tPlaylistNodeListViewItem(QListView *view, tPlaylistNode *node); tPlaylistNodeListViewItem(QListViewItem *item, tPlaylistNode *node); tPlaylistNode *node(); bool acceptDrop(const QMimeSource *mime) const; void dropped(QDropEvent *drop); signals: void dropNode(const QString &node, tPlaylistNode *onto); }; class tSetListView : public QListView { typedef QListView super; public: tSetListView(QWidget *parent = 0, const char *name = "", WFlags f = 0); QDragObject *dragObject(); }; #endif madman-0.93/ui/song_set_view.h0000644000175000001440000002257710053135241016124 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 SONG_SET_VIEW #define SONG_SET_VIEW #include #include #include #include #include "database/song_set.h" #include "ui/accel_list_view.h" class tPreferences; class tSongSetViewManager; class tProgramInterface; typedef vector tIndexList; class tSongRetag { public: tSongField Field; QString NewText; void executeOn(tSong *song); }; class tDeferredSongRetag : public QObject { Q_OBJECT; public: tSong *Song; tSongRetag Retag; public slots: void execute(); }; class tSongListView; class tVisibilityAction : public QAction { Q_OBJECT tSongListView *ListView; tSongField Field; public: tVisibilityAction(QObject *parent, tSongListView *view, tSongField field); public slots: void onToggle(bool on); }; class tSongListView : public tAcceleratorTable { typedef tAcceleratorTable super; Q_OBJECT; tSongList SongList; int ShownColumns; vector FieldToColumn; vector ColumnToField; vector FieldWidths; QIntDict WidgetDictionary; bool SortIndicatorEnable, IndicatorAscending; tSongField SortIndicatorField; tProgramInterface *ProgramInterface; QPopupMenu *FieldVisibilityMenu; public: tSongListView(QWidget *parent = 0, const char *name = ""); void saveListViewAppearance(QSettings &settings, const QString &prefix); void loadListViewAppearance(QSettings &settings, const QString &prefix); void setup(); void setProgramInterface(tProgramInterface *pi); void setSongList(const tSongList &list, bool preserve_scroll_pos); tSong *highlightedSong(); void highlightSong(tSong *song); void getSelection(tSongList &songlist) const; void getSelection(tIndexList &indexlist) const; void setSongDropEnable(bool enabled); void setSortIndicator(bool enable, tSongField field, bool ascending); void columnWidthChanged(int col); void swapColumns (int col1, int col2, bool swapHeader = false); void sortColumn (int col, bool ascending = TRUE, bool wholeRows = FALSE); bool isFieldVisible(tSongField field); void showField(tSongField field); void hideField(tSongField field); public slots: void slotContextMenuRequested (int row, int col, const QPoint & pos); void currentSongChanged(); public: // sparse QTable implementation ------------------------------------------- void resizeData(int) {} QTableItem *item(int r, int c); void setItem(int r, int c, QTableItem *i); void takeItem(QTableItem *item); void clearCell(int r, int c); void insertWidget(int r, int c, QWidget *w); QWidget *cellWidget(int r, int c) const; void clearCellWidget(int r, int c); QWidget *createEditor (int row, int col, bool initFromCell) const; void setCellContentFromEditor (int row, int col); void paintCell(QPainter *p, int row, int col, const QRect & cr, bool selected, const QColorGroup & cg); public slots: void noticeSongModified(const tSong *song, tSongField field); protected: bool eventFilter (QObject * watched, QEvent * e); void contentsDragEnterEvent(QDragEnterEvent *event); void contentsDragMoveEvent(QDragMoveEvent *event); void contentsDropEvent(QDropEvent *event); void contentsMousePressEvent (QMouseEvent *e); void contentsMouseReleaseEvent (QMouseEvent *e); QDragObject *dragObject(); void showSortIndicator(); signals: void songsDropped(bool from_same_widget, tSong *onto, vector &songs); void fieldChanged(tSong *song, tSongField field, const QString &new_text); void contextMenuRequested(tSong *song, tSongField field, const QPoint &pos); void doubleClicked(tSong *); void sortingChanged(tSongField field, bool ascending); }; class tSongSetViewManager : public QObject { Q_OBJECT; protected: tSongListView &ListView; auto_ptr Menu; tProgramInterface &ProgramInterface; bool LastRetagValid; tSongRetag LastRetag; QString PreferencesPrefix; hash_map MenuIdToPluginFilenameMap; enum tPlayWhen { PLAY_NOW, PLAY_NEXT, PLAY_EVENTUALLY }; public: tSongSetViewManager(tSongListView &lv, tProgramInterface &pi, const QString & pref_prefix); virtual void setup(); virtual void saveListViewAppearance(QSettings &settings); virtual void loadListViewAppearance(QSettings &settings); virtual tSongSet *songSet() = 0; void changeSongSet(tSongSet *from, tSongSet *to); virtual QPopupMenu *buildPopupMenu(); public slots: void noticeSongSetModified(bool substantial_change, tProgress *progress); virtual void redisplay(bool preserve_scroll_pos, tProgress *progress = NULL); void fieldChanged(tSong *item, tSongField field, const QString &new_text); void contextMenuRequested(tSong *song, tSongField field, const QPoint &pos); void slotEditThisTag(); void slotPlayNow(); void slotPlayNow(tSong *song); void slotPlayNext(); void slotPlayEventually(); void slotAutoDJ(); void rateNone() { rate(-1); } void rate0() { rate(0); } void rate1() { rate(1); } void rate2() { rate(2); } void rate3() { rate(3); } void rate4() { rate(4); } void rate5() { rate(5); } void rate(int rating); void viewByCriterion(const QString &crit); void playByCriterion(const QString &crit, tPlayWhen when); void playNowAllByThisArtist() { playByCriterion(getCurrentArtistCriterion(), PLAY_NOW); } void playNextAllByThisArtist() { playByCriterion(getCurrentArtistCriterion(), PLAY_NEXT); } void playEventuallyAllByThisArtist() { playByCriterion(getCurrentArtistCriterion(), PLAY_EVENTUALLY); } void viewAllByThisArtist() { viewByCriterion(getCurrentArtistCriterion()); } void playNowAllOnThisAlbum() { playByCriterion(getCurrentAlbumCriterion(), PLAY_NOW); } void playNextAllOnThisAlbum() { playByCriterion(getCurrentAlbumCriterion(), PLAY_NEXT); } void playEventuallyAllOnThisAlbum() { playByCriterion(getCurrentAlbumCriterion(), PLAY_EVENTUALLY); } void viewAllOnThisAlbum() { viewByCriterion(getCurrentAlbumCriterion()); } void resetStatistics(); void deleteFromDisk(); void highlightCurrentSong(); void autoTag(); void redoRetag(); void rereadTag(); void rewriteTag(); void stripTag(); void highlight(tSong *song); void pluginActivated(int id); void selectionChanged(); virtual void sortingChanged(tSongField field, bool ascending) { } signals: void notifySearchChangeRequested(const QString &); void notifySongSetChanged(); protected: QString getCurrentArtistCriterion(); QString getCurrentAlbumCriterion(); friend class tSongListViewItem; }; class tPlaylistViewManager : public tSongSetViewManager { Q_OBJECT typedef tSongSetViewManager super; tPlaylist *Playlist; public: tPlaylistViewManager(tSongListView &lv, tProgramInterface &pi, const QString & pref_prefix); QPopupMenu *buildPopupMenu(); tSongSet *songSet() { return Playlist; } tPlaylist *playlist() { return Playlist; } void setSongSet(tPlaylist *pl); public slots: void removeSelected(); void uploadPlaylist(); void downloadPlaylist(); void importM3U(); void sortBy(tSongField field); void jumble(); void reverse(); void sortByArtist() { sortBy(FIELD_ARTIST); } void sortByTitle() { sortBy(FIELD_TITLE); } void sortByAlbum() { sortBy(FIELD_ALBUM); } void sortByTrackNumber() { sortBy(FIELD_TRACKNUMBER); } void sortByYear() { sortBy(FIELD_YEAR); } void sortByGenre() { sortBy(FIELD_GENRE); } void songsDropped(bool from_same_widget, tSong *onto, vector &songs); void sortingChanged(tSongField field, bool ascending); }; class tSearchViewManager : public tSongSetViewManager { Q_OBJECT typedef tSongSetViewManager super; tSearchSongSet *SearchSongSet; bool DoDisplaySort; tSongField SortField; bool Ascending; public: tSearchViewManager(tSongListView &lv, tProgramInterface &pi, const QString & pref_prefix); void saveListViewAppearance(QSettings &settings); void loadListViewAppearance(QSettings &settings); QPopupMenu *buildPopupMenu(); tSongSet *songSet() { return SearchSongSet; } tSearchSongSet *searchSongSet() { return SearchSongSet; } void setSongSet(tSearchSongSet *ss); void redisplay(bool preserve_scroll_pos, tProgress *progress = NULL); public slots: void slotAdd(); void sortingChanged(tSongField field, bool ascending); signals: void add(tSongList const &); }; #endif madman-0.93/ui/trayicon.h0000644000175000001440000000444210053135241015070 0ustar akusers00000000000000/* * trayicon.h - system-independent trayicon class (adapted from Qt example) * Copyright (C) 2003 Justin Karneges * * 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 * */ #ifndef CS_TRAYICON_H #define CS_TRAYICON_H #include #include class QPopupMenu; class TrayIcon : public QObject { Q_OBJECT Q_PROPERTY(QString toolTip READ toolTip WRITE setToolTip) Q_PROPERTY(QPixmap icon READ icon WRITE setIcon) public: TrayIcon(QObject *parent = 0, const char *name = 0); TrayIcon(const QPixmap &, const QString &, QPopupMenu *popup = 0, QObject *parent = 0, const char *name = 0); ~TrayIcon(); // use WindowMaker dock mode. ignored on non-X11 platforms void setWMDock(bool use) { v_isWMDock = use; } bool isWMDock() { return v_isWMDock; } // Set a popup menu to handle RMB void setPopup(QPopupMenu *); QPopupMenu* popup() const; QPixmap icon() const; QString toolTip() const; void gotCloseEvent(); public slots: void setIcon(const QPixmap &icon); void setToolTip(const QString &tip); void show(); void hide(); signals: void clicked(const QPoint&, int); void doubleClicked(const QPoint&); void closed(); protected: bool event(QEvent *); virtual void mouseMoveEvent(QMouseEvent *e); virtual void mousePressEvent(QMouseEvent *e); virtual void mouseReleaseEvent(QMouseEvent *e); virtual void mouseDoubleClickEvent(QMouseEvent *e); private: QPopupMenu *pop; QPixmap pm; QString tip; bool v_isWMDock; // system-dependant part class TrayIconPrivate; TrayIconPrivate *d; void sysInstall(); void sysRemove(); void sysUpdateIcon(); void sysUpdateToolTip(); }; #endif // CS_TRAYICON_H madman-0.93/ui/trayicon_x11.h0000644000175000001440000001432510053135241015562 0ustar akusers00000000000000/* * trayicon_x11.cpp - X11 trayicon (for use with KDE and GNOME) * Copyright (C) 2003 Justin Karneges * GNOME2 Notification Area support: Tomasz Sterna * * 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 * */ #ifndef _HEADER_SEEN_TRAYICON_X11_H #define _HEADER_SEEN_TRAYICON_X11_H #include "trayicon.h" #include #include #include #include #include #include #include #include #include #include #include #define SYSTEM_TRAY_REQUEST_DOCK 0 #define SYSTEM_TRAY_BEGIN_MESSAGE 1 #define SYSTEM_TRAY_CANCEL_MESSAGE 2 static bool send_message( Display* dpy, /* display */ Window w, /* sender (tray icon window) */ long message, /* message opcode */ long data1, /* message data 1 */ long data2, /* message data 2 */ long data3 /* message data 3 */ ); class TrayIcon::TrayIconPrivate : public QWidget { public: TrayIconPrivate(TrayIcon *object, const QPixmap &pm, bool _isWMDock) : QWidget(NULL, "psidock", WType_TopLevel | WStyle_Customize | WStyle_NoBorder | WStyle_StaysOnTop | WMouseNoMask), iconObject(object) // : QLabel(0, "psidock", WMouseNoMask), iconObject(object) { isWMDock = _isWMDock; inNetTray = false; bInit = false; inTray = false; setMinimumSize(22, 22); setPixmap(pm); Display *dsp = x11Display(); // get the display WId win = winId(); // get the window XClassHint classhint; classhint.res_name = (char*)"psidock"; classhint.res_class = (char*)"Wharf"; XSetClassHint(dsp, win, &classhint); XWMHints *hints; // hints hints = XGetWMHints(dsp, win); // init hints hints->initial_state = WithdrawnState; hints->icon_x = 0; hints->icon_y = 0; hints->icon_window = winId(); hints->window_group = win; // set the window hint hints->flags = WindowGroupHint | IconWindowHint | IconPositionHint | StateHint; // set the window group hint XSetWMHints(dsp, win, hints); // set the window hints for WM to use. XFree(hints); // WindowMaker if(isWMDock) { //QPixmap pix = pm; //setPixmap(pix); resize(64,64); update(); /*Display *dsp = x11Display(); // get the display WId win = winId(); // get the window //XClassHint classhint; // class hints //classhint.res_name = "psidock"; // res_name //classhint.res_class = "Wharf"; // res_class //XSetClassHint(dsp, win, &classhint); // set the class hints XWMHints *hints; // hints hints = XGetWMHints(dsp, win); // init hints hints->initial_state = WithdrawnState; hints->icon_x = 0; hints->icon_y = 0; hints->icon_window = winId(); //wharfIcon->winId(); hints->window_group = win; // set the window hint hints->flags = WindowGroupHint | IconWindowHint | IconPositionHint | StateHint; // set the window group hint XSetWMHints(dsp, win, hints); // set the window hints for WM to use. XFree(hints);*/ } // KDE/GNOME else { setWFlags(WRepaintNoErase); //QPixmap pix = pm; //buildIcon(pm); //setPixmap(pix); resize(22,22); update(); //setMask(*pix.mask()); /*// dock the widget (adapted from Gabber / gdk) Display *dsp = x11Display(); // get the display WId win = winId(); // get the window int r; int data = 1; r = XInternAtom(dsp, "KWM_DOCKWINDOW", false); XChangeProperty(dsp, win, r, r, 32, 0, (uchar *)&data, 1); r = XInternAtom(dsp, "_KDE_NET_WM_SYSTEM_TRAY_WINDOW_FOR", false); XChangeProperty(dsp, win, r, XA_WINDOW, 32, 0, (uchar *)&data, 1);*/ inNetTray = false; // dock the widget (adapted from SIM-ICQ) Screen *screen = XDefaultScreenOfDisplay (dsp); // get the screen int screen_id = XScreenNumberOfScreen(screen); // and it's number char buf[32]; snprintf(buf, sizeof(buf), "_NET_SYSTEM_TRAY_S%d", screen_id); Atom selection_atom = XInternAtom(dsp, buf, false); XGrabServer(dsp); Window manager_window = XGetSelectionOwner(dsp, selection_atom); if (manager_window != None) XSelectInput(dsp, manager_window, StructureNotifyMask); XUngrabServer(dsp); XFlush(dsp); if (manager_window != None){ inNetTray = true; if (!send_message(dsp, manager_window, SYSTEM_TRAY_REQUEST_DOCK, win, 0, 0)){ inNetTray = false; } } Atom kwm_dockwindow_atom = XInternAtom(dsp, "KWM_DOCKWINDOW", false); Atom kde_net_system_tray_window_for_atom = XInternAtom(dsp, "_KDE_NET_WM_SYSTEM_TRAY_WINDOW_FOR", false); long data[1]; data[0] = 0; XChangeProperty(dsp, win, kwm_dockwindow_atom, kwm_dockwindow_atom, 32, PropModeReplace, (unsigned char*)data, 1); XChangeProperty(dsp, win, kde_net_system_tray_window_for_atom, XA_WINDOW, 32, PropModeReplace, (unsigned char*)data, 1); resize(22, 22); if (!inNetTray) { move(-21, -21); } show(); } } ~TrayIconPrivate() { } void mouseMoveEvent(QMouseEvent *e) { QApplication::sendEvent(iconObject, e); } void mousePressEvent(QMouseEvent *e) { QApplication::sendEvent(iconObject, e); } void mouseReleaseEvent(QMouseEvent *e) { QApplication::sendEvent(iconObject, e); } void mouseDoubleClickEvent(QMouseEvent *e) { QApplication::sendEvent(iconObject, e); } void closeEvent(QCloseEvent *e) { iconObject->gotCloseEvent(); e->accept(); } void paintEvent(QPaintEvent*) { QPainter p(this); p.drawPixmap((width() - pix.width())/2, (height() - pix.height())/2, pix); } inline void setPixmap (const QPixmap & pm) { pix = pm; } bool x11Event(XEvent *e); QPixmap pix; TrayIcon *iconObject; bool isWMDock; bool inNetTray; bool inTray; bool bInit; }; #endif madman-0.93/ui/accel_list_view.cpp0000644000175000001440000000523010053135241016723 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "accel_list_view.h" #include "utility/base.h" tKeyboardShortCut::tKeyboardShortCut(const QKeySequence &keys) : Keys(keys) { } tKeyboardShortCut::tKeyboardShortCut(const QKeySequence &keys, QObject *o, const char *slot) : Keys(keys) { connect(this, SIGNAL(triggered()), o, slot); } bool tKeyboardShortCut::processKeyEvent(QKeyEvent *e) { int accel_state = 0; if (e->state() & ShiftButton) accel_state |= SHIFT; if (e->state() & ControlButton) accel_state |= CTRL; if (e->state() & MetaButton) accel_state |= META; if (e->state() & AltButton) accel_state |= ALT; if (QKeySequence(accel_state | e->key()) == Keys) { emit triggered(); return true; } else return false; } // tAcceleratorListView ------------------------------------------------------- tAcceleratorListView::tAcceleratorListView(QWidget *parent, const char *name, WFlags f) : super(parent, name, f) { } tAcceleratorListView::~tAcceleratorListView() { FOREACH(first, KeysList, tKeysList) delete *first; } void tAcceleratorListView::addShortCut(tKeyboardShortCut *sc) { KeysList.push_back(sc); } void tAcceleratorListView::keyPressEvent (QKeyEvent * e) { if (hasFocus()) { FOREACH(first, KeysList, tKeysList) if ((*first)->processKeyEvent(e)) return; } super::keyPressEvent(e); } // tAcceleratorTable ---------------------------------------------------------- tAcceleratorTable::tAcceleratorTable(QWidget *parent, const char *name) : super(parent, name) { } tAcceleratorTable::~tAcceleratorTable() { FOREACH(first, KeysList, tKeysList) delete *first; } void tAcceleratorTable::addShortCut(tKeyboardShortCut *sc) { KeysList.push_back(sc); } void tAcceleratorTable::keyPressEvent(QKeyEvent * e) { if (hasFocus()) { FOREACH(first, KeysList, tKeysList) if ((*first)->processKeyEvent(e)) return; } super::keyPressEvent(e); } madman-0.93/ui/auto_tag.cpp0000644000175000001440000004137710053135241015406 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2004 Andreas Kloeckner 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 #include #include #include #include #include "database/database.h" #include "database/song.h" #include "database/song_set.h" #include "ui/auto_tag.h" #include "ui/progress_impl.h" #include "designer/auto_tag.h" namespace { struct tSongChange; struct tTagChange { tSongField Field; QString NewValue; }; typedef vector tTagChangeList; struct tSongChange { tSong *Song; QString Message; tTagChangeList ProposedChanges; const QString &proposedChange(tSongField field) { FOREACH(first, ProposedChanges, tTagChangeList) if (first->Field == field) return first->NewValue; return QString::null; } void proposeChange(tSongField field, const QString &new_value, bool overwrite = false) { FOREACH(first, ProposedChanges, tTagChangeList) { if (first->Field == field) { if (overwrite) first->NewValue = new_value; return; } } tTagChange tch; tch.Field = field; tch.NewValue = new_value; ProposedChanges.push_back(tch); } }; typedef vector tSongChangeList; class tAutoTagAlgorithm { public: virtual ~tAutoTagAlgorithm() { } virtual QString name() = 0; virtual void reset() { } virtual void familiarize(tSong *song) { } virtual void generateChange(tSongChange &ch) = 0; }; class tArtistTitleAutoTagAlgorithm : public tAutoTagAlgorithm { public: QString name() { return qApp->translate("AutoTag", "Artist - Title"); } void generateChange(tSongChange &ch) { QRegExp dash_pattern("^([^-]+)\\s*\\-\\s*(.+)\\.[a-z0-9]+$"); dash_pattern.setCaseSensitive(false); dash_pattern.setMinimal(true); if (dash_pattern.exactMatch(QString::fromUtf8(ch.Song->filenameOnly().c_str()))) { ch.proposeChange(FIELD_ARTIST, dash_pattern.cap(1).stripWhiteSpace()); ch.proposeChange(FIELD_TITLE, dash_pattern.cap(2).stripWhiteSpace()); } } }; class tTitleArtistAutoTagAlgorithm : public tAutoTagAlgorithm { public: QString name() { return qApp->translate("AutoTag", "Title - Artist"); } void generateChange(tSongChange &ch) { QRegExp dash_pattern("^([^-]+)\\s*\\-\\s*(.+)\\.[a-z0-9]+$"); dash_pattern.setCaseSensitive(false); dash_pattern.setMinimal(true); if (dash_pattern.exactMatch(QString::fromUtf8(ch.Song->filenameOnly().c_str()))) { ch.proposeChange(FIELD_TITLE, dash_pattern.cap(1).stripWhiteSpace()); ch.proposeChange(FIELD_ARTIST, dash_pattern.cap(2).stripWhiteSpace()); } } }; class tIntelligentAutoTagAlgorithm : public tAutoTagAlgorithm { class tCaseInsensitiveEqual { QString Operand; public: tCaseInsensitiveEqual(const QString &str) : Operand(str.lower()) { } bool operator()(const QString &op2) { return op2.lower() == Operand; } }; tDatabase &Database; typedef hash_map tComponentCounts; tComponentCounts DirComponentCounts, NameComponentCounts; public: tIntelligentAutoTagAlgorithm(tDatabase &db) : Database(db) { } QString name() { return qApp->translate("AutoTag", "Intelligent"); } static void getComponents(const QString &filename, vector &dir_comp, vector &name_comp) { QFileInfo info(filename); QString basename_only = info.baseName(true); QDir dir(info.dirPath()); if (dir.dirName().length() >= 1) dir_comp.push_back(dir.dirName()); dir.cdUp(); if (dir.dirName().length() >= 1) dir_comp.push_back(dir.dirName()); if (basename_only.find(" - ") != -1) split(" - ", basename_only, name_comp); else if (basename_only.find(" _ ") != -1) split(" _ ", basename_only, name_comp); else if (basename_only.find("_") != -1) split("_", basename_only, name_comp); else if (basename_only.find("-") != -1) split("-", basename_only, name_comp); else name_comp.push_back(basename_only); FOREACH(first, name_comp, vector) { vector copy; remove_copy_if(dir_comp.begin(), dir_comp.end(), back_inserter(copy), tCaseInsensitiveEqual(*first)); dir_comp = copy; } } void reset() { NameComponentCounts.clear(); } void familiarize(tSong *song) { vector dir_components,name_components; getComponents(QString::fromUtf8(song->filename().c_str()), dir_components, name_components); FOREACH(first, dir_components, vector) { if (DirComponentCounts.find(*first) != DirComponentCounts.end()) ++DirComponentCounts[ *first ]; else DirComponentCounts[ *first ] = 1; } FOREACH(first, name_components, vector) { if (NameComponentCounts.find(*first) != NameComponentCounts.end()) ++NameComponentCounts[ *first ]; else NameComponentCounts[ *first ] = 1; } } bool isKnownAs(tSongField field, const QString &value) { tSearchSongSet set; set.setSongCollection(&Database.SongCollection); set.setCriterion( QString("~%1(complete:%2)") .arg(getFieldIdentifier(field)) .arg(quoteString(value))); set.reevaluateCriterion(); tSongList list; set.render(list); return list.size() != 0; } void generateChange(tSongChange &ch) { ch.ProposedChanges.clear(); vector dir_components,name_components; getComponents(QString::fromUtf8(ch.Song->filename().c_str()), dir_components, name_components); { // check for "definite knowledge" first vector::iterator first = name_components.begin(), last = name_components.end(); while (first != last) { bool ok,processed = true; (*first).toUInt(&ok); if (ok) ch.proposeChange(FIELD_TRACKNUMBER, *first); else if (isKnownAs(FIELD_ARTIST, *first)) ch.proposeChange(FIELD_ARTIST, *first); else if (isKnownAs(FIELD_ALBUM, *first)) ch.proposeChange(FIELD_ALBUM, *first); else processed = false; if (processed) { first = name_components.erase(first); last = name_components.end(); } else first++; } } { // check for "definite knowledge" on directories first vector::iterator first = dir_components.begin(), last = dir_components.end(); while (first != last) { bool processed = true; if (isKnownAs(FIELD_ARTIST, *first)) ch.proposeChange(FIELD_ARTIST, *first); else if (isKnownAs(FIELD_GENRE, *first)) ch.proposeChange(FIELD_GENRE, *first); else if (isKnownAs(FIELD_ALBUM, *first)) ch.proposeChange(FIELD_ALBUM, *first); else processed = false; if (processed) { first = dir_components.erase(first); last = dir_components.end(); } else first++; } } { // a name component that occurs multiple times will likely be an artist, // but could also be an album vector::iterator first = name_components.begin(), last = name_components.end(); while (first != last) { bool processed = false; if (NameComponentCounts.find(*first) != NameComponentCounts.end()) { if (NameComponentCounts[ *first ] >= 2) { ch.proposeChange(FIELD_ARTIST, name_components[ 0 ]); processed = true; } } if (processed) { first = name_components.erase(first); last = name_components.end(); } else first++; } } if (name_components.size() >= 3 ) ch.Message = qApp->translate("tAutoTagDialog", "This song can't be meaningfully tagged automatically."); // just consume the rest while (name_components.size()) { if (ch.proposedChange(FIELD_ARTIST).isNull() && name_components.size() > 1) ch.proposeChange(FIELD_ARTIST, name_components[ 0 ]); else if (ch.proposedChange(FIELD_TITLE).isNull()) ch.proposeChange(FIELD_TITLE, name_components[ 0 ]); else if (ch.proposedChange(FIELD_ARTIST).isNull()) ch.proposeChange(FIELD_ARTIST, name_components[ 0 ]); else if (ch.proposedChange(FIELD_ALBUM).isNull()) ch.proposeChange(FIELD_ALBUM, name_components[ 0 ]); else if (ch.proposedChange(FIELD_PERFORMER).isNull()) ch.proposeChange(FIELD_PERFORMER, name_components[ 0 ]); name_components.erase(name_components.begin()); } while (dir_components.size()) { if (ch.proposedChange(FIELD_ARTIST).isNull()) ch.proposeChange(FIELD_ARTIST, dir_components[ 0 ]); else if (ch.proposedChange(FIELD_ALBUM).isNull()) ch.proposeChange(FIELD_ALBUM, dir_components[ 0 ]); dir_components.erase(dir_components.begin()); } } }; class tTagChangeListViewItem : public QListViewItem { public: tUniqueId UniqueId; tSongField Field; tTagChangeListViewItem(QListViewItem *parent, tTagChange tch, tSong *song) : QListViewItem(parent, QString("%1 : %2") .arg(getFieldName(tch.Field)) .arg(tch.NewValue)), UniqueId(song->uniqueId()), Field(tch.Field) { } }; class tAutoTagDialog : public tAutoTagDialogBase { Q_OBJECT; const tSongList &Songs; static QString LastTaggingAlgorithm; typedef vector tAutoTagAlgorithmList; tAutoTagAlgorithmList AutoTagAlgorithmList; tSongChangeList SongChanges; public: tAutoTagDialog(QWidget *parent, const tSongList &songs, tDatabase &database) : Songs(songs) { AutoTagAlgorithmList.push_back(new tIntelligentAutoTagAlgorithm(database)); AutoTagAlgorithmList.push_back(new tArtistTitleAutoTagAlgorithm()); AutoTagAlgorithmList.push_back(new tTitleArtistAutoTagAlgorithm()); listPreview->header()->hide(); listPreview->setSorting(-1); FOREACH(first, AutoTagAlgorithmList, tAutoTagAlgorithmList) comboAlgorithm->insertItem((*first)->name()); if (!LastTaggingAlgorithm.isNull()) comboAlgorithm->setCurrentText(LastTaggingAlgorithm); connect(btnEditTag, SIGNAL(clicked()), this, SLOT(editTag())); connect(btnRemoveTag, SIGNAL(clicked()), this, SLOT(removeTag())); connect(btnPreview, SIGNAL(clicked()), this, SLOT(preview())); connect(btnApply, SIGNAL(clicked()), this, SLOT(apply())); connect(btnClear, SIGNAL(clicked()), this, SLOT(clear())); connect(listPreview, SIGNAL(doubleClicked(QListViewItem *,const QPoint &,int)), this, SLOT(doubleClicked(QListViewItem *,const QPoint &,int))); } ~tAutoTagDialog() { LastTaggingAlgorithm = comboAlgorithm->currentText(); FOREACH(first, AutoTagAlgorithmList, tAutoTagAlgorithmList) delete *first; } tAutoTagAlgorithm *getAlgorithm(const QString &name) { FOREACH(first, AutoTagAlgorithmList, tAutoTagAlgorithmList) if ((*first)->name() == name) return *first; return NULL; } tAutoTagAlgorithm *getAlgorithm() { return getAlgorithm(comboAlgorithm->currentText()); } public slots: void clear() { SongChanges.clear(); updateSongChanges(); btnApply->setEnabled(false); } void preview() { auto_ptr progress(new tProgressDialog(this, true)); progress->setWhat(tr("Generating tag changes...")); SongChanges.clear(); tAutoTagAlgorithm *algorithm = getAlgorithm(); progress->setTotalSteps(Songs.size() * 2); unsigned index = 0; algorithm->reset(); FOREACH_CONST(first, Songs, tSongList) { algorithm->familiarize(*first); index++; progress->setProgress(index); if (progress->wasCancelled()) { clear(); return; } } FOREACH_CONST(first, Songs, tSongList) { tSongChange ch; ch.Song = *first; algorithm->generateChange(ch); if (!ch.Message.isNull() || ch.ProposedChanges.size()) SongChanges.push_back(ch); index++; progress->setProgress(index); if (progress->wasCancelled()) { clear(); return; } } updateSongChanges(); btnApply->setEnabled(true); } void updateSongChangesKeepScroll() { int contents_x = listPreview->contentsX(); int contents_y = listPreview->contentsY(); updateSongChanges(); listPreview->setContentsPos(contents_x, contents_y); } void updateSongChanges() { listPreview->clear(); FOREACH(first, SongChanges, tSongChangeList) { QListViewItem *song_item = new QListViewItem(listPreview, QString::fromUtf8(first->Song->filenameOnly().c_str())); if (!first->Message.isNull()) new QListViewItem(song_item, first->Message); new QListViewItem(song_item, tr("Path to song: %1").arg( QString::fromUtf8(first->Song->pathname().c_str()))); FOREACH(first_t, first->ProposedChanges, tTagChangeList) new tTagChangeListViewItem(song_item, *first_t, first->Song); song_item->setOpen(true); } } void apply() { auto_ptr progress(new tProgressDialog(this, true)); progress->setWhat(tr("Applying tag changes...")); progress->setTotalSteps(SongChanges.size()); unsigned int index = 0; FOREACH(first, SongChanges, tSongChangeList) { progress->setProgress(index++); FOREACH(first_ch, first->ProposedChanges, tTagChangeList) first->Song->setFieldText(first_ch->Field, first_ch->NewValue); if (progress->wasCancelled()) return; } clear(); } tTagChangeList::iterator findCurrentTagChange(tSongChange *&sch) { QListViewItem *item = listPreview->selectedItem(); if (item == NULL) throw runtime_error("current tag change not found"); tTagChangeListViewItem *t_item = dynamic_cast(item); if (t_item == NULL) throw runtime_error("current tag change not found"); FOREACH(first, SongChanges, tSongChangeList) { if (first->Song->uniqueId() == t_item->UniqueId) FOREACH(first_t, first->ProposedChanges, tTagChangeList) if (first_t->Field == t_item->Field) { sch = &*first; return first_t; } } throw runtime_error("current tag change not found"); } void doubleClicked(QListViewItem *, const QPoint &, int) { editTag(); } void editTag() { tTagChangeList::iterator it; tSongChange *sch; try { it = findCurrentTagChange(sch); } catch (...) { return; } bool ok; QString result = QInputDialog::getText( tr("madman"), tr("New value for the '%1' field:").arg(getFieldName(it->Field)), QLineEdit::Normal, it->NewValue, &ok, this); if (ok) { it->NewValue = result; QTimer::singleShot(0, this, SLOT(updateSongChangesKeepScroll())); } } void removeTag() { tTagChangeList::iterator it; tSongChange *sch; try { it = findCurrentTagChange(sch); } catch (...) { return; } sch->ProposedChanges.erase(it); QTimer::singleShot(0, this, SLOT(updateSongChangesKeepScroll())); } }; QString tAutoTagDialog::LastTaggingAlgorithm; } void showAutoTagger(QWidget *parent, const tSongList &songs, tDatabase &database) { tAutoTagDialog adlg(parent, songs, database); adlg.exec(); } #include "moc_auto_tag.cc" madman-0.93/ui/dirlist.cpp0000644000175000001440000000415410053135242015246 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "dirlist.h" // tDirectoryListManager ------------------------------------------------------ tDirectoryListManager::tDirectoryListManager(QWidget *parent, tDirectoryList &dir_list, QListBox *lstbox, QPushButton *add_button, QPushButton *remove_button) : Parent(parent), DirectoryList(dir_list), ListBox(lstbox), AddButton(add_button),RemoveButton(remove_button) { update(); connect(AddButton, SIGNAL(clicked()), this, SLOT(add())); connect(RemoveButton, SIGNAL(clicked()), this, SLOT(remove())); } tDirectoryList &tDirectoryListManager::directoryList() { return DirectoryList; } void tDirectoryListManager::add() { QString dir = QFileDialog::getExistingDirectory(QString::null, Parent, tr("Add Directory")); if (dir == QString::null) return; DirectoryList.push_back((const char *) dir.utf8()); update(); emit changed(); } void tDirectoryListManager::remove() { if (ListBox->currentItem() < 0 || ListBox->currentItem() >= (int) DirectoryList.size()) return; DirectoryList.erase(DirectoryList.begin() + ListBox->currentItem()); update(); emit changed(); } void tDirectoryListManager::update() { ListBox->clear(); FOREACH_CONST(first, DirectoryList, tDirectoryList) ListBox->insertItem(QString::fromUtf8(first->c_str())); } madman-0.93/ui/mainwin.cpp0000644000175000001440000012351410053135242015240 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "mainwin.h" #include "utility/player.h" #include "utility/progress.h" #include "database/song_set.h" #include "database/criterion.h" #include "database/song_list_tools.h" #include "designer/helpbrowser.h" #include "ui/set_list_view.h" #include "ui/multiline.h" #include "ui/overview.h" #include "ui/trayicon.h" #include "ui/passive_popup.h" #include "ui/progress_impl.h" // tools ---------------------------------------------------------------------- namespace { } // tool functions ------------------------------------------------------------- QString getConfigFile() { passwd * pwd = getpwuid(getuid()); if (pwd->pw_dir) return QString(pwd->pw_dir) + "/.madmandb"; else return ".madmandb"; } // tMainWindow ---------------------------------------------------------------- tMainWindow::tMainWindow(const QString &filename_to_open) : SearchViewManager(*lstAllSongs, *this, "/madman/allsongsview"), PlaylistEditor(*lstSetEditor, *this, "/madman/songseteditor"), CurrentSearchProgress(NULL), HttpDaemon(NULL), SystemTrayIcon(NULL), OverviewManager(*lstOverview, this) { // load and realize prefs --------------------------------------------------- Preferences.load(Settings); SearchViewManager.loadListViewAppearance(Settings); PlaylistEditor.loadListViewAppearance(Settings); loadSplitterAppearance(splitter1, Settings, "/madman/splitters/splitter1.state"); loadSplitterAppearance(splitter2, Settings, "/madman/splitters/splitter2.state"); loadSplitterAppearance(splitter3, Settings, "/madman/splitters/splitter3.state"); // set up gui --------------------------------------------------------------- lstOverview->setSorting(-1); lstOverview->header()->hide(); lstSets->header()->hide(); lstSets->setAcceptDrops(true); lstSets->viewport()->setAcceptDrops(true); tbMain->setShown(Settings.readBoolEntry("/madman/main_toolbar_shown", 1)); tbMediaControl->setShown(Settings.readBoolEntry("/madman/media_control_toolbar_shown", 1)); tbRating->setShown(Settings.readBoolEntry("/madman/rating_toolbar_shown", 0)); if (Preferences.RememberGeometry) { { QString temp = Settings.readEntry("/madman/main_window_position"); if (!temp.isNull()) { int x,y; QTextIStream is(&temp); is >> x >> y; QPoint p(x,y); move(p); } } { QString temp = Settings.readEntry("/madman/main_window_size"); if (!temp.isNull()) { int x,y; QTextIStream is(&temp); is >> x >> y; QSize s(x,y); resize(s); } } } // various buttons ---------------------------------------------------------- connect(btnNewSet, SIGNAL(clicked()), this, SLOT(addPlaylist())); connect(btnBookmarkSet, SIGNAL(clicked()), this, SLOT(bookmarkCurrentSearch())); connect(btnImportSet, SIGNAL(clicked()), this, SLOT(importPlaylist())); connect(btnCopySet, SIGNAL(clicked()), this, SLOT(duplicatePlaylist())); connect(btnRemoveSet, SIGNAL(clicked()), this, SLOT(removePlaylist())); connect(btnEditSetCriterion, SIGNAL(clicked()), this, SLOT(editMultilinePlaylistCriterion())); connect(btnHelpAll, SIGNAL(clicked()), this, SLOT(help())); connect(btnHelpSet, SIGNAL(clicked()), this, SLOT(help())); connect(btnEditSetCriterion, SIGNAL(clicked()), this, SLOT(songSetCriterionChanged())); connect(btnUpdateSetCriterion, SIGNAL(clicked()), this, SLOT(songSetCriterionChanged())); // various UI events -------------------------------------------------------- connect(lstSets, SIGNAL(itemRenamed(QListViewItem *, int, const QString &)), this, SLOT(renamePlaylist(QListViewItem *, int, const QString &))); connect(lstSets, SIGNAL(selectionChanged()), this, SLOT(songSetSelectionChanged())); connect(editPlaylistCriterion, SIGNAL(returnPressed()), this, SLOT(songSetCriterionChanged())); connect(&SearchViewManager, SIGNAL(add (const tSongList &)), this, SLOT(add (const tSongList &))); connect(editSearch, SIGNAL(textChanged(const QString &)), this, SLOT(searchChanged(const QString &))); connect(lstOverview, SIGNAL(selectionChanged(QListViewItem *)), this, SLOT(overviewSelectionChanged(QListViewItem *))); connect(&SearchViewManager, SIGNAL(notifySearchChangeRequested(const QString &)), editSearch, SLOT(setText(const QString &))); connect(&PlaylistEditor, SIGNAL(notifySearchChangeRequested(const QString &)), editSearch, SLOT(setText(const QString &))); connect(&PlaylistEditor, SIGNAL(notifySongSetChanged()), this, SLOT(noticeSongSetChanged())); // menu --------------------------------------------------------------------- connect(fileNewAction, SIGNAL(activated()), this, SLOT(fileNew())); connect(fileOpenAction, SIGNAL(activated()), this, SLOT(fileOpen())); connect(fileSaveAction, SIGNAL(activated()), this, SLOT(fileSave())); connect(fileSaveAsAction, SIGNAL(activated()), this, SLOT(fileSaveAs())); connect(filePreferencesAction, SIGNAL(activated()), this, SLOT(filePreferences())); connect(fileExitAction, SIGNAL(activated()), this, SLOT(close())); connect(rescanAction, SIGNAL(activated()), this, SLOT(rescan())); connect(rereadTagsAction, SIGNAL(activated()), this, SLOT(rereadTags())); connect(updateOverviewAction, SIGNAL(activated()), this, SLOT(buildOverviewTree())); connect(helpAboutAction, SIGNAL(activated()), this, SLOT(helpAbout())); connect(helpAction, SIGNAL(activated()), this, SLOT(help())); connect(minimizeWindowAction, SIGNAL(activated()), this, SLOT(showMinimized())); connect(restoreWindowAction, SIGNAL(activated()), this, SLOT(showNormal())); connect(hideWindowAction, SIGNAL(activated()), this, SLOT(hide())); // player control ----------------------------------------------------------- connect(playAction, SIGNAL(activated()), this, SLOT(play())); connect(pauseAction, SIGNAL(activated()), this, SLOT(pause())); connect(stopAction, SIGNAL(activated()), this, SLOT(stop())); connect(skipForwardAction, SIGNAL(activated()), this, SLOT(skipForward())); connect(skipBackAction, SIGNAL(activated()), this, SLOT(skipBack())); connect(sbarSongPosition, SIGNAL(sliderMoved(int)), this, SLOT(skipTo(int))); connect(sbarSongPosition, SIGNAL(nextLine()), this, SLOT(skipToWrapper())); connect(sbarSongPosition, SIGNAL(prevLine()), this, SLOT(skipToWrapper())); connect(sbarSongPosition, SIGNAL(nextPage()), this, SLOT(skipToWrapper())); connect(sbarSongPosition, SIGNAL(prevPage()), this, SLOT(skipToWrapper())); connect(highlightSongAction, SIGNAL(activated()), this, SLOT(highlightCurrentSong())); // rating ------------------------------------------------------------------- connect(rate0Action, SIGNAL(activated()), this, SLOT(rate0())); connect(rate1Action, SIGNAL(activated()), this, SLOT(rate1())); connect(rate2Action, SIGNAL(activated()), this, SLOT(rate2())); connect(rate3Action, SIGNAL(activated()), this, SLOT(rate3())); connect(rate4Action, SIGNAL(activated()), this, SLOT(rate4())); connect(rate5Action, SIGNAL(activated()), this, SLOT(rate5())); // set up song set tree ----------------------------------------------------- lstSets->setAcceptDrops(true); lstSets->viewport()->setAcceptDrops(true); lstSets->setSorting(-1); // player state monitoring -------------------------------------------------- connect(&UpdateTimer, SIGNAL(timeout()), this, SLOT(updatePlayerStatus())); UpdateTimer.start(500); WasPlaying = false; AccumulatedPlayTime = 0; // load everything ---------------------------------------------------------- try { auto_ptr new_db(new tDatabase); CurrentFilename = filename_to_open; FilenameValid = !filename_to_open.isNull(); if (!FilenameValid) { CurrentFilename = Settings.readEntry("/madman/startup_file", QString::null, &FilenameValid); } if (!FilenameValid) throw runtime_error(QString2string(tr("No startup file found"))); auto_ptr progress(new tProgressDialog(this, false)); progress->setWhat(tr("Loading database...")); new_db->load(CurrentFilename, progress.get()); if (Preferences.ScanAtStartup) rescan(new_db.get()); setDatabase(new_db.release()); } catch (runtime_error &ex) { if (ex.what() != QString2string(tr("No startup file found"))) { QMessageBox::information(this, tr("madman"), tr("Couldn't restore previously opened file:\n%1\nCreating a new file."). arg(QString(ex.what())), QMessageBox::Ok); } else { QMessageBox::information(this, tr("Welcome to madman."), tr("Welcome to madman.\n\n" "We sincerely hope that you're about to discover a powerful new way\n" "to enjoy your music. madman is a powerful tool, and we advise you to take\n" "the time to familiarize yourself with its many features--the madman website at\n" "http://madman.sf.net has lots of useful hints.\n\n" "First, you might want to tell madman where you keep your music."), QMessageBox::Ok); } startNewDatabase(); } // set up lists ------------------------------------------------------------- SearchSongSet.setCriterion("" ); SearchSongSet.reevaluateCriterion(); SearchViewManager.setSongSet(&SearchSongSet); SearchViewManager.setup(); PlaylistEditor.setup(); // player control ----------------------------------------------------------- connect(&Preferences.Player, SIGNAL(currentSongChanged()), this, SLOT(songOrStateChanged())); connect(&Preferences.Player, SIGNAL(stateChanged()), this, SLOT(songOrStateChanged())); connect(&Preferences.Player, SIGNAL(stateChanged()), this, SLOT(updatePlayerStatus())); realizeSystemTrayIconSettings(); realizeHttpdSettings(); songOrStateChanged(); } tMainWindow::~tMainWindow() { QPoint p = pos(); QSize s = size(); { QString temp; { QTextOStream os(&temp); os << p.x() << ' ' << p.y(); } Settings.writeEntry("/madman/main_window_position", temp); } { QString temp; { QTextOStream os(&temp); os << s.width() << ' ' << s.height(); } Settings.writeEntry("/madman/main_window_size", temp); } Preferences.save(Settings); SearchViewManager.saveListViewAppearance(Settings); PlaylistEditor.saveListViewAppearance(Settings); saveSplitterAppearance(splitter1, Settings, "/madman/splitters/splitter1.state"); saveSplitterAppearance(splitter2, Settings, "/madman/splitters/splitter2.state"); saveSplitterAppearance(splitter3, Settings, "/madman/splitters/splitter3.state"); Settings.writeEntry("/madman/main_toolbar_shown", tbMain->isShown()); Settings.writeEntry("/madman/media_control_toolbar_shown", tbMediaControl->isShown()); Settings.writeEntry("/madman/rating_toolbar_shown", tbRating->isShown()); if (HttpDaemon) delete HttpDaemon; if (SystemTrayIcon) delete SystemTrayIcon; } void tMainWindow::setDatabase(tDatabase *db) { if (Database.get()) disconnect(&Database->SongCollection, NULL, this, NULL); PlaylistEditor.setSongSet(NULL); auto_ptr new_db(db); Database = new_db; SearchSongSet.setSongCollection(&Database->SongCollection); updateAll(); if (Database.get()) { connect(&Database->SongCollection, SIGNAL(notifySongModified(const tSong*, tSongField)), this, SLOT(noticeSongModified(const tSong*, tSongField))); connect(Database.get(), SIGNAL(notifyPlaylistTreeChanged()), this, SLOT(updatePlaylistTree())); } } void tMainWindow::closeEvent(QCloseEvent *event) { hide(); if (fileSaveWithResult()) { Settings.writeEntry("/madman/startup_file", CurrentFilename); tMainWindowBase::closeEvent(event); } else { if (QMessageBox::warning(this, tr("madman"), tr("Failed to save your database. Do you still want to quit?"), QMessageBox::Yes, QMessageBox::No) == QMessageBox::Yes) tMainWindowBase::closeEvent(event); else { event->ignore(); show(); } } } void tMainWindow::updateWindowCaption() { if (FilenameValid) { QFileInfo info(CurrentFilename); setCaption(tr("madman - %1").arg(info.fileName())); } else setCaption(tr("madman - ")); } void tMainWindow::updateAll() { updatePlaylistTree(false, false); songSetSelectionChanged(); buildOverviewTree(); updateWindowCaption(); updateRatingButtons(); updateTrayIconStatus(); } void tMainWindow::realizeSystemTrayIconSettings() { if (Preferences.EnableSystemTrayIcon && !SystemTrayIcon) { SystemTrayIcon = new TrayIcon(this); updateTrayIconStatus(); QPopupMenu *rating_menu = new QPopupMenu(this, "tray_rating_menu"); rate0Action->addTo(rating_menu); rate1Action->addTo(rating_menu); rate2Action->addTo(rating_menu); rate3Action->addTo(rating_menu); rate4Action->addTo(rating_menu); rate5Action->addTo(rating_menu); QPopupMenu *mainwin_menu = new QPopupMenu(this, "tray_mainwin_menu"); minimizeWindowAction->addTo(mainwin_menu); restoreWindowAction->addTo(mainwin_menu); hideWindowAction->addTo(mainwin_menu); QPopupMenu *tray_menu = new QPopupMenu(this, "tray_menu"); playAction->addTo(tray_menu); pauseAction->addTo(tray_menu); stopAction->addTo(tray_menu); tray_menu->insertSeparator(); tray_menu->insertItem(tr("&Rate currently playing song"), rating_menu); tray_menu->insertSeparator(); skipForwardAction->addTo(tray_menu); skipBackAction->addTo(tray_menu); tray_menu->insertSeparator(); tray_menu->insertItem(tr("&Main window"), mainwin_menu); tray_menu->insertSeparator(); fileExitAction->addTo(tray_menu); SystemTrayIcon->setPopup(tray_menu); SystemTrayIcon->show(); connect(SystemTrayIcon, SIGNAL(clicked(const QPoint &, int)), this, SLOT(trayIconClicked(const QPoint &, int))); } if (!Preferences.EnableSystemTrayIcon && SystemTrayIcon) { delete SystemTrayIcon; SystemTrayIcon = NULL; } } void tMainWindow::realizeHttpdSettings() { if (HttpDaemon) { delete HttpDaemon; HttpDaemon = NULL; } if (Preferences.HttpDaemonEnabled) { try { HttpDaemon = new tHttpDaemon(Preferences.HttpDaemonPort, Preferences.HttpRestrictToLocalhost); addResponders(HttpDaemon, this); } catch (runtime_error &ex) { if (QMessageBox::information(this, tr("madman"), tr("Could not start web server:\n%1\n" "This could be because another instance of madman is running,\n" "which is not a good idea. Stop now?"). arg(QString(ex.what())), QMessageBox::Yes, QMessageBox::No) == QMessageBox::Yes) throw; } } } void tMainWindow::quitApplication() { QTimer::singleShot(0, this, SLOT(close())); } void tMainWindow::setStatus(const QString &status) { statusBar()->message(status, 10000); } // slots ---------------------------------------------------------------------- void tMainWindow::rescan() { rescan(Database.get()); } void tMainWindow::rescan(tDatabase *db) { try { auto_ptr progress(new tProgressDialog(this, false)); db->SongCollection.scan(db->DirectoryList, progress.get()); } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Error while rescanning:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tMainWindow::rereadTags() { try { auto_ptr progress(new tProgressDialog(this, true)); Database->SongCollection.rereadTags(progress.get()); } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Error rereading tags:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tMainWindow::startNewDatabase() { FilenameValid = false; auto_ptr new_db(new tDatabase); new_db->startNew(); showPreferences(new_db.get(), 2); setDatabase(new_db.release()); } void tMainWindow::fileNew() { if (QMessageBox::warning(this, tr("madman"), tr("Are you sure you want to start over from scratch?"), QMessageBox::Yes, QMessageBox::No) == QMessageBox::Yes) startNewDatabase(); } void tMainWindow::fileOpen() { if (QMessageBox::warning(this, tr("madman"), tr("Save database before continuing?"), QMessageBox::Yes, QMessageBox::No) == QMessageBox::Yes) { if (!fileSaveWithResult()) return; } try { QString filename = QFileDialog::getOpenFileName(QString::null, tr("madman Database (*.mad)"), this); if (filename.isNull()) return; PlaylistEditor.setSongSet(NULL); auto_ptr new_db(new tDatabase); auto_ptr progress(new tProgressDialog(this, false)); progress->setWhat(tr("Loading database...")); new_db->load(filename, progress.get()); CurrentFilename = filename; FilenameValid = true; setDatabase(new_db.release()); } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Error opening the file.\nReason: %1").arg(string2QString(ex.what())), QMessageBox::Ok, 0); } } void tMainWindow::saveDatabase(const QString &name) { QFileInfo file_info(name); QString dir_name = file_info.dirPath(); QString trunk = file_info.baseName(); QString ext = file_info.extension(); if (ext.length()) ext = "." + ext; if (Preferences.BackupCount) { QDir my_dir(dir_name); my_dir.remove((trunk+"-backup-%1").arg(Preferences.BackupCount) + ext); for (int dest_i = Preferences.BackupCount; dest_i > 1; dest_i--) { QString srcname =(trunk+"-backup-%1").arg(dest_i - 1) + ext; QString destname =(trunk+"-backup-%1").arg(dest_i) + ext; my_dir.rename(srcname, destname); } QString srcname = trunk + ext; QString destname =(trunk+"-backup-%1").arg(1) + ext; my_dir.rename(srcname, destname); } auto_ptr progress(new tProgressDialog(this, false)); progress->setWhat(tr("Saving database...")); Database->save(name, progress.get()); } void tMainWindow::fileSave() { fileSaveWithResult(); } bool tMainWindow::fileSaveWithResult() { if (!FilenameValid) { return fileSaveAsWithResult(); } try { saveDatabase(CurrentFilename); return true; } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Error saving file '%1'").arg(string2QString(ex.what())), QMessageBox::Ok, 0); return false; } } void tMainWindow::fileSaveAs() { fileSaveAsWithResult(); } bool tMainWindow::fileSaveAsWithResult() { try { QString filename; while (true) { filename = QFileDialog::getSaveFileName(QString::null, "madman Database (*.mad)", this); if (filename.isNull()) return false; QFileInfo info(filename); if (info.exists()) { int result = QMessageBox::warning(this, tr("Warning"), tr("The file '%1' exists. Overwrite?").arg(filename), QMessageBox::Yes, QMessageBox::No | QMessageBox::Default, QMessageBox::Cancel); if (result == QMessageBox::Yes) break; if (result == QMessageBox::Cancel) return false; } else break; } saveDatabase(filename); CurrentFilename = filename; FilenameValid = true; updateWindowCaption(); return true; } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Error saving file '%1'").arg(string2QString(ex.what())), QMessageBox::Ok, 0); return false; } } void tMainWindow::showPreferences(tDatabase *db, int tab) { pair ok_rescan = editPreferences(this, Preferences, db->DirectoryList, Settings, tab); if (ok_rescan.first) { SearchViewManager.redisplay(false); PlaylistEditor.redisplay(false); SearchViewManager.setup(); PlaylistEditor.setup(); realizeSystemTrayIconSettings(); realizeHttpdSettings(); if (ok_rescan.second) rescan(db); } } void tMainWindow::filePreferences() { showPreferences(Database.get(), 0); } #include "designer/about.h" void tMainWindow::helpAbout() { tAboutDialog about; about.labelMain->setText(about.labelMain->text().arg(STRINGIFY(MADMAN_VERSION))); about.labelAbout->setText(about.labelAbout->text().arg(STRINGIFY(MADMAN_VERSION))); about.exec(); } void tMainWindow::help() { tHelpBrowser *hb = new tHelpBrowser(this); hb->browserHelp->setTextFormat(Qt::RichText); hb->browserHelp->setText( tr( "

Table of contents

" "1. Searching in madman
" "2. Frequently Asked Questions

" "

Searching in madman

" "Criteria can be combined via parentheses, | (or), & (and), " "! (not). " "Plain text will be interpreted as ~any(...). " "Unconnected criteria will automatically be connected by \"and\". " "Comments can be included if enclosed in { ... }. " "

Text criteria

" "The following criteria exist:

" "

    " "
  • ~any(...): selects all songs that contain ... in any field." "
  • ~artist(...): selects all songs that contain ... in the artist field." "
  • ~performer(...): selects all songs that contain ... in the performer field." "
  • ~album(...): selects all songs that contain ... in the album field." "
  • ~title(...): selects all songs that contain ... in the title field." "
  • ~genre(...): selects all songs that contain ... in the genre field." "
  • ~filename(...): selects all songs that contain ... in the filename field." "
" "Texts mentioned above as '...' can take several match modifiers:

" "

    " "
  • re:... for a regular expression" "
  • complete:... for a complete match" "
  • substring:... for a substring match" "
  • fuzzy:... for a fuzzy match" "
" "Substring matching is assumed if nothing is specified.

" "

Numeric criteria

" "The following criteria exist:

" "

    " "
  • ~year(<|>|<=|=|>=...): selects all songs that have a a year less/greater/.. than ..." "
  • ~track_number(<|>|<=|=|>=...): selects all songs that have a a track number less/greater/.. than ..." "
  • ~rating(<|>|<=|=|>=...): selects all songs that have a a rating less/greater/.. than ..." "
  • ~unrated: selects songs that are as yet unrated." "
  • ~play_count(<|>|<=|=|>=...): selects all songs that have a a play count less/greater/.. than ..." "
  • ~full_play_count(<|>|<=|=|>=...): selects all songs that have a full play count " "less/greater/.. than ..." "
  • ~partial_play_count(<|>|<=|=|>=...): selects all songs that have a partial play count " "less/greater/.. than ..." "
  • ~existed_for_days(<|>|<=|=|>=...): selects all songs that have been in your collection " "for less/greater/.. than ... days" "
  • ~full_play_ratio(<|>|<=|=|>=...): selects all songs that have a ratio " "of being played in full to the total play count less/greater/.. than ... " "(argument should be between 0.0 and 1.0) " "
  • ~last_played_n_days_ago(<|>|<=|=|>=...): selects songs that were last played " "within a number of days less/greater/.. than ... (argument may be a non-integer)" "
  • ~uniqueid(<|>|<=|=|>=...): selects songs that have a database key unique ID " "less/greater/.. than ..." "
" "Equal matching is assumed if nothing is specified.

" "

Criteria examples

" "
    " "
  • man moon: Songs that contain both the words \"man\" and \"moon\" " "in one of their fields." "
  • man|moon: Songs that contain the word \"man\" or the word \"moon\" " "in one of their fields." "
  • \"3 doors down\": Just like on Google, quoting ensures that " "you only get songs that contain the phrase \"3 doors down\" in succession." "
  • ~artist(complete:creed): That's how you say that you want " "Creed, but not Creedence Clearwater Revival." "
" "And here are some smart ideas for playlists that you could create:" "
    " "
  • Absolute favorites: ~rating(>=4)" "
  • Can't stand to listen to them: ~full_play_ratio(<0.3)&~play_count(>3)" "
  • Always finish listening to them: ~full_play_ratio(>0.5)&~play_count(>3)" "
  • Never listened: ~play_count(=0)" "
  • Love songs: ~title(love)|~album(love)" "
" "

FAQ

" "Q. Why can't I drag the column headers like I used to?

" "Just hold Control while dragging." )); hb->show(); } void tMainWindow::rateCurrentSong(int rating) { tFilename song_file = Preferences.Player.currentFilename(); if (Database.get()) { tSong *new_song = Database->SongCollection.getByFilename(song_file); if (new_song) { if (new_song->rating() == rating) new_song->setRating(-1); else new_song->setRating(rating); } else QMessageBox::warning(this, tr("madman"), tr("Currently playing song is not in database. Sorry."), QMessageBox::Ok, QMessageBox::NoButton); } } void tMainWindow::addPlaylist(tPlaylistNode *node, tPlaylistNode *parent) { if (Database->playlistTree() == NULL) Database->setPlaylistTree(node); else if (parent == NULL) Database->playlistTree()->addChild(node); else parent->addChild(node); updatePlaylistTree(true, true); } void tMainWindow::addPlaylist() { try { tPlaylistNode *parent = currentNode(); auto_ptr node(new tPlaylistNode(Database.get(), new tPlaylist())); node->data()->setSongCollection(&Database->SongCollection); bool successful = false; unsigned index = 1; while (!successful) { try { node->setName(tr("New Playlist %1").arg(index)); addPlaylist(node.get(), parent); successful = true; } catch (...) { } index++; } node.release(); } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Can't create playlist:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tMainWindow::bookmarkCurrentSearch() { try { tPlaylistNode *parent = currentNode(); auto_ptr node(new tPlaylistNode(Database.get(), new tPlaylist())); node->data()->setCriterion(editSearch->text()); node->data()->setSongCollection(&Database->SongCollection); bool successful = false; unsigned index = 1; while (!successful) { try { node->setName(tr("Bookmarked Search %1").arg(index)); addPlaylist(node.get(), parent); successful = true; } catch (...) { } index++; } node.release(); } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Can't create playlist from search:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tMainWindow::importPlaylist() { try { tPlaylistNode *parent = currentNode(); auto_ptr node(new tPlaylistNode(Database.get(), new tPlaylist())); node->data()->setSongCollection(&Database->SongCollection); QString fn = QFileDialog::getOpenFileName(QString::null, qApp->translate("importM3UIntoPlaylist", "Playlist (*.m3u)"), qApp->mainWidget()); if (fn.isNull()) return; importM3UIntoPlaylist(node->data(), fn); QFileInfo info(fn); node->setName(info.fileName()); addPlaylist(node.get(), parent); node.release(); } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Can't import playlist:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tMainWindow::duplicatePlaylist() { tPlaylistNode *current_node = currentNode(); if (current_node == NULL) return; try { auto_ptr new_node(new tPlaylistNode(Database.get(), new tPlaylist)); new_node->setName(tr("Copy of %1").arg(current_node->name())); *(new_node->data()) = *(current_node->data()); current_node->addChild(new_node.get()); new_node.release(); updatePlaylistTree(true, true); } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Can't duplicate playlist:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tMainWindow::removePlaylist() { if (!lstSets->currentItem()) return ; tPlaylistNode *node = currentNode(); if (node->begin() != node->end()) { if (QMessageBox::warning(this, tr("Warning"), tr("This playlist has children. Do you still want to delete it?"), QMessageBox::Yes, QMessageBox::No | QMessageBox::Default) == QMessageBox::No) return ; } // delete from structure if (node->parent() == NULL) Database->setPlaylistTree(NULL); else node->parent()->removeChild(node); delete node; PlaylistEditor.setSongSet(NULL); updatePlaylistTree(false, true); } void tMainWindow::editMultilinePlaylistCriterion() { if (!lstSets->currentItem()) return ; tPlaylistNode *node = currentNode(); QString criterion = node->data()->criterion(); while (multilineEdit(tr("madman"), tr("Criterion for dynamic playlist"), criterion, this)) { try { if (node->data()->criterion() != criterion) { node->data()->setCriterion(criterion); node->data()->reevaluateCriterion(); songSetSelectionChanged(); } break; } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Error in Criterion: %1").arg(string2QString(ex.what())), QMessageBox::Ok, 0); } } } void tMainWindow::slotDropPlaylistNode(const QString &node_name, tPlaylistNode *onto) { tPlaylistNode *node = Database->playlistTree()->resolve(node_name); if (node == NULL) return; // this also catches the case when root is being dragged away if (node == onto || onto->hasParent(node)) return; // by now, node can't be root, so it has a parent. node->parent()->removeChild(node); onto->insertChild(node, onto->begin()); updatePlaylistTree(false, true); } void tMainWindow::renamePlaylist(QListViewItem *item, int col, const QString &text) { try { nodeFromItem(item)->setName(text); } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), string2QString(ex.what()), QMessageBox::Ok, 0); } updatePlaylistTree(true, true); } void tMainWindow::songSetSelectionChanged() { tPlaylistNode *node = currentNode(); PlaylistEditor.setSongSet(node ? node->data() : NULL); if (node && node->data()) { tSongList list; node->data()->render(list); statusBar()->message( stringifySongListSummary(list), 5000); } } void tMainWindow::songSetCriterionChanged() { tPlaylistNode *node = currentNode(); if (node) { tPlaylist *song_set = node->data(); try { QString newcrit = editPlaylistCriterion->text(); if (song_set->criterion() != newcrit) { song_set->setCriterion(newcrit); song_set->reevaluateCriterion(); { tSongList list; song_set->render(list); statusBar()->message( stringifySongListSummary(list), 5000); } } } catch (exception &ex) { QMessageBox::warning(this, tr("madman"), tr("Error in Criterion: %1").arg(string2QString(ex.what())), QMessageBox::Ok, 0); } } } void tMainWindow::noticeSongSetChanged() { tSongSet *song_set = PlaylistEditor.songSet(); if (song_set) { editPlaylistCriterion->setEnabled(true); editPlaylistCriterion->setText(song_set->criterion()); } else { editPlaylistCriterion->setEnabled(false); editPlaylistCriterion->setText(""); } } // set contents management ---------------------------------------------------- void tMainWindow::add(const tSongList &songlist) { FOREACH_CONST(first, songlist, tSongList) PlaylistEditor.playlist()->add(*first); } void tMainWindow::searchChanged() { try { // Workaround for Qt 3.2 editSearch->repaint(); QString new_crit = editSearch->text(); if (SearchSongSet.criterion() != new_crit) { if (CurrentSearchProgress) CurrentSearchProgress->cancel(); SearchSongSet.setCriterion(new_crit); tCancellableStatusBarProgress progress(statusBar()); CurrentSearchProgress = &progress; SearchSongSet.reevaluateCriterion(&progress); if (CurrentSearchProgress == &progress) CurrentSearchProgress = NULL; } tSongList list; SearchSongSet.render(list); statusBar()->message( stringifySongListSummary(list), 5000); } catch (exception &ex) { statusBar()->message(tr("Error in expression: %1.").arg(string2QString(ex.what())), 2000); } } void tMainWindow::buildOverviewTree() { lstOverview->clear(); new tGenreOverviewItem(*Database, lstOverview, NULL, tr("By Genre"), QString::null); new tAlbumOverviewItem(*Database, lstOverview, NULL, tr("By Album"), QString::null); new tArtistsOverviewItem(*Database, lstOverview, NULL, tr("By Artist"), QString::null); new tOverviewItem(lstOverview, NULL, tr("All"), ""); } void tMainWindow::overviewSelectionChanged(QListViewItem *item) { tOverviewItem *ov_item = dynamic_cast< tOverviewItem * >(item); if (ov_item->criterion() != QString::null) editSearch->setText(ov_item->criterion()); } void tMainWindow::highlightCurrentSong() { if (SearchSongSet.criterion() != "") editSearch->setText(""); lstAllSongs->setFocus(); SearchViewManager.highlightCurrentSong(); } void tMainWindow::play() { Preferences.Player.play(); } void tMainWindow::pause() { if (Preferences.Player.isPaused()) Preferences.Player.play(); else Preferences.Player.pause(); } void tMainWindow::stop() { Preferences.Player.stop(); } void tMainWindow::skipForward() { Preferences.Player.skipForward(); } void tMainWindow::skipBack() { Preferences.Player.skipBack(); } void tMainWindow::skipTo(int value) { Preferences.Player.skipTo(float(value) / 100); } void tMainWindow::skipToWrapper() { skipTo(sbarSongPosition->value() ); } void tMainWindow::updatePlayerStatus() { float current_time = Preferences.Player.currentTime(); float total_time = Preferences.Player.totalTime(); if (total_time == 0) sbarSongPosition->setValue (0); else sbarSongPosition->setValue (int(10000 * current_time / total_time)); QString current,total_duration; current.sprintf("%d:%02d", int(current_time) / 60, int (current_time) % 60); total_duration.sprintf("%d:%02d", int(total_time) / 60, int (total_time) % 60); labelSongPosition->setText(QString("%1 / %2").arg(current).arg(total_duration)); } void tMainWindow::songOrStateChanged() { // detect state changes time_t now = time(NULL); if (WasPlaying) AccumulatedPlayTime += now - PlayStartTime; WasPlaying = Preferences.Player.isPlaying() && !Preferences.Player.isPaused(); PlayStartTime = now; pauseAction->setOn(Preferences.Player.isPaused() && Preferences.Player.isPlaying()); // detect song changes tFilename song_file = Preferences.Player.currentFilename(); if (song_file != CurrentSongFilename) { if (Database.get()) { if (CurrentSongFilename != "" && Preferences.CollectHistory) { tSong *old_song = Database->SongCollection.getByFilename(CurrentSongFilename); if (old_song) { old_song->played(time(NULL), AccumulatedPlayTime > 0.6 * old_song->duration()); Database->History.played(old_song->uniqueId(), time(NULL), AccumulatedPlayTime); } } if (Preferences.EnablePassivePopupSongAnnouncements) { tSong *new_song = Database->SongCollection.getByFilename(song_file); if (new_song) { new tPassivePopup(substituteSongFields(Preferences.PassivePopupFormat, new_song, true), 3000); } } } updateTrayIconStatus(); updateRatingButtons(); CurrentSongFilename = song_file; AccumulatedPlayTime = 0; } } void tMainWindow::trayIconClicked(const QPoint &where, int button) { if (isShown()) hide(); else showNormal(); } // helpers -------------------------------------------------------------------- void tMainWindow::updatePlaylistTree() { updatePlaylistTree(false, false); } void tMainWindow::updatePlaylistTree(bool keep_selection, bool keep_scroll) { int contents_x = lstSets->contentsX(); int contents_y = lstSets->contentsY(); tPlaylistNodeListViewItem *selected_item = NULL; if (keep_selection) selected_item = dynamic_cast(lstSets->currentItem()); tPlaylistNode *selected_node = NULL; if (selected_item) selected_node = selected_item->node(); lstSets->clear(); if (Database->playlistTree()) lstSets->insertItem( createPlaylistNodeItem(Database->playlistTree(), NULL, selected_node, selected_item)); if (keep_scroll) lstSets->setContentsPos(contents_x, contents_y); if (keep_selection && selected_item) lstSets->setSelected(selected_item, true); } tPlaylistNode *tMainWindow::nodeFromItem(QListViewItem *item) { tPlaylistNodeListViewItem *cast_item = dynamic_cast(item); if (cast_item) return cast_item->node(); else return NULL; } tPlaylistNode *tMainWindow::currentNode() { QListViewItem *current_item = lstSets->currentItem(); if (current_item == NULL) return NULL; else return nodeFromItem(current_item); } tPlaylist *tMainWindow::currentPlaylist() { tPlaylistNode * node = currentNode(); if (node) return node->data(); else return NULL; } void tMainWindow::insertAtPosition(QListViewItem *parent, QListViewItem *item, tIndex pos) { parent->insertItem(item); if (pos != 0) { QListViewItem * after = item; while (pos--) after = after->nextSibling(); item->moveItem(after); } } QListViewItem *tMainWindow::createPlaylistNodeItem(tPlaylistNode *node, QListViewItem *parent, tPlaylistNode *selected_node, tPlaylistNodeListViewItem *&selected_item) { tPlaylistNodeListViewItem *result; if (parent) result = new tPlaylistNodeListViewItem(parent, node); else result = new tPlaylistNodeListViewItem(lstSets, node); connect(result, SIGNAL(dropNode(const QString &,tPlaylistNode *)), this, SLOT(slotDropPlaylistNode(const QString &,tPlaylistNode *))); if (node == selected_node) selected_item = result; tPlaylistNode::iterator first = node->begin(), last = node->end(); if (first != last) do { last--; createPlaylistNodeItem(*last, result, selected_node, selected_item); } while (first != last); lstSets->setOpen(result, true); return result; } void tMainWindow::loadSplitterAppearance(QSplitter *splitter, QSettings &settings, QString const &where) { QString representation; representation = settings.readEntry(where); { QTextStream stream(&representation, IO_ReadOnly); stream >> *splitter; } } void tMainWindow::saveSplitterAppearance(QSplitter *splitter, QSettings &settings, QString const &where) { QString representation; { QTextStream stream(&representation, IO_WriteOnly); stream << *splitter; } settings.writeEntry(where, representation); } void tMainWindow::showEvent(QShowEvent *e) { tMainWindowBase::showEvent(e); } void tMainWindow::hideEvent(QHideEvent *e) { tMainWindowBase::hideEvent(e); if (isMinimized() && Preferences.EnableSystemTrayIcon && Preferences.MinimizeToSystemTray) hide(); } void tMainWindow::updateTrayIconStatus() { if (!SystemTrayIcon) return; // update tooltip ----------------------------------------------------------- tSong *new_song; if (Database.get() && (new_song = Database->SongCollection.getByFilename( Preferences.Player.currentFilename())) && new_song) { QString rating_string; if (new_song->rating() == 0) { rating_string = tr(" (not rated)"); } else if (new_song->rating() > 0) { rating_string.fill('*', new_song->rating()); rating_string = tr(" (rated %1)").arg(rating_string); } SystemTrayIcon->setToolTip(substituteSongFields(Preferences.TrayTooltipFormat, new_song, true)); } else SystemTrayIcon->setToolTip(tr("madman")); // update icon -------------------------------------------------------------- QImage tray_img = icon()->convertToImage(); tray_img = tray_img.smoothScale(16, 16); QPixmap tray_pixmap; tray_pixmap.convertFromImage(tray_img); SystemTrayIcon->setIcon(tray_pixmap); } void tMainWindow::updateRatingButtons() { int current_rating = -1; tSong *new_song; if (Database.get() && (new_song = Database->SongCollection.getByFilename( Preferences.Player.currentFilename())) && new_song) current_rating = new_song->rating(); int const action_count = 6; QAction *actions[] = { rate0Action, rate1Action, rate2Action, rate3Action, rate4Action, rate5Action }; for (int i = 0; i < action_count; i++) actions[ i ]->setOn(false); if (current_rating >= 0 && current_rating < action_count) actions[ current_rating ]->setOn(true); } void tMainWindow::noticeSongModified(const tSong *song, tSongField field) { if (field == FIELD_RATING) updateRatingButtons(); } madman-0.93/ui/multiline.cpp0000644000175000001440000000230710053135242015574 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "designer/multiline_edit.h" bool multilineEdit(const QString &caption, const QString &label, QString &value, QWidget *parent) { tMultilineEditor edit(parent); edit.setCaption(caption); edit.label->setText(label); edit.editText->setText(value); int returncode = edit.exec(); if (returncode == QDialog::Accepted) value = edit.editText->text(); return returncode == QDialog::Accepted; } madman-0.93/ui/overview.cpp0000644000175000001440000002026410053135242015442 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "utility/player.h" #include "database/database.h" #include "database/song_list_tools.h" #include "ui/overview.h" #include "ui/mainwin.h" #include #include #include // private helpers ------------------------------------------------------------ namespace { QString normalize(const QString &victim) { return victim.lower(); } } // tOverviewItem -------------------------------------------------------------- tOverviewItem::tOverviewItem(QListView *view, QListViewItem *after, const QString &label, const QString &criterion) : QListViewItem(view, after, label), Criterion(criterion) { } tOverviewItem::tOverviewItem(QListViewItem *parent, QListViewItem *after, const QString &label, const QString &criterion) : QListViewItem(parent, after, label), Criterion(criterion) { } // tExpandableOverviewItem -------------------------------------------------------------- tExpandableOverviewItem::tExpandableOverviewItem(QListView *view, QListViewItem *after, const QString &label, const QString &criterion) : tOverviewItem(view, after, label, criterion) { setExpandable(true); HasExpanded = false; } tExpandableOverviewItem::tExpandableOverviewItem(QListViewItem *parent, QListViewItem *after, const QString &label, const QString &criterion) : tOverviewItem(parent, after, label, criterion) { setExpandable(true); HasExpanded = false; } void tExpandableOverviewItem::setOpen(bool o) { if (!HasExpanded && o) { listView()->setUpdatesEnabled(false); addExpansion(); listView()->setUpdatesEnabled(true); HasExpanded = true; } tOverviewItem::setOpen(o); } void tExpandableOverviewItem::addExpansion() { } // tool routine --------------------------------------------------------------- namespace { int buildOverview(tSongList &songs, tSongField field1, tSongField field2, QListViewItem *parent, const QString & critprefix = "") { sort(songs, field1); QListViewItem *last_item = NULL; QString last_entry = QString::null; int distinct_count = 0; tSongList::iterator first = songs.begin(), last = songs.end(); while (first != last) { QString this_nonnormalized_entry = (*first)->fieldText(field1); QString this_entry = normalize(this_nonnormalized_entry); if (this_nonnormalized_entry == "") this_nonnormalized_entry = ""; tSongList this_songs; while (first != last && this_entry == normalize((*first)->fieldText(field1))) this_songs.push_back(*first++); QString criterion = QString("%1~%2(complete:%3)") .arg(critprefix) .arg(getFieldIdentifier (field1)) .arg(quoteString(this_entry)); QListViewItem *entry_item = new tOverviewItem( parent, last_item, QString("%1 (%2)") .arg(this_nonnormalized_entry) .arg(this_songs.size()), criterion); if (field2 != FIELD_COUNT) buildOverview(this_songs, field2, FIELD_COUNT, entry_item, criterion+"&"); last_item = entry_item; distinct_count++; } return distinct_count; } } // tArtistsOverviewItem ------------------------------------------------------- tArtistsOverviewItem::tArtistsOverviewItem(tDatabase &database, QListView *view, QListViewItem *after, const QString &label, const QString &criterion) : tExpandableOverviewItem(view, after, label, criterion), Database(database) { } tArtistsOverviewItem::tArtistsOverviewItem(tDatabase &database, QListViewItem *parent, QListViewItem *after, const QString &label, const QString &criterion) : tExpandableOverviewItem(parent, after, label, criterion), Database(database) { } void tArtistsOverviewItem::addExpansion() { tSongList songs; FOREACH_CONST(first, Database.SongCollection, tSongCollection) songs.push_back(*first); buildOverview(songs, FIELD_ARTIST, FIELD_ALBUM, this); } // tAlbumOverviewItem ------------------------------------------------------- tAlbumOverviewItem::tAlbumOverviewItem(tDatabase &database, QListView *view, QListViewItem *after, const QString &label, const QString &criterion) : tExpandableOverviewItem(view, after, label, criterion), Database(database) { } tAlbumOverviewItem::tAlbumOverviewItem(tDatabase &database, QListViewItem *parent, QListViewItem *after, const QString &label, const QString &criterion) : tExpandableOverviewItem(parent, after, label, criterion), Database(database) { } void tAlbumOverviewItem::addExpansion() { tSongList songs; FOREACH_CONST(first, Database.SongCollection, tSongCollection) songs.push_back(*first); buildOverview(songs, FIELD_ALBUM, FIELD_COUNT, this); } // tGenreOverviewItem ------------------------------------------------------- tGenreOverviewItem::tGenreOverviewItem(tDatabase &database, QListView *view, QListViewItem *after, const QString &label, const QString &criterion) : tExpandableOverviewItem(view, after, label, criterion), Database(database) { } tGenreOverviewItem::tGenreOverviewItem(tDatabase &database, QListViewItem *parent, QListViewItem *after, const QString &label, const QString &criterion) : tExpandableOverviewItem(parent, after, label, criterion), Database(database) { } void tGenreOverviewItem::addExpansion() { tSongList songs; FOREACH_CONST(first, Database.SongCollection, tSongCollection) songs.push_back(*first); buildOverview(songs, FIELD_GENRE, FIELD_COUNT, this); } // tOverviewManager ----------------------------------------------------------- tOverviewManager::tOverviewManager(QListView &listview, tMainWindow *mw) : ListView(listview), MainWindow(mw) { connect(&ListView, SIGNAL(contextMenuRequested(QListViewItem *, const QPoint &, int)), this, SLOT(contextMenuRequested(QListViewItem *, const QPoint &, int))); Menu = buildPopupMenu(); } QPopupMenu *tOverviewManager::buildPopupMenu() { QPopupMenu *menu = new QPopupMenu(); QPopupMenu *play_menu = new QPopupMenu(&ListView); play_menu->insertItem(tr("&Play now"), this, SLOT(slotPlayNow())); play_menu->insertItem(tr("Play &next"), this, SLOT(slotPlayNext())); play_menu->insertItem(tr("Play &evenutally"), this, SLOT(slotPlayEventually())); menu->insertItem(tr("&Play"), play_menu); return menu; } void tOverviewManager::contextMenuRequested (QListViewItem * item, const QPoint & pos, int col) { Menu->popup(pos); } void tOverviewManager::slotPlayNow() { tOverviewItem *my_item = dynamic_cast(ListView.selectedItem()); if (my_item) { tPlaylist set; set.setSongCollection(&MainWindow->database().SongCollection); set.setCriterion(my_item->criterion()); set.reevaluateCriterion(); tSongList list; set.render(list); MainWindow->preferences().Player.playNow(list); } } void tOverviewManager::slotPlayNext() { tOverviewItem *my_item = dynamic_cast(ListView.selectedItem()); if (my_item) { tPlaylist set; set.setSongCollection(&MainWindow->database().SongCollection); set.setCriterion(my_item->criterion()); set.reevaluateCriterion(); tSongList list; set.render(list); MainWindow->preferences().Player.playNext(list); } } void tOverviewManager::slotPlayEventually() { tOverviewItem *my_item = dynamic_cast(ListView.selectedItem()); if (my_item) { tPlaylist set; set.setSongCollection(&MainWindow->database().SongCollection); set.setCriterion(my_item->criterion()); set.reevaluateCriterion(); tSongList list; set.render(list); MainWindow->preferences().Player.playEventually(list); } } madman-0.93/ui/passive_popup.cpp0000644000175000001440000000631610053135242016473 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "ui/passive_popup.h" tPassivePopup *tPassivePopup::CurrentPopup = NULL; tPassivePopup::tPassivePopup(const QString &text, unsigned msec) : ShownMilliseconds(msec) { if (CurrentPopup) delete CurrentPopup; CurrentPopup = this; QVBox *vbox = new QVBox(NULL, "passive_popup", Qt::WStyle_NoBorder | Qt::WX11BypassWM | Qt::WStyle_StaysOnTop); Widget = vbox; vbox->setFrameShape(QFrame::Panel); vbox->setFrameShadow(QFrame::Raised); vbox->setMargin(5); vbox->setSpacing(9); QPushButton *button = new QPushButton(tr("Hide"), Widget); connect(button, SIGNAL(clicked()), this, SLOT(deleteLater())); QLabel *label = new QLabel(text, Widget); QFont my_font = label->font(); if (my_font.pixelSize() < 0) my_font.setPointSizeFloat(my_font.pointSizeFloat() * 1.5); else my_font.setPixelSize(int(my_font.pixelSize() * 1.5)); my_font.setBold(true); label->setFont(my_font); label->setAlignment(Qt::AlignHCenter); QDesktopWidget *d = QApplication::desktop(); QSize sizehint = Widget->sizeHint(); Widget->move(QPoint( (d->width() - sizehint.width()) / 2, - sizehint.height())); StateMilliseconds = 0; TotalStateMilliseconds = 300; State = APPEARING; Widget->show(); connect(&MyTimer, SIGNAL(timeout()), this, SLOT(timer())); MyTimer.start(20, false); } tPassivePopup::~tPassivePopup() { delete Widget; CurrentPopup = NULL; } void tPassivePopup::timer() { QDesktopWidget *d = QApplication::desktop(); QSize sizehint = Widget->sizeHint(); StateMilliseconds += 10; if (StateMilliseconds > TotalStateMilliseconds) { StateMilliseconds = 0; switch (State) { case APPEARING: State = SHOWING; Widget->move(QPoint((d->width() - sizehint.width()) / 2, 0)); TotalStateMilliseconds = ShownMilliseconds; break; case SHOWING: State = DISAPPEARING; TotalStateMilliseconds = 300; break; case DISAPPEARING: Widget->hide(); deleteLater(); } } switch (State) { case APPEARING: Widget->move(QPoint((d->width() - sizehint.width()) / 2, - sizehint.height() * (TotalStateMilliseconds-StateMilliseconds) / TotalStateMilliseconds)); break; case DISAPPEARING: Widget->move(QPoint((d->width() - sizehint.width()) / 2, - sizehint.height() * StateMilliseconds / TotalStateMilliseconds)); break; default: break; } } madman-0.93/ui/prefs_dialog.cpp0000644000175000001440000003234210053135242016232 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 #include #include #include #include #include #include #include #include "database/song_set.h" #include "utility/player.h" #include "utility/plugin.h" #include "utility/prefs.h" #include "database/criterion.h" #include "designer/prefs.h" #include "ui/mainwin.h" #include "ui/prefs_dialog.h" // class declarations --------------------------------------------------------- class tCriterionTableItem : public QTableItem { typedef QTableItem super; QString Criterion; QLabel &StatusLabel; public: tCriterionTableItem(QTable *table, const QString &crit, QLabel &status); QWidget *createEditor() const; void setContentFromEditor(QWidget *w); QString text() const { return Criterion; } }; class tAutoDJScoreTableItem : public QComboTableItem { typedef QComboTableItem super; QString NeverString; public: tAutoDJScoreTableItem(QTable *table, int score); int scoreAdjustment(); }; class tPreferencesDialog : public tPreferencesDialogBase { Q_OBJECT; QString SelectedPlugin; public: tDirectoryListManager MediaDirectoryListManager; tDirectoryListManager PluginDirectoryListManager; QSettings &Settings; bool MediaDirectoriesChanged; public: tPreferencesDialog(QWidget* parent, tDirectoryList &media_dir_list, tDirectoryList &plugin_dir_list, QSettings &settings); public slots: void noticeMediaDirectoriesChanged(); void updatePluginList(); void updateSelectedPluginInfo(int index); void configurePlugin(); void newAutoDJScoringRule(); void deleteAutoDJScoringRule(); void moveUpAutoDJScoringRule(); void moveDownAutoDJScoringRule(); void resetAutoDJScoringRules(); void showAutoDJPreferences(tAutoDJPreferences &adjp); protected: void swapAutoDJScoringRuleRows(unsigned row1, unsigned row2); }; // tCriterionTableItem -------------------------------------------------------- tCriterionTableItem::tCriterionTableItem(QTable *table, const QString &crit, QLabel &status) : super(table, OnTyping, ""), Criterion(crit), StatusLabel(status) { } QWidget *tCriterionTableItem::createEditor() const { QLineEdit *e = new QLineEdit(table()->viewport()); e->setText(Criterion); e->setFrame(false); return e; } void tCriterionTableItem::setContentFromEditor(QWidget *w) { QLineEdit *e = (QLineEdit*) w; QString new_value = e->text(); try { parseCriterion(new_value); Criterion = new_value; } catch (exception &ex) { StatusLabel.setText( qApp->translate("ErrorMessages", "Error in Criterion: %1") .arg(string2QString(ex.what()))); QTimer::singleShot(5000, &StatusLabel, SLOT(clear())); } } // tAutoDJScoreTableItem ------------------------------------------------------ tAutoDJScoreTableItem::tAutoDJScoreTableItem(QTable *table, int score) : super(table, QStringList(), false) { NeverString = qApp->translate("AutoDJScoringRule", "Never"); QStringList list; list.push_back(NeverString); for (int i = tAutoDJScoringRule::ScoreMinimum; i <= tAutoDJScoringRule::ScoreMaximum; i++) list.push_back(QString::number(i)); setStringList(list); setCurrentItem(score - tAutoDJScoringRule::ScorePlayNever); } int tAutoDJScoreTableItem::scoreAdjustment() { return currentItem() + tAutoDJScoringRule::ScorePlayNever; } // tPreferencesDialog --------------------------------------------------------- tPreferencesDialog::tPreferencesDialog(QWidget* parent, tDirectoryList &media_dir_list, tDirectoryList &plugin_dir_list, QSettings &settings) : tPreferencesDialogBase(parent, "prefs", true), MediaDirectoryListManager(this, media_dir_list, lstMediaDirectories, btnAddMediaDirectory, btnRemoveMediaDirectory), PluginDirectoryListManager(this, plugin_dir_list, lstPluginDirectories, btnAddPluginDirectory, btnRemovePluginDirectory), Settings(settings) { connect(&PluginDirectoryListManager, SIGNAL(changed()), this, SLOT(updatePluginList())); connect(&MediaDirectoryListManager, SIGNAL(changed()), this, SLOT(noticeMediaDirectoriesChanged())); connect(lstPlugins, SIGNAL(highlighted(int)), this, SLOT(updateSelectedPluginInfo(int))); connect(btnConfigurePlugin, SIGNAL(clicked()), this, SLOT(configurePlugin())); connect(btnNewAutoDJScoringRule, SIGNAL(clicked()), this, SLOT(newAutoDJScoringRule())); connect(btnDeleteAutoDJScoringRule, SIGNAL(clicked()), this, SLOT(deleteAutoDJScoringRule())); connect(btnMoveUpAutoDJScoringRule, SIGNAL(clicked()), this, SLOT(moveUpAutoDJScoringRule())); connect(btnMoveDownAutoDJScoringRule, SIGNAL(clicked()), this, SLOT(moveDownAutoDJScoringRule())); connect(btnResetAutoDJScoringRules, SIGNAL(clicked()), this, SLOT(resetAutoDJScoringRules())); updatePluginList(); MediaDirectoriesChanged = false; tblAutoDJScoringRules->setColumnWidth(1, 80); tblAutoDJScoringRules->setColumnStretchable(0, true); } void tPreferencesDialog::noticeMediaDirectoriesChanged() { MediaDirectoriesChanged = true; } void tPreferencesDialog::updatePluginList() { tPluginList plugins; enumeratePlugins(PluginDirectoryListManager.directoryList(), plugins); lstPlugins->clear(); FOREACH_CONST(first, plugins, tPluginList) lstPlugins->insertItem(first->Name); } void tPreferencesDialog::updateSelectedPluginInfo(int index) { tPluginList plugins; enumeratePlugins(PluginDirectoryListManager.directoryList(), plugins); if (index < (int) plugins.size()) { SelectedPlugin = plugins[ index ].Filename; lblPluginName->setText(plugins[ index ].Name); lblPluginDescription->setText(plugins[ index ].Description); } } void tPreferencesDialog::configurePlugin() { tPluginList plugins; enumeratePlugins(PluginDirectoryListManager.directoryList(), plugins); FOREACH(first, plugins, tPluginList) if (first->Filename == SelectedPlugin) { first->configure(Settings); return; } } void tPreferencesDialog::newAutoDJScoringRule() { const unsigned new_row = tblAutoDJScoringRules->numRows(); tblAutoDJScoringRules->setNumRows(new_row + 1); tblAutoDJScoringRules->setText(new_row, 0, "New score adjustment"); tblAutoDJScoringRules->setItem( new_row, 1, new tAutoDJScoreTableItem( tblAutoDJScoringRules, 0)); tblAutoDJScoringRules->setItem( new_row, 2, new tCriterionTableItem( tblAutoDJScoringRules, "~none", *labelAutoDJStatus)); } void tPreferencesDialog::deleteAutoDJScoringRule() { tblAutoDJScoringRules->removeRow(tblAutoDJScoringRules->currentRow()); } void tPreferencesDialog::moveUpAutoDJScoringRule() { unsigned current_row = tblAutoDJScoringRules->currentRow(); if (current_row == 0) return; unsigned target_row = current_row - 1; swapAutoDJScoringRuleRows(target_row, current_row); tblAutoDJScoringRules->setCurrentCell(target_row, tblAutoDJScoringRules->currentColumn()); } void tPreferencesDialog::moveDownAutoDJScoringRule() { int current_row = tblAutoDJScoringRules->currentRow(); if (current_row + 1 >= tblAutoDJScoringRules->numRows()) return; unsigned target_row = current_row + 1; swapAutoDJScoringRuleRows(target_row, current_row); tblAutoDJScoringRules->setCurrentCell(target_row, tblAutoDJScoringRules->currentColumn()); } void tPreferencesDialog::resetAutoDJScoringRules() { tAutoDJPreferences adjp; adjp.resetToDefault(); showAutoDJPreferences(adjp); } void tPreferencesDialog::swapAutoDJScoringRuleRows(unsigned row1, unsigned row2) { QString buf_row2_comment = tblAutoDJScoringRules->text(row2, 0); QTableItem *buf_criterion1 = tblAutoDJScoringRules->item(row1, 1); QTableItem *buf_score1 = tblAutoDJScoringRules->item(row1, 2); QTableItem *buf_criterion2 = tblAutoDJScoringRules->item(row2, 1); QTableItem *buf_score2 = tblAutoDJScoringRules->item(row2, 2); tblAutoDJScoringRules->takeItem(buf_criterion1); tblAutoDJScoringRules->takeItem(buf_score1); tblAutoDJScoringRules->takeItem(buf_criterion2); tblAutoDJScoringRules->takeItem(buf_score2); tblAutoDJScoringRules->setText(row2, 0, tblAutoDJScoringRules->text(row1, 0)); tblAutoDJScoringRules->setText(row1, 0, buf_row2_comment); tblAutoDJScoringRules->setItem(row2, 1, buf_criterion1); tblAutoDJScoringRules->setItem(row1, 1, buf_criterion2); tblAutoDJScoringRules->setItem(row2, 2, buf_score1); tblAutoDJScoringRules->setItem(row1, 2, buf_score2); } void tPreferencesDialog::showAutoDJPreferences(tAutoDJPreferences &adjp) { tblAutoDJScoringRules->setNumRows(adjp.ScoringRuleList.size()); unsigned index = 0; FOREACH_CONST(first, adjp.ScoringRuleList, tAutoDJScoringRuleList) { tblAutoDJScoringRules->setText(index, 0, first->Comment); tblAutoDJScoringRules->setItem( index, 1, new tAutoDJScoreTableItem( tblAutoDJScoringRules, first->ScoreAdjustment)); tblAutoDJScoringRules->setItem( index, 2, new tCriterionTableItem( tblAutoDJScoringRules, first->Criterion, *labelAutoDJStatus)); index++; } } // public functions ----------------------------------------------------------- pair editPreferences(tMainWindow *mainwin, tPreferences &prefs, tDirectoryList &media_dir_list, QSettings &settings, int starting_tab) { // create the dialog tDirectoryList work_media_dir_list,work_plugin_dir_list; work_media_dir_list = media_dir_list; work_plugin_dir_list = prefs.PluginDirectories; tPreferencesDialog prefsdialog(mainwin, work_media_dir_list, work_plugin_dir_list, settings); prefsdialog.tabMain->setCurrentPage(starting_tab); // populate the dialog vector players; listPlayers(players); int index = 0,current_index = 0; FOREACH_CONST(first, players, vector) { if (prefs.Player.name() == *first) current_index = index; prefsdialog.comboPlayer->insertItem(*first); index++; } prefsdialog.comboPlayer->setCurrentItem(current_index); #define SET_BOOL(NAME) \ prefsdialog.check##NAME->setChecked( prefs.NAME); SET_BOOL(ScanAtStartup); SET_BOOL(RememberGeometry); SET_BOOL(CollectHistory); SET_BOOL(EnableSystemTrayIcon); SET_BOOL(MinimizeToSystemTray); SET_BOOL(EnablePassivePopupSongAnnouncements); prefsdialog.spinBackupCount->setValue(prefs.BackupCount); prefsdialog.checkHttpDaemonEnabled->setChecked(false); prefsdialog.checkHttpDaemonEnabled->setChecked(true); SET_BOOL(HttpDaemonEnabled); prefsdialog.spinHttpDaemonPort->setValue(prefs.HttpDaemonPort); SET_BOOL(HttpDownloadsEnabled); SET_BOOL(HttpScriptingEnabled); SET_BOOL(HttpWriteScriptingEnabled); SET_BOOL(HttpLocalPlayEnabled); SET_BOOL(HttpBrowsingEnabled); SET_BOOL(HttpRestrictToLocalhost); prefsdialog.showAutoDJPreferences(prefs.AutoDJPreferences); // show int returncode = prefsdialog.exec(); // process results if (returncode == QDialog::Accepted) { media_dir_list = work_media_dir_list; prefs.PluginDirectories = work_plugin_dir_list; prefs.setPlayer(createPlayer(prefsdialog.comboPlayer->currentText())); #define GET_BOOL(NAME) \ prefs.NAME = prefsdialog.check##NAME->isChecked(); GET_BOOL(ScanAtStartup); GET_BOOL(RememberGeometry); GET_BOOL(CollectHistory); GET_BOOL(EnableSystemTrayIcon); GET_BOOL(MinimizeToSystemTray); GET_BOOL(EnablePassivePopupSongAnnouncements); prefs.BackupCount = prefsdialog.spinBackupCount->value(); GET_BOOL(HttpDaemonEnabled); prefs.HttpDaemonPort = prefsdialog.spinHttpDaemonPort->value(); GET_BOOL(HttpDownloadsEnabled); GET_BOOL(HttpScriptingEnabled); GET_BOOL(HttpWriteScriptingEnabled); GET_BOOL(HttpLocalPlayEnabled); GET_BOOL(HttpBrowsingEnabled); GET_BOOL(HttpRestrictToLocalhost); { // Auto DJ stuff tAutoDJPreferences &adjp = prefs.AutoDJPreferences; adjp.ScoringRuleList.clear(); for (int i = 0; i < prefsdialog.tblAutoDJScoringRules->numRows(); i++) { tAutoDJScoringRule crit; crit.Comment = prefsdialog.tblAutoDJScoringRules->text(i, 0); crit.ScoreAdjustment = dynamic_cast(prefsdialog.tblAutoDJScoringRules->item(i, 1) )->scoreAdjustment(); crit.Criterion = prefsdialog.tblAutoDJScoringRules->text(i, 2); adjp.ScoringRuleList.push_back(crit); } } return make_pair(true, prefsdialog.MediaDirectoriesChanged); } else return make_pair(false, false); } #include "moc_prefs_dialog.cc" madman-0.93/ui/set_list_view.cpp0000644000175000001440000000563410053135242016460 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "database/song_set_tree.h" #include "ui/set_list_view.h" #include "ui/mainwin.h" // tPlaylistNodeListViewItem --------------------------------------------------- tPlaylistNodeListViewItem::tPlaylistNodeListViewItem(QListView *view, tPlaylistNode *node) : QListViewItem(view, node->name()), Node(node) { setRenameEnabled(0, true); setDropEnabled(true); setDragEnabled(true); } tPlaylistNodeListViewItem::tPlaylistNodeListViewItem(QListViewItem *item, tPlaylistNode *node) : QListViewItem(item, node->name()), Node(node) { setRenameEnabled(0, true); setDropEnabled(true); setDragEnabled(true); } tPlaylistNode *tPlaylistNodeListViewItem::node() { return Node; } bool tPlaylistNodeListViewItem::acceptDrop(const QMimeSource *mime) const { return QUriDrag::canDecode(mime); } void tPlaylistNodeListViewItem::dropped(QDropEvent *event) { if (QUriDrag::canDecode(event)) { QStrList uri_list; QUriDrag::decode(event, uri_list); tPlaylist *set = Node->data(); vector filenames; char *uri = uri_list.first(); while (uri) { QString filename = QUriDrag::uriToLocalFile(uri); if (!filename.isNull()) { try { set->add((const char *) filename.utf8()); } catch (exception &ex) { qWarning("%s", ex.what()); } } else { QUrl url(uri); if (url.protocol() == "madmanset" && event->source() == listView()) emit dropNode(url.path().mid(1), Node); } uri = uri_list.next(); } } } // tSetListView --------------------------------------------------------------- tSetListView::tSetListView(QWidget *parent, const char *name, WFlags f) : super(parent, name, f) { addColumn("Set"); setRootIsDecorated(true); } QDragObject *tSetListView::dragObject() { tPlaylistNodeListViewItem *item = (tPlaylistNodeListViewItem *)(currentItem()); if (item == NULL) return NULL; QUrl url; url.setProtocol("madmanset"); url.setHost("localhost"); url.setPath(item->node()->qualifiedName()); QStrList uri_list; uri_list.append(strdup(url.toString(true).latin1())); return new QUriDrag(uri_list, this); } madman-0.93/ui/song_set_view.cpp0000644000175000001440000011452010053135242016446 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 #include #include #include #include #include #include #include #include #include #include #include #include #include "utility/player.h" #include "utility/plugin.h" #include "utility/progress.h" #include "utility/prefs.h" #include "database/auto_dj.h" #include "database/song_list_tools.h" #include "ui/song_set_view.h" #include "ui/mainwin.h" #include "ui/auto_tag.h" // tSongRetag ----------------------------------------------------------------- void tSongRetag::executeOn(tSong *song) { try { song->setFieldText(Field, NewText); } catch (exception &ex) { QMessageBox::warning(qApp->mainWidget(), qApp->translate("ErrorMessages", "madman"), qApp->translate("ErrorMessages", "Error while writing tag:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } // tDeferredSongRetag --------------------------------------------------------- void tDeferredSongRetag::execute() { Retag.executeOn(Song); delete this; } // tVisibilityAction ---------------------------------------------------------- tVisibilityAction::tVisibilityAction(QObject *parent, tSongListView *view, tSongField field) : QAction(parent), ListView(view), Field(field) { setText(getFieldName(Field)); setToggleAction(true); setOn(ListView->isFieldVisible(Field)); connect(this, SIGNAL(toggled(bool)), this, SLOT(onToggle(bool))); } void tVisibilityAction::onToggle(bool on) { if (on) ListView->showField(Field); else ListView->hideField(Field); } // tSongListView -------------------------------------------------------------- tSongListView::tSongListView(QWidget *parent, const char *name) : tAcceleratorTable(parent, name), ProgramInterface(NULL) { setShowGrid(false); setSelectionMode(MultiRow); verticalHeader()->hide(); setLeftMargin(0); setColumnMovingEnabled(true); setDragEnabled(true); setFocusStyle(SpreadSheet); SortIndicatorEnable = false; FieldToColumn.resize(FIELD_COUNT); ColumnToField.resize(FIELD_COUNT); FieldWidths.resize(FIELD_COUNT); ShownColumns = 0; for (int field = 0; field < FIELD_COUNT; field++) { if (field != FIELD_PARTIALPLAYCOUNT && field != FIELD_FULLPLAYCOUNT && field != FIELD_PATH && field != FIELD_EXISTSSINCE && field != FIELD_SIZE && field != FIELD_LASTMODIFIED && field != FIELD_MIMETYPE && field != FIELD_UNIQUEID) { FieldToColumn[ field ] = ShownColumns; ColumnToField[ ShownColumns ] = field; ShownColumns++; } else FieldToColumn[ field ] = -1; FieldWidths[ field ] = 100; } setup(); connect( this, SIGNAL(contextMenuRequested(int, int, const QPoint &)), this, SLOT(slotContextMenuRequested(int, int, const QPoint &))); horizontalHeader()->installEventFilter(this); viewport()->installEventFilter(this); // Fields menu -------------------------------------------------------------- FieldVisibilityMenu = new QPopupMenu(this); for (unsigned i = 0; i < FIELD_COUNT; i++) { QAction *action = new tVisibilityAction(FieldVisibilityMenu, this, (tSongField) i); action->addTo(FieldVisibilityMenu); } } void tSongListView::setSongList(const tSongList &list, bool preserve_scroll_pos) { int contents_x = contentsX(); int contents_y = contentsY(); setUpdatesEnabled(false); verticalHeader()->setUpdatesEnabled(false); SongList = list; setNumRows(list.size()); int row_height = fontMetrics().height() + 2; // set the stage for the "big" row height update below if (list.size()) setRowHeight(0, 0); // set all the in-between row heights for (unsigned row = 1; row < list.size(); row++) setRowHeight(row, row_height); if (preserve_scroll_pos) setContentsPos(contents_x, contents_y); verticalHeader()->setUpdatesEnabled(true); setUpdatesEnabled(true); // this actually triggers the size update for the entire table. if (list.size()) setRowHeight(0, row_height); update(); viewport()->update(); verticalHeader()->update(); } void tSongListView::saveListViewAppearance(QSettings &settings, const QString &prefix) { for (int field = 0; field < FIELD_COUNT; field++) { settings.writeEntry(QString("%1/listview.fields.%2.column"). arg(prefix).arg(field), FieldToColumn[ field ]); settings.writeEntry(QString("%1/listview.fields.%2.width"). arg(prefix).arg(field), FieldWidths[ field ]); } } void tSongListView::loadListViewAppearance(QSettings &settings, const QString &prefix) { vector ftc; vector ctf; vector widths; ftc.resize(FIELD_COUNT); ctf.resize(FIELD_COUNT); widths.resize(FIELD_COUNT); for (int i = 0; i < FIELD_COUNT; i++) ftc[ i ] = -1; for (int i = 0; i < FIELD_COUNT; i++) ctf[ i ] = -1; bool ok; int shown_cols = 0; for (int field = 0; field < FIELD_COUNT; field++) { int column = settings.readNumEntry( QString("%1/listview.fields.%2.column"). arg(prefix).arg(field), 0, &ok); if (!ok) return; if (column >= 0 && column < FIELD_COUNT) { shown_cols++; if (ctf[ column ] == -1) { ftc[ field ] = column; ctf[ column ] = field; } else { // this is not an injective map. disregard it. cout << prefix << " not injective, discarding." << endl; return; } } int width = settings.readNumEntry( QString("%1/listview.fields.%2.width"). arg(prefix).arg(field), 0, &ok); if (ok) widths[ field ] = width; } for (int i = 0; i < shown_cols; i++) if (ctf[ i ] == -1) { // this is not a surjective map. disregard it. cout << prefix << " not surjective, discarding." << endl; return; } FieldToColumn = ftc; ColumnToField = ctf; FieldWidths = widths; ShownColumns = shown_cols; setup(); } void tSongListView::setup() { setUpdatesEnabled(false); horizontalHeader()->setUpdatesEnabled(false); // straighten out header setNumCols(0); // rebuild header setNumCols(ShownColumns); for (int column = 0; column < ShownColumns; column++) { tSongField field = (tSongField) ColumnToField[ column ]; setColumnWidth(column, FieldWidths[ field ]); horizontalHeader()->setLabel(column, getFieldName(field)); } showSortIndicator(); horizontalHeader()->setUpdatesEnabled(true); setUpdatesEnabled(true); update(); viewport()->update(); horizontalHeader()->update(); } void tSongListView::setProgramInterface(tProgramInterface *pi) { ProgramInterface = pi; connect(&pi->preferences().Player, SIGNAL(currentSongChanged()), this, SLOT(currentSongChanged())); updateContents(); } tSong *tSongListView::highlightedSong() { int row = currentRow(); if (row >= 0 && row < (int) SongList.size()) return SongList[ row ]; else return NULL; } void tSongListView::highlightSong(tSong *song) { tSongList::iterator it = ::find(SongList.begin(), SongList.end(), song); if (it != SongList.end()) setCurrentCell(it - SongList.begin(), currentColumn()); } void tSongListView::getSelection(tSongList &songlist) const { songlist.clear(); tIndexList ilist; getSelection(ilist); FOREACH_CONST(first, ilist, tIndexList) { if (*first >= 0 && unsigned(*first) < SongList.size()) songlist.push_back(SongList[ *first ]); } } void tSongListView::getSelection(tIndexList &indexlist) const { indexlist.clear(); unsigned num = numSelections(); for (unsigned i = 0; i < num; i++) { QTableSelection sel = selection(i); if (sel.isActive()) for (int row = sel.topRow(); row <= sel.bottomRow(); row++) indexlist.push_back(row); } } void tSongListView::setSongDropEnable(bool enabled) { setAcceptDrops(true); viewport()->setAcceptDrops(true); } void tSongListView::setSortIndicator(bool enable, tSongField field, bool ascending) { SortIndicatorEnable = enable; SortIndicatorField = field; IndicatorAscending = ascending; showSortIndicator(); } void tSongListView::columnWidthChanged(int col) { super::columnWidthChanged(col); FieldWidths[ ColumnToField[ col ] ] = columnWidth(col); } void tSongListView::swapColumns (int col1, int col2, bool swapHeader) { swap(ColumnToField[ col1 ], ColumnToField[ col2 ]); for (int col = 0; col < ShownColumns; col++) FieldToColumn[ ColumnToField[ col ] ] = col; setup(); } void tSongListView::sortColumn (int col, bool ascending, bool wholeRows) { emit sortingChanged((tSongField) ColumnToField[ col ], ascending); } bool tSongListView::isFieldVisible(tSongField field) { return FieldToColumn[ field ] >= 0; } void tSongListView::showField(tSongField field) { if (FieldToColumn[ field ] >= 0) return; FieldToColumn[ field ] = ShownColumns; ColumnToField[ ShownColumns ] = field; ShownColumns++; setup(); } void tSongListView::hideField(tSongField field) { int column = FieldToColumn[ field ]; if (column < 0) return; FieldToColumn[ field ] = -1; ShownColumns--; for (int i = 0; i < FIELD_COUNT; i++) { tSongField f = (tSongField) i; if (FieldToColumn[ f ] > column) FieldToColumn[ f ]--; } // update ColumnToField for (int i = 0; i < FIELD_COUNT; i++) ColumnToField[ i ] = -1; for (int i = 0; i < FIELD_COUNT; i++) { tSongField f = (tSongField) i; int c = FieldToColumn[ f ]; if (c >= 0) ColumnToField[ c ] = f; } setup(); } void tSongListView::slotContextMenuRequested (int row, int col, const QPoint & pos) { if (row >= 0 && row < int(SongList.size())) emit contextMenuRequested( SongList[ row ], (tSongField) ColumnToField[ col ], pos); } void tSongListView::currentSongChanged() { updateContents(); } // QTable backend ------------------------------------------------------------- QTableItem *tSongListView::item(int r, int c) { return NULL; } void tSongListView::setItem(int r, int c, QTableItem *i) { } void tSongListView::takeItem(QTableItem *item) { QTable::takeItem(item); } void tSongListView::clearCell(int r, int c) { } void tSongListView::insertWidget(int r, int c, QWidget *w) { WidgetDictionary.replace(indexOf(r, c), w); } QWidget *tSongListView::cellWidget(int r, int c) const { return WidgetDictionary.find(indexOf(r, c)); } void tSongListView::clearCellWidget(int r, int c) { QWidget *w = WidgetDictionary.take(indexOf(r, c)); if (w) w->deleteLater(); } QWidget *tSongListView::createEditor (int row, int col, bool initFromCell) const { tSongField field = (tSongField) ColumnToField[ col ]; tSong *song = SongList[ row ]; if (field == FIELD_ARTIST || field == FIELD_PERFORMER || field == FIELD_TITLE || field == FIELD_ALBUM || field == FIELD_YEAR || field == FIELD_TRACKNUMBER) { QLineEdit *e = new QLineEdit(viewport(), "qt_lineeditor_in_qtable"); e->setText(song->fieldText(field)); e->selectAll(); return e; } else if (field == FIELD_GENRE) { QComboBox *cb = new QComboBox(viewport(), "qt_combobox_in_qtable"); cb->setEditable(true); for (int i = 0; i < GENRE_COUNT; i++) cb->insertItem(genreIdToString(i)); cb->setCurrentText(song->fieldText(field)); cb->lineEdit()->selectAll(); cb->lineEdit()->setFrame(false); cb->setAutoCompletion(true); return cb; } else return NULL; } void tSongListView::setCellContentFromEditor (int row, int col) { tSongField field = (tSongField) ColumnToField[ col ]; QString new_text; if (field == FIELD_GENRE) { QComboBox *e = (QComboBox*) cellWidget(row, col); new_text = e->currentText(); } else { QLineEdit *e = (QLineEdit*) cellWidget(row, col); new_text = e->text(); } tSong *song = SongList[ row ]; emit fieldChanged(song, field, new_text); } void tSongListView::paintCell (QPainter *p, int row, int col, const QRect & cr, bool selected, const QColorGroup & cg) { tSongField field = (tSongField) ColumnToField[ col ]; tSong *song = SongList[ row ]; QString field_text = song->humanReadableFieldText(field); QColor background; if (selected) { if (row % 2 == 0) background = cg.color(QColorGroup::Highlight).light(120); else background = cg.color(QColorGroup::Highlight); } else if (row % 2 == 0) background = cg.color(QColorGroup::Base); else background = cg.color(QColorGroup::Base).dark(105); p->fillRect(0, 0, cr.width(), cr.height(), background); int w = cr.width(); int h = cr.height(); if (selected) p->setPen(cg.highlightedText()); else p->setPen(cg.text()); bool do_restore_font = false; QFont previous_font; if (ProgramInterface && song->filename() == ProgramInterface->preferences().Player.currentFilename()) { previous_font = p->font(); QFont bold_font = previous_font; bold_font.setBold(true); p->setFont(bold_font); do_restore_font = true; } QFontMetrics metrics = p->fontMetrics(); if (metrics.width(field_text) > w) { while (metrics.width(field_text + "...") > w && field_text.length()) field_text.remove(field_text.length() - 1, 1); field_text += "..."; } p->drawText(1, 1, w - 2, h, Qt::AlignLeft, field_text); if (do_restore_font) p->setFont(previous_font); } void tSongListView::noticeSongModified(const tSong *song, tSongField field) { for (unsigned i = 0; i < SongList.size(); i++) if (song == SongList[ i ]) { int column = FieldToColumn[ field ]; if (column != -1) updateCell(i, column); } } bool tSongListView::eventFilter (QObject * watched, QEvent * e) { if (watched == horizontalHeader() && e->type() == QEvent::MouseButtonPress) { QMouseEvent *me = (QMouseEvent *) e; if ( me->button() == Qt::RightButton) { FieldVisibilityMenu->popup(me->globalPos()); return true; } else return super::eventFilter(watched, e); } else if (watched == viewport() && e->type() == QEvent::MouseButtonDblClick) { QMouseEvent *me = (QMouseEvent *) e; if ( me->button() == Qt::LeftButton) { int row = rowAt(viewportToContents(me->pos()).y()); if (row >= 0) emit doubleClicked(SongList[ row ]); return true; } else return false; } else return super::eventFilter(watched, e); } void tSongListView::contentsDragEnterEvent(QDragEnterEvent *event) { if (QUriDrag::canDecode(event)) event->accept(); } void tSongListView::contentsDragMoveEvent(QDragMoveEvent *event) { if (QUriDrag::canDecode(event)) event->accept(); } void tSongListView::contentsDropEvent(QDropEvent *event) { if (QUriDrag::canDecode(event)) { QStrList uri_list; QUriDrag::decode(event, uri_list); vector filenames; char *uri = uri_list.first(); while (uri) { QString filename = QUriDrag::uriToLocalFile(uri); if (!filename.isNull()) filenames.push_back((const char *) filename.utf8()); uri = uri_list.next(); } int row = rowAt(event->pos().y()); tSong *onto_song = NULL; if (row >= 0 && row < (int) SongList.size()) onto_song = SongList[ row ]; emit songsDropped(event->source() == this, onto_song, filenames); } } void tSongListView::contentsMousePressEvent (QMouseEvent * e) { super::contentsMousePressEvent(e); } void tSongListView::contentsMouseReleaseEvent (QMouseEvent * e) { super::contentsMouseReleaseEvent(e); } QDragObject *tSongListView::dragObject() { QStrList uris; tSongList songlist; getSelection(songlist); FOREACH_CONST(first, songlist, tSongList) uris.append(QUriDrag::localFileToUri(QString::fromUtf8((*first)->filename().c_str()))); return new QUriDrag(uris, this); } void tSongListView::showSortIndicator() { if (SortIndicatorEnable) horizontalHeader()->setSortIndicator(FieldToColumn[ SortIndicatorField ], IndicatorAscending); else horizontalHeader()->setSortIndicator(-1); } // tSongSetViewManager -------------------------------------------------------- tSongSetViewManager::tSongSetViewManager(tSongListView &lv, tProgramInterface &pi, const QString & pref_prefix ) : ListView(lv), ProgramInterface(pi), LastRetagValid(false), PreferencesPrefix(pref_prefix) { connect(&ListView, SIGNAL(fieldChanged(tSong *, tSongField, const QString &)), this, SLOT(fieldChanged(tSong *, tSongField, const QString &))); connect(&ListView, SIGNAL(contextMenuRequested(tSong *,tSongField, const QPoint &)), this, SLOT(contextMenuRequested(tSong *, tSongField, const QPoint &))); connect(&ListView, SIGNAL(doubleClicked(tSong *)), this, SLOT(slotPlayNow(tSong *))); connect(&ListView, SIGNAL(selectionChanged()), this, SLOT(selectionChanged())); connect(&ListView, SIGNAL(sortingChanged(tSongField, bool)), this, SLOT(sortingChanged(tSongField, bool))); } void tSongSetViewManager::setup() { ListView.setProgramInterface(&ProgramInterface); auto_ptr new_menu (buildPopupMenu()); Menu = new_menu; } void tSongSetViewManager::saveListViewAppearance(QSettings &settings) { ListView.saveListViewAppearance(settings, PreferencesPrefix); } void tSongSetViewManager::loadListViewAppearance(QSettings &settings) { ListView.loadListViewAppearance(settings, PreferencesPrefix); } void tSongSetViewManager::changeSongSet(tSongSet *from, tSongSet *to) { if (from) { disconnect(from, NULL, this, NULL); } if (to) { connect( to, SIGNAL(notifyChange(bool, tProgress *)), this, SLOT(noticeSongSetModified(bool, tProgress *))); connect( to, SIGNAL(notifySongModified(const tSong *, tSongField)), &ListView, SLOT(noticeSongModified (const tSong *, tSongField))); } redisplay(false); emit notifySongSetChanged(); } QPopupMenu *tSongSetViewManager::buildPopupMenu() { QPopupMenu *menu = new QPopupMenu(&ListView); menu->insertItem(tr("Edit this &tag (F2)"), this, SLOT(slotEditThisTag())); menu->insertSeparator(); // Play menu ---------------------------------------------------------------- QPopupMenu *play_menu = new QPopupMenu(&ListView); play_menu->insertItem(tr("&Play now (F9)"), this, SLOT(slotPlayNow())); play_menu->insertItem(tr("Play &next (F10)"), this, SLOT(slotPlayNext())); play_menu->insertItem(tr("Play &evenutally (F11)"), this, SLOT(slotPlayEventually())); play_menu->insertSeparator(); play_menu->insertItem(tr("Auto DJ 20 songs"), this, SLOT(slotAutoDJ())); menu->insertItem(tr("&Play"), play_menu); ListView.addShortCut(new tKeyboardShortCut(Key_F9, this, SLOT(slotPlayNow()))); ListView.addShortCut(new tKeyboardShortCut(Key_F10, this, SLOT(slotPlayNext()))); ListView.addShortCut(new tKeyboardShortCut(Key_F11, this, SLOT(slotPlayEventually()))); // Rate menu ---------------------------------------------------------------- QPopupMenu *rate_menu = new QPopupMenu(&ListView); rate_menu->insertItem(tr("&No rating"), this, SLOT(rateNone())); rate_menu->insertSeparator(); rate_menu->insertItem(tr("&0: -"), this, SLOT(rate0())); rate_menu->insertItem(tr("&1: *"), this, SLOT(rate1())); rate_menu->insertItem(tr("&2: **"), this, SLOT(rate2())); rate_menu->insertItem(tr("&3: ***"), this, SLOT(rate3())); rate_menu->insertItem(tr("&4: ****"), this, SLOT(rate4())); rate_menu->insertItem(tr("&5: *****"), this, SLOT(rate5())); menu->insertItem(tr("&Rate"), rate_menu); ListView.addShortCut(new tKeyboardShortCut(Key_0, this, SLOT(rate0()))); ListView.addShortCut(new tKeyboardShortCut(Key_1, this, SLOT(rate1()))); ListView.addShortCut(new tKeyboardShortCut(Key_2, this, SLOT(rate2()))); ListView.addShortCut(new tKeyboardShortCut(Key_3, this, SLOT(rate3()))); ListView.addShortCut(new tKeyboardShortCut(Key_4, this, SLOT(rate4()))); ListView.addShortCut(new tKeyboardShortCut(Key_5, this, SLOT(rate5()))); // Like songs --------------------------------------------------------------- QPopupMenu *like_songs_menu = new QPopupMenu(&ListView); like_songs_menu->insertItem(tr("Play now all by this artist"), this, SLOT(playNowAllByThisArtist())); like_songs_menu->insertItem(tr("Play next all by this artist"), this, SLOT(playNextAllByThisArtist())); like_songs_menu->insertItem(tr("Play eventually all by this artist"), this, SLOT(playEventuallyAllByThisArtist())); like_songs_menu->insertItem(tr("View all by this artist"), this, SLOT(viewAllByThisArtist())); like_songs_menu->insertSeparator(); like_songs_menu->insertItem(tr("Play now all on this album"), this, SLOT(playNowAllOnThisAlbum())); like_songs_menu->insertItem(tr("Play next all on this album"), this, SLOT(playNextAllOnThisAlbum())); like_songs_menu->insertItem(tr("Play eventually all on this album"), this, SLOT(playEventuallyAllOnThisAlbum())); like_songs_menu->insertItem(tr("View all on this album"), this, SLOT(viewAllOnThisAlbum())); menu->insertItem(tr("&Songs like this one"), like_songs_menu); // Tag menu ----------------------------------------------------------------- QPopupMenu *tag_menu = new QPopupMenu(&ListView); tag_menu->insertItem(tr("AutoTag"), this, SLOT(autoTag())); tag_menu->insertSeparator(); tag_menu->insertItem(tr("Repeat last retag on selection"), this, SLOT(redoRetag())); tag_menu->insertItem(tr("R&eread tag"), this, SLOT(rereadTag())); tag_menu->insertItem(tr("Re&write tag"), this, SLOT(rewriteTag())); tag_menu->insertItem(tr("&Strip tag"), this, SLOT(stripTag())); menu->insertItem(tr("&Tag"), tag_menu); // Plugins menu ------------------------------------------------------------- QPopupMenu *plugins_menu = new QPopupMenu(&ListView); MenuIdToPluginFilenameMap.clear(); tPluginList plugins; enumeratePlugins(ProgramInterface.preferences().PluginDirectories, plugins); FOREACH(first, plugins, tPluginList) { int id = plugins_menu->insertItem(first->MenuString); MenuIdToPluginFilenameMap[ id ] = first->Filename; } connect(plugins_menu, SIGNAL(activated(int)), this, SLOT(pluginActivated(int))); menu->insertItem(tr("Run &Plugin"), plugins_menu); // Others ------------------------------------------------------------------- menu->insertSeparator(); menu->insertItem(tr("&Delete from disk (Ctrl+Del)"), this, SLOT(deleteFromDisk())); menu->insertItem(tr("R&eset play statistics"), this, SLOT(resetStatistics())); menu->insertItem(tr("&Highlight current song (F12)"), this, SLOT(highlightCurrentSong())); ListView.addShortCut(new tKeyboardShortCut(Key_F12, this, SLOT(highlightCurrentSong()))); ListView.addShortCut(new tKeyboardShortCut(CTRL + Key_Delete, this, SLOT(deleteFromDisk()))); return menu; } void tSongSetViewManager::noticeSongSetModified(bool substantial_change, tProgress *progress) { redisplay(!substantial_change, progress); emit notifySongSetChanged(); } void tSongSetViewManager::redisplay(bool preserve_scroll_pos, tProgress *progress) { if (songSet()) { tSongList list; songSet()->render(list, progress); ListView.setSongList(list, preserve_scroll_pos); } else ListView.setSongList(tSongList(), false); } void tSongSetViewManager::fieldChanged(tSong *song, tSongField field, const QString &new_text) { tDeferredSongRetag *retag = new tDeferredSongRetag; retag->Song = song; retag->Retag.NewText = new_text; retag->Retag.Field = field; QTimer::singleShot(0, retag, SLOT(execute())); LastRetagValid = true; LastRetag = retag->Retag; } void tSongSetViewManager::contextMenuRequested(tSong *song, tSongField field, const QPoint &pos) { Menu->popup(pos); } void tSongSetViewManager::slotEditThisTag() { ListView.editCell(ListView.currentRow(), ListView.currentColumn(), false); } void tSongSetViewManager::slotPlayNow() { tSongList list; ListView.getSelection(list); ProgramInterface.preferences().Player.playNow(list); } void tSongSetViewManager::slotPlayNow(tSong *item) { slotPlayNow(); } void tSongSetViewManager::slotPlayNext() { tSongList list; ListView.getSelection(list); ProgramInterface.preferences().Player.playNext(list); } void tSongSetViewManager::slotPlayEventually() { tSongList list; ListView.getSelection(list); ProgramInterface.preferences().Player.playEventually(list); } void tSongSetViewManager::slotAutoDJ() { try { if (songSet() == NULL) return; tSongList songs; tAutoDJ dj(ProgramInterface.preferences().AutoDJPreferences, songSet()); dj.selectSongs(songs, 20); ProgramInterface.preferences().Player.playEventually(songs); } catch (exception &ex) { QMessageBox::warning(&ListView, tr("madman"), tr("Auto DJ encountered an error:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tSongSetViewManager::rate(int rating) { if (songSet()) { tSongList list; ListView.getSelection(list); if (list.size() > 5) songSet()->beginBulkChange(); FOREACH(first, list, tSongList) (*first)->setRating(rating); if (list.size() > 5) songSet()->endBulkChange(); } } void tSongSetViewManager::viewByCriterion(const QString &crit) { emit notifySearchChangeRequested(crit); } void tSongSetViewManager::playByCriterion(const QString &crit, tPlayWhen when) { tPlaylist set; set.setSongCollection(&ProgramInterface.database().SongCollection); set.setCriterion(crit); set.reevaluateCriterion(); tSongList list; set.render(list); switch (when) { case PLAY_NOW: ProgramInterface.preferences().Player.playNow(list); return; case PLAY_NEXT: ProgramInterface.preferences().Player.playNext(list); return; case PLAY_EVENTUALLY: ProgramInterface.preferences().Player.playEventually(list); return; } } void tSongSetViewManager::resetStatistics() { if (songSet()) { tSongList list; ListView.getSelection(list); if (list.size() > 5) songSet()->beginBulkChange(); FOREACH(first, list, tSongList) (*first)->resetStatistics(); if (list.size() > 5) songSet()->endBulkChange(); } } void tSongSetViewManager::deleteFromDisk() { try { tSongList list; ListView.getSelection(list); if (QMessageBox::warning(&ListView, tr("File Deletion"), tr("OK to physically delete %1 files?").arg(list.size()), QMessageBox::Yes, QMessageBox::No) == QMessageBox::Yes) { ProgramInterface.database().SongCollection.beginBulkChange(); FOREACH_CONST(first, list, tSongList) { if (ProgramInterface.database().SongCollection.isValid(*first)) { ProgramInterface.database().SongCollection.remove(*first); unlink((*first)->filename().c_str()); } } ProgramInterface.database().SongCollection.endBulkChange(); } } catch (exception &ex) { QMessageBox::warning(&ListView, tr("madman"), tr("Error while deleting file:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tSongSetViewManager::highlightCurrentSong() { tFilename current_song = ProgramInterface.preferences().Player.currentFilename(); tSong *song = ProgramInterface.database().SongCollection.getByFilename(current_song); if (song) highlight(song); } void tSongSetViewManager::autoTag() { tSongList list; ListView.getSelection(list); showAutoTagger(ListView.topLevelWidget(), list, ProgramInterface.database()); } void tSongSetViewManager::redoRetag() { if (LastRetagValid) { tSongList list; ListView.getSelection(list); if (QMessageBox::warning(&ListView, tr("madman"), tr("OK to set the '%1' column of %2 songs to '%3'?") .arg(getFieldName(LastRetag.Field)) .arg(list.size()) .arg(LastRetag.NewText) , QMessageBox::Yes, QMessageBox::No) == QMessageBox::Yes) { QProgressDialog progress(tr("Retagging songs..."), tr("Cancel"), list.size(), &ListView, "progress", true); unsigned int index = 0; FOREACH_CONST(first, list, tSongList) { progress.setProgress(index); if (progress.wasCancelled()) break; LastRetag.executeOn(*first); index++; } } } else QMessageBox::information(&ListView, tr("madman"), tr("There was no previous retag. Sorry."), QMessageBox::Ok); } void tSongSetViewManager::rereadTag() { tSongList list; ListView.getSelection(list); try { FOREACH_CONST(first, list, tSongList) { (*first)->invalidateCache(); (*first)->ensureInfoIsThere(); } } catch (exception &ex) { QMessageBox::warning(&ListView, tr("madman"), tr("Error while rereading tag:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tSongSetViewManager::rewriteTag() { tSongList list; ListView.getSelection(list); try { FOREACH_CONST(first, list, tSongList) (*first)->rewriteTag(); } catch (exception &ex) { QMessageBox::warning(&ListView, tr("madman"), tr("Error while rewriting tag:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tSongSetViewManager::stripTag() { tSongList list; ListView.getSelection(list); try { FOREACH_CONST(first, list, tSongList) (*first)->stripTag(); } catch (exception &ex) { QMessageBox::warning(&ListView, tr("madman"), tr("Error while stripping tag:\n%1").arg(ex.what()), QMessageBox::Ok, QMessageBox::NoButton); } } void tSongSetViewManager::highlight(tSong *song) { ListView.highlightSong(song); } void tSongSetViewManager::pluginActivated(int id) { try { tPluginList plugins; enumeratePlugins(ProgramInterface.preferences().PluginDirectories, plugins); hash_map::iterator it = MenuIdToPluginFilenameMap.find(id); if (it != MenuIdToPluginFilenameMap.end()) { QString name = it->second; tSongList selection; ListView.getSelection(selection); FOREACH(first, plugins, tPluginList) if (first->Filename == name) { bool confirmed = !first->Confirm || QMessageBox::warning(&ListView, tr("madman"), tr("Are you sure you want to run plugin '%1' on %2 songs?") .arg(first->Name).arg(selection.size()), QMessageBox::Yes, QMessageBox::No) == QMessageBox::Yes; if (confirmed) { first->run(ProgramInterface.settings(), selection); if (first->RescanAfter) { // FIXME revive // ProgramInterface.rescan(); } } return; } } else throw tRuntimeError(tr("This plugin has mysteriously disappeared")); } catch (exception &ex) { QMessageBox::warning(&ListView, tr("madman"), ex.what(), QMessageBox::Ok, 0); } } void tSongSetViewManager::selectionChanged() { tSongList list; ListView.getSelection(list); ProgramInterface.setStatus(stringifySongListSummary(list)); } QString tSongSetViewManager::getCurrentArtistCriterion() { tSong *hlsong = ListView.highlightedSong(); if (hlsong == NULL) return QString::null; return QString("~artist(complete:%1)").arg(quoteString(hlsong->artist())); } QString tSongSetViewManager::getCurrentAlbumCriterion() { tSong *hlsong = ListView.highlightedSong(); if (hlsong == NULL) return QString::null; return QString("~artist(complete:%1)&~album(complete:%2)") .arg(quoteString(hlsong->artist())) .arg(quoteString(hlsong->album())); } // tPlaylistViewManager ------------------------------------------------------- tPlaylistViewManager::tPlaylistViewManager(tSongListView &lv, tProgramInterface &pi, const QString & pref_prefix) : tSongSetViewManager(lv, pi, pref_prefix), Playlist(NULL) { ListView.setSorting(true); ListView.setSongDropEnable(true); connect(&ListView, SIGNAL(songsDropped(bool,tSong *,vector &)), this, SLOT(songsDropped(bool,tSong *,vector &))); } QPopupMenu *tPlaylistViewManager::buildPopupMenu() { QPopupMenu *menu = super::buildPopupMenu(); menu->insertItem(tr("Remo&ve from playlist (Del)"), this, SLOT(removeSelected())); QPopupMenu *reorder_menu = new QPopupMenu(&ListView); reorder_menu->insertItem(tr("Sort by &Artist"), this, SLOT(sortByArtist())); reorder_menu->insertItem(tr("Sort by &Title"), this, SLOT(sortByTitle())); reorder_menu->insertItem(tr("Sort by A&lbum"), this, SLOT(sortByAlbum())); reorder_menu->insertItem(tr("Sort by &Track number"), this, SLOT(sortByTrackNumber())); reorder_menu->insertItem(tr("Sort by &Year"), this, SLOT(sortByYear())); reorder_menu->insertItem(tr("Sort by &Genre"), this, SLOT(sortByGenre())); reorder_menu->insertSeparator(); reorder_menu->insertItem(tr("Jumble"), this, SLOT(jumble())); reorder_menu->insertItem(tr("Reverse"), this, SLOT(reverse())); menu->insertSeparator(); menu->insertItem(tr("&Reorder"), reorder_menu); menu->insertSeparator(); menu->insertItem(tr("Export to player's current playlist"), this, SLOT(uploadPlaylist())); menu->insertItem(tr("Import player's current playlist"), this, SLOT(downloadPlaylist())); menu->insertItem(tr("Import M3U"), this, SLOT(importM3U())); ListView.addShortCut(new tKeyboardShortCut(Key_Delete, this, SLOT(removeSelected()))); return menu; } void tPlaylistViewManager::setSongSet(tPlaylist *pl) { Playlist = pl; changeSongSet(Playlist, pl); } void tPlaylistViewManager::removeSelected() { if (Playlist == NULL) return; tIndexList list; ListView.getSelection(list); sort(list.begin(), list.end()); ::std::reverse(list.begin(), list.end()); FOREACH(first, list, tIndexList) Playlist->remove(*first); } void tPlaylistViewManager::uploadPlaylist() { if (Playlist) { tSongList rendering; Playlist->render(rendering); ProgramInterface.preferences().Player.setPlayList(rendering); } } void tPlaylistViewManager::downloadPlaylist() { if (Playlist == NULL) return; vector playlist; ProgramInterface.preferences().Player.getPlayList(playlist); FOREACH(first, playlist, vector) { try { Playlist->add(*first); } catch (...) { } } } void tPlaylistViewManager::importM3U() { QString filename = QFileDialog::getOpenFileName(QString::null, qApp->translate("importM3UIntoPlaylist", "Playlist (*.m3u)"), qApp->mainWidget()); if (filename.isNull()) return; importM3UIntoPlaylist(Playlist, filename); } void tPlaylistViewManager::sortBy(tSongField field) { if (Playlist) Playlist->sortBy(field); } void tPlaylistViewManager::jumble() { if (Playlist) Playlist->jumble(); } void tPlaylistViewManager::reverse() { if (Playlist) Playlist->reverse(); } void tPlaylistViewManager::songsDropped(bool from_same_widget, tSong *onto, vector &songs) { if (Playlist == NULL) return; int preferred_index = -1; Playlist->beginBulkChange(); if (from_same_widget) { removeSelected(); } if (onto) { tSongList rendering; Playlist->render(rendering); int index = 0; FOREACH_CONST(first, rendering, tSongList) { if (*first == onto) { preferred_index = index; break; } index++; } } FOREACH_CONST(first, songs, vector) { try { Playlist->add(*first, preferred_index); if (preferred_index != -1) ++preferred_index; } catch (exception &ex) { qWarning("%s", ex.what()); } } Playlist->endBulkChange(); } void tPlaylistViewManager::sortingChanged(tSongField field, bool ascending) { if (Playlist) Playlist->sortBy(field, ascending); } // tSearchViewManager --------------------------------------------------------- tSearchViewManager::tSearchViewManager(tSongListView &lv, tProgramInterface &pi, const QString & pref_prefix ) : tSongSetViewManager(lv, pi, pref_prefix), SearchSongSet(NULL), DoDisplaySort(true), SortField(FIELD_ARTIST), Ascending(true) { ListView.setSorting(true); } void tSearchViewManager::saveListViewAppearance(QSettings &settings) { settings.writeEntry(QString("%1/listview.do_display_sort") .arg(PreferencesPrefix), DoDisplaySort ? 1 : 0); settings.writeEntry(QString("%1/listview.sort_field") .arg(PreferencesPrefix), SortField); settings.writeEntry(QString("%1/listview.ascending") .arg(PreferencesPrefix), Ascending ? 1 : 0); super::saveListViewAppearance(settings); } void tSearchViewManager::loadListViewAppearance(QSettings &settings) { DoDisplaySort = settings.readNumEntry(QString("%1/listview.do_display_sort") .arg(PreferencesPrefix), 1) != 0; SortField = (tSongField) settings.readNumEntry(QString("%1/listview.sort_field") .arg(PreferencesPrefix), FIELD_ARTIST); Ascending = settings.readNumEntry(QString("%1/listview.ascending") .arg(PreferencesPrefix), 1) != 0; super::loadListViewAppearance(settings); } void tSearchViewManager::setSongSet(tSearchSongSet *ss) { changeSongSet(SearchSongSet, ss); SearchSongSet = ss; ss->setSort(DoDisplaySort, SortField, Ascending); } QPopupMenu *tSearchViewManager::buildPopupMenu() { QPopupMenu *menu = super::buildPopupMenu(); menu->insertSeparator(); menu->insertItem(tr("&Add to current playlist (Ins)"), this, SLOT(slotAdd())); ListView.addShortCut(new tKeyboardShortCut(Key_Insert, this, SLOT(slotAdd()))); return menu; } void tSearchViewManager::redisplay(bool preserve_scroll_pos, tProgress *progress) { ListView.setSortIndicator(DoDisplaySort, SortField, Ascending); super::redisplay(preserve_scroll_pos, progress); } void tSearchViewManager::slotAdd() { tSongList list; ListView.getSelection(list); emit add(list); } void tSearchViewManager::sortingChanged(tSongField field, bool ascending) { DoDisplaySort = true; SortField = field; Ascending = ascending; if (SearchSongSet) SearchSongSet->setSort(DoDisplaySort, field, ascending); } // Stuff to tell EMACS how to format this file. // Local Variables: // mode: C++ // eval: (c-set-style "stroustrup") // eval: (c-set-offset 'access-label -2) // eval: (c-set-offset 'inline-open 0) // c-basic-offset: 2 // tab-width: 8 // End: madman-0.93/ui/trayicon.cpp0000644000175000001440000001320410053135242015420 0ustar akusers00000000000000/* * trayicon.cpp - system-independent trayicon class (adapted from Qt example) * Copyright (C) 2003 Justin Karneges * * 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 * */ #include "trayicon.h" #include "qpopupmenu.h" /*! \class TrayIcon qtrayicon.h \brief The TrayIcon class implements an entry in the system tray. */ /*! Creates a TrayIcon object. \a parent and \a name are propagated to the QObject constructor. The icon is initially invisible. \sa show */ TrayIcon::TrayIcon(QObject *parent, const char *name) : QObject(parent, name), pop(0), d(0) { v_isWMDock = FALSE; } /*! Creates a TrayIcon object displaying \a icon and \a tooltip, and opening \a popup when clicked with the right mousebutton. \a parent and \a name are propagated to the QObject constructor. The icon is initially invisible. \sa show */ TrayIcon::TrayIcon(const QPixmap &icon, const QString &tooltip, QPopupMenu *popup, QObject *parent, const char *name) : QObject(parent, name), pop(popup), pm(icon), tip(tooltip), d(0) { v_isWMDock = FALSE; } /*! Removes the icon from the system tray and frees all allocated resources. */ TrayIcon::~TrayIcon() { sysRemove(); } /*! Sets the context menu to \a popup. The context menu will pop up when the user clicks the system tray entry with the right mouse button. */ void TrayIcon::setPopup(QPopupMenu* popup) { pop = popup; } /*! Returns the current popup menu. \sa setPopup */ QPopupMenu* TrayIcon::popup() const { return pop; } /*! \property TrayIcon::icon \brief the system tray icon. */ void TrayIcon::setIcon(const QPixmap &icon) { //if(!popup()) { // tip = ""; //} pm = icon; sysUpdateIcon(); } QPixmap TrayIcon::icon() const { return pm; } /*! \property TrayIcon::toolTip \brief the tooltip for the system tray entry On some systems, the tooltip's length is limited and will be truncated as necessary. */ void TrayIcon::setToolTip(const QString &tooltip) { tip = tooltip; sysUpdateToolTip(); } QString TrayIcon::toolTip() const { return tip; } /*! Shows the icon in the system tray. \sa hide */ void TrayIcon::show() { sysInstall(); } /*! Hides the system tray entry. */ void TrayIcon::hide() { sysRemove(); } /*! \reimp */ bool TrayIcon::event(QEvent *e) { switch (e->type()) { case QEvent::MouseMove: mouseMoveEvent((QMouseEvent*)e); break; case QEvent::MouseButtonPress: mousePressEvent((QMouseEvent*)e); break; case QEvent::MouseButtonRelease: mouseReleaseEvent((QMouseEvent*)e); break; case QEvent::MouseButtonDblClick: mouseDoubleClickEvent((QMouseEvent*)e); break; default: return QObject::event(e); } return TRUE; } /*! This event handler can be reimplemented in a subclass to receive mouse move events for the system tray entry. \sa mousePressEvent(), mouseReleaseEvent(), mouseDoubleClickEvent(), QMouseEvent */ void TrayIcon::mouseMoveEvent(QMouseEvent *e) { e->ignore(); } /*! This event handler can be reimplemented in a subclass to receive mouse press events for the system tray entry. \sa mouseReleaseEvent(), mouseDoubleClickEvent(), mouseMoveEvent(), QMouseEvent */ void TrayIcon::mousePressEvent(QMouseEvent *e) { e->ignore(); } /*! This event handler can be reimplemented in a subclass to receive mouse release events for the system tray entry. The default implementations opens the context menu when the entry has been clicked with the right mouse button. \sa setPopup(), mousePressEvent(), mouseDoubleClickEvent(), mouseMoveEvent(), QMouseEvent */ void TrayIcon::mouseReleaseEvent(QMouseEvent *e) { switch (e->button()) { case RightButton: if (pop) { // Necessary to make keyboard focus // and menu closing work on Windows. #ifdef Q_WS_WIN pop->setActiveWindow(); #endif pop->popup(e->globalPos()); #ifdef Q_WS_WIN pop->setActiveWindow(); #endif e->accept(); } break; case LeftButton: case MidButton: emit clicked(e->globalPos(), e->button()); break; default: break; } e->ignore(); } /*! This event handler can be reimplemented in a subclass to receive mouse double click events for the system tray entry. Note that the system tray entry gets a mousePressEvent() and a mouseReleaseEvent() before the mouseDoubleClickEvent(). \sa mousePressEvent(), mouseReleaseEvent(), mouseMoveEvent(), QMouseEvent */ void TrayIcon::mouseDoubleClickEvent(QMouseEvent *e) { if (e->button() == LeftButton) emit doubleClicked(e->globalPos()); e->ignore(); } /*! \fn void TrayIcon::clicked(const QPoint &p) This signal is emitted when the user clicks the system tray icon with the left mouse button, with \a p being the global mouse position at that moment. */ /*! \fn void TrayIcon::doubleClicked(const QPoint &p) This signal is emitted when the user double clicks the system tray icon with the left mouse button, with \a p being the global mouse position at that moment. */ void TrayIcon::gotCloseEvent() { closed(); } madman-0.93/ui/trayicon_x11.cpp0000644000175000001440000000777710053135242016133 0ustar akusers00000000000000/* * trayicon_x11.cpp - X11 trayicon (for use with KDE and GNOME) * Copyright (C) 2003 Justin Karneges * GNOME2 Notification Area support: Tomasz Sterna * * 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 * */ #include "trayicon_x11.h" /* for Gnome2 Notification Area */ static XErrorHandler old_handler = 0; static int dock_xerror = 0; static int dock_xerrhandler(Display* dpy, XErrorEvent* err) { dock_xerror = err->error_code; return old_handler(dpy, err); } static void trap_errors() { dock_xerror = 0; old_handler = XSetErrorHandler(dock_xerrhandler); } static bool untrap_errors() { XSetErrorHandler(old_handler); return (dock_xerror == 0); } static bool send_message( Display* dpy, /* display */ Window w, /* sender (tray icon window) */ long message, /* message opcode */ long data1, /* message data 1 */ long data2, /* message data 2 */ long data3 /* message data 3 */ ){ XEvent ev; memset(&ev, 0, sizeof(ev)); ev.xclient.type = ClientMessage; ev.xclient.window = w; ev.xclient.message_type = XInternAtom (dpy, "_NET_SYSTEM_TRAY_OPCODE", False); ev.xclient.format = 32; ev.xclient.data.l[0] = CurrentTime; ev.xclient.data.l[1] = message; ev.xclient.data.l[2] = data1; ev.xclient.data.l[3] = data2; ev.xclient.data.l[4] = data3; trap_errors(); XSendEvent(dpy, w, False, NoEventMask, &ev); XSync(dpy, False); return untrap_errors(); } /*static QPixmap buildIcon(const QPixmap &_in) { QImage image(22,22,32); image.fill(0); image.setAlphaBuffer(TRUE); QImage in = _in.convertToImage(); //QImage in(22,22,32); // make sure it is no bigger than 22x22 if(in.width() > 22 || in.height() > 22) in = in.smoothScale(22,22); // draw the pixmap onto the 22x22 image int xo = (image.width() - in.width()) / 2; int yo = (image.height() - in.height()) / 2; for(int n2 = 0; n2 < in.height(); ++n2) { for(int n = 0; n < in.width(); ++n) { if(qAlpha(in.pixel(n,n2))) { image.setPixel(n+xo, n2+yo, in.pixel(n,n2)); } } } // convert to pixmap and return QPixmap icon; icon.convertFromImage(image); return icon; }*/ //class TrayIcon::TrayIconPrivate : public QLabel bool TrayIcon::TrayIconPrivate::x11Event(XEvent *e) { if (e->type == ClientMessage){ if (!inTray){ Atom xembed_atom = XInternAtom(qt_xdisplay(), "_XEMBED", FALSE); if (e->xclient.message_type == xembed_atom){ inTray = true; bInit = true; } } } if ((e->type == ReparentNotify) && !bInit && inNetTray){ Display *dsp = qt_xdisplay(); if (e->xreparent.parent == XRootWindow(dsp, XScreenNumberOfScreen(XDefaultScreenOfDisplay(dsp))) ){ inNetTray = false; }else{ inTray = true; bInit = true; move(0, 0); resize(22, 22); XResizeWindow(dsp, winId(), 22, 22); } } if (((e->type == FocusIn) || (e->type == Expose)) && !bInit){ if (!inTray){ bInit = true; setFocusPolicy(NoFocus); } } return QWidget::x11Event(e); } void TrayIcon::sysInstall() { if (d) return; d = new TrayIconPrivate(this, pm, v_isWMDock); sysUpdateToolTip(); d->show(); } void TrayIcon::sysRemove() { if (!d) return; delete d; d = 0; } void TrayIcon::sysUpdateIcon() { if (!d) return; QPixmap pix = pm; //buildIcon(pm); d->setPixmap(pix); //d->setMask(*pix.mask()); d->repaint(); } void TrayIcon::sysUpdateToolTip() { if (!d) return; if(tip.isEmpty()) QToolTip::remove(d); else QToolTip::add(d, tip); } madman-0.93/ui/SConscript0000644000175000001440000000073310053135242015101 0ustar akusers00000000000000Import( "env" ) myenv = env.Copy() myenv.Tool( "qt" ) myenv.Append( CPPPATH = "#" ) myenv.Append( CPPPATH = myenv[ 'QT_CPPPATH' ] ) myenv.Append( CPPPATH = myenv[ 'GLIB_CPPPATH' ] ) myenv.StaticLibrary( target = "madmanui", source = [ "accel_list_view.cpp", "dirlist.cpp", "mainwin.cpp", "multiline.cpp", "overview.cpp", "passive_popup.cpp", "prefs_dialog.cpp", "set_list_view.cpp", "song_set_view.cpp", "trayicon.cpp", "trayicon_x11.cpp", "auto_tag.cpp" ] ) madman-0.93/main/0000755000175000001440000000000010053135242013373 5ustar akusers00000000000000madman-0.93/main/main.cpp0000644000175000001440000000643210053135242015030 0ustar akusers00000000000000/* madman - a music manager Copyright (C) 2003 Andreas Kloeckner 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 "utility/player.h" #include "database/database.h" #include "ui/mainwin.h" struct tNoGuiProgramInterface : public tProgramInterface { QSettings Settings; tPreferences Preferences; tDatabase Database; void setStatus(const QString &status) { } QSettings &settings() { return Settings; } tDatabase &database() { return Database; } tPreferences &preferences() { return Preferences; } void quitApplication() { qApp->quit(); } }; int main(int argc, char **argv) { srand(time(NULL)); try { if (argc >= 2 && (strcmp(argv[1], "--help") == 0 || strcmp(argv[1], "-h") == 0 )) { cout << "madman " << STRINGIFY(MADMAN_VERSION) << endl; cout << "usage: " << argv[0] << " [--nogui] [filename_to_open]" << endl << endl; cout << "options:" << endl; cout << " --nogui: run without GUI" << endl; return 1; } if (argc >= 2 && strcmp(argv[1], "--nogui") == 0) { QApplication app(argc, argv, /* GUIEnabled */ false); QTranslator translator(0); translator.load(QString("madman_") + QTextCodec::locale(), "."); app.installTranslator(&translator); tNoGuiProgramInterface iface; iface.Preferences.load(iface.settings()); tHttpDaemon httpd(iface.Preferences.HttpDaemonPort, iface.Preferences.HttpRestrictToLocalhost); addResponders(&httpd, &iface); bool filename_valid = false; QString filename; if (!filename_valid && argc >= 3) { filename = argv[ 2 ]; filename_valid = true; } if (!filename_valid) filename = iface.settings().readEntry("/madman/startup_file", QString::null, &filename_valid ); if (!filename_valid) return 1; cout << "loading " << filename << "..." << flush; iface.Database.load(filename, NULL); cout << "done." <= 2) filename_to_open = argv[ 1 ]; tMainWindow mwin(filename_to_open); mwin.show(); app.setMainWidget(&mwin); return app.exec(); } } catch (exception & ex) { cerr << "*** terminated by fatal exception:" << endl; cerr << "*** " << ex.what() << endl; } } madman-0.93/main/SConscript0000644000175000001440000000121310053135242015402 0ustar akusers00000000000000import os import os.path Import("env") myenv = env.Copy() myenv.Tool("qt") myenv.Append(CPPPATH = "#") for i in [ "XMMS", "GLIB", "VORBIS", "LIBID3TAG" ]: myenv.Append(LIBS = myenv[ "%s_LIBS" % i ]) myenv.Append(LIBPATH = myenv[ "%s_LIBPATH" % i ]) # myenv.Append(LIBPATH = os.path.join("#", "libapetag")) for component in [ "ui", "designer", "ui", "httpd", "database", "expat", "utility" ]: myenv.Append(LIBPATH = os.path.join("#", component)) myenv.Append(LIBS = "madman" + component) myenv.Replace(QT_LIB = "qt-mt") madman_prog = myenv.Program(target = "madman", source = [ "main.cpp" ]) myenv.Install("$prefix/bin", madman_prog) madman-0.93/designer/0000755000175000001440000000000010053135242014247 5ustar akusers00000000000000madman-0.93/designer/about.ui0000644000175000001440000032246210053135242015731 0ustar akusers00000000000000 tAboutDialog tAboutDialog 0 0 554 368 About madman unnamed labelMain <b>madman %1</b> tabWidget3 tab About unnamed layout21 unnamed spacer12 Vertical Expanding 20 20 pixmapLabel1 0 0 0 0 image0 true spacer13 Vertical Expanding 20 40 labelAbout <b>madman %1</b><br> madman administrates digital music archives nicely.<p> madman is a digital music management library management application in the vein of iTunes and many others. See the madman homepage at <a href="http://madman.sf.net/">http://madman.sourceforge.net</a> for details. tab Authors unnamed textBrowser3 RichText madman was brought to you by: <ul> <li> Andreas Kl&ouml;ckner &lt;inducer@users.sf.net&gt; </ul> with plenty of help from: <ul> <li> Shawn Willden (Auto DJ rewrite) <!--<li> Artur Polaczynski, Mike Kudelya (Musepack/MPC support)--> <li> Jon Burgess (bug fixes, suggestions) <li> Josie Walker (prerelease QA, the woman's touch&trade;) <li> Christian Plagemann (artwork) </ul> In true open source spirit, some code was shamelessly stolen from the following renowned sources: <ul> <li> XMMS (Ogg tag writing) <li> Cedric Tefft, Ricard Cerqueira, Johannes Overmann (mp3tech.c) <li> Makoto Matsumoto and Takuji Nishimura (the Mersenne Twister random number generator) <li> Justin Karneges (Psi's system tray code) </ul> The artwork used in madman stems from the following sources: <ul> <li> Sun Microsystems (the Java icon set) <li> The KDE project (a few icons) <li> Christian Plagemann (madman's new logo) </ul> TabPage License unnamed textBrowser4 <pre> GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 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. </pre> layout17 unnamed spacer10 Horizontal Expanding 40 20 pushButton11 &OK Alt+O 789cb4bdc792ebc8b2ae39bf4fb1ed6276ac8d37a9c9410f2833932aa953b4f5009220a8b5e897ef40fcbf7b56d5d9b58fb8dd0b56abea2b0011ee1e1e1e12c1fff56ffff81af6fff16fffeb7f9cceee79e9ffc38fdde33ffe2db86c368fffebfffe3fff9ffff13f732f2fffc896b2ffc8e7b2857fe4fee7fff13ffee7e8fc0fff1f83dd364c21e318705eec9f94db5be56ccac701390bceb42d67e5f9d94d19f75be42cee674ecaf6fea9a76c85f9f4c939e63756b6f71fafcaf9943b57721efcf1a95c48d9712de754be844c79c28ab2cdcf9b90997fe6aa6cf3bf77956d7ec70799f99f4bca36ff4e935c7829a6fcba522e59f962cb79912f1a90459e7732f3df5d946d7e4e8e9cc7fdcc59d9de6f8e95ad3cf719b9006e9c94ad7ccd9eb295ef792017c1ef1de572cabd1ab904ee54942b567e945741f45b34c8d46fff43a67ef1884c7d82bdb2d567312117c0999bb2d5e7d857b6f2de7364ca7f39285b796b5d32e53f1f94adfc6f7772f9a56af5af28bb56bf37cb45d12ff826533f7f49a63f1d626594d7884c7d566d65abcf332417a96f55d9decfac956df9b55ec894ff582797c92565ab4f73a66cf57975c9157257d9b3fa8bbed597c0ea8bfb25d1ffb82553ffc5894c7d6b81b2d567f24166791f16caf6fe6b854cfbdcda64da23fc5446f927cad61e99985c42f9770664ea573b285bfdee4f7215fcf6a2ec5bfd1f6417fa7f8c956dfceccdc81e7878568eac3fec2c97c55e932d99f6691cc8d437be9245bf5fb6fa1c27e412fd61a86cf5df2e94edf39925b90c7faf67c815f847b743a6bedd3299fab63aca56bf7e9becf17e5dd9deefce95adfe7d49cf07b772c2596b8f81a76cfda77b2307e0e0cb7245fd6d47a6fda60532fd69d655b6f6bcbf9359bfe23d99f6f2037219bcf694adfd9a39655b7f320b32ed777b55b6fe150ec855dc9ffcb27dfff949a6bdae921eedd3ed0b43ffb72999f6f8c82a5b7d3f2ee410fc9e51b6fa7b28afaad8af9123d37ef30a99f68b7bcaa87fc2b4df7544a6bd928ab2b597372657c0b1a76cfdaf3124d33e9944d9dae7f8a66cebe3a7bcefe27eef4ea6ff75b6cad69ea70599f6bc487ef4b7964b0ec0c7bcb2b56ffb46a63d3b1bb0096f56df00f670c59e872599f16ff849a6fd1a6db2c4ef5732ed9329285bfb648ae42ab9a20cfbb4956d7df5eb6417fe77cd2a5bfb9c5cb2d4bf2e99fade427208aeed95d1ffea285b7d6a0e3902b7d7ca56bf37c42b379bcd5afd867565abcfdb173997b5e5efa0fe7962cf9543a63d573e59e265814cfbce5d32e3675425d37efba9b2cdef9925bbb46f49d9de6fdc94ad3d176bb2077f74aecad6feada5b2f5bf9ae417c0dec75732eddb7b51b6fa5c1332edd9bb2a5b7b36d1bff08c3960df0f32edd77a27e7b3e8af2c95adfc9d1f7201bc385af6351ee4c9b4776343a67dc72732eb7ffb9d4cfb3e3f94214f952cf6cd2bdbfba757b20776dbca88af4db20ffbcebfc801b827efd35e75d40f5fea677348a6ffb566e41cf8fdac8cfe6b834cfb0dc664daabeb2bdbf27f95fb4570efa10cf9aacab6feb5037209ec205e0762ffb84996f8f141a6bd4f6532ed17cb7dda2ff3cb56fedd86ecc37f77b132fa731e99f6cc1c95ad7cd344d9fa730bf20762afeb939c87ffbd56c9d46f48fdb2e5acf5ff618d5c015fe1ffa18ecf5c32f5edafc9d42f3e29c33f06641f9c6c95adbefb841c80372d7208fd327565e85724d39f5a880fa1f8d3a94fa6bedd9ab24dff12900bf09fd35dd9deeff5c845d6c76f72396bf31f6cc8b4cf5b593887fe51955c05bf3bca182f42bf48ed9923d39ed32e99edcf74a96cf57b34c96c5f9b7932edbb982a237e6cc8b4afe39043f857fdaa6cfdeb5054c67cc3811c213e0e51de91c4b37a819c477d7ddb2adbfb67ea2bf5affba36cf36bc4e412f8d527d35e1f6fca36fe0e698fac9bc37c82c8e3e5309f60eb4b56e747fc2a59eaeb9c2cf6bc91d9df3e3a64c6cbf840a67d4f1d32ed99292b5bfd161932edbb7905a797d5b74ea6bfb5ee64ea7f67fec6df108fde94d19fcf92a9fff048f6c0bda132e2ff8aece7acbe1f89b22daf57ea970dc08eb56f56e78b0e4d32dbf3894ba6fdea3f64d6f79a3c1fd23e6fcad61ecb3e3982bf3919658c575be0f48f2d8f0699f5f11191698feb9c5c01df1fca18cf0464d6c77695ecc33ec32b99fa773d65b4377772081eb694ad7fb7297f36023bb67f96d5f9ac518e4c7b0dbb648e67928cb2cdbfbe23d35ecd2239a27f8d95adfd56b077ce5c980f7b2adbf2ea4fc98cf77d9f4c7b3c666417f5adbf2447395b9ec344d9daffa30d36c95b79423bbecdeafcd8b646167f9993a9dfb24a66fff9f141a67e97a7b2d56f0b7be5d31a68f38b95ad3e5bbe6f3c08edc5869c47fbd06c90a9fff58d4c7d9bf2be87f8f2c82adbf7af921ffda5b320d33eaff0afbc51d7cadfb991699f6e55d9ca3f5c9173e0ee97b2952f44fdd0f9b8e1904cfbdd205f41ec913495edfbf1844c7b0419655b3ff6f27e0ef13cb32717d05fcdd494313fb12117c1f50199fe53ff204bfc399269afb71f65fbfe3d2107b46747d9deefe4c852df4e60b15f9bf98bfdde8fca98ef5991f339abef7b59d9eafbf14d2e801788173a3f387d9269eff989ccf1f207ea4751ec3f9892b3e0c74ad9cab3db295b79821b39075ee695ad3c8edca7bd7b1f64fae7fb9ccc78d5140ec1ed8db2b5df80f745df61865ccc5b7d3b23655b1f065d72296ff3f3e05f3a7f189fc96c4f677b32ed330a956dfe2dc4cb92d8e35220e7c0d78bb2b5c7e24719f6f822e7c1eb2db9c4f1c2273982beb517651b8f7bd0a764ea27fa23b132e627f2e41cfce56d42a6feaf7965b4b7f27e398ffe06e281ce176eea64cecf8cf264dae3d62773bc7a9b92d9fe9de09f65b1472720e7d91feb2b5b7b840761f42f3e840bb4574618f7eb2b7291f34f4d7219f6f4df95adbcd331b982fedcfd4cf651dfeb1b32ed7d813f94c5bec71b398bf6a3dd22d3be1f3972256ffd7db02557f3989f42fcfe9d4f3c9239de9d54c9b4ef2822b37db9f079b1df69ab6ced53ab93c55e7761d82bde285b7f4f76e422eebb4f65cc7f0464daabb726b3bd68c19e15895fa73939cff681f9e5dcbc7d7fd8247b79fbfec18e4fb23a3f380bc9d477f4a16cdfbfaec81c2f5d2a60d1b73e15863ecf805cc4fd5d5718f7838d32fa1b177215e3a95b89cc78de62fa463febdf8d19b9006e4d946df97c14c9d47fd0277be41ad9cfa33fd252b6ededc7931c807df4ef74fe6ff424cb7c30fab3aee87bfc1286beab2eb9047dc3adb2f55fb7407639ff80f2704df9a23f9327b37caf3eb988783ca03c22ffe040a6fc6f0365fbfe12f14ee7df0e5932e3f1c82753bf33fa0f9ee853fb2197c0cda9b27d7f7d2097a1df6e41aea03dea54c92efc3bb3257b18df1d5be400f1a18b78ec497b53bb924bd0ff581046fbf3b62697111ffa4c4ffce16d47167b49fab457bb4d8ef2f0a7bab2cdaf87fe8767c207fa0335e102fc1bf6d5f9b6e3852cfdd91999f3679faeb2f5ff3ae2992fedfd794ca67def3b7299eb2531b982fa9979907d8c073f437280feeb19fd11dfc44bf4afba64d117f5db17fd06037216faf5df9461ef26d95440db9e217eea7cd72147e67afc282053df06e40b449ffb5019f3a5557285fe5451b6fa6ee4fd2a388e95d13f74c83ee24b6647a63d5a888766b406ffa9bf932bf09fd6935c45fbd2c9935d706ba48cfe9da41722be0c509f02b517e533f6b2f2beddc87970f753d9caefe3bece9f35dfc9acafc73359d61f06648e17275d32ed7ddb2a637c88f63d14fbbe8dc955f071aa6cd3776bca56becd82ec82fd0e39c478bacef4c43edd06d9cbdbf6e6d553c678f84e667c1ea2fc42633fd4e70299f6eac7e442c1eadba7bef96201fd11f48774be6cbe21d31ed30199f3615bf85724f1ea1493a9ffa640a6be6b5fd93ebfbf933df026478e309fd0403c888c7ee80ff594511fcee400dc9f90c3bcf5d701fa2391e8f79a55b6f6fc28914b059bfed2c683dcef7c5642e6fce0ac4aa6fef39532d6cf4332e7f31e7cde5467abcfb34576619ffb87b24d7f5524d31e8b3765ecd77825fbe82f0623707ad9fa9f23d33ecd2739807fbc7f9259dfde2fca98afcf80f3e502dad71db902f66d7dc8e97cd5e44ea6fecf2658f4b9dcc81ef53b937de8b373c901e2cd51de8f30bef2bbe0f4b2f1794dce819f2f64ca7fcc9123b4dffdbb32e6dfc9a6bc51fe6572b960f3ff1892a9efb041ae16305f1a925df0f0a66cd3efb5c85ec1967f68eb734ee7a7b67db2f41faa64da6f3e237be02dfc3127fde7eb0799fe3128917db0bb2207f08f435dd9faf781f7c57ede55d9c68b6e8f4c7bb67db0e83b5890bd02c6b7c23e38b1fd819cce4fb9af64c6db618f4cfd6e0332e7bbebf0d7bcf8fb6947a67e8d3139003fdf94edf3878d32e6935fc821f4dfe6c911fa8f01ca239f5ed65f995e3e8bf6bcc6e7cd6dcbaf0361b4efe71b398ff6ea553828623efd8b1c16ad7d57f0cfdffd5f6732ed33ab91b99e7a833d0aa25f3222539fcc3b3902af8fcad69f1df87b3aff62eb5feb955c0477e11f05d1aff543a63efd57652b7fef442e80db7b65b4c71b32e36d9ffa8a7f0ce47ddaa79527d33e1f0e392a623f634919eb5ff08742e105dc7b2a5b7f70604f9d5f9afd9069cfcf0c99eb7d75c85f34f6b4f25e87ca581fff22d39e19c483627a597f248b3fb4e664dae7ada58cf9cd25b988fe4aab40667ce91fc8b4470ff1ba28fa75afe46cd1ca3ba89073452baf83f64ae78fc64db2e80b7d4ae90c86b577871c41df280b3601caeaebae956d7da9e7c95970e64ea63d863b65c4ef377209dc477d2c897d6a0565b4870332edd3eb28dbf42f11b984fb8d6f657bff285c86ff0df8beb197d5afed9073455b5ffa0d72be68f5f5e1bf3abf341b9369bf794d19eb4728dfb2ac9f3cfa64d6c71bec5536f6437dcd9169bf8343cea17fbd94fb65ccafbda2be97459fde41d9de7fbf932be01efcbd6cfc05ebf931b95044bc837feafc4ed2234b7b942153bf460016f9bb677296f3537b656bbf15d34b5b28eb8f9fe40ae6abfa884f1523afe5874faea2fd6d9ec82edadf01d397f2f9a03c461fcb9d9632daab25b958b4f27f50de42a988f9ea2bb95cb4edb383fc757e67b22273fdff06ffafcaface73462ea0fedc60ffaae87ff856b6f20c5fc939dc0f7f94edfded919ce778de5786fcefca586f91fb55cc6fd5a15fd5d80ff34fcc4fecf77c90bd02f637a07f59157bf4f364dae3edac6ce3f57b835c0177c6c225cc7f36c955f002f147e77fa65f64da73e428dbfc6f682f5db1cfeb5ed9cabf3a92698f304f2e908fca36bdd596ec62fef3027f77c51ea701d943bcbd6fc83efa6f43c41757f5e3fb463fecbffc50467b5525bbe004f6d7f9a2e1804c7d7bb09f27fa3d9664ee975817c8a2cf88ccfd32e15ed996d72e207b98ff7a223e79a24fb34c0ed0fef6d1de7ba63c31df9d2153feee5019ed834bf64a687f2b641fdc73946dfc8de06fbff3397b32e34b7c23cb7eb52e99f367b31d99f69a1dc8dc9fd243ffdbcf71bf51664ca67dfc50d9eab7f92497d1bfcdacc83ee6075b4cdfb4b756de934f8ec08db932f63f523f697fbb7732edf1ee9283928dc7fd2139043bc85fe77b2e1332f7a7cfaf64ea3b9c295b7d6e88e781aeb7a23c03b14793e9e5b8dfc39b924bb0c7aa42e6fea3dd5218e3c77d4ed9eabbdd9203cc1fbf211e05628f16fc2730ed0dfabf3d65f47fb2e42cfa731f1f64d6a7beb007ff6b27caf6f9c1994cfb0d3e94b1bf6a4d8ec06f8e32fa2f88173a1f34199269cf79951c71bf31f20bc57ef151d9eaef75c8b49fff450e319ffecaf48dbed61f6a4b728efdd53299f20e615fe37d258cc717ca985fcf90b3e48d32f6b7427f9daf19f6c9d46fd62153bf06ca27dd4f649fefc17fcc681bfade32cad88f9727737f47b81386bfac2764eaef33fdf4b2fe81f98548fa677dd4ffc8b4e796cf47657c8f502033fe0c6232edf53a51c67e4ec48f48ecf7e19173252bffc8c643331ca5fe975098f32f3e58d67f6b1199eb49cd1138c7fd41c377659b5e7227d31ee11799ebf5cb8132e6fbdbe0f44af97345ce828f59b0e9cf607db5a58cf598006cf4c37a7c5d19fd9b23395fc2f7164f72a184f9f7867019f2daf890d7f99c4f874c7bcd47caf6fd470c16fd9f7932f703f52a64d1ffac6cf5df30bf1cf7831ccb64ee9fda7c83d3cbfa8b0736f507df8b513ed37f41794fc8f48f36e513fd3aefe422f8e345d9a6dfc9924b65cc97caf3e532f64b837fe76fe66419af0764da6702fd7332df7777c9f4af0efc3127f66af7c855f047a88cf9942299f60a3d32f727c44565ccb76ec0e965cb670936fd391b3fae037205fde32eec9d137bf54ae412f46f531eb1c7eb8b32d60b987fb102ee3f94adbe31eca7f34123f8675eec73ba8245df8f02d9053b5932f5dd7f90b91f6383fa6affd8f4326089b7d71ab98afe4e1bfe624613658c0f4764b76ceb9b8ff2d3f99939d22f88bcf3ad30e2e7720d96feda07ef8bfce78930db57799efa2cdfc85cdfefeec179aee767027201eb4f8b9532f6ab5cc0529e6fdfca569ee39d4cfd9b03b28bfefceb07d9437fb74dfda5beb40b64daa743f98b5ed9ca1721bee87ccb18f1a528f679e2fda2d117fb75d7ca88077c3fc7f5cb654fd9eabb4bc0e965f3eb28637f16eaa3096f180fd64f64ead3ac28dbfc2e3bb20f6e237e15459ff694ec9731ff1b2a637ce99203f0c72b392c5bfb2f6cfb9dd7f997c5852cfb9b507f4bd92cfd07f296647cd7ee9269af5b8eecc35eaf6565f46727e410f63a7d92397f9e81fca5f4b2fe85f228997860f56b54c9f48ffa9aecc13f7a7b61d8f3e49003f4d7ce577288f6ba037f2a89fd7acc4fecd5dd92c332eacb9d1c815fafca8887b44fe9a58cfe16fc5fe767961b32e3f108f1a22cf69dcd95f1fde595ec62beaf0e7f2bab7d77e480fb150bca56df75931c62be2b332547e003e24f396df16cfc132e63fdee9df2197bd9f23a333dd37ed9f7db6489c76f4332edf1feae8cf2813f96c53efdbd7005f5d72367c1831f65d803f543e78366b04745ecf50effae88fec1814c7d333d65ace7c03f2b267e595ecfc915eeafe92863be07fd838ad1dfdae3b5af8cf93cc4e78ae9df61fe704c66fc1efa64c6a7e1834c7bf511bf2ba2fffb4119f5ff839c030feaca56dfc1906c04b6faa37c74bee8d825f3fbd3f10c2cf69b7d91b95ff8017b558dff60bdde51c6f7f39fe408bc867c55b5a74bceb2fd3b2a5bfd374c5fecedf7c955da1bf5bd6afa8b182fad94b13faf4d66fdeda2bda88a7f0dbe8461cfd7884c7b7efc9069bff60b99f6fbb8910b15f41fcaca181f74c8c50ad63b209fce277937b2cc2774c9fcbe6d027f75c5de43e8e38a7def23b2d817f1d915fb4567b28bf5d11bda67d7b42fe85fa27d73c53e6dc46757f41b303dd1af1d29e37b00e66f92437dff51467f2454c67c35f52995c06f7b652b4f84f651e79b5a4732fba323f88b27f3972de8e389fead9b32e6d3f9bcf137ec4fce9273b0cffaa18cfdf7c21ed60b6bf02fcf34cf961f797201dcf854b6ed65f34e2e821f2fca186f7964b61fed1a99f5bb8dfaea893fbe35c8f4bf7e939c677914c92c9fc1b732f6f32ec8521e4d659407ed21e5d1fe56c6f88cfa95cabc3f54467dfbbd8fefe95e95f1fd933c5fc1fdfe4819df13a13dd4f9b531eefb52be238f9c079f91be2fe579e6f3e636bed72d90f328cfcd5cd9e6ff68930b984f8d1b641febeb4dd8c397fee705f5c197f8d26c92599ed722b984f1690ff5dbd7f83120b3fcba0199f5eb3d214b7d9a2aa3fcca64d6af414b19fb3f3aca289f1299e53990f7595eed2f65f40f693f298fd737657cff782457797fa18cfd15dfcad65e01da0b9d0f3c1ec8dcef3645ff2190f27c457905527ee7909c031f67caf8fee383ccf2cc74c805f0ad46e67e47bfa16ccbeb3322733fcd3bfc2f90fafbdc934b985f3816c965f02912e678e24996fe2059ca771890593f3ffaca18ffbf93595e9d2599f67d7d55c67e8d29d905772ecae87ffa640fdc1e2b637d08fde1dff943b4d7a194c7f4aa8cf60de51d4a799c96cae88f77c9b4ff724e2ea27ead627288fd851df44743b1e7b94cae60fea2712457c1ef33657cbf87781e8afdde7b64b1475b19f3bb7365e4ff42a63ddef7caf81ef340f6c919e12afa07927e00f6f1feeff798f08f48ec375f93b9be7647fa91f15ff4ff56cab6fcb72f64b1df835c02872765eb1fab90ccfda9194f18ebf71db4ff91d8b7de21d39eb7ab32e61bf8bee97fdafba70f65acf71f94e1cf289f48fcfbad4ea6bf0e7664dabbfd49a67d5f63725045793fc96115e731bc2963bf648f1c819b56fe82ee6f9bf4c062efe70d9c7bc17cd4eb166cfc15f3232e99f6dcbc91cbe059994cfb6e037081fb7d934f32f7779ecf60e91ff4fa64daeb3d4ff6309ff4b624fbe40558e2717b46a67d5e1332edd37d90698fd78632c61f7770f9859c53c67c96f58782ce974e9b60b1df19f967c55e8f8532e6af37e422bf179a28637f52964c7b1e4265eb1f1bc89b15fbb560afacb107cebff92007180f35caca36fdf71558f41fbc2b435fd8375bce56d1ff692b637f01f52de7c0be8da785dff3c44a60f9bead0ef972a2dff5412e21fe85dfe40af4db1dc955ac373d5c658c6f6be074c2cdb64f81b22ddf0df32b70bf6b6f072e86d0bf9928e3fb10e66ffa9396df22b0d8a33d078bbefd8532ca7346ce833bb132d2a3fce502b8ef28a33f05fffefd9ef34996efa70f60632f7c5ff0a16cd35b77c9b4d79ee999fe38f6bb0fc0628f27ca3b2ffabe6694ad3ce73dd88cf7d09eb6c0a2ffe08d4c7ddf6acad0f741a67eef6372b18af4e6ca689f3fc925f00afeadf3afd329385b843f4d1d65f4efa0af15d0ea172be37bfc2e99f64942b28bf5aa7d95ec63fe780e7fb27f52bea07c0bd27f7d2f90c59f1e64daafcbfcc47ecf1e398bf9c15a4e19ed2df397faf6da24d3bfde28afd8afef9269afd7ba32e6cf4ee47215fdeba232d6ef208fced72e6f64aec7cf909e7e0f393f904bdc7fe9834d7db5fa1ee7cad8cfc2f4c5decb7732ed1d4fc91eeaf3f3288cf5af2dea5fb1c0fd5efd1fb0b4a735e8532ce560bf5b979cc778b0f9a58cf90af87751ecd1af2a63fe8cf29bee3dfa2f476117df6fc8fb55702f56b6f56b0a794b62afd1904c7b3dc9667886ef0161cf92d8ef522257d99ee6c9b4cf3a47f6c17bf86729bdac3c682f4a628fda2759ece129633d362417385e667a628fb73e59f4df92a9efeb17d975f13d635519fd8d27d9033bb0a7ced78ed1be94c53e0fd4e7b2d8e782fe4959ecd1ee905df6df4a641ffeb2ff24076017fe512e707f5cb70236ed9fb5578de919fdd17e7e918be48132e6afcee412f80dfe5f56fd298fe8fb7a56467bfa43f6c16f2765c4af881c8023c4539d8f1d41be8ad86bfe50c67ac28dccef494f68df2ac65e8837df640f1c6ec8b4d762a68cf319a17fa5c0fd792de627f67a6b934b1c8fa37dada83d4664daa3b32253ff41834c7d5f2fcaf0e79132f63f32ff72087ef394ad7c21ecadf3b1618dcc7836c2fb55b1d7ec834c7bd560dfaab18fad3ff5904cfb6cc6ca56ffdd801c82f74cbfc0fd8befe8cf554b05d4b7da1bb982f987a743ae82df29afdae7a60cff70c9b4d7c05146ffec4aa67d5ebf95d13f91f423f25319fd2fd85be757972f647e0f355b83c55ef56fb287fd7a2df8bf2bf67b0fc83e787320d35ecb901c617d7ab15546ff04f1c74d471cd61f5fc9dcbff7c6fcc47ebd8132f64bccc82eb83554467b8a78e08afdde37ca589fa1beea6f33657c5f8cf8e5565e603f07efebfc6bd225cbf78b68cf3db1df3bf4f7c43ea78a32f65334c8017853248bbdf8beb10ff85b19e7a5be92b358efdb0ec9dcfff94679c51ead2dd903df22659cbf3353c6fc24e28b27fef8de5746797c29c39e4c5fec1922bddffd814b32fbbb73d4175fec35fb657ccf8f78e21bf3623da540e6f70d77d43f5fecd7e2f379ee4fca307fb1d7e99d9c05efbf956d7a3787ec737f3ef4f3c57e7da667c6e7385fe8ac6ceddd6a900370e7a48cfd3b281f5fea7be7954c7bfaa8bf3a3f38c3f823fd9e13f6457905a2df69a38cf6be4de67eac15f40d44df5555d9eabb7c9273e0fd841c603f691ff126107d6b1932f57b2b2a433fd4cf40f459405e9d4f5b7964a92fb04f28fa35a07f28f23fdbc288cf01ec118abccba932dad325390f5ebd90437c9f75c3f838947852cb9243ce071ec811e6636a6d652bcf01ed5fa4e785e2fd48f68f8ddae42af79321be4405eeffaaed9471de418d4c79f7c205ac1f7747e422d6a79c2739e2fe5ef86f24f1ef3e27539f06dabfc88c37d09fdd2a633e49eeb37e27d69f8a3a5f341c81459f1aef8b3e8dbb32ce33ff21733f57e6854cfd960d7201f16a5f2297311f5d2f83c5fee70b58e46dedc939ccefb43e94319eb3fe58cc8abc37c8931579923299f99fdec8dc5fb21d2b63fcdb2397b09eba7d05a797cd3f064bfd78eb804d8716f3819fcad80f7a2617c08ef5b7a2cea74c8760917ffe54c67817fae50adcef751f93f3e0d82797b01ebcaf90ab985f4ebec122ff2a22e7b07fb7cbf4c57f2e1ed88c4761af07b984f98111ca232ff28d855d7063094ebf00b5f2c6e40ae67707c82f2ffa3c3664ea735a295b7b1efae402caa313914b28af4da08cef550ae432ed312057e06f9b2c38bdecf364a32ff6b77d2ae33ca0177209e3f5a74f2e831d5bbf8a3a9fd180ff15747f409e4cfb34a15f41f4bb15c805f07143a6fc5bd4473b60b6f505fe5210ff6a5fc894e72da78cf5bd2bb902ee7495317f23f7abe011f4298abc9350d9de9f3cc81eb88df2298afcd79332e657f8bca95fd8bf7451c67ceb8e4c7d175f64ee1f59bf93b9bfa13755c6f72f7365db3ec52e38fd63ed4df944ff6ea48cfece814cfd2f5b659c7782f8a1fbbd2675b0d8635820d31e2d3e2ffa36aee412f44d026594ef8a4c7dea6fca36ffbda4e7637e7d8d785a4a2fabcf1a5c76315fd47b5746ff93cf973db0037bff7eff86fa5916f9dfe1df65239f95ff3152c67c478e5c667bfb43a6fcdb3a99fb2bee4bb28778b4bf927dac1f7c2ec0461f7c3f312797c14da66fe447ff99f2977df0fdae8cf92ff8f7ef7e27c4df8ae87742bcaa88fceb3e99fb1b3625658caf5d7200fbef0bca383f1af254247ef6507e15b177cb2107986f696d94b1ffec931ce2fed355b6f723e8a7e3df39fca12afa4cf7caf87eb147f679df57c6f72348bf6aea17f617bd93a9ffe253d9eaefb6c8dc0f90e1fbe965f5853e55299f7a894c7d1f4cdfe883781f9223f0b9a18cf121da9faa197f59ff9b205eb8227f1df5d795f67ab82757c09736b90a3ee4c9947fd557c6f9113332d7c337883f6e7ad9f600f1cc1579fb6765cc7f307f91f7542767d1bf72705fc78fcd1b99e3a109ece5897e27d4674fe4bf35c82eb89151c6f9c00332e55f0fc95ccfdfc21e5e7ad9f262fe263ee0f71f2e64eaf74cc0467eb4ff4d720e3c41bcf445de59811cf07bc8a232be6f44fdf045feda5dd9cabfba90b91ebe85fff9e965b9450ef83d239f97faf38ef6c0afe431fe6c2d94d11ff82117c0ed9332be67853ebfe7f3b864f95e96f7459f07e24b50e0f92ccf8532ce6bbd90a94f9227f33ca18daf8cefb3d0df0b8a3c5f685f24e731ffbbdf92a97f97e949fcbba0ff12883e8f9c32dac72f7211fcf6aa8cef455fc825b00bffd1f1db18ef87a27f07f287a2ffe54ee67924d799b2cd2f2990455fe8178abeb70d99eb9dbb1539c47ee53ee24528f2375acaf89ef6874cf91f73659c9f6ee7a78b91c83fda29e33c49f4a72389778f2999f2b7ae649e3ff38c94b1beb72453bf634f18fb5b07a84f91e87b6e0ba33dd9ecc93c4f6a7150c6f91d0139c27eed4fa6976e38b7f646bc88c4bf6f1532edd39f93699ffb8a5c7631febd2aa33d7d215770ffd452c6fa8ef5d7929eff3cad80b321ecf95a048b7dae77b29cff9453b6f27823b0e81f4dc85cffddcb7dae6fd68ee432e6bb9617b0d8e3f80216792f1b65fc1e86dcaf824f6d610fedef96ec825d3bde2ce97e80c58d2ce7753a60d1ff3c058b7e972a3902bb9027abfa8dc1e965fd3b028bbfd75ec92caf5e8e4cf96f9fc290f7fa4ea6fc971f65fcbe05e5af78e0d35419f333b04f4ef4a9adc0227fb3a46cebcbd155c67a1be4cf197fc778eb42e67923c94c19bf7fd4028bfe19be9f5e36de65c1aaefb730f47becc8d4efda27539fcb4219eb195f641ff76f2765f43f9ecaf8be684f0ec073d82b2ff6998d94f13d5d861cf17cfb0258ec752983c53eaf25657cff5d25d33eeb0e99e7696c76cad8ffe09179ded11ae5673f08b1fac1fe79a90fb7b332e60f6b64fa4b8be98bfdeaf23eed55ab28633f4c9d4cfb5cd6cad81f17924372a08cfdfdd0b720f67aa23c0ab910f3e7d72bb898857da21c99fa6f46e42278b153c678fe492e63bd6b0b7fb50bacd6bf989ed4af6e932cf67a27b3be741764ea730d9431bf582247e0fb5519f375f0cf42f505fc2c2b63bf37e28faedfcf1b60b14f2b018b3dea7cbe98035f6fcaf81e7c48a67dd62565ab7fe09079decafea28cfe2bfcc30e386d7c82fe45f58f1199fadff664ea7ba67ca25fbda88cfec217390b5e23dee979c773d4f792e83f87bc25d9bf36fc52467c5892795ec2bd4ee6790017f85749ecf5582be3fbf00c39cffee88c4cfb2c46e432ecb35f913dcc9f7bf077fbc7fa0be25bc9f817bec78cc9b4cf3bfcaf24fa778ecad8afb323e7c0d78d32e6e3f3e43cb889f4757c3f857f95c53e57a45f16fdce45659cff312717c0f50999fa2f5fc9d47fd12157c0a7aeb2d53f40fb5a4e2f2b1fdf17f96bef64ca7fed29637de1462e80cf1b65c44bf42f7ed7d3c9a2efbc40ce82df214f45f46b6e84d1ff88b764d1b74ba63e0ee4afa4972d4fa667da27fcfe1bfcaf22e579ab9229efe9492e7a882f47652b4f04797ec7fbf09faae8337685b19f62d22053bfd94018f74fa8ef55d1f7231686be8f21b908de7d92abd0777b51c67eec07d8b43898ff7c2357f17dd167ac8cfd52885755a9ef17a65f2d41dfc75ed847ffeb9b5c063f0265ec5fb0fde392ae67cf118f5cd17ffa2a0cfd1b1d7299eb874532cfbba8a37c5dd1bf9f904be0eb5819df978ec82eecb181bdddf4b2fefe41f6b0dfb54b79a4bd7c407f57cafb342153bf8b4faef8d86ff1ad8cdfa3423cf074bf11fccb13f96a0d7299fdad3999f2c60bb287f6b0017d8cb4907f935186fc886f9ef15fb4cf5d32e53b2f9571be9e3c5f05dfd7ca98afa6fc5517bc44fcfefdde05fd0b5ff4bb2564ae7f0ed01ff445bf5b5d19fd9335b9027e9694711e2ed317fdd757b28ffd1dceb732ec81fe949f5ed61e4c4ffcf5ed8d4c7ddf0a64ea77aa2963fe7443f6c0d78e32cedf477f4ee7239a17b2ecdf437b14887d8625720e3cfd56c6fe6bd49f40ec51ab91abb0879b90a9ffee8b1c80177b65ccefa27d0bd2cbea037b0722ff5ba28cf6ed87ece3fee54319edc14e19eb8d7372003ea0bfadf31153d4ff50f4fb803f86a2dfe94ca67ec7904cff5f8fc9d46f3953867e313904ef509e617ad9f8f3a18cf612fdb950e47f503e91ffb952467bb02087e0464519e7afa23cf5fb8929fc2f127de7bc9fcb8397783f92fedaa54676a1ffada56cfd312c93a95ff4a58cfd9d7b720476609f28bd6c79a1bd8b44df46934c7d2e5fcae8afc8f311f8345446fb5f56c6fc0bea53e4be8063ebff655d9f9e96c0628fc9984c7b4cabcaf8feb60216fd9b0ed903dfa7ca588fe2fb628f65932cf66881d3cb967f0f2cfa1c87ca389ffe1b2cfa3c2bcae8af6fc9597064fda5fcfbfbe2482f2bfabc8dc0227faba26ce5bf15c93e787d2247d8dfd299814b2fd0679d57c679f8057216fdd9c19d9cc3fe83750d9c5e36bf2fb0c87f7194319f7423e7c0d78232ce53b1f1b09c13fde63972017c3a80459f86a78cf1c6831c80333f6091df6983d3cbe65f078b3cf74f658c1f3ac201e64f5c721e7ccd2b63fde68d5c00bb60ddef3f85bc79d16f522653bf26ec9937f2e37bbf8232ce4fcf2be37b93841c823373b0e8bb9b9173e043a06cf575517fec8105b63da3bc12af1f28cfbcf8e7b343a6fe67ca2bfa9e1365ccb7bc938be0e78f327ebf1ae9e97af904f529fdbc03fd23946741ceb77934c8b2be0c7b16c43ea72339043f06cab00fea5f41f4dff2fdf4b2e98560d1e7592553fedb4119f31d1572097cf956467b3f56c6f7df94cf2d8317b6ff5ffefd7d24d8ab28fad7517e458356fe13ea6f51f439cfc911f8007b1545bfcc17390f8e57cae8ffefc905f016e56f175cad3e28cfa2e8dbf85246fc6c91a9ef6540a67ef78cb22d8ff39a5c0187b6fd2cebef954fc9b922f43fbd8045bf735e19f3db88c72513af70deea2799fab875619cef779992b95f6777061b7d319e637ae965fd07e555127fefbe93599e2d3e2ffa9cefcaf87dd02eb90a3eaf94b1bf01f159c7e773f85f59ca7ffa43e6f9cd75e4572ef2f70fce3e58f45fee94711ed0934cfdbd19b948467b6aff587de1bf6591ff922153de07e5715df075a78cf5a68b32e6ab63b2075ea03ee9f83cac93f97b4e43d4978ae8db80fc15d1af7e2467c1a7a2b2cd3f58924bd06f5556c6fc7a865cc67ea72dfcb9925ed69f61cf8af8eba54fa67ed70699fa9c9fca98dfef917d703354c67e7cd4571dcf371764f6e7c790b72afacf5ec925f005f6ad8abeb7809c03773e9571def00f99faaf6ae432d8417da8a6979507f6ad1afd313ff945a6be97aeb2d5ef5c2553dfd34819fd9d4819fd81981ce0fef9a18cf932d41f1dcf0f610f57f49fee94315e82fcaee87f3f295b799b5b721ebc7a23b3fc57797205bccb915dec37796f9143acb76e997f7a597de06faea91fb0df9e4cff7f9cc9b4d7b5a98cf9c70e99f6bbb694b13e097d3cd1f78cf6ca137d9eafca98ffbb900be0458f4cfd3a7572157c282b633c8cfe86975ed63e0b32cfc37a501e89efcd0399fab72232fde5fead8cfd53b0878eefa764d16fbc2597f93d7d162cfa245532e5dd2f94b19f12f1d94faf943f97ca381f17f5c597fa3c87fd02cd7f4e66fe77c81348fea72ab908be1495f13dabdca73cab3ad905afd1bf0dd2cbb64ff0371dcf0ed19f084dfe582f80bf8679ee6759a2fd08259e9f3fc9ccfff6422e815b6b65ec6789c91ee459b695adbe3ed34b2ffb3eca3b94f66d097b4472bed918fd8348e49d8ec8dcdf79873e919c477686be91c8777695317fbb24539e644cf6c19b9332f643c8f301e61f3dc4efa8ccf3b2021b1f2a3a5e9c9fc122efb844167903b0ca9b0197ca90ef5a56c6fc2ed32f55c0b50999f2462fcad85fc5fc8dbc38ff3454b6e5eb597fa9fc7e6fde068b7cd38d32fa8339b0e4bf7990997ee429c37f1c7284fd4c87045ce1792c818dbf95dffdc8b0474ef2bbb4c092dfd92157c1a782b2b5ffc62347c8ff7852c67e5cbe9f6e28b4f6eb912b987f74604f7ba0bcf54f5bdf2a3a9e9abc8145be7a036cbaa7f02fde17796a4fb20b5e76c894c78bc015399f04f9177255a43faa28a3ff91079bfa8df9ea3ad903ef907fa1fc82fd71fb3e3987f66483f2b51fe0d9f2827d743c30847f1525bf799eecf2fbf00158f27b4c94b1feed927df000fe5134f2d8f75de12ce45bd4c0159ea713411fddef9a74c8b2df01fa9444bef1812cf27d8125ff8f88ccdf03d92cc1267ff863979c032f33cad8bfd22317789e3fe54b2feb1fb6ff52f95def823f97459e27ec5996f38cee7c5ee4ab2564ca77f395b1de0efdcb22df3343ce637f5a04f96d8732e58643ae8023d49fdffda8880f15231ff68ba13c2a92df7542e6ef83d4b6ca383f13e56514827d5659b0e4b71b2a5bfd774cbf52c5f75e916d1f2ada1f1d2dc022cf05f6ad4a7e8f2d99bfd7e2a37e574d7960be6842e6ef310c96e412f62badc992bf6ffba715edef8d6fe09c87fc1b3bb0090fd84ff30e96fccf59658c1750be6e99bf1713b964cab79893295f9057c67c499dccdf4bd87e83cd057987ca386f06f146f7734ef0bc27f28fcfcae80fc15e7a7eda99cf8bbc7bde177f0f5fc89427ee2b633d7f0f4e2f5b7f3a641fdf632d615ffdde6e86f2f3459e1bf2f325ff6b89ccf3cc2f67651b0f763e99f2382fcad8cf7d24cbef6d401e5fe459cfc801f647af21bfae6f4c50ff02916f3c24fbe033f20b449ec798ccf3a2cf3fca361eace43ee5e96fc8fc7d8b434918fbc5e2b5327e9f19f521107923c473edafcd10af43950ffa8692ffa541e679e71f0f655b3f570332e54972e42a783912867c0ef409d3cbca8bf816e9f921f0e7c8c883fd0ee8af4472bed719fe13893ce7ae32daf72699e791af0a64e6bf63fa157e0fe7dbfb55ed5f653260c97fd62007e0730f2ce9371ee422daa3634c667ec191ec623fd8d123f3f702f62e38bd526e5afb57b5ff746890c53edf609167b0024bfebb90ccf383b78e327e9f6941f6c19b2658f2f785f9bdda14f9e724bfd14d19f513fae5d215776b8f09b8ccf3cef773b2c89353c679d22d32e5e917c921f6e76caee02abf973bd8f6b8aafda7f10b58e49944e410bc188225fdf51b3980fd3d94973d70d4ea6feb43f5773e370f96f41cf84b41de3f54c93c4f780ffba49fd7633fd78fb28d47ae8df755ed1f1d2664fe7eea14e55f94fce67d659c1fc2e70bdcffb482bf16cb3c9fd73b83d3cbe67f2397f0fd5764e7278d7316f0fb902d9fccf1d0f40296fca20ab8ccfdbffb3ad8f4c0b1be0cff2849fa21fce7b7ff5203e722a4b7857c653362807c5d658c67e0cf1579fe81fc2b05ee8f8ba660933fc63b3565ac8706e0f4b2cf431eed1f244b32ebd3780396fcc65965aca7a0be540bdcbfb849c092df2e22e7c0c777721ef609e07ff68fb50feeffeef7803caee437857dddfc0bf85102cbf959b73199e747b97c5ff30fc879ece7d9bd90ab980f8fe04f6e7a597bd9fe49d593f3a8a733b0e4bf45f97a925eb22717c05bf8bf975e36bf11d9c7f75b1ee2e3ef7e08d4675fd21f5d94317fbf06abbfc17ebee4b7f394f1fb9b7cde8c10b0debf054bfe0b3b3f52d5f6790efb0592dfac4dce82ef7c5ece9ff2111f0249ff9e2797b8bf04f905e965f5817ea1a4b784fca13ceffc28a3bf0bfb87e965ed0fff8be4fdd95d18df2bcf13720ef71ff09748ce7f3ac21f23c96fef93cbe0e55219eba528bf28bdac3fd9f2737fe71bba60c97f7625e7c04f7281bff776788235fd1bb902de0c95b17e3b01a711dfda87f9a597ad2fb67d707fd78f9b60c9ff4e96f397e2049c8e886cfe6732f3ab3be02acfb3f23c707ad9fa61fdc3fd3d1fce074b7ef3a632ce5b7c054b7bbe9d82cd0803fbc5d7ca58bfbc935ddc0f17ca387f0af6b43f0866eb0bde4f7f2ec2e6778fc0a26fd2004bfaab0fb2a417295bfb1e843deeff4079db03a4ed7dd843dbbf19caa720f92ffa60496f332333bde34a19df872cc83e38e880d3cbea6feb9fabede1654c96ef31f07e51f2ef0560933ece471b2ae3f76b73649ffa5694f1bd0eec5334e56feb835b06a797f59f9a32be97863feafcc17c0e1679661965ec67fa2617b8de8bfa5092f39d16ef60d343c7f9352e39c47a7efd468eb09ebd81bfda0d79b67e8c94713e89edcfb8bfdfbf7e82459e699f4c791aafe412fcf901f9f5fca903ec5f167b751d72004e9ec2907f532687d83fb1ef9123ac47af507fed8283d51ffeaff307db01597e9fe60856fb217d3ddf29817d2a92df6a438ec0eb2c38bd6c3cb6f1d1ad4a7ab37765f427f260797f7557c67c05fccf7418c0870238bdacbe4fb28bef5b42d857dbf7954b96f362208f2bf9cff7e422d847fd7425bf63879c05c72565fcde489b9cc7fa57f20516792688479ea4bf87bd3cd16f7f004bfafb9db27d3e89c1e965ed87f47c496f7c54c6f933f04f5fce977a0af33c9f03e4f525fdc50739471e28637f3aece5a7979507fea4edf914fe16883c932f65fbfef89d2cdf7fa37c03399fe980f81e487eab0e390f76987e7a597f81be3a7e5e34c95cff9f207e8792df0efe104a7adb8e32f64f64c905b08ff812a6978d0f8827bffbe74e6049ff0e7b4662dfe40296f4bcae32f63ff3fd2af70bc4b06f945eb6fc5f84f1fdcc3e047b2fe0c4f65f3cfd5e6ede068b3cd3a332ce7f7b27f3fbf4ee045ce5fe8cd52fe3f738a6ca365e246732f733c48132e6237b6091cfb7f5d9d3fec2a80596fc1f35b09c8fb476c0929ee782d3cba66fdb574ffb0343e89fd3f48a60496f3f034b7add13b90cf9938532c62b4f65f4a7999eb9b0be3d54c6f959361e7abffbb172609167b451c6797b137285e71d8cc122ef0af6ce57b97fa07656463ce993b9be1ea03ced0f28587b41fedff342b6e0b48365eb039e2fe4f97dfef30296f3999607b0c4b3fd9e4c7976dfcaf89ee6874c793cd8d71e1866ed81f22b4a7e4bf84b519edfddc93ed6d7bc2538bd2cc33f7ecfc7f8044b7a735fd9eae742df5295ebe9eb22d903ef7e94b17e0cffb01bd2ad7fd9f8e0fd9e37198325fd498e2cdfcf7f80e53c28b70996f45748df2e80dbfa62c75f9efe5ef2c4034b7af72a58ce635a2660d12771c85c3f5f9d94b17f3c03363d4a9caf8c78602774ad3ffbe42abe97486c7fd6fb9daf47fdaaaa3c6491c7817cd56a80fc9c8a32e65f999ea4bfcc925d7c5f34c3f3aea43fdf29e3f70a3ec9fc7eff89fae24afe8b17b0e4e794c9fc3d2807f5c395fc12f8fbef7cfa0d2ce92fe1df9ed8ef302333bdcd9dccdf970ad6ca286fe8e3497e11d34fffd8fbb6fdf474bc3d298025ff1be2896f9a2bccc796c0927e7205bb2f600fe5efa797b517fc3b90f4e62fcad6fe338fccefe9ef483f90f39aea887f41bac261f3677a2e7fafe7c8fb6e16bc0ec1e965f5837db5fd1da1fcc23ccf2bb8e3f950f27b9ec93c1f6a0bfb86e2df5bd82f94fcfb257216faaf3f95319e8984711eedb142ce819f7765fc5ea34be6ef3f046fe0f4b2f2a3fe4722bf8bfa14497adba632c67f1d327f3fc4413c88d2cbfa832d5f5fc7ef718e2ceb2745b0e4371f2a5b7bcc7fc83cffc077c0a6b8edfb870199ebbdeb1638bd6cfcb2f2f859797fd257c6fe39a49795f4fa0332cf6b5d8e95b17e3124737db47b20737dd2cb80d3cbdad3f637fd9ce4175cc192deee44e679b95e024e2f5bff3e94f13d89f56ffff7f72063b0a47fd88325bd65ac8cf18530cf9fddadc95cdf74abe0f4b26cfb6bfeef79e26f60c96f9655b6f57d1a93793ec1f04519fba70a60c93f7095b1bff78b5c062f8bcab63d0c9fe0f4b2f101f9ffaeefc3bf8a925ff40d96f4d65fca382ff249e6f9a70ecadf1e9062dfb7ed87afedef08f74b92febc43e67904f50758f489ca64c9cf235770dff795f17dc14c19fb711a641feb536bd8d77e309572c3c607bf2cf3e7931d58e5fb54c67ac4914c79a779658c67204f59e249542053beed0f99e73d76c7649e9738847f9445bed82197b1ffddb5fd635fc7db43945f45e4193595311f05ffac487e49447679dea4af8cef27a7648febf58e327ecf8df7d3cbf2985cc5f73509e4ffed0fc07faa22cf81f725bf5d86ccfcf66765f4075760497f0a7625bdd993ccf30b0ea8efaea4b72d2be3fc5c9fec33ffbd32cefb9983d3cbd637db9ff47fdb7fe4e7497e634719ebf5280f4ff2ebf7c9cc2f9a29e37ca4b232ce7f3b9203de0f95610fde4f2f9b1ee2a7f60f46b0af2ff23450fe7e89ebab4be4e7a70752d9f29a9229cf6e4296fc2365f4d7617ffbc7de477e3a7e1f41df40f21f217e05059e1f91a0fe06629fc42533fde4440ec1aba532fae39037482febdfb6bdf77ffb0fd03794fc460565ec4f40fc0a35bd11390247a132ce7f617ae965fd7da28cfe24e2898ee747a80f91e4b7457c8924fdcd4419e587f86cc6e360b7a18cf16c1d9c5e367d1b3f8217497ffc46ce82970bb0a4178f95313e5c93b360bf054e2fdb9ed8f81bfc8eb7e760493f4cc0f2fef6a08cf5bd163987f5788ff7d3cbbe6fdbef40c7df8d2258be2f9840be9ce4375a2adbf41a7d7211f78f55b0cac3f44dfe381f2e56c6f919ae32decf90f3dc4f1128a3bd80bee9e7d8e85f6cc8797c7f32b2fdd7202ff28d33e41c7f7f08f2e725ffd53759f28b946d7e11e4cf4bfabeed7f06da7f18e7c092fe7a0096f7e319b9c0f416ca781ef9d90395ed7ddbde05bfbf9f8ce78b92fef82e8cefcd57b04751d25f3d9571be61895c04af3ec1e965ed5150b6f1c84579fef60f2660c9af9e05a75fcc58f9cb60497f110863bf43522297c0fb2eb982f5736f0f4e2f6b2fdb5f0f7ebf77813dcb92ffb848cef3fc27946f59d2dfd494f13dfb915cc6fdf84719fb1f7f19feb40507fcbec147f9fe9e17b1024bfed35019bf3f3a044b7ea1ab8cfd8c157205f905d0d76e20b2cfdbf99be0f73c07947755f29bfc28e3fc27d8af5aaa723f24ec5d95fcb609b902761d65e80b7fb30bac567ec40b57fb5f23b0e4374ac8059e17f00196fc923a99e92f7c7295fa169571be0cfcdb4e00dbfce15fdabe8ff0bc27f9c5f05f4fd27317caf83e614e76c18b3cd983bf8588a776c06bdfb7fddde0f77b03bcef4b7ea39932d627e01fbea4ef46ca984ff7c81e789b51c67c748eec73bf08cadb36a0f63ecaef77bf1bec1148fee3885c04fb483f90fc928332eaf784ec830f6770c0ef6946b6fd0e4249cf85bf85f2fcba470ef87b67dfca8817b08fb6b713945724e94d27cad84f83781a49fad19cccf4bd5f46fa56be50c7dbd32d58d29bb6c825f0d207ebfb2e39e4fe194719eb71efe0f4b2cfdbfa15feb6b73db0a4ef8660793fe2f35e04ee5e94711ec110ecbf90793fbd526edaf20c73fa7d970796fc661b65ec3faa8225bfa8a48cf851046b7e57707a59be914d87ddea63ed1dfece77e37e5ef21f7594719e594c2e83dd1d58f20b0bca38ef7542cee2fefa5bd9de3fbc2863bc7f02ab7c78ff77bf580d2cf28c5b64ca1366c092fe6a45ce31bf2338bd2cdb78126a7b3bd98325bd0dfca728efbb9e32e43d80d3cbc6635b5f43dddf3e46799724bd71a88cf519d8bb24e9b901394ff69571be73935cc17afa610d4e2ffbbced5f86bffbc370bf2cf98d7d32cf5faa2760c92ff295319fbe2017c00b3b7f106a7b3846795724bd25ec5391e7a34f65ec57ea91f97b6fcf01b984fd394ddb3f0babd2fe8c71bf2ae98f0365d467d49faaa4177f2963fda34ee6efa3053fcae8efa1bc7ff797e7c192fe6441e6f94601f473e5fdc057c6fcee845cc6fd9a3ccfdfcbf26dff2cd4f66d0cfb78927e1dfee649fade0799e9797d657c5f342357c0bb8330f6f7d44e6417fb41c6b6fd0b7dc96f7651c6ef3936c092be372033fdc851c6f73b55327f0f2d417dfe1d7f223e0592fe6c49e6f92a5e052ce9057cdfaf8263f8dbef78b20b96f7eb783e4cbfb8b0efc31f4279bff34576997e200c79f7b132f62bc25f22493f407d8de4f9a0a48cefa1ca648ff7b3cab86fed1969fb35ae8225fd715fd9c68b598bccf386821c58d33b917df0b1a68cfd144ccf8c98f1fb2a48ef777fd7032cf98d3b64e6570fc0261e61bc5d26333fef5319fd3b971c80f74ccfe7effb1c6cfb12e9f872dc056b7e903fe7f2fb8404f2e524bde0a28cf9dd3e39843f47b67f1afdee57ee8125fde943d9c6ef7a1b6cc6df58efb981257df74a0eb95fab468e90df1ef6cc0759ecff70610f6d9fe690b720f98f7f94f1bd479bccf393bc1258f23bdd94d1be323dc9dfb5ed67a4ed553824cbefe5a0fc8a927ee883e57def0b1cf0fc71afa88cf664a48c7867eb43f43b1e843f9424fd495b19eb015bb0a4e77d9379bef9aea68cf46dbc8c7ef757adc09afe4419fb6d32649ebfe415c092bef7a36cd3f75ec83c8f7c69fbb791b65f932558d3cb83e5792fab8cf12058c767e32958deaf23bdaac853fb2033bdcd4a19f12f47e679e4fb88ccf3991f9e32f643b5c93caf39b0ed7da4edd724068b3ce3a7b27d7ed221f3bca246022e45f89ea2067f72a53e8490d715f9c2ac32d69fdfc905dc0f2acae87fbe2a637f4089ccf3a503f8c36f7b88e73d91af8ef2f234fdaa32e2e38e5c249f9591df3b99e77befe6649edf1ac03e3afe6bc05f7c59cf1ec3bebec8138660497f5d51c6feb4805c6279bd91799ea78bfaa7ede318fa0792fef85b19eb1b6732cf63aa23de04a63905231ea5f3b1369e0528cf40f277cfcaa89f2b7219bc7f27f3fc6e1ffa6b7b9b2464d98f047f0e45bef1842cf2c1bea64385f5a03afcd17410185ff760c9df3d28633c7e2257c0bb8e32f6ffbc2ae3f78d7f9f47ffa741e6f99a3ee2ffeff814f13012791b281f1320f1bd6003f688d213c32dc35e51fa45b4d507f1d0382ce677ea4ccff437f17df7881ca1fed7517f23a9efb53199e5511b90c51e4732f54f06caf0df1bb94aee2963bde3aa0c7bb4c82ef69fed9ac2d8cf353affdd95717eafbf7feaafeffc5d0a7f7ffd67d3fe0f7276335ec63757900933d19ff397fffa2fa5b7f88fe53479c599a5b912f22ab3fecfe9fcf7e9feb54cfe53692c329bcc36b3cbec3307f35f874c9239f2ce2973b67f5fccdf9b54d2ff547a67735d8d2e3793f2d2fcbd3629aceddf27a67aff27bef2b0da5f99e3d5a622cfa77cb2774fff24bfe77f5016359bc2e99fbe7bcad4f5b9c69fecfff7effc174be6b74cfefb69a94c7f96ef6cacfbbf21e15fd23e598b5fd5ca7fcdeddfbf91965292a91b7f39649ae6bfcefad4c9feb3b45e70b66fdfec7fa5a9c7997f6d8934ddf4df78e3f7ffb6fef04c2bd3fe77efbd66de32ef998eb9baf6ef5ea69f19643e32c33f3ff7c732f9d39d51669c9964a69959669ef934d757e63bf39379c96433b94c3e5330d7abb98a999249b59ca9fce1cdaaf9cba1d47fb81cd7f11cdf099cd0899c45a6edc4ced2499c95b37636ced6d9397be7e01c9d9373762e8efb9f28a39b73756ecedd79384fa7e6d49d86f9a799899c96d3765e9d37e7dde9385da7e7f49d81f3e10c9d91a1b13371a6cecc993b9fb60efeeb1cda468e7f6fd97f5246ce97f3edfc382f4ed6c951dbbc53708a4ec9293b1573959daa9b71d3bdee9eeb6387b6bd423772176eec2eddc45d199bffa54c440e77ed6edcadbb73f7eec15cc7bf5c27f7ec5edcabb96ef6efab7b771fee136fbb35b7ee364c2e4db7e5b67ff531c2bcba6feebbdb71bb6ecfedbb03f7c31dba2377ec4edca93b73e7eea7fb65ae6ff7c7fc33775fdcac9b73f3ffd40257b7907e85e296dd8ab1f5c0ad7a192fdd69e879be1738732ff4226fe1c56ed95b7a89b7f2d6dec6db7a3b6fef1dbca35b75fadec99450cf3b7b17effaef7dc7481b7b37efee3dbca757f3ea5ec36b7a2dafedbd7a6fffcc57bc77afe375bd9ed7f706de8737f446ded8feff8937f566dedcfbf4bebc6fefc75c2f5e163b96cd95375cf08a5ec92b7ba64fe4554d23e8f8ae94ca1fcbc44fb749feb51cfeee3afbe92684806f86bee9929bff7bf0befd857bf763af2372fb4b3ff157fedadf986beb35fd9d292fa3a5e9e4e7fdbd7ff08ffec93ffb17ffeadffcbbffe0f5f46b7fd6dfaffb0dbfe91dfd96b175c66f7bb117faaffe9bff6ee2d2edafde6bfedfdeeff85d73f5fcbe3ff03ffca13ff2c7fec49f3a1ffecc19fa73ffd3fffa737df1bffd1ff7c77fb112bcf85977eee7dcae9ff70b7ed12ff9e574dfccef1b41264857a6bcc03725320882200c22a71c2c502ee67e1c2ccdff4f78ad8ca7efff6443c35e2e5d8af1e6a663b2868ffcb14c828d370fb6ffa476fc299560e7fd045ba794997aeff6ad7d70088ec149720bcec1c5fb70bde01afcd54eff224a9858e607f7e0113c535b04b5a01e34dc59d054ed5b41db5b06af7e2b780bde838ef3ea77ff127d6c2ade5bd00d7a7fe7d5e65a06fd60107c04c3b4ce04effedc790d46b08579676f6af23818fb8f6062eaf04b30f54bc12c98079f26f25efc5df06552fffe63999870fce3f58397c00c5a826c9033a512042fee3dc807053ce7ae82a2f9ffa5a0ec7dba57efdbf49dcf6ae37d50f53ec34ce89878638629b0d81fcb24f4dc5d60062cc136d89a9a960baa6160deb75768c619a6c6154d5d1c8451b840f40be3701926cc611faebc9f3034657336efe65c3f5c879b701beec27db0090fe1313c791da95712d5cc80e5ec1f4d94a8b91dbbd7336bca62125ec26b7833d79dcf7d3ac3f0e16dc367f0ee74dda269b7ff1c6fdcb016d6c346d80c5b613b7c0ddfcc3fef7e31ec84ddb067eae8caaf84fdbf9492ef344c7d736cb94cfc5e3870e2f0231ca675c4e43c0ac7e1c43987d37016ce9dc4fb4bcb127e865fe177f813be188b7c1b7d2b41254c6353c1bd06a1a935fdc00b73a65c4ccb1fe67dc70d8ce50bee2ecc78bd203031ebdbfb762f41d6eb85c5d0496b49580acb28c53f954925ac46197c25e506fe228cbc7ee4581f78891cef23f831a561aec8b575731099a77e239929cb1f3302bfa0be98daf469dab39d69d6e641310ad2d7a24514474b7a59db6b4649b48ad6d126da46bb345604cf68eff6c35b74707bd1313a858dc8f6a4a373f88c2ed135ba799e33cf34ff6c9dd4bfc3915f7073d13d7a44cf7014d5827b548f1ae69f66f019b5a2b6699d3ea2d7c83c17bd7badb40ced9bd7a81375bd4c747386512fea47e768107da465e2d5fc62348cf67e3625f72b1a456337efbdd10332d1249a4633e35099681efa7f8a47fb2031bef965ea8c6754fe8c6c6c0c77d1b77b4f6d1fcdddbb3737c3c49ff44aade3674c0b9c895ea2ace8f39736dec9f4a35c943783e9a27933b5b9291b7f61dab09e2d8d52548e2a513563ba4e0be70f725416ae29433350f32a5ed6d695635a2bdd202ab9a149e9bef04c32817944fc6cbc888cf77e2f16c697dbeec446efe7225e2c4dec2e2d12e3585f7872b1f2a7e1c3c4ac8effba30a381c566b15dec16fbc5417a2adedbe268a2d524f52a73ff94f62e9c7871ceb41797c5d57b5ddc1677c75d3ca247d0f5774e10f4a2d6e219767d3bb6f03b8b5af8f44e516f51373934164d6dd11e8bd6a26dfb219df062647b0dcfa86d8bb7c5fbc237f1260c8ba69ff3a7e86ecac435bd24df35113cb5c9a2437f8f17ddcce7a267ba20fdc5c05c1f8be162e47582cd62bc98fc7ad8dff6854f4e6e315dcc325fe9cec4c57cd15b7c2ebe16df8b1f191b2c5eac04872071ef999f45362d8ff4723d53827def278d6761e8958cb7144d89e416795326056faabefd1acc1745d30bfbf45fdcafa066caa3e4ce17e545c544f585b35d547d1b5be34cec848ff019bbe9983af6623f0ee23036152e5e4096c5248ee365e4c649bc8ad7f1c694c847bc8d77f13ede07717c888ff1293e07ddf8e2a4e358d38f8faff12dbec78ff829dafafdb8666a4a2faec78db819b76cadadc5edf8357e8beae1397e3735f07db108667127eec63df3ce6bdc7777a64f950f12d387ca858c18c14b3c7072f1473c74cfc13634216531f84fb6aa5a22ffbd31633c42d44adb8d781c4f32ed781acf502af13cfe34ad09eab36959dc6bfc157f2ffcf8277e91e8ef578ccf5dc28bdb8fb3a6873c8db38b76d008bbdeabbf35f1bb15e762db13f64d64f1d67121b34bc77571312ec5e5b43ca262e8c695b8bacc2c9da56b78bef4bcfed278ee325886cb68b9708365bc5c7aa9377d2d93e56ab95e6e96dbe07bb95bee9787e57179b2e30f27535e9ecd38cb59ac9797b45496d7cc63790b6acbbb69dff2c1d4d9a535cb392f1fffc40a0ba39d890781b37c2e6bcbba2985eab261eeb496cdf48ed1fed3f596762cb96c2f5f33b9c5c68ce7748c686a753ec82cdf96ef669cf78712f9f3dc0a9f9e2c3bcb6ef8bdec2dfbf688866a66b01c2c3f4c1b3d5a0e9736622cc769cc326d553ffa5c4ed2b1d2726a6a72c65865b69c7b833ff699bd5c6402603ccea4766e2f3f975f51dbb4192f8ba5db8d5e97dfe125daa52dba675a6977b0fc5efe2ca5f49acbecd28ec396f96561594ccbc3f42942f72a7e6952cfdb9ecc3eadb361e0e5fd4c9431fd9080fd8ec0f412bd6569595e5696d52413c68993b88997f84990b6bf499844c962394feb9cf34ce2a8e74c33a7649924eedc59242bbf98acddbeff4c367f8c22c9d6ad25bb60bf98a77924fbf0d38c9b36262694adad376674b8b71eeb851933ea7692edc24f0ef13c749363724ace8bec229b5c926bb4084b5166594a6e2895bf9b5b49eea60eb0d5f2f2c923bddcb4e536ad46e4f88ba898ca9f3c594fc2d0183c6363bfe921ccccb8a79dd4ac97fcb1dd3b25f5a491341747bf96b41665bf94b44d645e85fde435da266fd1213a24ef4927e926bda0fb879992736669533e267d9487e9c917ffd2c7fff375302d6cd63d247ff08a6095964bf2910c13e34fc93899f80b63a369320bf6c9dcd6bb596ca36af2997cc5f5e4db6b273f666cd2495e16edf0123c92ec9f46b0393f8a0ae13ac925a93f98189d14d2da9158cb78d3a4643cc28c3b8c6764a252524edb1f3362f7bc9e19b905ae2927d3f7d921d2bbbee93b798bc0d6afbf8d5dcb8e698c2b7fd0fb10ac4ccb604ac7eba72946c5c4b4a44995a596f3faa986cbb44fd20a63dbd67cfcd5525e719589aa2bc739387bd3f3694bdbecd7dcf7e8b08857eeca331d5693d12a726aab85e7afe23fd8a0b8788fa3d5329e9bf6f45f95c7df5cc920199872c907a6efe92e5789ade1f9d56ab55e6d82b56d9ba2288ff9aad576b55bedd33e425473bbe1d5edae0ecee93772999ec435330eae6169e147e9680ea5ee657ab8bf3a2e7dd3c69af48db5ccd8c2bda7fd291347baabd3b29e8ee143a364fa6fd37bb6fb304d9f7867b43bffab32595d5657af9f3ccc18e5271d1d9afe7610fcac6e51294c567753136d8f70f530f1c2fa6010a6a5bf7a26e8059d56b520f9ab5556759909fae3e578c96ad5f0f7cededfad9aceebaae59dcc78e1cd9f453dbfb9d019d7c52c0ea3a29b7e7af85f2e8fbfbfcc88eb252ca144d29a9211099f99236aaad7f00b26ca0ea321c6aeabf6ea75f516beacded3555b331e0931320bc345b0eaacbab6a63d8d8dcfc67203d488e552e726dbde78d55bf54d1dfb317db2bc2d976d104599d540faa37f3b2f7c4ac2cca7b1016a9719619852fc580d4d498e7eede94dc235cb24e7f5d2fc1ddb06ac46abf16a12847f2a9169da7bfee79763eb8377f59babd96abefaf476de2e76d21929279d536ea4b3c0cbdaeacb8cb4fe5d49ff6f5fe7205c7d4ba9ac7eac44d74cbc7a713aabac17acb6c6c372eec07ffa26caa63d6c6fec7556f930317d98b394ecaab0fa9d6f7e3311aa682cfd924674334e4c56e91ac65b5c0dff58efababe2aa94ccc2e5aa9c794159fe876dbcb94ca4a924b55535dcad33de1f7acfa6d7305ba77f9bb8694a2c8d029f364e7a6efc87ba505ae5d5abaf6bd7f9f2c6c17eed65ded7fe5fca24edfb3cd7c13a5c47e1c38c0c2febc53af6dcb569479639e7351d0905d7a4f4ff6d1dd1ba12b8feea2b8e9293f9071e9738f775b44ed6ab75bc5eaf37ebadd75eefe2d7f5de5f6156351e2d3e559a3d5a7527b73e9876def15de3a165334e37a378d3ad89d669899cd627d7b484eb7366bebefc9d6ffeb144febaa6f5afde595fa3fc22ddbcfce1d653cf5815d7b7b4af6b7dc28cfd53add6f7f523637be4619923faf3ea195c57d3c560fdf4fdd506b364a8cdf0cc752d785fd7d3f2081fa644a2e896c471dae6b96bf3f7ba19cdcce8f7fcff47999896ee3b8d5fa6ad8a825ba6ee9bf19ddf876f848fd5e7bae574d7ed68b07e0dffe897a7f51be4f1edaac4fa3d2a180bd4cc7f7530df652257bce67cdcf275dd8b7ec242f4b3ba07f1df5bf75fad33fe7db9b8b55526a9a73d5eafbaeef3ff4ed6032993f587298993e98b86ebb40f3e8a22ab75ce44cce57ab4fa761dd3e245ebb1a9c769b46efa7b5bd213337e9e797b6f175dd753333aacaf67eb76ba72e45dd6a61fb9e8c6d16f4ff0bf75c9bb66bc1096d69fee76fd15baebef74646b6a8a9b46aeb5190d3b33c7f8cbfa252d115cebc8e9afb351e74f7618869fa65ee48cc6c7b5e98dad8db5bd5e3231bee8acbb28917571a5565cbc995229adbb66bcfc4f576cfed93ae7dfafc7fff10d4d6390ecd61fcbb7dfd980f561f591b627663c6fca29cab9513c5f97939df190252c92c657afece5d795d42aa67cee699f2b6846e90ce36d6146d0264ac49eb3ae6e32ded5b4b04bbb7e77dc3881a9798bafe4646ae6bf98ad36adf5d6bd1b6fb97b3d3334b8fcde491e9bd453c61b7f35d8049bf04f33a0a74cde9bae3fe2595a4bc297cccd9ffba62df716bf65f2ff92f7655d8a225db43f867756a653ea23824ca2323abd81082893120cc2afbf2702a71caaba3aebebaa7bd7ed585d95652a10b1cfb0cf1021e8ca92528f41ecb515c5d88f8363732c42235a812fcfa201ae5fd91760aacec1021d73bd9eed1e4721b1008719fdf6ab28fc2a263fd79de370bf696db0231da687414c2289f8182cfd1d35a2416776c1e7958cc3386a5786b27db0b6bb3505d133a586a79db21bc7314489253585b56976b338017ccac3345cbb2fef7c40ea99711a9f8279348bcfb4122ad1196464b21f521df06973fa15980d7ea7b75f7fae5a1d667116a3383ff0fb38a20f20d7073ff0e2224c9c288677c755143a67cc36882505df06cf37a57d8810e5f812ae7dd71bb8c80df11d4299c8beeccff7d4fe784c70c524eab5f77183c0dbd1f6819eee93073bfae795fe754c9e71098c7d1cd720919933bae9a84f630f1f3731131a2031982f8bd1fcb3c57116d435b718937c3bce68d86f38fb1eb33147cd9c83a784939d1a4f023be66381aea26ea401cfb97ede5fc4a2a37ba383184bbe4c6fc22edccdfc50d3566319d09f3e331a3234baeb9e68de179dedf5697ad8a38410bed3d358f1ca98a723587f6f27ed947816cf5d295ee08c8ba7d0215c553d22885a67370e8ce3ae7bd66d1b6bb1fe74af8eb769d9b0b7ddedda1ad7afadf2bfc3e4868b0f42e3cc217ee9da456cc4f7bc2266d1d1b592e3d3b105f1ff073dd9f9f132ec7b805abcba22b30ed378439fa3837388b7f10b789084aa706c12bf06bdb8431f0fdcc17fe45e0f6cdcc5792c2ca7a03134ac448fea8074d6f43593ee9b711f3c570651f5131af1207e8b87f10844799450cf7906a7ebefc07675133b5c250e5d24bb9d158dbc6962276e2c8449b2df2d3d25f1123f098e2839807c3c6655eca9b067479fb4f13539b6f13aae56f94f95f6ff0a13f0215d885b5c6f07f7edc50cf5fafe89a24b12467ddf715e3f680965870716a2152b898ed7be0a6a15ba491c9e7c2649e8231d26f64e759ca047579490a4741d0bc929393bfdfb35f2d66a009f73f71bc748327a0d5ebb4c10c822a23b211d2cdb5cd7fe98e4617110f79b7d4acfc12bf78e963fdfbb1f9ee90cfe87022e6c00a3385222bdc76c83d4ef8f8e1d5314e7ce68d6d9edd6747e308f286c9cc1139e3d5205d9bb655284da2366b0273644863827ba8388d03dfd094c7c239c939c0daeb270c9adb78b72ab60ee99073fdc24a5ed7e8cf2767e52014bf4934b52274d72abb6d7140b22e553b53f0e5760c38f0ef2193aa0744aa60bc00482ec9bad791e6e928c1376bfc33f7bddfd2abab8d9bbdc27a9761f0d90652043099784749f468e19f65cf4fc1ef735b0c076894e1e9981bd939249c227c2a148446f86ad16f0729bf444a1b87b443645ba0eae2391ecd459ee298c8cb34ce4e46e2d8150bcf973bf472ff7ab7f8bc8bfc5e4ee5546c7dece3b8e80d53cf4563fdad11b7891e0e043acbbffbc8e780d001925992573aacd2764f136114106711db1e59f80893d8885988a5ce05d59c8806c76bebc568b4dee76fd98deb80ebe7a2287e383e5405cb78f1dd33121ea58dddf9bd22b6cd9a39df702deb7cd8b40bcb5077f922ce2240a12d78fa855bca1ea44dd29f431ee24daa10cc6898b2d72a283ed329e9f053c8b0b57ba00eb3bdb5ed2b2dde8deaf81fead6fff2e265f703004be38c0fc6be7d941a0c746b8b683674efa34f2c4c2199564d9468cc9ca71a82aeeeccc7b4c0098246bba72e564439fe820968f837df8634cf69d5049ae7ae40e4392c5d9af401fa4e425798dfb8145ba45ae636f8705b69b5427216b8bbb79bd7eb04fba4eee504992ac93debec651a3734afa94b49bd3276717b6f2b38db43deda64ff290da4eb00c962e783090c6364ae7b47cf7dc2f50d2c1bf5bdfef6002a8d44fda11ed665a1e922c9d3f4d0621c413609fad671d7fd2f6b756769221e6f0bb7132a2eadd98d25de18e8949a93876a3d8e840a7f428ce41187f925939d60fa6eccfb1a7777bc9f1ea754e6e4a76e18f9ed8f4f9e8ef5ffc454a5f31716223a5526079c0ae5227b83d87933814b65d201f7edbfd9a3a760066f02e1f10177512c3a6f6b6ef0656ba6be5f349724b90acc9bf5ddbef628247ead267faf08453449e7b8f734730ac5b1efbfd48bdd44f03f0f5760af14c7a743cba4c43af8228be45c477684f014e4a053df0f4f01ee0b5943bfa31268fe12c7d1de7e1ee5e05a255dcdb0163e456243bf7d9f2a53bffe0a7511a7b53885d9334b96112ae42abe5c16182573bc57d0ed46d56c739e93edc7b74f4069a187856d8bf69c9ef8fef62f271502b2c4d8e999e302676f09909134cce6916d5a1912297067e32a0777411bd0226d7b5006c2a9ca90774738a4bc11a1c8ce3b8c504d741dabfd332ade0cfeab97205ec3ca6a9701a69d7fbe60ef898d8ded37b7b1ff9baf782a3257c8ddb75aeb20efe24bdd0a3b4de2de923e846816d57e4ef4c1c2d7a4a708d01d3e688bced5d63cf1009386163074919e8c9c0578075a18796fcdf818996bbb852c0ef0fb88721360ee3fd175e3e65c2cddeb6f721b1b8544597761f24d1724e378b1145a02709f02e9332b0974ac78049febc9280080bf62825d27abf721012161a1f6b5c0dc6b9515c79f506de3a08f0a1870958afb44ab974f2fc2980649694294f234a0f53e0650760c1613476321cbde22771aff50f5f898dbd77e392eec899456f109d199116ae53c1a781f1fe8f10f95f629286780d8f43cfc4d96fdff9d0f974b527b8d2e6760e9363d2ce3500697425278b489ec939618b11bd525504510bb65da9e8ef52297dead84965a78f3bffde59b4b2cd46d326fe8e56d019dca3967ad6d1ba32a0329dba79aaa4b3741e1e486fe0f98609e809b0c7384955b89b1605941a5a3babe5c174eb25789a4f758fbed73973b0027ea461cf7944a991bc927bfcc30e8abf8189961f3ac00379474eb6a497c105fdfe329feb22af9f9a114d224c3e1883b5b22293e4c84b2c9fc720ee5096e3134c2cc064f98c09ee3d4857117d183f5e3b38d718b473d0f77d6f7b3cbb51ba6e71728cfd2a08d20db9f30bbd38ccd22daea43a6089403eb0ed7a01ee9800b3408eb7bb7a11e2df85eb558f1444b9e9ab9b5fe5aa1b6d7096ac1d29894076e3df5fbfff0213820a30320fd789ecfdc0997dcd989c4d728cb4b4d3d658d32e9e3f358b7017fc115bf1604cefd35e4c769aa4fde4980e52e56ec73bcefc1004101b87fad335f3f49a834d810f478b5bafb25ba52360e6ee83719c681cf31e9aa36f3b7b0ff8c0eee09fe09d27db2968b45b3d108969fa51ef104e4e1b9f921ecf79d8dc108180cbf84e0cf2e73069b9f9ce4d713575edefdccea76c462b696bb0ce59bbcbe9e49e484ec995488f28192797b2c209eeb33b341e7df25a1f0016a7c05de8b8521339d1dbf335bded4179ae5038862f9e7cf0ca4fd98453703a9cee3bc7629fde7a033b8db413f8a228a6c07384deed09c0b7dff83e7f8a4ef15dba72b0601eae4ee241f58fff3a9bf5e73139e1fd7d941f4739f6f4ce72bf73bf88f8dc63623d62ce53124e1ef24964f43511405b52dc2101717cbb03c33da5b677f45cf2a99d7b3ab52cec61d34ee77074bcecd7d1ec94793db7b855278ff3133ae5a7c2a5ef19a9f0c0eed7b1893b778fe884ab8538c343ed646c4941262a60fae49d87b95d276fbe7deb5477ba7b3ad0ef9d15d6ff1e91ff3d2610a9909cdb3eb093c04b4adbf9caabb8e9e9f214ebe6a7da719e31093dba3e35e9115fc7dbb496c7990573926dbf698274624ee3137be24e93137f12ae434ca593047f4bf0b77c9a9e94d3ec343f2ddee76e4f2a5e5fd0bbd2f653e304b2be9368dc1b5026da493f61c64776359dcc93e5d1ceeabe9363f4ce6e2d1d09ebe6ff76fdfe0b4c76b3d6869c56c07becb0717117d0c758a5d877710ee4b43e6dc0366cc19208517cb55b2f9ee280b651e390f4c2d8c93d179bdb176f983cd7290836b47a7a3d754edd53efd43f0d4e6fa7e16974a6cf541aef6ffbfaea789e76effb785567d64ac6d1f0606de3b67febf07cd533b82e2a2311cfdb0d91bd7bac83e5cd6e9d77073c53ff7f8dc87f8109684ad3eee23cbbb8ffe030705df7438f4302789cf767cfef1db8b37f0ece783d726a198dfc71f47a3e265866537786fb776cfa963b3bce9dad4d51bdc7ca25407abd993da09a1d4bade20edcb9068b97a46e40c79d7318d0c96ab73a945e718ed2fbe70ef32bc2857d8934c0c47a8f72eb45fccce1e9c939b6fdbb17dcecfb37be156dc9ee84e87f8fc87f838996b77bb0f7417881a7d7ce89b37aefebe369241ee1377680fdb5579f53baed634134b79bda3de0c111ac6f81fdc6f9f4c8673aaf10173cedff7227e1ea1cc1c0ff656774cecf05fc5dc2ff11fc5fc1ab111999ab3eacd789012f049ec176717fd7119d2f5f60023ee75c9f9b7b7e1b18dfde8be657df3eb0718c5aeda6ffef60127748b7114fbfeea8d6d79f99e77e2037f47610c15c6cea8c795a71201cff509f592a3a73f4f03c8905e063c44a9df9873d3f0bdef62c46f463e5929420923d8df3590ac667395953938871dc440b71ecf76499ce5340e4d5758e83f07044e17ae7b5d696b2a9e4dc7699f2e7d9790e32e3dc9edacd5d8007f75380d55a44b8528276ca7f81c87f8589965ff78ef70fa667c13cf4b37ad69e1918f898d2e99cf567feea5af6da35cec6d9243a732439c8ae673d30b173d70974e7a923f3d0215a41862b384e14072cddd05fc8fd132696d33d8c3d1a7b069cc7a6dedabe8d7d7e5e9e57e7f52ea6ecf3e658edfbb72a0130ea3231926b2feb798b6b8ab1f0df20f2df61a2e5d7dacec0edb63df1e79794f9c0c0ce8e797e3d776e3db587f5aef678cadd213f73af5dd1e72ef8d8472de664971e7d936b32ca730ff09028257c39f77f8ec5cdc3effb4447ae881ced33d96940e5bbcd2eb4bb7bd3afb14c04a7f32d023ab98933ba7992f3107743fd17befdbfc724269909f7e46fcf233c978c065edc7b4665df0b161985dd44b6c3f9af3dbf6bdc259507c52e75dabc46174474fc5cfb85387e74b46ffb8bf048dd781d25bf840619c737304214b642a4d2e37926eee6f53ddba2aef164b6cfbc904e3d3bb9faf657dcfb1b78a901b3f0690564e83ff1edff352661d0ca3204e9c37d106d499ff4c606f3fef02b67d766b220d2c2836bd332f8fa38036bb537c8ce43a265d9310b83e5f3ae7df7e8be78dee1d34ed35f1fde70e7e3150ebc43904559ec1859b25fdabadda1aeb994030f1c7ee3ac6f56d6755adf9e1a6731d6028dce03f6ff354ce2d7d0a5dff5c6eebbd408e7c092c39e86b95e5139e83bda5b39b3bd1d35f4809e64a93777d7eecae1dce5ad43d7336cffdd490a60477634d5a77bff168b76f874723e52fbd89121421ae18eccec949d0fdb5d87ba675d821788aa5e5aa6e8a6ee4bf4069ae91d4dd0a9a18ff945f95369bc765b46fcdfc2247a4946a4ea7800aee9efc6e48c9a2f3a63c3fc58b4d52e6f6b974fb595b31b3a33eacd277b0ddc4d069e847281875d770e05b010a05b648f73bb57c91dedfc300a7fdaa3fee391bc3aab48cb5048784296fb9eff961559e9f078af525665970c22c8ac71e6f86efbbdfb9a1c5bb675346d3a2ac06e217a779b3ddd9e0fd29ea99393b93f4e423afe0d4cae2741e55f9d5bf2799c63cc8b3107f39619e38e9e3c4b792c70476536ced88ccb26198faf980919e9a3cb246fe5161079dbd186d46472e7cda333f9e3893ebf3642da59e1eea133e9fbc1e74d04dd6c9a2919c4a7d93c5b646aa6653a3df786705788ab1ef946cf0ac50c6b2fa9ef02b73b7c257b4fe35ff746fc3e269fce38b90e47caccccca96d92a5b3fef2302190d8f6476b1e1f69d3958a49b672971e4086bb2c9b6d94bf69a75b26ed6cbfa19e143d95b368cdeb2d11141bce0e26a147c32f5364466ff2522fb849cbd01ca179f9e5f07d5a6908d1cb4432eda230ff987d981f76867f9a893d8dcb513d7c77dccf74f06e800542144118ad17ba681c26f7548fc0e26548bc93b59710c94a2133aa30ce1ff3294a30295f4b536046bf87a2c89b75f03c37551d59e0562db478d46e8826ad420068d118b3834413cba5e1d09480c674842b28f91c45d596f76107fb13ffa9f069aba43bc4f36f0e87bd60c296896e9688e1648451ad291814c64a1257d40abe32894d1fa2c9e17e705bd79b73b0a7f7283b6e805bda20eeaa21eeaa3017ad7491f6fff342631db62b25fdd9ed51ba121e0d14723081929186066f21dca7237dfb7dda88eb1dfe444ea8ec80eec8bebe25d7db99f1df30071f9213fe6611e21358ff3244ff3537eceb31c21e536cb90011b96634dd9f78fa51f7fb5ee3fd192e141775ef754b80e0dd060e2b1f091d5799e17799957f925aff3266790918f7336e7f2095dfafa4171fdb49ff3adc7bb0d304c42becbc55ccae57c9a2bf92c9f239483bee72a2ccebfecdafe5f61827b98603e466ee616d9ed67a063becc57f93adfe45b7852397fc95fe15f9dbc9bf7f2feb5cb7a14ccbd20b8da309b721d6a78a6f241fe062b31cc47798db482ce99822aec3c2d9c6287cce2be6f242c7634d61460c4c8a3fdf5bfc3c48d81f315fe0ef81f3cfba1a2dc628ff78d155ee12326bf14016052178702dc5b111571911469712a7025857f6f278bac40f9bac8091ad751e4455194f404d6a357601b52fd154c40478a0b3c418d9fb8680a26a78b71c116dce349417e36c504bdc0bb6ef3eac5e90d95233a4c0a21d30b311f175221e33521a84cf3a65060cc8a79b1281e672facf747f715e7689c0eb02fe3a335f9f9386fc9bed226f00a8db20bbd300ab3b08a65b12ad644476e63546c082adbe2a57805b9e814ef4e782b7a080102cfb3c4987045bf18d07cf10673c556e1db7d2cbf87495016a3bc5792dd272555dab0feecfb2725638346a593f7507a95763e09a941e0256fa9884f972877a55beeb18e941e4ce4b136041d64947e199487f288bb6220b67648c70ac9b427afbf8e8837c29da58771529ec5748877ef95611995719994e9fbbb82ae2880caae3c012a6494e7a72b69650636e0f32ca7b95d82ff2b735811ccd4ff02efa2f02e4ab52ce1092a7c6a4e79f9a0210f0962f339d8de5e79f7cabeb1b343fd20d0ddb22919c497e392c508941c1913bc46a5775d1f50c79c29f99230053b0eaee733e1682e947f9d7b057eeb87bc7ec2b6af9462299572396d6dd67b5928d3822a9572461099674f7534f023eb2f67c98117edc355173053acd9df44e47730093db83f96995ea93bc089e089be78d2d67e95460956b6247e07d7fee07f95561da35c96ab725d6ecab45d898ff27a97db208f32b2d73b30a801d92b45f2503bbf65d1bf3016e51667306d3f3cb8e01fca97f2b5ece449d905affee97e655af6c0bf251893b29f3d9d2db45fe56e39f81a93f2ad1cc29c46e85cd17f474f2a620f4a1dace7db7e58d995f3234c0ab6da552ed8ae1c57d3493d9670dc6a5f790f447e3e2abfbc566e8f7b1f67cd4ee42495cde9fc631caaa03a54c72aac2278beb83d3b027b1388e1f92aa9d2ac5f9dcae9e77b21ad3a575985aabc2a8a6df52e22aeaa7cf5a57d6ef5a4172caa4b5557b85af0ed3ce56f60c280d42eaa71deab58882eca670ef2e1595f72b1e2e07d93eae90cbf4aa8c44a2a7695fc4b984cefd28ac29eb3b876418257713f65be2aa582a8bc9a578b4aadb44aaf8ccaac2ccc0b6c278c0e1e3cad522dab15306ea650bed012b65ae709a051549be2357f97b9abb66087bf96bd69054ca67aad3af067f7eff8f81433d439c41ebdaa47f3f9e2c7962b97aa1788527a55ff71ca4735a8deaa61858aa81ae5c71fd9acdbb8d097a775f1e91de5db6de7961bee8ff43b5674b12fce65077fbb977db5b87817ff125c0ea4da3bf09d701dbb34ba1c2f98572d201afa6c2795627e896efefdf23e0652510e11c90fe67949f2de252d29f8136709fe02178e31d7d2f23ec1045dce3fc444be6417847957debbed2ebb403070e33497f2527d65d3df6172b9607e802e4d49726cfec619b5f60b67312ff7536fcfc1657c612f5ca55c2617b6522ffc45b88817e922933ea04560a5889e5fa61705ee3b2ba8cff705ae71845825b93fddbb73ea2e0bd487a8e407161abd021aea4503cf39fa3b7a8263c6402b78780e9dea5c8c1f59ae22473dccbae07dd7d3702ed665796799b33cbeaccaf4b2be6c6e4cebab51b2972d9a5c5e2eaf970ecea95dba8ee2dcf6e09e2f57fb75e95f0697fde50d7e1ac24fa39aaef49aaaeddab14ffb9db74c063bd2595cefe0ce71217dd44fe0de9bdacdc710a792a7c35bb69e31a9fddcf99207df31a983fa501f6bd2e5ff5730a91cbd8ee039625aabe31f69749de42b843026b9dbe6248b139a5ce79ce6e3725d9fea739dd5a8ce6f2b93377551b21f57ac4ce17de071cb255202c30bdc97db4eb68cc17d2475050ab5bfecebda9bd74da5d64c3daed99aab27f82c5ed7092ccfaaf95ac80739aa507e78172712ab554e6bf1a123b554bf3fd783aa2106015bfc83992288d56aa59ed5f37af1d7f4a4f446b50acfa17923b0615f3e69add746e5b696abbeeea5afad7a79c3a4d59522aa57f5ba0606566fc1e34765af588365b97c8c20f3a87ea95feb4edd45ca61eef9c7fa965b0ede905cf730228049bf1e8096b0f55b3dac47f412d76bdc620744a8a1b3baa11abb71721c7fb0ef30690a8856f298c4ef6434bbec5d7f1fd5a9c6a8f7750c863129c08ee756031e365bff353da19a7de3e5bdc6a705f4f203ceb529df7066058fe6ce609a43736c7129a576fe152a95ca6fc2262ad64d5caed1be8cabf5875503496e9226c5feb73935e7264be8470d325aa1b70635798bcb65d0144dd954fbb5b3c46731ef693b682efba0a9b1652a5df0ef97e758117ebee487a6b959ad022c65f3e17476f09ebd66fc43bf8975a8d7b00d30cc0647b287efaeeb6f6112d165c3634cf62be0555fdad86ad7089873114cc4276fd9d4afc86ba49cbd4b658391a8d0a58415837fe7e326fccc924bb6919b29dac3fb954ba79935f3478f65ba6d168dda688dde1817b6311bebb4f6f6fb1d3e21317a3ba266d9ac9a35322bd46c9aed7b160c9e648e9e10a997cdcb7b4440925ed1f9eb18be95bff20de6d8a145f8139860dcf92b98806d6ff05af74bad287eeedfe15d83af2a8359e72e9766bb22b7bf9bb766f8514faea88c80ab026e0ccd508ccd388f4a32b30b5e4e5bc665f68c87cf38f33c6793486e2758461a039253bf540899795a26ccbb7c4a11e0c8bdca1ede9d397c7ed6fdaad499e30ff544c981053361a95575ad529dbf1133b698143d2662e2e3107de14f0a96498afed5bff798f4f32c698a3965db1b2ac5cbfd27b065c50e24f7ebb8a529364d942720f11e73663206eddd54b9ee5171993cd851ebe8c214ce9c9cb45f38cb404f4fe91b5332d567bb059e3dc519c74b89f1ba3fc1e9cba7bd30f58f31619ad2292f81c63030dbf1f73bc07e0b13f028f5826151cc70b9f89596300deab7884014f383ee446672636155c9f08cc08885834c462aecafa316a4951ed81df03be071102333534661668f1e4b660e63c1a88cc6e876eeacf1e9a21072188cc95880c809198080f28c2fb37cb65a444b565fd7da9975b5fb3126a85b3a8d4723cc7b2e298d76d2dfc1e4b2a826cc86d97e66ed055b1a0f2dc9fbef6bf3ef66fac2bc9295e8305da6d79c993e33f8ca97dc30c1da03ff87cc5ba930436634a6c79443f65a8fedb133de8dddf17eec8dfd71303e8c8fe1e688b2e1381c4758fb5053d8ef2c22b08ad27d8f48b51affa082d9f498e6e7988c131a9574de1ba7784fcb5fc0046cd7f8540ec7e7aafa5ce1c937a837ce6e5a52ffe42c44b080e731cab639e90f1ae7e50ccbf28ff32d0f54909aa7e3a2de8dcb7135be8ceb713366c6e3314baec38d27637e2cc412d51f8b63a95903ab6aca5e5dbc67d7b8fefe8c48b11dcb3f7aceb2c8573f8a4f60c6e04fc6539a2fcbaa266776aeff12260a3a8f671f3129b85a0786e2dc1997773b9fe7c7633c1f2f083aea586bc23cfc5cd5f810ab90156d226650c4639d9e8c8db139b6c6cbf16abc1e6fe07adbf1cbf8750c51ffb83bee150e30e855613f23d2c6a1c57adc2f67c0b3d2f18020f2361efee819815fa21fe75600afde7844f32c5d0e038de6d86f4628bf6bbb589b75d81deb7e901eb918e79d5b5c02efd8ff13220f3bc67aac8f8c9cf98a737d4405fcc2b1588145e258d043f6c01ed9908dd8984df02e2336654f2cc9e5b3197812e583d5ba7a785c5dbe94f9291fb088056afef3ae2d14fd90796db0efacc634624b94071afb77eaf1a027b951d5ec0505a017f05c6ccdd6e0dbd95c421db669a377c084f9353cf0c86a76ccb2cdee128155f9876c3159539ae598013b29972ccf0aacc84aaccc4e0fd52e017955d8194b7288ec02e29ee8631618d8020b0ccc460c66d64d5a77b3c13f3d1f6b83287e61bdc04ecceb79de43e7e08431a1355665b53f8dc98e74f8545d744621abb7b68b350013963573b1726f76eb62a2cdafe101926ab1cb729ebdb22bd4b0ebe28b7ad317bcd8ce5396dc81ddb22fec2bdb69bb84d82edb63fbec60575da6ec5b11b14fd10ecea895d3660bfee8c048e8eee3d91f9e187e1b1cfd7566b8e0500fcb60e9305cd5ab26c068bebdd7f1fb9838e47cca52e528cebea46ded0deb086b32cd05ddf9562fffc5de926cc03988c731633eced3cae7769c4b2af30db7ff99050336b0a3a9f68479cee37cdc998fafe75a5cc01dcecbc32a1be76cb92eecfb759a0bdd0c21ee544a17e2a07bccca1db3afbf81f03d2a613eff2ae7d58c5b2964c65cc4e1ddad8876ff34265ade6282cec5a8e8b5b203c86c98864b1e88d48fbdb73fb709285bb41915d470e965955fb81377e632f01754218127fe81c707cc2e1c423b2e470a57d8abdd862b6d731752bedd3d2ff713aec25ac35dda2c7039c96b6e5f6c2e51f3f640030faee69aec97bed32799724cbef98c4969b4fe93a35926c7d95614fe714c286221b831ce2454aff96b1b25e673605b0f44d4e21ff6b1dda58fe53888165f8a1da04083956998809b703c275c4a4049fcaa467b654e6cb36d420ee4839338f9501f45fccd4bf6e61871538c75ed710a37bbacf015b087aa8b628ddc273c5eb839b7404ad6e5d442fd956fc3e5b4dcce3fe75c376c43e61c363c8ae05dfa773b577ea36f85441c9c817b243813f772146c9de4f68d6de17e96cbaf7695dc666b714ba68f7b54cb5ee5172be4321558953d527fcac21a6ed5caf86ee8b1f8dbb03cdec57ff788455c675ae53f2250d0b945d35ced15cff0ec86db3407eefa6fee255b70afdc17df0df2188e01f6cbfed8bd022c87701aae9b2f9a7617df3733c3bfd1574fb2741c5e7d93eb932ab55ced1e310937b8fcea6e04c4bc706fdc901ba1057799d00d55c6795244132a2755f1725df67e5e1d668b5a98906ff8a376017f9476f1c4f126931d4d4ddcc9beec95e9c4bb7559962997e663bcfe8d02f75dd4dd89ff5c35c063124cbec8413ea3921b9363693c33b082ad883432dc24bce0bacb21fee66eaedfe05df85c34942f3026c7e124ba61d2326074fc712ee5e3c80693b8f5b210c19bb7bc30b053bb5027c92485a8fe47d948327007c5e43421918823523bf26d8087dd6892d1a8a1f066a47232c1554c5cbd4cc1bf87a41af05a1e26799bf7c477ac36d5ea61cf26bfb0e7a8e150846380b29c946d1c5f3ae84c77d1f1825946497df344afef63824fcbde0f993548069b191cd566b850d6f42615a7fdbb4edec985dd4ceaece5d9ebe291f526cd84a9b2c2067635feaacbe41aa56cf2e364fcc595d184d8bccb863b4fb882aacfa55c84a86106ef72c04fa35997fdf270f9e77d1493cc2835479a4c26bc633806ea804cce51560e1d898b10c9974dbeb95bfb376c574aaaa1ad2f0fc7a31c57da36935bdd6a520cabcee7ced1fc3c91f26b648694890cecf3feadee93e9446998c96c329f2c26ea842d9c09e8da44e79613a3da4fcc66f8635d01eb644d961cc44c6573b976c730a7c98a25b914606d2168c73a1f57e8231af5b25c4dd6934d294cb613b3b8f7f04d5e26aff02f74636393cea43be94d88a728b5c980a3d0b9565149e688302697ac9ea37c3fe40613b20fc5fdf331e39846be81c2bc3719221990c156f5a5225dd593d145e3eceadd4eae7cc0d33cc5dbbcc3eff0bf7997dff31eeff3017fe08f7cc8477c5cfa48c907f9391bb0884f32fdb6f364e2669b62fdb9d7fa997db12b3ee54f8c05de9c9c0c9ee9b5556ef873cb98f9acca3016f592477cce17f5b288795c1b985c3e3143bee22f7ccd374000c63ccb733c912c9ee70578daabccf1122fe73ba6ceb7cd787ce2a73862012b81aab16394e53573f1c76346f2cdbb68c2e39e536f94ef5a8e5ef43283571a8f9f31db0f339df30b5ee5355ee70d2c75bcc95bfc12c68a5ff31b7ecbbff0af7c87eff23dbecf0ff8377ec85fa36a4e1168b4af4fc09eba79f4b99fe593255b099460e7e5e4396e8ff2037f169c6c4cf227281b34abd2cfe69c5adf7bf39122ec0457d80b1edc7f23f842201cf8a570e45ff2b310f2062f08d1a36bc2d1912cc4c5a58eaa2d17112f3f462f28a73ab9d9eac9773b577ea3e70ef7b92321c1b9d0fd2a77da0a028a845438715aa0b9a7e01d1316ce42262021170aa1847f55c245a8854660e0df6381152e307b4e9808307141e435411264fe45b85aa1e62c2888cb933cce0fec3067f2104730dc1e67ed9106f17903a219e40dc94b06f835883a1f913ea9240a337499d8c25c58080afca90a1a5b4c2ee5319f4cc85d045d30f8ad600a96b01456f0a46b78b20d3cdf567881dfbe0a1d784a12e7bba789886d769909bdd62ee47a8b49be14c0b609837ada62fc5730a18437d6a9556f845adba508fdf67cc452134ec2bb085e18893441a111a95ae06dd1c63f5f472d3a64fe8090b8135d712f7aa22fc8e253d545b0c503ee65cd13d48810dd83ce1c9b6d75aecec0ac6cf8f7064602914d0a083cd511217e3f16eb226c92d2cdc7a58bf6cd5a0cc5281b4094d814a9188b099f8829ff229ec4b398c17334cf4344620e32711036fce6e65b8205da8a05a9e3d9c1899e5cbbdbd62813125a2b18447aee7ebe8ffebfc0a4dd895dd19361de8738e9b5c584271232991465f9814d8a25af5f31a9c40bac40fd7eeed7c1c09a6c00a34664c4b1c88a1c6604f9a064b861e98b13911705d2dba2404469e48762878cfa849a3cae46b50bf1fca4983ddbb6922d3605552c2e912836517de6d266c79cd8409444b9ee8a7cb1cdc1068b53b09daaa8806e301f9f489c89737101facd88cff116cfbaa2466c43a760ae99611aec784cabc044dbaceb9f8f19c9cee4aa7b31ab2df8f86b0648047b5bbd16234ec3baf20e930b588682ccd2104dde031bf12526a245247523e480ca525c092fe21a3ebd81488eca33712bbe88af62a742e509ed81d39ecab5d8454d95351bb187a3c3cf513e1ec5b49802476044884ac43ee2c5415337e7b15c2480f41b700d556045f4f979c4a1389268890269da48365d490eae77378190e64633199fa4ddbd6b82f4d54f8e1788d8a47607e6373b577e039336b74203272cf3fd6da703db487bf42a798e5164cce5fdb7654a7eab2752201da4a3147eb412ed90222986918843291519e924aea4b394e503e9963374b8b9944b05772c12a96cd6792a55a84146292315ecd8bb78bf080a8564cf5a3f9f889174a997382acd1166d945cc16520da89fa406fcc6574fc34810f7482cb6aa7c57e2a4c93ec63d45a011fd2297804a0665ab2f8fcc3060d2ee3effe6aea0dfd59372540eeb0858d7a347625ae05d3442d5631deedde94d92284964a6a2244b534969b5e60bd9b4a499349716922a69922ef0c0d5b612d82fc9b8c514922959d2321fd442369056d25ada48db629d3337b6dcfaf53c82987d5bf620a2bc482fd26b6de56f528791d05eeaf249b3e20ba997e9521f68052f0dbe7e16612dbd4943f0f88d34926999926dd989f7179ce52bc0a100abaff87b1fdee6d6a583ad04c45ddf3cdde3373021b15eb6ae26f014cb667cab29b0661d02471ee06793ddc34cde1fd483247bf8dbcd641feb861c00b3e4e5c357b6e266c1405b0015f92887b01eace0cb911ccb899c164911df90914f45229fb3be9cd5a7262a37d5f9b226d5aaf442033e9b266487cd10a9c5a6f2994aec1736dec77001859abc146711028cc98becf35bb9003ff2a327b9c8a55c61e91133f922d772931aae5fe6e8a5360a0e9d658644cbef325e792fc3b9fae02f60d29e7421483caeae71495bfdc5eca3ead4d37c573ab9eb1b3efe0692149f6e29830d90593c3b3990397922f33fd2939bb6c882341787c0c432591457b2245e702428cbf2f4a977725f2acd263f40940efa30e1009795acc833c4142168cfa6d81561316f23fdb25b84cc803fcbf366c5589597d559575ec82a70f14f9efd3678585d59c3bf9775ba920dd90c3cd962b88abbed0d62eb270b31c1d93eb9fdc6a6324afe382624fe750cccd45126af9e2aa233881d0b601fa01949d076c2c96b0f98b1bcc13880646ea5b3fcf2734c880d03df023ebf000b66f282fc2a77688a994a79a6b57dc6b8f71773636414216210c3a7f9a1e561a5522a988be571294f388c0852718fde642ed8c519e79be52e8be41ed8ad8ef03503244306eb2b835d93dfe4a13c9ad2f8bb44a6d47e88b262fc11135801879f71c68478d1dd98cefe3426b1d79e9354d6e85c3a17f454e599e5f37c89f7c347f4d4be9e4ce6e2b3f6a70e9e3fbf99ee78ef9f316971014c1869241cc0c28853575a4ef7a284146e937353af45050fccc22e254495c9a59cfa6404d3c3f4380d217a848812d7b19a6391ca1cae3117db69c459d398f7e542fce9fd796032d34460a6692d4c4fd3f334034cc06a8f93d2f8a02524669c62eb71dbb5f9c77d7cbc6ead17921b8e09d1eb63372c58b155e954939deb1da645bb97ca19d26005a62599e9765a4d2f10aeffd89f7cf02e385e11c67230ada7cd94998e1b059ff7c1a2292b0e70dda3cdf0637cf09f4c556da6dc7432e5a7c2549c4a85dd6c9a664271105f4ce5e914773a4e95e96c3a074ea7ffd86e114c0e7c325d08c55485bfb52939157d0a5131c3b67af20e93bc28f0eed2a26a3aedb93f7f1a13ed7e6e9763a0726adef7fdce8087ecf21e0bbf95f7b6d36232b56c668a7316648da7abe91ae4fe17f4e4a62d388e041b36103ad3cd743b7d9950e2016cd83cd3274673c81692f99ce99fbe4e3bd3eeb437ed4f077286ab8acd0ee7dfa76f8c457e0f76743a026b28fed33328349f28948814bb161447d9614c14d791c0934b9f3061d12b0bb28277fe2ab8a3ad8ce33f8e499b8be2140fe5a87beba9c925f44aea5a20298aef28d7d3ec1cef30e9288172c098c803e52804a2f3eb98483189661888efcff82b7ea77b25be844aa2a4ca4939a30b736e564aa620c9e2e131983e1892a1528a83361bcf21664a23b628c8be38a5522e4aad3457bef5533d11836c2e04a0a76785a1cbe3a93da7bed440ea361f31c967d50bcebc72114824ce7d7fb3ebeefb98246e7baa9a24607f72db355eeba8d3f64828c0b3b24861db531c77fed1ca070a8731012c5c65f26f3021dc78265a04954c2e143eeb2a82223eea82f24991c47ea629b2325514ae2977635d9941ecef2b7359e6215acffa6d4d713c50168aca6f051f5836f37344408b7461a46860c35e91e2eb14390136dc16158e4e3e7549ccf255b67624dc57cfe24af437bff1ec377817d192fdb0d6d89da2a36bbe2b7fe5929c749f15439a8fa76e7bd265a8188aa958ca92cc9495446535adff613d3ea0a2ac811b4744ae91b251401e9517e5f5ab5a615bc32d25a5c371f8f4094e15e876a75e7344d4a551ba4a4f3095fed7798477966b4053bc497e7aa3a923d39ea6a40cebe0cbfdbf5b8432a320b13c0afe1e2654a72c4bccbe2e37cb854ff120a710c934158eddd716133b8d6c6534a3f1fc6694442b2be1f22f10c16323cd6401eb8ae8cc6c7e2bbe612fcfc89f31417c5ecc9c429c81fd98b9c86bf198edc7487ce113b99a79bc3af37fc6806f6316e483990dfa5ccc0ec7a4b9b498b8e7dc78e634f7217121e934c2797ced6fe4201d7242e8ce9d1d67f02497731bc79783f65ca8bc378b68348bafdfae7b8a6d3b14a7b384c8dc727698a5d23f58f2af5051d6570b560bcbd96976ae5f5934cb66a859cff259312bd96c56cd2e8a02d20dd64a70263376d2ea47a64d20e2ac05e98d7fe1055e17b35fb93bcf0b21ae6ccd6a3e9935e49477af8de3bfea85641a0eec353ae04e6eaa4373ce1fced5cf185cfbc559798e1acf60b687f6190b9669da0e2fd093329839abebb928361266e36b0e63cc8733f696b9ff7703472be4a71ab87131e36693cbf4d2c9cf3439a170c6e3dabda0954ce5b1d7dd5fdc7626c8c0cf047d26ce40d500114db07e8df3c97436576c5e984de1da0a8e4d026f368bcf287ddfc78d3d7dad5fcef8d43c1c43b3f85bbba2ef7eebc37731a1f8363a199f58a7c1bd6deb3a69ad5731c6313cf8137835466ea73dcb7a36778cd94209486d04c1faa833ed07793ff0e7e2731e1fa293bb4c3fc936b660338ddfcef499d1d69a66e6cc82b8f065b62c5e67abd97ab6996d672ff27cf63aeb28037e0b6890219ec186feb39660ff7fac8559173081b9ccfaf86c74c064e0eb75fcd0128c0797084971ade0e153e6aadef723c6dff727e4149e0b8e51ea10a555af608bbcb55ecc187bc5f61b79ecd25f804f5e091d882f6aa1337b9b0dc5d36cf4c54a14ca724ecf29bc26735b229561f804c2fe584462ad2c1f6c4d1a8974bbcab3ee9c9cd9c127f960fa76e9b0d773a74573be9bbbf3fd0d0d82c84a38ccbd7fc082211ad908b97498fbbc300f68343f604c3c6b7e0c4e17f440641e0afde0e91ba5f0a940f3e8fb4cf8f7eb27b81e9f3dceca9ce40270440ab361bcc3e11cef683b77477b5a76e88558892758950dcc319e27bc202c092f7ee65f8570e0355e93f4590211f6719e0a07f10cef34494d760cebe90be3abcd63845ce888abeb5abfcc4fa2311d4d4712353f0312d91ccdc1e83fa3d10ec16c11fe9207834480a74a48257e332fe7d574343fe3ab4bf29c78f8794d75d0f1b14b9ead27114684e11a16fb75ae5bd5d73370be99edfa7d4cf245396c2b570c57d9f85c74ce8627ee82f660862efa0bdbb6a9d8f0acc37cdedcd665ce48f57c2c1c7077842c4afa9c2535df4258b66b3cd3049f57e7dc7cc26fda57a413bc770cb64a10fc39aff4952560d611e9f9a735ff87b11115c012f44d98cc45900a048c23992580399ad94207244205dc3be071acb9248573793ec59f9b74e64a6aa47b5aad67f9f25655c5760b9f6937cd518ecf5ac16740935d50388aff0b7bb169d277c8c4e324d0f0e9ae3995cb688b9faa36706d8733b1269fdf5afe38cdb2dd7c76c7649e0fe60b3cffab350966781de0c7f72b281d79fff6b3ac0abc4ce45e3c892b408a7cf6fae72f0f712507441b7cde07c45fc515e00c63a6ddafb8e15f616cb03ec393aa738dfcad07c6e91c1845c3440f1e3c0f6b35288345f9862300cec6fbd6dabad1f7b35dbf7d363a2af839e953a92a92ef7a999bfb157a298ad2697ddedcba9ef6bea13af325cc8d48bdc8896ff3f563bd3f8d57f2a72f1da5e37c03ab77f508b393fcf693157fbd7e4e986f7ff41e6cfb202eefb4d7ff752ce7f8a48f3eadd52658e5ee0d11f8d3c88cf96bad63299c7760be5dbc7f8ed457ff929ec03af72ea49b1395ed735e4067e67d7c86da9c74a046454ab7df35426bfc88dfccc99aca6ff3f163a57f3a7c326e2b339c8f16f43f7cc25850f2567e7dffeac296b585c3631ebc12d68bdd4fafb0f9fcda8248fe629fe3b34ab6188d8557d20b9fd61a7c82c6065b6b60c013698f770be20a0aa7ff054cf07752188ba024de9dbd9eaf5030b4b63840546fb667b7fbbacd9113f8691f77abbc809ebcfe743d7e2eadeae228aee5e867ef594004bb88481cf2782d9686928c31c1dd10c01abe58f59f0f897416a0a0a2cb05eb2e92aa2935f45635cc05d757dbee88a26e79681b07fc152edce0be6094cba43796b9dc98c8227db7d7495b9cce22e6908b73365f64dfc7e3baba6836956871bec879fbfa9acdf3adcdc763262f0a5c197cf799521a4e3a0b7b51cd8618956fddf792434408f3dd28fb5c43313a41647cade22d6a7cc21dde5fb01f5e486685d8886f7f53f66ff6410a12dfeec52a1f6745cd2ab6e92a7b47c7673bd3283ae36f990d3c7a4b23e5b337f01fd669715934bcf90fab837df3586994ba16a6bb05032b3d86187d7ac365c1121bc3ddde2f948b09c8020f7f0bd391309aff8813388bea1f50111712e6b979e77df6b1e0404b48261cef705824f8a7858cbf3bf2cf63a2e5103d9741d69e10b19842b4c8821e4bc0ba46243ec92597ecc6950fe4747a7cfaf542f930737f315bcc178b85bac8171a6f8ae6425f188bd993f725fc08de455e5b980b6b71656f8ba5743f83a306f958ac16d162bdd8b47db053173eb39db1128d3b95172f62be785d7478e707eb0def53265fffeea657f3d93e58600f9ee5e40cf88283587e0af8ccc97724c07cb117411b8cdba247a3ef66bb7e4b4f36cf364af2f07780e41d8870bbb7b30a481501d1dd7001d1891ea7f84482e94e7c9b1d16fdc518eccf60f1b6184e247205a4d4b0a22395162f2ac5f7ae8899aaad3aea4e7581b70226ea5ef5545f0dd4837a54c3f7bdafef06520435cacf37c4b2b97859508fec0abf058e7bffd734c1f64e8daffff6807f7c42464d64964602e990024e59542fc0fdc5f20dbdb63a528deb19f1386f388ee77adfcfd4ff0e26eabbf3b8b86ee3a1ec81066684ea493de36f17b099a8a67fedbb13af27744b4371ada88b50cd54b478ad05359f486a21c7b5f08b57f934d452ad160ccf2b94d29b967c280f654e8ed58b5aab8d4a3c623e50c72218a829e89fa2c2fb59b086cee245e5d4091f724aebe3736321335b8eae0f2a9f2f16092a254115986d76df9796ad9b3ea99e94aaf8a731397cdc1b8b548989aa0937104ed9ba6aea9fc9f15f1cef77c13fbeefe6f3c0bb92f87ff1cd8f1f872aff694c6e9d90cf839c9ef00b3bccffbf187fe72cdbc3af7de31c19bc8fd4a9aaa83315828cafde41e1fc18de5e67ff2f564455554dd5554335d5afbe89fccb41d9ee264bb3d4ddfc4f9ee1af9c4ba4e554fd111577a32ed50f67759d034062ad6ed4adfaa2beaa1db5eb7fd4251ed0eaa97d75a0bea94375a4d19f5685d728cdd61c6da7b9da1e3ecfd39f57e13a344ff3b5403b68472dd4222dd67677a42c2dd152f8ffa49d55edf91a94ad651aa269add04aad5287da45abe18e4df013dbf60fe32ff878a229d7fb7b738d51d75aa58d3556e3b489f6f46de2344ef1099aa8499aac4d35459b6973ed9da6c07aa89aa6e99aa199f07b4b5b6a2bedc37907da5adbc03b96b0c65bed05ee526abe3ad05eb5cec7f35cb4aebad57a5a5f1b686f703f03ee3c6c65401bc19d973a0dd79969a24e69fbdbd3fbac6e93eb87baa3ef7457dfeb9eeec355367aa01fdcfbb94a9aab1ff550dde8911eeb899eea27cd7d20ab35fa59cff463d6b29fbf10333e30d1919ec37cfa309f42dfc3aa4a7af9d015986f052b70d16bbdd1197d0c6bbad1d9e755d439c04cd2273a0fef10b437f849d456ea132a3ed225cdd00b6daacbfa5457f4993e87fbf4755a5fe8aaae3d70d90fb521607684f7e9baa1638c23b81fb15ffa123eb182cfbaa03f18959b55e3f5352024e93bb8b700cfb881cf9afa561be80e689ba8bff86c8b9dfeaa77609673bdabf7f48966ea7db8f6c09bb792a5bf01fe11bc7f48502ce9f39fc784ecfc8535574d78d29141c38ac27f209da6c619f7f5346c0366066ba11b3b182ee88b683c9d7bc7f60c9049c3d71bf2fb9d6ec07b2c58d727fb66e015eb1a01fceefa1e5839c138003e13b836651c6f3eca08414f0f703581bc4fd75706ac920111b6911829bc1f23251827bc76c6b995712d3332b8fefcf604b7813185ebebf0ce56cf1a23354ef09a61e4d7fb2bf8f746d1ca8d51c255fb7ac7a80cfc6de6d4ee9b9af27bdf214056a1361a901be33e13c160b417e378f319c618a4473182ebef69902dd1601f1a6f70604fbaed1a5eafa0eb35203737ee6c5a1f68267cd278bf6604bf035844583575e3cd415b786302689a067f7d6f0e5ae1c3fd2b9f3504b04a442e603d7b64a5c95e77756a48f0043b43fe787582ca48efc0e703630a4faa685b7dfcfc14f07b5e338c99ba84eb2cd417908f1a742bd2da5a3032e67f1c13bca20bb0ad1ddd7cb7a23b2d523b86da6a8936d17d90cf9b849b8606aba1df3051a7dac438dd11bbad34f62c2f5ad5be0bd6d30429d63faf19591519af3adccf024496c60a24bebebd177e3b2532b0d63ac606f031ae98b81813cd27d27dd47a608fcc2794073a73bf836b6ce19da2f10273798199f21f9e20305ec15a81c665a9d1d1fb607f6bd0d32e7972447febc495dfc80b17ad47357a46ff9dec3060ebb165c0b9511e38947e934ff2db06cfc178bb61a2a730e7b7279ba4e3f580f7fb20bb9431243667a4ddd7f38b71802b827730815798145cbb6f184fd753b097376dc3028ff1767d75a377c1ab89a643f3e60e3e8b57f286d614d8da56dfde9fd704e980abc32a53a66bee0dfa834ce8a017336d637adedcf4b53e68e8540bcdc06ccf35fa565debfb9898642fb66e9921d8ec774f6946181333067f3b326666f25e8bcc047e97b65e595d6a2c20c63c641ef0ed1932b60980d54c2b3076709508e4f56b44f0aa14c09044f3042b7c064b337d4839d61382490616b27fb34e80c94ac7b23fd4918940b667ed2788273b822f74b4875e0b84298a46e52333375e9fe772457147665b5036f0b10ed836e01eda8b798d11feb09e90534d54bc5eef644717cc0aec8ea807c04a0de3f56edbaf7300ff3a332f84c960bee39bf5ed77c00e307395f419f80113b08b74ca6c605e3b4dfa289fcfd60b182ff0060d81a4329afc6c07c92a87b062639305ef7cc32a079ebc8475b60c04dab8ba5b3a06ecced22cf4eae11f81b3c87836700dce88cdc947af03771f609dd3d87360f2f0c48e3ec6d264b69939b4fb46ceeb77cf2c30cfc6f683a5975bc9324513fb4ee5bdcd01c9ed6933a36b24f0d98389cce4b686b062bea69b32ccab07579481d1600b0816d29c6acb9f610296668bbd7ca0988a3630f277bf0fc0b6bc98605df4e94714cdb9b9d042e3999d001f3306a6aac977ddd55b8e863d8a9ec2ebc2a7fb2b840588c0de26c40ed698699bedd900c8fc4605f837f7fdf2203bc68755d75b5603f61bf8d393b77c87096665a609ebdfbdcf1eac0478ea10ac9963c8647db045b2705c60ccc06b3c4bffbb2b1aaeb9846b3aead25c3dd8c4fd7e32c41833905fe1e935606366a82e2072529e24ea807d87b9368117dc7dfed536615e62b0104b7e661a385f80f568638264181ae85d1feeb7bc72c66fecfdfdcdfe2e64be804df8b446ba0712b3fc8a2bc17a8057a569b05dbc6a6a983519f7b959e62be84e0764d7050b186164cdd0b88025ef5e6d06441e60e1de2032d01f7e1cec13ac82d95555a3fcc48b08f305e6c7bf7b06ccc6e666cf74e1199ff880de37fb4483ad1bb63709832719986f10e17f9e91d05a37fdd51cc2fb8ec01f0c8805aeb1ff776294dfec25e2cdd17b0f4f460e5c56066ff7057b8599efb59945fb4805de0adee681a7abf72dcab20d136cfd00e2e9b9d6b250884c2d075f4b37087b08354bc75ed8bcaeda1513782f6ded3e63827dfa23dabc3ec3d6dcebc0c321f27e7873125feaaf6dcc0492768b3aaf98a86fc6007480f974fdab77325796ab699a05f1aaafbda89b2bb3fc46a7c46fee8f87180d7cdaa75520f3fe92bbb67a62daee46cb601ed1934591b5b906bcdeccc1a69ff406fb5bbc16165e23e2875bce0663065611f8598bca1513fcfadab47ecccfde6b32f640d6de5c3c38365c0da23dcbbb6651a2568349b44530d12e96ffd916b7d284632e40cd346610affad8bfa8dd2b26df3873e5f730d90f4dfee13b7f655cfdc9da67b50bc83bff6439562a8924ad00304b8c8375c0b926b00947eb68ae88ed0a60ed039c5dc6b8e874cb98c063bf617f82231493f9154c8c9d15624cccb9fe76b7519835875a70cb036b8cdeea2666daad3f29ac08f477f3c59c04d0fd16b79915c35375b4179abe6232fca3989438c236c7ffbc0a24c374b8da026c7f6626b31f5ac9b32580797534726299959a5d58639cd32598181bf0f119f6f1c08ff786699d8c9175062b9799848de906ac30891aadc842b7b8f0ea1f76ef723606e1731803e297c1760d6eb68ed8caa5f59463d32b724fa1e57f201b272b074bf71526461b93c0bb5ef4da2a30265669b5272f9efe28260863625d3eb3d40f3e9fb16a88b53a20410cb1ed243ed90f21c29a3dbdcfc0fa4030b10d07f8b572c3c474b54e1b9f0017da1aa679fdce5260be3ed633b81bddc6da96a7769f98ad89bd0c483bc92c021a34ce5882b7dfb6bfb31a5535f9bb44c135acc67afa060a8bf002e2c10926d618b8ee977a42b469069af70211af09ef01db65dd327abb3f8a494030e13e45b682beb22677868bb3f306d16b1247b7b90853023de1f47bfc85bd8c79dd31612416af5ff41178ced6760dd53930b143bb928699dd7b33f4933e6aa5de343026aa623e4988596b92f906b8ede11974780a0b7caf0e9e0867110373a953d6de125abd02edad35c37c771a2ec488182f19c7370413d1f01eccfd132a0cf843522180e786d8c7bac58cdfd8abf5bbfe442bde6342e2b12d70dc6deb7f31bf249c4804191288dc99f0af33a0293d457102448fbd1b26e608f84fadaf5a1f6f0a960c58e0c852d64c5db2a6774956809b1ac4a62524ff31b2ee710cdc79ac6dc1c6cde1fe6fba42323518e1368b883d93662410bbba77eb23e92777a3aa5a06566aa11fcc1d9959d05e1b575bf41078c573dee66324c490ff6b787aca52899e7cebd482dfdba7053e7efc1ccde139188081d11827a2156d066fa39ac0fb4fc46792bcb015e9485bc14add6623eb4b9c01f3591f41342281864c711692c8a7662820e30d412ed1268f6aaca64274c1104c889e587bb05d774c802344eac2d2d50ea97f45e64acbcc19c4742679aea3d9f7e69671b35df04a68f2168e1997c0305e219654ae781b5799522de38109e8c31433f62ff4a5ab43bc6cb5f532f49db3897e0f13eba855cf3ebeb5013a65e81031f6c02e9cc05a6816ae2e401c83e708327bc1acd5b040f2aed9577d03f6e1a28eb44213e0dd2b58a92d442b573dd14f0602fd68754cb14cff5ea35407c03b19e2b12d621d171677cffde23cd42c4bbdb96a80a62cb58db50e140bee443e1180deac4057e9fb33608dee8235a5e17732c433c2958f5df3c266d7da0226f35bb6127c53074bcea73c05e1ce10e9b6fd7e391dfe514cc8d9e8d6cb870879ac49d6abd5313cb060471dc7e184cb00eb24d5209d786ea3d059ed70975183547b97da16fe3c80f731c026096dee16a4bf6bf5406a0926ba63f5ad6b5f9937375f71bc80b93066b63a651e2cfe96d1c4dc1a3c3c2235f4c5b5fe7181086840d61a30316d9ab7b2565761650f06ae2a0a201fef6dd281e42444b07417cbbc638273735bf0fdcaa7da64cb0938ab3d6bfc60bdfd514c48e5d794dee9c9066c4e640d01ab9189eb7b9b257dad0f6f098b69bd0df86d8dd18c27ab2703831ac10ad7fa1856952755e45b1cbf5f526dee0f63a2c31a5f2d5757d370c4477239b86e952e6db0f8d3bbeecd3591253e6ae96809c9f99f74ffea3f7025bd8088576aaf802b03f08a05f7c1f57a05de758bfc7175064b46df981a0f4c1ab0862fcb1df820f9436c4c72666ac76a9f325b7ee37b697e2f3e213529e33d26dad2247d40d6ded0dba81856a3a311ef0bb3efe2cce272bff460156e793ecc855c404537722307499b82fcc9b7f8d90a96fe3220be08cba0d8f25588590a58c3b7764509b3e370afc61d1306e2a097e7fe99fd505735abcd42c3e73acb83ba82cf60edcd2ddc0921691bf884ae1d8007f4e14e6fd74886d84563a535cb23c958e3eb1bdad19819239034e7834f693304fd65f8fd8afc6f60e2133d11defb13b05d07b5637ce8e804ef1112df8aab27385fb75c468f1a13ccbe6f32e6568f8d959169ac5e5982c1dc63e3c4dc5cf90160a2534bf29d09666339b042429bbdbab2edbd29df63405cedece98f1dc938bbb580abead75cf1522bcc06d712c8bf47102f7acb445f5ac632555fc0af6daf11edc1245e6d79ca52d36a2ba6580a0035ceb221e6ec7f98ff0c4727464f257961ff5ba7d9fe6eedd7349f732b787d20b6a074ee3d26cb739bd323192bcc90540d64f616d9c367fc25ae90f1de1cf3aefdd078d3bbb7ba8525aa6f6d5c406a191b6349f207f9ad624b565822eb869e7814e65d5b0d3fe3b5ca0c4c41076d24d7c178693e60d0bf6ab9ab19cb2b93d41168f800d7194825866e735996e123cdd78b16936581ade5b25435e2e71f712af819e20505adf57adfda8ffd7d4c6cd2296f8df4f73e8ef014f3ed1d263c445b6d46cfbc660b2f26c414b7bcb1f6a685167dbe9f830e12b9225d42515bdf5307edbc71cdd6b431ef32395db48a7be6b6f53c828f2cf321b5c026246bf77806608811e649b70e0c73b3ac9697ab4f93cd09cef5dfa351154735b76723ecefd5670ddc7976d34c7875591ba043777bf6f0f0a02716b6df88fec367aa4564573cd8e4d93b4c18e03b5be3dd77eaa9c0b5daf5bb567745032d2182b9e72902ec31ade86ee92ec453382d26eadc4caf9c0d6b4410284b06fcc0fc9eabc77d752fb80f82ed41cc73f7b978359763fdd6d1b4543b1a66b038aa9b112967f5439b1f2057ae01e5e8c61ecc6e9b8184dfb4be4a5c7270df09aeb65df3caa03d4b3a50b439bc76af36c33d4984bce471047cb168fbcf62d24628946df1ef990761a693e78e516bacd777d93de0f5b3c4a5d0c6e0571c6b90e9cbed334b512f4098fb6d07a9955a08d85c7ef7cd12d8461998d987ea89dab5eca5fc54b734316332af9918758eebb28413e0ea278d6b0056f4c0c49a684be3ca484c132cd7ea2a05d3b6b2bb9cee874be5deef413cb9b9f5e660a5ac7bdf4d0eb243de6d8e496fe41fffae8d5b67aa51bc671e587f8df4a98f9b5fce6e3327fd048089a1e8afedacafafbfe1f5bbf247ca82f8fc561301e9de01c35ddd62b5f735468ca7765d3575047e082ce79dcd91de3fd36e3b478d17d2bf601246dd253528531d2deff93152210e0ce299f52370dc518b09e691c4dafa9853ebde7526dbe51c4b0158cbbeded7e5e5e27ac753cb4b7495c8d71f3f53ed86897506bff6cc87757d0f51c4bd4b9bb09b7645f5b67b62a9aa2b88d6564f2bdbe0d9b43922ca261828ad1dd726d6d4649f6df63bfc0d83061b47aaff8600ab79061e2bdf7bb556d8cfa818135e7f0526d5bb5644f6d82a2e3588adb6774c78dcb96712ff03deefd2d655087b6b5719f46da969c76bce52c1ef5eea46629446a4e3ee4ee6a9de299a6fd691aee2cd5fc084f49599074d7b74cd9195371f328f6b54b7ea30bccb27f3937cb4340cffd16102ebe482eda8ac3de9f95a0126772b406a34a7cf992562591a78a7df6267d8a40fb66746574f80b3689db676acaac06f25b8e6e6c1332cd74a0ced1eb7d2cb0bbc46fa3e54f0e0574e77af9e580179b2655b1d008f44637b066c04b83d3c810caff0badbf23f6c07e86f9f72f77b98c4716b9b54dd78053e7bb3e35bd2dba0de3320fedd8fae5a995b9ae7c0ecdc626222ed81de23f604345e7b056bdec515266291700fb008d6f053372fe99a1f18db2b3b33b18e2d2de0ca8fbe3883f44e0c49ed5284759675dc754c625188a196cb25c448374c0cec21962b630af7eb195b13676d1862535bc95f133e23ea98b999a069383234cc5ea04034296a380b70c4757882c906c702cbf5dfc0e4d6c54df62a9880ca86e8afd15af7abb7c17d396dd59c6e7b6eb4b90136de30db1a20a9fd1df431cc1d5ba00178d28d8e31e85fab7bb016e610aeaec0bb1a905b9d54430458170534e2fa2e6dd26626f743cb00bb23b7792b401aa4dccc71bf31acac01de18acffb5e361a3ed975bdd6bf1c3551e2cf970bfc3120187e8902ccb4abb453e2fd83fea087c920b766b7e9de310df15d81b477a0466ad8e00563b1fd165f8cdd3ea7f179328c11916bc8eb866a5c910f3b6337eb956ec78b0d93eccdb20ab8ed7ef45c33563a48d8dbe5983d4f2e0a32720a3248b681460f97398b9dfd6b3b4f932c13b1df40ec99e4f00c72e5e2b90755c11595eb3e833eb9ebf5f82df30276dd60aa25946174dcb4896125935f1be6aa5aa5a5b6d632e41ee4d2c13d7daad6829107370a40b036745f5f65316c94ba82abcc7003f47b8a3e16857c66fa8166db6de0fcfa1a76106f9cdef74f87d4c6e1916233173f0eb628b87d15ddeba6547e01bfa06c4f6dab5a6a42dad36272341cce241546fc12c97d7ee4f6458e0694e8ff503ab883159c23c813741ec0d3840e4b72439d9eb7b4c5f7ddac9abae4c1f2c49673907ccfa70df170301f3ebdc9e8ee09c61f9d618d215d807b4fbb8824ed03555d5477af0408f0c4eedb7b334a4fbca9bcf7785c8283306e6485feb9ad6c14c2feefc3d4c6eec4b9d5a6b4bd15ed519dbbb3da98fccada6dd56c30ccd8e3a34b8360ab1b64647c3dd5a2f64357076bbb452bcc7547dc39fd1293350cd6b773aafa10fab745d195d328a8f3b0e97de72db5af5e5d6da598bb656a6a9aaa955cbeeb2a7ddacea72a9933d7dadbfe85afcb28f9f7d69ab4467af6bbfd2df8ce92d7232a6a660ba66be6cac9fef422dbf5337f9df61f2d8d5f879b03d233490952f29f83f7cbff3d00897033db74abd34d3e59b365a0e6fac40eb6a9996a9d3c7fbb56c29b711a43133913906afb1d4d7cbd13d1f53d1e39dbc1bb7b96af83cb5a29788ed39d24fd68d5757c0c9652b58b260f176f7bbf186650d3490b015b5b2b3b4ade1c21d6e3d2d3c19f827cc3cbf9a7dbe727e673dff1798fc9ff6ae60b7411886def719dbfd1dd06ebb31bac354a1494c4aaf25e902559aa8a50aeda4fe7b13475068419bd66abb4c3e2531b1623b26c436564d6caccf8db7f0b7f8dd355c420d15a28dc9d7fb3c92c3dbcdb47fc976ef4956f93cee4cb73c6974b28d354431384fbf15685f6691fb11e966a8cf7a0b1446900fcf22dc685ac6699574dae5af0e43614b4f1631b0fa69ede55bca84b8b187e1533e6542bf851e91b285543dce56f07f98229f426eddfa4f63419aa7568d25f6ec63fe485863f64162fdb0d3bd4ac71d5df09cda602d52876789428d44b7a7215f439ab42750de365f784cc2c77f54347f5246ec2cba149b72e05dc14a3d634b7dd5feb8b54cbe0236605fcb486bc7b538b786bc7130a4897615a94ee57548b20f61ef497c8a0962683ee369be18a1a5cc15a79ebf87df92c93f7c1fee0f4f7747a76cd03a pushButton11 clicked() tAboutDialog accept() madman-0.93/designer/auto_tag.ui0000644000175000001440000002677510053135242016432 0ustar akusers00000000000000 tAutoTagDialogBase tAutoTagDialogBase 0 0 673 431 Automatic tagging unnamed layout1 unnamed textLabel1 &Tagging method comboAlgorithm comboAlgorithm layout6 unnamed layout5 unnamed btnEditTag true image0 Edit highlighted tag btnRemoveTag true image1 Delete highlighted tag spacer2 Vertical Expanding 20 160 Tag true true listPreview AllColumns layout6 unnamed spacer1 Horizontal Expanding 86 20 btnPreview &Preview Alt+P btnApply false &Apply Alt+A btnClear Clear &list Alt+L btnClose &Close Alt+C 789c95d65953dc461007f0773ec516fde64ab5751f95ca03069bfb588c6d209587d18c048b390c2ce648e5bb67f4efd60496c55541de879f7b7a5a33ead1eefb77a3c3bdedd1bbf70bb753339dd8913d3537a377eeeee2e2f1cfbffef87b6131c946fe5f9c45a364f1b785c5f17464473b57976d0f361e14e10f26d8f517dcf48e9bfe826defa4ea2f781f6e7293487cb5775a15658ab8c1f82aadd234477cd2bbaeebc666f00fd8784bfc3bdcd6ad95f96fe0ce44b6869f820dbcd6db4426b152ff02ce4c6e3bf8545d3859df14ce833fc08529d51b70652a87cde233b57172bf0770ed2df16b75a3f10c36de29fc182ceb7b809b2a2ab1ffe4605b4599d4ff093be374fc8aba75057c1e2cfbb30577a6d3f86db0ecd7577113b9125e52c74ef6abe8dd44de988ff03c9a388b73ac874ec4439cd7d589b378bed8df26f1463dba0e96e7f33958c6633f9bb4bf10ff3458c7efc05993e9fd5daa7327fd7a07e74de9e4f91ec2858f637eaee0d2c7a57f9707b7b2bf1d5c55aec2fc34113795ceb739b88de1315c572ec37c742b0ee3bfa84d8b7e20f453639a5aebe5eaa6c57a8dd4b77ebcccbfa76e347f5d6d254e5db0ecd731ec061b523b31b5709bb585ccff51dcb4adf4d37630fa8518ee427ea56e5be9e76fea4ec7e37cdac85be62bc5366ad15f84f5dad81b71c2f3b289b7e49faae356fa6d459da86f82d14f06cfc7a656fb853607cb7873122cfd733fb8c37e1aec87cd7c5cfa732958fa2b86f31037ea4cccbbc1186f8678aef989bac8647dd82f5b84fc2375d1a23f09ef275bfa7cdc2fc9fe553e2efd78af2e75fe3a58fa0fe7c5d6439c5275a5f39f05a33f09cfdbfa178ce61fab6bf57470877e259c57df6e752bef27bc3fac0db66aa3de0b967acbea46e7c3fbd93adb68fc71b0c60bb555e33cd936c477d5437c2358cecb58ed3a391f11dc0d2652771dfad9a0df5d14dc88fdffc8fce7833be95fbc8f5dec2dcf17ef7797b858cca93acda51ece9b4b87386da9d34ece07eecfbf4c128de3fbd3e53e2efddfa8b34efa11ef3757b85c6cf07de1ca108fd57927fd74a92e34fe102c71f493ab8257d56527fd86f3e46aff0d22fdb123f671e92ff4bbff7a1a7ca0aed447ea5a7d152cf3e1fbdbbfaed48c785bf46f4418e7b54bfa0bc67a3bfcf51e4fffdf25394c6ce67dfe1bc70d5bff71cf720c3b6e673e7d561b323a3ef11f64853a2d9ff284cff83b9ff3055fea2ca439d6675cf98fed677956e7075ff30ddff294eff8a79fe51eb51c321e90f1bace233ff1127fe0655ee18ffc69c8c29dad22ebe1559d355ee70ddee42ddee61ddee53d6491cf18f3becfda978c17753ef3017fe1affc8d0ff9888f39e2185996134e91f17adf32ceb9e0922bae8989c85043962d394ec9513b643caf431d9dd0294de88cbed3395dd02559baf223535f674c3f863b7b5e87aee9866e694a77f493eee9811ee9096b99c9785167893ed032add047fa44abb4464fb4266b7979672feaacd3066dd2166dd30eedfa8cbd796b99a933e698f6e9331dd0179ff195f6e7ad65a6ce373af4238f7c8d033aa668fe5a66eac4b447573e23a19432cae7af65a64ebfeac2afbef43b5dbdb596993a7e9fa8a60bc3c6ff9e65ff93c6d87977f6b24eff4b95c6fe6d72624ed99a896924e3ad3ae66ce68cf67526c8a0f9757cd6ec39b59ae1deaaf3fac2f96fe7457e91f366c6db39bfba16fff97de15fed787c7b 789ced924b0ac2301040f739c5d0d915b1fe50443c82e25210179349441755d0ba10f1ee7606174943ab07f091451e8f49a06991c376b382bc30b78aaa13031fe90ab9bb97e563b75f3e4d369a40bd6630cc7a26eb03c3fa72f6b2c77a8f0345d48a8e15512f3a55449de85c112551564459f4a0e82d2dfcde10b1ad211161da6c4cdc98142778cb1d73510b07ebb16673e4c89375f673e4bf7d6fe1f76cb4e4198277e790f49f68d0d95e0bf3061d0ccaf3 btnClose clicked() tAutoTagDialogBase close() madman-0.93/designer/helpbrowser.ui0000644000175000001440000000437410053135242017152 0ustar akusers00000000000000 tHelpBrowser tHelpBrowser 0 0 600 480 madman Help Browser unnamed browserHelp layout5 unnamed spacer5 Horizontal Expanding 40 20 btnClose &Close btnClose clicked() tHelpBrowser close() madman-0.93/designer/mainwin.ui0000644000175000001440000024057310053135242016263 0ustar akusers00000000000000 tMainWindowBase tMainWindowBase 0 0 818 651 1 5 0 0 madman image0 unnamed 2 6 splitter1 Vertical splitter2 Horizontal Frame6_2 NoFrame Plain unnamed Overview false true lstOverview true true layout8 unnamed 2 layout7 unnamed toolButton6 image1 true lblSongCount &Search PlainText editSearch Layout10_2 unnamed 0 6 editSearch btnHelpAll &Help image2 lstAllSongs splitter3 Horizontal Frame5_2 NoFrame Raised unnamed 2 6 lstSets 7 5 0 0 layout6 unnamed btnNewSet image3 New Playlist btnCopySet image4 Duplicate Playlist btnBookmarkSet image5 Bookmark current search as Playlist btnImportSet image6 Import Winamp/XMMS playlist file as Playlist btnRemoveSet image7 Remove Playlist spacer2_2 Vertical Expanding 20 97 Frame4_2 NoFrame Raised unnamed 2 layout7 unnamed TextLabel1 &Playlist Contents PlainText editPlaylistCriterion editPlaylistCriterion btnUpdateSetCriterion Se&t image8 btnEditSetCriterion &Edit image9 btnHelpSet Help image2 lstSetEditor menubar tbMain Main Toolbar tbMediaControl Media Toolbar sbarSongPosition 5 0 0 0 150 0 9999 100 1000 Horizontal labelSongPosition -:-- tbRating Ratings Toolbar tSongListView

ui/song_set_view.h
-1 -1 0 5 5 0 0 image10 tSetListView
ui/set_list_view.h
-1 -1 0 5 5 0 0 image11 fileNewAction image3 New &New Ctrl+N fileOpenAction image12 Open &Open... Ctrl+O fileSaveAction image13 Save &Save Ctrl+S fileSaveAsAction image14 Save As Save &As... fileExitAction image15 Exit E&xit helpAboutAction image16 About &About... rescanAction image17 Rescan rereadTagsAction image17 Reread tags helpAction image2 Help... &Help... Show help browser updateOverviewAction image17 Update overview filePreferencesAction image18 Preferences... playAction image19 Play &Play stopAction image20 Stop &Stop pauseAction true image21 Pause P&ause skipForwardAction image22 Skip Forward Skip &Forward skipBackAction image23 Skip Backward Skip &Backward highlightSongAction image24 Highlight current song restoreWindowAction Restore Main Window Restore &Main Window minimizeWindowAction Minimize Main Window M&inimize Main Window rate0Action true image25 Rate currently playing song '-' rate1Action true image26 Rate currently playing song '*' rate2Action true image27 Rate currently playing song '**' rate3Action true image28 Rate currently playing song '***' rate4Action true image29 Rate currently playing song '****' rate5Action true image30 Rate currently playing song '*****' hideWindowAction &Hide Main Window 789cd57cc792ecc892ddfe7d45db60f78c864968a4d1b828794b6b4de3222434505ad1f8ef0cf871a0322fa787ef8d4d2f26a3177d2e80102e8e7ba8fad7bfff717776fcc7dffff56f2fafe2b5527fa8523cfff177fdd6755ffff37ffd8ffffdb77f89f33fdc7fc16299fd11fecb7ffbdbbf9cbffea1fe38197a33827e670588d527ddf50a782c56807c5801f5d6ea37c36ad5d16ad5e5ea6b372ba0512b403dad366a57c0f0be0a0e57c1d72aa856405baff6e07cb5d79babaf5dae00ddae0ee171b56f57ab4fc215e0ad8aaa91abb56dacf6ed73b5b6d5aa87d5aae5fd6a6d27abaf7dac00df5bed4eec8097085796f4e638722f8ff3300fe8f9a8186f998d853e3e1eb1a51f89da8c38d663a1e7cff43c304b4dcf7db9fe7ebf3de205fd48a357d47e3a961157d1dc1f41a34d662c49198b11ab7c2c54bf58afbf50f47e3616ea1f703e165219dad38949a8bf8ac6bf5c8c85eabf201c8e65c4f6eab7fa4f471c0563a1fa47617ae9622cd49f9cb01c0b69784958674186e7a39d7a327625229d1dd078e458a83e7fbdbd265897977f44588f85308d2fca421d527d8f9ac6178f85ec281b71265c21fdd624ff6019e401c9e351aecbbbeba97e1b2c026acf7e913dc8b1507fbf49df3400fa5eb03c35e469483fa17185b0f746ef4763a1fe6c923c4c6a200fe1af8f4f92bcb2682c347e92b7588c85f445f628e947efd3f8491c900f8d3f506e84644f2dec7b99c431c9736820af288de8797f0dfd8c85deafb83fd122a1fa5e683cd61590c1d9fafb433cf797ec4545ebf26a2fb8be7041e3f1dea9fd34b2d08f7f4878e90ac9dfbba1f1c63294f04fb2974c8f85de277f0bb41b21e96f88d6e56776c97ed558a8be83f939ece192e5e30ac9af67ff35908fff4aef078b7c017fb734fe388c42aabf7ca4efed58a87fd4df4cb942f62576a87d292201fd933f38e5e711c9a3231c0663a1efb708476321fffaa0f74dbc88611fc1faf835d95fbe180bf5afa0eff3300b499fe6d7fa739dd2f7f423fd6caedbab267bc8f558a8be92ea0ba7fef98febef57a4ef2872dda5e78afa1f5b5740ae64ef0be9cc157c1a92bc883068fc64df0be3cc95f4ad2f58beaed0f7f43c8e6391d0fbfe09f53fc8c20ccfa9bf41102c16d057b55ebfdf527da99327f88bc6934763a1e7c4ef4477d43f49fe14c4ae42aaafda239cbafaa06fe25fc716ae0bf4fe1dfb8f2ba41f1aaf933ecbbf2ed01f373eb24ff5ccfd49f1bc795ab7d782f4b3c85c7f481e629bf5e90ae993fae7bc3182ff0ce4af8108f2107c46f20b422771f86b47fa0a9205ec5990fc5de301f8b99cfc21823f48d8b371fe40edb7b0bfc0f117d96b73ccfea0587f1b8473d71ef5af237f72de63a0ff8eecd3b1b106ffe96e9d2faa61bd7d7f58b76f457c48e600fd156c0fee47e33f589787a1fe47321211c9a38d208fb150ff21ff2090d05f4bf6e3821bcb575daef3b34f7c90a5ae903ce5e1babffa07737be0ab7df68724a2feb5efbfe9f79ded3b817d9b077a4e0193eaff627b0e606ffe3bdb63067d0c97ec4fae105f10bf858e1e43e2affa7cbd3d75bd1e9f25c99fe885e431907f913b207fc8d8be391e4ac97c15633ca282ffa731e2791facdbe7f0cdf6a303d29fa5fe46762c247f8a47e122b0e0cfea71ae1ff6fcc6f69f816fbda93f22a0f68672bd7f6ae26bceb71ab2ef48bbf841f2b488cf225ec6f4be77b56e0ff693da4bc642f5937f478b31c2d1785f783cae907cedba7ccbe137fd9eb07fb84258aedb6777bbdedf325eff5eecb2be04ec5b9caec7c366f15b7b9ae5e72886f019c743c1f22179c4f958c81e9375fdf8e4dfd45dd8c311cbcf15eadffe7abceebaf5f168c42f272db46f28de8dd10af16a68d7eda348f8fb04f6def7bff103d93fa56ba40fb337db0ff28d08fa71f64bf2a9c2993fe87def90b1043fd51bdc9e843f35949f2d62375ed803e9c379af467ffd4f8e1f71007f2779b8ec2909489fedf97a7b3d7def9ea6c8af34ec27190b7daf397ef0f3aa67fb60bed3f5ba7f0ea7ebfaed9f677b27fbb7e4cf3ff9a64ad7fdbf7c62be58703efcc5fd5f823f3ce85bbb888e7c0df9981d0be1f375fbb515f39b44bea2f17cceb787b3f5fe7ac897d458e839fc811256b21ff8f39c2ff9a76c1f4bc42fe1add757258c63d457937d396b9cf2bb80fd39807e3ac4af6ce28721e0f894233e09f0ad190bb5ffcdfea2e1dfcde37afb6dc93845ff9ba97f39c65f7f03bbe6e9fb2ae0fe59c41751accb4b1e33bfc778eeefb3fd4bc4d7f290e5c1f98314cc8709c7b77ebd7fc33eb7e70ab5bfcfe3637d9629da73ff027d1cafdb638df1692741f01ff9b38b8e12f6e651fc0d940b17f8be586f5feeaf8f4fc45c9fe6f8f2baceaf7eba6e0f5eba1effd4f63a3ffb1b6cbf02f65b73fc73cfe1bf7bac6f09f95bbbfe7d0b7f162e9f2179a86efdb9d9677f71859e5fb03f2790873861ffcb202f7f8fe3ff82ed7787f922e57ce29ae5c3fc26f3f578d6c05fe67cb3bffa2d9efb2c3fb60f7df55b3c7ee2f1e4dc9f5db627b67ff13cfb1ff86163dddee5f32c6ff0ebfdba3efd6dfe7ef2ef1bae3f627bdd5ce70bfd39c70ff0eb11d797b1bda5b3fce8fbee8be5c7f9936cc1c78e0f612fcf335f61be30f137f3ad0a58df5c9f7fc67cc5fe3dbcaccbd7ffc5fde5f10f243f7217cce7697ca3b7c1dfc416db2bf747f0fc204891afc9dbdff475c7eda5f04f5bb37c13f0fbb06079f2fbca6379b2bceab375fff5b7d6f96a78647db3fdf72f3cde898f808db357cc27cf595e31daef2ed6fd4b2e667b24ec5daef3bd7ae1ef43e6ff0dd64fcafd19d6f5df6ffef6fdcd3c1ed8e3e55c1ff86283e53bad7735b3be303ee417c2f913ec756fdd3eedc57a7bc32dbf1f30df67ebf668313f0c27feab9e98ef25e45964b3fe495e05d9f34ffed74ef14d820fbc97f5f6bd9231af3f78158f3fe1f9de2d63d6678ff184f132a3fe146fb37c31ffed595f53fe0b3e4dddf8908f7e00a74222be60fe984df14757ebf653c48c0dc747e61f3781467e91c19ee318f33181f99d0a968847d630bf4ff1e488fd4f207f2cf2997fb11ef80a7f8fc204f1197cae66797f31563c3fa0feb8d950827c5d231f506321f9617d2a9dd6a7bce7757bd0cb19d3f81a3363f8d3c46fac2fff6ec698df4df95cc8f1e976c6243f3df139e76bf676c6981fb78c63bcefedce98e4e7dfccf100f9d80363d6b727668cf5c2299f65fe2ccc8cf1fd25e39ce72f1de3253f9fbe5f42dffef58c31beab19231e4de367fb2e26ac100fe50b630dffe836191bbcdfeecd98f8b6e1f9d1648f6d3a61b6b75f8c43b6e709473c5fe6f9461063bda6e57832f16f7b3063c4dbc31983ef797e342e1011bfb23e821cfcee4df52d615f1ee73381c4fca2fd626c301f16ac9fc0c2fe04f8ca99474cfaab5e1907586f901f1386fd979ccf8731eaafd87ec304eb0b05e78f6116d3f79e9e7082f5485e3f0873acd734bc3e1cca18fdb7134eb17efe3a63e8ef6dc6589f617d85bcbe2938bf0e6d8af939cbd3855bc87b8371c4fb0dfd8433e4ab9c0f4709af07325f4629b0377d9fe6d027cb3bca53c4d78309633dae978c458afc6b7fc239e413cc18ed1f339629f49d335629e60baccf48a7581fcb668cf502b6cfc8603da3663e892cbe2f7e30c9c7db9c708ef928fb5fec1c8adee7e72e7dc3fcbd9df092c653737b7184e7ded68497a83f9cb0c07a15cb278ef17e3bcc98f4d9eccf18ebeb3cfe38c9b0be58cd18f9c2fb8c697c0df3419ca2be9aed21ceb1fe567e4d18ebc7cdde8c11dfa7f128897c86d733629d537f6bb68fd8e434fe86fddd8547ea4ff93a63ea7ff53963e887fd378920bf82d74b9304fb5135aff727e912eb13537df912eb3f4733a6f1551f3386bed99f9225f6f3dabb1963bdc4cc18f2b89c31d683581e8958221eb03f2612b8e1f963c2fb0fc5e38cb1bfa2670cfe518c3570393dd782c6d7b27f2446205f99e46305fa2f668cf6315f1ec30df89af5910602ebb93c9e3414988f9433a6ef2df3411ae179cdf699c6f8be667da689407f797f274d25d947c5fe9366b00f1bce18eb33c18ca1df8d1993fc4be6c7349788772c3f97ff603ccc47a992e0df72c6989f4fef6b45f26a78bf353512f1b79b309e1be693d42af037eb230b800b9657162aeca7713e90c58afad3bdcc98f451b0fcb34c213fe2f89fe50afcf13561ecd709ce17b2a5463ec3fc90190df99e30b61a7cc7f12e5f607fd9b0fef3c8c03fd95ef2d890bc4b7fc6f4bd65f9e7ae016a8ff92bb7167c7b3263e46bcc3fcbd0627f82e5b38cf1bc61fd2d33ecd77a53be3ead1718c601f233af66ccf31fe3339ed6c7b6678cf5346fc6d4ff6197718cf98c1e668c7cec8e31e757629aaf2c313fe89e18f37aa13964ac787e1930d68c2f660c7fdf616c30ffaa20ff717e47fede9ece18f309de3f713fbc9fcd18fecfebc7537e649e19f37e419f329ed6dbbd1993be2ac958627fb67a63acb03edb891963bd2867acf1bcbd616c908ff5ac2f979fe38486629c211ff0a6e70af985c7fa0a35c7d38a31e71b05d71fda04fc7d3f63927fc5f3a9718198ec29661c24889f578c13e443038f27e27cc96b670c7be4fd5b974f207e7633467eb13761ce2f1633c6fc7eaa8ff3077138e11ce361fdc4bc1fe93d4c18fc2f58bf718cfd7ac1f6196788f7e59231c7d37a9fb1c8600fec0fb1c2f386edcfc547ecafb1bc5d3cc3fc8aed758a5f7dc398e34f534c18f945317daf817bd6978b2f844bb627173fa0df61c6b0b777c631f85fdc32ce04f64f79be3cf177c1f24d25f32faf876729f3dd37e3a5c6fe35eb3f13e0cb9efb9f49e64bcd586bf005f3819bf0923d896bc6a101df1ccf18f9c9f43c021f7aecaf8e1fa93fe506e304b87e9831f894f9c4d139ec81c79f1b8bf691cf04131f0e3cff9ff77bde1907bc9efb6bc6383fd1329ed687921983af9e18f37e8c97cc18eb4ff733467cba9b31d617df18337ffa31e304eb67ed36e369fda361ac814d3e63e41f53ff2daf87f07a7d1086c847968c33f09727190becbf94bc1ee6f80bf6934e98f9ea94b1c67e89f7c5d8603e55215f0edd7c8cfa53f17a4c1862ffc2bb9f30f64fc48413ec4f7633e6fe08c629f6e3ea9e711e237e4e7889e7e5e78ce17f1e630dfe6bb8bfa1e5f337e0d370e2afaa606c309f19583e6efe013e413e1b4ef38df6917180f33682e51b27e09b6e8b71cae751f209237feca7fa34f34f3363ecaffd3c47bec1eb7b2e9fc77a27fc39747c04fbfac1e023cb38049fdae309a3ff25db87cbdf091b9657922da9bf96e53ff19b647dbafc1af933f835747c04feaa1987c877cb73c67cfe467c33e67cb59d31e797dc7eba447e5ab2fd3bbe823ec58c915f0e8c15ce5f35ec7f2e7f443ec9facb1678bf3f9931b55f5c300ef0dcbc324e98ef585e2e7fc47a5e3763e463db13061f962f8c97c096fd61e2cf92f5eff812f180fd7fca274bb617974fe2bcc9d184c17fd521639730d3f859def9d282dfd97e9711f31df41f4dfc561c3366be520bc631efa73e30e6f5f3f263c6640ffa95f1b47ef6c9785a1f8b18e7bcff703763ac274febe39cbf9588df91cbcf70be628b31efc7794f8c393f123c9ec0627fd782ffa3892f06cd388f917f5f315658afd1b0f7c87d807cf586718cf39915d7ef20ea3f619c617eae581eb1cde9fb0ef942e4fc8de4a3de1907782e78fcce9f108f0ce31cf3dd8ec7eff203e49b2c3f377f04bf73fbe902f3e582cf1fb9788ff5fa53c689a0f1f5dc7fe70fe8fffe8ca93f45cfd822fecb9d1963ff0ef94ee4fc03f3e572c2986f15e0e7c8d91fd65b787c2efe825fb6266cc1d7781e4ff1d29e339ee2e1b4ffc4fb257a6bc690f70ee394f76f1e182b3e2f61185bac7fb6c83fe229bf2f33c6d3fe42c37889f37d55cd58235fb75c7f18c39ebc88b14a315eee9fcb87b19fcefd73f929f2d98d1963bd13fc16bb7c14e72d78fc319fcf344bc66c6f05cbc3e58ff8fe91b1423ce9cf186bd88344be103bbec07a3dd79707e00fb9cd3831d8bfcb19b3fe64c138079f18d8f7bcff567733c67993e9f9a4aff719c39fce18f37e73753263ac87e533463e329dff4979bfcc63ccebe9d5d4bec67c519ecd187c75c898f7fb2bd86732cddfe4c584a1ef9ef7c35d7e027c31639297bd631cf179b273c609cee3d4dc5fc71fc8170ce31cebbf25ec2f8973ac071ac4a32495887f72c6d83fd2c8d79239bf46ff7ff62f1f660c7f99f637797f4a363386fd6f31e6fd89ca63ccfbb1e660c618dff45ce07def1763c9e72f6f182bec77cb4bc61afb1315e247eaf229aabfc3fc2775ee0dfed9631c22df526f13c6fc537d32ce13ac5740bfe3fe1ad6cfe1bfd914bfcc8423ced77bc6bcbfda5f325e822faa5bc606fd2fdf194ffba78c5dbc011f62fc592839df84bd675184f3fab2662c30ffed20cfcccd0fc16fc83732c7ff90f737e37489f1ec3256c8a73ae837730a21fd1be40f2eda806f25f827cbb5413e86fee5cedf906f448ca7fdcd84b1e0f1c33e72175fc1179f3346fe71c338e0f8bbc958401ee694319f2fd3e0a33cca62acbf2d19e7e047993256904ff13263cc97b8fe643a0f8d7893a716f96087f12dc71337d49f1dc6d3f83618b33d977b8c15f28bfe83b1e1fdb9dd19838fa6f30296cf8361feb974f2407eb3cf98cf5be89719439e578c53f049077d2fdd7c067c943356987f74c8b796d3fa4777c498f7330ce623cb38c4fa86e6fec50aeb0f45c8d822bfaf910f2d5dfcc77c97fb932e913f14b04f319d571a7cc62c4ff5ca3887fcaa5f8cf93c90817d0837c1853ff0f7a1c27a5307be1531df87b0a78c63c43fab180be44b06fa1289c0fe81e6f3026980f983b48c35f2911ef99b74fd07bfdd30ce319e763acf3e9de7005f4a37fd827dbd33e6fd55c5fbeb8ebf613ffcfd9820537ff9fb28407ea8d01fe5ec03f68278aca6f30c4a30e6f30e3563272fd8ef2963c3fc81f694b37fc48f77c61afea27e3fcf8778ad9dbd816f4e19c7f0d72e649ce1fc8efa626c719e50f1790117bfb0dfb7c93803df560f8c05e6e70dec5f3bfec57c02f6ae1d7f61ff13f1443bfe41fe3c9ddf537c5e2266cc7cda806fcc788293bebf62cce7bb64c038c5f90375c098f7b72df261e3e40979f1f330c6fe6f877cc2b8f93aec09feefa48df9ba051f9a24011f1be40ff379990af1c10606e36fe14f360ca0bf92cf2bb909018dd7f2f344b23c207febe239d627f9fcd578c289dabb039eec452f660c7e3c611c339fe03c869b5063bd573f3336386faf715ec94d78604fdd1b63be7f56fc028e97f0c7fa9531fb9fda676cf839d7efe6e7f00f9cbf0c26f9b4b81f329f676b709e2770f930f84101bbfe60bf8af443e73f319ff11967b05775c75885c86ff93e805327f2c9a71963fce44f4134d997c1f9dd683e4ff4c198ef973411e39cfde39db1041fd42db09b0f227f48190bcc1f9b1a38e2fb0de291b1c27ab2dc048ed314e7d7707e319eda2fae196bf8a38d815d7558ff3f669c637dac5333463e8cf1b8d906e287d58c63d87707fb9acf43f6d067120aaccfd77cfed9d90bf6e3ee195b8ca7c4fdac243209e637382f99b8f92ce6f7b0a724e17854e2bce398af811f701f673eefd72f192bbe3f80f1646ebcf02fcd58b1bcb780a7f30106edb9fc07f7ed24e4974fe7bb15ce53e6b1467e50c01ee6f38806e7ebc7f369e067d89b8b3f904787fb47d2bd817c09fa57d3797c0df9a850c1ff15c5b3408f3710a9be9ff3c8b05fdc1f72dae5f9e31ee325f855c1ff74a615e6fffcdc253cc8ef701ed6b87c0afb510f8cf9fe4589f18f7c87f3619a7186f58b0efab3410e7b55786e9d3d623e4ef9c4cf79ca82c6ef663321eccde2bea09b0d816f4bdc9f0bc31cfc5a51fc0923372104bfe0be593cde3823fba2fc66bc2dc3e78f76194b8e37fc3c4e78fe83fb04f3fdaa5e315ea23f3dee6366d37d041dcc18fbdb8733c6f91edc4773f913e25787fb75d23d877f90ffd3f96dac27858cf93e434df2a3e52ef031ee2f04d3fd1b85fbaa41c2e72b2adcff98efdb74c4173ff7cb74c838c779234df2a2fb21c84749bfe36d24cc1ff5743f6989fca36c18f3797e85efa50b8ff067e28b488d85f489fb98f37d908af283c88c85ea2379fedcef51b82f60c71b94e4bfb8efb270ef63be8afb81f3fd9006f777e80036d927c507a7ec05df3fb967ccfc58923ffddccf2a703f6cbe0f5650bcfab93fd2e3fe4f3a167a4ef2889763a1f651bf180b61e2d79ffb151df163ac1cc6fd6bb277babf837c44ce18ebb134ff898d7b1ffa20fba2e508f011f59fe814eba9c487c9780012eb31642f747d04f307e2bb9ffbcb8ae24592ccf7994f1827e06b43fafdb93faec95e7fee7f1bd2c7cffd6f457cf673dfb9467d722c240ff4d765df785e768c15f2b592f2e3f1f638f65beb53c6ccf725c5dfc48e85da277fa7e3e7e0fb7ac298af5594af8fb71381cd0de300f9aa26fe20f7467e49f6e794cbf15c9d328ec12706f5d38f30ee37d3853efa9ef295341f0bf587e4952edd73c4c73bc64bcc8f2cc5f7548c85ec89e2612addf788570f8cf9bebbc5fd7795f279b492fce3e7fea3267d8ff7bf11df35f95f6a538e870af75d1713ae15f0f82ff43ef1318547f025d9e778fd14b88b670cfba2f89ac5199f27b3140f491c900ff5efe77e7047f69ce563a1f7717f9efe000261dc271eefd363fe44f96426c742f5913ce93e34d6f7886f56ee2f13bf64662c241fb2cfcc8e85ec81f21fbafe80fd21ca9fe93a19f2531aefcf7dde12f77be9c21bf58ff44bddc7fe15c92ba71fd547fc9e8bb1903d50bcfab9af6ec8dee8cf2bc0df49feb9190be987f495db09b7e4ef44c7d49ff3d7bfb6fcd76fc3f7c6f25fa30d5ff8f2df6fe79f69c357bef68d6ffdc22ffdcaaffdc66ffdceeffdc17ff49ffefcbb7fa40dffd97ff15ffd37ffddfff03ffd2fffdbdff037fd2d7fdbdff177fd5ffe9ebfef1ff887fed17fb40dffd83ff14ffd33ffdcbff02ffd2bffdabff16ffd3bffde7ff0177ee0877ee4c77ee2a77ee6e7ffc136964e6d9e273ce9294f7bc6b35ee1955ee5d55ee3b55ee7f5dee03d7a4fdeb3f7e2bd7a6fff7c1bdebbf7e17d7a5fdeb7b7e16d7a5bdeb6b7e3ed7abfbc3d6fdf3bf00ebd23efd83bf14ebd33efdcbbf02ebd2beffa9f6bc3bbf16ebd3befde7bf0165ee0855ee4c55ee2a55ee6e5def2fc55f8c2134248a184164658ef5914a2f4bd7fbc0ddf1395a845235ad1895e0ce25138898867f132bd215ec59b78171fe2537c896fb12136c596d8fec7db702dec885df14bec897d71200ec59138762d9c88537136b7712e2ec4a5b812d7e246dc8a3b71ef5d8807b1586fe5cfda10e3826fe492b0c405d6cc91f152fad293424aa956fbe17b524b23ad2c64292b59cb46b6b2fbffb7217b39c847f9249fe58b7c15897c93eff2437ebababe7e1fab6be35b6ec84db925b7e58edc95bfe49edc9707ff5e1bbe9487f2481ecb13792acfe4b9bc9097f24a5ecb1bef59decabbdfdb90f7f2412ee4b8cdec926f976ca52e60e672f9e76df852f9ca534249a59456465955a85255aa568d6a55a77a35ac7ead1ed5937a562fea55bda977f5a13ed597fa561b6a73555aeb6da82db5ad76d4aefaa5f6d4be3a5087ea481dab1375aaced4b9f7ac2ed4a57ffc330a75a5aed58dba5577ea5e3d38abbe70ef2c144d6f553cbdb9da864b1b53df4dbe5d385d6a5f7b5a68a995d6da68ab0b5deaca7bd6b56ea6f775ab3bddeb413fea27fdac5ff4ab7ed3effa43b5eebd4ffda5bfd1ca4f1b7a436fea2dbdad77f4aefea5f7f4be3ed087fac8b5714c6d9ce8537da6cff5c5dcc6a5bed2d7fa46dfea3b7daf1fa4d1e305d6d04d7962c72ccf2eb54d57dbf03d97bce47a697ce31961a451461b63ac294c692a53ab33d398d674a637ac11ffd83c9a27f36c5eccab7933efe6c37c9a2ff36d36cca6d932db8ebd9ecd8ed99dda30bfcc9ed93707feb9393447e6d89c98537366cecd856be3d25c996b73636ef589b933f7e6016d988571d376372d8b5dea9dba742a374beb5bcf0a2badb2da1aefd95a5ba00d5bdacad6b6b1aded6c6f07fb689fecb37dd1d6beda37fb6e6edd186ecc8d3ab31feebbcfb105fb65bfed86ddb45b76dbeed85dfbcbeed97d7b600fed913db627f6d49ed9737b612fed15b5716d6fecadbdb3f7f6c12e6c30fe91001bdb71a927b3b95d167ee1d9e5685b85f09e0b8aac852a74610a5b14455954455d34455b74455f0cc563f1543c172fc56bf1e6de7e2f3e28fffe2cbe8aef62a3d82cb68aed62a7d82d7e157bc5be7dd5c7eab438280e5d397023698aa3e2b838a1364e8bb3e2bcb8282e8babe25a66c58dfbbfdbe2aeb82f1e8a4511146111154ef3455260ce981579b12cfdd22b45294b55ead294b62ccab2accada05a4c695b6ec4c5bf6faac249d978fe553f95cbe94afe55bf95e7e949fe557f95d6e949be556b95dee94bbe5af72cf7b2ef7cb03ca5b0fcba3f2b83c294fcbb3f2bcbc282fcbabf2babc296ff5717957de970fae2c745106655846654c6d24655a66655e2e2bbff22a51c94a55ba3295ad8aaaacaaaaae9aaaadbaaaaf06caa51faba7eab97aa95eabb7eabdfaa83eabafeabbdaa8365d1b5db535b6516deb936aa7daad7ea18d6aafdaaf0eaac3eaa83aae4eaad3eaac3aaf2eaacbeaaabaae6eaadbeaaebaaf1eaa45155458df8faab84aaab4caaabc5ad67eedd5a296b5aab5cdd519b7b1e5bcb0a84d19d5766ca32eeab2aeeaba6eeab6eeeabe1eeac7faa97eae5fead7faad7eaf3feacf62597fd5dff506e5f09bf556bd5deff8f7f56efdabdeabf7eb83fab03e7296fbaececab63eae8f0bbf3ea94f8ba3faac3ea7362eeacbfaaabeae6feadbfaaebeaf1fea451dd4611dd5719dd4699dd579bd6cfcc66b681ee07b8d6c54a31bd3d8a6700aae9aba699a561fb954ffa671d26a7a2dcb3b6d9ba1796c285b6b9e9b97e6b5796bde9b8fe6b3f96abe9b8d66b3d96ab69b9d66b7f9d5ec35fbcd4173d81c35c7f073d7ca4973da9c35e7cd4573d95c35d7cd4d73eb14983677f54973df74e6b6ec9a07d7c6a209a88db0899ab8499ab4c99abc59b67eebb5a295ad6a756b9c19daa6ac3edaa22ddbea87afdaba6ddab6eddabe1ddac7f6a97dd647ed4bfb5aded9a5fba873fa5fb46fed3b98a4fd683fdbaff6bbdd6837dbad76bbdd6977db5fed5ebbdf1eb487ed517bdc9eb4a7ed597bde5efcf06e7bd95eb5d7ed4d7bdbde3557ed7dfbd02edac0e665ed18b728ef4c5d1cb5611bf1db719bb4699bb579bbecfcceeb44273bd5e9ce74b62b3a678e5ddd355ddb755dffd386ef7543f7d83d75cfdd4bf7dabd75efdd4779dbdca9337de298eacd5c779fdd57f73d317bb7d16d765bdd76b7d3ed76bfbabd6ebf3be80ebba3eeb83be94ebbb3eebcbbe82ebbabee7a35467537dd6d77d7dd770fdda20bbab08bcc4d17db6559778929bb549f75593767b4ddb2f77baf17bdec55af7bd3dbbee8cbbeeaebbee9dbbef39efbbe1fc698bbda46ffd83ff5cffd4bffdabff5effd47ff59deeb43c7bc69ffd57ff71bfd66bfd56f8fb908bdbdd3eff6bfaaa37eafdfef0ffac3fea83fee4ffad3feac3fef2ffacbfeaabfc69bbfe725fd4d7fdbdff5f7fd837972ea5f98dabe693b6adbf52be843cc8ce8cda88ffba44ffbaccffbe5e00fde200639a8410f66b043319443f567f9d5500fcdd00edde0f86f1886c7e169781e5e86d7e16d781f3e7ef28de173f81abe878d6173d81ab6871d67b4d7c3eef0cbd5bf37ec0f2b19d6bf95c3f9de70381c0dc7c3c9702abce16c381f2e864b79ff7b1eebdab91aae879be176b81beec79cc47b1e1e86c5100ce19fe757ff7619a23f7fe6fa130fc990da8f3634dd900df9b07cf4d7dff9cf98d736278fdea378948fea513f9afff7f97fdedcb951c3e1a37d2cfeca36febcfcf56dfcd5eb0c983dfc956dc05fffca36a6165c1bffe7bfffedff02ade01c2f 789cbd915d4bc3301846effb2b427357645b3b3f36c49fa07829881769f276fd600a3a2f44fcefe6bc9b9195f5529f274d737a28a4e9bc300ff7b7a698676f3bb7ebbcf1ad7b354578df6e3f1e9f6e3eb3bcaa4c1ce5d294f95996cf8c37772fcfc2dac6b55d68c0012c5714ecc12a50b003cf1714dc80178e822d78b9a66000571ab001d74b0a7ab0bea260ad1828e840df5050c046a3fb3f997f36f637d3c68e8dabbd67d43f2a9920121a9d0e2a998d88e8d5b67b954cd70be9bb1855c90c838d22de883dde9bbeb3df9e1c191e1f94cc46264d535f2a536720a33390943ffd3fa7ccd775f60d4b60a687 789c95d44d53e2401080e13bbf2225376bab858404525b7b00153f1650fc44b6f6904c1241051441c5adfdefdbd3dd19c9b007b53df8d4cc9b4924bab3ed0c4ebbcef64ee979112dc6ca51a368ee6c27cbc964f5ebf78f3fa52db7e6e077e03beed6b7d2567fe128a7379ba61a5046942b8d8aaa34c87bda6ee8276e487ed1f6aa7ee255c96d76501577c4bef88c1ca2b97fd4ae7b61b5ee919fc4be784e8ec3b01e939fc58978c18eaaec326837bcdcb0ccdde0eb9d887df1501c897d71dae0de25c7c61e3b76c5813810bf6987b5380a6be4953815bf1b2bf2355999f5265bb9b2de1207e25d7124bec81d717fa41dd5942bbe11e7fb7bb965fd988cd78f78fd549cc6bc1e69c7b5c415c7e240fc4a4e703d215f8903b11247e2449c8a2fd969dea7b9954f3ed0567e1289bbe2545c679bfde7c67cbd4c1cc87a559c5fef908cf727fbf7c5a938649beb0f8c79fd569c5faf66cceb23717ebd313bcbfb9fda09de6fc27d5f1c882be2487cc7ce02e91bb965fd5e9cef7f1067e2093945f3dff7543b0db22c0dc833ed8cbef89fc1d7861b287f760a4d841383c24920850ce7164630863bb8870798d04c71dfacd03cc213ce1c9e61014b78a179c5798315bc43135ab06b35f15ab187bbf769da3807a6b01bb5561ce2ee2338c6f989d381ae14bd8d868b133ae3884e68c329deb36eb8b09bc43c0717fc1c1de8e35d9fc139eebfd8b8b74b3a834f39c6e60a8b6bd30ce0068b96d564540cf1fa6d53347177057fd68d2e9a5653a5c2050fabf542d19d71b1b29a1a163e16013dc7ca9ca19bba146f5633a2338a85b20acf6ac6a6782f9cd15d2b5cab69ac152ddccb532f1443abb93777c59ff90042eb8c21fe968acd43a1e8d129dd625106ab995845053fcd0ebe9f1f672cf14db19b8f42377d7cd3f467bb5ecc371a5d5cc87bd5c533368b27ab99ae15fac90ffe533c5acd67c73458cd3e3b1fcd97fe57fdfd5efa07ad1e38d0 789c8dd25d8f9a401406e07b7f05913bd3b0ae55a3d9f4825d3e763769d3cb264d2fe603565114044168fadf77ce3933ca4ed3a483173cbebc33a3c3ddc4f9f1fdab33b91b5535abb7c2111b767226f29ce7ddcf5f5f7e8fc6b3b9a33e9f57cefdf8d368ec39c2f9763c2470cfd4bd3bc5017491aba998ae8009702dd66bb100be694a21813b22bb279e806c6eb8d55c10a5a1c4a952a4608cb8d74c889b2b719367229f517ab812d357209ff3199f034b434a33cd25f168982c818f48c919a59521a58566427c028a85e1852866c4f64a9c2a374c31ad359794764869e86b32626448dd463321be00e5c230204abdd0f39529b0d75c12636462186a32a200a6cb544fc59138f0b5f9c7f8afcc65b7cbce1817fa62aeb07b4226e9db669ba987dcbf7a49badbc86cefe69c71bb97ee0ef2b82f4a08eddea94cab7d91d5959bd38a839e8ace2a2a9a5685562fadca4bd6154dddfb2eae38e81565fbe83f052a0a1b9c74d053517409ba3e0a9bd8eeb555d4065dec877e5fdb3db589c08f1b15295abda67df6c328c407eddf879b087d08d494ec430fa2d80fa0c5d43f23863d88ba80ee211af6423fae5f0a4f9d9ffab3e11487bdbe6daad6f304c71e17b7deab3e755c0f777a7b5fccb9abaf85b5cfc15001f786fbb46398f3cfc3e81d54a839b6 789c8d90cb4ec3301045f7f90aabde5528a5551aa9427c0288251262618fc7aee3a40f280b84f87732639c26698ab8cac227c737e3783117cf4f0f62bec8de4feae441c056bd89b9f9689acf97d7fbaf6cb62a44fb2c376239bbc966b900f1b8df21ad65bb96b71c4220dcc0c6e882f0d8a1217484aa50eb883621ac09778ca03062d3216fde47d4ab8835a12e92ad2226ab09c100624968125a4b8884666d4ae45f3824b4bcd933a2c188db0eb91b08b1c432a222b41cbe992bf9879329534e71ae380d1aa43172cab50aad9c76ad1a0fedf5dc78e8b9e7b6fc617d1eda39e7ab78209417ce57211ec885243b5787d873a10e72e442ec39dfd04a0e5cc5bd766aa878db45cff99ad56ee8f885dfb3b238701cd5c4d601fa2ee70b51bfeaa8072e4f07620513ae55cdc1d1c55db85ec62e57bd8cdd287fbaefbbec077773ecae 789c7d914d4f83401086effc8a0ddc88b17c7581187f82c6a389f1303b0b85b660a2f5608cff5d66a0743fac331cf6c9931776864d2c9e9f1e44bc093e4e70ea516007ef22d69fc3f0f5f27aff1d845921a62795220d6f82f056a0787c1b1b3aabe91c255c84116395605211f68405c86d018403a104a925e39eb0ccebb4548423a32aeb190f84555eeb2a27ec181540c5b625ac51c91a0977845060068c4746049851132aada5d2840d216e9b0c1981b0956dd64a4264e4e261af94e122b8ee942bad9c23cd1c6a5b5ab9c696b38b14356a5b2e39da064e394b9edf19e966e98b5cbff787bcdcc597e63d5d69eed395d6ae0de9ce37b5953ccfd7eea6eefa552a34e673a491f3a49f5b2529fb7b8bdc1fd411fc7b720f231af3f15f30dadb9957ffba9fbbe017933ee031 789ccd91cb4ec3301045f7f90a2bde45a8cd5bb5503f01c41209b17066e23c4d25280b84f8773c76dc6268762c3a133973727dfd986c13f6f870c7926df47694c70118f4f29525f8aef5c7d3f3fe338af3929927ab5816df44f18601bb3fbcb4544b53f3d40621b7b84b21dd110e844556a4754ed85b1405d492702614a5c84449a83c4245a82d82400184ad4740c291102ac8dd64f0a86ac2c92242eb26371e9522ec0855ad96c968d186bddd4a041a97265734d9402371c567cec0bb359f6aafc1871d76ce4755a8c97ee807e33363bf78cf6bd2822efdb23ff6f3e26947af51279d28d15481c6c7699cdc394de52e72f24db39eb534adb66f0c7dda7da471bee4f379d1b7e43ff97890816f635b7cce3fffe857c45fb7d137990ce2d2 789cddd2c94ac4401006e07b9ea249df826466b241233e82e251100fd555bdcd0a3a1e447c77bb3a41b2388367abfb908f3f3f595785787abc17c52a7b3bc339a0400fafa2a0f7c3e1e3f9e5ee33cbab46c4bd893bbfc9f252a078381d0d1fcb782cd7699886596fea759dcea4814d4f4c54918a19985dd5b55dc5dc26422430fd40d5d331152aa590b91b483df74c681441c30426121a24a666528b865aa665da34e9712eccdf3329e5a54c8206b9cce2bd8dd724333676e2723cded82bbd4956924d3d88b540769e39edf456d38e3cd9e97da275e0c0033a0a38cb7e7afb658f861e390cbf64ffe07ae3f739cbc6df619695763ccb7f623657b3afdbec1b60a7e47a 789c8dd24d6fda301c06f03b9f22223754514a21024d3d98e68556dab4e3a46907c78e0b21018784bc30edbbcff6df4e53b7959a20941f0f8f6db06f27ceaf9fdf9dc9eda8ac70b5270ed9e1b333a1973cef7eff79f83b1acf178e78ddaf9cbbf1cd683c7588f3e3744ce43316cfee4c5d92aee26a46662bc944724dd66bb2947cd1a4844a1e80f80e7896c40bc3bde612480da91a8a29128c81996602dcf5548bbc00e339a4c79e2a7d968c17f13c5e48168690a69a1ef0649878921b451a63484b4348b966027c94244bc31648e6c0a6a71a2a37642aad343d483b456a8834313034846ead99009f24e9d2d007523dd1b62793bc6a7ac04831310c34319048328fe9a1624575a963f3c9f5a5ccc5afb79de198e81bbbc4ee119ab097dd3e155f72dff51276d8d13473f318c7768f1d8ef494f1428676ef5cb032e36955ba39cc38e889e822225e3722b47aac2cdab4e3757545ae9a71d0e345b3418fbe88825a0d3ae889286cfdee1a067564f79a326cfc2e4201ba56764f2cc247512da2a6b67b75b3454118a06d1396764f2d22407e8b36addd935124a39467e2f7e1614f469dcf2bf8a3c56e0c7a018aaa275e15e26315bde989f5954dc1c536c31ebef69efb5d97ef6fd639edf77daaa30fcf9239141f9e33735efe7d1bfd077e3e3b07 789c7dd35b739a401806e07b7f0513ee321da30814a6d30b35120f9804a28949a7177bc243e2d96062a7ffbdfbedb78b3a9d1672e19377dffd10f0ead21addf7adcbabd27647765366b109d95897fc7d3efffcf1f3fbafd285e35af2cff3aceac597d245d962d6ed7221e033919fed8a3a80b662506195004881d5004e20033aa1133821b089f442e407b016fa5e4df11918d4826a4d0d9d02431686cc03be6a72c6812b24a9223f81c4359c6b7ac88921575bf515595075d5a0ade1570a9c2109c1c56b4d817c2ba8eec635923a98ee0aaaf401485db7e239c00a923ad405ee0d71f142d347be1b0a1f78abc85de6abad1ac880bb04981906ea2bdc2129c1ad0e86b855ae2990f740e619be2099bec88e21a65141b5f3c63053e98da68f37b66e888bbb8adc30d624c881216ed5d214c82720f70cdb48eee08d1d19e2ab9218e2e2c78219b0a7e923c78a8208c28043a449534d825c02854f0555ef9500667ea607714575a85fcd3f0e95d9e478aaff5246b9cee463d327b10544d9389321f6c4643a7b7d9b2fe4225b666cbc1c33617ad3d9ea6db258db1b4e78996d97a7bdd96a37795fe77b08cbf463bbdc1e7b9ffbd9619d2fea077b63d346f3a32923d393d1b58cf256646fd84dbb797a9db3c3beb3e8e6ad7a2f66fd76ff1622d3cbf7d15d7c9fc828a5ed9bc6036c697a321a74926e6f90d286894c2f3a0ca2a43b8cd3584ed35b9a9ebc88241eb6d2936945af153dc6e9208d1f8fd38a1e5c846c2527d38a1e44c338e99c4c2b7a107593fc745ad14be361fd29afd3d1f371cba2d78b5a8768cf5e46323aef55f453a7a31726ecb35ed93c7726237ede2b0e5accfa3b3b8bcaff7d077f7f2bfd0183277b8d 789c6dd7594f23471007f0f7fd14d6d6db2aaaf58c3db647511eb831b7317794879ac30760cc61c010e5bba7dcf5af5688167664fdb66bbaababbb67cccf1f8dab93c3c68f9fdf5e16b298968d7222cf8d1fd5eb6cf6f1e75f7ffcfded7b9a3656ff9aad46fafdb76fdf078b46d9389a3fd42bf04841699e964933b830b79a7019dd0b96955b895b5a703bcd572e08eea576ff6570ae0eedd477b792103f854b8b2fc6d1163f77237e646e37113f89b6f8307e3bf1785a8b0eedbc696eb7ad9db7e01ee6476ee4ffe0c6fd158c7c69182cde4eec6e87fea50dfbf8176e6ba7d07f96669999cfa325ccaf862bcc97a36dbccf60f178cee11cde706761f16917ae30fe6b7488a7851bf14d7327417f676eb4f756eea41e2f57e6d83e83919f6cba117f04235fd9765b3b0fa36dfc398cf973edc67a6fb951ffe768ab6765ee26b8dff213ef5f4630e2b9e7463ea7ee8ee5ff60ee2618af8eb6fe3238437eb91bf1299cdbfacad3cadd5617f5a11738c7fe4adcb8ffd68d7aeec15e8fc3683b9f62ee2518ef33dafa3f75e3bc957086f86eb4d56f3db8e8e6dd56f01a5cc1bbe65e629673d8ebd18d0efdc9058cf9f2c08df9e630ce037db8719ec37c7a9a7fb708f10267b65e7cef46fb3e9ca3fd23dad6ef0cf67abe99f304f95ec3a8871cbb71be52d8d777e8b6fee412f6f958be3adf5ea817b561afe7d86ded7c67ce13c46fc37ede2766c17a17059cd9f38e466e8c3f8eb6fd700f0b9ef7095c37cd3d37de178f2be76dcf876fa343bd790267f012f67a77cc319f69b4ed872e2ca8e732daeabfe3c6fa9cc235f21f9b8bd4f2a5cd687bfedbfd659ee7ede017b842becf6eb44fa3cbd0df8559b0ffe808ceb0ff37e01afba3652e52cc87a26dbe276ecca7097790ff73b4cdef0616ac4fdf6df1c2d1d67ee8c6f80318eb4bd1180ff529513f0ecf7b694b62f5a002ceccb2662e523c2fb7605f9f0fd8fbbf75e3bc2dcd3e9ebcb9f17ce8c05e8f83685bcf701e44eb2db65e4fd1b65eebe62245be53b8c6f3ffdd8dfd3933fbf884761f5f0edcd88f951bf118bf44bde926dae24fe01ae7af76e3f9169e2f45bb143c0f5fdcf6fea23b18f773eac6f3e63ddac6db75e37df5e8c6fbae65aebcde6d37beaf84f528aa52f03c9dc3359ea79939c627d136deab1befaf75b883ef23e76e3ccfaea36d7dc2f795322b05ebfb0ad738af7db7ad371f99fd7e59b8b13f276e9cdf1318f5e54337e6d78cb67cf761ec170efba1acaa1afd9db92d3f3a36d729ea77efc6f33cbccf2beddfe6478fe6d85e45dbfd851bf1577007f5d877e3bc86f5a9ea3a2d6cffdfc1debe116df5db73a39e37b0e777191dda257c7fa83b6e8a2eaae00eeceb13d6b7d69f325b79b058fd32b170c1a55ebffaac2ccae2b9e6118f79c253bd6ef9ee3fd7587fef79c60f7acf3cc617fcc84ffcac6d8ffcc20b7ee5377ee7257ff027aff1bac66ff0269716cf5b1ab7cd3bbcabb17ddee37d3ee0433ee2633ee1019ff290cff89c2ff89229c48b66f1ac3d5df135df7093134eb9c56dcef4b3c35dee71ce393111dbfa8c784a4205955451cd1d1ad1982634a55bbad3f80eddd38c1ef882e66cf52ab5ff2b8d7ea4277aa6175ad06bb866f446efb4d4df0ffad4fed762ffb7b44e1b9cd2266dd142c75e5ddb3cd0bb3e347a477bd9d5f83ee245e3f7689f0ee830f67d44c77412ee186946033aa5e197fecfe85c7bf7be2fe892aee89a6ea84989f6bfa434f4eff9df52c509b5d0779b32ea684d13ea528f728d1e882ebfce37f6cf077422b4ea5b440ad14af1a15452ab473aee52c65ff39789b64fe955f44eb9937b5d858c5b32d377c0c32a7fee7ecd5fe61aff284ff22c2fb290577993775db1443fb53ef2219f5ff2bf93356d5b970dd9d41eb77820dbb223bbab155ed55ffab2f725ffb1eccb81aed6931cca116ab490633909d10339fd5ffdef795d869ae7923bc27226e772415d5986b51d683663b9d4fcfbb1ff190fe54aaec35aeaa577ee20f24673e94b531249a585fc2b69ebfe3ed7dae91f75ba964b5c03e9d344ba1add93bce0826c3f87f3b2a9fb6f18aeba10ba2f563f25eb1b563771a5d17531e2513c5fba538b3111cd690dd73c7ef6a95f4c8aa99de12fe77da4951de9ffffea730be7fd9fdfbffd0b690edc6c 789c9d95594f32591086effd15c4ba3393fae895ee4ce6824540141011b7c95cf406a202caa6f065fefb549faaea0b24996fc623cb937aeb3d55754e871f67a587eb6ee9ecc7c96a1dada74929798e96a5b374339bedfefceb8f9f27a7b65da27fcb724bf6e96f27a783752929f516f32c070402289b3fc39d8203c3136157e276c1260eac0f0ade0907927f2d9c58261f929cad72be0cef8535ff5959e277c201ef0fa02cf1ae7022f9efca12ff301ca81e87c21a5f32db5acf95b0eebfcdd92e2be3a5b0fa7986435bfd6e981d99278c0ae6795c288b3e2b98e3036157d8f839961308af985df51b1b0e9dc0098ddf5a3811fd7dceaee52a370d475e28f9b7ca1c07539f67173c144e65be2fcae2d763f62d89df2acb7cc282393e57b6b9ff58d893fca632c7d1ccc78bbcd48b4c7cc2ec4bfdf0aa2cfbf50be6fa2c65d9af2aacfd2c94e53cccf9fa7645eb7794a59ebdb027fe5565895f09cb7e981a267f9febaf3117fab6702af599e7a5e2049e6dce1377c25affa6608e4786e34a58894dfc8b59f5f890731087e28f2de648fbdb16ccfd6c9465bf7365c732f12f61ed3f5016fd4a59f4e6790fddd00a5d137f638eb4bfa532df5ffc148ea4be5ac17c5ea9b2ecd72b98efff403893fa1accb12d5c5696fd4d7f6152c41f95c53f2a98f56b6597fbf3857da9b75e30fb5584b59fa78239de5596fd3e0be6fdccf311b99115f1fcdaccb12fe77927ac7e2365f1c382793e63e14cfccdf3132571e69b1f07e83327d23fbac2bee4d785d57f2a9c89de9c6fecaa1fce98135bf845b9e2189e2a07e6fee287b0cfcf3bce9525ff5d38927a1bcca9cc1b66ca528ff93d89d338e3f9e182b9c86f31a752ff609d2f847f5f83b5ea31c218137a4f8fac0cc738e10cd6d3b7189f718a2ff88a6f38c339ad05adfcf31d3f7089ab037d42ea356e708b9ff8853bdc6395de6b58c706ad736c1ee823f2de608b146dbcc08e8976f012afb04b3975ec1de853aa2457f749d5c16b1ce00d0ecdf75b1ce1dd11fd1b55d236cef7f8808ff88465b4d02676d03da29f51dd9e513fa28f150c3004246d07002288bfe9e7d45f0712f22635a490d15ef730361e3b389c67aedf2390ea3157e73dc333e9a6f042d13ebc7ed32f6882405d3ee1c678030ee10d6630a76f162c8ee8f37adeb14c0aaa0b3e68b725ac80a2b039a29f630db6e46bc127d5fd45de4b5226b0833d8ea07a445f871ae96dacc218ead08073c835136842eba8be016db830e77a419f21aca143f76c025b9ae7e5813ea35bd5a0731fd1c4877a7f614fde57d085deb7f31ad31dccf54fd087883ab7a88f6baabb45fdf760003707fa09ddd826f66048af1826f00a0bb3aa7009b73082bb03fd2faeffa7fff58cfffcbcfffdfbc93f7f7d62d7 789ccdd14b6f82401007f03b9f82c8cd343e1050d2f423b4e9b149d3c3ec0316155141c534fdee6566565dfa3836e984c3fef8ef0c6c763cf45f9e1ffde1d8ab1b680ae94b037b7fa80e65797e7d7b78f70661e4e333f7a7833b6f30f2a5ff546d34ae45b70e2654c8009984b3c98c76e6c8542ed45c20374888d2297379e16286dc13651a331bcb9479be927a355244306516440531737b611a21d796c02c913206cd3c12950899ca324925d2586a20d64815cb44d0e68ca825300f572a6485d489d4cc155385cc1d51ab44c6c89325305b649674c388929875c3a81798587423bfd4ffce02ae9f321b05e064c216700927bbbc03904aea2cef67b9c9b3a20b2832b74cf4abdb76cd6e03edc79c3e1a6896ab358d2c57c2e91b75309b6acbd16e5f0bf77b60f2aab051d375b9ff29f283a6e8786a6afc153703dd1e316ccf1819d13b5fab28a22ee39eefdb097b7d23f85a7f74ef1ff7de270e8c1307 789ccd924f4bc43010c5effd14a1b915716d690b41fc088a47413cbc4c66da1e5661773d88f8ddcd6457fb4f612f826f5a985f5f2779906c0af3707f6b8a4db63fe03090a11e3b5384d7edf6edf1e9e63dcbabdac4a72c4d995f64f9a52173f7f2ccdadbd8dbab24c5a0d8566dd3568a5d424484229dd01dd12b3a72ce91627fc270c44111b50ba815459102310545560c0d716814a1284929e12f3ac3b34b8d9e053c801822556cedc463cfc21d75242c04168bd113af1fe34cfc254078eafde95ccab998138c92c51ccf6bbe5fef87ef77b91f668bae727ed52ae77f995b9f3b26f7050b9d79977ef63eaeb34f655ae4ab 789c9592dd4ac4301046effb14a1bd2bb2dbbf0d1b161f41f152102f2693364db7aba0eb8588ef6e66a2b46957c17c25f4f07198a4749b8bfbbb1b916f93d7339c1d0aece145e4e6ed747a7f78bcfe48d2aa11fe29fd935e25e946a0b87d7e6ae91dfc7b56f022cc18f705167bc281b02eeb425684474655a304c2965056b20c6dc708d284d610aa4695aa21ec195119858423a136bad586d012e20e2bdc113a46832d72ab093bd9559d2444465e7c9d5f56e83288a2675da6fd088d6dc741fd5d7207687bebac2f68d70e70ee39e3acf30eed68ffeff1bca5e734fec42e3d3bcf729e99b29a87b0fa00d339b3e1388f77675e540db1379d94127b38663e2e442f3c3755e3ca73e0569e0e87bee86dc2f08b1e2fefc1544e1e2d88aeb0f0161f6deec557f7d9fcf90f7e1e922f014afca9 789ccd92cd4e84301080ef3c45436fc4ec02b62c89d947d07834311efa43293f75135d0fc6f8ee7686768545eece70e8972fedd0ceec33f2f4784fb27df27e16e74e1165c51bc9f487739fcf2fc7af242d19f15fc14991de24e98e28f2707a6d602dfc9ae6188014b1ce555e035a40c1a21d1055b4065032aeb900ec1135630cabb41356ba423b022ace735e022a447de0875b400da8795dd4880d62234bc9003bc0a6125c204a405399d254800e11036fb71133474548b972fe9f424679715435a69dd206191d555d3f58cc7e0c32b899fa95935ba88b44e76bcd959758139dd066a1ec6006e1e2be76a9ecbfddb7793f49edb8f52e5772f99e0b79dd0790ed56ff40c643577df7727b5e76d285fc63ced633f87d97fc00e344ff11 789c8dd2418f9a4014c0f1bb9f82c8cd34aeb240304d0feaa2a0e0eaad49d3c330f3586557049511b6e9772f6f6660d56e9382077ef9cf431c7ce869dfd7a1d67be89ccee4bca31add92a3d663c57e5ffdf8f9ed57a76b985afd312d6dd8fdd2e9f635aaad0e29e0b55e5feb03712089a033a00307b9459ac4a49681ac90b6610f4726b21424361b51e40ae93c3aaa3e2b5ace23920a460e7322e40b72648e86442c3e0ad2d188885b458a2c1275892426194a9e14ad882103414a805ac80219999121b96e29167b8ab66422c8222299376462962b82e446921a923e925a0d172dc5c6868ab6ac714b51c782aca1ab4824e70dc1469e15413ee4a5a15c9c35948b01c92c6648beb7148b678ab6e4932030f5bd694359278a20b943820d462ceefca6684b1e5ac6c8bd607d484e91b11dabd9d796a232417188ffe73f8eff6c3a516744d96d233ac4ea7cd9eaecba11d825af6ffbf400bb2c3f9e74766e1b2978029714ca0ae22c79c7d834023c19c7e965529531f0b88e64faa49abe2bc649e6ceb209a417e073ef54c78f39cfcf337f56953071c177bd457dd376cef75c3f73cbaa9ef4812fbcabb971c13d9703cec1cc8565d0cef589cfebb8e065553f50367183653bd7d7b382170bafacea08936c86a9fded22726fce214cbd70b97a66577ba6938017319f8770093d82e97aaf4990afe3a438d5db3d6577efa1deee7cbdc130fde4fd9160a337e17e2ec8e5cbf9a4e9b7e9e6bddfa5abf657bafa7df9f92e7d3436bd4ffdeeefaf9d3f43095280 789c7d91c94ec3301040eff90a2bbe45a8cdd2468d109f00e28884387866bce45090a01c10e2dff14cdc36699ada91e3e7e7f1785917eae5f95115ebeceb600e3d2a0ce65315f4bddfffbcbe3dfc6679bd51f1ab2a55e57759be52a89e3ede2df729f675298511047725963b46c3d8544dd9d68c5ab06bb0358c8eb1db74156e19bd207684c4888cb8c5dab58c5690d03ac718185deb92ed05a5c80e17ca85d3379c811b7108571d0181b10ee60ec822577f964707f1483e55081307e8672ab941713e519c99fae4c8cafc3e688902e731fec52525e7e396bcb3c7385e72c8a2a5bd8c8bf3e2a0496a1e074e8f548a1bf615074decf14178c9c1f5812b9c4e38a8d17d9e951dd4c8719cdca8a57433a37788d21ac93cbdcf245173e6ab6f1bc09cc4ecdd830e8b6e1596e3a625ffbbcffe01a5ccd790 789cc590b10ac2301086f73c4568b622ad160d88f8088aa3200e973f151daaa07510f1ddedc5749026585dfcb9e13e3e725c2e4fe57ab590692e2e35d50748ece92c537badaadb663bbf8ba418cba6b41c250391641272793a96dc53d3aba10ba362d4859ee882d1b6380523186151c2321ac69d8b1b1bc967a77c8802ceb810999023028854cc351573fc929d7de5dd21eee05d77261075f01f0cb8ccb4f9ed662ae4fc447cbb674fd7bd4b3ff7c79b3d66e209ee38b289 789c8d924b0ac2301040f73d45687745acfd180ce211149782b8984e5a745105ad0b11ef6e27a0cda40d346491c7e3913649128bc37e2be22478b4d05e50e019ee22d6cfa6791d4f9b77106685e8e64aa4e12c08e702c5ee76ad680ddd3acad37c2133c2c8a0ca51022112ca4ca6aa20ac0c82d40a0935a12a548a4bc2d2202a8d9ab026accd309b7ac6341781df4189fe4e57e07350bad2ee4ae492775c3a1d936e67cb4167c961d7cbb1aeaebdfbfdd4c877fed5f0ff7a3538174bb9e7692bde71c53a47b17b77147b2f8e9af89646dc671d7c01f957b3b8 789ca5d2bb4ec33014c6f13d4f61355b855a7269520bf108204624c4601fc775aebda50342bc3b3d2706f94430d5e9909ffef93aa45d2fc5ebcb9358aea3f3a8c61a043875124b73e9fb8fb7f7c7cf6891e6023f99481677d16225403cef870aefd5f53ece92ecbe48913151665028a441166991c81cb9439659e96989ba9412900eb9cdb689a27af925d59aa8b77262eb69343ddc20652e37da20474f39f144849f7af6f4b5f334b0410e4895ab64624f04a5801ede2375ae5343f5e859187a1b07a2d16a22206103a92d909a68a0b21659212d1d7aabff9c1b5bac6657d0940676992ad881dd395bbba6ed9a7ed8f77115ee583a28b66369b663e9c8772c0d7cc752cf772c9df82e4ce78eef586af92ef8c2ae6df82e5c358eefc295abf9cea78692e5bb298dd774a9ad633b33fbfd82b6aae6e7f6ffcbdfedeb21fa06f2ea1002 789ced92bf0ac23010c6f73c4568b722ad696b30888fa0380ae270b94bd0a10a5a0711dfdd5c74b0fe998a9b97c07dbf7cf7714b8a4c2e17339915e2d842bb45891b38c88c4e4d735eada7179194b50c772c553210492e51cef73bc73a0d3aad5435d425234434156a60748cbad4cad48c3e226832c868194d6d148e1831221a426224461f2b2efd527dbd14c261c11dba1e58b4483c14baa56e2e3c397a0c797acb797a1efae77e96f3cedf73a1bfe472e2ea88deffe5a3779d881b0169c03a 789ca591cd0a82401080ef3ec5a23709cb9f9696e8118a8e4174186756ea5041d921a2776f674b931a2fb50aeec7b71fbbea3056abe55cc5c3e05c43bd43855b38a9982efbfd75bd99dd82302b94bb272a0d07419828548be3c1f23c72f3284ff391ce18c1a3c9510363c5a8339d9a82d17a044d06194b46539814c78ce8110d21311263e587dfb467fce92270579280e4a0c4122989acd43955915b62e5ce122f81fe0e2be8efec5b7e776f2974ad94ba46ca1d51ef7e4f259ef3a5a4f76b94f05d5af5d575d467d7556dc747775d57b5ff9d78b887f0ffc4f1b3bb4f83079b5ebf1a 789cad914d0ac2301046f739456876455ad3d660108fa0b814c4453249d14515b42e44bcbb9958a1b4890b71da42debc7ce4a7794ab79b154d73726d557b040a0775a1a9b935cd7db75f3e485254d4bd73ca930949320a747d3e591c333766252fa7a240541e65094221d688a2105c5688d6a31246022220ca4a7298211a8f200d18448d58fbf28b46ea4f8ee1a7dc33764ce92c53e0b6a5878e59e67acca97ae898a93f393b706e7e2ce75be19c57e1dc5b05739d8ae550c5d6b3d15c27a3e78be7bc8ce5bede67ef3f8c734eea6e530197614f63055cbf7e76cf0579012086bb3d 789cadd35b6fa2401806e07b7f05e9dc359bad28a064b317b5b567ab3d1f367b31c78a8a50414537fbdf976fbe195269f6ae8c313c797dbf01c5837de7793470f60f1a594ef3883b7c4c17cebe58c6f1e6d7ef9f7f1a7b2dcf295f7ee0b87bdf1a7bdf1dee5c277309e7a43c276db7dd0c5a400af4dc36efb48102e9359167409ffa7e87014f8141cb175d9d5e68d2c0efeaf4dc300c3de095a1405e033b6dcb39b2e3861ce85a529d9e18fa985e6ab24e88e991a1400e80ddb66513d935a3b615f5a8a5a18f7cd76496cf8621726cc9f4a899a1401e0343cfb28f0c5de4baa20066863ef250935bbe59721f38350c315d58622a0d05320652cf7283a42eb257518f9a18fac842935b268614995b0a3deac6502215907996af15f563f680642d4cd38a3a5d1906c891a6b01c1a5264642903e01d90fbbc857cd4149c2acd5b43897c010a5fb490f7868152c027a02c774572a00a94f930d3d487fe13fde7f89a8c50c2382ddf3f658248f546042cbe9b113a8e26d3593c871efb9809f296a4ef8b599ce5725cf6589511ba5cc5eb65d9ca0aa936ab2ddd329391c35e7e74bc3c1cc7fd62aa36691225eb72acce60874f8b63c6191127a767e7a7f38bcbabc1f5e04a94b7c2aa6b21d172d1ef4df372372593da750e7b52f54649741325e966f7fec8ed14a2613e9ca432aff5eed444b78a34ceb35aef7e534665eb41167d59eb3dead6248d8b753cabf59e8a28194d14b49eb35aef0506be96513cce9a3b3d4adcfab7f2e137e26c777dd9f352cbfefe68fc0387d37011 789c7dd2cb6e9b401406e0bd9f02999d5525068301555de47eb5d565a5aa8b33671863e34b32b6933855dfbd9c9fb11bdba11c167cfc0c733ded783fbe0fbcce696bb9a2d5983d2ec87a1dbd9ecd363f7f7dfbdd6a879157dd51e805ed2fadf689c7de7031cfe599aa67bf8b4be883464a5808131da71409afc13cce6aae8469106b4a8425982521a5c27390933e91f002d41595f04d987593aec290368e41cd3b304842150a27424aa8ab7ac21730cb5285413e38668c293c839451cd7b5055c49f0d68285318f354a80222c5c22730a41ef78533b04711e3e34730a2b8e6084c544f6125196495722cd4428e3960a44b9039d499702cd489ee692dccc1ac7a01be83a4bb397ef50a2a1de418d55c98abbc6f30a301c85b5e0a4ddf4406bb70eb18d7548e5509cfc0a44a31aa05c84619acc6d0910d4675036a29e1d58e98e01acca58416c48523d7707dc87c72a58e329fb5ab6db8cb7ccecda8aec285dbcce7f1a42c5093a90b5df621fa17d6d95eb40b91557d219acd17f32784e813196923d1b35dae96eb17094d4976db6e242f5eed5bb9b1eff2d951bb337b5e5cd8cb4fdb5dd9a2bcb637ff6977dbd0dfa6bc6be8ef1ee37c386a87f93d0e8683d9c1fc945f4c9bd6e520dc5fcfbdf0701f241c35ed9f84db9f1eed7b15369f9713655d7d72ce8ecfe09fafadbf07b15f0a 789ccd92cf4e84301087ef3c45436fc4ec2ecb6221c647d07834311ea653cadf6aa2ebc118df5d6628088bdc9d1f09fdf8326d4abb8fc4e3c39d88f6c1fb19ce350aace04d44e6c3b9cfa7e7dbaf203c9e44ffc4a988c3ab20dc0914f7af2f058da11fcb0317a164b414c28a5099348313614b98e5ea08196143080a0e3a21b48c1672ad083b421d0368242c19954e34af8b8ca8334c090d21a61823db9ad0289318435830e6fd07464d68af29848e918b77b7513327c147af9c44e333cac9492c6c39a4f2727412eba6ad384de7a57733f52b07b7509364d7afc5caf535485e931d18eb3b9c1bdeb60537f6957e3adf57fddbbe697fdc39db9f9655b7f55f2ee4f27f2ee4e539902cb7ce8fe438e9eadc7bb97d5f76daf9fc71cfd677f0fb26f8011fed0209 789c75d2d96eda401406e07b9ec2c277519560833d1e55bd70f60d42f64a552f666587842509a9faee9df38f4903c43e91c2e7dfc7e333f6de4ef0b3dd0c76f62ab3b998f754a0ba621aece8c568b4fcf5fbc79f4a356e04ee2f8982a8faad52dd0d54d09a8c0dfd16ee7758c3410c414b45ec12994e32d1203e8226e12221ce419b08cf036216275630e215c8d34c28e2c093c522232e41990a81c778031573f722be1279c46219136fc08465120b9d802cabfb74441431af49f49e838d4c4a8cd00799a8c93af116e4bca6c0a3825c61fc1668385329d18256708989864419092131d105988a4c71620764b22e31d10b2885519af8002a611552e52933858966a095b1c2336ba24a54e42f1e83424a8d01f789baa698c663bc8391ca3416ea814cd73d0dc8dd09b00d2a9d1aacbb209a446b835b4dc1545b838baf416662cf53501966b1edc7a036dc73021a233def8836b589c5eb96055d112fc1cc1113dd17649e8720772724f11914ee04f804bacdb278e626a8a98867a071c4d6e5200e7cf925c7a72c1445c9ad2c54baa855f89185cad88eaf6e11aeb250f5fa832eaa3f2cc222fb14fd0f7db6167d84c8dc5a2e1a8d274fcfd3d99c42ac894c68eb4e2c5e5edf96eff93e75da81c8577d9dd5ed0ef243fabfd9873aca8fcbfa4e4ecfce4bfa2e2e9badc1977d57edfcfac65fb4d9777b77fff058acbbd6e7e6cb8b637d3e19768765fbb211aeefe75ab8f91e28ec94bd3f0a5737dd7aef2e2cff5e76655ed417dfd9f637f8f77be51f9cbf7c0e 789c75d2d96eda401406e07b9ec2c277a84ab0c1635b552fb2930408d92b55bd38b3b1938425c9a4eabbd7e7b74943887d90ec8fdf33e359766bdecf5ec7abed56164b5a0e95a70634f76a7a359dba5fbf7ffca954c3a697fda2c00baadf2ad51d4f79dd8799e167ca9efd3a2ea60f5a2ee68019eb28a126f39c99d423458279000691a698b9078691c9d9029b22a084790f4622a494f9020ad120628ec1340ef39717a014449a79022a2109df7c01ea5890643e178c737699a9494209ae409b34724e99142442a2e72bb09990c47c47604c75d9605ad0522a31a3095306445231fb602c1b125fa540251315310f412b43859e4f992a9042630b7a609831646a3052814257afa09052a3ab3b90545d6371e64c1daa54e3e523b0a994c6404330d60d8d091a30cdfe003ba0d29141cfcb8222e70cd419b1bf97a0d589c1f4af9926d4da60cbcec0a636060bfb06c6263418e816544658ccf718b446592cec13d3d633e25c495070311fc0d8461603ed8364538b81daefc42edc80d942e77c04b555169fe1405c38f925d787cca7a2e456e62b5dd43a7ccf7c656c3faf4111ae335f0d47e3016a3429c222fb10fd0ff36c237a0f91656371349d3d3c3ecd171c624c64a42dbfbf5c3dbfbcba376e69c7e4d6edfaebeef6dc3edfb7da657570e88e4ada39e78e4fcadab54edd59e978e7aefd65bb4ef7a2d573975bed787e57d7ed9bdbbbfbcdf9497f30295b974fe1e67a6e849ff781c37ed9fe71b8ee746bdfb3b0fcbcec4857d417e76cfb0cfefd5ef907aa8d7f36 789c7592db6e82401086ef790a2277a6f100e2429a3e429b5e36697ab13bcb8220ae0a6a9aa6ef5ee607ada8ec70b1df7eccec713a763fde5fddf1d4a96a59afc8a54ceeddb13e94e5f7e7d7cb8f33f2172e7fa13b1f3d39a3894bee9bdd24dc974ddf9ba1317a40c3c198310a1d4672c1583046b1f065c4b80726cb4421f7c018072254f8f9048c0529c178044aa115722b46398b42458c3950c8990a18b7c02832e433964013c78452a64519b795d78c6a2e655b2a050a15286c9080a4220a193523853427d815a3163ad09a3101c6cd0070c39898840c56b563347e733628550317cd0096a1804b0e460b44c3990fb42be7c92ed49df34877719617e75162d236b24e9e9d47abbcc810f9ba939dbb52ffb2753d759170cd5cad2a37d642624e38a90dd476b7b7163d53487bce4b79a0aa0f459b97dde61deb53910de4d55533389067bbf670be6c380ff168bebc9777b53fe565eba173b991fdf3ecc9db7b60990edd1fcb73d1bb7b6fe4f07b9928dbc5837776ff067f9f9d3f628e2590 789c75d2c96ee2401006e03b4f61e11b1a25d8d86e5ba339907d03cd71a4680ed51b66694858929068de7d5cbf8d1382e9e2e04f3fe5de7cdaf1fefc1e789dd3d66a4debb1f2544e4bafa337ce6d1ffffefa68b5c3c82b7e51e805ed1fadf689a7bce1626ef8998a67bf8bc1f441cbc5cc9942c72945cc2168e28c62e6869906b1a684d90793a447c49c82990829652e41121165cc4bd088942473cbcc02a108ab7a012361255675c1a46e1a4bc5bc01835448cd5c834916979c8082bab2c7b4a0a54c0ae68c2903a2f2552350c89ec4bccfa0a24c635e5552a60afb1d305557461ac7a8c158050abd6fa090a9c67eaf41a9028dfdbe3275a8128d83bdaa9869f48e41a17b1a5b5881993206c76e4a1639d25bd0686170ece7158bc3643e300d99c8620b4fa0366443a664da848b79060a1b5b2cf2ae266ef01d4c8b3f239d8364338b2b5b80ca4a8b55dd5754251d88814feec8f892f954953cc87ca5abda8575e62b634765e555b8cb7c359e4c73d464568555f625fa0ccb6c2faa4364c55c1c390c8498131969cbff77aeeeb45372bbbe518ebefab50d7df3c5d3f3b2b16fb5debcbcbab7c63eaead7b6fece3eabbb3c6bef38bcbfe95bb3ee8e3fddddcdedd3f0c86fbfb937e3e3b762edfc2fdf3dc0bbfdf0387a363f7c7e1eea507f75e84c7bf9713e9aa6af8ce0ebfc17f3f5bff015d7b5f11 toolButton6 clicked() editSearch clear() fileExitAction_activated() tsonglistview.h tsetlistview.h tsonglistview.h madman-0.93/designer/multiline_edit.ui0000644000175000001440000000565310053135242017626 0ustar akusers00000000000000 tMultilineEditor tMultilineEditor 0 0 333 223 Form1 unnamed 11 6 label TextLabel1 editText WidgetWidth Layout1 unnamed 0 6 btnOK &OK true btnCancel &Cancel btnCancel clicked() tMultilineEditor reject() btnOK clicked() tMultilineEditor accept() madman-0.93/designer/prefs.ui0000644000175000001440000015630710053135242015741 0ustar akusers00000000000000 tPreferencesDialogBase tPreferencesDialogBase 0 0 569 594 Preferences unnamed tabMain tab &General unnamed layout15 unnamed TextLabel6_2 &Player PlainText comboPlayer comboPlayer layout16 unnamed spacer7 Horizontal Expanding 40 20 btnConfigurePlayer false &Configure Player... Alt+C layout7 unnamed textLabel1 Number of Backups to keep of database files spinBackupCount checkRememberGeometry &Remember main window geometry Alt+R checkScanAtStartup &Automatically scan for new songs at startup This will automatically find newly added songs when madman starts. However, it slows startup by a few seconds. checkCollectHistory Enable Play &History collection Alt+H This controls whether madman will remember all the songs you played, and when, and for how long. checkEnableSystemTrayIcon Enable System &Tray Icon Alt+T layout15 unnamed spacer8 Horizontal Fixed 25 10 checkMinimizeToSystemTray false &Minimize To System Tray Alt+M checkEnablePassivePopupSongAnnouncements Enable &Passive Popup Song Announcements Alt+P spacer6 Vertical Expanding 20 190 tab Auto &DJ unnamed textLabel6 <b>Auto DJ scoring rules</b> layout18 unnamed layout17 unnamed btnNewAutoDJScoringRule image0 Create a new AutoDJ scoring rule btnDeleteAutoDJScoringRule image1 Delete the highlighted scoring rule btnMoveUpAutoDJScoringRule image2 Move the highlighted scoring rule up one position btnMoveDownAutoDJScoringRule image3 Move the highlighted scoring rule down one position btnResetAutoDJScoringRules image4 Reset AutoDJ scoring rules back to default spacer10 Vertical Expanding 20 40 Comment Adjustment Criterion tblAutoDJScoringRules 0 3 SingleRow SpreadSheet labelAutoDJStatus textLabel4_2 On this screen, you can set up which songs you would like AutoDJ to play. Each song is assigned a score that is a sum of the above score adjustments whose criterion the song matches. The higher a song's score, the more often it will be played. RichText tab &Media Directories unnamed lstMediaDirectories Layout10_3 unnamed 0 6 btnAddMediaDirectory &Add btnRemoveMediaDirectory &Remove tab &Plugin Directories unnamed layout25 unnamed lstPluginDirectories Layout10_3_3 unnamed 0 6 btnAddPluginDirectory &Add btnRemovePluginDirectory &Remove layout11 unnamed textLabel2 Plugins found: lstPlugins true groupBox2 Plugin Properties unnamed layout8 unnamed textLabel3 Name lblPluginName <none> textLabel4 Description lblPluginDescription <none> layout9 unnamed spacer2_2 Horizontal Expanding 40 20 btnConfigurePlugin Co&nfigure tab &HTTP server unnamed checkHttpDaemonEnabled &Enable HTTP server Alt+E layout24 unnamed spacer3 Horizontal Fixed 25 31 layout23 unnamed layout13 unnamed textLabel1_2 Listen on &Port Number PlainText spinHttpDaemonPort spinHttpDaemonPort 65535 checkHttpRestrictToLocalhost Restrict access to &localhost Alt+L spacer11_2 Vertical Fixed 20 10 checkHttpDownloadsEnabled Allow &streaming/downloading of music Alt+S checkHttpScriptingEnabled Allow &scripting through web interface Alt+S checkHttpWriteScriptingEnabled &Allow &write-access scripting through web interface Alt+A checkHttpLocalPlayEnabled Allow control of &local player through web interface Alt+L checkHttpBrowsingEnabled Allow &browsing of local song database through web interface Alt+B spacer4 Vertical Expanding 20 160 textLabel1_3 <b>WARNING:</b> Running the web server on a computer connected to the Internet without proper access restriction and/or firewalling may pose a security risk. RichText layout11 unnamed spacer2 Horizontal Expanding 40 20 btnOK &OK Alt+O true btnCancel &Cancel 789ca5d5c96ee3461006e0bb9f4270dd8ca086a44449449083f77ddf1de4d00be9555e64791de4ddd3fcabd8ce78640d829816eccfd5cd22bbaadbdf665a273b9bad996f538f2333ba742d776186ad19ff3418bcfdf9d71fdfa7a6b34e2b7ca759d2caa67f9b9ade1db55c6bebeeb6acc12680127cc104fbfa82cbda455158d781af61139cc3e7705994ae0f0fe0ca24ae8047d1069ead6d1293390b5fc21d93bb0af6eaae97e7b983f3e867b86b7aea79b86ffa1e2fc795da7879de75b80896f88dda6afc0036c16df8315adeef01f6c6ab5fd5a5efc217d1f2fe8b70652a8ddf46cb7a6c8a6de27bf0933af5b21e47b56d122cf7cbe1347a4e9d79579bb05e360b96f55d8b96780ab7eb0bf1f7c63a7e19eed88ee6bf52e75efae31ece6dcf4b7db6e16e88e3fe7c02f7425cfae5a57129f5e9c17ddbd7f90b8dcb14cf877ad922c637d4a644bd08eb6f8d2df47e876a5be27de80c76613ceec7ab6aabf3dfd54ee39d68598f5dd837a663b5d7f81b5cdab294fa2f454b7d257f15c76fa92b8d17b55d122cf38fc52e29517f42ffb82c58c677d569897ad3a33a5397d1e827423fb8b66b6b3c8996fa0e1b57b21ea77027c465fe7db4d47f1fce9b38a7ea8e7a251ae309fdecba31bea3ee96d27f583fd773b9e6a3683c1f61ffb97e182ff7bb52f7f4794ea3d15f84fde28a264e7beabee4e37e34fa89d06fce04cbfc1d75a13e6f5ca1bf08fb27b44751a2ff09f574ae31b7d546e34bd1926fa8b67a3fec07e79dd5f84d638ddfaa9d1afdefca1877ea263e1b2df55c51fb4afa4fd6a38a4ed45585f38e70bef8249ac53ea9d09f84f3d8a7c1e847423ff8cca76a9ce7be1d3daf6e57d2cfd87f3e0f96f32a53772aa93fce1bdff5b91ae787efc5f8ab3aafa43f8cbaabf1eb6889e33cf0fde8bb68e98f67754f8df3d917c1d29fd8ffe1786fbcaeeeabb7d585da464bffe0ff5d382ed48c7a55597dc1185fe14bfef9feb7ebffcf616233ee33718e61cbeed3a79ee526e671ecb9e48acff9822ff94aef42bfc873cd373ce05bbee37b7e08771922979d98e79147fcc4cffcc2affcc6efcdac897966798ee779811779899779855731eb5fef3426cf1aaff3066ff2166ff30eeff21eefcbac09790ef8908ff8984ff894cf38e194336e63d5ed97793a9c73977bdce78298880cb7c992fb78ba9ff390a7922a3aa70bbaa42bbaa61b1ad02ddd4dca43f7f440437aa4113dd133bd84192ff44a6f13f3bcd32ccdd13c2dd022b93063899635fa759e15dea7555aa375daa0c1c7dd26d587366999b6683be458a79d66b43c99fc3e26cf6b789ab04eb44b7bb4dfe44015ea9f6e6c9e17acd3331d10ff50379d31364fbd4e87a12e47748cd124337457982ff29cd029add01925f89b6b66e8efee731e4a7fdca31feff3b1769fcf83cffb5447bbafd76dfc25a3a5a23fafdbaf66eab3fdfdfbd43f7758471d 789ced924b0ac2301040f739c5d0d915b1fe50443c82e25210179349441755d0ba10f1ee7606174943ab07f091451e8f49a06991c376b382bc30b78aaa13031fe90ab9bb97e563b75f3e4d369a40bd6630cc7a26eb03c3fa72f6b2c77a8f0345d48a8e15512f3a55449de85c112551564459f4a0e82d2dfcde10b1ad211161da6c4cdc98142778cb1d73510b07ebb16673e4c89375f673e4bf7d6fe1f76cb4e4198277e790f49f68d0d95e0bf3061d0ccaf3 789ccd92cd4e83401446f73cc5a4b36b4cab150688f111342e4d8c8bf9852950a0c58531bebb733fda82c6aef50e8befe464ee9d99b05eb2e7a707b65c4787410e5e335dca3d5b9ab7a6797f79bdff88169b98d1b761378bab68b1629a3db63b4b9987ccaf518405e16d2821080d612632913b420fb4999529e18e3017b990b01d50e75a61ef1ee872a772c203a18c65ac30d70253996a1c4913aa44251aad4a60aa5203eb80565983b9db233a93112a42bd090b9d2b60ac6363081ba0d0c2e2822dd06a6bd1aa273489492ce64aa03272b4033094c38d6a4287c2335ea83f76fcb2e3925f725c2acd7f77a4cc4cce1c949dc9c9051544588eff7463c3a2f45b5ff1efeea86a5ef966d7f2b98372455daf78dbb55dcf271754e9a1426ef7fd612866fb9cdf8e2ae4c10ec8e779d549911cf3f99c933ae7e97e933ae57ff54f7cde455ffd41e2fc 789cc592cd6ec2300c80ef7d8a08dfd0341834fdd1b447d8b4e3a46987244ea085b694b6a069dabb2f360cc27eceb83de4eb17c789d3c958bc3c3f8af124ea7ad5174698a5da8a310e55f5fefaf6f0118d66b1a0578abbd14d34ba15463c35b5a531f8314c39085784731f4942b820cce22cce91b062d4995631e186309fe57365082d23e6a853c282504925b523ec181395182e3430a242c39391504b2d0def6ac998ea1479c36b46ab2df2644368a6fee1ba2d636212e4429a110d5a9eec189d7136272c0951a2b45ca8664c31755c4831fa33583efe9611d13a5e6acfe83c6684fd01edd4f1ca3b422b6de2781b0da1e3e09eff135773107c844b07ea2c4143e840198493b20ece8ed46209275594ab200f17eb6a4d129c2d8b7ad534413daf362d785594c59655b0cf76d35a0d3ea73baae07cfc53f89cae3faaf0ec879c61f7ad2efa02f510aacb9ec13e543ffa09a1fad9eb50fdba87405defdeff729ff7d1174473ef79 789c7d914d4fc3300c86effd155173abd0d60f34699af809208e488843ecd84d0f0309c60121fe3bb1936dedbaceaed2bc79f2c6f95857e6e5f9d154ebe2ebe00e031a0ceed354fe7bbfff797d7bf82dcaf6dec4af694c53de15e5caa079fa7827e9fbd8b7b5864850e925453a915dddd51b355a95bef31bf5b2c86db36db015d9aba42d218b4491d862cb4a492523b3d220925bce7450a9a13b5c880b666f3007377c085799070f8e18e60c3ca1647f86470648dce784306180fd0c659690d4532495fd9099279d3f04ab2ee01ee35f59467a3e697dcf74f4c992a98ad5f6d217e7c54197d1dc076c4728fbd2bee2a08b3d39882c99d81024e174c28446f7794694d088894f6f947cbe99d13b44484e2b4fef3343b452f9eadb067027307bf760c3225b8565df34cabf5df10f21abd80a btnOK clicked() tPreferencesDialogBase accept() btnCancel clicked() tPreferencesDialogBase reject() checkEnableSystemTrayIcon toggled(bool) checkMinimizeToSystemTray setEnabled(bool) checkHttpDaemonEnabled toggled(bool) spinHttpDaemonPort setEnabled(bool) checkHttpDaemonEnabled toggled(bool) checkHttpDownloadsEnabled setEnabled(bool) checkHttpDaemonEnabled toggled(bool) checkHttpScriptingEnabled setEnabled(bool) checkHttpDaemonEnabled toggled(bool) checkHttpWriteScriptingEnabled setEnabled(bool) checkHttpDaemonEnabled toggled(bool) checkHttpLocalPlayEnabled setEnabled(bool) checkHttpDaemonEnabled toggled(bool) checkHttpBrowsingEnabled setEnabled(bool) checkHttpDaemonEnabled toggled(bool) textLabel1_2 setEnabled(bool) checkHttpDaemonEnabled toggled(bool) checkHttpRestrictToLocalhost setEnabled(bool) tabMain comboPlayer spinBackupCount checkRememberGeometry checkScanAtStartup checkCollectHistory lstMediaDirectories btnAddMediaDirectory btnRemoveMediaDirectory lstPluginDirectories btnAddPluginDirectory btnRemovePluginDirectory lstPlugins btnConfigurePlugin checkHttpDaemonEnabled spinHttpDaemonPort checkHttpDownloadsEnabled checkHttpScriptingEnabled checkHttpWriteScriptingEnabled checkHttpLocalPlayEnabled checkHttpBrowsingEnabled btnOK btnCancel madman-0.93/designer/SConscript0000644000175000001440000000036510053135242016265 0ustar akusers00000000000000Import( "env" ) myenv = env.Copy() myenv.Tool( "qt" ) myenv.Append( CPPPATH = "#" ) myenv.StaticLibrary( target = "madmandesigner", source = [ "mainwin.ui", "prefs.ui", "helpbrowser.ui", "multiline_edit.ui", "about.ui", "auto_tag.ui" ] ) madman-0.93/plugins/0000755000175000001440000000000010053135242014130 5ustar akusers00000000000000madman-0.93/plugins/README0000644000175000001440000001021410053135242015006 0ustar akusers00000000000000------------------------------------------------------------------------------- Writing plugins for madman ------------------------------------------------------------------------------- Before we start, we need to tell madman that this README file is not a plugin, even though it looks like one: MADMAN-THIS-IS-NOT-A-PLUGIN This file documents how to write plugins for madman. madman's plugins are simple executable files (i.e. they may be shell scripts, perl or python scripts or even C programs) that lie around somewhere in madman's plugin path, as set in the plugin path in the preferences dialog. madman's plugins contain their own metadata, i.e. they contain information on how to execute them and all that, so they do not require the user to know what their specific arguments are. Once madman has found them on the path, it knows how to call them from their built-in metadata. In order to find its plugins, madman scans through the plugin path. Each file is opened in turn, and read as a text file. If it is found to contain a line that is of the form ... MADMAN-PLUGIN-VERSION: 2\n (the \n is the end of the line, i.e. the newline character, and both instances of "..." may be any text), it assumes that the file is a plugin and will continue parsing it. Note that madman does not check for executability, if your script is not executable, it will error out at execution time. The leading ... may be any text. Ususally, it will be the shell/perl/python comment character (#) to hide the metadata from the interpreter. The second instance of ... will be parsed as the name for the plugin shown in the configuration dialog. All in all, the following tags exist that may be used analogously to the above: MADMAN-PLUGIN-VERSION: 2 specifies that this is a madman plugin that conforms to version 2 specifications. The previous version did not have a version identifier and used upper case substitution variables. MADMAN-NAME: ... specifies the "name" of the plugin as shown in lists within madman. This should be a brief description. [required] MADMAN-DESCRIPTION: ... is a lengthier description, shown in the preferences dialog once the plugin has been clicked on. [optional] MADMAN-ARGUMENTS: ... specifies the commandline used to call the plugin. [required] madman knows two modes of plugin invocation, "repeat" mode and "single" mode. In repeat mode, the plugin is executed just once for the whole selection. Use of this mode is indicated by specifying a %repeat%...%endrepeat% section that delimits that will be included in the commandline once for every song the plugin is executed on. All regular substitutions (described below) work inside the repeat section, too. In single mode, the plugin is executed once for every song in the selection. Within this commandline, the following symbols have special meaning and will be replaced by their respective values: %ask:Prompt% interactively asks the user for a value that will be substituted into the command line in place of this symbol. %config:Prompt% These values can be configured in the madman preferences dialog. (By selecting a plugin and clicking "Configure" - madman will ask the user for a value for each %CONFIG:...% item and store it in its configuration file.) The configured values are substituted into the command line in place of this symbol. %artist%, %performer%, %title%, %album%, %duration%, %genre%, %file% etc. obvious, see song.cpp (getFieldIdentifier()) for full list. madman takes care of proper quoting so that one %...% argument always corresponds to one argument in the executed plugin. MADMAN-MENUSTRING: ... specifes the descriptive string used in the menu. May contain & characters to specify hotkeys. [defaults to MADMAN-NAME] MADMAN-KEYBOARDSHORTCUT: ... [currently unimplemented] MADMAN-CONFIRM: 0 or 1 specifies whether madman should ask for confirmation before it executes the plugin. [optional, defaults to 0] MADMAN-RESCANAFTER: 0 or 1 specifies whether madman should rescan the media directories for new or deleted songs after the plugin finishes executing. [optional, defaults to 0] madman-0.93/plugins/burn_to_audio_cd0000755000175000001440000000074410053135242017362 0ustar akusers00000000000000#! /bin/bash # MADMAN-PLUGIN-VERSION: 2 # MADMAN-NAME: Burn to an Audio CD # MADMAN-DESCRIPTION: Creates an audio CD containing the songs in K3b. # MADMAN-ARGUMENTS: %repeat% %path%/%file% %endrepeat% # MADMAN-MENUSTRING: Burn to &Audio CD if which k3b > /dev/null ; then if k3b --version | grep "K3b: 0.9"; then k3b --audio "$@" & else # 0.10 onwards k3b --audiocd "$@" & fi else xmessage "K3b was not found. Please install from http://k3b.sourceforge.net" & fi madman-0.93/plugins/burn_to_data_cd0000755000175000001440000000073510053135242017172 0ustar akusers00000000000000#! /bin/bash # MADMAN-PLUGIN-VERSION: 2 # MADMAN-NAME: Burn to a Data CD # MADMAN-DESCRIPTION: Creates a data CD containing the songs in K3b. # MADMAN-ARGUMENTS: %repeat% %path%/%file% %endrepeat% # MADMAN-MENUSTRING: Burn to &Data CD if which k3b > /dev/null ; then if k3b --version | grep "K3b: 0.9"; then k3b --data "$@" & else # 0.10 onwards k3b --datacd "$@" & fi else xmessage "K3b was not found. Please install from http://k3b.sourceforge.net" & fi madman-0.93/plugins/export_m3u0000755000175000001440000000105610053135242016165 0ustar akusers00000000000000#!/bin/bash # MADMAN-PLUGIN-VERSION: 2 # MADMAN-NAME: Export to Playlist (m3u) # MADMAN-DESCRIPTION: Exports files to a m3u (WinAMP) playlist. # MADMAN-ARGUMENTS: %ask:Save playlist as:% %repeat% %duration% %artist% %title% %path%/%file% %endrepeat% # MADMAN-MENUSTRING: E&xport to Playlist (m3u) if [ ! -e "$1" ]; then FILENAME=$1 shift 1 echo "#EXTM3U" > $FILENAME while [ "$4" != "" ]; do echo "#EXTINF:"$1","$2" - "$3 >> $FILENAME echo "$4" >> $FILENAME shift 4 done else xmessage "File already exists, will not overwrite" & fi madman-0.93/plugins/move_to_trash0000755000175000001440000000043310053135242016727 0ustar akusers00000000000000#! /bin/bash # MADMAN-PLUGIN-VERSION: 2 # MADMAN-NAME: Move to Trash # MADMAN-DESCRIPTION: Move files to a configurable trash folder # MADMAN-ARGUMENTS: %path%/%file% %config:Trash folder% # MADMAN-MENUSTRING: &Move to Trash # MADMAN-CONFIRM: 1 # MADMAN-RESCANAFTER: 1 mv "$1" "$2" madman-0.93/plugins/plugin_example0000644000175000001440000000160310053135242017064 0ustar akusers00000000000000#! /bin/bash # MADMAN-PLUGIN-VERSION: 2 # MADMAN-NAME: Example # MADMAN-DESCRIPTION: Simply demonstrates most usable tags in the ARGUMENTS tag # MADMAN-ARGUMENTS: %ask:What do you think?% %config:Configure me% %path%/%file% %artist% %performer% %title% %album% %duration% %genre% %uniqueid% # MADMAN-MENUSTRING: &Example # MADMAN-CONFIRM: 0 # MADMAN-RESCANAFTER: 0 ASK="$1" shift CONFIG="$1" shift FILENAME="$1" shift ARTIST="$1" shift PERFORMER="$1" shift TITLE="$1" shift ALBUM="$1" shift DURATION="$1" shift GENRE="$1" shift UNIQUE_ID="$1" echo "----------------------------------------------" echo "SONG: $FILENAME" echo "----------------------------------------------" echo " ASK: $ASK" echo " CONFIG: $CONFIG" echo " ARTIST: $ARTIST" echo " PERFORMER: $PERFORMER" echo " TITLE: $TITLE" echo " ALBUM: $ALBUM" echo " DURATION: $DURATION" echo " GENRE: $GENRE" echo " UNIQUE ID: $UNIQUE_ID" madman-0.93/SConstruct0000644000175000001440000002164310053135242014507 0ustar akusers00000000000000import os import glob opts = Options( "my_options.py") opts.Add("qt_directory", "Path to Qt directory", "not specified") opts.Add("xmms_config_program", "Path to xmms-config", "not specified") opts.Add("glib_config_program", "Path to glib-config", "not specified") opts.Add("libid3tag_include", "Include path for libid3tag", "not specified") opts.Add("libid3tag_library", "Library path for libid3tag", "not specified") opts.Add("vorbis_include", "Include path for Ogg Vorbis", "not specified") opts.Add("vorbis_library", "Library path for Ogg Vorbis", "not specified") opts.Add("my_cc", "The C Compiler you want to use", "not specified") opts.Add("my_cxx", "The C++ Compiler you want to use", "not specified") opts.Add("prefix", "The root installation path", "/usr/local") opts.Add("add_c_include_dirs", "A comma-separated list of include paths", "not specified") opts.Add("add_lib_dirs", "A comma-separated list of library paths", "not specified") opts.Add(BoolOption("maintainer_mode", "Whether you want to use some special ingredients", 0)) env = Environment( ENV = { 'PATH' : os.environ[ 'PATH' ], 'HOME' : os.environ[ 'HOME' ] # required for distcc }, options = opts) env.Replace(CPPPATH = [], LIBS = [], LIBPATH = [], CPPDEFINES = [], CXXFLAGS = "", CCFLAGS = "") Help(opts.GenerateHelpText(env)) if env["add_c_include_dirs"] != "not specified": env["CPPPATH"] += env["add_c_include_dirs"].split(",") if env["add_lib_dirs"] != "not specified": env["LIBPATH"] += env["add_lib_dirs"].split(",") # Tool functions -------------------------------------------------------------- def RunProgramAndGetResult(commandline): file = os.popen(commandline, "r") result = file.read().rstrip() exit_code = file.close() if exit_code is not None: raise RuntimeError, "Program exited with non-zero exit code." return result def DoWithVariables(variables, prefix, what): saved_variables = { } for name in variables.keys(): saved_variables[ name ] = env[ name ][:] if isinstance(variables[ name ], list): env[ name ].extend(variables[ name ]) else: env[ name ].append(variables[ name ]) result = what() for name in saved_variables.keys(): env[ name ] = saved_variables[ name ] env[ prefix+name ] = variables[ name ] return result def AttemptLinkWithVariables(context, variables, code, extension, prefix): return DoWithVariables(variables, prefix, lambda: context.TryLink(code, extension)) def SplitIncludePath(istring): split_string = istring.split() result = [] for i in split_string: if i[0:2] == "-I": i = i[2:] result.append(i) return result def SplitLibPath(lstring): split_string = lstring.split() result = [] for i in split_string: if i[0:2] == "-L": i = i[2:] result.append(i) return result def SplitLibs(lstring): split_string = lstring.split() result = [] for i in split_string: if i[0:2] == "-l": i = i[2:] result.append(i) return result # My personal checks ---------------------------------------------------------- def CheckForQtAt(context, qtdir): context.Message('Checking for Qt at %s... ' % qtdir) result = AttemptLinkWithVariables(context, { "LIBS": "qt-mt", "LIBPATH": qtdir + '/lib', "CPPPATH": qtdir + '/include' }, """ #include int main(int argc, char **argv) { QApplication qapp(argc, argv); return 0; } """,".cpp","QT_") context.Result(result) return result def CheckForQt(context): potential_qt_dirs = [ "/usr/share/qt3", # Debian unstable "/usr/share/qt", "/usr", "/usr/local", "/usr/lib/qt3" # Suse "/usr/lib/qt" ] if os.environ.has_key('QTDIR'): potential_qt_dirs.insert(0, os.environ[ 'QTDIR' ]) if env[ 'qt_directory' ] != "not specified": potential_qt_dirs.insert(0, env[ 'qt_directory' ]) for i in potential_qt_dirs: if CheckForQtAt(context, i): context.env.Replace(QTDIR = i) return 1 return 0 def CheckForConfigGetterPackage(context, name): context.Message('Checking for %s... ' % name) config_getter = "%s-config" % name if env[ '%s_config_program' % name ] != "not specified": config_getter = env[ '%s_config_program' % name ] uppercase_name = name.upper() try: cflags = RunProgramAndGetResult("%s --cflags" % config_getter) except RuntimeError: context.Result(("*** ERROR *** %s is not on the path or can't be run as expected.\n"+ "Please make sure %s-dev or %s-devel is installed") % (config_getter, name, name)) return 0 try: libs = RunProgramAndGetResult("%s --libs" % config_getter) except RuntimeError: context.Result(("*** ERROR *** %s is not on the path or can't be run as expected.\n"+ "Please make sure %s-dev or %s-devel is installed") % (config_getter, name, name)) return 0 context.env[ uppercase_name + "_CPPPATH" ] = SplitIncludePath(cflags) context.env[ uppercase_name + "_LIBPATH" ] = SplitLibPath(libs) context.env[ uppercase_name + "_LIBS" ] = SplitLibs(libs) context.Result(1) return 1 def CheckForSimpleLibrary(name, header, libraries, call = "main();", language = "C++"): varprefix = name.upper() + "_" vars = { "CPPPATH" : [], "LIBPATH": [] } if env[ "%s_include" % name ] != "not specified": vars[ "CPPPATH" ] = [ env[ "%s_include" % name ] ] if not DoWithVariables(vars, varprefix, lambda: conf.CheckCHeader(header)): print "*** ERROR *** The %s header for the %s package does not seem to be available." % (header, name) print "You may call this build script with %s_include= as an argument to fix this." % name print "Please make sure %s-dev or %s-devel is installed" % (name, name) print "Also check config.log for details on the failure." return 0 if env[ "%s_library" % name ] != "not specified": vars[ "LIBPATH" ] = [ env[ "%s_library" % name ] ] previous_libs = env[ 'LIBS' ] library = libraries[ 0 ] vars[ "LIBS" ] = libraries[ 1: ] if not DoWithVariables(vars, varprefix, lambda: conf.CheckLibWithHeader(library, header, language, call, False)): print "*** ERROR *** The %s library does not seem to be available." % name print "You may call this build script with %s_lib= as an argument to fix this." % name print "Please make sure %s-dev or %s-devel is installed" % (name, name) print "Also check config.log for details on the failure." return 0 env[ varprefix + "LIBS" ] = libraries env[ 'LIBS' ] = previous_libs return 1 def CheckForXmms(context): return CheckForConfigGetterPackage(context, "xmms") def CheckForGlib(context): return CheckForConfigGetterPackage(context, "glib") # Check subroutines ----------------------------------------------------------- def CheckForLibID3Tag(): return CheckForSimpleLibrary("libid3tag", "id3tag.h", [ "id3tag", "z" ]) def CheckForVorbis(): return CheckForSimpleLibrary("vorbis", "vorbis/vorbisfile.h", [ "vorbisfile", "vorbis", "ogg" ]) # Configure ------------------------------------------------------------------- conf = Configure(env, custom_tests = { "CheckForQt" : CheckForQt, "CheckForXmms": CheckForXmms, "CheckForGlib": CheckForGlib, }) if not conf.CheckForQt(): Exit(1) if not conf.CheckForXmms(): Exit(1) if not conf.CheckForGlib(): Exit(1) if not CheckForLibID3Tag(): print "*********************************************************" print "NOTE: madman has switched ID3 libraries, away from id3lib and to libid3tag from Underbit." print "If you are trying to use id3lib and it doesn't work, this is why." print "*********************************************************" Exit(1) if not CheckForVorbis(): Exit(1) env = conf.Finish() # Build! ---------------------------------------------------------------------- Export("env") current_version = file("current-version", "r").read().strip() env[ "CPPDEFINES" ].append(("MADMAN_VERSION", current_version)) env.Replace(CXXSUFFIX = ".cpp") if env[ 'my_cc' ] != "not specified": env.Replace(CC = env[ 'my_cc' ]) if env[ 'my_cxx' ] != "not specified": env.Replace(CXX = env[ 'my_cxx' ]) if env["maintainer_mode"]: print "*** enabling maintainer mode" madman_sources = [] madman_sources.extend(glob.glob("*/*.h")) madman_sources.extend(glob.glob("*/*.cpp")) env.Command("tags", madman_sources, "ctags -R") env[ "CCFLAGS" ] += "-fmessage-length=0 -g -Wall" env[ "CXXFLAGS" ] += "-fmessage-length=0 -g -Wall" env[ "CPPDEFINES" ].append(("MADMAN_DEBUG", "1")) else: env[ "CPPDEFINES" ].append(("NDEBUG", "1")) plugin_list = glob.glob(os.path.join("plugins", "[a-z]*")) plugin_list = filter(lambda x: x.find("example") == -1, plugin_list) env.Install("$prefix/lib/madman/plugins", plugin_list) env.Alias("install", "$prefix/bin") env.Alias("install", "$prefix/lib/madman/plugins") SConscript([ "expat/SConscript", "libapetag/SConscript", "utility/SConscript", "database/SConscript", "httpd/SConscript", "designer/SConscript", "ui/SConscript", "main/SConscript" ])