[LNT] Python 3 support: use Python 2's division behavior

Summary:
Adapt all divisions to use a call to old_div to maintain Python 2's
division behavior in legacy code. Also import Python 3's division
behavior by default. This was produced by running futurize's stage2
libfuturize.fixes.fix_division_safe.

Reviewers: cmatthews, hubert.reinterpretcast, kristof.beyls

Subscribers: llvm-commits

Differential Revision: https://reviews.llvm.org/D67821

Author: Thomas Preud'homme

lnt/external/stats/pstat.py

@@ -138,24 +138,24 @@ def abut (source,*args):
             addon = [addon]
         if len(addon) < len(source):                # is source list longer?
             if len(source) % len(addon) == 0:        # are they integer multiples?
-                repeats = len(source)/len(addon)    # repeat addon n times
+                repeats = len(source) // len(addon)    # repeat addon n times
                 origadd = copy.deepcopy(addon)
                 for i in range(repeats-1):
                     addon = addon + origadd
             else:
-                repeats = len(source)/len(addon)+1  # repeat addon x times,
+                repeats = len(source) // len(addon) + 1  # repeat addon x times,
                 origadd = copy.deepcopy(addon)      #    x is NOT an integer
                 for i in range(repeats-1):
                     addon = addon + origadd
                     addon = addon[0:len(source)]
         elif len(source) < len(addon):                # is addon list longer?
             if len(addon) % len(source) == 0:        # are they integer multiples?
-                repeats = len(addon)/len(source)    # repeat source n times
+                repeats = len(addon) // len(source)    # repeat source n times
                 origsour = copy.deepcopy(source)
                 for i in range(repeats-1):
                     source = source + origsour
             else:
-                repeats = len(addon)/len(source)+1  # repeat source x times,
+                repeats = len(addon) // len(source) + 1  # repeat source x times,
                 origsour = copy.deepcopy(source)    #   x is NOT an integer
                 for i in range(repeats-1):
                     source = source + origsour

lnt/external/stats/stats.py

@@ -340,10 +340,10 @@ def lmedianscore (inlist):
 
     newlist = sorted(copy.deepcopy(inlist))
     if len(newlist) % 2 == 0:   # if even number of scores, average middle 2
-        index = len(newlist)/2  # integer division correct
+        index = len(newlist) // 2  # integer division correct
         median = float(newlist[index] + newlist[index-1]) /2
     else:
-        index = len(newlist)/2  # int divsion gives mid value when count from 0
+        index = len(newlist) // 2  # int divsion gives mid value when count from 0
         median = newlist[index]
     return median
 
@@ -1747,7 +1747,7 @@ def lshellsort(inlist):
     n = len(inlist)
     svec = copy.deepcopy(inlist)
     ivec = range(n)
-    gap = n/2   # integer division needed
+    gap = n // 2   # integer division needed
     while gap >0:
         for i in range(gap,n):
             for j in range(i-gap,-1,-gap):
@@ -1758,7 +1758,7 @@ def lshellsort(inlist):
                     itemp       = ivec[j]
                     ivec[j]     = ivec[j+gap]
                     ivec[j+gap] = itemp
-        gap = gap / 2  # integer division needed
+        gap = gap // 2  # integer division needed
 # svec is now sorted inlist, and ivec has the order svec[i] = vec[ivec[i]]
     return svec, ivec
 
@@ -4260,7 +4260,7 @@ def ashellsort(inarray):
     n = len(inarray)
     svec = inarray *1.0
     ivec = range(n)
-    gap = n/2   # integer division needed
+    gap = n // 2   # integer division needed
     while gap >0:
         for i in range(gap,n):
             for j in range(i-gap,-1,-gap):
@@ -4271,7 +4271,7 @@ def ashellsort(inarray):
                     itemp       = ivec[j]
                     ivec[j]     = ivec[j+gap]
                     ivec[j+gap] = itemp
-        gap = gap / 2  # integer division needed
+        gap = gap // 2  # integer division needed
 #    svec is now sorted input vector, ivec has the order svec[i] = vec[ivec[i]]
     return svec, ivec
 

lnt/server/db/rules/rule_update_profile_stats.py

@@ -35,7 +35,7 @@ def update_profile_stats(session, ts, run_id):
 
     for f in glob.glob('%s/*.lntprof' % profile_path):
         mtime = os.stat(f).st_mtime
-        sz = os.stat(f).st_size / 1000
+        sz = os.stat(f).st_size // 1000
         age.append([mtime, sz])
 
     open(history_path, 'w').write(json.dumps(history))

lnt/server/reporting/dailyreport.py

@@ -46,7 +46,7 @@ def get_query_parameters_string(self):
             "{}={}".format(
                 urllib.quote_plus(query_param), urllib.quote_plus(str(value)))
             for query_param, value in (
-                ("day_start", self.day_start_offset.seconds / 3600),
+                ("day_start", self.day_start_offset.seconds // 3600),
                 ("num_days", self.num_prior_days_to_include),
                 ("filter-machine-regex", self.filter_machine_regex_str),)
             if value is not None]