xref: /freebsd/stand/efi/libefi/handles.c (revision 3e15b01d)
1ca987d46SWarner Losh /*-
2ca987d46SWarner Losh  * Copyright (c) 2006 Marcel Moolenaar
3ca987d46SWarner Losh  * All rights reserved.
4ca987d46SWarner Losh  *
5ca987d46SWarner Losh  * Redistribution and use in source and binary forms, with or without
6ca987d46SWarner Losh  * modification, are permitted provided that the following conditions
7ca987d46SWarner Losh  * are met:
8ca987d46SWarner Losh  *
9ca987d46SWarner Losh  * 1. Redistributions of source code must retain the above copyright
10ca987d46SWarner Losh  *    notice, this list of conditions and the following disclaimer.
11ca987d46SWarner Losh  * 2. Redistributions in binary form must reproduce the above copyright
12ca987d46SWarner Losh  *    notice, this list of conditions and the following disclaimer in the
13ca987d46SWarner Losh  *    documentation and/or other materials provided with the distribution.
14ca987d46SWarner Losh  *
15ca987d46SWarner Losh  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16ca987d46SWarner Losh  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17ca987d46SWarner Losh  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18ca987d46SWarner Losh  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19ca987d46SWarner Losh  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20ca987d46SWarner Losh  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21ca987d46SWarner Losh  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22ca987d46SWarner Losh  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23ca987d46SWarner Losh  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24ca987d46SWarner Losh  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25ca987d46SWarner Losh  */
26ca987d46SWarner Losh 
27ca987d46SWarner Losh #include <efi.h>
28ca987d46SWarner Losh #include <efilib.h>
29ca987d46SWarner Losh 
30ca987d46SWarner Losh struct entry {
31ca987d46SWarner Losh 	EFI_HANDLE handle;
32ca987d46SWarner Losh 	EFI_HANDLE alias;
33ca987d46SWarner Losh 	struct devsw *dev;
34ca987d46SWarner Losh 	int unit;
35ca987d46SWarner Losh 	uint64_t extra;
36ca987d46SWarner Losh };
37ca987d46SWarner Losh 
38ca987d46SWarner Losh struct entry *entry;
39ca987d46SWarner Losh int nentries;
40ca987d46SWarner Losh 
41ca987d46SWarner Losh int
efi_register_handles(struct devsw * sw,EFI_HANDLE * handles,EFI_HANDLE * aliases,int count)42ca987d46SWarner Losh efi_register_handles(struct devsw *sw, EFI_HANDLE *handles,
43ca987d46SWarner Losh     EFI_HANDLE *aliases, int count)
44ca987d46SWarner Losh {
45ca987d46SWarner Losh 	size_t sz;
46ca987d46SWarner Losh 	int idx, unit;
47ca987d46SWarner Losh 
48ca987d46SWarner Losh 	idx = nentries;
49ca987d46SWarner Losh 	nentries += count;
50ca987d46SWarner Losh 	sz = nentries * sizeof(struct entry);
51ca987d46SWarner Losh 	entry = (entry == NULL) ? malloc(sz) : realloc(entry, sz);
524a82db5fSToomas Soome 	if (entry == NULL)
534a82db5fSToomas Soome 		return (ENOMEM);
54ca987d46SWarner Losh 	for (unit = 0; idx < nentries; idx++, unit++) {
55ca987d46SWarner Losh 		entry[idx].handle = handles[unit];
56ca987d46SWarner Losh 		if (aliases != NULL)
57ca987d46SWarner Losh 			entry[idx].alias = aliases[unit];
58ca987d46SWarner Losh 		else
59ca987d46SWarner Losh 			entry[idx].alias = NULL;
60ca987d46SWarner Losh 		entry[idx].dev = sw;
61ca987d46SWarner Losh 		entry[idx].unit = unit;
62ca987d46SWarner Losh 	}
63ca987d46SWarner Losh 	return (0);
64ca987d46SWarner Losh }
65ca987d46SWarner Losh 
66ca987d46SWarner Losh EFI_HANDLE
efi_find_handle(struct devsw * dev,int unit)67ca987d46SWarner Losh efi_find_handle(struct devsw *dev, int unit)
68ca987d46SWarner Losh {
69ca987d46SWarner Losh 	int idx;
70ca987d46SWarner Losh 
71ca987d46SWarner Losh 	for (idx = 0; idx < nentries; idx++) {
72ca987d46SWarner Losh 		if (entry[idx].dev != dev)
73ca987d46SWarner Losh 			continue;
74ca987d46SWarner Losh 		if (entry[idx].unit != unit)
75ca987d46SWarner Losh 			continue;
76ca987d46SWarner Losh 		return (entry[idx].handle);
77ca987d46SWarner Losh 	}
78ca987d46SWarner Losh 	return (NULL);
79ca987d46SWarner Losh }
80ca987d46SWarner Losh 
81ca987d46SWarner Losh int
efi_handle_lookup(EFI_HANDLE h,struct devsw ** dev,int * unit,uint64_t * extra)82ca987d46SWarner Losh efi_handle_lookup(EFI_HANDLE h, struct devsw **dev, int *unit, uint64_t *extra)
83ca987d46SWarner Losh {
84ca987d46SWarner Losh 	int idx;
85ca987d46SWarner Losh 
86ca987d46SWarner Losh 	for (idx = 0; idx < nentries; idx++) {
87ca987d46SWarner Losh 		if (entry[idx].handle != h && entry[idx].alias != h)
88ca987d46SWarner Losh 			continue;
89ca987d46SWarner Losh 		if (dev != NULL)
90ca987d46SWarner Losh 			*dev = entry[idx].dev;
91ca987d46SWarner Losh 		if (unit != NULL)
92ca987d46SWarner Losh 			*unit = entry[idx].unit;
93ca987d46SWarner Losh 		if (extra != NULL)
94ca987d46SWarner Losh 			*extra = entry[idx].extra;
95ca987d46SWarner Losh 		return (0);
96ca987d46SWarner Losh 	}
97ca987d46SWarner Losh 	return (ENOENT);
98ca987d46SWarner Losh }
99ca987d46SWarner Losh 
100ca987d46SWarner Losh int
efi_handle_update_dev(EFI_HANDLE h,struct devsw * dev,int unit,uint64_t guid)101ca987d46SWarner Losh efi_handle_update_dev(EFI_HANDLE h, struct devsw *dev, int unit,
102ca987d46SWarner Losh     uint64_t guid)
103ca987d46SWarner Losh {
104ca987d46SWarner Losh 	int idx;
105ca987d46SWarner Losh 
106ca987d46SWarner Losh 	for (idx = 0; idx < nentries; idx++) {
107ca987d46SWarner Losh 		if (entry[idx].handle != h)
108ca987d46SWarner Losh 			continue;
109ca987d46SWarner Losh 		entry[idx].dev = dev;
110ca987d46SWarner Losh 		entry[idx].unit = unit;
111ca987d46SWarner Losh 		entry[idx].alias = NULL;
112ca987d46SWarner Losh 		entry[idx].extra = guid;
113ca987d46SWarner Losh 		return (0);
114ca987d46SWarner Losh 	}
115ca987d46SWarner Losh 
116ca987d46SWarner Losh 	return (ENOENT);
117ca987d46SWarner Losh }
118