| Elliott Hughes | 5dec78d | 2014-02-26 15:56:23 -0800 | [diff] [blame] | 1 | #!/bin/sh |
| 2 | # Copyright (c) 1993, 1994, 1995, 1996 Rick Sladkey <jrs@world.std.com> |
| 3 | # All rights reserved. |
| 4 | # |
| 5 | # Redistribution and use in source and binary forms, with or without |
| 6 | # modification, are permitted provided that the following conditions |
| 7 | # are met: |
| 8 | # 1. Redistributions of source code must retain the above copyright |
| 9 | # notice, this list of conditions and the following disclaimer. |
| 10 | # 2. Redistributions in binary form must reproduce the above copyright |
| 11 | # notice, this list of conditions and the following disclaimer in the |
| 12 | # documentation and/or other materials provided with the distribution. |
| 13 | # 3. The name of the author may not be used to endorse or promote products |
| 14 | # derived from this software without specific prior written permission. |
| 15 | # |
| 16 | # THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
| 17 | # IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| 18 | # OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
| 19 | # IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
| 20 | # INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
| 21 | # NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 22 | # DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 23 | # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 24 | # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
| 25 | # THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 26 | |
| 27 | cat ${1+"$@"} | |
| 28 | sed -n 's/^#[ ]*define[ ][ ]*SYS_\([^ ]*\)[ ]*[^0-9]*\([0-9]*\).*$/\1 \2/p |
| 29 | s/^#[ ]*define[ ][ ]*__NR_\([^ ]*\)[ ]*[^0-9]*\([0-9]*\).*$/\1 \2/p |
| 30 | s/^#[ ]*define[ ][ ]*__NR_\([^ ]*\)[ ]*[^0-9()]*(__NR_Linux + \([0-9]*\))$/\1 \2/p' | |
| 31 | sort -k2n | uniq | |
| 32 | awk ' |
| 33 | BEGIN { |
| 34 | tabs = "\t\t\t\t\t\t\t\t" |
| 35 | call = -1; |
| 36 | } |
| 37 | { |
| 38 | while (++call < $2) { |
| 39 | f = "printargs" |
| 40 | n = "SYS_" call |
| 41 | s = "\t{ MA,\t0,\t" |
| 42 | s = s f "," |
| 43 | s = s substr(tabs, 1, 24/8 - int((length(f) + 1)/8)) |
| 44 | s = s "\"" n "\"" |
| 45 | s = s substr(tabs, 1, 16/8 - int((length(n) + 2)/8)) |
| 46 | s = s "}, /* " call " */" |
| 47 | print s |
| 48 | } |
| 49 | f = "sys_" $1 |
| 50 | n = $1 |
| 51 | s = "\t{ MA,\t0,\t" |
| 52 | s = s f "," |
| 53 | s = s substr(tabs, 1, 24/8 - int((length(f) + 1)/8)) |
| 54 | s = s "\"" n "\"" |
| 55 | s = s substr(tabs, 1, 16/8 - int((length(n) + 2)/8)) |
| 56 | s = s "}, /* " call " */" |
| 57 | print s |
| 58 | } |
| 59 | END { |
| 60 | limit = call + 100 |
| 61 | while (++call < limit) { |
| 62 | f = "printargs" |
| 63 | n = "SYS_" call |
| 64 | s = "\t{ MA,\t0,\t" |
| 65 | s = s f "," |
| 66 | s = s substr(tabs, 1, 24/8 - int((length(f) + 1)/8)) |
| 67 | s = s "\"" n "\"" |
| 68 | s = s substr(tabs, 1, 16/8 - int((length(n) + 2)/8)) |
| 69 | s = s "}, /* " call " */" |
| 70 | print s |
| 71 | } |
| 72 | } |
| 73 | ' |