2 * Copyright 1988 by the Massachusetts Institute of Technology.
4 * For copying and distribution information,
5 * please see the file <mit-cpyright.h>.
7 * This file contains a generation routine for source code
8 * implementing the final permutation of the DES.
11 #include <afsconfig.h>
12 #include <afs/param.h>
17 #include <mit-cpyright.h>
20 #include "des_internal.h"
21 #include "des_prototypes.h"
31 /* clear the output */
32 fprintf(stream, " L2 = 0; R2 = 0;\n");
35 * NOTE: As part of the final permutation, we also have to adjust
36 * for host bit order via "swap_bit_pos_0()". Since L2,R2 are
37 * the output from this, we adjust the bit positions written into
42 swap_long_bytes_bit_number(swap_bit_pos_0_to_ansi((unsigned)i)-j)
45 fprintf(stream, "/* FP operations */\n/* first left to left */\n");
47 /* first list mapping from left to left */
48 for (i = 0; i <= 31; i++)
50 test_set(stream, "L1", FP[i], "L2", SWAP(i, 0));
52 /* now mapping from right to left */
53 fprintf(stream, "\n\n/* now from right to left */\n");
54 for (i = 0; i <= 31; i++)
56 test_set(stream, "R1", FP[i] - 32, "L2", SWAP(i, 0));
58 fprintf(stream, "\n/* now from left to right */\n");
60 /* list mapping from left to right */
61 for (i = 32; i <= 63; i++)
63 test_set(stream, "L1", FP[i], "R2", SWAP(i, 32));
65 /* now mapping from right to right */
66 fprintf(stream, "\n/* last from right to right */\n");
67 for (i = 32; i <= 63; i++)
69 test_set(stream, "R1", FP[i] - 32, "R2", SWAP(i, 32));