2 * $DragonFly: src/lib/libskey/put.c,v 1.4 2004/10/25 19:38:45 drhodus Exp $
11 static unsigned long extract (char *s,int start,int length);
12 static void standard (char *word);
13 static void insert (char *s, int x, int start, int length);
14 static int wsrch (char *w,int low,int high);
16 /* Dictionary for integer-word translations */
17 static char Wp[2048][4] = {
2068 /* Encode 8 bytes in 'c' as a string of English words.
2069 * Returns a pointer to a static buffer
2075 char cp[9]; /* add in room for the parity 2 bits*/
2080 /* compute parity */
2081 for(p = 0,i = 0; i < 64;i += 2)
2082 p += extract(cp,i,2);
2084 cp[8] = (char)p << 6;
2085 strncat(engout,&Wp[extract(cp, 0,11)][0],4);
2087 strncat(engout,&Wp[extract(cp,11,11)][0],4);
2089 strncat(engout,&Wp[extract(cp,22,11)][0],4);
2091 strncat(engout,&Wp[extract(cp,33,11)][0],4);
2093 strncat(engout,&Wp[extract(cp,44,11)][0],4);
2095 strncat(engout,&Wp[extract(cp,55,11)][0],4);
2097 printf("engout is %s\n\r",engout);
2102 /* convert English to binary
2103 * returns 1 OK - all good words and parity is OK
2104 * 0 word not in data base
2105 * -1 badly formed in put ie > 4 char word
2106 * -2 words OK but parity is wrong
2114 int i, v,l, low,high;
2122 strncpy(input,e,sizeof(input));
2124 memset(b, 0, sizeof(b));
2126 for(i=0,p=0;i<6;i++,p+=11){
2127 while ((word = strsep(&cp, " ")) != NULL && *word == '\0')
2142 if( (v = wsrch(word,low,high)) < 0 )
2144 insert(b,v,(int)p,11);
2147 /* now check the parity of what we got */
2148 for(p = 0, i = 0; i < 64; i +=2)
2149 p += extract(b, i, 2);
2151 if( (p & 3) != extract(b, 64,2) )
2158 /* Display 8 bytes as a series of 16-bit hex digits */
2164 sprintf(out,"%02X%02X %02X%02X %02X%02X %02X%02X",
2165 s[0] & 0xff,s[1] & 0xff,s[2] & 0xff,
2166 s[3] & 0xff,s[4] & 0xff,s[5] & 0xff,
2167 s[6] & 0xff,s[7] & 0xff);
2171 /* Encode 8 bytes in 'cp' as stream of ascii letters.
2172 * Provided as a possible alternative to btoe()
2179 static char out[31];
2181 /* code out put by characters 6 bits each added to 0x21 (!)*/
2182 for(i=0;i <= 10;i++){
2183 /* last one is only 4 bits not 6*/
2184 out[i] = '!'+ extract(cp,6*i,i >= 10 ? 4:6);
2191 /* Internal subroutines for word encoding/decoding */
2193 /* Dictionary binary search */
2203 if((j = strncmp(w,Wp[i],4)) == 0)
2204 return i; /* Found it */
2206 /* Avoid effects of integer truncation in /2 */
2207 if(strncmp(w,Wp[high],4) == 0)
2213 return -1; /* I don't *think* this can happen...*/
2215 high = i; /* Search lower half */
2217 low = i; /* Search upper half */
2221 insert(s, x, start, length)
2232 assert(length <= 11);
2234 assert(length >= 0);
2235 assert(start +length <= 66);
2237 shift = ((8 -(( start + length) % 8))%8);
2238 y = (long) x << shift;
2239 cl = (y >> 16) & 0xff;
2240 cc = (y >> 8) & 0xff;
2242 if(shift + length > 16){
2244 s[start/8 +1] |= cc;
2245 s[start/8 +2] |= cr;
2246 } else if(shift +length > 8){
2248 s[start/8 + 1] |= cr;
2262 *word = toupper(*word);
2273 /* Extract 'length' bits from the char array 's' starting with bit 'start' */
2274 static unsigned long
2275 extract(s, start, length)
2284 assert(length <= 11);
2286 assert(length >= 0);
2287 assert(start +length <= 66);
2292 x = ((long)(cl<<8 | cc) <<8 | cr) ;
2293 x = x >> (24 - (length + (start %8)));
2294 x =( x & (0xffff >> (16-length) ) );
projects / dragonfly.git / blob