|
Server : Apache/2.2.17 (Unix) mod_ssl/2.2.17 OpenSSL/0.9.8e-fips-rhel5 DAV/2 PHP/5.2.17 System : Linux localhost 2.6.18-419.el5 #1 SMP Fri Feb 24 22:47:42 UTC 2017 x86_64 User : nobody ( 99) PHP Version : 5.2.17 Disable Function : NONE Directory : /usr/share/devhelp/books/dbus/api/ |
Upload File : |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>D-Bus: dbus-sha.c Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.4.7 -->
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li id="current"><a href="files.html"><span>Files</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
</ul></div>
<h1>dbus-sha.c</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- mode: C; c-file-style: "gnu"; indent-tabs-mode: nil; -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/* dbus-sha.c SHA-1 implementation</span>
<a name="l00003"></a>00003 <span class="comment"> *</span>
<a name="l00004"></a>00004 <span class="comment"> * Copyright (C) 2003 Red Hat Inc.</span>
<a name="l00005"></a>00005 <span class="comment"> * Copyright (C) 1995 A. M. Kuchling</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * Licensed under the Academic Free License version 2.1</span>
<a name="l00008"></a>00008 <span class="comment"> *</span>
<a name="l00009"></a>00009 <span class="comment"> * This program is free software; you can redistribute it and/or modify</span>
<a name="l00010"></a>00010 <span class="comment"> * it under the terms of the GNU General Public License as published by</span>
<a name="l00011"></a>00011 <span class="comment"> * the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00012"></a>00012 <span class="comment"> * (at your option) any later version.</span>
<a name="l00013"></a>00013 <span class="comment"> *</span>
<a name="l00014"></a>00014 <span class="comment"> * This program is distributed in the hope that it will be useful,</span>
<a name="l00015"></a>00015 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00016"></a>00016 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the</span>
<a name="l00017"></a>00017 <span class="comment"> * GNU General Public License for more details.</span>
<a name="l00018"></a>00018 <span class="comment"> *</span>
<a name="l00019"></a>00019 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00020"></a>00020 <span class="comment"> * along with this program; if not, write to the Free Software</span>
<a name="l00021"></a>00021 <span class="comment"> * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA</span>
<a name="l00022"></a>00022 <span class="comment"> *</span>
<a name="l00023"></a>00023 <span class="comment"> */</span>
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="preprocessor">#include "dbus-internals.h"</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include "dbus-sha.h"</span>
<a name="l00027"></a>00027 <span class="preprocessor">#include "dbus-marshal-basic.h"</span> <span class="comment">/* for byteswap routines */</span>
<a name="l00028"></a>00028 <span class="preprocessor">#include <string.h></span>
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="comment">/* The following comments have the history of where this code</span>
<a name="l00031"></a>00031 <span class="comment"> * comes from. I actually copied it from GNet in GNOME CVS.</span>
<a name="l00032"></a>00032 <span class="comment"> * - hp@redhat.com</span>
<a name="l00033"></a>00033 <span class="comment"> */</span>
<a name="l00034"></a>00034
<a name="l00035"></a>00035 <span class="comment">/*</span>
<a name="l00036"></a>00036 <span class="comment"> * sha.h : Implementation of the Secure Hash Algorithm</span>
<a name="l00037"></a>00037 <span class="comment"> *</span>
<a name="l00038"></a>00038 <span class="comment"> * Part of the Python Cryptography Toolkit, version 1.0.0</span>
<a name="l00039"></a>00039 <span class="comment"> *</span>
<a name="l00040"></a>00040 <span class="comment"> * Copyright (C) 1995, A.M. Kuchling</span>
<a name="l00041"></a>00041 <span class="comment"> *</span>
<a name="l00042"></a>00042 <span class="comment"> * Distribute and use freely; there are no restrictions on further</span>
<a name="l00043"></a>00043 <span class="comment"> * dissemination and usage except those imposed by the laws of your</span>
<a name="l00044"></a>00044 <span class="comment"> * country of residence.</span>
<a name="l00045"></a>00045 <span class="comment"> *</span>
<a name="l00046"></a>00046 <span class="comment"> */</span>
<a name="l00047"></a>00047
<a name="l00048"></a>00048 <span class="comment">/* SHA: NIST's Secure Hash Algorithm */</span>
<a name="l00049"></a>00049
<a name="l00050"></a>00050 <span class="comment">/* Based on SHA code originally posted to sci.crypt by Peter Gutmann</span>
<a name="l00051"></a>00051 <span class="comment"> in message <30ajo5$oe8@ccu2.auckland.ac.nz>.</span>
<a name="l00052"></a>00052 <span class="comment"> Modified to test for endianness on creation of SHA objects by AMK.</span>
<a name="l00053"></a>00053 <span class="comment"> Also, the original specification of SHA was found to have a weakness</span>
<a name="l00054"></a>00054 <span class="comment"> by NSA/NIST. This code implements the fixed version of SHA.</span>
<a name="l00055"></a>00055 <span class="comment">*/</span>
<a name="l00056"></a>00056
<a name="l00057"></a>00057 <span class="comment">/* Here's the first paragraph of Peter Gutmann's posting:</span>
<a name="l00058"></a>00058 <span class="comment"></span>
<a name="l00059"></a>00059 <span class="comment">The following is my SHA (FIPS 180) code updated to allow use of the "fixed"</span>
<a name="l00060"></a>00060 <span class="comment">SHA, thanks to Jim Gillogly and an anonymous contributor for the information on</span>
<a name="l00061"></a>00061 <span class="comment">what's changed in the new version. The fix is a simple change which involves</span>
<a name="l00062"></a>00062 <span class="comment">adding a single rotate in the initial expansion function. It is unknown</span>
<a name="l00063"></a>00063 <span class="comment">whether this is an optimal solution to the problem which was discovered in the</span>
<a name="l00064"></a>00064 <span class="comment">SHA or whether it's simply a bandaid which fixes the problem with a minimum of</span>
<a name="l00065"></a>00065 <span class="comment">effort (for example the reengineering of a great many Capstone chips).</span>
<a name="l00066"></a>00066 <span class="comment">*/</span>
<a name="l00067"></a>00067
<a name="l00087"></a>00087 <span class="preprocessor">#ifndef DOXYGEN_SHOULD_SKIP_THIS</span>
<a name="l00088"></a>00088 <span class="preprocessor"></span>
<a name="l00089"></a>00089 <span class="comment">/* The SHA block size and message digest sizes, in bytes */</span>
<a name="l00090"></a>00090
<a name="l00091"></a>00091 <span class="preprocessor">#define SHA_DATASIZE 64</span>
<a name="l00092"></a>00092 <span class="preprocessor"></span><span class="preprocessor">#define SHA_DIGESTSIZE 20</span>
<a name="l00093"></a>00093 <span class="preprocessor"></span>
<a name="l00094"></a>00094 <span class="comment">/* The SHA f()-functions. The f1 and f3 functions can be optimized to</span>
<a name="l00095"></a>00095 <span class="comment"> save one boolean operation each - thanks to Rich Schroeppel,</span>
<a name="l00096"></a>00096 <span class="comment"> rcs@cs.arizona.edu for discovering this */</span>
<a name="l00097"></a>00097
<a name="l00098"></a>00098 <span class="comment">/*#define f1(x,y,z) ( ( x & y ) | ( ~x & z ) ) // Rounds 0-19 */</span>
<a name="l00099"></a>00099 <span class="preprocessor">#define f1(x,y,z) ( z ^ ( x & ( y ^ z ) ) ) </span><span class="comment">/* Rounds 0-19 */</span>
<a name="l00100"></a>00100 <span class="preprocessor">#define f2(x,y,z) ( x ^ y ^ z ) </span><span class="comment">/* Rounds 20-39 */</span>
<a name="l00101"></a>00101 <span class="comment">/*#define f3(x,y,z) ( ( x & y ) | ( x & z ) | ( y & z ) ) // Rounds 40-59 */</span>
<a name="l00102"></a>00102 <span class="preprocessor">#define f3(x,y,z) ( ( x & y ) | ( z & ( x | y ) ) ) </span><span class="comment">/* Rounds 40-59 */</span>
<a name="l00103"></a>00103 <span class="preprocessor">#define f4(x,y,z) ( x ^ y ^ z ) </span><span class="comment">/* Rounds 60-79 */</span>
<a name="l00104"></a>00104
<a name="l00105"></a>00105 <span class="comment">/* The SHA Mysterious Constants */</span>
<a name="l00106"></a>00106
<a name="l00107"></a>00107 <span class="preprocessor">#define K1 0x5A827999L </span><span class="comment">/* Rounds 0-19 */</span>
<a name="l00108"></a>00108 <span class="preprocessor">#define K2 0x6ED9EBA1L </span><span class="comment">/* Rounds 20-39 */</span>
<a name="l00109"></a>00109 <span class="preprocessor">#define K3 0x8F1BBCDCL </span><span class="comment">/* Rounds 40-59 */</span>
<a name="l00110"></a>00110 <span class="preprocessor">#define K4 0xCA62C1D6L </span><span class="comment">/* Rounds 60-79 */</span>
<a name="l00111"></a>00111
<a name="l00112"></a>00112 <span class="comment">/* SHA initial values */</span>
<a name="l00113"></a>00113
<a name="l00114"></a>00114 <span class="preprocessor">#define h0init 0x67452301L</span>
<a name="l00115"></a>00115 <span class="preprocessor"></span><span class="preprocessor">#define h1init 0xEFCDAB89L</span>
<a name="l00116"></a>00116 <span class="preprocessor"></span><span class="preprocessor">#define h2init 0x98BADCFEL</span>
<a name="l00117"></a>00117 <span class="preprocessor"></span><span class="preprocessor">#define h3init 0x10325476L</span>
<a name="l00118"></a>00118 <span class="preprocessor"></span><span class="preprocessor">#define h4init 0xC3D2E1F0L</span>
<a name="l00119"></a>00119 <span class="preprocessor"></span>
<a name="l00120"></a>00120 <span class="comment">/* Note that it may be necessary to add parentheses to these macros if they</span>
<a name="l00121"></a>00121 <span class="comment"> are to be called with expressions as arguments */</span>
<a name="l00122"></a>00122 <span class="comment">/* 32-bit rotate left - kludged with shifts */</span>
<a name="l00123"></a>00123
<a name="l00124"></a>00124 <span class="preprocessor">#define ROTL(n,X) ( ( ( X ) << n ) | ( ( X ) >> ( 32 - n ) ) )</span>
<a name="l00125"></a>00125 <span class="preprocessor"></span>
<a name="l00126"></a>00126 <span class="comment">/* The initial expanding function. The hash function is defined over an</span>
<a name="l00127"></a>00127 <span class="comment"> 80-word expanded input array W, where the first 16 are copies of the input</span>
<a name="l00128"></a>00128 <span class="comment"> data, and the remaining 64 are defined by</span>
<a name="l00129"></a>00129 <span class="comment"></span>
<a name="l00130"></a>00130 <span class="comment"> W[ i ] = W[ i - 16 ] ^ W[ i - 14 ] ^ W[ i - 8 ] ^ W[ i - 3 ]</span>
<a name="l00131"></a>00131 <span class="comment"></span>
<a name="l00132"></a>00132 <span class="comment"> This implementation generates these values on the fly in a circular</span>
<a name="l00133"></a>00133 <span class="comment"> buffer - thanks to Colin Plumb, colin@nyx10.cs.du.edu for this</span>
<a name="l00134"></a>00134 <span class="comment"> optimization.</span>
<a name="l00135"></a>00135 <span class="comment"></span>
<a name="l00136"></a>00136 <span class="comment"> The updated SHA changes the expanding function by adding a rotate of 1</span>
<a name="l00137"></a>00137 <span class="comment"> bit. Thanks to Jim Gillogly, jim@rand.org, and an anonymous contributor</span>
<a name="l00138"></a>00138 <span class="comment"> for this information */</span>
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="preprocessor">#define expand(W,i) ( W[ i & 15 ] = ROTL( 1, ( W[ i & 15 ] ^ W[ (i - 14) & 15 ] ^ \</span>
<a name="l00141"></a>00141 <span class="preprocessor"> W[ (i - 8) & 15 ] ^ W[ (i - 3) & 15 ] ) ) )</span>
<a name="l00142"></a>00142 <span class="preprocessor"></span>
<a name="l00143"></a>00143
<a name="l00144"></a>00144 <span class="comment">/* The prototype SHA sub-round. The fundamental sub-round is:</span>
<a name="l00145"></a>00145 <span class="comment"></span>
<a name="l00146"></a>00146 <span class="comment"> a' = e + ROTL( 5, a ) + f( b, c, d ) + k + data;</span>
<a name="l00147"></a>00147 <span class="comment"> b' = a;</span>
<a name="l00148"></a>00148 <span class="comment"> c' = ROTL( 30, b );</span>
<a name="l00149"></a>00149 <span class="comment"> d' = c;</span>
<a name="l00150"></a>00150 <span class="comment"> e' = d;</span>
<a name="l00151"></a>00151 <span class="comment"></span>
<a name="l00152"></a>00152 <span class="comment"> but this is implemented by unrolling the loop 5 times and renaming the</span>
<a name="l00153"></a>00153 <span class="comment"> variables ( e, a, b, c, d ) = ( a', b', c', d', e' ) each iteration.</span>
<a name="l00154"></a>00154 <span class="comment"> This code is then replicated 20 times for each of the 4 functions, using</span>
<a name="l00155"></a>00155 <span class="comment"> the next 20 values from the W[] array each time */</span>
<a name="l00156"></a>00156
<a name="l00157"></a>00157 <span class="preprocessor">#define subRound(a, b, c, d, e, f, k, data) \</span>
<a name="l00158"></a>00158 <span class="preprocessor"> ( e += ROTL( 5, a ) + f( b, c, d ) + k + data, b = ROTL( 30, b ) )</span>
<a name="l00159"></a>00159 <span class="preprocessor"></span>
<a name="l00160"></a>00160 <span class="preprocessor">#endif </span><span class="comment">/* !DOXYGEN_SHOULD_SKIP_THIS */</span>
<a name="l00161"></a>00161
<a name="l00162"></a>00162 <span class="comment">/* Perform the SHA transformation. Note that this code, like MD5, seems to</span>
<a name="l00163"></a>00163 <span class="comment"> break some optimizing compilers due to the complexity of the expressions</span>
<a name="l00164"></a>00164 <span class="comment"> and the size of the basic block. It may be necessary to split it into</span>
<a name="l00165"></a>00165 <span class="comment"> sections, e.g. based on the four subrounds</span>
<a name="l00166"></a>00166 <span class="comment"></span>
<a name="l00167"></a>00167 <span class="comment"> Note that this corrupts the context->data area */</span>
<a name="l00168"></a>00168
<a name="l00169"></a>00169 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00170"></a>00170 SHATransform(<a class="code" href="group__DBusTypes.html#gf513803b030613a669cc7ef199f90a8b">dbus_uint32_t</a> *digest, <a class="code" href="group__DBusTypes.html#gf513803b030613a669cc7ef199f90a8b">dbus_uint32_t</a> *data)
<a name="l00171"></a>00171 {
<a name="l00172"></a>00172 <a class="code" href="group__DBusTypes.html#gf513803b030613a669cc7ef199f90a8b">dbus_uint32_t</a> A, B, C, D, E; <span class="comment">/* Local vars */</span>
<a name="l00173"></a>00173 <a class="code" href="group__DBusTypes.html#gf513803b030613a669cc7ef199f90a8b">dbus_uint32_t</a> eData[16]; <span class="comment">/* Expanded data */</span>
<a name="l00174"></a>00174
<a name="l00175"></a>00175 <span class="comment">/* Set up first buffer and local data buffer */</span>
<a name="l00176"></a>00176 A = digest[0];
<a name="l00177"></a>00177 B = digest[1];
<a name="l00178"></a>00178 C = digest[2];
<a name="l00179"></a>00179 D = digest[3];
<a name="l00180"></a>00180 E = digest[4];
<a name="l00181"></a>00181 memmove (eData, data, SHA_DATASIZE);
<a name="l00182"></a>00182
<a name="l00183"></a>00183 <span class="comment">/* Heavy mangling, in 4 sub-rounds of 20 interations each. */</span>
<a name="l00184"></a>00184 subRound (A, B, C, D, E, f1, K1, eData[0]);
<a name="l00185"></a>00185 subRound (E, A, B, C, D, f1, K1, eData[1]);
<a name="l00186"></a>00186 subRound (D, E, A, B, C, f1, K1, eData[2]);
<a name="l00187"></a>00187 subRound (C, D, E, A, B, f1, K1, eData[3]);
<a name="l00188"></a>00188 subRound (B, C, D, E, A, f1, K1, eData[4]);
<a name="l00189"></a>00189 subRound (A, B, C, D, E, f1, K1, eData[5]);
<a name="l00190"></a>00190 subRound (E, A, B, C, D, f1, K1, eData[6]);
<a name="l00191"></a>00191 subRound (D, E, A, B, C, f1, K1, eData[7]);
<a name="l00192"></a>00192 subRound (C, D, E, A, B, f1, K1, eData[8]);
<a name="l00193"></a>00193 subRound (B, C, D, E, A, f1, K1, eData[9]);
<a name="l00194"></a>00194 subRound (A, B, C, D, E, f1, K1, eData[10]);
<a name="l00195"></a>00195 subRound (E, A, B, C, D, f1, K1, eData[11]);
<a name="l00196"></a>00196 subRound (D, E, A, B, C, f1, K1, eData[12]);
<a name="l00197"></a>00197 subRound (C, D, E, A, B, f1, K1, eData[13]);
<a name="l00198"></a>00198 subRound (B, C, D, E, A, f1, K1, eData[14]);
<a name="l00199"></a>00199 subRound (A, B, C, D, E, f1, K1, eData[15]);
<a name="l00200"></a>00200 subRound (E, A, B, C, D, f1, K1, expand ( eData, 16) );
<a name="l00201"></a>00201 subRound (D, E, A, B, C, f1, K1, expand ( eData, 17) );
<a name="l00202"></a>00202 subRound (C, D, E, A, B, f1, K1, expand ( eData, 18) );
<a name="l00203"></a>00203 subRound (B, C, D, E, A, f1, K1, expand ( eData, 19) );
<a name="l00204"></a>00204
<a name="l00205"></a>00205 subRound (A, B, C, D, E, f2, K2, expand ( eData, 20) );
<a name="l00206"></a>00206 subRound (E, A, B, C, D, f2, K2, expand ( eData, 21) );
<a name="l00207"></a>00207 subRound (D, E, A, B, C, f2, K2, expand ( eData, 22) );
<a name="l00208"></a>00208 subRound (C, D, E, A, B, f2, K2, expand ( eData, 23) );
<a name="l00209"></a>00209 subRound (B, C, D, E, A, f2, K2, expand ( eData, 24) );
<a name="l00210"></a>00210 subRound (A, B, C, D, E, f2, K2, expand ( eData, 25) );
<a name="l00211"></a>00211 subRound (E, A, B, C, D, f2, K2, expand ( eData, 26) );
<a name="l00212"></a>00212 subRound (D, E, A, B, C, f2, K2, expand ( eData, 27) );
<a name="l00213"></a>00213 subRound (C, D, E, A, B, f2, K2, expand ( eData, 28) );
<a name="l00214"></a>00214 subRound (B, C, D, E, A, f2, K2, expand ( eData, 29) );
<a name="l00215"></a>00215 subRound (A, B, C, D, E, f2, K2, expand ( eData, 30) );
<a name="l00216"></a>00216 subRound (E, A, B, C, D, f2, K2, expand ( eData, 31) );
<a name="l00217"></a>00217 subRound (D, E, A, B, C, f2, K2, expand ( eData, 32) );
<a name="l00218"></a>00218 subRound (C, D, E, A, B, f2, K2, expand ( eData, 33) );
<a name="l00219"></a>00219 subRound (B, C, D, E, A, f2, K2, expand ( eData, 34) );
<a name="l00220"></a>00220 subRound (A, B, C, D, E, f2, K2, expand ( eData, 35) );
<a name="l00221"></a>00221 subRound (E, A, B, C, D, f2, K2, expand ( eData, 36) );
<a name="l00222"></a>00222 subRound (D, E, A, B, C, f2, K2, expand ( eData, 37) );
<a name="l00223"></a>00223 subRound (C, D, E, A, B, f2, K2, expand ( eData, 38) );
<a name="l00224"></a>00224 subRound (B, C, D, E, A, f2, K2, expand ( eData, 39) );
<a name="l00225"></a>00225
<a name="l00226"></a>00226 subRound (A, B, C, D, E, f3, K3, expand ( eData, 40) );
<a name="l00227"></a>00227 subRound (E, A, B, C, D, f3, K3, expand ( eData, 41) );
<a name="l00228"></a>00228 subRound (D, E, A, B, C, f3, K3, expand ( eData, 42) );
<a name="l00229"></a>00229 subRound (C, D, E, A, B, f3, K3, expand ( eData, 43) );
<a name="l00230"></a>00230 subRound (B, C, D, E, A, f3, K3, expand ( eData, 44) );
<a name="l00231"></a>00231 subRound (A, B, C, D, E, f3, K3, expand ( eData, 45) );
<a name="l00232"></a>00232 subRound (E, A, B, C, D, f3, K3, expand ( eData, 46) );
<a name="l00233"></a>00233 subRound (D, E, A, B, C, f3, K3, expand ( eData, 47) );
<a name="l00234"></a>00234 subRound (C, D, E, A, B, f3, K3, expand ( eData, 48) );
<a name="l00235"></a>00235 subRound (B, C, D, E, A, f3, K3, expand ( eData, 49) );
<a name="l00236"></a>00236 subRound (A, B, C, D, E, f3, K3, expand ( eData, 50) );
<a name="l00237"></a>00237 subRound (E, A, B, C, D, f3, K3, expand ( eData, 51) );
<a name="l00238"></a>00238 subRound (D, E, A, B, C, f3, K3, expand ( eData, 52) );
<a name="l00239"></a>00239 subRound (C, D, E, A, B, f3, K3, expand ( eData, 53) );
<a name="l00240"></a>00240 subRound (B, C, D, E, A, f3, K3, expand ( eData, 54) );
<a name="l00241"></a>00241 subRound (A, B, C, D, E, f3, K3, expand ( eData, 55) );
<a name="l00242"></a>00242 subRound (E, A, B, C, D, f3, K3, expand ( eData, 56) );
<a name="l00243"></a>00243 subRound (D, E, A, B, C, f3, K3, expand ( eData, 57) );
<a name="l00244"></a>00244 subRound (C, D, E, A, B, f3, K3, expand ( eData, 58) );
<a name="l00245"></a>00245 subRound (B, C, D, E, A, f3, K3, expand ( eData, 59) );
<a name="l00246"></a>00246
<a name="l00247"></a>00247 subRound (A, B, C, D, E, f4, K4, expand ( eData, 60) );
<a name="l00248"></a>00248 subRound (E, A, B, C, D, f4, K4, expand ( eData, 61) );
<a name="l00249"></a>00249 subRound (D, E, A, B, C, f4, K4, expand ( eData, 62) );
<a name="l00250"></a>00250 subRound (C, D, E, A, B, f4, K4, expand ( eData, 63) );
<a name="l00251"></a>00251 subRound (B, C, D, E, A, f4, K4, expand ( eData, 64) );
<a name="l00252"></a>00252 subRound (A, B, C, D, E, f4, K4, expand ( eData, 65) );
<a name="l00253"></a>00253 subRound (E, A, B, C, D, f4, K4, expand ( eData, 66) );
<a name="l00254"></a>00254 subRound (D, E, A, B, C, f4, K4, expand ( eData, 67) );
<a name="l00255"></a>00255 subRound (C, D, E, A, B, f4, K4, expand ( eData, 68) );
<a name="l00256"></a>00256 subRound (B, C, D, E, A, f4, K4, expand ( eData, 69) );
<a name="l00257"></a>00257 subRound (A, B, C, D, E, f4, K4, expand ( eData, 70) );
<a name="l00258"></a>00258 subRound (E, A, B, C, D, f4, K4, expand ( eData, 71) );
<a name="l00259"></a>00259 subRound (D, E, A, B, C, f4, K4, expand ( eData, 72) );
<a name="l00260"></a>00260 subRound (C, D, E, A, B, f4, K4, expand ( eData, 73) );
<a name="l00261"></a>00261 subRound (B, C, D, E, A, f4, K4, expand ( eData, 74) );
<a name="l00262"></a>00262 subRound (A, B, C, D, E, f4, K4, expand ( eData, 75) );
<a name="l00263"></a>00263 subRound (E, A, B, C, D, f4, K4, expand ( eData, 76) );
<a name="l00264"></a>00264 subRound (D, E, A, B, C, f4, K4, expand ( eData, 77) );
<a name="l00265"></a>00265 subRound (C, D, E, A, B, f4, K4, expand ( eData, 78) );
<a name="l00266"></a>00266 subRound (B, C, D, E, A, f4, K4, expand ( eData, 79) );
<a name="l00267"></a>00267
<a name="l00268"></a>00268 <span class="comment">/* Build message digest */</span>
<a name="l00269"></a>00269 digest[0] += A;
<a name="l00270"></a>00270 digest[1] += B;
<a name="l00271"></a>00271 digest[2] += C;
<a name="l00272"></a>00272 digest[3] += D;
<a name="l00273"></a>00273 digest[4] += E;
<a name="l00274"></a>00274 }
<a name="l00275"></a>00275
<a name="l00276"></a>00276 <span class="comment">/* When run on a little-endian CPU we need to perform byte reversal on an</span>
<a name="l00277"></a>00277 <span class="comment"> array of longwords. */</span>
<a name="l00278"></a>00278
<a name="l00279"></a>00279 <span class="preprocessor">#ifdef WORDS_BIGENDIAN</span>
<a name="l00280"></a>00280 <span class="preprocessor"></span><span class="preprocessor">#define swap_words(buffer, byte_count)</span>
<a name="l00281"></a>00281 <span class="preprocessor"></span><span class="preprocessor">#else</span>
<a name="l00282"></a>00282 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00283"></a>00283 swap_words (<a class="code" href="group__DBusTypes.html#gf513803b030613a669cc7ef199f90a8b">dbus_uint32_t</a> *buffer,
<a name="l00284"></a>00284 <span class="keywordtype">int</span> byte_count)
<a name="l00285"></a>00285 {
<a name="l00286"></a>00286 byte_count /= <span class="keyword">sizeof</span> (<a class="code" href="group__DBusTypes.html#gf513803b030613a669cc7ef199f90a8b">dbus_uint32_t</a>);
<a name="l00287"></a>00287 <span class="keywordflow">while</span> (byte_count--)
<a name="l00288"></a>00288 {
<a name="l00289"></a>00289 *buffer = DBUS_UINT32_SWAP_LE_BE (*buffer);
<a name="l00290"></a>00290 ++buffer;
<a name="l00291"></a>00291 }
<a name="l00292"></a>00292 }
<a name="l00293"></a>00293 <span class="preprocessor">#endif</span>
<a name="l00294"></a>00294 <span class="preprocessor"></span>
<a name="l00295"></a>00295 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00296"></a>00296 sha_init (<a class="code" href="structDBusSHAContext.html">DBusSHAContext</a> *context)
<a name="l00297"></a>00297 {
<a name="l00298"></a>00298 <span class="comment">/* Set the h-vars to their initial values */</span>
<a name="l00299"></a>00299 context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>[0] = h0init;
<a name="l00300"></a>00300 context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>[1] = h1init;
<a name="l00301"></a>00301 context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>[2] = h2init;
<a name="l00302"></a>00302 context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>[3] = h3init;
<a name="l00303"></a>00303 context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>[4] = h4init;
<a name="l00304"></a>00304
<a name="l00305"></a>00305 <span class="comment">/* Initialise bit count */</span>
<a name="l00306"></a>00306 context-><a class="code" href="structDBusSHAContext.html#e2b4ae8398c5964afc95ba9917a57d4b">count_lo</a> = context-><a class="code" href="structDBusSHAContext.html#eca9b10f90c5c1e0e52a82b801ac4ab5">count_hi</a> = 0;
<a name="l00307"></a>00307 }
<a name="l00308"></a>00308
<a name="l00309"></a>00309 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00310"></a>00310 sha_append (<a class="code" href="structDBusSHAContext.html">DBusSHAContext</a> *context,
<a name="l00311"></a>00311 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *buffer,
<a name="l00312"></a>00312 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> count)
<a name="l00313"></a>00313 {
<a name="l00314"></a>00314 <a class="code" href="group__DBusTypes.html#gf513803b030613a669cc7ef199f90a8b">dbus_uint32_t</a> tmp;
<a name="l00315"></a>00315 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> dataCount;
<a name="l00316"></a>00316
<a name="l00317"></a>00317 <span class="comment">/* Update bitcount */</span>
<a name="l00318"></a>00318 tmp = context-><a class="code" href="structDBusSHAContext.html#e2b4ae8398c5964afc95ba9917a57d4b">count_lo</a>;
<a name="l00319"></a>00319 <span class="keywordflow">if</span> (( context-><a class="code" href="structDBusSHAContext.html#e2b4ae8398c5964afc95ba9917a57d4b">count_lo</a> = tmp + ( ( <a class="code" href="group__DBusTypes.html#gf513803b030613a669cc7ef199f90a8b">dbus_uint32_t</a>) count << 3) ) < tmp)
<a name="l00320"></a>00320 context-><a class="code" href="structDBusSHAContext.html#eca9b10f90c5c1e0e52a82b801ac4ab5">count_hi</a>++; <span class="comment">/* Carry from low to high */</span>
<a name="l00321"></a>00321 context-><a class="code" href="structDBusSHAContext.html#eca9b10f90c5c1e0e52a82b801ac4ab5">count_hi</a> += count >> 29;
<a name="l00322"></a>00322
<a name="l00323"></a>00323 <span class="comment">/* Get count of bytes already in data */</span>
<a name="l00324"></a>00324 dataCount = (int) (tmp >> 3) & 0x3F;
<a name="l00325"></a>00325
<a name="l00326"></a>00326 <span class="comment">/* Handle any leading odd-sized chunks */</span>
<a name="l00327"></a>00327 <span class="keywordflow">if</span> (dataCount)
<a name="l00328"></a>00328 {
<a name="l00329"></a>00329 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *p = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *) context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a> + dataCount;
<a name="l00330"></a>00330
<a name="l00331"></a>00331 dataCount = SHA_DATASIZE - dataCount;
<a name="l00332"></a>00332 if (count < dataCount)
<a name="l00333"></a>00333 {
<a name="l00334"></a>00334 memmove (p, buffer, count);
<a name="l00335"></a>00335 <span class="keywordflow">return</span>;
<a name="l00336"></a>00336 }
<a name="l00337"></a>00337 memmove (p, buffer, dataCount);
<a name="l00338"></a>00338 swap_words (context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>, SHA_DATASIZE);
<a name="l00339"></a>00339 SHATransform (context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>, context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>);
<a name="l00340"></a>00340 buffer += dataCount;
<a name="l00341"></a>00341 count -= dataCount;
<a name="l00342"></a>00342 }
<a name="l00343"></a>00343
<a name="l00344"></a>00344 <span class="comment">/* Process data in SHA_DATASIZE chunks */</span>
<a name="l00345"></a>00345 <span class="keywordflow">while</span> (count >= SHA_DATASIZE)
<a name="l00346"></a>00346 {
<a name="l00347"></a>00347 memmove (context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>, buffer, SHA_DATASIZE);
<a name="l00348"></a>00348 swap_words (context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>, SHA_DATASIZE);
<a name="l00349"></a>00349 SHATransform (context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>, context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>);
<a name="l00350"></a>00350 buffer += SHA_DATASIZE;
<a name="l00351"></a>00351 count -= SHA_DATASIZE;
<a name="l00352"></a>00352 }
<a name="l00353"></a>00353
<a name="l00354"></a>00354 <span class="comment">/* Handle any remaining bytes of data. */</span>
<a name="l00355"></a>00355 memmove (context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>, buffer, count);
<a name="l00356"></a>00356 }
<a name="l00357"></a>00357
<a name="l00358"></a>00358
<a name="l00359"></a>00359 <span class="comment">/* Final wrapup - pad to SHA_DATASIZE-byte boundary with the bit pattern</span>
<a name="l00360"></a>00360 <span class="comment"> 1 0* (64-bit count of bits processed, MSB-first) */</span>
<a name="l00361"></a>00361
<a name="l00362"></a>00362 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00363"></a>00363 sha_finish (<a class="code" href="structDBusSHAContext.html">DBusSHAContext</a> *context, <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> digest[20])
<a name="l00364"></a>00364 {
<a name="l00365"></a>00365 <span class="keywordtype">int</span> count;
<a name="l00366"></a>00366 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *data_p;
<a name="l00367"></a>00367
<a name="l00368"></a>00368 <span class="comment">/* Compute number of bytes mod 64 */</span>
<a name="l00369"></a>00369 count = (int) context-><a class="code" href="structDBusSHAContext.html#e2b4ae8398c5964afc95ba9917a57d4b">count_lo</a>;
<a name="l00370"></a>00370 count = (count >> 3) & 0x3F;
<a name="l00371"></a>00371
<a name="l00372"></a>00372 <span class="comment">/* Set the first char of padding to 0x80. This is safe since there is</span>
<a name="l00373"></a>00373 <span class="comment"> always at least one byte free */</span>
<a name="l00374"></a>00374 data_p = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *) context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a> + count;
<a name="l00375"></a>00375 *data_p++ = 0x80;
<a name="l00376"></a>00376
<a name="l00377"></a>00377 <span class="comment">/* Bytes of padding needed to make 64 bytes */</span>
<a name="l00378"></a>00378 count = SHA_DATASIZE - 1 - count;
<a name="l00379"></a>00379
<a name="l00380"></a>00380 <span class="comment">/* Pad out to 56 mod 64 */</span>
<a name="l00381"></a>00381 if (count < 8)
<a name="l00382"></a>00382 {
<a name="l00383"></a>00383 <span class="comment">/* Two lots of padding: Pad the first block to 64 bytes */</span>
<a name="l00384"></a>00384 memset (data_p, 0, count);
<a name="l00385"></a>00385 swap_words (context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>, SHA_DATASIZE);
<a name="l00386"></a>00386 SHATransform (context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>, context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>);
<a name="l00387"></a>00387
<a name="l00388"></a>00388 <span class="comment">/* Now fill the next block with 56 bytes */</span>
<a name="l00389"></a>00389 memset (context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>, 0, SHA_DATASIZE - 8);
<a name="l00390"></a>00390 }
<a name="l00391"></a>00391 <span class="keywordflow">else</span>
<a name="l00392"></a>00392 <span class="comment">/* Pad block to 56 bytes */</span>
<a name="l00393"></a>00393 memset (data_p, 0, count - 8);
<a name="l00394"></a>00394
<a name="l00395"></a>00395 <span class="comment">/* Append length in bits and transform */</span>
<a name="l00396"></a>00396 context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>[14] = context-><a class="code" href="structDBusSHAContext.html#eca9b10f90c5c1e0e52a82b801ac4ab5">count_hi</a>;
<a name="l00397"></a>00397 context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>[15] = context-><a class="code" href="structDBusSHAContext.html#e2b4ae8398c5964afc95ba9917a57d4b">count_lo</a>;
<a name="l00398"></a>00398
<a name="l00399"></a>00399 swap_words (context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>, SHA_DATASIZE - 8);
<a name="l00400"></a>00400 SHATransform (context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>, context-><a class="code" href="structDBusSHAContext.html#e1e37d926014364a9e5ca569bf4fe798">data</a>);
<a name="l00401"></a>00401 swap_words (context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>, SHA_DIGESTSIZE);
<a name="l00402"></a>00402 memmove (digest, context-><a class="code" href="structDBusSHAContext.html#4fe941dec79829ea0f0695ede84bcad2">digest</a>, SHA_DIGESTSIZE);
<a name="l00403"></a>00403 }
<a name="l00404"></a>00404 <span class="comment">/* End of internals */</span>
<a name="l00406"></a>00406
<a name="l00418"></a>00418 <span class="keywordtype">void</span>
<a name="l00419"></a><a class="code" href="group__DBusSHA.html#ge7c1a8ad734655b70e67e9a1498465f7">00419</a> <a class="code" href="group__DBusSHA.html#ge7c1a8ad734655b70e67e9a1498465f7">_dbus_sha_init</a> (<a class="code" href="structDBusSHAContext.html">DBusSHAContext</a> *context)
<a name="l00420"></a>00420 {
<a name="l00421"></a>00421 sha_init (context);
<a name="l00422"></a>00422 }
<a name="l00423"></a>00423
<a name="l00430"></a>00430 <span class="keywordtype">void</span>
<a name="l00431"></a><a class="code" href="group__DBusSHA.html#ge9c5e5cd39e2dc151ef1c54819aef3b6">00431</a> <a class="code" href="group__DBusSHA.html#ge9c5e5cd39e2dc151ef1c54819aef3b6">_dbus_sha_update</a> (<a class="code" href="structDBusSHAContext.html">DBusSHAContext</a> *context,
<a name="l00432"></a>00432 <span class="keyword">const</span> <a class="code" href="structDBusString.html">DBusString</a> *data)
<a name="l00433"></a>00433 {
<a name="l00434"></a>00434 <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> inputLen;
<a name="l00435"></a>00435 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *input;
<a name="l00436"></a>00436
<a name="l00437"></a>00437 input = (<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*) _dbus_string_get_const_data (data);
<a name="l00438"></a>00438 inputLen = _dbus_string_get_length (data);
<a name="l00439"></a>00439
<a name="l00440"></a>00440 sha_append (context, input, inputLen);
<a name="l00441"></a>00441 }
<a name="l00442"></a>00442
<a name="l00454"></a>00454 <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a>
<a name="l00455"></a><a class="code" href="group__DBusSHA.html#gf685311db11cc2e6b38fc62d171311e4">00455</a> <a class="code" href="group__DBusSHA.html#gf685311db11cc2e6b38fc62d171311e4">_dbus_sha_final</a> (<a class="code" href="structDBusSHAContext.html">DBusSHAContext</a> *context,
<a name="l00456"></a>00456 <a class="code" href="structDBusString.html">DBusString</a> *results)
<a name="l00457"></a>00457 {
<a name="l00458"></a>00458 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> digest[20];
<a name="l00459"></a>00459
<a name="l00460"></a>00460 sha_finish (context, digest);
<a name="l00461"></a>00461
<a name="l00462"></a>00462 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g724656b7091b910965bd1af42d0b7bab">_dbus_string_append_len</a> (results, digest, 20))
<a name="l00463"></a>00463 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00464"></a>00464
<a name="l00465"></a>00465 <span class="comment">/* some kind of security paranoia, though it seems pointless</span>
<a name="l00466"></a>00466 <span class="comment"> * to me given the nonzeroed stuff flying around</span>
<a name="l00467"></a>00467 <span class="comment"> */</span>
<a name="l00468"></a>00468 memset ((<span class="keywordtype">void</span>*)context, <span class="charliteral">'\0'</span>, <span class="keyword">sizeof</span> (<a class="code" href="structDBusSHAContext.html">DBusSHAContext</a>));
<a name="l00469"></a>00469
<a name="l00470"></a>00470 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga8cecfc5c5c054d2875c03e77b7be15d">TRUE</a>;
<a name="l00471"></a>00471 }
<a name="l00472"></a>00472
<a name="l00481"></a>00481 <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a>
<a name="l00482"></a><a class="code" href="group__DBusSHA.html#g4278fb9df967943834c4ad6332f2c28b">00482</a> <a class="code" href="group__DBusSHA.html#g4278fb9df967943834c4ad6332f2c28b">_dbus_sha_compute</a> (<span class="keyword">const</span> <a class="code" href="structDBusString.html">DBusString</a> *data,
<a name="l00483"></a>00483 <a class="code" href="structDBusString.html">DBusString</a> *ascii_output)
<a name="l00484"></a>00484 {
<a name="l00485"></a>00485 <a class="code" href="structDBusSHAContext.html">DBusSHAContext</a> context;
<a name="l00486"></a>00486 <a class="code" href="structDBusString.html">DBusString</a> digest;
<a name="l00487"></a>00487
<a name="l00488"></a>00488 <a class="code" href="group__DBusSHA.html#ge7c1a8ad734655b70e67e9a1498465f7">_dbus_sha_init</a> (&context);
<a name="l00489"></a>00489
<a name="l00490"></a>00490 <a class="code" href="group__DBusSHA.html#ge9c5e5cd39e2dc151ef1c54819aef3b6">_dbus_sha_update</a> (&context, data);
<a name="l00491"></a>00491
<a name="l00492"></a>00492 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&digest))
<a name="l00493"></a>00493 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00494"></a>00494
<a name="l00495"></a>00495 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusSHA.html#gf685311db11cc2e6b38fc62d171311e4">_dbus_sha_final</a> (&context, &digest))
<a name="l00496"></a>00496 <span class="keywordflow">goto</span> error;
<a name="l00497"></a>00497
<a name="l00498"></a>00498 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#gabb4873f436e015944a33cd1e3815cc9">_dbus_string_hex_encode</a> (&digest, 0, ascii_output,
<a name="l00499"></a>00499 _dbus_string_get_length (ascii_output)))
<a name="l00500"></a>00500 <span class="keywordflow">goto</span> error;
<a name="l00501"></a>00501
<a name="l00502"></a>00502 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&digest);
<a name="l00503"></a>00503
<a name="l00504"></a>00504 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga8cecfc5c5c054d2875c03e77b7be15d">TRUE</a>;
<a name="l00505"></a>00505
<a name="l00506"></a>00506 error:
<a name="l00507"></a>00507 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&digest);
<a name="l00508"></a>00508 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00509"></a>00509 }
<a name="l00510"></a>00510 <span class="comment">/* end of exported functions */</span>
<a name="l00512"></a>00512
<a name="l00513"></a>00513 <span class="preprocessor">#ifdef DBUS_BUILD_TESTS</span>
<a name="l00514"></a>00514 <span class="preprocessor"></span><span class="preprocessor">#include "dbus-test.h"</span>
<a name="l00515"></a>00515 <span class="preprocessor">#include <stdio.h></span>
<a name="l00516"></a>00516
<a name="l00517"></a>00517 <span class="keyword">static</span> <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a>
<a name="l00518"></a>00518 check_sha_binary (<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *input,
<a name="l00519"></a>00519 <span class="keywordtype">int</span> input_len,
<a name="l00520"></a>00520 <span class="keyword">const</span> <span class="keywordtype">char</span> *expected)
<a name="l00521"></a>00521 {
<a name="l00522"></a>00522 <a class="code" href="structDBusString.html">DBusString</a> input_str;
<a name="l00523"></a>00523 <a class="code" href="structDBusString.html">DBusString</a> expected_str;
<a name="l00524"></a>00524 <a class="code" href="structDBusString.html">DBusString</a> results;
<a name="l00525"></a>00525
<a name="l00526"></a>00526 <a class="code" href="group__DBusString.html#g6792a5c1725faa9d635d95f7a3b5bfae">_dbus_string_init_const_len</a> (&input_str, input, input_len);
<a name="l00527"></a>00527 <a class="code" href="group__DBusString.html#g374640ddfa2f0b27a8356e2379ba8043">_dbus_string_init_const</a> (&expected_str, expected);
<a name="l00528"></a>00528
<a name="l00529"></a>00529 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&results))
<a name="l00530"></a>00530 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory for SHA-1 results"</span>);
<a name="l00531"></a>00531
<a name="l00532"></a>00532 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusSHA.html#g4278fb9df967943834c4ad6332f2c28b">_dbus_sha_compute</a> (&input_str, &results))
<a name="l00533"></a>00533 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory for SHA-1 results"</span>);
<a name="l00534"></a>00534
<a name="l00535"></a>00535 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#gd79c34af55b58f0e8b81ecf11b8694bb">_dbus_string_equal</a> (&expected_str, &results))
<a name="l00536"></a>00536 {
<a name="l00537"></a>00537 <a class="code" href="group__DBusInternalsUtils.html#gbea2c16d6d3fe7c4eb5b9496fc877f84">_dbus_warn</a> (<span class="stringliteral">"Expected hash %s got %s for SHA-1 sum\n"</span>,
<a name="l00538"></a>00538 expected,
<a name="l00539"></a>00539 _dbus_string_get_const_data (&results));
<a name="l00540"></a>00540 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&results);
<a name="l00541"></a>00541 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00542"></a>00542 }
<a name="l00543"></a>00543
<a name="l00544"></a>00544 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&results);
<a name="l00545"></a>00545 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga8cecfc5c5c054d2875c03e77b7be15d">TRUE</a>;
<a name="l00546"></a>00546 }
<a name="l00547"></a>00547
<a name="l00548"></a>00548 <span class="keyword">static</span> <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a>
<a name="l00549"></a>00549 check_sha_str (<span class="keyword">const</span> <span class="keywordtype">char</span> *input,
<a name="l00550"></a>00550 <span class="keyword">const</span> <span class="keywordtype">char</span> *expected)
<a name="l00551"></a>00551 {
<a name="l00552"></a>00552 <span class="keywordflow">return</span> check_sha_binary (input, strlen (input), expected);
<a name="l00553"></a>00553 }
<a name="l00554"></a>00554
<a name="l00555"></a>00555 <span class="keyword">static</span> <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a>
<a name="l00556"></a>00556 decode_compact_string (<span class="keyword">const</span> <a class="code" href="structDBusString.html">DBusString</a> *line,
<a name="l00557"></a>00557 <a class="code" href="structDBusString.html">DBusString</a> *decoded)
<a name="l00558"></a>00558 {
<a name="l00559"></a>00559 <span class="keywordtype">int</span> n_bits;
<a name="l00560"></a>00560 <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a> current_b;
<a name="l00561"></a>00561 <span class="keywordtype">int</span> offset;
<a name="l00562"></a>00562 <span class="keywordtype">int</span> next;
<a name="l00563"></a>00563 <span class="keywordtype">long</span> val;
<a name="l00564"></a>00564 <span class="keywordtype">int</span> length_bytes;
<a name="l00565"></a>00565
<a name="l00566"></a>00566 offset = 0;
<a name="l00567"></a>00567 next = 0;
<a name="l00568"></a>00568
<a name="l00569"></a>00569 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g93e22894a5e2e0d65c179c7d36a8b1c8">_dbus_string_parse_int</a> (line, offset, &val, &next))
<a name="l00570"></a>00570 {
<a name="l00571"></a>00571 fprintf (stderr, <span class="stringliteral">"could not parse length at start of compact string: %s\n"</span>,
<a name="l00572"></a>00572 _dbus_string_get_const_data (line));
<a name="l00573"></a>00573 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00574"></a>00574 }
<a name="l00575"></a>00575
<a name="l00576"></a>00576 <a class="code" href="group__DBusString.html#g5698b163289be0066cf10c0f1caf877a">_dbus_string_skip_blank</a> (line, next, &next);
<a name="l00577"></a>00577
<a name="l00578"></a>00578 offset = next;
<a name="l00579"></a>00579 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g93e22894a5e2e0d65c179c7d36a8b1c8">_dbus_string_parse_int</a> (line, offset, &val, &next))
<a name="l00580"></a>00580 {
<a name="l00581"></a>00581 fprintf (stderr, <span class="stringliteral">"could not parse start bit 'b' in compact string: %s\n"</span>,
<a name="l00582"></a>00582 _dbus_string_get_const_data (line));
<a name="l00583"></a>00583 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00584"></a>00584 }
<a name="l00585"></a>00585
<a name="l00586"></a>00586 <span class="keywordflow">if</span> (!(val == 0 || val == 1))
<a name="l00587"></a>00587 {
<a name="l00588"></a>00588 fprintf (stderr, <span class="stringliteral">"the value 'b' must be 0 or 1, see sha-1/Readme.txt\n"</span>);
<a name="l00589"></a>00589 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00590"></a>00590 }
<a name="l00591"></a>00591
<a name="l00592"></a>00592 <a class="code" href="group__DBusString.html#g5698b163289be0066cf10c0f1caf877a">_dbus_string_skip_blank</a> (line, next, &next);
<a name="l00593"></a>00593
<a name="l00594"></a>00594 current_b = val;
<a name="l00595"></a>00595 n_bits = 0;
<a name="l00596"></a>00596
<a name="l00597"></a>00597 <span class="keywordflow">while</span> (next < _dbus_string_get_length (line))
<a name="l00598"></a>00598 {
<a name="l00599"></a>00599 <span class="keywordtype">int</span> total_bits;
<a name="l00600"></a>00600
<a name="l00601"></a>00601 offset = next;
<a name="l00602"></a>00602
<a name="l00603"></a>00603 <span class="keywordflow">if</span> (_dbus_string_get_byte (line, offset) == <span class="charliteral">'^'</span>)
<a name="l00604"></a>00604 <span class="keywordflow">break</span>;
<a name="l00605"></a>00605
<a name="l00606"></a>00606 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g93e22894a5e2e0d65c179c7d36a8b1c8">_dbus_string_parse_int</a> (line, offset, &val, &next))
<a name="l00607"></a>00607 {
<a name="l00608"></a>00608 fprintf (stderr, <span class="stringliteral">"could not parse bit count in compact string\n"</span>);
<a name="l00609"></a>00609 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00610"></a>00610 }
<a name="l00611"></a>00611
<a name="l00612"></a>00612 <span class="comment">/* We now append "val" copies of "current_b" bits to the string */</span>
<a name="l00613"></a>00613 total_bits = n_bits + val;
<a name="l00614"></a>00614 <span class="keywordflow">while</span> (n_bits < total_bits)
<a name="l00615"></a>00615 {
<a name="l00616"></a>00616 <span class="keywordtype">int</span> byte_containing_next_bit = n_bits / 8;
<a name="l00617"></a>00617 <span class="keywordtype">int</span> bit_containing_next_bit = 7 - (n_bits % 8);
<a name="l00618"></a>00618 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> old_byte;
<a name="l00619"></a>00619
<a name="l00620"></a>00620 <span class="keywordflow">if</span> (byte_containing_next_bit >= _dbus_string_get_length (decoded))
<a name="l00621"></a>00621 {
<a name="l00622"></a>00622 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g08c423b93c28dd746dcb93e0461ab95c">_dbus_string_set_length</a> (decoded, byte_containing_next_bit + 1))
<a name="l00623"></a>00623 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory to extend to next byte"</span>);
<a name="l00624"></a>00624 }
<a name="l00625"></a>00625
<a name="l00626"></a>00626 old_byte = _dbus_string_get_byte (decoded, byte_containing_next_bit);
<a name="l00627"></a>00627 old_byte |= current_b << bit_containing_next_bit;
<a name="l00628"></a>00628
<a name="l00629"></a>00629 <span class="preprocessor">#if 0</span>
<a name="l00630"></a>00630 <span class="preprocessor"></span> printf (<span class="stringliteral">"Appending bit %d to byte %d at bit %d resulting in byte 0x%x\n"</span>,
<a name="l00631"></a>00631 current_b, byte_containing_next_bit,
<a name="l00632"></a>00632 bit_containing_next_bit, old_byte);
<a name="l00633"></a>00633 <span class="preprocessor">#endif</span>
<a name="l00634"></a>00634 <span class="preprocessor"></span>
<a name="l00635"></a>00635 _dbus_string_set_byte (decoded, byte_containing_next_bit, old_byte);
<a name="l00636"></a>00636
<a name="l00637"></a>00637 ++n_bits;
<a name="l00638"></a>00638 }
<a name="l00639"></a>00639
<a name="l00640"></a>00640 <a class="code" href="group__DBusString.html#g5698b163289be0066cf10c0f1caf877a">_dbus_string_skip_blank</a> (line, next, &next);
<a name="l00641"></a>00641
<a name="l00642"></a>00642 current_b = !current_b;
<a name="l00643"></a>00643 }
<a name="l00644"></a>00644
<a name="l00645"></a>00645 length_bytes = (n_bits / 8 + ((n_bits % 8) ? 1 : 0));
<a name="l00646"></a>00646
<a name="l00647"></a>00647 <span class="keywordflow">if</span> (_dbus_string_get_length (decoded) != length_bytes)
<a name="l00648"></a>00648 {
<a name="l00649"></a>00649 fprintf (stderr, <span class="stringliteral">"Expected length %d bytes %d bits for compact string, got %d bytes\n"</span>,
<a name="l00650"></a>00650 length_bytes, n_bits, _dbus_string_get_length (decoded));
<a name="l00651"></a>00651 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00652"></a>00652 }
<a name="l00653"></a>00653 <span class="keywordflow">else</span>
<a name="l00654"></a>00654 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga8cecfc5c5c054d2875c03e77b7be15d">TRUE</a>;
<a name="l00655"></a>00655 }
<a name="l00656"></a>00656
<a name="l00657"></a>00657 <span class="keyword">static</span> <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a>
<a name="l00658"></a>00658 get_next_expected_result (<a class="code" href="structDBusString.html">DBusString</a> *results,
<a name="l00659"></a>00659 <a class="code" href="structDBusString.html">DBusString</a> *result)
<a name="l00660"></a>00660 {
<a name="l00661"></a>00661 <a class="code" href="structDBusString.html">DBusString</a> line;
<a name="l00662"></a>00662 <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a> retval;
<a name="l00663"></a>00663
<a name="l00664"></a>00664 retval = <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00665"></a>00665
<a name="l00666"></a>00666 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&line))
<a name="l00667"></a>00667 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00668"></a>00668
<a name="l00669"></a>00669 next_iteration:
<a name="l00670"></a>00670 <span class="keywordflow">while</span> (<a class="code" href="group__DBusString.html#g8b7fc22e6738173e1b2cef4b91b9c3c1">_dbus_string_pop_line</a> (results, &line))
<a name="l00671"></a>00671 {
<a name="l00672"></a>00672 _dbus_string_delete_leading_blanks (&line);
<a name="l00673"></a>00673
<a name="l00674"></a>00674 <span class="keywordflow">if</span> (_dbus_string_get_length (&line) == 0)
<a name="l00675"></a>00675 <span class="keywordflow">goto</span> next_iteration;
<a name="l00676"></a>00676 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_dbus_string_starts_with_c_str (&line, <span class="stringliteral">"#"</span>))
<a name="l00677"></a>00677 <span class="keywordflow">goto</span> next_iteration;
<a name="l00678"></a>00678 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_dbus_string_starts_with_c_str (&line, <span class="stringliteral">"H>"</span>))
<a name="l00679"></a>00679 {
<a name="l00680"></a>00680 <span class="comment">/* don't print */</span>
<a name="l00681"></a>00681 }
<a name="l00682"></a>00682 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_dbus_string_starts_with_c_str (&line, <span class="stringliteral">"D>"</span>) ||
<a name="l00683"></a>00683 _dbus_string_starts_with_c_str (&line, <span class="stringliteral">"<D"</span>))
<a name="l00684"></a>00684 <span class="keywordflow">goto</span> next_iteration;
<a name="l00685"></a>00685 <span class="keywordflow">else</span>
<a name="l00686"></a>00686 {
<a name="l00687"></a>00687 <span class="keywordtype">int</span> i;
<a name="l00688"></a>00688
<a name="l00689"></a>00689 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#gd379fce8d4ef4f7e28f81f50b46ee4c9">_dbus_string_move</a> (&line, 0, result, 0))
<a name="l00690"></a>00690 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00691"></a>00691
<a name="l00692"></a>00692 i = 0;
<a name="l00693"></a>00693 <span class="keywordflow">while</span> (i < _dbus_string_get_length (result))
<a name="l00694"></a>00694 {
<a name="l00695"></a>00695 <span class="keywordflow">switch</span> (_dbus_string_get_byte (result, i))
<a name="l00696"></a>00696 {
<a name="l00697"></a>00697 <span class="keywordflow">case</span> <span class="charliteral">'A'</span>:
<a name="l00698"></a>00698 _dbus_string_set_byte (result, i, <span class="charliteral">'a'</span>);
<a name="l00699"></a>00699 <span class="keywordflow">break</span>;
<a name="l00700"></a>00700 <span class="keywordflow">case</span> <span class="charliteral">'B'</span>:
<a name="l00701"></a>00701 _dbus_string_set_byte (result, i, <span class="charliteral">'b'</span>);
<a name="l00702"></a>00702 <span class="keywordflow">break</span>;
<a name="l00703"></a>00703 <span class="keywordflow">case</span> <span class="charliteral">'C'</span>:
<a name="l00704"></a>00704 _dbus_string_set_byte (result, i, <span class="charliteral">'c'</span>);
<a name="l00705"></a>00705 <span class="keywordflow">break</span>;
<a name="l00706"></a>00706 <span class="keywordflow">case</span> <span class="charliteral">'D'</span>:
<a name="l00707"></a>00707 _dbus_string_set_byte (result, i, <span class="charliteral">'d'</span>);
<a name="l00708"></a>00708 <span class="keywordflow">break</span>;
<a name="l00709"></a>00709 <span class="keywordflow">case</span> <span class="charliteral">'E'</span>:
<a name="l00710"></a>00710 _dbus_string_set_byte (result, i, <span class="charliteral">'e'</span>);
<a name="l00711"></a>00711 <span class="keywordflow">break</span>;
<a name="l00712"></a>00712 <span class="keywordflow">case</span> <span class="charliteral">'F'</span>:
<a name="l00713"></a>00713 _dbus_string_set_byte (result, i, <span class="charliteral">'f'</span>);
<a name="l00714"></a>00714 <span class="keywordflow">break</span>;
<a name="l00715"></a>00715 <span class="keywordflow">case</span> <span class="charliteral">'^'</span>:
<a name="l00716"></a>00716 <span class="keywordflow">case</span> <span class="charliteral">' '</span>:
<a name="l00717"></a>00717 <a class="code" href="group__DBusString.html#g7e0e164ad5bb094e5ccad9edc7ae4235">_dbus_string_delete</a> (result, i, 1);
<a name="l00718"></a>00718 --i; <span class="comment">/* to offset ++i below */</span>
<a name="l00719"></a>00719 <span class="keywordflow">break</span>;
<a name="l00720"></a>00720 }
<a name="l00721"></a>00721
<a name="l00722"></a>00722 ++i;
<a name="l00723"></a>00723 }
<a name="l00724"></a>00724
<a name="l00725"></a>00725 <span class="keywordflow">break</span>;
<a name="l00726"></a>00726 }
<a name="l00727"></a>00727 }
<a name="l00728"></a>00728
<a name="l00729"></a>00729 retval = <a class="code" href="group__DBusMacros.html#ga8cecfc5c5c054d2875c03e77b7be15d">TRUE</a>;
<a name="l00730"></a>00730
<a name="l00731"></a>00731 <span class="comment">/* out: */</span>
<a name="l00732"></a>00732 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&line);
<a name="l00733"></a>00733 <span class="keywordflow">return</span> retval;
<a name="l00734"></a>00734 }
<a name="l00735"></a>00735
<a name="l00736"></a>00736 <span class="keyword">static</span> <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a>
<a name="l00737"></a>00737 process_test_data (<span class="keyword">const</span> <span class="keywordtype">char</span> *test_data_dir)
<a name="l00738"></a>00738 {
<a name="l00739"></a>00739 <a class="code" href="structDBusString.html">DBusString</a> tests_file;
<a name="l00740"></a>00740 <a class="code" href="structDBusString.html">DBusString</a> results_file;
<a name="l00741"></a>00741 <a class="code" href="structDBusString.html">DBusString</a> tests;
<a name="l00742"></a>00742 <a class="code" href="structDBusString.html">DBusString</a> results;
<a name="l00743"></a>00743 <a class="code" href="structDBusString.html">DBusString</a> line;
<a name="l00744"></a>00744 <a class="code" href="structDBusString.html">DBusString</a> tmp;
<a name="l00745"></a>00745 <span class="keywordtype">int</span> line_no;
<a name="l00746"></a>00746 <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a> retval;
<a name="l00747"></a>00747 <span class="keywordtype">int</span> success_count;
<a name="l00748"></a>00748 <a class="code" href="structDBusError.html">DBusError</a> error;
<a name="l00749"></a>00749
<a name="l00750"></a>00750 retval = <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00751"></a>00751
<a name="l00752"></a>00752 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&tests_file))
<a name="l00753"></a>00753 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00754"></a>00754
<a name="l00755"></a>00755 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&results_file))
<a name="l00756"></a>00756 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00757"></a>00757
<a name="l00758"></a>00758 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&tests))
<a name="l00759"></a>00759 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00760"></a>00760
<a name="l00761"></a>00761 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&results))
<a name="l00762"></a>00762 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00763"></a>00763
<a name="l00764"></a>00764 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&line))
<a name="l00765"></a>00765 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00766"></a>00766
<a name="l00767"></a>00767 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g100c5ce0696822c5a4cfbdfaba674d96">_dbus_string_append</a> (&tests_file, test_data_dir))
<a name="l00768"></a>00768 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00769"></a>00769
<a name="l00770"></a>00770 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g100c5ce0696822c5a4cfbdfaba674d96">_dbus_string_append</a> (&results_file, test_data_dir))
<a name="l00771"></a>00771 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00772"></a>00772
<a name="l00773"></a>00773 <a class="code" href="group__DBusString.html#g374640ddfa2f0b27a8356e2379ba8043">_dbus_string_init_const</a> (&tmp, <span class="stringliteral">"sha-1/byte-messages.sha1"</span>);
<a name="l00774"></a>00774 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusSysdeps.html#ge3a3fdc0c6001e367584bb016aca495d">_dbus_concat_dir_and_file</a> (&tests_file, &tmp))
<a name="l00775"></a>00775 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00776"></a>00776
<a name="l00777"></a>00777 <a class="code" href="group__DBusString.html#g374640ddfa2f0b27a8356e2379ba8043">_dbus_string_init_const</a> (&tmp, <span class="stringliteral">"sha-1/byte-hashes.sha1"</span>);
<a name="l00778"></a>00778 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusSysdeps.html#ge3a3fdc0c6001e367584bb016aca495d">_dbus_concat_dir_and_file</a> (&results_file, &tmp))
<a name="l00779"></a>00779 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00780"></a>00780
<a name="l00781"></a>00781 <a class="code" href="group__DBusErrors.html#g8ce28eae754237703296599967d7ab77">dbus_error_init</a> (&error);
<a name="l00782"></a>00782 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusSysdeps.html#gd22d468e789139c87f7f4bb97cadf448">_dbus_file_get_contents</a> (&tests, &tests_file, &error))
<a name="l00783"></a>00783 {
<a name="l00784"></a>00784 fprintf (stderr, <span class="stringliteral">"could not load test data file %s: %s\n"</span>,
<a name="l00785"></a>00785 _dbus_string_get_const_data (&tests_file),
<a name="l00786"></a>00786 error.<a class="code" href="structDBusError.html#fb559175326de5b6b340e26204e92d72">message</a>);
<a name="l00787"></a>00787 <a class="code" href="group__DBusErrors.html#gd192d53cf930b1b12e1ce91bc0963709">dbus_error_free</a> (&error);
<a name="l00788"></a>00788 <span class="keywordflow">goto</span> out;
<a name="l00789"></a>00789 }
<a name="l00790"></a>00790
<a name="l00791"></a>00791 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusSysdeps.html#gd22d468e789139c87f7f4bb97cadf448">_dbus_file_get_contents</a> (&results, &results_file, &error))
<a name="l00792"></a>00792 {
<a name="l00793"></a>00793 fprintf (stderr, <span class="stringliteral">"could not load results data file %s: %s\n"</span>,
<a name="l00794"></a>00794 _dbus_string_get_const_data (&results_file), error.<a class="code" href="structDBusError.html#fb559175326de5b6b340e26204e92d72">message</a>);
<a name="l00795"></a>00795 <a class="code" href="group__DBusErrors.html#gd192d53cf930b1b12e1ce91bc0963709">dbus_error_free</a> (&error);
<a name="l00796"></a>00796 <span class="keywordflow">goto</span> out;
<a name="l00797"></a>00797 }
<a name="l00798"></a>00798
<a name="l00799"></a>00799 success_count = 0;
<a name="l00800"></a>00800 line_no = 0;
<a name="l00801"></a>00801 next_iteration:
<a name="l00802"></a>00802 <span class="keywordflow">while</span> (<a class="code" href="group__DBusString.html#g8b7fc22e6738173e1b2cef4b91b9c3c1">_dbus_string_pop_line</a> (&tests, &line))
<a name="l00803"></a>00803 {
<a name="l00804"></a>00804 line_no += 1;
<a name="l00805"></a>00805
<a name="l00806"></a>00806 _dbus_string_delete_leading_blanks (&line);
<a name="l00807"></a>00807
<a name="l00808"></a>00808 <span class="keywordflow">if</span> (_dbus_string_get_length (&line) == 0)
<a name="l00809"></a>00809 <span class="keywordflow">goto</span> next_iteration;
<a name="l00810"></a>00810 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_dbus_string_starts_with_c_str (&line, <span class="stringliteral">"#"</span>))
<a name="l00811"></a>00811 <span class="keywordflow">goto</span> next_iteration;
<a name="l00812"></a>00812 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_dbus_string_starts_with_c_str (&line, <span class="stringliteral">"H>"</span>))
<a name="l00813"></a>00813 {
<a name="l00814"></a>00814 printf (<span class="stringliteral">"SHA-1: %s\n"</span>, _dbus_string_get_const_data (&line));
<a name="l00815"></a>00815
<a name="l00816"></a>00816 <span class="keywordflow">if</span> (<a class="code" href="group__DBusString.html#g5fe47873b2838339107c3e1f03d1a703">_dbus_string_find</a> (&line, 0, <span class="stringliteral">"Type 3"</span>, <a class="code" href="group__DBusMacros.html#g070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>))
<a name="l00817"></a>00817 {
<a name="l00818"></a>00818 <span class="comment">/* See sha-1/Readme.txt - the "Type 3" tests are</span>
<a name="l00819"></a>00819 <span class="comment"> * random seeds, rather than data to be hashed.</span>
<a name="l00820"></a>00820 <span class="comment"> * we'd have to do a little bit more implementation</span>
<a name="l00821"></a>00821 <span class="comment"> * to use those tests.</span>
<a name="l00822"></a>00822 <span class="comment"> */</span>
<a name="l00823"></a>00823
<a name="l00824"></a>00824 printf (<span class="stringliteral">" (ending tests due to Type 3 tests seen - this is normal)\n"</span>);
<a name="l00825"></a>00825 <span class="keywordflow">break</span>;
<a name="l00826"></a>00826 }
<a name="l00827"></a>00827 }
<a name="l00828"></a>00828 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (_dbus_string_starts_with_c_str (&line, <span class="stringliteral">"D>"</span>) ||
<a name="l00829"></a>00829 _dbus_string_starts_with_c_str (&line, <span class="stringliteral">"<D"</span>))
<a name="l00830"></a>00830 <span class="keywordflow">goto</span> next_iteration;
<a name="l00831"></a>00831 <span class="keywordflow">else</span>
<a name="l00832"></a>00832 {
<a name="l00833"></a>00833 <a class="code" href="structDBusString.html">DBusString</a> test;
<a name="l00834"></a>00834 <a class="code" href="structDBusString.html">DBusString</a> result;
<a name="l00835"></a>00835 <a class="code" href="structDBusString.html">DBusString</a> next_line;
<a name="l00836"></a>00836 <a class="code" href="structDBusString.html">DBusString</a> expected;
<a name="l00837"></a>00837 <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a> success;
<a name="l00838"></a>00838
<a name="l00839"></a>00839 success = <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00840"></a>00840
<a name="l00841"></a>00841 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&next_line))
<a name="l00842"></a>00842 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00843"></a>00843
<a name="l00844"></a>00844 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&expected))
<a name="l00845"></a>00845 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00846"></a>00846
<a name="l00847"></a>00847 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&test))
<a name="l00848"></a>00848 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00849"></a>00849
<a name="l00850"></a>00850 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#g348252317f7bb8ac43529972945830ae">_dbus_string_init</a> (&result))
<a name="l00851"></a>00851 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00852"></a>00852
<a name="l00853"></a>00853 <span class="comment">/* the "compact strings" are "^"-terminated not</span>
<a name="l00854"></a>00854 <span class="comment"> * newline-terminated so readahead to find the</span>
<a name="l00855"></a>00855 <span class="comment"> * "^"</span>
<a name="l00856"></a>00856 <span class="comment"> */</span>
<a name="l00857"></a>00857 <span class="keywordflow">while</span> (!<a class="code" href="group__DBusString.html#g5fe47873b2838339107c3e1f03d1a703">_dbus_string_find</a> (&line, 0, <span class="stringliteral">"^"</span>, <a class="code" href="group__DBusMacros.html#g070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>) &&
<a name="l00858"></a>00858 <a class="code" href="group__DBusString.html#g8b7fc22e6738173e1b2cef4b91b9c3c1">_dbus_string_pop_line</a> (&tests, &next_line))
<a name="l00859"></a>00859 {
<a name="l00860"></a>00860 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#ga6ecf36e70263659f921a4ef0335db12">_dbus_string_append_byte</a> (&line, <span class="charliteral">' '</span>) ||
<a name="l00861"></a>00861 !<a class="code" href="group__DBusString.html#gd379fce8d4ef4f7e28f81f50b46ee4c9">_dbus_string_move</a> (&next_line, 0, &line,
<a name="l00862"></a>00862 _dbus_string_get_length (&line)))
<a name="l00863"></a>00863 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory"</span>);
<a name="l00864"></a>00864 }
<a name="l00865"></a>00865
<a name="l00866"></a>00866 <span class="keywordflow">if</span> (!decode_compact_string (&line, &test))
<a name="l00867"></a>00867 {
<a name="l00868"></a>00868 fprintf (stderr, <span class="stringliteral">"Failed to decode line %d as a compact string\n"</span>,
<a name="l00869"></a>00869 line_no);
<a name="l00870"></a>00870 <span class="keywordflow">goto</span> failure;
<a name="l00871"></a>00871 }
<a name="l00872"></a>00872
<a name="l00873"></a>00873 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusSHA.html#g4278fb9df967943834c4ad6332f2c28b">_dbus_sha_compute</a> (&test, &result))
<a name="l00874"></a>00874 <a class="code" href="group__DBusInternalsUtils.html#g0c4961ec784874f1b1f3aeccea8d3da1">_dbus_assert_not_reached</a> (<span class="stringliteral">"no memory for SHA-1 result"</span>);
<a name="l00875"></a>00875
<a name="l00876"></a>00876 <span class="keywordflow">if</span> (!get_next_expected_result (&results, &expected))
<a name="l00877"></a>00877 {
<a name="l00878"></a>00878 fprintf (stderr, <span class="stringliteral">"Failed to read an expected result\n"</span>);
<a name="l00879"></a>00879 <span class="keywordflow">goto</span> failure;
<a name="l00880"></a>00880 }
<a name="l00881"></a>00881
<a name="l00882"></a>00882 <span class="keywordflow">if</span> (!<a class="code" href="group__DBusString.html#gd79c34af55b58f0e8b81ecf11b8694bb">_dbus_string_equal</a> (&result, &expected))
<a name="l00883"></a>00883 {
<a name="l00884"></a>00884 fprintf (stderr, <span class="stringliteral">" for line %d got hash %s expected %s\n"</span>,
<a name="l00885"></a>00885 line_no,
<a name="l00886"></a>00886 _dbus_string_get_const_data (&result),
<a name="l00887"></a>00887 _dbus_string_get_const_data (&expected));
<a name="l00888"></a>00888 <span class="keywordflow">goto</span> failure;
<a name="l00889"></a>00889 }
<a name="l00890"></a>00890 <span class="keywordflow">else</span>
<a name="l00891"></a>00891 {
<a name="l00892"></a>00892 success_count += 1;
<a name="l00893"></a>00893 }
<a name="l00894"></a>00894
<a name="l00895"></a>00895 success = <a class="code" href="group__DBusMacros.html#ga8cecfc5c5c054d2875c03e77b7be15d">TRUE</a>;
<a name="l00896"></a>00896
<a name="l00897"></a>00897 failure:
<a name="l00898"></a>00898 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&test);
<a name="l00899"></a>00899 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&result);
<a name="l00900"></a>00900 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&next_line);
<a name="l00901"></a>00901 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&expected);
<a name="l00902"></a>00902
<a name="l00903"></a>00903 <span class="keywordflow">if</span> (!success)
<a name="l00904"></a>00904 <span class="keywordflow">goto</span> out;
<a name="l00905"></a>00905 }
<a name="l00906"></a>00906 }
<a name="l00907"></a>00907
<a name="l00908"></a>00908 retval = <a class="code" href="group__DBusMacros.html#ga8cecfc5c5c054d2875c03e77b7be15d">TRUE</a>;
<a name="l00909"></a>00909
<a name="l00910"></a>00910 printf (<span class="stringliteral">"Passed the %d SHA-1 tests in the test file\n"</span>,
<a name="l00911"></a>00911 success_count);
<a name="l00912"></a>00912
<a name="l00913"></a>00913 out:
<a name="l00914"></a>00914 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&tests_file);
<a name="l00915"></a>00915 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&results_file);
<a name="l00916"></a>00916 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&tests);
<a name="l00917"></a>00917 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&results);
<a name="l00918"></a>00918 <a class="code" href="group__DBusString.html#g781ca91acda49a834dce7d0ed0eef212">_dbus_string_free</a> (&line);
<a name="l00919"></a>00919
<a name="l00920"></a>00920 <span class="keywordflow">return</span> retval;
<a name="l00921"></a>00921 }
<a name="l00922"></a>00922
<a name="l00929"></a>00929 <a class="code" href="group__DBusTypes.html#g39c9cb0f3a2a8ad6f55cc4855d035349">dbus_bool_t</a>
<a name="l00930"></a>00930 _dbus_sha_test (<span class="keyword">const</span> <span class="keywordtype">char</span> *test_data_dir)
<a name="l00931"></a>00931 {
<a name="l00932"></a>00932 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> all_bytes[256];
<a name="l00933"></a>00933 <span class="keywordtype">int</span> i;
<a name="l00934"></a>00934
<a name="l00935"></a>00935 <span class="keywordflow">if</span> (test_data_dir != <a class="code" href="group__DBusMacros.html#g070d2ce7b6bb7e5c05602aa8c308d0c4">NULL</a>)
<a name="l00936"></a>00936 {
<a name="l00937"></a>00937 <span class="keywordflow">if</span> (!process_test_data (test_data_dir))
<a name="l00938"></a>00938 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00939"></a>00939 }
<a name="l00940"></a>00940 <span class="keywordflow">else</span>
<a name="l00941"></a>00941 printf (<span class="stringliteral">"No test data dir\n"</span>);
<a name="l00942"></a>00942
<a name="l00943"></a>00943 i = 0;
<a name="l00944"></a>00944 <span class="keywordflow">while</span> (i < 256)
<a name="l00945"></a>00945 {
<a name="l00946"></a>00946 all_bytes[i] = i;
<a name="l00947"></a>00947 ++i;
<a name="l00948"></a>00948 }
<a name="l00949"></a>00949
<a name="l00950"></a>00950 <span class="keywordflow">if</span> (!check_sha_binary (all_bytes, 256,
<a name="l00951"></a>00951 <span class="stringliteral">"4916d6bdb7f78e6803698cab32d1586ea457dfc8"</span>))
<a name="l00952"></a>00952 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga93f0eb578d23995850d61f7d61c55c1">FALSE</a>;
<a name="l00953"></a>00953
<a name="l00954"></a>00954 <span class="preprocessor">#define CHECK(input,expected) if (!check_sha_str (input, expected)) return FALSE</span>
<a name="l00955"></a>00955 <span class="preprocessor"></span>
<a name="l00956"></a>00956 CHECK (<span class="stringliteral">""</span>, <span class="stringliteral">"da39a3ee5e6b4b0d3255bfef95601890afd80709"</span>);
<a name="l00957"></a>00957 CHECK (<span class="stringliteral">"a"</span>, <span class="stringliteral">"86f7e437faa5a7fce15d1ddcb9eaeaea377667b8"</span>);
<a name="l00958"></a>00958 CHECK (<span class="stringliteral">"abc"</span>, <span class="stringliteral">"a9993e364706816aba3e25717850c26c9cd0d89d"</span>);
<a name="l00959"></a>00959 CHECK (<span class="stringliteral">"message digest"</span>, <span class="stringliteral">"c12252ceda8be8994d5fa0290a47231c1d16aae3"</span>);
<a name="l00960"></a>00960 CHECK (<span class="stringliteral">"abcdefghijklmnopqrstuvwxyz"</span>, <span class="stringliteral">"32d10c7b8cf96570ca04ce37f2a19d84240d3a89"</span>);
<a name="l00961"></a>00961 CHECK (<span class="stringliteral">"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"</span>,
<a name="l00962"></a>00962 <span class="stringliteral">"761c457bf73b14d27e9e9265c46f4b4dda11f940"</span>);
<a name="l00963"></a>00963 CHECK (<span class="stringliteral">"12345678901234567890123456789012345678901234567890123456789012345678901234567890"</span>,
<a name="l00964"></a>00964 <span class="stringliteral">"50abf5706a150990a08b2c5ea40fa0e585554732"</span>);
<a name="l00965"></a>00965
<a name="l00966"></a>00966 <span class="keywordflow">return</span> <a class="code" href="group__DBusMacros.html#ga8cecfc5c5c054d2875c03e77b7be15d">TRUE</a>;
<a name="l00967"></a>00967 }
<a name="l00968"></a>00968
<a name="l00969"></a>00969 <span class="preprocessor">#endif </span><span class="comment">/* DBUS_BUILD_TESTS */</span>
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Mon Dec 14 22:26:12 2009 for D-Bus by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
</body>
</html>