blob: cf459ec004858545e3e9bb49f8e86a5815833fa5 [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"
Carl-Daniel Hailfinger5b997c32010-07-27 22:41:39 +000026#include "programmer.h"
Michael Karcher6701ee82010-01-20 14:14:11 +000027
Carl-Daniel Hailfingere1fdff42010-06-23 23:14:44 +000028int has_dmi_support = 0;
29
30#if STANDALONE
31
32/* Stub to indicate missing DMI functionality.
33 * has_dmi_support is 0 by default, so nothing to do here.
34 * Because dmidecode is not available on all systems, the goal is to implement
35 * the DMI subset we need directly in this file.
36 */
37void dmi_init(void)
38{
39}
40
41int dmi_match(const char *pattern)
42{
43 return 0;
44}
45
46#else /* STANDALONE */
47
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000048static const char *dmidecode_names[] = {
Michael Karcherf6498d72010-02-24 22:43:44 +000049 "system-manufacturer",
50 "system-product-name",
51 "system-version",
52 "baseboard-manufacturer",
53 "baseboard-product-name",
Uwe Hermann43959702010-03-13 17:28:29 +000054 "baseboard-version",
Michael Karcher6701ee82010-01-20 14:14:11 +000055};
56
57#define DMI_COMMAND_LEN_MAX 260
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000058static const char *dmidecode_command = "dmidecode";
Michael Karcher6701ee82010-01-20 14:14:11 +000059
Carl-Daniel Hailfingerad3cc552010-07-03 11:02:10 +000060static char *dmistrings[ARRAY_SIZE(dmidecode_names)];
Michael Karcher6701ee82010-01-20 14:14:11 +000061
Uwe Hermann43959702010-03-13 17:28:29 +000062/* Strings longer than 4096 in DMI are just insane. */
Michael Karcher6701ee82010-01-20 14:14:11 +000063#define DMI_MAX_ANSWER_LEN 4096
64
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000065static char *get_dmi_string(const char *string_name)
Michael Karcher6701ee82010-01-20 14:14:11 +000066{
67 FILE *dmidecode_pipe;
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000068 char *result;
69 char answerbuf[DMI_MAX_ANSWER_LEN];
Uwe Hermann43959702010-03-13 17:28:29 +000070 char commandline[DMI_COMMAND_LEN_MAX + 40];
71
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000072 snprintf(commandline, sizeof(commandline),
73 "%s -s %s", dmidecode_command, string_name);
74 dmidecode_pipe = popen(commandline, "r");
75 if (!dmidecode_pipe) {
Sean Nelson316a29f2010-05-07 20:09:04 +000076 msg_perr("DMI pipe open error\n");
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000077 return NULL;
Michael Karcher6701ee82010-01-20 14:14:11 +000078 }
Michael Karcher45f79cb2010-03-24 17:55:04 +000079 if (!fgets(answerbuf, DMI_MAX_ANSWER_LEN, dmidecode_pipe)) {
80 if(ferror(dmidecode_pipe)) {
Sean Nelson316a29f2010-05-07 20:09:04 +000081 msg_perr("DMI pipe read error\n");
Michael Karcher45f79cb2010-03-24 17:55:04 +000082 pclose(dmidecode_pipe);
83 return NULL;
84 } else {
85 answerbuf[0] = 0; /* Hit EOF */
86 }
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000087 }
88 /* Toss all output above DMI_MAX_ANSWER_LEN away to prevent
89 deadlock on pclose. */
90 while (!feof(dmidecode_pipe))
91 getc(dmidecode_pipe);
92 if (pclose(dmidecode_pipe) != 0) {
Sean Nelson316a29f2010-05-07 20:09:04 +000093 msg_pinfo("dmidecode execution unsucessfull - continuing "
94 "without DMI info\n");
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000095 return NULL;
96 }
Michael Karcher6701ee82010-01-20 14:14:11 +000097
Uwe Hermann43959702010-03-13 17:28:29 +000098 /* Chomp trailing newline. */
Michael Karcher0d7fb7c2010-02-26 09:51:16 +000099 if (answerbuf[0] != 0 &&
100 answerbuf[strlen(answerbuf) - 1] == '\n')
101 answerbuf[strlen(answerbuf) - 1] = 0;
Sean Nelson316a29f2010-05-07 20:09:04 +0000102 msg_pdbg("DMI string %s: \"%s\"\n", string_name, answerbuf);
Michael Karcher0d7fb7c2010-02-26 09:51:16 +0000103
104 result = strdup(answerbuf);
105 if (!result)
106 puts("WARNING: Out of memory - DMI support fails");
107
108 return result;
109}
110
111void dmi_init(void)
112{
113 int i;
Michael Karcher8c1df282010-02-26 09:51:20 +0000114 char *chassis_type;
Uwe Hermann43959702010-03-13 17:28:29 +0000115
Michael Karcher6701ee82010-01-20 14:14:11 +0000116 has_dmi_support = 1;
Michael Karcherfd416702010-03-14 17:57:52 +0000117 for (i = 0; i < ARRAY_SIZE(dmidecode_names); i++) {
Michael Karcher0d7fb7c2010-02-26 09:51:16 +0000118 dmistrings[i] = get_dmi_string(dmidecode_names[i]);
119 if (!dmistrings[i]) {
120 has_dmi_support = 0;
Michael Karcherfd416702010-03-14 17:57:52 +0000121 return;
Michael Karcher0d7fb7c2010-02-26 09:51:16 +0000122 }
123 }
Michael Karcher8c1df282010-02-26 09:51:20 +0000124
125 chassis_type = get_dmi_string("chassis-type");
Carl-Daniel Hailfinger27023762010-04-28 15:22:14 +0000126 if (chassis_type && (!strcmp(chassis_type, "Notebook") ||
127 !strcmp(chassis_type, "Portable"))) {
Sean Nelson316a29f2010-05-07 20:09:04 +0000128 msg_pdbg("Laptop detected via DMI\n");
Michael Karcher8c1df282010-02-26 09:51:20 +0000129 is_laptop = 1;
130 }
131 free(chassis_type);
Michael Karcher6701ee82010-01-20 14:14:11 +0000132}
133
134/**
135 * Does an substring/prefix/postfix/whole-string match.
136 *
137 * The pattern is matched as-is. The only metacharacters supported are '^'
138 * at the beginning and '$' at the end. So you can look for "^prefix",
139 * "suffix$", "substring" or "^complete string$".
140 *
141 * @param value The string to check.
142 * @param pattern The pattern.
143 * @return Nonzero if pattern matches.
144 */
145static int dmi_compare(const char *value, const char *pattern)
146{
147 int anchored = 0;
148 int patternlen;
Uwe Hermann43959702010-03-13 17:28:29 +0000149
Sean Nelson316a29f2010-05-07 20:09:04 +0000150 msg_pspew("matching %s against %s\n", value, pattern);
Uwe Hermann43959702010-03-13 17:28:29 +0000151 /* The empty string is part of all strings! */
Michael Karcher6701ee82010-01-20 14:14:11 +0000152 if (pattern[0] == 0)
153 return 1;
154
155 if (pattern[0] == '^') {
156 anchored = 1;
157 pattern++;
158 }
159
160 patternlen = strlen(pattern);
161 if (pattern[patternlen - 1] == '$') {
162 int valuelen = strlen(value);
163 patternlen--;
Uwe Hermann43959702010-03-13 17:28:29 +0000164 if (patternlen > valuelen)
Michael Karcher6701ee82010-01-20 14:14:11 +0000165 return 0;
166
167 /* full string match: require same length */
Uwe Hermann43959702010-03-13 17:28:29 +0000168 if (anchored && (valuelen != patternlen))
Michael Karcher6701ee82010-01-20 14:14:11 +0000169 return 0;
170
171 /* start character to make ends match */
172 value += valuelen - patternlen;
173 anchored = 1;
174 }
175
176 if (anchored)
177 return strncmp(value, pattern, patternlen) == 0;
178 else
179 return strstr(value, pattern) != NULL;
180}
181
182int dmi_match(const char *pattern)
183{
184 int i;
Uwe Hermann43959702010-03-13 17:28:29 +0000185
Michael Karcher6701ee82010-01-20 14:14:11 +0000186 if (!has_dmi_support)
187 return 0;
188
Michael Karcherfd416702010-03-14 17:57:52 +0000189 for (i = 0; i < ARRAY_SIZE(dmidecode_names); i++)
Uwe Hermann43959702010-03-13 17:28:29 +0000190 if (dmi_compare(dmistrings[i], pattern))
Michael Karcher4dfa0932010-02-12 05:44:18 +0000191 return 1;
Michael Karcher6701ee82010-01-20 14:14:11 +0000192
193 return 0;
194}
Carl-Daniel Hailfingere1fdff42010-06-23 23:14:44 +0000195
196#endif /* STANDALONE */