# HG changeset patch # User Yoshiki Yazawa # Date 1265780012 -32400 # Node ID 52f8e081763deb604f50f8ebdcdcc77dcaa0f0e1 # Parent a201531113ca8c6da4c68b97674c04f347a8f27b add an option to specify the necessary service IDs. patch by Naoya OYAMA , based on the code of tssplitter_lite by querulous. diff -r a201531113ca -r 52f8e081763d recpt1/COPYING --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/recpt1/COPYING Wed Feb 10 14:33:32 2010 +0900 @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. 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 +them 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 prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. 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. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey 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; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If 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 convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU 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 that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + 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. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +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. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + 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 +state 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 3 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, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program 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, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU 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 Lesser General +Public License instead of this License. But first, please read +. diff -r a201531113ca -r 52f8e081763d recpt1/Makefile.in --- a/recpt1/Makefile.in Tue Feb 09 06:27:01 2010 +0900 +++ b/recpt1/Makefile.in Wed Feb 10 14:33:32 2010 +0900 @@ -15,7 +15,7 @@ LIBS = @LIBS@ LDFLAGS = -OBJS = recpt1.o decoder.o mkpath.o +OBJS = recpt1.o decoder.o mkpath.o tssplitter_lite.o OBJS2 = recpt1ctl.o DEPEND = .deps diff -r a201531113ca -r 52f8e081763d recpt1/pt1_dev.h --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/recpt1/pt1_dev.h Wed Feb 10 14:33:32 2010 +0900 @@ -0,0 +1,181 @@ +#ifndef _PT1_DEV_H_ +#define _PT1_DEV_H_ + +char *bsdev[NUM_BSDEV] = { + "/dev/pt1video1", + "/dev/pt1video0", + "/dev/pt1video5", + "/dev/pt1video4", + "/dev/pt1video9", + "/dev/pt1video8", + "/dev/pt1video13", + "/dev/pt1video12" +}; +char *isdb_t_dev[NUM_ISDB_T_DEV] = { + "/dev/pt1video2", + "/dev/pt1video3", + "/dev/pt1video6", + "/dev/pt1video7", + "/dev/pt1video10", + "/dev/pt1video11", + "/dev/pt1video14", + "/dev/pt1video15" +}; + +// 変換テーブル(ISDB-T用) +// 実際にioctl()を行う値の部分はREADMEを参照の事。 +// BS/CSの設定値およびスロット番号は +// http://www5e.biglobe.ne.jp/~kazu_f/digital-sat/index.htmlより取得。 +// + +ISDB_T_FREQ_CONV_TABLE isdb_t_conv_table[] = { + { 0, CHTYPE_SATELLITE, 0, "151"}, /* 151ch：BS朝日 */ + { 0, CHTYPE_SATELLITE, 1, "161"}, /* 161ch：BS-i */ + { 1, CHTYPE_SATELLITE, 0, "191"}, /* 191ch：WOWOW */ + { 1, CHTYPE_SATELLITE, 1, "171"}, /* 171ch：BSジャパン */ + { 4, CHTYPE_SATELLITE, 0, "211"}, /* 211ch：BS11デジタル */ + { 4, CHTYPE_SATELLITE, 1, "200"}, /* 200ch：スターチャンネル */ + { 4, CHTYPE_SATELLITE, 2, "222"}, /* 222ch：TwellV */ + { 6, CHTYPE_SATELLITE, 0, "141"}, /* 141ch：BS日テレ */ + { 6, CHTYPE_SATELLITE, 1, "181"}, /* 181ch：BSフジ */ + { 7, CHTYPE_SATELLITE, 0, "101"}, /* 101ch：NHK衛星第1放送(BS1) */ + { 7, CHTYPE_SATELLITE, 0, "102"}, /* 102ch：NHK衛星第2放送(BS2) */ + { 7, CHTYPE_SATELLITE, 1, "103"}, /* 103ch：NHKハイビジョン(BShi) */ + { 12, CHTYPE_SATELLITE, 0, "CS2"}, /* ND2： + * 237ch：スター・チャンネル プラス + * 239ch：日本映画専門チャンネルHD + * 306ch：フジテレビCSHD */ + { 13, CHTYPE_SATELLITE, 0, "CS4"}, /* ND4： + * 100ch：e2プロモ + * 256ch：J sports ESPN + * 312ch：FOX + * 322ch：スペースシャワーTV + * 331ch：カートゥーンネットワーク + * 194ch：インターローカルTV + * 334ch：トゥーン・ディズニー */ + { 14, CHTYPE_SATELLITE, 0, "CS6"}, /* ND6： + * 221ch：東映チャンネル + * 222ch：衛星劇場 + * 223ch：チャンネルNECO + * 224ch：洋画★シネフィル・イマジカ + * 292ch：時代劇専門チャンネル + * 238ch：スター・チャンネル クラシック + * 310ch：スーパー！ドラマTV + * 311ch：AXN + * 343ch：ナショナルジオグラフィックチャンネル */ + + { 15, CHTYPE_SATELLITE, 0, "CS8"}, /* ND8： + * 055ch：ショップ チャンネル */ + { 16, CHTYPE_SATELLITE, 0, "CS10"}, /* ND10： + * 228ch：ザ・シネマ + * 800ch：スカチャンHD800 + * 801ch：スカチャン801 + * 802ch：スカチャン802 */ + { 17, CHTYPE_SATELLITE, 0, "CS12"}, /* ND12： + * 260ch：ザ・ゴルフ・チャンネル + * 303ch：テレ朝チャンネル + * 323ch：MTV 324ch：大人の音楽専門TV◆ミュージック・エア + * 352ch：朝日ニュースター + * 353ch：BBCワールドニュース + * 354ch：CNNj + * 361ch：ジャスト・アイ インフォメーション */ + { 18, CHTYPE_SATELLITE, 0, "CS14"}, /* ND14： + * 251ch：J sports 1 + * 252ch：J sports 2 + * 253ch：J sports Plus + * 254ch：GAORA + * 255ch：スカイ・Asports＋ */ + { 19, CHTYPE_SATELLITE, 0, "CS16"}, /* ND16： + * 305ch：チャンネル銀河 + * 333ch：アニメシアターX(AT-X) + * 342ch：ヒストリーチャンネル + * 290ch：TAKARAZUKA SKYSTAGE + * 803ch：スカチャン803 + * 804ch：スカチャン804 */ + { 20, CHTYPE_SATELLITE, 0, "CS18"}, /* ND18： + * 240ch：ムービープラスHD + * 262ch：ゴルフネットワーク + * 314ch：LaLa HDHV */ + { 21, CHTYPE_SATELLITE, 0, "CS20"}, /* ND20： + * 258ch：フジテレビ739 + * 302ch：フジテレビ721 + * 332ch：アニマックス + * 340ch：ディスカバリーチャンネル + * 341ch：アニマルプラネット */ + { 22, CHTYPE_SATELLITE, 0, "CS22"}, /* ND22： + * 160ch：C-TBSウェルカムチャンネル + * 161ch：QVC + * 185ch：プライム365.TV + * 293ch：ファミリー劇場 + * 301ch：TBSチャンネル + * 304ch：ディズニー・チャンネル + * 325ch：MUSIC ON! TV + * 330ch：キッズステーション + * 351ch：TBSニュースバード */ + { 23, CHTYPE_SATELLITE, 0, "CS24"}, /* ND24： + * 257ch：日テレG+ + * 291ch：fashiontv + * 300ch：日テレプラス + * 320ch：安らぎの音楽と風景／エコミュージックTV + * 321ch：MusicJapan TV + * 350ch：日テレNEWS24 */ + { 0, CHTYPE_GROUND, 0, "1"}, { 1, CHTYPE_GROUND, 0, "2"}, + { 2, CHTYPE_GROUND, 0, "3"}, { 3, CHTYPE_GROUND, 0, "C13"}, + { 4, CHTYPE_GROUND, 0, "C14"}, { 5, CHTYPE_GROUND, 0, "C15"}, + { 6, CHTYPE_GROUND, 0, "C16"}, { 7, CHTYPE_GROUND, 0, "C17"}, + { 8, CHTYPE_GROUND, 0, "C18"}, { 9, CHTYPE_GROUND, 0, "C19"}, + { 10, CHTYPE_GROUND, 0, "C20"}, { 11, CHTYPE_GROUND, 0, "C21"}, + { 12, CHTYPE_GROUND, 0, "C22"}, { 13, CHTYPE_GROUND, 0, "4"}, + { 14, CHTYPE_GROUND, 0, "5"}, { 15, CHTYPE_GROUND, 0, "6"}, + { 16, CHTYPE_GROUND, 0, "7"}, { 17, CHTYPE_GROUND, 0, "8"}, + { 18, CHTYPE_GROUND, 0, "9"}, { 19, CHTYPE_GROUND, 0, "10"}, + { 20, CHTYPE_GROUND, 0, "11"}, { 21, CHTYPE_GROUND, 0, "12"}, + { 22, CHTYPE_GROUND, 0, "C23"}, { 23, CHTYPE_GROUND, 0, "C24"}, + { 24, CHTYPE_GROUND, 0, "C25"}, { 25, CHTYPE_GROUND, 0, "C26"}, + { 26, CHTYPE_GROUND, 0, "C27"}, { 27, CHTYPE_GROUND, 0, "C28"}, + { 28, CHTYPE_GROUND, 0, "C29"}, { 29, CHTYPE_GROUND, 0, "C30"}, + { 30, CHTYPE_GROUND, 0, "C31"}, { 31, CHTYPE_GROUND, 0, "C32"}, + { 32, CHTYPE_GROUND, 0, "C33"}, { 33, CHTYPE_GROUND, 0, "C34"}, + { 34, CHTYPE_GROUND, 0, "C35"}, { 35, CHTYPE_GROUND, 0, "C36"}, + { 36, CHTYPE_GROUND, 0, "C37"}, { 37, CHTYPE_GROUND, 0, "C38"}, + { 38, CHTYPE_GROUND, 0, "C39"}, { 39, CHTYPE_GROUND, 0, "C40"}, + { 40, CHTYPE_GROUND, 0, "C41"}, { 41, CHTYPE_GROUND, 0, "C42"}, + { 42, CHTYPE_GROUND, 0, "C43"}, { 43, CHTYPE_GROUND, 0, "C44"}, + { 44, CHTYPE_GROUND, 0, "C45"}, { 45, CHTYPE_GROUND, 0, "C46"}, + { 46, CHTYPE_GROUND, 0, "C47"}, { 47, CHTYPE_GROUND, 0, "C48"}, + { 48, CHTYPE_GROUND, 0, "C49"}, { 49, CHTYPE_GROUND, 0, "C50"}, + { 50, CHTYPE_GROUND, 0, "C51"}, { 51, CHTYPE_GROUND, 0, "C52"}, + { 52, CHTYPE_GROUND, 0, "C53"}, { 53, CHTYPE_GROUND, 0, "C54"}, + { 54, CHTYPE_GROUND, 0, "C55"}, { 55, CHTYPE_GROUND, 0, "C56"}, + { 56, CHTYPE_GROUND, 0, "C57"}, { 57, CHTYPE_GROUND, 0, "C58"}, + { 58, CHTYPE_GROUND, 0, "C59"}, { 59, CHTYPE_GROUND, 0, "C60"}, + { 60, CHTYPE_GROUND, 0, "C61"}, { 61, CHTYPE_GROUND, 0, "C62"}, + { 62, CHTYPE_GROUND, 0, "C63"}, { 63, CHTYPE_GROUND, 0, "13"}, + { 64, CHTYPE_GROUND, 0, "14"}, { 65, CHTYPE_GROUND, 0, "15"}, + { 66, CHTYPE_GROUND, 0, "16"}, { 67, CHTYPE_GROUND, 0, "17"}, + { 68, CHTYPE_GROUND, 0, "18"}, { 69, CHTYPE_GROUND, 0, "19"}, + { 70, CHTYPE_GROUND, 0, "20"}, { 71, CHTYPE_GROUND, 0, "21"}, + { 72, CHTYPE_GROUND, 0, "22"}, { 73, CHTYPE_GROUND, 0, "23"}, + { 74, CHTYPE_GROUND, 0, "24"}, { 75, CHTYPE_GROUND, 0, "25"}, + { 76, CHTYPE_GROUND, 0, "26"}, { 77, CHTYPE_GROUND, 0, "27"}, + { 78, CHTYPE_GROUND, 0, "28"}, { 79, CHTYPE_GROUND, 0, "29"}, + { 80, CHTYPE_GROUND, 0, "30"}, { 81, CHTYPE_GROUND, 0, "31"}, + { 82, CHTYPE_GROUND, 0, "32"}, { 83, CHTYPE_GROUND, 0, "33"}, + { 84, CHTYPE_GROUND, 0, "34"}, { 85, CHTYPE_GROUND, 0, "35"}, + { 86, CHTYPE_GROUND, 0, "36"}, { 87, CHTYPE_GROUND, 0, "37"}, + { 88, CHTYPE_GROUND, 0, "38"}, { 89, CHTYPE_GROUND, 0, "39"}, + { 90, CHTYPE_GROUND, 0, "40"}, { 91, CHTYPE_GROUND, 0, "41"}, + { 92, CHTYPE_GROUND, 0, "42"}, { 93, CHTYPE_GROUND, 0, "43"}, + { 94, CHTYPE_GROUND, 0, "44"}, { 95, CHTYPE_GROUND, 0, "45"}, + { 96, CHTYPE_GROUND, 0, "46"}, { 97, CHTYPE_GROUND, 0, "47"}, + { 98, CHTYPE_GROUND, 0, "48"}, { 99, CHTYPE_GROUND, 0, "49"}, + { 100, CHTYPE_GROUND, 0, "50"}, { 101, CHTYPE_GROUND, 0, "51"}, + { 102, CHTYPE_GROUND, 0, "52"}, { 103, CHTYPE_GROUND, 0, "53"}, + { 104, CHTYPE_GROUND, 0, "54"}, { 105, CHTYPE_GROUND, 0, "55"}, + { 106, CHTYPE_GROUND, 0, "56"}, { 107, CHTYPE_GROUND, 0, "57"}, + { 108, CHTYPE_GROUND, 0, "58"}, { 109, CHTYPE_GROUND, 0, "59"}, + { 110, CHTYPE_GROUND, 0, "60"}, { 111, CHTYPE_GROUND, 0, "61"}, + { 112, CHTYPE_GROUND, 0, "62"}, + { 0, 0, 0, NULL} /* terminate */ +}; +#endif diff -r a201531113ca -r 52f8e081763d recpt1/recpt1.c --- a/recpt1/recpt1.c Tue Feb 09 06:27:01 2010 +0900 +++ b/recpt1/recpt1.c Wed Feb 10 14:33:32 2010 +0900 @@ -30,6 +30,8 @@ #include #include +#include "pt1_dev.h" +#include "tssplitter_lite.h" /* maximum write length at once */ #define SIZE_CHANK 1316 @@ -60,6 +62,7 @@ time_t start_time; boolean indefinite; int msqid; + splitter *splitter; } thread_data; typedef struct msgbuf { @@ -288,16 +291,20 @@ thread_data *data = (thread_data *)p; QUEUE_T *p_queue = data->queue; decoder *dec = data->decoder; + splitter *splitter = data->splitter; int wfd = data->wfd; boolean use_b25 = dec ? TRUE : FALSE; boolean use_udp = data->sock_data ? TRUE : FALSE; boolean fileless = FALSE; + boolean use_splitter = splitter ? TRUE : FALSE; int sfd = -1; pthread_t signal_thread = data->signal_thread; struct sockaddr_in *addr = NULL; BUFSZ *qbuf; + BUFSZ splitbuf; ARIB_STD_B25_BUFFER sbuf, dbuf, buf; int code; + int split_select_finish = TSS_ERROR; if(wfd == -1) fileless = TRUE; @@ -321,6 +328,47 @@ buf = sbuf; /* default */ + if ( use_splitter ) + { + /* $BJ,N%BP>](BPID$B$NCj=P(B */ + if ( split_select_finish != TSS_SUCCESS ) + { + split_select_finish = split_select(splitter, &sbuf); + if ( split_select_finish == TSS_NULL ) + { + /* malloc$B%(%i!](BPID$B$,40A4$KCj=P$G$-$k$^$G=PNO$7$J$$(B + * 1$BICDxEYM>M5$r8+$k$H$$$$$+$b(B + */ + free(qbuf); + qbuf = NULL; + continue; + } + } + /* $BJ,N%BP>]0J30$r$U$k$$Mn$H$9(B */ + code = split_ts(splitter, &sbuf, &splitbuf); + if ( code != TSS_SUCCESS ) + { + free(qbuf); + qbuf = NULL; + continue; + } + /* $BJ,N%7k2L$,%<%m%P%$%H$G$"$k>l9g$K$O(Bb25$B$K2s$5$J$$(B */ + if ( splitbuf.size == 0 ) + { + free(qbuf); + qbuf = NULL; + continue; + } + sbuf.data = splitbuf.buffer; + sbuf.size = splitbuf.size; + buf = sbuf; + } + if(use_b25) { code = b25_decode(dec, &sbuf, &dbuf); if(code < 0) { @@ -367,13 +415,34 @@ } } - free(qbuf); + if ( qbuf != NULL ) { + free(qbuf); + qbuf = NULL; + } /* normal exit */ if((f_exit && !p_queue->num_used) || file_err) { buf = sbuf; /* default */ + if ( use_splitter ) + { + /* $BJ,N%BP>]0J30$r$U$k$$Mn$H$9(B */ + code = split_ts(splitter, &sbuf, &splitbuf); + if ( code != TSS_SUCCESS ) + { + break; + } + /* $BJ,N%7k2L$,%<%m%P%$%H$G$"$k>l9g$K$O(Bb25$B$K2s$5$J$$(B */ + if ( splitbuf.size == 0 ) + { + break; + } + sbuf.data = splitbuf.buffer; + sbuf.size = splitbuf.size; + buf = sbuf; + } + if(use_b25) { code = b25_finish(dec, &sbuf, &dbuf); if(code < 0) @@ -416,9 +485,9 @@ show_usage(char *cmd) { #ifdef HAVE_LIBARIB25 - fprintf(stderr, "Usage: \n%s [--b25 [--round N] [--strip] [--EMM]] [--udp [--addr hostname --port portnumber]] [--device devicefile] [--lnb voltage] channel rectime destfile\n", cmd); + fprintf(stderr, "Usage: \n%s [--b25 [--round N] [--strip] [--EMM]] [--udp [--addr hostname --port portnumber]] [--device devicefile] [--lnb voltage] [--split SID1,SID2] channel rectime destfile\n", cmd); #else - fprintf(stderr, "Usage: \n%s [--strip] [--EMM]] [--udp [--addr hostname --port portnumber]] [--device devicefile] [--lnb voltage] channel rectime destfile\n", cmd); + fprintf(stderr, "Usage: \n%s [--strip] [--EMM]] [--udp [--addr hostname --port portnumber]] [--device devicefile] [--lnb voltage] [--split SID1,SID2] channel rectime destfile\n", cmd); #endif fprintf(stderr, "\n"); fprintf(stderr, "Remarks:\n"); @@ -441,6 +510,7 @@ fprintf(stderr, " --port portnumber: Port number to connect\n"); fprintf(stderr, "--device devicefile: Specify devicefile to use\n"); fprintf(stderr, "--lnb voltage: Specify LNB voltage (0, 11, 15)\n"); + fprintf(stderr, "--split SID1,SID2...,SIDN: Specify SID number in CSV format(100,101,102,...)\n"); fprintf(stderr, "--help: Show this help\n"); fprintf(stderr, "--version: Show version\n"); fprintf(stderr, "--list: Show channel list\n"); @@ -795,6 +865,7 @@ QUEUE_T *p_queue = create_queue(MAX_QUEUE); BUFSZ *bufptr; decoder *dec = NULL; + splitter *splitter = NULL; static thread_data tdata; decoder_options dopt = { 4, /* round */ @@ -824,6 +895,7 @@ { "help", 0, NULL, 'h'}, { "version", 0, NULL, 'v'}, { "list", 0, NULL, 'l'}, + { "split", 1, NULL, 'i'}, {0, 0, NULL, 0} /* terminate */ }; @@ -831,12 +903,14 @@ boolean use_udp = FALSE; boolean fileless = FALSE; boolean use_stdout = FALSE; + boolean use_splitter = FALSE; char *host_to = NULL; int port_to = 1234; sock_data *sockdata = NULL; char *device = NULL; int val; char *voltage[] = {"0V", "11V", "15V"}; + char *sid_list = NULL; while((result = getopt_long(argc, argv, "br:smn:ua:p:d:hvl", long_options, &option_index)) != -1) { @@ -910,6 +984,10 @@ device = optarg; fprintf(stderr, "using device: %s\n", device); break; + case 'i': + use_splitter = TRUE; + sid_list = optarg; + break; } } @@ -970,6 +1048,16 @@ use_b25 = 0; } } + /* initialize splitter */ + if(use_splitter) + { + splitter = split_startup(sid_list); + if ( splitter->sid_list == NULL ) + { + fprintf(stderr, "Cannot start TS splitter\n"); + return(1); + } + } /* initialize udp connection */ if(use_udp) { @@ -1003,6 +1091,7 @@ /* prepare thread data */ tdata.queue = p_queue; tdata.decoder = dec; + tdata.splitter = splitter; tdata.sock_data = sockdata; /* spawn signal handler thread */ @@ -1109,6 +1198,9 @@ if(use_b25) { b25_shutdown(dec); } + if(use_splitter) { + split_shutdown(splitter); + } return 0; } diff -r a201531113ca -r 52f8e081763d recpt1/recpt1.h --- a/recpt1/recpt1.h Tue Feb 09 06:27:01 2010 +0900 +++ b/recpt1/recpt1.h Wed Feb 10 14:33:32 2010 +0900 @@ -3,32 +3,11 @@ #define NUM_BSDEV 8 #define NUM_ISDB_T_DEV 8 - -char *bsdev[NUM_BSDEV] = { - "/dev/pt1video1", - "/dev/pt1video0", - "/dev/pt1video5", - "/dev/pt1video4", - "/dev/pt1video9", - "/dev/pt1video8", - "/dev/pt1video13", - "/dev/pt1video12" -}; -char *isdb_t_dev[NUM_ISDB_T_DEV] = { - "/dev/pt1video2", - "/dev/pt1video3", - "/dev/pt1video6", - "/dev/pt1video7", - "/dev/pt1video10", - "/dev/pt1video11", - "/dev/pt1video14", - "/dev/pt1video15" -}; - #define CHTYPE_SATELLITE 0 /* satellite digital */ #define CHTYPE_GROUND 1 /* terrestrial digital */ #define MAX_QUEUE 8192 -#define MAX_READ_SIZE (1024 * 16) +//#define MAX_READ_SIZE (1024 * 16) +#define MAX_READ_SIZE (188 * 87) /* 188*87=16356 splitterが188アライメントを期待しているのでこの数字とする*/ #define WRITE_SIZE (1024 * 1024 * 2) #define TRUE 1 #define FALSE 0 @@ -57,164 +36,4 @@ char *parm_freq; // パラメータで受ける値 } ISDB_T_FREQ_CONV_TABLE; -// 変換テーブル(ISDB-T用) -// 実際にioctl()を行う値の部分はREADMEを参照の事。 -// BS/CSの設定値およびスロット番号は -// http://www5e.biglobe.ne.jp/~kazu_f/digital-sat/index.htmlより取得。 -// - -ISDB_T_FREQ_CONV_TABLE isdb_t_conv_table[] = { - { 0, CHTYPE_SATELLITE, 0, "151"}, /* 151ch：BS朝日 */ - { 0, CHTYPE_SATELLITE, 1, "161"}, /* 161ch：BS-TBS */ - { 1, CHTYPE_SATELLITE, 0, "191"}, /* 191ch：WOWOW */ - { 1, CHTYPE_SATELLITE, 0, "192"}, /* 191ch：WOWOW2 */ - { 1, CHTYPE_SATELLITE, 0, "193"}, /* 191ch：WOWOW3 */ - { 1, CHTYPE_SATELLITE, 1, "171"}, /* 171ch：BSジャパン */ - { 4, CHTYPE_SATELLITE, 0, "211"}, /* 211ch：BS11デジタル */ - { 4, CHTYPE_SATELLITE, 1, "200"}, /* 200ch：スターチャンネル */ - { 4, CHTYPE_SATELLITE, 2, "222"}, /* 222ch：TwellV */ - { 6, CHTYPE_SATELLITE, 0, "141"}, /* 141ch：BS日テレ */ - { 6, CHTYPE_SATELLITE, 1, "181"}, /* 181ch：BSフジ */ - { 7, CHTYPE_SATELLITE, 0, "101"}, /* 101ch：NHK衛星第1放送(BS1) */ - { 7, CHTYPE_SATELLITE, 0, "102"}, /* 102ch：NHK衛星第2放送(BS2) */ - { 7, CHTYPE_SATELLITE, 1, "103"}, /* 103ch：NHKハイビジョン(BShi) */ - { 7, CHTYPE_SATELLITE, 1, "104"}, /* 104ch：NHKハイビジョン(BShi)臨時*/ - { 12, CHTYPE_SATELLITE, 0, "CS2"}, /* ND2： - * 237ch：スター・チャンネル プラス - * 239ch：日本映画専門チャンネルHD - * 306ch：フジテレビCSHD */ - { 13, CHTYPE_SATELLITE, 0, "CS4"}, /* ND4： - * 100ch：e2プロモ - * 256ch：J sports ESPN - * 312ch：FOX - * 322ch：スペースシャワーTV - * 331ch：カートゥーンネットワーク - * 194ch：インターローカルTV - * 334ch：トゥーン・ディズニー */ - { 14, CHTYPE_SATELLITE, 0, "CS6"}, /* ND6： - * 221ch：東映チャンネル - * 222ch：衛星劇場 - * 223ch：チャンネルNECO - * 224ch：洋画★シネフィル・イマジカ - * 292ch：時代劇専門チャンネル - * 238ch：スター・チャンネル クラシック - * 310ch：スーパー！ドラマTV - * 311ch：AXN - * 343ch：ナショナルジオグラフィックチャンネル */ - - { 15, CHTYPE_SATELLITE, 0, "CS8"}, /* ND8： - * 055ch：ショップ チャンネル */ - { 16, CHTYPE_SATELLITE, 0, "CS10"}, /* ND10： - * 228ch：ザ・シネマ - * 800ch：スカチャンHD800 - * 801ch：スカチャン801 - * 802ch：スカチャン802 */ - { 17, CHTYPE_SATELLITE, 0, "CS12"}, /* ND12： - * 260ch：ザ・ゴルフ・チャンネル - * 303ch：テレ朝チャンネル - * 323ch：MTV 324ch：大人の音楽専門TV◆ミュージック・エア - * 352ch：朝日ニュースター - * 353ch：BBCワールドニュース - * 354ch：CNNj - * 361ch：ジャスト・アイ インフォメーション */ - { 18, CHTYPE_SATELLITE, 0, "CS14"}, /* ND14： - * 251ch：J sports 1 - * 252ch：J sports 2 - * 253ch：J sports Plus - * 254ch：GAORA - * 255ch：スカイ・Asports＋ */ - { 19, CHTYPE_SATELLITE, 0, "CS16"}, /* ND16： - * 305ch：チャンネル銀河 - * 333ch：アニメシアターX(AT-X) - * 342ch：ヒストリーチャンネル - * 290ch：TAKARAZUKA SKYSTAGE - * 803ch：スカチャン803 - * 804ch：スカチャン804 */ - { 20, CHTYPE_SATELLITE, 0, "CS18"}, /* ND18： - * 240ch：ムービープラスHD - * 262ch：ゴルフネットワーク - * 314ch：LaLa HDHV */ - { 21, CHTYPE_SATELLITE, 0, "CS20"}, /* ND20： - * 258ch：フジテレビ739 - * 302ch：フジテレビ721 - * 332ch：アニマックス - * 340ch：ディスカバリーチャンネル - * 341ch：アニマルプラネット */ - { 22, CHTYPE_SATELLITE, 0, "CS22"}, /* ND22： - * 160ch：C-TBSウェルカムチャンネル - * 161ch：QVC - * 185ch：プライム365.TV - * 293ch：ファミリー劇場 - * 301ch：TBSチャンネル - * 304ch：ディズニー・チャンネル - * 325ch：MUSIC ON! TV - * 330ch：キッズステーション - * 351ch：TBSニュースバード */ - { 23, CHTYPE_SATELLITE, 0, "CS24"}, /* ND24： - * 257ch：日テレG+ - * 291ch：fashiontv - * 300ch：日テレプラス - * 320ch：安らぎの音楽と風景／エコミュージックTV - * 321ch：MusicJapan TV - * 350ch：日テレNEWS24 */ - { 0, CHTYPE_GROUND, 0, "1"}, { 1, CHTYPE_GROUND, 0, "2"}, - { 2, CHTYPE_GROUND, 0, "3"}, { 3, CHTYPE_GROUND, 0, "C13"}, - { 4, CHTYPE_GROUND, 0, "C14"}, { 5, CHTYPE_GROUND, 0, "C15"}, - { 6, CHTYPE_GROUND, 0, "C16"}, { 7, CHTYPE_GROUND, 0, "C17"}, - { 8, CHTYPE_GROUND, 0, "C18"}, { 9, CHTYPE_GROUND, 0, "C19"}, - { 10, CHTYPE_GROUND, 0, "C20"}, { 11, CHTYPE_GROUND, 0, "C21"}, - { 12, CHTYPE_GROUND, 0, "C22"}, { 13, CHTYPE_GROUND, 0, "4"}, - { 14, CHTYPE_GROUND, 0, "5"}, { 15, CHTYPE_GROUND, 0, "6"}, - { 16, CHTYPE_GROUND, 0, "7"}, { 17, CHTYPE_GROUND, 0, "8"}, - { 18, CHTYPE_GROUND, 0, "9"}, { 19, CHTYPE_GROUND, 0, "10"}, - { 20, CHTYPE_GROUND, 0, "11"}, { 21, CHTYPE_GROUND, 0, "12"}, - { 22, CHTYPE_GROUND, 0, "C23"}, { 23, CHTYPE_GROUND, 0, "C24"}, - { 24, CHTYPE_GROUND, 0, "C25"}, { 25, CHTYPE_GROUND, 0, "C26"}, - { 26, CHTYPE_GROUND, 0, "C27"}, { 27, CHTYPE_GROUND, 0, "C28"}, - { 28, CHTYPE_GROUND, 0, "C29"}, { 29, CHTYPE_GROUND, 0, "C30"}, - { 30, CHTYPE_GROUND, 0, "C31"}, { 31, CHTYPE_GROUND, 0, "C32"}, - { 32, CHTYPE_GROUND, 0, "C33"}, { 33, CHTYPE_GROUND, 0, "C34"}, - { 34, CHTYPE_GROUND, 0, "C35"}, { 35, CHTYPE_GROUND, 0, "C36"}, - { 36, CHTYPE_GROUND, 0, "C37"}, { 37, CHTYPE_GROUND, 0, "C38"}, - { 38, CHTYPE_GROUND, 0, "C39"}, { 39, CHTYPE_GROUND, 0, "C40"}, - { 40, CHTYPE_GROUND, 0, "C41"}, { 41, CHTYPE_GROUND, 0, "C42"}, - { 42, CHTYPE_GROUND, 0, "C43"}, { 43, CHTYPE_GROUND, 0, "C44"}, - { 44, CHTYPE_GROUND, 0, "C45"}, { 45, CHTYPE_GROUND, 0, "C46"}, - { 46, CHTYPE_GROUND, 0, "C47"}, { 47, CHTYPE_GROUND, 0, "C48"}, - { 48, CHTYPE_GROUND, 0, "C49"}, { 49, CHTYPE_GROUND, 0, "C50"}, - { 50, CHTYPE_GROUND, 0, "C51"}, { 51, CHTYPE_GROUND, 0, "C52"}, - { 52, CHTYPE_GROUND, 0, "C53"}, { 53, CHTYPE_GROUND, 0, "C54"}, - { 54, CHTYPE_GROUND, 0, "C55"}, { 55, CHTYPE_GROUND, 0, "C56"}, - { 56, CHTYPE_GROUND, 0, "C57"}, { 57, CHTYPE_GROUND, 0, "C58"}, - { 58, CHTYPE_GROUND, 0, "C59"}, { 59, CHTYPE_GROUND, 0, "C60"}, - { 60, CHTYPE_GROUND, 0, "C61"}, { 61, CHTYPE_GROUND, 0, "C62"}, - { 62, CHTYPE_GROUND, 0, "C63"}, { 63, CHTYPE_GROUND, 0, "13"}, - { 64, CHTYPE_GROUND, 0, "14"}, { 65, CHTYPE_GROUND, 0, "15"}, - { 66, CHTYPE_GROUND, 0, "16"}, { 67, CHTYPE_GROUND, 0, "17"}, - { 68, CHTYPE_GROUND, 0, "18"}, { 69, CHTYPE_GROUND, 0, "19"}, - { 70, CHTYPE_GROUND, 0, "20"}, { 71, CHTYPE_GROUND, 0, "21"}, - { 72, CHTYPE_GROUND, 0, "22"}, { 73, CHTYPE_GROUND, 0, "23"}, - { 74, CHTYPE_GROUND, 0, "24"}, { 75, CHTYPE_GROUND, 0, "25"}, - { 76, CHTYPE_GROUND, 0, "26"}, { 77, CHTYPE_GROUND, 0, "27"}, - { 78, CHTYPE_GROUND, 0, "28"}, { 79, CHTYPE_GROUND, 0, "29"}, - { 80, CHTYPE_GROUND, 0, "30"}, { 81, CHTYPE_GROUND, 0, "31"}, - { 82, CHTYPE_GROUND, 0, "32"}, { 83, CHTYPE_GROUND, 0, "33"}, - { 84, CHTYPE_GROUND, 0, "34"}, { 85, CHTYPE_GROUND, 0, "35"}, - { 86, CHTYPE_GROUND, 0, "36"}, { 87, CHTYPE_GROUND, 0, "37"}, - { 88, CHTYPE_GROUND, 0, "38"}, { 89, CHTYPE_GROUND, 0, "39"}, - { 90, CHTYPE_GROUND, 0, "40"}, { 91, CHTYPE_GROUND, 0, "41"}, - { 92, CHTYPE_GROUND, 0, "42"}, { 93, CHTYPE_GROUND, 0, "43"}, - { 94, CHTYPE_GROUND, 0, "44"}, { 95, CHTYPE_GROUND, 0, "45"}, - { 96, CHTYPE_GROUND, 0, "46"}, { 97, CHTYPE_GROUND, 0, "47"}, - { 98, CHTYPE_GROUND, 0, "48"}, { 99, CHTYPE_GROUND, 0, "49"}, - { 100, CHTYPE_GROUND, 0, "50"}, { 101, CHTYPE_GROUND, 0, "51"}, - { 102, CHTYPE_GROUND, 0, "52"}, { 103, CHTYPE_GROUND, 0, "53"}, - { 104, CHTYPE_GROUND, 0, "54"}, { 105, CHTYPE_GROUND, 0, "55"}, - { 106, CHTYPE_GROUND, 0, "56"}, { 107, CHTYPE_GROUND, 0, "57"}, - { 108, CHTYPE_GROUND, 0, "58"}, { 109, CHTYPE_GROUND, 0, "59"}, - { 110, CHTYPE_GROUND, 0, "60"}, { 111, CHTYPE_GROUND, 0, "61"}, - { 112, CHTYPE_GROUND, 0, "62"}, - { 0, 0, 0, NULL} /* terminate */ -}; - #endif diff -r a201531113ca -r 52f8e081763d recpt1/tssplitter_lite.c --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/recpt1/tssplitter_lite.c Wed Feb 10 14:33:32 2010 +0900 @@ -0,0 +1,551 @@ +/* tssplitter_lite.c -- split TS stream. + + Copyright 2009 querulous + Copyright 2010 Naoya OYAMA + + 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 3 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, see . */ + +#include +#include +#include +#include + +#include +#include +#include "decoder.h" +#include "recpt1.h" +#include "tssplitter_lite.h" + + +/** + * サービスID解析 + */ +char** AnalyzeSid( + char* sid) // [in] サービスID(カンマ区切りテキスト) +{ + int i = 0; + char** sid_list = NULL; + char* p; + int CommaNum = 0; + + /* sid は次の形式の引数を許容する */ + /* 指定無し */ + /* SID[0] */ + /* SID[0],SID[1],...,SID[N-1],SID[N] */ + + /*カンマの数を数える*/ + p = sid; + while(*p != '\0') + { + if( *p == C_CHAR_COMMA ){ + CommaNum++; + } + p++; + } + + /* sid_listの数はカンマの数+2(NULL止めするから) */ + sid_list = malloc(sizeof(char*)*(CommaNum+2)); + if ( sid_list == NULL ) + { + fprintf(stderr, "AnalyzeSid() malloc error.\n"); + return NULL; + } + + /* sidが空である場合 */ + p = sid; + if ( strlen(p) == 0 ) + { + sid_list[0] = NULL; + return sid_list; + } + + /* カンマ無し */ + if ( CommaNum == 0 ) + { + sid_list[0] = sid; + sid_list[1] = NULL; + return sid_list; + } + + /* カンマ区切りで複数指定時 */ + i=0; + p = sid; + /* 文字列端に到達するか、カンマ数が数えた数に達したら終了 */ + while((*p != '\0') || i < CommaNum) + { + /* 現在の処理位置をsid_list[i]にセット */ + /* このタイミングの p は + * ・sid先頭 + * ・[,]の次の文字 + * いずれかであるので p を sid_list[i] に代入してよい + */ + sid_list[i] = p; + i++; + + /* 最初に現れる[,]をNULL文字で置換する */ + p = strchr(p, C_CHAR_COMMA); + if ( p == NULL ) + { + /* カンマが見つからない場合は最後の処理対象なので終了 */ + break; + } + *p = '\0'; + /* 処理位置をNULLで置換した文字の次の位置に設定する */ + p++; + } + + /* 最後のsid_list[n]はNULLポインタで止める */ + sid_list[i] = NULL; + + i=0; + while( sid_list[i] != NULL ) + { + i++; + } + for(i=0; sid_list[i] != NULL; i++) + { + printf("sid_list[%d]=[%s].\n",i, sid_list[i]); + } + return sid_list; +} + +/** + * 初期化処理 + */ +splitter* split_startup( + char *sid // [in] サービスID(引数で指定した文字列) +) +{ + splitter* sp; + sp = malloc(sizeof(splitter)); + if ( sp == NULL ) + { + fprintf(stderr, "split_startup malloc error.\n"); + return NULL; + } + memset(sp->pids, 0, sizeof(sp->pids)); + memset(sp->pmt_pids, 0, sizeof(sp->pmt_pids)); + + sp->sid_list = NULL; + sp->pat = NULL; + sp->sid_list = AnalyzeSid(sid); + if ( sp->sid_list == NULL ) + { + free(sp); + return NULL; + } + sp->pat_count = 0xFF; + sp->pmt_drop = -1; + sp->pmt_counter = 0; + + return sp; +} + +/** + * 落とすPIDを確定させる + */ +int split_select( + splitter *sp, // [in/out] splitter構造体 + ARIB_STD_B25_BUFFER *sbuf // [in] 入力TS +) +{ + int result; + // TS解析 + result = ReadTs(&(sp->pat), sp->pids, sp->sid_list, sp->pmt_pids, sbuf, &(sp->pmt_drop), &(sp->pmt_counter)); + + return result; +} + +/** + * 終了処理 + */ +void split_shutdown( + splitter* sp +) +{ + if ( sp != NULL ) { + if ( sp->pat != NULL ) + { + free(sp->pat); + sp->pat = NULL; + } + if ( sp->sid_list != NULL ) + { + free(sp->sid_list); + sp->sid_list = NULL; + } + free(sp); + sp = NULL; + } +} + +/** + * TS 解析処理 + * + * 対象のチャンネル番号のみの PAT の再構築と出力対象 PID の抽出を行う + */ +int ReadTs( + unsigned char** pat, // [out] PAT 情報（再構築後） + unsigned char* pids, // [out] 出力対象 PID 情報 + char** sid_list, // [in] 出力対象サービス ID のリスト + unsigned char* pmt_pids, // [in] 出力対象PIDのPMT PID + ARIB_STD_B25_BUFFER *sbuf, // [in] pt1_drvの入力TS + int* pmt_drop, // [in] PMTの落とすべき数 + int* pmt_counter // [out] PMTの落とした数 +) +{ + int length = sbuf->size; + int pid; + int result = TSS_ERROR; + int index; + + index = 0; + while (((length - index - LENGTH_PACKET)) > 0) + { + pid = GetPid(((unsigned char*)sbuf->data)+index+1); + // PAT + if (0x0000 == pid) + { + result = AnalyzePat(((unsigned char*)sbuf->data)+index, pat, pids, sid_list, pmt_pids, pmt_drop); + if (TSS_SUCCESS != result) + { + /* 下位の関数内部でmalloc error発生 */ + return result; + } + } + + // PMT + /* 落とすpmt_pidである場合には、pmtに書かれている + * 落とすべきPCR/AUDIO/VIDEO PIDを取得する */ + if (pmt_pids[pid] == 1) + { + /* この中にはPMT毎に一度しか入らないようにしておく */ + AnalyzePmt(((unsigned char*)sbuf->data)+index, pids); + pmt_pids[pid]++; + *pmt_counter = *(pmt_counter)+1; + } + /* 全ての落とすPMTの中に書かれている、落とすPCR/AUDIO/VIDEOのPIDを得たら処理を抜ける */ + /* pmt_counter と pmt_drop が一致する場合に条件は満たされる */ + if ((*pmt_counter == *pmt_drop)) { + result = TSS_SUCCESS; + break; + } + else + { + result = TSS_ERROR; + } + index += LENGTH_PACKET; + } + + return(result); +} + +/** + * TS 分離処理 + */ +int split_ts( + splitter *splitter, // [in] splitterパラメータ + ARIB_STD_B25_BUFFER *sbuf, // [in] 入力TS + BUFSZ *dbuf // [out] 出力TS +) +{ + int pid; + int s_offset = 0; + int d_offset = 0; + + /* 初期化 */ + dbuf->size = 0; + if ( sbuf->size < 0 ) + { + return TSS_ERROR; + } + + while (sbuf->size > s_offset) + { + pid = GetPid(((unsigned char*)sbuf->data)+s_offset+1); + + // PAT + if (0x0000 == pid) + { + // 巡回カウンタカウントアップ + if (0xFF == splitter->pat_count) + { + splitter->pat_count = splitter->pat[3]; + } else + { + splitter->pat_count = (splitter->pat_count)+1; + if (0 == splitter->pat_count % 0x10) + { + splitter->pat_count = splitter->pat_count - 0x10; + } + } + splitter->pat[3] = splitter->pat_count; + + memcpy(((unsigned char*)dbuf->buffer)+d_offset, splitter->pat, LENGTH_PACKET); + d_offset += LENGTH_PACKET; + dbuf->size = dbuf->size + LENGTH_PACKET; + } + + // その他 PID + else + { + /* pids[pid] が 0 は落とさないパケットなので書き込む */ + if (0 == splitter->pids[pid]) + { + memcpy(((unsigned char*)dbuf->buffer)+d_offset, ((unsigned char*)sbuf->data)+s_offset, LENGTH_PACKET); + d_offset += LENGTH_PACKET; + dbuf->size = dbuf->size + LENGTH_PACKET; + } + } + s_offset = s_offset + LENGTH_PACKET; + } + + return(TSS_SUCCESS); +} + +/** + * PAT 解析処理 + * + * PAT を解析し、出力対象チャンネルが含まれているかチェックを行い、PAT を再構築する + */ +int AnalyzePat( + unsigned char* buf, // [in] 読み込んだバッファ + unsigned char** pat, // [out] PAT 情報（再構築後） + unsigned char* pids, // [out] 出力対象 PID 情報 + char** sid_list, // [in] 出力対象サービス ID のリスト + unsigned char* pmt_pids, // [out] サービス ID に対応する PMT の PID + int* pmt_drop) // [out] 落とすPMTの数 +{ + int pos[MAX_PID]; + int service_id; + int i; + int size = 0; + int pid; + int result = TSS_SUCCESS; + char **p; + int sid_found; + + if (NULL == *pat) + { + /* 初期化 */ + *pmt_drop = 0; + memset(pos, 0, sizeof(pos)); + size = buf[7]; + + // 対象チャンネル判定 + /* size + 8 = パケット全長 */ + /* 最終 4 バイトはCRCなので飛ばす */ + for (i = 17; i < (size + 8) - 4; i = i + 4) + { + sid_found = 0; + service_id = (buf[i] << 8) + buf[i + 1]; + p = sid_list; + while(*p != NULL) + { + if (service_id == atoi(*p)) + { + /* 録画対象 = 落とす対象とはしないものなので、基本的に何もしない */ + /* 録画対象の pmt_pids は 0 とする */ + /* 録画対象の pmt の pids は 0 とする */ + pid = GetPid(&buf[i + 2]); + *(pmt_pids+pid) = 0; + *(pids+pid) = 0; + pos[pid] = i; + sid_found = 1; + break; + } + else if (strstr(*p, "all") != NULL ) + { + /* all指定時には全保存する */ + pid = GetPid(&buf[i + 2]); + *(pmt_pids+pid) = 0; + *(pids+pid) = 0; + pos[pid] = i; + sid_found = 1; + break; + } + p++; + } + if ( ! sid_found ) + { + /* sid_list を全部なめたが録画対象であると判定されないものを落とす */ + /* 削除対象の pmt_pids は 1 とする */ + /* 削除対象の pmt の pids は 1 とする */ + pid = GetPid(&buf[i + 2]); + *(pmt_pids+pid) = 1; + *(pids+pid) = 1; + pos[pid] = i; + *(pmt_drop) = *(pmt_drop)+1; + } + } + // PAT 再構築 + result = RecreatePat(buf, pat, pids, pos); + } + + return(result); +} + +/** + * PAT 再構築処理 + * + * PMT から出力対象チャンネル以外のチャンネル情報を削除し、PAT を再構築する + */ +int RecreatePat( + unsigned char* buf, // [in] 読み込んだバッファ + unsigned char** pat, // [out] PAT 情報（再構築後） + unsigned char* pids, // [out] 出力対象 PID 情報 + int *pos) // [in] 取得対象 PMT のバッファ中の位置 +{ + unsigned char y[LENGTH_CRC_DATA]; + int crc; + int i; + int j; + int pos_i; + int pid_num = 0; + + // CRC 計算のためのデータ + { + // チャンネルによって変わらない部分 + for (i = 0; i < LENGTH_PAT_HEADER; i++) + { + y[i] = buf[i + 5]; + } + // チャンネルによって変わる部分 + for (i = 0; i < MAX_PID; i++) + { + if(pos[i] != 0) + { + /* buf[pos_i] を y にコピー(抽出したPIDの数) */ + pos_i = pos[i]; + for (j = 0; j < 4; j++) + { + y[LENGTH_PAT_HEADER + ((4*pid_num) + j)] = buf[pos_i + j]; + } + pid_num++; + } + } + } + /* パケットサイズ計算 */ + y[2] = pid_num * 4 + 0x0d; + // CRC 計算 + crc = GetCrc32(y, LENGTH_PAT_HEADER + pid_num*4); + + // PAT 再構成 + *pat = (unsigned char*)malloc(LENGTH_PACKET); + if ( *pat == NULL ) + { + fprintf(stderr, "RecreatePat() malloc error.\n"); + return(TSS_NULL); + } + memset(*pat, 0xFF, LENGTH_PACKET); + for (i = 0; i < 5; i++) + { + (*pat)[i] = buf[i]; + } + for (i = 0; i < LENGTH_PAT_HEADER + pid_num*4; i++) + { + (*pat)[i + 5] = y[i]; + } + (*pat)[5 + LENGTH_PAT_HEADER + pid_num*4] = (crc >> 24) & 0xFF; + (*pat)[6 + LENGTH_PAT_HEADER + pid_num*4] = (crc >> 16) & 0xFF; + (*pat)[7 + LENGTH_PAT_HEADER + pid_num*4] = (crc >> 8) & 0xFF; + (*pat)[8 + LENGTH_PAT_HEADER + pid_num*4] = (crc ) & 0xFF; + return(TSS_SUCCESS); +} + +/** + * PMT 解析処理 + * + * PMT を解析し、削除対象の PID を特定する + */ +int AnalyzePmt( + unsigned char* buf, // [in] 読み込んだバッファ + unsigned char* pids) // [out] 出力対象 PID 情報 +{ + unsigned char Nall; + unsigned char N; + int pcr; + int epid; + + Nall = ((buf[6] & 0x0F) << 4) + buf[7]; + + // PCR + pcr = GetPid(&buf[13]); + pids[pcr] = 1; + + N = ((buf[15] & 0x0F) << 4) + buf[16] + 16 + 1; + + // ES PID + while (N < Nall + 8 - 4) + { + epid = GetPid(&buf[N + 1]); + + pids[epid] = 1; + N += 4 + (((buf[N + 3]) & 0x0F) << 4) + buf[N + 4] + 1; + } + + return TSS_SUCCESS; +} + +/** + * CRC 計算 + */ +int GetCrc32( + unsigned char* data, // [in] CRC 計算対象データ + int len) // [in] CRC 計算対象データ長 +{ + int crc; + int i, j; + int c; + int bit; + + crc = 0xFFFFFFFF; + for (i = 0; i < len; i++) + { + char x; + x = data[i]; + + for (j = 0; j < 8; j++) + { + + bit = (x >> (7 - j)) & 0x1; + + c = 0; + if (crc & 0x80000000) + { + c = 1; + } + + crc = crc << 1; + + if (c ^ bit) + { + crc ^= 0x04C11DB7; + } + + crc &= 0xFFFFFFFF; + } + } + + return crc; +} + +/** + * PID 取得 + */ +int GetPid( + unsigned char* data) // [in] 取得対象データのポインタ +{ + return ((data[0] & 0x1F) << 8) + data[1]; +} diff -r a201531113ca -r 52f8e081763d recpt1/tssplitter_lite.h --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/recpt1/tssplitter_lite.h Wed Feb 10 14:33:32 2010 +0900 @@ -0,0 +1,71 @@ +/* tssplitter_lite.h -- split TS stream program's header. + + Copyright 2009 querulous + Copyright 2010 Naoya OYAMA + + 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 3 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, see . */ +#ifndef _TS_SPLITTER_LITE_H_ +#define _TS_SPLITTER_LITE_H_ +#if defined(WIN32) + #include + #include + #include + + #pragma warning(disable: 4996) +#else + #define __STDC_FORMAT_MACROS + #include + #include +// #include "portable.h" +#endif + +#define LENGTH_PACKET (188) +#define MAX_PID (8192) +#define LENGTH_CRC_DATA (176) +#define false (0) +#define true (1) + +#define TSS_SUCCESS (0) +#define TSS_ERROR (-1) +#define TSS_NULL (-2) +#define LENGTH_PAT_HEADER (12) +#define C_CHAR_COMMA ',' + +/** + * splitter構造体 + */ +typedef struct splitter { + unsigned char pids[MAX_PID]; + unsigned char pmt_pids[MAX_PID]; + unsigned char* pat; + char** sid_list; + unsigned char pat_count; + int pmt_drop; + int pmt_counter; +} splitter; + +char** AnalyzeSid(char* sid); +splitter* split_startup(char *sid); +int split_select(splitter *sp, ARIB_STD_B25_BUFFER *sbuf); +void split_shutdown( splitter* sp); +int ReadTs( unsigned char** pat, unsigned char* pids, char** sid_list, unsigned char* pmt_pids, ARIB_STD_B25_BUFFER *sbuf, int* pmt_drop, int* pmt_counter); +//int split_ts( unsigned char** pat, unsigned char* pids, ARIB_STD_B25_BUFFER *sbuf, BUFSZ *dbuf); +int split_ts( splitter *splitter, ARIB_STD_B25_BUFFER *sbuf, BUFSZ *dbuf); +int AnalyzePat(unsigned char* buf, unsigned char** pat, unsigned char* pids, char** sid_list, unsigned char* pmt_pids, int* pmt_drop); +int RecreatePat(unsigned char* buf, unsigned char** pat, unsigned char* pids, int *pos); +int AnalyzePmt(unsigned char* buf, unsigned char* pids); + +int GetCrc32(unsigned char* data, int len); +int GetPid(unsigned char* data); +#endif