Rev 329 | Go to most recent revision | Details | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
326 | palkovsky | 1 | /* |
2 | * Copyright (C) 2005 Ondrej Palkovsky |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * - The name of the author may not be used to endorse or promote products |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
||
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
29 | #include <print.h> |
||
30 | #include <debug.h> |
||
31 | #include <panic.h> |
||
32 | |||
33 | #include <test.h> |
||
34 | #include <arch/atomic.h> |
||
35 | #include <proc/thread.h> |
||
36 | #include <time/delay.h> |
||
37 | |||
38 | #include <arch.h> |
||
39 | |||
40 | #define THREADS 50 |
||
41 | #define DELAY 10000L |
||
42 | #define ATTEMPTS 5 |
||
43 | |||
44 | static volatile int threads_ok; |
||
45 | static waitq_t can_start; |
||
46 | |||
47 | static void testit1(void *data) |
||
48 | { |
||
49 | int i; |
||
50 | volatile long long j; |
||
51 | double e,d,le,f; |
||
52 | int arg __attribute__((aligned(16))) = (int)((__native) data); |
||
53 | int after_arg __attribute__((aligned(16))); |
||
54 | |||
55 | waitq_sleep(&can_start); |
||
56 | |||
57 | for (i = 0; i<ATTEMPTS; i++) { |
||
58 | __asm__ volatile ( |
||
59 | "mtc1 %0,$1" |
||
60 | :"=r"(arg) |
||
61 | ); |
||
62 | |||
63 | delay(DELAY); |
||
64 | __asm__ volatile ( |
||
65 | "mfc1 %0, $1" |
||
66 | :"=r"(after_arg) |
||
67 | ); |
||
68 | |||
69 | if(arg != after_arg) |
||
70 | panic("General reg tid%d: arg(%d) != %d\n", |
||
71 | THREAD->tid, arg, after_arg); |
||
72 | } |
||
73 | |||
74 | atomic_inc(&threads_ok); |
||
75 | } |
||
76 | |||
77 | static void testit2(void *data) |
||
78 | { |
||
79 | int i; |
||
80 | volatile long long j; |
||
81 | double e,d,le,f; |
||
82 | int arg __attribute__((aligned(16))) = (int)((__native) data); |
||
83 | int after_arg __attribute__((aligned(16))); |
||
84 | |||
85 | waitq_sleep(&can_start); |
||
86 | |||
87 | for (i = 0; i<ATTEMPTS; i++) { |
||
88 | __asm__ volatile ( |
||
89 | "ctc1 %0,$1" |
||
90 | :"=r"(arg) |
||
91 | ); |
||
92 | |||
93 | scheduler(); |
||
94 | __asm__ volatile ( |
||
95 | "cfc1 %0,$1" |
||
96 | :"=r"(after_arg) |
||
97 | ); |
||
98 | |||
99 | if(arg != after_arg) |
||
100 | panic("Control reg tid%d: arg(%d) != %d\n", |
||
101 | THREAD->tid, arg, after_arg); |
||
102 | } |
||
103 | |||
104 | atomic_inc(&threads_ok); |
||
105 | } |
||
106 | |||
107 | |||
108 | void test(void) |
||
109 | { |
||
110 | thread_t *t; |
||
111 | int i; |
||
112 | |||
113 | waitq_initialize(&can_start); |
||
114 | |||
115 | printf("MIPS test #1\n"); |
||
116 | printf("Creating %d threads... ", THREADS); |
||
117 | |||
118 | for (i=0; i<THREADS/2; i++) { |
||
119 | if (!(t = thread_create(testit1, (void *)((__native)i*2), TASK, 0))) |
||
120 | panic("could not create thread\n"); |
||
121 | thread_ready(t); |
||
122 | if (!(t = thread_create(testit2, (void *)((__native)i*2+1), TASK, 0))) |
||
123 | panic("could not create thread\n"); |
||
124 | thread_ready(t); |
||
125 | } |
||
126 | |||
127 | printf("ok\n"); |
||
128 | |||
129 | thread_sleep(1); |
||
130 | waitq_wakeup(&can_start, WAKEUP_ALL); |
||
131 | |||
132 | while (threads_ok != THREADS) |
||
133 | ; |
||
134 | |||
135 | printf("Test passed.\n"); |
||
136 | } |