bikeshedding: update links

crnlib/crn_file_utils.cpp

@@ -469,7 +469,7 @@ void file_utils::trim_trailing_seperator(dynamic_string& path) {
     path.truncate(path.get_len() - 1);
 }
 
-// See http://www.codeproject.com/KB/string/wildcmp.aspx
+// https://www.codeproject.com/Articles/1088/Wildcard-string-compare-globbing
 int file_utils::wildcmp(const char* pWild, const char* pString) {
   const char *cp = NULL, *mp = NULL;
 

crnlib/crn_hash_map.h

@@ -3,7 +3,7 @@
 //
 // Notes:
 // stl-like hash map/hash set, with predictable performance across platforms/compilers/C run times/etc.
-// Hash function ref: http://www.brpreiss.com/books/opus4/html/page215.html
+// Hash function ref: https://web.archive.org/web/20160420203106/http://brpreiss.com/books/opus4/html/page215.html
 // Compared for performance against VC9's std::hash_map.
 // Linear probing, auto resizes on ~50% load factor.
 // Uses Knuth's multiplicative method (Fibonacci hashing).

crnlib/crn_image_utils.cpp

@@ -672,7 +672,7 @@ bool compute_delta(image_u8& dest, image_u8& a, image_u8& b, uint scale) {
 }
 
 // FIXME: Totally hack-ass computation.
-// Perhaps port http://www.lomont.org/Software/Misc/SSIM/SSIM.html?
+// Perhaps port https://www.lomont.org/software/misc/ssim/SSIM.html ?
 double compute_block_ssim(uint t, const uint8* pX, const uint8* pY) {
   double ave_x = 0.0f;
   double ave_y = 0.0f;

crnlib/crn_jpgd.cpp

@@ -7,7 +7,7 @@
 //
 // Chroma upsampling quality: H2V2 is upsampled in the frequency domain, H2V1 and H1V2 are upsampled using point sampling.
 // Chroma upsampling reference: "Fast Scheme for Image Size Change in the Compressed Domain"
-// http://vision.ai.uiuc.edu/~dugad/research/dct/index.html
+// https://web.archive.org/web/20110316030157/http://vision.ai.uiuc.edu/~dugad/research/dct/index.html/
 
 #include "crn_jpgd.h"
 #include <string.h>

crnlib/crn_miniz.cpp

@@ -78,7 +78,7 @@ mz_ulong mz_adler32(mz_ulong adler, const unsigned char* ptr, size_t buf_len) {
   return (s2 << 16) + s1;
 }
 
-// Karl Malbrain's compact CRC-32. See "A compact CCITT crc16 and crc32 C implementation that balances processor cache usage against speed": http://www.geocities.com/malbrain/
+// Karl Malbrain's compact CRC-32. See "A compact CCITT crc16 and crc32 C implementation that balances processor cache usage against speed": https://www.oocities.com/malbrain/
 mz_ulong mz_crc32(mz_ulong crc, const mz_uint8* ptr, size_t buf_len) {
   static const mz_uint32 s_crc32[16] = {0, 0x1db71064, 0x3b6e20c8, 0x26d930ac, 0x76dc4190, 0x6b6b51f4, 0x4db26158, 0x5005713c,
                                         0xedb88320, 0xf00f9344, 0xd6d6a3e8, 0xcb61b38c, 0x9b64c2b0, 0x86d3d2d4, 0xa00ae278, 0xbdbdf21c};

crnlib/crn_rand.cpp

@@ -4,7 +4,7 @@
 // http://www.ciphersbyritter.com/NEWS4/RANDC.HTM
 // http://burtleburtle.net/bob/rand/smallprng.html
 // http://www.cs.ucl.ac.uk/staff/d.jones/GoodPracticeRNG.pdf
-// See GPG7, page 120, or http://www.lomont.org/Math/Papers/2008/Lomont_PRNG_2008.pdf
+// See GPG7, page 120, or https://www.lomont.org/papers/2008/Lomont_PRNG_2008.pdf
 #include "crn_core.h"
 #include "crn_rand.h"
 #include "crn_hash.h"

inc/dds_defs.h

@@ -18,7 +18,7 @@ enum pixel_format {
   PIXEL_FMT_DXT5 = CRNLIB_PIXEL_FMT_FOURCC('D', 'X', 'T', '5'),
   PIXEL_FMT_3DC = CRNLIB_PIXEL_FMT_FOURCC('A', 'T', 'I', '2'),    // DXN_YX
   PIXEL_FMT_DXN = CRNLIB_PIXEL_FMT_FOURCC('A', '2', 'X', 'Y'),    // DXN_XY
-  PIXEL_FMT_DXT5A = CRNLIB_PIXEL_FMT_FOURCC('A', 'T', 'I', '1'),  // ATI1N, http://developer.amd.com/media/gpu_assets/Radeon_X1x00_Programming_Guide.pdf
+  PIXEL_FMT_DXT5A = CRNLIB_PIXEL_FMT_FOURCC('A', 'T', 'I', '1'),  // ATI1N, https://www.vgamuseum.info/images/doc/ati/radeon_x1/radeon_x1x00_programming_guide.pdf
 
   // Non-standard, crnlib-specific pixel formats (some of these are supported by ATI's Compressonator)
   PIXEL_FMT_DXT5_CCxY = CRNLIB_PIXEL_FMT_FOURCC('C', 'C', 'x', 'Y'),