diff --git a/.gitignore b/.gitignore
index 121f1bcb3dffb0ecf9bd08a17593fd090ac3ff84..f2ae60ac56957e6f7308adf52e5f7e10a97aae13 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,3 +1,4 @@
+*.o
html/*
attic/*
/.project
@@ -8,4 +9,4 @@ attic/*
.directory
generated*
sysroots
-bitbake-logs
\ No newline at end of file
+bitbake-logs
diff --git a/LICENSE b/LICENSE
new file mode 100644
index 0000000000000000000000000000000000000000..9cecc1d4669ee8af2ca727a5d8cde10cd8b2d7cc
--- /dev/null
+++ b/LICENSE
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc.
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ {one line to give the program's name and a brief idea of what it does.}
+ Copyright (C) {year} {name of author}
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see .
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ {project} Copyright (C) {year} {fullname}
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+.
diff --git a/Makefile b/Makefile
index 37b12c7331bd93cd04eac152b56fc3fca6951cb4..923969ef34ddf94b39ecf66738ec868708fc431f 100644
--- a/Makefile
+++ b/Makefile
@@ -1,36 +1,27 @@
-PROGS = camogm
-PHPSCRIPTS = camogmstate.php
-CONFIGS = qt_source
-
-SRCS = camogm.c camogm_ogm.c camogm_jpeg.c camogm_mov.c camogm_kml.c camogm_read.c index_list.c
-OBJS = $(SRCS:.c=.o)
-
-CFLAGS += -Wall -I$(STAGING_KERNEL_DIR)/include/elphel -I$(STAGING_DIR_HOST)/usr/include-uapi
-LDLIBS += -logg -pthread -lm
-
-INSTALL = install
-INSTMODE = 0755
-INSTDOCS = 0644
-OWN = -o root -g root
-
-SYSCONFDIR = /etc/
-BINDIR = /usr/bin/
-WWW_PAGES = /www/pages
-
-all: $(PROGS)
-
-$(PROGS): $(OBJS)
- $(CC) $(LDFLAGS) $^ $(LDLIBS) -o $@
-
-install: $(PROGS) $(PHPSCRIPTS) $(CONFIGS)
- $(INSTALL) $(OWN) -d $(DESTDIR)$(BINDIR)
- $(INSTALL) $(OWN) -m $(INSTMODE) $(PROGS) $(DESTDIR)$(BINDIR)
- $(INSTALL) $(OWN) -d $(DESTDIR)$(SYSCONFDIR)
- $(INSTALL) $(OWN) -m $(INSTDOCS) $(CONFIGS) $(DESTDIR)$(SYSCONFDIR)
- $(INSTALL) $(OWN) -d $(DESTDIR)$(WWW_PAGES)
- $(INSTALL) $(OWN) -m $(INSTMODE) $(PHPSCRIPTS) $(DESTDIR)$(WWW_PAGES)
-
-clean:
- rm -rf $(PROGS) *.o *~
-#TODO: implement automatic dependencies!
-camogm.c:$(STAGING_DIR_HOST)/usr/include-uapi/elphel/x393_devices.h
+# Runs 'make', 'make install', and 'make clean' in specified subdirectories
+SUBDIRS := src
+INSTALLDIRS = $(SUBDIRS:%=install-%)
+CLEANDIRS = $(SUBDIRS:%=clean-%)
+
+#TARGETDIR=$(DESTDIR)/www/pages
+
+all: $(SUBDIRS)
+ @echo "make all top"
+
+$(SUBDIRS):
+ $(MAKE) -C $@
+
+install: $(INSTALLDIRS)
+ @echo "make install top"
+
+$(INSTALLDIRS):
+ $(MAKE) -C $(@:install-%=%) install
+
+clean: $(CLEANDIRS)
+ @echo "make clean top"
+
+$(CLEANDIRS):
+ $(MAKE) -C $(@:clean-%=%) clean
+
+.PHONY: all install clean $(SUBDIRS) $(INSTALLDIRS) $(CLEANDIRS)
+
diff --git a/eclipse_project_setup/.cproject b/eclipse_project_setup/.cproject
index 97872448c33a9e54a28d071be0176d24bfe3f3cf..6144eecd15e5709add0dce39fa1d2061eb3ca73a 100644
--- a/eclipse_project_setup/.cproject
+++ b/eclipse_project_setup/.cproject
@@ -3,90 +3,84 @@
-
+
-
-
-
-
-
-
+
+
+
+
+
+
-
+
-
-
-
-
-
-
-
+
+
+
+
+
+
-
-
-
-
-
-
-
-
+
+
+
-
+
-
-
-
-
-
-
-
-
-
-
+
-
+
-
+
-
+
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/eclipse_project_setup/.externalToolBuilders/SCP apps-camogm to target.launch b/eclipse_project_setup/.externalToolBuilders/SCP apps-camogm to target.launch
new file mode 100644
index 0000000000000000000000000000000000000000..d986c29c714d17d53e3ba4ee101e33ebad7ea468
--- /dev/null
+++ b/eclipse_project_setup/.externalToolBuilders/SCP apps-camogm to target.launch
@@ -0,0 +1,8 @@
+
+
+
+
+
+
+
+
diff --git a/Doxyfile b/src/Doxyfile
similarity index 100%
rename from Doxyfile
rename to src/Doxyfile
diff --git a/src/Makefile b/src/Makefile
new file mode 100644
index 0000000000000000000000000000000000000000..37b12c7331bd93cd04eac152b56fc3fca6951cb4
--- /dev/null
+++ b/src/Makefile
@@ -0,0 +1,36 @@
+PROGS = camogm
+PHPSCRIPTS = camogmstate.php
+CONFIGS = qt_source
+
+SRCS = camogm.c camogm_ogm.c camogm_jpeg.c camogm_mov.c camogm_kml.c camogm_read.c index_list.c
+OBJS = $(SRCS:.c=.o)
+
+CFLAGS += -Wall -I$(STAGING_KERNEL_DIR)/include/elphel -I$(STAGING_DIR_HOST)/usr/include-uapi
+LDLIBS += -logg -pthread -lm
+
+INSTALL = install
+INSTMODE = 0755
+INSTDOCS = 0644
+OWN = -o root -g root
+
+SYSCONFDIR = /etc/
+BINDIR = /usr/bin/
+WWW_PAGES = /www/pages
+
+all: $(PROGS)
+
+$(PROGS): $(OBJS)
+ $(CC) $(LDFLAGS) $^ $(LDLIBS) -o $@
+
+install: $(PROGS) $(PHPSCRIPTS) $(CONFIGS)
+ $(INSTALL) $(OWN) -d $(DESTDIR)$(BINDIR)
+ $(INSTALL) $(OWN) -m $(INSTMODE) $(PROGS) $(DESTDIR)$(BINDIR)
+ $(INSTALL) $(OWN) -d $(DESTDIR)$(SYSCONFDIR)
+ $(INSTALL) $(OWN) -m $(INSTDOCS) $(CONFIGS) $(DESTDIR)$(SYSCONFDIR)
+ $(INSTALL) $(OWN) -d $(DESTDIR)$(WWW_PAGES)
+ $(INSTALL) $(OWN) -m $(INSTMODE) $(PHPSCRIPTS) $(DESTDIR)$(WWW_PAGES)
+
+clean:
+ rm -rf $(PROGS) *.o *~
+#TODO: implement automatic dependencies!
+camogm.c:$(STAGING_DIR_HOST)/usr/include-uapi/elphel/x393_devices.h
diff --git a/camogm.c b/src/camogm.c
similarity index 89%
rename from camogm.c
rename to src/camogm.c
index 4e35c0d45b8e69b2f87c10053b6c740ae2fed1bf..12d578e1e2fdbd1380fd25939e85cf102a2ed437 100644
--- a/camogm.c
+++ b/src/camogm.c
@@ -346,129 +346,131 @@ int camogm_start(camogm_state *state)
state->prog_state = STATE_STARTING;
pthread_mutex_unlock(&state->mutex);
FOR_EACH_PORT(int, chn) {
- // Check/set circbuf read pointer
- D3(fprintf(debug_file, "1: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
- if ((state->cirbuf_rp[chn] < 0) || (lseek(state->fd_circ[chn], state->cirbuf_rp[chn], SEEK_SET) < 0) || (lseek(state->fd_circ[chn], LSEEK_CIRC_VALID, SEEK_END) < 0 )) {
- D3(fprintf(debug_file, "2: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
- /* In "greedy" mode try to save as many frames from the circbuf as possible */
- state->cirbuf_rp[chn] = lseek(state->fd_circ[chn], state->greedy ? LSEEK_CIRC_SCND : LSEEK_CIRC_LAST, SEEK_END);
- if (!state->ignore_fps) { // don't even try in ignore mode
- if (((fp = lseek(state->fd_circ[chn], LSEEK_CIRC_PREV, SEEK_END))) >= 0) state->cirbuf_rp[chn] = fp;//try to have 2 frames available for fps
- }
- state->buf_overruns[chn]++;
- // file pointer here should match state->rp; so no need to do lseek(state->fd_circ,state->cirbuf_rp,SEEK_SET);
- state->buf_min[chn] = getGPValue(chn, G_FREECIRCBUF);
+ if (is_chn_active(state, chn)) {
+ // Check/set circbuf read pointer
+ D3(fprintf(debug_file, "1: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
+ if ((state->cirbuf_rp[chn] < 0) || (lseek(state->fd_circ[chn], state->cirbuf_rp[chn], SEEK_SET) < 0) || (lseek(state->fd_circ[chn], LSEEK_CIRC_VALID, SEEK_END) < 0 )) {
+ D3(fprintf(debug_file, "2: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
+ /* In "greedy" mode try to save as many frames from the circbuf as possible */
+ state->cirbuf_rp[chn] = lseek(state->fd_circ[chn], state->greedy ? LSEEK_CIRC_SCND : LSEEK_CIRC_LAST, SEEK_END);
+ if (!state->ignore_fps) { // don't even try in ignore mode
+ if (((fp = lseek(state->fd_circ[chn], LSEEK_CIRC_PREV, SEEK_END))) >= 0) state->cirbuf_rp[chn] = fp;//try to have 2 frames available for fps
+ }
+ state->buf_overruns[chn]++;
+ // file pointer here should match state->rp; so no need to do lseek(state->fd_circ,state->cirbuf_rp,SEEK_SET);
+ state->buf_min[chn] = getGPValue(chn, G_FREECIRCBUF);
- } else {
- if (state->buf_min[chn] > getGPValue(chn, G_FREECIRCBUF)) state->buf_min[chn] = getGPValue(chn, G_FREECIRCBUF);
+ } else {
+ if (state->buf_min[chn] > getGPValue(chn, G_FREECIRCBUF)) state->buf_min[chn] = getGPValue(chn, G_FREECIRCBUF);
- }
- D3(fprintf(debug_file, "3: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
- D3(fprintf(debug_file, "4:lseek(state->fd_circ,LSEEK_CIRC_READY,SEEK_END)=%d\n", (int)lseek(state->fd_circ[chn], LSEEK_CIRC_READY, SEEK_END)));
+ }
+ D3(fprintf(debug_file, "3: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
+ D3(fprintf(debug_file, "4:lseek(state->fd_circ,LSEEK_CIRC_READY,SEEK_END)=%d\n", (int)lseek(state->fd_circ[chn], LSEEK_CIRC_READY, SEEK_END)));
- // is this frame ready?
- if (lseek(state->fd_circ[chn], LSEEK_CIRC_READY, SEEK_END) < 0) return -CAMOGM_FRAME_NOT_READY; // frame pointer valid, but no frames yet
- D3(fprintf(debug_file, "5: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
- state->metadata_start = (state->cirbuf_rp[chn]) - 32;
- if (state->metadata_start < 0) state->metadata_start += state->circ_buff_size[chn];
+ // is this frame ready?
+ if (lseek(state->fd_circ[chn], LSEEK_CIRC_READY, SEEK_END) < 0) return -CAMOGM_FRAME_NOT_READY; // frame pointer valid, but no frames yet
+ D3(fprintf(debug_file, "5: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
+ state->metadata_start = (state->cirbuf_rp[chn]) - 32;
+ if (state->metadata_start < 0) state->metadata_start += state->circ_buff_size[chn];
- // ==================================
+ // ==================================
- memcpy(&(state->frame_params[chn]), (unsigned long* )&ccam_dma_buf[chn][state->metadata_start >> 2], 32);
- state->jpeg_len = state->frame_params[chn].frame_length; // frame_params.frame_length are now the length of bitstream
+ memcpy(&(state->frame_params[chn]), (unsigned long* )&ccam_dma_buf[chn][state->metadata_start >> 2], 32);
+ state->jpeg_len = state->frame_params[chn].frame_length; // frame_params.frame_length are now the length of bitstream
- if (state->frame_params[chn].signffff != 0xffff) {
- D0(fprintf(debug_file, "%s:%d: wrong signature - %d\r\n", __FILE__, __LINE__, (int)state->frame_params[chn].signffff));
- state->cirbuf_rp[chn] = -1;
- ifp = (int *) &state->frame_params[chn];
- D1(fprintf(debug_file, "state->cirbuf_rp=0x%x\r\n", (int)state->cirbuf_rp[chn]));
- D1(fprintf(debug_file, "%08x %08x %08x %08x %08x %08x %08x %08x\r\n", ifp[0], ifp[1], ifp[2], ifp[3], ifp[4], ifp[5], ifp[6], ifp[7]));
- return -CAMOGM_FRAME_BROKEN;
- }
- // find location of the timestamp and copy it to the frame_params structure
- // ==================================
- timestamp_start = (state->cirbuf_rp[chn]) + ((state->jpeg_len + CCAM_MMAP_META + 3) & (~0x1f)) + 32 - CCAM_MMAP_META_SEC; // magic shift - should index first byte of the time stamp
- if (timestamp_start >= state->circ_buff_size[chn]) timestamp_start -= state->circ_buff_size[chn];
- memcpy(&(state->frame_params[chn].timestamp_sec), (unsigned long* )&ccam_dma_buf[chn][timestamp_start >> 2], 8);
- // New - see if current timestamp is later than start one, if not return "CAMOGM_TOO_EARLY" reset read pointer and buffer read pointer
- if (state->start_after_timestamp > 0.0) { // don't bother if it is 0
- dtime_stamp = 0.000001 * state->frame_params[chn].timestamp_usec + state->frame_params[chn].timestamp_sec;
- if (dtime_stamp < state->start_after_timestamp) {
+ if (state->frame_params[chn].signffff != 0xffff) {
+ D0(fprintf(debug_file, "%s:%d: wrong signature - %d\r\n", __FILE__, __LINE__, (int)state->frame_params[chn].signffff));
state->cirbuf_rp[chn] = -1;
- D3(fprintf(debug_file, "Too early to start, %f < %f\n", dtime_stamp, state->start_after_timestamp));
- return -CAMOGM_TOO_EARLY;
+ ifp = (int *) &state->frame_params[chn];
+ D1(fprintf(debug_file, "state->cirbuf_rp=0x%x\r\n", (int)state->cirbuf_rp[chn]));
+ D1(fprintf(debug_file, "%08x %08x %08x %08x %08x %08x %08x %08x\r\n", ifp[0], ifp[1], ifp[2], ifp[3], ifp[4], ifp[5], ifp[6], ifp[7]));
+ return -CAMOGM_FRAME_BROKEN;
}
+ // find location of the timestamp and copy it to the frame_params structure
+ // ==================================
+ timestamp_start = (state->cirbuf_rp[chn]) + ((state->jpeg_len + CCAM_MMAP_META + 3) & (~0x1f)) + 32 - CCAM_MMAP_META_SEC; // magic shift - should index first byte of the time stamp
+ if (timestamp_start >= state->circ_buff_size[chn]) timestamp_start -= state->circ_buff_size[chn];
+ memcpy(&(state->frame_params[chn].timestamp_sec), (unsigned long* )&ccam_dma_buf[chn][timestamp_start >> 2], 8);
+ // New - see if current timestamp is later than start one, if not return "CAMOGM_TOO_EARLY" reset read pointer and buffer read pointer
+ if (state->start_after_timestamp > 0.0) { // don't bother if it is 0
+ dtime_stamp = 0.000001 * state->frame_params[chn].timestamp_usec + state->frame_params[chn].timestamp_sec;
+ if (dtime_stamp < state->start_after_timestamp) {
+ state->cirbuf_rp[chn] = -1;
+ D3(fprintf(debug_file, "Too early to start, %f < %f\n", dtime_stamp, state->start_after_timestamp));
+ return -CAMOGM_TOO_EARLY;
+ }
+ }
+ D3(fprintf(debug_file, "6: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
+ // see if next frame is available
+ if ((lseek(state->fd_circ[chn], LSEEK_CIRC_NEXT, SEEK_END) < 0 ) ||
+ // is that next frame ready?
+ (((fp = lseek(state->fd_circ[chn], LSEEK_CIRC_READY, SEEK_END))) < 0)) {
+ D3(fprintf(debug_file, "6a:lseek(state->fd_circ,LSEEK_CIRC_NEXT,SEEK_END)=0x%x, fp=0x%x\n", (int)lseek(state->fd_circ[chn], LSEEK_CIRC_NEXT, SEEK_END), (int)lseek(state->fd_circ[chn], LSEEK_CIRC_READY, SEEK_END)));
+
+ lseek(state->fd_circ[chn], state->cirbuf_rp[chn], SEEK_SET); // just in case - restore pointer
+ return -CAMOGM_FRAME_NOT_READY; // frame pointer valid, but no frames yet
+ }
+ next_metadata_start = fp - 32;
+ if (next_metadata_start < 0) next_metadata_start += state->circ_buff_size[chn];
+ memcpy(&(state->this_frame_params[chn]), (unsigned long* )&ccam_dma_buf[chn][next_metadata_start >> 2], 32);
+ next_jpeg_len = state->this_frame_params[chn].frame_length; // frame_params.frame_length are now the length of bitstream
+ if (state->this_frame_params[chn].signffff != 0xffff) { // should not happen ever
+ D0(fprintf(debug_file, "%s:%d: wrong signature - %d\r\n", __FILE__, __LINE__, (int)state->this_frame_params[chn].signffff));
+ ifp_this = (int *) &state->this_frame_params[chn];
+ D1(fprintf(debug_file, "fp=0x%x\r\n", (int)fp));
+ D1(fprintf(debug_file, "%08x %08x %08x %08x %08x %08x %08x %08x\r\n", ifp_this[0], ifp_this[1], ifp_this[2], ifp_this[3], ifp_this[4], ifp_this[5], ifp_this[6], ifp_this[7]));
+ state->cirbuf_rp[chn] = -1;
+ return -CAMOGM_FRAME_BROKEN;
+ }
+ D3(fprintf(debug_file, "7: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
+
+ // find location of the timestamp and copy it to the frame_params structure
+ timestamp_start = fp + ((next_jpeg_len + CCAM_MMAP_META + 3) & (~0x1f)) + 32 - CCAM_MMAP_META_SEC; // magic shift - should index first byte of the time stamp
+ if (timestamp_start >= state->circ_buff_size[chn]) timestamp_start -= state->circ_buff_size[chn];
+ memcpy(&(state->this_frame_params[chn].timestamp_sec), (unsigned long* )&ccam_dma_buf[chn][timestamp_start >> 2], 8);
+ // verify that the essential current frame params did not change, if they did - return an error (need new file header)
+ if (!state->ignore_fps && ((state->frame_params[chn].width != state->this_frame_params[chn].width) ||
+ (state->frame_params[chn].height != state->this_frame_params[chn].height))) {
+ // Advance frame pointer to the next (caller should try again)
+ state->cirbuf_rp[chn] = fp;
+ return -CAMOGM_FRAME_CHANGED; // no yet checking for the FPS
+ }
+ D3(fprintf(debug_file, "8: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
+
+ // calcualte the frame period - time difference (in microseconds)
+ state->frame_period[chn] = (state->this_frame_params[chn].timestamp_usec - state->frame_params[chn].timestamp_usec) +
+ 1000000 * (state->this_frame_params[chn].timestamp_sec - state->frame_params[chn].timestamp_sec);
+
+ // correct for timelapse modes:
+ state->frames_skip = state->set_frames_skip;
+ if (state->frames_skip > 0) {
+ state->frames_skip_left[chn] = 0;
+ state->frame_period[chn] *= (state->frames_skip + 1);
+ } else if (state->frames_skip < 0) {
+ state->frame_period[chn] = -(state->frames_skip); // actual frame period will fluctuate to the nearest frame acquired (free running)
+ state->frames_skip_left[chn] = state->frame_params[chn].timestamp_sec;
+ }
+ D3(fprintf(debug_file, "9: state->frame_period=0x%x\n", state->frame_period[chn]));
+
+ state->time_unit = (ogg_int64_t)(((double)state->frame_period[chn]) * ((double)10) / ((double)state->timescale));
+ state->width = state->frame_params[chn].width;
+ state->height = state->frame_params[chn].height;
+
+ // read JPEG header - it should stay the same for the whole file (restart new file if any parameters changed)
+ // rebuild JPEG header:
+ lseek(state->fd_head[chn], state->cirbuf_rp[chn] + 1, SEEK_END); // +1 to avoid condition when jpeg_start==0. overloaded lseek will ignore 5 LSBs when SEEK_END
+ state->head_size[chn] = lseek(state->fd_head[chn], 0, SEEK_END); // In 8.0 the header size might change for some jp4 modes
+ if (state->head_size[chn] > JPEG_HEADER_MAXSIZE) {
+ D0(fprintf(debug_file, "%s:%d: Too big JPEG header (%d > %d)", __FILE__, __LINE__, state->head_size[chn], JPEG_HEADER_MAXSIZE ));
+ return -2;
+ }
+ // and read it
+ lseek(state->fd_head[chn], 0, 0);
+ read(state->fd_head[chn], state->jpegHeader[chn], state->head_size[chn]);
+ // Restore read pointer to the original (now there may be no frame ready there yet)
+ lseek(state->fd_circ[chn], state->cirbuf_rp[chn], SEEK_SET);
}
- D3(fprintf(debug_file, "6: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
- // see if next frame is available
- if ((lseek(state->fd_circ[chn], LSEEK_CIRC_NEXT, SEEK_END) < 0 ) ||
- // is that next frame ready?
- (((fp = lseek(state->fd_circ[chn], LSEEK_CIRC_READY, SEEK_END))) < 0)) {
- D3(fprintf(debug_file, "6a:lseek(state->fd_circ,LSEEK_CIRC_NEXT,SEEK_END)=0x%x, fp=0x%x\n", (int)lseek(state->fd_circ[chn], LSEEK_CIRC_NEXT, SEEK_END), (int)lseek(state->fd_circ[chn], LSEEK_CIRC_READY, SEEK_END)));
-
- lseek(state->fd_circ[chn], state->cirbuf_rp[chn], SEEK_SET); // just in case - restore pointer
- return -CAMOGM_FRAME_NOT_READY; // frame pointer valid, but no frames yet
- }
- next_metadata_start = fp - 32;
- if (next_metadata_start < 0) next_metadata_start += state->circ_buff_size[chn];
- memcpy(&(state->this_frame_params[chn]), (unsigned long* )&ccam_dma_buf[chn][next_metadata_start >> 2], 32);
- next_jpeg_len = state->this_frame_params[chn].frame_length; // frame_params.frame_length are now the length of bitstream
- if (state->this_frame_params[chn].signffff != 0xffff) { // should not happen ever
- D0(fprintf(debug_file, "%s:%d: wrong signature - %d\r\n", __FILE__, __LINE__, (int)state->this_frame_params[chn].signffff));
- ifp_this = (int *) &state->this_frame_params[chn];
- D1(fprintf(debug_file, "fp=0x%x\r\n", (int)fp));
- D1(fprintf(debug_file, "%08x %08x %08x %08x %08x %08x %08x %08x\r\n", ifp_this[0], ifp_this[1], ifp_this[2], ifp_this[3], ifp_this[4], ifp_this[5], ifp_this[6], ifp_this[7]));
- state->cirbuf_rp[chn] = -1;
- return -CAMOGM_FRAME_BROKEN;
- }
- D3(fprintf(debug_file, "7: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
-
- // find location of the timestamp and copy it to the frame_params structure
- timestamp_start = fp + ((next_jpeg_len + CCAM_MMAP_META + 3) & (~0x1f)) + 32 - CCAM_MMAP_META_SEC; // magic shift - should index first byte of the time stamp
- if (timestamp_start >= state->circ_buff_size[chn]) timestamp_start -= state->circ_buff_size[chn];
- memcpy(&(state->this_frame_params[chn].timestamp_sec), (unsigned long* )&ccam_dma_buf[chn][timestamp_start >> 2], 8);
- // verify that the essential current frame params did not change, if they did - return an error (need new file header)
- if (!state->ignore_fps && ((state->frame_params[chn].width != state->this_frame_params[chn].width) ||
- (state->frame_params[chn].height != state->this_frame_params[chn].height))) {
- // Advance frame pointer to the next (caller should try again)
- state->cirbuf_rp[chn] = fp;
- return -CAMOGM_FRAME_CHANGED; // no yet checking for the FPS
- }
- D3(fprintf(debug_file, "8: state->cirbuf_rp=0x%x\n", state->cirbuf_rp[chn]));
-
- // calcualte the frame period - time difference (in microseconds)
- state->frame_period[chn] = (state->this_frame_params[chn].timestamp_usec - state->frame_params[chn].timestamp_usec) +
- 1000000 * (state->this_frame_params[chn].timestamp_sec - state->frame_params[chn].timestamp_sec);
-
- // correct for timelapse modes:
- state->frames_skip = state->set_frames_skip;
- if (state->frames_skip > 0) {
- state->frames_skip_left[chn] = 0;
- state->frame_period[chn] *= (state->frames_skip + 1);
- } else if (state->frames_skip < 0) {
- state->frame_period[chn] = -(state->frames_skip); // actual frame period will fluctuate to the nearest frame acquired (free running)
- state->frames_skip_left[chn] = state->frame_params[chn].timestamp_sec;
- }
- D3(fprintf(debug_file, "9: state->frame_period=0x%x\n", state->frame_period[chn]));
-
- state->time_unit = (ogg_int64_t)(((double)state->frame_period[chn]) * ((double)10) / ((double)state->timescale));
- state->width = state->frame_params[chn].width;
- state->height = state->frame_params[chn].height;
-
- // read JPEG header - it should stay the same for the whole file (restart new file if any parameters changed)
- // rebuild JPEG header:
- lseek(state->fd_head[chn], state->cirbuf_rp[chn] + 1, SEEK_END); // +1 to avoid condition when jpeg_start==0. overloaded lseek will ignore 5 LSBs when SEEK_END
- state->head_size[chn] = lseek(state->fd_head[chn], 0, SEEK_END); // In 8.0 the header size might change for some jp4 modes
- if (state->head_size[chn] > JPEG_HEADER_MAXSIZE) {
- D0(fprintf(debug_file, "%s:%d: Too big JPEG header (%d > %d)", __FILE__, __LINE__, state->head_size[chn], JPEG_HEADER_MAXSIZE ));
- return -2;
- }
- // and read it
- lseek(state->fd_head[chn], 0, 0);
- read(state->fd_head[chn], state->jpegHeader[chn], state->head_size[chn]);
- // Restore read pointer to the original (now there may be no frame ready there yet)
- lseek(state->fd_circ[chn], state->cirbuf_rp[chn], SEEK_SET);
}
// here we are ready to initialize Ogm (or other) file
@@ -825,6 +827,8 @@ void camogm_set_ignore_fps(camogm_state *state, int d)
*/
void camogm_set_prefix(camogm_state *state, const char * p, path_type type)
{
+ struct range rng = {0};
+
if (type == FILE_PATH) {
strncpy(state->path_prefix, p, sizeof(state->path_prefix) - 1);
state->path_prefix[sizeof(state->path_prefix) - 1] = '\0';
@@ -842,17 +846,11 @@ void camogm_set_prefix(camogm_state *state, const char * p, path_type type)
state->rawdev_op = 1;
}
- /* debug code follows*/
- struct range rng = {
- .from = 0,
- .to = 0
- };
if (get_disk_range(state->rawdev.rawdev_path, &rng) == 0) {
set_disk_range(&rng);
} else {
D0(fprintf(debug_file, "ERROR: unable to get disk size and starting sector\n"));
}
- /* end of debug code */
}
}
diff --git a/camogm.h b/src/camogm.h
similarity index 100%
rename from camogm.h
rename to src/camogm.h
diff --git a/camogm_jpeg.c b/src/camogm_jpeg.c
similarity index 99%
rename from camogm_jpeg.c
rename to src/camogm_jpeg.c
index a364c117da3f17dc60295190e2f7caa4ef03fab2..7fd3b619d62bb43ce97f34e1c5406907ef3c6ce3 100644
--- a/camogm_jpeg.c
+++ b/src/camogm_jpeg.c
@@ -27,7 +27,7 @@
#include
#include
#include
-#include
+#include
#include
#include "camogm_jpeg.h"
diff --git a/camogm_jpeg.h b/src/camogm_jpeg.h
similarity index 100%
rename from camogm_jpeg.h
rename to src/camogm_jpeg.h
diff --git a/camogm_kml.c b/src/camogm_kml.c
similarity index 100%
rename from camogm_kml.c
rename to src/camogm_kml.c
diff --git a/camogm_kml.h b/src/camogm_kml.h
similarity index 100%
rename from camogm_kml.h
rename to src/camogm_kml.h
diff --git a/camogm_mov.c b/src/camogm_mov.c
similarity index 100%
rename from camogm_mov.c
rename to src/camogm_mov.c
diff --git a/camogm_mov.h b/src/camogm_mov.h
similarity index 100%
rename from camogm_mov.h
rename to src/camogm_mov.h
diff --git a/camogm_ogm.c b/src/camogm_ogm.c
similarity index 100%
rename from camogm_ogm.c
rename to src/camogm_ogm.c
diff --git a/camogm_ogm.h b/src/camogm_ogm.h
similarity index 100%
rename from camogm_ogm.h
rename to src/camogm_ogm.h
diff --git a/camogm_read.c b/src/camogm_read.c
similarity index 100%
rename from camogm_read.c
rename to src/camogm_read.c
diff --git a/camogm_read.h b/src/camogm_read.h
similarity index 100%
rename from camogm_read.h
rename to src/camogm_read.h
diff --git a/camogmstate.php b/src/camogmstate.php
similarity index 100%
rename from camogmstate.php
rename to src/camogmstate.php
diff --git a/index_list.c b/src/index_list.c
similarity index 100%
rename from index_list.c
rename to src/index_list.c
diff --git a/index_list.h b/src/index_list.h
similarity index 100%
rename from index_list.h
rename to src/index_list.h
diff --git a/ogmstreams.h b/src/ogmstreams.h
similarity index 100%
rename from ogmstreams.h
rename to src/ogmstreams.h
diff --git a/qt_source b/src/qt_source
similarity index 100%
rename from qt_source
rename to src/qt_source
diff --git a/used_files.py b/used_files.py
new file mode 100755
index 0000000000000000000000000000000000000000..2f48644d84c347f4d4284a5272da375a3e701785
--- /dev/null
+++ b/used_files.py
@@ -0,0 +1,284 @@
+#!/usr/bin/env python
+# encoding: utf-8
+from __future__ import division
+from __future__ import print_function
+"""
+# @file used_files.py
+# @brief Extract file access data after build, modify CDT project configuration
+# (.cproject) accordingly
+# @copyright Copyright (C) 2016, Elphel.inc.
+# @param License
+# This program is free software: you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation, either version 3 of the License, or
+# (at your option) any later version.
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+# GNU General Public License for more details.
+# You should have received a copy of the GNU General Public License
+# along with this program. If not, see .
+
+@author: Andrey Filippov
+@license: GPLv3.0+
+@contact: andrey@elphel.coml
+@deffield updated: Updated
+"""
+__author__ = "Andrey Filippov"
+__copyright__ = "Copyright 2016, Elphel, Inc."
+__license__ = "GPL"
+__version__ = "3.0+"
+__maintainer__ = "Andrey Filippov"
+__email__ = "andrey@elphel.com"
+__status__ = "Development"
+
+import sys
+import os
+import time
+import xml.etree.ElementTree as ET
+'''
+TODO:Automate, find out why separate touch commands are needed
+Run this program twice:
+1-st run ./used_files.py linux -1
+and save shown timestamp
+Then run (some mystery here)
+touch src/drivers/ata/ahci_elphel.c
+touch src/drivers/elphel/sensor_common.c
+Wait 5 seconds and run (in a different console with appropriate sourcing)
+bitbake linux-xlnx -c compile -f
+Then again
+./used_files.py linux
+If somethong went wrong you will need to resore .cproject from eclipse_project_setup directory
+
+For php:
+bitbake php -c cleansstate
+bitbake php -c unpack -f
+bitbake php -c configure -f
+./used_files.py php -1
+bitbake php -c compile -f
+./used_files.py php 1471044836.8
+
+Doing:
+bitbake php -c compile -f
+./used_files.py php -1
+bitbake php -c compile -f
+./used_files.py php 1471044836.8
+Corrupts make process
+
+'''
+def file_tree(flist): # Each file in list is a file, no directories
+ ftree={}
+ for p in flist:
+ node = ftree
+ seg_list=p.split(os.sep)
+ last_i=len(seg_list)-1
+ for i,segm in enumerate(seg_list):
+ if not segm in node:
+ if i == last_i:
+ node[segm] = None
+ else:
+ node[segm] = {}
+ node=node[segm]
+
+ return ftree
+
+def exclude_list(ftree, flist):
+ mark = "*" # no file/dir name can be "*"
+ def list_tree_recursive(root):
+ rslt = []
+ if not mark in root:
+ return [[""]] # convert to trailing "/" for directories
+ for n in root:
+ if not n == mark:
+ if root[n] is None:
+ rslt.append([n])
+ else:
+
+ for l in list_tree_recursive(root[n]):
+ rslt.append([n]+l)
+ return rslt
+
+ ftree[mark]=None # mark top level dir
+ for p in flist:
+ node = ftree
+ for segm in p.split(os.sep)[:-1]:
+ node=node[segm]
+ node[mark]=None # [mark] means used in flist
+ del node[p.split(os.sep)[-1]]
+ #print (ftree)
+# for k in ftree:
+# print(k)
+ #Now prune unused directories
+ #prune_recursive(ftree) # (assuming root is used)
+ # now create list
+ files_list_list = list_tree_recursive(ftree)
+# print (files_list_list)
+ #converrt to file paths
+ pl = []
+ for l in files_list_list:
+ pl.append(os.path.join(*(l[1:])))
+ pl = sorted (pl)
+ return pl
+
+
+def proc_tree():
+ DEBUG = True
+ extensions = [".h",".c",".cpp"]
+ exclude_start = ["linux"+os.sep+"scripts"+os.sep,"linux"+os.sep+"source"+os.sep+"scripts"+os.sep]
+ delta_t = 3 # seconds
+ try:
+ root_path = sys.argv[1]
+ except:
+ print ("Calling %s [timestamp]"%(os.path.basename(sys.argv[0])))
+ try:
+ start_time = float(sys.argv[2])
+ except:
+ start_time = 0.0
+
+ touch_files= start_time < 0.0
+ print ("root_path = %s"%(root_path))
+# root_path = "/home/eyesis/git/poky/linux-elphel/linux/"
+ lstFiles = []
+ # Append files to a list
+ for path, _, files in os.walk(root_path, followlinks = True):
+ for f in files:
+ for ext in extensions:
+ if f.endswith(ext):
+ lstFiles.append(os.path.join(path, f))
+ break
+
+ all_tree= file_tree(sorted(lstFiles))
+ include_lst=[]
+ lst_a = []
+ latest_at=0
+ for p in lstFiles:
+ if touch_files:
+ if os.path.islink(p):
+ try:
+ os.utime(os.path.realpath(p), None)
+ except:
+ print("missing linked file: %s"%(os.path.realpath(p)))
+ else:
+ os.utime(p, None)
+ else:
+# at = time.ctime(os.stat(p).st_atime)
+ try:
+ at = os.stat(p).st_atime
+ l = None
+ except:
+ at = 0
+ if os.path.islink(p):
+ try:
+ l = os.path.realpath(p)
+ at = os.stat(l).st_atime
+ except:
+ at = 0 # missing file
+ latest_at = max((latest_at,at))
+ if at > (start_time + delta_t):
+ #Scripts/lexers result in problems
+ exclude=False
+ for exStr in exclude_start:
+ if p.startswith(exStr):
+ exclude=True
+ break
+ if exclude:
+ break
+ #exclude_start
+ lst_a.append([p,at,l])
+ include_lst.append(p)
+ if touch_files:
+ print (len(lstFiles), "last time = ", time.time())
+ return
+
+ excluding = exclude_list(all_tree, include_lst)
+# print (all_tree)
+# print (sorted(include_lst))
+# print ("|".join(excluding))
+ if DEBUG:
+ with open("all_sources.lst","w" ) as f:
+ for p in sorted(lstFiles):
+ try:
+ at = os.stat(p).st_atime
+ except:
+ at = 0
+ lnk=""
+ if os.path.islink(p):
+ try:
+ at = os.stat(os.path.realpath(p)).st_atime
+ except:
+ at = 0
+ lnk = os.path.realpath(p)
+ print (p,at,lnk, file=f)
+ with open("excluding.lst","w" ) as f:
+ for p in excluding:
+ print (p, file=f)
+ with open("including.lst","w" ) as f:
+ for p in include_lst:
+ print (p, file=f)
+# include_tree= file_tree(sorted(include_lst))
+# print(include_tree)
+ root_dir=include_lst[0].split(os.sep)[0]
+ print ("root_dir=",root_dir)
+
+ xml= ET.parse(".cproject")
+ root=xml.getroot()
+# for child in root:
+# print(child.tag, child.attrib)
+
+ for child in root.iter('sourceEntries'):
+ for gchild in child:
+ print(gchild.tag)
+
+ for child in root.iter('sourceEntries'):
+ for gchild in child:
+ if gchild.tag == 'entry':
+ attr = gchild.attrib
+ try:
+ if (attr['kind'] == 'sourcePath') and (attr['name'] == root_dir):
+ child.remove (gchild)
+ print ("Removed existing entry ",gchild.tag)
+ break
+ except:
+ print ("error matching attributes for ",gchild.tag)
+ pass
+ break #after first 'sourceEntries' - should be just one?
+ ET.SubElement(child, 'entry', {"flags":"VALUE_WORKSPACE_PATH", "kind":"sourcePath", "name":root_dir, "excluding":"|".join(excluding)})
+
+ for child in root.iter('sourceEntries'):
+ for gchild in child:
+ print(gchild.tag)
+
+ oneliner= ET.tostring(root)
+ #overwrites original .cproject, may change to somethong different
+ with open(".cproject", "wr") as f:
+ f.write("""
+""")
+ f.write(oneliner)
+
+ print (len(lstFiles), len(lst_a), "last access time = ",latest_at)
+
+if __name__ == '__main__':
+ proc_tree()
+ """
+make clean # otherwise compiled files are preserved
+bitbake apps-autoexposure -c cleansstate
+bitbake apps-autoexposure -c unpack -f
+bitbake apps-autoexposure -c configure -f
+./used_files.py sysroots -1
+bitbake apps-autoexposure -c compile -f
+./used_files.py sysroots 1473297567.42
+
+
+eyesis@eyesis-SH87R:~/git/elphel393/rootfs-elphel/elphel-apps-autoexposure$ ./used_files.py sysroots/elphel393/usr -1
+root_path = sysroots/elphel393/usr
+5615 last time = 1473300068.01
+eyesis@eyesis-SH87R:~/git/elphel393/rootfs-elphel/elphel-apps-autoexposure$ ./used_files.py sysroots/elphel393/usr 1473300068.01
+root_path = sysroots/elphel393/usr
+root_dir= sysroots
+entry
+entry
+entry
+entry
+entry
+5615 84 last access time = 1473300080.1
+ """
\ No newline at end of file