vsprintf.c 70.4 KB
Newer Older
Linus Torvalds's avatar
Linus Torvalds committed
1 2 3 4 5 6 7 8 9 10 11
/*
 *  linux/lib/vsprintf.c
 *
 *  Copyright (C) 1991, 1992  Linus Torvalds
 */

/* vsprintf.c -- Lars Wirzenius & Linus Torvalds. */
/*
 * Wirzenius wrote this portably, Torvalds fucked it up :-)
 */

12
/*
Linus Torvalds's avatar
Linus Torvalds committed
13 14 15 16 17 18 19
 * Fri Jul 13 2001 Crutcher Dunnavant <crutcher+kernel@datastacks.com>
 * - changed to provide snprintf and vsnprintf functions
 * So Feb  1 16:51:32 CET 2004 Juergen Quade <quade@hsnr.de>
 * - scnprintf and vscnprintf
 */

#include <stdarg.h>
Stephen Boyd's avatar
Stephen Boyd committed
20
#include <linux/clk.h>
21
#include <linux/clk-provider.h>
22
#include <linux/module.h>	/* for KSYM_SYMBOL_LEN */
Linus Torvalds's avatar
Linus Torvalds committed
23 24 25 26
#include <linux/types.h>
#include <linux/string.h>
#include <linux/ctype.h>
#include <linux/kernel.h>
27
#include <linux/kallsyms.h>
28
#include <linux/math64.h>
29
#include <linux/uaccess.h>
30
#include <linux/ioport.h>
31
#include <linux/dcache.h>
32
#include <linux/cred.h>
33
#include <linux/uuid.h>
34
#include <linux/of.h>
35
#include <net/addrconf.h>
36 37 38
#ifdef CONFIG_BLOCK
#include <linux/blkdev.h>
#endif
Linus Torvalds's avatar
Linus Torvalds committed
39

40 41
#include "../mm/internal.h"	/* For the trace_print_flags arrays */

Tim Schmielau's avatar
Tim Schmielau committed
42
#include <asm/page.h>		/* for PAGE_SIZE */
43
#include <asm/sections.h>	/* for dereference_function_descriptor() */
44
#include <asm/byteorder.h>	/* cpu_to_le16 */
Linus Torvalds's avatar
Linus Torvalds committed
45

46
#include <linux/string_helpers.h>
47
#include "kstrtox.h"
48

Linus Torvalds's avatar
Linus Torvalds committed
49
/**
50
 * simple_strtoull - convert a string to an unsigned long long
Linus Torvalds's avatar
Linus Torvalds committed
51 52 53
 * @cp: The start of the string
 * @endp: A pointer to the end of the parsed string will be placed here
 * @base: The number base to use
54 55
 *
 * This function is obsolete. Please use kstrtoull instead.
Linus Torvalds's avatar
Linus Torvalds committed
56
 */
57
unsigned long long simple_strtoull(const char *cp, char **endp, unsigned int base)
Linus Torvalds's avatar
Linus Torvalds committed
58
{
59 60
	unsigned long long result;
	unsigned int rv;
61

62 63 64 65
	cp = _parse_integer_fixup_radix(cp, &base);
	rv = _parse_integer(cp, base, &result);
	/* FIXME */
	cp += (rv & ~KSTRTOX_OVERFLOW);
66

Linus Torvalds's avatar
Linus Torvalds committed
67 68
	if (endp)
		*endp = (char *)cp;
69

Linus Torvalds's avatar
Linus Torvalds committed
70 71
	return result;
}
72
EXPORT_SYMBOL(simple_strtoull);
Linus Torvalds's avatar
Linus Torvalds committed
73 74

/**
75
 * simple_strtoul - convert a string to an unsigned long
Linus Torvalds's avatar
Linus Torvalds committed
76 77 78
 * @cp: The start of the string
 * @endp: A pointer to the end of the parsed string will be placed here
 * @base: The number base to use
79 80
 *
 * This function is obsolete. Please use kstrtoul instead.
Linus Torvalds's avatar
Linus Torvalds committed
81
 */
82
unsigned long simple_strtoul(const char *cp, char **endp, unsigned int base)
Linus Torvalds's avatar
Linus Torvalds committed
83
{
84
	return simple_strtoull(cp, endp, base);
Linus Torvalds's avatar
Linus Torvalds committed
85
}
86
EXPORT_SYMBOL(simple_strtoul);
Linus Torvalds's avatar
Linus Torvalds committed
87 88

/**
89
 * simple_strtol - convert a string to a signed long
Linus Torvalds's avatar
Linus Torvalds committed
90 91 92
 * @cp: The start of the string
 * @endp: A pointer to the end of the parsed string will be placed here
 * @base: The number base to use
93 94
 *
 * This function is obsolete. Please use kstrtol instead.
Linus Torvalds's avatar
Linus Torvalds committed
95
 */
96
long simple_strtol(const char *cp, char **endp, unsigned int base)
Linus Torvalds's avatar
Linus Torvalds committed
97
{
98 99
	if (*cp == '-')
		return -simple_strtoul(cp + 1, endp, base);
100

101
	return simple_strtoul(cp, endp, base);
Linus Torvalds's avatar
Linus Torvalds committed
102
}
103
EXPORT_SYMBOL(simple_strtol);
Linus Torvalds's avatar
Linus Torvalds committed
104 105 106 107 108 109

/**
 * simple_strtoll - convert a string to a signed long long
 * @cp: The start of the string
 * @endp: A pointer to the end of the parsed string will be placed here
 * @base: The number base to use
110 111
 *
 * This function is obsolete. Please use kstrtoll instead.
Linus Torvalds's avatar
Linus Torvalds committed
112
 */
Harvey Harrison's avatar
Harvey Harrison committed
113
long long simple_strtoll(const char *cp, char **endp, unsigned int base)
Linus Torvalds's avatar
Linus Torvalds committed
114
{
115
	if (*cp == '-')
Harvey Harrison's avatar
Harvey Harrison committed
116
		return -simple_strtoull(cp + 1, endp, base);
117

Harvey Harrison's avatar
Harvey Harrison committed
118
	return simple_strtoull(cp, endp, base);
Linus Torvalds's avatar
Linus Torvalds committed
119
}
120
EXPORT_SYMBOL(simple_strtoll);
Linus Torvalds's avatar
Linus Torvalds committed
121

122 123
static noinline_for_stack
int skip_atoi(const char **s)
Linus Torvalds's avatar
Linus Torvalds committed
124
{
125
	int i = 0;
Linus Torvalds's avatar
Linus Torvalds committed
126

127
	do {
Linus Torvalds's avatar
Linus Torvalds committed
128
		i = i*10 + *((*s)++) - '0';
129
	} while (isdigit(**s));
130

Linus Torvalds's avatar
Linus Torvalds committed
131 132 133
	return i;
}

134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156
/*
 * Decimal conversion is by far the most typical, and is used for
 * /proc and /sys data. This directly impacts e.g. top performance
 * with many processes running. We optimize it for speed by emitting
 * two characters at a time, using a 200 byte lookup table. This
 * roughly halves the number of multiplications compared to computing
 * the digits one at a time. Implementation strongly inspired by the
 * previous version, which in turn used ideas described at
 * <http://www.cs.uiowa.edu/~jones/bcd/divide.html> (with permission
 * from the author, Douglas W. Jones).
 *
 * It turns out there is precisely one 26 bit fixed-point
 * approximation a of 64/100 for which x/100 == (x * (u64)a) >> 32
 * holds for all x in [0, 10^8-1], namely a = 0x28f5c29. The actual
 * range happens to be somewhat larger (x <= 1073741898), but that's
 * irrelevant for our purpose.
 *
 * For dividing a number in the range [10^4, 10^6-1] by 100, we still
 * need a 32x32->64 bit multiply, so we simply use the same constant.
 *
 * For dividing a number in the range [100, 10^4-1] by 100, there are
 * several options. The simplest is (x * 0x147b) >> 19, which is valid
 * for all x <= 43698.
157
 */
158

159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175
static const u16 decpair[100] = {
#define _(x) (__force u16) cpu_to_le16(((x % 10) | ((x / 10) << 8)) + 0x3030)
	_( 0), _( 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),
#undef _
};

/*
 * This will print a single '0' even if r == 0, since we would
176 177 178
 * immediately jump to out_r where two 0s would be written but only
 * one of them accounted for in buf. This is needed by ip4_string
 * below. All other callers pass a non-zero value of r.
179
*/
180
static noinline_for_stack
181
char *put_dec_trunc8(char *buf, unsigned r)
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
	unsigned q;

	/* 1 <= r < 10^8 */
	if (r < 100)
		goto out_r;

	/* 100 <= r < 10^8 */
	q = (r * (u64)0x28f5c29) >> 32;
	*((u16 *)buf) = decpair[r - 100*q];
	buf += 2;

	/* 1 <= q < 10^6 */
	if (q < 100)
		goto out_q;

	/*  100 <= q < 10^6 */
	r = (q * (u64)0x28f5c29) >> 32;
	*((u16 *)buf) = decpair[q - 100*r];
	buf += 2;

	/* 1 <= r < 10^4 */
	if (r < 100)
		goto out_r;

	/* 100 <= r < 10^4 */
	q = (r * 0x147b) >> 19;
	*((u16 *)buf) = decpair[r - 100*q];
	buf += 2;
out_q:
	/* 1 <= q < 100 */
	r = q;
out_r:
	/* 1 <= r < 100 */
	*((u16 *)buf) = decpair[r];
217
	buf += r < 10 ? 1 : 2;
218 219
	return buf;
}
220

221
#if BITS_PER_LONG == 64 && BITS_PER_LONG_LONG == 64
222
static noinline_for_stack
223
char *put_dec_full8(char *buf, unsigned r)
224
{
225 226
	unsigned q;

227 228 229 230
	/* 0 <= r < 10^8 */
	q = (r * (u64)0x28f5c29) >> 32;
	*((u16 *)buf) = decpair[r - 100*q];
	buf += 2;
231

232 233 234 235
	/* 0 <= q < 10^6 */
	r = (q * (u64)0x28f5c29) >> 32;
	*((u16 *)buf) = decpair[q - 100*r];
	buf += 2;
236

237 238 239 240
	/* 0 <= r < 10^4 */
	q = (r * 0x147b) >> 19;
	*((u16 *)buf) = decpair[r - 100*q];
	buf += 2;
241

242 243 244 245 246
	/* 0 <= q < 100 */
	*((u16 *)buf) = decpair[q];
	buf += 2;
	return buf;
}
247

248
static noinline_for_stack
249 250
char *put_dec(char *buf, unsigned long long n)
{
251 252 253 254 255 256
	if (n >= 100*1000*1000)
		buf = put_dec_full8(buf, do_div(n, 100*1000*1000));
	/* 1 <= n <= 1.6e11 */
	if (n >= 100*1000*1000)
		buf = put_dec_full8(buf, do_div(n, 100*1000*1000));
	/* 1 <= n < 1e8 */
257
	return put_dec_trunc8(buf, n);
258
}
259

260
#elif BITS_PER_LONG == 32 && BITS_PER_LONG_LONG == 64
261

262 263
static void
put_dec_full4(char *buf, unsigned r)
264
{
265 266 267 268 269 270 271 272
	unsigned q;

	/* 0 <= r < 10^4 */
	q = (r * 0x147b) >> 19;
	*((u16 *)buf) = decpair[r - 100*q];
	buf += 2;
	/* 0 <= q < 100 */
	*((u16 *)buf) = decpair[q];
273 274 275 276 277 278 279
}

/*
 * Call put_dec_full4 on x % 10000, return x / 10000.
 * The approximation x/10000 == (x * 0x346DC5D7) >> 43
 * holds for all x < 1,128,869,999.  The largest value this
 * helper will ever be asked to convert is 1,125,520,955.
280
 * (second call in the put_dec code, assuming n is all-ones).
281
 */
282
static noinline_for_stack
283 284 285 286 287 288
unsigned put_dec_helper4(char *buf, unsigned x)
{
        uint32_t q = (x * (uint64_t)0x346DC5D7) >> 43;

        put_dec_full4(buf, x - q * 10000);
        return q;
289 290
}

291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308
/* Based on code by Douglas W. Jones found at
 * <http://www.cs.uiowa.edu/~jones/bcd/decimal.html#sixtyfour>
 * (with permission from the author).
 * Performs no 64-bit division and hence should be fast on 32-bit machines.
 */
static
char *put_dec(char *buf, unsigned long long n)
{
	uint32_t d3, d2, d1, q, h;

	if (n < 100*1000*1000)
		return put_dec_trunc8(buf, n);

	d1  = ((uint32_t)n >> 16); /* implicit "& 0xffff" */
	h   = (n >> 32);
	d2  = (h      ) & 0xffff;
	d3  = (h >> 16); /* implicit "& 0xffff" */

309 310
	/* n = 2^48 d3 + 2^32 d2 + 2^16 d1 + d0
	     = 281_4749_7671_0656 d3 + 42_9496_7296 d2 + 6_5536 d1 + d0 */
311
	q   = 656 * d3 + 7296 * d2 + 5536 * d1 + ((uint32_t)n & 0xffff);
312 313 314 315 316 317 318
	q = put_dec_helper4(buf, q);

	q += 7671 * d3 + 9496 * d2 + 6 * d1;
	q = put_dec_helper4(buf+4, q);

	q += 4749 * d3 + 42 * d2;
	q = put_dec_helper4(buf+8, q);
319

320 321 322 323 324
	q += 281 * d3;
	buf += 12;
	if (q)
		buf = put_dec_trunc8(buf, q);
	else while (buf[-1] == '0')
325 326 327 328 329 330 331
		--buf;

	return buf;
}

#endif

332 333 334 335 336 337 338 339
/*
 * Convert passed number to decimal string.
 * Returns the length of string.  On buffer overflow, returns 0.
 *
 * If speed is not important, use snprintf(). It's easy to read the code.
 */
int num_to_str(char *buf, int size, unsigned long long num)
{
340 341
	/* put_dec requires 2-byte alignment of the buffer. */
	char tmp[sizeof(num) * 3] __aligned(2);
342 343
	int idx, len;

344 345 346 347 348 349 350
	/* put_dec() may work incorrectly for num = 0 (generate "", not "0") */
	if (num <= 9) {
		tmp[0] = '0' + num;
		len = 1;
	} else {
		len = put_dec(tmp, num) - tmp;
	}
351 352 353 354 355

	if (len > size)
		return 0;
	for (idx = 0; idx < len; ++idx)
		buf[idx] = tmp[len - idx - 1];
356
	return len;
357 358
}

359
#define SIGN	1		/* unsigned/signed, must be 1 */
360
#define LEFT	2		/* left justified */
Linus Torvalds's avatar
Linus Torvalds committed
361 362
#define PLUS	4		/* show plus */
#define SPACE	8		/* space if plus */
363
#define ZEROPAD	16		/* pad with zero, must be 16 == '0' - ' ' */
364 365
#define SMALL	32		/* use lowercase in hex (must be 32 == 0x20) */
#define SPECIAL	64		/* prefix hex with "0x", octal with "0" */
Linus Torvalds's avatar
Linus Torvalds committed
366

367 368
enum format_type {
	FORMAT_TYPE_NONE, /* Just a string part */
369
	FORMAT_TYPE_WIDTH,
370 371 372 373 374 375 376 377 378
	FORMAT_TYPE_PRECISION,
	FORMAT_TYPE_CHAR,
	FORMAT_TYPE_STR,
	FORMAT_TYPE_PTR,
	FORMAT_TYPE_PERCENT_CHAR,
	FORMAT_TYPE_INVALID,
	FORMAT_TYPE_LONG_LONG,
	FORMAT_TYPE_ULONG,
	FORMAT_TYPE_LONG,
379 380
	FORMAT_TYPE_UBYTE,
	FORMAT_TYPE_BYTE,
381 382 383 384 385 386 387 388 389
	FORMAT_TYPE_USHORT,
	FORMAT_TYPE_SHORT,
	FORMAT_TYPE_UINT,
	FORMAT_TYPE_INT,
	FORMAT_TYPE_SIZE_T,
	FORMAT_TYPE_PTRDIFF
};

struct printf_spec {
390 391 392 393 394 395
	unsigned int	type:8;		/* format_type enum */
	signed int	field_width:24;	/* width of output field */
	unsigned int	flags:8;	/* flags to number() */
	unsigned int	base:8;		/* number base, 8, 10 or 16 only */
	signed int	precision:16;	/* # of digits/chars */
} __packed;
396 397
#define FIELD_WIDTH_MAX ((1 << 23) - 1)
#define PRECISION_MAX ((1 << 15) - 1)
398

399 400 401
static noinline_for_stack
char *number(char *buf, char *end, unsigned long long num,
	     struct printf_spec spec)
Linus Torvalds's avatar
Linus Torvalds committed
402
{
403 404
	/* put_dec requires 2-byte alignment of the buffer. */
	char tmp[3 * sizeof(num)] __aligned(2);
405 406
	char sign;
	char locase;
407
	int need_pfx = ((spec.flags & SPECIAL) && spec.base != 10);
Linus Torvalds's avatar
Linus Torvalds committed
408
	int i;
409
	bool is_zero = num == 0LL;
410 411
	int field_width = spec.field_width;
	int precision = spec.precision;
Linus Torvalds's avatar
Linus Torvalds committed
412

413 414
	BUILD_BUG_ON(sizeof(struct printf_spec) != 8);

415 416
	/* locase = 0 or 0x20. ORing digits or letters with 'locase'
	 * produces same digits or (maybe lowercased) letters */
417 418 419
	locase = (spec.flags & SMALL);
	if (spec.flags & LEFT)
		spec.flags &= ~ZEROPAD;
Linus Torvalds's avatar
Linus Torvalds committed
420
	sign = 0;
421
	if (spec.flags & SIGN) {
422
		if ((signed long long)num < 0) {
Linus Torvalds's avatar
Linus Torvalds committed
423
			sign = '-';
424
			num = -(signed long long)num;
425
			field_width--;
426
		} else if (spec.flags & PLUS) {
Linus Torvalds's avatar
Linus Torvalds committed
427
			sign = '+';
428
			field_width--;
429
		} else if (spec.flags & SPACE) {
Linus Torvalds's avatar
Linus Torvalds committed
430
			sign = ' ';
431
			field_width--;
Linus Torvalds's avatar
Linus Torvalds committed
432 433
		}
	}
434
	if (need_pfx) {
435
		if (spec.base == 16)
436
			field_width -= 2;
437
		else if (!is_zero)
438
			field_width--;
Linus Torvalds's avatar
Linus Torvalds committed
439
	}
440 441

	/* generate full string in tmp[], in reverse order */
Linus Torvalds's avatar
Linus Torvalds committed
442
	i = 0;
443
	if (num < spec.base)
444
		tmp[i++] = hex_asc_upper[num] | locase;
445 446
	else if (spec.base != 10) { /* 8 or 16 */
		int mask = spec.base - 1;
447
		int shift = 3;
448 449 450

		if (spec.base == 16)
			shift = 4;
451
		do {
452
			tmp[i++] = (hex_asc_upper[((unsigned char)num) & mask] | locase);
453 454
			num >>= shift;
		} while (num);
455 456 457
	} else { /* base 10 */
		i = put_dec(tmp, num) - tmp;
	}
458 459

	/* printing 100 using %2d gives "100", not "00" */
460 461
	if (i > precision)
		precision = i;
462
	/* leading space padding */
463
	field_width -= precision;
464
	if (!(spec.flags & (ZEROPAD | LEFT))) {
465
		while (--field_width >= 0) {
466
			if (buf < end)
Linus Torvalds's avatar
Linus Torvalds committed
467 468 469 470
				*buf = ' ';
			++buf;
		}
	}
471
	/* sign */
Linus Torvalds's avatar
Linus Torvalds committed
472
	if (sign) {
473
		if (buf < end)
Linus Torvalds's avatar
Linus Torvalds committed
474 475 476
			*buf = sign;
		++buf;
	}
477 478
	/* "0x" / "0" prefix */
	if (need_pfx) {
479 480 481 482 483
		if (spec.base == 16 || !is_zero) {
			if (buf < end)
				*buf = '0';
			++buf;
		}
484
		if (spec.base == 16) {
485
			if (buf < end)
486
				*buf = ('X' | locase);
Linus Torvalds's avatar
Linus Torvalds committed
487 488 489
			++buf;
		}
	}
490
	/* zero or space padding */
491
	if (!(spec.flags & LEFT)) {
492 493
		char c = ' ' + (spec.flags & ZEROPAD);
		BUILD_BUG_ON(' ' + ZEROPAD != '0');
494
		while (--field_width >= 0) {
495
			if (buf < end)
Linus Torvalds's avatar
Linus Torvalds committed
496 497 498 499
				*buf = c;
			++buf;
		}
	}
500
	/* hmm even more zero padding? */
501
	while (i <= --precision) {
502
		if (buf < end)
Linus Torvalds's avatar
Linus Torvalds committed
503 504 505
			*buf = '0';
		++buf;
	}
506 507
	/* actual digits of result */
	while (--i >= 0) {
508
		if (buf < end)
Linus Torvalds's avatar
Linus Torvalds committed
509 510 511
			*buf = tmp[i];
		++buf;
	}
512
	/* trailing space padding */
513
	while (--field_width >= 0) {
514
		if (buf < end)
Linus Torvalds's avatar
Linus Torvalds committed
515 516 517
			*buf = ' ';
		++buf;
	}
518

Linus Torvalds's avatar
Linus Torvalds committed
519 520 521
	return buf;
}

522 523 524 525 526 527 528 529 530 531 532 533 534 535
static noinline_for_stack
char *special_hex_number(char *buf, char *end, unsigned long long num, int size)
{
	struct printf_spec spec;

	spec.type = FORMAT_TYPE_PTR;
	spec.field_width = 2 + 2 * size;	/* 0x + hex */
	spec.flags = SPECIAL | SMALL | ZEROPAD;
	spec.base = 16;
	spec.precision = -1;

	return number(buf, end, num, spec);
}

536
static void move_right(char *buf, char *end, unsigned len, unsigned spaces)
537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553
{
	size_t size;
	if (buf >= end)	/* nowhere to put anything */
		return;
	size = end - buf;
	if (size <= spaces) {
		memset(buf, ' ', size);
		return;
	}
	if (len) {
		if (len > size - spaces)
			len = size - spaces;
		memmove(buf + spaces, buf, len);
	}
	memset(buf, ' ', spaces);
}

554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582
/*
 * Handle field width padding for a string.
 * @buf: current buffer position
 * @n: length of string
 * @end: end of output buffer
 * @spec: for field width and flags
 * Returns: new buffer position after padding.
 */
static noinline_for_stack
char *widen_string(char *buf, int n, char *end, struct printf_spec spec)
{
	unsigned spaces;

	if (likely(n >= spec.field_width))
		return buf;
	/* we want to pad the sucker */
	spaces = spec.field_width - n;
	if (!(spec.flags & LEFT)) {
		move_right(buf - n, end, n, spaces);
		return buf + spaces;
	}
	while (spaces--) {
		if (buf < end)
			*buf = ' ';
		++buf;
	}
	return buf;
}

583 584 585
static noinline_for_stack
char *string(char *buf, char *end, const char *s, struct printf_spec spec)
{
586 587
	int len = 0;
	size_t lim = spec.precision;
588 589 590 591

	if ((unsigned long)s < PAGE_SIZE)
		s = "(null)";

592 593 594 595
	while (lim--) {
		char c = *s++;
		if (!c)
			break;
596
		if (buf < end)
597
			*buf = c;
598
		++buf;
599
		++len;
600
	}
601
	return widen_string(buf, len, end, spec);
602 603
}

604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622
static noinline_for_stack
char *dentry_name(char *buf, char *end, const struct dentry *d, struct printf_spec spec,
		  const char *fmt)
{
	const char *array[4], *s;
	const struct dentry *p;
	int depth;
	int i, n;

	switch (fmt[1]) {
		case '2': case '3': case '4':
			depth = fmt[1] - '0';
			break;
		default:
			depth = 1;
	}

	rcu_read_lock();
	for (i = 0; i < depth; i++, d = p) {
623 624
		p = READ_ONCE(d->d_parent);
		array[i] = READ_ONCE(d->d_name.name);
625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644
		if (p == d) {
			if (i)
				array[i] = "";
			i++;
			break;
		}
	}
	s = array[--i];
	for (n = 0; n != spec.precision; n++, buf++) {
		char c = *s++;
		if (!c) {
			if (!i)
				break;
			c = '/';
			s = array[--i];
		}
		if (buf < end)
			*buf = c;
	}
	rcu_read_unlock();
645
	return widen_string(buf, n, end, spec);
646 647
}

648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667
#ifdef CONFIG_BLOCK
static noinline_for_stack
char *bdev_name(char *buf, char *end, struct block_device *bdev,
		struct printf_spec spec, const char *fmt)
{
	struct gendisk *hd = bdev->bd_disk;
	
	buf = string(buf, end, hd->disk_name, spec);
	if (bdev->bd_part->partno) {
		if (isdigit(hd->disk_name[strlen(hd->disk_name)-1])) {
			if (buf < end)
				*buf = 'p';
			buf++;
		}
		buf = number(buf, end, bdev->bd_part->partno, spec);
	}
	return buf;
}
#endif

668 669
static noinline_for_stack
char *symbol_string(char *buf, char *end, void *ptr,
670
		    struct printf_spec spec, const char *fmt)
671
{
672
	unsigned long value;
673 674
#ifdef CONFIG_KALLSYMS
	char sym[KSYM_SYMBOL_LEN];
675 676 677 678 679 680 681 682
#endif

	if (fmt[1] == 'R')
		ptr = __builtin_extract_return_addr(ptr);
	value = (unsigned long)ptr;

#ifdef CONFIG_KALLSYMS
	if (*fmt == 'B')
683
		sprint_backtrace(sym, value);
684
	else if (*fmt != 'f' && *fmt != 's')
685 686
		sprint_symbol(sym, value);
	else
687
		sprint_symbol_no_offset(sym, value);
688

689
	return string(buf, end, sym, spec);
690
#else
691
	return special_hex_number(buf, end, value, sizeof(void *));
692 693 694
#endif
}

695 696 697
static noinline_for_stack
char *resource_string(char *buf, char *end, struct resource *res,
		      struct printf_spec spec, const char *fmt)
698 699
{
#ifndef IO_RSRC_PRINTK_SIZE
700
#define IO_RSRC_PRINTK_SIZE	6
701 702 703
#endif

#ifndef MEM_RSRC_PRINTK_SIZE
704
#define MEM_RSRC_PRINTK_SIZE	10
705
#endif
706
	static const struct printf_spec io_spec = {
707
		.base = 16,
708
		.field_width = IO_RSRC_PRINTK_SIZE,
709 710 711
		.precision = -1,
		.flags = SPECIAL | SMALL | ZEROPAD,
	};
712 713 714 715 716 717
	static const struct printf_spec mem_spec = {
		.base = 16,
		.field_width = MEM_RSRC_PRINTK_SIZE,
		.precision = -1,
		.flags = SPECIAL | SMALL | ZEROPAD,
	};
718 719 720 721 722 723
	static const struct printf_spec bus_spec = {
		.base = 16,
		.field_width = 2,
		.precision = -1,
		.flags = SMALL | ZEROPAD,
	};
724
	static const struct printf_spec dec_spec = {
725 726 727 728
		.base = 10,
		.precision = -1,
		.flags = 0,
	};
729
	static const struct printf_spec str_spec = {
730 731 732 733
		.field_width = -1,
		.precision = 10,
		.flags = LEFT,
	};
734
	static const struct printf_spec flag_spec = {
735 736 737 738
		.base = 16,
		.precision = -1,
		.flags = SPECIAL | SMALL,
	};
739 740 741 742 743

	/* 32-bit res (sizeof==4): 10 chars in dec, 10 in hex ("0x" + 8)
	 * 64-bit res (sizeof==8): 20 chars in dec, 18 in hex ("0x" + 16) */
#define RSRC_BUF_SIZE		((2 * sizeof(resource_size_t)) + 4)
#define FLAG_BUF_SIZE		(2 * sizeof(res->flags))
Bjorn Helgaas's avatar
Bjorn Helgaas committed
744
#define DECODED_BUF_SIZE	sizeof("[mem - 64bit pref window disabled]")
745 746 747 748
#define RAW_BUF_SIZE		sizeof("[mem - flags 0x]")
	char sym[max(2*RSRC_BUF_SIZE + DECODED_BUF_SIZE,
		     2*RSRC_BUF_SIZE + FLAG_BUF_SIZE + RAW_BUF_SIZE)];

749
	char *p = sym, *pend = sym + sizeof(sym);
750
	int decode = (fmt[0] == 'R') ? 1 : 0;
751
	const struct printf_spec *specp;
752 753

	*p++ = '[';
754
	if (res->flags & IORESOURCE_IO) {
755
		p = string(p, pend, "io  ", str_spec);
756 757
		specp = &io_spec;
	} else if (res->flags & IORESOURCE_MEM) {
758
		p = string(p, pend, "mem ", str_spec);
759 760
		specp = &mem_spec;
	} else if (res->flags & IORESOURCE_IRQ) {
761
		p = string(p, pend, "irq ", str_spec);
762 763
		specp = &dec_spec;
	} else if (res->flags & IORESOURCE_DMA) {
764
		p = string(p, pend, "dma ", str_spec);
765
		specp = &dec_spec;
766 767 768
	} else if (res->flags & IORESOURCE_BUS) {
		p = string(p, pend, "bus ", str_spec);
		specp = &bus_spec;
769
	} else {
770
		p = string(p, pend, "??? ", str_spec);
771
		specp = &mem_spec;
772
		decode = 0;
773
	}
774 775 776 777 778 779 780 781 782
	if (decode && res->flags & IORESOURCE_UNSET) {
		p = string(p, pend, "size ", str_spec);
		p = number(p, pend, resource_size(res), *specp);
	} else {
		p = number(p, pend, res->start, *specp);
		if (res->start != res->end) {
			*p++ = '-';
			p = number(p, pend, res->end, *specp);
		}
783
	}
784
	if (decode) {
785 786 787 788
		if (res->flags & IORESOURCE_MEM_64)
			p = string(p, pend, " 64bit", str_spec);
		if (res->flags & IORESOURCE_PREFETCH)
			p = string(p, pend, " pref", str_spec);
Bjorn Helgaas's avatar
Bjorn Helgaas committed
789 790
		if (res->flags & IORESOURCE_WINDOW)
			p = string(p, pend, " window", str_spec);
791 792
		if (res->flags & IORESOURCE_DISABLED)
			p = string(p, pend, " disabled", str_spec);
793 794 795
	} else {
		p = string(p, pend, " flags ", str_spec);
		p = number(p, pend, res->flags, flag_spec);
796
	}
797
	*p++ = ']';
798
	*p = '\0';
799

800
	return string(buf, end, sym, spec);
801 802
}

803 804 805 806
static noinline_for_stack
char *hex_string(char *buf, char *end, u8 *addr, struct printf_spec spec,
		 const char *fmt)
{
807
	int i, len = 1;		/* if we pass '%ph[CDN]', field width remains
808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836
				   negative value, fallback to the default */
	char separator;

	if (spec.field_width == 0)
		/* nothing to print */
		return buf;

	if (ZERO_OR_NULL_PTR(addr))
		/* NULL pointer */
		return string(buf, end, NULL, spec);

	switch (fmt[1]) {
	case 'C':
		separator = ':';
		break;
	case 'D':
		separator = '-';
		break;
	case 'N':
		separator = 0;
		break;
	default:
		separator = ' ';
		break;
	}

	if (spec.field_width > 0)
		len = min_t(int, spec.field_width, 64);

837 838 839 840 841 842 843
	for (i = 0; i < len; ++i) {
		if (buf < end)
			*buf = hex_asc_hi(addr[i]);
		++buf;
		if (buf < end)
			*buf = hex_asc_lo(addr[i]);
		++buf;
844

845 846 847 848 849
		if (separator && i != len - 1) {
			if (buf < end)
				*buf = separator;
			++buf;
		}
850 851 852 853 854
	}

	return buf;
}

855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935
static noinline_for_stack
char *bitmap_string(char *buf, char *end, unsigned long *bitmap,
		    struct printf_spec spec, const char *fmt)
{
	const int CHUNKSZ = 32;
	int nr_bits = max_t(int, spec.field_width, 0);
	int i, chunksz;
	bool first = true;

	/* reused to print numbers */
	spec = (struct printf_spec){ .flags = SMALL | ZEROPAD, .base = 16 };

	chunksz = nr_bits & (CHUNKSZ - 1);
	if (chunksz == 0)
		chunksz = CHUNKSZ;

	i = ALIGN(nr_bits, CHUNKSZ) - CHUNKSZ;
	for (; i >= 0; i -= CHUNKSZ) {
		u32 chunkmask, val;
		int word, bit;

		chunkmask = ((1ULL << chunksz) - 1);
		word = i / BITS_PER_LONG;
		bit = i % BITS_PER_LONG;
		val = (bitmap[word] >> bit) & chunkmask;

		if (!first) {
			if (buf < end)
				*buf = ',';
			buf++;
		}
		first = false;

		spec.field_width = DIV_ROUND_UP(chunksz, 4);
		buf = number(buf, end, val, spec);

		chunksz = CHUNKSZ;
	}
	return buf;
}

static noinline_for_stack
char *bitmap_list_string(char *buf, char *end, unsigned long *bitmap,
			 struct printf_spec spec, const char *fmt)
{
	int nr_bits = max_t(int, spec.field_width, 0);
	/* current bit is 'cur', most recently seen range is [rbot, rtop] */
	int cur, rbot, rtop;
	bool first = true;

	/* reused to print numbers */
	spec = (struct printf_spec){ .base = 10 };

	rbot = cur = find_first_bit(bitmap, nr_bits);
	while (cur < nr_bits) {
		rtop = cur;
		cur = find_next_bit(bitmap, nr_bits, cur + 1);
		if (cur < nr_bits && cur <= rtop + 1)
			continue;

		if (!first) {
			if (buf < end)
				*buf = ',';
			buf++;
		}
		first = false;

		buf = number(buf, end, rbot, spec);
		if (rbot < rtop) {
			if (buf < end)
				*buf = '-';
			buf++;

			buf = number(buf, end, rtop, spec);
		}

		rbot = cur;
	}
	return buf;
}

936 937 938
static noinline_for_stack
char *mac_address_string(char *buf, char *end, u8 *addr,
			 struct printf_spec spec, const char *fmt)
939
{
940
	char mac_addr[sizeof("xx:xx:xx:xx:xx:xx")];
941 942
	char *p = mac_addr;
	int i;
943
	char separator;
944
	bool reversed = false;
945

946 947
	switch (fmt[1]) {
	case 'F':
948
		separator = '-';
949 950 951 952 953 954 955
		break;

	case 'R':
		reversed = true;
		/* fall through */

	default:
956
		separator = ':';
957
		break;
958
	}
959 960

	for (i = 0; i < 6; i++) {
961 962 963 964 965
		if (reversed)
			p = hex_byte_pack(p, addr[5 - i]);
		else
			p = hex_byte_pack(p, addr[i]);

966
		if (fmt[0] == 'M' && i != 5)
967
			*p++ = separator;
968 969 970
	}
	*p = '\0';

971
	return string(buf, end, mac_addr, spec);
972 973
}

974 975
static noinline_for_stack
char *ip4_string(char *p, const u8 *addr, const char *fmt)
976 977
{
	int i;
978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002
	bool leading_zeros = (fmt[0] == 'i');
	int index;
	int step;

	switch (fmt[2]) {
	case 'h':
#ifdef __BIG_ENDIAN
		index = 0;
		step = 1;
#else
		index = 3;
		step = -1;
#endif
		break;
	case 'l':
		index = 3;
		step = -1;
		break;
	case 'n':
	case 'b':
	default:
		index = 0;
		step = 1;
		break;
	}
1003
	for (i = 0; i < 4; i++) {
1004
		char temp[4] __aligned(2);	/* hold each IP quad in reverse order */
1005
		int digits = put_dec_trunc8(temp, addr[index]) - temp;
1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016
		if (leading_zeros) {
			if (digits < 3)
				*p++ = '0';
			if (digits < 2)
				*p++ = '0';
		}
		/* reverse the digits in the quad */
		while (digits--)
			*p++ = temp[digits];
		if (i < 3)
			*p++ = '.';
1017
		index += step;
1018 1019
	}
	*p = '\0';
1020

1021 1022 1023
	return p;
}

1024 1025
static noinline_for_stack
char *ip6_compressed_string(char *p, const char *addr)
1026
{
1027
	int i, j, range;
1028 1029 1030 1031
	unsigned char zerolength[8];
	int longest = 1;
	int colonpos = -1;
	u16 word;
1032
	u8 hi, lo;
1033
	bool needcolon = false;
1034 1035 1036 1037 1038 1039
	bool useIPv4;
	struct in6_addr in6;

	memcpy(&in6, addr, sizeof(struct in6_addr));

	useIPv4 = ipv6_addr_v4mapped(&in6) || ipv6_addr_is_isatap(&in6);
1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050

	memset(zerolength, 0, sizeof(zerolength));

	if (useIPv4)
		range = 6;
	else
		range = 8;

	/* find position of longest 0 run */
	for (i = 0; i < range; i++) {
		for (j = i; j < range; j++) {
1051
			if (in6.s6_addr16[j] != 0)
1052 1053 1054 1055 1056 1057 1058 1059 1060 1061
				break;
			zerolength[i]++;
		}
	}
	for (i = 0; i < range; i++) {
		if (zerolength[i] > longest) {
			longest = zerolength[i];
			colonpos = i;
		}
	}
1062 1063
	if (longest == 1)		/* don't compress a single 0 */
		colonpos = -1;
1064

1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079
	/* emit address */
	for (i = 0; i < range; i++) {
		if (i == colonpos) {
			if (needcolon || i == 0)
				*p++ = ':';
			*p++ = ':';
			needcolon = false;
			i += longest - 1;
			continue;
		}
		if (needcolon) {
			*p++ = ':';
			needcolon = false;
		}
		/* hex u16 without leading 0s */
1080
		word = ntohs(in6.s6_addr16[i]);
1081 1082 1083 1084
		hi = word >> 8;
		lo = word & 0xff;
		if (hi) {
			if (hi > 0x0f)
1085
				p = hex_byte_pack(p, hi);
1086 1087
			else
				*p++ = hex_asc_lo(hi);
1088
			p = hex_byte_pack(p, lo);
1089
		}
1090
		else if (lo > 0x0f)
1091
			p = hex_byte_pack(p, lo);
1092 1093