sha1.c File Reference

#include "postgres.h"
#include <sys/param.h>
#include "sha1_int.h"

Include dependency graph for sha1.c:

Go to the source code of this file.

Macros
#define	K(t)   _K[(t) / 20]
#define	F0(b, c, d)   (((b) & (c)) | ((~(b)) & (d)))
#define	F1(b, c, d)   (((b) ^ (c)) ^ (d))
#define	F2(b, c, d)   (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
#define	F3(b, c, d)   (((b) ^ (c)) ^ (d))
#define	S(n, x)   (((x) << (n)) | ((x) >> (32 - (n))))
#define	H(n)   (ctx->h.b32[(n)])
#define	COUNT   (ctx->count)
#define	BCOUNT   (ctx->c.b64[0] / 8)
#define	W(n)   (ctx->m.b32[(n)])
#define	PUTPAD(x)

Functions
static void	sha1_step (pg_sha1_ctx *ctx)
static void	sha1_pad (pg_sha1_ctx *ctx)
static void	sha1_result (uint8 *digest0, pg_sha1_ctx *ctx)
void	pg_sha1_init (pg_sha1_ctx *ctx)
void	pg_sha1_update (pg_sha1_ctx *ctx, const uint8 *data, size_t len)
void	pg_sha1_final (pg_sha1_ctx *ctx, uint8 *dest)

Variables
static const uint32	_K [] = {0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6}

Macro Definition Documentation

BCOUNT

#define BCOUNT   (ctx->c.b64[0] / 8)

Definition at line 77 of file sha1.c.

COUNT

#define COUNT   (ctx->count)

Definition at line 76 of file sha1.c.

F0

#define F0	(		b,
			c,
			d
	)		(((b) & (c)) | ((~(b)) & (d)))

Definition at line 68 of file sha1.c.

F1

#define F1	(		b,
			c,
			d
	)		(((b) ^ (c)) ^ (d))

Definition at line 69 of file sha1.c.

F2

#define F2	(		b,
			c,
			d
	)		(((b) & (c)) | ((b) & (d)) | ((c) & (d)))

Definition at line 70 of file sha1.c.

F3

#define F3	(		b,
			c,
			d
	)		(((b) ^ (c)) ^ (d))

Definition at line 71 of file sha1.c.

H

#define H

(

n

)

(ctx->h.b32[(n)])

Definition at line 75 of file sha1.c.

K

#define K

(

t

)

_K[(t) / 20]

Definition at line 66 of file sha1.c.

PUTPAD

#define PUTPAD

(

x

)

Value:

do { \
    ctx->m.b8[(COUNT % 64)] = (x);      \
    COUNT++;                \
    COUNT %= 64;                \
    if (COUNT % 64 == 0)            \
        sha1_step(ctx);     \
} while (0)

Definition at line 80 of file sha1.c.

S

#define S	(		n,
			x
	)		(((x) << (n)) | ((x) >> (32 - (n))))

Definition at line 73 of file sha1.c.

W

#define W

(

n

)

(ctx->m.b32[(n)])

Definition at line 78 of file sha1.c.

Function Documentation

pg_sha1_final()

void pg_sha1_final	(	pg_sha1_ctx *	ctx,
		uint8 *	dest
	)

Definition at line 365 of file sha1.c.

{
    sha1_pad(ctx);
    sha1_result(dest, ctx);
}

References generate_unaccent_rules::dest, sha1_pad(), and sha1_result().

Referenced by pg_cryptohash_final().

pg_sha1_init()

void pg_sha1_init

(

pg_sha1_ctx *

ctx

)

Definition at line 316 of file sha1.c.

{
    memset(ctx, 0, sizeof(pg_sha1_ctx));
    H(0) = 0x67452301;
    H(1) = 0xefcdab89;
    H(2) = 0x98badcfe;
    H(3) = 0x10325476;
    H(4) = 0xc3d2e1f0;
}

References H.

Referenced by pg_cryptohash_init().

pg_sha1_update()

void pg_sha1_update	(	pg_sha1_ctx *	ctx,
		const uint8 *	data,
		size_t	len
	)

Definition at line 332 of file sha1.c.

{
    const uint8 *input;
    size_t      gaplen;
    size_t      gapstart;
    size_t      off;
    size_t      copysiz;
 
    input = (const uint8 *) data;
    off = 0;
 
    while (off < len)
    {
        gapstart = COUNT % 64;
        gaplen = 64 - gapstart;
 
        copysiz = (gaplen < len - off) ? gaplen : len - off;
        memmove(&ctx->m.b8[gapstart], &input[off], copysiz);
        COUNT += copysiz;
        COUNT %= 64;
        ctx->c.b64[0] += copysiz * 8;
        if (COUNT % 64 == 0)
            sha1_step(ctx);
        off += copysiz;
    }
}

References pg_sha1_ctx::b64, pg_sha1_ctx::b8, pg_sha1_ctx::c, COUNT, data, input, len, pg_sha1_ctx::m, and sha1_step().

Referenced by pg_cryptohash_update().

sha1_pad()

static void sha1_pad ( pg_sha1_ctx *  ctx )

static

Definition at line 233 of file sha1.c.

{
    size_t      padlen;         /* pad length in bytes */
    size_t      padstart;
 
    PUTPAD(0x80);
 
    padstart = COUNT % 64;
    padlen = 64 - padstart;
    if (padlen < 8)
    {
        memset(&ctx->m.b8[padstart], 0, padlen);
        COUNT += padlen;
        COUNT %= 64;
        sha1_step(ctx);
        padstart = COUNT % 64;  /* should be 0 */
        padlen = 64 - padstart; /* should be 64 */
    }
    memset(&ctx->m.b8[padstart], 0, padlen - 8);
    COUNT += (padlen - 8);
    COUNT %= 64;
#ifdef WORDS_BIGENDIAN
    PUTPAD(ctx->c.b8[0]);
    PUTPAD(ctx->c.b8[1]);
    PUTPAD(ctx->c.b8[2]);
    PUTPAD(ctx->c.b8[3]);
    PUTPAD(ctx->c.b8[4]);
    PUTPAD(ctx->c.b8[5]);
    PUTPAD(ctx->c.b8[6]);
    PUTPAD(ctx->c.b8[7]);
#else
    PUTPAD(ctx->c.b8[7]);
    PUTPAD(ctx->c.b8[6]);
    PUTPAD(ctx->c.b8[5]);
    PUTPAD(ctx->c.b8[4]);
    PUTPAD(ctx->c.b8[3]);
    PUTPAD(ctx->c.b8[2]);
    PUTPAD(ctx->c.b8[1]);
    PUTPAD(ctx->c.b8[0]);
#endif
}

References pg_sha1_ctx::b8, pg_sha1_ctx::c, COUNT, pg_sha1_ctx::m, PUTPAD, and sha1_step().

Referenced by pg_sha1_final().

sha1_result()

static void sha1_result ( uint8 *  digest0, pg_sha1_ctx *  ctx  )

static

Definition at line 276 of file sha1.c.

{
    uint8      *digest;
 
    digest = (uint8 *) digest0;
 
#ifdef WORDS_BIGENDIAN
    memmove(digest, &ctx->h.b8[0], 20);
#else
    digest[0] = ctx->h.b8[3];
    digest[1] = ctx->h.b8[2];
    digest[2] = ctx->h.b8[1];
    digest[3] = ctx->h.b8[0];
    digest[4] = ctx->h.b8[7];
    digest[5] = ctx->h.b8[6];
    digest[6] = ctx->h.b8[5];
    digest[7] = ctx->h.b8[4];
    digest[8] = ctx->h.b8[11];
    digest[9] = ctx->h.b8[10];
    digest[10] = ctx->h.b8[9];
    digest[11] = ctx->h.b8[8];
    digest[12] = ctx->h.b8[15];
    digest[13] = ctx->h.b8[14];
    digest[14] = ctx->h.b8[13];
    digest[15] = ctx->h.b8[12];
    digest[16] = ctx->h.b8[19];
    digest[17] = ctx->h.b8[18];
    digest[18] = ctx->h.b8[17];
    digest[19] = ctx->h.b8[16];
#endif
}

References pg_sha1_ctx::b8, and pg_sha1_ctx::h.

Referenced by pg_sha1_final().

sha1_step()

static void sha1_step ( pg_sha1_ctx *  ctx )

static

Definition at line 90 of file sha1.c.

{
    uint32      a,
                b,
                c,
                d,
                e;
    size_t      t,
                s;
    uint32      tmp;
 
#ifndef WORDS_BIGENDIAN
    pg_sha1_ctx tctx;
 
    memmove(&tctx.m.b8[0], &ctx->m.b8[0], 64);
    ctx->m.b8[0] = tctx.m.b8[3];
    ctx->m.b8[1] = tctx.m.b8[2];
    ctx->m.b8[2] = tctx.m.b8[1];
    ctx->m.b8[3] = tctx.m.b8[0];
    ctx->m.b8[4] = tctx.m.b8[7];
    ctx->m.b8[5] = tctx.m.b8[6];
    ctx->m.b8[6] = tctx.m.b8[5];
    ctx->m.b8[7] = tctx.m.b8[4];
    ctx->m.b8[8] = tctx.m.b8[11];
    ctx->m.b8[9] = tctx.m.b8[10];
    ctx->m.b8[10] = tctx.m.b8[9];
    ctx->m.b8[11] = tctx.m.b8[8];
    ctx->m.b8[12] = tctx.m.b8[15];
    ctx->m.b8[13] = tctx.m.b8[14];
    ctx->m.b8[14] = tctx.m.b8[13];
    ctx->m.b8[15] = tctx.m.b8[12];
    ctx->m.b8[16] = tctx.m.b8[19];
    ctx->m.b8[17] = tctx.m.b8[18];
    ctx->m.b8[18] = tctx.m.b8[17];
    ctx->m.b8[19] = tctx.m.b8[16];
    ctx->m.b8[20] = tctx.m.b8[23];
    ctx->m.b8[21] = tctx.m.b8[22];
    ctx->m.b8[22] = tctx.m.b8[21];
    ctx->m.b8[23] = tctx.m.b8[20];
    ctx->m.b8[24] = tctx.m.b8[27];
    ctx->m.b8[25] = tctx.m.b8[26];
    ctx->m.b8[26] = tctx.m.b8[25];
    ctx->m.b8[27] = tctx.m.b8[24];
    ctx->m.b8[28] = tctx.m.b8[31];
    ctx->m.b8[29] = tctx.m.b8[30];
    ctx->m.b8[30] = tctx.m.b8[29];
    ctx->m.b8[31] = tctx.m.b8[28];
    ctx->m.b8[32] = tctx.m.b8[35];
    ctx->m.b8[33] = tctx.m.b8[34];
    ctx->m.b8[34] = tctx.m.b8[33];
    ctx->m.b8[35] = tctx.m.b8[32];
    ctx->m.b8[36] = tctx.m.b8[39];
    ctx->m.b8[37] = tctx.m.b8[38];
    ctx->m.b8[38] = tctx.m.b8[37];
    ctx->m.b8[39] = tctx.m.b8[36];
    ctx->m.b8[40] = tctx.m.b8[43];
    ctx->m.b8[41] = tctx.m.b8[42];
    ctx->m.b8[42] = tctx.m.b8[41];
    ctx->m.b8[43] = tctx.m.b8[40];
    ctx->m.b8[44] = tctx.m.b8[47];
    ctx->m.b8[45] = tctx.m.b8[46];
    ctx->m.b8[46] = tctx.m.b8[45];
    ctx->m.b8[47] = tctx.m.b8[44];
    ctx->m.b8[48] = tctx.m.b8[51];
    ctx->m.b8[49] = tctx.m.b8[50];
    ctx->m.b8[50] = tctx.m.b8[49];
    ctx->m.b8[51] = tctx.m.b8[48];
    ctx->m.b8[52] = tctx.m.b8[55];
    ctx->m.b8[53] = tctx.m.b8[54];
    ctx->m.b8[54] = tctx.m.b8[53];
    ctx->m.b8[55] = tctx.m.b8[52];
    ctx->m.b8[56] = tctx.m.b8[59];
    ctx->m.b8[57] = tctx.m.b8[58];
    ctx->m.b8[58] = tctx.m.b8[57];
    ctx->m.b8[59] = tctx.m.b8[56];
    ctx->m.b8[60] = tctx.m.b8[63];
    ctx->m.b8[61] = tctx.m.b8[62];
    ctx->m.b8[62] = tctx.m.b8[61];
    ctx->m.b8[63] = tctx.m.b8[60];
#endif
 
    a = H(0);
    b = H(1);
    c = H(2);
    d = H(3);
    e = H(4);
 
    for (t = 0; t < 20; t++)
    {
        s = t & 0x0f;
        if (t >= 16)
            W(s) = S(1, W((s + 13) & 0x0f) ^ W((s + 8) & 0x0f) ^ W((s + 2) & 0x0f) ^ W(s));
        tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t);
        e = d;
        d = c;
        c = S(30, b);
        b = a;
        a = tmp;
    }
    for (t = 20; t < 40; t++)
    {
        s = t & 0x0f;
        W(s) = S(1, W((s + 13) & 0x0f) ^ W((s + 8) & 0x0f) ^ W((s + 2) & 0x0f) ^ W(s));
        tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t);
        e = d;
        d = c;
        c = S(30, b);
        b = a;
        a = tmp;
    }
    for (t = 40; t < 60; t++)
    {
        s = t & 0x0f;
        W(s) = S(1, W((s + 13) & 0x0f) ^ W((s + 8) & 0x0f) ^ W((s + 2) & 0x0f) ^ W(s));
        tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t);
        e = d;
        d = c;
        c = S(30, b);
        b = a;
        a = tmp;
    }
    for (t = 60; t < 80; t++)
    {
        s = t & 0x0f;
        W(s) = S(1, W((s + 13) & 0x0f) ^ W((s + 8) & 0x0f) ^ W((s + 2) & 0x0f) ^ W(s));
        tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t);
        e = d;
        d = c;
        c = S(30, b);
        b = a;
        a = tmp;
    }
 
    H(0) = H(0) + a;
    H(1) = H(1) + b;
    H(2) = H(2) + c;
    H(3) = H(3) + d;
    H(4) = H(4) + e;
 
    memset(&ctx->m.b8[0], 0, 64);
}

References a, b, pg_sha1_ctx::b8, F0, F1, F2, F3, H, K, pg_sha1_ctx::m, S, and W.

Referenced by pg_sha1_update(), and sha1_pad().

Variable Documentation

_K

const uint32 _K[] = {0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6}

static

Definition at line 64 of file sha1.c.