xdiff/xutils.c

   1 /*
   2  *  LibXDiff by Davide Libenzi ( File Differential Library )
   3  *  Copyright (C) 2003  Davide Libenzi
   4  *
   5  *  This library is free software; you can redistribute it and/or
   6  *  modify it under the terms of the GNU Lesser General Public
   7  *  License as published by the Free Software Foundation; either
   8  *  version 2.1 of the License, or (at your option) any later version.
   9  *
  10  *  This library is distributed in the hope that it will be useful,
  11  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13  *  Lesser General Public License for more details.
  14  *
  15  *  You should have received a copy of the GNU Lesser General Public
  16  *  License along with this library; if not, write to the Free Software
  17  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
  18  *
  19  *  Davide Libenzi <davidel@xmailserver.org>
  20  *
  21  */
  22
  23 #include "xinclude.h"
  24
  25
  26
  27 #define XDL_GUESS_NLINES 256
  28
  29
  30
  31
  32 long xdl_bogosqrt(long n) {
  33         long i;
  34
  35         /*
  36          * Classical integer square root approximation using shifts.
  37          */
  38         for (i = 1; n > 0; n >>= 2)
  39                 i <<= 1;
  40
  41         return i;
  42 }
  43
  44
  45 int xdl_emit_diffrec(char const *rec, long size, char const *pre, long psize,
  46                      xdemitcb_t *ecb) {
  47         int i = 2;
  48         mmbuffer_t mb[3];
  49
  50         mb[0].ptr = (char *) pre;
  51         mb[0].size = psize;
  52         mb[1].ptr = (char *) rec;
  53         mb[1].size = size;
  54         if (size > 0 && rec[size - 1] != '\n') {
  55                 mb[2].ptr = (char *) "\n\\ No newline at end of file\n";
  56                 mb[2].size = strlen(mb[2].ptr);
  57                 i++;
  58         }
  59         if (ecb->outf(ecb->priv, mb, i) < 0) {
  60
  61                 return -1;
  62         }
  63
  64         return 0;
  65 }
  66
  67 void *xdl_mmfile_first(mmfile_t *mmf, long *size)
  68 {
  69         *size = mmf->size;
  70         return mmf->ptr;
  71 }
  72
  73
  74 void *xdl_mmfile_next(mmfile_t *mmf, long *size)
  75 {
  76         return NULL;
  77 }
  78
  79
  80 long xdl_mmfile_size(mmfile_t *mmf)
  81 {
  82         return mmf->size;
  83 }
  84
  85
  86 int xdl_cha_init(chastore_t *cha, long isize, long icount) {
  87
  88         cha->head = cha->tail = NULL;
  89         cha->isize = isize;
  90         cha->nsize = icount * isize;
  91         cha->ancur = cha->sncur = NULL;
  92         cha->scurr = 0;
  93
  94         return 0;
  95 }
  96
  97
  98 void xdl_cha_free(chastore_t *cha) {
  99         chanode_t *cur, *tmp;
 100
 101         for (cur = cha->head; (tmp = cur) != NULL;) {
 102                 cur = cur->next;
 103                 xdl_free(tmp);
 104         }
 105 }
 106
 107
 108 void *xdl_cha_alloc(chastore_t *cha) {
 109         chanode_t *ancur;
 110         void *data;
 111
 112         if (!(ancur = cha->ancur) || ancur->icurr == cha->nsize) {
 113                 if (!(ancur = (chanode_t *) xdl_malloc(sizeof(chanode_t) + cha->nsize))) {
 114
 115                         return NULL;
 116                 }
 117                 ancur->icurr = 0;
 118                 ancur->next = NULL;
 119                 if (cha->tail)
 120                         cha->tail->next = ancur;
 121                 if (!cha->head)
 122                         cha->head = ancur;
 123                 cha->tail = ancur;
 124                 cha->ancur = ancur;
 125         }
 126
 127         data = (char *) ancur + sizeof(chanode_t) + ancur->icurr;
 128         ancur->icurr += cha->isize;
 129
 130         return data;
 131 }
 132
 133
 134 void *xdl_cha_first(chastore_t *cha) {
 135         chanode_t *sncur;
 136
 137         if (!(cha->sncur = sncur = cha->head))
 138                 return NULL;
 139
 140         cha->scurr = 0;
 141
 142         return (char *) sncur + sizeof(chanode_t) + cha->scurr;
 143 }
 144
 145
 146 void *xdl_cha_next(chastore_t *cha) {
 147         chanode_t *sncur;
 148
 149         if (!(sncur = cha->sncur))
 150                 return NULL;
 151         cha->scurr += cha->isize;
 152         if (cha->scurr == sncur->icurr) {
 153                 if (!(sncur = cha->sncur = sncur->next))
 154                         return NULL;
 155                 cha->scurr = 0;
 156         }
 157
 158         return (char *) sncur + sizeof(chanode_t) + cha->scurr;
 159 }
 160
 161
 162 long xdl_guess_lines(mmfile_t *mf) {
 163         long nl = 0, size, tsize = 0;
 164         char const *data, *cur, *top;
 165
 166         if ((cur = data = xdl_mmfile_first(mf, &size)) != NULL) {
 167                 for (top = data + size; nl < XDL_GUESS_NLINES;) {
 168                         if (cur >= top) {
 169                                 tsize += (long) (cur - data);
 170                                 if (!(cur = data = xdl_mmfile_next(mf, &size)))
 171                                         break;
 172                                 top = data + size;
 173                         }
 174                         nl++;
 175                         if (!(cur = memchr(cur, '\n', top - cur)))
 176                                 cur = top;
 177                         else
 178                                 cur++;
 179                 }
 180                 tsize += (long) (cur - data);
 181         }
 182
 183         if (nl && tsize)
 184                 nl = xdl_mmfile_size(mf) / (tsize / nl);
 185
 186         return nl + 1;
 187 }
 188
 189 int xdl_recmatch(const char *l1, long s1, const char *l2, long s2, long flags)
 190 {
 191         int i1, i2;
 192
 193         if (flags & XDF_IGNORE_WHITESPACE) {
 194                 for (i1 = i2 = 0; i1 < s1 && i2 < s2; ) {
 195                         if (isspace(l1[i1]))
 196                                 while (isspace(l1[i1]) && i1 < s1)
 197                                         i1++;
 198                         if (isspace(l2[i2]))
 199                                 while (isspace(l2[i2]) && i2 < s2)
 200                                         i2++;
 201                         if (i1 < s1 && i2 < s2 && l1[i1++] != l2[i2++])
 202                                 return 0;
 203                 }
 204                 return (i1 >= s1 && i2 >= s2);
 205         } else if (flags & XDF_IGNORE_WHITESPACE_CHANGE) {
 206                 for (i1 = i2 = 0; i1 < s1 && i2 < s2; ) {
 207                         if (isspace(l1[i1])) {
 208                                 if (!isspace(l2[i2]))
 209                                         return 0;
 210                                 while (isspace(l1[i1]) && i1 < s1)
 211                                         i1++;
 212                                 while (isspace(l2[i2]) && i2 < s2)
 213                                         i2++;
 214                         } else if (l1[i1++] != l2[i2++])
 215                                 return 0;
 216                 }
 217                 return (i1 >= s1 && i2 >= s2);
 218         } else if (flags & XDF_IGNORE_WHITESPACE_AT_EOL) {
 219                 for (i1 = i2 = 0; i1 < s1 && i2 < s2; ) {
 220                         if (l1[i1] != l2[i2]) {
 221                                 while (i1 < s1 && isspace(l1[i1]))
 222                                         i1++;
 223                                 while (i2 < s2 && isspace(l2[i2]))
 224                                         i2++;
 225                                 if (i1 < s1 || i2 < s2)
 226                                         return 0;
 227                                 return 1;
 228                         }
 229                         i1++;
 230                         i2++;
 231                 }
 232                 return i1 >= s1 && i2 >= s2;
 233         } else
 234                 return s1 == s2 && !memcmp(l1, l2, s1);
 235 }
 236
 237 static unsigned long xdl_hash_record_with_whitespace(char const **data,
 238                 char const *top, long flags) {
 239         unsigned long ha = 5381;
 240         char const *ptr = *data;
 241
 242         for (; ptr < top && *ptr != '\n'; ptr++) {
 243                 if (isspace(*ptr)) {
 244                         const char *ptr2 = ptr;
 245                         while (ptr + 1 < top && isspace(ptr[1])
 246                                         && ptr[1] != '\n')
 247                                 ptr++;
 248                         if (flags & XDF_IGNORE_WHITESPACE_CHANGE
 249                                         && ptr[1] != '\n') {
 250                                 ha += (ha << 5);
 251                                 ha ^= (unsigned long) ' ';
 252                         }
 253                         if (flags & XDF_IGNORE_WHITESPACE_AT_EOL
 254                                         && ptr[1] != '\n') {
 255                                 while (ptr2 != ptr + 1) {
 256                                         ha += (ha << 5);
 257                                         ha ^= (unsigned long) *ptr2;
 258                                         ptr2++;
 259                                 }
 260                         }
 261                         continue;
 262                 }
 263                 ha += (ha << 5);
 264                 ha ^= (unsigned long) *ptr;
 265         }
 266         *data = ptr < top ? ptr + 1: ptr;
 267
 268         return ha;
 269 }
 270
 271
 272 unsigned long xdl_hash_record(char const **data, char const *top, long flags) {
 273         unsigned long ha = 5381;
 274         char const *ptr = *data;
 275
 276         if (flags & XDF_WHITESPACE_FLAGS)
 277                 return xdl_hash_record_with_whitespace(data, top, flags);
 278
 279         for (; ptr < top && *ptr != '\n'; ptr++) {
 280                 ha += (ha << 5);
 281                 ha ^= (unsigned long) *ptr;
 282         }
 283         *data = ptr < top ? ptr + 1: ptr;
 284
 285         return ha;
 286 }
 287
 288
 289 unsigned int xdl_hashbits(unsigned int size) {
 290         unsigned int val = 1, bits = 0;
 291
 292         for (; val < size && bits < CHAR_BIT * sizeof(unsigned int); val <<= 1, bits++);
 293         return bits ? bits: 1;
 294 }
 295
 296
 297 int xdl_num_out(char *out, long val) {
 298         char *ptr, *str = out;
 299         char buf[32];
 300
 301         ptr = buf + sizeof(buf) - 1;
 302         *ptr = '\0';
 303         if (val < 0) {
 304                 *--ptr = '-';
 305                 val = -val;
 306         }
 307         for (; val && ptr > buf; val /= 10)
 308                 *--ptr = "0123456789"[val % 10];
 309         if (*ptr)
 310                 for (; *ptr; ptr++, str++)
 311                         *str = *ptr;
 312         else
 313                 *str++ = '0';
 314         *str = '\0';
 315
 316         return str - out;
 317 }
 318
 319
 320 long xdl_atol(char const *str, char const **next) {
 321         long val, base;
 322         char const *top;
 323
 324         for (top = str; XDL_ISDIGIT(*top); top++);
 325         if (next)
 326                 *next = top;
 327         for (val = 0, base = 1, top--; top >= str; top--, base *= 10)
 328                 val += base * (long)(*top - '0');
 329         return val;
 330 }
 331
 332
 333 int xdl_emit_hunk_hdr(long s1, long c1, long s2, long c2,
 334                       const char *func, long funclen, xdemitcb_t *ecb) {
 335         int nb = 0;
 336         mmbuffer_t mb;
 337         char buf[128];
 338
 339         memcpy(buf, "@@ -", 4);
 340         nb += 4;
 341
 342         nb += xdl_num_out(buf + nb, c1 ? s1: s1 - 1);
 343
 344         if (c1 != 1) {
 345                 memcpy(buf + nb, ",", 1);
 346                 nb += 1;
 347
 348                 nb += xdl_num_out(buf + nb, c1);
 349         }
 350
 351         memcpy(buf + nb, " +", 2);
 352         nb += 2;
 353
 354         nb += xdl_num_out(buf + nb, c2 ? s2: s2 - 1);
 355
 356         if (c2 != 1) {
 357                 memcpy(buf + nb, ",", 1);
 358                 nb += 1;
 359
 360                 nb += xdl_num_out(buf + nb, c2);
 361         }
 362
 363         memcpy(buf + nb, " @@", 3);
 364         nb += 3;
 365         if (func && funclen) {
 366                 buf[nb++] = ' ';
 367                 if (funclen > sizeof(buf) - nb - 1)
 368                         funclen = sizeof(buf) - nb - 1;
 369                 memcpy(buf + nb, func, funclen);
 370                 nb += funclen;
 371         }
 372         buf[nb++] = '\n';
 373
 374         mb.ptr = buf;
 375         mb.size = nb;
 376         if (ecb->outf(ecb->priv, &mb, 1) < 0)
 377                 return -1;
 378
 379         return 0;
 380 }