Lines Matching defs:to
26 grants you additional permission to convey the resulting work.
98 /* Make sure we don't try to store part of the log line, and thus
108 _("%s: %s: Failed to allocate enough memory; memory exhausted.\n"),
114 _("%s: %s: Failed to allocate %ld bytes; memory exhausted.\n"),
127 C0 control codes (0x00 to 0x1F inclusive)
215 on the char after the last char) to a new, malloc-ed location.
264 allocated with malloc, which is returned. If unable to print due
265 to invalid format, returns NULL. Inability to allocate needed
267 similar to the GNU/BSD extension asprintf, but somewhat easier to
306 passed a FMT that causes snprintf to consistently return -1. */
335 /* else, we continue to grow our
393 /* Format the provided time according to the specified format. The
408 /* Return pointer to a static char[] buffer in which zero-terminated
451 /* We must create the file immediately to avoid either a race
452 condition (which arises from using unique_name and failing to
453 use fopen_excl) or lying to the user about the log file name
475 printf (_("Output will be written to %s.\n"), quote (opt.lfilename));
492 specified with TM. The atime ("access time") is set to the current
525 logprintf (LOG_VERBOSE, _("Failed to unlink symlink %s: %s\n"),
535 proper way should, of course, be to have a third, error state,
537 additional complexity to the callers. */
555 /* Use lstat() rather than stat() so that symbolic links pointing to
569 /* We use fseek rather than stat to determine the file size because
696 this function will *fail* and errno will be set to EEXIST. If
698 to fopen's "wb".
768 /* Manually check whether the file exists. This is prone to race
785 The behaviour of this function should be identical to the behaviour
793 /* Make a copy of dir, to be able to write to it. Otherwise, the
807 of intermediate directories to fail, as the initial path components
858 /* Turn PATTERN and STRING to lower case and call fnmatch on them. */
874 /* Determine whether a file is acceptable to be followed, according to
875 lists of patterns to accept/reject. */
983 /* We want this to be fast, so we code two loops, one with
1008 according to whether the element contains wildcards or not.
1076 following (case-insensitive) suffixes are presumed to be HTML
1084 refers to a file that contains HTML! */
1101 /* Read a line from FP and return the pointer to freshly allocated
1131 /* fgets() guarantees to read the whole line, or to use up the
1145 LENGTH. We don't need to zero-terminate the string ourselves,
1152 /* Read FILE into memory. A pointer to `struct file_memory' are
1153 returned; use struct element `content' to access file contents, and
1154 the element `length' to know the file length. `content' is *not*
1158 After you are done with the file contents, call read_file_free to
1166 If you want to read from a real file named "-", use "./-" instead. */
1198 modify the file text. Relying on this would enable us to
1200 efficiency, but at some cost to generality. */
1214 to a plain file. However, it's also possible that mmap() doesn't
1216 fails, we just fall back to the regular method. */
1230 read() refuses to read more than 4K from a file at a
1235 /* Normally, we grow SIZE exponentially to make the number
1236 of calls to read() and realloc() logarithmic in relation
1237 to file size. However, read() can read an amount of data
1238 smaller than requested, and it would be unreasonable to
1259 /* Due to exponential growth of fm->content, the allocated region
1275 malloc/read were used to read in the file. It also frees the
1276 memory needed to hold the FM structure itself. */
1309 /* Append vector V2 to vector V1. The function frees V2 and
1340 /* Append a freshly allocated copy of STR to VEC. If VEC is NULL, it
1347 the one we're about to append */
1356 /* Reallocate the array to fit the new element and the NULL. */
1358 /* Append a copy of STR to the vector. */
1365 /* Sometimes it's useful to create "sets" of strings, i.e. special
1366 hash tables where you want to store strings as keys and merely
1374 do nothing so that we don't have to free() the old element and
1380 value, and it consumes no memory -- the pointers to the same
1394 /* Convert the specified string set to array. ARRAY should be large
1395 enough to hold hash_table_count(ht) char pointers. */
1433 and is cached after the first call to the function.
1436 locale), this forces it to be ",". We are now only showing
1461 grouping, which we still want to use it for legibility.
1462 In those locales set the sep char to ',', unless that
1464 to ".". */
1481 Unfortunately, we cannot use %'d (in fact it would be %'j) to get
1482 the separators because it's too non-portable, and it's hard to test
1522 /* Prepend SEP to every groupsize'd digit and get new groupsize. */
1540 /* N, a byte quantity, is converted to a human-readable abberviated
1541 form a la sizes printed by `ls -lh'. The result is written to a
1542 static buffer, a pointer to which is returned.
1544 Unlike `with_thousand_seps', this approximates to the nearest unit.
1546 digits effectively, but longer strings of digits are more prone to
1547 misinterpretation. Hence, converting to an abbreviated form
1601 /* Count the digits in the provided number. Used to allocate space
1617 /* DIGITS_<D> is used to print a D-digit number and should be called
1619 n to n%mask (the remaining digits), and calling DIGITS_<D-1>.
1645 /* Shorthand for casting to wgint. */
1648 /* Print NUMBER to BUFFER in base 10. This is equivalent to
1650 faster and portable to machines without long long.
1653 convert numbers to strings. Some implementations of sprintf,
1655 to be quite slow when converting integers to strings.
1657 Return the pointer to the location where the terminating zero was
1658 printed. (Equivalent to calling buffer+strlen(buffer) after the
1661 BUFFER should be large enough to accept as many bytes as you expect
1662 the number to take up. On machines with 64-bit wgints the maximum
1677 printing to sprintf. */
1685 /* n = -n would overflow because -n would evaluate to a
1686 wgint value larger than WGINT_MAX. Need to make n
1720 Constants are constructed by compile-time multiplication to avoid
1769 /* Print NUMBER to a statically allocated string and return a pointer
1770 to the printed representation.
1772 This function is intended to be used in conjunction with printf.
1773 It is hard to portably print wgint values:
1782 d) you cannot #define WGINT_FMT to the appropriate format and use
1790 CAVEAT: since the function returns pointers to static data, you
1791 must be careful to copy its result before calling it again.
1792 However, to make it more useful with printf, the function maintains
1793 an internal ring of static buffers to return. That way things like
1797 %s %s %s" won't. If you need to print more than three wgints,
1818 /* If there's a way to get the terminal size using POSIX
1856 for cryptography. It is only meant to be used in situations where
1937 /* We don't have siglongjmp to preserve the set of blocked signals;
1944 /* Now it's safe to longjump. */
1949 /* Arrange for SIGALRM to be delivered in TIMEOUT seconds. This uses
1953 it would be rounded to zero, it is rounded to the least legal value
1975 /* Round TIMEOUTs smaller than 1 to 1, not to zero. This is
1998 /* Call FUN(ARG), but don't allow it to run for more than TIMEOUT
2002 This works by setting up SIGALRM to be delivered in TIMEOUT seconds
2005 advantages compared to the traditional approach of relying on
2006 signals causing system calls to exit with EINTR:
2018 to signal(). (It does use sigsetjmp/siglongjmp, but they're
2022 are normally freed prior to exit from the functions, they will be
2082 accuracy and, more importantly, because it allows us to reliably
2091 sleeping period and return to sleep. */
2094 /* If usleep is available, use it in preference to select. */
2105 /* Note that, although Windows supports select, it can't be used to
2115 actually slept, we can't return to sleep. Using gettimeofday to
2116 track sleeps is slow and unreliable due to clock skew. */
2122 /* Encode the octets in DATA of length LENGTH to base64 format,
2123 storing the result to DEST. The output will be zero-terminated,
2124 and must point to a writable buffer of at least
2148 /* Transform the 3x8 bits to 4x6 bits, as required by base64. */
2188 pointed to by DEST. DEST is assumed to be large enough to
2189 accomodate the decoded data, which is guaranteed to be no more than
2192 Since DEST is assumed to contain binary data, it is not
2194 written to TO. -1 is returned in case of error caused by malformed
2294 mergesort_internal (void *base, void *temp, size_t size, size_t from, size_t to,
2298 if (from < to)
2301 size_t mid = (to + from) / 2;
2303 mergesort_internal (base, temp, size, mid + 1, to, cmpfun);
2306 for (k = from; (i <= mid) && (j <= to); k++)
2313 while (j <= to)
2315 for (k = from; k <= to; k++)
2337 /* Print a decimal number. If it is equal to or larger than ten, the
2355 /* Cut off at 9.95 because the below %.1f would round 9.96 to
2363 /* round [0.0005, 0.001) to 0.001 */
2366 /* print numbers close to 0 as 0, not 0.000 */