@@ -863,7 +863,7 @@ \subsection{Int32 and Int64 Constants}
863
863
/* set the number to 654321 (note this is bigger than 127) */
864
864
mp_set_u32(&number, 654321);
865
865
866
- printf("number == \%lu" , mp_get_i32(&number));
866
+ printf("number == \%" PRIi32 , mp_get_i32(&number));
867
867
868
868
/* we're done with it. */
869
869
mp_clear(&number);
@@ -894,6 +894,7 @@ \subsection{Long Constants - platform dependant}
894
894
\begin {alltt }
895
895
long mp_get_l (mp_int * a);
896
896
unsigned long mp_get_ul (mp_int * a);
897
+ unsigned long mp_get_magl (mp_int * a);
897
898
\end {alltt }
898
899
899
900
This will return the least significant bits of the mp\_ int $ a$ that fit into a `` long'' .
@@ -930,7 +931,7 @@ \subsection{Initialize and Setting Constants}
930
931
\}
931
932
932
933
/* display */
933
- printf("Number1, Number2 == \%lu , \%lu" ,
934
+ printf("Number1, Number2 == \%" PRIi32 " , \%" PRIi32 ,
934
935
mp_get_i32(&number1), mp_get_i32(&number2));
935
936
936
937
/* clear */
@@ -1377,7 +1378,7 @@ \section{Multiplication}
1377
1378
\}
1378
1379
1379
1380
/* display */
1380
- printf("number1 * number2 == \%lu" , mp_get_i32(&number1));
1381
+ printf("number1 * number2 == \%" PRIi32 , mp_get_i32(&number1));
1381
1382
1382
1383
/* free terms and return */
1383
1384
mp_clear_multi(&number1, &number2, NULL);
0 commit comments