Changeset bd0e07 in git


Ignore:
Timestamp:
Mar 21, 2018, 5:50:21 PM (5 years ago)
Author:
Hans Schoenemann <hannes@…>
Branches:
(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'a657104b677b4c461d018cbf3204d72d34ad66a9')
Children:
caf8c65d1b9e21816d4d531841968cbefef2fecb
Parents:
1932d5c7bedae52a208f2b9636b004a4cd5dfad0
Message:
fix: julia-debug version
Location:
kernel
Files:
5 edited

Legend:

Unmodified
Added
Removed
  • kernel/GBEngine/tgb.cc

    r1932d5c rbd0e07  
    44654465  kStrategy strat = c->strat;
    44664466
     4467  #ifndef SING_NDEBUG
    44674468  assume (startf <= losl);
    44684469  assume ((startf == losl - 1)
    44694470          || (pLmCmp (los[startf].p, los[startf + 1].p) == -1));
     4471  #endif
    44704472  int i = startf;
    44714473
     
    44734475  while(i >= 0)
    44744476  {
     4477    #ifndef SING_NDEBUG
    44754478    assume ((i == losl - 1) || (pLmCmp (los[i].p, los[i + 1].p) <= 0));
     4479    #endif
    44764480    assume (is_valid_ro (los[i]));
    44774481    j = kFindDivisibleByInS_easy (strat, los[i]);
     
    44874491
    44884492      erg.to_reduce_l = i2;
     4493      #ifndef SING_NDEBUG
    44894494      assume ((i == losl - 1) || (pLmCmp (los[i].p, los[i + 1].p) == -1));
     4495      #endif
    44904496      canonicalize_region (los, erg.to_reduce_u + 1, startf, c);
    44914497      return;
     
    45044510        erg.reduce_by = i;
    45054511        erg.fromS = FALSE;
     4512        #ifndef SING_NDEBUG
    45064513        assume ((i == losl - 1) || (pLmCmp (los[i].p, los[i + 1].p) == -1));
     4514        #endif
    45074515        canonicalize_region (los, erg.to_reduce_u + 1, startf, c);
    45084516        return;
  • kernel/GBEngine/tgb_internal.h

    r1932d5c rbd0e07  
    936936      assume(!(npIsZero((number)(long) buffer[bpos],currRing->cf)));
    937937      STATISTIC(n_Add); temp_array[idx]=F4mat_to_number_type(npAddM((number)(long) temp_array[idx], (number)(long) buffer[bpos++],currRing->cf));
     938      #ifndef SING_NDEBUG
    938939      assume(idx<temp_size);
     940      #endif
    939941    }
    940942
     
    982984      //assume(!(npIsZero((number) buffer[bpos])));
    983985      STATISTIC(n_Add); temp_array[i]=F4mat_to_number_type(npAddM((number)(long) temp_array[i], (number)(long) buffer[bpos++],currRing->cf));
     986      #ifndef SING_NDEBUG
    984987      assume(i<temp_size);
     988      #endif
    985989    }
    986990
     
    10071011  {
    10081012      STATISTIC(n_Add); temp_array[i]=F4mat_to_number_type(npAddM((number)(long) temp_array[i], (number)(long) row[i],currRing->cf));
     1013      #ifndef SING_NDEBUG
    10091014      assume(i<temp_size);
     1015      #endif
    10101016  }
    10111017
     
    10321038
    10331039      STATISTIC(n_Sub); temp_array[i]=F4mat_to_number_type(npSubM((number)(long) temp_array[i], (number)(long) row[i],currRing->cf));
     1040      #ifndef SING_NDEBUG
    10341041      assume(i<temp_size);
     1042      #endif
    10351043  }
    10361044
     
    10521060          int idx=idx_array[j];
    10531061          STATISTIC(n_Add); temp_array[idx]=F4mat_to_number_type(   (number_type)(long)npAddM((number) (long)temp_array[idx],(number)(long) coef_array[j],currRing->cf));
     1062          #ifndef SING_NDEBUG
    10541063          assume(idx<temp_size);
     1064          #endif
    10551065        }
    10561066}
     
    10701080          int idx=idx_array[j];
    10711081          STATISTIC(n_Sub); temp_array[idx]=F4mat_to_number_type(  (number_type)(long) npSubM((number) (long)temp_array[idx],(number)(long) coef_array[j],currRing->cf));
     1082          #ifndef SING_NDEBUG
    10721083          assume(idx<temp_size);
     1084          #endif
    10731085        }
    10741086}
  • kernel/linear_algebra/Minor.cc

    r1932d5c rbd0e07  
    390390    result.setColumnKey(columnBlock, newColumnBits);
    391391
     392  #ifndef SING_NDEBUG
    392393  /* let's check that the number of selected rows and columns are equal;
    393394     (this check is only performed in the debug version) */
    394395  assume(result.getSetBits(1) == result.getSetBits(2));
     396  #endif
    395397
    396398  return result;
  • kernel/linear_algebra/Minor.h

    r1932d5c rbd0e07  
    22#define MINOR_H
    33
     4#include "kernel/mod2.h"
    45#include "polys/monomials/ring.h"
    56#include "kernel/polys.h"
  • kernel/mod2.h

    r1932d5c rbd0e07  
    133133/* #define MAX_INT_LEN 11 */
    134134
    135 
    136 #ifdef DO_PROFILE
    137 /* define to enable explicit profiling of some crucial inline
    138  * routines and defines  */
    139 #undef DO_DEEP_PROFILE
    140 #endif
    141 
    142 /* define to enable assume */
    143 #ifndef HAVE_ASSUME
    144 #undef HAVE_ASSUME
    145 #endif
    146135
    147136/* define LINKAGE to "extern C" if compiling for shared libs */
     
    398387#define r_assume(x) do {} while (0)
    399388#else /* ! HAVE_ASSUME */
    400 #ifdef SING_NDEBUG
    401 #undef SING_NDEBUG
    402 #endif
    403389
    404390#define assume_violation(s,f,l) \
Note: See TracChangeset for help on using the changeset viewer.