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

Python code coverage for Lib/test/pystone.py

#countcontent
1n/a#! /usr/bin/env python3
2n/a
3n/a"""
4n/a"PYSTONE" Benchmark Program
5n/a
6n/aVersion: Python/1.2 (corresponds to C/1.1 plus 3 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 Version 1.2 changes the division to floor division.
34n/a
35n/a Under Python 3 version 1.1 would use the normal division
36n/a operator, resulting in some of the operations mistakenly
37n/a yielding floats. Version 1.2 instead uses floor division
38n/a making the benchmark an integer benchmark again.
39n/a
40n/a"""
41n/a
42n/aLOOPS = 50000
43n/a
44n/afrom time import time
45n/a
46n/a__version__ = "1.2"
47n/a
48n/a[Ident1, Ident2, Ident3, Ident4, Ident5] = range(1, 6)
49n/a
50n/aclass Record:
51n/a
52n/a def __init__(self, PtrComp = None, Discr = 0, EnumComp = 0,
53n/a IntComp = 0, StringComp = 0):
54n/a self.PtrComp = PtrComp
55n/a self.Discr = Discr
56n/a self.EnumComp = EnumComp
57n/a self.IntComp = IntComp
58n/a self.StringComp = StringComp
59n/a
60n/a def copy(self):
61n/a return Record(self.PtrComp, self.Discr, self.EnumComp,
62n/a self.IntComp, self.StringComp)
63n/a
64n/aTRUE = 1
65n/aFALSE = 0
66n/a
67n/adef main(loops=LOOPS):
68n/a benchtime, stones = pystones(loops)
69n/a print("Pystone(%s) time for %d passes = %g" % \
70n/a (__version__, loops, benchtime))
71n/a print("This machine benchmarks at %g pystones/second" % stones)
72n/a
73n/a
74n/adef pystones(loops=LOOPS):
75n/a return Proc0(loops)
76n/a
77n/aIntGlob = 0
78n/aBoolGlob = FALSE
79n/aChar1Glob = '\0'
80n/aChar2Glob = '\0'
81n/aArray1Glob = [0]*51
82n/aArray2Glob = [x[:] for x in [Array1Glob]*51]
83n/aPtrGlb = None
84n/aPtrGlbNext = None
85n/a
86n/adef Proc0(loops=LOOPS):
87n/a global IntGlob
88n/a global BoolGlob
89n/a global Char1Glob
90n/a global Char2Glob
91n/a global Array1Glob
92n/a global Array2Glob
93n/a global PtrGlb
94n/a global PtrGlbNext
95n/a
96n/a starttime = time()
97n/a for i in range(loops):
98n/a pass
99n/a nulltime = time() - starttime
100n/a
101n/a PtrGlbNext = Record()
102n/a PtrGlb = Record()
103n/a PtrGlb.PtrComp = PtrGlbNext
104n/a PtrGlb.Discr = Ident1
105n/a PtrGlb.EnumComp = Ident3
106n/a PtrGlb.IntComp = 40
107n/a PtrGlb.StringComp = "DHRYSTONE PROGRAM, SOME STRING"
108n/a String1Loc = "DHRYSTONE PROGRAM, 1'ST STRING"
109n/a Array2Glob[8][7] = 10
110n/a
111n/a starttime = time()
112n/a
113n/a for i in range(loops):
114n/a Proc5()
115n/a Proc4()
116n/a IntLoc1 = 2
117n/a IntLoc2 = 3
118n/a String2Loc = "DHRYSTONE PROGRAM, 2'ND STRING"
119n/a EnumLoc = Ident2
120n/a BoolGlob = not Func2(String1Loc, String2Loc)
121n/a while IntLoc1 < IntLoc2:
122n/a IntLoc3 = 5 * IntLoc1 - IntLoc2
123n/a IntLoc3 = Proc7(IntLoc1, IntLoc2)
124n/a IntLoc1 = IntLoc1 + 1
125n/a Proc8(Array1Glob, Array2Glob, IntLoc1, IntLoc3)
126n/a PtrGlb = Proc1(PtrGlb)
127n/a CharIndex = 'A'
128n/a while CharIndex <= Char2Glob:
129n/a if EnumLoc == Func1(CharIndex, 'C'):
130n/a EnumLoc = Proc6(Ident1)
131n/a CharIndex = chr(ord(CharIndex)+1)
132n/a IntLoc3 = IntLoc2 * IntLoc1
133n/a IntLoc2 = IntLoc3 // IntLoc1
134n/a IntLoc2 = 7 * (IntLoc3 - IntLoc2) - IntLoc1
135n/a IntLoc1 = Proc2(IntLoc1)
136n/a
137n/a benchtime = time() - starttime - nulltime
138n/a if benchtime == 0.0:
139n/a loopsPerBenchtime = 0.0
140n/a else:
141n/a loopsPerBenchtime = (loops / benchtime)
142n/a return benchtime, loopsPerBenchtime
143n/a
144n/adef Proc1(PtrParIn):
145n/a PtrParIn.PtrComp = NextRecord = PtrGlb.copy()
146n/a PtrParIn.IntComp = 5
147n/a NextRecord.IntComp = PtrParIn.IntComp
148n/a NextRecord.PtrComp = PtrParIn.PtrComp
149n/a NextRecord.PtrComp = Proc3(NextRecord.PtrComp)
150n/a if NextRecord.Discr == Ident1:
151n/a NextRecord.IntComp = 6
152n/a NextRecord.EnumComp = Proc6(PtrParIn.EnumComp)
153n/a NextRecord.PtrComp = PtrGlb.PtrComp
154n/a NextRecord.IntComp = Proc7(NextRecord.IntComp, 10)
155n/a else:
156n/a PtrParIn = NextRecord.copy()
157n/a NextRecord.PtrComp = None
158n/a return PtrParIn
159n/a
160n/adef Proc2(IntParIO):
161n/a IntLoc = IntParIO + 10
162n/a while 1:
163n/a if Char1Glob == 'A':
164n/a IntLoc = IntLoc - 1
165n/a IntParIO = IntLoc - IntGlob
166n/a EnumLoc = Ident1
167n/a if EnumLoc == Ident1:
168n/a break
169n/a return IntParIO
170n/a
171n/adef Proc3(PtrParOut):
172n/a global IntGlob
173n/a
174n/a if PtrGlb is not None:
175n/a PtrParOut = PtrGlb.PtrComp
176n/a else:
177n/a IntGlob = 100
178n/a PtrGlb.IntComp = Proc7(10, IntGlob)
179n/a return PtrParOut
180n/a
181n/adef Proc4():
182n/a global Char2Glob
183n/a
184n/a BoolLoc = Char1Glob == 'A'
185n/a BoolLoc = BoolLoc or BoolGlob
186n/a Char2Glob = 'B'
187n/a
188n/adef Proc5():
189n/a global Char1Glob
190n/a global BoolGlob
191n/a
192n/a Char1Glob = 'A'
193n/a BoolGlob = FALSE
194n/a
195n/adef Proc6(EnumParIn):
196n/a EnumParOut = EnumParIn
197n/a if not Func3(EnumParIn):
198n/a EnumParOut = Ident4
199n/a if EnumParIn == Ident1:
200n/a EnumParOut = Ident1
201n/a elif EnumParIn == Ident2:
202n/a if IntGlob > 100:
203n/a EnumParOut = Ident1
204n/a else:
205n/a EnumParOut = Ident4
206n/a elif EnumParIn == Ident3:
207n/a EnumParOut = Ident2
208n/a elif EnumParIn == Ident4:
209n/a pass
210n/a elif EnumParIn == Ident5:
211n/a EnumParOut = Ident3
212n/a return EnumParOut
213n/a
214n/adef Proc7(IntParI1, IntParI2):
215n/a IntLoc = IntParI1 + 2
216n/a IntParOut = IntParI2 + IntLoc
217n/a return IntParOut
218n/a
219n/adef Proc8(Array1Par, Array2Par, IntParI1, IntParI2):
220n/a global IntGlob
221n/a
222n/a IntLoc = IntParI1 + 5
223n/a Array1Par[IntLoc] = IntParI2
224n/a Array1Par[IntLoc+1] = Array1Par[IntLoc]
225n/a Array1Par[IntLoc+30] = IntLoc
226n/a for IntIndex in range(IntLoc, IntLoc+2):
227n/a Array2Par[IntLoc][IntIndex] = IntLoc
228n/a Array2Par[IntLoc][IntLoc-1] = Array2Par[IntLoc][IntLoc-1] + 1
229n/a Array2Par[IntLoc+20][IntLoc] = Array1Par[IntLoc]
230n/a IntGlob = 5
231n/a
232n/adef Func1(CharPar1, CharPar2):
233n/a CharLoc1 = CharPar1
234n/a CharLoc2 = CharLoc1
235n/a if CharLoc2 != CharPar2:
236n/a return Ident1
237n/a else:
238n/a return Ident2
239n/a
240n/adef Func2(StrParI1, StrParI2):
241n/a IntLoc = 1
242n/a while IntLoc <= 1:
243n/a if Func1(StrParI1[IntLoc], StrParI2[IntLoc+1]) == Ident1:
244n/a CharLoc = 'A'
245n/a IntLoc = IntLoc + 1
246n/a if CharLoc >= 'W' and CharLoc <= 'Z':
247n/a IntLoc = 7
248n/a if CharLoc == 'X':
249n/a return TRUE
250n/a else:
251n/a if StrParI1 > StrParI2:
252n/a IntLoc = IntLoc + 7
253n/a return TRUE
254n/a else:
255n/a return FALSE
256n/a
257n/adef Func3(EnumParIn):
258n/a EnumLoc = EnumParIn
259n/a if EnumLoc == Ident3: return TRUE
260n/a return FALSE
261n/a
262n/aif __name__ == '__main__':
263n/a import sys
264n/a def error(msg):
265n/a print(msg, end=' ', file=sys.stderr)
266n/a print("usage: %s [number_of_loops]" % sys.argv[0], file=sys.stderr)
267n/a sys.exit(100)
268n/a nargs = len(sys.argv) - 1
269n/a if nargs > 1:
270n/a error("%d arguments are too many;" % nargs)
271n/a elif nargs == 1:
272n/a try: loops = int(sys.argv[1])
273n/a except ValueError:
274n/a error("Invalid argument %r;" % sys.argv[1])
275n/a else:
276n/a loops = LOOPS
277n/a main(loops)