3 /*-
4  * SPDX-License-Identifier: BSD-2-Clause
19  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
60 	int i, j;  in dump_hid_table()  local
64 		for (j = 0; j < pages[i].pagesize; j++) {  in dump_hid_table()
65 			printf("\t%d\t%s\n", pages[i].page_contents[j].usage,  in dump_hid_table()
66 			       pages[i].page_contents[j].name);  in dump_hid_table()
97 			no = -1;  in hid_init()
112 			if (curpage->pagesize >= curpage->pagesizemax) {  in hid_init()
113 				curpage->pagesizemax += 10;  in hid_init()
114 				curpage->page_contents =  in hid_init()
115 					realloc(curpage->page_contents,  in hid_init()
116 						curpage->pagesizemax *  in hid_init()
118 				if (!curpage->page_contents)  in hid_init()
121 			curpage->page_contents[curpage->pagesize].name = n;  in hid_init()
122 			curpage->page_contents[curpage->pagesize].usage = no;  in hid_init()
123 			curpage->pagesize++;  in hid_init()
140 			curpage->name = n;  in hid_init()
141 			curpage->usage = no;  in hid_init()
142 			curpage->pagesize = 0;  in hid_init()
143 			curpage->pagesizemax = 10;  in hid_init()
144 			curpage->page_contents =  in hid_init()
145 				malloc(curpage->pagesizemax *  in hid_init()
147 			if (!curpage->page_contents)  in hid_init()
161 	int k;  in hid_usage_page()  local
166 	for (k = 0; k < npages; k++)  in hid_usage_page()
167 		if (pages[k].usage == i)  in hid_usage_page()
168 			return pages[k].name;  in hid_usage_page()
179 	int j, k, us;  in hid_usage_in_page()  local
181 	for (k = 0; k < npages; k++)  in hid_usage_in_page()
182 		if (pages[k].usage == page)  in hid_usage_in_page()
184 	if (k >= npages)  in hid_usage_in_page()
186 	for (j = 0; j < pages[k].pagesize; j++) {  in hid_usage_in_page()
187 		us = pages[k].page_contents[j].usage;  in hid_usage_in_page()
188 		if (us == -1) {  in hid_usage_in_page()
190 			    fmtcheck(pages[k].page_contents[j].name, "%d"),  in hid_usage_in_page()
195 			return pages[k].page_contents[j].name;  in hid_usage_in_page()
205 	int k;  in hid_parse_usage_page()  local
210 	for (k = 0; k < npages; k++)  in hid_parse_usage_page()
211 		if (strcmp(pages[k].name, name) == 0)  in hid_parse_usage_page()
212 			return pages[k].usage;  in hid_parse_usage_page()
213 	return -1;  in hid_parse_usage_page()
221 	int k, j;  in hid_parse_usage_in_page()  local
226 		return -1;  in hid_parse_usage_in_page()
227 	l = sep - name;  in hid_parse_usage_in_page()
228 	for (k = 0; k < npages; k++)  in hid_parse_usage_in_page()
229 		if (strncmp(pages[k].name, name, l) == 0)  in hid_parse_usage_in_page()
231 	return -1;  in hid_parse_usage_in_page()
234 	for (j = 0; j < pages[k].pagesize; j++)  in hid_parse_usage_in_page()
235 		if (strcmp(pages[k].page_contents[j].name, sep) == 0)  in hid_parse_usage_in_page()
236 			return (pages[k].usage << 16) | pages[k].page_contents[j].usage;  in hid_parse_usage_in_page()
237 	return (-1);  in hid_parse_usage_in_page()