封欢 3 år sedan
förälder
incheckning
54b8dd43c0
100 ändrade filer med 2625 tillägg och 0 borttagningar
  1. 0 0
      dl/acl/.lock
  2. BIN
      dl/acl/acl-2.2.53.tar.gz
  3. 0 0
      dl/attr/.lock
  4. BIN
      dl/attr/attr-2.4.48.tar.gz
  5. 0 0
      dl/autoconf/.lock
  6. BIN
      dl/autoconf/autoconf-2.69.tar.xz
  7. 0 0
      dl/automake/.lock
  8. BIN
      dl/automake/automake-1.15.1.tar.xz
  9. 0 0
      dl/binutils/.lock
  10. BIN
      dl/binutils/binutils-2.34.tar.xz
  11. 0 0
      dl/bison/.lock
  12. BIN
      dl/bison/bison-3.7.1.tar.xz
  13. 0 0
      dl/busybox/.lock
  14. BIN
      dl/busybox/busybox-1.32.0.tar.bz2
  15. 0 0
      dl/cmake/.lock
  16. BIN
      dl/cmake/cmake-3.15.5.tar.gz
  17. 0 0
      dl/dhrystone/.lock
  18. 1779 0
      dl/dhrystone/dhry-c
  19. 0 0
      dl/dropbear/.lock
  20. BIN
      dl/dropbear/dropbear-2020.81.tar.bz2
  21. 0 0
      dl/e2fsprogs/.lock
  22. BIN
      dl/e2fsprogs/e2fsprogs-1.45.6.tar.xz
  23. 0 0
      dl/fakeroot/.lock
  24. BIN
      dl/fakeroot/fakeroot_1.25.3.orig.tar.gz
  25. 0 0
      dl/gawk/.lock
  26. BIN
      dl/gawk/gawk-5.1.0.tar.xz
  27. 0 0
      dl/genext2fs/.lock
  28. BIN
      dl/genext2fs/genext2fs-1.4.1.tar.gz
  29. 0 0
      dl/genimage/.lock
  30. BIN
      dl/genimage/genimage-13.tar.xz
  31. 0 0
      dl/gettext-tiny/.lock
  32. BIN
      dl/gettext-tiny/gettext-0.20.1.tar.xz
  33. BIN
      dl/gettext-tiny/gettext-tiny-0.3.2.tar.gz
  34. 0 0
      dl/glibc/.lock
  35. BIN
      dl/glibc/glibc-2.31-54-g6fdf971c9dbf7dac9bea552113fe4694015bbc4d.tar.gz
  36. BIN
      dl/glibc/glibc-2.32-2-g386543bc4495f658dcce6cd4d11e4ba6574a46f5.tar.gz
  37. 0 0
      dl/gmp/.lock
  38. BIN
      dl/gmp/gmp-6.1.2.tar.xz
  39. 0 0
      dl/gptfdisk/.lock
  40. BIN
      dl/gptfdisk/gptfdisk-1.0.5.tar.gz
  41. 0 0
      dl/htop/.lock
  42. BIN
      dl/htop/htop-3.0.2.tar.gz
  43. 0 0
      dl/iperf/.lock
  44. BIN
      dl/iperf/iperf-2.0.13.tar.gz
  45. 0 0
      dl/iperf3/.lock
  46. BIN
      dl/iperf3/iperf-3.9.tar.gz
  47. 0 0
      dl/libconfuse/.lock
  48. BIN
      dl/libconfuse/confuse-3.3.tar.xz
  49. 0 0
      dl/libjpeg/.lock
  50. BIN
      dl/libjpeg/jpegsrc.v9d.tar.gz
  51. 0 0
      dl/libkcapi/.lock
  52. BIN
      dl/libkcapi/libkcapi-1.1.5.tar.xz
  53. 0 0
      dl/libtirpc/.lock
  54. BIN
      dl/libtirpc/libtirpc-1.2.6.tar.bz2
  55. 0 0
      dl/libtool/.lock
  56. BIN
      dl/libtool/libtool-2.4.6.tar.xz
  57. 0 0
      dl/libzlib/.lock
  58. BIN
      dl/libzlib/zlib-1.2.11.tar.xz
  59. 0 0
      dl/linux/.lock
  60. 0 0
      dl/lmbench/.lock
  61. BIN
      dl/lmbench/lmbench-3.0-a9.tgz
  62. 0 0
      dl/lz4/.lock
  63. BIN
      dl/lz4/lz4-1.9.2.tar.gz
  64. 0 0
      dl/lzip/.lock
  65. BIN
      dl/lzip/lzip-1.21.tar.gz
  66. 0 0
      dl/lzo/.lock
  67. BIN
      dl/lzo/lzo-2.10.tar.gz
  68. 0 0
      dl/m4/.lock
  69. BIN
      dl/m4/m4-1.4.18.tar.xz
  70. 0 0
      dl/memtester/.lock
  71. BIN
      dl/memtester/memtester-4.5.0.tar.gz
  72. 0 0
      dl/mpc/.lock
  73. BIN
      dl/mpc/mpc-1.1.0.tar.gz
  74. 0 0
      dl/mpfr/.lock
  75. BIN
      dl/mpfr/mpfr-4.0.2.tar.xz
  76. 0 0
      dl/mtd/.lock
  77. BIN
      dl/mtd/mtd-utils-2.1.2.tar.bz2
  78. 0 0
      dl/mtools/.lock
  79. BIN
      dl/mtools/mtools-4.0.24.tar.lz
  80. 0 0
      dl/musl-compat-headers/.lock
  81. 846 0
      dl/musl-compat-headers/queue.h?rev=1.70
  82. 0 0
      dl/musl/.lock
  83. BIN
      dl/musl/musl-1.2.1.tar.gz
  84. 0 0
      dl/ncurses/.lock
  85. BIN
      dl/ncurses/ncurses-6.1-20190609-patch.sh.bz2
  86. BIN
      dl/ncurses/ncurses-6.1-20190615.patch.gz
  87. BIN
      dl/ncurses/ncurses-6.1-20190623.patch.gz
  88. BIN
      dl/ncurses/ncurses-6.1-20190630.patch.gz
  89. BIN
      dl/ncurses/ncurses-6.1-20190706.patch.gz
  90. BIN
      dl/ncurses/ncurses-6.1-20190713.patch.gz
  91. BIN
      dl/ncurses/ncurses-6.1-20190720.patch.gz
  92. BIN
      dl/ncurses/ncurses-6.1-20190727.patch.gz
  93. BIN
      dl/ncurses/ncurses-6.1-20190728.patch.gz
  94. BIN
      dl/ncurses/ncurses-6.1-20190803.patch.gz
  95. BIN
      dl/ncurses/ncurses-6.1-20190810.patch.gz
  96. BIN
      dl/ncurses/ncurses-6.1-20190817.patch.gz
  97. BIN
      dl/ncurses/ncurses-6.1-20190824.patch.gz
  98. BIN
      dl/ncurses/ncurses-6.1-20190831.patch.gz
  99. BIN
      dl/ncurses/ncurses-6.1-20190907.patch.gz
  100. BIN
      dl/ncurses/ncurses-6.1-20190914.patch.gz

+ 0 - 0
dl/acl/.lock


BIN
dl/acl/acl-2.2.53.tar.gz


+ 0 - 0
dl/attr/.lock


BIN
dl/attr/attr-2.4.48.tar.gz


+ 0 - 0
dl/autoconf/.lock


BIN
dl/autoconf/autoconf-2.69.tar.xz


+ 0 - 0
dl/automake/.lock


BIN
dl/automake/automake-1.15.1.tar.xz


+ 0 - 0
dl/binutils/.lock


BIN
dl/binutils/binutils-2.34.tar.xz


+ 0 - 0
dl/bison/.lock


BIN
dl/bison/bison-3.7.1.tar.xz


+ 0 - 0
dl/busybox/.lock


BIN
dl/busybox/busybox-1.32.0.tar.bz2


+ 0 - 0
dl/cmake/.lock


BIN
dl/cmake/cmake-3.15.5.tar.gz


+ 0 - 0
dl/dhrystone/.lock


+ 1779 - 0
dl/dhrystone/dhry-c

@@ -0,0 +1,1779 @@
+# to unbundle, sh this file (in an empty directory)
+echo RATIONALE 1>&2
+sed >RATIONALE <<'//GO.SYSIN DD RATIONALE' 's/^-//'
+-
+-
+-    Dhrystone Benchmark: Rationale for Version 2 and Measurement Rules
+-
+-        [published in SIGPLAN Notices 23,8 (Aug. 1988), 49-62]
+-
+-
+-                 Reinhold P. Weicker
+-                 Siemens AG, E STE 35
+-                 [now: Siemens AG, AUT E 51]
+-                 Postfach 3220
+-                 D-8520 Erlangen
+-                 Germany (West)
+-
+-
+-
+-
+-1.  Why a Version 2 of Dhrystone?
+-
+-The Dhrystone benchmark  program  [1]  has  become  a  popular  benchmark  for
+-CPU/compiler   performance   measurement,   in   particular  in  the  area  of
+-minicomputers, workstations, PC's and microprocesors.  It apparently satisfies
+-a  need  for  an  easy-to-use  integer benchmark; it gives a first performance
+-indication which is more meaningful than MIPS numbers which, in their  literal
+-meaning  (million  instructions  per  second), cannot be used across different
+-instruction sets (e.g. RISC  vs.  CISC).   With  the  increasing  use  of  the
+-benchmark, it seems necessary to reconsider the benchmark and to check whether
+-it can still fulfill this function.  Version 2 of Dhrystone is the  result  of
+-such a re-evaluation, it has been made for two reasons:
+-
+-o Dhrystone has been published in Ada [1], and Versions in Ada, Pascal  and  C
+-  have  been  distributed  by  Reinhold Weicker via floppy disk.  However, the
+-  version that was used most often for benchmarking has been the version  made
+-  by  Rick  Richardson  by another translation from the Ada version into the C
+-  programming language, this has been the version  distributed  via  the  UNIX
+-  network Usenet [2].
+-
+-  There is an obvious need for a common C version of Dhrystone, since C is  at
+-  present  the  most  popular  system  programming  language  for the class of
+-  systems (microcomputers, minicomputers,  workstations)  where  Dhrystone  is
+-  used  most.   There  should  be,  as  far as possible, only one C version of
+-  Dhrystone such that results can be compared  without  restrictions.  In  the
+-  past,  the  C  versions  distributed by Rick Richardson (Version 1.1) and by
+-  Reinhold Weicker had small (though not significant) differences.
+-
+-  Together with the new C version, the  Ada  and  Pascal  versions  have  been
+-  updated as well.
+-
+-o As far as it is  possible  without  changes  to  the  Dhrystone  statistics,
+-  optimizing   compilers   should   be  prevented  from  removing  significant
+-  statements.  It has  turned  out  in  the  past  that  optimizing  compilers
+-  suppressed  code  generation for too many statements (by "dead code removal"
+-  or  "dead  variable  elimination").   This  has  lead  to  the  danger  that
+-  benchmarking  results obtained by a naive application of Dhrystone - without
+-  inspection of the code that was generated - could become meaningless.
+-
+-The  overall  policiy  for  version  2  has  been  that  the  distribution  of
+-statements,  operand types and operand locality described in [1] should remain
+-unchanged as much as possible.  (Very few changes were necessary; their impact
+-should be negligible.)  Also, the order of statements should remain unchanged.
+-Although I am aware of some critical remarks on the benchmark - I  agree  with
+-several  of them - and know some suggestions for improvement, I didn't want to
+-change the benchmark into something different from what has  become  known  as
+-"Dhrystone"; the confusion generated by such a change would probably outweight
+-the benefits. If I were to write a new benchmark program, I wouldn't  give  it
+-the  name  "Dhrystone"  since  this  denotes  the  program  published  in [1].
+-However, I do recognize  the  need  for  a  larger  number  of  representative
+-programs  that can be used as benchmarks; users should always be encouraged to
+-use more than just one benchmark.
+-
+-The new versions (version 2.1 for C, Pascal and Ada) will  be  distributed  as
+-widely as possible.  (Version 2.1 differs from version 2.0 distributed via the
+-UNIX Network Usenet in  March  1988  only  in  a  few  corrections  for  minor
+-deficiencies  found  by  users  of  version 2.0.)  Readers who want to use the
+-benchmark for their own measurements can obtain  a  copy  in  machine-readable
+-form on floppy disk (MS-DOS or XENIX format) from the author.
+-
+-
+-2.  Overall Characteristics of Version 2
+-
+-In general, version 2  follows  -  in  the  parts  that  are  significant  for
+-performance  measurement,  i.e.   within  the measurement loop - the published
+-(Ada) version and the C versions previously distributed.  Where  the  versions
+-distributed  by  Rick Richardson [2] and Reinhold Weicker have been different,
+-it  follows  the  version  distributed  by  Reinhold  Weicker.  (However,  the
+-differences  have  been  so  small  that their impact on execution time in all
+-likelihood has been negligible.)  The initialization and UNIX  instrumentation
+-part  -  which  had  been  omitted  in  [1] - follows mostly the ideas of Rick
+-Richardson [2].  However, any changes in the initialization part  and  in  the
+-printing  of  the  result have no impact on performance measurement since they
+-are outside the measaurement loop.  As a concession to older compilers,  names
+-have been made unique within the first 8 characters for the C version.
+-
+-The original publication of Dhrystone did not contain any statements for  time
+-measurement  since  they  are necessarily system-dependent. However, it turned
+-out that it is not enough just to inclose the main procedure of Dhrystone in a
+-loop  and  to  measure the execution time.  If the variables that are computed
+-are not used somehow, there is the danger that the compiler considers them  as
+-"dead  variables" and suppresses code generation for a part of the statements.
+-Therefore in version 2 all variables of "main" are printed at the end  of  the
+-program.  This also permits some plausibility control for correct execution of
+-the benchmark.
+-
+-At several places in the benchmark, code has been added, but only in  branches
+-that  are  not  executed. The intention is that optimizing compilers should be
+-prevented from moving code out of the measurement loop, or from removing  code
+-altogether.  Statements that are executed have been changed in very few places
+-only.  In these cases, only the role of some operands has been changed, and it
+-was   made  sure  that  the  numbers  defining  the  "Dhrystone  distribution"
+-(distribution of statements, operand types and locality) still hold as much as
+-possible.   Except for sophisticated optimizing compilers, execution times for
+-version 2.1 should be the same as for previous versions.
+-
+-Because of the self-imposed limitation that the order and distribution of  the
+-executed  statements  should  not  be  changed,  there  are  still cases where
+-optimizing compilers may not generate code for some statements. To  a  certain
+-degree,  this  is  unavoidable  for  small synthetic benchmarks.  Users of the
+-benchmark are advised to check code listings whether code is generated for all
+-statements of Dhrystone.
+-
+-Contrary to the suggestion in the published paper and its realization  in  the
+-versions previously distributed, no attempt has been made to subtract the time
+-for the measurement loop overhead. (This calculation has proven  difficult  to
+-implement  in  a  correct  way,  and  its omission makes the program simpler.)
+-However, since the loop check is now part of the benchmark, this does have  an
+-impact  -  though a very minor one - on the distribution statistics which have
+-been updated for this version.
+-
+-
+-3.  Discussion of Individual Changes
+-
+-In this section, all changes are described that affect  the  measurement  loop
+-and  that  are  not  just  renamings  of variables. All remarks refer to the C
+-version; the other language versions have been updated similarly.
+-
+-In addition to adding  the  measurement  loop  and  the  printout  statements,
+-changes have been made at the following places:
+-
+-o In procedure "main", three statements have been added  in  the  non-executed
+-  "then" part of the statement
+-
+-        if (Enum_Loc == Func_1 (Ch_Index, 'C'))
+-
+-  they are
+-
+-        strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING");
+-        Int_2_Loc = Run_Index;
+-        Int_Glob = Run_Index;
+-
+-  The string assignment prevents  movement  of  the  preceding  assignment  to
+-  Str_2_Loc  (5'th  statement  of  "main")  out  of the measurement loop (This
+-  probably will not happen for the C version, but it did happen  with  another
+-  language   and  compiler.)   The  assignment  to  Int_2_Loc  prevents  value
+-  propagation for Int_2_Loc, and the assignment to Int_Glob makes the value of
+-  Int_Glob possibly dependent from the value of Run_Index.
+-
+-o In the three arithmetic computations at the end of the measurement  loop  in
+-  "main  ",  the  role  of  some  variables has been exchanged, to prevent the
+-  division from just cancelling out the multiplication as it was  in  [1].   A
+-  very   smart  compiler  might  have  recognized  this  and  suppressed  code
+-  generation for the division.
+-
+-o For Proc_2, no code has been changed, but the values of the actual parameter
+-  have changed due to changes in "main".
+-
+-o In Proc_4, the second assignment has been changed from
+-
+-        Bool_Loc = Bool_Loc | Bool_Glob;
+-
+-  to
+-
+-        Bool_Glob = Bool_Loc | Bool_Glob;
+-
+-  It now assigns a value to a global variable  instead  of  a  local  variable
+-  (Bool_Loc);   Bool_Loc  would  be  a  "dead  variable"  which  is  not  used
+-  afterwards.
+-
+-o In Func_1, the statement
+-
+-        Ch_1_Glob = Ch_1_Loc;
+-
+-  was added in the non-executed "else" part of the "if" statement, to  prevent
+-  the suppression of code generation for the assignment to Ch_1_Loc.
+-
+-o In Func_2, the second character comparison statement has been changed to
+-
+-        if (Ch_Loc == 'R')
+-
+-  ('R' instead of 'X') because  a  comparison  with  'X'  is  implied  in  the
+-  preceding "if" statement.
+-
+-  Also in Func_2, the statement
+-
+-        Int_Glob = Int_Loc;
+-
+-  has been added in the non-executed part of the last "if" statement, in order
+-  to prevent Int_Loc from becoming a dead variable.
+-
+-o In Func_3, a non-executed "else" part has been added to the "if"  statement.
+-  While  the  program  would  not be incorrect without this "else" part, it is
+-  considered bad programming practice if a function  can  be  left  without  a
+-  return value.
+-
+-  To compensate for this change, the (non-executed) "else" part  in  the  "if"
+-  statement of Proc_3 was removed.
+-
+-The distribution statistics have been changed only  by  the  addition  of  the
+-measurement loop iteration (1 additional statement, 4 additional local integer
+-operands) and by the change in Proc_4  (one  operand  changed  from  local  to
+-global).  The distribution statistics in the comment headers have been updated
+-accordingly.
+-
+-
+-4.  String Operations
+-
+-The string operations (string assignment and string comparison) have not  been
+-changed, to keep the program consistent with the original version.
+-
+-There has been some concern that the string operations are over-represented in
+-the  program,  and that execution time is dominated by these operations.  This
+-was true in particular when optimizing compilers removed too much code in  the
+-main part of the program, this should have been mitigated in version 2.
+-
+-It should be noted that this is a  language-dependent  issue:   Dhrystone  was
+-first  published  in  Ada, and with Ada or Pascal semantics, the time spent in
+-the string operations is,  at  least  in  all  implementations  known  to  me,
+-considerably smaller.  In Ada and Pascal, assignment and comparison of strings
+-are operators defined in the language, and the upper  bounds  of  the  strings
+-occuring  in  Dhrystone  are part of the type information known at compilation
+-time.  The compilers can therefore generate  efficient  inline  code.   In  C,
+-string  assignemt  and comparisons are not part of the language, so the string
+-operations must be expressed in terms of the C library functions "strcpy"  and
+-"strcmp".   (ANSI  C  allows  an  implementation  to use inline code for these
+-functions.)  In addition to the overhead caused by additional function  calls,
+-these  functions  are  defined for null-terminated strings where the length of
+-the strings is not known at compilation time; the function has to check  every
+-byte for the termination condition (the null byte).
+-
+-Obviously, a C library which includes efficiently coded "strcpy" and  "strcmp"
+-functions  helps to obtain good Dhrystone results. However, I don't think that
+-this is unfair since string  functions  do  occur  quite  frequently  in  real
+-programs  (editors, command interpreters, etc.).  If the strings functions are
+-implemented efficiently,  this  helps  real  programs  as  well  as  benchmark
+-programs.
+-
+-I admit that the  string  comparison  in  Dhrystone  terminates  later  (after
+-scanning  20  characters)  than most string comparisons in real programs.  For
+-consistency with the original benchmark, I didn't change the  program  despite
+-this weakness.
+-
+-
+-5.  Intended Use of Dhrystone
+-
+-When Dhrystone is used, the following "ground rules" apply:
+-
+-o Separate compilation (Ada and C versions)
+-
+-  As mentioned in [1], Dhrystone was written  to  reflect  actual  programming
+-  practice  in  systems  programming.   The  division into several compilation
+-  units (5 in the Ada version, 2 in the C version)  is  intended,  as  is  the
+-  distribution of inter-module and intra-module subprogram calls.  Although on
+-  many systems there will be no difference in execution time  to  a  Dhrystone
+-  version  where  all  compilation units are merged into one file, the rule is
+-  that separate compilation should  be  used.   The  intention  is  that  real
+-  programming  practice,  where  programs  consist  of  several  independently
+-  compiled units, should  be  reflected.   This  also  has  implies  that  the
+-  compiler,  while  compiling  one  unit,  has no information about the use of
+-  variables, register allocation etc.  occuring in  other  compilation  units.
+-  Although  in  real  life  compilation  units  will  probably  be larger, the
+-  intention is that these effects  of  separate  compilation  are  modeled  in
+-  Dhrystone.
+-
+-  A few language systems have post-linkage optimization available (e.g., final
+-  register allocation is performed after linkage).  This is a borderline case:
+-  Post-linkage  optimization  involves  additional  program  preparation  time
+-  (although  not  as  much  as  compilation in one unit) which may prevent its
+-  general use in practical programming.  I think that  since  it  defeats  the
+-  intentions given above, it should not be used for Dhrystone.
+-
+-  Unfortunately, ISO/ANSI  Pascal  does  not  contain  language  features  for
+-  separate  compilation.   Although  most  commercial Pascal compilers provide
+-  separate compilation in some way, we cannot use it for Dhrystone since  such
+-  a  version  would  not  be portable.  Therefore, no attempt has been made to
+-  provide a Pascal version with several compilation units.
+-
+-o No procedure merging
+-
+-  Although Dhrystone contains some very short procedures where execution would
+-  benefit  from  procedure  merging (inlining, macro expansion of procedures),
+-  procedure merging is not to be used.  The reason is that the  percentage  of
+-  procedure  and  function  calls  is  part of the "Dhrystone distribution" of
+-  statements contained in [1].  This restriction does not hold for the  string
+-  functions  of  the  C  version  since ANSI C allows an implementation to use
+-  inline code for these functions.
+-
+-o Other optimizations are allowed, but they should be indicated
+-
+-  It is often hard to draw an exact line between "normal code generation"  and
+-  "optimization"  in  compilers:  Some compilers perform operations by default
+-  that are invoked in other compilers only  when  optimization  is  explicitly
+-  requested.  Also, we cannot avoid that in benchmarking people try to achieve
+-  results that look as good as possible.  Therefore,  optimizations  performed
+-  by  compilers  -  other  than  those  listed  above - are not forbidden when
+-  Dhrystone execution times are measured.  Dhrystone is  not  intended  to  be
+-  non-optimizable  but  is  intended  to  be  similarly  optimizable as normal
+-  programs.   For  example,  there  are  several  places  in  Dhrystone  where
+-  performance   benefits   from   optimizations   like   common  subexpression
+-  elimination, value  propagation  etc.,  but  normal  programs  usually  also
+-  benefit  from  these  optimizations.   Therefore,  no  effort  was  made  to
+-  artificially  prevent  such  optimizations.   However,  measurement  reports
+-  should  indicate  which  compiler  optimization  levels  have been used, and
+-  reporting results with different levels of  compiler  optimization  for  the
+-  same hardware is encouraged.
+-
+-o Default results are those without "register" declarations (C version)
+-
+-  When Dhrystone results are quoted  without  additional  qualification,  they
+-  should  be  understood  as  results  obtained  without use of the "register"
+-  attribute. Good compilers should be able to make good use of registers  even
+-  without explicit register declarations ([3], p. 193).
+-
+-Of course, for experimental  purposes,  post-linkage  optimization,  procedure
+-merging and/or compilation in one unit can be done to determine their effects.
+-However,  Dhrystone  numbers  obtained  under  these  conditions   should   be
+-explicitly  marked as such; "normal" Dhrystone results should be understood as
+-results obtained following the ground rules listed above.
+-
+-In any case, for serious performance evaluation, users are advised to ask  for
+-code  listings  and  to  check  them carefully.  In this way, when results for
+-different systems are  compared,  the  reader  can  get  a  feeling  how  much
+-performance  difference is due to compiler optimization and how much is due to
+-hardware speed.
+-
+-
+-6.  Acknowledgements
+-
+-The C version 2.1 of Dhrystone has been developed  in  cooperation  with  Rick
+-Richardson  (Tinton  Falls,  NJ), it incorporates many ideas from the "Version
+-1.1" distributed previously by him over the UNIX network Usenet.  Through  his
+-activity with Usenet, Rick Richardson has made a very valuable contribution to
+-the dissemination of the benchmark.  I also thank  Chaim  Benedelac  (National
+-Semiconductor),  David Ditzel (SUN), Earl Killian and John Mashey (MIPS), Alan
+-Smith and Rafael  Saavedra-Barrera  (UC  at  Berkeley)  for  their  help  with
+-comments on earlier versions of the benchmark.
+-
+-
+-7.  Bibliography
+-
+-[1]
+-   Reinhold P. Weicker: Dhrystone: A Synthetic Systems Programming Benchmark.
+-   Communications of the ACM 27, 10 (Oct. 1984), 1013-1030
+-
+-[2]
+-   Rick Richardson: Dhrystone 1.1 Benchmark Summary (and Program Text)
+-   Informal Distribution via "Usenet", Last Version Known  to  me:  Sept.  21,
+-   1987
+-
+-[3]
+-   Brian W. Kernighan and Dennis M. Ritchie:  The C Programming Language.
+-   Prentice-Hall, Englewood Cliffs (NJ) 1978
+-
+//GO.SYSIN DD RATIONALE
+echo README_C 1>&2
+sed >README_C <<'//GO.SYSIN DD README_C' 's/^-//'
+-This "shar" file contains the documentation for the
+-electronic mail distribution of the Dhrystone benchmark (C version 2.1);
+-a companion "shar" file contains the source code.
+-(Because of mail length restrictions for some mailers, I have
+-split the distribution in two parts.)
+-
+-For versions in other languages, see the other "shar" files.
+-
+-Files containing the C version (*.h: Header File, *.c: C Modules)
+-
+-  dhry.h
+-  dhry_1.c
+-  dhry_2.c
+-  
+-The file RATIONALE contains the article 
+-
+-  "Dhrystone Benchmark: Rationale for Version 2 and Measurement Rules"
+-
+-which has been published, together with the C source code (Version 2.0),
+-in SIGPLAN Notices vol. 23, no. 8 (Aug. 1988), pp. 49-62.
+-This article explains all changes that have been made for Version 2,
+-compared with the version of the original publication
+-in Communications of the ACM vol. 27, no. 10 (Oct. 1984), pp. 1013-1030.
+-It also contains "ground rules" for benchmarking with Dhrystone
+-which should be followed by everyone who uses the program and publishes
+-Dhrystone results.
+-
+-Compared with the Version 2.0 published in SIGPLAN Notices, Version 2.1
+-contains a few corrections that have been made after Version 2.0 was
+-distriobuted over the UNIX network Usenet. These small differences between
+-Version 2.0 and 2.1 should not affect execution time measurements.
+-For those who want to compare the exact contents of both versions,
+-the file "dhry_c.dif" contains the differences between the two versions,
+-as generated by a file comparison of the corresponding files with the
+-UNIX utility "diff".
+-
+-The file VARIATIONS contains the article
+-
+-  "Understanding Variations in Dhrystone Performance"
+-
+-which has been published in Microprocessor Report, May 1989
+-(Editor: M. Slater), pp. 16-17. It describes the points that users
+-should know if C Dhrystone results are compared.
+-
+-Recipients of this shar file who perform measurements are asked
+-to send measurement results to the author and/or to Rick Richardson.
+-Rick Richardson publishes regularly Dhrystone results on the UNIX network
+-Usenet. For submissions of results to him (preferably by electronic mail,
+-see address in the program header), he has provided a form which is contained
+-in the file "submit.frm".
+-
+-
+-The following files are contained in other "shar" files:
+-
+-Files containing the Ada version (*.s: Specifications, *.b: Bodies):
+-
+-  d_global.s
+-  d_main.b
+-  d_pack_1.b
+-  d_pack_1.s
+-  d_pack_2.b
+-  d_pack_2.s
+-
+-File containing the Pascal version:
+-
+-  dhry.p
+-
+-
+-February 22, 1990
+-
+-                 Reinhold P. Weicker
+-                 Siemens AG, AUT E 51
+-                 Postfach 3220
+-                 D-8520 Erlangen
+-                 Germany (West)
+-
+-                 Phone:  [xxx-49]-9131-7-20330  (8-17 Central European Time)
+-                 UUCP:   ..!mcsun!unido!estevax!weicker
+//GO.SYSIN DD README_C
+echo VARIATIONS 1>&2
+sed >VARIATIONS <<'//GO.SYSIN DD VARIATIONS' 's/^-//'
+-
+-            Understanding Variations in Dhrystone Performance
+-
+-
+-
+-          By Reinhold P. Weicker, Siemens AG, AUT E 51, Erlangen
+-
+-
+-
+-                                April 1989
+-
+-
+-                      This article has appeared in:
+-
+-
+-        Microprocessor Report, May 1989 (Editor: M. Slater), pp. 16-17
+-
+-
+-
+-
+-Microprocessor manufacturers tend to credit all the  performance  measured  by
+-benchmarks to the speed of their processors, they often don't even mention the
+-programming language and compiler used. In their detailed  documents,  usually
+-called  "performance brief" or "performance report," they usually do give more
+-details. However, these details are often lost in the press releases and other
+-marketing  statements.  For serious performance evaluation, it is necessary to
+-study the code generated by the various compilers.
+-
+-Dhrystone was originally published in Ada (Communications  of  the  ACM,  Oct.
+-1984).  However, since good Ada compilers were rare at this time and, together
+-with UNIX, C became more and more popular, the C version of Dhrystone  is  the
+-one  now  mainly  used in industry. There are "official" versions 2.1 for Ada,
+-Pascal, and C,  which  are  as  close  together  as  the  languages'  semantic
+-differences permit.
+-
+-Dhrystone contains two statements  where  the  programming  language  and  its
+-translation play a major part in the execution time measured by the benchmark:
+-
+-  o   String assignment (in procedure Proc_0 / main)
+-  o   String comparison (in function Func_2)
+-
+-In Ada and Pascal, strings are arrays of characters where the  length  of  the
+-string  is  part  of the type information known at compile time. In C, strings
+-are also arrays of characters, but there  are  no  operators  defined  in  the
+-language  for  assignment  and  comparison  of  strings.   Instead,  functions
+-"strcpy" and "strcmp" are used. These functions are  defined  for  strings  of
+-arbitrary  length, and make use of the fact that strings in C have to end with
+-a terminating null byte. For general-purpose calls  to  these  functions,  the
+-implementor  can  assume  nothing  about  the  length and the alignment of the
+-strings involved.
+-
+-The C version of Dhrystone spends a relatively large amount of time  in  these
+-two  functions.  Some  time  ago, I made measurements on a VAX 11/785 with the
+-Berkeley UNIX (4.2) compilers (often-used compilers,  but  certainly  not  the
+-most  advanced).  In  the  C  version, 23% of the time was spent in the string
+-functions; in the Pascal version, only 10%. On good RISC machines (where  less
+-time is spent in the procedure calling sequence than on a VAX) and with better
+-optimizing compilers, the percentage is higher; MIPS has reported 34%  for  an
+-R3000.   Because  of this effect, Pascal and Ada Dhrystone results are usually
+-better than C results (except when the optimization quality of the C  compiler
+-is considerably better than that of the other compilers).
+-
+-Several people have noted that the string operations are  over-represented  in
+-Dhrystone,  mainly  because the strings occurring in Dhrystone are longer than
+-average strings. I admit that this is true, and have said  so  in  my  SIGPLAN
+-Notices  paper  (Aug.  1988);  however, I didn't want to generate confusion by
+-changing the string lengths from version 1 to version 2.
+-
+-Even if they are somewhat over-represented in Dhrystone, string operations are
+-frequent  enough  that  it makes sense to implement them in the most efficient
+-way possible, not only for benchmarking purposes.  This means  that  they  can
+-and should be written in assembly language code. ANSI C also explicitly allows
+-the strings functions to be implemented as macros, i.e. by inline code.
+-
+-There is also a third way to speed up the "strcpy" statement in Dhrystone: For
+-this  particular  "strcpy" statement, the source of the assignment is a string
+-constant. Therefore, in contrast to calls to "strcpy" in the general case, the
+-compiler  knows  the  length  and alignment of the strings involved at compile
+-time and can generate code in the same efficient  way  as  a  Pascal  compiler
+-(word instructions instead of byte instructions).
+-
+-This is not allowed in the case of the "strcmp" call: Here, the addresses  are
+-formal  procedure  parameters, and no assumptions can be made about the length
+-or alignment of the strings.  Any such assumptions would indicate an incorrect
+-implementation.  They  might work for Dhrystone, where the strings are in fact
+-word-aligned  with  typical  compilers,  but  other  programs  would   deliver
+-incorrect results.
+-
+-So, for an apple-to-apple  comparison  between  processors,  and  not  between
+-several  possible  (legal  or  illegal)  degrees of compiler optimization, one
+-should check that the systems are comparable with  respect  to  the  following
+-three points:
+-
+-  (1) String functions in assembly language vs. in C
+-
+-      Frequently used functions such as the string functions can and should be
+-      written  in  assembly language, and all serious C language systems known
+-      to me do this. (I list this point  for  completeness  only.)  Note  that
+-      processors  with an instruction that checks a word for a null byte (such
+-      as AMD's  29000  and  Intel's  80960)  have  an  advantage  here.  (This
+-      advantage  decreases  relatively if optimization (3) is applied.) Due to
+-      the length of the strings involved in Dhrystone, this advantage  may  be
+-      considered  too  high  in  perspective, but it is certainly legal to use
+-      such instructions - after all,  these  situations  are  what  they  were
+-      invented for.
+-
+-  (2) String function code inline vs. as library functions.
+-
+-      ANSI  C  has  created  a  new  situation,  compared   with   the   older
+-      Kernighan/Ritchie  C.  In  the  original C, the definition of the string
+-      function was not part of the  language.  Now  it  is,  and  inlining  is
+-      explicitly  allowed.  I  probably  should have stated more clearly in my
+-      SIGPLAN  Notices  paper  that  the  rule  "No  procedure  inlining   for
+-      Dhrystone"  referred  to  the  user level procedures only and not to the
+-      library routines.
+-
+-  (3) Fixed-length and alignment assumptions for the strings
+-
+-      Compilers should be allowed to optimize in these cases if (and only  if)
+-      it  is safe to do so. For Dhrystone, this is the "strcpy" statement, but
+-      not the  "strcmp"  statement  (unless,  of  course,  the  "strcmp"  code
+-      explicitly   checks   the  alignment  at  execution  time  and  branches
+-      accordingly).  A "Dhrystone switch" for the  compiler  that  causes  the
+-      generation  of  code  that  may  not work under certain circumstances is
+-      certainly inappropriate for comparisons. It has been reported in  Usenet
+-      that some C compilers provide such a compiler option; since I don't have
+-      access to all C compilers involved, I cannot verify this.
+-
+-      If the fixed-length and word-alignment assumption can be  used,  a  wide
+-      bus  that permits fast multi-word load instructions certainly does help;
+-      however, this fact by itself should not make a really big difference.
+-
+-A check of  these  points  -  something  that  is  necessary  for  a  thorough
+-evaluation  and  comparison  of  the  Dhrystone  performance claims - requires
+-object code listings as well as listings for  the  string  functions  (strcpy,
+-strcmp) that are possibly called by the program.
+-
+-I don't pretend that Dhrystone is  a  perfect  tool  to  measure  the  integer
+-performance  of microprocessors. The more it is used and discussed, the more I
+-myself learn about aspects that I hadn't noticed yet when I wrote the program.
+-And  of  course,  the  very success of a benchmark program is a danger in that
+-people may tune their compilers and/or hardware to it, and  with  this  action
+-make it less useful.
+-
+-Whetstone and Linpack have their critical points also:  The  Whetstone  rating
+-depends  heavily on the speed of the mathematical functions (sine, sqrt, ...),
+-and Linpack is sensitive to data alignment for some cache configurations.
+-
+-Introduction of a standard set of public domain benchmark software  (something
+-the  SPEC  effort attempts) is certainly a worthwhile thing.  In the meantime,
+-people will continue to use whatever is available and widely distributed,  and
+-Dhrystone  ratings  are probably still better than MIPS ratings if these are -
+-as often in industry - based on  no  reproducible  derivation.   However,  any
+-serious  performance  evaluation  requires  more than just a comparison of raw
+-numbers; one has to make sure  that  the  numbers  have  been  obtained  in  a
+-comparable way.
+-
+//GO.SYSIN DD VARIATIONS
+echo dhry.h 1>&2
+sed >dhry.h <<'//GO.SYSIN DD dhry.h' 's/^-//'
+-/*
+- ****************************************************************************
+- *
+- *                   "DHRYSTONE" Benchmark Program
+- *                   -----------------------------
+- *                                                                            
+- *  Version:    C, Version 2.1
+- *                                                                            
+- *  File:       dhry.h (part 1 of 3)
+- *
+- *  Date:       May 25, 1988
+- *
+- *  Author:     Reinhold P. Weicker
+- *                      Siemens AG, AUT E 51
+- *                      Postfach 3220
+- *                      8520 Erlangen
+- *                      Germany (West)
+- *                              Phone:  [+49]-9131-7-20330
+- *                                      (8-17 Central European Time)
+- *                              Usenet: ..!mcsun!unido!estevax!weicker
+- *
+- *              Original Version (in Ada) published in
+- *              "Communications of the ACM" vol. 27., no. 10 (Oct. 1984),
+- *              pp. 1013 - 1030, together with the statistics
+- *              on which the distribution of statements etc. is based.
+- *
+- *              In this C version, the following C library functions are used:
+- *              - strcpy, strcmp (inside the measurement loop)
+- *              - printf, scanf (outside the measurement loop)
+- *              In addition, Berkeley UNIX system calls "times ()" or "time ()"
+- *              are used for execution time measurement. For measurements
+- *              on other systems, these calls have to be changed.
+- *
+- *  Collection of Results:
+- *              Reinhold Weicker (address see above) and
+- *              
+- *              Rick Richardson
+- *              PC Research. Inc.
+- *              94 Apple Orchard Drive
+- *              Tinton Falls, NJ 07724
+- *                      Phone:  (201) 389-8963 (9-17 EST)               
+- *                      Usenet: ...!uunet!pcrat!rick
+- *
+- *      Please send results to Rick Richardson and/or Reinhold Weicker.
+- *      Complete information should be given on hardware and software used.
+- *      Hardware information includes: Machine type, CPU, type and size
+- *      of caches; for microprocessors: clock frequency, memory speed
+- *      (number of wait states).
+- *      Software information includes: Compiler (and runtime library)
+- *      manufacturer and version, compilation switches, OS version.
+- *      The Operating System version may give an indication about the
+- *      compiler; Dhrystone itself performs no OS calls in the measurement loop.
+- *
+- *      The complete output generated by the program should be mailed
+- *      such that at least some checks for correctness can be made.
+- *
+- ***************************************************************************
+- *
+- *  History:    This version C/2.1 has been made for two reasons:
+- *
+- *              1) There is an obvious need for a common C version of
+- *              Dhrystone, since C is at present the most popular system
+- *              programming language for the class of processors
+- *              (microcomputers, minicomputers) where Dhrystone is used most.
+- *              There should be, as far as possible, only one C version of
+- *              Dhrystone such that results can be compared without
+- *              restrictions. In the past, the C versions distributed
+- *              by Rick Richardson (Version 1.1) and by Reinhold Weicker
+- *              had small (though not significant) differences.
+- *
+- *              2) As far as it is possible without changes to the Dhrystone
+- *              statistics, optimizing compilers should be prevented from
+- *              removing significant statements.
+- *
+- *              This C version has been developed in cooperation with
+- *              Rick Richardson (Tinton Falls, NJ), it incorporates many
+- *              ideas from the "Version 1.1" distributed previously by
+- *              him over the UNIX network Usenet.
+- *              I also thank Chaim Benedelac (National Semiconductor),
+- *              David Ditzel (SUN), Earl Killian and John Mashey (MIPS),
+- *              Alan Smith and Rafael Saavedra-Barrera (UC at Berkeley)
+- *              for their help with comments on earlier versions of the
+- *              benchmark.
+- *
+- *  Changes:    In the initialization part, this version follows mostly
+- *              Rick Richardson's version distributed via Usenet, not the
+- *              version distributed earlier via floppy disk by Reinhold Weicker.
+- *              As a concession to older compilers, names have been made
+- *              unique within the first 8 characters.
+- *              Inside the measurement loop, this version follows the
+- *              version previously distributed by Reinhold Weicker.
+- *
+- *              At several places in the benchmark, code has been added,
+- *              but within the measurement loop only in branches that 
+- *              are not executed. The intention is that optimizing compilers
+- *              should be prevented from moving code out of the measurement
+- *              loop, or from removing code altogether. Since the statements
+- *              that are executed within the measurement loop have NOT been
+- *              changed, the numbers defining the "Dhrystone distribution"
+- *              (distribution of statements, operand types and locality)
+- *              still hold. Except for sophisticated optimizing compilers,
+- *              execution times for this version should be the same as
+- *              for previous versions.
+- *              
+- *              Since it has proven difficult to subtract the time for the
+- *              measurement loop overhead in a correct way, the loop check
+- *              has been made a part of the benchmark. This does have
+- *              an impact - though a very minor one - on the distribution
+- *              statistics which have been updated for this version.
+- *
+- *              All changes within the measurement loop are described
+- *              and discussed in the companion paper "Rationale for
+- *              Dhrystone version 2".
+- *
+- *              Because of the self-imposed limitation that the order and
+- *              distribution of the executed statements should not be
+- *              changed, there are still cases where optimizing compilers
+- *              may not generate code for some statements. To a certain
+- *              degree, this is unavoidable for small synthetic benchmarks.
+- *              Users of the benchmark are advised to check code listings
+- *              whether code is generated for all statements of Dhrystone.
+- *
+- *              Version 2.1 is identical to version 2.0 distributed via
+- *              the UNIX network Usenet in March 1988 except that it corrects
+- *              some minor deficiencies that were found by users of version 2.0.
+- *              The only change within the measurement loop is that a
+- *              non-executed "else" part was added to the "if" statement in
+- *              Func_3, and a non-executed "else" part removed from Proc_3.
+- *
+- ***************************************************************************
+- *
+- * Defines:     The following "Defines" are possible:
+- *              -DREG=register          (default: Not defined)
+- *                      As an approximation to what an average C programmer
+- *                      might do, the "register" storage class is applied
+- *                      (if enabled by -DREG=register)
+- *                      - for local variables, if they are used (dynamically)
+- *                        five or more times
+- *                      - for parameters if they are used (dynamically)
+- *                        six or more times
+- *                      Note that an optimal "register" strategy is
+- *                      compiler-dependent, and that "register" declarations
+- *                      do not necessarily lead to faster execution.
+- *              -DNOSTRUCTASSIGN        (default: Not defined)
+- *                      Define if the C compiler does not support
+- *                      assignment of structures.
+- *              -DNOENUMS               (default: Not defined)
+- *                      Define if the C compiler does not support
+- *                      enumeration types.
+- *              -DTIMES                 (default)
+- *              -DTIME
+- *                      The "times" function of UNIX (returning process times)
+- *                      or the "time" function (returning wallclock time)
+- *                      is used for measurement. 
+- *                      For single user machines, "time ()" is adequate. For
+- *                      multi-user machines where you cannot get single-user
+- *                      access, use the "times ()" function. If you have
+- *                      neither, use a stopwatch in the dead of night.
+- *                      "printf"s are provided marking the points "Start Timer"
+- *                      and "Stop Timer". DO NOT use the UNIX "time(1)"
+- *                      command, as this will measure the total time to
+- *                      run this program, which will (erroneously) include
+- *                      the time to allocate storage (malloc) and to perform
+- *                      the initialization.
+- *              -DHZ=nnn
+- *                      In Berkeley UNIX, the function "times" returns process
+- *                      time in 1/HZ seconds, with HZ = 60 for most systems.
+- *                      CHECK YOUR SYSTEM DESCRIPTION BEFORE YOU JUST APPLY
+- *                      A VALUE.
+- *
+- ***************************************************************************
+- *
+- *  Compilation model and measurement (IMPORTANT):
+- *
+- *  This C version of Dhrystone consists of three files:
+- *  - dhry.h (this file, containing global definitions and comments)
+- *  - dhry_1.c (containing the code corresponding to Ada package Pack_1)
+- *  - dhry_2.c (containing the code corresponding to Ada package Pack_2)
+- *
+- *  The following "ground rules" apply for measurements:
+- *  - Separate compilation
+- *  - No procedure merging
+- *  - Otherwise, compiler optimizations are allowed but should be indicated
+- *  - Default results are those without register declarations
+- *  See the companion paper "Rationale for Dhrystone Version 2" for a more
+- *  detailed discussion of these ground rules.
+- *
+- *  For 16-Bit processors (e.g. 80186, 80286), times for all compilation
+- *  models ("small", "medium", "large" etc.) should be given if possible,
+- *  together with a definition of these models for the compiler system used.
+- *
+- **************************************************************************
+- *
+- *  Dhrystone (C version) statistics:
+- *
+- *  [Comment from the first distribution, updated for version 2.
+- *   Note that because of language differences, the numbers are slightly
+- *   different from the Ada version.]
+- *
+- *  The following program contains statements of a high level programming
+- *  language (here: C) in a distribution considered representative:           
+- *
+- *    assignments                  52 (51.0 %)
+- *    control statements           33 (32.4 %)
+- *    procedure, function calls    17 (16.7 %)
+- *
+- *  103 statements are dynamically executed. The program is balanced with
+- *  respect to the three aspects:                                             
+- *
+- *    - statement type
+- *    - operand type
+- *    - operand locality
+- *         operand global, local, parameter, or constant.                     
+- *
+- *  The combination of these three aspects is balanced only approximately.    
+- *
+- *  1. Statement Type:                                                        
+- *  -----------------             number
+- *
+- *     V1 = V2                     9
+- *       (incl. V1 = F(..)
+- *     V = Constant               12
+- *     Assignment,                 7
+- *       with array element
+- *     Assignment,                 6
+- *       with record component
+- *                                --
+- *                                34       34
+- *
+- *     X = Y +|-|"&&"|"|" Z        5
+- *     X = Y +|-|"==" Constant     6
+- *     X = X +|- 1                 3
+- *     X = Y *|/ Z                 2
+- *     X = Expression,             1
+- *           two operators
+- *     X = Expression,             1
+- *           three operators
+- *                                --
+- *                                18       18
+- *
+- *     if ....                    14
+- *       with "else"      7
+- *       without "else"   7
+- *           executed        3
+- *           not executed    4
+- *     for ...                     7  |  counted every time
+- *     while ...                   4  |  the loop condition
+- *     do ... while                1  |  is evaluated
+- *     switch ...                  1
+- *     break                       1
+- *     declaration with            1
+- *       initialization
+- *                                --
+- *                                34       34
+- *
+- *     P (...)  procedure call    11
+- *       user procedure      10
+- *       library procedure    1
+- *     X = F (...)
+- *             function  call      6
+- *       user function        5                                         
+- *       library function     1                                               
+- *                                --                                          
+- *                                17       17
+- *                                        ---
+- *                                        103
+- *
+- *    The average number of parameters in procedure or function calls
+- *    is 1.82 (not counting the function values as implicit parameters).
+- *
+- *
+- *  2. Operators
+- *  ------------
+- *                          number    approximate
+- *                                    percentage
+- *
+- *    Arithmetic             32          50.8                                 
+- *
+- *       +                     21          33.3                              
+- *       -                      7          11.1                              
+- *       *                      3           4.8
+- *       / (int div)            1           1.6
+- *
+- *    Comparison             27           42.8
+- *
+- *       ==                     9           14.3
+- *       /=                     4            6.3
+- *       >                      1            1.6
+- *       <                      3            4.8
+- *       >=                     1            1.6
+- *       <=                     9           14.3
+- *
+- *    Logic                   4            6.3
+- *
+- *       && (AND-THEN)          1            1.6
+- *       |  (OR)                1            1.6
+- *       !  (NOT)               2            3.2
+- * 
+- *                           --          -----
+- *                           63          100.1
+- *
+- *
+- *  3. Operand Type (counted once per operand reference):
+- *  ---------------
+- *                          number    approximate
+- *                                    percentage
+- *
+- *     Integer               175        72.3 %
+- *     Character              45        18.6 %
+- *     Pointer                12         5.0 %
+- *     String30                6         2.5 %
+- *     Array                   2         0.8 %
+- *     Record                  2         0.8 %
+- *                           ---       -------
+- *                           242       100.0 %
+- *
+- *  When there is an access path leading to the final operand (e.g. a record
+- *  component), only the final data type on the access path is counted.       
+- *
+- *
+- *  4. Operand Locality:                                                      
+- *  -------------------
+- *                                number    approximate
+- *                                          percentage
+- *
+- *     local variable              114        47.1 %
+- *     global variable              22         9.1 %
+- *     parameter                    45        18.6 %
+- *        value                        23         9.5 %
+- *        reference                    22         9.1 %
+- *     function result               6         2.5 %
+- *     constant                     55        22.7 %
+- *                                 ---       -------
+- *                                 242       100.0 %
+- *
+- *
+- *  The program does not compute anything meaningful, but it is syntactically
+- *  and semantically correct. All variables have a value assigned to them
+- *  before they are used as a source operand.
+- *
+- *  There has been no explicit effort to account for the effects of a
+- *  cache, or to balance the use of long or short displacements for code or
+- *  data.
+- *
+- ***************************************************************************
+- */
+-
+-/* Compiler and system dependent definitions: */
+-
+-#ifndef TIME
+-#define TIMES
+-#endif
+-                /* Use times(2) time function unless    */
+-                /* explicitly defined otherwise         */
+-
+-#ifdef TIMES
+-#include <sys/types.h>
+-#include <sys/times.h>
+-                /* for "times" */
+-#endif
+-
+-#define Mic_secs_Per_Second     1000000.0
+-                /* Berkeley UNIX C returns process times in seconds/HZ */
+-
+-#ifdef  NOSTRUCTASSIGN
+-#define structassign(d, s)      memcpy(&(d), &(s), sizeof(d))
+-#else
+-#define structassign(d, s)      d = s
+-#endif
+-
+-#ifdef  NOENUM
+-#define Ident_1 0
+-#define Ident_2 1
+-#define Ident_3 2
+-#define Ident_4 3
+-#define Ident_5 4
+-  typedef int   Enumeration;
+-#else
+-  typedef       enum    {Ident_1, Ident_2, Ident_3, Ident_4, Ident_5}
+-                Enumeration;
+-#endif
+-        /* for boolean and enumeration types in Ada, Pascal */
+-
+-/* General definitions: */
+-
+-#include <stdio.h>
+-                /* for strcpy, strcmp */
+-
+-#define Null 0 
+-                /* Value of a Null pointer */
+-#define true  1
+-#define false 0
+-
+-typedef int     One_Thirty;
+-typedef int     One_Fifty;
+-typedef char    Capital_Letter;
+-typedef int     Boolean;
+-typedef char    Str_30 [31];
+-typedef int     Arr_1_Dim [50];
+-typedef int     Arr_2_Dim [50] [50];
+-
+-typedef struct record 
+-    {
+-    struct record *Ptr_Comp;
+-    Enumeration    Discr;
+-    union {
+-          struct {
+-                  Enumeration Enum_Comp;
+-                  int         Int_Comp;
+-                  char        Str_Comp [31];
+-                  } var_1;
+-          struct {
+-                  Enumeration E_Comp_2;
+-                  char        Str_2_Comp [31];
+-                  } var_2;
+-          struct {
+-                  char        Ch_1_Comp;
+-                  char        Ch_2_Comp;
+-                  } var_3;
+-          } variant;
+-      } Rec_Type, *Rec_Pointer;
+-
+-
+//GO.SYSIN DD dhry.h
+echo dhry_1.c 1>&2
+sed >dhry_1.c <<'//GO.SYSIN DD dhry_1.c' 's/^-//'
+-/*
+- ****************************************************************************
+- *
+- *                   "DHRYSTONE" Benchmark Program
+- *                   -----------------------------
+- *                                                                            
+- *  Version:    C, Version 2.1
+- *                                                                            
+- *  File:       dhry_1.c (part 2 of 3)
+- *
+- *  Date:       May 25, 1988
+- *
+- *  Author:     Reinhold P. Weicker
+- *
+- ****************************************************************************
+- */
+-
+-#include "dhry.h"
+-
+-/* Global Variables: */
+-
+-Rec_Pointer     Ptr_Glob,
+-                Next_Ptr_Glob;
+-int             Int_Glob;
+-Boolean         Bool_Glob;
+-char            Ch_1_Glob,
+-                Ch_2_Glob;
+-int             Arr_1_Glob [50];
+-int             Arr_2_Glob [50] [50];
+-
+-extern char     *malloc ();
+-Enumeration     Func_1 ();
+-  /* forward declaration necessary since Enumeration may not simply be int */
+-
+-#ifndef REG
+-        Boolean Reg = false;
+-#define REG
+-        /* REG becomes defined as empty */
+-        /* i.e. no register variables   */
+-#else
+-        Boolean Reg = true;
+-#endif
+-
+-/* variables for time measurement: */
+-
+-#ifdef TIMES
+-struct tms      time_info;
+-extern  int     times ();
+-                /* see library function "times" */
+-#define Too_Small_Time 120
+-                /* Measurements should last at least about 2 seconds */
+-#endif
+-#ifdef TIME
+-extern long     time();
+-                /* see library function "time"  */
+-#define Too_Small_Time 2
+-                /* Measurements should last at least 2 seconds */
+-#endif
+-
+-long            Begin_Time,
+-                End_Time,
+-                User_Time;
+-float           Microseconds,
+-                Dhrystones_Per_Second;
+-
+-/* end of variables for time measurement */
+-
+-
+-main ()
+-/*****/
+-
+-  /* main program, corresponds to procedures        */
+-  /* Main and Proc_0 in the Ada version             */
+-{
+-        One_Fifty       Int_1_Loc;
+-  REG   One_Fifty       Int_2_Loc;
+-        One_Fifty       Int_3_Loc;
+-  REG   char            Ch_Index;
+-        Enumeration     Enum_Loc;
+-        Str_30          Str_1_Loc;
+-        Str_30          Str_2_Loc;
+-  REG   int             Run_Index;
+-  REG   int             Number_Of_Runs;
+-
+-  /* Initializations */
+-
+-  Next_Ptr_Glob = (Rec_Pointer) malloc (sizeof (Rec_Type));
+-  Ptr_Glob = (Rec_Pointer) malloc (sizeof (Rec_Type));
+-
+-  Ptr_Glob->Ptr_Comp                    = Next_Ptr_Glob;
+-  Ptr_Glob->Discr                       = Ident_1;
+-  Ptr_Glob->variant.var_1.Enum_Comp     = Ident_3;
+-  Ptr_Glob->variant.var_1.Int_Comp      = 40;
+-  strcpy (Ptr_Glob->variant.var_1.Str_Comp, 
+-          "DHRYSTONE PROGRAM, SOME STRING");
+-  strcpy (Str_1_Loc, "DHRYSTONE PROGRAM, 1'ST STRING");
+-
+-  Arr_2_Glob [8][7] = 10;
+-        /* Was missing in published program. Without this statement,    */
+-        /* Arr_2_Glob [8][7] would have an undefined value.             */
+-        /* Warning: With 16-Bit processors and Number_Of_Runs > 32000,  */
+-        /* overflow may occur for this array element.                   */
+-
+-  printf ("\n");
+-  printf ("Dhrystone Benchmark, Version 2.1 (Language: C)\n");
+-  printf ("\n");
+-  if (Reg)
+-  {
+-    printf ("Program compiled with 'register' attribute\n");
+-    printf ("\n");
+-  }
+-  else
+-  {
+-    printf ("Program compiled without 'register' attribute\n");
+-    printf ("\n");
+-  }
+-  printf ("Please give the number of runs through the benchmark: ");
+-  {
+-    int n;
+-    scanf ("%d", &n);
+-    Number_Of_Runs = n;
+-  }
+-  printf ("\n");
+-
+-  printf ("Execution starts, %d runs through Dhrystone\n", Number_Of_Runs);
+-
+-  /***************/
+-  /* Start timer */
+-  /***************/
+- 
+-#ifdef TIMES
+-  times (&time_info);
+-  Begin_Time = (long) time_info.tms_utime;
+-#endif
+-#ifdef TIME
+-  Begin_Time = time ( (long *) 0);
+-#endif
+-
+-  for (Run_Index = 1; Run_Index <= Number_Of_Runs; ++Run_Index)
+-  {
+-
+-    Proc_5();
+-    Proc_4();
+-      /* Ch_1_Glob == 'A', Ch_2_Glob == 'B', Bool_Glob == true */
+-    Int_1_Loc = 2;
+-    Int_2_Loc = 3;
+-    strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 2'ND STRING");
+-    Enum_Loc = Ident_2;
+-    Bool_Glob = ! Func_2 (Str_1_Loc, Str_2_Loc);
+-      /* Bool_Glob == 1 */
+-    while (Int_1_Loc < Int_2_Loc)  /* loop body executed once */
+-    {
+-      Int_3_Loc = 5 * Int_1_Loc - Int_2_Loc;
+-        /* Int_3_Loc == 7 */
+-      Proc_7 (Int_1_Loc, Int_2_Loc, &Int_3_Loc);
+-        /* Int_3_Loc == 7 */
+-      Int_1_Loc += 1;
+-    } /* while */
+-      /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
+-    Proc_8 (Arr_1_Glob, Arr_2_Glob, Int_1_Loc, Int_3_Loc);
+-      /* Int_Glob == 5 */
+-    Proc_1 (Ptr_Glob);
+-    for (Ch_Index = 'A'; Ch_Index <= Ch_2_Glob; ++Ch_Index)
+-                             /* loop body executed twice */
+-    {
+-      if (Enum_Loc == Func_1 (Ch_Index, 'C'))
+-          /* then, not executed */
+-        {
+-        Proc_6 (Ident_1, &Enum_Loc);
+-        strcpy (Str_2_Loc, "DHRYSTONE PROGRAM, 3'RD STRING");
+-        Int_2_Loc = Run_Index;
+-        Int_Glob = Run_Index;
+-        }
+-    }
+-      /* Int_1_Loc == 3, Int_2_Loc == 3, Int_3_Loc == 7 */
+-    Int_2_Loc = Int_2_Loc * Int_1_Loc;
+-    Int_1_Loc = Int_2_Loc / Int_3_Loc;
+-    Int_2_Loc = 7 * (Int_2_Loc - Int_3_Loc) - Int_1_Loc;
+-      /* Int_1_Loc == 1, Int_2_Loc == 13, Int_3_Loc == 7 */
+-    Proc_2 (&Int_1_Loc);
+-      /* Int_1_Loc == 5 */
+-
+-  } /* loop "for Run_Index" */
+-
+-  /**************/
+-  /* Stop timer */
+-  /**************/
+-  
+-#ifdef TIMES
+-  times (&time_info);
+-  End_Time = (long) time_info.tms_utime;
+-#endif
+-#ifdef TIME
+-  End_Time = time ( (long *) 0);
+-#endif
+-
+-  printf ("Execution ends\n");
+-  printf ("\n");
+-  printf ("Final values of the variables used in the benchmark:\n");
+-  printf ("\n");
+-  printf ("Int_Glob:            %d\n", Int_Glob);
+-  printf ("        should be:   %d\n", 5);
+-  printf ("Bool_Glob:           %d\n", Bool_Glob);
+-  printf ("        should be:   %d\n", 1);
+-  printf ("Ch_1_Glob:           %c\n", Ch_1_Glob);
+-  printf ("        should be:   %c\n", 'A');
+-  printf ("Ch_2_Glob:           %c\n", Ch_2_Glob);
+-  printf ("        should be:   %c\n", 'B');
+-  printf ("Arr_1_Glob[8]:       %d\n", Arr_1_Glob[8]);
+-  printf ("        should be:   %d\n", 7);
+-  printf ("Arr_2_Glob[8][7]:    %d\n", Arr_2_Glob[8][7]);
+-  printf ("        should be:   Number_Of_Runs + 10\n");
+-  printf ("Ptr_Glob->\n");
+-  printf ("  Ptr_Comp:          %d\n", (int) Ptr_Glob->Ptr_Comp);
+-  printf ("        should be:   (implementation-dependent)\n");
+-  printf ("  Discr:             %d\n", Ptr_Glob->Discr);
+-  printf ("        should be:   %d\n", 0);
+-  printf ("  Enum_Comp:         %d\n", Ptr_Glob->variant.var_1.Enum_Comp);
+-  printf ("        should be:   %d\n", 2);
+-  printf ("  Int_Comp:          %d\n", Ptr_Glob->variant.var_1.Int_Comp);
+-  printf ("        should be:   %d\n", 17);
+-  printf ("  Str_Comp:          %s\n", Ptr_Glob->variant.var_1.Str_Comp);
+-  printf ("        should be:   DHRYSTONE PROGRAM, SOME STRING\n");
+-  printf ("Next_Ptr_Glob->\n");
+-  printf ("  Ptr_Comp:          %d\n", (int) Next_Ptr_Glob->Ptr_Comp);
+-  printf ("        should be:   (implementation-dependent), same as above\n");
+-  printf ("  Discr:             %d\n", Next_Ptr_Glob->Discr);
+-  printf ("        should be:   %d\n", 0);
+-  printf ("  Enum_Comp:         %d\n", Next_Ptr_Glob->variant.var_1.Enum_Comp);
+-  printf ("        should be:   %d\n", 1);
+-  printf ("  Int_Comp:          %d\n", Next_Ptr_Glob->variant.var_1.Int_Comp);
+-  printf ("        should be:   %d\n", 18);
+-  printf ("  Str_Comp:          %s\n",
+-                                Next_Ptr_Glob->variant.var_1.Str_Comp);
+-  printf ("        should be:   DHRYSTONE PROGRAM, SOME STRING\n");
+-  printf ("Int_1_Loc:           %d\n", Int_1_Loc);
+-  printf ("        should be:   %d\n", 5);
+-  printf ("Int_2_Loc:           %d\n", Int_2_Loc);
+-  printf ("        should be:   %d\n", 13);
+-  printf ("Int_3_Loc:           %d\n", Int_3_Loc);
+-  printf ("        should be:   %d\n", 7);
+-  printf ("Enum_Loc:            %d\n", Enum_Loc);
+-  printf ("        should be:   %d\n", 1);
+-  printf ("Str_1_Loc:           %s\n", Str_1_Loc);
+-  printf ("        should be:   DHRYSTONE PROGRAM, 1'ST STRING\n");
+-  printf ("Str_2_Loc:           %s\n", Str_2_Loc);
+-  printf ("        should be:   DHRYSTONE PROGRAM, 2'ND STRING\n");
+-  printf ("\n");
+-
+-  User_Time = End_Time - Begin_Time;
+-
+-  if (User_Time < Too_Small_Time)
+-  {
+-    printf ("Measured time too small to obtain meaningful results\n");
+-    printf ("Please increase number of runs\n");
+-    printf ("\n");
+-  }
+-  else
+-  {
+-#ifdef TIME
+-    Microseconds = (float) User_Time * Mic_secs_Per_Second 
+-                        / (float) Number_Of_Runs;
+-    Dhrystones_Per_Second = (float) Number_Of_Runs / (float) User_Time;
+-#else
+-    Microseconds = (float) User_Time * Mic_secs_Per_Second 
+-                        / ((float) HZ * ((float) Number_Of_Runs));
+-    Dhrystones_Per_Second = ((float) HZ * (float) Number_Of_Runs)
+-                        / (float) User_Time;
+-#endif
+-    printf ("Microseconds for one run through Dhrystone: ");
+-    printf ("%6.1f \n", Microseconds);
+-    printf ("Dhrystones per Second:                      ");
+-    printf ("%6.1f \n", Dhrystones_Per_Second);
+-    printf ("\n");
+-  }
+-  
+-}
+-
+-
+-Proc_1 (Ptr_Val_Par)
+-/******************/
+-
+-REG Rec_Pointer Ptr_Val_Par;
+-    /* executed once */
+-{
+-  REG Rec_Pointer Next_Record = Ptr_Val_Par->Ptr_Comp;  
+-                                        /* == Ptr_Glob_Next */
+-  /* Local variable, initialized with Ptr_Val_Par->Ptr_Comp,    */
+-  /* corresponds to "rename" in Ada, "with" in Pascal           */
+-  
+-  structassign (*Ptr_Val_Par->Ptr_Comp, *Ptr_Glob); 
+-  Ptr_Val_Par->variant.var_1.Int_Comp = 5;
+-  Next_Record->variant.var_1.Int_Comp 
+-        = Ptr_Val_Par->variant.var_1.Int_Comp;
+-  Next_Record->Ptr_Comp = Ptr_Val_Par->Ptr_Comp;
+-  Proc_3 (&Next_Record->Ptr_Comp);
+-    /* Ptr_Val_Par->Ptr_Comp->Ptr_Comp 
+-                        == Ptr_Glob->Ptr_Comp */
+-  if (Next_Record->Discr == Ident_1)
+-    /* then, executed */
+-  {
+-    Next_Record->variant.var_1.Int_Comp = 6;
+-    Proc_6 (Ptr_Val_Par->variant.var_1.Enum_Comp, 
+-           &Next_Record->variant.var_1.Enum_Comp);
+-    Next_Record->Ptr_Comp = Ptr_Glob->Ptr_Comp;
+-    Proc_7 (Next_Record->variant.var_1.Int_Comp, 10, 
+-           &Next_Record->variant.var_1.Int_Comp);
+-  }
+-  else /* not executed */
+-    structassign (*Ptr_Val_Par, *Ptr_Val_Par->Ptr_Comp);
+-} /* Proc_1 */
+-
+-
+-Proc_2 (Int_Par_Ref)
+-/******************/
+-    /* executed once */
+-    /* *Int_Par_Ref == 1, becomes 4 */
+-
+-One_Fifty   *Int_Par_Ref;
+-{
+-  One_Fifty  Int_Loc;  
+-  Enumeration   Enum_Loc;
+-
+-  Int_Loc = *Int_Par_Ref + 10;
+-  do /* executed once */
+-    if (Ch_1_Glob == 'A')
+-      /* then, executed */
+-    {
+-      Int_Loc -= 1;
+-      *Int_Par_Ref = Int_Loc - Int_Glob;
+-      Enum_Loc = Ident_1;
+-    } /* if */
+-  while (Enum_Loc != Ident_1); /* true */
+-} /* Proc_2 */
+-
+-
+-Proc_3 (Ptr_Ref_Par)
+-/******************/
+-    /* executed once */
+-    /* Ptr_Ref_Par becomes Ptr_Glob */
+-
+-Rec_Pointer *Ptr_Ref_Par;
+-
+-{
+-  if (Ptr_Glob != Null)
+-    /* then, executed */
+-    *Ptr_Ref_Par = Ptr_Glob->Ptr_Comp;
+-  Proc_7 (10, Int_Glob, &Ptr_Glob->variant.var_1.Int_Comp);
+-} /* Proc_3 */
+-
+-
+-Proc_4 () /* without parameters */
+-/*******/
+-    /* executed once */
+-{
+-  Boolean Bool_Loc;
+-
+-  Bool_Loc = Ch_1_Glob == 'A';
+-  Bool_Glob = Bool_Loc | Bool_Glob;
+-  Ch_2_Glob = 'B';
+-} /* Proc_4 */
+-
+-
+-Proc_5 () /* without parameters */
+-/*******/
+-    /* executed once */
+-{
+-  Ch_1_Glob = 'A';
+-  Bool_Glob = false;
+-} /* Proc_5 */
+-
+-
+-        /* Procedure for the assignment of structures,          */
+-        /* if the C compiler doesn't support this feature       */
+-#ifdef  NOSTRUCTASSIGN
+-memcpy (d, s, l)
+-register char   *d;
+-register char   *s;
+-register int    l;
+-{
+-        while (l--) *d++ = *s++;
+-}
+-#endif
+-
+-
+//GO.SYSIN DD dhry_1.c
+echo dhry_2.c 1>&2
+sed >dhry_2.c <<'//GO.SYSIN DD dhry_2.c' 's/^-//'
+-/*
+- ****************************************************************************
+- *
+- *                   "DHRYSTONE" Benchmark Program
+- *                   -----------------------------
+- *                                                                            
+- *  Version:    C, Version 2.1
+- *                                                                            
+- *  File:       dhry_2.c (part 3 of 3)
+- *
+- *  Date:       May 25, 1988
+- *
+- *  Author:     Reinhold P. Weicker
+- *
+- ****************************************************************************
+- */
+-
+-#include "dhry.h"
+-
+-#ifndef REG
+-#define REG
+-        /* REG becomes defined as empty */
+-        /* i.e. no register variables   */
+-#endif
+-
+-extern  int     Int_Glob;
+-extern  char    Ch_1_Glob;
+-
+-
+-Proc_6 (Enum_Val_Par, Enum_Ref_Par)
+-/*********************************/
+-    /* executed once */
+-    /* Enum_Val_Par == Ident_3, Enum_Ref_Par becomes Ident_2 */
+-
+-Enumeration  Enum_Val_Par;
+-Enumeration *Enum_Ref_Par;
+-{
+-  *Enum_Ref_Par = Enum_Val_Par;
+-  if (! Func_3 (Enum_Val_Par))
+-    /* then, not executed */
+-    *Enum_Ref_Par = Ident_4;
+-  switch (Enum_Val_Par)
+-  {
+-    case Ident_1: 
+-      *Enum_Ref_Par = Ident_1;
+-      break;
+-    case Ident_2: 
+-      if (Int_Glob > 100)
+-        /* then */
+-      *Enum_Ref_Par = Ident_1;
+-      else *Enum_Ref_Par = Ident_4;
+-      break;
+-    case Ident_3: /* executed */
+-      *Enum_Ref_Par = Ident_2;
+-      break;
+-    case Ident_4: break;
+-    case Ident_5: 
+-      *Enum_Ref_Par = Ident_3;
+-      break;
+-  } /* switch */
+-} /* Proc_6 */
+-
+-
+-Proc_7 (Int_1_Par_Val, Int_2_Par_Val, Int_Par_Ref)
+-/**********************************************/
+-    /* executed three times                                      */ 
+-    /* first call:      Int_1_Par_Val == 2, Int_2_Par_Val == 3,  */
+-    /*                  Int_Par_Ref becomes 7                    */
+-    /* second call:     Int_1_Par_Val == 10, Int_2_Par_Val == 5, */
+-    /*                  Int_Par_Ref becomes 17                   */
+-    /* third call:      Int_1_Par_Val == 6, Int_2_Par_Val == 10, */
+-    /*                  Int_Par_Ref becomes 18                   */
+-One_Fifty       Int_1_Par_Val;
+-One_Fifty       Int_2_Par_Val;
+-One_Fifty      *Int_Par_Ref;
+-{
+-  One_Fifty Int_Loc;
+-
+-  Int_Loc = Int_1_Par_Val + 2;
+-  *Int_Par_Ref = Int_2_Par_Val + Int_Loc;
+-} /* Proc_7 */
+-
+-
+-Proc_8 (Arr_1_Par_Ref, Arr_2_Par_Ref, Int_1_Par_Val, Int_2_Par_Val)
+-/*********************************************************************/
+-    /* executed once      */
+-    /* Int_Par_Val_1 == 3 */
+-    /* Int_Par_Val_2 == 7 */
+-Arr_1_Dim       Arr_1_Par_Ref;
+-Arr_2_Dim       Arr_2_Par_Ref;
+-int             Int_1_Par_Val;
+-int             Int_2_Par_Val;
+-{
+-  REG One_Fifty Int_Index;
+-  REG One_Fifty Int_Loc;
+-
+-  Int_Loc = Int_1_Par_Val + 5;
+-  Arr_1_Par_Ref [Int_Loc] = Int_2_Par_Val;
+-  Arr_1_Par_Ref [Int_Loc+1] = Arr_1_Par_Ref [Int_Loc];
+-  Arr_1_Par_Ref [Int_Loc+30] = Int_Loc;
+-  for (Int_Index = Int_Loc; Int_Index <= Int_Loc+1; ++Int_Index)
+-    Arr_2_Par_Ref [Int_Loc] [Int_Index] = Int_Loc;
+-  Arr_2_Par_Ref [Int_Loc] [Int_Loc-1] += 1;
+-  Arr_2_Par_Ref [Int_Loc+20] [Int_Loc] = Arr_1_Par_Ref [Int_Loc];
+-  Int_Glob = 5;
+-} /* Proc_8 */
+-
+-
+-Enumeration Func_1 (Ch_1_Par_Val, Ch_2_Par_Val)
+-/*************************************************/
+-    /* executed three times                                         */
+-    /* first call:      Ch_1_Par_Val == 'H', Ch_2_Par_Val == 'R'    */
+-    /* second call:     Ch_1_Par_Val == 'A', Ch_2_Par_Val == 'C'    */
+-    /* third call:      Ch_1_Par_Val == 'B', Ch_2_Par_Val == 'C'    */
+-
+-Capital_Letter   Ch_1_Par_Val;
+-Capital_Letter   Ch_2_Par_Val;
+-{
+-  Capital_Letter        Ch_1_Loc;
+-  Capital_Letter        Ch_2_Loc;
+-
+-  Ch_1_Loc = Ch_1_Par_Val;
+-  Ch_2_Loc = Ch_1_Loc;
+-  if (Ch_2_Loc != Ch_2_Par_Val)
+-    /* then, executed */
+-    return (Ident_1);
+-  else  /* not executed */
+-  {
+-    Ch_1_Glob = Ch_1_Loc;
+-    return (Ident_2);
+-   }
+-} /* Func_1 */
+-
+-
+-Boolean Func_2 (Str_1_Par_Ref, Str_2_Par_Ref)
+-/*************************************************/
+-    /* executed once */
+-    /* Str_1_Par_Ref == "DHRYSTONE PROGRAM, 1'ST STRING" */
+-    /* Str_2_Par_Ref == "DHRYSTONE PROGRAM, 2'ND STRING" */
+-
+-Str_30  Str_1_Par_Ref;
+-Str_30  Str_2_Par_Ref;
+-{
+-  REG One_Thirty        Int_Loc;
+-      Capital_Letter    Ch_Loc;
+-
+-  Int_Loc = 2;
+-  while (Int_Loc <= 2) /* loop body executed once */
+-    if (Func_1 (Str_1_Par_Ref[Int_Loc],
+-                Str_2_Par_Ref[Int_Loc+1]) == Ident_1)
+-      /* then, executed */
+-    {
+-      Ch_Loc = 'A';
+-      Int_Loc += 1;
+-    } /* if, while */
+-  if (Ch_Loc >= 'W' && Ch_Loc < 'Z')
+-    /* then, not executed */
+-    Int_Loc = 7;
+-  if (Ch_Loc == 'R')
+-    /* then, not executed */
+-    return (true);
+-  else /* executed */
+-  {
+-    if (strcmp (Str_1_Par_Ref, Str_2_Par_Ref) > 0)
+-      /* then, not executed */
+-    {
+-      Int_Loc += 7;
+-      Int_Glob = Int_Loc;
+-      return (true);
+-    }
+-    else /* executed */
+-      return (false);
+-  } /* if Ch_Loc */
+-} /* Func_2 */
+-
+-
+-Boolean Func_3 (Enum_Par_Val)
+-/***************************/
+-    /* executed once        */
+-    /* Enum_Par_Val == Ident_3 */
+-Enumeration Enum_Par_Val;
+-{
+-  Enumeration Enum_Loc;
+-
+-  Enum_Loc = Enum_Par_Val;
+-  if (Enum_Loc == Ident_3)
+-    /* then, executed */
+-    return (true);
+-  else /* not executed */
+-    return (false);
+-} /* Func_3 */
+-
+//GO.SYSIN DD dhry_2.c
+echo dhry_c.dif 1>&2
+sed >dhry_c.dif <<'//GO.SYSIN DD dhry_c.dif' 's/^-//'
+-7c7
+-<  *  Version:    C, Version 2.1
+----
+->  *  Version:    C, Version 2.0
+-9c9
+-<  *  File:       dhry.h (part 1 of 3)
+----
+->  *  File:       dhry_global.h (part 1 of 3)
+-11c11
+-<  *  Date:       May 25, 1988
+----
+->  *  Date:       March 3, 1988
+-30c30
+-<  *              In addition, Berkeley UNIX system calls "times ()" or "time ()"
+----
+->  *              In addition, UNIX system calls "times ()" or "time ()"
+-44c44
+-<  *      Please send results to Rick Richardson and/or Reinhold Weicker.
+----
+->  *      Please send results to Reinhold Weicker and/or Rick Richardson.
+-59c59
+-<  *  History:    This version C/2.1 has been made for two reasons:
+----
+->  *  History:    This version C/2.0 has been made for two reasons:
+-123,129d122
+-<  *              Version 2.1 is identical to version 2.0 distributed via
+-<  *              the UNIX network Usenet in March 1988 except that it corrects
+-<  *              some minor deficiencies that were found by users of version 2.0.
+-<  *              The only change within the measurement loop is that a
+-<  *              non-executed "else" part was added to the "if" statement in
+-<  *              Func_3, and a non-executed "else" part removed from Proc_3.
+-<  *
+-165,167c158,160
+-<  *              -DHZ=nnn
+-<  *                      In Berkeley UNIX, the function "times" returns process
+-<  *                      time in 1/HZ seconds, with HZ = 60 for most systems.
+----
+->  *              -DHZ=nnn                (default: 60)
+->  *                      The function "times" returns process times in
+->  *                      1/HZ seconds, with HZ = 60 for most systems.
+-169c162
+-<  *                      A VALUE.
+----
+->  *                      THE DEFAULT VALUE.
+-176,178c169,171
+-<  *  - dhry.h (this file, containing global definitions and comments)
+-<  *  - dhry_1.c (containing the code corresponding to Ada package Pack_1)
+-<  *  - dhry_2.c (containing the code corresponding to Ada package Pack_2)
+----
+->  *  - dhry_global.h (this file, containing global definitions and comments)
+->  *  - dhry_pack_1.c (containing the code corresponding to Ada package Pack_1)
+->  *  - dhry_pack_2.c (containing the code corresponding to Ada package Pack_2)
+-350a344
+-> #ifndef TIMES
+-353,354c347,354
+-<                 /* Use times(2) time function unless    */
+-<                 /* explicitly defined otherwise         */
+----
+-> #endif
+->                 /* Use "times" function for measurement */
+->                 /* unless explicitly defined otherwise  */
+-> #ifndef HZ
+-> #define HZ      60
+-> #endif
+->                 /* Use HZ = 60 for "times" function     */
+->                 /* unless explicitly defined otherwise  */
+-363c363
+-<                 /* Berkeley UNIX C returns process times in seconds/HZ */
+----
+->                 /* UNIX C returns process times in seconds/HZ */
+-7c7
+-<  *  Version:    C, Version 2.1
+----
+->  *  Version:    C, Version 2.0
+-9c9
+-<  *  File:       dhry_1.c (part 2 of 3)
+----
+->  *  File:       dhry_pack_1.c (part 2 of 3)
+-11c11
+-<  *  Date:       May 25, 1988
+----
+->  *  Date:       March 3, 1988
+-18c18
+-< #include "dhry.h"
+----
+-> #include "dhry_global.h"
+-50,51d49
+-< #define Too_Small_Time 120
+-<                 /* Measurements should last at least about 2 seconds */
+-55a54,55
+-> #endif
+-> 
+-58d57
+-< #endif
+-73a73
+-> 
+-84a85
+-> 
+-99,100c100,102
+-<         /* Was missing in published program. Without this statement,    */
+-<         /* Arr_2_Glob [8][7] would have an undefined value.             */
+----
+->         /* Was missing in published program. Without this               */
+->         /* initialization, Arr_2_Glob [8][7] would have an              */
+->         /* undefined value.                                             */
+-105c107
+-<   printf ("Dhrystone Benchmark, Version 2.1 (Language: C)\n");
+----
+->   printf ("Dhrystone Benchmark, Version 2.0 (Language: C)\n");
+-281c283
+-< /******************/
+----
+-> /**********************/
+-338c340
+-< /******************/
+----
+-> /**********************/
+-347a350,351
+->   else /* not executed */
+->     Int_Glob = 100;
+-349a354
+-> 
+-7c7
+-<  *  Version:    C, Version 2.1
+----
+->  *  Version:    C, Version 2.0
+-9c9
+-<  *  File:       dhry_2.c (part 3 of 3)
+----
+->  *  File:       dhry_pack_2.c (part 3 of 3)
+-11c11
+-<  *  Date:       May 25, 1988
+----
+->  *  Date:       March 3, 1988
+-18c18
+-< #include "dhry.h"
+----
+-> #include "dhry_global.h"
+-189,190d188
+-<   else /* not executed */
+-<     return (false);
+//GO.SYSIN DD dhry_c.dif
+echo submit.frm 1>&2
+sed >submit.frm <<'//GO.SYSIN DD submit.frm' 's/^-//'
+-DHRYSTONE 2.1 BENCHMARK REPORTING FORM
+-MANUF:
+-MODEL:
+-PROC:
+-CLOCK:
+-OS:
+-OVERSION:
+-COMPILER:
+-CVERSION:
+-OPTIONS:
+-NOREG:
+-REG:
+-NOTES:
+-DATE:
+-SUBMITTER:
+-CODESIZE:
+-MAILTO: uunet!pcrat!dry2
+//GO.SYSIN DD submit.frm

+ 0 - 0
dl/dropbear/.lock


BIN
dl/dropbear/dropbear-2020.81.tar.bz2


+ 0 - 0
dl/e2fsprogs/.lock


BIN
dl/e2fsprogs/e2fsprogs-1.45.6.tar.xz


+ 0 - 0
dl/fakeroot/.lock


BIN
dl/fakeroot/fakeroot_1.25.3.orig.tar.gz


+ 0 - 0
dl/gawk/.lock


BIN
dl/gawk/gawk-5.1.0.tar.xz


+ 0 - 0
dl/genext2fs/.lock


BIN
dl/genext2fs/genext2fs-1.4.1.tar.gz


+ 0 - 0
dl/genimage/.lock


BIN
dl/genimage/genimage-13.tar.xz


+ 0 - 0
dl/gettext-tiny/.lock


BIN
dl/gettext-tiny/gettext-0.20.1.tar.xz


BIN
dl/gettext-tiny/gettext-tiny-0.3.2.tar.gz


+ 0 - 0
dl/glibc/.lock


BIN
dl/glibc/glibc-2.31-54-g6fdf971c9dbf7dac9bea552113fe4694015bbc4d.tar.gz


BIN
dl/glibc/glibc-2.32-2-g386543bc4495f658dcce6cd4d11e4ba6574a46f5.tar.gz


+ 0 - 0
dl/gmp/.lock


BIN
dl/gmp/gmp-6.1.2.tar.xz


+ 0 - 0
dl/gptfdisk/.lock


BIN
dl/gptfdisk/gptfdisk-1.0.5.tar.gz


+ 0 - 0
dl/htop/.lock


BIN
dl/htop/htop-3.0.2.tar.gz


+ 0 - 0
dl/iperf/.lock


BIN
dl/iperf/iperf-2.0.13.tar.gz


+ 0 - 0
dl/iperf3/.lock


BIN
dl/iperf3/iperf-3.9.tar.gz


+ 0 - 0
dl/libconfuse/.lock


BIN
dl/libconfuse/confuse-3.3.tar.xz


+ 0 - 0
dl/libjpeg/.lock


BIN
dl/libjpeg/jpegsrc.v9d.tar.gz


+ 0 - 0
dl/libkcapi/.lock


BIN
dl/libkcapi/libkcapi-1.1.5.tar.xz


+ 0 - 0
dl/libtirpc/.lock


BIN
dl/libtirpc/libtirpc-1.2.6.tar.bz2


+ 0 - 0
dl/libtool/.lock


BIN
dl/libtool/libtool-2.4.6.tar.xz


+ 0 - 0
dl/libzlib/.lock


BIN
dl/libzlib/zlib-1.2.11.tar.xz


+ 0 - 0
dl/linux/.lock


+ 0 - 0
dl/lmbench/.lock


BIN
dl/lmbench/lmbench-3.0-a9.tgz


+ 0 - 0
dl/lz4/.lock


BIN
dl/lz4/lz4-1.9.2.tar.gz


+ 0 - 0
dl/lzip/.lock


BIN
dl/lzip/lzip-1.21.tar.gz


+ 0 - 0
dl/lzo/.lock


BIN
dl/lzo/lzo-2.10.tar.gz


+ 0 - 0
dl/m4/.lock


BIN
dl/m4/m4-1.4.18.tar.xz


+ 0 - 0
dl/memtester/.lock


BIN
dl/memtester/memtester-4.5.0.tar.gz


+ 0 - 0
dl/mpc/.lock


BIN
dl/mpc/mpc-1.1.0.tar.gz


+ 0 - 0
dl/mpfr/.lock


BIN
dl/mpfr/mpfr-4.0.2.tar.xz


+ 0 - 0
dl/mtd/.lock


BIN
dl/mtd/mtd-utils-2.1.2.tar.bz2


+ 0 - 0
dl/mtools/.lock


BIN
dl/mtools/mtools-4.0.24.tar.lz


+ 0 - 0
dl/musl-compat-headers/.lock


+ 846 - 0
dl/musl-compat-headers/queue.h?rev=1.70

@@ -0,0 +1,846 @@
+/*	$NetBSD: queue.h,v 1.70 2015/11/02 15:21:23 christos Exp $	*/
+
+/*
+ * Copyright (c) 1991, 1993
+ *	The Regents of the University of California.  All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ *	@(#)queue.h	8.5 (Berkeley) 8/20/94
+ */
+
+#ifndef	_SYS_QUEUE_H_
+#define	_SYS_QUEUE_H_
+
+/*
+ * This file defines five types of data structures: singly-linked lists,
+ * lists, simple queues, tail queues, and circular queues.
+ *
+ * A singly-linked list is headed by a single forward pointer. The
+ * elements are singly linked for minimum space and pointer manipulation
+ * overhead at the expense of O(n) removal for arbitrary elements. New
+ * elements can be added to the list after an existing element or at the
+ * head of the list.  Elements being removed from the head of the list
+ * should use the explicit macro for this purpose for optimum
+ * efficiency. A singly-linked list may only be traversed in the forward
+ * direction.  Singly-linked lists are ideal for applications with large
+ * datasets and few or no removals or for implementing a LIFO queue.
+ *
+ * A list is headed by a single forward pointer (or an array of forward
+ * pointers for a hash table header). The elements are doubly linked
+ * so that an arbitrary element can be removed without a need to
+ * traverse the list. New elements can be added to the list before
+ * or after an existing element or at the head of the list. A list
+ * may only be traversed in the forward direction.
+ *
+ * A simple queue is headed by a pair of pointers, one the head of the
+ * list and the other to the tail of the list. The elements are singly
+ * linked to save space, so elements can only be removed from the
+ * head of the list. New elements can be added to the list after
+ * an existing element, at the head of the list, or at the end of the
+ * list. A simple queue may only be traversed in the forward direction.
+ *
+ * A tail queue is headed by a pair of pointers, one to the head of the
+ * list and the other to the tail of the list. The elements are doubly
+ * linked so that an arbitrary element can be removed without a need to
+ * traverse the list. New elements can be added to the list before or
+ * after an existing element, at the head of the list, or at the end of
+ * the list. A tail queue may be traversed in either direction.
+ *
+ * A circle queue is headed by a pair of pointers, one to the head of the
+ * list and the other to the tail of the list. The elements are doubly
+ * linked so that an arbitrary element can be removed without a need to
+ * traverse the list. New elements can be added to the list before or after
+ * an existing element, at the head of the list, or at the end of the list.
+ * A circle queue may be traversed in either direction, but has a more
+ * complex end of list detection.
+ *
+ * For details on the use of these macros, see the queue(3) manual page.
+ */
+
+/*
+ * Include the definition of NULL only on NetBSD because sys/null.h
+ * is not available elsewhere.  This conditional makes the header
+ * portable and it can simply be dropped verbatim into any system.
+ * The caveat is that on other systems some other header
+ * must provide NULL before the macros can be used.
+ */
+#ifdef __NetBSD__
+#include <sys/null.h>
+#endif
+
+#if defined(QUEUEDEBUG)
+# if defined(_KERNEL)
+#  define QUEUEDEBUG_ABORT(...) panic(__VA_ARGS__)
+# else
+#  include <err.h>
+#  define QUEUEDEBUG_ABORT(...) err(1, __VA_ARGS__)
+# endif
+#endif
+
+/*
+ * Singly-linked List definitions.
+ */
+#define	SLIST_HEAD(name, type)						\
+struct name {								\
+	struct type *slh_first;	/* first element */			\
+}
+
+#define	SLIST_HEAD_INITIALIZER(head)					\
+	{ NULL }
+
+#define	SLIST_ENTRY(type)						\
+struct {								\
+	struct type *sle_next;	/* next element */			\
+}
+
+/*
+ * Singly-linked List access methods.
+ */
+#define	SLIST_FIRST(head)	((head)->slh_first)
+#define	SLIST_END(head)		NULL
+#define	SLIST_EMPTY(head)	((head)->slh_first == NULL)
+#define	SLIST_NEXT(elm, field)	((elm)->field.sle_next)
+
+#define	SLIST_FOREACH(var, head, field)					\
+	for((var) = (head)->slh_first;					\
+	    (var) != SLIST_END(head);					\
+	    (var) = (var)->field.sle_next)
+
+#define	SLIST_FOREACH_SAFE(var, head, field, tvar)			\
+	for ((var) = SLIST_FIRST((head));				\
+	    (var) != SLIST_END(head) &&					\
+	    ((tvar) = SLIST_NEXT((var), field), 1);			\
+	    (var) = (tvar))
+
+/*
+ * Singly-linked List functions.
+ */
+#define	SLIST_INIT(head) do {						\
+	(head)->slh_first = SLIST_END(head);				\
+} while (/*CONSTCOND*/0)
+
+#define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\
+	(elm)->field.sle_next = (slistelm)->field.sle_next;		\
+	(slistelm)->field.sle_next = (elm);				\
+} while (/*CONSTCOND*/0)
+
+#define	SLIST_INSERT_HEAD(head, elm, field) do {			\
+	(elm)->field.sle_next = (head)->slh_first;			\
+	(head)->slh_first = (elm);					\
+} while (/*CONSTCOND*/0)
+
+#define	SLIST_REMOVE_AFTER(slistelm, field) do {			\
+	(slistelm)->field.sle_next =					\
+	    SLIST_NEXT(SLIST_NEXT((slistelm), field), field);		\
+} while (/*CONSTCOND*/0)
+
+#define	SLIST_REMOVE_HEAD(head, field) do {				\
+	(head)->slh_first = (head)->slh_first->field.sle_next;		\
+} while (/*CONSTCOND*/0)
+
+#define	SLIST_REMOVE(head, elm, type, field) do {			\
+	if ((head)->slh_first == (elm)) {				\
+		SLIST_REMOVE_HEAD((head), field);			\
+	}								\
+	else {								\
+		struct type *curelm = (head)->slh_first;		\
+		while(curelm->field.sle_next != (elm))			\
+			curelm = curelm->field.sle_next;		\
+		curelm->field.sle_next =				\
+		    curelm->field.sle_next->field.sle_next;		\
+	}								\
+} while (/*CONSTCOND*/0)
+
+
+/*
+ * List definitions.
+ */
+#define	LIST_HEAD(name, type)						\
+struct name {								\
+	struct type *lh_first;	/* first element */			\
+}
+
+#define	LIST_HEAD_INITIALIZER(head)					\
+	{ NULL }
+
+#define	LIST_ENTRY(type)						\
+struct {								\
+	struct type *le_next;	/* next element */			\
+	struct type **le_prev;	/* address of previous next element */	\
+}
+
+/*
+ * List access methods.
+ */
+#define	LIST_FIRST(head)		((head)->lh_first)
+#define	LIST_END(head)			NULL
+#define	LIST_EMPTY(head)		((head)->lh_first == LIST_END(head))
+#define	LIST_NEXT(elm, field)		((elm)->field.le_next)
+
+#define	LIST_FOREACH(var, head, field)					\
+	for ((var) = ((head)->lh_first);				\
+	    (var) != LIST_END(head);					\
+	    (var) = ((var)->field.le_next))
+
+#define	LIST_FOREACH_SAFE(var, head, field, tvar)			\
+	for ((var) = LIST_FIRST((head));				\
+	    (var) != LIST_END(head) &&					\
+	    ((tvar) = LIST_NEXT((var), field), 1);			\
+	    (var) = (tvar))
+
+#define	LIST_MOVE(head1, head2) do {					\
+	LIST_INIT((head2));						\
+	if (!LIST_EMPTY((head1))) {					\
+		(head2)->lh_first = (head1)->lh_first;			\
+		LIST_INIT((head1));					\
+	}								\
+} while (/*CONSTCOND*/0)
+
+/*
+ * List functions.
+ */
+#if defined(QUEUEDEBUG)
+#define	QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field)			\
+	if ((head)->lh_first &&						\
+	    (head)->lh_first->field.le_prev != &(head)->lh_first)	\
+		QUEUEDEBUG_ABORT("LIST_INSERT_HEAD %p %s:%d", (head),	\
+		    __FILE__, __LINE__);
+#define	QUEUEDEBUG_LIST_OP(elm, field)					\
+	if ((elm)->field.le_next &&					\
+	    (elm)->field.le_next->field.le_prev !=			\
+	    &(elm)->field.le_next)					\
+		QUEUEDEBUG_ABORT("LIST_* forw %p %s:%d", (elm),		\
+		    __FILE__, __LINE__);				\
+	if (*(elm)->field.le_prev != (elm))				\
+		QUEUEDEBUG_ABORT("LIST_* back %p %s:%d", (elm),		\
+		    __FILE__, __LINE__);
+#define	QUEUEDEBUG_LIST_POSTREMOVE(elm, field)				\
+	(elm)->field.le_next = (void *)1L;				\
+	(elm)->field.le_prev = (void *)1L;
+#else
+#define	QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field)
+#define	QUEUEDEBUG_LIST_OP(elm, field)
+#define	QUEUEDEBUG_LIST_POSTREMOVE(elm, field)
+#endif
+
+#define	LIST_INIT(head) do {						\
+	(head)->lh_first = LIST_END(head);				\
+} while (/*CONSTCOND*/0)
+
+#define	LIST_INSERT_AFTER(listelm, elm, field) do {			\
+	QUEUEDEBUG_LIST_OP((listelm), field)				\
+	if (((elm)->field.le_next = (listelm)->field.le_next) != 	\
+	    LIST_END(head))						\
+		(listelm)->field.le_next->field.le_prev =		\
+		    &(elm)->field.le_next;				\
+	(listelm)->field.le_next = (elm);				\
+	(elm)->field.le_prev = &(listelm)->field.le_next;		\
+} while (/*CONSTCOND*/0)
+
+#define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\
+	QUEUEDEBUG_LIST_OP((listelm), field)				\
+	(elm)->field.le_prev = (listelm)->field.le_prev;		\
+	(elm)->field.le_next = (listelm);				\
+	*(listelm)->field.le_prev = (elm);				\
+	(listelm)->field.le_prev = &(elm)->field.le_next;		\
+} while (/*CONSTCOND*/0)
+
+#define	LIST_INSERT_HEAD(head, elm, field) do {				\
+	QUEUEDEBUG_LIST_INSERT_HEAD((head), (elm), field)		\
+	if (((elm)->field.le_next = (head)->lh_first) != LIST_END(head))\
+		(head)->lh_first->field.le_prev = &(elm)->field.le_next;\
+	(head)->lh_first = (elm);					\
+	(elm)->field.le_prev = &(head)->lh_first;			\
+} while (/*CONSTCOND*/0)
+
+#define	LIST_REMOVE(elm, field) do {					\
+	QUEUEDEBUG_LIST_OP((elm), field)				\
+	if ((elm)->field.le_next != NULL)				\
+		(elm)->field.le_next->field.le_prev = 			\
+		    (elm)->field.le_prev;				\
+	*(elm)->field.le_prev = (elm)->field.le_next;			\
+	QUEUEDEBUG_LIST_POSTREMOVE((elm), field)			\
+} while (/*CONSTCOND*/0)
+
+#define LIST_REPLACE(elm, elm2, field) do {				\
+	if (((elm2)->field.le_next = (elm)->field.le_next) != NULL)	\
+		(elm2)->field.le_next->field.le_prev =			\
+		    &(elm2)->field.le_next;				\
+	(elm2)->field.le_prev = (elm)->field.le_prev;			\
+	*(elm2)->field.le_prev = (elm2);				\
+	QUEUEDEBUG_LIST_POSTREMOVE((elm), field)			\
+} while (/*CONSTCOND*/0)
+
+/*
+ * Simple queue definitions.
+ */
+#define	SIMPLEQ_HEAD(name, type)					\
+struct name {								\
+	struct type *sqh_first;	/* first element */			\
+	struct type **sqh_last;	/* addr of last next element */		\
+}
+
+#define	SIMPLEQ_HEAD_INITIALIZER(head)					\
+	{ NULL, &(head).sqh_first }
+
+#define	SIMPLEQ_ENTRY(type)						\
+struct {								\
+	struct type *sqe_next;	/* next element */			\
+}
+
+/*
+ * Simple queue access methods.
+ */
+#define	SIMPLEQ_FIRST(head)		((head)->sqh_first)
+#define	SIMPLEQ_END(head)		NULL
+#define	SIMPLEQ_EMPTY(head)		((head)->sqh_first == SIMPLEQ_END(head))
+#define	SIMPLEQ_NEXT(elm, field)	((elm)->field.sqe_next)
+
+#define	SIMPLEQ_FOREACH(var, head, field)				\
+	for ((var) = ((head)->sqh_first);				\
+	    (var) != SIMPLEQ_END(head);					\
+	    (var) = ((var)->field.sqe_next))
+
+#define	SIMPLEQ_FOREACH_SAFE(var, head, field, next)			\
+	for ((var) = ((head)->sqh_first);				\
+	    (var) != SIMPLEQ_END(head) &&				\
+	    ((next = ((var)->field.sqe_next)), 1);			\
+	    (var) = (next))
+
+/*
+ * Simple queue functions.
+ */
+#define	SIMPLEQ_INIT(head) do {						\
+	(head)->sqh_first = NULL;					\
+	(head)->sqh_last = &(head)->sqh_first;				\
+} while (/*CONSTCOND*/0)
+
+#define	SIMPLEQ_INSERT_HEAD(head, elm, field) do {			\
+	if (((elm)->field.sqe_next = (head)->sqh_first) == NULL)	\
+		(head)->sqh_last = &(elm)->field.sqe_next;		\
+	(head)->sqh_first = (elm);					\
+} while (/*CONSTCOND*/0)
+
+#define	SIMPLEQ_INSERT_TAIL(head, elm, field) do {			\
+	(elm)->field.sqe_next = NULL;					\
+	*(head)->sqh_last = (elm);					\
+	(head)->sqh_last = &(elm)->field.sqe_next;			\
+} while (/*CONSTCOND*/0)
+
+#define	SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
+	if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\
+		(head)->sqh_last = &(elm)->field.sqe_next;		\
+	(listelm)->field.sqe_next = (elm);				\
+} while (/*CONSTCOND*/0)
+
+#define	SIMPLEQ_REMOVE_HEAD(head, field) do {				\
+	if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \
+		(head)->sqh_last = &(head)->sqh_first;			\
+} while (/*CONSTCOND*/0)
+
+#define SIMPLEQ_REMOVE_AFTER(head, elm, field) do {			\
+	if (((elm)->field.sqe_next = (elm)->field.sqe_next->field.sqe_next) \
+	    == NULL)							\
+		(head)->sqh_last = &(elm)->field.sqe_next;		\
+} while (/*CONSTCOND*/0)
+
+#define	SIMPLEQ_REMOVE(head, elm, type, field) do {			\
+	if ((head)->sqh_first == (elm)) {				\
+		SIMPLEQ_REMOVE_HEAD((head), field);			\
+	} else {							\
+		struct type *curelm = (head)->sqh_first;		\
+		while (curelm->field.sqe_next != (elm))			\
+			curelm = curelm->field.sqe_next;		\
+		if ((curelm->field.sqe_next =				\
+			curelm->field.sqe_next->field.sqe_next) == NULL) \
+			    (head)->sqh_last = &(curelm)->field.sqe_next; \
+	}								\
+} while (/*CONSTCOND*/0)
+
+#define	SIMPLEQ_CONCAT(head1, head2) do {				\
+	if (!SIMPLEQ_EMPTY((head2))) {					\
+		*(head1)->sqh_last = (head2)->sqh_first;		\
+		(head1)->sqh_last = (head2)->sqh_last;		\
+		SIMPLEQ_INIT((head2));					\
+	}								\
+} while (/*CONSTCOND*/0)
+
+#define	SIMPLEQ_LAST(head, type, field)					\
+	(SIMPLEQ_EMPTY((head)) ?						\
+		NULL :							\
+	        ((struct type *)(void *)				\
+		((char *)((head)->sqh_last) - offsetof(struct type, field))))
+
+/*
+ * Tail queue definitions.
+ */
+#define	_TAILQ_HEAD(name, type, qual)					\
+struct name {								\
+	qual type *tqh_first;		/* first element */		\
+	qual type *qual *tqh_last;	/* addr of last next element */	\
+}
+#define TAILQ_HEAD(name, type)	_TAILQ_HEAD(name, struct type,)
+
+#define	TAILQ_HEAD_INITIALIZER(head)					\
+	{ TAILQ_END(head), &(head).tqh_first }
+
+#define	_TAILQ_ENTRY(type, qual)					\
+struct {								\
+	qual type *tqe_next;		/* next element */		\
+	qual type *qual *tqe_prev;	/* address of previous next element */\
+}
+#define TAILQ_ENTRY(type)	_TAILQ_ENTRY(struct type,)
+
+/*
+ * Tail queue access methods.
+ */
+#define	TAILQ_FIRST(head)		((head)->tqh_first)
+#define	TAILQ_END(head)			(NULL)
+#define	TAILQ_NEXT(elm, field)		((elm)->field.tqe_next)
+#define	TAILQ_LAST(head, headname) \
+	(*(((struct headname *)(void *)((head)->tqh_last))->tqh_last))
+#define	TAILQ_PREV(elm, headname, field) \
+	(*(((struct headname *)(void *)((elm)->field.tqe_prev))->tqh_last))
+#define	TAILQ_EMPTY(head)		(TAILQ_FIRST(head) == TAILQ_END(head))
+
+
+#define	TAILQ_FOREACH(var, head, field)					\
+	for ((var) = ((head)->tqh_first);				\
+	    (var) != TAILQ_END(head);					\
+	    (var) = ((var)->field.tqe_next))
+
+#define	TAILQ_FOREACH_SAFE(var, head, field, next)			\
+	for ((var) = ((head)->tqh_first);				\
+	    (var) != TAILQ_END(head) &&					\
+	    ((next) = TAILQ_NEXT(var, field), 1); (var) = (next))
+
+#define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\
+	for ((var) = TAILQ_LAST((head), headname);			\
+	    (var) != TAILQ_END(head);					\
+	    (var) = TAILQ_PREV((var), headname, field))
+
+#define	TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, prev)	\
+	for ((var) = TAILQ_LAST((head), headname);			\
+	    (var) != TAILQ_END(head) && 				\
+	    ((prev) = TAILQ_PREV((var), headname, field), 1); (var) = (prev))
+
+/*
+ * Tail queue functions.
+ */
+#if defined(QUEUEDEBUG)
+#define	QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field)			\
+	if ((head)->tqh_first &&					\
+	    (head)->tqh_first->field.tqe_prev != &(head)->tqh_first)	\
+		QUEUEDEBUG_ABORT("TAILQ_INSERT_HEAD %p %s:%d", (head),	\
+		    __FILE__, __LINE__);
+#define	QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field)			\
+	if (*(head)->tqh_last != NULL)					\
+		QUEUEDEBUG_ABORT("TAILQ_INSERT_TAIL %p %s:%d", (head),	\
+		    __FILE__, __LINE__);
+#define	QUEUEDEBUG_TAILQ_OP(elm, field)					\
+	if ((elm)->field.tqe_next &&					\
+	    (elm)->field.tqe_next->field.tqe_prev !=			\
+	    &(elm)->field.tqe_next)					\
+		QUEUEDEBUG_ABORT("TAILQ_* forw %p %s:%d", (elm),	\
+		    __FILE__, __LINE__);				\
+	if (*(elm)->field.tqe_prev != (elm))				\
+		QUEUEDEBUG_ABORT("TAILQ_* back %p %s:%d", (elm),	\
+		    __FILE__, __LINE__);
+#define	QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field)			\
+	if ((elm)->field.tqe_next == NULL &&				\
+	    (head)->tqh_last != &(elm)->field.tqe_next)			\
+		QUEUEDEBUG_ABORT("TAILQ_PREREMOVE head %p elm %p %s:%d",\
+		    (head), (elm), __FILE__, __LINE__);
+#define	QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field)				\
+	(elm)->field.tqe_next = (void *)1L;				\
+	(elm)->field.tqe_prev = (void *)1L;
+#else
+#define	QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field)
+#define	QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field)
+#define	QUEUEDEBUG_TAILQ_OP(elm, field)
+#define	QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field)
+#define	QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field)
+#endif
+
+#define	TAILQ_INIT(head) do {						\
+	(head)->tqh_first = TAILQ_END(head);				\
+	(head)->tqh_last = &(head)->tqh_first;				\
+} while (/*CONSTCOND*/0)
+
+#define	TAILQ_INSERT_HEAD(head, elm, field) do {			\
+	QUEUEDEBUG_TAILQ_INSERT_HEAD((head), (elm), field)		\
+	if (((elm)->field.tqe_next = (head)->tqh_first) != TAILQ_END(head))\
+		(head)->tqh_first->field.tqe_prev =			\
+		    &(elm)->field.tqe_next;				\
+	else								\
+		(head)->tqh_last = &(elm)->field.tqe_next;		\
+	(head)->tqh_first = (elm);					\
+	(elm)->field.tqe_prev = &(head)->tqh_first;			\
+} while (/*CONSTCOND*/0)
+
+#define	TAILQ_INSERT_TAIL(head, elm, field) do {			\
+	QUEUEDEBUG_TAILQ_INSERT_TAIL((head), (elm), field)		\
+	(elm)->field.tqe_next = TAILQ_END(head);			\
+	(elm)->field.tqe_prev = (head)->tqh_last;			\
+	*(head)->tqh_last = (elm);					\
+	(head)->tqh_last = &(elm)->field.tqe_next;			\
+} while (/*CONSTCOND*/0)
+
+#define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
+	QUEUEDEBUG_TAILQ_OP((listelm), field)				\
+	if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != 	\
+	    TAILQ_END(head))						\
+		(elm)->field.tqe_next->field.tqe_prev = 		\
+		    &(elm)->field.tqe_next;				\
+	else								\
+		(head)->tqh_last = &(elm)->field.tqe_next;		\
+	(listelm)->field.tqe_next = (elm);				\
+	(elm)->field.tqe_prev = &(listelm)->field.tqe_next;		\
+} while (/*CONSTCOND*/0)
+
+#define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\
+	QUEUEDEBUG_TAILQ_OP((listelm), field)				\
+	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
+	(elm)->field.tqe_next = (listelm);				\
+	*(listelm)->field.tqe_prev = (elm);				\
+	(listelm)->field.tqe_prev = &(elm)->field.tqe_next;		\
+} while (/*CONSTCOND*/0)
+
+#define	TAILQ_REMOVE(head, elm, field) do {				\
+	QUEUEDEBUG_TAILQ_PREREMOVE((head), (elm), field)		\
+	QUEUEDEBUG_TAILQ_OP((elm), field)				\
+	if (((elm)->field.tqe_next) != TAILQ_END(head))			\
+		(elm)->field.tqe_next->field.tqe_prev = 		\
+		    (elm)->field.tqe_prev;				\
+	else								\
+		(head)->tqh_last = (elm)->field.tqe_prev;		\
+	*(elm)->field.tqe_prev = (elm)->field.tqe_next;			\
+	QUEUEDEBUG_TAILQ_POSTREMOVE((elm), field);			\
+} while (/*CONSTCOND*/0)
+
+#define TAILQ_REPLACE(head, elm, elm2, field) do {			\
+        if (((elm2)->field.tqe_next = (elm)->field.tqe_next) != 	\
+	    TAILQ_END(head))   						\
+                (elm2)->field.tqe_next->field.tqe_prev =		\
+                    &(elm2)->field.tqe_next;				\
+        else								\
+                (head)->tqh_last = &(elm2)->field.tqe_next;		\
+        (elm2)->field.tqe_prev = (elm)->field.tqe_prev;			\
+        *(elm2)->field.tqe_prev = (elm2);				\
+	QUEUEDEBUG_TAILQ_POSTREMOVE((elm), field);			\
+} while (/*CONSTCOND*/0)
+
+#define	TAILQ_CONCAT(head1, head2, field) do {				\
+	if (!TAILQ_EMPTY(head2)) {					\
+		*(head1)->tqh_last = (head2)->tqh_first;		\
+		(head2)->tqh_first->field.tqe_prev = (head1)->tqh_last;	\
+		(head1)->tqh_last = (head2)->tqh_last;			\
+		TAILQ_INIT((head2));					\
+	}								\
+} while (/*CONSTCOND*/0)
+
+/*
+ * Singly-linked Tail queue declarations.
+ */
+#define	STAILQ_HEAD(name, type)						\
+struct name {								\
+	struct type *stqh_first;	/* first element */		\
+	struct type **stqh_last;	/* addr of last next element */	\
+}
+
+#define	STAILQ_HEAD_INITIALIZER(head)					\
+	{ NULL, &(head).stqh_first }
+
+#define	STAILQ_ENTRY(type)						\
+struct {								\
+	struct type *stqe_next;	/* next element */			\
+}
+
+/*
+ * Singly-linked Tail queue access methods.
+ */
+#define	STAILQ_FIRST(head)	((head)->stqh_first)
+#define	STAILQ_END(head)	NULL
+#define	STAILQ_NEXT(elm, field)	((elm)->field.stqe_next)
+#define	STAILQ_EMPTY(head)	(STAILQ_FIRST(head) == STAILQ_END(head))
+
+/*
+ * Singly-linked Tail queue functions.
+ */
+#define	STAILQ_INIT(head) do {						\
+	(head)->stqh_first = NULL;					\
+	(head)->stqh_last = &(head)->stqh_first;				\
+} while (/*CONSTCOND*/0)
+
+#define	STAILQ_INSERT_HEAD(head, elm, field) do {			\
+	if (((elm)->field.stqe_next = (head)->stqh_first) == NULL)	\
+		(head)->stqh_last = &(elm)->field.stqe_next;		\
+	(head)->stqh_first = (elm);					\
+} while (/*CONSTCOND*/0)
+
+#define	STAILQ_INSERT_TAIL(head, elm, field) do {			\
+	(elm)->field.stqe_next = NULL;					\
+	*(head)->stqh_last = (elm);					\
+	(head)->stqh_last = &(elm)->field.stqe_next;			\
+} while (/*CONSTCOND*/0)
+
+#define	STAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
+	if (((elm)->field.stqe_next = (listelm)->field.stqe_next) == NULL)\
+		(head)->stqh_last = &(elm)->field.stqe_next;		\
+	(listelm)->field.stqe_next = (elm);				\
+} while (/*CONSTCOND*/0)
+
+#define	STAILQ_REMOVE_HEAD(head, field) do {				\
+	if (((head)->stqh_first = (head)->stqh_first->field.stqe_next) == NULL) \
+		(head)->stqh_last = &(head)->stqh_first;			\
+} while (/*CONSTCOND*/0)
+
+#define	STAILQ_REMOVE(head, elm, type, field) do {			\
+	if ((head)->stqh_first == (elm)) {				\
+		STAILQ_REMOVE_HEAD((head), field);			\
+	} else {							\
+		struct type *curelm = (head)->stqh_first;		\
+		while (curelm->field.stqe_next != (elm))			\
+			curelm = curelm->field.stqe_next;		\
+		if ((curelm->field.stqe_next =				\
+			curelm->field.stqe_next->field.stqe_next) == NULL) \
+			    (head)->stqh_last = &(curelm)->field.stqe_next; \
+	}								\
+} while (/*CONSTCOND*/0)
+
+#define	STAILQ_FOREACH(var, head, field)				\
+	for ((var) = ((head)->stqh_first);				\
+		(var);							\
+		(var) = ((var)->field.stqe_next))
+
+#define	STAILQ_FOREACH_SAFE(var, head, field, tvar)			\
+	for ((var) = STAILQ_FIRST((head));				\
+	    (var) && ((tvar) = STAILQ_NEXT((var), field), 1);		\
+	    (var) = (tvar))
+
+#define	STAILQ_CONCAT(head1, head2) do {				\
+	if (!STAILQ_EMPTY((head2))) {					\
+		*(head1)->stqh_last = (head2)->stqh_first;		\
+		(head1)->stqh_last = (head2)->stqh_last;		\
+		STAILQ_INIT((head2));					\
+	}								\
+} while (/*CONSTCOND*/0)
+
+#define	STAILQ_LAST(head, type, field)					\
+	(STAILQ_EMPTY((head)) ?						\
+		NULL :							\
+	        ((struct type *)(void *)				\
+		((char *)((head)->stqh_last) - offsetof(struct type, field))))
+
+
+#ifndef _KERNEL
+/*
+ * Circular queue definitions. Do not use. We still keep the macros
+ * for compatibility but because of pointer aliasing issues their use
+ * is discouraged!
+ */
+
+/*
+ * __launder_type():  We use this ugly hack to work around the the compiler
+ * noticing that two types may not alias each other and elide tests in code.
+ * We hit this in the CIRCLEQ macros when comparing 'struct name *' and
+ * 'struct type *' (see CIRCLEQ_HEAD()).  Modern compilers (such as GCC
+ * 4.8) declare these comparisons as always false, causing the code to
+ * not run as designed.
+ *
+ * This hack is only to be used for comparisons and thus can be fully const.
+ * Do not use for assignment.
+ *
+ * If we ever choose to change the ABI of the CIRCLEQ macros, we could fix
+ * this by changing the head/tail sentinal values, but see the note above
+ * this one.
+ */
+static __inline const void * __launder_type(const void *);
+static __inline const void *
+__launder_type(const void *__x)
+{
+	__asm __volatile("" : "+r" (__x));
+	return __x;
+}
+
+#if defined(QUEUEDEBUG)
+#define QUEUEDEBUG_CIRCLEQ_HEAD(head, field)				\
+	if ((head)->cqh_first != CIRCLEQ_ENDC(head) &&			\
+	    (head)->cqh_first->field.cqe_prev != CIRCLEQ_ENDC(head))	\
+		QUEUEDEBUG_ABORT("CIRCLEQ head forw %p %s:%d", (head),	\
+		      __FILE__, __LINE__);				\
+	if ((head)->cqh_last != CIRCLEQ_ENDC(head) &&			\
+	    (head)->cqh_last->field.cqe_next != CIRCLEQ_ENDC(head))	\
+		QUEUEDEBUG_ABORT("CIRCLEQ head back %p %s:%d", (head),	\
+		      __FILE__, __LINE__);
+#define QUEUEDEBUG_CIRCLEQ_ELM(head, elm, field)			\
+	if ((elm)->field.cqe_next == CIRCLEQ_ENDC(head)) {		\
+		if ((head)->cqh_last != (elm))				\
+			QUEUEDEBUG_ABORT("CIRCLEQ elm last %p %s:%d",	\
+			    (elm), __FILE__, __LINE__);			\
+	} else {							\
+		if ((elm)->field.cqe_next->field.cqe_prev != (elm))	\
+			QUEUEDEBUG_ABORT("CIRCLEQ elm forw %p %s:%d",	\
+			    (elm), __FILE__, __LINE__);			\
+	}								\
+	if ((elm)->field.cqe_prev == CIRCLEQ_ENDC(head)) {		\
+		if ((head)->cqh_first != (elm))				\
+			QUEUEDEBUG_ABORT("CIRCLEQ elm first %p %s:%d",	\
+			    (elm), __FILE__, __LINE__);			\
+	} else {							\
+		if ((elm)->field.cqe_prev->field.cqe_next != (elm))	\
+			QUEUEDEBUG_ABORT("CIRCLEQ elm prev %p %s:%d",	\
+			    (elm), __FILE__, __LINE__);			\
+	}
+#define QUEUEDEBUG_CIRCLEQ_POSTREMOVE(elm, field)			\
+	(elm)->field.cqe_next = (void *)1L;				\
+	(elm)->field.cqe_prev = (void *)1L;
+#else
+#define QUEUEDEBUG_CIRCLEQ_HEAD(head, field)
+#define QUEUEDEBUG_CIRCLEQ_ELM(head, elm, field)
+#define QUEUEDEBUG_CIRCLEQ_POSTREMOVE(elm, field)
+#endif
+
+#define	CIRCLEQ_HEAD(name, type)					\
+struct name {								\
+	struct type *cqh_first;		/* first element */		\
+	struct type *cqh_last;		/* last element */		\
+}
+
+#define	CIRCLEQ_HEAD_INITIALIZER(head)					\
+	{ CIRCLEQ_END(&head), CIRCLEQ_END(&head) }
+
+#define	CIRCLEQ_ENTRY(type)						\
+struct {								\
+	struct type *cqe_next;		/* next element */		\
+	struct type *cqe_prev;		/* previous element */		\
+}
+
+/*
+ * Circular queue functions.
+ */
+#define	CIRCLEQ_INIT(head) do {						\
+	(head)->cqh_first = CIRCLEQ_END(head);				\
+	(head)->cqh_last = CIRCLEQ_END(head);				\
+} while (/*CONSTCOND*/0)
+
+#define	CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\
+	QUEUEDEBUG_CIRCLEQ_HEAD((head), field)				\
+	QUEUEDEBUG_CIRCLEQ_ELM((head), (listelm), field)		\
+	(elm)->field.cqe_next = (listelm)->field.cqe_next;		\
+	(elm)->field.cqe_prev = (listelm);				\
+	if ((listelm)->field.cqe_next == CIRCLEQ_ENDC(head))		\
+		(head)->cqh_last = (elm);				\
+	else								\
+		(listelm)->field.cqe_next->field.cqe_prev = (elm);	\
+	(listelm)->field.cqe_next = (elm);				\
+} while (/*CONSTCOND*/0)
+
+#define	CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\
+	QUEUEDEBUG_CIRCLEQ_HEAD((head), field)				\
+	QUEUEDEBUG_CIRCLEQ_ELM((head), (listelm), field)		\
+	(elm)->field.cqe_next = (listelm);				\
+	(elm)->field.cqe_prev = (listelm)->field.cqe_prev;		\
+	if ((listelm)->field.cqe_prev == CIRCLEQ_ENDC(head))		\
+		(head)->cqh_first = (elm);				\
+	else								\
+		(listelm)->field.cqe_prev->field.cqe_next = (elm);	\
+	(listelm)->field.cqe_prev = (elm);				\
+} while (/*CONSTCOND*/0)
+
+#define	CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\
+	QUEUEDEBUG_CIRCLEQ_HEAD((head), field)				\
+	(elm)->field.cqe_next = (head)->cqh_first;			\
+	(elm)->field.cqe_prev = CIRCLEQ_END(head);			\
+	if ((head)->cqh_last == CIRCLEQ_ENDC(head))			\
+		(head)->cqh_last = (elm);				\
+	else								\
+		(head)->cqh_first->field.cqe_prev = (elm);		\
+	(head)->cqh_first = (elm);					\
+} while (/*CONSTCOND*/0)
+
+#define	CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\
+	QUEUEDEBUG_CIRCLEQ_HEAD((head), field)				\
+	(elm)->field.cqe_next = CIRCLEQ_END(head);			\
+	(elm)->field.cqe_prev = (head)->cqh_last;			\
+	if ((head)->cqh_first == CIRCLEQ_ENDC(head))			\
+		(head)->cqh_first = (elm);				\
+	else								\
+		(head)->cqh_last->field.cqe_next = (elm);		\
+	(head)->cqh_last = (elm);					\
+} while (/*CONSTCOND*/0)
+
+#define	CIRCLEQ_REMOVE(head, elm, field) do {				\
+	QUEUEDEBUG_CIRCLEQ_HEAD((head), field)				\
+	QUEUEDEBUG_CIRCLEQ_ELM((head), (elm), field)			\
+	if ((elm)->field.cqe_next == CIRCLEQ_ENDC(head))		\
+		(head)->cqh_last = (elm)->field.cqe_prev;		\
+	else								\
+		(elm)->field.cqe_next->field.cqe_prev =			\
+		    (elm)->field.cqe_prev;				\
+	if ((elm)->field.cqe_prev == CIRCLEQ_ENDC(head))		\
+		(head)->cqh_first = (elm)->field.cqe_next;		\
+	else								\
+		(elm)->field.cqe_prev->field.cqe_next =			\
+		    (elm)->field.cqe_next;				\
+	QUEUEDEBUG_CIRCLEQ_POSTREMOVE((elm), field)			\
+} while (/*CONSTCOND*/0)
+
+#define	CIRCLEQ_FOREACH(var, head, field)				\
+	for ((var) = ((head)->cqh_first);				\
+		(var) != CIRCLEQ_ENDC(head);				\
+		(var) = ((var)->field.cqe_next))
+
+#define	CIRCLEQ_FOREACH_REVERSE(var, head, field)			\
+	for ((var) = ((head)->cqh_last);				\
+		(var) != CIRCLEQ_ENDC(head);				\
+		(var) = ((var)->field.cqe_prev))
+
+/*
+ * Circular queue access methods.
+ */
+#define	CIRCLEQ_FIRST(head)		((head)->cqh_first)
+#define	CIRCLEQ_LAST(head)		((head)->cqh_last)
+/* For comparisons */
+#define	CIRCLEQ_ENDC(head)		(__launder_type(head))
+/* For assignments */
+#define	CIRCLEQ_END(head)		((void *)(head))
+#define	CIRCLEQ_NEXT(elm, field)	((elm)->field.cqe_next)
+#define	CIRCLEQ_PREV(elm, field)	((elm)->field.cqe_prev)
+#define	CIRCLEQ_EMPTY(head)						\
+    (CIRCLEQ_FIRST(head) == CIRCLEQ_ENDC(head))
+
+#define CIRCLEQ_LOOP_NEXT(head, elm, field)				\
+	(((elm)->field.cqe_next == CIRCLEQ_ENDC(head))			\
+	    ? ((head)->cqh_first)					\
+	    : (elm->field.cqe_next))
+#define CIRCLEQ_LOOP_PREV(head, elm, field)				\
+	(((elm)->field.cqe_prev == CIRCLEQ_ENDC(head))			\
+	    ? ((head)->cqh_last)					\
+	    : (elm->field.cqe_prev))
+#endif /* !_KERNEL */
+
+#endif	/* !_SYS_QUEUE_H_ */

+ 0 - 0
dl/musl/.lock


BIN
dl/musl/musl-1.2.1.tar.gz


+ 0 - 0
dl/ncurses/.lock


BIN
dl/ncurses/ncurses-6.1-20190609-patch.sh.bz2


BIN
dl/ncurses/ncurses-6.1-20190615.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190623.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190630.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190706.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190713.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190720.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190727.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190728.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190803.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190810.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190817.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190824.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190831.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190907.patch.gz


BIN
dl/ncurses/ncurses-6.1-20190914.patch.gz


Vissa filer visades inte eftersom för många filer har ändrats