coreutils/coreutils-i18n-infloop.patch

15 lines
958 B
Diff
Raw Normal View History

Index: src/sort.c
===================================================================
--- src/sort.c.orig 2011-01-05 14:27:40.227218942 +0100
+++ src/sort.c 2011-01-05 14:27:40.574228931 +0100
@@ -3134,7 +3134,8 @@ keycompare_mb (const struct line *a, con
- Update to 8.6: o bugfixes * du no longer multiply counts a file that is a directory or whose link count is 1. * du -H and -L now consistently count pointed-to files instead of symbolic links, and correctly diagnose dangling symlinks. * du --ignore=D now ignores directory D even when that directory is found to be part of a directory cycle. * split now diagnoses read errors rather than silently exiting. * tac would perform a double-free when given an input line longer than 16KiB. * tail -F once again notices changes in a currently unavailable directory, and works around a Linux kernel bug where inotify runs out of resources. * tr now consistently handles case conversion character classes. o New features * cp now accepts the --attributes-only option to not copy file data. * du recognizes -d N as equivalent to --max-depth=N * sort now accepts the --debug option, to highlight the part of the line significant in the sort, and warns about questionable options. * sort now supports -d, -f, -i, -R, and -V in any combination. * stat now accepts the %m format directive to output the mount point for a file. It also accepts the %w and %W format directives for outputting the birth time of a file, if one is available. o Changes in behavior * df now consistently prints the device name for a bind mounted file, rather than its aliased target. * du now uses less than half as much memory when operating on trees with many hard-linked files. OBS-URL: https://build.opensuse.org/package/show/Base:System/coreutils?expand=0&rev=18
2010-11-11 18:25:53 +01:00
if (MBLENGTH == (size_t)-2 || MBLENGTH == (size_t)-1) \
STATE = state_bak; \
if (!ignore) \
- COPY[NEW_LEN++] = TEXT[i++]; \
+ COPY[NEW_LEN++] = TEXT[i]; \
+ i++; \
continue; \
} \
\