• Home
  • History
  • Annotate
  • Line#
  • Navigate
  • Raw
  • Download
  • only in /barrelfish-2018-10-04/lib/acpica/tests/aslts/src/runtime/collections/Identity2MS/abbu/recursion/
1/*
2 * Some or all of this work - Copyright (c) 2006 - 2016, Intel Corp.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without modification,
6 * are permitted provided that the following conditions are met:
7 *
8 * Redistributions of source code must retain the above copyright notice,
9 * this list of conditions and the following disclaimer.
10 * Redistributions in binary form must reproduce the above copyright notice,
11 * this list of conditions and the following disclaimer in the documentation
12 * and/or other materials provided with the distribution.
13 * Neither the name of Intel Corporation nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
23 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
25 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
26 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29/*
30 * Tests to check recursive calls of methods for different structure of
31 * sub-trees containig the point from where the call is made and the point
32 * which is just the invoked method, and different relative disposition of
33 * those sub-trees containig the points.
34 */
35
36Name(z171, 171)
37
38
39Processor(pr00, 0, 0x000, 0x008)
40{
41	Name(i000, 0xabcd0000)
42}
43
44Name(i000, 0)
45
46Method(mr00,, Serialized)
47{
48	Name(ts, "mr00")
49
50	Device(d100)
51	{
52		Name(i200, 0xabcd0200)
53		Name(i201, 0xabcd0201)
54	}
55
56	Device(d101)
57	{
58		Name(i202, 0xabcd0202)
59		Method(m203,, Serialized)
60		{
61			Name(i300, 0xabcd0300)
62			Name(i301, 0xabcd0301)
63			Store("---------------------------------------- Run m203", Debug)
64			Increment(i000)
65			if (LLess(i000, 3)) {
66				m203()
67			}
68		}
69		Name(i204, 0xabcd0204)
70	}
71	Device(d102)
72	{
73		Name(i205, 0xabcd0205)
74		Name(i206, 0xabcd0206)
75	}
76	d101.m203()
77}
78
79Method(mr01)
80{
81/*
82    CH03(ts, z169, 0x100, 0, 0)
83
84    mm00()
85
86    if (LNotEqual(i000, 0xabcd0000)) {
87        err(ts, z169, 0x000, 0, 0, i000, 0xabcd0000)
88    }
89
90    CH03(ts, z169, 0x101, 0, 0)
91*/
92}
93
94Method(mrff,, Serialized)
95{
96	Name(run0, 1)
97
98	SRMT("mr00")
99	mr00()
100}
101