mirror of
https://github.com/reactos/reactos
synced 2025-10-07 08:52:45 +02:00
Compare commits
5 Commits
Tree-restr
...
alex-netwo
| Author | SHA1 | Date | |
|---|---|---|---|
|
ee6898ddf0 | ||
|
|
b440720058 | ||
|
|
8cdae50e21 | ||
|
|
edab30ae9d | ||
|
|
7cdfd46f4e |
339
COPYING
339
COPYING
@@ -1,339 +0,0 @@
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
Version 2, June 1991
|
||||
|
||||
Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
|
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
Preamble
|
||||
|
||||
The licenses for most software are designed to take away your
|
||||
freedom to share and change it. By contrast, the GNU General Public
|
||||
License is intended to guarantee your freedom to share and change free
|
||||
software--to make sure the software is free for all its users. This
|
||||
General Public License applies to most of the Free Software
|
||||
Foundation's software and to any other program whose authors commit to
|
||||
using it. (Some other Free Software Foundation software is covered by
|
||||
the GNU Lesser General Public License instead.) You can apply it to
|
||||
your programs, too.
|
||||
|
||||
When we speak of free software, we are referring to freedom, not
|
||||
price. Our General Public Licenses are designed to make sure that you
|
||||
have the freedom to distribute copies of free software (and charge for
|
||||
this service if you wish), that you receive source code or can get it
|
||||
if you want it, that you can change the software or use pieces of it
|
||||
in new free programs; and that you know you can do these things.
|
||||
|
||||
To protect your rights, we need to make restrictions that forbid
|
||||
anyone to deny you these rights or to ask you to surrender the rights.
|
||||
These restrictions translate to certain responsibilities for you if you
|
||||
distribute copies of the software, or if you modify it.
|
||||
|
||||
For example, if you distribute copies of such a program, whether
|
||||
gratis or for a fee, you must give the recipients all the rights that
|
||||
you have. You must make sure that they, too, receive or can get the
|
||||
source code. And you must show them these terms so they know their
|
||||
rights.
|
||||
|
||||
We protect your rights with two steps: (1) copyright the software, and
|
||||
(2) offer you this license which gives you legal permission to copy,
|
||||
distribute and/or modify the software.
|
||||
|
||||
Also, for each author's protection and ours, we want to make certain
|
||||
that everyone understands that there is no warranty for this free
|
||||
software. If the software is modified by someone else and passed on, we
|
||||
want its recipients to know that what they have is not the original, so
|
||||
that any problems introduced by others will not reflect on the original
|
||||
authors' reputations.
|
||||
|
||||
Finally, any free program is threatened constantly by software
|
||||
patents. We wish to avoid the danger that redistributors of a free
|
||||
program will individually obtain patent licenses, in effect making the
|
||||
program proprietary. To prevent this, we have made it clear that any
|
||||
patent must be licensed for everyone's free use or not licensed at all.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow.
|
||||
|
||||
GNU GENERAL PUBLIC LICENSE
|
||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
||||
|
||||
0. This License applies to any program or other work which contains
|
||||
a notice placed by the copyright holder saying it may be distributed
|
||||
under the terms of this General Public License. The "Program", below,
|
||||
refers to any such program or work, and a "work based on the Program"
|
||||
means either the Program or any derivative work under copyright law:
|
||||
that is to say, a work containing the Program or a portion of it,
|
||||
either verbatim or with modifications and/or translated into another
|
||||
language. (Hereinafter, translation is included without limitation in
|
||||
the term "modification".) Each licensee is addressed as "you".
|
||||
|
||||
Activities other than copying, distribution and modification are not
|
||||
covered by this License; they are outside its scope. The act of
|
||||
running the Program is not restricted, and the output from the Program
|
||||
is covered only if its contents constitute a work based on the
|
||||
Program (independent of having been made by running the Program).
|
||||
Whether that is true depends on what the Program does.
|
||||
|
||||
1. You may copy and distribute verbatim copies of the Program's
|
||||
source code as you receive it, in any medium, provided that you
|
||||
conspicuously and appropriately publish on each copy an appropriate
|
||||
copyright notice and disclaimer of warranty; keep intact all the
|
||||
notices that refer to this License and to the absence of any warranty;
|
||||
and give any other recipients of the Program a copy of this License
|
||||
along with the Program.
|
||||
|
||||
You may charge a fee for the physical act of transferring a copy, and
|
||||
you may at your option offer warranty protection in exchange for a fee.
|
||||
|
||||
2. You may modify your copy or copies of the Program or any portion
|
||||
of it, thus forming a work based on the Program, and copy and
|
||||
distribute such modifications or work under the terms of Section 1
|
||||
above, provided that you also meet all of these conditions:
|
||||
|
||||
a) You must cause the modified files to carry prominent notices
|
||||
stating that you changed the files and the date of any change.
|
||||
|
||||
b) You must cause any work that you distribute or publish, that in
|
||||
whole or in part contains or is derived from the Program or any
|
||||
part thereof, to be licensed as a whole at no charge to all third
|
||||
parties under the terms of this License.
|
||||
|
||||
c) If the modified program normally reads commands interactively
|
||||
when run, you must cause it, when started running for such
|
||||
interactive use in the most ordinary way, to print or display an
|
||||
announcement including an appropriate copyright notice and a
|
||||
notice that there is no warranty (or else, saying that you provide
|
||||
a warranty) and that users may redistribute the program under
|
||||
these conditions, and telling the user how to view a copy of this
|
||||
License. (Exception: if the Program itself is interactive but
|
||||
does not normally print such an announcement, your work based on
|
||||
the Program is not required to print an announcement.)
|
||||
|
||||
These requirements apply to the modified work as a whole. If
|
||||
identifiable sections of that work are not derived from the Program,
|
||||
and can be reasonably considered independent and separate works in
|
||||
themselves, then this License, and its terms, do not apply to those
|
||||
sections when you distribute them as separate works. But when you
|
||||
distribute the same sections as part of a whole which is a work based
|
||||
on the Program, the distribution of the whole must be on the terms of
|
||||
this License, whose permissions for other licensees extend to the
|
||||
entire whole, and thus to each and every part regardless of who wrote it.
|
||||
|
||||
Thus, it is not the intent of this section to claim rights or contest
|
||||
your rights to work written entirely by you; rather, the intent is to
|
||||
exercise the right to control the distribution of derivative or
|
||||
collective works based on the Program.
|
||||
|
||||
In addition, mere aggregation of another work not based on the Program
|
||||
with the Program (or with a work based on the Program) on a volume of
|
||||
a storage or distribution medium does not bring the other work under
|
||||
the scope of this License.
|
||||
|
||||
3. You may copy and distribute the Program (or a work based on it,
|
||||
under Section 2) in object code or executable form under the terms of
|
||||
Sections 1 and 2 above provided that you also do one of the following:
|
||||
|
||||
a) Accompany it with the complete corresponding machine-readable
|
||||
source code, which must be distributed under the terms of Sections
|
||||
1 and 2 above on a medium customarily used for software interchange; or,
|
||||
|
||||
b) Accompany it with a written offer, valid for at least three
|
||||
years, to give any third party, for a charge no more than your
|
||||
cost of physically performing source distribution, a complete
|
||||
machine-readable copy of the corresponding source code, to be
|
||||
distributed under the terms of Sections 1 and 2 above on a medium
|
||||
customarily used for software interchange; or,
|
||||
|
||||
c) Accompany it with the information you received as to the offer
|
||||
to distribute corresponding source code. (This alternative is
|
||||
allowed only for noncommercial distribution and only if you
|
||||
received the program in object code or executable form with such
|
||||
an offer, in accord with Subsection b above.)
|
||||
|
||||
The source code for a work means the preferred form of the work for
|
||||
making modifications to it. For an executable work, complete source
|
||||
code means all the source code for all modules it contains, plus any
|
||||
associated interface definition files, plus the scripts used to
|
||||
control compilation and installation of the executable. However, as a
|
||||
special exception, the source code distributed need not include
|
||||
anything that is normally distributed (in either source or binary
|
||||
form) with the major components (compiler, kernel, and so on) of the
|
||||
operating system on which the executable runs, unless that component
|
||||
itself accompanies the executable.
|
||||
|
||||
If distribution of executable or object code is made by offering
|
||||
access to copy from a designated place, then offering equivalent
|
||||
access to copy the source code from the same place counts as
|
||||
distribution of the source code, even though third parties are not
|
||||
compelled to copy the source along with the object code.
|
||||
|
||||
4. You may not copy, modify, sublicense, or distribute the Program
|
||||
except as expressly provided under this License. Any attempt
|
||||
otherwise to copy, modify, sublicense or distribute the Program is
|
||||
void, and will automatically terminate your rights under this License.
|
||||
However, parties who have received copies, or rights, from you under
|
||||
this License will not have their licenses terminated so long as such
|
||||
parties remain in full compliance.
|
||||
|
||||
5. You are not required to accept this License, since you have not
|
||||
signed it. However, nothing else grants you permission to modify or
|
||||
distribute the Program or its derivative works. These actions are
|
||||
prohibited by law if you do not accept this License. Therefore, by
|
||||
modifying or distributing the Program (or any work based on the
|
||||
Program), you indicate your acceptance of this License to do so, and
|
||||
all its terms and conditions for copying, distributing or modifying
|
||||
the Program or works based on it.
|
||||
|
||||
6. Each time you redistribute the Program (or any work based on the
|
||||
Program), the recipient automatically receives a license from the
|
||||
original licensor to copy, distribute or modify the Program subject to
|
||||
these terms and conditions. You may not impose any further
|
||||
restrictions on the recipients' exercise of the rights granted herein.
|
||||
You are not responsible for enforcing compliance by third parties to
|
||||
this License.
|
||||
|
||||
7. If, as a consequence of a court judgment or allegation of patent
|
||||
infringement or for any other reason (not limited to patent issues),
|
||||
conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot
|
||||
distribute so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you
|
||||
may not distribute the Program at all. For example, if a patent
|
||||
license would not permit royalty-free redistribution of the Program by
|
||||
all those who receive copies directly or indirectly through you, then
|
||||
the only way you could satisfy both it and this License would be to
|
||||
refrain entirely from distribution of the Program.
|
||||
|
||||
If any portion of this section is held invalid or unenforceable under
|
||||
any particular circumstance, the balance of the section is intended to
|
||||
apply and the section as a whole is intended to apply in other
|
||||
circumstances.
|
||||
|
||||
It is not the purpose of this section to induce you to infringe any
|
||||
patents or other property right claims or to contest validity of any
|
||||
such claims; this section has the sole purpose of protecting the
|
||||
integrity of the free software distribution system, which is
|
||||
implemented by public license practices. Many people have made
|
||||
generous contributions to the wide range of software distributed
|
||||
through that system in reliance on consistent application of that
|
||||
system; it is up to the author/donor to decide if he or she is willing
|
||||
to distribute software through any other system and a licensee cannot
|
||||
impose that choice.
|
||||
|
||||
This section is intended to make thoroughly clear what is believed to
|
||||
be a consequence of the rest of this License.
|
||||
|
||||
8. If the distribution and/or use of the Program is restricted in
|
||||
certain countries either by patents or by copyrighted interfaces, the
|
||||
original copyright holder who places the Program under this License
|
||||
may add an explicit geographical distribution limitation excluding
|
||||
those countries, so that distribution is permitted only in or among
|
||||
countries not thus excluded. In such case, this License incorporates
|
||||
the limitation as if written in the body of this License.
|
||||
|
||||
9. The Free Software Foundation may publish revised and/or new versions
|
||||
of the General Public License from time to time. Such new versions will
|
||||
be similar in spirit to the present version, but may differ in detail to
|
||||
address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the Program
|
||||
specifies a version number of this License which applies to it and "any
|
||||
later version", you have the option of following the terms and conditions
|
||||
either of that version or of any later version published by the Free
|
||||
Software Foundation. If the Program does not specify a version number of
|
||||
this License, you may choose any version ever published by the Free Software
|
||||
Foundation.
|
||||
|
||||
10. If you wish to incorporate parts of the Program into other free
|
||||
programs whose distribution conditions are different, write to the author
|
||||
to ask for permission. For software which is copyrighted by the Free
|
||||
Software Foundation, write to the Free Software Foundation; we sometimes
|
||||
make exceptions for this. Our decision will be guided by the two goals
|
||||
of preserving the free status of all derivatives of our free software and
|
||||
of promoting the sharing and reuse of software generally.
|
||||
|
||||
NO WARRANTY
|
||||
|
||||
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
|
||||
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
|
||||
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
|
||||
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
|
||||
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
||||
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
|
||||
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
|
||||
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
|
||||
REPAIR OR CORRECTION.
|
||||
|
||||
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
|
||||
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
|
||||
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
|
||||
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
|
||||
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
|
||||
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
|
||||
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
|
||||
POSSIBILITY OF SUCH DAMAGES.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Programs
|
||||
|
||||
If you develop a new program, and you want it to be of the greatest
|
||||
possible use to the public, the best way to achieve this is to make it
|
||||
free software which everyone can redistribute and change under these terms.
|
||||
|
||||
To do so, attach the following notices to the program. It is safest
|
||||
to attach them to the start of each source file to most effectively
|
||||
convey the exclusion of warranty; and each file should have at least
|
||||
the "copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the program's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License along
|
||||
with this program; if not, write to the Free Software Foundation, Inc.,
|
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
If the program is interactive, make it output a short notice like this
|
||||
when it starts in an interactive mode:
|
||||
|
||||
Gnomovision version 69, Copyright (C) year name of author
|
||||
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
||||
This is free software, and you are welcome to redistribute it
|
||||
under certain conditions; type `show c' for details.
|
||||
|
||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
||||
parts of the General Public License. Of course, the commands you use may
|
||||
be called something other than `show w' and `show c'; they could even be
|
||||
mouse-clicks or menu items--whatever suits your program.
|
||||
|
||||
You should also get your employer (if you work as a programmer) or your
|
||||
school, if any, to sign a "copyright disclaimer" for the program, if
|
||||
necessary. Here is a sample; alter the names:
|
||||
|
||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
|
||||
`Gnomovision' (which makes passes at compilers) written by James Hacker.
|
||||
|
||||
<signature of Ty Coon>, 1 April 1989
|
||||
Ty Coon, President of Vice
|
||||
|
||||
This General Public License does not permit incorporating your program into
|
||||
proprietary programs. If your program is a subroutine library, you may
|
||||
consider it more useful to permit linking proprietary applications with the
|
||||
library. If this is what you want to do, use the GNU Lesser General
|
||||
Public License instead of this License.
|
||||
23
COPYING.ARM
23
COPYING.ARM
@@ -1,23 +0,0 @@
|
||||
Copyright 2008 ReactOS Portable Systems Group. All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without modification, are permitted provided
|
||||
that the following conditions are met:
|
||||
1. Redistributions of source code must retain the above copyright notice, this list of conditions and
|
||||
the following disclaimer.
|
||||
2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions
|
||||
and the following disclaimer in the documentation and/or other materials provided with the
|
||||
distribution.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE REACTOS PORTABLE SYSTEMS GROUP ``AS IS'' AND ANY EXPRESS OR IMPLIED
|
||||
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
||||
FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REACTOS PORTABLE SYSTEMS GROUP
|
||||
OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
||||
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
||||
AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
||||
NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
||||
ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
|
||||
The views and conclusions contained in the software and documentation are those of the authors and
|
||||
should not be interpreted as representing official policies, either expressed or implied, of the ReactOS
|
||||
Project.
|
||||
504
COPYING.LIB
504
COPYING.LIB
@@ -1,504 +0,0 @@
|
||||
GNU LESSER GENERAL PUBLIC LICENSE
|
||||
Version 2.1, February 1999
|
||||
|
||||
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
|
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
[This is the first released version of the Lesser GPL. It also counts
|
||||
as the successor of the GNU Library Public License, version 2, hence
|
||||
the version number 2.1.]
|
||||
|
||||
Preamble
|
||||
|
||||
The licenses for most software are designed to take away your
|
||||
freedom to share and change it. By contrast, the GNU General Public
|
||||
Licenses are intended to guarantee your freedom to share and change
|
||||
free software--to make sure the software is free for all its users.
|
||||
|
||||
This license, the Lesser General Public License, applies to some
|
||||
specially designated software packages--typically libraries--of the
|
||||
Free Software Foundation and other authors who decide to use it. You
|
||||
can use it too, but we suggest you first think carefully about whether
|
||||
this license or the ordinary General Public License is the better
|
||||
strategy to use in any particular case, based on the explanations below.
|
||||
|
||||
When we speak of free software, we are referring to freedom of use,
|
||||
not price. Our General Public Licenses are designed to make sure that
|
||||
you have the freedom to distribute copies of free software (and charge
|
||||
for this service if you wish); that you receive source code or can get
|
||||
it if you want it; that you can change the software and use pieces of
|
||||
it in new free programs; and that you are informed that you can do
|
||||
these things.
|
||||
|
||||
To protect your rights, we need to make restrictions that forbid
|
||||
distributors to deny you these rights or to ask you to surrender these
|
||||
rights. These restrictions translate to certain responsibilities for
|
||||
you if you distribute copies of the library or if you modify it.
|
||||
|
||||
For example, if you distribute copies of the library, whether gratis
|
||||
or for a fee, you must give the recipients all the rights that we gave
|
||||
you. You must make sure that they, too, receive or can get the source
|
||||
code. If you link other code with the library, you must provide
|
||||
complete object files to the recipients, so that they can relink them
|
||||
with the library after making changes to the library and recompiling
|
||||
it. And you must show them these terms so they know their rights.
|
||||
|
||||
We protect your rights with a two-step method: (1) we copyright the
|
||||
library, and (2) we offer you this license, which gives you legal
|
||||
permission to copy, distribute and/or modify the library.
|
||||
|
||||
To protect each distributor, we want to make it very clear that
|
||||
there is no warranty for the free library. Also, if the library is
|
||||
modified by someone else and passed on, the recipients should know
|
||||
that what they have is not the original version, so that the original
|
||||
author's reputation will not be affected by problems that might be
|
||||
introduced by others.
|
||||
|
||||
Finally, software patents pose a constant threat to the existence of
|
||||
any free program. We wish to make sure that a company cannot
|
||||
effectively restrict the users of a free program by obtaining a
|
||||
restrictive license from a patent holder. Therefore, we insist that
|
||||
any patent license obtained for a version of the library must be
|
||||
consistent with the full freedom of use specified in this license.
|
||||
|
||||
Most GNU software, including some libraries, is covered by the
|
||||
ordinary GNU General Public License. This license, the GNU Lesser
|
||||
General Public License, applies to certain designated libraries, and
|
||||
is quite different from the ordinary General Public License. We use
|
||||
this license for certain libraries in order to permit linking those
|
||||
libraries into non-free programs.
|
||||
|
||||
When a program is linked with a library, whether statically or using
|
||||
a shared library, the combination of the two is legally speaking a
|
||||
combined work, a derivative of the original library. The ordinary
|
||||
General Public License therefore permits such linking only if the
|
||||
entire combination fits its criteria of freedom. The Lesser General
|
||||
Public License permits more lax criteria for linking other code with
|
||||
the library.
|
||||
|
||||
We call this license the "Lesser" General Public License because it
|
||||
does Less to protect the user's freedom than the ordinary General
|
||||
Public License. It also provides other free software developers Less
|
||||
of an advantage over competing non-free programs. These disadvantages
|
||||
are the reason we use the ordinary General Public License for many
|
||||
libraries. However, the Lesser license provides advantages in certain
|
||||
special circumstances.
|
||||
|
||||
For example, on rare occasions, there may be a special need to
|
||||
encourage the widest possible use of a certain library, so that it becomes
|
||||
a de-facto standard. To achieve this, non-free programs must be
|
||||
allowed to use the library. A more frequent case is that a free
|
||||
library does the same job as widely used non-free libraries. In this
|
||||
case, there is little to gain by limiting the free library to free
|
||||
software only, so we use the Lesser General Public License.
|
||||
|
||||
In other cases, permission to use a particular library in non-free
|
||||
programs enables a greater number of people to use a large body of
|
||||
free software. For example, permission to use the GNU C Library in
|
||||
non-free programs enables many more people to use the whole GNU
|
||||
operating system, as well as its variant, the GNU/Linux operating
|
||||
system.
|
||||
|
||||
Although the Lesser General Public License is Less protective of the
|
||||
users' freedom, it does ensure that the user of a program that is
|
||||
linked with the Library has the freedom and the wherewithal to run
|
||||
that program using a modified version of the Library.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow. Pay close attention to the difference between a
|
||||
"work based on the library" and a "work that uses the library". The
|
||||
former contains code derived from the library, whereas the latter must
|
||||
be combined with the library in order to run.
|
||||
|
||||
GNU LESSER GENERAL PUBLIC LICENSE
|
||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
||||
|
||||
0. This License Agreement applies to any software library or other
|
||||
program which contains a notice placed by the copyright holder or
|
||||
other authorized party saying it may be distributed under the terms of
|
||||
this Lesser General Public License (also called "this License").
|
||||
Each licensee is addressed as "you".
|
||||
|
||||
A "library" means a collection of software functions and/or data
|
||||
prepared so as to be conveniently linked with application programs
|
||||
(which use some of those functions and data) to form executables.
|
||||
|
||||
The "Library", below, refers to any such software library or work
|
||||
which has been distributed under these terms. A "work based on the
|
||||
Library" means either the Library or any derivative work under
|
||||
copyright law: that is to say, a work containing the Library or a
|
||||
portion of it, either verbatim or with modifications and/or translated
|
||||
straightforwardly into another language. (Hereinafter, translation is
|
||||
included without limitation in the term "modification".)
|
||||
|
||||
"Source code" for a work means the preferred form of the work for
|
||||
making modifications to it. For a library, complete source code means
|
||||
all the source code for all modules it contains, plus any associated
|
||||
interface definition files, plus the scripts used to control compilation
|
||||
and installation of the library.
|
||||
|
||||
Activities other than copying, distribution and modification are not
|
||||
covered by this License; they are outside its scope. The act of
|
||||
running a program using the Library is not restricted, and output from
|
||||
such a program is covered only if its contents constitute a work based
|
||||
on the Library (independent of the use of the Library in a tool for
|
||||
writing it). Whether that is true depends on what the Library does
|
||||
and what the program that uses the Library does.
|
||||
|
||||
1. You may copy and distribute verbatim copies of the Library's
|
||||
complete source code as you receive it, in any medium, provided that
|
||||
you conspicuously and appropriately publish on each copy an
|
||||
appropriate copyright notice and disclaimer of warranty; keep intact
|
||||
all the notices that refer to this License and to the absence of any
|
||||
warranty; and distribute a copy of this License along with the
|
||||
Library.
|
||||
|
||||
You may charge a fee for the physical act of transferring a copy,
|
||||
and you may at your option offer warranty protection in exchange for a
|
||||
fee.
|
||||
|
||||
2. You may modify your copy or copies of the Library or any portion
|
||||
of it, thus forming a work based on the Library, and copy and
|
||||
distribute such modifications or work under the terms of Section 1
|
||||
above, provided that you also meet all of these conditions:
|
||||
|
||||
a) The modified work must itself be a software library.
|
||||
|
||||
b) You must cause the files modified to carry prominent notices
|
||||
stating that you changed the files and the date of any change.
|
||||
|
||||
c) You must cause the whole of the work to be licensed at no
|
||||
charge to all third parties under the terms of this License.
|
||||
|
||||
d) If a facility in the modified Library refers to a function or a
|
||||
table of data to be supplied by an application program that uses
|
||||
the facility, other than as an argument passed when the facility
|
||||
is invoked, then you must make a good faith effort to ensure that,
|
||||
in the event an application does not supply such function or
|
||||
table, the facility still operates, and performs whatever part of
|
||||
its purpose remains meaningful.
|
||||
|
||||
(For example, a function in a library to compute square roots has
|
||||
a purpose that is entirely well-defined independent of the
|
||||
application. Therefore, Subsection 2d requires that any
|
||||
application-supplied function or table used by this function must
|
||||
be optional: if the application does not supply it, the square
|
||||
root function must still compute square roots.)
|
||||
|
||||
These requirements apply to the modified work as a whole. If
|
||||
identifiable sections of that work are not derived from the Library,
|
||||
and can be reasonably considered independent and separate works in
|
||||
themselves, then this License, and its terms, do not apply to those
|
||||
sections when you distribute them as separate works. But when you
|
||||
distribute the same sections as part of a whole which is a work based
|
||||
on the Library, the distribution of the whole must be on the terms of
|
||||
this License, whose permissions for other licensees extend to the
|
||||
entire whole, and thus to each and every part regardless of who wrote
|
||||
it.
|
||||
|
||||
Thus, it is not the intent of this section to claim rights or contest
|
||||
your rights to work written entirely by you; rather, the intent is to
|
||||
exercise the right to control the distribution of derivative or
|
||||
collective works based on the Library.
|
||||
|
||||
In addition, mere aggregation of another work not based on the Library
|
||||
with the Library (or with a work based on the Library) on a volume of
|
||||
a storage or distribution medium does not bring the other work under
|
||||
the scope of this License.
|
||||
|
||||
3. You may opt to apply the terms of the ordinary GNU General Public
|
||||
License instead of this License to a given copy of the Library. To do
|
||||
this, you must alter all the notices that refer to this License, so
|
||||
that they refer to the ordinary GNU General Public License, version 2,
|
||||
instead of to this License. (If a newer version than version 2 of the
|
||||
ordinary GNU General Public License has appeared, then you can specify
|
||||
that version instead if you wish.) Do not make any other change in
|
||||
these notices.
|
||||
|
||||
Once this change is made in a given copy, it is irreversible for
|
||||
that copy, so the ordinary GNU General Public License applies to all
|
||||
subsequent copies and derivative works made from that copy.
|
||||
|
||||
This option is useful when you wish to copy part of the code of
|
||||
the Library into a program that is not a library.
|
||||
|
||||
4. You may copy and distribute the Library (or a portion or
|
||||
derivative of it, under Section 2) in object code or executable form
|
||||
under the terms of Sections 1 and 2 above provided that you accompany
|
||||
it with the complete corresponding machine-readable source code, which
|
||||
must be distributed under the terms of Sections 1 and 2 above on a
|
||||
medium customarily used for software interchange.
|
||||
|
||||
If distribution of object code is made by offering access to copy
|
||||
from a designated place, then offering equivalent access to copy the
|
||||
source code from the same place satisfies the requirement to
|
||||
distribute the source code, even though third parties are not
|
||||
compelled to copy the source along with the object code.
|
||||
|
||||
5. A program that contains no derivative of any portion of the
|
||||
Library, but is designed to work with the Library by being compiled or
|
||||
linked with it, is called a "work that uses the Library". Such a
|
||||
work, in isolation, is not a derivative work of the Library, and
|
||||
therefore falls outside the scope of this License.
|
||||
|
||||
However, linking a "work that uses the Library" with the Library
|
||||
creates an executable that is a derivative of the Library (because it
|
||||
contains portions of the Library), rather than a "work that uses the
|
||||
library". The executable is therefore covered by this License.
|
||||
Section 6 states terms for distribution of such executables.
|
||||
|
||||
When a "work that uses the Library" uses material from a header file
|
||||
that is part of the Library, the object code for the work may be a
|
||||
derivative work of the Library even though the source code is not.
|
||||
Whether this is true is especially significant if the work can be
|
||||
linked without the Library, or if the work is itself a library. The
|
||||
threshold for this to be true is not precisely defined by law.
|
||||
|
||||
If such an object file uses only numerical parameters, data
|
||||
structure layouts and accessors, and small macros and small inline
|
||||
functions (ten lines or less in length), then the use of the object
|
||||
file is unrestricted, regardless of whether it is legally a derivative
|
||||
work. (Executables containing this object code plus portions of the
|
||||
Library will still fall under Section 6.)
|
||||
|
||||
Otherwise, if the work is a derivative of the Library, you may
|
||||
distribute the object code for the work under the terms of Section 6.
|
||||
Any executables containing that work also fall under Section 6,
|
||||
whether or not they are linked directly with the Library itself.
|
||||
|
||||
6. As an exception to the Sections above, you may also combine or
|
||||
link a "work that uses the Library" with the Library to produce a
|
||||
work containing portions of the Library, and distribute that work
|
||||
under terms of your choice, provided that the terms permit
|
||||
modification of the work for the customer's own use and reverse
|
||||
engineering for debugging such modifications.
|
||||
|
||||
You must give prominent notice with each copy of the work that the
|
||||
Library is used in it and that the Library and its use are covered by
|
||||
this License. You must supply a copy of this License. If the work
|
||||
during execution displays copyright notices, you must include the
|
||||
copyright notice for the Library among them, as well as a reference
|
||||
directing the user to the copy of this License. Also, you must do one
|
||||
of these things:
|
||||
|
||||
a) Accompany the work with the complete corresponding
|
||||
machine-readable source code for the Library including whatever
|
||||
changes were used in the work (which must be distributed under
|
||||
Sections 1 and 2 above); and, if the work is an executable linked
|
||||
with the Library, with the complete machine-readable "work that
|
||||
uses the Library", as object code and/or source code, so that the
|
||||
user can modify the Library and then relink to produce a modified
|
||||
executable containing the modified Library. (It is understood
|
||||
that the user who changes the contents of definitions files in the
|
||||
Library will not necessarily be able to recompile the application
|
||||
to use the modified definitions.)
|
||||
|
||||
b) Use a suitable shared library mechanism for linking with the
|
||||
Library. A suitable mechanism is one that (1) uses at run time a
|
||||
copy of the library already present on the user's computer system,
|
||||
rather than copying library functions into the executable, and (2)
|
||||
will operate properly with a modified version of the library, if
|
||||
the user installs one, as long as the modified version is
|
||||
interface-compatible with the version that the work was made with.
|
||||
|
||||
c) Accompany the work with a written offer, valid for at
|
||||
least three years, to give the same user the materials
|
||||
specified in Subsection 6a, above, for a charge no more
|
||||
than the cost of performing this distribution.
|
||||
|
||||
d) If distribution of the work is made by offering access to copy
|
||||
from a designated place, offer equivalent access to copy the above
|
||||
specified materials from the same place.
|
||||
|
||||
e) Verify that the user has already received a copy of these
|
||||
materials or that you have already sent this user a copy.
|
||||
|
||||
For an executable, the required form of the "work that uses the
|
||||
Library" must include any data and utility programs needed for
|
||||
reproducing the executable from it. However, as a special exception,
|
||||
the materials to be distributed need not include anything that is
|
||||
normally distributed (in either source or binary form) with the major
|
||||
components (compiler, kernel, and so on) of the operating system on
|
||||
which the executable runs, unless that component itself accompanies
|
||||
the executable.
|
||||
|
||||
It may happen that this requirement contradicts the license
|
||||
restrictions of other proprietary libraries that do not normally
|
||||
accompany the operating system. Such a contradiction means you cannot
|
||||
use both them and the Library together in an executable that you
|
||||
distribute.
|
||||
|
||||
7. You may place library facilities that are a work based on the
|
||||
Library side-by-side in a single library together with other library
|
||||
facilities not covered by this License, and distribute such a combined
|
||||
library, provided that the separate distribution of the work based on
|
||||
the Library and of the other library facilities is otherwise
|
||||
permitted, and provided that you do these two things:
|
||||
|
||||
a) Accompany the combined library with a copy of the same work
|
||||
based on the Library, uncombined with any other library
|
||||
facilities. This must be distributed under the terms of the
|
||||
Sections above.
|
||||
|
||||
b) Give prominent notice with the combined library of the fact
|
||||
that part of it is a work based on the Library, and explaining
|
||||
where to find the accompanying uncombined form of the same work.
|
||||
|
||||
8. You may not copy, modify, sublicense, link with, or distribute
|
||||
the Library except as expressly provided under this License. Any
|
||||
attempt otherwise to copy, modify, sublicense, link with, or
|
||||
distribute the Library is void, and will automatically terminate your
|
||||
rights under this License. However, parties who have received copies,
|
||||
or rights, from you under this License will not have their licenses
|
||||
terminated so long as such parties remain in full compliance.
|
||||
|
||||
9. You are not required to accept this License, since you have not
|
||||
signed it. However, nothing else grants you permission to modify or
|
||||
distribute the Library or its derivative works. These actions are
|
||||
prohibited by law if you do not accept this License. Therefore, by
|
||||
modifying or distributing the Library (or any work based on the
|
||||
Library), you indicate your acceptance of this License to do so, and
|
||||
all its terms and conditions for copying, distributing or modifying
|
||||
the Library or works based on it.
|
||||
|
||||
10. Each time you redistribute the Library (or any work based on the
|
||||
Library), the recipient automatically receives a license from the
|
||||
original licensor to copy, distribute, link with or modify the Library
|
||||
subject to these terms and conditions. You may not impose any further
|
||||
restrictions on the recipients' exercise of the rights granted herein.
|
||||
You are not responsible for enforcing compliance by third parties with
|
||||
this License.
|
||||
|
||||
11. If, as a consequence of a court judgment or allegation of patent
|
||||
infringement or for any other reason (not limited to patent issues),
|
||||
conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot
|
||||
distribute so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you
|
||||
may not distribute the Library at all. For example, if a patent
|
||||
license would not permit royalty-free redistribution of the Library by
|
||||
all those who receive copies directly or indirectly through you, then
|
||||
the only way you could satisfy both it and this License would be to
|
||||
refrain entirely from distribution of the Library.
|
||||
|
||||
If any portion of this section is held invalid or unenforceable under any
|
||||
particular circumstance, the balance of the section is intended to apply,
|
||||
and the section as a whole is intended to apply in other circumstances.
|
||||
|
||||
It is not the purpose of this section to induce you to infringe any
|
||||
patents or other property right claims or to contest validity of any
|
||||
such claims; this section has the sole purpose of protecting the
|
||||
integrity of the free software distribution system which is
|
||||
implemented by public license practices. Many people have made
|
||||
generous contributions to the wide range of software distributed
|
||||
through that system in reliance on consistent application of that
|
||||
system; it is up to the author/donor to decide if he or she is willing
|
||||
to distribute software through any other system and a licensee cannot
|
||||
impose that choice.
|
||||
|
||||
This section is intended to make thoroughly clear what is believed to
|
||||
be a consequence of the rest of this License.
|
||||
|
||||
12. If the distribution and/or use of the Library is restricted in
|
||||
certain countries either by patents or by copyrighted interfaces, the
|
||||
original copyright holder who places the Library under this License may add
|
||||
an explicit geographical distribution limitation excluding those countries,
|
||||
so that distribution is permitted only in or among countries not thus
|
||||
excluded. In such case, this License incorporates the limitation as if
|
||||
written in the body of this License.
|
||||
|
||||
13. The Free Software Foundation may publish revised and/or new
|
||||
versions of the Lesser 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 Library
|
||||
specifies a version number of this License which applies to it and
|
||||
"any later version", you have the option of following the terms and
|
||||
conditions either of that version or of any later version published by
|
||||
the Free Software Foundation. If the Library does not specify a
|
||||
license version number, you may choose any version ever published by
|
||||
the Free Software Foundation.
|
||||
|
||||
14. If you wish to incorporate parts of the Library into other free
|
||||
programs whose distribution conditions are incompatible with these,
|
||||
write to the author to ask for permission. For software which is
|
||||
copyrighted by the Free Software Foundation, write to the Free
|
||||
Software Foundation; we sometimes make exceptions for this. Our
|
||||
decision will be guided by the two goals of preserving the free status
|
||||
of all derivatives of our free software and of promoting the sharing
|
||||
and reuse of software generally.
|
||||
|
||||
NO WARRANTY
|
||||
|
||||
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
|
||||
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
|
||||
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
|
||||
OTHER PARTIES PROVIDE THE LIBRARY "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
|
||||
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
|
||||
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
|
||||
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
|
||||
AND/OR REDISTRIBUTE THE LIBRARY 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
|
||||
LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
|
||||
SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
|
||||
DAMAGES.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Libraries
|
||||
|
||||
If you develop a new library, and you want it to be of the greatest
|
||||
possible use to the public, we recommend making it free software that
|
||||
everyone can redistribute and change. You can do so by permitting
|
||||
redistribution under these terms (or, alternatively, under the terms of the
|
||||
ordinary General Public License).
|
||||
|
||||
To apply these terms, attach the following notices to the library. It is
|
||||
safest to attach them to the start of each source file to most effectively
|
||||
convey the exclusion of warranty; and each file should have at least the
|
||||
"copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the library's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2.1 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
You should also get your employer (if you work as a programmer) or your
|
||||
school, if any, to sign a "copyright disclaimer" for the library, if
|
||||
necessary. Here is a sample; alter the names:
|
||||
|
||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the
|
||||
library `Frob' (a library for tweaking knobs) written by James Random Hacker.
|
||||
|
||||
<signature of Ty Coon>, 1 April 1990
|
||||
Ty Coon, President of Vice
|
||||
|
||||
That's all there is to it!
|
||||
|
||||
|
||||
674
COPYING3
674
COPYING3
@@ -1,674 +0,0 @@
|
||||
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>.
|
||||
165
COPYING3.LIB
165
COPYING3.LIB
@@ -1,165 +0,0 @@
|
||||
GNU LESSER 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.
|
||||
|
||||
|
||||
This version of the GNU Lesser General Public License incorporates
|
||||
the terms and conditions of version 3 of the GNU General Public
|
||||
License, supplemented by the additional permissions listed below.
|
||||
|
||||
0. Additional Definitions.
|
||||
|
||||
As used herein, "this License" refers to version 3 of the GNU Lesser
|
||||
General Public License, and the "GNU GPL" refers to version 3 of the GNU
|
||||
General Public License.
|
||||
|
||||
"The Library" refers to a covered work governed by this License,
|
||||
other than an Application or a Combined Work as defined below.
|
||||
|
||||
An "Application" is any work that makes use of an interface provided
|
||||
by the Library, but which is not otherwise based on the Library.
|
||||
Defining a subclass of a class defined by the Library is deemed a mode
|
||||
of using an interface provided by the Library.
|
||||
|
||||
A "Combined Work" is a work produced by combining or linking an
|
||||
Application with the Library. The particular version of the Library
|
||||
with which the Combined Work was made is also called the "Linked
|
||||
Version".
|
||||
|
||||
The "Minimal Corresponding Source" for a Combined Work means the
|
||||
Corresponding Source for the Combined Work, excluding any source code
|
||||
for portions of the Combined Work that, considered in isolation, are
|
||||
based on the Application, and not on the Linked Version.
|
||||
|
||||
The "Corresponding Application Code" for a Combined Work means the
|
||||
object code and/or source code for the Application, including any data
|
||||
and utility programs needed for reproducing the Combined Work from the
|
||||
Application, but excluding the System Libraries of the Combined Work.
|
||||
|
||||
1. Exception to Section 3 of the GNU GPL.
|
||||
|
||||
You may convey a covered work under sections 3 and 4 of this License
|
||||
without being bound by section 3 of the GNU GPL.
|
||||
|
||||
2. Conveying Modified Versions.
|
||||
|
||||
If you modify a copy of the Library, and, in your modifications, a
|
||||
facility refers to a function or data to be supplied by an Application
|
||||
that uses the facility (other than as an argument passed when the
|
||||
facility is invoked), then you may convey a copy of the modified
|
||||
version:
|
||||
|
||||
a) under this License, provided that you make a good faith effort to
|
||||
ensure that, in the event an Application does not supply the
|
||||
function or data, the facility still operates, and performs
|
||||
whatever part of its purpose remains meaningful, or
|
||||
|
||||
b) under the GNU GPL, with none of the additional permissions of
|
||||
this License applicable to that copy.
|
||||
|
||||
3. Object Code Incorporating Material from Library Header Files.
|
||||
|
||||
The object code form of an Application may incorporate material from
|
||||
a header file that is part of the Library. You may convey such object
|
||||
code under terms of your choice, provided that, if the incorporated
|
||||
material is not limited to numerical parameters, data structure
|
||||
layouts and accessors, or small macros, inline functions and templates
|
||||
(ten or fewer lines in length), you do both of the following:
|
||||
|
||||
a) Give prominent notice with each copy of the object code that the
|
||||
Library is used in it and that the Library and its use are
|
||||
covered by this License.
|
||||
|
||||
b) Accompany the object code with a copy of the GNU GPL and this license
|
||||
document.
|
||||
|
||||
4. Combined Works.
|
||||
|
||||
You may convey a Combined Work under terms of your choice that,
|
||||
taken together, effectively do not restrict modification of the
|
||||
portions of the Library contained in the Combined Work and reverse
|
||||
engineering for debugging such modifications, if you also do each of
|
||||
the following:
|
||||
|
||||
a) Give prominent notice with each copy of the Combined Work that
|
||||
the Library is used in it and that the Library and its use are
|
||||
covered by this License.
|
||||
|
||||
b) Accompany the Combined Work with a copy of the GNU GPL and this license
|
||||
document.
|
||||
|
||||
c) For a Combined Work that displays copyright notices during
|
||||
execution, include the copyright notice for the Library among
|
||||
these notices, as well as a reference directing the user to the
|
||||
copies of the GNU GPL and this license document.
|
||||
|
||||
d) Do one of the following:
|
||||
|
||||
0) Convey the Minimal Corresponding Source under the terms of this
|
||||
License, and the Corresponding Application Code in a form
|
||||
suitable for, and under terms that permit, the user to
|
||||
recombine or relink the Application with a modified version of
|
||||
the Linked Version to produce a modified Combined Work, in the
|
||||
manner specified by section 6 of the GNU GPL for conveying
|
||||
Corresponding Source.
|
||||
|
||||
1) Use a suitable shared library mechanism for linking with the
|
||||
Library. A suitable mechanism is one that (a) uses at run time
|
||||
a copy of the Library already present on the user's computer
|
||||
system, and (b) will operate properly with a modified version
|
||||
of the Library that is interface-compatible with the Linked
|
||||
Version.
|
||||
|
||||
e) Provide Installation Information, but only if you would otherwise
|
||||
be required to provide such information under section 6 of the
|
||||
GNU GPL, and only to the extent that such information is
|
||||
necessary to install and execute a modified version of the
|
||||
Combined Work produced by recombining or relinking the
|
||||
Application with a modified version of the Linked Version. (If
|
||||
you use option 4d0, the Installation Information must accompany
|
||||
the Minimal Corresponding Source and Corresponding Application
|
||||
Code. If you use option 4d1, you must provide the Installation
|
||||
Information in the manner specified by section 6 of the GNU GPL
|
||||
for conveying Corresponding Source.)
|
||||
|
||||
5. Combined Libraries.
|
||||
|
||||
You may place library facilities that are a work based on the
|
||||
Library side by side in a single library together with other library
|
||||
facilities that are not Applications and are not covered by this
|
||||
License, and convey such a combined library under terms of your
|
||||
choice, if you do both of the following:
|
||||
|
||||
a) Accompany the combined library with a copy of the same work based
|
||||
on the Library, uncombined with any other library facilities,
|
||||
conveyed under the terms of this License.
|
||||
|
||||
b) Give prominent notice with the combined library that part of it
|
||||
is a work based on the Library, and explaining where to find the
|
||||
accompanying uncombined form of the same work.
|
||||
|
||||
6. Revised Versions of the GNU Lesser General Public License.
|
||||
|
||||
The Free Software Foundation may publish revised and/or new versions
|
||||
of the GNU Lesser 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
|
||||
Library as you received it specifies that a certain numbered version
|
||||
of the GNU Lesser General Public License "or any later version"
|
||||
applies to it, you have the option of following the terms and
|
||||
conditions either of that published version or of any later version
|
||||
published by the Free Software Foundation. If the Library as you
|
||||
received it does not specify a version number of the GNU Lesser
|
||||
General Public License, you may choose any version of the GNU Lesser
|
||||
General Public License ever published by the Free Software Foundation.
|
||||
|
||||
If the Library as you received it specifies that a proxy can decide
|
||||
whether future versions of the GNU Lesser General Public License shall
|
||||
apply, that proxy's public statement of acceptance of any version is
|
||||
permanent authorization for you to choose that version for the
|
||||
Library.
|
||||
80
CREDITS
80
CREDITS
@@ -1,80 +0,0 @@
|
||||
ReactOS is available thanks to the work of:
|
||||
|
||||
Aleksey Bragin <aleksey at reactos org>
|
||||
Alex Ionescu <alex.ionescu@reactos.org>
|
||||
Andrew Greenwood <lists@silverblade.co.uk>
|
||||
Andrew Munger <waxdragon@gmail.com>
|
||||
Arindam Das
|
||||
Art Yerkes <ayerkes@speakeasy.net>
|
||||
Ariadne
|
||||
Brandon Turner <turnerb7@msu.edu>
|
||||
Brian Palmer <brianp@sginet.com>
|
||||
Cameron M. Gutman <cgutman@reactos.org>
|
||||
Casper S. Hornstrup <chorns@users.sourceforge.net>
|
||||
Christoph von Wittich <christoph_vw@reactos.org>
|
||||
Daniel Reimer <reimer.daniel@freenet.de>
|
||||
David Welch <welch@cwcom.net>
|
||||
Dmitry Chapyshev <dmitry@reactos.org>
|
||||
Emanuele Aliberti <ea@iol.it>
|
||||
Eric Kohl <ekohl@rz-online.de>
|
||||
Eugene Ingerman <geneing@myrealbox.com>
|
||||
Filip Navara <xnavara@volny.cz>
|
||||
Frederik Leemans
|
||||
Ge van Geldorp <ge@gse.nl>
|
||||
Ged Murphy <gedmurphy@reactos.org>
|
||||
Gregor Brunmar <gregor brunmar at home se>
|
||||
Gregor Schneider <grschneider@gmail.com>
|
||||
Guido de Jong
|
||||
Gunnar Andre' Dalsnes <hardon@online.no>
|
||||
Hans Kremer
|
||||
Hartmut Birr <hartmut.birr@gmx.de>
|
||||
Hernan Ochoa
|
||||
Herve Poussineau <hpoussin@reactos.com>
|
||||
Iwan Fatahi <i_fatahi@hotmail.com>
|
||||
James B. Tabor <jimtabor.rosdev@gmail.com> <jimtabor@adsl-64-217-116-74.dsl.hstntx.swbell.net>
|
||||
Jason Eager
|
||||
Jason Filby <jasonfilby@yahoo.com>
|
||||
Jason Weiler
|
||||
Jean Michault
|
||||
Jeffrey Morlan <mrnobo1024@yahoo.com>
|
||||
Jim Noeth
|
||||
Johannes Anderwald <johannes.anderwald@student.tugraz.at>
|
||||
Jonathan Wilson <jonwil@tpgi.com.au>
|
||||
Jurgen van Gael <jurgen.vangael@student.kuleuven.ac.be>
|
||||
KJK::Hyperion <noog@libero.it>
|
||||
Klemens R. Friedl <klemens_friedl@gmx.net>
|
||||
Maarten Bosma <maarten.paul@bosma.de>
|
||||
Magnus Olsen <magnus@greatlord.com>
|
||||
Mark Tempel <mtempel@visi.com>
|
||||
Mark Weaver <mark@npsl.co.uk>
|
||||
Martin Fuchs <martin-fuchs@gmx.net>
|
||||
Marty Dill <mdill@uvic.ca>
|
||||
Matthias Kupfer <mkupfer@reactos.org>
|
||||
Matt Pyne
|
||||
Mike Nordell <"tamlin">
|
||||
Nathan Woods <npwoods@mess.org>
|
||||
Pablo Borobia <pborobia@gmail.com>
|
||||
Paolo Pantaleo <paolopan@freemail.it>
|
||||
Peter Ward <dralnix@gmail.com>
|
||||
Pierre Schweitzer <pschweitzer@reactos.org>
|
||||
Phillip Susi <phreak@iag.net>
|
||||
Rex Jolliff <rex@lvcablemodem.com>
|
||||
Richard Campbell <betam4x@gmail.com>
|
||||
Robert Bergkvist <fragdance@hotmail.com>
|
||||
Robert Dickenson <robd@reactos.org>
|
||||
Royce Mitchell III <royce3@ev1.net>
|
||||
Samuel Serapi<70>n <samdwise51@gmail.com>
|
||||
Saveliy Tretiakov <saveliyt@mail.ru>
|
||||
Stefan Ginsberg <stefan__100__@hotmail.com>
|
||||
Steven Edwards <steven_ed4153@yahoo.com>
|
||||
Thomas Weidenmueller <w3seek@users.sourceforge.net>
|
||||
Timo Kreuzer <timo.kreuzer@reactos.org>
|
||||
Victor Kirhenshtein <sauros@iname.com>
|
||||
Vizzini <vizzini@plasmic.com>
|
||||
|
||||
|
||||
Graphic Design from
|
||||
|
||||
Mindflyer <mf@mufunyo.net>
|
||||
Tango Desktop Project <http://tango-project.org>
|
||||
Everaldo <http://everaldo.com>
|
||||
80
INSTALL
80
INSTALL
@@ -1,80 +0,0 @@
|
||||
1. Build environment
|
||||
|
||||
To build the system you need either mingw32 installed on Windows or a mingw32
|
||||
cross compiler running on unix. You may obtain MinGW binaries that build
|
||||
ReactOS from http://www.reactos.org/.
|
||||
|
||||
|
||||
2. Building ReactOS
|
||||
|
||||
2.1 Building the binaries
|
||||
|
||||
To build ReactOS run 'make' (without the quotes) if you are building on Linux
|
||||
or 'mingw32-make' if you are building on Windows (or ReactOS) from the top
|
||||
directory. If you are using RosBE, follow on-screen instructions.
|
||||
|
||||
|
||||
2.2 Building a bootable CD image
|
||||
|
||||
To build a bootable CD image run 'make bootcd' (without the quotes) if you are
|
||||
building on Linux or 'mingw32-make bootcd' if you are building on Windows (or
|
||||
ReactOS) from the top directory. This will create a CD image with a filename,
|
||||
ReactOS.iso, in the top directory.
|
||||
|
||||
|
||||
3. Installation
|
||||
|
||||
ReactOS can only be installed on a machine that has a FAT16 or FAT32 partition
|
||||
as the active (bootable) partition. The partition on which ReactOS is to be
|
||||
installed (which may or may not be the bootable partition) must also be
|
||||
formatted as FAT16 or FAT32. ReactOS Setup can format the partitions if
|
||||
needed.
|
||||
|
||||
ReactOS can be installed from the source distribution or from the bootable CD
|
||||
distribution. The two ways to install ReactOS are explained below.
|
||||
|
||||
|
||||
3.1 Installation from sources
|
||||
|
||||
If you don't have an existing ReactOS installation you want to upgrade, then
|
||||
build a bootable CD as described above. Burn the CD image, boot from it, and
|
||||
follow the instructions to install ReactOS.
|
||||
|
||||
If you have an existing ReactOS installation you want to upgrade, then to
|
||||
install ReactOS after building it, type 'make install' or
|
||||
'mingw32-make install'. This will create the directory 'reactos' in the top
|
||||
directory. Copy the contents of this directory over the existing installation.
|
||||
|
||||
If you don't want to copy the files manually every time you run a
|
||||
'make install' or 'mingw32-make install', then you can specify the directory
|
||||
where the files are to be copied to during installation.
|
||||
|
||||
Set the ROS_INSTALL environment variable. If you are on Windows this could be
|
||||
done by:
|
||||
|
||||
set ROS_INSTALL=c:\reactos
|
||||
|
||||
If you are on Linux this could be done by:
|
||||
|
||||
export ROS_INSTALL=/mnt/windows/reactos
|
||||
|
||||
Now run 'make install' or 'mingw32-make install' to install the files to the
|
||||
new location.
|
||||
|
||||
|
||||
3.2 Installation from bootable CD distribution
|
||||
|
||||
To install ReactOS from the bootable CD distribution, extract the archive
|
||||
contents. Then burn the CD image, boot from it, and follow instructions.
|
||||
|
||||
|
||||
5. Help
|
||||
|
||||
If you run into problems or have suggestions for making ReactOS better, please
|
||||
visit the address below. Mailing lists are available for a variety of topics,
|
||||
bugs should be submitted to bugzilla and general chat takes place in the forums,
|
||||
or #reactos on freenode
|
||||
|
||||
http://www.reactos.org/
|
||||
|
||||
ReactOS Development Team
|
||||
633
Makefile
633
Makefile
@@ -1,633 +0,0 @@
|
||||
# Well-known targets:
|
||||
#
|
||||
# all (default target)
|
||||
# This target builds all of ReactOS.
|
||||
#
|
||||
# module
|
||||
# These targets builds a single module. Replace module with the name of
|
||||
# the module you want to build.
|
||||
#
|
||||
# bootcd
|
||||
# This target builds an ISO (ReactOS.iso) from which ReactOS can be booted
|
||||
# and installed.
|
||||
#
|
||||
# livecd
|
||||
# This target builds an ISO (ReactOS-Live.iso) from which ReactOS can be
|
||||
# booted, but not installed.
|
||||
#
|
||||
# install
|
||||
# This target installs all of ReactOS to a location specified by the
|
||||
# ROS_INSTALL environment variable.
|
||||
#
|
||||
# module_install
|
||||
# These targets installs a single module to a location specified by the
|
||||
# ROS_INSTALL environment variable. Replace module with the name of the
|
||||
# module you want to install.
|
||||
#
|
||||
# clean
|
||||
# This target cleans (deletes) all files that are generated when building
|
||||
# ReactOS.
|
||||
#
|
||||
# module_clean
|
||||
# These targets cleans (deletes) files that are generated when building a
|
||||
# single module. Replace module with the name of the module you want to
|
||||
# clean.
|
||||
#
|
||||
# depends
|
||||
# This target does a complete dependency check of the ReactOS codebase.
|
||||
# This can require several minutes to complete. If you only need to check
|
||||
# dependencies for a single or few modules then you can use the
|
||||
# module_depends targets instead. This target can also repair a damaged or
|
||||
# missing makefile-${ROS_ARCH}.auto if needed.
|
||||
#
|
||||
# module_depends
|
||||
# These targets do a dependency check of individual modules. Replace module
|
||||
# with the name of the module for which you want to check dependencies.
|
||||
# This is faster than the depends target which does a complete dependency
|
||||
# check of the ReactOS codebase.
|
||||
#
|
||||
#
|
||||
# Accepted environment variables:
|
||||
#
|
||||
# ROS_ARCH
|
||||
# This variable specifies the name of the architecture to build ReactOS for.
|
||||
# The variable defaults to i386.
|
||||
#
|
||||
# ROS_PREFIX
|
||||
# This variable specifies the prefix of the MinGW installation. On Windows
|
||||
# a prefix is usually not needed, but on linux it is usually "mingw32". If
|
||||
# not present and no executable named "gcc" can be found, then the prefix is
|
||||
# assumed to be "mingw32". If your gcc is named i386-mingw32-gcc then set
|
||||
# ROS_PREFIX to i386-mingw32. Don't include the dash (-) before gcc.
|
||||
#
|
||||
# ROS_INTERMEDIATE
|
||||
# This variable controls where to put intermediate files. Intermediate
|
||||
# files are generated files that are needed to generate the final
|
||||
# output files. Examples of intermediate files include *.o, *.a, and
|
||||
# *.coff. N.B. Don't put a path separator at the end. The variable
|
||||
# defaults to .\obj-{ROS_ARCH}.
|
||||
#
|
||||
# ROS_OUTPUT
|
||||
# This variable controls where to put output files. Output files are
|
||||
# generated files that makes up the result of the build process.
|
||||
# Examples of output files include *.exe, *.dll, and *.sys. N.B. Don't
|
||||
# put a path separator at the end. The variable defaults to .\output-{ROS_ARCH}.
|
||||
#
|
||||
# ROS_CDOUTPUT
|
||||
# This variable controls the name of the ReactOS directory on cdrom.
|
||||
# The variable defaults to reactos.
|
||||
# Warning: setting this value may lead to a not bootable/installable cdrom.
|
||||
#
|
||||
# ROS_TEMPORARY
|
||||
# This variable controls where to put temporary files. Temporary files
|
||||
# are (usually small) generated files that are needed to generate the
|
||||
# intermediate or final output files. Examples of temporary files include
|
||||
# *.rci (preprocessed .rc files for wrc), *.tmp, and *.exp. N.B. Don't put
|
||||
# a path separator at the end. The variable defaults to {ROS_INTERMEDIATE}
|
||||
# directory.
|
||||
#
|
||||
# ROS_INSTALL
|
||||
# This variable controls where to install output files to when using
|
||||
# 'make install'. N.B. Don't put a path separator at the end. The variable
|
||||
# defaults to .\{ROS_CDOUTPUT}.
|
||||
#
|
||||
# ROS_BUILDMAP
|
||||
# This variable controls if map files are to be generated for executable
|
||||
# output files. Map files have the extension .map. The value can be either
|
||||
# full (to build map files with assembly code), yes (to build map files
|
||||
# without source code) or no (to not build any map files). The variable
|
||||
# defaults to no.
|
||||
#
|
||||
# ROS_BUILDNOSTRIP
|
||||
# This variable controls if non-symbol-stripped versions are to be built
|
||||
# of executable output files. Non-symbol-stripped executable output files
|
||||
# have .nostrip added to the filename just before the extension. The value
|
||||
# can be either yes (to build non-symbol-stripped versions of executable
|
||||
# output files) or no (to not build non-symbol-stripped versions of
|
||||
# executable output files). The variable defaults to no.
|
||||
#
|
||||
# ROS_LEAN_AND_MEAN
|
||||
# This variable controls if all binaries should be stripped out of useless
|
||||
# data added by GCC/LD as well as of RSYM symbol data. Output binary size
|
||||
# will go from 80 to 40MB, memory usage from 58 to 38MB and the install CD
|
||||
# from 18 to 13MB. The variable defaults to no.
|
||||
#
|
||||
# ROS_GENERATE_RSYM
|
||||
# This variable controls generation of RSYM symbol data. The value can be
|
||||
# either yes (to generate symbol data) or no. The variable defaults to yes.
|
||||
#
|
||||
# ROS_RBUILDFLAGS
|
||||
# Pass parameters to rbuild.
|
||||
# -v Be verbose.
|
||||
# -c Clean as you go. Delete generated files as soon as they are not needed anymore.
|
||||
# -dd Disable automatic dependencies.
|
||||
# -da Enable automatic dependencies.
|
||||
# -df Enable full dependencies.
|
||||
# -dm{module} Check only automatic dependencies for this module.
|
||||
# -hd Disable precompiled headers.
|
||||
# -mi Let make handle creation of install directories. Rbuild will not generate the directories.
|
||||
# -ps Generate proxy makefiles in source tree instead of the output tree.
|
||||
# -ud Disable compilation units.
|
||||
# -r Input XML
|
||||
#
|
||||
# ROS_AUTOMAKE
|
||||
# Alternate name of makefile-${ROS_ARCH}.auto
|
||||
#
|
||||
# ROS_BUILDENGINE
|
||||
# The Build engine to be used. The variable defaults to rbuild (RBUILD_TARGET)
|
||||
#
|
||||
|
||||
# check for versions of make that don't have features we need...
|
||||
# the function "eval" is only available in 3.80+, which happens to be the minimum
|
||||
# version that has the features we use...
|
||||
# THIS CHECK IS BORROWED FROM THE "GMSL" PROJECT, AND IS COVERED BY THE GPL LICENSE
|
||||
# YOU CAN FIND OUT MORE ABOUT GMSL - A VERY COOL PROJECT - AT:
|
||||
# http://gmsl.sourceforge.net/
|
||||
|
||||
__gmsl_have_eval :=
|
||||
__gmsl_ignore := $(eval __gmsl_have_eval := T)
|
||||
|
||||
ifndef __gmsl_have_eval
|
||||
$(error ReactOS's makefiles use GNU Make 3.80+ features, you have $(MAKE_VERSION), you MUST UPGRADE in order to build ReactOS - Sorry)
|
||||
endif
|
||||
# END of code borrowed from GMSL ( http://gmsl.sourceforge.net/ )
|
||||
|
||||
define NL
|
||||
|
||||
|
||||
endef
|
||||
|
||||
.PHONY: all
|
||||
.PHONY: clean
|
||||
.PHONY: world
|
||||
.PHONY: universe
|
||||
|
||||
ifneq ($(ROS_ARCH),)
|
||||
ARCH := $(ROS_ARCH)
|
||||
else
|
||||
ARCH := i386
|
||||
endif
|
||||
|
||||
ifeq ($(ROS_AUTOMAKE),)
|
||||
ROS_AUTOMAKE=makefile-$(ARCH).auto
|
||||
endif
|
||||
|
||||
all: $(ROS_AUTOMAKE)
|
||||
|
||||
|
||||
.SUFFIXES:
|
||||
|
||||
ifeq ($(HOST),)
|
||||
ifeq ($(word 1,$(shell gcc -dumpmachine)),mingw32)
|
||||
ifeq ($(findstring msys,$(shell sh --version 2>nul)),msys)
|
||||
export OSTYPE = msys
|
||||
HOST=mingw32-linux
|
||||
HOST_CFLAGS+=-fshort-wchar
|
||||
HOST_CPPFLAGS+=-fshort-wchar
|
||||
else
|
||||
HOST=mingw32-windows
|
||||
endif
|
||||
else
|
||||
HOST=mingw32-linux
|
||||
HOST_CFLAGS+=-fshort-wchar
|
||||
HOST_CPPFLAGS+=-fshort-wchar
|
||||
endif
|
||||
endif
|
||||
|
||||
# Default to half-verbose mode
|
||||
ifeq ($(VERBOSE),no)
|
||||
Q = @
|
||||
HALFVERBOSEECHO = no
|
||||
BUILDNO_QUIET = -q
|
||||
else
|
||||
ifeq ($(VERBOSE),full)
|
||||
Q =
|
||||
HALFVERBOSEECHO = no
|
||||
BUILDNO_QUIET =
|
||||
else
|
||||
Q = @
|
||||
HALFVERBOSEECHO = yes
|
||||
BUILDNO_QUIET = -q
|
||||
endif
|
||||
endif
|
||||
ifeq ($(HOST),mingw32-linux)
|
||||
QUOTE = "
|
||||
else
|
||||
QUOTE =
|
||||
endif
|
||||
ifeq ($(HALFVERBOSEECHO),yes)
|
||||
ECHO_CP =@echo $(QUOTE)[COPY] $@$(QUOTE)
|
||||
ECHO_MKDIR =@echo $(QUOTE)[MKDIR] $@$(QUOTE)
|
||||
ECHO_BUILDNO =@echo $(QUOTE)[BUILDNO] $@$(QUOTE)
|
||||
ECHO_INVOKE =@echo $(QUOTE)[INVOKE] $<$(QUOTE)
|
||||
ECHO_PCH =@echo $(QUOTE)[PCH] $@$(QUOTE)
|
||||
ECHO_CPP =@echo $(QUOTE)[CPP] $@$(QUOTE)
|
||||
ECHO_CC =@echo $(QUOTE)[CC] $<$(QUOTE)
|
||||
ECHO_HOSTCC =@echo $(QUOTE)[HOST-CC] $<$(QUOTE)
|
||||
ECHO_CL =@echo $(QUOTE)[CL] $<$(QUOTE)
|
||||
ECHO_AS =@echo $(QUOTE)[AS] $<$(QUOTE)
|
||||
ECHO_NASM =@echo $(QUOTE)[NASM] $<$(QUOTE)
|
||||
ECHO_AR =@echo $(QUOTE)[AR] $@$(QUOTE)
|
||||
ECHO_HOSTAR =@echo $(QUOTE)[HOST-AR] $@$(QUOTE)
|
||||
ECHO_WINEBLD =@echo $(QUOTE)[WINEBLD] $@$(QUOTE)
|
||||
ECHO_WRC =@echo $(QUOTE)[WRC] $@$(QUOTE)
|
||||
ECHO_RC =@echo $(QUOTE)[RC] $@$(QUOTE)
|
||||
ECHO_CVTRES =@echo $(QUOTE)[CVTRES] $@$(QUOTE)
|
||||
ECHO_WIDL =@echo $(QUOTE)[WIDL] $@$(QUOTE)
|
||||
ECHO_BIN2RES =@echo $(QUOTE)[BIN2RES] $<$(QUOTE)
|
||||
ECHO_IMPLIB =@echo $(QUOTE)[IMPLIB] $@$(QUOTE)
|
||||
ECHO_LD =@echo $(QUOTE)[LD] $@$(QUOTE)
|
||||
ECHO_HOSTLD =@echo $(QUOTE)[HOST-LD] $@$(QUOTE)
|
||||
ECHO_LINK =@echo $(QUOTE)[LINK] $@$(QUOTE)
|
||||
ECHO_NM =@echo $(QUOTE)[NM] $@$(QUOTE)
|
||||
ECHO_OBJDUMP =@echo $(QUOTE)[OBJDUMP] $@$(QUOTE)
|
||||
ECHO_RBUILD =@echo $(QUOTE)[RBUILD] $@$(QUOTE)
|
||||
ECHO_RSYM =@echo $(QUOTE)[RSYM] $@$(QUOTE)
|
||||
ECHO_PEFIXUP =@echo $(QUOTE)[PEFIXUP] $@$(QUOTE)
|
||||
ECHO_WMC =@echo $(QUOTE)[WMC] $@$(QUOTE)
|
||||
ECHO_NCI =@echo $(QUOTE)[NCI] $@$(QUOTE)
|
||||
ECHO_CABMAN =@echo $(QUOTE)[CABMAN] $<$(QUOTE)
|
||||
ECHO_CDMAKE =@echo $(QUOTE)[CDMAKE] $@$(QUOTE)
|
||||
ECHO_MKHIVE =@echo $(QUOTE)[MKHIVE] $@$(QUOTE)
|
||||
ECHO_REGTESTS=@echo $(QUOTE)[REGTESTS] $@$(QUOTE)
|
||||
ECHO_TEST =@echo $(QUOTE)[TEST] $@$(QUOTE)
|
||||
ECHO_GENDIB =@echo $(QUOTE)[GENDIB] $@$(QUOTE)
|
||||
ECHO_STRIP =@echo $(QUOTE)[STRIP] $@$(QUOTE)
|
||||
ECHO_RGENSTAT=@echo $(QUOTE)[RGENSTAT] $@$(QUOTE)
|
||||
ECHO_DEPENDS =@echo $(QUOTE)[DEPENDS] $<$(QUOTE)
|
||||
ECHO_RSP =@echo $(QUOTE)[RSP] $@$(QUOTE)
|
||||
else
|
||||
ECHO_CP =
|
||||
ECHO_MKDIR =
|
||||
ECHO_BUILDNO =
|
||||
ECHO_INVOKE =
|
||||
ECHO_PCH =
|
||||
ECHO_CPP =
|
||||
ECHO_CC =
|
||||
ECHO_HOSTCC =
|
||||
ECHO_AS =
|
||||
ECHO_NASM =
|
||||
ECHO_AR =
|
||||
ECHO_HOSTAR =
|
||||
ECHO_WINEBLD =
|
||||
ECHO_WRC =
|
||||
ECHO_RC =
|
||||
ECHO_CVTRES =
|
||||
ECHO_WIDL =
|
||||
ECHO_BIN2RES =
|
||||
ECHO_IMPLIB =
|
||||
ECHO_LD =
|
||||
ECHO_HOSTLD =
|
||||
ECHO_NM =
|
||||
ECHO_OBJDUMP =
|
||||
ECHO_RBUILD =
|
||||
ECHO_RSYM =
|
||||
ECHO_WMC =
|
||||
ECHO_NCI =
|
||||
ECHO_CABMAN =
|
||||
ECHO_CDMAKE =
|
||||
ECHO_MKHIVE =
|
||||
ECHO_REGTESTS=
|
||||
ECHO_TEST =
|
||||
ECHO_GENDIB =
|
||||
ECHO_STRIP =
|
||||
ECHO_RGENSTAT=
|
||||
ECHO_DEPENDS =
|
||||
ECHO_RSP =
|
||||
endif
|
||||
|
||||
# Set host compiler/linker
|
||||
ifeq ($(HOST_CC),)
|
||||
HOST_CC = gcc
|
||||
endif
|
||||
ifeq ($(HOST_CPP),)
|
||||
HOST_CPP = g++
|
||||
endif
|
||||
host_gcc = $(Q)$(HOST_CC)
|
||||
host_gpp = $(Q)$(HOST_CPP)
|
||||
host_ld = $(Q)ld
|
||||
host_ar = $(Q)ar
|
||||
host_objcopy = $(Q)objcopy
|
||||
|
||||
# Set target compiler/linker
|
||||
ifneq ($(ROS_PREFIX),)
|
||||
PREFIX_ := $(ROS_PREFIX)-
|
||||
else
|
||||
ifeq ($(HOST),mingw32-linux)
|
||||
PREFIX_ := mingw32-
|
||||
else
|
||||
PREFIX_ :=
|
||||
endif
|
||||
endif
|
||||
ifeq ($(TARGET_CC),)
|
||||
TARGET_CC = $(PREFIX_)gcc
|
||||
endif
|
||||
ifeq ($(TARGET_CPP),)
|
||||
TARGET_CPP = $(PREFIX_)g++
|
||||
endif
|
||||
gcc = $(Q)$(TARGET_CC)
|
||||
gpp = $(Q)$(TARGET_CPP)
|
||||
gas = $(Q)$(TARGET_CC) -x assembler-with-cpp
|
||||
ld = $(Q)$(PREFIX_)ld
|
||||
nm = $(Q)$(PREFIX_)nm
|
||||
objdump = $(Q)$(PREFIX_)objdump
|
||||
ar = $(Q)$(PREFIX_)ar
|
||||
objcopy = $(Q)$(PREFIX_)objcopy
|
||||
dlltool = $(Q)$(PREFIX_)dlltool
|
||||
strip = $(Q)$(PREFIX_)strip
|
||||
windres = $(Q)$(PREFIX_)windres
|
||||
|
||||
# Set utilities
|
||||
ifeq ($(OSTYPE),msys)
|
||||
HOST=mingw32-linux
|
||||
endif
|
||||
ifeq ($(HOST),mingw32-linux)
|
||||
ifeq ($(OSTYPE),msys)
|
||||
export EXEPOSTFIX = .exe
|
||||
else
|
||||
export EXEPOSTFIX =
|
||||
endif
|
||||
export SEP = /
|
||||
mkdir = -$(Q)mkdir -p
|
||||
checkpoint = $(Q)touch
|
||||
rm = $(Q)rm -f
|
||||
cp = $(Q)cp
|
||||
NUL = /dev/null
|
||||
else # mingw32-windows
|
||||
export EXEPOSTFIX = .exe
|
||||
ROS_EMPTY =
|
||||
export SEP = \$(ROS_EMPTY)
|
||||
mkdir = -$(Q)mkdir
|
||||
checkpoint = $(Q)copy /y NUL
|
||||
rm = $(Q)del /f /q
|
||||
cp = $(Q)copy /y
|
||||
NUL = NUL
|
||||
endif
|
||||
|
||||
ifneq ($(ROS_INTERMEDIATE),)
|
||||
INTERMEDIATE := $(ROS_INTERMEDIATE)
|
||||
else
|
||||
INTERMEDIATE := obj-$(ARCH)
|
||||
endif
|
||||
INTERMEDIATE_ := $(INTERMEDIATE)$(SEP)
|
||||
|
||||
ifneq ($(ROS_OUTPUT),)
|
||||
OUTPUT := $(ROS_OUTPUT)
|
||||
else
|
||||
OUTPUT := output-$(ARCH)
|
||||
endif
|
||||
OUTPUT_ := $(OUTPUT)$(SEP)
|
||||
|
||||
ifneq ($(ROS_CDOUTPUT),)
|
||||
CDOUTPUT := $(ROS_CDOUTPUT)
|
||||
else
|
||||
CDOUTPUT := reactos
|
||||
endif
|
||||
CDOUTPUT_ := $(CDOUTPUT)$(SEP)
|
||||
|
||||
ifneq ($(ROS_TEMPORARY),)
|
||||
TEMPORARY := $(ROS_TEMPORARY)
|
||||
else
|
||||
TEMPORARY := $(INTERMEDIATE)
|
||||
endif
|
||||
TEMPORARY_ := $(TEMPORARY)$(SEP)
|
||||
|
||||
ifneq ($(ROS_INSTALL),)
|
||||
INSTALL := $(ROS_INSTALL)
|
||||
else
|
||||
INSTALL := $(CDOUTPUT)
|
||||
endif
|
||||
INSTALL_ := $(INSTALL)$(SEP)
|
||||
|
||||
RBUILD_FLAGS := -rReactOS-$(ARCH).rbuild -DARCH=$(ARCH)
|
||||
|
||||
$(INTERMEDIATE):
|
||||
$(ECHO_MKDIR)
|
||||
${mkdir} $@
|
||||
|
||||
ifneq ($(INTERMEDIATE),$(OUTPUT))
|
||||
$(OUTPUT):
|
||||
$(ECHO_MKDIR)
|
||||
${mkdir} $@
|
||||
endif
|
||||
|
||||
ifneq ($(TEMPORARY),$(INTERMEDIATE))
|
||||
ifneq ($(TEMPORARY),$(OUTPUT))
|
||||
$(TEMPORARY):
|
||||
$(ECHO_MKDIR)
|
||||
${mkdir} $@
|
||||
endif
|
||||
endif
|
||||
|
||||
BUILDNO_H = $(INTERMEDIATE_)sdk$(SEP)include$(SEP)reactos$(SEP)buildno.h
|
||||
|
||||
include sdk/libs/lib.mak
|
||||
include sdk/tools/tools.mak
|
||||
-include $(ROS_AUTOMAKE)
|
||||
|
||||
PREAUTO := \
|
||||
$(BIN2C_TARGET) \
|
||||
$(BIN2RES_TARGET) \
|
||||
$(BUILDNO_H) \
|
||||
$(NCI_SERVICE_FILES) \
|
||||
$(GENDIB_DIB_FILES)
|
||||
|
||||
ifeq ($(ARCH),powerpc)
|
||||
PREAUTO += $(OFW_INTERFACE_SERVICE_FILES) $(PPCMMU_TARGETS)
|
||||
endif
|
||||
|
||||
ifeq ($(ROS_BUILDENGINE),)
|
||||
ROS_BUILDENGINE=$(RBUILD_TARGET)
|
||||
endif
|
||||
|
||||
$(ROS_AUTOMAKE): $(ROS_BUILDENGINE) $(XMLBUILDFILES) | $(BUILDNO_H)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) mingw
|
||||
|
||||
world: all bootcd livecd
|
||||
|
||||
universe:
|
||||
$(MAKE) KDBG=1 DBG=1 \
|
||||
ROS_AUTOMAKE=makefile-$(ARCH)-kd.auto \
|
||||
ROS_INSTALL=reactos-$(ARCH)-kd \
|
||||
ROS_INTERMEDIATE=obj-$(ARCH)-kd \
|
||||
ROS_OUTPUT=output-$(ARCH)-kd \
|
||||
world
|
||||
$(MAKE) KDBG=0 DBG=1 \
|
||||
ROS_AUTOMAKE=makefile-$(ARCH)-d.auto \
|
||||
ROS_INSTALL=reactos-$(ARCH)-d \
|
||||
ROS_INTERMEDIATE=obj-$(ARCH)-d \
|
||||
ROS_OUTPUT=output-$(ARCH)-d \
|
||||
world
|
||||
$(MAKE) KDBG=0 DBG=0 \
|
||||
ROS_AUTOMAKE=makefile-$(ARCH)-r.auto \
|
||||
ROS_INSTALL=reactos-$(ARCH)-r \
|
||||
ROS_INTERMEDIATE=obj-$(ARCH)-r \
|
||||
ROS_OUTPUT=output-$(ARCH)-r \
|
||||
world
|
||||
|
||||
.PHONY: rgenstat
|
||||
rgenstat: $(RGENSTAT_TARGET)
|
||||
$(ECHO_RGENSTAT)
|
||||
$(Q)$(RGENSTAT_TARGET) apistatus.lst apistatus.xml
|
||||
|
||||
.PHONY: cb
|
||||
cb: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) cb
|
||||
|
||||
.PHONY: msbuild
|
||||
msbuild: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) msbuild
|
||||
|
||||
.PHONY: msbuild_clean
|
||||
msbuild_clean: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c msbuild
|
||||
|
||||
.PHONY: depmap
|
||||
depmap: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) depmap
|
||||
|
||||
.PHONY: vreport
|
||||
vreport:$(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) vreport
|
||||
|
||||
.PHONY: msvc
|
||||
msvc: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) msvc
|
||||
|
||||
.PHONY: msvc6
|
||||
msvc6: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs6.00 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc7
|
||||
msvc7: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs7.00 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc71
|
||||
msvc71: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs7.10 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc8
|
||||
msvc8: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs8.00 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc9
|
||||
msvc9: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs9.00 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc10
|
||||
msvc10: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs10.00 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc6_clean
|
||||
msvc6_clean: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c -vs6.00 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc7_clean
|
||||
msvc7_clean: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c -vs7.00 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc71_clean
|
||||
msvc71_clean: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c -vs7.10 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc8_clean
|
||||
msvc8_clean: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c -vs8.00 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc9_clean
|
||||
msvc9_clean: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c -vs9.00 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc10_clean
|
||||
msvc10_clean: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c -vs10.00 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc_clean
|
||||
msvc_clean: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c msvc
|
||||
|
||||
.PHONY: msvc_clean_all
|
||||
msvc_clean_all: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c -vs6.00 -voversionconfiguration msvc
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c -vs7.00 -voversionconfiguration msvc
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c -vs7.10 -voversionconfiguration msvc
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -c -vs8.10 -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc7_install_debug
|
||||
msvc7_install_debug: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs7.00 -vcdebug -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc7_install_release
|
||||
msvc7_install_release: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs7.00 -vcrelease -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc7_install_speed
|
||||
msvc7_install_speed: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs7.00 -vcspeed -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc71_install_debug
|
||||
msvc71_install_debug: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs7.10 -vcdebug -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc71_install_release
|
||||
msvc71_install_release: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs7.10 -vcrelease -voversionconfiguration msvc
|
||||
|
||||
|
||||
.PHONY: msvc71_install_speed
|
||||
msvc71_install_speed: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs7.10 -vcspeed -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc8_install_debug
|
||||
msvc8_install_debug: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs8.00 -vcdebug -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc8_install_release
|
||||
msvc8_install_release: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs8.00 -vcrelease -voversionconfiguration msvc
|
||||
|
||||
.PHONY: msvc8_install_speed
|
||||
msvc8_install_speed: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) -vs8.00 -vcspeed -voversionconfiguration msvc
|
||||
|
||||
.PHONY: makefile_auto_clean
|
||||
makefile_auto_clean:
|
||||
-@$(rm) $(ROS_AUTOMAKE) $(PREAUTO) 2>$(NUL)
|
||||
|
||||
.PHONY: clean
|
||||
clean: makefile_auto_clean
|
||||
|
||||
.PHONY: depends
|
||||
depends: $(ROS_BUILDENGINE)
|
||||
$(ECHO_RBUILD)
|
||||
$(Q)$(ROS_BUILDENGINE) $(RBUILD_FLAGS) $(ROS_RBUILDFLAGS) mingw
|
||||
29
README
29
README
@@ -1,29 +0,0 @@
|
||||
========================
|
||||
ReactOS Version 0.3.x
|
||||
Updated Dec 16, 2006
|
||||
========================
|
||||
|
||||
1. What is ReactOS?
|
||||
|
||||
ReactOS is an Open Source effort to develop a quality operating system
|
||||
that is compatible with Windows NT applications and drivers.
|
||||
|
||||
The ReactOS project, although currently focused on Windows XP/2003
|
||||
drivers compatibility, is always keeping an eye toward compatibility with
|
||||
older version of Windows NT family ( NT 4.0, 2000 (NT 5.0)) and new
|
||||
Windows NT releases (Vista, etc). Applications (Win32 API) compatibility
|
||||
focus is Windows XP.
|
||||
|
||||
More information is available at http://www.reactos.org/.
|
||||
|
||||
2. Building ReactOS
|
||||
|
||||
See the INSTALL file for more details.
|
||||
|
||||
3. More information
|
||||
|
||||
See the media\doc subdirectory for some sparse notes.
|
||||
|
||||
4. Who is responsible
|
||||
|
||||
See the CREDITS file.
|
||||
@@ -1,113 +0,0 @@
|
||||
<?xml version="1.0"?>
|
||||
<!DOCTYPE project SYSTEM "tools/rbuild/project.dtd">
|
||||
<project name="ReactOS" makefile="makefile-amd64.auto" xmlns:xi="http://www.w3.org/2001/XInclude" allowwarnings="true">
|
||||
<xi:include href="config-amd64.rbuild">
|
||||
<xi:fallback>
|
||||
<xi:include href="config-amd64.template.rbuild" />
|
||||
</xi:fallback>
|
||||
</xi:include>
|
||||
|
||||
<xi:include href="ReactOS-generic.rbuild" />
|
||||
|
||||
<define name="_M_AMD64" />
|
||||
<define name="_AMD64_" />
|
||||
<define name="_M_AXP64" />
|
||||
<define name="__x86_64__" />
|
||||
<!-- define name="_X86AMD64_" / FIXME: what is this used for? -->
|
||||
<define name="_WIN64" />
|
||||
<define name="TARGET_amd64" host="true" />
|
||||
|
||||
<define name="USE_COMPILER_EXCEPTIONS" />
|
||||
<define name ="NO_UNDERSCORE_PREFIX" />
|
||||
|
||||
<property name="PLATFORM" value="PC"/>
|
||||
<property name="usewrc" value="false"/>
|
||||
<property name="WINEBUILD_FLAGS" value="--kill-at"/>
|
||||
|
||||
<group compilerset="gcc">
|
||||
<if property="OPTIMIZE" value="1">
|
||||
<compilerflag>-ftracer</compilerflag>
|
||||
<compilerflag>-momit-leaf-frame-pointer</compilerflag>
|
||||
</if>
|
||||
<compilerflag>-fms-extensions</compilerflag>
|
||||
<compilerflag>-mpreferred-stack-boundary=4</compilerflag>
|
||||
<compilerflag compiler="midl">-m64 --win64</compilerflag>
|
||||
<!-- compilerflag compiler="cc,cxx">-gstabs+</compilerflag -->
|
||||
<!-- compilerflag compiler="as">-gstabs+</compilerflag -->
|
||||
<compilerflag>-U_X86_</compilerflag>
|
||||
<compilerflag>-UWIN32</compilerflag>
|
||||
<compilerflag>-Wno-format</compilerflag>
|
||||
</group>
|
||||
|
||||
<group linkerset="ld">
|
||||
<linkerflag>-disable-stdcall-fixup</linkerflag>
|
||||
<linkerflag>-file-alignment=0x1000</linkerflag>
|
||||
<linkerflag>-section-alignment=0x1000</linkerflag>
|
||||
<linkerflag>--unique=.eh_frame</linkerflag>
|
||||
<linkerflag>-static</linkerflag>
|
||||
<linkerflag>--exclude-all-symbols</linkerflag>
|
||||
</group>
|
||||
|
||||
<if property="USERMODE" value="1">
|
||||
<directory name="base">
|
||||
<directory name="applications">
|
||||
<xi:include href="base/applications/applications.rbuild" />
|
||||
</directory>
|
||||
<directory name="services">
|
||||
<xi:include href="base/services/services.rbuild" />
|
||||
</directory>
|
||||
<directory name="setup">
|
||||
<xi:include href="base/setup/setup.rbuild" />
|
||||
</directory>
|
||||
<directory name="shell">
|
||||
<directory name="cmd">
|
||||
<xi:include href="base/shell/cmd/cmd.rbuild" />
|
||||
</directory>
|
||||
<directory name="explorer-new">
|
||||
<xi:include href="base/shell/explorer-new/explorer.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="system">
|
||||
<xi:include href="base/system/system.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="dll">
|
||||
<xi:include href="dll/dll.rbuild" />
|
||||
</directory>
|
||||
</if>
|
||||
|
||||
<directory name="boot">
|
||||
<xi:include href="boot/boot.rbuild" />
|
||||
</directory>
|
||||
<directory name="drivers">
|
||||
<xi:include href="drivers/drivers.rbuild" />
|
||||
</directory>
|
||||
<directory name="hal">
|
||||
<xi:include href="hal/hal.rbuild" />
|
||||
</directory>
|
||||
<directory name="include">
|
||||
<xi:include href="include/directory.rbuild" />
|
||||
</directory>
|
||||
<directory name="lib">
|
||||
<xi:include href="lib/lib.rbuild" />
|
||||
</directory>
|
||||
<directory name="media">
|
||||
<xi:include href="media/media.rbuild" />
|
||||
</directory>
|
||||
<directory name="modules">
|
||||
<xi:include href="modules/directory.rbuild" />
|
||||
</directory>
|
||||
<directory name="ntoskrnl">
|
||||
<xi:include href="ntoskrnl/ntoskrnl.rbuild" />
|
||||
<if property="BUILD_MP" value="1">
|
||||
<xi:include href="ntoskrnl/ntkrnlmp.rbuild" />
|
||||
</if>
|
||||
</directory>
|
||||
<directory name="subsystems">
|
||||
<xi:include href="subsystems/subsystems.rbuild" />
|
||||
</directory>
|
||||
<directory name="tools">
|
||||
<xi:include href="tools/tools.rbuild" />
|
||||
</directory>
|
||||
|
||||
</project>
|
||||
@@ -1,163 +0,0 @@
|
||||
<?xml version="1.0"?>
|
||||
<!DOCTYPE project SYSTEM "tools/rbuild/project.dtd">
|
||||
<project name="ReactOS" makefile="makefile-arm.auto" xmlns:xi="http://www.w3.org/2001/XInclude">
|
||||
<xi:include href="config-arm.rbuild">
|
||||
<xi:fallback>
|
||||
<xi:include href="config-arm.template.rbuild" />
|
||||
</xi:fallback>
|
||||
</xi:include>
|
||||
|
||||
<xi:include href="ReactOS-generic.rbuild" />
|
||||
|
||||
<!-- <define name="_M_ARM" /> Already defined by toolchain -->
|
||||
<define name="_ARM_" />
|
||||
<define name="__arm__" />
|
||||
<define name="TARGET_arm" host="true" />
|
||||
|
||||
<define name="USE_COMPILER_EXCEPTIONS" />
|
||||
|
||||
<property name="WINEBUILD_FLAGS" value="--kill-at"/>
|
||||
|
||||
<include>include/reactos/arm</include>
|
||||
|
||||
<if property="SARCH" value="versatile">
|
||||
<define name="BOARD_CONFIG_VERSATILE"/>
|
||||
</if>
|
||||
|
||||
<group compilerset="gcc">
|
||||
<if property="OPTIMIZE" value="1">
|
||||
<compilerflag>-ftracer</compilerflag>
|
||||
</if>
|
||||
<compilerflag>-fms-extensions</compilerflag>
|
||||
<compilerflag>-Wno-attributes</compilerflag>
|
||||
<compilerflag>-U_UNICODE</compilerflag>
|
||||
<compilerflag>-UUNICODE</compilerflag>
|
||||
</group>
|
||||
|
||||
|
||||
<define name="__MSVCRT__"/> <!-- DUBIOUS -->
|
||||
|
||||
<group linkerset="ld">
|
||||
<linkerflag>--strip-debug</linkerflag> <!-- INVESTIGATE -->
|
||||
<linkerflag>-static</linkerflag> <!-- INVESTIGATE -->
|
||||
<linkerflag>-file-alignment=0x1000</linkerflag>
|
||||
<linkerflag>-section-alignment=0x1000</linkerflag>
|
||||
</group>
|
||||
|
||||
<directory name="media">
|
||||
<directory name="nls">
|
||||
<xi:include href="media/nls/nls.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="lib">
|
||||
<directory name="drivers">
|
||||
<directory name="csq">
|
||||
<xi:include href="lib/drivers/csq/csq.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="cportlib">
|
||||
<xi:include href="lib/cportlib/cportlib.rbuild" />
|
||||
</directory>
|
||||
<directory name="debugsup">
|
||||
<xi:include href="lib/debugsup/debugsup.rbuild" />
|
||||
</directory>
|
||||
<directory name="3rdparty">
|
||||
<directory name="zlib">
|
||||
<xi:include href="lib/3rdparty/zlib/zlib.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="rtl">
|
||||
<xi:include href="lib/rtl/rtl.rbuild" />
|
||||
</directory>
|
||||
<directory name="host">
|
||||
<directory name="wcsfuncs">
|
||||
<xi:include href="lib/host/wcsfuncs/wcsfuncs.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="inflib">
|
||||
<xi:include href="lib/inflib/inflib.rbuild" />
|
||||
</directory>
|
||||
<directory name="newinflib">
|
||||
<xi:include href="lib/newinflib/inflib.rbuild" />
|
||||
</directory>
|
||||
<directory name="cmlib">
|
||||
<xi:include href="lib/cmlib/cmlib.rbuild" />
|
||||
</directory>
|
||||
<directory name="pseh">
|
||||
<xi:include href="lib/pseh/pseh.rbuild" />
|
||||
</directory>
|
||||
<directory name="rossym">
|
||||
<xi:include href="lib/rossym/rossym.rbuild" />
|
||||
</directory>
|
||||
<directory name="sdk">
|
||||
<directory name="crt">
|
||||
<xi:include href="lib/sdk/crt/crt.rbuild" />
|
||||
<xi:include href="lib/sdk/crt/libcntpr.rbuild" />
|
||||
</directory>
|
||||
<directory name="ioevent">
|
||||
<xi:include href="lib/sdk/ioevent/ioevent.rbuild" />
|
||||
</directory>
|
||||
<directory name="nt">
|
||||
<xi:include href="lib/sdk/nt/nt.rbuild" />
|
||||
</directory>
|
||||
<directory name="wdmguid">
|
||||
<xi:include href="lib/sdk/wdmguid/wdmguid.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="ntdllsys">
|
||||
<xi:include href="lib/ntdllsys/ntdllsys.rbuild" />
|
||||
</directory>
|
||||
<directory name="smlib">
|
||||
<xi:include href="lib/smlib/smlib.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="include">
|
||||
<xi:include href="include/directory.rbuild" />
|
||||
</directory>
|
||||
<directory name="tools">
|
||||
<xi:include href="tools/tools.rbuild" />
|
||||
</directory>
|
||||
<directory name="ntoskrnl">
|
||||
<xi:include href="ntoskrnl/ntoskrnl.rbuild" />
|
||||
</directory>
|
||||
<directory name="hal">
|
||||
<xi:include href="hal/hal.rbuild" />
|
||||
</directory>
|
||||
<directory name="boot">
|
||||
<xi:include href="boot/boot.rbuild" />
|
||||
</directory>
|
||||
<directory name="drivers">
|
||||
<directory name="storage">
|
||||
<directory name="class">
|
||||
<directory name="ramdisk">
|
||||
<xi:include href="drivers/storage/class/ramdisk/ramdisk.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="filesystems">
|
||||
<directory name="fastfat">
|
||||
<xi:include href="drivers/filesystems/fastfat/vfatfs.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="base">
|
||||
<directory name="kdcom">
|
||||
<xi:include href="drivers/base/kdcom/kdcom.rbuild" />
|
||||
</directory>
|
||||
<directory name="bootvid">
|
||||
<xi:include href="drivers/base/bootvid/bootvid.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="dll">
|
||||
<directory name="ntdll">
|
||||
<xi:include href="dll/ntdll/ntdll.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
<directory name="base">
|
||||
<directory name="system">
|
||||
<directory name="smss">
|
||||
<xi:include href="base/system/smss/smss.rbuild" />
|
||||
</directory>
|
||||
</directory>
|
||||
</directory>
|
||||
</project>
|
||||
@@ -1,152 +0,0 @@
|
||||
<?xml version="1.0"?>
|
||||
<!DOCTYPE group SYSTEM "tools/rbuild/project.dtd">
|
||||
<group xmlns:xi="http://www.w3.org/2001/XInclude">
|
||||
<xi:include href="baseaddress.rbuild" />
|
||||
|
||||
<define name="__REACTOS__" />
|
||||
<define name="__REACTOS__" host="true" />
|
||||
|
||||
<if property="DBG" value="1">
|
||||
<define name="DBG">1</define>
|
||||
<define name="_SEH_ENABLE_TRACE" />
|
||||
<property name="DBG_OR_KDBG" value="true" />
|
||||
</if>
|
||||
<if property="DBG" value="0">
|
||||
<define name="DBG">0</define>
|
||||
</if>
|
||||
|
||||
<if property="KDBG" value="1">
|
||||
<define name="KDBG">1</define>
|
||||
<property name="DBG_OR_KDBG" value="true" />
|
||||
</if>
|
||||
|
||||
<!-- The version target valid values are: Nt4 , NT5 , NT51 -->
|
||||
<property name="VERSION_TARGET" value="NT52" />
|
||||
|
||||
<if property="VERSION_TARGET" value="NT4">
|
||||
<define name="WINVER">0x400</define>
|
||||
<define name="_WIN32_IE">0x600</define>
|
||||
<define name="_WIN32_WINNT">0x400</define>
|
||||
<define name="_WIN32_WINDOWS">0x400</define>
|
||||
<define name="_SETUPAPI_VER">0x400</define>
|
||||
</if>
|
||||
|
||||
<if property="VERSION_TARGET" value="NT5">
|
||||
<define name="WINVER">0x500</define>
|
||||
<define name="_WIN32_IE">0x600</define>
|
||||
<define name="_WIN32_WINNT">0x500</define>
|
||||
<define name="_WIN32_WINDOWS">0x500</define>
|
||||
<define name="_SETUPAPI_VER">0x500</define>
|
||||
</if>
|
||||
|
||||
<if property="VERSION_TARGET" value="NT51">
|
||||
<define name="WINVER">0x501</define>
|
||||
<define name="_WIN32_IE">0x600</define>
|
||||
<define name="_WIN32_WINNT">0x501</define>
|
||||
<define name="_WIN32_WINDOWS">0x501</define>
|
||||
<define name="_SETUPAPI_VER">0x501</define>
|
||||
</if>
|
||||
|
||||
<if property="VERSION_TARGET" value="NT52">
|
||||
<define name="WINVER">0x502</define>
|
||||
<define name="_WIN32_IE">0x600</define>
|
||||
<define name="_WIN32_WINNT">0x502</define>
|
||||
<define name="_WIN32_WINDOWS">0x502</define>
|
||||
<define name="_SETUPAPI_VER">0x502</define>
|
||||
</if>
|
||||
|
||||
<if property="VERSION_TARGET" value="NT6">
|
||||
<define name="WINVER">0x600</define>
|
||||
<define name="_WIN32_IE">0x600</define>
|
||||
<define name="_WIN32_WINNT">0x600</define>
|
||||
<define name="_WIN32_WINDOWS">0x600</define>
|
||||
<define name="_SETUPAPI_VER">0x600</define>
|
||||
</if>
|
||||
|
||||
<include>sdk/include</include>
|
||||
<include root="intermediate">sdk/include</include>
|
||||
<include>sdk/include/psdk</include>
|
||||
<include root="intermediate">sdk/include/psdk</include>
|
||||
<include>sdk/include/dxsdk</include>
|
||||
<include root="intermediate">sdk/include/dxsdk</include>
|
||||
<include>sdk/include/crt</include>
|
||||
<include compilerset="gcc">sdk/include/crt/mingw32</include>
|
||||
<include compilerset="msc">sdk/include/crt/msc</include>
|
||||
<include>sdk/include/ddk</include>
|
||||
<include>sdk/include/GL</include>
|
||||
<include>sdk/include/ndk</include>
|
||||
<include>sdk/include/reactos</include>
|
||||
<include root="intermediate">sdk/include/reactos</include>
|
||||
<include root="intermediate">sdk/include/reactos/mc</include>
|
||||
<include>sdk/include/reactos/libs</include>
|
||||
|
||||
<include host="true">sdk/include</include>
|
||||
<include host="true" root="intermediate">sdk/include</include>
|
||||
<include host="true">sdk/include/reactos</include>
|
||||
<include host="true">sdk/include/reactos/wine</include>
|
||||
|
||||
<group compilerset="gcc">
|
||||
<compilerflag>-Wall</compilerflag>
|
||||
<compilerflag>-Wno-char-subscripts</compilerflag>
|
||||
<compilerflag compiler="cxx">-Wno-non-virtual-dtor</compilerflag>
|
||||
</group>
|
||||
|
||||
<group compilerset="msc">
|
||||
<define name="inline" compiler="cc">__inline</define>
|
||||
<define name="__STDC__" compiler="cc">1</define>
|
||||
<compilerflag>/Zl</compilerflag>
|
||||
<compilerflag>/Zi</compilerflag>
|
||||
<compilerflag>/W1</compilerflag>
|
||||
</group>
|
||||
|
||||
<group compilerset="gcc">
|
||||
<if property="OPTIMIZE" value="1">
|
||||
<compilerflag>-Os</compilerflag>
|
||||
</if>
|
||||
<if property="OPTIMIZE" value="2">
|
||||
<compilerflag>-Os</compilerflag>
|
||||
</if>
|
||||
<if property="OPTIMIZE" value="3">
|
||||
<compilerflag>-O1</compilerflag>
|
||||
</if>
|
||||
<if property="OPTIMIZE" value="4">
|
||||
<compilerflag>-O2</compilerflag>
|
||||
</if>
|
||||
<if property="OPTIMIZE" value="5">
|
||||
<compilerflag>-O3</compilerflag>
|
||||
</if>
|
||||
|
||||
<compilerflag>-fno-strict-aliasing</compilerflag>
|
||||
<compilerflag>-Wpointer-arith</compilerflag>
|
||||
<compilerflag>-Wno-multichar</compilerflag>
|
||||
<compilerflag>-Wno-error=uninitialized</compilerflag>
|
||||
<!-- compilerflag>-H</compilerflag> enable this for header traces -->
|
||||
</group>
|
||||
|
||||
<group compilerset="msc">
|
||||
<if property="OPTIMIZE" value="1">
|
||||
<compilerflag>/O1</compilerflag>
|
||||
</if>
|
||||
<if property="OPTIMIZE" value="2">
|
||||
<compilerflag>/O2</compilerflag>
|
||||
</if>
|
||||
<if property="OPTIMIZE" value="3">
|
||||
<compilerflag>/Ox /GS-</compilerflag>
|
||||
<compilerflag>/Ot</compilerflag>
|
||||
</if>
|
||||
<if property="OPTIMIZE" value="4">
|
||||
<compilerflag>/Ox /GS-</compilerflag>
|
||||
<compilerflag>/Os</compilerflag>
|
||||
</if>
|
||||
<if property="OPTIMIZE" value="5">
|
||||
<compilerflag>/Ox /GS-</compilerflag>
|
||||
<compilerflag>/Os</compilerflag>
|
||||
<compilerflag>/Ob2</compilerflag>
|
||||
<compilerflag>/GF</compilerflag>
|
||||
<compilerflag>/Gy</compilerflag>
|
||||
</if>
|
||||
|
||||
<compilerflag>/GS-</compilerflag>
|
||||
</group>
|
||||
|
||||
</group>
|
||||
@@ -1,45 +0,0 @@
|
||||
<?xml version="1.0"?>
|
||||
<!DOCTYPE project SYSTEM "tools/rbuild/project.dtd">
|
||||
<project name="ReactOS" makefile="makefile-i386.auto" xmlns:xi="http://www.w3.org/2001/XInclude">
|
||||
<xi:include href="config.rbuild">
|
||||
<xi:fallback>
|
||||
<xi:include href="config.template.rbuild" />
|
||||
</xi:fallback>
|
||||
</xi:include>
|
||||
|
||||
<xi:include href="ReactOS-generic.rbuild" />
|
||||
|
||||
<define name="_M_IX86" />
|
||||
<define name="_X86_" />
|
||||
<define name="__i386__" />
|
||||
<define name="TARGET_i386" host="true" />
|
||||
|
||||
<define name="USE_COMPILER_EXCEPTIONS" />
|
||||
<define name="_USE_32BIT_TIME_T" />
|
||||
|
||||
<property name="PLATFORM" value="PC"/>
|
||||
|
||||
<group compilerset="gcc">
|
||||
<if property="OPTIMIZE" value="1">
|
||||
<compilerflag>-ftracer</compilerflag>
|
||||
<compilerflag>-momit-leaf-frame-pointer</compilerflag>
|
||||
</if>
|
||||
<compilerflag>-fms-extensions</compilerflag>
|
||||
<compilerflag>-mpreferred-stack-boundary=2</compilerflag>
|
||||
<compilerflag compiler="midl">-m32 --win32</compilerflag>
|
||||
<compilerflag compiler="cc,cxx">-gstabs+</compilerflag>
|
||||
<compilerflag compiler="cc,cxx">-fno-set-stack-executable</compilerflag>
|
||||
<compilerflag compiler="cc,cxx">-fno-optimize-sibling-calls</compilerflag>
|
||||
<compilerflag compiler="as">-gstabs+</compilerflag>
|
||||
</group>
|
||||
|
||||
<group linkerset="ld">
|
||||
<linkerflag>-disable-stdcall-fixup</linkerflag>
|
||||
<linkerflag>-file-alignment=0x1000</linkerflag>
|
||||
<linkerflag>-section-alignment=0x1000</linkerflag>
|
||||
</group>
|
||||
|
||||
<directory name="sdk">
|
||||
<xi:include href="sdk/sdk.rbuild" />
|
||||
</directory>
|
||||
</project>
|
||||
@@ -1,25 +0,0 @@
|
||||
<?xml version="1.0"?>
|
||||
<!DOCTYPE project SYSTEM "tools/rbuild/project.dtd">
|
||||
<project name="ReactOS" makefile="makefile-ppc.auto" xmlns:xi="http://www.w3.org/2001/XInclude">
|
||||
<xi:include href="config-ppc.rbuild">
|
||||
<xi:fallback>
|
||||
<xi:include href="config-ppc.template.rbuild" />
|
||||
</xi:fallback>
|
||||
</xi:include>
|
||||
|
||||
<xi:include href="ReactOS-generic.rbuild" />
|
||||
|
||||
<property name="MKHIVE_OPTIONS" value="-be" />
|
||||
<property name="OFWLDR_LINKFORMAT" value="-L$(INTERMEDIATE)/lib/ppcmmu -lppcmmu_code -nostdlib -nostartfiles -lgcc -Wl,-e,__start -Wl,-Ttext,0xe00000 -N"/>
|
||||
<property name="NTOSKRNL_SHARED" value="-Wl,--file-alignment,0x1000 -Wl,--section-alignment,0x1000 -nostartfiles -shared"/>
|
||||
|
||||
<define name="__MSVCRT__"/>
|
||||
<compilerflag>-fshort-wchar</compilerflag>
|
||||
<compilerflag>-fsigned-char</compilerflag>
|
||||
<compilerflag>-mfull-toc</compilerflag>
|
||||
<compilerflag>-meabi</compilerflag>
|
||||
<compilerflag>-O2</compilerflag>
|
||||
<compilerflag>-Wno-strict-aliasing</compilerflag>
|
||||
<compilerflag compiler="cc,cxx">-gstabs+</compilerflag>
|
||||
<compilerflag compiler="as">-gstabs+</compilerflag>
|
||||
</project>
|
||||
@@ -1,30 +0,0 @@
|
||||
; Format:
|
||||
; COMPONENT_NAME PATH_TO_COMPONENT_SOURCES
|
||||
; COMPONENT_NAME - Name of the module. Eg. kernel32.
|
||||
; PATH_TO_COMPONENT_SOURCES - Relative path to sources (relative to where rgenstat is run from).
|
||||
|
||||
advapi32 ../reactos/dll/win32/advapi32
|
||||
crtdll ../reactos/dll/win32/crtdll
|
||||
gdi32 ../reactos/dll/win32/gdi32
|
||||
gdiplus ../reactos/dll/win32/gdiplus
|
||||
iphlpapi ../reactos/dll/win32/iphlpapi
|
||||
kernel32 ../reactos/dll/win32/kernel32
|
||||
msvcrt ../reactos/dll/win32/msvcrt
|
||||
rasapi32 ../reactos/dll/win32/rasapi32
|
||||
rasdlg ../reactos/dll/win32/rasdlg
|
||||
rasman ../reactos/dll/win32/rasman
|
||||
rpcrt4 ../reactos/dll/win32/rpcrt4
|
||||
secur32 ../reactos/dll/win32/secur32
|
||||
snmpapi ../reactos/dll/win32/snmpapi
|
||||
user32 ../reactos/dll/win32/user32
|
||||
version ../reactos/dll/win32/version
|
||||
winspool ../reactos/dll/win32/winspool
|
||||
ws2_32 ../reactos/dll/win32/ws2_32
|
||||
wsock32 ../reactos/dll/win32/wsock32
|
||||
videoprt ../reactos/drivers/video/videoprt
|
||||
ndis ../reactos/drivers/network/ndis
|
||||
tdi ../reactos/drivers/network/tdi
|
||||
scsiport ../reactos/drivers/storage/scsiport
|
||||
ntoskrnl ../reactos/ntoskrnl
|
||||
rtl ../reactos/lib/rtl
|
||||
win32k ../reactos/subsystems/win32/win32k
|
||||
@@ -1,263 +0,0 @@
|
||||
<?xml version="1.0"?>
|
||||
<!DOCTYPE group SYSTEM "tools/rbuild/project.dtd">
|
||||
<group xmlns:xi="http://www.w3.org/2001/XInclude">
|
||||
<property name="BASEADDRESS_REGTESTS" value="0x07000000" />
|
||||
<property name="BASEADDRESS_NOTIFYHOOK" value="0x08000000" />
|
||||
<property name="BASEADDRESS_FAULTREP" value="0x107A0000" />
|
||||
<property name="BASEADDRESS_QMGRPRXY" value="0x1f710000" />
|
||||
<property name="BASEADDRESS_CRYPTDLG" value="0x209c0000" />
|
||||
<property name="BASEADDRESS_COMCAT" value="0x20a50000" />
|
||||
<property name="BASEADDRESS_WINDOWSCODECS" value="0x26c40000" />
|
||||
<property name="BASEADDRESS_DEVENUM" value="0x35670000" />
|
||||
<property name="BASEADDRESS_RSABASE" value="0x35700000" />
|
||||
<property name="BASEADDRESS_RSAENH" value="0x35780000" />
|
||||
<property name="BASEADDRESS_URL" value="0x42ea0000" />
|
||||
<property name="BASEADDRESS_WLANAPI" value="0x470f0000" />
|
||||
<property name="BASEADDRESS_PIDGEN" value="0x473e0000" />
|
||||
<property name="BASEADDRESS_DWMAPI" value="0x4a3f0000" />
|
||||
<property name="BASEADDRESS_T2EMBED" value="0x4b310000" />
|
||||
<property name="BASEADDRESS_MSFTEDIT" value="0x4b460000" />
|
||||
<property name="BASEADDRESS_LOADPERF" value="0x4b920000" />
|
||||
<property name="BASEADDRESS_MPRAPI" value="0x4c400000" />
|
||||
<property name="BASEADDRESS_WUAPI" value="0x506a0000" />
|
||||
<property name="BASEADDRESS_SRCLIENT" value="0x512c0000" />
|
||||
<property name="BASEADDRESS_PSTOREC" value="0x513d0000" />
|
||||
<property name="BASEADDRESS_LPK" value="0x516c0000" />
|
||||
<property name="BASEADDRESS_MSGSM32ACM" value="0x56db0000" />
|
||||
<property name="BASEADDRESS_MSDVBNP" value="0x58280000" />
|
||||
<property name="BASEADDRESS_MSG711ACM" value="0x584f0000" />
|
||||
<property name="BASEADDRESS_IMAADP32ACM" value="0x585e0000" />
|
||||
<property name="BASEADDRESS_BDAPLGIN" value="0x58600000" />
|
||||
<property name="BASEADDRESS_TELEPHON" value="0x58750000" />
|
||||
<property name="BASEADDRESS_PWRCFG" value="0x587e0000" />
|
||||
<property name="BASEADDRESS_MMSYS" value="0x588a0000" />
|
||||
<property name="BASEADDRESS_JOY" value="0x589b0000" />
|
||||
<property name="BASEADDRESS_QMGR" value="0x59620000" />
|
||||
<property name="BASEADDRESS_MSVIDCTL" value="0x59660000" />
|
||||
<property name="BASEADDRESS_UXTHEME" value="0x5ad70000" />
|
||||
<property name="BASEADDRESS_VDMDBG" value="0x5b0d0000" />
|
||||
<property name="BASEADDRESS_UNTFS" value="0x5b340000" />
|
||||
<property name="BASEADDRESS_OBJSEL" value="0x5b400000" />
|
||||
<property name="BASEADDRESS_UFAT" value="0x5b570000" />
|
||||
<property name="BASEADDRESS_TAPIUI" value="0x5b770000" />
|
||||
<property name="BASEADDRESS_UEXT2" value="0x5b7a0000" />
|
||||
<property name="BASEADDRESS_SLAYER" value="0x5c7e0000" />
|
||||
<property name="BASEADDRESS_USRMGR" value="0x5c900000" />
|
||||
<property name="BASEADDRESS_SHIMGVW" value="0x5cb00000" />
|
||||
<property name="BASEADDRESS_COMMCTRL" value="0x5d090000" />
|
||||
<property name="BASEADDRESS_DPLAYX" value="0x5e080000" />
|
||||
<property name="BASEADDRESS_INPUT" value="0x5e400000" />
|
||||
<property name="BASEADDRESS_NTLANMAN" value="0x5f380000" />
|
||||
<property name="BASEADDRESS_DINPUT" value="0x5f580000" />
|
||||
<property name="BASEADDRESS_NETID" value="0x5f660000" />
|
||||
<property name="BASEADDRESS_NTPRINT" value="0x5f6a0000" />
|
||||
<property name="BASEADDRESS_MSSIP32" value="0x60430000" />
|
||||
<property name="BASEADDRESS_MSISIP" value="0x60b10000" />
|
||||
<property name="BASEADDRESS_INSENG" value="0x61000000" />
|
||||
<property name="BASEADDRESS_QEDIT" value="0x611c0000" />
|
||||
<property name="BASEADDRESS_MODEMUI" value="0x61650000" />
|
||||
<property name="BASEADDRESS_MAPI32" value="0x62250000" />
|
||||
<property name="BASEADDRESS_MCIWAVE" value="0x622a0000" />
|
||||
<property name="BASEADDRESS_MCISEQ" value="0x622b0000" />
|
||||
<property name="BASEADDRESS_MCIQTZ32" value="0x622c0000" />
|
||||
<property name="BASEADDRESS_MCICDA" value="0x622e0000" />
|
||||
<property name="BASEADDRESS_LOCALUI" value="0x62f70000" />
|
||||
<property name="BASEADDRESS_HDWWIZ" value="0x64d40000" />
|
||||
<property name="BASEADDRESS_TIMEDATE" value="0x64da0000" />
|
||||
<property name="BASEADDRESS_SYSDM" value="0x64dd0000" />
|
||||
<property name="BASEADDRESS_NCPL" value="0x64ea0000" />
|
||||
<property name="BASEADDRESS_MAIN" value="0x64f40000" />
|
||||
<property name="BASEADDRESS_INTL" value="0x64fb0000" />
|
||||
<property name="BASEADDRESS_DESK" value="0x65080000" />
|
||||
<property name="BASEADDRESS_APPWIZ" value="0x65100000" />
|
||||
<property name="BASEADDRESS_MLANG" value="0x65140000" />
|
||||
<property name="BASEADDRESS_ACCESS" value="0x65180000" />
|
||||
<property name="BASEADDRESS_ITSS" value="0x66370000" />
|
||||
<property name="BASEADDRESS_ITIRCL" value="0x663a0000" />
|
||||
<property name="BASEADDRESS_INETMIB1" value="0x666f0000" />
|
||||
<property name="BASEADDRESS_INITPKI" value="0x66b00000" />
|
||||
<property name="BASEADDRESS_WSHTCPIP" value="0x677b0000" />
|
||||
<property name="BASEADDRESS_CRYPT32" value="0x67ab0000" />
|
||||
<property name="BASEADDRESS_HTTPAPI" value="0x67ae0000" />
|
||||
<property name="BASEADDRESS_HID" value="0x688f0000" />
|
||||
<property name="BASEADDRESS_PSXDLL" value="0x68eb0000" />
|
||||
<property name="BASEADDRESS_PSAPI" value="0x68f70000" />
|
||||
<property name="BASEADDRESS_KSPROXY" value="0x68f90000" />
|
||||
<property name="BASEADDRESS_GETUNAME" value="0x69110000" />
|
||||
<property name="BASEADDRESS_OLEACC" value="0x69640000" />
|
||||
<property name="BASEADDRESS_WINMM" value="0x697d0000" />
|
||||
<property name="BASEADDRESS_MSIMG32" value="0x69cc0000" />
|
||||
<property name="BASEADDRESS_BROWSEUI" value="0x69cd0000" />
|
||||
<property name="BASEADDRESS_NETPLWIZ" value="0x6a240000" />
|
||||
<property name="BASEADDRESS_SHELL32" value="0x6a360000" />
|
||||
<property name="BASEADDRESS_UNICODE" value="0x6b200000" />
|
||||
<property name="BASEADDRESS_ADVPACK" value="0x6b300000" />
|
||||
<property name="BASEADDRESS_CONTROL" value="0x6b310000" />
|
||||
<property name="BASEADDRESS_NCPA" value="0x6b320000" />
|
||||
<property name="BASEADDRESS_DBGHELP" value="0x6b330000" />
|
||||
<property name="BASEADDRESS_DINPUT8" value="0x6b340000" />
|
||||
<property name="BASEADDRESS_DXDIAGN" value="0x6b350000" />
|
||||
<property name="BASEADDRESS_DSOUND" value="0x6b360000" />
|
||||
<property name="BASEADDRESS_GLU32" value="0x6b370000" />
|
||||
<property name="BASEADDRESS_MESA32" value="0x6b380000" />
|
||||
<property name="BASEADDRESS_OPENGL32" value="0x6b390000" />
|
||||
<property name="BASEADDRESS_SECUR32" value="0x6b3a0000" />
|
||||
<property name="BASEADDRESS_SMDLL" value="0x6b3b0000" />
|
||||
<property name="BASEADDRESS_URLMON" value="0x6b3c0000" />
|
||||
<property name="BASEADDRESS_SERIALUI" value="0x6b3d0000" />
|
||||
<property name="BASEADDRESS_HLINK" value="0x6c6e0000" />
|
||||
<property name="BASEADDRESS_DESKMON" value="0x6d400000" />
|
||||
<property name="BASEADDRESS_DESKADP" value="0x6d410000" />
|
||||
<property name="BASEADDRESS_WLDAP32" value="0x6e130000" />
|
||||
<property name="BASEADDRESS_SXS" value="0x6e160000" />
|
||||
<property name="BASEADDRESS_SCHANNEL" value="0x6e360000" />
|
||||
<property name="BASEADDRESS_CONSOLE" value="0x6e4d0000" />
|
||||
<property name="BASEADDRESS_COMPSTUI" value="0x6ec10000" />
|
||||
<property name="BASEADDRESS_HNETCFG" value="0x6edb0000" />
|
||||
<property name="BASEADDRESS_CLB" value="0x6f2b0000" />
|
||||
<property name="BASEADDRESS_FONTEXT" value="0x6f7b0000" />
|
||||
<property name="BASEADDRESS_JSCRIPT" value="0x6fe80000" />
|
||||
<property name="BASEADDRESS_CARDS" value="0x701a0000" />
|
||||
<property name="BASEADDRESS_WININET" value="0x70200000" />
|
||||
<property name="BASEADDRESS_WINHTTP" value="0x70c60000" />
|
||||
<property name="BASEADDRESS_BATT" value="0x70cb0000" />
|
||||
<property name="BASEADDRESS_AMSTREAM" value="0x71030000" />
|
||||
<property name="BASEADDRESS_ACLUI" value="0x71550000" />
|
||||
<property name="BASEADDRESS_DHCPCSVC" value="0x71650000" />
|
||||
<property name="BASEADDRESS_SHDOCVW" value="0x71700000" />
|
||||
<property name="BASEADDRESS_ACTXPRXY" value="0x71800000" />
|
||||
<property name="BASEADDRESS_MSWSOCK" value="0x71a30000" />
|
||||
<property name="BASEADDRESS_WSOCK32" value="0x71ab0000" />
|
||||
<property name="BASEADDRESS_ACLEDIT" value="0x71b70000" />
|
||||
<property name="BASEADDRESS_NETAPI32" value="0x71c00000" />
|
||||
<property name="BASEADDRESS_OLESVR32" value="0x71dd0000" />
|
||||
<property name="BASEADDRESS_OLECLI32" value="0x71df0000" />
|
||||
<property name="BASEADDRESS_OLETHK32" value="0x71e10000" />
|
||||
<property name="BASEADDRESS_NETEVENT" value="0x71e70000" />
|
||||
<property name="BASEADDRESS_DPLAY" value="0x71e80000" />
|
||||
<property name="BASEADDRESS_SECURITY" value="0x71f10000" />
|
||||
<property name="BASEADDRESS_MSSIGN32" value="0x720c0000" />
|
||||
<property name="BASEADDRESS_CRYPTUI" value="0x720d0000" />
|
||||
<property name="BASEADDRESS_WINFAX" value="0x722c0000" />
|
||||
<property name="BASEADDRESS_WINSCARD" value="0x723d0000" />
|
||||
<property name="BASEADDRESS_DEVMGR" value="0x72a90000" />
|
||||
<property name="BASEADDRESS_MSADP32ACM" value="0x72cb0000" />
|
||||
<property name="BASEADDRESS_WDMAUD" value="0x72d20000" />
|
||||
<property name="BASEADDRESS_WINSPOOL" value="0x72f50000" />
|
||||
<property name="BASEADDRESS_SOFTPUB" value="0x73290000" />
|
||||
<property name="BASEADDRESS_MSCAT32" value="0x732b0000" />
|
||||
<property name="BASEADDRESS_MSTASK" value="0x73520000" />
|
||||
<property name="BASEADDRESS_TRAFFIC" value="0x73550000" />
|
||||
<property name="BASEADDRESS_MCIAVI32" value="0x73610000" />
|
||||
<property name="BASEADDRESS_MSVIDC32" value="0x73650000" />
|
||||
<property name="BASEADDRESS_MSRLE32" value="0x73660000" />
|
||||
<property name="BASEADDRESS_MSDMO" value="0x73670000" />
|
||||
<property name="BASEADDRESS_AVICAP32" value="0x739e0000" />
|
||||
<property name="BASEADDRESS_AVIFIL32" value="0x73ac0000" />
|
||||
<property name="BASEADDRESS_MSCMS" value="0x73af0000" />
|
||||
<property name="BASEADDRESS_DCIMAN32" value="0x73b10000" />
|
||||
<property name="BASEADDRESS_STI" value="0x73b60000" />
|
||||
<property name="BASEADDRESS_ICCVID" value="0x73bc0000" />
|
||||
<property name="BASEADDRESS_COREDLL" value="0x73d80000" />
|
||||
<property name="BASEADDRESS_LZ32" value="0x73d80000" />
|
||||
<property name="BASEADDRESS_KSUSER" value="0x73ea0000" />
|
||||
<property name="BASEADDRESS_ICMP" value="0x741f0000" />
|
||||
<property name="BASEADDRESS_SPOOLSS" value="0x742a0000" />
|
||||
<property name="BASEADDRESS_MSIMTF" value="0x746b0000" />
|
||||
<property name="BASEADDRESS_MSCTF" value="0x746e0000" />
|
||||
<property name="BASEADDRESS_QUARTZ" value="0x747d0000" />
|
||||
<property name="BASEADDRESS_USERENV" value="0x74850000" />
|
||||
<property name="BASEADDRESS_SYSSETUP" value="0x74a10000" />
|
||||
<property name="BASEADDRESS_WS2_32" value="0x74aa0000" />
|
||||
<property name="BASEADDRESS_POWRPROF" value="0x74ad0000" />
|
||||
<property name="BASEADDRESS_MSXML3" value="0x74ae0000" />
|
||||
<property name="BASEADDRESS_PRINTUI" value="0x74b40000" />
|
||||
<property name="BASEADDRESS_MMDRV" value="0x74c30000" />
|
||||
<property name="BASEADDRESS_PDH" value="0x74c70000" />
|
||||
<property name="BASEADDRESS_OLEDLG" value="0x74d00000" />
|
||||
<property name="BASEADDRESS_SAMSRV" value="0x74f30000" />
|
||||
<property name="BASEADDRESS_RESUTILS" value="0x75070000" />
|
||||
<property name="BASEADDRESS_SAMLIB" value="0x750c0000" />
|
||||
<property name="BASEADDRESS_CABINET" value="0x75120000" />
|
||||
<property name="BASEADDRESS_NETCFGX" value="0x755f0000" />
|
||||
<property name="BASEADDRESS_IPHLPAPI" value="0x75700000" />
|
||||
<property name="BASEADDRESS_NDDEAPI" value="0x75940000" />
|
||||
<property name="BASEADDRESS_MSGINA" value="0x75970000" />
|
||||
<property name="BASEADDRESS_LOCALSPL" value="0x75b80000" />
|
||||
<property name="BASEADDRESS_CRYPTNET" value="0x75e60000" />
|
||||
<property name="BASEADDRESS_RPCRT4" value="0x76000000" />
|
||||
<property name="BASEADDRESS_SHLWAPI" value="0x76100000" />
|
||||
<property name="BASEADDRESS_INETCOMM" value="0x76140000" />
|
||||
<property name="BASEADDRESS_COMCTL32" value="0x76170000" />
|
||||
<property name="BASEADDRESS_COMDLG32" value="0x76230000" />
|
||||
<property name="BASEADDRESS_WINSTA" value="0x762f0000" />
|
||||
<property name="BASEADDRESS_IMM32" value="0x76320000" />
|
||||
<property name="BASEADDRESS_D3D8THK" value="0x76340000" />
|
||||
<property name="BASEADDRESS_RICHED32" value="0x76340000" />
|
||||
<property name="BASEADDRESS_RICHED20" value="0x76360000" />
|
||||
<property name="BASEADDRESS_ODBCCP32" value="0x76380000" />
|
||||
<property name="BASEADDRESS_TWAIN_32" value="0x76380000" />
|
||||
<property name="BASEADDRESS_NETSHELL" value="0x76390000" />
|
||||
<property name="BASEADDRESS_LSASRV" value="0x76540000" />
|
||||
<property name="BASEADDRESS_MIDIMAP" value="0x76600000" />
|
||||
<property name="BASEADDRESS_WAVEMAP" value="0x76610000" />
|
||||
<property name="BASEADDRESS_MPR" value="0x76620000" />
|
||||
<property name="BASEADDRESS_MSHTML" value="0x76650000" />
|
||||
<property name="BASEADDRESS_ODBC32" value="0x76710000" />
|
||||
<property name="BASEADDRESS_SETUPAPI" value="0x76730000" />
|
||||
<property name="BASEADDRESS_CRYPTDLL" value="0x768f0000" />
|
||||
<property name="BASEADDRESS_SHFOLDER" value="0x76900000" />
|
||||
<property name="BASEADDRESS_NTDSAPI" value="0x76910000" />
|
||||
<property name="BASEADDRESS_NTMARTA" value="0x76920000" />
|
||||
<property name="BASEADDRESS_RASDLG" value="0x76930000" />
|
||||
<property name="BASEADDRESS_GDIPLUS" value="0x76a70000" />
|
||||
<property name="BASEADDRESS_ATL" value="0x76ac0000" />
|
||||
<property name="BASEADDRESS_SFC" value="0x76b50000" />
|
||||
<property name="BASEADDRESS_CREDUI" value="0x76bf0000" />
|
||||
<property name="BASEADDRESS_SFC_OS" value="0x76c10000" />
|
||||
<property name="BASEADDRESS_WINTRUST" value="0x76c30000" />
|
||||
<property name="BASEADDRESS_IMAGEHLP" value="0x76c90000" />
|
||||
<property name="BASEADDRESS_CLUSAPI" value="0x76d10000" />
|
||||
<property name="BASEADDRESS_WMI" value="0x76d20000" />
|
||||
<property name="BASEADDRESS_DHCPCSVC" value="0x76d80000" />
|
||||
<property name="BASEADDRESS_FMIFS" value="0x76df0000" />
|
||||
<property name="BASEADDRESS_OLEAUT32" value="0x76e00000" />
|
||||
<property name="BASEADDRESS_TAPI32" value="0x76e60000" />
|
||||
<property name="BASEADDRESS_RASMAN" value="0x76e90000" />
|
||||
<property name="BASEADDRESS_RASAPI32" value="0x76ee0000" />
|
||||
<property name="BASEADDRESS_WTSAPI32" value="0x76f50000" />
|
||||
<property name="BASEADDRESS_MSVFW32" value="0x76f60000" />
|
||||
<property name="BASEADDRESS_MSACM32" value="0x77400000" />
|
||||
<property name="BASEADDRESS_CRTDLL" value="0x77630000" />
|
||||
<property name="BASEADDRESS_AUTHZ" value="0x77690000" />
|
||||
<property name="BASEADDRESS_CFGMGR32" value="0x77700000" />
|
||||
<property name="BASEADDRESS_SENSAPI" value="0x77700000" />
|
||||
<property name="BASEADDRESS_MSAFD" value="0x77780000" />
|
||||
<property name="BASEADDRESS_PACKET" value="0x77780000" />
|
||||
<property name="BASEADDRESS_MSI" value="0x77790000" />
|
||||
<property name="BASEADDRESS_SNMPAPI" value="0x777a0000" />
|
||||
<property name="BASEADDRESS_USP10" value="0x777b0000" />
|
||||
<property name="BASEADDRESS_IPRTPRIO" value="0x777c0000" />
|
||||
<property name="BASEADDRESS_WS2HELP" value="0x777e0000" />
|
||||
<property name="BASEADDRESS_WSHIRDA" value="0x777f0000" />
|
||||
<property name="BASEADDRESS_VERSION" value="0x77a40000" />
|
||||
<property name="BASEADDRESS_OLE32" value="0x77a50000" />
|
||||
<property name="BASEADDRESS_OLEPRO32" value="0x77b20000" />
|
||||
<property name="BASEADDRESS_ACTIVEDS" value="0x77cb0000" />
|
||||
<property name="BASEADDRESS_ADVAPI32" value="0x77dc0000" />
|
||||
<property name="BASEADDRESS_USER32" value="0x77e50000" />
|
||||
<property name="BASEADDRESS_GDI32" value="0x77f70000" />
|
||||
<property name="BASEADDRESS_DNSAPI" value="0x77fb0000" />
|
||||
<property name="BASEADDRESS_MSVCRT" value="0x78000000" />
|
||||
<property name="BASEADDRESS_MSVCRT20" value="0x78500000" />
|
||||
<property name="BASEADDRESS_MSVCRT40" value="0x78700000" />
|
||||
<property name="BASEADDRESS_MSCOREE" value="0x79000000" />
|
||||
<property name="BASEADDRESS_FUSION" value="0x79040000" />
|
||||
<property name="BASEADDRESS_KERNEL32" value="0x7c700000" />
|
||||
<property name="BASEADDRESS_NTDLL" value="0x7c900000" />
|
||||
<property name="BASEADDRESS_QUERY" value="0x7d9a0000" />
|
||||
<property name="BASEADDRESS_HHCTRL" value="0x7e410000" />
|
||||
<property name="BASEADDRESS_SXS" value="0x7e690000" />
|
||||
<property name="BASEADDRESS_BEEPMIDI" value="0x7ef00000" />
|
||||
<property name="BASEADDRESS_FREETYPE" value="0x7f000000" />
|
||||
</group>
|
||||
46
cis/ReactOS.ApiStatus/Default.build
Normal file
46
cis/ReactOS.ApiStatus/Default.build
Normal file
@@ -0,0 +1,46 @@
|
||||
<?xml version="1.0"?>
|
||||
<!--
|
||||
Copyright (C) 2005 Casper S. Hornstrup
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program; if not, write to the Free Software
|
||||
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
||||
-->
|
||||
<project name="ReactOS.ApiStatus" default="publish">
|
||||
|
||||
<property name="reactos.dir" value="reactos" />
|
||||
<property name="apistatus.xsl" value="rapistatus.xsl" />
|
||||
<property name="apistatus.xml" value="rapistatus.xml" />
|
||||
<property name="apistatus.html" value="index2.html" />
|
||||
<include buildfile="config.include" />
|
||||
|
||||
<target name="publish">
|
||||
<delete dir="${reactos.dir}" if="${directory::exists(reactos.dir)}" />
|
||||
<exec program="svn" commandline="export -r HEAD ${source.url} ${reactos.dir}" />
|
||||
<exec program="rgenstat" commandline="reactos\apistatus.lst ${apistatus.xml}" />
|
||||
<style style="${apistatus.xsl}" destdir="${reactos.dir}" in="${apistatus.xml}" out="${apistatus.html}" />
|
||||
<copy todir="${publish.dir}" overwrite="true">
|
||||
<fileset basedir=".">
|
||||
<include name="${apistatus.xml}" />
|
||||
<include name="${apistatus.html}" />
|
||||
</fileset>
|
||||
</copy>
|
||||
<delete>
|
||||
<fileset basedir=".">
|
||||
<include name="${apistatus.xml}" />
|
||||
<include name="${apistatus.html}" />
|
||||
</fileset>
|
||||
</delete>
|
||||
<delete dir="${reactos.dir}" if="${directory::exists(reactos.dir)}" />
|
||||
</target>
|
||||
</project>
|
||||
22
cis/ReactOS.ApiStatus/config.template.include
Normal file
22
cis/ReactOS.ApiStatus/config.template.include
Normal file
@@ -0,0 +1,22 @@
|
||||
<?xml version="1.0" encoding="utf-8"?>
|
||||
<!--
|
||||
Copyright (C) 2005 Casper S. Hornstrup
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the Free Software Foundation; either version 2 of the License, or
|
||||
(at your option) any later version.
|
||||
|
||||
This program is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||
GNU General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with this program; if not, write to the Free Software
|
||||
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
||||
-->
|
||||
<project>
|
||||
<property name="source.url" value="svn://svn.reactos.com/trunk/reactos" />
|
||||
<property name="publish.dir" value="C:\api" />
|
||||
</project>
|
||||
@@ -47,8 +47,8 @@
|
||||
<TD> Implemented </TD>
|
||||
<TD> <IMG src="sc.gif"/> </TD>
|
||||
<TD> Complete </TD>
|
||||
</TR>
|
||||
<TR>
|
||||
</TR>
|
||||
<TD> <IMG src="f.gif"/> </TD>
|
||||
<TD> Function </TD>
|
||||
<TD> <IMG src="u.gif"/> </TD>
|
||||
8
cis/ReactOS.RevisionISO/config.template.php
Normal file
8
cis/ReactOS.RevisionISO/config.template.php
Normal file
@@ -0,0 +1,8 @@
|
||||
<?php
|
||||
|
||||
/* Rename to config.php */
|
||||
|
||||
define(ISO_BASE_URL, "http://www.server.com/iso/");
|
||||
define(ISO_PATH, "C:\\iso\\");
|
||||
|
||||
?>
|
||||
230
cis/ReactOS.RevisionISO/index.php
Normal file
230
cis/ReactOS.RevisionISO/index.php
Normal file
@@ -0,0 +1,230 @@
|
||||
<?php
|
||||
|
||||
include ('config.php');
|
||||
|
||||
function dm_usort_cmp ($a, $b) {
|
||||
if ($a == $b) return 0;
|
||||
return ($a > $b) ? -1 : 1;
|
||||
}
|
||||
|
||||
function dm_usort_cmp_desc ($a, $b) {
|
||||
if ($a == $b) return 0;
|
||||
return ($a > $b) ? 1 : -1;
|
||||
}
|
||||
|
||||
function printHeader()
|
||||
{
|
||||
?>
|
||||
<!doctype html public "-//W3C//DTD HTML 4.0 Transitional//EN">
|
||||
<html>
|
||||
<head>
|
||||
<title>ReactOS Revison ISOs</title>
|
||||
<meta name="generator" content="Editpad">
|
||||
<meta name="keywords" content="OS, ReactOS, operating system">
|
||||
<meta name="author" content="ReactOS Project (ros-dev@reactos.com)">
|
||||
<style>
|
||||
.box
|
||||
{
|
||||
padding: 0px;
|
||||
background-color: #88aadd;
|
||||
border-left: 1px solid #f0f0f0;
|
||||
border-right: 1px solid #000000;
|
||||
border-top: 1px solid #f0f0f0;
|
||||
border-bottom: 1px solid #000000;
|
||||
}
|
||||
</style>
|
||||
</head>
|
||||
<body bgcolor="#88aadd">
|
||||
<form method="post" action="">
|
||||
<?php
|
||||
}
|
||||
|
||||
function printMenu($revision)
|
||||
{
|
||||
?>
|
||||
<table border="0" class="box" cellpadding="5">
|
||||
<tr>
|
||||
<td height="2px">
|
||||
</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>
|
||||
|
||||
<table border="0" cellpadding="0" cellspacing="0">
|
||||
<tr>
|
||||
<td>
|
||||
<b>Branch:</b>
|
||||
</td>
|
||||
<td>
|
||||
<select name="branch" tabindex="1">
|
||||
<?php
|
||||
|
||||
$d = dir(ISO_PATH);
|
||||
$i = 0;
|
||||
$dirlist = array();
|
||||
while (false !== ($entry = $d->read())) {
|
||||
if ((strcasecmp($entry, ".") != 0) && (strcasecmp($entry, "..") != 0) && is_dir(ISO_PATH . "\\" . $entry) == "dir") {
|
||||
$dirlist[$i++] = $entry;
|
||||
}
|
||||
}
|
||||
$d->close();
|
||||
|
||||
if (is_array($dirlist)) {
|
||||
usort($dirlist, "dm_usort_cmp");
|
||||
reset($dirlist);
|
||||
while (list($key, $val) = each($dirlist)) {
|
||||
$branch = $val;
|
||||
if ($branch == $_POST["branch"] || (!isset($_POST["branch"]) && $branch == "trunk"))
|
||||
$selected = " selected";
|
||||
else
|
||||
$selected = "";
|
||||
echo "<option$selected>$branch</option>";
|
||||
}
|
||||
}
|
||||
|
||||
?>
|
||||
</select>
|
||||
</td>
|
||||
<td>
|
||||
|
||||
</td>
|
||||
<td>
|
||||
<b>Revision:</b>
|
||||
</td>
|
||||
<td>
|
||||
<?php
|
||||
echo "<input type=\"text\" name=\"revision\" size=\"10\" maxlength=\"10\" tabindex=\"2\" value=\"" . $revision . "\"></input>";
|
||||
?>
|
||||
</td>
|
||||
<td>
|
||||
|
||||
</td>
|
||||
<td>
|
||||
<input type="submit" name="getiso" value="Download" tabindex="3" style="border: 1px solid #000000"></input>
|
||||
</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td colspan="7">
|
||||
<hr size="2" width="100%" />
|
||||
</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td colspan="4">
|
||||
<input type="submit" name="getnextiso" value="Next ISO" tabindex="4" style="border: 1px solid #000000"></input>
|
||||
</td>
|
||||
<td colspan="3" align="right">
|
||||
<input type="submit" name="getlatestiso" value="Latest ISO" tabindex="5" style="border: 1px solid #000000"></input>
|
||||
</td>
|
||||
</tr>
|
||||
</table>
|
||||
|
||||
</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td height="2px">
|
||||
</td>
|
||||
</tr>
|
||||
</table>
|
||||
<?php
|
||||
}
|
||||
|
||||
function printFooter()
|
||||
{
|
||||
?>
|
||||
</form>
|
||||
|
||||
<script>
|
||||
var revision = document.getElementById('revision');
|
||||
if (revision) revision.focus();
|
||||
</script>
|
||||
</body>
|
||||
</html>
|
||||
<?php
|
||||
}
|
||||
|
||||
function locateRevisionISO($branch, $revision, $latest)
|
||||
{
|
||||
$revision = intval($revision);
|
||||
$path = ISO_PATH . "\\" . $branch;
|
||||
$d = dir($path);
|
||||
$i = 0;
|
||||
$filelist = array();
|
||||
while (false !== ($entry = $d->read())) {
|
||||
if (is_dir($path . "\\" . $entry) != "dir")
|
||||
$filelist[$i++] = $entry;
|
||||
}
|
||||
$d->close();
|
||||
|
||||
if (is_array($filelist)) {
|
||||
$sortFunction = $latest ? "dm_usort_cmp" : "dm_usort_cmp_desc";
|
||||
usort($filelist, $sortFunction);
|
||||
reset($filelist);
|
||||
while (list($key, $filename) = each($filelist)) {
|
||||
if (ereg('ReactOS-' . $branch . '-r([0-9]*).iso', $filename, $regs))
|
||||
{
|
||||
$thisRevision = intval($regs[1]);
|
||||
if (($latest) && ($thisRevision < $revision))
|
||||
return $regs[1];
|
||||
else if ($thisRevision > $revision)
|
||||
return $regs[1];
|
||||
$lastRevision = $thisRevision;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return "";
|
||||
}
|
||||
|
||||
function getNextRevisionISO($branch, $revision)
|
||||
{
|
||||
return locateRevisionISO($branch, $revision, false);
|
||||
}
|
||||
|
||||
function getLatestRevisionISO($branch)
|
||||
{
|
||||
return locateRevisionISO($branch, 999999, true);
|
||||
}
|
||||
|
||||
function main()
|
||||
{
|
||||
$branch = $_POST["branch"];
|
||||
$revision = $_POST["revision"];
|
||||
|
||||
$filename = "ReactOS-" . $branch . "-r" . $revision . ".iso";
|
||||
if (file_exists(ISO_PATH . $branch . "\\" . $filename))
|
||||
{
|
||||
$location = ISO_BASE_URL . $branch . "/" . $filename;
|
||||
header("Location: $location");
|
||||
return;
|
||||
}
|
||||
else
|
||||
{
|
||||
printHeader();
|
||||
printMenu($_POST["revision"]);
|
||||
echo "<br><b>No ISO exist for branch '" . $branch . "' and revision " . $revision . ".</b><br><br>";
|
||||
printFooter();
|
||||
}
|
||||
}
|
||||
|
||||
if (!empty($_POST["getiso"]) && !empty($_POST["branch"]) && !empty($_POST["revision"]) && is_numeric($_POST["revision"]))
|
||||
main();
|
||||
else if (!empty($_POST["getnextiso"]) && !empty($_POST["branch"]) && !empty($_POST["revision"]) && is_numeric($_POST["revision"]))
|
||||
{
|
||||
printHeader();
|
||||
printMenu(getNextRevisionISO($_POST["branch"], $_POST["revision"]));
|
||||
printFooter();
|
||||
}
|
||||
else if (!empty($_POST["getlatestiso"]) && !empty($_POST["branch"]))
|
||||
{
|
||||
printHeader();
|
||||
printMenu(getLatestRevisionISO($_POST["branch"]));
|
||||
printFooter();
|
||||
}
|
||||
else
|
||||
{
|
||||
printHeader();
|
||||
printMenu($_POST["revision"]);
|
||||
printFooter();
|
||||
}
|
||||
|
||||
?>
|
||||
@@ -1,92 +0,0 @@
|
||||
<?xml version="1.0"?>
|
||||
<!DOCTYPE group SYSTEM "tools/rbuild/project.dtd">
|
||||
<group>
|
||||
|
||||
<!--
|
||||
This file is a template used as a starting point for compile-time
|
||||
configuration of ReactOS. Make a copy of this file and name it config.rbuild.
|
||||
Then change the options in config.rbuild. If you don't have a config.rbuild file,
|
||||
then the defaults in this file, config.template.rbuild, will be used instead.
|
||||
|
||||
Boolean options can obtain the values 0 (disabled) or 1 (enabled). String
|
||||
options can obtain any value specified in the comment before it.
|
||||
-->
|
||||
|
||||
|
||||
<!--
|
||||
Sub-architecture to build for. Specify one of:
|
||||
-->
|
||||
<property name="SARCH" value="" />
|
||||
|
||||
|
||||
<!--
|
||||
Which CPU ReactOS should be optimized for. Specify one of:
|
||||
k8 opteron athlon64 athlon-fx
|
||||
|
||||
See GCC manual for more CPU names and which CPUs GCC can optimize for.
|
||||
-->
|
||||
<property name="OARCH" value="athlon64" />
|
||||
|
||||
|
||||
<!--
|
||||
What level of optimisation to use.
|
||||
0 = off (will not work)
|
||||
1 = Default option, optimize for size (-Os) with some additional options
|
||||
2 = -Os
|
||||
3 = -O1
|
||||
4 = -O2
|
||||
5 = -O3
|
||||
-->
|
||||
<property name="OPTIMIZE" value="1" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile in the integrated kernel debugger.
|
||||
-->
|
||||
<property name="KDBG" value="0" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile for debugging.
|
||||
-->
|
||||
<property name="DBG" value="1" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile for debugging with GDB. If you don't use GDB, don't
|
||||
enable this.
|
||||
-->
|
||||
<property name="GDB" value="0" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile apps/libs with features covered software patents or not.
|
||||
If you live in a country where software patents are valid/apply, don't
|
||||
enable this (except they/you purchased a license from the patent owner).
|
||||
This settings is disabled (0) by default.
|
||||
-->
|
||||
<property name="NSWPAT" value="1" />
|
||||
|
||||
<!--
|
||||
Whether to compile with the KD protocol. This will disable support for KDBG
|
||||
as well as rossym and symbol lookups, and allow WinDBG to connect to ReactOS.
|
||||
This is currently not fully working, and requires kdcom from Windows 2003 or
|
||||
TinyKRNL. Booting into debug mode with this flag enabled will result in a
|
||||
failure to enter GUI mode. Do not enable unless you know what you're doing.
|
||||
-->
|
||||
<property name="_WINKD_" value="1" />
|
||||
|
||||
<!--
|
||||
Whether to compile support for ELF files. Do not enable unless you know what
|
||||
you're doing.
|
||||
-->
|
||||
<property name="_ELF_" value="0" />
|
||||
|
||||
<!--
|
||||
Whether to compile any usermode parts. This is while kernel mode is under
|
||||
heavy development and usermode part not relevant for bootcd.
|
||||
-->
|
||||
<property name="USERMODE" value="1" />
|
||||
|
||||
|
||||
</group>
|
||||
@@ -1,93 +0,0 @@
|
||||
<?xml version="1.0"?>
|
||||
<!DOCTYPE group SYSTEM "tools/rbuild/project.dtd">
|
||||
<group>
|
||||
|
||||
<!--
|
||||
This file is a template used as a starting point for compile-time
|
||||
configuration of ReactOS. Make a copy of this file and name it config.rbuild.
|
||||
Then change the options in config.rbuild. If you don't have a config.rbuild file,
|
||||
then the defaults in this file, config.template.rbuild, will be used instead.
|
||||
|
||||
Boolean options can obtain the values 0 (disabled) or 1 (enabled). String
|
||||
options can obtain any value specified in the comment before it.
|
||||
-->
|
||||
|
||||
|
||||
<!--
|
||||
Sub-architecture (board) to build for. Specify one of:
|
||||
kurobox versatile omap3
|
||||
|
||||
-->
|
||||
<property name="SARCH" value="versatile" />
|
||||
|
||||
|
||||
<!--
|
||||
Generate instructions for this CPU type. Specify one of:
|
||||
armv5te armv7-a
|
||||
|
||||
See GCC manual for more CPU names.
|
||||
-->
|
||||
<property name="OARCH" value="armv7-a" />
|
||||
|
||||
|
||||
<!--
|
||||
Which CPU ReactOS should be optimized for. See GCC manual for CPU names.
|
||||
-->
|
||||
<property name="TUNE" value="" />
|
||||
|
||||
|
||||
<!--
|
||||
What level of optimisation to use.
|
||||
0 = off (will not work)
|
||||
1 = Default option, optimize for size (-Os) with some additional options
|
||||
2 = -Os
|
||||
3 = -O1
|
||||
4 = -O2
|
||||
5 = -O3
|
||||
-->
|
||||
<property name="OPTIMIZE" value="1" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile in the integrated kernel debugger.
|
||||
-->
|
||||
<property name="KDBG" value="0" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile for debugging.
|
||||
-->
|
||||
<property name="DBG" value="1" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile for debugging with GDB. If you don't use GDB, don't
|
||||
enable this.
|
||||
-->
|
||||
<property name="GDB" value="0" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile apps/libs with features covered software patents or not.
|
||||
If you live in a country where software patents are valid/apply, don't
|
||||
enable this (except they/you purchased a license from the patent owner).
|
||||
This settings is disabled (0) by default.
|
||||
-->
|
||||
<property name="NSWPAT" value="0" />
|
||||
|
||||
<!--
|
||||
Whether to compile with the KD protocol. This will disable support for KDBG
|
||||
as well as rossym and symbol lookups, and allow WinDBG to connect to ReactOS.
|
||||
This is currently not fully working, and requires kdcom from Windows 2003 or
|
||||
TinyKRNL. Booting into debug mode with this flag enabled will result in a
|
||||
failure to enter GUI mode. Do not enable unless you know what you're doing.
|
||||
-->
|
||||
<property name="_WINKD_" value="0" />
|
||||
|
||||
<!--
|
||||
Whether to compile support for ELF files. Do not enable unless you know what
|
||||
you're doing.
|
||||
-->
|
||||
<property name="_ELF_" value="0" />
|
||||
|
||||
</group>
|
||||
@@ -1,73 +0,0 @@
|
||||
<?xml version="1.0"?>
|
||||
<!DOCTYPE group SYSTEM "tools/rbuild/project.dtd">
|
||||
<group>
|
||||
|
||||
<!--
|
||||
This file is a template used as a starting point for compile-time
|
||||
configuration of ReactOS. Make a copy of this file and name it config.rbuild.
|
||||
Then change the options in config.rbuild. If you don't have a config.rbuild file,
|
||||
then the defaults in this file, config.template.rbuild, will be used instead.
|
||||
|
||||
Boolean options can obtain the values 0 (disabled) or 1 (enabled). String
|
||||
options can obtain any value specified in the comment before it.
|
||||
-->
|
||||
|
||||
|
||||
<!--
|
||||
Sub-architecture to build for. Specify one of:
|
||||
??
|
||||
-->
|
||||
<property name="SARCH" value="" />
|
||||
|
||||
|
||||
<!--
|
||||
Generate instructions for this CPU type. Specify one of:
|
||||
??
|
||||
|
||||
See GCC manual for more CPU names.
|
||||
-->
|
||||
<property name="OARCH" value="" />
|
||||
|
||||
<!--
|
||||
Which CPU ReactOS should be optimized for. See GCC manual for CPU names.
|
||||
-->
|
||||
<property name="TUNE" value="" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile for an uniprocessor or multiprocessor machine.
|
||||
-->
|
||||
<property name="MP" value="0" />
|
||||
|
||||
<!--
|
||||
New style kernel debugger
|
||||
-->
|
||||
<property name="_WINKD_" value="0" />
|
||||
|
||||
<!--
|
||||
Whether to compile in the integrated kernel debugger.
|
||||
-->
|
||||
<property name="KDBG" value="0" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile for debugging.
|
||||
-->
|
||||
<property name="DBG" value="1" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile apps/libs with features covered software patents or not.
|
||||
If you live in a country where software patents are valid/apply, don't
|
||||
enable this (except they/you purchased a license from the patent owner).
|
||||
This settings is disabled (0) by default.
|
||||
-->
|
||||
<property name="NSWPAT" value="0" />
|
||||
|
||||
<!--
|
||||
Whether to compile support for ELF files. Do not enable unless you know what
|
||||
you're doing.
|
||||
-->
|
||||
<property name="_ELF_" value="0" />
|
||||
|
||||
</group>
|
||||
@@ -1,102 +0,0 @@
|
||||
<?xml version="1.0"?>
|
||||
<!DOCTYPE group SYSTEM "tools/rbuild/project.dtd">
|
||||
<group>
|
||||
|
||||
<!--
|
||||
This file is a template used as a starting point for compile-time
|
||||
configuration of ReactOS. Make a copy of this file and name it config.rbuild.
|
||||
Then change the options in config.rbuild. If you don't have a config.rbuild file,
|
||||
then the defaults in this file, config.template.rbuild, will be used instead.
|
||||
|
||||
Boolean options can obtain the values 0 (disabled) or 1 (enabled). String
|
||||
options can obtain any value specified in the comment before it.
|
||||
-->
|
||||
|
||||
|
||||
<!--
|
||||
Sub-architecture to build for. Specify one of:
|
||||
xbox
|
||||
-->
|
||||
<property name="SARCH" value="" />
|
||||
|
||||
|
||||
<!--
|
||||
Generate instructions for this CPU type. Specify one of:
|
||||
native, i386, i486, pentium, pentium-mmx, pentiumpro, i686,
|
||||
pentium2, pentium3, pentium-m, pentium4, prescott, nocona,
|
||||
core2, k6, k6-2, athlon, athlon-xp, opteron, opteron-sse3,
|
||||
barcelona, winchip-c6, winchip2, c3, c3-2, geode
|
||||
|
||||
See GCC manual for more CPU names.
|
||||
-->
|
||||
<property name="OARCH" value="pentium" />
|
||||
|
||||
|
||||
<!--
|
||||
Which CPU ReactOS should be optimized for. Specify one of the above
|
||||
CPUs or generic. When this option is not used, GCC will optimize for
|
||||
the processor specified by OARCH.
|
||||
-->
|
||||
<property name="TUNE" value="i686" />
|
||||
|
||||
|
||||
<!--
|
||||
What level of optimisation to use.
|
||||
0 = off
|
||||
1 = Default option, optimize for size (-Os) with some additional options
|
||||
2 = -Os
|
||||
3 = -O1
|
||||
4 = -O2
|
||||
5 = -O3
|
||||
-->
|
||||
<property name="OPTIMIZE" value="1" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile in the integrated kernel debugger.
|
||||
-->
|
||||
<property name="KDBG" value="1" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile for debugging.
|
||||
-->
|
||||
<property name="DBG" value="1" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile for debugging with GDB. If you don't use GDB, don't
|
||||
enable this.
|
||||
-->
|
||||
<property name="GDB" value="0" />
|
||||
|
||||
|
||||
<!--
|
||||
Whether to compile apps/libs with features covered software patents or not.
|
||||
If you live in a country where software patents are valid/apply, don't
|
||||
enable this (except they/you purchased a license from the patent owner).
|
||||
This settings is disabled (0) by default.
|
||||
-->
|
||||
<property name="NSWPAT" value="0" />
|
||||
|
||||
<!--
|
||||
Whether to compile with the KD protocol. This will disable support for KDBG
|
||||
as well as rossym and symbol lookups, and allow WinDBG to connect to ReactOS.
|
||||
This is currently not fully working, and requires kdcom from Windows 2003 or
|
||||
TinyKRNL. Booting into debug mode with this flag enabled will result in a
|
||||
failure to enter GUI mode. Do not enable unless you know what you're doing.
|
||||
-->
|
||||
<property name="_WINKD_" value="0" />
|
||||
|
||||
<!--
|
||||
Whether to compile support for ELF files. Do not enable unless you know what
|
||||
you're doing.
|
||||
-->
|
||||
<property name="_ELF_" value="0" />
|
||||
|
||||
<!--
|
||||
Whether to compile the multi processor versions for ntoskrnl and hal.
|
||||
-->
|
||||
<property name="BUILD_MP" value="1" />
|
||||
|
||||
</group>
|
||||
30
depmap.xsl
30
depmap.xsl
@@ -1,30 +0,0 @@
|
||||
<?xml version="1.0" encoding="ISO-8859-1"?>
|
||||
<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
|
||||
<xsl:template match="/">
|
||||
<html>
|
||||
<head>
|
||||
<title>ReactOS Dependency Map</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1>ReactOS Dependency Map</h1>
|
||||
<table border="1">
|
||||
<tr bgcolor="#9acd32">
|
||||
<th align="left">Module Name</th>
|
||||
<th align="left">Module Location</th>
|
||||
<th align="left">Other Module Usage</th>
|
||||
<th align="left">Module Re-Usage</th>
|
||||
</tr>
|
||||
<xsl:for-each select="components/component">
|
||||
<tr>
|
||||
<td><xsl:value-of select="name"/></td>
|
||||
<td><xsl:value-of select="base"/></td>
|
||||
<td><xsl:value-of select="lib_count"/></td>
|
||||
<td><xsl:value-of select="ref_count"/></td>
|
||||
</tr>
|
||||
</xsl:for-each>
|
||||
</table>
|
||||
</body>
|
||||
</html>
|
||||
</xsl:template>
|
||||
|
||||
</xsl:stylesheet>
|
||||
608
irc/ArchBlackmann/ArchBlackmann.cpp
Normal file
608
irc/ArchBlackmann/ArchBlackmann.cpp
Normal file
@@ -0,0 +1,608 @@
|
||||
// irc_test.cpp
|
||||
|
||||
#ifdef _MSC_VER
|
||||
#pragma warning ( disable : 4786 )
|
||||
#endif//_MSC_VER
|
||||
|
||||
#include <time.h>
|
||||
#include <stdio.h>
|
||||
|
||||
#include "File.h"
|
||||
#include "ssprintf.h"
|
||||
#include "trim.h"
|
||||
|
||||
#include "IRCClient.h"
|
||||
#include "config.h"
|
||||
|
||||
using std::string;
|
||||
using std::vector;
|
||||
|
||||
//vector<string> tech, module, dev, stru, period, status, type, func, irql, curse, cursecop;
|
||||
|
||||
class List
|
||||
{
|
||||
public:
|
||||
string name;
|
||||
bool macro;
|
||||
std::vector<std::string> list;
|
||||
string tag;
|
||||
int last;
|
||||
List() { last = -1; }
|
||||
List ( const char* _name, bool _macro ) : name(_name), macro(_macro)
|
||||
{
|
||||
tag = ssprintf("%%%s%%",_name);
|
||||
last = -1;
|
||||
}
|
||||
};
|
||||
|
||||
vector<List> lists;
|
||||
vector<string> ops;
|
||||
|
||||
void ImportList ( const char* listname, bool macro )
|
||||
{
|
||||
lists.push_back ( List ( listname, macro ) );
|
||||
List& list = lists.back();
|
||||
File f ( ssprintf("%s.txt",listname).c_str(), "r" );
|
||||
string line;
|
||||
while ( f.next_line ( line, true ) )
|
||||
list.list.push_back ( line );
|
||||
}
|
||||
|
||||
const char* ListRand ( List& list )
|
||||
{
|
||||
vector<string>& l = list.list;
|
||||
if ( !l.size() )
|
||||
{
|
||||
static string nothing;
|
||||
nothing = ssprintf ( "<list '%s' empty>", list.name.c_str() );
|
||||
return nothing.c_str();
|
||||
}
|
||||
else if ( l.size() == 1 )
|
||||
return l[0].c_str();
|
||||
int sel = list.last;
|
||||
while ( sel == list.last )
|
||||
sel = rand()%l.size();
|
||||
list.last = sel;
|
||||
return l[sel].c_str();
|
||||
}
|
||||
|
||||
const char* ListRand ( int i )
|
||||
{
|
||||
return ListRand ( lists[i] );
|
||||
}
|
||||
|
||||
int GetListIndex ( const char* listname )
|
||||
{
|
||||
for ( int i = 0; i < lists.size(); i++ )
|
||||
{
|
||||
if ( !stricmp ( lists[i].name.c_str(), listname ) )
|
||||
return i;
|
||||
}
|
||||
return -1;
|
||||
}
|
||||
|
||||
List& GetList ( const char* listname )
|
||||
{
|
||||
return lists[GetListIndex(listname)];
|
||||
}
|
||||
|
||||
const char* ListRand ( const char* list )
|
||||
{
|
||||
int i = GetListIndex ( list );
|
||||
if ( i < 0 )
|
||||
return NULL;
|
||||
return ListRand(i);
|
||||
}
|
||||
|
||||
string TaggedReply ( const char* listname )
|
||||
{
|
||||
string t = ListRand(listname);
|
||||
string out;
|
||||
const char* p = t.c_str();
|
||||
while ( *p )
|
||||
{
|
||||
if ( *p == '%' )
|
||||
{
|
||||
bool found = false;
|
||||
for ( int i = 0; i < lists.size() && !found; i++ )
|
||||
{
|
||||
if ( lists[i].macro && !strnicmp ( p, lists[i].tag.c_str(), lists[i].tag.size() ) )
|
||||
{
|
||||
out += ListRand(i);
|
||||
p += lists[i].tag.size();
|
||||
found = true;
|
||||
}
|
||||
}
|
||||
if ( !found )
|
||||
out += *p++;
|
||||
}
|
||||
const char* p2 = strchr ( p, '%' );
|
||||
if ( !p2 )
|
||||
p2 = p + strlen(p);
|
||||
if ( p2 > p )
|
||||
{
|
||||
out += string ( p, p2-p );
|
||||
p = p2;
|
||||
}
|
||||
}
|
||||
return out;
|
||||
}
|
||||
|
||||
string gobble ( string& s, const char* delim )
|
||||
{
|
||||
const char* p = s.c_str();
|
||||
p += strspn ( p, delim );
|
||||
const char* p2 = strpbrk ( p, delim );
|
||||
if ( !p2 ) p2 = p + strlen(p);
|
||||
string out ( p, p2-p );
|
||||
p2 += strspn ( p2, delim );
|
||||
s = string ( p2 );
|
||||
return out;
|
||||
}
|
||||
|
||||
bool isop ( const string& who )
|
||||
{
|
||||
for ( int i = 0; i < ops.size(); i++ )
|
||||
{
|
||||
if ( ops[i] == who )
|
||||
return true;
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
|
||||
// do custom stuff with the IRCClient from your subclass via the provided callbacks...
|
||||
class MyIRCClient : public IRCClient
|
||||
{
|
||||
File flog;
|
||||
clock_t brake_silence;
|
||||
|
||||
// wait another 30 mins to brake the silence
|
||||
#define NOIDLE brake_silence = clock () + 30 * CLK_TCK * 60
|
||||
|
||||
void CheckIdle ( void )
|
||||
{
|
||||
while (true) // _inRun
|
||||
{
|
||||
while (clock() < brake_silence)
|
||||
Sleep(10000);
|
||||
|
||||
string out = TaggedReply("idle");
|
||||
|
||||
if ( !strnicmp ( out.c_str(), "/me ", 4 ) )
|
||||
Action ( CHANNEL, &out[4] );
|
||||
else
|
||||
PrivMsg ( CHANNEL, out );
|
||||
|
||||
NOIDLE;
|
||||
}
|
||||
}
|
||||
|
||||
static void THREADAPI CallMe ( MyIRCClient* irc )
|
||||
{
|
||||
irc->CheckIdle();
|
||||
}
|
||||
|
||||
public:
|
||||
|
||||
MyIRCClient()
|
||||
{
|
||||
NOIDLE;
|
||||
ThreadPool::Instance().Launch ( (ThreadPoolFunc*)MyIRCClient::CallMe, this );
|
||||
flog.open ( "arch.log", "r+" );
|
||||
}
|
||||
// see IRCClient.h for documentation on these callbacks...
|
||||
bool OnConnected()
|
||||
{
|
||||
return true;
|
||||
}
|
||||
bool OnJoin ( const string& user, const string& channel )
|
||||
{
|
||||
//printf ( "user '%s' joined channel '%s'\n", user.c_str(), channel.c_str() );
|
||||
return true;
|
||||
}
|
||||
bool OnPart ( const std::string& user, const std::string& channel )
|
||||
{
|
||||
std::vector<std::string>::iterator it = ops.begin();
|
||||
for ( ; it != ops.end(); it++ )
|
||||
{
|
||||
if ( *it == user )
|
||||
{
|
||||
printf ( "remove '%s' to ops list\n", user.c_str() );
|
||||
ops.erase ( it );
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
bool OnNick ( const std::string& oldNick, const std::string& newNick )
|
||||
{
|
||||
for ( int i = 0; i < ops.size(); i++ )
|
||||
{
|
||||
if ( ops[i] == oldNick )
|
||||
{
|
||||
printf ( "op '%s' changed nick to '%s'\n", oldNick.c_str(), newNick.c_str() );
|
||||
ops[i] = newNick;
|
||||
return true;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
bool OnEndChannelUsers ( const string& channel )
|
||||
{
|
||||
return true;
|
||||
}
|
||||
bool OnPrivMsg ( const string& from, const string& text )
|
||||
{
|
||||
//flog.flush();
|
||||
printf ( "<%s> %s\n", from.c_str(), text.c_str() );
|
||||
flog.printf ( "<%s> %s\n", from.c_str(), text.c_str() );
|
||||
|
||||
if ( !isop(from) )
|
||||
return PrivMsg ( from, "hey, your tongue doesn't belong there!" );
|
||||
|
||||
else if ( strnicmp ( text.c_str(), "!say ", 5 ) )
|
||||
return PrivMsg ( from, "Talk to me on normal Chanel" );
|
||||
|
||||
string say = trim(&text[5]);
|
||||
|
||||
if ( !strnicmp ( say.c_str(), "/me ", 4 ) )
|
||||
return Action ( CHANNEL, trim(&say[4]) );
|
||||
else
|
||||
return PrivMsg ( CHANNEL, trim(say) );
|
||||
}
|
||||
bool OnChannelMsg ( const string& channel, const string& from, const string& text )
|
||||
{
|
||||
fflush ( flog );
|
||||
printf ( "%s <%s> %s\n", channel.c_str(), from.c_str(), text.c_str() );
|
||||
flog.printf ( "%s <%s> %s\n", channel.c_str(), from.c_str(), text.c_str() );
|
||||
NOIDLE; // add 30 mins till idle
|
||||
|
||||
bool found_name = false;
|
||||
string text2 ( text );
|
||||
strlwr ( &text2[0] );
|
||||
|
||||
if ( !strnicmp ( text.c_str(), BOTNAME, strlen(BOTNAME) ) )
|
||||
found_name = true;
|
||||
|
||||
string s ( text );
|
||||
|
||||
if ( found_name )
|
||||
gobble ( s, " \t" ); // remove bot name
|
||||
|
||||
// command
|
||||
if ( s[0] == '!' )
|
||||
{
|
||||
bool from_op = isop(from);
|
||||
string cmd = gobble ( s, " \t" );
|
||||
|
||||
// from all
|
||||
if ( false && cmd == "!svn" && from == "TechBot" ) // || cmd == "!help" && !TechBotOnline
|
||||
{
|
||||
PrivMsg ( channel, "For my help try !what." );
|
||||
}
|
||||
|
||||
// from normel user
|
||||
else if ( !from_op )
|
||||
{
|
||||
if ( cmd == "!grovel" )
|
||||
{
|
||||
string out = ssprintf(TaggedReply("nogrovel").c_str(),from.c_str());
|
||||
if ( !strnicmp ( out.c_str(), "/me ", 4 ) )
|
||||
return Action ( channel, &out[4] );
|
||||
else
|
||||
return PrivMsg ( channel, out );
|
||||
}
|
||||
|
||||
else if ( cmd == "!what" )
|
||||
{
|
||||
return PrivMsg ( channel, ssprintf("For you, %s, I only support the \"!grovel\" command.", from.c_str()).c_str() );
|
||||
}
|
||||
|
||||
else if ( cmd == "!grovel" || cmd == "!kiss" || cmd == "!hug"
|
||||
|| cmd == "!give" || cmd == "!what" || cmd == "!add" || cmd == "!remove" )
|
||||
{
|
||||
PrivMsg ( channel, ssprintf("%s: I only take commands from ops",from.c_str()) );
|
||||
}
|
||||
}
|
||||
|
||||
// from op
|
||||
else if ( cmd == "!grovel" )
|
||||
{
|
||||
string out = ssprintf(TaggedReply("grovel").c_str(),from.c_str());
|
||||
if ( !strnicmp ( out.c_str(), "/me ", 4 ) )
|
||||
return Action ( channel, &out[4] );
|
||||
else
|
||||
return PrivMsg ( channel, out );
|
||||
}
|
||||
else if ( cmd == "!kiss" )
|
||||
{
|
||||
if ( s.size() )
|
||||
return Action ( channel, ssprintf("kisses %s",s.c_str()) );
|
||||
else
|
||||
return PrivMsg ( channel, ssprintf("%s: huh?",from.c_str()) );
|
||||
}
|
||||
else if ( cmd == "!hug" )
|
||||
{
|
||||
if ( s.size() )
|
||||
return Action ( channel, ssprintf("hugs %s",s.c_str()) );
|
||||
else
|
||||
return PrivMsg ( channel, ssprintf("%s: huh?",from.c_str()) );
|
||||
}
|
||||
else if ( cmd == "!give" )
|
||||
{
|
||||
string who = gobble(s," \t");
|
||||
if ( who.size() && s.size() )
|
||||
return Action ( channel, ssprintf("gives %s a %s",who.c_str(),s.c_str()) );
|
||||
else
|
||||
return PrivMsg ( channel, ssprintf("%s: huh?",from.c_str()) );
|
||||
}
|
||||
else if ( cmd == "!what" )
|
||||
{
|
||||
PrivMsg ( channel, "For ops I support the following commands:" );
|
||||
PrivMsg ( channel, "!grovel" );
|
||||
PrivMsg ( channel, "!kiss" );
|
||||
PrivMsg ( channel, "!hug" );
|
||||
PrivMsg ( channel, "!give" );
|
||||
PrivMsg ( channel, "!say (the input is a private message)" );
|
||||
PrivMsg ( channel, "!add" );
|
||||
PrivMsg ( channel, "!remove" );
|
||||
PrivMsg ( channel, " - for more info see wiki" );
|
||||
}
|
||||
else if ( cmd == "!add" )
|
||||
{
|
||||
string listname = gobble ( s, " \t" );
|
||||
int i = GetListIndex ( listname.c_str() );
|
||||
if ( i == -1 )
|
||||
return PrivMsg ( channel, ssprintf("%s: I don't have a list named '%s'",from.c_str(),listname.c_str()) );
|
||||
List& list = lists[i];
|
||||
if ( s[0] == '\"' || s[0] == '\'' )
|
||||
{
|
||||
char delim = s[0];
|
||||
const char* p = &s[1];
|
||||
const char* p2 = strchr ( p, delim );
|
||||
if ( !p2 )
|
||||
return PrivMsg ( channel, ssprintf("%s: Couldn't add, unmatched quotes",from.c_str()) );
|
||||
s = string ( p, p2-p );
|
||||
}
|
||||
for ( i = 0; i < list.list.size(); i++ )
|
||||
{
|
||||
if ( list.list[i] == s )
|
||||
return PrivMsg ( channel, ssprintf("%s: entry already exists in list '%s'",from.c_str(),listname.c_str()) );
|
||||
}
|
||||
if ( !stricmp ( listname.c_str(), "curse" ) )
|
||||
strlwr ( &s[0] );
|
||||
list.list.push_back ( s );
|
||||
{
|
||||
File f ( ssprintf("%s.txt",list.name.c_str()), "w" );
|
||||
for ( i = 0; i < list.list.size(); i++ )
|
||||
f.printf ( "%s\n", list.list[i].c_str() );
|
||||
}
|
||||
return PrivMsg ( channel, ssprintf("%s: entry added to list '%s'",from.c_str(),listname.c_str()) );
|
||||
}
|
||||
else if ( cmd == "!remove" )
|
||||
{
|
||||
string listname = gobble ( s, " \t" );
|
||||
int i = GetListIndex ( listname.c_str() );
|
||||
if ( i == -1 )
|
||||
return PrivMsg ( channel, ssprintf("%s: I don't have a list named '%s'",from.c_str(),listname.c_str()) );
|
||||
List& list = lists[i];
|
||||
if ( s[0] == '\"' || s[0] == '\'' )
|
||||
{
|
||||
char delim = s[0];
|
||||
const char* p = &s[1];
|
||||
const char* p2 = strchr ( p, delim );
|
||||
if ( !p2 )
|
||||
return PrivMsg ( channel, ssprintf("%s: Couldn't add, unmatched quotes",from.c_str()) );
|
||||
s = string ( p, p2-p );
|
||||
}
|
||||
std::vector<std::string>::iterator it = list.list.begin();
|
||||
for ( ; it != list.list.end(); it++ )
|
||||
{
|
||||
if ( *it == s )
|
||||
{
|
||||
list.list.erase ( it );
|
||||
{
|
||||
File f ( ssprintf("%s.txt",list.name.c_str()), "w" );
|
||||
it = list.list.begin();
|
||||
for ( ; it < list.list.end(); it++ )
|
||||
f.printf ( "%s\n", it->c_str() );
|
||||
}
|
||||
return PrivMsg ( channel, ssprintf("%s: entry removed from list '%s'",from.c_str(),listname.c_str()) );
|
||||
}
|
||||
}
|
||||
return PrivMsg ( channel, ssprintf("%s: entry doesn't exist in list '%s'",from.c_str(),listname.c_str()) );
|
||||
}
|
||||
else
|
||||
{
|
||||
if (found_name)
|
||||
return PrivMsg ( channel, ssprintf("%s: huh?",from.c_str()) );
|
||||
}
|
||||
|
||||
} // if (command)
|
||||
|
||||
bool found_curse = false;
|
||||
static vector<string>& curse = GetList("curse").list;
|
||||
text2 = " " + text2 + " ";
|
||||
|
||||
for ( int i = 0; i < curse.size() && !found_curse; i++ )
|
||||
{
|
||||
if ( strstr ( text2.c_str(), curse[i].c_str() ) )
|
||||
found_curse = true;
|
||||
}
|
||||
if ( found_curse )
|
||||
{
|
||||
static List& cursecop = GetList("cursecop");
|
||||
return PrivMsg ( channel, ssprintf("%s: %s", from.c_str(), ListRand(cursecop)) );
|
||||
}
|
||||
|
||||
string botname (BOTNAME);
|
||||
strlwr ( &botname[0] );
|
||||
//botname = " " + botname + " ";
|
||||
|
||||
if ( strstr(text2.c_str(), botname.c_str()) || strstr(text2.c_str(), " arch ") || found_name )
|
||||
{
|
||||
string out = ssprintf("%s: %s", from.c_str(), TaggedReply("tech").c_str());
|
||||
flog.printf ( "TECH-REPLY: %s\n", out.c_str() );
|
||||
if ( !strnicmp ( out.c_str(), "/me ", 4 ) )
|
||||
return Action ( channel, &out[4] );
|
||||
else
|
||||
return PrivMsg ( channel, out );
|
||||
}
|
||||
return true;
|
||||
|
||||
} // On Chanel Message
|
||||
|
||||
bool OnChannelMode ( const string& channel, const string& mode )
|
||||
{
|
||||
//printf ( "OnChannelMode(%s,%s)\n", channel.c_str(), mode.c_str() );
|
||||
return true;
|
||||
}
|
||||
bool OnUserModeInChannel ( const string& src, const string& channel, const string& mode, const string& target )
|
||||
{
|
||||
printf ( "OnUserModeInChannel(%s,%s,%s,%s)\n", src.c_str(), channel.c_str(), mode.c_str(), target.c_str() );
|
||||
const char* p = mode.c_str();
|
||||
if ( !p )
|
||||
return true;
|
||||
while ( *p )
|
||||
{
|
||||
switch ( *p++ )
|
||||
{
|
||||
case '+':
|
||||
while ( *p != 0 && *p != ' ' )
|
||||
{
|
||||
if ( *p == 'o' )
|
||||
{
|
||||
printf ( "adding '%s' to ops list\n", target.c_str() );
|
||||
ops.push_back ( target );
|
||||
}
|
||||
break;
|
||||
}
|
||||
break;
|
||||
case '-':
|
||||
while ( *p != 0 && *p != ' ' )
|
||||
{
|
||||
if ( *p == 'o' )
|
||||
{
|
||||
std::vector<std::string>::iterator it = ops.begin();
|
||||
for ( ; it != ops.end(); it++ )
|
||||
{
|
||||
if ( *it == target )
|
||||
{
|
||||
printf ( "remove '%s' to ops list\n", target.c_str() );
|
||||
ops.erase ( it );
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
bool OnMode ( const string& user, const string& mode )
|
||||
{
|
||||
//printf ( "OnMode(%s,%s)\n", user.c_str(), mode.c_str() );
|
||||
return true;
|
||||
}
|
||||
bool OnChannelUsers ( const string& channel, const vector<string>& users )
|
||||
{
|
||||
//printf ( "[%s has %i users]: ", channel.c_str(), users.size() );
|
||||
for ( int i = 0; i < users.size(); i++ )
|
||||
{
|
||||
if ( users[i][0] == '@' )
|
||||
ops.push_back ( &users[i][1] );
|
||||
/*if ( i )
|
||||
printf ( ", " );
|
||||
printf ( "%s", users[i].c_str() );*/
|
||||
}
|
||||
//printf ( "\n" );
|
||||
return true;
|
||||
}
|
||||
bool OnKick ( void )
|
||||
{
|
||||
Join(CHANNEL);
|
||||
return true;
|
||||
}
|
||||
bool OnBanned ( const std::string& channel )
|
||||
{
|
||||
Sleep(10000);
|
||||
return Join(CHANNEL);
|
||||
}
|
||||
};
|
||||
|
||||
int main ( int argc, char** argv )
|
||||
{
|
||||
srand ( time(NULL) );
|
||||
|
||||
ImportList ( "dev", true );
|
||||
ImportList ( "func", true );
|
||||
ImportList ( "dev", true );
|
||||
ImportList ( "func", true );
|
||||
ImportList ( "irql", true );
|
||||
ImportList ( "module", true );
|
||||
ImportList ( "period", true );
|
||||
ImportList ( "status", true );
|
||||
ImportList ( "stru", true );
|
||||
ImportList ( "type", true );
|
||||
|
||||
ImportList ( "tech", false );
|
||||
ImportList ( "curse", false );
|
||||
ImportList ( "cursecop", false );
|
||||
ImportList ( "grovel", false );
|
||||
ImportList ( "nogrovel", false );
|
||||
ImportList ( "idle", false );
|
||||
|
||||
#ifdef _DEBUG
|
||||
printf ( "initializing IRCClient debugging\n" );
|
||||
IRCClient::SetDebug ( true );
|
||||
#endif//_DEBUG
|
||||
|
||||
while (true)
|
||||
{
|
||||
printf ( "calling suStartup()\n" );
|
||||
suStartup();
|
||||
printf ( "creating IRCClient object\n" );
|
||||
MyIRCClient irc;
|
||||
printf ( "connecting to freenode\n" );
|
||||
|
||||
if ( !irc.Connect ( SERVER ) ) // irc.freenode.net
|
||||
{
|
||||
printf ( "couldn't connect to server\n" );
|
||||
Sleep(10000);
|
||||
continue;
|
||||
}
|
||||
printf ( "sending user command\n" );
|
||||
if ( !irc.User ( BOTNAME, "reactos.com", SERVER, "ArchBlackmann" ) )
|
||||
{
|
||||
printf ( "USER command failed, retying ...\n" );
|
||||
Sleep(10000);
|
||||
continue;
|
||||
}
|
||||
printf ( "sending nick\n" );
|
||||
if ( !irc.Nick ( BOTNAME ) )
|
||||
{
|
||||
printf ( "NICK command failed, retying ...\n" );
|
||||
Sleep(10000);
|
||||
continue;
|
||||
}
|
||||
printf ( "setting mode\n" );
|
||||
if ( !irc.Mode ( MODE ) )
|
||||
{
|
||||
printf ( "MODE command failed, retying ...\n" );
|
||||
Sleep(10000);
|
||||
continue;
|
||||
}
|
||||
printf ( "joining channel\n" );
|
||||
if ( !irc.Join ( CHANNEL ) )
|
||||
{
|
||||
printf ( "JOIN command failed, retying ...\n" );
|
||||
Sleep(10000);
|
||||
continue;
|
||||
}
|
||||
|
||||
printf ( "entering irc client processor\n" );
|
||||
irc.Run ( false ); // do the processing in this thread...
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
216
irc/ArchBlackmann/ArchBlackmann.dsp
Normal file
216
irc/ArchBlackmann/ArchBlackmann.dsp
Normal file
@@ -0,0 +1,216 @@
|
||||
# Microsoft Developer Studio Project File - Name="ArchBlackmann" - Package Owner=<4>
|
||||
# Microsoft Developer Studio Generated Build File, Format Version 6.00
|
||||
# ** DO NOT EDIT **
|
||||
|
||||
# TARGTYPE "Win32 (x86) Console Application" 0x0103
|
||||
|
||||
CFG=ArchBlackmann - Win32 Debug
|
||||
!MESSAGE This is not a valid makefile. To build this project using NMAKE,
|
||||
!MESSAGE use the Export Makefile command and run
|
||||
!MESSAGE
|
||||
!MESSAGE NMAKE /f "ArchBlackmann.mak".
|
||||
!MESSAGE
|
||||
!MESSAGE You can specify a configuration when running NMAKE
|
||||
!MESSAGE by defining the macro CFG on the command line. For example:
|
||||
!MESSAGE
|
||||
!MESSAGE NMAKE /f "ArchBlackmann.mak" CFG="ArchBlackmann - Win32 Debug"
|
||||
!MESSAGE
|
||||
!MESSAGE Possible choices for configuration are:
|
||||
!MESSAGE
|
||||
!MESSAGE "ArchBlackmann - Win32 Release" (based on "Win32 (x86) Console Application")
|
||||
!MESSAGE "ArchBlackmann - Win32 Debug" (based on "Win32 (x86) Console Application")
|
||||
!MESSAGE
|
||||
|
||||
# Begin Project
|
||||
# PROP AllowPerConfigDependencies 0
|
||||
# PROP Scc_ProjName ""
|
||||
# PROP Scc_LocalPath ""
|
||||
CPP=cl.exe
|
||||
RSC=rc.exe
|
||||
|
||||
!IF "$(CFG)" == "ArchBlackmann - Win32 Release"
|
||||
|
||||
# PROP BASE Use_MFC 0
|
||||
# PROP BASE Use_Debug_Libraries 0
|
||||
# PROP BASE Output_Dir "Release"
|
||||
# PROP BASE Intermediate_Dir "Release"
|
||||
# PROP BASE Target_Dir ""
|
||||
# PROP Use_MFC 0
|
||||
# PROP Use_Debug_Libraries 0
|
||||
# PROP Output_Dir "Release"
|
||||
# PROP Intermediate_Dir "Release"
|
||||
# PROP Target_Dir ""
|
||||
# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
|
||||
# ADD CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
|
||||
# ADD BASE RSC /l 0x409 /d "NDEBUG"
|
||||
# ADD RSC /l 0x409 /d "NDEBUG"
|
||||
BSC32=bscmake.exe
|
||||
# ADD BASE BSC32 /nologo
|
||||
# ADD BSC32 /nologo
|
||||
LINK32=link.exe
|
||||
# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
|
||||
# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
|
||||
|
||||
!ELSEIF "$(CFG)" == "ArchBlackmann - Win32 Debug"
|
||||
|
||||
# PROP BASE Use_MFC 0
|
||||
# PROP BASE Use_Debug_Libraries 1
|
||||
# PROP BASE Output_Dir "Debug"
|
||||
# PROP BASE Intermediate_Dir "Debug"
|
||||
# PROP BASE Target_Dir ""
|
||||
# PROP Use_MFC 0
|
||||
# PROP Use_Debug_Libraries 1
|
||||
# PROP Output_Dir "Debug"
|
||||
# PROP Intermediate_Dir "Debug"
|
||||
# PROP Target_Dir ""
|
||||
# ADD BASE CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
|
||||
# ADD CPP /nologo /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /GZ /c
|
||||
# ADD BASE RSC /l 0x409 /d "_DEBUG"
|
||||
# ADD RSC /l 0x409 /d "_DEBUG"
|
||||
BSC32=bscmake.exe
|
||||
# ADD BASE BSC32 /nologo
|
||||
# ADD BSC32 /nologo
|
||||
LINK32=link.exe
|
||||
# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
|
||||
# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
|
||||
|
||||
!ENDIF
|
||||
|
||||
# Begin Target
|
||||
|
||||
# Name "ArchBlackmann - Win32 Release"
|
||||
# Name "ArchBlackmann - Win32 Debug"
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\ArchBlackmann.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\auto_ptr.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\auto_vector.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\base64.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\base64.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\chomp.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\chomp.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\config.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\cram_md5.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\cram_md5.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\File.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\File.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\IRCClient.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\IRCClient.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\MD5.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\MD5.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\panic.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\panic.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\QueueT.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\Reli.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\ReliMT.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\ReliMT.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\SockUtils.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\SockUtils.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\SplitJoin.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\SplitJoin.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\ssprintf.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\ssprintf.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\ThreadPool.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\ThreadPool.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\trim.cpp
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\trim.h
|
||||
# End Source File
|
||||
# Begin Source File
|
||||
|
||||
SOURCE=.\verify.h
|
||||
# End Source File
|
||||
# End Target
|
||||
# End Project
|
||||
29
irc/ArchBlackmann/ArchBlackmann.dsw
Normal file
29
irc/ArchBlackmann/ArchBlackmann.dsw
Normal file
@@ -0,0 +1,29 @@
|
||||
Microsoft Developer Studio Workspace File, Format Version 6.00
|
||||
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
|
||||
|
||||
###############################################################################
|
||||
|
||||
Project: "ArchBlackmann"=.\ArchBlackmann.dsp - Package Owner=<4>
|
||||
|
||||
Package=<5>
|
||||
{{{
|
||||
}}}
|
||||
|
||||
Package=<4>
|
||||
{{{
|
||||
}}}
|
||||
|
||||
###############################################################################
|
||||
|
||||
Global:
|
||||
|
||||
Package=<5>
|
||||
{{{
|
||||
}}}
|
||||
|
||||
Package=<3>
|
||||
{{{
|
||||
}}}
|
||||
|
||||
###############################################################################
|
||||
|
||||
265
irc/ArchBlackmann/File.cpp
Normal file
265
irc/ArchBlackmann/File.cpp
Normal file
@@ -0,0 +1,265 @@
|
||||
// File.cpp
|
||||
// (C) 2002-2004 Royce Mitchell III
|
||||
// Dually licensed under BSD & LGPL
|
||||
|
||||
#ifdef _MSC_VER
|
||||
#pragma warning ( disable : 4786 )
|
||||
#endif//_MSC_VER
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include "File.h"
|
||||
|
||||
#ifndef nelem
|
||||
#define nelem(x) ( sizeof(x) / sizeof(x[0]) )
|
||||
#endif//nelem
|
||||
|
||||
typedef File::filesize_t filesize_t;
|
||||
typedef File::fileoff_t fileoff_t;
|
||||
|
||||
|
||||
fileoff_t File::seek ( fileoff_t offset )
|
||||
{
|
||||
#ifdef WIN32
|
||||
if ( _f->_flag & _IOWRT ) // is there pending output?
|
||||
fflush ( _f );
|
||||
|
||||
// reset "buffered input" variables
|
||||
_f->_cnt = 0;
|
||||
_f->_ptr = _f->_base;
|
||||
|
||||
// make sure we're going forward
|
||||
if ( _f->_flag & _IORW )
|
||||
_f->_flag &= ~(_IOREAD|_IOWRT);
|
||||
|
||||
return _lseeki64 ( _fileno(_f), offset, SEEK_SET );
|
||||
#else//UNIX
|
||||
return lseek64 ( fileno(_f), offset, SEEK_SET );
|
||||
#endif
|
||||
}
|
||||
|
||||
std::string File::getline ( bool strip_crlf /*= false*/ )
|
||||
{
|
||||
std::string s = "";
|
||||
char buf[256];
|
||||
for ( ;; )
|
||||
{
|
||||
*buf = 0;
|
||||
fgets ( buf, nelem(buf)-1, _f );
|
||||
if ( !*buf )
|
||||
break;
|
||||
s += buf;
|
||||
if ( strchr ( "\r\n", buf[strlen(buf)-1] ) )
|
||||
break;
|
||||
}
|
||||
if ( strip_crlf && s.size() )
|
||||
{
|
||||
char* p = strpbrk ( &s[0], "\r\n" );
|
||||
if ( p )
|
||||
{
|
||||
*p = '\0';
|
||||
s.resize ( p-&s[0] );
|
||||
}
|
||||
}
|
||||
return s;
|
||||
}
|
||||
|
||||
std::wstring File::wgetline ( bool strip_crlf /*= false*/ )
|
||||
{
|
||||
std::wstring s = L"";
|
||||
wchar_t buf[256];
|
||||
for ( ;; )
|
||||
{
|
||||
*buf = 0;
|
||||
fgetws ( buf, nelem(buf)-1, _f );
|
||||
if ( !*buf )
|
||||
break;
|
||||
s += buf;
|
||||
if ( wcschr ( L"\r\n", buf[wcslen(buf)-1] ) )
|
||||
break;
|
||||
}
|
||||
if ( strip_crlf && s.size() )
|
||||
{
|
||||
wchar_t* p = wcspbrk ( &s[0], L"\r\n" );
|
||||
if ( p )
|
||||
{
|
||||
*p = L'\0';
|
||||
s.resize ( (p-&s[0])/sizeof(wchar_t) );
|
||||
}
|
||||
}
|
||||
return s;
|
||||
}
|
||||
|
||||
// this function searches for the next end-of-line and puts all data it
|
||||
// finds until then in the 'line' parameter.
|
||||
//
|
||||
// call continuously until the function returns false ( no more data )
|
||||
bool File::next_line ( std::string& line, bool strip_crlf )
|
||||
{
|
||||
line = getline(strip_crlf);
|
||||
// indicate that we're done *if*:
|
||||
// 1) there's no more data, *and*
|
||||
// 2) we're at the end of the file
|
||||
return line.size()>0 || !eof();
|
||||
}
|
||||
|
||||
bool File::next_line ( std::wstring& line, bool strip_crlf )
|
||||
{
|
||||
line = wgetline ( strip_crlf );
|
||||
return line.size()>0 || !eof();
|
||||
}
|
||||
|
||||
/*
|
||||
example usage:
|
||||
|
||||
bool mycallback ( const std::string& line, int line_number, long lparam )
|
||||
{
|
||||
std::cout << line << std::endl;
|
||||
return true; // continue enumeration
|
||||
}
|
||||
|
||||
File f ( "file.txt", "rb" ); // open file for binary read-only ( i.e. "rb" )
|
||||
f.enum_lines ( mycallback, 0, true );
|
||||
*/
|
||||
|
||||
/*bool File::enum_lines ( bool (*callback)(const std::string& line, int line_number, long lparam), long lparam, bool strip_crlf )
|
||||
{
|
||||
int line_number = 0;
|
||||
for ( ;; )
|
||||
{
|
||||
std::string s = getline(strip_crlf);
|
||||
line_number++;
|
||||
if ( !s.size() )
|
||||
{
|
||||
if ( eof() )
|
||||
return true;
|
||||
else
|
||||
continue;
|
||||
}
|
||||
if ( !(*callback) ( s, line_number, lparam ) )
|
||||
return false;
|
||||
}
|
||||
}*/
|
||||
|
||||
filesize_t File::length() const
|
||||
{
|
||||
#ifdef WIN32
|
||||
return _filelengthi64 ( _fileno(_f) );
|
||||
#elif defined(UNIX)
|
||||
struct stat64 file_stat;
|
||||
verify(fstat64(fileno(_f), &file_stat) == 0);
|
||||
return file_stat.st_size;
|
||||
#endif
|
||||
}
|
||||
|
||||
void File::close()
|
||||
{
|
||||
if ( _f )
|
||||
{
|
||||
fclose(_f);
|
||||
_f = 0;
|
||||
}
|
||||
}
|
||||
|
||||
void File::printf ( const char* fmt, ... )
|
||||
{
|
||||
va_list arg;
|
||||
int done;
|
||||
|
||||
va_start(arg, fmt);
|
||||
assert(_f);
|
||||
done = vfprintf ( _f, fmt, arg );
|
||||
va_end(arg);
|
||||
}
|
||||
|
||||
/*static*/ bool File::LoadIntoString ( std::string& s, const std::string& filename )
|
||||
{
|
||||
File in ( filename, "rb" );
|
||||
if ( !in.isopened() )
|
||||
return false;
|
||||
filesize_t flen = in.length();
|
||||
size_t len = size_t(flen);
|
||||
if ( len != flen )
|
||||
return false; // file too big...
|
||||
s.resize ( len + 1 );
|
||||
if ( !in.read ( &s[0], len ) )
|
||||
return false;
|
||||
s[len] = '\0';
|
||||
s.resize ( len );
|
||||
return true;
|
||||
}
|
||||
|
||||
/*static*/ bool File::LoadIntoString ( std::string& s, const std::wstring& filename )
|
||||
{
|
||||
File in ( filename, L"rb" );
|
||||
if ( !in.isopened() )
|
||||
return false;
|
||||
filesize_t flen = in.length();
|
||||
size_t len = size_t(flen);
|
||||
if ( len != flen )
|
||||
return false; // file too big...
|
||||
s.resize ( len + 1 );
|
||||
if ( !in.read ( &s[0], len ) )
|
||||
return false;
|
||||
s[len] = '\0';
|
||||
s.resize ( len );
|
||||
return true;
|
||||
}
|
||||
|
||||
/*static*/ bool File::SaveFromString ( const std::string& filename, const std::string& s, bool binary )
|
||||
{
|
||||
File out ( filename, binary ? "wb" : "w" );
|
||||
if ( !out.isopened() )
|
||||
return false;
|
||||
out.write ( s.c_str(), s.size() );
|
||||
return true;
|
||||
}
|
||||
|
||||
/*static*/ bool File::SaveFromString ( const std::wstring& filename, const std::string& s, bool binary )
|
||||
{
|
||||
File out ( filename, binary ? L"wb" : L"w" );
|
||||
if ( !out.isopened() )
|
||||
return false;
|
||||
out.write ( s.c_str(), s.size() );
|
||||
return true;
|
||||
}
|
||||
|
||||
/*static*/ bool File::SaveFromBuffer ( const std::string& filename, const char* buf, size_t buflen, bool binary )
|
||||
{
|
||||
File out ( filename, binary ? "wb" : "w" );
|
||||
if ( !out.isopened() )
|
||||
return false;
|
||||
out.write ( buf, buflen );
|
||||
return true;
|
||||
}
|
||||
|
||||
/*static*/ bool File::SaveFromBuffer ( const std::wstring& filename, const char* buf, size_t buflen, bool binary )
|
||||
{
|
||||
File out ( filename, binary ? L"wb" : L"w" );
|
||||
if ( !out.isopened() )
|
||||
return false;
|
||||
out.write ( buf, buflen );
|
||||
return true;
|
||||
}
|
||||
|
||||
/*static*/ std::string File::TempFileName ( const std::string& prefix )
|
||||
{
|
||||
#ifdef WIN32
|
||||
std::string s ( _tempnam ( ".", prefix.c_str() ) );
|
||||
return s;
|
||||
#else
|
||||
// FIXME
|
||||
return string("");
|
||||
#endif
|
||||
}
|
||||
|
||||
/*static*/ std::wstring File::TempFileName ( const std::wstring& prefix )
|
||||
{
|
||||
#ifdef WIN32
|
||||
std::wstring s ( _wtempnam ( L".", prefix.c_str() ) );
|
||||
return s;
|
||||
#else
|
||||
// FIXME
|
||||
return std::wstring(L"");
|
||||
#endif
|
||||
}
|
||||
173
irc/ArchBlackmann/File.h
Normal file
173
irc/ArchBlackmann/File.h
Normal file
@@ -0,0 +1,173 @@
|
||||
// File.h
|
||||
// (C) 2002-2004 Royce Mitchell III
|
||||
// Dually licensed under BSD & LGPL
|
||||
|
||||
#ifndef FILE_H
|
||||
#define FILE_H
|
||||
|
||||
#ifdef WIN32
|
||||
# include <stdio.h> // fgetc
|
||||
# include <io.h>
|
||||
#elif defined(UNIX)
|
||||
# include <sys/stat.h>
|
||||
# include <unistd.h>
|
||||
#endif
|
||||
#include <assert.h>
|
||||
#include <string>
|
||||
|
||||
class File
|
||||
{
|
||||
public:
|
||||
#ifdef WIN32
|
||||
typedef __int64 fileoff_t;
|
||||
typedef unsigned __int64 filesize_t;
|
||||
#else//_MSC_VER
|
||||
typedef __off64_t fileoff_t;
|
||||
typedef __size64_t filesize_t;
|
||||
#endif//_MSC_VER
|
||||
|
||||
File() : _f(0)
|
||||
{
|
||||
}
|
||||
|
||||
File ( const std::string& filename, const char* mode ) : _f(0)
|
||||
{
|
||||
open ( filename, mode );
|
||||
}
|
||||
|
||||
File ( const std::wstring& filename, const wchar_t* mode ) : _f(0)
|
||||
{
|
||||
open ( filename, mode );
|
||||
}
|
||||
|
||||
File ( const char* filename, const char* mode ) : _f(0)
|
||||
{
|
||||
open ( filename, mode );
|
||||
}
|
||||
|
||||
File ( const wchar_t* filename, const wchar_t* mode ) : _f(0)
|
||||
{
|
||||
open ( filename, mode );
|
||||
}
|
||||
|
||||
~File()
|
||||
{
|
||||
close();
|
||||
}
|
||||
|
||||
bool open ( const std::string& filename, const char* mode )
|
||||
{
|
||||
assert ( !_f );
|
||||
return ( _f = fopen ( filename.c_str(), mode ) ) != 0;
|
||||
}
|
||||
|
||||
bool open ( const std::wstring& filename, const wchar_t* mode )
|
||||
{
|
||||
assert ( !_f );
|
||||
return ( _f = _wfopen ( filename.c_str(), mode ) ) != 0;
|
||||
}
|
||||
|
||||
bool open ( const char* filename, const char* mode )
|
||||
{
|
||||
assert ( !_f );
|
||||
return ( _f = fopen ( filename, mode ) ) != 0;
|
||||
}
|
||||
|
||||
bool open ( const wchar_t* filename, const wchar_t* mode )
|
||||
{
|
||||
assert ( !_f );
|
||||
return ( _f = _wfopen ( filename, mode ) ) != 0;
|
||||
}
|
||||
|
||||
fileoff_t seek ( fileoff_t offset );
|
||||
|
||||
int get()
|
||||
{
|
||||
return fgetc ( _f );
|
||||
}
|
||||
|
||||
bool put ( int c )
|
||||
{
|
||||
return fputc ( c, _f ) != EOF;
|
||||
}
|
||||
|
||||
std::string getline ( bool strip_crlf = false );
|
||||
std::wstring wgetline ( bool strip_crlf = false );
|
||||
|
||||
// this function searches for the next end-of-line and puts all data it
|
||||
// finds until then in the 'line' parameter.
|
||||
//
|
||||
// call continuously until the function returns false ( no more data )
|
||||
bool next_line ( std::string& line, bool strip_crlf );
|
||||
bool next_line ( std::wstring& line, bool strip_crlf );
|
||||
|
||||
bool read ( void* data, unsigned len )
|
||||
{
|
||||
return len == fread ( data, 1, len, _f );
|
||||
}
|
||||
|
||||
bool write ( const void* data, unsigned len )
|
||||
{
|
||||
return len == fwrite ( data, 1, len, _f );
|
||||
}
|
||||
|
||||
bool write ( const std::string& data )
|
||||
{
|
||||
return data.length() == fwrite ( data.c_str(), 1, data.length(), _f );
|
||||
}
|
||||
|
||||
bool write ( const std::wstring& data )
|
||||
{
|
||||
return data.length() == fwrite ( data.c_str(), sizeof(data[0]), data.length(), _f );
|
||||
}
|
||||
|
||||
filesize_t length() const;
|
||||
|
||||
void close();
|
||||
|
||||
bool isopened() const
|
||||
{
|
||||
return _f != 0;
|
||||
}
|
||||
|
||||
bool is_open() const
|
||||
{
|
||||
return _f != 0;
|
||||
}
|
||||
|
||||
bool eof() const
|
||||
{
|
||||
return feof(_f) ? true : false;
|
||||
}
|
||||
|
||||
FILE* operator * ()
|
||||
{
|
||||
return _f;
|
||||
}
|
||||
|
||||
operator FILE*()
|
||||
{
|
||||
return _f;
|
||||
}
|
||||
|
||||
void printf ( const char* fmt, ... );
|
||||
void printf ( const wchar_t* fmt, ... );
|
||||
|
||||
static bool LoadIntoString ( std::string& s, const std::string& filename );
|
||||
static bool LoadIntoString ( std::string& s, const std::wstring& filename );
|
||||
static bool SaveFromString ( const std::string& filename, const std::string& s, bool binary );
|
||||
static bool SaveFromString ( const std::wstring& filename, const std::string& s, bool binary );
|
||||
static bool SaveFromBuffer ( const std::string& filename, const char* buf, size_t buflen, bool binary );
|
||||
static bool SaveFromBuffer ( const std::wstring& filename, const char* buf, size_t buflen, bool binary );
|
||||
|
||||
static std::string TempFileName ( const std::string& prefix );
|
||||
static std::wstring TempFileName ( const std::wstring& prefix );
|
||||
|
||||
private:
|
||||
File(const File&) {}
|
||||
const File& operator = ( const File& ) { return *this; }
|
||||
|
||||
FILE * _f;
|
||||
};
|
||||
|
||||
#endif//FILE_H
|
||||
418
irc/ArchBlackmann/IRCClient.cpp
Normal file
418
irc/ArchBlackmann/IRCClient.cpp
Normal file
@@ -0,0 +1,418 @@
|
||||
// IRCClient.cpp
|
||||
// This file is (C) 2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#ifdef _MSC_VER
|
||||
#pragma warning ( disable : 4786 )
|
||||
#endif//_MSC_VER
|
||||
|
||||
#include <vector>
|
||||
#include <sstream>
|
||||
|
||||
#include "IRCClient.h"
|
||||
#include "MD5.h"
|
||||
#include "cram_md5.h"
|
||||
#include "trim.h"
|
||||
#include "chomp.h"
|
||||
#include "SplitJoin.h"
|
||||
#include "base64.h"
|
||||
#include "config.h"
|
||||
|
||||
using std::string;
|
||||
using std::stringstream;
|
||||
using std::vector;
|
||||
|
||||
bool IRCClient::_debug = true;
|
||||
|
||||
// see rfc1459 for IRC-Protocoll Reference
|
||||
|
||||
IRCClient::IRCClient()
|
||||
: _timeout(10*60*1000), _inRun(false)
|
||||
{
|
||||
}
|
||||
|
||||
bool IRCClient::Connect ( const string& server, short port )
|
||||
{
|
||||
string buf;
|
||||
Close();
|
||||
Attach ( suTcpSocket() );
|
||||
if ( !suConnect ( *this, server.c_str(), port ) )
|
||||
return false;
|
||||
return true;
|
||||
}
|
||||
|
||||
bool
|
||||
IRCClient::User ( const string& user, const string& mode,
|
||||
const string& network, const string& realname )
|
||||
{
|
||||
string buf;
|
||||
buf = "USER " + user + " \"" + mode + "\" \"" + network + "\" :" + realname + "\n";
|
||||
return Send ( buf );
|
||||
}
|
||||
|
||||
bool
|
||||
IRCClient::Nick ( const string& nick )
|
||||
{
|
||||
_nick = nick;
|
||||
Send ( "NICK " + _nick + "\n" );
|
||||
PrivMsg ("NickServ", "IDENTIFY " + (string)PASS);
|
||||
return true;
|
||||
}
|
||||
|
||||
bool
|
||||
IRCClient::Mode ( const string& mode )
|
||||
{
|
||||
return Send ( "MODE " + _nick + " " + mode + "\n" );
|
||||
}
|
||||
|
||||
bool
|
||||
IRCClient::Names ( const string& channel )
|
||||
{
|
||||
return Send ( "NAMES " + channel + "\n" );
|
||||
}
|
||||
|
||||
bool
|
||||
IRCClient::Mode ( const string& channel, const string& mode, const string& target )
|
||||
{
|
||||
return Send ( "MODE " + channel + " " + mode + " " + target + "\n" );
|
||||
}
|
||||
|
||||
bool
|
||||
IRCClient::Join ( const string& channel )
|
||||
{
|
||||
return Send("JOIN " + channel + "\n");
|
||||
}
|
||||
|
||||
bool
|
||||
IRCClient::PrivMsg ( const string& to, const string& text )
|
||||
{
|
||||
return Send ( "PRIVMSG " + to + " :" + text + '\n' );
|
||||
}
|
||||
|
||||
bool
|
||||
IRCClient::Action ( const string& to, const string& text )
|
||||
{
|
||||
return Send ( "PRIVMSG " + to + " :" + (char)1 + "ACTION " + text + (char)1 + '\n' );
|
||||
}
|
||||
|
||||
bool
|
||||
IRCClient::Part ( const string& channel, const string& text )
|
||||
{
|
||||
return Send ( "PART " + channel + " :" + text + "\n" );
|
||||
}
|
||||
|
||||
bool
|
||||
IRCClient::Quit ( const string& text )
|
||||
{
|
||||
return Send( "QUIT :" + text + "\n");
|
||||
}
|
||||
|
||||
bool IRCClient::_Recv ( string& buf )
|
||||
{
|
||||
bool b = (recvUntil ( buf, '\n', _timeout ) > 0);
|
||||
if ( b && _debug )
|
||||
{
|
||||
printf ( ">> %s", buf.c_str() );
|
||||
if ( buf[buf.length()-1] != '\n' )
|
||||
printf ( "\n" );
|
||||
}
|
||||
return b;
|
||||
}
|
||||
|
||||
bool IRCClient::Send ( const string& buf )
|
||||
{
|
||||
if ( _debug )
|
||||
{
|
||||
printf ( "<< %s", buf.c_str() );
|
||||
if ( buf[buf.length()-1] != '\n' )
|
||||
printf ( "\n" );
|
||||
}
|
||||
return ( buf.length() == (size_t)send ( *this, buf.c_str(), buf.length(), 0 ) );
|
||||
}
|
||||
|
||||
bool IRCClient::OnPing( const string& text )
|
||||
{
|
||||
return Send( "PONG " + text + "\n" );
|
||||
}
|
||||
|
||||
|
||||
int THREADAPI IRCClient::Callback ( IRCClient* irc )
|
||||
{
|
||||
return irc->Run ( false );
|
||||
}
|
||||
|
||||
int IRCClient::Run ( bool launch_thread )
|
||||
{
|
||||
if ( (SOCKET)*this == INVALID_SOCKET )
|
||||
return 0;
|
||||
if ( _inRun ) return 1;
|
||||
if ( launch_thread )
|
||||
{
|
||||
ThreadPool::Instance().Launch ( (ThreadPoolFunc*)IRCClient::Callback, this );
|
||||
return 1;
|
||||
}
|
||||
_inRun = true;
|
||||
if ( _debug ) printf ( "IRCClient::Run() - waiting for responses\n" );
|
||||
string buf;
|
||||
while ( _Recv(buf) )
|
||||
{
|
||||
if ( !strnicmp ( buf.c_str(), "NOTICE ", 7 ) )
|
||||
{
|
||||
//printf ( "recv'd NOTICE msg...\n" );
|
||||
// TODO...
|
||||
//OnAuth (
|
||||
}
|
||||
else if ( !strnicmp ( buf.c_str(), "PING ", 5 ) )
|
||||
{
|
||||
const char* p = &buf[5]; // point to first char after "PING "
|
||||
while ( *p == ':' ) // then read past the colons
|
||||
p++;
|
||||
const char* p2 = strpbrk ( p, "\r\n" ); // find the end of line
|
||||
string text ( p, p2-p ); // and set the text
|
||||
OnPing( text );
|
||||
}
|
||||
else if ( buf[0] == ':' )
|
||||
{
|
||||
const char* p = &buf[1]; // skip first colon...
|
||||
const char* p2 = strpbrk ( p, " !" );
|
||||
if ( !p2 )
|
||||
{
|
||||
printf ( "!!!:OnRecv failure 0: ", buf.c_str() );
|
||||
continue;
|
||||
}
|
||||
string src ( p, p2-p );
|
||||
if ( !src.length() )
|
||||
{
|
||||
printf ( "!!!:OnRecv failure 0.5: %s", buf.c_str() );
|
||||
continue;
|
||||
}
|
||||
p = p2 + 1;
|
||||
if ( *p2 == '!' )
|
||||
{
|
||||
p2 = strchr ( p, ' ' );
|
||||
if ( !p2 )
|
||||
{
|
||||
printf ( "!!!:OnRecv failure 1: %s", buf.c_str() );
|
||||
continue;
|
||||
}
|
||||
//string srchost ( p, p2-p );
|
||||
p = p2 + 1;
|
||||
}
|
||||
p2 = strchr ( p, ' ' );
|
||||
if ( !p2 )
|
||||
{
|
||||
printf ( "!!!:OnRecv failure 2: %s", buf.c_str() );
|
||||
continue;
|
||||
}
|
||||
string cmd ( p, p2-p );
|
||||
p = p2 + 1;
|
||||
p2 = strpbrk ( p, " :" );
|
||||
if ( !p2 )
|
||||
{
|
||||
printf ( "!!!:OnRecv failure 3: %s", buf.c_str() );
|
||||
continue;
|
||||
}
|
||||
string tgt ( p, p2-p );
|
||||
p = p2 + 1;
|
||||
p += strspn ( p, " " );
|
||||
if ( *p == '=' )
|
||||
{
|
||||
p++;
|
||||
p += strspn ( p, " " );
|
||||
}
|
||||
if ( *p == ':' )
|
||||
p++;
|
||||
p2 = strpbrk ( p, "\r\n" );
|
||||
if ( !p2 )
|
||||
{
|
||||
printf ( "!!!:OnRecv failure 4: %s", buf.c_str() );
|
||||
continue;
|
||||
}
|
||||
string text ( p, p2-p );
|
||||
strlwr ( &cmd[0] );
|
||||
if ( cmd == "privmsg" )
|
||||
{
|
||||
if ( !tgt.length() )
|
||||
{
|
||||
printf ( "!!!:OnRecv failure 5 (PRIVMSG w/o target): %s", buf.c_str() );
|
||||
continue;
|
||||
}
|
||||
if ( *p == 1 )
|
||||
{
|
||||
p++;
|
||||
p2 = strchr ( p, ' ' );
|
||||
if ( !p2 ) p2 = p + strlen(p);
|
||||
cmd = string ( p, p2-p );
|
||||
strlwr ( &cmd[0] );
|
||||
p = p2 + 1;
|
||||
p2 = strchr ( p, 1 );
|
||||
if ( !p2 )
|
||||
{
|
||||
printf ( "!!!:OnRecv failure 6 (no terminating \x01 for initial \x01 found: %s", buf.c_str() );
|
||||
continue;
|
||||
}
|
||||
text = string ( p, p2-p );
|
||||
if ( cmd == "action" )
|
||||
{
|
||||
if ( tgt[0] == '#' )
|
||||
OnChannelAction ( tgt, src, text );
|
||||
else
|
||||
OnPrivAction ( src, text );
|
||||
}
|
||||
else
|
||||
{
|
||||
printf ( "!!!:OnRecv failure 7 (unrecognized \x01 command '%s': %s", cmd.c_str(), buf.c_str() );
|
||||
continue;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if ( tgt[0] == '#' )
|
||||
OnChannelMsg ( tgt, src, text );
|
||||
else
|
||||
OnPrivMsg ( src, text );
|
||||
}
|
||||
}
|
||||
else if ( cmd == "mode" )
|
||||
{
|
||||
// two diff. kinds of mode notifications...
|
||||
//printf ( "[MODE] src='%s' cmd='%s' tgt='%s' text='%s'", src.c_str(), cmd.c_str(), tgt.c_str(), text.c_str() );
|
||||
//OnMode (
|
||||
// self mode change:
|
||||
// [MODE] src=Nick cmd=mode tgt=Nick text=+i
|
||||
// channel mode change:
|
||||
// [MODE] src=Nick cmd=mode tgt=#Channel text=+o Nick
|
||||
if ( tgt[0] == '#' )
|
||||
{
|
||||
p = text.c_str();
|
||||
p2 = strchr ( p, ' ' );
|
||||
if ( p2 && *p2 )
|
||||
{
|
||||
string mode ( p, p2-p );
|
||||
p = p2 + 1;
|
||||
p += strspn ( p, " " );
|
||||
OnUserModeInChannel ( src, tgt, mode, trim(p) );
|
||||
}
|
||||
else
|
||||
OnChannelMode ( tgt, text );
|
||||
}
|
||||
else
|
||||
OnMode ( tgt, text );
|
||||
}
|
||||
else if ( cmd == "join" )
|
||||
{
|
||||
mychannel = text;
|
||||
OnJoin ( src, text );
|
||||
}
|
||||
else if ( cmd == "part" )
|
||||
{
|
||||
OnPart ( src, text );
|
||||
}
|
||||
else if ( cmd == "nick" )
|
||||
{
|
||||
OnNick ( src, text );
|
||||
}
|
||||
else if ( cmd == "kick" )
|
||||
{
|
||||
OnKick ();
|
||||
}
|
||||
else if ( isdigit(cmd[0]) )
|
||||
{
|
||||
int i = atoi(cmd.c_str());
|
||||
switch ( i )
|
||||
{
|
||||
|
||||
case 1: // "Welcome!" - i.e. it's okay to issue commands now...
|
||||
OnConnected();
|
||||
break;
|
||||
|
||||
case 353: // user list for channel....
|
||||
{
|
||||
p = text.c_str();
|
||||
p2 = strpbrk ( p, " :" );
|
||||
if ( !p2 ) continue;
|
||||
string channel ( p, p2-p );
|
||||
p = strchr ( p2, ':' );
|
||||
if ( !p ) continue;
|
||||
p++;
|
||||
vector<string> users;
|
||||
while ( *p )
|
||||
{
|
||||
p2 = strchr ( p, ' ' );
|
||||
if ( !p2 )
|
||||
p2 = p + strlen(p);
|
||||
users.push_back ( string ( p, p2-p ) );
|
||||
p = p2+1;
|
||||
p += strspn ( p, " " );
|
||||
}
|
||||
OnChannelUsers ( channel, users );
|
||||
}
|
||||
break;
|
||||
|
||||
case 366: // END of user list for channel
|
||||
{
|
||||
p = text.c_str();
|
||||
p2 = strpbrk ( p, " :" );
|
||||
if ( !p2 ) continue;
|
||||
string channel ( p, p2-p );
|
||||
OnEndChannelUsers ( channel );
|
||||
}
|
||||
break;
|
||||
|
||||
case 474: // You are banned
|
||||
{
|
||||
p = text.c_str();
|
||||
p2 = strpbrk ( p, " :" );
|
||||
if ( !p2 ) continue;
|
||||
string channel ( p, p2-p );
|
||||
OnBanned ( channel );
|
||||
}
|
||||
break;
|
||||
|
||||
case 433: // Nick in Use
|
||||
{
|
||||
string nick = _nick;
|
||||
Nick (nick + "_");
|
||||
|
||||
PrivMsg ("NickServ", "GHOST " + nick + " " + PASS);
|
||||
|
||||
// HACK HACK HACK
|
||||
Mode ( "+i" );
|
||||
Join ( CHANNEL ); // this is because IRC client does not review if his commands were sucessfull
|
||||
|
||||
Sleep ( 1000 );
|
||||
Nick ( nick );
|
||||
}
|
||||
break;
|
||||
|
||||
case 2: //MOTD
|
||||
case 376: //MOTD
|
||||
case 372:
|
||||
break;
|
||||
|
||||
default:
|
||||
if ( _debug ) printf ( "unknown command %i: %s", i, buf.c_str() );
|
||||
break;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if ( strstr ( buf.c_str(), "ACTION" ) )
|
||||
{
|
||||
printf ( "ACTION: " );
|
||||
for ( int i = 0; i < buf.size(); i++ )
|
||||
printf ( "%c(%xh)", buf[i], (unsigned)(unsigned char)buf[i] );
|
||||
}
|
||||
else if ( _debug ) printf ( "unrecognized ':' response: %s", buf.c_str() );
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if ( _debug ) printf ( "unrecognized irc msg: %s", buf.c_str() );
|
||||
}
|
||||
//OnRecv ( buf );
|
||||
}
|
||||
if ( _debug ) printf ( "IRCClient::Run() - exiting\n" );
|
||||
_inRun = false;
|
||||
return 0;
|
||||
}
|
||||
148
irc/ArchBlackmann/IRCClient.h
Normal file
148
irc/ArchBlackmann/IRCClient.h
Normal file
@@ -0,0 +1,148 @@
|
||||
// IRCClient.h
|
||||
// This file is (C) 2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#ifndef IRCCLIENT_H
|
||||
#define IRCCLIENT_H
|
||||
|
||||
#include <string>
|
||||
#include <vector>
|
||||
#include "SockUtils.h"
|
||||
#include "ThreadPool.h"
|
||||
|
||||
class IRCClient : public suBufferedRecvSocket
|
||||
{
|
||||
|
||||
public:
|
||||
IRCClient();
|
||||
|
||||
std::string mychannel;
|
||||
static bool GetDebug() { return _debug; }
|
||||
static bool SetDebug ( bool debug ) { bool old = _debug; _debug = debug; return old; }
|
||||
|
||||
// connect to server ( record greeting for apop if it exists )
|
||||
bool Connect ( const std::string& server, short port = 6667 );
|
||||
|
||||
bool Running() { return _inRun; }
|
||||
|
||||
////////////////////////// IRC Client Protocol commands ///////////////////////
|
||||
|
||||
// first thing you must call... mode can be ""
|
||||
// network can be same as name of server used in Connect() above
|
||||
bool User ( const std::string& user, const std::string& mode,
|
||||
const std::string& network, const std::string& realname );
|
||||
|
||||
// change nick...
|
||||
bool Nick ( const std::string& nick );
|
||||
|
||||
// change mode for self...
|
||||
bool Mode ( const std::string& mode );
|
||||
|
||||
// set someone's mode in channel ( like oping someone )
|
||||
bool Mode ( const std::string& channel, const std::string& mode, const std::string& target );
|
||||
|
||||
// request a list of names of clients in a channel
|
||||
bool Names ( const std::string& channel );
|
||||
|
||||
// join a channel...
|
||||
bool Join ( const std::string& channel );
|
||||
|
||||
// send message to someone or some channel
|
||||
bool PrivMsg ( const std::string& to, const std::string& text );
|
||||
|
||||
// send /me to someone or some channel
|
||||
bool Action ( const std::string& to, const std::string& text );
|
||||
|
||||
// leave a channel
|
||||
bool Part ( const std::string& channel, const std::string& text );
|
||||
|
||||
// log off
|
||||
bool Quit ( const std::string& text );
|
||||
|
||||
////////////////////// callback functions ////////////////////////////
|
||||
|
||||
// OnConnected: you just successfully logged into irc server
|
||||
virtual bool OnConnected() = 0;
|
||||
|
||||
virtual bool OnNick ( const std::string& oldNick, const std::string& newNick ) { return true; }
|
||||
|
||||
// OnJoin: someone just successfully joined a channel you are in ( also sent when you successfully join a channel )
|
||||
virtual bool OnJoin ( const std::string& user, const std::string& channel ) { return true; }
|
||||
|
||||
// OnPart: someone just left a channel you are in
|
||||
virtual bool OnPart ( const std::string& user, const std::string& channel ) { return true; }
|
||||
|
||||
// OnPrivMsg: you just received a private message from a user
|
||||
virtual bool OnPrivMsg ( const std::string& from, const std::string& text ) { return true; }
|
||||
|
||||
virtual bool OnPrivAction ( const std::string& from, const std::string& text ) { return true; }
|
||||
|
||||
// OnChannelMsg: you just received a chat line in a channel
|
||||
virtual bool OnChannelMsg ( const std::string& channel, const std::string& from,
|
||||
const std::string& text ) { return true; }
|
||||
|
||||
// OnChannelAction: you just received a "/me" line in a channel
|
||||
virtual bool OnChannelAction ( const std::string& channel, const std::string& from,
|
||||
const std::string& text ) { return true; }
|
||||
|
||||
// OnChannelMode: notification of a change of a channel's mode
|
||||
virtual bool OnChannelMode ( const std::string& channel, const std::string& mode )
|
||||
{ return true; }
|
||||
|
||||
// OnUserModeInChannel: notification of a mode change of a user with respect to a channel.
|
||||
// f.ex.: this will be called when someone is oped in a channel.
|
||||
virtual bool OnUserModeInChannel ( const std::string& src, const std::string& channel,
|
||||
const std::string& mode, const std::string& target ) { return true; }
|
||||
|
||||
// OnMode: you will receive this when you change your own mode, at least...
|
||||
virtual bool OnMode ( const std::string& user, const std::string& mode ) { return true; }
|
||||
|
||||
// notification of what users are in a channel ( you may get multiple of these... )
|
||||
virtual bool OnChannelUsers ( const std::string& channel, const std::vector<std::string>& users )
|
||||
{ return true; }
|
||||
|
||||
// OnKick: if the client has been kicked
|
||||
virtual bool OnKick ( void ) { return true; }
|
||||
|
||||
// OnKick: if the client has been kicked
|
||||
virtual bool OnBanned ( const std::string& channel ) { return true; }
|
||||
|
||||
// notification that you have received the entire list of users for a channel
|
||||
virtual bool OnEndChannelUsers ( const std::string& channel ) { return true; }
|
||||
|
||||
// OnPing - default implementation replies to PING with a valid PONG. required on some systems to
|
||||
// log in. Most systems require a response in order to stay connected, used to verify a client hasn't
|
||||
// dropped.
|
||||
virtual bool OnPing ( const std::string& text );
|
||||
|
||||
////////////////////// other functions ////////////////////////////
|
||||
|
||||
// this is for sending data to irc server. it's public in case you need to send some
|
||||
// command not supported by this base class...
|
||||
bool Send ( const std::string& buf );
|
||||
|
||||
// if launch_thread is true, this function will spawn a thread that will process
|
||||
// incoming packets until the socket dies.
|
||||
// otherwise ( launch_thread is false ) this function will do that processing
|
||||
// in *this* thread, and not return until the socket dies.
|
||||
int Run ( bool launch_thread );
|
||||
|
||||
////////////////////// private stuff ////////////////////////////
|
||||
private:
|
||||
bool _Recv ( std::string& buf );
|
||||
|
||||
static int THREADAPI Callback ( IRCClient* irc );
|
||||
|
||||
static bool _debug;
|
||||
std::string _nick;
|
||||
int _timeout;
|
||||
std::string _apop_challenge;
|
||||
|
||||
volatile bool _inRun;
|
||||
|
||||
// disable copy semantics
|
||||
IRCClient ( const IRCClient& );
|
||||
IRCClient& operator = ( const IRCClient& );
|
||||
};
|
||||
|
||||
#endif//IRCCLIENT_H
|
||||
418
irc/ArchBlackmann/MD5.cpp
Normal file
418
irc/ArchBlackmann/MD5.cpp
Normal file
@@ -0,0 +1,418 @@
|
||||
// MD5.CPP - RSA Data Security, Inc., MD5 message-digest algorithm
|
||||
|
||||
/*
|
||||
Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
|
||||
rights reserved.
|
||||
|
||||
License to copy and use this software is granted provided that it
|
||||
is identified as the "RSA Data Security, Inc. MD5 Message-Digest
|
||||
Algorithm" in all material mentioning or referencing this software
|
||||
or this function.
|
||||
|
||||
License is also granted to make and use derivative works provided
|
||||
that such works are identified as "derived from the RSA Data
|
||||
Security, Inc. MD5 Message-Digest Algorithm" in all material
|
||||
mentioning or referencing the derived work.
|
||||
|
||||
RSA Data Security, Inc. makes no representations concerning either
|
||||
the merchantability of this software or the suitability of this
|
||||
software for any particular purpose. It is provided "as is"
|
||||
without express or implied warranty of any kind.
|
||||
|
||||
These notices must be retained in any copies of any part of this
|
||||
documentation and/or software.
|
||||
*/
|
||||
|
||||
//#include <assert.h>
|
||||
#include <memory.h>
|
||||
#include <ctype.h>
|
||||
#include <vector>
|
||||
#include "MD5.h"
|
||||
|
||||
using std::string;
|
||||
using std::vector;
|
||||
|
||||
// Constants for MD5Transform routine.
|
||||
#define S11 7
|
||||
#define S12 12
|
||||
#define S13 17
|
||||
#define S14 22
|
||||
#define S21 5
|
||||
#define S22 9
|
||||
#define S23 14
|
||||
#define S24 20
|
||||
#define S31 4
|
||||
#define S32 11
|
||||
#define S33 16
|
||||
#define S34 23
|
||||
#define S41 6
|
||||
#define S42 10
|
||||
#define S43 15
|
||||
#define S44 21
|
||||
|
||||
static void MD5Transform ( UINT4 [4], const uchar [64] );
|
||||
static void Encode ( unsigned char *, UINT4 *, unsigned int );
|
||||
static void Decode ( UINT4 *, const uchar *, unsigned int );
|
||||
|
||||
static unsigned char PADDING[64] =
|
||||
{
|
||||
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
|
||||
};
|
||||
|
||||
// F, G, H and I are basic MD5 functions.
|
||||
#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
|
||||
#define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
|
||||
#define H(x, y, z) ((x) ^ (y) ^ (z))
|
||||
#define I(x, y, z) ((y) ^ ((x) | (~z)))
|
||||
|
||||
// ROTATE_LEFT rotates x left n bits.
|
||||
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
|
||||
|
||||
// FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
|
||||
// Rotation is separate from addition to prevent recomputation.
|
||||
#define FF(a, b, c, d, x, s, ac) { \
|
||||
(a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
|
||||
(a) = ROTATE_LEFT ((a), (s)); \
|
||||
(a) += (b); \
|
||||
}
|
||||
#define GG(a, b, c, d, x, s, ac) { \
|
||||
(a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
|
||||
(a) = ROTATE_LEFT ((a), (s)); \
|
||||
(a) += (b); \
|
||||
}
|
||||
#define HH(a, b, c, d, x, s, ac) { \
|
||||
(a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
|
||||
(a) = ROTATE_LEFT ((a), (s)); \
|
||||
(a) += (b); \
|
||||
}
|
||||
#define II(a, b, c, d, x, s, ac) { \
|
||||
(a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
|
||||
(a) = ROTATE_LEFT ((a), (s)); \
|
||||
(a) += (b); \
|
||||
}
|
||||
|
||||
// MD5 initialization. Begins an MD5 operation, writing a new context.
|
||||
void MD5Init (
|
||||
MD5_CTX *context ) // context
|
||||
{
|
||||
context->count[0] = context->count[1] = 0;
|
||||
// Load magic initialization constants.
|
||||
context->state[0] = 0x67452301;
|
||||
context->state[1] = 0xefcdab89;
|
||||
context->state[2] = 0x98badcfe;
|
||||
context->state[3] = 0x10325476;
|
||||
}
|
||||
|
||||
// MD5 block update operation. Continues an MD5 message-digest
|
||||
// operation, processing another message block, and updating the
|
||||
// context.
|
||||
void MD5Update (
|
||||
MD5_CTX *context, // context
|
||||
const char *input_, // input block
|
||||
unsigned int inputLen ) // length of input block
|
||||
{
|
||||
unsigned int i, index, partLen;
|
||||
const uchar* input = (const uchar*)input_;
|
||||
|
||||
// Compute number of bytes mod 64
|
||||
index = (unsigned int)((context->count[0] >> 3) & 0x3F);
|
||||
|
||||
// Update number of bits
|
||||
if ((context->count[0] += ((UINT4)inputLen << 3))
|
||||
< ((UINT4)inputLen << 3))
|
||||
context->count[1]++;
|
||||
context->count[1] += ((UINT4)inputLen >> 29);
|
||||
|
||||
partLen = 64 - index;
|
||||
|
||||
// Transform as many times as possible.
|
||||
if (inputLen >= partLen)
|
||||
{
|
||||
memcpy
|
||||
((POINTER)&context->buffer[index], (POINTER)input, partLen);
|
||||
MD5Transform (context->state, context->buffer);
|
||||
|
||||
for (i = partLen; i + 63 < inputLen; i += 64)
|
||||
MD5Transform (context->state, &input[i]);
|
||||
|
||||
index = 0;
|
||||
}
|
||||
else
|
||||
i = 0;
|
||||
|
||||
// Buffer remaining input
|
||||
memcpy
|
||||
((POINTER)&context->buffer[index], (POINTER)&input[i],
|
||||
inputLen-i);
|
||||
}
|
||||
|
||||
// MD5 finalization. Ends an MD5 message-digest operation, writing the
|
||||
// the message digest and zeroizing the context.
|
||||
void MD5Final (
|
||||
unsigned char digest[16], // message digest
|
||||
MD5_CTX *context ) // context
|
||||
{
|
||||
uchar bits[8];
|
||||
unsigned int index, padLen;
|
||||
|
||||
// Save number of bits
|
||||
Encode (bits, context->count, 8);
|
||||
|
||||
// Pad out to 56 mod 64.
|
||||
index = (unsigned int)((context->count[0] >> 3) & 0x3f);
|
||||
padLen = (index < 56) ? (56 - index) : (120 - index);
|
||||
MD5Update (context, (const char*)PADDING, padLen);
|
||||
|
||||
// Append length (before padding)
|
||||
MD5Update (context, (const char*)bits, 8);
|
||||
|
||||
// Store state in digest
|
||||
Encode (digest, context->state, 16);
|
||||
|
||||
// Zeroize sensitive information.
|
||||
memset ((POINTER)context, 0, sizeof (*context));
|
||||
}
|
||||
|
||||
// MD5 basic transformation. Transforms state based on block.
|
||||
static void MD5Transform (
|
||||
UINT4 state[4],
|
||||
const uchar block[64] )
|
||||
{
|
||||
UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
|
||||
|
||||
Decode (x, block, 64);
|
||||
|
||||
// Round 1
|
||||
FF (a, b, c, d, x[ 0], S11, 0xd76aa478); // 1
|
||||
FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); // 2
|
||||
FF (c, d, a, b, x[ 2], S13, 0x242070db); // 3
|
||||
FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); // 4
|
||||
FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); // 5
|
||||
FF (d, a, b, c, x[ 5], S12, 0x4787c62a); // 6
|
||||
FF (c, d, a, b, x[ 6], S13, 0xa8304613); // 7
|
||||
FF (b, c, d, a, x[ 7], S14, 0xfd469501); // 8
|
||||
FF (a, b, c, d, x[ 8], S11, 0x698098d8); // 9
|
||||
FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); // 10
|
||||
FF (c, d, a, b, x[10], S13, 0xffff5bb1); // 11
|
||||
FF (b, c, d, a, x[11], S14, 0x895cd7be); // 12
|
||||
FF (a, b, c, d, x[12], S11, 0x6b901122); // 13
|
||||
FF (d, a, b, c, x[13], S12, 0xfd987193); // 14
|
||||
FF (c, d, a, b, x[14], S13, 0xa679438e); // 15
|
||||
FF (b, c, d, a, x[15], S14, 0x49b40821); // 16
|
||||
|
||||
// Round 2
|
||||
GG (a, b, c, d, x[ 1], S21, 0xf61e2562); // 17
|
||||
GG (d, a, b, c, x[ 6], S22, 0xc040b340); // 18
|
||||
GG (c, d, a, b, x[11], S23, 0x265e5a51); // 19
|
||||
GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); // 20
|
||||
GG (a, b, c, d, x[ 5], S21, 0xd62f105d); // 21
|
||||
GG (d, a, b, c, x[10], S22, 0x2441453); // 22
|
||||
GG (c, d, a, b, x[15], S23, 0xd8a1e681); // 23
|
||||
GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); // 24
|
||||
GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); // 25
|
||||
GG (d, a, b, c, x[14], S22, 0xc33707d6); // 26
|
||||
GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); // 27
|
||||
GG (b, c, d, a, x[ 8], S24, 0x455a14ed); // 28
|
||||
GG (a, b, c, d, x[13], S21, 0xa9e3e905); // 29
|
||||
GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); // 30
|
||||
GG (c, d, a, b, x[ 7], S23, 0x676f02d9); // 31
|
||||
GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); // 32
|
||||
|
||||
// Round 3
|
||||
HH (a, b, c, d, x[ 5], S31, 0xfffa3942); // 33
|
||||
HH (d, a, b, c, x[ 8], S32, 0x8771f681); // 34
|
||||
HH (c, d, a, b, x[11], S33, 0x6d9d6122); // 35
|
||||
HH (b, c, d, a, x[14], S34, 0xfde5380c); // 36
|
||||
HH (a, b, c, d, x[ 1], S31, 0xa4beea44); // 37
|
||||
HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); // 38
|
||||
HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); // 39
|
||||
HH (b, c, d, a, x[10], S34, 0xbebfbc70); // 40
|
||||
HH (a, b, c, d, x[13], S31, 0x289b7ec6); // 41
|
||||
HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); // 42
|
||||
HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); // 43
|
||||
HH (b, c, d, a, x[ 6], S34, 0x4881d05); // 44
|
||||
HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); // 45
|
||||
HH (d, a, b, c, x[12], S32, 0xe6db99e5); // 46
|
||||
HH (c, d, a, b, x[15], S33, 0x1fa27cf8); // 47
|
||||
HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); // 48
|
||||
|
||||
// Round 4
|
||||
II (a, b, c, d, x[ 0], S41, 0xf4292244); // 49
|
||||
II (d, a, b, c, x[ 7], S42, 0x432aff97); // 50
|
||||
II (c, d, a, b, x[14], S43, 0xab9423a7); // 51
|
||||
II (b, c, d, a, x[ 5], S44, 0xfc93a039); // 52
|
||||
II (a, b, c, d, x[12], S41, 0x655b59c3); // 53
|
||||
II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); // 54
|
||||
II (c, d, a, b, x[10], S43, 0xffeff47d); // 55
|
||||
II (b, c, d, a, x[ 1], S44, 0x85845dd1); // 56
|
||||
II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); // 57
|
||||
II (d, a, b, c, x[15], S42, 0xfe2ce6e0); // 58
|
||||
II (c, d, a, b, x[ 6], S43, 0xa3014314); // 59
|
||||
II (b, c, d, a, x[13], S44, 0x4e0811a1); // 60
|
||||
II (a, b, c, d, x[ 4], S41, 0xf7537e82); // 61
|
||||
II (d, a, b, c, x[11], S42, 0xbd3af235); // 62
|
||||
II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); // 63
|
||||
II (b, c, d, a, x[ 9], S44, 0xeb86d391); // 64
|
||||
|
||||
state[0] += a;
|
||||
state[1] += b;
|
||||
state[2] += c;
|
||||
state[3] += d;
|
||||
|
||||
// Zeroize sensitive information.
|
||||
memset ((POINTER)x, 0, sizeof (x));
|
||||
}
|
||||
|
||||
// Encodes input (UINT4) into output (unsigned char). Assumes len is
|
||||
// a multiple of 4.
|
||||
static void Encode (
|
||||
unsigned char *output,
|
||||
UINT4 *input,
|
||||
unsigned int len )
|
||||
{
|
||||
unsigned int i, j;
|
||||
|
||||
for (i = 0, j = 0; j < len; i++, j += 4) {
|
||||
output[j] = (unsigned char)(input[i] & 0xff);
|
||||
output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
|
||||
output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
|
||||
output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
|
||||
}
|
||||
}
|
||||
|
||||
// Decodes input (unsigned char) into output (UINT4). Assumes len is
|
||||
// a multiple of 4.
|
||||
static void Decode (
|
||||
UINT4 *output,
|
||||
const uchar *input,
|
||||
unsigned int len )
|
||||
{
|
||||
unsigned int i, j;
|
||||
|
||||
for (i = 0, j = 0; j < len; i++, j += 4)
|
||||
output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) |
|
||||
(((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
|
||||
}
|
||||
|
||||
void digest2ascii ( char *ascii, const unsigned char *digest )
|
||||
{
|
||||
int i;
|
||||
static char* table = "0123456789abcdef";
|
||||
for ( i = 0; i < 16; i++ )
|
||||
{
|
||||
*ascii++ = table[(*digest)>>4];
|
||||
*ascii++ = table[(*digest++)%16];
|
||||
}
|
||||
*ascii++ = 0;
|
||||
}
|
||||
|
||||
void ascii2digest ( unsigned char *digest, const char *ascii )
|
||||
{
|
||||
int i;
|
||||
#define CONV(c) (unsigned char)( (toupper(c)>='A') ? (toupper(c)+10-'A') : ((c)-'0') )
|
||||
#define MAKECHAR(a,b) ((CONV(a)%16)<<4)|(CONV(b)%16)
|
||||
for ( i = 0; i < 16; i++ )
|
||||
{
|
||||
*digest++ = MAKECHAR(ascii[0],ascii[1]);
|
||||
ascii += 2;
|
||||
}
|
||||
}
|
||||
|
||||
#ifdef __cplusplus
|
||||
MD5::MD5()
|
||||
{
|
||||
Init();
|
||||
}
|
||||
|
||||
void MD5::Init()
|
||||
{
|
||||
MD5Init(&_ctx);
|
||||
}
|
||||
|
||||
void MD5::Update ( const string& s )
|
||||
{
|
||||
MD5Update ( &_ctx, s.c_str(), s.size() );
|
||||
}
|
||||
|
||||
string MD5::Final ( char* digest )
|
||||
{
|
||||
vector<uchar> v;
|
||||
v.resize(16);
|
||||
MD5Final ( &v[0], &_ctx );
|
||||
if ( digest )
|
||||
memmove ( digest, &v[0], 16 );
|
||||
string s;
|
||||
static char* tohex = "0123456789abcdef";
|
||||
for ( int i = 0; i < 16; i++ )
|
||||
{
|
||||
uchar c = v[i];
|
||||
s += tohex[ (c>>4) & 0xF ];
|
||||
s += tohex[ c & 0xF ];
|
||||
}
|
||||
return s;
|
||||
}
|
||||
|
||||
string MD5Hex ( const string& s )
|
||||
{
|
||||
MD5 md5;
|
||||
md5.Update ( s );
|
||||
return md5.Final();
|
||||
}
|
||||
|
||||
string MD5Bin ( const string& s )
|
||||
{
|
||||
MD5 md5;
|
||||
md5.Update ( s );
|
||||
char digest[16];
|
||||
md5.Final ( digest );
|
||||
return string ( digest, 16 );
|
||||
}
|
||||
|
||||
string HMAC_MD5 ( const string& key, const string& text, char* out_bin )
|
||||
{
|
||||
MD5 md5;
|
||||
char k_ipad[65]; // inner padding - key XORd with ipad
|
||||
char k_opad[65]; // outer padding - key XORd with opad
|
||||
string tmp;
|
||||
char digest[16];
|
||||
int i;
|
||||
// if key is longer than 64 bytes reset it to key=MD5(key)
|
||||
if ( key.length() > 64 )
|
||||
{
|
||||
md5.Init();
|
||||
md5.Update ( key );
|
||||
md5.Final ( digest );
|
||||
tmp = string ( digest, 16 );
|
||||
}
|
||||
else
|
||||
tmp = key;
|
||||
|
||||
// start out by storing key in pads
|
||||
memset ( k_ipad, 0, sizeof(k_ipad) );
|
||||
memset ( k_opad, 0, sizeof(k_opad) );
|
||||
memcpy ( k_ipad, tmp.c_str(), tmp.length() );
|
||||
memcpy ( k_opad, tmp.c_str(), tmp.length() );
|
||||
|
||||
// XOR key with ipad and opad values
|
||||
for ( i=0; i<64; i++ )
|
||||
{
|
||||
k_ipad[i] ^= 0x36;
|
||||
k_opad[i] ^= 0x5c;
|
||||
}
|
||||
|
||||
// "inner" MD5
|
||||
md5.Init();
|
||||
md5.Update(k_ipad);
|
||||
md5.Update(text);
|
||||
md5.Final ( digest );
|
||||
|
||||
// "outer" MD5
|
||||
md5.Init();
|
||||
md5.Update(k_opad);
|
||||
md5.Update(string(digest,16));
|
||||
return md5.Final(out_bin);
|
||||
}
|
||||
#endif//__cplusplus
|
||||
95
irc/ArchBlackmann/MD5.h
Normal file
95
irc/ArchBlackmann/MD5.h
Normal file
@@ -0,0 +1,95 @@
|
||||
// MD5.H - header file for MD5.CPP
|
||||
|
||||
/*
|
||||
Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
|
||||
rights reserved.
|
||||
|
||||
License to copy and use this software is granted provided that it
|
||||
is identified as the "RSA Data Security, Inc. MD5 Message-Digest
|
||||
Algorithm" in all material mentioning or referencing this software
|
||||
or this function.
|
||||
|
||||
License is also granted to make and use derivative works provided
|
||||
that such works are identified as "derived from the RSA Data
|
||||
Security, Inc. MD5 Message-Digest Algorithm" in all material
|
||||
mentioning or referencing the derived work.
|
||||
|
||||
RSA Data Security, Inc. makes no representations concerning either
|
||||
the merchantability of this software or the suitability of this
|
||||
software for any particular purpose. It is provided "as is"
|
||||
without express or implied warranty of any kind.
|
||||
|
||||
These notices must be retained in any copies of any part of this
|
||||
documentation and/or software.
|
||||
*/
|
||||
|
||||
#ifndef __MD5_H
|
||||
#define __MD5_H
|
||||
|
||||
#ifdef __cplusplus
|
||||
#include <string>
|
||||
#endif//__cplusplus
|
||||
|
||||
#ifndef uchar
|
||||
#define uchar unsigned char
|
||||
#endif//uchar
|
||||
|
||||
#ifndef ushort
|
||||
#define ushort unsigned short
|
||||
#endif//ushort
|
||||
|
||||
#ifndef ulong
|
||||
#define ulong unsigned long
|
||||
#endif//ulong
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif//__cplusplus
|
||||
|
||||
typedef uchar *POINTER; // POINTER defines a generic pointer type
|
||||
typedef ushort UINT2; // UINT2 defines a two byte word
|
||||
typedef ulong UINT4; // UINT4 defines a four byte word
|
||||
|
||||
// MD5 context.
|
||||
typedef struct
|
||||
{
|
||||
UINT4 state[4]; // state (ABCD)
|
||||
UINT4 count[2]; // number of bits, modulo 2^64 (lsb first)
|
||||
unsigned char buffer[64]; // input buffer
|
||||
} MD5_CTX;
|
||||
|
||||
void MD5Init ( MD5_CTX * );
|
||||
void MD5Update ( MD5_CTX *, const char *, unsigned int );
|
||||
void MD5Final ( uchar [16], MD5_CTX * );
|
||||
|
||||
void digest2ascii ( char *ascii, const uchar *digest );
|
||||
void ascii2digest ( uchar *digest, const char *ascii );
|
||||
|
||||
#ifdef __cplusplus
|
||||
|
||||
} // extern "C"
|
||||
|
||||
class MD5
|
||||
{
|
||||
public:
|
||||
MD5();
|
||||
void Init();
|
||||
void Update ( const std::string& s );
|
||||
std::string Final ( char* digest = 0 );
|
||||
|
||||
private:
|
||||
MD5_CTX _ctx;
|
||||
};
|
||||
|
||||
std::string MD5Hex ( const std::string& s );
|
||||
|
||||
std::string MD5Bin ( const std::string& s );
|
||||
|
||||
std::string HMAC_MD5 (
|
||||
const std::string& key,
|
||||
const std::string& text,
|
||||
char* out_bin = NULL );
|
||||
|
||||
#endif//__cplusplus
|
||||
|
||||
#endif//__MD5_H
|
||||
315
irc/ArchBlackmann/QueueT.h
Normal file
315
irc/ArchBlackmann/QueueT.h
Normal file
@@ -0,0 +1,315 @@
|
||||
/*
|
||||
** Author: Samuel R. Blackburn
|
||||
** Internet: wfc@pobox.com
|
||||
**
|
||||
** You can use it any way you like as long as you don't try to sell it.
|
||||
**
|
||||
** Any attempt to sell WFC in source code form must have the permission
|
||||
** of the original author. You can produce commercial executables with
|
||||
** WFC but you can't sell WFC.
|
||||
**
|
||||
** Copyright, 2000, Samuel R. Blackburn
|
||||
**
|
||||
** NOTE: I modified the info block below so it hopefully wouldn't conflict
|
||||
** with the original file. Royce Mitchell III
|
||||
*/
|
||||
|
||||
#ifndef QUEUET_CLASS_HEADER
|
||||
#define QUEUET_CLASS_HEADER
|
||||
|
||||
#include "ReliMT.h"
|
||||
|
||||
#ifdef WIN32
|
||||
#include <sys/types.h> // off_t
|
||||
#define HEAPCREATE(size) m_Heap = ::HeapCreate ( HEAP_NO_SERIALIZE, size, 0 )
|
||||
#define HEAPALLOC(size) ::HeapAlloc ( m_Heap, HEAP_NO_SERIALIZE, size )
|
||||
#define HEAPREALLOC(p,size) ::HeapReAlloc( m_Heap, HEAP_NO_SERIALIZE, p, size )
|
||||
#define HEAPFREE(p) ::HeapFree ( m_Heap, HEAP_NO_SERIALIZE, p )
|
||||
#define HEAPDESTROY() ::HeapDestroy ( m_Heap ); m_Heap = 0;
|
||||
#else
|
||||
#define HEAPCREATE(size)
|
||||
#define HEAPALLOC(size) malloc(size)
|
||||
#define HEAPREALLOC(p,size) realloc(p,size);
|
||||
#define HEAPFREE(p) free(p)
|
||||
#define HEAPDESTROY()
|
||||
#endif
|
||||
|
||||
template <class T>
|
||||
class CQueueT : public Uncopyable
|
||||
{
|
||||
protected:
|
||||
|
||||
// What we want to protect
|
||||
|
||||
Mutex m_AddMutex;
|
||||
Mutex m_GetMutex;
|
||||
|
||||
T* m_Items;
|
||||
|
||||
off_t m_AddIndex;
|
||||
off_t m_GetIndex;
|
||||
size_t m_Size;
|
||||
|
||||
#ifdef WIN32
|
||||
HANDLE m_Heap;
|
||||
#endif//WIN32
|
||||
inline void m_GrowBy ( size_t number_of_new_items );
|
||||
|
||||
public:
|
||||
|
||||
inline CQueueT ( size_t initial_size = 1024 );
|
||||
inline ~CQueueT();
|
||||
|
||||
inline bool Add( const T& new_item );
|
||||
inline void Empty() { m_AddIndex = 0; m_GetIndex = 0; };
|
||||
inline bool Get( T& item );
|
||||
inline size_t GetLength() const;
|
||||
inline size_t GetMaximumLength() const { return( m_Size ); };
|
||||
inline bool AddArray ( const T* new_items, int item_count );
|
||||
inline int GetArray ( T* items, const int maxget, const T& tEnd );
|
||||
inline bool Contains ( const T& t );
|
||||
};
|
||||
|
||||
template <class T>
|
||||
inline CQueueT<T>::CQueueT ( size_t initial_size )
|
||||
{
|
||||
m_AddIndex = 0;
|
||||
m_GetIndex = 0;
|
||||
m_Items = NULL;
|
||||
|
||||
if ( initial_size == 0 )
|
||||
initial_size = 1;
|
||||
|
||||
/*
|
||||
** 1999-11-05
|
||||
** We create our own heap because all of the pointers used are allocated
|
||||
** and freed be us. We don't have to worry about a non-serialized thread
|
||||
** accessing something we allocated. Because of this, we can perform our
|
||||
** memory allocations in a heap dedicated to queueing. This means when we
|
||||
** have to allocate more memory, we don't have to wait for all other threads
|
||||
** to pause while we allocate from the shared heap (like the C Runtime heap)
|
||||
*/
|
||||
|
||||
HEAPCREATE( ( ( ( 2 * initial_size * sizeof(T) ) < 65536 ) ? 65536 : (2 * initial_size * sizeof(T) ) ) );
|
||||
|
||||
m_Items = (T*)HEAPALLOC ( initial_size * sizeof(T) );
|
||||
|
||||
m_Size = ( m_Items == NULL ) ? 0 : initial_size;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline CQueueT<T>::~CQueueT()
|
||||
{
|
||||
m_AddIndex = 0;
|
||||
m_GetIndex = 0;
|
||||
m_Size = 0;
|
||||
|
||||
if ( m_Items != NULL )
|
||||
{
|
||||
HEAPFREE(m_Items);
|
||||
m_Items = NULL;
|
||||
}
|
||||
|
||||
HEAPDESTROY();
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool CQueueT<T>::Add ( const T& item )
|
||||
{
|
||||
// Block other threads from entering Add();
|
||||
Mutex::Lock addlock ( m_AddMutex );
|
||||
|
||||
// Add the item
|
||||
|
||||
m_Items[ m_AddIndex ] = item;
|
||||
|
||||
// 1999-12-08
|
||||
// Many many thanks go to Lou Franco (lfranco@spheresoft.com)
|
||||
// for finding an bug here. It rare but recreatable situations,
|
||||
// m_AddIndex could be in an invalid state.
|
||||
|
||||
// Make sure m_AddIndex is never invalid
|
||||
|
||||
off_t new_add_index = ( ( m_AddIndex + 1 ) >= (off_t)m_Size ) ? 0 : m_AddIndex + 1;
|
||||
|
||||
if ( new_add_index == m_GetIndex )
|
||||
{
|
||||
// The queue is full. We need to grow.
|
||||
// Stop anyone from getting from the queue
|
||||
Mutex::Lock getlock ( m_GetMutex );
|
||||
|
||||
m_AddIndex = new_add_index;
|
||||
|
||||
// One last double-check.
|
||||
|
||||
if ( m_AddIndex == m_GetIndex )
|
||||
{
|
||||
m_GrowBy ( m_Size );
|
||||
}
|
||||
|
||||
}
|
||||
else
|
||||
{
|
||||
m_AddIndex = new_add_index;
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool CQueueT<T>::Get( T& item )
|
||||
{
|
||||
// Prevent other threads from entering Get()
|
||||
Mutex::Lock getlock ( m_GetMutex );
|
||||
|
||||
if ( m_GetIndex == m_AddIndex )
|
||||
{
|
||||
// Let's check to see if our queue has grown too big
|
||||
// If it has, then shrink it
|
||||
|
||||
if ( m_Size > 1024 )
|
||||
{
|
||||
// Yup, we're too big for our britches
|
||||
Mutex::TryLock addlock ( m_AddMutex );
|
||||
if ( addlock )
|
||||
{
|
||||
// Now, no one can add to the queue
|
||||
|
||||
if ( m_GetIndex == m_AddIndex ) // is queue empty?
|
||||
{
|
||||
// See if we can just shrink it...
|
||||
T* return_value = (T*)HEAPREALLOC(m_Items,1024 * sizeof(T));
|
||||
|
||||
if ( return_value != NULL )
|
||||
{
|
||||
m_Items = (T*) return_value;
|
||||
}
|
||||
else
|
||||
{
|
||||
// Looks like we'll have to do it the hard way
|
||||
HEAPFREE ( m_Items );
|
||||
m_Items = (T*) HEAPALLOC ( 1024 * sizeof(T) );
|
||||
}
|
||||
|
||||
m_Size = ( m_Items == NULL ) ? 0 : 1024;
|
||||
m_AddIndex = 0;
|
||||
m_GetIndex = 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
// m_GetIndex != m_AddIndex, this means that someone added
|
||||
// to the queue between the time we checked m_Size for being
|
||||
// too big and the time we entered the add critical section.
|
||||
// If this happened then we are too busy to shrink
|
||||
}
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
item = m_Items[ m_GetIndex ];
|
||||
|
||||
// Make sure m_GetIndex is never invalid
|
||||
|
||||
m_GetIndex = ( ( m_GetIndex + 1 ) >= (off_t)m_Size ) ? 0 : m_GetIndex + 1;
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline int CQueueT<T>::GetArray ( T* items, const int maxget, const T& tEnd )
|
||||
{
|
||||
// TODO - oooh baby does this need to be optimized
|
||||
// Prevent other threads from entering Get()
|
||||
Mutex::Lock getlock ( m_GetMutex ); //::EnterCriticalSection( &m_GetCriticalSection );
|
||||
|
||||
int iResult = 0;
|
||||
for ( int i = 0; i < maxget; i++ )
|
||||
{
|
||||
if ( !Get(items[i]) )
|
||||
break;
|
||||
iResult++;
|
||||
if ( items[i] == tEnd )
|
||||
break;
|
||||
}
|
||||
// Let other threads call Get() now
|
||||
//::LeaveCriticalSection( &m_GetCriticalSection );
|
||||
return iResult;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline size_t CQueueT<T>::GetLength() const
|
||||
{
|
||||
// This is a very expensive process!
|
||||
// No one can call Add() or Get() while we're computing this
|
||||
|
||||
size_t number_of_items_in_the_queue = 0;
|
||||
|
||||
Mutex::Lock addlock ( m_AddMutex );
|
||||
Mutex::Lock getlock ( m_GetMutex );
|
||||
|
||||
number_of_items_in_the_queue = ( m_AddIndex >= m_GetIndex ) ?
|
||||
( m_AddIndex - m_GetIndex ) :
|
||||
( ( m_AddIndex + m_Size ) - m_GetIndex );
|
||||
|
||||
return number_of_items_in_the_queue;
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline void CQueueT<T>::m_GrowBy ( size_t number_of_new_items )
|
||||
{
|
||||
// Prevent other threads from calling Get().
|
||||
// We don't need to enter the AddCriticalSection because
|
||||
// m_GrowBy() is only called from Add();
|
||||
|
||||
T* new_array = NULL;
|
||||
T* pointer_to_free = NULL;
|
||||
|
||||
size_t new_size = m_Size + number_of_new_items;
|
||||
|
||||
{ // Prevent other threads from getting
|
||||
Mutex::Lock getlock ( m_GetMutex );
|
||||
|
||||
// 2000-05-16
|
||||
// Thanks go to Royce Mitchell III (royce3@aim-controls.com) for finding
|
||||
// a HUGE bug here. I was using HeapReAlloc as a short cut but my logic
|
||||
// was flawed. In certain circumstances, queue items were being dropped.
|
||||
|
||||
new_array = (T*)HEAPALLOC ( new_size * sizeof(T) );
|
||||
|
||||
// Now copy all of the old items from the old queue to the new one.
|
||||
|
||||
// Get the entries from the get-index to the end of the array
|
||||
memcpy ( new_array, &m_Items[m_GetIndex], ( m_Size - m_GetIndex ) * sizeof(T) );
|
||||
|
||||
// Get the entries from the beginning of the array to the add-index
|
||||
memcpy ( &new_array[m_Size-m_GetIndex], m_Items, m_AddIndex * sizeof(T) );
|
||||
|
||||
m_AddIndex = (off_t)m_Size;
|
||||
m_GetIndex = 0;
|
||||
m_Size = new_size;
|
||||
pointer_to_free = m_Items;
|
||||
m_Items = new_array;
|
||||
} // Mutex::Lock
|
||||
HEAPFREE ( pointer_to_free );
|
||||
}
|
||||
|
||||
template <class T>
|
||||
inline bool CQueueT<T>::Contains ( const T& t )
|
||||
{
|
||||
Mutex::Lock addlock ( m_AddMutex );
|
||||
Mutex::Lock getlock ( m_GetMutex );
|
||||
|
||||
for ( int i = m_GetIndex; i != m_AddIndex; i++ )
|
||||
{
|
||||
if ( i == m_Size )
|
||||
i = 0;
|
||||
if ( m_Items[i] == t )
|
||||
return true;
|
||||
}
|
||||
return m_Items[m_AddIndex] == t;
|
||||
}
|
||||
|
||||
typedef CQueueT<char> CCharQueue;
|
||||
|
||||
#endif // QUEUE_CLASS_HEADER
|
||||
143
irc/ArchBlackmann/Reli.h
Normal file
143
irc/ArchBlackmann/Reli.h
Normal file
@@ -0,0 +1,143 @@
|
||||
// Reli.h
|
||||
// lots of code here is (c) Bartosz Milewski, 1996, www.relisoft.com
|
||||
// The rest is (C) 2002-2004 Royce Mitchell III
|
||||
// and released under the LGPL & BSD licenses
|
||||
|
||||
#ifndef __RELI_H
|
||||
#define __RELI_H
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// Assert
|
||||
|
||||
#undef Assert
|
||||
#ifdef NDEBUG
|
||||
#define Assert(exp) ((void)0)
|
||||
#else
|
||||
void _wassert (char* szExpr, char* szFile, int line);
|
||||
#define Assert(exp) (void)( (exp) || (_wassert(#exp, __FILE__, __LINE__), 0) )
|
||||
#endif /* NDEBUG */
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// Swap
|
||||
|
||||
template <class T>
|
||||
void Swap(T a,T b)
|
||||
{
|
||||
T t = a;
|
||||
a = b;
|
||||
b = t;
|
||||
}
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// Uncopyable - base class disabling copy ctors
|
||||
class Uncopyable
|
||||
{
|
||||
public:
|
||||
Uncopyable(){} // need a default ctor
|
||||
private:
|
||||
Uncopyable ( const Uncopyable& );
|
||||
const Uncopyable& operator = ( const Uncopyable& );
|
||||
};
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// SPtr - Smart Pointer's must be passed by reference or const reference
|
||||
|
||||
template <class T>
|
||||
class SPtr : public Uncopyable
|
||||
{
|
||||
public:
|
||||
virtual ~SPtr () { Destroy(); }
|
||||
T * operator->() { return _p; }
|
||||
T const * operator->() const { return _p; }
|
||||
operator T&() { Assert(_p); return *_p; }
|
||||
operator const T&() const { Assert(_p); return *_p; }
|
||||
void Acquire ( SPtr<T>& t ) { Destroy(); Swap(_p,t._p); }
|
||||
void Destroy() { if ( _p ) { delete _p; _p = 0; } }
|
||||
protected:
|
||||
SPtr (): _p (0) {}
|
||||
explicit SPtr (T* p): _p (p) {}
|
||||
T * _p;
|
||||
private:
|
||||
operator T* () { return _p; }
|
||||
};
|
||||
|
||||
#define DECLARE_SPTR(cls,init,init2) \
|
||||
class S##cls : public SPtr<cls> \
|
||||
{ \
|
||||
public: \
|
||||
S##cls ( cls* p ) : SPtr<cls>(p) {} \
|
||||
explicit S##cls init : SPtr<cls> (new cls init2) {} \
|
||||
};
|
||||
/* Example Usage of DECLARE_SPTR:
|
||||
class MyClass
|
||||
{
|
||||
public: // can be protected
|
||||
MyClass ( int i )
|
||||
{
|
||||
...
|
||||
}
|
||||
...
|
||||
}; DECLARE_SPTR(MyClass,(int i),(i))
|
||||
SMyClass ptr(i);
|
||||
*/
|
||||
#define DECLARE_SPTRV(cls) typedef SPtr<cls> S##cls;
|
||||
/* Example Usage of DECLARE_SPTRV:
|
||||
class MyAbstractClass
|
||||
{
|
||||
public: // can be protected
|
||||
MyAbstractClass ( int i )
|
||||
{
|
||||
...
|
||||
}
|
||||
void MyPureVirtFunc() = 0;
|
||||
...
|
||||
}; DECLARE_SPTRV(MyAbstractClass)
|
||||
SMyAbstractClass ptr ( new MySubClass(i) );
|
||||
*/
|
||||
|
||||
#define DECLARE_PTR(cls,init,init2) \
|
||||
class Ptr : public SPtr<cls> \
|
||||
{ \
|
||||
Ptr(cls* p) : SPtr<cls> ( p ) \
|
||||
{ \
|
||||
} \
|
||||
Ptr init : SPtr<cls> ( new cls init2 ) {} \
|
||||
};
|
||||
/* Example Usage of DECLARE_PTR:
|
||||
class MyClass
|
||||
{
|
||||
DECLARE_PTR(MyClass,(int i),(i))
|
||||
public: // can be protected
|
||||
MyClass ( int i )
|
||||
{
|
||||
...
|
||||
}
|
||||
void MyPureVirtFunc() = 0;
|
||||
...
|
||||
};
|
||||
MyClass::Ptr ptr ( i );
|
||||
*/
|
||||
|
||||
#define DECLARE_PTRV(cls) \
|
||||
class Ptr : public SPtr<cls> \
|
||||
{ \
|
||||
Ptr(cls* p) : SPtr<cls> ( p ) \
|
||||
{ \
|
||||
} \
|
||||
};
|
||||
/* Example Usage of DECLARE_PTRV:
|
||||
class MyAbstractClass
|
||||
{
|
||||
DECLARE_PTRV(MyAbstractClass)
|
||||
public: // can be protected
|
||||
MyAbstractClass ( int i )
|
||||
{
|
||||
...
|
||||
}
|
||||
void MyPureVirtFunc() = 0;
|
||||
...
|
||||
};
|
||||
MyAbstractClass::Ptr ptr ( new MySubClass(i) );
|
||||
*/
|
||||
|
||||
#endif//__RELI_H
|
||||
331
irc/ArchBlackmann/ReliMT.cpp
Normal file
331
irc/ArchBlackmann/ReliMT.cpp
Normal file
@@ -0,0 +1,331 @@
|
||||
// ReliMT.cpp
|
||||
// lots of code here is (c) Bartosz Milewski, 1996, www.relisoft.com
|
||||
// The rest is (C) 2002-2004 Royce Mitchell III
|
||||
// and released under the LGPL & BSD licenses
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#ifdef WIN32
|
||||
# define WIN32_LEAN_AND_MEAN
|
||||
# include <windows.h>
|
||||
# define snprintf _snprintf
|
||||
#elif defined(UNIX)
|
||||
# include <errno.h>
|
||||
# include <sys/sem.h>
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif//WIN32|UNIX
|
||||
#include "verify.h"
|
||||
#include "ReliMT.h"
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// Assert
|
||||
|
||||
void _wassert ( char* szExpr, char* szFile, int line )
|
||||
{
|
||||
fprintf ( stderr, "Assertion Failure: \"%s\" in file %s, line %d", szExpr, szFile, line );
|
||||
exit (-1);
|
||||
}
|
||||
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// Thread
|
||||
|
||||
Thread::Thread ( long (THREADAPI * pFun) (void* arg), void* pArg )
|
||||
{
|
||||
#ifdef WIN32
|
||||
verify ( _handle = CreateThread (
|
||||
0, // Security attributes
|
||||
0, // Stack size
|
||||
(DWORD (WINAPI*)(void*))pFun,
|
||||
pArg,
|
||||
0, // don't create suspended.
|
||||
&_tid ));
|
||||
#elif defined(UNIX)
|
||||
// set up the thread attribute: right now, we do nothing with it.
|
||||
pthread_attr_t attr;
|
||||
pthread_attr_init(&attr);
|
||||
|
||||
// this will make the threads created by this process really concurrent
|
||||
verify ( !pthread_attr_setscope(&attr, PTHREAD_SCOPE_SYSTEM) );
|
||||
|
||||
// create the new OS thread object
|
||||
verify ( !pthread_create ( &_threadId, &attr, (void* (*) (void*))pFun, pArg ) );
|
||||
|
||||
verify ( !pthread_attr_destroy(&attr) );
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif//WIN32|UNIX
|
||||
}
|
||||
|
||||
Thread::~Thread()
|
||||
{
|
||||
#ifdef WIN32
|
||||
verify ( CloseHandle ( _handle ) );
|
||||
#elif defined(UNIX)
|
||||
verify ( !pthread_cancel ( _threadId ) );
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif//WIN32|UNIX
|
||||
}
|
||||
|
||||
/*void Thread::Resume()
|
||||
{
|
||||
#ifdef WIN32
|
||||
ResumeThread (_handle);
|
||||
#elif defined(UNIX)
|
||||
# error how to resume thread in unix?
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif//WIN32|UNIX
|
||||
}*/
|
||||
|
||||
void Thread::WaitForDeath()
|
||||
{
|
||||
#ifdef WIN32
|
||||
DWORD dw = WaitForSingleObject ( _handle, 2000 );
|
||||
ASSERT ( dw != WAIT_FAILED );
|
||||
#elif defined(UNIX)
|
||||
verify ( !pthread_join ( _threadId, (void**)NULL ) );
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif//WIN32|UNIX
|
||||
}
|
||||
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// ActiveObject
|
||||
|
||||
// The constructor of the derived class
|
||||
// should call
|
||||
// _thread.Resume();
|
||||
// at the end of construction
|
||||
|
||||
ActiveObject::ActiveObject() : _isDying (0), _thread (0)
|
||||
{
|
||||
}
|
||||
|
||||
ActiveObject::~ActiveObject()
|
||||
{
|
||||
ASSERT ( !_thread ); // call Kill() from subclass's dtor
|
||||
// Kill() - // You can't call a virtual function from a dtor, EVEN INDIRECTLY
|
||||
// so, you must call Kill() in the subclass's dtor
|
||||
}
|
||||
|
||||
// FlushThread must reset all the events on which the thread might be waiting.
|
||||
void ActiveObject::Kill()
|
||||
{
|
||||
if ( _thread )
|
||||
{
|
||||
_isDying++;
|
||||
FlushThread();
|
||||
// Let's make sure it's gone
|
||||
_thread->WaitForDeath();
|
||||
delete _thread;
|
||||
_thread = 0;
|
||||
}
|
||||
}
|
||||
|
||||
void ActiveObject::Start()
|
||||
{
|
||||
ASSERT ( !_thread );
|
||||
_thread = new Thread ( ThreadEntry, this );
|
||||
}
|
||||
|
||||
long THREADAPI ActiveObject::ThreadEntry ( void* pArg )
|
||||
{
|
||||
ActiveObject * pActive = (ActiveObject*)pArg;
|
||||
pActive->InitThread();
|
||||
pActive->Run();
|
||||
pActive->Kill();
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////////
|
||||
// Mutex
|
||||
|
||||
Mutex::Mutex()
|
||||
{
|
||||
#ifdef WIN32
|
||||
verify ( _h = CreateMutex ( NULL, FALSE, NULL ) );
|
||||
#elif defined(UNIX)
|
||||
pthread_mutexattr_t attrib;
|
||||
verify ( !pthread_mutexattr_init( &attrib ) );
|
||||
// allow recursive locks
|
||||
verify ( !pthread_mutexattr_settype( &attrib, PTHREAD_MUTEX_RECURSIVE ) );
|
||||
verify ( !pthread_mutex_init ( &_mutex, &attrib ) );
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
|
||||
Mutex::~Mutex()
|
||||
{
|
||||
#ifdef WIN32
|
||||
verify ( CloseHandle ( _h ) );
|
||||
#elif defined(UNIX)
|
||||
verify ( !pthread_mutex_destroy(&_mutex) );
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
|
||||
void Mutex::Acquire()
|
||||
{
|
||||
#ifdef WIN32
|
||||
DWORD dw = WaitForSingleObject ( _h, INFINITE );
|
||||
ASSERT ( dw == WAIT_OBJECT_0 || dw == WAIT_ABANDONED );
|
||||
#elif defined(UNIX)
|
||||
verify ( !pthread_mutex_lock(&_mutex) );
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
|
||||
bool Mutex::TryAcquire()
|
||||
{
|
||||
#ifdef WIN32
|
||||
DWORD dw = WaitForSingleObject ( _h, 1 );
|
||||
ASSERT ( dw == WAIT_OBJECT_0 || dw == WAIT_TIMEOUT || dw == WAIT_ABANDONED );
|
||||
return (dw != WAIT_TIMEOUT);
|
||||
#elif defined(UNIX)
|
||||
int err = pthread_mutex_trylock(&_mutex);
|
||||
ASSERT ( err == EBUSY || err == 0 );
|
||||
return (err == 0);
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
|
||||
void Mutex::Release()
|
||||
{
|
||||
#ifdef WIN32
|
||||
verify ( ReleaseMutex ( _h ) );
|
||||
#elif defined(UNIX)
|
||||
verify ( !pthread_mutex_unlock(&_mutex) );
|
||||
// we could allow EPERM return value too, but we are forcing user into RIIA
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
|
||||
Mutex::Lock::Lock ( Mutex& m ) : _m(m)
|
||||
{
|
||||
_m.Acquire();
|
||||
}
|
||||
|
||||
Mutex::Lock::~Lock()
|
||||
{
|
||||
_m.Release();
|
||||
}
|
||||
|
||||
Mutex::TryLock::TryLock ( Mutex& m ) : _m(m)
|
||||
{
|
||||
_bLocked = _m.TryAcquire();
|
||||
}
|
||||
|
||||
Mutex::TryLock::~TryLock()
|
||||
{
|
||||
if ( _bLocked )
|
||||
_m.Release();
|
||||
}
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////////
|
||||
// Event
|
||||
|
||||
Event::Event()
|
||||
{
|
||||
#ifdef WIN32
|
||||
// start in non-signaled state (red light)
|
||||
// auto reset after every Wait
|
||||
verify ( _handle = CreateEvent ( 0, FALSE, FALSE, 0 ) );
|
||||
#elif defined(UNIX)
|
||||
//verify ( !pthread_cond_init ( &_cond, NULL /* default attributes */) );
|
||||
sem_init();
|
||||
//verify(sem_init());
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
|
||||
Event::~Event()
|
||||
{
|
||||
#ifdef WIN32
|
||||
verify ( CloseHandle ( _handle ) );
|
||||
#elif defined(UNIX)
|
||||
//verify ( !pthread_cond_destroy ( &_cond ) );
|
||||
sem_destroy();
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
|
||||
void Event::Release() // put into signaled state
|
||||
{
|
||||
#ifdef WIN32
|
||||
verify ( SetEvent ( _handle ) );
|
||||
#elif defined(UNIX)
|
||||
//verify ( !pthread_cond_signal ( &_cond ) );
|
||||
verify(!sem_V());
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
|
||||
void Event::Wait()
|
||||
{
|
||||
#ifdef WIN32
|
||||
// Wait until event is in signaled (green) state
|
||||
DWORD dw = WaitForSingleObject ( _handle, INFINITE );
|
||||
ASSERT ( dw == WAIT_OBJECT_0 || dw == WAIT_ABANDONED );
|
||||
#elif defined(UNIX)
|
||||
// According to docs: The pthread_cond_wait() and pthread_cond_timedwait()
|
||||
// functions are used to block on a condition variable. They are called
|
||||
// with mutex locked by the calling thread or undefined behaviour will
|
||||
// result.
|
||||
//Mutex::Lock lock ( _mutex );
|
||||
//verify ( !pthread_cond_wait ( &_cond, _mutex ) );
|
||||
verify(!sem_P());
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
|
||||
#ifdef UNIX
|
||||
void Event::sem_init()
|
||||
{
|
||||
sem_id = semget(IPC_PRIVATE, 1, 0666 | IPC_CREAT);
|
||||
ASSERT(sem_id != -1);
|
||||
}
|
||||
|
||||
int Event::sem_P()
|
||||
{
|
||||
struct sembuf sb;
|
||||
sb.sem_num = 0;
|
||||
sb.sem_op = -1;
|
||||
sb.sem_flg = 0;
|
||||
return semop(sem_id, &sb, 1);
|
||||
}
|
||||
|
||||
int Event::sem_V()
|
||||
{
|
||||
struct sembuf sb;
|
||||
sb.sem_num = 0;
|
||||
sb.sem_op = 1;
|
||||
sb.sem_flg = 0;
|
||||
return semop(sem_id, &sb, 1);
|
||||
}
|
||||
|
||||
void Event::sem_destroy()
|
||||
{
|
||||
#ifdef MACOSX
|
||||
semun mactmp;
|
||||
mactmp.val = 0;
|
||||
semctl(sem_id, 0, IPC_RMID, mactmp);
|
||||
#else
|
||||
semctl(sem_id, 0, IPC_RMID, 0);
|
||||
#endif
|
||||
}
|
||||
#endif
|
||||
|
||||
229
irc/ArchBlackmann/ReliMT.h
Normal file
229
irc/ArchBlackmann/ReliMT.h
Normal file
@@ -0,0 +1,229 @@
|
||||
// ReliMT.h
|
||||
// lots of code here is (c) Bartosz Milewski, 1996, www.relisoft.com
|
||||
// The rest is (C) 2003-2004 Royce Mitchell III
|
||||
// and released under the LGPL & BSD licenses
|
||||
|
||||
|
||||
#ifndef __RELIMT_H
|
||||
#define __RELIMT_H
|
||||
|
||||
#include "Reli.h"
|
||||
|
||||
#ifdef WIN32
|
||||
# ifndef _WINDOWS_
|
||||
# define WIN32_LEAN_AND_MEAN
|
||||
# include <windows.h>
|
||||
# endif
|
||||
# define THREADAPI WINAPI
|
||||
#elif defined(UNIX)
|
||||
# include <pthread.h>
|
||||
# include <stdlib.h>
|
||||
# include "string.h"
|
||||
# include <sys/types.h> //Semaphore
|
||||
# include <sys/ipc.h> //Semaphore
|
||||
# include <sys/sem.h> //Semaphore
|
||||
# define THREADAPI
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// Thread
|
||||
|
||||
class Thread : public Uncopyable
|
||||
{
|
||||
public:
|
||||
Thread ( long (THREADAPI * pFun) (void* arg), void* pArg );
|
||||
~Thread();
|
||||
//void Resume();
|
||||
void WaitForDeath();
|
||||
|
||||
// platform-specific stuff:
|
||||
private:
|
||||
#ifdef WIN32
|
||||
HANDLE _handle;
|
||||
DWORD _tid; // thread id
|
||||
#elif defined(UNIX)
|
||||
pthread_t _threadId; // id of the thread
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
//DECLARE_PTR(Thread,(long (THREADAPI * pFun) (void* arg), void* pArg),(pFun,pArg));
|
||||
}; //DECLARE_SPTR(Thread,(long (THREADAPI * pFun) (void* arg), void* pArg),(pFun,pArg));
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// ActiveObject
|
||||
|
||||
class ActiveObject : public Uncopyable
|
||||
{
|
||||
public:
|
||||
ActiveObject();
|
||||
virtual ~ActiveObject();
|
||||
void Kill();
|
||||
void Start();
|
||||
|
||||
protected:
|
||||
virtual void InitThread() = 0;
|
||||
virtual void Run() = 0;
|
||||
virtual void FlushThread() = 0;
|
||||
|
||||
int _isDying;
|
||||
|
||||
static long THREADAPI ThreadEntry ( void *pArg );
|
||||
Thread *_thread;
|
||||
|
||||
//DECLARE_PTRV(ActiveObject);
|
||||
}; //DECLARE_SPTRV(ActiveObject);
|
||||
|
||||
// Last thing in the constructor of a class derived from
|
||||
// ActiveObject you must call
|
||||
// Start();
|
||||
// Inside the loop the Run method you must keep checking _isDying
|
||||
// if (_isDying)
|
||||
// return;
|
||||
// FlushThread must reset all the events on which the thread might be waiting.
|
||||
// Example:
|
||||
#if 0
|
||||
// MyAsyncOutputter - class that outputs strings to a file asynchronously
|
||||
class MyAsyncOutputter : public ActiveObject
|
||||
{
|
||||
public:
|
||||
MyAsyncOutputter ( const string& filename ) : _filename(filename), _currentBuf(0)
|
||||
{
|
||||
Start(); // start thread
|
||||
}
|
||||
void InitThread()
|
||||
{
|
||||
_f.open ( _filename, "wb" );
|
||||
}
|
||||
void Output ( const string& s )
|
||||
{
|
||||
{
|
||||
// acquire lock long enough to add the string to the active buffer
|
||||
Mutex::Lock lock ( _mutex );
|
||||
_buf[_currentBuf].push_back ( s );
|
||||
}
|
||||
_event.Release(); // don't need the lock fire the event
|
||||
}
|
||||
void Run()
|
||||
{
|
||||
while ( !_isDying )
|
||||
{
|
||||
// wait for signal from Output() or FlushThread()
|
||||
_event.Wait();
|
||||
{
|
||||
// acquire lock long enough to switch active buffers
|
||||
Mutex::Lock lock ( _mutex );
|
||||
_currentBuf = 1-_currentBuf;
|
||||
ASSERT ( !_buf[_currentBuf].size() );
|
||||
}
|
||||
// get a reference to the old buffer
|
||||
vector<string>& buf = _buf[1-_currentBuf];
|
||||
// write each string out to file and then empty the buffer
|
||||
for ( int i = 0; i < buf.size(); i++ )
|
||||
_f.write ( buf[i].c_str(), buf[i].size() );
|
||||
buf.resize(0);
|
||||
}
|
||||
}
|
||||
void FlushThread()
|
||||
{
|
||||
// _isDying is already set: signal thread so it can see that too
|
||||
_event.Release();
|
||||
}
|
||||
private:
|
||||
string _filename;
|
||||
File _f;
|
||||
int _currentBuf;
|
||||
vector<string> _buf[2];
|
||||
Event _event;
|
||||
Mutex _mutex;
|
||||
};
|
||||
#endif
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// Mutex
|
||||
|
||||
class Mutex : public Uncopyable
|
||||
{
|
||||
public:
|
||||
Mutex();
|
||||
~Mutex();
|
||||
private:
|
||||
void Acquire();
|
||||
bool TryAcquire();
|
||||
void Release();
|
||||
public:
|
||||
// sub-class used to lock the Mutex
|
||||
class Lock : public Uncopyable
|
||||
{
|
||||
public:
|
||||
Lock ( Mutex& m );
|
||||
~Lock();
|
||||
|
||||
private:
|
||||
// private data
|
||||
Mutex& _m;
|
||||
};
|
||||
friend class Mutex::Lock;
|
||||
|
||||
|
||||
// sub-class used to attempt to lock the mutex. Use operator bool()
|
||||
// to test if the lock was successful
|
||||
class TryLock : public Uncopyable
|
||||
{
|
||||
public:
|
||||
TryLock ( Mutex& m );
|
||||
~TryLock();
|
||||
operator bool () { return _bLocked; }
|
||||
|
||||
private:
|
||||
// private data
|
||||
bool _bLocked;
|
||||
Mutex& _m;
|
||||
};
|
||||
friend class Mutex::TryLock;
|
||||
|
||||
private:
|
||||
// platform-specific stuff:
|
||||
#ifdef WIN32
|
||||
HANDLE _h;
|
||||
#elif defined(UNIX)
|
||||
pthread_mutex_t _mutex;
|
||||
public: operator pthread_mutex_t* () { return &_mutex; }
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
};
|
||||
|
||||
////////////////////////////////////////////////////////////////////////////////
|
||||
// Event
|
||||
|
||||
class Event : public Uncopyable
|
||||
{
|
||||
public:
|
||||
Event();
|
||||
~Event();
|
||||
void Release(); // put into signaled state
|
||||
void Wait();
|
||||
|
||||
private:
|
||||
#ifdef WIN32
|
||||
HANDLE _handle;
|
||||
#elif defined(UNIX)
|
||||
//Sem util functions
|
||||
void sem_init();
|
||||
int sem_P();
|
||||
int sem_V();
|
||||
void sem_destroy();
|
||||
|
||||
int sem_id;
|
||||
//pthread_cond_t _cond;
|
||||
//Mutex _mutex;
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
//DECLARE_PTR(Event,(),());
|
||||
}; //DECLARE_SPTR(Event,(),());
|
||||
|
||||
#endif//__RELIWIN32_H
|
||||
504
irc/ArchBlackmann/SockUtils.cpp
Normal file
504
irc/ArchBlackmann/SockUtils.cpp
Normal file
@@ -0,0 +1,504 @@
|
||||
// SockUtils.cpp - Some basic socket utility functions.
|
||||
// (C) 2002-2004 Royce Mitchell III
|
||||
// This file is under the BSD & LGPL licenses
|
||||
|
||||
#include <stdio.h>
|
||||
#include "SockUtils.h"
|
||||
#ifdef WIN32
|
||||
# ifndef SD_SEND // defined in winsock2.h, but not winsock.h
|
||||
# define SD_SEND 1
|
||||
# endif
|
||||
# define snprintf _snprintf
|
||||
# ifdef _MSC_VER
|
||||
# pragma comment ( lib, "ws2_32.lib" )
|
||||
# endif//_MSC_VER
|
||||
#elif defined(UNIX)
|
||||
# include <errno.h>
|
||||
# include "string.h" // memset
|
||||
# include <netdb.h> // hostent
|
||||
# include <arpa/inet.h> //inet_addr
|
||||
# include <sys/time.h>
|
||||
# define SD_SEND SHUT_WR //bah thou shalt name thy defines the same
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
//// Constants /////////////////////////////////////////////////////////
|
||||
const int kBufferSize = 1024;
|
||||
// creates broadcast address
|
||||
SockAddrIn::SockAddrIn()
|
||||
{
|
||||
memset ( this, 0, sizeof(sockaddr_in) );
|
||||
sin_family = AF_INET;
|
||||
}
|
||||
SockAddrIn::SockAddrIn ( const char* szAddr, u_short iPort )
|
||||
{
|
||||
memset ( this, 0, sizeof(sockaddr_in) );
|
||||
sin_family = AF_INET;
|
||||
sin_addr.s_addr = suLookupAddress(szAddr);
|
||||
sin_port = htons(iPort);
|
||||
}
|
||||
SockAddrIn::SockAddrIn ( in_addr_t iAddr, u_short iPort )
|
||||
{
|
||||
memset ( this, 0, sizeof(sockaddr_in) );
|
||||
sin_family = AF_INET;
|
||||
sin_addr.s_addr = iAddr;
|
||||
sin_port = htons(iPort);
|
||||
}
|
||||
bool suStartup()
|
||||
{
|
||||
#ifdef WIN32
|
||||
WSADATA wsaData;
|
||||
if ( WSAStartup ( MAKEWORD(2,0), &wsaData ) )
|
||||
return false;
|
||||
if ( wsaData.wVersion != MAKEWORD(2,0) )
|
||||
{
|
||||
WSACleanup();
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
#elif defined(UNIX)
|
||||
// nothing special required here
|
||||
return true;
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
//// suTcpSocket ////////////////////////////////////////////////
|
||||
// Creates a TCP socket.
|
||||
SOCKET suTcpSocket()
|
||||
{
|
||||
SOCKET so = socket ( AF_INET, SOCK_STREAM, 0 );
|
||||
#if defined(_DEBUG) && defined(WIN32)
|
||||
if ( so == INVALID_SOCKET && WSANOTINITIALISED == WSAGetLastError() )
|
||||
MessageBox ( NULL, "You forgot to call suStartup()!", "SockUtils", MB_OK|MB_ICONEXCLAMATION );
|
||||
#endif
|
||||
return so;
|
||||
}
|
||||
//// suUdpSocket ////////////////////////////////////////////////
|
||||
// Creates a UDP socket. Compensates for new "functionality" introduced
|
||||
// in Win2K with regards to select() calls
|
||||
// MS Transport Provider IOCTL to control
|
||||
// reporting PORT_UNREACHABLE messages
|
||||
// on UDP sockets via recv/WSARecv/etc.
|
||||
// Path TRUE in input buffer to enable (default if supported),
|
||||
// FALSE to disable.
|
||||
#ifndef SIO_UDP_CONNRESET
|
||||
#define SIO_UDP_CONNRESET _WSAIOW(IOC_VENDOR,12)
|
||||
#endif//SIO_UDP_CONNRESET
|
||||
SOCKET suUdpSocket()
|
||||
{
|
||||
SOCKET so = socket ( AF_INET, SOCK_DGRAM, 0 );
|
||||
#if defined(_DEBUG) && defined(WIN32)
|
||||
if ( so == INVALID_SOCKET && WSANOTINITIALISED == WSAGetLastError() )
|
||||
MessageBox ( NULL, "You forgot to call suStartup()!", "SockUtils", MB_OK|MB_ICONEXCLAMATION );
|
||||
#endif
|
||||
#ifdef WIN32
|
||||
// for Windows 2000, disable new behavior...
|
||||
// see: http://www-pc.uni-regensburg.de/systemsw/W2KPRO/UPDATE/POSTSP1/Q263823.htm
|
||||
// this code is innocuous on other win32 platforms
|
||||
DWORD dwBytesReturned = 0;
|
||||
BOOL bNewBehavior = FALSE;
|
||||
// disable new Win2K behavior using
|
||||
// IOCTL: SIO_UDP_CONNRESET
|
||||
// we don't care about return value :)
|
||||
WSAIoctl(so, SIO_UDP_CONNRESET,
|
||||
&bNewBehavior, sizeof(bNewBehavior),
|
||||
NULL, 0, &dwBytesReturned,
|
||||
NULL, NULL);
|
||||
#endif
|
||||
return so;
|
||||
}
|
||||
//// suShutdownConnection ////////////////////////////////////////////////
|
||||
// Gracefully shuts the connection sd down. Returns true if it was able
|
||||
// to shut it down nicely, false if we had to "slam" it shut.
|
||||
// (either way, the socket does get closed)
|
||||
bool suShutdownConnection(SOCKET sd)
|
||||
{
|
||||
if ( sd == INVALID_SOCKET )
|
||||
return true;
|
||||
// Disallow any further data sends. This will tell the other side
|
||||
// that we want to go away now. If we skip this step, we don't
|
||||
// shut the connection down nicely.
|
||||
if (shutdown(sd, SD_SEND) == SOCKET_ERROR)
|
||||
{
|
||||
closesocket(sd);
|
||||
return false;
|
||||
}
|
||||
// Receive any extra data still sitting on the socket. After all
|
||||
// data is received, this call will block until the remote host
|
||||
// acknowledges the TCP control packet sent by the shutdown above.
|
||||
// Then we'll get a 0 back from recv, signalling that the remote
|
||||
// host has closed its side of the connection.
|
||||
char acReadBuffer[kBufferSize];
|
||||
for ( ;; )
|
||||
{
|
||||
int nNewBytes = recv(sd, acReadBuffer, kBufferSize, 0);
|
||||
if (nNewBytes == SOCKET_ERROR)
|
||||
{
|
||||
closesocket(sd);
|
||||
return false;
|
||||
}
|
||||
else if (nNewBytes != 0)
|
||||
{
|
||||
// FYI, received (nNewBytes) unexpected bytes during shutdown.
|
||||
}
|
||||
else
|
||||
{
|
||||
// Okay, we're done!
|
||||
break;
|
||||
}
|
||||
}
|
||||
// Close the socket.
|
||||
if (closesocket(sd) == SOCKET_ERROR)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
//// suLookupAddress ////////////////////////////////////////////////
|
||||
// Basically converts a name address to an ip address
|
||||
in_addr_t suLookupAddress ( const char* pcHost )
|
||||
{
|
||||
in_addr_t nRemoteAddr = inet_addr(pcHost);
|
||||
if ( nRemoteAddr == INADDR_NONE )
|
||||
{
|
||||
// pcHost isn't a dotted IP, so resolve it through DNS
|
||||
hostent* pHE = gethostbyname(pcHost);
|
||||
if ( pHE == 0 )
|
||||
{
|
||||
#if defined(_DEBUG) && defined(WIN32)
|
||||
if ( WSANOTINITIALISED == WSAGetLastError() )
|
||||
MessageBox ( NULL, "You forgot to call suStartup()!", "SockUtils", MB_OK|MB_ICONEXCLAMATION );
|
||||
#endif
|
||||
return INADDR_NONE;
|
||||
}
|
||||
nRemoteAddr = *((in_addr_t*)pHE->h_addr_list[0]);
|
||||
}
|
||||
return nRemoteAddr;
|
||||
}
|
||||
bool suConnect ( SOCKET so, in_addr_t iAddress, u_short iPort )
|
||||
{
|
||||
SockAddrIn sinRemote ( iAddress, iPort );
|
||||
if ( SOCKET_ERROR == connect(so,sinRemote,sizeof(sinRemote)) )
|
||||
{
|
||||
#if defined(_DEBUG) && defined(WIN32)
|
||||
if ( WSANOTINITIALISED == WSAGetLastError() )
|
||||
MessageBox ( NULL, "You forgot to call suStartup()!", "SockUtils", MB_OK|MB_ICONEXCLAMATION );
|
||||
#endif
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
bool suConnect ( SOCKET so, const char* szAddress, u_short iPort )
|
||||
{
|
||||
return suConnect ( so, suLookupAddress(szAddress), iPort );
|
||||
}
|
||||
//// suEstablishConnection ////////////////////////////////////////////////
|
||||
// creates a socket of the specified type, connects to the ip address/port
|
||||
// requested, and returns the SOCKET created
|
||||
SOCKET suEstablishConnection ( in_addr_t iAddress, u_short iPort, int type )
|
||||
{
|
||||
// Create a socket
|
||||
if ( type != SOCK_STREAM && type != SOCK_DGRAM )
|
||||
return INVALID_SOCKET;
|
||||
SOCKET so = socket(AF_INET, type, 0);
|
||||
if ( so == INVALID_SOCKET )
|
||||
return so;
|
||||
if ( !suConnect(so, iAddress, iPort) )
|
||||
{
|
||||
closesocket(so);
|
||||
return INVALID_SOCKET;
|
||||
}
|
||||
return so;
|
||||
}
|
||||
//// suEstablishConnection ////////////////////////////////////////////////
|
||||
// creates a socket of the specified type, connects to the address/port
|
||||
// requested, and returns the SOCKET created
|
||||
SOCKET suEstablishConnection ( const char* szAddress, u_short iPort, int type )
|
||||
{
|
||||
return suEstablishConnection ( suLookupAddress ( szAddress ), iPort, type );
|
||||
}
|
||||
//// suBroadcast ////////////////////////////////////////////////
|
||||
// takes a previously created broadcast-enabled UDP socket, and broadcasts
|
||||
// a message on the local network
|
||||
bool suBroadcast ( SOCKET so, u_short port, const char* buf, int len /* = -1 */ )
|
||||
{
|
||||
if ( len == -1 )
|
||||
len = (int)strlen(buf);
|
||||
#if 1
|
||||
SockAddrIn to ( INADDR_BROADCAST, port );
|
||||
#else // some strange MS OS's don't broadcast to localhost...
|
||||
SockAddrIn to ( "127.0.0.1", port );
|
||||
if ( SOCKET_ERROR == sendto ( so, buf, len, 0, to, sizeof(to) ) )
|
||||
return false;
|
||||
to.sin_addr.s_addr = INADDR_BROADCAST;
|
||||
#endif
|
||||
if ( SOCKET_ERROR == sendto ( so, buf, len, 0, to, sizeof(to) ) )
|
||||
return false;
|
||||
return true;
|
||||
}
|
||||
//// suRecv ////////////////////////////////////////////////
|
||||
// retrieves data sent to our TCP socket. If no data, waits for
|
||||
// a period of timeout ms.
|
||||
// returns bytes received
|
||||
// -1 == SOCKET_ERROR
|
||||
// -2 == timed out waiting for data
|
||||
int suRecv ( SOCKET so, char* buf, int buflen, int timeout )
|
||||
{
|
||||
struct timeval to;
|
||||
fd_set rread;
|
||||
int res;
|
||||
FD_ZERO(&rread); // clear the fd_set
|
||||
FD_SET(so,&rread); // indicate which socket(s) we want to check
|
||||
memset((char *)&to,0,sizeof(to)); // clear the timeval struct
|
||||
to.tv_sec = timeout; // timeout select after (timeout) seconds
|
||||
// select returns > 0 if there is an event on the socket
|
||||
res = select((int)so+1, &rread, (fd_set *)0, (fd_set *)0, &to );
|
||||
if (res < 0)
|
||||
return -1; // socket error
|
||||
// there was an event on the socket
|
||||
if ( (res>0) && (FD_ISSET(so,&rread)) )
|
||||
return recv ( so, buf, buflen, 0 );
|
||||
return -2;
|
||||
}
|
||||
//// suRecvFrom ////////////////////////////////////////////////
|
||||
// retrieves data sent to our UDP socket. If no data, waits for
|
||||
// a period of timeout ms.
|
||||
// returns bytes received
|
||||
// returns bytes received
|
||||
// -1 == SOCKET_ERROR
|
||||
// -2 == timed out waiting for data
|
||||
int suRecvFrom ( SOCKET so, char* buf, int buflen, int timeout, sockaddr_in* from, socklen_t* fromlen )
|
||||
{
|
||||
struct timeval to;
|
||||
fd_set rread;
|
||||
int res;
|
||||
FD_ZERO(&rread); // clear the fd_set
|
||||
FD_SET(so,&rread); // indicate which socket(s) we want to check
|
||||
memset((char *)&to,0,sizeof(to)); // clear the timeval struct
|
||||
to.tv_sec = timeout; // timeout select after (timeout) seconds
|
||||
// select returns > 0 if there is an event on the socket
|
||||
res = select((int)so+1, &rread, (fd_set *)0, (fd_set *)0, &to );
|
||||
if (res < 0)
|
||||
return -1; // socket error
|
||||
// there was an event on the socket
|
||||
if ( (res>0) && (FD_ISSET(so,&rread)) )
|
||||
return recvfrom ( so, buf, buflen, 0, (sockaddr*)from, fromlen );
|
||||
return -2; // timeout
|
||||
}
|
||||
//// suBind ////////////////////////////////////////////////
|
||||
// binds a UDP socket to an interface & port to receive
|
||||
// data on that port
|
||||
bool suBind ( SOCKET so, in_addr_t iInterfaceAddress, u_short iListenPort, bool bReuseAddr /* = false */ )
|
||||
{
|
||||
SockAddrIn sinInterface ( iInterfaceAddress, iListenPort );
|
||||
if ( bReuseAddr )
|
||||
{
|
||||
int optval = -1; // true
|
||||
if ( SOCKET_ERROR == setsockopt ( so, SOL_SOCKET, SO_REUSEADDR, (const char*)&optval, sizeof(optval) ) )
|
||||
{
|
||||
#if defined(_DEBUG) && defined(WIN32)
|
||||
if ( WSANOTINITIALISED == WSAGetLastError() )
|
||||
MessageBox ( NULL, "You forgot to call suStartup()!", "SockUtils", MB_OK|MB_ICONEXCLAMATION );
|
||||
#endif
|
||||
return false;
|
||||
}
|
||||
}
|
||||
if ( SOCKET_ERROR == bind(so, sinInterface, sizeof(sinInterface)) )
|
||||
{
|
||||
int err = SUERRNO;
|
||||
if ( err != EADDRINUSE )
|
||||
return false;
|
||||
#if defined(_DEBUG) && defined(WIN32)
|
||||
if ( WSANOTINITIALISED == WSAGetLastError() )
|
||||
MessageBox ( NULL, "You forgot to call suStartup()!", "SockUtils", MB_OK|MB_ICONEXCLAMATION );
|
||||
#endif
|
||||
}
|
||||
return true;
|
||||
}
|
||||
//// suBind ////////////////////////////////////////////////
|
||||
// binds a UDP socket to an interface & port to receive
|
||||
// data on that port
|
||||
bool suBind ( SOCKET so, const char* szInterfaceAddress, u_short iListenPort, bool bReuseAddr /* = false */ )
|
||||
{
|
||||
in_addr_t iInterfaceAddr = inet_addr(szInterfaceAddress);
|
||||
if ( iInterfaceAddr == INADDR_NONE )
|
||||
return false;
|
||||
return suBind ( so, iInterfaceAddr, iListenPort, bReuseAddr );
|
||||
}
|
||||
//// suEnableBroadcast ////////////////////////////////////////////////
|
||||
// in order to send broadcast messages on a UDP socket, this function
|
||||
// must be called first
|
||||
bool suEnableBroadcast ( SOCKET so, bool bEnable /* = true */ )
|
||||
{
|
||||
int optval = bEnable ? -1 : 0;
|
||||
if ( SOCKET_ERROR == setsockopt ( so, SOL_SOCKET, SO_BROADCAST, (const char*)&optval, sizeof(optval) ) )
|
||||
return false;
|
||||
return true;
|
||||
}
|
||||
//// suErrDesc ////////////////////////////////////////////////
|
||||
// returns text description of error code
|
||||
const char* suErrDesc ( int err )
|
||||
{
|
||||
static char errbuf[256];
|
||||
#ifdef WIN32
|
||||
switch ( err )
|
||||
{
|
||||
#define X(E) case E: return #E;
|
||||
X(WSAEINTR) X(WSAEBADF)
|
||||
X(WSAEACCES) X(WSAEFAULT)
|
||||
X(WSAEINVAL) X(WSAEMFILE)
|
||||
X(WSAEWOULDBLOCK) X(WSAEINPROGRESS)
|
||||
X(WSAEALREADY) X(WSAENOTSOCK)
|
||||
X(WSAEDESTADDRREQ) X(WSAEMSGSIZE)
|
||||
X(WSAEPROTOTYPE) X(WSAENOPROTOOPT)
|
||||
X(WSAEPROTONOSUPPORT) X(WSAESOCKTNOSUPPORT)
|
||||
X(WSAEOPNOTSUPP) X(WSAEPFNOSUPPORT)
|
||||
X(WSAEAFNOSUPPORT) X(WSAEADDRINUSE)
|
||||
X(WSAEADDRNOTAVAIL) X(WSAENETDOWN)
|
||||
X(WSAENETUNREACH) X(WSAENETRESET)
|
||||
X(WSAECONNABORTED) X(WSAECONNRESET)
|
||||
X(WSAENOBUFS) X(WSAEISCONN)
|
||||
X(WSAENOTCONN) X(WSAESHUTDOWN)
|
||||
X(WSAETOOMANYREFS) X(WSAETIMEDOUT)
|
||||
X(WSAECONNREFUSED) X(WSAELOOP)
|
||||
X(WSAENAMETOOLONG) X(WSAEHOSTDOWN)
|
||||
X(WSAEHOSTUNREACH) X(WSAENOTEMPTY)
|
||||
X(WSAEPROCLIM) X(WSAEUSERS)
|
||||
X(WSAEDQUOT) X(WSAESTALE)
|
||||
X(WSAEREMOTE) X(WSASYSNOTREADY)
|
||||
X(WSAVERNOTSUPPORTED) X(WSANOTINITIALISED)
|
||||
X(WSAEDISCON) X(WSAENOMORE)
|
||||
X(WSAECANCELLED) X(WSAEINVALIDPROCTABLE)
|
||||
X(WSAEINVALIDPROVIDER) X(WSAEPROVIDERFAILEDINIT)
|
||||
X(WSASYSCALLFAILURE) X(WSASERVICE_NOT_FOUND)
|
||||
X(WSATYPE_NOT_FOUND) X(WSA_E_NO_MORE)
|
||||
X(WSA_E_CANCELLED) X(WSAEREFUSED)
|
||||
#undef X
|
||||
}
|
||||
snprintf ( errbuf, sizeof(errbuf), "Unknown socket error (%lu)", err );
|
||||
errbuf[sizeof(errbuf)-1] = '\0';
|
||||
return errbuf;
|
||||
#elif defined(UNIX)
|
||||
perror(errbuf);
|
||||
return errbuf;
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
}
|
||||
#if defined(UNICODE) || defined(_UNICODE)
|
||||
in_addr_t suLookupAddress ( const wchar_t* pcHost )
|
||||
{
|
||||
int len = wcslen(pcHost);
|
||||
char* p = new char[len+1];
|
||||
wcstombs ( p, pcHost, len );
|
||||
p[len] = 0;
|
||||
in_addr_t rc = suLookupAddress ( p );
|
||||
delete[] p;
|
||||
return rc;
|
||||
}
|
||||
bool suBroadcast ( SOCKET so, u_short port, const wchar_t* buf, int len /* = -1 */ )
|
||||
{
|
||||
char* p = new char[len+1];
|
||||
wcstombs ( p, buf, len );
|
||||
p[len] = 0;
|
||||
bool rc = suBroadcast ( so, port, p, len );
|
||||
delete[] p;
|
||||
return rc;
|
||||
}
|
||||
int suRecv ( SOCKET so, wchar_t* buf, int buflen, int timeout )
|
||||
{
|
||||
char* p = new char[buflen+1];
|
||||
int rc = suRecv ( so, p, buflen, timeout );
|
||||
p[buflen] = 0;
|
||||
mbstowcs ( buf, p, buflen );
|
||||
delete[] p;
|
||||
return rc;
|
||||
}
|
||||
int suRecvFrom ( SOCKET so, wchar_t* buf, int buflen, int timeout, sockaddr_in* from, int* fromlen )
|
||||
{
|
||||
char* p = new char[buflen+1];
|
||||
int rc = suRecvFrom ( so, p, buflen, timeout, from, fromlen );
|
||||
p[buflen] = 0;
|
||||
mbs2wcs ( buf, p, buflen );
|
||||
delete[] p;
|
||||
return rc;
|
||||
}
|
||||
bool suBind ( SOCKET so, const wchar_t* szInterfaceAddress, u_short iListenPort, bool bReuseAddr /* = false */ )
|
||||
{
|
||||
int len = wcslen(szInterfaceAddress);
|
||||
char* p = new char[len+1];
|
||||
wcstombs ( p, szInterfaceAddress, len );
|
||||
p[len] = 0;
|
||||
bool rc = suBind ( so, p, iListenPort, bReuseAddr );
|
||||
delete[] p;
|
||||
return rc;
|
||||
}
|
||||
#endif//UNICODE
|
||||
|
||||
suBufferedRecvSocket::suBufferedRecvSocket ( SOCKET so )
|
||||
: suSocket ( so ), _off(0), _len(0)
|
||||
{
|
||||
}
|
||||
|
||||
int suBufferedRecvSocket::recvUntil ( std::string& buf, char until, int timeout )
|
||||
{
|
||||
if ( !_len )
|
||||
_off = 0;
|
||||
else if ( _off > (sizeof(_buf)>>1) )
|
||||
{
|
||||
memmove ( _buf, &_buf[_off], _len );
|
||||
_off = 0;
|
||||
}
|
||||
char* poff = &_buf[_off];
|
||||
for ( ;; )
|
||||
{
|
||||
char* p = (char*)memchr ( poff, until, _len );
|
||||
if ( p /*&& p < &poff[_len]*/ )
|
||||
{
|
||||
int ret_len = p-poff+1;
|
||||
buf.resize ( ret_len );
|
||||
memmove ( &buf[0], poff, ret_len );
|
||||
_off += ret_len;
|
||||
_len -= ret_len;
|
||||
return ret_len;
|
||||
}
|
||||
int rc = suRecv ( *this, &poff[_len], sizeof(_buf)-_len-_off, timeout );
|
||||
if ( rc < 0 )
|
||||
{
|
||||
if ( _len )
|
||||
{
|
||||
rc = _len;
|
||||
buf.resize ( rc );
|
||||
memmove ( &buf[0], &_buf[_off], rc );
|
||||
_len = 0;
|
||||
}
|
||||
return rc;
|
||||
}
|
||||
_len += rc;
|
||||
}
|
||||
}
|
||||
|
||||
void suBufferedRecvSocket::recvPending()
|
||||
{
|
||||
if ( !_len )
|
||||
_off = 0;
|
||||
else if ( _off > (sizeof(_buf)>>1) )
|
||||
{
|
||||
memmove ( _buf, &_buf[_off], _len );
|
||||
_off = 0;
|
||||
}
|
||||
char* poff = &_buf[_off];
|
||||
while ( sizeof(_buf)-_len-_off )
|
||||
{
|
||||
int rc = suRecv ( *this, &poff[_len], sizeof(_buf)-_len-_off, 1 );
|
||||
if ( rc <= 0 )
|
||||
break;
|
||||
_len += rc;
|
||||
}
|
||||
}
|
||||
|
||||
bool suBufferedRecvSocket::recvInStr ( char c )
|
||||
{
|
||||
return NULL != memchr ( &_buf[_off], c, _len );
|
||||
}
|
||||
132
irc/ArchBlackmann/SockUtils.h
Normal file
132
irc/ArchBlackmann/SockUtils.h
Normal file
@@ -0,0 +1,132 @@
|
||||
// SockUtils.h - Declarations for the Winsock utility functions module.
|
||||
// (C) 2002-2004 Royce Mitchell III
|
||||
// This file is under the BSD & LGPL licenses
|
||||
|
||||
#ifndef __SOCKUTILS_H
|
||||
#define __SOCKUTILS_H
|
||||
|
||||
#include <string>
|
||||
#ifdef WIN32
|
||||
# include <winsock2.h>
|
||||
# define in_addr_t u_long
|
||||
# define SUERRNO WSAGetLastError()
|
||||
# define EADDRINUSE WSAEADDRINUSE
|
||||
# define ENOTSOCK WSAENOTSOCK
|
||||
# define socklen_t int
|
||||
#elif defined(UNIX)
|
||||
# include <sys/types.h>
|
||||
# include <sys/socket.h>
|
||||
# include <netinet/in.h>
|
||||
# include <unistd.h>
|
||||
# include <errno.h>
|
||||
# define closesocket(so) close(so)
|
||||
# define SOCKET int
|
||||
# define INVALID_SOCKET -1
|
||||
# define SOCKET_ERROR -1
|
||||
# define SUERRNO errno
|
||||
# ifdef MACOSX
|
||||
# define socklen_t int //Stupid mac
|
||||
# endif
|
||||
#else
|
||||
# error unrecognized target
|
||||
#endif
|
||||
|
||||
#include <assert.h>
|
||||
|
||||
extern bool suStartup();
|
||||
extern SOCKET suTcpSocket();
|
||||
extern SOCKET suUdpSocket();
|
||||
extern bool suShutdownConnection(SOCKET sd);
|
||||
extern in_addr_t suLookupAddress ( const char* pcHost );
|
||||
extern bool suConnect ( SOCKET so, in_addr_t iAddress, u_short iPort );
|
||||
extern bool suConnect ( SOCKET so, const char* szAddress, u_short iPort );
|
||||
extern SOCKET suEstablishConnection ( in_addr_t iAddress, u_short iPort, int type );
|
||||
extern SOCKET suEstablishConnection ( const char* szAddress, u_short iPort, int type );
|
||||
extern bool suBroadcast ( SOCKET so, u_short port, const char* buf, int len = -1 );
|
||||
extern int suRecv ( SOCKET so, char* buf, int buflen, int timeout );
|
||||
extern int suRecvFrom ( SOCKET so, char* buf, int buflen, int timeout, sockaddr_in* from, socklen_t* fromlen );
|
||||
extern bool suBind ( SOCKET so, in_addr_t iInterfaceAddress, u_short iListenPort, bool bReuseAddr = false );
|
||||
extern bool suBind ( SOCKET so, const char* szInterfaceAddress, u_short iListenPort, bool bReuseAddr = false );
|
||||
extern bool suEnableBroadcast ( SOCKET so, bool bEnable = true );
|
||||
extern const char* suErrDesc ( int err );
|
||||
|
||||
#if defined(UNICODE) || defined(_UNICODE)
|
||||
extern in_addr_t suLookupAddress ( const wchar_t* pcHost );
|
||||
extern bool suBroadcast ( SOCKET so, u_short port, const wchar_t* buf, int len = -1 );
|
||||
extern int suRecv ( SOCKET so, wchar_t* buf, int buflen, int timeout );
|
||||
extern int suRecvFrom ( SOCKET so, wchar_t* buf, int buflen, int timeout, sockaddr_in* from, int* fromlen );
|
||||
extern bool suBind ( SOCKET so, const wchar_t* szInterfaceAddress, u_short iListenPort, bool bReuseAddr = false );
|
||||
#endif//UNICODE
|
||||
|
||||
class suSocket
|
||||
{
|
||||
SOCKET _so;
|
||||
public:
|
||||
suSocket ( SOCKET so = INVALID_SOCKET ) : _so(so)
|
||||
{
|
||||
}
|
||||
const suSocket& operator = ( SOCKET so )
|
||||
{
|
||||
assert ( _so == INVALID_SOCKET ); // must Detach() or Close() existing socket first
|
||||
_so = so;
|
||||
return *this;
|
||||
}
|
||||
virtual ~suSocket()
|
||||
{
|
||||
Close();
|
||||
}
|
||||
void Close()
|
||||
{
|
||||
if ( _so != INVALID_SOCKET )
|
||||
{
|
||||
//suShutdownConnection ( _so ); // TODO - only valid on TCP sockets
|
||||
closesocket ( _so );
|
||||
_so = INVALID_SOCKET;
|
||||
}
|
||||
}
|
||||
operator SOCKET() const
|
||||
{
|
||||
return _so;
|
||||
}
|
||||
SOCKET Attach ( SOCKET so )
|
||||
{
|
||||
SOCKET old = Detach();
|
||||
_so = so;
|
||||
return old;
|
||||
}
|
||||
SOCKET Detach()
|
||||
{
|
||||
SOCKET so = _so;
|
||||
_so = INVALID_SOCKET;
|
||||
return so;
|
||||
}
|
||||
|
||||
private:
|
||||
// disable copy semantics
|
||||
suSocket ( const suSocket& );
|
||||
const suSocket& operator = ( const suSocket& );
|
||||
};
|
||||
|
||||
class suBufferedRecvSocket : public suSocket
|
||||
{
|
||||
char _buf[2048];
|
||||
int _off;
|
||||
int _len;
|
||||
public:
|
||||
suBufferedRecvSocket ( SOCKET so = INVALID_SOCKET );
|
||||
int recvUntil ( std::string& buf, char until, int timeout );
|
||||
void recvPending();
|
||||
bool recvInStr ( char c );
|
||||
};
|
||||
|
||||
class SockAddrIn : public sockaddr_in
|
||||
{
|
||||
public:
|
||||
SockAddrIn(); // creates broadcast address
|
||||
SockAddrIn ( const char* szAddr, u_short iPort );
|
||||
SockAddrIn ( in_addr_t iAddr, u_short iPort );
|
||||
operator sockaddr* () { return (sockaddr*)this; }
|
||||
operator sockaddr_in* () { return (sockaddr_in*)this; }
|
||||
};
|
||||
|
||||
#endif//__SOCKUTILS_H
|
||||
96
irc/ArchBlackmann/SplitJoin.cpp
Normal file
96
irc/ArchBlackmann/SplitJoin.cpp
Normal file
@@ -0,0 +1,96 @@
|
||||
// SplitJoin.cpp
|
||||
//
|
||||
// This code is copyright 2003-2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#ifdef _MSC_VER
|
||||
#pragma warning ( disable : 4786 ) // MSVC6 can't handle too-long template names
|
||||
#endif//_MSC_VER
|
||||
|
||||
//#include <sstream>
|
||||
|
||||
#include "SplitJoin.h"
|
||||
|
||||
#include <string.h>
|
||||
|
||||
using std::string;
|
||||
using std::vector;
|
||||
//using std::stringstream;
|
||||
|
||||
static const char* quotes = "\"\'";
|
||||
|
||||
bool Split ( vector<string>& vec, const char* csv, char sep, bool merge )
|
||||
{
|
||||
string scsv ( csv );
|
||||
char* col = &scsv[0];
|
||||
vec.resize ( 0 );
|
||||
for ( ;; )
|
||||
{
|
||||
char* p = col;
|
||||
while ( isspace(*p) && *p != sep )
|
||||
p++;
|
||||
char quote = 0;
|
||||
if ( strchr ( quotes, *p ) )
|
||||
quote = *p++;
|
||||
while ( *p && (*p != sep || quote) )
|
||||
{
|
||||
if ( *p++ == quote )
|
||||
break;
|
||||
}
|
||||
|
||||
while ( isspace(*p) && *p != sep )
|
||||
p++;
|
||||
|
||||
if ( *p && *p != sep )
|
||||
return false;
|
||||
|
||||
string scol ( col, p-col );
|
||||
|
||||
//quote = scol[0];
|
||||
if ( quote )
|
||||
{
|
||||
if ( scol[scol.size()-1] == quote )
|
||||
scol = string ( &scol[1], scol.size()-2 );
|
||||
}
|
||||
|
||||
if ( scol.length() || !merge )
|
||||
vec.push_back ( scol );
|
||||
|
||||
if ( !*p )
|
||||
break;
|
||||
|
||||
col = p + 1;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
bool Join ( string& csv, vector<string>& vec, char sep )
|
||||
{
|
||||
csv.resize(0);
|
||||
for ( int i = 0; i < vec.size(); i++ )
|
||||
{
|
||||
if ( i )
|
||||
csv += sep;
|
||||
string& s = vec[i];
|
||||
if ( strchr ( s.c_str(), sep ) )
|
||||
{
|
||||
if ( strchr ( s.c_str(), '\"' ) )
|
||||
{
|
||||
if ( strchr ( s.c_str(), '\'' ) )
|
||||
return false; // the sep, " and ' are all in the string, can't build valid output
|
||||
csv += '\'';
|
||||
csv += s;
|
||||
csv += '\'';
|
||||
}
|
||||
else
|
||||
{
|
||||
csv += '\"';
|
||||
csv += s;
|
||||
csv += '\"';
|
||||
}
|
||||
}
|
||||
else
|
||||
csv += s;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
32
irc/ArchBlackmann/SplitJoin.h
Normal file
32
irc/ArchBlackmann/SplitJoin.h
Normal file
@@ -0,0 +1,32 @@
|
||||
// SplitJoin.h
|
||||
//
|
||||
// This code is copyright 2003-2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#ifndef SPLITJOIN_H
|
||||
#define SPLITJOIN_H
|
||||
|
||||
#include <vector>
|
||||
#include <string>
|
||||
|
||||
bool Split (
|
||||
std::vector<std::string>& vec,
|
||||
const char* csv,
|
||||
char sep=',',
|
||||
bool merge=false );
|
||||
|
||||
bool Join (
|
||||
std::string& csv,
|
||||
std::vector<std::string>& vec,
|
||||
char sep=',' );
|
||||
|
||||
inline bool Split (
|
||||
std::vector<std::string>& vec,
|
||||
const std::string& csv,
|
||||
char sep=',',
|
||||
bool merge=false )
|
||||
{
|
||||
return Split ( vec, csv.c_str(), sep, merge );
|
||||
}
|
||||
|
||||
#endif//SPLIT_H
|
||||
240
irc/ArchBlackmann/ThreadPool.cpp
Normal file
240
irc/ArchBlackmann/ThreadPool.cpp
Normal file
@@ -0,0 +1,240 @@
|
||||
// ThreadPool.cpp
|
||||
// This file is (C) 2003-2004 Royce Mitchell III
|
||||
// and released under the LGPL & BSD licenses
|
||||
|
||||
#include <vector>
|
||||
using std::vector;
|
||||
#include "ThreadPool.h"
|
||||
#include "QueueT.h"
|
||||
#include "auto_vector.h"
|
||||
#include "verify.h"
|
||||
#include "ReliMT.h"
|
||||
|
||||
class PoolableThread : public ActiveObject
|
||||
{
|
||||
public:
|
||||
PoolableThread ( ThreadPoolImpl& );
|
||||
~PoolableThread()
|
||||
{
|
||||
Kill();
|
||||
}
|
||||
void InitThread();
|
||||
void Run();
|
||||
void FlushThread();
|
||||
|
||||
ThreadPoolImpl& _pool;
|
||||
};
|
||||
|
||||
class ThreadPoolLaunchData
|
||||
{
|
||||
public:
|
||||
ThreadPoolFunc* pFun;
|
||||
void* pArg;
|
||||
};
|
||||
|
||||
template <class T>
|
||||
class AtomicCounter : public Uncopyable
|
||||
{
|
||||
Mutex _m;
|
||||
T _t;
|
||||
public:
|
||||
AtomicCounter ( T init = 0 ) : _t(init)
|
||||
{
|
||||
}
|
||||
AtomicCounter ( const AtomicCounter<T>& t )
|
||||
{
|
||||
//Mutex::Lock l ( _m ); // don't need to lock since this is a ctor
|
||||
Mutex::Lock l2 ( t._m );
|
||||
_t = t._t;
|
||||
}
|
||||
const AtomicCounter<T>& operator = ( const AtomicCounter<T>& t )
|
||||
{
|
||||
Mutex::Lock l ( _m );
|
||||
Mutex::Lock l2 ( t._m );
|
||||
_t = t._t;
|
||||
return *this;
|
||||
}
|
||||
T operator ++ ()
|
||||
{
|
||||
Mutex::Lock l ( _m );
|
||||
T t = _t++;
|
||||
return t;
|
||||
}
|
||||
const AtomicCounter<T>& operator ++ ( int )
|
||||
{
|
||||
Mutex::Lock l ( _m );
|
||||
++_t;
|
||||
return *this;
|
||||
}
|
||||
T operator -- ()
|
||||
{
|
||||
Mutex::Lock l ( _m );
|
||||
T t = _t--;
|
||||
return t;
|
||||
}
|
||||
const AtomicCounter<T>& operator -- ( int )
|
||||
{
|
||||
Mutex::Lock l ( _m );
|
||||
--_t;
|
||||
return *this;
|
||||
}
|
||||
const AtomicCounter<T>& operator += ( T t )
|
||||
{
|
||||
Mutex::Lock l ( _m );
|
||||
return _t += t;
|
||||
return *this;
|
||||
}
|
||||
const AtomicCounter<T>& operator -= ( T t )
|
||||
{
|
||||
Mutex::Lock l ( _m );
|
||||
return _t -= t;
|
||||
return *this;
|
||||
}
|
||||
operator const T& () const
|
||||
{
|
||||
//Mutex::Lock l ( _m );
|
||||
return _t;
|
||||
}
|
||||
T operator !() const
|
||||
{
|
||||
//Mutex::Lock l ( _m );
|
||||
return !_t;
|
||||
}
|
||||
};
|
||||
|
||||
class ThreadPoolImpl : public Uncopyable
|
||||
{
|
||||
public:
|
||||
ThreadPoolImpl() : _isDying(false), _idleThreads(0)
|
||||
{
|
||||
}
|
||||
|
||||
~ThreadPoolImpl()
|
||||
{
|
||||
}
|
||||
|
||||
void Shutdown()
|
||||
{
|
||||
_isDying = true;
|
||||
while ( _idleThreads )
|
||||
{
|
||||
_threadWaitEvent.Release();
|
||||
_threadStartEvent.Wait(); // let thread actually get a grip
|
||||
}
|
||||
}
|
||||
|
||||
void Launch ( ThreadPoolFunc* pFun, void* pArg )
|
||||
{
|
||||
// this mutex is necessary to make sure we never have a conflict
|
||||
// between checking !_idleThreads and the call to _threadStartEvent.Wait()
|
||||
// basically if 2 threads call Launch() simultaneously, and there is only
|
||||
// 1 idle thread, it's possible that a new thread won't be created to
|
||||
// satisfy the 2nd request until an existing thread finishes.
|
||||
Mutex::Lock launchlock ( _launchMutex );
|
||||
|
||||
ASSERT ( pFun );
|
||||
ThreadPoolLaunchData* data;
|
||||
{
|
||||
Mutex::Lock lock ( _vectorMutex );
|
||||
if ( !_spareData.size() )
|
||||
_spareData.push_back ( new ThreadPoolLaunchData() );
|
||||
data = _spareData.pop_back().release();
|
||||
if ( !_idleThreads )
|
||||
_threads.push_back ( new PoolableThread(*this) );
|
||||
}
|
||||
|
||||
data->pFun = pFun;
|
||||
data->pArg = pArg;
|
||||
verify ( _pendingData.Add ( data ) );
|
||||
_threadWaitEvent.Release(); // tell a thread to do it's thing...
|
||||
_threadStartEvent.Wait(); // wait on a thread to pick up the request
|
||||
}
|
||||
|
||||
// functions for threads to call...
|
||||
ThreadPoolLaunchData* GetPendingData()
|
||||
{
|
||||
ThreadPoolLaunchData* data = NULL;
|
||||
++_idleThreads;
|
||||
_threadWaitEvent.Wait(); // waits until there's a request
|
||||
--_idleThreads;
|
||||
_threadStartEvent.Release(); // tell requester we got it
|
||||
if ( _isDying )
|
||||
return NULL;
|
||||
_pendingData.Get ( data );
|
||||
ASSERT ( data );
|
||||
return data;
|
||||
}
|
||||
|
||||
void RecycleData ( ThreadPoolLaunchData* data )
|
||||
{
|
||||
Mutex::Lock lock ( _vectorMutex );
|
||||
_spareData.push_back ( data );
|
||||
}
|
||||
|
||||
bool _isDying;
|
||||
Mutex _vectorMutex, _launchMutex;
|
||||
auto_vector<PoolableThread> _threads;
|
||||
auto_vector<ThreadPoolLaunchData> _spareData;
|
||||
CQueueT<ThreadPoolLaunchData*> _pendingData;
|
||||
Event _threadWaitEvent, _threadStartEvent;
|
||||
AtomicCounter<int> _idleThreads;
|
||||
};
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////////
|
||||
// ThreadPool
|
||||
|
||||
/*static*/ ThreadPool& ThreadPool::Instance()
|
||||
{
|
||||
static ThreadPool tp;
|
||||
return tp;
|
||||
}
|
||||
|
||||
ThreadPool::ThreadPool() : _pimpl ( new ThreadPoolImpl )
|
||||
{
|
||||
};
|
||||
|
||||
ThreadPool::~ThreadPool()
|
||||
{
|
||||
_pimpl->Shutdown();
|
||||
delete _pimpl;
|
||||
_pimpl = 0;
|
||||
}
|
||||
|
||||
void ThreadPool::Launch ( ThreadPoolFunc* pFun, void* pArg )
|
||||
{
|
||||
_pimpl->Launch ( pFun, pArg );
|
||||
}
|
||||
|
||||
int ThreadPool::IdleThreads()
|
||||
{
|
||||
return _pimpl->_idleThreads;
|
||||
}
|
||||
|
||||
///////////////////////////////////////////////////////////////////////////////
|
||||
// PoolableThread
|
||||
|
||||
PoolableThread::PoolableThread ( ThreadPoolImpl& pool ) : _pool(pool)
|
||||
{
|
||||
Start();
|
||||
}
|
||||
|
||||
void PoolableThread::InitThread()
|
||||
{
|
||||
}
|
||||
|
||||
void PoolableThread::Run()
|
||||
{
|
||||
ThreadPoolLaunchData* data;
|
||||
while ( !_isDying )
|
||||
{
|
||||
data = _pool.GetPendingData(); // enter wait state if none...
|
||||
if ( !data ) // NULL data means kill thread
|
||||
break;
|
||||
(*data->pFun) ( data->pArg ); // call the function
|
||||
_pool.RecycleData ( data );
|
||||
}
|
||||
}
|
||||
|
||||
void PoolableThread::FlushThread()
|
||||
{
|
||||
}
|
||||
28
irc/ArchBlackmann/ThreadPool.h
Normal file
28
irc/ArchBlackmann/ThreadPool.h
Normal file
@@ -0,0 +1,28 @@
|
||||
// ThreadPool.h
|
||||
// This file is (C) 2003-2004 Royce Mitchell III
|
||||
// and released under the LGPL & BSD licenses
|
||||
|
||||
#ifndef THREADPOOL_H
|
||||
#define THREADPOOL_H
|
||||
|
||||
#include "ReliMT.h"
|
||||
|
||||
typedef void THREADAPI ThreadPoolFunc ( void* );
|
||||
|
||||
class ThreadPoolImpl;
|
||||
|
||||
class ThreadPool : public Uncopyable
|
||||
{
|
||||
public:
|
||||
static ThreadPool& Instance();
|
||||
~ThreadPool();
|
||||
|
||||
void Launch ( ThreadPoolFunc* pFun, void* pArg );
|
||||
int IdleThreads();
|
||||
|
||||
private:
|
||||
ThreadPool();
|
||||
ThreadPoolImpl *_pimpl;
|
||||
};
|
||||
|
||||
#endif// THREADPOOL_H
|
||||
87
irc/ArchBlackmann/auto_ptr.h
Normal file
87
irc/ArchBlackmann/auto_ptr.h
Normal file
@@ -0,0 +1,87 @@
|
||||
// auto_ptr.h
|
||||
// This file is (C) 2002-2003 Royce Mitchell III
|
||||
// and released under the LGPL & BSD licenses
|
||||
|
||||
#ifndef AUTO_PTR_H
|
||||
#define AUTO_PTR_H
|
||||
|
||||
template<class T>
|
||||
class auto_ptr
|
||||
{
|
||||
public:
|
||||
typedef T element_type;
|
||||
|
||||
explicit auto_ptr(T *p = 0) : _p(p)
|
||||
{
|
||||
}
|
||||
|
||||
auto_ptr(auto_ptr<T>& rhs) : _p(rhs.release())
|
||||
{
|
||||
}
|
||||
|
||||
auto_ptr<T>& operator=(auto_ptr<T>& rhs)
|
||||
{
|
||||
if ( &rhs != this )
|
||||
{
|
||||
dispose();
|
||||
_p = rhs.release();
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
auto_ptr<T>& set ( auto_ptr<T>& rhs )
|
||||
{
|
||||
if ( &rhs != this )
|
||||
{
|
||||
dispose();
|
||||
_p = rhs.release();
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
~auto_ptr()
|
||||
{
|
||||
dispose();
|
||||
}
|
||||
|
||||
void dispose()
|
||||
{
|
||||
if ( _p )
|
||||
{
|
||||
delete _p;
|
||||
_p = 0;
|
||||
}
|
||||
}
|
||||
|
||||
T& operator[] ( int i )
|
||||
{
|
||||
return _p[i];
|
||||
}
|
||||
|
||||
T& operator*() const
|
||||
{
|
||||
return *_p;
|
||||
}
|
||||
|
||||
T* operator->() const
|
||||
{
|
||||
return _p;
|
||||
}
|
||||
|
||||
T* get() const
|
||||
{
|
||||
return _p;
|
||||
}
|
||||
|
||||
T* release()
|
||||
{
|
||||
T* p = _p;
|
||||
_p = 0;
|
||||
return p;
|
||||
}
|
||||
|
||||
private:
|
||||
T* _p;
|
||||
};
|
||||
|
||||
#endif//AUTO_PTR_H
|
||||
141
irc/ArchBlackmann/auto_vector.h
Normal file
141
irc/ArchBlackmann/auto_vector.h
Normal file
@@ -0,0 +1,141 @@
|
||||
// auto_vector.h
|
||||
// This file is (C) 2002-2004 Royce Mitchell III
|
||||
// and released under the LGPL & BSD licenses
|
||||
|
||||
#ifndef AUTO_VECTOR_H
|
||||
#define AUTO_VECTOR_H
|
||||
|
||||
#include <sys/types.h>
|
||||
#include "verify.h"
|
||||
#include "auto_ptr.h"
|
||||
|
||||
template<class T>
|
||||
class auto_vector
|
||||
{
|
||||
public:
|
||||
explicit auto_vector ( size_t capacity = 0 )
|
||||
: _arr(0), _capacity(0), _end(0)
|
||||
{
|
||||
if ( capacity != 0 )
|
||||
_arr = new auto_ptr<T>[capacity];
|
||||
_capacity = capacity;
|
||||
}
|
||||
|
||||
~auto_vector()
|
||||
{
|
||||
delete []_arr;
|
||||
}
|
||||
|
||||
size_t size() const
|
||||
{
|
||||
return _end;
|
||||
}
|
||||
|
||||
const auto_ptr<T>& operator [] ( size_t i ) const
|
||||
{
|
||||
ASSERT ( i < _end );
|
||||
return _arr[i];
|
||||
}
|
||||
|
||||
auto_ptr<T>& operator [] ( size_t i )
|
||||
{
|
||||
ASSERT ( i < _end );
|
||||
return _arr[i];
|
||||
}
|
||||
|
||||
void assign ( size_t i, auto_ptr<T>& p )
|
||||
{
|
||||
ASSERT ( i < _end );
|
||||
_arr[i] = p;
|
||||
}
|
||||
|
||||
void assign_direct ( size_t i, T * p )
|
||||
{
|
||||
ASSERT ( i < _end );
|
||||
reserve ( i + 1 );
|
||||
_arr[i].reset ( p );
|
||||
}
|
||||
|
||||
void push_back ( auto_ptr<T>& p )
|
||||
{
|
||||
reserve ( _end + 1 );
|
||||
_arr[_end++] = p;
|
||||
}
|
||||
|
||||
auto_ptr<T>& back()
|
||||
{
|
||||
ASSERT ( _end != 0 );
|
||||
return _arr[_end-1];
|
||||
}
|
||||
|
||||
void push_back ( T * p )
|
||||
{
|
||||
reserve ( _end + 1 );
|
||||
auto_ptr<T> tmp(p);
|
||||
_arr[_end++] = tmp;
|
||||
//GCC is pedantic, this is an error.
|
||||
//_arr[_end++] = auto_ptr<T>(p);
|
||||
}
|
||||
|
||||
auto_ptr<T> pop_back()
|
||||
{
|
||||
ASSERT ( _end != 0 );
|
||||
if ( !_end )
|
||||
{
|
||||
auto_ptr<T> tmp((T*)0);
|
||||
return tmp;
|
||||
//GCC, this is an error.
|
||||
//return auto_ptr<T>(NULL);
|
||||
}
|
||||
return _arr[--_end];
|
||||
}
|
||||
|
||||
void resize ( size_t newSize )
|
||||
{
|
||||
ASSERT ( newSize >= 0 );
|
||||
reserve ( newSize ); // make sure we have at least this much room
|
||||
_end = newSize;
|
||||
}
|
||||
|
||||
void reserve ( size_t reqCapacity )
|
||||
{
|
||||
if ( reqCapacity <= _capacity )
|
||||
return;
|
||||
size_t newCapacity = 2 * _capacity;
|
||||
if ( reqCapacity > newCapacity )
|
||||
newCapacity = reqCapacity;
|
||||
// allocate new array
|
||||
auto_ptr<T> * arrNew = new auto_ptr<T> [newCapacity];
|
||||
// transfer all entries
|
||||
for ( size_t i = 0; i < _capacity; ++i )
|
||||
arrNew[i] = _arr[i];
|
||||
_capacity = newCapacity;
|
||||
// free old memory
|
||||
delete[] _arr;
|
||||
// substitute new array for old array
|
||||
_arr = arrNew;
|
||||
}
|
||||
|
||||
void remove ( size_t off )
|
||||
{
|
||||
size_t last = _end-1;
|
||||
if ( off == last )
|
||||
resize ( last );
|
||||
else if ( off < last )
|
||||
{
|
||||
auto_ptr<T> tmp ( pop_back().release() );
|
||||
_arr[off] = tmp;
|
||||
}
|
||||
}
|
||||
|
||||
//typedef const_auto_iterator<T> const_iterator;
|
||||
//const_iterator begin () const { return _arr; }
|
||||
//const_iterator end () const { return _arr + _end; }
|
||||
|
||||
private:
|
||||
auto_ptr<T> *_arr;
|
||||
size_t _capacity;
|
||||
size_t _end;
|
||||
};
|
||||
|
||||
#endif//AUTO_VECTOR_H
|
||||
58
irc/ArchBlackmann/base64.cpp
Normal file
58
irc/ArchBlackmann/base64.cpp
Normal file
@@ -0,0 +1,58 @@
|
||||
// base64.cpp
|
||||
|
||||
#include "base64.h"
|
||||
|
||||
using std::string;
|
||||
|
||||
static const char* alfabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
||||
|
||||
string base64_encode ( const string& sInput )
|
||||
{
|
||||
unsigned char x=0, topbit=0;
|
||||
int v=0;
|
||||
string sOutput;
|
||||
do
|
||||
{
|
||||
if ( topbit < 6 )
|
||||
{
|
||||
x++;
|
||||
v <<= 8;
|
||||
if ( x <= sInput.length() ) v += sInput[x-1];
|
||||
topbit += 8;
|
||||
}
|
||||
topbit -= 6;
|
||||
if ( x > sInput.length() && !v )
|
||||
break;
|
||||
sOutput += alfabet[(v >> topbit) & 63];
|
||||
v &= (1 << topbit) - 1;
|
||||
} while ( x < sInput.length() || v );
|
||||
int eq = (8 - (sOutput.length() % 4)) % 4;
|
||||
while ( eq-- )
|
||||
sOutput += '=';
|
||||
return sOutput;
|
||||
}
|
||||
|
||||
string base64_decode ( const string& sInput )
|
||||
{
|
||||
unsigned char x=0, topbit=0;
|
||||
int v=0, inlen = sInput.length();
|
||||
string sOutput;
|
||||
while ( inlen && sInput[inlen-1] == '=' )
|
||||
inlen--;
|
||||
do
|
||||
{
|
||||
while ( topbit < 8 )
|
||||
{
|
||||
x++;
|
||||
v <<= 6;
|
||||
if ( x <= inlen ) v += (strchr(alfabet, sInput[x-1]) - alfabet);
|
||||
topbit += 6;
|
||||
}
|
||||
topbit -= 8;
|
||||
if ( x > inlen && !v )
|
||||
break;
|
||||
sOutput += (char)((v >> topbit) & 255);
|
||||
v &= ((1 << topbit) - 1);
|
||||
} while ( x <= inlen || v );
|
||||
return sOutput;
|
||||
}
|
||||
12
irc/ArchBlackmann/base64.h
Normal file
12
irc/ArchBlackmann/base64.h
Normal file
@@ -0,0 +1,12 @@
|
||||
// base64.h
|
||||
|
||||
#ifndef BASE64_H
|
||||
#define BASE64_H
|
||||
|
||||
#include <string>
|
||||
|
||||
std::string base64_encode ( const std::string& s );
|
||||
|
||||
std::string base64_decode ( const std::string& s );
|
||||
|
||||
#endif//BASE64_H
|
||||
15
irc/ArchBlackmann/chomp.cpp
Normal file
15
irc/ArchBlackmann/chomp.cpp
Normal file
@@ -0,0 +1,15 @@
|
||||
// chomp.cpp
|
||||
// This file is (C) 2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#include "chomp.h"
|
||||
|
||||
std::string chomp ( const std::string& s )
|
||||
{
|
||||
const char* p = &s[0];
|
||||
const char* p2 = &s[0] + s.size();
|
||||
while ( p2 > p && strchr("\r\n", p2[-1]) )
|
||||
p2--;
|
||||
return std::string ( p, p2-p );
|
||||
}
|
||||
|
||||
13
irc/ArchBlackmann/chomp.h
Normal file
13
irc/ArchBlackmann/chomp.h
Normal file
@@ -0,0 +1,13 @@
|
||||
// chomp.h
|
||||
// This file is (C) 2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#ifndef CHOMP_H
|
||||
#define CHOMP_H
|
||||
|
||||
#include <string>
|
||||
|
||||
std::string chomp ( const std::string& s );
|
||||
|
||||
#endif//TRIM_H
|
||||
|
||||
7
irc/ArchBlackmann/config.h
Normal file
7
irc/ArchBlackmann/config.h
Normal file
@@ -0,0 +1,7 @@
|
||||
|
||||
|
||||
#define SERVER "irc.freenode.net"
|
||||
#define BOTNAME "ArchBlackmann"
|
||||
#define CHANNEL "#ReactOS"
|
||||
#define MODE "+i"
|
||||
#define PASS "ilovebunnies"
|
||||
23
irc/ArchBlackmann/cram_md5.cpp
Normal file
23
irc/ArchBlackmann/cram_md5.cpp
Normal file
@@ -0,0 +1,23 @@
|
||||
// cram_md5.cpp
|
||||
// This file is (C) 2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#include "MD5.h"
|
||||
#include "cram_md5.h"
|
||||
#include "base64.h"
|
||||
|
||||
using std::string;
|
||||
|
||||
string cram_md5 ( const string& username, const string& password, const string& greeting )
|
||||
{
|
||||
string challenge = base64_decode ( greeting );
|
||||
|
||||
string hmac = HMAC_MD5 ( password, challenge );
|
||||
//printf ( "(cram_md5): hmac = %s\n", hmac.c_str() );
|
||||
string raw_response = username;
|
||||
raw_response += " ";
|
||||
raw_response += hmac;
|
||||
//printf ( "(cram_md5): raw_response = %s\n", raw_response.c_str() );
|
||||
|
||||
return base64_encode ( raw_response );
|
||||
}
|
||||
15
irc/ArchBlackmann/cram_md5.h
Normal file
15
irc/ArchBlackmann/cram_md5.h
Normal file
@@ -0,0 +1,15 @@
|
||||
// cram_md5.h
|
||||
// This file is (C) 2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#ifndef CRAM_MD5_H
|
||||
#define CRAM_MD5_H
|
||||
|
||||
#include <string>
|
||||
|
||||
std::string cram_md5 (
|
||||
const std::string& username,
|
||||
const std::string& password,
|
||||
const std::string& greeting );
|
||||
|
||||
#endif//CRAM_MD5_H
|
||||
27
irc/ArchBlackmann/curse.txt
Normal file
27
irc/ArchBlackmann/curse.txt
Normal file
@@ -0,0 +1,27 @@
|
||||
shit
|
||||
fuck
|
||||
pussy
|
||||
ass
|
||||
ass-
|
||||
-ass
|
||||
dumbass
|
||||
jackass
|
||||
fatass
|
||||
asshole
|
||||
smartass
|
||||
cunt
|
||||
fucker
|
||||
bitch
|
||||
dick
|
||||
penile
|
||||
stfu
|
||||
omfg
|
||||
lmao
|
||||
ass.
|
||||
-ass.
|
||||
semprini
|
||||
goat.cx
|
||||
ekush
|
||||
akshor
|
||||
poop
|
||||
guten morgen
|
||||
10
irc/ArchBlackmann/cursecop.txt
Normal file
10
irc/ArchBlackmann/cursecop.txt
Normal file
@@ -0,0 +1,10 @@
|
||||
You should have your mouth washed out with soap!
|
||||
This is a clean channel... please watch your language
|
||||
Please try to keep it clean
|
||||
Hey, there's children present ( I'm not even a year old yet! )
|
||||
Could you find a less-offensive way to express yourself, please?
|
||||
Such language :(
|
||||
Those aren't nice words to use
|
||||
Oh, my poor innocent ears :(
|
||||
Help! My mind is being corrupted!
|
||||
filthy mouths are not appreciated here
|
||||
15
irc/ArchBlackmann/dev.txt
Normal file
15
irc/ArchBlackmann/dev.txt
Normal file
@@ -0,0 +1,15 @@
|
||||
Royce3
|
||||
kjk_hyperion
|
||||
tamlin
|
||||
GvG
|
||||
filip2307
|
||||
hardon
|
||||
w3seek
|
||||
arty
|
||||
sedwards
|
||||
Exception
|
||||
blight_
|
||||
jimtabor
|
||||
mtempel
|
||||
Gge
|
||||
Alex_Ionescu
|
||||
580
irc/ArchBlackmann/func.txt
Normal file
580
irc/ArchBlackmann/func.txt
Normal file
@@ -0,0 +1,580 @@
|
||||
CcCanIWrite
|
||||
CcCopyRead
|
||||
CcCopyWrite
|
||||
CcDeferWrite
|
||||
CcFastCopyRead
|
||||
CcFastCopyWrite
|
||||
CcFlushCache
|
||||
CcGetDirtyPages
|
||||
CcGetFileObjectFromBcb
|
||||
CcGetFileObjectFromSectionPtrs
|
||||
CcGetFlushedValidData
|
||||
CcGetLsnForFileObject
|
||||
CcInitializeCacheMap
|
||||
CcIsThereDirtyData
|
||||
CcMapData
|
||||
CcMdlRead
|
||||
CcMdlReadComplete
|
||||
CcMdlWriteAbort
|
||||
CcMdlWriteComplete
|
||||
CcPinMappedData
|
||||
CcPinRead
|
||||
CcPrepareMdlWrite
|
||||
CcPreparePinWrite
|
||||
CcPurgeCacheSection
|
||||
CcRemapBcb
|
||||
CcRepinBcb
|
||||
CcScheduleReadAhead
|
||||
CcSetAdditionalCacheAttributes
|
||||
CcSetBcbOwnerPointer
|
||||
CcSetDirtyPageThreshold
|
||||
CcSetDirtyPinnedData
|
||||
CcSetFileSizes
|
||||
CcSetLogHandleForFile
|
||||
CcSetReadAheadGranularity
|
||||
CcUninitializeCacheMap
|
||||
CcUnpinData
|
||||
CcUnpinDataForThread
|
||||
CcUnpinRepinnedBcb
|
||||
CcWaitForCurrentLazyWriterActivity
|
||||
CcZeroData
|
||||
DbgLoadImageSymbols
|
||||
DbgQueryDebugFilterState
|
||||
DbgSetDebugFilterState
|
||||
EVENT_TYPE
|
||||
ExAcquireResourceExclusive
|
||||
ExAcquireResourceExclusiveLite
|
||||
ExAcquireResourceSharedLite
|
||||
ExAcquireSharedStarveExclusive
|
||||
ExAcquireSharedWaitForExclusive
|
||||
ExAllocateFromZone
|
||||
ExAllocatePool
|
||||
ExAllocatePoolWithQuota
|
||||
ExAllocatePoolWithQuotaTag
|
||||
ExAllocatePoolWithTag
|
||||
ExConvertExclusiveToSharedLite
|
||||
ExCreateCallback
|
||||
ExDeleteNPagedLookasideList
|
||||
ExDeletePagedLookasideList
|
||||
ExDeleteResource
|
||||
ExDeleteResourceLite
|
||||
ExDisableResourceBoostLite
|
||||
ExEnumHandleTable
|
||||
ExExtendZone
|
||||
ExFreePool
|
||||
ExGetCurrentProcessorCounts
|
||||
ExGetCurrentProcessorCpuUsage
|
||||
ExGetExclusiveWaiterCount
|
||||
ExGetPreviousMode
|
||||
ExGetSharedWaiterCount
|
||||
ExInitializeNPagedLookasideList
|
||||
ExInitializePagedLookasideList
|
||||
ExInitializeResource
|
||||
ExInitializeResourceLite
|
||||
ExInitializeZone
|
||||
ExInterlockedAddLargeInteger
|
||||
ExInterlockedAddUlong
|
||||
ExInterlockedDecrementLong
|
||||
ExInterlockedExchangeUlong
|
||||
ExInterlockedExtendZone
|
||||
ExInterlockedIncrementLong
|
||||
ExInterlockedInsertHeadList
|
||||
ExInterlockedInsertTailList
|
||||
ExInterlockedPopEntryList
|
||||
ExInterlockedPushEntryList
|
||||
ExInterlockedRemoveHeadList
|
||||
ExIsProcessorFeaturePresent
|
||||
ExIsResourceAcquiredExclusiveLite
|
||||
ExIsResourceAcquiredSharedLite
|
||||
ExLocalTimeToSystemTime
|
||||
ExNotifyCallback
|
||||
ExPostSystemEvent
|
||||
ExQueryPoolBlockSize
|
||||
ExQueueWorkItem
|
||||
ExRaiseAccessViolation
|
||||
ExRaiseDatatypeMisalignment
|
||||
ExRaiseException
|
||||
ExRaiseHardError
|
||||
ExRaiseStatus
|
||||
ExRegisterCallback
|
||||
ExReinitializeResourceLite
|
||||
ExReleaseResource
|
||||
ExReleaseResourceForThread
|
||||
ExReleaseResourceForThreadLite
|
||||
ExRosDumpPagedPoolByTag
|
||||
ExRosQueryPoolTag
|
||||
ExSetResourceOwnerPointer
|
||||
ExSetTimerResolution
|
||||
ExSystemExceptionFilter
|
||||
ExSystemTimeToLocalTime
|
||||
ExTryToAcquireResourceExclusiveLite
|
||||
ExUnregisterCallback
|
||||
ExUuidCreate
|
||||
ExVerifySuite
|
||||
FsRtlAcquireFileExclusive
|
||||
FsRtlAddMcbEntry
|
||||
FsRtlAddToTunnelCache
|
||||
FsRtlAllocateFileLock
|
||||
FsRtlAllocatePool
|
||||
FsRtlAllocatePoolWithQuota
|
||||
FsRtlAllocatePoolWithQuotaTag
|
||||
FsRtlAllocatePoolWithTag
|
||||
FsRtlAllocateResource
|
||||
FsRtlAreNamesEqual
|
||||
FsRtlBalanceReads
|
||||
FsRtlCheckLockForReadAccess
|
||||
FsRtlCheckLockForWriteAccess
|
||||
FsRtlCopyRead
|
||||
FsRtlCopyWrite
|
||||
FsRtlFastCheckLockForRead
|
||||
FsRtlFastCheckLockForWrite
|
||||
FsRtlFastUnlockAll
|
||||
FsRtlFastUnlockAllByKey
|
||||
FsRtlFastUnlockSingle
|
||||
FsRtlFindInTunnelCache
|
||||
FsRtlFreeFileLock
|
||||
FsRtlGetFileSize
|
||||
FsRtlGetNextFileLock
|
||||
FsRtlGetNextMcbEntry
|
||||
FsRtlIncrementCcFastReadNoWait
|
||||
FsRtlIncrementCcFastReadNotPossible
|
||||
FsRtlIncrementCcFastReadResourceMiss
|
||||
FsRtlIncrementCcFastReadWait
|
||||
FsRtlInitializeFileLock
|
||||
FsRtlInitializeMcb
|
||||
FsRtlInitializeTunnelCache
|
||||
FsRtlInsertPerFileObjectContext
|
||||
FsRtlInsertPerStreamContext
|
||||
FsRtlIsDbcsInExpression
|
||||
FsRtlIsFatDbcsLegal
|
||||
FsRtlIsHpfsDbcsLegal
|
||||
FsRtlIsNameInExpression
|
||||
FsRtlLookupLastLargeMcbEntryAndIndex
|
||||
FsRtlLookupLastMcbEntry
|
||||
FsRtlLookupMcbEntry
|
||||
FsRtlLookupPerFileObjectContext
|
||||
FsRtlLookupPerStreamContextInternal
|
||||
FsRtlMdlRead
|
||||
FsRtlMdlReadComplete
|
||||
FsRtlMdlReadCompleteDev
|
||||
FsRtlMdlReadDev
|
||||
FsRtlMdlWriteComplete
|
||||
FsRtlMdlWriteCompleteDev
|
||||
FsRtlNotifyChangeDirectory
|
||||
FsRtlNotifyCleanup
|
||||
FsRtlNotifyFilterChangeDirectory
|
||||
FsRtlNotifyFilterReportChange
|
||||
FsRtlNotifyFullChangeDirectory
|
||||
FsRtlNotifyFullReportChange
|
||||
FsRtlNotifyReportChange
|
||||
FsRtlNotifyUninitializeSync
|
||||
FsRtlNumberOfRunsInMcb
|
||||
FsRtlPostPagingFileStackOverflow
|
||||
FsRtlPostStackOverflow
|
||||
FsRtlPrepareMdlWrite
|
||||
FsRtlPrepareMdlWriteDev
|
||||
FsRtlPrivateLock
|
||||
FsRtlProcessFileLock
|
||||
FsRtlRegisterFileSystemFilterCallbacks
|
||||
FsRtlReleaseFile
|
||||
FsRtlRemoveMcbEntry
|
||||
FsRtlRemovePerFileObjectContext
|
||||
FsRtlRemovePerStreamContext
|
||||
FsRtlResetLargeMcb
|
||||
FsRtlSyncVolumes
|
||||
FsRtlTeardownPerStreamContexts
|
||||
FsRtlTruncateMcb
|
||||
FsRtlUninitializeFileLock
|
||||
FsRtlUninitializeMcb
|
||||
HalAdjustResourceList
|
||||
HalAllocateCommonBuffer
|
||||
HalAssignSlotResources
|
||||
HalCalibratePerformanceCounter
|
||||
HalFlushCommonBuffer
|
||||
HalFreeCommonBuffer
|
||||
HalGetAdapter
|
||||
HalGetBusData
|
||||
HalGetBusDataByOffset
|
||||
HalGetDmaAlignmentRequirement
|
||||
HalMakeBeep
|
||||
HalQueryDisplayParameters
|
||||
HalQueryRealTimeClock
|
||||
HalReadDmaCounter
|
||||
HalRequestIpi
|
||||
HalSetBusData
|
||||
HalSetBusDataByOffset
|
||||
HalSetDisplayParameters
|
||||
HalSetRealTimeClock
|
||||
HalStartNextProcessor
|
||||
IoAcquireCancelSpinLock
|
||||
IoAcquireRemoveLockEx
|
||||
IoAcquireVpbSpinLock
|
||||
IoAllocateAdapterChannel
|
||||
IoAllocateController
|
||||
IoAllocateDriverObjectExtension
|
||||
IoAllocateErrorLogEntry
|
||||
IoAllocateIrp
|
||||
IoAllocateMdl
|
||||
IoAllocateWorkItem
|
||||
IoAssignResources
|
||||
IoAttachDevice
|
||||
IoAttachDeviceByPointer
|
||||
IoAttachDeviceToDeviceStack
|
||||
IoAttachDeviceToDeviceStackSafe
|
||||
IoBuildAsynchronousFsdRequest
|
||||
IoBuildDeviceIoControlRequest
|
||||
IoBuildPartialMdl
|
||||
IoBuildSynchronousFsdRequest
|
||||
IoCallDriver
|
||||
IoCancelFileOpen
|
||||
IoCancelIrp
|
||||
IoCheckQuerySetFileInformation
|
||||
IoCheckQuerySetVolumeInformation
|
||||
IoCheckQuotaBufferValidity
|
||||
IoCheckShareAccess
|
||||
IoCompleteRequest
|
||||
IoConnectInterrupt
|
||||
IoCreateController
|
||||
IoCreateDevice
|
||||
IoCreateDisk
|
||||
IoCreateDriver
|
||||
IoCreateFile
|
||||
IoCreateFileSpecifyDeviceObjectHint
|
||||
IoCreateNotificationEvent
|
||||
IoCreateStreamFileObject
|
||||
IoCreateStreamFileObjectEx
|
||||
IoCreateStreamFileObjectLite
|
||||
IoCreateSymbolicLink
|
||||
IoCreateSynchronizationEvent
|
||||
IoCreateUnprotectedSymbolicLink
|
||||
IoDeleteController
|
||||
IoDeleteDevice
|
||||
IoDeleteDriver
|
||||
IoDeleteSymbolicLink
|
||||
IoDetachDevice
|
||||
IoDisconnectInterrupt
|
||||
IoEnqueueIrp
|
||||
IoEnumerateDeviceObjectList
|
||||
IoFlushAdapterBuffers
|
||||
IoForwardIrpSynchronously
|
||||
IoFreeAdapterChannel
|
||||
IoFreeController
|
||||
IoFreeErrorLogEntry
|
||||
IoFreeIrp
|
||||
IoFreeMapRegisters
|
||||
IoFreeMdl
|
||||
IoFreeWorkItem
|
||||
IoGetAttachedDevice
|
||||
IoGetAttachedDeviceReference
|
||||
IoGetBaseFileSystemDeviceObject
|
||||
IoGetBootDiskInformation
|
||||
IoGetConfigurationInformation
|
||||
IoGetCurrentProcess
|
||||
IoGetDeviceAttachmentBaseRef
|
||||
IoGetDeviceInterfaceAlias
|
||||
IoGetDeviceInterfaces
|
||||
IoGetDeviceObjectPointer
|
||||
IoGetDeviceProperty
|
||||
IoGetDeviceToVerify
|
||||
IoGetDiskDeviceObject
|
||||
IoGetDriverObjectExtension
|
||||
IoGetFileObjectGenericMapping
|
||||
IoGetInitialStack
|
||||
IoGetLowerDeviceObject
|
||||
IoGetRelatedDeviceObject
|
||||
IoGetRequestorProcess
|
||||
IoGetRequestorProcessId
|
||||
IoGetRequestorSessionId
|
||||
IoGetStackLimits
|
||||
IoGetTopLevelIrp
|
||||
IoInitializeIrp
|
||||
IoInitializeRemoveLockEx
|
||||
IoInitializeTimer
|
||||
IoInvalidateDeviceRelations
|
||||
IoInvalidateDeviceState
|
||||
IoIsFileOriginRemote
|
||||
IoIsOperationSynchronous
|
||||
IoIsSystemThread
|
||||
IoIsValidNameGraftingBuffer
|
||||
IoMakeAssociatedIrp
|
||||
IoMapTransfer
|
||||
IoOpenDeviceInstanceKey
|
||||
IoOpenDeviceInterfaceRegistryKey
|
||||
IoOpenDeviceRegistryKey
|
||||
IoPageRead
|
||||
IoPnPDeliverServicePowerNotification
|
||||
IoQueryDeviceDescription
|
||||
IoQueryDeviceEnumInfo
|
||||
IoQueryFileDosDeviceName
|
||||
IoQueryFileInformation
|
||||
IoQueryVolumeInformation
|
||||
IoQueueThreadIrp
|
||||
IoQueueWorkItem
|
||||
IoRaiseHardError
|
||||
IoRaiseInformationalHardError
|
||||
IoReadDiskSignature
|
||||
IoReadPartitionTableEx
|
||||
IoRegisterBootDriverReinitialization
|
||||
IoRegisterDeviceInterface
|
||||
IoRegisterDriverReinitialization
|
||||
IoRegisterFileSystem
|
||||
IoRegisterFsRegistrationChange
|
||||
IoRegisterLastChanceShutdownNotification
|
||||
IoRegisterPlugPlayNotification
|
||||
IoRegisterShutdownNotification
|
||||
IoReleaseCancelSpinLock
|
||||
IoReleaseRemoveLockAndWaitEx
|
||||
IoReleaseRemoveLockEx
|
||||
IoReleaseVpbSpinLock
|
||||
IoRemoveShareAccess
|
||||
IoReportDetectedDevice
|
||||
IoReportHalResourceUsage
|
||||
IoReportResourceForDetection
|
||||
IoReportResourceUsage
|
||||
IoReportTargetDeviceChange
|
||||
IoReportTargetDeviceChangeAsynchronous
|
||||
IoRequestDeviceEject
|
||||
IoReuseIrp
|
||||
IoSetCompletionRoutineEx
|
||||
IoSetDeviceInterfaceState
|
||||
IoSetDeviceToVerify
|
||||
IoSetFileOrigin
|
||||
IoSetHardErrorOrVerifyDevice
|
||||
IoSetInformation
|
||||
IoSetIoCompletion
|
||||
IoSetPartitionInformationEx
|
||||
IoSetShareAccess
|
||||
IoSetStartIoAttributes
|
||||
IoSetSystemPartition
|
||||
IoSetThreadHardErrorMode
|
||||
IoSetTopLevelIrp
|
||||
IoStartNextPacket
|
||||
IoStartNextPacketByKey
|
||||
IoStartPacket
|
||||
IoStartTimer
|
||||
IoStopTimer
|
||||
IoSynchronousInvalidateDeviceRelations
|
||||
IoSynchronousPageWrite
|
||||
IoUnregisterFileSystem
|
||||
IoUnregisterFsRegistrationChange
|
||||
IoUnregisterPlugPlayNotification
|
||||
IoUnregisterShutdownNotification
|
||||
IoUpdateShareAccess
|
||||
IoValidateDeviceIoControlAccess
|
||||
IoVerifyPartitionTable
|
||||
IoVerifyVolume
|
||||
IoVolumeDeviceToDosName
|
||||
IoWMIAllocateInstanceIds
|
||||
IoWMIDeviceObjectToInstanceName
|
||||
IoWMIExecuteMethod
|
||||
IoWMIHandleToInstanceName
|
||||
IoWMIOpenBlock
|
||||
IoWMIQueryAllData
|
||||
IoWMIQueryAllDataMultiple
|
||||
IoWMIQuerySingleInstance
|
||||
IoWMIQuerySingleInstanceMultiple
|
||||
IoWMIRegistrationControl
|
||||
IoWMISetNotificationCallback
|
||||
IoWMISetSingleInstance
|
||||
IoWMISetSingleItem
|
||||
IoWMISuggestInstanceName
|
||||
IoWMIWriteEvent
|
||||
IoWriteErrorLogEntry
|
||||
IoWritePartitionTableEx
|
||||
KPRIORITY
|
||||
KdPortGetByte
|
||||
KdPortPollByte
|
||||
KdPortPutByte
|
||||
Ke386QueryIoAccessMap
|
||||
Ke386SetIoAccessMap
|
||||
KeAcquireInterruptSpinLock
|
||||
KeAreApcsDisabled
|
||||
KeCapturePersistentThreadState
|
||||
KeDeregisterBugCheckReasonCallback
|
||||
KeFindConfigurationEntry
|
||||
KeFindConfigurationNextEntry
|
||||
KeFlushEntireTb
|
||||
KeFlushQueuedDpcs
|
||||
KeGetRecommendedSharedDataAlignment
|
||||
KeIsExecutingDpc
|
||||
KeQueryActiveProcessors
|
||||
KeQueryPerformanceCounter
|
||||
KeQueryPriorityThread
|
||||
KeQueryRuntimeThread
|
||||
KeQuerySystemTime
|
||||
KeQueryTickCount
|
||||
KeQueryTimeIncrement
|
||||
KeRaiseIrql
|
||||
KeRaiseIrqlToDpcLevel
|
||||
KeRaiseUserException
|
||||
KeReadStateEvent
|
||||
KeRegisterBugCheckCallback
|
||||
KeRegisterBugCheckReasonCallback
|
||||
KeReleaseInterruptSpinLock
|
||||
KeReleaseMutant
|
||||
KeReleaseMutex
|
||||
KeReleaseSemaphore
|
||||
KeReleaseSpinLock
|
||||
KeReleaseSpinLockFromDpcLevel
|
||||
KeReleaseSpinLockFromDpcLevel
|
||||
KeRemoveByKeyDeviceQueue
|
||||
KeRemoveByKeyDeviceQueueIfBusy
|
||||
KeRemoveDeviceQueue
|
||||
KeRemoveEntryDeviceQueue
|
||||
KeRemoveSystemServiceTable
|
||||
KeRestoreFloatingPointState
|
||||
KeRevertToUserAffinityThread
|
||||
KeRosDumpStackFrames
|
||||
KeRosGetStackFrames
|
||||
KeRosPrintAddress
|
||||
KeSaveFloatingPointState
|
||||
KeSetDmaIoCoherency
|
||||
KeSetEvent
|
||||
KeSetEventBoostPriority
|
||||
KeSetIdealProcessorThread
|
||||
KeSetKernelStackSwapEnable
|
||||
KeSetProfileIrql
|
||||
KeSetSystemAffinityThread
|
||||
KeSetTimeIncrement
|
||||
KeTerminateThread
|
||||
KeUserModeCallback
|
||||
KeWaitForMutexObject
|
||||
KeWaitForSingleObject
|
||||
KiCoprocessorError
|
||||
KiUnexpectedInterrupt
|
||||
LONG
|
||||
LdrFindResourceDirectory_U
|
||||
MmAddPhysicalMemory
|
||||
MmAddVerifierThunks
|
||||
MmAdjustWorkingSetSize
|
||||
MmAdvanceMdl
|
||||
MmAllocateContiguousMemory
|
||||
MmAllocateContiguousMemorySpecifyCache
|
||||
MmAllocateMappingAddress
|
||||
MmAllocateNonCachedMemory
|
||||
MmBuildMdlForNonPagedPool
|
||||
MmCanFileBeTruncated
|
||||
MmCreateMdl
|
||||
MmCreateSection
|
||||
MmDbgTranslatePhysicalAddress
|
||||
MmDisableModifiedWriteOfSection
|
||||
MmFlushImageSection
|
||||
MmForceSectionClosed
|
||||
MmFreeContiguousMemory
|
||||
MmFreeMappingAddress
|
||||
MmFreeNonCachedMemory
|
||||
MmGetPhysicalAddress
|
||||
MmGetPhysicalMemoryRanges
|
||||
MmGetSystemRoutineAddress
|
||||
MmGetVirtualForPhysical
|
||||
MmGrowKernelStack
|
||||
MmIsAddressValid
|
||||
MmIsDriverVerifying
|
||||
MmIsNonPagedSystemAddressValid
|
||||
MmIsRecursiveIoFault
|
||||
MmIsThisAnNtAsSystem
|
||||
MmIsVerifierEnabled
|
||||
MmLockPagableDataSection
|
||||
MmLockPagableImageSection
|
||||
MmLockPagableSectionByHandle
|
||||
MmMapIoSpace
|
||||
MmMapLockedPages
|
||||
MmMapLockedPagesWithReservedMapping
|
||||
MmMapMemoryDumpMdl
|
||||
MmMapUserAddressesToPage
|
||||
MmMapVideoDisplay
|
||||
MmMapViewInSessionSpace
|
||||
MmMapViewInSystemSpace
|
||||
MmMapViewOfSection
|
||||
MmMarkPhysicalMemoryAsBad
|
||||
MmMarkPhysicalMemoryAsGood
|
||||
MmPageEntireDriver
|
||||
MmPrefetchPages
|
||||
MmProbeAndLockPages
|
||||
MmProbeAndLockProcessPages
|
||||
MmProbeAndLockSelectedPages
|
||||
MmProtectMdlSystemAddress
|
||||
MmQuerySystemSize
|
||||
MmRemovePhysicalMemory
|
||||
MmResetDriverPaging
|
||||
MmSecureVirtualMemory
|
||||
MmSetAddressRangeModified
|
||||
MmSetBankedSection
|
||||
MmSizeOfMdl
|
||||
MmTrimAllSystemPagableMemory
|
||||
MmUnlockPagableImageSection
|
||||
MmUnlockPages
|
||||
MmUnmapIoSpace
|
||||
MmUnmapLockedPages
|
||||
MmUnmapReservedMapping
|
||||
MmUnmapVideoDisplay
|
||||
MmUnmapViewInSessionSpace
|
||||
MmUnmapViewInSystemSpace
|
||||
MmUnmapViewOfSection
|
||||
MmUnsecureVirtualMemory
|
||||
OUT
|
||||
ObCreateObject
|
||||
PEJOB
|
||||
PEPROCESS
|
||||
PKBUGCHECK_CALLBACK_RECORD
|
||||
PKDEVICE_QUEUE_ENTRY
|
||||
PKIRQL
|
||||
PULONG
|
||||
PVOID
|
||||
PW32_THREAD_CALLBACK
|
||||
PoCallDriver
|
||||
PoRegisterDeviceForIdleDetection
|
||||
PoRegisterSystemState
|
||||
PoRequestPowerIrp
|
||||
PoSetDeviceBusy
|
||||
PoSetPowerState
|
||||
PoSetSystemState
|
||||
PoStartNextPowerIrp
|
||||
PoUnregisterSystemState
|
||||
ProbeForRead
|
||||
ProbeForWrite
|
||||
PsAssignImpersonationToken
|
||||
PsCreateSystemProcess
|
||||
PsCreateSystemThread
|
||||
PsGetCurrentProcessId
|
||||
PsGetCurrentThreadId
|
||||
PsImpersonateClient
|
||||
PsReferenceImpersonationToken
|
||||
PsReferencePrimaryToken
|
||||
PsRevertThreadToSelf
|
||||
PsRevertToSelf
|
||||
PsTerminateSystemThread
|
||||
READ_PORT_BUFFER_UCHAR
|
||||
READ_PORT_BUFFER_ULONG
|
||||
READ_PORT_BUFFER_USHORT
|
||||
READ_PORT_UCHAR
|
||||
READ_PORT_ULONG
|
||||
READ_PORT_USHORT
|
||||
SeAssignSecurityEx
|
||||
SeAuditHardLinkCreation
|
||||
SeAuditingFileEvents
|
||||
SeAuditingFileEventsWithContext
|
||||
SeAuditingFileOrGlobalEvents
|
||||
SeAuditingHardLinkEvents
|
||||
SeAuditingHardLinkEventsWithContext
|
||||
SeCaptureSecurityDescriptor
|
||||
SeCaptureSubjectContext
|
||||
SeCloseObjectAuditAlarm
|
||||
SeCreateAccessState
|
||||
SeCreateClientSecurityFromSubjectContext
|
||||
SeFilterToken
|
||||
SeImpersonateClientEx
|
||||
SePrivilegeObjectAuditAlarm
|
||||
SeQueryInformationToken
|
||||
SeQuerySessionIdToken
|
||||
SeReleaseSecurityDescriptor
|
||||
SeSetSecurityDescriptorInfoEx
|
||||
SeTokenIsAdmin
|
||||
SeTokenIsRestricted
|
||||
SeTokenIsWriteRestricted
|
||||
WRITE_PORT_BUFFER_UCHAR
|
||||
WRITE_PORT_BUFFER_ULONG
|
||||
WRITE_PORT_BUFFER_USHORT
|
||||
WRITE_PORT_UCHAR
|
||||
WRITE_PORT_ULONG
|
||||
WRITE_PORT_USHORT
|
||||
10
irc/ArchBlackmann/grovel.txt
Normal file
10
irc/ArchBlackmann/grovel.txt
Normal file
@@ -0,0 +1,10 @@
|
||||
/me bows humbly and begs %s's forgiveness
|
||||
%s is soo cool... I hope to be like him some day
|
||||
/me hides in a corner and hopes %s doesn't beat him with the whipping noodle again
|
||||
/me prostrates at %s's feet and begs his majesty's forgiveness
|
||||
%s: please don't hurt me!
|
||||
I'm not worthy... I'm not worthy...
|
||||
/me sings %s's praises to the world!
|
||||
/me thinks %s is smarter than %dev%
|
||||
%s: oh please may I defrag your sock drawer?
|
||||
/me gives %s a cookie, hoping it will make up for breaking %func% the other day...
|
||||
1
irc/ArchBlackmann/idle.txt
Normal file
1
irc/ArchBlackmann/idle.txt
Normal file
@@ -0,0 +1 @@
|
||||
/me is bored
|
||||
9
irc/ArchBlackmann/irql.txt
Normal file
9
irc/ArchBlackmann/irql.txt
Normal file
@@ -0,0 +1,9 @@
|
||||
PASSIVE_LEVEL
|
||||
APC_LEVEL
|
||||
DISPATCH_LEVEL
|
||||
PROFILE_LEVEL
|
||||
CLOCK1_LEVEL
|
||||
IPI_LEVEL
|
||||
POWER_LEVEL
|
||||
HIGH_LEVEL
|
||||
SYNCH_LEVEL
|
||||
38
irc/ArchBlackmann/makefile
Normal file
38
irc/ArchBlackmann/makefile
Normal file
@@ -0,0 +1,38 @@
|
||||
TARGET := ArchBlackmann.exe
|
||||
|
||||
.PHONY: all
|
||||
|
||||
all: $(TARGET)
|
||||
|
||||
CPP=mingw32-g++
|
||||
CFLAGS := -DWIN32 -D_DEBUG -D_CONSOLE -D_MBCS
|
||||
LFLAGS :=
|
||||
LIBS := -lstdc++ -lws2_32
|
||||
|
||||
SRCS := ArchBlackmann.cpp \
|
||||
base64.cpp \
|
||||
chomp.cpp \
|
||||
cram_md5.cpp \
|
||||
File.cpp \
|
||||
IRCClient.cpp \
|
||||
MD5.cpp \
|
||||
panic.cpp \
|
||||
ReliMT.cpp \
|
||||
SockUtils.cpp \
|
||||
SplitJoin.cpp \
|
||||
ssprintf.cpp \
|
||||
ThreadPool.cpp \
|
||||
trim.cpp
|
||||
|
||||
OBJS := $(SRCS:.cpp=.o)
|
||||
|
||||
$(TARGET): $(OBJS)
|
||||
$(CPP) $(LFLAGS) -o $@ $(OBJS) $(LIBS)
|
||||
|
||||
.cpp.o: $<
|
||||
$(CPP) $(CFLAGS) -c $< -o $@
|
||||
|
||||
.PHONY: clean
|
||||
clean:
|
||||
-@del $(TARGET)
|
||||
-@del $(OBJS)
|
||||
13
irc/ArchBlackmann/module.txt
Normal file
13
irc/ArchBlackmann/module.txt
Normal file
@@ -0,0 +1,13 @@
|
||||
the kernel
|
||||
ntoskrnl
|
||||
win32k
|
||||
msafd
|
||||
ws2_32
|
||||
user32
|
||||
shell32
|
||||
the cache manager
|
||||
tdi
|
||||
the scheduler
|
||||
the thread queue
|
||||
the message queue
|
||||
atapi
|
||||
5
irc/ArchBlackmann/nogrovel.txt
Normal file
5
irc/ArchBlackmann/nogrovel.txt
Normal file
@@ -0,0 +1,5 @@
|
||||
/me slaps %s with a large trout
|
||||
recycle(%s)
|
||||
Did I hear something? Musta been a %s-fly... Where's that fly-swatter?
|
||||
%s: go away son, you bother me....
|
||||
/me beats %s with the whipping noodle
|
||||
34
irc/ArchBlackmann/panic.cpp
Normal file
34
irc/ArchBlackmann/panic.cpp
Normal file
@@ -0,0 +1,34 @@
|
||||
// panic.cpp
|
||||
// This file is (C) 2003-2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdarg.h>
|
||||
#ifdef WIN32
|
||||
#include <conio.h>
|
||||
#include <windows.h>
|
||||
#endif//WIN32
|
||||
#include "panic.h"
|
||||
|
||||
void panic ( const char* format, ... )
|
||||
{
|
||||
va_list arg;
|
||||
int done;
|
||||
|
||||
va_start(arg, format);
|
||||
#if defined(WIN32) && !defined(_CONSOLE)
|
||||
char buf[4096];
|
||||
_vsnprintf ( buf, sizeof(buf)-1, format, arg );
|
||||
MessageBox ( NULL, buf, "Panic!", MB_OK|MB_ICONEXCLAMATION );
|
||||
#else
|
||||
done = vprintf(format, arg);
|
||||
printf ( "\n" );
|
||||
#endif
|
||||
va_end(arg);
|
||||
#if defined(WIN32) && defined(_CONSOLE)
|
||||
printf ( "Press any key to exit\n" );
|
||||
(void)getch();
|
||||
#endif//WIN32 && _CONSOLE
|
||||
exit ( -1 );
|
||||
}
|
||||
18
irc/ArchBlackmann/panic.h
Normal file
18
irc/ArchBlackmann/panic.h
Normal file
@@ -0,0 +1,18 @@
|
||||
// panic.h
|
||||
// This file is (C) 2003-2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#ifndef PANIC_H
|
||||
#define PANIC_H
|
||||
|
||||
void panic ( const char* format, ... );
|
||||
|
||||
#define suAssert(expr) if ( !(expr) ) panic ( "%s(%lu): SOCKET ERROR %s\nExpression: %s\n", __FILE__, __LINE__, suErrDesc(SUERRNO), #expr )
|
||||
|
||||
#if defined(DEBUG) || defined(_DEBUG)
|
||||
# define suVerify(expr) suAssert(expr)
|
||||
#else
|
||||
# define suVerify(expr) expr
|
||||
#endif
|
||||
|
||||
#endif//PANIC_H
|
||||
11
irc/ArchBlackmann/period.txt
Normal file
11
irc/ArchBlackmann/period.txt
Normal file
@@ -0,0 +1,11 @@
|
||||
minute
|
||||
hour
|
||||
day
|
||||
week
|
||||
fortnight
|
||||
month
|
||||
year
|
||||
decade
|
||||
century
|
||||
millenium
|
||||
eon
|
||||
44
irc/ArchBlackmann/readme.txt
Normal file
44
irc/ArchBlackmann/readme.txt
Normal file
@@ -0,0 +1,44 @@
|
||||
This doc can be also found on the wiki.
|
||||
|
||||
ArchBlackman is a IRC-Chat bot of the #reactos irc channel. He has been coded by Royce3 and DrFred (mbosma) currently runs him.
|
||||
|
||||
|
||||
If some one use a swear word he'll tell him not to do so and you can also ask him something technical about reactos. :)
|
||||
|
||||
Besides this he also knows some commands. The systax for giving him commands "ArchBlackmann: !grovel". (don't forget to address him)
|
||||
|
||||
- !grovel - This is the only command that non ops can do (No Parameter)
|
||||
- !kiss <person>
|
||||
- !hug <person>
|
||||
- !give <someone> <something>
|
||||
- !say <something> - You can tell him to say something on the channel via PrivateMessage
|
||||
|
||||
|
||||
ArchBlackmann know what he should say from some text files. They can be found on the svn-dir. But can also edit them online if you are op using:
|
||||
|
||||
- !add <list> <item>
|
||||
- !remove <list> <item>
|
||||
|
||||
List that are used directly to create responses are:
|
||||
|
||||
- tech - here are the sentences ArchBlackmann says when he finds his name
|
||||
- curse - this are the curses he looks for
|
||||
- cursecop - this the responces to them
|
||||
- grovel - this is said when an op does the grovel command
|
||||
- nogrovel - this when someone else does it
|
||||
|
||||
The remaining lists are not used directly, but by the other lists.
|
||||
|
||||
They are:
|
||||
|
||||
- dev
|
||||
- func
|
||||
- irql
|
||||
- module
|
||||
- period
|
||||
- status
|
||||
- stru
|
||||
- type
|
||||
|
||||
And they are used like this:
|
||||
/me thinks %s is smarter than %dev%
|
||||
998
irc/ArchBlackmann/ssprintf.cpp
Normal file
998
irc/ArchBlackmann/ssprintf.cpp
Normal file
@@ -0,0 +1,998 @@
|
||||
// ssprintf.cpp
|
||||
|
||||
#include <malloc.h>
|
||||
#include <math.h>
|
||||
#include <float.h>
|
||||
#include <assert.h>
|
||||
#include "ssprintf.h"
|
||||
|
||||
#ifdef _MSC_VER
|
||||
#define alloca _alloca
|
||||
#endif//_MSC_VER
|
||||
|
||||
typedef __int64 LONGLONG;
|
||||
typedef unsigned __int64 ULONGLONG;
|
||||
|
||||
typedef struct {
|
||||
unsigned int mantissa:23;
|
||||
unsigned int exponent:8;
|
||||
unsigned int sign:1;
|
||||
} ieee_float_t;
|
||||
|
||||
typedef struct {
|
||||
unsigned int mantissal:32;
|
||||
unsigned int mantissah:20;
|
||||
unsigned int exponent:11;
|
||||
unsigned int sign:1;
|
||||
} ieee_double_t;
|
||||
|
||||
typedef struct {
|
||||
unsigned int mantissal:32;
|
||||
unsigned int mantissah:32;
|
||||
unsigned int exponent:15;
|
||||
unsigned int sign:1;
|
||||
unsigned int empty:16;
|
||||
} ieee_long_double_t;
|
||||
|
||||
std::string ssprintf ( const char* fmt, ... )
|
||||
{
|
||||
va_list arg;
|
||||
va_start(arg, fmt);
|
||||
std::string f = ssvprintf ( fmt, arg );
|
||||
va_end(arg);
|
||||
return f;
|
||||
}
|
||||
|
||||
#define ZEROPAD 1 /* pad with zero */
|
||||
#define SIGN 2 /* unsigned/signed long */
|
||||
#define PLUS 4 /* show plus */
|
||||
#define SPACE 8 /* space if plus */
|
||||
#define LEFT 16 /* left justified */
|
||||
#define SPECIAL 32 /* 0x */
|
||||
#define LARGE 64 /* use 'ABCDEF' instead of 'abcdef' */
|
||||
#define ZEROTRUNC 128 /* truncate zero 's */
|
||||
|
||||
|
||||
static int skip_atoi(const char **s)
|
||||
{
|
||||
int i=0;
|
||||
|
||||
while (isdigit(**s))
|
||||
i = i*10 + *((*s)++) - '0';
|
||||
return i;
|
||||
}
|
||||
|
||||
|
||||
static int do_div(LONGLONG *n,int base)
|
||||
{
|
||||
int __res = ((ULONGLONG) *n) % (unsigned) base;
|
||||
*n = ((ULONGLONG) *n) / (unsigned) base;
|
||||
return __res;
|
||||
}
|
||||
|
||||
|
||||
static bool number(std::string& f, LONGLONG num, int base, int size, int precision ,int type)
|
||||
{
|
||||
char c,sign,tmp[66];
|
||||
const char *digits="0123456789abcdefghijklmnopqrstuvwxyz";
|
||||
int i;
|
||||
|
||||
if (type & LARGE)
|
||||
digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";
|
||||
if (type & LEFT)
|
||||
type &= ~ZEROPAD;
|
||||
if (base < 2 || base > 36)
|
||||
return 0;
|
||||
c = (type & ZEROPAD) ? '0' : ' ';
|
||||
sign = 0;
|
||||
if (type & SIGN) {
|
||||
if (num < 0) {
|
||||
sign = '-';
|
||||
num = -num;
|
||||
size--;
|
||||
} else if (type & PLUS) {
|
||||
sign = '+';
|
||||
size--;
|
||||
} else if (type & SPACE) {
|
||||
sign = ' ';
|
||||
size--;
|
||||
}
|
||||
}
|
||||
if (type & SPECIAL) {
|
||||
if (base == 16)
|
||||
size -= 2;
|
||||
else if (base == 8)
|
||||
size--;
|
||||
}
|
||||
i = 0;
|
||||
if (num == 0)
|
||||
tmp[i++]='0';
|
||||
else while (num != 0)
|
||||
tmp[i++] = digits[do_div(&num,base)];
|
||||
if (i > precision)
|
||||
precision = i;
|
||||
size -= precision;
|
||||
if (!(type&(ZEROPAD+LEFT)))
|
||||
while(size-->0)
|
||||
f += ' ';
|
||||
if (sign)
|
||||
f += sign;
|
||||
if (type & SPECIAL)
|
||||
{
|
||||
if (base==8)
|
||||
f += '0';
|
||||
else if (base==16)
|
||||
{
|
||||
f += '0';
|
||||
f += digits[33];
|
||||
}
|
||||
}
|
||||
if (!(type & LEFT))
|
||||
{
|
||||
while (size-- > 0)
|
||||
f += c;
|
||||
}
|
||||
while (i < precision--)
|
||||
{
|
||||
f += '0';
|
||||
}
|
||||
while (i-- > 0)
|
||||
{
|
||||
f += tmp[i];
|
||||
}
|
||||
while (size-- > 0)
|
||||
{
|
||||
f += ' ';
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
static bool numberf(std::string& f, double __n, char exp_sign, int size, int precision, int type)
|
||||
{
|
||||
double exponent = 0.0;
|
||||
double e;
|
||||
long ie;
|
||||
|
||||
//int x;
|
||||
char *buf, *tmp;
|
||||
int i = 0;
|
||||
int j = 0;
|
||||
//int k = 0;
|
||||
|
||||
double frac, intr;
|
||||
double p;
|
||||
char sign;
|
||||
char c;
|
||||
char ro = 0;
|
||||
int result;
|
||||
|
||||
union
|
||||
{
|
||||
double* __n;
|
||||
ieee_double_t* n;
|
||||
} n;
|
||||
|
||||
n.__n = &__n;
|
||||
|
||||
if ( exp_sign == 'g' || exp_sign == 'G' || exp_sign == 'e' || exp_sign == 'E' ) {
|
||||
ie = ((unsigned int)n.n->exponent - (unsigned int)0x3ff);
|
||||
exponent = ie/3.321928;
|
||||
}
|
||||
|
||||
if ( exp_sign == 'g' || exp_sign == 'G' ) {
|
||||
type |= ZEROTRUNC;
|
||||
if ( exponent < -4 || fabs(exponent) >= precision )
|
||||
exp_sign -= 2; // g -> e and G -> E
|
||||
}
|
||||
|
||||
if ( exp_sign == 'e' || exp_sign == 'E' ) {
|
||||
frac = modf(exponent,&e);
|
||||
if ( frac > 0.5 )
|
||||
e++;
|
||||
else if ( frac < -0.5 )
|
||||
e--;
|
||||
|
||||
result = numberf(f,__n/pow(10.0L,e),'f',size-4, precision, type);
|
||||
if (result < 0)
|
||||
return false;
|
||||
f += exp_sign;
|
||||
size--;
|
||||
ie = (long)e;
|
||||
type = LEFT | PLUS;
|
||||
if ( ie < 0 )
|
||||
type |= SIGN;
|
||||
|
||||
result = number(f,ie, 10,2, 2,type );
|
||||
if (result < 0)
|
||||
return false;
|
||||
return true;
|
||||
}
|
||||
|
||||
if ( exp_sign == 'f' ) {
|
||||
buf = (char*)alloca(4096);
|
||||
if (type & LEFT) {
|
||||
type &= ~ZEROPAD;
|
||||
}
|
||||
|
||||
c = (type & ZEROPAD) ? '0' : ' ';
|
||||
sign = 0;
|
||||
if (type & SIGN) {
|
||||
if (__n < 0) {
|
||||
sign = '-';
|
||||
__n = fabs(__n);
|
||||
size--;
|
||||
} else if (type & PLUS) {
|
||||
sign = '+';
|
||||
size--;
|
||||
} else if (type & SPACE) {
|
||||
sign = ' ';
|
||||
size--;
|
||||
}
|
||||
}
|
||||
|
||||
frac = modf(__n,&intr);
|
||||
|
||||
// # flags forces a . and prevents trucation of trailing zero's
|
||||
|
||||
if ( precision > 0 ) {
|
||||
//frac = modfl(__n,&intr);
|
||||
i = precision-1;
|
||||
while ( i >= 0 ) {
|
||||
frac*=10.0L;
|
||||
frac = modf(frac, &p);
|
||||
buf[i] = (int)p + '0';
|
||||
i--;
|
||||
}
|
||||
i = precision;
|
||||
size -= precision;
|
||||
|
||||
ro = 0;
|
||||
if ( frac > 0.5 ) {
|
||||
ro = 1;
|
||||
}
|
||||
|
||||
if ( precision >= 1 || type & SPECIAL) {
|
||||
buf[i++] = '.';
|
||||
size--;
|
||||
}
|
||||
}
|
||||
|
||||
if ( intr == 0.0 ) {
|
||||
buf[i++] = '0';
|
||||
size--;
|
||||
}
|
||||
else {
|
||||
while ( intr > 0.0 ) {
|
||||
p = intr;
|
||||
intr/=10.0L;
|
||||
modf(intr, &intr);
|
||||
|
||||
p -= 10.0*intr;
|
||||
|
||||
buf[i++] = (int)p + '0';
|
||||
size--;
|
||||
}
|
||||
}
|
||||
|
||||
j = 0;
|
||||
while ( j < i && ro == 1) {
|
||||
if ( buf[j] >= '0' && buf[j] <= '8' ) {
|
||||
buf[j]++;
|
||||
ro = 0;
|
||||
}
|
||||
else if ( buf[j] == '9' ) {
|
||||
buf[j] = '0';
|
||||
}
|
||||
j++;
|
||||
}
|
||||
if ( ro == 1 )
|
||||
buf[i++] = '1';
|
||||
|
||||
buf[i] = 0;
|
||||
|
||||
size -= precision;
|
||||
if (!(type&(ZEROPAD+LEFT)))
|
||||
{
|
||||
while(size-->0)
|
||||
f += ' ';
|
||||
}
|
||||
if (sign)
|
||||
{
|
||||
f += sign;
|
||||
}
|
||||
|
||||
if (!(type&(ZEROPAD+LEFT)))
|
||||
while(size-->0)
|
||||
{
|
||||
f += ' ';
|
||||
}
|
||||
if (type & SPECIAL) {
|
||||
}
|
||||
|
||||
if (!(type & LEFT))
|
||||
while (size-- > 0)
|
||||
{
|
||||
f += c;
|
||||
}
|
||||
|
||||
tmp = buf;
|
||||
if ( type & ZEROTRUNC && ((type & SPECIAL) != SPECIAL) )
|
||||
{
|
||||
j = 0;
|
||||
while ( j < i && ( *tmp == '0' || *tmp == '.' ))
|
||||
{
|
||||
tmp++;
|
||||
i--;
|
||||
}
|
||||
}
|
||||
// else
|
||||
// while (i < precision--)
|
||||
// putc('0', f);
|
||||
while (i-- > 0)
|
||||
{
|
||||
f += tmp[i];
|
||||
}
|
||||
while (size-- > 0)
|
||||
{
|
||||
f += ' ';
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
static bool numberfl(std::string& f, long double __n, char exp_sign, int size, int precision, int type)
|
||||
{
|
||||
long double exponent = 0.0;
|
||||
long double e;
|
||||
long ie;
|
||||
|
||||
//int x;
|
||||
char *buf, *tmp;
|
||||
int i = 0;
|
||||
int j = 0;
|
||||
//int k = 0;
|
||||
|
||||
long double frac, intr;
|
||||
long double p;
|
||||
char sign;
|
||||
char c;
|
||||
char ro = 0;
|
||||
|
||||
int result;
|
||||
|
||||
union
|
||||
{
|
||||
long double* __n;
|
||||
ieee_long_double_t* n;
|
||||
} n;
|
||||
|
||||
n.__n = &__n;
|
||||
|
||||
if ( exp_sign == 'g' || exp_sign == 'G' || exp_sign == 'e' || exp_sign == 'E' ) {
|
||||
ie = ((unsigned int)n.n->exponent - (unsigned int)0x3fff);
|
||||
exponent = ie/3.321928;
|
||||
}
|
||||
|
||||
if ( exp_sign == 'g' || exp_sign == 'G' ) {
|
||||
type |= ZEROTRUNC;
|
||||
if ( exponent < -4 || fabs(exponent) >= precision )
|
||||
exp_sign -= 2; // g -> e and G -> E
|
||||
}
|
||||
|
||||
if ( exp_sign == 'e' || exp_sign == 'E' ) {
|
||||
frac = modfl(exponent,&e);
|
||||
if ( frac > 0.5 )
|
||||
e++;
|
||||
else if ( frac < -0.5 )
|
||||
e--;
|
||||
|
||||
result = numberf(f,__n/powl(10.0L,e),'f',size-4, precision, type);
|
||||
if (result < 0)
|
||||
return false;
|
||||
f += exp_sign;
|
||||
size--;
|
||||
ie = (long)e;
|
||||
type = LEFT | PLUS;
|
||||
if ( ie < 0 )
|
||||
type |= SIGN;
|
||||
|
||||
result = number(f,ie, 10,2, 2,type );
|
||||
if (result < 0)
|
||||
return false;
|
||||
return true;
|
||||
}
|
||||
|
||||
if ( exp_sign == 'f' )
|
||||
{
|
||||
|
||||
buf = (char*)alloca(4096);
|
||||
if (type & LEFT)
|
||||
{
|
||||
type &= ~ZEROPAD;
|
||||
}
|
||||
|
||||
c = (type & ZEROPAD) ? '0' : ' ';
|
||||
sign = 0;
|
||||
if (type & SIGN)
|
||||
{
|
||||
if (__n < 0)
|
||||
{
|
||||
sign = '-';
|
||||
__n = fabs(__n);
|
||||
size--;
|
||||
} else if (type & PLUS)
|
||||
{
|
||||
sign = '+';
|
||||
size--;
|
||||
} else if (type & SPACE)
|
||||
{
|
||||
sign = ' ';
|
||||
size--;
|
||||
}
|
||||
}
|
||||
|
||||
frac = modfl(__n,&intr);
|
||||
|
||||
// # flags forces a . and prevents trucation of trailing zero's
|
||||
if ( precision > 0 )
|
||||
{
|
||||
//frac = modfl(__n,&intr);
|
||||
|
||||
i = precision-1;
|
||||
while ( i >= 0 )
|
||||
{
|
||||
frac*=10.0L;
|
||||
frac = modfl((long double)frac, &p);
|
||||
buf[i] = (int)p + '0';
|
||||
i--;
|
||||
}
|
||||
i = precision;
|
||||
size -= precision;
|
||||
|
||||
ro = 0;
|
||||
if ( frac > 0.5 )
|
||||
{
|
||||
ro = 1;
|
||||
}
|
||||
|
||||
if ( precision >= 1 || type & SPECIAL)
|
||||
{
|
||||
buf[i++] = '.';
|
||||
size--;
|
||||
}
|
||||
}
|
||||
|
||||
if ( intr == 0.0 )
|
||||
{
|
||||
buf[i++] = '0';
|
||||
size--;
|
||||
}
|
||||
else
|
||||
{
|
||||
while ( intr > 0.0 )
|
||||
{
|
||||
p=intr;
|
||||
intr/=10.0L;
|
||||
modfl(intr, &intr);
|
||||
|
||||
p -= 10.0L*intr;
|
||||
|
||||
buf[i++] = (int)p + '0';
|
||||
size--;
|
||||
}
|
||||
}
|
||||
|
||||
j = 0;
|
||||
while ( j < i && ro == 1) {
|
||||
if ( buf[j] >= '0' && buf[j] <= '8' )
|
||||
{
|
||||
buf[j]++;
|
||||
ro = 0;
|
||||
}
|
||||
else if ( buf[j] == '9' )
|
||||
{
|
||||
buf[j] = '0';
|
||||
}
|
||||
j++;
|
||||
}
|
||||
if ( ro == 1 )
|
||||
buf[i++] = '1';
|
||||
|
||||
buf[i] = 0;
|
||||
|
||||
size -= precision;
|
||||
if (!(type&(ZEROPAD+LEFT)))
|
||||
{
|
||||
while(size-->0)
|
||||
f += ' ';
|
||||
}
|
||||
if (sign)
|
||||
{
|
||||
f += sign;
|
||||
}
|
||||
|
||||
if (!(type&(ZEROPAD+LEFT)))
|
||||
{
|
||||
while(size-->0)
|
||||
f += ' ';
|
||||
}
|
||||
if (type & SPECIAL) {
|
||||
}
|
||||
|
||||
if (!(type & LEFT))
|
||||
while (size-- > 0)
|
||||
{
|
||||
f += c;
|
||||
}
|
||||
tmp = buf;
|
||||
if ( type & ZEROTRUNC && ((type & SPECIAL) != SPECIAL) )
|
||||
{
|
||||
j = 0;
|
||||
while ( j < i && ( *tmp == '0' || *tmp == '.' ))
|
||||
{
|
||||
tmp++;
|
||||
i--;
|
||||
}
|
||||
}
|
||||
// else
|
||||
// while (i < precision--)
|
||||
// putc( '0', f);
|
||||
while (i-- > 0)
|
||||
{
|
||||
f += tmp[i];
|
||||
}
|
||||
while (size-- > 0)
|
||||
{
|
||||
f += ' ';
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
static int stringa(std::string& f, const char* s, int len, int field_width, int precision, int flags)
|
||||
{
|
||||
int i, done = 0;
|
||||
if (s == NULL)
|
||||
{
|
||||
s = "<NULL>";
|
||||
len = 6;
|
||||
}
|
||||
else
|
||||
{
|
||||
if (len == -1)
|
||||
{
|
||||
len = 0;
|
||||
while ((unsigned int)len < (unsigned int)precision && s[len])
|
||||
len++;
|
||||
}
|
||||
else
|
||||
{
|
||||
if ((unsigned int)len > (unsigned int)precision)
|
||||
len = precision;
|
||||
}
|
||||
}
|
||||
if (!(flags & LEFT))
|
||||
while (len < field_width--)
|
||||
{
|
||||
f += ' ';
|
||||
done++;
|
||||
}
|
||||
for (i = 0; i < len; ++i)
|
||||
{
|
||||
f += *s++;
|
||||
done++;
|
||||
}
|
||||
while (len < field_width--)
|
||||
{
|
||||
f += ' ';
|
||||
done++;
|
||||
}
|
||||
return done;
|
||||
}
|
||||
|
||||
static int stringw(std::string& f, const wchar_t* sw, int len, int field_width, int precision, int flags)
|
||||
{
|
||||
int i, done = 0;
|
||||
if (sw == NULL)
|
||||
{
|
||||
sw = L"<NULL>";
|
||||
len = 6;
|
||||
}
|
||||
else
|
||||
{
|
||||
if (len == -1)
|
||||
{
|
||||
len = 0;
|
||||
while ((unsigned int)len < (unsigned int)precision && sw[len])
|
||||
len++;
|
||||
}
|
||||
else
|
||||
{
|
||||
if ((unsigned int)len > (unsigned int)precision)
|
||||
len = precision;
|
||||
}
|
||||
}
|
||||
if (!(flags & LEFT))
|
||||
while (len < field_width--)
|
||||
{
|
||||
f += ' ';
|
||||
done++;
|
||||
}
|
||||
for (i = 0; i < len; ++i)
|
||||
{
|
||||
#define MY_MB_CUR_MAX 1
|
||||
char mb[MY_MB_CUR_MAX];
|
||||
int mbcount, j;
|
||||
mbcount = wctomb(mb, *sw++);
|
||||
if (mbcount <= 0)
|
||||
{
|
||||
break;
|
||||
}
|
||||
for (j = 0; j < mbcount; j++)
|
||||
{
|
||||
f += mb[j];
|
||||
done++;
|
||||
}
|
||||
}
|
||||
while (len < field_width--)
|
||||
{
|
||||
f += ' ';
|
||||
done++;
|
||||
}
|
||||
return done;
|
||||
}
|
||||
|
||||
#define _isnanl _isnan
|
||||
#define _finitel _finite
|
||||
|
||||
std::string ssvprintf ( const char *fmt, va_list args )
|
||||
{
|
||||
ULONGLONG num;
|
||||
int base;
|
||||
long double _ldouble;
|
||||
double _double;
|
||||
const char *s;
|
||||
const wchar_t* sw;
|
||||
int result;
|
||||
std::string f;
|
||||
|
||||
int flags; /* flags to number() */
|
||||
|
||||
int field_width; /* width of output field */
|
||||
int precision; /* min. # of digits for integers; max
|
||||
number of chars for from string */
|
||||
int qualifier = 0; /* 'h', 'l', 'L' or 'I64' for integer fields */
|
||||
|
||||
for (; *fmt ; ++fmt)
|
||||
{
|
||||
if (*fmt != '%')
|
||||
{
|
||||
f += *fmt;
|
||||
continue;
|
||||
}
|
||||
|
||||
/* process flags */
|
||||
flags = 0;
|
||||
repeat:
|
||||
++fmt; /* this also skips first '%' */
|
||||
switch (*fmt) {
|
||||
case '-': flags |= LEFT; goto repeat;
|
||||
case '+': flags |= PLUS; goto repeat;
|
||||
case ' ': flags |= SPACE; goto repeat;
|
||||
case '#': flags |= SPECIAL; goto repeat;
|
||||
case '0': flags |= ZEROPAD; goto repeat;
|
||||
}
|
||||
|
||||
/* get field width */
|
||||
field_width = -1;
|
||||
if (isdigit(*fmt))
|
||||
field_width = skip_atoi(&fmt);
|
||||
else if (*fmt == '*') {
|
||||
++fmt;
|
||||
/* it's the next argument */
|
||||
field_width = va_arg(args, int);
|
||||
if (field_width < 0) {
|
||||
field_width = -field_width;
|
||||
flags |= LEFT;
|
||||
}
|
||||
}
|
||||
|
||||
/* get the precision */
|
||||
precision = -1;
|
||||
if (*fmt == '.') {
|
||||
++fmt;
|
||||
if (isdigit(*fmt))
|
||||
precision = skip_atoi(&fmt);
|
||||
else if (*fmt == '*') {
|
||||
++fmt;
|
||||
/* it's the next argument */
|
||||
precision = va_arg(args, int);
|
||||
}
|
||||
if (precision < 0)
|
||||
precision = 0;
|
||||
}
|
||||
|
||||
/* get the conversion qualifier */
|
||||
qualifier = 0;
|
||||
// %Z can be just stand alone or as size_t qualifier
|
||||
if ( *fmt == 'Z' ) {
|
||||
qualifier = *fmt;
|
||||
switch ( *(fmt+1)) {
|
||||
case 'o':
|
||||
case 'b':
|
||||
case 'X':
|
||||
case 'x':
|
||||
case 'd':
|
||||
case 'i':
|
||||
case 'u':
|
||||
++fmt;
|
||||
break;
|
||||
default:
|
||||
break;
|
||||
}
|
||||
} else if (*fmt == 'h' || *fmt == 'l' || *fmt == 'L' || *fmt == 'w') {
|
||||
qualifier = *fmt;
|
||||
++fmt;
|
||||
} else if (*fmt == 'I' && *(fmt+1) == '6' && *(fmt+2) == '4') {
|
||||
qualifier = *fmt;
|
||||
fmt += 3;
|
||||
}
|
||||
|
||||
// go fine with ll instead of L
|
||||
if ( *fmt == 'l' ) {
|
||||
++fmt;
|
||||
qualifier = 'L';
|
||||
}
|
||||
|
||||
/* default base */
|
||||
base = 10;
|
||||
|
||||
switch (*fmt) {
|
||||
case 'c':
|
||||
if (!(flags & LEFT))
|
||||
while (--field_width > 0)
|
||||
{
|
||||
f += ' ';
|
||||
}
|
||||
if (qualifier == 'l' || qualifier == 'w')
|
||||
{
|
||||
f += (char)(unsigned char)(wchar_t) va_arg(args,int);
|
||||
}
|
||||
else
|
||||
{
|
||||
f += (char)(unsigned char) va_arg(args,int);
|
||||
}
|
||||
while (--field_width > 0)
|
||||
{
|
||||
f += ' ';
|
||||
}
|
||||
continue;
|
||||
|
||||
case 'C':
|
||||
if (!(flags & LEFT))
|
||||
while (--field_width > 0)
|
||||
{
|
||||
f += ' ';
|
||||
}
|
||||
if (qualifier == 'h')
|
||||
{
|
||||
f += (char)(unsigned char) va_arg(args,int);
|
||||
}
|
||||
else
|
||||
{
|
||||
f += (char)(unsigned char)(wchar_t) va_arg(args,int);
|
||||
}
|
||||
while (--field_width > 0)
|
||||
{
|
||||
f += ' ';
|
||||
}
|
||||
continue;
|
||||
|
||||
case 's':
|
||||
if (qualifier == 'l' || qualifier == 'w') {
|
||||
/* print unicode string */
|
||||
sw = (const wchar_t*)va_arg(args, wchar_t *);
|
||||
result = stringw(f, sw, -1, field_width, precision, flags);
|
||||
} else {
|
||||
/* print ascii string */
|
||||
s = va_arg(args, char *);
|
||||
result = stringa(f, s, -1, field_width, precision, flags);
|
||||
}
|
||||
if (result < 0)
|
||||
{
|
||||
assert(!"TODO FIXME handle error better");
|
||||
return f;
|
||||
}
|
||||
continue;
|
||||
|
||||
case 'S':
|
||||
if (qualifier == 'h') {
|
||||
/* print ascii string */
|
||||
s = va_arg(args, char *);
|
||||
result = stringa(f, s, -1, field_width, precision, flags);
|
||||
} else {
|
||||
/* print unicode string */
|
||||
sw = (const wchar_t*)va_arg(args, wchar_t *);
|
||||
result = stringw(f, sw, -1, field_width, precision, flags);
|
||||
}
|
||||
if (result < 0)
|
||||
{
|
||||
assert(!"TODO FIXME handle error better");
|
||||
return f;
|
||||
}
|
||||
continue;
|
||||
|
||||
/*case 'Z':
|
||||
if (qualifier == 'w') {
|
||||
// print counted unicode string
|
||||
PUNICODE_STRING pus = va_arg(args, PUNICODE_STRING);
|
||||
if ((pus == NULL) || (pus->Buffer == NULL)) {
|
||||
sw = NULL;
|
||||
len = -1;
|
||||
} else {
|
||||
sw = pus->Buffer;
|
||||
len = pus->Length / sizeof(WCHAR);
|
||||
}
|
||||
result = stringw(f, sw, len, field_width, precision, flags);
|
||||
} else {
|
||||
// print counted ascii string
|
||||
PANSI_STRING pas = va_arg(args, PANSI_STRING);
|
||||
if ((pas == NULL) || (pas->Buffer == NULL)) {
|
||||
s = NULL;
|
||||
len = -1;
|
||||
} else {
|
||||
s = pas->Buffer;
|
||||
len = pas->Length;
|
||||
}
|
||||
result = stringa(f, s, -1, field_width, precision, flags);
|
||||
}
|
||||
if (result < 0)
|
||||
return -1;
|
||||
continue;*/
|
||||
|
||||
case 'e':
|
||||
case 'E':
|
||||
case 'f':
|
||||
case 'g':
|
||||
case 'G':
|
||||
if (qualifier == 'l' || qualifier == 'L' ) {
|
||||
_ldouble = va_arg(args, long double);
|
||||
|
||||
if ( _isnanl(_ldouble) )
|
||||
{
|
||||
f += "Nan";
|
||||
}
|
||||
else if ( !_finitel(_ldouble) )
|
||||
{
|
||||
if ( _ldouble < 0 )
|
||||
f += "-Inf";
|
||||
else
|
||||
f += "+Inf";
|
||||
} else {
|
||||
if ( precision == -1 )
|
||||
precision = 6;
|
||||
result = numberfl(f,_ldouble,*fmt,field_width,precision,flags);
|
||||
if (result < 0)
|
||||
{
|
||||
assert(!"TODO FIXME handle error better");
|
||||
return f;
|
||||
}
|
||||
}
|
||||
} else {
|
||||
_double = (double)va_arg(args, double);
|
||||
|
||||
if ( _isnan(_double) )
|
||||
{
|
||||
f += "Nan";
|
||||
}
|
||||
else if ( !_finite(_double) )
|
||||
{
|
||||
if ( _double < 0 )
|
||||
f += "-Inf";
|
||||
else
|
||||
f += "+Inf";
|
||||
}
|
||||
else
|
||||
{
|
||||
if ( precision == -1 )
|
||||
precision = 6;
|
||||
result = numberf(f,_double,*fmt,field_width,precision,flags);
|
||||
if (result < 0)
|
||||
{
|
||||
assert(!"TODO FIXME handle error better");
|
||||
return f;
|
||||
}
|
||||
}
|
||||
}
|
||||
continue;
|
||||
|
||||
case 'p':
|
||||
if (field_width == -1) {
|
||||
field_width = 2*sizeof(void *);
|
||||
flags |= ZEROPAD;
|
||||
}
|
||||
result = number(f,
|
||||
(unsigned long) va_arg(args, void *), 16,
|
||||
field_width, precision, flags);
|
||||
if (result < 0)
|
||||
{
|
||||
assert(!"TODO FIXME handle error better");
|
||||
return f;
|
||||
}
|
||||
continue;
|
||||
|
||||
case 'n':
|
||||
if (qualifier == 'l') {
|
||||
long * ip = va_arg(args, long *);
|
||||
*ip = 0;
|
||||
} else {
|
||||
int * ip = va_arg(args, int *);
|
||||
*ip = 0;
|
||||
}
|
||||
continue;
|
||||
|
||||
/* integer number formats - set up the flags and "break" */
|
||||
case 'o':
|
||||
base = 8;
|
||||
break;
|
||||
|
||||
case 'b':
|
||||
base = 2;
|
||||
break;
|
||||
|
||||
case 'X':
|
||||
flags |= LARGE;
|
||||
case 'x':
|
||||
base = 16;
|
||||
break;
|
||||
|
||||
case 'd':
|
||||
case 'i':
|
||||
flags |= SIGN;
|
||||
case 'u':
|
||||
break;
|
||||
|
||||
default:
|
||||
if (*fmt != '%')
|
||||
{
|
||||
f += '%';
|
||||
}
|
||||
if (*fmt)
|
||||
{
|
||||
f += *fmt;
|
||||
}
|
||||
else
|
||||
--fmt;
|
||||
continue;
|
||||
}
|
||||
|
||||
if (qualifier == 'I')
|
||||
num = va_arg(args, ULONGLONG);
|
||||
else if (qualifier == 'l') {
|
||||
if (flags & SIGN)
|
||||
num = va_arg(args, long);
|
||||
else
|
||||
num = va_arg(args, unsigned long);
|
||||
}
|
||||
else if (qualifier == 'h') {
|
||||
if (flags & SIGN)
|
||||
num = va_arg(args, int);
|
||||
else
|
||||
num = va_arg(args, unsigned int);
|
||||
}
|
||||
else if (flags & SIGN)
|
||||
num = va_arg(args, int);
|
||||
else
|
||||
num = va_arg(args, unsigned int);
|
||||
result = number(f, num, base, field_width, precision, flags);
|
||||
if (result < 0)
|
||||
{
|
||||
assert(!"TODO FIXME handle error better");
|
||||
return f;
|
||||
}
|
||||
}
|
||||
//putc('\0',f);
|
||||
return f;
|
||||
}
|
||||
12
irc/ArchBlackmann/ssprintf.h
Normal file
12
irc/ArchBlackmann/ssprintf.h
Normal file
@@ -0,0 +1,12 @@
|
||||
// ssprintf.h
|
||||
|
||||
#ifndef SSPRINTF_H
|
||||
#define SSPRINTF_H
|
||||
|
||||
#include <string>
|
||||
#include <stdarg.h>
|
||||
|
||||
std::string ssprintf ( const char* fmt, ... );
|
||||
std::string ssvprintf ( const char* fmt, va_list args );
|
||||
|
||||
#endif//SSPRINTF_H
|
||||
654
irc/ArchBlackmann/status.txt
Normal file
654
irc/ArchBlackmann/status.txt
Normal file
@@ -0,0 +1,654 @@
|
||||
RPC_NT_ALREADY_LISTENING
|
||||
RPC_NT_ALREADY_REGISTERED
|
||||
RPC_NT_CALL_FAILED
|
||||
RPC_NT_CALL_FAILED_DNE
|
||||
RPC_NT_CANT_CREATE_ENDPOINT
|
||||
RPC_NT_INVALID_BINDING
|
||||
RPC_NT_INVALID_ENDPOINT_FORMAT
|
||||
RPC_NT_INVALID_NETWORK_OPTIONS
|
||||
RPC_NT_INVALID_NET_ADDR
|
||||
RPC_NT_INVALID_RPC_PROTSEQ
|
||||
RPC_NT_INVALID_STRING_BINDING
|
||||
RPC_NT_INVALID_STRING_UUID
|
||||
RPC_NT_INVALID_TIMEOUT
|
||||
RPC_NT_NOT_LISTENING
|
||||
RPC_NT_NO_BINDINGS
|
||||
RPC_NT_NO_CALL_ACTIVE
|
||||
RPC_NT_NO_ENDPOINT_FOUND
|
||||
RPC_NT_NO_PROTSEQS
|
||||
RPC_NT_NO_PROTSEQS_REGISTERED
|
||||
RPC_NT_OBJECT_NOT_FOUND
|
||||
RPC_NT_OUT_OF_RESOURCES
|
||||
RPC_NT_PROTOCOL_ERROR
|
||||
RPC_NT_PROTSEQ_NOT_SUPPORTED
|
||||
RPC_NT_SERVER_TOO_BUSY
|
||||
RPC_NT_SERVER_UNAVAILABLE
|
||||
RPC_NT_SS_IN_NULL_CONTEXT
|
||||
RPC_NT_TYPE_ALREADY_REGISTERED
|
||||
RPC_NT_UNKNOWN_IF
|
||||
RPC_NT_UNKNOWN_MGR_TYPE
|
||||
RPC_NT_WRONG_KIND_OF_BINDING
|
||||
STATUS_ABANDONED
|
||||
STATUS_ABANDONED_WAIT_0
|
||||
STATUS_ABANDONED_WAIT_63
|
||||
STATUS_ABIOS_INVALID_COMMAND
|
||||
STATUS_ABIOS_INVALID_LID
|
||||
STATUS_ABIOS_INVALID_SELECTOR
|
||||
STATUS_ABIOS_LID_ALREADY_OWNED
|
||||
STATUS_ABIOS_LID_NOT_EXIST
|
||||
STATUS_ABIOS_NOT_LID_OWNER
|
||||
STATUS_ABIOS_NOT_PRESENT
|
||||
STATUS_ABIOS_SELECTOR_NOT_AVAILABLE
|
||||
STATUS_ACCESS_DENIED
|
||||
STATUS_ACCESS_VIOLATION
|
||||
STATUS_ACCOUNT_DISABLED
|
||||
STATUS_ACCOUNT_EXPIRED
|
||||
STATUS_ACCOUNT_LOCKED_OUT
|
||||
STATUS_ACCOUNT_RESTRICTION
|
||||
STATUS_ADAPTER_HARDWARE_ERROR
|
||||
STATUS_ADDRESS_ALREADY_ASSOCIATED
|
||||
STATUS_ADDRESS_ALREADY_EXISTS
|
||||
STATUS_ADDRESS_CLOSED
|
||||
STATUS_ADDRESS_NOT_ASSOCIATED
|
||||
STATUS_AGENTS_EXHAUSTED
|
||||
STATUS_ALERTED
|
||||
STATUS_ALIAS_EXISTS
|
||||
STATUS_ALLOCATE_BUCKET
|
||||
STATUS_ALLOTTED_SPACE_EXCEEDED
|
||||
STATUS_ALREADY_COMMITTED
|
||||
STATUS_ALREADY_DISCONNECTED
|
||||
STATUS_ALREADY_WIN32
|
||||
STATUS_APP_INIT_FAILURE
|
||||
STATUS_ARBITRATION_UNHANDLED
|
||||
STATUS_ARRAY_BOUNDS_EXCEEDED
|
||||
STATUS_AUDIT_FAILED
|
||||
STATUS_BACKUP_CONTROLLER
|
||||
STATUS_BAD_COMPRESSION_BUFFER
|
||||
STATUS_BAD_CURRENT_DIRECTORY
|
||||
STATUS_BAD_DESCRIPTOR_FORMAT
|
||||
STATUS_BAD_DEVICE_TYPE
|
||||
STATUS_BAD_DLL_ENTRYPOINT
|
||||
STATUS_BAD_FUNCTION_TABLE
|
||||
STATUS_BAD_IMPERSONATION_LEVEL
|
||||
STATUS_BAD_INHERITANCE_ACL
|
||||
STATUS_BAD_INITIAL_PC
|
||||
STATUS_BAD_INITIAL_STACK
|
||||
STATUS_BAD_LOGON_SESSION_STATE
|
||||
STATUS_BAD_MASTER_BOOT_RECORD
|
||||
STATUS_BAD_NETWORK_NAME
|
||||
STATUS_BAD_NETWORK_PATH
|
||||
STATUS_BAD_REMOTE_ADAPTER
|
||||
STATUS_BAD_SERVICE_ENTRYPOINT
|
||||
STATUS_BAD_STACK
|
||||
STATUS_BAD_TOKEN_TYPE
|
||||
STATUS_BAD_VALIDATION_CLASS
|
||||
STATUS_BAD_WORKING_SET_LIMIT
|
||||
STATUS_BEGINNING_OF_MEDIA
|
||||
STATUS_BIOS_FAILED_TO_CONNECT_INTERRUPT
|
||||
STATUS_BREAKPOINT
|
||||
STATUS_BUFFER_OVERFLOW
|
||||
STATUS_BUFFER_TOO_SMALL
|
||||
STATUS_BUS_RESET
|
||||
STATUS_CANCELLED
|
||||
STATUS_CANNOT_DELETE
|
||||
STATUS_CANNOT_IMPERSONATE
|
||||
STATUS_CANNOT_LOAD_REGISTRY_FILE
|
||||
STATUS_CANT_ACCESS_DOMAIN_INFO
|
||||
STATUS_CANT_DISABLE_MANDATORY
|
||||
STATUS_CANT_OPEN_ANONYMOUS
|
||||
STATUS_CANT_TERMINATE_SELF
|
||||
STATUS_CANT_WAIT
|
||||
STATUS_CARDBUS_NOT_SUPPORTED
|
||||
STATUS_CHECKING_FILE_SYSTEM
|
||||
STATUS_CHILD_MUST_BE_VOLATILE
|
||||
STATUS_CLIENT_SERVER_PARAMETERS_INVALID
|
||||
STATUS_COMMITMENT_LIMIT
|
||||
STATUS_CONFLICTING_ADDRESSES
|
||||
STATUS_CONNECTION_ABORTED
|
||||
STATUS_CONNECTION_ACTIVE
|
||||
STATUS_CONNECTION_COUNT_LIMIT
|
||||
STATUS_CONNECTION_DISCONNECTED
|
||||
STATUS_CONNECTION_INVALID
|
||||
STATUS_CONNECTION_IN_USE
|
||||
STATUS_CONNECTION_REFUSED
|
||||
STATUS_CONNECTION_RESET
|
||||
STATUS_CONTROL_C_EXIT
|
||||
STATUS_CONVERT_TO_LARGE
|
||||
STATUS_COULD_NOT_INTERPRET
|
||||
STATUS_CRC_ERROR
|
||||
STATUS_CTL_FILE_NOT_SUPPORTED
|
||||
STATUS_DATATYPE_MISALIGNMENT
|
||||
STATUS_DATA_ERROR
|
||||
STATUS_DATA_LATE_ERROR
|
||||
STATUS_DATA_NOT_ACCEPTED
|
||||
STATUS_DATA_OVERRUN
|
||||
STATUS_DEBUG_ATTACH_FAILED
|
||||
STATUS_DELETE_PENDING
|
||||
STATUS_DEVICE_ALREADY_ATTACHED
|
||||
STATUS_DEVICE_BUSY
|
||||
STATUS_DEVICE_CONFIGURATION_ERROR
|
||||
STATUS_DEVICE_DATA_ERROR
|
||||
STATUS_DEVICE_DOES_NOT_EXIST
|
||||
STATUS_DEVICE_NOT_CONNECTED
|
||||
STATUS_DEVICE_NOT_PARTITIONED
|
||||
STATUS_DEVICE_NOT_READY
|
||||
STATUS_DEVICE_OFF_LINE
|
||||
STATUS_DEVICE_PAPER_EMPTY
|
||||
STATUS_DEVICE_POWERED_OFF
|
||||
STATUS_DEVICE_POWER_FAILURE
|
||||
STATUS_DEVICE_PROTOCOL_ERROR
|
||||
STATUS_DFS_EXIT_PATH_FOUND
|
||||
STATUS_DFS_UNAVAILABLE
|
||||
STATUS_DIRECTORY_NOT_EMPTY
|
||||
STATUS_DISK_CORRUPT_ERROR
|
||||
STATUS_DISK_FULL
|
||||
STATUS_DISK_OPERATION_FAILED
|
||||
STATUS_DISK_RECALIBRATE_FAILED
|
||||
STATUS_DISK_RESET_FAILED
|
||||
STATUS_DLL_INIT_FAILED
|
||||
STATUS_DLL_INIT_FAILED_LOGOFF
|
||||
STATUS_DLL_NOT_FOUND
|
||||
STATUS_DOMAIN_CONTROLLER_NOT_FOUND
|
||||
STATUS_DOMAIN_CTRLR_CONFIG_ERROR
|
||||
STATUS_DOMAIN_EXISTS
|
||||
STATUS_DOMAIN_LIMIT_EXCEEDED
|
||||
STATUS_DOMAIN_TRUST_INCONSISTENT
|
||||
STATUS_DRIVER_CANCEL_TIMEOUT
|
||||
STATUS_DRIVER_ENTRYPOINT_NOT_FOUND
|
||||
STATUS_DRIVER_INTERNAL_ERROR
|
||||
STATUS_DRIVER_ORDINAL_NOT_FOUND
|
||||
STATUS_DRIVER_UNABLE_TO_LOAD
|
||||
STATUS_DUPLICATE_NAME
|
||||
STATUS_DUPLICATE_OBJECTID
|
||||
STATUS_EAS_NOT_SUPPORTED
|
||||
STATUS_EA_CORRUPT_ERROR
|
||||
STATUS_EA_LIST_INCONSISTENT
|
||||
STATUS_EA_TOO_LARGE
|
||||
STATUS_END_OF_FILE
|
||||
STATUS_END_OF_MEDIA
|
||||
STATUS_ENTRYPOINT_NOT_FOUND
|
||||
STATUS_EOM_OVERFLOW
|
||||
STATUS_EVALUATION_EXPIRATION
|
||||
STATUS_EVENTLOG_CANT_START
|
||||
STATUS_EVENTLOG_FILE_CHANGED
|
||||
STATUS_EVENTLOG_FILE_CORRUPT
|
||||
STATUS_EVENT_DONE
|
||||
STATUS_EVENT_PENDING
|
||||
STATUS_EXTRANEOUS_INFORMATION
|
||||
STATUS_FAIL_CHECK
|
||||
STATUS_FATAL_APP_EXIT
|
||||
STATUS_FILEMARK_DETECTED
|
||||
STATUS_FILES_OPEN
|
||||
STATUS_FILE_CLOSED
|
||||
STATUS_FILE_CORRUPT_ERROR
|
||||
STATUS_FILE_DELETED
|
||||
STATUS_FILE_FORCED_CLOSED
|
||||
STATUS_FILE_INVALID
|
||||
STATUS_FILE_IS_A_DIRECTORY
|
||||
STATUS_FILE_IS_OFFLINE
|
||||
STATUS_FILE_LOCK_CONFLICT
|
||||
STATUS_FILE_RENAMED
|
||||
STATUS_FLOAT_DENORMAL_OPERAND
|
||||
STATUS_FLOAT_DIVIDE_BY_ZERO
|
||||
STATUS_FLOAT_INEXACT_RESULT
|
||||
STATUS_FLOAT_INVALID_OPERATION
|
||||
STATUS_FLOAT_OVERFLOW
|
||||
STATUS_FLOAT_STACK_CHECK
|
||||
STATUS_FLOAT_UNDERFLOW
|
||||
STATUS_FLOPPY_BAD_REGISTERS
|
||||
STATUS_FLOPPY_ID_MARK_NOT_FOUND
|
||||
STATUS_FLOPPY_UNKNOWN_ERROR
|
||||
STATUS_FLOPPY_VOLUME
|
||||
STATUS_FLOPPY_WRONG_CYLINDER
|
||||
STATUS_FOUND_OUT_OF_SCOPE
|
||||
STATUS_FREE_VM_NOT_AT_BASE
|
||||
STATUS_FS_DRIVER_REQUIRED
|
||||
STATUS_FT_MISSING_MEMBER
|
||||
STATUS_FT_ORPHANING
|
||||
STATUS_FT_READ_RECOVERING_FROM_BACKUP
|
||||
STATUS_FT_WRITE_RECOVERY
|
||||
STATUS_FULLSCREEN_MODE
|
||||
STATUS_GENERIC_NOT_MAPPED
|
||||
STATUS_GRACEFUL_DISCONNECT
|
||||
STATUS_GROUP_EXISTS
|
||||
STATUS_GUARD_PAGE_VIOLATION
|
||||
STATUS_GUIDS_EXHAUSTED
|
||||
STATUS_GUID_SUBSTITUTION_MADE
|
||||
STATUS_HANDLES_CLOSED
|
||||
STATUS_HANDLE_NOT_CLOSABLE
|
||||
STATUS_HOST_UNREACHABLE
|
||||
STATUS_ILLEGAL_CHARACTER
|
||||
STATUS_ILLEGAL_DLL_RELOCATION
|
||||
STATUS_ILLEGAL_FLOAT_CONTEXT
|
||||
STATUS_ILLEGAL_FUNCTION
|
||||
STATUS_ILLEGAL_INSTRUCTION
|
||||
STATUS_ILL_FORMED_PASSWORD
|
||||
STATUS_ILL_FORMED_SERVICE_ENTRY
|
||||
STATUS_IMAGE_ALREADY_LOADED
|
||||
STATUS_IMAGE_CHECKSUM_MISMATCH
|
||||
STATUS_IMAGE_MACHINE_TYPE_MISMATCH
|
||||
STATUS_IMAGE_MACHINE_TYPE_MISMATCH_EXE
|
||||
STATUS_IMAGE_MP_UP_MISMATCH
|
||||
STATUS_IMAGE_NOT_AT_BASE
|
||||
STATUS_INCOMPATIBLE_FILE_MAP
|
||||
STATUS_INFO_LENGTH_MISMATCH
|
||||
STATUS_INSTANCE_NOT_AVAILABLE
|
||||
STATUS_INSTRUCTION_MISALIGNMENT
|
||||
STATUS_INSUFFICIENT_LOGON_INFO
|
||||
STATUS_INSUFFICIENT_RESOURCES
|
||||
STATUS_INSUFF_SERVER_RESOURCES
|
||||
STATUS_INTEGER_DIVIDE_BY_ZERO
|
||||
STATUS_INTEGER_OVERFLOW
|
||||
STATUS_INTERNAL_DB_CORRUPTION
|
||||
STATUS_INTERNAL_DB_ERROR
|
||||
STATUS_INTERNAL_ERROR
|
||||
STATUS_INVALID_ACCOUNT_NAME
|
||||
STATUS_INVALID_ACL
|
||||
STATUS_INVALID_ADDRESS
|
||||
STATUS_INVALID_ADDRESS_COMPONENT
|
||||
STATUS_INVALID_ADDRESS_WILDCARD
|
||||
STATUS_INVALID_BLOCK_LENGTH
|
||||
STATUS_INVALID_BUFFER_SIZE
|
||||
STATUS_INVALID_CID
|
||||
STATUS_INVALID_COMPUTER_NAME
|
||||
STATUS_INVALID_CONNECTION
|
||||
STATUS_INVALID_DEVICE_REQUEST
|
||||
STATUS_INVALID_DEVICE_STATE
|
||||
STATUS_INVALID_DISPOSITION
|
||||
STATUS_INVALID_DOMAIN_ROLE
|
||||
STATUS_INVALID_DOMAIN_STATE
|
||||
STATUS_INVALID_EA_FLAG
|
||||
STATUS_INVALID_EA_NAME
|
||||
STATUS_INVALID_FILE_FOR_SECTION
|
||||
STATUS_INVALID_GROUP_ATTRIBUTES
|
||||
STATUS_INVALID_HANDLE
|
||||
STATUS_INVALID_HW_PROFILE
|
||||
STATUS_INVALID_ID_AUTHORITY
|
||||
STATUS_INVALID_IMAGE_FORMAT
|
||||
STATUS_INVALID_IMAGE_LE_FORMAT
|
||||
STATUS_INVALID_IMAGE_NE_FORMAT
|
||||
STATUS_INVALID_IMAGE_NOT_MZ
|
||||
STATUS_INVALID_IMAGE_PROTECT
|
||||
STATUS_INVALID_IMAGE_WIN_16
|
||||
STATUS_INVALID_INFO_CLASS
|
||||
STATUS_INVALID_LDT_DESCRIPTOR
|
||||
STATUS_INVALID_LDT_OFFSET
|
||||
STATUS_INVALID_LDT_SIZE
|
||||
STATUS_INVALID_LEVEL
|
||||
STATUS_INVALID_LOCK_SEQUENCE
|
||||
STATUS_INVALID_LOGON_HOURS
|
||||
STATUS_INVALID_LOGON_TYPE
|
||||
STATUS_INVALID_MEMBER
|
||||
STATUS_INVALID_NETWORK_RESPONSE
|
||||
STATUS_INVALID_OPLOCK_PROTOCOL
|
||||
STATUS_INVALID_OWNER
|
||||
STATUS_INVALID_PAGE_PROTECTION
|
||||
STATUS_INVALID_PARAMETER
|
||||
STATUS_INVALID_PARAMETER_1
|
||||
STATUS_INVALID_PARAMETER_10
|
||||
STATUS_INVALID_PARAMETER_11
|
||||
STATUS_INVALID_PARAMETER_12
|
||||
STATUS_INVALID_PARAMETER_2
|
||||
STATUS_INVALID_PARAMETER_3
|
||||
STATUS_INVALID_PARAMETER_4
|
||||
STATUS_INVALID_PARAMETER_5
|
||||
STATUS_INVALID_PARAMETER_6
|
||||
STATUS_INVALID_PARAMETER_7
|
||||
STATUS_INVALID_PARAMETER_8
|
||||
STATUS_INVALID_PARAMETER_9
|
||||
STATUS_INVALID_PARAMETER_MIX
|
||||
STATUS_INVALID_PIPE_STATE
|
||||
STATUS_INVALID_PLUGPLAY_DEVICE_PATH
|
||||
STATUS_INVALID_PORT_ATTRIBUTES
|
||||
STATUS_INVALID_PORT_HANDLE
|
||||
STATUS_INVALID_PRIMARY_GROUP
|
||||
STATUS_INVALID_QUOTA_LOWER
|
||||
STATUS_INVALID_READ_MODE
|
||||
STATUS_INVALID_SECURITY_DESCR
|
||||
STATUS_INVALID_SERVER_STATE
|
||||
STATUS_INVALID_SID
|
||||
STATUS_INVALID_SUB_AUTHORITY
|
||||
STATUS_INVALID_SYSTEM_SERVICE
|
||||
STATUS_INVALID_UNWIND_TARGET
|
||||
STATUS_INVALID_USER_BUFFER
|
||||
STATUS_INVALID_VARIANT
|
||||
STATUS_INVALID_VIEW_SIZE
|
||||
STATUS_INVALID_VLM_OPERATION
|
||||
STATUS_INVALID_VOLUME_LABEL
|
||||
STATUS_INVALID_WORKSTATION
|
||||
STATUS_IN_PAGE_ERROR
|
||||
STATUS_IO_DEVICE_ERROR
|
||||
STATUS_IO_PRIVILEGE_FAILED
|
||||
STATUS_IO_REPARSE_DATA_INVALID
|
||||
STATUS_IO_REPARSE_TAG_INVALID
|
||||
STATUS_IO_REPARSE_TAG_MISMATCH
|
||||
STATUS_IO_REPARSE_TAG_NOT_HANDLED
|
||||
STATUS_IO_TIMEOUT
|
||||
STATUS_IP_ADDRESS_CONFLICT1
|
||||
STATUS_IP_ADDRESS_CONFLICT2
|
||||
STATUS_KERNEL_APC
|
||||
STATUS_KEY_DELETED
|
||||
STATUS_KEY_HAS_CHILDREN
|
||||
STATUS_LAST_ADMIN
|
||||
STATUS_LICENSE_QUOTA_EXCEEDED
|
||||
STATUS_LICENSE_VIOLATION
|
||||
STATUS_LINK_FAILED
|
||||
STATUS_LINK_TIMEOUT
|
||||
STATUS_LM_CROSS_ENCRYPTION_REQUIRED
|
||||
STATUS_LOCAL_DISCONNECT
|
||||
STATUS_LOCAL_USER_SESSION_KEY
|
||||
STATUS_LOCK_NOT_GRANTED
|
||||
STATUS_LOGIN_TIME_RESTRICTION
|
||||
STATUS_LOGIN_WKSTA_RESTRICTION
|
||||
STATUS_LOGON_FAILURE
|
||||
STATUS_LOGON_NOT_GRANTED
|
||||
STATUS_LOGON_SERVER_CONFLICT
|
||||
STATUS_LOGON_SESSION_COLLISION
|
||||
STATUS_LOGON_SESSION_EXISTS
|
||||
STATUS_LOGON_TYPE_NOT_GRANTED
|
||||
STATUS_LOG_FILE_FULL
|
||||
STATUS_LOG_HARD_ERROR
|
||||
STATUS_LONGJUMP
|
||||
STATUS_LOST_WRITEBEHIND_DATA
|
||||
STATUS_LPC_REPLY_LOST
|
||||
STATUS_LUIDS_EXHAUSTED
|
||||
STATUS_MAPPED_ALIGNMENT
|
||||
STATUS_MAPPED_FILE_SIZE_ZERO
|
||||
STATUS_MARSHALL_OVERFLOW
|
||||
STATUS_MEDIA_CHANGED
|
||||
STATUS_MEDIA_CHECK
|
||||
STATUS_MEDIA_WRITE_PROTECTED
|
||||
STATUS_MEMBERS_PRIMARY_GROUP
|
||||
STATUS_MEMBER_IN_ALIAS
|
||||
STATUS_MEMBER_IN_GROUP
|
||||
STATUS_MEMBER_NOT_IN_ALIAS
|
||||
STATUS_MEMBER_NOT_IN_GROUP
|
||||
STATUS_MEMORY_NOT_ALLOCATED
|
||||
STATUS_MESSAGE_NOT_FOUND
|
||||
STATUS_MISSING_SYSTEMFILE
|
||||
STATUS_MORE_ENTRIES
|
||||
STATUS_MORE_PROCESSING_REQUIRED
|
||||
STATUS_MUTANT_LIMIT_EXCEEDED
|
||||
STATUS_MUTANT_NOT_OWNED
|
||||
STATUS_NAME_TOO_LONG
|
||||
STATUS_NETLOGON_NOT_STARTED
|
||||
STATUS_NETWORK_ACCESS_DENIED
|
||||
STATUS_NETWORK_BUSY
|
||||
STATUS_NETWORK_CREDENTIAL_CONFLICT
|
||||
STATUS_NETWORK_NAME_DELETED
|
||||
STATUS_NETWORK_UNREACHABLE
|
||||
STATUS_NET_WRITE_FAULT
|
||||
STATUS_NOLOGON_INTERDOMAIN_TRUST_ACCOUNT
|
||||
STATUS_NOLOGON_SERVER_TRUST_ACCOUNT
|
||||
STATUS_NOLOGON_WORKSTATION_TRUST_ACCOUNT
|
||||
STATUS_NONCONTINUABLE_EXCEPTION
|
||||
STATUS_NONEXISTENT_EA_ENTRY
|
||||
STATUS_NONEXISTENT_SECTOR
|
||||
STATUS_NONE_MAPPED
|
||||
STATUS_NOTIFY_CLEANUP
|
||||
STATUS_NOTIFY_ENUM_DIR
|
||||
STATUS_NOT_ALL_ASSIGNED
|
||||
STATUS_NOT_A_DIRECTORY
|
||||
STATUS_NOT_A_REPARSE_POINT
|
||||
STATUS_NOT_CLIENT_SESSION
|
||||
STATUS_NOT_COMMITTED
|
||||
STATUS_NOT_FOUND
|
||||
STATUS_NOT_IMPLEMENTED
|
||||
STATUS_NOT_LOCKED
|
||||
STATUS_NOT_LOGON_PROCESS
|
||||
STATUS_NOT_MAPPED_DATA
|
||||
STATUS_NOT_MAPPED_VIEW
|
||||
STATUS_NOT_REGISTRY_FILE
|
||||
STATUS_NOT_SAME_DEVICE
|
||||
STATUS_NOT_SERVER_SESSION
|
||||
STATUS_NOT_SUPPORTED
|
||||
STATUS_NOT_TINY_STREAM
|
||||
STATUS_NO_BROWSER_SERVERS_FOUND
|
||||
STATUS_NO_CALLBACK_ACTIVE
|
||||
STATUS_NO_DATA_DETECTED
|
||||
STATUS_NO_EAS_ON_FILE
|
||||
STATUS_NO_EVENT_PAIR
|
||||
STATUS_NO_GUID_TRANSLATION
|
||||
STATUS_NO_IMPERSONATION_TOKEN
|
||||
STATUS_NO_INHERITANCE
|
||||
STATUS_NO_LDT
|
||||
STATUS_NO_LOGON_SERVERS
|
||||
STATUS_NO_LOG_SPACE
|
||||
STATUS_NO_MATCH
|
||||
STATUS_NO_MEDIA
|
||||
STATUS_NO_MEDIA_IN_DEVICE
|
||||
STATUS_NO_MEMORY
|
||||
STATUS_NO_MORE_EAS
|
||||
STATUS_NO_MORE_ENTRIES
|
||||
STATUS_NO_MORE_FILES
|
||||
STATUS_NO_MORE_MATCHES
|
||||
STATUS_NO_PAGEFILE
|
||||
STATUS_NO_QUOTAS_NO_ACCOUNT
|
||||
STATUS_NO_SECURITY_ON_OBJECT
|
||||
STATUS_NO_SPOOL_SPACE
|
||||
STATUS_NO_SUCH_ALIAS
|
||||
STATUS_NO_SUCH_DEVICE
|
||||
STATUS_NO_SUCH_DOMAIN
|
||||
STATUS_NO_SUCH_FILE
|
||||
STATUS_NO_SUCH_GROUP
|
||||
STATUS_NO_SUCH_LOGON_SESSION
|
||||
STATUS_NO_SUCH_MEMBER
|
||||
STATUS_NO_SUCH_PACKAGE
|
||||
STATUS_NO_SUCH_PRIVILEGE
|
||||
STATUS_NO_SUCH_USER
|
||||
STATUS_NO_TOKEN
|
||||
STATUS_NO_TRUST_LSA_SECRET
|
||||
STATUS_NO_TRUST_SAM_ACCOUNT
|
||||
STATUS_NO_USER_SESSION_KEY
|
||||
STATUS_NO_YIELD_PERFORMED
|
||||
STATUS_NT_CROSS_ENCRYPTION_REQUIRED
|
||||
STATUS_NULL_LM_PASSWORD
|
||||
STATUS_OBJECTID_EXISTS
|
||||
STATUS_OBJECT_EXISTS
|
||||
STATUS_OBJECT_NAME_COLLISION
|
||||
STATUS_OBJECT_NAME_EXISTS
|
||||
STATUS_OBJECT_NAME_INVALID
|
||||
STATUS_OBJECT_NAME_NOT_FOUND
|
||||
STATUS_OBJECT_PATH_INVALID
|
||||
STATUS_OBJECT_PATH_NOT_FOUND
|
||||
STATUS_OBJECT_PATH_SYNTAX_BAD
|
||||
STATUS_OBJECT_TYPE_MISMATCH
|
||||
STATUS_OPEN_FAILED
|
||||
STATUS_OPLOCK_BREAK_IN_PROCESS
|
||||
STATUS_OPLOCK_NOT_GRANTED
|
||||
STATUS_ORDINAL_NOT_FOUND
|
||||
STATUS_PAGEFILE_CREATE_FAILED
|
||||
STATUS_PAGEFILE_QUOTA
|
||||
STATUS_PAGEFILE_QUOTA_EXCEEDED
|
||||
STATUS_PARITY_ERROR
|
||||
STATUS_PARTIAL_COPY
|
||||
STATUS_PARTITION_FAILURE
|
||||
STATUS_PASSWORD_EXPIRED
|
||||
STATUS_PASSWORD_MUST_CHANGE
|
||||
STATUS_PASSWORD_RESTRICTION
|
||||
STATUS_PATH_NOT_COVERED
|
||||
STATUS_PENDING
|
||||
STATUS_PIPE_BROKEN
|
||||
STATUS_PIPE_BUSY
|
||||
STATUS_PIPE_CLOSING
|
||||
STATUS_PIPE_CONNECTED
|
||||
STATUS_PIPE_DISCONNECTED
|
||||
STATUS_PIPE_EMPTY
|
||||
STATUS_PIPE_LISTENING
|
||||
STATUS_PIPE_NOT_AVAILABLE
|
||||
STATUS_PLUGPLAY_NO_DEVICE
|
||||
STATUS_PORT_ALREADY_SET
|
||||
STATUS_PORT_CONNECTION_REFUSED
|
||||
STATUS_PORT_DISCONNECTED
|
||||
STATUS_PORT_MESSAGE_TOO_LONG
|
||||
STATUS_PORT_UNREACHABLE
|
||||
STATUS_POSSIBLE_DEADLOCK
|
||||
STATUS_PREDEFINED_HANDLE
|
||||
STATUS_PRIMARY_TRANSPORT_CONNECT_FAILED
|
||||
STATUS_PRINT_CANCELLED
|
||||
STATUS_PRINT_QUEUE_FULL
|
||||
STATUS_PRIVILEGED_INSTRUCTION
|
||||
STATUS_PRIVILEGE_NOT_HELD
|
||||
STATUS_PROCEDURE_NOT_FOUND
|
||||
STATUS_PROCESS_IN_JOB
|
||||
STATUS_PROCESS_IS_TERMINATING
|
||||
STATUS_PROCESS_NOT_IN_JOB
|
||||
STATUS_PROFILING_AT_LIMIT
|
||||
STATUS_PROFILING_NOT_STARTED
|
||||
STATUS_PROFILING_NOT_STOPPED
|
||||
STATUS_PROPSET_NOT_FOUND
|
||||
STATUS_PROTOCOL_UNREACHABLE
|
||||
STATUS_PWD_HISTORY_CONFLICT
|
||||
STATUS_PWD_TOO_RECENT
|
||||
STATUS_PWD_TOO_SHORT
|
||||
STATUS_QUOTA_EXCEEDED
|
||||
STATUS_QUOTA_LIST_INCONSISTENT
|
||||
STATUS_RANGE_LIST_CONFLICT
|
||||
STATUS_RANGE_NOT_FOUND
|
||||
STATUS_RANGE_NOT_LOCKED
|
||||
STATUS_RECEIVE_EXPEDITED
|
||||
STATUS_RECEIVE_PARTIAL
|
||||
STATUS_RECEIVE_PARTIAL_EXPEDITED
|
||||
STATUS_RECOVERY_FAILURE
|
||||
STATUS_REDIRECTOR_HAS_OPEN_HANDLES
|
||||
STATUS_REDIRECTOR_NOT_STARTED
|
||||
STATUS_REDIRECTOR_PAUSED
|
||||
STATUS_REDIRECTOR_STARTED
|
||||
STATUS_REGISTRY_CORRUPT
|
||||
STATUS_REGISTRY_IO_FAILED
|
||||
STATUS_REGISTRY_QUOTA_LIMIT
|
||||
STATUS_REGISTRY_RECOVERED
|
||||
STATUS_REMOTE_DISCONNECT
|
||||
STATUS_REMOTE_NOT_LISTENING
|
||||
STATUS_REMOTE_RESOURCES
|
||||
STATUS_REMOTE_SESSION_LIMIT
|
||||
STATUS_REPARSE
|
||||
STATUS_REPLY_MESSAGE_MISMATCH
|
||||
STATUS_REQUEST_ABORTED
|
||||
STATUS_REQUEST_NOT_ACCEPTED
|
||||
STATUS_RESOURCE_DATA_NOT_FOUND
|
||||
STATUS_RESOURCE_LANG_NOT_FOUND
|
||||
STATUS_RESOURCE_NAME_NOT_FOUND
|
||||
STATUS_RESOURCE_NOT_OWNED
|
||||
STATUS_RESOURCE_TYPE_NOT_FOUND
|
||||
STATUS_RETRY
|
||||
STATUS_REVISION_MISMATCH
|
||||
STATUS_RXACT_COMMITTED
|
||||
STATUS_RXACT_COMMIT_FAILURE
|
||||
STATUS_RXACT_COMMIT_NECESSARY
|
||||
STATUS_RXACT_INVALID_STATE
|
||||
STATUS_RXACT_STATE_CREATED
|
||||
STATUS_SAM_INIT_FAILURE
|
||||
STATUS_SECRET_TOO_LONG
|
||||
STATUS_SECTION_NOT_EXTENDED
|
||||
STATUS_SECTION_NOT_IMAGE
|
||||
STATUS_SECTION_PROTECTION
|
||||
STATUS_SECTION_TOO_BIG
|
||||
STATUS_SEGMENT_NOTIFICATION
|
||||
STATUS_SEMAPHORE_LIMIT_EXCEEDED
|
||||
STATUS_SERIAL_COUNTER_TIMEOUT
|
||||
STATUS_SERIAL_MORE_WRITES
|
||||
STATUS_SERIAL_NO_DEVICE_INITED
|
||||
STATUS_SERVER_DISABLED
|
||||
STATUS_SERVER_HAS_OPEN_HANDLES
|
||||
STATUS_SERVER_NOT_DISABLED
|
||||
STATUS_SERVICE_NOTIFICATION
|
||||
STATUS_SETMARK_DETECTED
|
||||
STATUS_SHARED_IRQ_BUSY
|
||||
STATUS_SHARING_PAUSED
|
||||
STATUS_SHARING_VIOLATION
|
||||
STATUS_SINGLE_STEP
|
||||
STATUS_SOME_NOT_MAPPED
|
||||
STATUS_SPECIAL_ACCOUNT
|
||||
STATUS_SPECIAL_GROUP
|
||||
STATUS_SPECIAL_USER
|
||||
STATUS_STACK_OVERFLOW
|
||||
STATUS_STACK_OVERFLOW_READ
|
||||
STATUS_SUCCESS
|
||||
STATUS_SUSPEND_COUNT_EXCEEDED
|
||||
STATUS_SYNCHRONIZATION_REQUIRED
|
||||
STATUS_SYSTEM_PROCESS_TERMINATED
|
||||
STATUS_THREAD_IS_TERMINATING
|
||||
STATUS_THREAD_NOT_IN_PROCESS
|
||||
STATUS_THREAD_WAS_SUSPENDED
|
||||
STATUS_TIMEOUT
|
||||
STATUS_TIMER_NOT_CANCELED
|
||||
STATUS_TIMER_RESOLUTION_NOT_SET
|
||||
STATUS_TIMER_RESUME_IGNORED
|
||||
STATUS_TIME_DIFFERENCE_AT_DC
|
||||
STATUS_TOKEN_ALREADY_IN_USE
|
||||
STATUS_TOO_LATE
|
||||
STATUS_TOO_MANY_ADDRESSES
|
||||
STATUS_TOO_MANY_COMMANDS
|
||||
STATUS_TOO_MANY_CONTEXT_IDS
|
||||
STATUS_TOO_MANY_GUIDS_REQUESTED
|
||||
STATUS_TOO_MANY_LINKS
|
||||
STATUS_TOO_MANY_LUIDS_REQUESTED
|
||||
STATUS_TOO_MANY_NAMES
|
||||
STATUS_TOO_MANY_NODES
|
||||
STATUS_TOO_MANY_OPENED_FILES
|
||||
STATUS_TOO_MANY_PAGING_FILES
|
||||
STATUS_TOO_MANY_SECRETS
|
||||
STATUS_TOO_MANY_SESSIONS
|
||||
STATUS_TOO_MANY_SIDS
|
||||
STATUS_TOO_MANY_THREADS
|
||||
STATUS_TRANSACTION_ABORTED
|
||||
STATUS_TRANSACTION_INVALID_ID
|
||||
STATUS_TRANSACTION_INVALID_TYPE
|
||||
STATUS_TRANSACTION_NO_MATCH
|
||||
STATUS_TRANSACTION_NO_RELEASE
|
||||
STATUS_TRANSACTION_RESPONDED
|
||||
STATUS_TRANSACTION_TIMED_OUT
|
||||
STATUS_TRUSTED_DOMAIN_FAILURE
|
||||
STATUS_TRUSTED_RELATIONSHIP_FAILURE
|
||||
STATUS_TRUST_FAILURE
|
||||
STATUS_UNABLE_TO_DECOMMIT_VM
|
||||
STATUS_UNABLE_TO_DELETE_SECTION
|
||||
STATUS_UNABLE_TO_FREE_VM
|
||||
STATUS_UNABLE_TO_LOCK_MEDIA
|
||||
STATUS_UNABLE_TO_UNLOAD_MEDIA
|
||||
STATUS_UNDEFINED_CHARACTER
|
||||
STATUS_UNEXPECTED_IO_ERROR
|
||||
STATUS_UNEXPECTED_MM_CREATE_ERR
|
||||
STATUS_UNEXPECTED_MM_EXTEND_ERR
|
||||
STATUS_UNEXPECTED_MM_MAP_ERROR
|
||||
STATUS_UNEXPECTED_NETWORK_ERROR
|
||||
STATUS_UNHANDLED_EXCEPTION
|
||||
STATUS_UNKNOWN_REVISION
|
||||
STATUS_UNMAPPABLE_CHARACTER
|
||||
STATUS_UNRECOGNIZED_MEDIA
|
||||
STATUS_UNRECOGNIZED_VOLUME
|
||||
STATUS_UNSUCCESSFUL
|
||||
STATUS_UNSUPPORTED_COMPRESSION
|
||||
STATUS_UNWIND
|
||||
STATUS_USER_APC
|
||||
STATUS_USER_EXISTS
|
||||
STATUS_USER_MAPPED_FILE
|
||||
STATUS_USER_SESSION_DELETED
|
||||
STATUS_VALIDATE_CONTINUE
|
||||
STATUS_VARIABLE_NOT_FOUND
|
||||
STATUS_VDM_HARD_ERROR
|
||||
STATUS_VERIFY_REQUIRED
|
||||
STATUS_VIRTUAL_CIRCUIT_CLOSED
|
||||
STATUS_VOLUME_DISMOUNTED
|
||||
STATUS_VOLUME_MOUNTED
|
||||
STATUS_WAIT_0
|
||||
STATUS_WAIT_63
|
||||
STATUS_WAKE_SYSTEM_DEBUGGER
|
||||
STATUS_WAS_LOCKED
|
||||
STATUS_WAS_UNLOCKED
|
||||
STATUS_WORKING_SET_LIMIT_RANGE
|
||||
STATUS_WORKING_SET_QUOTA
|
||||
STATUS_WRONG_PASSWORD
|
||||
STATUS_WRONG_PASSWORD_CORE
|
||||
STATUS_WRONG_VOLUME
|
||||
STATUS_WX86_BREAKPOINT
|
||||
STATUS_WX86_CONTINUE
|
||||
STATUS_WX86_CREATEWX86TIB
|
||||
STATUS_WX86_EXCEPTION_CHAIN
|
||||
STATUS_WX86_EXCEPTION_CONTINUE
|
||||
STATUS_WX86_EXCEPTION_LASTCHANCE
|
||||
STATUS_WX86_FLOAT_STACK_CHECK
|
||||
STATUS_WX86_INTERNAL_ERROR
|
||||
STATUS_WX86_SINGLE_STEP
|
||||
STATUS_WX86_UNSIMULATE
|
||||
7
irc/ArchBlackmann/stru.txt
Normal file
7
irc/ArchBlackmann/stru.txt
Normal file
@@ -0,0 +1,7 @@
|
||||
FAST_MUTEX
|
||||
KPCR
|
||||
PEB
|
||||
TEB
|
||||
SPINLOCK
|
||||
APC
|
||||
DPC
|
||||
73
irc/ArchBlackmann/tech.txt
Normal file
73
irc/ArchBlackmann/tech.txt
Normal file
@@ -0,0 +1,73 @@
|
||||
What do you think I am, your personal tech support?
|
||||
You *know* a %stru% is non-re-entrant, right?
|
||||
The answer to that is so simple, I'm not going to waste my time telling you.
|
||||
Well, of course... if you're not below DISPATCH_LEVEL, ros is gonna explode on ya when you try to do that ( duh! ).
|
||||
I don't think that functionality has been implemented, yet.
|
||||
What do you mean it crashed? It can't crash there!
|
||||
Wow. That's a new one.
|
||||
Ask %dev%, I bet he knows.. he knows everything...
|
||||
When's the last time you rebuilt?
|
||||
Have you tried a make clean?
|
||||
Is it plugged in?
|
||||
Well it works on *my* system :P
|
||||
Well don't do that, and you won't have that problem.
|
||||
Didn't we already fix that?
|
||||
Well... I don't know.. I just have that code disabled in my tree.
|
||||
Try surrounding it with parenthesis.
|
||||
Don't you know going around dereferncing null pointers all day can be hazardous to your health?
|
||||
Well, duh!
|
||||
There's a bit in cr3 for problems like that.
|
||||
Just add a field to the %stru% to keep track of it!
|
||||
Don't worry about it... the garbage collector in %module% will clean it up for you.
|
||||
Did I do that?
|
||||
Didn't %dev% fix that already?
|
||||
Yes, I think I've seen that bug before... no... that was another program.
|
||||
I could tell you, but then I'd have to unlink() you.
|
||||
Well if you'd get some sleep, maybe you'd figure it out... not all of us can keep the hours %dev% can...
|
||||
You did what? Uh oh... that can't be good.
|
||||
Well... I could tell you, but the answer's pretty complicated. Why don't you wait to read about it in the book I'm writing.
|
||||
Yeah, that's happened to me, before, too. All you have to do is wrap it in an SEH block and forget about it.
|
||||
Just put a NULL dereference in there and commit it. It helps get bugs fixed fast! (Not that I would know)
|
||||
ASSERT is your friend!
|
||||
I dunno.. but I bet %dev% could find it for you.
|
||||
I hereby declare that code is perfect. Your problem must be elsewhere.
|
||||
I wrote that code... it must be perfect.
|
||||
$#@!$ One of these days I'm gonna throw %module% out the window!!! Sorry, what were you saying?
|
||||
maybe I broke it in my last commit. Maybe I did it on purpose...
|
||||
Have you tried debugging it? I got a can of Raid...
|
||||
Just delete it, it can't be that important ( You should see all the useless cruft I got rid of in %module% )
|
||||
Try queueing a work item...
|
||||
My %stru% fell in love with some %stru% in %module%, and %module% has been hell since...
|
||||
Maybe the PEB is getting corrupted. Try allocating a new PEB and overwriting the old one. That's what I did last time I had a bug like that.
|
||||
Hmm.. that seems to have been introduced by my last commit... I bet CVS mixed up the bits during the commit.
|
||||
It can't possibly be my fault, so I don't care.
|
||||
I'm not experiencing that problem, perhaps it's all in your mind.
|
||||
Well... like a good friend of mine said... "Don't Panic!"
|
||||
It just shows you how far ReactOS has come along! A %period% ago a bug like that wouldn't have even been possible!
|
||||
Just surround the code with an #if 0/#endif block, it solves all my problems!
|
||||
You know.. if %dev% would just finish %module% for us, we wouldn't be having this problem.
|
||||
I say we move on to the next function, since we can't seem to figure this one out.
|
||||
Well, sure, that would have been my first guess, too.... TEN YEARS AGO :p
|
||||
yup, that sounds like a problem.
|
||||
If I wanted to talk about VB, I'd go bug Alex...
|
||||
ask %dev%
|
||||
Thank you for that amazingly keen insight, Commander Obvious.
|
||||
Sorry, can't help you right now, trying to track down this bug %dev% caused in %module%
|
||||
I dont know about that, but I just fixed a problem in %module% for %dev%
|
||||
How should I know? I'm still trying to figure out this main() thing... ooh! wanna see what I did in %module%?
|
||||
lol!
|
||||
*wink*
|
||||
;)
|
||||
42
|
||||
It's gonna take me over %period% to fix all %dev%'s bugs in %module% :(
|
||||
How could %func% return %status%!? It bet %dev% broke it! I didn't touch it... honest! no.. really! (me hides)
|
||||
It's fine if you get %status% there ... just ignore the destruction, and call %func% instead.
|
||||
%dev% said %status% isn't really an error in this context because we expect %module% to be toast by now
|
||||
heh, I'm still trying to figure out why %func% is returning %status% when I call it from %module%...
|
||||
%dev% said it's okay to ignore that as long as you're below %irql%
|
||||
erm, what do you mean?
|
||||
damn, I do that all the time
|
||||
if you want a reply that sounds right, I'd say that %func% support for that is vital to the future of %module%
|
||||
Sounds like you're having a problem with %func%. I hate that thing... don't talk to me about it.
|
||||
Just return %status% and forget about it. Someone else will fix it, later.
|
||||
Blah blah blah... sheesh... can't you figure out *anything*?
|
||||
17
irc/ArchBlackmann/trim.cpp
Normal file
17
irc/ArchBlackmann/trim.cpp
Normal file
@@ -0,0 +1,17 @@
|
||||
// trim.cpp
|
||||
// This file is (C) 2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#include "trim.h"
|
||||
|
||||
std::string trim ( const std::string& s )
|
||||
{
|
||||
const char* p = &s[0];
|
||||
const char* p2 = p + s.size();
|
||||
while ( *p == ' ' )
|
||||
p++;
|
||||
while ( p2 > p && p2[-1] == ' ' )
|
||||
p2--;
|
||||
return std::string ( p, p2-p );
|
||||
}
|
||||
|
||||
13
irc/ArchBlackmann/trim.h
Normal file
13
irc/ArchBlackmann/trim.h
Normal file
@@ -0,0 +1,13 @@
|
||||
// trim.h
|
||||
// This file is (C) 2004 Royce Mitchell III
|
||||
// and released under the BSD & LGPL licenses
|
||||
|
||||
#ifndef TRIM_H
|
||||
#define TRIM_H
|
||||
|
||||
#include <string>
|
||||
|
||||
std::string trim ( const std::string& s );
|
||||
|
||||
#endif//TRIM_H
|
||||
|
||||
1000
irc/ArchBlackmann/type.txt
Normal file
1000
irc/ArchBlackmann/type.txt
Normal file
File diff suppressed because it is too large
Load Diff
37
irc/ArchBlackmann/verify.h
Normal file
37
irc/ArchBlackmann/verify.h
Normal file
@@ -0,0 +1,37 @@
|
||||
// verify.h
|
||||
// This code is (C) 2003-2004 Royce Mitchell III
|
||||
// and released under the LGPL & BSD licenses
|
||||
|
||||
#ifndef VERIFY_H
|
||||
#define VERIFY_H
|
||||
|
||||
//#include <assert.h>
|
||||
|
||||
#ifdef ASSERT
|
||||
#undef ASSERT
|
||||
#endif//ASSERT
|
||||
|
||||
#include "panic.h"
|
||||
|
||||
#if defined(DEBUG) || defined(_DEBUG)
|
||||
inline void AssertHandler ( bool b, const char* str )
|
||||
{
|
||||
if ( !b )
|
||||
panic ( str );
|
||||
}
|
||||
# define ASSERT(x) AssertHandler((x) ? true : false, #x )
|
||||
#else
|
||||
# define ASSERT(x)
|
||||
#endif
|
||||
|
||||
#ifdef verify
|
||||
#undef verify
|
||||
#endif//verify
|
||||
|
||||
#if defined(DEBUG) || defined(_DEBUG)
|
||||
# define verify(x) ASSERT(x)
|
||||
#else
|
||||
# define verify(x) x
|
||||
#endif
|
||||
|
||||
#endif//VERIFY_H
|
||||
32
irc/TechBot/CHMLibrary/AssemblyInfo.cs
Normal file
32
irc/TechBot/CHMLibrary/AssemblyInfo.cs
Normal file
@@ -0,0 +1,32 @@
|
||||
using System.Reflection;
|
||||
using System.Runtime.CompilerServices;
|
||||
|
||||
// Information about this assembly is defined by the following
|
||||
// attributes.
|
||||
//
|
||||
// change them to the information which is associated with the assembly
|
||||
// you compile.
|
||||
|
||||
[assembly: AssemblyTitle("")]
|
||||
[assembly: AssemblyDescription("")]
|
||||
[assembly: AssemblyConfiguration("")]
|
||||
[assembly: AssemblyCompany("")]
|
||||
[assembly: AssemblyProduct("")]
|
||||
[assembly: AssemblyCopyright("")]
|
||||
[assembly: AssemblyTrademark("")]
|
||||
[assembly: AssemblyCulture("")]
|
||||
|
||||
// The assembly version has following format :
|
||||
//
|
||||
// Major.Minor.Build.Revision
|
||||
//
|
||||
// You can specify all values by your own or you can build default build and revision
|
||||
// numbers with the '*' character (the default):
|
||||
|
||||
[assembly: AssemblyVersion("1.0.*")]
|
||||
|
||||
// The following attributes specify the key for the sign of your assembly. See the
|
||||
// .NET Framework documentation for more information about signing.
|
||||
// This is not required, if you don't want signing let these attributes like they're.
|
||||
[assembly: AssemblyDelaySign(false)]
|
||||
[assembly: AssemblyKeyFile("")]
|
||||
274
irc/TechBot/CHMLibrary/CHMDecoding/BinaryReaderHelp.cs
Normal file
274
irc/TechBot/CHMLibrary/CHMDecoding/BinaryReaderHelp.cs
Normal file
@@ -0,0 +1,274 @@
|
||||
using System;
|
||||
using System.Collections;
|
||||
using System.IO;
|
||||
using System.Text;
|
||||
using System.Globalization;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>BinaryReaderHelp</c> implements static helper methods for extracting binary data
|
||||
/// from a binary reader object.
|
||||
/// </summary>
|
||||
internal class BinaryReaderHelp
|
||||
{
|
||||
/// <summary>
|
||||
/// Internal helper method to extract null-terminated strings from a binary reader
|
||||
/// </summary>
|
||||
/// <param name="binReader">reference to the binary reader</param>
|
||||
/// <param name="offset">offset in the stream</param>
|
||||
/// <param name="noOffset">true if the offset value should be used</param>
|
||||
/// <param name="encoder">encoder used for text encoding</param>
|
||||
/// <returns>An extracted string value</returns>
|
||||
internal static string ExtractString(ref BinaryReader binReader, int offset, bool noOffset, Encoding encoder)
|
||||
{
|
||||
string strReturn = "";
|
||||
|
||||
if(encoder == null)
|
||||
encoder = Encoding.ASCII;
|
||||
|
||||
ArrayList nameBytes = new ArrayList();
|
||||
byte curByte;
|
||||
|
||||
if(!noOffset)
|
||||
binReader.BaseStream.Seek(offset, SeekOrigin.Begin);
|
||||
|
||||
if(binReader.BaseStream.Position >= binReader.BaseStream.Length)
|
||||
return "";
|
||||
|
||||
curByte = binReader.ReadByte();
|
||||
while( (curByte != (byte)0) && (binReader.BaseStream.Position < binReader.BaseStream.Length) )
|
||||
{
|
||||
nameBytes.Add( curByte );
|
||||
curByte = binReader.ReadByte();
|
||||
}
|
||||
|
||||
byte[] name = (byte[]) (nameBytes.ToArray(System.Type.GetType("System.Byte")));
|
||||
strReturn = encoder.GetString(name,0,name.Length);
|
||||
|
||||
return strReturn;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Internal helper method to extract a string with a specific length from the binary reader
|
||||
/// </summary>
|
||||
/// <param name="binReader">reference to the binary reader</param>
|
||||
/// <param name="length">length of the string (number of bytes)</param>
|
||||
/// <param name="offset">offset in the stream</param>
|
||||
/// <param name="noOffset">true if the offset value should be used</param>
|
||||
/// <param name="encoder">encoder used for text encoding</param>
|
||||
/// <returns>An extracted string value</returns>
|
||||
internal static string ExtractString(ref BinaryReader binReader, int length, int offset, bool noOffset, Encoding encoder)
|
||||
{
|
||||
string strReturn = "";
|
||||
|
||||
if(length == 0)
|
||||
return "";
|
||||
|
||||
if(encoder == null)
|
||||
encoder = Encoding.ASCII;
|
||||
|
||||
ArrayList nameBytes = new ArrayList();
|
||||
byte curByte;
|
||||
|
||||
if(!noOffset)
|
||||
binReader.BaseStream.Seek(offset, SeekOrigin.Begin);
|
||||
|
||||
if(binReader.BaseStream.Position >= binReader.BaseStream.Length)
|
||||
return "";
|
||||
|
||||
curByte = binReader.ReadByte();
|
||||
while( (curByte != (byte)0) && (nameBytes.Count < length) && (binReader.BaseStream.Position < binReader.BaseStream.Length) )
|
||||
{
|
||||
nameBytes.Add( curByte );
|
||||
|
||||
if(nameBytes.Count < length)
|
||||
curByte = binReader.ReadByte();
|
||||
}
|
||||
|
||||
byte[] name = (byte[]) (nameBytes.ToArray(System.Type.GetType("System.Byte")));
|
||||
strReturn = encoder.GetString(name,0,name.Length);
|
||||
|
||||
return strReturn;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Internal helper method to extract a string with a specific length from the binary reader
|
||||
/// </summary>
|
||||
/// <param name="binReader">reference to the binary reader</param>
|
||||
/// <param name="bFoundTerminator">reference to a bool vairable which will receive true if the
|
||||
/// string terminator \0 was found. false indicates that the end of the stream was reached.</param>
|
||||
/// <param name="offset">offset in the stream</param>
|
||||
/// <param name="noOffset">true if the offset value should be used</param>
|
||||
/// <param name="encoder">encoder used for text encoding</param>
|
||||
/// <returns>An extracted string value</returns>
|
||||
internal static string ExtractString(ref BinaryReader binReader, ref bool bFoundTerminator, int offset, bool noOffset, Encoding encoder)
|
||||
{
|
||||
string strReturn = "";
|
||||
|
||||
ArrayList nameBytes = new ArrayList();
|
||||
byte curByte;
|
||||
|
||||
if(encoder == null)
|
||||
encoder = Encoding.ASCII;
|
||||
|
||||
if(!noOffset)
|
||||
binReader.BaseStream.Seek(offset, SeekOrigin.Begin);
|
||||
|
||||
if(binReader.BaseStream.Position >= binReader.BaseStream.Length)
|
||||
return "";
|
||||
|
||||
curByte = binReader.ReadByte();
|
||||
while( (curByte != (byte)0) && (binReader.BaseStream.Position < binReader.BaseStream.Length) )
|
||||
{
|
||||
nameBytes.Add( curByte );
|
||||
curByte = binReader.ReadByte();
|
||||
|
||||
if( curByte == (byte)0 )
|
||||
{
|
||||
bFoundTerminator = true;
|
||||
}
|
||||
}
|
||||
|
||||
byte[] name = (byte[]) (nameBytes.ToArray(System.Type.GetType("System.Byte")));
|
||||
strReturn = encoder.GetString(name,0,name.Length);
|
||||
|
||||
return strReturn;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Internal helper method to extract a null-terminated UTF-16/UCS-2 strings from a binary reader
|
||||
/// </summary>
|
||||
/// <param name="binReader">reference to the binary reader</param>
|
||||
/// <param name="offset">offset in the stream</param>
|
||||
/// <param name="noOffset">true if the offset value should be used</param>
|
||||
/// <param name="encoder">encoder used for text encoding</param>
|
||||
/// <returns>An extracted string value</returns>
|
||||
internal static string ExtractUTF16String(ref BinaryReader binReader, int offset, bool noOffset, Encoding encoder)
|
||||
{
|
||||
string strReturn = "";
|
||||
|
||||
ArrayList nameBytes = new ArrayList();
|
||||
byte curByte;
|
||||
int lastByte=-1;
|
||||
|
||||
if(!noOffset)
|
||||
binReader.BaseStream.Seek(offset, SeekOrigin.Begin);
|
||||
|
||||
if(binReader.BaseStream.Position >= binReader.BaseStream.Length)
|
||||
return "";
|
||||
|
||||
if(encoder == null)
|
||||
encoder = Encoding.Unicode;
|
||||
|
||||
curByte = binReader.ReadByte();
|
||||
int nCnt = 0;
|
||||
while( ((curByte != (byte)0) || (lastByte != 0) ) && (binReader.BaseStream.Position < binReader.BaseStream.Length) )
|
||||
{
|
||||
nameBytes.Add( curByte );
|
||||
|
||||
if(nCnt%2 == 0)
|
||||
lastByte = (int)curByte;
|
||||
|
||||
curByte = binReader.ReadByte();
|
||||
|
||||
nCnt++;
|
||||
}
|
||||
|
||||
byte[] name = (byte[]) (nameBytes.ToArray(System.Type.GetType("System.Byte")));
|
||||
strReturn = Encoding.Unicode.GetString(name,0,name.Length);
|
||||
|
||||
// apply text encoding
|
||||
name = Encoding.Default.GetBytes(strReturn);
|
||||
strReturn = encoder.GetString(name,0,name.Length);
|
||||
|
||||
return strReturn;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Internal helper for reading ENCINT encoded integer values
|
||||
/// </summary>
|
||||
/// <param name="binReader">reference to the reader</param>
|
||||
/// <returns>a long value</returns>
|
||||
internal static long ReadENCINT(ref BinaryReader binReader)
|
||||
{
|
||||
long nRet = 0;
|
||||
byte buffer = 0;
|
||||
int shift = 0;
|
||||
|
||||
if(binReader.BaseStream.Position >= binReader.BaseStream.Length)
|
||||
return nRet;
|
||||
|
||||
do
|
||||
{
|
||||
buffer = binReader.ReadByte();
|
||||
nRet |= ((long)((buffer & (byte)0x7F))) << shift;
|
||||
shift += 7;
|
||||
|
||||
}while ( (buffer & (byte)0x80) != 0);
|
||||
|
||||
return nRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Reads an s/r encoded value from the byte array and decodes it into an integer
|
||||
/// </summary>
|
||||
/// <param name="wclBits">a byte array containing all bits (contains only 0 or 1 elements)</param>
|
||||
/// <param name="s">scale param for encoding</param>
|
||||
/// <param name="r">root param for encoding</param>
|
||||
/// <param name="nBitIndex">current index in the wclBits array</param>
|
||||
/// <returns>Returns an decoded integer value.</returns>
|
||||
internal static int ReadSRItem(byte[] wclBits, int s, int r, ref int nBitIndex)
|
||||
{
|
||||
int nRet = 0;
|
||||
int q = r;
|
||||
|
||||
int nPref1Cnt = 0;
|
||||
|
||||
while( wclBits[nBitIndex++] == 1)
|
||||
{
|
||||
nPref1Cnt++;
|
||||
}
|
||||
|
||||
if(nPref1Cnt == 0)
|
||||
{
|
||||
int nMask = 0;
|
||||
|
||||
for(int nbits=0; nbits<q;nbits++)
|
||||
{
|
||||
nMask |= ( 0x01 & (int)wclBits[nBitIndex]) << (q-nbits-1);
|
||||
nBitIndex++;
|
||||
}
|
||||
|
||||
nRet = nMask;
|
||||
}
|
||||
else
|
||||
{
|
||||
q += (nPref1Cnt-1);
|
||||
|
||||
int nMask = 0;
|
||||
int nRMaxValue = 0;
|
||||
|
||||
for(int nbits=0; nbits<q;nbits++)
|
||||
{
|
||||
nMask |= ( 0x01 & (int)wclBits[nBitIndex]) << (q-nbits-1);
|
||||
nBitIndex++;
|
||||
}
|
||||
|
||||
for(int nsv=0; nsv<r; nsv++)
|
||||
{
|
||||
nRMaxValue = nRMaxValue << 1;
|
||||
nRMaxValue |= 0x1;
|
||||
}
|
||||
|
||||
nRMaxValue++; // startvalue of s/r encoding with 1 prefixing '1'
|
||||
|
||||
nRMaxValue *= (int) Math.Pow((double)2, (double)(nPref1Cnt-1));
|
||||
|
||||
nRet = nRMaxValue + nMask;
|
||||
}
|
||||
|
||||
return nRet;
|
||||
}
|
||||
}
|
||||
}
|
||||
325
irc/TechBot/CHMLibrary/CHMDecoding/CHMBtree.cs
Normal file
325
irc/TechBot/CHMLibrary/CHMDecoding/CHMBtree.cs
Normal file
@@ -0,0 +1,325 @@
|
||||
using System;
|
||||
using System.IO;
|
||||
using System.Collections;
|
||||
using System.Collections.Specialized;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>CHMBtree</c> implements methods/properties to decode the binary help index.
|
||||
/// This class automatically creates an index arraylist for the current CHMFile instance.
|
||||
/// It does not store the index internally !
|
||||
/// </summary>
|
||||
/// <remarks>The binary index can be found in the storage file $WWKeywordLinks/BTree</remarks>
|
||||
internal sealed class CHMBtree : IDisposable
|
||||
{
|
||||
/// <summary>
|
||||
/// Constant specifying the size of the string blocks
|
||||
/// </summary>
|
||||
private const int BLOCK_SIZE = 2048;
|
||||
/// <summary>
|
||||
/// Internal flag specifying if the object is going to be disposed
|
||||
/// </summary>
|
||||
private bool disposed = false;
|
||||
/// <summary>
|
||||
/// Internal member storing the binary file data
|
||||
/// </summary>
|
||||
private byte[] _binaryFileData = null;
|
||||
/// <summary>
|
||||
/// Internal member storing flags
|
||||
/// </summary>
|
||||
private int _flags = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the data format
|
||||
/// </summary>
|
||||
private byte[] _dataFormat = new byte[16];
|
||||
/// <summary>
|
||||
/// Internal member storing the index of the last listing block
|
||||
/// </summary>
|
||||
private int _indexOfLastListingBlock = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the index of the root block
|
||||
/// </summary>
|
||||
private int _indexOfRootBlock = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the number of blocks
|
||||
/// </summary>
|
||||
private int _numberOfBlocks = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the tree depth.
|
||||
/// (1 if no index blocks, 2 one level of index blocks, ...)
|
||||
/// </summary>
|
||||
private int _treeDepth = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the number of keywords in the file
|
||||
/// </summary>
|
||||
private int _numberOfKeywords = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the codepage
|
||||
/// </summary>
|
||||
private int _codePage = 0;
|
||||
/// <summary>
|
||||
/// true if the index is from a CHI or CHM file, else CHW
|
||||
/// </summary>
|
||||
private bool _isCHI_CHM = true;
|
||||
/// <summary>
|
||||
/// Internal member storing the associated chmfile object
|
||||
/// </summary>
|
||||
private CHMFile _associatedFile = null;
|
||||
/// <summary>
|
||||
/// Internal flag specifying if we have to read listing or index blocks
|
||||
/// </summary>
|
||||
private bool _readListingBlocks = true;
|
||||
/// <summary>
|
||||
/// Internal member storing an indexlist of the current file.
|
||||
/// </summary>
|
||||
private ArrayList _indexList = new ArrayList();
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="binaryFileData">binary file data of the $WWKeywordLinks/BTree file</param>
|
||||
/// <param name="associatedFile">associated chm file</param>
|
||||
public CHMBtree(byte[] binaryFileData, CHMFile associatedFile)
|
||||
{
|
||||
if( associatedFile == null)
|
||||
{
|
||||
throw new ArgumentException("CHMBtree.ctor() - Associated CHMFile must not be null !", "associatedFile");
|
||||
}
|
||||
|
||||
_binaryFileData = binaryFileData;
|
||||
_associatedFile = associatedFile;
|
||||
DecodeData();
|
||||
|
||||
// clear internal binary data after extraction
|
||||
_binaryFileData = null;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Decodes the binary file data and fills the internal properties
|
||||
/// </summary>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeData()
|
||||
{
|
||||
bool bRet = true;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(_binaryFileData);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
int nCurOffset = 0;
|
||||
int nTemp = 0;
|
||||
|
||||
// decode header
|
||||
binReader.ReadChars(2); // 2chars signature (not important)
|
||||
|
||||
_flags = (int)binReader.ReadInt16(); // WORD flags
|
||||
|
||||
binReader.ReadInt16(); // size of blocks (always 2048)
|
||||
|
||||
_dataFormat = binReader.ReadBytes(16);
|
||||
|
||||
binReader.ReadInt32(); // unknown DWORD
|
||||
|
||||
_indexOfLastListingBlock = binReader.ReadInt32();
|
||||
_indexOfRootBlock = binReader.ReadInt32();
|
||||
|
||||
binReader.ReadInt32(); // unknown DWORD
|
||||
|
||||
_numberOfBlocks = binReader.ReadInt32();
|
||||
_treeDepth = binReader.ReadInt16();
|
||||
_numberOfKeywords = binReader.ReadInt32();
|
||||
_codePage = binReader.ReadInt32();
|
||||
|
||||
binReader.ReadInt32(); // lcid DWORD
|
||||
|
||||
nTemp = binReader.ReadInt32();
|
||||
_isCHI_CHM = (nTemp==1);
|
||||
|
||||
binReader.ReadInt32(); // unknown DWORD
|
||||
binReader.ReadInt32(); // unknown DWORD
|
||||
binReader.ReadInt32(); // unknown DWORD
|
||||
binReader.ReadInt32(); // unknown DWORD
|
||||
|
||||
// end of header decode
|
||||
|
||||
while( (memStream.Position < memStream.Length) && (bRet) )
|
||||
{
|
||||
nCurOffset = (int)memStream.Position;
|
||||
byte [] dataBlock = binReader.ReadBytes(BLOCK_SIZE);
|
||||
bRet &= DecodeBlock(dataBlock, ref nCurOffset, _treeDepth-1);
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Decodes a block of url-string data
|
||||
/// </summary>
|
||||
/// <param name="dataBlock">block of data</param>
|
||||
/// <param name="nOffset">current file offset</param>
|
||||
/// <param name="indexBlocks">number of index blocks</param>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeBlock( byte[] dataBlock, ref int nOffset, int indexBlocks )
|
||||
{
|
||||
bool bRet = true;
|
||||
int nblockOffset = nOffset;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(dataBlock);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
int freeSpace = binReader.ReadInt16(); // length of freespace
|
||||
int nrOfEntries = binReader.ReadInt16(); // number of entries
|
||||
|
||||
bool bListingEndReached = false;
|
||||
|
||||
//while( (memStream.Position < (memStream.Length-freeSpace)) && (bRet) )
|
||||
//{
|
||||
int nIndexOfPrevBlock = -1;
|
||||
int nIndexOfNextBlock = -1;
|
||||
int nIndexOfChildBlock = 0;
|
||||
|
||||
if(_readListingBlocks)
|
||||
{
|
||||
nIndexOfPrevBlock = binReader.ReadInt32(); // -1 if this is the header
|
||||
nIndexOfNextBlock = binReader.ReadInt32(); // -1 if this is the last block
|
||||
}
|
||||
else
|
||||
{
|
||||
nIndexOfChildBlock = binReader.ReadInt32();
|
||||
}
|
||||
|
||||
for(int nE = 0; nE < nrOfEntries; nE++)
|
||||
{
|
||||
if(_readListingBlocks)
|
||||
{
|
||||
bListingEndReached = (nIndexOfNextBlock==-1);
|
||||
|
||||
string keyWord = BinaryReaderHelp.ExtractUTF16String(ref binReader, 0, true, _associatedFile.TextEncoding);
|
||||
|
||||
bool isSeeAlsoKeyword = (binReader.ReadInt16()!=0);
|
||||
|
||||
int indent = binReader.ReadInt16(); // indent of entry
|
||||
int nCharIndex = binReader.ReadInt32();
|
||||
|
||||
binReader.ReadInt32();
|
||||
|
||||
int numberOfPairs = binReader.ReadInt32();
|
||||
|
||||
int[] nTopics = new int[numberOfPairs];
|
||||
string[] seeAlso = new string[numberOfPairs];
|
||||
|
||||
for(int i=0; i < numberOfPairs; i++)
|
||||
{
|
||||
if(isSeeAlsoKeyword)
|
||||
{
|
||||
seeAlso[i] = BinaryReaderHelp.ExtractUTF16String(ref binReader, 0, true, _associatedFile.TextEncoding);
|
||||
}
|
||||
else
|
||||
{
|
||||
nTopics[i] = binReader.ReadInt32();
|
||||
}
|
||||
}
|
||||
|
||||
binReader.ReadInt32(); // unknown
|
||||
|
||||
int nIndexOfThisEntry = binReader.ReadInt32();
|
||||
|
||||
IndexItem newItem = new IndexItem(_associatedFile, keyWord, isSeeAlsoKeyword, indent, nCharIndex, nIndexOfThisEntry, seeAlso, nTopics);
|
||||
_indexList.Add(newItem);
|
||||
}
|
||||
else
|
||||
{
|
||||
string keyWord = BinaryReaderHelp.ExtractUTF16String(ref binReader, 0, true, _associatedFile.TextEncoding);
|
||||
|
||||
bool isSeeAlsoKeyword = (binReader.ReadInt16()!=0);
|
||||
|
||||
int indent = binReader.ReadInt16(); // indent of entry
|
||||
int nCharIndex = binReader.ReadInt32();
|
||||
|
||||
binReader.ReadInt32();
|
||||
|
||||
int numberOfPairs = binReader.ReadInt32();
|
||||
|
||||
int[] nTopics = new int[numberOfPairs];
|
||||
string[] seeAlso = new string[numberOfPairs];
|
||||
|
||||
for(int i=0; i < numberOfPairs; i++)
|
||||
{
|
||||
if(isSeeAlsoKeyword)
|
||||
{
|
||||
seeAlso[i] = BinaryReaderHelp.ExtractUTF16String(ref binReader, 0, true, _associatedFile.TextEncoding);
|
||||
}
|
||||
else
|
||||
{
|
||||
nTopics[i] = binReader.ReadInt32();
|
||||
}
|
||||
}
|
||||
|
||||
int nIndexChild = binReader.ReadInt32();
|
||||
int nIndexOfThisEntry=-1;
|
||||
|
||||
IndexItem newItem = new IndexItem(_associatedFile, keyWord, isSeeAlsoKeyword, indent, nCharIndex, nIndexOfThisEntry, seeAlso, nTopics);
|
||||
_indexList.Add(newItem);
|
||||
|
||||
}
|
||||
}
|
||||
//}
|
||||
|
||||
binReader.ReadBytes(freeSpace);
|
||||
|
||||
|
||||
if( bListingEndReached )
|
||||
_readListingBlocks = false;
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the internal generated index list
|
||||
/// </summary>
|
||||
internal ArrayList IndexList
|
||||
{
|
||||
get { return _indexList; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Implement IDisposable.
|
||||
/// </summary>
|
||||
public void Dispose()
|
||||
{
|
||||
Dispose(true);
|
||||
// This object will be cleaned up by the Dispose method.
|
||||
// Therefore, you should call GC.SupressFinalize to
|
||||
// take this object off the finalization queue
|
||||
// and prevent finalization code for this object
|
||||
// from executing a second time.
|
||||
GC.SuppressFinalize(this);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Dispose(bool disposing) executes in two distinct scenarios.
|
||||
/// If disposing equals true, the method has been called directly
|
||||
/// or indirectly by a user's code. Managed and unmanaged resources
|
||||
/// can be disposed.
|
||||
/// If disposing equals false, the method has been called by the
|
||||
/// runtime from inside the finalizer and you should not reference
|
||||
/// other objects. Only unmanaged resources can be disposed.
|
||||
/// </summary>
|
||||
/// <param name="disposing">disposing flag</param>
|
||||
private void Dispose(bool disposing)
|
||||
{
|
||||
// Check to see if Dispose has already been called.
|
||||
if(!this.disposed)
|
||||
{
|
||||
// If disposing equals true, dispose all managed
|
||||
// and unmanaged resources.
|
||||
if(disposing)
|
||||
{
|
||||
// Dispose managed resources.
|
||||
_binaryFileData = null;
|
||||
}
|
||||
}
|
||||
disposed = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
2061
irc/TechBot/CHMLibrary/CHMDecoding/CHMFile.cs
Normal file
2061
irc/TechBot/CHMLibrary/CHMDecoding/CHMFile.cs
Normal file
File diff suppressed because it is too large
Load Diff
286
irc/TechBot/CHMLibrary/CHMDecoding/CHMIdxhdr.cs
Normal file
286
irc/TechBot/CHMLibrary/CHMDecoding/CHMIdxhdr.cs
Normal file
@@ -0,0 +1,286 @@
|
||||
using System;
|
||||
using System.Collections;
|
||||
using System.IO;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>CHMIdxhdr</c> implements t properties which have been read from the #IDXHDR file.
|
||||
/// </summary>
|
||||
internal sealed class CHMIdxhdr : IDisposable
|
||||
{
|
||||
/// <summary>
|
||||
/// Internal flag specifying if the object is going to be disposed
|
||||
/// </summary>
|
||||
private bool disposed = false;
|
||||
/// <summary>
|
||||
/// Internal member storing the binary file data
|
||||
/// </summary>
|
||||
private byte[] _binaryFileData = null;
|
||||
/// <summary>
|
||||
/// Internal member storing the number of topic nodes including the contents and index files
|
||||
/// </summary>
|
||||
private int _numberOfTopicNodes = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the offset in the #STRINGS file of the ImageList param of the "text/site properties" object of the sitemap contents
|
||||
/// </summary>
|
||||
private int _imageListOffset = 0;
|
||||
/// <summary>
|
||||
/// True if the value of the ImageType param of the "text/site properties" object of the sitemap contents is "Folder".
|
||||
/// </summary>
|
||||
private bool _imageTypeFolder = false;
|
||||
/// <summary>
|
||||
/// Internal member storing the background value
|
||||
/// </summary>
|
||||
private int _background = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the foreground value
|
||||
/// </summary>
|
||||
private int _foreground = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the offset in the #STRINGS file of the Font param of the "text/site properties" object of the sitemap contents
|
||||
/// </summary>
|
||||
private int _fontOffset = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the offset in the #STRINGS file of the FrameName param of the "text/site properties" object of the sitemap contents
|
||||
/// </summary>
|
||||
private int _frameNameOffset = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the offset in the #STRINGS file of the WindowName param of the "text/site properties" object of the sitemap contents
|
||||
/// </summary>
|
||||
private int _windowNameOffset = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the number of merged files
|
||||
/// </summary>
|
||||
private int _numberOfMergedFiles = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the offset in the #STRINGS file of the merged file names
|
||||
/// </summary>
|
||||
private ArrayList _mergedFileOffsets = new ArrayList();
|
||||
/// <summary>
|
||||
/// Internal member storing the associated chmfile object
|
||||
/// </summary>
|
||||
private CHMFile _associatedFile = null;
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="binaryFileData">binary file data of the #IDXHDR file</param>
|
||||
/// <param name="associatedFile">associated CHMFile instance</param>
|
||||
public CHMIdxhdr(byte[] binaryFileData, CHMFile associatedFile)
|
||||
{
|
||||
_binaryFileData = binaryFileData;
|
||||
_associatedFile = associatedFile;
|
||||
DecodeData();
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Decodes the binary file data and fills the internal properties
|
||||
/// </summary>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeData()
|
||||
{
|
||||
bool bRet = true;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(_binaryFileData);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
int nTemp = 0;
|
||||
|
||||
// 4 character T#SM
|
||||
binReader.ReadBytes(4);
|
||||
// unknown timestamp DWORD
|
||||
nTemp = binReader.ReadInt32();
|
||||
|
||||
// unknown 1
|
||||
nTemp = binReader.ReadInt32();
|
||||
|
||||
// number of topic nodes including the contents & index files
|
||||
_numberOfTopicNodes = binReader.ReadInt32();
|
||||
|
||||
// unknown DWORD
|
||||
nTemp = binReader.ReadInt32();
|
||||
|
||||
// offset in the strings file
|
||||
_imageListOffset = binReader.ReadInt32();
|
||||
if( _imageListOffset == 0)
|
||||
_imageListOffset = -1; // 0/-1 = none
|
||||
|
||||
// unknown DWORD
|
||||
nTemp = binReader.ReadInt32();
|
||||
|
||||
// 1 if the value of the ImageType param of the "text/site properties" object of the sitemap contents is "Folder".
|
||||
nTemp = binReader.ReadInt32();
|
||||
_imageTypeFolder = (nTemp == 1);
|
||||
|
||||
// offset in the strings file
|
||||
_background = binReader.ReadInt32();
|
||||
// offset in the strings file
|
||||
_foreground = binReader.ReadInt32();
|
||||
|
||||
// offset in the strings file
|
||||
_fontOffset = binReader.ReadInt32();
|
||||
|
||||
// window styles DWORD
|
||||
nTemp = binReader.ReadInt32();
|
||||
// window styles DWORD
|
||||
nTemp = binReader.ReadInt32();
|
||||
|
||||
// unknown DWORD
|
||||
nTemp = binReader.ReadInt32();
|
||||
|
||||
// offset in the strings file
|
||||
_frameNameOffset = binReader.ReadInt32();
|
||||
if( _frameNameOffset == 0)
|
||||
_frameNameOffset = -1; // 0/-1 = none
|
||||
// offset in the strings file
|
||||
_windowNameOffset = binReader.ReadInt32();
|
||||
if( _windowNameOffset == 0)
|
||||
_windowNameOffset = -1; // 0/-1 = none
|
||||
|
||||
// informations types DWORD
|
||||
nTemp = binReader.ReadInt32();
|
||||
|
||||
// unknown DWORD
|
||||
nTemp = binReader.ReadInt32();
|
||||
|
||||
// number of merged files in the merged file list DWORD
|
||||
_numberOfMergedFiles = binReader.ReadInt32();
|
||||
|
||||
nTemp = binReader.ReadInt32();
|
||||
|
||||
for(int i = 0; i < _numberOfMergedFiles; i++)
|
||||
{
|
||||
// DWORD offset value of merged file
|
||||
nTemp = binReader.ReadInt32();
|
||||
|
||||
if(nTemp > 0)
|
||||
_mergedFileOffsets.Add(nTemp);
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the number of topic nodes including the contents and index files
|
||||
/// </summary>
|
||||
public int NumberOfTopicNodes
|
||||
{
|
||||
get { return _numberOfTopicNodes; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the offset in the #STRINGS file of the ImageList
|
||||
/// param of the "text/site properties" object of the sitemap contents
|
||||
/// </summary>
|
||||
public int ImageListOffset
|
||||
{
|
||||
get { return _imageListOffset; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// True if the value of the ImageType param of the
|
||||
/// "text/site properties" object of the sitemap contents is "Folder".
|
||||
/// </summary>
|
||||
/// <remarks>If this is set to true, the help will display folders instead of books</remarks>
|
||||
public bool ImageTypeFolder
|
||||
{
|
||||
get { return _imageTypeFolder; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the background setting
|
||||
/// </summary>
|
||||
public int Background
|
||||
{
|
||||
get { return _background; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the foreground setting
|
||||
/// </summary>
|
||||
public int Foreground
|
||||
{
|
||||
get { return _foreground; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the offset in the #STRINGS file of the Font
|
||||
/// param of the "text/site properties" object of the sitemap contents
|
||||
/// </summary>
|
||||
public int WindowNameOffset
|
||||
{
|
||||
get { return _fontOffset; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the offset in the #STRINGS file of the FrameName
|
||||
/// param of the "text/site properties" object of the sitemap contents
|
||||
/// </summary>
|
||||
public int FrameNameOffset
|
||||
{
|
||||
get { return _frameNameOffset; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the offset in the #STRINGS file of the WindowName
|
||||
/// param of the "text/site properties" object of the sitemap contents
|
||||
/// </summary>
|
||||
public int FontOffset
|
||||
{
|
||||
get { return _windowNameOffset; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets an array list of offset numbers in the #STRINGS file of the
|
||||
/// merged file names.
|
||||
/// </summary>
|
||||
public ArrayList MergedFileOffsets
|
||||
{
|
||||
get { return _mergedFileOffsets; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Implement IDisposable.
|
||||
/// </summary>
|
||||
public void Dispose()
|
||||
{
|
||||
Dispose(true);
|
||||
// This object will be cleaned up by the Dispose method.
|
||||
// Therefore, you should call GC.SupressFinalize to
|
||||
// take this object off the finalization queue
|
||||
// and prevent finalization code for this object
|
||||
// from executing a second time.
|
||||
GC.SuppressFinalize(this);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Dispose(bool disposing) executes in two distinct scenarios.
|
||||
/// If disposing equals true, the method has been called directly
|
||||
/// or indirectly by a user's code. Managed and unmanaged resources
|
||||
/// can be disposed.
|
||||
/// If disposing equals false, the method has been called by the
|
||||
/// runtime from inside the finalizer and you should not reference
|
||||
/// other objects. Only unmanaged resources can be disposed.
|
||||
/// </summary>
|
||||
/// <param name="disposing">disposing flag</param>
|
||||
private void Dispose(bool disposing)
|
||||
{
|
||||
// Check to see if Dispose has already been called.
|
||||
if(!this.disposed)
|
||||
{
|
||||
// If disposing equals true, dispose all managed
|
||||
// and unmanaged resources.
|
||||
if(disposing)
|
||||
{
|
||||
// Dispose managed resources.
|
||||
_binaryFileData = null;
|
||||
_mergedFileOffsets = null;
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
disposed = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
256
irc/TechBot/CHMLibrary/CHMDecoding/CHMStrings.cs
Normal file
256
irc/TechBot/CHMLibrary/CHMDecoding/CHMStrings.cs
Normal file
@@ -0,0 +1,256 @@
|
||||
using System;
|
||||
using System.IO;
|
||||
using System.Collections;
|
||||
using System.Collections.Specialized;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>CHMStrings</c> implements a string collection read from the #STRINGS file
|
||||
/// </summary>
|
||||
internal sealed class CHMStrings : IDisposable
|
||||
{
|
||||
/// <summary>
|
||||
/// Constant specifying the size of the string blocks
|
||||
/// </summary>
|
||||
private const int STRING_BLOCK_SIZE = 4096;
|
||||
/// <summary>
|
||||
/// Internal flag specifying if the object is going to be disposed
|
||||
/// </summary>
|
||||
private bool disposed = false;
|
||||
/// <summary>
|
||||
/// Internal member storing the binary file data
|
||||
/// </summary>
|
||||
private byte[] _binaryFileData = null;
|
||||
/// <summary>
|
||||
/// Internal member storing the string dictionary
|
||||
/// </summary>
|
||||
private Hashtable _stringDictionary = new Hashtable();
|
||||
/// <summary>
|
||||
/// Internal member storing the associated chmfile object
|
||||
/// </summary>
|
||||
private CHMFile _associatedFile = null;
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="binaryFileData">binary file data of the #STRINGS file</param>
|
||||
/// <param name="associatedFile">associated chm file</param>
|
||||
public CHMStrings(byte[] binaryFileData, CHMFile associatedFile)
|
||||
{
|
||||
_binaryFileData = binaryFileData;
|
||||
_associatedFile = associatedFile;
|
||||
DecodeData();
|
||||
}
|
||||
|
||||
|
||||
/// <summary>
|
||||
/// Standard constructor
|
||||
/// </summary>
|
||||
internal CHMStrings()
|
||||
{
|
||||
}
|
||||
|
||||
#region Data dumping
|
||||
/// <summary>
|
||||
/// Dump the class data to a binary writer
|
||||
/// </summary>
|
||||
/// <param name="writer">writer to write the data</param>
|
||||
internal void Dump(ref BinaryWriter writer)
|
||||
{
|
||||
writer.Write( _stringDictionary.Count );
|
||||
|
||||
if (_stringDictionary.Count != 0)
|
||||
{
|
||||
IDictionaryEnumerator iDictionaryEnumerator = _stringDictionary.GetEnumerator();
|
||||
while (iDictionaryEnumerator.MoveNext())
|
||||
{
|
||||
DictionaryEntry dictionaryEntry = (DictionaryEntry)iDictionaryEnumerator.Current;
|
||||
writer.Write( Int32.Parse(dictionaryEntry.Key.ToString()) );
|
||||
writer.Write( dictionaryEntry.Value.ToString() );
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Reads the object data from a dump store
|
||||
/// </summary>
|
||||
/// <param name="reader">reader to read the data</param>
|
||||
internal void ReadDump(ref BinaryReader reader)
|
||||
{
|
||||
int nCnt = reader.ReadInt32();
|
||||
|
||||
for(int i=0; i<nCnt;i++)
|
||||
{
|
||||
int nKey = reader.ReadInt32();
|
||||
string sValue = reader.ReadString();
|
||||
|
||||
_stringDictionary[nKey.ToString()] = sValue;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Sets the associated CHMFile instance
|
||||
/// </summary>
|
||||
/// <param name="associatedFile">instance to set</param>
|
||||
internal void SetCHMFile(CHMFile associatedFile)
|
||||
{
|
||||
_associatedFile = associatedFile;
|
||||
}
|
||||
#endregion
|
||||
|
||||
/// <summary>
|
||||
/// Decodes the binary file data and fills the internal properties
|
||||
/// </summary>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeData()
|
||||
{
|
||||
bool bRet = true;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(_binaryFileData);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
//binReader.ReadByte(); // file starts with a NULL character for 0-based offset indexing
|
||||
|
||||
int nStringOffset = 0;
|
||||
int nSubsetOffset = 0;
|
||||
|
||||
while( (memStream.Position < memStream.Length) && (bRet) )
|
||||
{
|
||||
nStringOffset = (int)memStream.Position;
|
||||
byte [] stringBlock = binReader.ReadBytes(STRING_BLOCK_SIZE);
|
||||
bRet &= DecodeBlock(stringBlock, ref nStringOffset, ref nSubsetOffset);
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Decodes a string block
|
||||
/// </summary>
|
||||
/// <param name="stringBlock">byte array which represents the string block</param>
|
||||
/// <param name="nStringOffset">current string offset number</param>
|
||||
/// <param name="nSubsetOffset">reference to a subset variable</param>
|
||||
/// <returns>true if succeeded</returns>
|
||||
/// <remarks>If a string crosses the end of a block then it will be cut off
|
||||
/// without a NT and repeated in full, with a NT, at the start of the next block.
|
||||
/// For eg "To customize the appearance of a contents file" might become
|
||||
/// "To customize the (block ending)To customize the appearance of a contents file"
|
||||
/// when there are 17 bytes left at the end of the block. </remarks>
|
||||
private bool DecodeBlock( byte[] stringBlock, ref int nStringOffset, ref int nSubsetOffset)
|
||||
{
|
||||
bool bRet = true;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(stringBlock);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
while( (memStream.Position < memStream.Length) && (bRet) )
|
||||
{
|
||||
bool bFoundTerminator = false;
|
||||
|
||||
int nCurOffset = nStringOffset + (int)memStream.Position;
|
||||
|
||||
string sTemp = BinaryReaderHelp.ExtractString(ref binReader, ref bFoundTerminator, 0, true, _associatedFile.TextEncoding);
|
||||
|
||||
if(nSubsetOffset != 0)
|
||||
{
|
||||
_stringDictionary[nSubsetOffset.ToString()] = sTemp.ToString();
|
||||
}
|
||||
else
|
||||
{
|
||||
_stringDictionary[nCurOffset.ToString()] = sTemp.ToString();
|
||||
}
|
||||
|
||||
if( bFoundTerminator )
|
||||
{
|
||||
nSubsetOffset = 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
nSubsetOffset = nCurOffset;
|
||||
}
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Indexer which returns the string at a given offset
|
||||
/// </summary>
|
||||
public string this[int offset]
|
||||
{
|
||||
get
|
||||
{
|
||||
if(offset == -1)
|
||||
return String.Empty;
|
||||
|
||||
string sTemp = (string)_stringDictionary[ offset.ToString() ];
|
||||
|
||||
if(sTemp == null)
|
||||
return String.Empty;
|
||||
|
||||
return sTemp;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Indexer which returns the string at a given offset
|
||||
/// </summary>
|
||||
public string this[string offset]
|
||||
{
|
||||
get
|
||||
{
|
||||
if(offset == "-1")
|
||||
return String.Empty;
|
||||
|
||||
string sTemp = (string)_stringDictionary[ offset ];
|
||||
|
||||
if(sTemp == null)
|
||||
return String.Empty;
|
||||
|
||||
return sTemp;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Implement IDisposable.
|
||||
/// </summary>
|
||||
public void Dispose()
|
||||
{
|
||||
Dispose(true);
|
||||
// This object will be cleaned up by the Dispose method.
|
||||
// Therefore, you should call GC.SupressFinalize to
|
||||
// take this object off the finalization queue
|
||||
// and prevent finalization code for this object
|
||||
// from executing a second time.
|
||||
GC.SuppressFinalize(this);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Dispose(bool disposing) executes in two distinct scenarios.
|
||||
/// If disposing equals true, the method has been called directly
|
||||
/// or indirectly by a user's code. Managed and unmanaged resources
|
||||
/// can be disposed.
|
||||
/// If disposing equals false, the method has been called by the
|
||||
/// runtime from inside the finalizer and you should not reference
|
||||
/// other objects. Only unmanaged resources can be disposed.
|
||||
/// </summary>
|
||||
/// <param name="disposing">disposing flag</param>
|
||||
private void Dispose(bool disposing)
|
||||
{
|
||||
// Check to see if Dispose has already been called.
|
||||
if(!this.disposed)
|
||||
{
|
||||
// If disposing equals true, dispose all managed
|
||||
// and unmanaged resources.
|
||||
if(disposing)
|
||||
{
|
||||
// Dispose managed resources.
|
||||
_binaryFileData = null;
|
||||
_stringDictionary = null;
|
||||
}
|
||||
}
|
||||
disposed = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
821
irc/TechBot/CHMLibrary/CHMDecoding/CHMSystem.cs
Normal file
821
irc/TechBot/CHMLibrary/CHMDecoding/CHMSystem.cs
Normal file
@@ -0,0 +1,821 @@
|
||||
using System;
|
||||
using System.Collections;
|
||||
using System.Diagnostics;
|
||||
using System.IO;
|
||||
using System.Text;
|
||||
using System.Globalization;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>CHMSystem</c> reads the #SYSTEM file of the chm and stores its settings
|
||||
/// </summary>
|
||||
internal sealed class CHMSystem : IDisposable
|
||||
{
|
||||
/// <summary>
|
||||
/// Internal flag specifying if the object is going to be disposed
|
||||
/// </summary>
|
||||
private bool disposed = false;
|
||||
/// <summary>
|
||||
/// Internal member storing the binary file data
|
||||
/// </summary>
|
||||
private byte[] _binaryFileData = null;
|
||||
/// <summary>
|
||||
/// Internal member storing the file version
|
||||
/// </summary>
|
||||
private int _fileVersion = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the contents file path
|
||||
/// </summary>
|
||||
private string _contentsFile = "";
|
||||
/// <summary>
|
||||
/// Internal member storing the index file path
|
||||
/// </summary>
|
||||
private string _indexFile = "";
|
||||
/// <summary>
|
||||
/// Internal member storing the default help topic
|
||||
/// </summary>
|
||||
private string _defaultTopic = "";
|
||||
/// <summary>
|
||||
/// Internal member storing the help-window title
|
||||
/// </summary>
|
||||
private string _title = "";
|
||||
/// <summary>
|
||||
/// Internal flag if dbcs is on
|
||||
/// </summary>
|
||||
private bool _dbcs = false;
|
||||
/// <summary>
|
||||
/// Internal flag if fulltext search is enabled
|
||||
/// </summary>
|
||||
private bool _fullTextSearch = false;
|
||||
/// <summary>
|
||||
/// Internal flag if KLinks are in the file
|
||||
/// </summary>
|
||||
private bool _hasKLinks = false;
|
||||
/// <summary>
|
||||
/// Internal flag if ALinks are in the file
|
||||
/// </summary>
|
||||
private bool _hasALinks = false;
|
||||
/// <summary>
|
||||
/// Internal member storing the name of the default window
|
||||
/// </summary>
|
||||
private string _defaultWindow = "";
|
||||
/// <summary>
|
||||
/// Internal member storing the filename of the compiled file
|
||||
/// </summary>
|
||||
private string _compileFile = "";
|
||||
/// <summary>
|
||||
/// Internal flag storing the offset value of the binary index
|
||||
/// </summary>
|
||||
private uint _binaryIndexURLTableID = 0;
|
||||
/// <summary>
|
||||
/// Inernal member storing the compiler version this file was compiled
|
||||
/// </summary>
|
||||
private string _compilerVersion = "";
|
||||
/// <summary>
|
||||
/// Internal flag storing the offset value of the binary TOC
|
||||
/// </summary>
|
||||
private uint _binaryTOCURLTableID = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the associated chmfile object
|
||||
/// </summary>
|
||||
private CHMFile _associatedFile = null;
|
||||
/// <summary>
|
||||
/// Internal member storing the default fontface, size, charset
|
||||
/// </summary>
|
||||
private string _defaultFont = "";
|
||||
/// <summary>
|
||||
/// Internal member storing the culture info of the file
|
||||
/// </summary>
|
||||
private CultureInfo _culture;
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="binaryFileData">binary file data of the #SYSTEM file</param>
|
||||
/// <param name="associatedFile">associated chm file</param>
|
||||
public CHMSystem(byte[] binaryFileData, CHMFile associatedFile)
|
||||
{
|
||||
_binaryFileData = binaryFileData;
|
||||
_associatedFile = associatedFile;
|
||||
DecodeData();
|
||||
|
||||
if(_culture == null)
|
||||
{
|
||||
// Set the text encoder of the chm file to the read charset/codepage
|
||||
_associatedFile.TextEncoding = Encoding.GetEncoding( this.CodePage );
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Decodes the binary file data and fills the internal properties
|
||||
/// </summary>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeData()
|
||||
{
|
||||
bool bRet = true;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(_binaryFileData);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
// First entry = DWORD for version number
|
||||
_fileVersion = (int) binReader.ReadInt32();
|
||||
|
||||
while( (memStream.Position < memStream.Length) && (bRet) )
|
||||
{
|
||||
bRet &= DecodeEntry(ref binReader);
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Decodes an #system file entry
|
||||
/// </summary>
|
||||
/// <param name="binReader">binary reader reference</param>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeEntry(ref BinaryReader binReader)
|
||||
{
|
||||
bool bRet = true;
|
||||
|
||||
int code = (int) binReader.ReadInt16(); // entry code, WORD
|
||||
int length = (int) binReader.ReadInt16(); // length of entry
|
||||
|
||||
switch(code)
|
||||
{
|
||||
case 0:
|
||||
{
|
||||
_contentsFile = BinaryReaderHelp.ExtractString(ref binReader,length, 0, true, _associatedFile.TextEncoding);
|
||||
};break;
|
||||
case 1:
|
||||
{
|
||||
_indexFile = BinaryReaderHelp.ExtractString(ref binReader,length, 0, true, _associatedFile.TextEncoding);
|
||||
};break;
|
||||
case 2:
|
||||
{
|
||||
_defaultTopic = BinaryReaderHelp.ExtractString(ref binReader,length, 0, true, _associatedFile.TextEncoding);
|
||||
};break;
|
||||
case 3:
|
||||
{
|
||||
_title = BinaryReaderHelp.ExtractString(ref binReader,length, 0, true, _associatedFile.TextEncoding);
|
||||
};break;
|
||||
case 4:
|
||||
{
|
||||
int nTemp = 0;
|
||||
nTemp = binReader.ReadInt32(); // read DWORD LCID
|
||||
_culture = new CultureInfo(nTemp);
|
||||
|
||||
if(_culture != null)
|
||||
_associatedFile.TextEncoding = Encoding.GetEncoding(_culture.TextInfo.ANSICodePage);
|
||||
|
||||
nTemp = binReader.ReadInt32(); // read DWORD DBCS
|
||||
_dbcs = (nTemp == 1);
|
||||
|
||||
nTemp = binReader.ReadInt32(); // read DWORD Fulltext search
|
||||
_fullTextSearch = (nTemp == 1);
|
||||
|
||||
nTemp = binReader.ReadInt32(); // read DWORD has klinks
|
||||
_hasKLinks = (nTemp != 0);
|
||||
|
||||
nTemp = binReader.ReadInt32(); // read DWORD has alinks
|
||||
_hasALinks = (nTemp != 0);
|
||||
|
||||
// read the rest of code 4 (not important for us)
|
||||
byte[] temp = new byte[length-(5*4)];
|
||||
temp = binReader.ReadBytes(length-(5*4));
|
||||
};break;
|
||||
case 5:
|
||||
{
|
||||
_defaultWindow = BinaryReaderHelp.ExtractString(ref binReader,length, 0, true, _associatedFile.TextEncoding);
|
||||
};break;
|
||||
case 6:
|
||||
{
|
||||
_compileFile = BinaryReaderHelp.ExtractString(ref binReader,length, 0, true, _associatedFile.TextEncoding);
|
||||
};break;
|
||||
case 7:
|
||||
{
|
||||
if(_fileVersion > 2)
|
||||
{
|
||||
_binaryIndexURLTableID = (uint) binReader.ReadInt32();
|
||||
}
|
||||
else
|
||||
{
|
||||
byte[] read = binReader.ReadBytes(length);
|
||||
int i=read.Length;
|
||||
}
|
||||
};break;
|
||||
case 8:
|
||||
{
|
||||
// abbreviation (not interresting for us)
|
||||
byte[] read = binReader.ReadBytes(length);
|
||||
int i=read.Length;
|
||||
};break;
|
||||
case 9:
|
||||
{
|
||||
_compilerVersion = BinaryReaderHelp.ExtractString(ref binReader,length, 0, true, _associatedFile.TextEncoding);
|
||||
};break;
|
||||
case 10:
|
||||
{
|
||||
// timestamp of the file (not interresting for us)
|
||||
byte[] read = binReader.ReadBytes(length);
|
||||
int i=read.Length;
|
||||
};break;
|
||||
case 11:
|
||||
{
|
||||
if(_fileVersion > 2)
|
||||
{
|
||||
_binaryTOCURLTableID = (uint) binReader.ReadInt32();
|
||||
}
|
||||
else
|
||||
{
|
||||
byte[] read = binReader.ReadBytes(length);
|
||||
int i=read.Length;
|
||||
}
|
||||
};break;
|
||||
case 12:
|
||||
{
|
||||
// number of information bytes
|
||||
byte[] read = binReader.ReadBytes(length);
|
||||
int i=read.Length;
|
||||
};break;
|
||||
case 13:
|
||||
{
|
||||
// copy of file #idxhdr
|
||||
byte[] read = binReader.ReadBytes(length);
|
||||
int i=read.Length;
|
||||
};break;
|
||||
case 14:
|
||||
{
|
||||
// custom tabs for HH viewer
|
||||
byte[] read = binReader.ReadBytes(length);
|
||||
int i=read.Length;
|
||||
};break;
|
||||
case 15:
|
||||
{
|
||||
// a checksum
|
||||
byte[] read = binReader.ReadBytes(length);
|
||||
int i=read.Length;
|
||||
};break;
|
||||
case 16:
|
||||
{
|
||||
// Default Font=string,number,number
|
||||
// The string is the name of the font, the first number is the
|
||||
// point size & the last number is the character set used by the font.
|
||||
// For acceptable values see *_CHARSET defines in wingdi.h from the
|
||||
// Windows SDK or the same file in MinGW or Wine.
|
||||
// Most of the time you will only want to use 0, which is the value for ANSI,
|
||||
// which is the subset of ASCII used by Windows.
|
||||
_defaultFont = BinaryReaderHelp.ExtractString(ref binReader,length, 0, true, _associatedFile.TextEncoding);
|
||||
|
||||
};break;
|
||||
default:
|
||||
{
|
||||
byte[] temp = new byte[length];
|
||||
temp = binReader.ReadBytes(length);
|
||||
//bRet = false;
|
||||
int i=temp.Length;
|
||||
};break;
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Reads all HHC files and checks which one has the global object tag.
|
||||
/// This hhc file will be returned as master hhc
|
||||
/// </summary>
|
||||
/// <param name="hhcTopics">list of topics containing the extension hhc</param>
|
||||
/// <param name="TopicItemArrayList">true if the arraylist contains topic items</param>
|
||||
/// <returns>the filename of the found master toc</returns>
|
||||
private string GetMasterHHC(ArrayList hhcTopics, bool TopicItemArrayList)
|
||||
{
|
||||
string sRet = "";
|
||||
|
||||
if( (hhcTopics!=null) && (hhcTopics.Count > 0) )
|
||||
{
|
||||
if( TopicItemArrayList )
|
||||
{
|
||||
if(hhcTopics.Count == 1)
|
||||
{
|
||||
sRet = ((TopicEntry)hhcTopics[0]).Locale;
|
||||
}
|
||||
else
|
||||
{
|
||||
foreach(TopicEntry curEntry in hhcTopics)
|
||||
{
|
||||
CHMStream.CHMStream iw=null;
|
||||
MemoryStream fileObject=null;
|
||||
|
||||
if( _associatedFile.CurrentStorageWrapper == null)
|
||||
{
|
||||
iw=new CHMStream.CHMStream();
|
||||
iw.OpenCHM(_associatedFile.ChmFilePath);
|
||||
}
|
||||
else
|
||||
{
|
||||
iw = _associatedFile.CurrentStorageWrapper;
|
||||
}
|
||||
|
||||
fileObject = iw.OpenStream(curEntry.Locale);
|
||||
if( fileObject != null)
|
||||
{
|
||||
string fileString =_associatedFile.TextEncoding.GetString(fileObject.ToArray(),0,(int)fileObject.Length);
|
||||
fileObject.Close();
|
||||
|
||||
if( HHCParser.HasGlobalObjectTag(fileString, _associatedFile) )
|
||||
{
|
||||
sRet = curEntry.Locale;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if(hhcTopics.Count == 1)
|
||||
{
|
||||
sRet = ((string)hhcTopics[0]);
|
||||
}
|
||||
else
|
||||
{
|
||||
foreach(string curEntry in hhcTopics)
|
||||
{
|
||||
CHMStream.CHMStream iw=null;
|
||||
MemoryStream fileObject=null;
|
||||
|
||||
if( _associatedFile.CurrentStorageWrapper == null)
|
||||
{
|
||||
iw=new CHMStream.CHMStream();
|
||||
iw.OpenCHM(_associatedFile.ChmFilePath);
|
||||
}
|
||||
else
|
||||
{
|
||||
iw = _associatedFile.CurrentStorageWrapper;
|
||||
}
|
||||
|
||||
fileObject = iw.OpenStream(curEntry);
|
||||
if( fileObject != null)
|
||||
{
|
||||
string fileString =_associatedFile.TextEncoding.GetString(fileObject.ToArray(),0,(int)fileObject.Length);
|
||||
fileObject.Close();
|
||||
|
||||
if( HHCParser.HasGlobalObjectTag(fileString, _associatedFile) )
|
||||
{
|
||||
sRet = curEntry;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return sRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the file version of the chm file.
|
||||
/// 2 for Compatibility=1.0, 3 for Compatibility=1.1
|
||||
/// </summary>
|
||||
public int FileVersion
|
||||
{
|
||||
get { return _fileVersion; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the contents file name
|
||||
/// </summary>
|
||||
public string ContentsFile
|
||||
{
|
||||
get
|
||||
{
|
||||
if( BinaryTOC ) // if the file contains a binary TOC
|
||||
{
|
||||
// make sure the CHMFile instance exists and has loaded the file #URLTBL
|
||||
if( (_associatedFile != null) && (_associatedFile.UrltblFile != null ) )
|
||||
{
|
||||
// Get an url-table entry by its unique id
|
||||
UrlTableEntry entry = _associatedFile.UrltblFile.GetByUniqueID( this.BinaryTOCURLTableID );
|
||||
if(entry != null)
|
||||
{
|
||||
// entry found, return the url ( = filename )
|
||||
return entry.URL;
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if(_contentsFile.Length <= 0)
|
||||
{
|
||||
string sCheck = "Table of Contents.hhc"; // default HHP contents filename
|
||||
|
||||
if( (_associatedFile != null) && (_associatedFile.TopicsFile != null ) )
|
||||
{
|
||||
TopicEntry te = _associatedFile.TopicsFile.GetByLocale( sCheck );
|
||||
|
||||
if( te == null)
|
||||
{
|
||||
sCheck = "toc.hhc"; // default HHP contents filename
|
||||
|
||||
te = _associatedFile.TopicsFile.GetByLocale( sCheck );
|
||||
|
||||
if( te == null)
|
||||
{
|
||||
sCheck = CompileFile + ".hhc";
|
||||
|
||||
te = _associatedFile.TopicsFile.GetByLocale( sCheck );
|
||||
|
||||
if( te == null)
|
||||
{
|
||||
ArrayList arrExt = _associatedFile.TopicsFile.GetByExtension("hhc");
|
||||
|
||||
if( arrExt == null )
|
||||
{
|
||||
arrExt = _associatedFile.EnumFilesByExtension("hhc");
|
||||
|
||||
if( arrExt == null )
|
||||
{
|
||||
Debug.WriteLine("CHMSystem.ContentsFile - Failed, contents file not found !");
|
||||
}
|
||||
else
|
||||
{
|
||||
if(arrExt.Count > 1)
|
||||
{
|
||||
sCheck = GetMasterHHC(arrExt, false);
|
||||
_contentsFile = sCheck;
|
||||
}
|
||||
else
|
||||
{
|
||||
_contentsFile = ((string)arrExt[0]);
|
||||
sCheck = _contentsFile;
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if(arrExt.Count > 1)
|
||||
{
|
||||
sCheck = GetMasterHHC(arrExt, true);
|
||||
_contentsFile = sCheck;
|
||||
}
|
||||
else
|
||||
{
|
||||
_contentsFile = ((TopicEntry)arrExt[0]).Locale;
|
||||
sCheck = _contentsFile;
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
_contentsFile = sCheck;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
_contentsFile = sCheck;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
_contentsFile = sCheck;
|
||||
}
|
||||
}
|
||||
|
||||
return sCheck;
|
||||
}
|
||||
}
|
||||
|
||||
return _contentsFile;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the index file name
|
||||
/// </summary>
|
||||
public string IndexFile
|
||||
{
|
||||
get
|
||||
{
|
||||
if( BinaryIndex ) // if the file contains a binary index
|
||||
{
|
||||
// make sure the CHMFile instance exists and has loaded the file #URLTBL
|
||||
if( (_associatedFile != null) && (_associatedFile.UrltblFile != null ) )
|
||||
{
|
||||
// Get an url-table entry by its unique id
|
||||
UrlTableEntry entry = _associatedFile.UrltblFile.GetByUniqueID( this.BinaryIndexURLTableID );
|
||||
if(entry != null)
|
||||
{
|
||||
// entry found, return the url ( = filename )
|
||||
return entry.URL;
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if(_indexFile.Length <= 0)
|
||||
{
|
||||
string sCheck = "Index.hhk"; // default HHP index filename
|
||||
|
||||
if( (_associatedFile != null) && (_associatedFile.TopicsFile != null ) )
|
||||
{
|
||||
TopicEntry te = _associatedFile.TopicsFile.GetByLocale( sCheck );
|
||||
|
||||
if( te == null)
|
||||
{
|
||||
sCheck = CompileFile + ".hhk";
|
||||
|
||||
te = _associatedFile.TopicsFile.GetByLocale( sCheck );
|
||||
|
||||
if( te == null)
|
||||
{
|
||||
ArrayList arrExt = _associatedFile.TopicsFile.GetByExtension("hhk");
|
||||
|
||||
if( arrExt == null )
|
||||
{
|
||||
Debug.WriteLine("CHMSystem.IndexFile - Failed, index file not found !");
|
||||
}
|
||||
else
|
||||
{
|
||||
_indexFile = ((TopicEntry)arrExt[0]).Locale;
|
||||
sCheck = _indexFile;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
_indexFile = sCheck;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
_indexFile = sCheck;
|
||||
}
|
||||
}
|
||||
|
||||
return sCheck;
|
||||
}
|
||||
}
|
||||
return _indexFile;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Sets the default topic of this file
|
||||
/// </summary>
|
||||
/// <param name="local">new local value of the topic</param>
|
||||
internal void SetDefaultTopic(string local)
|
||||
{
|
||||
_defaultTopic = local;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the default help topic
|
||||
/// </summary>
|
||||
public string DefaultTopic
|
||||
{
|
||||
get { return _defaultTopic; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the title of the help window
|
||||
/// </summary>
|
||||
public string Title
|
||||
{
|
||||
get { return _title; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if DBCS is in use
|
||||
/// </summary>
|
||||
public bool DBCS
|
||||
{
|
||||
get { return _dbcs; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if full-text-search is available
|
||||
/// </summary>
|
||||
public bool FullTextSearch
|
||||
{
|
||||
get { return _fullTextSearch; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the file has ALinks
|
||||
/// </summary>
|
||||
public bool HasALinks
|
||||
{
|
||||
get { return _hasALinks; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the file has KLinks
|
||||
/// </summary>
|
||||
public bool HasKLinks
|
||||
{
|
||||
get { return _hasKLinks; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the default window name
|
||||
/// </summary>
|
||||
public string DefaultWindow
|
||||
{
|
||||
get { return _defaultWindow; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the file name of the compile file
|
||||
/// </summary>
|
||||
public string CompileFile
|
||||
{
|
||||
get { return _compileFile; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the id of the binary index in the url table
|
||||
/// </summary>
|
||||
public uint BinaryIndexURLTableID
|
||||
{
|
||||
get { return _binaryIndexURLTableID; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the chm has a binary index file
|
||||
/// </summary>
|
||||
public bool BinaryIndex
|
||||
{
|
||||
get { return (_binaryIndexURLTableID>0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the chm has a binary index file
|
||||
/// </summary>
|
||||
public string CompilerVersion
|
||||
{
|
||||
get { return _compilerVersion; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the id of the binary toc in the url table
|
||||
/// </summary>
|
||||
public uint BinaryTOCURLTableID
|
||||
{
|
||||
get { return _binaryTOCURLTableID; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the chm has a binary toc file
|
||||
/// </summary>
|
||||
public bool BinaryTOC
|
||||
{
|
||||
get { return (_binaryTOCURLTableID>0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the font face of the read font property.
|
||||
/// Empty string for default font.
|
||||
/// </summary>
|
||||
public string FontFace
|
||||
{
|
||||
get
|
||||
{
|
||||
if( _defaultFont.Length > 0)
|
||||
{
|
||||
string [] fontSplit = _defaultFont.Split( new char[]{','});
|
||||
if(fontSplit.Length > 0)
|
||||
return fontSplit[0].Trim();
|
||||
}
|
||||
|
||||
return "";
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the font size of the read font property.
|
||||
/// 0 for default font size
|
||||
/// </summary>
|
||||
public double FontSize
|
||||
{
|
||||
get
|
||||
{
|
||||
if( _defaultFont.Length > 0)
|
||||
{
|
||||
string [] fontSplit = _defaultFont.Split( new char[]{','});
|
||||
if(fontSplit.Length > 1)
|
||||
return double.Parse(fontSplit[1].Trim());
|
||||
}
|
||||
|
||||
return 0.0;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the character set of the read font property
|
||||
/// 1 for default
|
||||
/// </summary>
|
||||
public int CharacterSet
|
||||
{
|
||||
get
|
||||
{
|
||||
if( _defaultFont.Length > 0)
|
||||
{
|
||||
string [] fontSplit = _defaultFont.Split( new char[]{','});
|
||||
if(fontSplit.Length > 2)
|
||||
return Int32.Parse(fontSplit[2].Trim());
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the codepage depending on the read font property
|
||||
/// </summary>
|
||||
public int CodePage
|
||||
{
|
||||
get
|
||||
{
|
||||
// if we've read a LCID from the system file
|
||||
// ignore the font-property settings and return
|
||||
// the codepage generated from the culture info
|
||||
if(_culture != null)
|
||||
{
|
||||
return _culture.TextInfo.ANSICodePage;
|
||||
}
|
||||
|
||||
int nRet = 1252; // default codepage windows-1252
|
||||
|
||||
int nCSet = CharacterSet;
|
||||
|
||||
switch(nCSet)
|
||||
{
|
||||
case 0x00: nRet = 1252;break; // ANSI_CHARSET
|
||||
case 0xCC: nRet = 1251;break; // RUSSIAN_CHARSET
|
||||
case 0xEE: nRet = 1250;break; // EE_CHARSET
|
||||
case 0xA1: nRet = 1253;break; // GREEK_CHARSET
|
||||
case 0xA2: nRet = 1254;break; // TURKISH_CHARSET
|
||||
case 0xBA: nRet = 1257;break; // BALTIC_CHARSET
|
||||
case 0xB1: nRet = 1255;break; // HEBREW_CHARSET
|
||||
case 0xB2: nRet = 1256;break; // ARABIC_CHARSET
|
||||
case 0x80: nRet = 932;break; // SHIFTJIS_CHARSET
|
||||
case 0x81: nRet = 949;break; // HANGEUL_CHARSET
|
||||
case 0x86: nRet = 936;break; // GB2313_CHARSET
|
||||
case 0x88: nRet = 950;break; // CHINESEBIG5_CHARSET
|
||||
}
|
||||
|
||||
return nRet;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the assiciated culture info
|
||||
/// </summary>
|
||||
public CultureInfo Culture
|
||||
{
|
||||
get { return _culture; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Implement IDisposable.
|
||||
/// </summary>
|
||||
public void Dispose()
|
||||
{
|
||||
Dispose(true);
|
||||
// This object will be cleaned up by the Dispose method.
|
||||
// Therefore, you should call GC.SupressFinalize to
|
||||
// take this object off the finalization queue
|
||||
// and prevent finalization code for this object
|
||||
// from executing a second time.
|
||||
GC.SuppressFinalize(this);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Dispose(bool disposing) executes in two distinct scenarios.
|
||||
/// If disposing equals true, the method has been called directly
|
||||
/// or indirectly by a user's code. Managed and unmanaged resources
|
||||
/// can be disposed.
|
||||
/// If disposing equals false, the method has been called by the
|
||||
/// runtime from inside the finalizer and you should not reference
|
||||
/// other objects. Only unmanaged resources can be disposed.
|
||||
/// </summary>
|
||||
/// <param name="disposing">disposing flag</param>
|
||||
private void Dispose(bool disposing)
|
||||
{
|
||||
// Check to see if Dispose has already been called.
|
||||
if(!this.disposed)
|
||||
{
|
||||
// If disposing equals true, dispose all managed
|
||||
// and unmanaged resources.
|
||||
if(disposing)
|
||||
{
|
||||
// Dispose managed resources.
|
||||
_binaryFileData = null;
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
disposed = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
288
irc/TechBot/CHMLibrary/CHMDecoding/CHMTocidx.cs
Normal file
288
irc/TechBot/CHMLibrary/CHMDecoding/CHMTocidx.cs
Normal file
@@ -0,0 +1,288 @@
|
||||
using System;
|
||||
using System.IO;
|
||||
using System.Collections;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>CHMTocidx</c> implements functions to decode the #TOCIDX internal file.
|
||||
/// </summary>
|
||||
internal sealed class CHMTocidx : IDisposable
|
||||
{
|
||||
/// <summary>
|
||||
/// Constant specifying the size of the data blocks
|
||||
/// </summary>
|
||||
private const int BLOCK_SIZE = 0x1000;
|
||||
/// <summary>
|
||||
/// Internal flag specifying if the object is going to be disposed
|
||||
/// </summary>
|
||||
private bool disposed = false;
|
||||
/// <summary>
|
||||
/// Internal member storing the binary file data
|
||||
/// </summary>
|
||||
private byte[] _binaryFileData = null;
|
||||
/// <summary>
|
||||
/// Internal memebr storing the offset to the 20/28 byte structs
|
||||
/// </summary>
|
||||
private int _offset2028 = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the offset to the 16 byte structs
|
||||
/// </summary>
|
||||
private int _offset16structs = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the number of 16 byte structs
|
||||
/// </summary>
|
||||
private int _numberOf16structs = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the offset to the topic list
|
||||
/// </summary>
|
||||
private int _offsetOftopics = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the toc
|
||||
/// </summary>
|
||||
private ArrayList _toc = new ArrayList();
|
||||
/// <summary>
|
||||
/// Internal member for offset seeking
|
||||
/// </summary>
|
||||
private Hashtable _offsetTable = new Hashtable();
|
||||
/// <summary>
|
||||
/// Internal member storing the associated chmfile object
|
||||
/// </summary>
|
||||
private CHMFile _associatedFile = null;
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="binaryFileData">binary file data of the #TOCIDX file</param>
|
||||
/// <param name="associatedFile">associated chm file</param>
|
||||
public CHMTocidx(byte[] binaryFileData, CHMFile associatedFile)
|
||||
{
|
||||
_binaryFileData = binaryFileData;
|
||||
_associatedFile = associatedFile;
|
||||
DecodeData();
|
||||
|
||||
// clear internal binary data after extraction
|
||||
_binaryFileData = null;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Decodes the binary file data and fills the internal properties
|
||||
/// </summary>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeData()
|
||||
{
|
||||
_toc = new ArrayList();
|
||||
_offsetTable = new Hashtable();
|
||||
|
||||
bool bRet = true;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(_binaryFileData);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
int nCurOffset = 0;
|
||||
|
||||
_offset2028 = binReader.ReadInt32();
|
||||
_offset16structs = binReader.ReadInt32();
|
||||
_numberOf16structs = binReader.ReadInt32();
|
||||
_offsetOftopics = binReader.ReadInt32();
|
||||
|
||||
binReader.BaseStream.Seek( _offset2028, SeekOrigin.Begin );
|
||||
|
||||
if( RecursivelyBuildTree(ref binReader, _offset2028, _toc, null) )
|
||||
{
|
||||
binReader.BaseStream.Seek( _offset16structs, SeekOrigin.Begin );
|
||||
nCurOffset = (int)binReader.BaseStream.Position;
|
||||
|
||||
for(int i=0; i < _numberOf16structs; i++)
|
||||
{
|
||||
int tocOffset = binReader.ReadInt32();
|
||||
int sqNr = binReader.ReadInt32();
|
||||
int topOffset = binReader.ReadInt32();
|
||||
int hhctopicIdx = binReader.ReadInt32();
|
||||
|
||||
nCurOffset = (int)binReader.BaseStream.Position;
|
||||
|
||||
int topicIdx = -1;
|
||||
// if the topic offset is within the range of the stream
|
||||
// and is >= the offset of the first topic dword
|
||||
if((topOffset < (binReader.BaseStream.Length - 4)) && (topOffset >= _offsetOftopics))
|
||||
{
|
||||
// read the index of the topic for this item
|
||||
binReader.BaseStream.Seek( topOffset, SeekOrigin.Begin);
|
||||
topicIdx = binReader.ReadInt32();
|
||||
binReader.BaseStream.Seek( nCurOffset, SeekOrigin.Begin);
|
||||
|
||||
|
||||
TOCItem item = (TOCItem)_offsetTable[tocOffset.ToString()];
|
||||
if( item != null)
|
||||
{
|
||||
if(( topicIdx < _associatedFile.TopicsFile.TopicTable.Count)&&(topicIdx>=0))
|
||||
{
|
||||
TopicEntry te = (TopicEntry) (_associatedFile.TopicsFile.TopicTable[topicIdx]);
|
||||
if( (te != null) && (item.TopicOffset < 0) )
|
||||
{
|
||||
item.TopicOffset = te.EntryOffset;
|
||||
}
|
||||
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Recursively reads the binary toc tree from the file
|
||||
/// </summary>
|
||||
/// <param name="binReader">reference to binary reader</param>
|
||||
/// <param name="NodeOffset">offset of the first node in the current level</param>
|
||||
/// <param name="level">arraylist of TOCItems for the current level</param>
|
||||
/// <param name="parentItem">parent item for the item</param>
|
||||
/// <returns>Returns true if succeeded</returns>
|
||||
private bool RecursivelyBuildTree(ref BinaryReader binReader, int NodeOffset, ArrayList level, TOCItem parentItem)
|
||||
{
|
||||
bool bRet = true;
|
||||
int nextOffset=0;
|
||||
|
||||
int nReadOffset = (int)binReader.BaseStream.Position;
|
||||
|
||||
binReader.BaseStream.Seek(NodeOffset, SeekOrigin.Begin);
|
||||
|
||||
do
|
||||
{
|
||||
int nCurOffset = (int)binReader.BaseStream.Position;
|
||||
|
||||
int unkn1 = binReader.ReadInt16(); // unknown
|
||||
int unkn2 = binReader.ReadInt16(); // unknown
|
||||
|
||||
int flag = binReader.ReadInt32();
|
||||
|
||||
int nFolderAdd = 0;
|
||||
|
||||
if((_associatedFile != null) && (_associatedFile.ImageTypeFolder))
|
||||
{
|
||||
// get the value which should be added, to display folders instead of books
|
||||
if(HtmlHelpSystem.UseHH2TreePics)
|
||||
nFolderAdd = 8;
|
||||
else
|
||||
nFolderAdd = 4;
|
||||
}
|
||||
|
||||
int nFolderImgIdx = (HtmlHelpSystem.UseHH2TreePics ? (TOCItem.STD_FOLDER_HH2+nFolderAdd) : (TOCItem.STD_FOLDER_HH1+nFolderAdd));
|
||||
int nFileImgIdx = (HtmlHelpSystem.UseHH2TreePics ? TOCItem.STD_FILE_HH2 : TOCItem.STD_FILE_HH1);
|
||||
|
||||
int stdImage = ((flag & 0x4)!=0) ? nFolderImgIdx : nFileImgIdx;
|
||||
|
||||
int stringOffset = binReader.ReadInt32();
|
||||
|
||||
int ParentOffset = binReader.ReadInt32();
|
||||
nextOffset = binReader.ReadInt32();
|
||||
|
||||
int firstChildOffset = 0;
|
||||
int unkn3=0;
|
||||
|
||||
if( (flag&0x4)!=0 )
|
||||
{
|
||||
firstChildOffset = binReader.ReadInt32();
|
||||
unkn3 = binReader.ReadInt32(); // unknown
|
||||
}
|
||||
|
||||
TOCItem newItem = new TOCItem();
|
||||
newItem.ImageIndex = stdImage;
|
||||
newItem.Offset = nCurOffset;
|
||||
newItem.OffsetNext = nextOffset;
|
||||
newItem.AssociatedFile = _associatedFile;
|
||||
newItem.TocMode = DataMode.Binary;
|
||||
newItem.Parent = parentItem;
|
||||
|
||||
if( (flag&0x08) == 0)
|
||||
{
|
||||
// toc item doesn't have a local value (=> stringOffset = offset of strings file)
|
||||
newItem.Name = _associatedFile.StringsFile[stringOffset];
|
||||
}
|
||||
else
|
||||
{
|
||||
// this item has a topic entry (=> stringOffset = index of topic entry)
|
||||
if((stringOffset < _associatedFile.TopicsFile.TopicTable.Count) && (stringOffset >= 0))
|
||||
{
|
||||
TopicEntry te = (TopicEntry) (_associatedFile.TopicsFile.TopicTable[stringOffset]);
|
||||
if(te != null)
|
||||
{
|
||||
newItem.TopicOffset = te.EntryOffset;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
_offsetTable[nCurOffset.ToString()] = newItem;
|
||||
|
||||
// if this item has children (firstChildOffset > 0)
|
||||
if( firstChildOffset > 0)
|
||||
{
|
||||
bRet &= RecursivelyBuildTree(ref binReader, firstChildOffset, newItem.Children, newItem);
|
||||
}
|
||||
|
||||
level.Add( newItem );
|
||||
|
||||
if(nCurOffset != nextOffset)
|
||||
binReader.BaseStream.Seek(nextOffset, SeekOrigin.Begin);
|
||||
|
||||
}while(nextOffset != 0);
|
||||
|
||||
binReader.BaseStream.Seek(nReadOffset, SeekOrigin.Begin);
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the internal read toc
|
||||
/// </summary>
|
||||
internal ArrayList TOC
|
||||
{
|
||||
get { return _toc; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Implement IDisposable.
|
||||
/// </summary>
|
||||
public void Dispose()
|
||||
{
|
||||
Dispose(true);
|
||||
// This object will be cleaned up by the Dispose method.
|
||||
// Therefore, you should call GC.SupressFinalize to
|
||||
// take this object off the finalization queue
|
||||
// and prevent finalization code for this object
|
||||
// from executing a second time.
|
||||
GC.SuppressFinalize(this);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Dispose(bool disposing) executes in two distinct scenarios.
|
||||
/// If disposing equals true, the method has been called directly
|
||||
/// or indirectly by a user's code. Managed and unmanaged resources
|
||||
/// can be disposed.
|
||||
/// If disposing equals false, the method has been called by the
|
||||
/// runtime from inside the finalizer and you should not reference
|
||||
/// other objects. Only unmanaged resources can be disposed.
|
||||
/// </summary>
|
||||
/// <param name="disposing">disposing flag</param>
|
||||
private void Dispose(bool disposing)
|
||||
{
|
||||
// Check to see if Dispose has already been called.
|
||||
if(!this.disposed)
|
||||
{
|
||||
// If disposing equals true, dispose all managed
|
||||
// and unmanaged resources.
|
||||
if(disposing)
|
||||
{
|
||||
// Dispose managed resources.
|
||||
_binaryFileData = null;
|
||||
_toc = null;
|
||||
_offsetTable = null;
|
||||
}
|
||||
}
|
||||
disposed = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
235
irc/TechBot/CHMLibrary/CHMDecoding/CHMTopics.cs
Normal file
235
irc/TechBot/CHMLibrary/CHMDecoding/CHMTopics.cs
Normal file
@@ -0,0 +1,235 @@
|
||||
using System;
|
||||
using System.IO;
|
||||
using System.Collections;
|
||||
using System.Collections.Specialized;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>CHMTopics</c> implements functionality to decode the #TOPICS internal file
|
||||
/// </summary>
|
||||
internal sealed class CHMTopics : IDisposable
|
||||
{
|
||||
/// <summary>
|
||||
/// Internal flag specifying if the object is going to be disposed
|
||||
/// </summary>
|
||||
private bool disposed = false;
|
||||
/// <summary>
|
||||
/// Internal member storing the binary file data
|
||||
/// </summary>
|
||||
private byte[] _binaryFileData = null;
|
||||
/// <summary>
|
||||
/// Internal member storing the associated chmfile object
|
||||
/// </summary>
|
||||
private CHMFile _associatedFile = null;
|
||||
/// <summary>
|
||||
/// Internal member storing the topic list
|
||||
/// </summary>
|
||||
private ArrayList _topicTable = new ArrayList();
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="binaryFileData">binary file data of the #TOPICS file</param>
|
||||
/// <param name="associatedFile">associated chm file</param>
|
||||
public CHMTopics(byte[] binaryFileData, CHMFile associatedFile)
|
||||
{
|
||||
_binaryFileData = binaryFileData;
|
||||
_associatedFile = associatedFile;
|
||||
DecodeData();
|
||||
|
||||
// clear internal binary data after extraction
|
||||
_binaryFileData = null;
|
||||
}
|
||||
|
||||
|
||||
/// <summary>
|
||||
/// Standard constructor
|
||||
/// </summary>
|
||||
internal CHMTopics()
|
||||
{
|
||||
}
|
||||
|
||||
#region Data dumping
|
||||
/// <summary>
|
||||
/// Dump the class data to a binary writer
|
||||
/// </summary>
|
||||
/// <param name="writer">writer to write the data</param>
|
||||
internal void Dump(ref BinaryWriter writer)
|
||||
{
|
||||
writer.Write( _topicTable.Count );
|
||||
foreach(TopicEntry curItem in _topicTable)
|
||||
{
|
||||
curItem.Dump(ref writer);
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Reads the object data from a dump store
|
||||
/// </summary>
|
||||
/// <param name="reader">reader to read the data</param>
|
||||
internal void ReadDump(ref BinaryReader reader)
|
||||
{
|
||||
int i=0;
|
||||
int nCnt = reader.ReadInt32();
|
||||
|
||||
for(i=0; i<nCnt;i++)
|
||||
{
|
||||
TopicEntry newItem = new TopicEntry();
|
||||
newItem.SetCHMFile(_associatedFile);
|
||||
newItem.ReadDump(ref reader);
|
||||
_topicTable.Add(newItem);
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Sets the associated CHMFile instance
|
||||
/// </summary>
|
||||
/// <param name="associatedFile">instance to set</param>
|
||||
internal void SetCHMFile(CHMFile associatedFile)
|
||||
{
|
||||
_associatedFile = associatedFile;
|
||||
|
||||
foreach(TopicEntry curEntry in _topicTable)
|
||||
{
|
||||
curEntry.SetCHMFile(associatedFile);
|
||||
}
|
||||
}
|
||||
#endregion
|
||||
|
||||
/// <summary>
|
||||
/// Decodes the binary file data and fills the internal properties
|
||||
/// </summary>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeData()
|
||||
{
|
||||
bool bRet = true;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(_binaryFileData);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
int nCurOffset = 0;
|
||||
|
||||
while( (memStream.Position < memStream.Length) && (bRet) )
|
||||
{
|
||||
int entryOffset = nCurOffset;
|
||||
int tocIdx = binReader.ReadInt32();
|
||||
int titleOffset = binReader.ReadInt32();
|
||||
int urltablOffset = binReader.ReadInt32();
|
||||
int visibilityMode = binReader.ReadInt16();
|
||||
int unknownMode = binReader.ReadInt16();
|
||||
|
||||
TopicEntry newEntry = new TopicEntry(entryOffset, tocIdx, titleOffset, urltablOffset, visibilityMode, unknownMode, _associatedFile);
|
||||
_topicTable.Add( newEntry );
|
||||
|
||||
nCurOffset = (int)memStream.Position;
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the arraylist containing all topic entries.
|
||||
/// </summary>
|
||||
public ArrayList TopicTable
|
||||
{
|
||||
get
|
||||
{
|
||||
return _topicTable;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the topic entry of a given offset
|
||||
/// </summary>
|
||||
public TopicEntry this[int offset]
|
||||
{
|
||||
get
|
||||
{
|
||||
foreach(TopicEntry curEntry in _topicTable)
|
||||
if(curEntry.EntryOffset == offset)
|
||||
return curEntry;
|
||||
|
||||
return null;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Searches a topic by the locale name
|
||||
/// </summary>
|
||||
/// <param name="locale">locale name to search</param>
|
||||
/// <returns>The topicentry instance if found, otherwise null</returns>
|
||||
public TopicEntry GetByLocale(string locale)
|
||||
{
|
||||
foreach(TopicEntry curEntry in TopicTable)
|
||||
{
|
||||
if(curEntry.Locale.ToLower() == locale.ToLower())
|
||||
return curEntry;
|
||||
}
|
||||
|
||||
return null;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Searches the topics for all files with a given file extension
|
||||
/// </summary>
|
||||
/// <param name="fileExtension">extension to search</param>
|
||||
/// <returns>An arraylist of TopicEntry instances or null if no topic was found</returns>
|
||||
public ArrayList GetByExtension(string fileExtension)
|
||||
{
|
||||
ArrayList arrRet = new ArrayList();
|
||||
|
||||
foreach(TopicEntry curEntry in TopicTable)
|
||||
{
|
||||
if(curEntry.Locale.ToLower().EndsWith(fileExtension.ToLower()))
|
||||
arrRet.Add(curEntry);
|
||||
}
|
||||
|
||||
if(arrRet.Count > 0)
|
||||
return arrRet;
|
||||
|
||||
return null;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Implement IDisposable.
|
||||
/// </summary>
|
||||
public void Dispose()
|
||||
{
|
||||
Dispose(true);
|
||||
// This object will be cleaned up by the Dispose method.
|
||||
// Therefore, you should call GC.SupressFinalize to
|
||||
// take this object off the finalization queue
|
||||
// and prevent finalization code for this object
|
||||
// from executing a second time.
|
||||
GC.SuppressFinalize(this);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Dispose(bool disposing) executes in two distinct scenarios.
|
||||
/// If disposing equals true, the method has been called directly
|
||||
/// or indirectly by a user's code. Managed and unmanaged resources
|
||||
/// can be disposed.
|
||||
/// If disposing equals false, the method has been called by the
|
||||
/// runtime from inside the finalizer and you should not reference
|
||||
/// other objects. Only unmanaged resources can be disposed.
|
||||
/// </summary>
|
||||
/// <param name="disposing">disposing flag</param>
|
||||
private void Dispose(bool disposing)
|
||||
{
|
||||
// Check to see if Dispose has already been called.
|
||||
if(!this.disposed)
|
||||
{
|
||||
// If disposing equals true, dispose all managed
|
||||
// and unmanaged resources.
|
||||
if(disposing)
|
||||
{
|
||||
// Dispose managed resources.
|
||||
_binaryFileData = null;
|
||||
_topicTable=null;
|
||||
}
|
||||
}
|
||||
disposed = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
308
irc/TechBot/CHMLibrary/CHMDecoding/CHMUrlstr.cs
Normal file
308
irc/TechBot/CHMLibrary/CHMDecoding/CHMUrlstr.cs
Normal file
@@ -0,0 +1,308 @@
|
||||
using System;
|
||||
using System.IO;
|
||||
using System.Collections;
|
||||
using System.Collections.Specialized;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>CHMUrlstr</c> implements a string collection storing the URL strings of the help file
|
||||
/// </summary>
|
||||
internal sealed class CHMUrlstr : IDisposable
|
||||
{
|
||||
/// <summary>
|
||||
/// Constant specifying the size of the string blocks
|
||||
/// </summary>
|
||||
private const int BLOCK_SIZE = 0x1000;
|
||||
/// <summary>
|
||||
/// Internal flag specifying if the object is going to be disposed
|
||||
/// </summary>
|
||||
private bool disposed = false;
|
||||
/// <summary>
|
||||
/// Internal member storing the binary file data
|
||||
/// </summary>
|
||||
private byte[] _binaryFileData = null;
|
||||
/// <summary>
|
||||
/// Internal member storing the url dictionary
|
||||
/// </summary>
|
||||
private Hashtable _urlDictionary = new Hashtable();
|
||||
/// <summary>
|
||||
/// Internal member storing the framename dictionary
|
||||
/// </summary>
|
||||
private Hashtable _framenameDictionary = new Hashtable();
|
||||
/// <summary>
|
||||
/// Internal member storing the associated chmfile object
|
||||
/// </summary>
|
||||
private CHMFile _associatedFile = null;
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="binaryFileData">binary file data of the #URLSTR file</param>
|
||||
/// <param name="associatedFile">associated chm file</param>
|
||||
public CHMUrlstr(byte[] binaryFileData, CHMFile associatedFile)
|
||||
{
|
||||
_binaryFileData = binaryFileData;
|
||||
_associatedFile = associatedFile;
|
||||
DecodeData();
|
||||
|
||||
// clear internal binary data after extraction
|
||||
_binaryFileData = null;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Standard constructor
|
||||
/// </summary>
|
||||
internal CHMUrlstr()
|
||||
{
|
||||
}
|
||||
|
||||
#region Data dumping
|
||||
/// <summary>
|
||||
/// Dump the class data to a binary writer
|
||||
/// </summary>
|
||||
/// <param name="writer">writer to write the data</param>
|
||||
internal void Dump(ref BinaryWriter writer)
|
||||
{
|
||||
writer.Write( _urlDictionary.Count );
|
||||
|
||||
if (_urlDictionary.Count != 0)
|
||||
{
|
||||
IDictionaryEnumerator iDictionaryEnumerator = _urlDictionary.GetEnumerator();
|
||||
while (iDictionaryEnumerator.MoveNext())
|
||||
{
|
||||
DictionaryEntry dictionaryEntry = (DictionaryEntry)iDictionaryEnumerator.Current;
|
||||
writer.Write( Int32.Parse(dictionaryEntry.Key.ToString()) );
|
||||
writer.Write( dictionaryEntry.Value.ToString() );
|
||||
}
|
||||
}
|
||||
|
||||
writer.Write( _framenameDictionary.Count );
|
||||
|
||||
if (_framenameDictionary.Count != 0)
|
||||
{
|
||||
IDictionaryEnumerator iDictionaryEnumerator = _framenameDictionary.GetEnumerator();
|
||||
while (iDictionaryEnumerator.MoveNext())
|
||||
{
|
||||
DictionaryEntry dictionaryEntry = (DictionaryEntry)iDictionaryEnumerator.Current;
|
||||
writer.Write( Int32.Parse(dictionaryEntry.Key.ToString()) );
|
||||
writer.Write( dictionaryEntry.Value.ToString() );
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Reads the object data from a dump store
|
||||
/// </summary>
|
||||
/// <param name="reader">reader to read the data</param>
|
||||
internal void ReadDump(ref BinaryReader reader)
|
||||
{
|
||||
int i=0;
|
||||
int nCnt = reader.ReadInt32();
|
||||
|
||||
for(i=0; i<nCnt;i++)
|
||||
{
|
||||
int nKey = reader.ReadInt32();
|
||||
string sValue = reader.ReadString();
|
||||
|
||||
_urlDictionary[nKey.ToString()] = sValue;
|
||||
}
|
||||
|
||||
nCnt = reader.ReadInt32();
|
||||
|
||||
for(i=0; i<nCnt;i++)
|
||||
{
|
||||
int nKey = reader.ReadInt32();
|
||||
string sValue = reader.ReadString();
|
||||
|
||||
_framenameDictionary[nKey.ToString()] = sValue;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Sets the associated CHMFile instance
|
||||
/// </summary>
|
||||
/// <param name="associatedFile">instance to set</param>
|
||||
internal void SetCHMFile(CHMFile associatedFile)
|
||||
{
|
||||
_associatedFile = associatedFile;
|
||||
}
|
||||
#endregion
|
||||
|
||||
/// <summary>
|
||||
/// Decodes the binary file data and fills the internal properties
|
||||
/// </summary>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeData()
|
||||
{
|
||||
bool bRet = true;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(_binaryFileData);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
int nCurOffset = 0;
|
||||
|
||||
while( (memStream.Position < memStream.Length) && (bRet) )
|
||||
{
|
||||
nCurOffset = (int)memStream.Position;
|
||||
byte [] dataBlock = binReader.ReadBytes(BLOCK_SIZE);
|
||||
bRet &= DecodeBlock(dataBlock, ref nCurOffset);
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Decodes a block of url-string data
|
||||
/// </summary>
|
||||
/// <param name="dataBlock">block of data</param>
|
||||
/// <param name="nOffset">current file offset</param>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeBlock( byte[] dataBlock, ref int nOffset )
|
||||
{
|
||||
bool bRet = true;
|
||||
int blockOffset = nOffset;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(dataBlock);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
if(nOffset==0)
|
||||
binReader.ReadByte(); // first block starts with an unknown byte
|
||||
|
||||
while( (memStream.Position < (memStream.Length-8)) && (bRet) )
|
||||
{
|
||||
int entryOffset = blockOffset + (int)memStream.Position;
|
||||
|
||||
int urlOffset = binReader.ReadInt32();
|
||||
int frameOffset = binReader.ReadInt32();
|
||||
|
||||
|
||||
// There is one way to tell where the end of the URL/FrameName
|
||||
// pairs occurs: Repeat the following: read 2 DWORDs and if both
|
||||
// are less than the current offset then this is the start of the Local
|
||||
// strings else skip two NT strings.
|
||||
// if(( (urlOffset < (entryOffset+8)) && (frameOffset < (entryOffset+8)) ))
|
||||
// {
|
||||
// //TODO: add correct string reading if an offset has been found
|
||||
// /*
|
||||
// int curOffset = (int)memStream.Position;
|
||||
//
|
||||
// memStream.Seek( (long)(blockOffset-urlOffset), SeekOrigin.Begin);
|
||||
// string sTemp = CHMReader.ExtractString(ref binReader, 0, true);
|
||||
//
|
||||
// memStream.Seek( (long)(blockOffset-frameOffset), SeekOrigin.Begin);
|
||||
// sTemp = CHMReader.ExtractString(ref binReader, 0, true);
|
||||
//
|
||||
// memStream.Seek((long)curOffset, SeekOrigin.Begin);
|
||||
// */
|
||||
//
|
||||
//
|
||||
// int curOffs = (int)memStream.Position;
|
||||
// BinaryReaderHelp.ExtractString(ref binReader, 0, true, _associatedFile.TextEncoding);
|
||||
// nOffset += (int)memStream.Position - curOffs;
|
||||
//
|
||||
// curOffs = (int)memStream.Position;
|
||||
// BinaryReaderHelp.ExtractString(ref binReader, 0, true, _associatedFile.TextEncoding);
|
||||
// nOffset += (int)memStream.Position - curOffs;
|
||||
// }
|
||||
// else
|
||||
{
|
||||
bool bFoundTerminator = false;
|
||||
|
||||
string sTemp = BinaryReaderHelp.ExtractString(ref binReader, ref bFoundTerminator, 0, true, _associatedFile.TextEncoding);
|
||||
|
||||
if(sTemp == "")
|
||||
{
|
||||
//nOffset = nOffset + 1 + (int)memStream.Length - (int)memStream.Position;
|
||||
memStream.Seek(memStream.Length-1, SeekOrigin.Begin);
|
||||
}
|
||||
else
|
||||
{
|
||||
_urlDictionary[entryOffset.ToString()] = sTemp.ToString();
|
||||
_framenameDictionary[ entryOffset.ToString() ] = sTemp.ToString() ;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the url at a given offset
|
||||
/// </summary>
|
||||
/// <param name="offset">offset of url</param>
|
||||
/// <returns>the url at the given offset</returns>
|
||||
public string GetURLatOffset(int offset)
|
||||
{
|
||||
if(offset == -1)
|
||||
return String.Empty;
|
||||
|
||||
string sTemp = (string)_urlDictionary[ offset.ToString() ];
|
||||
|
||||
if(sTemp == null)
|
||||
return String.Empty;
|
||||
|
||||
return sTemp;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the framename at a given offset
|
||||
/// </summary>
|
||||
/// <param name="offset">offset of the framename</param>
|
||||
/// <returns>the frame name at the given offset</returns>
|
||||
public string GetFrameNameatOffset(int offset)
|
||||
{
|
||||
if(offset == -1)
|
||||
return String.Empty;
|
||||
|
||||
string sTemp = (string)_framenameDictionary[ offset.ToString() ];
|
||||
|
||||
if(sTemp == null)
|
||||
return String.Empty;
|
||||
|
||||
return sTemp;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Implement IDisposable.
|
||||
/// </summary>
|
||||
public void Dispose()
|
||||
{
|
||||
Dispose(true);
|
||||
// This object will be cleaned up by the Dispose method.
|
||||
// Therefore, you should call GC.SupressFinalize to
|
||||
// take this object off the finalization queue
|
||||
// and prevent finalization code for this object
|
||||
// from executing a second time.
|
||||
GC.SuppressFinalize(this);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Dispose(bool disposing) executes in two distinct scenarios.
|
||||
/// If disposing equals true, the method has been called directly
|
||||
/// or indirectly by a user's code. Managed and unmanaged resources
|
||||
/// can be disposed.
|
||||
/// If disposing equals false, the method has been called by the
|
||||
/// runtime from inside the finalizer and you should not reference
|
||||
/// other objects. Only unmanaged resources can be disposed.
|
||||
/// </summary>
|
||||
/// <param name="disposing">disposing flag</param>
|
||||
private void Dispose(bool disposing)
|
||||
{
|
||||
// Check to see if Dispose has already been called.
|
||||
if(!this.disposed)
|
||||
{
|
||||
// If disposing equals true, dispose all managed
|
||||
// and unmanaged resources.
|
||||
if(disposing)
|
||||
{
|
||||
// Dispose managed resources.
|
||||
_binaryFileData = null;
|
||||
_urlDictionary = null;
|
||||
_framenameDictionary = null;
|
||||
}
|
||||
}
|
||||
disposed = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
245
irc/TechBot/CHMLibrary/CHMDecoding/CHMUrltable.cs
Normal file
245
irc/TechBot/CHMLibrary/CHMDecoding/CHMUrltable.cs
Normal file
@@ -0,0 +1,245 @@
|
||||
using System;
|
||||
using System.IO;
|
||||
using System.Collections;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>CHMUrltable</c> implements methods to decode the #URLTBL internal file.
|
||||
/// </summary>
|
||||
internal sealed class CHMUrltable : IDisposable
|
||||
{
|
||||
/// <summary>
|
||||
/// Constant specifying the size of the data blocks
|
||||
/// </summary>
|
||||
private const int BLOCK_SIZE = 0x1000;
|
||||
/// <summary>
|
||||
/// Constant specifying the number of records per block
|
||||
/// </summary>
|
||||
private const int RECORDS_PER_BLOCK = 341;
|
||||
/// <summary>
|
||||
/// Internal flag specifying if the object is going to be disposed
|
||||
/// </summary>
|
||||
private bool disposed = false;
|
||||
/// <summary>
|
||||
/// Internal member storing the binary file data
|
||||
/// </summary>
|
||||
private byte[] _binaryFileData = null;
|
||||
/// <summary>
|
||||
/// Internal member storing the url table
|
||||
/// </summary>
|
||||
private ArrayList _urlTable = new ArrayList();
|
||||
/// <summary>
|
||||
/// Internal member storing the associated chmfile object
|
||||
/// </summary>
|
||||
private CHMFile _associatedFile = null;
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="binaryFileData">binary file data of the #URLTBL file</param>
|
||||
/// <param name="associatedFile">associated chm file</param>
|
||||
public CHMUrltable(byte[] binaryFileData, CHMFile associatedFile)
|
||||
{
|
||||
_binaryFileData = binaryFileData;
|
||||
_associatedFile = associatedFile;
|
||||
DecodeData();
|
||||
|
||||
// clear internal binary data after extraction
|
||||
_binaryFileData = null;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Standard constructor
|
||||
/// </summary>
|
||||
internal CHMUrltable()
|
||||
{
|
||||
}
|
||||
|
||||
#region Data dumping
|
||||
/// <summary>
|
||||
/// Dump the class data to a binary writer
|
||||
/// </summary>
|
||||
/// <param name="writer">writer to write the data</param>
|
||||
internal void Dump(ref BinaryWriter writer)
|
||||
{
|
||||
writer.Write( _urlTable.Count );
|
||||
foreach(UrlTableEntry curItem in _urlTable)
|
||||
{
|
||||
curItem.Dump(ref writer);
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Reads the object data from a dump store
|
||||
/// </summary>
|
||||
/// <param name="reader">reader to read the data</param>
|
||||
internal void ReadDump(ref BinaryReader reader)
|
||||
{
|
||||
int i=0;
|
||||
int nCnt = reader.ReadInt32();
|
||||
|
||||
for(i=0; i<nCnt;i++)
|
||||
{
|
||||
UrlTableEntry newItem = new UrlTableEntry();
|
||||
newItem.SetCHMFile(_associatedFile);
|
||||
newItem.ReadDump(ref reader);
|
||||
_urlTable.Add(newItem);
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Sets the associated CHMFile instance
|
||||
/// </summary>
|
||||
/// <param name="associatedFile">instance to set</param>
|
||||
internal void SetCHMFile(CHMFile associatedFile)
|
||||
{
|
||||
_associatedFile = associatedFile;
|
||||
|
||||
foreach(UrlTableEntry curEntry in _urlTable)
|
||||
{
|
||||
curEntry.SetCHMFile(associatedFile);
|
||||
}
|
||||
}
|
||||
#endregion
|
||||
|
||||
/// <summary>
|
||||
/// Decodes the binary file data and fills the internal properties
|
||||
/// </summary>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeData()
|
||||
{
|
||||
bool bRet = true;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(_binaryFileData);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
int nCurOffset = 0;
|
||||
|
||||
while( (memStream.Position < memStream.Length) && (bRet) )
|
||||
{
|
||||
nCurOffset = (int)memStream.Position;
|
||||
byte [] dataBlock = binReader.ReadBytes(BLOCK_SIZE);
|
||||
bRet &= DecodeBlock(dataBlock, ref nCurOffset);
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Decodes a block of url-string data
|
||||
/// </summary>
|
||||
/// <param name="dataBlock">block of data</param>
|
||||
/// <param name="nOffset">current file offset</param>
|
||||
/// <returns>true if succeeded</returns>
|
||||
private bool DecodeBlock( byte[] dataBlock, ref int nOffset )
|
||||
{
|
||||
bool bRet = true;
|
||||
int blockOffset = nOffset;
|
||||
|
||||
MemoryStream memStream = new MemoryStream(dataBlock);
|
||||
BinaryReader binReader = new BinaryReader(memStream);
|
||||
|
||||
for(int i=0; i < RECORDS_PER_BLOCK; i++)
|
||||
{
|
||||
int recordOffset = blockOffset + (int)memStream.Position;
|
||||
|
||||
uint nuniqueID = (uint) binReader.ReadInt32(); // unknown dword
|
||||
int ntopicsIdx = binReader.ReadInt32();
|
||||
int urlstrOffset = binReader.ReadInt32();
|
||||
|
||||
UrlTableEntry newEntry = new UrlTableEntry(nuniqueID, recordOffset, ntopicsIdx, urlstrOffset, _associatedFile);
|
||||
_urlTable.Add(newEntry);
|
||||
|
||||
if( memStream.Position >= memStream.Length)
|
||||
break;
|
||||
}
|
||||
|
||||
if(dataBlock.Length == BLOCK_SIZE)
|
||||
binReader.ReadInt32();
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the arraylist containing all urltable entries.
|
||||
/// </summary>
|
||||
public ArrayList UrlTable
|
||||
{
|
||||
get
|
||||
{
|
||||
return _urlTable;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the urltable entry of a given offset
|
||||
/// </summary>
|
||||
public UrlTableEntry this[int offset]
|
||||
{
|
||||
get
|
||||
{
|
||||
foreach(UrlTableEntry curEntry in _urlTable)
|
||||
if(curEntry.EntryOffset == offset)
|
||||
return curEntry;
|
||||
|
||||
return null;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the urltable entry of a given uniqueID
|
||||
/// </summary>
|
||||
public UrlTableEntry GetByUniqueID(uint uniqueID)
|
||||
{
|
||||
foreach(UrlTableEntry curEntry in UrlTable)
|
||||
{
|
||||
if(curEntry.UniqueID == uniqueID)
|
||||
return curEntry;
|
||||
}
|
||||
|
||||
return null;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Implement IDisposable.
|
||||
/// </summary>
|
||||
public void Dispose()
|
||||
{
|
||||
Dispose(true);
|
||||
// This object will be cleaned up by the Dispose method.
|
||||
// Therefore, you should call GC.SupressFinalize to
|
||||
// take this object off the finalization queue
|
||||
// and prevent finalization code for this object
|
||||
// from executing a second time.
|
||||
GC.SuppressFinalize(this);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Dispose(bool disposing) executes in two distinct scenarios.
|
||||
/// If disposing equals true, the method has been called directly
|
||||
/// or indirectly by a user's code. Managed and unmanaged resources
|
||||
/// can be disposed.
|
||||
/// If disposing equals false, the method has been called by the
|
||||
/// runtime from inside the finalizer and you should not reference
|
||||
/// other objects. Only unmanaged resources can be disposed.
|
||||
/// </summary>
|
||||
/// <param name="disposing">disposing flag</param>
|
||||
private void Dispose(bool disposing)
|
||||
{
|
||||
// Check to see if Dispose has already been called.
|
||||
if(!this.disposed)
|
||||
{
|
||||
// If disposing equals true, dispose all managed
|
||||
// and unmanaged resources.
|
||||
if(disposing)
|
||||
{
|
||||
// Dispose managed resources.
|
||||
_binaryFileData = null;
|
||||
_urlTable = null;
|
||||
}
|
||||
}
|
||||
disposed = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
395
irc/TechBot/CHMLibrary/CHMDecoding/DumpingInfo.cs
Normal file
395
irc/TechBot/CHMLibrary/CHMDecoding/DumpingInfo.cs
Normal file
@@ -0,0 +1,395 @@
|
||||
using System;
|
||||
using System.IO;
|
||||
using System.Text;
|
||||
using System.Diagnostics;
|
||||
using System.Collections.Specialized;
|
||||
|
||||
using ICSharpCode.SharpZipLib;
|
||||
using ICSharpCode.SharpZipLib.Zip;
|
||||
using ICSharpCode.SharpZipLib.Zip.Compression;
|
||||
using ICSharpCode.SharpZipLib.Zip.Compression.Streams;
|
||||
|
||||
using HtmlHelp;
|
||||
// using HtmlHelp.Storage;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// Enumeration for specifying the dumping compression
|
||||
/// </summary>
|
||||
public enum DumpCompression
|
||||
{
|
||||
/// <summary>
|
||||
/// None - no data compression will be used.
|
||||
/// Fastest but most memory intensive
|
||||
/// </summary>
|
||||
None = 0,
|
||||
/// <summary>
|
||||
/// Minimum - a minimum data compression will be used.
|
||||
/// Fast but not much data reduction
|
||||
/// </summary>
|
||||
Minimum = 1,
|
||||
/// <summary>
|
||||
/// Medium - a medium data compression will be used.
|
||||
/// Slower but medium data reduction
|
||||
/// </summary>
|
||||
Medium = 2,
|
||||
/// <summary>
|
||||
/// Maximum - a maximum data compression will be used.
|
||||
/// Slowest but maximum data reduction
|
||||
/// </summary>
|
||||
Maximum = 3
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Flags which specify which data should be dumped
|
||||
/// </summary>
|
||||
[FlagsAttribute()]
|
||||
public enum DumpingFlags
|
||||
{
|
||||
/// <summary>
|
||||
/// DumpTextTOC - if this flag is set, text-based TOCs (sitemap format) will be dumped
|
||||
/// </summary>
|
||||
DumpTextTOC = 1,
|
||||
/// <summary>
|
||||
/// DumpBinaryTOC - if this flag is set, binary TOCs will be dumped
|
||||
/// </summary>
|
||||
DumpBinaryTOC = 2,
|
||||
/// <summary>
|
||||
/// DumpTextIndex - if this flag is set, the text-based index (sitemap format) will be dumped
|
||||
/// </summary>
|
||||
DumpTextIndex = 4,
|
||||
/// <summary>
|
||||
/// DumpBinaryIndex - if this flag is set, the binary index will be dumped
|
||||
/// </summary>
|
||||
DumpBinaryIndex = 8,
|
||||
/// <summary>
|
||||
/// DumpStrings - if this flag is set, the internal #STRINGS file will be dumped
|
||||
/// </summary>
|
||||
DumpStrings = 16,
|
||||
/// <summary>
|
||||
/// DumpUrlStr - if this flag is set, the internal #URLSTR file will be dumped
|
||||
/// </summary>
|
||||
DumpUrlStr = 32,
|
||||
/// <summary>
|
||||
/// DumpUrlTbl - if this flag is set, the internal #URLTBL file will be dumped
|
||||
/// </summary>
|
||||
DumpUrlTbl = 64,
|
||||
/// <summary>
|
||||
/// DumpTopics - if this flag is set, the internal #TOPICS file will be dumped
|
||||
/// </summary>
|
||||
DumpTopics = 128,
|
||||
/// <summary>
|
||||
/// DumpFullText - if this flag is set, the internal $FIftiMain file will be dumped
|
||||
/// </summary>
|
||||
DumpFullText = 256
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// The class <c>DumpingInfo</c> implements information properties for the CHMFile class
|
||||
/// if and how data dumping should be used.
|
||||
/// </summary>
|
||||
public sealed class DumpingInfo
|
||||
{
|
||||
public bool m_bAllowSaveDump=true;
|
||||
|
||||
private readonly static BitVector32.Section DumpFlags = BitVector32.CreateSection(512);
|
||||
|
||||
private const string _dumpHeader = "HtmlHelpSystem dump file 1.0";
|
||||
|
||||
private string _outputDir = ""; // emtpy string means, same directory as chm file
|
||||
private DumpCompression _compressionLevel = DumpCompression.Maximum;
|
||||
private CHMFile _chmFile = null;
|
||||
|
||||
private DeflaterOutputStream _outputStream = null;
|
||||
private InflaterInputStream _inputStream = null;
|
||||
|
||||
private BinaryWriter _writer = null;
|
||||
private BinaryReader _reader = null;
|
||||
|
||||
private BitVector32 _flags;
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="flags">Combine flag values to specify which data should be dumped.</param>
|
||||
/// <param name="outputDir">output directory. emtpy string means,
|
||||
/// same directory as chm file (only if destination = ExternalFile)</param>
|
||||
/// <param name="compressionLevel">compression which should be used</param>
|
||||
public DumpingInfo(DumpingFlags flags, string outputDir, DumpCompression compressionLevel)
|
||||
{
|
||||
_flags = new BitVector32(0);
|
||||
int i = _flags[DumpFlags];
|
||||
_flags[DumpFlags] = i | (int)flags;
|
||||
|
||||
_outputDir = outputDir;
|
||||
_compressionLevel = compressionLevel;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if text-based TOCs will be written to the dumping file
|
||||
/// </summary>
|
||||
public bool DumpTextTOC
|
||||
{
|
||||
get { return ((_flags[DumpFlags] & (int)DumpingFlags.DumpTextTOC) != 0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if binary TOCs will be written to the dumping file
|
||||
/// </summary>
|
||||
public bool DumpBinaryTOC
|
||||
{
|
||||
get { return ((_flags[DumpFlags] & (int)DumpingFlags.DumpBinaryTOC) != 0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the text-based index will be written to the dumping file
|
||||
/// </summary>
|
||||
public bool DumpTextIndex
|
||||
{
|
||||
get { return ((_flags[DumpFlags] & (int)DumpingFlags.DumpTextIndex) != 0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the binary index will be written to the dumping file
|
||||
/// </summary>
|
||||
public bool DumpBinaryIndex
|
||||
{
|
||||
get { return ((_flags[DumpFlags] & (int)DumpingFlags.DumpBinaryIndex) != 0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the #STRINGS file will be written to the dumping file
|
||||
/// </summary>
|
||||
public bool DumpStrings
|
||||
{
|
||||
get { return ((_flags[DumpFlags] & (int)DumpingFlags.DumpStrings) != 0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the #URLSTR file will be written to the dumping file
|
||||
/// </summary>
|
||||
public bool DumpUrlStr
|
||||
{
|
||||
get { return ((_flags[DumpFlags] & (int)DumpingFlags.DumpUrlStr) != 0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the #URLTBL file will be written to the dumping file
|
||||
/// </summary>
|
||||
public bool DumpUrlTbl
|
||||
{
|
||||
get { return ((_flags[DumpFlags] & (int)DumpingFlags.DumpUrlTbl) != 0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the #TOPICS file will be written to the dumping file
|
||||
/// </summary>
|
||||
public bool DumpTopics
|
||||
{
|
||||
get { return ((_flags[DumpFlags] & (int)DumpingFlags.DumpTopics) != 0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the flag if the $FIftiMain file will be written to the dumping file
|
||||
/// </summary>
|
||||
public bool DumpFullText
|
||||
{
|
||||
get { return ((_flags[DumpFlags] & (int)DumpingFlags.DumpFullText) != 0); }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the dump output directory.
|
||||
/// </summary>
|
||||
/// <value>emtpy string means, same directory as chm file</value>
|
||||
/// <remarks>If Destination is set to DumpingOutput.InternalFile this property will be ignored</remarks>
|
||||
public string OutputDir
|
||||
{
|
||||
get { return _outputDir; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// The compression level used.
|
||||
/// </summary>
|
||||
public DumpCompression CompressionLevel
|
||||
{
|
||||
get { return _compressionLevel; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets/Sets the CHMFile instance associated with this object
|
||||
/// </summary>
|
||||
internal CHMFile ChmFile
|
||||
{
|
||||
get { return _chmFile; }
|
||||
set { _chmFile = value; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Translates the compression level to the deflater constants
|
||||
/// </summary>
|
||||
private int CompLvl
|
||||
{
|
||||
get
|
||||
{
|
||||
switch(CompressionLevel)
|
||||
{
|
||||
case DumpCompression.None: return Deflater.NO_COMPRESSION;
|
||||
case DumpCompression.Minimum: return Deflater.BEST_SPEED;
|
||||
case DumpCompression.Medium: return Deflater.DEFAULT_COMPRESSION;
|
||||
case DumpCompression.Maximum: return Deflater.BEST_COMPRESSION;
|
||||
}
|
||||
|
||||
return Deflater.BEST_COMPRESSION;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Checks if a dump exists
|
||||
/// </summary>
|
||||
internal bool DumpExists
|
||||
{
|
||||
get
|
||||
{
|
||||
if(_flags[DumpFlags] == 0)
|
||||
return false;
|
||||
|
||||
// we have a reader or writer to the dump so it must exist
|
||||
if( (_reader != null) || (_writer != null) )
|
||||
return true;
|
||||
|
||||
string sDmpFile = _chmFile.ChmFilePath;
|
||||
sDmpFile=sDmpFile.ToLower().Replace(".chm",".CHB");
|
||||
|
||||
return File.Exists(sDmpFile);
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets a binary writer instance which allows you to write to the dump
|
||||
/// </summary>
|
||||
internal BinaryWriter Writer
|
||||
{
|
||||
get
|
||||
{
|
||||
if (m_bAllowSaveDump==false)
|
||||
return null;
|
||||
|
||||
if(_flags[DumpFlags] == 0)
|
||||
throw new InvalidOperationException("Nothing to dump. No flags have been set !");
|
||||
|
||||
if(_reader != null)
|
||||
throw new InvalidOperationException("Can't write and read at the same time !");
|
||||
|
||||
if(_chmFile == null)
|
||||
throw new InvalidOperationException("Only usable with an associated CHMFile instance !");
|
||||
|
||||
if(_writer==null)
|
||||
{
|
||||
string sDmpFile = _chmFile.ChmFilePath;
|
||||
sDmpFile=sDmpFile.ToLower().Replace(".chm",".CHB");
|
||||
StreamWriter stream = new StreamWriter(sDmpFile, false, _chmFile.TextEncoding);
|
||||
|
||||
// write header info uncompressed
|
||||
BinaryWriter _hwriter = new BinaryWriter(stream.BaseStream);
|
||||
_hwriter.Write(_dumpHeader);
|
||||
_hwriter.Write((int)CompressionLevel);
|
||||
|
||||
if(_compressionLevel == DumpCompression.None)
|
||||
{
|
||||
_writer = new BinaryWriter(stream.BaseStream);
|
||||
}
|
||||
else
|
||||
{
|
||||
_outputStream = new DeflaterOutputStream(stream.BaseStream, new Deflater(CompLvl));
|
||||
|
||||
_writer = new BinaryWriter(_outputStream);
|
||||
}
|
||||
}
|
||||
|
||||
return _writer;
|
||||
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets a binary reader which allows you to read from the dump
|
||||
/// </summary>
|
||||
internal BinaryReader Reader
|
||||
{
|
||||
get
|
||||
{
|
||||
if(_writer != null)
|
||||
throw new InvalidOperationException("Can't write and read at the same time !");
|
||||
|
||||
if(_chmFile == null)
|
||||
throw new InvalidOperationException("Only usable with an associated CHMFile instance !");
|
||||
|
||||
if(_reader==null)
|
||||
{
|
||||
string sDmpFile = _chmFile.ChmFilePath;
|
||||
sDmpFile=sDmpFile.ToLower().Replace(".chm",".CHB");
|
||||
StreamReader stream = new StreamReader(sDmpFile, _chmFile.TextEncoding);
|
||||
|
||||
BinaryReader _hReader = new BinaryReader(stream.BaseStream);
|
||||
string sH = _hReader.ReadString();
|
||||
|
||||
if(sH != _dumpHeader)
|
||||
{
|
||||
_hReader.Close();
|
||||
Debug.WriteLine("Unexpected dump-file header !");
|
||||
throw new FormatException("DumpingInfo.Reader - Unexpected dump-file header !");
|
||||
}
|
||||
|
||||
_compressionLevel = (DumpCompression)_hReader.ReadInt32();
|
||||
// if(_compressionLevel != (DumpCompression)_hReader.ReadInt32())
|
||||
// {
|
||||
// _hReader.Close();
|
||||
// return null;
|
||||
// }
|
||||
|
||||
if(_compressionLevel == DumpCompression.None)
|
||||
{
|
||||
_reader = new BinaryReader(stream.BaseStream);
|
||||
}
|
||||
else
|
||||
{
|
||||
_inputStream = new InflaterInputStream(stream.BaseStream, new Inflater());
|
||||
|
||||
_reader = new BinaryReader(_inputStream);
|
||||
}
|
||||
}
|
||||
|
||||
return _reader;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Saves data and closes the dump
|
||||
/// </summary>
|
||||
/// <returns>true if succeed</returns>
|
||||
internal bool SaveData()
|
||||
{
|
||||
if (m_bAllowSaveDump==false)
|
||||
return true;
|
||||
|
||||
if(_writer != null)
|
||||
{
|
||||
if(_writer!=null)
|
||||
_writer.Close();
|
||||
_outputStream = null;
|
||||
_writer = null;
|
||||
}
|
||||
|
||||
if(_reader != null)
|
||||
{
|
||||
if(_reader!=null)
|
||||
_reader.Close();
|
||||
_inputStream = null;
|
||||
_reader = null;
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
}
|
||||
}
|
||||
1131
irc/TechBot/CHMLibrary/CHMDecoding/FullTextEngine.cs
Normal file
1131
irc/TechBot/CHMLibrary/CHMDecoding/FullTextEngine.cs
Normal file
File diff suppressed because it is too large
Load Diff
593
irc/TechBot/CHMLibrary/CHMDecoding/HHCParser.cs
Normal file
593
irc/TechBot/CHMLibrary/CHMDecoding/HHCParser.cs
Normal file
@@ -0,0 +1,593 @@
|
||||
using System;
|
||||
using System.Collections;
|
||||
using System.Text;
|
||||
using System.Text.RegularExpressions;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>HHCParser</c> implements a parser for HHC contents files.
|
||||
/// </summary>
|
||||
internal sealed class HHCParser
|
||||
{
|
||||
/// <summary>
|
||||
/// regular expressions for replacing the sitemap boundary tags
|
||||
/// </summary>
|
||||
private static string RE_ULOpening = @"\<ul\>"; // will be replaced by a '(' for nested parsing
|
||||
private static string RE_ULClosing = @"\</ul\>"; // will be replaced by a ')' for nested parsing
|
||||
|
||||
/// <summary>
|
||||
/// Matching ul-tags
|
||||
/// </summary>
|
||||
private static string RE_ULBoundaries = @"\<ul\>(?<innerText>.*)\</ul\>";
|
||||
/// <summary>
|
||||
/// Matching the nested tree structure.
|
||||
/// </summary>
|
||||
private static string RE_NestedBoundaries = @"\( (?> [^()]+ | \( (?<DEPTH>) | \) (?<-DEPTH>) )* (?(DEPTH)(?!)) \)";
|
||||
/// <summary>
|
||||
/// Matching object-tags
|
||||
/// </summary>
|
||||
private static string RE_ObjectBoundaries = @"\<object(?<innerText>.*?)\</object\>";
|
||||
/// <summary>
|
||||
/// Matching param tags
|
||||
/// </summary>
|
||||
private static string RE_ParamBoundaries = @"\<param(?<innerText>.*?)\>";
|
||||
/// <summary>
|
||||
/// Extracting tag attributes
|
||||
/// </summary>
|
||||
private const string RE_QuoteAttributes = @"( |\t)*(?<attributeName>[\-a-zA-Z0-9]*)( |\t)*=( |\t)*(?<attributeTD>[\""\'])?(?<attributeValue>.*?(?(attributeTD)\k<attributeTD>|([\s>]|.$)))";
|
||||
|
||||
/// <summary>
|
||||
/// private regular expressionobjects
|
||||
/// </summary>
|
||||
private static Regex ulRE;
|
||||
private static Regex NestedRE;
|
||||
private static Regex ObjectRE;
|
||||
private static Regex ParamRE;
|
||||
private static Regex AttributesRE;
|
||||
|
||||
/// <summary>
|
||||
/// Internal member storing the list of TOCItems which are holding merge links
|
||||
/// </summary>
|
||||
private static ArrayList _mergeItems = null;
|
||||
|
||||
/// <summary>
|
||||
/// Internal member storing the last read regular topic item.
|
||||
/// This is used to handle "Merge" entries and add them as child to this instance.
|
||||
/// </summary>
|
||||
private static TOCItem _lastTopicItem = null;
|
||||
|
||||
/// <summary>
|
||||
/// Parses a HHC file and returns an ArrayList with the table of contents (TOC) tree
|
||||
/// </summary>
|
||||
/// <param name="hhcFile">string content of the hhc file</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
/// <returns>Returns an ArrayList with the table of contents (TOC) tree</returns>
|
||||
public static ArrayList ParseHHC(string hhcFile, CHMFile chmFile)
|
||||
{
|
||||
_lastTopicItem = null;
|
||||
_mergeItems = null; // clear merged item list
|
||||
ArrayList tocList = new ArrayList();
|
||||
|
||||
ulRE = new Regex(RE_ULBoundaries, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
NestedRE = new Regex(RE_NestedBoundaries, RegexOptions.IgnorePatternWhitespace | RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
ObjectRE = new Regex(RE_ObjectBoundaries, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
ParamRE = new Regex(RE_ParamBoundaries, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
AttributesRE = new Regex(RE_QuoteAttributes, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
|
||||
int innerTextIdx = ulRE.GroupNumberFromName("innerText");
|
||||
|
||||
if( ulRE.IsMatch(hhcFile, 0) )
|
||||
{
|
||||
Match m = ulRE.Match(hhcFile, 0);
|
||||
|
||||
int nFirstUL = 0;
|
||||
|
||||
nFirstUL = hhcFile.ToLower().IndexOf("<ul>");
|
||||
|
||||
if(nFirstUL == -1)
|
||||
nFirstUL = hhcFile.ToLower().IndexOf("<il>");
|
||||
|
||||
if( ObjectRE.IsMatch(hhcFile, 0) ) // first object block contains information types and categories
|
||||
{
|
||||
Match mO = ObjectRE.Match(hhcFile, 0);
|
||||
int iOTxt = ObjectRE.GroupNumberFromName("innerText");
|
||||
|
||||
string globalText = mO.Groups[iOTxt].Value;
|
||||
|
||||
if( mO.Groups[iOTxt].Index <= nFirstUL)
|
||||
ParseGlobalSettings( globalText, chmFile );
|
||||
}
|
||||
|
||||
// parse toc tree
|
||||
string innerText = m.Groups["innerText"].Value;
|
||||
|
||||
innerText = innerText.Replace("(", "(");
|
||||
innerText = innerText.Replace(")", ")");
|
||||
innerText = Regex.Replace(innerText, RE_ULOpening, "(", RegexOptions.IgnoreCase);
|
||||
innerText = Regex.Replace(innerText, RE_ULClosing, ")", RegexOptions.IgnoreCase);
|
||||
|
||||
ParseTree( innerText, null, tocList, chmFile );
|
||||
|
||||
}
|
||||
|
||||
return tocList;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Checks if the hhc file contains a global object tag.
|
||||
/// </summary>
|
||||
/// <param name="hhcFile">string content of the hhc file</param>
|
||||
/// <param name="chmFile">chm file</param>
|
||||
/// <returns>true if the hhc content contains a global object tag</returns>
|
||||
public static bool HasGlobalObjectTag(string hhcFile, CHMFile chmFile)
|
||||
{
|
||||
bool bRet = false;
|
||||
|
||||
ulRE = new Regex(RE_ULBoundaries, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
ObjectRE = new Regex(RE_ObjectBoundaries, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
|
||||
int innerTextIdx = ulRE.GroupNumberFromName("innerText");
|
||||
|
||||
if( ulRE.IsMatch(hhcFile, 0) )
|
||||
{
|
||||
Match m = ulRE.Match(hhcFile, 0);
|
||||
|
||||
int nFirstUL = 0;
|
||||
|
||||
nFirstUL = hhcFile.ToLower().IndexOf("<ul>");
|
||||
|
||||
if(nFirstUL == -1)
|
||||
nFirstUL = hhcFile.ToLower().IndexOf("<il>");
|
||||
|
||||
if( ObjectRE.IsMatch(hhcFile, 0) ) // first object block contains information types and categories
|
||||
{
|
||||
Match mO = ObjectRE.Match(hhcFile, 0);
|
||||
int iOTxt = ObjectRE.GroupNumberFromName("innerText");
|
||||
|
||||
string globalText = mO.Groups[iOTxt].Value;
|
||||
|
||||
if( mO.Groups[iOTxt].Index <= nFirstUL)
|
||||
bRet = true;
|
||||
}
|
||||
}
|
||||
|
||||
return bRet;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets true if the previously done parsing found merge-links
|
||||
/// </summary>
|
||||
public static bool HasMergeLinks
|
||||
{
|
||||
get
|
||||
{
|
||||
if(_mergeItems==null)
|
||||
return false;
|
||||
|
||||
return _mergeItems.Count > 0;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets all TOCItem references which are holding merge-links
|
||||
/// </summary>
|
||||
public static ArrayList MergeItems
|
||||
{
|
||||
get { return _mergeItems; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Recursively parses a sitemap tree
|
||||
/// </summary>
|
||||
/// <param name="text">content text</param>
|
||||
/// <param name="parent">Parent for all read items</param>
|
||||
/// <param name="arrNodes">arraylist which receives the extracted nodes</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
private static void ParseTree( string text, TOCItem parent, ArrayList arrNodes, CHMFile chmFile )
|
||||
{
|
||||
string strPreItems="", strPostItems="";
|
||||
string innerText = "";
|
||||
|
||||
int nIndex = 0;
|
||||
|
||||
while( NestedRE.IsMatch(text, nIndex) )
|
||||
{
|
||||
Match m = NestedRE.Match(text, nIndex);
|
||||
|
||||
innerText = m.Value.Substring( 1, m.Length-2);
|
||||
|
||||
strPreItems = text.Substring(nIndex,m.Index-nIndex);
|
||||
|
||||
ParseItems(strPreItems, parent, arrNodes, chmFile);
|
||||
|
||||
if((arrNodes.Count>0) && (innerText.Length > 0) )
|
||||
{
|
||||
TOCItem p = ((TOCItem)(arrNodes[arrNodes.Count-1]));
|
||||
ParseTree( innerText, p, p.Children, chmFile );
|
||||
}
|
||||
|
||||
nIndex = m.Index+m.Length;
|
||||
}
|
||||
|
||||
if( nIndex == 0)
|
||||
{
|
||||
strPostItems = text.Substring(nIndex, text.Length-nIndex);
|
||||
ParseItems(strPostItems, parent, arrNodes, chmFile);
|
||||
}
|
||||
else if( nIndex < text.Length-1)
|
||||
{
|
||||
strPostItems = text.Substring(nIndex, text.Length-nIndex);
|
||||
ParseTree(strPostItems, parent, arrNodes, chmFile);
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Parses tree nodes from the text
|
||||
/// </summary>
|
||||
/// <param name="itemstext">text containing the items</param>
|
||||
/// <param name="parent">Parent for all read items</param>
|
||||
/// <param name="arrNodes">arraylist where the nodes should be added</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
private static void ParseItems( string itemstext, TOCItem parent, ArrayList arrNodes, CHMFile chmFile)
|
||||
{
|
||||
int innerTextIdx = ObjectRE.GroupNumberFromName("innerText");
|
||||
int innerPTextIdx = ParamRE.GroupNumberFromName("innerText");
|
||||
|
||||
// get group-name indexes
|
||||
int nameIndex = AttributesRE.GroupNumberFromName("attributeName");
|
||||
int valueIndex = AttributesRE.GroupNumberFromName("attributeValue");
|
||||
int tdIndex = AttributesRE.GroupNumberFromName("attributeTD");
|
||||
|
||||
int nObjStartIndex = 0;
|
||||
|
||||
while( ObjectRE.IsMatch(itemstext, nObjStartIndex) )
|
||||
{
|
||||
Match m = ObjectRE.Match(itemstext, nObjStartIndex);
|
||||
|
||||
string innerText = m.Groups[innerTextIdx].Value;
|
||||
|
||||
TOCItem tocItem = new TOCItem();
|
||||
tocItem.TocMode = DataMode.TextBased;
|
||||
tocItem.AssociatedFile = chmFile;
|
||||
tocItem.Parent = parent;
|
||||
|
||||
// read parameters
|
||||
int nParamIndex = 0;
|
||||
|
||||
while( ParamRE.IsMatch(innerText, nParamIndex) )
|
||||
{
|
||||
Match mP = ParamRE.Match(innerText, nParamIndex);
|
||||
|
||||
string innerP = mP.Groups[innerPTextIdx].Value;
|
||||
|
||||
string paramName = "";
|
||||
string paramValue = "";
|
||||
|
||||
int nAttrIdx = 0;
|
||||
|
||||
while( AttributesRE.IsMatch( innerP, nAttrIdx ) )
|
||||
{
|
||||
Match mA = AttributesRE.Match(innerP, nAttrIdx);
|
||||
|
||||
string attributeName = mA.Groups[nameIndex].Value;
|
||||
string attributeValue = mA.Groups[valueIndex].Value;
|
||||
string attributeTD = mA.Groups[tdIndex].Value;
|
||||
|
||||
if(attributeTD.Length > 0)
|
||||
{
|
||||
// delete the trailing textqualifier
|
||||
if( attributeValue.Length > 0)
|
||||
{
|
||||
int ltqi = attributeValue.LastIndexOf( attributeTD );
|
||||
|
||||
if(ltqi >= 0)
|
||||
{
|
||||
attributeValue = attributeValue.Substring(0,ltqi);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if( attributeName.ToLower() == "name")
|
||||
{
|
||||
paramName = HttpUtility.HtmlDecode(attributeValue); // for unicode encoded values
|
||||
}
|
||||
|
||||
if( attributeName.ToLower() == "value")
|
||||
{
|
||||
paramValue = HttpUtility.HtmlDecode(attributeValue); // for unicode encoded values
|
||||
// delete trailing /
|
||||
while((paramValue.Length>0)&&(paramValue[paramValue.Length-1] == '/'))
|
||||
paramValue = paramValue.Substring(0,paramValue.Length-1);
|
||||
|
||||
}
|
||||
|
||||
nAttrIdx = mA.Index+mA.Length;
|
||||
}
|
||||
|
||||
tocItem.Params[paramName] = paramValue;
|
||||
switch(paramName.ToLower())
|
||||
{
|
||||
case "name":
|
||||
{
|
||||
tocItem.Name = paramValue;
|
||||
};break;
|
||||
case "local":
|
||||
{
|
||||
tocItem.Local = paramValue.Replace("../", "").Replace("./", "");
|
||||
};break;
|
||||
case "imagenumber":
|
||||
{
|
||||
tocItem.ImageIndex = Int32.Parse(paramValue);
|
||||
tocItem.ImageIndex-=1;
|
||||
|
||||
int nFolderAdd = 0;
|
||||
|
||||
if((chmFile != null) && (chmFile.ImageTypeFolder))
|
||||
{
|
||||
// get the value which should be added, to display folders instead of books
|
||||
if(HtmlHelpSystem.UseHH2TreePics)
|
||||
nFolderAdd = 8;
|
||||
else
|
||||
nFolderAdd = 4;
|
||||
}
|
||||
|
||||
if(tocItem.ImageIndex%2 != 0)
|
||||
{
|
||||
if(tocItem.ImageIndex==1)
|
||||
tocItem.ImageIndex=0;
|
||||
}
|
||||
if(HtmlHelpSystem.UseHH2TreePics)
|
||||
if( tocItem.ImageIndex == 0)
|
||||
tocItem.ImageIndex = TOCItem.STD_FOLDER_HH2+nFolderAdd;
|
||||
};break;
|
||||
case "merge": // this item contains topics or a full TOC from a merged CHM
|
||||
{
|
||||
tocItem.MergeLink = paramValue;
|
||||
|
||||
// "register" this item as merge-link
|
||||
if(_mergeItems==null)
|
||||
_mergeItems=new ArrayList();
|
||||
|
||||
_mergeItems.Add(tocItem);
|
||||
|
||||
};break;
|
||||
case "type": // information type assignment for item
|
||||
{
|
||||
tocItem.InfoTypeStrings.Add( paramValue );
|
||||
};break;
|
||||
}
|
||||
|
||||
nParamIndex = mP.Index+mP.Length;
|
||||
}
|
||||
|
||||
tocItem.ChmFile = chmFile.ChmFilePath;
|
||||
|
||||
if(tocItem.MergeLink.Length > 0)
|
||||
{
|
||||
if(_lastTopicItem != null)
|
||||
{
|
||||
tocItem.Parent = _lastTopicItem;
|
||||
_lastTopicItem.Children.Add(tocItem);
|
||||
}
|
||||
else
|
||||
arrNodes.Add( tocItem );
|
||||
}
|
||||
else
|
||||
{
|
||||
_lastTopicItem = tocItem;
|
||||
arrNodes.Add( tocItem );
|
||||
}
|
||||
|
||||
nObjStartIndex = m.Index+m.Length;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Parses the very first <OBJECT> tag in the sitemap file and extracts
|
||||
/// information types and categories.
|
||||
/// </summary>
|
||||
/// <param name="sText">text of the object tag</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
private static void ParseGlobalSettings(string sText, CHMFile chmFile)
|
||||
{
|
||||
int innerPTextIdx = ParamRE.GroupNumberFromName("innerText");
|
||||
|
||||
// get group-name indexes
|
||||
int nameIndex = AttributesRE.GroupNumberFromName("attributeName");
|
||||
int valueIndex = AttributesRE.GroupNumberFromName("attributeValue");
|
||||
int tdIndex = AttributesRE.GroupNumberFromName("attributeTD");
|
||||
|
||||
// read parameters
|
||||
int nParamIndex = 0;
|
||||
|
||||
// 0... unknown
|
||||
// 1... inclusinve info type name
|
||||
// 2... exclusive info type name
|
||||
// 3... hidden info type name
|
||||
// 4... category name
|
||||
// 5... incl infotype name for category
|
||||
// 6... excl infotype name for category
|
||||
// 7... hidden infotype name for category
|
||||
int prevItem = 0;
|
||||
|
||||
string sName = "";
|
||||
string sDescription = "";
|
||||
string curCategory = "";
|
||||
|
||||
while( ParamRE.IsMatch(sText, nParamIndex) )
|
||||
{
|
||||
Match mP = ParamRE.Match(sText, nParamIndex);
|
||||
|
||||
string innerP = mP.Groups[innerPTextIdx].Value;
|
||||
|
||||
string paramName = "";
|
||||
string paramValue = "";
|
||||
|
||||
int nAttrIdx = 0;
|
||||
|
||||
while( AttributesRE.IsMatch( innerP, nAttrIdx ) )
|
||||
{
|
||||
Match mA = AttributesRE.Match(innerP, nAttrIdx);
|
||||
|
||||
string attributeName = mA.Groups[nameIndex].Value;
|
||||
string attributeValue = mA.Groups[valueIndex].Value;
|
||||
string attributeTD = mA.Groups[tdIndex].Value;
|
||||
|
||||
if(attributeTD.Length > 0)
|
||||
{
|
||||
// delete the trailing textqualifier
|
||||
if( attributeValue.Length > 0)
|
||||
{
|
||||
int ltqi = attributeValue.LastIndexOf( attributeTD );
|
||||
|
||||
if(ltqi >= 0)
|
||||
{
|
||||
attributeValue = attributeValue.Substring(0,ltqi);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if( attributeName.ToLower() == "name")
|
||||
{
|
||||
paramName = HttpUtility.HtmlDecode(attributeValue); // for unicode encoded values
|
||||
}
|
||||
|
||||
if( attributeName.ToLower() == "value")
|
||||
{
|
||||
paramValue = HttpUtility.HtmlDecode(attributeValue); // for unicode encoded values
|
||||
// delete trailing /
|
||||
while((paramValue.Length>0)&&(paramValue[paramValue.Length-1] == '/'))
|
||||
paramValue = paramValue.Substring(0,paramValue.Length-1);
|
||||
|
||||
}
|
||||
|
||||
nAttrIdx = mA.Index+mA.Length;
|
||||
}
|
||||
|
||||
switch(paramName.ToLower())
|
||||
{
|
||||
case "savetype": // inclusive information type name
|
||||
{
|
||||
prevItem = 1;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
case "savetypedesc": // description of information type
|
||||
{
|
||||
InformationTypeMode mode = InformationTypeMode.Inclusive;
|
||||
sDescription = paramValue;
|
||||
|
||||
if( prevItem == 1)
|
||||
mode = InformationTypeMode.Inclusive;
|
||||
if( prevItem == 2)
|
||||
mode = InformationTypeMode.Exclusive;
|
||||
if( prevItem == 3)
|
||||
mode = InformationTypeMode.Hidden;
|
||||
|
||||
if( chmFile.GetInformationType( sName ) == null)
|
||||
{
|
||||
// check if the HtmlHelpSystem already holds such an information type
|
||||
if( chmFile.SystemInstance.GetInformationType( sName ) == null)
|
||||
{
|
||||
// info type not found yet
|
||||
|
||||
InformationType newType = new InformationType(sName, sDescription, mode);
|
||||
chmFile.InformationTypes.Add(newType);
|
||||
}
|
||||
else
|
||||
{
|
||||
InformationType sysType = chmFile.SystemInstance.GetInformationType( sName );
|
||||
chmFile.InformationTypes.Add( sysType );
|
||||
}
|
||||
}
|
||||
|
||||
prevItem = 0;
|
||||
};break;
|
||||
case "saveexclusive": // exclusive information type name
|
||||
{
|
||||
prevItem = 2;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
case "savehidden": // hidden information type name
|
||||
{
|
||||
prevItem = 3;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
case "category": // category name
|
||||
{
|
||||
prevItem = 4;
|
||||
sName = paramValue;
|
||||
curCategory = sName;
|
||||
};break;
|
||||
case "categorydesc": // category description
|
||||
{
|
||||
sDescription = paramValue;
|
||||
|
||||
if( chmFile.GetCategory( sName ) == null)
|
||||
{
|
||||
// check if the HtmlHelpSystem already holds such a category
|
||||
if( chmFile.SystemInstance.GetCategory( sName ) == null)
|
||||
{
|
||||
// add category
|
||||
Category newCat = new Category(sName, sDescription);
|
||||
chmFile.Categories.Add(newCat);
|
||||
}
|
||||
else
|
||||
{
|
||||
Category sysCat = chmFile.SystemInstance.GetCategory( sName );
|
||||
chmFile.Categories.Add( sysCat );
|
||||
}
|
||||
}
|
||||
|
||||
prevItem = 0;
|
||||
};break;
|
||||
case "type": // inclusive information type which is member of the previously read category
|
||||
{
|
||||
prevItem = 5;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
case "typedesc": // description of type for category
|
||||
{
|
||||
sDescription = paramValue;
|
||||
Category cat = chmFile.GetCategory( curCategory );
|
||||
|
||||
if( cat != null)
|
||||
{
|
||||
// category found
|
||||
InformationType infoType = chmFile.GetInformationType( sName );
|
||||
|
||||
if( infoType != null)
|
||||
{
|
||||
if( !cat.ContainsInformationType(infoType))
|
||||
{
|
||||
infoType.SetCategoryFlag(true);
|
||||
cat.AddInformationType(infoType);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
prevItem = 0;
|
||||
};break;
|
||||
case "typeexclusive": // exclusive information type which is member of the previously read category
|
||||
{
|
||||
prevItem = 6;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
case "typehidden": // hidden information type which is member of the previously read category
|
||||
{
|
||||
prevItem = 7;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
default:
|
||||
{
|
||||
prevItem = 0;
|
||||
sName = "";
|
||||
sDescription = "";
|
||||
};break;
|
||||
}
|
||||
|
||||
nParamIndex = mP.Index+mP.Length;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
220
irc/TechBot/CHMLibrary/CHMDecoding/HHCParser2.cs
Normal file
220
irc/TechBot/CHMLibrary/CHMDecoding/HHCParser2.cs
Normal file
@@ -0,0 +1,220 @@
|
||||
using System;
|
||||
using System.Collections;
|
||||
using System.Text;
|
||||
using System.Text.RegularExpressions;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>HHCParser</c> implements a parser for HHC contents files.
|
||||
/// </summary>
|
||||
// internal sealed class HHCParser : IHHCParser
|
||||
public class HHCParser2
|
||||
{
|
||||
static private string m_text1="";
|
||||
static private string m_text2="";
|
||||
static private int m_CurrentPos=0;
|
||||
|
||||
/// <summary>
|
||||
/// Parses a HHC file and returns an ArrayList with the table of contents (TOC) tree
|
||||
/// </summary>
|
||||
/// <param name="hhcFile">string content of the hhc file</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
/// <returns>Returns an ArrayList with the table of contents (TOC) tree</returns>
|
||||
public static ArrayList ParseHHC(string hhcFile, CHMFile chmFile)
|
||||
{
|
||||
DateTime StartTime=DateTime.Now;
|
||||
|
||||
ArrayList tocList = new ArrayList();
|
||||
|
||||
m_text2=hhcFile;
|
||||
m_text1=hhcFile.ToLower();
|
||||
|
||||
int idx=m_text1.IndexOf("<ul>");
|
||||
if (idx==-1)
|
||||
return null;
|
||||
m_CurrentPos=idx+4;
|
||||
|
||||
ParamRE = new Regex(RE_ParamBoundaries, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
AttributesRE = new Regex(RE_QuoteAttributes, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
|
||||
ParseTree(tocList,chmFile);
|
||||
|
||||
DateTime EndTime=DateTime.Now;
|
||||
TimeSpan Diff=EndTime-StartTime;
|
||||
string x=Diff.ToString();
|
||||
|
||||
return tocList;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Recursively parses a sitemap tree
|
||||
/// </summary>
|
||||
/// <param name="text">content text</param>
|
||||
/// <param name="arrNodes">arraylist which receives the extracted nodes</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
static private void ParseTree( ArrayList arrNodes, CHMFile chmFile )
|
||||
{
|
||||
bool bProcessing=true;
|
||||
do
|
||||
{
|
||||
bProcessing=false;
|
||||
|
||||
// Indent
|
||||
int idxa=m_text1.IndexOf("<ul>",m_CurrentPos);
|
||||
int idxb=m_text1.IndexOf("<li>",m_CurrentPos);
|
||||
int idxc=m_text1.IndexOf("</ul>",m_CurrentPos);
|
||||
|
||||
if ((idxa<idxb) && (idxa<idxc) && (idxa>-1))
|
||||
{
|
||||
bProcessing=true;
|
||||
m_CurrentPos=idxa+4;
|
||||
if (arrNodes.Count<1)
|
||||
{
|
||||
ParseTree(arrNodes,chmFile);
|
||||
}
|
||||
else
|
||||
{
|
||||
ParseTree(((TOCItem)(arrNodes[arrNodes.Count-1])).Children,chmFile);
|
||||
}
|
||||
continue;
|
||||
}
|
||||
|
||||
// new item
|
||||
if ((idxb<idxa) && (idxb<idxc) && (idxb>-1))
|
||||
{
|
||||
|
||||
bProcessing=true;
|
||||
m_CurrentPos=idxb+4;
|
||||
|
||||
int idx2=m_text1.IndexOf("<object",m_CurrentPos);
|
||||
if (idx2!=-1)
|
||||
{
|
||||
int idx3=m_text1.IndexOf("</object>",idx2+7);
|
||||
if (idx3!=-1)
|
||||
{
|
||||
string text=m_text2.Substring(idx2,idx3-idx2);
|
||||
|
||||
m_CurrentPos=idx3+9;
|
||||
|
||||
// Parse items in text.
|
||||
TOCItem tocItem=ParseItems(text, chmFile);
|
||||
if (tocItem!=null)
|
||||
{
|
||||
arrNodes.Add(tocItem);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Undent
|
||||
if ((idxc<idxa) && (idxc<idxb) && (idxc>-1))
|
||||
{
|
||||
m_CurrentPos=idxc+5;
|
||||
bProcessing=true;
|
||||
return;
|
||||
}
|
||||
}
|
||||
while (bProcessing);
|
||||
}
|
||||
|
||||
|
||||
private static string RE_ParamBoundaries = @"\<param(?<innerText>.*?)\>";
|
||||
private const string RE_QuoteAttributes = @"( |\t)*(?<attributeName>[\-a-zA-Z0-9]*)( |\t)*=( |\t)*(?<attributeTD>[\""\'])?(?<attributeValue>.*?(?(attributeTD)\k<attributeTD>|([\s>]|.$)))";
|
||||
private static Regex ParamRE;
|
||||
private static Regex AttributesRE;
|
||||
|
||||
/// <summary>
|
||||
/// Parses tree nodes from the text
|
||||
/// </summary>
|
||||
/// <param name="itemstext">text containing the items</param>
|
||||
/// <param name="arrNodes">arraylist where the nodes should be added</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
private static TOCItem ParseItems( string itemstext, CHMFile chmFile)
|
||||
{
|
||||
int innerPTextIdx = ParamRE.GroupNumberFromName("innerText");
|
||||
|
||||
// get group-name indexes
|
||||
int nameIndex = AttributesRE.GroupNumberFromName("attributeName");
|
||||
int valueIndex = AttributesRE.GroupNumberFromName("attributeValue");
|
||||
int tdIndex = AttributesRE.GroupNumberFromName("attributeTD");
|
||||
|
||||
TOCItem tocItem = new TOCItem();
|
||||
|
||||
// read parameters
|
||||
int nParamIndex = 0;
|
||||
|
||||
while( ParamRE.IsMatch(itemstext, nParamIndex) )
|
||||
{
|
||||
Match mP = ParamRE.Match(itemstext, nParamIndex);
|
||||
|
||||
string innerP = mP.Groups[innerPTextIdx].Value;
|
||||
|
||||
string paramName = "";
|
||||
string paramValue = "";
|
||||
|
||||
int nAttrIdx = 0;
|
||||
|
||||
while( AttributesRE.IsMatch( innerP, nAttrIdx ) )
|
||||
{
|
||||
Match mA = AttributesRE.Match(innerP, nAttrIdx);
|
||||
|
||||
string attributeName = mA.Groups[nameIndex].Value;
|
||||
string attributeValue = mA.Groups[valueIndex].Value;
|
||||
string attributeTD = mA.Groups[tdIndex].Value;
|
||||
|
||||
if(attributeTD.Length > 0)
|
||||
{
|
||||
// delete the trailing textqualifier
|
||||
if( attributeValue.Length > 0)
|
||||
{
|
||||
int ltqi = attributeValue.LastIndexOf( attributeTD );
|
||||
|
||||
if(ltqi >= 0)
|
||||
{
|
||||
attributeValue = attributeValue.Substring(0,ltqi);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if( attributeName.ToLower() == "name")
|
||||
{
|
||||
paramName = attributeValue;
|
||||
}
|
||||
|
||||
if( attributeName.ToLower() == "value")
|
||||
{
|
||||
paramValue = attributeValue;
|
||||
}
|
||||
|
||||
nAttrIdx = mA.Index+mA.Length;
|
||||
}
|
||||
|
||||
tocItem.Params[paramName] = paramValue;
|
||||
switch(paramName.ToLower())
|
||||
{
|
||||
case "name":
|
||||
{
|
||||
tocItem.Name = paramValue;
|
||||
};break;
|
||||
case "local":
|
||||
{
|
||||
tocItem.Local = paramValue;
|
||||
};break;
|
||||
case "imagenumber":
|
||||
{
|
||||
tocItem.ImageIndex = Int32.Parse(paramValue);
|
||||
|
||||
if( tocItem.ImageIndex == 2)
|
||||
tocItem.ImageIndex = TOCItem.STD_FOLDER_HH1;
|
||||
};break;
|
||||
}
|
||||
|
||||
nParamIndex = mP.Index+mP.Length;
|
||||
}
|
||||
|
||||
tocItem.ChmFile = chmFile.ChmFilePath;
|
||||
return tocItem;
|
||||
}
|
||||
}
|
||||
}
|
||||
550
irc/TechBot/CHMLibrary/CHMDecoding/HHKParser.cs
Normal file
550
irc/TechBot/CHMLibrary/CHMDecoding/HHKParser.cs
Normal file
@@ -0,0 +1,550 @@
|
||||
using System;
|
||||
using System.IO;
|
||||
using System.Collections;
|
||||
using System.Text;
|
||||
using System.Text.RegularExpressions;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>HHKParser</c> implements a parser for HHK contents files.
|
||||
/// </summary>
|
||||
internal sealed class HHKParser
|
||||
{
|
||||
/// <summary>
|
||||
/// regular expressions for replacing the sitemap boundary tags
|
||||
/// </summary>
|
||||
private static string RE_ULOpening = @"\<ul\>"; // will be replaced by a '(' for nested parsing
|
||||
private static string RE_ULClosing = @"\</ul\>"; // will be replaced by a ')' for nested parsing
|
||||
|
||||
/// <summary>
|
||||
/// Matching ul-tags
|
||||
/// </summary>
|
||||
private static string RE_ULBoundaries = @"\<ul\>(?<innerText>.*)\</ul\>";
|
||||
/// <summary>
|
||||
/// Matching the nested tree structure.
|
||||
/// </summary>
|
||||
private static string RE_NestedBoundaries = @"\( (?> [^()]+ | \( (?<DEPTH>) | \) (?<-DEPTH>) )* (?(DEPTH)(?!)) \)";
|
||||
/// <summary>
|
||||
/// Matching object-tags
|
||||
/// </summary>
|
||||
private static string RE_ObjectBoundaries = @"\<object(?<innerText>.*?)\</object\>";
|
||||
/// <summary>
|
||||
/// Matching param tags
|
||||
/// </summary>
|
||||
private static string RE_ParamBoundaries = @"\<param(?<innerText>.*?)\>";
|
||||
/// <summary>
|
||||
/// Extracting tag attributes
|
||||
/// </summary>
|
||||
private const string RE_QuoteAttributes = @"( |\t)*(?<attributeName>[\-a-zA-Z0-9]*)( |\t)*=( |\t)*(?<attributeTD>[\""\'])?(?<attributeValue>.*?(?(attributeTD)\k<attributeTD>|([\s>]|.$)))";
|
||||
|
||||
/// <summary>
|
||||
/// private regular expressionobjects
|
||||
/// </summary>
|
||||
private static Regex ulRE;
|
||||
private static Regex NestedRE;
|
||||
private static Regex ObjectRE;
|
||||
private static Regex ParamRE;
|
||||
private static Regex AttributesRE;
|
||||
|
||||
/// <summary>
|
||||
/// Parses a HHK file and returns an ArrayList with the index tree
|
||||
/// </summary>
|
||||
/// <param name="hhkFile">string content of the hhk file</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
/// <returns>Returns an ArrayList with the index tree</returns>
|
||||
public static ArrayList ParseHHK(string hhkFile, CHMFile chmFile)
|
||||
{
|
||||
ArrayList indexList = new ArrayList();
|
||||
|
||||
ulRE = new Regex(RE_ULBoundaries, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
NestedRE = new Regex(RE_NestedBoundaries, RegexOptions.IgnorePatternWhitespace | RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
ObjectRE = new Regex(RE_ObjectBoundaries, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
ParamRE = new Regex(RE_ParamBoundaries, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
AttributesRE = new Regex(RE_QuoteAttributes, RegexOptions.Compiled | RegexOptions.IgnoreCase | RegexOptions.Singleline);
|
||||
|
||||
int innerTextIdx = ulRE.GroupNumberFromName("innerText");
|
||||
|
||||
if( ulRE.IsMatch(hhkFile, 0) )
|
||||
{
|
||||
Match m = ulRE.Match(hhkFile, 0);
|
||||
|
||||
if( ObjectRE.IsMatch(hhkFile, 0) ) // first object block contains information types and categories
|
||||
{
|
||||
Match mO = ObjectRE.Match(hhkFile, 0);
|
||||
int iOTxt = ObjectRE.GroupNumberFromName("innerText");
|
||||
|
||||
string globalText = mO.Groups[iOTxt].Value;
|
||||
|
||||
ParseGlobalSettings( globalText, chmFile );
|
||||
}
|
||||
|
||||
string innerText = m.Groups["innerText"].Value;
|
||||
|
||||
innerText = innerText.Replace("(", "(");
|
||||
innerText = innerText.Replace(")", ")");
|
||||
innerText = Regex.Replace(innerText, RE_ULOpening, "(", RegexOptions.IgnoreCase);
|
||||
innerText = Regex.Replace(innerText, RE_ULClosing, ")", RegexOptions.IgnoreCase);
|
||||
|
||||
ParseTree( innerText, null, indexList, chmFile );
|
||||
}
|
||||
|
||||
return indexList;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Recursively parses a sitemap tree
|
||||
/// </summary>
|
||||
/// <param name="text">content text</param>
|
||||
/// <param name="parent">Parent for all read items</param>
|
||||
/// <param name="arrNodes">arraylist which receives the extracted nodes</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
private static void ParseTree( string text, IndexItem parent, ArrayList arrNodes, CHMFile chmFile )
|
||||
{
|
||||
string strPreItems="", strPostItems="";
|
||||
string innerText = "";
|
||||
|
||||
int nIndex = 0;
|
||||
|
||||
while( NestedRE.IsMatch(text, nIndex) )
|
||||
{
|
||||
Match m = NestedRE.Match(text, nIndex);
|
||||
|
||||
innerText = m.Value.Substring( 1, m.Length-2);
|
||||
|
||||
strPreItems = text.Substring(nIndex,m.Index-nIndex);
|
||||
|
||||
ParseItems(strPreItems, parent, arrNodes, chmFile);
|
||||
|
||||
if((arrNodes.Count>0) && (innerText.Length > 0) )
|
||||
{
|
||||
IndexItem p = ((IndexItem)(arrNodes[arrNodes.Count-1]));
|
||||
ParseTree( innerText, p, arrNodes, chmFile );
|
||||
}
|
||||
|
||||
nIndex = m.Index+m.Length;
|
||||
}
|
||||
|
||||
if( nIndex == 0)
|
||||
{
|
||||
strPostItems = text.Substring(nIndex, text.Length-nIndex);
|
||||
ParseItems(strPostItems, parent, arrNodes, chmFile);
|
||||
}
|
||||
else if( nIndex < text.Length-1)
|
||||
{
|
||||
strPostItems = text.Substring(nIndex, text.Length-nIndex);
|
||||
ParseTree(strPostItems, parent, arrNodes, chmFile);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/// <summary>
|
||||
/// Parses nodes from the text
|
||||
/// </summary>
|
||||
/// <param name="itemstext">text containing the items</param>
|
||||
/// <param name="parentItem">parent index item</param>
|
||||
/// <param name="arrNodes">arraylist where the nodes should be added</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
private static void ParseItems( string itemstext, IndexItem parentItem, ArrayList arrNodes, CHMFile chmFile)
|
||||
{
|
||||
int innerTextIdx = ObjectRE.GroupNumberFromName("innerText");
|
||||
int innerPTextIdx = ParamRE.GroupNumberFromName("innerText");
|
||||
|
||||
// get group-name indexes
|
||||
int nameIndex = AttributesRE.GroupNumberFromName("attributeName");
|
||||
int valueIndex = AttributesRE.GroupNumberFromName("attributeValue");
|
||||
int tdIndex = AttributesRE.GroupNumberFromName("attributeTD");
|
||||
|
||||
int nObjStartIndex = 0;
|
||||
int nLastObjStartIndex = 0;
|
||||
string sKeyword = "";
|
||||
|
||||
while( ObjectRE.IsMatch(itemstext, nObjStartIndex) )
|
||||
{
|
||||
Match m = ObjectRE.Match(itemstext, nObjStartIndex);
|
||||
|
||||
string innerText = m.Groups[innerTextIdx].Value;
|
||||
|
||||
IndexItem idxItem = new IndexItem();
|
||||
|
||||
// read parameters
|
||||
int nParamIndex = 0;
|
||||
int nNameCnt = 0;
|
||||
|
||||
string paramTitle = "";
|
||||
string paramLocal = "";
|
||||
bool bAdded = false;
|
||||
|
||||
while( ParamRE.IsMatch(innerText, nParamIndex) )
|
||||
{
|
||||
Match mP = ParamRE.Match(innerText, nParamIndex);
|
||||
|
||||
string innerP = mP.Groups[innerPTextIdx].Value;
|
||||
|
||||
string paramName = "";
|
||||
string paramValue = "";
|
||||
|
||||
int nAttrIdx = 0;
|
||||
//sKeyword = "";
|
||||
|
||||
while( AttributesRE.IsMatch( innerP, nAttrIdx ) )
|
||||
{
|
||||
Match mA = AttributesRE.Match(innerP, nAttrIdx);
|
||||
|
||||
string attributeName = mA.Groups[nameIndex].Value;
|
||||
string attributeValue = mA.Groups[valueIndex].Value;
|
||||
string attributeTD = mA.Groups[tdIndex].Value;
|
||||
|
||||
if(attributeTD.Length > 0)
|
||||
{
|
||||
// delete the trailing textqualifier
|
||||
if( attributeValue.Length > 0)
|
||||
{
|
||||
int ltqi = attributeValue.LastIndexOf( attributeTD );
|
||||
|
||||
if(ltqi >= 0)
|
||||
{
|
||||
attributeValue = attributeValue.Substring(0,ltqi);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if( attributeName.ToLower() == "name")
|
||||
{
|
||||
paramName = HttpUtility.HtmlDecode(attributeValue); // for unicode encoded values
|
||||
nNameCnt++;
|
||||
}
|
||||
|
||||
if( attributeName.ToLower() == "value")
|
||||
{
|
||||
paramValue = HttpUtility.HtmlDecode(attributeValue); // for unicode encoded values
|
||||
// delete trailing /
|
||||
while((paramValue.Length>0)&&(paramValue[paramValue.Length-1] == '/'))
|
||||
paramValue = paramValue.Substring(0,paramValue.Length-1);
|
||||
}
|
||||
|
||||
nAttrIdx = mA.Index+mA.Length;
|
||||
}
|
||||
|
||||
if( nNameCnt == 1) // first "Name" param = keyword
|
||||
{
|
||||
sKeyword = "";
|
||||
|
||||
if(parentItem != null)
|
||||
sKeyword = parentItem.KeyWordPath + ",";
|
||||
|
||||
string sOldKW = sKeyword;
|
||||
|
||||
sKeyword += paramValue;
|
||||
|
||||
IndexItem idxFind = FindByKeyword(arrNodes, sKeyword);
|
||||
|
||||
if(idxFind != null)
|
||||
{
|
||||
idxItem = idxFind;
|
||||
}
|
||||
else
|
||||
{
|
||||
if( sKeyword.Split(new char[] {','}).Length > 1 )
|
||||
{
|
||||
idxItem.CharIndex = sKeyword.Length - paramValue.Length;
|
||||
}
|
||||
else
|
||||
{
|
||||
sKeyword = paramValue;
|
||||
sOldKW = sKeyword;
|
||||
idxItem.CharIndex = 0;
|
||||
}
|
||||
|
||||
idxItem.KeyWordPath = sKeyword;
|
||||
idxItem.Indent = sKeyword.Split(new char[] {','}).Length - 1;
|
||||
idxItem.IsSeeAlso = false;
|
||||
|
||||
sKeyword = sOldKW;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
|
||||
if( (nNameCnt > 2) && (paramName.ToLower()=="name") )
|
||||
{
|
||||
bAdded = true;
|
||||
IndexTopic idxTopic = new IndexTopic(paramTitle, paramLocal, chmFile.CompileFile, chmFile.ChmFilePath);
|
||||
|
||||
idxItem.Topics.Add( idxTopic );
|
||||
|
||||
paramTitle = "";
|
||||
paramLocal = "";
|
||||
}
|
||||
|
||||
switch(paramName.ToLower())
|
||||
{
|
||||
case "name":
|
||||
//case "keyword":
|
||||
{
|
||||
paramTitle = paramValue;
|
||||
};break;
|
||||
case "local":
|
||||
{
|
||||
paramLocal = paramValue.Replace("../", "").Replace("./", "");
|
||||
};break;
|
||||
case "type": // information type assignment for item
|
||||
{
|
||||
idxItem.InfoTypeStrings.Add( paramValue );
|
||||
};break;
|
||||
case "see also":
|
||||
{
|
||||
idxItem.AddSeeAlso(paramValue);
|
||||
idxItem.IsSeeAlso = true;
|
||||
bAdded = true;
|
||||
};break;
|
||||
}
|
||||
}
|
||||
|
||||
nParamIndex = mP.Index+mP.Length;
|
||||
}
|
||||
|
||||
if(!bAdded)
|
||||
{
|
||||
bAdded=false;
|
||||
IndexTopic idxTopic = new IndexTopic(paramTitle, paramLocal, chmFile.CompileFile, chmFile.ChmFilePath);
|
||||
|
||||
idxItem.Topics.Add( idxTopic );
|
||||
|
||||
paramTitle = "";
|
||||
paramLocal = "";
|
||||
}
|
||||
|
||||
idxItem.ChmFile = chmFile;
|
||||
arrNodes.Add( idxItem );
|
||||
|
||||
nLastObjStartIndex = nObjStartIndex;
|
||||
nObjStartIndex = m.Index+m.Length;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Searches an index-keyword in the index list
|
||||
/// </summary>
|
||||
/// <param name="indexList">index list to search</param>
|
||||
/// <param name="Keyword">keyword to find</param>
|
||||
/// <returns>Returns an <see cref="IndexItem">IndexItem</see> instance if found, otherwise null.</returns>
|
||||
private static IndexItem FindByKeyword(ArrayList indexList, string Keyword)
|
||||
{
|
||||
foreach(IndexItem curItem in indexList)
|
||||
{
|
||||
if( curItem.KeyWordPath == Keyword)
|
||||
return curItem;
|
||||
}
|
||||
|
||||
return null;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Parses the very first <OBJECT> tag in the sitemap file and extracts
|
||||
/// information types and categories.
|
||||
/// </summary>
|
||||
/// <param name="sText">text of the object tag</param>
|
||||
/// <param name="chmFile">CHMFile instance</param>
|
||||
private static void ParseGlobalSettings(string sText, CHMFile chmFile)
|
||||
{
|
||||
int innerPTextIdx = ParamRE.GroupNumberFromName("innerText");
|
||||
|
||||
// get group-name indexes
|
||||
int nameIndex = AttributesRE.GroupNumberFromName("attributeName");
|
||||
int valueIndex = AttributesRE.GroupNumberFromName("attributeValue");
|
||||
int tdIndex = AttributesRE.GroupNumberFromName("attributeTD");
|
||||
|
||||
// read parameters
|
||||
int nParamIndex = 0;
|
||||
|
||||
// 0... unknown
|
||||
// 1... inclusinve info type name
|
||||
// 2... exclusive info type name
|
||||
// 3... hidden info type name
|
||||
// 4... category name
|
||||
// 5... incl infotype name for category
|
||||
// 6... excl infotype name for category
|
||||
// 7... hidden infotype name for category
|
||||
int prevItem = 0;
|
||||
|
||||
string sName = "";
|
||||
string sDescription = "";
|
||||
string curCategory = "";
|
||||
|
||||
while( ParamRE.IsMatch(sText, nParamIndex) )
|
||||
{
|
||||
Match mP = ParamRE.Match(sText, nParamIndex);
|
||||
|
||||
string innerP = mP.Groups[innerPTextIdx].Value;
|
||||
|
||||
string paramName = "";
|
||||
string paramValue = "";
|
||||
|
||||
int nAttrIdx = 0;
|
||||
|
||||
while( AttributesRE.IsMatch( innerP, nAttrIdx ) )
|
||||
{
|
||||
Match mA = AttributesRE.Match(innerP, nAttrIdx);
|
||||
|
||||
string attributeName = mA.Groups[nameIndex].Value;
|
||||
string attributeValue = mA.Groups[valueIndex].Value;
|
||||
string attributeTD = mA.Groups[tdIndex].Value;
|
||||
|
||||
if(attributeTD.Length > 0)
|
||||
{
|
||||
// delete the trailing textqualifier
|
||||
if( attributeValue.Length > 0)
|
||||
{
|
||||
int ltqi = attributeValue.LastIndexOf( attributeTD );
|
||||
|
||||
if(ltqi >= 0)
|
||||
{
|
||||
attributeValue = attributeValue.Substring(0,ltqi);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if( attributeName.ToLower() == "name")
|
||||
{
|
||||
paramName = HttpUtility.HtmlDecode(attributeValue); // for unicode encoded values
|
||||
}
|
||||
|
||||
if( attributeName.ToLower() == "value")
|
||||
{
|
||||
paramValue = HttpUtility.HtmlDecode(attributeValue); // for unicode encoded values
|
||||
// delete trailing /
|
||||
while((paramValue.Length>0)&&(paramValue[paramValue.Length-1] == '/'))
|
||||
paramValue = paramValue.Substring(0,paramValue.Length-1);
|
||||
|
||||
}
|
||||
|
||||
nAttrIdx = mA.Index+mA.Length;
|
||||
}
|
||||
|
||||
switch(paramName.ToLower())
|
||||
{
|
||||
case "savetype": // inclusive information type name
|
||||
{
|
||||
prevItem = 1;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
case "savetypedesc": // description of information type
|
||||
{
|
||||
InformationTypeMode mode = InformationTypeMode.Inclusive;
|
||||
sDescription = paramValue;
|
||||
|
||||
if( prevItem == 1)
|
||||
mode = InformationTypeMode.Inclusive;
|
||||
if( prevItem == 2)
|
||||
mode = InformationTypeMode.Exclusive;
|
||||
if( prevItem == 3)
|
||||
mode = InformationTypeMode.Hidden;
|
||||
|
||||
if( chmFile.GetInformationType( sName ) == null)
|
||||
{
|
||||
// check if the HtmlHelpSystem already holds such an information type
|
||||
if( chmFile.SystemInstance.GetInformationType( sName ) == null)
|
||||
{
|
||||
// info type not found yet
|
||||
|
||||
InformationType newType = new InformationType(sName, sDescription, mode);
|
||||
chmFile.InformationTypes.Add(newType);
|
||||
}
|
||||
else
|
||||
{
|
||||
InformationType sysType = chmFile.SystemInstance.GetInformationType( sName );
|
||||
chmFile.InformationTypes.Add( sysType );
|
||||
}
|
||||
}
|
||||
|
||||
prevItem = 0;
|
||||
};break;
|
||||
case "saveexclusive": // exclusive information type name
|
||||
{
|
||||
prevItem = 2;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
case "savehidden": // hidden information type name
|
||||
{
|
||||
prevItem = 3;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
case "category": // category name
|
||||
{
|
||||
prevItem = 4;
|
||||
sName = paramValue;
|
||||
curCategory = sName;
|
||||
};break;
|
||||
case "categorydesc": // category description
|
||||
{
|
||||
sDescription = paramValue;
|
||||
|
||||
if( chmFile.GetCategory( sName ) == null)
|
||||
{
|
||||
// check if the HtmlHelpSystem already holds such a category
|
||||
if( chmFile.SystemInstance.GetCategory( sName ) == null)
|
||||
{
|
||||
// add category
|
||||
Category newCat = new Category(sName, sDescription);
|
||||
chmFile.Categories.Add(newCat);
|
||||
}
|
||||
else
|
||||
{
|
||||
Category sysCat = chmFile.SystemInstance.GetCategory( sName );
|
||||
chmFile.Categories.Add( sysCat );
|
||||
}
|
||||
}
|
||||
|
||||
prevItem = 0;
|
||||
};break;
|
||||
case "type": // inclusive information type which is member of the previously read category
|
||||
{
|
||||
prevItem = 5;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
case "typedesc": // description of type for category
|
||||
{
|
||||
sDescription = paramValue;
|
||||
Category cat = chmFile.GetCategory( curCategory );
|
||||
|
||||
if( cat != null)
|
||||
{
|
||||
// category found
|
||||
InformationType infoType = chmFile.GetInformationType( sName );
|
||||
|
||||
if( infoType != null)
|
||||
{
|
||||
if( !cat.ContainsInformationType(infoType))
|
||||
{
|
||||
infoType.SetCategoryFlag(true);
|
||||
cat.AddInformationType(infoType);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
prevItem = 0;
|
||||
};break;
|
||||
case "typeexclusive": // exclusive information type which is member of the previously read category
|
||||
{
|
||||
prevItem = 6;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
case "typehidden": // hidden information type which is member of the previously read category
|
||||
{
|
||||
prevItem = 7;
|
||||
sName = paramValue;
|
||||
};break;
|
||||
default:
|
||||
{
|
||||
prevItem = 0;
|
||||
sName = "";
|
||||
sDescription = "";
|
||||
};break;
|
||||
}
|
||||
|
||||
nParamIndex = mP.Index+mP.Length;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
245
irc/TechBot/CHMLibrary/CHMDecoding/TopicEntry.cs
Normal file
245
irc/TechBot/CHMLibrary/CHMDecoding/TopicEntry.cs
Normal file
@@ -0,0 +1,245 @@
|
||||
using System;
|
||||
using System.IO;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>TopicEntry</c> stores the data for one topic entry
|
||||
/// </summary>
|
||||
internal sealed class TopicEntry
|
||||
{
|
||||
/// <summary>
|
||||
/// Internal member storing the offset of this topic entry
|
||||
/// </summary>
|
||||
private int _entryOffset = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the index of the binary toc
|
||||
/// </summary>
|
||||
private int _tocidxOffset = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the string offset of the title
|
||||
/// </summary>
|
||||
private int _titleOffset = 0;
|
||||
/// <summary>
|
||||
/// Internal member storuing the urltable offset
|
||||
/// </summary>
|
||||
private int _urltableOffset = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the visibility mode
|
||||
/// </summary>
|
||||
private int _visibilityMode = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing an unknown mode
|
||||
/// </summary>
|
||||
private int _unknownMode = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the associated chmfile object
|
||||
/// </summary>
|
||||
private CHMFile _associatedFile = null;
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="entryOffset">offset of this entry</param>
|
||||
/// <param name="tocidxOffset">offset in the binary toc index</param>
|
||||
/// <param name="titleOffset">offset of the title (in the #STRINGS file)</param>
|
||||
/// <param name="urltableOffset">offset in the urltable containing the urlstr offset for the url</param>
|
||||
/// <param name="visibilityMode">visibility mode 2 indicates not in contents, 6 indicates that it is in the contents, 0/4 something else (unknown)</param>
|
||||
/// <param name="unknownMode">0, 2, 4, 8, 10, 12, 16, 32 (unknown)</param>
|
||||
public TopicEntry(int entryOffset, int tocidxOffset, int titleOffset, int urltableOffset, int visibilityMode, int unknownMode) :this(entryOffset, tocidxOffset, titleOffset, urltableOffset, visibilityMode, unknownMode, null)
|
||||
{
|
||||
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="entryOffset">offset of this entry</param>
|
||||
/// <param name="tocidxOffset">offset in the binary toc index</param>
|
||||
/// <param name="titleOffset">offset of the title (in the #STRINGS file)</param>
|
||||
/// <param name="urltableOffset">offset in the urltable containing the urlstr offset for the url</param>
|
||||
/// <param name="visibilityMode">visibility mode 2 indicates not in contents, 6 indicates that it is in the contents, 0/4 something else (unknown)</param>
|
||||
/// <param name="unknownMode">0, 2, 4, 8, 10, 12, 16, 32 (unknown)</param>
|
||||
/// <param name="associatedFile">associated chmfile object</param>
|
||||
internal TopicEntry(int entryOffset, int tocidxOffset, int titleOffset, int urltableOffset, int visibilityMode, int unknownMode, CHMFile associatedFile)
|
||||
{
|
||||
_entryOffset = entryOffset;
|
||||
_tocidxOffset = tocidxOffset;
|
||||
_titleOffset = titleOffset;
|
||||
_urltableOffset = urltableOffset;
|
||||
_visibilityMode = visibilityMode;
|
||||
_unknownMode = unknownMode;
|
||||
_associatedFile = associatedFile;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Standard constructor
|
||||
/// </summary>
|
||||
internal TopicEntry()
|
||||
{
|
||||
}
|
||||
|
||||
#region Data dumping
|
||||
/// <summary>
|
||||
/// Dump the class data to a binary writer
|
||||
/// </summary>
|
||||
/// <param name="writer">writer to write the data</param>
|
||||
internal void Dump(ref BinaryWriter writer)
|
||||
{
|
||||
writer.Write( _entryOffset );
|
||||
writer.Write( _tocidxOffset );
|
||||
writer.Write( _titleOffset );
|
||||
writer.Write( _urltableOffset );
|
||||
writer.Write( _visibilityMode );
|
||||
writer.Write( _unknownMode );
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Reads the object data from a dump store
|
||||
/// </summary>
|
||||
/// <param name="reader">reader to read the data</param>
|
||||
internal void ReadDump(ref BinaryReader reader)
|
||||
{
|
||||
_entryOffset = reader.ReadInt32();
|
||||
_tocidxOffset = reader.ReadInt32();
|
||||
_titleOffset = reader.ReadInt32();
|
||||
_urltableOffset = reader.ReadInt32();
|
||||
_visibilityMode = reader.ReadInt32();
|
||||
_unknownMode = reader.ReadInt32();
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Sets the associated CHMFile instance
|
||||
/// </summary>
|
||||
/// <param name="associatedFile">instance to set</param>
|
||||
internal void SetCHMFile(CHMFile associatedFile)
|
||||
{
|
||||
_associatedFile = associatedFile;
|
||||
}
|
||||
#endregion
|
||||
|
||||
/// <summary>
|
||||
/// Gets the associated chm file
|
||||
/// </summary>
|
||||
internal CHMFile ChmFile
|
||||
{
|
||||
get { return _associatedFile; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the offset of this entry
|
||||
/// </summary>
|
||||
internal int EntryOffset
|
||||
{
|
||||
get { return _entryOffset; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the tocidx offset
|
||||
/// </summary>
|
||||
internal int TOCIdxOffset
|
||||
{
|
||||
get { return _tocidxOffset; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the title offset of the #STRINGS file
|
||||
/// </summary>
|
||||
internal int TitleOffset
|
||||
{
|
||||
get { return _titleOffset; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the urltable offset
|
||||
/// </summary>
|
||||
internal int UrlTableOffset
|
||||
{
|
||||
get { return _urltableOffset; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the title of the topic entry
|
||||
/// </summary>
|
||||
public string Title
|
||||
{
|
||||
get
|
||||
{
|
||||
if( _associatedFile == null)
|
||||
return String.Empty;
|
||||
|
||||
if( _associatedFile.StringsFile == null)
|
||||
return String.Empty;
|
||||
|
||||
string sTemp = (string)_associatedFile.StringsFile[ _titleOffset ];
|
||||
|
||||
if(sTemp == null)
|
||||
return String.Empty;
|
||||
|
||||
return sTemp;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the url of the topic
|
||||
/// </summary>
|
||||
public string Locale
|
||||
{
|
||||
get
|
||||
{
|
||||
if( _associatedFile == null)
|
||||
return String.Empty;
|
||||
|
||||
if( _associatedFile.UrltblFile == null)
|
||||
return String.Empty;
|
||||
|
||||
UrlTableEntry utEntry = (UrlTableEntry)_associatedFile.UrltblFile[ _urltableOffset ];
|
||||
|
||||
if(utEntry == null)
|
||||
return String.Empty;
|
||||
|
||||
if(utEntry.URL == "")
|
||||
return String.Empty;
|
||||
|
||||
return utEntry.URL;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the URL of this topic
|
||||
/// </summary>
|
||||
public string URL
|
||||
{
|
||||
get
|
||||
{
|
||||
if(Locale.Length <= 0)
|
||||
return "about:blank";
|
||||
|
||||
if( (Locale.ToLower().IndexOf("http://") >= 0) ||
|
||||
(Locale.ToLower().IndexOf("https://") >= 0) ||
|
||||
(Locale.ToLower().IndexOf("mailto:") >= 0) ||
|
||||
(Locale.ToLower().IndexOf("ftp://") >= 0) ||
|
||||
(Locale.ToLower().IndexOf("ms-its:") >= 0))
|
||||
return Locale;
|
||||
|
||||
return HtmlHelpSystem.UrlPrefix + _associatedFile.ChmFilePath + "::/" + Locale;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the visibility mode
|
||||
/// </summary>
|
||||
public int VisibilityMode
|
||||
{
|
||||
get { return _visibilityMode; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the unknown mode
|
||||
/// </summary>
|
||||
public int UknownMode
|
||||
{
|
||||
get { return _unknownMode; }
|
||||
}
|
||||
}
|
||||
}
|
||||
175
irc/TechBot/CHMLibrary/CHMDecoding/UrlTableEntry.cs
Normal file
175
irc/TechBot/CHMLibrary/CHMDecoding/UrlTableEntry.cs
Normal file
@@ -0,0 +1,175 @@
|
||||
using System;
|
||||
using System.IO;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>UrlTableEntry</c> stores data for an URL-Table entry
|
||||
/// </summary>
|
||||
internal sealed class UrlTableEntry
|
||||
{
|
||||
/// <summary>
|
||||
/// Internal member storing the offset of this entry
|
||||
/// </summary>
|
||||
private int _entryOffset = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing a unique id
|
||||
/// </summary>
|
||||
private uint _uniqueID = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the topics index
|
||||
/// </summary>
|
||||
private int _topicsIndex = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the offset in the urlstr table
|
||||
/// </summary>
|
||||
private int _urlStrOffset = 0;
|
||||
/// <summary>
|
||||
/// Internal member storing the associated chmfile object
|
||||
/// </summary>
|
||||
private CHMFile _associatedFile = null;
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="uniqueID">unique id</param>
|
||||
/// <param name="entryOffset">offset of the entry</param>
|
||||
/// <param name="topicIndex">topic index</param>
|
||||
/// <param name="urlstrOffset">urlstr offset for filename</param>
|
||||
public UrlTableEntry(uint uniqueID, int entryOffset, int topicIndex, int urlstrOffset) : this(uniqueID, entryOffset, topicIndex, urlstrOffset, null)
|
||||
{
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Constructor of the class
|
||||
/// </summary>
|
||||
/// <param name="uniqueID">unique id</param>
|
||||
/// <param name="entryOffset">offset of the entry</param>
|
||||
/// <param name="topicIndex">topic index</param>
|
||||
/// <param name="urlstrOffset">urlstr offset for filename</param>
|
||||
/// <param name="associatedFile">associated chm file</param>
|
||||
internal UrlTableEntry(uint uniqueID, int entryOffset, int topicIndex, int urlstrOffset, CHMFile associatedFile)
|
||||
{
|
||||
_uniqueID = uniqueID;
|
||||
_entryOffset = entryOffset;
|
||||
_topicsIndex = topicIndex;
|
||||
_urlStrOffset = urlstrOffset;
|
||||
_associatedFile = associatedFile;
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Standard constructor
|
||||
/// </summary>
|
||||
internal UrlTableEntry()
|
||||
{
|
||||
}
|
||||
|
||||
#region Data dumping
|
||||
/// <summary>
|
||||
/// Dump the class data to a binary writer
|
||||
/// </summary>
|
||||
/// <param name="writer">writer to write the data</param>
|
||||
internal void Dump(ref BinaryWriter writer)
|
||||
{
|
||||
writer.Write( _urlStrOffset );
|
||||
writer.Write( _entryOffset );
|
||||
writer.Write( _topicsIndex );
|
||||
writer.Write( _urlStrOffset );
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Reads the object data from a dump store
|
||||
/// </summary>
|
||||
/// <param name="reader">reader to read the data</param>
|
||||
internal void ReadDump(ref BinaryReader reader)
|
||||
{
|
||||
_urlStrOffset = reader.ReadInt32();
|
||||
_entryOffset = reader.ReadInt32();
|
||||
_topicsIndex = reader.ReadInt32();
|
||||
_urlStrOffset = reader.ReadInt32();
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Sets the associated CHMFile instance
|
||||
/// </summary>
|
||||
/// <param name="associatedFile">instance to set</param>
|
||||
internal void SetCHMFile(CHMFile associatedFile)
|
||||
{
|
||||
_associatedFile = associatedFile;
|
||||
}
|
||||
#endregion
|
||||
|
||||
/// <summary>
|
||||
/// Gets the unique id of the entry
|
||||
/// </summary>
|
||||
internal uint UniqueID
|
||||
{
|
||||
get {return _uniqueID; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the offset of the entry
|
||||
/// </summary>
|
||||
internal int EntryOffset
|
||||
{
|
||||
get {return _entryOffset; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the topics index
|
||||
/// </summary>
|
||||
internal int TopicIndex
|
||||
{
|
||||
get {return _topicsIndex; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the urlstr offset
|
||||
/// </summary>
|
||||
internal int UrlstrOffset
|
||||
{
|
||||
get { return _urlStrOffset; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the url of the entry
|
||||
/// </summary>
|
||||
public string URL
|
||||
{
|
||||
get
|
||||
{
|
||||
if(_associatedFile == null)
|
||||
return String.Empty;
|
||||
|
||||
if(_associatedFile.UrlstrFile == null)
|
||||
return String.Empty;
|
||||
|
||||
string sTemp = (string)_associatedFile.UrlstrFile.GetURLatOffset( _urlStrOffset );
|
||||
|
||||
if( sTemp == null)
|
||||
return String.Empty;
|
||||
|
||||
return sTemp;
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets the associated topic for this url entry
|
||||
/// </summary>
|
||||
internal TopicEntry Topic
|
||||
{
|
||||
get
|
||||
{
|
||||
if(_associatedFile == null)
|
||||
return null;
|
||||
|
||||
if(_associatedFile.TopicsFile == null)
|
||||
return null;
|
||||
|
||||
TopicEntry tentry = _associatedFile.TopicsFile[ _topicsIndex*16 ];
|
||||
|
||||
return tentry;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
19
irc/TechBot/CHMLibrary/CHMDecoding/enumerations.cs
Normal file
19
irc/TechBot/CHMLibrary/CHMDecoding/enumerations.cs
Normal file
@@ -0,0 +1,19 @@
|
||||
using System;
|
||||
|
||||
namespace HtmlHelp.ChmDecoding
|
||||
{
|
||||
/// <summary>
|
||||
/// Enumeration for specifying the extraction mode of an toc or index item.
|
||||
/// </summary>
|
||||
public enum DataMode
|
||||
{
|
||||
/// <summary>
|
||||
/// TextBased - this item comes from a text-based sitemap file
|
||||
/// </summary>
|
||||
TextBased = 0,
|
||||
/// <summary>
|
||||
/// Binary - this item was extracted out of a binary stream
|
||||
/// </summary>
|
||||
Binary = 1
|
||||
}
|
||||
}
|
||||
16
irc/TechBot/CHMLibrary/CHMLibrary.cmbx
Normal file
16
irc/TechBot/CHMLibrary/CHMLibrary.cmbx
Normal file
@@ -0,0 +1,16 @@
|
||||
<Combine fileversion="1.0" name="CHMLibrary" description="">
|
||||
<StartMode startupentry="CHMLibrary" single="True">
|
||||
<Execute entry="CHMLibrary" type="None" />
|
||||
</StartMode>
|
||||
<Entries>
|
||||
<Entry filename=".\.\CHMLibrary.prjx" />
|
||||
</Entries>
|
||||
<Configurations active="Debug">
|
||||
<Configuration name="Release">
|
||||
<Entry name="CHMLibrary" configurationname="Debug" build="False" />
|
||||
</Configuration>
|
||||
<Configuration name="Debug">
|
||||
<Entry name="CHMLibrary" configurationname="Debug" build="False" />
|
||||
</Configuration>
|
||||
</Configurations>
|
||||
</Combine>
|
||||
58
irc/TechBot/CHMLibrary/CHMLibrary.prjx
Normal file
58
irc/TechBot/CHMLibrary/CHMLibrary.prjx
Normal file
@@ -0,0 +1,58 @@
|
||||
<Project name="CHMLibrary" standardNamespace="CHMLibrary" description="" newfilesearch="None" enableviewstate="True" version="1.1" projecttype="C#">
|
||||
<Contents>
|
||||
<File name=".\AssemblyInfo.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\Category.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\ChmFileInfo.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\Default.build" subtype="Code" buildaction="Nothing" dependson="" data="" />
|
||||
<File name=".\HtmlHelpSystem.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\HttpUtility.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\Index.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\IndexItem.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\IndexTopic.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\InformationType.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\TableOfContents.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\TOCItem.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\Storage" subtype="Directory" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\Storage\CHMStream.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding" subtype="Directory" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\BinaryReaderHelp.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\CHMBtree.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\CHMFile.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\CHMIdxhdr.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\CHMStrings.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\CHMSystem.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\CHMTocidx.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\CHMTopics.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\CHMUrlstr.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\CHMUrltable.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\DumpingInfo.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\enumerations.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\FullTextEngine.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\HHCParser2.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\HHCParser.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\HHKParser.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\TopicEntry.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
<File name=".\CHMDecoding\UrlTableEntry.cs" subtype="Code" buildaction="Compile" dependson="" data="" />
|
||||
</Contents>
|
||||
<References>
|
||||
<Reference type="Project" refto="Compression" localcopy="True" />
|
||||
</References>
|
||||
<DeploymentInformation target="" script="" strategy="File" />
|
||||
<Configuration runwithwarnings="True" name="Debug">
|
||||
<CodeGeneration runtime="MsNet" compiler="Csc" compilerversion="" warninglevel="4" nowarn="" includedebuginformation="True" optimize="False" unsafecodeallowed="False" generateoverflowchecks="True" mainclass="" target="Library" definesymbols="" generatexmldocumentation="False" win32Icon="" noconfig="False" nostdlib="False" />
|
||||
<Execution commandlineparameters="" consolepause="False" />
|
||||
<Output directory="..\bin\Debug" assembly="CHMLibrary" executeScript="" executeBeforeBuild="" executeAfterBuild="" executeBeforeBuildArguments="" executeAfterBuildArguments="" />
|
||||
</Configuration>
|
||||
<Configurations active="Debug">
|
||||
<Configuration runwithwarnings="True" name="Debug">
|
||||
<CodeGeneration runtime="MsNet" compiler="Csc" compilerversion="" warninglevel="4" nowarn="" includedebuginformation="True" optimize="False" unsafecodeallowed="False" generateoverflowchecks="True" mainclass="" target="Library" definesymbols="" generatexmldocumentation="False" win32Icon="" noconfig="False" nostdlib="False" />
|
||||
<Execution commandlineparameters="" consolepause="False" />
|
||||
<Output directory="..\bin\Debug" assembly="CHMLibrary" executeScript="" executeBeforeBuild="" executeAfterBuild="" executeBeforeBuildArguments="" executeAfterBuildArguments="" />
|
||||
</Configuration>
|
||||
<Configuration runwithwarnings="True" name="Release">
|
||||
<CodeGeneration runtime="MsNet" compiler="Csc" compilerversion="" warninglevel="4" nowarn="" includedebuginformation="False" optimize="True" unsafecodeallowed="False" generateoverflowchecks="False" mainclass="" target="Library" definesymbols="" generatexmldocumentation="False" win32Icon="" noconfig="False" nostdlib="False" />
|
||||
<Execution commandlineparameters="" consolepause="False" />
|
||||
<Output directory="..\bin\Release" assembly="CHMLibrary" executeScript="" executeBeforeBuild="" executeAfterBuild="" executeBeforeBuildArguments="" executeAfterBuildArguments="" />
|
||||
</Configuration>
|
||||
</Configurations>
|
||||
</Project>
|
||||
201
irc/TechBot/CHMLibrary/Category.cs
Normal file
201
irc/TechBot/CHMLibrary/Category.cs
Normal file
@@ -0,0 +1,201 @@
|
||||
using System;
|
||||
using System.Collections;
|
||||
using System.IO;
|
||||
|
||||
using HtmlHelp.ChmDecoding;
|
||||
|
||||
namespace HtmlHelp
|
||||
{
|
||||
/// <summary>
|
||||
/// The class <c>Category</c> implements methods/properties for handling an information category
|
||||
/// </summary>
|
||||
/// <remarks>Note: Information types and categories allow users to filter help contents.
|
||||
/// They are only supported if using sitemap TOC and/or sitemap Index.</remarks>
|
||||
public class Category
|
||||
{
|
||||
private string _name = "";
|
||||
private string _description = "";
|
||||
private ArrayList _infoTypes = null;
|
||||
private int _referenceCount = 1;
|
||||
|
||||
/// <summary>
|
||||
/// Standard constructor
|
||||
/// </summary>
|
||||
public Category() : this("","")
|
||||
{
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Standard constructor
|
||||
/// </summary>
|
||||
/// <param name="name">name of the category</param>
|
||||
/// <param name="description">description</param>
|
||||
public Category(string name, string description) : this(name, description, new ArrayList())
|
||||
{
|
||||
}
|
||||
/// <summary>
|
||||
/// Standard constructor
|
||||
/// </summary>
|
||||
/// <param name="name">name of the category</param>
|
||||
/// <param name="description">description</param>
|
||||
/// <param name="linkedInformationTypes">Arraylist of InformationType instances which applies to this category</param>
|
||||
public Category(string name, string description, ArrayList linkedInformationTypes)
|
||||
{
|
||||
_name = name;
|
||||
_description = description;
|
||||
_infoTypes = linkedInformationTypes;
|
||||
}
|
||||
|
||||
#region Data dumping
|
||||
/// <summary>
|
||||
/// Dump the class data to a binary writer
|
||||
/// </summary>
|
||||
/// <param name="writer">writer to write the data</param>
|
||||
internal void Dump(ref BinaryWriter writer)
|
||||
{
|
||||
writer.Write( _name );
|
||||
writer.Write( _description );
|
||||
|
||||
writer.Write( _infoTypes.Count );
|
||||
|
||||
for(int i=0; i<_infoTypes.Count;i++)
|
||||
{
|
||||
InformationType curType = _infoTypes[i] as InformationType;
|
||||
writer.Write( curType.Name );
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Reads the object data from a dump store
|
||||
/// </summary>
|
||||
/// <param name="reader">reader to read the data</param>
|
||||
/// <param name="chmFile">current CHMFile instance which reads from dump</param>
|
||||
internal void ReadDump(ref BinaryReader reader, CHMFile chmFile)
|
||||
{
|
||||
_name = reader.ReadString();
|
||||
_description = reader.ReadString();
|
||||
|
||||
int nCnt = reader.ReadInt32();
|
||||
|
||||
for(int i=0; i<nCnt; i++)
|
||||
{
|
||||
string sITName = reader.ReadString();
|
||||
|
||||
InformationType linkedType = chmFile.GetInformationType( sITName );
|
||||
|
||||
if(linkedType != null)
|
||||
{
|
||||
linkedType.SetCategoryFlag(true);
|
||||
_infoTypes.Add(linkedType);
|
||||
}
|
||||
}
|
||||
}
|
||||
#endregion
|
||||
|
||||
/// <summary>
|
||||
/// Merges the lineked information types from cat into this instance
|
||||
/// </summary>
|
||||
/// <param name="cat">category instance</param>
|
||||
internal void MergeInfoTypes(Category cat)
|
||||
{
|
||||
if(cat!=null)
|
||||
{
|
||||
if(cat.InformationTypes.Count > 0)
|
||||
{
|
||||
for(int i=0;i<cat.InformationTypes.Count;i++)
|
||||
{
|
||||
InformationType curType = cat.InformationTypes[i] as InformationType;
|
||||
|
||||
if(!ContainsInformationType(curType.Name))
|
||||
{
|
||||
curType.SetCategoryFlag(true);
|
||||
_infoTypes.Add(curType);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets/Sets the reference count of this information type instance
|
||||
/// </summary>
|
||||
internal int ReferenceCount
|
||||
{
|
||||
get { return _referenceCount; }
|
||||
set { _referenceCount = value; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets/Sets the name of the information type
|
||||
/// </summary>
|
||||
public string Name
|
||||
{
|
||||
get { return _name; }
|
||||
set { _name = value; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets/Sets the description of the information type
|
||||
/// </summary>
|
||||
public string Description
|
||||
{
|
||||
get { return _description; }
|
||||
set { _name = value; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Gets an ArrayList with the linked Information types
|
||||
/// </summary>
|
||||
public ArrayList InformationTypes
|
||||
{
|
||||
get { return _infoTypes; }
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Adds a new information type to the category
|
||||
/// </summary>
|
||||
/// <param name="type"></param>
|
||||
public void AddInformationType(InformationType type)
|
||||
{
|
||||
_infoTypes.Add(type);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Removes an information type from the category
|
||||
/// </summary>
|
||||
/// <param name="type"></param>
|
||||
public void RemoveInformationType(InformationType type)
|
||||
{
|
||||
_infoTypes.Remove(type);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Checks if the category contains an information type
|
||||
/// </summary>
|
||||
/// <param name="type">information type instance to check</param>
|
||||
/// <returns>Return true if the information type is part of this category</returns>
|
||||
public bool ContainsInformationType(InformationType type)
|
||||
{
|
||||
return _infoTypes.Contains(type);
|
||||
}
|
||||
|
||||
/// <summary>
|
||||
/// Checks if the category contains an information type
|
||||
/// </summary>
|
||||
/// <param name="name">name of the information type</param>
|
||||
/// <returns>Return true if the information type is part of this category</returns>
|
||||
public bool ContainsInformationType(string name)
|
||||
{
|
||||
for(int i=0;i<_infoTypes.Count;i++)
|
||||
{
|
||||
InformationType curType = _infoTypes[i] as InformationType;
|
||||
|
||||
if(curType.Name == name)
|
||||
return true;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
}
|
||||
}
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user