Implement HMAC support in lib/crypto.

lib/crypto/sha_utils.dart

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 // Constants.
 final _MASK_8 = 0xff;
 final _MASK_32 = 0xffffffff;
 final _BITS_PER_BYTE = 8;
 final _BYTES_PER_WORD = 4;
 
 // Base class encapsulating common behavior for SHA cryptographic hash
 // functions.
-class _SHACryptoHashBase implements CryptoHash {
-  _SHACryptoHashBase(int this._chunkSizeInWords, int this._digestSizeInWords)
+class _SHAHashBase implements Hash {
+  _SHAHashBase(int this._chunkSizeInWords, int this._digestSizeInWords)
       : _pendingData = [] {
     _currentChunk = new List(_chunkSizeInWords);
     _h = new List(_digestSizeInWords);
   }
 
   // Update the hasher with more data.
-  _SHACryptoHashBase update(List<int> data) {
+  _SHAHashBase update(List<int> data) {
     if (_digestCalled) {
-      throw new CryptoHashException(
-          'CryptoHash update method called after digest');
+      throw new HashException(
+          'Hash update method called after digest');

[Søren Gjesse, 2012/04/30 09:05:23]

Maybe add " was retrieved" to exception text.

[Mads Ager (google), 2012/04/30 09:37:10]

Done.

     }
     _lengthInBytes += data.length;
     _pendingData.addAll(data);
     _iterate();
     return this;
   }
 
   // Finish the hash computation and return the digest string.
   List<int> digest() {
     if (_digestCalled) {
-      throw new CryptoHashException(
-          'CryptoHash digest method called more than once');
+      return _resultAsBytes();
     }
     _digestCalled = true;
     _finalizeData();
     _iterate();
     assert(_pendingData.length == 0);
-    var result = [];
-    for (var i = 0; i < _h.length; i++) {
-      result.addAll(_wordToBytes(_h[i]));
-    }
-    return result;
+    return _resultAsBytes();
   }
 
+  // Returns the block size of the hash in bytes.
+  int get blockSize() {
+    return _chunkSizeInWords * _BYTES_PER_WORD;
+  }
+
+  // Create a fresh instance of this Hash.
+  abstract newInstance();
+
   // One round of the hash computation.
   abstract _updateHash(List<int> m);
 
   // Helper methods.
   _add32(x, y) => (x + y) & _MASK_32;
   _roundUp(val, n) => (val + n - 1) & -n;
 
+  // Compute the final result as a list of bytes from the hash words.
+  _resultAsBytes() {
+    var result = [];
+    for (var i = 0; i < _h.length; i++) {
+      result.addAll(_wordToBytes(_h[i]));
+    }
+    return result;
+  }
+
   // Converts a list of bytes to a chunk of 32-bit words.
   _bytesToChunk(List<int> data, int dataIndex) {
     assert((data.length - dataIndex) >= (_chunkSizeInWords * _BYTES_PER_WORD));
     for (var wordIndex = 0; wordIndex < _chunkSizeInWords; wordIndex++) {
       var word = (data[dataIndex++] & 0xff) << 24;
       word |= (data[dataIndex++] & _MASK_8) << 16;
       word |= (data[dataIndex++] & _MASK_8) << 8;
       word |= (data[dataIndex++] & _MASK_8);
       _currentChunk[wordIndex] = word;
     }
@@ skipping 35 matching lines @@
     var zeroPadding = finalizedLength - contentsLength;
     for (var i = 0; i < zeroPadding; i++) {
       _pendingData.add(0);
     }
     var lengthInBits = _lengthInBytes * _BITS_PER_BYTE;
     _pendingData.addAll(_wordToBytes(lengthInBits >> 32));
     _pendingData.addAll(_wordToBytes(lengthInBits & _MASK_32));
   }
 
   // Hasher state.
+  final int _chunkSizeInWords;
+  final int _digestSizeInWords;
   int _lengthInBytes = 0;
-  int _chunkSizeInWords;
-  int _digestSizeInWords;
   List<int> _pendingData;
   List<int> _currentChunk;
   List<int> _h;
   bool _digestCalled = false;
 }