├── COPYING
├── Makefile
├── bs.h
├── code_generator.pl
├── mpeg2ts.c
├── mpeg2ts.c_prefix
├── mpeg2ts.h
├── mpeg2ts.h_prefix
├── mpeg2ts.h_suffix
└── mpeg2ts.xml
/COPYING:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/Makefile:
--------------------------------------------------------------------------------
1 | VERSION = 0.1.0
2 |
3 | INCLUDES =
4 | LIBS =
5 |
6 | CC = gcc
7 | CFLAGS += -std=c99 -Wall -W -Wshadow -Wwrite-strings -Wno-unused -g -O3 $(INCLUDES)
8 |
9 | LD = gcc
10 | LDFLAGS += $(LIBS)
11 |
12 | AR = ar
13 | ARFLAGS = rsc
14 |
15 | BINARIES =
16 |
17 | all: libmpeg2ts.a $(BINARIES)
18 |
19 |
20 | libmpeg2ts.a: mpeg2ts.c mpeg2ts.h
21 | $(CC) $(CFLAGS) -c -o mpeg2ts.o mpeg2ts.c
22 | $(AR) $(ARFLAGS) libmpeg2ts.a mpeg2ts.o
23 |
24 |
25 | mpeg2ts.c: mpeg2ts.xml code_generator.pl mpeg2ts.c_prefix
26 | perl code_generator.pl
27 |
28 | mpeg2ts.h: mpeg2ts.xml code_generator.pl mpeg2ts.h_prefix mpeg2ts.h_suffix
29 | perl code_generator.pl
30 |
31 | clean:
32 | rm -f *.o libmpeg2ts.a $(BINARIES)
33 |
34 | dox: mpeg2ts.c mpeg2ts.h
35 | doxygen Doxyfile
36 |
37 | dist: clean
38 | mkdir libmpeg2ts-$(VERSION)
39 | tar c --files-from=MANIFEST -f tmp.tar ; cd libmpeg2ts-$(VERSION) ; tar xf ../tmp.tar ; rm -f ../tmp.tar
40 | tar czf ../libmpeg2ts-$(VERSION).tar.gz libmpeg2ts-$(VERSION)
41 | rm -rf libmpeg2ts-$(VERSION)
42 |
43 |
--------------------------------------------------------------------------------
/bs.h:
--------------------------------------------------------------------------------
1 | /*
2 | * h264bitstream - a library for reading and writing H.264 video
3 | * Copyright (C) 2005-2007 Auroras Entertainment, LLC
4 | * Copyright (C) 2008-2012 Avail-TVN
5 | *
6 | * Written by Alex Izvorski and Alex Giladi
7 | *
8 | * This library is free software; you can redistribute it and/or
9 | * modify it under the terms of the GNU Lesser General Public
10 | * License as published by the Free Software Foundation; either
11 | * version 2.1 of the License, or (at your option) any later version.
12 | *
13 | * This library is distributed in the hope that it will be useful,
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 | * Lesser General Public License for more details.
17 | *
18 | * You should have received a copy of the GNU Lesser General Public
19 | * License along with this library; if not, write to the Free Software
20 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
21 | */
22 |
23 | #ifndef _H264_BS_H
24 | #define _H264_BS_H 1
25 |
26 | #include
27 | #include
28 | #include
29 |
30 | #ifdef __cplusplus
31 | extern "C" {
32 | #endif
33 |
34 | typedef struct
35 | {
36 | uint8_t* start;
37 | uint8_t* p;
38 | uint8_t* end;
39 | int bits_left;
40 | } bs_t;
41 |
42 | #define _OPTIMIZE_BS_ 1
43 |
44 | #if ( _OPTIMIZE_BS_ > 0 )
45 | #ifndef FAST_U8
46 | #define FAST_U8
47 | #endif
48 | #endif
49 |
50 |
51 | static bs_t* bs_new(uint8_t* buf, size_t size);
52 | static void bs_free(bs_t* b);
53 | static bs_t* bs_clone( bs_t* dest, const bs_t* src );
54 | static bs_t* bs_init(bs_t* b, uint8_t* buf, size_t size);
55 | static uint32_t bs_byte_aligned(bs_t* b);
56 | static uint32_t bs_eof(bs_t* b);
57 | static int bs_pos(bs_t* b);
58 |
59 | static uint32_t bs_peek_u1(bs_t* b);
60 | static uint32_t bs_read_u1(bs_t* b);
61 | static uint32_t bs_read_u(bs_t* b, int n);
62 | static uint32_t bs_read_f(bs_t* b, int n);
63 | static uint32_t bs_read_u8(bs_t* b);
64 | static uint32_t bs_read_ue(bs_t* b);
65 | static int32_t bs_read_se(bs_t* b);
66 |
67 | static void bs_write_u1(bs_t* b, uint32_t v);
68 | static void bs_write_u(bs_t* b, uint32_t v, int n);
69 | static void bs_write_f(bs_t* b, uint32_t v, int n);
70 | static void bs_write_u8(bs_t* b, uint32_t v);
71 | static void bs_write_ue(bs_t* b, uint32_t v);
72 | static void bs_write_se(bs_t* b, int32_t v);
73 |
74 | static int bs_read_bytes(bs_t* b, uint8_t* buf, int len);
75 | static int bs_write_bytes(bs_t* b, uint8_t* buf, int len);
76 | static int bs_skip_bytes(bs_t* b, int len);
77 | static uint32_t bs_next_bits( bs_t* bs, int nbits );
78 |
79 | #define bs_skip_bslbf bs_read_u
80 | #define bs_read_bslbf bs_read_u
81 | #define bs_read_tcimsbf bs_read_u
82 | #define bs_read_uimsbf bs_read_u
83 |
84 | #define bs_write_bslbf bs_write_u
85 | #define bs_write_tcimsbf bs_write_u
86 | #define bs_write_uimsbf bs_write_u
87 |
88 | //FIXME
89 | #define bs_read_bytes_all(b, buf) bs_read_bytes(b, buf, bs_bytes_left(b))
90 | #define bs_skip_bytes_all(b) b->p = b->end
91 |
92 |
93 | // IMPLEMENTATION
94 |
95 | static inline bs_t* bs_init(bs_t* b, uint8_t* buf, size_t size)
96 | {
97 | b->start = buf;
98 | b->p = buf;
99 | b->end = buf + size;
100 | b->bits_left = 8;
101 | return b;
102 | }
103 |
104 | static inline bs_t* bs_clone( bs_t* dest, const bs_t* src )
105 | {
106 | dest->start = src->p;
107 | dest->p = src->p;
108 | dest->end = src->end;
109 | dest->bits_left = src->bits_left;
110 | return dest;
111 | }
112 |
113 | static inline uint32_t bs_byte_aligned(bs_t* b)
114 | {
115 | return (b->bits_left == 8);
116 | }
117 |
118 | static inline bs_t* bs_new(uint8_t* buf, size_t size)
119 | {
120 | bs_t* b = (bs_t*)malloc(sizeof(bs_t));
121 | bs_init(b, buf, size);
122 | return b;
123 | }
124 |
125 | static inline void bs_free(bs_t* b)
126 | {
127 | free(b);
128 | }
129 |
130 | static inline uint32_t bs_eof(bs_t* b) { if (b->p >= b->end) { return 1; } else { return 0; } }
131 |
132 | static inline int bs_pos(bs_t* b) { return (b->p - b->start); }
133 |
134 | static inline int bs_bytes_left(bs_t* b) { return (b->end - b->p); }
135 |
136 | static inline uint32_t bs_read_u1(bs_t* b)
137 | {
138 | uint32_t r = 0;
139 | if (bs_eof(b)) { return 0; }
140 |
141 | b->bits_left--;
142 | r = ((*(b->p)) >> b->bits_left) & 0x01;
143 |
144 | if (b->bits_left == 0) { b->p ++; b->bits_left = 8; }
145 |
146 | return r;
147 | }
148 |
149 | static inline void bs_skip_u1(bs_t* b)
150 | {
151 | b->bits_left--;
152 | if (b->bits_left == 0) { b->p ++; b->bits_left = 8; }
153 | }
154 |
155 | static inline uint32_t bs_peek_u1(bs_t* b)
156 | {
157 | uint32_t r = 0;
158 | if (bs_eof(b)) { return 0; }
159 |
160 | r = ((*(b->p)) >> ( b->bits_left - 1 )) & 0x01;
161 |
162 | return r;
163 | }
164 |
165 |
166 | static inline uint32_t bs_read_u(bs_t* b, int n)
167 | {
168 | uint32_t r = 0;
169 | int i;
170 | for (i = 0; i < n; i++)
171 | {
172 | r |= ( bs_read_u1(b) << ( n - i - 1 ) );
173 | }
174 | return r;
175 | }
176 |
177 | static inline void bs_skip_u(bs_t* b, int n)
178 | {
179 | int i;
180 | for ( i = 0; i < n; i++ ) bs_skip_u1( b );
181 | }
182 |
183 | static inline uint32_t bs_read_f(bs_t* b, int n) { return bs_read_u(b, n); }
184 |
185 | static inline uint32_t bs_read_u8(bs_t* b)
186 | {
187 | #ifdef FAST_U8
188 | if (b->bits_left == 8 && ! bs_eof(b)) // can do fast read
189 | {
190 | uint32_t r = b->p[0];
191 | b->p++;
192 | return r;
193 | }
194 | #endif
195 | return bs_read_u(b, 8);
196 | }
197 |
198 | static inline uint32_t bs_read_ue(bs_t* b)
199 | {
200 | int32_t r = 0;
201 | int i = 0;
202 |
203 | while( (bs_read_u1(b) == 0) && (i < 32) && (!bs_eof(b)) )
204 | {
205 | i++;
206 | }
207 | r = bs_read_u(b, i);
208 | r += (1 << i) - 1;
209 | return r;
210 | }
211 |
212 | static inline int32_t bs_read_se(bs_t* b)
213 | {
214 | int32_t r = bs_read_ue(b);
215 | if (r & 0x01)
216 | {
217 | r = (r+1)/2;
218 | }
219 | else
220 | {
221 | r = -(r/2);
222 | }
223 | return r;
224 | }
225 |
226 |
227 | static inline void bs_write_u1(bs_t* b, uint32_t v)
228 | {
229 | if (bs_eof(b)) { return; }
230 |
231 | b->bits_left--;
232 | (*(b->p)) &= ~(0x01 << b->bits_left); // FIXME this is slow, but we must clear bit first - is it better to memset(0) the whole buffer during bs_init() instead? if we don't do either, we introduce pretty nasty bugs
233 | (*(b->p)) |= ((v & 0x01) << b->bits_left);
234 |
235 | if (b->bits_left == 0) { b->p ++; b->bits_left = 8; }
236 | }
237 |
238 | static inline void bs_write_u(bs_t* b, uint32_t v, int n)
239 | {
240 | int i;
241 | for (i = 0; i < n; i++)
242 | {
243 | bs_write_u1(b, (v >> ( n - i - 1 ))&0x01 );
244 | }
245 | }
246 |
247 | static inline void bs_write_f(bs_t* b, uint32_t v, int n) { bs_write_u(b, v, n); }
248 |
249 | static inline void bs_write_u8(bs_t* b, uint32_t v)
250 | {
251 | #ifdef FAST_U8
252 | if (b->bits_left == 8 && ! bs_eof(b)) // can do fast write
253 | {
254 | b->p[0] = v;
255 | b->p++;
256 | return;
257 | }
258 | #endif
259 | bs_write_u(b, 8, v);
260 | }
261 |
262 | static inline void bs_write_ue(bs_t* b, uint32_t v)
263 | {
264 | static const int len_table[256] =
265 | {
266 | 1,
267 | 1,
268 | 2,2,
269 | 3,3,3,3,
270 | 4,4,4,4,4,4,4,4,
271 | 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
272 | 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
273 | 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
274 | 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
275 | 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
276 | 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
277 | 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
278 | 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
279 | 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
280 | 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
281 | 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
282 | 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
283 | 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
284 | 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
285 | 8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,
286 | };
287 |
288 | int len;
289 |
290 | if (v == 0)
291 | {
292 | bs_write_u1(b, 1);
293 | }
294 | else
295 | {
296 | v++;
297 |
298 | if (v >= 0x01000000)
299 | {
300 | len = 24 + len_table[ v >> 24 ];
301 | }
302 | else if(v >= 0x00010000)
303 | {
304 | len = 16 + len_table[ v >> 16 ];
305 | }
306 | else if(v >= 0x00000100)
307 | {
308 | len = 8 + len_table[ v >> 8 ];
309 | }
310 | else
311 | {
312 | len = len_table[ v ];
313 | }
314 |
315 | bs_write_u(b, 2*len-1, v);
316 | }
317 | }
318 |
319 | static inline void bs_write_se(bs_t* b, int32_t v)
320 | {
321 | if (v <= 0)
322 | {
323 | bs_write_ue(b, -v*2);
324 | }
325 | else
326 | {
327 | bs_write_ue(b, v*2 - 1);
328 | }
329 | }
330 |
331 | static inline int bs_read_bytes(bs_t* b, uint8_t* buf, int len)
332 | {
333 | int actual_len;
334 | actual_len = len;
335 | if (b->end - b->p < actual_len) { actual_len = b->end - b->p; }
336 | if (actual_len < 0) { actual_len = 0; }
337 | memcpy(buf, b->p, actual_len);
338 | b->p += actual_len;
339 | return actual_len;
340 | }
341 |
342 | static inline int bs_write_bytes(bs_t* b, uint8_t* buf, int len)
343 | {
344 | int actual_len;
345 | actual_len = len;
346 | if (b->end - b->p < actual_len) { actual_len = b->end - b->p; }
347 | if (actual_len < 0) { actual_len = 0; }
348 | memcpy(b->p, buf, actual_len);
349 | b->p += actual_len;
350 | return actual_len;
351 | }
352 |
353 | static inline int bs_skip_bytes(bs_t* b, int len)
354 | {
355 | int actual_len;
356 | actual_len = len;
357 | if (b->end - b->p < actual_len) { actual_len = b->end - b->p; }
358 | if (actual_len < 0) { actual_len = 0; }
359 | b->p += actual_len;
360 | return actual_len;
361 | }
362 |
363 | static inline uint32_t bs_next_bits( bs_t* bs, int nbits )
364 | {
365 | bs_t b;
366 | bs_clone(&b,bs);
367 | return bs_read_u( &b, nbits );
368 | }
369 |
370 | static inline uint64_t bs_next_bytes( const bs_t* const bs, int nbytes )
371 | {
372 | int i = 0;
373 | uint64_t val = 0;
374 |
375 | if ( (nbytes > 8) || (nbytes < 1) ) return 0;
376 | if (bs->p + nbytes > bs->end) return 0;
377 |
378 | for ( i = 0; i < nbytes; i++ ) val = ( val << 8 ) | bs->p[i];
379 | return val;
380 | }
381 |
382 | #define bs_print_state(b) fprintf( stderr, "%s:%d@%s: b->p=0x%02hhX, b->left = %d\n", __FILE__, __LINE__, __FUNCTION__, *b->p, b->bits_left )
383 |
384 | #ifdef __cplusplus
385 | }
386 | #endif
387 |
388 | #endif
389 |
--------------------------------------------------------------------------------
/code_generator.pl:
--------------------------------------------------------------------------------
1 | #!/usr/bin/perl
2 |
3 | # libmpeg2ts, a MPEG2 transport stream reading/writing library
4 | #
5 | # Copyright (C) 2012 Alexander Izvorski
6 | #
7 | # This file is part of libmpeg2ts.
8 | #
9 | # libmpeg2ts is free software: you can redistribute it and/or modify
10 | # it under the terms of the GNU General Public License as published by
11 | # the Free Software Foundation, either version 3 of the License, or
12 | # (at your option) any later version.
13 | #
14 | # libmpeg2ts is distributed in the hope that it will be useful,
15 | # but WITHOUT ANY WARRANTY; without even the implied warranty of
16 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 | # GNU General Public License for more details.
18 | #
19 | # You should have received a copy of the GNU General Public License
20 | # along with libmpeg2ts. If not, see .
21 |
22 | use XML::LibXML;
23 | use IO::File;
24 | use IO::All;
25 |
26 | my $parser = XML::LibXML->new();
27 | my $xml = io('mpeg2ts.xml')->all;
28 | # convert binary strings to hex
29 | $xml =~ s!\b0b([01]*)\b! sprintf("0x%02x", unpack("N", pack("B32", substr("0" x 32 . $1, -32)))) !ge;
30 | my $doc = $parser->parse_string($xml);
31 |
32 | $indent = 0;
33 | $output_fh = IO::File->new('mpeg2ts.h', 'w');
34 |
35 | $output_fh->print(io('mpeg2ts.h_prefix')->all);
36 | &process_node($doc, "structs");
37 | &process_node($doc, "defs");
38 | $output_fh->print(io('mpeg2ts.h_suffix')->all);
39 |
40 | $output_fh = IO::File->new('mpeg2ts.c', 'w');
41 |
42 | $output_fh->print(io('mpeg2ts.c_prefix')->all);
43 | &process_node($doc, "new_func");
44 | &process_node($doc, "free_func");
45 | &process_node($doc, "read_func");
46 | &process_node($doc, "write_func");
47 | &process_node($doc, "len_func");
48 |
49 | sub output { $output_fh->print (" " x $indent); $output_fh->print(@_); }
50 |
51 |
52 | sub process_node
53 | {
54 | my ($node, $gen) = @_;
55 |
56 | my ($name, $type, $length, $value);
57 | if ($node->nodeName !~ m!\#!) { ($name, $type, $length, $value) = ($node->getAttribute("name"), $node->getAttribute("type"), $node->getAttribute("length"), $node->getAttribute("value")); }
58 |
59 | if ($node->nodeName() eq 'structure')
60 | {
61 | $indent = 0;
62 |
63 | if ($gen eq "new_func") { &output("${name}_t* ${name}_new() {\n"); }
64 | elsif ($gen eq "free_func") { &output("void ${name}_free(${name}_t* p) {\n"); }
65 | elsif ($gen eq "write_func"){ &output("int ${name}_write(${name}_t* p, bs_t* bs) {\n"); }
66 | elsif ($gen eq "read_func") { &output("int ${name}_read(${name}_t* p, bs_t* bs) {\n"); }
67 | elsif ($gen eq "len_func")
68 | {
69 | &output("int ${name}_len(${name}_t* p) {\n");
70 |
71 | $indent++;
72 | &output("int len;\n");
73 |
74 | # find all child nodes which are lengths, in deepest-first order
75 | my @nodes = $node->findnodes(".//length");
76 | @nodes = reverse @nodes;
77 |
78 | # for each length node, add up the lengths of all next siblings as subtrees,
79 | # except that any length nodes are just added directly and their next siblings skipped
80 | foreach my $length_node (@nodes)
81 | {
82 | &output("len = 0;\n");
83 | my $next_node = $length_node;
84 | while ($next_node = $next_node->nextSibling)
85 | {
86 | &process_node($next_node, "len_func");
87 | }
88 | &output("if (p->".$length_node->getAttribute("field")." < len /8) { p->".$length_node->getAttribute("field")." = len /8; };\n\n");
89 | }
90 |
91 | &output("len = 0;\n");
92 | $indent--;
93 | }
94 | elsif ($gen eq "structs")
95 | {
96 | &output("typedef struct {\n");
97 | %fields_hash = ();
98 | }
99 | elsif ($gen eq "defs")
100 | {
101 | &output("${name}_t* ${name}_new();\n");
102 | &output("void ${name}_free(${name}_t* p);\n");
103 | &output("int ${name}_write(${name}_t* p, bs_t* bs);\n");
104 | &output("int ${name}_read(${name}_t* p, bs_t* bs);\n");
105 | &output("int ${name}_len(${name}_t* p);\n\n");
106 | }
107 | }
108 | elsif ($node->nodeName() eq 'if' && $gen !~ m!(structs|defs|new_func|free_func)!)
109 | {
110 | if ($node->hasAttribute("equals"))
111 | {
112 | &output("if (p->".$node->getAttribute("field")." == ".$node->getAttribute("equals").") {\n");
113 | }
114 | elsif ($node->hasAttribute("equals_any"))
115 | {
116 | my $field = $node->getAttribute("field");
117 | &output("if (".join(" || ", map { "p->${field} == $_" } split(/,/, $node->getAttribute("equals_any")) ) .") {\n");
118 | }
119 | elsif ($node->hasAttribute("not_equals_any"))
120 | {
121 | my $field = $node->getAttribute("field");
122 | &output("if (".join(" && ", map { "p->${field} != $_" } split(/,/, $node->getAttribute("not_equals_any")) ) .") {\n");
123 | }
124 | elsif ($node->hasAttribute("greater_than"))
125 | {
126 | &output("if (p->".$node->getAttribute("field")." > ".$node->getAttribute("greater_than").") {\n");
127 | }
128 | else
129 | {
130 | # TODO
131 | &output("if () { // FIXME\n");
132 | }
133 | }
134 | elsif ($node->nodeName() eq 'field')
135 | {
136 | if ($node->hasAttribute("value")) # constants
137 | {
138 | if ($node->getAttribute("type") eq 'bytes' && $node->getAttribute("byte_length") eq 'all')
139 | {
140 | if ($gen eq "write_func") { &output("bs_fill_bytes_all(bs, ${value});\n"); }
141 | elsif ($gen eq "read_func") { &output("bs_skip_bytes_all(bs);\n"); }
142 | elsif ($gen eq "len_func") { } # this is zero-length for the purpose of calculating minimum lengths
143 | elsif ($gen eq "structs") { }
144 | }
145 | elsif ($node->getAttribute("type") eq 'bytes')
146 | {
147 | if ($gen eq "write_func") { &output("bs_fill_bytes(bs, ${value}, p->".$node->getAttribute("byte_length").");\n"); }
148 | elsif ($gen eq "read_func") { &output("bs_skip_bytes(bs, p->".$node->getAttribute("byte_length").");\n"); }
149 | elsif ($gen eq "len_func") { &output("len += ".$node->getAttribute("byte_length")." *8;\n"); }
150 | elsif ($gen eq "structs") { }
151 | }
152 | elsif ($node->getAttribute("type") =~ m!^(bslbf|uimsbf|tcimsbf)$!)
153 | {
154 | if ($gen eq "write_func") { &output("bs_write_${type}(bs, ${value}, ${length});\n"); }
155 | elsif ($gen eq "read_func") { &output("bs_skip_${type}(bs, ${length});\n"); }
156 | elsif ($gen eq "len_func") { &output("len += ${length};\n"); }
157 | elsif ($gen eq "structs") { }
158 | }
159 | else
160 | {
161 | &output("// ${type}(${length}) ${name} // FIXME\n");
162 | }
163 | }
164 | else
165 | {
166 | if ($gen eq "structs" && $fields_hash{ ${name} }) { return; }
167 |
168 | if ($node->getAttribute("type") eq 'bytes' && $node->getAttribute("byte_length") eq 'all')
169 | {
170 | if ($gen eq "write_func") { &output("bs_write_bytes(bs, p->${name}, p->${name}_len);\n"); }
171 | elsif ($gen eq "read_func") { &output("p->${name}_len = bs_read_bytes_all(bs, p->${name});\n"); }
172 | elsif ($gen eq "len_func") { &output("len += p->${name}_len *8;\n"); }
173 | elsif ($gen eq "structs") { &output("uint8_t* ${name};\n"); &output("int ${name}_len;\n"); }
174 | }
175 | elsif ($node->getAttribute("type") eq 'bytes')
176 | {
177 | if ($gen eq "write_func") { &output("bs_write_bytes(bs, p->${name}, p->${name}_len);\n"); }
178 | elsif ($gen eq "read_func") { &output("p->${name}_len = bs_read_bytes(bs, p->${name}, p->".$node->getAttribute("byte_length").");\n"); }
179 | elsif ($gen eq "len_func") { &output("len += p->${name}_len *8;\n"); &output("p->".$node->getAttribute("byte_length")." = p->${name}_len;\n"); }
180 | elsif ($gen eq "structs") { &output("uint8_t* ${name};\n"); &output("int ${name}_len;\n"); }
181 | }
182 | elsif ($node->getAttribute("type") eq 'structure')
183 | {
184 | if ($gen eq "write_func") { &output("".$node->getAttribute("structure_type")."_write(p->${name}, bs);\n"); }
185 | elsif ($gen eq "read_func") { &output("".$node->getAttribute("structure_type")."_read(p->${name}, bs);\n"); }
186 | elsif ($gen eq "len_func") { &output("len += ".$node->getAttribute("structure_type")."_len(p->${name});\n"); }
187 | elsif ($gen eq "structs") { &output("".$node->getAttribute("structure_type")."_t* ${name};\n"); }
188 | }
189 | elsif ($node->getAttribute("type") =~ m!^(bslbf|uimsbf|tcimsbf|timestamp_with_markers)$!)
190 | {
191 | if ($gen eq "write_func") { &output("bs_write_${type}(bs, p->${name}, ${length});\n"); }
192 | elsif ($gen eq "read_func") { &output("p->${name} = bs_read_${type}(bs, ${length});\n"); }
193 | elsif ($gen eq "len_func") { &output("len += ${length};\n"); }
194 | elsif ($gen eq "structs") { &output("int ${name};\n"); }
195 | }
196 | else
197 | {
198 | &output("// ${type}(${length}) ${name} // FIXME\n");
199 | }
200 |
201 | if ($gen eq "structs") { $fields_hash{ ${name} } = 1; }
202 | }
203 | }
204 | elsif ($node->nodeName() eq 'constant')
205 | {
206 | if ($gen eq "structs") { &output("#define ${name} ${value}\n"); }
207 | }
208 | elsif ($node->nodeName() eq 'length' && $gen eq 'len_func')
209 | {
210 | &output("len += p->".$node->getAttribute("field")." *8;\n");
211 | }
212 |
213 | $indent++;
214 | foreach my $child ($node->childNodes())
215 | {
216 | &process_node($child, $gen);
217 | if ($gen eq 'len_func' && $child->nodeName() eq 'length')
218 | {
219 | last;
220 | }
221 | }
222 | $indent--;
223 |
224 | if ($node->nodeName() eq 'structure')
225 | {
226 | if ($gen eq "new_func")
227 | {
228 | $indent++;
229 | &output("${name}_t* p = (${name}_t*)malloc(sizeof(${name}_t*));\n");
230 | &output("return p;\n");
231 | $indent--;
232 | &output("};\n\n");
233 | }
234 | elsif ($gen eq "free_func")
235 | {
236 | $indent++;
237 | &output("free(p);\n");
238 | $indent--;
239 | &output("};\n\n");
240 | }
241 | elsif ($gen eq "write_func")
242 | {
243 | $indent++;
244 | &output("return 0;\n");
245 | $indent--;
246 | &output("};\n\n");
247 | }
248 | elsif ($gen eq "read_func")
249 | {
250 | $indent++;
251 | &output("return 0;\n");
252 | $indent--;
253 | &output("};\n\n");
254 | }
255 | elsif ($gen eq "len_func")
256 | {
257 | $indent++;
258 | &output("return len /8;\n");
259 | $indent--;
260 | &output("};\n\n");
261 | }
262 | elsif ($gen eq "structs") { &output("} ${name}_t;\n\n"); }
263 | }
264 | elsif ($node->nodeName() eq 'if' && $gen !~ m!(structs|defs|new_func|free_func)!)
265 | {
266 | &output("};\n");
267 | }
268 | }
269 |
270 |
271 |
--------------------------------------------------------------------------------
/mpeg2ts.c:
--------------------------------------------------------------------------------
1 | /*
2 | # libmpeg2ts, a MPEG2 transport stream reading/writing library
3 | #
4 | # Copyright (C) 2012 Alexander Izvorski
5 | #
6 | # This file is part of libmpeg2ts.
7 | #
8 | # libmpeg2ts is free software: you can redistribute it and/or modify
9 | # it under the terms of the GNU General Public License as published by
10 | # the Free Software Foundation, either version 3 of the License, or
11 | # (at your option) any later version.
12 | #
13 | # libmpeg2ts is distributed in the hope that it will be useful,
14 | # but WITHOUT ANY WARRANTY; without even the implied warranty of
15 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 | # GNU General Public License for more details.
17 | #
18 | # You should have received a copy of the GNU General Public License
19 | # along with libmpeg2ts. If not, see .
20 | */
21 |
22 |
23 | #include "mpeg2ts.h"
24 | #include "bs.h"
25 |
26 | adaptation_field_t* adaptation_field_new() {
27 | adaptation_field_t* p = (adaptation_field_t*)malloc(sizeof(adaptation_field_t*));
28 | return p;
29 | };
30 |
31 | transport_packet_t* transport_packet_new() {
32 | transport_packet_t* p = (transport_packet_t*)malloc(sizeof(transport_packet_t*));
33 | return p;
34 | };
35 |
36 | PES_packet_t* PES_packet_new() {
37 | PES_packet_t* p = (PES_packet_t*)malloc(sizeof(PES_packet_t*));
38 | return p;
39 | };
40 |
41 | void adaptation_field_free(adaptation_field_t* p) {
42 | free(p);
43 | };
44 |
45 | void transport_packet_free(transport_packet_t* p) {
46 | free(p);
47 | };
48 |
49 | void PES_packet_free(PES_packet_t* p) {
50 | free(p);
51 | };
52 |
53 | int adaptation_field_read(adaptation_field_t* p, bs_t* bs) {
54 | p->adaptation_field_length = bs_read_uimsbf(bs, 8);
55 | if (p->adaptation_field_length > 0) {
56 | p->discontinuity_indicator = bs_read_bslbf(bs, 1);
57 | p->random_access_indicator = bs_read_bslbf(bs, 1);
58 | p->elementary_stream_priority_indicator = bs_read_bslbf(bs, 1);
59 | p->PCR_flag = bs_read_bslbf(bs, 1);
60 | p->OPCR_flag = bs_read_bslbf(bs, 1);
61 | p->splicing_point_flag = bs_read_bslbf(bs, 1);
62 | p->transport_private_data_flag = bs_read_bslbf(bs, 1);
63 | p->adaptation_field_extension_flag = bs_read_bslbf(bs, 1);
64 | if (p->PCR_flag == 1) {
65 | p->program_clock_reference_base = bs_read_uimsbf(bs, 33);
66 | bs_skip_bslbf(bs, 6);
67 | p->program_clock_reference_extension = bs_read_uimsbf(bs, 9);
68 | };
69 | if (p->OPCR_flag == 1) {
70 | p->original_program_clock_reference_base = bs_read_uimsbf(bs, 33);
71 | bs_skip_bslbf(bs, 6);
72 | p->original_program_clock_reference_extension = bs_read_uimsbf(bs, 9);
73 | };
74 | if (p->splicing_point_flag == 1) {
75 | p->splice_countdown = bs_read_tcimsbf(bs, 8);
76 | };
77 | if (p->transport_private_data_flag == 1) {
78 | p->transport_private_data_length = bs_read_uimsbf(bs, 8);
79 | p->private_data_len = bs_read_bytes(bs, p->private_data, p->transport_private_data_length);
80 | };
81 | if (p->adaptation_field_extension_flag == 1) {
82 | p->adaptation_field_extension_length = bs_read_uimsbf(bs, 8);
83 | p->ltw_flag = bs_read_bslbf(bs, 1);
84 | p->piecewise_rate_flag = bs_read_bslbf(bs, 1);
85 | p->seamless_splice_flag = bs_read_bslbf(bs, 1);
86 | bs_skip_bslbf(bs, 5);
87 | if (p->ltw_flag == 1) {
88 | p->ltw_valid_flag = bs_read_bslbf(bs, 1);
89 | p->ltw_offset = bs_read_uimsbf(bs, 15);
90 | };
91 | if (p->piecewise_rate_flag == 1) {
92 | bs_skip_bslbf(bs, 2);
93 | p->piecewise_rate = bs_read_uimsbf(bs, 22);
94 | };
95 | if (p->seamless_splice_flag == 1) {
96 | p->splice_type = bs_read_bslbf(bs, 4);
97 | p->DTS_next_AU = bs_read_timestamp_with_markers(bs, 36);
98 | };
99 | bs_skip_bytes_all(bs);
100 | };
101 | bs_skip_bytes_all(bs);
102 | };
103 | return 0;
104 | };
105 |
106 | int transport_packet_read(transport_packet_t* p, bs_t* bs) {
107 | bs_skip_bslbf(bs, 8);
108 | p->transport_error_indicator = bs_read_bslbf(bs, 1);
109 | p->payload_unit_start_indicator = bs_read_bslbf(bs, 1);
110 | p->transport_priority = bs_read_bslbf(bs, 1);
111 | p->PID = bs_read_uimsbf(bs, 13);
112 | p->transport_scrambling_control = bs_read_bslbf(bs, 2);
113 | p->adaptation_field_control = bs_read_bslbf(bs, 2);
114 | p->continuity_counter = bs_read_uimsbf(bs, 4);
115 | if (p->adaptation_field_control == 0x02 || p->adaptation_field_control == 0x03) {
116 | adaptation_field_read(p->adaptation_field, bs);
117 | };
118 | if (p->adaptation_field_control == 0x01 || p->adaptation_field_control == 0x03) {
119 | p->data_len = bs_read_bytes_all(bs, p->data);
120 | };
121 | return 0;
122 | };
123 |
124 | int PES_packet_read(PES_packet_t* p, bs_t* bs) {
125 | p->packet_start_code_prefix = bs_read_bslbf(bs, 24);
126 | p->stream_id = bs_read_uimsbf(bs, 8);
127 | p->PES_packet_length = bs_read_uimsbf(bs, 16);
128 | if (p->stream_id != pes_stream_id_program_stream_map && p->stream_id != pes_stream_id_padding_stream && p->stream_id != pes_stream_id_private_stream_2 && p->stream_id != pes_stream_id_ECM && p->stream_id != pes_stream_id_EMM && p->stream_id != pes_stream_id_program_stream_directory && p->stream_id != pes_stream_id_DSMCC_stream && p->stream_id != pes_stream_id_H_222_1) {
129 | bs_skip_bslbf(bs, 2);
130 | p->PES_scrambling_control = bs_read_bslbf(bs, 2);
131 | p->PES_priority = bs_read_bslbf(bs, 1);
132 | p->data_alignment_indicator = bs_read_bslbf(bs, 1);
133 | p->copyright = bs_read_bslbf(bs, 1);
134 | p->original_or_copy = bs_read_bslbf(bs, 1);
135 | p->PTS_DTS_flags = bs_read_bslbf(bs, 2);
136 | p->ESCR_flag = bs_read_bslbf(bs, 1);
137 | p->ES_rate_flag = bs_read_bslbf(bs, 1);
138 | p->DSM_trick_mode_flag = bs_read_bslbf(bs, 1);
139 | p->additional_copy_info_flag = bs_read_bslbf(bs, 1);
140 | p->PES_CRC_flag = bs_read_bslbf(bs, 1);
141 | p->PES_extension_flag = bs_read_bslbf(bs, 1);
142 | p->PES_header_data_length = bs_read_uimsbf(bs, 8);
143 | if (p->PTS_DTS_flags == 0x02) {
144 | bs_skip_bslbf(bs, 4);
145 | p->PTS = bs_read_timestamp_with_markers(bs, 36);
146 | };
147 | if (p->PTS_DTS_flags == 0x03) {
148 | bs_skip_bslbf(bs, 4);
149 | p->PTS = bs_read_timestamp_with_markers(bs, 36);
150 | bs_skip_bslbf(bs, 4);
151 | p->DTS = bs_read_timestamp_with_markers(bs, 36);
152 | };
153 | if (p->ESCR_flag == 1) {
154 | bs_skip_bslbf(bs, 2);
155 | p->ESCR_base = bs_read_timestamp_with_markers(bs, 36);
156 | p->ESCR_extension = bs_read_uimsbf(bs, 9);
157 | bs_skip_bslbf(bs, 1);
158 | };
159 | if (p->ES_rate_flag == 1) {
160 | bs_skip_bslbf(bs, 1);
161 | p->ES_rate = bs_read_uimsbf(bs, 22);
162 | bs_skip_bslbf(bs, 1);
163 | };
164 | if (p->DSM_trick_mode_flag == 1) {
165 | p->trick_mode_control = bs_read_uimsbf(bs, 3);
166 | if (p->trick_mode_control == trick_mode_control_fast_forward) {
167 | p->field_id = bs_read_bslbf(bs, 2);
168 | p->intra_slice_refresh = bs_read_bslbf(bs, 1);
169 | p->frequency_truncation = bs_read_bslbf(bs, 2);
170 | };
171 | if (p->trick_mode_control == trick_mode_control_slow_motion) {
172 | p->rep_cntrl = bs_read_uimsbf(bs, 5);
173 | };
174 | if (p->trick_mode_control == trick_mode_control_freeze_frame) {
175 | p->field_id = bs_read_uimsbf(bs, 2);
176 | bs_skip_bslbf(bs, 3);
177 | };
178 | if (p->trick_mode_control == trick_mode_control_fast_reverse) {
179 | p->field_id = bs_read_bslbf(bs, 2);
180 | p->intra_slice_refresh = bs_read_bslbf(bs, 1);
181 | p->frequency_truncation = bs_read_bslbf(bs, 2);
182 | };
183 | if (p->trick_mode_control == trick_mode_control_slow_reverse) {
184 | p->rep_cntrl = bs_read_uimsbf(bs, 5);
185 | };
186 | if (p->trick_mode_control != trick_mode_control_fast_forward && p->trick_mode_control != trick_mode_control_slow_motion && p->trick_mode_control != trick_mode_control_freeze_frame && p->trick_mode_control != trick_mode_control_fast_reverse && p->trick_mode_control != trick_mode_control_slow_reverse) {
187 | bs_skip_bslbf(bs, 5);
188 | };
189 | };
190 | if (p->additional_copy_info_flag == 1) {
191 | bs_skip_bslbf(bs, 1);
192 | p->additional_copy_info = bs_read_bslbf(bs, 7);
193 | };
194 | if (p->PES_CRC_flag == 1) {
195 | p->previous_PES_packet_CRC = bs_read_bslbf(bs, 16);
196 | };
197 | if (p->PES_extension_flag == 1) {
198 | p->PES_private_data_flag = bs_read_bslbf(bs, 1);
199 | p->pack_header_field_flag = bs_read_bslbf(bs, 1);
200 | p->program_packet_sequence_counter_flag = bs_read_bslbf(bs, 1);
201 | p->P_STD_buffer_flag = bs_read_bslbf(bs, 1);
202 | bs_skip_bslbf(bs, 3);
203 | p->PES_extension_flag_2 = bs_read_bslbf(bs, 1);
204 | if (p->PES_private_data_flag == 1) {
205 | p->PES_private_data = bs_read_bslbf(bs, 128);
206 | };
207 | if (p->pack_header_field_flag == 1) {
208 | p->pack_field_length = bs_read_uimsbf(bs, 8);
209 | p->pack_header_len = bs_read_bytes(bs, p->pack_header, p->pack_field_length);
210 | };
211 | if (p->program_packet_sequence_counter_flag == 1) {
212 | bs_skip_bslbf(bs, 1);
213 | p->program_packet_sequence_counter = bs_read_uimsbf(bs, 7);
214 | bs_skip_bslbf(bs, 1);
215 | p->MPEG1_MPEG2_identifier = bs_read_bslbf(bs, 1);
216 | p->original_stuff_length = bs_read_uimsbf(bs, 6);
217 | };
218 | if (p->P_STD_buffer_flag == 1) {
219 | bs_skip_bslbf(bs, 2);
220 | p->P_STD_buffer_scale = bs_read_bslbf(bs, 1);
221 | p->P_STD_buffer_size = bs_read_uimsbf(bs, 13);
222 | };
223 | if (p->PES_extension_flag_2 == 1) {
224 | bs_skip_bslbf(bs, 1);
225 | p->PES_extension_field_length = bs_read_uimsbf(bs, 7);
226 | p->PES_extension_field_len = bs_read_bytes(bs, p->PES_extension_field, p->PES_extension_field_length);
227 | };
228 | p->PES_packet_data_len = bs_read_bytes_all(bs, p->PES_packet_data);
229 | };
230 | };
231 | if (p->stream_id != pes_stream_id_program_stream_map && p->stream_id != pes_stream_id_padding_stream && p->stream_id != pes_stream_id_private_stream_2 && p->stream_id != pes_stream_id_ECM && p->stream_id != pes_stream_id_EMM && p->stream_id != pes_stream_id_program_stream_directory && p->stream_id != pes_stream_id_DSMCC_stream && p->stream_id != pes_stream_id_H_222_1) {
232 | p->PES_packet_data_len = bs_read_bytes_all(bs, p->PES_packet_data);
233 | };
234 | return 0;
235 | };
236 |
237 | int adaptation_field_write(adaptation_field_t* p, bs_t* bs) {
238 | bs_write_uimsbf(bs, p->adaptation_field_length, 8);
239 | if (p->adaptation_field_length > 0) {
240 | bs_write_bslbf(bs, p->discontinuity_indicator, 1);
241 | bs_write_bslbf(bs, p->random_access_indicator, 1);
242 | bs_write_bslbf(bs, p->elementary_stream_priority_indicator, 1);
243 | bs_write_bslbf(bs, p->PCR_flag, 1);
244 | bs_write_bslbf(bs, p->OPCR_flag, 1);
245 | bs_write_bslbf(bs, p->splicing_point_flag, 1);
246 | bs_write_bslbf(bs, p->transport_private_data_flag, 1);
247 | bs_write_bslbf(bs, p->adaptation_field_extension_flag, 1);
248 | if (p->PCR_flag == 1) {
249 | bs_write_uimsbf(bs, p->program_clock_reference_base, 33);
250 | bs_write_bslbf(bs, 0, 6);
251 | bs_write_uimsbf(bs, p->program_clock_reference_extension, 9);
252 | };
253 | if (p->OPCR_flag == 1) {
254 | bs_write_uimsbf(bs, p->original_program_clock_reference_base, 33);
255 | bs_write_bslbf(bs, 0, 6);
256 | bs_write_uimsbf(bs, p->original_program_clock_reference_extension, 9);
257 | };
258 | if (p->splicing_point_flag == 1) {
259 | bs_write_tcimsbf(bs, p->splice_countdown, 8);
260 | };
261 | if (p->transport_private_data_flag == 1) {
262 | bs_write_uimsbf(bs, p->transport_private_data_length, 8);
263 | bs_write_bytes(bs, p->private_data, p->private_data_len);
264 | };
265 | if (p->adaptation_field_extension_flag == 1) {
266 | bs_write_uimsbf(bs, p->adaptation_field_extension_length, 8);
267 | bs_write_bslbf(bs, p->ltw_flag, 1);
268 | bs_write_bslbf(bs, p->piecewise_rate_flag, 1);
269 | bs_write_bslbf(bs, p->seamless_splice_flag, 1);
270 | bs_write_bslbf(bs, 0, 5);
271 | if (p->ltw_flag == 1) {
272 | bs_write_bslbf(bs, p->ltw_valid_flag, 1);
273 | bs_write_uimsbf(bs, p->ltw_offset, 15);
274 | };
275 | if (p->piecewise_rate_flag == 1) {
276 | bs_write_bslbf(bs, 0, 2);
277 | bs_write_uimsbf(bs, p->piecewise_rate, 22);
278 | };
279 | if (p->seamless_splice_flag == 1) {
280 | bs_write_bslbf(bs, p->splice_type, 4);
281 | bs_write_timestamp_with_markers(bs, p->DTS_next_AU, 36);
282 | };
283 | bs_fill_bytes_all(bs, 0);
284 | };
285 | bs_fill_bytes_all(bs, 0xFF);
286 | };
287 | return 0;
288 | };
289 |
290 | int transport_packet_write(transport_packet_t* p, bs_t* bs) {
291 | bs_write_bslbf(bs, 0x47, 8);
292 | bs_write_bslbf(bs, p->transport_error_indicator, 1);
293 | bs_write_bslbf(bs, p->payload_unit_start_indicator, 1);
294 | bs_write_bslbf(bs, p->transport_priority, 1);
295 | bs_write_uimsbf(bs, p->PID, 13);
296 | bs_write_bslbf(bs, p->transport_scrambling_control, 2);
297 | bs_write_bslbf(bs, p->adaptation_field_control, 2);
298 | bs_write_uimsbf(bs, p->continuity_counter, 4);
299 | if (p->adaptation_field_control == 0x02 || p->adaptation_field_control == 0x03) {
300 | adaptation_field_write(p->adaptation_field, bs);
301 | };
302 | if (p->adaptation_field_control == 0x01 || p->adaptation_field_control == 0x03) {
303 | bs_write_bytes(bs, p->data, p->data_len);
304 | };
305 | return 0;
306 | };
307 |
308 | int PES_packet_write(PES_packet_t* p, bs_t* bs) {
309 | bs_write_bslbf(bs, p->packet_start_code_prefix, 24);
310 | bs_write_uimsbf(bs, p->stream_id, 8);
311 | bs_write_uimsbf(bs, p->PES_packet_length, 16);
312 | if (p->stream_id != pes_stream_id_program_stream_map && p->stream_id != pes_stream_id_padding_stream && p->stream_id != pes_stream_id_private_stream_2 && p->stream_id != pes_stream_id_ECM && p->stream_id != pes_stream_id_EMM && p->stream_id != pes_stream_id_program_stream_directory && p->stream_id != pes_stream_id_DSMCC_stream && p->stream_id != pes_stream_id_H_222_1) {
313 | bs_write_bslbf(bs, 0x02, 2);
314 | bs_write_bslbf(bs, p->PES_scrambling_control, 2);
315 | bs_write_bslbf(bs, p->PES_priority, 1);
316 | bs_write_bslbf(bs, p->data_alignment_indicator, 1);
317 | bs_write_bslbf(bs, p->copyright, 1);
318 | bs_write_bslbf(bs, p->original_or_copy, 1);
319 | bs_write_bslbf(bs, p->PTS_DTS_flags, 2);
320 | bs_write_bslbf(bs, p->ESCR_flag, 1);
321 | bs_write_bslbf(bs, p->ES_rate_flag, 1);
322 | bs_write_bslbf(bs, p->DSM_trick_mode_flag, 1);
323 | bs_write_bslbf(bs, p->additional_copy_info_flag, 1);
324 | bs_write_bslbf(bs, p->PES_CRC_flag, 1);
325 | bs_write_bslbf(bs, p->PES_extension_flag, 1);
326 | bs_write_uimsbf(bs, p->PES_header_data_length, 8);
327 | if (p->PTS_DTS_flags == 0x02) {
328 | bs_write_bslbf(bs, 0x02, 4);
329 | bs_write_timestamp_with_markers(bs, p->PTS, 36);
330 | };
331 | if (p->PTS_DTS_flags == 0x03) {
332 | bs_write_bslbf(bs, 0x03, 4);
333 | bs_write_timestamp_with_markers(bs, p->PTS, 36);
334 | bs_write_bslbf(bs, 0x01, 4);
335 | bs_write_timestamp_with_markers(bs, p->DTS, 36);
336 | };
337 | if (p->ESCR_flag == 1) {
338 | bs_write_bslbf(bs, 0, 2);
339 | bs_write_timestamp_with_markers(bs, p->ESCR_base, 36);
340 | bs_write_uimsbf(bs, p->ESCR_extension, 9);
341 | bs_write_bslbf(bs, 1, 1);
342 | };
343 | if (p->ES_rate_flag == 1) {
344 | bs_write_bslbf(bs, 1, 1);
345 | bs_write_uimsbf(bs, p->ES_rate, 22);
346 | bs_write_bslbf(bs, 1, 1);
347 | };
348 | if (p->DSM_trick_mode_flag == 1) {
349 | bs_write_uimsbf(bs, p->trick_mode_control, 3);
350 | if (p->trick_mode_control == trick_mode_control_fast_forward) {
351 | bs_write_bslbf(bs, p->field_id, 2);
352 | bs_write_bslbf(bs, p->intra_slice_refresh, 1);
353 | bs_write_bslbf(bs, p->frequency_truncation, 2);
354 | };
355 | if (p->trick_mode_control == trick_mode_control_slow_motion) {
356 | bs_write_uimsbf(bs, p->rep_cntrl, 5);
357 | };
358 | if (p->trick_mode_control == trick_mode_control_freeze_frame) {
359 | bs_write_uimsbf(bs, p->field_id, 2);
360 | bs_write_bslbf(bs, 0, 3);
361 | };
362 | if (p->trick_mode_control == trick_mode_control_fast_reverse) {
363 | bs_write_bslbf(bs, p->field_id, 2);
364 | bs_write_bslbf(bs, p->intra_slice_refresh, 1);
365 | bs_write_bslbf(bs, p->frequency_truncation, 2);
366 | };
367 | if (p->trick_mode_control == trick_mode_control_slow_reverse) {
368 | bs_write_uimsbf(bs, p->rep_cntrl, 5);
369 | };
370 | if (p->trick_mode_control != trick_mode_control_fast_forward && p->trick_mode_control != trick_mode_control_slow_motion && p->trick_mode_control != trick_mode_control_freeze_frame && p->trick_mode_control != trick_mode_control_fast_reverse && p->trick_mode_control != trick_mode_control_slow_reverse) {
371 | bs_write_bslbf(bs, 0, 5);
372 | };
373 | };
374 | if (p->additional_copy_info_flag == 1) {
375 | bs_write_bslbf(bs, 1, 1);
376 | bs_write_bslbf(bs, p->additional_copy_info, 7);
377 | };
378 | if (p->PES_CRC_flag == 1) {
379 | bs_write_bslbf(bs, p->previous_PES_packet_CRC, 16);
380 | };
381 | if (p->PES_extension_flag == 1) {
382 | bs_write_bslbf(bs, p->PES_private_data_flag, 1);
383 | bs_write_bslbf(bs, p->pack_header_field_flag, 1);
384 | bs_write_bslbf(bs, p->program_packet_sequence_counter_flag, 1);
385 | bs_write_bslbf(bs, p->P_STD_buffer_flag, 1);
386 | bs_write_bslbf(bs, 0, 3);
387 | bs_write_bslbf(bs, p->PES_extension_flag_2, 1);
388 | if (p->PES_private_data_flag == 1) {
389 | bs_write_bslbf(bs, p->PES_private_data, 128);
390 | };
391 | if (p->pack_header_field_flag == 1) {
392 | bs_write_uimsbf(bs, p->pack_field_length, 8);
393 | bs_write_bytes(bs, p->pack_header, p->pack_header_len);
394 | };
395 | if (p->program_packet_sequence_counter_flag == 1) {
396 | bs_write_bslbf(bs, 1, 1);
397 | bs_write_uimsbf(bs, p->program_packet_sequence_counter, 7);
398 | bs_write_bslbf(bs, 1, 1);
399 | bs_write_bslbf(bs, p->MPEG1_MPEG2_identifier, 1);
400 | bs_write_uimsbf(bs, p->original_stuff_length, 6);
401 | };
402 | if (p->P_STD_buffer_flag == 1) {
403 | bs_write_bslbf(bs, 0x02, 2);
404 | bs_write_bslbf(bs, p->P_STD_buffer_scale, 1);
405 | bs_write_uimsbf(bs, p->P_STD_buffer_size, 13);
406 | };
407 | if (p->PES_extension_flag_2 == 1) {
408 | bs_write_bslbf(bs, 1, 1);
409 | bs_write_uimsbf(bs, p->PES_extension_field_length, 7);
410 | bs_write_bytes(bs, p->PES_extension_field, p->PES_extension_field_len);
411 | };
412 | bs_write_bytes(bs, p->PES_packet_data, p->PES_packet_data_len);
413 | };
414 | };
415 | if (p->stream_id != pes_stream_id_program_stream_map && p->stream_id != pes_stream_id_padding_stream && p->stream_id != pes_stream_id_private_stream_2 && p->stream_id != pes_stream_id_ECM && p->stream_id != pes_stream_id_EMM && p->stream_id != pes_stream_id_program_stream_directory && p->stream_id != pes_stream_id_DSMCC_stream && p->stream_id != pes_stream_id_H_222_1) {
416 | bs_write_bytes(bs, p->PES_packet_data, p->PES_packet_data_len);
417 | };
418 | return 0;
419 | };
420 |
421 | int adaptation_field_len(adaptation_field_t* p) {
422 | int len;
423 | len = 0;
424 | len += 1;
425 | len += 1;
426 | len += 1;
427 | len += 5;
428 | if (p->ltw_flag == 1) {
429 | len += 1;
430 | len += 15;
431 | };
432 | if (p->piecewise_rate_flag == 1) {
433 | len += 2;
434 | len += 22;
435 | };
436 | if (p->seamless_splice_flag == 1) {
437 | len += 4;
438 | len += 36;
439 | };
440 | if (p->adaptation_field_extension_length < len /8) { p->adaptation_field_extension_length = len /8; };
441 |
442 | len = 0;
443 | if (p->adaptation_field_length > 0) {
444 | len += 1;
445 | len += 1;
446 | len += 1;
447 | len += 1;
448 | len += 1;
449 | len += 1;
450 | len += 1;
451 | len += 1;
452 | if (p->PCR_flag == 1) {
453 | len += 33;
454 | len += 6;
455 | len += 9;
456 | };
457 | if (p->OPCR_flag == 1) {
458 | len += 33;
459 | len += 6;
460 | len += 9;
461 | };
462 | if (p->splicing_point_flag == 1) {
463 | len += 8;
464 | };
465 | if (p->transport_private_data_flag == 1) {
466 | len += 8;
467 | len += p->private_data_len *8;
468 | p->transport_private_data_length = p->private_data_len;
469 | };
470 | if (p->adaptation_field_extension_flag == 1) {
471 | len += 8;
472 | len += p->adaptation_field_extension_length *8;
473 | };
474 | };
475 | if (p->adaptation_field_length < len /8) { p->adaptation_field_length = len /8; };
476 |
477 | len = 0;
478 | len += 8;
479 | len += p->adaptation_field_length *8;
480 | return len /8;
481 | };
482 |
483 | int transport_packet_len(transport_packet_t* p) {
484 | int len;
485 | len = 0;
486 | len += 8;
487 | len += 1;
488 | len += 1;
489 | len += 1;
490 | len += 13;
491 | len += 2;
492 | len += 2;
493 | len += 4;
494 | if (p->adaptation_field_control == 0x02 || p->adaptation_field_control == 0x03) {
495 | len += adaptation_field_len(p->adaptation_field);
496 | };
497 | if (p->adaptation_field_control == 0x01 || p->adaptation_field_control == 0x03) {
498 | len += p->data_len *8;
499 | };
500 | return len /8;
501 | };
502 |
503 | int PES_packet_len(PES_packet_t* p) {
504 | int len;
505 | len = 0;
506 | if (p->stream_id != pes_stream_id_program_stream_map && p->stream_id != pes_stream_id_padding_stream && p->stream_id != pes_stream_id_private_stream_2 && p->stream_id != pes_stream_id_ECM && p->stream_id != pes_stream_id_EMM && p->stream_id != pes_stream_id_program_stream_directory && p->stream_id != pes_stream_id_DSMCC_stream && p->stream_id != pes_stream_id_H_222_1) {
507 | len += 2;
508 | len += 2;
509 | len += 1;
510 | len += 1;
511 | len += 1;
512 | len += 1;
513 | len += 2;
514 | len += 1;
515 | len += 1;
516 | len += 1;
517 | len += 1;
518 | len += 1;
519 | len += 1;
520 | len += 8;
521 | if (p->PTS_DTS_flags == 0x02) {
522 | len += 4;
523 | len += 36;
524 | };
525 | if (p->PTS_DTS_flags == 0x03) {
526 | len += 4;
527 | len += 36;
528 | len += 4;
529 | len += 36;
530 | };
531 | if (p->ESCR_flag == 1) {
532 | len += 2;
533 | len += 36;
534 | len += 9;
535 | len += 1;
536 | };
537 | if (p->ES_rate_flag == 1) {
538 | len += 1;
539 | len += 22;
540 | len += 1;
541 | };
542 | if (p->DSM_trick_mode_flag == 1) {
543 | len += 3;
544 | if (p->trick_mode_control == trick_mode_control_fast_forward) {
545 | len += 2;
546 | len += 1;
547 | len += 2;
548 | };
549 | if (p->trick_mode_control == trick_mode_control_slow_motion) {
550 | len += 5;
551 | };
552 | if (p->trick_mode_control == trick_mode_control_freeze_frame) {
553 | len += 2;
554 | len += 3;
555 | };
556 | if (p->trick_mode_control == trick_mode_control_fast_reverse) {
557 | len += 2;
558 | len += 1;
559 | len += 2;
560 | };
561 | if (p->trick_mode_control == trick_mode_control_slow_reverse) {
562 | len += 5;
563 | };
564 | if (p->trick_mode_control != trick_mode_control_fast_forward && p->trick_mode_control != trick_mode_control_slow_motion && p->trick_mode_control != trick_mode_control_freeze_frame && p->trick_mode_control != trick_mode_control_fast_reverse && p->trick_mode_control != trick_mode_control_slow_reverse) {
565 | len += 5;
566 | };
567 | };
568 | if (p->additional_copy_info_flag == 1) {
569 | len += 1;
570 | len += 7;
571 | };
572 | if (p->PES_CRC_flag == 1) {
573 | len += 16;
574 | };
575 | if (p->PES_extension_flag == 1) {
576 | len += 1;
577 | len += 1;
578 | len += 1;
579 | len += 1;
580 | len += 3;
581 | len += 1;
582 | if (p->PES_private_data_flag == 1) {
583 | len += 128;
584 | };
585 | if (p->pack_header_field_flag == 1) {
586 | len += 8;
587 | len += p->pack_header_len *8;
588 | p->pack_field_length = p->pack_header_len;
589 | };
590 | if (p->program_packet_sequence_counter_flag == 1) {
591 | len += 1;
592 | len += 7;
593 | len += 1;
594 | len += 1;
595 | len += 6;
596 | };
597 | if (p->P_STD_buffer_flag == 1) {
598 | len += 2;
599 | len += 1;
600 | len += 13;
601 | };
602 | if (p->PES_extension_flag_2 == 1) {
603 | len += 1;
604 | len += 7;
605 | len += p->PES_extension_field_len *8;
606 | p->PES_extension_field_length = p->PES_extension_field_len;
607 | };
608 | len += p->PES_packet_data_len *8;
609 | };
610 | };
611 | if (p->stream_id != pes_stream_id_program_stream_map && p->stream_id != pes_stream_id_padding_stream && p->stream_id != pes_stream_id_private_stream_2 && p->stream_id != pes_stream_id_ECM && p->stream_id != pes_stream_id_EMM && p->stream_id != pes_stream_id_program_stream_directory && p->stream_id != pes_stream_id_DSMCC_stream && p->stream_id != pes_stream_id_H_222_1) {
612 | len += p->PES_packet_data_len *8;
613 | };
614 | if (p->PES_packet_length < len /8) { p->PES_packet_length = len /8; };
615 |
616 | len = 0;
617 | len += 24;
618 | len += 8;
619 | len += 16;
620 | len += p->PES_packet_length *8;
621 | return len /8;
622 | };
623 |
624 |
--------------------------------------------------------------------------------
/mpeg2ts.c_prefix:
--------------------------------------------------------------------------------
1 | /*
2 | # libmpeg2ts, a MPEG2 transport stream reading/writing library
3 | #
4 | # Copyright (C) 2012 Alexander Izvorski
5 | #
6 | # This file is part of libmpeg2ts.
7 | #
8 | # libmpeg2ts is free software: you can redistribute it and/or modify
9 | # it under the terms of the GNU General Public License as published by
10 | # the Free Software Foundation, either version 3 of the License, or
11 | # (at your option) any later version.
12 | #
13 | # libmpeg2ts is distributed in the hope that it will be useful,
14 | # but WITHOUT ANY WARRANTY; without even the implied warranty of
15 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 | # GNU General Public License for more details.
17 | #
18 | # You should have received a copy of the GNU General Public License
19 | # along with libmpeg2ts. If not, see .
20 | */
21 |
22 |
23 | #include "mpeg2ts.h"
24 | #include "bs.h"
25 |
26 |
--------------------------------------------------------------------------------
/mpeg2ts.h:
--------------------------------------------------------------------------------
1 | /*
2 | # libmpeg2ts, a MPEG2 transport stream reading/writing library
3 | #
4 | # Copyright (C) 2012 Alexander Izvorski
5 | #
6 | # This file is part of libmpeg2ts.
7 | #
8 | # libmpeg2ts is free software: you can redistribute it and/or modify
9 | # it under the terms of the GNU General Public License as published by
10 | # the Free Software Foundation, either version 3 of the License, or
11 | # (at your option) any later version.
12 | #
13 | # libmpeg2ts is distributed in the hope that it will be useful,
14 | # but WITHOUT ANY WARRANTY; without even the implied warranty of
15 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 | # GNU General Public License for more details.
17 | #
18 | # You should have received a copy of the GNU General Public License
19 | # along with libmpeg2ts. If not, see .
20 | */
21 |
22 |
23 | #ifndef _MPEG2TS_H
24 | #define _MPEG2TS_H 1
25 |
26 | #include
27 |
28 | #include "bs.h"
29 |
30 | #ifdef __cplusplus
31 | extern "C" {
32 | #endif
33 |
34 | typedef struct {
35 | int adaptation_field_length;
36 | int discontinuity_indicator;
37 | int random_access_indicator;
38 | int elementary_stream_priority_indicator;
39 | int PCR_flag;
40 | int OPCR_flag;
41 | int splicing_point_flag;
42 | int transport_private_data_flag;
43 | int adaptation_field_extension_flag;
44 | int program_clock_reference_base;
45 | int program_clock_reference_extension;
46 | int original_program_clock_reference_base;
47 | int original_program_clock_reference_extension;
48 | int splice_countdown;
49 | int transport_private_data_length;
50 | uint8_t* private_data;
51 | int private_data_len;
52 | int adaptation_field_extension_length;
53 | int ltw_flag;
54 | int piecewise_rate_flag;
55 | int seamless_splice_flag;
56 | int ltw_valid_flag;
57 | int ltw_offset;
58 | int piecewise_rate;
59 | int splice_type;
60 | int DTS_next_AU;
61 | } adaptation_field_t;
62 |
63 | typedef struct {
64 | int transport_error_indicator;
65 | int payload_unit_start_indicator;
66 | int transport_priority;
67 | int PID;
68 | int transport_scrambling_control;
69 | int adaptation_field_control;
70 | int continuity_counter;
71 | adaptation_field_t* adaptation_field;
72 | uint8_t* data;
73 | int data_len;
74 | } transport_packet_t;
75 |
76 | #define pes_stream_id_program_stream_map 0
77 | #define pes_stream_id_padding_stream 0
78 | #define pes_stream_id_private_stream_2 0
79 | #define pes_stream_id_ECM 0
80 | #define pes_stream_id_EMM 0
81 | #define pes_stream_id_program_stream_directory 0
82 | #define pes_stream_id_DSMCC_stream 0
83 | #define pes_stream_id_H_222_1 0
84 | #define trick_mode_control_fast_forward 0
85 | #define trick_mode_control_slow_motion 0
86 | #define trick_mode_control_freeze_frame 0
87 | #define trick_mode_control_fast_reverse 0
88 | #define trick_mode_control_slow_reverse 0
89 | typedef struct {
90 | int packet_start_code_prefix;
91 | int stream_id;
92 | int PES_packet_length;
93 | int PES_scrambling_control;
94 | int PES_priority;
95 | int data_alignment_indicator;
96 | int copyright;
97 | int original_or_copy;
98 | int PTS_DTS_flags;
99 | int ESCR_flag;
100 | int ES_rate_flag;
101 | int DSM_trick_mode_flag;
102 | int additional_copy_info_flag;
103 | int PES_CRC_flag;
104 | int PES_extension_flag;
105 | int PES_header_data_length;
106 | int PTS;
107 | int DTS;
108 | int ESCR_base;
109 | int ESCR_extension;
110 | int ES_rate;
111 | int trick_mode_control;
112 | int field_id;
113 | int intra_slice_refresh;
114 | int frequency_truncation;
115 | int rep_cntrl;
116 | int additional_copy_info;
117 | int previous_PES_packet_CRC;
118 | int PES_private_data_flag;
119 | int pack_header_field_flag;
120 | int program_packet_sequence_counter_flag;
121 | int P_STD_buffer_flag;
122 | int PES_extension_flag_2;
123 | int PES_private_data;
124 | int pack_field_length;
125 | uint8_t* pack_header;
126 | int pack_header_len;
127 | int program_packet_sequence_counter;
128 | int MPEG1_MPEG2_identifier;
129 | int original_stuff_length;
130 | int P_STD_buffer_scale;
131 | int P_STD_buffer_size;
132 | int PES_extension_field_length;
133 | uint8_t* PES_extension_field;
134 | int PES_extension_field_len;
135 | uint8_t* PES_packet_data;
136 | int PES_packet_data_len;
137 | } PES_packet_t;
138 |
139 | adaptation_field_t* adaptation_field_new();
140 | void adaptation_field_free(adaptation_field_t* p);
141 | int adaptation_field_write(adaptation_field_t* p, bs_t* bs);
142 | int adaptation_field_read(adaptation_field_t* p, bs_t* bs);
143 | int adaptation_field_len(adaptation_field_t* p);
144 |
145 | transport_packet_t* transport_packet_new();
146 | void transport_packet_free(transport_packet_t* p);
147 | int transport_packet_write(transport_packet_t* p, bs_t* bs);
148 | int transport_packet_read(transport_packet_t* p, bs_t* bs);
149 | int transport_packet_len(transport_packet_t* p);
150 |
151 | PES_packet_t* PES_packet_new();
152 | void PES_packet_free(PES_packet_t* p);
153 | int PES_packet_write(PES_packet_t* p, bs_t* bs);
154 | int PES_packet_read(PES_packet_t* p, bs_t* bs);
155 | int PES_packet_len(PES_packet_t* p);
156 |
157 |
158 | #ifdef __cplusplus
159 | }
160 | #endif
161 |
162 | #endif
163 |
--------------------------------------------------------------------------------
/mpeg2ts.h_prefix:
--------------------------------------------------------------------------------
1 | /*
2 | # libmpeg2ts, a MPEG2 transport stream reading/writing library
3 | #
4 | # Copyright (C) 2012 Alexander Izvorski
5 | #
6 | # This file is part of libmpeg2ts.
7 | #
8 | # libmpeg2ts is free software: you can redistribute it and/or modify
9 | # it under the terms of the GNU General Public License as published by
10 | # the Free Software Foundation, either version 3 of the License, or
11 | # (at your option) any later version.
12 | #
13 | # libmpeg2ts is distributed in the hope that it will be useful,
14 | # but WITHOUT ANY WARRANTY; without even the implied warranty of
15 | # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 | # GNU General Public License for more details.
17 | #
18 | # You should have received a copy of the GNU General Public License
19 | # along with libmpeg2ts. If not, see .
20 | */
21 |
22 |
23 | #ifndef _MPEG2TS_H
24 | #define _MPEG2TS_H 1
25 |
26 | #include
27 |
28 | #include "bs.h"
29 |
30 | #ifdef __cplusplus
31 | extern "C" {
32 | #endif
33 |
34 |
--------------------------------------------------------------------------------
/mpeg2ts.h_suffix:
--------------------------------------------------------------------------------
1 |
2 | #ifdef __cplusplus
3 | }
4 | #endif
5 |
6 | #endif
7 |
--------------------------------------------------------------------------------
/mpeg2ts.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
25 |
26 |
27 |
28 |
29 |
30 |
31 |
32 |
33 |
34 |
35 |
36 |
37 |
38 |
39 |
40 |
41 |
42 |
43 |
44 |
45 |
46 |
47 |
48 |
49 |
50 |
51 |
52 |
53 |
54 |
55 |
56 |
57 |
58 |
59 |
60 |
61 |
62 |
63 |
64 |
65 |
66 |
67 |
68 |
69 |
70 |
71 |
72 |
73 |
74 |
75 |
76 |
77 |
78 |
79 |
80 |
81 |
82 |
83 |
84 |
85 |
86 |
87 |
88 |
89 |
90 |
91 |
92 |
93 |
94 |
95 |
96 |
97 |
98 |
99 |
100 |
101 |
102 |
103 |
104 |
105 |
106 |
107 |
108 |
109 |
110 |
111 |
112 |
113 |
114 |
115 |
116 |
117 |
118 |
119 |
120 |
128 |
129 |
130 |
131 |
132 |
133 |
134 |
135 |
136 |
137 |
138 |
139 |
140 |
141 |
142 |
143 |
144 |
145 |
146 |
147 |
148 |
149 |
150 |
151 |
152 |
153 |
154 |
155 |
156 |
157 |
158 |
159 |
160 |
161 |
162 |
163 |
164 |
165 |
166 |
167 |
168 |
169 |
170 |
171 |
172 |
173 |
174 |
175 |
176 |
177 |
178 |
179 |
180 |
181 |
182 |
183 |
184 |
185 |
190 |
191 |
192 |
193 |
194 |
195 |
196 |
197 |
198 |
199 |
200 |
201 |
202 |
203 |
204 |
205 |
206 |
207 |
208 |
209 |
210 |
211 |
212 |
213 |
214 |
215 |
216 |
217 |
218 |
219 |
220 |
221 |
222 |
223 |
224 |
225 |
226 |
227 |
228 |
229 |
230 |
231 |
232 |
233 |
234 |
235 |
236 |
244 |
245 |
246 |
247 |
248 |
249 |
--------------------------------------------------------------------------------