| 1 | /*	$NetBSD: dev_verbose.c,v 1.3 2016/10/26 06:10:39 pgoyette Exp $	*/ | 
| 2 |  | 
| 3 | /* | 
| 4 |  * Redistribution and use in source and binary forms, with or without | 
| 5 |  * modification, are permitted provided that the following conditions | 
| 6 |  * are met: | 
| 7 |  * 1. Redistributions of source code must retain the above copyright | 
| 8 |  *    notice, this list of conditions and the following disclaimer. | 
| 9 |  * 2. Redistributions in binary form must reproduce the above copyright | 
| 10 |  *    notice, this list of conditions and the following disclaimer in the | 
| 11 |  *    documentation and/or other materials provided with the distribution. | 
| 12 |  * | 
| 13 |  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | 
| 14 |  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES | 
| 15 |  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. | 
| 16 |  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, | 
| 17 |  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | 
| 18 |  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 
| 19 |  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 
| 20 |  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 
| 21 |  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF | 
| 22 |  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 
| 23 |  */ | 
| 24 |  | 
| 25 | #include <sys/cdefs.h> | 
| 26 | __KERNEL_RCSID(0, "$NetBSD: dev_verbose.c,v 1.3 2016/10/26 06:10:39 pgoyette Exp $" ); | 
| 27 |  | 
| 28 | #include <sys/param.h> | 
| 29 |  | 
| 30 | #ifdef _KERNEL | 
| 31 | #include <sys/systm.h> | 
| 32 | #else | 
| 33 | #include <stdio.h> | 
| 34 | #include <string.h> | 
| 35 | #endif | 
| 36 |  | 
| 37 | #include <dev/dev_verbose.h> | 
| 38 |  | 
| 39 | static const char * | 
| 40 | dev_untokenstring(const char *words, const uint16_t *token, char *buf, | 
| 41 |     size_t len) | 
| 42 | { | 
| 43 | 	char *cp = buf; | 
| 44 | 	size_t newlen; | 
| 45 |  | 
| 46 | 	buf[0] = '\0'; | 
| 47 | 	for (; *token != 0; token++) { | 
| 48 | 		newlen = strlcat(buf, words + *token, len - 2); | 
| 49 | 		if (newlen > len - 2) | 
| 50 | 			newlen = len - 2; | 
| 51 | 		cp = buf + newlen; | 
| 52 | 		cp[0] = ' '; | 
| 53 | 		cp[1] = '\0'; | 
| 54 | 	} | 
| 55 | 	*cp = '\0'; | 
| 56 | 	return cp != buf ? buf : NULL; | 
| 57 | } | 
| 58 |  | 
| 59 | const char * | 
| 60 | dev_findvendor(char *buf, size_t len, const char *words, size_t nwords, | 
| 61 |     const uint16_t *vendors, size_t nvendors, uint16_t vendor) | 
| 62 | { | 
| 63 | 	size_t n; | 
| 64 |  | 
| 65 | 	for (n = 0; n < nvendors; n++) { | 
| 66 | 		if (vendors[n] == vendor) | 
| 67 | 			return dev_untokenstring(words, &vendors[n + 1], | 
| 68 | 			    buf, len); | 
| 69 |  | 
| 70 | 		/* Skip Tokens */ | 
| 71 | 		n++; | 
| 72 | 		while (n < nvendors && vendors[n] != 0) | 
| 73 | 			n++; | 
| 74 | 	} | 
| 75 | 	snprintf(buf, len, "vendor %4.4x" , vendor); | 
| 76 | 	return NULL; | 
| 77 | } | 
| 78 |  | 
| 79 | const char * | 
| 80 | dev_findproduct(char *buf, size_t len, const char *words, size_t nwords, | 
| 81 |     const uint16_t *products, size_t nproducts, uint16_t vendor, | 
| 82 |     uint16_t product) | 
| 83 | { | 
| 84 | 	size_t n; | 
| 85 |  | 
| 86 | 	for (n = 0; n < nproducts; n++) { | 
| 87 | 		if (products[n] == vendor && products[n + 1] == product) | 
| 88 | 			return dev_untokenstring(words, &products[n + 2], | 
| 89 | 			    buf, len); | 
| 90 |  | 
| 91 | 		/* Skip Tokens */ | 
| 92 | 		n += 2; | 
| 93 | 		while (n < nproducts && products[n] != 0) | 
| 94 | 			n++; | 
| 95 | 	} | 
| 96 | 	snprintf(buf, len, "product %4.4x" , product); | 
| 97 | 	return NULL; | 
| 98 | } | 
| 99 |  |