ยปCore Development>Code coverage>Lib/test/pystone.py

Python code coverage for Lib/test/pystone.py

#countcontent
1n/a#! /usr/bin/env python
2n/a
3n/a"""
4n/a"PYSTONE" Benchmark Program
5n/a
6n/aVersion: Python/1.1 (corresponds to C/1.1 plus 2 Pystone fixes)
7n/a
8n/aAuthor: Reinhold P. Weicker, CACM Vol 27, No 10, 10/84 pg. 1013.
9n/a
10n/a Translated from ADA to C by Rick Richardson.
11n/a Every method to preserve ADA-likeness has been used,
12n/a at the expense of C-ness.
13n/a
14n/a Translated from C to Python by Guido van Rossum.
15n/a
16n/aVersion History:
17n/a
18n/a Version 1.1 corrects two bugs in version 1.0:
19n/a
20n/a First, it leaked memory: in Proc1(), NextRecord ends
21n/a up having a pointer to itself. I have corrected this
22n/a by zapping NextRecord.PtrComp at the end of Proc1().
23n/a
24n/a Second, Proc3() used the operator != to compare a
25n/a record to None. This is rather inefficient and not
26n/a true to the intention of the original benchmark (where
27n/a a pointer comparison to None is intended; the !=
28n/a operator attempts to find a method __cmp__ to do value
29n/a comparison of the record). Version 1.1 runs 5-10
30n/a percent faster than version 1.0, so benchmark figures
31n/a of different versions can't be compared directly.
32n/a
33n/a"""
34n/a
35n/aLOOPS = 50000
36n/a
37n/afrom time import clock
38n/a
39n/a__version__ = "1.1"
40n/a
41n/a[Ident1, Ident2, Ident3, Ident4, Ident5] = range(1, 6)
42n/a
43n/aclass Record:
44n/a
45n/a def __init__(self, PtrComp = None, Discr = 0, EnumComp = 0,
46n/a IntComp = 0, StringComp = 0):
47n/a self.PtrComp = PtrComp
48n/a self.Discr = Discr
49n/a self.EnumComp = EnumComp
50n/a self.IntComp = IntComp
51n/a self.StringComp = StringComp
52n/a
53n/a def copy(self):
54n/a return Record(self.PtrComp, self.Discr, self.EnumComp,
55n/a self.IntComp, self.StringComp)
56n/a
57n/aTRUE = 1
58n/aFALSE = 0
59n/a
60n/adef main(loops=LOOPS):
61n/a benchtime, stones = pystones(loops)
62n/a print "Pystone(%s) time for %d passes = %g" % \
63n/a (__version__, loops, benchtime)
64n/a print "This machine benchmarks at %g pystones/second" % stones
65n/a
66n/a
67n/adef pystones(loops=LOOPS):
68n/a return Proc0(loops)
69n/a
70n/aIntGlob = 0
71n/aBoolGlob = FALSE
72n/aChar1Glob = '\0'
73n/aChar2Glob = '\0'
74n/aArray1Glob = [0]*51
75n/aArray2Glob = map(lambda x: x[:], [Array1Glob]*51)
76n/aPtrGlb = None
77n/aPtrGlbNext = None
78n/a
79n/adef Proc0(loops=LOOPS):
80n/a global IntGlob
81n/a global BoolGlob
82n/a global Char1Glob
83n/a global Char2Glob
84n/a global Array1Glob
85n/a global Array2Glob
86n/a global PtrGlb
87n/a global PtrGlbNext
88n/a
89n/a starttime = clock()
90n/a for i in range(loops):
91n/a pass
92n/a nulltime = clock() - starttime
93n/a
94n/a PtrGlbNext = Record()
95n/a PtrGlb = Record()
96n/a PtrGlb.PtrComp = PtrGlbNext
97n/a PtrGlb.Discr = Ident1
98n/a PtrGlb.EnumComp = Ident3
99n/a PtrGlb.IntComp = 40
100n/a PtrGlb.StringComp = "DHRYSTONE PROGRAM, SOME STRING"
101n/a String1Loc = "DHRYSTONE PROGRAM, 1'ST STRING"
102n/a Array2Glob[8][7] = 10
103n/a
104n/a starttime = clock()
105n/a
106n/a for i in range(loops):
107n/a Proc5()
108n/a Proc4()
109n/a IntLoc1 = 2
110n/a IntLoc2 = 3
111n/a String2Loc = "DHRYSTONE PROGRAM, 2'ND STRING"
112n/a EnumLoc = Ident2
113n/a BoolGlob = not Func2(String1Loc, String2Loc)
114n/a while IntLoc1 < IntLoc2:
115n/a IntLoc3 = 5 * IntLoc1 - IntLoc2
116n/a IntLoc3 = Proc7(IntLoc1, IntLoc2)
117n/a IntLoc1 = IntLoc1 + 1
118n/a Proc8(Array1Glob, Array2Glob, IntLoc1, IntLoc3)
119n/a PtrGlb = Proc1(PtrGlb)
120n/a CharIndex = 'A'
121n/a while CharIndex <= Char2Glob:
122n/a if EnumLoc == Func1(CharIndex, 'C'):
123n/a EnumLoc = Proc6(Ident1)
124n/a CharIndex = chr(ord(CharIndex)+1)
125n/a IntLoc3 = IntLoc2 * IntLoc1
126n/a IntLoc2 = IntLoc3 / IntLoc1
127n/a IntLoc2 = 7 * (IntLoc3 - IntLoc2) - IntLoc1
128n/a IntLoc1 = Proc2(IntLoc1)
129n/a
130n/a benchtime = clock() - starttime - nulltime
131n/a if benchtime == 0.0:
132n/a loopsPerBenchtime = 0.0
133n/a else:
134n/a loopsPerBenchtime = (loops / benchtime)
135n/a return benchtime, loopsPerBenchtime
136n/a
137n/adef Proc1(PtrParIn):
138n/a PtrParIn.PtrComp = NextRecord = PtrGlb.copy()
139n/a PtrParIn.IntComp = 5
140n/a NextRecord.IntComp = PtrParIn.IntComp
141n/a NextRecord.PtrComp = PtrParIn.PtrComp
142n/a NextRecord.PtrComp = Proc3(NextRecord.PtrComp)
143n/a if NextRecord.Discr == Ident1:
144n/a NextRecord.IntComp = 6
145n/a NextRecord.EnumComp = Proc6(PtrParIn.EnumComp)
146n/a NextRecord.PtrComp = PtrGlb.PtrComp
147n/a NextRecord.IntComp = Proc7(NextRecord.IntComp, 10)
148n/a else:
149n/a PtrParIn = NextRecord.copy()
150n/a NextRecord.PtrComp = None
151n/a return PtrParIn
152n/a
153n/adef Proc2(IntParIO):
154n/a IntLoc = IntParIO + 10
155n/a while 1:
156n/a if Char1Glob == 'A':
157n/a IntLoc = IntLoc - 1
158n/a IntParIO = IntLoc - IntGlob
159n/a EnumLoc = Ident1
160n/a if EnumLoc == Ident1:
161n/a break
162n/a return IntParIO
163n/a
164n/adef Proc3(PtrParOut):
165n/a global IntGlob
166n/a
167n/a if PtrGlb is not None:
168n/a PtrParOut = PtrGlb.PtrComp
169n/a else:
170n/a IntGlob = 100
171n/a PtrGlb.IntComp = Proc7(10, IntGlob)
172n/a return PtrParOut
173n/a
174n/adef Proc4():
175n/a global Char2Glob
176n/a
177n/a BoolLoc = Char1Glob == 'A'
178n/a BoolLoc = BoolLoc or BoolGlob
179n/a Char2Glob = 'B'
180n/a
181n/adef Proc5():
182n/a global Char1Glob
183n/a global BoolGlob
184n/a
185n/a Char1Glob = 'A'
186n/a BoolGlob = FALSE
187n/a
188n/adef Proc6(EnumParIn):
189n/a EnumParOut = EnumParIn
190n/a if not Func3(EnumParIn):
191n/a EnumParOut = Ident4
192n/a if EnumParIn == Ident1:
193n/a EnumParOut = Ident1
194n/a elif EnumParIn == Ident2:
195n/a if IntGlob > 100:
196n/a EnumParOut = Ident1
197n/a else:
198n/a EnumParOut = Ident4
199n/a elif EnumParIn == Ident3:
200n/a EnumParOut = Ident2
201n/a elif EnumParIn == Ident4:
202n/a pass
203n/a elif EnumParIn == Ident5:
204n/a EnumParOut = Ident3
205n/a return EnumParOut
206n/a
207n/adef Proc7(IntParI1, IntParI2):
208n/a IntLoc = IntParI1 + 2
209n/a IntParOut = IntParI2 + IntLoc
210n/a return IntParOut
211n/a
212n/adef Proc8(Array1Par, Array2Par, IntParI1, IntParI2):
213n/a global IntGlob
214n/a
215n/a IntLoc = IntParI1 + 5
216n/a Array1Par[IntLoc] = IntParI2
217n/a Array1Par[IntLoc+1] = Array1Par[IntLoc]
218n/a Array1Par[IntLoc+30] = IntLoc
219n/a for IntIndex in range(IntLoc, IntLoc+2):
220n/a Array2Par[IntLoc][IntIndex] = IntLoc
221n/a Array2Par[IntLoc][IntLoc-1] = Array2Par[IntLoc][IntLoc-1] + 1
222n/a Array2Par[IntLoc+20][IntLoc] = Array1Par[IntLoc]
223n/a IntGlob = 5
224n/a
225n/adef Func1(CharPar1, CharPar2):
226n/a CharLoc1 = CharPar1
227n/a CharLoc2 = CharLoc1
228n/a if CharLoc2 != CharPar2:
229n/a return Ident1
230n/a else:
231n/a return Ident2
232n/a
233n/adef Func2(StrParI1, StrParI2):
234n/a IntLoc = 1
235n/a while IntLoc <= 1:
236n/a if Func1(StrParI1[IntLoc], StrParI2[IntLoc+1]) == Ident1:
237n/a CharLoc = 'A'
238n/a IntLoc = IntLoc + 1
239n/a if CharLoc >= 'W' and CharLoc <= 'Z':
240n/a IntLoc = 7
241n/a if CharLoc == 'X':
242n/a return TRUE
243n/a else:
244n/a if StrParI1 > StrParI2:
245n/a IntLoc = IntLoc + 7
246n/a return TRUE
247n/a else:
248n/a return FALSE
249n/a
250n/adef Func3(EnumParIn):
251n/a EnumLoc = EnumParIn
252n/a if EnumLoc == Ident3: return TRUE
253n/a return FALSE
254n/a
255n/aif __name__ == '__main__':
256n/a import sys
257n/a def error(msg):
258n/a print >>sys.stderr, msg,
259n/a print >>sys.stderr, "usage: %s [number_of_loops]" % sys.argv[0]
260n/a sys.exit(100)
261n/a nargs = len(sys.argv) - 1
262n/a if nargs > 1:
263n/a error("%d arguments are too many;" % nargs)
264n/a elif nargs == 1:
265n/a try: loops = int(sys.argv[1])
266n/a except ValueError:
267n/a error("Invalid argument %r;" % sys.argv[1])
268n/a else:
269n/a loops = LOOPS
270n/a main(loops)