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>
15 #include "mit-cpyright.h"
18 #include "des_internal.h"
19 #include "des_prototypes.h"
28 #ifdef AFS_DARWIN80_ENV
31 #define swap_long_bytes_bit_number _darwin_swap_long_bytes_bit_number
32 #endif /* AFS_DARWIN80_ENV */
34 /* clear the output */
35 fprintf(stream, " L2 = 0; R2 = 0;\n");
38 * NOTE: As part of the final permutation, we also have to adjust
39 * for host bit order via "swap_bit_pos_0()". Since L2,R2 are
40 * the output from this, we adjust the bit positions written into
45 swap_long_bytes_bit_number(swap_bit_pos_0_to_ansi((unsigned)i)-j)
47 #ifdef AFS_DARWIN80_ENV
49 fprintf(stream, "%s", _darwin_whichstr[j]);
52 #endif /* AFS_DARWIN80_ENV */
54 fprintf(stream, "/* FP operations */\n/* first left to left */\n");
56 /* first list mapping from left to left */
57 for (i = 0; i <= 31; i++)
59 test_set(stream, "L1", FP[i], "L2", SWAP(i, 0));
61 /* now mapping from right to left */
62 fprintf(stream, "\n\n/* now from right to left */\n");
63 for (i = 0; i <= 31; i++)
65 test_set(stream, "R1", FP[i] - 32, "L2", SWAP(i, 0));
67 fprintf(stream, "\n/* now from left to right */\n");
69 /* list mapping from left to right */
70 for (i = 32; i <= 63; i++)
72 test_set(stream, "L1", FP[i], "R2", SWAP(i, 32));
74 /* now mapping from right to right */
75 fprintf(stream, "\n/* last from right to right */\n");
76 for (i = 32; i <= 63; i++)
78 test_set(stream, "R1", FP[i] - 32, "R2", SWAP(i, 32));
79 #ifdef AFS_DARWIN80_ENV
80 _darwin_which = !_darwin_which;
82 #endif /* AFS_DARWIN80_ENV */