aboutsummaryrefslogtreecommitdiffstats
path: root/ext/sha1
diff options
context:
space:
mode:
Diffstat (limited to 'ext/sha1')
-rw-r--r--ext/sha1/.cvsignore1
-rw-r--r--ext/sha1/MANIFEST7
-rw-r--r--ext/sha1/extconf.rb3
-rw-r--r--ext/sha1/sha1-ruby.c111
-rw-r--r--ext/sha1/sha1.c172
-rw-r--r--ext/sha1/sha1.h33
-rw-r--r--ext/sha1/sha1.txt56
-rw-r--r--ext/sha1/sha1.txt.jp56
8 files changed, 0 insertions, 439 deletions
diff --git a/ext/sha1/.cvsignore b/ext/sha1/.cvsignore
deleted file mode 100644
index f3c7a7c5da..0000000000
--- a/ext/sha1/.cvsignore
+++ /dev/null
@@ -1 +0,0 @@
-Makefile
diff --git a/ext/sha1/MANIFEST b/ext/sha1/MANIFEST
deleted file mode 100644
index d946af1cd8..0000000000
--- a/ext/sha1/MANIFEST
+++ /dev/null
@@ -1,7 +0,0 @@
-MANIFEST
-extconf.rb
-sha1-ruby.c
-sha1.c
-sha1.h
-sha1.txt
-sha1.txt.jp
diff --git a/ext/sha1/extconf.rb b/ext/sha1/extconf.rb
deleted file mode 100644
index 32e46cf3d7..0000000000
--- a/ext/sha1/extconf.rb
+++ /dev/null
@@ -1,3 +0,0 @@
-require 'mkmf'
-
-create_makefile('sha1')
diff --git a/ext/sha1/sha1-ruby.c b/ext/sha1/sha1-ruby.c
deleted file mode 100644
index abd704c638..0000000000
--- a/ext/sha1/sha1-ruby.c
+++ /dev/null
@@ -1,111 +0,0 @@
-#include "ruby.h"
-#include "sha1.h"
-
-static VALUE cSHA1;
-
-static VALUE
-sha1_update(obj, str)
- VALUE obj;
- struct RString *str;
-{
- SHA1_CTX *sha1;
-
- Check_Type(str, T_STRING);
- Data_Get_Struct(obj, SHA1_CTX, sha1);
- SHA1Update(sha1, str->ptr, str->len);
-
- return obj;
-}
-
-static VALUE
-sha1_digest(obj)
- VALUE obj;
-{
- SHA1_CTX *sha1, ctx;
- unsigned char digest[20];
-
- Data_Get_Struct(obj, SHA1_CTX, sha1);
- ctx = *sha1;
- SHA1Final(digest, &ctx);
-
- return rb_str_new(digest, 20);
-}
-
-static VALUE
-sha1_hexdigest(obj)
- VALUE obj;
-{
- SHA1_CTX *sha1, ctx;
- unsigned char digest[20];
- char buf[41];
- int i;
-
- Data_Get_Struct(obj, SHA1_CTX, sha1);
- ctx = *sha1;
- SHA1Final(digest, &ctx);
-
- for (i=0; i<20; i++) {
- sprintf(buf+i*2, "%02x", digest[i]);
- }
- return rb_str_new(buf, 40);
-}
-
-static VALUE
-sha1_clone(obj)
- VALUE obj;
-{
- SHA1_CTX *sha1, *sha1_new;
-
- Data_Get_Struct(obj, SHA1_CTX, sha1);
- obj = Data_Make_Struct(CLASS_OF(obj), SHA1_CTX, 0, free, sha1_new);
- *sha1_new = *sha1;
-
- return obj;
-}
-
-static VALUE
-sha1_init(argc, argv, self)
- int argc;
- VALUE* argv;
- VALUE self;
-{
- VALUE arg;
-
- rb_scan_args(argc, argv, "01", &arg);
-
- if (!NIL_P(arg)) sha1_update(self, arg);
-
- return self;
-}
-
-static VALUE
-sha1_new(argc, argv, class)
- int argc;
- VALUE* argv;
- VALUE class;
-{
- VALUE obj;
- SHA1_CTX *sha1;
-
- obj = Data_Make_Struct(class, SHA1_CTX, 0, free, sha1);
- SHA1Init(sha1);
- rb_obj_call_init(obj, argc, argv);
-
- return obj;
-}
-
-void
-Init_sha1()
-{
- cSHA1 = rb_define_class("SHA1", rb_cObject);
-
- rb_define_singleton_method(cSHA1, "new", sha1_new, -1);
- rb_define_singleton_method(cSHA1, "sha1", sha1_new, -1);
-
- rb_define_method(cSHA1, "update", sha1_update, 1);
- rb_define_method(cSHA1, "initialize", sha1_init, -1);
- rb_define_method(cSHA1, "<<", sha1_update, 1);
- rb_define_method(cSHA1, "digest", sha1_digest, 0);
- rb_define_method(cSHA1, "hexdigest", sha1_hexdigest, 0);
- rb_define_method(cSHA1, "clone", sha1_clone, 0);
-}
diff --git a/ext/sha1/sha1.c b/ext/sha1/sha1.c
deleted file mode 100644
index f6f9fa88f2..0000000000
--- a/ext/sha1/sha1.c
+++ /dev/null
@@ -1,172 +0,0 @@
-/*
-SHA-1 in C
-By Steve Reid <steve@edmweb.com>
-100% Public Domain
-
-Test Vectors (from FIPS PUB 180-1)
-"abc"
- A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
-"abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
- 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
-A million repetitions of "a"
- 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
-*/
-
-/* #define SHA1HANDSOFF * Copies data before messing with it. */
-
-#include "sha1.h"
-
-#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
-
-/* blk0() and blk() perform the initial expand. */
-/* I got the idea of expanding during the round function from SSLeay */
-#ifdef WORDS_BIGENDIAN
-#define blk0(i) block->l[i]
-#else /* LITTLE ENDIAN */
-#define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
- |(rol(block->l[i],8)&0x00FF00FF))
-#endif
-#define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
- ^block->l[(i+2)&15]^block->l[i&15],1))
-
-/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
-#define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
-#define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
-#define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
-#define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
-#define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
-
-
-/* Hash a single 512-bit block. This is the core of the algorithm. */
-
-void
-SHA1Transform(state, buffer)
- unsigned long state[5];
- unsigned char buffer[64];
-{
-unsigned long a, b, c, d, e;
-typedef union {
- unsigned char c[64];
- unsigned long l[16];
-} CHAR64LONG16;
-CHAR64LONG16* block;
-#ifdef SHA1HANDSOFF
-static unsigned char workspace[64];
- block = (CHAR64LONG16*)workspace;
- memcpy(block, buffer, 64);
-#else
- block = (CHAR64LONG16*)buffer;
-#endif
- /* Copy context->state[] to working vars */
- a = state[0];
- b = state[1];
- c = state[2];
- d = state[3];
- e = state[4];
- /* 4 rounds of 20 operations each. Loop unrolled. */
- R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
- R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
- R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
- R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
- R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
- R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
- R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
- R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
- R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
- R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
- R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
- R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
- R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
- R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
- R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
- R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
- R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
- R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
- R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
- R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
- /* Add the working vars back into context.state[] */
- state[0] += a;
- state[1] += b;
- state[2] += c;
- state[3] += d;
- state[4] += e;
- /* Wipe variables */
- a = b = c = d = e = 0;
-}
-
-
-/* SHA1Init - Initialize new context */
-
-void
-SHA1Init(context)
- SHA1_CTX* context;
-{
- /* SHA1 initialization constants */
- context->state[0] = 0x67452301;
- context->state[1] = 0xEFCDAB89;
- context->state[2] = 0x98BADCFE;
- context->state[3] = 0x10325476;
- context->state[4] = 0xC3D2E1F0;
- context->count[0] = context->count[1] = 0;
-}
-
-
-/* Run your data through this. */
-
-void
-SHA1Update(context, data, len)
- SHA1_CTX* context;
- unsigned char* data;
- unsigned int len;
-{
-unsigned int i, j;
-
- j = (context->count[0] >> 3) & 63;
- if ((context->count[0] += len << 3) < (len << 3)) context->count[1]++;
- context->count[1] += (len >> 29);
- if ((j + len) > 63) {
- memcpy(&context->buffer[j], data, (i = 64-j));
- SHA1Transform(context->state, context->buffer);
- for ( ; i + 63 < len; i += 64) {
- SHA1Transform(context->state, &data[i]);
- }
- j = 0;
- }
- else i = 0;
- memcpy(&context->buffer[j], &data[i], len - i);
-}
-
-
-/* Add padding and return the message digest. */
-
-void
-SHA1Final(digest, context)
- unsigned char digest[20];
- SHA1_CTX* context;
-{
-unsigned long i, j;
-unsigned char finalcount[8];
-
- for (i = 0; i < 8; i++) {
- finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
- >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
- }
- SHA1Update(context, (unsigned char *)"\200", 1);
- while ((context->count[0] & 504) != 448) {
- SHA1Update(context, (unsigned char *)"\0", 1);
- }
- SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
- for (i = 0; i < 20; i++) {
- digest[i] = (unsigned char)
- ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
- }
- /* Wipe variables */
- i = j = 0;
- memset(context->buffer, 0, 64);
- memset(context->state, 0, 20);
- memset(context->count, 0, 8);
- memset(&finalcount, 0, 8);
-#ifdef SHA1HANDSOFF /* make SHA1Transform overwrite it's own static vars */
- SHA1Transform(context->state, context->buffer);
-#endif
-}
diff --git a/ext/sha1/sha1.h b/ext/sha1/sha1.h
deleted file mode 100644
index f988476a1b..0000000000
--- a/ext/sha1/sha1.h
+++ /dev/null
@@ -1,33 +0,0 @@
-#ifndef _SHA1_H
-#define _SHA1_H
-
-#include "config.h"
-
-#ifdef HAVE_PROTOTYPES
-#define PROTOTYPES 1
-#endif
-#ifndef PROTOTYPES
-#define PROTOTYPES 0
-#endif
-
-#if PROTOTYPES
-#define __P(x) x
-#else
-#define __P(x) ()
-#endif
-
-#include <stdio.h>
-#include <string.h>
-
-typedef struct {
- unsigned long state[5];
- unsigned long count[2];
- unsigned char buffer[64];
-} SHA1_CTX;
-
-void SHA1Transform __P((unsigned long state[5], unsigned char buffer[64]));
-void SHA1Init __P((SHA1_CTX* context));
-void SHA1Update __P((SHA1_CTX* context, unsigned char* data, unsigned int len));
-void SHA1Final __P((unsigned char digest[20], SHA1_CTX* context));
-
-#endif /* _SHA1_H */
diff --git a/ext/sha1/sha1.txt b/ext/sha1/sha1.txt
deleted file mode 100644
index 0ddc0a6ae8..0000000000
--- a/ext/sha1/sha1.txt
+++ /dev/null
@@ -1,56 +0,0 @@
-.\" sha1.doc - -*- Indented-Text -*- created at: Thu May 17 06:51:50 JST 2001
-
-** SHA1(Class)
-
-A class to implement the SHA1 Secure Hash Algorithm by NIST (the US'
-National Institute of Standards and Technology), described in FIPS PUB
-180-1.
-
-Superclass: Object
-
-Class Methods:
-
- new([str])
- sha1([str])
-
- Creates a new SHA1 object. If a string argument is given, it
- is added to the object. (see update.)
-
-Methods:
-
- clone
-
- Copies the SHA1 object.
-
- digest
-
- Returns the SHA1 hash of the added strings as a string of 20
- bytes.
-
- hexdigest
-
- Returns the SHA1 hash of the added strings as a string of 40
- hexadecimal digits. This method is equal to:
-
- def hexdigest
- ret = ''
- digest.each_byte {|i| ret << sprintf('%02x', i) }
- ret
- end
-
- update(str)
- << str
-
- Updates the SHA1 object with string str. Repeated calls are
- equivalent to a single call with the concatenation of all the
- arguments, i.e. m.update(a); m.update(b) is equivalent to
- m.update(a+b) and m << a << b is equivalent to m << a+b.
-
-Copyright:
-
- sha1.c is in the public domain.
-
--------------------------------------------------------
-Local variables:
-fill-column: 70
-end:
diff --git a/ext/sha1/sha1.txt.jp b/ext/sha1/sha1.txt.jp
deleted file mode 100644
index dc3d2e38cc..0000000000
--- a/ext/sha1/sha1.txt.jp
+++ /dev/null
@@ -1,56 +0,0 @@
-.\" sha1.doc - -*- Indented-Text -*- created at: Thu May 17 06:51:50 JST 2001
-
-** SHA1(クラス)
-
-FIPS PUB 180-1に記述されているNIST (the US' National Institute of
-Standards and Technology) の SHA1 Secure Hash Algorithmを実装するクラス。
-
-Superclass: Object
-
-Class Methods:
-
- new([str])
- sha1([str])
-
- 新しいSHA1オブジェクトを生成する．文字列引数が与えられるとそれ
- を追加する(see update)。
-
-Methods:
-
- clone
-
- SHA1オブジェクトの複製を作る。
-
- digest
-
- 今までに追加した文字列に対するハッシュ値を20バイト長の文字列で
- 返す。
-
- hexdigest
-
- 今までに追加した文字列に対するハッシュ値を、ASCIIコードを使って
- 16進数の列を示す'18e40e1401eef67e1ae69efab09afb71f87ffb81'のよう
- な40文字の文字列にエンコードして返す。Rubyで書くと以下と同じ。
-
- def hexdigest
- ret = ''
- digest.each_byte {|i| ret << sprintf('%02x', i) }
- ret
- end
-
- update(str)
- << str
-
- SHA1オブジェクトに文字列を追加する。複数回updateを呼ぶことは文
- 字列を連結してupdateを呼ぶことと等しい。すなわち m.update(a);
- m.update(b) は m.update(a+b) と、 m << a << b は m << a+b と
- それぞれ等価である。
-
-Copyright:
-
- sha1.c はパブリックドメインである。
-
--------------------------------------------------------
-Local variables:
-fill-column: 70
-end:
generated by cgit v1.2.3 (git 2.39.1) at 2024-08-12 06:39:09 +0000