manual commit: put everything in a checked scope

Author: mwhicks1

bn.c

@@ -23,7 +23,7 @@ There may well be room for performance-optimizations and improvements.
 #include <assert.h>
 #include "bn.h"
 
-
+#pragma CHECKED_SCOPE on
 
 /* Functions for shifting number in-place. */
 static void _lshift_one_bit(_Ptr<struct bn> a);

bn.h

@@ -23,6 +23,8 @@ There may well be room for performance-optimizations and improvements.
 #include <stdint.h>
 #include <assert.h>
 
+#pragma CHECKED_SCOPE push
+#pragma CHECKED_SCOPE on
 
 /* This macro defines the word size in bytes of the array that constitues the big-number data structure. */
 #ifndef WORD_SIZE
@@ -117,6 +119,7 @@ void bignum_pow(_Ptr<struct bn> a, _Ptr<struct bn> b, _Ptr<struct bn> c); /* Cal
 void bignum_isqrt(_Ptr<struct bn> a, _Ptr<struct bn> b);             /* Integer square root -- e.g. isqrt(5) => 2*/
 void bignum_assign(_Ptr<struct bn> dst, _Ptr<struct bn> src);        /* Copy src into dst -- dst := src */
 
+#pragma CHECKED_SCOPE pop
 
 #endif /* #ifndef __BIGNUM_H__ */
 

tests/factorial.c

@@ -32,7 +32,7 @@
 #include <stdio.h>
 #include "bn.h"
 
-
+#pragma CHECKED_SCOPE on
 
 void factorial(_Ptr<struct bn> n, _Ptr<struct bn> res)
 {

tests/golden.c

@@ -1,6 +1,7 @@
 #include <stdio.h>
 #include "bn.h"
 
+#pragma CHECKED_SCOPE on
 
 /* For table-defined list of tests */
 struct test

tests/hand_picked.c

@@ -1,6 +1,7 @@
 #include <stdio.h>
 #include "bn.h"
 
+#pragma CHECKED_SCOPE on
 
 int npassed = 0;
 int ntests = 0;

tests/load_cmp.c

@@ -11,7 +11,7 @@
 #include <assert.h>
 #include "bn.h"
 
-
+#pragma CHECKED_SCOPE on
 
 int main(int argc, _Array_ptr<_Nt_array_ptr<char>> argv : count(argc))
 {

tests/randomized.c

@@ -4,7 +4,9 @@
 #include <string.h>
 #include "bn.h"
 
-void bignum_from_string_using_strlen(_Ptr<struct bn> n, _Nt_array_ptr<char> str) {
+#pragma CHECKED_SCOPE on
+
+_Unchecked void bignum_from_string_using_strlen(_Ptr<struct bn> n, _Nt_array_ptr<char> str) {
   int len = strlen(str);
   _Nt_array_ptr<char> str2 : count(len) =
     _Assume_bounds_cast<_Nt_array_ptr<char>>(str, count(len));

tests/rsa.c

@@ -40,6 +40,8 @@
 #include <string.h> /* for memcpy */
 #include "bn.h"
 
+#pragma CHECKED_SCOPE on
+
 /* O(log n) */
 void pow_mod_faster(_Ptr<struct bn> a, _Ptr<struct bn> b, _Ptr<struct bn> n, _Ptr<struct bn> res)
 {

tests/test_div_algo.c

@@ -2,6 +2,8 @@
 #include <stdio.h>
 #include "bn.h"
 
+#pragma CHECKED_SCOPE on
+
 /*
 
 Division algorithms using bitwise operations