whitespace fixes (leading spaces to tab)
No binary (build failed)
—
(log yok)
| @@ -1008,7 +1008,7 @@ static void compress_block(ct_data * ltree, ct_data * dtree); | |
| # define SEND_CODE(c, tree) \ | |
| { \ | |
| if (verbose > 1) bb_error_msg("\ncd %3d ",(c)); \ | |
| - | send_bits(tree[c].Code, tree[c].Len); \ |
| + | send_bits(tree[c].Code, tree[c].Len); \ |
| } | |
| #endif | |
| @@ -103,7 +103,7 @@ char get_header_cpio(archive_handle_t *archive_handle) | |
| /* Always round up */ | |
| printf("%d blocks\n", (int) (archive_handle->offset % 512 ? | |
| archive_handle->offset / 512 + 1 : | |
| - | archive_handle->offset / 512 |
| + | archive_handle->offset / 512 |
| )); | |
| if (saved_hardlinks) { /* Bummer - we still have unresolved hardlinks */ | |
| hardlinks_t *tmp = saved_hardlinks; | |
| @@ -72,7 +72,7 @@ int chown_main(int argc, char **argv) | |
| *groupName = ':'; /* replace '.' with ':' */ | |
| /* First, try parsing "user[:[group]]" */ | |
| - | if (!groupName) { /* "user" */ |
| + | if (!groupName) { /* "user" */ |
| ugid.uid = get_ug_id(*argv, xuname2uid); | |
| } else if (groupName == *argv) { /* ":group" */ | |
| ugid.gid = get_ug_id(groupName + 1, xgroup2gid); | |
| @@ -86,7 +86,7 @@ int install_main(int argc, char **argv) | |
| break; | |
| } | |
| } | |
| - | if ((flags & (OPT_OWNER|OPT_GROUP)) |
| + | if ((flags & (OPT_OWNER|OPT_GROUP)) |
| && lchown(*argv, uid, gid) == -1 | |
| ) { | |
| bb_perror_msg("cannot change ownership of %s", *argv); | |
| @@ -2648,7 +2648,7 @@ int awk_main(int argc, char **argv) | |
| char *vnames = (char *)vNames; /* cheat */ | |
| char *vvalues = (char *)vValues; | |
| - | /* Undo busybox.c, or else strtod may eat ','! This breaks parsing: |
| + | /* Undo busybox.c, or else strtod may eat ','! This breaks parsing: |
| * $1,$2 == '$1,' '$2', NOT '$1' ',' '$2' */ | |
| if (ENABLE_LOCALE_SUPPORT) | |
| setlocale(LC_NUMERIC, "C"); | |
| @@ -423,8 +423,8 @@ extern long xgroup2gid(const char *name); | |
| extern unsigned long get_ug_id(const char *s, long (*xname2id)(const char *)); | |
| /* from chpst. Does not die, returns 0 on failure */ | |
| struct bb_uidgid_t { | |
| - | uid_t uid; |
| - | gid_t gid; |
| + | uid_t uid; |
| + | gid_t gid; |
| }; | |
| extern int get_uidgid(struct bb_uidgid_t*, const char*, int numeric_ok); | |
| /* what is this? */ | |
| @@ -335,7 +335,7 @@ free_session(struct tsession *ts) | |
| free(ts); | |
| /* scan all sessions and find new maxfd */ | |
| - | ts = sessions; |
| + | ts = sessions; |
| maxfd = 0; | |
| while (ts) { | |
| if (maxfd < ts->ptyfd) | |
| @@ -94,7 +94,7 @@ do_it_now: | |
| pid = getpid(); | |
| sid = getsid(pid); | |
| /* Now kill all processes except our session */ | |
| - | while ((p = procps_scan(p, PSSCAN_PID|PSSCAN_SID))) { |
| + | while ((p = procps_scan(p, PSSCAN_PID|PSSCAN_SID))) { |
| if (p->sid != sid && p->pid != pid && p->pid != 1) | |
| kill(p->pid, signo); | |
| } | |
| @@ -179,8 +179,8 @@ static void do_scroll(WINDOW *win, int *scroll, int n) | |
| * Display a menu for choosing among a number of options | |
| */ | |
| int dialog_menu(const char *title, const char *prompt, int height, int width, | |
| - | int menu_height, const char *current, int item_no, |
| - | const char *const *items) |
| + | int menu_height, const char *current, int item_no, |
| + | const char *const *items) |
| { | |
| int i, j, x, y, box_x, box_y; | |
| int key = 0, button = 0, scroll = 0, choice = 0; | |
| @@ -201,7 +201,7 @@ static void log_to_shmem(const char *msg, int len) | |
| /* Circular Buffer Algorithm: | |
| * -------------------------- | |
| - | * tail == position where to store next syslog message. |
| + | * tail == position where to store next syslog message. |
| * head == position of next message to retrieve ("print"). | |
| * if head == tail, there is no "unprinted" messages left. | |
| * head is typically advanced by separate "reader" program, | |
| @@ -155,7 +155,7 @@ static char super_block_buffer[BLOCK_SIZE]; | |
| /* gcc likes this more (code is smaller) than macro variant */ | |
| static ATTRIBUTE_ALWAYS_INLINE unsigned div_roundup(unsigned size, unsigned n) | |
| { | |
| - | return (size + n-1) / n; |
| + | return (size + n-1) / n; |
| } | |
| #if ENABLE_FEATURE_MINIX2 | |