zakarya/puzzles
1
0
Fork 0
mirror of git://git.tartarus.org/simon/puzzles.git synced 2025-04-20 23:51:29 -07:00
Code Issues Packages Projects Releases Wiki Activity

Initial checkin of my Minesweeper clone, which uses a solver during

Browse Source 
grid generation to arrange a mine layout that never requires guessing.

[originally from svn r5859]
This commit is contained in:
Simon Tatham
2005-05-30 10:08:27 +00:00
parent 0f423f0b3a
commit 6b9e690c89
6 changed files with 2742 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
random.c
View File

@ -15,15 +15,6 @@
#include "puzzles.h"
typedef unsigned long uint32;
typedef struct {
uint32 h[5];
unsigned char block[64];
int blkused;
uint32 lenhi, lenlo;
} SHA_State;
/* ----------------------------------------------------------------------
* Core SHA algorithm: processes 16-word blocks into a message digest.
*/
@ -108,14 +99,14 @@ static void SHATransform(uint32 * digest, uint32 * block)
* the end, and pass those blocks to the core SHA algorithm.
*/
static void SHA_Init(SHA_State * s)
void SHA_Init(SHA_State * s)
{
SHA_Core_Init(s->h);
s->blkused = 0;
s->lenhi = s->lenlo = 0;
}
static void SHA_Bytes(SHA_State * s, void *p, int len)
void SHA_Bytes(SHA_State * s, void *p, int len)
{
unsigned char *q = (unsigned char *) p;
uint32 wordblock[16];
@ -158,7 +149,7 @@ static void SHA_Bytes(SHA_State * s, void *p, int len)
}
}
static void SHA_Final(SHA_State * s, unsigned char *output)
void SHA_Final(SHA_State * s, unsigned char *output)
{
int i;
int pad;
@ -196,7 +187,7 @@ static void SHA_Final(SHA_State * s, unsigned char *output)
}
}
static void SHA_Simple(void *p, int len, unsigned char *output)
void SHA_Simple(void *p, int len, unsigned char *output)
{
SHA_State s;