1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
# -*- coding: utf-8 -*-
# Copyright (C) 2015-2016 Martin Sandve Alnæs
#
# This file is part of DIJITSO.
#
# DIJITSO is free software: you can redistribute it and/or modify
# it under the terms of the GNU Lesser General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# DIJITSO is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public License
# along with DIJITSO. If not, see <http://www.gnu.org/licenses/>.
import pytest
import shutil
import os
@pytest.fixture(params=["root", "node", "process"])
def buildon(request):
return request.param
def test_mpi_jit_strategies(comm, jit_integer, buildon):
"""Jit a simple code generated by inserting a simple integer.
Covers (if the cache is initially empty):
- memory cache miss
- memory cache hit
- compiling
- loading
- factory function extraction
"""
# Note: this test was initially copied from
# test_core_jit_framework in test_dijitso.py
print(buildon, comm.rank)
if buildon == "process":
# One dir per process
dijitso_cache_dir = ".test_dijitso_%d" % (comm.rank,)
elif buildon == "node":
# Less dirs than processes (gives some waiting for size > 2)
dijitso_cache_dir = ".test_dijitso_%d" % (comm.rank % 2,)
elif buildon == "root":
# Less dirs than processes (gives a combination of copying
# (size>1) and waiting (size>2))
dijitso_cache_dir = ".test_dijitso_%d" % (comm.rank % 2,)
dijitso_cache_dir = os.path.join(os.path.dirname(__file__),
dijitso_cache_dir)
shutil.rmtree(dijitso_cache_dir, ignore_errors=True)
comm.barrier()
# This magic value is defined in testincludes/testinclude.h,
# so this is used to confirm that includes work correctly.
# Also the fact that the #include "testinclude.h" above compiles.
magic_value = 42
stored = {}
for repeat in range(2):
for jitable in (234, 567): # Note different values than serial test
# Each integer produces different code
lib, factory, gettr = jit_integer(jitable, comm=comm,
buildon=buildon,
dijitso_cache_dir=dijitso_cache_dir)
# Inspect values for testing
assert jitable + magic_value == gettr(factory())
# Memory cache test
if repeat == 0:
# Make a record of this lib
stored[jitable] = lib
else:
# Check that we fetched the lib from the memory cache
assert lib is stored[jitable]
# If all went well we clean up, if assertions triggered
# above we allow this cleanup to not happen
shutil.rmtree(dijitso_cache_dir, ignore_errors=True)
comm.barrier()
# TODO: Cover various failure situations with tests
|
