/* vi: set sw=4 ts=4: */ /* * Mini dumpkmap implementation for busybox * * Copyright (C) Arne Bernin * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA * */ #include #include #include #include #include #include #include #include "busybox.h" /* From */ struct kbentry { unsigned char kb_table; unsigned char kb_index; unsigned short kb_value; }; #define KDGKBENT 0x4B46 /* gets one entry in translation table */ /* From */ #define NR_KEYS 128 #define MAX_NR_KEYMAPS 256 int dumpkmap_main(int argc, char **argv) { struct kbentry ke; int i, j, fd; char flags[MAX_NR_KEYMAPS], magic[] = "bkeymap"; if (argc >= 2 && *argv[1] == '-') bb_show_usage(); fd = bb_xopen(CURRENT_VC, O_RDWR); write(1, magic, 7); /* Here we want to set everything to 0 except for indexes: * [0-2] [4-6] [8-10] [12] */ memset(flags, 0x00, MAX_NR_KEYMAPS); memset(flags, 0x01, 13); flags[3] = flags[7] = flags[11] = 0; /* dump flags */ write(1, flags, MAX_NR_KEYMAPS); for (i = 0; i < MAX_NR_KEYMAPS; i++) { if (flags[i] == 1) { for (j = 0; j < NR_KEYS; j++) { ke.kb_index = j; ke.kb_table = i; if (ioctl(fd, KDGKBENT, &ke) < 0) { bb_perror_msg("ioctl failed with %s, %s, %p", (char *)&ke.kb_index, (char *)&ke.kb_table, &ke.kb_value); } else { write(1, (void*)&ke.kb_value, 2); } } } } close(fd); return EXIT_SUCCESS; }