1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
/*
* $Source$
* $Author$
*
* Copyright 1988, 1990 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America is assumed
* to require a specific license from the United States Government.
* It is the responsibility of any person or organization contemplating
* export to obtain such a license before exporting.
*
* WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
* distribute this software and its documentation for any purpose and
* without fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation, and that
* the name of M.I.T. not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior
* permission. M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is" without express
* or implied warranty.
*
*
* This file contains a generation routine for source code
* implementing the final permutation of the DES.
*/
#if !defined(lint) && !defined(SABER)
static char rcsid_make_fp_c[] =
"$Id$";
#endif /* !lint & !SABER */
#include <krb5/krb5.h>
#include <stdio.h>
#include <krb5/ext-proto.h>
#include "des_int.h"
#include "tables.h"
void gen (stream)
FILE * stream;
{
register i;
/* clear the output */
fprintf(stream," L2 = 0; R2 = 0;\n");
/*
* NOTE: As part of the final permutation, we also have to adjust
* for host bit order via "swap_bit_pos_0()". Since L2,R2 are
* the output from this, we adjust the bit positions written into
* L2,R2.
*/
#define SWAP(i,j) \
swap_long_bytes_bit_number(swap_bit_pos_0_to_ansi((unsigned)i)-j)
/* first setup FP */
fprintf(stream,
"/* FP operations */\n/* first left to left */\n");
/* first list mapping from left to left */
for (i = 0; i <= 31; i++)
if (FP[i] < 32)
test_set(stream, "L1", FP[i], "L2", SWAP(i,0));
/* now mapping from right to left */
fprintf(stream,"\n\n/* now from right to left */\n");
for (i = 0; i <= 31; i++)
if (FP[i] >= 32)
test_set(stream, "R1", FP[i]-32, "L2", SWAP(i,0));
fprintf(stream,"\n/* now from left to right */\n");
/* list mapping from left to right */
for (i = 32; i <= 63; i++)
if (FP[i] <32)
test_set(stream, "L1", FP[i], "R2", SWAP(i,32));
/* now mapping from right to right */
fprintf(stream,"\n/* last from right to right */\n");
for (i = 32; i <= 63; i++)
if (FP[i] >= 32)
test_set(stream, "R1", FP[i]-32, "R2", SWAP(i,32));
}
|
