diff options
35 files changed, 4537 insertions, 0 deletions
diff --git a/doc/net/http.rd.ja b/doc/net/http.rd.ja new file mode 100644 index 0000000000..08447b10d6 --- /dev/null +++ b/doc/net/http.rd.ja @@ -0,0 +1,435 @@ +=begin + += net/http.rb version 1.2.3 + +== このライブラリについて + +汎用データ転送プロトコル HTTP を扱うライブラリです。 +実装は [RFC2616] ((<URL:http://www.ietf.org/rfc/rfc2616.txt>)) に +基いています。 + +== 使用例 + +=== ウェブサーバからドキュメントを得る (GET) + + require 'net/http' + Net::HTTP.start( 'some.www.server', 80 ) {|http| + response , = http.get('/index.html') + puts response.body + } + +また以下は同じ意味で短く書いたものです。 + + require 'net/http' + Net::HTTP.get_print 'some.www.server', '/index.html' + +=== フォームの情報を送信する (POST) + + require 'net/http' + Net::HTTP.start( 'some.www.server', 80 ) {|http| + response , = http.post( '/cgi-bin/any.rhtml', + 'querytype=subject&target=ruby' ) + } + +=== プロクシ経由のアクセス + +Net::HTTP のクラスメソッド Net::HTTP.Proxy は、常にプロクシ経由で +接続するような動作をする、新しいクラスを作成して返します。このクラスは +Net::HTTP を継承しているので Net::HTTP と全く同じように使えます。 + + require 'net/http' + + $proxy_addr = 'your.proxy.addr' + $proxy_port = 8080 + : + Net::HTTP::Proxy($proxy_addr, $proxy_port).start( 'some.www.server' ) {|http| + # always connect to your.proxy.addr:8080 + : + } + +また Net::HTTP.Proxy は第一引数が nil だと Net::HTTP 自身を返すので +上のコードのように書いておけばプロクシなしの場合にも対応できます。 + +=== リダイレクトに対応する + + require 'net/http' + Net::HTTP.version_1_1 + + host = 'www.ruby-lang.org' + path = '/' + begin + Net::HTTP.start( host, 80 ) {|http| + response , = http.get(path) + print response.body + } + rescue Net::ProtoRetriableError => err + if m = %r<http://([^/]+)>.match( err.response['location'] ) then + host = m[1].strip + path = m.post_match + retry + end + end + +この例では URL からホスト名を得るのにいいかげんな方法を使っていますが、 +将来 URI クラスが標準添付になればもっと簡単になるはずです。 + +=== Basic 認証 + + require 'net/http' + + Net::HTTP.start( 'auth.some.domain' ) {|http| + response , = http.get( '/need-auth.cgi', + 'Authentication' => ["#{account}:#{password}"].pack('m').strip ) + print response.body + } + +バージョン 1.2 (Ruby 1.7 以降に添付) では次のように書けます。 + + require 'net/http' + + req = Net::HTTP::Get.new('/need-auth.cgi') + req.basic_auth 'account', 'password' + Net::HTTP.start( 'auth.some.domain' ) {|http| + response = http.request( req ) + print response.body + } + +== 新しい仕様への変更と移行措置について + +Ruby 1.6 に入っているのが http.rb 1.1 で 1.7 以降が 1.2 ですが、 +この間ではかなり大きく仕様が変わります。そこで突然に仕様を変更 +するのでなく、両方の実装を並存させる時期を設けることにしました。 + +メソッド HTTP.version_1_2、HTTP.version_1_1 を呼ぶと +そのあとに生成される Net::HTTP オブジェクトはそれぞれの +バージョンの仕様で動作するようになります。以下は使用例です。 + + # example + Net::HTTP.start {|http1| ...(http1 has 1.2 features)... } + + Net::HTTP.version_1_1 + Net::HTTP.start {|http2| ...(http2 has 1.1 features)... } + + Net::HTTP.version_1_2 + Net::HTTP.start {|http3| ...(http3 has 1.2 features)... } + +この機能はスレッドセーフではありません。 + +== class Net::HTTP + +=== クラスメソッド + +: new( address = 'localhost', port = 80, proxy_addr = nil, proxy_port = nil ) + 新しい HTTP オブジェクトを生成します。address は HTTP サーバーの FQDN で、 + port は接続するポート番号です。このメソッドではまだ接続はしません。 + + proxy_addr を与えるとプロクシを介して接続するオブジェクトを生成します。 + +: start( address = 'localhost', port = 80, proxy_addr = nil, proxy_port = nil ) +: start( address = 'localhost', port = 80, proxy_addr = nil, proxy_port = nil ) {|http| .... } + 以下と同じです。 + + Net::HTTP.new(address, port, proxy_addr, proxy_port).start(&block) + +: get( address, path, port = 80 ) + ホスト address の port 番ポートに接続して path の表現する + エンティティを取得、文字列で返します。 + +: get_print( address, path, port = 80 ) + ホスト address の port 番ポートに接続して path の表現する + エンティティを取得したうえ、$stdout に << で出力します。 + +: Proxy( address, port = 80 ) + 常に指定されたプロクシに接続するクラスを作成し返します。 + このクラスは Net::HTTP を継承しているので Net::HTTP と全く + 同じように使えます。 + + address が nil のときは Net::HTTP クラスをそのまま返します。 + + # example + proxy_class = Net::HTTP::Proxy( 'proxy.foo.org', 8080 ) + : + proxy_class.start( 'www.ruby-lang.org' ) do |http| + # connecting proxy.foo.org:8080 + : + end + +: proxy_class? + 自身が (Proxy メソッドによって作成された) プロクシ用のクラスならば真。 + +: port + HTTP のデフォルトポート (80)。 + +=== メソッド + +: start +: start {|http| .... } + TCP コネクションを張り、HTTP セッションを開始します。 + すでにセッションが開始していたら例外 IOError を発生します。 + + イテレータとして呼ばれた時はブロックの間だけセッションを接続し、 + ブロック終了とともに自動的にセッションを閉じます。 + +: active? + HTTP セッションが開始されていたら真。 + +: address + 接続するアドレス + +: port + 接続するポート番号 + +: open_timeout +: open_timeout=(n) + 接続時に待つ最大秒数。この秒数たってもコネクションが + 開かなければ例外 TimeoutError を発生します。 + +: read_timeout +: read_timeout=(n) + 読みこみ (read(1) 一回) でブロックしてよい最大秒数。 + この秒数たっても読みこめなければ例外 TimeoutError を発生します。 + +: finish + HTTP セッションを終了します。セッション開始前にこのメソッドが + 呼ばれた場合は例外 IOError を発生します。 + +: proxy? + プロクシを介して接続するなら真。 + +: proxy_address + プロクシ経由で接続する HTTP オブジェクトならプロクシのアドレス。 + そうでないなら nil。 + +: proxy_port + プロクシ経由で接続する HTTP オブジェクトならプロクシのポート。 + そうでないなら nil。 + +: get( path, header = nil, dest = '' ) +: get( path, header = nil ) {|str| .... } + サーバ上の path にあるエンティティを取得し、dest に << メソッドを + 使って書きこみます。また header が nil でなければリクエストを送る + ときにその内容を HTTP ヘッダとして書きこみます。header はハッシュで、 + 「ヘッダ名 => 内容」のような形式でなければいけません。 + + 返り値は、バージョン 1.1 では HTTPResponse と dest 二要素の配列です。 + 1.2 では HTTPResponse ただひとつのみです。 + + ブロックとともに呼ばれた時はエンティティボディを少しづつブロックに + 与えます。 + + 1.1 では 3xx (再試行可能なエラー)に対しても例外を発生します。この場合 + HTTPResponse は例外オブジェクトから err.response で得ることができます。 + 一方 1.2 では全く例外を発生しません。 + + # version 1.1 (bundled with Ruby 1.6) + response, body = http.get( '/index.html' ) + + # version 1.2 (bundled with Ruby 1.7 or later) + response = http.get( '/index.html' ) + + # compatible in both version + response , = http.get( '/index.html' ) + response.body + + # using block + File.open( 'save.txt', 'w' ) {|f| + http.get( '/~foo/', nil ) do |str| + f.write str + end + } + # same effect + File.open( 'save.txt', 'w' ) {|f| + http.get '/~foo/', nil, f + } + +: head( path, header = nil ) + サーバ上の path にあるエンティティのヘッダのみを取得します。 + また header が nil でなければリクエストを送るときにその内容を + HTTP ヘッダとして書きこみます。header はハッシュで、 + 「ヘッダ名 => 内容」のような形式でなければいけません。 + + HTTPResponse オブジェクトを返します。 + + 1.1 では 3xx (再試行可能なエラー)に対しても例外を発生します。この場合 + HTTPResponse は例外オブジェクトから err.response で得ることができます。 + 一方 1.2 では全く例外を発生しません。 + + response = nil + Net::HTTP.start( 'some.www.server', 80 ) {|http| + response = http.head( '/index.html' ) + } + p response['content-type'] + +: post( path, data, header = nil, dest = '' ) +: post( path, data, header = nil ) {|str| .... } + サーバ上の path にあるエンティティに対し文字列 data を + 送ります。レスポンスは << メソッドを使って dest に書き + こまれます。header は get メソッドと同じです。 + HTTPResponse オブジェクトと dest の配列を返します。 + + イテレータとして呼びだされたときはエンティティボディを少しづつ + ブロックに与えます。 + + 1.1 では 3xx (再試行可能なエラー)に対しても例外を発生します。この場合 + HTTPResponse は例外オブジェクトから err.response で得ることができます。 + 一方 1.2 では全く例外を発生しません。 + + # version 1.1 + response, body = http.post( '/cgi-bin/search.rb', 'querytype=subject&target=ruby' ) + # version 1.2 + response = http.post( '/cgi-bin/search.rb', 'querytype=subject&target=ruby' ) + # compatible for both version + response , = http.post( '/cgi-bin/search.rb', 'querytype=subject&target=ruby' ) + + # using block + File.open( 'save.html', 'w' ) {|f| + http.post( '/cgi-bin/search.rb', 'querytype=subject&target=ruby' ) do |str| + f.write str + end + } + # same effect + File.open( 'save.html', 'w' ) {|f| + http.post '/cgi-bin/search.rb', 'querytype=subject&target=ruby', nil, f + } + +: get2( path, header = nil ) +: get2( path, header = nil ) {|response| .... } + path にあるエンティティを取得します。HTTPResponse + オブジェクトを返します。 + + ブロックとともに呼び出されたときは、ブロック実行中は接続を + 維持したまま HTTPResponse オブジェクトをブロックに渡します。 + + このメソッドはステータスに関らず例外を発生させません。 + + # example + response = http.get2( '/index.html' ) + p response['content-type'] + puts response.body # body is already read + + # using block + http.get2( '/index.html' ) {|response| + p response['content-type'] + response.read_body do |str| # read body now + print str + end + } + +: post2( path, header = nil ) +: post2( path, header = nil ) {|response| .... } + path にあるエンティティを取得します。HTTPResponse + オブジェクトを返します。 + + ブロックとともに呼び出されたときは、ボディを読みこむ前に + HTTPResponse オブジェクトをブロックに渡します。 + + このメソッドはステータスに関らず例外を発生させません。 + + # example + response = http.post2( '/cgi-bin/nice.rb', 'datadatadata...' ) + p response.status + puts response.body # body is already read + + # using block + http.post2( '/cgi-bin/nice.rb', 'datadatadata...' ) {|response| + p response.status + p response['content-type'] + response.read_body do |str| # read body now + print str + end + } + +: request( request [, data] ) +: request( request [, data] ) {|response| .... } + リクエストオブジェクト request を送信します。POST の時は data も + 与えられます。(POST 以外で data を与えると ArgumentError を発生します) + + ブロックとともに呼びだされたときはボディを読みこまずに HTTPResponse + オブジェクトをブロックに与えます。 + +== class Net::HTTP::Get, Head, Post + +HTTP リクエストを抽象化するクラス。key はすべて大文字小文字を +区別しません。 + +=== クラスメソッド + +: new + HTTP リクエストオブジェクトを生成します。 + +=== メソッド + +: self[ key ] + key ヘッダフィールドの文字列。 + key は大文字小文字を区別しません。 + +: self[ key ] = val + key ヘッダフィールドに val をセットします。 + key は大文字小文字を区別しません。 + +: each {|name, val| .... } + ヘッダ名とその値に対するくりかえし。ヘッダ名は小文字で統一されます。 + +: basic_auth( account, password ) + Authrization: ヘッダを basic auth 用にセットします。 + +: range + Range: ヘッダの示す範囲を Range オブジェクトで返します。 + +: range = r +: set_range( i, len ) + 範囲を指定してエンティティを取得するためのヘッダ Range: をセットします。 + r は Range オブジェクト、i, len は始点と長さです。 + +: content_length + Content-Length: ヘッダの値 (整数)。 + +: content_range + Content-Range: ヘッダの値 (Range)。 + +== class Net::HTTPResponse + +HTTP レスポンスのクラスです。 +引数がヘッダフィールド名である場合、大文字小文字を区別しません。 + +=== メソッド + +: self[ key ] + key ヘッダフィールド(文字列)です。たとえばキー 'content-length' + に対しては '2048' のような文字列が得られます。 + key は大文字小文字を区別しません。 + +: self[ key ] = val + key ヘッダフィールドを value に設定します。 + key は大文字小文字を区別しません。 + +: key?( key ) + key というヘッダフィールドがあれば真。 + key は大文字小文字を区別しません。 + +: each {|name,value| .... } + すべてのヘッダフィールド名とその値のペアに対するくりかえし。 + +: canonical_each {|name,value| .... } + ヘッダフィールドの正式名とその値のペアに対して繰り返します。 + +: code + HTTP のリザルトコードです。例えば '302' などです。 + +: message + HTTP サーバがリザルトコードに付加して返すメッセージです。 + 例えば 'Not Found' などです。 + +: read_body( dest = '' ) + エンティティボディを取得し dest に << メソッドを使って書きこみます。 + 同じ HTTPResponse オブジェクトに対して二回以上呼ばれた場合、 + 二回目からはなにもせずに一回目の返り値をそのまま返します。 + +: read_body {|str| .... } + エンティティボディを少しづつ取得して順次ブロックに与えます。 + +: body + エンティティボディです。read_body を呼んでいればその引数 dest、 + 呼んでいなければエンティティボディを文字列として読みこんで返します。 + +=end diff --git a/doc/net/pop.rd.ja b/doc/net/pop.rd.ja new file mode 100644 index 0000000000..a810e1e92a --- /dev/null +++ b/doc/net/pop.rd.ja @@ -0,0 +1,284 @@ +=begin + += net/pop.rb version 1.2.3 + +== このライブラリについて + +メールを受信するためのプロトコル POP3 (Post Office Protocol version 3) を +を扱うライブラリです。POP3 の実装は [RFC1939] +((<URL:http://www.ietf.org/rfc/rfc1939.txt>)) に基いています。 + +== 使用例 + +=== メールの受信 + +メールを受信してファイル 'inbox/1' 'inbox/2'... に書きこみ、 +サーバ上からメールを消します。 +pop3.server.address は適宜読みかえてください。 + + require 'net/pop' + + Net::POP3.start( 'pop3.server.address', 110, + 'YourAccount', 'YourPassword' ) {|pop| + if pop.mails.empty? then + puts 'no mail.' + else + i = 0 + pop.each_mail do |m| # or "pop.mails.each ..." + File.open( 'inbox/' + i.to_s, 'w' ) {|f| + f.write m.pop + } + m.delete + i += 1 + end + end + puts "#{pop.mails.size} mails popped." + } + +=== 短くする + +以下は動作は同じでコードを短くしたバージョンです。 + + require 'net/pop' + Net::POP3.start( 'pop3.server.address', 110, + 'YourAccount', 'YourPassword' ) {|pop| + if pop.mails.empty? then + puts 'no mail.' + else + i = 0 + pop.delete_all do |m| + File.open( 'inbox/' + i.to_s, 'w' ) {|f| + f.write m.pop + } + i += 1 + end + end + } + +クラスメソッドの POP3.delete_all を使うとさらに短くなります。 + + require 'net/pop' + i = 0 + Net::POP3.delete_all( 'pop3.server.address', 110, + 'YourAccount', 'YourPassword' ) do |m| + File.open( 'inbox/' + i.to_s, 'w' ) {|f| + f.write m.pop + } + i += 1 + end + +=== ファイルに直接書く + +これまでの例では m.pop の部分でメールをひとつの文字列として +うけとっていましたが、たとえば 3MB くらいある巨大なメールの場合は +これではまずい場合があります。そのような場合は以下のように m.pop +に File オブジェクトを与える手が使えます。 + + require 'net/pop' + Net::POP3.delete_all( 'pop3.server.address', 110, + 'YourAccount', 'YourPassword' ) do |m| + File.open( 'inbox', 'w' ) {|f| + m.pop f #### + } + end + +=== APOP + +APOP 認証を使うには +(1) POP3 クラスのかわりに APOP クラスを使う +(2) POP3.start の第五引数に true を渡す +の二通りの方法があります。 + + # (1) + require 'net/pop' + Net::APOP.start( 'apop.server.address', 110, + 'YourAccount', 'YourPassword' ) {|pop| + # Rest code is same. + } + + # (2) + require 'net/pop' + Net::POP3.start( 'apop.server.address', 110, + 'YourAccount', 'YourPassword', + true #### + ) {|pop| + # Rest code is same. + } + +== Net::POP3 class + +=== クラスメソッド + +: new( address = 'localhost', port = 110, apop = false ) + Net::POP3 オブジェクトを生成します。まだ接続はしません。 + apop が真のときは APOP 認証を行うオブジェクトを生成します。 + +: start( address = 'localhost', port = 110, account, password ) +: start( address = 'localhost', port = 110, account, password ) {|pop| .... } + address の port 番ポートに接続し、アカウント account パスワード + password で POP ログインします。第二引数 port に nil を渡すと + POP3 のデフォルトポート(110)を使います。 + + Net::POP3.start( addr, port, account, password ) do |pop| + pop.each_mail do |m| + file.write m.pop + m.delete + end + end + +: foreach( address = 'localhost', port = 110, account, password ) {|mail| .... } + POP セッションを開き、サーバ上のすべてのメールに対して繰り返します。 + 以下と同じです。 + + Net::POP3.start( address, port, account, password ) {|pop| + pop.each_mail do |m| + yield m + end + } + + # example + Net::POP3.foreach( 'your.pop.server', 110, + 'YourAccount', 'YourPassword' ) do |m| + file.write m.pop + m.delete if $DELETE + end + +: delete_all( address = 'localhost', port = 110, account, password ) +: delete_all( address = 'localhost', port = 110, account, password ) {|mail| .... } + POP セッションを開き、サーバ上のメールをすべて削除します。 + ブロックが与えられた時は削除する前にブロックにそのメールを + 渡します。以下と同じです。 + + # example + Net::POP3.delete_all( addr, nil, 'YourAccount', 'YourPassword' ) do |m| + m.pop file + end + +: auth_only( address = 'localhost', port = 110, account, password ) + POP セッションを開き認証だけを行って接続を切ります。 + POP before SMTP 専用です。 + + # example + pop = Net::POP3.auth_only( 'your.pop3.server', + nil, # using default (110) + 'YourAccount', + 'YourPassword' ) + +=== メソッド + +: start( account, password ) +: start( account, password ) {|pop| .... } + リモートホストとの接続を開始し、アカウントに account、 + パスワードに password を使って POP ログインします。 + +: active? + POP3 セッションが開始されていたら真。 + +: address + 接続するアドレス + +: port + 接続するポート番号 + +: open_timeout +: open_timeout=(n) + 接続時に待つ最大秒数。この秒数たってもコネクションが + 開かなければ例外 TimeoutError を発生します。 + +: read_timeout +: read_timeout=(n) + 読みこみ (read(1) 一回) でブロックしてよい最大秒数。 + この秒数たっても読みこめなければ例外 TimeoutError を発生します。 + +: finish + POP3 セッションを終了します。セッション開始前にこのメソッドが + 呼ばれた場合は例外 IOError を発生します。 + +: mails + Net::POPMail オブジェクトの配列をかえします。 + この配列はセッションを開始したときに自動的に更新されます。 + +: each_mail {|popmail| .... } +: each {|popmail| .... } + pop3.mails.each と同じです。 + +: delete_all +: delete_all {|popmail| .... } + サーバ上のメールを全て消去します。 + ブロックを与えられたときは消去する前にその POPMail オブジェクトを + ブロックに渡します。 + + # example + n = 1 + pop.delete_all do |m| + File.open("inbox/#{n}") {|f| f.write m.pop } + n += 1 + end + +: auth_only( account, password ) + POP セッションを開き認証だけを行って接続を切ります。 + POP before SMTP 専用です。 + # example + pop = Net::POP3.new( 'your.pop3.server' ) + pop.auth_only 'YourAccount', 'YourPassword' + +: reset + セッションをリセットします。 + 具体的には POPMail#delete で消したメールが全て復活します。 + (POP3 ではメール一個だけを復活する方法はありません) + +== Net::APOP + +このクラスでは新しいメソッドは導入していません。 +認証方式が APOP に変わるだけです。 + +=== スーパークラス +Net::POP3 + +== Net::POPMail + +POP サーバー上のメール一通を抽象的に表現するクラス。 +メールの取得や消去といった操作をカプセル化します。 + +=== メソッド + +: pop( dest = '' ) + メールを受信して dest に << メソッドを使って書きこみます。 + dest を返します。 + + # example + allmails = nil + POP3.start( 'your.pop3.server', 110, + 'YourAccount, 'YourPassword' ) do |pop| + allmails = pop.mails.collect {|popmail| popmail.pop } + end + +: pop {|str| .... } + メールの文字列を少しづつ読みこみ、順次ブロックに与えます。 + + # example + POP3.start( 'localhost', 110 ) {|pop3| + pop3.each_mail do |m| + m.pop do |str| + # do anything + end + end + } + +: header + ヘッダだけを受信して文字列で返します。 + +: top( lines ) + メールヘッダと lines 行ぶんの本文を取得し文字列で返します。 + +: delete + サーバ上からメールを削除します。 + +: size + メールのサイズ (単位はバイト) をかえします。 + +: deleted? + メールがサーバ上で消去されているとき真。消去してしまったら + POP3#reset を使う以外に復活する方法はありません。 + +=end diff --git a/doc/net/smtp.rd.ja b/doc/net/smtp.rd.ja new file mode 100644 index 0000000000..16fa5d598d --- /dev/null +++ b/doc/net/smtp.rd.ja @@ -0,0 +1,163 @@ +=begin + += net/smtp.rb version 1.2.3 + +== このライブラリについて + +メールを送信するためのプロトコル SMTP (Simple Mail Transfer Protocol) +を扱うライブラリです。ヘッダなどメールのデータを扱うことはできません。 +SMTP の実装は [RFC2821] ((<URL:http://www.ietf.org/rfc/rfc2821.txt>)) +に基いています。 + +== 使用例 + +=== とにかくメールを送る + +SMTP を使ってメールを送るにはまず SMTP.start でセッションを開きます。 +第一引数がサーバのアドレスで第二引数がポート番号です。 +ブロックを使うと File.open と同じように終端処理を自動的にやってくれる +のでおすすめです。 + + require 'net/smtp' + Net::SMTP.start( 'your.smtp.server', 25 ) {|smtp| + # use smtp object only in this block + } + +your.smtp.server は適切な SMTP サーバのアドレスに読みかえてください。 +通常は LAN の管理者やプロバイダが SMTP サーバを用意してくれているはずです。 + +セッションが開いたらあとは send_mail でメールを流しこむだけです。 + + require 'net/smtp' + + Net::SMTP.start( 'your.smtp.server', 25 ) {|smtp| + smtp.send_mail <<EndOfMail, 'your@mail.address', 'to@some.domain' + From: Your Name <your@mail.address> + To: Dest Address <to@some.domain> + Subject: test mail + Date: Sat, 23 Jun 2001 16:26:43 +0900 + Message-Id: <unique.message.id.string@some.domain> + + This is test mail. + EndOfMail + } + +=== 文字列以外からの送信 + +ひとつ上の例では文字列リテラル(ヒアドキュメント)を使って送信しましたが、 +each メソッドを持ったオブジェクトからならなんでも送ることができます。 +以下は File オブジェクトから直接送信する例です。 + + require 'net/smtp' + Net::SMTP.start( 'your.smtp.server', 25 ) {|smtp| + File.open( 'Mail/draft/1' ) {|f| + smtp.send_mail f, 'your@mail.address', 'to@some.domain' + } + } + +=== Hello ドメイン + +SMTP ではメールを送る側のホストの名前を要求されるのですが、 +ダイヤルアップなどの場合には自分のマシンに正式な名前がない場合が +あります。そのような場合は適宜 SMTP サーバの名前などを与えてやら +ないと配送を拒否されることがあります。SMTP.start あるいは SMTP#start +の引数 helo_domain がそれです。 + + Net::SMTP.start( 'your.smtp.server', 25, + 'mail.from.domain' ) {|smtp| + + +== class Net::SMTP + +=== クラスメソッド + +: new( address = 'localhost', port = 25 ) + 新しい SMTP オブジェクトを生成します。address はSMTPサーバーのFQDNで、 + port は接続するポート番号です。ただし、このメソッドではまだ接続はしません。 + +: start( address = 'localhost', port = 25, helo_domain = Socket.gethostname, account = nil, password = nil, authtype = nil ) +: start( address = 'localhost', port = 25, helo_domain = Socket.gethostname, account = nil, password = nil, authtype = nil ) {|smtp| .... } + 以下と同じです。 + Net::SMTP.new(address,port).start(helo_domain,account,password,authtype) + + # example + Net::SMTP.start( 'your.smtp.server' ) { + smtp.send_mail mail_string, 'from@mail.address', 'dest@mail.address' + } + +=== メソッド + +: start( helo_domain = <local host name>, account = nil, password = nil, authtype = nil ) +: start( helo_domain = <local host name>, account = nil, password = nil, authtype = nil ) {|smtp| .... } + TCP コネクションを張り、同時に SMTP セッションを開始します。そのとき、 + こちらのホストの FQDN を helo_domain に指定します。 + もしすでにセッションが開始していたら IOError を発生します。 + + account と password の両方が与えられた場合、AUTH コマンドによって + 認証を行います。authtype は使用する認証のタイプで、シンボル + で :plain か :cram_md5 を指定します。 + +: active? + SMTP セッションが開始されていたら真。 + +: address + 接続するアドレス + +: port + 接続するポート番号 + +: open_timeout +: open_timeout=(n) + 接続時に待つ最大秒数。この秒数たってもコネクションが + 開かなければ例外 TimeoutError を発生します。 + +: read_timeout +: read_timeout=(n) + 読みこみ (read(1) 一回) でブロックしてよい最大秒数。 + この秒数たっても読みこめなければ例外 TimeoutError を発生します。 + +: finish + SMTP セッションを終了します。セッション開始前にこのメソッドが + 呼ばれた場合は例外 IOError を発生します。 + +: send_mail( mailsrc, from_addr, *to_addrs ) + mailsrc をメールとして送信します。mailsrc は each イテレータを持つ + オブジェクトならなんでも構いません (たとえば String や File)。 + from_domain は送り主のメールアドレス ('...@...'のかたちのもの) で、 + to_addrs には送信先メールアドレスを並べます。 + + # example + Net::SMTP.start( 'your.smtp.server' ) {|smtp| + smtp.send_mail mail_string, + 'from@mail.address', + 'dest@mail.address' 'dest2@mail.address' + } + +: ready( from_addr, *to_addrs ) {|adapter| .... } + メール書きこみの準備をしたうえで、write メソッドを持つオブジェクトを + ブロックにあたえます。from_addr は送信元メールアドレスで to_addrs は + 宛先のメールボックスです。 + + # example + Net::SMTP.start( 'your.smtp.server', 25 ) {|smtp| + smtp.ready( 'from@mail.addr', 'dest@mail.addr' ) do |adapter| + adapter.write str1 + adapter.write str2 + adapter.write str3 + end + } + +== 発生する例外 + +セッション中に (SMTP レベルの) エラーがおこった場合、 +以下の例外が発生します。 +: Net::ProtoSyntaxError + SMTP コマンドの構文ミス(500番台) +: Net::ProtoFatalError + 恒久的なエラー(550番台) +: Net::ProtoUnknownError + 予期しないエラー。おそらくバグ +: Net::ProtoServerBusy + 一時的なエラー(420/450番台) + +=end diff --git a/ext/digest/.cvsignore b/ext/digest/.cvsignore new file mode 100644 index 0000000000..fc802ff1c2 --- /dev/null +++ b/ext/digest/.cvsignore @@ -0,0 +1,2 @@ +Makefile +mkmf.log diff --git a/ext/digest/digest.c b/ext/digest/digest.c new file mode 100644 index 0000000000..f737d254ab --- /dev/null +++ b/ext/digest/digest.c @@ -0,0 +1,331 @@ +/************************************************ + + digest.c - + + $Author$ + created at: Fri May 25 08:57:27 JST 2001 + + Copyright (C) 1995-2001 Yukihiro Matsumoto + Copyright (C) 2001 Akinori MUSHA + + $RoughId: digest.c,v 1.16 2001/07/13 15:38:27 knu Exp $ + $Id$ + +************************************************/ + +/* + * This module provides an interface to the following hash algorithms: + * + * - the MD5 Message-Digest Algorithm by the RSA Data Security, + * Inc., described in RFC 1321 + * + * - the SHA-1 Secure Hash Algorithm by NIST (the US' National + * Institute of Standards and Technology), described in FIPS PUB + * 180-1. + * + * - the SHA-256/384/512 Secure Hash Algorithm by NIST (the US' + * National Institute of Standards and Technology), described in + * FIPS PUB 180-2. + * + * - the RIPEMD-160 cryptographic hash function, designed by Hans + * Dobbertin, Antoon Bosselaers, and Bart Preneel. + */ + +#include "digest.h" + +static VALUE mDigest, cDigest_Base; +static ID id_metadata; + +/* + * Digest::Base + */ + +static algo_t * +get_digest_base_metadata(class) + VALUE class; +{ + VALUE obj; + algo_t *algo; + + if (rb_cvar_defined(class, id_metadata) == Qfalse) + rb_notimplement(); + + obj = rb_cvar_get(class, id_metadata); + + Data_Get_Struct(obj, algo_t, algo); + + return algo; +} + +static VALUE +rb_digest_base_s_new(argc, argv, class) + int argc; + VALUE* argv; + VALUE class; +{ + algo_t *algo; + VALUE obj; + void *pctx; + + if (class == cDigest_Base) + rb_raise(rb_eNotImpError, "Digest::Base is an abstract class"); + + algo = get_digest_base_metadata(class); + + pctx = xmalloc(algo->ctx_size); + algo->init_func(pctx); + + obj = Data_Wrap_Struct(class, 0, free, pctx); + + rb_obj_call_init(obj, argc, argv); + + return obj; +} + +static VALUE +rb_digest_base_s_digest(class, str) + VALUE class; + VALUE str; +{ + algo_t *algo; + void *pctx; + size_t len; + unsigned char *digest; + VALUE obj; + + if (class == cDigest_Base) + rb_raise(rb_eNotImpError, "Digest::Base is an abstract class"); + + algo = get_digest_base_metadata(class); + + pctx = xmalloc(algo->ctx_size); + algo->init_func(pctx); + algo->update_func(pctx, RSTRING(str)->ptr, RSTRING(str)->len); + + len = algo->digest_len; + + digest = xmalloc(len); + algo->final_func(digest, pctx); + + obj = rb_str_new(digest, len); + + free(digest); + free(pctx); + + return obj; +} + +static VALUE +rb_digest_base_s_hexdigest(class, str) + VALUE class; + VALUE str; +{ + algo_t *algo; + void *pctx; + size_t len; + unsigned char *hexdigest; + VALUE obj; + + if (class == cDigest_Base) + rb_raise(rb_eNotImpError, "Digest::Base is an abstract class"); + + algo = get_digest_base_metadata(class); + + pctx = xmalloc(algo->ctx_size); + algo->init_func(pctx); + algo->update_func(pctx, RSTRING(str)->ptr, RSTRING(str)->len); + + len = algo->digest_len * 2; + + hexdigest = xmalloc(len + 1); /* +1 is for '\0' */ + algo->end_func(pctx, hexdigest); + puts(hexdigest); + obj = rb_str_new(hexdigest, len); + + free(hexdigest); + free(pctx); + + return obj; +} + +static VALUE +rb_digest_base_clone(self) + VALUE self; +{ + algo_t *algo; + void *pctx1, *pctx2; + VALUE class; + + class = CLASS_OF(self); + algo = get_digest_base_metadata(class); + Data_Get_Struct(self, void, pctx1); + + pctx2 = xmalloc(algo->ctx_size); + memcpy(pctx2, pctx1, algo->ctx_size); + + return Data_Wrap_Struct(class, 0, free, pctx2); +} + +static VALUE +rb_digest_base_update(self, str) + VALUE self, str; +{ + algo_t *algo; + void *pctx; + +#ifdef StringValue + StringValue(str); +#else + Check_Type(str, T_STRING); +#endif + + algo = get_digest_base_metadata(CLASS_OF(self)); + Data_Get_Struct(self, void, pctx); + + algo->update_func(pctx, RSTRING(str)->ptr, RSTRING(str)->len); + + return self; +} + +static VALUE +rb_digest_base_init(argc, argv, self) + int argc; + VALUE* argv; + VALUE self; +{ + VALUE arg; + + rb_scan_args(argc, argv, "01", &arg); + + if (!NIL_P(arg)) rb_digest_base_update(self, arg); + + return self; +} + +static VALUE +rb_digest_base_digest(self) + VALUE self; +{ + algo_t *algo; + void *pctx1, *pctx2; + unsigned char *digest; + size_t len; + VALUE str; + + algo = get_digest_base_metadata(CLASS_OF(self)); + Data_Get_Struct(self, void, pctx1); + + len = algo->ctx_size; + + pctx2 = xmalloc(len); + memcpy(pctx2, pctx1, len); + + len = algo->digest_len; + + digest = xmalloc(len); + algo->final_func(digest, pctx2); + + str = rb_str_new(digest, len); + + free(digest); + free(pctx2); + + return str; +} + +static VALUE +rb_digest_base_hexdigest(self) + VALUE self; +{ + algo_t *algo; + void *pctx1, *pctx2; + unsigned char *hexdigest; + size_t len; + VALUE str; + + algo = get_digest_base_metadata(CLASS_OF(self)); + Data_Get_Struct(self, void, pctx1); + + len = algo->ctx_size; + + pctx2 = xmalloc(len); + memcpy(pctx2, pctx1, len); + + len = algo->digest_len * 2; + + hexdigest = xmalloc(len + 1); /* +1 is for '\0' */ + algo->end_func(pctx2, hexdigest); + + str = rb_str_new(hexdigest, len); + + free(hexdigest); + free(pctx2); + + return str; +} + +static VALUE +rb_digest_base_equal(self, other) + VALUE self, other; +{ + algo_t *algo; + VALUE class; + VALUE str1, str2; + + class = CLASS_OF(self); + algo = get_digest_base_metadata(class); + + if (CLASS_OF(other) == class) { + void *pctx1, *pctx2; + + Data_Get_Struct(self, void, pctx1); + Data_Get_Struct(other, void, pctx2); + + return algo->equal_func(pctx1, pctx2) ? Qtrue : Qfalse; + } + +#ifdef StringValue + StringValue(other); +#else + Check_Type(other, T_STRING); +#endif + str2 = other; + + if (RSTRING(str2)->len == algo->digest_len) + str1 = rb_digest_base_digest(self); + else + str1 = rb_digest_base_hexdigest(self); + + if (RSTRING(str1)->len == RSTRING(str2)->len + && rb_str_cmp(str1, str2) == 0) + return Qtrue; + + return Qfalse; +} + +/* + * Init + */ + +void +Init_digest() +{ + mDigest = rb_define_module("Digest"); + + cDigest_Base = rb_define_class_under(mDigest, "Base", rb_cObject); + + rb_define_singleton_method(cDigest_Base, "new", rb_digest_base_s_new, -1); + rb_define_singleton_method(cDigest_Base, "digest", rb_digest_base_s_digest, 1); + rb_define_singleton_method(cDigest_Base, "hexdigest", rb_digest_base_s_hexdigest, 1); + + rb_define_method(cDigest_Base, "initialize", rb_digest_base_init, -1); + rb_define_method(cDigest_Base, "clone", rb_digest_base_clone, 0); + rb_define_method(cDigest_Base, "update", rb_digest_base_update, 1); + rb_define_method(cDigest_Base, "<<", rb_digest_base_update, 1); + rb_define_method(cDigest_Base, "digest", rb_digest_base_digest, 0); + rb_define_method(cDigest_Base, "hexdigest", rb_digest_base_hexdigest, 0); + rb_define_method(cDigest_Base, "to_s", rb_digest_base_hexdigest, 0); + rb_define_method(cDigest_Base, "==", rb_digest_base_equal, 1); + + id_metadata = rb_intern("metadata"); +} diff --git a/ext/digest/digest.h b/ext/digest/digest.h new file mode 100644 index 0000000000..5e846df040 --- /dev/null +++ b/ext/digest/digest.h @@ -0,0 +1,32 @@ +/************************************************ + + digest.c - + + $Author$ + created at: Fri May 25 08:54:56 JST 2001 + + + Copyright (C) 2001 Akinori MUSHA + + $RoughId: digest.h,v 1.3 2001/07/13 15:38:27 knu Exp $ + $Id$ + +************************************************/ + +#include "ruby.h" + +typedef void (*hash_init_func_t) _((void *)); +typedef void (*hash_update_func_t) _((void *, unsigned char *, size_t)); +typedef void (*hash_end_func_t) _((void *, unsigned char *)); +typedef void (*hash_final_func_t) _((unsigned char *, void *)); +typedef int (*hash_equal_func_t) _((void *, void *)); + +typedef struct { + size_t digest_len; + size_t ctx_size; + hash_init_func_t init_func; + hash_update_func_t update_func; + hash_end_func_t end_func; + hash_final_func_t final_func; + hash_equal_func_t equal_func; +} algo_t; diff --git a/ext/digest/digest.txt b/ext/digest/digest.txt new file mode 100644 index 0000000000..5797dd18f9 --- /dev/null +++ b/ext/digest/digest.txt @@ -0,0 +1,113 @@ +.\" digest.txt - -*- Indented-Text -*- created at: Fri May 25 08:13:50 JST 2001 +$RoughId: digest.txt,v 1.9 2001/07/13 19:46:51 knu Exp $ +$Id$ + +** MD5(Class) + +A class to implement the MD5 Message-Digest Algorithm by RSA Data +Security, Inc., described in RFC1321. + +Superclass: Digest::Base + +require 'digest/md5' + +** SHA1(Class) + +A class to implement the SHA-1 Secure Hash Algorithm by NIST (the US' +National Institute of Standards and Technology), described in FIPS PUB +180-1. + +Superclass: Digest::Base + +require 'digest/sha1' + +** SHA256(Class) +** SHA384(Class) +** SHA512(Class) + +Classes to implement the SHA-256/384/512 Secure Hash Algorithm(s) by +NIST (the US' National Institute of Standards and Technology), +described in FIPS PUB 180-2. + +Superclass: Digest::Base + +require 'digest/sha2' + +** RMD160(Class) + +A class to implement the RIPEMD-160 cryptographic hash function, +designed by Hans Dobbertin, Antoon Bosselaers, and Bart Preneel. + +Superclass: Digest::Base + +require 'digest/rmd160' + + +Those above classes provide a common interface as shown below. + + +Class Methods: + + new([str]) + + Creates a new digest object. If a string argument is given, + it is added to the object. (see update.) + + digest(str) + + Immediately calculates and return the hash of the given + strings as a string. Equivalent to new(str).digest. + + hexdigest(str) + + Immediately calculates and return the hash of the given + strings as a string of hexadecimal digits. Equivalent to + new(str).hexdigest. + +Methods: + + clone + + Creates a copy of the digest object. + + digest + + Returns the hash of the added strings as a string of 16 bytes + for MD5, 20 bytes for SHA1 and RMD160, 32 bytes for SHA256, 48 + bytes for SHA384, and 64 bytes for SHA512. + + hexdigest + to_s + + Returns the hash of the added strings as a string of 32 + hexadecimal digits for MD5, 40 hexadecimal digits for SHA1 and + RMD160, 64 hexadecimal digits for SHA256, 96 hexadecimal + digits for SHA384, and 128 hexadecimal digits for SHA512. + This method is equal to: + + def hexdigest + digest.unpack("H*")[0] + end + + update(str) + << str + + Appends the string str to the digest object. 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. + + == md + + Checks if the object is equal to the given digest object. + + == str + + Regards the value as either a digest value or a hexdigest + value (depending on the length) and checks if the object is + equal to the given string. + +------------------------------------------------------- +Local variables: +fill-column: 70 +end: diff --git a/ext/digest/extconf.rb b/ext/digest/extconf.rb new file mode 100644 index 0000000000..cd512622a4 --- /dev/null +++ b/ext/digest/extconf.rb @@ -0,0 +1,6 @@ +# $RoughId: extconf.rb,v 1.6 2001/07/13 15:38:27 knu Exp $ +# $Id$ + +require "mkmf" + +create_makefile("digest") diff --git a/ext/digest/lib/md5.rb b/ext/digest/lib/md5.rb new file mode 100644 index 0000000000..1d05d7d04e --- /dev/null +++ b/ext/digest/lib/md5.rb @@ -0,0 +1,14 @@ +# just for compatibility; requiring "md5" is obsoleted +# +# $RoughId: md5.rb,v 1.4 2001/07/13 15:38:27 knu Exp $ +# $Id$ + +require 'digest/md5' + +MD5 = Digest::MD5 + +class MD5 + def self.md5(*args) + new(*args) + end +end diff --git a/ext/digest/lib/sha1.rb b/ext/digest/lib/sha1.rb new file mode 100644 index 0000000000..c4ac6f66ea --- /dev/null +++ b/ext/digest/lib/sha1.rb @@ -0,0 +1,14 @@ +# just for compatibility; requiring "sha1" is obsoleted +# +# $RoughId: sha1.rb,v 1.4 2001/07/13 15:38:27 knu Exp $ +# $Id$ + +require 'digest/sha1' + +SHA1 = Digest::SHA1 + +class SHA1 + def self.sha1(*args) + new(*args) + end +end diff --git a/ext/digest/md5/.cvsignore b/ext/digest/md5/.cvsignore new file mode 100644 index 0000000000..fc802ff1c2 --- /dev/null +++ b/ext/digest/md5/.cvsignore @@ -0,0 +1,2 @@ +Makefile +mkmf.log diff --git a/ext/digest/md5/MANIFEST b/ext/digest/md5/MANIFEST new file mode 100644 index 0000000000..1b8a861b6b --- /dev/null +++ b/ext/digest/md5/MANIFEST @@ -0,0 +1,4 @@ +extconf.rb +md5.c +md5.h +md5init.c diff --git a/ext/digest/md5/md5.c b/ext/digest/md5/md5.c new file mode 100644 index 0000000000..6b61f031c4 --- /dev/null +++ b/ext/digest/md5/md5.c @@ -0,0 +1,432 @@ +/* + Copyright (C) 1999, 2000 Aladdin Enterprises. All rights reserved. + + This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. + + L. Peter Deutsch + ghost@aladdin.com + + */ + +/* + Independent implementation of MD5 (RFC 1321). + + This code implements the MD5 Algorithm defined in RFC 1321. + It is derived directly from the text of the RFC and not from the + reference implementation. + + The original and principal author of md5.c is L. Peter Deutsch + <ghost@aladdin.com>. Other authors are noted in the change history + that follows (in reverse chronological order): + + 2000-07-03 lpd Patched to eliminate warnings about "constant is + unsigned in ANSI C, signed in traditional"; + made test program self-checking. + 1999-11-04 lpd Edited comments slightly for automatic TOC extraction. + 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5). + 1999-05-03 lpd Original version. + */ + +/*$OrigId: md5c.c,v 1.2 2001/03/26 08:57:14 matz Exp $ */ +/*$RoughId: md5.c,v 1.2 2001/07/13 19:48:41 knu Exp $ */ +/*$Id$ */ + +#include "md5.h" + +#ifdef TEST +/* + * Compile with -DTEST to create a self-contained executable test program. + * The test program should print out the same values as given in section + * A.5 of RFC 1321, reproduced below. + */ +#include <string.h> +main() +{ + static const char *const test[7*2] = { + "", "d41d8cd98f00b204e9800998ecf8427e", + "a", "0cc175b9c0f1b6a831c399e269772661", + "abc", "900150983cd24fb0d6963f7d28e17f72", + "message digest", "f96b697d7cb7938d525a2f31aaf161d0", + "abcdefghijklmnopqrstuvwxyz", "c3fcd3d76192e4007dfb496cca67e13b", + "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789", + "d174ab98d277d9f5a5611c2c9f419d9f", + "12345678901234567890123456789012345678901234567890123456789012345678901234567890", "57edf4a22be3c955ac49da2e2107b67a" + }; + int i; + + for (i = 0; i < 7*2; i += 2) { + MD5_CTX state; + uint8_t digest[16]; + char hex_output[16*2 + 1]; + int di; + + MD5_Init(&state); + MD5_Update(&state, (const uint8_t *)test[i], strlen(test[i])); + MD5_Final(digest, &state); + printf("MD5 (\"%s\") = ", test[i]); + for (di = 0; di < 16; ++di) + sprintf(hex_output + di * 2, "%02x", digest[di]); + puts(hex_output); + if (strcmp(hex_output, test[i + 1])) + printf("**** ERROR, should be: %s\n", test[i + 1]); + } + return 0; +} +#endif /* TEST */ + + +/* + * For reference, here is the program that computed the T values. + */ +#ifdef COMPUTE_T_VALUES +#include <math.h> +main() +{ + int i; + for (i = 1; i <= 64; ++i) { + unsigned long v = (unsigned long)(4294967296.0 * fabs(sin((double)i))); + + /* + * The following nonsense is only to avoid compiler warnings about + * "integer constant is unsigned in ANSI C, signed with -traditional". + */ + if (v >> 31) { + printf("#define T%d /* 0x%08lx */ (T_MASK ^ 0x%08lx)\n", i, + v, (unsigned long)(unsigned int)(~v)); + } else { + printf("#define T%d 0x%08lx\n", i, v); + } + } + return 0; +} +#endif /* COMPUTE_T_VALUES */ +/* + * End of T computation program. + */ +#ifdef T_MASK +#undef T_MASK +#endif +#define T_MASK ((uint32_t)~0) +#define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87) +#define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9) +#define T3 0x242070db +#define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111) +#define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050) +#define T6 0x4787c62a +#define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec) +#define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe) +#define T9 0x698098d8 +#define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850) +#define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e) +#define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841) +#define T13 0x6b901122 +#define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c) +#define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71) +#define T16 0x49b40821 +#define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d) +#define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf) +#define T19 0x265e5a51 +#define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855) +#define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2) +#define T22 0x02441453 +#define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e) +#define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437) +#define T25 0x21e1cde6 +#define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829) +#define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278) +#define T28 0x455a14ed +#define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa) +#define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07) +#define T31 0x676f02d9 +#define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375) +#define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd) +#define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e) +#define T35 0x6d9d6122 +#define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3) +#define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb) +#define T38 0x4bdecfa9 +#define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f) +#define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f) +#define T41 0x289b7ec6 +#define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805) +#define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a) +#define T44 0x04881d05 +#define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6) +#define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a) +#define T47 0x1fa27cf8 +#define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a) +#define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb) +#define T50 0x432aff97 +#define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58) +#define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6) +#define T53 0x655b59c3 +#define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d) +#define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82) +#define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e) +#define T57 0x6fa87e4f +#define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f) +#define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb) +#define T60 0x4e0811a1 +#define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d) +#define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca) +#define T63 0x2ad7d2bb +#define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e) + + +static void +md5_process(MD5_CTX *pms, const uint8_t *data /*[64]*/) +{ + uint32_t + a = pms->state[0], b = pms->state[1], + c = pms->state[2], d = pms->state[3]; + uint32_t t; + +#ifdef WORDS_BIGENDIAN + + /* + * On big-endian machines, we must arrange the bytes in the right + * order. (This also works on machines of unknown byte order.) + */ + uint32_t X[16]; + const uint8_t *xp = data; + int i; + + for (i = 0; i < 16; ++i, xp += 4) + X[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24); + +#else + + /* + * On little-endian machines, we can process properly aligned data + * without copying it. + */ + uint32_t xbuf[16]; + const uint32_t *X; + + if (!((data - (const uint8_t *)0) & 3)) { + /* data are properly aligned */ + X = (const uint32_t *)data; + } else { + /* not aligned */ + memcpy(xbuf, data, 64); + X = xbuf; + } +#endif + +#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n)))) + + /* Round 1. */ + /* Let [abcd k s i] denote the operation + a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */ +#define F(x, y, z) (((x) & (y)) | (~(x) & (z))) +#define SET(a, b, c, d, k, s, Ti)\ + t = a + F(b,c,d) + X[k] + Ti;\ + a = ROTATE_LEFT(t, s) + b + /* Do the following 16 operations. */ + SET(a, b, c, d, 0, 7, T1); + SET(d, a, b, c, 1, 12, T2); + SET(c, d, a, b, 2, 17, T3); + SET(b, c, d, a, 3, 22, T4); + SET(a, b, c, d, 4, 7, T5); + SET(d, a, b, c, 5, 12, T6); + SET(c, d, a, b, 6, 17, T7); + SET(b, c, d, a, 7, 22, T8); + SET(a, b, c, d, 8, 7, T9); + SET(d, a, b, c, 9, 12, T10); + SET(c, d, a, b, 10, 17, T11); + SET(b, c, d, a, 11, 22, T12); + SET(a, b, c, d, 12, 7, T13); + SET(d, a, b, c, 13, 12, T14); + SET(c, d, a, b, 14, 17, T15); + SET(b, c, d, a, 15, 22, T16); +#undef SET + + /* Round 2. */ + /* Let [abcd k s i] denote the operation + a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */ +#define G(x, y, z) (((x) & (z)) | ((y) & ~(z))) +#define SET(a, b, c, d, k, s, Ti)\ + t = a + G(b,c,d) + X[k] + Ti;\ + a = ROTATE_LEFT(t, s) + b + /* Do the following 16 operations. */ + SET(a, b, c, d, 1, 5, T17); + SET(d, a, b, c, 6, 9, T18); + SET(c, d, a, b, 11, 14, T19); + SET(b, c, d, a, 0, 20, T20); + SET(a, b, c, d, 5, 5, T21); + SET(d, a, b, c, 10, 9, T22); + SET(c, d, a, b, 15, 14, T23); + SET(b, c, d, a, 4, 20, T24); + SET(a, b, c, d, 9, 5, T25); + SET(d, a, b, c, 14, 9, T26); + SET(c, d, a, b, 3, 14, T27); + SET(b, c, d, a, 8, 20, T28); + SET(a, b, c, d, 13, 5, T29); + SET(d, a, b, c, 2, 9, T30); + SET(c, d, a, b, 7, 14, T31); + SET(b, c, d, a, 12, 20, T32); +#undef SET + + /* Round 3. */ + /* Let [abcd k s t] denote the operation + a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */ +#define H(x, y, z) ((x) ^ (y) ^ (z)) +#define SET(a, b, c, d, k, s, Ti)\ + t = a + H(b,c,d) + X[k] + Ti;\ + a = ROTATE_LEFT(t, s) + b + /* Do the following 16 operations. */ + SET(a, b, c, d, 5, 4, T33); + SET(d, a, b, c, 8, 11, T34); + SET(c, d, a, b, 11, 16, T35); + SET(b, c, d, a, 14, 23, T36); + SET(a, b, c, d, 1, 4, T37); + SET(d, a, b, c, 4, 11, T38); + SET(c, d, a, b, 7, 16, T39); + SET(b, c, d, a, 10, 23, T40); + SET(a, b, c, d, 13, 4, T41); + SET(d, a, b, c, 0, 11, T42); + SET(c, d, a, b, 3, 16, T43); + SET(b, c, d, a, 6, 23, T44); + SET(a, b, c, d, 9, 4, T45); + SET(d, a, b, c, 12, 11, T46); + SET(c, d, a, b, 15, 16, T47); + SET(b, c, d, a, 2, 23, T48); +#undef SET + + /* Round 4. */ + /* Let [abcd k s t] denote the operation + a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */ +#define I(x, y, z) ((y) ^ ((x) | ~(z))) +#define SET(a, b, c, d, k, s, Ti)\ + t = a + I(b,c,d) + X[k] + Ti;\ + a = ROTATE_LEFT(t, s) + b + /* Do the following 16 operations. */ + SET(a, b, c, d, 0, 6, T49); + SET(d, a, b, c, 7, 10, T50); + SET(c, d, a, b, 14, 15, T51); + SET(b, c, d, a, 5, 21, T52); + SET(a, b, c, d, 12, 6, T53); + SET(d, a, b, c, 3, 10, T54); + SET(c, d, a, b, 10, 15, T55); + SET(b, c, d, a, 1, 21, T56); + SET(a, b, c, d, 8, 6, T57); + SET(d, a, b, c, 15, 10, T58); + SET(c, d, a, b, 6, 15, T59); + SET(b, c, d, a, 13, 21, T60); + SET(a, b, c, d, 4, 6, T61); + SET(d, a, b, c, 11, 10, T62); + SET(c, d, a, b, 2, 15, T63); + SET(b, c, d, a, 9, 21, T64); +#undef SET + + /* Then perform the following additions. (That is increment each + of the four registers by the value it had before this block + was started.) */ + pms->state[0] += a; + pms->state[1] += b; + pms->state[2] += c; + pms->state[3] += d; +} + +void +MD5_Init(MD5_CTX *pms) +{ + pms->count[0] = pms->count[1] = 0; + pms->state[0] = 0x67452301; + pms->state[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476; + pms->state[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301; + pms->state[3] = 0x10325476; +} + +void +MD5_Update(MD5_CTX *pms, const uint8_t *data, size_t nbytes) +{ + const uint8_t *p = data; + size_t left = nbytes; + size_t offset = (pms->count[0] >> 3) & 63; + uint32_t nbits = (uint32_t)(nbytes << 3); + + if (nbytes <= 0) + return; + + /* Update the message length. */ + pms->count[1] += nbytes >> 29; + pms->count[0] += nbits; + if (pms->count[0] < nbits) + pms->count[1]++; + + /* Process an initial partial block. */ + if (offset) { + size_t copy = (offset + nbytes > 64 ? 64 - offset : nbytes); + + memcpy(pms->buffer + offset, p, copy); + if (offset + copy < 64) + return; + p += copy; + left -= copy; + md5_process(pms, pms->buffer); + } + + /* Process full blocks. */ + for (; left >= 64; p += 64, left -= 64) + md5_process(pms, p); + + /* Process a final partial block. */ + if (left) + memcpy(pms->buffer, p, left); +} + +void +MD5_Final(uint8_t *digest, MD5_CTX *pms) +{ + static const uint8_t pad[64] = { + 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 + }; + uint8_t data[8]; + size_t i; + + /* Save the length before padding. */ + for (i = 0; i < 8; ++i) + data[i] = (uint8_t)(pms->count[i >> 2] >> ((i & 3) << 3)); + /* Pad to 56 bytes mod 64. */ + MD5_Update(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1); + /* Append the length. */ + MD5_Update(pms, data, 8); + for (i = 0; i < 16; ++i) + digest[i] = (uint8_t)(pms->state[i >> 2] >> ((i & 3) << 3)); +} + +void +MD5_End(MD5_CTX *pctx, uint8_t *hexdigest) +{ + unsigned char digest[16]; + size_t i; + + MD5_Final(digest, pctx); + + for (i = 0; i < 16; i++) + sprintf(hexdigest + i * 2, "%02x", digest[i]); +} + +int MD5_Equal(MD5_CTX* pctx1, MD5_CTX* pctx2) { + return memcmp(pctx1->count, pctx2->count, sizeof(pctx1->count)) == 0 + && memcmp(pctx1->state, pctx2->state, sizeof(pctx1->state)) == 0 + && memcmp(pctx1->buffer, pctx2->buffer, sizeof(pctx1->buffer)) == 0; +} diff --git a/ext/digest/md5/md5.h b/ext/digest/md5/md5.h new file mode 100644 index 0000000000..4b1f00b3ec --- /dev/null +++ b/ext/digest/md5/md5.h @@ -0,0 +1,75 @@ +/* + Copyright (C) 1999 Aladdin Enterprises. All rights reserved. + + This software is provided 'as-is', without any express or implied + warranty. In no event will the authors be held liable for any damages + arising from the use of this software. + + Permission is granted to anyone to use this software for any purpose, + including commercial applications, and to alter it and redistribute it + freely, subject to the following restrictions: + + 1. The origin of this software must not be misrepresented; you must not + claim that you wrote the original software. If you use this software + in a product, an acknowledgment in the product documentation would be + appreciated but is not required. + 2. Altered source versions must be plainly marked as such, and must not be + misrepresented as being the original software. + 3. This notice may not be removed or altered from any source distribution. + + L. Peter Deutsch + ghost@aladdin.com + + */ +/* + Independent implementation of MD5 (RFC 1321). + + This code implements the MD5 Algorithm defined in RFC 1321. + It is derived directly from the text of the RFC and not from the + reference implementation. + + The original and principal author of md5.h is L. Peter Deutsch + <ghost@aladdin.com>. Other authors are noted in the change history + that follows (in reverse chronological order): + + 1999-11-04 lpd Edited comments slightly for automatic TOC extraction. + 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5); + added conditionalization for C++ compilation from Martin + Purschke <purschke@bnl.gov>. + 1999-05-03 lpd Original version. + */ + +/* $OrigId: md5.h,v 1.2 2001/03/26 08:57:14 matz Exp $ */ +/* $RoughId: md5.h,v 1.2 2001/07/13 19:48:41 knu Exp $ */ +/* $Id$ */ + +#ifndef MD5_INCLUDED +# define MD5_INCLUDED + +#include "defs.h" + +/* + * This code has some adaptations for the Ghostscript environment, but it + * will compile and run correctly in any environment with 8-bit chars and + * 32-bit ints. Specifically, it assumes that if the following are + * defined, they have the same meaning as in Ghostscript: P1, P2, P3. + */ + +/* Define the state of the MD5 Algorithm. */ +typedef struct md5_state_s { + uint32_t count[2]; /* message length in bits, lsw first */ + uint32_t state[4]; /* digest buffer */ + uint8_t buffer[64]; /* accumulate block */ +} MD5_CTX; + +void MD5_Init _((MD5_CTX *pms)); +void MD5_Update _((MD5_CTX *pms, const uint8_t *data, size_t nbytes)); +void MD5_Final _((uint8_t *digest, MD5_CTX *pms)); +void MD5_End _((MD5_CTX *pctx, uint8_t *hexdigest)); +int MD5_Equal _((MD5_CTX *pctx1, MD5_CTX *pctx2)); + +#define MD5_BLOCK_LENGTH 64 +#define MD5_DIGEST_LENGTH 16 +#define MD5_DIGEST_STRING_LENGTH (MD5_DIGEST_LENGTH * 2 + 1) + +#endif /* MD5_INCLUDED */ diff --git a/ext/digest/md5/md5init.c b/ext/digest/md5/md5init.c new file mode 100644 index 0000000000..0f5b9b3543 --- /dev/null +++ b/ext/digest/md5/md5init.c @@ -0,0 +1,34 @@ +/* $RoughId: md5init.c,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +#include "digest.h" +#include "md5.h" + +static algo_t md5 = { + MD5_DIGEST_LENGTH, + sizeof(MD5_CTX), + (hash_init_func_t)MD5_Init, + (hash_update_func_t)MD5_Update, + (hash_end_func_t)MD5_End, + (hash_final_func_t)MD5_Final, + (hash_equal_func_t)MD5_Equal, +}; + +void +Init_md5() +{ + VALUE mDigest, cDigest_Base, cDigest_MD5; + ID id_metadata; + + rb_require("digest.so"); + + mDigest = rb_path2class("Digest"); + cDigest_Base = rb_path2class("Digest::Base"); + + cDigest_MD5 = rb_define_class_under(mDigest, "MD5", cDigest_Base); + + id_metadata = rb_intern("metadata"); + + rb_cvar_declare(cDigest_MD5, id_metadata, + Data_Wrap_Struct(rb_cObject, 0, 0, &md5)); +} diff --git a/ext/digest/rmd160/.cvsignore b/ext/digest/rmd160/.cvsignore new file mode 100644 index 0000000000..fc802ff1c2 --- /dev/null +++ b/ext/digest/rmd160/.cvsignore @@ -0,0 +1,2 @@ +Makefile +mkmf.log diff --git a/ext/digest/rmd160/MANIFEST b/ext/digest/rmd160/MANIFEST new file mode 100644 index 0000000000..ff16164ca7 --- /dev/null +++ b/ext/digest/rmd160/MANIFEST @@ -0,0 +1,5 @@ +extconf.rb +rmd160.c +rmd160.h +rmd160hl.c +rmd160init.c diff --git a/ext/digest/rmd160/rmd160.c b/ext/digest/rmd160/rmd160.c new file mode 100644 index 0000000000..2de3c99b29 --- /dev/null +++ b/ext/digest/rmd160/rmd160.c @@ -0,0 +1,464 @@ +/* $NetBSD: rmd160.c,v 1.1.1.1 2001/03/06 11:21:05 agc Exp $ */ +/* $RoughId: rmd160.c,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +/********************************************************************\ + * + * FILE: rmd160.c + * + * CONTENTS: A sample C-implementation of the RIPEMD-160 + * hash-function. + * TARGET: any computer with an ANSI C compiler + * + * AUTHOR: Antoon Bosselaers, ESAT-COSIC + * (Arranged for libc by Todd C. Miller) + * DATE: 1 March 1996 + * VERSION: 1.0 + * + * Copyright (c) Katholieke Universiteit Leuven + * 1996, All Rights Reserved + * +\********************************************************************/ + +#include "rmd160.h" + +#ifndef lint +/* __RCSID("$NetBSD: rmd160.c,v 1.1.1.1 2001/03/06 11:21:05 agc Exp $"); */ +#endif /* not lint */ + +/* header files */ + +#ifdef HAVE_SYS_ENDIAN_H_ +#include <sys/endian.h> +#endif + +#ifdef HAVE_MACHINE_ENDIAN_H_ +#include <machine/endian.h> +#endif + +/* #include "namespace.h" */ + +#include <assert.h> +#include <stdio.h> +#include <stdlib.h> +#include <string.h> + +#ifndef _DIAGASSERT +#define _DIAGASSERT(cond) assert(cond) +#endif + + +/********************************************************************/ + +/* macro definitions */ + +/* collect four bytes into one word: */ +#define BYTES_TO_DWORD(strptr) \ + (((uint32_t) *((strptr)+3) << 24) | \ + ((uint32_t) *((strptr)+2) << 16) | \ + ((uint32_t) *((strptr)+1) << 8) | \ + ((uint32_t) *(strptr))) + +/* ROL(x, n) cyclically rotates x over n bits to the left */ +/* x must be of an unsigned 32 bits type and 0 <= n < 32. */ +#define ROL(x, n) (((x) << (n)) | ((x) >> (32-(n)))) + +/* the three basic functions F(), G() and H() */ +#define F(x, y, z) ((x) ^ (y) ^ (z)) +#define G(x, y, z) (((x) & (y)) | (~(x) & (z))) +#define H(x, y, z) (((x) | ~(y)) ^ (z)) +#define I(x, y, z) (((x) & (z)) | ((y) & ~(z))) +#define J(x, y, z) ((x) ^ ((y) | ~(z))) + +/* the eight basic operations FF() through III() */ +#define FF(a, b, c, d, e, x, s) { \ + (a) += F((b), (c), (d)) + (x); \ + (a) = ROL((a), (s)) + (e); \ + (c) = ROL((c), 10); \ +} +#define GG(a, b, c, d, e, x, s) { \ + (a) += G((b), (c), (d)) + (x) + 0x5a827999U; \ + (a) = ROL((a), (s)) + (e); \ + (c) = ROL((c), 10); \ +} +#define HH(a, b, c, d, e, x, s) { \ + (a) += H((b), (c), (d)) + (x) + 0x6ed9eba1U; \ + (a) = ROL((a), (s)) + (e); \ + (c) = ROL((c), 10); \ +} +#define II(a, b, c, d, e, x, s) { \ + (a) += I((b), (c), (d)) + (x) + 0x8f1bbcdcU; \ + (a) = ROL((a), (s)) + (e); \ + (c) = ROL((c), 10); \ +} +#define JJ(a, b, c, d, e, x, s) { \ + (a) += J((b), (c), (d)) + (x) + 0xa953fd4eU; \ + (a) = ROL((a), (s)) + (e); \ + (c) = ROL((c), 10); \ +} +#define FFF(a, b, c, d, e, x, s) { \ + (a) += F((b), (c), (d)) + (x); \ + (a) = ROL((a), (s)) + (e); \ + (c) = ROL((c), 10); \ +} +#define GGG(a, b, c, d, e, x, s) { \ + (a) += G((b), (c), (d)) + (x) + 0x7a6d76e9U; \ + (a) = ROL((a), (s)) + (e); \ + (c) = ROL((c), 10); \ +} +#define HHH(a, b, c, d, e, x, s) { \ + (a) += H((b), (c), (d)) + (x) + 0x6d703ef3U; \ + (a) = ROL((a), (s)) + (e); \ + (c) = ROL((c), 10); \ +} +#define III(a, b, c, d, e, x, s) { \ + (a) += I((b), (c), (d)) + (x) + 0x5c4dd124U; \ + (a) = ROL((a), (s)) + (e); \ + (c) = ROL((c), 10); \ +} +#define JJJ(a, b, c, d, e, x, s) { \ + (a) += J((b), (c), (d)) + (x) + 0x50a28be6U; \ + (a) = ROL((a), (s)) + (e); \ + (c) = ROL((c), 10); \ +} + +/********************************************************************/ + +void +RMD160_Init(RMD160_CTX *context) +{ + + _DIAGASSERT(context != NULL); + + /* ripemd-160 initialization constants */ + context->state[0] = 0x67452301U; + context->state[1] = 0xefcdab89U; + context->state[2] = 0x98badcfeU; + context->state[3] = 0x10325476U; + context->state[4] = 0xc3d2e1f0U; + context->length[0] = context->length[1] = 0; + context->buflen = 0; +} + +/********************************************************************/ + +void +RMD160_Transform(uint32_t state[5], const uint32_t block[16]) +{ + uint32_t aa, bb, cc, dd, ee; + uint32_t aaa, bbb, ccc, ddd, eee; + + _DIAGASSERT(state != NULL); + _DIAGASSERT(block != NULL); + + aa = aaa = state[0]; + bb = bbb = state[1]; + cc = ccc = state[2]; + dd = ddd = state[3]; + ee = eee = state[4]; + + /* round 1 */ + FF(aa, bb, cc, dd, ee, block[ 0], 11); + FF(ee, aa, bb, cc, dd, block[ 1], 14); + FF(dd, ee, aa, bb, cc, block[ 2], 15); + FF(cc, dd, ee, aa, bb, block[ 3], 12); + FF(bb, cc, dd, ee, aa, block[ 4], 5); + FF(aa, bb, cc, dd, ee, block[ 5], 8); + FF(ee, aa, bb, cc, dd, block[ 6], 7); + FF(dd, ee, aa, bb, cc, block[ 7], 9); + FF(cc, dd, ee, aa, bb, block[ 8], 11); + FF(bb, cc, dd, ee, aa, block[ 9], 13); + FF(aa, bb, cc, dd, ee, block[10], 14); + FF(ee, aa, bb, cc, dd, block[11], 15); + FF(dd, ee, aa, bb, cc, block[12], 6); + FF(cc, dd, ee, aa, bb, block[13], 7); + FF(bb, cc, dd, ee, aa, block[14], 9); + FF(aa, bb, cc, dd, ee, block[15], 8); + + /* round 2 */ + GG(ee, aa, bb, cc, dd, block[ 7], 7); + GG(dd, ee, aa, bb, cc, block[ 4], 6); + GG(cc, dd, ee, aa, bb, block[13], 8); + GG(bb, cc, dd, ee, aa, block[ 1], 13); + GG(aa, bb, cc, dd, ee, block[10], 11); + GG(ee, aa, bb, cc, dd, block[ 6], 9); + GG(dd, ee, aa, bb, cc, block[15], 7); + GG(cc, dd, ee, aa, bb, block[ 3], 15); + GG(bb, cc, dd, ee, aa, block[12], 7); + GG(aa, bb, cc, dd, ee, block[ 0], 12); + GG(ee, aa, bb, cc, dd, block[ 9], 15); + GG(dd, ee, aa, bb, cc, block[ 5], 9); + GG(cc, dd, ee, aa, bb, block[ 2], 11); + GG(bb, cc, dd, ee, aa, block[14], 7); + GG(aa, bb, cc, dd, ee, block[11], 13); + GG(ee, aa, bb, cc, dd, block[ 8], 12); + + /* round 3 */ + HH(dd, ee, aa, bb, cc, block[ 3], 11); + HH(cc, dd, ee, aa, bb, block[10], 13); + HH(bb, cc, dd, ee, aa, block[14], 6); + HH(aa, bb, cc, dd, ee, block[ 4], 7); + HH(ee, aa, bb, cc, dd, block[ 9], 14); + HH(dd, ee, aa, bb, cc, block[15], 9); + HH(cc, dd, ee, aa, bb, block[ 8], 13); + HH(bb, cc, dd, ee, aa, block[ 1], 15); + HH(aa, bb, cc, dd, ee, block[ 2], 14); + HH(ee, aa, bb, cc, dd, block[ 7], 8); + HH(dd, ee, aa, bb, cc, block[ 0], 13); + HH(cc, dd, ee, aa, bb, block[ 6], 6); + HH(bb, cc, dd, ee, aa, block[13], 5); + HH(aa, bb, cc, dd, ee, block[11], 12); + HH(ee, aa, bb, cc, dd, block[ 5], 7); + HH(dd, ee, aa, bb, cc, block[12], 5); + + /* round 4 */ + II(cc, dd, ee, aa, bb, block[ 1], 11); + II(bb, cc, dd, ee, aa, block[ 9], 12); + II(aa, bb, cc, dd, ee, block[11], 14); + II(ee, aa, bb, cc, dd, block[10], 15); + II(dd, ee, aa, bb, cc, block[ 0], 14); + II(cc, dd, ee, aa, bb, block[ 8], 15); + II(bb, cc, dd, ee, aa, block[12], 9); + II(aa, bb, cc, dd, ee, block[ 4], 8); + II(ee, aa, bb, cc, dd, block[13], 9); + II(dd, ee, aa, bb, cc, block[ 3], 14); + II(cc, dd, ee, aa, bb, block[ 7], 5); + II(bb, cc, dd, ee, aa, block[15], 6); + II(aa, bb, cc, dd, ee, block[14], 8); + II(ee, aa, bb, cc, dd, block[ 5], 6); + II(dd, ee, aa, bb, cc, block[ 6], 5); + II(cc, dd, ee, aa, bb, block[ 2], 12); + + /* round 5 */ + JJ(bb, cc, dd, ee, aa, block[ 4], 9); + JJ(aa, bb, cc, dd, ee, block[ 0], 15); + JJ(ee, aa, bb, cc, dd, block[ 5], 5); + JJ(dd, ee, aa, bb, cc, block[ 9], 11); + JJ(cc, dd, ee, aa, bb, block[ 7], 6); + JJ(bb, cc, dd, ee, aa, block[12], 8); + JJ(aa, bb, cc, dd, ee, block[ 2], 13); + JJ(ee, aa, bb, cc, dd, block[10], 12); + JJ(dd, ee, aa, bb, cc, block[14], 5); + JJ(cc, dd, ee, aa, bb, block[ 1], 12); + JJ(bb, cc, dd, ee, aa, block[ 3], 13); + JJ(aa, bb, cc, dd, ee, block[ 8], 14); + JJ(ee, aa, bb, cc, dd, block[11], 11); + JJ(dd, ee, aa, bb, cc, block[ 6], 8); + JJ(cc, dd, ee, aa, bb, block[15], 5); + JJ(bb, cc, dd, ee, aa, block[13], 6); + + /* parallel round 1 */ + JJJ(aaa, bbb, ccc, ddd, eee, block[ 5], 8); + JJJ(eee, aaa, bbb, ccc, ddd, block[14], 9); + JJJ(ddd, eee, aaa, bbb, ccc, block[ 7], 9); + JJJ(ccc, ddd, eee, aaa, bbb, block[ 0], 11); + JJJ(bbb, ccc, ddd, eee, aaa, block[ 9], 13); + JJJ(aaa, bbb, ccc, ddd, eee, block[ 2], 15); + JJJ(eee, aaa, bbb, ccc, ddd, block[11], 15); + JJJ(ddd, eee, aaa, bbb, ccc, block[ 4], 5); + JJJ(ccc, ddd, eee, aaa, bbb, block[13], 7); + JJJ(bbb, ccc, ddd, eee, aaa, block[ 6], 7); + JJJ(aaa, bbb, ccc, ddd, eee, block[15], 8); + JJJ(eee, aaa, bbb, ccc, ddd, block[ 8], 11); + JJJ(ddd, eee, aaa, bbb, ccc, block[ 1], 14); + JJJ(ccc, ddd, eee, aaa, bbb, block[10], 14); + JJJ(bbb, ccc, ddd, eee, aaa, block[ 3], 12); + JJJ(aaa, bbb, ccc, ddd, eee, block[12], 6); + + /* parallel round 2 */ + III(eee, aaa, bbb, ccc, ddd, block[ 6], 9); + III(ddd, eee, aaa, bbb, ccc, block[11], 13); + III(ccc, ddd, eee, aaa, bbb, block[ 3], 15); + III(bbb, ccc, ddd, eee, aaa, block[ 7], 7); + III(aaa, bbb, ccc, ddd, eee, block[ 0], 12); + III(eee, aaa, bbb, ccc, ddd, block[13], 8); + III(ddd, eee, aaa, bbb, ccc, block[ 5], 9); + III(ccc, ddd, eee, aaa, bbb, block[10], 11); + III(bbb, ccc, ddd, eee, aaa, block[14], 7); + III(aaa, bbb, ccc, ddd, eee, block[15], 7); + III(eee, aaa, bbb, ccc, ddd, block[ 8], 12); + III(ddd, eee, aaa, bbb, ccc, block[12], 7); + III(ccc, ddd, eee, aaa, bbb, block[ 4], 6); + III(bbb, ccc, ddd, eee, aaa, block[ 9], 15); + III(aaa, bbb, ccc, ddd, eee, block[ 1], 13); + III(eee, aaa, bbb, ccc, ddd, block[ 2], 11); + + /* parallel round 3 */ + HHH(ddd, eee, aaa, bbb, ccc, block[15], 9); + HHH(ccc, ddd, eee, aaa, bbb, block[ 5], 7); + HHH(bbb, ccc, ddd, eee, aaa, block[ 1], 15); + HHH(aaa, bbb, ccc, ddd, eee, block[ 3], 11); + HHH(eee, aaa, bbb, ccc, ddd, block[ 7], 8); + HHH(ddd, eee, aaa, bbb, ccc, block[14], 6); + HHH(ccc, ddd, eee, aaa, bbb, block[ 6], 6); + HHH(bbb, ccc, ddd, eee, aaa, block[ 9], 14); + HHH(aaa, bbb, ccc, ddd, eee, block[11], 12); + HHH(eee, aaa, bbb, ccc, ddd, block[ 8], 13); + HHH(ddd, eee, aaa, bbb, ccc, block[12], 5); + HHH(ccc, ddd, eee, aaa, bbb, block[ 2], 14); + HHH(bbb, ccc, ddd, eee, aaa, block[10], 13); + HHH(aaa, bbb, ccc, ddd, eee, block[ 0], 13); + HHH(eee, aaa, bbb, ccc, ddd, block[ 4], 7); + HHH(ddd, eee, aaa, bbb, ccc, block[13], 5); + + /* parallel round 4 */ + GGG(ccc, ddd, eee, aaa, bbb, block[ 8], 15); + GGG(bbb, ccc, ddd, eee, aaa, block[ 6], 5); + GGG(aaa, bbb, ccc, ddd, eee, block[ 4], 8); + GGG(eee, aaa, bbb, ccc, ddd, block[ 1], 11); + GGG(ddd, eee, aaa, bbb, ccc, block[ 3], 14); + GGG(ccc, ddd, eee, aaa, bbb, block[11], 14); + GGG(bbb, ccc, ddd, eee, aaa, block[15], 6); + GGG(aaa, bbb, ccc, ddd, eee, block[ 0], 14); + GGG(eee, aaa, bbb, ccc, ddd, block[ 5], 6); + GGG(ddd, eee, aaa, bbb, ccc, block[12], 9); + GGG(ccc, ddd, eee, aaa, bbb, block[ 2], 12); + GGG(bbb, ccc, ddd, eee, aaa, block[13], 9); + GGG(aaa, bbb, ccc, ddd, eee, block[ 9], 12); + GGG(eee, aaa, bbb, ccc, ddd, block[ 7], 5); + GGG(ddd, eee, aaa, bbb, ccc, block[10], 15); + GGG(ccc, ddd, eee, aaa, bbb, block[14], 8); + + /* parallel round 5 */ + FFF(bbb, ccc, ddd, eee, aaa, block[12] , 8); + FFF(aaa, bbb, ccc, ddd, eee, block[15] , 5); + FFF(eee, aaa, bbb, ccc, ddd, block[10] , 12); + FFF(ddd, eee, aaa, bbb, ccc, block[ 4] , 9); + FFF(ccc, ddd, eee, aaa, bbb, block[ 1] , 12); + FFF(bbb, ccc, ddd, eee, aaa, block[ 5] , 5); + FFF(aaa, bbb, ccc, ddd, eee, block[ 8] , 14); + FFF(eee, aaa, bbb, ccc, ddd, block[ 7] , 6); + FFF(ddd, eee, aaa, bbb, ccc, block[ 6] , 8); + FFF(ccc, ddd, eee, aaa, bbb, block[ 2] , 13); + FFF(bbb, ccc, ddd, eee, aaa, block[13] , 6); + FFF(aaa, bbb, ccc, ddd, eee, block[14] , 5); + FFF(eee, aaa, bbb, ccc, ddd, block[ 0] , 15); + FFF(ddd, eee, aaa, bbb, ccc, block[ 3] , 13); + FFF(ccc, ddd, eee, aaa, bbb, block[ 9] , 11); + FFF(bbb, ccc, ddd, eee, aaa, block[11] , 11); + + /* combine results */ + ddd += cc + state[1]; /* final result for state[0] */ + state[1] = state[2] + dd + eee; + state[2] = state[3] + ee + aaa; + state[3] = state[4] + aa + bbb; + state[4] = state[0] + bb + ccc; + state[0] = ddd; +} + +/********************************************************************/ + +void +RMD160_Update(RMD160_CTX *context, const uint8_t *data, size_t nbytes) +{ + uint32_t X[16]; + uint32_t ofs = 0; + uint32_t i; +#ifdef WORDS_BIGENDIAN + uint32_t j; +#endif + + _DIAGASSERT(context != NULL); + _DIAGASSERT(data != NULL); + + /* update length[] */ + if (context->length[0] + nbytes < context->length[0]) + context->length[1]++; /* overflow to msb of length */ + context->length[0] += nbytes; + + (void)memset(X, 0, sizeof(X)); + + if ( context->buflen + nbytes < 64 ) + { + (void)memcpy(context->bbuffer + context->buflen, data, nbytes); + context->buflen += nbytes; + } + else + { + /* process first block */ + ofs = 64 - context->buflen; + (void)memcpy(context->bbuffer + context->buflen, data, ofs); +#ifndef WORDS_BIGENDIAN + (void)memcpy(X, context->bbuffer, sizeof(X)); +#else + for (j=0; j < 16; j++) + X[j] = BYTES_TO_DWORD(context->bbuffer + (4 * j)); +#endif + RMD160_Transform(context->state, X); + nbytes -= ofs; + + /* process remaining complete blocks */ + for (i = 0; i < (nbytes >> 6); i++) { +#ifndef WORDS_BIGENDIAN + (void)memcpy(X, data + (64 * i) + ofs, sizeof(X)); +#else + for (j=0; j < 16; j++) + X[j] = BYTES_TO_DWORD(data + (64 * i) + (4 * j) + ofs); +#endif + RMD160_Transform(context->state, X); + } + + /* + * Put last bytes from data into context's buffer + */ + context->buflen = nbytes & 63; + memcpy(context->bbuffer, data + (64 * i) + ofs, context->buflen); + } +} + +/********************************************************************/ + +void +RMD160_Final(uint8_t digest[20], RMD160_CTX *context) +{ + uint32_t i; + uint32_t X[16]; +#ifdef WORDS_BIGENDIAN + uint32_t j; +#endif + + _DIAGASSERT(digest != NULL); + _DIAGASSERT(context != NULL); + + /* append the bit m_n == 1 */ + context->bbuffer[context->buflen] = (uint8_t)'\200'; + + (void)memset(context->bbuffer + context->buflen + 1, 0, + 63 - context->buflen); +#ifndef WORDS_BIGENDIAN + (void)memcpy(X, context->bbuffer, sizeof(X)); +#else + for (j=0; j < 16; j++) + X[j] = BYTES_TO_DWORD(context->bbuffer + (4 * j)); +#endif + if ((context->buflen) > 55) { + /* length goes to next block */ + RMD160_Transform(context->state, X); + (void)memset(X, 0, sizeof(X)); + } + + /* append length in bits */ + X[14] = context->length[0] << 3; + X[15] = (context->length[0] >> 29) | + (context->length[1] << 3); + RMD160_Transform(context->state, X); + + if (digest != NULL) { + for (i = 0; i < 20; i += 4) { + /* extracts the 8 least significant bits. */ + digest[i] = context->state[i>>2]; + digest[i + 1] = (context->state[i>>2] >> 8); + digest[i + 2] = (context->state[i>>2] >> 16); + digest[i + 3] = (context->state[i>>2] >> 24); + } + } +} + +int RMD160_Equal(RMD160_CTX* pctx1, RMD160_CTX* pctx2) { + return pctx1->buflen == pctx2->buflen + && memcmp(pctx1->length, pctx2->length, sizeof(pctx1->length)) == 0 + && memcmp(pctx1->state, pctx2->state, sizeof(pctx1->state)) == 0 + && memcmp(pctx1->bbuffer, pctx2->bbuffer, sizeof(pctx1->bbuffer)) == 0; +} + +/************************ end of file rmd160.c **********************/ diff --git a/ext/digest/rmd160/rmd160.h b/ext/digest/rmd160/rmd160.h new file mode 100644 index 0000000000..53c1e0c1e0 --- /dev/null +++ b/ext/digest/rmd160/rmd160.h @@ -0,0 +1,55 @@ +/* $NetBSD: rmd160.h,v 1.2 2000/07/07 10:47:06 ad Exp $ */ +/* $RoughId: rmd160.h,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +/********************************************************************\ + * + * FILE: rmd160.h + * + * CONTENTS: Header file for a sample C-implementation of the + * RIPEMD-160 hash-function. + * TARGET: any computer with an ANSI C compiler + * + * AUTHOR: Antoon Bosselaers, ESAT-COSIC + * DATE: 1 March 1996 + * VERSION: 1.0 + * + * Copyright (c) Katholieke Universiteit Leuven + * 1996, All Rights Reserved + * +\********************************************************************/ + +/* + * from OpenBSD: rmd160.h,v 1.4 1999/08/16 09:59:04 millert Exp + */ + +#ifndef _RMD160_H_ +#define _RMD160_H_ + +#include "defs.h" + +typedef struct { + uint32_t state[5]; /* state (ABCDE) */ + uint32_t length[2]; /* number of bits */ + uint8_t bbuffer[64]; /* overflow buffer */ + uint32_t buflen; /* number of chars in bbuffer */ +} RMD160_CTX; + +__BEGIN_DECLS +void RMD160_Init _((RMD160_CTX *)); +void RMD160_Transform _((uint32_t[5], const uint32_t[16])); +void RMD160_Update _((RMD160_CTX *, const uint8_t *, size_t)); +void RMD160_Final _((uint8_t[20], RMD160_CTX *)); +int RMD160_Equal _((RMD160_CTX *, RMD160_CTX *)); +#ifndef _KERNEL +char *RMD160_End _((RMD160_CTX *, char *)); +char *RMD160_File _((char *, char *)); +char *RMD160_Data _((const uint8_t *, size_t, char *)); +#endif /* _KERNEL */ +__END_DECLS + +#define RMD160_BLOCK_LENGTH 64 +#define RMD160_DIGEST_LENGTH 20 +#define RMD160_DIGEST_STRING_LENGTH (RMD160_DIGEST_LENGTH * 2 + 1) + +#endif /* !_RMD160_H_ */ diff --git a/ext/digest/rmd160/rmd160hl.c b/ext/digest/rmd160/rmd160hl.c new file mode 100644 index 0000000000..4c5e0217d9 --- /dev/null +++ b/ext/digest/rmd160/rmd160hl.c @@ -0,0 +1,96 @@ +/* $NetBSD: rmd160hl.c,v 1.1.1.1 2001/03/06 11:21:05 agc Exp $ */ +/* $RoughId: rmd160hl.c,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +/* rmd160hl.c + * ---------------------------------------------------------------------------- + * "THE BEER-WARE LICENSE" (Revision 42): + * <phk@login.dkuug.dk> wrote this file. As long as you retain this notice you + * can do whatever you want with this stuff. If we meet some day, and you think + * this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp + * ---------------------------------------------------------------------------- + * + * from OpenBSD: rmd160hl.c,v 1.2 1999/08/17 09:13:12 millert Exp $ + */ + +#include "rmd160.h" + +#ifndef lint +/* __RCSID("$NetBSD: rmd160hl.c,v 1.1.1.1 2001/03/06 11:21:05 agc Exp $"); */ +#endif /* not lint */ + +/* #include "namespace.h" */ + +#include <assert.h> +#include <errno.h> +#include <fcntl.h> +#include <stdio.h> +#include <stdlib.h> +#if defined(HAVE_UNISTD_H) +# include <unistd.h> +#endif + +#ifndef _DIAGASSERT +#define _DIAGASSERT(cond) assert(cond) +#endif + + +char * +RMD160_End(RMD160_CTX *ctx, char *buf) +{ + size_t i; + char *p = buf; + uint8_t digest[20]; + static const char hex[]="0123456789abcdef"; + + _DIAGASSERT(ctx != NULL); + /* buf may be NULL */ + + if (p == NULL && (p = malloc(41)) == NULL) + return 0; + + RMD160_Final(digest,ctx); + for (i = 0; i < 20; i++) { + p[i + i] = hex[(uint32_t)digest[i] >> 4]; + p[i + i + 1] = hex[digest[i] & 0x0f]; + } + p[i + i] = '\0'; + return(p); +} + +char * +RMD160_File(char *filename, char *buf) +{ + uint8_t buffer[BUFSIZ]; + RMD160_CTX ctx; + int fd, num, oerrno; + + _DIAGASSERT(filename != NULL); + /* XXX: buf may be NULL ? */ + + RMD160_Init(&ctx); + + if ((fd = open(filename, O_RDONLY)) < 0) + return(0); + + while ((num = read(fd, buffer, sizeof(buffer))) > 0) + RMD160_Update(&ctx, buffer, (size_t)num); + + oerrno = errno; + close(fd); + errno = oerrno; + return(num < 0 ? 0 : RMD160_End(&ctx, buf)); +} + +char * +RMD160_Data(const uint8_t *data, size_t len, char *buf) +{ + RMD160_CTX ctx; + + _DIAGASSERT(data != NULL); + /* XXX: buf may be NULL ? */ + + RMD160_Init(&ctx); + RMD160_Update(&ctx, data, len); + return(RMD160_End(&ctx, buf)); +} diff --git a/ext/digest/rmd160/rmd160init.c b/ext/digest/rmd160/rmd160init.c new file mode 100644 index 0000000000..3cfe9e3df7 --- /dev/null +++ b/ext/digest/rmd160/rmd160init.c @@ -0,0 +1,34 @@ +/* $RoughId: rmd160init.c,v 1.3 2001/07/13 20:00:43 knu Exp $ */ +/* $Id$ */ + +#include "digest.h" +#include "rmd160.h" + +static algo_t rmd160 = { + RMD160_DIGEST_LENGTH, + sizeof(RMD160_CTX), + (hash_init_func_t)RMD160_Init, + (hash_update_func_t)RMD160_Update, + (hash_end_func_t)RMD160_End, + (hash_final_func_t)RMD160_Final, + (hash_equal_func_t)RMD160_Equal, +}; + +void +Init_rmd160() +{ + VALUE mDigest, cDigest_Base, cDigest_RMD160; + ID id_metadata; + + rb_require("digest.so"); + + mDigest = rb_path2class("Digest"); + cDigest_Base = rb_path2class("Digest::Base"); + + cDigest_RMD160 = rb_define_class_under(mDigest, "RMD160", cDigest_Base); + + id_metadata = rb_intern("metadata"); + + rb_cvar_declare(cDigest_RMD160, id_metadata, + Data_Wrap_Struct(rb_cObject, 0, 0, &rmd160)); +} diff --git a/ext/digest/sha1/.cvsignore b/ext/digest/sha1/.cvsignore new file mode 100644 index 0000000000..fc802ff1c2 --- /dev/null +++ b/ext/digest/sha1/.cvsignore @@ -0,0 +1,2 @@ +Makefile +mkmf.log diff --git a/ext/digest/sha1/MANIFEST b/ext/digest/sha1/MANIFEST new file mode 100644 index 0000000000..f08f240383 --- /dev/null +++ b/ext/digest/sha1/MANIFEST @@ -0,0 +1,5 @@ +extconf.rb +sha1.c +sha1.h +sha1hl.c +sha1init.c diff --git a/ext/digest/sha1/sha1.c b/ext/digest/sha1/sha1.c new file mode 100644 index 0000000000..1012ef8751 --- /dev/null +++ b/ext/digest/sha1/sha1.c @@ -0,0 +1,283 @@ +/* $NetBSD: sha1.c,v 1.2 2001/03/22 09:51:48 agc Exp $ */ +/* $OpenBSD: sha1.c,v 1.9 1997/07/23 21:12:32 kstailey Exp $ */ +/* $RoughId: sha1.c,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +/* + * 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 + */ + +#include "sha1.h" + +#define SHA1HANDSOFF /* Copies data before messing with it. */ + +#if defined(_KERNEL) || defined(_STANDALONE) +#include <sys/param.h> +#include <sys/systm.h> +#define _DIAGASSERT(x) (void)0 +#else +/* #include "namespace.h" */ +#include <assert.h> +#include <string.h> +#endif + +#ifndef _DIAGASSERT +#define _DIAGASSERT(cond) assert(cond) +#endif + +/* + * XXX Kludge until there is resolution regarding mem*() functions + * XXX in the kernel. + */ +#if defined(_KERNEL) || defined(_STANDALONE) +#define memcpy(s, d, l) bcopy((d), (s), (l)) +#endif + +#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 + */ +#ifndef WORDS_BIGENDIAN +# define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \ + |(rol(block->l[i],8)&0x00FF00FF)) +#else +# define blk0(i) block->l[i] +#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 (rounds) 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); + + +typedef union { + uint8_t c[64]; + uint32_t l[16]; +} CHAR64LONG16; + +#ifdef __sparc_v9__ +void do_R01(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *); +void do_R2(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *); +void do_R3(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *); +void do_R4(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *); + +#define nR0(v,w,x,y,z,i) R0(*v,*w,*x,*y,*z,i) +#define nR1(v,w,x,y,z,i) R1(*v,*w,*x,*y,*z,i) +#define nR2(v,w,x,y,z,i) R2(*v,*w,*x,*y,*z,i) +#define nR3(v,w,x,y,z,i) R3(*v,*w,*x,*y,*z,i) +#define nR4(v,w,x,y,z,i) R4(*v,*w,*x,*y,*z,i) + +void +do_R01(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *block) +{ + nR0(a,b,c,d,e, 0); nR0(e,a,b,c,d, 1); nR0(d,e,a,b,c, 2); nR0(c,d,e,a,b, 3); + nR0(b,c,d,e,a, 4); nR0(a,b,c,d,e, 5); nR0(e,a,b,c,d, 6); nR0(d,e,a,b,c, 7); + nR0(c,d,e,a,b, 8); nR0(b,c,d,e,a, 9); nR0(a,b,c,d,e,10); nR0(e,a,b,c,d,11); + nR0(d,e,a,b,c,12); nR0(c,d,e,a,b,13); nR0(b,c,d,e,a,14); nR0(a,b,c,d,e,15); + nR1(e,a,b,c,d,16); nR1(d,e,a,b,c,17); nR1(c,d,e,a,b,18); nR1(b,c,d,e,a,19); +} + +void +do_R2(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *block) +{ + nR2(a,b,c,d,e,20); nR2(e,a,b,c,d,21); nR2(d,e,a,b,c,22); nR2(c,d,e,a,b,23); + nR2(b,c,d,e,a,24); nR2(a,b,c,d,e,25); nR2(e,a,b,c,d,26); nR2(d,e,a,b,c,27); + nR2(c,d,e,a,b,28); nR2(b,c,d,e,a,29); nR2(a,b,c,d,e,30); nR2(e,a,b,c,d,31); + nR2(d,e,a,b,c,32); nR2(c,d,e,a,b,33); nR2(b,c,d,e,a,34); nR2(a,b,c,d,e,35); + nR2(e,a,b,c,d,36); nR2(d,e,a,b,c,37); nR2(c,d,e,a,b,38); nR2(b,c,d,e,a,39); +} + +void +do_R3(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *block) +{ + nR3(a,b,c,d,e,40); nR3(e,a,b,c,d,41); nR3(d,e,a,b,c,42); nR3(c,d,e,a,b,43); + nR3(b,c,d,e,a,44); nR3(a,b,c,d,e,45); nR3(e,a,b,c,d,46); nR3(d,e,a,b,c,47); + nR3(c,d,e,a,b,48); nR3(b,c,d,e,a,49); nR3(a,b,c,d,e,50); nR3(e,a,b,c,d,51); + nR3(d,e,a,b,c,52); nR3(c,d,e,a,b,53); nR3(b,c,d,e,a,54); nR3(a,b,c,d,e,55); + nR3(e,a,b,c,d,56); nR3(d,e,a,b,c,57); nR3(c,d,e,a,b,58); nR3(b,c,d,e,a,59); +} + +void +do_R4(uint32_t *a, uint32_t *b, uint32_t *c, uint32_t *d, uint32_t *e, CHAR64LONG16 *block) +{ + nR4(a,b,c,d,e,60); nR4(e,a,b,c,d,61); nR4(d,e,a,b,c,62); nR4(c,d,e,a,b,63); + nR4(b,c,d,e,a,64); nR4(a,b,c,d,e,65); nR4(e,a,b,c,d,66); nR4(d,e,a,b,c,67); + nR4(c,d,e,a,b,68); nR4(b,c,d,e,a,69); nR4(a,b,c,d,e,70); nR4(e,a,b,c,d,71); + nR4(d,e,a,b,c,72); nR4(c,d,e,a,b,73); nR4(b,c,d,e,a,74); nR4(a,b,c,d,e,75); + nR4(e,a,b,c,d,76); nR4(d,e,a,b,c,77); nR4(c,d,e,a,b,78); nR4(b,c,d,e,a,79); +} +#endif + +/* + * Hash a single 512-bit block. This is the core of the algorithm. + */ +void SHA1_Transform(state, buffer) + uint32_t state[5]; + const uint8_t buffer[64]; +{ + uint32_t a, b, c, d, e; + CHAR64LONG16 *block; + +#ifdef SHA1HANDSOFF + CHAR64LONG16 workspace; +#endif + + _DIAGASSERT(buffer != 0); + _DIAGASSERT(state != 0); + +#ifdef SHA1HANDSOFF + block = &workspace; + (void)memcpy(block, buffer, 64); +#else + block = (CHAR64LONG16 *)(void *)buffer; +#endif + + /* Copy context->state[] to working vars */ + a = state[0]; + b = state[1]; + c = state[2]; + d = state[3]; + e = state[4]; + +#ifdef __sparc_v9__ + do_R01(&a, &b, &c, &d, &e, block); + do_R2(&a, &b, &c, &d, &e, block); + do_R3(&a, &b, &c, &d, &e, block); + do_R4(&a, &b, &c, &d, &e, block); +#else + /* 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); +#endif + + /* 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; +} + + +/* + * SHA1_Init - Initialize new context + */ +void SHA1_Init(context) + SHA1_CTX *context; +{ + + _DIAGASSERT(context != 0); + + /* 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 SHA1_Update(context, data, len) + SHA1_CTX *context; + const uint8_t *data; + size_t len; +{ + uint32_t i, j; + + _DIAGASSERT(context != 0); + _DIAGASSERT(data != 0); + + j = context->count[0]; + if ((context->count[0] += len << 3) < j) + context->count[1] += (len>>29)+1; + j = (j >> 3) & 63; + if ((j + len) > 63) { + (void)memcpy(&context->buffer[j], data, (i = 64-j)); + SHA1_Transform(context->state, context->buffer); + for ( ; i + 63 < len; i += 64) + SHA1_Transform(context->state, &data[i]); + j = 0; + } else { + i = 0; + } + (void)memcpy(&context->buffer[j], &data[i], len - i); +} + + +/* + * Add padding and return the message digest. + */ +void SHA1_Final(digest, context) + uint8_t digest[20]; + SHA1_CTX* context; +{ + size_t i; + uint8_t finalcount[8]; + + _DIAGASSERT(digest != 0); + _DIAGASSERT(context != 0); + + for (i = 0; i < 8; i++) { + finalcount[i] = (uint8_t)((context->count[(i >= 4 ? 0 : 1)] + >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */ + } + SHA1_Update(context, (const uint8_t *)"\200", 1); + while ((context->count[0] & 504) != 448) + SHA1_Update(context, (const uint8_t *)"\0", 1); + SHA1_Update(context, finalcount, 8); /* Should cause a SHA1_Transform() */ + + if (digest) { + for (i = 0; i < 20; i++) + digest[i] = (uint8_t) + ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255); + } +} + +int SHA1_Equal(SHA1_CTX* pctx1, SHA1_CTX* pctx2) { + return memcmp(pctx1->count, pctx2->count, sizeof(pctx1->count)) == 0 + && memcmp(pctx1->state, pctx2->state, sizeof(pctx1->state)) == 0 + && memcmp(pctx1->buffer, pctx2->buffer, sizeof(pctx1->buffer)) == 0; +} diff --git a/ext/digest/sha1/sha1.h b/ext/digest/sha1/sha1.h new file mode 100644 index 0000000000..22e06d29b8 --- /dev/null +++ b/ext/digest/sha1/sha1.h @@ -0,0 +1,37 @@ +/* $NetBSD: sha1.h,v 1.2 1998/05/29 22:55:44 thorpej Exp $ */ +/* $RoughId: sha1.h,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +/* + * SHA-1 in C + * By Steve Reid <steve@edmweb.com> + * 100% Public Domain + */ + +#ifndef _SYS_SHA1_H_ +#define _SYS_SHA1_H_ + +#include "defs.h" + +typedef struct { + uint32_t state[5]; + uint32_t count[2]; + uint8_t buffer[64]; +} SHA1_CTX; + +void SHA1_Transform _((uint32_t state[5], const uint8_t buffer[64])); +void SHA1_Init _((SHA1_CTX *context)); +void SHA1_Update _((SHA1_CTX *context, const uint8_t *data, size_t len)); +void SHA1_Final _((uint8_t digest[20], SHA1_CTX *context)); +int SHA1_Equal _((SHA1_CTX *pctx1, SHA1_CTX *pctx2)); +#ifndef _KERNEL +char *SHA1_End _((SHA1_CTX *, char *)); +char *SHA1_File _((char *, char *)); +char *SHA1_Data _((const uint8_t *, size_t, char *)); +#endif /* _KERNEL */ + +#define SHA1_BLOCK_LENGTH 64 +#define SHA1_DIGEST_LENGTH 20 +#define SHA1_DIGEST_STRING_LENGTH (SHA1_DIGEST_LENGTH * 2 + 1) + +#endif /* _SYS_SHA1_H_ */ diff --git a/ext/digest/sha1/sha1hl.c b/ext/digest/sha1/sha1hl.c new file mode 100644 index 0000000000..d1a236b22c --- /dev/null +++ b/ext/digest/sha1/sha1hl.c @@ -0,0 +1,102 @@ +/* $NetBSD: sha1hl.c,v 1.2 2001/03/10 15:55:14 tron Exp $ */ +/* $RoughId: sha1hl.c,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +/* sha1hl.c + * ---------------------------------------------------------------------------- + * "THE BEER-WARE LICENSE" (Revision 42): + * <phk@login.dkuug.dk> wrote this file. As long as you retain this notice you + * can do whatever you want with this stuff. If we meet some day, and you think + * this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp + * ---------------------------------------------------------------------------- + */ + +/* #include "namespace.h" */ + +#include "sha1.h" +#include <fcntl.h> + +#include <assert.h> +#include <errno.h> +#include <stdio.h> +#include <stdlib.h> +#if defined(HAVE_UNISTD_H) +# include <unistd.h> +#endif + +#if defined(LIBC_SCCS) && !defined(lint) +/* __RCSID("$NetBSD: sha1hl.c,v 1.2 2001/03/10 15:55:14 tron Exp $"); */ +#endif /* LIBC_SCCS and not lint */ + +#ifndef _DIAGASSERT +#define _DIAGASSERT(cond) assert(cond) +#endif + + +/* ARGSUSED */ +char * +SHA1_End(ctx, buf) + SHA1_CTX *ctx; + char *buf; +{ + int i; + char *p = buf; + uint8_t digest[20]; + static const char hex[]="0123456789abcdef"; + + _DIAGASSERT(ctx != NULL); + /* buf may be NULL */ + + if (p == NULL && (p = malloc(41)) == NULL) + return 0; + + SHA1_Final(digest,ctx); + for (i = 0; i < 20; i++) { + p[i + i] = hex[((uint32_t)digest[i]) >> 4]; + p[i + i + 1] = hex[digest[i] & 0x0f]; + } + p[i + i] = '\0'; + return(p); +} + +char * +SHA1_File (filename, buf) + char *filename; + char *buf; +{ + uint8_t buffer[BUFSIZ]; + SHA1_CTX ctx; + int fd, num, oerrno; + + _DIAGASSERT(filename != NULL); + /* XXX: buf may be NULL ? */ + + SHA1_Init(&ctx); + + if ((fd = open(filename,O_RDONLY)) < 0) + return(0); + + while ((num = read(fd, buffer, sizeof(buffer))) > 0) + SHA1_Update(&ctx, buffer, (size_t)num); + + oerrno = errno; + close(fd); + errno = oerrno; + return(num < 0 ? 0 : SHA1_End(&ctx, buf)); +} + +char * +SHA1_Data (data, len, buf) + const uint8_t *data; + size_t len; + char *buf; +{ + SHA1_CTX ctx; + + _DIAGASSERT(data != NULL); + /* XXX: buf may be NULL ? */ + + SHA1_Init(&ctx); + SHA1_Update(&ctx, data, len); + return(SHA1_End(&ctx, buf)); +} diff --git a/ext/digest/sha1/sha1init.c b/ext/digest/sha1/sha1init.c new file mode 100644 index 0000000000..ecf4aeb198 --- /dev/null +++ b/ext/digest/sha1/sha1init.c @@ -0,0 +1,34 @@ +/* $RoughId: sha1init.c,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +#include "digest.h" +#include "sha1.h" + +static algo_t sha1 = { + SHA1_DIGEST_LENGTH, + sizeof(SHA1_CTX), + (hash_init_func_t)SHA1_Init, + (hash_update_func_t)SHA1_Update, + (hash_end_func_t)SHA1_End, + (hash_final_func_t)SHA1_Final, + (hash_equal_func_t)SHA1_Equal, +}; + +void +Init_sha1() +{ + VALUE mDigest, cDigest_Base, cDigest_SHA1; + ID id_metadata; + + rb_require("digest.so"); + + mDigest = rb_path2class("Digest"); + cDigest_Base = rb_path2class("Digest::Base"); + + cDigest_SHA1 = rb_define_class_under(mDigest, "SHA1", cDigest_Base); + + id_metadata = rb_intern("metadata"); + + rb_cvar_declare(cDigest_SHA1, id_metadata, + Data_Wrap_Struct(rb_cObject, 0, 0, &sha1)); +} diff --git a/ext/digest/sha2/.cvsignore b/ext/digest/sha2/.cvsignore new file mode 100644 index 0000000000..fc802ff1c2 --- /dev/null +++ b/ext/digest/sha2/.cvsignore @@ -0,0 +1,2 @@ +Makefile +mkmf.log diff --git a/ext/digest/sha2/MANIFEST b/ext/digest/sha2/MANIFEST new file mode 100644 index 0000000000..03fbb0fcda --- /dev/null +++ b/ext/digest/sha2/MANIFEST @@ -0,0 +1,5 @@ +extconf.rb +sha2.c +sha2.h +sha2hl.c +sha2init.c diff --git a/ext/digest/sha2/sha2.c b/ext/digest/sha2/sha2.c new file mode 100644 index 0000000000..a04534a831 --- /dev/null +++ b/ext/digest/sha2/sha2.c @@ -0,0 +1,937 @@ +/* + * sha2.c + * + * Version 1.0.0beta1 + * + * Written by Aaron D. Gifford <me@aarongifford.com> + * + * Copyright 2000 Aaron D. Gifford. All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * 1. Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * 2. Redistributions in binary form must reproduce the above copyright + * notice, this list of conditions and the following disclaimer in the + * documentation and/or other materials provided with the distribution. + * 3. Neither the name of the copyright holder nor the names of contributors + * may be used to endorse or promote products derived from this software + * without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTOR(S) ``AS IS'' AND + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE + * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTOR(S) BE LIABLE + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF + * SUCH DAMAGE. + * + */ + +/* $RoughId: sha2.c,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +#include <stdio.h> +#include <string.h> /* memcpy()/memset() or bcopy()/bzero() */ +#include <assert.h> /* assert() */ +#include "sha2.h" + +/* + * ASSERT NOTE: + * Some sanity checking code is included using assert(). On my FreeBSD + * system, this additional code can be removed by compiling with NDEBUG + * defined. Check your own systems manpage on assert() to see how to + * compile WITHOUT the sanity checking code on your system. + * + * UNROLLED TRANSFORM LOOP NOTE: + * You can define SHA2_UNROLL_TRANSFORM to use the unrolled transform + * loop version for the hash transform rounds (defined using macros + * later in this file). Either define on the command line, for example: + * + * cc -DSHA2_UNROLL_TRANSFORM -o sha2 sha2.c sha2prog.c + * + * or define below: + * + * #define SHA2_UNROLL_TRANSFORM + * + */ + + +/*** SHA-256/384/512 Machine Architecture Definitions *****************/ +typedef uint8_t sha2_byte; /* Exactly 1 byte */ +typedef uint32_t sha2_word32; /* Exactly 4 bytes */ +typedef uint64_t sha2_word64; /* Exactly 8 bytes */ + +#if defined(__GNUC__) +#define ULL(number) number##ULL +#else +#define ULL(number) (uint64_t)(number) +#endif + + +/*** SHA-256/384/512 Various Length Definitions ***********************/ +/* NOTE: Most of these are in sha2.h */ +#define SHA256_SHORT_BLOCK_LENGTH (SHA256_BLOCK_LENGTH - 8) +#define SHA384_SHORT_BLOCK_LENGTH (SHA384_BLOCK_LENGTH - 16) +#define SHA512_SHORT_BLOCK_LENGTH (SHA512_BLOCK_LENGTH - 16) + + +/*** ENDIAN REVERSAL MACROS *******************************************/ +#ifndef WORDS_BIGENDIAN +#define REVERSE32(w,x) { \ + sha2_word32 tmp = (w); \ + tmp = (tmp >> 16) | (tmp << 16); \ + (x) = ((tmp & 0xff00ff00UL) >> 8) | ((tmp & 0x00ff00ffUL) << 8); \ +} +#define REVERSE64(w,x) { \ + sha2_word64 tmp = (w); \ + tmp = (tmp >> 32) | (tmp << 32); \ + tmp = ((tmp & ULL(0xff00ff00ff00ff00)) >> 8) | \ + ((tmp & ULL(0x00ff00ff00ff00ff)) << 8); \ + (x) = ((tmp & ULL(0xffff0000ffff0000)) >> 16) | \ + ((tmp & ULL(0x0000ffff0000ffff)) << 16); \ +} +#endif + +/* + * Macro for incrementally adding the unsigned 64-bit integer n to the + * unsigned 128-bit integer (represented using a two-element array of + * 64-bit words): + */ +#define ADDINC128(w,n) { \ + (w)[0] += (sha2_word64)(n); \ + if ((w)[0] < (n)) { \ + (w)[1]++; \ + } \ +} + +/* + * Macros for copying blocks of memory and for zeroing out ranges + * of memory. Using these macros makes it easy to switch from + * using memset()/memcpy() and using bzero()/bcopy(). + * + * Please define either SHA2_USE_MEMSET_MEMCPY or define + * SHA2_USE_BZERO_BCOPY depending on which function set you + * choose to use: + */ +#if !defined(SHA2_USE_MEMSET_MEMCPY) && !defined(SHA2_USE_BZERO_BCOPY) +/* Default to memset()/memcpy() if no option is specified */ +#define SHA2_USE_MEMSET_MEMCPY 1 +#endif +#if defined(SHA2_USE_MEMSET_MEMCPY) && defined(SHA2_USE_BZERO_BCOPY) +/* Abort with an error if BOTH options are defined */ +#error Define either SHA2_USE_MEMSET_MEMCPY or SHA2_USE_BZERO_BCOPY, not both! +#endif + +#ifdef SHA2_USE_MEMSET_MEMCPY +#define MEMSET_BZERO(p,l) memset((p), 0, (l)) +#define MEMCPY_BCOPY(d,s,l) memcpy((d), (s), (l)) +#endif +#ifdef SHA2_USE_BZERO_BCOPY +#define MEMSET_BZERO(p,l) bzero((p), (l)) +#define MEMCPY_BCOPY(d,s,l) bcopy((s), (d), (l)) +#endif + + +/*** THE SIX LOGICAL FUNCTIONS ****************************************/ +/* + * Bit shifting and rotation (used by the six SHA-XYZ logical functions: + * + * NOTE: The naming of R and S appears backwards here (R is a SHIFT and + * S is a ROTATION) because the SHA-256/384/512 description document + * (see http://csrc.nist.gov/cryptval/shs/sha256-384-512.pdf) uses this + * same "backwards" definition. + */ +/* Shift-right (used in SHA-256, SHA-384, and SHA-512): */ +#define R(b,x) ((x) >> (b)) +/* 32-bit Rotate-right (used in SHA-256): */ +#define S32(b,x) (((x) >> (b)) | ((x) << (32 - (b)))) +/* 64-bit Rotate-right (used in SHA-384 and SHA-512): */ +#define S64(b,x) (((x) >> (b)) | ((x) << (64 - (b)))) + +/* Two of six logical functions used in SHA-256, SHA-384, and SHA-512: */ +#define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z))) +#define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z))) + +/* Four of six logical functions used in SHA-256: */ +#define Sigma0_256(x) (S32(2, (x)) ^ S32(13, (x)) ^ S32(22, (x))) +#define Sigma1_256(x) (S32(6, (x)) ^ S32(11, (x)) ^ S32(25, (x))) +#define sigma0_256(x) (S32(7, (x)) ^ S32(18, (x)) ^ R(3 , (x))) +#define sigma1_256(x) (S32(17, (x)) ^ S32(19, (x)) ^ R(10, (x))) + +/* Four of six logical functions used in SHA-384 and SHA-512: */ +#define Sigma0_512(x) (S64(28, (x)) ^ S64(34, (x)) ^ S64(39, (x))) +#define Sigma1_512(x) (S64(14, (x)) ^ S64(18, (x)) ^ S64(41, (x))) +#define sigma0_512(x) (S64( 1, (x)) ^ S64( 8, (x)) ^ R( 7, (x))) +#define sigma1_512(x) (S64(19, (x)) ^ S64(61, (x)) ^ R( 6, (x))) + +/*** INTERNAL FUNCTION PROTOTYPES *************************************/ +/* NOTE: These should not be accessed directly from outside this + * library -- they are intended for private internal visibility/use + * only. + */ +void SHA512_Last(SHA512_CTX*); +void SHA256_Transform(SHA256_CTX*, const sha2_word32*); +void SHA512_Transform(SHA512_CTX*, const sha2_word64*); + + +/*** SHA-XYZ INITIAL HASH VALUES AND CONSTANTS ************************/ +/* Hash constant words K for SHA-256: */ +const static sha2_word32 K256[64] = { + 0x428a2f98UL, 0x71374491UL, 0xb5c0fbcfUL, 0xe9b5dba5UL, + 0x3956c25bUL, 0x59f111f1UL, 0x923f82a4UL, 0xab1c5ed5UL, + 0xd807aa98UL, 0x12835b01UL, 0x243185beUL, 0x550c7dc3UL, + 0x72be5d74UL, 0x80deb1feUL, 0x9bdc06a7UL, 0xc19bf174UL, + 0xe49b69c1UL, 0xefbe4786UL, 0x0fc19dc6UL, 0x240ca1ccUL, + 0x2de92c6fUL, 0x4a7484aaUL, 0x5cb0a9dcUL, 0x76f988daUL, + 0x983e5152UL, 0xa831c66dUL, 0xb00327c8UL, 0xbf597fc7UL, + 0xc6e00bf3UL, 0xd5a79147UL, 0x06ca6351UL, 0x14292967UL, + 0x27b70a85UL, 0x2e1b2138UL, 0x4d2c6dfcUL, 0x53380d13UL, + 0x650a7354UL, 0x766a0abbUL, 0x81c2c92eUL, 0x92722c85UL, + 0xa2bfe8a1UL, 0xa81a664bUL, 0xc24b8b70UL, 0xc76c51a3UL, + 0xd192e819UL, 0xd6990624UL, 0xf40e3585UL, 0x106aa070UL, + 0x19a4c116UL, 0x1e376c08UL, 0x2748774cUL, 0x34b0bcb5UL, + 0x391c0cb3UL, 0x4ed8aa4aUL, 0x5b9cca4fUL, 0x682e6ff3UL, + 0x748f82eeUL, 0x78a5636fUL, 0x84c87814UL, 0x8cc70208UL, + 0x90befffaUL, 0xa4506cebUL, 0xbef9a3f7UL, 0xc67178f2UL +}; + +/* Initial hash value H for SHA-256: */ +const static sha2_word32 sha256_initial_hash_value[8] = { + 0x6a09e667UL, + 0xbb67ae85UL, + 0x3c6ef372UL, + 0xa54ff53aUL, + 0x510e527fUL, + 0x9b05688cUL, + 0x1f83d9abUL, + 0x5be0cd19UL +}; + +/* Hash constant words K for SHA-384 and SHA-512: */ +const static sha2_word64 K512[80] = { + ULL(0x428a2f98d728ae22), ULL(0x7137449123ef65cd), + ULL(0xb5c0fbcfec4d3b2f), ULL(0xe9b5dba58189dbbc), + ULL(0x3956c25bf348b538), ULL(0x59f111f1b605d019), + ULL(0x923f82a4af194f9b), ULL(0xab1c5ed5da6d8118), + ULL(0xd807aa98a3030242), ULL(0x12835b0145706fbe), + ULL(0x243185be4ee4b28c), ULL(0x550c7dc3d5ffb4e2), + ULL(0x72be5d74f27b896f), ULL(0x80deb1fe3b1696b1), + ULL(0x9bdc06a725c71235), ULL(0xc19bf174cf692694), + ULL(0xe49b69c19ef14ad2), ULL(0xefbe4786384f25e3), + ULL(0x0fc19dc68b8cd5b5), ULL(0x240ca1cc77ac9c65), + ULL(0x2de92c6f592b0275), ULL(0x4a7484aa6ea6e483), + ULL(0x5cb0a9dcbd41fbd4), ULL(0x76f988da831153b5), + ULL(0x983e5152ee66dfab), ULL(0xa831c66d2db43210), + ULL(0xb00327c898fb213f), ULL(0xbf597fc7beef0ee4), + ULL(0xc6e00bf33da88fc2), ULL(0xd5a79147930aa725), + ULL(0x06ca6351e003826f), ULL(0x142929670a0e6e70), + ULL(0x27b70a8546d22ffc), ULL(0x2e1b21385c26c926), + ULL(0x4d2c6dfc5ac42aed), ULL(0x53380d139d95b3df), + ULL(0x650a73548baf63de), ULL(0x766a0abb3c77b2a8), + ULL(0x81c2c92e47edaee6), ULL(0x92722c851482353b), + ULL(0xa2bfe8a14cf10364), ULL(0xa81a664bbc423001), + ULL(0xc24b8b70d0f89791), ULL(0xc76c51a30654be30), + ULL(0xd192e819d6ef5218), ULL(0xd69906245565a910), + ULL(0xf40e35855771202a), ULL(0x106aa07032bbd1b8), + ULL(0x19a4c116b8d2d0c8), ULL(0x1e376c085141ab53), + ULL(0x2748774cdf8eeb99), ULL(0x34b0bcb5e19b48a8), + ULL(0x391c0cb3c5c95a63), ULL(0x4ed8aa4ae3418acb), + ULL(0x5b9cca4f7763e373), ULL(0x682e6ff3d6b2b8a3), + ULL(0x748f82ee5defb2fc), ULL(0x78a5636f43172f60), + ULL(0x84c87814a1f0ab72), ULL(0x8cc702081a6439ec), + ULL(0x90befffa23631e28), ULL(0xa4506cebde82bde9), + ULL(0xbef9a3f7b2c67915), ULL(0xc67178f2e372532b), + ULL(0xca273eceea26619c), ULL(0xd186b8c721c0c207), + ULL(0xeada7dd6cde0eb1e), ULL(0xf57d4f7fee6ed178), + ULL(0x06f067aa72176fba), ULL(0x0a637dc5a2c898a6), + ULL(0x113f9804bef90dae), ULL(0x1b710b35131c471b), + ULL(0x28db77f523047d84), ULL(0x32caab7b40c72493), + ULL(0x3c9ebe0a15c9bebc), ULL(0x431d67c49c100d4c), + ULL(0x4cc5d4becb3e42b6), ULL(0x597f299cfc657e2a), + ULL(0x5fcb6fab3ad6faec), ULL(0x6c44198c4a475817) +}; + +/* Initial hash value H for SHA-384 */ +const static sha2_word64 sha384_initial_hash_value[8] = { + ULL(0xcbbb9d5dc1059ed8), + ULL(0x629a292a367cd507), + ULL(0x9159015a3070dd17), + ULL(0x152fecd8f70e5939), + ULL(0x67332667ffc00b31), + ULL(0x8eb44a8768581511), + ULL(0xdb0c2e0d64f98fa7), + ULL(0x47b5481dbefa4fa4) +}; + +/* Initial hash value H for SHA-512 */ +const static sha2_word64 sha512_initial_hash_value[8] = { + ULL(0x6a09e667f3bcc908), + ULL(0xbb67ae8584caa73b), + ULL(0x3c6ef372fe94f82b), + ULL(0xa54ff53a5f1d36f1), + ULL(0x510e527fade682d1), + ULL(0x9b05688c2b3e6c1f), + ULL(0x1f83d9abfb41bd6b), + ULL(0x5be0cd19137e2179) +}; + + +/*** SHA-256: *********************************************************/ +void SHA256_Init(SHA256_CTX* context) { + if (context == (SHA256_CTX*)0) { + return; + } + MEMCPY_BCOPY(context->state, sha256_initial_hash_value, SHA256_DIGEST_LENGTH); + MEMSET_BZERO(context->buffer, SHA256_BLOCK_LENGTH); + context->bitcount = 0; +} + +#ifdef SHA2_UNROLL_TRANSFORM + +/* Unrolled SHA-256 round macros: */ + +#ifndef WORDS_BIGENDIAN + +#define ROUND256_0_TO_15(a,b,c,d,e,f,g,h) \ + REVERSE32(*data++, W256[j]); \ + T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + \ + K256[j] + W256[j]; \ + (d) += T1; \ + (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \ + j++ + + +#else + +#define ROUND256_0_TO_15(a,b,c,d,e,f,g,h) \ + T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + \ + K256[j] + (W256[j] = *data++); \ + (d) += T1; \ + (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \ + j++ + +#endif + +#define ROUND256(a,b,c,d,e,f,g,h) \ + s0 = W256[(j+1)&0x0f]; \ + s0 = sigma0_256(s0); \ + s1 = W256[(j+14)&0x0f]; \ + s1 = sigma1_256(s1); \ + T1 = (h) + Sigma1_256(e) + Ch((e), (f), (g)) + K256[j] + \ + (W256[j&0x0f] += s1 + W256[(j+9)&0x0f] + s0); \ + (d) += T1; \ + (h) = T1 + Sigma0_256(a) + Maj((a), (b), (c)); \ + j++ + +void SHA256_Transform(SHA256_CTX* context, const sha2_word32* data) { + sha2_word32 a, b, c, d, e, f, g, h, s0, s1; + sha2_word32 T1, *W256; + int j; + + W256 = (sha2_word32*)context->buffer; + + /* Initialize registers with the prev. intermediate value */ + a = context->state[0]; + b = context->state[1]; + c = context->state[2]; + d = context->state[3]; + e = context->state[4]; + f = context->state[5]; + g = context->state[6]; + h = context->state[7]; + + j = 0; + do { + /* Rounds 0 to 15 (unrolled): */ + ROUND256_0_TO_15(a,b,c,d,e,f,g,h); + ROUND256_0_TO_15(h,a,b,c,d,e,f,g); + ROUND256_0_TO_15(g,h,a,b,c,d,e,f); + ROUND256_0_TO_15(f,g,h,a,b,c,d,e); + ROUND256_0_TO_15(e,f,g,h,a,b,c,d); + ROUND256_0_TO_15(d,e,f,g,h,a,b,c); + ROUND256_0_TO_15(c,d,e,f,g,h,a,b); + ROUND256_0_TO_15(b,c,d,e,f,g,h,a); + } while (j < 16); + + /* Now for the remaining rounds to 64: */ + do { + ROUND256(a,b,c,d,e,f,g,h); + ROUND256(h,a,b,c,d,e,f,g); + ROUND256(g,h,a,b,c,d,e,f); + ROUND256(f,g,h,a,b,c,d,e); + ROUND256(e,f,g,h,a,b,c,d); + ROUND256(d,e,f,g,h,a,b,c); + ROUND256(c,d,e,f,g,h,a,b); + ROUND256(b,c,d,e,f,g,h,a); + } while (j < 64); + + /* Compute the current intermediate hash value */ + context->state[0] += a; + context->state[1] += b; + context->state[2] += c; + context->state[3] += d; + context->state[4] += e; + context->state[5] += f; + context->state[6] += g; + context->state[7] += h; + + /* Clean up */ + a = b = c = d = e = f = g = h = T1 = 0; +} + +#else /* SHA2_UNROLL_TRANSFORM */ + +void SHA256_Transform(SHA256_CTX* context, const sha2_word32* data) { + sha2_word32 a, b, c, d, e, f, g, h, s0, s1; + sha2_word32 T1, T2, *W256; + int j; + + W256 = (sha2_word32*)context->buffer; + + /* Initialize registers with the prev. intermediate value */ + a = context->state[0]; + b = context->state[1]; + c = context->state[2]; + d = context->state[3]; + e = context->state[4]; + f = context->state[5]; + g = context->state[6]; + h = context->state[7]; + + j = 0; + do { +#ifndef WORDS_BIGENDIAN + /* Copy data while converting to host byte order */ + REVERSE32(*data++,W256[j]); + /* Apply the SHA-256 compression function to update a..h */ + T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + W256[j]; +#else + /* Apply the SHA-256 compression function to update a..h with copy */ + T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + (W256[j] = *data++); +#endif + T2 = Sigma0_256(a) + Maj(a, b, c); + h = g; + g = f; + f = e; + e = d + T1; + d = c; + c = b; + b = a; + a = T1 + T2; + + j++; + } while (j < 16); + + do { + /* Part of the message block expansion: */ + s0 = W256[(j+1)&0x0f]; + s0 = sigma0_256(s0); + s1 = W256[(j+14)&0x0f]; + s1 = sigma1_256(s1); + + /* Apply the SHA-256 compression function to update a..h */ + T1 = h + Sigma1_256(e) + Ch(e, f, g) + K256[j] + + (W256[j&0x0f] += s1 + W256[(j+9)&0x0f] + s0); + T2 = Sigma0_256(a) + Maj(a, b, c); + h = g; + g = f; + f = e; + e = d + T1; + d = c; + c = b; + b = a; + a = T1 + T2; + + j++; + } while (j < 64); + + /* Compute the current intermediate hash value */ + context->state[0] += a; + context->state[1] += b; + context->state[2] += c; + context->state[3] += d; + context->state[4] += e; + context->state[5] += f; + context->state[6] += g; + context->state[7] += h; + + /* Clean up */ + a = b = c = d = e = f = g = h = T1 = T2 = 0; +} + +#endif /* SHA2_UNROLL_TRANSFORM */ + +void SHA256_Update(SHA256_CTX* context, const sha2_byte *data, size_t len) { + unsigned int freespace, usedspace; + + if (len == 0) { + /* Calling with no data is valid - we do nothing */ + return; + } + + /* Sanity check: */ + assert(context != NULL && data != NULL); + + usedspace = (context->bitcount >> 3) % SHA256_BLOCK_LENGTH; + if (usedspace > 0) { + /* Calculate how much free space is available in the buffer */ + freespace = SHA256_BLOCK_LENGTH - usedspace; + + if (len >= freespace) { + /* Fill the buffer completely and process it */ + MEMCPY_BCOPY(&context->buffer[usedspace], data, freespace); + context->bitcount += freespace << 3; + len -= freespace; + data += freespace; + SHA256_Transform(context, (sha2_word32*)context->buffer); + } else { + /* The buffer is not yet full */ + MEMCPY_BCOPY(&context->buffer[usedspace], data, len); + context->bitcount += len << 3; + /* Clean up: */ + usedspace = freespace = 0; + return; + } + } + while (len >= SHA256_BLOCK_LENGTH) { + /* Process as many complete blocks as we can */ + SHA256_Transform(context, (const sha2_word32*)data); + context->bitcount += SHA256_BLOCK_LENGTH << 3; + len -= SHA256_BLOCK_LENGTH; + data += SHA256_BLOCK_LENGTH; + } + if (len > 0) { + /* There's left-overs, so save 'em */ + MEMCPY_BCOPY(context->buffer, data, len); + context->bitcount += len << 3; + } + /* Clean up: */ + usedspace = freespace = 0; +} + +void SHA256_Final(sha2_byte digest[], SHA256_CTX* context) { + sha2_word32 *d = (sha2_word32*)digest; + unsigned int usedspace; + + /* Sanity check: */ + assert(context != NULL); + + /* If no digest buffer is passed, we don't bother doing this: */ + if (digest != (sha2_byte*)0) { + usedspace = (context->bitcount >> 3) % SHA256_BLOCK_LENGTH; +#ifndef WORDS_BIGENDIAN + /* Convert FROM host byte order */ + REVERSE64(context->bitcount,context->bitcount); +#endif + if (usedspace > 0) { + /* Begin padding with a 1 bit: */ + context->buffer[usedspace++] = 0x80; + + if (usedspace < SHA256_SHORT_BLOCK_LENGTH) { + /* Set-up for the last transform: */ + MEMSET_BZERO(&context->buffer[usedspace], SHA256_SHORT_BLOCK_LENGTH - usedspace); + } else { + if (usedspace < SHA256_BLOCK_LENGTH) { + MEMSET_BZERO(&context->buffer[usedspace], SHA256_BLOCK_LENGTH - usedspace); + } + /* Do second-to-last transform: */ + SHA256_Transform(context, (sha2_word32*)context->buffer); + + /* And set-up for the last transform: */ + MEMSET_BZERO(context->buffer, SHA256_SHORT_BLOCK_LENGTH); + } + } else { + /* Set-up for the last transform: */ + MEMSET_BZERO(context->buffer, SHA256_SHORT_BLOCK_LENGTH); + + /* Begin padding with a 1 bit: */ + *context->buffer = 0x80; + } + /* Set the bit count: */ + *(sha2_word64*)&context->buffer[SHA256_SHORT_BLOCK_LENGTH] = context->bitcount; + + /* Final transform: */ + SHA256_Transform(context, (sha2_word32*)context->buffer); + +#ifndef WORDS_BIGENDIAN + { + /* Convert TO host byte order */ + int j; + for (j = 0; j < 8; j++) { + REVERSE32(context->state[j],context->state[j]); + *d++ = context->state[j]; + } + } +#else + MEMCPY_BCOPY(d, context->state, SHA256_DIGEST_LENGTH); +#endif + } + + /* Clean up state data: */ + MEMSET_BZERO(context, sizeof(SHA256_CTX)); + usedspace = 0; +} + +int SHA256_Equal(SHA256_CTX* pctx1, SHA256_CTX* pctx2) { + return pctx1->bitcount == pctx2->bitcount + && memcmp(pctx1->state, pctx2->state, sizeof(pctx1->state)) == 0 + && memcmp(pctx1->buffer, pctx2->buffer, sizeof(pctx1->buffer)) == 0; +} + +/*** SHA-512: *********************************************************/ +void SHA512_Init(SHA512_CTX* context) { + if (context == (SHA512_CTX*)0) { + return; + } + MEMCPY_BCOPY(context->state, sha512_initial_hash_value, SHA512_DIGEST_LENGTH); + MEMSET_BZERO(context->buffer, SHA512_BLOCK_LENGTH); + context->bitcount[0] = context->bitcount[1] = 0; +} + +#ifdef SHA2_UNROLL_TRANSFORM + +/* Unrolled SHA-512 round macros: */ +#ifndef WORDS_BIGENDIAN + +#define ROUND512_0_TO_15(a,b,c,d,e,f,g,h) \ + REVERSE64(*data++, W512[j]); \ + T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + \ + K512[j] + W512[j]; \ + (d) += T1, \ + (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)), \ + j++ + + +#else + +#define ROUND512_0_TO_15(a,b,c,d,e,f,g,h) \ + T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + \ + K512[j] + (W512[j] = *data++); \ + (d) += T1; \ + (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)); \ + j++ + +#endif + +#define ROUND512(a,b,c,d,e,f,g,h) \ + s0 = W512[(j+1)&0x0f]; \ + s0 = sigma0_512(s0); \ + s1 = W512[(j+14)&0x0f]; \ + s1 = sigma1_512(s1); \ + T1 = (h) + Sigma1_512(e) + Ch((e), (f), (g)) + K512[j] + \ + (W512[j&0x0f] += s1 + W512[(j+9)&0x0f] + s0); \ + (d) += T1; \ + (h) = T1 + Sigma0_512(a) + Maj((a), (b), (c)); \ + j++ + +void SHA512_Transform(SHA512_CTX* context, const sha2_word64* data) { + sha2_word64 a, b, c, d, e, f, g, h, s0, s1; + sha2_word64 T1, *W512 = (sha2_word64*)context->buffer; + int j; + + /* Initialize registers with the prev. intermediate value */ + a = context->state[0]; + b = context->state[1]; + c = context->state[2]; + d = context->state[3]; + e = context->state[4]; + f = context->state[5]; + g = context->state[6]; + h = context->state[7]; + + j = 0; + do { + ROUND512_0_TO_15(a,b,c,d,e,f,g,h); + ROUND512_0_TO_15(h,a,b,c,d,e,f,g); + ROUND512_0_TO_15(g,h,a,b,c,d,e,f); + ROUND512_0_TO_15(f,g,h,a,b,c,d,e); + ROUND512_0_TO_15(e,f,g,h,a,b,c,d); + ROUND512_0_TO_15(d,e,f,g,h,a,b,c); + ROUND512_0_TO_15(c,d,e,f,g,h,a,b); + ROUND512_0_TO_15(b,c,d,e,f,g,h,a); + } while (j < 16); + + /* Now for the remaining rounds up to 79: */ + do { + ROUND512(a,b,c,d,e,f,g,h); + ROUND512(h,a,b,c,d,e,f,g); + ROUND512(g,h,a,b,c,d,e,f); + ROUND512(f,g,h,a,b,c,d,e); + ROUND512(e,f,g,h,a,b,c,d); + ROUND512(d,e,f,g,h,a,b,c); + ROUND512(c,d,e,f,g,h,a,b); + ROUND512(b,c,d,e,f,g,h,a); + } while (j < 80); + + /* Compute the current intermediate hash value */ + context->state[0] += a; + context->state[1] += b; + context->state[2] += c; + context->state[3] += d; + context->state[4] += e; + context->state[5] += f; + context->state[6] += g; + context->state[7] += h; + + /* Clean up */ + a = b = c = d = e = f = g = h = T1 = 0; +} + +#else /* SHA2_UNROLL_TRANSFORM */ + +void SHA512_Transform(SHA512_CTX* context, const sha2_word64* data) { + sha2_word64 a, b, c, d, e, f, g, h, s0, s1; + sha2_word64 T1, T2, *W512 = (sha2_word64*)context->buffer; + int j; + + /* Initialize registers with the prev. intermediate value */ + a = context->state[0]; + b = context->state[1]; + c = context->state[2]; + d = context->state[3]; + e = context->state[4]; + f = context->state[5]; + g = context->state[6]; + h = context->state[7]; + + j = 0; + do { +#ifndef WORDS_BIGENDIAN + /* Convert TO host byte order */ + REVERSE64(*data++, W512[j]); + /* Apply the SHA-512 compression function to update a..h */ + T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + W512[j]; +#else + /* Apply the SHA-512 compression function to update a..h with copy */ + T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + (W512[j] = *data++); +#endif + T2 = Sigma0_512(a) + Maj(a, b, c); + h = g; + g = f; + f = e; + e = d + T1; + d = c; + c = b; + b = a; + a = T1 + T2; + + j++; + } while (j < 16); + + do { + /* Part of the message block expansion: */ + s0 = W512[(j+1)&0x0f]; + s0 = sigma0_512(s0); + s1 = W512[(j+14)&0x0f]; + s1 = sigma1_512(s1); + + /* Apply the SHA-512 compression function to update a..h */ + T1 = h + Sigma1_512(e) + Ch(e, f, g) + K512[j] + + (W512[j&0x0f] += s1 + W512[(j+9)&0x0f] + s0); + T2 = Sigma0_512(a) + Maj(a, b, c); + h = g; + g = f; + f = e; + e = d + T1; + d = c; + c = b; + b = a; + a = T1 + T2; + + j++; + } while (j < 80); + + /* Compute the current intermediate hash value */ + context->state[0] += a; + context->state[1] += b; + context->state[2] += c; + context->state[3] += d; + context->state[4] += e; + context->state[5] += f; + context->state[6] += g; + context->state[7] += h; + + /* Clean up */ + a = b = c = d = e = f = g = h = T1 = T2 = 0; +} + +#endif /* SHA2_UNROLL_TRANSFORM */ + +void SHA512_Update(SHA512_CTX* context, const sha2_byte *data, size_t len) { + unsigned int freespace, usedspace; + + if (len == 0) { + /* Calling with no data is valid - we do nothing */ + return; + } + + /* Sanity check: */ + assert(context != NULL && data != NULL); + + usedspace = (context->bitcount[0] >> 3) % SHA512_BLOCK_LENGTH; + if (usedspace > 0) { + /* Calculate how much free space is available in the buffer */ + freespace = SHA512_BLOCK_LENGTH - usedspace; + + if (len >= freespace) { + /* Fill the buffer completely and process it */ + MEMCPY_BCOPY(&context->buffer[usedspace], data, freespace); + ADDINC128(context->bitcount, freespace << 3); + len -= freespace; + data += freespace; + SHA512_Transform(context, (const sha2_word64*)context->buffer); + } else { + /* The buffer is not yet full */ + MEMCPY_BCOPY(&context->buffer[usedspace], data, len); + ADDINC128(context->bitcount, len << 3); + /* Clean up: */ + usedspace = freespace = 0; + return; + } + } + while (len >= SHA512_BLOCK_LENGTH) { + /* Process as many complete blocks as we can */ + SHA512_Transform(context, (const sha2_word64*)data); + ADDINC128(context->bitcount, SHA512_BLOCK_LENGTH << 3); + len -= SHA512_BLOCK_LENGTH; + data += SHA512_BLOCK_LENGTH; + } + if (len > 0) { + /* There's left-overs, so save 'em */ + MEMCPY_BCOPY(context->buffer, data, len); + ADDINC128(context->bitcount, len << 3); + } + /* Clean up: */ + usedspace = freespace = 0; +} + +void SHA512_Last(SHA512_CTX* context) { + unsigned int usedspace; + + usedspace = (context->bitcount[0] >> 3) % SHA512_BLOCK_LENGTH; +#ifndef WORDS_BIGENDIAN + /* Convert FROM host byte order */ + REVERSE64(context->bitcount[0],context->bitcount[0]); + REVERSE64(context->bitcount[1],context->bitcount[1]); +#endif + if (usedspace > 0) { + /* Begin padding with a 1 bit: */ + context->buffer[usedspace++] = 0x80; + + if (usedspace < SHA512_SHORT_BLOCK_LENGTH) { + /* Set-up for the last transform: */ + MEMSET_BZERO(&context->buffer[usedspace], SHA512_SHORT_BLOCK_LENGTH - usedspace); + } else { + if (usedspace < SHA512_BLOCK_LENGTH) { + MEMSET_BZERO(&context->buffer[usedspace], SHA512_BLOCK_LENGTH - usedspace); + } + /* Do second-to-last transform: */ + SHA512_Transform(context, (const sha2_word64*)context->buffer); + + /* And set-up for the last transform: */ + MEMSET_BZERO(context->buffer, SHA512_BLOCK_LENGTH - 2); + } + } else { + /* Prepare for final transform: */ + MEMSET_BZERO(context->buffer, SHA512_SHORT_BLOCK_LENGTH); + + /* Begin padding with a 1 bit: */ + *context->buffer = 0x80; + } + /* Store the length of input data (in bits): */ + *(sha2_word64*)&context->buffer[SHA512_SHORT_BLOCK_LENGTH] = context->bitcount[1]; + *(sha2_word64*)&context->buffer[SHA512_SHORT_BLOCK_LENGTH+8] = context->bitcount[0]; + + /* Final transform: */ + SHA512_Transform(context, (const sha2_word64*)context->buffer); +} + +void SHA512_Final(sha2_byte digest[], SHA512_CTX* context) { + sha2_word64 *d = (sha2_word64*)digest; + + /* Sanity check: */ + assert(context != NULL); + + /* If no digest buffer is passed, we don't bother doing this: */ + if (digest != (sha2_byte*)0) { + SHA512_Last(context); + + /* Save the hash data for output: */ +#ifndef WORDS_BIGENDIAN + { + /* Convert TO host byte order */ + int j; + for (j = 0; j < 8; j++) { + REVERSE64(context->state[j],context->state[j]); + *d++ = context->state[j]; + } + } +#else + MEMCPY_BCOPY(d, context->state, SHA512_DIGEST_LENGTH); +#endif + } + + /* Zero out state data */ + MEMSET_BZERO(context, sizeof(SHA512_CTX)); +} + +int SHA512_Equal(SHA512_CTX* pctx1, SHA512_CTX* pctx2) { + return memcmp(pctx1->bitcount, pctx2->bitcount, sizeof(pctx1->bitcount)) == 0 + && memcmp(pctx1->state, pctx2->state, sizeof(pctx1->state)) == 0 + && memcmp(pctx1->buffer, pctx2->buffer, sizeof(pctx1->buffer)) == 0; +} + +/*** SHA-384: *********************************************************/ +void SHA384_Init(SHA384_CTX* context) { + if (context == (SHA384_CTX*)0) { + return; + } + MEMCPY_BCOPY(context->state, sha384_initial_hash_value, SHA512_DIGEST_LENGTH); + MEMSET_BZERO(context->buffer, SHA384_BLOCK_LENGTH); + context->bitcount[0] = context->bitcount[1] = 0; +} + +void SHA384_Update(SHA384_CTX* context, const sha2_byte* data, size_t len) { + SHA512_Update((SHA512_CTX*)context, data, len); +} + +void SHA384_Final(sha2_byte digest[], SHA384_CTX* context) { + sha2_word64 *d = (sha2_word64*)digest; + + /* Sanity check: */ + assert(context != NULL); + + /* If no digest buffer is passed, we don't bother doing this: */ + if (digest != (sha2_byte*)0) { + SHA512_Last((SHA512_CTX*)context); + + /* Save the hash data for output: */ +#ifndef WORDS_BIGENDIAN + { + /* Convert TO host byte order */ + int j; + for (j = 0; j < 6; j++) { + REVERSE64(context->state[j],context->state[j]); + *d++ = context->state[j]; + } + } +#else + MEMCPY_BCOPY(d, context->state, SHA384_DIGEST_LENGTH); +#endif + } + + /* Zero out state data */ + MEMSET_BZERO(context, sizeof(SHA384_CTX)); +} + +int SHA384_Equal(SHA384_CTX* pctx1, SHA384_CTX* pctx2) { + return memcmp(pctx1->bitcount, pctx2->bitcount, sizeof(pctx1->bitcount)) == 0 + && memcmp(pctx1->state, pctx2->state, sizeof(pctx1->state)) == 0 + && memcmp(pctx1->buffer, pctx2->buffer, sizeof(pctx1->buffer)) == 0; +} diff --git a/ext/digest/sha2/sha2.h b/ext/digest/sha2/sha2.h new file mode 100644 index 0000000000..f5c7fd42aa --- /dev/null +++ b/ext/digest/sha2/sha2.h @@ -0,0 +1,107 @@ +/* + * sha2.h + * + * Version 1.0.0beta1 + * + * Written by Aaron D. Gifford <me@aarongifford.com> + * + * Copyright 2000 Aaron D. Gifford. All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * 1. Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * 2. Redistributions in binary form must reproduce the above copyright + * notice, this list of conditions and the following disclaimer in the + * documentation and/or other materials provided with the distribution. + * 3. Neither the name of the copyright holder nor the names of contributors + * may be used to endorse or promote products derived from this software + * without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTOR(S) ``AS IS'' AND + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE + * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTOR(S) BE LIABLE + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF + * SUCH DAMAGE. + * + */ + +/* $RoughId: sha2.h,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +#ifndef __SHA2_H__ +#define __SHA2_H__ + +#ifdef __cplusplus +extern "C" { +#endif + +#include "defs.h" + + +/*** SHA-256/384/512 Various Length Definitions ***********************/ +#define SHA256_BLOCK_LENGTH 64 +#define SHA256_DIGEST_LENGTH 32 +#define SHA256_DIGEST_STRING_LENGTH (SHA256_DIGEST_LENGTH * 2 + 1) +#define SHA384_BLOCK_LENGTH 128 +#define SHA384_DIGEST_LENGTH 48 +#define SHA384_DIGEST_STRING_LENGTH (SHA384_DIGEST_LENGTH * 2 + 1) +#define SHA512_BLOCK_LENGTH 128 +#define SHA512_DIGEST_LENGTH 64 +#define SHA512_DIGEST_STRING_LENGTH (SHA512_DIGEST_LENGTH * 2 + 1) + + +/*** SHA-256/384/512 Context Structures *******************************/ + +typedef struct _SHA256_CTX { + uint32_t state[8]; + uint64_t bitcount; + uint8_t buffer[SHA256_BLOCK_LENGTH]; +} SHA256_CTX; +typedef struct _SHA512_CTX { + uint64_t state[8]; + uint64_t bitcount[2]; + uint8_t buffer[SHA512_BLOCK_LENGTH]; +} SHA512_CTX; + +typedef SHA512_CTX SHA384_CTX; + + +/*** SHA-256/384/512 Function Prototypes ******************************/ +void SHA256_Init _((SHA256_CTX *)); +void SHA256_Update _((SHA256_CTX*, const uint8_t*, size_t)); +void SHA256_Final _((uint8_t[SHA256_DIGEST_LENGTH], SHA256_CTX*)); +char* SHA256_End _((SHA256_CTX*, char[SHA256_DIGEST_STRING_LENGTH])); +char* SHA256_Data _((const uint8_t*, size_t, char[SHA256_DIGEST_STRING_LENGTH])); +char *SHA256_File _((char *, char *)); +int SHA256_Equal _((SHA256_CTX*, SHA256_CTX*)); + +void SHA384_Init _((SHA384_CTX*)); +void SHA384_Update _((SHA384_CTX*, const uint8_t*, size_t)); +void SHA384_Final _((uint8_t[SHA384_DIGEST_LENGTH], SHA384_CTX*)); +char* SHA384_End _((SHA384_CTX*, char[SHA384_DIGEST_STRING_LENGTH])); +char* SHA384_Data _((const uint8_t*, size_t, char[SHA384_DIGEST_STRING_LENGTH])); +char *SHA384_File _((char *, char *)); +int SHA384_Equal _((SHA384_CTX*, SHA384_CTX*)); + +void SHA512_Init _((SHA512_CTX*)); +void SHA512_Update _((SHA512_CTX*, const uint8_t*, size_t)); +void SHA512_Final _((uint8_t[SHA512_DIGEST_LENGTH], SHA512_CTX*)); +char* SHA512_End _((SHA512_CTX*, char[SHA512_DIGEST_STRING_LENGTH])); +char* SHA512_Data _((const uint8_t*, size_t, char[SHA512_DIGEST_STRING_LENGTH])); +char *SHA512_File _((char *, char *)); +int SHA512_Equal _((SHA512_CTX*, SHA512_CTX*)); + +#ifdef __cplusplus +} +#endif /* __cplusplus */ + +#endif /* __SHA2_H__ */ + diff --git a/ext/digest/sha2/sha2hl.c b/ext/digest/sha2/sha2hl.c new file mode 100644 index 0000000000..03fde538c3 --- /dev/null +++ b/ext/digest/sha2/sha2hl.c @@ -0,0 +1,252 @@ +/* $NetBSD: sha2hl.c,v 1.1 2001/03/12 09:08:40 agc Exp $ */ +/* $RoughId: sha2hl.c,v 1.2 2001/07/13 19:49:10 knu Exp $ */ +/* $Id$ */ + +/* + * sha2hl.c + * This code includes some functions taken from sha2.c, hence the + * following licence reproduction. + * + * This code is not a verbatim copy, since some routines have been added, + * and some bugs have been fixed. + * + * Version 1.0.0beta1 + * + * Written by Aaron D. Gifford <me@aarongifford.com> + * + * Copyright 2000 Aaron D. Gifford. All rights reserved. + * + * Redistribution and use in source and binary forms, with or without + * modification, are permitted provided that the following conditions + * are met: + * 1. Redistributions of source code must retain the above copyright + * notice, this list of conditions and the following disclaimer. + * 2. Redistributions in binary form must reproduce the above copyright + * notice, this list of conditions and the following disclaimer in the + * documentation and/or other materials provided with the distribution. + * 3. Neither the name of the copyright holder nor the names of contributors + * may be used to endorse or promote products derived from this software + * without specific prior written permission. + * + * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTOR(S) ``AS IS'' AND + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE + * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTOR(S) BE LIABLE + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF + * SUCH DAMAGE. + * + */ + +#include "sha2.h" + +#ifndef lint +/* __RCSID("$NetBSD: sha2hl.c,v 1.1 2001/03/12 09:08:40 agc Exp $"); */ +#endif /* not lint */ + +/* #include "namespace.h" */ + +#include <assert.h> +#include <errno.h> +#include <fcntl.h> +#include <stdio.h> +#include <string.h> +#include <stdlib.h> +#if defined(HAVE_UNISTD_H) +# include <unistd.h> +#endif + +#ifndef _DIAGASSERT +#define _DIAGASSERT(cond) assert(cond) +#endif + +/* + * Constant used by SHA256/384/512_End() functions for converting the + * digest to a readable hexadecimal character string: + */ +static const char sha2_hex_digits[] = "0123456789abcdef"; + +char * +SHA256_File(char *filename, char *buf) +{ + uint8_t buffer[BUFSIZ * 20]; + SHA256_CTX ctx; + int fd, num, oerrno; + + _DIAGASSERT(filename != NULL); + /* XXX: buf may be NULL ? */ + + SHA256_Init(&ctx); + + if ((fd = open(filename, O_RDONLY)) < 0) + return (0); + + while ((num = read(fd, buffer, sizeof(buffer))) > 0) + SHA256_Update(&ctx, buffer, (size_t) num); + + oerrno = errno; + close(fd); + errno = oerrno; + return (num < 0 ? 0 : SHA256_End(&ctx, buf)); +} + + +char * +SHA256_End(SHA256_CTX *ctx, char buffer[]) +{ + uint8_t digest[SHA256_DIGEST_LENGTH], *d = digest; + uint8_t *ret; + int i; + + /* Sanity check: */ + assert(ctx != NULL); + + if ((ret = buffer) != NULL) { + SHA256_Final(digest, ctx); + + for (i = 0; i < SHA256_DIGEST_LENGTH; i++) { + *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4]; + *buffer++ = sha2_hex_digits[*d & 0x0f]; + d++; + } + *buffer = (char) 0; + } else { + (void) memset(ctx, 0, sizeof(SHA256_CTX)); + } + (void) memset(digest, 0, SHA256_DIGEST_LENGTH); + return ret; +} + +char * +SHA256_Data(const uint8_t * data, size_t len, char *digest) +{ + SHA256_CTX ctx; + + SHA256_Init(&ctx); + SHA256_Update(&ctx, data, len); + return SHA256_End(&ctx, digest); +} + +char * +SHA384_File(char *filename, char *buf) +{ + SHA384_CTX ctx; + uint8_t buffer[BUFSIZ * 20]; + int fd, num, oerrno; + + _DIAGASSERT(filename != NULL); + /* XXX: buf may be NULL ? */ + + SHA384_Init(&ctx); + + if ((fd = open(filename, O_RDONLY)) < 0) + return (0); + + while ((num = read(fd, buffer, sizeof(buffer))) > 0) + SHA384_Update(&ctx, buffer, (size_t) num); + + oerrno = errno; + close(fd); + errno = oerrno; + return (num < 0 ? 0 : SHA384_End(&ctx, buf)); +} + +char * +SHA384_End(SHA384_CTX * ctx, char buffer[]) +{ + uint8_t digest[SHA384_DIGEST_LENGTH], *d = digest; + uint8_t *ret; + int i; + + /* Sanity check: */ + assert(ctx != NULL); + + if ((ret = buffer) != NULL) { + SHA384_Final(digest, ctx); + + for (i = 0; i < SHA384_DIGEST_LENGTH; i++) { + *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4]; + *buffer++ = sha2_hex_digits[*d & 0x0f]; + d++; + } + *buffer = (char) 0; + } else { + (void) memset(ctx, 0, sizeof(SHA384_CTX)); + } + (void) memset(digest, 0, SHA384_DIGEST_LENGTH); + return ret; +} + +char * +SHA384_Data(const uint8_t * data, size_t len, char *digest) +{ + SHA384_CTX ctx; + + SHA384_Init(&ctx); + SHA384_Update(&ctx, data, len); + return SHA384_End(&ctx, digest); +} + +char * +SHA512_File(char *filename, char *buf) +{ + SHA512_CTX ctx; + uint8_t buffer[BUFSIZ * 20]; + int fd, num, oerrno; + + _DIAGASSERT(filename != NULL); + /* XXX: buf may be NULL ? */ + + SHA512_Init(&ctx); + + if ((fd = open(filename, O_RDONLY)) < 0) + return (0); + + while ((num = read(fd, buffer, sizeof(buffer))) > 0) + SHA512_Update(&ctx, buffer, (size_t) num); + + oerrno = errno; + close(fd); + errno = oerrno; + return (num < 0 ? 0 : SHA512_End(&ctx, buf)); +} + +char * +SHA512_End(SHA512_CTX * ctx, char buffer[]) +{ + uint8_t digest[SHA512_DIGEST_LENGTH], *d = digest; + uint8_t *ret; + int i; + + /* Sanity check: */ + assert(ctx != NULL); + + if ((ret = buffer) != NULL) { + SHA512_Final(digest, ctx); + + for (i = 0; i < SHA512_DIGEST_LENGTH; i++) { + *buffer++ = sha2_hex_digits[(*d & 0xf0) >> 4]; + *buffer++ = sha2_hex_digits[*d & 0x0f]; + d++; + } + *buffer = (char) 0; + } else { + (void) memset(ctx, 0, sizeof(SHA512_CTX)); + } + (void) memset(digest, 0, SHA512_DIGEST_LENGTH); + return ret; +} + +char * +SHA512_Data(const uint8_t * data, size_t len, char *digest) +{ + SHA512_CTX ctx; + + SHA512_Init(&ctx); + SHA512_Update(&ctx, data, len); + return SHA512_End(&ctx, digest); +} diff --git a/ext/digest/sha2/sha2init.c b/ext/digest/sha2/sha2init.c new file mode 100644 index 0000000000..d7666aadf9 --- /dev/null +++ b/ext/digest/sha2/sha2init.c @@ -0,0 +1,47 @@ +/* $RoughId: sha2init.c,v 1.3 2001/07/13 20:00:43 knu Exp $ */ +/* $Id$ */ + +#include "digest.h" +#include "sha2.h" + +#define FOREACH_BITLEN(func) func(256) func(384) func(512) + +#define DEFINE_ALGO_METADATA(bitlen) \ +static algo_t sha##bitlen = { \ + SHA##bitlen##_DIGEST_LENGTH, \ + sizeof(SHA##bitlen##_CTX), \ + (hash_init_func_t)SHA##bitlen##_Init, \ + (hash_update_func_t)SHA##bitlen##_Update, \ + (hash_end_func_t)SHA##bitlen##_End, \ + (hash_final_func_t)SHA##bitlen##_Final, \ + (hash_equal_func_t)SHA##bitlen##_Equal, \ +}; + +FOREACH_BITLEN(DEFINE_ALGO_METADATA) + +void +Init_sha2() +{ + VALUE mDigest, cDigest_Base; + ID id_metadata; + +#define DECLARE_ALGO_CLASS(bitlen) \ + VALUE cDigest_SHA##bitlen; + + FOREACH_BITLEN(DECLARE_ALGO_CLASS) + + rb_require("digest.so"); + + id_metadata = rb_intern("metadata"); + + mDigest = rb_path2class("Digest"); + cDigest_Base = rb_path2class("Digest::Base"); + +#define DEFINE_ALGO_CLASS(bitlen) \ + cDigest_SHA##bitlen = rb_define_class_under(mDigest, "SHA" #bitlen, cDigest_Base); \ +\ + rb_cvar_declare(cDigest_SHA##bitlen, id_metadata, \ + Data_Wrap_Struct(rb_cObject, 0, 0, &sha##bitlen)); + + FOREACH_BITLEN(DEFINE_ALGO_CLASS) +} diff --git a/ext/digest/test.rb b/ext/digest/test.rb new file mode 100644 index 0000000000..2f29948bb6 --- /dev/null +++ b/ext/digest/test.rb @@ -0,0 +1,100 @@ +#!/usr/bin/env ruby +# +# $RoughId: test.rb,v 1.4 2001/07/13 15:38:27 knu Exp $ +# $Id$ + +require 'runit/testcase' +require 'runit/cui/testrunner' + +require 'digest/md5' +require 'digest/rmd160' +require 'digest/sha1' +require 'digest/sha2' +include Digest + +class TestDigest < RUNIT::TestCase + ALGOS = [ + MD5, + SHA1, + SHA256, + SHA384, + SHA512, + RMD160 + ] + + DATA = { + "abc" => { + MD5 => "900150983cd24fb0d6963f7d28e17f72", + SHA1 => "a9993e364706816aba3e25717850c26c9cd0d89d", + SHA256 => "ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad", + SHA384 => "cb00753f45a35e8bb5a03d699ac65007272c32ab0eded1631a8b605a43ff5bed8086072ba1e7cc2358baeca134c825a7", + SHA512 => "ddaf35a193617abacc417349ae20413112e6fa4e89a97ea20a9eeee64b55d39a2192992a274fc1a836ba3c23a3feebbd454d4423643ce80e2a9ac94fa54ca49f", + RMD160 => "8eb208f7e05d987a9b044a8e98c6b087f15a0bfc" + }, + + "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" => { + MD5 => "8215ef0796a20bcaaae116d3876c664a", + SHA1 => "84983e441c3bd26ebaae4aa1f95129e5e54670f1", + SHA256 => "248d6a61d20638b8e5c026930c3e6039a33ce45964ff2167f6ecedd419db06c1", + SHA384 => "3391fdddfc8dc7393707a65b1b4709397cf8b1d162af05abfe8f450de5f36bc6b0455a8520bc4e6f5fe95b1fe3c8452b", + SHA512 => "204a8fc6dda82f0a0ced7beb8e08a41657c16ef468b228a8279be331a703c33596fd15c13b1b07f9aa1d3bea57789ca031ad85c7a71dd70354ec631238ca3445", + RMD160 => "12a053384a9c0c88e405a06c27dcf49ada62eb2b" + } + } + + def test_s_hexdigest + ALGOS.each do |algo| + DATA.each do |str, table| + assert_equal(table[algo], algo.hexdigest(str)) + end + end + end + + def test_s_digest + ALGOS.each do |algo| + DATA.each do |str, table| + assert_equal([table[algo]].pack("H*"), algo.digest(str)) + end + end + end + + def test_update + # This test is also for digest() and hexdigest() + + str = "ABC" + + ALGOS.each do |algo| + md = algo.new + md.update str + assert_equal(algo.hexdigest(str), md.hexdigest) + assert_equal(algo.digest(str), md.digest) + end + end + + def test_eq + # This test is also for clone() + + ALGOS.each do |algo| + md1 = algo.new("ABC") + + assert_equal(md1, md1.clone) + + md2 = algo.new + md2 << "A" + + assert(md1 != md2) + + md2 << "BC" + + assert_equal(md1, md2) + end + end +end + +if $0 == __FILE__ + suite = RUNIT::TestSuite.new + + suite.add_test(TestDigest.suite) + + RUNIT::CUI::TestRunner.run(suite) +end diff --git a/ext/digest/test.sh b/ext/digest/test.sh new file mode 100644 index 0000000000..88b34b04c5 --- /dev/null +++ b/ext/digest/test.sh @@ -0,0 +1,27 @@ +#!/bin/sh +# +# $RoughId: test.sh,v 1.5 2001/07/13 15:38:27 knu Exp $ +# $Id$ + +RUBY=${RUBY:=ruby} +MAKE=${MAKE:=make} +CFLAGS=${CFLAGS:=-Wall} + +${RUBY} extconf.rb --with-cflags="${CFLAGS}" +${MAKE} clean +${MAKE} + +mkdir -p lib/digest + +for algo in md5 rmd160 sha1 sha2; do + (cd $algo && + ${RUBY} extconf.rb --with-cflags="${CFLAGS}"; + ${MAKE} clean; + ${MAKE}) + ln -sf ../../$algo/$algo.so lib/digest/ +done + +${RUBY} -I. -I./lib test.rb + +rm lib/digest/*.so +rmdir lib/digest |