Update includes for webrtc/{base => rtc_base} rename (3/3)

webrtc/rtc_base/md5.cc

 /*
  * This code implements the MD5 message-digest algorithm.
  * The algorithm is due to Ron Rivest.  This code was
  * written by Colin Plumb in 1993, no copyright is claimed.
  * This code is in the public domain; do with it what you wish.
  *
  * Equivalent code is available from RSA Data Security, Inc.
  * This code has been tested against that, and is equivalent,
  * except that you don't need to include two pages of legalese
  * with every copy.
  *
  * To compute the message digest of a chunk of bytes, declare an
  * MD5Context structure, pass it to MD5Init, call MD5Update as
  * needed on buffers full of bytes, and then call MD5Final, which
  * will fill a supplied 16-byte array with the digest.
  */
 
 // Changes from original C code:
 // Ported to C++, type casting, Google code style.
 
-#include "webrtc/base/md5.h"
+#include "webrtc/rtc_base/md5.h"
 
 // TODO: Avoid memcmpy - hash directly from memory.
 #include <string.h>  // for memcpy().
 
-#include "webrtc/base/byteorder.h"  // for RTC_ARCH_CPU_LITTLE_ENDIAN.
+#include "webrtc/rtc_base/byteorder.h"  // for RTC_ARCH_CPU_LITTLE_ENDIAN.
 
 namespace rtc {
 
 #ifdef RTC_ARCH_CPU_LITTLE_ENDIAN
 #define ByteReverse(buf, len)  // Nothing.
 #else  // RTC_ARCH_CPU_BIG_ENDIAN
 static void ByteReverse(uint32_t* buf, int len) {
   for (int i = 0; i < len; ++i) {
     buf[i] = rtc::GetLE32(&buf[i]);
   }
@@ skipping 176 matching lines @@
   MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
   MD5STEP(F4, c, d, a, b, in[ 2] + 0x2ad7d2bb, 15);
   MD5STEP(F4, b, c, d, a, in[ 9] + 0xeb86d391, 21);
   buf[0] += a;
   buf[1] += b;
   buf[2] += c;
   buf[3] += d;
 }
 
 }  // namespace rtc