Browse Source

- Passer à la nouvelle version du script uploadify

- Nettoyer grandement le code... (encore quelques trucs à faire)

C'est testé et fonctionnel. Mais il faut peaufiner pour rendre ça plus joli.
Il faut maintenant également rendre paramétrable au webmasteur par exemple les types de fichiers uploadés, la limite de taille, etc.
master
xdjuj@apsulis.com 11 years ago
parent
commit
555cc7dce2
  1. 68
      .gitattributes
  2. 2
      formulaires/inc-upload_document.html
  3. 137
      noisettes/uploadify.html
  4. 5
      paquet.xml
  5. 98
      theme/uploadify/com/adobe/air/logging/FileTarget.as
  6. 127
      theme/uploadify/com/adobe/crypto/HMAC.as
  7. 281
      theme/uploadify/com/adobe/crypto/MD5.as
  8. 402
      theme/uploadify/com/adobe/crypto/MD5Stream.as
  9. 271
      theme/uploadify/com/adobe/crypto/SHA1.as
  10. 257
      theme/uploadify/com/adobe/crypto/SHA224.as
  11. 261
      theme/uploadify/com/adobe/crypto/SHA256.as
  12. 114
      theme/uploadify/com/adobe/crypto/WSSEUsernameToken.as
  13. 63
      theme/uploadify/com/adobe/errors/IllegalStateError.as
  14. 47
      theme/uploadify/com/adobe/fileformats/vcard/Address.as
  15. 39
      theme/uploadify/com/adobe/fileformats/vcard/Email.as
  16. 39
      theme/uploadify/com/adobe/fileformats/vcard/Phone.as
  17. 54
      theme/uploadify/com/adobe/fileformats/vcard/VCard.as
  18. 246
      theme/uploadify/com/adobe/fileformats/vcard/VCardParser.as
  19. 39
      theme/uploadify/com/adobe/images/BitString.as
  20. 648
      theme/uploadify/com/adobe/images/JPGEncoder.as
  21. 141
      theme/uploadify/com/adobe/images/PNGEncoder.as
  22. 55
      theme/uploadify/com/adobe/net/DynamicURLLoader.as
  23. 76
      theme/uploadify/com/adobe/net/IURIResolver.as
  24. 196
      theme/uploadify/com/adobe/net/MimeTypeMap.as
  25. 2466
      theme/uploadify/com/adobe/net/URI.as
  26. 139
      theme/uploadify/com/adobe/net/URIEncodingBitmap.as
  27. 198
      theme/uploadify/com/adobe/net/proxies/RFC2817Socket.as
  28. 34
      theme/uploadify/com/adobe/protocols/dict/Database.as
  29. 39
      theme/uploadify/com/adobe/protocols/dict/Definition.as
  30. 328
      theme/uploadify/com/adobe/protocols/dict/Dict.as
  31. 28
      theme/uploadify/com/adobe/protocols/dict/DictionaryServer.as
  32. 34
      theme/uploadify/com/adobe/protocols/dict/MatchStrategy.as
  33. 39
      theme/uploadify/com/adobe/protocols/dict/Response.as
  34. 14
      theme/uploadify/com/adobe/protocols/dict/events/ConnectedEvent.as
  35. 26
      theme/uploadify/com/adobe/protocols/dict/events/DatabaseEvent.as
  36. 27
      theme/uploadify/com/adobe/protocols/dict/events/DefinitionEvent.as
  37. 26
      theme/uploadify/com/adobe/protocols/dict/events/DefinitionHeaderEvent.as
  38. 26
      theme/uploadify/com/adobe/protocols/dict/events/DictionaryServerEvent.as
  39. 14
      theme/uploadify/com/adobe/protocols/dict/events/DisconnectedEvent.as
  40. 37
      theme/uploadify/com/adobe/protocols/dict/events/ErrorEvent.as
  41. 26
      theme/uploadify/com/adobe/protocols/dict/events/MatchEvent.as
  42. 26
      theme/uploadify/com/adobe/protocols/dict/events/MatchStrategiesEvent.as
  43. 14
      theme/uploadify/com/adobe/protocols/dict/events/NoMatchEvent.as
  44. 25
      theme/uploadify/com/adobe/protocols/dict/util/CompleteResponseEvent.as
  45. 49
      theme/uploadify/com/adobe/protocols/dict/util/SocketHelper.as
  46. 85
      theme/uploadify/com/adobe/serialization/json/JSON.as
  47. 221
      theme/uploadify/com/adobe/serialization/json/JSONDecoder.as
  48. 299
      theme/uploadify/com/adobe/serialization/json/JSONEncoder.as
  49. 87
      theme/uploadify/com/adobe/serialization/json/JSONParseError.as
  50. 104
      theme/uploadify/com/adobe/serialization/json/JSONToken.as
  51. 67
      theme/uploadify/com/adobe/serialization/json/JSONTokenType.as
  52. 583
      theme/uploadify/com/adobe/serialization/json/JSONTokenizer.as
  53. 187
      theme/uploadify/com/adobe/utils/ArrayUtil.as
  54. 699
      theme/uploadify/com/adobe/utils/DateUtil.as
  55. 87
      theme/uploadify/com/adobe/utils/DictionaryUtil.as
  56. 99
      theme/uploadify/com/adobe/utils/IntUtil.as
  57. 74
      theme/uploadify/com/adobe/utils/NumberFormatter.as
  58. 270
      theme/uploadify/com/adobe/utils/StringUtil.as
  59. 168
      theme/uploadify/com/adobe/utils/XMLUtil.as
  60. 48
      theme/uploadify/com/adobe/webapis/ServiceBase.as
  61. 108
      theme/uploadify/com/adobe/webapis/URLLoaderBase.as
  62. 75
      theme/uploadify/com/adobe/webapis/events/ServiceEvent.as
  63. 967
      theme/uploadify/jquery.uploadify-3.1.js
  64. 16
      theme/uploadify/jquery.uploadify-3.1.min.js
  65. 26
      theme/uploadify/jquery.uploadify.v2.1.4.min.js
  66. 20
      theme/uploadify/license.txt
  67. 4
      theme/uploadify/swfobject.js
  68. 0
      theme/uploadify/uploadify-cancel.png
  69. BIN
      theme/uploadify/uploadify.allglyphs.swf
  70. 92
      theme/uploadify/uploadify.css
  71. BIN
      theme/uploadify/uploadify.swf
  72. 6
      uploadify_pipelines.php

68
.gitattributes vendored

@ -3,67 +3,11 @@ formulaires/inc-upload_document.html -text
noisettes/uploadify.html -text
/paquet.xml -text
theme/img/uploadify.png -text
theme/uploadify/cancel.png -text
theme/uploadify/com/adobe/air/logging/FileTarget.as -text
theme/uploadify/com/adobe/crypto/HMAC.as -text
theme/uploadify/com/adobe/crypto/MD5.as -text
theme/uploadify/com/adobe/crypto/MD5Stream.as -text
theme/uploadify/com/adobe/crypto/SHA1.as -text
theme/uploadify/com/adobe/crypto/SHA224.as -text
theme/uploadify/com/adobe/crypto/SHA256.as -text
theme/uploadify/com/adobe/crypto/WSSEUsernameToken.as -text
theme/uploadify/com/adobe/errors/IllegalStateError.as -text
theme/uploadify/com/adobe/fileformats/vcard/Address.as -text
theme/uploadify/com/adobe/fileformats/vcard/Email.as -text
theme/uploadify/com/adobe/fileformats/vcard/Phone.as -text
theme/uploadify/com/adobe/fileformats/vcard/VCard.as -text
theme/uploadify/com/adobe/fileformats/vcard/VCardParser.as -text
theme/uploadify/com/adobe/images/BitString.as -text
theme/uploadify/com/adobe/images/JPGEncoder.as -text
theme/uploadify/com/adobe/images/PNGEncoder.as -text
theme/uploadify/com/adobe/net/DynamicURLLoader.as -text
theme/uploadify/com/adobe/net/IURIResolver.as -text
theme/uploadify/com/adobe/net/MimeTypeMap.as -text
theme/uploadify/com/adobe/net/URI.as -text
theme/uploadify/com/adobe/net/URIEncodingBitmap.as -text
theme/uploadify/com/adobe/net/proxies/RFC2817Socket.as -text
theme/uploadify/com/adobe/protocols/dict/Database.as -text
theme/uploadify/com/adobe/protocols/dict/Definition.as -text
theme/uploadify/com/adobe/protocols/dict/Dict.as -text
theme/uploadify/com/adobe/protocols/dict/DictionaryServer.as -text
theme/uploadify/com/adobe/protocols/dict/MatchStrategy.as -text
theme/uploadify/com/adobe/protocols/dict/Response.as -text
theme/uploadify/com/adobe/protocols/dict/events/ConnectedEvent.as -text
theme/uploadify/com/adobe/protocols/dict/events/DatabaseEvent.as -text
theme/uploadify/com/adobe/protocols/dict/events/DefinitionEvent.as -text
theme/uploadify/com/adobe/protocols/dict/events/DefinitionHeaderEvent.as -text
theme/uploadify/com/adobe/protocols/dict/events/DictionaryServerEvent.as -text
theme/uploadify/com/adobe/protocols/dict/events/DisconnectedEvent.as -text
theme/uploadify/com/adobe/protocols/dict/events/ErrorEvent.as -text
theme/uploadify/com/adobe/protocols/dict/events/MatchEvent.as -text
theme/uploadify/com/adobe/protocols/dict/events/MatchStrategiesEvent.as -text
theme/uploadify/com/adobe/protocols/dict/events/NoMatchEvent.as -text
theme/uploadify/com/adobe/protocols/dict/util/CompleteResponseEvent.as -text
theme/uploadify/com/adobe/protocols/dict/util/SocketHelper.as -text
theme/uploadify/com/adobe/serialization/json/JSON.as -text
theme/uploadify/com/adobe/serialization/json/JSONDecoder.as -text
theme/uploadify/com/adobe/serialization/json/JSONEncoder.as -text
theme/uploadify/com/adobe/serialization/json/JSONParseError.as -text
theme/uploadify/com/adobe/serialization/json/JSONToken.as -text
theme/uploadify/com/adobe/serialization/json/JSONTokenType.as -text
theme/uploadify/com/adobe/serialization/json/JSONTokenizer.as -text
theme/uploadify/com/adobe/utils/ArrayUtil.as -text
theme/uploadify/com/adobe/utils/DateUtil.as -text
theme/uploadify/com/adobe/utils/DictionaryUtil.as -text
theme/uploadify/com/adobe/utils/IntUtil.as -text
theme/uploadify/com/adobe/utils/NumberFormatter.as -text
theme/uploadify/com/adobe/utils/StringUtil.as -text
theme/uploadify/com/adobe/utils/XMLUtil.as -text
theme/uploadify/com/adobe/webapis/ServiceBase.as -text
theme/uploadify/com/adobe/webapis/URLLoaderBase.as -text
theme/uploadify/com/adobe/webapis/events/ServiceEvent.as -text
theme/uploadify/jquery.uploadify.v2.1.4.min.js -text
theme/uploadify/swfobject.js -text
theme/uploadify/uploadify.allglyphs.swf -text
theme/uploadify/jquery.uploadify-3.1.js -text
theme/uploadify/jquery.uploadify-3.1.min.js -text
theme/uploadify/license.txt -text
theme/uploadify/uploadify-cancel.png -text
theme/uploadify/uploadify.css -text
theme/uploadify/uploadify.swf -text
/uploadify.html -text
/uploadify_pipelines.php -text

2
formulaires/inc-upload_document.html

@ -17,7 +17,7 @@
]<input class='file multi' type="file" name="fichier_upload[]" value='#ENV{fichier_upload}' id="fichier_upload#GET{domid}" size='11' />
<!--editer_fichier_upload-->
<hr />
<label><strong>Utiliser ce bouton pour un t&eacute;l&eacute;versement de gros fichier <br />(&gt; 3 Mo)</strong></label>
<label>T&eacute;l&eacute;verser en lot ou téléverser de gros fichiers</label>
<INCLURE{fond=noisettes/uploadify,env,ajax} />
</li>
</ul>

137
noisettes/uploadify.html

@ -1,77 +1,68 @@
#CACHE{0}
[<script type="text/javascript" src="(#CHEMIN{theme/uploadify/jquery.uploadify-3.1.min.js})"></script>]
[<script type="text/javascript" src="(#CHEMIN{theme/uploadify/jquery.uploadify.v2.1.4.min.js})"></script>]
[<script type="text/javascript" src="(#CHEMIN{theme/uploadify/swfobject.js})"></script>]
<B_lesDocs>
<p class="commentaire">
<strong>Fichiers actuellement liés :</strong><br />
<BOUCLE_lesDocs(DOCUMENTS){id_rubrique=#GET{article_inscription}}{tout}{'<br />'}>
- [<a href="#URL_DOCUMENT" target='_blank'>(#FICHIER|basename)[ ((#ID_DOCUMENT))] </a>] - <a class='ajax suppr' href="#URL_ACTION_AUTEUR{supprimer_document,#ID_DOCUMENT,#SELF}">[supprimer]</a>
</BOUCLE_lesDocs>
</p>
</B_lesDocs>
<div id="custom-demo" class="demo" style='position:relative;width:372px'>
<div class="demo-box">
<div id="custom-queue"></div>
<input id="custom_file_upload" type="file" name="Filedata" />
<a href="[(#SELF|parametre_url{id_article,#ENV{id_article}}|parametre_url{var,[(#REM|uniqid)]})]" title="Rafraichir la liste" id="leRefresh" class='ajax rafraichir'>Rafraîchir la liste</a>
</div>
<div id="conteneur-uploadify">
<div id="custom-queue"></div>
<input id="custom_file_upload" type="file" name="Filedata" />
</div><!-- #custom-demo -->
<script type="text/javascript">
jQuery(function() {
jQuery('#leRefresh').hide();
jQuery('#custom_file_upload').uploadify({
'uploader' : '#CHEMIN{theme/uploadify/uploadify.swf}',
// 'script' : '#CHEMIN{formulaires/inscription.php}',
'script' : '[(#URL_PAGE{uploadify})]',
'scriptData' : {'id_objet':'#ENV{id_objet}','objet':'#ENV{objet}'},
'scriptAccess' : 'sameDomain', // Set to "always" to allow script access across domains
'cancelImg' : '#CHEMIN{theme/uploadify/cancel.png}',
'folder' : '/',
'buttonText' : 'Choisir le fichier',
'multi' : true,
'auto' : true,
// 'fileExt' : '*.jpg;*.gif;*.png;*.ppt;*.pptx;*.doc;*.docx;*.xls;*.xlsx;*.pdf;*.bmp;*.tif;*.tiff;',
'fileExt' : '*.*',
// 'fileDesc' : 'Image Files (.JPG, .GIF, .PNG)',
'queueID' : 'custom-queue',
'queueSizeLimit' : 10,
'simUploadLimit' : 10,
'sizeLimit' : 100000000,
'removeCompleted': false,
'onUploadComplete' : function(file) {
alert('The file ' + file.name + ' finished processing.');
},
'onAllComplete' : function(event,data) {
jQuery('#leRefresh').click();
var comp = document.getElementById('leRefresh');
try { //in firefox
comp.click();
return;
} catch(ex) {}
try { // in chrome
if(document.createEvent) {
var e = document.createEvent('MouseEvents');
e.initEvent( 'click', true, true );
comp.dispatchEvent(e);
return;
}
} catch(ex) {}
try { // in IE
if(document.createEventObject) {
var evObj = document.createEventObject();
comp.fireEvent("onclick", evObj);
return;
}
} catch(ex) {}
}
// 'onSelectOnce' : function(event,data) {
// jQuery('#status-message').text(data.filesSelected + ' files have been added to the queue.');
// },
});
});
</script>
<script type="text/javascript" charset="utf-8">
jQuery(function() {
jQuery('#custom_file_upload').uploadify({
'swf' : '#CHEMIN{theme/uploadify/uploadify.swf}',
'uploader' : '[(#URL_PAGE{uploadify})]',
'formData' : {'id_objet':'#ENV{id_objet}','objet':'#ENV{objet}'},
'buttonText': 'Parcourir...',
'fileObjName' : 'Filedata',
'fileTypeExts' : '*.*',
'removeCompleted' : true,
/*
TODO Brancher en onAllComplete => action de rechargement de la <div id="listing_fichiers">
*/
// 'onUploadSuccess' : function(file, data, response){ /* Un fichier est fini, on recharge le listing des fichiers */
// alert('Fichier ' + file.name + ' bien uploadé : ' + response + ':' + data);
// },
// 'onQueueComplete' : function(queueData) {
// alert(queueData.uploadsSuccessful + ' files were successfully uploaded.');
// // alert("Fin de l'upload des documents, ==> mise à jour #listing_fichiers");
// },
/* Voici toutes les fonctions à dispo, au cas Zou */
// 'removeTimeout' : 10,
// 'uploadLimit' : 1
// 'fileSizeLimit' : '100KB',
// 'fileTypeDesc' : 'Any old file you want...',
// 'formData' : {'someKey' : 'someValue', 'someOtherKey' : 1},
// 'onUploadStart' : function(file) {
// $("#file_upload").uploadify("settings", "someOtherKey", 2);
// }
// 'queueSizeLimit' : 1,
// 'onAllComplete' : function(event,data) {
// jQuery('#leRefresh_sortie').click();
// var comp = document.getElementById('leRefresh_sortie');
// try { //in firefox
// comp.click();
// return;
// } catch(ex) {}
// try { // in chrome
// if(document.createEvent) {
// var e = document.createEvent('MouseEvents');
// e.initEvent( 'click', true, true );
// comp.dispatchEvent(e);
// return;
// }
// } catch(ex) {}
// try { // in IE
// if(document.createEventObject) {
// var evObj = document.createEventObject();
// comp.fireEvent("onclick", evObj);
// return;
// }
// } catch(ex) {}
// }
// 'onSelectOnce' : function(event,data) {
// jQuery('#status-message').text(data.filesSelected + ' files have been added to the queue.');
// },
});
});
</script>

5
paquet.xml

@ -1,7 +1,7 @@
<paquet
prefix="uploadify"
categorie="multimedia"
version="1.0.0"
version="1.0.1"
etat="dev"
compatibilite="[3.0.0;3.0.*]"
logo="theme/img/uploadify.png"
@ -10,4 +10,7 @@
<nom>Uploadify</nom>
<auteur lien="http://demo.apsulis.com">XDjuj</auteur>
<copyright>2012</copyright>
<pipeline nom="header_prive_css" action="insert_head_css" inclure="uploadify_pipelines.php" />
</paquet>

98
theme/uploadify/com/adobe/air/logging/FileTarget.as

@ -1,98 +0,0 @@
/*
Copyright (c) 2008, Adobe Systems Incorporated
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* 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.
* Neither the name of Adobe Systems Incorporated nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT OWNER OR
CONTRIBUTORS 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.
*/
package com.adobe.air.logging
{
import mx.logging.AbstractTarget;
import flash.filesystem.File;
import flash.filesystem.FileStream;
import flash.filesystem.FileMode;
import mx.logging.LogEvent;
import flash.system.System;
import flash.system.Capabilities;
import mx.logging.targets.LineFormattedTarget;
import mx.core.mx_internal;
use namespace mx_internal;
/**
* An Adobe AIR only class that provides a log target for the Flex logging
* framework, that logs files to a file on the user's system.
*
* This class will only work when running within Adobe AIR>
*/
public class FileTarget extends LineFormattedTarget
{
private const DEFAULT_LOG_PATH:String = "app-storage:/application.log";
private var log:File;
public function FileTarget(logFile:File = null)
{
if(logFile != null)
{
log = logFile;
}
else
{
log = new File(DEFAULT_LOG_PATH);
}
}
public function get logURI():String
{
return log.url;
}
mx_internal override function internalLog(message:String):void
{
write(message);
}
private function write(msg:String):void
{
var fs:FileStream = new FileStream();
fs.open(log, FileMode.APPEND);
fs.writeUTFBytes(msg + "\n");
fs.close();
}
public function clear():void
{
var fs:FileStream = new FileStream();
fs.open(log, FileMode.WRITE);
fs.writeUTFBytes("");
fs.close();
}
}
}

127
theme/uploadify/com/adobe/crypto/HMAC.as

@ -1,127 +0,0 @@
/*
Copyright (c) 2008, Adobe Systems Incorporated
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* 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.
* Neither the name of Adobe Systems Incorporated nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT OWNER OR
CONTRIBUTORS 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.
*/
package com.adobe.crypto {
import flash.utils.ByteArray;
import flash.utils.Endian;
import flash.utils.describeType;
/**
* Keyed-Hashing for Message Authentication
* Implementation based on algorithm description at
* http://www.faqs.org/rfcs/rfc2104.html
*/
public class HMAC
{
/**
* Performs the HMAC hash algorithm using byte arrays.
*
* @param secret The secret key
* @param message The message to hash
* @param algorithm Hash object to use
* @return A string containing the hash value of message
* @langversion ActionScript 3.0
* @playerversion Flash 8.5
* @tiptext
*/
public static function hash( secret:String, message:String, algorithm:Object = null ):String
{
var text:ByteArray = new ByteArray();
var k_secret:ByteArray = new ByteArray();
text.writeUTFBytes(message);
k_secret.writeUTFBytes(secret);
return hashBytes(k_secret, text, algorithm);
}
/**
* Performs the HMAC hash algorithm using string.
*
* @param secret The secret key
* @param message The message to hash
* @param algorithm Hash object to use
* @return A string containing the hash value of message
* @langversion ActionScript 3.0
* @playerversion Flash 8.5
* @tiptext
*/
public static function hashBytes( secret:ByteArray, message:ByteArray, algorithm:Object = null ):String
{
var ipad:ByteArray = new ByteArray();
var opad:ByteArray = new ByteArray();
var endian:String = Endian.BIG_ENDIAN;
if(algorithm == null){
algorithm = MD5;
}
if ( describeType(algorithm).@name.toString() == "com.adobe.crypto::MD5" ) {
endian = Endian.LITTLE_ENDIAN;
}
if ( secret.length > 64 ) {
algorithm.hashBytes(secret);
secret = new ByteArray();
secret.endian = endian;
while ( algorithm.digest.bytesAvailable != 0 ) {
secret.writeInt(algorithm.digest.readInt());
}
}
secret.length = 64
secret.position = 0;
for ( var x:int = 0; x < 64; x++ ) {
var byte:int = secret.readByte();
ipad.writeByte(0x36 ^ byte);
opad.writeByte(0x5c ^ byte);
}
ipad.writeBytes(message);
algorithm.hashBytes(ipad);
var tmp:ByteArray = new ByteArray();
tmp.endian = endian;
while ( algorithm.digest.bytesAvailable != 0 ) {
tmp.writeInt(algorithm.digest.readInt());
}
tmp.position = 0;
while ( tmp.bytesAvailable != 0 ) {
opad.writeByte(tmp.readUnsignedByte());
}
return algorithm.hashBytes( opad );
}
}
}

281
theme/uploadify/com/adobe/crypto/MD5.as

@ -1,281 +0,0 @@
/*
Copyright (c) 2008, Adobe Systems Incorporated
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* 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.
* Neither the name of Adobe Systems Incorporated nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT OWNER OR
CONTRIBUTORS 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.
*/
package com.adobe.crypto {
import com.adobe.utils.IntUtil;
import flash.utils.ByteArray;
/**
* The MD5 Message-Digest Algorithm
*
* Implementation based on algorithm description at
* http://www.faqs.org/rfcs/rfc1321.html
*/
public class MD5 {
public static var digest:ByteArray;
/**
* Performs the MD5 hash algorithm on a string.
*
* @param s The string to hash
* @return A string containing the hash value of s
* @langversion ActionScript 3.0
* @playerversion Flash 8.5
* @tiptext
*/
public static function hash(s:String) :String{
//Convert to byteArray and send through hashBinary function
// so as to only have complex code in one location
var ba:ByteArray = new ByteArray();
ba.writeUTFBytes(s);
return hashBinary(ba);
}
public static function hashBytes(s:ByteArray) :String{
return hashBinary(s);
}
/**
* Performs the MD5 hash algorithm on a ByteArray.
*
* @param s The string to hash
* @return A string containing the hash value of s
* @langversion ActionScript 3.0
* @playerversion Flash 8.5
* @tiptext
*/
public static function hashBinary( s:ByteArray ):String {
// initialize the md buffers
var a:int = 1732584193;
var b:int = -271733879;
var c:int = -1732584194;
var d:int = 271733878;
// variables to store previous values
var aa:int;
var bb:int;
var cc:int;
var dd:int;
// create the blocks from the string and
// save the length as a local var to reduce
// lookup in the loop below
var x:Array = createBlocks( s );
var len:int = x.length;
// loop over all of the blocks
for ( var i:int = 0; i < len; i += 16) {
// save previous values
aa = a;
bb = b;
cc = c;
dd = d;
// Round 1
a = ff( a, b, c, d, x[int(i+ 0)], 7, -680876936 ); // 1
d = ff( d, a, b, c, x[int(i+ 1)], 12, -389564586 ); // 2
c = ff( c, d, a, b, x[int(i+ 2)], 17, 606105819 ); // 3
b = ff( b, c, d, a, x[int(i+ 3)], 22, -1044525330 ); // 4
a = ff( a, b, c, d, x[int(i+ 4)], 7, -176418897 ); // 5
d = ff( d, a, b, c, x[int(i+ 5)], 12, 1200080426 ); // 6
c = ff( c, d, a, b, x[int(i+ 6)], 17, -1473231341 ); // 7
b = ff( b, c, d, a, x[int(i+ 7)], 22, -45705983 ); // 8
a = ff( a, b, c, d, x[int(i+ 8)], 7, 1770035416 ); // 9
d = ff( d, a, b, c, x[int(i+ 9)], 12, -1958414417 ); // 10
c = ff( c, d, a, b, x[int(i+10)], 17, -42063 ); // 11
b = ff( b, c, d, a, x[int(i+11)], 22, -1990404162 ); // 12
a = ff( a, b, c, d, x[int(i+12)], 7, 1804603682 ); // 13
d = ff( d, a, b, c, x[int(i+13)], 12, -40341101 ); // 14
c = ff( c, d, a, b, x[int(i+14)], 17, -1502002290 ); // 15
b = ff( b, c, d, a, x[int(i+15)], 22, 1236535329 ); // 16
// Round 2
a = gg( a, b, c, d, x[int(i+ 1)], 5, -165796510 ); // 17
d = gg( d, a, b, c, x[int(i+ 6)], 9, -1069501632 ); // 18
c = gg( c, d, a, b, x[int(i+11)], 14, 643717713 ); // 19
b = gg( b, c, d, a, x[int(i+ 0)], 20, -373897302 ); // 20
a = gg( a, b, c, d, x[int(i+ 5)], 5, -701558691 ); // 21
d = gg( d, a, b, c, x[int(i+10)], 9, 38016083 ); // 22
c = gg( c, d, a, b, x[int(i+15)], 14, -660478335 ); // 23
b = gg( b, c, d, a, x[int(i+ 4)], 20, -405537848 ); // 24
a = gg( a, b, c, d, x[int(i+ 9)], 5, 568446438 ); // 25
d = gg( d, a, b, c, x[int(i+14)], 9, -1019803690 ); // 26
c = gg( c, d, a, b, x[int(i+ 3)], 14, -187363961 ); // 27
b = gg( b, c, d, a, x[int(i+ 8)], 20, 1163531501 ); // 28
a = gg( a, b, c, d, x[int(i+13)], 5, -1444681467 ); // 29
d = gg( d, a, b, c, x[int(i+ 2)], 9, -51403784 ); // 30
c = gg( c, d, a, b, x[int(i+ 7)], 14, 1735328473 ); // 31
b = gg( b, c, d, a, x[int(i+12)], 20, -1926607734 ); // 32
// Round 3
a = hh( a, b, c, d, x[int(i+ 5)], 4, -378558 ); // 33
d = hh( d, a, b, c, x[int(i+ 8)], 11, -2022574463 ); // 34
c = hh( c, d, a, b, x[int(i+11)], 16, 1839030562 ); // 35
b = hh( b, c, d, a, x[int(i+14)], 23, -35309556 ); // 36
a = hh( a, b, c, d, x[int(i+ 1)], 4, -1530992060 ); // 37
d = hh( d, a, b, c, x[int(i+ 4)], 11, 1272893353 ); // 38
c = hh( c, d, a, b, x[int(i+ 7)], 16, -155497632 ); // 39
b = hh( b, c, d, a, x[int(i+10)], 23, -1094730640 ); // 40
a = hh( a, b, c, d, x[int(i+13)], 4, 681279174 ); // 41
d = hh( d, a, b, c, x[int(i+ 0)], 11, -358537222 ); // 42
c = hh( c, d, a, b, x[int(i+ 3)], 16, -722521979 ); // 43
b = hh( b, c, d, a, x[int(i+ 6)], 23, 76029189 ); // 44
a = hh( a, b, c, d, x[int(i+ 9)], 4, -640364487 ); // 45
d = hh( d, a, b, c, x[int(i+12)], 11, -421815835 ); // 46
c = hh( c, d, a, b, x[int(i+15)], 16, 530742520 ); // 47
b = hh( b, c, d, a, x[int(i+ 2)], 23, -995338651 ); // 48
// Round 4
a = ii( a, b, c, d, x[int(i+ 0)], 6, -198630844 ); // 49
d = ii( d, a, b, c, x[int(i+ 7)], 10, 1126891415 ); // 50
c = ii( c, d, a, b, x[int(i+14)], 15, -1416354905 ); // 51
b = ii( b, c, d, a, x[int(i+ 5)], 21, -57434055 ); // 52
a = ii( a, b, c, d, x[int(i+12)], 6, 1700485571 ); // 53
d = ii( d, a, b, c, x[int(i+ 3)], 10, -1894986606 ); // 54
c = ii( c, d, a, b, x[int(i+10)], 15, -1051523 ); // 55
b = ii( b, c, d, a, x[int(i+ 1)], 21, -2054922799 ); // 56
a = ii( a, b, c, d, x[int(i+ 8)], 6, 1873313359 ); // 57
d = ii( d, a, b, c, x[int(i+15)], 10, -30611744 ); // 58
c = ii( c, d, a, b, x[int(i+ 6)], 15, -1560198380 ); // 59
b = ii( b, c, d, a, x[int(i+13)], 21, 1309151649 ); // 60
a = ii( a, b, c, d, x[int(i+ 4)], 6, -145523070 ); // 61
d = ii( d, a, b, c, x[int(i+11)], 10, -1120210379 ); // 62
c = ii( c, d, a, b, x[int(i+ 2)], 15, 718787259 ); // 63
b = ii( b, c, d, a, x[int(i+ 9)], 21, -343485551 ); // 64
a += aa;
b += bb;
c += cc;
d += dd;
}
digest = new ByteArray()
digest.writeInt(a);
digest.writeInt(b);
digest.writeInt(c);
digest.writeInt(d);
digest.position = 0;
// Finish up by concatening the buffers with their hex output
return IntUtil.toHex( a ) + IntUtil.toHex( b ) + IntUtil.toHex( c ) + IntUtil.toHex( d );
}
/**
* Auxiliary function f as defined in RFC
*/
private static function f( x:int, y:int, z:int ):int {
return ( x & y ) | ( (~x) & z );
}
/**
* Auxiliary function g as defined in RFC
*/
private static function g( x:int, y:int, z:int ):int {
return ( x & z ) | ( y & (~z) );
}
/**
* Auxiliary function h as defined in RFC
*/
private static function h( x:int, y:int, z:int ):int {
return x ^ y ^ z;
}
/**
* Auxiliary function i as defined in RFC
*/
private static function i( x:int, y:int, z:int ):int {
return y ^ ( x | (~z) );
}
/**
* A generic transformation function. The logic of ff, gg, hh, and
* ii are all the same, minus the function used, so pull that logic
* out and simplify the method bodies for the transoformation functions.
*/
private static function transform( func:Function, a:int, b:int, c:int, d:int, x:int, s:int, t:int):int {
var tmp:int = a + int( func( b, c, d ) ) + x + t;
return IntUtil.rol( tmp, s ) + b;
}
/**
* ff transformation function
*/
private static function ff ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
return transform( f, a, b, c, d, x, s, t );
}
/**
* gg transformation function
*/
private static function gg ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
return transform( g, a, b, c, d, x, s, t );
}
/**
* hh transformation function
*/
private static function hh ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
return transform( h, a, b, c, d, x, s, t );
}
/**
* ii transformation function
*/
private static function ii ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
return transform( i, a, b, c, d, x, s, t );
}
/**
* Converts a string to a sequence of 16-word blocks
* that we'll do the processing on. Appends padding
* and length in the process.
*
* @param s The string to split into blocks
* @return An array containing the blocks that s was
* split into.
*/
private static function createBlocks( s:ByteArray ):Array {
var blocks:Array = new Array();
var len:int = s.length * 8;
var mask:int = 0xFF; // ignore hi byte of characters > 0xFF
for( var i:int = 0; i < len; i += 8 ) {
blocks[ int(i >> 5) ] |= ( s[ i / 8 ] & mask ) << ( i % 32 );
}
// append padding and length
blocks[ int(len >> 5) ] |= 0x80 << ( len % 32 );
blocks[ int(( ( ( len + 64 ) >>> 9 ) << 4 ) + 14) ] = len;
return blocks;
}
}
}

402
theme/uploadify/com/adobe/crypto/MD5Stream.as

@ -1,402 +0,0 @@
/*
Copyright (c) 2008, Adobe Systems Incorporated
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* 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.
* Neither the name of Adobe Systems Incorporated nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT OWNER OR
CONTRIBUTORS 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.
*/
package com.adobe.crypto
{
import com.adobe.utils.IntUtil;
import flash.utils.ByteArray;
/**
* Perform MD5 hash of an input stream in chunks. This class is
* based on com.adobe.crypto.MD5 and can process data in
* chunks. Both block creation and hash computation are done
* together for whatever input is available so that the memory
* overhead at a time is always fixed. Memory usage is governed by
* two parameters: one is the amount of data passed in to update()
* and the other is memoryBlockSize. The latter comes into play
* only when the memory window exceeds the pre allocated memory
* window of flash player. Usage: create an instance, call
* update(data) repeatedly for all chunks and finally complete()
* which will return the md5 hash.
*/
public class MD5Stream
{
private static var mask:int = 0xFF;
private var arr:Array = [];
/* running count of length */
private var arrLen:int;
// initialize the md buffers
private var a:int = 1732584193;
private var b:int = -271733879;
private var c:int = -1732584194;
private var d:int = 271733878;
// variables to store previous values
private var aa:int;
private var bb:int;
private var cc:int;
private var dd:int;
/* index for data read */
private var arrIndexLen:int = 0;
/* index for hash computation */
private var arrProcessIndex:int = 0;
/* index for removing stale arr values */
private var cleanIndex:int = 0;
/**
* Change this value from the default (16384) in the range of
* MBs to actually affect GC as GC allocates in pools of
* memory */
public var memoryBlockSize:int = 16384;
public function MD5Stream()
{
}
/**
* Pass in chunks of the input data with update(), call
* complete() with an optional chunk which will return the
* final hash. Equivalent to the way
* java.security.MessageDigest works.
*
* @param input The optional bytearray chunk which is the final part of the input
* @return A string containing the hash value
* @langversion ActionScript 3.0
* @playerversion Flash 8.5
* @tiptext
*/
public function complete(input:ByteArray=null):String
{
if ( arr.length == 0 )
{
if ( input == null )
{
throw new Error("null input to complete without prior call to update. At least an empty bytearray must be passed.");
}
}
if ( input != null )
{
readIntoArray(input);
}
//pad, append length
padArray(arrLen);
hashRemainingChunks(false);
var res:String = IntUtil.toHex( a ) + IntUtil.toHex( b ) +
IntUtil.toHex( c ) + IntUtil.toHex( d );
resetFields();
return res;
}
/**
* Pass in chunks of the input data with update(), call
* complete() with an optional chunk which will return the
* final hash. Equivalent to the way
* java.security.MessageDigest works.
*
* @param input The bytearray chunk to perform the hash on
* @langversion ActionScript 3.0
* @playerversion Flash 8.5
* @tiptext
*/
public function update(input:ByteArray):void
{
readIntoArray(input);
hashRemainingChunks();
}
/**
* Re-initialize this instance for use to perform hashing on
* another input stream. This is called automatically by
* complete().
*
* @langversion ActionScript 3.0
* @playerversion Flash 8.5
* @tiptext
*/
public function resetFields():void
{
//truncate array
arr.length = 0;
arrLen = 0;
// initialize the md buffers
a = 1732584193;
b = -271733879;
c = -1732584194;
d = 271733878;
// variables to store previous values
aa = 0;
bb = 0;
cc = 0;
dd = 0;
arrIndexLen = 0;
arrProcessIndex = 0;
cleanIndex = 0;
}
/** read into arr and free up used blocks of arr */
private function readIntoArray(input:ByteArray):void
{
var closestChunkLen:int = input.length * 8;
arrLen += closestChunkLen;
/* clean up memory. if there are entries in the array that
* are already processed and the amount is greater than
* memoryBlockSize, create a new array, copy the last
* block into it and let the old one get picked up by
* GC. */
if ( arrProcessIndex - cleanIndex > memoryBlockSize )
{
var newarr:Array= new Array();
/* AS Arrays in sparse arrays. arr[2002] can exist
* without values for arr[0] - arr[2001] */
for ( var j:int = arrProcessIndex; j < arr.length; j++ )
{
newarr[j] = arr[j];
}
cleanIndex = arrProcessIndex;
arr = null;
arr = newarr;
}
for ( var k:int = 0; k < closestChunkLen; k+=8 )
{
//discard high bytes (convert to uint)
arr[ int(arrIndexLen >> 5) ] |= ( input[ k / 8 ] & mask ) << ( arrIndexLen % 32 );
arrIndexLen += 8;
}
}
private function hashRemainingChunks(bUpdate:Boolean=true):void
{
var len:int = arr.length;
/* leave a 16 word block untouched if we are called from
* update. This is because, padArray() can modify the last
* block and this modification has to happen before we
* compute the hash. */
if ( bUpdate )
{
len -= 16;
}
/* don't do anything if don't have a 16 word block. */
if ( arrProcessIndex >= len || len - arrProcessIndex < 15 )
{
return;
}
for ( var i:int = arrProcessIndex; i < len ; i += 16, arrProcessIndex += 16)
{
// save previous values
aa = a;
bb = b;
cc = c;
dd = d;
// Round 1
a = ff( a, b, c, d, arr[int(i+ 0)], 7, -680876936 ); // 1
d = ff( d, a, b, c, arr[int(i+ 1)], 12, -389564586 ); // 2
c = ff( c, d, a, b, arr[int(i+ 2)], 17, 606105819 ); // 3
b = ff( b, c, d, a, arr[int(i+ 3)], 22, -1044525330 ); // 4
a = ff( a, b, c, d, arr[int(i+ 4)], 7, -176418897 ); // 5
d = ff( d, a, b, c, arr[int(i+ 5)], 12, 1200080426 ); // 6
c = ff( c, d, a, b, arr[int(i+ 6)], 17, -1473231341 ); // 7
b = ff( b, c, d, a, arr[int(i+ 7)], 22, -45705983 ); // 8
a = ff( a, b, c, d, arr[int(i+ 8)], 7, 1770035416 ); // 9
d = ff( d, a, b, c, arr[int(i+ 9)], 12, -1958414417 ); // 10
c = ff( c, d, a, b, arr[int(i+10)], 17, -42063 ); // 11
b = ff( b, c, d, a, arr[int(i+11)], 22, -1990404162 ); // 12
a = ff( a, b, c, d, arr[int(i+12)], 7, 1804603682 ); // 13
d = ff( d, a, b, c, arr[int(i+13)], 12, -40341101 ); // 14
c = ff( c, d, a, b, arr[int(i+14)], 17, -1502002290 ); // 15
b = ff( b, c, d, a, arr[int(i+15)], 22, 1236535329 ); // 16
// Round 2
a = gg( a, b, c, d, arr[int(i+ 1)], 5, -165796510 ); // 17
d = gg( d, a, b, c, arr[int(i+ 6)], 9, -1069501632 ); // 18
c = gg( c, d, a, b, arr[int(i+11)], 14, 643717713 ); // 19
b = gg( b, c, d, a, arr[int(i+ 0)], 20, -373897302 ); // 20
a = gg( a, b, c, d, arr[int(i+ 5)], 5, -701558691 ); // 21
d = gg( d, a, b, c, arr[int(i+10)], 9, 38016083 ); // 22
c = gg( c, d, a, b, arr[int(i+15)], 14, -660478335 ); // 23
b = gg( b, c, d, a, arr[int(i+ 4)], 20, -405537848 ); // 24
a = gg( a, b, c, d, arr[int(i+ 9)], 5, 568446438 ); // 25
d = gg( d, a, b, c, arr[int(i+14)], 9, -1019803690 ); // 26
c = gg( c, d, a, b, arr[int(i+ 3)], 14, -187363961 ); // 27
b = gg( b, c, d, a, arr[int(i+ 8)], 20, 1163531501 ); // 28
a = gg( a, b, c, d, arr[int(i+13)], 5, -1444681467 ); // 29
d = gg( d, a, b, c, arr[int(i+ 2)], 9, -51403784 ); // 30
c = gg( c, d, a, b, arr[int(i+ 7)], 14, 1735328473 ); // 31
b = gg( b, c, d, a, arr[int(i+12)], 20, -1926607734 ); // 32
// Round 3
a = hh( a, b, c, d, arr[int(i+ 5)], 4, -378558 ); // 33
d = hh( d, a, b, c, arr[int(i+ 8)], 11, -2022574463 ); // 34
c = hh( c, d, a, b, arr[int(i+11)], 16, 1839030562 ); // 35
b = hh( b, c, d, a, arr[int(i+14)], 23, -35309556 ); // 36
a = hh( a, b, c, d, arr[int(i+ 1)], 4, -1530992060 ); // 37
d = hh( d, a, b, c, arr[int(i+ 4)], 11, 1272893353 ); // 38
c = hh( c, d, a, b, arr[int(i+ 7)], 16, -155497632 ); // 39
b = hh( b, c, d, a, arr[int(i+10)], 23, -1094730640 ); // 40
a = hh( a, b, c, d, arr[int(i+13)], 4, 681279174 ); // 41
d = hh( d, a, b, c, arr[int(i+ 0)], 11, -358537222 ); // 42
c = hh( c, d, a, b, arr[int(i+ 3)], 16, -722521979 ); // 43
b = hh( b, c, d, a, arr[int(i+ 6)], 23, 76029189 ); // 44
a = hh( a, b, c, d, arr[int(i+ 9)], 4, -640364487 ); // 45
d = hh( d, a, b, c, arr[int(i+12)], 11, -421815835 ); // 46
c = hh( c, d, a, b, arr[int(i+15)], 16, 530742520 ); // 47
b = hh( b, c, d, a, arr[int(i+ 2)], 23, -995338651 ); // 48
// Round 4
a = ii( a, b, c, d, arr[int(i+ 0)], 6, -198630844 ); // 49
d = ii( d, a, b, c, arr[int(i+ 7)], 10, 1126891415 ); // 50
c = ii( c, d, a, b, arr[int(i+14)], 15, -1416354905 ); // 51
b = ii( b, c, d, a, arr[int(i+ 5)], 21, -57434055 ); // 52
a = ii( a, b, c, d, arr[int(i+12)], 6, 1700485571 ); // 53
d = ii( d, a, b, c, arr[int(i+ 3)], 10, -1894986606 ); // 54
c = ii( c, d, a, b, arr[int(i+10)], 15, -1051523 ); // 55
b = ii( b, c, d, a, arr[int(i+ 1)], 21, -2054922799 ); // 56
a = ii( a, b, c, d, arr[int(i+ 8)], 6, 1873313359 ); // 57
d = ii( d, a, b, c, arr[int(i+15)], 10, -30611744 ); // 58
c = ii( c, d, a, b, arr[int(i+ 6)], 15, -1560198380 ); // 59
b = ii( b, c, d, a, arr[int(i+13)], 21, 1309151649 ); // 60
a = ii( a, b, c, d, arr[int(i+ 4)], 6, -145523070 ); // 61
d = ii( d, a, b, c, arr[int(i+11)], 10, -1120210379 ); // 62
c = ii( c, d, a, b, arr[int(i+ 2)], 15, 718787259 ); // 63
b = ii( b, c, d, a, arr[int(i+ 9)], 21, -343485551 ); // 64
a += aa;
b += bb;
c += cc;
d += dd;
}
}
private function padArray(len:int):void
{
arr[ int(len >> 5) ] |= 0x80 << ( len % 32 );
arr[ int(( ( ( len + 64 ) >>> 9 ) << 4 ) + 14) ] = len;
arrLen = arr.length;
}
/* Code below same as com.adobe.crypto.MD5 */
/**
* Auxiliary function f as defined in RFC
*/
private static function f( x:int, y:int, z:int ):int {
return ( x & y ) | ( (~x) & z );
}
/**
* Auxiliary function g as defined in RFC
*/
private static function g( x:int, y:int, z:int ):int {
return ( x & z ) | ( y & (~z) );
}
/**
* Auxiliary function h as defined in RFC
*/
private static function h( x:int, y:int, z:int ):int {
return x ^ y ^ z;
}
/**
* Auxiliary function i as defined in RFC
*/
private static function i( x:int, y:int, z:int ):int {
return y ^ ( x | (~z) );
}
/**
* A generic transformation function. The logic of ff, gg, hh, and
* ii are all the same, minus the function used, so pull that logic
* out and simplify the method bodies for the transoformation functions.
*/
private static function transform( func:Function, a:int, b:int, c:int, d:int, x:int, s:int, t:int):int {
var tmp:int = a + int( func( b, c, d ) ) + x + t;
return IntUtil.rol( tmp, s ) + b;
}
/**
* ff transformation function
*/
private static function ff ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
return transform( f, a, b, c, d, x, s, t );
}
/**
* gg transformation function
*/
private static function gg ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
return transform( g, a, b, c, d, x, s, t );
}
/**
* hh transformation function
*/
private static function hh ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
return transform( h, a, b, c, d, x, s, t );
}
/**
* ii transformation function
*/
private static function ii ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
return transform( i, a, b, c, d, x, s, t );
}
}
}

271
theme/uploadify/com/adobe/crypto/SHA1.as

@ -1,271 +0,0 @@
/*
Copyright (c) 2008, Adobe Systems Incorporated
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* 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.
* Neither the name of Adobe Systems Incorporated nor the names of its
contributors may be used to endorse or promote products derived from
this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT OWNER OR
CONTRIBUTORS 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.
*/
package com.adobe.crypto
{
import com.adobe.utils.IntUtil;
import flash.utils.ByteArray;
import mx.utils.Base64Encoder;
/**
* US Secure Hash Algorithm 1 (SHA1)
*
* Implementation based on algorithm description at
* http://www.faqs.org/rfcs/rfc3174.html
*/
public class SHA1
{
public static var digest:ByteArray;
/**
* Performs the SHA1 hash algorithm on a string.
*
* @param s The string to hash
* @return A string containing the hash value of s
* @langversion ActionScript 3.0
* @playerversion 9.0
* @tiptext
*/
public static function hash( s:String ):String
{
var blocks:Array = createBlocksFromString( s );
var byteArray:ByteArray = hashBlocks( blocks );
return IntUtil.toHex( byteArray.readInt(), true )
+ IntUtil.toHex( byteArray.readInt(), true )
+ IntUtil.toHex( byteArray.readInt(), true )
+ IntUtil.toHex( byteArray.readInt(), true )
+ IntUtil.toHex( byteArray.readInt(), true );
}
/**
* Performs the SHA1 hash algorithm on a ByteArray.
*
* @param data The ByteArray data to hash
*