Home | History | Annotate | Line # | Download | only in executer
      1       1.1    jruoho /******************************************************************************
      2       1.1    jruoho  *
      3       1.1    jruoho  * Module Name: exoparg6 - AML execution - opcodes with 6 arguments
      4       1.1    jruoho  *
      5       1.1    jruoho  *****************************************************************************/
      6       1.1    jruoho 
      7  1.1.1.15  christos /******************************************************************************
      8  1.1.1.15  christos  *
      9  1.1.1.15  christos  * 1. Copyright Notice
     10  1.1.1.15  christos  *
     11  1.1.1.16  christos  * Some or all of this work - Copyright (c) 1999 - 2025, Intel Corp.
     12       1.1    jruoho  * All rights reserved.
     13       1.1    jruoho  *
     14  1.1.1.15  christos  * 2. License
     15  1.1.1.15  christos  *
     16  1.1.1.15  christos  * 2.1. This is your license from Intel Corp. under its intellectual property
     17  1.1.1.15  christos  * rights. You may have additional license terms from the party that provided
     18  1.1.1.15  christos  * you this software, covering your right to use that party's intellectual
     19  1.1.1.15  christos  * property rights.
     20  1.1.1.15  christos  *
     21  1.1.1.15  christos  * 2.2. Intel grants, free of charge, to any person ("Licensee") obtaining a
     22  1.1.1.15  christos  * copy of the source code appearing in this file ("Covered Code") an
     23  1.1.1.15  christos  * irrevocable, perpetual, worldwide license under Intel's copyrights in the
     24  1.1.1.15  christos  * base code distributed originally by Intel ("Original Intel Code") to copy,
     25  1.1.1.15  christos  * make derivatives, distribute, use and display any portion of the Covered
     26  1.1.1.15  christos  * Code in any form, with the right to sublicense such rights; and
     27  1.1.1.15  christos  *
     28  1.1.1.15  christos  * 2.3. Intel grants Licensee a non-exclusive and non-transferable patent
     29  1.1.1.15  christos  * license (with the right to sublicense), under only those claims of Intel
     30  1.1.1.15  christos  * patents that are infringed by the Original Intel Code, to make, use, sell,
     31  1.1.1.15  christos  * offer to sell, and import the Covered Code and derivative works thereof
     32  1.1.1.15  christos  * solely to the minimum extent necessary to exercise the above copyright
     33  1.1.1.15  christos  * license, and in no event shall the patent license extend to any additions
     34  1.1.1.15  christos  * to or modifications of the Original Intel Code. No other license or right
     35  1.1.1.15  christos  * is granted directly or by implication, estoppel or otherwise;
     36  1.1.1.15  christos  *
     37  1.1.1.15  christos  * The above copyright and patent license is granted only if the following
     38  1.1.1.15  christos  * conditions are met:
     39  1.1.1.15  christos  *
     40  1.1.1.15  christos  * 3. Conditions
     41  1.1.1.15  christos  *
     42  1.1.1.15  christos  * 3.1. Redistribution of Source with Rights to Further Distribute Source.
     43  1.1.1.15  christos  * Redistribution of source code of any substantial portion of the Covered
     44  1.1.1.15  christos  * Code or modification with rights to further distribute source must include
     45  1.1.1.15  christos  * the above Copyright Notice, the above License, this list of Conditions,
     46  1.1.1.15  christos  * and the following Disclaimer and Export Compliance provision. In addition,
     47  1.1.1.15  christos  * Licensee must cause all Covered Code to which Licensee contributes to
     48  1.1.1.15  christos  * contain a file documenting the changes Licensee made to create that Covered
     49  1.1.1.15  christos  * Code and the date of any change. Licensee must include in that file the
     50  1.1.1.15  christos  * documentation of any changes made by any predecessor Licensee. Licensee
     51  1.1.1.15  christos  * must include a prominent statement that the modification is derived,
     52  1.1.1.15  christos  * directly or indirectly, from Original Intel Code.
     53  1.1.1.15  christos  *
     54  1.1.1.15  christos  * 3.2. Redistribution of Source with no Rights to Further Distribute Source.
     55  1.1.1.15  christos  * Redistribution of source code of any substantial portion of the Covered
     56  1.1.1.15  christos  * Code or modification without rights to further distribute source must
     57  1.1.1.15  christos  * include the following Disclaimer and Export Compliance provision in the
     58  1.1.1.15  christos  * documentation and/or other materials provided with distribution. In
     59  1.1.1.15  christos  * addition, Licensee may not authorize further sublicense of source of any
     60  1.1.1.15  christos  * portion of the Covered Code, and must include terms to the effect that the
     61  1.1.1.15  christos  * license from Licensee to its licensee is limited to the intellectual
     62  1.1.1.15  christos  * property embodied in the software Licensee provides to its licensee, and
     63  1.1.1.15  christos  * not to intellectual property embodied in modifications its licensee may
     64  1.1.1.15  christos  * make.
     65  1.1.1.15  christos  *
     66  1.1.1.15  christos  * 3.3. Redistribution of Executable. Redistribution in executable form of any
     67  1.1.1.15  christos  * substantial portion of the Covered Code or modification must reproduce the
     68  1.1.1.15  christos  * above Copyright Notice, and the following Disclaimer and Export Compliance
     69  1.1.1.15  christos  * provision in the documentation and/or other materials provided with the
     70  1.1.1.15  christos  * distribution.
     71  1.1.1.15  christos  *
     72  1.1.1.15  christos  * 3.4. Intel retains all right, title, and interest in and to the Original
     73  1.1.1.15  christos  * Intel Code.
     74  1.1.1.15  christos  *
     75  1.1.1.15  christos  * 3.5. Neither the name Intel nor any other trademark owned or controlled by
     76  1.1.1.15  christos  * Intel shall be used in advertising or otherwise to promote the sale, use or
     77  1.1.1.15  christos  * other dealings in products derived from or relating to the Covered Code
     78  1.1.1.15  christos  * without prior written authorization from Intel.
     79  1.1.1.15  christos  *
     80  1.1.1.15  christos  * 4. Disclaimer and Export Compliance
     81  1.1.1.15  christos  *
     82  1.1.1.15  christos  * 4.1. INTEL MAKES NO WARRANTY OF ANY KIND REGARDING ANY SOFTWARE PROVIDED
     83  1.1.1.15  christos  * HERE. ANY SOFTWARE ORIGINATING FROM INTEL OR DERIVED FROM INTEL SOFTWARE
     84  1.1.1.15  christos  * IS PROVIDED "AS IS," AND INTEL WILL NOT PROVIDE ANY SUPPORT, ASSISTANCE,
     85  1.1.1.15  christos  * INSTALLATION, TRAINING OR OTHER SERVICES. INTEL WILL NOT PROVIDE ANY
     86  1.1.1.15  christos 
     87  1.1.1.15  christos  * UPDATES, ENHANCEMENTS OR EXTENSIONS. INTEL SPECIFICALLY DISCLAIMS ANY
     88  1.1.1.15  christos  * IMPLIED WARRANTIES OF MERCHANTABILITY, NONINFRINGEMENT AND FITNESS FOR A
     89  1.1.1.15  christos  * PARTICULAR PURPOSE.
     90  1.1.1.15  christos  *
     91  1.1.1.15  christos  * 4.2. IN NO EVENT SHALL INTEL HAVE ANY LIABILITY TO LICENSEE, ITS LICENSEES
     92  1.1.1.15  christos  * OR ANY OTHER THIRD PARTY, FOR ANY LOST PROFITS, LOST DATA, LOSS OF USE OR
     93  1.1.1.15  christos  * COSTS OF PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, OR FOR ANY INDIRECT,
     94  1.1.1.15  christos  * SPECIAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THIS AGREEMENT, UNDER ANY
     95  1.1.1.15  christos  * CAUSE OF ACTION OR THEORY OF LIABILITY, AND IRRESPECTIVE OF WHETHER INTEL
     96  1.1.1.15  christos  * HAS ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES. THESE LIMITATIONS
     97  1.1.1.15  christos  * SHALL APPLY NOTWITHSTANDING THE FAILURE OF THE ESSENTIAL PURPOSE OF ANY
     98  1.1.1.15  christos  * LIMITED REMEDY.
     99  1.1.1.15  christos  *
    100  1.1.1.15  christos  * 4.3. Licensee shall not export, either directly or indirectly, any of this
    101  1.1.1.15  christos  * software or system incorporating such software without first obtaining any
    102  1.1.1.15  christos  * required license or other approval from the U. S. Department of Commerce or
    103  1.1.1.15  christos  * any other agency or department of the United States Government. In the
    104  1.1.1.15  christos  * event Licensee exports any such software from the United States or
    105  1.1.1.15  christos  * re-exports any such software from a foreign destination, Licensee shall
    106  1.1.1.15  christos  * ensure that the distribution and export/re-export of the software is in
    107  1.1.1.15  christos  * compliance with all laws, regulations, orders, or other restrictions of the
    108  1.1.1.15  christos  * U.S. Export Administration Regulations. Licensee agrees that neither it nor
    109  1.1.1.15  christos  * any of its subsidiaries will export/re-export any technical data, process,
    110  1.1.1.15  christos  * software, or service, directly or indirectly, to any country for which the
    111  1.1.1.15  christos  * United States government or any agency thereof requires an export license,
    112  1.1.1.15  christos  * other governmental approval, or letter of assurance, without first obtaining
    113  1.1.1.15  christos  * such license, approval or letter.
    114  1.1.1.15  christos  *
    115  1.1.1.15  christos  *****************************************************************************
    116  1.1.1.15  christos  *
    117  1.1.1.15  christos  * Alternatively, you may choose to be licensed under the terms of the
    118  1.1.1.15  christos  * following license:
    119  1.1.1.15  christos  *
    120   1.1.1.2    jruoho  * Redistribution and use in source and binary forms, with or without
    121   1.1.1.2    jruoho  * modification, are permitted provided that the following conditions
    122   1.1.1.2    jruoho  * are met:
    123   1.1.1.2    jruoho  * 1. Redistributions of source code must retain the above copyright
    124   1.1.1.2    jruoho  *    notice, this list of conditions, and the following disclaimer,
    125   1.1.1.2    jruoho  *    without modification.
    126   1.1.1.2    jruoho  * 2. Redistributions in binary form must reproduce at minimum a disclaimer
    127   1.1.1.2    jruoho  *    substantially similar to the "NO WARRANTY" disclaimer below
    128   1.1.1.2    jruoho  *    ("Disclaimer") and any redistribution must be conditioned upon
    129   1.1.1.2    jruoho  *    including a substantially similar Disclaimer requirement for further
    130   1.1.1.2    jruoho  *    binary redistribution.
    131   1.1.1.2    jruoho  * 3. Neither the names of the above-listed copyright holders nor the names
    132   1.1.1.2    jruoho  *    of any contributors may be used to endorse or promote products derived
    133   1.1.1.2    jruoho  *    from this software without specific prior written permission.
    134   1.1.1.2    jruoho  *
    135   1.1.1.2    jruoho  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
    136   1.1.1.2    jruoho  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
    137  1.1.1.12  christos  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
    138   1.1.1.2    jruoho  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
    139  1.1.1.15  christos  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
    140  1.1.1.15  christos  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
    141  1.1.1.15  christos  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
    142  1.1.1.15  christos  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
    143  1.1.1.15  christos  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
    144  1.1.1.15  christos  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
    145  1.1.1.15  christos  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
    146  1.1.1.15  christos  *
    147  1.1.1.15  christos  * Alternatively, you may choose to be licensed under the terms of the
    148  1.1.1.15  christos  * GNU General Public License ("GPL") version 2 as published by the Free
    149  1.1.1.15  christos  * Software Foundation.
    150  1.1.1.15  christos  *
    151  1.1.1.15  christos  *****************************************************************************/
    152       1.1    jruoho 
    153       1.1    jruoho #include "acpi.h"
    154       1.1    jruoho #include "accommon.h"
    155       1.1    jruoho #include "acinterp.h"
    156       1.1    jruoho #include "acparser.h"
    157       1.1    jruoho #include "amlcode.h"
    158       1.1    jruoho 
    159       1.1    jruoho 
    160       1.1    jruoho #define _COMPONENT          ACPI_EXECUTER
    161       1.1    jruoho         ACPI_MODULE_NAME    ("exoparg6")
    162       1.1    jruoho 
    163       1.1    jruoho 
    164       1.1    jruoho /*!
    165       1.1    jruoho  * Naming convention for AML interpreter execution routines.
    166       1.1    jruoho  *
    167       1.1    jruoho  * The routines that begin execution of AML opcodes are named with a common
    168       1.1    jruoho  * convention based upon the number of arguments, the number of target operands,
    169       1.1    jruoho  * and whether or not a value is returned:
    170       1.1    jruoho  *
    171       1.1    jruoho  *      AcpiExOpcode_xA_yT_zR
    172       1.1    jruoho  *
    173       1.1    jruoho  * Where:
    174       1.1    jruoho  *
    175       1.1    jruoho  * xA - ARGUMENTS:    The number of arguments (input operands) that are
    176       1.1    jruoho  *                    required for this opcode type (1 through 6 args).
    177       1.1    jruoho  * yT - TARGETS:      The number of targets (output operands) that are required
    178       1.1    jruoho  *                    for this opcode type (0, 1, or 2 targets).
    179       1.1    jruoho  * zR - RETURN VALUE: Indicates whether this opcode type returns a value
    180       1.1    jruoho  *                    as the function return (0 or 1).
    181       1.1    jruoho  *
    182       1.1    jruoho  * The AcpiExOpcode* functions are called via the Dispatcher component with
    183       1.1    jruoho  * fully resolved operands.
    184       1.1    jruoho !*/
    185       1.1    jruoho 
    186       1.1    jruoho /* Local prototypes */
    187       1.1    jruoho 
    188       1.1    jruoho static BOOLEAN
    189       1.1    jruoho AcpiExDoMatch (
    190       1.1    jruoho     UINT32                  MatchOp,
    191       1.1    jruoho     ACPI_OPERAND_OBJECT     *PackageObj,
    192       1.1    jruoho     ACPI_OPERAND_OBJECT     *MatchObj);
    193       1.1    jruoho 
    194       1.1    jruoho 
    195       1.1    jruoho /*******************************************************************************
    196       1.1    jruoho  *
    197       1.1    jruoho  * FUNCTION:    AcpiExDoMatch
    198       1.1    jruoho  *
    199       1.1    jruoho  * PARAMETERS:  MatchOp         - The AML match operand
    200       1.1    jruoho  *              PackageObj      - Object from the target package
    201       1.1    jruoho  *              MatchObj        - Object to be matched
    202       1.1    jruoho  *
    203       1.1    jruoho  * RETURN:      TRUE if the match is successful, FALSE otherwise
    204       1.1    jruoho  *
    205       1.1    jruoho  * DESCRIPTION: Implements the low-level match for the ASL Match operator.
    206       1.1    jruoho  *              Package elements will be implicitly converted to the type of
    207       1.1    jruoho  *              the match object (Integer/Buffer/String).
    208       1.1    jruoho  *
    209       1.1    jruoho  ******************************************************************************/
    210       1.1    jruoho 
    211       1.1    jruoho static BOOLEAN
    212       1.1    jruoho AcpiExDoMatch (
    213       1.1    jruoho     UINT32                  MatchOp,
    214       1.1    jruoho     ACPI_OPERAND_OBJECT     *PackageObj,
    215       1.1    jruoho     ACPI_OPERAND_OBJECT     *MatchObj)
    216       1.1    jruoho {
    217       1.1    jruoho     BOOLEAN                 LogicalResult = TRUE;
    218       1.1    jruoho     ACPI_STATUS             Status;
    219       1.1    jruoho 
    220       1.1    jruoho 
    221       1.1    jruoho     /*
    222       1.1    jruoho      * Note: Since the PackageObj/MatchObj ordering is opposite to that of
    223       1.1    jruoho      * the standard logical operators, we have to reverse them when we call
    224       1.1    jruoho      * DoLogicalOp in order to make the implicit conversion rules work
    225       1.1    jruoho      * correctly. However, this means we have to flip the entire equation
    226       1.1    jruoho      * also. A bit ugly perhaps, but overall, better than fussing the
    227       1.1    jruoho      * parameters around at runtime, over and over again.
    228       1.1    jruoho      *
    229       1.1    jruoho      * Below, P[i] refers to the package element, M refers to the Match object.
    230       1.1    jruoho      */
    231       1.1    jruoho     switch (MatchOp)
    232       1.1    jruoho     {
    233       1.1    jruoho     case MATCH_MTR:
    234       1.1    jruoho 
    235       1.1    jruoho         /* Always true */
    236       1.1    jruoho 
    237       1.1    jruoho         break;
    238       1.1    jruoho 
    239       1.1    jruoho     case MATCH_MEQ:
    240       1.1    jruoho         /*
    241       1.1    jruoho          * True if equal: (P[i] == M)
    242       1.1    jruoho          * Change to:     (M == P[i])
    243       1.1    jruoho          */
    244   1.1.1.6  christos         Status = AcpiExDoLogicalOp (
    245   1.1.1.8  christos             AML_LOGICAL_EQUAL_OP, MatchObj, PackageObj, &LogicalResult);
    246       1.1    jruoho         if (ACPI_FAILURE (Status))
    247       1.1    jruoho         {
    248       1.1    jruoho             return (FALSE);
    249       1.1    jruoho         }
    250       1.1    jruoho         break;
    251       1.1    jruoho 
    252       1.1    jruoho     case MATCH_MLE:
    253       1.1    jruoho         /*
    254       1.1    jruoho          * True if less than or equal: (P[i] <= M) (P[i] NotGreater than M)
    255       1.1    jruoho          * Change to:                  (M >= P[i]) (M NotLess than P[i])
    256       1.1    jruoho          */
    257   1.1.1.6  christos         Status = AcpiExDoLogicalOp (
    258   1.1.1.8  christos             AML_LOGICAL_LESS_OP, MatchObj, PackageObj, &LogicalResult);
    259       1.1    jruoho         if (ACPI_FAILURE (Status))
    260       1.1    jruoho         {
    261       1.1    jruoho             return (FALSE);
    262       1.1    jruoho         }
    263       1.1    jruoho         LogicalResult = (BOOLEAN) !LogicalResult;
    264       1.1    jruoho         break;
    265       1.1    jruoho 
    266       1.1    jruoho     case MATCH_MLT:
    267       1.1    jruoho         /*
    268       1.1    jruoho          * True if less than: (P[i] < M)
    269       1.1    jruoho          * Change to:         (M > P[i])
    270       1.1    jruoho          */
    271   1.1.1.6  christos         Status = AcpiExDoLogicalOp (
    272   1.1.1.8  christos             AML_LOGICAL_GREATER_OP, MatchObj, PackageObj, &LogicalResult);
    273       1.1    jruoho         if (ACPI_FAILURE (Status))
    274       1.1    jruoho         {
    275       1.1    jruoho             return (FALSE);
    276       1.1    jruoho         }
    277       1.1    jruoho         break;
    278       1.1    jruoho 
    279       1.1    jruoho     case MATCH_MGE:
    280       1.1    jruoho         /*
    281       1.1    jruoho          * True if greater than or equal: (P[i] >= M) (P[i] NotLess than M)
    282       1.1    jruoho          * Change to:                     (M <= P[i]) (M NotGreater than P[i])
    283       1.1    jruoho          */
    284   1.1.1.6  christos         Status = AcpiExDoLogicalOp (
    285   1.1.1.8  christos             AML_LOGICAL_GREATER_OP, MatchObj, PackageObj, &LogicalResult);
    286       1.1    jruoho         if (ACPI_FAILURE (Status))
    287       1.1    jruoho         {
    288       1.1    jruoho             return (FALSE);
    289       1.1    jruoho         }
    290       1.1    jruoho         LogicalResult = (BOOLEAN)!LogicalResult;
    291       1.1    jruoho         break;
    292       1.1    jruoho 
    293       1.1    jruoho     case MATCH_MGT:
    294       1.1    jruoho         /*
    295       1.1    jruoho          * True if greater than: (P[i] > M)
    296       1.1    jruoho          * Change to:            (M < P[i])
    297       1.1    jruoho          */
    298   1.1.1.6  christos         Status = AcpiExDoLogicalOp (
    299   1.1.1.8  christos             AML_LOGICAL_LESS_OP, MatchObj, PackageObj, &LogicalResult);
    300       1.1    jruoho         if (ACPI_FAILURE (Status))
    301       1.1    jruoho         {
    302       1.1    jruoho             return (FALSE);
    303       1.1    jruoho         }
    304       1.1    jruoho         break;
    305       1.1    jruoho 
    306       1.1    jruoho     default:
    307       1.1    jruoho 
    308       1.1    jruoho         /* Undefined */
    309       1.1    jruoho 
    310       1.1    jruoho         return (FALSE);
    311       1.1    jruoho     }
    312       1.1    jruoho 
    313   1.1.1.3  christos     return (LogicalResult);
    314       1.1    jruoho }
    315       1.1    jruoho 
    316       1.1    jruoho 
    317       1.1    jruoho /*******************************************************************************
    318       1.1    jruoho  *
    319       1.1    jruoho  * FUNCTION:    AcpiExOpcode_6A_0T_1R
    320       1.1    jruoho  *
    321       1.1    jruoho  * PARAMETERS:  WalkState           - Current walk state
    322       1.1    jruoho  *
    323       1.1    jruoho  * RETURN:      Status
    324       1.1    jruoho  *
    325       1.1    jruoho  * DESCRIPTION: Execute opcode with 6 arguments, no target, and a return value
    326       1.1    jruoho  *
    327       1.1    jruoho  ******************************************************************************/
    328       1.1    jruoho 
    329       1.1    jruoho ACPI_STATUS
    330       1.1    jruoho AcpiExOpcode_6A_0T_1R (
    331       1.1    jruoho     ACPI_WALK_STATE         *WalkState)
    332       1.1    jruoho {
    333       1.1    jruoho     ACPI_OPERAND_OBJECT     **Operand = &WalkState->Operands[0];
    334       1.1    jruoho     ACPI_OPERAND_OBJECT     *ReturnDesc = NULL;
    335       1.1    jruoho     ACPI_STATUS             Status = AE_OK;
    336       1.1    jruoho     UINT64                  Index;
    337       1.1    jruoho     ACPI_OPERAND_OBJECT     *ThisElement;
    338       1.1    jruoho 
    339       1.1    jruoho 
    340       1.1    jruoho     ACPI_FUNCTION_TRACE_STR (ExOpcode_6A_0T_1R,
    341       1.1    jruoho         AcpiPsGetOpcodeName (WalkState->Opcode));
    342       1.1    jruoho 
    343       1.1    jruoho 
    344       1.1    jruoho     switch (WalkState->Opcode)
    345       1.1    jruoho     {
    346       1.1    jruoho     case AML_MATCH_OP:
    347       1.1    jruoho         /*
    348       1.1    jruoho          * Match (SearchPkg[0], MatchOp1[1], MatchObj1[2],
    349       1.1    jruoho          *                      MatchOp2[3], MatchObj2[4], StartIndex[5])
    350       1.1    jruoho          */
    351       1.1    jruoho 
    352       1.1    jruoho         /* Validate both Match Term Operators (MTR, MEQ, etc.) */
    353       1.1    jruoho 
    354       1.1    jruoho         if ((Operand[1]->Integer.Value > MAX_MATCH_OPERATOR) ||
    355       1.1    jruoho             (Operand[3]->Integer.Value > MAX_MATCH_OPERATOR))
    356       1.1    jruoho         {
    357       1.1    jruoho             ACPI_ERROR ((AE_INFO, "Match operator out of range"));
    358       1.1    jruoho             Status = AE_AML_OPERAND_VALUE;
    359       1.1    jruoho             goto Cleanup;
    360       1.1    jruoho         }
    361       1.1    jruoho 
    362       1.1    jruoho         /* Get the package StartIndex, validate against the package length */
    363       1.1    jruoho 
    364       1.1    jruoho         Index = Operand[5]->Integer.Value;
    365       1.1    jruoho         if (Index >= Operand[0]->Package.Count)
    366       1.1    jruoho         {
    367       1.1    jruoho             ACPI_ERROR ((AE_INFO,
    368       1.1    jruoho                 "Index (0x%8.8X%8.8X) beyond package end (0x%X)",
    369       1.1    jruoho                 ACPI_FORMAT_UINT64 (Index), Operand[0]->Package.Count));
    370       1.1    jruoho             Status = AE_AML_PACKAGE_LIMIT;
    371       1.1    jruoho             goto Cleanup;
    372       1.1    jruoho         }
    373       1.1    jruoho 
    374       1.1    jruoho         /* Create an integer for the return value */
    375       1.1    jruoho         /* Default return value is ACPI_UINT64_MAX if no match found */
    376       1.1    jruoho 
    377       1.1    jruoho         ReturnDesc = AcpiUtCreateIntegerObject (ACPI_UINT64_MAX);
    378       1.1    jruoho         if (!ReturnDesc)
    379       1.1    jruoho         {
    380       1.1    jruoho             Status = AE_NO_MEMORY;
    381       1.1    jruoho             goto Cleanup;
    382       1.1    jruoho 
    383       1.1    jruoho         }
    384       1.1    jruoho 
    385       1.1    jruoho         /*
    386       1.1    jruoho          * Examine each element until a match is found. Both match conditions
    387       1.1    jruoho          * must be satisfied for a match to occur. Within the loop,
    388       1.1    jruoho          * "continue" signifies that the current element does not match
    389       1.1    jruoho          * and the next should be examined.
    390       1.1    jruoho          *
    391       1.1    jruoho          * Upon finding a match, the loop will terminate via "break" at
    392   1.1.1.3  christos          * the bottom. If it terminates "normally", MatchValue will be
    393       1.1    jruoho          * ACPI_UINT64_MAX (Ones) (its initial value) indicating that no
    394       1.1    jruoho          * match was found.
    395       1.1    jruoho          */
    396       1.1    jruoho         for ( ; Index < Operand[0]->Package.Count; Index++)
    397       1.1    jruoho         {
    398       1.1    jruoho             /* Get the current package element */
    399       1.1    jruoho 
    400       1.1    jruoho             ThisElement = Operand[0]->Package.Elements[Index];
    401       1.1    jruoho 
    402       1.1    jruoho             /* Treat any uninitialized (NULL) elements as non-matching */
    403       1.1    jruoho 
    404       1.1    jruoho             if (!ThisElement)
    405       1.1    jruoho             {
    406       1.1    jruoho                 continue;
    407       1.1    jruoho             }
    408       1.1    jruoho 
    409       1.1    jruoho             /*
    410       1.1    jruoho              * Both match conditions must be satisfied. Execution of a continue
    411       1.1    jruoho              * (proceed to next iteration of enclosing for loop) signifies a
    412       1.1    jruoho              * non-match.
    413       1.1    jruoho              */
    414       1.1    jruoho             if (!AcpiExDoMatch ((UINT32) Operand[1]->Integer.Value,
    415   1.1.1.6  christos                     ThisElement, Operand[2]))
    416       1.1    jruoho             {
    417       1.1    jruoho                 continue;
    418       1.1    jruoho             }
    419       1.1    jruoho 
    420       1.1    jruoho             if (!AcpiExDoMatch ((UINT32) Operand[3]->Integer.Value,
    421   1.1.1.6  christos                     ThisElement, Operand[4]))
    422       1.1    jruoho             {
    423       1.1    jruoho                 continue;
    424       1.1    jruoho             }
    425       1.1    jruoho 
    426       1.1    jruoho             /* Match found: Index is the return value */
    427       1.1    jruoho 
    428       1.1    jruoho             ReturnDesc->Integer.Value = Index;
    429       1.1    jruoho             break;
    430       1.1    jruoho         }
    431       1.1    jruoho         break;
    432       1.1    jruoho 
    433       1.1    jruoho     case AML_LOAD_TABLE_OP:
    434       1.1    jruoho 
    435       1.1    jruoho         Status = AcpiExLoadTableOp (WalkState, &ReturnDesc);
    436       1.1    jruoho         break;
    437       1.1    jruoho 
    438       1.1    jruoho     default:
    439       1.1    jruoho 
    440       1.1    jruoho         ACPI_ERROR ((AE_INFO, "Unknown AML opcode 0x%X",
    441       1.1    jruoho             WalkState->Opcode));
    442   1.1.1.6  christos 
    443       1.1    jruoho         Status = AE_AML_BAD_OPCODE;
    444       1.1    jruoho         goto Cleanup;
    445       1.1    jruoho     }
    446       1.1    jruoho 
    447       1.1    jruoho 
    448       1.1    jruoho Cleanup:
    449       1.1    jruoho 
    450       1.1    jruoho     /* Delete return object on error */
    451       1.1    jruoho 
    452       1.1    jruoho     if (ACPI_FAILURE (Status))
    453       1.1    jruoho     {
    454       1.1    jruoho         AcpiUtRemoveReference (ReturnDesc);
    455       1.1    jruoho     }
    456       1.1    jruoho 
    457       1.1    jruoho     /* Save return object on success */
    458       1.1    jruoho 
    459       1.1    jruoho     else
    460       1.1    jruoho     {
    461       1.1    jruoho         WalkState->ResultObj = ReturnDesc;
    462       1.1    jruoho     }
    463       1.1    jruoho 
    464       1.1    jruoho     return_ACPI_STATUS (Status);
    465       1.1    jruoho }
    466