forked from Ivasoft/DSView
Initial version.
This commit is contained in:
DreamSourceLab
7
.gitignore
vendored
Normal file
7
.gitignore
vendored
Normal file
@@ -0,0 +1,7 @@
|
||||
*.[oa]
|
||||
*~
|
||||
*.Plo
|
||||
*.pc
|
||||
*.pc.in
|
||||
*.Po
|
||||
|
||||
674
COPYING
Normal file
674
COPYING
Normal file
@@ -0,0 +1,674 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
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 <http://www.gnu.org/licenses/>.
|
||||
|
||||
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:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
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
|
||||
<http://www.gnu.org/licenses/>.
|
||||
|
||||
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
|
||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
||||
295
DSLogic-gui/CMakeLists.txt
Normal file
295
DSLogic-gui/CMakeLists.txt
Normal file
@@ -0,0 +1,295 @@
|
||||
##
|
||||
## This file is part of the PulseView project.
|
||||
##
|
||||
## Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
## Copyright (C) 2012-2013 Alexandru Gagniuc <mr.nuke.me@gmail.com>
|
||||
##
|
||||
## This program is free software: you can redistribute it and/or modify
|
||||
## it under the terms of the GNU General Public License as published by
|
||||
## the Free Software Foundation, either version 2 of the License, or
|
||||
## (at your option) any later version.
|
||||
##
|
||||
## This program is distributed in the hope that it will be useful,
|
||||
## but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
## GNU General Public License for more details.
|
||||
##
|
||||
## You should have received a copy of the GNU General Public License
|
||||
## along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
##
|
||||
|
||||
cmake_minimum_required(VERSION 2.6)
|
||||
include(FindPkgConfig)
|
||||
include(GNUInstallDirs)
|
||||
|
||||
project(DSLogic-gui)
|
||||
|
||||
#===============================================================================
|
||||
#= User Options
|
||||
#-------------------------------------------------------------------------------
|
||||
|
||||
option(DISABLE_WERROR "Build without -Werror" FALSE)
|
||||
option(ENABLE_SIGNALS "Build with UNIX signals" TRUE)
|
||||
option(ENABLE_TESTS "Enable unit tests" FALSE)
|
||||
option(STATIC_PKGDEPS_LIBS "Statically link to (pkgconfig) libraries" FALSE)
|
||||
|
||||
if(WIN32)
|
||||
# On Windows/MinGW we need to statically link to libraries.
|
||||
# This option is user configurable, but enable it by default on win32.
|
||||
set(STATIC_PKGDEPS_LIBS TRUE)
|
||||
|
||||
# For boost-thread we need two additional settings on win32:
|
||||
set(Boost_USE_STATIC_LIBS on)
|
||||
add_definitions(-DBOOST_THREAD_USE_LIB)
|
||||
|
||||
# Windsws does not support UNIX signals
|
||||
set(ENABLE_SIGNALS FALSE)
|
||||
endif()
|
||||
|
||||
#===============================================================================
|
||||
#= Dependencies
|
||||
#-------------------------------------------------------------------------------
|
||||
|
||||
list(APPEND PKGDEPS
|
||||
libsigrok4DSLogic>=0.2.0
|
||||
)
|
||||
|
||||
find_package(PkgConfig)
|
||||
pkg_check_modules(PKGDEPS REQUIRED ${PKGDEPS})
|
||||
|
||||
find_package(Qt4 REQUIRED)
|
||||
|
||||
# Find the platform's thread library (needed for boost-thread).
|
||||
# This will set ${CMAKE_THREAD_LIBS_INIT} to the correct, OS-specific value.
|
||||
find_package(Threads)
|
||||
|
||||
if(WIN32)
|
||||
# On Windows/MinGW the we need to use 'thread_win32' instead of 'thread'.
|
||||
# The library is named libboost_thread_win32* (not libboost_thread*).
|
||||
find_package(Boost 1.42 COMPONENTS system thread_win32 REQUIRED)
|
||||
else()
|
||||
find_package(Boost 1.42 COMPONENTS system thread REQUIRED)
|
||||
endif()
|
||||
|
||||
#===============================================================================
|
||||
#= Config Header
|
||||
#-------------------------------------------------------------------------------
|
||||
|
||||
set(DS_TITLE DSLogic)
|
||||
set(DS_DESCRIPTION "A GUI for DSLogic")
|
||||
|
||||
set(DS_VERSION_MAJOR 0)
|
||||
set(DS_VERSION_MINOR 1)
|
||||
set(DS_VERSION_MICRO 0)
|
||||
set(DS_VERSION_STRING
|
||||
${DS_VERSION_MAJOR}.${DS_VERSION_MINOR}.${DS_VERSION_MICRO}
|
||||
)
|
||||
|
||||
configure_file (
|
||||
${PROJECT_SOURCE_DIR}/config.h.in
|
||||
${PROJECT_BINARY_DIR}/config.h
|
||||
)
|
||||
|
||||
#===============================================================================
|
||||
#= Sources
|
||||
#-------------------------------------------------------------------------------
|
||||
|
||||
set(DSLogic_SOURCES
|
||||
main.cpp
|
||||
pv/devicemanager.cpp
|
||||
pv/mainwindow.cpp
|
||||
pv/sigsession.cpp
|
||||
pv/data/analog.cpp
|
||||
pv/data/analogsnapshot.cpp
|
||||
pv/data/group.cpp
|
||||
pv/data/groupsnapshot.cpp
|
||||
pv/data/logic.cpp
|
||||
pv/data/logicsnapshot.cpp
|
||||
pv/data/signaldata.cpp
|
||||
pv/data/snapshot.cpp
|
||||
pv/decoder/decoder.cpp
|
||||
pv/decoder/decoderfactory.cpp
|
||||
pv/decoder/democonfig.cpp
|
||||
pv/decoder/ds1wire.cpp
|
||||
pv/decoder/dsdmx512.cpp
|
||||
pv/decoder/dsi2c.cpp
|
||||
pv/decoder/dsserial.cpp
|
||||
pv/decoder/dsspi.cpp
|
||||
pv/dialogs/about.cpp
|
||||
pv/dialogs/connect.cpp
|
||||
pv/dialogs/deviceoptions.cpp
|
||||
pv/dialogs/search.cpp
|
||||
pv/dock/fakelineedit.cpp
|
||||
pv/dock/measuredock.cpp
|
||||
pv/dock/protocoldock.cpp
|
||||
pv/dock/searchdock.cpp
|
||||
pv/dock/triggerdock.cpp
|
||||
pv/prop/bool.cpp
|
||||
pv/prop/double.cpp
|
||||
pv/prop/enum.cpp
|
||||
pv/prop/int.cpp
|
||||
pv/prop/property.cpp
|
||||
pv/prop/binding/binding.cpp
|
||||
pv/prop/binding/binding_deviceoptions.cpp
|
||||
pv/toolbars/devicebar.cpp
|
||||
pv/toolbars/filebar.cpp
|
||||
pv/toolbars/logobar.cpp
|
||||
pv/toolbars/samplingbar.cpp
|
||||
pv/toolbars/trigbar.cpp
|
||||
pv/view/analogsignal.cpp
|
||||
pv/view/cursor.cpp
|
||||
pv/view/groupsignal.cpp
|
||||
pv/view/header.cpp
|
||||
pv/view/logicsignal.cpp
|
||||
pv/view/protocolsignal.cpp
|
||||
pv/view/ruler.cpp
|
||||
pv/view/signal.cpp
|
||||
pv/view/timemarker.cpp
|
||||
pv/view/view.cpp
|
||||
pv/view/viewport.cpp
|
||||
)
|
||||
|
||||
set(DSLogic_HEADERS
|
||||
pv/sigsession.h
|
||||
pv/mainwindow.h
|
||||
pv/decoder/democonfig.h
|
||||
pv/dock/fakelineedit.h
|
||||
pv/dock/measuredock.h
|
||||
pv/dock/protocoldock.h
|
||||
pv/dock/searchdock.h
|
||||
pv/dock/triggerdock.h
|
||||
pv/dialogs/about.h
|
||||
pv/dialogs/connect.h
|
||||
pv/dialogs/deviceoptions.h
|
||||
pv/dialogs/search.h
|
||||
pv/toolbars/samplingbar.h
|
||||
pv/toolbars/devicebar.h
|
||||
pv/toolbars/filebar.h
|
||||
pv/toolbars/logobar.h
|
||||
pv/toolbars/trigbar.h
|
||||
pv/view/cursor.h
|
||||
pv/view/header.h
|
||||
pv/view/ruler.h
|
||||
pv/view/timemarker.h
|
||||
pv/view/groupsignal.h
|
||||
pv/view/protocolsignal.h
|
||||
pv/view/view.h
|
||||
pv/view/viewport.h
|
||||
)
|
||||
|
||||
set(DSLogic_FORMS
|
||||
pv/dialogs/about.ui
|
||||
pv/dialogs/search.ui
|
||||
pv/decoder/dmx512config.ui
|
||||
pv/decoder/i2cconfig.ui
|
||||
pv/decoder/serialconfig.ui
|
||||
pv/decoder/spiconfig.ui
|
||||
pv/decoder/wire1config.ui
|
||||
)
|
||||
|
||||
set(DSLogic_RESOURCES
|
||||
DSLogic.qrc
|
||||
)
|
||||
|
||||
qt4_wrap_cpp(DSLogic_HEADERS_MOC ${DSLogic_HEADERS})
|
||||
qt4_wrap_ui(DSLogic_FORMS_HEADERS ${DSLogic_FORMS})
|
||||
qt4_add_resources(DSLogic_RESOURCES_RCC ${DSLogic_RESOURCES})
|
||||
|
||||
include(${QT_USE_FILE})
|
||||
|
||||
#===============================================================================
|
||||
#= Global Definitions
|
||||
#-------------------------------------------------------------------------------
|
||||
|
||||
add_definitions(${QT_DEFINITIONS})
|
||||
add_definitions(-Wall -Wextra -Wno-return-type -Wno-ignored-qualifiers)
|
||||
|
||||
if(NOT DISABLE_WERROR)
|
||||
add_definitions(-Werror)
|
||||
endif()
|
||||
|
||||
#===============================================================================
|
||||
#= Global Include Directories
|
||||
#-------------------------------------------------------------------------------
|
||||
|
||||
include_directories(
|
||||
${CMAKE_CURRENT_BINARY_DIR}
|
||||
${CMAKE_CURRENT_SOURCE_DIR}
|
||||
${Boost_INCLUDE_DIRS}
|
||||
)
|
||||
|
||||
if(STATIC_PKGDEPS_LIBS)
|
||||
include_directories(${PKGDEPS_STATIC_INCLUDE_DIRS})
|
||||
else()
|
||||
include_directories(${PKGDEPS_INCLUDE_DIRS})
|
||||
endif()
|
||||
|
||||
#===============================================================================
|
||||
#= Linker Configuration
|
||||
#-------------------------------------------------------------------------------
|
||||
|
||||
link_directories(${Boost_LIBRARY_DIRS})
|
||||
|
||||
set(DSLOGIC_LINK_LIBS
|
||||
${Boost_LIBRARIES}
|
||||
${CMAKE_THREAD_LIBS_INIT}
|
||||
${QT_LIBRARIES}
|
||||
)
|
||||
|
||||
if(STATIC_PKGDEPS_LIBS)
|
||||
link_directories(${PKGDEPS_STATIC_LIBRARY_DIRS})
|
||||
list(APPEND DSLOGIC_LINK_LIBS ${PKGDEPS_STATIC_LIBRARIES})
|
||||
else()
|
||||
link_directories(${PKGDEPS_LIBRARY_DIRS})
|
||||
list(APPEND DSLOGIC_LINK_LIBS ${PKGDEPS_LIBRARIES})
|
||||
endif()
|
||||
|
||||
add_executable(${PROJECT_NAME}
|
||||
${DSLogic_SOURCES}
|
||||
${DSLogic_HEADERS_MOC}
|
||||
${DSLogic_FORMS_HEADERS}
|
||||
${DSLogic_RESOURCES_RCC}
|
||||
)
|
||||
|
||||
target_link_libraries(${PROJECT_NAME} ${DSLOGIC_LINK_LIBS})
|
||||
|
||||
if(WIN32)
|
||||
# Pass -mwindows so that no "DOS box" will open when PulseView is started.
|
||||
set_target_properties(${PROJECT_NAME} PROPERTIES LINK_FLAGS "-mwindows")
|
||||
endif()
|
||||
|
||||
#===============================================================================
|
||||
#= Installation
|
||||
#-------------------------------------------------------------------------------
|
||||
|
||||
# Install the executable.
|
||||
install(TARGETS ${PROJECT_NAME} DESTINATION bin/)
|
||||
|
||||
# Install the manpage.
|
||||
install(FILES doc/DSLogic.1 DESTINATION ${CMAKE_INSTALL_MANDIR}/man1 COMPONENT doc)
|
||||
|
||||
#===============================================================================
|
||||
#= Packaging (handled by CPack)
|
||||
#-------------------------------------------------------------------------------
|
||||
|
||||
set(CPACK_PACKAGE_VERSION_MAJOR ${DS_VERSION_MAJOR})
|
||||
set(CPACK_PACKAGE_VERSION_MINOR ${DS_VERSION_MINOR})
|
||||
set(CPACK_PACKAGE_VERSION_PATCH ${DS_VERSION_MICRO})
|
||||
set(CPACK_PACKAGE_DESCRIPTION_FILE ${CMAKE_CURRENT_SOURCE_DIR}/README)
|
||||
set(CPACK_RESOURCE_FILE_LICENSE ${CMAKE_CURRENT_SOURCE_DIR}/COPYING)
|
||||
set(CPACK_SOURCE_IGNORE_FILES ${CMAKE_CURRENT_BINARY_DIR} ".gitignore" ".git")
|
||||
set(CPACK_SOURCE_PACKAGE_FILE_NAME
|
||||
"${CMAKE_PROJECT_NAME}-${DS_VERSION_MAJOR}.${DS_VERSION_MINOR}.${DS_VERSION_MICRO}")
|
||||
set(CPACK_SOURCE_GENERATOR "TGZ")
|
||||
|
||||
include(CPack)
|
||||
|
||||
#===============================================================================
|
||||
#= Tests
|
||||
#-------------------------------------------------------------------------------
|
||||
|
||||
if(ENABLE_TESTS)
|
||||
add_subdirectory(test)
|
||||
enable_testing()
|
||||
add_test(test ${CMAKE_CURRENT_BINARY_DIR}/test/DSLogic-test)
|
||||
endif(ENABLE_TESTS)
|
||||
674
DSLogic-gui/COPYING
Normal file
674
DSLogic-gui/COPYING
Normal file
@@ -0,0 +1,674 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 3, 29 June 2007
|
||||
|
||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
||||
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 <http://www.gnu.org/licenses/>.
|
||||
|
||||
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:
|
||||
|
||||
<program> Copyright (C) <year> <name of author>
|
||||
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
|
||||
<http://www.gnu.org/licenses/>.
|
||||
|
||||
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
|
||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
||||
31
DSLogic-gui/DSLogic.qrc
Normal file
31
DSLogic-gui/DSLogic.qrc
Normal file
@@ -0,0 +1,31 @@
|
||||
<RCC>
|
||||
<qresource prefix="/">
|
||||
<file>icons/search.png</file>
|
||||
<file>icons/next.png</file>
|
||||
<file>icons/pre.png</file>
|
||||
<file>icons/file.png</file>
|
||||
<file>icons/photo.png</file>
|
||||
<file>icons/save.png</file>
|
||||
<file>icons/open.png</file>
|
||||
<file>icons/params.png</file>
|
||||
<file>stylesheet.qss</file>
|
||||
<file>icons/down-arrow.png</file>
|
||||
<file>icons/slider-handle.png</file>
|
||||
<file>icons/set.png</file>
|
||||
<file>icons/add.png</file>
|
||||
<file>icons/del.png</file>
|
||||
<file>icons/trigger.png</file>
|
||||
<file>icons/measure.png</file>
|
||||
<file>icons/search-bar.png</file>
|
||||
<file>icons/protocol.png</file>
|
||||
<file>icons/logo_noColor.png</file>
|
||||
<file>icons/logo_color.png</file>
|
||||
<file>icons/logo_muColor.png</file>
|
||||
<file>icons/about.png</file>
|
||||
<file>icons/capture.png</file>
|
||||
<file>icons/stop.png</file>
|
||||
<file>icons/start.png</file>
|
||||
<file>icons/dsl_logo.png</file>
|
||||
<file>icons/logo.png</file>
|
||||
</qresource>
|
||||
</RCC>
|
||||
49
DSLogic-gui/INSTALL
Normal file
49
DSLogic-gui/INSTALL
Normal file
@@ -0,0 +1,49 @@
|
||||
-------------------------------------------------------------------------------
|
||||
INSTALL
|
||||
-------------------------------------------------------------------------------
|
||||
|
||||
Requirements
|
||||
------------
|
||||
|
||||
- git
|
||||
- g++
|
||||
- make
|
||||
- libtool
|
||||
- pkg-config >= 0.22
|
||||
- cmake >= 2.6
|
||||
- libglib >= 2.28.0
|
||||
- Qt >= 4.5
|
||||
- libboost >= 1.42 (including the following libs):
|
||||
- libboost-system
|
||||
- libboost-thread
|
||||
- libsigrok4DSLogic >= 0.2.0
|
||||
|
||||
|
||||
Building and installing
|
||||
-----------------------
|
||||
Get the DSLogic-gui source code from: www.dreamsourcelab.com/download.html
|
||||
In order to build it, run:
|
||||
|
||||
$ cd DSLogic-gui
|
||||
$ cmake .
|
||||
$ make
|
||||
|
||||
For installing PulseView:
|
||||
|
||||
$ make install
|
||||
|
||||
See the following wiki page for more (OS-specific) instructions:
|
||||
|
||||
http://sigrok.org/wiki/Building
|
||||
|
||||
|
||||
Creating a source distribution package
|
||||
--------------------------------------
|
||||
|
||||
In order to build a source package begin with an unconfigured source tree.
|
||||
|
||||
$ mkdir dist
|
||||
$ cd dist
|
||||
$ cmake ..
|
||||
$ make package_source
|
||||
|
||||
5
DSLogic-gui/NEWS
Normal file
5
DSLogic-gui/NEWS
Normal file
@@ -0,0 +1,5 @@
|
||||
0.1.0 (2013-12-15)
|
||||
------------------
|
||||
|
||||
* Initial release.
|
||||
|
||||
72
DSLogic-gui/README
Normal file
72
DSLogic-gui/README
Normal file
@@ -0,0 +1,72 @@
|
||||
-------------------------------------------------------------------------------
|
||||
README
|
||||
-------------------------------------------------------------------------------
|
||||
DSLogic-gui is GUI for DSLogic software, it's based on PulseView
|
||||
from the sigrok project.
|
||||
|
||||
The sigrok project aims at creating a portable, cross-platform,
|
||||
Free/Libre/Open-Source signal analysis software suite that supports various
|
||||
device types (such as logic analyzers, oscilloscopes, multimeters, and more).
|
||||
|
||||
PulseView is a Qt-based LA/scope/MSO GUI for sigrok.
|
||||
|
||||
|
||||
Status
|
||||
------
|
||||
|
||||
DSLogic-gui is in a usable state and has had official tarball releases.
|
||||
|
||||
However, it is still work in progress. Some basic functionality
|
||||
is available and working, but other things are still on the TODO list.
|
||||
|
||||
|
||||
Copyright and license
|
||||
---------------------
|
||||
|
||||
DSLogic-gui is licensed under the terms of the GNU General Public License
|
||||
(GPL), version 3 or later.
|
||||
|
||||
While some individual source code files are licensed under the GPLv2+, and
|
||||
some files are licensed under the GPLv3+, this doesn't change the fact that
|
||||
the program as a whole is licensed under the terms of the GPLv3+ (e.g. also
|
||||
due to the fact that it links against GPLv3+ libraries).
|
||||
|
||||
Please see the individual source files for the full list of copyright holders.
|
||||
|
||||
|
||||
Copyright notices
|
||||
-----------------
|
||||
|
||||
A copyright notice indicating a range of years, must be interpreted as having
|
||||
had copyrightable material added in each of those years.
|
||||
|
||||
Example:
|
||||
|
||||
Copyright (C) 2010-2013 Contributor Name
|
||||
|
||||
is to be interpreted as
|
||||
|
||||
Copyright (C) 2010,2011,2012,2013 Contributor Name
|
||||
|
||||
|
||||
Mailing lists
|
||||
-------------
|
||||
|
||||
There are two mailing lists for sigrok/PulseView:
|
||||
|
||||
https://lists.sourceforge.net/lists/listinfo/sigrok-devel
|
||||
https://lists.sourceforge.net/lists/listinfo/sigrok-commits
|
||||
|
||||
|
||||
IRC
|
||||
---
|
||||
|
||||
You can find the sigrok developers in the #sigrok IRC channel on Freenode.
|
||||
|
||||
|
||||
Website
|
||||
-------
|
||||
|
||||
http://sigrok.org/wiki/PulseView
|
||||
http://dreamsourcelab.com
|
||||
|
||||
34
DSLogic-gui/config.h
Normal file
34
DSLogic-gui/config.h
Normal file
@@ -0,0 +1,34 @@
|
||||
/*
|
||||
* This file is part of the PulseView project.
|
||||
*
|
||||
* Copyright (C) 2012 Alexandru Gagniuc <mr.nuke.me@gmail.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef _DSLOGIC_CONFIG_H
|
||||
#define _DSLOGIC_CONFIG_H
|
||||
|
||||
/* Application details */
|
||||
#define DS_TITLE "DSLogic"
|
||||
#define DS_DESCRIPTION "A GUI for DSLogic"
|
||||
#define DS_BIN_NAME "DSLogic-gui"
|
||||
|
||||
/* DSLogic version information */
|
||||
#define DS_VERSION_MAJOR 0
|
||||
#define DS_VERSION_MINOR 1
|
||||
#define DS_VERSION_MICRO 0
|
||||
#define DS_VERSION_STRING "0.1.0"
|
||||
|
||||
#endif
|
||||
34
DSLogic-gui/config.h.in
Normal file
34
DSLogic-gui/config.h.in
Normal file
@@ -0,0 +1,34 @@
|
||||
/*
|
||||
* This file is part of the PulseView project.
|
||||
*
|
||||
* Copyright (C) 2012 Alexandru Gagniuc <mr.nuke.me@gmail.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef _DSLOGIC_CONFIG_H
|
||||
#define _DSLOGIC_CONFIG_H
|
||||
|
||||
/* Application details */
|
||||
#define DS_TITLE "@DS_TITLE@"
|
||||
#define DS_DESCRIPTION "@DS_DESCRIPTION@"
|
||||
#define DS_BIN_NAME "@PROJECT_NAME@"
|
||||
|
||||
/* DSLogic version information */
|
||||
#define DS_VERSION_MAJOR @DS_VERSION_MAJOR@
|
||||
#define DS_VERSION_MINOR @DS_VERSION_MINOR@
|
||||
#define DS_VERSION_MICRO @DS_VERSION_MICRO@
|
||||
#define DS_VERSION_STRING "@DS_VERSION_STRING@"
|
||||
|
||||
#endif
|
||||
29
DSLogic-gui/extdef.h
Normal file
29
DSLogic-gui/extdef.h
Normal file
@@ -0,0 +1,29 @@
|
||||
/*
|
||||
* This file is part of the PulseView project.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
#ifndef DSLOGIC_EXTDEF_H
|
||||
#define DSLOGIC_EXTDEF_H
|
||||
|
||||
#define countof(x) (sizeof(x)/sizeof(x[0]))
|
||||
|
||||
#define begin_element(x) (&x[0])
|
||||
#define end_element(x) (&x[countof(x)])
|
||||
|
||||
#endif // DSLOGIC_EXTDEF_H
|
||||
BIN
DSLogic-gui/icons/Thumbs.db
Normal file
BIN
DSLogic-gui/icons/Thumbs.db
Normal file
Binary file not shown.
BIN
DSLogic-gui/icons/about.png
Normal file
BIN
DSLogic-gui/icons/about.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1.0 KiB |
BIN
DSLogic-gui/icons/add.png
Normal file
BIN
DSLogic-gui/icons/add.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 198 B |
BIN
DSLogic-gui/icons/capture.png
Normal file
BIN
DSLogic-gui/icons/capture.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 2.0 KiB |
BIN
DSLogic-gui/icons/del.png
Normal file
BIN
DSLogic-gui/icons/del.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 566 B |
BIN
DSLogic-gui/icons/down-arrow.png
Normal file
BIN
DSLogic-gui/icons/down-arrow.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 165 B |
BIN
DSLogic-gui/icons/dsl_logo.png
Normal file
BIN
DSLogic-gui/icons/dsl_logo.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 16 KiB |
BIN
DSLogic-gui/icons/file.png
Normal file
BIN
DSLogic-gui/icons/file.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 450 B |
BIN
DSLogic-gui/icons/fullscreen.png
Normal file
BIN
DSLogic-gui/icons/fullscreen.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 7.2 KiB |
BIN
DSLogic-gui/icons/logo.png
Normal file
BIN
DSLogic-gui/icons/logo.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 16 KiB |
BIN
DSLogic-gui/icons/logo_color.png
Normal file
BIN
DSLogic-gui/icons/logo_color.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 364 B |
BIN
DSLogic-gui/icons/logo_muColor.png
Normal file
BIN
DSLogic-gui/icons/logo_muColor.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 488 B |
BIN
DSLogic-gui/icons/logo_noColor.png
Normal file
BIN
DSLogic-gui/icons/logo_noColor.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 364 B |
BIN
DSLogic-gui/icons/measure.png
Normal file
BIN
DSLogic-gui/icons/measure.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1.8 KiB |
BIN
DSLogic-gui/icons/next.png
Normal file
BIN
DSLogic-gui/icons/next.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 632 B |
BIN
DSLogic-gui/icons/open.png
Normal file
BIN
DSLogic-gui/icons/open.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1.2 KiB |
BIN
DSLogic-gui/icons/params.png
Normal file
BIN
DSLogic-gui/icons/params.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1.9 KiB |
BIN
DSLogic-gui/icons/photo.png
Normal file
BIN
DSLogic-gui/icons/photo.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1017 B |
BIN
DSLogic-gui/icons/pre.png
Normal file
BIN
DSLogic-gui/icons/pre.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 648 B |
BIN
DSLogic-gui/icons/protocol.png
Normal file
BIN
DSLogic-gui/icons/protocol.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 2.4 KiB |
BIN
DSLogic-gui/icons/save.png
Normal file
BIN
DSLogic-gui/icons/save.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1.2 KiB |
BIN
DSLogic-gui/icons/search-bar.png
Normal file
BIN
DSLogic-gui/icons/search-bar.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1.9 KiB |
BIN
DSLogic-gui/icons/search.png
Normal file
BIN
DSLogic-gui/icons/search.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 251 B |
BIN
DSLogic-gui/icons/set.png
Normal file
BIN
DSLogic-gui/icons/set.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1.7 KiB |
BIN
DSLogic-gui/icons/setting.png
Normal file
BIN
DSLogic-gui/icons/setting.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 576 B |
BIN
DSLogic-gui/icons/slider-handle.png
Normal file
BIN
DSLogic-gui/icons/slider-handle.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1.2 KiB |
BIN
DSLogic-gui/icons/start.png
Normal file
BIN
DSLogic-gui/icons/start.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1.2 KiB |
BIN
DSLogic-gui/icons/stop.png
Normal file
BIN
DSLogic-gui/icons/stop.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 1.1 KiB |
BIN
DSLogic-gui/icons/trigger.png
Normal file
BIN
DSLogic-gui/icons/trigger.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 4.4 KiB |
BIN
DSLogic-gui/icons/╕┤╝■ down-arrow.png
Normal file
BIN
DSLogic-gui/icons/╕┤╝■ down-arrow.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 150 B |
BIN
DSLogic-gui/icons/╕┤╝■ params.png
Normal file
BIN
DSLogic-gui/icons/╕┤╝■ params.png
Normal file
Binary file not shown.
|
After Width: | Height: | Size: 2.7 KiB |
161
DSLogic-gui/main.cpp
Normal file
161
DSLogic-gui/main.cpp
Normal file
@@ -0,0 +1,161 @@
|
||||
/*
|
||||
* This file is part of the PulseView project.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
#ifdef ENABLE_SIGROKDECODE
|
||||
#include <libsigrokdecode/libsigrokdecode.h> /* First, so we avoid a _POSIX_C_SOURCE warning. */
|
||||
#endif
|
||||
|
||||
#include <stdint.h>
|
||||
#include <libsigrok4DSLogic/libsigrok.h>
|
||||
|
||||
#include <getopt.h>
|
||||
|
||||
#include <QtGui/QApplication>
|
||||
#include <QDebug>
|
||||
#include <QFile>
|
||||
|
||||
#include "pv/devicemanager.h"
|
||||
#include "pv/mainwindow.h"
|
||||
|
||||
#include "config.h"
|
||||
|
||||
void usage()
|
||||
{
|
||||
fprintf(stdout,
|
||||
"Usage:\n"
|
||||
" %s [OPTION…] [FILE] — %s\n"
|
||||
"\n"
|
||||
"Help Options:\n"
|
||||
" -l, --loglevel Set libsigrok/libsigrokdecode loglevel\n"
|
||||
" -V, --version Show release version\n"
|
||||
" -h, -?, --help Show help option\n"
|
||||
"\n", DS_BIN_NAME, DS_DESCRIPTION);
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
int ret = 0;
|
||||
struct sr_context *sr_ctx = NULL;
|
||||
const char *open_file = NULL;
|
||||
|
||||
QApplication a(argc, argv);
|
||||
|
||||
// Set some application metadata
|
||||
QApplication::setApplicationVersion(DS_VERSION_STRING);
|
||||
QApplication::setApplicationName("DSLogic");
|
||||
QApplication::setOrganizationDomain("http://www.DreamSourceLab.com");
|
||||
|
||||
// Parse arguments
|
||||
while (1) {
|
||||
static const struct option long_options[] = {
|
||||
{"loglevel", required_argument, 0, 'l'},
|
||||
{"version", no_argument, 0, 'V'},
|
||||
{"help", no_argument, 0, 'h'},
|
||||
{0, 0, 0, 0}
|
||||
};
|
||||
|
||||
const int c = getopt_long(argc, argv,
|
||||
"l:Vh?", long_options, NULL);
|
||||
if (c == -1)
|
||||
break;
|
||||
|
||||
switch (c) {
|
||||
case 'l':
|
||||
{
|
||||
const int loglevel = atoi(optarg);
|
||||
sr_log_loglevel_set(loglevel);
|
||||
|
||||
#ifdef ENABLE_SIGROKDECODE
|
||||
srd_log_loglevel_set(loglevel);
|
||||
#endif
|
||||
|
||||
break;
|
||||
}
|
||||
|
||||
case 'V':
|
||||
// Print version info
|
||||
fprintf(stdout, "%s %s\n", DS_TITLE, DS_VERSION_STRING);
|
||||
return 0;
|
||||
|
||||
case 'h':
|
||||
case '?':
|
||||
usage();
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
||||
if (argc - optind > 1) {
|
||||
fprintf(stderr, "Only one file can be openened.\n");
|
||||
return 1;
|
||||
} else if (argc - optind == 1)
|
||||
open_file = argv[argc - 1];
|
||||
|
||||
// Initialise libsigrok
|
||||
if (sr_init(&sr_ctx) != SR_OK) {
|
||||
qDebug() << "ERROR: libsigrok init failed.";
|
||||
return 1;
|
||||
}
|
||||
|
||||
do {
|
||||
|
||||
#ifdef ENABLE_SIGROKDECODE
|
||||
// Initialise libsigrokdecode
|
||||
if (srd_init(NULL) != SRD_OK) {
|
||||
qDebug() << "ERROR: libsigrokdecode init failed.";
|
||||
break;
|
||||
}
|
||||
|
||||
// Load the protocol decoders
|
||||
srd_decoder_load_all();
|
||||
#endif
|
||||
|
||||
try {
|
||||
// Create the device manager, initialise the drivers
|
||||
pv::DeviceManager device_manager(sr_ctx);
|
||||
|
||||
// Initialise the main window
|
||||
pv::MainWindow w(device_manager, open_file);
|
||||
//QFile qss(":/levelfour.qss");
|
||||
QFile qss(":/stylesheet.qss");
|
||||
qss.open(QFile::ReadOnly);
|
||||
a.setStyleSheet(qss.readAll());
|
||||
qss.close();
|
||||
w.show();
|
||||
|
||||
// Run the application
|
||||
ret = a.exec();
|
||||
|
||||
} catch(std::exception e) {
|
||||
qDebug() << e.what();
|
||||
}
|
||||
|
||||
#ifdef ENABLE_SIGROKDECODE
|
||||
// Destroy libsigrokdecode
|
||||
srd_exit();
|
||||
#endif
|
||||
|
||||
} while (0);
|
||||
|
||||
// Destroy libsigrok
|
||||
if (sr_ctx)
|
||||
sr_exit(sr_ctx);
|
||||
|
||||
return ret;
|
||||
}
|
||||
49
DSLogic-gui/pv/data/analog.cpp
Normal file
49
DSLogic-gui/pv/data/analog.cpp
Normal file
@@ -0,0 +1,49 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "analog.h"
|
||||
#include "analogsnapshot.h"
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
Analog::Analog(unsigned int num_probes, uint64_t samplerate) :
|
||||
SignalData(num_probes, samplerate)
|
||||
{
|
||||
}
|
||||
|
||||
void Analog::push_snapshot(shared_ptr<AnalogSnapshot> &snapshot)
|
||||
{
|
||||
_snapshots.push_front(snapshot);
|
||||
}
|
||||
|
||||
deque< shared_ptr<AnalogSnapshot> >& Analog::get_snapshots()
|
||||
{
|
||||
return _snapshots;
|
||||
}
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
55
DSLogic-gui/pv/data/analog.h
Normal file
55
DSLogic-gui/pv/data/analog.h
Normal file
@@ -0,0 +1,55 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DATA_ANALOG_H
|
||||
#define DSLOGIC_PV_DATA_ANALOG_H
|
||||
|
||||
#include "signaldata.h"
|
||||
|
||||
#include <boost/shared_ptr.hpp>
|
||||
#include <deque>
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
class AnalogSnapshot;
|
||||
|
||||
class Analog : public SignalData
|
||||
{
|
||||
public:
|
||||
Analog(unsigned int num_probes, uint64_t samplerate);
|
||||
|
||||
void push_snapshot(
|
||||
boost::shared_ptr<AnalogSnapshot> &snapshot);
|
||||
|
||||
std::deque< boost::shared_ptr<AnalogSnapshot> >&
|
||||
get_snapshots();
|
||||
|
||||
private:
|
||||
std::deque< boost::shared_ptr<AnalogSnapshot> > _snapshots;
|
||||
};
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DATA_ANALOG_H
|
||||
234
DSLogic-gui/pv/data/analogsnapshot.cpp
Normal file
234
DSLogic-gui/pv/data/analogsnapshot.cpp
Normal file
@@ -0,0 +1,234 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include <extdef.h>
|
||||
|
||||
#include <assert.h>
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <math.h>
|
||||
|
||||
#include <algorithm>
|
||||
|
||||
#include <boost/foreach.hpp>
|
||||
|
||||
#include "analogsnapshot.h"
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
const int AnalogSnapshot::EnvelopeScalePower = 4;
|
||||
const int AnalogSnapshot::EnvelopeScaleFactor = 1 << EnvelopeScalePower;
|
||||
const float AnalogSnapshot::LogEnvelopeScaleFactor =
|
||||
logf(EnvelopeScaleFactor);
|
||||
const uint64_t AnalogSnapshot::EnvelopeDataUnit = 64*1024; // bytes
|
||||
|
||||
AnalogSnapshot::AnalogSnapshot(const sr_datafeed_analog &analog, uint64_t _total_sample_len, unsigned int channel_num) :
|
||||
Snapshot(sizeof(uint16_t), _total_sample_len, channel_num)
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
memset(_envelope_levels, 0, sizeof(_envelope_levels));
|
||||
init(_total_sample_len * channel_num);
|
||||
append_payload(analog);
|
||||
}
|
||||
|
||||
AnalogSnapshot::~AnalogSnapshot()
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
BOOST_FOREACH(Envelope &e, _envelope_levels[0])
|
||||
free(e.samples);
|
||||
}
|
||||
|
||||
void AnalogSnapshot::append_payload(
|
||||
const sr_datafeed_analog &analog)
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
append_data(analog.data, analog.num_samples);
|
||||
|
||||
// Generate the first mip-map from the data
|
||||
append_payload_to_envelope_levels();
|
||||
}
|
||||
|
||||
const uint16_t* AnalogSnapshot::get_samples(
|
||||
int64_t start_sample, int64_t end_sample) const
|
||||
{
|
||||
assert(start_sample >= 0);
|
||||
assert(start_sample < (int64_t)get_sample_count());
|
||||
assert(end_sample >= 0);
|
||||
assert(end_sample < (int64_t)get_sample_count());
|
||||
assert(start_sample <= end_sample);
|
||||
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
|
||||
// uint16_t *const data = new uint16_t[end_sample - start_sample];
|
||||
// memcpy(data, (uint16_t*)_data + start_sample, sizeof(uint16_t) *
|
||||
// (end_sample - start_sample));
|
||||
// return data;
|
||||
return (uint16_t*)_data + start_sample * _channel_num;
|
||||
}
|
||||
|
||||
void AnalogSnapshot::get_envelope_section(EnvelopeSection &s,
|
||||
uint64_t start, uint64_t end, float min_length, int probe_index) const
|
||||
{
|
||||
assert(end <= get_sample_count());
|
||||
assert(start <= end);
|
||||
assert(min_length > 0);
|
||||
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
|
||||
const unsigned int min_level = max((int)floorf(logf(min_length) /
|
||||
LogEnvelopeScaleFactor) - 1, 0);
|
||||
const unsigned int scale_power = (min_level + 1) *
|
||||
EnvelopeScalePower;
|
||||
start >>= scale_power;
|
||||
end >>= scale_power;
|
||||
|
||||
s.start = start << scale_power;
|
||||
s.scale = 1 << scale_power;
|
||||
s.length = end - start;
|
||||
// s.samples = new EnvelopeSample[s.length];
|
||||
// memcpy(s.samples, _envelope_levels[min_level].samples + start,
|
||||
// s.length * sizeof(EnvelopeSample));
|
||||
s.samples = _envelope_levels[probe_index][min_level].samples + start;
|
||||
}
|
||||
|
||||
void AnalogSnapshot::reallocate_envelope(Envelope &e)
|
||||
{
|
||||
const uint64_t new_data_length = ((e.length + EnvelopeDataUnit - 1) /
|
||||
EnvelopeDataUnit) * EnvelopeDataUnit;
|
||||
if (new_data_length > e.data_length)
|
||||
{
|
||||
e.data_length = new_data_length;
|
||||
e.samples = (EnvelopeSample*)realloc(e.samples,
|
||||
new_data_length * sizeof(EnvelopeSample));
|
||||
}
|
||||
}
|
||||
|
||||
void AnalogSnapshot::append_payload_to_envelope_levels()
|
||||
{
|
||||
int i;
|
||||
for (i = 0; i < (int)_channel_num; i++) {
|
||||
Envelope &e0 = _envelope_levels[i][0];
|
||||
uint64_t prev_length;
|
||||
EnvelopeSample *dest_ptr;
|
||||
|
||||
// Expand the data buffer to fit the new samples
|
||||
prev_length = e0.length;
|
||||
e0.length = get_sample_count() / EnvelopeScaleFactor;
|
||||
|
||||
// Break off if there are no new samples to compute
|
||||
// if (e0.length == prev_length)
|
||||
// return;
|
||||
if (e0.length == 0)
|
||||
return;
|
||||
if (e0.length == prev_length)
|
||||
prev_length = 0;
|
||||
|
||||
reallocate_envelope(e0);
|
||||
|
||||
dest_ptr = e0.samples + prev_length;
|
||||
|
||||
// Iterate through the samples to populate the first level mipmap
|
||||
const uint16_t *const stop_src_ptr = (uint16_t*)_data +
|
||||
e0.length * EnvelopeScaleFactor * _channel_num;
|
||||
// for (const uint16_t *src_ptr = (uint16_t*)_data +
|
||||
// prev_length * EnvelopeScaleFactor;
|
||||
// src_ptr < end_src_ptr; src_ptr += EnvelopeScaleFactor)
|
||||
// {
|
||||
// const EnvelopeSample sub_sample = {
|
||||
// *min_element(src_ptr, src_ptr + EnvelopeScaleFactor),
|
||||
// *max_element(src_ptr, src_ptr + EnvelopeScaleFactor),
|
||||
// };
|
||||
|
||||
// *dest_ptr++ = sub_sample;
|
||||
// }
|
||||
for (const uint16_t *src_ptr = (uint16_t*)_data +
|
||||
prev_length * EnvelopeScaleFactor * _channel_num + i;
|
||||
src_ptr < stop_src_ptr; src_ptr += EnvelopeScaleFactor * _channel_num)
|
||||
{
|
||||
const uint16_t * begin_src_ptr =
|
||||
src_ptr;
|
||||
const uint16_t *const end_src_ptr =
|
||||
src_ptr + EnvelopeScaleFactor * _channel_num;
|
||||
|
||||
EnvelopeSample sub_sample;
|
||||
sub_sample.min = *begin_src_ptr;
|
||||
sub_sample.max = *begin_src_ptr;
|
||||
begin_src_ptr += _channel_num;
|
||||
while (begin_src_ptr < end_src_ptr)
|
||||
{
|
||||
sub_sample.min = min(sub_sample.min, *begin_src_ptr);
|
||||
sub_sample.max = max(sub_sample.max, *begin_src_ptr);
|
||||
begin_src_ptr += _channel_num;
|
||||
}
|
||||
|
||||
*dest_ptr++ = sub_sample;
|
||||
}
|
||||
|
||||
// Compute higher level mipmaps
|
||||
for (unsigned int level = 1; level < ScaleStepCount; level++)
|
||||
{
|
||||
Envelope &e = _envelope_levels[i][level];
|
||||
const Envelope &el = _envelope_levels[i][level-1];
|
||||
|
||||
// Expand the data buffer to fit the new samples
|
||||
prev_length = e.length;
|
||||
e.length = el.length / EnvelopeScaleFactor;
|
||||
|
||||
// Break off if there are no more samples to computed
|
||||
// if (e.length == prev_length)
|
||||
// break;
|
||||
if (e.length == prev_length)
|
||||
prev_length = 0;
|
||||
|
||||
reallocate_envelope(e);
|
||||
|
||||
// Subsample the level lower level
|
||||
const EnvelopeSample *src_ptr =
|
||||
el.samples + prev_length * EnvelopeScaleFactor;
|
||||
const EnvelopeSample *const end_dest_ptr = e.samples + e.length;
|
||||
for (dest_ptr = e.samples + prev_length;
|
||||
dest_ptr < end_dest_ptr; dest_ptr++)
|
||||
{
|
||||
const EnvelopeSample *const end_src_ptr =
|
||||
src_ptr + EnvelopeScaleFactor;
|
||||
|
||||
EnvelopeSample sub_sample = *src_ptr++;
|
||||
while (src_ptr < end_src_ptr)
|
||||
{
|
||||
sub_sample.min = min(sub_sample.min, src_ptr->min);
|
||||
sub_sample.max = max(sub_sample.max, src_ptr->max);
|
||||
src_ptr++;
|
||||
}
|
||||
|
||||
*dest_ptr = sub_sample;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
98
DSLogic-gui/pv/data/analogsnapshot.h
Normal file
98
DSLogic-gui/pv/data/analogsnapshot.h
Normal file
@@ -0,0 +1,98 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DATA_ANALOGSNAPSHOT_H
|
||||
#define DSLOGIC_PV_DATA_ANALOGSNAPSHOT_H
|
||||
|
||||
#include "snapshot.h"
|
||||
|
||||
#include <utility>
|
||||
#include <vector>
|
||||
|
||||
namespace AnalogSnapshotTest {
|
||||
class Basic;
|
||||
}
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
class AnalogSnapshot : public Snapshot
|
||||
{
|
||||
public:
|
||||
struct EnvelopeSample
|
||||
{
|
||||
uint16_t min;
|
||||
uint16_t max;
|
||||
};
|
||||
|
||||
struct EnvelopeSection
|
||||
{
|
||||
uint64_t start;
|
||||
unsigned int scale;
|
||||
uint64_t length;
|
||||
EnvelopeSample *samples;
|
||||
};
|
||||
|
||||
private:
|
||||
struct Envelope
|
||||
{
|
||||
uint64_t length;
|
||||
uint64_t data_length;
|
||||
EnvelopeSample *samples;
|
||||
};
|
||||
|
||||
private:
|
||||
static const unsigned int ScaleStepCount = 10;
|
||||
static const int EnvelopeScalePower;
|
||||
static const int EnvelopeScaleFactor;
|
||||
static const float LogEnvelopeScaleFactor;
|
||||
static const uint64_t EnvelopeDataUnit;
|
||||
|
||||
public:
|
||||
AnalogSnapshot(const sr_datafeed_analog &analog, uint64_t _total_sample_len, unsigned int channel_num);
|
||||
|
||||
virtual ~AnalogSnapshot();
|
||||
|
||||
void append_payload(const sr_datafeed_analog &analog);
|
||||
|
||||
const uint16_t* get_samples(int64_t start_sample,
|
||||
int64_t end_sample) const;
|
||||
|
||||
void get_envelope_section(EnvelopeSection &s,
|
||||
uint64_t start, uint64_t end, float min_length, int probe_index) const;
|
||||
|
||||
private:
|
||||
void reallocate_envelope(Envelope &l);
|
||||
|
||||
void append_payload_to_envelope_levels();
|
||||
|
||||
private:
|
||||
struct Envelope _envelope_levels[2*DS_MAX_ANALOG_PROBES_NUM][ScaleStepCount];
|
||||
|
||||
friend class AnalogSnapshotTest::Basic;
|
||||
};
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DATA_ANALOGSNAPSHOT_H
|
||||
49
DSLogic-gui/pv/data/group.cpp
Normal file
49
DSLogic-gui/pv/data/group.cpp
Normal file
@@ -0,0 +1,49 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "group.h"
|
||||
#include "groupsnapshot.h"
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
Group::Group(unsigned int num_probes, uint64_t samplerate) :
|
||||
SignalData(num_probes, samplerate)
|
||||
{
|
||||
}
|
||||
|
||||
void Group::push_snapshot(shared_ptr<GroupSnapshot> &snapshot)
|
||||
{
|
||||
_snapshots.push_back(snapshot);
|
||||
}
|
||||
|
||||
deque< shared_ptr<GroupSnapshot> >& Group::get_snapshots()
|
||||
{
|
||||
return _snapshots;
|
||||
}
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
55
DSLogic-gui/pv/data/group.h
Normal file
55
DSLogic-gui/pv/data/group.h
Normal file
@@ -0,0 +1,55 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DATA_GROUP_H
|
||||
#define DSLOGIC_PV_DATA_GROUP_H
|
||||
|
||||
#include "signaldata.h"
|
||||
|
||||
#include <boost/shared_ptr.hpp>
|
||||
#include <deque>
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
class GroupSnapshot;
|
||||
|
||||
class Group : public SignalData
|
||||
{
|
||||
public:
|
||||
Group(unsigned int num_probes, uint64_t samplerate);
|
||||
|
||||
void push_snapshot(
|
||||
boost::shared_ptr<GroupSnapshot> &snapshot);
|
||||
|
||||
std::deque< boost::shared_ptr<GroupSnapshot> >&
|
||||
get_snapshots();
|
||||
|
||||
private:
|
||||
std::deque< boost::shared_ptr<GroupSnapshot> > _snapshots;
|
||||
};
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DATA_GROUP_H
|
||||
276
DSLogic-gui/pv/data/groupsnapshot.cpp
Normal file
276
DSLogic-gui/pv/data/groupsnapshot.cpp
Normal file
@@ -0,0 +1,276 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include <extdef.h>
|
||||
|
||||
#include <assert.h>
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <math.h>
|
||||
|
||||
#include <algorithm>
|
||||
|
||||
#include <boost/foreach.hpp>
|
||||
|
||||
#include "logicsnapshot.h"
|
||||
#include "groupsnapshot.h"
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
const int GroupSnapshot::EnvelopeScalePower = 4;
|
||||
const int GroupSnapshot::EnvelopeScaleFactor = 1 << EnvelopeScalePower;
|
||||
const float GroupSnapshot::LogEnvelopeScaleFactor =
|
||||
logf(EnvelopeScaleFactor);
|
||||
const uint64_t GroupSnapshot::EnvelopeDataUnit = 64*1024; // bytes
|
||||
const uint16_t GroupSnapshot::value_mask[16] = {0x1, 0x2, 0x4, 0x8,
|
||||
0x10, 0x20, 0x40, 0x80,
|
||||
0x100, 0x200, 0x400, 0x800,
|
||||
0x1000, 0x2000, 0x4000, 0x8000};
|
||||
|
||||
GroupSnapshot::GroupSnapshot(const shared_ptr<LogicSnapshot> &_logic_snapshot, std::list<int> index_list)
|
||||
{
|
||||
assert(_logic_snapshot);
|
||||
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
memset(_envelope_levels, 0, sizeof(_envelope_levels));
|
||||
_data = _logic_snapshot->get_data();
|
||||
_sample_count = _logic_snapshot->get_sample_count();
|
||||
_unit_size = _logic_snapshot->get_unit_size();
|
||||
_index_list = index_list;
|
||||
append_payload();
|
||||
}
|
||||
|
||||
GroupSnapshot::~GroupSnapshot()
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
BOOST_FOREACH(Envelope &e, _envelope_levels)
|
||||
free(e.samples);
|
||||
}
|
||||
|
||||
uint64_t GroupSnapshot::get_sample_count() const
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
return _sample_count;
|
||||
}
|
||||
|
||||
void GroupSnapshot::append_payload()
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
|
||||
// Generate the first mip-map from the data
|
||||
append_payload_to_envelope_levels();
|
||||
}
|
||||
|
||||
const uint16_t* GroupSnapshot::get_samples(
|
||||
int64_t start_sample, int64_t end_sample)
|
||||
{
|
||||
assert(start_sample >= 0);
|
||||
assert(start_sample < (int64_t)_sample_count);
|
||||
assert(end_sample >= 0);
|
||||
assert(end_sample < (int64_t)_sample_count);
|
||||
assert(start_sample <= end_sample);
|
||||
|
||||
int64_t i;
|
||||
uint64_t pow;
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
|
||||
uint16_t *const data = new uint16_t[end_sample - start_sample];
|
||||
// memcpy(data, (uint16_t*)_data + start_sample, sizeof(uint16_t) *
|
||||
// (end_sample - start_sample));
|
||||
memset(data, 0, sizeof(uint16_t) * (end_sample - start_sample));
|
||||
for(i = start_sample; i < end_sample; i++) {
|
||||
std::list<int>::iterator j = _index_list.begin();
|
||||
pow = 0;
|
||||
while(j != _index_list.end()) {
|
||||
*(data + i - start_sample) += ((*((uint16_t*)_data + i) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
pow++;
|
||||
j++;
|
||||
}
|
||||
}
|
||||
return data;
|
||||
}
|
||||
|
||||
void GroupSnapshot::get_envelope_section(EnvelopeSection &s,
|
||||
uint64_t start, uint64_t end, float min_length) const
|
||||
{
|
||||
assert(end <= _sample_count);
|
||||
assert(start <= end);
|
||||
assert(min_length > 0);
|
||||
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
|
||||
const unsigned int min_level = max((int)floorf(logf(min_length) /
|
||||
LogEnvelopeScaleFactor) - 1, 0);
|
||||
const unsigned int scale_power = (min_level + 1) *
|
||||
EnvelopeScalePower;
|
||||
start >>= scale_power;
|
||||
end >>= scale_power;
|
||||
|
||||
s.start = start << scale_power;
|
||||
s.scale = 1 << scale_power;
|
||||
s.length = end - start;
|
||||
s.samples = new EnvelopeSample[s.length];
|
||||
memcpy(s.samples, _envelope_levels[min_level].samples + start,
|
||||
s.length * sizeof(EnvelopeSample));
|
||||
}
|
||||
|
||||
void GroupSnapshot::reallocate_envelope(Envelope &e)
|
||||
{
|
||||
const uint64_t new_data_length = ((e.length + EnvelopeDataUnit - 1) /
|
||||
EnvelopeDataUnit) * EnvelopeDataUnit;
|
||||
if (new_data_length > e.data_length)
|
||||
{
|
||||
e.data_length = new_data_length;
|
||||
e.samples = (EnvelopeSample*)realloc(e.samples,
|
||||
new_data_length * sizeof(EnvelopeSample));
|
||||
}
|
||||
}
|
||||
|
||||
void GroupSnapshot::append_payload_to_envelope_levels()
|
||||
{
|
||||
Envelope &e0 = _envelope_levels[0];
|
||||
uint64_t prev_length;
|
||||
EnvelopeSample *dest_ptr;
|
||||
|
||||
// Expand the data buffer to fit the new samples
|
||||
prev_length = e0.length;
|
||||
e0.length = _sample_count / EnvelopeScaleFactor;
|
||||
|
||||
// Break off if there are no new samples to compute
|
||||
if (e0.length == prev_length)
|
||||
return;
|
||||
|
||||
reallocate_envelope(e0);
|
||||
|
||||
dest_ptr = e0.samples + prev_length;
|
||||
|
||||
// Iterate through the samples to populate the first level mipmap
|
||||
uint16_t group_value[EnvelopeScaleFactor];
|
||||
const uint16_t *const end_src_ptr = (uint16_t*)_data +
|
||||
e0.length * EnvelopeScaleFactor;
|
||||
for (const uint16_t *src_ptr = (uint16_t*)_data +
|
||||
prev_length * EnvelopeScaleFactor;
|
||||
src_ptr < end_src_ptr; src_ptr += EnvelopeScaleFactor)
|
||||
{
|
||||
int pow;
|
||||
// for(i = 0; i < EnvelopeScaleFactor; i++) {
|
||||
// group_value[i] = 0;
|
||||
// std::list<int>::iterator j = _index_list.begin();
|
||||
// pow = 0;
|
||||
// while(j != _index_list.end()) {
|
||||
// group_value[i] += ((*(src_ptr + i) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
// pow++;
|
||||
// j++;
|
||||
// }
|
||||
// }
|
||||
group_value[0] = 0;
|
||||
group_value[1] = 0;
|
||||
group_value[2] = 0;
|
||||
group_value[3] = 0;
|
||||
group_value[4] = 0;
|
||||
group_value[5] = 0;
|
||||
group_value[6] = 0;
|
||||
group_value[7] = 0;
|
||||
group_value[8] = 0;
|
||||
group_value[9] = 0;
|
||||
group_value[10] = 0;
|
||||
group_value[11] = 0;
|
||||
group_value[12] = 0;
|
||||
group_value[13] = 0;
|
||||
group_value[14] = 0;
|
||||
group_value[15] = 0;
|
||||
std::list<int>::iterator j = _index_list.begin();
|
||||
pow = 0;
|
||||
while(j != _index_list.end()) {
|
||||
group_value[0] += ((*(src_ptr + 0) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[1] += ((*(src_ptr + 1) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[2] += ((*(src_ptr + 2) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[3] += ((*(src_ptr + 3) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[4] += ((*(src_ptr + 4) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[5] += ((*(src_ptr + 5) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[6] += ((*(src_ptr + 6) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[7] += ((*(src_ptr + 7) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[8] += ((*(src_ptr + 8) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[9] += ((*(src_ptr + 9) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[10] += ((*(src_ptr + 10) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[11] += ((*(src_ptr + 11) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[12] += ((*(src_ptr + 12) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[13] += ((*(src_ptr + 13) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[14] += ((*(src_ptr + 14) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
group_value[15] += ((*(src_ptr + 15) & value_mask[(*j)]) >> ((*j) - pow));
|
||||
pow++;
|
||||
j++;
|
||||
}
|
||||
const EnvelopeSample sub_sample = {
|
||||
*min_element(group_value, group_value + EnvelopeScaleFactor),
|
||||
*max_element(group_value, group_value + EnvelopeScaleFactor),
|
||||
};
|
||||
|
||||
*dest_ptr++ = sub_sample;
|
||||
}
|
||||
|
||||
// Compute higher level mipmaps
|
||||
for (unsigned int level = 1; level < ScaleStepCount; level++)
|
||||
{
|
||||
Envelope &e = _envelope_levels[level];
|
||||
const Envelope &el = _envelope_levels[level-1];
|
||||
|
||||
// Expand the data buffer to fit the new samples
|
||||
prev_length = e.length;
|
||||
e.length = el.length / EnvelopeScaleFactor;
|
||||
|
||||
// Break off if there are no more samples to computed
|
||||
if (e.length == prev_length)
|
||||
break;
|
||||
|
||||
reallocate_envelope(e);
|
||||
|
||||
// Subsample the level lower level
|
||||
const EnvelopeSample *src_ptr =
|
||||
el.samples + prev_length * EnvelopeScaleFactor;
|
||||
const EnvelopeSample *const end_dest_ptr = e.samples + e.length;
|
||||
for (dest_ptr = e.samples + prev_length;
|
||||
dest_ptr < end_dest_ptr; dest_ptr++)
|
||||
{
|
||||
const EnvelopeSample *const end_src_ptr =
|
||||
src_ptr + EnvelopeScaleFactor;
|
||||
|
||||
EnvelopeSample sub_sample = *src_ptr++;
|
||||
while (src_ptr < end_src_ptr)
|
||||
{
|
||||
sub_sample.min = min(sub_sample.min, src_ptr->min);
|
||||
sub_sample.max = max(sub_sample.max, src_ptr->max);
|
||||
src_ptr++;
|
||||
}
|
||||
|
||||
*dest_ptr = sub_sample;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
113
DSLogic-gui/pv/data/groupsnapshot.h
Normal file
113
DSLogic-gui/pv/data/groupsnapshot.h
Normal file
@@ -0,0 +1,113 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DATA_GROUPSNAPSHOT_H
|
||||
#define DSLOGIC_PV_DATA_GROUPSNAPSHOT_H
|
||||
|
||||
#include <boost/thread.hpp>
|
||||
#include <boost/shared_ptr.hpp>
|
||||
|
||||
#include "../view/signal.h"
|
||||
|
||||
#include <utility>
|
||||
#include <vector>
|
||||
#include <list>
|
||||
|
||||
namespace GroupSnapshotTest {
|
||||
class Basic;
|
||||
}
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
class LogicSnapshot;
|
||||
|
||||
class GroupSnapshot
|
||||
{
|
||||
public:
|
||||
struct EnvelopeSample
|
||||
{
|
||||
uint16_t min;
|
||||
uint16_t max;
|
||||
};
|
||||
|
||||
struct EnvelopeSection
|
||||
{
|
||||
uint64_t start;
|
||||
unsigned int scale;
|
||||
uint64_t length;
|
||||
EnvelopeSample *samples;
|
||||
};
|
||||
|
||||
private:
|
||||
struct Envelope
|
||||
{
|
||||
uint64_t length;
|
||||
uint64_t data_length;
|
||||
EnvelopeSample *samples;
|
||||
};
|
||||
|
||||
private:
|
||||
static const unsigned int ScaleStepCount = 10;
|
||||
static const int EnvelopeScalePower;
|
||||
static const int EnvelopeScaleFactor;
|
||||
static const float LogEnvelopeScaleFactor;
|
||||
static const uint64_t EnvelopeDataUnit;
|
||||
static const uint16_t value_mask[16];
|
||||
|
||||
public:
|
||||
GroupSnapshot(const boost::shared_ptr<LogicSnapshot> &_logic_snapshot, std::list<int> index_list);
|
||||
|
||||
virtual ~GroupSnapshot();
|
||||
|
||||
void append_payload();
|
||||
|
||||
uint64_t get_sample_count() const;
|
||||
|
||||
const uint16_t* get_samples(int64_t start_sample,
|
||||
int64_t end_sample);
|
||||
|
||||
void get_envelope_section(EnvelopeSection &s,
|
||||
uint64_t start, uint64_t end, float min_length) const;
|
||||
|
||||
private:
|
||||
void reallocate_envelope(Envelope &l);
|
||||
|
||||
void append_payload_to_envelope_levels();
|
||||
|
||||
private:
|
||||
struct Envelope _envelope_levels[ScaleStepCount];
|
||||
mutable boost::recursive_mutex _mutex;
|
||||
void *_data;
|
||||
uint64_t _sample_count;
|
||||
int _unit_size;
|
||||
boost::shared_ptr<view::Signal> _signal;
|
||||
std::list<int> _index_list;
|
||||
|
||||
friend class GroupSnapshotTest::Basic;
|
||||
};
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DATA_GROUPSNAPSHOT_H
|
||||
51
DSLogic-gui/pv/data/logic.cpp
Normal file
51
DSLogic-gui/pv/data/logic.cpp
Normal file
@@ -0,0 +1,51 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "logic.h"
|
||||
#include "logicsnapshot.h"
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
Logic::Logic(unsigned int num_probes, uint64_t samplerate) :
|
||||
SignalData(num_probes, samplerate)
|
||||
{
|
||||
assert(_num_probes > 0);
|
||||
}
|
||||
|
||||
void Logic::push_snapshot(
|
||||
shared_ptr<LogicSnapshot> &snapshot)
|
||||
{
|
||||
_snapshots.push_front(snapshot);
|
||||
}
|
||||
|
||||
deque< shared_ptr<LogicSnapshot> >& Logic::get_snapshots()
|
||||
{
|
||||
return _snapshots;
|
||||
}
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
55
DSLogic-gui/pv/data/logic.h
Normal file
55
DSLogic-gui/pv/data/logic.h
Normal file
@@ -0,0 +1,55 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DATA_LOGIC_H
|
||||
#define DSLOGIC_PV_DATA_LOGIC_H
|
||||
|
||||
#include "signaldata.h"
|
||||
|
||||
#include <boost/shared_ptr.hpp>
|
||||
#include <deque>
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
class LogicSnapshot;
|
||||
|
||||
class Logic : public SignalData
|
||||
{
|
||||
public:
|
||||
Logic(unsigned int num_probes, uint64_t samplerate);
|
||||
|
||||
void push_snapshot(
|
||||
boost::shared_ptr<LogicSnapshot> &snapshot);
|
||||
|
||||
std::deque< boost::shared_ptr<LogicSnapshot> >&
|
||||
get_snapshots();
|
||||
|
||||
private:
|
||||
std::deque< boost::shared_ptr<LogicSnapshot> > _snapshots;
|
||||
};
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DATA_LOGIC_H
|
||||
866
DSLogic-gui/pv/data/logicsnapshot.cpp
Normal file
866
DSLogic-gui/pv/data/logicsnapshot.cpp
Normal file
@@ -0,0 +1,866 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include <extdef.h>
|
||||
|
||||
#include <assert.h>
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <math.h>
|
||||
|
||||
#include <boost/foreach.hpp>
|
||||
|
||||
#include "logicsnapshot.h"
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
const int LogicSnapshot::MipMapScalePower = 4;
|
||||
const int LogicSnapshot::MipMapScaleFactor = 1 << MipMapScalePower;
|
||||
const float LogicSnapshot::LogMipMapScaleFactor = logf(MipMapScaleFactor);
|
||||
const uint64_t LogicSnapshot::MipMapDataUnit = 64*1024; // bytes
|
||||
|
||||
LogicSnapshot::LogicSnapshot(const sr_datafeed_logic &logic, uint64_t _total_sample_len, unsigned int channel_num) :
|
||||
Snapshot(logic.unitsize, _total_sample_len, channel_num),
|
||||
_last_append_sample(0)
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
memset(_mip_map, 0, sizeof(_mip_map));
|
||||
if (init(_total_sample_len * channel_num) == SR_OK)
|
||||
append_payload(logic);
|
||||
}
|
||||
|
||||
LogicSnapshot::~LogicSnapshot()
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
BOOST_FOREACH(MipMapLevel &l, _mip_map)
|
||||
free(l.data);
|
||||
}
|
||||
|
||||
void LogicSnapshot::append_payload(
|
||||
const sr_datafeed_logic &logic)
|
||||
{
|
||||
assert(_unit_size == logic.unitsize);
|
||||
assert((logic.length % _unit_size) == 0);
|
||||
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
|
||||
append_data(logic.data, logic.length / _unit_size);
|
||||
|
||||
// Generate the first mip-map from the data
|
||||
append_payload_to_mipmap();
|
||||
}
|
||||
|
||||
void LogicSnapshot::reallocate_mipmap_level(MipMapLevel &m)
|
||||
{
|
||||
const uint64_t new_data_length = ((m.length + MipMapDataUnit - 1) /
|
||||
MipMapDataUnit) * MipMapDataUnit;
|
||||
if (new_data_length > m.data_length)
|
||||
{
|
||||
m.data_length = new_data_length;
|
||||
|
||||
// Padding is added to allow for the uint64_t write word
|
||||
m.data = realloc(m.data, new_data_length * _unit_size +
|
||||
sizeof(uint64_t));
|
||||
}
|
||||
}
|
||||
|
||||
void LogicSnapshot::append_payload_to_mipmap()
|
||||
{
|
||||
MipMapLevel &m0 = _mip_map[0];
|
||||
uint64_t prev_length;
|
||||
const uint8_t *src_ptr;
|
||||
uint8_t *dest_ptr;
|
||||
uint64_t accumulator;
|
||||
unsigned int diff_counter;
|
||||
|
||||
// Expand the data buffer to fit the new samples
|
||||
prev_length = m0.length;
|
||||
m0.length = _sample_count / MipMapScaleFactor;
|
||||
|
||||
// Break off if there are no new samples to compute
|
||||
if (m0.length == prev_length)
|
||||
return;
|
||||
|
||||
reallocate_mipmap_level(m0);
|
||||
|
||||
dest_ptr = (uint8_t*)m0.data + prev_length * _unit_size;
|
||||
|
||||
// Iterate through the samples to populate the first level mipmap
|
||||
const uint8_t *const end_src_ptr = (uint8_t*)_data +
|
||||
m0.length * _unit_size * MipMapScaleFactor;
|
||||
for (src_ptr = (uint8_t*)_data +
|
||||
prev_length * _unit_size * MipMapScaleFactor;
|
||||
src_ptr < end_src_ptr;)
|
||||
{
|
||||
// Accumulate transitions which have occurred in this sample
|
||||
accumulator = 0;
|
||||
diff_counter = MipMapScaleFactor;
|
||||
while (diff_counter-- > 0)
|
||||
{
|
||||
const uint64_t sample = *(uint64_t*)src_ptr;
|
||||
accumulator |= _last_append_sample ^ sample;
|
||||
_last_append_sample = sample;
|
||||
src_ptr += _unit_size;
|
||||
}
|
||||
|
||||
*(uint64_t*)dest_ptr = accumulator;
|
||||
dest_ptr += _unit_size;
|
||||
}
|
||||
|
||||
// Compute higher level mipmaps
|
||||
for (unsigned int level = 1; level < ScaleStepCount; level++)
|
||||
{
|
||||
MipMapLevel &m = _mip_map[level];
|
||||
const MipMapLevel &ml = _mip_map[level-1];
|
||||
|
||||
// Expand the data buffer to fit the new samples
|
||||
prev_length = m.length;
|
||||
m.length = ml.length / MipMapScaleFactor;
|
||||
|
||||
// Break off if there are no more samples to computed
|
||||
if (m.length == prev_length)
|
||||
break;
|
||||
|
||||
reallocate_mipmap_level(m);
|
||||
|
||||
// Subsample the level lower level
|
||||
src_ptr = (uint8_t*)ml.data +
|
||||
_unit_size * prev_length * MipMapScaleFactor;
|
||||
const uint8_t *const end_dest_ptr =
|
||||
(uint8_t*)m.data + _unit_size * m.length;
|
||||
for (dest_ptr = (uint8_t*)m.data +
|
||||
_unit_size * prev_length;
|
||||
dest_ptr < end_dest_ptr;
|
||||
dest_ptr += _unit_size)
|
||||
{
|
||||
accumulator = 0;
|
||||
diff_counter = MipMapScaleFactor;
|
||||
while (diff_counter-- > 0)
|
||||
{
|
||||
accumulator |= *(uint64_t*)src_ptr;
|
||||
src_ptr += _unit_size;
|
||||
}
|
||||
|
||||
*(uint64_t*)dest_ptr = accumulator;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
uint64_t LogicSnapshot::get_sample(uint64_t index) const
|
||||
{
|
||||
assert(_data);
|
||||
assert(index < _sample_count);
|
||||
|
||||
return *(uint64_t*)((uint8_t*)_data + index * _unit_size);
|
||||
}
|
||||
|
||||
void LogicSnapshot::get_subsampled_edges(
|
||||
std::vector<EdgePair> &edges,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length, int sig_index)
|
||||
{
|
||||
uint64_t index = start;
|
||||
unsigned int level;
|
||||
bool last_sample;
|
||||
bool fast_forward;
|
||||
|
||||
assert(end <= get_sample_count());
|
||||
assert(start <= end);
|
||||
assert(min_length > 0);
|
||||
assert(sig_index >= 0);
|
||||
assert(sig_index < 64);
|
||||
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
|
||||
const uint64_t block_length = (uint64_t)max(min_length, 1.0f);
|
||||
const unsigned int min_level = max((int)floorf(logf(min_length) /
|
||||
LogMipMapScaleFactor) - 1, 0);
|
||||
const uint64_t sig_mask = 1ULL << sig_index;
|
||||
|
||||
if (!edges.empty())
|
||||
edges.clear();
|
||||
// Store the initial state
|
||||
last_sample = (get_sample(start) & sig_mask) != 0;
|
||||
edges.push_back(pair<int64_t, bool>(index++, last_sample));
|
||||
|
||||
while (index + block_length <= end)
|
||||
{
|
||||
//----- Continue to search -----//
|
||||
level = min_level;
|
||||
|
||||
// We cannot fast-forward if there is no mip-map data at
|
||||
// at the minimum level.
|
||||
fast_forward = (_mip_map[level].data != NULL);
|
||||
|
||||
if (min_length < MipMapScaleFactor)
|
||||
{
|
||||
// Search individual samples up to the beginning of
|
||||
// the next first level mip map block
|
||||
const uint64_t final_index = min(end,
|
||||
pow2_ceil(index, MipMapScalePower));
|
||||
|
||||
for (; index < final_index &&
|
||||
(index & ~(~0 << MipMapScalePower)) != 0;
|
||||
index++)
|
||||
{
|
||||
const bool sample =
|
||||
(get_sample(index) & sig_mask) != 0;
|
||||
|
||||
// If there was a change we cannot fast forward
|
||||
if (sample != last_sample) {
|
||||
fast_forward = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
// If resolution is less than a mip map block,
|
||||
// round up to the beginning of the mip-map block
|
||||
// for this level of detail
|
||||
const int min_level_scale_power =
|
||||
(level + 1) * MipMapScalePower;
|
||||
index = pow2_ceil(index, min_level_scale_power);
|
||||
if (index >= end)
|
||||
break;
|
||||
|
||||
// We can fast forward only if there was no change
|
||||
const bool sample =
|
||||
(get_sample(index) & sig_mask) != 0;
|
||||
if (last_sample != sample)
|
||||
fast_forward = false;
|
||||
}
|
||||
|
||||
if (fast_forward) {
|
||||
|
||||
// Fast forward: This involves zooming out to higher
|
||||
// levels of the mip map searching for changes, then
|
||||
// zooming in on them to find the point where the edge
|
||||
// begins.
|
||||
|
||||
// Slide right and zoom out at the beginnings of mip-map
|
||||
// blocks until we encounter a change
|
||||
while (1) {
|
||||
const int level_scale_power =
|
||||
(level + 1) * MipMapScalePower;
|
||||
const uint64_t offset =
|
||||
index >> level_scale_power;
|
||||
|
||||
// Check if we reached the last block at this
|
||||
// level, or if there was a change in this block
|
||||
if (offset >= _mip_map[level].length ||
|
||||
(get_subsample(level, offset) &
|
||||
sig_mask))
|
||||
break;
|
||||
|
||||
if ((offset & ~(~0 << MipMapScalePower)) == 0) {
|
||||
// If we are now at the beginning of a
|
||||
// higher level mip-map block ascend one
|
||||
// level
|
||||
if (level + 1 >= ScaleStepCount ||
|
||||
!_mip_map[level + 1].data)
|
||||
break;
|
||||
|
||||
level++;
|
||||
} else {
|
||||
// Slide right to the beginning of the
|
||||
// next mip map block
|
||||
index = pow2_ceil(index + 1,
|
||||
level_scale_power);
|
||||
}
|
||||
}
|
||||
|
||||
// Zoom in, and slide right until we encounter a change,
|
||||
// and repeat until we reach min_level
|
||||
while (1) {
|
||||
assert(_mip_map[level].data);
|
||||
|
||||
const int level_scale_power =
|
||||
(level + 1) * MipMapScalePower;
|
||||
const uint64_t offset =
|
||||
index >> level_scale_power;
|
||||
|
||||
// Check if we reached the last block at this
|
||||
// level, or if there was a change in this block
|
||||
if (offset >= _mip_map[level].length ||
|
||||
(get_subsample(level, offset) &
|
||||
sig_mask)) {
|
||||
// Zoom in unless we reached the minimum
|
||||
// zoom
|
||||
if (level == min_level)
|
||||
break;
|
||||
|
||||
level--;
|
||||
} else {
|
||||
// Slide right to the beginning of the
|
||||
// next mip map block
|
||||
index = pow2_ceil(index + 1,
|
||||
level_scale_power);
|
||||
}
|
||||
}
|
||||
|
||||
// If individual samples within the limit of resolution,
|
||||
// do a linear search for the next transition within the
|
||||
// block
|
||||
if (min_length < MipMapScaleFactor) {
|
||||
for (; index < end; index++) {
|
||||
const bool sample = (get_sample(index) &
|
||||
sig_mask) != 0;
|
||||
if (sample != last_sample)
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
//----- Store the edge -----//
|
||||
|
||||
// Take the last sample of the quanization block
|
||||
const int64_t final_index = index + block_length;
|
||||
if (index + block_length > end)
|
||||
break;
|
||||
|
||||
// Store the final state
|
||||
const bool final_sample =
|
||||
(get_sample(final_index - 1) & sig_mask) != 0;
|
||||
edges.push_back(pair<int64_t, bool>(index, final_sample));
|
||||
|
||||
index = final_index;
|
||||
last_sample = final_sample;
|
||||
}
|
||||
|
||||
// Add the final state
|
||||
const bool end_sample = ((get_sample(end) & sig_mask) != 0);
|
||||
if ((end != get_sample_count() - 1) ||
|
||||
((end == get_sample_count() - 1) && end_sample != last_sample))
|
||||
edges.push_back(pair<int64_t, bool>(end, end_sample));
|
||||
|
||||
if (end == get_sample_count() - 1)
|
||||
edges.push_back(pair<int64_t, bool>(end + 1, ~last_sample));
|
||||
}
|
||||
|
||||
int LogicSnapshot::get_first_edge(
|
||||
uint64_t &edge_index, bool &edge,
|
||||
uint64_t start, uint64_t end,
|
||||
int sig_index, int edge_type,
|
||||
int flag_index, int flag)
|
||||
{
|
||||
uint64_t index = start;
|
||||
unsigned int level;
|
||||
bool last_sample;
|
||||
bool fast_forward;
|
||||
|
||||
assert(end <= get_sample_count());
|
||||
assert(start <= end);
|
||||
assert(sig_index >= 0);
|
||||
assert(sig_index < 64);
|
||||
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
|
||||
const uint64_t block_length = 1;
|
||||
const unsigned int min_level = 0;
|
||||
const uint64_t sig_mask = 1ULL << sig_index;
|
||||
const uint64_t flag_mask = 1ULL << flag_index;
|
||||
|
||||
// Store the initial state
|
||||
last_sample = (get_sample(start) & sig_mask) != 0;
|
||||
|
||||
while (index + block_length <= end)
|
||||
{
|
||||
//----- Continue to search -----//
|
||||
level = min_level;
|
||||
|
||||
// We cannot fast-forward if there is no mip-map data at
|
||||
// at the minimum level.
|
||||
fast_forward = (_mip_map[level].data != NULL);
|
||||
|
||||
// Search individual samples up to the beginning of
|
||||
// the next first level mip map block
|
||||
uint64_t final_index = min(end,
|
||||
pow2_ceil(index, MipMapScalePower));
|
||||
|
||||
for (; index < final_index &&
|
||||
(index & ~(~0 << MipMapScalePower)) != 0;
|
||||
index++)
|
||||
{
|
||||
const bool sample =
|
||||
(get_sample(index) & sig_mask) != 0;
|
||||
|
||||
// If there was a change we cannot fast forward
|
||||
if (sample != last_sample) {
|
||||
fast_forward = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (fast_forward) {
|
||||
|
||||
// Fast forward: This involves zooming out to higher
|
||||
// levels of the mip map searching for changes, then
|
||||
// zooming in on them to find the point where the edge
|
||||
// begins.
|
||||
|
||||
// Slide right and zoom out at the beginnings of mip-map
|
||||
// blocks until we encounter a change
|
||||
while (1) {
|
||||
const int level_scale_power =
|
||||
(level + 1) * MipMapScalePower;
|
||||
const uint64_t offset =
|
||||
index >> level_scale_power;
|
||||
|
||||
// Check if we reached the last block at this
|
||||
// level, or if there was a change in this block
|
||||
if (offset >= _mip_map[level].length ||
|
||||
(get_subsample(level, offset) &
|
||||
sig_mask))
|
||||
break;
|
||||
|
||||
if ((offset & ~(~0 << MipMapScalePower)) == 0) {
|
||||
// If we are now at the beginning of a
|
||||
// higher level mip-map block ascend one
|
||||
// level
|
||||
if (level + 1 >= ScaleStepCount ||
|
||||
!_mip_map[level + 1].data)
|
||||
break;
|
||||
|
||||
level++;
|
||||
} else {
|
||||
// Slide right to the beginning of the
|
||||
// next mip map block
|
||||
index = pow2_ceil(index + 1,
|
||||
level_scale_power);
|
||||
}
|
||||
}
|
||||
|
||||
// Zoom in, and slide right until we encounter a change,
|
||||
// and repeat until we reach min_level
|
||||
while (1) {
|
||||
assert(_mip_map[level].data);
|
||||
|
||||
const int level_scale_power =
|
||||
(level + 1) * MipMapScalePower;
|
||||
const uint64_t offset =
|
||||
index >> level_scale_power;
|
||||
|
||||
// Check if we reached the last block at this
|
||||
// level, or if there was a change in this block
|
||||
if (offset >= _mip_map[level].length ||
|
||||
(get_subsample(level, offset) &
|
||||
sig_mask)) {
|
||||
// Zoom in unless we reached the minimum
|
||||
// zoom
|
||||
if (level == min_level)
|
||||
break;
|
||||
|
||||
level--;
|
||||
} else {
|
||||
// Slide right to the beginning of the
|
||||
// next mip map block
|
||||
index = pow2_ceil(index + 1,
|
||||
level_scale_power);
|
||||
}
|
||||
}
|
||||
|
||||
// If individual samples within the limit of resolution,
|
||||
// do a linear search for the next transition within the
|
||||
// block
|
||||
for (; index < end; index++) {
|
||||
const bool sample = (get_sample(index) &
|
||||
sig_mask) != 0;
|
||||
if (sample != last_sample)
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
//----- Store the edge -----//
|
||||
|
||||
// Take the last sample of the quanization block
|
||||
final_index = index + block_length;
|
||||
if (index + block_length > end)
|
||||
break;
|
||||
|
||||
// Store the final state
|
||||
const bool final_sample =
|
||||
(get_sample(final_index - 1) & sig_mask) != 0;
|
||||
if (final_index > 1) {
|
||||
const bool final_flag_sample = ((get_sample(final_index - 1) & flag_mask) != 0);
|
||||
const bool final_pre_flag_sample = ((get_sample(final_index - 2) & flag_mask) != 0);
|
||||
if (final_sample != last_sample &&
|
||||
((edge_type == -1) || final_sample == (edge_type != 0)) &&
|
||||
((flag == -1) || (final_flag_sample == (flag != 0) && final_flag_sample == final_pre_flag_sample))) {
|
||||
edge_index = index;
|
||||
edge = final_sample;
|
||||
return SR_OK;
|
||||
}
|
||||
}
|
||||
|
||||
index = final_index;
|
||||
last_sample = final_sample;
|
||||
}
|
||||
|
||||
// Add the final state
|
||||
const bool end_sample = ((get_sample(end) & sig_mask) != 0);
|
||||
const bool end_flag_sample = ((get_sample(end) & flag_mask) != 0);
|
||||
const bool end_pre_flag_sample = ((get_sample(end - 1) & flag_mask) != 0);
|
||||
if (end_sample != last_sample &&
|
||||
((edge_type == -1) || end_sample == (edge_type != 0)) &&
|
||||
((flag == -1) || (end_flag_sample == (flag != 0) && end_flag_sample == end_pre_flag_sample))) {
|
||||
edge_index = end;
|
||||
edge = end_sample;
|
||||
return SR_OK;
|
||||
} else {
|
||||
return SR_ERR;
|
||||
}
|
||||
}
|
||||
|
||||
void LogicSnapshot::get_edges(
|
||||
std::vector<EdgePair> &edges,
|
||||
uint64_t start, uint64_t end, int sig_index, int edge_type)
|
||||
{
|
||||
uint64_t index = start;
|
||||
unsigned int level;
|
||||
bool last_sample;
|
||||
bool fast_forward;
|
||||
|
||||
assert(end <= get_sample_count());
|
||||
assert(start <= end);
|
||||
assert(sig_index >= 0);
|
||||
assert(sig_index < 64);
|
||||
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
|
||||
const uint64_t block_length = 1;
|
||||
const unsigned int min_level = 0;
|
||||
const uint64_t sig_mask = 1ULL << sig_index;
|
||||
|
||||
if (!edges.empty())
|
||||
edges.clear();
|
||||
// Store the initial state
|
||||
last_sample = (get_sample(start) & sig_mask) != 0;
|
||||
|
||||
while (index + block_length <= end)
|
||||
{
|
||||
//----- Continue to search -----//
|
||||
level = min_level;
|
||||
|
||||
// We cannot fast-forward if there is no mip-map data at
|
||||
// at the minimum level.
|
||||
fast_forward = (_mip_map[level].data != NULL);
|
||||
|
||||
// Search individual samples up to the beginning of
|
||||
// the next first level mip map block
|
||||
uint64_t final_index = min(end,
|
||||
pow2_ceil(index, MipMapScalePower));
|
||||
|
||||
for (; index < final_index &&
|
||||
(index & ~(~0 << MipMapScalePower)) != 0;
|
||||
index++)
|
||||
{
|
||||
const bool sample =
|
||||
(get_sample(index) & sig_mask) != 0;
|
||||
|
||||
// If there was a change we cannot fast forward
|
||||
if (sample != last_sample) {
|
||||
fast_forward = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (fast_forward) {
|
||||
|
||||
// Fast forward: This involves zooming out to higher
|
||||
// levels of the mip map searching for changes, then
|
||||
// zooming in on them to find the point where the edge
|
||||
// begins.
|
||||
|
||||
// Slide right and zoom out at the beginnings of mip-map
|
||||
// blocks until we encounter a change
|
||||
while (1) {
|
||||
const int level_scale_power =
|
||||
(level + 1) * MipMapScalePower;
|
||||
const uint64_t offset =
|
||||
index >> level_scale_power;
|
||||
|
||||
// Check if we reached the last block at this
|
||||
// level, or if there was a change in this block
|
||||
if (offset >= _mip_map[level].length ||
|
||||
(get_subsample(level, offset) &
|
||||
sig_mask))
|
||||
break;
|
||||
|
||||
if ((offset & ~(~0 << MipMapScalePower)) == 0) {
|
||||
// If we are now at the beginning of a
|
||||
// higher level mip-map block ascend one
|
||||
// level
|
||||
if (level + 1 >= ScaleStepCount ||
|
||||
!_mip_map[level + 1].data)
|
||||
break;
|
||||
|
||||
level++;
|
||||
} else {
|
||||
// Slide right to the beginning of the
|
||||
// next mip map block
|
||||
index = pow2_ceil(index + 1,
|
||||
level_scale_power);
|
||||
}
|
||||
}
|
||||
|
||||
// Zoom in, and slide right until we encounter a change,
|
||||
// and repeat until we reach min_level
|
||||
while (1) {
|
||||
assert(_mip_map[level].data);
|
||||
|
||||
const int level_scale_power =
|
||||
(level + 1) * MipMapScalePower;
|
||||
const uint64_t offset =
|
||||
index >> level_scale_power;
|
||||
|
||||
// Check if we reached the last block at this
|
||||
// level, or if there was a change in this block
|
||||
if (offset >= _mip_map[level].length ||
|
||||
(get_subsample(level, offset) &
|
||||
sig_mask)) {
|
||||
// Zoom in unless we reached the minimum
|
||||
// zoom
|
||||
if (level == min_level)
|
||||
break;
|
||||
|
||||
level--;
|
||||
} else {
|
||||
// Slide right to the beginning of the
|
||||
// next mip map block
|
||||
index = pow2_ceil(index + 1,
|
||||
level_scale_power);
|
||||
}
|
||||
}
|
||||
|
||||
// If individual samples within the limit of resolution,
|
||||
// do a linear search for the next transition within the
|
||||
// block
|
||||
for (; index < end; index++) {
|
||||
const bool sample = (get_sample(index) &
|
||||
sig_mask) != 0;
|
||||
if (sample != last_sample)
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
//----- Store the edge -----//
|
||||
|
||||
// Take the last sample of the quanization block
|
||||
final_index = index + block_length;
|
||||
if (index + block_length > end)
|
||||
break;
|
||||
|
||||
// Store the final state
|
||||
const bool final_sample =
|
||||
(get_sample(final_index - 1) & sig_mask) != 0;
|
||||
if ((edge_type == -1) || (final_sample == (edge_type != 0)))
|
||||
edges.push_back(pair<int64_t, bool>(final_index - 1, final_sample));
|
||||
|
||||
index = final_index;
|
||||
last_sample = final_sample;
|
||||
}
|
||||
|
||||
// Add the final state
|
||||
const bool end_sample = ((get_sample(end) & sig_mask) != 0);
|
||||
if ((end_sample != last_sample) &&
|
||||
((edge_type == -1) || (end_sample == (edge_type != 0))))
|
||||
edges.push_back(pair<int64_t, bool>(end, end_sample));
|
||||
}
|
||||
|
||||
uint64_t LogicSnapshot::get_min_pulse(uint64_t start, uint64_t end, int sig_index)
|
||||
{
|
||||
uint64_t index = start;
|
||||
unsigned int level;
|
||||
bool last_sample;
|
||||
bool fast_forward;
|
||||
uint64_t last_index;
|
||||
uint64_t min_pulse = end - start;
|
||||
|
||||
assert(end <= get_sample_count());
|
||||
assert(start <= end);
|
||||
assert(sig_index >= 0);
|
||||
assert(sig_index < 64);
|
||||
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
|
||||
const uint64_t block_length = 1;
|
||||
const unsigned int min_level = 0;
|
||||
const uint64_t sig_mask = 1ULL << sig_index;
|
||||
|
||||
// Store the initial state
|
||||
last_index = start;
|
||||
last_sample = (get_sample(start) & sig_mask) != 0;
|
||||
|
||||
while (index + block_length <= end)
|
||||
{
|
||||
//----- Continue to search -----//
|
||||
level = min_level;
|
||||
|
||||
// We cannot fast-forward if there is no mip-map data at
|
||||
// at the minimum level.
|
||||
fast_forward = (_mip_map[level].data != NULL);
|
||||
|
||||
// Search individual samples up to the beginning of
|
||||
// the next first level mip map block
|
||||
uint64_t final_index = min(end,
|
||||
pow2_ceil(index, MipMapScalePower));
|
||||
|
||||
for (; index < final_index &&
|
||||
(index & ~(~0 << MipMapScalePower)) != 0;
|
||||
index++)
|
||||
{
|
||||
const bool sample =
|
||||
(get_sample(index) & sig_mask) != 0;
|
||||
|
||||
// If there was a change we cannot fast forward
|
||||
if (sample != last_sample) {
|
||||
fast_forward = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (fast_forward) {
|
||||
|
||||
// Fast forward: This involves zooming out to higher
|
||||
// levels of the mip map searching for changes, then
|
||||
// zooming in on them to find the point where the edge
|
||||
// begins.
|
||||
|
||||
// Slide right and zoom out at the beginnings of mip-map
|
||||
// blocks until we encounter a change
|
||||
while (1) {
|
||||
const int level_scale_power =
|
||||
(level + 1) * MipMapScalePower;
|
||||
const uint64_t offset =
|
||||
index >> level_scale_power;
|
||||
|
||||
// Check if we reached the last block at this
|
||||
// level, or if there was a change in this block
|
||||
if (offset >= _mip_map[level].length ||
|
||||
(get_subsample(level, offset) &
|
||||
sig_mask))
|
||||
break;
|
||||
|
||||
if ((offset & ~(~0 << MipMapScalePower)) == 0) {
|
||||
// If we are now at the beginning of a
|
||||
// higher level mip-map block ascend one
|
||||
// level
|
||||
if (level + 1 >= ScaleStepCount ||
|
||||
!_mip_map[level + 1].data)
|
||||
break;
|
||||
|
||||
level++;
|
||||
} else {
|
||||
// Slide right to the beginning of the
|
||||
// next mip map block
|
||||
index = pow2_ceil(index + 1,
|
||||
level_scale_power);
|
||||
}
|
||||
}
|
||||
|
||||
// Zoom in, and slide right until we encounter a change,
|
||||
// and repeat until we reach min_level
|
||||
while (1) {
|
||||
assert(_mip_map[level].data);
|
||||
|
||||
const int level_scale_power =
|
||||
(level + 1) * MipMapScalePower;
|
||||
const uint64_t offset =
|
||||
index >> level_scale_power;
|
||||
|
||||
// Check if we reached the last block at this
|
||||
// level, or if there was a change in this block
|
||||
if (offset >= _mip_map[level].length ||
|
||||
(get_subsample(level, offset) &
|
||||
sig_mask)) {
|
||||
// Zoom in unless we reached the minimum
|
||||
// zoom
|
||||
if (level == min_level)
|
||||
break;
|
||||
|
||||
level--;
|
||||
} else {
|
||||
// Slide right to the beginning of the
|
||||
// next mip map block
|
||||
index = pow2_ceil(index + 1,
|
||||
level_scale_power);
|
||||
}
|
||||
}
|
||||
|
||||
// If individual samples within the limit of resolution,
|
||||
// do a linear search for the next transition within the
|
||||
// block
|
||||
for (; index < end; index++) {
|
||||
const bool sample = (get_sample(index) &
|
||||
sig_mask) != 0;
|
||||
if (sample != last_sample)
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
//----- Store the edge -----//
|
||||
|
||||
// Take the last sample of the quanization block
|
||||
final_index = index + block_length;
|
||||
if (index + block_length > end)
|
||||
break;
|
||||
|
||||
// get pulse width
|
||||
const bool final_sample =
|
||||
(get_sample(final_index - 1) & sig_mask) != 0;
|
||||
min_pulse = min(index - last_index, min_pulse);
|
||||
last_index = index;
|
||||
if (min_pulse == 1)
|
||||
break;
|
||||
|
||||
index = final_index;
|
||||
last_sample = final_sample;
|
||||
}
|
||||
|
||||
// Add the final state
|
||||
min_pulse = min(end - last_index, min_pulse);
|
||||
|
||||
return min_pulse;
|
||||
}
|
||||
|
||||
uint64_t LogicSnapshot::get_subsample(int level, uint64_t offset) const
|
||||
{
|
||||
assert(level >= 0);
|
||||
assert(_mip_map[level].data);
|
||||
return *(uint64_t*)((uint8_t*)_mip_map[level].data +
|
||||
_unit_size * offset);
|
||||
}
|
||||
|
||||
uint64_t LogicSnapshot::pow2_ceil(uint64_t x, unsigned int power)
|
||||
{
|
||||
const uint64_t p = 1 << power;
|
||||
return (x + p - 1) / p * p;
|
||||
}
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
121
DSLogic-gui/pv/data/logicsnapshot.h
Normal file
121
DSLogic-gui/pv/data/logicsnapshot.h
Normal file
@@ -0,0 +1,121 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DATA_LOGICSNAPSHOT_H
|
||||
#define DSLOGIC_PV_DATA_LOGICSNAPSHOT_H
|
||||
|
||||
#include "snapshot.h"
|
||||
|
||||
#include <utility>
|
||||
#include <vector>
|
||||
|
||||
namespace LogicSnapshotTest {
|
||||
class Pow2;
|
||||
class Basic;
|
||||
class LargeData;
|
||||
class Pulses;
|
||||
class LongPulses;
|
||||
}
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
class LogicSnapshot : public Snapshot
|
||||
{
|
||||
private:
|
||||
struct MipMapLevel
|
||||
{
|
||||
uint64_t length;
|
||||
uint64_t data_length;
|
||||
void *data;
|
||||
};
|
||||
|
||||
private:
|
||||
static const unsigned int ScaleStepCount = 10;
|
||||
static const int MipMapScalePower;
|
||||
static const int MipMapScaleFactor;
|
||||
static const float LogMipMapScaleFactor;
|
||||
static const uint64_t MipMapDataUnit;
|
||||
|
||||
public:
|
||||
typedef std::pair<uint64_t, bool> EdgePair;
|
||||
|
||||
public:
|
||||
LogicSnapshot(const sr_datafeed_logic &logic, uint64_t _total_sample_len, unsigned int channel_num);
|
||||
|
||||
virtual ~LogicSnapshot();
|
||||
|
||||
void append_payload(const sr_datafeed_logic &logic);
|
||||
|
||||
uint64_t get_sample(uint64_t index) const;
|
||||
|
||||
private:
|
||||
void reallocate_mipmap_level(MipMapLevel &m);
|
||||
|
||||
void append_payload_to_mipmap();
|
||||
|
||||
public:
|
||||
/**
|
||||
* Parses a logic data snapshot to generate a list of transitions
|
||||
* in a time interval to a given level of detail.
|
||||
* @param[out] edges The vector to place the edges into.
|
||||
* @param[in] start The start sample index.
|
||||
* @param[in] end The end sample index.
|
||||
* @param[in] min_length The minimum number of samples that
|
||||
* can be resolved at this level of detail.
|
||||
* @param[in] sig_index The index of the signal.
|
||||
**/
|
||||
void get_subsampled_edges(std::vector<EdgePair> &edges,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length, int sig_index);
|
||||
|
||||
int get_first_edge(uint64_t &edge_index, bool &edge,
|
||||
uint64_t start, uint64_t end,
|
||||
int sig_index, int edge_type,
|
||||
int flag_index, int flag);
|
||||
|
||||
void get_edges(std::vector<EdgePair> &edges,
|
||||
uint64_t start, uint64_t end, int sig_index, int edge_type);
|
||||
|
||||
uint64_t get_min_pulse(uint64_t start, uint64_t end, int sig_index);
|
||||
|
||||
private:
|
||||
uint64_t get_subsample(int level, uint64_t offset) const;
|
||||
|
||||
static uint64_t pow2_ceil(uint64_t x, unsigned int power);
|
||||
|
||||
private:
|
||||
struct MipMapLevel _mip_map[ScaleStepCount];
|
||||
uint64_t _last_append_sample;
|
||||
|
||||
friend class LogicSnapshotTest::Pow2;
|
||||
friend class LogicSnapshotTest::Basic;
|
||||
friend class LogicSnapshotTest::LargeData;
|
||||
friend class LogicSnapshotTest::Pulses;
|
||||
friend class LogicSnapshotTest::LongPulses;
|
||||
};
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DATA_LOGICSNAPSHOT_H
|
||||
52
DSLogic-gui/pv/data/signaldata.cpp
Normal file
52
DSLogic-gui/pv/data/signaldata.cpp
Normal file
@@ -0,0 +1,52 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "signaldata.h"
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
SignalData::SignalData(unsigned int num_probes, double samplerate) :
|
||||
_num_probes(num_probes),
|
||||
_samplerate(samplerate),
|
||||
_start_time(0)
|
||||
{
|
||||
}
|
||||
|
||||
int SignalData::get_num_probes() const
|
||||
{
|
||||
return _num_probes;
|
||||
}
|
||||
|
||||
double SignalData::get_samplerate() const
|
||||
{
|
||||
return _samplerate;
|
||||
}
|
||||
|
||||
double SignalData::get_start_time() const
|
||||
{
|
||||
return _start_time;
|
||||
}
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
51
DSLogic-gui/pv/data/signaldata.h
Normal file
51
DSLogic-gui/pv/data/signaldata.h
Normal file
@@ -0,0 +1,51 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DATA_SIGNALDATA_H
|
||||
#define DSLOGIC_PV_DATA_SIGNALDATA_H
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
class SignalData
|
||||
{
|
||||
public:
|
||||
SignalData(unsigned int num_probes, double samplerate);
|
||||
|
||||
public:
|
||||
double get_samplerate() const;
|
||||
double get_start_time() const;
|
||||
int get_num_probes() const;
|
||||
|
||||
protected:
|
||||
const unsigned int _num_probes;
|
||||
const double _samplerate;
|
||||
const double _start_time;
|
||||
};
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DATA_SIGNALDATA_H
|
||||
122
DSLogic-gui/pv/data/snapshot.cpp
Normal file
122
DSLogic-gui/pv/data/snapshot.cpp
Normal file
@@ -0,0 +1,122 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "snapshot.h"
|
||||
|
||||
#include <assert.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
using namespace boost;
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
Snapshot::Snapshot(int unit_size, uint64_t total_sample_count, unsigned int channel_num) :
|
||||
_data(NULL),
|
||||
_channel_num(channel_num),
|
||||
_sample_count(0),
|
||||
_total_sample_count(total_sample_count * channel_num),
|
||||
_ring_sample_count(0),
|
||||
_unit_size(unit_size)
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
assert(_unit_size > 0);
|
||||
}
|
||||
|
||||
Snapshot::~Snapshot()
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
if (_data != NULL)
|
||||
free(_data);
|
||||
_data = NULL;
|
||||
}
|
||||
|
||||
int Snapshot::init(uint64_t _total_sample_len)
|
||||
{
|
||||
_data = malloc(_total_sample_len * _unit_size +
|
||||
sizeof(uint64_t));
|
||||
|
||||
if (_data == NULL)
|
||||
return SR_ERR_MALLOC;
|
||||
else
|
||||
return SR_OK;
|
||||
}
|
||||
|
||||
bool Snapshot::buf_null() const
|
||||
{
|
||||
if (_data == NULL)
|
||||
return true;
|
||||
else
|
||||
return false;
|
||||
}
|
||||
|
||||
uint64_t Snapshot::get_sample_count() const
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
return _sample_count / _channel_num;
|
||||
}
|
||||
|
||||
void* Snapshot::get_data() const
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
return _data;
|
||||
}
|
||||
|
||||
int Snapshot::get_unit_size() const
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
return _unit_size;
|
||||
}
|
||||
|
||||
unsigned int Snapshot::get_channel_num() const
|
||||
{
|
||||
lock_guard<recursive_mutex> lock(_mutex);
|
||||
return _channel_num;
|
||||
}
|
||||
|
||||
void Snapshot::append_data(void *data, uint64_t samples)
|
||||
{
|
||||
// lock_guard<recursive_mutex> lock(_mutex);
|
||||
// _data = realloc(_data, (_sample_count + samples) * _unit_size +
|
||||
// sizeof(uint64_t));
|
||||
if (_sample_count + samples < _total_sample_count)
|
||||
_sample_count += samples;
|
||||
else
|
||||
_sample_count = _total_sample_count;
|
||||
|
||||
if (_ring_sample_count + samples > _total_sample_count) {
|
||||
memcpy((uint8_t*)_data + _ring_sample_count * _unit_size,
|
||||
data, (_total_sample_count - _ring_sample_count) * _unit_size);
|
||||
_ring_sample_count = (samples + _ring_sample_count - _total_sample_count) % _total_sample_count;
|
||||
memcpy((uint8_t*)_data,
|
||||
data, _ring_sample_count * _unit_size);
|
||||
} else {
|
||||
memcpy((uint8_t*)_data + _ring_sample_count * _unit_size,
|
||||
data, samples * _unit_size);
|
||||
_ring_sample_count += samples;
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
69
DSLogic-gui/pv/data/snapshot.h
Normal file
69
DSLogic-gui/pv/data/snapshot.h
Normal file
@@ -0,0 +1,69 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DATA_SNAPSHOT_H
|
||||
#define DSLOGIC_PV_DATA_SNAPSHOT_H
|
||||
|
||||
#include <libsigrok4DSLogic/libsigrok.h>
|
||||
|
||||
#include <boost/thread.hpp>
|
||||
|
||||
namespace pv {
|
||||
namespace data {
|
||||
|
||||
class Snapshot
|
||||
{
|
||||
public:
|
||||
Snapshot(int unit_size, uint64_t total_sample_count, unsigned int channel_num);
|
||||
|
||||
virtual ~Snapshot();
|
||||
|
||||
int init(uint64_t _total_sample_len);
|
||||
|
||||
uint64_t get_sample_count() const;
|
||||
|
||||
void * get_data() const;
|
||||
|
||||
int get_unit_size() const;
|
||||
|
||||
bool buf_null() const;
|
||||
|
||||
unsigned int get_channel_num() const;
|
||||
|
||||
protected:
|
||||
void append_data(void *data, uint64_t samples);
|
||||
|
||||
protected:
|
||||
mutable boost::recursive_mutex _mutex;
|
||||
void *_data;
|
||||
unsigned int _channel_num;
|
||||
uint64_t _sample_count;
|
||||
uint64_t _total_sample_count;
|
||||
uint64_t _ring_sample_count;
|
||||
int _unit_size;
|
||||
};
|
||||
|
||||
} // namespace data
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DATA_SNAPSHOT_H
|
||||
55
DSLogic-gui/pv/decoder/decoder.cpp
Normal file
55
DSLogic-gui/pv/decoder/decoder.cpp
Normal file
@@ -0,0 +1,55 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "decoder.h"
|
||||
|
||||
namespace pv {
|
||||
namespace decoder {
|
||||
|
||||
Decoder::Decoder(boost::shared_ptr<pv::data::Logic> data, std::list<int> sel_probes, QMap<QString, int> options_index) :
|
||||
_data(data),
|
||||
_sel_probes(sel_probes),
|
||||
_options_index(options_index),
|
||||
_total_state(0),
|
||||
_max_state_samples(0)
|
||||
{
|
||||
}
|
||||
|
||||
std::list<int > Decoder::get_probes()
|
||||
{
|
||||
return _sel_probes;
|
||||
}
|
||||
|
||||
QMap <QString, int> Decoder::get_options_index()
|
||||
{
|
||||
return _options_index;
|
||||
}
|
||||
|
||||
void Decoder::set_data(boost::shared_ptr<data::Logic> _logic_data)
|
||||
{
|
||||
assert(_logic_data);
|
||||
_data = _logic_data;
|
||||
}
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
115
DSLogic-gui/pv/decoder/decoder.h
Normal file
115
DSLogic-gui/pv/decoder/decoder.h
Normal file
@@ -0,0 +1,115 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DECODER_H
|
||||
#define DSLOGIC_PV_DECODER_H
|
||||
|
||||
#include <boost/shared_ptr.hpp>
|
||||
|
||||
#include <QColor>
|
||||
#include <QMap>
|
||||
#include <QVariant>
|
||||
|
||||
#include <stdint.h>
|
||||
#include <vector>
|
||||
|
||||
namespace pv {
|
||||
|
||||
namespace data {
|
||||
class Logic;
|
||||
}
|
||||
|
||||
namespace decoder {
|
||||
|
||||
enum {
|
||||
DEC_CMD = 0,
|
||||
DEC_DATA = 1,
|
||||
DEC_CNT = 2,
|
||||
DEC_NODETAIL
|
||||
};
|
||||
|
||||
struct ds_view_state {
|
||||
uint64_t index;
|
||||
uint64_t samples;
|
||||
uint16_t type;
|
||||
uint8_t state;
|
||||
uint8_t data;
|
||||
};
|
||||
|
||||
enum {
|
||||
I2C = 0,
|
||||
SPI,
|
||||
Serial,
|
||||
Dmx512,
|
||||
Wire1
|
||||
};
|
||||
|
||||
static QString protocol_list[] = {
|
||||
"I2C",
|
||||
"SPI",
|
||||
"Serial",
|
||||
"DMX512",
|
||||
"1-Wire",
|
||||
NULL,
|
||||
};
|
||||
|
||||
class Decoder
|
||||
{
|
||||
protected:
|
||||
static const int _view_scale = 8;
|
||||
Decoder(boost::shared_ptr<pv::data::Logic> data, std::list <int > sel_probes, QMap <QString, int> options_index);
|
||||
public:
|
||||
std::list<int > get_probes();
|
||||
QMap <QString, int> get_options_index();
|
||||
void set_data(boost::shared_ptr<data::Logic> _logic_data);
|
||||
|
||||
public:
|
||||
virtual QString get_decode_name() = 0;
|
||||
|
||||
virtual void recode(std::list <int > sel_probes, QMap <QString, QVariant>& options, QMap <QString, int> options_index) = 0;
|
||||
virtual void decode() = 0;
|
||||
|
||||
virtual void fill_color_table(std::vector <QColor>& _color_table) = 0;
|
||||
|
||||
virtual void fill_state_table(std::vector <QString>& _state_table) = 0;
|
||||
|
||||
virtual void get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length) = 0;
|
||||
|
||||
private:
|
||||
|
||||
|
||||
protected:
|
||||
|
||||
boost::shared_ptr<pv::data::Logic> _data;
|
||||
std::list <int > _sel_probes;
|
||||
QMap <QString, int> _options_index;
|
||||
uint64_t _total_state;
|
||||
uint64_t _max_state_samples;
|
||||
};
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DECODER_H
|
||||
67
DSLogic-gui/pv/decoder/decoderfactory.cpp
Normal file
67
DSLogic-gui/pv/decoder/decoderfactory.cpp
Normal file
@@ -0,0 +1,67 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
#include "decoderfactory.h"
|
||||
#include "dsi2c.h"
|
||||
#include "dsspi.h"
|
||||
#include "dsserial.h"
|
||||
#include "dsdmx512.h"
|
||||
#include "ds1wire.h"
|
||||
|
||||
namespace pv {
|
||||
namespace decoder {
|
||||
|
||||
DecoderFactory::DecoderFactory()
|
||||
{
|
||||
}
|
||||
|
||||
Decoder* DecoderFactory::createDecoder(int type, boost::shared_ptr<data::Logic> data,
|
||||
std::list <int > _sel_probes, QMap <QString, QVariant> &_options, QMap <QString, int> _options_index)
|
||||
{
|
||||
Decoder *decoder = NULL;
|
||||
|
||||
switch(type)
|
||||
{
|
||||
case I2C:
|
||||
decoder = new dsI2c(data, _sel_probes, _options, _options_index);
|
||||
break;
|
||||
case SPI:
|
||||
decoder = new dsSpi(data, _sel_probes, _options, _options_index);
|
||||
break;
|
||||
case Serial:
|
||||
decoder = new dsSerial(data, _sel_probes, _options, _options_index);
|
||||
break;
|
||||
case Dmx512:
|
||||
decoder = new dsDmx512(data, _sel_probes, _options, _options_index);
|
||||
break;
|
||||
case Wire1:
|
||||
decoder = new ds1Wire(data, _sel_probes, _options, _options_index);
|
||||
break;
|
||||
default:
|
||||
decoder = new dsI2c(data, _sel_probes, _options, _options_index);
|
||||
}
|
||||
|
||||
return decoder;
|
||||
}
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
49
DSLogic-gui/pv/decoder/decoderfactory.h
Normal file
49
DSLogic-gui/pv/decoder/decoderfactory.h
Normal file
@@ -0,0 +1,49 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DECODERFACTORY_H
|
||||
#define DSLOGIC_PV_DECODERFACTORY_H
|
||||
|
||||
#include "decoder.h"
|
||||
|
||||
#include <QMap>
|
||||
#include <QVariant>
|
||||
|
||||
namespace pv {
|
||||
namespace decoder {
|
||||
|
||||
class DecoderFactory
|
||||
{
|
||||
public:
|
||||
DecoderFactory();
|
||||
|
||||
public:
|
||||
Decoder * createDecoder(int type, boost::shared_ptr<data::Logic> data,
|
||||
std::list <int > _sel_probes, QMap<QString, QVariant> &_options, QMap<QString, int> _options_index);
|
||||
|
||||
};
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DECODERFACTORY_H
|
||||
260
DSLogic-gui/pv/decoder/democonfig.cpp
Normal file
260
DSLogic-gui/pv/decoder/democonfig.cpp
Normal file
@@ -0,0 +1,260 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "democonfig.h"
|
||||
#include "ui_i2cconfig.h"
|
||||
#include "ui_spiconfig.h"
|
||||
#include "ui_serialconfig.h"
|
||||
#include "ui_dmx512config.h"
|
||||
#include "ui_wire1config.h"
|
||||
|
||||
#include "decoder.h"
|
||||
#include "../sigsession.h"
|
||||
#include "../view/signal.h"
|
||||
#include "../view/logicsignal.h"
|
||||
|
||||
#include <assert.h>
|
||||
|
||||
namespace pv {
|
||||
namespace decoder {
|
||||
|
||||
DemoConfig::DemoConfig(QWidget *parent, struct sr_dev_inst *sdi, int protocol) :
|
||||
QDialog(parent),
|
||||
_sdi(sdi),
|
||||
_protocol(protocol)
|
||||
{
|
||||
assert(_sdi);
|
||||
|
||||
i2c_ui = NULL;
|
||||
spi_ui = NULL;
|
||||
wire1_ui = NULL;
|
||||
serial_ui = NULL;
|
||||
dmx512_ui = NULL;
|
||||
|
||||
if (_protocol == I2C) {
|
||||
i2c_ui = new Ui::I2cConfig;
|
||||
i2c_ui->setupUi(this);
|
||||
|
||||
i2c_ui->setupUi(this);
|
||||
for (const GSList *l = _sdi->probes; l; l = l->next) {
|
||||
sr_probe *const probe = (sr_probe*)l->data;
|
||||
assert(probe);
|
||||
i2c_ui->scl_comboBox->addItem(QString::number(probe->index) + " - " + probe->name);
|
||||
i2c_ui->sda_comboBox->addItem(QString::number(probe->index) + " - " + probe->name);
|
||||
}
|
||||
i2c_ui->scl_comboBox->setCurrentIndex(0);
|
||||
i2c_ui->sda_comboBox->setCurrentIndex(1);
|
||||
} else if (_protocol == SPI) {
|
||||
spi_ui = new Ui::SpiConfig;
|
||||
spi_ui->setupUi(this);
|
||||
|
||||
spi_ui->setupUi(this);
|
||||
for (const GSList *l = _sdi->probes; l; l = l->next) {
|
||||
sr_probe *const probe = (sr_probe*)l->data;
|
||||
assert(probe);
|
||||
spi_ui->ssn_comboBox->addItem(QString::number(probe->index) + " - " + probe->name);
|
||||
spi_ui->sclk_comboBox->addItem(QString::number(probe->index) + " - " + probe->name);
|
||||
spi_ui->mosi_comboBox->addItem(QString::number(probe->index) + " - " + probe->name);
|
||||
spi_ui->miso_comboBox->addItem(QString::number(probe->index) + " - " + probe->name);
|
||||
}
|
||||
spi_ui->ssn_comboBox->setCurrentIndex(0);
|
||||
spi_ui->sclk_comboBox->setCurrentIndex(1);
|
||||
spi_ui->mosi_comboBox->setCurrentIndex(2);
|
||||
spi_ui->miso_comboBox->setCurrentIndex(3);
|
||||
} else if (_protocol == Serial) {
|
||||
serial_ui = new Ui::SerialConfig;
|
||||
serial_ui->setupUi(this);
|
||||
|
||||
serial_ui->setupUi(this);
|
||||
for (const GSList *l = _sdi->probes; l; l = l->next) {
|
||||
sr_probe *const probe = (sr_probe*)l->data;
|
||||
assert(probe);
|
||||
serial_ui->serial_comboBox->addItem(QString::number(probe->index) + " - " + probe->name);
|
||||
}
|
||||
serial_ui->serial_comboBox->setCurrentIndex(0);
|
||||
} else if (_protocol == Dmx512) {
|
||||
dmx512_ui = new Ui::Dmx512Config;
|
||||
dmx512_ui->setupUi(this);
|
||||
|
||||
dmx512_ui->setupUi(this);
|
||||
for (const GSList *l = _sdi->probes; l; l = l->next) {
|
||||
sr_probe *const probe = (sr_probe*)l->data;
|
||||
assert(probe);
|
||||
dmx512_ui->probe_comboBox->addItem(QString::number(probe->index) + " - " + probe->name);
|
||||
}
|
||||
dmx512_ui->probe_comboBox->setCurrentIndex(0);
|
||||
} else if (_protocol == Wire1) {
|
||||
wire1_ui = new Ui::Wire1Config;
|
||||
wire1_ui->setupUi(this);
|
||||
|
||||
wire1_ui->setupUi(this);
|
||||
for (const GSList *l = _sdi->probes; l; l = l->next) {
|
||||
sr_probe *const probe = (sr_probe*)l->data;
|
||||
assert(probe);
|
||||
wire1_ui->probe_comboBox->addItem(QString::number(probe->index) + " - " + probe->name);
|
||||
}
|
||||
wire1_ui->probe_comboBox->setCurrentIndex(0);
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
DemoConfig::~DemoConfig()
|
||||
{
|
||||
if (i2c_ui)
|
||||
delete i2c_ui;
|
||||
if (spi_ui)
|
||||
delete spi_ui;
|
||||
if (serial_ui)
|
||||
delete serial_ui;
|
||||
if (dmx512_ui)
|
||||
delete dmx512_ui;
|
||||
if (wire1_ui)
|
||||
delete wire1_ui;
|
||||
}
|
||||
|
||||
void DemoConfig::accept()
|
||||
{
|
||||
using namespace Qt;
|
||||
|
||||
QDialog::accept();
|
||||
|
||||
if (_protocol == I2C) {
|
||||
if (!_sel_probes.empty())
|
||||
_sel_probes.clear();
|
||||
_sel_probes.push_back(i2c_ui->scl_comboBox->currentIndex());
|
||||
_sel_probes.push_back(i2c_ui->sda_comboBox->currentIndex());
|
||||
} else if (_protocol == SPI) {
|
||||
const int ssn_option = spi_ui->cs_comboBox->currentText().contains("low", Qt::CaseInsensitive) ? 0 :
|
||||
spi_ui->cs_comboBox->currentText().contains("high", Qt::CaseInsensitive) ? 1 : -1;
|
||||
if (!_sel_probes.empty())
|
||||
_sel_probes.clear();
|
||||
if (ssn_option != -1)
|
||||
_sel_probes.push_back(spi_ui->ssn_comboBox->currentIndex());
|
||||
_sel_probes.push_back(spi_ui->sclk_comboBox->currentIndex());
|
||||
_sel_probes.push_back(spi_ui->mosi_comboBox->currentIndex());
|
||||
_sel_probes.push_back(spi_ui->miso_comboBox->currentIndex());
|
||||
|
||||
if (!_options.empty())
|
||||
_options.clear();
|
||||
_options.insert("cpol", spi_ui->cpol_comboBox->currentText().contains("0", Qt::CaseInsensitive) ? 0 : 1);
|
||||
_options.insert("cpha", spi_ui->cpha_comboBox->currentText().contains("0", Qt::CaseInsensitive) ? 0 : 1);
|
||||
_options.insert("bits", spi_ui->bits_comboBox->currentText().toUInt());
|
||||
_options.insert("order", spi_ui->order_comboBox->currentText().contains("MSB", Qt::CaseInsensitive) ? 1 : 0);
|
||||
_options.insert("ssn", ssn_option);
|
||||
|
||||
if (!_options_index.empty())
|
||||
_options_index.clear();
|
||||
_options_index.insert("cpol", spi_ui->cpol_comboBox->currentIndex());
|
||||
_options_index.insert("cpha", spi_ui->cpha_comboBox->currentIndex());
|
||||
_options_index.insert("bits", spi_ui->bits_comboBox->currentIndex());
|
||||
_options_index.insert("order", spi_ui->order_comboBox->currentIndex());
|
||||
_options_index.insert("ssn", spi_ui->ssn_comboBox->currentIndex());
|
||||
} else if (_protocol == Serial) {
|
||||
if (!_sel_probes.empty())
|
||||
_sel_probes.clear();
|
||||
_sel_probes.push_back(serial_ui->serial_comboBox->currentIndex());
|
||||
|
||||
if (!_options.empty())
|
||||
_options.clear();
|
||||
_options.insert("baudrate", (serial_ui->baud_checkBox->checkState() == Qt::Checked) ? 0 : serial_ui->baud_comboBox->currentText().toULongLong());
|
||||
_options.insert("stopbits", serial_ui->stopbits_comboBox->currentText().toFloat());
|
||||
_options.insert("parity", serial_ui->parity_comboBox->currentText().contains("even", Qt::CaseInsensitive) ? 0 :
|
||||
serial_ui->parity_comboBox->currentText().contains("odd", Qt::CaseInsensitive) ? 1 : -1);
|
||||
_options.insert("order", serial_ui->order_comboBox->currentText().contains("LSB", Qt::CaseInsensitive) ? 1 : 0);
|
||||
_options.insert("bits", serial_ui->bits_comboBox->currentText().toUInt());
|
||||
_options.insert("idle", serial_ui->idle_comboBox->currentText().contains("Low", Qt::CaseInsensitive) ? 0 : 1);
|
||||
|
||||
if (!_options_index.empty())
|
||||
_options_index.clear();
|
||||
_options_index.insert("baudrate", (serial_ui->baud_checkBox->checkState() == Qt::Checked) ? -1 : serial_ui->baud_comboBox->currentIndex());
|
||||
_options_index.insert("stopbits", serial_ui->stopbits_comboBox->currentIndex());
|
||||
_options_index.insert("parity", serial_ui->parity_comboBox->currentIndex());
|
||||
_options_index.insert("order", serial_ui->order_comboBox->currentIndex());
|
||||
_options_index.insert("bits", serial_ui->bits_comboBox->currentIndex());
|
||||
_options_index.insert("idle", serial_ui->idle_comboBox->currentIndex());
|
||||
} else if (_protocol == Dmx512) {
|
||||
if (!_sel_probes.empty())
|
||||
_sel_probes.clear();
|
||||
_sel_probes.push_back(dmx512_ui->probe_comboBox->currentIndex());
|
||||
} else if (_protocol == Wire1) {
|
||||
if (!_sel_probes.empty())
|
||||
_sel_probes.clear();
|
||||
_sel_probes.push_back(wire1_ui->probe_comboBox->currentIndex());
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
void DemoConfig::set_config(std::list <int > sel_probes, QMap<QString, int> options_index)
|
||||
{
|
||||
if (_protocol == I2C) {
|
||||
i2c_ui->scl_comboBox->setCurrentIndex(sel_probes.front());
|
||||
i2c_ui->sda_comboBox->setCurrentIndex(sel_probes.back());
|
||||
} else if (_protocol == SPI) {
|
||||
spi_ui->ssn_comboBox->setCurrentIndex(sel_probes.front());sel_probes.pop_front();
|
||||
spi_ui->sclk_comboBox->setCurrentIndex(sel_probes.front());sel_probes.pop_front();
|
||||
spi_ui->mosi_comboBox->setCurrentIndex(sel_probes.front());sel_probes.pop_front();
|
||||
spi_ui->miso_comboBox->setCurrentIndex(sel_probes.front());sel_probes.pop_front();
|
||||
|
||||
spi_ui->cpol_comboBox->setCurrentIndex(options_index.value("cpol"));
|
||||
spi_ui->cpha_comboBox->setCurrentIndex(options_index.value("cpha"));
|
||||
spi_ui->bits_comboBox->setCurrentIndex(options_index.value("bits"));
|
||||
spi_ui->order_comboBox->setCurrentIndex(options_index.value("order"));
|
||||
spi_ui->ssn_comboBox->setCurrentIndex(options_index.value("ssn"));
|
||||
|
||||
} else if (_protocol == Serial) {
|
||||
serial_ui->serial_comboBox->setCurrentIndex(sel_probes.front());
|
||||
|
||||
if (options_index.value("baudrate") == -1)
|
||||
serial_ui->baud_checkBox->setChecked(true);
|
||||
else
|
||||
serial_ui->baud_comboBox->setCurrentIndex(options_index.value("baudrate"));
|
||||
serial_ui->stopbits_comboBox->setCurrentIndex(options_index.value("stopbits"));
|
||||
serial_ui->parity_comboBox->setCurrentIndex(options_index.value("parity"));
|
||||
serial_ui->order_comboBox->setCurrentIndex(options_index.value("order"));
|
||||
serial_ui->bits_comboBox->setCurrentIndex(options_index.value("bits"));
|
||||
serial_ui->idle_comboBox->setCurrentIndex(options_index.value("idle"));
|
||||
} else if (_protocol == Dmx512) {
|
||||
dmx512_ui->probe_comboBox->setCurrentIndex(sel_probes.front());
|
||||
} else if (_protocol == Wire1) {
|
||||
wire1_ui->probe_comboBox->setCurrentIndex(sel_probes.front());
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
std::list<int> DemoConfig::get_sel_probes()
|
||||
{
|
||||
return _sel_probes;
|
||||
}
|
||||
|
||||
QMap<QString, QVariant> &DemoConfig::get_options()
|
||||
{
|
||||
return _options;
|
||||
}
|
||||
|
||||
QMap<QString, int> DemoConfig::get_options_index()
|
||||
{
|
||||
return _options_index;
|
||||
}
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
91
DSLogic-gui/pv/decoder/democonfig.h
Normal file
91
DSLogic-gui/pv/decoder/democonfig.h
Normal file
@@ -0,0 +1,91 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DEMOCONFIG_H
|
||||
#define DSLOGIC_PV_DEMOCONFIG_H
|
||||
|
||||
#include <QDialog>
|
||||
#include <QMap>
|
||||
#include <QVariant>
|
||||
|
||||
#include "../sigsession.h"
|
||||
|
||||
#include <libsigrok4DSLogic/libsigrok.h>
|
||||
|
||||
#include <vector>
|
||||
|
||||
namespace Ui {
|
||||
class I2cConfig;
|
||||
class SpiConfig;
|
||||
class SerialConfig;
|
||||
class Dmx512Config;
|
||||
class Wire1Config;
|
||||
}
|
||||
|
||||
namespace pv {
|
||||
namespace decoder {
|
||||
|
||||
class DemoConfig : public QDialog
|
||||
{
|
||||
Q_OBJECT
|
||||
|
||||
public:
|
||||
|
||||
DemoConfig(QWidget *parent = 0, sr_dev_inst *sdi = 0, int protocol = 0);
|
||||
virtual ~DemoConfig();
|
||||
|
||||
void set_config(std::list <int > sel_probes, QMap<QString, int> options_index);
|
||||
|
||||
std::list<int> get_sel_probes();
|
||||
|
||||
QMap <QString, QVariant>& get_options();
|
||||
|
||||
QMap <QString, int> get_options_index();
|
||||
|
||||
protected:
|
||||
void accept();
|
||||
|
||||
signals:
|
||||
|
||||
public slots:
|
||||
|
||||
private:
|
||||
sr_dev_inst *_sdi;
|
||||
|
||||
int _protocol;
|
||||
|
||||
std::list <int > _sel_probes;
|
||||
QMap <QString, QVariant> _options;
|
||||
QMap <QString, int> _options_index;
|
||||
|
||||
Ui::I2cConfig *i2c_ui;
|
||||
Ui::SpiConfig *spi_ui;
|
||||
Ui::SerialConfig *serial_ui;
|
||||
Ui::Dmx512Config *dmx512_ui;
|
||||
Ui::Wire1Config *wire1_ui;
|
||||
};
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DEMOCONFIG_H
|
||||
103
DSLogic-gui/pv/decoder/dmx512config.ui
Normal file
103
DSLogic-gui/pv/decoder/dmx512config.ui
Normal file
@@ -0,0 +1,103 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<ui version="4.0">
|
||||
<class>Dmx512Config</class>
|
||||
<widget class="QDialog" name="Dmx512Config">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>0</x>
|
||||
<y>0</y>
|
||||
<width>360</width>
|
||||
<height>150</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="minimumSize">
|
||||
<size>
|
||||
<width>360</width>
|
||||
<height>150</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="maximumSize">
|
||||
<size>
|
||||
<width>360</width>
|
||||
<height>150</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="windowTitle">
|
||||
<string>Dialog</string>
|
||||
</property>
|
||||
<widget class="QDialogButtonBox" name="buttonBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>10</x>
|
||||
<y>100</y>
|
||||
<width>341</width>
|
||||
<height>32</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="orientation">
|
||||
<enum>Qt::Horizontal</enum>
|
||||
</property>
|
||||
<property name="standardButtons">
|
||||
<set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
|
||||
</property>
|
||||
</widget>
|
||||
<widget class="QComboBox" name="probe_comboBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>130</x>
|
||||
<y>40</y>
|
||||
<width>141</width>
|
||||
<height>20</height>
|
||||
</rect>
|
||||
</property>
|
||||
</widget>
|
||||
<widget class="QLabel" name="label">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>21</x>
|
||||
<y>40</y>
|
||||
<width>84</width>
|
||||
<height>16</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="text">
|
||||
<string>Data Signal</string>
|
||||
</property>
|
||||
</widget>
|
||||
</widget>
|
||||
<resources/>
|
||||
<connections>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>accepted()</signal>
|
||||
<receiver>Dmx512Config</receiver>
|
||||
<slot>accept()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>248</x>
|
||||
<y>254</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>157</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>rejected()</signal>
|
||||
<receiver>Dmx512Config</receiver>
|
||||
<slot>reject()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>316</x>
|
||||
<y>260</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>286</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
</connections>
|
||||
</ui>
|
||||
455
DSLogic-gui/pv/decoder/ds1wire.cpp
Normal file
455
DSLogic-gui/pv/decoder/ds1wire.cpp
Normal file
@@ -0,0 +1,455 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "ds1wire.h"
|
||||
|
||||
#include <math.h>
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace decoder {
|
||||
|
||||
const QColor ds1Wire::ColorTable[TableSize] = {
|
||||
QColor(255, 255, 255, 150),
|
||||
QColor(0, 255, 0, 150),
|
||||
QColor(255, 0, 0, 150),
|
||||
QColor(0, 255, 0, 150),
|
||||
QColor(255, 0, 0, 150),
|
||||
QColor(0, 0, 255, 150),
|
||||
QColor(0, 0, 255, 150),
|
||||
QColor(0, 255, 255, 150),
|
||||
};
|
||||
|
||||
const QString ds1Wire::StateTable[TableSize] = {
|
||||
"UNKNOWN",
|
||||
"RESET",
|
||||
"PRESENCE",
|
||||
"COMMAND",
|
||||
"FAMILY CODE",
|
||||
"SERIAL NUMBER",
|
||||
"CRC",
|
||||
"DATA"
|
||||
};
|
||||
|
||||
ds1Wire::ds1Wire(shared_ptr<data::Logic> data, std::list <int > _sel_probes, QMap<QString, QVariant> &_options, QMap<QString, int> _options_index) :
|
||||
Decoder(data, _sel_probes, _options_index)
|
||||
{
|
||||
(void)_options;
|
||||
|
||||
assert(_sel_probes.size() == 1);
|
||||
|
||||
_wire_index = _sel_probes.front();
|
||||
}
|
||||
|
||||
ds1Wire::~ds1Wire()
|
||||
{
|
||||
}
|
||||
|
||||
QString ds1Wire::get_decode_name()
|
||||
{
|
||||
return "1-Wire";
|
||||
}
|
||||
|
||||
void ds1Wire::recode(std::list <int > _sel_probes, QMap <QString, QVariant>& _options, QMap<QString, int> _options_index)
|
||||
{
|
||||
(void)_options;
|
||||
|
||||
assert(_sel_probes.size() == 1);
|
||||
_wire_index = _sel_probes.front();
|
||||
|
||||
this->_sel_probes = _sel_probes;
|
||||
this->_options_index = _options_index;
|
||||
|
||||
decode();
|
||||
}
|
||||
|
||||
void ds1Wire::decode()
|
||||
{
|
||||
assert(_data);
|
||||
_max_width = 0;
|
||||
uint8_t cur_state = Unknown;
|
||||
|
||||
const deque< shared_ptr<pv::data::LogicSnapshot> > &snapshots =
|
||||
_data->get_snapshots();
|
||||
if (snapshots.empty())
|
||||
return;
|
||||
|
||||
const shared_ptr<pv::data::LogicSnapshot> &snapshot =
|
||||
snapshots.front();
|
||||
|
||||
uint64_t flag_index1;
|
||||
uint64_t flag_index2;
|
||||
uint64_t flag_index3;
|
||||
uint64_t flag_index4;
|
||||
//uint64_t start_index;
|
||||
//uint64_t stop_index;
|
||||
//bool edge1;
|
||||
//bool edge2;
|
||||
uint64_t left = 0;
|
||||
uint64_t right = snapshot->get_sample_count() - 1;
|
||||
const uint64_t samplerate = _data->get_samplerate();
|
||||
double pulse_width1;
|
||||
double pulse_width2;
|
||||
double pulse_width3;
|
||||
double pulse_width4;
|
||||
|
||||
uint8_t data;
|
||||
bool valid = false;
|
||||
|
||||
if (!_state_index.empty())
|
||||
_state_index.clear();
|
||||
|
||||
while(left < right && pulse_width1 != 0) // Regular Speed
|
||||
{
|
||||
// search reset flag
|
||||
pulse_width1 = get_next_pulse_width(0, samplerate, left, right, snapshot);
|
||||
flag_index1 = left;
|
||||
if (pulse_width1 >= 0.48 && pulse_width1 <= 0.96) { // tRSTL
|
||||
pulse_width2 = get_next_pulse_width(1, samplerate, left, right, snapshot);
|
||||
flag_index2 = left;
|
||||
if (pulse_width2 >= 0.015 && pulse_width2 <= 0.06) { // tPDH
|
||||
pulse_width3 = get_next_pulse_width(0, samplerate, left, right, snapshot);
|
||||
flag_index3 = left;
|
||||
if (pulse_width3 >= 0.06 && pulse_width3 <= 0.24) { // tPDL
|
||||
pulse_width4 = get_next_pulse_width(1, samplerate, left, right, snapshot);
|
||||
flag_index4 = left;
|
||||
if (pulse_width2 + pulse_width3 + pulse_width4 >= 0.48) {
|
||||
cur_state = Reset;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(flag_index1, flag_index2 - flag_index1), std::make_pair(cur_state, 0)));
|
||||
cur_state = Presence;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(flag_index3, flag_index4 - flag_index3), std::make_pair(cur_state, 0)));
|
||||
} else {
|
||||
continue;
|
||||
}
|
||||
} else {
|
||||
continue;
|
||||
}
|
||||
} else {
|
||||
continue;
|
||||
}
|
||||
} else {
|
||||
continue;
|
||||
}
|
||||
|
||||
uint64_t start;
|
||||
uint64_t end;
|
||||
int i;
|
||||
if (cur_state == Presence) {
|
||||
data = get_next_data(false, valid, start, end, samplerate, left, right, snapshot);
|
||||
if (valid) {
|
||||
cur_state = Command;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start, end - start), std::make_pair(cur_state, data)));
|
||||
}else {
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
if (cur_state == Command) {
|
||||
data = get_next_data(false, valid, start, end, samplerate, left, right, snapshot);
|
||||
if (valid) {
|
||||
cur_state = Family;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start, end - start), std::make_pair(cur_state, data)));
|
||||
} else {
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
if (cur_state == Family) {
|
||||
for (i = 0; i < 6; i++) {
|
||||
data = get_next_data(false, valid, start, end, samplerate, left, right, snapshot);
|
||||
if (valid) {
|
||||
cur_state = Serial;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start, end - start), std::make_pair(cur_state, data)));
|
||||
} else {
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (i != 6)
|
||||
continue;
|
||||
}
|
||||
|
||||
if (cur_state == Serial) {
|
||||
data = get_next_data(false, valid, start, end, samplerate, left, right, snapshot);
|
||||
if (valid) {
|
||||
cur_state = Crc;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start, end - start), std::make_pair(cur_state, data)));
|
||||
} else {
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
if (cur_state == Crc) {
|
||||
while (1) {
|
||||
data = get_next_data(false, valid, start, end, samplerate, left, right, snapshot);
|
||||
if (valid) {
|
||||
cur_state = Data;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start, end - start), std::make_pair(cur_state, data)));
|
||||
} else {
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// if (cur_state == Unknown) {
|
||||
// while(1) { // Overdrive Speed
|
||||
|
||||
// }
|
||||
// }
|
||||
}
|
||||
|
||||
double ds1Wire::get_next_pulse_width(bool level, uint64_t samplerate, uint64_t &left, uint64_t right,
|
||||
const boost::shared_ptr<data::LogicSnapshot> &snapshot)
|
||||
{
|
||||
double pulse_width = 0;
|
||||
uint64_t flag_index1;
|
||||
uint64_t flag_index2;
|
||||
bool edge1;
|
||||
bool edge2;
|
||||
|
||||
if (snapshot->get_first_edge(flag_index1, edge1, left, right, _wire_index, level, _wire_index, -1) == SR_OK) {
|
||||
left = flag_index1;
|
||||
if (snapshot->get_first_edge(flag_index2, edge2, left, right, _wire_index, !level, _wire_index, -1) == SR_OK) {
|
||||
pulse_width = (flag_index2 - flag_index1) * 1000.0f / samplerate;
|
||||
}
|
||||
}
|
||||
|
||||
return pulse_width;
|
||||
}
|
||||
|
||||
uint8_t ds1Wire::get_next_data(bool speed, bool &valid, uint64_t &start, uint64_t &end,
|
||||
uint64_t samplerate, uint64_t &left, uint64_t right,
|
||||
const boost::shared_ptr<data::LogicSnapshot> &snapshot)
|
||||
{
|
||||
uint8_t data = 0;
|
||||
double pulse_width1;
|
||||
uint64_t org_left = left;
|
||||
int i;
|
||||
|
||||
valid = true;
|
||||
if (speed == false) {
|
||||
for (i = 0; i < 8; i++) {
|
||||
pulse_width1 = get_next_pulse_width(0, samplerate, left, right, snapshot);
|
||||
start = (i == 0) ? left : start;
|
||||
end = (i == 7) ? left + samplerate * 0.001 * 0.06 : end;
|
||||
if (pulse_width1 >= 0.001 && pulse_width1 < 0.015) {
|
||||
pulse_width1 = get_next_pulse_width(1, samplerate, left, right, snapshot);
|
||||
if (pulse_width1 >= 0.046) {
|
||||
data = data + (1 << i);
|
||||
org_left = left;
|
||||
} else {
|
||||
left = org_left;
|
||||
valid = false;
|
||||
break;
|
||||
}
|
||||
} else if (pulse_width1 >= 0.06 && pulse_width1 < 0.12) {
|
||||
pulse_width1 = get_next_pulse_width(1, samplerate, left, right, snapshot);
|
||||
if (pulse_width1 >= 0.001) {
|
||||
org_left = left;
|
||||
//data = data << 1;
|
||||
} else {
|
||||
left = org_left;
|
||||
valid = false;
|
||||
break;
|
||||
}
|
||||
} else {
|
||||
left = org_left;
|
||||
valid = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
for (i = 0; i < 8; i++) {
|
||||
pulse_width1 = get_next_pulse_width(0, samplerate, left, right, snapshot);
|
||||
start = (i == 0) ? left : start;
|
||||
end = (i == 7) ? left + samplerate * 0.001 * 0.006 : end;
|
||||
if (pulse_width1 >= 0.001 && pulse_width1 < 0.002) {
|
||||
pulse_width1 = get_next_pulse_width(1, samplerate, left, right, snapshot);
|
||||
if (pulse_width1 >= 0.006) {
|
||||
org_left = left;
|
||||
data = data + (1 << i);
|
||||
} else {
|
||||
left = org_left;
|
||||
valid = false;
|
||||
break;
|
||||
}
|
||||
} else if (pulse_width1 >= 0.006 && pulse_width1 < 0.016) {
|
||||
pulse_width1 = get_next_pulse_width(1, samplerate, left, right, snapshot);
|
||||
if (pulse_width1 >= 0.001) {
|
||||
org_left = left;
|
||||
//data = data << 1;
|
||||
} else {
|
||||
left = org_left;
|
||||
valid = false;
|
||||
break;
|
||||
}
|
||||
} else {
|
||||
left = org_left;
|
||||
valid = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return data;
|
||||
}
|
||||
|
||||
void ds1Wire::fill_color_table(std::vector <QColor>& _color_table)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < TableSize; i++)
|
||||
_color_table.push_back(ColorTable[i]);
|
||||
}
|
||||
|
||||
void ds1Wire::fill_state_table(std::vector <QString>& _state_table)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < TableSize; i++)
|
||||
_state_table.push_back(StateTable[i]);
|
||||
}
|
||||
|
||||
void ds1Wire::get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length)
|
||||
{
|
||||
ds_view_state view_state;
|
||||
|
||||
const deque< shared_ptr<pv::data::LogicSnapshot> > &snapshots =
|
||||
_data->get_snapshots();
|
||||
if (snapshots.empty())
|
||||
return;
|
||||
const shared_ptr<pv::data::LogicSnapshot> &snapshot =
|
||||
snapshots.front();
|
||||
|
||||
assert(end <= snapshot->get_sample_count());
|
||||
assert(start <= end);
|
||||
assert(min_length > 0);
|
||||
|
||||
if (!states.empty())
|
||||
states.clear();
|
||||
|
||||
if (_state_index.empty())
|
||||
return;
|
||||
if (start > _state_index.at(_state_index.size() - 1).first.first)
|
||||
return;
|
||||
if (end < _state_index.at(0).first.first)
|
||||
return;
|
||||
|
||||
if (min_length * _view_scale > _max_width) {
|
||||
view_state.index = _state_index.at(0).first.first;
|
||||
view_state.samples = _state_index.at(_state_index.size() - 1).first.first +
|
||||
_state_index.at(_state_index.size() - 1).first.second - _state_index.at(0).first.first;
|
||||
view_state.type = DEC_NODETAIL;
|
||||
view_state.state = 0;
|
||||
view_state.data = 0;
|
||||
states.push_back(view_state);
|
||||
return;
|
||||
}
|
||||
|
||||
uint64_t view_start = 0;
|
||||
uint64_t view_end = 0;
|
||||
uint64_t minIndex = 0;
|
||||
uint64_t maxIndex = _state_index.size() - 1;
|
||||
uint64_t i = start * 1.0f / snapshot->get_sample_count() * maxIndex;
|
||||
bool check_flag = false;
|
||||
int times = 0;
|
||||
while(times <= 32) {
|
||||
if (_state_index.at(i).first.first + _state_index.at(i).first.second >= start) {
|
||||
check_flag = true;
|
||||
} else {
|
||||
minIndex = i;
|
||||
i = ceil((i + maxIndex) / 2.0f);
|
||||
}
|
||||
|
||||
if (check_flag) {
|
||||
if (i == 0) {
|
||||
view_start = i;
|
||||
break;
|
||||
} else if (_state_index.at(i-1).first.first + _state_index.at(i-1).first.second < start) {
|
||||
view_start = i;
|
||||
break;
|
||||
} else {
|
||||
maxIndex = i;
|
||||
i = (i + minIndex) / 2;
|
||||
}
|
||||
check_flag = false;
|
||||
}
|
||||
times++;
|
||||
}
|
||||
i = view_start;
|
||||
check_flag = false;
|
||||
times = 0;
|
||||
minIndex = view_start;
|
||||
//maxIndex = _state_index.size() - 1;
|
||||
maxIndex = min(_state_index.size() - 1, (size_t)end);
|
||||
view_end = view_start;
|
||||
while(times <= 32) {
|
||||
if (_state_index.at(i).first.first <= end) {
|
||||
check_flag = true;
|
||||
} else {
|
||||
maxIndex = i;
|
||||
i = (i + minIndex) / 2;
|
||||
}
|
||||
|
||||
if (check_flag) {
|
||||
if (i == maxIndex) {
|
||||
view_end = i;
|
||||
break;
|
||||
} else if (_state_index.at(i+1).first.first > end) {
|
||||
view_end = i;
|
||||
break;
|
||||
} else {
|
||||
minIndex = i;
|
||||
i = ceil((i + maxIndex) / 2.0f);
|
||||
}
|
||||
check_flag = false;
|
||||
}
|
||||
times++;
|
||||
}
|
||||
|
||||
assert(view_end >= view_start);
|
||||
|
||||
for (uint64_t i = view_start; i <= view_end; i++) {
|
||||
if (_state_index.at(i).first.second >= min_length * _view_scale) {
|
||||
view_state.index = _state_index.at(i).first.first;
|
||||
view_state.samples = _state_index.at(i).first.second;
|
||||
view_state.type = (_state_index.at(i).second.first == Reset ||
|
||||
_state_index.at(i).second.first == Presence) ? DEC_CMD : DEC_DATA;
|
||||
view_state.state = _state_index.at(i).second.first;
|
||||
view_state.data = _state_index.at(i).second.second;
|
||||
states.push_back(view_state);
|
||||
} else {
|
||||
view_state.index = _state_index.at(i).first.first;
|
||||
view_state.samples = _state_index.at(i).first.second;
|
||||
view_state.type = DEC_NODETAIL;
|
||||
view_state.state = 0;
|
||||
view_state.data = 0;
|
||||
states.push_back(view_state);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
91
DSLogic-gui/pv/decoder/ds1wire.h
Normal file
91
DSLogic-gui/pv/decoder/ds1wire.h
Normal file
@@ -0,0 +1,91 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DS1WIRE_H
|
||||
#define DSLOGIC_PV_DS1WIRE_H
|
||||
|
||||
#include "decoder.h"
|
||||
#include "../data/logic.h"
|
||||
#include "../data/logicsnapshot.h"
|
||||
|
||||
#include <boost/shared_ptr.hpp>
|
||||
|
||||
namespace pv {
|
||||
|
||||
namespace data {
|
||||
class LogicSnapshot;
|
||||
}
|
||||
|
||||
namespace decoder {
|
||||
|
||||
class ds1Wire : public Decoder
|
||||
{
|
||||
private:
|
||||
static const int TableSize = 8;
|
||||
static const QColor ColorTable[TableSize];
|
||||
static const QString StateTable[TableSize];
|
||||
|
||||
enum {Unknown = 0, Reset, Presence, Command, Family, Serial, Crc, Data};
|
||||
|
||||
private:
|
||||
|
||||
double get_next_pulse_width(bool level,
|
||||
uint64_t samplerate, uint64_t &left, uint64_t right,
|
||||
const boost::shared_ptr<data::LogicSnapshot> &snapshot);
|
||||
|
||||
uint8_t get_next_data(bool speed, bool &valid, uint64_t &start, uint64_t &end,
|
||||
uint64_t samplerate, uint64_t &left, uint64_t right,
|
||||
const boost::shared_ptr<data::LogicSnapshot> &snapshot);
|
||||
|
||||
public:
|
||||
ds1Wire(boost::shared_ptr<pv::data::Logic> data,
|
||||
std::list<int> _sel_probes, QMap<QString, QVariant> &_options, QMap<QString, int> _options_index);
|
||||
|
||||
virtual ~ds1Wire();
|
||||
|
||||
QString get_decode_name();
|
||||
|
||||
void recode(std::list <int > _sel_probes, QMap <QString, QVariant>& _options, QMap <QString, int> _options_index);
|
||||
|
||||
void decode();
|
||||
|
||||
void fill_color_table(std::vector <QColor>& _color_table);
|
||||
|
||||
void fill_state_table(std::vector <QString>& _state_table);
|
||||
|
||||
void get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length);
|
||||
|
||||
private:
|
||||
|
||||
int _wire_index;
|
||||
uint64_t _max_width;
|
||||
std::vector< pv::data::LogicSnapshot::EdgePair > _cur_edges;
|
||||
std::vector< std::pair<std::pair<uint64_t, uint64_t>, std::pair<uint8_t, uint8_t> > > _state_index;
|
||||
};
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DS1WIRE_H
|
||||
380
DSLogic-gui/pv/decoder/dsdmx512.cpp
Normal file
380
DSLogic-gui/pv/decoder/dsdmx512.cpp
Normal file
@@ -0,0 +1,380 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "dsdmx512.h"
|
||||
|
||||
#include <math.h>
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace decoder {
|
||||
|
||||
const QColor dsDmx512::ColorTable[TableSize] = {
|
||||
QColor(255, 255, 255, 150),
|
||||
QColor(0, 255, 0, 150),
|
||||
QColor(255, 0, 0, 150),
|
||||
QColor(0, 255, 0, 150),
|
||||
QColor(255, 0, 0, 150),
|
||||
QColor(0, 0, 255, 150),
|
||||
QColor(0, 0, 255, 150),
|
||||
QColor(0, 255, 255, 150),
|
||||
};
|
||||
|
||||
const QString dsDmx512::StateTable[TableSize] = {
|
||||
"UNKNOWN",
|
||||
"BREAK",
|
||||
"MAB",
|
||||
"START",
|
||||
"START CODE",
|
||||
"STOP",
|
||||
"MARK",
|
||||
"SLOT"
|
||||
};
|
||||
|
||||
dsDmx512::dsDmx512(shared_ptr<data::Logic> data, std::list <int > _sel_probes, QMap<QString, QVariant> &_options, QMap<QString, int> _options_index) :
|
||||
Decoder(data, _sel_probes, _options_index)
|
||||
{
|
||||
(void)_options;
|
||||
|
||||
assert(_sel_probes.size() == 1);
|
||||
|
||||
_dmx_index = _sel_probes.front();
|
||||
}
|
||||
|
||||
dsDmx512::~dsDmx512()
|
||||
{
|
||||
}
|
||||
|
||||
QString dsDmx512::get_decode_name()
|
||||
{
|
||||
return "DMX512";
|
||||
}
|
||||
|
||||
void dsDmx512::recode(std::list <int > _sel_probes, QMap <QString, QVariant>& _options, QMap<QString, int> _options_index)
|
||||
{
|
||||
(void)_options;
|
||||
|
||||
assert(_sel_probes.size() == 1);
|
||||
_dmx_index = _sel_probes.front();
|
||||
|
||||
this->_sel_probes = _sel_probes;
|
||||
this->_options_index = _options_index;
|
||||
|
||||
decode();
|
||||
}
|
||||
|
||||
void dsDmx512::decode()
|
||||
{
|
||||
assert(_data);
|
||||
_max_width = 0;
|
||||
uint8_t cur_state = Unknown;
|
||||
|
||||
const deque< shared_ptr<pv::data::LogicSnapshot> > &snapshots =
|
||||
_data->get_snapshots();
|
||||
if (snapshots.empty())
|
||||
return;
|
||||
|
||||
const shared_ptr<pv::data::LogicSnapshot> &snapshot =
|
||||
snapshots.front();
|
||||
|
||||
//uint64_t flag_index;
|
||||
uint64_t start_index;
|
||||
uint64_t stop_index;
|
||||
//bool edge;
|
||||
uint64_t left = 0;
|
||||
uint64_t right = snapshot->get_sample_count() - 1;
|
||||
const uint64_t samplerate = _data->get_samplerate();
|
||||
double pulse_width;
|
||||
bool valid;
|
||||
|
||||
if (!_state_index.empty())
|
||||
_state_index.clear();
|
||||
|
||||
while(1)
|
||||
{
|
||||
// search Break flag
|
||||
|
||||
pulse_width = get_next_pulse_width(0, samplerate, left, right, stop_index, snapshot);
|
||||
start_index = left;
|
||||
if (pulse_width >= 0.088 && pulse_width <= 1000) { // Break
|
||||
cur_state = Break;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start_index, stop_index - start_index), std::make_pair(cur_state, 0)));
|
||||
_max_width = max(_max_width, stop_index - start_index);
|
||||
} else if (pulse_width == 0){
|
||||
break;
|
||||
} else {
|
||||
continue;
|
||||
}
|
||||
|
||||
if (cur_state == Break) {
|
||||
pulse_width = get_next_pulse_width(1, samplerate, left, right, stop_index, snapshot);
|
||||
start_index = left;
|
||||
if (pulse_width >= 0.012 && pulse_width <= 1000) { // Marker After Break
|
||||
cur_state = Mab;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start_index, stop_index - start_index), std::make_pair(cur_state, 0)));
|
||||
_max_width = max(_max_width, stop_index - start_index);
|
||||
} else {
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
if (cur_state == Mab) {
|
||||
get_next_data(true, valid, cur_state, samplerate, left, right, snapshot);
|
||||
}
|
||||
|
||||
while(valid)
|
||||
get_next_data(false, valid, cur_state, samplerate, left, right, snapshot);
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
double dsDmx512::get_next_pulse_width(bool level, uint64_t samplerate, uint64_t &left, uint64_t right, uint64_t &end,
|
||||
const boost::shared_ptr<data::LogicSnapshot> &snapshot)
|
||||
{
|
||||
double pulse_width = 0;
|
||||
uint64_t flag_index1;
|
||||
uint64_t flag_index2;
|
||||
bool edge1;
|
||||
bool edge2;
|
||||
|
||||
if (snapshot->get_first_edge(flag_index1, edge1, left, right, _dmx_index, level, _dmx_index, -1) == SR_OK) {
|
||||
left = flag_index1;
|
||||
if (snapshot->get_first_edge(flag_index2, edge2, left, right, _dmx_index, !level, _dmx_index, -1) == SR_OK) {
|
||||
end = flag_index2;
|
||||
pulse_width = (flag_index2 - flag_index1) * 1000.0f / samplerate;
|
||||
}
|
||||
}
|
||||
|
||||
return pulse_width;
|
||||
}
|
||||
|
||||
uint8_t dsDmx512::get_next_data(bool code, bool &valid, uint8_t &cur_state,
|
||||
uint64_t samplerate, uint64_t &left, uint64_t right,
|
||||
const boost::shared_ptr<data::LogicSnapshot> &snapshot)
|
||||
{
|
||||
uint8_t data = 0;
|
||||
double pulse_width;
|
||||
uint64_t org_left = left;
|
||||
//int i;
|
||||
uint64_t samplesPerBit = ceil(samplerate * 0.001 * 0.004);
|
||||
const uint64_t dmx_mask = 1ULL << _dmx_index;
|
||||
bool edge;
|
||||
uint64_t start = left;
|
||||
uint64_t end = left;
|
||||
const uint8_t *src_ptr;
|
||||
const int unit_size = snapshot->get_unit_size();
|
||||
|
||||
valid = false;
|
||||
pulse_width = get_next_pulse_width(0, samplerate, left, right, end, snapshot);
|
||||
if (pulse_width >= 0.00392 && pulse_width <= 0.00408 * 9) { // Start bit
|
||||
org_left = left;
|
||||
start = left;
|
||||
end = start + samplesPerBit;
|
||||
cur_state = Start;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start, end - start), std::make_pair(cur_state, 0)));
|
||||
_max_width = max(_max_width, end - start);
|
||||
} else {
|
||||
left = org_left;
|
||||
return data;
|
||||
}
|
||||
|
||||
if (cur_state == Start) {
|
||||
src_ptr = (uint8_t*)snapshot->get_data();
|
||||
start = end;
|
||||
data = data + (((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * 0.5) * unit_size) & dmx_mask) != 0) << 0);
|
||||
data = data + (((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * 1.5) * unit_size) & dmx_mask) != 0) << 1);
|
||||
data = data + (((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * 2.5) * unit_size) & dmx_mask) != 0) << 2);
|
||||
data = data + (((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * 3.5) * unit_size) & dmx_mask) != 0) << 3);
|
||||
data = data + (((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * 4.5) * unit_size) & dmx_mask) != 0) << 4);
|
||||
data = data + (((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * 5.5) * unit_size) & dmx_mask) != 0) << 5);
|
||||
data = data + (((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * 6.5) * unit_size) & dmx_mask) != 0) << 6);
|
||||
data = data + (((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * 7.5) * unit_size) & dmx_mask) != 0) << 7);
|
||||
end = start + samplesPerBit * 8;
|
||||
cur_state = code ? Scode : Slot;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start, end - start), std::make_pair(cur_state, data)));
|
||||
_max_width = max(_max_width, end - start);
|
||||
}
|
||||
|
||||
org_left = end;
|
||||
left = start + samplesPerBit * 8.5;
|
||||
if ((*(uint64_t*)(src_ptr + left * unit_size) & dmx_mask) != 0) {
|
||||
if (snapshot->get_first_edge(end, edge, left, right, _dmx_index, 0, _dmx_index, -1) == SR_OK) {
|
||||
pulse_width = (end - org_left) * 1000.0f / samplerate;
|
||||
if (pulse_width >= 0.008 && pulse_width <= 1000) {
|
||||
start = org_left;
|
||||
end = start + samplesPerBit * 2;
|
||||
cur_state = Stop;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start, end - start), std::make_pair(cur_state, 0)));
|
||||
_max_width = max(_max_width, end - start);
|
||||
}
|
||||
} else {
|
||||
left = org_left;
|
||||
return data;
|
||||
}
|
||||
} else {
|
||||
return data;
|
||||
}
|
||||
|
||||
valid = true;
|
||||
return data;
|
||||
}
|
||||
|
||||
void dsDmx512::fill_color_table(std::vector <QColor>& _color_table)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < TableSize; i++)
|
||||
_color_table.push_back(ColorTable[i]);
|
||||
}
|
||||
|
||||
void dsDmx512::fill_state_table(std::vector <QString>& _state_table)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < TableSize; i++)
|
||||
_state_table.push_back(StateTable[i]);
|
||||
}
|
||||
|
||||
void dsDmx512::get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length)
|
||||
{
|
||||
ds_view_state view_state;
|
||||
|
||||
const deque< shared_ptr<pv::data::LogicSnapshot> > &snapshots =
|
||||
_data->get_snapshots();
|
||||
if (snapshots.empty())
|
||||
return;
|
||||
const shared_ptr<pv::data::LogicSnapshot> &snapshot =
|
||||
snapshots.front();
|
||||
|
||||
assert(end <= snapshot->get_sample_count());
|
||||
assert(start <= end);
|
||||
assert(min_length > 0);
|
||||
|
||||
if (!states.empty())
|
||||
states.clear();
|
||||
|
||||
if (_state_index.empty())
|
||||
return;
|
||||
if (start > _state_index.at(_state_index.size() - 1).first.first)
|
||||
return;
|
||||
if (end < _state_index.at(0).first.first)
|
||||
return;
|
||||
|
||||
if (min_length * _view_scale > _max_width) {
|
||||
view_state.index = _state_index.at(0).first.first;
|
||||
view_state.samples = _state_index.at(_state_index.size() - 1).first.first +
|
||||
_state_index.at(_state_index.size() - 1).first.second - _state_index.at(0).first.first;
|
||||
view_state.type = DEC_NODETAIL;
|
||||
view_state.state = 0;
|
||||
view_state.data = 0;
|
||||
states.push_back(view_state);
|
||||
return;
|
||||
}
|
||||
|
||||
uint64_t view_start = 0;
|
||||
uint64_t view_end = 0;
|
||||
uint64_t minIndex = 0;
|
||||
uint64_t maxIndex = _state_index.size() - 1;
|
||||
uint64_t i = start * 1.0f / snapshot->get_sample_count() * maxIndex;
|
||||
bool check_flag = false;
|
||||
int times = 0;
|
||||
while(times <= 32) {
|
||||
if (_state_index.at(i).first.first + _state_index.at(i).first.second >= start) {
|
||||
check_flag = true;
|
||||
} else {
|
||||
minIndex = i;
|
||||
i = ceil((i + maxIndex) / 2.0f);
|
||||
}
|
||||
|
||||
if (check_flag) {
|
||||
if (i == 0) {
|
||||
view_start = i;
|
||||
break;
|
||||
} else if (_state_index.at(i-1).first.first + _state_index.at(i-1).first.second < start) {
|
||||
view_start = i;
|
||||
break;
|
||||
} else {
|
||||
maxIndex = i;
|
||||
i = (i + minIndex) / 2;
|
||||
}
|
||||
check_flag = false;
|
||||
}
|
||||
times++;
|
||||
}
|
||||
i = view_start;
|
||||
check_flag = false;
|
||||
times = 0;
|
||||
minIndex = view_start;
|
||||
//maxIndex = _state_index.size() - 1;
|
||||
maxIndex = min(_state_index.size() - 1, (size_t)end);
|
||||
view_end = view_start;
|
||||
while(times <= 32) {
|
||||
if (_state_index.at(i).first.first <= end) {
|
||||
check_flag = true;
|
||||
} else {
|
||||
maxIndex = i;
|
||||
i = (i + minIndex) / 2;
|
||||
}
|
||||
|
||||
if (check_flag) {
|
||||
if (i == maxIndex) {
|
||||
view_end = i;
|
||||
break;
|
||||
} else if (_state_index.at(i+1).first.first > end) {
|
||||
view_end = i;
|
||||
break;
|
||||
} else {
|
||||
minIndex = i;
|
||||
i = ceil((i + maxIndex) / 2.0f);
|
||||
}
|
||||
check_flag = false;
|
||||
}
|
||||
times++;
|
||||
}
|
||||
|
||||
assert(view_end >= view_start);
|
||||
|
||||
for (uint64_t i = view_start; i <= view_end; i++) {
|
||||
if (_state_index.at(i).first.second >= min_length * _view_scale) {
|
||||
view_state.index = _state_index.at(i).first.first;
|
||||
view_state.samples = _state_index.at(i).first.second;
|
||||
view_state.type = (_state_index.at(i).second.first == Slot) ? DEC_CNT :
|
||||
(_state_index.at(i).second.first == Scode) ? DEC_DATA : DEC_CMD;
|
||||
view_state.state = _state_index.at(i).second.first;
|
||||
view_state.data = _state_index.at(i).second.second;
|
||||
states.push_back(view_state);
|
||||
} else {
|
||||
view_state.index = _state_index.at(i).first.first;
|
||||
view_state.samples = _state_index.at(i).first.second;
|
||||
view_state.type = DEC_NODETAIL;
|
||||
view_state.state = 0;
|
||||
view_state.data = 0;
|
||||
states.push_back(view_state);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
89
DSLogic-gui/pv/decoder/dsdmx512.h
Normal file
89
DSLogic-gui/pv/decoder/dsdmx512.h
Normal file
@@ -0,0 +1,89 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DSDMX512_H
|
||||
#define DSLOGIC_PV_DSDMX512_H
|
||||
|
||||
#include "decoder.h"
|
||||
#include "../data/logic.h"
|
||||
#include "../data/logicsnapshot.h"
|
||||
|
||||
#include <boost/shared_ptr.hpp>
|
||||
|
||||
namespace pv {
|
||||
|
||||
namespace data {
|
||||
class LogicSnapshot;
|
||||
}
|
||||
|
||||
namespace decoder {
|
||||
|
||||
class dsDmx512 : public Decoder
|
||||
{
|
||||
private:
|
||||
static const int TableSize = 8;
|
||||
static const QColor ColorTable[TableSize];
|
||||
static const QString StateTable[TableSize];
|
||||
|
||||
enum {Unknown = 0, Break, Mab, Start, Scode, Stop, Mark, Slot};
|
||||
|
||||
private:
|
||||
double get_next_pulse_width(bool level,
|
||||
uint64_t samplerate, uint64_t &left, uint64_t right, uint64_t &end,
|
||||
const boost::shared_ptr<data::LogicSnapshot> &snapshot);
|
||||
|
||||
uint8_t get_next_data(bool code, bool &valid, uint8_t &cur_state,
|
||||
uint64_t samplerate, uint64_t &left, uint64_t right,
|
||||
const boost::shared_ptr<data::LogicSnapshot> &snapshot);
|
||||
|
||||
public:
|
||||
dsDmx512(boost::shared_ptr<pv::data::Logic> data,
|
||||
std::list<int> _sel_probes, QMap<QString, QVariant> &_options, QMap<QString, int> _options_index);
|
||||
|
||||
virtual ~dsDmx512();
|
||||
|
||||
QString get_decode_name();
|
||||
|
||||
void recode(std::list <int > _sel_probes, QMap <QString, QVariant>& _options, QMap <QString, int> _options_index);
|
||||
|
||||
void decode();
|
||||
|
||||
void fill_color_table(std::vector <QColor>& _color_table);
|
||||
|
||||
void fill_state_table(std::vector <QString>& _state_table);
|
||||
|
||||
void get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length);
|
||||
|
||||
private:
|
||||
|
||||
int _dmx_index;
|
||||
uint64_t _max_width;
|
||||
std::vector< std::pair<std::pair<uint64_t, uint64_t>, std::pair<uint8_t, uint8_t> > > _state_index;
|
||||
};
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DSDMX512_H
|
||||
366
DSLogic-gui/pv/decoder/dsi2c.cpp
Normal file
366
DSLogic-gui/pv/decoder/dsi2c.cpp
Normal file
@@ -0,0 +1,366 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
#include "dsi2c.h"
|
||||
|
||||
#include <math.h>
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace decoder {
|
||||
|
||||
const QColor dsI2c::ColorTable[TableSize] = {
|
||||
QColor(255, 255, 255, 150),
|
||||
QColor(0, 255, 0, 150),
|
||||
QColor(255, 0, 0, 150),
|
||||
QColor(0, 255, 0, 150),
|
||||
QColor(255, 0, 0, 150),
|
||||
QColor(0, 0, 255, 150),
|
||||
QColor(0, 0, 255, 150),
|
||||
QColor(0, 255, 255, 150),
|
||||
};
|
||||
|
||||
const QString dsI2c::StateTable[TableSize] = {
|
||||
"UNKNOWN",
|
||||
"START",
|
||||
"STOP",
|
||||
"ACK",
|
||||
"NAK",
|
||||
"READ @",
|
||||
"WRITE @",
|
||||
"DATA"
|
||||
};
|
||||
|
||||
dsI2c::dsI2c(shared_ptr<data::Logic> data, std::list <int > _sel_probes, QMap<QString, QVariant> &_options, QMap<QString, int> _options_index) :
|
||||
Decoder(data, _sel_probes, _options_index)
|
||||
{
|
||||
(void)_options;
|
||||
|
||||
assert(_sel_probes.size() == 2);
|
||||
|
||||
_scl_index = _sel_probes.front();
|
||||
_sda_index = _sel_probes.back();
|
||||
}
|
||||
|
||||
dsI2c::~dsI2c()
|
||||
{
|
||||
}
|
||||
|
||||
QString dsI2c::get_decode_name()
|
||||
{
|
||||
return "I2C";
|
||||
}
|
||||
|
||||
void dsI2c::recode(std::list <int > _sel_probes, QMap <QString, QVariant>& _options, QMap <QString, int> _options_index)
|
||||
{
|
||||
(void)_options;
|
||||
|
||||
assert(_sel_probes.size() == 2);
|
||||
_scl_index = _sel_probes.front();
|
||||
_sda_index = _sel_probes.back();
|
||||
this->_sel_probes = _sel_probes;
|
||||
this->_options_index = _options_index;
|
||||
|
||||
decode();
|
||||
}
|
||||
|
||||
void dsI2c::decode()
|
||||
{
|
||||
assert(_data);
|
||||
_max_width = 0;
|
||||
uint8_t cur_state = Unknown;
|
||||
|
||||
const deque< shared_ptr<pv::data::LogicSnapshot> > &snapshots =
|
||||
_data->get_snapshots();
|
||||
if (snapshots.empty())
|
||||
return;
|
||||
|
||||
const shared_ptr<pv::data::LogicSnapshot> &snapshot =
|
||||
snapshots.front();
|
||||
|
||||
uint64_t flag_index;
|
||||
uint64_t start_index;
|
||||
uint64_t stop_index;
|
||||
bool edge;
|
||||
uint64_t left = 0;
|
||||
uint64_t right = snapshot->get_sample_count() - 1;
|
||||
|
||||
if (!_state_index.empty())
|
||||
_state_index.clear();
|
||||
|
||||
while(1)
|
||||
{
|
||||
// search start flag
|
||||
if (snapshot->get_first_edge(flag_index, edge, left, right, _sda_index, -1, _scl_index, 1) == SR_OK) {
|
||||
left = flag_index + 1;
|
||||
|
||||
if (cur_state == Start) {
|
||||
stop_index = flag_index;
|
||||
snapshot->get_edges(_cur_edges, start_index, stop_index, _scl_index, 1);
|
||||
cmd_decode(snapshot);
|
||||
data_decode(snapshot);
|
||||
_cur_edges.clear();
|
||||
}
|
||||
|
||||
if (edge == false) {
|
||||
cur_state = Start;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(flag_index - 1, 2), std::make_pair(cur_state, 0)));
|
||||
} else {
|
||||
cur_state = Stop;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(flag_index - 1, 2), std::make_pair(cur_state, 0)));
|
||||
}
|
||||
start_index = flag_index + 1;
|
||||
_max_width = max(_max_width, (uint64_t)2);
|
||||
} else {
|
||||
if (cur_state == Start) {
|
||||
stop_index = snapshot->get_sample_count() - 1;
|
||||
snapshot->get_edges(_cur_edges, start_index, stop_index, _scl_index, 1);
|
||||
cmd_decode(snapshot);
|
||||
data_decode(snapshot);
|
||||
_cur_edges.clear();
|
||||
}
|
||||
_cur_edges.clear();
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
void dsI2c::cmd_decode(const boost::shared_ptr<data::LogicSnapshot> &snapshot)
|
||||
{
|
||||
uint8_t cur_state;
|
||||
const uint8_t *src_ptr;
|
||||
const int unit_size = snapshot->get_unit_size();
|
||||
//const uint8_t *const end_src_ptr = (uint8_t*)snapshot->get_data() +
|
||||
// snapshot->get_sample_count() * unit_size;
|
||||
|
||||
//const uint64_t scl_mask = 1ULL << _scl_index;
|
||||
const uint64_t sda_mask = 1ULL << _sda_index;
|
||||
|
||||
if (_cur_edges.size() > 9) {
|
||||
uint8_t slave_addr = 0;
|
||||
bool read;
|
||||
bool nak;
|
||||
//int index = 0;
|
||||
src_ptr = (uint8_t*)snapshot->get_data();
|
||||
slave_addr = ((*(uint64_t*)(src_ptr + _cur_edges[0].first * unit_size) & sda_mask) != 0);
|
||||
slave_addr = (slave_addr << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[1].first * unit_size) & sda_mask) != 0);
|
||||
slave_addr = (slave_addr << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[2].first * unit_size) & sda_mask) != 0);
|
||||
slave_addr = (slave_addr << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[3].first * unit_size) & sda_mask) != 0);
|
||||
slave_addr = (slave_addr << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[4].first * unit_size) & sda_mask) != 0);
|
||||
slave_addr = (slave_addr << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[5].first * unit_size) & sda_mask) != 0);
|
||||
slave_addr = (slave_addr << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[6].first * unit_size) & sda_mask) != 0);
|
||||
read = ((*(uint64_t*)(src_ptr + _cur_edges[7].first * unit_size) & sda_mask) != 0);
|
||||
nak = ((*(uint64_t*)(src_ptr + _cur_edges[8].first * unit_size) & sda_mask) != 0);
|
||||
|
||||
cur_state = read ? Read : Write;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(_cur_edges.at(0).first - 1, _cur_edges.at(7).first - _cur_edges.at(0).first + 2),
|
||||
std::make_pair(cur_state, slave_addr)));
|
||||
cur_state = nak ? Nak : Ack;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(_cur_edges.at(8).first - 1, 2),
|
||||
std::make_pair(cur_state, 0)));
|
||||
_max_width = max(_max_width, _cur_edges.at(7).first - _cur_edges.at(0).first + 2);
|
||||
//_cur_edges.erase(_cur_edges.begin(), _cur_edges.begin() + 9);
|
||||
}
|
||||
}
|
||||
|
||||
void dsI2c::data_decode(const shared_ptr<data::LogicSnapshot> &snapshot)
|
||||
{
|
||||
uint8_t cur_state;
|
||||
const uint8_t *src_ptr;
|
||||
const int unit_size = snapshot->get_unit_size();
|
||||
//const uint8_t *const end_src_ptr = (uint8_t*)snapshot->get_data() +
|
||||
// snapshot->get_sample_count() * unit_size;
|
||||
|
||||
//const uint64_t scl_mask = 1ULL << _scl_index;
|
||||
const uint64_t sda_mask = 1ULL << _sda_index;
|
||||
|
||||
uint64_t edge_size = _cur_edges.size();
|
||||
uint64_t index = 9;
|
||||
|
||||
while (edge_size > index + 9) {
|
||||
uint8_t data = 0;
|
||||
bool nak;
|
||||
|
||||
src_ptr = (uint8_t*)snapshot->get_data();
|
||||
data = ((*(uint64_t*)(src_ptr + _cur_edges[index].first * unit_size) & sda_mask) != 0);
|
||||
data = (data << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[index + 1].first * unit_size) & sda_mask) != 0);
|
||||
data = (data << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[index + 2].first * unit_size) & sda_mask) != 0);
|
||||
data = (data << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[index + 3].first * unit_size) & sda_mask) != 0);
|
||||
data = (data << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[index + 4].first * unit_size) & sda_mask) != 0);
|
||||
data = (data << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[index + 5].first * unit_size) & sda_mask) != 0);
|
||||
data = (data << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[index + 6].first * unit_size) & sda_mask) != 0);
|
||||
data = (data << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[index + 7].first * unit_size) & sda_mask) != 0);
|
||||
nak = ((*(uint64_t*)(src_ptr + _cur_edges[index + 8].first * unit_size) & sda_mask) != 0);
|
||||
|
||||
cur_state = Data;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(_cur_edges.at(index).first - 1, _cur_edges.at(index + 7).first - _cur_edges.at(index).first + 2),
|
||||
std::make_pair(cur_state, data)));
|
||||
cur_state = nak ? Nak : Ack;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(_cur_edges.at(index + 8).first - 1, 2),
|
||||
std::make_pair(cur_state, 0)));
|
||||
_max_width = max(_max_width, _cur_edges.at(index + 7).first - _cur_edges.at(index).first + 2);
|
||||
//_cur_edges.erase(_cur_edges.begin(), _cur_edges.begin() + 9);
|
||||
index += 9;
|
||||
}
|
||||
}
|
||||
|
||||
void dsI2c::fill_color_table(std::vector <QColor>& _color_table)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < TableSize; i++)
|
||||
_color_table.push_back(ColorTable[i]);
|
||||
}
|
||||
|
||||
void dsI2c::fill_state_table(std::vector <QString>& _state_table)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < TableSize; i++)
|
||||
_state_table.push_back(StateTable[i]);
|
||||
}
|
||||
|
||||
void dsI2c::get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length)
|
||||
{
|
||||
ds_view_state view_state;
|
||||
|
||||
const deque< shared_ptr<pv::data::LogicSnapshot> > &snapshots =
|
||||
_data->get_snapshots();
|
||||
if (snapshots.empty())
|
||||
return;
|
||||
const shared_ptr<pv::data::LogicSnapshot> &snapshot =
|
||||
snapshots.front();
|
||||
|
||||
assert(end <= snapshot->get_sample_count());
|
||||
assert(start <= end);
|
||||
assert(min_length > 0);
|
||||
|
||||
if (!states.empty())
|
||||
states.clear();
|
||||
|
||||
if (_state_index.empty())
|
||||
return;
|
||||
if (start > _state_index.at(_state_index.size() - 1).first.first)
|
||||
return;
|
||||
if (end < _state_index.at(0).first.first)
|
||||
return;
|
||||
|
||||
if (min_length * _view_scale > _max_width) {
|
||||
view_state.index = _state_index.at(0).first.first;
|
||||
view_state.samples = _state_index.at(_state_index.size() - 1).first.first +
|
||||
_state_index.at(_state_index.size() - 1).first.second - _state_index.at(0).first.first;
|
||||
view_state.type = DEC_NODETAIL;
|
||||
view_state.state = 0;
|
||||
view_state.data = 0;
|
||||
states.push_back(view_state);
|
||||
return;
|
||||
}
|
||||
|
||||
uint64_t view_start = 0;
|
||||
uint64_t view_end = 0;
|
||||
uint64_t minIndex = 0;
|
||||
uint64_t maxIndex = _state_index.size() - 1;
|
||||
uint64_t i = start * 1.0f / snapshot->get_sample_count() * maxIndex;
|
||||
bool check_flag = false;
|
||||
int times = 0;
|
||||
while(times <= 32) {
|
||||
if (_state_index.at(i).first.first + _state_index.at(i).first.second >= start) {
|
||||
check_flag = true;
|
||||
} else {
|
||||
minIndex = i;
|
||||
i = ceil((i + maxIndex) / 2.0f);
|
||||
}
|
||||
|
||||
if (check_flag) {
|
||||
if (i == 0) {
|
||||
view_start = i;
|
||||
break;
|
||||
} else if (_state_index.at(i-1).first.first + _state_index.at(i-1).first.second < start) {
|
||||
view_start = i;
|
||||
break;
|
||||
} else {
|
||||
maxIndex = i;
|
||||
i = (i + minIndex) / 2;
|
||||
}
|
||||
check_flag = false;
|
||||
}
|
||||
times++;
|
||||
}
|
||||
i = view_start;
|
||||
check_flag = false;
|
||||
times = 0;
|
||||
minIndex = view_start;
|
||||
//maxIndex = _state_index.size() - 1;
|
||||
maxIndex = min(_state_index.size() - 1, (size_t)end);
|
||||
view_end = view_start;
|
||||
while(times <= 32) {
|
||||
if (_state_index.at(i).first.first <= end) {
|
||||
check_flag = true;
|
||||
} else {
|
||||
maxIndex = i;
|
||||
i = (i + minIndex) / 2;
|
||||
}
|
||||
|
||||
if (check_flag) {
|
||||
if (i == maxIndex) {
|
||||
view_end = i;
|
||||
break;
|
||||
} else if (_state_index.at(i+1).first.first > end) {
|
||||
view_end = i;
|
||||
break;
|
||||
} else {
|
||||
minIndex = i;
|
||||
i = ceil((i + maxIndex) / 2.0f);
|
||||
}
|
||||
check_flag = false;
|
||||
}
|
||||
times++;
|
||||
}
|
||||
|
||||
assert(view_end >= view_start);
|
||||
|
||||
for (uint64_t i = view_start; i <= view_end; i++) {
|
||||
if (_state_index.at(i).first.second >= min_length * _view_scale) {
|
||||
view_state.index = _state_index.at(i).first.first;
|
||||
view_state.samples = _state_index.at(i).first.second;
|
||||
view_state.type = (_state_index.at(i).second.first == Read ||
|
||||
_state_index.at(i).second.first == Write ||
|
||||
_state_index.at(i).second.first == Data) ? DEC_DATA : DEC_CMD;
|
||||
view_state.state = _state_index.at(i).second.first;
|
||||
view_state.data = _state_index.at(i).second.second;
|
||||
states.push_back(view_state);
|
||||
} else {
|
||||
view_state.index = _state_index.at(i).first.first;
|
||||
view_state.samples = _state_index.at(i).first.second;
|
||||
view_state.type = DEC_NODETAIL;
|
||||
view_state.state = 0;
|
||||
view_state.data = 0;
|
||||
states.push_back(view_state);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
87
DSLogic-gui/pv/decoder/dsi2c.h
Normal file
87
DSLogic-gui/pv/decoder/dsi2c.h
Normal file
@@ -0,0 +1,87 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DSI2C_H
|
||||
#define DSLOGIC_PV_DSI2C_H
|
||||
|
||||
#include "decoder.h"
|
||||
#include "../data/logic.h"
|
||||
#include "../data/logicsnapshot.h"
|
||||
|
||||
#include <boost/shared_ptr.hpp>
|
||||
|
||||
namespace pv {
|
||||
|
||||
namespace data {
|
||||
class LogicSnapshot;
|
||||
}
|
||||
|
||||
namespace decoder {
|
||||
|
||||
class dsI2c : public Decoder
|
||||
{
|
||||
private:
|
||||
static const int TableSize = 8;
|
||||
static const QColor ColorTable[TableSize];
|
||||
static const QString StateTable[TableSize];
|
||||
|
||||
enum {Unknown = 0, Start, Stop, Ack, Nak, Read, Write, Data};
|
||||
|
||||
private:
|
||||
void cmd_decode(const boost::shared_ptr<pv::data::LogicSnapshot> &snapshot);
|
||||
|
||||
void data_decode(const boost::shared_ptr<data::LogicSnapshot> &snapshot);
|
||||
|
||||
public:
|
||||
dsI2c(boost::shared_ptr<pv::data::Logic> data,
|
||||
std::list<int> _sel_probes, QMap<QString, QVariant> &_options, QMap<QString, int> _options_index);
|
||||
|
||||
virtual ~dsI2c();
|
||||
|
||||
QString get_decode_name();
|
||||
|
||||
void recode(std::list <int > _sel_probes, QMap <QString, QVariant>& _options, QMap<QString, int> _options_index);
|
||||
|
||||
void decode();
|
||||
|
||||
void fill_color_table(std::vector <QColor>& _color_table);
|
||||
|
||||
void fill_state_table(std::vector <QString>& _state_table);
|
||||
|
||||
void get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length);
|
||||
|
||||
private:
|
||||
|
||||
int _scl_index;
|
||||
int _sda_index;
|
||||
uint64_t _max_width;
|
||||
std::vector< pv::data::LogicSnapshot::EdgePair > _cur_edges;
|
||||
std::vector< std::pair<std::pair<uint64_t, uint64_t>, std::pair<uint8_t, uint8_t> > > _state_index;
|
||||
};
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DSI2C_H
|
||||
356
DSLogic-gui/pv/decoder/dsserial.cpp
Normal file
356
DSLogic-gui/pv/decoder/dsserial.cpp
Normal file
@@ -0,0 +1,356 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "dsserial.h"
|
||||
|
||||
#include <math.h>
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace decoder {
|
||||
|
||||
const QColor dsSerial::ColorTable[TableSize] = {
|
||||
QColor(255, 255, 255, 150),
|
||||
QColor(0, 255, 0, 150),
|
||||
QColor(255, 0, 0, 150),
|
||||
QColor(0, 255, 0, 150),
|
||||
QColor(255, 0, 0, 150),
|
||||
QColor(0, 0, 255, 150),
|
||||
QColor(0, 0, 255, 150),
|
||||
QColor(0, 255, 255, 150),
|
||||
};
|
||||
|
||||
const QString dsSerial::StateTable[TableSize] = {
|
||||
"UNKNOWN",
|
||||
"START",
|
||||
"STOP",
|
||||
"START ERROR",
|
||||
"STOP ERROR",
|
||||
"PARITY",
|
||||
"PARITY ERROR",
|
||||
"DATA"
|
||||
};
|
||||
|
||||
dsSerial::dsSerial(shared_ptr<data::Logic> data, std::list <int > _sel_probes, QMap<QString, QVariant> &_options, QMap<QString, int> _options_index) :
|
||||
Decoder(data, _sel_probes, _options_index)
|
||||
{
|
||||
assert(_sel_probes.size() == 1);
|
||||
|
||||
_serial_index = _sel_probes.front();
|
||||
|
||||
_baudrate = _options.value("baudrate").toULongLong();
|
||||
_stopbits = _options.value("stopbits").toFloat();
|
||||
_parity = _options.value("parity").toInt();
|
||||
_order = _options.value("order").toBool();
|
||||
_bits = _options.value("bits").toUInt();
|
||||
_idle_level = _options.value("idle").toBool();
|
||||
}
|
||||
|
||||
dsSerial::~dsSerial()
|
||||
{
|
||||
}
|
||||
|
||||
QString dsSerial::get_decode_name()
|
||||
{
|
||||
return "Async Serial";
|
||||
}
|
||||
|
||||
void dsSerial::recode(std::list <int > _sel_probes, QMap <QString, QVariant>& _options, QMap<QString, int> _options_index)
|
||||
{
|
||||
assert(_sel_probes.size() == 1);
|
||||
|
||||
_serial_index = _sel_probes.front();
|
||||
|
||||
_baudrate = _options.value("baudrate").toULongLong();
|
||||
_stopbits = _options.value("stopbits").toFloat();
|
||||
_parity = _options.value("parity").toInt();
|
||||
_order = _options.value("order").toBool();
|
||||
_bits = _options.value("bits").toUInt();
|
||||
_idle_level = _options.value("idle").toBool();
|
||||
|
||||
|
||||
this->_sel_probes = _sel_probes;
|
||||
this->_options_index = _options_index;
|
||||
|
||||
decode();
|
||||
}
|
||||
|
||||
void dsSerial::decode()
|
||||
{
|
||||
assert(_data);
|
||||
uint8_t cur_state = Unknown;
|
||||
|
||||
const deque< shared_ptr<pv::data::LogicSnapshot> > &snapshots =
|
||||
_data->get_snapshots();
|
||||
if (snapshots.empty())
|
||||
return;
|
||||
|
||||
const shared_ptr<pv::data::LogicSnapshot> &snapshot =
|
||||
snapshots.front();
|
||||
|
||||
uint64_t flag_index;
|
||||
uint64_t start_index;
|
||||
uint64_t stop_index;
|
||||
bool edge;
|
||||
uint64_t left = 0;
|
||||
uint64_t right = snapshot->get_sample_count() - 1;
|
||||
float samplesPerBit;
|
||||
int sampleOffset;
|
||||
int i;
|
||||
_max_width = 0;
|
||||
_min_width = right;
|
||||
|
||||
int start_flag = _idle_level ? 0 : 1;
|
||||
if (_baudrate != 0)
|
||||
samplesPerBit = _data->get_samplerate() * 1.0f / _baudrate;
|
||||
else
|
||||
samplesPerBit = snapshot->get_min_pulse(left, right, _serial_index);
|
||||
sampleOffset = samplesPerBit / 2;
|
||||
|
||||
if (!_state_index.empty())
|
||||
_state_index.clear();
|
||||
|
||||
while(1)
|
||||
{
|
||||
// search start flag
|
||||
bool stop_err = false;
|
||||
if (snapshot->get_first_edge(flag_index, edge, left, right, _serial_index, start_flag, _serial_index, -1) == SR_OK) {
|
||||
left = flag_index + floor((_bits + (_parity != -1) + _stopbits + 1) * samplesPerBit);
|
||||
|
||||
cur_state = Start;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(flag_index, samplesPerBit), std::make_pair(cur_state, 0)));
|
||||
_max_width = max(_max_width, (uint64_t)samplesPerBit);
|
||||
_min_width = min(_min_width, (uint64_t)samplesPerBit);
|
||||
|
||||
start_index = flag_index + samplesPerBit * 1.5;
|
||||
stop_index = flag_index + ceil((_bits + (_parity != -1) + 1) * samplesPerBit);
|
||||
|
||||
if (left < right) {
|
||||
for (i = 0; i < _stopbits * samplesPerBit; i++) {
|
||||
if (_idle_level != ((snapshot->get_sample(stop_index + i) & 1ULL << _serial_index) != 0)) {
|
||||
stop_err = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (stop_err) {
|
||||
cur_state = StopErr;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(stop_index, samplesPerBit), std::make_pair(cur_state, 0)));
|
||||
} else {
|
||||
data_decode(snapshot, start_index, stop_index, samplesPerBit);
|
||||
cur_state = Stop;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(stop_index, samplesPerBit), std::make_pair(cur_state, 0)));
|
||||
}
|
||||
} else {
|
||||
_cur_edges.clear();
|
||||
break;
|
||||
}
|
||||
} else {
|
||||
_cur_edges.clear();
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
void dsSerial::data_decode(const shared_ptr<data::LogicSnapshot> &snapshot, uint64_t start, uint64_t stop, float samplesPerBit)
|
||||
{
|
||||
(void)stop;
|
||||
|
||||
uint8_t cur_state;
|
||||
const uint8_t *src_ptr;
|
||||
const int unit_size = snapshot->get_unit_size();
|
||||
|
||||
const uint64_t serial_mask = 1ULL << _serial_index;
|
||||
|
||||
uint32_t data = 0;
|
||||
uint32_t parity;
|
||||
int i;
|
||||
|
||||
src_ptr = (uint8_t*)snapshot->get_data();
|
||||
if (_order) {
|
||||
for (i = 0; i < _bits; i++) {
|
||||
data = data + (((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * i) * unit_size) & serial_mask) != 0) << i);
|
||||
}
|
||||
} else {
|
||||
for (i = 0; i < _bits; i++) {
|
||||
data = (data << 1) + ((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * i) * unit_size) & serial_mask) != 0);
|
||||
}
|
||||
}
|
||||
|
||||
cur_state = Data;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start - samplesPerBit * 0.5, samplesPerBit * _bits),
|
||||
std::make_pair(cur_state, data)));
|
||||
if (_parity != -1) {
|
||||
parity = ((*(uint64_t*)(src_ptr + (int)(start + samplesPerBit * _bits) * unit_size) & serial_mask) != 0);
|
||||
parity = parity ^ data;
|
||||
parity = (parity & 0x55555555) + ((parity >> 1) & 0x55555555);
|
||||
parity = (parity & 0x33333333) + ((parity >> 2) & 0x33333333);
|
||||
parity = (parity & 0x0f0f0f0f) + ((parity >> 4) & 0x0f0f0f0f);
|
||||
parity = (parity & 0x00ff00ff) + ((parity >> 8) & 0x00ff00ff);
|
||||
parity = (parity & 0x0000ffff) + ((parity >> 16) & 0x0000ffff);
|
||||
parity = (parity & 0x00000001) ^ _parity;
|
||||
cur_state = parity ? ParityErr : Parity;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start + samplesPerBit * (_bits - 0.5), samplesPerBit),
|
||||
std::make_pair(cur_state, 0)));
|
||||
}
|
||||
_max_width = max(_max_width, (uint64_t)(samplesPerBit * _bits));
|
||||
}
|
||||
|
||||
void dsSerial::fill_color_table(std::vector <QColor>& _color_table)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < TableSize; i++)
|
||||
_color_table.push_back(ColorTable[i]);
|
||||
}
|
||||
|
||||
void dsSerial::fill_state_table(std::vector <QString>& _state_table)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < TableSize; i++)
|
||||
_state_table.push_back(StateTable[i]);
|
||||
}
|
||||
|
||||
void dsSerial::get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length)
|
||||
{
|
||||
ds_view_state view_state;
|
||||
|
||||
const deque< shared_ptr<pv::data::LogicSnapshot> > &snapshots =
|
||||
_data->get_snapshots();
|
||||
if (snapshots.empty())
|
||||
return;
|
||||
const shared_ptr<pv::data::LogicSnapshot> &snapshot =
|
||||
snapshots.front();
|
||||
|
||||
assert(end <= snapshot->get_sample_count());
|
||||
assert(start <= end);
|
||||
assert(min_length > 0);
|
||||
|
||||
if (!states.empty())
|
||||
states.clear();
|
||||
|
||||
if (_state_index.empty())
|
||||
return;
|
||||
if (start > _state_index.at(_state_index.size() - 1).first.first)
|
||||
return;
|
||||
if (end < _state_index.at(0).first.first)
|
||||
return;
|
||||
|
||||
if (min_length * _view_scale > _max_width) {
|
||||
view_state.index = _state_index.at(0).first.first;
|
||||
view_state.samples = _state_index.at(_state_index.size() - 1).first.first +
|
||||
_state_index.at(_state_index.size() - 1).first.second - _state_index.at(0).first.first;
|
||||
view_state.type = DEC_NODETAIL;
|
||||
view_state.state = 0;
|
||||
view_state.data = 0;
|
||||
states.push_back(view_state);
|
||||
return;
|
||||
}
|
||||
|
||||
uint64_t view_start = 0;
|
||||
uint64_t view_end = 0;
|
||||
uint64_t minIndex = 0;
|
||||
uint64_t maxIndex = _state_index.size() - 1;
|
||||
uint64_t i = start * 1.0f / snapshot->get_sample_count() * maxIndex;
|
||||
bool check_flag = false;
|
||||
int times = 0;
|
||||
while(times <= 32) {
|
||||
if (_state_index.at(i).first.first + _state_index.at(i).first.second >= start) {
|
||||
check_flag = true;
|
||||
} else {
|
||||
minIndex = i;
|
||||
i = ceil((i + maxIndex) / 2.0f);
|
||||
}
|
||||
|
||||
if (check_flag) {
|
||||
if (i == 0) {
|
||||
view_start = i;
|
||||
break;
|
||||
} else if (_state_index.at(i-1).first.first + _state_index.at(i-1).first.second < start) {
|
||||
view_start = i;
|
||||
break;
|
||||
} else {
|
||||
maxIndex = i;
|
||||
i = (i + minIndex) / 2;
|
||||
}
|
||||
check_flag = false;
|
||||
}
|
||||
times++;
|
||||
}
|
||||
i = view_start;
|
||||
check_flag = false;
|
||||
times = 0;
|
||||
minIndex = view_start;
|
||||
//maxIndex = _state_index.size() - 1;
|
||||
maxIndex = min(_state_index.size() - 1, (size_t)end);
|
||||
view_end = view_start;
|
||||
while(times <= 32) {
|
||||
if (_state_index.at(i).first.first <= end) {
|
||||
check_flag = true;
|
||||
} else {
|
||||
maxIndex = i;
|
||||
i = (i + minIndex) / 2;
|
||||
}
|
||||
|
||||
if (check_flag) {
|
||||
if (i == maxIndex) {
|
||||
view_end = i;
|
||||
break;
|
||||
} else if (_state_index.at(i+1).first.first > end) {
|
||||
view_end = i;
|
||||
break;
|
||||
} else {
|
||||
minIndex = i;
|
||||
i = ceil((i + maxIndex) / 2.0f);
|
||||
}
|
||||
check_flag = false;
|
||||
}
|
||||
times++;
|
||||
}
|
||||
|
||||
assert(view_end >= view_start);
|
||||
|
||||
for (uint64_t i = view_start; i <= view_end; i++) {
|
||||
if (_state_index.at(i).first.second >= min_length * _view_scale) {
|
||||
view_state.index = _state_index.at(i).first.first;
|
||||
view_state.samples = _state_index.at(i).first.second;
|
||||
view_state.type = (_state_index.at(i).second.first == Data) ? DEC_DATA : DEC_CMD;
|
||||
view_state.state = _state_index.at(i).second.first;
|
||||
view_state.data = _state_index.at(i).second.second;
|
||||
states.push_back(view_state);
|
||||
} else {
|
||||
view_state.index = _state_index.at(i).first.first;
|
||||
view_state.samples = _state_index.at(i).first.second;
|
||||
view_state.type = DEC_NODETAIL;
|
||||
view_state.state = 0;
|
||||
view_state.data = 0;
|
||||
states.push_back(view_state);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
95
DSLogic-gui/pv/decoder/dsserial.h
Normal file
95
DSLogic-gui/pv/decoder/dsserial.h
Normal file
@@ -0,0 +1,95 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_SV_DSSERIAL_H
|
||||
#define DSLOGIC_SV_DSSERIAL_H
|
||||
|
||||
#include "decoder.h"
|
||||
#include "../data/logic.h"
|
||||
#include "../data/logicsnapshot.h"
|
||||
|
||||
#include <boost/shared_ptr.hpp>
|
||||
|
||||
#include <QMap>
|
||||
#include <QVariant>
|
||||
|
||||
namespace pv {
|
||||
|
||||
namespace data {
|
||||
class LogicSnapshot;
|
||||
}
|
||||
|
||||
namespace decoder {
|
||||
|
||||
class dsSerial : public Decoder
|
||||
{
|
||||
private:
|
||||
static const int TableSize = 8;
|
||||
static const QColor ColorTable[TableSize];
|
||||
static const QString StateTable[TableSize];
|
||||
|
||||
enum {Unknown = 0, Start, Stop, StartErr, StopErr, Parity, ParityErr, Data};
|
||||
|
||||
private:
|
||||
void data_decode(const boost::shared_ptr<data::LogicSnapshot> &snapshot, uint64_t start, uint64_t stop, float samplesPerBit);
|
||||
|
||||
public:
|
||||
dsSerial(boost::shared_ptr<pv::data::Logic> data,
|
||||
std::list<int> _sel_probes, QMap <QString, QVariant> &_options, QMap<QString, int> _options_index);
|
||||
|
||||
virtual ~dsSerial();
|
||||
|
||||
QString get_decode_name();
|
||||
|
||||
void recode(std::list <int > _sel_probes, QMap <QString, QVariant>& _options, QMap <QString, int> _options_index);
|
||||
|
||||
void decode();
|
||||
|
||||
void fill_color_table(std::vector <QColor>& _color_table);
|
||||
|
||||
void fill_state_table(std::vector <QString>& _state_table);
|
||||
|
||||
void get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length);
|
||||
|
||||
private:
|
||||
|
||||
int _serial_index;
|
||||
uint64_t _baudrate;
|
||||
float _stopbits;
|
||||
int _parity;
|
||||
bool _order;
|
||||
int _bits;
|
||||
bool _idle_level;
|
||||
|
||||
uint64_t _max_width;
|
||||
uint64_t _min_width;
|
||||
std::vector< pv::data::LogicSnapshot::EdgePair > _cur_edges;
|
||||
std::vector< std::pair<std::pair<uint64_t, uint64_t>, std::pair<uint8_t, uint8_t> > > _state_index;
|
||||
};
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DSSERIAL_H
|
||||
374
DSLogic-gui/pv/decoder/dsspi.cpp
Normal file
374
DSLogic-gui/pv/decoder/dsspi.cpp
Normal file
@@ -0,0 +1,374 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "dsspi.h"
|
||||
|
||||
#include <math.h>
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace decoder {
|
||||
|
||||
const QColor dsSpi::ColorTable[TableSize] = {
|
||||
QColor(255, 255, 255, 150),
|
||||
QColor(255, 0, 0, 150),
|
||||
QColor(255, 0, 0, 150),
|
||||
QColor(0, 255, 255, 150),
|
||||
};
|
||||
|
||||
const QString dsSpi::StateTable[TableSize] = {
|
||||
"UNKNOWN",
|
||||
"CLOCK POLARITY ERROR",
|
||||
"TOO FEW BITS",
|
||||
"DATA"
|
||||
};
|
||||
|
||||
dsSpi::dsSpi(shared_ptr<data::Logic> data, std::list <int > _sel_probes, QMap<QString, QVariant> &_options, QMap<QString, int> _options_index) :
|
||||
Decoder(data, _sel_probes, _options_index)
|
||||
{
|
||||
_cpol = _options.value("cpol").toBool();
|
||||
_cpha = _options.value("cpha").toBool();
|
||||
_order = _options.value("order").toBool();
|
||||
_bits = _options.value("bits").toUInt();
|
||||
_ssn = _options.value("ssn").toInt();
|
||||
|
||||
if (_ssn == -1)
|
||||
assert(_sel_probes.size() == 3);
|
||||
else
|
||||
assert(_sel_probes.size() == 4);
|
||||
|
||||
if (_ssn != -1) {
|
||||
_ssn_index = _sel_probes.front();
|
||||
_sel_probes.pop_front();
|
||||
}else{
|
||||
_ssn_index = 0;
|
||||
}
|
||||
_sclk_index = _sel_probes.front();
|
||||
_sel_probes.pop_front();
|
||||
_mosi_index = _sel_probes.front();
|
||||
_sel_probes.pop_front();
|
||||
_miso_index = _sel_probes.front();
|
||||
_sel_probes.pop_front();
|
||||
}
|
||||
|
||||
dsSpi::~dsSpi()
|
||||
{
|
||||
}
|
||||
|
||||
QString dsSpi::get_decode_name()
|
||||
{
|
||||
return "SPI";
|
||||
}
|
||||
|
||||
void dsSpi::recode(std::list <int > _sel_probes, QMap <QString, QVariant>& _options, QMap<QString, int> _options_index)
|
||||
{
|
||||
_cpol = _options.value("cpol").toBool();
|
||||
_cpha = _options.value("cpha").toBool();
|
||||
_order = _options.value("order").toBool();
|
||||
_bits = _options.value("bits").toUInt();
|
||||
_ssn = _options.value("ssn").toInt();
|
||||
|
||||
if (_ssn == -1)
|
||||
assert(_sel_probes.size() == 3);
|
||||
else
|
||||
assert(_sel_probes.size() == 4);
|
||||
|
||||
if (_ssn != -1) {
|
||||
_ssn_index = _sel_probes.front();
|
||||
_sel_probes.pop_front();
|
||||
_sel_probes.push_back(_ssn_index);
|
||||
}else{
|
||||
_ssn_index = 0;
|
||||
}
|
||||
_sclk_index = _sel_probes.front();
|
||||
_sel_probes.pop_front();
|
||||
_sel_probes.push_back(_sclk_index);
|
||||
_mosi_index = _sel_probes.front();
|
||||
_sel_probes.pop_front();
|
||||
_sel_probes.push_back(_mosi_index);
|
||||
_miso_index = _sel_probes.front();
|
||||
_sel_probes.pop_front();
|
||||
_sel_probes.push_back(_miso_index);
|
||||
|
||||
|
||||
this->_sel_probes = _sel_probes;
|
||||
this->_options_index = _options_index;
|
||||
|
||||
decode();
|
||||
}
|
||||
|
||||
void dsSpi::decode()
|
||||
{
|
||||
assert(_data);
|
||||
_max_width = 0;
|
||||
uint8_t cur_state = Unknown;
|
||||
|
||||
const deque< shared_ptr<pv::data::LogicSnapshot> > &snapshots =
|
||||
_data->get_snapshots();
|
||||
if (snapshots.empty())
|
||||
return;
|
||||
|
||||
const shared_ptr<pv::data::LogicSnapshot> &snapshot =
|
||||
snapshots.front();
|
||||
|
||||
const uint64_t ssn_mask = 1ULL << _ssn_index;
|
||||
const uint64_t sclk_mask = 1ULL << _sclk_index;
|
||||
uint64_t flag_index;
|
||||
uint64_t start_index;
|
||||
uint64_t stop_index;
|
||||
bool edge;
|
||||
uint64_t left = 0;
|
||||
uint64_t right = snapshot->get_sample_count() - 1;
|
||||
|
||||
if (!_state_index.empty())
|
||||
_state_index.clear();
|
||||
|
||||
while(1)
|
||||
{
|
||||
// search start flag
|
||||
if (_ssn != -1) {
|
||||
if (_ssn == ((snapshot->get_sample(left) & ssn_mask) != 0)) {
|
||||
if (snapshot->get_first_edge(flag_index, edge, left, right, _ssn_index, !_ssn, _ssn_index, -1) == SR_OK) {
|
||||
start_index = left;
|
||||
stop_index = flag_index - 1;
|
||||
} else {
|
||||
start_index = left;
|
||||
stop_index = right;
|
||||
}
|
||||
} else {
|
||||
if (snapshot->get_first_edge(flag_index, edge, left, right, _ssn_index, _ssn, _ssn_index, -1) == SR_OK)
|
||||
start_index = flag_index;
|
||||
else
|
||||
break;
|
||||
|
||||
if (snapshot->get_first_edge(flag_index, edge, left, right, _ssn_index, !_ssn, _ssn_index, -1) == SR_OK)
|
||||
stop_index = flag_index - 1;
|
||||
else
|
||||
stop_index = right;
|
||||
}
|
||||
} else {
|
||||
start_index = left;
|
||||
stop_index = right;
|
||||
}
|
||||
|
||||
if (stop_index - start_index > 15) {
|
||||
if (_cpol == ((snapshot->get_sample(start_index) & sclk_mask) != 0)) {
|
||||
snapshot->get_edges(_cur_edges, start_index, stop_index, _sclk_index, !(_cpha ^ _cpol));
|
||||
data_decode(snapshot);
|
||||
} else {
|
||||
cur_state = ClockErr;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(start_index, stop_index - start_index),
|
||||
std::make_pair(cur_state, 0)));
|
||||
_max_width = max(_max_width, stop_index - start_index);
|
||||
}
|
||||
}
|
||||
|
||||
left = stop_index + 1;
|
||||
if (left >= right)
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
void dsSpi::data_decode(const shared_ptr<data::LogicSnapshot> &snapshot)
|
||||
{
|
||||
uint8_t cur_state;
|
||||
const uint8_t *src_ptr;
|
||||
const int unit_size = snapshot->get_unit_size();
|
||||
|
||||
const uint64_t miso_mask = 1ULL << _miso_index;
|
||||
const uint64_t mosi_mask = 1ULL << _mosi_index;
|
||||
|
||||
uint64_t edge_size = _cur_edges.size();
|
||||
uint64_t index = 0;
|
||||
src_ptr = (uint8_t*)snapshot->get_data();
|
||||
|
||||
while (edge_size >= index + _bits) {
|
||||
uint8_t mosi = 0;
|
||||
uint8_t miso = 0;
|
||||
int i;
|
||||
|
||||
if (_order) {
|
||||
for (i = 0; i < _bits; i++) {
|
||||
mosi = (mosi << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[index + i].first * unit_size) & mosi_mask) != 0);
|
||||
miso = (miso << 1) + ((*(uint64_t*)(src_ptr + _cur_edges[index + i].first * unit_size) & miso_mask) != 0);
|
||||
}
|
||||
} else {
|
||||
for (i = 0; i < _bits; i++) {
|
||||
mosi = mosi + (((*(uint64_t*)(src_ptr + _cur_edges[index + i].first * unit_size) & mosi_mask) != 0) << i);
|
||||
miso = miso + (((*(uint64_t*)(src_ptr + _cur_edges[index + i].first * unit_size) & miso_mask) != 0) << i);
|
||||
}
|
||||
}
|
||||
|
||||
cur_state = Data;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(_cur_edges.at(index).first - 1, _cur_edges.at(index + _bits - 1).first - _cur_edges.at(index).first + 2),
|
||||
std::make_pair(cur_state, mosi)));
|
||||
|
||||
_max_width = max(_max_width, _cur_edges.at(index + _bits - 1).first - _cur_edges.at(index).first + 2);
|
||||
index += 8;
|
||||
}
|
||||
|
||||
if (edge_size > index + 1 && edge_size < index + _bits) {
|
||||
cur_state = BitsErr;
|
||||
_state_index.push_back(std::make_pair(std::make_pair(_cur_edges.at(index + 1).first - 1, _cur_edges.at(_cur_edges.size() - 1).first - _cur_edges.at(index + 1).first + 2),
|
||||
std::make_pair(cur_state, 0)));
|
||||
}
|
||||
}
|
||||
|
||||
void dsSpi::fill_color_table(std::vector <QColor>& _color_table)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < TableSize; i++)
|
||||
_color_table.push_back(ColorTable[i]);
|
||||
}
|
||||
|
||||
void dsSpi::fill_state_table(std::vector <QString>& _state_table)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < TableSize; i++)
|
||||
_state_table.push_back(StateTable[i]);
|
||||
}
|
||||
|
||||
void dsSpi::get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length)
|
||||
{
|
||||
ds_view_state view_state;
|
||||
|
||||
const deque< shared_ptr<pv::data::LogicSnapshot> > &snapshots =
|
||||
_data->get_snapshots();
|
||||
if (snapshots.empty())
|
||||
return;
|
||||
const shared_ptr<pv::data::LogicSnapshot> &snapshot =
|
||||
snapshots.front();
|
||||
|
||||
assert(end <= snapshot->get_sample_count());
|
||||
assert(start <= end);
|
||||
assert(min_length > 0);
|
||||
|
||||
if (!states.empty())
|
||||
states.clear();
|
||||
|
||||
if (_state_index.empty())
|
||||
return;
|
||||
if (start > _state_index.at(_state_index.size() - 1).first.first)
|
||||
return;
|
||||
if (end < _state_index.at(0).first.first)
|
||||
return;
|
||||
|
||||
if (min_length * _view_scale > _max_width) {
|
||||
view_state.index = _state_index.at(0).first.first;
|
||||
view_state.samples = _state_index.at(_state_index.size() - 1).first.first +
|
||||
_state_index.at(_state_index.size() - 1).first.second - _state_index.at(0).first.first;
|
||||
view_state.type = DEC_NODETAIL;
|
||||
view_state.state = 0;
|
||||
view_state.data = 0;
|
||||
states.push_back(view_state);
|
||||
return;
|
||||
}
|
||||
|
||||
uint64_t view_start = 0;
|
||||
uint64_t view_end = 0;
|
||||
uint64_t minIndex = 0;
|
||||
uint64_t maxIndex = _state_index.size() - 1;
|
||||
uint64_t i = start * 1.0f / snapshot->get_sample_count() * maxIndex;
|
||||
bool check_flag = false;
|
||||
int times = 0;
|
||||
while(times <= 32) {
|
||||
if (_state_index.at(i).first.first + _state_index.at(i).first.second >= start) {
|
||||
check_flag = true;
|
||||
} else {
|
||||
minIndex = i;
|
||||
i = ceil((i + maxIndex) / 2.0f);
|
||||
}
|
||||
|
||||
if (check_flag) {
|
||||
if (i == 0) {
|
||||
view_start = i;
|
||||
break;
|
||||
} else if (_state_index.at(i-1).first.first + _state_index.at(i-1).first.second < start) {
|
||||
view_start = i;
|
||||
break;
|
||||
} else {
|
||||
maxIndex = i;
|
||||
i = (i + minIndex) / 2;
|
||||
}
|
||||
check_flag = false;
|
||||
}
|
||||
times++;
|
||||
}
|
||||
i = view_start;
|
||||
check_flag = false;
|
||||
times = 0;
|
||||
minIndex = view_start;
|
||||
//maxIndex = _state_index.size() - 1;
|
||||
maxIndex = min(_state_index.size() - 1, (size_t)end);
|
||||
view_end = view_start;
|
||||
while(times <= 32) {
|
||||
if (_state_index.at(i).first.first <= end) {
|
||||
check_flag = true;
|
||||
} else {
|
||||
maxIndex = i;
|
||||
i = (i + minIndex) / 2;
|
||||
}
|
||||
|
||||
if (check_flag) {
|
||||
if (i == maxIndex) {
|
||||
view_end = i;
|
||||
break;
|
||||
} else if (_state_index.at(i+1).first.first > end) {
|
||||
view_end = i;
|
||||
break;
|
||||
} else {
|
||||
minIndex = i;
|
||||
i = ceil((i + maxIndex) / 2.0f);
|
||||
}
|
||||
check_flag = false;
|
||||
}
|
||||
times++;
|
||||
}
|
||||
|
||||
assert(view_end >= view_start);
|
||||
|
||||
for (uint64_t i = view_start; i <= view_end; i++) {
|
||||
if (_state_index.at(i).first.second >= min_length * _view_scale) {
|
||||
view_state.index = _state_index.at(i).first.first;
|
||||
view_state.samples = _state_index.at(i).first.second;
|
||||
view_state.type = (_state_index.at(i).second.first == Data) ? DEC_DATA : DEC_CMD;
|
||||
view_state.state = _state_index.at(i).second.first;
|
||||
view_state.data = _state_index.at(i).second.second;
|
||||
states.push_back(view_state);
|
||||
} else {
|
||||
view_state.index = _state_index.at(i).first.first;
|
||||
view_state.samples = _state_index.at(i).first.second;
|
||||
view_state.type = DEC_NODETAIL;
|
||||
view_state.state = 0;
|
||||
view_state.data = 0;
|
||||
states.push_back(view_state);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
97
DSLogic-gui/pv/decoder/dsspi.h
Normal file
97
DSLogic-gui/pv/decoder/dsspi.h
Normal file
@@ -0,0 +1,97 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DSSPI_H
|
||||
#define DSLOGIC_PV_DSSPI_H
|
||||
|
||||
#include "decoder.h"
|
||||
#include "../data/logic.h"
|
||||
#include "../data/logicsnapshot.h"
|
||||
|
||||
#include <boost/shared_ptr.hpp>
|
||||
|
||||
#include <QMap>
|
||||
#include <QVariant>
|
||||
|
||||
namespace pv {
|
||||
|
||||
namespace data {
|
||||
class LogicSnapshot;
|
||||
}
|
||||
|
||||
namespace decoder {
|
||||
|
||||
class dsSpi : public Decoder
|
||||
{
|
||||
private:
|
||||
static const int TableSize = 4;
|
||||
static const QColor ColorTable[TableSize];
|
||||
static const QString StateTable[TableSize];
|
||||
|
||||
enum {Unknown = 0, ClockErr, BitsErr, Data};
|
||||
|
||||
private:
|
||||
void data_decode(const boost::shared_ptr<data::LogicSnapshot> &snapshot);
|
||||
|
||||
public:
|
||||
dsSpi(boost::shared_ptr<pv::data::Logic> data,
|
||||
std::list<int> _sel_probes, QMap <QString, QVariant> &_options, QMap<QString, int> _options_index);
|
||||
|
||||
virtual ~dsSpi();
|
||||
|
||||
QString get_decode_name();
|
||||
|
||||
void recode(std::list <int > _sel_probes, QMap <QString, QVariant>& _options, QMap <QString, int> _options_index);
|
||||
|
||||
void decode();
|
||||
|
||||
void fill_color_table(std::vector <QColor>& _color_table);
|
||||
|
||||
void fill_state_table(std::vector <QString>& _state_table);
|
||||
|
||||
void get_subsampled_states(std::vector<struct ds_view_state> &states,
|
||||
uint64_t start, uint64_t end,
|
||||
float min_length);
|
||||
|
||||
private:
|
||||
|
||||
int _ssn_index;
|
||||
int _sclk_index;
|
||||
int _mosi_index;
|
||||
int _miso_index;
|
||||
|
||||
bool _cpol;
|
||||
bool _cpha;
|
||||
int _bits;
|
||||
bool _order;
|
||||
int _ssn;
|
||||
|
||||
uint64_t _max_width;
|
||||
std::vector< pv::data::LogicSnapshot::EdgePair > _cur_edges;
|
||||
std::vector< std::pair<std::pair<uint64_t, uint64_t>, std::pair<uint8_t, uint8_t> > > _state_index;
|
||||
};
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DSSPI_H
|
||||
127
DSLogic-gui/pv/decoder/i2cconfig.ui
Normal file
127
DSLogic-gui/pv/decoder/i2cconfig.ui
Normal file
@@ -0,0 +1,127 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<ui version="4.0">
|
||||
<class>I2cConfig</class>
|
||||
<widget class="QDialog" name="I2cConfig">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>0</x>
|
||||
<y>0</y>
|
||||
<width>385</width>
|
||||
<height>204</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="minimumSize">
|
||||
<size>
|
||||
<width>385</width>
|
||||
<height>204</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="maximumSize">
|
||||
<size>
|
||||
<width>385</width>
|
||||
<height>204</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="windowTitle">
|
||||
<string>Dialog</string>
|
||||
</property>
|
||||
<widget class="QDialogButtonBox" name="buttonBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>30</x>
|
||||
<y>160</y>
|
||||
<width>341</width>
|
||||
<height>32</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="orientation">
|
||||
<enum>Qt::Horizontal</enum>
|
||||
</property>
|
||||
<property name="standardButtons">
|
||||
<set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
|
||||
</property>
|
||||
</widget>
|
||||
<widget class="QWidget" name="layoutWidget">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>30</x>
|
||||
<y>50</y>
|
||||
<width>301</width>
|
||||
<height>73</height>
|
||||
</rect>
|
||||
</property>
|
||||
<layout class="QFormLayout" name="formLayout">
|
||||
<property name="fieldGrowthPolicy">
|
||||
<enum>QFormLayout::AllNonFixedFieldsGrow</enum>
|
||||
</property>
|
||||
<property name="verticalSpacing">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<property name="bottomMargin">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<item row="0" column="0">
|
||||
<widget class="QLabel" name="label">
|
||||
<property name="sizePolicy">
|
||||
<sizepolicy hsizetype="Fixed" vsizetype="Fixed">
|
||||
<horstretch>0</horstretch>
|
||||
<verstretch>0</verstretch>
|
||||
</sizepolicy>
|
||||
</property>
|
||||
<property name="text">
|
||||
<string>SCL</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="0" column="1">
|
||||
<widget class="QComboBox" name="scl_comboBox"/>
|
||||
</item>
|
||||
<item row="1" column="0">
|
||||
<widget class="QLabel" name="label_2">
|
||||
<property name="text">
|
||||
<string>SDA</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="1" column="1">
|
||||
<widget class="QComboBox" name="sda_comboBox"/>
|
||||
</item>
|
||||
</layout>
|
||||
</widget>
|
||||
</widget>
|
||||
<resources/>
|
||||
<connections>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>accepted()</signal>
|
||||
<receiver>I2cConfig</receiver>
|
||||
<slot>accept()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>248</x>
|
||||
<y>254</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>157</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>rejected()</signal>
|
||||
<receiver>I2cConfig</receiver>
|
||||
<slot>reject()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>316</x>
|
||||
<y>260</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>286</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
</connections>
|
||||
</ui>
|
||||
535
DSLogic-gui/pv/decoder/serialconfig.ui
Normal file
535
DSLogic-gui/pv/decoder/serialconfig.ui
Normal file
@@ -0,0 +1,535 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<ui version="4.0">
|
||||
<class>SerialConfig</class>
|
||||
<widget class="QDialog" name="SerialConfig">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>0</x>
|
||||
<y>0</y>
|
||||
<width>434</width>
|
||||
<height>507</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="minimumSize">
|
||||
<size>
|
||||
<width>434</width>
|
||||
<height>507</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="maximumSize">
|
||||
<size>
|
||||
<width>434</width>
|
||||
<height>507</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="windowTitle">
|
||||
<string>Dialog</string>
|
||||
</property>
|
||||
<widget class="QDialogButtonBox" name="buttonBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>70</x>
|
||||
<y>460</y>
|
||||
<width>341</width>
|
||||
<height>32</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="orientation">
|
||||
<enum>Qt::Horizontal</enum>
|
||||
</property>
|
||||
<property name="standardButtons">
|
||||
<set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
|
||||
</property>
|
||||
</widget>
|
||||
<widget class="QGroupBox" name="groupBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>30</x>
|
||||
<y>20</y>
|
||||
<width>351</width>
|
||||
<height>81</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="title">
|
||||
<string>Probes Setting</string>
|
||||
</property>
|
||||
<widget class="QWidget" name="layoutWidget">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>20</x>
|
||||
<y>30</y>
|
||||
<width>331</width>
|
||||
<height>41</height>
|
||||
</rect>
|
||||
</property>
|
||||
<layout class="QFormLayout" name="formLayout">
|
||||
<property name="fieldGrowthPolicy">
|
||||
<enum>QFormLayout::AllNonFixedFieldsGrow</enum>
|
||||
</property>
|
||||
<property name="verticalSpacing">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<property name="bottomMargin">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<item row="0" column="0">
|
||||
<widget class="QLabel" name="label">
|
||||
<property name="sizePolicy">
|
||||
<sizepolicy hsizetype="Fixed" vsizetype="Fixed">
|
||||
<horstretch>0</horstretch>
|
||||
<verstretch>0</verstretch>
|
||||
</sizepolicy>
|
||||
</property>
|
||||
<property name="text">
|
||||
<string>Serial </string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="0" column="1">
|
||||
<widget class="QComboBox" name="serial_comboBox"/>
|
||||
</item>
|
||||
</layout>
|
||||
</widget>
|
||||
</widget>
|
||||
<widget class="QGroupBox" name="groupBox_2">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>30</x>
|
||||
<y>120</y>
|
||||
<width>351</width>
|
||||
<height>301</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="title">
|
||||
<string>Mode Setting</string>
|
||||
</property>
|
||||
<widget class="QWidget" name="layoutWidget_2">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>20</x>
|
||||
<y>30</y>
|
||||
<width>331</width>
|
||||
<height>261</height>
|
||||
</rect>
|
||||
</property>
|
||||
<layout class="QFormLayout" name="formLayout_2">
|
||||
<property name="fieldGrowthPolicy">
|
||||
<enum>QFormLayout::AllNonFixedFieldsGrow</enum>
|
||||
</property>
|
||||
<property name="verticalSpacing">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<property name="bottomMargin">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<item row="0" column="0">
|
||||
<widget class="QLabel" name="label_5">
|
||||
<property name="sizePolicy">
|
||||
<sizepolicy hsizetype="Fixed" vsizetype="Fixed">
|
||||
<horstretch>0</horstretch>
|
||||
<verstretch>0</verstretch>
|
||||
</sizepolicy>
|
||||
</property>
|
||||
<property name="text">
|
||||
<string>Baudrate</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="0" column="1">
|
||||
<widget class="QComboBox" name="baud_comboBox">
|
||||
<property name="currentIndex">
|
||||
<number>6</number>
|
||||
</property>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>150</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>300</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>600</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>1200</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>2400</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>4800</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>9600</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>14400</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>19200</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>28800</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>38400</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>57600</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>76800</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>115200</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>230400</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>460800</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>921600</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="1" column="1">
|
||||
<widget class="QCheckBox" name="baud_checkBox">
|
||||
<property name="text">
|
||||
<string>Use Autobaud</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="2" column="0">
|
||||
<widget class="QLabel" name="label_6">
|
||||
<property name="text">
|
||||
<string>Stopbits</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="2" column="1">
|
||||
<widget class="QComboBox" name="stopbits_comboBox">
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>1</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>1.5</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>2</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="3" column="0">
|
||||
<widget class="QLabel" name="label_7">
|
||||
<property name="text">
|
||||
<string>Parity</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="3" column="1">
|
||||
<widget class="QComboBox" name="parity_comboBox">
|
||||
<property name="currentIndex">
|
||||
<number>0</number>
|
||||
</property>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>No Parity</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>Odd Parity</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>Even Parity</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="4" column="0">
|
||||
<widget class="QLabel" name="label_8">
|
||||
<property name="text">
|
||||
<string>Bit Order</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="4" column="1">
|
||||
<widget class="QComboBox" name="order_comboBox">
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>LSB - Least Significant Bit First</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>MSB - Most Significant Bit First</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="5" column="0">
|
||||
<widget class="QLabel" name="label_9">
|
||||
<property name="text">
|
||||
<string>Bits</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="5" column="1">
|
||||
<widget class="QComboBox" name="bits_comboBox">
|
||||
<property name="currentIndex">
|
||||
<number>4</number>
|
||||
</property>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>4</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>5</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>6</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>7</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>8</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>9</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>10</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>11</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>12</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>13</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>14</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>15</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>16</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>17</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>18</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>19</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>20</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>21</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>22</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>23</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>24</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>25</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>26</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>27</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>28</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>29</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>30</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>31</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>32</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="6" column="0">
|
||||
<widget class="QLabel" name="label_10">
|
||||
<property name="text">
|
||||
<string>Idle level</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="6" column="1">
|
||||
<widget class="QComboBox" name="idle_comboBox">
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>High - start = L, stop = H</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>Low - start = H, stop = L</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
</layout>
|
||||
</widget>
|
||||
</widget>
|
||||
<zorder>groupBox</zorder>
|
||||
<zorder>buttonBox</zorder>
|
||||
<zorder>groupBox_2</zorder>
|
||||
</widget>
|
||||
<resources/>
|
||||
<connections>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>accepted()</signal>
|
||||
<receiver>SerialConfig</receiver>
|
||||
<slot>accept()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>248</x>
|
||||
<y>254</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>157</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>rejected()</signal>
|
||||
<receiver>SerialConfig</receiver>
|
||||
<slot>reject()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>316</x>
|
||||
<y>260</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>286</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
</connections>
|
||||
</ui>
|
||||
381
DSLogic-gui/pv/decoder/spiconfig.ui
Normal file
381
DSLogic-gui/pv/decoder/spiconfig.ui
Normal file
@@ -0,0 +1,381 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<ui version="4.0">
|
||||
<class>SpiConfig</class>
|
||||
<widget class="QDialog" name="SpiConfig">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>0</x>
|
||||
<y>0</y>
|
||||
<width>442</width>
|
||||
<height>535</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="minimumSize">
|
||||
<size>
|
||||
<width>442</width>
|
||||
<height>535</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="maximumSize">
|
||||
<size>
|
||||
<width>442</width>
|
||||
<height>535</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="windowTitle">
|
||||
<string>Dialog</string>
|
||||
</property>
|
||||
<widget class="QDialogButtonBox" name="buttonBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>70</x>
|
||||
<y>480</y>
|
||||
<width>341</width>
|
||||
<height>32</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="orientation">
|
||||
<enum>Qt::Horizontal</enum>
|
||||
</property>
|
||||
<property name="standardButtons">
|
||||
<set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
|
||||
</property>
|
||||
</widget>
|
||||
<widget class="QGroupBox" name="groupBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>20</x>
|
||||
<y>20</y>
|
||||
<width>351</width>
|
||||
<height>191</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="title">
|
||||
<string>Probes Setting</string>
|
||||
</property>
|
||||
<widget class="QWidget" name="layoutWidget">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>30</x>
|
||||
<y>30</y>
|
||||
<width>241</width>
|
||||
<height>145</height>
|
||||
</rect>
|
||||
</property>
|
||||
<layout class="QFormLayout" name="formLayout">
|
||||
<property name="fieldGrowthPolicy">
|
||||
<enum>QFormLayout::AllNonFixedFieldsGrow</enum>
|
||||
</property>
|
||||
<property name="verticalSpacing">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<property name="bottomMargin">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<item row="0" column="0">
|
||||
<widget class="QLabel" name="label">
|
||||
<property name="sizePolicy">
|
||||
<sizepolicy hsizetype="Fixed" vsizetype="Fixed">
|
||||
<horstretch>0</horstretch>
|
||||
<verstretch>0</verstretch>
|
||||
</sizepolicy>
|
||||
</property>
|
||||
<property name="text">
|
||||
<string>SSn </string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="0" column="1">
|
||||
<widget class="QComboBox" name="ssn_comboBox"/>
|
||||
</item>
|
||||
<item row="1" column="0">
|
||||
<widget class="QLabel" name="label_2">
|
||||
<property name="text">
|
||||
<string>SCLK </string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="1" column="1">
|
||||
<widget class="QComboBox" name="sclk_comboBox"/>
|
||||
</item>
|
||||
<item row="2" column="0">
|
||||
<widget class="QLabel" name="label_3">
|
||||
<property name="text">
|
||||
<string>MOSI</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="2" column="1">
|
||||
<widget class="QComboBox" name="mosi_comboBox"/>
|
||||
</item>
|
||||
<item row="3" column="0">
|
||||
<widget class="QLabel" name="label_4">
|
||||
<property name="text">
|
||||
<string>MISO</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="3" column="1">
|
||||
<widget class="QComboBox" name="miso_comboBox"/>
|
||||
</item>
|
||||
</layout>
|
||||
</widget>
|
||||
</widget>
|
||||
<widget class="QGroupBox" name="groupBox_2">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>30</x>
|
||||
<y>230</y>
|
||||
<width>351</width>
|
||||
<height>221</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="title">
|
||||
<string>Mode Setting</string>
|
||||
</property>
|
||||
<widget class="QWidget" name="layoutWidget_2">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>20</x>
|
||||
<y>30</y>
|
||||
<width>311</width>
|
||||
<height>181</height>
|
||||
</rect>
|
||||
</property>
|
||||
<layout class="QFormLayout" name="formLayout_2">
|
||||
<property name="fieldGrowthPolicy">
|
||||
<enum>QFormLayout::AllNonFixedFieldsGrow</enum>
|
||||
</property>
|
||||
<property name="verticalSpacing">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<property name="bottomMargin">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<item row="0" column="0">
|
||||
<widget class="QLabel" name="label_5">
|
||||
<property name="sizePolicy">
|
||||
<sizepolicy hsizetype="Fixed" vsizetype="Fixed">
|
||||
<horstretch>0</horstretch>
|
||||
<verstretch>0</verstretch>
|
||||
</sizepolicy>
|
||||
</property>
|
||||
<property name="text">
|
||||
<string>CPOL</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="0" column="1">
|
||||
<widget class="QComboBox" name="cpol_comboBox">
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>0 - Clock is Low when Inactive</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>1 - Clock is High when Inactive</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="1" column="0">
|
||||
<widget class="QLabel" name="label_6">
|
||||
<property name="text">
|
||||
<string>CPHA</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="1" column="1">
|
||||
<widget class="QComboBox" name="cpha_comboBox">
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>0 - Data is Valid on Clock Rising Edge</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>1 - Data is Valid on Clock Falling Edge</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="2" column="0">
|
||||
<widget class="QLabel" name="label_7">
|
||||
<property name="text">
|
||||
<string>Bits</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="2" column="1">
|
||||
<widget class="QComboBox" name="bits_comboBox">
|
||||
<property name="currentIndex">
|
||||
<number>4</number>
|
||||
</property>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>4</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>5</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>6</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>7</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>8</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>9</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>10</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>11</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>12</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>13</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>14</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>15</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>16</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>24</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>32</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="3" column="0">
|
||||
<widget class="QLabel" name="label_8">
|
||||
<property name="text">
|
||||
<string>Order</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="3" column="1">
|
||||
<widget class="QComboBox" name="order_comboBox">
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>MSB - Most Significant Bit First</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>LSB - Least Significant Bit First</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="4" column="0">
|
||||
<widget class="QLabel" name="label_9">
|
||||
<property name="text">
|
||||
<string>SSn</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="4" column="1">
|
||||
<widget class="QComboBox" name="cs_comboBox">
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>SSn is Active Low</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>SSn is Active High</string>
|
||||
</property>
|
||||
</item>
|
||||
<item>
|
||||
<property name="text">
|
||||
<string>Don't use SSn</string>
|
||||
</property>
|
||||
</item>
|
||||
</widget>
|
||||
</item>
|
||||
</layout>
|
||||
</widget>
|
||||
</widget>
|
||||
<zorder>groupBox</zorder>
|
||||
<zorder>buttonBox</zorder>
|
||||
<zorder>groupBox_2</zorder>
|
||||
</widget>
|
||||
<resources/>
|
||||
<connections>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>accepted()</signal>
|
||||
<receiver>SpiConfig</receiver>
|
||||
<slot>accept()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>248</x>
|
||||
<y>254</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>157</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>rejected()</signal>
|
||||
<receiver>SpiConfig</receiver>
|
||||
<slot>reject()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>316</x>
|
||||
<y>260</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>286</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
</connections>
|
||||
</ui>
|
||||
103
DSLogic-gui/pv/decoder/wire1config.ui
Normal file
103
DSLogic-gui/pv/decoder/wire1config.ui
Normal file
@@ -0,0 +1,103 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<ui version="4.0">
|
||||
<class>Wire1Config</class>
|
||||
<widget class="QDialog" name="Wire1Config">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>0</x>
|
||||
<y>0</y>
|
||||
<width>360</width>
|
||||
<height>150</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="minimumSize">
|
||||
<size>
|
||||
<width>360</width>
|
||||
<height>150</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="maximumSize">
|
||||
<size>
|
||||
<width>360</width>
|
||||
<height>150</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="windowTitle">
|
||||
<string>Dialog</string>
|
||||
</property>
|
||||
<widget class="QDialogButtonBox" name="buttonBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>10</x>
|
||||
<y>100</y>
|
||||
<width>341</width>
|
||||
<height>32</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="orientation">
|
||||
<enum>Qt::Horizontal</enum>
|
||||
</property>
|
||||
<property name="standardButtons">
|
||||
<set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
|
||||
</property>
|
||||
</widget>
|
||||
<widget class="QComboBox" name="probe_comboBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>120</x>
|
||||
<y>40</y>
|
||||
<width>151</width>
|
||||
<height>20</height>
|
||||
</rect>
|
||||
</property>
|
||||
</widget>
|
||||
<widget class="QLabel" name="label">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>40</x>
|
||||
<y>40</y>
|
||||
<width>84</width>
|
||||
<height>16</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="text">
|
||||
<string>1-Wire</string>
|
||||
</property>
|
||||
</widget>
|
||||
</widget>
|
||||
<resources/>
|
||||
<connections>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>accepted()</signal>
|
||||
<receiver>Wire1Config</receiver>
|
||||
<slot>accept()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>248</x>
|
||||
<y>254</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>157</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>rejected()</signal>
|
||||
<receiver>Wire1Config</receiver>
|
||||
<slot>reject()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>316</x>
|
||||
<y>260</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>286</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
</connections>
|
||||
</ui>
|
||||
228
DSLogic-gui/pv/devicemanager.cpp
Normal file
228
DSLogic-gui/pv/devicemanager.cpp
Normal file
@@ -0,0 +1,228 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "devicemanager.h"
|
||||
#include "sigsession.h"
|
||||
|
||||
#include <cassert>
|
||||
#include <sstream>
|
||||
#include <stdexcept>
|
||||
#include <string>
|
||||
|
||||
#include <QObject>
|
||||
#include <QDebug>
|
||||
|
||||
#include <libsigrok4DSLogic/libsigrok.h>
|
||||
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
|
||||
DeviceManager::DeviceManager(struct sr_context *sr_ctx) :
|
||||
_sr_ctx(sr_ctx)
|
||||
{
|
||||
init_drivers();
|
||||
scan_all_drivers();
|
||||
}
|
||||
|
||||
DeviceManager::~DeviceManager()
|
||||
{
|
||||
release_devices();
|
||||
}
|
||||
|
||||
const std::list<sr_dev_inst*>& DeviceManager::devices() const
|
||||
{
|
||||
return _devices;
|
||||
}
|
||||
|
||||
int DeviceManager::use_device(sr_dev_inst *sdi, SigSession *owner)
|
||||
{
|
||||
assert(sdi);
|
||||
assert(owner);
|
||||
|
||||
if (sr_dev_open(sdi) != SR_OK)
|
||||
return SR_ERR;
|
||||
|
||||
_used_devices[sdi] = owner;
|
||||
return SR_OK;
|
||||
}
|
||||
|
||||
void DeviceManager::release_device(sr_dev_inst *sdi)
|
||||
{
|
||||
assert(sdi);
|
||||
|
||||
// Notify the owner, and removed the device from the used device list
|
||||
_used_devices[sdi]->release_device(sdi);
|
||||
_used_devices.erase(sdi);
|
||||
|
||||
sr_dev_close(sdi);
|
||||
}
|
||||
|
||||
list<sr_dev_inst*> DeviceManager::driver_scan(
|
||||
struct sr_dev_driver *const driver, GSList *const drvopts)
|
||||
{
|
||||
list<sr_dev_inst*> driver_devices;
|
||||
|
||||
assert(driver);
|
||||
|
||||
// Remove any device instances from this driver from the device
|
||||
// list. They will not be valid after the scan.
|
||||
list<sr_dev_inst*>::iterator i = _devices.begin();
|
||||
while (i != _devices.end()) {
|
||||
if ((*i)->driver == driver)
|
||||
i = _devices.erase(i);
|
||||
else
|
||||
i++;
|
||||
}
|
||||
|
||||
// Release this driver and all it's attached devices
|
||||
release_driver(driver);
|
||||
|
||||
// Do the scan
|
||||
GSList *const devices = sr_driver_scan(driver, drvopts);
|
||||
for (GSList *l = devices; l; l = l->next)
|
||||
driver_devices.push_back((sr_dev_inst*)l->data);
|
||||
g_slist_free(devices);
|
||||
driver_devices.sort(compare_devices);
|
||||
|
||||
// Add the scanned devices to the main list
|
||||
_devices.insert(_devices.end(), driver_devices.begin(),
|
||||
driver_devices.end());
|
||||
_devices.sort(compare_devices);
|
||||
|
||||
return driver_devices;
|
||||
}
|
||||
|
||||
string DeviceManager::format_device_title(const sr_dev_inst *const sdi)
|
||||
{
|
||||
ostringstream s;
|
||||
|
||||
assert(sdi);
|
||||
|
||||
if (sdi->vendor && sdi->vendor[0]) {
|
||||
s << sdi->vendor;
|
||||
if ((sdi->model && sdi->model[0]) ||
|
||||
(sdi->version && sdi->version[0]))
|
||||
s << ' ';
|
||||
}
|
||||
|
||||
if (sdi->model && sdi->model[0]) {
|
||||
s << sdi->model;
|
||||
if (sdi->version && sdi->version[0])
|
||||
s << ' ';
|
||||
}
|
||||
|
||||
if (sdi->version && sdi->version[0])
|
||||
s << sdi->version;
|
||||
|
||||
return s.str();
|
||||
}
|
||||
|
||||
void DeviceManager::init_drivers()
|
||||
{
|
||||
// Initialise all libsigrok drivers
|
||||
sr_dev_driver **const drivers = sr_driver_list();
|
||||
for (sr_dev_driver **driver = drivers; *driver; driver++) {
|
||||
if (sr_driver_init(_sr_ctx, *driver) != SR_OK) {
|
||||
throw runtime_error(
|
||||
string("Failed to initialize driver ") +
|
||||
string((*driver)->name));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void DeviceManager::release_devices()
|
||||
{
|
||||
// Release all the used devices
|
||||
for (map<sr_dev_inst*, SigSession*>::iterator i = _used_devices.begin();
|
||||
i != _used_devices.end();)
|
||||
release_device((*i++).first);
|
||||
|
||||
_used_devices.clear();
|
||||
|
||||
// Clear all the drivers
|
||||
sr_dev_driver **const drivers = sr_driver_list();
|
||||
for (sr_dev_driver **driver = drivers; *driver; driver++)
|
||||
sr_dev_clear(*driver);
|
||||
}
|
||||
|
||||
void DeviceManager::scan_all_drivers()
|
||||
{
|
||||
// Scan all drivers for all devices.
|
||||
struct sr_dev_driver **const drivers = sr_driver_list();
|
||||
for (struct sr_dev_driver **driver = drivers; *driver; driver++)
|
||||
driver_scan(*driver);
|
||||
}
|
||||
|
||||
void DeviceManager::release_driver(struct sr_dev_driver *const driver)
|
||||
{
|
||||
assert(driver);
|
||||
// map<sr_dev_inst*, SigSession*>::iterator i = _used_devices.begin();
|
||||
// while(i != _used_devices.end()) {
|
||||
// if((*i).first->driver == driver)
|
||||
// {
|
||||
// // Notify the current owner of the device
|
||||
// (*i).second->release_device((*i).first);
|
||||
|
||||
// // Close the device instance
|
||||
// sr_dev_close((*i).first);
|
||||
|
||||
// // Remove it from the used device list
|
||||
// i = _used_devices.erase(i);
|
||||
// } else {
|
||||
// i++;
|
||||
// }
|
||||
// }
|
||||
for (map<sr_dev_inst*, SigSession*>::iterator i = _used_devices.begin();
|
||||
i != _used_devices.end();)
|
||||
if((*i).first->driver == driver)
|
||||
{
|
||||
// Notify the current owner of the device
|
||||
(*i).second->release_device((*i).first);
|
||||
|
||||
// Close the device instance
|
||||
sr_dev_close((*i).first);
|
||||
|
||||
// Remove it from the used device list
|
||||
_used_devices.erase(i++);
|
||||
} else {
|
||||
i++;
|
||||
}
|
||||
|
||||
// Clear all the old device instances from this driver
|
||||
sr_dev_clear(driver);
|
||||
}
|
||||
|
||||
bool DeviceManager::compare_devices(const sr_dev_inst *const a,
|
||||
const sr_dev_inst *const b)
|
||||
{
|
||||
return format_device_title(a).compare(format_device_title(b)) < 0;
|
||||
}
|
||||
|
||||
int DeviceManager::test_device(sr_dev_inst *sdi)
|
||||
{
|
||||
assert(sdi);
|
||||
return sdi->driver->dev_test(sdi);
|
||||
}
|
||||
|
||||
} // namespace pv
|
||||
91
DSLogic-gui/pv/devicemanager.h
Normal file
91
DSLogic-gui/pv/devicemanager.h
Normal file
@@ -0,0 +1,91 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DEVICEMANAGER_H
|
||||
#define DSLOGIC_PV_DEVICEMANAGER_H
|
||||
|
||||
#include <glib.h>
|
||||
|
||||
#include <list>
|
||||
#include <map>
|
||||
#include <string>
|
||||
|
||||
#include <boost/function.hpp>
|
||||
#include <boost/shared_ptr.hpp>
|
||||
#include <boost/thread.hpp>
|
||||
|
||||
#include <QObject>
|
||||
#include <QString>
|
||||
|
||||
struct sr_context;
|
||||
struct sr_dev_driver;
|
||||
struct sr_dev_inst;
|
||||
struct libusbhp_t;
|
||||
struct libusbhp_device_t;
|
||||
|
||||
namespace pv {
|
||||
|
||||
class SigSession;
|
||||
|
||||
class DeviceManager
|
||||
{
|
||||
public:
|
||||
DeviceManager(struct sr_context *sr_ctx);
|
||||
|
||||
~DeviceManager();
|
||||
|
||||
const std::list<sr_dev_inst*>& devices() const;
|
||||
|
||||
int use_device(sr_dev_inst *sdi, SigSession *owner);
|
||||
|
||||
void release_device(sr_dev_inst *sdi);
|
||||
|
||||
std::list<sr_dev_inst*> driver_scan(
|
||||
struct sr_dev_driver *const driver,
|
||||
GSList *const drvopts = NULL);
|
||||
|
||||
static std::string format_device_title(const sr_dev_inst *const sdi);
|
||||
|
||||
void scan_all_drivers();
|
||||
|
||||
int test_device(sr_dev_inst *sdi);
|
||||
|
||||
private:
|
||||
void init_drivers();
|
||||
|
||||
void release_devices();
|
||||
|
||||
void release_driver(struct sr_dev_driver *const driver);
|
||||
|
||||
static bool compare_devices(const sr_dev_inst *const a,
|
||||
const sr_dev_inst *const b);
|
||||
|
||||
private:
|
||||
struct sr_context *const _sr_ctx;
|
||||
std::list<sr_dev_inst*> _devices;
|
||||
std::map<sr_dev_inst*, pv::SigSession*> _used_devices;
|
||||
};
|
||||
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DEVICEMANAGER_H
|
||||
58
DSLogic-gui/pv/dialogs/about.cpp
Normal file
58
DSLogic-gui/pv/dialogs/about.cpp
Normal file
@@ -0,0 +1,58 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include <QTextDocument>
|
||||
|
||||
#include "about.h"
|
||||
#include <ui_about.h>
|
||||
|
||||
/* __STDC_FORMAT_MACROS is required for PRIu64 and friends (in C++). */
|
||||
#define __STDC_FORMAT_MACROS
|
||||
#include <glib.h>
|
||||
#include <libsigrok4DSLogic/libsigrok.h>
|
||||
|
||||
|
||||
namespace pv {
|
||||
namespace dialogs {
|
||||
|
||||
About::About(QWidget *parent) :
|
||||
QDialog(parent),
|
||||
ui(new Ui::About)
|
||||
{
|
||||
ui->setupUi(this);
|
||||
|
||||
/* Setup the version field */
|
||||
ui->versionInfo->setText(tr("%1 %2<br /><a href=\"%4\">%4</a>")
|
||||
.arg(QApplication::applicationName())
|
||||
.arg(QApplication::applicationVersion())
|
||||
.arg(QApplication::organizationDomain()));
|
||||
ui->versionInfo->setOpenExternalLinks(true);
|
||||
}
|
||||
|
||||
About::~About()
|
||||
{
|
||||
delete ui;
|
||||
}
|
||||
|
||||
} // namespace dialogs
|
||||
} // namespace pv
|
||||
53
DSLogic-gui/pv/dialogs/about.h
Normal file
53
DSLogic-gui/pv/dialogs/about.h
Normal file
@@ -0,0 +1,53 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_ABOUT_H
|
||||
#define DSLOGIC_PV_ABOUT_H
|
||||
|
||||
#include <QDialog>
|
||||
|
||||
#include <memory>
|
||||
|
||||
namespace Ui {
|
||||
class About;
|
||||
}
|
||||
|
||||
namespace pv {
|
||||
namespace dialogs {
|
||||
|
||||
class About : public QDialog
|
||||
{
|
||||
Q_OBJECT
|
||||
|
||||
public:
|
||||
explicit About(QWidget *parent = 0);
|
||||
~About();
|
||||
|
||||
private:
|
||||
Ui::About *ui;
|
||||
};
|
||||
|
||||
} // namespace dialogs
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_ABOUT_H
|
||||
62
DSLogic-gui/pv/dialogs/about.ui
Normal file
62
DSLogic-gui/pv/dialogs/about.ui
Normal file
@@ -0,0 +1,62 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<ui version="4.0">
|
||||
<class>About</class>
|
||||
<widget class="QDialog" name="About">
|
||||
<property name="windowModality">
|
||||
<enum>Qt::WindowModal</enum>
|
||||
</property>
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>0</x>
|
||||
<y>0</y>
|
||||
<width>600</width>
|
||||
<height>320</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="minimumSize">
|
||||
<size>
|
||||
<width>600</width>
|
||||
<height>320</height>
|
||||
</size>
|
||||
</property>
|
||||
<property name="windowTitle">
|
||||
<string>About</string>
|
||||
</property>
|
||||
<property name="whatsThis">
|
||||
<string/>
|
||||
</property>
|
||||
<layout class="QVBoxLayout" name="verticalLayout">
|
||||
<item>
|
||||
<layout class="QVBoxLayout" name="verticalLayout_2">
|
||||
<item>
|
||||
<widget class="QLabel" name="icon">
|
||||
<property name="text">
|
||||
<string/>
|
||||
</property>
|
||||
<property name="pixmap">
|
||||
<pixmap resource="../../DSLogic.qrc">:/icons/dsl_logo.png</pixmap>
|
||||
</property>
|
||||
<property name="alignment">
|
||||
<set>Qt::AlignCenter</set>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item>
|
||||
<widget class="QLabel" name="versionInfo">
|
||||
<property name="text">
|
||||
<string/>
|
||||
</property>
|
||||
<property name="alignment">
|
||||
<set>Qt::AlignCenter</set>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
</layout>
|
||||
</item>
|
||||
</layout>
|
||||
</widget>
|
||||
<resources>
|
||||
<include location="../../DSLogic.qrc"/>
|
||||
</resources>
|
||||
<connections/>
|
||||
</ui>
|
||||
223
DSLogic-gui/pv/dialogs/connect.cpp
Normal file
223
DSLogic-gui/pv/dialogs/connect.cpp
Normal file
@@ -0,0 +1,223 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include <boost/foreach.hpp>
|
||||
|
||||
#include "connect.h"
|
||||
|
||||
#include "pv/devicemanager.h"
|
||||
|
||||
extern "C" {
|
||||
/* __STDC_FORMAT_MACROS is required for PRIu64 and friends (in C++). */
|
||||
#define __STDC_FORMAT_MACROS
|
||||
#include <glib.h>
|
||||
#include <libsigrok4DSLogic/libsigrok.h>
|
||||
}
|
||||
|
||||
using namespace std;
|
||||
|
||||
extern sr_context *sr_ctx;
|
||||
|
||||
namespace pv {
|
||||
namespace dialogs {
|
||||
|
||||
Connect::Connect(QWidget *parent, pv::DeviceManager &device_manager) :
|
||||
QDialog(parent),
|
||||
_device_manager(device_manager),
|
||||
_layout(this),
|
||||
_form(this),
|
||||
_form_layout(&_form),
|
||||
_drivers(&_form),
|
||||
_serial_device(&_form),
|
||||
_scan_button(tr("Scan for Devices"), this),
|
||||
_device_list(this),
|
||||
_button_box(QDialogButtonBox::Ok | QDialogButtonBox::Cancel,
|
||||
Qt::Horizontal, this)
|
||||
{
|
||||
setWindowTitle(tr("Connect to Device"));
|
||||
|
||||
connect(&_button_box, SIGNAL(accepted()), this, SLOT(accept()));
|
||||
connect(&_button_box, SIGNAL(rejected()), this, SLOT(reject()));
|
||||
|
||||
populate_drivers();
|
||||
connect(&_drivers, SIGNAL(activated(int)),
|
||||
this, SLOT(device_selected(int)));
|
||||
|
||||
_form.setLayout(&_form_layout);
|
||||
_form_layout.addRow(tr("Driver"), &_drivers);
|
||||
|
||||
_form_layout.addRow(tr("Serial Port"), &_serial_device);
|
||||
|
||||
unset_connection();
|
||||
|
||||
connect(&_scan_button, SIGNAL(pressed()),
|
||||
this, SLOT(scan_pressed()));
|
||||
|
||||
setLayout(&_layout);
|
||||
_layout.addWidget(&_form);
|
||||
_layout.addWidget(&_scan_button);
|
||||
_layout.addWidget(&_device_list);
|
||||
_layout.addWidget(&_button_box);
|
||||
}
|
||||
|
||||
struct sr_dev_inst* Connect::get_selected_device() const
|
||||
{
|
||||
const QListWidgetItem *const item = _device_list.currentItem();
|
||||
if (!item)
|
||||
return NULL;
|
||||
|
||||
return (sr_dev_inst*)item->data(Qt::UserRole).value<void*>();
|
||||
}
|
||||
|
||||
void Connect::populate_drivers()
|
||||
{
|
||||
gsize num_opts = 0;
|
||||
const int32_t *hwopts;
|
||||
struct sr_dev_driver **drivers = sr_driver_list();
|
||||
GVariant *gvar_opts;
|
||||
|
||||
for (int i = 0; drivers[i]; ++i) {
|
||||
/**
|
||||
* We currently only support devices that can deliver
|
||||
* samples at a fixed samplerate i.e. oscilloscopes and
|
||||
* logic analysers.
|
||||
* @todo Add support for non-monotonic devices i.e. DMMs
|
||||
* and sensors.
|
||||
*/
|
||||
bool supported_device = false;
|
||||
if ((sr_config_list(drivers[i], SR_CONF_DEVICE_OPTIONS,
|
||||
&gvar_opts, NULL) == SR_OK)) {
|
||||
hwopts = (const int32_t *)g_variant_get_fixed_array(gvar_opts,
|
||||
&num_opts, sizeof(int32_t));
|
||||
for (unsigned int j = 0; j < num_opts; j++)
|
||||
if (hwopts[j] == SR_CONF_SAMPLERATE) {
|
||||
supported_device = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (supported_device)
|
||||
_drivers.addItem(QString("%1 (%2)").arg(
|
||||
drivers[i]->longname).arg(drivers[i]->name),
|
||||
qVariantFromValue((void*)drivers[i]));
|
||||
}
|
||||
}
|
||||
|
||||
void Connect::unset_connection()
|
||||
{
|
||||
_device_list.clear();
|
||||
_serial_device.hide();
|
||||
_form_layout.labelForField(&_serial_device)->hide();
|
||||
_button_box.button(QDialogButtonBox::Ok)->setDisabled(true);
|
||||
}
|
||||
|
||||
void Connect::set_serial_connection()
|
||||
{
|
||||
_serial_device.show();
|
||||
_form_layout.labelForField(&_serial_device)->show();
|
||||
}
|
||||
|
||||
void Connect::scan_pressed()
|
||||
{
|
||||
_device_list.clear();
|
||||
|
||||
const int index = _drivers.currentIndex();
|
||||
if (index == -1)
|
||||
return;
|
||||
|
||||
sr_dev_driver *const driver = (sr_dev_driver*)_drivers.itemData(
|
||||
index).value<void*>();
|
||||
|
||||
GSList *drvopts = NULL;
|
||||
|
||||
if (_serial_device.isVisible()) {
|
||||
sr_config *const src = (sr_config*)g_try_malloc(sizeof(sr_config));
|
||||
src->key = SR_CONF_CONN;
|
||||
const QByteArray byteArray = _serial_device.text().toUtf8();
|
||||
src->data = g_variant_new_string((const gchar*)byteArray.constData());
|
||||
drvopts = g_slist_append(drvopts, src);
|
||||
}
|
||||
|
||||
const list<sr_dev_inst*> devices = _device_manager.driver_scan(
|
||||
driver, drvopts);
|
||||
|
||||
g_slist_free_full(drvopts, (GDestroyNotify)free_drvopts);
|
||||
|
||||
BOOST_FOREACH(sr_dev_inst *const sdi, devices)
|
||||
{
|
||||
const string title = DeviceManager::format_device_title(sdi);
|
||||
QString text(title.c_str());
|
||||
if (sdi->probes) {
|
||||
text += QString(" with %1 probes").arg(
|
||||
g_slist_length(sdi->probes));
|
||||
}
|
||||
|
||||
QListWidgetItem *const item = new QListWidgetItem(text,
|
||||
&_device_list);
|
||||
item->setData(Qt::UserRole, qVariantFromValue((void*)sdi));
|
||||
_device_list.addItem(item);
|
||||
}
|
||||
|
||||
_device_list.setCurrentRow(0);
|
||||
_button_box.button(QDialogButtonBox::Ok)->setDisabled(false);
|
||||
}
|
||||
|
||||
void Connect::device_selected(int index)
|
||||
{
|
||||
gsize num_opts = 0;
|
||||
const int32_t *hwopts;
|
||||
GVariant *gvar_list;
|
||||
sr_dev_driver *const driver = (sr_dev_driver*)_drivers.itemData(
|
||||
index).value<void*>();
|
||||
|
||||
unset_connection();
|
||||
|
||||
if ((sr_config_list(driver, SR_CONF_SCAN_OPTIONS,
|
||||
&gvar_list, NULL) == SR_OK)) {
|
||||
hwopts = (const int32_t *)g_variant_get_fixed_array(gvar_list,
|
||||
&num_opts, sizeof(int32_t));
|
||||
|
||||
for (unsigned int i = 0; i < num_opts; i++) {
|
||||
switch(hwopts[i]) {
|
||||
case SR_CONF_SERIALCOMM:
|
||||
set_serial_connection();
|
||||
break;
|
||||
|
||||
default:
|
||||
continue;
|
||||
}
|
||||
|
||||
break;
|
||||
}
|
||||
g_variant_unref(gvar_list);
|
||||
}
|
||||
}
|
||||
|
||||
void Connect::free_drvopts(struct sr_config *src)
|
||||
{
|
||||
g_variant_unref(src->data);
|
||||
g_free(src);
|
||||
}
|
||||
|
||||
} // namespace dialogs
|
||||
} // namespace pv
|
||||
90
DSLogic-gui/pv/dialogs/connect.h
Normal file
90
DSLogic-gui/pv/dialogs/connect.h
Normal file
@@ -0,0 +1,90 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_CONNECT_H
|
||||
#define DSLOGIC_PV_CONNECT_H
|
||||
|
||||
#include <QComboBox>
|
||||
#include <QDialog>
|
||||
#include <QDialogButtonBox>
|
||||
#include <QFormLayout>
|
||||
#include <QLineEdit>
|
||||
#include <QListWidget>
|
||||
#include <QPushButton>
|
||||
#include <QVBoxLayout>
|
||||
|
||||
struct sr_config;
|
||||
struct sr_dev_inst;
|
||||
|
||||
namespace pv {
|
||||
|
||||
class DeviceManager;
|
||||
|
||||
namespace dialogs {
|
||||
|
||||
class Connect : public QDialog
|
||||
{
|
||||
Q_OBJECT
|
||||
|
||||
public:
|
||||
Connect(QWidget *parent, pv::DeviceManager &device_manager);
|
||||
|
||||
struct sr_dev_inst* get_selected_device() const;
|
||||
|
||||
private:
|
||||
void populate_drivers();
|
||||
|
||||
void unset_connection();
|
||||
|
||||
void set_serial_connection();
|
||||
|
||||
private slots:
|
||||
void device_selected(int index);
|
||||
|
||||
void scan_pressed();
|
||||
|
||||
private:
|
||||
static void free_drvopts(sr_config *src);
|
||||
|
||||
private:
|
||||
pv::DeviceManager &_device_manager;
|
||||
|
||||
QVBoxLayout _layout;
|
||||
|
||||
QWidget _form;
|
||||
QFormLayout _form_layout;
|
||||
|
||||
QComboBox _drivers;
|
||||
|
||||
QLineEdit _serial_device;
|
||||
|
||||
QPushButton _scan_button;
|
||||
QListWidget _device_list;
|
||||
|
||||
QDialogButtonBox _button_box;
|
||||
};
|
||||
|
||||
} // namespace dialogs
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_CONNECT_H
|
||||
190
DSLogic-gui/pv/dialogs/deviceoptions.cpp
Normal file
190
DSLogic-gui/pv/dialogs/deviceoptions.cpp
Normal file
@@ -0,0 +1,190 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "deviceoptions.h"
|
||||
|
||||
#include <boost/foreach.hpp>
|
||||
|
||||
#include <QFormLayout>
|
||||
#include <QListWidget>
|
||||
|
||||
#include <pv/prop/property.h>
|
||||
|
||||
using namespace boost;
|
||||
using namespace std;
|
||||
|
||||
namespace pv {
|
||||
namespace dialogs {
|
||||
|
||||
DeviceOptions::DeviceOptions(QWidget *parent, struct sr_dev_inst *sdi) :
|
||||
QDialog(parent),
|
||||
_sdi(sdi),
|
||||
_layout(this),
|
||||
_probes_box(tr("Channels"), this),
|
||||
_props_box(tr("Mode"), this),
|
||||
_mode_comboBox(this),
|
||||
_button_box(QDialogButtonBox::Ok | QDialogButtonBox::Cancel,
|
||||
Qt::Horizontal, this),
|
||||
_device_options_binding(sdi)
|
||||
{
|
||||
setWindowTitle(tr("Configure Device"));
|
||||
setLayout(&_layout);
|
||||
|
||||
_mode_comboBox.addItem(mode_strings[LOGIC]);
|
||||
_mode_comboBox.addItem(mode_strings[ANALOG]);
|
||||
_mode_comboBox.setCurrentIndex(_sdi->mode);
|
||||
_props_box.setLayout(&_props_box_layout);
|
||||
_props_box_layout.addWidget(get_property_form());
|
||||
_layout.addWidget(&_props_box);
|
||||
|
||||
setup_probes();
|
||||
_probes_box.setLayout(&_probes_box_layout);
|
||||
|
||||
_layout.addWidget(&_probes_box);
|
||||
_layout.addStretch(1);
|
||||
_layout.addWidget(&_button_box);
|
||||
|
||||
connect(&_button_box, SIGNAL(accepted()), this, SLOT(accept()));
|
||||
connect(&_button_box, SIGNAL(rejected()), this, SLOT(reject()));
|
||||
|
||||
connect(&_mode_comboBox, SIGNAL(currentIndexChanged(QString)),
|
||||
this, SLOT(mode_changed(QString)));
|
||||
}
|
||||
|
||||
void DeviceOptions::accept()
|
||||
{
|
||||
using namespace Qt;
|
||||
|
||||
QDialog::accept();
|
||||
|
||||
// Commit the properties
|
||||
const vector< shared_ptr<pv::prop::Property> > &properties =
|
||||
_device_options_binding.properties();
|
||||
BOOST_FOREACH(shared_ptr<pv::prop::Property> p, properties) {
|
||||
assert(p);
|
||||
p->commit();
|
||||
}
|
||||
|
||||
// Commit the probes
|
||||
int index = 0;
|
||||
for (const GSList *l = _sdi->probes; l; l = l->next) {
|
||||
sr_probe *const probe = (sr_probe*)l->data;
|
||||
assert(probe);
|
||||
|
||||
probe->enabled = (_probes_checkBox_list.at(index)->checkState() == Qt::Checked);
|
||||
index++;
|
||||
}
|
||||
}
|
||||
|
||||
QWidget* DeviceOptions::get_property_form()
|
||||
{
|
||||
QWidget *const form = new QWidget(this);
|
||||
QFormLayout *const layout = new QFormLayout(form);
|
||||
form->setLayout(layout);
|
||||
|
||||
layout->addRow("Device Mode", &_mode_comboBox);
|
||||
const vector< shared_ptr<pv::prop::Property> > &properties =
|
||||
_device_options_binding.properties();
|
||||
BOOST_FOREACH(shared_ptr<pv::prop::Property> p, properties)
|
||||
{
|
||||
assert(p);
|
||||
const QString label = p->labeled_widget() ? QString() : p->name();
|
||||
layout->addRow(label, p->get_widget(form));
|
||||
}
|
||||
|
||||
return form;
|
||||
}
|
||||
|
||||
void DeviceOptions::setup_probes()
|
||||
{
|
||||
using namespace Qt;
|
||||
|
||||
int row = 0, col = 0;
|
||||
int index = 0;
|
||||
|
||||
while(_probes_box_layout.count() > 0)
|
||||
{
|
||||
//remove Widgets in QLayoutGrid
|
||||
QWidget* widget = _probes_box_layout.itemAt(0)->widget();
|
||||
_probes_box_layout.removeWidget(widget);
|
||||
delete widget;
|
||||
}
|
||||
_probes_label_list.clear();
|
||||
_probes_checkBox_list.clear();
|
||||
|
||||
for (const GSList *l = _sdi->probes; l; l = l->next) {
|
||||
sr_probe *const probe = (sr_probe*)l->data;
|
||||
assert(probe);
|
||||
|
||||
QLabel *probe_label = new QLabel(QString::number(probe->index), this);
|
||||
QCheckBox *probe_checkBox = new QCheckBox(this);
|
||||
probe_checkBox->setCheckState(probe->enabled ? Qt::Checked : Qt::Unchecked);
|
||||
_probes_box_layout.addWidget(probe_label, row * 2, col);
|
||||
_probes_box_layout.addWidget(probe_checkBox, row * 2 + 1, col);
|
||||
_probes_label_list.push_back(probe_label);
|
||||
_probes_checkBox_list.push_back(probe_checkBox);
|
||||
|
||||
index++;
|
||||
col = index % 8;
|
||||
row = index / 8;
|
||||
}
|
||||
|
||||
QPushButton *_enable_all_probes = new QPushButton("Enable All", this);
|
||||
QPushButton *_disable_all_probes = new QPushButton("Disable All", this);
|
||||
|
||||
connect(_enable_all_probes, SIGNAL(clicked()),
|
||||
this, SLOT(enable_all_probes()));
|
||||
connect(_disable_all_probes, SIGNAL(clicked()),
|
||||
this, SLOT(disable_all_probes()));
|
||||
|
||||
_probes_box_layout.addWidget(_enable_all_probes, (row + 1) * 2, 0, 1, 4);
|
||||
_probes_box_layout.addWidget(_disable_all_probes, (row + 1) * 2, 4, 1, 4);
|
||||
}
|
||||
|
||||
void DeviceOptions::set_all_probes(bool set)
|
||||
{
|
||||
QVector<QCheckBox *>::iterator i = _probes_checkBox_list.begin();
|
||||
while(i != _probes_checkBox_list.end()) {
|
||||
(*i)->setCheckState(set ? Qt::Checked : Qt::Unchecked);
|
||||
i++;
|
||||
}
|
||||
}
|
||||
|
||||
void DeviceOptions::enable_all_probes()
|
||||
{
|
||||
set_all_probes(true);
|
||||
}
|
||||
|
||||
void DeviceOptions::disable_all_probes()
|
||||
{
|
||||
set_all_probes(false);
|
||||
}
|
||||
|
||||
void DeviceOptions::mode_changed(QString mode)
|
||||
{
|
||||
sr_config_set(_sdi, SR_CONF_DEVICE_MODE, g_variant_new_string(mode.toLocal8Bit()));
|
||||
setup_probes();
|
||||
}
|
||||
|
||||
} // namespace dialogs
|
||||
} // namespace pv
|
||||
90
DSLogic-gui/pv/dialogs/deviceoptions.h
Normal file
90
DSLogic-gui/pv/dialogs/deviceoptions.h
Normal file
@@ -0,0 +1,90 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_DEVICEOPTIONS_H
|
||||
#define DSLOGIC_PV_DEVICEOPTIONS_H
|
||||
|
||||
#include <QDialog>
|
||||
#include <QDialogButtonBox>
|
||||
#include <QGroupBox>
|
||||
#include <QVBoxLayout>
|
||||
#include <QHBoxLayout>
|
||||
#include <QGridLayout>
|
||||
#include <QPushButton>
|
||||
#include <QVector>
|
||||
#include <QLabel>
|
||||
#include <QCheckBox>
|
||||
#include <QComboBox>
|
||||
#include <QRadioButton>
|
||||
|
||||
#include <pv/prop/binding/deviceoptions.h>
|
||||
|
||||
namespace pv {
|
||||
namespace dialogs {
|
||||
|
||||
class DeviceOptions : public QDialog
|
||||
{
|
||||
Q_OBJECT
|
||||
|
||||
public:
|
||||
DeviceOptions(QWidget *parent, struct sr_dev_inst *sdi);
|
||||
|
||||
protected:
|
||||
void accept();
|
||||
|
||||
private:
|
||||
|
||||
QWidget* get_property_form();
|
||||
|
||||
void setup_probes();
|
||||
|
||||
void set_all_probes(bool set);
|
||||
|
||||
private slots:
|
||||
void enable_all_probes();
|
||||
void disable_all_probes();
|
||||
void mode_changed(QString mode);
|
||||
|
||||
private:
|
||||
struct sr_dev_inst *const _sdi;
|
||||
|
||||
QVBoxLayout _layout;
|
||||
|
||||
QGroupBox _probes_box;
|
||||
QGridLayout _probes_box_layout;
|
||||
QVector <QLabel *> _probes_label_list;
|
||||
QVector <QCheckBox *> _probes_checkBox_list;
|
||||
|
||||
QGroupBox _props_box;
|
||||
QComboBox _mode_comboBox;
|
||||
QVBoxLayout _props_box_layout;
|
||||
|
||||
QDialogButtonBox _button_box;
|
||||
|
||||
pv::prop::binding::DeviceOptions _device_options_binding;
|
||||
};
|
||||
|
||||
} // namespace dialogs
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_DEVICEOPTIONS_H
|
||||
69
DSLogic-gui/pv/dialogs/search.cpp
Normal file
69
DSLogic-gui/pv/dialogs/search.cpp
Normal file
@@ -0,0 +1,69 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "search.h"
|
||||
#include "ui_search.h"
|
||||
#include <assert.h>
|
||||
|
||||
namespace pv {
|
||||
namespace dialogs {
|
||||
|
||||
Search::Search(QWidget *parent, struct sr_dev_inst *sdi, QString pattern) :
|
||||
QDialog(parent),
|
||||
ui(new Ui::Search),
|
||||
_sdi(sdi)
|
||||
{
|
||||
assert(_sdi);
|
||||
ui->setupUi(this);
|
||||
|
||||
QRegExp value_rx("[10XRFCxrfc ]+");
|
||||
QValidator *value_validator = new QRegExpValidator(value_rx, this);
|
||||
|
||||
//ui->_value_lineEdit->setText("X X X X X X X X X X X X X X X X");
|
||||
ui->_value_lineEdit->setText(pattern);
|
||||
ui->_value_lineEdit->setValidator(value_validator);
|
||||
ui->_value_lineEdit->setMaxLength(16 * 2 - 1);
|
||||
ui->_value_lineEdit->setInputMask("X X X X X X X X X X X X X X X X");
|
||||
}
|
||||
|
||||
Search::~Search()
|
||||
{
|
||||
delete ui;
|
||||
}
|
||||
|
||||
void Search::accept()
|
||||
{
|
||||
using namespace Qt;
|
||||
|
||||
QDialog::accept();
|
||||
}
|
||||
|
||||
QString Search::get_pattern()
|
||||
{
|
||||
QString pattern = ui->_value_lineEdit->text();
|
||||
//pattern.remove(QChar('/r'), Qt::CaseInsensitive);
|
||||
return pattern;
|
||||
}
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
66
DSLogic-gui/pv/dialogs/search.h
Normal file
66
DSLogic-gui/pv/dialogs/search.h
Normal file
@@ -0,0 +1,66 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_SEARCH_H
|
||||
#define DSLOGIC_PV_SEARCH_H
|
||||
|
||||
#include <QDialog>
|
||||
#include <QLabel>
|
||||
#include <QLineEdit>
|
||||
#include "../sigsession.h"
|
||||
#include <libsigrok4DSLogic/libsigrok.h>
|
||||
|
||||
namespace Ui {
|
||||
class Search;
|
||||
}
|
||||
|
||||
namespace pv {
|
||||
namespace dialogs {
|
||||
|
||||
class Search : public QDialog
|
||||
{
|
||||
Q_OBJECT
|
||||
|
||||
public:
|
||||
|
||||
Search(QWidget *parent = 0, sr_dev_inst *sdi = 0, QString pattern = "");
|
||||
~Search();
|
||||
|
||||
QString get_pattern();
|
||||
|
||||
protected:
|
||||
void accept();
|
||||
|
||||
signals:
|
||||
|
||||
public slots:
|
||||
|
||||
private:
|
||||
Ui::Search *ui;
|
||||
sr_dev_inst *_sdi;
|
||||
};
|
||||
|
||||
} // namespace decoder
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_SEARCH_H
|
||||
166
DSLogic-gui/pv/dialogs/search.ui
Normal file
166
DSLogic-gui/pv/dialogs/search.ui
Normal file
@@ -0,0 +1,166 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<ui version="4.0">
|
||||
<class>Search</class>
|
||||
<widget class="QDialog" name="Search">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>0</x>
|
||||
<y>0</y>
|
||||
<width>486</width>
|
||||
<height>231</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="windowTitle">
|
||||
<string>Search</string>
|
||||
</property>
|
||||
<widget class="QDialogButtonBox" name="buttonBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>130</x>
|
||||
<y>180</y>
|
||||
<width>341</width>
|
||||
<height>32</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="orientation">
|
||||
<enum>Qt::Horizontal</enum>
|
||||
</property>
|
||||
<property name="standardButtons">
|
||||
<set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
|
||||
</property>
|
||||
</widget>
|
||||
<widget class="QWidget" name="gridLayoutWidget">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>40</x>
|
||||
<y>20</y>
|
||||
<width>351</width>
|
||||
<height>204</height>
|
||||
</rect>
|
||||
</property>
|
||||
<layout class="QGridLayout" name="gridLayout">
|
||||
<property name="bottomMargin">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<property name="verticalSpacing">
|
||||
<number>16</number>
|
||||
</property>
|
||||
<item row="2" column="3">
|
||||
<widget class="QLineEdit" name="_value_lineEdit"/>
|
||||
</item>
|
||||
<item row="2" column="2">
|
||||
<widget class="QLabel" name="label">
|
||||
<property name="text">
|
||||
<string>Search Value</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item row="3" column="2">
|
||||
<layout class="QVBoxLayout" name="verticalLayout_2">
|
||||
<property name="bottomMargin">
|
||||
<number>6</number>
|
||||
</property>
|
||||
<item>
|
||||
<widget class="QLabel" name="label_5">
|
||||
<property name="text">
|
||||
<string>X: Don't care</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item>
|
||||
<widget class="QLabel" name="label_6">
|
||||
<property name="text">
|
||||
<string>0: Low level</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item>
|
||||
<widget class="QLabel" name="label_7">
|
||||
<property name="text">
|
||||
<string>1: High level</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item>
|
||||
<widget class="QLabel" name="label_4">
|
||||
<property name="text">
|
||||
<string>R: Rising edge</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item>
|
||||
<widget class="QLabel" name="label_8">
|
||||
<property name="text">
|
||||
<string>F: Falling edge</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item>
|
||||
<widget class="QLabel" name="label_9">
|
||||
<property name="text">
|
||||
<string>C: Rising/Falling edge</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
</layout>
|
||||
</item>
|
||||
<item row="1" column="3">
|
||||
<layout class="QVBoxLayout" name="verticalLayout">
|
||||
<property name="spacing">
|
||||
<number>0</number>
|
||||
</property>
|
||||
<item>
|
||||
<widget class="QLabel" name="label_3">
|
||||
<property name="text">
|
||||
<string>1 1 1 1 1 1</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
<item>
|
||||
<widget class="QLabel" name="label_2">
|
||||
<property name="text">
|
||||
<string>5 4 3 2 1 0 9 8 7 6 5 4 3 2 1 0</string>
|
||||
</property>
|
||||
</widget>
|
||||
</item>
|
||||
</layout>
|
||||
</item>
|
||||
</layout>
|
||||
</widget>
|
||||
</widget>
|
||||
<resources/>
|
||||
<connections>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>accepted()</signal>
|
||||
<receiver>Search</receiver>
|
||||
<slot>accept()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>248</x>
|
||||
<y>254</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>157</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>rejected()</signal>
|
||||
<receiver>Search</receiver>
|
||||
<slot>reject()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>316</x>
|
||||
<y>260</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>286</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
</connections>
|
||||
</ui>
|
||||
91
DSLogic-gui/pv/dialogs/trig.ui
Normal file
91
DSLogic-gui/pv/dialogs/trig.ui
Normal file
@@ -0,0 +1,91 @@
|
||||
<?xml version="1.0" encoding="UTF-8"?>
|
||||
<ui version="4.0">
|
||||
<class>Trig</class>
|
||||
<widget class="QDialog" name="Trig">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>0</x>
|
||||
<y>0</y>
|
||||
<width>597</width>
|
||||
<height>481</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="windowTitle">
|
||||
<string>Dialog</string>
|
||||
</property>
|
||||
<widget class="QDialogButtonBox" name="buttonBox">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>230</x>
|
||||
<y>390</y>
|
||||
<width>341</width>
|
||||
<height>32</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="orientation">
|
||||
<enum>Qt::Horizontal</enum>
|
||||
</property>
|
||||
<property name="standardButtons">
|
||||
<set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
|
||||
</property>
|
||||
</widget>
|
||||
<widget class="QSplitter" name="splitter">
|
||||
<property name="geometry">
|
||||
<rect>
|
||||
<x>40</x>
|
||||
<y>40</y>
|
||||
<width>411</width>
|
||||
<height>21</height>
|
||||
</rect>
|
||||
</property>
|
||||
<property name="orientation">
|
||||
<enum>Qt::Horizontal</enum>
|
||||
</property>
|
||||
<widget class="QLabel" name="label">
|
||||
<property name="text">
|
||||
<string>Trigger Positon: </string>
|
||||
</property>
|
||||
</widget>
|
||||
<widget class="QSlider" name="horizontalSlider">
|
||||
<property name="orientation">
|
||||
<enum>Qt::Horizontal</enum>
|
||||
</property>
|
||||
</widget>
|
||||
</widget>
|
||||
</widget>
|
||||
<resources/>
|
||||
<connections>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>accepted()</signal>
|
||||
<receiver>Trig</receiver>
|
||||
<slot>accept()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>248</x>
|
||||
<y>254</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>157</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
<connection>
|
||||
<sender>buttonBox</sender>
|
||||
<signal>rejected()</signal>
|
||||
<receiver>Trig</receiver>
|
||||
<slot>reject()</slot>
|
||||
<hints>
|
||||
<hint type="sourcelabel">
|
||||
<x>316</x>
|
||||
<y>260</y>
|
||||
</hint>
|
||||
<hint type="destinationlabel">
|
||||
<x>286</x>
|
||||
<y>274</y>
|
||||
</hint>
|
||||
</hints>
|
||||
</connection>
|
||||
</connections>
|
||||
</ui>
|
||||
42
DSLogic-gui/pv/dock/fakelineedit.cpp
Normal file
42
DSLogic-gui/pv/dock/fakelineedit.cpp
Normal file
@@ -0,0 +1,42 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
#include "fakelineedit.h"
|
||||
#include <QMouseEvent>
|
||||
|
||||
namespace pv {
|
||||
namespace dock {
|
||||
|
||||
FakeLineEdit::FakeLineEdit(QLineEdit *parent) :
|
||||
QLineEdit(parent)
|
||||
{
|
||||
}
|
||||
|
||||
void FakeLineEdit::mousePressEvent(QMouseEvent *event)
|
||||
{
|
||||
if (event->button() & Qt::LeftButton) {
|
||||
trigger();
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace dock
|
||||
} // namespace pv
|
||||
53
DSLogic-gui/pv/dock/fakelineedit.h
Normal file
53
DSLogic-gui/pv/dock/fakelineedit.h
Normal file
@@ -0,0 +1,53 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
#ifndef FAKELINEEDIT_H
|
||||
#define FAKELINEEDIT_H
|
||||
|
||||
#include <QLineEdit>
|
||||
|
||||
namespace pv {
|
||||
|
||||
class SigSession;
|
||||
|
||||
namespace dock {
|
||||
|
||||
class FakeLineEdit : public QLineEdit
|
||||
{
|
||||
Q_OBJECT
|
||||
public:
|
||||
explicit FakeLineEdit(QLineEdit *parent = 0);
|
||||
|
||||
private:
|
||||
void mousePressEvent(QMouseEvent * event);
|
||||
|
||||
signals:
|
||||
void trigger();
|
||||
|
||||
public slots:
|
||||
|
||||
};
|
||||
|
||||
} // namespace dock
|
||||
} // namespace pv
|
||||
|
||||
#endif // FAKELINEEDIT_H
|
||||
237
DSLogic-gui/pv/dock/measuredock.cpp
Normal file
237
DSLogic-gui/pv/dock/measuredock.cpp
Normal file
@@ -0,0 +1,237 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "measuredock.h"
|
||||
#include "../sigsession.h"
|
||||
#include "../view/cursor.h"
|
||||
#include "../view/view.h"
|
||||
#include "../view/timemarker.h"
|
||||
#include "../view/ruler.h"
|
||||
|
||||
#include <QObject>
|
||||
#include <QPainter>
|
||||
#include <QRegExpValidator>
|
||||
|
||||
namespace pv {
|
||||
namespace dock {
|
||||
|
||||
using namespace pv::view;
|
||||
|
||||
MeasureDock::MeasureDock(QWidget *parent, View &view, SigSession &session) :
|
||||
QWidget(parent),
|
||||
_session(session),
|
||||
_view(view)
|
||||
{
|
||||
|
||||
_mouse_groupBox = new QGroupBox("Mouse measurement", this);
|
||||
_fen_checkBox = new QCheckBox("Enable floating measurement", this);
|
||||
_fen_checkBox->setChecked(true);
|
||||
_width_label = new QLabel(view.get_mm_width(), this);
|
||||
_period_label = new QLabel(view.get_mm_period(), this);
|
||||
_freq_label = new QLabel(view.get_mm_freq(), this);
|
||||
|
||||
_mouse_layout = new QGridLayout();
|
||||
_mouse_layout->addWidget(_fen_checkBox, 0, 0, 1, 2);
|
||||
_mouse_layout->addWidget(new QLabel("Width: ", this), 1, 0);
|
||||
_mouse_layout->addWidget(_width_label, 1, 1);
|
||||
_mouse_layout->addWidget(new QLabel("Period: ", this), 2, 0);
|
||||
_mouse_layout->addWidget(_period_label, 2, 1);
|
||||
_mouse_layout->addWidget(new QLabel("Freqency: ", this), 3, 0);
|
||||
_mouse_layout->addWidget(_freq_label, 3, 1);
|
||||
_mouse_layout->addWidget(new QLabel(this), 0, 2);
|
||||
_mouse_layout->addWidget(new QLabel(this), 1, 2);
|
||||
_mouse_layout->addWidget(new QLabel(this), 2, 2);
|
||||
_mouse_layout->addWidget(new QLabel(this), 3, 2);
|
||||
_mouse_layout->setColumnStretch(2, 1);
|
||||
_mouse_groupBox->setLayout(_mouse_layout);
|
||||
|
||||
|
||||
_cursor_groupBox = new QGroupBox("Cursor measurement", this);
|
||||
_t1_comboBox = new QComboBox(this);
|
||||
_t2_comboBox = new QComboBox(this);
|
||||
_delta_label = new QLabel("#####", this);
|
||||
_cnt_label = new QLabel("#####", this);
|
||||
|
||||
_cursor_layout = new QGridLayout();
|
||||
_cursor_layout->addWidget(new QLabel("T1: ", this), 0, 0);
|
||||
_cursor_layout->addWidget(_t1_comboBox, 0, 1);
|
||||
_cursor_layout->addWidget(new QLabel("T2: ", this), 1, 0);
|
||||
_cursor_layout->addWidget(_t2_comboBox, 1, 1);
|
||||
_cursor_layout->addWidget(new QLabel("|T2 - T1|: ", this), 2, 0);
|
||||
_cursor_layout->addWidget(_delta_label, 2, 1);
|
||||
_cursor_layout->addWidget(new QLabel("Delta Samples: ", this), 2, 2);
|
||||
_cursor_layout->addWidget(_cnt_label, 2, 3);
|
||||
|
||||
_cursor_layout->addWidget(new QLabel("Cursors", this), 4, 0);
|
||||
_cursor_layout->addWidget(new QLabel("Time/Samples", this), 4, 1);
|
||||
_cursor_layout->addWidget(new QLabel("Sample Value", this), 4, 2);
|
||||
_cursor_layout->addWidget(new QLabel("Value Radix", this), 4, 3);
|
||||
|
||||
_cursor_layout->addWidget(new QLabel(this), 0, 4);
|
||||
_cursor_layout->addWidget(new QLabel(this), 1, 4);
|
||||
_cursor_layout->addWidget(new QLabel(this), 2, 4);
|
||||
_cursor_layout->addWidget(new QLabel(this), 3, 4);
|
||||
_cursor_layout->addWidget(new QLabel(this), 4, 4);
|
||||
|
||||
_cursor_layout->setColumnStretch(4, 1);
|
||||
_cursor_groupBox->setLayout(_cursor_layout);
|
||||
|
||||
QVBoxLayout *layout = new QVBoxLayout(this);
|
||||
layout->addWidget(_mouse_groupBox);
|
||||
layout->addWidget(_cursor_groupBox);
|
||||
layout->addStretch(1);
|
||||
setLayout(layout);
|
||||
|
||||
connect(_t1_comboBox, SIGNAL(currentIndexChanged(int)), this, SLOT(delta_update()));
|
||||
connect(_t2_comboBox, SIGNAL(currentIndexChanged(int)), this, SLOT(delta_update()));
|
||||
|
||||
connect(_fen_checkBox, SIGNAL(stateChanged(int)), &_view, SLOT(set_measure_en(int)));
|
||||
}
|
||||
|
||||
MeasureDock::~MeasureDock()
|
||||
{
|
||||
}
|
||||
|
||||
void MeasureDock::paintEvent(QPaintEvent *)
|
||||
{
|
||||
QStyleOption opt;
|
||||
opt.init(this);
|
||||
QPainter p(this);
|
||||
style()->drawPrimitive(QStyle::PE_Widget, &opt, &p, this);
|
||||
}
|
||||
|
||||
void MeasureDock::cursor_update()
|
||||
{
|
||||
int index = 1;
|
||||
|
||||
_t1_comboBox->clear();
|
||||
_t2_comboBox->clear();
|
||||
|
||||
if (!_cursor_pushButton_list.empty()) {
|
||||
for (QVector<QPushButton *>::Iterator i = _cursor_pushButton_list.begin();
|
||||
i != _cursor_pushButton_list.end(); i++)
|
||||
delete (*i);
|
||||
for (QVector<QLabel *>::Iterator i = _curpos_label_list.begin();
|
||||
i != _curpos_label_list.end(); i++)
|
||||
delete (*i);
|
||||
for (QVector<QLabel *>::Iterator i = _curvalue_label_list.begin();
|
||||
i != _curvalue_label_list.end(); i++)
|
||||
delete (*i);
|
||||
for (QVector<QComboBox *>::Iterator i = _radix_comboBox_list.begin();
|
||||
i != _radix_comboBox_list.end(); i++)
|
||||
delete (*i);
|
||||
for (QVector<QLabel *>::Iterator i = _space_label_list.begin();
|
||||
i != _space_label_list.end(); i++)
|
||||
delete (*i);
|
||||
|
||||
_cursor_pushButton_list.clear();
|
||||
_curpos_label_list.clear();
|
||||
_curvalue_label_list.clear();
|
||||
_radix_comboBox_list.clear();
|
||||
_space_label_list.clear();
|
||||
}
|
||||
|
||||
for(std::list<Cursor*>::iterator i = _view.get_cursorList().begin();
|
||||
i != _view.get_cursorList().end(); i++) {
|
||||
QString curCursor = "Cursor "+QString::number(index);
|
||||
_t1_comboBox->addItem(curCursor);
|
||||
_t2_comboBox->addItem(curCursor);
|
||||
|
||||
QPushButton *_cursor_pushButton = new QPushButton(curCursor, this);
|
||||
QLabel *_curpos_label = new QLabel(_view.get_cm_time(index - 1), this);
|
||||
QLabel *_curvalue_label = new QLabel("####", this);
|
||||
QComboBox *_radix_comboBox = new QComboBox(this);
|
||||
_radix_comboBox->addItem("Bin");
|
||||
_radix_comboBox->addItem("Oct");
|
||||
_radix_comboBox->addItem("Dec");
|
||||
_radix_comboBox->addItem("Hex");
|
||||
QLabel *_space_label = new QLabel(this);
|
||||
_cursor_pushButton_list.push_back(_cursor_pushButton);
|
||||
_curpos_label_list.push_back(_curpos_label);
|
||||
_curvalue_label_list.push_back(_curvalue_label);
|
||||
_radix_comboBox_list.push_back(_radix_comboBox);
|
||||
_space_label_list.push_back(_space_label);
|
||||
|
||||
_cursor_layout->addWidget(_cursor_pushButton, 4 + index, 0);
|
||||
_cursor_layout->addWidget(_curpos_label, 4 + index, 1);
|
||||
_cursor_layout->addWidget(_curvalue_label, 4 + index, 2);
|
||||
_cursor_layout->addWidget(_radix_comboBox, 4 + index, 3);
|
||||
_cursor_layout->addWidget(_space_label, 4 + index, 4);
|
||||
|
||||
connect(_cursor_pushButton, SIGNAL(clicked()), this, SLOT(goto_cursor()));
|
||||
|
||||
index++;
|
||||
}
|
||||
|
||||
update();
|
||||
}
|
||||
|
||||
void MeasureDock::mouse_moved()
|
||||
{
|
||||
_width_label->setText(_view.get_mm_width());
|
||||
_period_label->setText(_view.get_mm_period());
|
||||
_freq_label->setText(_view.get_mm_freq());
|
||||
}
|
||||
|
||||
void MeasureDock::cursor_moved()
|
||||
{
|
||||
//TimeMarker* grabbed_marker = _view.get_ruler()->get_grabbed_cursor();
|
||||
if (_view.cursors_shown()) {
|
||||
int index = 0;
|
||||
for(std::list<Cursor*>::iterator i = _view.get_cursorList().begin();
|
||||
i != _view.get_cursorList().end(); i++) {
|
||||
_curpos_label_list.at(index)->setText(_view.get_cm_time(index));
|
||||
//_curvalue_label_list.at(index)->setText(_view.get_cm_value(index));
|
||||
index++;
|
||||
}
|
||||
}
|
||||
delta_update();
|
||||
}
|
||||
|
||||
void MeasureDock::delta_update()
|
||||
{
|
||||
if (_t1_comboBox->count() != 0 && _t2_comboBox->count() != 0) {
|
||||
int t1_index = _t1_comboBox->currentIndex();
|
||||
int t2_index = _t2_comboBox->currentIndex();
|
||||
_delta_label->setText(_view.get_cm_delta(t1_index, t2_index));
|
||||
_cnt_label->setText(_view.get_cm_delta_cnt(t1_index, t2_index));
|
||||
}
|
||||
}
|
||||
|
||||
void MeasureDock::goto_cursor()
|
||||
{
|
||||
int index = 0;
|
||||
|
||||
for (QVector<QPushButton *>::Iterator i = _cursor_pushButton_list.begin();
|
||||
i != _cursor_pushButton_list.end(); i++) {
|
||||
QPushButton *button = qobject_cast<QPushButton *>(sender());
|
||||
if ((*i) == button) {
|
||||
_view.set_cursor_middle(index);
|
||||
break;
|
||||
}
|
||||
index++;
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace dock
|
||||
} // namespace pv
|
||||
107
DSLogic-gui/pv/dock/measuredock.h
Normal file
107
DSLogic-gui/pv/dock/measuredock.h
Normal file
@@ -0,0 +1,107 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_MEASUREDOCK_H
|
||||
#define DSLOGIC_PV_MEASUREDOCK_H
|
||||
|
||||
#include <QDockWidget>
|
||||
#include <QPushButton>
|
||||
#include <QComboBox>
|
||||
#include <QLabel>
|
||||
#include <QRadioButton>
|
||||
#include <QSlider>
|
||||
#include <QLineEdit>
|
||||
#include <QSpinBox>
|
||||
#include <QGroupBox>
|
||||
#include <QTableWidget>
|
||||
#include <QCheckBox>
|
||||
|
||||
#include <QVector>
|
||||
#include <QGridLayout>
|
||||
#include <QVBoxLayout>
|
||||
#include <QHBoxLayout>
|
||||
|
||||
#include <vector>
|
||||
|
||||
#include <libsigrok4DSLogic/libsigrok.h>
|
||||
|
||||
namespace pv {
|
||||
|
||||
class SigSession;
|
||||
|
||||
namespace view {
|
||||
class View;
|
||||
}
|
||||
|
||||
namespace dock {
|
||||
|
||||
class MeasureDock : public QWidget
|
||||
{
|
||||
Q_OBJECT
|
||||
|
||||
public:
|
||||
MeasureDock(QWidget *parent, pv::view::View &view, SigSession &session);
|
||||
~MeasureDock();
|
||||
|
||||
void paintEvent(QPaintEvent *);
|
||||
|
||||
signals:
|
||||
|
||||
private slots:
|
||||
void delta_update();
|
||||
void goto_cursor();
|
||||
|
||||
public slots:
|
||||
void cursor_update();
|
||||
void cursor_moved();
|
||||
void mouse_moved();
|
||||
|
||||
private:
|
||||
SigSession &_session;
|
||||
view::View &_view;
|
||||
|
||||
QGridLayout *_mouse_layout;
|
||||
QGroupBox *_mouse_groupBox;
|
||||
QCheckBox *_fen_checkBox;
|
||||
QLabel *_width_label;
|
||||
QLabel *_period_label;
|
||||
QLabel *_freq_label;
|
||||
|
||||
QGridLayout *_cursor_layout;
|
||||
QGroupBox *_cursor_groupBox;
|
||||
QComboBox *_t1_comboBox;
|
||||
QComboBox *_t2_comboBox;
|
||||
QLabel *_delta_label;
|
||||
QLabel *_cnt_label;
|
||||
|
||||
QVector <QPushButton *> _cursor_pushButton_list;
|
||||
QVector <QLabel *> _curpos_label_list;
|
||||
QVector <QLabel *> _curvalue_label_list;
|
||||
QVector <QComboBox *> _radix_comboBox_list;
|
||||
QVector <QLabel *> _space_label_list;
|
||||
};
|
||||
|
||||
} // namespace dock
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_MEASUREDOCK_H
|
||||
240
DSLogic-gui/pv/dock/protocoldock.cpp
Normal file
240
DSLogic-gui/pv/dock/protocoldock.cpp
Normal file
@@ -0,0 +1,240 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "protocoldock.h"
|
||||
#include "../decoder/democonfig.h"
|
||||
#include "../sigsession.h"
|
||||
|
||||
#include <QObject>
|
||||
#include <QHBoxLayout>
|
||||
#include <QPainter>
|
||||
#include <QMessageBox>
|
||||
|
||||
namespace pv {
|
||||
namespace dock {
|
||||
|
||||
ProtocolDock::ProtocolDock(QWidget *parent, SigSession &session) :
|
||||
QWidget(parent),
|
||||
_session(session)
|
||||
{
|
||||
QHBoxLayout *hori_layout = new QHBoxLayout();
|
||||
|
||||
_add_button = new QPushButton(this);
|
||||
_add_button->setFlat(true);
|
||||
_add_button->setIcon(QIcon::fromTheme("protocol",
|
||||
QIcon(":/icons/add.png")));
|
||||
_del_all_button = new QPushButton(this);
|
||||
_del_all_button->setFlat(true);
|
||||
_del_all_button->setIcon(QIcon::fromTheme("protocol",
|
||||
QIcon(":/icons/del.png")));
|
||||
_del_all_button->setCheckable(true);
|
||||
_protocol_combobox = new QComboBox(this);
|
||||
for (int i = 0; decoder::protocol_list[i] != NULL;) {
|
||||
_protocol_combobox->addItem(decoder::protocol_list[i]);
|
||||
i++;
|
||||
}
|
||||
hori_layout->addWidget(_add_button);
|
||||
hori_layout->addWidget(_del_all_button);
|
||||
hori_layout->addWidget(_protocol_combobox);
|
||||
hori_layout->addStretch(1);
|
||||
|
||||
connect(_add_button, SIGNAL(clicked()),
|
||||
this, SLOT(add_protocol()));
|
||||
connect(_del_all_button, SIGNAL(clicked()),
|
||||
this, SLOT(del_protocol()));
|
||||
|
||||
_layout = new QVBoxLayout();
|
||||
_layout->addLayout(hori_layout);
|
||||
_layout->addStretch(1);
|
||||
|
||||
setLayout(_layout);
|
||||
}
|
||||
|
||||
ProtocolDock::~ProtocolDock()
|
||||
{
|
||||
}
|
||||
|
||||
void ProtocolDock::paintEvent(QPaintEvent *)
|
||||
{
|
||||
QStyleOption opt;
|
||||
opt.init(this);
|
||||
QPainter p(this);
|
||||
style()->drawPrimitive(QStyle::PE_Widget, &opt, &p, this);
|
||||
}
|
||||
|
||||
void ProtocolDock::add_protocol()
|
||||
{
|
||||
if (_session.get_device()->mode != LOGIC) {
|
||||
QMessageBox msg(this);
|
||||
msg.setText("Protocol Analyzer");
|
||||
msg.setInformativeText("Protocol Analyzer is only valid in Digital Mode!");
|
||||
msg.setStandardButtons(QMessageBox::Ok);
|
||||
msg.setIcon(QMessageBox::Warning);
|
||||
msg.exec();
|
||||
} else {
|
||||
pv::decoder::DemoConfig dlg(this, _session.get_device(), _protocol_combobox->currentIndex());
|
||||
if (dlg.exec()) {
|
||||
std::list <int > _sel_probes = dlg.get_sel_probes();
|
||||
QMap <QString, QVariant>& _options = dlg.get_options();
|
||||
QMap <QString, int> _options_index = dlg.get_options_index();
|
||||
|
||||
QPushButton *_del_button = new QPushButton(this);
|
||||
QPushButton *_set_button = new QPushButton(this);
|
||||
_del_button->setFlat(true);
|
||||
_del_button->setIcon(QIcon::fromTheme("protocol",
|
||||
QIcon(":/icons/del.png")));
|
||||
_set_button->setFlat(true);
|
||||
_set_button->setIcon(QIcon::fromTheme("protocol",
|
||||
QIcon(":/icons/set.png")));
|
||||
QLabel *_protocol_label = new QLabel(this);
|
||||
|
||||
_del_button->setCheckable(true);
|
||||
_protocol_label->setText(_protocol_combobox->currentText());
|
||||
|
||||
connect(_del_button, SIGNAL(clicked()),
|
||||
this, SLOT(del_protocol()));
|
||||
connect(_set_button, SIGNAL(clicked()),
|
||||
this, SLOT(rst_protocol()));
|
||||
|
||||
_del_button_list.push_back(_del_button);
|
||||
_set_button_list.push_back(_set_button);
|
||||
_protocol_label_list.push_back(_protocol_label);
|
||||
_protocol_index_list.push_back(_protocol_combobox->currentIndex());
|
||||
|
||||
QHBoxLayout *hori_layout = new QHBoxLayout();
|
||||
hori_layout->addWidget(_set_button);
|
||||
hori_layout->addWidget(_del_button);
|
||||
hori_layout->addWidget(_protocol_label);
|
||||
hori_layout->addStretch(1);
|
||||
_hori_layout_list.push_back(hori_layout);
|
||||
_layout->insertLayout(_del_button_list.size(), hori_layout);
|
||||
|
||||
_session.add_protocol_analyzer(_protocol_combobox->currentIndex(), _sel_probes, _options, _options_index);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void ProtocolDock::rst_protocol()
|
||||
{
|
||||
int rst_index = 0;
|
||||
for (QVector <QPushButton *>::const_iterator i = _set_button_list.begin();
|
||||
i != _set_button_list.end(); i++) {
|
||||
QPushButton *button = qobject_cast<QPushButton *>(sender());
|
||||
if ((*i) == button) {
|
||||
pv::decoder::DemoConfig dlg(this, _session.get_device(), _protocol_index_list.at(rst_index));
|
||||
dlg.set_config(_session.get_decode_probes(rst_index), _session.get_decode_options_index(rst_index));
|
||||
if (dlg.exec()) {
|
||||
std::list <int > _sel_probes = dlg.get_sel_probes();
|
||||
QMap <QString, QVariant>& _options = dlg.get_options();
|
||||
QMap <QString, int> _options_index = dlg.get_options_index();
|
||||
|
||||
_session.rst_protocol_analyzer(rst_index, _sel_probes, _options, _options_index);
|
||||
}
|
||||
break;
|
||||
}
|
||||
rst_index++;
|
||||
}
|
||||
}
|
||||
|
||||
void ProtocolDock::del_protocol()
|
||||
{
|
||||
if (_del_all_button->isChecked()) {
|
||||
_del_all_button->setChecked(false);
|
||||
if (_hori_layout_list.size() > 0) {
|
||||
int del_index = 0;
|
||||
for (QVector <QHBoxLayout *>::const_iterator i = _hori_layout_list.begin();
|
||||
i != _hori_layout_list.end(); i++) {
|
||||
_layout->removeItem((*i));
|
||||
delete (*i);
|
||||
delete _del_button_list.at(del_index);
|
||||
delete _set_button_list.at(del_index);
|
||||
delete _protocol_label_list.at(del_index);
|
||||
|
||||
_session.del_protocol_analyzer(0);
|
||||
del_index++;
|
||||
}
|
||||
_hori_layout_list.clear();
|
||||
_del_button_list.clear();
|
||||
_set_button_list.clear();
|
||||
_protocol_label_list.clear();
|
||||
_protocol_index_list.clear();
|
||||
} else {
|
||||
QMessageBox msg(this);
|
||||
msg.setText("Protocol Analyzer");
|
||||
msg.setInformativeText("No Protocol Analyzer to delete!");
|
||||
msg.setStandardButtons(QMessageBox::Ok);
|
||||
msg.setIcon(QMessageBox::Warning);
|
||||
msg.exec();
|
||||
}
|
||||
} else {
|
||||
int del_index = 0;
|
||||
for (QVector <QPushButton *>::const_iterator i = _del_button_list.begin();
|
||||
i != _del_button_list.end(); i++) {
|
||||
if ((*i)->isChecked()) {
|
||||
_layout->removeItem(_hori_layout_list.at(del_index));
|
||||
|
||||
delete _hori_layout_list.at(del_index);
|
||||
delete _del_button_list.at(del_index);
|
||||
delete _set_button_list.at(del_index);
|
||||
delete _protocol_label_list.at(del_index);
|
||||
|
||||
_hori_layout_list.remove(del_index);
|
||||
_del_button_list.remove(del_index);
|
||||
_set_button_list.remove(del_index);
|
||||
_protocol_label_list.remove(del_index);
|
||||
_protocol_index_list.remove(del_index);
|
||||
|
||||
_session.del_protocol_analyzer(del_index);
|
||||
|
||||
break;
|
||||
}
|
||||
del_index++;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void ProtocolDock::del_all_protocol()
|
||||
{
|
||||
if (_hori_layout_list.size() > 0) {
|
||||
int del_index = 0;
|
||||
for (QVector <QHBoxLayout *>::const_iterator i = _hori_layout_list.begin();
|
||||
i != _hori_layout_list.end(); i++) {
|
||||
_layout->removeItem((*i));
|
||||
delete (*i);
|
||||
delete _del_button_list.at(del_index);
|
||||
delete _set_button_list.at(del_index);
|
||||
delete _protocol_label_list.at(del_index);
|
||||
|
||||
_session.del_protocol_analyzer(0);
|
||||
del_index++;
|
||||
}
|
||||
_hori_layout_list.clear();
|
||||
_del_button_list.clear();
|
||||
_set_button_list.clear();
|
||||
_protocol_label_list.clear();
|
||||
_protocol_index_list.clear();
|
||||
}
|
||||
}
|
||||
|
||||
} // namespace dock
|
||||
} // namespace pv
|
||||
85
DSLogic-gui/pv/dock/protocoldock.h
Normal file
85
DSLogic-gui/pv/dock/protocoldock.h
Normal file
@@ -0,0 +1,85 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#ifndef DSLOGIC_PV_PROTOCOLDOCK_H
|
||||
#define DSLOGIC_PV_PROTOCOLDOCK_H
|
||||
|
||||
#include <QDockWidget>
|
||||
#include <QPushButton>
|
||||
#include <QComboBox>
|
||||
#include <QLabel>
|
||||
#include <QVector>
|
||||
#include <QVBoxLayout>
|
||||
#include <QHBoxLayout>
|
||||
|
||||
#include <vector>
|
||||
|
||||
#include <libsigrok4DSLogic/libsigrok.h>
|
||||
|
||||
#include "../decoder/decoder.h"
|
||||
|
||||
namespace pv {
|
||||
|
||||
class SigSession;
|
||||
|
||||
namespace dock {
|
||||
|
||||
class ProtocolDock : public QWidget
|
||||
{
|
||||
Q_OBJECT
|
||||
|
||||
public:
|
||||
ProtocolDock(QWidget *parent, SigSession &session);
|
||||
~ProtocolDock();
|
||||
|
||||
void paintEvent(QPaintEvent *);
|
||||
|
||||
void del_all_protocol();
|
||||
|
||||
signals:
|
||||
|
||||
private slots:
|
||||
void add_protocol();
|
||||
void rst_protocol();
|
||||
void del_protocol();
|
||||
|
||||
private:
|
||||
|
||||
private:
|
||||
SigSession &_session;
|
||||
|
||||
QPushButton *_add_button;
|
||||
QPushButton *_del_all_button;
|
||||
QComboBox *_protocol_combobox;
|
||||
QVector <QPushButton *> _del_button_list;
|
||||
QVector <QPushButton *> _set_button_list;
|
||||
QVector <QLabel *> _protocol_label_list;
|
||||
QVector <int > _protocol_index_list;
|
||||
QVector <QHBoxLayout *> _hori_layout_list;
|
||||
QVBoxLayout *_layout;
|
||||
};
|
||||
|
||||
} // namespace dock
|
||||
} // namespace pv
|
||||
|
||||
#endif // DSLOGIC_PV_PROTOCOLDOCK_H
|
||||
332
DSLogic-gui/pv/dock/searchdock.cpp
Normal file
332
DSLogic-gui/pv/dock/searchdock.cpp
Normal file
@@ -0,0 +1,332 @@
|
||||
/*
|
||||
* This file is part of the DSLogic-gui project.
|
||||
* DSLogic-gui is based on PulseView.
|
||||
*
|
||||
* Copyright (C) 2012 Joel Holdsworth <joel@airwebreathe.org.uk>
|
||||
* Copyright (C) 2013 DreamSourceLab <dreamsourcelab@dreamsourcelab.com>
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program is distributed in the hope that it will be useful,
|
||||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
* GNU General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
|
||||
|
||||
#include "searchdock.h"
|
||||
#include "../sigsession.h"
|
||||
#include "../view/cursor.h"
|
||||
#include "../view/view.h"
|
||||
#include "../view/timemarker.h"
|
||||
#include "../view/ruler.h"
|
||||
#include "../dialogs/search.h"
|
||||
#include "../data/snapshot.h"
|
||||
#include "../data/logicsnapshot.h"
|
||||
|
||||
#include <QObject>
|
||||
#include <QPainter>
|
||||
#include <QRegExpValidator>
|
||||
#include <QRect>
|
||||
#include <QMouseEvent>
|
||||
#include <QMessageBox>
|
||||
|
||||
#include <stdint.h>
|
||||
#include <boost/shared_ptr.hpp>
|
||||
|
||||
namespace pv {
|
||||
namespace dock {
|
||||
|
||||
using namespace pv::view;
|
||||
|
||||
SearchDock::SearchDock(QWidget *parent, View &view, SigSession &session) :
|
||||
QWidget(parent),
|
||||
_session(session),
|
||||
_view(view)
|
||||
{
|
||||
_pattern = "X X X X X X X X X X X X X X X X";
|
||||
|
||||
connect(&_pre_button, SIGNAL(clicked()),
|
||||
this, SLOT(on_previous()));
|
||||
connect(&_nxt_button, SIGNAL(clicked()),
|
||||
this, SLOT(on_next()));
|
||||
|
||||
_pre_button.setIcon(QIcon::fromTheme("search",
|
||||
QIcon(":/icons/pre.png")));
|
||||
_nxt_button.setIcon(QIcon::fromTheme("search",
|
||||
QIcon(":/icons/next.png")));
|
||||
|
||||
QPushButton *_search_button = new QPushButton(this);
|
||||
_search_button->setIcon(QIcon::fromTheme("search",
|
||||
QIcon(":/icons/search.png")));
|
||||
_search_button->setFixedWidth(_search_button->height());
|
||||
_search_button->setDisabled(true);
|
||||
|
||||
QLineEdit *_search_parent = new QLineEdit(this);
|
||||
_search_parent->setVisible(false);
|
||||
_search_value = new FakeLineEdit(_search_parent);
|
||||
_search_value->setPlaceholderText(tr("search"));
|
||||
|
||||
QHBoxLayout *search_layout = new QHBoxLayout();
|
||||
search_layout->addWidget(_search_button);
|
||||
search_layout->addStretch();
|
||||
search_layout->setContentsMargins(0, 0, 0, 0);
|
||||
_search_value->setLayout(search_layout);
|
||||
_search_value->setTextMargins(_search_button->width(), 0, 0, 0);
|
||||
_search_value->setReadOnly(true);
|
||||
|
||||
connect(_search_value, SIGNAL(trigger()), this, SLOT(on_set()));
|
||||
|
||||
QHBoxLayout *layout = new QHBoxLayout();
|
||||
layout->addStretch(1);
|
||||
layout->addWidget(&_pre_button);
|
||||
layout->addWidget(_search_value);
|
||||
layout->addWidget(&_nxt_button);
|
||||
layout->addStretch(1);
|
||||
|
||||
setLayout(layout);
|
||||
}
|
||||
|
||||
SearchDock::~SearchDock()
|
||||
{
|
||||
}
|
||||
|
||||
void SearchDock::paintEvent(QPaintEvent *)
|
||||
{
|
||||
QStyleOption opt;
|
||||
opt.init(this);
|
||||
QPainter p(this);
|
||||
style()->drawPrimitive(QStyle::PE_Widget, &opt, &p, this);
|
||||
}
|
||||
|
||||
void SearchDock::on_previous()
|
||||
{
|
||||
uint64_t last_pos;
|
||||
uint8_t *data;
|
||||
int unit_size;
|
||||
uint64_t length;
|
||||
QString value = _search_value->text();
|
||||
search_previous(value);
|
||||
|
||||
last_pos = _view.get_search_pos();
|
||||
if (last_pos == 0) {
|
||||
QMessageBox msg(this);
|
||||
msg.setText("Search");
|
||||
msg.setInformativeText("Search cursor at the start position!");
|
||||
msg.setStandardButtons(QMessageBox::Ok);
|
||||
msg.setIcon(QMessageBox::Warning);
|
||||
msg.exec();
|
||||
return;
|
||||
} else {
|
||||
data = (uint8_t*)_session.get_buf(unit_size, length);
|
||||
if (data == NULL) {
|
||||
QMessageBox msg(this);
|
||||
msg.setText("Search");
|
||||
msg.setInformativeText("No Sample data!");
|
||||
msg.setStandardButtons(QMessageBox::Ok);
|
||||
msg.setIcon(QMessageBox::Warning);
|
||||
msg.exec();
|
||||
return;
|
||||
} else {
|
||||
const bool ret = search_value(data, unit_size, length, last_pos, 1, value);
|
||||
if (!ret) {
|
||||
QMessageBox msg(this);
|
||||
msg.setText("Search");
|
||||
msg.setInformativeText("Pattern " + value + " not found!");
|
||||
msg.setStandardButtons(QMessageBox::Ok);
|
||||
msg.setIcon(QMessageBox::Warning);
|
||||
msg.exec();
|
||||
return;
|
||||
} else {
|
||||
_view.set_search_pos(last_pos);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void SearchDock::on_next()
|
||||
{
|
||||
uint64_t last_pos;
|
||||
int unit_size;
|
||||
uint64_t length;
|
||||
uint8_t *data = (uint8_t*)_session.get_buf(unit_size, length);
|
||||
QString value = _search_value->text();
|
||||
search_previous(value);
|
||||
|
||||
last_pos = _view.get_search_pos();
|
||||
if (last_pos == length - 1) {
|
||||
QMessageBox msg(this);
|
||||
msg.setText("Search");
|
||||
msg.setInformativeText("Search cursor at the end position!");
|
||||
msg.setStandardButtons(QMessageBox::Ok);
|
||||
msg.setIcon(QMessageBox::Warning);
|
||||
msg.exec();
|
||||
return;
|
||||
} else {
|
||||
if (data == NULL) {
|
||||
QMessageBox msg(this);
|
||||
msg.setText("Search");
|
||||
msg.setInformativeText("No Sample data!");
|
||||
msg.setStandardButtons(QMessageBox::Ok);
|
||||
msg.setIcon(QMessageBox::Warning);
|
||||
msg.exec();
|
||||
return;
|
||||
} else {
|
||||
const int ret = search_value(data, unit_size, length, last_pos, 0, value);
|
||||
if (!ret) {
|
||||
QMessageBox msg(this);
|
||||
msg.setText("Search");
|
||||
msg.setInformativeText("Pattern " + value + " not found!");
|
||||
msg.setStandardButtons(QMessageBox::Ok);
|
||||
msg.setIcon(QMessageBox::Warning);
|
||||
msg.exec();
|
||||
return;
|
||||
} else {
|
||||
_view.set_search_pos(last_pos);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void SearchDock::on_set()
|
||||
{
|
||||
dialogs::Search dlg(this, _session.get_device(), _pattern);
|
||||
if (dlg.exec()) {
|
||||
_pattern = dlg.get_pattern();
|
||||
_pattern.remove(QChar(' '), Qt::CaseInsensitive);
|
||||
_pattern = _pattern.toUpper();
|
||||
_search_value->setText(_pattern);
|
||||
}
|
||||
}
|
||||
|
||||
bool SearchDock::search_value(const uint8_t *data, int unit_size, uint64_t length, uint64_t& pos, bool left, QString value)
|
||||
{
|
||||
QByteArray pattern = value.toUtf8();
|
||||
int i = 0;
|
||||
uint64_t match_pos = left ? pos - 1 : pos + 1;
|
||||
bool part_match = false;
|
||||
int match_bits = unit_size * 8 - 1;
|
||||
bool unmatch = false;
|
||||
|
||||
while(i <= match_bits) {
|
||||
unmatch = false;
|
||||
uint64_t pattern_mask = 1ULL << i;
|
||||
|
||||
if (pattern[match_bits - i] == 'X') {
|
||||
part_match = true;
|
||||
} else if (pattern[match_bits - i] == '0') {
|
||||
//while((match_pos >= 0 && left) || (match_pos < length && !left)) {
|
||||
while(left || (match_pos < length && !left)) {
|
||||
if (0 == ((*(uint64_t *)(data + match_pos * unit_size) & pattern_mask) != 0)) {
|
||||
part_match = true;
|
||||
break;
|
||||
} else if ((match_pos == 0 && left) || (match_pos == length - 1 && !left)) {
|
||||
unmatch = true;
|
||||
part_match = false;
|
||||
break;
|
||||
} else if (part_match) {
|
||||
unmatch = true;
|
||||
match_pos = left ? match_pos - 1 : match_pos + 1;
|
||||
i = 0;
|
||||
break;
|
||||
} else if (!part_match) {
|
||||
match_pos = left ? match_pos - 1 : match_pos + 1;
|
||||
}
|
||||
}
|
||||
} else if (pattern[match_bits - i] == '1') {
|
||||
//while((match_pos >= 0 && left) || (match_pos < length && !left)) {
|
||||
while(left || (match_pos < length && !left)) {
|
||||
if (1 == ((*(uint64_t *)(data + match_pos * unit_size) & pattern_mask) != 0)) {
|
||||
part_match = true;
|
||||
break;
|
||||
} else if ((match_pos == 0 && left) || (match_pos == length - 1 && !left)) {
|
||||
unmatch = true;
|
||||
part_match = false;
|
||||
break;
|
||||
} else if (part_match) {
|
||||
unmatch = true;
|
||||
match_pos = left ? match_pos - 1 : match_pos + 1;
|
||||
i = 0;
|
||||
break;
|
||||
} else if (!part_match) {
|
||||
match_pos = left ? match_pos - 1 : match_pos + 1;
|
||||
}
|
||||
}
|
||||
}else if (pattern[match_bits - i] == 'R') {
|
||||
while((match_pos > 0 && left) || (match_pos < length && !left)) {
|
||||
if (1 == ((*(uint64_t *)(data + match_pos * unit_size) & pattern_mask) != 0) &&
|
||||
0 == ((*(uint64_t *)(data + (match_pos - 1) * unit_size) & pattern_mask) != 0)) {
|
||||
part_match = true;
|
||||
break;
|
||||
} else if ((match_pos == 1 && left) || (match_pos == length - 1 && !left)) {
|
||||
unmatch = true;
|
||||
part_match = false;
|
||||
break;
|
||||
} else if (part_match) {
|
||||
unmatch = true;
|
||||
match_pos = left ? match_pos - 1 : match_pos + 1;
|
||||
i = 0;
|
||||
break;
|
||||
} else if (!part_match) {
|
||||
match_pos = left ? match_pos - 1 : match_pos + 1;
|
||||
}
|
||||
}
|
||||
} else if (pattern[match_bits - i] == 'F') {
|
||||
while((match_pos > 0 && left) || (match_pos < length && !left)) {
|
||||
if (0 == ((*(uint64_t *)(data + match_pos * unit_size) & pattern_mask) != 0) &&
|
||||
1 == ((*(uint64_t *)(data + (match_pos - 1) * unit_size) & pattern_mask) != 0)) {
|
||||
part_match = true;
|
||||
break;
|
||||
} else if ((match_pos == 1 && left) || (match_pos == length - 1 && !left)) {
|
||||
unmatch = true;
|
||||
part_match = false;
|
||||
break;
|
||||
} else if (part_match) {
|
||||
unmatch = true;
|
||||
match_pos = left ? match_pos - 1 : match_pos + 1;
|
||||
i = 0;
|
||||
break;
|
||||
} else if (!part_match) {
|
||||
match_pos = left ? match_pos - 1 : match_pos + 1;
|
||||
}
|
||||
}
|
||||
} else if (pattern[match_bits - i] == 'C') {
|
||||
while((match_pos > 0 && left) || (match_pos < length && !left)) {
|
||||
if (((*(uint64_t *)(data + match_pos * unit_size) & pattern_mask) != 0) !=
|
||||
((*(uint64_t *)(data + (match_pos - 1) * unit_size) & pattern_mask) != 0)) {
|
||||
part_match = true;
|
||||
break;
|
||||
} else if ((match_pos == 1 && left) || (match_pos == length - 1 && !left)) {
|
||||
unmatch = true;
|
||||
part_match = false;
|
||||
break;
|
||||
} else if (part_match) {
|
||||
unmatch = true;
|
||||
match_pos = left ? match_pos - 1 : match_pos + 1;
|
||||
i = 0;
|
||||
break;
|
||||
} else if (!part_match) {
|
||||
match_pos = left ? match_pos - 1 : match_pos + 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (unmatch && !part_match)
|
||||
break;
|
||||
else if ((!unmatch && part_match) || !part_match)
|
||||
i++;
|
||||
}
|
||||
|
||||
pos = match_pos;
|
||||
return !unmatch;
|
||||
}
|
||||
|
||||
} // namespace dock
|
||||
} // namespace pv
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user