blob: 40ca85c77ea17f18f3159765182a34071bb70aa6 [file] [log] [blame]
Michael Karcher6701ee82010-01-20 14:14:11 +00001/*
2 * This file is part of the flashrom project.
3 *
4 * Copyright (C) 2009,2010 Michael Karcher
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21#include <string.h>
22#include <stdio.h>
23#include <stdlib.h>
24
25#include "flash.h"
26
Carl-Daniel Hailfingere1fdff42010-06-23 23:14:44 +000027int has_dmi_support = 0;
28
29#if STANDALONE
30
31/* Stub to indicate missing DMI functionality.
32 * has_dmi_support is 0 by default, so nothing to do here.
33 * Because dmidecode is not available on all systems, the goal is to implement
34 * the DMI subset we need directly in this file.
35 */
36void dmi_init(void)
37{
38}
39
40int dmi_match(const char *pattern)
41{
42 return 0;
43}
44
45#else /* STANDALONE */
46
Michael Karcherfd416702010-03-14 17:57:52 +000047const char *dmidecode_names[] = {
Michael Karcherf6498d72010-02-24 22:43:44 +000048 "system-manufacturer",
49 "system-product-name",
50 "system-version",
51 "baseboard-manufacturer",
52 "baseboard-product-name",
Uwe Hermann43959702010-03-13 17:28:29 +000053 "baseboard-version",
Michael Karcher6701ee82010-01-20 14:14:11 +000054};
55
56#define DMI_COMMAND_LEN_MAX 260
57const char *dmidecode_command = "dmidecode";
58
Michael Karcherfd416702010-03-14 17:57:52 +000059char *dmistrings[ARRAY_SIZE(dmidecode_names)];
Michael Karcher6701ee82010-01-20 14:14:11 +000060
Uwe Hermann43959702010-03-13 17:28:29 +000061/* Strings longer than 4096 in DMI are just insane. */
Michael Karcher6701ee82010-01-20 14:14:11 +000062#define DMI_MAX_ANSWER_LEN 4096
63
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000064static char *get_dmi_string(const char *string_name)
Michael Karcher6701ee82010-01-20 14:14:11 +000065{
66 FILE *dmidecode_pipe;
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000067 char *result;
68 char answerbuf[DMI_MAX_ANSWER_LEN];
Uwe Hermann43959702010-03-13 17:28:29 +000069 char commandline[DMI_COMMAND_LEN_MAX + 40];
70
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000071 snprintf(commandline, sizeof(commandline),
72 "%s -s %s", dmidecode_command, string_name);
73 dmidecode_pipe = popen(commandline, "r");
74 if (!dmidecode_pipe) {
Sean Nelson316a29f2010-05-07 20:09:04 +000075 msg_perr("DMI pipe open error\n");
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000076 return NULL;
Michael Karcher6701ee82010-01-20 14:14:11 +000077 }
Michael Karcher45f79cb2010-03-24 17:55:04 +000078 if (!fgets(answerbuf, DMI_MAX_ANSWER_LEN, dmidecode_pipe)) {
79 if(ferror(dmidecode_pipe)) {
Sean Nelson316a29f2010-05-07 20:09:04 +000080 msg_perr("DMI pipe read error\n");
Michael Karcher45f79cb2010-03-24 17:55:04 +000081 pclose(dmidecode_pipe);
82 return NULL;
83 } else {
84 answerbuf[0] = 0; /* Hit EOF */
85 }
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000086 }
87 /* Toss all output above DMI_MAX_ANSWER_LEN away to prevent
88 deadlock on pclose. */
89 while (!feof(dmidecode_pipe))
90 getc(dmidecode_pipe);
91 if (pclose(dmidecode_pipe) != 0) {
Sean Nelson316a29f2010-05-07 20:09:04 +000092 msg_pinfo("dmidecode execution unsucessfull - continuing "
93 "without DMI info\n");
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000094 return NULL;
95 }
Michael Karcher6701ee82010-01-20 14:14:11 +000096
Uwe Hermann43959702010-03-13 17:28:29 +000097 /* Chomp trailing newline. */
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000098 if (answerbuf[0] != 0 &&
99 answerbuf[strlen(answerbuf) - 1] == '\n')
100 answerbuf[strlen(answerbuf) - 1] = 0;
Sean Nelson316a29f2010-05-07 20:09:04 +0000101 msg_pdbg("DMI string %s: \"%s\"\n", string_name, answerbuf);
Michael Karcher0d7fb7c2010-02-26 09:51:16 +0000102
103 result = strdup(answerbuf);
104 if (!result)
105 puts("WARNING: Out of memory - DMI support fails");
106
107 return result;
108}
109
110void dmi_init(void)
111{
112 int i;
Michael Karcher8c1df282010-02-26 09:51:20 +0000113 char *chassis_type;
Uwe Hermann43959702010-03-13 17:28:29 +0000114
Michael Karcher6701ee82010-01-20 14:14:11 +0000115 has_dmi_support = 1;
Michael Karcherfd416702010-03-14 17:57:52 +0000116 for (i = 0; i < ARRAY_SIZE(dmidecode_names); i++) {
Michael Karcher0d7fb7c2010-02-26 09:51:16 +0000117 dmistrings[i] = get_dmi_string(dmidecode_names[i]);
118 if (!dmistrings[i]) {
119 has_dmi_support = 0;
Michael Karcherfd416702010-03-14 17:57:52 +0000120 return;
Michael Karcher0d7fb7c2010-02-26 09:51:16 +0000121 }
122 }
Michael Karcher8c1df282010-02-26 09:51:20 +0000123
124 chassis_type = get_dmi_string("chassis-type");
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000125 if (chassis_type && (!strcmp(chassis_type, "Notebook") ||
126 !strcmp(chassis_type, "Portable"))) {
Sean Nelson316a29f2010-05-07 20:09:04 +0000127 msg_pdbg("Laptop detected via DMI\n");
Michael Karcher8c1df282010-02-26 09:51:20 +0000128 is_laptop = 1;
129 }
130 free(chassis_type);
Michael Karcher6701ee82010-01-20 14:14:11 +0000131}
132
133/**
134 * Does an substring/prefix/postfix/whole-string match.
135 *
136 * The pattern is matched as-is. The only metacharacters supported are '^'
137 * at the beginning and '$' at the end. So you can look for "^prefix",
138 * "suffix$", "substring" or "^complete string$".
139 *
140 * @param value The string to check.
141 * @param pattern The pattern.
142 * @return Nonzero if pattern matches.
143 */
144static int dmi_compare(const char *value, const char *pattern)
145{
146 int anchored = 0;
147 int patternlen;
Uwe Hermann43959702010-03-13 17:28:29 +0000148
Sean Nelson316a29f2010-05-07 20:09:04 +0000149 msg_pspew("matching %s against %s\n", value, pattern);
Uwe Hermann43959702010-03-13 17:28:29 +0000150 /* The empty string is part of all strings! */
Michael Karcher6701ee82010-01-20 14:14:11 +0000151 if (pattern[0] == 0)
152 return 1;
153
154 if (pattern[0] == '^') {
155 anchored = 1;
156 pattern++;
157 }
158
159 patternlen = strlen(pattern);
160 if (pattern[patternlen - 1] == '$') {
161 int valuelen = strlen(value);
162 patternlen--;
Uwe Hermann43959702010-03-13 17:28:29 +0000163 if (patternlen > valuelen)
Michael Karcher6701ee82010-01-20 14:14:11 +0000164 return 0;
165
166 /* full string match: require same length */
Uwe Hermann43959702010-03-13 17:28:29 +0000167 if (anchored && (valuelen != patternlen))
Michael Karcher6701ee82010-01-20 14:14:11 +0000168 return 0;
169
170 /* start character to make ends match */
171 value += valuelen - patternlen;
172 anchored = 1;
173 }
174
175 if (anchored)
176 return strncmp(value, pattern, patternlen) == 0;
177 else
178 return strstr(value, pattern) != NULL;
179}
180
181int dmi_match(const char *pattern)
182{
183 int i;
Uwe Hermann43959702010-03-13 17:28:29 +0000184
Michael Karcher6701ee82010-01-20 14:14:11 +0000185 if (!has_dmi_support)
186 return 0;
187
Michael Karcherfd416702010-03-14 17:57:52 +0000188 for (i = 0; i < ARRAY_SIZE(dmidecode_names); i++)
Uwe Hermann43959702010-03-13 17:28:29 +0000189 if (dmi_compare(dmistrings[i], pattern))
Michael Karcher4dfa0932010-02-12 05:44:18 +0000190 return 1;
Michael Karcher6701ee82010-01-20 14:14:11 +0000191
192 return 0;
193}
Carl-Daniel Hailfingere1fdff42010-06-23 23:14:44 +0000194
195#endif /* STANDALONE */