1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
|
/* frcode -- front-compress a sorted list
Copyright (C) 1994,2005,2006,2007 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/* Usage: frcode < sorted-list > compressed-list
Uses front compression (also known as incremental encoding);
see ";login:", March 1983, p. 8.
The input is a sorted list of NUL-terminated strings (or
newline-terminated if the -0 option is not given).
The output entries are in the same order as the input; each entry
consists of a signed offset-differential count byte (the additional
number of characters of prefix of the preceding entry to use beyond
the number that the preceding entry is using of its predecessor),
followed by a null-terminated ASCII remainder.
If the offset-differential count is larger than can be stored
in a byte (+/-127), the byte has the value LOCATEDB_ESCAPE
and the count follows in a 2-byte word, with the high byte first
(network byte order).
Example:
Input, with NULs changed to newlines:
/usr/src
/usr/src/cmd/aardvark.c
/usr/src/cmd/armadillo.c
/usr/tmp/zoo
Length of the longest prefix of the preceding entry to share:
0 /usr/src
8 /cmd/aardvark.c
14 rmadillo.c
5 tmp/zoo
Output, with NULs changed to newlines and count bytes made printable:
0 LOCATE02
0 /usr/src
8 /cmd/aardvark.c
6 rmadillo.c
-9 tmp/zoo
(6 = 14 - 8, and -9 = 5 - 14)
Written by James A. Woods <jwoods@adobe.com>.
Modified by David MacKenzie <djm@gnu.org>.
Modified by James Youngman <jay@gnu.org>.
*/
#include <config.h>
#include <stdio.h>
#include <limits.h>
#include <assert.h>
#include <errno.h>
#include <sys/types.h>
#include <stdbool.h>
#if defined HAVE_STRING_H || defined STDC_HEADERS
#include <string.h>
#else
#include <strings.h>
#endif
#ifdef STDC_HEADERS
#include <stdlib.h>
#endif
#if ENABLE_NLS
# include <libintl.h>
# define _(Text) gettext (Text)
#else
# define _(Text) Text
#define textdomain(Domain)
#define bindtextdomain(Package, Directory)
#endif
#ifdef gettext_noop
# define N_(String) gettext_noop (String)
#else
/* We used to use (String) instead of just String, but apparently ISO C
* doesn't allow this (at least, that's what HP said when someone reported
* this as a compiler bug). This is HP case number 1205608192. See
* also http://gcc.gnu.org/bugzilla/show_bug.cgi?id=11250 (which references
* ANSI 3.5.7p14-15). The Intel icc compiler also rejects constructs
* like: static const char buf[] = ("string");
*/
# define N_(String) String
#endif
#include "locatedb.h"
#include <getopt.h>
#include "error.h"
#include "closeout.h"
#include "findutils-version.h"
char *xmalloc PARAMS((size_t));
/* The name this program was run with. */
char *program_name;
/* Write out a 16-bit int, high byte first (network byte order).
* Return true iff all went well.
*/
static int
put_short (int c, FILE *fp)
{
/* XXX: The value of c may be negative. ANSI C 1989 (section 6.3.7)
* indicates that the result of shifting a negative value right is
* implementation defined.
*/
assert (c <= SHRT_MAX);
assert (c >= SHRT_MIN);
return (putc (c >> 8, fp) != EOF) && (putc (c, fp) != EOF);
}
/* Return the length of the longest common prefix of strings S1 and S2. */
static int
prefix_length (char *s1, char *s2)
{
register char *start;
int limit = INT_MAX;
for (start = s1; *s1 == *s2 && *s1 != '\0'; s1++, s2++)
{
/* Don't emit a prefix length that will not fit into
* our return type.
*/
if (0 == --limit)
break;
}
return s1 - start;
}
static struct option const longopts[] =
{
{"help", no_argument, NULL, 'h'},
{"version", no_argument, NULL, 'v'},
{"null", no_argument, NULL, '0'},
{NULL, no_argument, NULL, 0}
};
extern char *version_string;
/* The name this program was run with. */
char *program_name;
static void
usage (FILE *stream)
{
fprintf (stream,
_("Usage: %s [-0 | --null] [--version] [--help]\n"),
program_name);
fputs (_("\nReport bugs to <bug-findutils@gnu.org>.\n"), stream);
}
static long
get_seclevel(char *s)
{
long result;
char *p;
/* Reset errno in oreder to be able to distinguish LONG_MAX/LONG_MIN
* from values whichare actually out of range
*/
errno = 0;
result = strtol(s, &p, 10);
if ((0==result) && (p == optarg))
{
error(1, 0, _("You need to specify a security level as a decimal integer."));
/*NOTREACHED*/
return -1;
}
else if ((LONG_MIN==result || LONG_MAX==result) && errno)
{
error(1, 0, _("Security level %s is outside the convertible range."), s);
/*NOTREACHED*/
return -1;
}
else if (*p)
{
/* Some suffix exists */
error(1, 0, _("Security level %s has unexpected suffix %s."), s, p);
/*NOTREACHED*/
return -1;
}
else
{
return result;
}
}
static void
outerr(void)
{
/* Issue the same error message as closeout() would. */
error(1, errno, _("write error"));
}
int
main (int argc, char **argv)
{
char *path; /* The current input entry. */
char *oldpath; /* The previous input entry. */
size_t pathsize, oldpathsize; /* Amounts allocated for them. */
int count, oldcount, diffcount; /* Their prefix lengths & the difference. */
int line_len; /* Length of input line. */
int delimiter = '\n';
int optc;
int slocate_compat = 0;
long slocate_seclevel = 0L;
program_name = argv[0];
if (!program_name)
program_name = "frcode";
atexit (close_stdout);
pathsize = oldpathsize = 1026; /* Increased as necessary by getline. */
path = xmalloc (pathsize);
oldpath = xmalloc (oldpathsize);
oldpath[0] = 0;
oldcount = 0;
while ((optc = getopt_long (argc, argv, "hv0S:", longopts, (int *) 0)) != -1)
switch (optc)
{
case '0':
delimiter = 0;
break;
case 'S':
slocate_compat = 1;
slocate_seclevel = get_seclevel(optarg);
if (slocate_seclevel < 0 || slocate_seclevel > 1)
{
error(1, 0,
_("slocate security level %ld is unsupported."),
slocate_seclevel);
}
break;
case 'h':
usage (stdout);
return 0;
case 'v':
display_findutils_version("frcode");
return 0;
default:
usage (stderr);
return 1;
}
/* We expect to have no arguments. */
if (optind != argc)
{
usage (stderr);
return 1;
}
if (slocate_compat)
{
fputc(slocate_seclevel ? '1' : '0', stdout);
fputc(0, stdout);
}
else
{
/* GNU LOCATE02 format */
if (fwrite (LOCATEDB_MAGIC, 1, sizeof (LOCATEDB_MAGIC), stdout)
!= sizeof(LOCATEDB_MAGIC))
{
error(1, errno, _("Failed to write to standard output"));
}
}
while ((line_len = getdelim (&path, &pathsize, delimiter, stdin)) > 0)
{
path[line_len - 1] = '\0'; /* FIXME temporary: nuke the newline. */
count = prefix_length (oldpath, path);
diffcount = count - oldcount;
if ( (diffcount > SHRT_MAX) || (diffcount < SHRT_MIN) )
{
/* We do this to prevent overflow of the value we
* write with put_short()
*/
count = 0;
diffcount = (-oldcount);
}
oldcount = count;
if (slocate_compat)
{
/* Emit no count for the first pathname. */
slocate_compat = 0;
}
else
{
/* If the difference is small, it fits in one byte;
otherwise, two bytes plus a marker noting that fact. */
if (diffcount < LOCATEDB_ONEBYTE_MIN
|| diffcount > LOCATEDB_ONEBYTE_MAX)
{
if (EOF == putc (LOCATEDB_ESCAPE, stdout))
outerr();
if (!put_short (diffcount, stdout))
outerr();
}
else
{
if (EOF == putc (diffcount, stdout))
outerr();
}
}
if ( (EOF == fputs (path + count, stdout))
|| (EOF == putc ('\0', stdout)))
{
outerr();
}
if (1)
{
/* Swap path and oldpath and their sizes. */
char *tmppath = oldpath;
size_t tmppathsize = oldpathsize;
oldpath = path;
oldpathsize = pathsize;
path = tmppath;
pathsize = tmppathsize;
}
}
free (path);
free (oldpath);
return 0;
}
|