3 Copyright (c) 2006, Intel Corporation
4 All rights reserved. This program and the accompanying materials
5 are licensed and made available under the terms and conditions of the BSD License
6 which accompanies this distribution. The full text of the license may be found at
7 http://opensource.org/licenses/bsd-license.php
9 THE PROGRAM IS DISTRIBUTED UNDER THE BSD LICENSE ON AN "AS IS" BASIS,
10 WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
18 PEI Dispatcher Dependency Evaluator
20 This routine evaluates a dependency expression (DEPENDENCY_EXPRESSION) to determine
21 if a driver can be scheduled for execution. The criteria for
22 schedulability is that the dependency expression is satisfied.
27 #include "dependency.h"
32 IN EFI_PEI_SERVICES
**PeiServices
,
33 IN EVAL_STACK_ENTRY
*Stack
39 This routine determines if a PPI has been installed.
40 The truth value of a GUID is determined by if the PPI has
41 been published and can be queried from the PPI database.
44 PeiServices - The PEI core services table.
45 Stack - Reference to EVAL_STACK_ENTRY that contains PPI GUID to check
49 True if the PPI is already installed.
50 False if the PPI has yet to be installed.
59 // If there is no GUID to evaluate, just return current result on stack.
61 if (Stack
->Operator
== NULL
) {
66 // Copy the Guid into a locale variable so that there are no
67 // possibilities of alignment faults for cross-compilation
68 // environments such as Intel?Itanium(TM).
70 CopyMem(&PpiGuid
, Stack
->Operator
, sizeof(EFI_GUID
));
73 // Check if the PPI is installed.
75 Status
= PeiServicesLocatePpi(
78 NULL
, // EFI_PEI_PPI_DESCRIPTOR
82 if (EFI_ERROR(Status
)) {
91 PeimDispatchReadiness (
92 IN EFI_PEI_SERVICES
**PeiServices
,
93 IN VOID
*DependencyExpression
99 This is the POSTFIX version of the dependency evaluator. When a
100 PUSH [PPI GUID] is encountered, a pointer to the GUID is stored on
101 the evaluation stack. When that entry is poped from the evaluation
102 stack, the PPI is checked if it is installed. This method allows
103 some time savings as not all PPIs must be checked for certain
104 operation types (AND, OR).
108 PeiServices - Calling context.
110 DependencyExpression - Pointer to a dependency expression. The Grammar adheres to
111 the BNF described above and is stored in postfix notation.
114 Status = EFI_SUCCESS if it is a well-formed Grammar
115 EFI_INVALID_PARAMETER if the dependency expression overflows
117 EFI_INVALID_PARAMETER if the dependency expression underflows
119 EFI_INVALID_PARAMETER if the dependency expression is not a
123 DEPENDENCY_EXPRESSION_OPERAND
*Iterator
;
124 EVAL_STACK_ENTRY
*StackPtr
;
125 EVAL_STACK_ENTRY EvalStack
[MAX_GRAMMAR_SIZE
];
127 Iterator
= DependencyExpression
;
129 StackPtr
= &EvalStack
[0];
133 switch (*(Iterator
++)) {
136 // For performance reason we put the frequently used items in front of
137 // the rarely used items
142 // Check to make sure the dependency grammar doesn't overflow the
143 // EvalStack on the push
145 if (StackPtr
> &EvalStack
[MAX_GRAMMAR_SIZE
-1]) {
150 // Push the pointer to the PUSH opcode operator (pointer to PPI GUID)
151 // We will evaluate if the PPI is insalled on the POP operation.
153 StackPtr
->Operator
= (VOID
*) Iterator
;
154 Iterator
= Iterator
+ sizeof (EFI_GUID
);
161 // Check to make sure the dependency grammar doesn't underflow the
162 // EvalStack on the two POPs for the AND operation. Don't need to
163 // check for the overflow on PUSHing the result since we already
166 if (StackPtr
< &EvalStack
[2]) {
171 // Evaluate the first POPed operator only. If the operand is
172 // EFI_DEP_AND and the POPed operator evaluates to FALSE, or the
173 // operand is EFI_DEP_OR and the POPed operator evaluates to TRUE,
174 // we don't need to check the second operator, and the result will be
175 // evaluation of the POPed operator. Otherwise, don't POP the second
176 // operator since it will now evaluate to the final result on the
177 // next operand that causes a POP.
181 // Iterator has increased by 1 after we retrieve the operand, so here we
182 // should get the value pointed by (Iterator - 1), in order to obtain the
185 if (*(Iterator
- 1) == EFI_DEP_AND
) {
186 if (!(IsPpiInstalled (PeiServices
, StackPtr
))) {
187 (StackPtr
-1)->Result
= FALSE
;
188 (StackPtr
-1)->Operator
= NULL
;
191 if (IsPpiInstalled (PeiServices
, StackPtr
)) {
192 (StackPtr
-1)->Result
= TRUE
;
193 (StackPtr
-1)->Operator
= NULL
;
201 // Check to make sure EvalStack is balanced. If not, then there is
202 // an error in the dependency grammar, so return EFI_INVALID_PARAMETER.
204 if (StackPtr
!= &EvalStack
[0]) {
207 return IsPpiInstalled (PeiServices
, StackPtr
);
212 // Check to make sure the dependency grammar doesn't underflow the
213 // EvalStack on the POP for the NOT operation. Don't need to
214 // check for the overflow on PUSHing the result since we already
217 if (StackPtr
< &EvalStack
[1]) {
220 (StackPtr
-1)->Result
= (BOOLEAN
) !IsPpiInstalled (PeiServices
, (StackPtr
-1));
221 (StackPtr
-1)->Operator
= NULL
;
225 case (EFI_DEP_FALSE
):
227 // Check to make sure the dependency grammar doesn't overflow the
228 // EvalStack on the push
230 if (StackPtr
> &EvalStack
[MAX_GRAMMAR_SIZE
-1]) {
234 // Iterator has increased by 1 after we retrieve the operand, so here we
235 // should get the value pointed by (Iterator - 1), in order to obtain the
238 if (*(Iterator
- 1) == EFI_DEP_TRUE
) {
239 StackPtr
->Result
= TRUE
;
241 StackPtr
->Result
= FALSE
;
243 StackPtr
->Operator
= NULL
;
249 // The grammar should never arrive here