Multiple python versions (#42)

* Support multiple Python versions in single build

* RPATH + Split up config into config and runtime

* pybind11 submodule

* Docker build updates

examples/python/builtin.py

@@ -1,7 +1,10 @@
 #!@PYTHON_EXECUTABLE@
 
+import os
 import sys
-import numpy as np
+import random
+
+_prefix = ""
 
 
 def fib(n):
@@ -9,28 +12,41 @@ def fib(n):
 
 
 def inefficient(n):
-    print(f"inefficient: {n}")
+    print(f"[{_prefix}] ... running inefficient({n})")
     a = 0
     for i in range(n):
         a += i
         for j in range(n):
             a += j
-    arr = np.random.rand(a * n * n * n)
-    sum = arr.sum()
-    print(f"sum: {sum}")
-    return sum
+    _len = a * n * n * n
+    _arr = [random.random() for _ in range(_len)]
+    _sum = sum(_arr)
+    print(f"[{_prefix}] ... sum of {_len} random elements: {_sum}")
+    return _sum
 
 
 @profile
-def run(nfib):
-    ret = 0
-    ret += fib(nfib)
-    ret += inefficient(nfib)
-    return ret
+def run(n):
+    _ret = 0
+    _ret += fib(n)
+    _ret += inefficient(n)
+    return _ret
 
 
 if __name__ == "__main__":
-    nfib = int(sys.argv[1]) if len(sys.argv) > 1 else 20
-    for i in range(5):
-        ans = run(nfib)
-        print(f"[{i}] fibonacci({nfib}) = {ans}")
+    import argparse
+
+    parser = argparse.ArgumentParser()
+    parser.add_argument(
+        "-n", "--num-iterations", help="Number", type=int, default=3
+    )
+    parser.add_argument(
+        "-v", "--value", help="Starting value", type=int, default=20
+    )
+    args = parser.parse_args()
+
+    _prefix = os.path.basename(__file__)
+    print(f"[{_prefix}] Executing {args.num_iterations} iterations...\n")
+    for i in range(args.num_iterations):
+        ans = run(args.value)
+        print(f"[{_prefix}] [{i}] result of run({args.value}) = {ans}\n")

examples/python/external.py

@@ -1,7 +1,10 @@
 #!@PYTHON_EXECUTABLE@
 
+import os
 import sys
-import numpy as np
+import random
+
+_prefix = ""
 
 
 def fib(n):
@@ -9,27 +12,40 @@ def fib(n):
 
 
 def inefficient(n):
-    print(f"inefficient: {n}")
+    print(f"[{_prefix}] ... running inefficient({n})")
     a = 0
     for i in range(n):
         a += i
         for j in range(n):
             a += j
-    arr = np.random.rand(a * n * n * n)
-    sum = arr.sum()
-    print(f"sum: {sum}")
-    return sum
+    _len = a * n * n * n
+    _arr = [random.random() for _ in range(_len)]
+    _sum = sum(_arr)
+    print(f"[{_prefix}] ... sum of {_len} random elements: {_sum}")
+    return _sum
 
 
-def run(nfib):
-    ret = 0
-    ret += fib(nfib)
-    ret += inefficient(nfib)
-    return ret
+def run(n):
+    _ret = 0
+    _ret += fib(n)
+    _ret += inefficient(n)
+    return _ret
 
 
 if __name__ == "__main__":
-    nfib = int(sys.argv[1]) if len(sys.argv) > 1 else 20
-    for i in range(5):
-        ans = run(nfib)
-        print(f"[{i}] fibonacci({nfib}) = {ans}")
+    import argparse
+
+    parser = argparse.ArgumentParser()
+    parser.add_argument(
+        "-n", "--num-iterations", help="Number", type=int, default=3
+    )
+    parser.add_argument(
+        "-v", "--value", help="Starting value", type=int, default=20
+    )
+    args = parser.parse_args()
+
+    _prefix = os.path.basename(__file__)
+    print(f"[{_prefix}] Executing {args.num_iterations} iterations...\n")
+    for i in range(args.num_iterations):
+        ans = run(args.value)
+        print(f"[{_prefix}] [{i}] result of run({args.value}) = {ans}\n")

examples/python/pyproject.toml

@@ -0,0 +1,5 @@
+
+[tool.black]
+line-length = 80
+target-version = ['py38']
+include = '\.py'

examples/python/source.py

@@ -1,36 +1,73 @@
 #!@PYTHON_EXECUTABLE@
 
+import os
 import sys
-import numpy as np
 import omnitrace
 
+_prefix = ""
+
+
 def fib(n):
     return n if n < 2 else (fib(n - 1) + fib(n - 2))
 
 
-def inefficient(n):
-    print(f"inefficient: {n}")
-    a = 0
-    for i in range(n):
-        a += i
-        for j in range(n):
-            a += j
-    arr = np.random.rand(a * n * n * n)
-    sum = arr.sum()
-    print(f"sum: {sum}")
-    return sum
+try:
+    import numpy as np
+
+    def inefficient(n):
+        print(f"[{_prefix}] ... running inefficient({n})")
+        a = 0
+        for i in range(n):
+            a += i
+            for j in range(n):
+                a += j
+        _len = a * n * n * n
+        _ret = np.random.rand(_len).sum()
+        print(f"[{_prefix}] ... sum of {_len} random elements: {_ret}")
+        return _ret
+
+except ImportError:
+    import random
+
+    def _sum(arr):
+        return sum(arr)
+
+    def inefficient(n):
+        print(f"[{_prefix}] ... running inefficient({n})")
+        a = 0
+        for i in range(n):
+            a += i
+            for j in range(n):
+                a += j
+        _len = a * n * n * n
+        _arr = [random.random() for _ in range(_len)]
+        _ret = _sum(_arr)
+        print(f"[{_prefix}] ... sum of {_len} random elements: {_ret}")
+        return _ret
 
 
 @omnitrace.profile()
-def run(nfib):
-    ret = 0
-    ret += fib(nfib)
-    ret += inefficient(nfib)
-    return ret
+def run(n):
+    _ret = 0
+    _ret += fib(n)
+    _ret += inefficient(n)
+    return _ret
 
 
 if __name__ == "__main__":
-    nfib = int(sys.argv[1]) if len(sys.argv) > 1 else 20
-    for i in range(5):
-        ans = run(nfib)
-        print(f"[{i}] fibonacci({nfib}) = {ans}")
+    import argparse
+
+    parser = argparse.ArgumentParser()
+    parser.add_argument(
+        "-n", "--num-iterations", help="Number", type=int, default=3
+    )
+    parser.add_argument(
+        "-v", "--value", help="Starting value", type=int, default=20
+    )
+    args = parser.parse_args()
+
+    _prefix = os.path.basename(__file__)
+    print(f"[{_prefix}] Executing {args.num_iterations} iterations...\n")
+    for i in range(args.num_iterations):
+        ans = run(args.value)
+        print(f"[{_prefix}] [{i}] result of run({args.value}) = {ans}\n")